Functions for lexicographical ordering of sequences.
Lexicographical ordering through <
, <=
, >=
, >
requires
that the elements implement both Eq
and Ord
.
If two sequences are equal up until the point where one ends, the shorter sequence compares less.
cmp | Order |
eq | Compare |
equals | Compare |
ge | Return |
gt | Return |
le | Return |
lt | Return |
ne | Compare |
Prefix searches with a type followed by a colon (e.g.
fn:
) to restrict the search to a given type.
Accepted types are: fn
, mod
,
struct
(or str
), enum
,
trait
, typedef
(or
tdef
).