cedarwood

Efficiently-updatable double-array trie in Rust (ported from cedar). This library is still in alpha, feedbacks are welcomed.

Build Status codecov Crates.io docs.rs

Installation

Add it to your Cargo.toml:

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

```rust let dict = vec![ "a", "ab", "abc", "アルゴリズム", "データ", "構造", "网", "网球", "网球拍", "中", "中华", "中华人民", "中华人民共和国", ]; let keyvalues: Vec<(&str, i32)> = dict.intoiter().enumerate().map(|(k, s)| (s, k as i32)).collect(); let mut cedar = Cedar::new(); cedar.build(&key_values);

let result: Vec = cedar.commonprefixsearch("abcdefg").iter().map(|x| x.0).collect(); assert_eq!(vec![0, 1, 2], result);

let result: Vec = cedar .commonprefixsearch("网球拍卖会") .iter() .map(|x| x.0) .collect(); assert_eq!(vec![6, 7, 8], result);

let result: Vec = cedar .commonprefixsearch("中华人民共和国") .iter() .map(|x| x.0) .collect(); assert_eq!(vec![9, 10, 11, 12], result);

let result: Vec = cedar .commonprefixsearch("データ構造とアルゴリズム") .iter() .map(|x| x.0) .collect(); assert_eq!(vec![4], result); ```

To run benchmark tests

bash cargo bench

License

This work is released under the BSD-2 license, following the original license of C++ cedar. A copy of the license is provided in the LICENSE file.

Reference