Hashtable (was Re: Dictionaries broken in 3.9a)

Samuel Tardieu sam at rfc1149.net
Mon Sep 19 11:58:43 UTC 2005


>>>>> "Marcus" == Marcus Denker <denker at iam.unibe.ch> writes:

Marcus> Phillipe uses a linked list for the solving collisions: If
Marcus> there is a collision, the slot will contain the head of a
Marcus> linked list.

Yup, he implemented what is called an "open hash table" while the
previous implementation was using a "closed hash table".

Closed hash tables are typically used on systems where dynamic
allocation is expensive or when values all use the same size (pointers
for examples). In my experience, open hash tables are much more
suitable to general purpose dictionaries than closed hash tables.

  Sam
-- 
Samuel Tardieu -- sam at rfc1149.net -- http://www.rfc1149.net/sam




More information about the Squeak-dev mailing list