Guyon Morée wrote: > Memory is no problem. It just needs to be as fast as possible, if > that's what this is, fine. > > If not, I'd like to find out what is :)
I'd say it is as fast as it can get - using hashing for lookups is O(n) in most cases, where bisection or other order-based lookups have O(log n) Additionally, dict lookups are fully written in C. Diez -- http://mail.python.org/mailman/listinfo/python-list
