cedarwood
Efficiently-updatable double-array trie in Rust (ported from cedar). This library is tested with reasonably enough of randomized tests, but it is considered as beta since it is not yet tested in high-pressured production environment. Please let me know if you have good use cases to prove its stability.
Installation
Add it to your Cargo.toml
:
[]
= "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
let dict = vec!;
let key_values: = dict.into_iter.enumerate.map.collect;
let mut cedar = new;
cedar.build;
let result: = cedar.common_prefix_search.iter.map.collect;
assert_eq!;
let result: = cedar
.common_prefix_search
.iter
.map
.collect;
assert_eq!;
let result: = cedar
.common_prefix_search
.iter
.map
.collect;
assert_eq!;
let result: = cedar
.common_prefix_search
.iter
.map
.collect;
assert_eq!;
To run benchmark tests
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.