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
GenericHashSet 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
GenericHashSet has no guaranteed ordering.
Macros§
- ordset
- Construct a set from a sequence of values.
Structs§
- Consuming
Iter - A consuming iterator over the elements of a set.
- Diff
Iter - An iterator over the difference between two sets.
- Generic
OrdSet - An ordered set.
- Iter
- An iterator over the elements of a set.
- Ranged
Iter - A ranged iterator over the elements of a set.
Enums§
- Diff
Item - A description of a difference between two ordered sets.
Type Aliases§
- OrdSet
- Type alias for
GenericOrdSetthat usesDefaultSharedPtras the pointer type.