Struct ValueNode

pub struct ValueNode<K, V> { /* private fields */ }

A generic node for the KeyNodeList.

ValueNode can hold any kind of value.

Implementations

impl<K, V> ValueNode<K, V>

pub fn new(value: V) -> Self

Creates a new node with value.

pub fn into_value(self) -> V

Consumes this ValueNode, returning the underlying value.

pub fn value(&self) -> &V

Returns a reference to the node value.

pub fn value_mut(&mut self) -> &mut V

Returns a mutable reference to the node value.

Trait Implementations

impl<K: Clone, V: Clone> Clone for ValueNode<K, V>

fn clone(&self) -> ValueNode<K, V>

Returns a duplicate of the value.

const fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.

impl<K: Debug, V: Debug> Debug for ValueNode<K, V>

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

Formats the value using the given formatter.

impl<K, V> Default for ValueNode<K, V>

where V: Default,

fn default() -> Self

Returns the “default value” for a type.

impl<K, V> From<V> for ValueNode<K, V>

fn from(value: V) -> Self

Converts to this type from the input type.

impl<K: Hash, V: Hash> Hash for ValueNode<K, V>

fn hash<__H: Hasher>(&self, state: &mut __H)

Feeds this value into the given Hasher.

fn hash_slice<H>(data: &[Self], state: &mut H)

where H: Hasher, Self: Sized,

Feeds a slice of this type into the given Hasher.

impl<K, V> Node for ValueNode<K, V>

type Key = K

Key type of the current Node.

fn prev(&self) -> Option<&Self::Key>

Returns a reference to the previous key of the current node, or returns None if the current node is the first node in the list.

fn next(&self) -> Option<&Self::Key>

Returns a reference to the next key of the current node, or returns None if the current node is the last node in the list.

fn prev_mut<__: NodeToken>(&mut self) -> &mut Option<Self::Key>

Returns a mutable reference to the previous key of the current node so that KeyNodeList can update the order of the nodes.

fn next_mut<__: NodeToken>(&mut self) -> &mut Option<Self::Key>

Returns a mutable reference to the next key of the current node so that KeyNodeList can update the order of the nodes.

impl<K: Ord, V: Ord> Ord for ValueNode<K, V>

fn cmp(&self, other: &ValueNode<K, V>) -> 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<K: PartialEq, V: PartialEq> PartialEq for ValueNode<K, V>

fn eq(&self, other: &ValueNode<K, V>) -> bool

Tests for self and other values to be equal, and is used by ==.

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

Tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.

impl<K: PartialOrd, V: PartialOrd> PartialOrd for ValueNode<K, V>

fn partial_cmp(&self, other: &ValueNode<K, V>) -> 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.

impl<K: Copy, V: Copy> Copy for ValueNode<K, V>

impl<K: Eq, V: Eq> Eq for ValueNode<K, V>

impl<K, V> StructuralPartialEq for ValueNode<K, V>