bitset alternatives and related packages

Based on the "Data Structures" category

• go-datastructures

  9.4 4.0 bitset VS go-datastructures

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

• gods

  9.4 3.7 bitset VS gods

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

• boomfilters

  7.5 3.6 bitset VS boomfilters

  probabilistic data structures for processing continuous, unbounded streams

• golang-set

  7.4 2.8 bitset VS golang-set

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

• gota

  7.1 0.9 bitset VS gota

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

• willf/bloom

  6.9 0.0 bitset VS willf/bloom

  Go package implementing Bloom filters.

• hyperloglog

  6.7 3.7 bitset VS hyperloglog

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

• roaring

  6.5 8.2 bitset VS roaring

  Go package implementing compressed bitsets.

• go-geoindex

  6.3 0.0 bitset VS go-geoindex

  In-memory geo index.

• cuckoofilter

  5.9 2.8 bitset VS cuckoofilter

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

• trie

  5.8 0.8 bitset VS trie

  Trie implementation in Go

• mafsa

  5.5 0.0 bitset VS mafsa

  MA-FSA implementation with Minimal Perfect Hashing

• goskiplist

  5.2 0.0 bitset VS goskiplist

  A skip list implementation in Go.

• hilbert

  4.9 1.2 bitset VS hilbert

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

• bloom

  4.3 0.0 bitset VS bloom

  Bloom filters implemented in Go.

• ttlcache

  4.1 1.9 bitset VS ttlcache

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

• binpacker

  4.1 0.4 bitset VS binpacker

  Binary packer and unpacker helps user build custom binary stream.

• encoding

  3.9 0.6 bitset VS encoding

  Integer Compression Libraries for Go.

• merkletree

  3.9 4.0 bitset VS merkletree

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

• skiplist

  3.7 0.0 bitset VS skiplist

  Skiplist implementation in Go

• conjungo

  3.5 4.1 bitset VS conjungo

  A small, powerful and flexible merge library.

• go-rquad

  3.5 2.8 bitset VS go-rquad

  Region quadtrees with efficient point location and neighbour finding.

• go-adaptive-radix-tree

  2.9 0.0 bitset VS go-adaptive-radix-tree

  A Go implementation of Adaptive Radix Tree.

• count-min-log

  2.6 0.0 bitset VS count-min-log

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

• bit

  2.1 3.3 bitset VS bit

  Golang set data structure with bonus bit-twiddling functions.

• levenshtein

  2.0 2.5 bitset VS levenshtein

  Implmentation to calculate levenshtein distance in Go.

• goset

  1.2 1.2 bitset VS goset

  A useful Set collection implementation for Go.

• go-ef

  0.7 2.1 bitset VS go-ef

  A Go implementation of the Elias-Fano encoding.

• blooming-bella

  0.3 0.0 bitset VS blooming-bella

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

• Go-Form

  0.3 4.0 bitset VS Go-Form

  Create HTML forms with your structs and interfaces.

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

bitset Recommendations

Have you used bitset? Share your experience. Write a short recommendation and bitset, you and your project will be promoted on Awesome Go.
Recommend bitset

Recently added bitset resources

Datadog - Monitor and correlate metrics, request traces, and logs in one platform. Try it free. More from our partner

Popular Comparisons

• bitset
  vs
  golang-set
• bitset
  vs
  go-adaptive-radix-tree
• bitset
  vs
  binpacker
• bitset
  vs
  skiplist
• bitset
  vs
  levenshtein

SaaSHub - The independent software marketplace. Find the best software and alternatives. More from our team