Struct ordermap::OrderMap

pub struct OrderMap<K, V, S = RandomState> {
    pub(crate) mask: usize,
    pub(crate) indices: Box<[Pos]>,
    pub(crate) entries: Vec<Bucket<K, V>>,
    pub(crate) hash_builder: S,
}

A hash table where the iteration order of the key-value pairs is independent of the hash values of the keys.

The interface is closely compatible with the standard HashMap, but also has additional features.

Order

The key-value pairs have a consistent order that is determined by the sequence of insertion and removal calls on the map. The order does not depend on the keys or the hash function at all.

All iterators traverse the map in the order.

Indices

The key-value pairs are indexed in a compact range without holes in the range 0..self.len(). For example, the method .get_full looks up the index for a key, and the method .get_index looks up the key-value pair by index.

Examples

use ordermap::OrderMap;

// count the frequency of each letter in a sentence.
let mut letters = OrderMap::new();
for ch in "a short treatise on fungi".chars() {
    *letters.entry(ch).or_insert(0) += 1;
}
 
assert_eq!(letters[&'s'], 2);
assert_eq!(letters[&'t'], 3);
assert_eq!(letters[&'u'], 1);
assert_eq!(letters.get(&'y'), None);

Fields

mask: usize

indices: Box<[Pos]>

indices are the buckets. indices.len() == raw capacity

entries: Vec<Bucket<K, V>>

entries is a dense vec of entries in their order. entries.len() == len

hash_builder: S

Implementations

impl<K, V> OrderMap<K, V>

pub fn new() -> Self

Create a new map. (Does not allocate.)

pub fn with_capacity(n: usize) -> Self

Create a new map with capacity for n key-value pairs. (Does not allocate if n is zero.)

Computes in O(n) time.

impl<K, V, S> OrderMap<K, V, S>

pub fn with_capacity_and_hasher(n: usize, hash_builder: S) -> Selfwhere S: BuildHasher,

Create a new map with capacity for n key-value pairs. (Does not allocate if n is zero.)

Computes in O(n) time.

pub fn len(&self) -> usize

Return the number of key-value pairs in the map.

Computes in O(1) time.

pub fn is_empty(&self) -> bool

Returns true if the map contains no elements.

Computes in O(1) time.

pub fn with_hasher(hash_builder: S) -> Selfwhere S: BuildHasher,

Create a new map with hash_builder

pub fn hasher(&self) -> &Swhere S: BuildHasher,

Return a reference to the map’s BuildHasher.

pub(crate) fn size_class_is_64bit(&self) -> bool

pub(crate) fn raw_capacity(&self) -> usize

pub fn capacity(&self) -> usize

Computes in O(1) time.

impl<K, V, S> OrderMap<K, V, S>where K: Hash + Eq, S: BuildHasher,

pub(crate) fn entry_phase_1<Sz>(&mut self, key: K) -> Entry<'_, K, V, S>where Sz: Size,

pub fn clear(&mut self)

Remove all key-value pairs in the map, while preserving its capacity.

Computes in O(n) time.

pub(crate) fn clear_indices(&mut self)

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

Reserve capacity for additional more key-value pairs.

FIXME Not implemented fully yet.

pub(crate) fn insert_phase_1<Sz>(&mut self, key: K, value: V) -> Inserted<V>where Sz: Size,

pub(crate) fn first_allocation(&mut self)

pub(crate) fn double_capacity<Sz>(&mut self)where Sz: Size,

pub(crate) fn reinsert_entry_in_order<SzNew, SzOld>(&mut self, pos: Pos)where SzNew: Size, SzOld: Size,

pub(crate) fn reserve_one(&mut self)

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

Insert a key-value pair in the map.

If an equivalent key already exists in the map: the key remains and retains in its place in the order, its corresponding value is updated with value and the older value is returned inside Some(_).

If no equivalent key existed in the map: the new key-value pair is inserted, last in order, and None is returned.

Computes in O(1) time (amortized average).

See also entry if you you want to insert or modify or if you need to get the index of the corresponding key-value pair.

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

Get the given key’s corresponding entry in the map for insertion and/or in-place manipulation.

Computes in O(1) time (amortized average).

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

Return an iterator over the key-value pairs of the map, in their order

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

Return an iterator over the key-value pairs of the map, in their order

pub fn keys(&self) -> Keys<'_, K, V>

Return an iterator over the keys of the map, in their order

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

Return an iterator over the values of the map, in their order

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

Return an iterator over mutable references to the the values of the map, in their order

pub fn contains_key<Q>(&self, key: &Q) -> boolwhere Q: Hash + Equivalent<K> + ?Sized,

Return true if and equivalent to key exists in the map.

Computes in O(1) time (average).

pub fn get<Q>(&self, key: &Q) -> Option<&V>where Q: Hash + Equivalent<K> + ?Sized,

Return a reference to the value stored for key, if it is present, else None.

Computes in O(1) time (average).

