Struct EntityGraph 

pub struct EntityGraph<Node>
where
    Node: EntityRef,
{ /* private fields */ }

A graph of EntityRef nodes reified into a densely packed representation.

Implementations

impl<Node> EntityGraph<Node>

where Node: EntityRef + Debug,

pub fn new<E>( nodes: impl IntoIterator<Item = Node>, successors: impl FnMut(Node, &mut Vec<Node>) -> Result<(), E>, ) -> Result<Self, E>

Construct a new, concrete EntityGraph.

Trait Implementations

impl<Node> Debug for EntityGraph<Node>

where Node: EntityRef + Debug,

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

Formats the value using the given formatter.

impl<Node> Graph<Node> for EntityGraph<Node>

where Node: EntityRef,

type NodesIter<'a> = Keys<Node> where Self: 'a

The iterator type returned by Nodes::nodes.

type SuccessorsIter<'a> = Copied<Iter<'a, Node>> where Self: 'a

The iterator type returned by Successors::successors.

fn nodes(&self) -> Self::NodesIter<'_>

Iterate over the nodes in this graph.

fn successors(&self, node: Node) -> Self::SuccessorsIter<'_>

Iterate over the successors of the given node.

fn by_ref(&self) -> &Self

Like Iterator::by_ref but for Graph.

fn filter_nodes<F>(self, predicate: F) -> FilterNodes<Self, F>

where Self: Sized, F: Fn(&Node) -> bool,

Use the given predicate to filter out certain nodes from the graph.