[−][src]Struct ncollide2d::pipeline::narrow_phase::SupportMapSupportMapProximityDetector
Persistent proximity detector between two shapes having a support mapping function.
It is based on the GJK algorithm.
Methods
impl<N: RealField> SupportMapSupportMapProximityDetector<N>[src]
pub fn new() -> SupportMapSupportMapProximityDetector<N>[src]
Creates a new persistant proximity detector between two shapes with support mapping functions.
It is initialized with a pre-created simplex.
Trait Implementations
impl<N: Clone + RealField> Clone for SupportMapSupportMapProximityDetector<N>[src]
fn clone(&self) -> SupportMapSupportMapProximityDetector<N>[src]
fn clone_from(&mut self, source: &Self)1.0.0[src]
impl<N: RealField> ProximityDetector<N> for SupportMapSupportMapProximityDetector<N>[src]
Auto Trait Implementations
impl<N> RefUnwindSafe for SupportMapSupportMapProximityDetector<N> where
N: RefUnwindSafe + Scalar,
N: RefUnwindSafe + Scalar,
impl<N> Send for SupportMapSupportMapProximityDetector<N> where
N: Scalar,
N: Scalar,
impl<N> Sync for SupportMapSupportMapProximityDetector<N> where
N: Scalar,
N: Scalar,
impl<N> Unpin for SupportMapSupportMapProximityDetector<N> where
N: Scalar + Unpin,
N: Scalar + Unpin,
impl<N> UnwindSafe for SupportMapSupportMapProximityDetector<N> where
N: Scalar + UnwindSafe,
N: Scalar + UnwindSafe,
Blanket Implementations
impl<T> Any for T where
T: 'static + ?Sized, [src]
T: 'static + ?Sized,
impl<T> Borrow<T> for T where
T: ?Sized, [src]
T: ?Sized,
impl<T> BorrowMut<T> for T where
T: ?Sized, [src]
T: ?Sized,
fn borrow_mut(&mut self) -> &mut T[src]
impl<T> Downcast for T where
T: Any,
T: Any,
fn into_any(self: Box<T>) -> Box<dyn Any + 'static>
fn into_any_rc(self: Rc<T>) -> Rc<dyn Any + 'static>
fn as_any(&self) -> &(dyn Any + 'static)
fn as_any_mut(&mut self) -> &mut (dyn Any + 'static)
impl<T> DowncastSync for T where
T: Send + Sync + Any,
T: Send + Sync + Any,
impl<T> From<T> for T[src]
impl<T, U> Into<U> for T where
U: From<T>, [src]
U: From<T>,
impl<T> Same<T> for T
type Output = T
Should always be Self
impl<SS, SP> SupersetOf<SS> for SP where
SS: SubsetOf<SP>,
SS: SubsetOf<SP>,
fn to_subset(&self) -> Option<SS>
fn is_in_subset(&self) -> bool
unsafe fn to_subset_unchecked(&self) -> SS
fn from_subset(element: &SS) -> SP
impl<T> ToOwned for T where
T: Clone, [src]
T: Clone,
type Owned = T
The resulting type after obtaining ownership.
fn to_owned(&self) -> T[src]
fn clone_into(&self, target: &mut T)[src]
impl<T, U> TryFrom<U> for T where
U: Into<T>, [src]
U: Into<T>,
type Error = Infallible
The type returned in the event of a conversion error.
fn try_from(value: U) -> Result<T, <T as TryFrom<U>>::Error>[src]
impl<T, U> TryInto<U> for T where
U: TryFrom<T>, [src]
U: TryFrom<T>,
type Error = <U as TryFrom<T>>::Error
The type returned in the event of a conversion error.
fn try_into(self) -> Result<U, <U as TryFrom<T>>::Error>[src]
impl<V, T> VZip<V> for T where
V: MultiLane<T>,
V: MultiLane<T>,