Diez B. Roggisch <[EMAIL PROTECTED]> wrote:
> But what happens in case of a hash code clash? Then a list of (key, values)
> is stored, and for a passed key, each key in that list is additionally
> compared for being equal to the passed one. So another requirement of
> hashable objecst is the co
Very. Thanks much. :-)
h
--
http://mail.python.org/mailman/listinfo/python-list
That makes sense. Thanks. :-)
h
--
http://mail.python.org/mailman/listinfo/python-list
hawkmoon269 schrieb:
some other languages' hash table (Perl's, for instance). But FMU a
dictionary's keys are *themselves* hashed so that a hash table exists
that maps hashed key values to keys in the dictionary.
I guess you're mixing up the terms "hashing" and "storing in a hash-table".
When we
hawkmoon269 wrote:
> I've read in several places that a Python dictionary is analagous to
> some other languages' hash table (Perl's, for instance). But FMU a
> dictionary's keys are *themselves* hashed so that a hash table exists
> that maps hashed key values to keys in the dictionary. ISTM, th
I've read in several places that a Python dictionary is analagous to
some other languages' hash table (Perl's, for instance). But FMU a
dictionary's keys are *themselves* hashed so that a hash table exists
that maps hashed key values to keys in the dictionary. ISTM, then,
that the analogy is at l
