Struct rustc_data_structures::sorted_map::SortedMap [−][src]
pub struct SortedMap<K: Ord, V> { /* fields omitted */ }
SortedMap
is a data structure with similar characteristics as BTreeMap but
slightly different trade-offs: lookup, inseration, and removal are O(log(N))
and elements can be iterated in order cheaply.
SortedMap
can be faster than a BTreeMap
for small sizes (<50) since it
stores data in a more compact way. It also supports accessing contiguous
ranges of elements as a slice, and slices of already sorted elements can be
inserted efficiently.
Methods
impl<K: Ord, V> SortedMap<K, V>
[src]
impl<K: Ord, V> SortedMap<K, V>
pub fn new() -> SortedMap<K, V>
[src]
pub fn new() -> SortedMap<K, V>
pub fn from_presorted_elements(elements: Vec<(K, V)>) -> SortedMap<K, V>
[src]
pub fn from_presorted_elements(elements: Vec<(K, V)>) -> SortedMap<K, V>
Construct a SortedMap
from a presorted set of elements. This is faster
than creating an empty map and then inserting the elements individually.
It is up to the caller to make sure that the elements are sorted by key and that there are no duplicates.
pub fn insert(&mut self, key: K, value: V) -> Option<V>
[src]
pub fn insert(&mut self, key: K, value: V) -> Option<V>
pub fn remove(&mut self, key: &K) -> Option<V>
[src]
pub fn remove(&mut self, key: &K) -> Option<V>
pub fn get(&self, key: &K) -> Option<&V>
[src]
pub fn get(&self, key: &K) -> Option<&V>
pub fn get_mut(&mut self, key: &K) -> Option<&mut V>
[src]
pub fn get_mut(&mut self, key: &K) -> Option<&mut V>
pub fn clear(&mut self)
[src]
pub fn clear(&mut self)
ⓘImportant traits for Iter<'a, T>pub fn iter(&self) -> Iter<(K, V)>
[src]
pub fn iter(&self) -> Iter<(K, V)>
Iterate over elements, sorted by key
pub fn keys(
&self
) -> impl Iterator<Item = &K> + ExactSizeIterator
[src]
pub fn keys(
&self
) -> impl Iterator<Item = &K> + ExactSizeIterator
Iterate over the keys, sorted
pub fn values(
&self
) -> impl Iterator<Item = &V> + ExactSizeIterator
[src]
pub fn values(
&self
) -> impl Iterator<Item = &V> + ExactSizeIterator
Iterate over values, sorted by key
pub fn len(&self) -> usize
[src]
pub fn len(&self) -> usize
pub fn range<R>(&self, range: R) -> &[(K, V)] where
R: RangeBounds<K>,
[src]
pub fn range<R>(&self, range: R) -> &[(K, V)] where
R: RangeBounds<K>,
pub fn remove_range<R>(&mut self, range: R) where
R: RangeBounds<K>,
[src]
pub fn remove_range<R>(&mut self, range: R) where
R: RangeBounds<K>,
pub fn offset_keys<F>(&mut self, f: F) where
F: Fn(&mut K),
[src]
pub fn offset_keys<F>(&mut self, f: F) where
F: Fn(&mut K),
Mutate all keys with the given function f
. This mutation must not
change the sort-order of keys.
pub fn insert_presorted(&mut self, elements: Vec<(K, V)>)
[src]
pub fn insert_presorted(&mut self, elements: Vec<(K, V)>)
Inserts a presorted range of elements into the map. If the range can be inserted as a whole in between to existing elements of the map, this will be faster than inserting the elements individually.
It is up to the caller to make sure that the elements are sorted by key and that there are no duplicates.
Trait Implementations
impl<K: Clone + Ord, V: Clone> Clone for SortedMap<K, V>
[src]
impl<K: Clone + Ord, V: Clone> Clone for SortedMap<K, V>
fn clone(&self) -> SortedMap<K, V>
[src]
fn clone(&self) -> SortedMap<K, V>
Returns a copy of the value. Read more
fn clone_from(&mut self, source: &Self)
1.0.0[src]
fn clone_from(&mut self, source: &Self)
Performs copy-assignment from source
. Read more
impl<K: PartialEq + Ord, V: PartialEq> PartialEq for SortedMap<K, V>
[src]
impl<K: PartialEq + Ord, V: PartialEq> PartialEq for SortedMap<K, V>
fn eq(&self, other: &SortedMap<K, V>) -> bool
[src]
fn eq(&self, other: &SortedMap<K, V>) -> bool
This method tests for self
and other
values to be equal, and is used by ==
. Read more
fn ne(&self, other: &SortedMap<K, V>) -> bool
[src]
fn ne(&self, other: &SortedMap<K, V>) -> bool
This method tests for !=
.
impl<K: Eq + Ord, V: Eq> Eq for SortedMap<K, V>
[src]
impl<K: Eq + Ord, V: Eq> Eq for SortedMap<K, V>
impl<K: PartialOrd + Ord, V: PartialOrd> PartialOrd for SortedMap<K, V>
[src]
impl<K: PartialOrd + Ord, V: PartialOrd> PartialOrd for SortedMap<K, V>
fn partial_cmp(&self, other: &SortedMap<K, V>) -> Option<Ordering>
[src]
fn partial_cmp(&self, other: &SortedMap<K, V>) -> Option<Ordering>
This method returns an ordering between self
and other
values if one exists. Read more
fn lt(&self, other: &SortedMap<K, V>) -> bool
[src]
fn lt(&self, other: &SortedMap<K, V>) -> bool
This method tests less than (for self
and other
) and is used by the <
operator. Read more
fn le(&self, other: &SortedMap<K, V>) -> bool
[src]
fn le(&self, other: &SortedMap<K, V>) -> bool
This method tests less than or equal to (for self
and other
) and is used by the <=
operator. Read more
fn gt(&self, other: &SortedMap<K, V>) -> bool
[src]
fn gt(&self, other: &SortedMap<K, V>) -> bool
This method tests greater than (for self
and other
) and is used by the >
operator. Read more
fn ge(&self, other: &SortedMap<K, V>) -> bool
[src]
fn ge(&self, other: &SortedMap<K, V>) -> bool
This method tests greater than or equal to (for self
and other
) and is used by the >=
operator. Read more
impl<K: Ord + Ord, V: Ord> Ord for SortedMap<K, V>
[src]
impl<K: Ord + Ord, V: Ord> Ord for SortedMap<K, V>
fn cmp(&self, other: &SortedMap<K, V>) -> Ordering
[src]
fn cmp(&self, other: &SortedMap<K, V>) -> Ordering
This method returns an Ordering
between self
and other
. Read more
fn max(self, other: Self) -> Self
1.21.0[src]
fn max(self, other: Self) -> Self
Compares and returns the maximum of two values. Read more
fn min(self, other: Self) -> Self
1.21.0[src]
fn min(self, other: Self) -> Self
Compares and returns the minimum of two values. Read more
impl<K: Hash + Ord, V: Hash> Hash for SortedMap<K, V>
[src]
impl<K: Hash + Ord, V: Hash> Hash for SortedMap<K, V>
fn hash<__HKV: Hasher>(&self, state: &mut __HKV)
[src]
fn hash<__HKV: Hasher>(&self, state: &mut __HKV)
Feeds this value into the given [Hasher
]. Read more
fn hash_slice<H>(data: &[Self], state: &mut H) where
H: Hasher,
1.3.0[src]
fn hash_slice<H>(data: &[Self], state: &mut H) where
H: Hasher,
Feeds a slice of this type into the given [Hasher
]. Read more
impl<K: Default + Ord, V: Default> Default for SortedMap<K, V>
[src]
impl<K: Default + Ord, V: Default> Default for SortedMap<K, V>
impl<K: Debug + Ord, V: Debug> Debug for SortedMap<K, V>
[src]
impl<K: Debug + Ord, V: Debug> Debug for SortedMap<K, V>
fn fmt(&self, f: &mut Formatter) -> Result
[src]
fn fmt(&self, f: &mut Formatter) -> Result
Formats the value using the given formatter. Read more
impl<K: Encodable + Ord, V: Encodable> Encodable for SortedMap<K, V>
[src]
impl<K: Encodable + Ord, V: Encodable> Encodable for SortedMap<K, V>
impl<K: Decodable + Ord, V: Decodable> Decodable for SortedMap<K, V>
[src]
impl<K: Decodable + Ord, V: Decodable> Decodable for SortedMap<K, V>
impl<K: Ord, V> IntoIterator for SortedMap<K, V>
[src]
impl<K: Ord, V> IntoIterator for SortedMap<K, V>
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
[src]
fn into_iter(self) -> Self::IntoIter
Creates an iterator from a value. Read more
impl<K: Ord, V, Q: Borrow<K>> Index<Q> for SortedMap<K, V>
[src]
impl<K: Ord, V, Q: Borrow<K>> Index<Q> for SortedMap<K, V>
type Output = V
The returned type after indexing.
fn index(&self, index: Q) -> &Self::Output
[src]
fn index(&self, index: Q) -> &Self::Output
Performs the indexing (container[index]
) operation.
impl<K: Ord, V, Q: Borrow<K>> IndexMut<Q> for SortedMap<K, V>
[src]
impl<K: Ord, V, Q: Borrow<K>> IndexMut<Q> for SortedMap<K, V>
fn index_mut(&mut self, index: Q) -> &mut Self::Output
[src]
fn index_mut(&mut self, index: Q) -> &mut Self::Output
Performs the mutable indexing (container[index]
) operation.
impl<K: Ord, V, I: Iterator<Item = (K, V)>> From<I> for SortedMap<K, V>
[src]
impl<K: Ord, V, I: Iterator<Item = (K, V)>> From<I> for SortedMap<K, V>