Fast Trie Tree
- no use
Rc | RefCell...
- Structures such as
Rc and RefCell are not used,
so this will be slightly faster than TrieTree implementations that use those structures
- Use
Iterator<T: Hash + Eq> to generalize, not only for a data type such as char, u8
Examples
```rust
use fasttrietree::TrieTree;
let mut ctree: TrieTree = TrieTree::new();
assert!(ctree.insert("abc".chars()));
asserteq!(format!("{:#?}", ctree), concat!(
"TrieTree {\n",
" count: 1,\n",
" root: (/): {\n",
" ('a'): {\n",
" ('b'): {\n",
" ['c']: {}\n",
" }\n",
" }\n",
" },\n",
"}"
));
asserteq!(ctree.query_iter("a".chars())
.unwrap().collect::>(), [[&'b', &'c']]);
assert!(ctree.insert("ace".chars()));
assert!(ctree.query("ace".chars()));
assert!(ctree.query("abc".chars()));
assert!(! ctree.query("ab".chars()));
let bytetree = TrieTree::fromiter(
[
[0u8, 2, 3, 8],
[4, 5, 7, 9],
[4, 2, 6, 1],
]);
asserteq!(bytetree.count(), 3);
assert!(bytetree.query([0, 2, 3, 8]));
assert!(bytetree.query([4, 5, 7, 9]));
assert!(bytetree.query([4, 2, 6, 1]));
let mut res = bytetree.queryiter([4]).unwrap().collect::>();
res.sort();
asserteq!(res, [[&2, &6, &1], [&5, &7, &9]]);
asserteq!(bytetree.count(), 3);
```
Info