Struct avian3d::spatial_query::SpatialQueryPipeline
source · pub struct SpatialQueryPipeline { /* private fields */ }
Expand description
A resource for the spatial query pipeline.
The pipeline maintains a quaternary bounding volume hierarchy Qbvh
of the world’s colliders
as an acceleration structure for spatial queries.
Implementations§
source§impl SpatialQueryPipeline
impl SpatialQueryPipeline
sourcepub fn new() -> SpatialQueryPipeline
pub fn new() -> SpatialQueryPipeline
Creates a new SpatialQueryPipeline
.
sourcepub fn update<'a>(
&mut self,
colliders: impl Iterator<Item = (Entity, &'a Position, &'a Rotation, &'a Collider, Option<&'a CollisionLayers>)>,
added_colliders: impl Iterator<Item = Entity>
)
pub fn update<'a>( &mut self, colliders: impl Iterator<Item = (Entity, &'a Position, &'a Rotation, &'a Collider, Option<&'a CollisionLayers>)>, added_colliders: impl Iterator<Item = Entity> )
Updates the associated acceleration structures with a new set of entities.
sourcepub fn cast_ray(
&self,
origin: Vector,
direction: Dir3,
max_time_of_impact: Scalar,
solid: bool,
query_filter: SpatialQueryFilter
) -> Option<RayHitData>
pub fn cast_ray( &self, origin: Vector, direction: Dir3, max_time_of_impact: Scalar, solid: bool, query_filter: SpatialQueryFilter ) -> Option<RayHitData>
Casts a ray and computes the closest hit with a collider.
If there are no hits, None
is returned.
§Arguments
origin
: Where the ray is cast from.direction
: What direction the ray is cast in.max_time_of_impact
: The maximum distance that the ray can travel.solid
: If true and the ray origin is inside of a collider, the hit point will be the ray origin itself. Otherwise, the collider will be treated as hollow, and the hit point will be at the collider’s boundary.query_filter
: ASpatialQueryFilter
that determines which colliders are taken into account in the query.
See also: SpatialQuery::cast_ray
sourcepub fn cast_ray_predicate(
&self,
origin: Vector,
direction: Dir3,
max_time_of_impact: Scalar,
solid: bool,
query_filter: SpatialQueryFilter,
predicate: &dyn Fn(Entity) -> bool
) -> Option<RayHitData>
pub fn cast_ray_predicate( &self, origin: Vector, direction: Dir3, max_time_of_impact: Scalar, solid: bool, query_filter: SpatialQueryFilter, predicate: &dyn Fn(Entity) -> bool ) -> Option<RayHitData>
Casts a ray and computes the closest hit with a collider.
If there are no hits, None
is returned.
§Arguments
origin
: Where the ray is cast from.direction
: What direction the ray is cast in.max_time_of_impact
: The maximum distance that the ray can travel.solid
: If true and the ray origin is inside of a collider, the hit point will be the ray origin itself. Otherwise, the collider will be treated as hollow, and the hit point will be at the collider’s boundary.query_filter
: ASpatialQueryFilter
that determines which colliders are taken into account in the query.predicate
: A function with which the colliders are filtered. Given the Entity it should return false, if the entity should be ignored.
See also: SpatialQuery::cast_ray
sourcepub fn ray_hits(
&self,
origin: Vector,
direction: Dir3,
max_time_of_impact: Scalar,
max_hits: u32,
solid: bool,
query_filter: SpatialQueryFilter
) -> Vec<RayHitData>
pub fn ray_hits( &self, origin: Vector, direction: Dir3, max_time_of_impact: Scalar, max_hits: u32, solid: bool, query_filter: SpatialQueryFilter ) -> Vec<RayHitData>
Casts a ray and computes all hits until max_hits
is reached.
Note that the order of the results is not guaranteed, and if there are more hits than max_hits
,
some hits will be missed.
§Arguments
origin
: Where the ray is cast from.direction
: What direction the ray is cast in.max_time_of_impact
: The maximum distance that the ray can travel.max_hits
: The maximum number of hits. Additional hits will be missed.solid
: If true and the ray origin is inside of a collider, the hit point will be the ray origin itself. Otherwise, the collider will be treated as hollow, and the hit point will be at the collider’s boundary.query_filter
: ASpatialQueryFilter
that determines which colliders are taken into account in the query.
See also: SpatialQuery::ray_hits
sourcepub fn ray_hits_callback(
&self,
origin: Vector,
direction: Dir3,
max_time_of_impact: Scalar,
solid: bool,
query_filter: SpatialQueryFilter,
callback: impl FnMut(RayHitData) -> bool
)
pub fn ray_hits_callback( &self, origin: Vector, direction: Dir3, max_time_of_impact: Scalar, solid: bool, query_filter: SpatialQueryFilter, callback: impl FnMut(RayHitData) -> bool )
Casts a ray and computes all hits, calling the given callback
for each hit. The raycast stops when callback
returns false or all hits have been found.
Note that the order of the results is not guaranteed.
§Arguments
origin
: Where the ray is cast from.direction
: What direction the ray is cast in.max_time_of_impact
: The maximum distance that the ray can travel.solid
: If true and the ray origin is inside of a collider, the hit point will be the ray origin itself. Otherwise, the collider will be treated as hollow, and the hit point will be at the collider’s boundary.query_filter
: ASpatialQueryFilter
that determines which colliders are taken into account in the query.callback
: A callback function called for each hit.
See also: SpatialQuery::ray_hits_callback
sourcepub fn cast_shape(
&self,
shape: &Collider,
origin: Vector,
shape_rotation: Quaternion,
direction: Dir3,
max_time_of_impact: Scalar,
ignore_origin_penetration: bool,
query_filter: SpatialQueryFilter
) -> Option<ShapeHitData>
pub fn cast_shape( &self, shape: &Collider, origin: Vector, shape_rotation: Quaternion, direction: Dir3, max_time_of_impact: Scalar, ignore_origin_penetration: bool, query_filter: SpatialQueryFilter ) -> Option<ShapeHitData>
Casts a shape with a given rotation and computes the closest hit
with a collider. If there are no hits, None
is returned.
For a more ECS-based approach, consider using the ShapeCaster
component instead.
§Arguments
shape
: The shape being cast represented as aCollider
.origin
: Where the shape is cast from.shape_rotation
: The rotation of the shape being cast.direction
: What direction the shape is cast in.max_time_of_impact
: The maximum distance that the shape can travel.ignore_origin_penetration
: If true and the shape is already penetrating a collider at the shape origin, the hit will be ignored and only the next hit will be computed. Otherwise, the initial hit will be returned.query_filter
: ASpatialQueryFilter
that determines which colliders are taken into account in the query.
See also: SpatialQuery::cast_shape
sourcepub fn shape_hits(
&self,
shape: &Collider,
origin: Vector,
shape_rotation: Quaternion,
direction: Dir3,
max_time_of_impact: Scalar,
max_hits: u32,
ignore_origin_penetration: bool,
query_filter: SpatialQueryFilter
) -> Vec<ShapeHitData>
pub fn shape_hits( &self, shape: &Collider, origin: Vector, shape_rotation: Quaternion, direction: Dir3, max_time_of_impact: Scalar, max_hits: u32, ignore_origin_penetration: bool, query_filter: SpatialQueryFilter ) -> Vec<ShapeHitData>
Casts a shape with a given rotation and computes computes all hits
in the order of the time of impact until max_hits
is reached.
§Arguments
shape
: The shape being cast represented as aCollider
.origin
: Where the shape is cast from.shape_rotation
: The rotation of the shape being cast.direction
: What direction the shape is cast in.max_time_of_impact
: The maximum distance that the shape can travel.max_hits
: The maximum number of hits. Additional hits will be missed.ignore_origin_penetration
: If true and the shape is already penetrating a collider at the shape origin, the hit will be ignored and only the next hit will be computed. Otherwise, the initial hit will be returned.query_filter
: ASpatialQueryFilter
that determines which colliders are taken into account in the query.callback
: A callback function called for each hit.
See also: SpatialQuery::shape_hits
sourcepub fn shape_hits_callback(
&self,
shape: &Collider,
origin: Vector,
shape_rotation: Quaternion,
direction: Dir3,
max_time_of_impact: Scalar,
ignore_origin_penetration: bool,
query_filter: SpatialQueryFilter,
callback: impl FnMut(ShapeHitData) -> bool
)
pub fn shape_hits_callback( &self, shape: &Collider, origin: Vector, shape_rotation: Quaternion, direction: Dir3, max_time_of_impact: Scalar, ignore_origin_penetration: bool, query_filter: SpatialQueryFilter, callback: impl FnMut(ShapeHitData) -> bool )
Casts a shape with a given rotation and computes computes all hits
in the order of the time of impact, calling the given callback
for each hit. The shapecast stops when
callback
returns false or all hits have been found.
§Arguments
shape
: The shape being cast represented as aCollider
.origin
: Where the shape is cast from.shape_rotation
: The rotation of the shape being cast.direction
: What direction the shape is cast in.max_time_of_impact
: The maximum distance that the shape can travel.ignore_origin_penetration
: If true and the shape is already penetrating a collider at the shape origin, the hit will be ignored and only the next hit will be computed. Otherwise, the initial hit will be returned.query_filter
: ASpatialQueryFilter
that determines which colliders are taken into account in the query.callback
: A callback function called for each hit.
See also: SpatialQuery::shape_hits_callback
sourcepub fn project_point(
&self,
point: Vector,
solid: bool,
query_filter: SpatialQueryFilter
) -> Option<PointProjection>
pub fn project_point( &self, point: Vector, solid: bool, query_filter: SpatialQueryFilter ) -> Option<PointProjection>
Finds the projection of a given point on the closest collider.
If one isn’t found, None
is returned.
§Arguments
point
: The point that should be projected.solid
: If true and the point is inside of a collider, the projection will be at the point. Otherwise, the collider will be treated as hollow, and the projection will be at the collider’s boundary.query_filter
: ASpatialQueryFilter
that determines which colliders are taken into account in the query.
See also: SpatialQuery::project_point
sourcepub fn point_intersections(
&self,
point: Vector,
query_filter: SpatialQueryFilter
) -> Vec<Entity>
pub fn point_intersections( &self, point: Vector, query_filter: SpatialQueryFilter ) -> Vec<Entity>
An intersection test that finds all entities with a collider that contains the given point.
§Arguments
point
: The point that intersections are tested against.query_filter
: ASpatialQueryFilter
that determines which colliders are taken into account in the query.
See also: SpatialQuery::point_intersections
sourcepub fn point_intersections_callback(
&self,
point: Vector,
query_filter: SpatialQueryFilter,
callback: impl FnMut(Entity) -> bool
)
pub fn point_intersections_callback( &self, point: Vector, query_filter: SpatialQueryFilter, callback: impl FnMut(Entity) -> bool )
An intersection test that finds all entities with a collider
that contains the given point, calling the given callback
for each intersection.
The search stops when callback
returns false
or all intersections have been found.
§Arguments
point
: The point that intersections are tested against.query_filter
: ASpatialQueryFilter
that determines which colliders are taken into account in the query.callback
: A callback function called for each intersection.
sourcepub fn aabb_intersections_with_aabb(&self, aabb: ColliderAabb) -> Vec<Entity>
pub fn aabb_intersections_with_aabb(&self, aabb: ColliderAabb) -> Vec<Entity>
An intersection test that finds all entities with a ColliderAabb
that is intersecting the given aabb
.
sourcepub fn aabb_intersections_with_aabb_callback(
&self,
aabb: ColliderAabb,
callback: impl FnMut(Entity) -> bool
)
pub fn aabb_intersections_with_aabb_callback( &self, aabb: ColliderAabb, callback: impl FnMut(Entity) -> bool )
An intersection test that finds all entities with a ColliderAabb
that is intersecting the given aabb
, calling callback
for each intersection.
The search stops when callback
returns false
or all intersections have been found.
See also: SpatialQuery::aabb_intersections_with_aabb_callback
sourcepub fn shape_intersections(
&self,
shape: &Collider,
shape_position: Vector,
shape_rotation: Quaternion,
query_filter: SpatialQueryFilter
) -> Vec<Entity>
pub fn shape_intersections( &self, shape: &Collider, shape_position: Vector, shape_rotation: Quaternion, query_filter: SpatialQueryFilter ) -> Vec<Entity>
An intersection test that finds all entities with a Collider
that is intersecting the given shape
with a given position and rotation.
§Arguments
shape
: The shape that intersections are tested against represented as aCollider
.shape_position
: The position of the shape.shape_rotation
: The rotation of the shape.query_filter
: ASpatialQueryFilter
that determines which colliders are taken into account in the query.
See also: SpatialQuery::shape_intersections
sourcepub fn shape_intersections_callback(
&self,
shape: &Collider,
shape_position: Vector,
shape_rotation: Quaternion,
query_filter: SpatialQueryFilter,
callback: impl FnMut(Entity) -> bool
)
pub fn shape_intersections_callback( &self, shape: &Collider, shape_position: Vector, shape_rotation: Quaternion, query_filter: SpatialQueryFilter, callback: impl FnMut(Entity) -> bool )
An intersection test that finds all entities with a Collider
that is intersecting the given shape
with a given position and rotation, calling callback
for each
intersection. The search stops when callback
returns false
or all intersections have been found.
§Arguments
shape
: The shape that intersections are tested against represented as aCollider
.shape_position
: The position of the shape.shape_rotation
: The rotation of the shape.query_filter
: ASpatialQueryFilter
that determines which colliders are taken into account in the query.callback
: A callback function called for each intersection.
Trait Implementations§
source§impl Clone for SpatialQueryPipeline
impl Clone for SpatialQueryPipeline
source§fn clone(&self) -> SpatialQueryPipeline
fn clone(&self) -> SpatialQueryPipeline
1.0.0 · source§fn clone_from(&mut self, source: &Self)
fn clone_from(&mut self, source: &Self)
source
. Read moresource§impl Default for SpatialQueryPipeline
impl Default for SpatialQueryPipeline
impl Resource for SpatialQueryPipeline
Auto Trait Implementations§
impl Freeze for SpatialQueryPipeline
impl !RefUnwindSafe for SpatialQueryPipeline
impl Send for SpatialQueryPipeline
impl Sync for SpatialQueryPipeline
impl Unpin for SpatialQueryPipeline
impl !UnwindSafe for SpatialQueryPipeline
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
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
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>
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>
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)
&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)
&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> 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
Self
using data from the given World
.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>
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>
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> Pointable for T
impl<T> Pointable for T
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>
self
from the equivalent element of its
superset. Read moresource§fn is_in_subset(&self) -> bool
fn is_in_subset(&self) -> bool
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
self.to_subset
but without any property checks. Always succeeds.source§fn from_subset(element: &SS) -> SP
fn from_subset(element: &SS) -> SP
self
to the equivalent element of its superset.