but there are ways around that.... You can rehash ... or you can use binary trees instead of lists
You can also use a secondary hashing function within the buckets.
In reply to Re^2: A short meditation about hash search performance
by BrowserUk
in thread A short meditation about hash search performance
by pg
For: | Use: | ||
& | & | ||
< | < | ||
> | > | ||
[ | [ | ||
] | ] |