Struct ncollide2d::query::RayIntersectionCostFn [−][src]
pub struct RayIntersectionCostFn<'a, N: 'a + Real> { /* fields omitted */ }
A search thet selects the objects that has the smallest time of impact with a given ray.
Methods
impl<'a, N: Real> RayIntersectionCostFn<'a, N>[src]
impl<'a, N: Real> RayIntersectionCostFn<'a, N>pub fn new(ray: &'a Ray<N>, solid: bool) -> RayIntersectionCostFn<'a, N>[src]
pub fn new(ray: &'a Ray<N>, solid: bool) -> RayIntersectionCostFn<'a, N>Creates a new BestRayInterferenceSearch.
Trait Implementations
impl<'a, N, B, BV> BVTCostFn<N, B, BV> for RayIntersectionCostFn<'a, N> where
N: Real,
B: RayCast<N>,
BV: RayCast<N>, [src]
impl<'a, N, B, BV> BVTCostFn<N, B, BV> for RayIntersectionCostFn<'a, N> where
N: Real,
B: RayCast<N>,
BV: RayCast<N>, type UserData = RayIntersection<N>
User-defined data attached to each BVT leaf.
fn compute_bv_cost(&mut self, bv: &BV) -> Option<N>[src]
fn compute_bv_cost(&mut self, bv: &BV) -> Option<N>Computes the cost of a bounding volume.
fn compute_b_cost(&mut self, b: &B) -> Option<(N, RayIntersection<N>)>[src]
fn compute_b_cost(&mut self, b: &B) -> Option<(N, RayIntersection<N>)>Computes the cost of an object, and the result to be returned if it is the best one.
Auto Trait Implementations
impl<'a, N> Send for RayIntersectionCostFn<'a, N>
impl<'a, N> Send for RayIntersectionCostFn<'a, N>impl<'a, N> Sync for RayIntersectionCostFn<'a, N>
impl<'a, N> Sync for RayIntersectionCostFn<'a, N>