https://github.com/narsil/trie-rs
Smallish implementation for a trie in Rust
https://github.com/narsil/trie-rs
Last synced: 3 months ago
JSON representation
Smallish implementation for a trie in Rust
- Host: GitHub
- URL: https://github.com/narsil/trie-rs
- Owner: Narsil
- License: mit
- Created: 2020-06-27T16:21:02.000Z (almost 5 years ago)
- Default Branch: master
- Last Pushed: 2020-06-27T19:19:06.000Z (almost 5 years ago)
- Last Synced: 2025-01-24T00:31:52.000Z (5 months ago)
- Language: Rust
- Size: 5.86 KB
- Stars: 0
- Watchers: 2
- Forks: 0
- Open Issues: 0
-
Metadata Files:
- Readme: README.md
- License: LICENSE
Awesome Lists containing this project
README
# trie-rs
This is a personal project so not on crate.io, there are too many trie packages over there.
Very simple trie implementation to have fast implementations of:
- `common_prefix_search`: give every item in the trie that is
a prefix of the query
- `search`: give every item in the trie that would follow the query
In order for search to be fast, an index has to be built, which can
become very large if you intend to store many items in the trie.
PR welcomes to store partial indexes for large tries.
```rust
use trie_rs::TrieBuilder;
let build_index = true;
let mut builder = TrieBuilder::new(build_index);
builder.push(&vec!['A', 'l', 'a', 'b', 'a', 'm', 'a']);
builder.push(&vec!['A', 'l', 'a', 's', 'k', 'a']);
builder.push(&vec!['A', 'l', 'a', 's']);
let trie = builder.build();
assert_eq!(trie.search(&vec!['A', 'l', 'a', 's']).unwrap(),
&vec![
vec!['A', 'l', 'a', 's'],
vec!['A', 'l', 'a', 's', 'k', 'a'],
]);
assert_eq!(trie.common_prefix_search(&vec!['A', 'l', 'a', 's', 'k', 'a']),
vec![
vec!['A', 'l', 'a', 's'],
vec!['A', 'l', 'a', 's', 'k', 'a'],
]);
let mut builder = TrieBuilder::new(build_index);
builder.push(&"Alabama".bytes().collect::>());
builder.push(&"Alaska".bytes().collect::>());
builder.push(&"Alas".bytes().collect::>());
let trie = builder.build();
assert_eq!(trie.search(&"Alas".bytes().collect::>()).unwrap(),
&vec![
vec![65, 108, 97, 115],
vec![65, 108, 97, 115, 107, 97],
]);
```
The item stored in the Trie needs eq + Hash as under the hood we use
a hashmap for fast query. We also need copy because most of the time
we will use very small items as trie elements, like `char` or `u8` for
strings, or ints. We need `Ord` trait to give consistent results in the search