Trait handlegraph::handlegraph::IntoHandles

pub trait IntoHandles: Sized {
    type Handles: Iterator<Item = Handle>;
    fn handles(self) -> Self::Handles;

    fn has_node<I: Into<NodeId>>(self, node_id: I) -> bool { ... }
}

Access all the handles in the graph as an iterator, and querying the graph for number of nodes, and presence of a node by ID.

Associated Types

type Handles: Iterator<Item = Handle>

The iterator through all of the graph's handles.

Loading content...

Required methods

fn handles(self) -> Self::Handles

Return an iterator on all the handles in the graph.

Loading content...

Provided methods

fn has_node<I: Into<NodeId>>(self, node_id: I) -> bool

Returns true if the node node_id exists in the graph. The default implementation uses any on the iterator from Self::handles.

Loading content...

Implementors

impl<'a> IntoHandles for &'a HashGraph

type Handles = NodeIdRefHandles<'a, Keys<'a, NodeId, Node>>

fn handles(self) -> Self::Handles

fn has_node<I: Into<NodeId>>(self, n_id: I) -> bool

impl<'a> IntoHandles for &'a PackedGraph

type Handles = NodeIdHandles<IndexMapIter<'a>>

fn handles(self) -> Self::Handles

fn has_node<I: Into<NodeId>>(self, n_id: I) -> bool

Loading content...