Struct parattice::lattice::LatticeNode

pub struct LatticeNode<'a> {
    pub forwards: BTreeSet<(&'a str, usize)>,
    pub backwards: BTreeSet<(&'a str, usize)>,
    pub forward_main: Option<(&'a str, usize)>,
    pub backward_main: Option<(&'a str, usize)>,
    pub depth: usize,
}

Fields

forwards: BTreeSet<(&'a str, usize)>

backwards: BTreeSet<(&'a str, usize)>

forward_main: Option<(&'a str, usize)>

backward_main: Option<(&'a str, usize)>

depth: usize

Implementations

impl<'a> LatticeNode<'a>

pub fn new<T1: Into<Option<(&'a str, usize)>>, T2: Into<Option<(&'a str, usize)>>>(
    forward_main: T1,
    backward_main: T2,
    depth: usize
) -> LatticeNode<'a>

pub fn insert_forward(&mut self, edge_str: &'a str, edge_target: usize)

pub fn insert_backward(&mut self, edge_str: &'a str, edge_target: usize)

Trait Implementations

impl<'a> Debug for LatticeNode<'a>

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

Formats the value using the given formatter.

impl<'a> Eq for LatticeNode<'a>

impl<'a> PartialEq<LatticeNode<'a>> for LatticeNode<'a>

fn eq(&self, other: &LatticeNode<'a>) -> bool

This method tests for self and other values to be equal, and is used by ==.

fn ne(&self, other: &LatticeNode<'a>) -> bool

This method tests for !=.

impl<'a> StructuralEq for LatticeNode<'a>

impl<'a> StructuralPartialEq for LatticeNode<'a>