pub struct OrderKey(/* private fields */);Expand description
A node’s place among its siblings: a key that sorts between its neighbours’, chosen when it is placed, so a node placed anywhere — before the first of 100,000 — takes a key of its own and renumbers none. Its digits are bytes compared in order; the last is never zero, so there is always room between two keys.
Implementations§
Trait Implementations§
impl Eq for OrderKey
Source§impl Ord for OrderKey
impl Ord for OrderKey
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
1.21.0 (const: unstable) · Source§fn min(self, other: Self) -> Selfwhere
Self: Sized,
fn min(self, other: Self) -> Selfwhere
Self: Sized,
Compares and returns the minimum of two values. Read more
Source§impl PartialOrd for OrderKey
impl PartialOrd for OrderKey
impl StructuralPartialEq for OrderKey
Auto Trait Implementations§
impl Freeze for OrderKey
impl RefUnwindSafe for OrderKey
impl Send for OrderKey
impl Sync for OrderKey
impl Unpin for OrderKey
impl UnsafeUnpin for OrderKey
impl UnwindSafe for OrderKey
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> CloneToUninit for Twhere
T: Clone,
impl<T> CloneToUninit for Twhere
T: Clone,
Source§impl<Q, K> Comparable<K> for Q
impl<Q, K> Comparable<K> for Q
Source§impl<Q, K> Equivalent<K> for Q
impl<Q, K> Equivalent<K> for Q
Source§impl<Q, K> Equivalent<K> for Q
impl<Q, K> Equivalent<K> for Q
Source§fn equivalent(&self, key: &K) -> bool
fn equivalent(&self, key: &K) -> bool
Compare self to
key and return true if they are equal.