Struct ColliderSet 

pub struct ColliderSet { /* private fields */ }

The world’s colliders, bucketed into a uniform grid for broadphase.

The grid’s cell size is the caller’s choice: it is a spatial hash bucket, not a tile size. Cells near the typical collider size keep queries small; much larger cells simply return more candidates, and much smaller cells make each collider occupy more buckets. Either way the result is only a candidate list — query reports colliders whose cells meet the region, not colliders that actually overlap it.

Implementations

impl ColliderSet

pub fn new(cell_size: f32) -> Self

An empty set bucketed at cell_size world units per grid cell.

Panics

If cell_size is not positive and finite — an authoring error, not a runtime condition. A zero, negative, or non-finite cell size cannot address a grid at all.

pub fn cell_size(&self) -> f32

World units per broadphase grid cell.

pub fn insert(&mut self, aabb: Aabb, flags: ColliderFlags) -> usize

Inserts a world-space collider, bucketing it into every grid cell its box overlaps, and returns its index.

pub fn get(&self, index: usize) -> Option<&Collider>

Borrows a collider by index, as returned by query.

pub fn query(&self, region: &Aabb) -> Vec<usize>

Broadphase candidates: the indices of colliders bucketed into any grid cell that region touches.

Each index appears exactly once, in ascending order, so a caller that breaks ties by “first candidate wins” behaves identically run to run.

pub fn len(&self) -> usize

Number of colliders in the set.

pub fn is_empty(&self) -> bool

Whether the set holds no colliders.

pub fn clear(&mut self)

Removes every collider and its grid buckets, keeping the cell size. Indices start again from zero.

pub fn iter(&self) -> Iter<'_, Collider>

Iterates the colliders in insertion order, so position i is the collider at index i.

Trait Implementations

impl Debug for ColliderSet

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

Formats the value using the given formatter.

impl<'a> IntoIterator for &'a ColliderSet

type Item = &'a Collider

The type of the elements being iterated over.

type IntoIter = Iter<'a, Collider>

Which kind of iterator are we turning this into?

fn into_iter(self) -> Self::IntoIter

Creates an iterator from a value.