Struct Node 

pub struct Node<T> {
    pub t: T,
    /* private fields */
}

A node in a RedBlackTree.

The only publically available field is the contained value t, which can also be obtained through val(). Node<T> implements Deref<Target = T>, so you can use &Node<T> in place of &T through deref-coercion.

Fields

t: T

The value contained in the Node.

Implementations

impl<T> Node<T>

pub fn val(&self) -> &T

Returns a shared reference to the value contained in the node.

pub fn min(&self) -> &Node<T>

Returns the minimum value in this subtree.

This operation is O(log n).

pub fn max(&self) -> &Node<T>

Returns the maximum value in this subtree.

This operation is O(log n).

pub fn predecessor(&self) -> Option<&Node<T>>

Returns the predecessor node, which is the previous in-order node and is not necessarily within the sub-tree defined by the current node.

This operation is at-worst O(log n).

pub fn successor(&self) -> Option<&Node<T>>

Returns the successor node, which is the previous in-order node and is not necessarily within the sub-tree defined by the current node.

This operation is at-worst O(log n).

pub fn iter(&self) -> Iter<'_, T>

Returns an in-order iterator over shared references of the values in this sub-tree.

Iterator creation is O(1).

pub fn iter_node(&self) -> IterNode<'_, T>

Returns an in-order iterator over shared references of the nodes in this sub-tree.

Iterator creation is O(1).

Trait Implementations

impl<T: Debug> Debug for Node<T>

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter.

impl<T> Deref for Node<T>

type Target = T

The resulting type after dereferencing.

fn deref(&self) -> &Self::Target

Dereferences the value.

impl<T: Display> Display for Node<T>

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter.

impl<T: Eq> Eq for Node<T>

impl<'a, T> IntoIterator for &'a Node<T>

type Item = &'a T

The type of the elements being iterated over.

type IntoIter = Iter<'a, T>

Which kind of iterator are we turning this into?

fn into_iter(self) -> Self::IntoIter

Creates an iterator from a value.

impl<T: Ord> Ord for Node<T>

fn cmp(&self, other: &Self) -> Ordering

This method returns an Ordering between self and other.

fn max(self, other: Self) -> Self

where Self: Sized,

Compares and returns the maximum of two values.

fn min(self, other: Self) -> Self

where Self: Sized,

Compares and returns the minimum of two values.

fn clamp(self, min: Self, max: Self) -> Self

where Self: Sized,

Restrict a value to a certain interval.

impl<T: PartialEq> PartialEq for Node<T>

fn eq(&self, other: &Self) -> bool

Equality operator ==.

fn ne(&self, other: &Rhs) -> bool

Inequality operator !=.

impl<T: Ord> PartialOrd for Node<T>

fn partial_cmp(&self, other: &Self) -> Option<Ordering>

This method returns an ordering between self and other values if one exists.

fn lt(&self, other: &Rhs) -> bool

Tests less than (for self and other) and is used by the < operator.

fn le(&self, other: &Rhs) -> bool

Tests less than or equal to (for self and other) and is used by the <= operator.

fn gt(&self, other: &Rhs) -> bool

Tests greater than (for self and other) and is used by the > operator.

fn ge(&self, other: &Rhs) -> bool

Tests greater than or equal to (for self and other) and is used by the >= operator.