Struct TrieSetStore 

pub struct TrieSetStore { /* private fields */ }

Set Trie.

Implements a trie data-structure to maintain sets, and perform efficient sub-set/super-set queries.

Implementations

impl TrieSetStore

pub fn to_graphviz(&self) -> String

generates the graphviz representation of the trie.

Trait Implementations

impl Debug for TrieSetStore

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter.

impl Default for TrieSetStore

fn default() -> Self

Returns the “default value” for a type.

impl<T: Copy + Eq + Into<usize> + From<usize>> SetStore<T> for TrieSetStore

type SubsetIterator = IntoIter<Vec<T>>

Iterator trait over subsets

type SupersetIterator = IntoIter<Vec<T>>

Iterator trait over supersets

fn insert(&mut self, s: &[T]) -> bool

Inserts a subset.

fn remove(&mut self, s: &[T]) -> bool

Removes a subset.

fn find_subsets(&self, s: &[T]) -> Self::SubsetIterator

enumerates all subsets

fn find_supersets(&self, s: &[T]) -> Self::SupersetIterator

enumerates all supersets

fn contains(&self, s: &[T]) -> bool

returns true if the set exists in the store