Reaped: Re: Performance of hash and array inserts

This node falls below the community's threshold of quality. You may see it by logging in.

Comment on Reaped: Re: Performance of hash and array inserts

Replies are listed 'Best First'.
Re^2: Performance of hash and array inserts by LanX (Saint) on Oct 11, 2021 at 17:23 UTC
> Because hash algorithms purposely try to distribute values widely, they are naturally more susceptible to this influence. Nonsense-Mike again ... When hashes grow they allocate in doubling steps, they don't waste much space in the internal lookup table, which is just an array anyway Cheers Rolf _{(addicted to the Perl Programming Language :) Wikisyntax for the Monastery}	[reply]
Re^2: Performance of hash and array inserts by eyepopslikeamosquito (Archbishop) on Oct 11, 2021 at 23:50 UTC
SunnyD, did you forget you already replied to bliako's excellent meditation ten days ago? Your previous rambling reply "triggered a page fault and was promptly reaped by the PM garbage collection mechanism".	[reply]

In Section Meditations