Struct rustc_ast_lowering::SortedMap [−][src]
Expand description
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.
Fields
data: Vec<(K, V), Global>Auto Trait Implementations
impl<K, V> RefUnwindSafe for SortedMap<K, V> where
K: RefUnwindSafe,
V: RefUnwindSafe,
impl<K, V> UnwindSafe for SortedMap<K, V> where
K: UnwindSafe,
V: UnwindSafe,
Blanket Implementations
Mutably borrows from an owned value. Read more
Layout
Note: Most layout information is completely unstable and may even differ between compilations. The only exception is types with certain repr(...) attributes. Please see the Rust Reference’s “Type Layout” chapter for details on type layout guarantees.
Size: 24 bytes