zhu_dave at yahoo.com
Tue Jan 10 17:31:47 EST 2006
I'm trying to clarify how Python avoids byte by byte
string comparisons most of the time. As I understand,
dictionaries keep strings, their keys (hash values),
and caches of their keys. Caching keys helps to avoid
recalculation of a string's hash value. So, when two
strings need to be compared, only their cached keys
are compared, which improves performance as there is
no need for byte by byte comparison.
Also, there is a global interning dictionary that
keeps interned strings. What I don't understand is why
strings are interned. How does it help with string
Do You Yahoo!?
Tired of spam? Yahoo! Mail has the best spam protection around
More information about the Python-list