pub fn get_full<Q>(&self, key: &Q) -> Option<(usize, &K, &V)>where Q: Hash + Equivalent<K> + ?Sized,

Return item index, key and value

pub fn get_mut<Q>(&mut self, key: &Q) -> Option<&mut V>where Q: Hash + Equivalent<K> + ?Sized,

pub fn get_full_mut<Q>(&mut self, key: &Q) -> Option<(usize, &K, &mut V)>where Q: Hash + Equivalent<K> + ?Sized,

pub(crate) fn find<Q>(&self, key: &Q) -> Option<(usize, usize)>where Q: Hash + Equivalent<K> + ?Sized,

Return probe (indices) and position (entries)

pub fn remove<Q>(&mut self, key: &Q) -> Option<V>where Q: Hash + Equivalent<K> + ?Sized,

NOTE: Same as .swap_remove

Computes in O(1) time (average).

pub fn swap_remove<Q>(&mut self, key: &Q) -> Option<V>where Q: Hash + Equivalent<K> + ?Sized,

Remove the key-value pair equivalent to key and return its value.

Like Vec::swap_remove, the pair is removed by swapping it with the last element of the map and popping it off. This perturbs the postion of what used to be the last element!

Return None if key is not in map.

Computes in O(1) time (average).

pub fn swap_remove_full<Q>(&mut self, key: &Q) -> Option<(usize, K, V)>where Q: Hash + Equivalent<K> + ?Sized,

Remove the key-value pair equivalent to key and return it and the index it had.

Like Vec::swap_remove, the pair is removed by swapping it with the last element of the map and popping it off. This perturbs the postion of what used to be the last element!

Return None if key is not in map.

pub fn pop(&mut self) -> Option<(K, V)>

Remove the last key-value pair

Computes in O(1) time (average).

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

Scan through each key-value pair in the map and keep those where the closure keep returns true.

The elements are visited in order, and remaining elements keep their order.

Computes in O(n) time (average).

pub(crate) fn retain_mut<F>(&mut self, keep: F)where F: FnMut(&mut K, &mut V) -> bool,

pub(crate) fn retain_in_order_impl<Sz, F>(&mut self, keep: F)where F: FnMut(&mut K, &mut V) -> bool, Sz: Size,

pub fn sort_keys(&mut self)where K: Ord,

Sort the map’s key-value pairs by the default ordering of the keys.

See sort_by for details.

pub fn sort_by<F>(&mut self, compare: F)where F: FnMut(&K, &V, &K, &V) -> Ordering,

Sort the map’s key-value pairs in place using the comparison function compare.

The comparison function receives two key and value pairs to compare (you can sort by keys or values or their combination as needed).

Computes in O(n log n + c) time and O(n) space where n is the length of the map and c the capacity. The sort is stable.

pub(crate) fn apply_new_index<Sz>(&mut self, new_index: &[usize])where Sz: Size,

pub fn sorted_by<F>(self, cmp: F) -> IntoIter<K, V> where F: FnMut(&K, &V, &K, &V) -> Ordering,

Sort the key-value pairs of the map and return a by value iterator of the key-value pairs with the result.

The sort is stable.

pub fn drain(&mut self, range: RangeFull) -> Drain<'_, K, V>

Clears the OrderMap, returning all key-value pairs as a drain iterator. Keeps the allocated memory for reuse.

impl<K, V, S> OrderMap<K, V, S>

pub fn get_index(&self, index: usize) -> Option<(&K, &V)>

Get a key-value pair by index

Valid indices are 0 <= index < self.len()

Computes in O(1) time.

pub fn get_index_mut(&mut self, index: usize) -> Option<(&mut K, &mut V)>

Get a key-value pair by index

Valid indices are 0 <= index < self.len()

Computes in O(1) time.

pub fn swap_remove_index(&mut self, index: usize) -> Option<(K, V)>

Remove the key-value pair by index

Valid indices are 0 <= index < self.len()

Computes in O(1) time (average).

impl<K, V, S> OrderMap<K, V, S>

pub(crate) fn pop_impl(&mut self) -> Option<(K, V)>

pub(crate) fn insert_phase_2<Sz>(&mut self, probe: usize, old_pos: Pos)where Sz: Size,

phase 2 is post-insert where we forward-shift Pos in the indices.

pub(crate) fn find_using<F>( &self, hash: HashValue, key_eq: F ) -> Option<(usize, usize)>where F: Fn(&Bucket<K, V>) -> bool,

Return probe (indices) and position (entries)

pub(crate) fn find_using_impl<Sz, F>( &self, hash: HashValue, key_eq: F ) -> Option<(usize, usize)>where F: Fn(&Bucket<K, V>) -> bool, Sz: Size,

pub(crate) fn find_existing_entry(&self, entry: &Bucket<K, V>) -> (usize, usize)

Find entry which is already placed inside self.entries; return its probe and entry index.

