pub struct DefaultColliderSet<N: RealField + Copy, Handle: BodyHandle = DefaultBodyHandle> { /* private fields */ }Expand description
The default set containing all the colliders added to the world.
It is based on an arena using generational indices to avoid the ABA problem.
Implementations§
Source§impl<N: RealField + Copy, Handle: BodyHandle> DefaultColliderSet<N, Handle>
impl<N: RealField + Copy, Handle: BodyHandle> DefaultColliderSet<N, Handle>
Sourcepub fn insert(&mut self, collider: Collider<N, Handle>) -> DefaultColliderHandle
pub fn insert(&mut self, collider: Collider<N, Handle>) -> DefaultColliderHandle
Adds a collider to this set.
Sourcepub fn remove(
&mut self,
to_remove: DefaultColliderHandle,
) -> Option<Collider<N, Handle>>
pub fn remove( &mut self, to_remove: DefaultColliderHandle, ) -> Option<Collider<N, Handle>>
Removes a collider from this set.
Sourcepub fn get(&self, handle: DefaultColliderHandle) -> Option<&Collider<N, Handle>>
pub fn get(&self, handle: DefaultColliderHandle) -> Option<&Collider<N, Handle>>
Gets a reference to the collider identified by handle.
Sourcepub fn get_mut(
&mut self,
handle: DefaultColliderHandle,
) -> Option<&mut Collider<N, Handle>>
pub fn get_mut( &mut self, handle: DefaultColliderHandle, ) -> Option<&mut Collider<N, Handle>>
Gets a mutable reference to the collider identified by handle.
Sourcepub fn iter(
&self,
) -> impl Iterator<Item = (DefaultColliderHandle, &Collider<N, Handle>)>
pub fn iter( &self, ) -> impl Iterator<Item = (DefaultColliderHandle, &Collider<N, Handle>)>
Iterates through all the colliders and their handles.
Sourcepub fn iter_mut(
&mut self,
) -> impl Iterator<Item = (DefaultColliderHandle, &mut Collider<N, Handle>)>
pub fn iter_mut( &mut self, ) -> impl Iterator<Item = (DefaultColliderHandle, &mut Collider<N, Handle>)>
Mutably iterate through all the colliders and their handles.
Trait Implementations§
Source§impl<N: RealField + Copy, Handle: BodyHandle> ColliderSet<N, Handle> for DefaultColliderSet<N, Handle>
impl<N: RealField + Copy, Handle: BodyHandle> ColliderSet<N, Handle> for DefaultColliderSet<N, Handle>
Source§fn get(&self, handle: Self::Handle) -> Option<&Collider<N, Handle>>
fn get(&self, handle: Self::Handle) -> Option<&Collider<N, Handle>>
Gets a reference to the collider identified by
handle.Source§fn get_mut(&mut self, handle: Self::Handle) -> Option<&mut Collider<N, Handle>>
fn get_mut(&mut self, handle: Self::Handle) -> Option<&mut Collider<N, Handle>>
Gets a mutable reference to the collider identified by
handle.Source§fn contains(&self, handle: Self::Handle) -> bool
fn contains(&self, handle: Self::Handle) -> bool
Check if this set contains a collider identified by
handle.Source§fn foreach(&self, f: impl FnMut(Self::Handle, &Collider<N, Handle>))
fn foreach(&self, f: impl FnMut(Self::Handle, &Collider<N, Handle>))
Iterate through all the colliders on this set, applying the closure
f on them.Source§fn foreach_mut(&mut self, f: impl FnMut(Self::Handle, &mut Collider<N, Handle>))
fn foreach_mut(&mut self, f: impl FnMut(Self::Handle, &mut Collider<N, Handle>))
Mutable iterates through all the colliders on this set, applying the closure
f on them.Source§fn pop_insertion_event(&mut self) -> Option<Self::Handle>
fn pop_insertion_event(&mut self) -> Option<Self::Handle>
Gets the handle of one collider that has been inserted. Read more
Source§fn pop_removal_event(
&mut self,
) -> Option<(Self::Handle, ColliderRemovalData<N, Handle>)>
fn pop_removal_event( &mut self, ) -> Option<(Self::Handle, ColliderRemovalData<N, Handle>)>
Gets the handle and removal data of one collider that has been removed. Read more
Source§impl<N: RealField + Copy, Handle: BodyHandle> CollisionObjectSet<N> for DefaultColliderSet<N, Handle>
impl<N: RealField + Copy, Handle: BodyHandle> CollisionObjectSet<N> for DefaultColliderSet<N, Handle>
Source§type CollisionObject = Collider<N, Handle>
type CollisionObject = Collider<N, Handle>
Type of the collision object stored into this set.
Source§type CollisionObjectHandle = Index
type CollisionObjectHandle = Index
Type of the handles identifying collision objects.
Source§fn collision_object(
&self,
handle: Self::CollisionObjectHandle,
) -> Option<&Self::CollisionObject>
fn collision_object( &self, handle: Self::CollisionObjectHandle, ) -> Option<&Self::CollisionObject>
Gets the collision object identified by the given
handle.Source§fn foreach(
&self,
f: impl FnMut(Self::CollisionObjectHandle, &Self::CollisionObject),
)
fn foreach( &self, f: impl FnMut(Self::CollisionObjectHandle, &Self::CollisionObject), )
Applies a closure to every collision object (and their handle) stored into this set.
Auto Trait Implementations§
impl<N, Handle> Freeze for DefaultColliderSet<N, Handle>
impl<N, Handle = Index> !RefUnwindSafe for DefaultColliderSet<N, Handle>
impl<N, Handle> Send for DefaultColliderSet<N, Handle>
impl<N, Handle> Sync for DefaultColliderSet<N, Handle>
impl<N, Handle> Unpin for DefaultColliderSet<N, Handle>
impl<N, Handle = Index> !UnwindSafe for DefaultColliderSet<N, Handle>
Blanket Implementations§
Source§impl<T> BorrowMut<T> for Twhere
T: ?Sized,
impl<T> BorrowMut<T> for Twhere
T: ?Sized,
Source§fn borrow_mut(&mut self) -> &mut T
fn borrow_mut(&mut self) -> &mut T
Mutably borrows from an owned value. Read more
Source§impl<T> Downcast for Twhere
T: Any,
impl<T> Downcast for Twhere
T: Any,
Source§fn into_any(self: Box<T>) -> Box<dyn Any>
fn into_any(self: Box<T>) -> Box<dyn 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.Source§fn into_any_rc(self: Rc<T>) -> Rc<dyn Any>
fn into_any_rc(self: Rc<T>) -> Rc<dyn Any>
Convert
Rc<Trait> (where Trait: Downcast) to Rc<Any>. Rc<Any> can then be
further downcast into Rc<ConcreteType> where ConcreteType implements Trait.Source§fn 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.Source§fn 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.Source§impl<T> DowncastSync for T
impl<T> DowncastSync for T
Source§impl<T> IntoEither for T
impl<T> IntoEither for T
Source§fn into_either(self, into_left: bool) -> Either<Self, Self>
fn into_either(self, into_left: bool) -> Either<Self, Self>
Converts
self into a Left variant of Either<Self, Self>
if into_left is true.
Converts self into a Right variant of Either<Self, Self>
otherwise. Read moreSource§fn into_either_with<F>(self, into_left: F) -> Either<Self, Self>
fn into_either_with<F>(self, into_left: F) -> Either<Self, Self>
Converts
self into a Left variant of Either<Self, Self>
if into_left(&self) returns true.
Converts self into a Right variant of Either<Self, Self>
otherwise. Read moreSource§impl<SS, SP> SupersetOf<SS> for SPwhere
SS: SubsetOf<SP>,
impl<SS, SP> SupersetOf<SS> for SPwhere
SS: SubsetOf<SP>,
Source§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 moreSource§fn 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).Source§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.Source§fn from_subset(element: &SS) -> SP
fn from_subset(element: &SS) -> SP
The inclusion map: converts
self to the equivalent element of its superset.