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

NAME

6       Set - Sets over ordered types.
7

Module

9       Module   Set
10

Documentation

12       Module Set
13        : sig end
14
15
16       Sets over ordered types.
17
18       This  module  implements the set data structure, given a total ordering
19       function over the set elements. All operations  over  sets  are  purely
20       applicative (no side-effects).  The implementation uses balanced binary
21       trees, and is therefore reasonably efficient: insertion and  membership
22       take time logarithmic in the size of the set, for instance.
23
24
25
26
27
28
29       module type OrderedType = sig end
30
31
32       Input signature of the functor Set.Make .
33
34
35
36       module type S = sig end
37
38
39       Output signature of the functor Set.Make .
40
41
42
43       module Make : functor (Ord : OrderedType) -> sig end
44
45
46       Functor building an implementation of the set structure given a totally
47       ordered type.
48
49
50
51
52
53
54OCamldoc                          2007-05-24                            Set(3)