Struct bevy::utils::petgraph::visit::Reversed

pub struct Reversed<G>(pub G);

Expand description

An edge-reversing graph adaptor.

All edges have the opposite direction with Reversed.

Tuple Fields§

§0: G

Trait Implementations§

impl<G> Clone for Reversed<G>
where G: Clone,

fn clone(&self) -> Reversed<G>

Returns a copy of the value. Read more

1.0.0 · source§

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

Performs copy-assignment from source. Read more

impl<G> Data for Reversed<G>
where G: Data,

type NodeWeight = <G as Data>::NodeWeight

type EdgeWeight = <G as Data>::EdgeWeight

impl<G> DataMap for Reversed<G>
where G: DataMap,

fn node_weight( &self, id: <Reversed<G> as GraphBase>::NodeId ) -> Option<&<Reversed<G> as Data>::NodeWeight>

fn edge_weight( &self, id: <Reversed<G> as GraphBase>::EdgeId ) -> Option<&<Reversed<G> as Data>::EdgeWeight>

impl<G> DataMapMut for Reversed<G>
where G: DataMapMut,

fn node_weight_mut( &mut self, id: <Reversed<G> as GraphBase>::NodeId ) -> Option<&mut <Reversed<G> as Data>::NodeWeight>

fn edge_weight_mut( &mut self, id: <Reversed<G> as GraphBase>::EdgeId ) -> Option<&mut <Reversed<G> as Data>::EdgeWeight>

impl<G> Debug for Reversed<G>
where G: Debug,

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

Formats the value using the given formatter. Read more

impl<G> EdgeCount for Reversed<G>
where G: EdgeCount,

fn edge_count(&self) -> usize

Return the number of edges in the graph.

impl<G> EdgeIndexable for Reversed<G>
where G: EdgeIndexable,

fn edge_bound(&self) -> usize

Return an upper bound of the edge indices in the graph (suitable for the size of a bitmap).

fn to_index(&self, a: <Reversed<G> as GraphBase>::EdgeId) -> usize

Convert a to an integer index.

fn from_index(&self, i: usize) -> <Reversed<G> as GraphBase>::EdgeId

Convert i to an edge index. i must be a valid value in the graph.

impl<G> GetAdjacencyMatrix for Reversed<G>
where G: GetAdjacencyMatrix,

type AdjMatrix = <G as GetAdjacencyMatrix>::AdjMatrix

The associated adjacency matrix type

fn adjacency_matrix(&self) -> <Reversed<G> as GetAdjacencyMatrix>::AdjMatrix

Create the adjacency matrix

fn is_adjacent( &self, matrix: &<Reversed<G> as GetAdjacencyMatrix>::AdjMatrix, a: <Reversed<G> as GraphBase>::NodeId, b: <Reversed<G> as GraphBase>::NodeId ) -> bool

Return true if there is an edge from a to b, false otherwise. Read more

impl<G> GraphBase for Reversed<G>
where G: GraphBase,

type NodeId = <G as GraphBase>::NodeId

node identifier

type EdgeId = <G as GraphBase>::EdgeId

edge identifier

impl<G> GraphProp for Reversed<G>
where G: GraphProp,

type EdgeType = <G as GraphProp>::EdgeType

The kind of edges in the graph.

fn is_directed(&self) -> bool

impl<G> IntoEdgeReferences for Reversed<G>
where G: IntoEdgeReferences,

type EdgeRef = ReversedEdgeReference<<G as IntoEdgeReferences>::EdgeRef>

type EdgeReferences = ReversedEdgeReferences<<G as IntoEdgeReferences>::EdgeReferences>

fn edge_references(self) -> <Reversed<G> as IntoEdgeReferences>::EdgeReferences

impl<G> IntoEdges for Reversed<G>
where G: IntoEdgesDirected,

type Edges = ReversedEdges<<G as IntoEdgesDirected>::EdgesDirected>

fn edges( self, a: <Reversed<G> as GraphBase>::NodeId ) -> <Reversed<G> as IntoEdges>::Edges

