Struct heron::rapier_plugin::rapier2d::geometry::InteractionGraph
pub struct InteractionGraph<N, E> { /* private fields */ }
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,
fn clone(&self) -> InteractionGraph<N, E>
fn clone(&self) -> InteractionGraph<N, E>
Returns a copy of the value. Read more
1.0.0 · sourcefn clone_from(&mut self, source: &Self)
fn clone_from(&mut self, source: &Self)
Performs copy-assignment from
source
. Read moreimpl<N, E> Default for InteractionGraph<N, E>where
N: Copy,
impl<N, E> Default for InteractionGraph<N, E>where
N: Copy,
fn default() -> InteractionGraph<N, E>
fn default() -> InteractionGraph<N, E>
Returns the “default value” for a type. 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
impl<T, U> AsBindGroupShaderType<U> for Twhere
U: ShaderType,
&'a T: for<'a> Into<U>,
impl<T, U> AsBindGroupShaderType<U> for Twhere
U: ShaderType,
&'a T: for<'a> Into<U>,
fn as_bind_group_shader_type(
&self,
_images: &HashMap<Handle<Image>, <Image as RenderAsset>::PreparedAsset, RandomState, Global>
) -> U
fn as_bind_group_shader_type(
&self,
_images: &HashMap<Handle<Image>, <Image as RenderAsset>::PreparedAsset, RandomState, Global>
) -> U
Return the
T
[ShaderType
] for self
. When used in [AsBindGroup
]
derives, it is safe to assume that all images in self
exist. Read moresourceimpl<T> BorrowMut<T> for Twhere
T: ?Sized,
impl<T> BorrowMut<T> for Twhere
T: ?Sized,
const: unstable · sourcefn borrow_mut(&mut self) -> &mut T
fn borrow_mut(&mut self) -> &mut T
Mutably borrows from an owned value. Read more
impl<T> Downcast for Twhere
T: Any,
impl<T> Downcast for Twhere
T: Any,
fn into_any(self: Box<T, Global>) -> Box<dyn Any + 'static, Global>
fn into_any(self: Box<T, Global>) -> Box<dyn Any + 'static, Global>
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 morefn into_any_rc(self: Rc<T>) -> Rc<dyn Any + 'static>
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 morefn as_any(&self) -> &(dyn Any + 'static)
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. Read morefn as_any_mut(&mut self) -> &mut (dyn Any + 'static)
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 moreimpl<T> FromWorld for Twhere
T: Default,
impl<T> FromWorld for Twhere
T: Default,
fn from_world(_world: &mut World) -> T
fn from_world(_world: &mut World) -> T
Creates
Self
using data from the given [World]sourceimpl<T> Instrument for T
impl<T> Instrument for T
sourcefn instrument(self, span: Span) -> Instrumented<Self>
fn instrument(self, span: Span) -> Instrumented<Self>
sourcefn in_current_span(self) -> Instrumented<Self>
fn in_current_span(self) -> Instrumented<Self>
impl<T> Pointable for T
impl<T> Pointable for T
impl<SS, SP> SupersetOf<SS> for SPwhere
SS: SubsetOf<SP>,
impl<SS, SP> SupersetOf<SS> for SPwhere
SS: SubsetOf<SP>,
fn to_subset(&self) -> Option<SS>
fn to_subset(&self) -> Option<SS>
The inverse inclusion map: attempts to construct
self
from the equivalent element of its
superset. Read morefn is_in_subset(&self) -> bool
fn is_in_subset(&self) -> bool
Checks if
self
is actually part of its subset T
(and can be converted to it).fn to_subset_unchecked(&self) -> SS
fn to_subset_unchecked(&self) -> SS
Use with care! Same as
self.to_subset
but without any property checks. Always succeeds.fn from_subset(element: &SS) -> SP
fn from_subset(element: &SS) -> SP
The inclusion map: converts
self
to the equivalent element of its superset.