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
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
(* SPDX-License-Identifier: AGPL-3.0-or-later *)
(* Copyright © 2021-2024 OCamlPro *)
(* Written by the Owi programmers *)
open Prelude.Result
let[@inline] ( let* ) o f = match o with Ok v -> f v | Error _ as e -> e
let[@inline] ( let+ ) o f = match o with Ok v -> Ok (f v) | Error _ as e -> e
let[@inline] ok v = Ok v
let[@inline] list_iter f l =
let rec aux = function
| [] -> Ok ()
| x :: xs -> ( match f x with Ok () -> aux xs | Error _ as e -> e )
in
aux l
let[@inline] list_map f l =
let rec aux acc = function
| [] -> Ok (List.rev acc)
| x :: xs -> (
match f x with Ok v -> aux (v :: acc) xs | Error _ as e -> e )
in
aux [] l
let[@inline] list_concat_map f l =
let rec aux acc = function
| [] -> Ok (List.rev acc)
| v :: tl -> (
match f v with
| Ok vs -> aux (List.rev_append vs acc) tl
| Error _ as e -> e )
in
aux [] l
let[@inline] list_fold_left f acc l =
let rec aux acc = function
| [] -> Ok acc
| v :: tl -> (
match f acc v with Ok acc -> aux acc tl | Error _ as e -> e )
in
aux acc l
let[@inline] list_fold_left_map f acc l =
let+ acc, l =
list_fold_left
(fun (acc, l) v ->
let+ acc, x = f acc v in
(acc, x :: l) )
(acc, []) l
in
(acc, List.rev l)
let[@inline] array_iter f a =
let err = ref None in
try
for i = 0 to Array.length a - 1 do
match f (Array.unsafe_get a i) with
| Error _e as e ->
err := Some e;
raise Exit
| Ok () -> ()
done;
Ok ()
with Exit -> ( match !err with None -> assert false | Some e -> e )
let[@inline] array_iteri f a =
let err = ref None in
try
for i = 0 to Array.length a - 1 do
match f i (Array.unsafe_get a i) with
| Error _e as e ->
err := Some e;
raise Exit
| Ok () -> ()
done;
Ok ()
with Exit -> ( match !err with None -> assert false | Some e -> e )
let[@inline] dynarray_iter f a =
let err = ref None in
try
for i = 0 to Dynarray.length a - 1 do
match f (Dynarray.get a i) with
| Error _e as e ->
err := Some e;
raise Exit
| Ok () -> ()
done;
Ok ()
with Exit -> ( match !err with None -> assert false | Some e -> e )
let[@inline] dynarray_iteri f a =
let err = ref None in
try
for i = 0 to Dynarray.length a - 1 do
match f i (Dynarray.get a i) with
| Error _e as e ->
err := Some e;
raise Exit
| Ok () -> ()
done;
Ok ()
with Exit -> ( match !err with None -> assert false | Some e -> e )
let[@inline] array_map f a =
let err = ref None in
try
ok
@@ Array.init (Array.length a) (fun i ->
let v = Array.get a i in
match f v with
| Error _e as e ->
err := Some e;
raise Exit
| Ok v -> v )
with Exit -> ( match !err with None -> assert false | Some e -> e )
let[@inline] dynarray_map f a =
let err = ref None in
try
ok
@@ Dynarray.init (Dynarray.length a) (fun i ->
let v = Dynarray.get a i in
match f v with
| Error _e as e ->
err := Some e;
raise Exit
| Ok v -> v )
with Exit -> ( match !err with None -> assert false | Some e -> e )
let[@inline] array_fold_left f acc l =
Array.fold_left
(fun acc v ->
let* acc in
f acc v )
(Ok acc) l
let[@inline] dynarray_fold_left f acc l =
Dynarray.fold_left
(fun acc v ->
let* acc in
f acc v )
(Ok acc) l
let[@inline] dynarray_fold_lefti f acc l =
snd
@@ Dynarray.fold_left
(fun (i, acc) v ->
( succ i
, let* acc in
f i acc v ) )
(0, Ok acc) l