# [−][src]Struct ncollide3d::query::RayIntersectionCostFn

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,

uvs: bool

) -> RayIntersectionCostFn<'a, N>

[src]

`pub fn new(`

ray: &'a Ray<N>,

solid: bool,

uvs: 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>`

## Blanket Implementations

`impl<T> From for T`

[src]

`impl<T> From for T`

`impl<T, U> Into for T where`

U: From<T>,

[src]

`impl<T, U> Into for T where`

U: From<T>,

`impl<T, U> TryFrom for T where`

T: From<U>,

[src]

`impl<T, U> TryFrom for T where`

T: From<U>,

`type Error = !`

`try_from`

)The type returned in the event of a conversion error.

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

[src]

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

`try_from`

)Performs the conversion.

`impl<T> Borrow for T where`

T: ?Sized,

[src]

`impl<T> Borrow for T where`

T: ?Sized,

`impl<T> Any for T where`

T: 'static + ?Sized,

[src]

`impl<T> Any for T where`

T: 'static + ?Sized,

`fn get_type_id(&self) -> TypeId`

[src]

`fn get_type_id(&self) -> TypeId`

## 🔬 This is a nightly-only experimental API. (`get_type_id`

)

this method will likely be replaced by an associated static

Gets the `TypeId`

of `self`

. Read more

`impl<T, U> TryInto for T where`

U: TryFrom<T>,

[src]

`impl<T, U> TryInto for T where`

U: TryFrom<T>,

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

`try_from`

)The type returned in the event of a conversion error.

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

[src]

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

`try_from`

)Performs the conversion.

`impl<T> BorrowMut for T where`

T: ?Sized,

[src]

`impl<T> BorrowMut for T where`

T: ?Sized,

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

[src]

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

Mutably borrows from an owned value. Read more

`impl<SS, SP> SupersetOf for SP where`

SS: SubsetOf<SP>,

`impl<SS, SP> SupersetOf for SP where`

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).

`unsafe fn to_subset_unchecked(&self) -> SS`

`unsafe 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.

`impl<T> Same for T`

`impl<T> Same for T`

`type Output = T`

Should always be `Self`