1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
|
(* ========================================================================== *)
(* Tuples *)
(* ========================================================================== *)
let pair_equal eq1 eq2 (a1, b1) (a2, b2) =
(eq1 a1 a2) && (eq2 b1 b2)
let pair_swap (v1, v2) = (v2, v1)
let curry f v1 v2 = f (v1, v2)
let uncurry f (v1, v2) = f v1 v2
(* ========================================================================== *)
(* Orderings *)
(* ========================================================================== *)
let orderingIsLess r = (r < 0)
let orderingIsGreater r = (r > 0)
let orderingIsEqual r = (r = 0)
let ordering_cases (r : int) (lt : 'a) (eq : 'a) (gt : 'a) : 'a =
(if (r < 0) then lt else
if (r = 0) then eq else gt)
let orderingEqual r1 r2 =
ordering_cases r1 (orderingIsLess r2) (orderingIsEqual r2) (orderingIsGreater r2)
(* ========================================================================== *)
(* Lists *)
(* ========================================================================== *)
let list_null = function
| [] -> true
| _ -> false
let rec lexicographic_compare cmp l1 l2 : int = (match (l1,l2) with
| ([], []) -> 0
| ([], _::_) -> -1
| (_::_, []) -> 1
| (x::xs, y::ys) -> begin
ordering_cases (cmp x y) (-1) (lexicographic_compare cmp xs ys) (1)
end
)
let rec lexicographic_less less less_eq l1 l2 = ((match (l1,l2) with
| ([], []) -> false
| ([], _::_) -> true
| (_::_, []) -> false
| (x::xs, y::ys) -> ((less x y) || ((less_eq x y) && (lexicographic_less less less_eq xs ys)))
))
let rec lexicographic_less_eq less less_eq l1 l2 = ((match (l1,l2) with
| ([], []) -> true
| ([], _::_) -> true
| (_::_, []) -> false
| (x::xs, y::ys) -> (less x y || (less_eq x y && lexicographic_less_eq less less_eq xs ys))
))
let rec list_index l n = (match l with
| [] -> None
| x :: xs -> if n = 0 then (Some x) else list_index xs (n - 1)
)
(* ========================================================================== *)
(* Options *)
(* ========================================================================== *)
let is_none = function
| None -> true
| Some _ -> false
let is_some = function
| None -> false
| Some _ -> true
let option_case d f mb = (match mb with
| Some a -> f a
| None -> d
)
let option_default d = function
| Some a -> a
| None -> d
let option_map f = function
| Some a -> Some (f a)
| None -> None
let option_bind m f =
match m with
| Some a -> f a
| None -> None
let option_equal eq o1 o2 = match (o1, o2) with
| (None, None) -> true
| (None, Some _) -> false
| (Some _, None) -> false
| (Some x1, Some x2) -> eq x1 x2
|
