1Set.OrderedType(3)               OCaml library              Set.OrderedType(3)
2
3
4

NAME

6       Set.OrderedType - Input signature of the functor Set.Make.
7

Module type

9       Module type   Set.OrderedType
10

Documentation

12       Module type OrderedType
13        = sig end
14
15
16       Input signature of the functor Set.Make .
17
18
19
20
21
22
23       type t
24
25
26       The type of the set elements.
27
28
29
30
31       val compare : t -> t -> int
32
33       A  total  ordering function over the set elements.  This is a two-argu‐
34       ment function f such that f e1 e2 is zero if the elements e1 and e2 are
35       equal, f e1 e2 is strictly negative if e1 is smaller than e2 , and f e1
36       e2 is strictly positive if e1 is greater than e2 .  Example: a suitable
37       ordering  function is the generic structural comparison function Perva‐
38       sives.compare .
39
40
41
42
43
44
45OCamldoc                          2007-05-24                Set.OrderedType(3)