Expand description
Efficiently-updatable double-array trie in Rust (ported from cedar).
Add it to your Cargo.toml
:
[dependencies]
cedarwood = "0.4"
then you are good to go. If you are using Rust 2015 you have to extern crate cedarwood
to your crate root as well.
Example
use cedarwood::Cedar;
let dict = vec![
"a",
"ab",
"abc",
"アルゴリズム",
"データ",
"構造",
"网",
"网球",
"网球拍",
"中",
"中华",
"中华人民",
"中华人民共和国",
];
let key_values: Vec<(&str, i32)> = dict.into_iter().enumerate().map(|(k, s)| (s, k as i32)).collect();
let mut cedar = Cedar::new();
cedar.build(&key_values);
let result: Vec<i32> = cedar.common_prefix_search("abcdefg").unwrap().iter().map(|x| x.0).collect();
assert_eq!(vec![0, 1, 2], result);
let result: Vec<i32> = cedar
.common_prefix_search("网球拍卖会")
.unwrap()
.iter()
.map(|x| x.0)
.collect();
assert_eq!(vec![6, 7, 8], result);
let result: Vec<i32> = cedar
.common_prefix_search("中华人民共和国")
.unwrap()
.iter()
.map(|x| x.0)
.collect();
assert_eq!(vec![9, 10, 11, 12], result);
let result: Vec<i32> = cedar
.common_prefix_search("データ構造とアルゴリズム")
.unwrap()
.iter()
.map(|x| x.0)
.collect();
assert_eq!(vec![4], result);
Structs
Cedar
holds all of the information about double array trie.Iterator for
common_prefix_search
Iterator for
common_prefix_predict