Enum TreeStorage 

pub enum TreeStorage {
    VertexOnly(HashMap<VertexId, SearchTreeNode>),
    Stateful {
        nodes: HashMap<Label, SearchTreeNode>,
        labels: HashMap<VertexId, HashSet<Label>>,
    },
}

Variants

VertexOnly(HashMap<VertexId, SearchTreeNode>)

Stateful

Fields

nodes: HashMap<Label, SearchTreeNode>

labels: HashMap<VertexId, HashSet<Label>>

Implementations

impl TreeStorage

pub fn new_vertex_oriented() -> Self

pub fn new_stateful() -> Self

pub fn insert_node( &mut self, label: Label, node: SearchTreeNode, ) -> Result<(), SearchTreeError>

pub fn contains_key(&self, label: &Label) -> bool

pub fn get(&self, label: &Label) -> Option<&SearchTreeNode>

pub fn get_mut(&mut self, label: &Label) -> Option<&mut SearchTreeNode>

pub fn len(&self) -> usize

pub fn is_empty(&self) -> bool

pub fn get_labels( &self, vertex: VertexId, ) -> Box<dyn Iterator<Item = Label> + '_>

pub fn branch_iter<'a>( &'a self, ) -> Box<dyn Iterator<Item = (Label, &'a SearchTreeNode)> + 'a>

pub fn label_iter<'a>(&'a self) -> Box<dyn Iterator<Item = Label> + 'a>

pub fn node_iter<'a>( &'a self, ) -> Box<dyn Iterator<Item = &'a SearchTreeNode> + 'a>

Trait Implementations

impl Allocative for TreeStorage

fn visit<'allocative_a, 'allocative_b: 'allocative_a>( &self, visitor: &'allocative_a mut Visitor<'allocative_b>, )

impl Clone for TreeStorage

fn clone(&self) -> TreeStorage

Returns a duplicate of the value.

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.

impl Debug for TreeStorage

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

Formats the value using the given formatter.