Struct oxygengine_physics_2d::prelude::ncollide2d::query::Chain
source · pub struct Chain<T, U>(/* private fields */);Expand description
The composition of two dispatchers
Trait Implementations§
source§impl<N, T, U> TOIDispatcher<N> for Chain<T, U>where
N: RealField + Copy,
T: TOIDispatcher<N>,
U: TOIDispatcher<N>,
impl<N, T, U> TOIDispatcher<N> for Chain<T, U>where N: RealField + Copy, T: TOIDispatcher<N>, U: TOIDispatcher<N>,
source§fn nonlinear_time_of_impact(
&self,
root_dispatcher: &dyn TOIDispatcher<N>,
motion1: &dyn RigidMotion<N>,
g1: &(dyn Shape<N> + 'static),
motion2: &dyn RigidMotion<N>,
g2: &(dyn Shape<N> + 'static),
max_toi: N,
target_distance: N
) -> Result<Option<TOI<N>>, Unsupported>
fn nonlinear_time_of_impact( &self, root_dispatcher: &dyn TOIDispatcher<N>, motion1: &dyn RigidMotion<N>, g1: &(dyn Shape<N> + 'static), motion2: &dyn RigidMotion<N>, g2: &(dyn Shape<N> + 'static), max_toi: N, target_distance: N ) -> Result<Option<TOI<N>>, Unsupported>
Computes the smallest time of impact of two shapes under translational movement.
source§fn time_of_impact(
&self,
root_dispatcher: &dyn TOIDispatcher<N>,
m1: &Isometry<N, Unit<Complex<N>>, 2>,
vel1: &Matrix<N, Const<nalgebra::::base::dimension::U2::{constant#0}>, Const<1>, ArrayStorage<N, 2, 1>>,
g1: &(dyn Shape<N> + 'static),
m2: &Isometry<N, Unit<Complex<N>>, 2>,
vel2: &Matrix<N, Const<nalgebra::::base::dimension::U2::{constant#0}>, Const<1>, ArrayStorage<N, 2, 1>>,
g2: &(dyn Shape<N> + 'static),
max_toi: N,
target_distance: N
) -> Result<Option<TOI<N>>, Unsupported>
fn time_of_impact( &self, root_dispatcher: &dyn TOIDispatcher<N>, m1: &Isometry<N, Unit<Complex<N>>, 2>, vel1: &Matrix<N, Const<nalgebra::::base::dimension::U2::{constant#0}>, Const<1>, ArrayStorage<N, 2, 1>>, g1: &(dyn Shape<N> + 'static), m2: &Isometry<N, Unit<Complex<N>>, 2>, vel2: &Matrix<N, Const<nalgebra::::base::dimension::U2::{constant#0}>, Const<1>, ArrayStorage<N, 2, 1>>, g2: &(dyn Shape<N> + 'static), max_toi: N, target_distance: N ) -> Result<Option<TOI<N>>, Unsupported>
Computes the smallest time at with two shapes under translational movement are separated by a
distance smaller or equal to
distance. Read moreAuto Trait Implementations§
impl<T, U> RefUnwindSafe for Chain<T, U>where T: RefUnwindSafe, U: RefUnwindSafe,
impl<T, U> Send for Chain<T, U>where T: Send, U: Send,
impl<T, U> Sync for Chain<T, U>where T: Sync, U: Sync,
impl<T, U> Unpin for Chain<T, U>where T: Unpin, U: Unpin,
impl<T, U> UnwindSafe for Chain<T, U>where T: UnwindSafe, U: UnwindSafe,
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
§impl<T> Downcast for Twhere
T: Any,
impl<T> Downcast for Twhere T: Any,
§fn into_any(self: Box<T, Global>) -> Box<dyn Any, Global>
fn into_any(self: Box<T, Global>) -> Box<dyn Any, Global>
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.§fn into_any_rc(self: Rc<T, Global>) -> Rc<dyn Any, Global>
fn into_any_rc(self: Rc<T, Global>) -> Rc<dyn Any, Global>
Convert
Rc<Trait> (where Trait: Downcast) to Rc<Any>. Rc<Any> can then be
further downcast into Rc<ConcreteType> where ConcreteType implements Trait.§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.§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.§impl<SS, SP> SupersetOf<SS> for SPwhere
SS: SubsetOf<SP>,
impl<SS, SP> SupersetOf<SS> for SPwhere SS: SubsetOf<SP>,
§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 more§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).§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.§fn from_subset(element: &SS) -> SP
fn from_subset(element: &SS) -> SP
The inclusion map: converts
self to the equivalent element of its superset.