impl<G> IntoEdgesDirected for Reversed<G>
where G: IntoEdgesDirected,

type EdgesDirected = ReversedEdges<<G as IntoEdgesDirected>::EdgesDirected>

fn edges_directed( self, a: <Reversed<G> as GraphBase>::NodeId, dir: Direction ) -> <Reversed<G> as IntoEdges>::Edges

impl<G> IntoNeighbors for Reversed<G>
where G: IntoNeighborsDirected,

type Neighbors = <G as IntoNeighborsDirected>::NeighborsDirected

fn neighbors( self, n: <G as GraphBase>::NodeId ) -> <G as IntoNeighborsDirected>::NeighborsDirected

Return an iterator of the neighbors of node a.

impl<G> IntoNeighborsDirected for Reversed<G>
where G: IntoNeighborsDirected,

type NeighborsDirected = <G as IntoNeighborsDirected>::NeighborsDirected

fn neighbors_directed( self, n: <G as GraphBase>::NodeId, d: Direction ) -> <G as IntoNeighborsDirected>::NeighborsDirected

impl<G> IntoNodeIdentifiers for Reversed<G>
where G: IntoNodeIdentifiers,

type NodeIdentifiers = <G as IntoNodeIdentifiers>::NodeIdentifiers

fn node_identifiers( self ) -> <Reversed<G> as IntoNodeIdentifiers>::NodeIdentifiers

impl<G> IntoNodeReferences for Reversed<G>
where G: IntoNodeReferences,

type NodeRef = <G as IntoNodeReferences>::NodeRef

type NodeReferences = <G as IntoNodeReferences>::NodeReferences

fn node_references(self) -> <Reversed<G> as IntoNodeReferences>::NodeReferences

impl<G> NodeCount for Reversed<G>
where G: NodeCount,

fn node_count(&self) -> usize

impl<G> NodeIndexable for Reversed<G>
where G: NodeIndexable,

fn node_bound(&self) -> usize

Return an upper bound of the node indices in the graph (suitable for the size of a bitmap).

fn to_index(&self, a: <Reversed<G> as GraphBase>::NodeId) -> usize

Convert a to an integer index.

fn from_index(&self, i: usize) -> <Reversed<G> as GraphBase>::NodeId

Convert i to a node index. i must be a valid value in the graph.

impl<G> Visitable for Reversed<G>
where G: Visitable,

type Map = <G as Visitable>::Map

The associated map type

fn visit_map(&self) -> <G as Visitable>::Map

Create a new visitor map

fn reset_map(&self, map: &mut <Reversed<G> as Visitable>::Map)

Reset the visitor map (and resize to new size of graph if needed)

impl<G> Copy for Reversed<G>
where G: Copy,

impl<G> GraphRef for Reversed<G>
where G: GraphRef,

impl<G> NodeCompactIndexable for Reversed<G>
where G: NodeCompactIndexable,

Auto Trait Implementations§

impl<G> RefUnwindSafe for Reversed<G>
where G: RefUnwindSafe,

impl<G> Send for Reversed<G>
where G: Send,

impl<G> Sync for Reversed<G>
where G: Sync,

impl<G> Unpin for Reversed<G>
where G: Unpin,

impl<G> UnwindSafe for Reversed<G>
where G: UnwindSafe,

Blanket Implementations§

impl<T> Any for T
where T: 'static + ?Sized,

fn type_id(&self) -> TypeId

Gets the TypeId of self. Read more

impl<T, U> AsBindGroupShaderType<U> for T
where U: ShaderType, &'a T: for<'a> Into<U>,

fn as_bind_group_shader_type(&self, _images: &RenderAssets<Image>) -> U

Return the T ShaderType for self. When used in AsBindGroup derives, it is safe to assume that all images in self exist.

impl<T> Borrow<T> for T
where T: ?Sized,

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more

impl<T> BorrowMut<T> for T
where T: ?Sized,

fn borrow_mut(&mut self) -> &mut T

Mutably borrows from an owned value. Read more

