Contrary to what I'd always understood, there is an efficient

[pspp-builds.git] / src / ChangeLog

diff --git a/src/ChangeLog b/src/ChangeLog
index 6db983d6fdac68686b29921ce67b2682cf2dccd4..a9112641a8097f25e8e6f802177208d21316f789 100644 (file)
--- a/src/ChangeLog
+++ b/src/ChangeLog
@@ -1,3 +1,14 @@
+Fri Apr 16 23:59:51 2004  Ben Pfaff  <blp@gnu.org>
+
+       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.
+       
+       * hash.c: (hsh_rehash) Probe in increasing order.
+       (hsh_probe) Ditto.
+       (locate_matching_entry) Ditto.
+       (hsh_delete) Use Knuth's Algorithm 6.4R for deletion.
+
 Tue Apr 13 19:24:15 2004  Ben Pfaff  <blp@gnu.org>
 
        * moments.c (calc_moments): Adjust calculation of kurtosis to