pub enum BestFirstVisitStatus<N, Res> {
Continue {
cost: N,
result: Option<Res>,
},
Stop,
ExitEarly(Option<Res>),
}
Expand description
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
§
cost: N
The cost associated to this node.
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> Freeze for BestFirstVisitStatus<N, Res>
impl<N, Res> RefUnwindSafe for BestFirstVisitStatus<N, Res>where
N: RefUnwindSafe,
Res: RefUnwindSafe,
impl<N, Res> Send for BestFirstVisitStatus<N, Res>
impl<N, Res> Sync for BestFirstVisitStatus<N, Res>
impl<N, Res> Unpin for BestFirstVisitStatus<N, Res>
impl<N, Res> UnwindSafe for BestFirstVisitStatus<N, Res>where
N: UnwindSafe,
Res: UnwindSafe,
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
Source§impl<T> Downcast for Twhere
T: Any,
impl<T> Downcast for Twhere
T: Any,
Source§fn into_any(self: Box<T>) -> Box<dyn Any>
fn into_any(self: Box<T>) -> Box<dyn Any>
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
.Source§fn into_any_rc(self: Rc<T>) -> Rc<dyn Any>
fn into_any_rc(self: Rc<T>) -> Rc<dyn Any>
Convert
Rc<Trait>
(where Trait: Downcast
) to Rc<Any>
. Rc<Any>
can then be
further downcast
into Rc<ConcreteType>
where ConcreteType
implements Trait
.Source§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.Source§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.Source§impl<T> DowncastSync for T
impl<T> DowncastSync for T
Source§impl<SS, SP> SupersetOf<SS> for SPwhere
SS: SubsetOf<SP>,
impl<SS, SP> SupersetOf<SS> for SPwhere
SS: SubsetOf<SP>,
Source§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 moreSource§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).Source§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.Source§fn from_subset(element: &SS) -> SP
fn from_subset(element: &SS) -> SP
The inclusion map: converts
self
to the equivalent element of its superset.