Struct parry3d::query::details::IntersectionCompositeShapeShapeBestFirstVisitor

source · 
pub struct IntersectionCompositeShapeShapeBestFirstVisitor<'a, D: ?Sized, G1: ?Sized + 'a> { /* private fields */ }
👎Deprecated: Use IntersectionCompositeShapeShapeVisitor instead.
Expand description

A visitor for checking if a composite-shape and a shape intersect.

Implementations§

source§

impl<'a, D, G1> IntersectionCompositeShapeShapeBestFirstVisitor<'a, D, G1>
where D: ?Sized + QueryDispatcher, G1: ?Sized + TypedSimdCompositeShape,

source

pub fn new( dispatcher: &'a D, pos12: &'a Isometry<Real>, g1: &'a G1, g2: &'a dyn Shape ) -> IntersectionCompositeShapeShapeBestFirstVisitor<'a, D, G1>

Initialize a visitor for checking if a composite-shape and a shape intersect.

Trait Implementations§

source§

impl<'a, D, G1> SimdBestFirstVisitor<<G1 as TypedSimdCompositeShape>::PartId, SimdAabb> for IntersectionCompositeShapeShapeBestFirstVisitor<'a, D, G1>
where D: ?Sized + QueryDispatcher, G1: ?Sized + TypedSimdCompositeShape,

§

type Result = (<G1 as TypedSimdCompositeShape>::PartId, bool)

The result of a best-first traversal.
source§

fn visit( &mut self, best: Real, bv: &SimdAabb, data: Option<[Option<&G1::PartId>; 4]> ) -> SimdBestFirstVisitStatus<Self::Result>

Compute the next action to be taken by the best-first-search after visiting a node containing the given bounding volume.

Auto Trait Implementations§

§

impl<'a, D, G1> Freeze for IntersectionCompositeShapeShapeBestFirstVisitor<'a, D, G1>
where D: ?Sized, G1: ?Sized,

§

impl<'a, D, G1> !RefUnwindSafe for IntersectionCompositeShapeShapeBestFirstVisitor<'a, D, G1>

§

impl<'a, D, G1> Send for IntersectionCompositeShapeShapeBestFirstVisitor<'a, D, G1>
where D: Sync + ?Sized, G1: Sync + ?Sized,

§

impl<'a, D, G1> Sync for IntersectionCompositeShapeShapeBestFirstVisitor<'a, D, G1>
where D: Sync + ?Sized, G1: Sync + ?Sized,

§

impl<'a, D, G1> Unpin for IntersectionCompositeShapeShapeBestFirstVisitor<'a, D, G1>
where D: ?Sized, G1: ?Sized,

§

impl<'a, D, G1> !UnwindSafe for IntersectionCompositeShapeShapeBestFirstVisitor<'a, D, G1>

Blanket Implementations§

source§

impl<T> Any for T
where T: 'static + ?Sized,

source§

fn type_id(&self) -> TypeId

Gets the TypeId of self. Read more
source§

impl<T> Borrow<T> for T
where T: ?Sized,

source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
source§

impl<T> BorrowMut<T> for T
where T: ?Sized,

source§

fn borrow_mut(&mut self) -> &mut T

Mutably borrows from an owned value. Read more
source§

impl<T> Downcast for T
where T: Any,

source§

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>

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)

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)

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
where T: Any + Send + Sync,

source§

fn into_any_arc(self: Arc<T>) -> Arc<dyn Any + Sync + Send>

Convert Arc<Trait> (where Trait: Downcast) to Arc<Any>. Arc<Any> can then be further downcast into Arc<ConcreteType> where ConcreteType implements Trait.
source§

impl<T> From<T> for T

source§

fn from(t: T) -> T

Returns the argument unchanged.

source§

impl<T, U> Into<U> for T
where U: From<T>,

source§

fn into(self) -> U

Calls U::from(self).

That is, this conversion is whatever the implementation of From<T> for U chooses to do.

source§

impl<T> IntoEither for T

source§

fn into_either(self, into_left: bool) -> Either<Self, Self>

Converts self into a Left variant of Either<Self, Self> if into_left is true. Converts self into a Right variant of Either<Self, Self> otherwise. Read more
source§

fn into_either_with<F>(self, into_left: F) -> Either<Self, Self>
where F: FnOnce(&Self) -> bool,

Converts self into a Left variant of Either<Self, Self> if into_left(&self) returns true. Converts self into a Right variant of Either<Self, Self> otherwise. Read more
source§

impl<T> Same for T

§

type Output = T

Should always be Self
source§

impl<SS, SP> SupersetOf<SS> for SP
where SS: SubsetOf<SP>,

source§

fn to_subset(&self) -> Option<SS>

The inverse inclusion map: attempts to construct self from the equivalent element of its superset. Read more
source§

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

Use with care! Same as self.to_subset but without any property checks. Always succeeds.
source§

fn from_subset(element: &SS) -> SP

The inclusion map: converts self to the equivalent element of its superset.
source§

impl<T, U> TryFrom<U> for T
where U: Into<T>,

§

type Error = Infallible

The type returned in the event of a conversion error.
source§

fn try_from(value: U) -> Result<T, <T as TryFrom<U>>::Error>

Performs the conversion.
source§

impl<T, U> TryInto<U> for T
where U: TryFrom<T>,

§

type Error = <U as TryFrom<T>>::Error

The type returned in the event of a conversion error.
source§

fn try_into(self) -> Result<U, <U as TryFrom<T>>::Error>

Performs the conversion.