MK wrote: > > In some book on algorithms I've read that after inserting limited > number of items performance of operating on hash tables > drops dramatically. My understanding is that Python dicts expand their hash tables before they become dangerously full, so this behaviour doesn't occur. Greg