Fast, zero heap allocation Go Trie for runes or paths
MIT License
Surprisingly space efficient trie in Golang(11 bits/key; 100 ns/get).
Efficient URL routing using a Trie data structure.
GC-less, fast and generic LRU hashmap library for Go
GoDS (Go Data Structures) - Sets, Lists, Stacks, Maps, Trees, Queues, and much more
A Golang library for matching REST-like URL path patterns
🔥 Fast, simple sklearn-like feature processing for Go
Reference implementations of heap data structures in Go - treap, skew, leftlist, pairing, fibonacci
A collection of useful, performant, and threadsafe Go datastructures.
A collection of generic data structures written in Go.
[WIP] Implementation of HAT-trie in Go