pub(crate) fn find_existing_entry_impl<Sz>( &self, entry: &Bucket<K, V> ) -> (usize, usize)where Sz: Size,

pub(crate) fn remove_found(&mut self, probe: usize, found: usize) -> (K, V)

pub(crate) fn remove_found_impl<Sz>( &mut self, probe: usize, found: usize ) -> (K, V)where Sz: Size,

pub(crate) fn backward_shift_after_removal<Sz>( &mut self, probe_at_remove: usize )where Sz: Size,

Trait Implementations

impl<K: Clone, V: Clone, S: Clone> Clone for OrderMap<K, V, S>

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

Returns a copy of the value.

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

Performs copy-assignment from source.

impl<K, V, S> Debug for OrderMap<K, V, S>where K: Debug + Hash + Eq, V: Debug, S: BuildHasher,

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

Formats the value using the given formatter.

impl<K, V, S> Default for OrderMap<K, V, S>where S: BuildHasher + Default,

fn default() -> Self

Return an empty OrderMap

impl<'a, K, V, S> Extend<(&'a K, &'a V)> for OrderMap<K, V, S>where K: Hash + Eq + Copy, V: Copy, S: BuildHasher,

fn extend<I: IntoIterator<Item = (&'a K, &'a V)>>(&mut self, iterable: I)

Extend the map with all key-value pairs in the iterable.

See the first extend method for more details.

fn extend_one(&mut self, item: A)

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

Extends a collection with exactly one element.

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<K, V, S> Extend<(K, V)> for OrderMap<K, V, S>where K: Hash + Eq, S: BuildHasher,

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

Extend the map with all key-value pairs in the iterable.

This is equivalent to calling insert for each of them in order, which means that for keys that already existed in the map, their value is updated but it keeps the existing order.

New keys are inserted inserted in the order in the sequence. If equivalents of a key occur more than once, the last corresponding value prevails.

fn extend_one(&mut self, item: A)

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

Extends a collection with exactly one element.

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<K, V, S> FromIterator<(K, V)> for OrderMap<K, V, S>where K: Hash + Eq, S: BuildHasher + Default,

fn from_iter<I: IntoIterator<Item = (K, V)>>(iterable: I) -> Self

Create an OrderMap from the sequence of key-value pairs in the iterable.

from_iter uses the same logic as extend. See extend for more details.

impl<'a, K, V, Q, S> Index<&'a Q> for OrderMap<K, V, S>where Q: Hash + Equivalent<K> + ?Sized, K: Hash + Eq, S: BuildHasher,

fn index(&self, key: &'a Q) -> &V

Panics if key is not present in the map.

type Output = V

The returned type after indexing.

impl<'a, K, V, Q, S> IndexMut<&'a Q> for OrderMap<K, V, S>where Q: Hash + Equivalent<K> + ?Sized, K: Hash + Eq, S: BuildHasher,

Mutable indexing allows changing / updating values of key-value pairs that are already present.

You can not insert new pairs with index syntax, use .insert().

fn index_mut(&mut self, key: &'a Q) -> &mut V

Panics if key is not present in the map.

impl<'a, K, V, S> IntoIterator for &'a OrderMap<K, V, S>where K: Hash + Eq, S: BuildHasher,

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<'a, K, V, S> IntoIterator for &'a mut OrderMap<K, V, S>where K: Hash + Eq, S: BuildHasher,

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

The type of the elements being iterated over.

type IntoIter = IterMut<'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, S> IntoIterator for OrderMap<K, V, S>where K: Hash + Eq, S: BuildHasher,

type Item = (K, V)

The type of the elements being iterated over.

type IntoIter = IntoIter<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, S> MutableKeys for OrderMap<K, V, S>where K: Eq + Hash, S: BuildHasher,

Opt-in mutable access to keys.

See MutableKeys for more information.

type Key = K

type Value = V

fn get_full_mut2<Q>(&mut self, key: &Q) -> Option<(usize, &mut K, &mut V)>where Q: Hash + Equivalent<K> + ?Sized,

Return item index, mutable reference to key and value

fn retain2<F>(&mut self, keep: F)where F: FnMut(&mut K, &mut V) -> bool,

Scan through each key-value pair in the map and keep those where the closure keep returns true.

fn __private_marker(&self) -> PrivateMarker

This method is not useful in itself – it is there to “seal” the trait for external implementation, so that we can add methods without causing breaking changes.

impl<K, V1, S1, V2, S2> PartialEq<OrderMap<K, V2, S2>> for OrderMap<K, V1, S1>where K: Hash + Eq, V1: PartialEq<V2>, S1: BuildHasher, S2: BuildHasher,

fn eq(&self, other: &OrderMap<K, V2, S2>) -> bool

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

fn ne(&self, other: &Rhs) -> bool

This method tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.

impl<K, V, S> Eq for OrderMap<K, V, S>where K: Eq + Hash, V: Eq, S: BuildHasher,