There are 0 repository under patricia-tree topic.
PruningRadixTrie - 1000x faster Radix trie for prefix search & auto-complete
A generic patricia trie (also called radix tree) implemented in Go (Golang)
A memory-efficient patricia tree implementation written in Rust
A library of binary tree data structures (bstree, dstree, trie, crit-bit, PATRICIA) implemented in C
Instant auto suggestion and completion
An example showing how to read Merkle Patricia Trie for Ethereum block or contract
Patricia Tree data structure in OCaml for maps and sets, supports generic (GADT) keys
Various merkle trees
Store CIDR IP addresses (both v4 and v6) in a trie for easy lookup.
Multi Key Radix PATRICIA Fast Search - OO C++ - a C++ header file only class
A serializable compact prefix tree (also known as Radix tree or Patricia tree or space-optimized trie) implementation in JavaScript.
Implementation of a Patricia/radix tree data structure, storing a dictionary.
A java implementation of patricia-merkle-trie data structure
Persistent set of integers, implemented using PATRICIA tree data structure
Provides different Java implementations of tries (prefix trees)
A cross-process, memory-resident, lock-free-read LPM engine with per-prefix TTLs and tags; plus a tiny, language-agnostic C ABI.
Árvores PATRICIA em Python.
Practical Works Algorithm and Data Structures II
Qt to XML serialization/deserialization example
Patricia trie on C++
Implementation of Radix Tree assuming use in HTTP Router.
UC3M "Introduction to Switching" Lab Project
A prefix tree implementation for Java.
Implementation of the Patricia Trie and the Hybrid Trie in Java
Trabalho Prático de AEDS 2, que consiste em uma máquina de busca de palavras com árvore PATRICIA e tabela Hash usando índice invertido
Тест-программа по теме PATRICIA-дерево