Popularity

3.9

Growing

Activity

6.8

Growing

Stars 93

Watchers 5

Forks 3

Last Commit 3 months 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 8.4 deque VS gods

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

9.5 0.0 deque VS go-datastructures

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

Build time-series-based applications quickly and at scale.

InfluxDB is the Time Series Platform where developers build real-time applications for analytics, IoT and cloud-native services. Easy to start, it is available in the cloud or on-premises.

Promo www.influxdata.com

golang-set

8.7 5.4 deque VS golang-set

A simple 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.4 4.2 deque VS FSM for Go

Finite State Machine for Go
willf/bloom

8.2 7.0 deque VS willf/bloom

Go package implementing Bloom filters
roaring

8.2 5.1 deque VS roaring

Roaring bitmaps in Go (golang)
gocache

8.0 7.5 deque VS gocache

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

7.9 0.0 deque VS boomfilters

Probabilistic data structures for processing continuous, unbounded streams.
bitset

7.6 4.4 deque VS bitset

Go package implementing bitsets
cuckoofilter

7.4 1.3 deque VS cuckoofilter

Cuckoo Filter: Practically Better Than Bloom
algorithms

7.2 0.0 deque VS algorithms

CLRS study. Codes are written with golang.
gostl

7.2 1.7 deque VS gostl

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

7.2 0.0 deque VS hyperloglog

HyperLogLog with lots of sugar (Sparse, LogLog-Beta bias correction and TailCut space reduction)
trie

7.1 0.0 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.
go-geoindex

6.6 0.0 deque VS go-geoindex

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

6.5 6.4 deque VS ttlcache

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

6.2 0.0 deque VS conjungo

A small flexible merge library in go
hilbert

6.0 0.0 deque VS hilbert

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

6.0 0.0 deque VS Bloomfilter

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

6.0 0.0 deque VS mafsa

MA-FSA implementation with Minimal Perfect Hashing
goskiplist

6.0 0.0 deque VS goskiplist

A skip list implementation in Go
go-adaptive-radix-tree

5.8 0.6 deque VS go-adaptive-radix-tree

Adaptive Radix Trees implemented in Go
levenshtein

5.6 2.0 deque VS levenshtein

Go implementation to calculate Levenshtein Distance.
goconcurrentqueue

5.5 3.3 deque VS goconcurrentqueue

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

5.5 0.0 deque VS binpacker

A binary stream packer and unpacker
cuckoo-filter

5.5 0.0 deque VS cuckoo-filter

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

5.2 4.7 deque VS bitmap

Simple dense bitmap index in Go with binary operators
bit

5.0 0.0 deque VS bit

Bitset data structure
iter

5.0 5.8 deque VS iter

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

4.9 0.0 deque VS bloom

Bloom filters implemented in Go.
encoding

4.8 0.0 deque VS encoding

Integer Compression Libraries for Go
ring

4.6 0.0 deque VS ring

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

4.4 0.0 deque VS remember-go

Cache Slow Database Queries
skiplist

4.4 0.0 deque VS skiplist

skiplist for golang
go-rquad

4.3 0.0 deque VS go-rquad

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

4.2 0.0 deque VS go-mcache

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

3.8 0.0 deque VS set

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

3.6 2.3 deque VS crunch

take bytes out of things easily ✨🍪
goset

3.5 0.0 deque VS goset

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

3.5 2.3 deque VS nan

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

3.5 3.4 deque VS memlog

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

3.2 0.0 deque VS hide

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

3.2 0.0 deque VS count-min-log

Go implementation of Count-Min-Log
timedmap

3.2 0.0 deque VS timedmap

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

3.1 2.0 deque VS ptrie

A prefix tree implementation in go
pipeline

3.0 0.0 deque VS pipeline

Pipelines using goroutines
cmap

2.8 2.3 deque VS cmap

a thread-safe concurrent map for go
go-tuple

2.6 3.6 deque VS go-tuple

Go 1.18 generic tuples

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