Struct small_sorted_map::SmallSortedMap

pub struct SmallSortedMap<K, V, const SIZE: usize> where
    K: Ord,  { /* fields omitted */ }

Implementations

impl<K, V, const SIZE: usize> SmallSortedMap<K, V, SIZE> where
    K: Ord, 

pub fn new() -> Self

pub fn len(&self) -> usize

pub fn is_empty(&self) -> bool

pub fn get(&self, key: &K) -> Option<&V>

pub fn get_mut(&mut self, key: &K) -> Option<&mut V>

pub fn insert(&mut self, key: K, value: V) -> Option<V>

pub fn remove(&mut self, key: &K) -> Option<V>

pub fn clear(&mut self)

pub fn entry(&mut self, key: K) -> Entry<'_, K, V, SIZE>

pub fn as_slice(&self) -> &[(K, V)]

pub fn as_mut_slice(&mut self) -> &mut [(K, V)]

pub fn values(&self) -> ValuesIter<'_, K, V>

pub fn retain<F>(&mut self, f: F) where
    F: FnMut(&K, &mut V) -> bool, 

pub fn drain<R>(&mut self, range: R) -> Drain<'_, [(K, V); SIZE]> where
    R: RangeBounds<usize>, 

Trait Implementations

impl<K, V, const SIZE: usize> AsMut<[(K, V)]> for SmallSortedMap<K, V, SIZE> where
    K: Ord, 

fn as_mut(&mut self) -> &mut [(K, V)]

Performs the conversion.

impl<K, V, const SIZE: usize> AsRef<[(K, V)]> for SmallSortedMap<K, V, SIZE> where
    K: Ord, 

fn as_ref(&self) -> &[(K, V)]

Performs the conversion.

impl<K: Clone, V: Clone, const SIZE: usize> Clone for SmallSortedMap<K, V, SIZE> where
    K: Ord, 

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

Returns a copy of the value.

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

Performs copy-assignment from source.

impl<K: Debug, V: Debug, const SIZE: usize> Debug for SmallSortedMap<K, V, SIZE> where
    K: Ord, 

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

Formats the value using the given formatter.

impl<K, V, const SIZE: usize> Default for SmallSortedMap<K, V, SIZE> where
    K: Ord, 

fn default() -> Self

Returns the “default value” for a type.

impl<'de, K, V, const SIZE: usize> Deserialize<'de> for SmallSortedMap<K, V, SIZE> where
    K: Ord + Deserialize<'de>,
    V: Deserialize<'de>, 

fn deserialize<D>(deserializer: D) -> Result<Self, D::Error> where
    D: Deserializer<'de>, 

Deserialize this value from the given Serde deserializer.

impl<K: Eq, V: Eq, const SIZE: usize> Eq for SmallSortedMap<K, V, SIZE> where
    K: Ord, 

impl<K, V, const SIZE: usize> Extend<(K, V)> for SmallSortedMap<K, V, SIZE> where
    K: Ord, 

fn extend<T: IntoIterator<Item = (K, V)>>(&mut self, iter: T)

Extends a collection with the contents of an iterator.

pub fn extend_one(&mut self, item: A)

🔬 This is a nightly-only experimental API. (extend_one)

Extends a collection with exactly one element.

pub fn extend_reserve(&mut self, additional: usize)

🔬 This is a nightly-only experimental API. (extend_one)

Reserves capacity in a collection for the given number of additional elements.

impl<S, K, V, const SIZE: usize> From<HashMap<K, V, S>> for SmallSortedMap<K, V, SIZE> where
    K: Ord, 

fn from(map: HashMap<K, V, S>) -> Self

Performs the conversion.

impl<K, V, const SIZE: usize> FromIterator<(K, V)> for SmallSortedMap<K, V, SIZE> where
    K: Ord, 

fn from_iter<T: IntoIterator<Item = (K, V)>>(iter: T) -> Self

Creates a value from an iterator.

impl<K: Hash, V: Hash, const SIZE: usize> Hash for SmallSortedMap<K, V, SIZE> where
    K: Ord, 

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

Feeds this value into the given Hasher.

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

Feeds a slice of this type into the given Hasher.

impl<K, V, const SIZE: usize> Index<&'_ K> for SmallSortedMap<K, V, SIZE> where
    K: Ord, 

type Output = V

The returned type after indexing.

fn index(&self, index: &K) -> &Self::Output

Performs the indexing (container[index]) operation.

impl<K, V, const SIZE: usize> Index<K> for SmallSortedMap<K, V, SIZE> where
    K: Ord, 

type Output = V

The returned type after indexing.

fn index(&self, index: K) -> &Self::Output

Performs the indexing (container[index]) operation.

impl<K, V, const SIZE: usize> IndexMut<&'_ K> for SmallSortedMap<K, V, SIZE> where
    K: Ord, 

fn index_mut(&mut self, index: &K) -> &mut Self::Output

Performs the mutable indexing (container[index]) operation.

impl<K, V, const SIZE: usize> IndexMut<K> for SmallSortedMap<K, V, SIZE> where
    K: Ord, 

fn index_mut(&mut self, index: K) -> &mut Self::Output

Performs the mutable indexing (container[index]) operation.

impl<K, V, const SIZE: usize> IntoIterator for SmallSortedMap<K, V, SIZE> where
    K: Ord, 

type Item = (K, V)

The type of the elements being iterated over.

type IntoIter = IntoIter<[(K, V); SIZE]>

Which kind of iterator are we turning this into?

fn into_iter(self) -> Self::IntoIter

Creates an iterator from a value.

impl<K: PartialEq, V: PartialEq, const SIZE: usize> PartialEq<SmallSortedMap<K, V, SIZE>> for SmallSortedMap<K, V, SIZE> where
    K: Ord, 

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

This method tests for self and other values to be equal, and is used by ==.

fn ne(&self, other: &SmallSortedMap<K, V, SIZE>) -> bool

This method tests for !=.

impl<K, V, const SIZE: usize> Serialize for SmallSortedMap<K, V, SIZE> where
    K: Ord + Serialize,
    V: Serialize, 

fn serialize<S>(&self, serializer: S) -> Result<S::Ok, S::Error> where
    S: Serializer, 

Serialize this value into the given Serde serializer.

impl<K, V, const SIZE: usize> StructuralEq for SmallSortedMap<K, V, SIZE> where
    K: Ord, 

impl<K, V, const SIZE: usize> StructuralPartialEq for SmallSortedMap<K, V, SIZE> where
    K: Ord,