kernel::rbtree

Struct RBTreeNode

Source 
pub struct RBTreeNode<K, V> { /* private fields */ }
Expand description

A red-black tree node.

The node is fully initialised (with key and value) and can be inserted into a tree without any extra allocations or failure paths.

Implementations§

Source§

impl<K, V> RBTreeNode<K, V>

Source

pub fn new(key: K, value: V, flags: Flags) -> Result<RBTreeNode<K, V>>

Allocates and initialises a node that can be inserted into the tree via RBTree::insert.

Source

pub fn to_key_value(self) -> (K, V)

Get the key and value from inside the node.

Source§

impl<K, V> RBTreeNode<K, V>

Source

pub fn into_reservation(self) -> RBTreeNodeReservation<K, V>

Drop the key and value, but keep the allocation.

It then becomes a reservation that can be re-initialised into a different node (i.e., with a different key and/or value).

The existing key and value are dropped in-place as part of this operation, that is, memory may be freed (but only for the key/value; memory for the node itself is kept for reuse).

Trait Implementations§

Source§

impl<K: Send, V: Send> Send for RBTreeNode<K, V>

Source§

impl<K: Sync, V: Sync> Sync for RBTreeNode<K, V>

Auto Trait Implementations§

§

impl<K, V> Freeze for RBTreeNode<K, V>

§

impl<K, V> RefUnwindSafe for RBTreeNode<K, V>
where K: RefUnwindSafe, V: RefUnwindSafe,

§

impl<K, V> Unpin for RBTreeNode<K, V>

§

impl<K, V> UnwindSafe for RBTreeNode<K, V>
where K: RefUnwindSafe, V: RefUnwindSafe,

Blanket Implementations§

Source§

impl<T> Any for T
where T: 'static + ?Sized,

Source§

fn type_id(&self) -> TypeId

Gets the TypeId of self. Read more
Source§

impl<T> Borrow<T> for T
where T: ?Sized,

Source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
Source§

impl<T> BorrowMut<T> for T
where T: ?Sized,

Source§

fn borrow_mut(&mut self) -> &mut T

Mutably borrows from an owned value. Read more
Source§

impl<T> From<T> for T

Source§

fn from(t: T) -> T

Returns the argument unchanged.

Source§

impl<T, E> Init<T, E> for T

Source§

unsafe fn __init(self, slot: *mut T) -> Result<(), E>

Initializes slot. Read more
Source§

fn chain<F>(self, f: F) -> ChainInit<Self, F, T, E>
where F: FnOnce(&mut T) -> Result<(), E>,

First initializes the value using self then calls the function f with the initialized value. Read more
Source§

impl<T, U> Into<U> for T
where U: From<T>,

Source§

fn into(self) -> U

Calls U::from(self).

That is, this conversion is whatever the implementation of From<T> for U chooses to do.

Source§

impl<T, E> PinInit<T, E> for T

Source§

unsafe fn __pinned_init(self, slot: *mut T) -> Result<(), E>

Initializes slot. Read more
Source§

fn pin_chain<F>(self, f: F) -> ChainPinInit<Self, F, T, E>
where F: FnOnce(Pin<&mut T>) -> Result<(), E>,

First initializes the value using self then calls the function f with the initialized value. Read more
Source§

impl<T, U> TryFrom<U> for T
where U: Into<T>,

Source§

type Error = Infallible

The type returned in the event of a conversion error.
Source§

fn try_from(value: U) -> Result<T, <T as TryFrom<U>>::Error>

Performs the conversion.
Source§

impl<T, U> TryInto<U> for T
where U: TryFrom<T>,

Source§

type Error = <U as TryFrom<T>>::Error

The type returned in the event of a conversion error.
Source§

fn try_into(self) -> Result<U, <U as TryFrom<T>>::Error>

Performs the conversion.