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