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 ofBTreeSets.
- A lazy iterator producing elements in the intersection ofBTreeSets.
- An owning iterator over the items of aBTreeSetin ascending order.
- An iterator over the items of aBTreeSet.
- An iterator over a sub-range of items in aBTreeSet.
- A lazy iterator producing elements in the symmetric difference ofBTreeSets.
- A lazy iterator producing elements in the union ofBTreeSets.
- CursorExperimental A cursor over aBTreeSet.
- CursorMut Experimental A cursor over aBTreeSetwith editing operations.
- CursorMutKey Experimental A cursor over aBTreeSetwith editing operations, and which allows mutating elements.
- ExtractIf Experimental An iterator produced by callingextract_ifon BTreeSet.
- OccupiedEntry Experimental A view into an occupied entry in aBTreeSet. It is part of theEntryenum.
- UnorderedKeyError Experimental Error type returned byCursorMut::insert_beforeandCursorMut::insert_afterif the key being inserted is not properly ordered with regards to adjacent keys.
- VacantEntry Experimental A view into a vacant entry in aBTreeSet. It is part of theEntryenum.
Enums§
- EntryExperimental A view into a single entry in a set, which may either be vacant or occupied.