Module rune::alloc::btree_map

source ·
Expand description

An ordered map based on a B-Tree.

Structs§

  • An ordered map based on a B-Tree.
  • A cursor over a BTreeMap.
  • A cursor over a BTreeMap with editing operations.
  • An iterator produced by calling extract_if on BTreeMap.
  • An owning iterator over the entries of a BTreeMap.
  • An owning iterator over the keys of a BTreeMap.
  • An owning iterator over the values of a BTreeMap.
  • An iterator over the entries of a BTreeMap.
  • A mutable iterator over the entries of a BTreeMap.
  • A raw iterator over a map where the caller is responsible for ensuring that it doesn’t outlive the data it’s iterating over.
  • An iterator over the keys of a BTreeMap.
  • A view into an occupied entry in a BTreeMap. It is part of the Entry enum.
  • The error returned by try_insert when the key already exists.
  • An iterator over a sub-range of entries in a BTreeMap.
  • A mutable iterator over a sub-range of entries in a BTreeMap.
  • A view into a vacant entry in a BTreeMap. It is part of the Entry enum.
  • An iterator over the values of a BTreeMap.
  • A mutable iterator over the values of a BTreeMap.

Enums§

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