Module std::collections::btree_set
1.0.0 · source · Expand description
An ordered set based on a B-Tree.
Structs§
- An ordered set based on a B-Tree.
- A lazy iterator producing elements in the difference of
BTreeSets. - A lazy iterator producing elements in the intersection of
BTreeSets. - An owning iterator over the items of a
BTreeSetin 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
BTreeSets. - A lazy iterator producing elements in the union of
BTreeSets. - Cursor
Experimental A cursor over aBTreeSet. - Cursor
Mut Experimental A cursor over aBTreeSetwith editing operations. - Cursor
MutKey Experimental A cursor over aBTreeSetwith editing operations, and which allows mutating elements. - Extract
If Experimental An iterator produced by callingextract_ifon BTreeSet. - Unordered
KeyError Experimental Error type returned byCursorMut::insert_beforeandCursorMut::insert_afterif the key being inserted is not properly ordered with regards to adjacent keys.