Alternatives and similar repositories for flit:

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

• nelz9999 / stream-vbyte-go
  A port of Stream VByte to Go
  ☆35Updated 3 years ago
• fwessels / simdcsv
  ☆36Updated 4 years ago
• dgryski / go-marvin32
  Assembly-optimized Marvin32 hash function
  ☆12Updated last year
• robskie / bp128
  Go implementation of SIMD-BP128 integer encoding and decoding
  ☆30Updated 2 years ago
• demerphq / BeagleHash
  Fast 64 bit evolved hash.
  ☆32Updated 7 years ago
• efficient / rankselect
  Space-Efficient, High-Performance Rank & Select Structures on Uncompressed Bit Sequences
  ☆54Updated last year
• clausecker / pospopcnt
  AVX-2 vectorised 8-bit positional popcount for Go
  ☆23Updated 4 years ago
• rleiwang / svb
  Faster integer compression in Go with SIMD using StreamVByte codec
  ☆42Updated last year
• dgryski / go-mph
  minimal perfect hash functions
  ☆62Updated 3 years ago
• dgryski / go-groupvarint
  SSE-optimized group varint integer encoding
  ☆37Updated last year
• lemire / FastDifferentialCoding
  Fast differential coding functions (using SIMD instructions)
  ☆52Updated 7 years ago
• amallia / go-ef
  A Go implementation of the Elias-Fano encoding
  ☆35Updated 9 months ago
• efficient / ffbf
  Feed-forward Bloom filters
  ☆52Updated 13 years ago
• hillbig / rsdic
  A Go library for space-efficient rank/select operations for both sparse and dense bit arrays.
  ☆37Updated 4 years ago
• malbrain / HatTrie
  A compact implementation of Dr. Askitis HatTrie
  ☆80Updated 10 years ago
• efficient / qlease
  ☆24Updated 10 years ago
• kellydunn / go-art
  an adaptive radix tree implementation in go
  ☆69Updated 3 years ago
• hillbig / waveletTree
  A Go package for myriad array operations using wavelet trees
  ☆18Updated 9 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
• vkrasnov / avx_qsort
  Quick sort code using AVX2 instructions
  ☆68Updated 7 years ago
• splatlab / rankselect
  Space-Efficient, High-Performance Rank & Select Structures on Uncompressed Bit Sequences
  ☆15Updated 6 years ago
• stapelberg / goturbopfor
  Teaching implementation of the TurboPFor integer compression algorithm
  ☆22Updated 6 years ago
• lemire / multiplatform_simd_recipes
  SIMD recipes, for various platforms (collection of code snippets)
  ☆48Updated 3 years ago
• tokenrove / fixie-trie
  Compact tries for fixed-width keys
  ☆25Updated 6 years ago
• lemire / simdprune
  Pruning elements in SIMD vectors (i.e., packing left elements)
  ☆65Updated last year
• lemire / fasthashing
  A Variable-Length String Hashing Library in C++
  ☆44Updated 5 years ago
• aklomp / sse-strings
  SSE string functions for x86-64 Linux
  ☆20Updated 2 years ago
• jermp / s_indexes
  Universe-sliced indexes in C++.
  ☆18Updated 2 years ago
• cruppstahl / libvbyte
  A fast implementation for varbyte 32bit/64bit integer compression
  ☆116Updated 8 years ago
• dgryski / go-boomphf
  Fast and scalable minimal perfect hashing for massive key sets
  ☆71Updated 5 years ago