Struct ordermap::map::OrderMap

source ·
pub struct OrderMap<K, V, S = RandomState> { /* private fields */ }
👎Deprecated: the crate ordermap has been renamed with no change in functionality to indexmap; please update your dependencies
Expand description

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.

The insertion order is preserved, with notable exceptions like the .remove() or .swap_remove() methods. Methods such as .sort_by() of course result in a new order, depending on the sorting 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);

Implementations

Create a new map. (Does not allocate.)

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

Computes in O(n) time.

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

Computes in O(n) time.

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

Computes in O(1) time.

Returns true if the map contains no elements.

Computes in O(1) time.

Create a new map with hash_builder

Return a reference to the map’s BuildHasher.

Computes in O(1) time.

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

Computes in O(n) time.

Reserve capacity for additional more key-value pairs.

FIXME Not implemented fully yet.

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.

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

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

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

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

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

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

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

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

Computes in O(1) time (average).

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

Computes in O(1) time (average).

Return item index, key and value

NOTE: Same as .swap_remove

Computes in O(1) time (average).

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).

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.

Remove the last key-value pair

Computes in O(1) time (average).

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).

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

See sort_by for details.

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.

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.

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

Get a key-value pair by index

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

Computes in O(1) time.

Get a key-value pair by index

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

Computes in O(1) time.

Remove the key-value pair by index

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

Computes in O(1) time (average).

Trait Implementations

Returns a copy of the value. Read more
Performs copy-assignment from source. Read more
Formats the value using the given formatter. Read more

Return an empty OrderMap

Requires crate feature "serde-1"

Deserialize this value from the given Serde deserializer. Read more

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

See the first extend method for more details.

🔬This is a nightly-only experimental API. (extend_one)
Extends a collection with exactly one element.
🔬This is a nightly-only experimental API. (extend_one)
Reserves capacity in a collection for the given number of additional elements. Read more

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.

🔬This is a nightly-only experimental API. (extend_one)
Extends a collection with exactly one element.
🔬This is a nightly-only experimental API. (extend_one)
Reserves capacity in a collection for the given number of additional elements. Read more

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.

Panics if key is not present in the map.

The returned type after indexing.

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().

Panics if key is not present in the map.

The type of the elements being iterated over.
Which kind of iterator are we turning this into?
Creates an iterator from a value. Read more
The type of the elements being iterated over.
Which kind of iterator are we turning this into?
Creates an iterator from a value. Read more
The type of the elements being iterated over.
Which kind of iterator are we turning this into?
Creates an iterator from a value. Read more

Opt-in mutable access to keys.

See MutableKeys for more information.

Return item index, mutable reference to key and value
Scan through each key-value pair in the map and keep those where the closure keep returns true. Read more
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. Read more
This method tests for self and other values to be equal, and is used by ==. Read more
This method tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason. Read more

Requires crate feature "serde-1"

Serialize this value into the given Serde serializer. Read more

Auto Trait Implementations

Blanket Implementations

Gets the TypeId of self. Read more
Immutably borrows from an owned value. Read more
Mutably borrows from an owned value. Read more

Returns the argument unchanged.

Calls U::from(self).

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

The resulting type after obtaining ownership.
Creates owned data from borrowed data, usually by cloning. Read more
Uses borrowed data to replace owned data, usually by cloning. Read more
The type returned in the event of a conversion error.
Performs the conversion.
The type returned in the event of a conversion error.
Performs the conversion.