Module sorted_map 

Re-exports

use std::borrow::Borrow; 🔒

use std::cmp::Ordering; 🔒

use std::fmt::Debug; 🔒

use std::fmt::Debug; 🔒

use std::iter::TrustedLen; 🔒 Experimental

use std::mem; 🔒

use std::ops::Bound; 🔒

use std::ops::Index; 🔒

use std::ops::IndexMut; 🔒

use std::ops::RangeBounds; 🔒

use rustc_macros::Decodable_NoContext; 🔒

use rustc_macros::Encodable_NoContext; 🔒

use crate::stable_hash::StableHash; 🔒

use crate::stable_hash::StableHashCtxt; 🔒

use crate::stable_hash::StableHasher; 🔒

use crate::stable_hash::StableOrd; 🔒

pub use index_map::SortedIndexMultiMap;

Modules

index_map 🔒

A variant of SortedMap that preserves insertion order.

Structs

SortedMap

SortedMap is a data structure with similar characteristics as BTreeMap but slightly different trade-offs: lookup is O(log(n)), insertion and removal are O(n) but elements can be iterated in order cheaply.