Dan Stromberg <drsalists at gmail.com>: > This is not just a detail: O(1) tends to be beat O(logn) pretty easily > for large n. There is no O(1) hash table. Marko