[−][src]Enum ncollide3d::partitioning::BestFirstBVVisitStatus

pub enum BestFirstBVVisitStatus<N> {
    ContinueWithCost(N),
    Stop,
    ExitEarly,
}

The next action to be taken by a BVH traversal algorithm after having visited a node with a bounding volume.

Variants

ContinueWithCost(N)

The traversal continues recursively, associating the given cost to the visited node.

Stop

The traversal does not continue recursively on the descendants of this node (but continues on other nodes).

ExitEarly

The traversal aborts, returning the last best result found.

Auto Trait Implementations

impl<N> Send for BestFirstBVVisitStatus<N> where
    N: Send, 

impl<N> Sync for BestFirstBVVisitStatus<N> where
    N: Sync, 

Blanket Implementations

impl<T, U> Into for T where
    U: From<T>, [src]

impl<T> From for T[src]

impl<T, U> TryFrom for T where
    U: Into<T>, [src]

type Error = Infallible

The type returned in the event of a conversion error.

impl<T> Borrow for T where
    T: ?Sized, [src]

impl<T> BorrowMut for T where
    T: ?Sized, [src]

impl<T, U> TryInto for T where
    U: TryFrom<T>, [src]

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

The type returned in the event of a conversion error.

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

impl<SS, SP> SupersetOf for SP where
    SS: SubsetOf<SP>, [src]

impl<T> Downcast for T where
    T: Any, [src]

impl<T> Same for T

type Output = T

Should always be Self