On this page
Module std::collections::btree_map
An ordered map based on a B-Tree.
Structs
-
CursorExperimentalA cursor over a
BTreeMap
. -
CursorMutExperimentalA cursor over a
BTreeMap
with editing operations. -
ExtractIfExperimentalAn iterator produced by calling
extract_if
on BTreeMap. -
OccupiedErrorExperimentalThe error returned by
try_insert
when the key already exists. -
An ordered map based on a B-Tree.
-
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
. -
An iterator over the keys of a
BTreeMap
. -
A view into an occupied entry in a
BTreeMap
. It is part of theEntry
enum. -
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 theEntry
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.
© 2010 The Rust Project Developers
Licensed under the Apache License, Version 2.0 or the MIT license, at your option.
https://doc.rust-lang.org/std/collections/btree_map/index.html