This is certainly worth a look. I'm not an expert by any means when it comes to this stuff. But in general, it is certainly prudent to be very cautious when changing a crucial algorithm like hash tables. It may be faster in most cases, but is it also robust enough to withstand attacks? Is it guaranteed to always return the data that it should?
Even better performance than we already have would be nice, if this algo applies to Perl. But it would need very thorough testing in a wide range of settings and applications, with an easy way to switch between the current and the new algo within the same perl version.
In reply to Re: Better Hash Tables?
by cavac
in thread Better Hash Tables?
by QM
For: | Use: | ||
& | & | ||
< | < | ||
> | > | ||
[ | [ | ||
] | ] |