pub struct NearestCandidate<K> {
pub key: K,
pub lower_bound: Scalar,
pub stats: SpatialQueryStats,
}Expand description
Nearest accepted key according to AABB lower-bound distance.
Fields§
§key: KAccepted caller key.
lower_bound: ScalarNonnegative AABB lower bound.
stats: SpatialQueryStatsBroad-phase work performed to find this key.
Trait Implementations§
Source§impl<K: Clone> Clone for NearestCandidate<K>
impl<K: Clone> Clone for NearestCandidate<K>
Source§impl<K: Debug> Debug for NearestCandidate<K>
impl<K: Debug> Debug for NearestCandidate<K>
Source§impl<K: PartialEq> PartialEq for NearestCandidate<K>
impl<K: PartialEq> PartialEq for NearestCandidate<K>
impl<K: PartialEq> StructuralPartialEq for NearestCandidate<K>
Auto Trait Implementations§
impl<K> Freeze for NearestCandidate<K>where
K: Freeze,
impl<K> RefUnwindSafe for NearestCandidate<K>where
K: RefUnwindSafe,
impl<K> Send for NearestCandidate<K>where
K: Send,
impl<K> Sync for NearestCandidate<K>where
K: Sync,
impl<K> Unpin for NearestCandidate<K>where
K: Unpin,
impl<K> UnsafeUnpin for NearestCandidate<K>where
K: UnsafeUnpin,
impl<K> UnwindSafe for NearestCandidate<K>where
K: 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