Struct VecMap

pub struct VecMap<const FIXED: bool, K, V, F> {
    pub data: Vec<Option<(K, V)>>,
    /* private fields */
}

Fields

data: Vec<Option<(K, V)>>

Trait Implementations

impl<const FIXED: bool, K: Clone, V: Clone, F: Clone> Clone for VecMap<FIXED, K, V, F>

fn clone(&self) -> VecMap<FIXED, K, V, F>

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl<const FIXED: bool, K, V, F> Container for VecMap<FIXED, K, V, F>

where F: Fn(&K) -> usize,

type Key = K

type Value = V

type Entry<'a> = Entry<'a, K, V> where Self: 'a, Self::Key: 'a, Self::Value: 'a

type Iter<'a> = Map<FilterMap<Iter<'a, Option<(K, V)>>, fn(&Option<(K, V)>) -> Option<&(K, V)>>, fn(&(K, V)) -> (&K, &V)> where Self: 'a, Self::Key: 'a, Self::Value: 'a

type Drain<'a> = FilterMap<IterMut<'a, Option<(K, V)>>, fn(&mut Option<(K, V)>) -> Option<(K, V)>> where Self: 'a, Self::Key: 'a, Self::Value: 'a

fn get(&self, key: &Self::Key) -> Option<&Self::Value>

fn get_mut(&mut self, key: &Self::Key) -> Option<&mut Self::Value>

fn insert(&mut self, key: Self::Key, value: Self::Value) -> Option<Self::Value>

fn remove(&mut self, key: &Self::Key) -> Option<Self::Value>

fn entry(&mut self, key: Self::Key) -> Self::Entry<'_>

fn iter(&self) -> Self::Iter<'_>

fn drain(&mut self) -> Self::Drain<'_>

impl<const FIXED: bool, K, V, F> Debug for VecMap<FIXED, K, V, F>

where K: Debug, V: Debug,

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

Formats the value using the given formatter.

impl<const FIXED: bool, K: Hash, V: Hash, F: Hash> Hash for VecMap<FIXED, K, V, F>

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<const FIXED: bool, K: Ord, V: Ord, F: Ord> Ord for VecMap<FIXED, K, V, F>

fn cmp(&self, other: &VecMap<FIXED, K, V, F>) -> 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<const FIXED: bool, K: PartialEq, V: PartialEq, F: PartialEq> PartialEq for VecMap<FIXED, K, V, F>

fn eq(&self, other: &VecMap<FIXED, K, V, F>) -> 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<const FIXED: bool, K: PartialOrd, V: PartialOrd, F: PartialOrd> PartialOrd for VecMap<FIXED, K, V, F>

fn partial_cmp(&self, other: &VecMap<FIXED, K, V, F>) -> 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<const FIXED: bool, K: Eq, V: Eq, F: Eq> Eq for VecMap<FIXED, K, V, F>

impl<const FIXED: bool, K, V, F> StructuralPartialEq for VecMap<FIXED, K, V, F>