Module alloc::collections::btree::map

Re-exports

• pub use entry::Entry;
• pub use entry::OccupiedEntry;
• pub use entry::OccupiedError;
  Experimental
• pub use entry::VacantEntry;

Modules

• entry 🔒

Structs

• CursorExperimental
  A cursor over a BTreeMap.
• CursorMutExperimental
  A cursor over a BTreeMap with editing operations.
• ExtractIfExperimental
  An iterator produced by calling extract_if on BTreeMap.
• BTreeMap
  An ordered map based on a B-Tree.
• ExtractIfInner 🔒
  Most of the implementation of ExtractIf are generic over the type of the predicate, thus also serving for BTreeSet::ExtractIf.
• IntoIter
  An owning iterator over the entries of a BTreeMap.
• IntoKeys
  An owning iterator over the keys of a BTreeMap.
• IntoValues
  An owning iterator over the values of a BTreeMap.
• Iter
  An iterator over the entries of a BTreeMap.
• IterMut
  A mutable iterator over the entries of a BTreeMap.
• Keys
  An iterator over the keys of a BTreeMap.
• Range
  An iterator over a sub-range of entries in a BTreeMap.
• RangeMut
  A mutable iterator over a sub-range of entries in a BTreeMap.
• Values
  An iterator over the values of a BTreeMap.
• ValuesMut
  A mutable iterator over the values of a BTreeMap.

Constants

• MIN_LEN 🔒
  Minimum number of elements in a node that is not a root. We might temporarily have fewer elements during methods.