Trait bevy_internal::utils::petgraph::visit::IntoNodeIdentifiers

pub trait IntoNodeIdentifiers: GraphRef {
    type NodeIdentifiers: Iterator<Item = Self::NodeId>;

    // Required method
    fn node_identifiers(self) -> Self::NodeIdentifiers;
}

Access to the sequence of the graph’s NodeIds.

Required Associated Types

type NodeIdentifiers: Iterator<Item = Self::NodeId>

Required Methods

fn node_identifiers(self) -> Self::NodeIdentifiers

Object Safety

This trait is not object safe.

Implementations on Foreign Types

impl<'a, G> IntoNodeIdentifiers for &'a G

where G: IntoNodeIdentifiers,

type NodeIdentifiers = <G as IntoNodeIdentifiers>::NodeIdentifiers

fn node_identifiers(self) -> <&'a G as IntoNodeIdentifiers>::NodeIdentifiers

Implementors

impl<'a, 'b, G> IntoNodeIdentifiers for &'b Frozen<'a, G>

where G: IntoNodeIdentifiers,

type NodeIdentifiers = <G as IntoNodeIdentifiers>::NodeIdentifiers

impl<'a, E, Ix> IntoNodeIdentifiers for &'a List<E, Ix>

where Ix: IndexType,

type NodeIdentifiers = NodeIndices<Ix>

impl<'a, G, F> IntoNodeIdentifiers for &'a EdgeFiltered<G, F>

where G: IntoNodeIdentifiers,

type NodeIdentifiers = <G as IntoNodeIdentifiers>::NodeIdentifiers

impl<'a, G, F> IntoNodeIdentifiers for &'a NodeFiltered<G, F>

where G: IntoNodeIdentifiers, F: FilterNode<<G as GraphBase>::NodeId>,

type NodeIdentifiers = NodeFilteredNeighbors<'a, <G as IntoNodeIdentifiers>::NodeIdentifiers, F>

impl<'a, N, E, Ty> IntoNodeIdentifiers for &'a GraphMap<N, E, Ty>

where E: 'a, N: NodeTrait, Ty: EdgeType,

type NodeIdentifiers = NodeIdentifiers<'a, N, E, Ty>

impl<'a, N, E, Ty, Ix> IntoNodeIdentifiers for &'a Csr<N, E, Ty, Ix>

where Ty: EdgeType, Ix: IndexType,

type NodeIdentifiers = NodeIdentifiers<Ix>

impl<'a, N, E, Ty, Ix> IntoNodeIdentifiers for &'a StableGraph<N, E, Ty, Ix>

where E: 'a, Ty: EdgeType, Ix: IndexType,

type NodeIdentifiers = NodeIndices<'a, N, Ix>

impl<'a, N, E, Ty, Ix> IntoNodeIdentifiers for &'a Graph<N, E, Ty, Ix>

where E: 'a, Ty: EdgeType, Ix: IndexType,

type NodeIdentifiers = NodeIndices<Ix>

impl<'a, N, E, Ty, Null, Ix> IntoNodeIdentifiers for &'a MatrixGraph<N, E, Ty, Null, Ix>

where E: 'a, Ty: EdgeType, Null: Nullable<Wrapped = E>, Ix: IndexType,

type NodeIdentifiers = NodeIdentifiers<'a, Ix>

impl<G> IntoNodeIdentifiers for Reversed<G>

where G: IntoNodeIdentifiers,

type NodeIdentifiers = <G as IntoNodeIdentifiers>::NodeIdentifiers