pub struct AABBSetsInterferencesCollector<'a, N: 'a + RealField + Copy, T: 'a> {
pub ls_m2: &'a Isometry<N>,
pub ls_m2_abs_rot: &'a Matrix<N>,
pub tolerence: N,
pub collector: &'a mut Vec<(T, T)>,
}
Expand description
Spatial partitioning data structure visitor collecting interferences with a given bounding volume.
Fields§
§ls_m2: &'a Isometry<N>
The transform from the local-space of the second bounding volumes to the local space of the first.
ls_m2_abs_rot: &'a Matrix<N>
The absolute value of the rotation matrix representing ls_m2.rotation
.
Equals to ls_m2.rotation.to_rotation.matrix().matrix().abs()
.
tolerence: N
A tolerance applied to the interference tests.
AABB pairs closer than tolerance
will be reported as intersecting.
collector: &'a mut Vec<(T, T)>
The data contained by the nodes with bounding volumes intersecting self.bv
.
Implementations§
Trait Implementations§
Source§impl<'a, N: RealField + Copy, T: Clone> SimultaneousVisitor<T, AABB<N>> for AABBSetsInterferencesCollector<'a, N, T>
impl<'a, N: RealField + Copy, T: Clone> SimultaneousVisitor<T, AABB<N>> for AABBSetsInterferencesCollector<'a, N, T>
Auto Trait Implementations§
impl<'a, N, T> Freeze for AABBSetsInterferencesCollector<'a, N, T>where
N: Freeze,
impl<'a, N, T> RefUnwindSafe for AABBSetsInterferencesCollector<'a, N, T>where
N: RefUnwindSafe,
T: RefUnwindSafe,
impl<'a, N, T> Send for AABBSetsInterferencesCollector<'a, N, T>where
T: Send,
impl<'a, N, T> Sync for AABBSetsInterferencesCollector<'a, N, T>where
T: Sync,
impl<'a, N, T> Unpin for AABBSetsInterferencesCollector<'a, N, T>where
N: Unpin,
impl<'a, N, T> !UnwindSafe for AABBSetsInterferencesCollector<'a, N, 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.