Alternatives and similar repositories for flit

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

• fwessels / simdcsv
  ☆37Updated 5 years ago
• nelz9999 / stream-vbyte-go
  A port of Stream VByte to Go
  ☆35Updated 3 years ago
• demerphq / BeagleHash
  Fast 64 bit evolved hash.
  ☆34Updated 8 years ago
• efficient / rankselect
  Space-Efficient, High-Performance Rank & Select Structures on Uncompressed Bit Sequences
  ☆55Updated last year
• rleiwang / svb
  Faster integer compression in Go with SIMD using StreamVByte codec
  ☆43Updated 2 years ago
• clausecker / pospopcnt
  AVX-2 vectorised 8-bit positional popcount for Go
  ☆23Updated 5 years ago
• robskie / bp128
  Go implementation of SIMD-BP128 integer encoding and decoding
  ☆31Updated 3 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.
  ☆37Updated 5 years ago
• tokenrove / fixie-trie
  Compact tries for fixed-width keys
  ☆26Updated 7 years ago
• kellydunn / go-art
  an adaptive radix tree implementation in go
  ☆69Updated 4 years ago
• malbrain / HatTrie
  A compact implementation of Dr. Askitis HatTrie
  ☆80Updated 11 years ago
• lemire / FastDifferentialCoding
  Fast differential coding functions (using SIMD instructions)
  ☆55Updated 8 years ago
• dgryski / go-mph
  minimal perfect hash functions
  ☆64Updated 4 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
• dgryski / go-groupvarint
  SSE-optimized group varint integer encoding
  ☆39Updated 2 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
• dgryski / go-boomphf
  Fast and scalable minimal perfect hashing for massive key sets
  ☆72Updated 5 years ago
• fastly / uslab
  Lock-free slab allocator / freelist.
  ☆70Updated 10 years ago
• cruppstahl / libvbyte
  A fast implementation for varbyte 32bit/64bit integer compression
  ☆121Updated 8 years ago
• fast-pack / dictionary
  High-performance dictionary coding
  ☆108Updated 8 years ago
• fanf2 / qp
  qp tries and crit-bit tries
  ☆122Updated 3 years ago
• fwessels / simdjson-go
  Golang port of simdjson
  ☆86Updated 5 years ago
• dgryski / go-hollow
  Hollow Heaps for Go
  ☆20Updated 7 years ago
• efficient / go-cuckoo
  A high-performance, memory-efficient concurrent hash table
  ☆36Updated 12 years ago
• vkrasnov / avx_qsort
  Quick sort code using AVX2 instructions
  ☆69Updated 8 years ago
• btrask / lsmdb
  Proof of concept LSM-tree built on MDB
  ☆17Updated 10 years ago
• efficient / ARF
  ☆11Updated 7 years ago
• hillbig / waveletTree
  A Go package for myriad array operations using wavelet trees
  ☆18Updated 9 years ago
• bmkessler / fastdiv
  Fast division, modulus and divisibility checks in Go for divisors known only at runtime.
  ☆118Updated 6 years ago