btree_set - alloc

Modules

BTreeSet An ordered set based on a B-Tree.
Cursor A cursor over a BTreeSet.
CursorMut A cursor over a BTreeSet with editing operations.
CursorMutKey A cursor over a BTreeSet with editing operations, and which allows mutating elements.
Difference A lazy iterator producing elements in the difference of BTreeSets.
ExtractIf This struct is created by the extract_if method on BTreeSet.
Intersection A lazy iterator producing elements in the intersection of BTreeSets.
IntoIter An owning iterator over the items of a BTreeSet in ascending order.
Iter An iterator over the items of a BTreeSet.
OccupiedEntry A view into an occupied entry in a BTreeSet. It is part of the Entry enum.
Range An iterator over a sub-range of items in a BTreeSet.
SymmetricDifference A lazy iterator producing elements in the symmetric difference of BTreeSets.
Union A lazy iterator producing elements in the union of BTreeSets.
UnorderedKeyError Error type returned by CursorMut::insert_before and CursorMut::insert_after if the key being inserted is not properly ordered with regards to adjacent keys.
VacantEntry A view into a vacant entry in a BTreeSet. It is part of the Entry enum.

DifferenceInner
Entry A view into a single entry in a set, which may either be vacant or occupied.
IntersectionInner