Popularity

5.0

Stable

Activity

0.0

Stable

Stars 159

Watchers 10

Forks 26

Last Commit about 2 years ago

Programming language: Go

License: BSD 2-clause "Simplified" License

Tags: Data Structures

Latest version: v1.2.5

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.8 5.2 bit VS gods

GoDS (Go Data Structures) - Sets, Lists, Stacks, Maps, Trees, Queues, and much more
go-datastructures

9.4 7.3 bit VS go-datastructures

A collection of useful, performant, and threadsafe Go datastructures.

SaaSHub - Software Alternatives and Reviews

SaaSHub helps you find the best software and product alternatives

Promo www.saashub.com

golang-set

8.8 4.6 bit VS golang-set

A simple, battle-tested and generic set type for the Go language. Trusted by Docker, 1Password, Ethereum and Hashicorp.
gota

8.6 0.0 bit VS gota

Gota: DataFrames and data wrangling in Go (Golang)
FSM for Go

8.5 2.9 bit VS FSM for Go

Finite State Machine for Go
roaring

8.4 8.7 bit VS roaring

Roaring bitmaps in Go (golang), used by InfluxDB, Bleve, DataDog
gocache

8.3 5.7 bit VS gocache

☔️ A complete Go cache library that brings you multiple ways of managing your caches
willf/bloom

8.3 4.1 bit VS willf/bloom

Go package implementing Bloom filters, used by Milvus and Beego.
boomfilters

7.8 0.0 bit VS boomfilters

Probabilistic data structures for processing continuous, unbounded streams.
bitset

7.7 8.5 bit VS bitset

Go package implementing bitsets
cuckoofilter

7.4 2.1 bit VS cuckoofilter

Cuckoo Filter: Practically Better Than Bloom
gostl

7.4 4.9 bit VS gostl

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

7.2 5.5 bit VS hyperloglog

HyperLogLog with lots of sugar (Sparse, LogLog-Beta bias correction and TailCut space reduction) brought to you by Axiom
algorithms

7.2 0.0 bit VS algorithms

CLRS study. Codes are written with golang.
trie

7.1 4.3 bit VS trie

Data structure and relevant algorithms for extremely fast prefix/fuzzy string searching.
merkletree

6.6 0.0 bit VS merkletree

A Merkle Tree implementation written in Go.
ttlcache

6.5 6.4 bit VS ttlcache

DISCONTINUED. An in-memory cache with item expiration and generics [Moved to: https://github.com/jellydator/ttlcache]
go-geoindex

6.4 0.0 bit VS go-geoindex

Go native library for fast point tracking and K-Nearest queries
conjungo

6.1 1.3 bit VS conjungo

A small flexible merge library in go
go-adaptive-radix-tree

6.1 7.2 bit VS go-adaptive-radix-tree

Adaptive Radix Trees implemented in Go
goconcurrentqueue

6.0 0.0 bit VS goconcurrentqueue

Go concurrent-safe, goroutine-safe, thread-safe queue
mafsa

6.0 0.0 bit VS mafsa

DISCONTINUED. MA-FSA implementation with Minimal Perfect Hashing
Bloomfilter

6.0 0.0 bit VS Bloomfilter

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

5.9 5.1 bit VS levenshtein

Go implementation to calculate Levenshtein Distance.
hilbert

5.9 0.0 bit VS hilbert

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

5.7 0.0 bit VS goskiplist

A skip list implementation in Go
cuckoo-filter

5.6 0.0 bit VS cuckoo-filter

Cuckoo Filter go implement, better than Bloom Filter, configurable and space optimized 布谷鸟过滤器的Go实现，优于布隆过滤器，可以定制化过滤器参数，并进行了空间优化
bitmap

5.6 4.3 bit VS bitmap

Simple dense bitmap index in Go with binary operators
binpacker

5.5 0.0 bit VS binpacker

A binary stream packer and unpacker
iter

4.9 0.0 bit VS iter

Go implementation of C++ STL iterators and algorithms.
deque

4.8 3.4 bit VS deque

A highly optimized double-ended queue
bloom

4.8 0.0 bit VS bloom

Bloom filters implemented in Go.
encoding

4.5 0.0 bit VS encoding

Integer Compression Libraries for Go
ring

4.5 0.0 bit VS ring

Package ring provides a high performance and thread safe Go implementation of a bloom filter.
go-rquad

4.4 0.0 bit VS go-rquad

:pushpin: State of the art point location and neighbour finding algorithms for region quadtrees, in Go
remember-go

4.4 0.0 bit VS remember-go

Cache Slow Database Queries
memlog

4.2 5.4 bit VS memlog

A Kafka log inspired in-memory and append-only data structure
skiplist

4.2 0.0 bit VS skiplist

skiplist for golang
go-mcache

4.2 0.0 bit VS go-mcache

Fast in-memory key:value store/cache with TTL
crunch

4.0 0.0 bit VS crunch

take bytes out of things easily ✨🍪
set

3.8 0.0 bit VS set

A simple Set data structure implementation in Go (Golang) using LinkedHashMap.
nan

3.8 3.0 bit VS nan

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

3.8 3.7 bit VS cmap

a thread-safe concurrent map for go
timedmap

3.5 6.2 bit VS timedmap

A thread safe map which has expiring key-value pairs.
hide

3.4 0.0 bit VS hide

A Go type to prevent internal numeric IDs from being exposed to clients using HashIDs and JSON.
go-tuple

3.4 3.2 bit VS go-tuple

Go 1.18+ generic tuple
goset

3.3 0.0 bit VS goset

Set is a useful collection but there is no built-in implementation in Go lang.
pipeline

3.3 0.0 bit VS pipeline

Pipelines using goroutines
treemap

3.2 1.8 bit VS treemap

Generic sorted map for Go with red-black tree under the hood
count-min-log

3.2 0.0 bit VS count-min-log

Go implementation of Count-Min-Log

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

Add another 'Data Structures' Package

Popular Comparisons

README

Your basic bit

Set data structure for positive numbers

A bit array, or bit set, is an efficient set data structure. It consists of an array that compactly stores bits and it uses bit-level parallelism to perform operations quickly.

[Venn diagram](venn.png)

Installation

Once you have installed Go, run this command to install the bit package:

go get github.com/yourbasic/bit

Documentation

There is an online reference for the package at godoc.org/github.com/yourbasic/bit.

Roadmap

The API of this library is frozen.
Version numbers adhere to semantic versioning.

The only accepted reason to modify the API of this package is to handle issues that can't be resolved in any other reasonable way.

Stefan Nilsson – korthaj

bit

Bitset data structure