Struct oxygengine_physics_2d::prelude::ncollide2d::query::visitors::RayIntersectionCostFnVisitor
source · pub struct RayIntersectionCostFnVisitor<'a, 'b, N, T, BV>where
N: 'a + RealField + Copy,
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, T, BV> 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,
impl<'a, 'b, N, T, BV> 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,
sourcepub fn new(
ray: &'b Ray<N>,
max_toi: N,
broad_phase: &'a (dyn BroadPhase<N, BV, T> + 'static),
cost_fn: &'a dyn Fn(T, &'b Ray<N>, N) -> Option<(T, RayIntersection<N>)>
) -> RayIntersectionCostFnVisitor<'a, 'b, N, T, BV>
pub fn new( ray: &'b Ray<N>, max_toi: N, broad_phase: &'a (dyn BroadPhase<N, BV, T> + 'static), 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,
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,
§type Result = (T, RayIntersection<N>)
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, <RayIntersectionCostFnVisitor<'a, 'b, N, T, BV> as BestFirstVisitor<N, BroadPhaseProxyHandle, BV>>::Result>
fn visit( &mut self, best_cost_so_far: N, bv: &BV, data: Option<&BroadPhaseProxyHandle> ) -> BestFirstVisitStatus<N, <RayIntersectionCostFnVisitor<'a, 'b, N, T, BV> as BestFirstVisitor<N, BroadPhaseProxyHandle, BV>>::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> !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> 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.