pub struct PointKey { /* private fields */ }Expand description
The identity of a Point: the exact bit patterns of its coordinates.
This is the only way points are compared for identity anywhere in the crate.
-0.0 is normalized to 0.0 first, so the two zeroes are one point; every
other value keys on itself and nothing else. Ordering is by bit pattern —
meaningless geometrically, but total and stable, which is what a BTreeMap
needs to keep iteration reproducible.
Implementations§
Trait Implementations§
impl Copy for PointKey
impl Eq for PointKey
Source§impl Ord for PointKey
impl Ord for PointKey
1.21.0 (const: unstable) · Source§fn max(self, other: Self) -> Selfwhere
Self: Sized,
fn max(self, other: Self) -> Selfwhere
Self: Sized,
Compares and returns the maximum of two values. Read more
Source§impl PartialOrd for PointKey
impl PartialOrd for PointKey
impl StructuralPartialEq for PointKey
Auto Trait Implementations§
impl Freeze for PointKey
impl RefUnwindSafe for PointKey
impl Send for PointKey
impl Sync for PointKey
impl Unpin for PointKey
impl UnsafeUnpin for PointKey
impl UnwindSafe for PointKey
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