Golang set data structure with bonus bit-twiddling functions.

bit alternatives and similar packages

Based on the "Data Structures" category

• gods

  9.6 3.5 bit VS gods

  Go Data Structures. Containers, Sets, Lists, Stacks, Maps, BidiMaps, Trees, HashSet etc.

• go-datastructures

  9.4 0.0 bit VS go-datastructures

  a collection of useful, performant, and thread-safe data structures

• golang-set

  7.7 0.9 bit VS golang-set

  Thread-Safe and Non-Thread-Safe high-performance sets for Go.

• boomfilters

  7.5 0.9 bit VS boomfilters

  probabilistic data structures for processing continuous, unbounded streams

• gota

  7.4 2.0 bit VS gota

  An implementation of dataframes, series, and data wrangling methods for Go.

• willf/bloom

  6.9 1.0 bit VS willf/bloom

  Go package implementing Bloom filters.

• roaring

  6.8 5.8 bit VS roaring

  Go package implementing compressed bitsets.

• hyperloglog

  6.6 3.7 bit VS hyperloglog

  HyperLogLog implementation with Sparse, LogLog-Beta bias correction and TailCut space reduction.

• bitset

  6.4 6.1 bit VS bitset

  Go package implementing bitsets.

• cuckoofilter

  6.3 2.3 bit VS cuckoofilter

  Cuckoo filter: a good alternative to a counting bloom filter implemented in Go.

• trie

  6.3 4.0 bit VS trie

  Trie implementation in Go

• go-geoindex

  6.2 0.0 bit VS go-geoindex

  In-memory geo index.

• mafsa

  5.4 2.5 bit VS mafsa

  MA-FSA implementation with Minimal Perfect Hashing

• goskiplist

  5.3 0.0 bit VS goskiplist

  A skip list implementation in Go.

• Bloomfilter

  5.2 1.7 bit VS Bloomfilter

  Face-meltingly fast, thread-safe, marshalable, unionable, probability- and optimal-size-calculating Bloom filter in go

• hilbert

  5.1 0.6 bit VS hilbert

  Go package for mapping values to and from space-filling curves, such as Hilbert and Peano curves.

• merkletree

  4.9 4.4 bit VS merkletree

  Implementation of a merkle tree providing an efficient and secure verification of the contents of data structures.

• ttlcache

  4.8 6.0 bit VS ttlcache

  An in-memory LRU string-interface{} map with expiration for golang

• binpacker

  4.4 0.0 bit VS binpacker

  Binary packer and unpacker helps user build custom binary stream.

• bloom

  4.2 0.0 bit VS bloom

  Bloom filters implemented in Go.

• conjungo

  4.0 0.0 bit VS conjungo

  A small, powerful and flexible merge library.

• encoding

  3.8 0.0 bit VS encoding

  Integer Compression Libraries for Go.

• go-rquad

  3.6 0.0 bit VS go-rquad

  Region quadtrees with efficient point location and neighbour finding.

• skiplist

  3.5 0.0 bit VS skiplist

  Skiplist implementation in Go

• go-adaptive-radix-tree

  3.4 0.0 bit VS go-adaptive-radix-tree

  A Go implementation of Adaptive Radix Tree.

• levenshtein

  2.7 4.6 bit VS levenshtein

  Implmentation to calculate levenshtein distance in Go.

• count-min-log

  2.5 0.0 bit VS count-min-log

  A Go implementation Count-Min-Log sketch: Approximately counting with approximate counters (Like Count-Min sketch but using less memory).

• goset

  1.6 2.3 bit VS goset

  A useful Set collection implementation for Go.

• go-ef

  1.3 0.0 bit VS go-ef

  A Go implementation of the Elias-Fano encoding.

• blooming-bella

  0.4 0.0 bit VS blooming-bella

  A simple implementation of Bloom Filters using murmur3, Super Fast Hash and marvin32 hashing algorithms.

• Go-Form

  0.3 2.4 bit VS Go-Form

  Create HTML forms with your structs and interfaces.

Do you think we are missing an alternative of bit or a related project?

Track Go performance metrics with in-depth app monitoring. 14-day trial. More from our partner

Popular Comparisons

• bit
  vs
  go-rquad
• bit
  vs
  hilbert
• bit
  vs
  go-datastructures
• bit
  vs
  roaring
• bit
  vs
  willf/bloom

SaaSHub - Software Alternatives and Reviews More from our team