Alternatives and similar repositories for libhhash:

Users that are interested in libhhash are comparing it to the libraries listed below

• JerrySievert / judyarray
  Automatically exported from code.google.com/p/judyarray
  ☆17Updated 9 years ago
• rurban / Perfect-Hash
  generate perfect hashes (alpha)
  ☆77Updated 2 years ago
• silentbicycle / skiparray
  unrolled skip list library for C
  ☆21Updated 5 years ago
• scotts / streamflow
  Lock-free multithreaded memory allocation
  ☆105Updated 8 years ago
• rmind / libcdb
  NetBSD cdb (constant database) library
  ☆14Updated 5 years ago
• hnsl / librcd
  A library for Rapid {C|Concurrency|Correct} Development
  ☆34Updated 9 years ago
• tudordavid / libslock
  Cross-platform atomic operations and lock algorithm library
  ☆97Updated 6 years ago
• malbrain / HatTrie
  A compact implementation of Dr. Askitis HatTrie
  ☆80Updated 10 years ago
• cemeyer / structhole
  A feature-incomplete peekahole (pahole) clone that doesn't rely on libdwarves (and doesn't choke on Clang output)
  ☆22Updated 7 years ago
• malbrain / rwlock
  Phase Fair and Standard Reader Writer Locks
  ☆17Updated 5 years ago
• cruppstahl / libvbyte
  A fast implementation for varbyte 32bit/64bit integer compression
  ☆116Updated 8 years ago
• maximecaron / SIMD-Based-Posting-lists
  Implementation of Alexander A. Stepanov inverted Index Compression algorithms
  ☆21Updated 9 years ago
• argv0 / nbds
  C implementations of several scalable non-blocking data structures for x86 and x86-64.
  ☆38Updated 13 years ago
• Bulat-Ziganshin / FARSH
  Fast and Reliable (but not Secure) Hash
  ☆53Updated 6 years ago
• stedolan / libfib
  A library for high-performance lightweight threads
  ☆20Updated 13 years ago
• rlu-sync / rlu-rht
  RLU resizable hash-table
  ☆17Updated 9 years ago
• ot / path_decomposed_tries
  Implementation of the data structures described in the paper "Fast Compressed Tries using Path Decomposition".
  ☆56Updated 2 years ago
• btrask / lsmdb
  Proof of concept LSM-tree built on MDB
  ☆17Updated 9 years ago
• thomasmueller / xorfilter_cpp
  Bloom filter alternative (C++)
  ☆17Updated 6 years ago
• balena / radixdb
  Static Radix Tree (Patricia trie) implementation in C
  ☆49Updated 7 years ago
• gwsystems / ps
  Parallel sections library for parallel data-structures
  ☆14Updated last year
• schani / linbin
  Linear vs binary search benchmark
  ☆41Updated 5 years ago
• willemt / splay-tree
  A splaytree ADT written in C with a BSD license
  ☆17Updated 4 years ago
• floodyberry / siphash
  SipHash: a fast short-input PRF
  ☆60Updated 9 years ago
• ned14 / uthash
  A GIT clone of uthash.sourceforge.net, a hash table, implemented in C, supporting constant-time add/find/remove of C structures. Any stru…
  ☆36Updated 11 years ago
• timrc-git / mdbm
  MDBM a very fast memory-mapped key/value store.
  ☆77Updated last year
• fanf2 / qp
  qp tries and crit-bit tries
  ☆119Updated 2 years ago
• gburd / libumem
  This is the user space slab memory allocator, umem, first available in Solaris 9.
  ☆87Updated 3 years ago
• dankamongmen / libtorque
  A threaded, continuations-based I/O event library for manycore NUMA machines
  ☆71Updated 3 years ago
• mettienne / tiered-vector
  Highly optimized implementation of tiered vectors, a data structure for maintaining a sequence of n elements supporting access in time O(…
  ☆49Updated 11 months ago