Module btree_set

An ordered set based on a B-Tree.

Structs

BTreeSet

An ordered set based on a B-Tree.

Difference

A lazy iterator producing elements in the difference of BTreeSets.

ExtractIf

An iterator produced by calling extract_if 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.

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.

CursorExperimental

A cursor over a BTreeSet.

CursorMutExperimental

A cursor over a BTreeSet with editing operations.

CursorMutKeyExperimental

A cursor over a BTreeSet with editing operations, and which allows mutating elements.

OccupiedEntryExperimental

A view into an occupied entry in a BTreeSet. It is part of the Entry enum.

UnorderedKeyErrorExperimental

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.

VacantEntryExperimental

A view into a vacant entry in a BTreeSet. It is part of the Entry enum.

Enums

EntryExperimental

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