Struct bevy_rapier3d::prelude::InteractionGraph

pub struct InteractionGraph<N, E> { /* fields omitted */ }

A graph where nodes are collision objects and edges are contact or proximity algorithms.

Implementations

impl<N, E> InteractionGraph<N, E> where
    N: Copy, 

pub fn new() -> InteractionGraph<N, E>

Creates a new empty collection of collision objects.

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>

All the interactions on this graph.

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)>

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)>

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)>

All the interaction involving the collision object with graph index id.

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)>

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, 

pub fn clone(&self) -> InteractionGraph<N, E>

Returns a copy of the value.

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

Performs copy-assignment from source.