Join GitHub today
GitHub is home to over 28 million developers working together to host and review code, manage projects, and build software together.Sign up
new hash table #24
The old hash table uses:
maybe use the glibc htable (hsearch, hcreate), just add random seeds and flood detection (collision counts). (or khash, which is basically the same). coucal looks good also. https://github.com/xroche/coucal
open addressing is cache friendly and much faster, but table growth is slow.
either way, first I need to abstract away the collision search in MACROS
The last attempt was here: https://github.com/rurban/perl/commits/rurban/hash-sortbuckets