Expand description
An ordered set based on a B-Tree.
Structs§
- BTree
Set - An ordered set based on a B-Tree.
- Difference
- A lazy iterator producing elements in the difference of
BTreeSets. - Intersection
- A lazy iterator producing elements in the intersection of
BTreeSets. - Into
Iter - An owning iterator over the items of a
BTreeSetin ascending order. - Iter
- An iterator over the items of a
BTreeSet. - Range
- An iterator over a sub-range of items in a
BTreeSet. - Symmetric
Difference - A lazy iterator producing elements in the symmetric difference of
BTreeSets. - Union
- A lazy iterator producing elements in the union of
BTreeSets. - Cursor
Experimental - A cursor over a
BTreeSet. - Cursor
Mut Experimental - A cursor over a
BTreeSetwith editing operations. - Cursor
MutKey Experimental - A cursor over a
BTreeSetwith editing operations, and which allows mutating elements. - Extract
If Experimental - An iterator produced by calling
extract_ifon BTreeSet. - Occupied
Entry Experimental - A view into an occupied entry in a
BTreeSet. It is part of theEntryenum. - Unordered
KeyError Experimental - Error type returned by
CursorMut::insert_beforeandCursorMut::insert_afterif the key being inserted is not properly ordered with regards to adjacent keys. - Vacant
Entry Experimental - A view into a vacant entry in a
BTreeSet. It is part of theEntryenum.
Enums§
- Entry
Experimental - A view into a single entry in a set, which may either be vacant or occupied.