Alternatives and similar repositories for flit:

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

• fwessels / simdcsv
  ☆36Updated 4 years ago
• nelz9999 / stream-vbyte-go
  A port of Stream VByte to Go
  ☆35Updated 2 years ago
• demerphq / BeagleHash
  Fast 64 bit evolved hash.
  ☆32Updated 7 years ago
• clausecker / pospopcnt
  AVX-2 vectorised 8-bit positional popcount for Go
  ☆23Updated 4 years ago
• cruppstahl / libvbyte
  A fast implementation for varbyte 32bit/64bit integer compression
  ☆116Updated 7 years ago
• efficient / rankselect
  Space-Efficient, High-Performance Rank & Select Structures on Uncompressed Bit Sequences
  ☆54Updated last year
• malbrain / HatTrie
  A compact implementation of Dr. Askitis HatTrie
  ☆80Updated 10 years ago
• efficient / ffbf
  Feed-forward Bloom filters
  ☆52Updated 13 years ago
• dgryski / go-marvin32
  Assembly-optimized Marvin32 hash function
  ☆12Updated last year
• hillbig / rsdic
  A Go library for space-efficient rank/select operations for both sparse and dense bit arrays.
  ☆36Updated 4 years ago
• dgryski / go-mph
  minimal perfect hash functions
  ☆62Updated 3 years ago
• rleiwang / svb
  Faster integer compression in Go with SIMD using StreamVByte codec
  ☆42Updated last year
• robskie / bp128
  Go implementation of SIMD-BP128 integer encoding and decoding
  ☆30Updated 2 years ago
• ot / path_decomposed_tries
  Implementation of the data structures described in the paper "Fast Compressed Tries using Path Decomposition".
  ☆55Updated 2 years ago
• splatlab / rankselect
  Space-Efficient, High-Performance Rank & Select Structures on Uncompressed Bit Sequences
  ☆15Updated 6 years ago
• jermp / mutable_rank_select
  A SIMD-based C++ library providing rank/select queries over mutable bitmaps.
  ☆35Updated 2 years ago
• kellydunn / go-art
  an adaptive radix tree implementation in go
  ☆69Updated 3 years ago
• jermp / s_indexes
  Universe-sliced indexes in C++.
  ☆18Updated 2 years ago
• stapelberg / goturbopfor
  Teaching implementation of the TurboPFor integer compression algorithm
  ☆22Updated 6 years ago
• dgryski / go-groupvarint
  SSE-optimized group varint integer encoding
  ☆37Updated last year
• lemire / fastscancount
  Fast implementations of the scancount algorithm: C++ header-only library
  ☆26Updated 5 years ago
• efficient / qlease
  ☆24Updated 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(…
  ☆49Updated 9 months ago
• lemire / fasthashing
  A Variable-Length String Hashing Library in C++
  ☆44Updated 5 years ago
• dgryski / go-hollow
  Hollow Heaps for Go
  ☆20Updated 7 years ago
• amallia / go-ef
  A Go implementation of the Elias-Fano encoding
  ☆33Updated 8 months ago
• hillbig / waveletTree
  A Go package for myriad array operations using wavelet trees
  ☆17Updated 8 years ago
• dgryski / go-boomphf
  Fast and scalable minimal perfect hashing for massive key sets
  ☆71Updated 4 years ago
• efficient / go-cuckoo
  A high-performance, memory-efficient concurrent hash table
  ☆36Updated 11 years ago
• efficient / fast-succinct-trie
  ☆25Updated 7 years ago