Thanks, but I'm not sure I understand your answer. When the table is
rehashed all new nodes are set as free because lastfree points to to
the last node, and then the existing elements are added to the new
My question is, if a node is freed but its address is greater than lastfree does it remain free until the table is either rehashed or collected?
On 25/10/2010 21:00, Marc OMorain wrote:
It is possible to cause a re-hash operation with the steps that you have described. The re-hash algorithm will calculate a new size for the table. When selecting a new size, the free nodes in the table will be noticed, and taken into account.