Struct VisibleInstGraph 

pub struct VisibleInstGraph {
    pub graph: DiGraph<VisibleNode, VisibleEdge, VisibleIx>,
    pub generation: u32,
    /* private fields */
}

Fields

graph: DiGraph<VisibleNode, VisibleEdge, VisibleIx>

generation: u32

Implementations

impl VisibleInstGraph

pub fn contains(&self, i_idx: RawNodeIndex) -> bool

Does the hidden instantiation graph contain the given node?

Trait Implementations

impl Default for VisibleInstGraph

fn default() -> VisibleInstGraph

Returns the “default value” for a type.

impl Index<VisibleEdgeIndex> for VisibleInstGraph

type Output = VisibleEdge

The returned type after indexing.

fn index(&self, idx: VisibleEdgeIndex) -> &Self::Output

Performs the indexing (container[index]) operation.

impl Index<VisibleNodeIndex> for VisibleInstGraph

type Output = VisibleNode

The returned type after indexing.

fn index(&self, idx: VisibleNodeIndex) -> &Self::Output

Performs the indexing (container[index]) operation.

impl IndexMut<VisibleEdgeIndex> for VisibleInstGraph

fn index_mut(&mut self, idx: VisibleEdgeIndex) -> &mut Self::Output

Performs the mutable indexing (container[index]) operation.

impl IndexMut<VisibleNodeIndex> for VisibleInstGraph

fn index_mut(&mut self, idx: VisibleNodeIndex) -> &mut Self::Output

Performs the mutable indexing (container[index]) operation.