Struct CollisionManager 

pub struct CollisionManager<C: Collider, I> { /* private fields */ }

The collision manager, which manages collisions. Can contain multiple colliders.

Implementations

impl<C: Collider, I: Copy> CollisionManager<C, I>

pub fn new() -> Self

Creates a new collision manager.

pub fn with_capacity(capacity: usize) -> Self

Creates a new collision manager with the capacity of expected colliders specified.

pub fn insert_collider(&mut self, collider: C, index: I) -> usize

Inserts a new collider and returns its index. An object index needs to be specified.

pub fn replace_collider(&mut self, index: usize, collider: C)

Replaces the existing collider at the specified index by a new collider.

pub fn remove_collider(&mut self, index: usize)

Removes an existing collider, so the index is usable for a new collider again.

pub fn collider(&self, index: usize) -> &C

Get the collider at the specified index.

pub fn collider_mut(&mut self, index: usize) -> &mut C

Get the collider at the specified index as mutable.

pub fn check_collision(&self, check_collider: &C) -> bool

Checks if there is a collision at a specific position.

pub fn find_collision(&self, check_collider: &C) -> Option<I>

Checks for a collision with collider and returns some index if found.

pub fn find_collisions<'a>( &'a self, check_collider: &'a C, ) -> impl DoubleEndedIterator<Item = I> + 'a

Finds all collisions with colliders and returns their indices.

pub fn compute_inner_collisions( &self, ) -> HashMap<usize, Vec<IndexedCollisionInfo<C::Vector, I>>>

where C::Vector: Copy + Neg<Output = C::Vector>,

Computes the internal collisions between all colliders. Returns a map for each collider index to its collision infos.

pub fn compute_collisions_with( &self, other: &Self, ) -> HashMap<usize, Vec<IndexedCollisionInfo<C::Vector, I>>>

Computes the collisions between all colliders with the colliders of another collision manager. Returns a map for each collider index to its collision infos.

impl<C: Collider + SpatialPartition, I: Copy> CollisionManager<C, I>

pub fn compute_inner_collisions_spatial( &self, ) -> HashMap<usize, Vec<IndexedCollisionInfo<C::Vector, I>>>

where C::Vector: Copy + Neg<Output = C::Vector>, C::Cell: Hash + Eq,

Computes internal collisions using spatial partitioning. Only checks pairs that share at least one cell, reducing O(n²) to O(n×k).

pub fn compute_collisions_with_spatial( &self, other: &Self, ) -> HashMap<usize, Vec<IndexedCollisionInfo<C::Vector, I>>>

Computes collisions with another manager using spatial partitioning. Only checks pairs that share at least one cell, reducing O(n²) to O(n×k).

impl<C: Collider, I: Copy> CollisionManager<C, I>

pub fn compute_inner_collisions_bvh<V: BoundingVolume>( &self, ) -> HashMap<usize, Vec<IndexedCollisionInfo<C::Vector, I>>>

where C: Bounded<V>, C::Vector: Copy + Neg<Output = C::Vector>,

Computes internal collisions using a bounding volume hierarchy. Skips pairs whose bounding volumes don’t overlap, reducing O(n²) to O(n log n). The type parameter V selects which bounding volume to use.

pub fn compute_collisions_with_bvh<V: BoundingVolume>( &self, other: &Self, ) -> HashMap<usize, Vec<IndexedCollisionInfo<C::Vector, I>>>

where C: Bounded<V>,

Computes collisions with another manager using bounding volume hierarchies. Builds a BVH for each manager and traverses them together, skipping subtree pairs whose volumes don’t overlap. The type parameter V selects which bounding volume to use.

Trait Implementations

impl<C: Collider, I: Copy> Default for CollisionManager<C, I>

fn default() -> Self

Returns the “default value” for a type.