Struct hypertree::red_black_tree::RBNode
source · #[repr(C)]pub struct RBNode<V> { /* private fields */ }
Expand description
Node in a RedBlack tree. The first 16 bytes are used for maintaining the RedBlack and BST properties, the rest is the payload.
Implementations§
Trait Implementations§
source§impl<V: Payload> Ord for RBNode<V>
impl<V: Payload> Ord for RBNode<V>
source§impl<V: Payload> PartialEq for RBNode<V>
impl<V: Payload> PartialEq for RBNode<V>
source§impl<V: Payload> PartialOrd for RBNode<V>
impl<V: Payload> PartialOrd for RBNode<V>
1.0.0 · source§fn le(&self, other: &Rhs) -> bool
fn le(&self, other: &Rhs) -> bool
This method tests less than or equal to (for
self
and other
) and is used by the <=
operator. Read moreimpl<V: Copy> Copy for RBNode<V>
impl<V: Payload> Eq for RBNode<V>
impl<V: Payload> Get for RBNode<V>
impl<V: Payload> Pod for RBNode<V>
Auto Trait Implementations§
impl<V> Freeze for RBNode<V>where
V: Freeze,
impl<V> RefUnwindSafe for RBNode<V>where
V: RefUnwindSafe,
impl<V> Send for RBNode<V>where
V: Send,
impl<V> Sync for RBNode<V>where
V: Sync,
impl<V> Unpin for RBNode<V>where
V: Unpin,
impl<V> UnwindSafe for RBNode<V>where
V: 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
§impl<T> CheckedBitPattern for Twhere
T: AnyBitPattern,
impl<T> CheckedBitPattern for Twhere
T: AnyBitPattern,
§type Bits = T
type Bits = T
Self
must have the same layout as the specified Bits
except for
the possible invalid bit patterns being checked during
is_valid_bit_pattern
.§fn is_valid_bit_pattern(_bits: &T) -> bool
fn is_valid_bit_pattern(_bits: &T) -> bool
If this function returns true, then it must be valid to reinterpret
bits
as &Self
.