Jim Meyering meyering.net> writes:
> > My first attempt used a full two-pass algorithm for the cleanup case. With
one
> > pass, the allocations and frees are intermingled, with two passes all frees
> > occur before any allocations. However, I have been unable (so far) to
contrive
> > any such
Eric Blake wrote:
> Jim Meyering meyering.net> writes:
>> Eric Blake wrote:
>> > + /* Guarantee that once we start moving entries into the new table,
>> > + we will not need any further memory allocations. We only need
>> > + new allocations if the hasher consolidates multiple buckets fr