Enum AutoMap

pub enum AutoMap<K, V, H = BuildHasherDefault<FxHasher>, const I: usize = 0> {
    List(SmallVec<[(K, V); I]>),
    Map(Box<HashMap<K, V, H>>),
}

Variants

List(SmallVec<[(K, V); I]>)

Map(Box<HashMap<K, V, H>>)

Implementations

impl<K, V> AutoMap<K, V, BuildHasherDefault<FxHasher>, 0>

pub const fn new() -> Self

see HashMap::new

pub fn with_capacity(capacity: usize) -> Self

see HashMap::with_capacity

impl<K, V, H: BuildHasher, const I: usize> AutoMap<K, V, H, I>

pub const fn with_hasher() -> Self

see HashMap::with_hasher

pub fn with_capacity_and_hasher(capacity: usize, hasher: H) -> Self

see HashMap::with_capacity_and_hasher

pub fn clear(&mut self)

see HashMap::clear

impl<K: Eq + Hash, V, H: BuildHasher + Default, const I: usize> AutoMap<K, V, H, I>

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

see HashMap::insert

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

see HashMap::remove

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

see HashMap::extend

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

see HashMap::entry

pub fn raw_entry_mut<Q>(&mut self, key: &Q) -> RawEntry<'_, K, V, H, I>

where K: Borrow<Q>, Q: Hash + Eq + ?Sized,

pub fn retain<F>(&mut self, f: F)

where F: FnMut(&K, &mut V) -> bool,

see HashMap::retain

pub fn extract_if<'l, F>(&'l mut self, f: F) -> ExtractIfIter<'l, K, V, I, F>

where F: for<'a, 'b> FnMut(&'a K, &'b mut V) -> bool,

pub fn shrink_to_fit(&mut self)

see HashMap::shrink_to_fit

pub fn shrink_amortized(&mut self)

impl<K: Eq + Hash, V, H: BuildHasher, const I: usize> AutoMap<K, V, H, I>

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

where K: Borrow<Q>, Q: Hash + Eq + ?Sized,

see HashMap::get

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

see HashMap::get_mut

pub fn contains_key(&self, key: &K) -> bool

see HashMap::contains_key

impl<K, V, H, const I: usize> AutoMap<K, V, H, I>

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

see HashMap::iter

pub fn iter_mut(&mut self) -> IterMut<'_, K, V>

see HashMap::iter_mut

pub fn is_empty(&self) -> bool

see HashMap::is_empty

pub fn len(&self) -> usize

see HashMap::len

pub fn values_mut(&mut self) -> ValuesMut<'_, K, V>

see HashMap::values_mut

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

see HashMap::values

pub fn into_values(self) -> IntoValues<K, V, I>

see HashMap::into_values

Trait Implementations

impl<K: Clone, V: Clone, H: Clone, const I: usize> Clone for AutoMap<K, V, H, I>

fn clone(&self) -> AutoMap<K, V, H, I>

Returns a copy of the value.

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

Performs copy-assignment from source.

impl<K: Debug, V: Debug, H, const I: usize> Debug for AutoMap<K, V, H, I>

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

Formats the value using the given formatter.

impl<K, V, H, const I: usize> Default for AutoMap<K, V, H, I>

fn default() -> Self

Returns the “default value” for a type.

impl<'de, K, V, H, const I: usize> Deserialize<'de> for AutoMap<K, V, H, I>

where K: Eq + Hash + Deserialize<'de>, V: Deserialize<'de>, H: BuildHasher + Default,

fn deserialize<D>(deserializer: D) -> Result<Self, D::Error>

where D: Deserializer<'de>,

Deserialize this value from the given Serde deserializer.

impl<K, V, H, const I: usize> FromIterator<(K, V)> for AutoMap<K, V, H, I>

where K: Eq + Hash, H: BuildHasher + Default,

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

Creates a value from an iterator.

impl<'a, K, V, H, const I: usize> IntoIterator for &'a AutoMap<K, V, H, I>

type Item = (&'a K, &'a V)

The type of the elements being iterated over.

type IntoIter = Iter<'a, K, V>

Which kind of iterator are we turning this into?

fn into_iter(self) -> Self::IntoIter

Creates an iterator from a value.

impl<K, V, H, const I: usize> IntoIterator for AutoMap<K, V, H, I>

type Item = (K, V)

The type of the elements being iterated over.

type IntoIter = IntoIter<K, V, I>

Which kind of iterator are we turning this into?

fn into_iter(self) -> Self::IntoIter

Creates an iterator from a value.

impl<K: Eq + Hash, V: Eq, H: BuildHasher, const I: usize> PartialEq for AutoMap<K, V, H, I>

fn eq(&self, other: &Self) -> 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, V, H, const I: usize> Serialize for AutoMap<K, V, H, I>

where K: Eq + Hash + Serialize, V: Serialize, H: BuildHasher,

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, H, const I: usize> ShrinkToFit for AutoMap<K, V, H, I>

where K: Eq + Hash, V: Eq, H: BuildHasher + Default,

fn shrink_to_fit(&mut self)

impl<K, V, H: BuildHasher, const I: usize> Eq for AutoMap<K, V, H, I>

where K: Eq + Hash, V: Eq,