moparisthebest/wget
1
0
Fork 0
mirror of https://github.com/moparisthebest/wget synced 2024-07-03 16:38:41 -04:00
Code Issues Releases Wiki Activity

[svn] Trivial doc fix.

Browse Source
This commit is contained in:
hniksic 2003-12-19 17:40:19 -08:00
parent 4bbe443be3
commit 36b266f894
1 changed files with 7 additions and 8 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

15
src/hash.c
View File

@ -106,14 +106,13 @@ so, delete this exception statement from your version. */
The hash table is implemented as an open-addressed table with
linear probing collision resolution.
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".
The above 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".
There are more advanced collision resolution methods (quadratic
probing, double hashing), but we don't use them because they incur