[gclist] Garbage collection and XML

[Florian Weimer]

"Boehm, Hans" <hans_boehm@hp.com> writes:

> Dynamically resizable hash tables exist in other places, too.
> 
> They're discussed in "The Design and Analaysis of Computer Algorithms", Aho,
> Hopcroft, and Ullman, 1974.
> 
> They're used in SGI's STL implementation. (See
> http://www.sgi.com/tech/stl/stl_hashtable.h for the implementation, which is
> unfortunately uglified to be namespace-correct.)

That seems to be a rather brute force approach: when the hash table is
resized, the entries are newly distributed to a different number of
hash buckets.