1. Only showing results from lib.rs

    Clear filter to show all search results

  2. 2 days agoa first one based on Patricia trie which can be viewed as a standard map or set with a lookup operation for finding the longest prefix match; a compressed one based one Level-Compressed trie (LC-Trie), optimized for lookup operation (longest prefix match) but which can't be modified;
  3. 7 days agoSee also: qp-trie, ego-tree, tree-ds, hibit_tree, id_tree, orange-trees, trie-db, yada, radix_trie, patricia_tree, prefix-trie Lib.rs is an unofficial list of Rust/Cargo crates, created by kornelski.It contains data from multiple sources, including heuristics, and manually curated data.Content of this page is not necessarily endorsed by the authors of the crate.
  4. May 14, 2024A generic implementation of the Base-16 Modified Merkle Tree ("Trie") data structure, provided under the Apache2 license. The implementation comes in two formats: Trie DB (trie-db crate) which can be combined with a backend database to provide a persistent trie structure whose contents can be modified and whose root hash is recalculated ...
  5. Dec 18, 2024See also: prefix-trie, trie-rs, radix_trie, hibit_tree, plain_trie, patricia_tree, qp-trie, rotonda-store, vart, tetengo_trie, ptrie Lib.rs is an unofficial list of Rust/Cargo crates, created by kornelski.It contains data from multiple sources, including heuristics, and manually curated data.Content of this page is not necessarily endorsed by the authors of the crate.
  6. Apr 9, 2024See also: radix_trie, patricia_tree, prefix-trie, hibit_tree, ego-tree, trie-rs, tree-ds, id_tree, orange-trees, yada, qp-trie Lib.rs is an unofficial list of Rust/Cargo crates, created by kornelski.It contains data from multiple sources, including heuristics, and manually curated data.Content of this page is not necessarily endorsed by the authors of the crate.
  7. Jul 21, 2024This crate is a rust-based radix tree implementation. Radix tree, also known as Trie, is a space-optimized tree data structure for efficient information retrieval. Its key advantages are space optimization, fast prefix-based searches, and efficient memory usage. Radix trees are widely used, especially in HTTP routers. Features. Fast prefix ...
  8. Dec 9, 2024357 downloads per month Used in 3 crates (via curies) . Custom license. 28KB 305 lines. 🎄 Prefix Trie PTrie is a generic implementation of the trie data structure with no dependencies, tailored for easy and efficient prefix and postfix search within a collection of objects, such as strings.. The structure is defined as Trie<K, V>, where K represents the type of keys in each node (an ...
  9. Related: ordered_iter, compare, linear-map, vec_map, linked-hash-map See also: qp-trie, trie-rs, trie-root, patricia_tree, basic_trie, trie-db, radix_trie, indextree, yada, cita_trie, lr_trie. Lib.rs is an unofficial list of Rust/Cargo crates, created by kornelski. It contains data from multiple sources, including heuristics, and manually ...
  10. Jul 3, 2024See also: trie-rs, prefix-trie, radix_trie, patricia_tree, basic_trie, plain_trie, rotonda-store, tetengo_trie, radixmap, regex, pfx Lib.rs is an unofficial list of Rust/Cargo crates, created by kornelski.It contains data from multiple sources, including heuristics, and manually curated data.Content of this page is not necessarily endorsed by the authors of the crate.

    Can’t find what you’re looking for?

    Help us improve DuckDuckGo searches with your feedback

Custom date rangeX