Pretty simple implementation of prefix tree for matching byte arrays
-
Updated
May 25, 2022 - Go
Pretty simple implementation of prefix tree for matching byte arrays
A simple benchmark of Go/Golang radix tree implementations
ByteTrie - Implementation Trie algorithm for bytes in Go with memory optimization.
A fast phrases completion library using trie tree. Also provide path compression for lower memory usage
extensible, high-performance configuration management library, optimized for hierarchical data
A trie-tree string-matching in golang, fatster than trie 2 regex.
A simple and serializable radix tree implementation in Go/Golang.
trie implementation in go that supports runes
An in-memory index which finds a keyword in millions of pathnames within milliseconds.
Missing Trie implementation for Go
Add a description, image, and links to the trie-tree topic page so that developers can more easily learn about it.
To associate your repository with the trie-tree topic, visit your repo's landing page and select "manage topics."