-
Notifications
You must be signed in to change notification settings - Fork 31
Expand file tree
/
Copy pathCore__Array.mjs
More file actions
199 lines (173 loc) · 3.2 KB
/
Core__Array.mjs
File metadata and controls
199 lines (173 loc) · 3.2 KB
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
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
// Generated by ReScript, PLEASE EDIT WITH CARE
import * as Js_math from "rescript/lib/es6/js_math.js";
import * as Caml_option from "rescript/lib/es6/caml_option.js";
function make(length, x) {
if (length <= 0) {
return [];
}
var arr = new Array(length);
arr.fill(x);
return arr;
}
function fromInitializer(length, f) {
if (length <= 0) {
return [];
}
var arr = new Array(length);
for(var i = 0; i < length; ++i){
arr[i] = f(i);
}
return arr;
}
function equal(a, b, eq) {
var len = a.length;
if (len === b.length) {
var _i = 0;
while(true) {
var i = _i;
if (i === len) {
return true;
}
if (!eq(a[i], b[i])) {
return false;
}
_i = i + 1 | 0;
continue ;
};
} else {
return false;
}
}
function compare(a, b, cmp) {
var lenA = a.length;
var lenB = b.length;
if (lenA < lenB) {
return -1;
} else if (lenA > lenB) {
return 1;
} else {
var _i = 0;
while(true) {
var i = _i;
if (i === lenA) {
return 0;
}
var c = cmp(a[i], b[i]);
if (c !== 0) {
return c;
}
_i = i + 1 | 0;
continue ;
};
}
}
function indexOfOpt(arr, item) {
var index = arr.indexOf(item);
if (index !== -1) {
return index;
}
}
function lastIndexOfOpt(arr, item) {
var index = arr.lastIndexOf(item);
if (index !== -1) {
return index;
}
}
function reduce(arr, init, f) {
return arr.reduce(f, init);
}
function reduceWithIndex(arr, init, f) {
return arr.reduce(f, init);
}
function reduceRight(arr, init, f) {
return arr.reduceRight(f, init);
}
function reduceRightWithIndex(arr, init, f) {
return arr.reduceRight(f, init);
}
function get(arr, i) {
if (i >= 0 && i < arr.length) {
return Caml_option.some(arr[i]);
}
}
function findIndexOpt(array, finder) {
var index = array.findIndex(finder);
if (index !== -1) {
return index;
}
}
function swapUnsafe(xs, i, j) {
var tmp = xs[i];
xs[i] = xs[j];
xs[j] = tmp;
}
function shuffle(xs) {
var len = xs.length;
for(var i = 0; i < len; ++i){
swapUnsafe(xs, i, Js_math.random_int(i, len));
}
}
function toShuffled(xs) {
var result = xs.slice();
shuffle(result);
return result;
}
function filterMap(a, f) {
var l = a.length;
var r = new Array(l);
var j = 0;
for(var i = 0; i < l; ++i){
var v = a[i];
var v$1 = f(v);
if (v$1 !== undefined) {
r[j] = Caml_option.valFromOption(v$1);
j = j + 1 | 0;
}
}
r.length = j;
return r;
}
function keepSome(__x) {
return filterMap(__x, (function (x) {
return x;
}));
}
function findMap(arr, f) {
var _i = 0;
while(true) {
var i = _i;
if (i === arr.length) {
return ;
}
var r = f(arr[i]);
if (r !== undefined) {
return r;
}
_i = i + 1 | 0;
continue ;
};
}
function last(a) {
return get(a, a.length - 1 | 0);
}
export {
make ,
fromInitializer ,
equal ,
compare ,
indexOfOpt ,
lastIndexOfOpt ,
reduce ,
reduceWithIndex ,
reduceRight ,
reduceRightWithIndex ,
get ,
findIndexOpt ,
filterMap ,
keepSome ,
toShuffled ,
shuffle ,
findMap ,
last ,
}
/* No side effect */