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