Fast Merkle-Patricia Trie (MPT) state root calculator and proof generator for prefix-sorted nibbles
-
Updated
Jun 4, 2024 - Rust
Fast Merkle-Patricia Trie (MPT) state root calculator and proof generator for prefix-sorted nibbles
A collection of utility functions and data structures for rust.
Memory efficient trie (prefix tree) library based on LOUDS
A comprehensive proofs handler for Ethereum trie
A Radix trie for suggestion search, it allows searching for data indexed by a set of keywords fast.
🎄 Generic trie data structure (prefix tree) in Rust, with functions to search for common prefixes and postfixes
An idiomatic and fast QP-trie implementation in pure Rust.
A Rust Auto-complete feature using Trie data structure
trie data structure
🦀 Rust crate that allows creating weighted prefix trees that can be used in autocomplete
Leetcode Solutions in Rust, Advent of Code Solutions in Rust and more
Fast generic radix trie implemented in Rust
🦞 Rust library of natural language dictionaries using character-wise double-array tries.
Rust library providing fast language model queries in compressed space
Add a description, image, and links to the trie topic page so that developers can more easily learn about it.
To associate your repository with the trie topic, visit your repo's landing page and select "manage topics."