Struct NodeFiltered 

pub struct NodeFiltered<'graph, G, Predicate> { /* private fields */ }

Implementations

impl<'graph, G, Predicate> NodeFiltered<'graph, G, Predicate>

pub const fn new(graph: &'graph G, predicate: Predicate) -> Self

pub const fn inner(&self) -> &'graph G

Trait Implementations

impl<'graph, G: Clone, Predicate: Clone> Clone for NodeFiltered<'graph, G, Predicate>

fn clone(&self) -> NodeFiltered<'graph, G, Predicate>

Returns a duplicate of the value.

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.

impl<'graph, G: Copy, Predicate: Copy> Copy for NodeFiltered<'graph, G, Predicate>

impl<'graph, G: Debug, Predicate: Debug> Debug for NodeFiltered<'graph, G, Predicate>

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

Formats the value using the given formatter.

impl<G, Predicate> GraphView for NodeFiltered<'_, G, Predicate>

where G: GraphView, Predicate: Fn(G::Node) -> bool,

type Node = <G as GraphView>::Node

type Edge = <G as GraphView>::Edge

fn node_count(&self) -> usize

fn edge_count(&self) -> usize

fn contains_node(&self, node: Self::Node) -> bool

fn contains_edge(&self, edge: Self::Edge) -> bool

fn node_indices(&self) -> impl Iterator<Item = Self::Node> + '_

fn edge_indices(&self) -> impl Iterator<Item = Self::Edge> + '_

fn edge_endpoints(&self, edge: Self::Edge) -> Option<EdgeEndpoints<Self::Node>>

fn outgoing_edges( &self, node: Self::Node, ) -> impl Iterator<Item = Self::Edge> + '_

fn incoming_edges( &self, node: Self::Node, ) -> impl Iterator<Item = Self::Edge> + '_

fn edge_references( &self, ) -> impl Iterator<Item = (Self::Edge, EdgeEndpoints<Self::Node>)> + '_

impl<G, Predicate> IndexGraphView for NodeFiltered<'_, G, Predicate>

where G: IndexGraphView, Predicate: Fn(G::Node) -> bool,

fn node_bound(&self) -> usize

fn edge_bound(&self) -> usize

fn node_slot(node: Self::Node) -> usize

fn edge_slot(edge: Self::Edge) -> usize