Golang set data structure with bonus bit-twiddling functions.

bit alternatives and similar packages

Based on the "Data Structures" category.
Alternatively, view bit alternatives based on common mentions on social networks and blogs.

• gods

  9.7 2.1 bit VS gods

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

• go-datastructures

  9.5 0.0 bit VS go-datastructures

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

Get performance insights in less than 4 minutes

Scout APM uses tracing logic that ties bottlenecks to source code so you know the exact line of code causing performance issues and can get back to building a great product faster.

Sponsored scoutapm.com



• golang-set

  8.4 0.8 bit VS golang-set

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

• gota

  8.3 0.0 bit VS gota

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

• boomfilters

  7.9 0.3 bit VS boomfilters

  probabilistic data structures for processing continuous, unbounded streams

• roaring

  7.8 7.3 bit VS roaring

  Go package implementing compressed bitsets.

• willf/bloom

  7.7 0.0 bit VS willf/bloom

  Go package implementing Bloom filters.

• bitset

  7.3 5.5 bit VS bitset

  Go package implementing bitsets.

• cuckoofilter

  7.3 1.7 bit VS cuckoofilter

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

• gocache

  7.3 6.1 bit VS gocache

  A complete Go cache library with mutiple stores (memory, memcache, redis, ...), chainable, loadable, metrics cache and more.

• hyperloglog

  7.2 0.0 bit VS hyperloglog

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

• trie

  7.0 0.1 bit VS trie

  Trie implementation in Go

• algorithms

  6.9 0.0 bit VS algorithms

  Algorithms and data structures.CLRS study.

• go-geoindex

  6.7 0.0 bit VS go-geoindex

  In-memory geo index.

• conjungo

  6.2 0.0 bit VS conjungo

  A small, powerful and flexible merge library.

• goskiplist

  6.0 0.0 bit VS goskiplist

  A skip list implementation in Go.

• mafsa

  6.0 0.0 bit VS mafsa

  MA-FSA implementation with Minimal Perfect Hashing

• Bloomfilter

  6.0 0.0 bit VS Bloomfilter

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

• merkletree

  6.0 0.0 bit VS merkletree

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

• hilbert

  5.9 0.0 bit VS hilbert

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

• gostl

  5.9 2.1 bit VS gostl

  Data structure and algorithm library for go, designed to provide functions similar to C++ STL.

• ttlcache

  5.7 6.3 bit VS ttlcache

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

• binpacker

  5.4 0.0 bit VS binpacker

  Binary packer and unpacker helps user build custom binary stream.

• go-adaptive-radix-tree

  5.4 2.1 bit VS go-adaptive-radix-tree

  A Go implementation of Adaptive Radix Tree.

• bloom

  4.9 0.0 bit VS bloom

  Bloom filters implemented in Go.

• iter

  4.7 0.0 bit VS iter

  Go implementation of C++ STL iterators and algorithms.

• encoding

  4.6 0.0 bit VS encoding

  Integer Compression Libraries for Go.

• goconcurrentqueue

  4.6 2.0 bit VS goconcurrentqueue

  Concurrent FIFO queue.

• levenshtein

  4.5 1.7 bit VS levenshtein

  Implmentation to calculate levenshtein distance in Go.

• ring

  4.5 1.6 bit VS ring

  Go implementation of a high performance, thread safe bloom filter.

• skiplist

  4.4 0.0 bit VS skiplist

  Skiplist implementation in Go

• go-rquad

  4.3 1.1 bit VS go-rquad

  Region quadtrees with efficient point location and neighbour finding.

• remember-go

  3.9 3.9 bit VS remember-go

  A universal interface for caching slow database queries (backed by redis, memcached, ristretto, or in-memory).

• go-mcache

  3.6 0.0 bit VS go-mcache

  Fast in-memory key:value store/cache library. Pointer caches.

• set

  3.3 0.7 bit VS set

  Simple set data structure implementation in Go using LinkedHashMap.

• crunch

  3.3 2.6 bit VS crunch

  Go package implementing buffers for handling various datatypes easily.

• count-min-log

  3.1 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).

• nan

  2.8 7.8 bit VS nan

  Zero allocation Nullable structures in one library with handy conversion functions, marshallers and unmarshallers.

• goset

  2.7 0.7 bit VS goset

  A useful Set collection implementation for Go.

• hide

  2.6 1.7 bit VS hide

  ID type with marshalling to/from hash to prevent sending IDs to clients.

• pipeline

  2.3 0.0 bit VS pipeline

  An implementation of pipelines with fan-in and fan-out.

• ptrie

  2.3 0.6 bit VS ptrie

  An implementation of prefix tree.

• timedmap

  2.2 3.0 bit VS timedmap

  Map with expiring key-value pairs.

• deque

  2.2 0.3 bit VS deque

  A highly optimized double-ended queue.

• go-ef

  2.1 0.0 bit VS go-ef

  A Go implementation of the Elias-Fano encoding.

• mspm

  1.9 0.0 bit VS mspm

  Multi-String Pattern Matching Algorithm for information retrieval.

• null

  1.7 1.1 bit VS null

  Nullable Go types that can be marshalled/unmarshalled to/from JSON.

• dict

  1.5 1.3 bit VS dict

  Python-like dictionaries (dict) for Go.

• treap

  1.4 0.0 bit VS treap

  Persistent, fast ordered map using tree heaps.

• gofal

  1.1 0.0 bit VS gofal

  fractional api for Go.

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

Popular Comparisons

• bit
  vs
  hilbert
• bit
  vs
  ttlcache
• bit
  vs
  golang-set
• bit
  vs
  roaring
• bit
  vs
  merkletree

SaaSHub - Software Alternatives and Reviews Sponsored www.saashub.com