Struct WeakPartialOrdering 

pub struct WeakPartialOrdering<NodeId: Copy + Hash + Ord> { /* private fields */ }

Implementations

impl<NodeId> WeakPartialOrdering<NodeId>

where NodeId: Copy + Hash + Ord + Debug,

pub fn new<SN>(root: NodeId, size: usize, successors_nodes: &SN) -> Self

where SN: SuccessorNodes<NodeId = NodeId>,

pub fn size(&self) -> usize

pub fn get_entry(&self) -> WpoIdx

pub fn get_successors(&self, idx: WpoIdx) -> &BTreeSet<WpoIdx>

pub fn get_predecessors(&self, idx: WpoIdx) -> &BTreeSet<WpoIdx>

pub fn get_num_preds(&self, idx: WpoIdx) -> u32

pub fn get_num_outer_preds(&self, exit: WpoIdx) -> &HashMap<WpoIdx, u32>

pub fn get_head_of_exit(&self, exit: WpoIdx) -> WpoIdx

pub fn get_exit_of_head(&self, head: WpoIdx) -> WpoIdx

pub fn get_node(&self, idx: WpoIdx) -> NodeId

pub fn is_plain(&self, idx: WpoIdx) -> bool

pub fn is_head(&self, idx: WpoIdx) -> bool

pub fn is_exit(&self, idx: WpoIdx) -> bool

pub fn is_from_outside(&self, head: NodeId, pred: NodeId) -> bool