Trait bevy_internal::utils::petgraph::visit::IntoNodeReferences

pub trait IntoNodeReferences: Data + IntoNodeIdentifiers {
    type NodeRef: NodeRef<NodeId = Self::NodeId, Weight = Self::NodeWeight>;
    type NodeReferences: Iterator<Item = Self::NodeRef>;

    // Required method
    fn node_references(self) -> Self::NodeReferences;
}

Access to the sequence of the graph’s nodes

Required Associated Types

type NodeRef: NodeRef<NodeId = Self::NodeId, Weight = Self::NodeWeight>

type NodeReferences: Iterator<Item = Self::NodeRef>

Required Methods

fn node_references(self) -> Self::NodeReferences

Object Safety

This trait is not object safe.

Implementations on Foreign Types

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

where G: IntoNodeReferences,

type NodeRef = <G as IntoNodeReferences>::NodeRef

type NodeReferences = <G as IntoNodeReferences>::NodeReferences

fn node_references(self) -> <&'a G as IntoNodeReferences>::NodeReferences

Implementors

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

where G: IntoNodeReferences,

type NodeRef = <G as IntoNodeReferences>::NodeRef

type NodeReferences = <G as IntoNodeReferences>::NodeReferences

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

where G: IntoNodeReferences,

type NodeRef = <G as IntoNodeReferences>::NodeRef

type NodeReferences = <G as IntoNodeReferences>::NodeReferences

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

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

type NodeRef = <G as IntoNodeReferences>::NodeRef

type NodeReferences = NodeFilteredNodes<'a, <G as IntoNodeReferences>::NodeReferences, F>

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

where Ix: IndexType,

type NodeRef = Ix

type NodeReferences = NodeIndices<Ix>

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

where N: NodeTrait, Ty: EdgeType,

type NodeRef = (N, &'a N)

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

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

where Ty: EdgeType, Ix: IndexType,

type NodeRef = (Ix, &'a N)

type NodeReferences = NodeReferences<'a, N, Ix>

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

where Ty: EdgeType, Ix: IndexType,

type NodeRef = (NodeIndex<Ix>, &'a N)

type NodeReferences = NodeReferences<'a, N, Ix>

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

where Ty: EdgeType, Ix: IndexType,

type NodeRef = (NodeIndex<Ix>, &'a N)

type NodeReferences = NodeReferences<'a, N, Ix>

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

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

type NodeRef = (NodeIndex<Ix>, &'a N)

type NodeReferences = NodeReferences<'a, N, Ix>

impl<G> IntoNodeReferences for Reversed<G>

where G: IntoNodeReferences,

type NodeRef = <G as IntoNodeReferences>::NodeRef

type NodeReferences = <G as IntoNodeReferences>::NodeReferences