Contrary to what I'd always understood, there is an efficient
authorBen Pfaff <blp@gnu.org>
Sat, 17 Apr 2004 07:02:10 +0000 (07:02 +0000)
committerBen Pfaff <blp@gnu.org>
Sat, 17 Apr 2004 07:02:10 +0000 (07:02 +0000)
commit7dbe58807d4243d99dc51d3797fdb8c81e87d0a4
tree194c96fc0d33c377a92a761ecf17c01788abbd42
parente78d51c7941a26eef71d69260b49eeb1db954428
Contrary to what I'd always understood, there is an efficient
algorithm for deletion from a hash table populated via linear probing.
This change implements it.
src/ChangeLog
src/hash.c