Alternatives and similar repositories for fixie-trie

Users that are interested in fixie-trie are comparing it to the libraries listed below

• geofflangdale / sheng
  A small DFA for under 16 states
  ☆51Updated 7 years ago
• fanf2 / qp
  qp tries and crit-bit tries
  ☆121Updated 3 years ago
• demerphq / BeagleHash
  Fast 64 bit evolved hash.
  ☆33Updated 8 years ago
• rmind / libcdb
  NetBSD cdb (constant database) library
  ☆14Updated 6 years ago
• vkrasnov / avx_qsort
  Quick sort code using AVX2 instructions
  ☆69Updated 8 years ago
• pascaldekloe / flit
  fixed-length integer trim
  ☆34Updated 2 years ago
• fastly / uslab
  Lock-free slab allocator / freelist.
  ☆69Updated 9 years ago
• lemire / FastDifferentialCoding
  Fast differential coding functions (using SIMD instructions)
  ☆54Updated 7 years ago
• efficient / ARF
  ☆11Updated 7 years ago
• fsaintjacques / libtwiddle
  bit & sketches data structures
  ☆60Updated 6 years ago
• facebookarchive / Rseq
  Restartable Sequences: a userspace implementation of cheap per-cpu atomic operations
  ☆37Updated 6 years ago
• efficient / rankselect
  Space-Efficient, High-Performance Rank & Select Structures on Uncompressed Bit Sequences
  ☆55Updated last year
• bryankate / pequod
  A distributed key-value cache with builtin materialized views.
  ☆25Updated 10 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(…
  ☆50Updated last year
• blynn / blt
  Crit-bit tree (trie) library
  ☆32Updated 11 years ago
• backtrace-labs / stuffed-record-stream
  Backtrace.io's resilient log record framing format
  ☆38Updated 3 years ago
• ot / path_decomposed_tries
  Implementation of the data structures described in the paper "Fast Compressed Tries using Path Decomposition".
  ☆57Updated 2 years ago
• patmorin / arraylayout
  Experiments with array layouts for comparison-based searching
  ☆84Updated last year
• scotts / streamflow
  Lock-free multithreaded memory allocation
  ☆108Updated 8 years ago
• efficient / fast-succinct-trie
  ☆27Updated 8 years ago
• splatlab / rankselect
  Space-Efficient, High-Performance Rank & Select Structures on Uncompressed Bit Sequences
  ☆15Updated 7 years ago
• klsmpq / klsm
  The k-LSM: A relaxed, lock-free, linearizable priority queue
  ☆23Updated 8 years ago
• appnexus / acf
  An-source C library developed and used at AppNexus.
  ☆111Updated 5 years ago
• art4711 / bmap_find
  finding set bits in large bitmaps
  ☆15Updated 9 years ago
• tfaoliveira / libjc
  ☆21Updated 2 years ago
• cruppstahl / libvbyte
  A fast implementation for varbyte 32bit/64bit integer compression
  ☆119Updated 8 years ago
• lemire / multiplatform_simd_recipes
  SIMD recipes, for various platforms (collection of code snippets)
  ☆49Updated 4 years ago
• jandrewrogers / AquaHash
  Fast Hash Functions Using AES Intrinsics
  ☆82Updated 6 years ago
• backtrace-labs / bcd
  Simple out-of-process invoker
  ☆18Updated 2 months ago
• salesforce / runway-compiler
  Parses and executes Runway models of distributed systems
  ☆50Updated 3 years ago