type comparison = tval to_string : t -> stringInfix Representation
combine two partial comparisons, that are assumed to be compatible, ie they do not order differently if Incomparable is not one of the values.
Invalid_argument if the comparisons are inconsistent.
val to_total : t -> intConversion to a total ordering. Incomparable is translated to 0 (equal).
val of_total : int -> tConversion from a total order
Lexicographic combination (the second is used only if the first is Incomparable
type 'a comparator = 'a -> 'a -> tval (@>>) : 'a comparator -> 'a comparator -> 'a comparatorCombination of comparators that work on the same values. Its behavior is the following: (f1 @>> f2) x y is the same as f1 x y if f1 x y is not Eq; otherwise it is the same as f2 x y
Lexicographic combination of comparators. It is, roughly, equivalent to 'a -> 'a -> 'b
val (>>>) :
'a comparator ->
('b, 'c) combination ->
('a, 'b -> 'b -> 'c) combinationLexicographic combination starting with the given function
val last : 'a comparator -> ('a, t) combinationLast comparator
val call : ('a, 'b) combination -> 'a -> 'a -> 'bCall a lexicographic combination on arguments
val dominates : ('a -> 'b -> t) -> 'a list -> 'b list -> booldominates f l1 l2 returns true iff for all element y of l2, there is some x in l1 with f x y = Gt
module type PARTIAL_ORD = sig ... end