> 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
| [reply] |
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] |
