Re: [Gnu-arch-users] Dirname caching for leroy's tla on cygwin

[Aaron Bentley]

John Meinel wrote:
> The reason I wonder is that hash always has to traverse the entire
> string, while a comparison would only have to traverse until a mismatch.

I haven't examined at this implementation, but hashtables usually use 
the hash value as an index.  As long as you don't have too many 
duplicate hash values (or near-duplicates), it's extremely fast.

Aaron
--
Aaron Bentley
Director of Technology
Panometrics, Inc.