pub struct DBVTBroadPhase<N: RealField + Copy, BV, T> { /* private fields */ }
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§
Source§impl<N, BV, T> DBVTBroadPhase<N, BV, T>
impl<N, BV, T> DBVTBroadPhase<N, BV, T>
Sourcepub fn new(margin: N) -> DBVTBroadPhase<N, BV, T>
pub fn new(margin: N) -> DBVTBroadPhase<N, BV, T>
Creates a new broad phase based on a Dynamic Bounding Volume Tree.
Sourcepub fn num_interferences(&self) -> usize
pub fn num_interferences(&self) -> usize
Number of interferences detected by this broad phase.
Trait Implementations§
Source§impl<N, BV, T> BroadPhase<N, BV, T> for DBVTBroadPhase<N, BV, T>
impl<N, BV, T> BroadPhase<N, BV, T> for DBVTBroadPhase<N, BV, T>
Source§fn proxy(&self, handle: BroadPhaseProxyHandle) -> Option<(&BV, &T)>
fn proxy(&self, handle: BroadPhaseProxyHandle) -> Option<(&BV, &T)>
Retrieves the bounding volume and data associated to the given proxy.
Source§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.
Source§fn update(&mut self, handler: &mut dyn BroadPhaseInterferenceHandler<T>)
fn update(&mut self, handler: &mut dyn BroadPhaseInterferenceHandler<T>)
Updates the object additions, removals, and interferences detection.
Source§fn create_proxy(&mut self, bv: BV, data: T) -> BroadPhaseProxyHandle
fn create_proxy(&mut self, bv: BV, data: T) -> BroadPhaseProxyHandle
Tells the broad phase to add a bounding-volume at the next update.
Source§fn remove(
&mut self,
handles: &[BroadPhaseProxyHandle],
handler: &mut dyn FnMut(&T, &T),
)
fn remove( &mut self, handles: &[BroadPhaseProxyHandle], handler: &mut dyn FnMut(&T, &T), )
Tells the broad phase to remove the given set of handles.
Source§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.
Source§fn deferred_recompute_all_proximities_with(
&mut self,
handle: BroadPhaseProxyHandle,
)
fn deferred_recompute_all_proximities_with( &mut self, handle: BroadPhaseProxyHandle, )
Forces the broad-phase to recompute and re-report all the proximities with the given object.
Source§fn deferred_recompute_all_proximities(&mut self)
fn deferred_recompute_all_proximities(&mut self)
Forces the broad-phase to recompute and re-report all the proximities.
Source§fn interferences_with_bounding_volume<'a>(
&'a self,
bv: &BV,
out: &mut Vec<&'a T>,
)
fn interferences_with_bounding_volume<'a>( &'a self, bv: &BV, out: &mut Vec<&'a T>, )
Collects every object which might intersect a given bounding volume.
Auto Trait Implementations§
impl<N, BV, T> Freeze for DBVTBroadPhase<N, BV, T>where
N: Freeze,
impl<N, BV, T> RefUnwindSafe for DBVTBroadPhase<N, BV, T>
impl<N, BV, T> Send for DBVTBroadPhase<N, BV, T>
impl<N, BV, T> Sync for DBVTBroadPhase<N, BV, T>
impl<N, BV, T> Unpin for DBVTBroadPhase<N, BV, T>
impl<N, BV, T> UnwindSafe for DBVTBroadPhase<N, BV, T>
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<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.