# Module std::collections::btree_map

1.0.0 · source ·
Expand description

An ordered map based on a B-Tree.

## Structs

- Cursor Experimental
  A cursor over a `BTreeMap`.
- CursorMut Experimental
  A cursor over a `BTreeMap` with editing operations.
- ExtractIf Experimental
  An iterator produced by calling `extract_if` on BTreeMap.
- OccupiedError Experimental
  The error returned by `try_insert` when the key already exists.
- BTreeMap
  An ordered map based on a B-Tree.
- 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`.
- OccupiedEntry
  A view into an occupied entry in a `BTreeMap`. It is part of the `Entry` enum.
- 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`.
- VacantEntry
  A view into a vacant entry in a `BTreeMap`. It is part of the `Entry` enum.
- Values
  An iterator over the values of a `BTreeMap`.
- ValuesMut
  A mutable iterator over the values of a `BTreeMap`.

## Enums

- Entry
  A view into a single entry in a map, which may either be vacant or occupied.