[−][src]Struct rustc_data_structures::sorted_map::SortedMap
SortedMap
is a data structure with similar characteristics as BTreeMap but
slightly different trade-offs: lookup, insertion, 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]
pub fn new() -> SortedMap<K, V>
[src]
pub fn from_presorted_elements(elements: Vec<(K, V)>) -> SortedMap<K, V>
[src]
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 remove(&mut self, key: &K) -> Option<V>
[src]
pub fn get<Q: ?Sized>(&self, key: &Q) -> Option<&V> where
K: Borrow<Q>,
Q: Ord,
[src]
K: Borrow<Q>,
Q: Ord,
pub fn get_mut<Q: ?Sized>(&mut self, key: &Q) -> Option<&mut V> where
K: Borrow<Q>,
Q: Ord,
[src]
K: Borrow<Q>,
Q: Ord,
pub fn clear(&mut self)
[src]
ⓘImportant traits for Iter<'a, T>pub fn iter(&self) -> Iter<(K, V)>
[src]
Iterate over elements, sorted by key
pub fn keys(&self) -> impl Iterator<Item = &K> + ExactSizeIterator
[src]
Iterate over the keys, sorted
pub fn values(&self) -> impl Iterator<Item = &V> + ExactSizeIterator
[src]
Iterate over values, sorted by key
pub fn len(&self) -> usize
[src]
pub fn is_empty(&self) -> bool
[src]
pub fn range<R>(&self, range: R) -> &[(K, V)] where
R: RangeBounds<K>,
[src]
R: RangeBounds<K>,
pub fn remove_range<R>(&mut self, range: R) where
R: RangeBounds<K>,
[src]
R: RangeBounds<K>,
pub fn offset_keys<F>(&mut self, f: F) where
F: Fn(&mut K),
[src]
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]
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.
pub fn contains_key<Q: ?Sized>(&self, key: &Q) -> bool where
K: Borrow<Q>,
Q: Ord,
[src]
K: Borrow<Q>,
Q: Ord,
Trait Implementations
impl<K: PartialOrd + Ord, V: PartialOrd> PartialOrd<SortedMap<K, V>> for SortedMap<K, V>
[src]
fn partial_cmp(&self, other: &SortedMap<K, V>) -> Option<Ordering>
[src]
fn lt(&self, other: &SortedMap<K, V>) -> bool
[src]
fn le(&self, other: &SortedMap<K, V>) -> bool
[src]
fn gt(&self, other: &SortedMap<K, V>) -> bool
[src]
fn ge(&self, other: &SortedMap<K, V>) -> bool
[src]
impl<K: PartialEq + Ord, V: PartialEq> PartialEq<SortedMap<K, V>> for SortedMap<K, V>
[src]
fn eq(&self, other: &SortedMap<K, V>) -> bool
[src]
fn ne(&self, other: &SortedMap<K, V>) -> bool
[src]
impl<K: Ord, V: Ord> Ord for SortedMap<K, V>
[src]
fn cmp(&self, other: &SortedMap<K, V>) -> Ordering
[src]
fn max(self, other: Self) -> Self
1.21.0[src]
Compares and returns the maximum of two values. Read more
fn min(self, other: Self) -> Self
1.21.0[src]
Compares and returns the minimum of two values. Read more
fn clamp(self, min: Self, max: Self) -> Self
[src]
clamp
)Restrict a value to a certain interval. Read more
impl<K: Ord, V> IntoIterator for SortedMap<K, V>
[src]
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]
impl<K: Default + Ord, V: Default> Default for SortedMap<K, V>
[src]
impl<K: Clone + Ord, V: Clone> Clone for SortedMap<K, V>
[src]
fn clone(&self) -> SortedMap<K, V>
[src]
fn clone_from(&mut self, source: &Self)
1.0.0[src]
Performs copy-assignment from source
. Read more
impl<K: Eq + Ord, V: Eq> Eq for SortedMap<K, V>
[src]
impl<K: Hash + Ord, V: Hash> Hash for SortedMap<K, V>
[src]
fn hash<__HKV: Hasher>(&self, state: &mut __HKV)
[src]
fn hash_slice<H>(data: &[Self], state: &mut H) where
H: Hasher,
1.3.0[src]
H: Hasher,
Feeds a slice of this type into the given [Hasher
]. Read more
impl<'a, K, Q: ?Sized, V> Index<&'a Q> for SortedMap<K, V> where
K: Ord + Borrow<Q>,
Q: Ord,
[src]
K: Ord + Borrow<Q>,
Q: Ord,
impl<'a, K, Q: ?Sized, V> IndexMut<&'a Q> for SortedMap<K, V> where
K: Ord + Borrow<Q>,
Q: Ord,
[src]
K: Ord + Borrow<Q>,
Q: Ord,
impl<K: Debug + Ord, V: Debug> Debug for SortedMap<K, V>
[src]
impl<K: Ord, V> FromIterator<(K, V)> for SortedMap<K, V>
[src]
fn from_iter<T: IntoIterator<Item = (K, V)>>(iter: T) -> Self
[src]
impl<K: Encodable + Ord, V: Encodable> Encodable for SortedMap<K, V>
[src]
impl<K: Decodable + Ord, V: Decodable> Decodable for SortedMap<K, V>
[src]
Auto Trait Implementations
impl<K, V> Sync for SortedMap<K, V> where
K: Sync,
V: Sync,
K: Sync,
V: Sync,
impl<K, V> Send for SortedMap<K, V> where
K: Send,
V: Send,
K: Send,
V: Send,
impl<K, V> Unpin for SortedMap<K, V> where
K: Unpin,
V: Unpin,
K: Unpin,
V: Unpin,
impl<K, V> RefUnwindSafe for SortedMap<K, V> where
K: RefUnwindSafe,
V: RefUnwindSafe,
K: RefUnwindSafe,
V: RefUnwindSafe,
impl<K, V> UnwindSafe for SortedMap<K, V> where
K: UnwindSafe,
V: UnwindSafe,
K: UnwindSafe,
V: UnwindSafe,
Blanket Implementations
impl<T> Erased for T
[src]
impl<T, U> Into<U> for T where
U: From<T>,
[src]
U: From<T>,
impl<T> ToOwned for T where
T: Clone,
[src]
T: Clone,
type Owned = T
The resulting type after obtaining ownership.
fn to_owned(&self) -> T
[src]
fn clone_into(&self, target: &mut T)
[src]
impl<I> IntoIterator for I where
I: Iterator,
[src]
I: Iterator,
type Item = <I as Iterator>::Item
The type of the elements being iterated over.
type IntoIter = I
Which kind of iterator are we turning this into?
fn into_iter(self) -> I
[src]
impl<T> From<T> for T
[src]
impl<T, U> TryFrom<U> for T where
U: Into<T>,
[src]
U: Into<T>,
type Error = Infallible
The type returned in the event of a conversion error.
fn try_from(value: U) -> Result<T, <T as TryFrom<U>>::Error>
[src]
impl<T, U> TryInto<U> for T where
U: TryFrom<T>,
[src]
U: TryFrom<T>,
type Error = <U as TryFrom<T>>::Error
The type returned in the event of a conversion error.
fn try_into(self) -> Result<U, <U as TryFrom<T>>::Error>
[src]
impl<T> BorrowMut<T> for T where
T: ?Sized,
[src]
T: ?Sized,
ⓘImportant traits for &'_ mut Ifn borrow_mut(&mut self) -> &mut T
[src]
impl<T> Borrow<T> for T where
T: ?Sized,
[src]
T: ?Sized,
impl<T> Any for T where
T: 'static + ?Sized,
[src]
T: 'static + ?Sized,
impl<T> Encodable for T where
T: UseSpecializedEncodable + ?Sized,
[src]
T: UseSpecializedEncodable + ?Sized,
impl<T> Decodable for T where
T: UseSpecializedDecodable,
[src]
T: UseSpecializedDecodable,
impl<E> SpecializationError for E
[src]
default fn not_found<S, T>(
trait_name: &'static str,
method_name: &'static str
) -> E where
T: ?Sized,
[src]
trait_name: &'static str,
method_name: &'static str
) -> E where
T: ?Sized,
impl<Q, K> Equivalent<K> for Q where
K: Borrow<Q> + ?Sized,
Q: Eq + ?Sized,
[src]
K: Borrow<Q> + ?Sized,
Q: Eq + ?Sized,