Expand description
An ordered set based on a B-Tree.
Structs§
- An ordered set based on a B-Tree.
- A cursor over a
BTreeSet
. - A cursor over a
BTreeSet
with editing operations. - A cursor over a
BTreeSet
with editing operations, and which allows mutating elements. - A lazy iterator producing elements in the difference of
BTreeSet
s. - An iterator produced by calling
extract_if
on BTreeSet. - A lazy iterator producing elements in the intersection of
BTreeSet
s. - An owning iterator over the items of a
BTreeSet
in ascending order. - An iterator over the items of a
BTreeSet
. - An iterator over a sub-range of items in a
BTreeSet
. - A lazy iterator producing elements in the symmetric difference of
BTreeSet
s. - A lazy iterator producing elements in the union of
BTreeSet
s. - Unordered
KeyError Experimental Error type returned byCursorMut::insert_before
andCursorMut::insert_after
if the key being inserted is not properly ordered with regards to adjacent keys.