On Tue, 2004-11-02 at 17:22, Julian Foad wrote: > Prevent unbounded memory use during repeated operations on a hash table. > > The hash table was allocating new memory for each new insertion of an entry, > and not reclaiming it on deletions, so repetition of (insert, delete) caused > the memory use to keep growing. This fix causes the memory freed by a > deletion > to be reused by a subsequent insertion, so that the memory used by the hash > table is proportional to the maximum number of entries that it has ever held > simultaneously, rather than the number of insertions that have been performed.
+1. Sander
