"Duncan Booth" <[EMAIL PROTECTED]> wrote in message news:[EMAIL PROTECTED] > "Paul McGuire" <[EMAIL PROTECTED]> wrote: > >> By contrast, a set (and also the keys in a dict) use a tree structure >> to index more quickly into the list of items > > 'dict' and I believe also 'set' use a hash table, not a tree structure.
Thanks, I stand corrected. How do they know how big a hash table to use? I think this is an interesting problem. -- Paul -- http://mail.python.org/mailman/listinfo/python-list
