From 21f6620b49819fb69b2c14a84069d4323d7ea383 Mon Sep 17 00:00:00 2001 From: hniksic Date: Fri, 7 Nov 2003 19:58:50 -0800 Subject: [PATCH] [svn] *** empty log message *** --- src/hash.c | 12 ++++++------ 1 file changed, 6 insertions(+), 6 deletions(-) diff --git a/src/hash.c b/src/hash.c index 49979c75..323a8193 100644 --- a/src/hash.c +++ b/src/hash.c @@ -103,12 +103,12 @@ so, delete this exception statement from your version. */ The hash table is implemented as an open-addressed table with linear probing collision resolution. - For those not up to CS parlance, it means that all the hash entries - (pairs of pointers key and value) are stored in a contiguous array. - The position of each mapping is determined by the hash value of its - key and the size of the table: location := hash(key) % size. If - two different keys end up on the same position (collide), the one - that came second is placed at the next empty position following the + In regular language, it means that all the hash entries (pairs of + pointers key and value) are stored in a contiguous array. The + position of each mapping is determined by the hash value of its key + and the size of the table: location := hash(key) % size. If two + different keys end up on the same position (collide), the one that + came second is placed at the next empty position following the occupied place. This collision resolution technique is called "linear probing". -- 2.39.2