13 apr 2007 kl. 20.11 skrev Chris Hostetter:
: That might be true, as I said, I didn't really think about it too
: long. But some alternative hashCode could probably be implemented,
: one that use all available bits in a string, rather than the 32 bit
: limitation of an integer.
if you're going to use all the bits in the string, and not confine
yourself to an integer, how is that different from sorting on the
string
itself?
Smaller string values does not consume as much memory?
I might not understand your question.
--
karl
