Fast subset and superset queries. It implemented Iztok Savnik's proposed data structure set-trie.
One difference from Iztok Savnik's data structure is, this implementation doesn't memorize a set which ends in a non-leaf node of existing set.
```rust use settrie::SetTrie; fn main(){ let mut settrie = SetTrie::new(); settrie.insertset(&[1, 2, 3]); settrie.insertset(&[1, 2, 3, 5]); settrie.insertset(&[1, 2, 4]); asserteq!( settrie.getsupersets(&[1, 2]), vec![vec![1, 2, 3, 5], vec![1, 2, 4]] ); asserteq!(settrie.existsubset(&vec![1, 2, 3, 5]), true); asserteq!(settrie.existsuperset(&vec![1, 2]), true); asserteq!( settrie.getallsupersets(), vec![vec![1, 2, 3, 5], vec![1, 2, 4]] ); asserteq!(settrie.getsupersets(&[1, 3, 5]), vec![vec![1, 2, 3, 5]]); asserteq!( settrie.getsubsets(&[1, 2, 3, 5, 7]), vec![vec![1, 2, 3, 5]] ); }
```