impl<T> Downcast<T> for T

fn downcast(&self) -> &T

impl<T> Downcast for T
where T: Any,

fn into_any(self: Box<T>) -> Box<dyn Any>

Convert Box<dyn Trait> (where Trait: Downcast) to Box<dyn Any>. Box<dyn Any> can then be further downcast into Box<ConcreteType> where ConcreteType implements Trait.

fn into_any_rc(self: Rc<T>) -> Rc<dyn Any>

Convert Rc<Trait> (where Trait: Downcast) to Rc<Any>. Rc<Any> can then be further downcast into Rc<ConcreteType> where ConcreteType implements Trait.

fn as_any(&self) -> &(dyn Any + 'static)

Convert &Trait (where Trait: Downcast) to &Any. This is needed since Rust cannot generate &Any’s vtable from &Trait’s.

fn as_any_mut(&mut self) -> &mut (dyn Any + 'static)

Convert &mut Trait (where Trait: Downcast) to &Any. This is needed since Rust cannot generate &mut Any’s vtable from &mut Trait’s.

impl<T> DowncastSync for T
where T: Any + Send + Sync,

fn into_any_arc(self: Arc<T>) -> Arc<dyn Any + Send + Sync>

Convert Arc<Trait> (where Trait: Downcast) to Arc<Any>. Arc<Any> can then be further downcast into Arc<ConcreteType> where ConcreteType implements Trait.

impl<T> From<T> for T

fn from(t: T) -> T

Returns the argument unchanged.

impl<S> FromSample<S> for S

fn from_sample_(s: S) -> S

impl<T> Instrument for T

fn instrument(self, span: Span) -> Instrumented<Self> ⓘ

Instruments this type with the provided Span, returning an Instrumented wrapper. Read more

fn in_current_span(self) -> Instrumented<Self> ⓘ

Instruments this type with the current Span, returning an Instrumented wrapper. Read more

impl<T, U> Into<U> for T
where U: From<T>,

fn into(self) -> U

Calls U::from(self).

That is, this conversion is whatever the implementation of From<T> for U chooses to do.

impl<T> ToOwned for T
where T: Clone,

type Owned = T

The resulting type after obtaining ownership.

fn to_owned(&self) -> T

Creates owned data from borrowed data, usually by cloning. Read more

fn clone_into(&self, target: &mut T)

Uses borrowed data to replace owned data, usually by cloning. Read more

impl<T, U> ToSample<U> for T
where U: FromSample<T>,

fn to_sample_(self) -> U

impl<T, U> TryFrom<U> for T
where U: Into<T>,

type Error = Infallible

The type returned in the event of a conversion error.

fn try_from(value: U) -> Result<T, <T as TryFrom<U>>::Error>

Performs the conversion.

impl<T, U> TryInto<U> for T
where U: TryFrom<T>,

type Error = <U as TryFrom<T>>::Error

The type returned in the event of a conversion error.

fn try_into(self) -> Result<U, <U as TryFrom<T>>::Error>

Performs the conversion.

impl<T> TypeData for T
where T: 'static + Send + Sync + Clone,

fn clone_type_data(&self) -> Box<dyn TypeData>

impl<T> Upcast<T> for T

fn upcast(&self) -> Option<&T>

impl<T> WithSubscriber for T

fn with_subscriber<S>(self, subscriber: S) -> WithDispatch<Self> ⓘ
where S: Into<Dispatch>,

Attaches the provided Subscriber to this type, returning a WithDispatch wrapper. Read more

fn with_current_subscriber(self) -> WithDispatch<Self> ⓘ

Attaches the current default Subscriber to this type, returning a WithDispatch wrapper. Read more

impl<S, T> Duplex<S> for T
where T: FromSample<S> + ToSample<S>,

impl<T> Settings for T
where T: 'static + Send + Sync,

impl<T> WasmNotSend for T
where T: Send,

impl<T> WasmNotSendSync for T
where T: WasmNotSend + WasmNotSync,

impl<T> WasmNotSync for T
where T: Sync,