On Wed, Jan 28, 2009 at 01:54:57AM +0100, Frederik Ramm wrote: > Simon Ward wrote: > > Hash table, or associative array/hash/dictionary? Hash tables have > > mechanisms to deal with collisions. > > A collision in a hash table is two keys sharing the same hash value, not > two keys being identical.
The same hash key necessarily hashes to the same value. It’s not the normal way to use a hash table, since you’d normally expect to stop once you find the key you want, and less than optimal but, for example, in a chained hash, you can walk along the collision chain to get all keys matching the values. Simon -- A complex system that works is invariably found to have evolved from a simple system that works.—John Gall
signature.asc
Description: Digital signature
_______________________________________________ dev mailing list [email protected] http://lists.openstreetmap.org/listinfo/dev
