**Description**

**Description**

A Strict Weak Ordering is a Binary Predicate that compares two objects, returning *true *if the first precedes the second. This predicate must satisfy the standard mathematical definition of a *strict weak ordering*. The precise requirements are stated below, but what they roughly mean is that a Strict Weak Ordering has to behave the way that "less than" behaves: if *a* is less than *b* then *b* is not less than *a*, if *a* is less than *b* and *b* is less than *c* then *a* is less than *c*, and so on.

Loading...