”patricia-trie“ 的搜索结果

A simplified golang implementation of Ethereum's Modified Patricia Trie.

Base-16 Modified Patricia Merkle Tree (aka Trie)

Practical Algorithm to Retrieve Information Coded in Alphanumeric (PATRICIA)

PATRICIA, Double Array, LOUDS Trie implementations for Java

#算法刷题#.NET Implementations of Trie Data Structures for Substring Search, Auto-completion and Intelli-sense. Includes: patricia trie, suffix trie and a trie implementation using Ukkonen's algorithm.

A generic patricia trie (also called radix tree) implemented in Go (Golang)

Rust implementation of the Modified Patricia Tree (aka Trie).

A demo of Merkle Patricia Tries for Lab07

STL like container of radix tree (a.k.a. PATRICIA trie) in C++

Fast, robust and memory-savvy IP radix tree (Patricia trie) implementation in Java

A path-compressed Patricia trie, with one-way branching removed, using bitstrings for keys

Patricia Merkle Tree implementation in Rust

LSM-trie

Static memory-efficient Trie-like structures for Python based on marisa-trie C++ library.

Garbage collector-sensitive patricia tree for IP/CIDR tagging

👓 composable trie based router

Data structure and relevant algorithms for extremely fast prefix/fuzzy string searching.

Fast, zero heap allocation Go Trie for runes or paths

Python library implementing a trie data structure.

Fast compressed trie dictionary library

Big-endian Patricia tree IntMap implementation in Purescript.

🚍 High-performance trie-node router.