Popularity

2.6

Growing

Activity

0.0

Declining

Stars 38

Watchers 4

Forks 4

Last Commit about 1 year ago

Programming language: Go

License: MIT License

Tags: Data Structures

2q alternatives and similar packages

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

gods

9.7 3.1 2q VS gods

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

9.4 4.8 2q VS go-datastructures

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

InfluxDB - Power Real-Time Data Analytics at Scale

Get real-time insights from all types of time series data with InfluxDB. Ingest, query, and analyze billions of data points in real-time with unbounded cardinality.

Promo www.influxdata.com

golang-set

8.8 5.3 2q 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 2q VS gota

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

8.5 3.8 2q VS FSM for Go

Finite State Machine for Go
roaring

8.3 7.6 2q VS roaring

Roaring bitmaps in Go (golang), used by InfluxDB, Bleve, DataDog
willf/bloom

8.3 4.8 2q VS willf/bloom

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

8.2 6.1 2q VS gocache

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

7.8 0.0 2q VS boomfilters

Probabilistic data structures for processing continuous, unbounded streams.
bitset

7.7 6.6 2q VS bitset

Go package implementing bitsets
cuckoofilter

7.4 0.0 2q VS cuckoofilter

Cuckoo Filter: Practically Better Than Bloom
gostl

7.4 4.1 2q VS gostl

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

7.2 0.0 2q VS algorithms

CLRS study. Codes are written with golang.
hyperloglog

7.2 3.3 2q VS hyperloglog

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

7.1 4.2 2q VS trie

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

6.7 0.0 2q VS merkletree

A Merkle Tree implementation written in Go.
ttlcache

6.5 6.4 2q VS ttlcache

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

6.5 0.0 2q VS go-geoindex

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

6.1 1.3 2q VS conjungo

A small flexible merge library in go
Bloomfilter

6.0 0.0 2q VS Bloomfilter

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

6.0 0.0 2q VS go-adaptive-radix-tree

Adaptive Radix Trees implemented in Go
mafsa

6.0 0.0 2q VS mafsa

DISCONTINUED. MA-FSA implementation with Minimal Perfect Hashing
goconcurrentqueue

6.0 0.0 2q VS goconcurrentqueue

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

5.9 0.0 2q VS hilbert

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

5.8 0.0 2q VS levenshtein

Go implementation to calculate Levenshtein Distance.
goskiplist

5.8 0.0 2q VS goskiplist

A skip list implementation in Go
cuckoo-filter

5.6 0.0 2q VS cuckoo-filter

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

5.5 4.3 2q VS bitmap

Simple dense bitmap index in Go with binary operators
binpacker

5.5 0.0 2q VS binpacker

A binary stream packer and unpacker
bit

5.0 0.0 2q VS bit

Bitset data structure
iter

4.9 0.0 2q VS iter

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

4.8 0.0 2q VS bloom

Bloom filters implemented in Go.
deque

4.8 3.4 2q VS deque

A highly optimized double-ended queue
encoding

4.6 0.0 2q VS encoding

Integer Compression Libraries for Go
remember-go

4.5 0.0 2q VS remember-go

Cache Slow Database Queries
ring

4.5 0.0 2q VS ring

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

4.4 0.0 2q VS go-rquad

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

4.3 0.0 2q VS skiplist

skiplist for golang
go-mcache

4.2 0.0 2q VS go-mcache

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

4.0 6.3 2q VS memlog

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

3.9 0.0 2q VS crunch

take bytes out of things easily ✨🍪
set

3.9 0.0 2q VS set

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

3.8 3.0 2q VS nan

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

3.7 3.7 2q VS cmap

a thread-safe concurrent map for go
timedmap

3.6 4.2 2q VS timedmap

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

3.4 0.0 2q VS goset

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

3.4 3.2 2q VS go-tuple

Go 1.18+ generic tuple
ptrie

3.3 4.4 2q VS ptrie

A prefix tree implementation in go
hide

3.3 0.0 2q VS hide

ID type with marshalling to/from hash to prevent sending IDs to clients.
count-min-log

3.3 0.0 2q VS count-min-log

Go implementation of Count-Min-Log

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

Add another 'Data Structures' Package

Popular Comparisons

README

2q

Thread safe GoLang 2Q cache.

Example

import (
    "fmt"

    twoqueue "github.com/floatdrop/2q"
)

func main() {
    cache := twoqueue.New[string, int](256)

    cache.Set("Hello", 5)

    if e := cache.Get("Hello"); e != nil {
        fmt.Println(*e)
        // Output: 5
    }
}

TTL

See LRU TTL example.

Benchmarks

floatdrop/twoqueue:
    Benchmark2Q_Rand-8       4384994           264.5 ns/op        46 B/op          3 allocs/op
    Benchmark2Q_Freq-8       4862632           243.9 ns/op        44 B/op          3 allocs/op

hashicorp/golang-lru:
    Benchmark2Q_Rand-8       2847627           411.9 ns/op       135 B/op          5 allocs/op
    Benchmark2Q_Freq-8       3323764           354.2 ns/op       122 B/op          5 allocs/op

2q

2Q in-memory cache implementation.

2q alternatives and similar packages

Popular Comparisons

README

2q

Example

TTL

Benchmarks