On Sunday 04 August 2002 01:03 pm, Stephen Pair wrote:
> Could we make all really small hashed structures do linear
> searches?

Hmm... like switching the search mode based on size?

You'd probably have to change the storage as well; the empty space in 
a typical hash would be a waste of time to search through. So when 
you grew past a threshold size you'd go from a tight collection to a 
sparse one. Which would require re-hashing. Would you re-compact when 
the size got down below the threshold (minus some hysteresis, maybe)?

-- 
Ned Konz
http://bike-nomad.com
GPG key ID: BEEA7EFE