Module std::iter::orderUnstable [-] [+] [src]

Functions for lexicographical ordering of sequences.

Lexicographical ordering through <, <=, >=, > requires that the elements implement both PartialEq and PartialOrd.

If two sequences are equal up until the point where one ends, the shorter sequence compares less.

Functions

cmp	Order `a` and `b` lexicographically using `Ord`
eq	Compare `a` and `b` for equality (Using partial equality, `PartialEq`)
equals	Compare `a` and `b` for equality using `Eq`
ge	Return `a` >= `b` lexicographically (Using partial order, `PartialOrd`)
gt	Return `a` > `b` lexicographically (Using partial order, `PartialOrd`)
le	Return `a` <= `b` lexicographically (Using partial order, `PartialOrd`)
lt	Return `a` < `b` lexicographically (Using partial order, `PartialOrd`)
ne	Compare `a` and `b` for nonequality (Using partial equality, `PartialEq`)
partial_cmp	Order `a` and `b` lexicographically using `PartialOrd`