pub struct ColliderTrees {
pub dynamic_tree: ColliderTree,
pub kinematic_tree: ColliderTree,
pub static_tree: ColliderTree,
pub standalone_tree: ColliderTree,
}Expand description
Trees for accelerating queries on a set of colliders.
See the collider_tree module for more information.
Fields§
§dynamic_tree: ColliderTreeA tree for the colliders of dynamic bodies.
kinematic_tree: ColliderTreeA tree for the colliders of kinematic bodies.
static_tree: ColliderTreeA tree for the colliders of static bodies.
standalone_tree: ColliderTreeA tree for standalone colliders with no associated rigid body.
Implementations§
Source§impl ColliderTrees
impl ColliderTrees
Sourcepub const fn tree_for_type(&self, tree_type: ColliderTreeType) -> &ColliderTree
pub const fn tree_for_type(&self, tree_type: ColliderTreeType) -> &ColliderTree
Returns the tree for the given ColliderTreeType.
Sourcepub const fn tree_for_type_mut(
&mut self,
tree_type: ColliderTreeType,
) -> &mut ColliderTree
pub const fn tree_for_type_mut( &mut self, tree_type: ColliderTreeType, ) -> &mut ColliderTree
Returns a mutable reference to the tree for the given ColliderTreeType.
Sourcepub fn iter_trees(&self) -> impl Iterator<Item = &ColliderTree>
pub fn iter_trees(&self) -> impl Iterator<Item = &ColliderTree>
Returns an iterator over all collider trees.
Sourcepub fn iter_trees_mut(&mut self) -> impl Iterator<Item = &mut ColliderTree>
pub fn iter_trees_mut(&mut self) -> impl Iterator<Item = &mut ColliderTree>
Returns a mutable iterator over all collider trees.
Sourcepub fn get_proxy(&self, key: ColliderTreeProxyKey) -> Option<&ColliderTreeProxy>
pub fn get_proxy(&self, key: ColliderTreeProxyKey) -> Option<&ColliderTreeProxy>
Returns the proxy with the given ColliderTreeProxyKey, if it exists.
Sourcepub fn get_proxy_mut(
&mut self,
key: ColliderTreeProxyKey,
) -> Option<&mut ColliderTreeProxy>
pub fn get_proxy_mut( &mut self, key: ColliderTreeProxyKey, ) -> Option<&mut ColliderTreeProxy>
Returns a mutable reference to the proxy with the given ColliderTreeProxyKey, if it exists.
Trait Implementations§
Source§impl Default for ColliderTrees
impl Default for ColliderTrees
Source§fn default() -> ColliderTrees
fn default() -> ColliderTrees
Returns the “default value” for a type. Read more
impl Resource for ColliderTrees
Auto Trait Implementations§
impl Freeze for ColliderTrees
impl RefUnwindSafe for ColliderTrees
impl Send for ColliderTrees
impl Sync for ColliderTrees
impl Unpin for ColliderTrees
impl UnwindSafe for ColliderTrees
Blanket Implementations§
Source§impl<T, U> AsBindGroupShaderType<U> for T
impl<T, U> AsBindGroupShaderType<U> for T
Source§fn as_bind_group_shader_type(&self, _images: &RenderAssets<GpuImage>) -> U
fn as_bind_group_shader_type(&self, _images: &RenderAssets<GpuImage>) -> U
Return the
T ShaderType for self. When used in AsBindGroup
derives, it is safe to assume that all images in self exist.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>
Converts
Box<dyn Trait> (where Trait: Downcast) to Box<dyn Any>, which can then be
downcast into Box<dyn 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>
Converts
Rc<Trait> (where Trait: Downcast) to Rc<Any>, which 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)
Converts
&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)
Converts
&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> DowncastSend for T
impl<T> DowncastSend for T
Source§impl<T> DowncastSync for T
impl<T> DowncastSync for T
Source§impl<T> FromWorld for Twhere
T: Default,
impl<T> FromWorld for Twhere
T: Default,
Source§fn from_world(_world: &mut World) -> T
fn from_world(_world: &mut World) -> T
Creates Self using default().
Source§impl<T, W> HasTypeWitness<W> for Twhere
W: MakeTypeWitness<Arg = T>,
T: ?Sized,
impl<T, W> HasTypeWitness<W> for Twhere
W: MakeTypeWitness<Arg = T>,
T: ?Sized,
Source§impl<T> Identity for Twhere
T: ?Sized,
impl<T> Identity for Twhere
T: ?Sized,
Source§impl<T> Instrument for T
impl<T> Instrument for T
Source§fn instrument(self, span: Span) -> Instrumented<Self>
fn instrument(self, span: Span) -> Instrumented<Self>
Source§fn in_current_span(self) -> Instrumented<Self>
fn in_current_span(self) -> Instrumented<Self>
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<T> IntoResult<T> for T
impl<T> IntoResult<T> for T
Source§fn into_result(self) -> Result<T, RunSystemError>
fn into_result(self) -> Result<T, RunSystemError>
Converts this type into the system output type.
Source§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.