Skip to main content

InsertionOrderedMap

Struct InsertionOrderedMap 

Source
pub struct InsertionOrderedMap<K, V>
where K: Eq + Hash + Clone,
{ /* private fields */ }

Implementations§

Source§

impl<K, V> InsertionOrderedMap<K, V>
where K: Eq + Hash + Clone,

Source

pub fn new() -> Self

Source

pub fn insert(&mut self, k: K, v: V)

Source

pub fn clear(&mut self)

Source

pub fn size(&self) -> usize

Source

pub fn is_empty(&self) -> bool

Source

pub fn contains(&self, k: &K) -> bool

Source

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

Source

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

Source

pub fn get_or_default(&mut self, k: K) -> &mut V
where V: Default,

C++ operator[]: returns the value for k, default-inserting it at the back if absent.

Source

pub fn find(&self, k: &K) -> Option<usize>

C++ find: position of k in insertion order, or None (end()).

Source

pub fn erase(&mut self, k: &K)

C++ erase(find(k)): removes the pair and shifts every later index down by one. Absent keys are a no-op (erasing end()).

Source

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

Source

pub fn iter_mut(&mut self) -> impl Iterator<Item = (&K, &mut V)>

Values are mutable through iteration; keys are not (mutating a key would desynchronize indices — C++ merely trusts you not to).

Trait Implementations§

Source§

impl<K, V: Clone> Clone for InsertionOrderedMap<K, V>
where K: Eq + Hash + Clone + Clone,

Source§

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

Returns a duplicate of the value. Read more
1.0.0 (const: unstable) · Source§

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

Performs copy-assignment from source. Read more
Source§

impl<K, V: Debug> Debug for InsertionOrderedMap<K, V>
where K: Eq + Hash + Clone + Debug,

Source§

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

Formats the value using the given formatter. Read more
Source§

impl<K, V> Default for InsertionOrderedMap<K, V>
where K: Eq + Hash + Clone,

Source§

fn default() -> Self

Returns the “default value” for a type. Read more
Source§

impl<'a, K, V> IntoIterator for &'a InsertionOrderedMap<K, V>
where K: Eq + Hash + Clone,

Source§

type Item = &'a (K, V)

The type of the elements being iterated over.
Source§

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

Which kind of iterator are we turning this into?
Source§

fn into_iter(self) -> Self::IntoIter

Creates an iterator from a value. Read more

Auto Trait Implementations§

§

impl<K, V> Freeze for InsertionOrderedMap<K, V>

§

impl<K, V> RefUnwindSafe for InsertionOrderedMap<K, V>

§

impl<K, V> Send for InsertionOrderedMap<K, V>
where K: Send, V: Send,

§

impl<K, V> Sync for InsertionOrderedMap<K, V>
where K: Sync, V: Sync,

§

impl<K, V> Unpin for InsertionOrderedMap<K, V>
where K: Unpin, V: Unpin,

§

impl<K, V> UnsafeUnpin for InsertionOrderedMap<K, V>

§

impl<K, V> UnwindSafe for InsertionOrderedMap<K, V>
where K: UnwindSafe, V: UnwindSafe,

Blanket Implementations§

Source§

impl<T> Any for T
where T: 'static + ?Sized,

Source§

fn type_id(&self) -> TypeId

Gets the TypeId of self. Read more
Source§

impl<T> Borrow<T> for T
where T: ?Sized,

Source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
Source§

impl<T> BorrowMut<T> for T
where T: ?Sized,

Source§

fn borrow_mut(&mut self) -> &mut T

Mutably borrows from an owned value. Read more
Source§

impl<T> CloneToUninit for T
where T: Clone,

Source§

unsafe fn clone_to_uninit(&self, dest: *mut u8)

🔬This is a nightly-only experimental API. (clone_to_uninit)
Performs copy-assignment from self to dest. Read more
Source§

impl<T> From<T> for T

Source§

fn from(t: T) -> T

Returns the argument unchanged.

Source§

impl<T, U> Into<U> for T
where U: From<T>,

Source§

fn into(self) -> U

Calls U::from(self).

That is, this conversion is whatever the implementation of From<T> for U chooses to do.

Source§

impl<T> ToOwned for T
where T: Clone,

Source§

type Owned = T

The resulting type after obtaining ownership.
Source§

fn to_owned(&self) -> T

Creates owned data from borrowed data, usually by cloning. Read more
Source§

fn clone_into(&self, target: &mut T)

Uses borrowed data to replace owned data, usually by cloning. Read more
Source§

impl<T, U> TryFrom<U> for T
where U: Into<T>,

Source§

type Error = Infallible

The type returned in the event of a conversion error.
Source§

fn try_from(value: U) -> Result<T, <T as TryFrom<U>>::Error>

Performs the conversion.
Source§

impl<T, U> TryInto<U> for T
where U: TryFrom<T>,

Source§

type Error = <U as TryFrom<T>>::Error

The type returned in the event of a conversion error.
Source§

fn try_into(self) -> Result<U, <U as TryFrom<T>>::Error>

Performs the conversion.