Struct Item 

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

Implementations

impl<K, V> Item<K, V>

pub fn new(key: K, value: V) -> Item<K, V>

pub fn key(&self) -> &K

pub fn key_mut(&mut self) -> &mut K

Modifying a key in such a way that its order with regard to other keys changes is a logical error.

pub fn value(&self) -> &V

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

pub fn set(&mut self, key: K, value: V) -> (K, V)

Modifying a key in such a way that its order with regard to other keys changes is a logical error.

pub fn set_key(&mut self, key: K) -> K

Modifying a key in such a way that its order with regard to other keys changes is a logical error.

pub fn set_value(&mut self, value: V) -> V

pub fn maybe_uninit_value_mut(&mut self) -> &mut MaybeUninit<V>

pub fn into_key(self) -> K

pub fn into_value(self) -> V

pub fn as_pair(&self) -> (&K, &V)

pub fn as_pair_mut(&mut self) -> (&mut K, &mut V)

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

pub unsafe fn forget_value(self)

Drop the key but not the value which is assumed uninitialized.

Safety

The value must be uninitialized.

pub fn into_inner(self) -> (MaybeUninit<K>, MaybeUninit<V>)

Trait Implementations

impl<K, V> AsRef<Item<K, V>> for Branch<K, V>

fn as_ref(&self) -> &Item<K, V>

Converts this type into a shared reference of the (usually inferred) input type.

impl<K, V> AsRef<Item<K, V>> for Item<K, V>

fn as_ref(&self) -> &Self

Converts this type into a shared reference of the (usually inferred) input type.

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

fn clone(&self) -> Self

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl<K, V> Drop for Item<K, V>

fn drop(&mut self)

Executes the destructor for this type.

impl<K, V> Keyed for Item<K, V>

type Key = K

fn key(&self) -> &K

impl<K: PartialEq, V> PartialEq for Item<K, V>

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

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

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: Ord + PartialEq, V> PartialOrd for Item<K, V>

fn partial_cmp(&self, other: &Item<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.