std::collections

Module 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 BTreeSet in 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.
  • 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.
  • ExtractIfExperimental
    An iterator produced by calling extract_if on BTreeSet.
  • 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.