Data Structures (63)
PAMT
emirpasicgods
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, JSONPAMT
Workivago-datastructures
A collection of useful, performant, and threadsafe Go datastructures.PAMT
bits-and-bloomsbitset
Go package implementing bitsetsPAMT
deckarepgolang-set
A simple set type for the Go language. Trusted by Docker, 1Password, Ethereum and Hashicorp.PAMT
bits-and-bloomsbloom
Go package implementing Bloom filtersPAMT
RoaringBitmaproaring
Roaring bitmaps in Go (golang)PAMT
tylertreatBoomFilters
Probabilistic data structures for processing continuous, unbounded streams.PAMT
PAMT
seiflotfycuckoofilter
Cuckoo Filter: Practically Better Than BloomPAMT
PAMT
derekparkertrie
Data structure and relevant algorithms for extremely fast prefix/fuzzy string searching.PAMT
axiomhqhyperloglog
HyperLogLog with lots of sugar (Sparse, LogLog-Beta bias correction and TailCut space reduction)PAMT
superwhiskerscrunch
take bytes out of things easilyPAMT
PAMT
tejzprordered-concurrently
Ordered-concurrently a library for parallel processing with ordered output in Go. Process work concurrently / in parallel and returns output in a channel in the order of input. It is useful in concurrently / parallelly processing items in a queue, and get output in the order provided by the queue.PAMT
rocketlaunchrremember-go
Cache Slow Database QueriesPAMT
InVisionAppconjungo
A small flexible merge library in goPAMT
ryszardgoskiplist
A skip list implementation in GoPAMT
agextlevenshtein
Levenshtein distance and similarity metrics with customizable edit costs and Winkler-like bonus for common prefix.PAMT
cbergoonmerkletree
A Merkle Tree implementation written in Go.PAMT