ncollide3d::query::visitors

Struct RayIntersectionCostFnVisitor

Source 
pub struct RayIntersectionCostFnVisitor<'a, 'b, N: 'a + RealField + Copy, T, BV>
where
    BV: BoundingVolume<N> + RayCast<N> + PointQuery<N> + Any + Send + Sync + Clone,
    T: Any + Send + Sync,
{ /* private fields */ }
Expand description

Bounding Volume Tree visitor collecting interferences with a given ray.

Implementations§

Source§

impl<'a, 'b, N: RealField + Copy, T, BV> RayIntersectionCostFnVisitor<'a, 'b, N, T, BV>
where BV: BoundingVolume<N> + RayCast<N> + PointQuery<N> + Any + Send + Sync + Clone, T: Any + Send + Sync,

Source

pub fn new( ray: &'b Ray<N>, max_toi: N, broad_phase: &'a dyn BroadPhase<N, BV, T>, cost_fn: &'a dyn Fn(T, &'b Ray<N>, N) -> Option<(T, RayIntersection<N>)>, ) -> RayIntersectionCostFnVisitor<'a, 'b, N, T, BV>

Creates a new RayIntersectionCostFnVisitor.

Trait Implementations§

Source§

impl<'a, 'b, N, BV, T> BestFirstVisitor<N, BroadPhaseProxyHandle, BV> for RayIntersectionCostFnVisitor<'a, 'b, N, T, BV>
where N: RealField + Copy, BV: BoundingVolume<N> + RayCast<N> + PointQuery<N> + Any + Send + Sync + Clone, T: Any + Send + Sync + Clone,

Source§

type Result = (T, RayIntersection<N>)

The result of a best-first traversal.
Source§

fn visit( &mut self, best_cost_so_far: N, bv: &BV, data: Option<&BroadPhaseProxyHandle>, ) -> BestFirstVisitStatus<N, 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, 'b, N, T, BV> Freeze for RayIntersectionCostFnVisitor<'a, 'b, N, T, BV>
where N: Freeze,

§

impl<'a, 'b, N, T, BV> !RefUnwindSafe for RayIntersectionCostFnVisitor<'a, 'b, N, T, BV>

§

impl<'a, 'b, N, T, BV> !Send for RayIntersectionCostFnVisitor<'a, 'b, N, T, BV>

§

impl<'a, 'b, N, T, BV> !Sync for RayIntersectionCostFnVisitor<'a, 'b, N, T, BV>

§

impl<'a, 'b, N, T, BV> Unpin for RayIntersectionCostFnVisitor<'a, 'b, N, T, BV>
where N: Unpin,

§

impl<'a, 'b, N, T, BV> !UnwindSafe for RayIntersectionCostFnVisitor<'a, 'b, N, T, BV>

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> 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> Same for T

Source§

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>,

Source§

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>,

Source§

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.