Popularity

4.9

Growing

Activity

3.4

Stable

Stars 199

Watchers 4

Forks 8

Last Commit over 1 year ago

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.

gods

9.8 4.7 deque VS gods

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

9.4 7.3 deque VS go-datastructures

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

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

golang-set

8.8 4.7 deque 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 deque VS gota

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

8.5 2.6 deque VS FSM for Go

Finite State Machine for Go
roaring

8.4 7.9 deque VS roaring

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

8.3 4.1 deque VS willf/bloom

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

8.3 6.8 deque VS gocache

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

7.8 4.0 deque VS boomfilters

Probabilistic data structures for processing continuous, unbounded streams.
bitset

7.7 8.1 deque VS bitset

Go package implementing bitsets
cuckoofilter

7.4 2.1 deque VS cuckoofilter

Cuckoo Filter: Practically Better Than Bloom
gostl

7.4 4.7 deque VS gostl

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

7.2 6.8 deque VS hyperloglog

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

7.1 0.0 deque VS algorithms

CLRS study. Codes are written with golang.
trie

7.0 2.5 deque VS trie

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

6.7 0.0 deque VS merkletree

A Merkle Tree implementation written in Go.
ttlcache

6.5 6.4 deque 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 deque VS go-geoindex

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

6.1 0.0 deque VS goconcurrentqueue

Go concurrent-safe, goroutine-safe, thread-safe queue
go-adaptive-radix-tree

6.1 7.2 deque VS go-adaptive-radix-tree

Adaptive Radix Trees implemented in Go
conjungo

6.0 1.3 deque VS conjungo

DISCONTINUED. A small flexible merge library in go
levenshtein

6.0 5.5 deque VS levenshtein

Go implementation to calculate Levenshtein Distance.
mafsa

6.0 0.0 deque VS mafsa

DISCONTINUED. MA-FSA implementation with Minimal Perfect Hashing
Bloomfilter

6.0 0.0 deque VS Bloomfilter

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

5.9 0.0 deque 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 deque VS goskiplist

A skip list implementation in Go
bitmap

5.7 4.3 deque VS bitmap

Simple dense bitmap index in Go with binary operators
cuckoo-filter

5.6 0.0 deque VS cuckoo-filter

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

5.4 0.0 deque VS binpacker

A binary stream packer and unpacker
bit

5.0 0.0 deque VS bit

Bitset data structure
iter

4.9 0.0 deque VS iter

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

4.7 0.0 deque VS bloom

Bloom filters implemented in Go.
encoding

4.5 0.0 deque VS encoding

Integer Compression Libraries for Go
remember-go

4.5 0.0 deque VS remember-go

Cache Slow Database Queries
ring

4.5 0.0 deque VS ring

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

4.4 0.0 deque VS go-rquad

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

4.2 6.0 deque VS memlog

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

4.2 0.0 deque VS skiplist

skiplist for golang
go-mcache

4.1 0.0 deque VS go-mcache

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

4.0 0.0 deque VS crunch

take bytes out of things easily ✨🍪
nan

3.8 3.0 deque VS nan

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

3.8 0.0 deque VS set

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

3.8 3.7 deque VS cmap

a thread-safe concurrent map for go
go-tuple

3.6 3.2 deque VS go-tuple

Go 1.18+ generic tuple
timedmap

3.5 6.2 deque VS timedmap

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

3.3 0.0 deque VS hide

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

3.3 0.0 deque VS goset

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

3.2 0.0 deque VS fsm

Finite State Machine package in Go
count-min-log

3.2 2.1 deque VS count-min-log

Go implementation of Count-Min-Log
treemap

3.2 1.8 deque VS treemap

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

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

Add another 'Data Structures' Package

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]

Documentation

https://godoc.org/github.com/edwingeng/deque

deque

A highly optimized double-ended queue