Struct heron::rapier_plugin::rapier2d::prelude::InteractionGraph [−]
pub struct InteractionGraph<N, E> { /* fields omitted */ }
Expand description
A graph where nodes are collision objects and edges are contact or proximity algorithms.
Implementations
impl<N, E> InteractionGraph<N, E> where
N: Copy,
impl<N, E> InteractionGraph<N, E> where
N: Copy,
pub fn new() -> InteractionGraph<N, E>
pub fn new() -> InteractionGraph<N, E>
Creates a new empty collection of collision objects.
pub fn raw_graph(&self) -> &Graph<N, E>
pub fn raw_graph(&self) -> &Graph<N, E>
The underlying raw graph structure of this interaction graph.
pub fn interactions(&self) -> impl Iterator<Item = &E>
pub fn interactions(&self) -> impl Iterator<Item = &E>
All the interactions on this graph.
pub fn interactions_with_endpoints(&self) -> impl Iterator<Item = (N, N, &E)>
pub fn interactions_with_endpoints(&self) -> impl Iterator<Item = (N, N, &E)>
All the interactions on this graph with the corresponding endpoint weights.
pub fn interaction_pair(
&self,
id1: NodeIndex,
id2: NodeIndex
) -> Option<(N, N, &E)>
pub fn interaction_pair(
&self,
id1: NodeIndex,
id2: NodeIndex
) -> Option<(N, N, &E)>
The interaction between the two collision objects identified by their graph index.
pub fn interaction_pair_mut(
&mut self,
id1: NodeIndex,
id2: NodeIndex
) -> Option<(N, N, &mut E)>
pub fn interaction_pair_mut(
&mut self,
id1: NodeIndex,
id2: NodeIndex
) -> Option<(N, N, &mut E)>
The interaction between the two collision objects identified by their graph index.
pub fn interactions_with(
&self,
id: NodeIndex
) -> impl Iterator<Item = (N, N, &E)>
pub fn interactions_with(
&self,
id: NodeIndex
) -> impl Iterator<Item = (N, N, &E)>
All the interaction involving the collision object with graph index id
.
pub fn index_interaction(&self, id: EdgeIndex) -> Option<(N, N, &E)>
pub fn index_interaction(&self, id: EdgeIndex) -> Option<(N, N, &E)>
Gets the interaction with the given index.
pub fn interactions_with_mut(
&mut self,
id: NodeIndex
) -> impl Iterator<Item = (N, N, EdgeIndex, &mut E)>
pub fn interactions_with_mut(
&mut self,
id: NodeIndex
) -> impl Iterator<Item = (N, N, EdgeIndex, &mut E)>
All the mutable references to interactions involving the collision object with graph index id
.
Trait Implementations
impl<N, E> Clone for InteractionGraph<N, E> where
N: Clone,
E: Clone,
impl<N, E> Clone for InteractionGraph<N, E> where
N: Clone,
E: Clone,
pub fn clone(&self) -> InteractionGraph<N, E>
pub fn clone(&self) -> InteractionGraph<N, E>
Returns a copy of the value. Read more
Performs copy-assignment from source
. Read more
Auto Trait Implementations
impl<N, E> RefUnwindSafe for InteractionGraph<N, E> where
E: RefUnwindSafe,
N: RefUnwindSafe,
impl<N, E> Send for InteractionGraph<N, E> where
E: Send,
N: Send,
impl<N, E> Sync for InteractionGraph<N, E> where
E: Sync,
N: Sync,
impl<N, E> Unpin for InteractionGraph<N, E> where
E: Unpin,
N: Unpin,
impl<N, E> UnwindSafe for InteractionGraph<N, E> where
E: UnwindSafe,
N: UnwindSafe,
Blanket Implementations
Mutably borrows from an owned value. Read more
impl<T> Downcast for T where
T: Any,
impl<T> Downcast for T where
T: 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
. Read more
pub fn into_any_rc(self: Rc<T>) -> Rc<dyn Any + 'static>
pub fn into_any_rc(self: Rc<T>) -> Rc<dyn Any + 'static>
Convert Rc<Trait>
(where Trait: Downcast
) to Rc<Any>
. Rc<Any>
can then be
further downcast
into Rc<ConcreteType>
where ConcreteType
implements Trait
. Read more
Convert &Trait
(where Trait: Downcast
) to &Any
. This is needed since Rust cannot
generate &Any
’s vtable from &Trait
’s. Read more
pub fn as_any_mut(&mut self) -> &mut (dyn Any + 'static)
pub 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. Read more
impl<T> Pointable for T
impl<T> Pointable for T
impl<SS, SP> SupersetOf<SS> for SP where
SS: SubsetOf<SP>,
impl<SS, SP> SupersetOf<SS> for SP where
SS: SubsetOf<SP>,
The inverse inclusion map: attempts to construct self
from the equivalent element of its
superset. Read more
pub fn is_in_subset(&self) -> bool
pub fn is_in_subset(&self) -> bool
Checks if self
is actually part of its subset T
(and can be converted to it).
pub fn to_subset_unchecked(&self) -> SS
pub fn to_subset_unchecked(&self) -> SS
Use with care! Same as self.to_subset
but without any property checks. Always succeeds.
pub fn from_subset(element: &SS) -> SP
pub fn from_subset(element: &SS) -> SP
The inclusion map: converts self
to the equivalent element of its superset.
pub fn clone_type_data(&self) -> Box<dyn TypeData + 'static, Global>
pub fn vzip(self) -> V
Attaches the provided Subscriber
to this type, returning a
WithDispatch
wrapper. Read more
Attaches the current default Subscriber
to this type, returning a
WithDispatch
wrapper. Read more