Expand description
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
Construct a set from a sequence of values.
Structs
A consuming iterator over the elements of a set.
An iterator over the difference between two sets.
An iterator over the elements of a set.
An ordered set.
A memory pool for the appropriate node type.
A ranged iterator over the elements of a set.
Enums
A description of a difference between two ordered sets.