User Ratings

★★★★★
★★★★
★★★
★★
1
1
0
0
0
ease 1 of 5 2 of 5 3 of 5 4 of 5 5 of 5 0 / 5
features 1 of 5 2 of 5 3 of 5 4 of 5 5 of 5 0 / 5
design 1 of 5 2 of 5 3 of 5 4 of 5 5 of 5 0 / 5
support 1 of 5 2 of 5 3 of 5 4 of 5 5 of 5 0 / 5

Rate This Project
Login To Rate This Project

User Reviews

  • Finally hash tables which actually care about collision strategies, against algorithmic complexity attacks. And it even includes bloom. Modern open addressing schemes are not here (robin-hood, hopscotch, ...), but rbtree should be good. I'm only missing sorted arrays, which should have better cache performance, and CPU optimized hash functions (crc32 instrinsics, SIMD)
  • Good ready to use hash table implementation- Really saves time not reinventing the wheel
  • Previous
  • You're on page 1
  • Next