Popularity

1.8

Growing

Activity

0.0

Stable

Stars 12

Watchers 3

Forks 3

Last Commit almost 2 years ago

Programming language: Go

License: MIT License

Tags: Data Structures

treap alternatives and similar packages

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

gods

9.7 0.0 treap VS gods

GoDS (Go Data Structures). Containers (Sets, Lists, Stacks, Maps, Trees), Sets (HashSet, TreeSet, LinkedHashSet), Lists (ArrayList, SinglyLinkedList, DoublyLinkedList), Stacks (LinkedListStack, ArrayStack), Maps (HashMap, TreeMap, HashBidiMap, TreeBidiMap, LinkedHashMap), Trees (RedBlackTree, AVLTree, BTree, BinaryHeap), Comparators, Iterators, Enumerables, Sort, JSON
go-datastructures

9.5 3.9 treap VS go-datastructures

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

Run Linux Software Faster and Safer than Linux with Unikernels

Promo github.com/nanovms

golang-set

8.5 0.1 treap VS golang-set

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

8.4 5.8 treap VS gota

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

8.2 1.3 treap VS FSM for Go

Finite State Machine for Go
willf/bloom

8.0 6.7 treap VS willf/bloom

Go package implementing Bloom filters
roaring

7.9 7.5 treap VS roaring

Roaring bitmaps in Go (golang)
boomfilters

7.9 1.2 treap VS boomfilters

Probabilistic data structures for processing continuous, unbounded streams.
gocache

7.6 7.3 treap VS gocache

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

7.4 3.0 treap VS bitset

Go package implementing bitsets
cuckoofilter

7.3 1.8 treap VS cuckoofilter

Cuckoo Filter: Practically Better Than Bloom
hyperloglog

7.2 2.0 treap VS hyperloglog

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

7.1 0.0 treap VS algorithms

CLRS study. Codes are written with golang.
trie

7.0 0.0 treap VS trie

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

6.6 0.0 treap VS go-geoindex

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

6.3 0.3 treap VS gostl

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

6.2 0.0 treap VS conjungo

A small flexible merge library in go
ttlcache

6.1 6.7 treap VS ttlcache

An in-memory string-interface{} map with various expiration options for golang
merkletree

6.1 0.0 treap VS merkletree

A Merkle Tree implementation written in Go.
Bloomfilter

6.0 0.0 treap VS Bloomfilter

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

6.0 0.0 treap VS mafsa

MA-FSA implementation with Minimal Perfect Hashing
goskiplist

6.0 0.0 treap VS goskiplist

A skip list implementation in Go
hilbert

5.9 0.0 treap VS hilbert

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

5.5 0.1 treap VS go-adaptive-radix-tree

Adaptive Radix Trees implemented in Go
binpacker

5.5 1.1 treap VS binpacker

A binary stream packer and unpacker
levenshtein

5.0 2.9 treap VS levenshtein

Go implementation to calculate Levenshtein Distance.
cuckoo-filter

5.0 6.0 treap VS cuckoo-filter

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

5.0 0.0 treap VS bloom

Bloom filters implemented in Go.
iter

4.7 0.0 treap VS iter

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

4.7 0.0 treap VS goconcurrentqueue

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

4.6 0.0 treap VS bit

Bitset data structure
encoding

4.6 0.0 treap VS encoding

Integer Compression Libraries for Go
ring

4.5 0.0 treap VS ring

Package ring provides a high performance and thread safe Go implementation of a bloom filter.
skiplist

4.4 0.0 treap VS skiplist

skiplist for golang
go-rquad

4.4 0.0 treap VS go-rquad

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

4.3 1.2 treap VS remember-go

Cache Slow Database Queries
bitmap

4.1 7.2 treap VS bitmap

Simple dense bitmap index in Go with binary operators
go-mcache

4.0 0.0 treap VS go-mcache

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

3.7 0.0 treap VS set

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

3.4 3.1 treap VS crunch

take bytes out of things easily ✨🍪
goset

3.2 0.0 treap VS goset

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

3.1 0.0 treap VS count-min-log

Go implementation of Count-Min-Log
nan

3.1 3.7 treap VS nan

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

2.9 1.0 treap VS hide

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

2.7 0.0 treap VS ptrie

A prefix tree implementation in go
pipeline

2.6 0.0 treap VS pipeline

Pipelines using goroutines
timedmap

2.5 5.6 treap VS timedmap

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

2.4 0.0 treap VS deque

A highly optimized double-ended queue
go-ef

2.1 0.0 treap VS go-ef

A Go implementation of the Elias-Fano encoding
null

2.1 0.8 treap VS null

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

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

Add another 'Data Structures' Package

Popular Comparisons

README

treap

Package treap implements an immutabe sorted set datastructure using a combination tree/heap or treap.

The algorithms are mostly based on Fast Set Operations Using Treaps

Although the package is oriented towards ordered sets, it is simple to convert it to work as a persistent map. There is a working example showing how to do this.

Benchmark stats

The most interesting benchmark is the performance of insert where a single random key is inserted into a 5k sized map. As the example shows, the treap structure does well here as opposed to a regular immutable map (using full copying). This benchmark does not take into account the fact that the regular maps are not sorted unlike treaps.

The intersection benchmark compares the case where two 10k sets with 5k in common being interesected. The regular map is about 30% faster but this is still respectable showing for treaps.

$ go test --bench=. -benchmem
goos: darwin
goarch: amd64
pkg: github.com/perdata/treap
BenchmarkInsert-4                        1000000          2347 ns/op        1719 B/op         36 allocs/op
BenchmarkInsertRegularMap-4                 2000        890745 ns/op      336311 B/op          8 allocs/op
BenchmarkIntersection-4                      500       3125772 ns/op     1719838 B/op      35836 allocs/op
BenchmarkIntersectionRegularMap-4            500       2436519 ns/op      718142 B/op        123 allocs/op
BenchmarkUnion-4                            1000       1451047 ns/op      939846 B/op      19580 allocs/op
BenchmarkDiff-4                              500       3280823 ns/op     1742080 B/op      36298 allocs/op
PASS

treap

golang persistent immutable treap sorted sets

treap alternatives and similar packages

Popular Comparisons

README

treap

Benchmark stats