[−][src]Enum ncollide2d::partitioning::BestFirstVisitStatus

pub enum BestFirstVisitStatus<N, Res> {
    Continue {
        cost: N,
        result: Option<Res>,
    },
    Stop,
    ExitEarly(Option<Res>),
}

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

Variants

Continue

The traversal continues recursively, associating the given cost to the visited node and some associated result.

Fields of Continue

cost: N

The cost associated to this node.

result: Option<Res>

The result, if any, associated to this cost.

Stop

The traversal does not continue recursively on the visited node's children.

ExitEarly(Option<Res>)

The traversal aborts.

If a data is provided, then it is returned as the result of the traversal. If no result is provided, then the last best result found becomes the result of the traversal.

Auto Trait Implementations

`impl<N, Res> RefUnwindSafe for BestFirstVisitStatus<N, Res> where N: RefUnwindSafe, Res: RefUnwindSafe,`

`impl<N, Res> Send for BestFirstVisitStatus<N, Res> where N: Send, Res: Send,`

`impl<N, Res> Sync for BestFirstVisitStatus<N, Res> where N: Sync, Res: Sync,`

`impl<N, Res> Unpin for BestFirstVisitStatus<N, Res> where N: Unpin, Res: Unpin,`

`impl<N, Res> UnwindSafe for BestFirstVisitStatus<N, Res> where N: UnwindSafe, Res: UnwindSafe,`

Blanket Implementations

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

`fn type_id(&self) -> TypeId`[src]

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

`fn borrow(&self) -> &T`[src]

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

`fn borrow_mut(&mut self) -> &mut T`[src]

`impl<T> Downcast for T where T: Any,`

`fn into_any(self: Box<T>) -> Box<dyn Any + 'static>`

`fn into_any_rc(self: Rc<T>) -> Rc<dyn Any + 'static>`

`fn as_any(&self) -> &(dyn Any + 'static)`

`fn as_any_mut(&mut self) -> &mut (dyn Any + 'static)`

`impl<T> DowncastSync for T where T: Send + Sync + Any,`

`fn into_any_arc(self: Arc<T>) -> Arc<dyn Any + 'static + Send + Sync>`

`impl<T> From<T> for T`[src]

`fn from(t: T) -> T`[src]

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

`fn into(self) -> U`[src]

`impl<T> Same<T> for T`

`type Output = T`

Should always be Self

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

`fn to_subset(&self) -> Option<SS>`

`fn is_in_subset(&self) -> bool`

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

`fn from_subset(element: &SS) -> SP`

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

`type Error = Infallible`

The type returned in the event of a conversion error.

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

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

`type Error = >::Error`

The type returned in the event of a conversion error.

[−][src]Enum ncollide2d::partitioning::BestFirstVisitStatus

Variants

Fields of Continue

Auto Trait Implementations

impl<N, Res> RefUnwindSafe for BestFirstVisitStatus<N, Res> where N: RefUnwindSafe, Res: RefUnwindSafe,

impl<N, Res> Send for BestFirstVisitStatus<N, Res> where N: Send, Res: Send,

impl<N, Res> Sync for BestFirstVisitStatus<N, Res> where N: Sync, Res: Sync,

impl<N, Res> Unpin for BestFirstVisitStatus<N, Res> where N: Unpin, Res: Unpin,

impl<N, Res> UnwindSafe for BestFirstVisitStatus<N, Res> where N: UnwindSafe, Res: UnwindSafe,

Blanket Implementations

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

fn type_id(&self) -> TypeId[src]

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

fn borrow(&self) -> &T[src]

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

fn borrow_mut(&mut self) -> &mut T[src]

impl<T> Downcast for T where T: Any,

fn into_any(self: Box<T>) -> Box<dyn Any + 'static>

fn into_any_rc(self: Rc<T>) -> Rc<dyn Any + 'static>

fn as_any(&self) -> &(dyn Any + 'static)

fn as_any_mut(&mut self) -> &mut (dyn Any + 'static)

impl<T> DowncastSync for T where T: Send + Sync + Any,

fn into_any_arc(self: Arc<T>) -> Arc<dyn Any + 'static + Send + Sync>

impl<T> From<T> for T[src]

fn from(t: T) -> T[src]

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

fn into(self) -> U[src]

impl<T> Same<T> for T

type Output = T

impl<SS, SP> SupersetOf<SS> for SP where SS: SubsetOf<SP>,

fn to_subset(&self) -> Option<SS>

fn is_in_subset(&self) -> bool

unsafe fn to_subset_unchecked(&self) -> SS

fn from_subset(element: &SS) -> SP

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

type Error = Infallible

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

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

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

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

impl<V, T> VZip<V> for T where V: MultiLane<T>,

fn vzip(self) -> V