[][src]Module im_rc::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.

Structs

ConsumingIter
DiffIter
Iter
OrdSet

An ordered set.

RangedIter

Enums

DiffItem