Popularity
4.9
Growing
Activity
3.4
Stable
199
4
8
Programming language: Go
License: BSD 3-clause "New" or "Revised" License
Tags:
Data Structures
deque alternatives and similar packages
Based on the "Data Structures" category.
Alternatively, view deque alternatives based on common mentions on social networks and blogs.
-
golang-set
A simple, battle-tested and generic set type for the Go language. Trusted by Docker, 1Password, Ethereum and Hashicorp. -
hyperloglog
HyperLogLog with lots of sugar (Sparse, LogLog-Beta bias correction and TailCut space reduction) brought to you by Axiom -
ttlcache
DISCONTINUED. An in-memory cache with item expiration and generics [Moved to: https://github.com/jellydator/ttlcache] -
Bloomfilter
DISCONTINUED. Face-meltingly fast, thread-safe, marshalable, unionable, probability- and optimal-size-calculating Bloom filter in go -
hilbert
DISCONTINUED. Go package for mapping values to and from space-filling curves, such as Hilbert and Peano curves. -
cuckoo-filter
Cuckoo Filter go implement, better than Bloom Filter, configurable and space optimized 布谷鸟过滤器的Go实现,优于布隆过滤器,可以定制化过滤器参数,并进行了空间优化 -
go-rquad
:pushpin: State of the art point location and neighbour finding algorithms for region quadtrees, in Go -
nan
Zero allocation Nullable structures in one library with handy conversion functions, marshallers and unmarshallers -
hide
A Go type to prevent internal numeric IDs from being exposed to clients using HashIDs and JSON.
InfluxDB – Built for High-Performance Time Series Workloads
InfluxDB 3 OSS is now GA. Transform, enrich, and act on time series data directly in the database. Automate critical tasks and eliminate the need to move data externally. Download now.
Promo
www.influxdata.com

Do you think we are missing an alternative of deque or a related project?
Popular Comparisons
README
Overview
Deque is a highly optimized double-ended queue.
Benchmark
Benchmark_PushBack/Deque<harden> 100000000 10.3 ns/op 9 B/op 0 allocs/op
Benchmark_PushBack/Deque 20000000 81.3 ns/op 24 B/op 1 allocs/op
Benchmark_PushBack/list.List 5000000 281 ns/op 56 B/op 2 allocs/op
Benchmark_PushFront/Deque<harden> 195840157 7.96 ns/op 9 B/op 0 allocs/op
Benchmark_PushFront/Deque 30000000 70.6 ns/op 24 B/op 1 allocs/op
Benchmark_PushFront/list.List 5000000 276 ns/op 56 B/op 2 allocs/op
Benchmark_Random/Deque<harden> 65623633 17.3 ns/op 0 B/op 0 allocs/op
Benchmark_Random/Deque 50000000 32.1 ns/op 4 B/op 0 allocs/op
Benchmark_Random/list.List 30000000 123 ns/op 28 B/op 1 allocs/op
Usage
import "github.com/edwingeng/deque"
dq := NewDeque()
dq.PushBack(100)
dq.PushBack(200)
dq.PushBack(300)
for !dq.Empty() {
fmt.Println(dq.PopFront())
}
dq.PushFront(100)
dq.PushFront(200)
dq.PushFront(300)
for i, n := 0, dq.Len(); i < n; i++ {
fmt.Println(dq.PopFront())
}
// Output:
// 100
// 200
// 300
// 300
// 200
// 100
Harden the element data type
./harden.sh <outputDir> <packageName> [elemType]