Popularity

2.7

Growing

Activity

0.0

Stable

Stars 39

Watchers 4

Forks 2

Last Commit about 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 8.9 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.

Deliver Cleaner and Safer Code - Right in Your IDE of Choice!

SonarLint is a free and open source IDE extension that identifies and catches bugs and vulnerabilities as you code, directly in the IDE. Install from your favorite IDE marketplace today.

Promo www.sonarlint.org

golang-set

8.6 7.3 deque VS golang-set

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

8.5 2.7 deque VS gota

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

8.3 1.0 deque VS FSM for Go

Finite State Machine for Go
roaring

8.2 6.4 deque VS roaring

Roaring bitmaps in Go (golang)
willf/bloom

8.1 3.3 deque VS willf/bloom

Go package implementing Bloom filters
gocache

7.9 6.6 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.7 deque VS bitset

Go package implementing bitsets
cuckoofilter

7.4 2.0 deque VS cuckoofilter

Cuckoo Filter: Practically Better Than Bloom
hyperloglog

7.2 2.7 deque VS hyperloglog

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

7.2 0.0 deque VS algorithms

CLRS study. Codes are written with golang.
gostl

7.1 2.9 deque VS gostl

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

7.1 0.0 deque VS trie

Data structure and relevant algorithms for extremely fast prefix/fuzzy string searching.
go-geoindex

6.6 0.0 deque VS go-geoindex

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

6.5 0.0 deque VS merkletree

A Merkle Tree implementation written in Go.
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
mafsa

6.0 0.0 deque VS mafsa

MA-FSA implementation with Minimal Perfect Hashing
Bloomfilter

6.0 0.0 deque VS Bloomfilter

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

6.0 0.0 deque VS goskiplist

A skip list implementation in Go
hilbert

5.9 0.0 deque VS hilbert

Go package for mapping values to and from space-filling curves, such as Hilbert and Peano curves.
go-adaptive-radix-tree

5.7 0.3 deque VS go-adaptive-radix-tree

Adaptive Radix Trees implemented in Go
binpacker

5.5 0.4 deque VS binpacker

A binary stream packer and unpacker
cuckoo-filter

5.4 1.5 deque VS cuckoo-filter

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

5.3 0.0 deque VS levenshtein

Go implementation to calculate Levenshtein Distance.
goconcurrentqueue

5.2 4.1 deque VS goconcurrentqueue

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

4.9 0.0 deque VS bloom

Bloom filters implemented in Go.
iter

4.9 7.1 deque VS iter

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

4.9 4.3 deque VS bitmap

Simple dense bitmap index in Go with binary operators
bit

4.8 0.0 deque VS bit

Bitset data structure
encoding

4.7 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
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
skiplist

4.3 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
set

3.8 1.0 deque VS set

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

3.6 4.7 deque VS crunch

take bytes out of things easily ✨🍪
nan

3.3 4.8 deque VS nan

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

3.3 0.0 deque VS goset

Set is a useful collection but there is no built-in implementation in Go lang.
count-min-log

3.2 0.0 deque VS count-min-log

Go implementation of Count-Min-Log
ptrie

3.1 2.6 deque VS ptrie

A prefix tree implementation in go
hide

3.1 0.0 deque VS hide

ID type with marshalling to/from hash to prevent sending IDs to clients.
memlog

3.0 6.4 deque VS memlog

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

2.9 0.0 deque VS timedmap

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

2.9 0.0 deque VS pipeline

Pipelines using goroutines
go-ef

2.3 0.0 deque VS go-ef

A Go implementation of the Elias-Fano encoding
null

2.3 0.0 deque VS null

Nullable Go types that can be marshalled/unmarshalled to/from JSON.

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