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