Struct ncollide2d::pipeline::broad_phase::DBVTBroadPhase [−][src]
Expand description
Broad phase based on a Dynamic Bounding Volume Tree.
It uses two separate trees: one for static objects and which is never updated, and one for moving objects.
Implementations
impl<N, BV, T> DBVTBroadPhase<N, BV, T> where
N: RealField + Copy,
BV: 'static + BoundingVolume<N> + Clone,
impl<N, BV, T> DBVTBroadPhase<N, BV, T> where
N: RealField + Copy,
BV: 'static + BoundingVolume<N> + Clone,
Creates a new broad phase based on a Dynamic Bounding Volume Tree.
Number of interferences detected by this broad phase.
Trait Implementations
impl<N, BV, T> BroadPhase<N, BV, T> for DBVTBroadPhase<N, BV, T> where
N: RealField + Copy,
BV: BoundingVolume<N> + RayCast<N> + PointQuery<N> + Any + Send + Sync + Clone,
T: Any + Send + Sync + Clone,
impl<N, BV, T> BroadPhase<N, BV, T> for DBVTBroadPhase<N, BV, T> where
N: RealField + Copy,
BV: BoundingVolume<N> + RayCast<N> + PointQuery<N> + Any + Send + Sync + Clone,
T: Any + Send + Sync + Clone,
Retrieves the bounding volume and data associated to the given proxy.
fn first_interference_with_ray<'a, 'b>(
&'a self,
ray: &'b Ray<N>,
max_toi: N,
cost_fn: &'a dyn Fn(T, &'b Ray<N>, N) -> Option<(T, RayIntersection<N>)>
) -> Option<(T, RayIntersection<N>)>
fn first_interference_with_ray<'a, 'b>(
&'a self,
ray: &'b Ray<N>,
max_toi: N,
cost_fn: &'a dyn Fn(T, &'b Ray<N>, N) -> Option<(T, RayIntersection<N>)>
) -> Option<(T, RayIntersection<N>)>
Returns the first object that interferes with a ray.
Updates the object additions, removals, and interferences detection.
Tells the broad phase to add a bounding-volume at the next update.
Tells the broad phase to remove the given set of handles.
fn deferred_set_bounding_volume(
&mut self,
handle: BroadPhaseProxyHandle,
bounding_volume: BV
)
fn deferred_set_bounding_volume(
&mut self,
handle: BroadPhaseProxyHandle,
bounding_volume: BV
)
Sets the next bounding volume to be used during the update of this broad phase.
Forces the broad-phase to recompute and re-report all the proximities with the given object.
Forces the broad-phase to recompute and re-report all the proximities.
Collects every object which might intersect a given bounding volume.
Collects every object which might intersect a given ray.
Collects every object which might contain a given point.
Auto Trait Implementations
impl<N, BV, T> RefUnwindSafe for DBVTBroadPhase<N, BV, T> where
BV: RefUnwindSafe,
N: RefUnwindSafe,
T: RefUnwindSafe,
impl<N, BV, T> Send for DBVTBroadPhase<N, BV, T> where
BV: Send,
T: Send,
impl<N, BV, T> Sync for DBVTBroadPhase<N, BV, T> where
BV: Sync,
T: Sync,
impl<N, BV, T> Unpin for DBVTBroadPhase<N, BV, T> where
BV: Unpin,
N: Unpin,
T: Unpin,
impl<N, BV, T> UnwindSafe for DBVTBroadPhase<N, BV, T> where
BV: UnwindSafe,
N: UnwindSafe,
T: UnwindSafe,
Blanket Implementations
Mutably borrows from an owned value. Read more
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
. Read more
Convert Rc<Trait>
(where Trait: Downcast
) to Rc<Any>
. Rc<Any>
can then be
further downcast
into Rc<ConcreteType>
where ConcreteType
implements Trait
. Read more
Convert &Trait
(where Trait: Downcast
) to &Any
. This is needed since Rust cannot
generate &Any
’s vtable from &Trait
’s. Read more
Convert &mut Trait
(where Trait: Downcast
) to &Any
. This is needed since Rust cannot
generate &mut Any
’s vtable from &mut Trait
’s. Read more
type Output = T
type Output = T
Should always be Self
The inverse inclusion map: attempts to construct self
from the equivalent element of its
superset. Read more
Checks if self
is actually part of its subset T
(and can be converted to it).
Use with care! Same as self.to_subset
but without any property checks. Always succeeds.
The inclusion map: converts self
to the equivalent element of its superset.