-
Notifications
You must be signed in to change notification settings - Fork 464
/
Copy pathBelt_Range.res
76 lines (68 loc) · 2.16 KB
/
Belt_Range.res
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
/* Copyright (C) 2017 Hongbo Zhang, Authors of ReScript
*
* This program is free software: you can redistribute it and/or modify
* it under the terms of the GNU Lesser General Public License as published by
* the Free Software Foundation, either version 3 of the License, or
* (at your option) any later version.
*
* In addition to the permissions granted to you by the LGPL, you may combine
* or link a "work that uses the Library" with a publicly distributed version
* of this file to produce a combined library or application, then distribute
* that combined work under the terms of your choosing, with no requirement
* to comply with the obligations normally placed on you by section 4 of the
* LGPL version 3 (or the corresponding section of a later version of the LGPL
* should you choose to use a later version).
*
* This program is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
* GNU Lesser General Public License for more details.
*
* You should have received a copy of the GNU Lesser General Public License
* along with this program; if not, write to the Free Software
* Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA. */
let forEach = (s, f, action) =>
for i in s to f {
(action(i): unit)
}
let rec every = (s, f, p) =>
if s > f {
true
} else {
p(s) && every(s + 1, f, p)
}
let rec everyByAux = (s, f, ~step, p) =>
if s > f {
true
} else {
p(s) && everyByAux(s + step, f, ~step, p)
}
let everyBy = (s, f, ~step, p) =>
if step > 0 {
everyByAux(s, f, ~step, p)
} else {
true
} /* return empty range `true` */
let rec some = (s, f, p) =>
if s > f {
false
} else {
p(s) || some(s + 1, f, p)
}
let rec someByAux = (s, f, ~step, p) =>
if s > f {
false
} else {
p(s) || someByAux(s + step, f, ~step, p)
}
let someBy = (s, f, ~step, p) =>
if step > 0 {
someByAux(s, f, ~step, p)
} else {
false
} /* return empty range, `false` */
let everyByU = everyBy
let everyU = every
let forEachU = forEach
let someByU = someBy
let someU = some