Module im::ordset

An ordered set.

An immutable ordered set implemented as a [B-tree] 1.

Most operations on this type of set are O(log n). A HashSet is usually a better choice for performance, but the OrdSet has the advantage of only requiring an Ord constraint on its values, and of being ordered, so values always come out from lowest to highest, where a HashSet has no guaranteed ordering.

Macros

• ordset
  Construct a set from a sequence of values.

Structs

• ConsumingIter
  A consuming iterator over the elements of a set.
• DiffIter
  An iterator over the difference between two sets.
• Iter
  An iterator over the elements of a set.
• OrdSet
  An ordered set.
• OrdSetPool
  A memory pool for the appropriate node type.
• RangedIter
  A ranged iterator over the elements of a set.

Enums

• DiffItem
  A description of a difference between two ordered sets.