Go package implementing bitsets.

bitset alternatives and similar packages

Based on the "Data Structures" category

• gods

  9.7 3.1 bitset VS gods

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

• go-datastructures

  9.4 0.0 bitset VS go-datastructures

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

• gota

  7.8 5.1 bitset VS gota

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

• golang-set

  7.7 0.9 bitset VS golang-set

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

• boomfilters

  7.5 0.9 bitset VS boomfilters

  probabilistic data structures for processing continuous, unbounded streams

• willf/bloom

  6.9 1.0 bitset VS willf/bloom

  Go package implementing Bloom filters.

• trie

  6.8 3.5 bitset VS trie

  Trie implementation in Go

• roaring

  6.8 5.8 bitset VS roaring

  Go package implementing compressed bitsets.

• hyperloglog

  6.6 3.7 bitset VS hyperloglog

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

• cuckoofilter

  6.3 2.3 bitset VS cuckoofilter

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

• algorithms

  6.2 2.1 bitset VS algorithms

  Algorithms and data structures.CLRS study.

• go-geoindex

  6.2 0.0 bitset VS go-geoindex

  In-memory geo index.

• gocache

  5.9 6.7 bitset VS gocache

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

• goskiplist

  5.9 0.0 bitset VS goskiplist

  A skip list implementation in Go.

• merkletree

  5.5 4.0 bitset VS merkletree

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

• mafsa

  5.4 2.5 bitset VS mafsa

  MA-FSA implementation with Minimal Perfect Hashing

• ttlcache

  5.4 5.8 bitset VS ttlcache

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

• Bloomfilter

  5.2 1.7 bitset VS Bloomfilter

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

• hilbert

  5.1 0.6 bitset VS hilbert

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

• bloom

  4.8 0.0 bitset VS bloom

  Bloom filters implemented in Go.

• conjungo

  4.6 0.0 bitset VS conjungo

  A small, powerful and flexible merge library.

• binpacker

  4.4 0.0 bitset VS binpacker

  Binary packer and unpacker helps user build custom binary stream.

• ring

  4.1 4.6 bitset VS ring

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

• bit

  4.0 0.0 bitset VS bit

  Golang set data structure with bonus bit-twiddling functions.

• encoding

  3.8 0.0 bitset VS encoding

  Integer Compression Libraries for Go.

• go-rquad

  3.6 0.0 bitset VS go-rquad

  Region quadtrees with efficient point location and neighbour finding.

• skiplist

  3.5 0.0 bitset VS skiplist

  Skiplist implementation in Go

• go-adaptive-radix-tree

  3.4 0.0 bitset VS go-adaptive-radix-tree

  A Go implementation of Adaptive Radix Tree.

• set

  3.2 2.0 bitset VS set

  Simple set data structure implementation in Go using LinkedHashMap.

• goconcurrentqueue

  3.0 5.8 bitset VS goconcurrentqueue

  Concurrent FIFO queue.

• count-min-log

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

• levenshtein

  2.7 4.6 bitset VS levenshtein

  Implmentation to calculate levenshtein distance in Go.

• remember-go

  2.6 6.3 bitset VS remember-go

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

• crunch

  2.5 7.5 bitset VS crunch

  Go package implementing buffers for handling various datatypes easily.

• goset

  2.1 2.1 bitset VS goset

  A useful Set collection implementation for Go.

• ptrie

  2.0 6.2 bitset VS ptrie

  An implementation of prefix tree.

• hide

  1.8 3.6 bitset VS hide

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

• pipeline

  1.8 0.0 bitset VS pipeline

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

• mspm

  1.6 0.0 bitset VS mspm

  Multi-String Pattern Matching Algorithm for information retrieval.

• go-ef

  1.3 0.0 bitset VS go-ef

  A Go implementation of the Elias-Fano encoding.

• deque

  1.2 6.2 bitset VS deque

  A highly optimized double-ended queue.

• null

  1.1 4.3 bitset VS null

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

• dict

  1.0 3.9 bitset VS dict

  Python-like dictionaries (dict) for Go.

• timedmap

  0.9 3.9 bitset VS timedmap

  Map with expiring key-value pairs.

• parsefields

  0.6 5.0 bitset VS parsefields

  Tools for parse JSON-like logs for collecting unique fields and events.

• blooming-bella

  0.4 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 2.4 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?

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

Popular Comparisons

• bitset
  vs
  golang-set
• bitset
  vs
  go-adaptive-radix-tree
• bitset
  vs
  levenshtein
• bitset
  vs
  gota
• bitset
  vs
  boomfilters

SaaSHub - Software Alternatives and Reviews More from our team