Enum parry3d::partitioning::SimdBestFirstVisitStatus [−][src]
pub enum SimdBestFirstVisitStatus<Res> { MaybeContinue { weights: SimdReal, mask: SimdBool, results: [Option<Res>; 4], }, 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
Expand description
The traversal can continue.
Show fields
Fields of MaybeContinue
weights: SimdReal
Expand description
The weight associated to each child of the node being traversed.
mask: SimdBool
Expand description
Each lane indicates if the corresponding child of the node being traversed should be traversed too.
results: [Option<Res>; 4]
Expand description
Optional results associated to each child of the node being traversed.
ExitEarly(Option<Res>)
Expand description
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<Res> RefUnwindSafe for SimdBestFirstVisitStatus<Res> where
Res: RefUnwindSafe,
Res: RefUnwindSafe,
impl<Res> Send for SimdBestFirstVisitStatus<Res> where
Res: Send,
Res: Send,
impl<Res> Sync for SimdBestFirstVisitStatus<Res> where
Res: Sync,
Res: Sync,
impl<Res> Unpin for SimdBestFirstVisitStatus<Res> where
Res: Unpin,
Res: Unpin,
impl<Res> UnwindSafe for SimdBestFirstVisitStatus<Res> where
Res: UnwindSafe,
Res: UnwindSafe,
Blanket Implementations
impl<T> BorrowMut<T> for T where
T: ?Sized,
[src]
impl<T> BorrowMut<T> for T where
T: ?Sized,
[src]pub fn borrow_mut(&mut self) -> &mut T
[src]
pub fn borrow_mut(&mut self) -> &mut T
[src]Mutably borrows from an owned value. Read more
impl<T> Downcast for T where
T: Any,
[src]
impl<T> Downcast for T where
T: Any,
[src]pub fn into_any(self: Box<T, Global>) -> Box<dyn Any + 'static, Global>
[src]
pub fn into_any(self: Box<T, Global>) -> Box<dyn Any + 'static, Global>
[src]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
. Read more
pub fn into_any_rc(self: Rc<T>) -> Rc<dyn Any + 'static>
[src]
pub fn into_any_rc(self: Rc<T>) -> Rc<dyn Any + 'static>
[src]Convert Rc<Trait>
(where Trait: Downcast
) to Rc<Any>
. Rc<Any>
can then be
further downcast
into Rc<ConcreteType>
where ConcreteType
implements Trait
. Read more
pub fn as_any(&self) -> &(dyn Any + 'static)
[src]
pub fn as_any(&self) -> &(dyn Any + 'static)
[src]Convert &Trait
(where Trait: Downcast
) to &Any
. This is needed since Rust cannot
generate &Any
’s vtable from &Trait
’s. Read more
pub fn as_any_mut(&mut self) -> &mut (dyn Any + 'static)
[src]
pub fn as_any_mut(&mut self) -> &mut (dyn Any + 'static)
[src]Convert &mut Trait
(where Trait: Downcast
) to &Any
. This is needed since Rust cannot
generate &mut Any
’s vtable from &mut Trait
’s. Read more
impl<T> DowncastSync for T where
T: Any + Send + Sync,
[src]
impl<T> DowncastSync for T where
T: Any + Send + Sync,
[src]impl<T> Same<T> for T
impl<T> Same<T> for T
type Output = T
type Output = T
Should always be Self
impl<SS, SP> SupersetOf<SS> for SP where
SS: SubsetOf<SP>,
[src]
impl<SS, SP> SupersetOf<SS> for SP where
SS: SubsetOf<SP>,
[src]pub fn to_subset(&self) -> Option<SS>
[src]
pub fn to_subset(&self) -> Option<SS>
[src]The inverse inclusion map: attempts to construct self
from the equivalent element of its
superset. Read more
pub fn is_in_subset(&self) -> bool
[src]
pub fn is_in_subset(&self) -> bool
[src]Checks if self
is actually part of its subset T
(and can be converted to it).
pub fn to_subset_unchecked(&self) -> SS
[src]
pub fn to_subset_unchecked(&self) -> SS
[src]Use with care! Same as self.to_subset
but without any property checks. Always succeeds.
pub fn from_subset(element: &SS) -> SP
[src]
pub fn from_subset(element: &SS) -> SP
[src]The inclusion map: converts self
to the equivalent element of its superset.