Following links from this thread: http://groups.google.com/group/comp.lang.python/browse_thread/thread/179e1a45485ab36a#
I have found this perfect hash (minimal too) implementation: http://burtleburtle.net/bob/hash/perfect.html I have already translated part of it to D, and it seems to work well enough. As discussed in the PyConDue, I think this may be used in frozenset (and frozendict) to build a (minimal too?) perfect hash on the fly, to allow (hopefully) faster retrieval of items that don't change. That code is C and I think it's public domain, so if experiments show it gives enough speed up, it may be added to CPython 2.6/3. Bye, bearophile -- http://mail.python.org/mailman/listinfo/python-list
