Trait superset_map::SetOrd
source · pub trait SetOrd: Ord + Set { }Expand description
Must conform to the following properties ∀a, b, c: Self:
a.is_subset(b)⇒a <= b.a.is_subset(b) && !(a.is_subset(c) || c.is_subset(b))⇒c<a<=b∨a<=b<c.
In American English prose, the above simply states that one only need to check for the “next” element of a
in an ordered sequence of Selfs to determine if there exists any superset of a in the entire sequence beside
a itself. Put in a different way, the “distance” between a set and a proper supserset is “less” than the “distance”
between the same set and a non-superset that is greater.