@rescript/std
Advanced tools
Comparing version 9.1.4 to 10.0.0-alpha.1
@@ -29,3 +29,3 @@ | ||
var match = l.hd; | ||
if (Caml_obj.caml_equal(match[0], x)) { | ||
if (Caml_obj.equal(match[0], x)) { | ||
return match[1]; | ||
@@ -125,15 +125,15 @@ } | ||
$$Buffer.add_string(buf, "" + errmsg + "\n"); | ||
return List.iter((function (param) { | ||
var doc = param[2]; | ||
if (doc.length === 0) { | ||
return ; | ||
} | ||
var spec = param[1]; | ||
var key = param[0]; | ||
if (spec.TAG !== /* Symbol */11) { | ||
return $$Buffer.add_string(buf, " " + key + " " + doc + "\n"); | ||
} | ||
var sym = make_symlist("{", "|", "}", spec._0); | ||
return $$Buffer.add_string(buf, " " + key + " " + sym + doc + "\n"); | ||
}), add_help(speclist)); | ||
List.iter((function (param) { | ||
var doc = param[2]; | ||
if (doc.length === 0) { | ||
return ; | ||
} | ||
var spec = param[1]; | ||
var key = param[0]; | ||
if (spec.TAG !== /* Symbol */11) { | ||
return $$Buffer.add_string(buf, " " + key + " " + doc + "\n"); | ||
} | ||
var sym = make_symlist("{", "|", "}", spec._0); | ||
return $$Buffer.add_string(buf, " " + key + " " + sym + doc + "\n"); | ||
}), add_help(speclist)); | ||
} | ||
@@ -149,3 +149,2 @@ | ||
console.log(usage_string(speclist, errmsg)); | ||
} | ||
@@ -172,3 +171,3 @@ | ||
try { | ||
return Caml_format.caml_int_of_string(x); | ||
return Caml_format.int_of_string(x); | ||
} | ||
@@ -186,3 +185,3 @@ catch (raw_exn){ | ||
try { | ||
return Caml_format.caml_float_of_string(x); | ||
return Caml_format.float_of_string(x); | ||
} | ||
@@ -226,6 +225,6 @@ catch (raw_exn){ | ||
usage_b(b, speclist.contents, errmsg); | ||
if (Caml_obj.caml_equal(error, { | ||
if (Caml_obj.equal(error, { | ||
TAG: /* Unknown */0, | ||
_0: "-help" | ||
}) || Caml_obj.caml_equal(error, { | ||
}) || Caml_obj.equal(error, { | ||
TAG: /* Unknown */0, | ||
@@ -515,7 +514,6 @@ _0: "--help" | ||
}; | ||
} | ||
function parse_and_expand_argv_dynamic(current, argv, speclist, anonfun, errmsg) { | ||
return parse_and_expand_argv_dynamic_aux(true, current, argv, speclist, anonfun, errmsg); | ||
parse_and_expand_argv_dynamic_aux(true, current, argv, speclist, anonfun, errmsg); | ||
} | ||
@@ -525,5 +523,5 @@ | ||
var current$1 = currentOpt !== undefined ? currentOpt : current; | ||
return parse_and_expand_argv_dynamic_aux(false, current$1, { | ||
contents: argv | ||
}, speclist, anonfun, errmsg); | ||
parse_and_expand_argv_dynamic_aux(false, current$1, { | ||
contents: argv | ||
}, speclist, anonfun, errmsg); | ||
} | ||
@@ -533,5 +531,5 @@ | ||
var current$1 = currentOpt !== undefined ? currentOpt : current; | ||
return parse_argv_dynamic(current$1, argv, { | ||
contents: speclist | ||
}, anonfun, errmsg); | ||
parse_argv_dynamic(current$1, argv, { | ||
contents: speclist | ||
}, anonfun, errmsg); | ||
} | ||
@@ -651,5 +649,5 @@ | ||
if (param[1].TAG === /* Symbol */11) { | ||
return Caml.caml_int_max(cur, kwd.length); | ||
return Caml.int_max(cur, kwd.length); | ||
} else { | ||
return Caml.caml_int_max(cur, kwd.length + second_word(param[2]) | 0); | ||
return Caml.int_max(cur, kwd.length + second_word(param[2]) | 0); | ||
} | ||
@@ -686,3 +684,3 @@ } | ||
var cutcol = second_word(msg); | ||
var spaces = " ".repeat(Caml.caml_int_max(0, len$1 - cutcol | 0) + 3 | 0); | ||
var spaces = " ".repeat(Caml.int_max(0, len$1 - cutcol | 0) + 3 | 0); | ||
return [ | ||
@@ -729,4 +727,3 @@ kwd, | ||
current , | ||
} | ||
/* No side effect */ |
@@ -81,3 +81,2 @@ | ||
} | ||
} | ||
@@ -93,3 +92,3 @@ | ||
} | ||
return Caml_array.blit(a1, ofs1, a2, ofs2, len); | ||
Caml_array.blit(a1, ofs1, a2, ofs2, len); | ||
} | ||
@@ -101,3 +100,2 @@ | ||
} | ||
} | ||
@@ -116,3 +114,2 @@ | ||
} | ||
} | ||
@@ -156,3 +153,2 @@ | ||
} | ||
} | ||
@@ -279,3 +275,3 @@ | ||
} | ||
if (Caml_obj.caml_equal(a[i], x)) { | ||
if (Caml_obj.equal(a[i], x)) { | ||
return true; | ||
@@ -381,3 +377,3 @@ } | ||
"array.ml", | ||
238, | ||
236, | ||
4 | ||
@@ -413,3 +409,3 @@ ], | ||
Caml_array.set(a, 1, Caml_array.get(a, 0)); | ||
return Caml_array.set(a, 0, e$1); | ||
Caml_array.set(a, 0, e$1); | ||
} | ||
@@ -464,3 +460,2 @@ | ||
} | ||
}; | ||
@@ -475,3 +470,3 @@ var sortto = function (srcofs, dst, dstofs, len) { | ||
sortto(srcofs, a, srcofs + l2 | 0, l1); | ||
return merge(srcofs + l2 | 0, l1, dst, dstofs + l1 | 0, l2, dst, dstofs); | ||
merge(srcofs + l2 | 0, l1, dst, dstofs + l1 | 0, l2, dst, dstofs); | ||
}; | ||
@@ -487,3 +482,3 @@ var l = a.length; | ||
sortto(0, a, l2, l1); | ||
return merge(l2, l1, t, 0, l2, a, 0); | ||
merge(l2, l1, t, 0, l2, a, 0); | ||
} | ||
@@ -526,4 +521,3 @@ | ||
Floatarray , | ||
} | ||
/* No side effect */ |
import * as $$Array from "./array.js"; | ||
import * as Curry from "./curry.js"; | ||
import * as Caml_obj from "./caml_obj.js"; | ||
import * as Caml_array from "./caml_array.js"; | ||
import * as Caml_exceptions from "./caml_exceptions.js"; | ||
import * as Caml_js_exceptions from "./caml_js_exceptions.js"; | ||
var init = $$Array.init; | ||
var make_float = Caml_array.make_float; | ||
var make_matrix = $$Array.make_matrix; | ||
var Floatarray = {}; | ||
var create_matrix = $$Array.create_matrix; | ||
function init(l, f) { | ||
if (l === 0) { | ||
return []; | ||
} | ||
if (l < 0) { | ||
throw { | ||
RE_EXN_ID: "Invalid_argument", | ||
_1: "Array.init", | ||
Error: new Error() | ||
}; | ||
} | ||
var res = Caml_array.make(l, Curry._1(f, 0)); | ||
for(var i = 1; i < l; ++i){ | ||
res[i] = Curry._1(f, i); | ||
} | ||
return res; | ||
} | ||
var append = $$Array.append; | ||
function make_matrix(sx, sy, init) { | ||
var res = Caml_array.make(sx, []); | ||
for(var x = 0; x < sx; ++x){ | ||
res[x] = Caml_array.make(sy, init); | ||
} | ||
return res; | ||
} | ||
var concat = $$Array.concat; | ||
function copy(a) { | ||
var l = a.length; | ||
if (l === 0) { | ||
return []; | ||
} else { | ||
return Caml_array.sub(a, 0, l); | ||
} | ||
} | ||
var sub = $$Array.sub; | ||
function append(a1, a2) { | ||
var l1 = a1.length; | ||
if (l1 === 0) { | ||
return copy(a2); | ||
} else if (a2.length === 0) { | ||
return Caml_array.sub(a1, 0, l1); | ||
} else { | ||
return a1.concat(a2); | ||
} | ||
} | ||
var copy = $$Array.copy; | ||
function sub(a, ofs, len) { | ||
if (ofs < 0 || len < 0 || ofs > (a.length - len | 0)) { | ||
throw { | ||
RE_EXN_ID: "Invalid_argument", | ||
_1: "Array.sub", | ||
Error: new Error() | ||
}; | ||
} | ||
return Caml_array.sub(a, ofs, len); | ||
} | ||
var fill = $$Array.fill; | ||
function fill(a, ofs, len, v) { | ||
if (ofs < 0 || len < 0 || ofs > (a.length - len | 0)) { | ||
throw { | ||
RE_EXN_ID: "Invalid_argument", | ||
_1: "Array.fill", | ||
Error: new Error() | ||
}; | ||
} | ||
for(var i = ofs ,i_finish = ofs + len | 0; i < i_finish; ++i){ | ||
a[i] = v; | ||
} | ||
} | ||
var blit = $$Array.blit; | ||
function blit(a1, ofs1, a2, ofs2, len) { | ||
if (len < 0 || ofs1 < 0 || ofs1 > (a1.length - len | 0) || ofs2 < 0 || ofs2 > (a2.length - len | 0)) { | ||
throw { | ||
RE_EXN_ID: "Invalid_argument", | ||
_1: "Array.blit", | ||
Error: new Error() | ||
}; | ||
} | ||
Caml_array.blit(a1, ofs1, a2, ofs2, len); | ||
} | ||
var to_list = $$Array.to_list; | ||
function iter(f, a) { | ||
for(var i = 0 ,i_finish = a.length; i < i_finish; ++i){ | ||
Curry._1(f, a[i]); | ||
} | ||
} | ||
var of_list = $$Array.of_list; | ||
function iter2(f, a, b) { | ||
if (a.length !== b.length) { | ||
throw { | ||
RE_EXN_ID: "Invalid_argument", | ||
_1: "Array.iter2: arrays must have the same length", | ||
Error: new Error() | ||
}; | ||
} | ||
for(var i = 0 ,i_finish = a.length; i < i_finish; ++i){ | ||
Curry._2(f, a[i], b[i]); | ||
} | ||
} | ||
var iter = $$Array.iter; | ||
function map(f, a) { | ||
var l = a.length; | ||
if (l === 0) { | ||
return []; | ||
} | ||
var r = Caml_array.make(l, Curry._1(f, a[0])); | ||
for(var i = 1; i < l; ++i){ | ||
r[i] = Curry._1(f, a[i]); | ||
} | ||
return r; | ||
} | ||
var map = $$Array.map; | ||
function map2(f, a, b) { | ||
var la = a.length; | ||
var lb = b.length; | ||
if (la !== lb) { | ||
throw { | ||
RE_EXN_ID: "Invalid_argument", | ||
_1: "Array.map2: arrays must have the same length", | ||
Error: new Error() | ||
}; | ||
} | ||
if (la === 0) { | ||
return []; | ||
} | ||
var r = Caml_array.make(la, Curry._2(f, a[0], b[0])); | ||
for(var i = 1; i < la; ++i){ | ||
r[i] = Curry._2(f, a[i], b[i]); | ||
} | ||
return r; | ||
} | ||
var iteri = $$Array.iteri; | ||
function iteri(f, a) { | ||
for(var i = 0 ,i_finish = a.length; i < i_finish; ++i){ | ||
Curry._2(f, i, a[i]); | ||
} | ||
} | ||
var mapi = $$Array.mapi; | ||
function mapi(f, a) { | ||
var l = a.length; | ||
if (l === 0) { | ||
return []; | ||
} | ||
var r = Caml_array.make(l, Curry._2(f, 0, a[0])); | ||
for(var i = 1; i < l; ++i){ | ||
r[i] = Curry._2(f, i, a[i]); | ||
} | ||
return r; | ||
} | ||
var fold_left = $$Array.fold_left; | ||
function to_list(a) { | ||
var _i = a.length - 1 | 0; | ||
var _res = /* [] */0; | ||
while(true) { | ||
var res = _res; | ||
var i = _i; | ||
if (i < 0) { | ||
return res; | ||
} | ||
_res = { | ||
hd: a[i], | ||
tl: res | ||
}; | ||
_i = i - 1 | 0; | ||
continue ; | ||
}; | ||
} | ||
var fold_right = $$Array.fold_right; | ||
function list_length(_accu, _param) { | ||
while(true) { | ||
var param = _param; | ||
var accu = _accu; | ||
if (!param) { | ||
return accu; | ||
} | ||
_param = param.tl; | ||
_accu = accu + 1 | 0; | ||
continue ; | ||
}; | ||
} | ||
var iter2 = $$Array.iter2; | ||
function of_list(l) { | ||
if (!l) { | ||
return []; | ||
} | ||
var a = Caml_array.make(list_length(0, l), l.hd); | ||
var _i = 1; | ||
var _param = l.tl; | ||
while(true) { | ||
var param = _param; | ||
var i = _i; | ||
if (!param) { | ||
return a; | ||
} | ||
a[i] = param.hd; | ||
_param = param.tl; | ||
_i = i + 1 | 0; | ||
continue ; | ||
}; | ||
} | ||
var map2 = $$Array.map2; | ||
function fold_left(f, x, a) { | ||
var r = x; | ||
for(var i = 0 ,i_finish = a.length; i < i_finish; ++i){ | ||
r = Curry._2(f, r, a[i]); | ||
} | ||
return r; | ||
} | ||
var exists = $$Array.exists; | ||
function fold_right(f, a, x) { | ||
var r = x; | ||
for(var i = a.length - 1 | 0; i >= 0; --i){ | ||
r = Curry._2(f, a[i], r); | ||
} | ||
return r; | ||
} | ||
var for_all = $$Array.for_all; | ||
function exists(p, a) { | ||
var n = a.length; | ||
var _i = 0; | ||
while(true) { | ||
var i = _i; | ||
if (i === n) { | ||
return false; | ||
} | ||
if (Curry._1(p, a[i])) { | ||
return true; | ||
} | ||
_i = i + 1 | 0; | ||
continue ; | ||
}; | ||
} | ||
var mem = $$Array.mem; | ||
function for_all(p, a) { | ||
var n = a.length; | ||
var _i = 0; | ||
while(true) { | ||
var i = _i; | ||
if (i === n) { | ||
return true; | ||
} | ||
if (!Curry._1(p, a[i])) { | ||
return false; | ||
} | ||
_i = i + 1 | 0; | ||
continue ; | ||
}; | ||
} | ||
var memq = $$Array.memq; | ||
function mem(x, a) { | ||
var n = a.length; | ||
var _i = 0; | ||
while(true) { | ||
var i = _i; | ||
if (i === n) { | ||
return false; | ||
} | ||
if (Caml_obj.equal(a[i], x)) { | ||
return true; | ||
} | ||
_i = i + 1 | 0; | ||
continue ; | ||
}; | ||
} | ||
var make_float = $$Array.make_float; | ||
function memq(x, a) { | ||
var n = a.length; | ||
var _i = 0; | ||
while(true) { | ||
var i = _i; | ||
if (i === n) { | ||
return false; | ||
} | ||
if (x === a[i]) { | ||
return true; | ||
} | ||
_i = i + 1 | 0; | ||
continue ; | ||
}; | ||
} | ||
var sort = $$Array.sort; | ||
var Bottom = /* @__PURE__ */Caml_exceptions.create("ArrayLabels.Bottom"); | ||
var stable_sort = $$Array.stable_sort; | ||
function sort(cmp, a) { | ||
var maxson = function (l, i) { | ||
var i31 = ((i + i | 0) + i | 0) + 1 | 0; | ||
var x = i31; | ||
if ((i31 + 2 | 0) < l) { | ||
if (Curry._2(cmp, Caml_array.get(a, i31), Caml_array.get(a, i31 + 1 | 0)) < 0) { | ||
x = i31 + 1 | 0; | ||
} | ||
if (Curry._2(cmp, Caml_array.get(a, x), Caml_array.get(a, i31 + 2 | 0)) < 0) { | ||
x = i31 + 2 | 0; | ||
} | ||
return x; | ||
} | ||
if ((i31 + 1 | 0) < l && Curry._2(cmp, Caml_array.get(a, i31), Caml_array.get(a, i31 + 1 | 0)) < 0) { | ||
return i31 + 1 | 0; | ||
} | ||
if (i31 < l) { | ||
return i31; | ||
} | ||
throw { | ||
RE_EXN_ID: Bottom, | ||
_1: i, | ||
Error: new Error() | ||
}; | ||
}; | ||
var trickle = function (l, i, e) { | ||
try { | ||
var _i = i; | ||
while(true) { | ||
var i$1 = _i; | ||
var j = maxson(l, i$1); | ||
if (Curry._2(cmp, Caml_array.get(a, j), e) <= 0) { | ||
return Caml_array.set(a, i$1, e); | ||
} | ||
Caml_array.set(a, i$1, Caml_array.get(a, j)); | ||
_i = j; | ||
continue ; | ||
}; | ||
} | ||
catch (raw_i){ | ||
var i$2 = Caml_js_exceptions.internalToOCamlException(raw_i); | ||
if (i$2.RE_EXN_ID === Bottom) { | ||
return Caml_array.set(a, i$2._1, e); | ||
} | ||
throw i$2; | ||
} | ||
}; | ||
var bubble = function (l, i) { | ||
try { | ||
var _i = i; | ||
while(true) { | ||
var i$1 = _i; | ||
var j = maxson(l, i$1); | ||
Caml_array.set(a, i$1, Caml_array.get(a, j)); | ||
_i = j; | ||
continue ; | ||
}; | ||
} | ||
catch (raw_i){ | ||
var i$2 = Caml_js_exceptions.internalToOCamlException(raw_i); | ||
if (i$2.RE_EXN_ID === Bottom) { | ||
return i$2._1; | ||
} | ||
throw i$2; | ||
} | ||
}; | ||
var trickleup = function (_i, e) { | ||
while(true) { | ||
var i = _i; | ||
var father = (i - 1 | 0) / 3 | 0; | ||
if (i === father) { | ||
throw { | ||
RE_EXN_ID: "Assert_failure", | ||
_1: [ | ||
"arrayLabels.ml", | ||
236, | ||
4 | ||
], | ||
Error: new Error() | ||
}; | ||
} | ||
if (Curry._2(cmp, Caml_array.get(a, father), e) >= 0) { | ||
return Caml_array.set(a, i, e); | ||
} | ||
Caml_array.set(a, i, Caml_array.get(a, father)); | ||
if (father <= 0) { | ||
return Caml_array.set(a, 0, e); | ||
} | ||
_i = father; | ||
continue ; | ||
}; | ||
}; | ||
var l = a.length; | ||
for(var i = ((l + 1 | 0) / 3 | 0) - 1 | 0; i >= 0; --i){ | ||
trickle(l, i, Caml_array.get(a, i)); | ||
} | ||
for(var i$1 = l - 1 | 0; i$1 >= 2; --i$1){ | ||
var e = Caml_array.get(a, i$1); | ||
Caml_array.set(a, i$1, Caml_array.get(a, 0)); | ||
trickleup(bubble(i$1, 0), e); | ||
} | ||
if (l <= 1) { | ||
return ; | ||
} | ||
var e$1 = Caml_array.get(a, 1); | ||
Caml_array.set(a, 1, Caml_array.get(a, 0)); | ||
Caml_array.set(a, 0, e$1); | ||
} | ||
var fast_sort = $$Array.fast_sort; | ||
function stable_sort(cmp, a) { | ||
var merge = function (src1ofs, src1len, src2, src2ofs, src2len, dst, dstofs) { | ||
var src1r = src1ofs + src1len | 0; | ||
var src2r = src2ofs + src2len | 0; | ||
var _i1 = src1ofs; | ||
var _s1 = Caml_array.get(a, src1ofs); | ||
var _i2 = src2ofs; | ||
var _s2 = Caml_array.get(src2, src2ofs); | ||
var _d = dstofs; | ||
while(true) { | ||
var d = _d; | ||
var s2 = _s2; | ||
var i2 = _i2; | ||
var s1 = _s1; | ||
var i1 = _i1; | ||
if (Curry._2(cmp, s1, s2) <= 0) { | ||
Caml_array.set(dst, d, s1); | ||
var i1$1 = i1 + 1 | 0; | ||
if (i1$1 >= src1r) { | ||
return blit(src2, i2, dst, d + 1 | 0, src2r - i2 | 0); | ||
} | ||
_d = d + 1 | 0; | ||
_s1 = Caml_array.get(a, i1$1); | ||
_i1 = i1$1; | ||
continue ; | ||
} | ||
Caml_array.set(dst, d, s2); | ||
var i2$1 = i2 + 1 | 0; | ||
if (i2$1 >= src2r) { | ||
return blit(a, i1, dst, d + 1 | 0, src1r - i1 | 0); | ||
} | ||
_d = d + 1 | 0; | ||
_s2 = Caml_array.get(src2, i2$1); | ||
_i2 = i2$1; | ||
continue ; | ||
}; | ||
}; | ||
var isortto = function (srcofs, dst, dstofs, len) { | ||
for(var i = 0; i < len; ++i){ | ||
var e = Caml_array.get(a, srcofs + i | 0); | ||
var j = (dstofs + i | 0) - 1 | 0; | ||
while(j >= dstofs && Curry._2(cmp, Caml_array.get(dst, j), e) > 0) { | ||
Caml_array.set(dst, j + 1 | 0, Caml_array.get(dst, j)); | ||
j = j - 1 | 0; | ||
}; | ||
Caml_array.set(dst, j + 1 | 0, e); | ||
} | ||
}; | ||
var sortto = function (srcofs, dst, dstofs, len) { | ||
if (len <= 5) { | ||
return isortto(srcofs, dst, dstofs, len); | ||
} | ||
var l1 = len / 2 | 0; | ||
var l2 = len - l1 | 0; | ||
sortto(srcofs + l1 | 0, dst, dstofs + l1 | 0, l2); | ||
sortto(srcofs, a, srcofs + l2 | 0, l1); | ||
merge(srcofs + l2 | 0, l1, dst, dstofs + l1 | 0, l2, dst, dstofs); | ||
}; | ||
var l = a.length; | ||
if (l <= 5) { | ||
return isortto(0, a, 0, l); | ||
} | ||
var l1 = l / 2 | 0; | ||
var l2 = l - l1 | 0; | ||
var t = Caml_array.make(l2, Caml_array.get(a, 0)); | ||
sortto(l1, t, 0, l2); | ||
sortto(0, a, l2, l1); | ||
merge(l2, l1, t, 0, l2, a, 0); | ||
} | ||
var Floatarray = $$Array.Floatarray; | ||
var create_matrix = make_matrix; | ||
var concat = Caml_array.concat; | ||
var fast_sort = stable_sort; | ||
export { | ||
@@ -90,4 +510,3 @@ init , | ||
Floatarray , | ||
} | ||
/* No side effect */ |
@@ -21,4 +21,4 @@ | ||
"belt_Array.ml", | ||
27, | ||
4 | ||
35, | ||
2 | ||
], | ||
@@ -46,3 +46,3 @@ Error: new Error() | ||
"belt_Array.ml", | ||
33, | ||
45, | ||
2 | ||
@@ -54,3 +54,2 @@ ], | ||
arr[i] = v; | ||
} | ||
@@ -62,3 +61,2 @@ | ||
xs[j] = tmp; | ||
} | ||
@@ -71,3 +69,2 @@ | ||
} | ||
} | ||
@@ -87,3 +84,2 @@ | ||
} | ||
} | ||
@@ -228,3 +224,3 @@ | ||
var lena = a.length; | ||
var ofs = offset < 0 ? Caml.caml_int_max(lena + offset | 0, 0) : offset; | ||
var ofs = offset < 0 ? Caml.int_max(lena + offset | 0, 0) : offset; | ||
var hasLen = lena - ofs | 0; | ||
@@ -244,4 +240,4 @@ var copyLength = hasLen < len ? hasLen : len; | ||
var lena = a.length; | ||
var ofs = offset < 0 ? Caml.caml_int_max(lena + offset | 0, 0) : offset; | ||
var len = lena - ofs | 0; | ||
var ofs = offset < 0 ? Caml.int_max(lena + offset | 0, 0) : offset; | ||
var len = lena > ofs ? lena - ofs | 0 : 0; | ||
var result = new Array(len); | ||
@@ -259,3 +255,3 @@ for(var i = 0; i < len; ++i){ | ||
var lena = a.length; | ||
var ofs = offset < 0 ? Caml.caml_int_max(lena + offset | 0, 0) : offset; | ||
var ofs = offset < 0 ? Caml.int_max(lena + offset | 0, 0) : offset; | ||
var hasLen = lena - ofs | 0; | ||
@@ -269,3 +265,2 @@ var fillLength = hasLen < len ? hasLen : len; | ||
} | ||
} | ||
@@ -283,3 +278,2 @@ | ||
} | ||
} | ||
@@ -290,5 +284,5 @@ | ||
var lena2 = a2.length; | ||
var srcofs1 = ofs1 < 0 ? Caml.caml_int_max(lena1 + ofs1 | 0, 0) : ofs1; | ||
var srcofs2 = ofs2 < 0 ? Caml.caml_int_max(lena2 + ofs2 | 0, 0) : ofs2; | ||
var blitLength = Caml.caml_int_min(len, Caml.caml_int_min(lena1 - srcofs1 | 0, lena2 - srcofs2 | 0)); | ||
var srcofs1 = ofs1 < 0 ? Caml.int_max(lena1 + ofs1 | 0, 0) : ofs1; | ||
var srcofs2 = ofs2 < 0 ? Caml.int_max(lena2 + ofs2 | 0, 0) : ofs2; | ||
var blitLength = Caml.int_min(len, Caml.int_min(lena1 - srcofs1 | 0, lena2 - srcofs2 | 0)); | ||
if (srcofs2 <= srcofs1) { | ||
@@ -303,3 +297,2 @@ for(var j = 0; j < blitLength; ++j){ | ||
} | ||
} | ||
@@ -311,7 +304,6 @@ | ||
} | ||
} | ||
function forEach(a, f) { | ||
return forEachU(a, Curry.__1(f)); | ||
forEachU(a, Curry.__1(f)); | ||
} | ||
@@ -332,2 +324,10 @@ | ||
function flatMapU(a, f) { | ||
return concatMany(mapU(a, f)); | ||
} | ||
function flatMap(a, f) { | ||
return concatMany(mapU(a, Curry.__1(f))); | ||
} | ||
function getByU(a, p) { | ||
@@ -434,7 +434,6 @@ var l = a.length; | ||
} | ||
} | ||
function forEachWithIndex(a, f) { | ||
return forEachWithIndexU(a, Curry.__2(f)); | ||
forEachWithIndexU(a, Curry.__2(f)); | ||
} | ||
@@ -481,3 +480,3 @@ | ||
var r = x; | ||
var len = Caml.caml_int_min(a.length, b.length); | ||
var len = Caml.int_min(a.length, b.length); | ||
for(var i = len - 1 | 0; i >= 0; --i){ | ||
@@ -560,3 +559,3 @@ r = f(r, a[i], b[i]); | ||
function every2U(a, b, p) { | ||
return everyAux2(a, b, 0, p, Caml.caml_int_min(a.length, b.length)); | ||
return everyAux2(a, b, 0, p, Caml.int_min(a.length, b.length)); | ||
} | ||
@@ -570,3 +569,3 @@ | ||
var _i = 0; | ||
var len = Caml.caml_int_min(a.length, b.length); | ||
var len = Caml.int_min(a.length, b.length); | ||
while(true) { | ||
@@ -698,2 +697,14 @@ var i = _i; | ||
function initU(n, f) { | ||
var v = new Array(n); | ||
for(var i = 0; i < n; ++i){ | ||
v[i] = f(i); | ||
} | ||
return v; | ||
} | ||
function init(n, f) { | ||
return initU(n, Curry.__1(f)); | ||
} | ||
export { | ||
@@ -730,2 +741,4 @@ get , | ||
map , | ||
flatMapU , | ||
flatMap , | ||
getByU , | ||
@@ -769,4 +782,5 @@ getBy , | ||
eq , | ||
initU , | ||
init , | ||
} | ||
/* No side effect */ |
@@ -15,4 +15,3 @@ | ||
fromString , | ||
} | ||
/* No side effect */ |
@@ -95,3 +95,3 @@ | ||
function set(h, key, value) { | ||
return set0(h, key, value, h.eq, h.hash); | ||
set0(h, key, value, h.eq, h.hash); | ||
} | ||
@@ -221,3 +221,2 @@ | ||
} | ||
} | ||
@@ -282,4 +281,3 @@ | ||
logStats , | ||
} | ||
/* No side effect */ |
@@ -14,3 +14,3 @@ | ||
} | ||
var nidx = Caml_hash_primitive.caml_hash_final_mix(Caml_hash_primitive.caml_hash_mix_int(0, old_bucket.key)) & (h_buckets.length - 1 | 0); | ||
var nidx = Caml_hash_primitive.hash_final_mix(Caml_hash_primitive.hash_mix_int(0, old_bucket.key)) & (h_buckets.length - 1 | 0); | ||
var tail = ndata_tail[nidx]; | ||
@@ -47,3 +47,3 @@ if (tail !== undefined) { | ||
var buckets_len = h_buckets.length; | ||
var i = Caml_hash_primitive.caml_hash_final_mix(Caml_hash_primitive.caml_hash_mix_int(0, key)) & (buckets_len - 1 | 0); | ||
var i = Caml_hash_primitive.hash_final_mix(Caml_hash_primitive.hash_mix_int(0, key)) & (buckets_len - 1 | 0); | ||
var l = h_buckets[i]; | ||
@@ -95,3 +95,3 @@ if (l !== undefined) { | ||
var h_buckets = h.buckets; | ||
var i = Caml_hash_primitive.caml_hash_final_mix(Caml_hash_primitive.caml_hash_mix_int(0, key)) & (h_buckets.length - 1 | 0); | ||
var i = Caml_hash_primitive.hash_final_mix(Caml_hash_primitive.hash_mix_int(0, key)) & (h_buckets.length - 1 | 0); | ||
var bucket = h_buckets[i]; | ||
@@ -129,3 +129,3 @@ if (bucket !== undefined) { | ||
var h_buckets = h.buckets; | ||
var nid = Caml_hash_primitive.caml_hash_final_mix(Caml_hash_primitive.caml_hash_mix_int(0, key)) & (h_buckets.length - 1 | 0); | ||
var nid = Caml_hash_primitive.hash_final_mix(Caml_hash_primitive.hash_mix_int(0, key)) & (h_buckets.length - 1 | 0); | ||
var cell1 = h_buckets[nid]; | ||
@@ -169,3 +169,3 @@ if (cell1 === undefined) { | ||
var h_buckets = h.buckets; | ||
var nid = Caml_hash_primitive.caml_hash_final_mix(Caml_hash_primitive.caml_hash_mix_int(0, key)) & (h_buckets.length - 1 | 0); | ||
var nid = Caml_hash_primitive.hash_final_mix(Caml_hash_primitive.hash_mix_int(0, key)) & (h_buckets.length - 1 | 0); | ||
var bucket = h_buckets[nid]; | ||
@@ -215,3 +215,2 @@ if (bucket !== undefined) { | ||
} | ||
} | ||
@@ -270,4 +269,3 @@ | ||
logStats , | ||
} | ||
/* No side effect */ |
@@ -14,3 +14,3 @@ | ||
} | ||
var nidx = Caml_hash_primitive.caml_hash_final_mix(Caml_hash_primitive.caml_hash_mix_string(0, old_bucket.key)) & (h_buckets.length - 1 | 0); | ||
var nidx = Caml_hash_primitive.hash_final_mix(Caml_hash_primitive.hash_mix_string(0, old_bucket.key)) & (h_buckets.length - 1 | 0); | ||
var tail = ndata_tail[nidx]; | ||
@@ -47,3 +47,3 @@ if (tail !== undefined) { | ||
var buckets_len = h_buckets.length; | ||
var i = Caml_hash_primitive.caml_hash_final_mix(Caml_hash_primitive.caml_hash_mix_string(0, key)) & (buckets_len - 1 | 0); | ||
var i = Caml_hash_primitive.hash_final_mix(Caml_hash_primitive.hash_mix_string(0, key)) & (buckets_len - 1 | 0); | ||
var l = h_buckets[i]; | ||
@@ -95,3 +95,3 @@ if (l !== undefined) { | ||
var h_buckets = h.buckets; | ||
var i = Caml_hash_primitive.caml_hash_final_mix(Caml_hash_primitive.caml_hash_mix_string(0, key)) & (h_buckets.length - 1 | 0); | ||
var i = Caml_hash_primitive.hash_final_mix(Caml_hash_primitive.hash_mix_string(0, key)) & (h_buckets.length - 1 | 0); | ||
var bucket = h_buckets[i]; | ||
@@ -129,3 +129,3 @@ if (bucket !== undefined) { | ||
var h_buckets = h.buckets; | ||
var nid = Caml_hash_primitive.caml_hash_final_mix(Caml_hash_primitive.caml_hash_mix_string(0, key)) & (h_buckets.length - 1 | 0); | ||
var nid = Caml_hash_primitive.hash_final_mix(Caml_hash_primitive.hash_mix_string(0, key)) & (h_buckets.length - 1 | 0); | ||
var cell1 = h_buckets[nid]; | ||
@@ -169,3 +169,3 @@ if (cell1 === undefined) { | ||
var h_buckets = h.buckets; | ||
var nid = Caml_hash_primitive.caml_hash_final_mix(Caml_hash_primitive.caml_hash_mix_string(0, key)) & (h_buckets.length - 1 | 0); | ||
var nid = Caml_hash_primitive.hash_final_mix(Caml_hash_primitive.hash_mix_string(0, key)) & (h_buckets.length - 1 | 0); | ||
var bucket = h_buckets[nid]; | ||
@@ -215,3 +215,2 @@ if (bucket !== undefined) { | ||
} | ||
} | ||
@@ -270,4 +269,3 @@ | ||
logStats , | ||
} | ||
/* No side effect */ |
@@ -122,3 +122,3 @@ | ||
function add(h, key) { | ||
return add0(h, key, h.hash, h.eq); | ||
add0(h, key, h.hash, h.eq); | ||
} | ||
@@ -176,3 +176,2 @@ | ||
} | ||
} | ||
@@ -224,4 +223,3 @@ | ||
getBucketHistogram , | ||
} | ||
/* No side effect */ |
@@ -13,3 +13,3 @@ | ||
} | ||
var nidx = Caml_hash_primitive.caml_hash_final_mix(Caml_hash_primitive.caml_hash_mix_int(0, old_bucket.key)) & (h_buckets.length - 1 | 0); | ||
var nidx = Caml_hash_primitive.hash_final_mix(Caml_hash_primitive.hash_mix_int(0, old_bucket.key)) & (h_buckets.length - 1 | 0); | ||
var tail = ndata_tail[nidx]; | ||
@@ -29,3 +29,3 @@ if (tail !== undefined) { | ||
var h_buckets = h.buckets; | ||
var i = Caml_hash_primitive.caml_hash_final_mix(Caml_hash_primitive.caml_hash_mix_int(0, key)) & (h_buckets.length - 1 | 0); | ||
var i = Caml_hash_primitive.hash_final_mix(Caml_hash_primitive.hash_mix_int(0, key)) & (h_buckets.length - 1 | 0); | ||
var l = h_buckets[i]; | ||
@@ -87,3 +87,3 @@ if (l === undefined) { | ||
var buckets_len = h_buckets.length; | ||
var i = Caml_hash_primitive.caml_hash_final_mix(Caml_hash_primitive.caml_hash_mix_int(0, key)) & (buckets_len - 1 | 0); | ||
var i = Caml_hash_primitive.hash_final_mix(Caml_hash_primitive.hash_mix_int(0, key)) & (buckets_len - 1 | 0); | ||
var l = h_buckets[i]; | ||
@@ -126,3 +126,3 @@ if (l !== undefined) { | ||
var h_buckets = h.buckets; | ||
var nid = Caml_hash_primitive.caml_hash_final_mix(Caml_hash_primitive.caml_hash_mix_int(0, key)) & (h_buckets.length - 1 | 0); | ||
var nid = Caml_hash_primitive.hash_final_mix(Caml_hash_primitive.hash_mix_int(0, key)) & (h_buckets.length - 1 | 0); | ||
var bucket = h_buckets[nid]; | ||
@@ -170,3 +170,2 @@ if (bucket !== undefined) { | ||
} | ||
} | ||
@@ -212,4 +211,3 @@ | ||
getBucketHistogram , | ||
} | ||
/* No side effect */ |
@@ -13,3 +13,3 @@ | ||
} | ||
var nidx = Caml_hash_primitive.caml_hash_final_mix(Caml_hash_primitive.caml_hash_mix_string(0, old_bucket.key)) & (h_buckets.length - 1 | 0); | ||
var nidx = Caml_hash_primitive.hash_final_mix(Caml_hash_primitive.hash_mix_string(0, old_bucket.key)) & (h_buckets.length - 1 | 0); | ||
var tail = ndata_tail[nidx]; | ||
@@ -29,3 +29,3 @@ if (tail !== undefined) { | ||
var h_buckets = h.buckets; | ||
var i = Caml_hash_primitive.caml_hash_final_mix(Caml_hash_primitive.caml_hash_mix_string(0, key)) & (h_buckets.length - 1 | 0); | ||
var i = Caml_hash_primitive.hash_final_mix(Caml_hash_primitive.hash_mix_string(0, key)) & (h_buckets.length - 1 | 0); | ||
var l = h_buckets[i]; | ||
@@ -87,3 +87,3 @@ if (l === undefined) { | ||
var buckets_len = h_buckets.length; | ||
var i = Caml_hash_primitive.caml_hash_final_mix(Caml_hash_primitive.caml_hash_mix_string(0, key)) & (buckets_len - 1 | 0); | ||
var i = Caml_hash_primitive.hash_final_mix(Caml_hash_primitive.hash_mix_string(0, key)) & (buckets_len - 1 | 0); | ||
var l = h_buckets[i]; | ||
@@ -126,3 +126,3 @@ if (l !== undefined) { | ||
var h_buckets = h.buckets; | ||
var nid = Caml_hash_primitive.caml_hash_final_mix(Caml_hash_primitive.caml_hash_mix_string(0, key)) & (h_buckets.length - 1 | 0); | ||
var nid = Caml_hash_primitive.hash_final_mix(Caml_hash_primitive.hash_mix_string(0, key)) & (h_buckets.length - 1 | 0); | ||
var bucket = h_buckets[nid]; | ||
@@ -170,3 +170,2 @@ if (bucket !== undefined) { | ||
} | ||
} | ||
@@ -212,4 +211,3 @@ | ||
getBucketHistogram , | ||
} | ||
/* No side effect */ |
@@ -70,4 +70,3 @@ | ||
hashable , | ||
} | ||
/* No side effect */ |
@@ -15,4 +15,3 @@ | ||
fromString , | ||
} | ||
/* No side effect */ |
@@ -181,3 +181,3 @@ | ||
function forEach(n, f) { | ||
return forEachU(n, Curry.__1(f)); | ||
forEachU(n, Curry.__1(f)); | ||
} | ||
@@ -940,4 +940,3 @@ | ||
removeMinAuxWithRootMutate , | ||
} | ||
/* No side effect */ |
@@ -290,3 +290,3 @@ | ||
function forEach(n, f) { | ||
return forEachU(n, Curry.__2(f)); | ||
forEachU(n, Curry.__2(f)); | ||
} | ||
@@ -1146,4 +1146,3 @@ | ||
removeMinAuxWithRootMutate , | ||
} | ||
/* No side effect */ |
@@ -87,7 +87,6 @@ | ||
} | ||
} | ||
function forEach(h, f) { | ||
return forEachU(h, Curry.__2(f)); | ||
forEachU(h, Curry.__2(f)); | ||
} | ||
@@ -140,3 +139,2 @@ | ||
histo[l] = histo[l] + 1 | 0; | ||
})); | ||
@@ -153,3 +151,2 @@ return histo; | ||
}); | ||
} | ||
@@ -201,7 +198,6 @@ | ||
} | ||
} | ||
function keepMapInPlace(h, f) { | ||
return keepMapInPlaceU(h, Curry.__2(f)); | ||
keepMapInPlaceU(h, Curry.__2(f)); | ||
} | ||
@@ -294,4 +290,3 @@ | ||
getBucketHistogram , | ||
} | ||
/* No side effect */ |
@@ -35,3 +35,2 @@ | ||
} | ||
} | ||
@@ -50,4 +49,3 @@ | ||
isEmpty , | ||
} | ||
/* No side effect */ |
@@ -227,3 +227,3 @@ | ||
var h1 = e1.hd; | ||
var c = Caml.caml_int_compare(h1.k, h2.k); | ||
var c = Caml.int_compare(h1.k, h2.k); | ||
if (c !== 0) { | ||
@@ -365,4 +365,3 @@ return c; | ||
fromArray , | ||
} | ||
/* No side effect */ |
@@ -227,3 +227,3 @@ | ||
var h1 = e1.hd; | ||
var c = Caml.caml_string_compare(h1.k, h2.k); | ||
var c = Caml.string_compare(h1.k, h2.k); | ||
if (c !== 0) { | ||
@@ -365,4 +365,3 @@ return c; | ||
fromArray , | ||
} | ||
/* No side effect */ |
@@ -84,7 +84,6 @@ | ||
} | ||
} | ||
function forEach(h, f) { | ||
return forEachU(h, Curry.__1(f)); | ||
forEachU(h, Curry.__1(f)); | ||
} | ||
@@ -166,3 +165,2 @@ | ||
histo[l] = histo[l] + 1 | 0; | ||
})); | ||
@@ -179,3 +177,2 @@ return histo; | ||
}); | ||
} | ||
@@ -196,4 +193,3 @@ | ||
getBucketHistogram , | ||
} | ||
/* No side effect */ |
@@ -208,4 +208,3 @@ | ||
fromArray , | ||
} | ||
/* No side effect */ |
@@ -208,4 +208,3 @@ | ||
fromArray , | ||
} | ||
/* No side effect */ |
@@ -777,3 +777,3 @@ | ||
function forEach(xs, f) { | ||
return forEachU(xs, Curry.__1(f)); | ||
forEachU(xs, Curry.__1(f)); | ||
} | ||
@@ -798,3 +798,3 @@ | ||
function forEachWithIndex(l, f) { | ||
return forEachWithIndexU(l, Curry.__2(f)); | ||
forEachWithIndexU(l, Curry.__2(f)); | ||
} | ||
@@ -908,3 +908,3 @@ | ||
function forEach2(l1, l2, f) { | ||
return forEach2U(l1, l2, Curry.__2(f)); | ||
forEach2U(l1, l2, Curry.__2(f)); | ||
} | ||
@@ -1514,4 +1514,3 @@ | ||
sort , | ||
} | ||
/* No side effect */ |
@@ -116,7 +116,7 @@ | ||
function forEachU(m, f) { | ||
return Belt_MapDict.forEachU(m.data, f); | ||
Belt_MapDict.forEachU(m.data, f); | ||
} | ||
function forEach(m, f) { | ||
return Belt_MapDict.forEachU(m.data, Curry.__2(f)); | ||
Belt_MapDict.forEachU(m.data, Curry.__2(f)); | ||
} | ||
@@ -273,3 +273,3 @@ | ||
function checkInvariantInternal(m) { | ||
return Belt_MapDict.checkInvariantInternal(m.data); | ||
Belt_MapDict.checkInvariantInternal(m.data); | ||
} | ||
@@ -377,4 +377,3 @@ | ||
checkInvariantInternal , | ||
} | ||
/* No side effect */ |
@@ -416,4 +416,3 @@ | ||
mapWithKey , | ||
} | ||
/* No side effect */ |
@@ -306,4 +306,3 @@ | ||
mapWithKey , | ||
} | ||
/* No side effect */ |
@@ -306,4 +306,3 @@ | ||
mapWithKey , | ||
} | ||
/* No side effect */ |
@@ -140,3 +140,3 @@ | ||
function update(t, x, f) { | ||
return updateU(t, x, Curry.__1(f)); | ||
updateU(t, x, Curry.__1(f)); | ||
} | ||
@@ -153,3 +153,2 @@ | ||
m.data = undefined; | ||
} | ||
@@ -195,7 +194,7 @@ | ||
function forEachU(d, f) { | ||
return Belt_internalAVLtree.forEachU(d.data, f); | ||
Belt_internalAVLtree.forEachU(d.data, f); | ||
} | ||
function forEach(d, f) { | ||
return Belt_internalAVLtree.forEachU(d.data, Curry.__2(f)); | ||
Belt_internalAVLtree.forEachU(d.data, Curry.__2(f)); | ||
} | ||
@@ -248,3 +247,3 @@ | ||
function checkInvariantInternal(d) { | ||
return Belt_internalAVLtree.checkInvariantInternal(d.data); | ||
Belt_internalAVLtree.checkInvariantInternal(d.data); | ||
} | ||
@@ -399,4 +398,3 @@ | ||
mapWithKey , | ||
} | ||
/* No side effect */ |
@@ -21,3 +21,2 @@ | ||
m.data = undefined; | ||
} | ||
@@ -68,7 +67,7 @@ | ||
function forEachU(d, f) { | ||
return Belt_internalAVLtree.forEachU(d.data, f); | ||
Belt_internalAVLtree.forEachU(d.data, f); | ||
} | ||
function forEach(d, f) { | ||
return Belt_internalAVLtree.forEachU(d.data, Curry.__2(f)); | ||
Belt_internalAVLtree.forEachU(d.data, Curry.__2(f)); | ||
} | ||
@@ -141,3 +140,3 @@ | ||
function checkInvariantInternal(d) { | ||
return Belt_internalAVLtree.checkInvariantInternal(d.data); | ||
Belt_internalAVLtree.checkInvariantInternal(d.data); | ||
} | ||
@@ -247,3 +246,3 @@ | ||
function update(t, x, f) { | ||
return updateU(t, x, Curry.__1(f)); | ||
updateU(t, x, Curry.__1(f)); | ||
} | ||
@@ -366,4 +365,3 @@ | ||
mapWithKey , | ||
} | ||
/* No side effect */ |
@@ -21,3 +21,2 @@ | ||
m.data = undefined; | ||
} | ||
@@ -68,7 +67,7 @@ | ||
function forEachU(d, f) { | ||
return Belt_internalAVLtree.forEachU(d.data, f); | ||
Belt_internalAVLtree.forEachU(d.data, f); | ||
} | ||
function forEach(d, f) { | ||
return Belt_internalAVLtree.forEachU(d.data, Curry.__2(f)); | ||
Belt_internalAVLtree.forEachU(d.data, Curry.__2(f)); | ||
} | ||
@@ -141,3 +140,3 @@ | ||
function checkInvariantInternal(d) { | ||
return Belt_internalAVLtree.checkInvariantInternal(d.data); | ||
Belt_internalAVLtree.checkInvariantInternal(d.data); | ||
} | ||
@@ -247,3 +246,3 @@ | ||
function update(t, x, f) { | ||
return updateU(t, x, Curry.__1(f)); | ||
updateU(t, x, Curry.__1(f)); | ||
} | ||
@@ -366,4 +365,3 @@ | ||
mapWithKey , | ||
} | ||
/* No side effect */ |
@@ -18,3 +18,2 @@ | ||
q.last = undefined; | ||
} | ||
@@ -37,3 +36,2 @@ | ||
} | ||
} | ||
@@ -207,3 +205,3 @@ | ||
function forEach(q, f) { | ||
return forEachU(q, Curry.__1(f)); | ||
forEachU(q, Curry.__1(f)); | ||
} | ||
@@ -303,4 +301,3 @@ | ||
toArray , | ||
} | ||
/* No side effect */ |
@@ -80,3 +80,2 @@ | ||
d.data = removeMany0(oldRoot, xs, 0, len, d.cmp); | ||
} | ||
@@ -188,3 +187,2 @@ | ||
d.data = addArrayMutate(d.data, xs, d.cmp); | ||
} | ||
@@ -221,7 +219,7 @@ | ||
function forEachU(d, f) { | ||
return Belt_internalAVLset.forEachU(d.data, f); | ||
Belt_internalAVLset.forEachU(d.data, f); | ||
} | ||
function forEach(d, f) { | ||
return Belt_internalAVLset.forEachU(d.data, Curry.__1(f)); | ||
Belt_internalAVLset.forEachU(d.data, Curry.__1(f)); | ||
} | ||
@@ -273,3 +271,3 @@ | ||
function checkInvariantInternal(d) { | ||
return Belt_internalAVLset.checkInvariantInternal(d.data); | ||
Belt_internalAVLset.checkInvariantInternal(d.data); | ||
} | ||
@@ -543,4 +541,3 @@ | ||
checkInvariantInternal , | ||
} | ||
/* No side effect */ |
@@ -80,3 +80,2 @@ | ||
d.data = removeMany0(oldRoot, xs, 0, len); | ||
} | ||
@@ -186,3 +185,2 @@ | ||
d.data = addArrayMutate(d.data, arr); | ||
} | ||
@@ -218,7 +216,7 @@ | ||
function forEachU(d, f) { | ||
return Belt_internalAVLset.forEachU(d.data, f); | ||
Belt_internalAVLset.forEachU(d.data, f); | ||
} | ||
function forEach(d, f) { | ||
return Belt_internalAVLset.forEachU(d.data, Curry.__1(f)); | ||
Belt_internalAVLset.forEachU(d.data, Curry.__1(f)); | ||
} | ||
@@ -269,3 +267,3 @@ | ||
function checkInvariantInternal(d) { | ||
return Belt_internalAVLset.checkInvariantInternal(d.data); | ||
Belt_internalAVLset.checkInvariantInternal(d.data); | ||
} | ||
@@ -506,4 +504,3 @@ | ||
checkInvariantInternal , | ||
} | ||
/* No side effect */ |
@@ -80,3 +80,2 @@ | ||
d.data = removeMany0(oldRoot, xs, 0, len); | ||
} | ||
@@ -186,3 +185,2 @@ | ||
d.data = addArrayMutate(d.data, arr); | ||
} | ||
@@ -218,7 +216,7 @@ | ||
function forEachU(d, f) { | ||
return Belt_internalAVLset.forEachU(d.data, f); | ||
Belt_internalAVLset.forEachU(d.data, f); | ||
} | ||
function forEach(d, f) { | ||
return Belt_internalAVLset.forEachU(d.data, Curry.__1(f)); | ||
Belt_internalAVLset.forEachU(d.data, Curry.__1(f)); | ||
} | ||
@@ -269,3 +267,3 @@ | ||
function checkInvariantInternal(d) { | ||
return Belt_internalAVLset.checkInvariantInternal(d.data); | ||
Belt_internalAVLset.checkInvariantInternal(d.data); | ||
} | ||
@@ -506,4 +504,3 @@ | ||
checkInvariantInternal , | ||
} | ||
/* No side effect */ |
@@ -14,3 +14,2 @@ | ||
s.root = undefined; | ||
} | ||
@@ -29,3 +28,2 @@ | ||
}; | ||
} | ||
@@ -106,3 +104,3 @@ | ||
function forEach(s, f) { | ||
return forEachU(s, Curry.__1(f)); | ||
forEachU(s, Curry.__1(f)); | ||
} | ||
@@ -123,3 +121,3 @@ | ||
function dynamicPopIter(s, f) { | ||
return dynamicPopIterU(s, Curry.__1(f)); | ||
dynamicPopIterU(s, Curry.__1(f)); | ||
} | ||
@@ -142,4 +140,3 @@ | ||
dynamicPopIter , | ||
} | ||
/* No side effect */ |
@@ -25,3 +25,3 @@ | ||
function forEach(opt, f) { | ||
return forEachU(opt, Curry.__1(f)); | ||
forEachU(opt, Curry.__1(f)); | ||
} | ||
@@ -81,2 +81,10 @@ | ||
function orElse(opt, other) { | ||
if (opt !== undefined) { | ||
return opt; | ||
} else { | ||
return other; | ||
} | ||
} | ||
function isSome(param) { | ||
@@ -137,2 +145,3 @@ return param !== undefined; | ||
getWithDefault , | ||
orElse , | ||
isSome , | ||
@@ -144,4 +153,3 @@ isNone , | ||
cmp , | ||
} | ||
/* No side effect */ |
@@ -9,7 +9,6 @@ | ||
} | ||
} | ||
function forEach(s, f, action) { | ||
return forEachU(s, f, Curry.__1(action)); | ||
forEachU(s, f, Curry.__1(action)); | ||
} | ||
@@ -110,4 +109,3 @@ | ||
someBy , | ||
} | ||
/* No side effect */ |
@@ -135,4 +135,3 @@ | ||
cmp , | ||
} | ||
/* No side effect */ |
@@ -127,7 +127,7 @@ | ||
function forEachU(m, f) { | ||
return Belt_SetDict.forEachU(m.data, f); | ||
Belt_SetDict.forEachU(m.data, f); | ||
} | ||
function forEach(m, f) { | ||
return Belt_SetDict.forEachU(m.data, Curry.__1(f)); | ||
Belt_SetDict.forEachU(m.data, Curry.__1(f)); | ||
} | ||
@@ -259,3 +259,3 @@ | ||
function checkInvariantInternal(d) { | ||
return Belt_SetDict.checkInvariantInternal(d.data); | ||
Belt_SetDict.checkInvariantInternal(d.data); | ||
} | ||
@@ -315,4 +315,3 @@ | ||
packIdData , | ||
} | ||
/* No side effect */ |
@@ -361,4 +361,3 @@ | ||
checkInvariantInternal , | ||
} | ||
/* No side effect */ |
@@ -358,4 +358,3 @@ | ||
checkInvariantInternal , | ||
} | ||
/* No side effect */ |
@@ -358,4 +358,3 @@ | ||
checkInvariantInternal , | ||
} | ||
/* No side effect */ |
@@ -309,3 +309,2 @@ | ||
} | ||
} | ||
@@ -321,3 +320,3 @@ | ||
sortTo(src, srcofs, src, srcofs + l2 | 0, l1, cmp); | ||
return merge(src, srcofs + l2 | 0, l1, dst, dstofs + l1 | 0, l2, dst, dstofs, cmp); | ||
merge(src, srcofs + l2 | 0, l1, dst, dstofs + l1 | 0, l2, dst, dstofs, cmp); | ||
} | ||
@@ -335,7 +334,7 @@ | ||
sortTo(a, 0, a, l2, l1, cmp); | ||
return merge(a, l2, l1, t, 0, l2, a, 0, cmp); | ||
merge(a, l2, l1, t, 0, l2, a, 0, cmp); | ||
} | ||
function stableSortInPlaceBy(a, cmp) { | ||
return stableSortInPlaceByU(a, Curry.__2(cmp)); | ||
stableSortInPlaceByU(a, Curry.__2(cmp)); | ||
} | ||
@@ -430,4 +429,3 @@ | ||
diff , | ||
} | ||
/* No side effect */ |
@@ -285,3 +285,2 @@ | ||
} | ||
} | ||
@@ -297,3 +296,3 @@ | ||
sortTo(src, srcofs, src, srcofs + l2 | 0, l1); | ||
return merge(src, srcofs + l2 | 0, l1, dst, dstofs + l1 | 0, l2, dst, dstofs); | ||
merge(src, srcofs + l2 | 0, l1, dst, dstofs + l1 | 0, l2, dst, dstofs); | ||
} | ||
@@ -311,3 +310,3 @@ | ||
sortTo(a, 0, a, l2, l1); | ||
return merge(a, l2, l1, t, 0, l2, a, 0); | ||
merge(a, l2, l1, t, 0, l2, a, 0); | ||
} | ||
@@ -377,4 +376,3 @@ | ||
diff , | ||
} | ||
/* No side effect */ |
@@ -285,3 +285,2 @@ | ||
} | ||
} | ||
@@ -297,3 +296,3 @@ | ||
sortTo(src, srcofs, src, srcofs + l2 | 0, l1); | ||
return merge(src, srcofs + l2 | 0, l1, dst, dstofs + l1 | 0, l2, dst, dstofs); | ||
merge(src, srcofs + l2 | 0, l1, dst, dstofs + l1 | 0, l2, dst, dstofs); | ||
} | ||
@@ -311,3 +310,3 @@ | ||
sortTo(a, 0, a, l2, l1); | ||
return merge(a, l2, l1, t, 0, l2, a, 0); | ||
merge(a, l2, l1, t, 0, l2, a, 0); | ||
} | ||
@@ -377,4 +376,3 @@ | ||
diff , | ||
} | ||
/* No side effect */ |
@@ -56,4 +56,3 @@ | ||
Float , | ||
} | ||
/* No side effect */ |
@@ -7,3 +7,2 @@ | ||
import * as Caml_bytes from "./caml_bytes.js"; | ||
import * as Pervasives from "./pervasives.js"; | ||
import * as Caml_string from "./caml_string.js"; | ||
@@ -13,3 +12,3 @@ | ||
var n$1 = n < 1 ? 1 : n; | ||
var s = Caml_bytes.caml_create_bytes(n$1); | ||
var s = Caml_bytes.create(n$1); | ||
return { | ||
@@ -50,3 +49,3 @@ buffer: s, | ||
} | ||
return Caml_bytes.caml_blit_bytes(src.buffer, srcoff, dst, dstoff, len); | ||
Bytes.blit(src.buffer, srcoff, dst, dstoff, len); | ||
} | ||
@@ -71,3 +70,2 @@ | ||
b.position = 0; | ||
} | ||
@@ -79,3 +77,2 @@ | ||
b.length = b.buffer.length; | ||
} | ||
@@ -89,7 +86,6 @@ | ||
}; | ||
var new_buffer = Caml_bytes.caml_create_bytes(new_len); | ||
var new_buffer = Caml_bytes.create(new_len); | ||
Bytes.blit(b.buffer, 0, new_buffer, 0, b.position); | ||
b.buffer = new_buffer; | ||
b.length = new_len; | ||
} | ||
@@ -104,3 +100,2 @@ | ||
b.position = pos + 1 | 0; | ||
} | ||
@@ -115,3 +110,3 @@ | ||
"buffer.ml", | ||
90, | ||
78, | ||
19 | ||
@@ -162,3 +157,3 @@ ], | ||
"buffer.ml", | ||
123, | ||
111, | ||
8 | ||
@@ -177,3 +172,3 @@ ], | ||
"buffer.ml", | ||
126, | ||
114, | ||
19 | ||
@@ -213,3 +208,3 @@ ], | ||
"buffer.ml", | ||
144, | ||
132, | ||
8 | ||
@@ -228,3 +223,3 @@ ], | ||
"buffer.ml", | ||
147, | ||
135, | ||
19 | ||
@@ -264,3 +259,3 @@ ], | ||
"buffer.ml", | ||
165, | ||
153, | ||
8 | ||
@@ -286,7 +281,6 @@ ], | ||
b.position = new_position; | ||
} | ||
function add_subbytes(b, s, offset, len) { | ||
return add_substring(b, Caml_bytes.bytes_to_string(s), offset, len); | ||
add_substring(b, Bytes.unsafe_to_string(s), offset, len); | ||
} | ||
@@ -302,47 +296,12 @@ | ||
b.position = new_position; | ||
} | ||
function add_bytes(b, s) { | ||
return add_string(b, Caml_bytes.bytes_to_string(s)); | ||
add_string(b, Bytes.unsafe_to_string(s)); | ||
} | ||
function add_buffer(b, bs) { | ||
return add_subbytes(b, bs.buffer, 0, bs.position); | ||
add_subbytes(b, bs.buffer, 0, bs.position); | ||
} | ||
function add_channel(b, ic, len) { | ||
if (len < 0) { | ||
throw { | ||
RE_EXN_ID: "Invalid_argument", | ||
_1: "Buffer.add_channel", | ||
Error: new Error() | ||
}; | ||
} | ||
if ((b.position + len | 0) > b.length) { | ||
resize(b, len); | ||
} | ||
var _len = len; | ||
while(true) { | ||
var len$1 = _len; | ||
if (len$1 <= 0) { | ||
return ; | ||
} | ||
var n = Pervasives.input(ic, b.buffer, b.position, len$1); | ||
b.position = b.position + n | 0; | ||
if (n === 0) { | ||
throw { | ||
RE_EXN_ID: "End_of_file", | ||
Error: new Error() | ||
}; | ||
} | ||
_len = len$1 - n | 0; | ||
continue ; | ||
}; | ||
} | ||
function output_buffer(oc, b) { | ||
return Pervasives.output(oc, b.buffer, 0, b.position); | ||
} | ||
function closing(param) { | ||
@@ -359,3 +318,3 @@ if (param === 40) { | ||
"buffer.ml", | ||
216, | ||
181, | ||
9 | ||
@@ -510,3 +469,2 @@ ], | ||
b.position = len; | ||
} | ||
@@ -534,7 +492,4 @@ | ||
add_buffer , | ||
add_channel , | ||
output_buffer , | ||
truncate , | ||
} | ||
/* No side effect */ |
@@ -9,5 +9,54 @@ | ||
function unsafe_fill(s, i, l, c) { | ||
if (l <= 0) { | ||
return ; | ||
} | ||
for(var k = i ,k_finish = l + i | 0; k < k_finish; ++k){ | ||
s[k] = c; | ||
} | ||
} | ||
function unsafe_blit(s1, i1, s2, i2, len) { | ||
if (len <= 0) { | ||
return ; | ||
} | ||
if (s1 === s2) { | ||
if (i1 < i2) { | ||
var range_a = (s1.length - i2 | 0) - 1 | 0; | ||
var range_b = len - 1 | 0; | ||
var range = range_a > range_b ? range_b : range_a; | ||
for(var j = range; j >= 0; --j){ | ||
s1[i2 + j | 0] = s1[i1 + j | 0]; | ||
} | ||
return ; | ||
} | ||
if (i1 <= i2) { | ||
return ; | ||
} | ||
var range_a$1 = (s1.length - i1 | 0) - 1 | 0; | ||
var range_b$1 = len - 1 | 0; | ||
var range$1 = range_a$1 > range_b$1 ? range_b$1 : range_a$1; | ||
for(var k = 0; k <= range$1; ++k){ | ||
s1[i2 + k | 0] = s1[i1 + k | 0]; | ||
} | ||
return ; | ||
} | ||
var off1 = s1.length - i1 | 0; | ||
if (len <= off1) { | ||
for(var i = 0; i < len; ++i){ | ||
s2[i2 + i | 0] = s1[i1 + i | 0]; | ||
} | ||
return ; | ||
} | ||
for(var i$1 = 0; i$1 < off1; ++i$1){ | ||
s2[i2 + i$1 | 0] = s1[i1 + i$1 | 0]; | ||
} | ||
for(var i$2 = off1; i$2 < len; ++i$2){ | ||
s2[i2 + i$2 | 0] = /* '\000' */0; | ||
} | ||
} | ||
function make(n, c) { | ||
var s = Caml_bytes.caml_create_bytes(n); | ||
Caml_bytes.caml_fill_bytes(s, 0, n, c); | ||
var s = Caml_bytes.create(n); | ||
unsafe_fill(s, 0, n, c); | ||
return s; | ||
@@ -17,3 +66,3 @@ } | ||
function init(n, f) { | ||
var s = Caml_bytes.caml_create_bytes(n); | ||
var s = Caml_bytes.create(n); | ||
for(var i = 0; i < n; ++i){ | ||
@@ -29,13 +78,36 @@ s[i] = Curry._1(f, i); | ||
var len = s.length; | ||
var r = Caml_bytes.caml_create_bytes(len); | ||
Caml_bytes.caml_blit_bytes(s, 0, r, 0, len); | ||
var r = Caml_bytes.create(len); | ||
unsafe_blit(s, 0, r, 0, len); | ||
return r; | ||
} | ||
function to_string(b) { | ||
return Caml_bytes.bytes_to_string(copy(b)); | ||
function to_string(a) { | ||
var i = 0; | ||
var len = a.length; | ||
var s = ""; | ||
var s_len = len; | ||
if (i === 0 && len <= 4096 && len === a.length) { | ||
return String.fromCharCode.apply(null, a); | ||
} | ||
var offset = 0; | ||
while(s_len > 0) { | ||
var next = s_len < 1024 ? s_len : 1024; | ||
var tmp_bytes = new Array(next); | ||
for(var k = 0; k < next; ++k){ | ||
tmp_bytes[k] = a[k + offset | 0]; | ||
} | ||
s = s + String.fromCharCode.apply(null, tmp_bytes); | ||
s_len = s_len - next | 0; | ||
offset = offset + next | 0; | ||
}; | ||
return s; | ||
} | ||
function of_string(s) { | ||
return copy(Caml_bytes.bytes_of_string(s)); | ||
var len = s.length; | ||
var res = new Array(len); | ||
for(var i = 0; i < len; ++i){ | ||
res[i] = s.codePointAt(i); | ||
} | ||
return res; | ||
} | ||
@@ -51,4 +123,4 @@ | ||
} | ||
var r = Caml_bytes.caml_create_bytes(len); | ||
Caml_bytes.caml_blit_bytes(s, ofs, r, 0, len); | ||
var r = Caml_bytes.create(len); | ||
unsafe_blit(s, ofs, r, 0, len); | ||
return r; | ||
@@ -58,3 +130,3 @@ } | ||
function sub_string(b, ofs, len) { | ||
return Caml_bytes.bytes_to_string(sub(b, ofs, len)); | ||
return to_string(sub(b, ofs, len)); | ||
} | ||
@@ -95,3 +167,3 @@ | ||
var len = $plus$plus($plus$plus(s.length, left), right); | ||
var r = Caml_bytes.caml_create_bytes(len); | ||
var r = Caml_bytes.create(len); | ||
var match = left < 0 ? [ | ||
@@ -106,5 +178,5 @@ -left | 0, | ||
var srcoff = match[0]; | ||
var cpylen = Caml.caml_int_min(s.length - srcoff | 0, len - dstoff | 0); | ||
var cpylen = Caml.int_min(s.length - srcoff | 0, len - dstoff | 0); | ||
if (cpylen > 0) { | ||
Caml_bytes.caml_blit_bytes(s, srcoff, r, dstoff, cpylen); | ||
unsafe_blit(s, srcoff, r, dstoff, cpylen); | ||
} | ||
@@ -122,3 +194,3 @@ return r; | ||
} | ||
return Caml_bytes.caml_fill_bytes(s, ofs, len, c); | ||
unsafe_fill(s, ofs, len, c); | ||
} | ||
@@ -134,3 +206,3 @@ | ||
} | ||
return Caml_bytes.caml_blit_bytes(s1, ofs1, s2, ofs2, len); | ||
unsafe_blit(s1, ofs1, s2, ofs2, len); | ||
} | ||
@@ -146,3 +218,18 @@ | ||
} | ||
return Caml_bytes.caml_blit_string(s1, ofs1, s2, ofs2, len); | ||
if (len <= 0) { | ||
return ; | ||
} | ||
var off1 = s1.length - ofs1 | 0; | ||
if (len <= off1) { | ||
for(var i = 0; i < len; ++i){ | ||
s2[ofs2 + i | 0] = s1.codePointAt(ofs1 + i | 0); | ||
} | ||
return ; | ||
} | ||
for(var i$1 = 0; i$1 < off1; ++i$1){ | ||
s2[ofs2 + i$1 | 0] = s1.codePointAt(ofs1 + i$1 | 0); | ||
} | ||
for(var i$2 = off1; i$2 < len; ++i$2){ | ||
s2[ofs2 + i$2 | 0] = /* '\000' */0; | ||
} | ||
} | ||
@@ -154,3 +241,2 @@ | ||
} | ||
} | ||
@@ -162,3 +248,2 @@ | ||
} | ||
} | ||
@@ -200,3 +285,3 @@ | ||
var seplen = sep.length; | ||
var dst = Caml_bytes.caml_create_bytes(sum_lengths(0, seplen, l)); | ||
var dst = Caml_bytes.create(sum_lengths(0, seplen, l)); | ||
var _pos = 0; | ||
@@ -213,4 +298,4 @@ var _param = l; | ||
if (tl) { | ||
Caml_bytes.caml_blit_bytes(hd, 0, dst, pos, hd.length); | ||
Caml_bytes.caml_blit_bytes(sep, 0, dst, pos + hd.length | 0, seplen); | ||
unsafe_blit(hd, 0, dst, pos, hd.length); | ||
unsafe_blit(sep, 0, dst, pos + hd.length | 0, seplen); | ||
_param = tl; | ||
@@ -220,3 +305,3 @@ _pos = (pos + hd.length | 0) + seplen | 0; | ||
} | ||
Caml_bytes.caml_blit_bytes(hd, 0, dst, pos, hd.length); | ||
unsafe_blit(hd, 0, dst, pos, hd.length); | ||
return dst; | ||
@@ -229,5 +314,5 @@ }; | ||
var l2 = s2.length; | ||
var r = Caml_bytes.caml_create_bytes(l1 + l2 | 0); | ||
Caml_bytes.caml_blit_bytes(s1, 0, r, 0, l1); | ||
Caml_bytes.caml_blit_bytes(s2, 0, r, l1, l2); | ||
var r = Caml_bytes.create(l1 + l2 | 0); | ||
unsafe_blit(s1, 0, r, 0, l1); | ||
unsafe_blit(s2, 0, r, l1, l2); | ||
return r; | ||
@@ -284,3 +369,3 @@ } | ||
} | ||
var s$p = Caml_bytes.caml_create_bytes(n); | ||
var s$p = Caml_bytes.create(n); | ||
n = 0; | ||
@@ -372,3 +457,3 @@ for(var i$1 = 0 ,i_finish$1 = s.length; i$1 < i_finish$1; ++i$1){ | ||
} | ||
var r = Caml_bytes.caml_create_bytes(l); | ||
var r = Caml_bytes.create(l); | ||
for(var i = 0; i < l; ++i){ | ||
@@ -385,3 +470,3 @@ r[i] = Curry._1(f, s[i]); | ||
} | ||
var r = Caml_bytes.caml_create_bytes(l); | ||
var r = Caml_bytes.create(l); | ||
for(var i = 0; i < l; ++i){ | ||
@@ -589,26 +674,10 @@ r[i] = Curry._2(f, i, s[i]); | ||
var compare = Caml_bytes.caml_bytes_compare; | ||
var compare = Caml_bytes.bytes_compare; | ||
function uppercase(s) { | ||
return map(Char.uppercase, s); | ||
} | ||
var equal = Caml_bytes.bytes_equal; | ||
function lowercase(s) { | ||
return map(Char.lowercase, s); | ||
} | ||
var unsafe_to_string = to_string; | ||
function capitalize(s) { | ||
return apply1(Char.uppercase, s); | ||
} | ||
var unsafe_of_string = of_string; | ||
function uncapitalize(s) { | ||
return apply1(Char.lowercase, s); | ||
} | ||
var equal = Caml_bytes.caml_bytes_equal; | ||
var unsafe_to_string = Caml_bytes.bytes_to_string; | ||
var unsafe_of_string = Caml_bytes.bytes_of_string; | ||
export { | ||
@@ -646,6 +715,2 @@ make , | ||
rcontains_from , | ||
uppercase , | ||
lowercase , | ||
capitalize , | ||
uncapitalize , | ||
uppercase_ascii , | ||
@@ -659,4 +724,3 @@ lowercase_ascii , | ||
unsafe_of_string , | ||
} | ||
/* No side effect */ |
import * as Bytes from "./bytes.js"; | ||
import * as Caml from "./caml.js"; | ||
import * as Char from "./char.js"; | ||
import * as Curry from "./curry.js"; | ||
import * as Caml_bytes from "./caml_bytes.js"; | ||
import * as Caml_js_exceptions from "./caml_js_exceptions.js"; | ||
var make = Bytes.make; | ||
function unsafe_fill(s, i, l, c) { | ||
if (l <= 0) { | ||
return ; | ||
} | ||
for(var k = i ,k_finish = l + i | 0; k < k_finish; ++k){ | ||
s[k] = c; | ||
} | ||
} | ||
var init = Bytes.init; | ||
function unsafe_blit(s1, i1, s2, i2, len) { | ||
if (len <= 0) { | ||
return ; | ||
} | ||
if (s1 === s2) { | ||
if (i1 < i2) { | ||
var range_a = (s1.length - i2 | 0) - 1 | 0; | ||
var range_b = len - 1 | 0; | ||
var range = range_a > range_b ? range_b : range_a; | ||
for(var j = range; j >= 0; --j){ | ||
s1[i2 + j | 0] = s1[i1 + j | 0]; | ||
} | ||
return ; | ||
} | ||
if (i1 <= i2) { | ||
return ; | ||
} | ||
var range_a$1 = (s1.length - i1 | 0) - 1 | 0; | ||
var range_b$1 = len - 1 | 0; | ||
var range$1 = range_a$1 > range_b$1 ? range_b$1 : range_a$1; | ||
for(var k = 0; k <= range$1; ++k){ | ||
s1[i2 + k | 0] = s1[i1 + k | 0]; | ||
} | ||
return ; | ||
} | ||
var off1 = s1.length - i1 | 0; | ||
if (len <= off1) { | ||
for(var i = 0; i < len; ++i){ | ||
s2[i2 + i | 0] = s1[i1 + i | 0]; | ||
} | ||
return ; | ||
} | ||
for(var i$1 = 0; i$1 < off1; ++i$1){ | ||
s2[i2 + i$1 | 0] = s1[i1 + i$1 | 0]; | ||
} | ||
for(var i$2 = off1; i$2 < len; ++i$2){ | ||
s2[i2 + i$2 | 0] = /* '\000' */0; | ||
} | ||
} | ||
var empty = Bytes.empty; | ||
function make(n, c) { | ||
var s = Caml_bytes.create(n); | ||
unsafe_fill(s, 0, n, c); | ||
return s; | ||
} | ||
var copy = Bytes.copy; | ||
function init(n, f) { | ||
var s = Caml_bytes.create(n); | ||
for(var i = 0; i < n; ++i){ | ||
s[i] = Curry._1(f, i); | ||
} | ||
return s; | ||
} | ||
var of_string = Bytes.of_string; | ||
var empty = []; | ||
var to_string = Bytes.to_string; | ||
function copy(s) { | ||
var len = s.length; | ||
var r = Caml_bytes.create(len); | ||
unsafe_blit(s, 0, r, 0, len); | ||
return r; | ||
} | ||
var sub = Bytes.sub; | ||
function to_string(a) { | ||
var i = 0; | ||
var len = a.length; | ||
var s = ""; | ||
var s_len = len; | ||
if (i === 0 && len <= 4096 && len === a.length) { | ||
return String.fromCharCode.apply(null, a); | ||
} | ||
var offset = 0; | ||
while(s_len > 0) { | ||
var next = s_len < 1024 ? s_len : 1024; | ||
var tmp_bytes = new Array(next); | ||
for(var k = 0; k < next; ++k){ | ||
tmp_bytes[k] = a[k + offset | 0]; | ||
} | ||
s = s + String.fromCharCode.apply(null, tmp_bytes); | ||
s_len = s_len - next | 0; | ||
offset = offset + next | 0; | ||
}; | ||
return s; | ||
} | ||
var sub_string = Bytes.sub_string; | ||
function of_string(s) { | ||
var len = s.length; | ||
var res = new Array(len); | ||
for(var i = 0; i < len; ++i){ | ||
res[i] = s.codePointAt(i); | ||
} | ||
return res; | ||
} | ||
var extend = Bytes.extend; | ||
function sub(s, ofs, len) { | ||
if (ofs < 0 || len < 0 || ofs > (s.length - len | 0)) { | ||
throw { | ||
RE_EXN_ID: "Invalid_argument", | ||
_1: "String.sub / Bytes.sub", | ||
Error: new Error() | ||
}; | ||
} | ||
var r = Caml_bytes.create(len); | ||
unsafe_blit(s, ofs, r, 0, len); | ||
return r; | ||
} | ||
var fill = Bytes.fill; | ||
function sub_string(b, ofs, len) { | ||
return to_string(sub(b, ofs, len)); | ||
} | ||
var blit = Bytes.blit; | ||
function $plus$plus(a, b) { | ||
var c = a + b | 0; | ||
var match = a < 0; | ||
var match$1 = b < 0; | ||
var match$2 = c < 0; | ||
if (match) { | ||
if (!match$1) { | ||
return c; | ||
} | ||
if (match$2) { | ||
return c; | ||
} | ||
throw { | ||
RE_EXN_ID: "Invalid_argument", | ||
_1: "Bytes.extend", | ||
Error: new Error() | ||
}; | ||
} | ||
if (match$1) { | ||
return c; | ||
} | ||
if (match$2) { | ||
throw { | ||
RE_EXN_ID: "Invalid_argument", | ||
_1: "Bytes.extend", | ||
Error: new Error() | ||
}; | ||
} | ||
return c; | ||
} | ||
var blit_string = Bytes.blit_string; | ||
function extend(s, left, right) { | ||
var len = $plus$plus($plus$plus(s.length, left), right); | ||
var r = Caml_bytes.create(len); | ||
var match = left < 0 ? [ | ||
-left | 0, | ||
0 | ||
] : [ | ||
0, | ||
left | ||
]; | ||
var dstoff = match[1]; | ||
var srcoff = match[0]; | ||
var cpylen = Caml.int_min(s.length - srcoff | 0, len - dstoff | 0); | ||
if (cpylen > 0) { | ||
unsafe_blit(s, srcoff, r, dstoff, cpylen); | ||
} | ||
return r; | ||
} | ||
var concat = Bytes.concat; | ||
function fill(s, ofs, len, c) { | ||
if (ofs < 0 || len < 0 || ofs > (s.length - len | 0)) { | ||
throw { | ||
RE_EXN_ID: "Invalid_argument", | ||
_1: "String.fill / Bytes.fill", | ||
Error: new Error() | ||
}; | ||
} | ||
unsafe_fill(s, ofs, len, c); | ||
} | ||
var cat = Bytes.cat; | ||
function blit(s1, ofs1, s2, ofs2, len) { | ||
if (len < 0 || ofs1 < 0 || ofs1 > (s1.length - len | 0) || ofs2 < 0 || ofs2 > (s2.length - len | 0)) { | ||
throw { | ||
RE_EXN_ID: "Invalid_argument", | ||
_1: "Bytes.blit", | ||
Error: new Error() | ||
}; | ||
} | ||
unsafe_blit(s1, ofs1, s2, ofs2, len); | ||
} | ||
var iter = Bytes.iter; | ||
function blit_string(s1, ofs1, s2, ofs2, len) { | ||
if (len < 0 || ofs1 < 0 || ofs1 > (s1.length - len | 0) || ofs2 < 0 || ofs2 > (s2.length - len | 0)) { | ||
throw { | ||
RE_EXN_ID: "Invalid_argument", | ||
_1: "String.blit / Bytes.blit_string", | ||
Error: new Error() | ||
}; | ||
} | ||
if (len <= 0) { | ||
return ; | ||
} | ||
var off1 = s1.length - ofs1 | 0; | ||
if (len <= off1) { | ||
for(var i = 0; i < len; ++i){ | ||
s2[ofs2 + i | 0] = s1.codePointAt(ofs1 + i | 0); | ||
} | ||
return ; | ||
} | ||
for(var i$1 = 0; i$1 < off1; ++i$1){ | ||
s2[ofs2 + i$1 | 0] = s1.codePointAt(ofs1 + i$1 | 0); | ||
} | ||
for(var i$2 = off1; i$2 < len; ++i$2){ | ||
s2[ofs2 + i$2 | 0] = /* '\000' */0; | ||
} | ||
} | ||
var iteri = Bytes.iteri; | ||
function iter(f, a) { | ||
for(var i = 0 ,i_finish = a.length; i < i_finish; ++i){ | ||
Curry._1(f, a[i]); | ||
} | ||
} | ||
var map = Bytes.map; | ||
function iteri(f, a) { | ||
for(var i = 0 ,i_finish = a.length; i < i_finish; ++i){ | ||
Curry._2(f, i, a[i]); | ||
} | ||
} | ||
var mapi = Bytes.mapi; | ||
function ensure_ge(x, y) { | ||
if (x >= y) { | ||
return x; | ||
} | ||
throw { | ||
RE_EXN_ID: "Invalid_argument", | ||
_1: "Bytes.concat", | ||
Error: new Error() | ||
}; | ||
} | ||
var trim = Bytes.trim; | ||
function sum_lengths(_acc, seplen, _param) { | ||
while(true) { | ||
var param = _param; | ||
var acc = _acc; | ||
if (!param) { | ||
return acc; | ||
} | ||
var tl = param.tl; | ||
var hd = param.hd; | ||
if (!tl) { | ||
return hd.length + acc | 0; | ||
} | ||
_param = tl; | ||
_acc = ensure_ge((hd.length + seplen | 0) + acc | 0, acc); | ||
continue ; | ||
}; | ||
} | ||
var escaped = Bytes.escaped; | ||
function concat(sep, l) { | ||
if (!l) { | ||
return empty; | ||
} | ||
var seplen = sep.length; | ||
var dst = Caml_bytes.create(sum_lengths(0, seplen, l)); | ||
var _pos = 0; | ||
var _param = l; | ||
while(true) { | ||
var param = _param; | ||
var pos = _pos; | ||
if (!param) { | ||
return dst; | ||
} | ||
var tl = param.tl; | ||
var hd = param.hd; | ||
if (tl) { | ||
unsafe_blit(hd, 0, dst, pos, hd.length); | ||
unsafe_blit(sep, 0, dst, pos + hd.length | 0, seplen); | ||
_param = tl; | ||
_pos = (pos + hd.length | 0) + seplen | 0; | ||
continue ; | ||
} | ||
unsafe_blit(hd, 0, dst, pos, hd.length); | ||
return dst; | ||
}; | ||
} | ||
var index = Bytes.index; | ||
function cat(s1, s2) { | ||
var l1 = s1.length; | ||
var l2 = s2.length; | ||
var r = Caml_bytes.create(l1 + l2 | 0); | ||
unsafe_blit(s1, 0, r, 0, l1); | ||
unsafe_blit(s2, 0, r, l1, l2); | ||
return r; | ||
} | ||
var index_opt = Bytes.index_opt; | ||
function is_space(param) { | ||
if (param > 13 || param < 9) { | ||
return param === 32; | ||
} else { | ||
return param !== 11; | ||
} | ||
} | ||
var rindex = Bytes.rindex; | ||
function trim(s) { | ||
var len = s.length; | ||
var i = 0; | ||
while(i < len && is_space(s[i])) { | ||
i = i + 1 | 0; | ||
}; | ||
var j = len - 1 | 0; | ||
while(j >= i && is_space(s[j])) { | ||
j = j - 1 | 0; | ||
}; | ||
if (j >= i) { | ||
return sub(s, i, (j - i | 0) + 1 | 0); | ||
} else { | ||
return empty; | ||
} | ||
} | ||
var rindex_opt = Bytes.rindex_opt; | ||
function escaped(s) { | ||
var n = 0; | ||
for(var i = 0 ,i_finish = s.length; i < i_finish; ++i){ | ||
var match = s[i]; | ||
n = n + ( | ||
match >= 32 ? ( | ||
match > 92 || match < 34 ? ( | ||
match >= 127 ? 4 : 1 | ||
) : ( | ||
match > 91 || match < 35 ? 2 : 1 | ||
) | ||
) : ( | ||
match >= 11 ? ( | ||
match !== 13 ? 4 : 2 | ||
) : ( | ||
match >= 8 ? 2 : 4 | ||
) | ||
) | ||
) | 0; | ||
} | ||
if (n === s.length) { | ||
return copy(s); | ||
} | ||
var s$p = Caml_bytes.create(n); | ||
n = 0; | ||
for(var i$1 = 0 ,i_finish$1 = s.length; i$1 < i_finish$1; ++i$1){ | ||
var c = s[i$1]; | ||
var exit = 0; | ||
if (c >= 35) { | ||
if (c !== 92) { | ||
if (c >= 127) { | ||
exit = 1; | ||
} else { | ||
s$p[n] = c; | ||
} | ||
} else { | ||
exit = 2; | ||
} | ||
} else if (c >= 32) { | ||
if (c >= 34) { | ||
exit = 2; | ||
} else { | ||
s$p[n] = c; | ||
} | ||
} else if (c >= 14) { | ||
exit = 1; | ||
} else { | ||
switch (c) { | ||
case 8 : | ||
s$p[n] = /* '\\' */92; | ||
n = n + 1 | 0; | ||
s$p[n] = /* 'b' */98; | ||
break; | ||
case 9 : | ||
s$p[n] = /* '\\' */92; | ||
n = n + 1 | 0; | ||
s$p[n] = /* 't' */116; | ||
break; | ||
case 10 : | ||
s$p[n] = /* '\\' */92; | ||
n = n + 1 | 0; | ||
s$p[n] = /* 'n' */110; | ||
break; | ||
case 0 : | ||
case 1 : | ||
case 2 : | ||
case 3 : | ||
case 4 : | ||
case 5 : | ||
case 6 : | ||
case 7 : | ||
case 11 : | ||
case 12 : | ||
exit = 1; | ||
break; | ||
case 13 : | ||
s$p[n] = /* '\\' */92; | ||
n = n + 1 | 0; | ||
s$p[n] = /* 'r' */114; | ||
break; | ||
} | ||
} | ||
switch (exit) { | ||
case 1 : | ||
s$p[n] = /* '\\' */92; | ||
n = n + 1 | 0; | ||
s$p[n] = 48 + (c / 100 | 0) | 0; | ||
n = n + 1 | 0; | ||
s$p[n] = 48 + (c / 10 | 0) % 10 | 0; | ||
n = n + 1 | 0; | ||
s$p[n] = 48 + c % 10 | 0; | ||
break; | ||
case 2 : | ||
s$p[n] = /* '\\' */92; | ||
n = n + 1 | 0; | ||
s$p[n] = c; | ||
break; | ||
} | ||
n = n + 1 | 0; | ||
} | ||
return s$p; | ||
} | ||
var index_from = Bytes.index_from; | ||
function map(f, s) { | ||
var l = s.length; | ||
if (l === 0) { | ||
return s; | ||
} | ||
var r = Caml_bytes.create(l); | ||
for(var i = 0; i < l; ++i){ | ||
r[i] = Curry._1(f, s[i]); | ||
} | ||
return r; | ||
} | ||
var index_from_opt = Bytes.index_from_opt; | ||
function mapi(f, s) { | ||
var l = s.length; | ||
if (l === 0) { | ||
return s; | ||
} | ||
var r = Caml_bytes.create(l); | ||
for(var i = 0; i < l; ++i){ | ||
r[i] = Curry._2(f, i, s[i]); | ||
} | ||
return r; | ||
} | ||
var rindex_from = Bytes.rindex_from; | ||
function uppercase_ascii(s) { | ||
return map(Char.uppercase_ascii, s); | ||
} | ||
var rindex_from_opt = Bytes.rindex_from_opt; | ||
function lowercase_ascii(s) { | ||
return map(Char.lowercase_ascii, s); | ||
} | ||
var contains = Bytes.contains; | ||
function apply1(f, s) { | ||
if (s.length === 0) { | ||
return s; | ||
} | ||
var r = copy(s); | ||
r[0] = Curry._1(f, s[0]); | ||
return r; | ||
} | ||
var contains_from = Bytes.contains_from; | ||
function capitalize_ascii(s) { | ||
return apply1(Char.uppercase_ascii, s); | ||
} | ||
var rcontains_from = Bytes.rcontains_from; | ||
function uncapitalize_ascii(s) { | ||
return apply1(Char.lowercase_ascii, s); | ||
} | ||
var uppercase = Bytes.uppercase; | ||
function index_rec(s, lim, _i, c) { | ||
while(true) { | ||
var i = _i; | ||
if (i >= lim) { | ||
throw { | ||
RE_EXN_ID: "Not_found", | ||
Error: new Error() | ||
}; | ||
} | ||
if (s[i] === c) { | ||
return i; | ||
} | ||
_i = i + 1 | 0; | ||
continue ; | ||
}; | ||
} | ||
var lowercase = Bytes.lowercase; | ||
function index(s, c) { | ||
return index_rec(s, s.length, 0, c); | ||
} | ||
var capitalize = Bytes.capitalize; | ||
function index_rec_opt(s, lim, _i, c) { | ||
while(true) { | ||
var i = _i; | ||
if (i >= lim) { | ||
return ; | ||
} | ||
if (s[i] === c) { | ||
return i; | ||
} | ||
_i = i + 1 | 0; | ||
continue ; | ||
}; | ||
} | ||
var uncapitalize = Bytes.uncapitalize; | ||
function index_opt(s, c) { | ||
return index_rec_opt(s, s.length, 0, c); | ||
} | ||
var uppercase_ascii = Bytes.uppercase_ascii; | ||
function index_from(s, i, c) { | ||
var l = s.length; | ||
if (i < 0 || i > l) { | ||
throw { | ||
RE_EXN_ID: "Invalid_argument", | ||
_1: "String.index_from / Bytes.index_from", | ||
Error: new Error() | ||
}; | ||
} | ||
return index_rec(s, l, i, c); | ||
} | ||
var lowercase_ascii = Bytes.lowercase_ascii; | ||
function index_from_opt(s, i, c) { | ||
var l = s.length; | ||
if (i < 0 || i > l) { | ||
throw { | ||
RE_EXN_ID: "Invalid_argument", | ||
_1: "String.index_from_opt / Bytes.index_from_opt", | ||
Error: new Error() | ||
}; | ||
} | ||
return index_rec_opt(s, l, i, c); | ||
} | ||
var capitalize_ascii = Bytes.capitalize_ascii; | ||
function rindex_rec(s, _i, c) { | ||
while(true) { | ||
var i = _i; | ||
if (i < 0) { | ||
throw { | ||
RE_EXN_ID: "Not_found", | ||
Error: new Error() | ||
}; | ||
} | ||
if (s[i] === c) { | ||
return i; | ||
} | ||
_i = i - 1 | 0; | ||
continue ; | ||
}; | ||
} | ||
var uncapitalize_ascii = Bytes.uncapitalize_ascii; | ||
function rindex(s, c) { | ||
return rindex_rec(s, s.length - 1 | 0, c); | ||
} | ||
var compare = Bytes.compare; | ||
function rindex_from(s, i, c) { | ||
if (i < -1 || i >= s.length) { | ||
throw { | ||
RE_EXN_ID: "Invalid_argument", | ||
_1: "String.rindex_from / Bytes.rindex_from", | ||
Error: new Error() | ||
}; | ||
} | ||
return rindex_rec(s, i, c); | ||
} | ||
var equal = Bytes.equal; | ||
function rindex_rec_opt(s, _i, c) { | ||
while(true) { | ||
var i = _i; | ||
if (i < 0) { | ||
return ; | ||
} | ||
if (s[i] === c) { | ||
return i; | ||
} | ||
_i = i - 1 | 0; | ||
continue ; | ||
}; | ||
} | ||
var unsafe_to_string = Bytes.unsafe_to_string; | ||
function rindex_opt(s, c) { | ||
return rindex_rec_opt(s, s.length - 1 | 0, c); | ||
} | ||
var unsafe_of_string = Bytes.unsafe_of_string; | ||
function rindex_from_opt(s, i, c) { | ||
if (i < -1 || i >= s.length) { | ||
throw { | ||
RE_EXN_ID: "Invalid_argument", | ||
_1: "String.rindex_from_opt / Bytes.rindex_from_opt", | ||
Error: new Error() | ||
}; | ||
} | ||
return rindex_rec_opt(s, i, c); | ||
} | ||
function contains_from(s, i, c) { | ||
var l = s.length; | ||
if (i < 0 || i > l) { | ||
throw { | ||
RE_EXN_ID: "Invalid_argument", | ||
_1: "String.contains_from / Bytes.contains_from", | ||
Error: new Error() | ||
}; | ||
} | ||
try { | ||
index_rec(s, l, i, c); | ||
return true; | ||
} | ||
catch (raw_exn){ | ||
var exn = Caml_js_exceptions.internalToOCamlException(raw_exn); | ||
if (exn.RE_EXN_ID === "Not_found") { | ||
return false; | ||
} | ||
throw exn; | ||
} | ||
} | ||
function contains(s, c) { | ||
return contains_from(s, 0, c); | ||
} | ||
function rcontains_from(s, i, c) { | ||
if (i < 0 || i >= s.length) { | ||
throw { | ||
RE_EXN_ID: "Invalid_argument", | ||
_1: "String.rcontains_from / Bytes.rcontains_from", | ||
Error: new Error() | ||
}; | ||
} | ||
try { | ||
rindex_rec(s, i, c); | ||
return true; | ||
} | ||
catch (raw_exn){ | ||
var exn = Caml_js_exceptions.internalToOCamlException(raw_exn); | ||
if (exn.RE_EXN_ID === "Not_found") { | ||
return false; | ||
} | ||
throw exn; | ||
} | ||
} | ||
var compare = Caml_bytes.bytes_compare; | ||
var equal = Caml_bytes.bytes_equal; | ||
var unsafe_to_string = to_string; | ||
var unsafe_of_string = of_string; | ||
export { | ||
@@ -123,6 +695,2 @@ make , | ||
rcontains_from , | ||
uppercase , | ||
lowercase , | ||
capitalize , | ||
uncapitalize , | ||
uppercase_ascii , | ||
@@ -136,4 +704,3 @@ lowercase_ascii , | ||
unsafe_of_string , | ||
} | ||
/* No side effect */ |
@@ -15,4 +15,3 @@ | ||
register_exception , | ||
} | ||
/* No side effect */ |
@@ -67,3 +67,2 @@ | ||
xs[index] = newval; | ||
} | ||
@@ -108,3 +107,2 @@ | ||
} | ||
} | ||
@@ -125,4 +123,3 @@ | ||
set , | ||
} | ||
/* No side effect */ |
@@ -13,3 +13,2 @@ | ||
s[i] = ch; | ||
} | ||
@@ -28,13 +27,3 @@ | ||
function caml_fill_bytes(s, i, l, c) { | ||
if (l <= 0) { | ||
return ; | ||
} | ||
for(var k = i ,k_finish = l + i | 0; k < k_finish; ++k){ | ||
s[k] = c; | ||
} | ||
} | ||
function caml_create_bytes(len) { | ||
function create(len) { | ||
if (len < 0) { | ||
@@ -54,95 +43,3 @@ throw { | ||
function caml_blit_bytes(s1, i1, s2, i2, len) { | ||
if (len <= 0) { | ||
return ; | ||
} | ||
if (s1 === s2) { | ||
if (i1 < i2) { | ||
var range_a = (s1.length - i2 | 0) - 1 | 0; | ||
var range_b = len - 1 | 0; | ||
var range = range_a > range_b ? range_b : range_a; | ||
for(var j = range; j >= 0; --j){ | ||
s1[i2 + j | 0] = s1[i1 + j | 0]; | ||
} | ||
return ; | ||
} | ||
if (i1 <= i2) { | ||
return ; | ||
} | ||
var range_a$1 = (s1.length - i1 | 0) - 1 | 0; | ||
var range_b$1 = len - 1 | 0; | ||
var range$1 = range_a$1 > range_b$1 ? range_b$1 : range_a$1; | ||
for(var k = 0; k <= range$1; ++k){ | ||
s1[i2 + k | 0] = s1[i1 + k | 0]; | ||
} | ||
return ; | ||
} | ||
var off1 = s1.length - i1 | 0; | ||
if (len <= off1) { | ||
for(var i = 0; i < len; ++i){ | ||
s2[i2 + i | 0] = s1[i1 + i | 0]; | ||
} | ||
return ; | ||
} | ||
for(var i$1 = 0; i$1 < off1; ++i$1){ | ||
s2[i2 + i$1 | 0] = s1[i1 + i$1 | 0]; | ||
} | ||
for(var i$2 = off1; i$2 < len; ++i$2){ | ||
s2[i2 + i$2 | 0] = /* '\000' */0; | ||
} | ||
} | ||
function bytes_to_string(a) { | ||
var i = 0; | ||
var len = a.length; | ||
var s = ""; | ||
var s_len = len; | ||
if (i === 0 && len <= 4096 && len === a.length) { | ||
return String.fromCharCode.apply(null, a); | ||
} | ||
var offset = 0; | ||
while(s_len > 0) { | ||
var next = s_len < 1024 ? s_len : 1024; | ||
var tmp_bytes = new Array(next); | ||
for(var k = 0; k < next; ++k){ | ||
tmp_bytes[k] = a[k + offset | 0]; | ||
} | ||
s = s + String.fromCharCode.apply(null, tmp_bytes); | ||
s_len = s_len - next | 0; | ||
offset = offset + next | 0; | ||
}; | ||
return s; | ||
} | ||
function caml_blit_string(s1, i1, s2, i2, len) { | ||
if (len <= 0) { | ||
return ; | ||
} | ||
var off1 = s1.length - i1 | 0; | ||
if (len <= off1) { | ||
for(var i = 0; i < len; ++i){ | ||
s2[i2 + i | 0] = s1.charCodeAt(i1 + i | 0); | ||
} | ||
return ; | ||
} | ||
for(var i$1 = 0; i$1 < off1; ++i$1){ | ||
s2[i2 + i$1 | 0] = s1.charCodeAt(i1 + i$1 | 0); | ||
} | ||
for(var i$2 = off1; i$2 < len; ++i$2){ | ||
s2[i2 + i$2 | 0] = /* '\000' */0; | ||
} | ||
} | ||
function bytes_of_string(s) { | ||
var len = s.length; | ||
var res = new Array(len); | ||
for(var i = 0; i < len; ++i){ | ||
res[i] = s.charCodeAt(i); | ||
} | ||
return res; | ||
} | ||
function caml_bytes_compare_aux(s1, s2, _off, len, def) { | ||
function bytes_compare_aux(s1, s2, _off, len, def) { | ||
while(true) { | ||
@@ -166,15 +63,15 @@ var off = _off; | ||
function caml_bytes_compare(s1, s2) { | ||
function bytes_compare(s1, s2) { | ||
var len1 = s1.length; | ||
var len2 = s2.length; | ||
if (len1 === len2) { | ||
return caml_bytes_compare_aux(s1, s2, 0, len1, 0); | ||
return bytes_compare_aux(s1, s2, 0, len1, 0); | ||
} else if (len1 < len2) { | ||
return caml_bytes_compare_aux(s1, s2, 0, len1, -1); | ||
return bytes_compare_aux(s1, s2, 0, len1, -1); | ||
} else { | ||
return caml_bytes_compare_aux(s1, s2, 0, len2, 1); | ||
return bytes_compare_aux(s1, s2, 0, len2, 1); | ||
} | ||
} | ||
function caml_bytes_equal(s1, s2) { | ||
function bytes_equal(s1, s2) { | ||
var len1 = s1.length; | ||
@@ -202,35 +99,29 @@ var len2 = s2.length; | ||
function caml_bytes_greaterthan(s1, s2) { | ||
return caml_bytes_compare(s1, s2) > 0; | ||
function bytes_greaterthan(s1, s2) { | ||
return bytes_compare(s1, s2) > 0; | ||
} | ||
function caml_bytes_greaterequal(s1, s2) { | ||
return caml_bytes_compare(s1, s2) >= 0; | ||
function bytes_greaterequal(s1, s2) { | ||
return bytes_compare(s1, s2) >= 0; | ||
} | ||
function caml_bytes_lessthan(s1, s2) { | ||
return caml_bytes_compare(s1, s2) < 0; | ||
function bytes_lessthan(s1, s2) { | ||
return bytes_compare(s1, s2) < 0; | ||
} | ||
function caml_bytes_lessequal(s1, s2) { | ||
return caml_bytes_compare(s1, s2) <= 0; | ||
function bytes_lessequal(s1, s2) { | ||
return bytes_compare(s1, s2) <= 0; | ||
} | ||
export { | ||
caml_create_bytes , | ||
caml_fill_bytes , | ||
create , | ||
get , | ||
set , | ||
bytes_to_string , | ||
caml_blit_bytes , | ||
caml_blit_string , | ||
bytes_of_string , | ||
caml_bytes_compare , | ||
caml_bytes_greaterthan , | ||
caml_bytes_greaterequal , | ||
caml_bytes_lessthan , | ||
caml_bytes_lessequal , | ||
caml_bytes_equal , | ||
bytes_compare , | ||
bytes_greaterthan , | ||
bytes_greaterequal , | ||
bytes_lessthan , | ||
bytes_lessequal , | ||
bytes_equal , | ||
} | ||
/* No side effect */ |
@@ -13,3 +13,3 @@ | ||
function caml_is_extension(e) { | ||
function is_extension(e) { | ||
if (e == null) { | ||
@@ -22,3 +22,3 @@ return false; | ||
function caml_exn_slot_name(x) { | ||
function exn_slot_name(x) { | ||
return x.RE_EXN_ID; | ||
@@ -30,6 +30,5 @@ } | ||
create , | ||
caml_is_extension , | ||
caml_exn_slot_name , | ||
is_extension , | ||
exn_slot_name , | ||
} | ||
/* No side effect */ |
@@ -31,4 +31,3 @@ | ||
register , | ||
} | ||
/* No side effect */ |
var caml_int32_float_of_bits = (function(x){ | ||
var int_float_of_bits = (function(x){ | ||
return new Float32Array(new Int32Array([x]).buffer)[0] | ||
}); | ||
var caml_int32_bits_of_float = (function(x){ | ||
var int_bits_of_float = (function(x){ | ||
return new Int32Array(new Float32Array([x]).buffer)[0] | ||
}); | ||
function caml_modf_float(x) { | ||
function modf_float(x) { | ||
if (!isFinite(x)) { | ||
@@ -43,3 +43,3 @@ if (isNaN(x)) { | ||
function caml_ldexp_float(x, exp) { | ||
function ldexp_float(x, exp) { | ||
var x$p = x; | ||
@@ -62,3 +62,3 @@ var exp$p = exp; | ||
function caml_frexp_float(x) { | ||
function frexp_float(x) { | ||
if (x === 0 || !isFinite(x)) { | ||
@@ -87,3 +87,3 @@ return [ | ||
function caml_copysign_float(x, y) { | ||
function copysign_float(x, y) { | ||
var x$1 = Math.abs(x); | ||
@@ -98,3 +98,3 @@ var y$1 = y === 0 ? 1 / y : y; | ||
function caml_expm1_float(x) { | ||
function expm1_float(x) { | ||
var y = Math.exp(x); | ||
@@ -111,3 +111,3 @@ var z = y - 1; | ||
function caml_hypot_float(x, y) { | ||
function hypot_float(x, y) { | ||
var x0 = Math.abs(x); | ||
@@ -124,18 +124,12 @@ var y0 = Math.abs(y); | ||
function caml_log10_float(x) { | ||
return Math.LOG10E * Math.log(x); | ||
} | ||
export { | ||
caml_int32_float_of_bits , | ||
caml_int32_bits_of_float , | ||
caml_modf_float , | ||
caml_ldexp_float , | ||
caml_frexp_float , | ||
caml_copysign_float , | ||
caml_expm1_float , | ||
caml_hypot_float , | ||
caml_log10_float , | ||
int_float_of_bits , | ||
int_bits_of_float , | ||
modf_float , | ||
ldexp_float , | ||
frexp_float , | ||
copysign_float , | ||
expm1_float , | ||
hypot_float , | ||
} | ||
/* No side effect */ |
@@ -44,3 +44,3 @@ | ||
var i = 0; | ||
var match = s.charCodeAt(i); | ||
var match = s.codePointAt(i); | ||
switch (match) { | ||
@@ -59,4 +59,4 @@ case 43 : | ||
} | ||
if (s[i] === "0") { | ||
var match$1 = s.charCodeAt(i + 1 | 0); | ||
if (s.codePointAt(i) === /* '0' */48) { | ||
var match$1 = s.codePointAt(i + 1 | 0); | ||
if (match$1 >= 89) { | ||
@@ -132,3 +132,3 @@ if (match$1 >= 111) { | ||
function caml_int_of_string(s) { | ||
function int_of_string(s) { | ||
var match = parse_sign_and_base(s); | ||
@@ -139,3 +139,3 @@ var i = match[0]; | ||
var len = s.length; | ||
var c = i < len ? s.charCodeAt(i) : /* '\000' */0; | ||
var c = i < len ? s.codePointAt(i) : /* '\000' */0; | ||
var d = parse_digit(c); | ||
@@ -156,3 +156,3 @@ if (d < 0 || d >= base) { | ||
} | ||
var a = s.charCodeAt(k); | ||
var a = s.codePointAt(k); | ||
if (a === /* '_' */95) { | ||
@@ -195,3 +195,3 @@ _k = k + 1 | 0; | ||
function caml_int64_of_string(s) { | ||
function int64_of_string(s) { | ||
var match = parse_sign_and_base(s); | ||
@@ -228,3 +228,3 @@ var hbase = match[2]; | ||
var len = s.length; | ||
var c = i < len ? s.charCodeAt(i) : /* '\000' */0; | ||
var c = i < len ? s.codePointAt(i) : /* '\000' */0; | ||
var d = Caml_int64.of_int32(parse_digit(c)); | ||
@@ -245,3 +245,3 @@ if (Caml.i64_lt(d, Caml_int64.zero) || Caml.i64_ge(d, base)) { | ||
} | ||
var a = s.charCodeAt(k); | ||
var a = s.codePointAt(k); | ||
if (a === /* '_' */95) { | ||
@@ -328,3 +328,3 @@ _k = k + 1 | 0; | ||
} | ||
var c = fmt.charCodeAt(i); | ||
var c = fmt.codePointAt(i); | ||
var exit = 0; | ||
@@ -420,7 +420,7 @@ if (c >= 69) { | ||
return function () { | ||
var w = fmt.charCodeAt(j) - /* '0' */48 | 0; | ||
var w = fmt.codePointAt(j) - /* '0' */48 | 0; | ||
return w >= 0 && w <= 9; | ||
} | ||
}(j))()) { | ||
f.prec = (Math.imul(f.prec, 10) + fmt.charCodeAt(j) | 0) - /* '0' */48 | 0; | ||
f.prec = (Math.imul(f.prec, 10) + fmt.codePointAt(j) | 0) - /* '0' */48 | 0; | ||
j = j + 1 | 0; | ||
@@ -475,7 +475,7 @@ }; | ||
return function () { | ||
var w = fmt.charCodeAt(j$1) - /* '0' */48 | 0; | ||
var w = fmt.codePointAt(j$1) - /* '0' */48 | 0; | ||
return w >= 0 && w <= 9; | ||
} | ||
}(j$1))()) { | ||
f.width = (Math.imul(f.width, 10) + fmt.charCodeAt(j$1) | 0) - /* '0' */48 | 0; | ||
f.width = (Math.imul(f.width, 10) + fmt.codePointAt(j$1) | 0) - /* '0' */48 | 0; | ||
j$1 = j$1 + 1 | 0; | ||
@@ -556,3 +556,3 @@ }; | ||
function caml_format_int(fmt, i) { | ||
function format_int(fmt, i) { | ||
if (fmt === "%d") { | ||
@@ -635,3 +635,3 @@ return String(i); | ||
function caml_int64_format(fmt, x) { | ||
function int64_format(fmt, x) { | ||
if (fmt === "%d") { | ||
@@ -667,3 +667,3 @@ return Caml_int64.to_string(x); | ||
function caml_format_float(fmt, x) { | ||
function format_float(fmt, x) { | ||
var f = parse_format(fmt); | ||
@@ -682,3 +682,3 @@ var prec = f.prec < 0 ? 6 : f.prec; | ||
var i = s.length; | ||
if (s[i - 3 | 0] === "e") { | ||
if (s.codePointAt(i - 3 | 0) === /* 'e' */101) { | ||
s = s.slice(0, i - 1 | 0) + ("0" + s.slice(i - 1 | 0)); | ||
@@ -697,6 +697,6 @@ } | ||
var i$1 = j - 1 | 0; | ||
while(s[i$1] === "0") { | ||
while(s.codePointAt(i$1) === /* '0' */48) { | ||
i$1 = i$1 - 1 | 0; | ||
}; | ||
if (s[i$1] === ".") { | ||
if (s.codePointAt(i$1) === /* '.' */46) { | ||
i$1 = i$1 - 1 | 0; | ||
@@ -706,3 +706,3 @@ } | ||
var i$2 = s.length; | ||
if (s[i$2 - 3 | 0] === "e") { | ||
if (s.codePointAt(i$2 - 3 | 0) === /* 'e' */101) { | ||
s = s.slice(0, i$2 - 1 | 0) + ("0" + s.slice(i$2 - 1 | 0)); | ||
@@ -726,6 +726,6 @@ } | ||
var k = s.length - 1 | 0; | ||
while(s[k] === "0") { | ||
while(s.codePointAt(k) === /* '0' */48) { | ||
k = k - 1 | 0; | ||
}; | ||
if (s[k] === ".") { | ||
if (s.codePointAt(k) === /* '.' */46) { | ||
k = k - 1 | 0; | ||
@@ -748,3 +748,3 @@ } | ||
var caml_hexstring_of_float = (function(x,prec,style){ | ||
var hexstring_of_float = (function(x,prec,style){ | ||
if (!isFinite(x)) { | ||
@@ -821,3 +821,3 @@ if (isNaN(x)) return "nan"; | ||
function caml_float_of_string(s) { | ||
function float_of_string$1(s) { | ||
return float_of_string(s, { | ||
@@ -829,24 +829,11 @@ RE_EXN_ID: "Failure", | ||
var caml_nativeint_format = caml_format_int; | ||
var caml_int32_format = caml_format_int; | ||
var caml_int32_of_string = caml_int_of_string; | ||
var caml_nativeint_of_string = caml_int_of_string; | ||
export { | ||
caml_format_float , | ||
caml_hexstring_of_float , | ||
caml_format_int , | ||
caml_nativeint_format , | ||
caml_int32_format , | ||
caml_float_of_string , | ||
caml_int64_format , | ||
caml_int_of_string , | ||
caml_int32_of_string , | ||
caml_int64_of_string , | ||
caml_nativeint_of_string , | ||
format_float , | ||
hexstring_of_float , | ||
format_int , | ||
float_of_string$1 as float_of_string, | ||
int64_format , | ||
int_of_string , | ||
int64_of_string , | ||
} | ||
/* No side effect */ |
@@ -8,3 +8,3 @@ | ||
function caml_hash_mix_int(h, d) { | ||
function hash_mix_int(h, d) { | ||
var d$1 = d; | ||
@@ -19,3 +19,3 @@ d$1 = Math.imul(d$1, -862048943); | ||
function caml_hash_final_mix(h) { | ||
function hash_final_mix(h) { | ||
var h$1 = h ^ (h >>> 16); | ||
@@ -28,3 +28,3 @@ h$1 = Math.imul(h$1, -2048144789); | ||
function caml_hash_mix_string(h, s) { | ||
function hash_mix_string(h, s) { | ||
var len = s.length; | ||
@@ -36,3 +36,3 @@ var block = (len / 4 | 0) - 1 | 0; | ||
var w = s.charCodeAt(j) | (s.charCodeAt(j + 1 | 0) << 8) | (s.charCodeAt(j + 2 | 0) << 16) | (s.charCodeAt(j + 3 | 0) << 24); | ||
hash = caml_hash_mix_int(hash, w); | ||
hash = hash_mix_int(hash, w); | ||
} | ||
@@ -44,3 +44,3 @@ var modulo = len & 3; | ||
); | ||
hash = caml_hash_mix_int(hash, w$1); | ||
hash = hash_mix_int(hash, w$1); | ||
} | ||
@@ -52,7 +52,6 @@ hash = hash ^ len; | ||
export { | ||
caml_hash_mix_int , | ||
caml_hash_mix_string , | ||
caml_hash_final_mix , | ||
hash_mix_int , | ||
hash_mix_string , | ||
hash_final_mix , | ||
} | ||
/* No side effect */ |
@@ -20,3 +20,2 @@ | ||
} | ||
} | ||
@@ -38,12 +37,12 @@ | ||
function caml_hash(count, _limit, seed, obj) { | ||
var hash = seed; | ||
function hash(count, _limit, seed, obj) { | ||
var s = seed; | ||
if (typeof obj === "number") { | ||
var u = obj | 0; | ||
hash = Caml_hash_primitive.caml_hash_mix_int(hash, (u + u | 0) + 1 | 0); | ||
return Caml_hash_primitive.caml_hash_final_mix(hash); | ||
s = Caml_hash_primitive.hash_mix_int(s, (u + u | 0) + 1 | 0); | ||
return Caml_hash_primitive.hash_final_mix(s); | ||
} | ||
if (typeof obj === "string") { | ||
hash = Caml_hash_primitive.caml_hash_mix_string(hash, obj); | ||
return Caml_hash_primitive.caml_hash_final_mix(hash); | ||
s = Caml_hash_primitive.hash_mix_string(s, obj); | ||
return Caml_hash_primitive.hash_final_mix(s); | ||
} | ||
@@ -62,6 +61,6 @@ var queue = { | ||
var u$1 = obj$1 | 0; | ||
hash = Caml_hash_primitive.caml_hash_mix_int(hash, (u$1 + u$1 | 0) + 1 | 0); | ||
s = Caml_hash_primitive.hash_mix_int(s, (u$1 + u$1 | 0) + 1 | 0); | ||
num = num - 1 | 0; | ||
} else if (typeof obj$1 === "string") { | ||
hash = Caml_hash_primitive.caml_hash_mix_string(hash, obj$1); | ||
s = Caml_hash_primitive.hash_mix_string(s, obj$1); | ||
num = num - 1 | 0; | ||
@@ -74,5 +73,5 @@ } else if (typeof obj$1 !== "boolean" && typeof obj$1 !== "undefined" && typeof obj$1 !== "symbol" && typeof obj$1 !== "function") { | ||
if (obj_tag === 248) { | ||
hash = Caml_hash_primitive.caml_hash_mix_int(hash, obj$1[1]); | ||
s = Caml_hash_primitive.hash_mix_int(s, obj$1[1]); | ||
} else { | ||
hash = Caml_hash_primitive.caml_hash_mix_int(hash, tag); | ||
s = Caml_hash_primitive.hash_mix_int(s, tag); | ||
var v = size - 1 | 0; | ||
@@ -93,5 +92,5 @@ var block = v < num ? v : num; | ||
})(obj$1, (function (v) { | ||
return push_back(queue, v); | ||
push_back(queue, v); | ||
})); | ||
hash = Caml_hash_primitive.caml_hash_mix_int(hash, (size$1 << 10) | 0); | ||
s = Caml_hash_primitive.hash_mix_int(s, (size$1 << 10) | 0); | ||
} | ||
@@ -101,9 +100,8 @@ } | ||
}; | ||
return Caml_hash_primitive.caml_hash_final_mix(hash); | ||
return Caml_hash_primitive.hash_final_mix(s); | ||
} | ||
export { | ||
caml_hash , | ||
hash , | ||
} | ||
/* No side effect */ |
@@ -27,4 +27,3 @@ | ||
mod_ , | ||
} | ||
/* No side effect */ |
@@ -81,2 +81,10 @@ | ||
function equal(x, y) { | ||
if (x[1] === y[1]) { | ||
return x[0] === y[0]; | ||
} else { | ||
return false; | ||
} | ||
} | ||
function equal_null(x, y) { | ||
@@ -583,2 +591,3 @@ if (y !== null) { | ||
and_ , | ||
equal , | ||
equal_null , | ||
@@ -598,4 +607,3 @@ equal_undefined , | ||
to_string , | ||
} | ||
/* No side effect */ |
@@ -6,10 +6,10 @@ | ||
var $$Error = /* @__PURE__ */Caml_exceptions.create("Caml_js_exceptions.Error"); | ||
var $$Error = "JsError"; | ||
function internalToOCamlException(e) { | ||
if (Caml_exceptions.caml_is_extension(e)) { | ||
if (Caml_exceptions.is_extension(e)) { | ||
return e; | ||
} else { | ||
return { | ||
RE_EXN_ID: $$Error, | ||
RE_EXN_ID: "JsError", | ||
_1: e | ||
@@ -20,3 +20,3 @@ }; | ||
function caml_as_js_exn(exn) { | ||
function as_js_exn(exn) { | ||
if (exn.RE_EXN_ID === $$Error) { | ||
@@ -31,5 +31,4 @@ return Caml_option.some(exn._1); | ||
internalToOCamlException , | ||
caml_as_js_exn , | ||
as_js_exn , | ||
} | ||
/* No side effect */ |
@@ -106,3 +106,3 @@ | ||
function caml_lex_engine(tbls, i, buf) { | ||
function lex_engine(tbls, i, buf) { | ||
return caml_lex_engine_aux(tbls, i, buf, { | ||
@@ -248,3 +248,3 @@ RE_EXN_ID: "Failure", | ||
function caml_new_lex_engine(tbl, i, buf) { | ||
function new_lex_engine(tbl, i, buf) { | ||
return caml_new_lex_engine_aux(tbl, i, buf, { | ||
@@ -257,6 +257,5 @@ RE_EXN_ID: "Failure", | ||
export { | ||
caml_lex_engine , | ||
caml_new_lex_engine , | ||
lex_engine , | ||
new_lex_engine , | ||
} | ||
/* Not a pure module */ |
@@ -98,3 +98,2 @@ | ||
x[3] = d + x[3] | 0; | ||
} | ||
@@ -128,3 +127,3 @@ | ||
function caml_md5_string(s, start, len) { | ||
function md5_string(s, start, len) { | ||
var s$1 = s.slice(start, len); | ||
@@ -169,5 +168,4 @@ var n = s$1.length; | ||
export { | ||
caml_md5_string , | ||
md5_string , | ||
} | ||
/* No side effect */ |
@@ -116,4 +116,3 @@ | ||
update_mod , | ||
} | ||
/* No side effect */ |
@@ -8,3 +8,3 @@ | ||
var caml_obj_dup = (function(x){ | ||
var obj_dup = (function(x){ | ||
if(Array.isArray(x)){ | ||
@@ -40,3 +40,3 @@ var len = x.length | ||
function caml_compare(a, b) { | ||
function compare(a, b) { | ||
if (a === b) { | ||
@@ -50,3 +50,3 @@ return 0; | ||
if (b_type === "boolean") { | ||
return Caml.caml_bool_compare(a, b); | ||
return Caml.bool_compare(a, b); | ||
} | ||
@@ -65,3 +65,3 @@ break; | ||
if (b_type === "number") { | ||
return Caml.caml_int_compare(a, b); | ||
return Caml.int_compare(a, b); | ||
} | ||
@@ -71,3 +71,3 @@ break; | ||
if (b_type === "string") { | ||
return Caml.caml_string_compare(a, b); | ||
return Caml.string_compare(a, b); | ||
} else { | ||
@@ -137,3 +137,3 @@ return 1; | ||
if (tag_a === 248) { | ||
return Caml.caml_int_compare(a[1], b[1]); | ||
return Caml.int_compare(a[1], b[1]); | ||
} | ||
@@ -164,3 +164,3 @@ if (tag_a === 251) { | ||
} | ||
var res = caml_compare(a[i], b[i]); | ||
var res = compare(a[i], b[i]); | ||
if (res !== 0) { | ||
@@ -184,3 +184,3 @@ return res; | ||
} | ||
var res$1 = caml_compare(a[i$1], b[i$1]); | ||
var res$1 = compare(a[i$1], b[i$1]); | ||
if (res$1 !== 0) { | ||
@@ -199,3 +199,3 @@ return res$1; | ||
} | ||
var res$2 = caml_compare(a[i$2], b[i$2]); | ||
var res$2 = compare(a[i$2], b[i$2]); | ||
if (res$2 !== 0) { | ||
@@ -221,3 +221,3 @@ return res$2; | ||
var b = param[1]; | ||
if (!(!b.hasOwnProperty(key) || caml_compare(param[0][key], b[key]) > 0)) { | ||
if (!(!Object.prototype.hasOwnProperty.call(b, key) || compare(param[0][key], b[key]) > 0)) { | ||
return ; | ||
@@ -255,3 +255,3 @@ } | ||
if (match$1 !== undefined) { | ||
return Caml.caml_string_compare(match, match$1); | ||
return Caml.string_compare(match, match$1); | ||
} else { | ||
@@ -267,3 +267,3 @@ return -1; | ||
function caml_equal(a, b) { | ||
function equal(a, b) { | ||
if (a === b) { | ||
@@ -312,3 +312,3 @@ return true; | ||
} | ||
if (!caml_equal(a[i], b[i])) { | ||
if (!equal(a[i], b[i])) { | ||
return false; | ||
@@ -326,3 +326,3 @@ } | ||
var do_key_a = function (key) { | ||
if (!b.hasOwnProperty(key)) { | ||
if (!Object.prototype.hasOwnProperty.call(b, key)) { | ||
result.contents = false; | ||
@@ -334,3 +334,3 @@ return ; | ||
var do_key_b = function (key) { | ||
if (!a.hasOwnProperty(key) || !caml_equal(b[key], a[key])) { | ||
if (!Object.prototype.hasOwnProperty.call(a, key) || !equal(b[key], a[key])) { | ||
result.contents = false; | ||
@@ -352,5 +352,5 @@ return ; | ||
function caml_equal_null(x, y) { | ||
function equal_null(x, y) { | ||
if (y !== null) { | ||
return caml_equal(x, y); | ||
return equal(x, y); | ||
} else { | ||
@@ -361,5 +361,5 @@ return x === y; | ||
function caml_equal_undefined(x, y) { | ||
function equal_undefined(x, y) { | ||
if (y !== undefined) { | ||
return caml_equal(x, y); | ||
return equal(x, y); | ||
} else { | ||
@@ -370,32 +370,32 @@ return x === y; | ||
function caml_equal_nullable(x, y) { | ||
function equal_nullable(x, y) { | ||
if (y == null) { | ||
return x === y; | ||
} else { | ||
return caml_equal(x, y); | ||
return equal(x, y); | ||
} | ||
} | ||
function caml_notequal(a, b) { | ||
return !caml_equal(a, b); | ||
function notequal(a, b) { | ||
return !equal(a, b); | ||
} | ||
function caml_greaterequal(a, b) { | ||
return caml_compare(a, b) >= 0; | ||
function greaterequal(a, b) { | ||
return compare(a, b) >= 0; | ||
} | ||
function caml_greaterthan(a, b) { | ||
return caml_compare(a, b) > 0; | ||
function greaterthan(a, b) { | ||
return compare(a, b) > 0; | ||
} | ||
function caml_lessequal(a, b) { | ||
return caml_compare(a, b) <= 0; | ||
function lessequal(a, b) { | ||
return compare(a, b) <= 0; | ||
} | ||
function caml_lessthan(a, b) { | ||
return caml_compare(a, b) < 0; | ||
function lessthan(a, b) { | ||
return compare(a, b) < 0; | ||
} | ||
function caml_min(x, y) { | ||
if (caml_compare(x, y) <= 0) { | ||
function min(x, y) { | ||
if (compare(x, y) <= 0) { | ||
return x; | ||
@@ -407,4 +407,4 @@ } else { | ||
function caml_max(x, y) { | ||
if (caml_compare(x, y) >= 0) { | ||
function max(x, y) { | ||
if (compare(x, y) >= 0) { | ||
return x; | ||
@@ -417,18 +417,17 @@ } else { | ||
export { | ||
caml_obj_dup , | ||
obj_dup , | ||
update_dummy , | ||
caml_compare , | ||
caml_equal , | ||
caml_equal_null , | ||
caml_equal_undefined , | ||
caml_equal_nullable , | ||
caml_notequal , | ||
caml_greaterequal , | ||
caml_greaterthan , | ||
caml_lessthan , | ||
caml_lessequal , | ||
caml_min , | ||
caml_max , | ||
compare , | ||
equal , | ||
equal_null , | ||
equal_undefined , | ||
equal_nullable , | ||
notequal , | ||
greaterequal , | ||
greaterthan , | ||
lessthan , | ||
lessequal , | ||
min , | ||
max , | ||
} | ||
/* No side effect */ |
@@ -85,4 +85,3 @@ | ||
option_unwrap , | ||
} | ||
/* No side effect */ |
@@ -68,3 +68,3 @@ | ||
var caml_parse_engine = (function (tables /* parser_table */, env /* parser_env */, cmd /* parser_input*/, arg /* Obj.t*/) { | ||
var parse_engine = (function (tables /* parser_table */, env /* parser_env */, cmd /* parser_input*/, arg /* Obj.t*/) { | ||
var ERRCODE = 256; | ||
@@ -294,3 +294,3 @@ //var START = 0; | ||
var caml_set_parser_trace = (function (v) { | ||
var set_parser_trace = (function (v) { | ||
var old = PARSER_TRACE; | ||
@@ -302,6 +302,5 @@ PARSER_TRACE = v; | ||
export { | ||
caml_parse_engine , | ||
caml_set_parser_trace , | ||
parse_engine , | ||
set_parser_trace , | ||
} | ||
/* Not a pure module */ |
@@ -18,2 +18,17 @@ | ||
var spliceNewApply = (function (ctor,args){ | ||
var i, argLen; | ||
argLen = args.length | ||
var applied = [null] // Function.prototype.bind.apply(fn, args) requires the first element in `args` to be `null` | ||
for(i = 0; i < argLen - 1; ++i){ | ||
applied.push(args[i]) | ||
} | ||
var lastOne = args[argLen - 1] | ||
for(i = 0; i < lastOne.length; ++i ){ | ||
applied.push(lastOne[i]) | ||
} | ||
var C = Function.prototype.bind.apply(ctor, applied) | ||
return new C() | ||
}); | ||
var spliceObjApply = (function(obj,name,args){ | ||
@@ -35,5 +50,5 @@ var i, argLen; | ||
spliceApply , | ||
spliceNewApply , | ||
spliceObjApply , | ||
} | ||
/* No side effect */ |
@@ -12,3 +12,3 @@ | ||
} | ||
return s.charCodeAt(i); | ||
return s.codePointAt(i); | ||
} | ||
@@ -23,4 +23,3 @@ | ||
make , | ||
} | ||
/* No side effect */ |
function caml_sys_getenv(s) { | ||
function sys_getenv(s) { | ||
if (typeof process === "undefined" || process.env === undefined) { | ||
@@ -30,3 +30,3 @@ throw { | ||
function caml_sys_time(param) { | ||
function sys_time(param) { | ||
if (typeof process === "undefined" || process.uptime === undefined) { | ||
@@ -39,7 +39,3 @@ return -1; | ||
function caml_sys_system_command(_cmd) { | ||
return 127; | ||
} | ||
var caml_sys_getcwd = (function(param){ | ||
var sys_getcwd = (function(param){ | ||
if (typeof process === "undefined" || process.cwd === undefined){ | ||
@@ -51,3 +47,3 @@ return "/" | ||
function caml_sys_get_argv(param) { | ||
function sys_get_argv(param) { | ||
if (typeof process === "undefined") { | ||
@@ -73,3 +69,3 @@ return [ | ||
function caml_sys_exit(exit_code) { | ||
function sys_exit(exit_code) { | ||
if (typeof process !== "undefined") { | ||
@@ -81,6 +77,6 @@ return process.exit(exit_code); | ||
function caml_sys_is_directory(_s) { | ||
function sys_is_directory(_s) { | ||
throw { | ||
RE_EXN_ID: "Failure", | ||
_1: "caml_sys_is_directory not implemented", | ||
_1: "sys_is_directory not implemented", | ||
Error: new Error() | ||
@@ -90,6 +86,6 @@ }; | ||
function caml_sys_file_exists(_s) { | ||
function sys_file_exists(_s) { | ||
throw { | ||
RE_EXN_ID: "Failure", | ||
_1: "caml_sys_file_exists not implemented", | ||
_1: "sys_file_exists not implemented", | ||
Error: new Error() | ||
@@ -100,13 +96,11 @@ }; | ||
export { | ||
caml_sys_getenv , | ||
caml_sys_time , | ||
sys_getenv , | ||
sys_time , | ||
os_type , | ||
caml_sys_system_command , | ||
caml_sys_getcwd , | ||
caml_sys_get_argv , | ||
caml_sys_exit , | ||
caml_sys_is_directory , | ||
caml_sys_file_exists , | ||
sys_getcwd , | ||
sys_get_argv , | ||
sys_exit , | ||
sys_is_directory , | ||
sys_file_exists , | ||
} | ||
/* No side effect */ |
function caml_int_compare(x, y) { | ||
function int_compare(x, y) { | ||
if (x < y) { | ||
@@ -14,3 +14,3 @@ return -1; | ||
function caml_bool_compare(x, y) { | ||
function bool_compare(x, y) { | ||
if (x) { | ||
@@ -29,3 +29,3 @@ if (y) { | ||
function caml_float_compare(x, y) { | ||
function float_compare(x, y) { | ||
if (x === y) { | ||
@@ -44,3 +44,3 @@ return 0; | ||
function caml_string_compare(s1, s2) { | ||
function string_compare(s1, s2) { | ||
if (s1 === s2) { | ||
@@ -55,3 +55,3 @@ return 0; | ||
function caml_bool_min(x, y) { | ||
function bool_min(x, y) { | ||
if (x) { | ||
@@ -64,3 +64,3 @@ return y; | ||
function caml_int_min(x, y) { | ||
function int_min(x, y) { | ||
if (x < y) { | ||
@@ -73,3 +73,3 @@ return x; | ||
function caml_float_min(x, y) { | ||
function float_min(x, y) { | ||
if (x < y) { | ||
@@ -82,3 +82,3 @@ return x; | ||
function caml_string_min(x, y) { | ||
function string_min(x, y) { | ||
if (x < y) { | ||
@@ -91,11 +91,3 @@ return x; | ||
function caml_int32_min(x, y) { | ||
if (x < y) { | ||
return x; | ||
} else { | ||
return y; | ||
} | ||
} | ||
function caml_bool_max(x, y) { | ||
function bool_max(x, y) { | ||
if (x) { | ||
@@ -108,3 +100,3 @@ return x; | ||
function caml_int_max(x, y) { | ||
function int_max(x, y) { | ||
if (x > y) { | ||
@@ -117,3 +109,3 @@ return x; | ||
function caml_float_max(x, y) { | ||
function float_max(x, y) { | ||
if (x > y) { | ||
@@ -126,3 +118,3 @@ return x; | ||
function caml_string_max(x, y) { | ||
function string_max(x, y) { | ||
if (x > y) { | ||
@@ -135,10 +127,2 @@ return x; | ||
function caml_int32_max(x, y) { | ||
if (x > y) { | ||
return x; | ||
} else { | ||
return y; | ||
} | ||
} | ||
function i64_eq(x, y) { | ||
@@ -203,16 +187,14 @@ if (x[1] === y[1]) { | ||
export { | ||
caml_int_compare , | ||
caml_bool_compare , | ||
caml_float_compare , | ||
caml_string_compare , | ||
caml_bool_min , | ||
caml_int_min , | ||
caml_float_min , | ||
caml_string_min , | ||
caml_int32_min , | ||
caml_bool_max , | ||
caml_int_max , | ||
caml_float_max , | ||
caml_string_max , | ||
caml_int32_max , | ||
int_compare , | ||
bool_compare , | ||
float_compare , | ||
string_compare , | ||
bool_min , | ||
int_min , | ||
float_min , | ||
string_min , | ||
bool_max , | ||
int_max , | ||
float_max , | ||
string_max , | ||
i64_eq , | ||
@@ -226,4 +208,3 @@ i64_neq , | ||
i64_max , | ||
} | ||
/* No side effect */ |
@@ -58,4 +58,3 @@ | ||
is_val , | ||
} | ||
/* No side effect */ |
@@ -125,4 +125,3 @@ | ||
equal , | ||
} | ||
/* No side effect */ |
@@ -175,4 +175,3 @@ | ||
pow , | ||
} | ||
/* No side effect */ |
@@ -525,4 +525,3 @@ | ||
__8 , | ||
} | ||
/* No side effect */ |
import * as Char from "./char.js"; | ||
import * as Bytes from "./bytes.js"; | ||
import * as $$String from "./string.js"; | ||
import * as Caml_md5 from "./caml_md5.js"; | ||
import * as Caml_bytes from "./caml_bytes.js"; | ||
import * as Pervasives from "./pervasives.js"; | ||
import * as Caml_string from "./caml_string.js"; | ||
import * as Caml_external_polyfill from "./caml_external_polyfill.js"; | ||
function string(str) { | ||
return Caml_md5.caml_md5_string(str, 0, str.length); | ||
return Caml_md5.md5_string(str, 0, str.length); | ||
} | ||
function bytes(b) { | ||
return string(Caml_bytes.bytes_to_string(b)); | ||
return string(Bytes.unsafe_to_string(b)); | ||
} | ||
@@ -27,29 +26,9 @@ | ||
} | ||
return Caml_md5.caml_md5_string(str, ofs, len); | ||
return Caml_md5.md5_string(str, ofs, len); | ||
} | ||
function subbytes(b, ofs, len) { | ||
return substring(Caml_bytes.bytes_to_string(b), ofs, len); | ||
return substring(Bytes.unsafe_to_string(b), ofs, len); | ||
} | ||
function file(filename) { | ||
var ic = Pervasives.open_in_bin(filename); | ||
var d; | ||
try { | ||
d = Caml_external_polyfill.resolve("caml_md5_chan")(ic, -1); | ||
} | ||
catch (e){ | ||
Caml_external_polyfill.resolve("caml_ml_close_channel")(ic); | ||
throw e; | ||
} | ||
Caml_external_polyfill.resolve("caml_ml_close_channel")(ic); | ||
return d; | ||
} | ||
var output = Pervasives.output_string; | ||
function input(chan) { | ||
return Pervasives.really_input_string(chan, 16); | ||
} | ||
function char_hex(n) { | ||
@@ -69,3 +48,3 @@ return n + ( | ||
} | ||
var result = Caml_bytes.caml_create_bytes(32); | ||
var result = Caml_bytes.create(32); | ||
for(var i = 0; i <= 15; ++i){ | ||
@@ -76,3 +55,3 @@ var x = Caml_string.get(d, i); | ||
} | ||
return Caml_bytes.bytes_to_string(result); | ||
return Bytes.unsafe_to_string(result); | ||
} | ||
@@ -121,7 +100,7 @@ | ||
}; | ||
var result = Caml_bytes.caml_create_bytes(16); | ||
var result = Caml_bytes.create(16); | ||
for(var i = 0; i <= 15; ++i){ | ||
Caml_bytes.set(result, i, Char.chr($$byte((i << 1)))); | ||
} | ||
return Caml_bytes.bytes_to_string(result); | ||
return Bytes.unsafe_to_string(result); | ||
} | ||
@@ -140,9 +119,5 @@ | ||
subbytes , | ||
file , | ||
output , | ||
input , | ||
to_hex , | ||
from_hex , | ||
} | ||
/* No side effect */ |
@@ -11,3 +11,2 @@ | ||
obj.setItem(k, v); | ||
} | ||
@@ -17,3 +16,2 @@ | ||
obj.removeItem(s); | ||
} | ||
@@ -30,4 +28,3 @@ | ||
key , | ||
} | ||
/* No side effect */ |
@@ -11,4 +11,3 @@ | ||
Storage2 , | ||
} | ||
/* No side effect */ |
@@ -7,11 +7,6 @@ | ||
import * as $$Buffer from "./buffer.js"; | ||
import * as Random from "./random.js"; | ||
import * as $$String from "./string.js"; | ||
import * as Caml_sys from "./caml_sys.js"; | ||
import * as Caml_bytes from "./caml_bytes.js"; | ||
import * as Pervasives from "./pervasives.js"; | ||
import * as Caml_string from "./caml_string.js"; | ||
import * as CamlinternalLazy from "./camlinternalLazy.js"; | ||
import * as Caml_js_exceptions from "./caml_js_exceptions.js"; | ||
import * as Caml_external_polyfill from "./caml_external_polyfill.js"; | ||
@@ -127,3 +122,3 @@ function generic_basename(is_dir_sep, current_dir_name, name) { | ||
try { | ||
temp_dir_name = Caml_sys.caml_sys_getenv("TMPDIR"); | ||
temp_dir_name = Caml_sys.sys_getenv("TMPDIR"); | ||
} | ||
@@ -203,3 +198,3 @@ catch (raw_exn){ | ||
var s = $$String.sub(name, name.length - suff.length | 0, suff.length); | ||
return Caml_bytes.bytes_to_string(Bytes.lowercase_ascii(Caml_bytes.bytes_of_string(s))) === Caml_bytes.bytes_to_string(Bytes.lowercase_ascii(Caml_bytes.bytes_of_string(suff))); | ||
return Bytes.unsafe_to_string(Bytes.lowercase_ascii(Bytes.unsafe_of_string(s))) === Bytes.unsafe_to_string(Bytes.lowercase_ascii(Bytes.unsafe_of_string(suff))); | ||
} | ||
@@ -210,3 +205,3 @@ | ||
try { | ||
temp_dir_name$1 = Caml_sys.caml_sys_getenv("TEMP"); | ||
temp_dir_name$1 = Caml_sys.sys_getenv("TEMP"); | ||
} | ||
@@ -271,3 +266,2 @@ catch (raw_exn$1){ | ||
} | ||
}; | ||
@@ -460,14 +454,2 @@ loop(0); | ||
var prng = { | ||
LAZY_DONE: false, | ||
VAL: (function () { | ||
return Random.State.make_self_init(undefined); | ||
}) | ||
}; | ||
function temp_file_name(temp_dir, prefix, suffix) { | ||
var rnd = Random.State.bits(CamlinternalLazy.force(prng)) & 16777215; | ||
return concat(temp_dir, "" + prefix + rnd + suffix); | ||
} | ||
var current_temp_dir_name = { | ||
@@ -479,3 +461,2 @@ contents: temp_dir_name$2 | ||
current_temp_dir_name.contents = s; | ||
} | ||
@@ -487,75 +468,2 @@ | ||
function temp_file(temp_dirOpt, prefix, suffix) { | ||
var temp_dir = temp_dirOpt !== undefined ? temp_dirOpt : current_temp_dir_name.contents; | ||
var _counter = 0; | ||
while(true) { | ||
var counter = _counter; | ||
var name = temp_file_name(temp_dir, prefix, suffix); | ||
try { | ||
Caml_external_polyfill.resolve("caml_sys_close")(Caml_external_polyfill.resolve("caml_sys_open")(name, { | ||
hd: /* Open_wronly */1, | ||
tl: { | ||
hd: /* Open_creat */3, | ||
tl: { | ||
hd: /* Open_excl */5, | ||
tl: /* [] */0 | ||
} | ||
} | ||
}, 384)); | ||
return name; | ||
} | ||
catch (raw_e){ | ||
var e = Caml_js_exceptions.internalToOCamlException(raw_e); | ||
if (e.RE_EXN_ID === "Sys_error") { | ||
if (counter >= 1000) { | ||
throw e; | ||
} | ||
_counter = counter + 1 | 0; | ||
continue ; | ||
} | ||
throw e; | ||
} | ||
}; | ||
} | ||
function open_temp_file(modeOpt, permsOpt, temp_dirOpt, prefix, suffix) { | ||
var mode = modeOpt !== undefined ? modeOpt : ({ | ||
hd: /* Open_text */7, | ||
tl: /* [] */0 | ||
}); | ||
var perms = permsOpt !== undefined ? permsOpt : 384; | ||
var temp_dir = temp_dirOpt !== undefined ? temp_dirOpt : current_temp_dir_name.contents; | ||
var _counter = 0; | ||
while(true) { | ||
var counter = _counter; | ||
var name = temp_file_name(temp_dir, prefix, suffix); | ||
try { | ||
return [ | ||
name, | ||
Pervasives.open_out_gen({ | ||
hd: /* Open_wronly */1, | ||
tl: { | ||
hd: /* Open_creat */3, | ||
tl: { | ||
hd: /* Open_excl */5, | ||
tl: mode | ||
} | ||
} | ||
}, perms, name) | ||
]; | ||
} | ||
catch (raw_e){ | ||
var e = Caml_js_exceptions.internalToOCamlException(raw_e); | ||
if (e.RE_EXN_ID === "Sys_error") { | ||
if (counter >= 1000) { | ||
throw e; | ||
} | ||
_counter = counter + 1 | 0; | ||
continue ; | ||
} | ||
throw e; | ||
} | ||
}; | ||
} | ||
var current_dir_name$3 = match[0]; | ||
@@ -591,4 +499,2 @@ | ||
dirname$3 as dirname, | ||
temp_file , | ||
open_temp_file , | ||
get_temp_dir_name , | ||
@@ -598,4 +504,3 @@ set_temp_dir_name , | ||
quote$2 as quote, | ||
} | ||
/* temp_dir_name Not a pure module */ |
@@ -13,3 +13,3 @@ | ||
var initial_buffer = Caml_bytes.caml_create_bytes(32); | ||
var initial_buffer = Caml_bytes.create(32); | ||
@@ -27,3 +27,2 @@ var buffer = { | ||
bufpos.contents = 0; | ||
} | ||
@@ -33,3 +32,3 @@ | ||
if (bufpos.contents >= buffer.contents.length) { | ||
var newbuffer = Caml_bytes.caml_create_bytes((bufpos.contents << 1)); | ||
var newbuffer = Caml_bytes.create((bufpos.contents << 1)); | ||
Bytes.blit(buffer.contents, 0, newbuffer, 0, bufpos.contents); | ||
@@ -40,3 +39,2 @@ buffer.contents = newbuffer; | ||
bufpos.contents = bufpos.contents + 1 | 0; | ||
} | ||
@@ -53,6 +51,6 @@ | ||
List.iter((function (s) { | ||
return Hashtbl.add(kwd_table, s, { | ||
TAG: /* Kwd */0, | ||
_0: s | ||
}); | ||
Hashtbl.add(kwd_table, s, { | ||
TAG: /* Kwd */0, | ||
_0: s | ||
}); | ||
}), keywords); | ||
@@ -264,3 +262,3 @@ var ident_or_keyword = function (id) { | ||
exit = c >= 127 ? ( | ||
c >= 192 ? 2 : 1 | ||
c > 255 || c < 192 ? 1 : 2 | ||
) : ( | ||
@@ -285,3 +283,3 @@ c !== 125 ? 3 : 1 | ||
if (c$3 > 122 || c$3 < 95) { | ||
if (c$3 < 192) { | ||
if (c$3 > 255 || c$3 < 192) { | ||
return ident_or_keyword(get_string(undefined)); | ||
@@ -428,3 +426,3 @@ } | ||
TAG: /* Float */3, | ||
_0: Caml_format.caml_float_of_string(get_string(undefined)) | ||
_0: Caml_format.float_of_string(get_string(undefined)) | ||
}; | ||
@@ -436,3 +434,3 @@ }; | ||
TAG: /* Int */2, | ||
_0: Caml_format.caml_int_of_string(get_string(undefined)) | ||
_0: Caml_format.int_of_string(get_string(undefined)) | ||
}; | ||
@@ -457,3 +455,3 @@ }; | ||
TAG: /* Float */3, | ||
_0: Caml_format.caml_float_of_string(get_string(undefined)) | ||
_0: Caml_format.float_of_string(get_string(undefined)) | ||
}; | ||
@@ -464,3 +462,3 @@ } | ||
TAG: /* Float */3, | ||
_0: Caml_format.caml_float_of_string(get_string(undefined)) | ||
_0: Caml_format.float_of_string(get_string(undefined)) | ||
}; | ||
@@ -678,4 +676,3 @@ } | ||
make_lexer , | ||
} | ||
/* No side effect */ |
@@ -15,11 +15,11 @@ | ||
function hash(x) { | ||
return Caml_hash.caml_hash(10, 100, 0, x); | ||
return Caml_hash.hash(10, 100, 0, x); | ||
} | ||
function hash_param(n1, n2, x) { | ||
return Caml_hash.caml_hash(n1, n2, 0, x); | ||
return Caml_hash.hash(n1, n2, 0, x); | ||
} | ||
function seeded_hash(seed, x) { | ||
return Caml_hash.caml_hash(10, 100, seed, x); | ||
return Caml_hash.hash(10, 100, seed, x); | ||
} | ||
@@ -29,3 +29,2 @@ | ||
h.initial_size = -h.initial_size | 0; | ||
} | ||
@@ -39,3 +38,2 @@ | ||
randomized.contents = true; | ||
} | ||
@@ -86,3 +84,2 @@ | ||
} | ||
} | ||
@@ -130,3 +127,3 @@ | ||
"hashtbl.ml", | ||
114, | ||
104, | ||
23 | ||
@@ -214,7 +211,6 @@ ], | ||
} | ||
} | ||
function key_index(h, key) { | ||
return Caml_hash.caml_hash(10, 100, h.seed, key) & (h.data.length - 1 | 0); | ||
return Caml_hash.hash(10, 100, h.seed, key) & (h.data.length - 1 | 0); | ||
} | ||
@@ -249,3 +245,3 @@ | ||
var next = c.next; | ||
if (Caml_obj.caml_equal(k, key)) { | ||
if (Caml_obj.equal(k, key)) { | ||
h.size = h.size - 1 | 0; | ||
@@ -271,3 +267,3 @@ if (prec) { | ||
var next1 = match.next; | ||
if (Caml_obj.caml_equal(key, k1)) { | ||
if (Caml_obj.equal(key, k1)) { | ||
return d1; | ||
@@ -279,3 +275,3 @@ } | ||
var next2 = next1.next; | ||
if (Caml_obj.caml_equal(key, k2)) { | ||
if (Caml_obj.equal(key, k2)) { | ||
return d2; | ||
@@ -287,3 +283,3 @@ } | ||
var next3 = next2.next; | ||
if (Caml_obj.caml_equal(key, k3)) { | ||
if (Caml_obj.equal(key, k3)) { | ||
return d3; | ||
@@ -298,3 +294,3 @@ } else { | ||
var next = param.next; | ||
if (Caml_obj.caml_equal(key, k)) { | ||
if (Caml_obj.equal(key, k)) { | ||
return data; | ||
@@ -336,3 +332,3 @@ } | ||
var next1 = match.next; | ||
if (Caml_obj.caml_equal(key, k1)) { | ||
if (Caml_obj.equal(key, k1)) { | ||
return Caml_option.some(d1); | ||
@@ -346,3 +342,3 @@ } | ||
var next2 = next1.next; | ||
if (Caml_obj.caml_equal(key, k2)) { | ||
if (Caml_obj.equal(key, k2)) { | ||
return Caml_option.some(d2); | ||
@@ -356,3 +352,3 @@ } | ||
var next3 = next2.next; | ||
if (Caml_obj.caml_equal(key, k3)) { | ||
if (Caml_obj.equal(key, k3)) { | ||
return Caml_option.some(d3); | ||
@@ -369,3 +365,3 @@ } else { | ||
var next = param.next; | ||
if (Caml_obj.caml_equal(key, k)) { | ||
if (Caml_obj.equal(key, k)) { | ||
return Caml_option.some(data); | ||
@@ -389,3 +385,3 @@ } | ||
var next = param.next; | ||
if (Caml_obj.caml_equal(k, key)) { | ||
if (Caml_obj.equal(k, key)) { | ||
return { | ||
@@ -411,3 +407,3 @@ hd: data, | ||
var next = slot.next; | ||
if (Caml_obj.caml_equal(k, key)) { | ||
if (Caml_obj.equal(k, key)) { | ||
slot.key = key; | ||
@@ -450,3 +446,3 @@ slot.data = data; | ||
var next = param.next; | ||
if (Caml_obj.caml_equal(k, key)) { | ||
if (Caml_obj.equal(k, key)) { | ||
return true; | ||
@@ -608,3 +604,3 @@ } | ||
var mbl = $$Array.fold_left((function (m, b) { | ||
return Caml.caml_int_max(m, bucket_length(0, b)); | ||
return Caml.int_max(m, bucket_length(0, b)); | ||
}), 0, h.data); | ||
@@ -614,3 +610,3 @@ var histo = Caml_array.make(mbl + 1 | 0, 0); | ||
var l = bucket_length(0, b); | ||
return Caml_array.set(histo, l, Caml_array.get(histo, l) + 1 | 0); | ||
Caml_array.set(histo, l, Caml_array.get(histo, l) + 1 | 0); | ||
}), h.data); | ||
@@ -1111,3 +1107,3 @@ return { | ||
var seeded_hash_param = Caml_hash.caml_hash; | ||
var seeded_hash_param = Caml_hash.hash; | ||
@@ -1139,4 +1135,3 @@ export { | ||
seeded_hash_param , | ||
} | ||
/* No side effect */ |
@@ -28,3 +28,3 @@ | ||
function to_string(n) { | ||
return Caml_format.caml_int32_format("%d", n); | ||
return Caml_format.format_int("%d", n); | ||
} | ||
@@ -34,3 +34,3 @@ | ||
try { | ||
return Caml_format.caml_int32_of_string(s); | ||
return Caml_format.int_of_string(s); | ||
} | ||
@@ -46,3 +46,3 @@ catch (raw_exn){ | ||
var compare = Caml.caml_int_compare; | ||
var compare = Caml.int_compare; | ||
@@ -77,4 +77,3 @@ function equal(x, y) { | ||
equal , | ||
} | ||
/* No side effect */ |
@@ -26,3 +26,3 @@ | ||
try { | ||
return Caml_format.caml_int64_of_string(s); | ||
return Caml_format.int64_of_string(s); | ||
} | ||
@@ -40,5 +40,3 @@ catch (raw_exn){ | ||
function equal(x, y) { | ||
return Caml_int64.compare(x, y) === 0; | ||
} | ||
var equal = Caml_int64.equal; | ||
@@ -73,4 +71,3 @@ var zero = Caml_int64.zero; | ||
equal , | ||
} | ||
/* No side effect */ |
@@ -1,1 +0,223 @@ | ||
/* This output is empty. Its source's type definitions, externals and/or unused code got optimized away. */ | ||
import * as Curry from "./curry.js"; | ||
import * as Caml_option from "./caml_option.js"; | ||
import * as Caml_splice_call from "./caml_splice_call.js"; | ||
function copyWithin(to_, obj) { | ||
return obj.copyWithin(to_); | ||
} | ||
function copyWithinFrom(to_, from, obj) { | ||
return obj.copyWithin(to_, from); | ||
} | ||
function copyWithinFromRange(to_, start, end_, obj) { | ||
return obj.copyWithin(to_, start, end_); | ||
} | ||
function fillInPlace(arg1, obj) { | ||
return obj.fill(arg1); | ||
} | ||
function fillFromInPlace(arg1, from, obj) { | ||
return obj.fill(arg1, from); | ||
} | ||
function fillRangeInPlace(arg1, start, end_, obj) { | ||
return obj.fill(arg1, start, end_); | ||
} | ||
function push(arg1, obj) { | ||
return obj.push(arg1); | ||
} | ||
function pushMany(arg1, obj) { | ||
return Caml_splice_call.spliceObjApply(obj, "push", [arg1]); | ||
} | ||
function sortInPlaceWith(arg1, obj) { | ||
return obj.sort(Curry.__2(arg1)); | ||
} | ||
function spliceInPlace(pos, remove, add, obj) { | ||
return Caml_splice_call.spliceObjApply(obj, "splice", [ | ||
pos, | ||
remove, | ||
add | ||
]); | ||
} | ||
function removeFromInPlace(pos, obj) { | ||
return obj.splice(pos); | ||
} | ||
function removeCountInPlace(pos, count, obj) { | ||
return obj.splice(pos, count); | ||
} | ||
function unshift(arg1, obj) { | ||
return obj.unshift(arg1); | ||
} | ||
function unshiftMany(arg1, obj) { | ||
return Caml_splice_call.spliceObjApply(obj, "unshift", [arg1]); | ||
} | ||
function concat(arg1, obj) { | ||
return obj.concat(arg1); | ||
} | ||
function concatMany(arg1, obj) { | ||
return Caml_splice_call.spliceObjApply(obj, "concat", [arg1]); | ||
} | ||
function includes(arg1, obj) { | ||
return obj.includes(arg1); | ||
} | ||
function indexOf(arg1, obj) { | ||
return obj.indexOf(arg1); | ||
} | ||
function indexOfFrom(arg1, from, obj) { | ||
return obj.indexOf(arg1, from); | ||
} | ||
function joinWith(arg1, obj) { | ||
return obj.join(arg1); | ||
} | ||
function lastIndexOf(arg1, obj) { | ||
return obj.lastIndexOf(arg1); | ||
} | ||
function lastIndexOfFrom(arg1, from, obj) { | ||
return obj.lastIndexOf(arg1, from); | ||
} | ||
function slice(start, end_, obj) { | ||
return obj.slice(start, end_); | ||
} | ||
function sliceFrom(arg1, obj) { | ||
return obj.slice(arg1); | ||
} | ||
function every(arg1, obj) { | ||
return obj.every(Curry.__1(arg1)); | ||
} | ||
function everyi(arg1, obj) { | ||
return obj.every(Curry.__2(arg1)); | ||
} | ||
function filter(arg1, obj) { | ||
return obj.filter(Curry.__1(arg1)); | ||
} | ||
function filteri(arg1, obj) { | ||
return obj.filter(Curry.__2(arg1)); | ||
} | ||
function find(arg1, obj) { | ||
return Caml_option.undefined_to_opt(obj.find(Curry.__1(arg1))); | ||
} | ||
function findi(arg1, obj) { | ||
return Caml_option.undefined_to_opt(obj.find(Curry.__2(arg1))); | ||
} | ||
function findIndex(arg1, obj) { | ||
return obj.findIndex(Curry.__1(arg1)); | ||
} | ||
function findIndexi(arg1, obj) { | ||
return obj.findIndex(Curry.__2(arg1)); | ||
} | ||
function forEach(arg1, obj) { | ||
obj.forEach(Curry.__1(arg1)); | ||
} | ||
function forEachi(arg1, obj) { | ||
obj.forEach(Curry.__2(arg1)); | ||
} | ||
function map(arg1, obj) { | ||
return obj.map(Curry.__1(arg1)); | ||
} | ||
function mapi(arg1, obj) { | ||
return obj.map(Curry.__2(arg1)); | ||
} | ||
function reduce(arg1, arg2, obj) { | ||
return obj.reduce(Curry.__2(arg1), arg2); | ||
} | ||
function reducei(arg1, arg2, obj) { | ||
return obj.reduce(Curry.__3(arg1), arg2); | ||
} | ||
function reduceRight(arg1, arg2, obj) { | ||
return obj.reduceRight(Curry.__2(arg1), arg2); | ||
} | ||
function reduceRighti(arg1, arg2, obj) { | ||
return obj.reduceRight(Curry.__3(arg1), arg2); | ||
} | ||
function some(arg1, obj) { | ||
return obj.some(Curry.__1(arg1)); | ||
} | ||
function somei(arg1, obj) { | ||
return obj.some(Curry.__2(arg1)); | ||
} | ||
export { | ||
copyWithin , | ||
copyWithinFrom , | ||
copyWithinFromRange , | ||
fillInPlace , | ||
fillFromInPlace , | ||
fillRangeInPlace , | ||
push , | ||
pushMany , | ||
sortInPlaceWith , | ||
spliceInPlace , | ||
removeFromInPlace , | ||
removeCountInPlace , | ||
unshift , | ||
unshiftMany , | ||
concat , | ||
concatMany , | ||
includes , | ||
indexOf , | ||
indexOfFrom , | ||
joinWith , | ||
lastIndexOf , | ||
lastIndexOfFrom , | ||
slice , | ||
sliceFrom , | ||
every , | ||
everyi , | ||
filter , | ||
filteri , | ||
find , | ||
findi , | ||
findIndex , | ||
findIndexi , | ||
forEach , | ||
forEachi , | ||
map , | ||
mapi , | ||
reduce , | ||
reducei , | ||
reduceRight , | ||
reduceRighti , | ||
some , | ||
somei , | ||
} | ||
/* No side effect */ |
@@ -84,4 +84,3 @@ | ||
map , | ||
} | ||
/* No side effect */ |
import * as Caml_js_exceptions from "./caml_js_exceptions.js"; | ||
var anyToExnInternal = Caml_js_exceptions.internalToOCamlException; | ||
function raiseError(str) { | ||
@@ -35,7 +32,6 @@ throw new Error(str); | ||
var $$Error$1 = Caml_js_exceptions.$$Error; | ||
var $$Error$1 = "JsError"; | ||
export { | ||
$$Error$1 as $$Error, | ||
anyToExnInternal , | ||
raiseError , | ||
@@ -48,4 +44,3 @@ raiseEvalError , | ||
raiseUriError , | ||
} | ||
/* No side effect */ |
@@ -16,4 +16,3 @@ | ||
min , | ||
} | ||
/* No side effect */ |
@@ -171,4 +171,3 @@ | ||
serializeExn , | ||
} | ||
/* No side effect */ |
@@ -332,4 +332,3 @@ | ||
equal , | ||
} | ||
/* No side effect */ |
@@ -53,4 +53,3 @@ | ||
fromIntAssert , | ||
} | ||
/* No side effect */ |
@@ -49,4 +49,3 @@ | ||
random_int , | ||
} | ||
/* No side effect */ |
@@ -34,4 +34,3 @@ | ||
from_opt , | ||
} | ||
/* No side effect */ |
@@ -48,4 +48,3 @@ | ||
from_opt , | ||
} | ||
/* No side effect */ |
@@ -14,4 +14,3 @@ | ||
Internal , | ||
} | ||
/* No side effect */ |
@@ -103,4 +103,3 @@ | ||
firstSome , | ||
} | ||
/* No side effect */ |
@@ -1,1 +0,17 @@ | ||
/* This output is empty. Its source's type definitions, externals and/or unused code got optimized away. */ | ||
import * as Curry from "./curry.js"; | ||
function then_(arg1, obj) { | ||
return obj.then(Curry.__1(arg1)); | ||
} | ||
function $$catch(arg1, obj) { | ||
return obj.catch(Curry.__1(arg1)); | ||
} | ||
export { | ||
then_ , | ||
$$catch , | ||
} | ||
/* No side effect */ |
@@ -1,1 +0,199 @@ | ||
/* This output is empty. Its source's type definitions, externals and/or unused code got optimized away. */ | ||
import * as Curry from "./curry.js"; | ||
import * as Caml_option from "./caml_option.js"; | ||
import * as Caml_splice_call from "./caml_splice_call.js"; | ||
function charAt(arg1, obj) { | ||
return obj.charAt(arg1); | ||
} | ||
function charCodeAt(arg1, obj) { | ||
return obj.charCodeAt(arg1); | ||
} | ||
function codePointAt(arg1, obj) { | ||
return obj.codePointAt(arg1); | ||
} | ||
function concat(arg1, obj) { | ||
return obj.concat(arg1); | ||
} | ||
function concatMany(arg1, obj) { | ||
return Caml_splice_call.spliceObjApply(obj, "concat", [arg1]); | ||
} | ||
function endsWith(arg1, obj) { | ||
return obj.endsWith(arg1); | ||
} | ||
function endsWithFrom(arg1, arg2, obj) { | ||
return obj.endsWith(arg1, arg2); | ||
} | ||
function includes(arg1, obj) { | ||
return obj.includes(arg1); | ||
} | ||
function includesFrom(arg1, arg2, obj) { | ||
return obj.includes(arg1, arg2); | ||
} | ||
function indexOf(arg1, obj) { | ||
return obj.indexOf(arg1); | ||
} | ||
function indexOfFrom(arg1, arg2, obj) { | ||
return obj.indexOf(arg1, arg2); | ||
} | ||
function lastIndexOf(arg1, obj) { | ||
return obj.lastIndexOf(arg1); | ||
} | ||
function lastIndexOfFrom(arg1, arg2, obj) { | ||
return obj.lastIndexOf(arg1, arg2); | ||
} | ||
function localeCompare(arg1, obj) { | ||
return obj.localeCompare(arg1); | ||
} | ||
function match_(arg1, obj) { | ||
return Caml_option.null_to_opt(obj.match(arg1)); | ||
} | ||
function normalizeByForm(arg1, obj) { | ||
return obj.normalize(arg1); | ||
} | ||
function repeat(arg1, obj) { | ||
return obj.repeat(arg1); | ||
} | ||
function replace(arg1, arg2, obj) { | ||
return obj.replace(arg1, arg2); | ||
} | ||
function replaceByRe(arg1, arg2, obj) { | ||
return obj.replace(arg1, arg2); | ||
} | ||
function unsafeReplaceBy0(arg1, arg2, obj) { | ||
return obj.replace(arg1, Curry.__3(arg2)); | ||
} | ||
function unsafeReplaceBy1(arg1, arg2, obj) { | ||
return obj.replace(arg1, Curry.__4(arg2)); | ||
} | ||
function unsafeReplaceBy2(arg1, arg2, obj) { | ||
return obj.replace(arg1, Curry.__5(arg2)); | ||
} | ||
function unsafeReplaceBy3(arg1, arg2, obj) { | ||
return obj.replace(arg1, Curry.__6(arg2)); | ||
} | ||
function search(arg1, obj) { | ||
return obj.search(arg1); | ||
} | ||
function slice(from, to_, obj) { | ||
return obj.slice(from, to_); | ||
} | ||
function sliceToEnd(from, obj) { | ||
return obj.slice(from); | ||
} | ||
function split(arg1, obj) { | ||
return obj.split(arg1); | ||
} | ||
function splitAtMost(arg1, limit, obj) { | ||
return obj.split(arg1, limit); | ||
} | ||
function splitByRe(arg1, obj) { | ||
return obj.split(arg1); | ||
} | ||
function splitByReAtMost(arg1, limit, obj) { | ||
return obj.split(arg1, limit); | ||
} | ||
function startsWith(arg1, obj) { | ||
return obj.startsWith(arg1); | ||
} | ||
function startsWithFrom(arg1, arg2, obj) { | ||
return obj.startsWith(arg1, arg2); | ||
} | ||
function substr(from, obj) { | ||
return obj.substr(from); | ||
} | ||
function substrAtMost(from, length, obj) { | ||
return obj.substr(from, length); | ||
} | ||
function substring(from, to_, obj) { | ||
return obj.substring(from, to_); | ||
} | ||
function substringToEnd(from, obj) { | ||
return obj.substring(from); | ||
} | ||
function anchor(arg1, obj) { | ||
return obj.anchor(arg1); | ||
} | ||
function link(arg1, obj) { | ||
return obj.link(arg1); | ||
} | ||
export { | ||
charAt , | ||
charCodeAt , | ||
codePointAt , | ||
concat , | ||
concatMany , | ||
endsWith , | ||
endsWithFrom , | ||
includes , | ||
includesFrom , | ||
indexOf , | ||
indexOfFrom , | ||
lastIndexOf , | ||
lastIndexOfFrom , | ||
localeCompare , | ||
match_ , | ||
normalizeByForm , | ||
repeat , | ||
replace , | ||
replaceByRe , | ||
unsafeReplaceBy0 , | ||
unsafeReplaceBy1 , | ||
unsafeReplaceBy2 , | ||
unsafeReplaceBy3 , | ||
search , | ||
slice , | ||
sliceToEnd , | ||
split , | ||
splitAtMost , | ||
splitByRe , | ||
splitByReAtMost , | ||
startsWith , | ||
startsWithFrom , | ||
substr , | ||
substrAtMost , | ||
substring , | ||
substringToEnd , | ||
anchor , | ||
link , | ||
} | ||
/* No side effect */ |
var $$ArrayBuffer = {}; | ||
function slice(start, end_, obj) { | ||
return obj.slice(start, end_); | ||
} | ||
var $$Int8Array = {}; | ||
function sliceFrom(arg1, obj) { | ||
return obj.slice(arg1); | ||
} | ||
var $$Uint8Array = {}; | ||
var $$ArrayBuffer = { | ||
slice: slice, | ||
sliceFrom: sliceFrom | ||
}; | ||
var $$Uint8ClampedArray = {}; | ||
function setArray(arg1, obj) { | ||
obj.set(arg1); | ||
} | ||
var $$Int16Array = {}; | ||
function setArrayOffset(arg1, arg2, obj) { | ||
obj.set(arg1, arg2); | ||
} | ||
var $$Uint16Array = {}; | ||
function copyWithin(to_, obj) { | ||
return obj.copyWithin(to_); | ||
} | ||
var $$Int32Array = {}; | ||
function copyWithinFrom(to_, from, obj) { | ||
return obj.copyWithin(to_, from); | ||
} | ||
var $$Uint32Array = {}; | ||
function copyWithinFromRange(to_, start, end_, obj) { | ||
return obj.copyWithin(to_, start, end_); | ||
} | ||
var $$Float32Array = {}; | ||
function fillInPlace(arg1, obj) { | ||
return obj.fill(arg1); | ||
} | ||
var $$Float64Array = {}; | ||
function fillFromInPlace(arg1, from, obj) { | ||
return obj.fill(arg1, from); | ||
} | ||
function fillRangeInPlace(arg1, start, end_, obj) { | ||
return obj.fill(arg1, start, end_); | ||
} | ||
function sortInPlaceWith(arg1, obj) { | ||
return obj.sort(arg1); | ||
} | ||
function includes(arg1, obj) { | ||
return obj.includes(arg1); | ||
} | ||
function indexOf(arg1, obj) { | ||
return obj.indexOf(arg1); | ||
} | ||
function indexOfFrom(arg1, from, obj) { | ||
return obj.indexOf(arg1, from); | ||
} | ||
function joinWith(arg1, obj) { | ||
return obj.join(arg1); | ||
} | ||
function lastIndexOf(arg1, obj) { | ||
return obj.lastIndexOf(arg1); | ||
} | ||
function lastIndexOfFrom(arg1, from, obj) { | ||
return obj.lastIndexOf(arg1, from); | ||
} | ||
function slice$1(start, end_, obj) { | ||
return obj.slice(start, end_); | ||
} | ||
function sliceFrom$1(arg1, obj) { | ||
return obj.slice(arg1); | ||
} | ||
function subarray(start, end_, obj) { | ||
return obj.subarray(start, end_); | ||
} | ||
function subarrayFrom(arg1, obj) { | ||
return obj.subarray(arg1); | ||
} | ||
function every(arg1, obj) { | ||
return obj.every(arg1); | ||
} | ||
function everyi(arg1, obj) { | ||
return obj.every(arg1); | ||
} | ||
function filter(arg1, obj) { | ||
return obj.filter(arg1); | ||
} | ||
function filteri(arg1, obj) { | ||
return obj.filter(arg1); | ||
} | ||
function find(arg1, obj) { | ||
return obj.find(arg1); | ||
} | ||
function findi(arg1, obj) { | ||
return obj.find(arg1); | ||
} | ||
function findIndex(arg1, obj) { | ||
return obj.findIndex(arg1); | ||
} | ||
function findIndexi(arg1, obj) { | ||
return obj.findIndex(arg1); | ||
} | ||
function forEach(arg1, obj) { | ||
obj.forEach(arg1); | ||
} | ||
function forEachi(arg1, obj) { | ||
obj.forEach(arg1); | ||
} | ||
function map(arg1, obj) { | ||
return obj.map(arg1); | ||
} | ||
function mapi(arg1, obj) { | ||
return obj.map(arg1); | ||
} | ||
function reduce(arg1, arg2, obj) { | ||
return obj.reduce(arg1, arg2); | ||
} | ||
function reducei(arg1, arg2, obj) { | ||
return obj.reduce(arg1, arg2); | ||
} | ||
function reduceRight(arg1, arg2, obj) { | ||
return obj.reduceRight(arg1, arg2); | ||
} | ||
function reduceRighti(arg1, arg2, obj) { | ||
return obj.reduceRight(arg1, arg2); | ||
} | ||
function some(arg1, obj) { | ||
return obj.some(arg1); | ||
} | ||
function somei(arg1, obj) { | ||
return obj.some(arg1); | ||
} | ||
var $$Int8Array = { | ||
setArray: setArray, | ||
setArrayOffset: setArrayOffset, | ||
copyWithin: copyWithin, | ||
copyWithinFrom: copyWithinFrom, | ||
copyWithinFromRange: copyWithinFromRange, | ||
fillInPlace: fillInPlace, | ||
fillFromInPlace: fillFromInPlace, | ||
fillRangeInPlace: fillRangeInPlace, | ||
sortInPlaceWith: sortInPlaceWith, | ||
includes: includes, | ||
indexOf: indexOf, | ||
indexOfFrom: indexOfFrom, | ||
joinWith: joinWith, | ||
lastIndexOf: lastIndexOf, | ||
lastIndexOfFrom: lastIndexOfFrom, | ||
slice: slice$1, | ||
sliceFrom: sliceFrom$1, | ||
subarray: subarray, | ||
subarrayFrom: subarrayFrom, | ||
every: every, | ||
everyi: everyi, | ||
filter: filter, | ||
filteri: filteri, | ||
find: find, | ||
findi: findi, | ||
findIndex: findIndex, | ||
findIndexi: findIndexi, | ||
forEach: forEach, | ||
forEachi: forEachi, | ||
map: map, | ||
mapi: mapi, | ||
reduce: reduce, | ||
reducei: reducei, | ||
reduceRight: reduceRight, | ||
reduceRighti: reduceRighti, | ||
some: some, | ||
somei: somei | ||
}; | ||
function setArray$1(arg1, obj) { | ||
obj.set(arg1); | ||
} | ||
function setArrayOffset$1(arg1, arg2, obj) { | ||
obj.set(arg1, arg2); | ||
} | ||
function copyWithin$1(to_, obj) { | ||
return obj.copyWithin(to_); | ||
} | ||
function copyWithinFrom$1(to_, from, obj) { | ||
return obj.copyWithin(to_, from); | ||
} | ||
function copyWithinFromRange$1(to_, start, end_, obj) { | ||
return obj.copyWithin(to_, start, end_); | ||
} | ||
function fillInPlace$1(arg1, obj) { | ||
return obj.fill(arg1); | ||
} | ||
function fillFromInPlace$1(arg1, from, obj) { | ||
return obj.fill(arg1, from); | ||
} | ||
function fillRangeInPlace$1(arg1, start, end_, obj) { | ||
return obj.fill(arg1, start, end_); | ||
} | ||
function sortInPlaceWith$1(arg1, obj) { | ||
return obj.sort(arg1); | ||
} | ||
function includes$1(arg1, obj) { | ||
return obj.includes(arg1); | ||
} | ||
function indexOf$1(arg1, obj) { | ||
return obj.indexOf(arg1); | ||
} | ||
function indexOfFrom$1(arg1, from, obj) { | ||
return obj.indexOf(arg1, from); | ||
} | ||
function joinWith$1(arg1, obj) { | ||
return obj.join(arg1); | ||
} | ||
function lastIndexOf$1(arg1, obj) { | ||
return obj.lastIndexOf(arg1); | ||
} | ||
function lastIndexOfFrom$1(arg1, from, obj) { | ||
return obj.lastIndexOf(arg1, from); | ||
} | ||
function slice$2(start, end_, obj) { | ||
return obj.slice(start, end_); | ||
} | ||
function sliceFrom$2(arg1, obj) { | ||
return obj.slice(arg1); | ||
} | ||
function subarray$1(start, end_, obj) { | ||
return obj.subarray(start, end_); | ||
} | ||
function subarrayFrom$1(arg1, obj) { | ||
return obj.subarray(arg1); | ||
} | ||
function every$1(arg1, obj) { | ||
return obj.every(arg1); | ||
} | ||
function everyi$1(arg1, obj) { | ||
return obj.every(arg1); | ||
} | ||
function filter$1(arg1, obj) { | ||
return obj.filter(arg1); | ||
} | ||
function filteri$1(arg1, obj) { | ||
return obj.filter(arg1); | ||
} | ||
function find$1(arg1, obj) { | ||
return obj.find(arg1); | ||
} | ||
function findi$1(arg1, obj) { | ||
return obj.find(arg1); | ||
} | ||
function findIndex$1(arg1, obj) { | ||
return obj.findIndex(arg1); | ||
} | ||
function findIndexi$1(arg1, obj) { | ||
return obj.findIndex(arg1); | ||
} | ||
function forEach$1(arg1, obj) { | ||
obj.forEach(arg1); | ||
} | ||
function forEachi$1(arg1, obj) { | ||
obj.forEach(arg1); | ||
} | ||
function map$1(arg1, obj) { | ||
return obj.map(arg1); | ||
} | ||
function mapi$1(arg1, obj) { | ||
return obj.map(arg1); | ||
} | ||
function reduce$1(arg1, arg2, obj) { | ||
return obj.reduce(arg1, arg2); | ||
} | ||
function reducei$1(arg1, arg2, obj) { | ||
return obj.reduce(arg1, arg2); | ||
} | ||
function reduceRight$1(arg1, arg2, obj) { | ||
return obj.reduceRight(arg1, arg2); | ||
} | ||
function reduceRighti$1(arg1, arg2, obj) { | ||
return obj.reduceRight(arg1, arg2); | ||
} | ||
function some$1(arg1, obj) { | ||
return obj.some(arg1); | ||
} | ||
function somei$1(arg1, obj) { | ||
return obj.some(arg1); | ||
} | ||
var $$Uint8Array = { | ||
setArray: setArray$1, | ||
setArrayOffset: setArrayOffset$1, | ||
copyWithin: copyWithin$1, | ||
copyWithinFrom: copyWithinFrom$1, | ||
copyWithinFromRange: copyWithinFromRange$1, | ||
fillInPlace: fillInPlace$1, | ||
fillFromInPlace: fillFromInPlace$1, | ||
fillRangeInPlace: fillRangeInPlace$1, | ||
sortInPlaceWith: sortInPlaceWith$1, | ||
includes: includes$1, | ||
indexOf: indexOf$1, | ||
indexOfFrom: indexOfFrom$1, | ||
joinWith: joinWith$1, | ||
lastIndexOf: lastIndexOf$1, | ||
lastIndexOfFrom: lastIndexOfFrom$1, | ||
slice: slice$2, | ||
sliceFrom: sliceFrom$2, | ||
subarray: subarray$1, | ||
subarrayFrom: subarrayFrom$1, | ||
every: every$1, | ||
everyi: everyi$1, | ||
filter: filter$1, | ||
filteri: filteri$1, | ||
find: find$1, | ||
findi: findi$1, | ||
findIndex: findIndex$1, | ||
findIndexi: findIndexi$1, | ||
forEach: forEach$1, | ||
forEachi: forEachi$1, | ||
map: map$1, | ||
mapi: mapi$1, | ||
reduce: reduce$1, | ||
reducei: reducei$1, | ||
reduceRight: reduceRight$1, | ||
reduceRighti: reduceRighti$1, | ||
some: some$1, | ||
somei: somei$1 | ||
}; | ||
function setArray$2(arg1, obj) { | ||
obj.set(arg1); | ||
} | ||
function setArrayOffset$2(arg1, arg2, obj) { | ||
obj.set(arg1, arg2); | ||
} | ||
function copyWithin$2(to_, obj) { | ||
return obj.copyWithin(to_); | ||
} | ||
function copyWithinFrom$2(to_, from, obj) { | ||
return obj.copyWithin(to_, from); | ||
} | ||
function copyWithinFromRange$2(to_, start, end_, obj) { | ||
return obj.copyWithin(to_, start, end_); | ||
} | ||
function fillInPlace$2(arg1, obj) { | ||
return obj.fill(arg1); | ||
} | ||
function fillFromInPlace$2(arg1, from, obj) { | ||
return obj.fill(arg1, from); | ||
} | ||
function fillRangeInPlace$2(arg1, start, end_, obj) { | ||
return obj.fill(arg1, start, end_); | ||
} | ||
function sortInPlaceWith$2(arg1, obj) { | ||
return obj.sort(arg1); | ||
} | ||
function includes$2(arg1, obj) { | ||
return obj.includes(arg1); | ||
} | ||
function indexOf$2(arg1, obj) { | ||
return obj.indexOf(arg1); | ||
} | ||
function indexOfFrom$2(arg1, from, obj) { | ||
return obj.indexOf(arg1, from); | ||
} | ||
function joinWith$2(arg1, obj) { | ||
return obj.join(arg1); | ||
} | ||
function lastIndexOf$2(arg1, obj) { | ||
return obj.lastIndexOf(arg1); | ||
} | ||
function lastIndexOfFrom$2(arg1, from, obj) { | ||
return obj.lastIndexOf(arg1, from); | ||
} | ||
function slice$3(start, end_, obj) { | ||
return obj.slice(start, end_); | ||
} | ||
function sliceFrom$3(arg1, obj) { | ||
return obj.slice(arg1); | ||
} | ||
function subarray$2(start, end_, obj) { | ||
return obj.subarray(start, end_); | ||
} | ||
function subarrayFrom$2(arg1, obj) { | ||
return obj.subarray(arg1); | ||
} | ||
function every$2(arg1, obj) { | ||
return obj.every(arg1); | ||
} | ||
function everyi$2(arg1, obj) { | ||
return obj.every(arg1); | ||
} | ||
function filter$2(arg1, obj) { | ||
return obj.filter(arg1); | ||
} | ||
function filteri$2(arg1, obj) { | ||
return obj.filter(arg1); | ||
} | ||
function find$2(arg1, obj) { | ||
return obj.find(arg1); | ||
} | ||
function findi$2(arg1, obj) { | ||
return obj.find(arg1); | ||
} | ||
function findIndex$2(arg1, obj) { | ||
return obj.findIndex(arg1); | ||
} | ||
function findIndexi$2(arg1, obj) { | ||
return obj.findIndex(arg1); | ||
} | ||
function forEach$2(arg1, obj) { | ||
obj.forEach(arg1); | ||
} | ||
function forEachi$2(arg1, obj) { | ||
obj.forEach(arg1); | ||
} | ||
function map$2(arg1, obj) { | ||
return obj.map(arg1); | ||
} | ||
function mapi$2(arg1, obj) { | ||
return obj.map(arg1); | ||
} | ||
function reduce$2(arg1, arg2, obj) { | ||
return obj.reduce(arg1, arg2); | ||
} | ||
function reducei$2(arg1, arg2, obj) { | ||
return obj.reduce(arg1, arg2); | ||
} | ||
function reduceRight$2(arg1, arg2, obj) { | ||
return obj.reduceRight(arg1, arg2); | ||
} | ||
function reduceRighti$2(arg1, arg2, obj) { | ||
return obj.reduceRight(arg1, arg2); | ||
} | ||
function some$2(arg1, obj) { | ||
return obj.some(arg1); | ||
} | ||
function somei$2(arg1, obj) { | ||
return obj.some(arg1); | ||
} | ||
var $$Uint8ClampedArray = { | ||
setArray: setArray$2, | ||
setArrayOffset: setArrayOffset$2, | ||
copyWithin: copyWithin$2, | ||
copyWithinFrom: copyWithinFrom$2, | ||
copyWithinFromRange: copyWithinFromRange$2, | ||
fillInPlace: fillInPlace$2, | ||
fillFromInPlace: fillFromInPlace$2, | ||
fillRangeInPlace: fillRangeInPlace$2, | ||
sortInPlaceWith: sortInPlaceWith$2, | ||
includes: includes$2, | ||
indexOf: indexOf$2, | ||
indexOfFrom: indexOfFrom$2, | ||
joinWith: joinWith$2, | ||
lastIndexOf: lastIndexOf$2, | ||
lastIndexOfFrom: lastIndexOfFrom$2, | ||
slice: slice$3, | ||
sliceFrom: sliceFrom$3, | ||
subarray: subarray$2, | ||
subarrayFrom: subarrayFrom$2, | ||
every: every$2, | ||
everyi: everyi$2, | ||
filter: filter$2, | ||
filteri: filteri$2, | ||
find: find$2, | ||
findi: findi$2, | ||
findIndex: findIndex$2, | ||
findIndexi: findIndexi$2, | ||
forEach: forEach$2, | ||
forEachi: forEachi$2, | ||
map: map$2, | ||
mapi: mapi$2, | ||
reduce: reduce$2, | ||
reducei: reducei$2, | ||
reduceRight: reduceRight$2, | ||
reduceRighti: reduceRighti$2, | ||
some: some$2, | ||
somei: somei$2 | ||
}; | ||
function setArray$3(arg1, obj) { | ||
obj.set(arg1); | ||
} | ||
function setArrayOffset$3(arg1, arg2, obj) { | ||
obj.set(arg1, arg2); | ||
} | ||
function copyWithin$3(to_, obj) { | ||
return obj.copyWithin(to_); | ||
} | ||
function copyWithinFrom$3(to_, from, obj) { | ||
return obj.copyWithin(to_, from); | ||
} | ||
function copyWithinFromRange$3(to_, start, end_, obj) { | ||
return obj.copyWithin(to_, start, end_); | ||
} | ||
function fillInPlace$3(arg1, obj) { | ||
return obj.fill(arg1); | ||
} | ||
function fillFromInPlace$3(arg1, from, obj) { | ||
return obj.fill(arg1, from); | ||
} | ||
function fillRangeInPlace$3(arg1, start, end_, obj) { | ||
return obj.fill(arg1, start, end_); | ||
} | ||
function sortInPlaceWith$3(arg1, obj) { | ||
return obj.sort(arg1); | ||
} | ||
function includes$3(arg1, obj) { | ||
return obj.includes(arg1); | ||
} | ||
function indexOf$3(arg1, obj) { | ||
return obj.indexOf(arg1); | ||
} | ||
function indexOfFrom$3(arg1, from, obj) { | ||
return obj.indexOf(arg1, from); | ||
} | ||
function joinWith$3(arg1, obj) { | ||
return obj.join(arg1); | ||
} | ||
function lastIndexOf$3(arg1, obj) { | ||
return obj.lastIndexOf(arg1); | ||
} | ||
function lastIndexOfFrom$3(arg1, from, obj) { | ||
return obj.lastIndexOf(arg1, from); | ||
} | ||
function slice$4(start, end_, obj) { | ||
return obj.slice(start, end_); | ||
} | ||
function sliceFrom$4(arg1, obj) { | ||
return obj.slice(arg1); | ||
} | ||
function subarray$3(start, end_, obj) { | ||
return obj.subarray(start, end_); | ||
} | ||
function subarrayFrom$3(arg1, obj) { | ||
return obj.subarray(arg1); | ||
} | ||
function every$3(arg1, obj) { | ||
return obj.every(arg1); | ||
} | ||
function everyi$3(arg1, obj) { | ||
return obj.every(arg1); | ||
} | ||
function filter$3(arg1, obj) { | ||
return obj.filter(arg1); | ||
} | ||
function filteri$3(arg1, obj) { | ||
return obj.filter(arg1); | ||
} | ||
function find$3(arg1, obj) { | ||
return obj.find(arg1); | ||
} | ||
function findi$3(arg1, obj) { | ||
return obj.find(arg1); | ||
} | ||
function findIndex$3(arg1, obj) { | ||
return obj.findIndex(arg1); | ||
} | ||
function findIndexi$3(arg1, obj) { | ||
return obj.findIndex(arg1); | ||
} | ||
function forEach$3(arg1, obj) { | ||
obj.forEach(arg1); | ||
} | ||
function forEachi$3(arg1, obj) { | ||
obj.forEach(arg1); | ||
} | ||
function map$3(arg1, obj) { | ||
return obj.map(arg1); | ||
} | ||
function mapi$3(arg1, obj) { | ||
return obj.map(arg1); | ||
} | ||
function reduce$3(arg1, arg2, obj) { | ||
return obj.reduce(arg1, arg2); | ||
} | ||
function reducei$3(arg1, arg2, obj) { | ||
return obj.reduce(arg1, arg2); | ||
} | ||
function reduceRight$3(arg1, arg2, obj) { | ||
return obj.reduceRight(arg1, arg2); | ||
} | ||
function reduceRighti$3(arg1, arg2, obj) { | ||
return obj.reduceRight(arg1, arg2); | ||
} | ||
function some$3(arg1, obj) { | ||
return obj.some(arg1); | ||
} | ||
function somei$3(arg1, obj) { | ||
return obj.some(arg1); | ||
} | ||
var $$Int16Array = { | ||
setArray: setArray$3, | ||
setArrayOffset: setArrayOffset$3, | ||
copyWithin: copyWithin$3, | ||
copyWithinFrom: copyWithinFrom$3, | ||
copyWithinFromRange: copyWithinFromRange$3, | ||
fillInPlace: fillInPlace$3, | ||
fillFromInPlace: fillFromInPlace$3, | ||
fillRangeInPlace: fillRangeInPlace$3, | ||
sortInPlaceWith: sortInPlaceWith$3, | ||
includes: includes$3, | ||
indexOf: indexOf$3, | ||
indexOfFrom: indexOfFrom$3, | ||
joinWith: joinWith$3, | ||
lastIndexOf: lastIndexOf$3, | ||
lastIndexOfFrom: lastIndexOfFrom$3, | ||
slice: slice$4, | ||
sliceFrom: sliceFrom$4, | ||
subarray: subarray$3, | ||
subarrayFrom: subarrayFrom$3, | ||
every: every$3, | ||
everyi: everyi$3, | ||
filter: filter$3, | ||
filteri: filteri$3, | ||
find: find$3, | ||
findi: findi$3, | ||
findIndex: findIndex$3, | ||
findIndexi: findIndexi$3, | ||
forEach: forEach$3, | ||
forEachi: forEachi$3, | ||
map: map$3, | ||
mapi: mapi$3, | ||
reduce: reduce$3, | ||
reducei: reducei$3, | ||
reduceRight: reduceRight$3, | ||
reduceRighti: reduceRighti$3, | ||
some: some$3, | ||
somei: somei$3 | ||
}; | ||
function setArray$4(arg1, obj) { | ||
obj.set(arg1); | ||
} | ||
function setArrayOffset$4(arg1, arg2, obj) { | ||
obj.set(arg1, arg2); | ||
} | ||
function copyWithin$4(to_, obj) { | ||
return obj.copyWithin(to_); | ||
} | ||
function copyWithinFrom$4(to_, from, obj) { | ||
return obj.copyWithin(to_, from); | ||
} | ||
function copyWithinFromRange$4(to_, start, end_, obj) { | ||
return obj.copyWithin(to_, start, end_); | ||
} | ||
function fillInPlace$4(arg1, obj) { | ||
return obj.fill(arg1); | ||
} | ||
function fillFromInPlace$4(arg1, from, obj) { | ||
return obj.fill(arg1, from); | ||
} | ||
function fillRangeInPlace$4(arg1, start, end_, obj) { | ||
return obj.fill(arg1, start, end_); | ||
} | ||
function sortInPlaceWith$4(arg1, obj) { | ||
return obj.sort(arg1); | ||
} | ||
function includes$4(arg1, obj) { | ||
return obj.includes(arg1); | ||
} | ||
function indexOf$4(arg1, obj) { | ||
return obj.indexOf(arg1); | ||
} | ||
function indexOfFrom$4(arg1, from, obj) { | ||
return obj.indexOf(arg1, from); | ||
} | ||
function joinWith$4(arg1, obj) { | ||
return obj.join(arg1); | ||
} | ||
function lastIndexOf$4(arg1, obj) { | ||
return obj.lastIndexOf(arg1); | ||
} | ||
function lastIndexOfFrom$4(arg1, from, obj) { | ||
return obj.lastIndexOf(arg1, from); | ||
} | ||
function slice$5(start, end_, obj) { | ||
return obj.slice(start, end_); | ||
} | ||
function sliceFrom$5(arg1, obj) { | ||
return obj.slice(arg1); | ||
} | ||
function subarray$4(start, end_, obj) { | ||
return obj.subarray(start, end_); | ||
} | ||
function subarrayFrom$4(arg1, obj) { | ||
return obj.subarray(arg1); | ||
} | ||
function every$4(arg1, obj) { | ||
return obj.every(arg1); | ||
} | ||
function everyi$4(arg1, obj) { | ||
return obj.every(arg1); | ||
} | ||
function filter$4(arg1, obj) { | ||
return obj.filter(arg1); | ||
} | ||
function filteri$4(arg1, obj) { | ||
return obj.filter(arg1); | ||
} | ||
function find$4(arg1, obj) { | ||
return obj.find(arg1); | ||
} | ||
function findi$4(arg1, obj) { | ||
return obj.find(arg1); | ||
} | ||
function findIndex$4(arg1, obj) { | ||
return obj.findIndex(arg1); | ||
} | ||
function findIndexi$4(arg1, obj) { | ||
return obj.findIndex(arg1); | ||
} | ||
function forEach$4(arg1, obj) { | ||
obj.forEach(arg1); | ||
} | ||
function forEachi$4(arg1, obj) { | ||
obj.forEach(arg1); | ||
} | ||
function map$4(arg1, obj) { | ||
return obj.map(arg1); | ||
} | ||
function mapi$4(arg1, obj) { | ||
return obj.map(arg1); | ||
} | ||
function reduce$4(arg1, arg2, obj) { | ||
return obj.reduce(arg1, arg2); | ||
} | ||
function reducei$4(arg1, arg2, obj) { | ||
return obj.reduce(arg1, arg2); | ||
} | ||
function reduceRight$4(arg1, arg2, obj) { | ||
return obj.reduceRight(arg1, arg2); | ||
} | ||
function reduceRighti$4(arg1, arg2, obj) { | ||
return obj.reduceRight(arg1, arg2); | ||
} | ||
function some$4(arg1, obj) { | ||
return obj.some(arg1); | ||
} | ||
function somei$4(arg1, obj) { | ||
return obj.some(arg1); | ||
} | ||
var $$Uint16Array = { | ||
setArray: setArray$4, | ||
setArrayOffset: setArrayOffset$4, | ||
copyWithin: copyWithin$4, | ||
copyWithinFrom: copyWithinFrom$4, | ||
copyWithinFromRange: copyWithinFromRange$4, | ||
fillInPlace: fillInPlace$4, | ||
fillFromInPlace: fillFromInPlace$4, | ||
fillRangeInPlace: fillRangeInPlace$4, | ||
sortInPlaceWith: sortInPlaceWith$4, | ||
includes: includes$4, | ||
indexOf: indexOf$4, | ||
indexOfFrom: indexOfFrom$4, | ||
joinWith: joinWith$4, | ||
lastIndexOf: lastIndexOf$4, | ||
lastIndexOfFrom: lastIndexOfFrom$4, | ||
slice: slice$5, | ||
sliceFrom: sliceFrom$5, | ||
subarray: subarray$4, | ||
subarrayFrom: subarrayFrom$4, | ||
every: every$4, | ||
everyi: everyi$4, | ||
filter: filter$4, | ||
filteri: filteri$4, | ||
find: find$4, | ||
findi: findi$4, | ||
findIndex: findIndex$4, | ||
findIndexi: findIndexi$4, | ||
forEach: forEach$4, | ||
forEachi: forEachi$4, | ||
map: map$4, | ||
mapi: mapi$4, | ||
reduce: reduce$4, | ||
reducei: reducei$4, | ||
reduceRight: reduceRight$4, | ||
reduceRighti: reduceRighti$4, | ||
some: some$4, | ||
somei: somei$4 | ||
}; | ||
function setArray$5(arg1, obj) { | ||
obj.set(arg1); | ||
} | ||
function setArrayOffset$5(arg1, arg2, obj) { | ||
obj.set(arg1, arg2); | ||
} | ||
function copyWithin$5(to_, obj) { | ||
return obj.copyWithin(to_); | ||
} | ||
function copyWithinFrom$5(to_, from, obj) { | ||
return obj.copyWithin(to_, from); | ||
} | ||
function copyWithinFromRange$5(to_, start, end_, obj) { | ||
return obj.copyWithin(to_, start, end_); | ||
} | ||
function fillInPlace$5(arg1, obj) { | ||
return obj.fill(arg1); | ||
} | ||
function fillFromInPlace$5(arg1, from, obj) { | ||
return obj.fill(arg1, from); | ||
} | ||
function fillRangeInPlace$5(arg1, start, end_, obj) { | ||
return obj.fill(arg1, start, end_); | ||
} | ||
function sortInPlaceWith$5(arg1, obj) { | ||
return obj.sort(arg1); | ||
} | ||
function includes$5(arg1, obj) { | ||
return obj.includes(arg1); | ||
} | ||
function indexOf$5(arg1, obj) { | ||
return obj.indexOf(arg1); | ||
} | ||
function indexOfFrom$5(arg1, from, obj) { | ||
return obj.indexOf(arg1, from); | ||
} | ||
function joinWith$5(arg1, obj) { | ||
return obj.join(arg1); | ||
} | ||
function lastIndexOf$5(arg1, obj) { | ||
return obj.lastIndexOf(arg1); | ||
} | ||
function lastIndexOfFrom$5(arg1, from, obj) { | ||
return obj.lastIndexOf(arg1, from); | ||
} | ||
function slice$6(start, end_, obj) { | ||
return obj.slice(start, end_); | ||
} | ||
function sliceFrom$6(arg1, obj) { | ||
return obj.slice(arg1); | ||
} | ||
function subarray$5(start, end_, obj) { | ||
return obj.subarray(start, end_); | ||
} | ||
function subarrayFrom$5(arg1, obj) { | ||
return obj.subarray(arg1); | ||
} | ||
function every$5(arg1, obj) { | ||
return obj.every(arg1); | ||
} | ||
function everyi$5(arg1, obj) { | ||
return obj.every(arg1); | ||
} | ||
function filter$5(arg1, obj) { | ||
return obj.filter(arg1); | ||
} | ||
function filteri$5(arg1, obj) { | ||
return obj.filter(arg1); | ||
} | ||
function find$5(arg1, obj) { | ||
return obj.find(arg1); | ||
} | ||
function findi$5(arg1, obj) { | ||
return obj.find(arg1); | ||
} | ||
function findIndex$5(arg1, obj) { | ||
return obj.findIndex(arg1); | ||
} | ||
function findIndexi$5(arg1, obj) { | ||
return obj.findIndex(arg1); | ||
} | ||
function forEach$5(arg1, obj) { | ||
obj.forEach(arg1); | ||
} | ||
function forEachi$5(arg1, obj) { | ||
obj.forEach(arg1); | ||
} | ||
function map$5(arg1, obj) { | ||
return obj.map(arg1); | ||
} | ||
function mapi$5(arg1, obj) { | ||
return obj.map(arg1); | ||
} | ||
function reduce$5(arg1, arg2, obj) { | ||
return obj.reduce(arg1, arg2); | ||
} | ||
function reducei$5(arg1, arg2, obj) { | ||
return obj.reduce(arg1, arg2); | ||
} | ||
function reduceRight$5(arg1, arg2, obj) { | ||
return obj.reduceRight(arg1, arg2); | ||
} | ||
function reduceRighti$5(arg1, arg2, obj) { | ||
return obj.reduceRight(arg1, arg2); | ||
} | ||
function some$5(arg1, obj) { | ||
return obj.some(arg1); | ||
} | ||
function somei$5(arg1, obj) { | ||
return obj.some(arg1); | ||
} | ||
var $$Int32Array = { | ||
setArray: setArray$5, | ||
setArrayOffset: setArrayOffset$5, | ||
copyWithin: copyWithin$5, | ||
copyWithinFrom: copyWithinFrom$5, | ||
copyWithinFromRange: copyWithinFromRange$5, | ||
fillInPlace: fillInPlace$5, | ||
fillFromInPlace: fillFromInPlace$5, | ||
fillRangeInPlace: fillRangeInPlace$5, | ||
sortInPlaceWith: sortInPlaceWith$5, | ||
includes: includes$5, | ||
indexOf: indexOf$5, | ||
indexOfFrom: indexOfFrom$5, | ||
joinWith: joinWith$5, | ||
lastIndexOf: lastIndexOf$5, | ||
lastIndexOfFrom: lastIndexOfFrom$5, | ||
slice: slice$6, | ||
sliceFrom: sliceFrom$6, | ||
subarray: subarray$5, | ||
subarrayFrom: subarrayFrom$5, | ||
every: every$5, | ||
everyi: everyi$5, | ||
filter: filter$5, | ||
filteri: filteri$5, | ||
find: find$5, | ||
findi: findi$5, | ||
findIndex: findIndex$5, | ||
findIndexi: findIndexi$5, | ||
forEach: forEach$5, | ||
forEachi: forEachi$5, | ||
map: map$5, | ||
mapi: mapi$5, | ||
reduce: reduce$5, | ||
reducei: reducei$5, | ||
reduceRight: reduceRight$5, | ||
reduceRighti: reduceRighti$5, | ||
some: some$5, | ||
somei: somei$5 | ||
}; | ||
function setArray$6(arg1, obj) { | ||
obj.set(arg1); | ||
} | ||
function setArrayOffset$6(arg1, arg2, obj) { | ||
obj.set(arg1, arg2); | ||
} | ||
function copyWithin$6(to_, obj) { | ||
return obj.copyWithin(to_); | ||
} | ||
function copyWithinFrom$6(to_, from, obj) { | ||
return obj.copyWithin(to_, from); | ||
} | ||
function copyWithinFromRange$6(to_, start, end_, obj) { | ||
return obj.copyWithin(to_, start, end_); | ||
} | ||
function fillInPlace$6(arg1, obj) { | ||
return obj.fill(arg1); | ||
} | ||
function fillFromInPlace$6(arg1, from, obj) { | ||
return obj.fill(arg1, from); | ||
} | ||
function fillRangeInPlace$6(arg1, start, end_, obj) { | ||
return obj.fill(arg1, start, end_); | ||
} | ||
function sortInPlaceWith$6(arg1, obj) { | ||
return obj.sort(arg1); | ||
} | ||
function includes$6(arg1, obj) { | ||
return obj.includes(arg1); | ||
} | ||
function indexOf$6(arg1, obj) { | ||
return obj.indexOf(arg1); | ||
} | ||
function indexOfFrom$6(arg1, from, obj) { | ||
return obj.indexOf(arg1, from); | ||
} | ||
function joinWith$6(arg1, obj) { | ||
return obj.join(arg1); | ||
} | ||
function lastIndexOf$6(arg1, obj) { | ||
return obj.lastIndexOf(arg1); | ||
} | ||
function lastIndexOfFrom$6(arg1, from, obj) { | ||
return obj.lastIndexOf(arg1, from); | ||
} | ||
function slice$7(start, end_, obj) { | ||
return obj.slice(start, end_); | ||
} | ||
function sliceFrom$7(arg1, obj) { | ||
return obj.slice(arg1); | ||
} | ||
function subarray$6(start, end_, obj) { | ||
return obj.subarray(start, end_); | ||
} | ||
function subarrayFrom$6(arg1, obj) { | ||
return obj.subarray(arg1); | ||
} | ||
function every$6(arg1, obj) { | ||
return obj.every(arg1); | ||
} | ||
function everyi$6(arg1, obj) { | ||
return obj.every(arg1); | ||
} | ||
function filter$6(arg1, obj) { | ||
return obj.filter(arg1); | ||
} | ||
function filteri$6(arg1, obj) { | ||
return obj.filter(arg1); | ||
} | ||
function find$6(arg1, obj) { | ||
return obj.find(arg1); | ||
} | ||
function findi$6(arg1, obj) { | ||
return obj.find(arg1); | ||
} | ||
function findIndex$6(arg1, obj) { | ||
return obj.findIndex(arg1); | ||
} | ||
function findIndexi$6(arg1, obj) { | ||
return obj.findIndex(arg1); | ||
} | ||
function forEach$6(arg1, obj) { | ||
obj.forEach(arg1); | ||
} | ||
function forEachi$6(arg1, obj) { | ||
obj.forEach(arg1); | ||
} | ||
function map$6(arg1, obj) { | ||
return obj.map(arg1); | ||
} | ||
function mapi$6(arg1, obj) { | ||
return obj.map(arg1); | ||
} | ||
function reduce$6(arg1, arg2, obj) { | ||
return obj.reduce(arg1, arg2); | ||
} | ||
function reducei$6(arg1, arg2, obj) { | ||
return obj.reduce(arg1, arg2); | ||
} | ||
function reduceRight$6(arg1, arg2, obj) { | ||
return obj.reduceRight(arg1, arg2); | ||
} | ||
function reduceRighti$6(arg1, arg2, obj) { | ||
return obj.reduceRight(arg1, arg2); | ||
} | ||
function some$6(arg1, obj) { | ||
return obj.some(arg1); | ||
} | ||
function somei$6(arg1, obj) { | ||
return obj.some(arg1); | ||
} | ||
var $$Uint32Array = { | ||
setArray: setArray$6, | ||
setArrayOffset: setArrayOffset$6, | ||
copyWithin: copyWithin$6, | ||
copyWithinFrom: copyWithinFrom$6, | ||
copyWithinFromRange: copyWithinFromRange$6, | ||
fillInPlace: fillInPlace$6, | ||
fillFromInPlace: fillFromInPlace$6, | ||
fillRangeInPlace: fillRangeInPlace$6, | ||
sortInPlaceWith: sortInPlaceWith$6, | ||
includes: includes$6, | ||
indexOf: indexOf$6, | ||
indexOfFrom: indexOfFrom$6, | ||
joinWith: joinWith$6, | ||
lastIndexOf: lastIndexOf$6, | ||
lastIndexOfFrom: lastIndexOfFrom$6, | ||
slice: slice$7, | ||
sliceFrom: sliceFrom$7, | ||
subarray: subarray$6, | ||
subarrayFrom: subarrayFrom$6, | ||
every: every$6, | ||
everyi: everyi$6, | ||
filter: filter$6, | ||
filteri: filteri$6, | ||
find: find$6, | ||
findi: findi$6, | ||
findIndex: findIndex$6, | ||
findIndexi: findIndexi$6, | ||
forEach: forEach$6, | ||
forEachi: forEachi$6, | ||
map: map$6, | ||
mapi: mapi$6, | ||
reduce: reduce$6, | ||
reducei: reducei$6, | ||
reduceRight: reduceRight$6, | ||
reduceRighti: reduceRighti$6, | ||
some: some$6, | ||
somei: somei$6 | ||
}; | ||
function setArray$7(arg1, obj) { | ||
obj.set(arg1); | ||
} | ||
function setArrayOffset$7(arg1, arg2, obj) { | ||
obj.set(arg1, arg2); | ||
} | ||
function copyWithin$7(to_, obj) { | ||
return obj.copyWithin(to_); | ||
} | ||
function copyWithinFrom$7(to_, from, obj) { | ||
return obj.copyWithin(to_, from); | ||
} | ||
function copyWithinFromRange$7(to_, start, end_, obj) { | ||
return obj.copyWithin(to_, start, end_); | ||
} | ||
function fillInPlace$7(arg1, obj) { | ||
return obj.fill(arg1); | ||
} | ||
function fillFromInPlace$7(arg1, from, obj) { | ||
return obj.fill(arg1, from); | ||
} | ||
function fillRangeInPlace$7(arg1, start, end_, obj) { | ||
return obj.fill(arg1, start, end_); | ||
} | ||
function sortInPlaceWith$7(arg1, obj) { | ||
return obj.sort(arg1); | ||
} | ||
function includes$7(arg1, obj) { | ||
return obj.includes(arg1); | ||
} | ||
function indexOf$7(arg1, obj) { | ||
return obj.indexOf(arg1); | ||
} | ||
function indexOfFrom$7(arg1, from, obj) { | ||
return obj.indexOf(arg1, from); | ||
} | ||
function joinWith$7(arg1, obj) { | ||
return obj.join(arg1); | ||
} | ||
function lastIndexOf$7(arg1, obj) { | ||
return obj.lastIndexOf(arg1); | ||
} | ||
function lastIndexOfFrom$7(arg1, from, obj) { | ||
return obj.lastIndexOf(arg1, from); | ||
} | ||
function slice$8(start, end_, obj) { | ||
return obj.slice(start, end_); | ||
} | ||
function sliceFrom$8(arg1, obj) { | ||
return obj.slice(arg1); | ||
} | ||
function subarray$7(start, end_, obj) { | ||
return obj.subarray(start, end_); | ||
} | ||
function subarrayFrom$7(arg1, obj) { | ||
return obj.subarray(arg1); | ||
} | ||
function every$7(arg1, obj) { | ||
return obj.every(arg1); | ||
} | ||
function everyi$7(arg1, obj) { | ||
return obj.every(arg1); | ||
} | ||
function filter$7(arg1, obj) { | ||
return obj.filter(arg1); | ||
} | ||
function filteri$7(arg1, obj) { | ||
return obj.filter(arg1); | ||
} | ||
function find$7(arg1, obj) { | ||
return obj.find(arg1); | ||
} | ||
function findi$7(arg1, obj) { | ||
return obj.find(arg1); | ||
} | ||
function findIndex$7(arg1, obj) { | ||
return obj.findIndex(arg1); | ||
} | ||
function findIndexi$7(arg1, obj) { | ||
return obj.findIndex(arg1); | ||
} | ||
function forEach$7(arg1, obj) { | ||
obj.forEach(arg1); | ||
} | ||
function forEachi$7(arg1, obj) { | ||
obj.forEach(arg1); | ||
} | ||
function map$7(arg1, obj) { | ||
return obj.map(arg1); | ||
} | ||
function mapi$7(arg1, obj) { | ||
return obj.map(arg1); | ||
} | ||
function reduce$7(arg1, arg2, obj) { | ||
return obj.reduce(arg1, arg2); | ||
} | ||
function reducei$7(arg1, arg2, obj) { | ||
return obj.reduce(arg1, arg2); | ||
} | ||
function reduceRight$7(arg1, arg2, obj) { | ||
return obj.reduceRight(arg1, arg2); | ||
} | ||
function reduceRighti$7(arg1, arg2, obj) { | ||
return obj.reduceRight(arg1, arg2); | ||
} | ||
function some$7(arg1, obj) { | ||
return obj.some(arg1); | ||
} | ||
function somei$7(arg1, obj) { | ||
return obj.some(arg1); | ||
} | ||
var $$Float32Array = { | ||
setArray: setArray$7, | ||
setArrayOffset: setArrayOffset$7, | ||
copyWithin: copyWithin$7, | ||
copyWithinFrom: copyWithinFrom$7, | ||
copyWithinFromRange: copyWithinFromRange$7, | ||
fillInPlace: fillInPlace$7, | ||
fillFromInPlace: fillFromInPlace$7, | ||
fillRangeInPlace: fillRangeInPlace$7, | ||
sortInPlaceWith: sortInPlaceWith$7, | ||
includes: includes$7, | ||
indexOf: indexOf$7, | ||
indexOfFrom: indexOfFrom$7, | ||
joinWith: joinWith$7, | ||
lastIndexOf: lastIndexOf$7, | ||
lastIndexOfFrom: lastIndexOfFrom$7, | ||
slice: slice$8, | ||
sliceFrom: sliceFrom$8, | ||
subarray: subarray$7, | ||
subarrayFrom: subarrayFrom$7, | ||
every: every$7, | ||
everyi: everyi$7, | ||
filter: filter$7, | ||
filteri: filteri$7, | ||
find: find$7, | ||
findi: findi$7, | ||
findIndex: findIndex$7, | ||
findIndexi: findIndexi$7, | ||
forEach: forEach$7, | ||
forEachi: forEachi$7, | ||
map: map$7, | ||
mapi: mapi$7, | ||
reduce: reduce$7, | ||
reducei: reducei$7, | ||
reduceRight: reduceRight$7, | ||
reduceRighti: reduceRighti$7, | ||
some: some$7, | ||
somei: somei$7 | ||
}; | ||
function setArray$8(arg1, obj) { | ||
obj.set(arg1); | ||
} | ||
function setArrayOffset$8(arg1, arg2, obj) { | ||
obj.set(arg1, arg2); | ||
} | ||
function copyWithin$8(to_, obj) { | ||
return obj.copyWithin(to_); | ||
} | ||
function copyWithinFrom$8(to_, from, obj) { | ||
return obj.copyWithin(to_, from); | ||
} | ||
function copyWithinFromRange$8(to_, start, end_, obj) { | ||
return obj.copyWithin(to_, start, end_); | ||
} | ||
function fillInPlace$8(arg1, obj) { | ||
return obj.fill(arg1); | ||
} | ||
function fillFromInPlace$8(arg1, from, obj) { | ||
return obj.fill(arg1, from); | ||
} | ||
function fillRangeInPlace$8(arg1, start, end_, obj) { | ||
return obj.fill(arg1, start, end_); | ||
} | ||
function sortInPlaceWith$8(arg1, obj) { | ||
return obj.sort(arg1); | ||
} | ||
function includes$8(arg1, obj) { | ||
return obj.includes(arg1); | ||
} | ||
function indexOf$8(arg1, obj) { | ||
return obj.indexOf(arg1); | ||
} | ||
function indexOfFrom$8(arg1, from, obj) { | ||
return obj.indexOf(arg1, from); | ||
} | ||
function joinWith$8(arg1, obj) { | ||
return obj.join(arg1); | ||
} | ||
function lastIndexOf$8(arg1, obj) { | ||
return obj.lastIndexOf(arg1); | ||
} | ||
function lastIndexOfFrom$8(arg1, from, obj) { | ||
return obj.lastIndexOf(arg1, from); | ||
} | ||
function slice$9(start, end_, obj) { | ||
return obj.slice(start, end_); | ||
} | ||
function sliceFrom$9(arg1, obj) { | ||
return obj.slice(arg1); | ||
} | ||
function subarray$8(start, end_, obj) { | ||
return obj.subarray(start, end_); | ||
} | ||
function subarrayFrom$8(arg1, obj) { | ||
return obj.subarray(arg1); | ||
} | ||
function every$8(arg1, obj) { | ||
return obj.every(arg1); | ||
} | ||
function everyi$8(arg1, obj) { | ||
return obj.every(arg1); | ||
} | ||
function filter$8(arg1, obj) { | ||
return obj.filter(arg1); | ||
} | ||
function filteri$8(arg1, obj) { | ||
return obj.filter(arg1); | ||
} | ||
function find$8(arg1, obj) { | ||
return obj.find(arg1); | ||
} | ||
function findi$8(arg1, obj) { | ||
return obj.find(arg1); | ||
} | ||
function findIndex$8(arg1, obj) { | ||
return obj.findIndex(arg1); | ||
} | ||
function findIndexi$8(arg1, obj) { | ||
return obj.findIndex(arg1); | ||
} | ||
function forEach$8(arg1, obj) { | ||
obj.forEach(arg1); | ||
} | ||
function forEachi$8(arg1, obj) { | ||
obj.forEach(arg1); | ||
} | ||
function map$8(arg1, obj) { | ||
return obj.map(arg1); | ||
} | ||
function mapi$8(arg1, obj) { | ||
return obj.map(arg1); | ||
} | ||
function reduce$8(arg1, arg2, obj) { | ||
return obj.reduce(arg1, arg2); | ||
} | ||
function reducei$8(arg1, arg2, obj) { | ||
return obj.reduce(arg1, arg2); | ||
} | ||
function reduceRight$8(arg1, arg2, obj) { | ||
return obj.reduceRight(arg1, arg2); | ||
} | ||
function reduceRighti$8(arg1, arg2, obj) { | ||
return obj.reduceRight(arg1, arg2); | ||
} | ||
function some$8(arg1, obj) { | ||
return obj.some(arg1); | ||
} | ||
function somei$8(arg1, obj) { | ||
return obj.some(arg1); | ||
} | ||
var $$Float64Array = { | ||
setArray: setArray$8, | ||
setArrayOffset: setArrayOffset$8, | ||
copyWithin: copyWithin$8, | ||
copyWithinFrom: copyWithinFrom$8, | ||
copyWithinFromRange: copyWithinFromRange$8, | ||
fillInPlace: fillInPlace$8, | ||
fillFromInPlace: fillFromInPlace$8, | ||
fillRangeInPlace: fillRangeInPlace$8, | ||
sortInPlaceWith: sortInPlaceWith$8, | ||
includes: includes$8, | ||
indexOf: indexOf$8, | ||
indexOfFrom: indexOfFrom$8, | ||
joinWith: joinWith$8, | ||
lastIndexOf: lastIndexOf$8, | ||
lastIndexOfFrom: lastIndexOfFrom$8, | ||
slice: slice$9, | ||
sliceFrom: sliceFrom$9, | ||
subarray: subarray$8, | ||
subarrayFrom: subarrayFrom$8, | ||
every: every$8, | ||
everyi: everyi$8, | ||
filter: filter$8, | ||
filteri: filteri$8, | ||
find: find$8, | ||
findi: findi$8, | ||
findIndex: findIndex$8, | ||
findIndexi: findIndexi$8, | ||
forEach: forEach$8, | ||
forEachi: forEachi$8, | ||
map: map$8, | ||
mapi: mapi$8, | ||
reduce: reduce$8, | ||
reducei: reducei$8, | ||
reduceRight: reduceRight$8, | ||
reduceRighti: reduceRighti$8, | ||
some: some$8, | ||
somei: somei$8 | ||
}; | ||
var $$DataView = {}; | ||
@@ -47,4 +1732,3 @@ | ||
$$DataView , | ||
} | ||
/* No side effect */ |
@@ -38,4 +38,3 @@ | ||
$$DataView , | ||
} | ||
/* No side effect */ |
@@ -15,2 +15,7 @@ | ||
}; | ||
} else if (ty === "bigint") { | ||
return { | ||
TAG: /* JSBigInt */5, | ||
_0: x | ||
}; | ||
} else if (ty === "string") { | ||
@@ -27,10 +32,10 @@ return { | ||
} | ||
} else if (ty === "function") { | ||
} else if (ty === "symbol") { | ||
return { | ||
TAG: /* JSFunction */2, | ||
TAG: /* JSSymbol */4, | ||
_0: x | ||
}; | ||
} else if (ty === "object") { | ||
} else if (ty === "function") { | ||
return { | ||
TAG: /* JSObject */3, | ||
TAG: /* JSFunction */2, | ||
_0: x | ||
@@ -40,3 +45,3 @@ }; | ||
return { | ||
TAG: /* JSSymbol */4, | ||
TAG: /* JSObject */3, | ||
_0: x | ||
@@ -65,2 +70,4 @@ }; | ||
return typeof x === "symbol"; | ||
case /* BigInt */8 : | ||
return typeof x === "bigint"; | ||
@@ -73,4 +80,3 @@ } | ||
classify , | ||
} | ||
/* No side effect */ |
@@ -51,4 +51,3 @@ | ||
from_opt , | ||
} | ||
/* No side effect */ |
@@ -16,3 +16,2 @@ | ||
a.splice(j); | ||
} | ||
@@ -22,3 +21,2 @@ | ||
a.splice(0); | ||
} | ||
@@ -28,3 +26,2 @@ | ||
xs.push(x); | ||
} | ||
@@ -40,3 +37,2 @@ | ||
} | ||
} | ||
@@ -48,3 +44,2 @@ | ||
} | ||
} | ||
@@ -143,4 +138,3 @@ | ||
append , | ||
} | ||
/* No side effect */ |
@@ -95,4 +95,3 @@ | ||
Console , | ||
} | ||
/* No side effect */ |
@@ -43,4 +43,3 @@ | ||
lazy_is_val , | ||
} | ||
/* No side effect */ |
@@ -8,6 +8,5 @@ | ||
import * as Caml_lexer from "./caml_lexer.js"; | ||
import * as Pervasives from "./pervasives.js"; | ||
function engine(tbl, state, buf) { | ||
var result = Caml_lexer.caml_lex_engine(tbl, state, buf); | ||
var result = Caml_lexer.lex_engine(tbl, state, buf); | ||
if (result >= 0) { | ||
@@ -27,3 +26,3 @@ buf.lex_start_p = buf.lex_curr_p; | ||
function new_engine(tbl, state, buf) { | ||
var result = Caml_lexer.caml_new_lex_engine(tbl, state, buf); | ||
var result = Caml_lexer.new_lex_engine(tbl, state, buf); | ||
if (result >= 0) { | ||
@@ -50,3 +49,3 @@ buf.lex_start_p = buf.lex_curr_p; | ||
function from_function(f) { | ||
var partial_arg = Caml_bytes.caml_create_bytes(512); | ||
var partial_arg = Caml_bytes.create(512); | ||
return { | ||
@@ -68,3 +67,3 @@ refill_buff: (function (param) { | ||
} | ||
var newbuf = Caml_bytes.caml_create_bytes(newlen); | ||
var newbuf = Caml_bytes.create(newlen); | ||
Bytes.blit(param.lex_buffer, param.lex_start_pos, newbuf, 0, param.lex_buffer_len - param.lex_start_pos | 0); | ||
@@ -90,5 +89,4 @@ param.lex_buffer = newbuf; | ||
param.lex_buffer_len = param.lex_buffer_len + n | 0; | ||
}), | ||
lex_buffer: Caml_bytes.caml_create_bytes(1024), | ||
lex_buffer: Caml_bytes.create(1024), | ||
lex_buffer_len: 0, | ||
@@ -107,8 +105,2 @@ lex_abs_pos: 0, | ||
function from_channel(ic) { | ||
return from_function(function (buf, n) { | ||
return Pervasives.input(ic, buf, 0, n); | ||
}); | ||
} | ||
function from_string(s) { | ||
@@ -118,3 +110,2 @@ return { | ||
lexbuf.lex_eof_reached = true; | ||
}), | ||
@@ -192,3 +183,2 @@ lex_buffer: Bytes.of_string(s), | ||
}; | ||
} | ||
@@ -207,3 +197,2 @@ | ||
lb.lex_buffer_len = 0; | ||
} | ||
@@ -220,3 +209,2 @@ | ||
dummy_pos , | ||
from_channel , | ||
from_string , | ||
@@ -238,4 +226,3 @@ from_function , | ||
new_engine , | ||
} | ||
/* No side effect */ |
@@ -501,3 +501,3 @@ | ||
} | ||
if (Caml_obj.caml_equal(param.hd, x)) { | ||
if (Caml_obj.equal(param.hd, x)) { | ||
return true; | ||
@@ -529,3 +529,3 @@ } | ||
var match = param.hd; | ||
if (Caml_obj.caml_equal(match[0], x)) { | ||
if (Caml_obj.equal(match[0], x)) { | ||
return match[1]; | ||
@@ -550,3 +550,3 @@ } | ||
var match = param.hd; | ||
if (Caml_obj.caml_equal(match[0], x)) { | ||
if (Caml_obj.equal(match[0], x)) { | ||
return Caml_option.some(match[1]); | ||
@@ -598,3 +598,3 @@ } | ||
} | ||
if (Caml_obj.caml_equal(param.hd[0], x)) { | ||
if (Caml_obj.equal(param.hd[0], x)) { | ||
return true; | ||
@@ -627,3 +627,3 @@ } | ||
var pair = param.hd; | ||
if (Caml_obj.caml_equal(pair[0], x)) { | ||
if (Caml_obj.equal(pair[0], x)) { | ||
return l; | ||
@@ -1717,4 +1717,3 @@ } else { | ||
merge , | ||
} | ||
/* No side effect */ |
import * as List from "./list.js"; | ||
import * as Curry from "./curry.js"; | ||
import * as Caml_obj from "./caml_obj.js"; | ||
import * as Pervasives from "./pervasives.js"; | ||
import * as Caml_option from "./caml_option.js"; | ||
var length = List.length; | ||
function length(l) { | ||
var _len = 0; | ||
var _param = l; | ||
while(true) { | ||
var param = _param; | ||
var len = _len; | ||
if (!param) { | ||
return len; | ||
} | ||
_param = param.tl; | ||
_len = len + 1 | 0; | ||
continue ; | ||
}; | ||
} | ||
var hd = List.hd; | ||
function cons(a, l) { | ||
return { | ||
hd: a, | ||
tl: l | ||
}; | ||
} | ||
var compare_lengths = List.compare_lengths; | ||
function hd(param) { | ||
if (param) { | ||
return param.hd; | ||
} | ||
throw { | ||
RE_EXN_ID: "Failure", | ||
_1: "hd", | ||
Error: new Error() | ||
}; | ||
} | ||
var compare_length_with = List.compare_length_with; | ||
function tl(param) { | ||
if (param) { | ||
return param.tl; | ||
} | ||
throw { | ||
RE_EXN_ID: "Failure", | ||
_1: "tl", | ||
Error: new Error() | ||
}; | ||
} | ||
var cons = List.cons; | ||
function nth(l, n) { | ||
if (n < 0) { | ||
throw { | ||
RE_EXN_ID: "Invalid_argument", | ||
_1: "List.nth", | ||
Error: new Error() | ||
}; | ||
} | ||
var _l = l; | ||
var _n = n; | ||
while(true) { | ||
var n$1 = _n; | ||
var l$1 = _l; | ||
if (l$1) { | ||
if (n$1 === 0) { | ||
return l$1.hd; | ||
} | ||
_n = n$1 - 1 | 0; | ||
_l = l$1.tl; | ||
continue ; | ||
} | ||
throw { | ||
RE_EXN_ID: "Failure", | ||
_1: "nth", | ||
Error: new Error() | ||
}; | ||
}; | ||
} | ||
var tl = List.tl; | ||
function nth_opt(l, n) { | ||
if (n < 0) { | ||
throw { | ||
RE_EXN_ID: "Invalid_argument", | ||
_1: "List.nth", | ||
Error: new Error() | ||
}; | ||
} | ||
var _l = l; | ||
var _n = n; | ||
while(true) { | ||
var n$1 = _n; | ||
var l$1 = _l; | ||
if (!l$1) { | ||
return ; | ||
} | ||
if (n$1 === 0) { | ||
return Caml_option.some(l$1.hd); | ||
} | ||
_n = n$1 - 1 | 0; | ||
_l = l$1.tl; | ||
continue ; | ||
}; | ||
} | ||
var nth = List.nth; | ||
function rev_append(_l1, _l2) { | ||
while(true) { | ||
var l2 = _l2; | ||
var l1 = _l1; | ||
if (!l1) { | ||
return l2; | ||
} | ||
_l2 = { | ||
hd: l1.hd, | ||
tl: l2 | ||
}; | ||
_l1 = l1.tl; | ||
continue ; | ||
}; | ||
} | ||
var nth_opt = List.nth_opt; | ||
function rev(l) { | ||
return rev_append(l, /* [] */0); | ||
} | ||
var rev = List.rev; | ||
function init_tailrec_aux(_acc, _i, n, f) { | ||
while(true) { | ||
var i = _i; | ||
var acc = _acc; | ||
if (i >= n) { | ||
return acc; | ||
} | ||
_i = i + 1 | 0; | ||
_acc = { | ||
hd: Curry._1(f, i), | ||
tl: acc | ||
}; | ||
continue ; | ||
}; | ||
} | ||
var init = List.init; | ||
function init_aux(i, n, f) { | ||
if (i >= n) { | ||
return /* [] */0; | ||
} | ||
var r = Curry._1(f, i); | ||
return { | ||
hd: r, | ||
tl: init_aux(i + 1 | 0, n, f) | ||
}; | ||
} | ||
var append = List.append; | ||
function init(len, f) { | ||
if (len < 0) { | ||
throw { | ||
RE_EXN_ID: "Invalid_argument", | ||
_1: "List.init", | ||
Error: new Error() | ||
}; | ||
} | ||
if (len > 10000) { | ||
return rev_append(init_tailrec_aux(/* [] */0, 0, len, f), /* [] */0); | ||
} else { | ||
return init_aux(0, len, f); | ||
} | ||
} | ||
var rev_append = List.rev_append; | ||
function flatten(param) { | ||
if (param) { | ||
return Pervasives.$at(param.hd, flatten(param.tl)); | ||
} else { | ||
return /* [] */0; | ||
} | ||
} | ||
var concat = List.concat; | ||
function map(f, param) { | ||
if (!param) { | ||
return /* [] */0; | ||
} | ||
var r = Curry._1(f, param.hd); | ||
return { | ||
hd: r, | ||
tl: map(f, param.tl) | ||
}; | ||
} | ||
var flatten = List.flatten; | ||
function mapi(i, f, param) { | ||
if (!param) { | ||
return /* [] */0; | ||
} | ||
var r = Curry._2(f, i, param.hd); | ||
return { | ||
hd: r, | ||
tl: mapi(i + 1 | 0, f, param.tl) | ||
}; | ||
} | ||
var iter = List.iter; | ||
function mapi$1(f, l) { | ||
return mapi(0, f, l); | ||
} | ||
var iteri = List.iteri; | ||
function rev_map(f, l) { | ||
var _accu = /* [] */0; | ||
var _param = l; | ||
while(true) { | ||
var param = _param; | ||
var accu = _accu; | ||
if (!param) { | ||
return accu; | ||
} | ||
_param = param.tl; | ||
_accu = { | ||
hd: Curry._1(f, param.hd), | ||
tl: accu | ||
}; | ||
continue ; | ||
}; | ||
} | ||
var map = List.map; | ||
function iter(f, _param) { | ||
while(true) { | ||
var param = _param; | ||
if (!param) { | ||
return ; | ||
} | ||
Curry._1(f, param.hd); | ||
_param = param.tl; | ||
continue ; | ||
}; | ||
} | ||
var mapi = List.mapi; | ||
function iteri(f, l) { | ||
var _i = 0; | ||
var _param = l; | ||
while(true) { | ||
var param = _param; | ||
var i = _i; | ||
if (!param) { | ||
return ; | ||
} | ||
Curry._2(f, i, param.hd); | ||
_param = param.tl; | ||
_i = i + 1 | 0; | ||
continue ; | ||
}; | ||
} | ||
var rev_map = List.rev_map; | ||
function fold_left(f, _accu, _l) { | ||
while(true) { | ||
var l = _l; | ||
var accu = _accu; | ||
if (!l) { | ||
return accu; | ||
} | ||
_l = l.tl; | ||
_accu = Curry._2(f, accu, l.hd); | ||
continue ; | ||
}; | ||
} | ||
var fold_left = List.fold_left; | ||
function fold_right(f, l, accu) { | ||
if (l) { | ||
return Curry._2(f, l.hd, fold_right(f, l.tl, accu)); | ||
} else { | ||
return accu; | ||
} | ||
} | ||
var fold_right = List.fold_right; | ||
function map2(f, l1, l2) { | ||
if (l1) { | ||
if (l2) { | ||
var r = Curry._2(f, l1.hd, l2.hd); | ||
return { | ||
hd: r, | ||
tl: map2(f, l1.tl, l2.tl) | ||
}; | ||
} | ||
throw { | ||
RE_EXN_ID: "Invalid_argument", | ||
_1: "List.map2", | ||
Error: new Error() | ||
}; | ||
} | ||
if (!l2) { | ||
return /* [] */0; | ||
} | ||
throw { | ||
RE_EXN_ID: "Invalid_argument", | ||
_1: "List.map2", | ||
Error: new Error() | ||
}; | ||
} | ||
var iter2 = List.iter2; | ||
function rev_map2(f, l1, l2) { | ||
var _accu = /* [] */0; | ||
var _l1 = l1; | ||
var _l2 = l2; | ||
while(true) { | ||
var l2$1 = _l2; | ||
var l1$1 = _l1; | ||
var accu = _accu; | ||
if (l1$1) { | ||
if (l2$1) { | ||
_l2 = l2$1.tl; | ||
_l1 = l1$1.tl; | ||
_accu = { | ||
hd: Curry._2(f, l1$1.hd, l2$1.hd), | ||
tl: accu | ||
}; | ||
continue ; | ||
} | ||
throw { | ||
RE_EXN_ID: "Invalid_argument", | ||
_1: "List.rev_map2", | ||
Error: new Error() | ||
}; | ||
} | ||
if (l2$1) { | ||
throw { | ||
RE_EXN_ID: "Invalid_argument", | ||
_1: "List.rev_map2", | ||
Error: new Error() | ||
}; | ||
} | ||
return accu; | ||
}; | ||
} | ||
var map2 = List.map2; | ||
function iter2(f, _l1, _l2) { | ||
while(true) { | ||
var l2 = _l2; | ||
var l1 = _l1; | ||
if (l1) { | ||
if (l2) { | ||
Curry._2(f, l1.hd, l2.hd); | ||
_l2 = l2.tl; | ||
_l1 = l1.tl; | ||
continue ; | ||
} | ||
throw { | ||
RE_EXN_ID: "Invalid_argument", | ||
_1: "List.iter2", | ||
Error: new Error() | ||
}; | ||
} | ||
if (!l2) { | ||
return ; | ||
} | ||
throw { | ||
RE_EXN_ID: "Invalid_argument", | ||
_1: "List.iter2", | ||
Error: new Error() | ||
}; | ||
}; | ||
} | ||
var rev_map2 = List.rev_map2; | ||
function fold_left2(f, _accu, _l1, _l2) { | ||
while(true) { | ||
var l2 = _l2; | ||
var l1 = _l1; | ||
var accu = _accu; | ||
if (l1) { | ||
if (l2) { | ||
_l2 = l2.tl; | ||
_l1 = l1.tl; | ||
_accu = Curry._3(f, accu, l1.hd, l2.hd); | ||
continue ; | ||
} | ||
throw { | ||
RE_EXN_ID: "Invalid_argument", | ||
_1: "List.fold_left2", | ||
Error: new Error() | ||
}; | ||
} | ||
if (l2) { | ||
throw { | ||
RE_EXN_ID: "Invalid_argument", | ||
_1: "List.fold_left2", | ||
Error: new Error() | ||
}; | ||
} | ||
return accu; | ||
}; | ||
} | ||
var fold_left2 = List.fold_left2; | ||
function fold_right2(f, l1, l2, accu) { | ||
if (l1) { | ||
if (l2) { | ||
return Curry._3(f, l1.hd, l2.hd, fold_right2(f, l1.tl, l2.tl, accu)); | ||
} | ||
throw { | ||
RE_EXN_ID: "Invalid_argument", | ||
_1: "List.fold_right2", | ||
Error: new Error() | ||
}; | ||
} | ||
if (l2) { | ||
throw { | ||
RE_EXN_ID: "Invalid_argument", | ||
_1: "List.fold_right2", | ||
Error: new Error() | ||
}; | ||
} | ||
return accu; | ||
} | ||
var fold_right2 = List.fold_right2; | ||
function for_all(p, _param) { | ||
while(true) { | ||
var param = _param; | ||
if (!param) { | ||
return true; | ||
} | ||
if (!Curry._1(p, param.hd)) { | ||
return false; | ||
} | ||
_param = param.tl; | ||
continue ; | ||
}; | ||
} | ||
var for_all = List.for_all; | ||
function exists(p, _param) { | ||
while(true) { | ||
var param = _param; | ||
if (!param) { | ||
return false; | ||
} | ||
if (Curry._1(p, param.hd)) { | ||
return true; | ||
} | ||
_param = param.tl; | ||
continue ; | ||
}; | ||
} | ||
var exists = List.exists; | ||
function for_all2(p, _l1, _l2) { | ||
while(true) { | ||
var l2 = _l2; | ||
var l1 = _l1; | ||
if (l1) { | ||
if (l2) { | ||
if (!Curry._2(p, l1.hd, l2.hd)) { | ||
return false; | ||
} | ||
_l2 = l2.tl; | ||
_l1 = l1.tl; | ||
continue ; | ||
} | ||
throw { | ||
RE_EXN_ID: "Invalid_argument", | ||
_1: "List.for_all2", | ||
Error: new Error() | ||
}; | ||
} | ||
if (!l2) { | ||
return true; | ||
} | ||
throw { | ||
RE_EXN_ID: "Invalid_argument", | ||
_1: "List.for_all2", | ||
Error: new Error() | ||
}; | ||
}; | ||
} | ||
var for_all2 = List.for_all2; | ||
function exists2(p, _l1, _l2) { | ||
while(true) { | ||
var l2 = _l2; | ||
var l1 = _l1; | ||
if (l1) { | ||
if (l2) { | ||
if (Curry._2(p, l1.hd, l2.hd)) { | ||
return true; | ||
} | ||
_l2 = l2.tl; | ||
_l1 = l1.tl; | ||
continue ; | ||
} | ||
throw { | ||
RE_EXN_ID: "Invalid_argument", | ||
_1: "List.exists2", | ||
Error: new Error() | ||
}; | ||
} | ||
if (!l2) { | ||
return false; | ||
} | ||
throw { | ||
RE_EXN_ID: "Invalid_argument", | ||
_1: "List.exists2", | ||
Error: new Error() | ||
}; | ||
}; | ||
} | ||
var exists2 = List.exists2; | ||
function mem(x, _set) { | ||
while(true) { | ||
var set = _set; | ||
if (!set) { | ||
return false; | ||
} | ||
if (Caml_obj.equal(set.hd, x)) { | ||
return true; | ||
} | ||
_set = set.tl; | ||
continue ; | ||
}; | ||
} | ||
var mem = List.mem; | ||
function memq(x, _set) { | ||
while(true) { | ||
var set = _set; | ||
if (!set) { | ||
return false; | ||
} | ||
if (set.hd === x) { | ||
return true; | ||
} | ||
_set = set.tl; | ||
continue ; | ||
}; | ||
} | ||
var memq = List.memq; | ||
function assoc(x, _param) { | ||
while(true) { | ||
var param = _param; | ||
if (param) { | ||
var match = param.hd; | ||
if (Caml_obj.equal(match[0], x)) { | ||
return match[1]; | ||
} | ||
_param = param.tl; | ||
continue ; | ||
} | ||
throw { | ||
RE_EXN_ID: "Not_found", | ||
Error: new Error() | ||
}; | ||
}; | ||
} | ||
var find = List.find; | ||
function assoc_opt(x, _param) { | ||
while(true) { | ||
var param = _param; | ||
if (!param) { | ||
return ; | ||
} | ||
var match = param.hd; | ||
if (Caml_obj.equal(match[0], x)) { | ||
return Caml_option.some(match[1]); | ||
} | ||
_param = param.tl; | ||
continue ; | ||
}; | ||
} | ||
var find_opt = List.find_opt; | ||
function assq(x, _param) { | ||
while(true) { | ||
var param = _param; | ||
if (param) { | ||
var match = param.hd; | ||
if (match[0] === x) { | ||
return match[1]; | ||
} | ||
_param = param.tl; | ||
continue ; | ||
} | ||
throw { | ||
RE_EXN_ID: "Not_found", | ||
Error: new Error() | ||
}; | ||
}; | ||
} | ||
var filter = List.filter; | ||
function assq_opt(x, _param) { | ||
while(true) { | ||
var param = _param; | ||
if (!param) { | ||
return ; | ||
} | ||
var match = param.hd; | ||
if (match[0] === x) { | ||
return Caml_option.some(match[1]); | ||
} | ||
_param = param.tl; | ||
continue ; | ||
}; | ||
} | ||
var find_all = List.find_all; | ||
function mem_assoc(x, _map) { | ||
while(true) { | ||
var map = _map; | ||
if (!map) { | ||
return false; | ||
} | ||
if (Caml_obj.equal(map.hd[0], x)) { | ||
return true; | ||
} | ||
_map = map.tl; | ||
continue ; | ||
}; | ||
} | ||
var partition = List.partition; | ||
function mem_assq(x, _map) { | ||
while(true) { | ||
var map = _map; | ||
if (!map) { | ||
return false; | ||
} | ||
if (map.hd[0] === x) { | ||
return true; | ||
} | ||
_map = map.tl; | ||
continue ; | ||
}; | ||
} | ||
var assoc = List.assoc; | ||
function remove_assoc(x, param) { | ||
if (!param) { | ||
return /* [] */0; | ||
} | ||
var l = param.tl; | ||
var pair = param.hd; | ||
if (Caml_obj.equal(pair[0], x)) { | ||
return l; | ||
} else { | ||
return { | ||
hd: pair, | ||
tl: remove_assoc(x, l) | ||
}; | ||
} | ||
} | ||
var assoc_opt = List.assoc_opt; | ||
function remove_assq(x, param) { | ||
if (!param) { | ||
return /* [] */0; | ||
} | ||
var l = param.tl; | ||
var pair = param.hd; | ||
if (pair[0] === x) { | ||
return l; | ||
} else { | ||
return { | ||
hd: pair, | ||
tl: remove_assq(x, l) | ||
}; | ||
} | ||
} | ||
var assq = List.assq; | ||
function find(p, _param) { | ||
while(true) { | ||
var param = _param; | ||
if (param) { | ||
var x = param.hd; | ||
if (Curry._1(p, x)) { | ||
return x; | ||
} | ||
_param = param.tl; | ||
continue ; | ||
} | ||
throw { | ||
RE_EXN_ID: "Not_found", | ||
Error: new Error() | ||
}; | ||
}; | ||
} | ||
var assq_opt = List.assq_opt; | ||
function find_opt(p, _param) { | ||
while(true) { | ||
var param = _param; | ||
if (!param) { | ||
return ; | ||
} | ||
var x = param.hd; | ||
if (Curry._1(p, x)) { | ||
return Caml_option.some(x); | ||
} | ||
_param = param.tl; | ||
continue ; | ||
}; | ||
} | ||
var mem_assoc = List.mem_assoc; | ||
function find_all(p) { | ||
return function (param) { | ||
var _accu = /* [] */0; | ||
var _param = param; | ||
while(true) { | ||
var param$1 = _param; | ||
var accu = _accu; | ||
if (!param$1) { | ||
return rev_append(accu, /* [] */0); | ||
} | ||
var l = param$1.tl; | ||
var x = param$1.hd; | ||
if (Curry._1(p, x)) { | ||
_param = l; | ||
_accu = { | ||
hd: x, | ||
tl: accu | ||
}; | ||
continue ; | ||
} | ||
_param = l; | ||
continue ; | ||
}; | ||
}; | ||
} | ||
var mem_assq = List.mem_assq; | ||
function partition(p, l) { | ||
var _yes = /* [] */0; | ||
var _no = /* [] */0; | ||
var _param = l; | ||
while(true) { | ||
var param = _param; | ||
var no = _no; | ||
var yes = _yes; | ||
if (!param) { | ||
return [ | ||
rev_append(yes, /* [] */0), | ||
rev_append(no, /* [] */0) | ||
]; | ||
} | ||
var l$1 = param.tl; | ||
var x = param.hd; | ||
if (Curry._1(p, x)) { | ||
_param = l$1; | ||
_yes = { | ||
hd: x, | ||
tl: yes | ||
}; | ||
continue ; | ||
} | ||
_param = l$1; | ||
_no = { | ||
hd: x, | ||
tl: no | ||
}; | ||
continue ; | ||
}; | ||
} | ||
var remove_assoc = List.remove_assoc; | ||
function split(param) { | ||
if (!param) { | ||
return [ | ||
/* [] */0, | ||
/* [] */0 | ||
]; | ||
} | ||
var match = param.hd; | ||
var match$1 = split(param.tl); | ||
return [ | ||
{ | ||
hd: match[0], | ||
tl: match$1[0] | ||
}, | ||
{ | ||
hd: match[1], | ||
tl: match$1[1] | ||
} | ||
]; | ||
} | ||
var remove_assq = List.remove_assq; | ||
function combine(l1, l2) { | ||
if (l1) { | ||
if (l2) { | ||
return { | ||
hd: [ | ||
l1.hd, | ||
l2.hd | ||
], | ||
tl: combine(l1.tl, l2.tl) | ||
}; | ||
} | ||
throw { | ||
RE_EXN_ID: "Invalid_argument", | ||
_1: "List.combine", | ||
Error: new Error() | ||
}; | ||
} | ||
if (!l2) { | ||
return /* [] */0; | ||
} | ||
throw { | ||
RE_EXN_ID: "Invalid_argument", | ||
_1: "List.combine", | ||
Error: new Error() | ||
}; | ||
} | ||
var split = List.split; | ||
function merge(cmp, l1, l2) { | ||
if (!l1) { | ||
return l2; | ||
} | ||
if (!l2) { | ||
return l1; | ||
} | ||
var h2 = l2.hd; | ||
var h1 = l1.hd; | ||
if (Curry._2(cmp, h1, h2) <= 0) { | ||
return { | ||
hd: h1, | ||
tl: merge(cmp, l1.tl, l2) | ||
}; | ||
} else { | ||
return { | ||
hd: h2, | ||
tl: merge(cmp, l1, l2.tl) | ||
}; | ||
} | ||
} | ||
var combine = List.combine; | ||
function chop(_k, _l) { | ||
while(true) { | ||
var l = _l; | ||
var k = _k; | ||
if (k === 0) { | ||
return l; | ||
} | ||
if (l) { | ||
_l = l.tl; | ||
_k = k - 1 | 0; | ||
continue ; | ||
} | ||
throw { | ||
RE_EXN_ID: "Assert_failure", | ||
_1: [ | ||
"listLabels.ml", | ||
262, | ||
11 | ||
], | ||
Error: new Error() | ||
}; | ||
}; | ||
} | ||
var sort = List.sort; | ||
function stable_sort(cmp, l) { | ||
var sort = function (n, l) { | ||
if (n !== 2) { | ||
if (n === 3 && l) { | ||
var match = l.tl; | ||
if (match) { | ||
var match$1 = match.tl; | ||
if (match$1) { | ||
var x3 = match$1.hd; | ||
var x2 = match.hd; | ||
var x1 = l.hd; | ||
if (Curry._2(cmp, x1, x2) <= 0) { | ||
if (Curry._2(cmp, x2, x3) <= 0) { | ||
return { | ||
hd: x1, | ||
tl: { | ||
hd: x2, | ||
tl: { | ||
hd: x3, | ||
tl: /* [] */0 | ||
} | ||
} | ||
}; | ||
} else if (Curry._2(cmp, x1, x3) <= 0) { | ||
return { | ||
hd: x1, | ||
tl: { | ||
hd: x3, | ||
tl: { | ||
hd: x2, | ||
tl: /* [] */0 | ||
} | ||
} | ||
}; | ||
} else { | ||
return { | ||
hd: x3, | ||
tl: { | ||
hd: x1, | ||
tl: { | ||
hd: x2, | ||
tl: /* [] */0 | ||
} | ||
} | ||
}; | ||
} | ||
} else if (Curry._2(cmp, x1, x3) <= 0) { | ||
return { | ||
hd: x2, | ||
tl: { | ||
hd: x1, | ||
tl: { | ||
hd: x3, | ||
tl: /* [] */0 | ||
} | ||
} | ||
}; | ||
} else if (Curry._2(cmp, x2, x3) <= 0) { | ||
return { | ||
hd: x2, | ||
tl: { | ||
hd: x3, | ||
tl: { | ||
hd: x1, | ||
tl: /* [] */0 | ||
} | ||
} | ||
}; | ||
} else { | ||
return { | ||
hd: x3, | ||
tl: { | ||
hd: x2, | ||
tl: { | ||
hd: x1, | ||
tl: /* [] */0 | ||
} | ||
} | ||
}; | ||
} | ||
} | ||
} | ||
} | ||
} else if (l) { | ||
var match$2 = l.tl; | ||
if (match$2) { | ||
var x2$1 = match$2.hd; | ||
var x1$1 = l.hd; | ||
if (Curry._2(cmp, x1$1, x2$1) <= 0) { | ||
return { | ||
hd: x1$1, | ||
tl: { | ||
hd: x2$1, | ||
tl: /* [] */0 | ||
} | ||
}; | ||
} else { | ||
return { | ||
hd: x2$1, | ||
tl: { | ||
hd: x1$1, | ||
tl: /* [] */0 | ||
} | ||
}; | ||
} | ||
} | ||
} | ||
var n1 = (n >> 1); | ||
var n2 = n - n1 | 0; | ||
var l2 = chop(n1, l); | ||
var s1 = rev_sort(n1, l); | ||
var s2 = rev_sort(n2, l2); | ||
var _l1 = s1; | ||
var _l2 = s2; | ||
var _accu = /* [] */0; | ||
while(true) { | ||
var accu = _accu; | ||
var l2$1 = _l2; | ||
var l1 = _l1; | ||
if (!l1) { | ||
return rev_append(l2$1, accu); | ||
} | ||
if (!l2$1) { | ||
return rev_append(l1, accu); | ||
} | ||
var h2 = l2$1.hd; | ||
var h1 = l1.hd; | ||
if (Curry._2(cmp, h1, h2) > 0) { | ||
_accu = { | ||
hd: h1, | ||
tl: accu | ||
}; | ||
_l1 = l1.tl; | ||
continue ; | ||
} | ||
_accu = { | ||
hd: h2, | ||
tl: accu | ||
}; | ||
_l2 = l2$1.tl; | ||
continue ; | ||
}; | ||
}; | ||
var rev_sort = function (n, l) { | ||
if (n !== 2) { | ||
if (n === 3 && l) { | ||
var match = l.tl; | ||
if (match) { | ||
var match$1 = match.tl; | ||
if (match$1) { | ||
var x3 = match$1.hd; | ||
var x2 = match.hd; | ||
var x1 = l.hd; | ||
if (Curry._2(cmp, x1, x2) > 0) { | ||
if (Curry._2(cmp, x2, x3) > 0) { | ||
return { | ||
hd: x1, | ||
tl: { | ||
hd: x2, | ||
tl: { | ||
hd: x3, | ||
tl: /* [] */0 | ||
} | ||
} | ||
}; | ||
} else if (Curry._2(cmp, x1, x3) > 0) { | ||
return { | ||
hd: x1, | ||
tl: { | ||
hd: x3, | ||
tl: { | ||
hd: x2, | ||
tl: /* [] */0 | ||
} | ||
} | ||
}; | ||
} else { | ||
return { | ||
hd: x3, | ||
tl: { | ||
hd: x1, | ||
tl: { | ||
hd: x2, | ||
tl: /* [] */0 | ||
} | ||
} | ||
}; | ||
} | ||
} else if (Curry._2(cmp, x1, x3) > 0) { | ||
return { | ||
hd: x2, | ||
tl: { | ||
hd: x1, | ||
tl: { | ||
hd: x3, | ||
tl: /* [] */0 | ||
} | ||
} | ||
}; | ||
} else if (Curry._2(cmp, x2, x3) > 0) { | ||
return { | ||
hd: x2, | ||
tl: { | ||
hd: x3, | ||
tl: { | ||
hd: x1, | ||
tl: /* [] */0 | ||
} | ||
} | ||
}; | ||
} else { | ||
return { | ||
hd: x3, | ||
tl: { | ||
hd: x2, | ||
tl: { | ||
hd: x1, | ||
tl: /* [] */0 | ||
} | ||
} | ||
}; | ||
} | ||
} | ||
} | ||
} | ||
} else if (l) { | ||
var match$2 = l.tl; | ||
if (match$2) { | ||
var x2$1 = match$2.hd; | ||
var x1$1 = l.hd; | ||
if (Curry._2(cmp, x1$1, x2$1) > 0) { | ||
return { | ||
hd: x1$1, | ||
tl: { | ||
hd: x2$1, | ||
tl: /* [] */0 | ||
} | ||
}; | ||
} else { | ||
return { | ||
hd: x2$1, | ||
tl: { | ||
hd: x1$1, | ||
tl: /* [] */0 | ||
} | ||
}; | ||
} | ||
} | ||
} | ||
var n1 = (n >> 1); | ||
var n2 = n - n1 | 0; | ||
var l2 = chop(n1, l); | ||
var s1 = sort(n1, l); | ||
var s2 = sort(n2, l2); | ||
var _l1 = s1; | ||
var _l2 = s2; | ||
var _accu = /* [] */0; | ||
while(true) { | ||
var accu = _accu; | ||
var l2$1 = _l2; | ||
var l1 = _l1; | ||
if (!l1) { | ||
return rev_append(l2$1, accu); | ||
} | ||
if (!l2$1) { | ||
return rev_append(l1, accu); | ||
} | ||
var h2 = l2$1.hd; | ||
var h1 = l1.hd; | ||
if (Curry._2(cmp, h1, h2) <= 0) { | ||
_accu = { | ||
hd: h1, | ||
tl: accu | ||
}; | ||
_l1 = l1.tl; | ||
continue ; | ||
} | ||
_accu = { | ||
hd: h2, | ||
tl: accu | ||
}; | ||
_l2 = l2$1.tl; | ||
continue ; | ||
}; | ||
}; | ||
var len = length(l); | ||
if (len < 2) { | ||
return l; | ||
} else { | ||
return sort(len, l); | ||
} | ||
} | ||
var stable_sort = List.stable_sort; | ||
function sort_uniq(cmp, l) { | ||
var sort = function (n, l) { | ||
if (n !== 2) { | ||
if (n === 3 && l) { | ||
var match = l.tl; | ||
if (match) { | ||
var match$1 = match.tl; | ||
if (match$1) { | ||
var x3 = match$1.hd; | ||
var x2 = match.hd; | ||
var x1 = l.hd; | ||
var c = Curry._2(cmp, x1, x2); | ||
if (c === 0) { | ||
var c$1 = Curry._2(cmp, x2, x3); | ||
if (c$1 === 0) { | ||
return { | ||
hd: x2, | ||
tl: /* [] */0 | ||
}; | ||
} else if (c$1 < 0) { | ||
return { | ||
hd: x2, | ||
tl: { | ||
hd: x3, | ||
tl: /* [] */0 | ||
} | ||
}; | ||
} else { | ||
return { | ||
hd: x3, | ||
tl: { | ||
hd: x2, | ||
tl: /* [] */0 | ||
} | ||
}; | ||
} | ||
} | ||
if (c < 0) { | ||
var c$2 = Curry._2(cmp, x2, x3); | ||
if (c$2 === 0) { | ||
return { | ||
hd: x1, | ||
tl: { | ||
hd: x2, | ||
tl: /* [] */0 | ||
} | ||
}; | ||
} | ||
if (c$2 < 0) { | ||
return { | ||
hd: x1, | ||
tl: { | ||
hd: x2, | ||
tl: { | ||
hd: x3, | ||
tl: /* [] */0 | ||
} | ||
} | ||
}; | ||
} | ||
var c$3 = Curry._2(cmp, x1, x3); | ||
if (c$3 === 0) { | ||
return { | ||
hd: x1, | ||
tl: { | ||
hd: x2, | ||
tl: /* [] */0 | ||
} | ||
}; | ||
} else if (c$3 < 0) { | ||
return { | ||
hd: x1, | ||
tl: { | ||
hd: x3, | ||
tl: { | ||
hd: x2, | ||
tl: /* [] */0 | ||
} | ||
} | ||
}; | ||
} else { | ||
return { | ||
hd: x3, | ||
tl: { | ||
hd: x1, | ||
tl: { | ||
hd: x2, | ||
tl: /* [] */0 | ||
} | ||
} | ||
}; | ||
} | ||
} | ||
var c$4 = Curry._2(cmp, x1, x3); | ||
if (c$4 === 0) { | ||
return { | ||
hd: x2, | ||
tl: { | ||
hd: x1, | ||
tl: /* [] */0 | ||
} | ||
}; | ||
} | ||
if (c$4 < 0) { | ||
return { | ||
hd: x2, | ||
tl: { | ||
hd: x1, | ||
tl: { | ||
hd: x3, | ||
tl: /* [] */0 | ||
} | ||
} | ||
}; | ||
} | ||
var c$5 = Curry._2(cmp, x2, x3); | ||
if (c$5 === 0) { | ||
return { | ||
hd: x2, | ||
tl: { | ||
hd: x1, | ||
tl: /* [] */0 | ||
} | ||
}; | ||
} else if (c$5 < 0) { | ||
return { | ||
hd: x2, | ||
tl: { | ||
hd: x3, | ||
tl: { | ||
hd: x1, | ||
tl: /* [] */0 | ||
} | ||
} | ||
}; | ||
} else { | ||
return { | ||
hd: x3, | ||
tl: { | ||
hd: x2, | ||
tl: { | ||
hd: x1, | ||
tl: /* [] */0 | ||
} | ||
} | ||
}; | ||
} | ||
} | ||
} | ||
} | ||
} else if (l) { | ||
var match$2 = l.tl; | ||
if (match$2) { | ||
var x2$1 = match$2.hd; | ||
var x1$1 = l.hd; | ||
var c$6 = Curry._2(cmp, x1$1, x2$1); | ||
if (c$6 === 0) { | ||
return { | ||
hd: x1$1, | ||
tl: /* [] */0 | ||
}; | ||
} else if (c$6 < 0) { | ||
return { | ||
hd: x1$1, | ||
tl: { | ||
hd: x2$1, | ||
tl: /* [] */0 | ||
} | ||
}; | ||
} else { | ||
return { | ||
hd: x2$1, | ||
tl: { | ||
hd: x1$1, | ||
tl: /* [] */0 | ||
} | ||
}; | ||
} | ||
} | ||
} | ||
var n1 = (n >> 1); | ||
var n2 = n - n1 | 0; | ||
var l2 = chop(n1, l); | ||
var s1 = rev_sort(n1, l); | ||
var s2 = rev_sort(n2, l2); | ||
var _l1 = s1; | ||
var _l2 = s2; | ||
var _accu = /* [] */0; | ||
while(true) { | ||
var accu = _accu; | ||
var l2$1 = _l2; | ||
var l1 = _l1; | ||
if (!l1) { | ||
return rev_append(l2$1, accu); | ||
} | ||
if (!l2$1) { | ||
return rev_append(l1, accu); | ||
} | ||
var t2 = l2$1.tl; | ||
var h2 = l2$1.hd; | ||
var t1 = l1.tl; | ||
var h1 = l1.hd; | ||
var c$7 = Curry._2(cmp, h1, h2); | ||
if (c$7 === 0) { | ||
_accu = { | ||
hd: h1, | ||
tl: accu | ||
}; | ||
_l2 = t2; | ||
_l1 = t1; | ||
continue ; | ||
} | ||
if (c$7 > 0) { | ||
_accu = { | ||
hd: h1, | ||
tl: accu | ||
}; | ||
_l1 = t1; | ||
continue ; | ||
} | ||
_accu = { | ||
hd: h2, | ||
tl: accu | ||
}; | ||
_l2 = t2; | ||
continue ; | ||
}; | ||
}; | ||
var rev_sort = function (n, l) { | ||
if (n !== 2) { | ||
if (n === 3 && l) { | ||
var match = l.tl; | ||
if (match) { | ||
var match$1 = match.tl; | ||
if (match$1) { | ||
var x3 = match$1.hd; | ||
var x2 = match.hd; | ||
var x1 = l.hd; | ||
var c = Curry._2(cmp, x1, x2); | ||
if (c === 0) { | ||
var c$1 = Curry._2(cmp, x2, x3); | ||
if (c$1 === 0) { | ||
return { | ||
hd: x2, | ||
tl: /* [] */0 | ||
}; | ||
} else if (c$1 > 0) { | ||
return { | ||
hd: x2, | ||
tl: { | ||
hd: x3, | ||
tl: /* [] */0 | ||
} | ||
}; | ||
} else { | ||
return { | ||
hd: x3, | ||
tl: { | ||
hd: x2, | ||
tl: /* [] */0 | ||
} | ||
}; | ||
} | ||
} | ||
if (c > 0) { | ||
var c$2 = Curry._2(cmp, x2, x3); | ||
if (c$2 === 0) { | ||
return { | ||
hd: x1, | ||
tl: { | ||
hd: x2, | ||
tl: /* [] */0 | ||
} | ||
}; | ||
} | ||
if (c$2 > 0) { | ||
return { | ||
hd: x1, | ||
tl: { | ||
hd: x2, | ||
tl: { | ||
hd: x3, | ||
tl: /* [] */0 | ||
} | ||
} | ||
}; | ||
} | ||
var c$3 = Curry._2(cmp, x1, x3); | ||
if (c$3 === 0) { | ||
return { | ||
hd: x1, | ||
tl: { | ||
hd: x2, | ||
tl: /* [] */0 | ||
} | ||
}; | ||
} else if (c$3 > 0) { | ||
return { | ||
hd: x1, | ||
tl: { | ||
hd: x3, | ||
tl: { | ||
hd: x2, | ||
tl: /* [] */0 | ||
} | ||
} | ||
}; | ||
} else { | ||
return { | ||
hd: x3, | ||
tl: { | ||
hd: x1, | ||
tl: { | ||
hd: x2, | ||
tl: /* [] */0 | ||
} | ||
} | ||
}; | ||
} | ||
} | ||
var c$4 = Curry._2(cmp, x1, x3); | ||
if (c$4 === 0) { | ||
return { | ||
hd: x2, | ||
tl: { | ||
hd: x1, | ||
tl: /* [] */0 | ||
} | ||
}; | ||
} | ||
if (c$4 > 0) { | ||
return { | ||
hd: x2, | ||
tl: { | ||
hd: x1, | ||
tl: { | ||
hd: x3, | ||
tl: /* [] */0 | ||
} | ||
} | ||
}; | ||
} | ||
var c$5 = Curry._2(cmp, x2, x3); | ||
if (c$5 === 0) { | ||
return { | ||
hd: x2, | ||
tl: { | ||
hd: x1, | ||
tl: /* [] */0 | ||
} | ||
}; | ||
} else if (c$5 > 0) { | ||
return { | ||
hd: x2, | ||
tl: { | ||
hd: x3, | ||
tl: { | ||
hd: x1, | ||
tl: /* [] */0 | ||
} | ||
} | ||
}; | ||
} else { | ||
return { | ||
hd: x3, | ||
tl: { | ||
hd: x2, | ||
tl: { | ||
hd: x1, | ||
tl: /* [] */0 | ||
} | ||
} | ||
}; | ||
} | ||
} | ||
} | ||
} | ||
} else if (l) { | ||
var match$2 = l.tl; | ||
if (match$2) { | ||
var x2$1 = match$2.hd; | ||
var x1$1 = l.hd; | ||
var c$6 = Curry._2(cmp, x1$1, x2$1); | ||
if (c$6 === 0) { | ||
return { | ||
hd: x1$1, | ||
tl: /* [] */0 | ||
}; | ||
} else if (c$6 > 0) { | ||
return { | ||
hd: x1$1, | ||
tl: { | ||
hd: x2$1, | ||
tl: /* [] */0 | ||
} | ||
}; | ||
} else { | ||
return { | ||
hd: x2$1, | ||
tl: { | ||
hd: x1$1, | ||
tl: /* [] */0 | ||
} | ||
}; | ||
} | ||
} | ||
} | ||
var n1 = (n >> 1); | ||
var n2 = n - n1 | 0; | ||
var l2 = chop(n1, l); | ||
var s1 = sort(n1, l); | ||
var s2 = sort(n2, l2); | ||
var _l1 = s1; | ||
var _l2 = s2; | ||
var _accu = /* [] */0; | ||
while(true) { | ||
var accu = _accu; | ||
var l2$1 = _l2; | ||
var l1 = _l1; | ||
if (!l1) { | ||
return rev_append(l2$1, accu); | ||
} | ||
if (!l2$1) { | ||
return rev_append(l1, accu); | ||
} | ||
var t2 = l2$1.tl; | ||
var h2 = l2$1.hd; | ||
var t1 = l1.tl; | ||
var h1 = l1.hd; | ||
var c$7 = Curry._2(cmp, h1, h2); | ||
if (c$7 === 0) { | ||
_accu = { | ||
hd: h1, | ||
tl: accu | ||
}; | ||
_l2 = t2; | ||
_l1 = t1; | ||
continue ; | ||
} | ||
if (c$7 < 0) { | ||
_accu = { | ||
hd: h1, | ||
tl: accu | ||
}; | ||
_l1 = t1; | ||
continue ; | ||
} | ||
_accu = { | ||
hd: h2, | ||
tl: accu | ||
}; | ||
_l2 = t2; | ||
continue ; | ||
}; | ||
}; | ||
var len = length(l); | ||
if (len < 2) { | ||
return l; | ||
} else { | ||
return sort(len, l); | ||
} | ||
} | ||
var fast_sort = List.fast_sort; | ||
function compare_lengths(_l1, _l2) { | ||
while(true) { | ||
var l2 = _l2; | ||
var l1 = _l1; | ||
if (!l1) { | ||
if (l2) { | ||
return -1; | ||
} else { | ||
return 0; | ||
} | ||
} | ||
if (!l2) { | ||
return 1; | ||
} | ||
_l2 = l2.tl; | ||
_l1 = l1.tl; | ||
continue ; | ||
}; | ||
} | ||
var sort_uniq = List.sort_uniq; | ||
function compare_length_with(_l, _n) { | ||
while(true) { | ||
var n = _n; | ||
var l = _l; | ||
if (!l) { | ||
if (n === 0) { | ||
return 0; | ||
} else if (n > 0) { | ||
return -1; | ||
} else { | ||
return 1; | ||
} | ||
} | ||
if (n <= 0) { | ||
return 1; | ||
} | ||
_n = n - 1 | 0; | ||
_l = l.tl; | ||
continue ; | ||
}; | ||
} | ||
var merge = List.merge; | ||
var append = Pervasives.$at; | ||
var concat = flatten; | ||
var filter = find_all; | ||
var sort = stable_sort; | ||
var fast_sort = stable_sort; | ||
export { | ||
@@ -127,3 +1677,3 @@ length , | ||
map , | ||
mapi , | ||
mapi$1 as mapi, | ||
rev_map , | ||
@@ -163,4 +1713,3 @@ fold_left , | ||
merge , | ||
} | ||
/* No side effect */ |
@@ -935,4 +935,3 @@ | ||
Make , | ||
} | ||
/* No side effect */ |
import * as $$Map from "./map.js"; | ||
import * as $$Set from "./set.js"; | ||
import * as Hashtbl from "./hashtbl.js"; | ||
import * as List from "./list.js"; | ||
import * as Curry from "./curry.js"; | ||
import * as Caml_option from "./caml_option.js"; | ||
import * as HashtblLabels from "./hashtblLabels.js"; | ||
var Hashtbl$1 = Hashtbl; | ||
var Hashtbl = { | ||
create: HashtblLabels.create, | ||
clear: HashtblLabels.clear, | ||
reset: HashtblLabels.reset, | ||
copy: HashtblLabels.copy, | ||
add: HashtblLabels.add, | ||
find: HashtblLabels.find, | ||
find_opt: HashtblLabels.find_opt, | ||
find_all: HashtblLabels.find_all, | ||
mem: HashtblLabels.mem, | ||
remove: HashtblLabels.remove, | ||
replace: HashtblLabels.replace, | ||
iter: HashtblLabels.iter, | ||
filter_map_inplace: HashtblLabels.filter_map_inplace, | ||
fold: HashtblLabels.fold, | ||
length: HashtblLabels.length, | ||
randomize: HashtblLabels.randomize, | ||
is_randomized: HashtblLabels.is_randomized, | ||
stats: HashtblLabels.stats, | ||
Make: HashtblLabels.Make, | ||
MakeSeeded: HashtblLabels.MakeSeeded, | ||
hash: HashtblLabels.hash, | ||
seeded_hash: HashtblLabels.seeded_hash, | ||
hash_param: HashtblLabels.hash_param, | ||
seeded_hash_param: HashtblLabels.seeded_hash_param | ||
}; | ||
var $$Map$1 = $$Map; | ||
var $$Map = { | ||
Make: (function (funarg) { | ||
var height = function (param) { | ||
if (param) { | ||
return param.h; | ||
} else { | ||
return 0; | ||
} | ||
}; | ||
var create = function (l, x, d, r) { | ||
var hl = height(l); | ||
var hr = height(r); | ||
return /* Node */{ | ||
l: l, | ||
v: x, | ||
d: d, | ||
r: r, | ||
h: hl >= hr ? hl + 1 | 0 : hr + 1 | 0 | ||
}; | ||
}; | ||
var singleton = function (x, d) { | ||
return /* Node */{ | ||
l: /* Empty */0, | ||
v: x, | ||
d: d, | ||
r: /* Empty */0, | ||
h: 1 | ||
}; | ||
}; | ||
var bal = function (l, x, d, r) { | ||
var hl = l ? l.h : 0; | ||
var hr = r ? r.h : 0; | ||
if (hl > (hr + 2 | 0)) { | ||
if (l) { | ||
var lr = l.r; | ||
var ld = l.d; | ||
var lv = l.v; | ||
var ll = l.l; | ||
if (height(ll) >= height(lr)) { | ||
return create(ll, lv, ld, create(lr, x, d, r)); | ||
} | ||
if (lr) { | ||
return create(create(ll, lv, ld, lr.l), lr.v, lr.d, create(lr.r, x, d, r)); | ||
} | ||
throw { | ||
RE_EXN_ID: "Invalid_argument", | ||
_1: "Map.bal", | ||
Error: new Error() | ||
}; | ||
} | ||
throw { | ||
RE_EXN_ID: "Invalid_argument", | ||
_1: "Map.bal", | ||
Error: new Error() | ||
}; | ||
} | ||
if (hr <= (hl + 2 | 0)) { | ||
return /* Node */{ | ||
l: l, | ||
v: x, | ||
d: d, | ||
r: r, | ||
h: hl >= hr ? hl + 1 | 0 : hr + 1 | 0 | ||
}; | ||
} | ||
if (r) { | ||
var rr = r.r; | ||
var rd = r.d; | ||
var rv = r.v; | ||
var rl = r.l; | ||
if (height(rr) >= height(rl)) { | ||
return create(create(l, x, d, rl), rv, rd, rr); | ||
} | ||
if (rl) { | ||
return create(create(l, x, d, rl.l), rl.v, rl.d, create(rl.r, rv, rd, rr)); | ||
} | ||
throw { | ||
RE_EXN_ID: "Invalid_argument", | ||
_1: "Map.bal", | ||
Error: new Error() | ||
}; | ||
} | ||
throw { | ||
RE_EXN_ID: "Invalid_argument", | ||
_1: "Map.bal", | ||
Error: new Error() | ||
}; | ||
}; | ||
var is_empty = function (param) { | ||
if (param) { | ||
return false; | ||
} else { | ||
return true; | ||
} | ||
}; | ||
var add = function (x, data, m) { | ||
if (!m) { | ||
return /* Node */{ | ||
l: /* Empty */0, | ||
v: x, | ||
d: data, | ||
r: /* Empty */0, | ||
h: 1 | ||
}; | ||
} | ||
var r = m.r; | ||
var d = m.d; | ||
var v = m.v; | ||
var l = m.l; | ||
var c = Curry._2(funarg.compare, x, v); | ||
if (c === 0) { | ||
if (d === data) { | ||
return m; | ||
} else { | ||
return /* Node */{ | ||
l: l, | ||
v: x, | ||
d: data, | ||
r: r, | ||
h: m.h | ||
}; | ||
} | ||
} | ||
if (c < 0) { | ||
var ll = add(x, data, l); | ||
if (l === ll) { | ||
return m; | ||
} else { | ||
return bal(ll, v, d, r); | ||
} | ||
} | ||
var rr = add(x, data, r); | ||
if (r === rr) { | ||
return m; | ||
} else { | ||
return bal(l, v, d, rr); | ||
} | ||
}; | ||
var find = function (x, _param) { | ||
while(true) { | ||
var param = _param; | ||
if (param) { | ||
var c = Curry._2(funarg.compare, x, param.v); | ||
if (c === 0) { | ||
return param.d; | ||
} | ||
_param = c < 0 ? param.l : param.r; | ||
continue ; | ||
} | ||
throw { | ||
RE_EXN_ID: "Not_found", | ||
Error: new Error() | ||
}; | ||
}; | ||
}; | ||
var find_first_aux = function (_v0, _d0, f, _param) { | ||
while(true) { | ||
var param = _param; | ||
var d0 = _d0; | ||
var v0 = _v0; | ||
if (!param) { | ||
return [ | ||
v0, | ||
d0 | ||
]; | ||
} | ||
var v = param.v; | ||
if (Curry._1(f, v)) { | ||
_param = param.l; | ||
_d0 = param.d; | ||
_v0 = v; | ||
continue ; | ||
} | ||
_param = param.r; | ||
continue ; | ||
}; | ||
}; | ||
var find_first = function (f, _param) { | ||
while(true) { | ||
var param = _param; | ||
if (param) { | ||
var v = param.v; | ||
if (Curry._1(f, v)) { | ||
return find_first_aux(v, param.d, f, param.l); | ||
} | ||
_param = param.r; | ||
continue ; | ||
} | ||
throw { | ||
RE_EXN_ID: "Not_found", | ||
Error: new Error() | ||
}; | ||
}; | ||
}; | ||
var find_first_opt_aux = function (_v0, _d0, f, _param) { | ||
while(true) { | ||
var param = _param; | ||
var d0 = _d0; | ||
var v0 = _v0; | ||
if (!param) { | ||
return [ | ||
v0, | ||
d0 | ||
]; | ||
} | ||
var v = param.v; | ||
if (Curry._1(f, v)) { | ||
_param = param.l; | ||
_d0 = param.d; | ||
_v0 = v; | ||
continue ; | ||
} | ||
_param = param.r; | ||
continue ; | ||
}; | ||
}; | ||
var find_first_opt = function (f, _param) { | ||
while(true) { | ||
var param = _param; | ||
if (!param) { | ||
return ; | ||
} | ||
var v = param.v; | ||
if (Curry._1(f, v)) { | ||
return find_first_opt_aux(v, param.d, f, param.l); | ||
} | ||
_param = param.r; | ||
continue ; | ||
}; | ||
}; | ||
var find_last_aux = function (_v0, _d0, f, _param) { | ||
while(true) { | ||
var param = _param; | ||
var d0 = _d0; | ||
var v0 = _v0; | ||
if (!param) { | ||
return [ | ||
v0, | ||
d0 | ||
]; | ||
} | ||
var v = param.v; | ||
if (Curry._1(f, v)) { | ||
_param = param.r; | ||
_d0 = param.d; | ||
_v0 = v; | ||
continue ; | ||
} | ||
_param = param.l; | ||
continue ; | ||
}; | ||
}; | ||
var find_last = function (f, _param) { | ||
while(true) { | ||
var param = _param; | ||
if (param) { | ||
var v = param.v; | ||
if (Curry._1(f, v)) { | ||
return find_last_aux(v, param.d, f, param.r); | ||
} | ||
_param = param.l; | ||
continue ; | ||
} | ||
throw { | ||
RE_EXN_ID: "Not_found", | ||
Error: new Error() | ||
}; | ||
}; | ||
}; | ||
var find_last_opt_aux = function (_v0, _d0, f, _param) { | ||
while(true) { | ||
var param = _param; | ||
var d0 = _d0; | ||
var v0 = _v0; | ||
if (!param) { | ||
return [ | ||
v0, | ||
d0 | ||
]; | ||
} | ||
var v = param.v; | ||
if (Curry._1(f, v)) { | ||
_param = param.r; | ||
_d0 = param.d; | ||
_v0 = v; | ||
continue ; | ||
} | ||
_param = param.l; | ||
continue ; | ||
}; | ||
}; | ||
var find_last_opt = function (f, _param) { | ||
while(true) { | ||
var param = _param; | ||
if (!param) { | ||
return ; | ||
} | ||
var v = param.v; | ||
if (Curry._1(f, v)) { | ||
return find_last_opt_aux(v, param.d, f, param.r); | ||
} | ||
_param = param.l; | ||
continue ; | ||
}; | ||
}; | ||
var find_opt = function (x, _param) { | ||
while(true) { | ||
var param = _param; | ||
if (!param) { | ||
return ; | ||
} | ||
var c = Curry._2(funarg.compare, x, param.v); | ||
if (c === 0) { | ||
return Caml_option.some(param.d); | ||
} | ||
_param = c < 0 ? param.l : param.r; | ||
continue ; | ||
}; | ||
}; | ||
var mem = function (x, _param) { | ||
while(true) { | ||
var param = _param; | ||
if (!param) { | ||
return false; | ||
} | ||
var c = Curry._2(funarg.compare, x, param.v); | ||
if (c === 0) { | ||
return true; | ||
} | ||
_param = c < 0 ? param.l : param.r; | ||
continue ; | ||
}; | ||
}; | ||
var min_binding = function (_param) { | ||
while(true) { | ||
var param = _param; | ||
if (param) { | ||
var l = param.l; | ||
if (!l) { | ||
return [ | ||
param.v, | ||
param.d | ||
]; | ||
} | ||
_param = l; | ||
continue ; | ||
} | ||
throw { | ||
RE_EXN_ID: "Not_found", | ||
Error: new Error() | ||
}; | ||
}; | ||
}; | ||
var min_binding_opt = function (_param) { | ||
while(true) { | ||
var param = _param; | ||
if (!param) { | ||
return ; | ||
} | ||
var l = param.l; | ||
if (!l) { | ||
return [ | ||
param.v, | ||
param.d | ||
]; | ||
} | ||
_param = l; | ||
continue ; | ||
}; | ||
}; | ||
var max_binding = function (_param) { | ||
while(true) { | ||
var param = _param; | ||
if (param) { | ||
var r = param.r; | ||
if (!r) { | ||
return [ | ||
param.v, | ||
param.d | ||
]; | ||
} | ||
_param = r; | ||
continue ; | ||
} | ||
throw { | ||
RE_EXN_ID: "Not_found", | ||
Error: new Error() | ||
}; | ||
}; | ||
}; | ||
var max_binding_opt = function (_param) { | ||
while(true) { | ||
var param = _param; | ||
if (!param) { | ||
return ; | ||
} | ||
var r = param.r; | ||
if (!r) { | ||
return [ | ||
param.v, | ||
param.d | ||
]; | ||
} | ||
_param = r; | ||
continue ; | ||
}; | ||
}; | ||
var remove_min_binding = function (param) { | ||
if (param) { | ||
var l = param.l; | ||
if (l) { | ||
return bal(remove_min_binding(l), param.v, param.d, param.r); | ||
} else { | ||
return param.r; | ||
} | ||
} | ||
throw { | ||
RE_EXN_ID: "Invalid_argument", | ||
_1: "Map.remove_min_elt", | ||
Error: new Error() | ||
}; | ||
}; | ||
var merge = function (t1, t2) { | ||
if (!t1) { | ||
return t2; | ||
} | ||
if (!t2) { | ||
return t1; | ||
} | ||
var match = min_binding(t2); | ||
return bal(t1, match[0], match[1], remove_min_binding(t2)); | ||
}; | ||
var remove = function (x, m) { | ||
if (!m) { | ||
return /* Empty */0; | ||
} | ||
var r = m.r; | ||
var d = m.d; | ||
var v = m.v; | ||
var l = m.l; | ||
var c = Curry._2(funarg.compare, x, v); | ||
if (c === 0) { | ||
return merge(l, r); | ||
} | ||
if (c < 0) { | ||
var ll = remove(x, l); | ||
if (l === ll) { | ||
return m; | ||
} else { | ||
return bal(ll, v, d, r); | ||
} | ||
} | ||
var rr = remove(x, r); | ||
if (r === rr) { | ||
return m; | ||
} else { | ||
return bal(l, v, d, rr); | ||
} | ||
}; | ||
var update = function (x, f, m) { | ||
if (m) { | ||
var r = m.r; | ||
var d = m.d; | ||
var v = m.v; | ||
var l = m.l; | ||
var c = Curry._2(funarg.compare, x, v); | ||
if (c === 0) { | ||
var data = Curry._1(f, Caml_option.some(d)); | ||
if (data === undefined) { | ||
return merge(l, r); | ||
} | ||
var data$1 = Caml_option.valFromOption(data); | ||
if (d === data$1) { | ||
return m; | ||
} else { | ||
return /* Node */{ | ||
l: l, | ||
v: x, | ||
d: data$1, | ||
r: r, | ||
h: m.h | ||
}; | ||
} | ||
} | ||
if (c < 0) { | ||
var ll = update(x, f, l); | ||
if (l === ll) { | ||
return m; | ||
} else { | ||
return bal(ll, v, d, r); | ||
} | ||
} | ||
var rr = update(x, f, r); | ||
if (r === rr) { | ||
return m; | ||
} else { | ||
return bal(l, v, d, rr); | ||
} | ||
} | ||
var data$2 = Curry._1(f, undefined); | ||
if (data$2 !== undefined) { | ||
return /* Node */{ | ||
l: /* Empty */0, | ||
v: x, | ||
d: Caml_option.valFromOption(data$2), | ||
r: /* Empty */0, | ||
h: 1 | ||
}; | ||
} else { | ||
return /* Empty */0; | ||
} | ||
}; | ||
var iter = function (f, _param) { | ||
while(true) { | ||
var param = _param; | ||
if (!param) { | ||
return ; | ||
} | ||
iter(f, param.l); | ||
Curry._2(f, param.v, param.d); | ||
_param = param.r; | ||
continue ; | ||
}; | ||
}; | ||
var map = function (f, param) { | ||
if (!param) { | ||
return /* Empty */0; | ||
} | ||
var l$p = map(f, param.l); | ||
var d$p = Curry._1(f, param.d); | ||
var r$p = map(f, param.r); | ||
return /* Node */{ | ||
l: l$p, | ||
v: param.v, | ||
d: d$p, | ||
r: r$p, | ||
h: param.h | ||
}; | ||
}; | ||
var mapi = function (f, param) { | ||
if (!param) { | ||
return /* Empty */0; | ||
} | ||
var v = param.v; | ||
var l$p = mapi(f, param.l); | ||
var d$p = Curry._2(f, v, param.d); | ||
var r$p = mapi(f, param.r); | ||
return /* Node */{ | ||
l: l$p, | ||
v: v, | ||
d: d$p, | ||
r: r$p, | ||
h: param.h | ||
}; | ||
}; | ||
var fold = function (f, _m, _accu) { | ||
while(true) { | ||
var accu = _accu; | ||
var m = _m; | ||
if (!m) { | ||
return accu; | ||
} | ||
_accu = Curry._3(f, m.v, m.d, fold(f, m.l, accu)); | ||
_m = m.r; | ||
continue ; | ||
}; | ||
}; | ||
var for_all = function (p, _param) { | ||
while(true) { | ||
var param = _param; | ||
if (!param) { | ||
return true; | ||
} | ||
if (!Curry._2(p, param.v, param.d)) { | ||
return false; | ||
} | ||
if (!for_all(p, param.l)) { | ||
return false; | ||
} | ||
_param = param.r; | ||
continue ; | ||
}; | ||
}; | ||
var exists = function (p, _param) { | ||
while(true) { | ||
var param = _param; | ||
if (!param) { | ||
return false; | ||
} | ||
if (Curry._2(p, param.v, param.d)) { | ||
return true; | ||
} | ||
if (exists(p, param.l)) { | ||
return true; | ||
} | ||
_param = param.r; | ||
continue ; | ||
}; | ||
}; | ||
var add_min_binding = function (k, x, param) { | ||
if (param) { | ||
return bal(add_min_binding(k, x, param.l), param.v, param.d, param.r); | ||
} else { | ||
return singleton(k, x); | ||
} | ||
}; | ||
var add_max_binding = function (k, x, param) { | ||
if (param) { | ||
return bal(param.l, param.v, param.d, add_max_binding(k, x, param.r)); | ||
} else { | ||
return singleton(k, x); | ||
} | ||
}; | ||
var join = function (l, v, d, r) { | ||
if (!l) { | ||
return add_min_binding(v, d, r); | ||
} | ||
if (!r) { | ||
return add_max_binding(v, d, l); | ||
} | ||
var rh = r.h; | ||
var lh = l.h; | ||
if (lh > (rh + 2 | 0)) { | ||
return bal(l.l, l.v, l.d, join(l.r, v, d, r)); | ||
} else if (rh > (lh + 2 | 0)) { | ||
return bal(join(l, v, d, r.l), r.v, r.d, r.r); | ||
} else { | ||
return create(l, v, d, r); | ||
} | ||
}; | ||
var concat = function (t1, t2) { | ||
if (!t1) { | ||
return t2; | ||
} | ||
if (!t2) { | ||
return t1; | ||
} | ||
var match = min_binding(t2); | ||
return join(t1, match[0], match[1], remove_min_binding(t2)); | ||
}; | ||
var concat_or_join = function (t1, v, d, t2) { | ||
if (d !== undefined) { | ||
return join(t1, v, Caml_option.valFromOption(d), t2); | ||
} else { | ||
return concat(t1, t2); | ||
} | ||
}; | ||
var split = function (x, param) { | ||
if (!param) { | ||
return [ | ||
/* Empty */0, | ||
undefined, | ||
/* Empty */0 | ||
]; | ||
} | ||
var r = param.r; | ||
var d = param.d; | ||
var v = param.v; | ||
var l = param.l; | ||
var c = Curry._2(funarg.compare, x, v); | ||
if (c === 0) { | ||
return [ | ||
l, | ||
Caml_option.some(d), | ||
r | ||
]; | ||
} | ||
if (c < 0) { | ||
var match = split(x, l); | ||
return [ | ||
match[0], | ||
match[1], | ||
join(match[2], v, d, r) | ||
]; | ||
} | ||
var match$1 = split(x, r); | ||
return [ | ||
join(l, v, d, match$1[0]), | ||
match$1[1], | ||
match$1[2] | ||
]; | ||
}; | ||
var merge$1 = function (f, s1, s2) { | ||
if (s1) { | ||
var v1 = s1.v; | ||
if (s1.h >= height(s2)) { | ||
var match = split(v1, s2); | ||
return concat_or_join(merge$1(f, s1.l, match[0]), v1, Curry._3(f, v1, Caml_option.some(s1.d), match[1]), merge$1(f, s1.r, match[2])); | ||
} | ||
} else if (!s2) { | ||
return /* Empty */0; | ||
} | ||
if (s2) { | ||
var v2 = s2.v; | ||
var match$1 = split(v2, s1); | ||
return concat_or_join(merge$1(f, match$1[0], s2.l), v2, Curry._3(f, v2, match$1[1], Caml_option.some(s2.d)), merge$1(f, match$1[2], s2.r)); | ||
} | ||
throw { | ||
RE_EXN_ID: "Assert_failure", | ||
_1: [ | ||
"mapLabels.ml", | ||
393, | ||
10 | ||
], | ||
Error: new Error() | ||
}; | ||
}; | ||
var union = function (f, s1, s2) { | ||
if (!s1) { | ||
return s2; | ||
} | ||
if (!s2) { | ||
return s1; | ||
} | ||
var d2 = s2.d; | ||
var v2 = s2.v; | ||
var d1 = s1.d; | ||
var v1 = s1.v; | ||
if (s1.h >= s2.h) { | ||
var match = split(v1, s2); | ||
var d2$1 = match[1]; | ||
var l = union(f, s1.l, match[0]); | ||
var r = union(f, s1.r, match[2]); | ||
if (d2$1 !== undefined) { | ||
return concat_or_join(l, v1, Curry._3(f, v1, d1, Caml_option.valFromOption(d2$1)), r); | ||
} else { | ||
return join(l, v1, d1, r); | ||
} | ||
} | ||
var match$1 = split(v2, s1); | ||
var d1$1 = match$1[1]; | ||
var l$1 = union(f, match$1[0], s2.l); | ||
var r$1 = union(f, match$1[2], s2.r); | ||
if (d1$1 !== undefined) { | ||
return concat_or_join(l$1, v2, Curry._3(f, v2, Caml_option.valFromOption(d1$1), d2), r$1); | ||
} else { | ||
return join(l$1, v2, d2, r$1); | ||
} | ||
}; | ||
var filter = function (p, m) { | ||
if (!m) { | ||
return /* Empty */0; | ||
} | ||
var r = m.r; | ||
var d = m.d; | ||
var v = m.v; | ||
var l = m.l; | ||
var l$p = filter(p, l); | ||
var pvd = Curry._2(p, v, d); | ||
var r$p = filter(p, r); | ||
if (pvd) { | ||
if (l === l$p && r === r$p) { | ||
return m; | ||
} else { | ||
return join(l$p, v, d, r$p); | ||
} | ||
} else { | ||
return concat(l$p, r$p); | ||
} | ||
}; | ||
var partition = function (p, param) { | ||
if (!param) { | ||
return [ | ||
/* Empty */0, | ||
/* Empty */0 | ||
]; | ||
} | ||
var d = param.d; | ||
var v = param.v; | ||
var match = partition(p, param.l); | ||
var lf = match[1]; | ||
var lt = match[0]; | ||
var pvd = Curry._2(p, v, d); | ||
var match$1 = partition(p, param.r); | ||
var rf = match$1[1]; | ||
var rt = match$1[0]; | ||
if (pvd) { | ||
return [ | ||
join(lt, v, d, rt), | ||
concat(lf, rf) | ||
]; | ||
} else { | ||
return [ | ||
concat(lt, rt), | ||
join(lf, v, d, rf) | ||
]; | ||
} | ||
}; | ||
var cons_enum = function (_m, _e) { | ||
while(true) { | ||
var e = _e; | ||
var m = _m; | ||
if (!m) { | ||
return e; | ||
} | ||
_e = /* More */{ | ||
_0: m.v, | ||
_1: m.d, | ||
_2: m.r, | ||
_3: e | ||
}; | ||
_m = m.l; | ||
continue ; | ||
}; | ||
}; | ||
var compare = function (cmp, m1, m2) { | ||
var _e1 = cons_enum(m1, /* End */0); | ||
var _e2 = cons_enum(m2, /* End */0); | ||
while(true) { | ||
var e2 = _e2; | ||
var e1 = _e1; | ||
if (!e1) { | ||
if (e2) { | ||
return -1; | ||
} else { | ||
return 0; | ||
} | ||
} | ||
if (!e2) { | ||
return 1; | ||
} | ||
var c = Curry._2(funarg.compare, e1._0, e2._0); | ||
if (c !== 0) { | ||
return c; | ||
} | ||
var c$1 = Curry._2(cmp, e1._1, e2._1); | ||
if (c$1 !== 0) { | ||
return c$1; | ||
} | ||
_e2 = cons_enum(e2._2, e2._3); | ||
_e1 = cons_enum(e1._2, e1._3); | ||
continue ; | ||
}; | ||
}; | ||
var equal = function (cmp, m1, m2) { | ||
var _e1 = cons_enum(m1, /* End */0); | ||
var _e2 = cons_enum(m2, /* End */0); | ||
while(true) { | ||
var e2 = _e2; | ||
var e1 = _e1; | ||
if (!e1) { | ||
if (e2) { | ||
return false; | ||
} else { | ||
return true; | ||
} | ||
} | ||
if (!e2) { | ||
return false; | ||
} | ||
if (Curry._2(funarg.compare, e1._0, e2._0) !== 0) { | ||
return false; | ||
} | ||
if (!Curry._2(cmp, e1._1, e2._1)) { | ||
return false; | ||
} | ||
_e2 = cons_enum(e2._2, e2._3); | ||
_e1 = cons_enum(e1._2, e1._3); | ||
continue ; | ||
}; | ||
}; | ||
var cardinal = function (param) { | ||
if (param) { | ||
return (cardinal(param.l) + 1 | 0) + cardinal(param.r) | 0; | ||
} else { | ||
return 0; | ||
} | ||
}; | ||
var bindings_aux = function (_accu, _param) { | ||
while(true) { | ||
var param = _param; | ||
var accu = _accu; | ||
if (!param) { | ||
return accu; | ||
} | ||
_param = param.l; | ||
_accu = { | ||
hd: [ | ||
param.v, | ||
param.d | ||
], | ||
tl: bindings_aux(accu, param.r) | ||
}; | ||
continue ; | ||
}; | ||
}; | ||
var bindings = function (s) { | ||
return bindings_aux(/* [] */0, s); | ||
}; | ||
return { | ||
empty: /* Empty */0, | ||
is_empty: is_empty, | ||
mem: mem, | ||
add: add, | ||
update: update, | ||
singleton: singleton, | ||
remove: remove, | ||
merge: merge$1, | ||
union: union, | ||
compare: compare, | ||
equal: equal, | ||
iter: iter, | ||
fold: fold, | ||
for_all: for_all, | ||
exists: exists, | ||
filter: filter, | ||
partition: partition, | ||
cardinal: cardinal, | ||
bindings: bindings, | ||
min_binding: min_binding, | ||
min_binding_opt: min_binding_opt, | ||
max_binding: max_binding, | ||
max_binding_opt: max_binding_opt, | ||
choose: min_binding, | ||
choose_opt: min_binding_opt, | ||
split: split, | ||
find: find, | ||
find_opt: find_opt, | ||
find_first: find_first, | ||
find_first_opt: find_first_opt, | ||
find_last: find_last, | ||
find_last_opt: find_last_opt, | ||
map: map, | ||
mapi: mapi | ||
}; | ||
}) | ||
}; | ||
var $$Set$1 = $$Set; | ||
var $$Set = { | ||
Make: (function (funarg) { | ||
var height = function (param) { | ||
if (param) { | ||
return param.h; | ||
} else { | ||
return 0; | ||
} | ||
}; | ||
var create = function (l, v, r) { | ||
var hl = l ? l.h : 0; | ||
var hr = r ? r.h : 0; | ||
return /* Node */{ | ||
l: l, | ||
v: v, | ||
r: r, | ||
h: hl >= hr ? hl + 1 | 0 : hr + 1 | 0 | ||
}; | ||
}; | ||
var bal = function (l, v, r) { | ||
var hl = l ? l.h : 0; | ||
var hr = r ? r.h : 0; | ||
if (hl > (hr + 2 | 0)) { | ||
if (l) { | ||
var lr = l.r; | ||
var lv = l.v; | ||
var ll = l.l; | ||
if (height(ll) >= height(lr)) { | ||
return create(ll, lv, create(lr, v, r)); | ||
} | ||
if (lr) { | ||
return create(create(ll, lv, lr.l), lr.v, create(lr.r, v, r)); | ||
} | ||
throw { | ||
RE_EXN_ID: "Invalid_argument", | ||
_1: "Set.bal", | ||
Error: new Error() | ||
}; | ||
} | ||
throw { | ||
RE_EXN_ID: "Invalid_argument", | ||
_1: "Set.bal", | ||
Error: new Error() | ||
}; | ||
} | ||
if (hr <= (hl + 2 | 0)) { | ||
return /* Node */{ | ||
l: l, | ||
v: v, | ||
r: r, | ||
h: hl >= hr ? hl + 1 | 0 : hr + 1 | 0 | ||
}; | ||
} | ||
if (r) { | ||
var rr = r.r; | ||
var rv = r.v; | ||
var rl = r.l; | ||
if (height(rr) >= height(rl)) { | ||
return create(create(l, v, rl), rv, rr); | ||
} | ||
if (rl) { | ||
return create(create(l, v, rl.l), rl.v, create(rl.r, rv, rr)); | ||
} | ||
throw { | ||
RE_EXN_ID: "Invalid_argument", | ||
_1: "Set.bal", | ||
Error: new Error() | ||
}; | ||
} | ||
throw { | ||
RE_EXN_ID: "Invalid_argument", | ||
_1: "Set.bal", | ||
Error: new Error() | ||
}; | ||
}; | ||
var add = function (x, t) { | ||
if (!t) { | ||
return /* Node */{ | ||
l: /* Empty */0, | ||
v: x, | ||
r: /* Empty */0, | ||
h: 1 | ||
}; | ||
} | ||
var r = t.r; | ||
var v = t.v; | ||
var l = t.l; | ||
var c = Curry._2(funarg.compare, x, v); | ||
if (c === 0) { | ||
return t; | ||
} | ||
if (c < 0) { | ||
var ll = add(x, l); | ||
if (l === ll) { | ||
return t; | ||
} else { | ||
return bal(ll, v, r); | ||
} | ||
} | ||
var rr = add(x, r); | ||
if (r === rr) { | ||
return t; | ||
} else { | ||
return bal(l, v, rr); | ||
} | ||
}; | ||
var singleton = function (x) { | ||
return /* Node */{ | ||
l: /* Empty */0, | ||
v: x, | ||
r: /* Empty */0, | ||
h: 1 | ||
}; | ||
}; | ||
var add_min_element = function (x, param) { | ||
if (param) { | ||
return bal(add_min_element(x, param.l), param.v, param.r); | ||
} else { | ||
return singleton(x); | ||
} | ||
}; | ||
var add_max_element = function (x, param) { | ||
if (param) { | ||
return bal(param.l, param.v, add_max_element(x, param.r)); | ||
} else { | ||
return singleton(x); | ||
} | ||
}; | ||
var join = function (l, v, r) { | ||
if (!l) { | ||
return add_min_element(v, r); | ||
} | ||
if (!r) { | ||
return add_max_element(v, l); | ||
} | ||
var rh = r.h; | ||
var lh = l.h; | ||
if (lh > (rh + 2 | 0)) { | ||
return bal(l.l, l.v, join(l.r, v, r)); | ||
} else if (rh > (lh + 2 | 0)) { | ||
return bal(join(l, v, r.l), r.v, r.r); | ||
} else { | ||
return create(l, v, r); | ||
} | ||
}; | ||
var min_elt = function (_param) { | ||
while(true) { | ||
var param = _param; | ||
if (param) { | ||
var l = param.l; | ||
if (!l) { | ||
return param.v; | ||
} | ||
_param = l; | ||
continue ; | ||
} | ||
throw { | ||
RE_EXN_ID: "Not_found", | ||
Error: new Error() | ||
}; | ||
}; | ||
}; | ||
var min_elt_opt = function (_param) { | ||
while(true) { | ||
var param = _param; | ||
if (!param) { | ||
return ; | ||
} | ||
var l = param.l; | ||
if (!l) { | ||
return Caml_option.some(param.v); | ||
} | ||
_param = l; | ||
continue ; | ||
}; | ||
}; | ||
var max_elt = function (_param) { | ||
while(true) { | ||
var param = _param; | ||
if (param) { | ||
var r = param.r; | ||
if (!r) { | ||
return param.v; | ||
} | ||
_param = r; | ||
continue ; | ||
} | ||
throw { | ||
RE_EXN_ID: "Not_found", | ||
Error: new Error() | ||
}; | ||
}; | ||
}; | ||
var max_elt_opt = function (_param) { | ||
while(true) { | ||
var param = _param; | ||
if (!param) { | ||
return ; | ||
} | ||
var r = param.r; | ||
if (!r) { | ||
return Caml_option.some(param.v); | ||
} | ||
_param = r; | ||
continue ; | ||
}; | ||
}; | ||
var remove_min_elt = function (param) { | ||
if (param) { | ||
var l = param.l; | ||
if (l) { | ||
return bal(remove_min_elt(l), param.v, param.r); | ||
} else { | ||
return param.r; | ||
} | ||
} | ||
throw { | ||
RE_EXN_ID: "Invalid_argument", | ||
_1: "Set.remove_min_elt", | ||
Error: new Error() | ||
}; | ||
}; | ||
var merge = function (t1, t2) { | ||
if (t1) { | ||
if (t2) { | ||
return bal(t1, min_elt(t2), remove_min_elt(t2)); | ||
} else { | ||
return t1; | ||
} | ||
} else { | ||
return t2; | ||
} | ||
}; | ||
var concat = function (t1, t2) { | ||
if (t1) { | ||
if (t2) { | ||
return join(t1, min_elt(t2), remove_min_elt(t2)); | ||
} else { | ||
return t1; | ||
} | ||
} else { | ||
return t2; | ||
} | ||
}; | ||
var split = function (x, param) { | ||
if (!param) { | ||
return [ | ||
/* Empty */0, | ||
false, | ||
/* Empty */0 | ||
]; | ||
} | ||
var r = param.r; | ||
var v = param.v; | ||
var l = param.l; | ||
var c = Curry._2(funarg.compare, x, v); | ||
if (c === 0) { | ||
return [ | ||
l, | ||
true, | ||
r | ||
]; | ||
} | ||
if (c < 0) { | ||
var match = split(x, l); | ||
return [ | ||
match[0], | ||
match[1], | ||
join(match[2], v, r) | ||
]; | ||
} | ||
var match$1 = split(x, r); | ||
return [ | ||
join(l, v, match$1[0]), | ||
match$1[1], | ||
match$1[2] | ||
]; | ||
}; | ||
var is_empty = function (param) { | ||
if (param) { | ||
return false; | ||
} else { | ||
return true; | ||
} | ||
}; | ||
var mem = function (x, _param) { | ||
while(true) { | ||
var param = _param; | ||
if (!param) { | ||
return false; | ||
} | ||
var c = Curry._2(funarg.compare, x, param.v); | ||
if (c === 0) { | ||
return true; | ||
} | ||
_param = c < 0 ? param.l : param.r; | ||
continue ; | ||
}; | ||
}; | ||
var remove = function (x, t) { | ||
if (!t) { | ||
return /* Empty */0; | ||
} | ||
var r = t.r; | ||
var v = t.v; | ||
var l = t.l; | ||
var c = Curry._2(funarg.compare, x, v); | ||
if (c === 0) { | ||
return merge(l, r); | ||
} | ||
if (c < 0) { | ||
var ll = remove(x, l); | ||
if (l === ll) { | ||
return t; | ||
} else { | ||
return bal(ll, v, r); | ||
} | ||
} | ||
var rr = remove(x, r); | ||
if (r === rr) { | ||
return t; | ||
} else { | ||
return bal(l, v, rr); | ||
} | ||
}; | ||
var union = function (s1, s2) { | ||
if (!s1) { | ||
return s2; | ||
} | ||
if (!s2) { | ||
return s1; | ||
} | ||
var h2 = s2.h; | ||
var v2 = s2.v; | ||
var h1 = s1.h; | ||
var v1 = s1.v; | ||
if (h1 >= h2) { | ||
if (h2 === 1) { | ||
return add(v2, s1); | ||
} | ||
var match = split(v1, s2); | ||
return join(union(s1.l, match[0]), v1, union(s1.r, match[2])); | ||
} | ||
if (h1 === 1) { | ||
return add(v1, s2); | ||
} | ||
var match$1 = split(v2, s1); | ||
return join(union(match$1[0], s2.l), v2, union(match$1[2], s2.r)); | ||
}; | ||
var inter = function (s1, s2) { | ||
if (!s1) { | ||
return /* Empty */0; | ||
} | ||
if (!s2) { | ||
return /* Empty */0; | ||
} | ||
var r1 = s1.r; | ||
var v1 = s1.v; | ||
var l1 = s1.l; | ||
var match = split(v1, s2); | ||
var l2 = match[0]; | ||
if (match[1]) { | ||
return join(inter(l1, l2), v1, inter(r1, match[2])); | ||
} else { | ||
return concat(inter(l1, l2), inter(r1, match[2])); | ||
} | ||
}; | ||
var diff = function (s1, s2) { | ||
if (!s1) { | ||
return /* Empty */0; | ||
} | ||
if (!s2) { | ||
return s1; | ||
} | ||
var r1 = s1.r; | ||
var v1 = s1.v; | ||
var l1 = s1.l; | ||
var match = split(v1, s2); | ||
var l2 = match[0]; | ||
if (match[1]) { | ||
return concat(diff(l1, l2), diff(r1, match[2])); | ||
} else { | ||
return join(diff(l1, l2), v1, diff(r1, match[2])); | ||
} | ||
}; | ||
var cons_enum = function (_s, _e) { | ||
while(true) { | ||
var e = _e; | ||
var s = _s; | ||
if (!s) { | ||
return e; | ||
} | ||
_e = /* More */{ | ||
_0: s.v, | ||
_1: s.r, | ||
_2: e | ||
}; | ||
_s = s.l; | ||
continue ; | ||
}; | ||
}; | ||
var compare_aux = function (_e1, _e2) { | ||
while(true) { | ||
var e2 = _e2; | ||
var e1 = _e1; | ||
if (!e1) { | ||
if (e2) { | ||
return -1; | ||
} else { | ||
return 0; | ||
} | ||
} | ||
if (!e2) { | ||
return 1; | ||
} | ||
var c = Curry._2(funarg.compare, e1._0, e2._0); | ||
if (c !== 0) { | ||
return c; | ||
} | ||
_e2 = cons_enum(e2._1, e2._2); | ||
_e1 = cons_enum(e1._1, e1._2); | ||
continue ; | ||
}; | ||
}; | ||
var compare = function (s1, s2) { | ||
return compare_aux(cons_enum(s1, /* End */0), cons_enum(s2, /* End */0)); | ||
}; | ||
var equal = function (s1, s2) { | ||
return compare(s1, s2) === 0; | ||
}; | ||
var subset = function (_s1, _s2) { | ||
while(true) { | ||
var s2 = _s2; | ||
var s1 = _s1; | ||
if (!s1) { | ||
return true; | ||
} | ||
if (!s2) { | ||
return false; | ||
} | ||
var r2 = s2.r; | ||
var l2 = s2.l; | ||
var r1 = s1.r; | ||
var v1 = s1.v; | ||
var l1 = s1.l; | ||
var c = Curry._2(funarg.compare, v1, s2.v); | ||
if (c === 0) { | ||
if (!subset(l1, l2)) { | ||
return false; | ||
} | ||
_s2 = r2; | ||
_s1 = r1; | ||
continue ; | ||
} | ||
if (c < 0) { | ||
if (!subset(/* Node */{ | ||
l: l1, | ||
v: v1, | ||
r: /* Empty */0, | ||
h: 0 | ||
}, l2)) { | ||
return false; | ||
} | ||
_s1 = r1; | ||
continue ; | ||
} | ||
if (!subset(/* Node */{ | ||
l: /* Empty */0, | ||
v: v1, | ||
r: r1, | ||
h: 0 | ||
}, r2)) { | ||
return false; | ||
} | ||
_s1 = l1; | ||
continue ; | ||
}; | ||
}; | ||
var iter = function (f, _param) { | ||
while(true) { | ||
var param = _param; | ||
if (!param) { | ||
return ; | ||
} | ||
iter(f, param.l); | ||
Curry._1(f, param.v); | ||
_param = param.r; | ||
continue ; | ||
}; | ||
}; | ||
var fold = function (f, _s, _accu) { | ||
while(true) { | ||
var accu = _accu; | ||
var s = _s; | ||
if (!s) { | ||
return accu; | ||
} | ||
_accu = Curry._2(f, s.v, fold(f, s.l, accu)); | ||
_s = s.r; | ||
continue ; | ||
}; | ||
}; | ||
var for_all = function (p, _param) { | ||
while(true) { | ||
var param = _param; | ||
if (!param) { | ||
return true; | ||
} | ||
if (!Curry._1(p, param.v)) { | ||
return false; | ||
} | ||
if (!for_all(p, param.l)) { | ||
return false; | ||
} | ||
_param = param.r; | ||
continue ; | ||
}; | ||
}; | ||
var exists = function (p, _param) { | ||
while(true) { | ||
var param = _param; | ||
if (!param) { | ||
return false; | ||
} | ||
if (Curry._1(p, param.v)) { | ||
return true; | ||
} | ||
if (exists(p, param.l)) { | ||
return true; | ||
} | ||
_param = param.r; | ||
continue ; | ||
}; | ||
}; | ||
var filter = function (p, t) { | ||
if (!t) { | ||
return /* Empty */0; | ||
} | ||
var r = t.r; | ||
var v = t.v; | ||
var l = t.l; | ||
var l$p = filter(p, l); | ||
var pv = Curry._1(p, v); | ||
var r$p = filter(p, r); | ||
if (pv) { | ||
if (l === l$p && r === r$p) { | ||
return t; | ||
} else { | ||
return join(l$p, v, r$p); | ||
} | ||
} else { | ||
return concat(l$p, r$p); | ||
} | ||
}; | ||
var partition = function (p, param) { | ||
if (!param) { | ||
return [ | ||
/* Empty */0, | ||
/* Empty */0 | ||
]; | ||
} | ||
var v = param.v; | ||
var match = partition(p, param.l); | ||
var lf = match[1]; | ||
var lt = match[0]; | ||
var pv = Curry._1(p, v); | ||
var match$1 = partition(p, param.r); | ||
var rf = match$1[1]; | ||
var rt = match$1[0]; | ||
if (pv) { | ||
return [ | ||
join(lt, v, rt), | ||
concat(lf, rf) | ||
]; | ||
} else { | ||
return [ | ||
concat(lt, rt), | ||
join(lf, v, rf) | ||
]; | ||
} | ||
}; | ||
var cardinal = function (param) { | ||
if (param) { | ||
return (cardinal(param.l) + 1 | 0) + cardinal(param.r) | 0; | ||
} else { | ||
return 0; | ||
} | ||
}; | ||
var elements_aux = function (_accu, _param) { | ||
while(true) { | ||
var param = _param; | ||
var accu = _accu; | ||
if (!param) { | ||
return accu; | ||
} | ||
_param = param.l; | ||
_accu = { | ||
hd: param.v, | ||
tl: elements_aux(accu, param.r) | ||
}; | ||
continue ; | ||
}; | ||
}; | ||
var elements = function (s) { | ||
return elements_aux(/* [] */0, s); | ||
}; | ||
var find = function (x, _param) { | ||
while(true) { | ||
var param = _param; | ||
if (param) { | ||
var v = param.v; | ||
var c = Curry._2(funarg.compare, x, v); | ||
if (c === 0) { | ||
return v; | ||
} | ||
_param = c < 0 ? param.l : param.r; | ||
continue ; | ||
} | ||
throw { | ||
RE_EXN_ID: "Not_found", | ||
Error: new Error() | ||
}; | ||
}; | ||
}; | ||
var find_first_aux = function (_v0, f, _param) { | ||
while(true) { | ||
var param = _param; | ||
var v0 = _v0; | ||
if (!param) { | ||
return v0; | ||
} | ||
var v = param.v; | ||
if (Curry._1(f, v)) { | ||
_param = param.l; | ||
_v0 = v; | ||
continue ; | ||
} | ||
_param = param.r; | ||
continue ; | ||
}; | ||
}; | ||
var find_first = function (f, _param) { | ||
while(true) { | ||
var param = _param; | ||
if (param) { | ||
var v = param.v; | ||
if (Curry._1(f, v)) { | ||
return find_first_aux(v, f, param.l); | ||
} | ||
_param = param.r; | ||
continue ; | ||
} | ||
throw { | ||
RE_EXN_ID: "Not_found", | ||
Error: new Error() | ||
}; | ||
}; | ||
}; | ||
var find_first_opt_aux = function (_v0, f, _param) { | ||
while(true) { | ||
var param = _param; | ||
var v0 = _v0; | ||
if (!param) { | ||
return Caml_option.some(v0); | ||
} | ||
var v = param.v; | ||
if (Curry._1(f, v)) { | ||
_param = param.l; | ||
_v0 = v; | ||
continue ; | ||
} | ||
_param = param.r; | ||
continue ; | ||
}; | ||
}; | ||
var find_first_opt = function (f, _param) { | ||
while(true) { | ||
var param = _param; | ||
if (!param) { | ||
return ; | ||
} | ||
var v = param.v; | ||
if (Curry._1(f, v)) { | ||
return find_first_opt_aux(v, f, param.l); | ||
} | ||
_param = param.r; | ||
continue ; | ||
}; | ||
}; | ||
var find_last_aux = function (_v0, f, _param) { | ||
while(true) { | ||
var param = _param; | ||
var v0 = _v0; | ||
if (!param) { | ||
return v0; | ||
} | ||
var v = param.v; | ||
if (Curry._1(f, v)) { | ||
_param = param.r; | ||
_v0 = v; | ||
continue ; | ||
} | ||
_param = param.l; | ||
continue ; | ||
}; | ||
}; | ||
var find_last = function (f, _param) { | ||
while(true) { | ||
var param = _param; | ||
if (param) { | ||
var v = param.v; | ||
if (Curry._1(f, v)) { | ||
return find_last_aux(v, f, param.r); | ||
} | ||
_param = param.l; | ||
continue ; | ||
} | ||
throw { | ||
RE_EXN_ID: "Not_found", | ||
Error: new Error() | ||
}; | ||
}; | ||
}; | ||
var find_last_opt_aux = function (_v0, f, _param) { | ||
while(true) { | ||
var param = _param; | ||
var v0 = _v0; | ||
if (!param) { | ||
return Caml_option.some(v0); | ||
} | ||
var v = param.v; | ||
if (Curry._1(f, v)) { | ||
_param = param.r; | ||
_v0 = v; | ||
continue ; | ||
} | ||
_param = param.l; | ||
continue ; | ||
}; | ||
}; | ||
var find_last_opt = function (f, _param) { | ||
while(true) { | ||
var param = _param; | ||
if (!param) { | ||
return ; | ||
} | ||
var v = param.v; | ||
if (Curry._1(f, v)) { | ||
return find_last_opt_aux(v, f, param.r); | ||
} | ||
_param = param.l; | ||
continue ; | ||
}; | ||
}; | ||
var find_opt = function (x, _param) { | ||
while(true) { | ||
var param = _param; | ||
if (!param) { | ||
return ; | ||
} | ||
var v = param.v; | ||
var c = Curry._2(funarg.compare, x, v); | ||
if (c === 0) { | ||
return Caml_option.some(v); | ||
} | ||
_param = c < 0 ? param.l : param.r; | ||
continue ; | ||
}; | ||
}; | ||
var try_join = function (l, v, r) { | ||
if ((l === /* Empty */0 || Curry._2(funarg.compare, max_elt(l), v) < 0) && (r === /* Empty */0 || Curry._2(funarg.compare, v, min_elt(r)) < 0)) { | ||
return join(l, v, r); | ||
} else { | ||
return union(l, add(v, r)); | ||
} | ||
}; | ||
var map = function (f, t) { | ||
if (!t) { | ||
return /* Empty */0; | ||
} | ||
var r = t.r; | ||
var v = t.v; | ||
var l = t.l; | ||
var l$p = map(f, l); | ||
var v$p = Curry._1(f, v); | ||
var r$p = map(f, r); | ||
if (l === l$p && v === v$p && r === r$p) { | ||
return t; | ||
} else { | ||
return try_join(l$p, v$p, r$p); | ||
} | ||
}; | ||
var of_sorted_list = function (l) { | ||
var sub = function (n, l) { | ||
switch (n) { | ||
case 0 : | ||
return [ | ||
/* Empty */0, | ||
l | ||
]; | ||
case 1 : | ||
if (l) { | ||
return [ | ||
/* Node */{ | ||
l: /* Empty */0, | ||
v: l.hd, | ||
r: /* Empty */0, | ||
h: 1 | ||
}, | ||
l.tl | ||
]; | ||
} | ||
break; | ||
case 2 : | ||
if (l) { | ||
var match = l.tl; | ||
if (match) { | ||
return [ | ||
/* Node */{ | ||
l: /* Node */{ | ||
l: /* Empty */0, | ||
v: l.hd, | ||
r: /* Empty */0, | ||
h: 1 | ||
}, | ||
v: match.hd, | ||
r: /* Empty */0, | ||
h: 2 | ||
}, | ||
match.tl | ||
]; | ||
} | ||
} | ||
break; | ||
case 3 : | ||
if (l) { | ||
var match$1 = l.tl; | ||
if (match$1) { | ||
var match$2 = match$1.tl; | ||
if (match$2) { | ||
return [ | ||
/* Node */{ | ||
l: /* Node */{ | ||
l: /* Empty */0, | ||
v: l.hd, | ||
r: /* Empty */0, | ||
h: 1 | ||
}, | ||
v: match$1.hd, | ||
r: /* Node */{ | ||
l: /* Empty */0, | ||
v: match$2.hd, | ||
r: /* Empty */0, | ||
h: 1 | ||
}, | ||
h: 2 | ||
}, | ||
match$2.tl | ||
]; | ||
} | ||
} | ||
} | ||
break; | ||
default: | ||
} | ||
var nl = n / 2 | 0; | ||
var match$3 = sub(nl, l); | ||
var l$1 = match$3[1]; | ||
if (l$1) { | ||
var match$4 = sub((n - nl | 0) - 1 | 0, l$1.tl); | ||
return [ | ||
create(match$3[0], l$1.hd, match$4[0]), | ||
match$4[1] | ||
]; | ||
} | ||
throw { | ||
RE_EXN_ID: "Assert_failure", | ||
_1: [ | ||
"setLabels.ml", | ||
510, | ||
18 | ||
], | ||
Error: new Error() | ||
}; | ||
}; | ||
return sub(List.length(l), l)[0]; | ||
}; | ||
var of_list = function (l) { | ||
if (!l) { | ||
return /* Empty */0; | ||
} | ||
var match = l.tl; | ||
var x0 = l.hd; | ||
if (!match) { | ||
return singleton(x0); | ||
} | ||
var match$1 = match.tl; | ||
var x1 = match.hd; | ||
if (!match$1) { | ||
return add(x1, singleton(x0)); | ||
} | ||
var match$2 = match$1.tl; | ||
var x2 = match$1.hd; | ||
if (!match$2) { | ||
return add(x2, add(x1, singleton(x0))); | ||
} | ||
var match$3 = match$2.tl; | ||
var x3 = match$2.hd; | ||
if (match$3) { | ||
if (match$3.tl) { | ||
return of_sorted_list(List.sort_uniq(funarg.compare, l)); | ||
} else { | ||
return add(match$3.hd, add(x3, add(x2, add(x1, singleton(x0))))); | ||
} | ||
} else { | ||
return add(x3, add(x2, add(x1, singleton(x0)))); | ||
} | ||
}; | ||
return { | ||
empty: /* Empty */0, | ||
is_empty: is_empty, | ||
mem: mem, | ||
add: add, | ||
singleton: singleton, | ||
remove: remove, | ||
union: union, | ||
inter: inter, | ||
diff: diff, | ||
compare: compare, | ||
equal: equal, | ||
subset: subset, | ||
iter: iter, | ||
map: map, | ||
fold: fold, | ||
for_all: for_all, | ||
exists: exists, | ||
filter: filter, | ||
partition: partition, | ||
cardinal: cardinal, | ||
elements: elements, | ||
min_elt: min_elt, | ||
min_elt_opt: min_elt_opt, | ||
max_elt: max_elt, | ||
max_elt_opt: max_elt_opt, | ||
choose: min_elt, | ||
choose_opt: min_elt_opt, | ||
split: split, | ||
find: find, | ||
find_opt: find_opt, | ||
find_first: find_first, | ||
find_first_opt: find_first_opt, | ||
find_last: find_last, | ||
find_last_opt: find_last_opt, | ||
of_list: of_list | ||
}; | ||
}) | ||
}; | ||
export { | ||
Hashtbl$1 as Hashtbl, | ||
$$Map$1 as $$Map, | ||
$$Set$1 as $$Set, | ||
Hashtbl , | ||
$$Map , | ||
$$Set , | ||
} | ||
/* No side effect */ |
@@ -8,4 +8,3 @@ | ||
Watch , | ||
} | ||
/* No side effect */ |
@@ -8,7 +8,6 @@ | ||
Process.env[key] = $$var; | ||
} | ||
function deleteEnvVar(s) { | ||
return Js_dict.unsafeDeleteKey(Process.env, s); | ||
Js_dict.unsafeDeleteKey(Process.env, s); | ||
} | ||
@@ -19,4 +18,3 @@ | ||
deleteEnvVar , | ||
} | ||
/* process Not a pure module */ |
@@ -38,4 +38,3 @@ | ||
test , | ||
} | ||
/* No side effect */ |
@@ -10,4 +10,3 @@ | ||
is_block , | ||
} | ||
/* No side effect */ |
@@ -51,3 +51,2 @@ | ||
env.stacksize = newsize; | ||
} | ||
@@ -58,3 +57,2 @@ | ||
env.lval = undefined; | ||
} | ||
@@ -85,3 +83,3 @@ | ||
var cmd = _cmd; | ||
var match = Caml_parser.caml_parse_engine(tables, env, cmd, arg); | ||
var match = Caml_parser.parse_engine(tables, env, cmd, arg); | ||
switch (match) { | ||
@@ -178,3 +176,3 @@ case /* Read_token */0 : | ||
var en = Caml_array.get(env.symb_end_stack, (env.asp - i | 0) + 1 | 0); | ||
if (Caml_obj.caml_notequal(st, en)) { | ||
if (Caml_obj.notequal(st, en)) { | ||
return st; | ||
@@ -223,3 +221,3 @@ } | ||
var set_trace = Caml_parser.caml_set_parser_trace; | ||
var set_trace = Caml_parser.set_parser_trace; | ||
@@ -243,4 +241,3 @@ export { | ||
parse_error , | ||
} | ||
/* No side effect */ |
import * as Curry from "./curry.js"; | ||
import * as Caml_io from "./caml_io.js"; | ||
import * as Caml_sys from "./caml_sys.js"; | ||
import * as Caml_bytes from "./caml_bytes.js"; | ||
import * as Caml_format from "./caml_format.js"; | ||
@@ -11,3 +9,2 @@ import * as Caml_string from "./caml_string.js"; | ||
import * as Caml_js_exceptions from "./caml_js_exceptions.js"; | ||
import * as Caml_external_polyfill from "./caml_external_polyfill.js"; | ||
@@ -109,3 +106,3 @@ function failwith(s) { | ||
try { | ||
return Caml_format.caml_int_of_string(s); | ||
return Caml_format.int_of_string(s); | ||
} | ||
@@ -146,3 +143,3 @@ catch (raw_exn){ | ||
function string_of_float(f) { | ||
return valid_float_lexem(Caml_format.caml_format_float("%.12g", f)); | ||
return valid_float_lexem(Caml_format.format_float("%.12g", f)); | ||
} | ||
@@ -152,3 +149,3 @@ | ||
try { | ||
return Caml_format.caml_float_of_string(s); | ||
return Caml_format.float_of_string(s); | ||
} | ||
@@ -175,338 +172,26 @@ catch (raw_exn){ | ||
var stdin = Caml_io.stdin; | ||
var stdout = Caml_io.stdout; | ||
var stderr = Caml_io.stderr; | ||
function open_out_gen(mode, perm, name) { | ||
var c = Caml_external_polyfill.resolve("caml_ml_open_descriptor_out")(Caml_external_polyfill.resolve("caml_sys_open")(name, mode, perm)); | ||
Caml_external_polyfill.resolve("caml_ml_set_channel_name")(c, name); | ||
return c; | ||
} | ||
function open_out(name) { | ||
return open_out_gen({ | ||
hd: /* Open_wronly */1, | ||
tl: { | ||
hd: /* Open_creat */3, | ||
tl: { | ||
hd: /* Open_trunc */4, | ||
tl: { | ||
hd: /* Open_text */7, | ||
tl: /* [] */0 | ||
} | ||
} | ||
} | ||
}, 438, name); | ||
} | ||
function open_out_bin(name) { | ||
return open_out_gen({ | ||
hd: /* Open_wronly */1, | ||
tl: { | ||
hd: /* Open_creat */3, | ||
tl: { | ||
hd: /* Open_trunc */4, | ||
tl: { | ||
hd: /* Open_binary */6, | ||
tl: /* [] */0 | ||
} | ||
} | ||
} | ||
}, 438, name); | ||
} | ||
function flush_all(param) { | ||
var _param = Caml_io.caml_ml_out_channels_list(undefined); | ||
while(true) { | ||
var param$1 = _param; | ||
if (!param$1) { | ||
return ; | ||
} | ||
try { | ||
Caml_io.caml_ml_flush(param$1.hd); | ||
} | ||
catch (raw_exn){ | ||
var exn = Caml_js_exceptions.internalToOCamlException(raw_exn); | ||
if (exn.RE_EXN_ID !== "Sys_error") { | ||
throw exn; | ||
} | ||
} | ||
_param = param$1.tl; | ||
continue ; | ||
}; | ||
} | ||
function output_bytes(oc, s) { | ||
return Caml_external_polyfill.resolve("caml_ml_output_bytes")(oc, s, 0, s.length); | ||
} | ||
function output_string(oc, s) { | ||
return Caml_io.caml_ml_output(oc, s, 0, s.length); | ||
} | ||
function output(oc, s, ofs, len) { | ||
if (ofs < 0 || len < 0 || ofs > (s.length - len | 0)) { | ||
throw { | ||
RE_EXN_ID: "Invalid_argument", | ||
_1: "output", | ||
Error: new Error() | ||
}; | ||
} | ||
return Caml_external_polyfill.resolve("caml_ml_output_bytes")(oc, s, ofs, len); | ||
} | ||
function output_substring(oc, s, ofs, len) { | ||
if (ofs < 0 || len < 0 || ofs > (s.length - len | 0)) { | ||
throw { | ||
RE_EXN_ID: "Invalid_argument", | ||
_1: "output_substring", | ||
Error: new Error() | ||
}; | ||
} | ||
return Caml_io.caml_ml_output(oc, s, ofs, len); | ||
} | ||
function output_value(chan, v) { | ||
return Caml_external_polyfill.resolve("caml_output_value")(chan, v, /* [] */0); | ||
} | ||
function close_out(oc) { | ||
Caml_io.caml_ml_flush(oc); | ||
return Caml_external_polyfill.resolve("caml_ml_close_channel")(oc); | ||
} | ||
function close_out_noerr(oc) { | ||
try { | ||
Caml_io.caml_ml_flush(oc); | ||
} | ||
catch (exn){ | ||
} | ||
try { | ||
return Caml_external_polyfill.resolve("caml_ml_close_channel")(oc); | ||
} | ||
catch (exn$1){ | ||
return ; | ||
} | ||
} | ||
function open_in_gen(mode, perm, name) { | ||
var c = Caml_external_polyfill.resolve("caml_ml_open_descriptor_in")(Caml_external_polyfill.resolve("caml_sys_open")(name, mode, perm)); | ||
Caml_external_polyfill.resolve("caml_ml_set_channel_name")(c, name); | ||
return c; | ||
} | ||
function open_in(name) { | ||
return open_in_gen({ | ||
hd: /* Open_rdonly */0, | ||
tl: { | ||
hd: /* Open_text */7, | ||
tl: /* [] */0 | ||
} | ||
}, 0, name); | ||
} | ||
function open_in_bin(name) { | ||
return open_in_gen({ | ||
hd: /* Open_rdonly */0, | ||
tl: { | ||
hd: /* Open_binary */6, | ||
tl: /* [] */0 | ||
} | ||
}, 0, name); | ||
} | ||
function input(ic, s, ofs, len) { | ||
if (ofs < 0 || len < 0 || ofs > (s.length - len | 0)) { | ||
throw { | ||
RE_EXN_ID: "Invalid_argument", | ||
_1: "input", | ||
Error: new Error() | ||
}; | ||
} | ||
return Caml_external_polyfill.resolve("caml_ml_input")(ic, s, ofs, len); | ||
} | ||
function unsafe_really_input(ic, s, _ofs, _len) { | ||
while(true) { | ||
var len = _len; | ||
var ofs = _ofs; | ||
if (len <= 0) { | ||
return ; | ||
} | ||
var r = Caml_external_polyfill.resolve("caml_ml_input")(ic, s, ofs, len); | ||
if (r === 0) { | ||
throw { | ||
RE_EXN_ID: "End_of_file", | ||
Error: new Error() | ||
}; | ||
} | ||
_len = len - r | 0; | ||
_ofs = ofs + r | 0; | ||
continue ; | ||
}; | ||
} | ||
function really_input(ic, s, ofs, len) { | ||
if (ofs < 0 || len < 0 || ofs > (s.length - len | 0)) { | ||
throw { | ||
RE_EXN_ID: "Invalid_argument", | ||
_1: "really_input", | ||
Error: new Error() | ||
}; | ||
} | ||
return unsafe_really_input(ic, s, ofs, len); | ||
} | ||
function really_input_string(ic, len) { | ||
var s = Caml_bytes.caml_create_bytes(len); | ||
really_input(ic, s, 0, len); | ||
return Caml_bytes.bytes_to_string(s); | ||
} | ||
function input_line(chan) { | ||
var build_result = function (buf, _pos, _param) { | ||
while(true) { | ||
var param = _param; | ||
var pos = _pos; | ||
if (!param) { | ||
return buf; | ||
} | ||
var hd = param.hd; | ||
var len = hd.length; | ||
Caml_bytes.caml_blit_bytes(hd, 0, buf, pos - len | 0, len); | ||
_param = param.tl; | ||
_pos = pos - len | 0; | ||
continue ; | ||
}; | ||
}; | ||
var scan = function (_accu, _len) { | ||
while(true) { | ||
var len = _len; | ||
var accu = _accu; | ||
var n = Caml_external_polyfill.resolve("caml_ml_input_scan_line")(chan); | ||
if (n === 0) { | ||
if (accu) { | ||
return build_result(Caml_bytes.caml_create_bytes(len), len, accu); | ||
} | ||
throw { | ||
RE_EXN_ID: "End_of_file", | ||
Error: new Error() | ||
}; | ||
} | ||
if (n > 0) { | ||
var res = Caml_bytes.caml_create_bytes(n - 1 | 0); | ||
Caml_external_polyfill.resolve("caml_ml_input")(chan, res, 0, n - 1 | 0); | ||
Caml_external_polyfill.resolve("caml_ml_input_char")(chan); | ||
if (!accu) { | ||
return res; | ||
} | ||
var len$1 = (len + n | 0) - 1 | 0; | ||
return build_result(Caml_bytes.caml_create_bytes(len$1), len$1, { | ||
hd: res, | ||
tl: accu | ||
}); | ||
} | ||
var beg = Caml_bytes.caml_create_bytes(-n | 0); | ||
Caml_external_polyfill.resolve("caml_ml_input")(chan, beg, 0, -n | 0); | ||
_len = len - n | 0; | ||
_accu = { | ||
hd: beg, | ||
tl: accu | ||
}; | ||
continue ; | ||
}; | ||
}; | ||
return Caml_bytes.bytes_to_string(scan(/* [] */0, 0)); | ||
} | ||
function close_in_noerr(ic) { | ||
try { | ||
return Caml_external_polyfill.resolve("caml_ml_close_channel")(ic); | ||
} | ||
catch (exn){ | ||
return ; | ||
} | ||
} | ||
function print_char(c) { | ||
return Caml_io.caml_ml_output_char(stdout, c); | ||
} | ||
function print_string(s) { | ||
return output_string(stdout, s); | ||
} | ||
function print_bytes(s) { | ||
return output_bytes(stdout, s); | ||
} | ||
function print_int(i) { | ||
return output_string(stdout, String(i)); | ||
} | ||
function print_float(f) { | ||
return output_string(stdout, valid_float_lexem(Caml_format.caml_format_float("%.12g", f))); | ||
} | ||
function print_newline(param) { | ||
Caml_io.caml_ml_output_char(stdout, /* '\n' */10); | ||
return Caml_io.caml_ml_flush(stdout); | ||
console.log(""); | ||
} | ||
function prerr_char(c) { | ||
return Caml_io.caml_ml_output_char(stderr, c); | ||
} | ||
function prerr_string(s) { | ||
return output_string(stderr, s); | ||
} | ||
function prerr_bytes(s) { | ||
return output_bytes(stderr, s); | ||
} | ||
function prerr_int(i) { | ||
return output_string(stderr, String(i)); | ||
} | ||
function prerr_float(f) { | ||
return output_string(stderr, valid_float_lexem(Caml_format.caml_format_float("%.12g", f))); | ||
} | ||
function prerr_newline(param) { | ||
Caml_io.caml_ml_output_char(stderr, /* '\n' */10); | ||
return Caml_io.caml_ml_flush(stderr); | ||
console.error(""); | ||
} | ||
function read_line(param) { | ||
Caml_io.caml_ml_flush(stdout); | ||
return input_line(stdin); | ||
function print_int(i) { | ||
console.log(String(i)); | ||
} | ||
function read_int(param) { | ||
return Caml_format.caml_int_of_string((Caml_io.caml_ml_flush(stdout), input_line(stdin))); | ||
function print_float(i) { | ||
console.log(valid_float_lexem(Caml_format.format_float("%.12g", i))); | ||
} | ||
function read_int_opt(param) { | ||
return int_of_string_opt((Caml_io.caml_ml_flush(stdout), input_line(stdin))); | ||
function print_string(prim) { | ||
console.log(prim); | ||
} | ||
function read_float(param) { | ||
return Caml_format.caml_float_of_string((Caml_io.caml_ml_flush(stdout), input_line(stdin))); | ||
} | ||
function read_float_opt(param) { | ||
return float_of_string_opt((Caml_io.caml_ml_flush(stdout), input_line(stdin))); | ||
} | ||
function string_of_format(param) { | ||
return param._1; | ||
} | ||
var exit_function = { | ||
contents: flush_all | ||
contents: (function (prim) { | ||
}) | ||
}; | ||
@@ -518,14 +203,9 @@ | ||
Curry._1(f, undefined); | ||
return Curry._1(g, undefined); | ||
Curry._1(g, undefined); | ||
}); | ||
} | ||
function do_at_exit(param) { | ||
return Curry._1(exit_function.contents, undefined); | ||
} | ||
function exit(retcode) { | ||
do_at_exit(undefined); | ||
return Caml_sys.caml_sys_exit(retcode); | ||
Curry._1(exit_function.contents, undefined); | ||
return Caml_sys.sys_exit(retcode); | ||
} | ||
@@ -545,97 +225,2 @@ | ||
var flush = Caml_io.caml_ml_flush; | ||
var output_char = Caml_io.caml_ml_output_char; | ||
var output_byte = Caml_io.caml_ml_output_char; | ||
function output_binary_int(prim0, prim1) { | ||
return Caml_external_polyfill.resolve("caml_ml_output_int")(prim0, prim1); | ||
} | ||
function seek_out(prim0, prim1) { | ||
return Caml_external_polyfill.resolve("caml_ml_seek_out")(prim0, prim1); | ||
} | ||
function pos_out(prim) { | ||
return Caml_external_polyfill.resolve("caml_ml_pos_out")(prim); | ||
} | ||
function out_channel_length(prim) { | ||
return Caml_external_polyfill.resolve("caml_ml_channel_size")(prim); | ||
} | ||
function set_binary_mode_out(prim0, prim1) { | ||
return Caml_external_polyfill.resolve("caml_ml_set_binary_mode")(prim0, prim1); | ||
} | ||
function input_char(prim) { | ||
return Caml_external_polyfill.resolve("caml_ml_input_char")(prim); | ||
} | ||
function input_byte(prim) { | ||
return Caml_external_polyfill.resolve("caml_ml_input_char")(prim); | ||
} | ||
function input_binary_int(prim) { | ||
return Caml_external_polyfill.resolve("caml_ml_input_int")(prim); | ||
} | ||
function input_value(prim) { | ||
return Caml_external_polyfill.resolve("caml_input_value")(prim); | ||
} | ||
function seek_in(prim0, prim1) { | ||
return Caml_external_polyfill.resolve("caml_ml_seek_in")(prim0, prim1); | ||
} | ||
function pos_in(prim) { | ||
return Caml_external_polyfill.resolve("caml_ml_pos_in")(prim); | ||
} | ||
function in_channel_length(prim) { | ||
return Caml_external_polyfill.resolve("caml_ml_channel_size")(prim); | ||
} | ||
function close_in(prim) { | ||
return Caml_external_polyfill.resolve("caml_ml_close_channel")(prim); | ||
} | ||
function set_binary_mode_in(prim0, prim1) { | ||
return Caml_external_polyfill.resolve("caml_ml_set_binary_mode")(prim0, prim1); | ||
} | ||
function LargeFile_seek_out(prim0, prim1) { | ||
return Caml_external_polyfill.resolve("caml_ml_seek_out_64")(prim0, prim1); | ||
} | ||
function LargeFile_pos_out(prim) { | ||
return Caml_external_polyfill.resolve("caml_ml_pos_out_64")(prim); | ||
} | ||
function LargeFile_out_channel_length(prim) { | ||
return Caml_external_polyfill.resolve("caml_ml_channel_size_64")(prim); | ||
} | ||
function LargeFile_seek_in(prim0, prim1) { | ||
return Caml_external_polyfill.resolve("caml_ml_seek_in_64")(prim0, prim1); | ||
} | ||
function LargeFile_pos_in(prim) { | ||
return Caml_external_polyfill.resolve("caml_ml_pos_in_64")(prim); | ||
} | ||
function LargeFile_in_channel_length(prim) { | ||
return Caml_external_polyfill.resolve("caml_ml_channel_size_64")(prim); | ||
} | ||
var LargeFile = { | ||
seek_out: LargeFile_seek_out, | ||
pos_out: LargeFile_pos_out, | ||
out_channel_length: LargeFile_out_channel_length, | ||
seek_in: LargeFile_seek_in, | ||
pos_in: LargeFile_pos_in, | ||
in_channel_length: LargeFile_in_channel_length | ||
}; | ||
export { | ||
@@ -663,67 +248,11 @@ invalid_arg , | ||
$at , | ||
stdin , | ||
stdout , | ||
stderr , | ||
print_char , | ||
print_string , | ||
print_bytes , | ||
print_int , | ||
print_float , | ||
print_newline , | ||
prerr_char , | ||
prerr_string , | ||
prerr_bytes , | ||
prerr_int , | ||
prerr_float , | ||
prerr_newline , | ||
read_line , | ||
read_int , | ||
read_int_opt , | ||
read_float , | ||
read_float_opt , | ||
open_out , | ||
open_out_bin , | ||
open_out_gen , | ||
flush , | ||
flush_all , | ||
output_char , | ||
output_string , | ||
output_bytes , | ||
output , | ||
output_substring , | ||
output_byte , | ||
output_binary_int , | ||
output_value , | ||
seek_out , | ||
pos_out , | ||
out_channel_length , | ||
close_out , | ||
close_out_noerr , | ||
set_binary_mode_out , | ||
open_in , | ||
open_in_bin , | ||
open_in_gen , | ||
input_char , | ||
input_line , | ||
input , | ||
really_input , | ||
really_input_string , | ||
input_byte , | ||
input_binary_int , | ||
input_value , | ||
seek_in , | ||
pos_in , | ||
in_channel_length , | ||
close_in , | ||
close_in_noerr , | ||
set_binary_mode_in , | ||
LargeFile , | ||
string_of_format , | ||
exit , | ||
at_exit , | ||
valid_float_lexem , | ||
unsafe_really_input , | ||
do_at_exit , | ||
} | ||
/* No side effect */ |
@@ -47,8 +47,2 @@ | ||
} | ||
if (x.RE_EXN_ID === "Out_of_memory") { | ||
return "Out of memory"; | ||
} | ||
if (x.RE_EXN_ID === "Stack_overflow") { | ||
return "Stack overflow"; | ||
} | ||
if (x.RE_EXN_ID === "Match_failure") { | ||
@@ -69,3 +63,3 @@ var match = x._1; | ||
} | ||
var constructor = Caml_exceptions.caml_exn_slot_name(x); | ||
var constructor = Caml_exceptions.exn_slot_name(x); | ||
return constructor + fields(x); | ||
@@ -92,3 +86,2 @@ }; | ||
var x = Caml_js_exceptions.internalToOCamlException(raw_x); | ||
Pervasives.flush(Pervasives.stdout); | ||
console.log("Uncaught exception: " + to_string(x)); | ||
@@ -104,3 +97,2 @@ return Pervasives.exit(2); | ||
}; | ||
} | ||
@@ -113,4 +105,3 @@ | ||
register_printer , | ||
} | ||
/* No side effect */ |
@@ -20,3 +20,2 @@ | ||
q.last = /* Nil */0; | ||
} | ||
@@ -39,3 +38,2 @@ | ||
} | ||
} | ||
@@ -184,4 +182,3 @@ | ||
transfer , | ||
} | ||
/* No side effect */ |
@@ -19,3 +19,2 @@ | ||
st1.idx = st2.idx; | ||
} | ||
@@ -45,3 +44,2 @@ | ||
s.idx = 0; | ||
} | ||
@@ -239,11 +237,11 @@ | ||
function full_init$1(seed) { | ||
return full_init($$default, seed); | ||
full_init($$default, seed); | ||
} | ||
function init(seed) { | ||
return full_init($$default, [seed]); | ||
full_init($$default, [seed]); | ||
} | ||
function self_init(param) { | ||
return full_init$1(random_seed(undefined)); | ||
full_init$1(random_seed(undefined)); | ||
} | ||
@@ -256,3 +254,3 @@ | ||
function set_state(s) { | ||
return assign($$default, s); | ||
assign($$default, s); | ||
} | ||
@@ -285,4 +283,3 @@ | ||
set_state , | ||
} | ||
/* No side effect */ |
@@ -954,4 +954,3 @@ | ||
Make , | ||
} | ||
/* No side effect */ |
@@ -93,3 +93,2 @@ | ||
arr[j] = tmp; | ||
} | ||
@@ -163,3 +162,2 @@ | ||
} | ||
} | ||
@@ -171,4 +169,3 @@ | ||
merge , | ||
} | ||
/* No side effect */ |
@@ -18,3 +18,2 @@ | ||
s.len = 0; | ||
} | ||
@@ -35,3 +34,2 @@ | ||
s.len = s.len + 1 | 0; | ||
} | ||
@@ -72,3 +70,3 @@ | ||
function iter(f, s) { | ||
return List.iter(f, s.c); | ||
List.iter(f, s.c); | ||
} | ||
@@ -92,4 +90,3 @@ | ||
fold , | ||
} | ||
/* No side effect */ |
@@ -17,4 +17,3 @@ | ||
$$String , | ||
} | ||
/* No side effect */ |
@@ -6,3 +6,2 @@ | ||
import * as Caml_bytes from "./caml_bytes.js"; | ||
import * as Pervasives from "./pervasives.js"; | ||
import * as Caml_option from "./caml_option.js"; | ||
@@ -33,8 +32,2 @@ import * as Caml_string from "./caml_string.js"; | ||
function fill_buff(b) { | ||
b.len = Pervasives.input(b.ic, b.buff, 0, b.buff.length); | ||
b.ind = 0; | ||
} | ||
function get_data(count, _d) { | ||
@@ -71,3 +64,3 @@ while(true) { | ||
"stream.ml", | ||
53, | ||
48, | ||
12 | ||
@@ -107,17 +100,2 @@ ], | ||
} | ||
case /* Sbuffio */4 : | ||
var b = d._0; | ||
if (b.ind >= b.len) { | ||
fill_buff(b); | ||
} | ||
if (b.len === 0) { | ||
return /* Sempty */0; | ||
} | ||
var r = b.buff[b.ind]; | ||
b.ind = b.ind + 1 | 0; | ||
return { | ||
TAG: /* Scons */0, | ||
_0: r, | ||
_1: d | ||
}; | ||
@@ -150,3 +128,3 @@ } | ||
"stream.ml", | ||
82, | ||
71, | ||
12 | ||
@@ -168,13 +146,2 @@ ], | ||
return x; | ||
case /* Sbuffio */4 : | ||
var b = f._0; | ||
if (b.ind >= b.len) { | ||
fill_buff(b); | ||
} | ||
if (b.len === 0) { | ||
s.data = /* Sempty */0; | ||
return ; | ||
} else { | ||
return b.buff[b.ind]; | ||
} | ||
@@ -210,7 +177,2 @@ } | ||
break; | ||
case /* Sbuffio */4 : | ||
var b = g._0; | ||
s.count = s.count + 1 | 0; | ||
b.ind = b.ind + 1 | 0; | ||
return ; | ||
default: | ||
@@ -370,17 +332,2 @@ | ||
function of_channel(ic) { | ||
return { | ||
count: 0, | ||
data: { | ||
TAG: /* Sbuffio */4, | ||
_0: { | ||
ic: ic, | ||
buff: Caml_bytes.caml_create_bytes(4096), | ||
len: 0, | ||
ind: 0 | ||
} | ||
} | ||
}; | ||
} | ||
function iapp(i, s) { | ||
@@ -493,23 +440,26 @@ return { | ||
if (typeof param === "number") { | ||
return Pervasives.print_string("Sempty"); | ||
console.log("Sempty"); | ||
return ; | ||
} | ||
switch (param.TAG | 0) { | ||
case /* Scons */0 : | ||
Pervasives.print_string("Scons ("); | ||
console.log("Scons ("); | ||
Curry._1(f, param._0); | ||
Pervasives.print_string(", "); | ||
console.log(", "); | ||
dump_data(f, param._1); | ||
return Pervasives.print_string(")"); | ||
console.log(")"); | ||
return ; | ||
case /* Sapp */1 : | ||
Pervasives.print_string("Sapp ("); | ||
console.log("Sapp ("); | ||
dump_data(f, param._0); | ||
Pervasives.print_string(", "); | ||
console.log(", "); | ||
dump_data(f, param._1); | ||
return Pervasives.print_string(")"); | ||
console.log(")"); | ||
return ; | ||
case /* Slazy */2 : | ||
return Pervasives.print_string("Slazy"); | ||
console.log("Slazy"); | ||
return ; | ||
case /* Sgen */3 : | ||
return Pervasives.print_string("Sgen"); | ||
case /* Sbuffio */4 : | ||
return Pervasives.print_string("Sbuffio"); | ||
console.log("Sgen"); | ||
return ; | ||
@@ -520,8 +470,9 @@ } | ||
function dump(f, s) { | ||
Pervasives.print_string("{count = "); | ||
Pervasives.print_int(count(s)); | ||
Pervasives.print_string("; data = "); | ||
console.log("{count = "); | ||
var i = count(s); | ||
console.log(String(i)); | ||
console.log("; data = "); | ||
dump_data(f, data(s)); | ||
Pervasives.print_string("}"); | ||
return Pervasives.print_newline(undefined); | ||
console.log("}"); | ||
console.log(""); | ||
} | ||
@@ -538,3 +489,2 @@ | ||
of_bytes , | ||
of_channel , | ||
iter , | ||
@@ -556,4 +506,3 @@ next , | ||
dump , | ||
} | ||
/* No side effect */ |
@@ -6,3 +6,3 @@ | ||
import * as Curry from "./curry.js"; | ||
import * as Caml_bytes from "./caml_bytes.js"; | ||
import * as Belt_List from "./belt_List.js"; | ||
import * as Caml_string from "./caml_string.js"; | ||
@@ -12,72 +12,17 @@ import * as Caml_js_exceptions from "./caml_js_exceptions.js"; | ||
function init(n, f) { | ||
return Caml_bytes.bytes_to_string(Bytes.init(n, f)); | ||
return Bytes.unsafe_to_string(Bytes.init(n, f)); | ||
} | ||
function sub(s, ofs, len) { | ||
return Caml_bytes.bytes_to_string(Bytes.sub(Caml_bytes.bytes_of_string(s), ofs, len)); | ||
return Bytes.unsafe_to_string(Bytes.sub(Bytes.unsafe_of_string(s), ofs, len)); | ||
} | ||
function ensure_ge(x, y) { | ||
if (x >= y) { | ||
return x; | ||
} | ||
throw { | ||
RE_EXN_ID: "Invalid_argument", | ||
_1: "String.concat", | ||
Error: new Error() | ||
}; | ||
function concat(sep, xs) { | ||
return Belt_List.toArray(xs).join(sep); | ||
} | ||
function sum_lengths(_acc, seplen, _param) { | ||
while(true) { | ||
var param = _param; | ||
var acc = _acc; | ||
if (!param) { | ||
return acc; | ||
} | ||
var tl = param.tl; | ||
var hd = param.hd; | ||
if (!tl) { | ||
return hd.length + acc | 0; | ||
} | ||
_param = tl; | ||
_acc = ensure_ge((hd.length + seplen | 0) + acc | 0, acc); | ||
continue ; | ||
}; | ||
} | ||
function unsafe_blits(dst, _pos, sep, seplen, _param) { | ||
while(true) { | ||
var param = _param; | ||
var pos = _pos; | ||
if (!param) { | ||
return dst; | ||
} | ||
var tl = param.tl; | ||
var hd = param.hd; | ||
if (tl) { | ||
Caml_bytes.caml_blit_string(hd, 0, dst, pos, hd.length); | ||
Caml_bytes.caml_blit_string(sep, 0, dst, pos + hd.length | 0, seplen); | ||
_param = tl; | ||
_pos = (pos + hd.length | 0) + seplen | 0; | ||
continue ; | ||
} | ||
Caml_bytes.caml_blit_string(hd, 0, dst, pos, hd.length); | ||
return dst; | ||
}; | ||
} | ||
function concat(sep, l) { | ||
if (!l) { | ||
return ""; | ||
} | ||
var seplen = sep.length; | ||
return Caml_bytes.bytes_to_string(unsafe_blits(Caml_bytes.caml_create_bytes(sum_lengths(0, seplen, l)), 0, sep, seplen, l)); | ||
} | ||
function iter(f, s) { | ||
for(var i = 0 ,i_finish = s.length; i < i_finish; ++i){ | ||
Curry._1(f, s.charCodeAt(i)); | ||
Curry._1(f, s.codePointAt(i)); | ||
} | ||
} | ||
@@ -87,13 +32,12 @@ | ||
for(var i = 0 ,i_finish = s.length; i < i_finish; ++i){ | ||
Curry._2(f, i, s.charCodeAt(i)); | ||
Curry._2(f, i, s.codePointAt(i)); | ||
} | ||
} | ||
function map(f, s) { | ||
return Caml_bytes.bytes_to_string(Bytes.map(f, Caml_bytes.bytes_of_string(s))); | ||
return Bytes.unsafe_to_string(Bytes.map(f, Bytes.unsafe_of_string(s))); | ||
} | ||
function mapi(f, s) { | ||
return Caml_bytes.bytes_to_string(Bytes.mapi(f, Caml_bytes.bytes_of_string(s))); | ||
return Bytes.unsafe_to_string(Bytes.mapi(f, Bytes.unsafe_of_string(s))); | ||
} | ||
@@ -110,6 +54,6 @@ | ||
function trim(s) { | ||
if (s === "" || !(is_space(s.charCodeAt(0)) || is_space(s.charCodeAt(s.length - 1 | 0)))) { | ||
if (s === "" || !(is_space(s.codePointAt(0)) || is_space(s.codePointAt(s.length - 1 | 0)))) { | ||
return s; | ||
} else { | ||
return Caml_bytes.bytes_to_string(Bytes.trim(Caml_bytes.bytes_of_string(s))); | ||
return Bytes.unsafe_to_string(Bytes.trim(Bytes.unsafe_of_string(s))); | ||
} | ||
@@ -125,3 +69,3 @@ } | ||
} | ||
var match = s.charCodeAt(i); | ||
var match = s.codePointAt(i); | ||
if (match < 32) { | ||
@@ -145,3 +89,3 @@ return true; | ||
if (needs_escape(0)) { | ||
return Caml_bytes.bytes_to_string(Bytes.escaped(Caml_bytes.bytes_of_string(s))); | ||
return Bytes.unsafe_to_string(Bytes.escaped(Bytes.unsafe_of_string(s))); | ||
} else { | ||
@@ -161,3 +105,3 @@ return s; | ||
} | ||
if (s.charCodeAt(i) === c) { | ||
if (s.codePointAt(i) === c) { | ||
return i; | ||
@@ -180,3 +124,3 @@ } | ||
} | ||
if (s.charCodeAt(i) === c) { | ||
if (s.codePointAt(i) === c) { | ||
return i; | ||
@@ -226,3 +170,3 @@ } | ||
} | ||
if (s.charCodeAt(i) === c) { | ||
if (s.codePointAt(i) === c) { | ||
return i; | ||
@@ -256,3 +200,3 @@ } | ||
} | ||
if (s.charCodeAt(i) === c) { | ||
if (s.codePointAt(i) === c) { | ||
return i; | ||
@@ -328,19 +272,23 @@ } | ||
function uppercase_ascii(s) { | ||
return Caml_bytes.bytes_to_string(Bytes.uppercase_ascii(Caml_bytes.bytes_of_string(s))); | ||
return Bytes.unsafe_to_string(Bytes.uppercase_ascii(Bytes.unsafe_of_string(s))); | ||
} | ||
function lowercase_ascii(s) { | ||
return Caml_bytes.bytes_to_string(Bytes.lowercase_ascii(Caml_bytes.bytes_of_string(s))); | ||
return Bytes.unsafe_to_string(Bytes.lowercase_ascii(Bytes.unsafe_of_string(s))); | ||
} | ||
function capitalize_ascii(s) { | ||
return Caml_bytes.bytes_to_string(Bytes.capitalize_ascii(Caml_bytes.bytes_of_string(s))); | ||
return Bytes.unsafe_to_string(Bytes.capitalize_ascii(Bytes.unsafe_of_string(s))); | ||
} | ||
function uncapitalize_ascii(s) { | ||
return Caml_bytes.bytes_to_string(Bytes.uncapitalize_ascii(Caml_bytes.bytes_of_string(s))); | ||
return Bytes.unsafe_to_string(Bytes.uncapitalize_ascii(Bytes.unsafe_of_string(s))); | ||
} | ||
var compare = Caml.caml_string_compare; | ||
var compare = Caml.string_compare; | ||
function equal(a, b) { | ||
return a === b; | ||
} | ||
function split_on_char(sep, s) { | ||
@@ -350,3 +298,3 @@ var r = /* [] */0; | ||
for(var i = s.length - 1 | 0; i >= 0; --i){ | ||
if (s.charCodeAt(i) === sep) { | ||
if (s.codePointAt(i) === sep) { | ||
r = { | ||
@@ -366,18 +314,2 @@ hd: sub(s, i + 1 | 0, (j - i | 0) - 1 | 0), | ||
function uppercase(s) { | ||
return Caml_bytes.bytes_to_string(Bytes.uppercase(Caml_bytes.bytes_of_string(s))); | ||
} | ||
function lowercase(s) { | ||
return Caml_bytes.bytes_to_string(Bytes.lowercase(Caml_bytes.bytes_of_string(s))); | ||
} | ||
function capitalize(s) { | ||
return Caml_bytes.bytes_to_string(Bytes.capitalize(Caml_bytes.bytes_of_string(s))); | ||
} | ||
function uncapitalize(s) { | ||
return Caml_bytes.bytes_to_string(Bytes.uncapitalize(Caml_bytes.bytes_of_string(s))); | ||
} | ||
var make = Caml_string.make; | ||
@@ -387,6 +319,2 @@ | ||
function equal(prim0, prim1) { | ||
return prim0 === prim1; | ||
} | ||
export { | ||
@@ -415,6 +343,2 @@ make , | ||
rcontains_from , | ||
uppercase , | ||
lowercase , | ||
capitalize , | ||
uncapitalize , | ||
uppercase_ascii , | ||
@@ -427,4 +351,3 @@ lowercase_ascii , | ||
split_on_char , | ||
} | ||
/* No side effect */ |
import * as $$String from "./string.js"; | ||
import * as Caml from "./caml.js"; | ||
import * as Bytes from "./bytes.js"; | ||
import * as Curry from "./curry.js"; | ||
import * as Belt_List from "./belt_List.js"; | ||
import * as Caml_string from "./caml_string.js"; | ||
import * as Caml_js_exceptions from "./caml_js_exceptions.js"; | ||
var make = $$String.make; | ||
function init(n, f) { | ||
return Bytes.unsafe_to_string(Bytes.init(n, f)); | ||
} | ||
var init = $$String.init; | ||
function sub(s, ofs, len) { | ||
return Bytes.unsafe_to_string(Bytes.sub(Bytes.unsafe_of_string(s), ofs, len)); | ||
} | ||
var sub = $$String.sub; | ||
var blit = Bytes.blit_string; | ||
var blit = $$String.blit; | ||
function concat(sep, xs) { | ||
return Belt_List.toArray(xs).join(sep); | ||
} | ||
var concat = $$String.concat; | ||
function iter(f, s) { | ||
for(var i = 0 ,i_finish = s.length; i < i_finish; ++i){ | ||
Curry._1(f, s.codePointAt(i)); | ||
} | ||
} | ||
var iter = $$String.iter; | ||
function iteri(f, s) { | ||
for(var i = 0 ,i_finish = s.length; i < i_finish; ++i){ | ||
Curry._2(f, i, s.codePointAt(i)); | ||
} | ||
} | ||
var iteri = $$String.iteri; | ||
function map(f, s) { | ||
return Bytes.unsafe_to_string(Bytes.map(f, Bytes.unsafe_of_string(s))); | ||
} | ||
var map = $$String.map; | ||
function mapi(f, s) { | ||
return Bytes.unsafe_to_string(Bytes.mapi(f, Bytes.unsafe_of_string(s))); | ||
} | ||
var mapi = $$String.mapi; | ||
function is_space(param) { | ||
if (param > 13 || param < 9) { | ||
return param === 32; | ||
} else { | ||
return param !== 11; | ||
} | ||
} | ||
var trim = $$String.trim; | ||
function trim(s) { | ||
if (s === "" || !(is_space(s.codePointAt(0)) || is_space(s.codePointAt(s.length - 1 | 0)))) { | ||
return s; | ||
} else { | ||
return Bytes.unsafe_to_string(Bytes.trim(Bytes.unsafe_of_string(s))); | ||
} | ||
} | ||
var escaped = $$String.escaped; | ||
function escaped(s) { | ||
var needs_escape = function (_i) { | ||
while(true) { | ||
var i = _i; | ||
if (i >= s.length) { | ||
return false; | ||
} | ||
var match = s.codePointAt(i); | ||
if (match < 32) { | ||
return true; | ||
} | ||
if (match > 92 || match < 34) { | ||
if (match >= 127) { | ||
return true; | ||
} | ||
_i = i + 1 | 0; | ||
continue ; | ||
} | ||
if (match > 91 || match < 35) { | ||
return true; | ||
} | ||
_i = i + 1 | 0; | ||
continue ; | ||
}; | ||
}; | ||
if (needs_escape(0)) { | ||
return Bytes.unsafe_to_string(Bytes.escaped(Bytes.unsafe_of_string(s))); | ||
} else { | ||
return s; | ||
} | ||
} | ||
var index = $$String.index; | ||
function index_rec(s, lim, _i, c) { | ||
while(true) { | ||
var i = _i; | ||
if (i >= lim) { | ||
throw { | ||
RE_EXN_ID: "Not_found", | ||
Error: new Error() | ||
}; | ||
} | ||
if (s.codePointAt(i) === c) { | ||
return i; | ||
} | ||
_i = i + 1 | 0; | ||
continue ; | ||
}; | ||
} | ||
var index_opt = $$String.index_opt; | ||
function index(s, c) { | ||
return index_rec(s, s.length, 0, c); | ||
} | ||
var rindex = $$String.rindex; | ||
function index_rec_opt(s, lim, _i, c) { | ||
while(true) { | ||
var i = _i; | ||
if (i >= lim) { | ||
return ; | ||
} | ||
if (s.codePointAt(i) === c) { | ||
return i; | ||
} | ||
_i = i + 1 | 0; | ||
continue ; | ||
}; | ||
} | ||
var rindex_opt = $$String.rindex_opt; | ||
function index_opt(s, c) { | ||
return index_rec_opt(s, s.length, 0, c); | ||
} | ||
var index_from = $$String.index_from; | ||
function index_from(s, i, c) { | ||
var l = s.length; | ||
if (i < 0 || i > l) { | ||
throw { | ||
RE_EXN_ID: "Invalid_argument", | ||
_1: "String.index_from / Bytes.index_from", | ||
Error: new Error() | ||
}; | ||
} | ||
return index_rec(s, l, i, c); | ||
} | ||
var index_from_opt = $$String.index_from_opt; | ||
function index_from_opt(s, i, c) { | ||
var l = s.length; | ||
if (i < 0 || i > l) { | ||
throw { | ||
RE_EXN_ID: "Invalid_argument", | ||
_1: "String.index_from_opt / Bytes.index_from_opt", | ||
Error: new Error() | ||
}; | ||
} | ||
return index_rec_opt(s, l, i, c); | ||
} | ||
var rindex_from = $$String.rindex_from; | ||
function rindex_rec(s, _i, c) { | ||
while(true) { | ||
var i = _i; | ||
if (i < 0) { | ||
throw { | ||
RE_EXN_ID: "Not_found", | ||
Error: new Error() | ||
}; | ||
} | ||
if (s.codePointAt(i) === c) { | ||
return i; | ||
} | ||
_i = i - 1 | 0; | ||
continue ; | ||
}; | ||
} | ||
var rindex_from_opt = $$String.rindex_from_opt; | ||
function rindex(s, c) { | ||
return rindex_rec(s, s.length - 1 | 0, c); | ||
} | ||
var contains = $$String.contains; | ||
function rindex_from(s, i, c) { | ||
if (i < -1 || i >= s.length) { | ||
throw { | ||
RE_EXN_ID: "Invalid_argument", | ||
_1: "String.rindex_from / Bytes.rindex_from", | ||
Error: new Error() | ||
}; | ||
} | ||
return rindex_rec(s, i, c); | ||
} | ||
var contains_from = $$String.contains_from; | ||
function rindex_rec_opt(s, _i, c) { | ||
while(true) { | ||
var i = _i; | ||
if (i < 0) { | ||
return ; | ||
} | ||
if (s.codePointAt(i) === c) { | ||
return i; | ||
} | ||
_i = i - 1 | 0; | ||
continue ; | ||
}; | ||
} | ||
var rcontains_from = $$String.rcontains_from; | ||
function rindex_opt(s, c) { | ||
return rindex_rec_opt(s, s.length - 1 | 0, c); | ||
} | ||
var uppercase = $$String.uppercase; | ||
function rindex_from_opt(s, i, c) { | ||
if (i < -1 || i >= s.length) { | ||
throw { | ||
RE_EXN_ID: "Invalid_argument", | ||
_1: "String.rindex_from_opt / Bytes.rindex_from_opt", | ||
Error: new Error() | ||
}; | ||
} | ||
return rindex_rec_opt(s, i, c); | ||
} | ||
var lowercase = $$String.lowercase; | ||
function contains_from(s, i, c) { | ||
var l = s.length; | ||
if (i < 0 || i > l) { | ||
throw { | ||
RE_EXN_ID: "Invalid_argument", | ||
_1: "String.contains_from / Bytes.contains_from", | ||
Error: new Error() | ||
}; | ||
} | ||
try { | ||
index_rec(s, l, i, c); | ||
return true; | ||
} | ||
catch (raw_exn){ | ||
var exn = Caml_js_exceptions.internalToOCamlException(raw_exn); | ||
if (exn.RE_EXN_ID === "Not_found") { | ||
return false; | ||
} | ||
throw exn; | ||
} | ||
} | ||
var capitalize = $$String.capitalize; | ||
function contains(s, c) { | ||
return contains_from(s, 0, c); | ||
} | ||
var uncapitalize = $$String.uncapitalize; | ||
function rcontains_from(s, i, c) { | ||
if (i < 0 || i >= s.length) { | ||
throw { | ||
RE_EXN_ID: "Invalid_argument", | ||
_1: "String.rcontains_from / Bytes.rcontains_from", | ||
Error: new Error() | ||
}; | ||
} | ||
try { | ||
rindex_rec(s, i, c); | ||
return true; | ||
} | ||
catch (raw_exn){ | ||
var exn = Caml_js_exceptions.internalToOCamlException(raw_exn); | ||
if (exn.RE_EXN_ID === "Not_found") { | ||
return false; | ||
} | ||
throw exn; | ||
} | ||
} | ||
var uppercase_ascii = $$String.uppercase_ascii; | ||
function uppercase_ascii(s) { | ||
return Bytes.unsafe_to_string(Bytes.uppercase_ascii(Bytes.unsafe_of_string(s))); | ||
} | ||
var lowercase_ascii = $$String.lowercase_ascii; | ||
function lowercase_ascii(s) { | ||
return Bytes.unsafe_to_string(Bytes.lowercase_ascii(Bytes.unsafe_of_string(s))); | ||
} | ||
var capitalize_ascii = $$String.capitalize_ascii; | ||
function capitalize_ascii(s) { | ||
return Bytes.unsafe_to_string(Bytes.capitalize_ascii(Bytes.unsafe_of_string(s))); | ||
} | ||
var uncapitalize_ascii = $$String.uncapitalize_ascii; | ||
function uncapitalize_ascii(s) { | ||
return Bytes.unsafe_to_string(Bytes.uncapitalize_ascii(Bytes.unsafe_of_string(s))); | ||
} | ||
var compare = $$String.compare; | ||
var compare = Caml.string_compare; | ||
var equal = $$String.equal; | ||
function equal(a, b) { | ||
return a === b; | ||
} | ||
var split_on_char = $$String.split_on_char; | ||
function split_on_char(sep, s) { | ||
var r = /* [] */0; | ||
var j = s.length; | ||
for(var i = s.length - 1 | 0; i >= 0; --i){ | ||
if (s.codePointAt(i) === sep) { | ||
r = { | ||
hd: sub(s, i + 1 | 0, (j - i | 0) - 1 | 0), | ||
tl: r | ||
}; | ||
j = i; | ||
} | ||
} | ||
return { | ||
hd: sub(s, 0, j), | ||
tl: r | ||
}; | ||
} | ||
var make = Caml_string.make; | ||
export { | ||
@@ -94,6 +329,2 @@ make , | ||
rcontains_from , | ||
uppercase , | ||
lowercase , | ||
capitalize , | ||
uncapitalize , | ||
uppercase_ascii , | ||
@@ -106,4 +337,3 @@ lowercase_ascii , | ||
split_on_char , | ||
} | ||
/* No side effect */ |
@@ -6,3 +6,3 @@ | ||
var match = Caml_sys.caml_sys_get_argv(undefined); | ||
var match = Caml_sys.sys_get_argv(undefined); | ||
@@ -29,2 +29,6 @@ var os_type = Caml_sys.os_type(undefined); | ||
function command(param) { | ||
return 127; | ||
} | ||
var interactive = { | ||
@@ -34,2 +38,6 @@ contents: false | ||
function signal(param, param$1) { | ||
return /* Signal_default */0; | ||
} | ||
function set_signal(sig_num, sig_beh) { | ||
@@ -129,2 +137,3 @@ | ||
getenv_opt , | ||
command , | ||
interactive , | ||
@@ -141,2 +150,3 @@ os_type , | ||
max_array_length , | ||
signal , | ||
set_signal , | ||
@@ -176,4 +186,3 @@ sigabrt , | ||
runtime_warnings_enabled , | ||
} | ||
/* No side effect */ |
@@ -7,7 +7,7 @@ | ||
function err_not_sv(i) { | ||
return Caml_format.caml_format_int("%X", i) + " is not an Unicode scalar value"; | ||
return Caml_format.format_int("%X", i) + " is not an Unicode scalar value"; | ||
} | ||
function err_not_latin1(u) { | ||
return "U+" + (Caml_format.caml_format_int("%04X", u) + " is not a latin1 character"); | ||
return "U+" + (Caml_format.format_int("%04X", u) + " is not a latin1 character"); | ||
} | ||
@@ -93,3 +93,3 @@ | ||
var compare = Caml.caml_int_compare; | ||
var compare = Caml.int_compare; | ||
@@ -134,4 +134,3 @@ function hash(prim) { | ||
hash , | ||
} | ||
/* No side effect */ |
@@ -29,3 +29,3 @@ 'use strict'; | ||
var match = l.hd; | ||
if (Caml_obj.caml_equal(match[0], x)) { | ||
if (Caml_obj.equal(match[0], x)) { | ||
return match[1]; | ||
@@ -125,15 +125,15 @@ } | ||
$$Buffer.add_string(buf, "" + errmsg + "\n"); | ||
return List.iter((function (param) { | ||
var doc = param[2]; | ||
if (doc.length === 0) { | ||
return ; | ||
} | ||
var spec = param[1]; | ||
var key = param[0]; | ||
if (spec.TAG !== /* Symbol */11) { | ||
return $$Buffer.add_string(buf, " " + key + " " + doc + "\n"); | ||
} | ||
var sym = make_symlist("{", "|", "}", spec._0); | ||
return $$Buffer.add_string(buf, " " + key + " " + sym + doc + "\n"); | ||
}), add_help(speclist)); | ||
List.iter((function (param) { | ||
var doc = param[2]; | ||
if (doc.length === 0) { | ||
return ; | ||
} | ||
var spec = param[1]; | ||
var key = param[0]; | ||
if (spec.TAG !== /* Symbol */11) { | ||
return $$Buffer.add_string(buf, " " + key + " " + doc + "\n"); | ||
} | ||
var sym = make_symlist("{", "|", "}", spec._0); | ||
return $$Buffer.add_string(buf, " " + key + " " + sym + doc + "\n"); | ||
}), add_help(speclist)); | ||
} | ||
@@ -149,3 +149,2 @@ | ||
console.log(usage_string(speclist, errmsg)); | ||
} | ||
@@ -172,3 +171,3 @@ | ||
try { | ||
return Caml_format.caml_int_of_string(x); | ||
return Caml_format.int_of_string(x); | ||
} | ||
@@ -186,3 +185,3 @@ catch (raw_exn){ | ||
try { | ||
return Caml_format.caml_float_of_string(x); | ||
return Caml_format.float_of_string(x); | ||
} | ||
@@ -226,6 +225,6 @@ catch (raw_exn){ | ||
usage_b(b, speclist.contents, errmsg); | ||
if (Caml_obj.caml_equal(error, { | ||
if (Caml_obj.equal(error, { | ||
TAG: /* Unknown */0, | ||
_0: "-help" | ||
}) || Caml_obj.caml_equal(error, { | ||
}) || Caml_obj.equal(error, { | ||
TAG: /* Unknown */0, | ||
@@ -515,7 +514,6 @@ _0: "--help" | ||
}; | ||
} | ||
function parse_and_expand_argv_dynamic(current, argv, speclist, anonfun, errmsg) { | ||
return parse_and_expand_argv_dynamic_aux(true, current, argv, speclist, anonfun, errmsg); | ||
parse_and_expand_argv_dynamic_aux(true, current, argv, speclist, anonfun, errmsg); | ||
} | ||
@@ -525,5 +523,5 @@ | ||
var current$1 = currentOpt !== undefined ? currentOpt : current; | ||
return parse_and_expand_argv_dynamic_aux(false, current$1, { | ||
contents: argv | ||
}, speclist, anonfun, errmsg); | ||
parse_and_expand_argv_dynamic_aux(false, current$1, { | ||
contents: argv | ||
}, speclist, anonfun, errmsg); | ||
} | ||
@@ -533,5 +531,5 @@ | ||
var current$1 = currentOpt !== undefined ? currentOpt : current; | ||
return parse_argv_dynamic(current$1, argv, { | ||
contents: speclist | ||
}, anonfun, errmsg); | ||
parse_argv_dynamic(current$1, argv, { | ||
contents: speclist | ||
}, anonfun, errmsg); | ||
} | ||
@@ -651,5 +649,5 @@ | ||
if (param[1].TAG === /* Symbol */11) { | ||
return Caml.caml_int_max(cur, kwd.length); | ||
return Caml.int_max(cur, kwd.length); | ||
} else { | ||
return Caml.caml_int_max(cur, kwd.length + second_word(param[2]) | 0); | ||
return Caml.int_max(cur, kwd.length + second_word(param[2]) | 0); | ||
} | ||
@@ -686,3 +684,3 @@ } | ||
var cutcol = second_word(msg); | ||
var spaces = " ".repeat(Caml.caml_int_max(0, len$1 - cutcol | 0) + 3 | 0); | ||
var spaces = " ".repeat(Caml.int_max(0, len$1 - cutcol | 0) + 3 | 0); | ||
return [ | ||
@@ -689,0 +687,0 @@ kwd, |
@@ -81,3 +81,2 @@ 'use strict'; | ||
} | ||
} | ||
@@ -93,3 +92,3 @@ | ||
} | ||
return Caml_array.blit(a1, ofs1, a2, ofs2, len); | ||
Caml_array.blit(a1, ofs1, a2, ofs2, len); | ||
} | ||
@@ -101,3 +100,2 @@ | ||
} | ||
} | ||
@@ -116,3 +114,2 @@ | ||
} | ||
} | ||
@@ -156,3 +153,2 @@ | ||
} | ||
} | ||
@@ -279,3 +275,3 @@ | ||
} | ||
if (Caml_obj.caml_equal(a[i], x)) { | ||
if (Caml_obj.equal(a[i], x)) { | ||
return true; | ||
@@ -381,3 +377,3 @@ } | ||
"array.ml", | ||
238, | ||
236, | ||
4 | ||
@@ -413,3 +409,3 @@ ], | ||
Caml_array.set(a, 1, Caml_array.get(a, 0)); | ||
return Caml_array.set(a, 0, e$1); | ||
Caml_array.set(a, 0, e$1); | ||
} | ||
@@ -464,3 +460,2 @@ | ||
} | ||
}; | ||
@@ -475,3 +470,3 @@ var sortto = function (srcofs, dst, dstofs, len) { | ||
sortto(srcofs, a, srcofs + l2 | 0, l1); | ||
return merge(srcofs + l2 | 0, l1, dst, dstofs + l1 | 0, l2, dst, dstofs); | ||
merge(srcofs + l2 | 0, l1, dst, dstofs + l1 | 0, l2, dst, dstofs); | ||
}; | ||
@@ -487,3 +482,3 @@ var l = a.length; | ||
sortto(0, a, l2, l1); | ||
return merge(l2, l1, t, 0, l2, a, 0); | ||
merge(l2, l1, t, 0, l2, a, 0); | ||
} | ||
@@ -490,0 +485,0 @@ |
'use strict'; | ||
var $$Array = require("./array.js"); | ||
var Curry = require("./curry.js"); | ||
var Caml_obj = require("./caml_obj.js"); | ||
var Caml_array = require("./caml_array.js"); | ||
var Caml_exceptions = require("./caml_exceptions.js"); | ||
var Caml_js_exceptions = require("./caml_js_exceptions.js"); | ||
var init = $$Array.init; | ||
var make_float = Caml_array.make_float; | ||
var make_matrix = $$Array.make_matrix; | ||
var Floatarray = {}; | ||
var create_matrix = $$Array.create_matrix; | ||
function init(l, f) { | ||
if (l === 0) { | ||
return []; | ||
} | ||
if (l < 0) { | ||
throw { | ||
RE_EXN_ID: "Invalid_argument", | ||
_1: "Array.init", | ||
Error: new Error() | ||
}; | ||
} | ||
var res = Caml_array.make(l, Curry._1(f, 0)); | ||
for(var i = 1; i < l; ++i){ | ||
res[i] = Curry._1(f, i); | ||
} | ||
return res; | ||
} | ||
var append = $$Array.append; | ||
function make_matrix(sx, sy, init) { | ||
var res = Caml_array.make(sx, []); | ||
for(var x = 0; x < sx; ++x){ | ||
res[x] = Caml_array.make(sy, init); | ||
} | ||
return res; | ||
} | ||
var concat = $$Array.concat; | ||
function copy(a) { | ||
var l = a.length; | ||
if (l === 0) { | ||
return []; | ||
} else { | ||
return Caml_array.sub(a, 0, l); | ||
} | ||
} | ||
var sub = $$Array.sub; | ||
function append(a1, a2) { | ||
var l1 = a1.length; | ||
if (l1 === 0) { | ||
return copy(a2); | ||
} else if (a2.length === 0) { | ||
return Caml_array.sub(a1, 0, l1); | ||
} else { | ||
return a1.concat(a2); | ||
} | ||
} | ||
var copy = $$Array.copy; | ||
function sub(a, ofs, len) { | ||
if (ofs < 0 || len < 0 || ofs > (a.length - len | 0)) { | ||
throw { | ||
RE_EXN_ID: "Invalid_argument", | ||
_1: "Array.sub", | ||
Error: new Error() | ||
}; | ||
} | ||
return Caml_array.sub(a, ofs, len); | ||
} | ||
var fill = $$Array.fill; | ||
function fill(a, ofs, len, v) { | ||
if (ofs < 0 || len < 0 || ofs > (a.length - len | 0)) { | ||
throw { | ||
RE_EXN_ID: "Invalid_argument", | ||
_1: "Array.fill", | ||
Error: new Error() | ||
}; | ||
} | ||
for(var i = ofs ,i_finish = ofs + len | 0; i < i_finish; ++i){ | ||
a[i] = v; | ||
} | ||
} | ||
var blit = $$Array.blit; | ||
function blit(a1, ofs1, a2, ofs2, len) { | ||
if (len < 0 || ofs1 < 0 || ofs1 > (a1.length - len | 0) || ofs2 < 0 || ofs2 > (a2.length - len | 0)) { | ||
throw { | ||
RE_EXN_ID: "Invalid_argument", | ||
_1: "Array.blit", | ||
Error: new Error() | ||
}; | ||
} | ||
Caml_array.blit(a1, ofs1, a2, ofs2, len); | ||
} | ||
var to_list = $$Array.to_list; | ||
function iter(f, a) { | ||
for(var i = 0 ,i_finish = a.length; i < i_finish; ++i){ | ||
Curry._1(f, a[i]); | ||
} | ||
} | ||
var of_list = $$Array.of_list; | ||
function iter2(f, a, b) { | ||
if (a.length !== b.length) { | ||
throw { | ||
RE_EXN_ID: "Invalid_argument", | ||
_1: "Array.iter2: arrays must have the same length", | ||
Error: new Error() | ||
}; | ||
} | ||
for(var i = 0 ,i_finish = a.length; i < i_finish; ++i){ | ||
Curry._2(f, a[i], b[i]); | ||
} | ||
} | ||
var iter = $$Array.iter; | ||
function map(f, a) { | ||
var l = a.length; | ||
if (l === 0) { | ||
return []; | ||
} | ||
var r = Caml_array.make(l, Curry._1(f, a[0])); | ||
for(var i = 1; i < l; ++i){ | ||
r[i] = Curry._1(f, a[i]); | ||
} | ||
return r; | ||
} | ||
var map = $$Array.map; | ||
function map2(f, a, b) { | ||
var la = a.length; | ||
var lb = b.length; | ||
if (la !== lb) { | ||
throw { | ||
RE_EXN_ID: "Invalid_argument", | ||
_1: "Array.map2: arrays must have the same length", | ||
Error: new Error() | ||
}; | ||
} | ||
if (la === 0) { | ||
return []; | ||
} | ||
var r = Caml_array.make(la, Curry._2(f, a[0], b[0])); | ||
for(var i = 1; i < la; ++i){ | ||
r[i] = Curry._2(f, a[i], b[i]); | ||
} | ||
return r; | ||
} | ||
var iteri = $$Array.iteri; | ||
function iteri(f, a) { | ||
for(var i = 0 ,i_finish = a.length; i < i_finish; ++i){ | ||
Curry._2(f, i, a[i]); | ||
} | ||
} | ||
var mapi = $$Array.mapi; | ||
function mapi(f, a) { | ||
var l = a.length; | ||
if (l === 0) { | ||
return []; | ||
} | ||
var r = Caml_array.make(l, Curry._2(f, 0, a[0])); | ||
for(var i = 1; i < l; ++i){ | ||
r[i] = Curry._2(f, i, a[i]); | ||
} | ||
return r; | ||
} | ||
var fold_left = $$Array.fold_left; | ||
function to_list(a) { | ||
var _i = a.length - 1 | 0; | ||
var _res = /* [] */0; | ||
while(true) { | ||
var res = _res; | ||
var i = _i; | ||
if (i < 0) { | ||
return res; | ||
} | ||
_res = { | ||
hd: a[i], | ||
tl: res | ||
}; | ||
_i = i - 1 | 0; | ||
continue ; | ||
}; | ||
} | ||
var fold_right = $$Array.fold_right; | ||
function list_length(_accu, _param) { | ||
while(true) { | ||
var param = _param; | ||
var accu = _accu; | ||
if (!param) { | ||
return accu; | ||
} | ||
_param = param.tl; | ||
_accu = accu + 1 | 0; | ||
continue ; | ||
}; | ||
} | ||
var iter2 = $$Array.iter2; | ||
function of_list(l) { | ||
if (!l) { | ||
return []; | ||
} | ||
var a = Caml_array.make(list_length(0, l), l.hd); | ||
var _i = 1; | ||
var _param = l.tl; | ||
while(true) { | ||
var param = _param; | ||
var i = _i; | ||
if (!param) { | ||
return a; | ||
} | ||
a[i] = param.hd; | ||
_param = param.tl; | ||
_i = i + 1 | 0; | ||
continue ; | ||
}; | ||
} | ||
var map2 = $$Array.map2; | ||
function fold_left(f, x, a) { | ||
var r = x; | ||
for(var i = 0 ,i_finish = a.length; i < i_finish; ++i){ | ||
r = Curry._2(f, r, a[i]); | ||
} | ||
return r; | ||
} | ||
var exists = $$Array.exists; | ||
function fold_right(f, a, x) { | ||
var r = x; | ||
for(var i = a.length - 1 | 0; i >= 0; --i){ | ||
r = Curry._2(f, a[i], r); | ||
} | ||
return r; | ||
} | ||
var for_all = $$Array.for_all; | ||
function exists(p, a) { | ||
var n = a.length; | ||
var _i = 0; | ||
while(true) { | ||
var i = _i; | ||
if (i === n) { | ||
return false; | ||
} | ||
if (Curry._1(p, a[i])) { | ||
return true; | ||
} | ||
_i = i + 1 | 0; | ||
continue ; | ||
}; | ||
} | ||
var mem = $$Array.mem; | ||
function for_all(p, a) { | ||
var n = a.length; | ||
var _i = 0; | ||
while(true) { | ||
var i = _i; | ||
if (i === n) { | ||
return true; | ||
} | ||
if (!Curry._1(p, a[i])) { | ||
return false; | ||
} | ||
_i = i + 1 | 0; | ||
continue ; | ||
}; | ||
} | ||
var memq = $$Array.memq; | ||
function mem(x, a) { | ||
var n = a.length; | ||
var _i = 0; | ||
while(true) { | ||
var i = _i; | ||
if (i === n) { | ||
return false; | ||
} | ||
if (Caml_obj.equal(a[i], x)) { | ||
return true; | ||
} | ||
_i = i + 1 | 0; | ||
continue ; | ||
}; | ||
} | ||
var make_float = $$Array.make_float; | ||
function memq(x, a) { | ||
var n = a.length; | ||
var _i = 0; | ||
while(true) { | ||
var i = _i; | ||
if (i === n) { | ||
return false; | ||
} | ||
if (x === a[i]) { | ||
return true; | ||
} | ||
_i = i + 1 | 0; | ||
continue ; | ||
}; | ||
} | ||
var sort = $$Array.sort; | ||
var Bottom = /* @__PURE__ */Caml_exceptions.create("ArrayLabels.Bottom"); | ||
var stable_sort = $$Array.stable_sort; | ||
function sort(cmp, a) { | ||
var maxson = function (l, i) { | ||
var i31 = ((i + i | 0) + i | 0) + 1 | 0; | ||
var x = i31; | ||
if ((i31 + 2 | 0) < l) { | ||
if (Curry._2(cmp, Caml_array.get(a, i31), Caml_array.get(a, i31 + 1 | 0)) < 0) { | ||
x = i31 + 1 | 0; | ||
} | ||
if (Curry._2(cmp, Caml_array.get(a, x), Caml_array.get(a, i31 + 2 | 0)) < 0) { | ||
x = i31 + 2 | 0; | ||
} | ||
return x; | ||
} | ||
if ((i31 + 1 | 0) < l && Curry._2(cmp, Caml_array.get(a, i31), Caml_array.get(a, i31 + 1 | 0)) < 0) { | ||
return i31 + 1 | 0; | ||
} | ||
if (i31 < l) { | ||
return i31; | ||
} | ||
throw { | ||
RE_EXN_ID: Bottom, | ||
_1: i, | ||
Error: new Error() | ||
}; | ||
}; | ||
var trickle = function (l, i, e) { | ||
try { | ||
var _i = i; | ||
while(true) { | ||
var i$1 = _i; | ||
var j = maxson(l, i$1); | ||
if (Curry._2(cmp, Caml_array.get(a, j), e) <= 0) { | ||
return Caml_array.set(a, i$1, e); | ||
} | ||
Caml_array.set(a, i$1, Caml_array.get(a, j)); | ||
_i = j; | ||
continue ; | ||
}; | ||
} | ||
catch (raw_i){ | ||
var i$2 = Caml_js_exceptions.internalToOCamlException(raw_i); | ||
if (i$2.RE_EXN_ID === Bottom) { | ||
return Caml_array.set(a, i$2._1, e); | ||
} | ||
throw i$2; | ||
} | ||
}; | ||
var bubble = function (l, i) { | ||
try { | ||
var _i = i; | ||
while(true) { | ||
var i$1 = _i; | ||
var j = maxson(l, i$1); | ||
Caml_array.set(a, i$1, Caml_array.get(a, j)); | ||
_i = j; | ||
continue ; | ||
}; | ||
} | ||
catch (raw_i){ | ||
var i$2 = Caml_js_exceptions.internalToOCamlException(raw_i); | ||
if (i$2.RE_EXN_ID === Bottom) { | ||
return i$2._1; | ||
} | ||
throw i$2; | ||
} | ||
}; | ||
var trickleup = function (_i, e) { | ||
while(true) { | ||
var i = _i; | ||
var father = (i - 1 | 0) / 3 | 0; | ||
if (i === father) { | ||
throw { | ||
RE_EXN_ID: "Assert_failure", | ||
_1: [ | ||
"arrayLabels.ml", | ||
236, | ||
4 | ||
], | ||
Error: new Error() | ||
}; | ||
} | ||
if (Curry._2(cmp, Caml_array.get(a, father), e) >= 0) { | ||
return Caml_array.set(a, i, e); | ||
} | ||
Caml_array.set(a, i, Caml_array.get(a, father)); | ||
if (father <= 0) { | ||
return Caml_array.set(a, 0, e); | ||
} | ||
_i = father; | ||
continue ; | ||
}; | ||
}; | ||
var l = a.length; | ||
for(var i = ((l + 1 | 0) / 3 | 0) - 1 | 0; i >= 0; --i){ | ||
trickle(l, i, Caml_array.get(a, i)); | ||
} | ||
for(var i$1 = l - 1 | 0; i$1 >= 2; --i$1){ | ||
var e = Caml_array.get(a, i$1); | ||
Caml_array.set(a, i$1, Caml_array.get(a, 0)); | ||
trickleup(bubble(i$1, 0), e); | ||
} | ||
if (l <= 1) { | ||
return ; | ||
} | ||
var e$1 = Caml_array.get(a, 1); | ||
Caml_array.set(a, 1, Caml_array.get(a, 0)); | ||
Caml_array.set(a, 0, e$1); | ||
} | ||
var fast_sort = $$Array.fast_sort; | ||
function stable_sort(cmp, a) { | ||
var merge = function (src1ofs, src1len, src2, src2ofs, src2len, dst, dstofs) { | ||
var src1r = src1ofs + src1len | 0; | ||
var src2r = src2ofs + src2len | 0; | ||
var _i1 = src1ofs; | ||
var _s1 = Caml_array.get(a, src1ofs); | ||
var _i2 = src2ofs; | ||
var _s2 = Caml_array.get(src2, src2ofs); | ||
var _d = dstofs; | ||
while(true) { | ||
var d = _d; | ||
var s2 = _s2; | ||
var i2 = _i2; | ||
var s1 = _s1; | ||
var i1 = _i1; | ||
if (Curry._2(cmp, s1, s2) <= 0) { | ||
Caml_array.set(dst, d, s1); | ||
var i1$1 = i1 + 1 | 0; | ||
if (i1$1 >= src1r) { | ||
return blit(src2, i2, dst, d + 1 | 0, src2r - i2 | 0); | ||
} | ||
_d = d + 1 | 0; | ||
_s1 = Caml_array.get(a, i1$1); | ||
_i1 = i1$1; | ||
continue ; | ||
} | ||
Caml_array.set(dst, d, s2); | ||
var i2$1 = i2 + 1 | 0; | ||
if (i2$1 >= src2r) { | ||
return blit(a, i1, dst, d + 1 | 0, src1r - i1 | 0); | ||
} | ||
_d = d + 1 | 0; | ||
_s2 = Caml_array.get(src2, i2$1); | ||
_i2 = i2$1; | ||
continue ; | ||
}; | ||
}; | ||
var isortto = function (srcofs, dst, dstofs, len) { | ||
for(var i = 0; i < len; ++i){ | ||
var e = Caml_array.get(a, srcofs + i | 0); | ||
var j = (dstofs + i | 0) - 1 | 0; | ||
while(j >= dstofs && Curry._2(cmp, Caml_array.get(dst, j), e) > 0) { | ||
Caml_array.set(dst, j + 1 | 0, Caml_array.get(dst, j)); | ||
j = j - 1 | 0; | ||
}; | ||
Caml_array.set(dst, j + 1 | 0, e); | ||
} | ||
}; | ||
var sortto = function (srcofs, dst, dstofs, len) { | ||
if (len <= 5) { | ||
return isortto(srcofs, dst, dstofs, len); | ||
} | ||
var l1 = len / 2 | 0; | ||
var l2 = len - l1 | 0; | ||
sortto(srcofs + l1 | 0, dst, dstofs + l1 | 0, l2); | ||
sortto(srcofs, a, srcofs + l2 | 0, l1); | ||
merge(srcofs + l2 | 0, l1, dst, dstofs + l1 | 0, l2, dst, dstofs); | ||
}; | ||
var l = a.length; | ||
if (l <= 5) { | ||
return isortto(0, a, 0, l); | ||
} | ||
var l1 = l / 2 | 0; | ||
var l2 = l - l1 | 0; | ||
var t = Caml_array.make(l2, Caml_array.get(a, 0)); | ||
sortto(l1, t, 0, l2); | ||
sortto(0, a, l2, l1); | ||
merge(l2, l1, t, 0, l2, a, 0); | ||
} | ||
var Floatarray = $$Array.Floatarray; | ||
var create_matrix = make_matrix; | ||
var concat = Caml_array.concat; | ||
var fast_sort = stable_sort; | ||
exports.init = init; | ||
@@ -62,0 +482,0 @@ exports.make_matrix = make_matrix; |
@@ -21,4 +21,4 @@ 'use strict'; | ||
"belt_Array.ml", | ||
27, | ||
4 | ||
35, | ||
2 | ||
], | ||
@@ -46,3 +46,3 @@ Error: new Error() | ||
"belt_Array.ml", | ||
33, | ||
45, | ||
2 | ||
@@ -54,3 +54,2 @@ ], | ||
arr[i] = v; | ||
} | ||
@@ -62,3 +61,2 @@ | ||
xs[j] = tmp; | ||
} | ||
@@ -71,3 +69,2 @@ | ||
} | ||
} | ||
@@ -87,3 +84,2 @@ | ||
} | ||
} | ||
@@ -228,3 +224,3 @@ | ||
var lena = a.length; | ||
var ofs = offset < 0 ? Caml.caml_int_max(lena + offset | 0, 0) : offset; | ||
var ofs = offset < 0 ? Caml.int_max(lena + offset | 0, 0) : offset; | ||
var hasLen = lena - ofs | 0; | ||
@@ -244,4 +240,4 @@ var copyLength = hasLen < len ? hasLen : len; | ||
var lena = a.length; | ||
var ofs = offset < 0 ? Caml.caml_int_max(lena + offset | 0, 0) : offset; | ||
var len = lena - ofs | 0; | ||
var ofs = offset < 0 ? Caml.int_max(lena + offset | 0, 0) : offset; | ||
var len = lena > ofs ? lena - ofs | 0 : 0; | ||
var result = new Array(len); | ||
@@ -259,3 +255,3 @@ for(var i = 0; i < len; ++i){ | ||
var lena = a.length; | ||
var ofs = offset < 0 ? Caml.caml_int_max(lena + offset | 0, 0) : offset; | ||
var ofs = offset < 0 ? Caml.int_max(lena + offset | 0, 0) : offset; | ||
var hasLen = lena - ofs | 0; | ||
@@ -269,3 +265,2 @@ var fillLength = hasLen < len ? hasLen : len; | ||
} | ||
} | ||
@@ -283,3 +278,2 @@ | ||
} | ||
} | ||
@@ -290,5 +284,5 @@ | ||
var lena2 = a2.length; | ||
var srcofs1 = ofs1 < 0 ? Caml.caml_int_max(lena1 + ofs1 | 0, 0) : ofs1; | ||
var srcofs2 = ofs2 < 0 ? Caml.caml_int_max(lena2 + ofs2 | 0, 0) : ofs2; | ||
var blitLength = Caml.caml_int_min(len, Caml.caml_int_min(lena1 - srcofs1 | 0, lena2 - srcofs2 | 0)); | ||
var srcofs1 = ofs1 < 0 ? Caml.int_max(lena1 + ofs1 | 0, 0) : ofs1; | ||
var srcofs2 = ofs2 < 0 ? Caml.int_max(lena2 + ofs2 | 0, 0) : ofs2; | ||
var blitLength = Caml.int_min(len, Caml.int_min(lena1 - srcofs1 | 0, lena2 - srcofs2 | 0)); | ||
if (srcofs2 <= srcofs1) { | ||
@@ -303,3 +297,2 @@ for(var j = 0; j < blitLength; ++j){ | ||
} | ||
} | ||
@@ -311,7 +304,6 @@ | ||
} | ||
} | ||
function forEach(a, f) { | ||
return forEachU(a, Curry.__1(f)); | ||
forEachU(a, Curry.__1(f)); | ||
} | ||
@@ -332,2 +324,10 @@ | ||
function flatMapU(a, f) { | ||
return concatMany(mapU(a, f)); | ||
} | ||
function flatMap(a, f) { | ||
return concatMany(mapU(a, Curry.__1(f))); | ||
} | ||
function getByU(a, p) { | ||
@@ -434,7 +434,6 @@ var l = a.length; | ||
} | ||
} | ||
function forEachWithIndex(a, f) { | ||
return forEachWithIndexU(a, Curry.__2(f)); | ||
forEachWithIndexU(a, Curry.__2(f)); | ||
} | ||
@@ -481,3 +480,3 @@ | ||
var r = x; | ||
var len = Caml.caml_int_min(a.length, b.length); | ||
var len = Caml.int_min(a.length, b.length); | ||
for(var i = len - 1 | 0; i >= 0; --i){ | ||
@@ -560,3 +559,3 @@ r = f(r, a[i], b[i]); | ||
function every2U(a, b, p) { | ||
return everyAux2(a, b, 0, p, Caml.caml_int_min(a.length, b.length)); | ||
return everyAux2(a, b, 0, p, Caml.int_min(a.length, b.length)); | ||
} | ||
@@ -570,3 +569,3 @@ | ||
var _i = 0; | ||
var len = Caml.caml_int_min(a.length, b.length); | ||
var len = Caml.int_min(a.length, b.length); | ||
while(true) { | ||
@@ -698,2 +697,14 @@ var i = _i; | ||
function initU(n, f) { | ||
var v = new Array(n); | ||
for(var i = 0; i < n; ++i){ | ||
v[i] = f(i); | ||
} | ||
return v; | ||
} | ||
function init(n, f) { | ||
return initU(n, Curry.__1(f)); | ||
} | ||
exports.get = get; | ||
@@ -729,2 +740,4 @@ exports.getExn = getExn; | ||
exports.map = map; | ||
exports.flatMapU = flatMapU; | ||
exports.flatMap = flatMap; | ||
exports.getByU = getByU; | ||
@@ -768,2 +781,4 @@ exports.getBy = getBy; | ||
exports.eq = eq; | ||
exports.initU = initU; | ||
exports.init = init; | ||
/* No side effect */ |
@@ -95,3 +95,3 @@ 'use strict'; | ||
function set(h, key, value) { | ||
return set0(h, key, value, h.eq, h.hash); | ||
set0(h, key, value, h.eq, h.hash); | ||
} | ||
@@ -221,3 +221,2 @@ | ||
} | ||
} | ||
@@ -224,0 +223,0 @@ |
@@ -14,3 +14,3 @@ 'use strict'; | ||
} | ||
var nidx = Caml_hash_primitive.caml_hash_final_mix(Caml_hash_primitive.caml_hash_mix_int(0, old_bucket.key)) & (h_buckets.length - 1 | 0); | ||
var nidx = Caml_hash_primitive.hash_final_mix(Caml_hash_primitive.hash_mix_int(0, old_bucket.key)) & (h_buckets.length - 1 | 0); | ||
var tail = ndata_tail[nidx]; | ||
@@ -47,3 +47,3 @@ if (tail !== undefined) { | ||
var buckets_len = h_buckets.length; | ||
var i = Caml_hash_primitive.caml_hash_final_mix(Caml_hash_primitive.caml_hash_mix_int(0, key)) & (buckets_len - 1 | 0); | ||
var i = Caml_hash_primitive.hash_final_mix(Caml_hash_primitive.hash_mix_int(0, key)) & (buckets_len - 1 | 0); | ||
var l = h_buckets[i]; | ||
@@ -95,3 +95,3 @@ if (l !== undefined) { | ||
var h_buckets = h.buckets; | ||
var i = Caml_hash_primitive.caml_hash_final_mix(Caml_hash_primitive.caml_hash_mix_int(0, key)) & (h_buckets.length - 1 | 0); | ||
var i = Caml_hash_primitive.hash_final_mix(Caml_hash_primitive.hash_mix_int(0, key)) & (h_buckets.length - 1 | 0); | ||
var bucket = h_buckets[i]; | ||
@@ -129,3 +129,3 @@ if (bucket !== undefined) { | ||
var h_buckets = h.buckets; | ||
var nid = Caml_hash_primitive.caml_hash_final_mix(Caml_hash_primitive.caml_hash_mix_int(0, key)) & (h_buckets.length - 1 | 0); | ||
var nid = Caml_hash_primitive.hash_final_mix(Caml_hash_primitive.hash_mix_int(0, key)) & (h_buckets.length - 1 | 0); | ||
var cell1 = h_buckets[nid]; | ||
@@ -169,3 +169,3 @@ if (cell1 === undefined) { | ||
var h_buckets = h.buckets; | ||
var nid = Caml_hash_primitive.caml_hash_final_mix(Caml_hash_primitive.caml_hash_mix_int(0, key)) & (h_buckets.length - 1 | 0); | ||
var nid = Caml_hash_primitive.hash_final_mix(Caml_hash_primitive.hash_mix_int(0, key)) & (h_buckets.length - 1 | 0); | ||
var bucket = h_buckets[nid]; | ||
@@ -215,3 +215,2 @@ if (bucket !== undefined) { | ||
} | ||
} | ||
@@ -218,0 +217,0 @@ |
@@ -14,3 +14,3 @@ 'use strict'; | ||
} | ||
var nidx = Caml_hash_primitive.caml_hash_final_mix(Caml_hash_primitive.caml_hash_mix_string(0, old_bucket.key)) & (h_buckets.length - 1 | 0); | ||
var nidx = Caml_hash_primitive.hash_final_mix(Caml_hash_primitive.hash_mix_string(0, old_bucket.key)) & (h_buckets.length - 1 | 0); | ||
var tail = ndata_tail[nidx]; | ||
@@ -47,3 +47,3 @@ if (tail !== undefined) { | ||
var buckets_len = h_buckets.length; | ||
var i = Caml_hash_primitive.caml_hash_final_mix(Caml_hash_primitive.caml_hash_mix_string(0, key)) & (buckets_len - 1 | 0); | ||
var i = Caml_hash_primitive.hash_final_mix(Caml_hash_primitive.hash_mix_string(0, key)) & (buckets_len - 1 | 0); | ||
var l = h_buckets[i]; | ||
@@ -95,3 +95,3 @@ if (l !== undefined) { | ||
var h_buckets = h.buckets; | ||
var i = Caml_hash_primitive.caml_hash_final_mix(Caml_hash_primitive.caml_hash_mix_string(0, key)) & (h_buckets.length - 1 | 0); | ||
var i = Caml_hash_primitive.hash_final_mix(Caml_hash_primitive.hash_mix_string(0, key)) & (h_buckets.length - 1 | 0); | ||
var bucket = h_buckets[i]; | ||
@@ -129,3 +129,3 @@ if (bucket !== undefined) { | ||
var h_buckets = h.buckets; | ||
var nid = Caml_hash_primitive.caml_hash_final_mix(Caml_hash_primitive.caml_hash_mix_string(0, key)) & (h_buckets.length - 1 | 0); | ||
var nid = Caml_hash_primitive.hash_final_mix(Caml_hash_primitive.hash_mix_string(0, key)) & (h_buckets.length - 1 | 0); | ||
var cell1 = h_buckets[nid]; | ||
@@ -169,3 +169,3 @@ if (cell1 === undefined) { | ||
var h_buckets = h.buckets; | ||
var nid = Caml_hash_primitive.caml_hash_final_mix(Caml_hash_primitive.caml_hash_mix_string(0, key)) & (h_buckets.length - 1 | 0); | ||
var nid = Caml_hash_primitive.hash_final_mix(Caml_hash_primitive.hash_mix_string(0, key)) & (h_buckets.length - 1 | 0); | ||
var bucket = h_buckets[nid]; | ||
@@ -215,3 +215,2 @@ if (bucket !== undefined) { | ||
} | ||
} | ||
@@ -218,0 +217,0 @@ |
@@ -122,3 +122,3 @@ 'use strict'; | ||
function add(h, key) { | ||
return add0(h, key, h.hash, h.eq); | ||
add0(h, key, h.hash, h.eq); | ||
} | ||
@@ -176,3 +176,2 @@ | ||
} | ||
} | ||
@@ -179,0 +178,0 @@ |
@@ -13,3 +13,3 @@ 'use strict'; | ||
} | ||
var nidx = Caml_hash_primitive.caml_hash_final_mix(Caml_hash_primitive.caml_hash_mix_int(0, old_bucket.key)) & (h_buckets.length - 1 | 0); | ||
var nidx = Caml_hash_primitive.hash_final_mix(Caml_hash_primitive.hash_mix_int(0, old_bucket.key)) & (h_buckets.length - 1 | 0); | ||
var tail = ndata_tail[nidx]; | ||
@@ -29,3 +29,3 @@ if (tail !== undefined) { | ||
var h_buckets = h.buckets; | ||
var i = Caml_hash_primitive.caml_hash_final_mix(Caml_hash_primitive.caml_hash_mix_int(0, key)) & (h_buckets.length - 1 | 0); | ||
var i = Caml_hash_primitive.hash_final_mix(Caml_hash_primitive.hash_mix_int(0, key)) & (h_buckets.length - 1 | 0); | ||
var l = h_buckets[i]; | ||
@@ -87,3 +87,3 @@ if (l === undefined) { | ||
var buckets_len = h_buckets.length; | ||
var i = Caml_hash_primitive.caml_hash_final_mix(Caml_hash_primitive.caml_hash_mix_int(0, key)) & (buckets_len - 1 | 0); | ||
var i = Caml_hash_primitive.hash_final_mix(Caml_hash_primitive.hash_mix_int(0, key)) & (buckets_len - 1 | 0); | ||
var l = h_buckets[i]; | ||
@@ -126,3 +126,3 @@ if (l !== undefined) { | ||
var h_buckets = h.buckets; | ||
var nid = Caml_hash_primitive.caml_hash_final_mix(Caml_hash_primitive.caml_hash_mix_int(0, key)) & (h_buckets.length - 1 | 0); | ||
var nid = Caml_hash_primitive.hash_final_mix(Caml_hash_primitive.hash_mix_int(0, key)) & (h_buckets.length - 1 | 0); | ||
var bucket = h_buckets[nid]; | ||
@@ -170,3 +170,2 @@ if (bucket !== undefined) { | ||
} | ||
} | ||
@@ -173,0 +172,0 @@ |
@@ -13,3 +13,3 @@ 'use strict'; | ||
} | ||
var nidx = Caml_hash_primitive.caml_hash_final_mix(Caml_hash_primitive.caml_hash_mix_string(0, old_bucket.key)) & (h_buckets.length - 1 | 0); | ||
var nidx = Caml_hash_primitive.hash_final_mix(Caml_hash_primitive.hash_mix_string(0, old_bucket.key)) & (h_buckets.length - 1 | 0); | ||
var tail = ndata_tail[nidx]; | ||
@@ -29,3 +29,3 @@ if (tail !== undefined) { | ||
var h_buckets = h.buckets; | ||
var i = Caml_hash_primitive.caml_hash_final_mix(Caml_hash_primitive.caml_hash_mix_string(0, key)) & (h_buckets.length - 1 | 0); | ||
var i = Caml_hash_primitive.hash_final_mix(Caml_hash_primitive.hash_mix_string(0, key)) & (h_buckets.length - 1 | 0); | ||
var l = h_buckets[i]; | ||
@@ -87,3 +87,3 @@ if (l === undefined) { | ||
var buckets_len = h_buckets.length; | ||
var i = Caml_hash_primitive.caml_hash_final_mix(Caml_hash_primitive.caml_hash_mix_string(0, key)) & (buckets_len - 1 | 0); | ||
var i = Caml_hash_primitive.hash_final_mix(Caml_hash_primitive.hash_mix_string(0, key)) & (buckets_len - 1 | 0); | ||
var l = h_buckets[i]; | ||
@@ -126,3 +126,3 @@ if (l !== undefined) { | ||
var h_buckets = h.buckets; | ||
var nid = Caml_hash_primitive.caml_hash_final_mix(Caml_hash_primitive.caml_hash_mix_string(0, key)) & (h_buckets.length - 1 | 0); | ||
var nid = Caml_hash_primitive.hash_final_mix(Caml_hash_primitive.hash_mix_string(0, key)) & (h_buckets.length - 1 | 0); | ||
var bucket = h_buckets[nid]; | ||
@@ -170,3 +170,2 @@ if (bucket !== undefined) { | ||
} | ||
} | ||
@@ -173,0 +172,0 @@ |
@@ -181,3 +181,3 @@ 'use strict'; | ||
function forEach(n, f) { | ||
return forEachU(n, Curry.__1(f)); | ||
forEachU(n, Curry.__1(f)); | ||
} | ||
@@ -184,0 +184,0 @@ |
@@ -290,3 +290,3 @@ 'use strict'; | ||
function forEach(n, f) { | ||
return forEachU(n, Curry.__2(f)); | ||
forEachU(n, Curry.__2(f)); | ||
} | ||
@@ -293,0 +293,0 @@ |
@@ -87,7 +87,6 @@ 'use strict'; | ||
} | ||
} | ||
function forEach(h, f) { | ||
return forEachU(h, Curry.__2(f)); | ||
forEachU(h, Curry.__2(f)); | ||
} | ||
@@ -140,3 +139,2 @@ | ||
histo[l] = histo[l] + 1 | 0; | ||
})); | ||
@@ -153,3 +151,2 @@ return histo; | ||
}); | ||
} | ||
@@ -201,7 +198,6 @@ | ||
} | ||
} | ||
function keepMapInPlace(h, f) { | ||
return keepMapInPlaceU(h, Curry.__2(f)); | ||
keepMapInPlaceU(h, Curry.__2(f)); | ||
} | ||
@@ -208,0 +204,0 @@ |
@@ -35,3 +35,2 @@ 'use strict'; | ||
} | ||
} | ||
@@ -38,0 +37,0 @@ |
@@ -227,3 +227,3 @@ 'use strict'; | ||
var h1 = e1.hd; | ||
var c = Caml.caml_int_compare(h1.k, h2.k); | ||
var c = Caml.int_compare(h1.k, h2.k); | ||
if (c !== 0) { | ||
@@ -230,0 +230,0 @@ return c; |
@@ -227,3 +227,3 @@ 'use strict'; | ||
var h1 = e1.hd; | ||
var c = Caml.caml_string_compare(h1.k, h2.k); | ||
var c = Caml.string_compare(h1.k, h2.k); | ||
if (c !== 0) { | ||
@@ -230,0 +230,0 @@ return c; |
@@ -84,7 +84,6 @@ 'use strict'; | ||
} | ||
} | ||
function forEach(h, f) { | ||
return forEachU(h, Curry.__1(f)); | ||
forEachU(h, Curry.__1(f)); | ||
} | ||
@@ -166,3 +165,2 @@ | ||
histo[l] = histo[l] + 1 | 0; | ||
})); | ||
@@ -179,3 +177,2 @@ return histo; | ||
}); | ||
} | ||
@@ -182,0 +179,0 @@ |
@@ -777,3 +777,3 @@ 'use strict'; | ||
function forEach(xs, f) { | ||
return forEachU(xs, Curry.__1(f)); | ||
forEachU(xs, Curry.__1(f)); | ||
} | ||
@@ -798,3 +798,3 @@ | ||
function forEachWithIndex(l, f) { | ||
return forEachWithIndexU(l, Curry.__2(f)); | ||
forEachWithIndexU(l, Curry.__2(f)); | ||
} | ||
@@ -908,3 +908,3 @@ | ||
function forEach2(l1, l2, f) { | ||
return forEach2U(l1, l2, Curry.__2(f)); | ||
forEach2U(l1, l2, Curry.__2(f)); | ||
} | ||
@@ -911,0 +911,0 @@ |
@@ -116,7 +116,7 @@ 'use strict'; | ||
function forEachU(m, f) { | ||
return Belt_MapDict.forEachU(m.data, f); | ||
Belt_MapDict.forEachU(m.data, f); | ||
} | ||
function forEach(m, f) { | ||
return Belt_MapDict.forEachU(m.data, Curry.__2(f)); | ||
Belt_MapDict.forEachU(m.data, Curry.__2(f)); | ||
} | ||
@@ -273,3 +273,3 @@ | ||
function checkInvariantInternal(m) { | ||
return Belt_MapDict.checkInvariantInternal(m.data); | ||
Belt_MapDict.checkInvariantInternal(m.data); | ||
} | ||
@@ -276,0 +276,0 @@ |
@@ -140,3 +140,3 @@ 'use strict'; | ||
function update(t, x, f) { | ||
return updateU(t, x, Curry.__1(f)); | ||
updateU(t, x, Curry.__1(f)); | ||
} | ||
@@ -153,3 +153,2 @@ | ||
m.data = undefined; | ||
} | ||
@@ -195,7 +194,7 @@ | ||
function forEachU(d, f) { | ||
return Belt_internalAVLtree.forEachU(d.data, f); | ||
Belt_internalAVLtree.forEachU(d.data, f); | ||
} | ||
function forEach(d, f) { | ||
return Belt_internalAVLtree.forEachU(d.data, Curry.__2(f)); | ||
Belt_internalAVLtree.forEachU(d.data, Curry.__2(f)); | ||
} | ||
@@ -248,3 +247,3 @@ | ||
function checkInvariantInternal(d) { | ||
return Belt_internalAVLtree.checkInvariantInternal(d.data); | ||
Belt_internalAVLtree.checkInvariantInternal(d.data); | ||
} | ||
@@ -251,0 +250,0 @@ |
@@ -21,3 +21,2 @@ 'use strict'; | ||
m.data = undefined; | ||
} | ||
@@ -68,7 +67,7 @@ | ||
function forEachU(d, f) { | ||
return Belt_internalAVLtree.forEachU(d.data, f); | ||
Belt_internalAVLtree.forEachU(d.data, f); | ||
} | ||
function forEach(d, f) { | ||
return Belt_internalAVLtree.forEachU(d.data, Curry.__2(f)); | ||
Belt_internalAVLtree.forEachU(d.data, Curry.__2(f)); | ||
} | ||
@@ -141,3 +140,3 @@ | ||
function checkInvariantInternal(d) { | ||
return Belt_internalAVLtree.checkInvariantInternal(d.data); | ||
Belt_internalAVLtree.checkInvariantInternal(d.data); | ||
} | ||
@@ -247,3 +246,3 @@ | ||
function update(t, x, f) { | ||
return updateU(t, x, Curry.__1(f)); | ||
updateU(t, x, Curry.__1(f)); | ||
} | ||
@@ -250,0 +249,0 @@ |
@@ -21,3 +21,2 @@ 'use strict'; | ||
m.data = undefined; | ||
} | ||
@@ -68,7 +67,7 @@ | ||
function forEachU(d, f) { | ||
return Belt_internalAVLtree.forEachU(d.data, f); | ||
Belt_internalAVLtree.forEachU(d.data, f); | ||
} | ||
function forEach(d, f) { | ||
return Belt_internalAVLtree.forEachU(d.data, Curry.__2(f)); | ||
Belt_internalAVLtree.forEachU(d.data, Curry.__2(f)); | ||
} | ||
@@ -141,3 +140,3 @@ | ||
function checkInvariantInternal(d) { | ||
return Belt_internalAVLtree.checkInvariantInternal(d.data); | ||
Belt_internalAVLtree.checkInvariantInternal(d.data); | ||
} | ||
@@ -247,3 +246,3 @@ | ||
function update(t, x, f) { | ||
return updateU(t, x, Curry.__1(f)); | ||
updateU(t, x, Curry.__1(f)); | ||
} | ||
@@ -250,0 +249,0 @@ |
@@ -18,3 +18,2 @@ 'use strict'; | ||
q.last = undefined; | ||
} | ||
@@ -37,3 +36,2 @@ | ||
} | ||
} | ||
@@ -207,3 +205,3 @@ | ||
function forEach(q, f) { | ||
return forEachU(q, Curry.__1(f)); | ||
forEachU(q, Curry.__1(f)); | ||
} | ||
@@ -210,0 +208,0 @@ |
@@ -80,3 +80,2 @@ 'use strict'; | ||
d.data = removeMany0(oldRoot, xs, 0, len, d.cmp); | ||
} | ||
@@ -188,3 +187,2 @@ | ||
d.data = addArrayMutate(d.data, xs, d.cmp); | ||
} | ||
@@ -221,7 +219,7 @@ | ||
function forEachU(d, f) { | ||
return Belt_internalAVLset.forEachU(d.data, f); | ||
Belt_internalAVLset.forEachU(d.data, f); | ||
} | ||
function forEach(d, f) { | ||
return Belt_internalAVLset.forEachU(d.data, Curry.__1(f)); | ||
Belt_internalAVLset.forEachU(d.data, Curry.__1(f)); | ||
} | ||
@@ -273,3 +271,3 @@ | ||
function checkInvariantInternal(d) { | ||
return Belt_internalAVLset.checkInvariantInternal(d.data); | ||
Belt_internalAVLset.checkInvariantInternal(d.data); | ||
} | ||
@@ -276,0 +274,0 @@ |
@@ -80,3 +80,2 @@ 'use strict'; | ||
d.data = removeMany0(oldRoot, xs, 0, len); | ||
} | ||
@@ -186,3 +185,2 @@ | ||
d.data = addArrayMutate(d.data, arr); | ||
} | ||
@@ -218,7 +216,7 @@ | ||
function forEachU(d, f) { | ||
return Belt_internalAVLset.forEachU(d.data, f); | ||
Belt_internalAVLset.forEachU(d.data, f); | ||
} | ||
function forEach(d, f) { | ||
return Belt_internalAVLset.forEachU(d.data, Curry.__1(f)); | ||
Belt_internalAVLset.forEachU(d.data, Curry.__1(f)); | ||
} | ||
@@ -269,3 +267,3 @@ | ||
function checkInvariantInternal(d) { | ||
return Belt_internalAVLset.checkInvariantInternal(d.data); | ||
Belt_internalAVLset.checkInvariantInternal(d.data); | ||
} | ||
@@ -272,0 +270,0 @@ |
@@ -80,3 +80,2 @@ 'use strict'; | ||
d.data = removeMany0(oldRoot, xs, 0, len); | ||
} | ||
@@ -186,3 +185,2 @@ | ||
d.data = addArrayMutate(d.data, arr); | ||
} | ||
@@ -218,7 +216,7 @@ | ||
function forEachU(d, f) { | ||
return Belt_internalAVLset.forEachU(d.data, f); | ||
Belt_internalAVLset.forEachU(d.data, f); | ||
} | ||
function forEach(d, f) { | ||
return Belt_internalAVLset.forEachU(d.data, Curry.__1(f)); | ||
Belt_internalAVLset.forEachU(d.data, Curry.__1(f)); | ||
} | ||
@@ -269,3 +267,3 @@ | ||
function checkInvariantInternal(d) { | ||
return Belt_internalAVLset.checkInvariantInternal(d.data); | ||
Belt_internalAVLset.checkInvariantInternal(d.data); | ||
} | ||
@@ -272,0 +270,0 @@ |
@@ -14,3 +14,2 @@ 'use strict'; | ||
s.root = undefined; | ||
} | ||
@@ -29,3 +28,2 @@ | ||
}; | ||
} | ||
@@ -106,3 +104,3 @@ | ||
function forEach(s, f) { | ||
return forEachU(s, Curry.__1(f)); | ||
forEachU(s, Curry.__1(f)); | ||
} | ||
@@ -123,3 +121,3 @@ | ||
function dynamicPopIter(s, f) { | ||
return dynamicPopIterU(s, Curry.__1(f)); | ||
dynamicPopIterU(s, Curry.__1(f)); | ||
} | ||
@@ -126,0 +124,0 @@ |
@@ -25,3 +25,3 @@ 'use strict'; | ||
function forEach(opt, f) { | ||
return forEachU(opt, Curry.__1(f)); | ||
forEachU(opt, Curry.__1(f)); | ||
} | ||
@@ -81,2 +81,10 @@ | ||
function orElse(opt, other) { | ||
if (opt !== undefined) { | ||
return opt; | ||
} else { | ||
return other; | ||
} | ||
} | ||
function isSome(param) { | ||
@@ -136,2 +144,3 @@ return param !== undefined; | ||
exports.getWithDefault = getWithDefault; | ||
exports.orElse = orElse; | ||
exports.isSome = isSome; | ||
@@ -138,0 +147,0 @@ exports.isNone = isNone; |
@@ -9,7 +9,6 @@ 'use strict'; | ||
} | ||
} | ||
function forEach(s, f, action) { | ||
return forEachU(s, f, Curry.__1(action)); | ||
forEachU(s, f, Curry.__1(action)); | ||
} | ||
@@ -16,0 +15,0 @@ |
@@ -127,7 +127,7 @@ 'use strict'; | ||
function forEachU(m, f) { | ||
return Belt_SetDict.forEachU(m.data, f); | ||
Belt_SetDict.forEachU(m.data, f); | ||
} | ||
function forEach(m, f) { | ||
return Belt_SetDict.forEachU(m.data, Curry.__1(f)); | ||
Belt_SetDict.forEachU(m.data, Curry.__1(f)); | ||
} | ||
@@ -259,3 +259,3 @@ | ||
function checkInvariantInternal(d) { | ||
return Belt_SetDict.checkInvariantInternal(d.data); | ||
Belt_SetDict.checkInvariantInternal(d.data); | ||
} | ||
@@ -262,0 +262,0 @@ |
@@ -309,3 +309,2 @@ 'use strict'; | ||
} | ||
} | ||
@@ -321,3 +320,3 @@ | ||
sortTo(src, srcofs, src, srcofs + l2 | 0, l1, cmp); | ||
return merge(src, srcofs + l2 | 0, l1, dst, dstofs + l1 | 0, l2, dst, dstofs, cmp); | ||
merge(src, srcofs + l2 | 0, l1, dst, dstofs + l1 | 0, l2, dst, dstofs, cmp); | ||
} | ||
@@ -335,7 +334,7 @@ | ||
sortTo(a, 0, a, l2, l1, cmp); | ||
return merge(a, l2, l1, t, 0, l2, a, 0, cmp); | ||
merge(a, l2, l1, t, 0, l2, a, 0, cmp); | ||
} | ||
function stableSortInPlaceBy(a, cmp) { | ||
return stableSortInPlaceByU(a, Curry.__2(cmp)); | ||
stableSortInPlaceByU(a, Curry.__2(cmp)); | ||
} | ||
@@ -342,0 +341,0 @@ |
@@ -285,3 +285,2 @@ 'use strict'; | ||
} | ||
} | ||
@@ -297,3 +296,3 @@ | ||
sortTo(src, srcofs, src, srcofs + l2 | 0, l1); | ||
return merge(src, srcofs + l2 | 0, l1, dst, dstofs + l1 | 0, l2, dst, dstofs); | ||
merge(src, srcofs + l2 | 0, l1, dst, dstofs + l1 | 0, l2, dst, dstofs); | ||
} | ||
@@ -311,3 +310,3 @@ | ||
sortTo(a, 0, a, l2, l1); | ||
return merge(a, l2, l1, t, 0, l2, a, 0); | ||
merge(a, l2, l1, t, 0, l2, a, 0); | ||
} | ||
@@ -314,0 +313,0 @@ |
@@ -285,3 +285,2 @@ 'use strict'; | ||
} | ||
} | ||
@@ -297,3 +296,3 @@ | ||
sortTo(src, srcofs, src, srcofs + l2 | 0, l1); | ||
return merge(src, srcofs + l2 | 0, l1, dst, dstofs + l1 | 0, l2, dst, dstofs); | ||
merge(src, srcofs + l2 | 0, l1, dst, dstofs + l1 | 0, l2, dst, dstofs); | ||
} | ||
@@ -311,3 +310,3 @@ | ||
sortTo(a, 0, a, l2, l1); | ||
return merge(a, l2, l1, t, 0, l2, a, 0); | ||
merge(a, l2, l1, t, 0, l2, a, 0); | ||
} | ||
@@ -314,0 +313,0 @@ |
@@ -7,3 +7,2 @@ 'use strict'; | ||
var Caml_bytes = require("./caml_bytes.js"); | ||
var Pervasives = require("./pervasives.js"); | ||
var Caml_string = require("./caml_string.js"); | ||
@@ -13,3 +12,3 @@ | ||
var n$1 = n < 1 ? 1 : n; | ||
var s = Caml_bytes.caml_create_bytes(n$1); | ||
var s = Caml_bytes.create(n$1); | ||
return { | ||
@@ -50,3 +49,3 @@ buffer: s, | ||
} | ||
return Caml_bytes.caml_blit_bytes(src.buffer, srcoff, dst, dstoff, len); | ||
Bytes.blit(src.buffer, srcoff, dst, dstoff, len); | ||
} | ||
@@ -71,3 +70,2 @@ | ||
b.position = 0; | ||
} | ||
@@ -79,3 +77,2 @@ | ||
b.length = b.buffer.length; | ||
} | ||
@@ -89,7 +86,6 @@ | ||
}; | ||
var new_buffer = Caml_bytes.caml_create_bytes(new_len); | ||
var new_buffer = Caml_bytes.create(new_len); | ||
Bytes.blit(b.buffer, 0, new_buffer, 0, b.position); | ||
b.buffer = new_buffer; | ||
b.length = new_len; | ||
} | ||
@@ -104,3 +100,2 @@ | ||
b.position = pos + 1 | 0; | ||
} | ||
@@ -115,3 +110,3 @@ | ||
"buffer.ml", | ||
90, | ||
78, | ||
19 | ||
@@ -162,3 +157,3 @@ ], | ||
"buffer.ml", | ||
123, | ||
111, | ||
8 | ||
@@ -177,3 +172,3 @@ ], | ||
"buffer.ml", | ||
126, | ||
114, | ||
19 | ||
@@ -213,3 +208,3 @@ ], | ||
"buffer.ml", | ||
144, | ||
132, | ||
8 | ||
@@ -228,3 +223,3 @@ ], | ||
"buffer.ml", | ||
147, | ||
135, | ||
19 | ||
@@ -264,3 +259,3 @@ ], | ||
"buffer.ml", | ||
165, | ||
153, | ||
8 | ||
@@ -286,7 +281,6 @@ ], | ||
b.position = new_position; | ||
} | ||
function add_subbytes(b, s, offset, len) { | ||
return add_substring(b, Caml_bytes.bytes_to_string(s), offset, len); | ||
add_substring(b, Bytes.unsafe_to_string(s), offset, len); | ||
} | ||
@@ -302,47 +296,12 @@ | ||
b.position = new_position; | ||
} | ||
function add_bytes(b, s) { | ||
return add_string(b, Caml_bytes.bytes_to_string(s)); | ||
add_string(b, Bytes.unsafe_to_string(s)); | ||
} | ||
function add_buffer(b, bs) { | ||
return add_subbytes(b, bs.buffer, 0, bs.position); | ||
add_subbytes(b, bs.buffer, 0, bs.position); | ||
} | ||
function add_channel(b, ic, len) { | ||
if (len < 0) { | ||
throw { | ||
RE_EXN_ID: "Invalid_argument", | ||
_1: "Buffer.add_channel", | ||
Error: new Error() | ||
}; | ||
} | ||
if ((b.position + len | 0) > b.length) { | ||
resize(b, len); | ||
} | ||
var _len = len; | ||
while(true) { | ||
var len$1 = _len; | ||
if (len$1 <= 0) { | ||
return ; | ||
} | ||
var n = Pervasives.input(ic, b.buffer, b.position, len$1); | ||
b.position = b.position + n | 0; | ||
if (n === 0) { | ||
throw { | ||
RE_EXN_ID: "End_of_file", | ||
Error: new Error() | ||
}; | ||
} | ||
_len = len$1 - n | 0; | ||
continue ; | ||
}; | ||
} | ||
function output_buffer(oc, b) { | ||
return Pervasives.output(oc, b.buffer, 0, b.position); | ||
} | ||
function closing(param) { | ||
@@ -359,3 +318,3 @@ if (param === 40) { | ||
"buffer.ml", | ||
216, | ||
181, | ||
9 | ||
@@ -510,3 +469,2 @@ ], | ||
b.position = len; | ||
} | ||
@@ -533,5 +491,3 @@ | ||
exports.add_buffer = add_buffer; | ||
exports.add_channel = add_channel; | ||
exports.output_buffer = output_buffer; | ||
exports.truncate = truncate; | ||
/* No side effect */ |
@@ -9,5 +9,54 @@ 'use strict'; | ||
function unsafe_fill(s, i, l, c) { | ||
if (l <= 0) { | ||
return ; | ||
} | ||
for(var k = i ,k_finish = l + i | 0; k < k_finish; ++k){ | ||
s[k] = c; | ||
} | ||
} | ||
function unsafe_blit(s1, i1, s2, i2, len) { | ||
if (len <= 0) { | ||
return ; | ||
} | ||
if (s1 === s2) { | ||
if (i1 < i2) { | ||
var range_a = (s1.length - i2 | 0) - 1 | 0; | ||
var range_b = len - 1 | 0; | ||
var range = range_a > range_b ? range_b : range_a; | ||
for(var j = range; j >= 0; --j){ | ||
s1[i2 + j | 0] = s1[i1 + j | 0]; | ||
} | ||
return ; | ||
} | ||
if (i1 <= i2) { | ||
return ; | ||
} | ||
var range_a$1 = (s1.length - i1 | 0) - 1 | 0; | ||
var range_b$1 = len - 1 | 0; | ||
var range$1 = range_a$1 > range_b$1 ? range_b$1 : range_a$1; | ||
for(var k = 0; k <= range$1; ++k){ | ||
s1[i2 + k | 0] = s1[i1 + k | 0]; | ||
} | ||
return ; | ||
} | ||
var off1 = s1.length - i1 | 0; | ||
if (len <= off1) { | ||
for(var i = 0; i < len; ++i){ | ||
s2[i2 + i | 0] = s1[i1 + i | 0]; | ||
} | ||
return ; | ||
} | ||
for(var i$1 = 0; i$1 < off1; ++i$1){ | ||
s2[i2 + i$1 | 0] = s1[i1 + i$1 | 0]; | ||
} | ||
for(var i$2 = off1; i$2 < len; ++i$2){ | ||
s2[i2 + i$2 | 0] = /* '\000' */0; | ||
} | ||
} | ||
function make(n, c) { | ||
var s = Caml_bytes.caml_create_bytes(n); | ||
Caml_bytes.caml_fill_bytes(s, 0, n, c); | ||
var s = Caml_bytes.create(n); | ||
unsafe_fill(s, 0, n, c); | ||
return s; | ||
@@ -17,3 +66,3 @@ } | ||
function init(n, f) { | ||
var s = Caml_bytes.caml_create_bytes(n); | ||
var s = Caml_bytes.create(n); | ||
for(var i = 0; i < n; ++i){ | ||
@@ -29,13 +78,36 @@ s[i] = Curry._1(f, i); | ||
var len = s.length; | ||
var r = Caml_bytes.caml_create_bytes(len); | ||
Caml_bytes.caml_blit_bytes(s, 0, r, 0, len); | ||
var r = Caml_bytes.create(len); | ||
unsafe_blit(s, 0, r, 0, len); | ||
return r; | ||
} | ||
function to_string(b) { | ||
return Caml_bytes.bytes_to_string(copy(b)); | ||
function to_string(a) { | ||
var i = 0; | ||
var len = a.length; | ||
var s = ""; | ||
var s_len = len; | ||
if (i === 0 && len <= 4096 && len === a.length) { | ||
return String.fromCharCode.apply(null, a); | ||
} | ||
var offset = 0; | ||
while(s_len > 0) { | ||
var next = s_len < 1024 ? s_len : 1024; | ||
var tmp_bytes = new Array(next); | ||
for(var k = 0; k < next; ++k){ | ||
tmp_bytes[k] = a[k + offset | 0]; | ||
} | ||
s = s + String.fromCharCode.apply(null, tmp_bytes); | ||
s_len = s_len - next | 0; | ||
offset = offset + next | 0; | ||
}; | ||
return s; | ||
} | ||
function of_string(s) { | ||
return copy(Caml_bytes.bytes_of_string(s)); | ||
var len = s.length; | ||
var res = new Array(len); | ||
for(var i = 0; i < len; ++i){ | ||
res[i] = s.codePointAt(i); | ||
} | ||
return res; | ||
} | ||
@@ -51,4 +123,4 @@ | ||
} | ||
var r = Caml_bytes.caml_create_bytes(len); | ||
Caml_bytes.caml_blit_bytes(s, ofs, r, 0, len); | ||
var r = Caml_bytes.create(len); | ||
unsafe_blit(s, ofs, r, 0, len); | ||
return r; | ||
@@ -58,3 +130,3 @@ } | ||
function sub_string(b, ofs, len) { | ||
return Caml_bytes.bytes_to_string(sub(b, ofs, len)); | ||
return to_string(sub(b, ofs, len)); | ||
} | ||
@@ -95,3 +167,3 @@ | ||
var len = $plus$plus($plus$plus(s.length, left), right); | ||
var r = Caml_bytes.caml_create_bytes(len); | ||
var r = Caml_bytes.create(len); | ||
var match = left < 0 ? [ | ||
@@ -106,5 +178,5 @@ -left | 0, | ||
var srcoff = match[0]; | ||
var cpylen = Caml.caml_int_min(s.length - srcoff | 0, len - dstoff | 0); | ||
var cpylen = Caml.int_min(s.length - srcoff | 0, len - dstoff | 0); | ||
if (cpylen > 0) { | ||
Caml_bytes.caml_blit_bytes(s, srcoff, r, dstoff, cpylen); | ||
unsafe_blit(s, srcoff, r, dstoff, cpylen); | ||
} | ||
@@ -122,3 +194,3 @@ return r; | ||
} | ||
return Caml_bytes.caml_fill_bytes(s, ofs, len, c); | ||
unsafe_fill(s, ofs, len, c); | ||
} | ||
@@ -134,3 +206,3 @@ | ||
} | ||
return Caml_bytes.caml_blit_bytes(s1, ofs1, s2, ofs2, len); | ||
unsafe_blit(s1, ofs1, s2, ofs2, len); | ||
} | ||
@@ -146,3 +218,18 @@ | ||
} | ||
return Caml_bytes.caml_blit_string(s1, ofs1, s2, ofs2, len); | ||
if (len <= 0) { | ||
return ; | ||
} | ||
var off1 = s1.length - ofs1 | 0; | ||
if (len <= off1) { | ||
for(var i = 0; i < len; ++i){ | ||
s2[ofs2 + i | 0] = s1.codePointAt(ofs1 + i | 0); | ||
} | ||
return ; | ||
} | ||
for(var i$1 = 0; i$1 < off1; ++i$1){ | ||
s2[ofs2 + i$1 | 0] = s1.codePointAt(ofs1 + i$1 | 0); | ||
} | ||
for(var i$2 = off1; i$2 < len; ++i$2){ | ||
s2[ofs2 + i$2 | 0] = /* '\000' */0; | ||
} | ||
} | ||
@@ -154,3 +241,2 @@ | ||
} | ||
} | ||
@@ -162,3 +248,2 @@ | ||
} | ||
} | ||
@@ -200,3 +285,3 @@ | ||
var seplen = sep.length; | ||
var dst = Caml_bytes.caml_create_bytes(sum_lengths(0, seplen, l)); | ||
var dst = Caml_bytes.create(sum_lengths(0, seplen, l)); | ||
var _pos = 0; | ||
@@ -213,4 +298,4 @@ var _param = l; | ||
if (tl) { | ||
Caml_bytes.caml_blit_bytes(hd, 0, dst, pos, hd.length); | ||
Caml_bytes.caml_blit_bytes(sep, 0, dst, pos + hd.length | 0, seplen); | ||
unsafe_blit(hd, 0, dst, pos, hd.length); | ||
unsafe_blit(sep, 0, dst, pos + hd.length | 0, seplen); | ||
_param = tl; | ||
@@ -220,3 +305,3 @@ _pos = (pos + hd.length | 0) + seplen | 0; | ||
} | ||
Caml_bytes.caml_blit_bytes(hd, 0, dst, pos, hd.length); | ||
unsafe_blit(hd, 0, dst, pos, hd.length); | ||
return dst; | ||
@@ -229,5 +314,5 @@ }; | ||
var l2 = s2.length; | ||
var r = Caml_bytes.caml_create_bytes(l1 + l2 | 0); | ||
Caml_bytes.caml_blit_bytes(s1, 0, r, 0, l1); | ||
Caml_bytes.caml_blit_bytes(s2, 0, r, l1, l2); | ||
var r = Caml_bytes.create(l1 + l2 | 0); | ||
unsafe_blit(s1, 0, r, 0, l1); | ||
unsafe_blit(s2, 0, r, l1, l2); | ||
return r; | ||
@@ -284,3 +369,3 @@ } | ||
} | ||
var s$p = Caml_bytes.caml_create_bytes(n); | ||
var s$p = Caml_bytes.create(n); | ||
n = 0; | ||
@@ -372,3 +457,3 @@ for(var i$1 = 0 ,i_finish$1 = s.length; i$1 < i_finish$1; ++i$1){ | ||
} | ||
var r = Caml_bytes.caml_create_bytes(l); | ||
var r = Caml_bytes.create(l); | ||
for(var i = 0; i < l; ++i){ | ||
@@ -385,3 +470,3 @@ r[i] = Curry._1(f, s[i]); | ||
} | ||
var r = Caml_bytes.caml_create_bytes(l); | ||
var r = Caml_bytes.create(l); | ||
for(var i = 0; i < l; ++i){ | ||
@@ -589,26 +674,10 @@ r[i] = Curry._2(f, i, s[i]); | ||
var compare = Caml_bytes.caml_bytes_compare; | ||
var compare = Caml_bytes.bytes_compare; | ||
function uppercase(s) { | ||
return map(Char.uppercase, s); | ||
} | ||
var equal = Caml_bytes.bytes_equal; | ||
function lowercase(s) { | ||
return map(Char.lowercase, s); | ||
} | ||
var unsafe_to_string = to_string; | ||
function capitalize(s) { | ||
return apply1(Char.uppercase, s); | ||
} | ||
var unsafe_of_string = of_string; | ||
function uncapitalize(s) { | ||
return apply1(Char.lowercase, s); | ||
} | ||
var equal = Caml_bytes.caml_bytes_equal; | ||
var unsafe_to_string = Caml_bytes.bytes_to_string; | ||
var unsafe_of_string = Caml_bytes.bytes_of_string; | ||
exports.make = make; | ||
@@ -645,6 +714,2 @@ exports.init = init; | ||
exports.rcontains_from = rcontains_from; | ||
exports.uppercase = uppercase; | ||
exports.lowercase = lowercase; | ||
exports.capitalize = capitalize; | ||
exports.uncapitalize = uncapitalize; | ||
exports.uppercase_ascii = uppercase_ascii; | ||
@@ -651,0 +716,0 @@ exports.lowercase_ascii = lowercase_ascii; |
'use strict'; | ||
var Bytes = require("./bytes.js"); | ||
var Caml = require("./caml.js"); | ||
var Char = require("./char.js"); | ||
var Curry = require("./curry.js"); | ||
var Caml_bytes = require("./caml_bytes.js"); | ||
var Caml_js_exceptions = require("./caml_js_exceptions.js"); | ||
var make = Bytes.make; | ||
function unsafe_fill(s, i, l, c) { | ||
if (l <= 0) { | ||
return ; | ||
} | ||
for(var k = i ,k_finish = l + i | 0; k < k_finish; ++k){ | ||
s[k] = c; | ||
} | ||
} | ||
var init = Bytes.init; | ||
function unsafe_blit(s1, i1, s2, i2, len) { | ||
if (len <= 0) { | ||
return ; | ||
} | ||
if (s1 === s2) { | ||
if (i1 < i2) { | ||
var range_a = (s1.length - i2 | 0) - 1 | 0; | ||
var range_b = len - 1 | 0; | ||
var range = range_a > range_b ? range_b : range_a; | ||
for(var j = range; j >= 0; --j){ | ||
s1[i2 + j | 0] = s1[i1 + j | 0]; | ||
} | ||
return ; | ||
} | ||
if (i1 <= i2) { | ||
return ; | ||
} | ||
var range_a$1 = (s1.length - i1 | 0) - 1 | 0; | ||
var range_b$1 = len - 1 | 0; | ||
var range$1 = range_a$1 > range_b$1 ? range_b$1 : range_a$1; | ||
for(var k = 0; k <= range$1; ++k){ | ||
s1[i2 + k | 0] = s1[i1 + k | 0]; | ||
} | ||
return ; | ||
} | ||
var off1 = s1.length - i1 | 0; | ||
if (len <= off1) { | ||
for(var i = 0; i < len; ++i){ | ||
s2[i2 + i | 0] = s1[i1 + i | 0]; | ||
} | ||
return ; | ||
} | ||
for(var i$1 = 0; i$1 < off1; ++i$1){ | ||
s2[i2 + i$1 | 0] = s1[i1 + i$1 | 0]; | ||
} | ||
for(var i$2 = off1; i$2 < len; ++i$2){ | ||
s2[i2 + i$2 | 0] = /* '\000' */0; | ||
} | ||
} | ||
var empty = Bytes.empty; | ||
function make(n, c) { | ||
var s = Caml_bytes.create(n); | ||
unsafe_fill(s, 0, n, c); | ||
return s; | ||
} | ||
var copy = Bytes.copy; | ||
function init(n, f) { | ||
var s = Caml_bytes.create(n); | ||
for(var i = 0; i < n; ++i){ | ||
s[i] = Curry._1(f, i); | ||
} | ||
return s; | ||
} | ||
var of_string = Bytes.of_string; | ||
var empty = []; | ||
var to_string = Bytes.to_string; | ||
function copy(s) { | ||
var len = s.length; | ||
var r = Caml_bytes.create(len); | ||
unsafe_blit(s, 0, r, 0, len); | ||
return r; | ||
} | ||
var sub = Bytes.sub; | ||
function to_string(a) { | ||
var i = 0; | ||
var len = a.length; | ||
var s = ""; | ||
var s_len = len; | ||
if (i === 0 && len <= 4096 && len === a.length) { | ||
return String.fromCharCode.apply(null, a); | ||
} | ||
var offset = 0; | ||
while(s_len > 0) { | ||
var next = s_len < 1024 ? s_len : 1024; | ||
var tmp_bytes = new Array(next); | ||
for(var k = 0; k < next; ++k){ | ||
tmp_bytes[k] = a[k + offset | 0]; | ||
} | ||
s = s + String.fromCharCode.apply(null, tmp_bytes); | ||
s_len = s_len - next | 0; | ||
offset = offset + next | 0; | ||
}; | ||
return s; | ||
} | ||
var sub_string = Bytes.sub_string; | ||
function of_string(s) { | ||
var len = s.length; | ||
var res = new Array(len); | ||
for(var i = 0; i < len; ++i){ | ||
res[i] = s.codePointAt(i); | ||
} | ||
return res; | ||
} | ||
var extend = Bytes.extend; | ||
function sub(s, ofs, len) { | ||
if (ofs < 0 || len < 0 || ofs > (s.length - len | 0)) { | ||
throw { | ||
RE_EXN_ID: "Invalid_argument", | ||
_1: "String.sub / Bytes.sub", | ||
Error: new Error() | ||
}; | ||
} | ||
var r = Caml_bytes.create(len); | ||
unsafe_blit(s, ofs, r, 0, len); | ||
return r; | ||
} | ||
var fill = Bytes.fill; | ||
function sub_string(b, ofs, len) { | ||
return to_string(sub(b, ofs, len)); | ||
} | ||
var blit = Bytes.blit; | ||
function $plus$plus(a, b) { | ||
var c = a + b | 0; | ||
var match = a < 0; | ||
var match$1 = b < 0; | ||
var match$2 = c < 0; | ||
if (match) { | ||
if (!match$1) { | ||
return c; | ||
} | ||
if (match$2) { | ||
return c; | ||
} | ||
throw { | ||
RE_EXN_ID: "Invalid_argument", | ||
_1: "Bytes.extend", | ||
Error: new Error() | ||
}; | ||
} | ||
if (match$1) { | ||
return c; | ||
} | ||
if (match$2) { | ||
throw { | ||
RE_EXN_ID: "Invalid_argument", | ||
_1: "Bytes.extend", | ||
Error: new Error() | ||
}; | ||
} | ||
return c; | ||
} | ||
var blit_string = Bytes.blit_string; | ||
function extend(s, left, right) { | ||
var len = $plus$plus($plus$plus(s.length, left), right); | ||
var r = Caml_bytes.create(len); | ||
var match = left < 0 ? [ | ||
-left | 0, | ||
0 | ||
] : [ | ||
0, | ||
left | ||
]; | ||
var dstoff = match[1]; | ||
var srcoff = match[0]; | ||
var cpylen = Caml.int_min(s.length - srcoff | 0, len - dstoff | 0); | ||
if (cpylen > 0) { | ||
unsafe_blit(s, srcoff, r, dstoff, cpylen); | ||
} | ||
return r; | ||
} | ||
var concat = Bytes.concat; | ||
function fill(s, ofs, len, c) { | ||
if (ofs < 0 || len < 0 || ofs > (s.length - len | 0)) { | ||
throw { | ||
RE_EXN_ID: "Invalid_argument", | ||
_1: "String.fill / Bytes.fill", | ||
Error: new Error() | ||
}; | ||
} | ||
unsafe_fill(s, ofs, len, c); | ||
} | ||
var cat = Bytes.cat; | ||
function blit(s1, ofs1, s2, ofs2, len) { | ||
if (len < 0 || ofs1 < 0 || ofs1 > (s1.length - len | 0) || ofs2 < 0 || ofs2 > (s2.length - len | 0)) { | ||
throw { | ||
RE_EXN_ID: "Invalid_argument", | ||
_1: "Bytes.blit", | ||
Error: new Error() | ||
}; | ||
} | ||
unsafe_blit(s1, ofs1, s2, ofs2, len); | ||
} | ||
var iter = Bytes.iter; | ||
function blit_string(s1, ofs1, s2, ofs2, len) { | ||
if (len < 0 || ofs1 < 0 || ofs1 > (s1.length - len | 0) || ofs2 < 0 || ofs2 > (s2.length - len | 0)) { | ||
throw { | ||
RE_EXN_ID: "Invalid_argument", | ||
_1: "String.blit / Bytes.blit_string", | ||
Error: new Error() | ||
}; | ||
} | ||
if (len <= 0) { | ||
return ; | ||
} | ||
var off1 = s1.length - ofs1 | 0; | ||
if (len <= off1) { | ||
for(var i = 0; i < len; ++i){ | ||
s2[ofs2 + i | 0] = s1.codePointAt(ofs1 + i | 0); | ||
} | ||
return ; | ||
} | ||
for(var i$1 = 0; i$1 < off1; ++i$1){ | ||
s2[ofs2 + i$1 | 0] = s1.codePointAt(ofs1 + i$1 | 0); | ||
} | ||
for(var i$2 = off1; i$2 < len; ++i$2){ | ||
s2[ofs2 + i$2 | 0] = /* '\000' */0; | ||
} | ||
} | ||
var iteri = Bytes.iteri; | ||
function iter(f, a) { | ||
for(var i = 0 ,i_finish = a.length; i < i_finish; ++i){ | ||
Curry._1(f, a[i]); | ||
} | ||
} | ||
var map = Bytes.map; | ||
function iteri(f, a) { | ||
for(var i = 0 ,i_finish = a.length; i < i_finish; ++i){ | ||
Curry._2(f, i, a[i]); | ||
} | ||
} | ||
var mapi = Bytes.mapi; | ||
function ensure_ge(x, y) { | ||
if (x >= y) { | ||
return x; | ||
} | ||
throw { | ||
RE_EXN_ID: "Invalid_argument", | ||
_1: "Bytes.concat", | ||
Error: new Error() | ||
}; | ||
} | ||
var trim = Bytes.trim; | ||
function sum_lengths(_acc, seplen, _param) { | ||
while(true) { | ||
var param = _param; | ||
var acc = _acc; | ||
if (!param) { | ||
return acc; | ||
} | ||
var tl = param.tl; | ||
var hd = param.hd; | ||
if (!tl) { | ||
return hd.length + acc | 0; | ||
} | ||
_param = tl; | ||
_acc = ensure_ge((hd.length + seplen | 0) + acc | 0, acc); | ||
continue ; | ||
}; | ||
} | ||
var escaped = Bytes.escaped; | ||
function concat(sep, l) { | ||
if (!l) { | ||
return empty; | ||
} | ||
var seplen = sep.length; | ||
var dst = Caml_bytes.create(sum_lengths(0, seplen, l)); | ||
var _pos = 0; | ||
var _param = l; | ||
while(true) { | ||
var param = _param; | ||
var pos = _pos; | ||
if (!param) { | ||
return dst; | ||
} | ||
var tl = param.tl; | ||
var hd = param.hd; | ||
if (tl) { | ||
unsafe_blit(hd, 0, dst, pos, hd.length); | ||
unsafe_blit(sep, 0, dst, pos + hd.length | 0, seplen); | ||
_param = tl; | ||
_pos = (pos + hd.length | 0) + seplen | 0; | ||
continue ; | ||
} | ||
unsafe_blit(hd, 0, dst, pos, hd.length); | ||
return dst; | ||
}; | ||
} | ||
var index = Bytes.index; | ||
function cat(s1, s2) { | ||
var l1 = s1.length; | ||
var l2 = s2.length; | ||
var r = Caml_bytes.create(l1 + l2 | 0); | ||
unsafe_blit(s1, 0, r, 0, l1); | ||
unsafe_blit(s2, 0, r, l1, l2); | ||
return r; | ||
} | ||
var index_opt = Bytes.index_opt; | ||
function is_space(param) { | ||
if (param > 13 || param < 9) { | ||
return param === 32; | ||
} else { | ||
return param !== 11; | ||
} | ||
} | ||
var rindex = Bytes.rindex; | ||
function trim(s) { | ||
var len = s.length; | ||
var i = 0; | ||
while(i < len && is_space(s[i])) { | ||
i = i + 1 | 0; | ||
}; | ||
var j = len - 1 | 0; | ||
while(j >= i && is_space(s[j])) { | ||
j = j - 1 | 0; | ||
}; | ||
if (j >= i) { | ||
return sub(s, i, (j - i | 0) + 1 | 0); | ||
} else { | ||
return empty; | ||
} | ||
} | ||
var rindex_opt = Bytes.rindex_opt; | ||
function escaped(s) { | ||
var n = 0; | ||
for(var i = 0 ,i_finish = s.length; i < i_finish; ++i){ | ||
var match = s[i]; | ||
n = n + ( | ||
match >= 32 ? ( | ||
match > 92 || match < 34 ? ( | ||
match >= 127 ? 4 : 1 | ||
) : ( | ||
match > 91 || match < 35 ? 2 : 1 | ||
) | ||
) : ( | ||
match >= 11 ? ( | ||
match !== 13 ? 4 : 2 | ||
) : ( | ||
match >= 8 ? 2 : 4 | ||
) | ||
) | ||
) | 0; | ||
} | ||
if (n === s.length) { | ||
return copy(s); | ||
} | ||
var s$p = Caml_bytes.create(n); | ||
n = 0; | ||
for(var i$1 = 0 ,i_finish$1 = s.length; i$1 < i_finish$1; ++i$1){ | ||
var c = s[i$1]; | ||
var exit = 0; | ||
if (c >= 35) { | ||
if (c !== 92) { | ||
if (c >= 127) { | ||
exit = 1; | ||
} else { | ||
s$p[n] = c; | ||
} | ||
} else { | ||
exit = 2; | ||
} | ||
} else if (c >= 32) { | ||
if (c >= 34) { | ||
exit = 2; | ||
} else { | ||
s$p[n] = c; | ||
} | ||
} else if (c >= 14) { | ||
exit = 1; | ||
} else { | ||
switch (c) { | ||
case 8 : | ||
s$p[n] = /* '\\' */92; | ||
n = n + 1 | 0; | ||
s$p[n] = /* 'b' */98; | ||
break; | ||
case 9 : | ||
s$p[n] = /* '\\' */92; | ||
n = n + 1 | 0; | ||
s$p[n] = /* 't' */116; | ||
break; | ||
case 10 : | ||
s$p[n] = /* '\\' */92; | ||
n = n + 1 | 0; | ||
s$p[n] = /* 'n' */110; | ||
break; | ||
case 0 : | ||
case 1 : | ||
case 2 : | ||
case 3 : | ||
case 4 : | ||
case 5 : | ||
case 6 : | ||
case 7 : | ||
case 11 : | ||
case 12 : | ||
exit = 1; | ||
break; | ||
case 13 : | ||
s$p[n] = /* '\\' */92; | ||
n = n + 1 | 0; | ||
s$p[n] = /* 'r' */114; | ||
break; | ||
} | ||
} | ||
switch (exit) { | ||
case 1 : | ||
s$p[n] = /* '\\' */92; | ||
n = n + 1 | 0; | ||
s$p[n] = 48 + (c / 100 | 0) | 0; | ||
n = n + 1 | 0; | ||
s$p[n] = 48 + (c / 10 | 0) % 10 | 0; | ||
n = n + 1 | 0; | ||
s$p[n] = 48 + c % 10 | 0; | ||
break; | ||
case 2 : | ||
s$p[n] = /* '\\' */92; | ||
n = n + 1 | 0; | ||
s$p[n] = c; | ||
break; | ||
} | ||
n = n + 1 | 0; | ||
} | ||
return s$p; | ||
} | ||
var index_from = Bytes.index_from; | ||
function map(f, s) { | ||
var l = s.length; | ||
if (l === 0) { | ||
return s; | ||
} | ||
var r = Caml_bytes.create(l); | ||
for(var i = 0; i < l; ++i){ | ||
r[i] = Curry._1(f, s[i]); | ||
} | ||
return r; | ||
} | ||
var index_from_opt = Bytes.index_from_opt; | ||
function mapi(f, s) { | ||
var l = s.length; | ||
if (l === 0) { | ||
return s; | ||
} | ||
var r = Caml_bytes.create(l); | ||
for(var i = 0; i < l; ++i){ | ||
r[i] = Curry._2(f, i, s[i]); | ||
} | ||
return r; | ||
} | ||
var rindex_from = Bytes.rindex_from; | ||
function uppercase_ascii(s) { | ||
return map(Char.uppercase_ascii, s); | ||
} | ||
var rindex_from_opt = Bytes.rindex_from_opt; | ||
function lowercase_ascii(s) { | ||
return map(Char.lowercase_ascii, s); | ||
} | ||
var contains = Bytes.contains; | ||
function apply1(f, s) { | ||
if (s.length === 0) { | ||
return s; | ||
} | ||
var r = copy(s); | ||
r[0] = Curry._1(f, s[0]); | ||
return r; | ||
} | ||
var contains_from = Bytes.contains_from; | ||
function capitalize_ascii(s) { | ||
return apply1(Char.uppercase_ascii, s); | ||
} | ||
var rcontains_from = Bytes.rcontains_from; | ||
function uncapitalize_ascii(s) { | ||
return apply1(Char.lowercase_ascii, s); | ||
} | ||
var uppercase = Bytes.uppercase; | ||
function index_rec(s, lim, _i, c) { | ||
while(true) { | ||
var i = _i; | ||
if (i >= lim) { | ||
throw { | ||
RE_EXN_ID: "Not_found", | ||
Error: new Error() | ||
}; | ||
} | ||
if (s[i] === c) { | ||
return i; | ||
} | ||
_i = i + 1 | 0; | ||
continue ; | ||
}; | ||
} | ||
var lowercase = Bytes.lowercase; | ||
function index(s, c) { | ||
return index_rec(s, s.length, 0, c); | ||
} | ||
var capitalize = Bytes.capitalize; | ||
function index_rec_opt(s, lim, _i, c) { | ||
while(true) { | ||
var i = _i; | ||
if (i >= lim) { | ||
return ; | ||
} | ||
if (s[i] === c) { | ||
return i; | ||
} | ||
_i = i + 1 | 0; | ||
continue ; | ||
}; | ||
} | ||
var uncapitalize = Bytes.uncapitalize; | ||
function index_opt(s, c) { | ||
return index_rec_opt(s, s.length, 0, c); | ||
} | ||
var uppercase_ascii = Bytes.uppercase_ascii; | ||
function index_from(s, i, c) { | ||
var l = s.length; | ||
if (i < 0 || i > l) { | ||
throw { | ||
RE_EXN_ID: "Invalid_argument", | ||
_1: "String.index_from / Bytes.index_from", | ||
Error: new Error() | ||
}; | ||
} | ||
return index_rec(s, l, i, c); | ||
} | ||
var lowercase_ascii = Bytes.lowercase_ascii; | ||
function index_from_opt(s, i, c) { | ||
var l = s.length; | ||
if (i < 0 || i > l) { | ||
throw { | ||
RE_EXN_ID: "Invalid_argument", | ||
_1: "String.index_from_opt / Bytes.index_from_opt", | ||
Error: new Error() | ||
}; | ||
} | ||
return index_rec_opt(s, l, i, c); | ||
} | ||
var capitalize_ascii = Bytes.capitalize_ascii; | ||
function rindex_rec(s, _i, c) { | ||
while(true) { | ||
var i = _i; | ||
if (i < 0) { | ||
throw { | ||
RE_EXN_ID: "Not_found", | ||
Error: new Error() | ||
}; | ||
} | ||
if (s[i] === c) { | ||
return i; | ||
} | ||
_i = i - 1 | 0; | ||
continue ; | ||
}; | ||
} | ||
var uncapitalize_ascii = Bytes.uncapitalize_ascii; | ||
function rindex(s, c) { | ||
return rindex_rec(s, s.length - 1 | 0, c); | ||
} | ||
var compare = Bytes.compare; | ||
function rindex_from(s, i, c) { | ||
if (i < -1 || i >= s.length) { | ||
throw { | ||
RE_EXN_ID: "Invalid_argument", | ||
_1: "String.rindex_from / Bytes.rindex_from", | ||
Error: new Error() | ||
}; | ||
} | ||
return rindex_rec(s, i, c); | ||
} | ||
var equal = Bytes.equal; | ||
function rindex_rec_opt(s, _i, c) { | ||
while(true) { | ||
var i = _i; | ||
if (i < 0) { | ||
return ; | ||
} | ||
if (s[i] === c) { | ||
return i; | ||
} | ||
_i = i - 1 | 0; | ||
continue ; | ||
}; | ||
} | ||
var unsafe_to_string = Bytes.unsafe_to_string; | ||
function rindex_opt(s, c) { | ||
return rindex_rec_opt(s, s.length - 1 | 0, c); | ||
} | ||
var unsafe_of_string = Bytes.unsafe_of_string; | ||
function rindex_from_opt(s, i, c) { | ||
if (i < -1 || i >= s.length) { | ||
throw { | ||
RE_EXN_ID: "Invalid_argument", | ||
_1: "String.rindex_from_opt / Bytes.rindex_from_opt", | ||
Error: new Error() | ||
}; | ||
} | ||
return rindex_rec_opt(s, i, c); | ||
} | ||
function contains_from(s, i, c) { | ||
var l = s.length; | ||
if (i < 0 || i > l) { | ||
throw { | ||
RE_EXN_ID: "Invalid_argument", | ||
_1: "String.contains_from / Bytes.contains_from", | ||
Error: new Error() | ||
}; | ||
} | ||
try { | ||
index_rec(s, l, i, c); | ||
return true; | ||
} | ||
catch (raw_exn){ | ||
var exn = Caml_js_exceptions.internalToOCamlException(raw_exn); | ||
if (exn.RE_EXN_ID === "Not_found") { | ||
return false; | ||
} | ||
throw exn; | ||
} | ||
} | ||
function contains(s, c) { | ||
return contains_from(s, 0, c); | ||
} | ||
function rcontains_from(s, i, c) { | ||
if (i < 0 || i >= s.length) { | ||
throw { | ||
RE_EXN_ID: "Invalid_argument", | ||
_1: "String.rcontains_from / Bytes.rcontains_from", | ||
Error: new Error() | ||
}; | ||
} | ||
try { | ||
rindex_rec(s, i, c); | ||
return true; | ||
} | ||
catch (raw_exn){ | ||
var exn = Caml_js_exceptions.internalToOCamlException(raw_exn); | ||
if (exn.RE_EXN_ID === "Not_found") { | ||
return false; | ||
} | ||
throw exn; | ||
} | ||
} | ||
var compare = Caml_bytes.bytes_compare; | ||
var equal = Caml_bytes.bytes_equal; | ||
var unsafe_to_string = to_string; | ||
var unsafe_of_string = of_string; | ||
exports.make = make; | ||
@@ -122,6 +694,2 @@ exports.init = init; | ||
exports.rcontains_from = rcontains_from; | ||
exports.uppercase = uppercase; | ||
exports.lowercase = lowercase; | ||
exports.capitalize = capitalize; | ||
exports.uncapitalize = uncapitalize; | ||
exports.uppercase_ascii = uppercase_ascii; | ||
@@ -128,0 +696,0 @@ exports.lowercase_ascii = lowercase_ascii; |
@@ -67,3 +67,2 @@ 'use strict'; | ||
xs[index] = newval; | ||
} | ||
@@ -108,3 +107,2 @@ | ||
} | ||
} | ||
@@ -111,0 +109,0 @@ |
@@ -13,3 +13,2 @@ 'use strict'; | ||
s[i] = ch; | ||
} | ||
@@ -28,13 +27,3 @@ | ||
function caml_fill_bytes(s, i, l, c) { | ||
if (l <= 0) { | ||
return ; | ||
} | ||
for(var k = i ,k_finish = l + i | 0; k < k_finish; ++k){ | ||
s[k] = c; | ||
} | ||
} | ||
function caml_create_bytes(len) { | ||
function create(len) { | ||
if (len < 0) { | ||
@@ -54,95 +43,3 @@ throw { | ||
function caml_blit_bytes(s1, i1, s2, i2, len) { | ||
if (len <= 0) { | ||
return ; | ||
} | ||
if (s1 === s2) { | ||
if (i1 < i2) { | ||
var range_a = (s1.length - i2 | 0) - 1 | 0; | ||
var range_b = len - 1 | 0; | ||
var range = range_a > range_b ? range_b : range_a; | ||
for(var j = range; j >= 0; --j){ | ||
s1[i2 + j | 0] = s1[i1 + j | 0]; | ||
} | ||
return ; | ||
} | ||
if (i1 <= i2) { | ||
return ; | ||
} | ||
var range_a$1 = (s1.length - i1 | 0) - 1 | 0; | ||
var range_b$1 = len - 1 | 0; | ||
var range$1 = range_a$1 > range_b$1 ? range_b$1 : range_a$1; | ||
for(var k = 0; k <= range$1; ++k){ | ||
s1[i2 + k | 0] = s1[i1 + k | 0]; | ||
} | ||
return ; | ||
} | ||
var off1 = s1.length - i1 | 0; | ||
if (len <= off1) { | ||
for(var i = 0; i < len; ++i){ | ||
s2[i2 + i | 0] = s1[i1 + i | 0]; | ||
} | ||
return ; | ||
} | ||
for(var i$1 = 0; i$1 < off1; ++i$1){ | ||
s2[i2 + i$1 | 0] = s1[i1 + i$1 | 0]; | ||
} | ||
for(var i$2 = off1; i$2 < len; ++i$2){ | ||
s2[i2 + i$2 | 0] = /* '\000' */0; | ||
} | ||
} | ||
function bytes_to_string(a) { | ||
var i = 0; | ||
var len = a.length; | ||
var s = ""; | ||
var s_len = len; | ||
if (i === 0 && len <= 4096 && len === a.length) { | ||
return String.fromCharCode.apply(null, a); | ||
} | ||
var offset = 0; | ||
while(s_len > 0) { | ||
var next = s_len < 1024 ? s_len : 1024; | ||
var tmp_bytes = new Array(next); | ||
for(var k = 0; k < next; ++k){ | ||
tmp_bytes[k] = a[k + offset | 0]; | ||
} | ||
s = s + String.fromCharCode.apply(null, tmp_bytes); | ||
s_len = s_len - next | 0; | ||
offset = offset + next | 0; | ||
}; | ||
return s; | ||
} | ||
function caml_blit_string(s1, i1, s2, i2, len) { | ||
if (len <= 0) { | ||
return ; | ||
} | ||
var off1 = s1.length - i1 | 0; | ||
if (len <= off1) { | ||
for(var i = 0; i < len; ++i){ | ||
s2[i2 + i | 0] = s1.charCodeAt(i1 + i | 0); | ||
} | ||
return ; | ||
} | ||
for(var i$1 = 0; i$1 < off1; ++i$1){ | ||
s2[i2 + i$1 | 0] = s1.charCodeAt(i1 + i$1 | 0); | ||
} | ||
for(var i$2 = off1; i$2 < len; ++i$2){ | ||
s2[i2 + i$2 | 0] = /* '\000' */0; | ||
} | ||
} | ||
function bytes_of_string(s) { | ||
var len = s.length; | ||
var res = new Array(len); | ||
for(var i = 0; i < len; ++i){ | ||
res[i] = s.charCodeAt(i); | ||
} | ||
return res; | ||
} | ||
function caml_bytes_compare_aux(s1, s2, _off, len, def) { | ||
function bytes_compare_aux(s1, s2, _off, len, def) { | ||
while(true) { | ||
@@ -166,15 +63,15 @@ var off = _off; | ||
function caml_bytes_compare(s1, s2) { | ||
function bytes_compare(s1, s2) { | ||
var len1 = s1.length; | ||
var len2 = s2.length; | ||
if (len1 === len2) { | ||
return caml_bytes_compare_aux(s1, s2, 0, len1, 0); | ||
return bytes_compare_aux(s1, s2, 0, len1, 0); | ||
} else if (len1 < len2) { | ||
return caml_bytes_compare_aux(s1, s2, 0, len1, -1); | ||
return bytes_compare_aux(s1, s2, 0, len1, -1); | ||
} else { | ||
return caml_bytes_compare_aux(s1, s2, 0, len2, 1); | ||
return bytes_compare_aux(s1, s2, 0, len2, 1); | ||
} | ||
} | ||
function caml_bytes_equal(s1, s2) { | ||
function bytes_equal(s1, s2) { | ||
var len1 = s1.length; | ||
@@ -202,32 +99,27 @@ var len2 = s2.length; | ||
function caml_bytes_greaterthan(s1, s2) { | ||
return caml_bytes_compare(s1, s2) > 0; | ||
function bytes_greaterthan(s1, s2) { | ||
return bytes_compare(s1, s2) > 0; | ||
} | ||
function caml_bytes_greaterequal(s1, s2) { | ||
return caml_bytes_compare(s1, s2) >= 0; | ||
function bytes_greaterequal(s1, s2) { | ||
return bytes_compare(s1, s2) >= 0; | ||
} | ||
function caml_bytes_lessthan(s1, s2) { | ||
return caml_bytes_compare(s1, s2) < 0; | ||
function bytes_lessthan(s1, s2) { | ||
return bytes_compare(s1, s2) < 0; | ||
} | ||
function caml_bytes_lessequal(s1, s2) { | ||
return caml_bytes_compare(s1, s2) <= 0; | ||
function bytes_lessequal(s1, s2) { | ||
return bytes_compare(s1, s2) <= 0; | ||
} | ||
exports.caml_create_bytes = caml_create_bytes; | ||
exports.caml_fill_bytes = caml_fill_bytes; | ||
exports.create = create; | ||
exports.get = get; | ||
exports.set = set; | ||
exports.bytes_to_string = bytes_to_string; | ||
exports.caml_blit_bytes = caml_blit_bytes; | ||
exports.caml_blit_string = caml_blit_string; | ||
exports.bytes_of_string = bytes_of_string; | ||
exports.caml_bytes_compare = caml_bytes_compare; | ||
exports.caml_bytes_greaterthan = caml_bytes_greaterthan; | ||
exports.caml_bytes_greaterequal = caml_bytes_greaterequal; | ||
exports.caml_bytes_lessthan = caml_bytes_lessthan; | ||
exports.caml_bytes_lessequal = caml_bytes_lessequal; | ||
exports.caml_bytes_equal = caml_bytes_equal; | ||
exports.bytes_compare = bytes_compare; | ||
exports.bytes_greaterthan = bytes_greaterthan; | ||
exports.bytes_greaterequal = bytes_greaterequal; | ||
exports.bytes_lessthan = bytes_lessthan; | ||
exports.bytes_lessequal = bytes_lessequal; | ||
exports.bytes_equal = bytes_equal; | ||
/* No side effect */ |
@@ -13,3 +13,3 @@ 'use strict'; | ||
function caml_is_extension(e) { | ||
function is_extension(e) { | ||
if (e == null) { | ||
@@ -22,3 +22,3 @@ return false; | ||
function caml_exn_slot_name(x) { | ||
function exn_slot_name(x) { | ||
return x.RE_EXN_ID; | ||
@@ -29,4 +29,4 @@ } | ||
exports.create = create; | ||
exports.caml_is_extension = caml_is_extension; | ||
exports.caml_exn_slot_name = caml_exn_slot_name; | ||
exports.is_extension = is_extension; | ||
exports.exn_slot_name = exn_slot_name; | ||
/* No side effect */ |
'use strict'; | ||
var caml_int32_float_of_bits = (function(x){ | ||
var int_float_of_bits = (function(x){ | ||
return new Float32Array(new Int32Array([x]).buffer)[0] | ||
}); | ||
var caml_int32_bits_of_float = (function(x){ | ||
var int_bits_of_float = (function(x){ | ||
return new Int32Array(new Float32Array([x]).buffer)[0] | ||
}); | ||
function caml_modf_float(x) { | ||
function modf_float(x) { | ||
if (!isFinite(x)) { | ||
@@ -43,3 +43,3 @@ if (isNaN(x)) { | ||
function caml_ldexp_float(x, exp) { | ||
function ldexp_float(x, exp) { | ||
var x$p = x; | ||
@@ -62,3 +62,3 @@ var exp$p = exp; | ||
function caml_frexp_float(x) { | ||
function frexp_float(x) { | ||
if (x === 0 || !isFinite(x)) { | ||
@@ -87,3 +87,3 @@ return [ | ||
function caml_copysign_float(x, y) { | ||
function copysign_float(x, y) { | ||
var x$1 = Math.abs(x); | ||
@@ -98,3 +98,3 @@ var y$1 = y === 0 ? 1 / y : y; | ||
function caml_expm1_float(x) { | ||
function expm1_float(x) { | ||
var y = Math.exp(x); | ||
@@ -111,3 +111,3 @@ var z = y - 1; | ||
function caml_hypot_float(x, y) { | ||
function hypot_float(x, y) { | ||
var x0 = Math.abs(x); | ||
@@ -124,15 +124,10 @@ var y0 = Math.abs(y); | ||
function caml_log10_float(x) { | ||
return Math.LOG10E * Math.log(x); | ||
} | ||
exports.caml_int32_float_of_bits = caml_int32_float_of_bits; | ||
exports.caml_int32_bits_of_float = caml_int32_bits_of_float; | ||
exports.caml_modf_float = caml_modf_float; | ||
exports.caml_ldexp_float = caml_ldexp_float; | ||
exports.caml_frexp_float = caml_frexp_float; | ||
exports.caml_copysign_float = caml_copysign_float; | ||
exports.caml_expm1_float = caml_expm1_float; | ||
exports.caml_hypot_float = caml_hypot_float; | ||
exports.caml_log10_float = caml_log10_float; | ||
exports.int_float_of_bits = int_float_of_bits; | ||
exports.int_bits_of_float = int_bits_of_float; | ||
exports.modf_float = modf_float; | ||
exports.ldexp_float = ldexp_float; | ||
exports.frexp_float = frexp_float; | ||
exports.copysign_float = copysign_float; | ||
exports.expm1_float = expm1_float; | ||
exports.hypot_float = hypot_float; | ||
/* No side effect */ |
@@ -44,3 +44,3 @@ 'use strict'; | ||
var i = 0; | ||
var match = s.charCodeAt(i); | ||
var match = s.codePointAt(i); | ||
switch (match) { | ||
@@ -59,4 +59,4 @@ case 43 : | ||
} | ||
if (s[i] === "0") { | ||
var match$1 = s.charCodeAt(i + 1 | 0); | ||
if (s.codePointAt(i) === /* '0' */48) { | ||
var match$1 = s.codePointAt(i + 1 | 0); | ||
if (match$1 >= 89) { | ||
@@ -132,3 +132,3 @@ if (match$1 >= 111) { | ||
function caml_int_of_string(s) { | ||
function int_of_string(s) { | ||
var match = parse_sign_and_base(s); | ||
@@ -139,3 +139,3 @@ var i = match[0]; | ||
var len = s.length; | ||
var c = i < len ? s.charCodeAt(i) : /* '\000' */0; | ||
var c = i < len ? s.codePointAt(i) : /* '\000' */0; | ||
var d = parse_digit(c); | ||
@@ -156,3 +156,3 @@ if (d < 0 || d >= base) { | ||
} | ||
var a = s.charCodeAt(k); | ||
var a = s.codePointAt(k); | ||
if (a === /* '_' */95) { | ||
@@ -195,3 +195,3 @@ _k = k + 1 | 0; | ||
function caml_int64_of_string(s) { | ||
function int64_of_string(s) { | ||
var match = parse_sign_and_base(s); | ||
@@ -228,3 +228,3 @@ var hbase = match[2]; | ||
var len = s.length; | ||
var c = i < len ? s.charCodeAt(i) : /* '\000' */0; | ||
var c = i < len ? s.codePointAt(i) : /* '\000' */0; | ||
var d = Caml_int64.of_int32(parse_digit(c)); | ||
@@ -245,3 +245,3 @@ if (Caml.i64_lt(d, Caml_int64.zero) || Caml.i64_ge(d, base)) { | ||
} | ||
var a = s.charCodeAt(k); | ||
var a = s.codePointAt(k); | ||
if (a === /* '_' */95) { | ||
@@ -328,3 +328,3 @@ _k = k + 1 | 0; | ||
} | ||
var c = fmt.charCodeAt(i); | ||
var c = fmt.codePointAt(i); | ||
var exit = 0; | ||
@@ -420,7 +420,7 @@ if (c >= 69) { | ||
return function () { | ||
var w = fmt.charCodeAt(j) - /* '0' */48 | 0; | ||
var w = fmt.codePointAt(j) - /* '0' */48 | 0; | ||
return w >= 0 && w <= 9; | ||
} | ||
}(j))()) { | ||
f.prec = (Math.imul(f.prec, 10) + fmt.charCodeAt(j) | 0) - /* '0' */48 | 0; | ||
f.prec = (Math.imul(f.prec, 10) + fmt.codePointAt(j) | 0) - /* '0' */48 | 0; | ||
j = j + 1 | 0; | ||
@@ -475,7 +475,7 @@ }; | ||
return function () { | ||
var w = fmt.charCodeAt(j$1) - /* '0' */48 | 0; | ||
var w = fmt.codePointAt(j$1) - /* '0' */48 | 0; | ||
return w >= 0 && w <= 9; | ||
} | ||
}(j$1))()) { | ||
f.width = (Math.imul(f.width, 10) + fmt.charCodeAt(j$1) | 0) - /* '0' */48 | 0; | ||
f.width = (Math.imul(f.width, 10) + fmt.codePointAt(j$1) | 0) - /* '0' */48 | 0; | ||
j$1 = j$1 + 1 | 0; | ||
@@ -556,3 +556,3 @@ }; | ||
function caml_format_int(fmt, i) { | ||
function format_int(fmt, i) { | ||
if (fmt === "%d") { | ||
@@ -635,3 +635,3 @@ return String(i); | ||
function caml_int64_format(fmt, x) { | ||
function int64_format(fmt, x) { | ||
if (fmt === "%d") { | ||
@@ -667,3 +667,3 @@ return Caml_int64.to_string(x); | ||
function caml_format_float(fmt, x) { | ||
function format_float(fmt, x) { | ||
var f = parse_format(fmt); | ||
@@ -682,3 +682,3 @@ var prec = f.prec < 0 ? 6 : f.prec; | ||
var i = s.length; | ||
if (s[i - 3 | 0] === "e") { | ||
if (s.codePointAt(i - 3 | 0) === /* 'e' */101) { | ||
s = s.slice(0, i - 1 | 0) + ("0" + s.slice(i - 1 | 0)); | ||
@@ -697,6 +697,6 @@ } | ||
var i$1 = j - 1 | 0; | ||
while(s[i$1] === "0") { | ||
while(s.codePointAt(i$1) === /* '0' */48) { | ||
i$1 = i$1 - 1 | 0; | ||
}; | ||
if (s[i$1] === ".") { | ||
if (s.codePointAt(i$1) === /* '.' */46) { | ||
i$1 = i$1 - 1 | 0; | ||
@@ -706,3 +706,3 @@ } | ||
var i$2 = s.length; | ||
if (s[i$2 - 3 | 0] === "e") { | ||
if (s.codePointAt(i$2 - 3 | 0) === /* 'e' */101) { | ||
s = s.slice(0, i$2 - 1 | 0) + ("0" + s.slice(i$2 - 1 | 0)); | ||
@@ -726,6 +726,6 @@ } | ||
var k = s.length - 1 | 0; | ||
while(s[k] === "0") { | ||
while(s.codePointAt(k) === /* '0' */48) { | ||
k = k - 1 | 0; | ||
}; | ||
if (s[k] === ".") { | ||
if (s.codePointAt(k) === /* '.' */46) { | ||
k = k - 1 | 0; | ||
@@ -748,3 +748,3 @@ } | ||
var caml_hexstring_of_float = (function(x,prec,style){ | ||
var hexstring_of_float = (function(x,prec,style){ | ||
if (!isFinite(x)) { | ||
@@ -821,3 +821,3 @@ if (isNaN(x)) return "nan"; | ||
function caml_float_of_string(s) { | ||
function float_of_string$1(s) { | ||
return float_of_string(s, { | ||
@@ -829,21 +829,9 @@ RE_EXN_ID: "Failure", | ||
var caml_nativeint_format = caml_format_int; | ||
var caml_int32_format = caml_format_int; | ||
var caml_int32_of_string = caml_int_of_string; | ||
var caml_nativeint_of_string = caml_int_of_string; | ||
exports.caml_format_float = caml_format_float; | ||
exports.caml_hexstring_of_float = caml_hexstring_of_float; | ||
exports.caml_format_int = caml_format_int; | ||
exports.caml_nativeint_format = caml_nativeint_format; | ||
exports.caml_int32_format = caml_int32_format; | ||
exports.caml_float_of_string = caml_float_of_string; | ||
exports.caml_int64_format = caml_int64_format; | ||
exports.caml_int_of_string = caml_int_of_string; | ||
exports.caml_int32_of_string = caml_int32_of_string; | ||
exports.caml_int64_of_string = caml_int64_of_string; | ||
exports.caml_nativeint_of_string = caml_nativeint_of_string; | ||
exports.format_float = format_float; | ||
exports.hexstring_of_float = hexstring_of_float; | ||
exports.format_int = format_int; | ||
exports.float_of_string = float_of_string$1; | ||
exports.int64_format = int64_format; | ||
exports.int_of_string = int_of_string; | ||
exports.int64_of_string = int64_of_string; | ||
/* No side effect */ |
@@ -8,3 +8,3 @@ 'use strict'; | ||
function caml_hash_mix_int(h, d) { | ||
function hash_mix_int(h, d) { | ||
var d$1 = d; | ||
@@ -19,3 +19,3 @@ d$1 = Math.imul(d$1, -862048943); | ||
function caml_hash_final_mix(h) { | ||
function hash_final_mix(h) { | ||
var h$1 = h ^ (h >>> 16); | ||
@@ -28,3 +28,3 @@ h$1 = Math.imul(h$1, -2048144789); | ||
function caml_hash_mix_string(h, s) { | ||
function hash_mix_string(h, s) { | ||
var len = s.length; | ||
@@ -36,3 +36,3 @@ var block = (len / 4 | 0) - 1 | 0; | ||
var w = s.charCodeAt(j) | (s.charCodeAt(j + 1 | 0) << 8) | (s.charCodeAt(j + 2 | 0) << 16) | (s.charCodeAt(j + 3 | 0) << 24); | ||
hash = caml_hash_mix_int(hash, w); | ||
hash = hash_mix_int(hash, w); | ||
} | ||
@@ -44,3 +44,3 @@ var modulo = len & 3; | ||
); | ||
hash = caml_hash_mix_int(hash, w$1); | ||
hash = hash_mix_int(hash, w$1); | ||
} | ||
@@ -51,5 +51,5 @@ hash = hash ^ len; | ||
exports.caml_hash_mix_int = caml_hash_mix_int; | ||
exports.caml_hash_mix_string = caml_hash_mix_string; | ||
exports.caml_hash_final_mix = caml_hash_final_mix; | ||
exports.hash_mix_int = hash_mix_int; | ||
exports.hash_mix_string = hash_mix_string; | ||
exports.hash_final_mix = hash_final_mix; | ||
/* No side effect */ |
@@ -20,3 +20,2 @@ 'use strict'; | ||
} | ||
} | ||
@@ -38,12 +37,12 @@ | ||
function caml_hash(count, _limit, seed, obj) { | ||
var hash = seed; | ||
function hash(count, _limit, seed, obj) { | ||
var s = seed; | ||
if (typeof obj === "number") { | ||
var u = obj | 0; | ||
hash = Caml_hash_primitive.caml_hash_mix_int(hash, (u + u | 0) + 1 | 0); | ||
return Caml_hash_primitive.caml_hash_final_mix(hash); | ||
s = Caml_hash_primitive.hash_mix_int(s, (u + u | 0) + 1 | 0); | ||
return Caml_hash_primitive.hash_final_mix(s); | ||
} | ||
if (typeof obj === "string") { | ||
hash = Caml_hash_primitive.caml_hash_mix_string(hash, obj); | ||
return Caml_hash_primitive.caml_hash_final_mix(hash); | ||
s = Caml_hash_primitive.hash_mix_string(s, obj); | ||
return Caml_hash_primitive.hash_final_mix(s); | ||
} | ||
@@ -62,6 +61,6 @@ var queue = { | ||
var u$1 = obj$1 | 0; | ||
hash = Caml_hash_primitive.caml_hash_mix_int(hash, (u$1 + u$1 | 0) + 1 | 0); | ||
s = Caml_hash_primitive.hash_mix_int(s, (u$1 + u$1 | 0) + 1 | 0); | ||
num = num - 1 | 0; | ||
} else if (typeof obj$1 === "string") { | ||
hash = Caml_hash_primitive.caml_hash_mix_string(hash, obj$1); | ||
s = Caml_hash_primitive.hash_mix_string(s, obj$1); | ||
num = num - 1 | 0; | ||
@@ -74,5 +73,5 @@ } else if (typeof obj$1 !== "boolean" && typeof obj$1 !== "undefined" && typeof obj$1 !== "symbol" && typeof obj$1 !== "function") { | ||
if (obj_tag === 248) { | ||
hash = Caml_hash_primitive.caml_hash_mix_int(hash, obj$1[1]); | ||
s = Caml_hash_primitive.hash_mix_int(s, obj$1[1]); | ||
} else { | ||
hash = Caml_hash_primitive.caml_hash_mix_int(hash, tag); | ||
s = Caml_hash_primitive.hash_mix_int(s, tag); | ||
var v = size - 1 | 0; | ||
@@ -93,5 +92,5 @@ var block = v < num ? v : num; | ||
})(obj$1, (function (v) { | ||
return push_back(queue, v); | ||
push_back(queue, v); | ||
})); | ||
hash = Caml_hash_primitive.caml_hash_mix_int(hash, (size$1 << 10) | 0); | ||
s = Caml_hash_primitive.hash_mix_int(s, (size$1 << 10) | 0); | ||
} | ||
@@ -101,6 +100,6 @@ } | ||
}; | ||
return Caml_hash_primitive.caml_hash_final_mix(hash); | ||
return Caml_hash_primitive.hash_final_mix(s); | ||
} | ||
exports.caml_hash = caml_hash; | ||
exports.hash = hash; | ||
/* No side effect */ |
@@ -81,2 +81,10 @@ 'use strict'; | ||
function equal(x, y) { | ||
if (x[1] === y[1]) { | ||
return x[0] === y[0]; | ||
} else { | ||
return false; | ||
} | ||
} | ||
function equal_null(x, y) { | ||
@@ -582,2 +590,3 @@ if (y !== null) { | ||
exports.and_ = and_; | ||
exports.equal = equal; | ||
exports.equal_null = equal_null; | ||
@@ -584,0 +593,0 @@ exports.equal_undefined = equal_undefined; |
@@ -6,10 +6,10 @@ 'use strict'; | ||
var $$Error = /* @__PURE__ */Caml_exceptions.create("Caml_js_exceptions.Error"); | ||
var $$Error = "JsError"; | ||
function internalToOCamlException(e) { | ||
if (Caml_exceptions.caml_is_extension(e)) { | ||
if (Caml_exceptions.is_extension(e)) { | ||
return e; | ||
} else { | ||
return { | ||
RE_EXN_ID: $$Error, | ||
RE_EXN_ID: "JsError", | ||
_1: e | ||
@@ -20,3 +20,3 @@ }; | ||
function caml_as_js_exn(exn) { | ||
function as_js_exn(exn) { | ||
if (exn.RE_EXN_ID === $$Error) { | ||
@@ -30,3 +30,3 @@ return Caml_option.some(exn._1); | ||
exports.internalToOCamlException = internalToOCamlException; | ||
exports.caml_as_js_exn = caml_as_js_exn; | ||
exports.as_js_exn = as_js_exn; | ||
/* No side effect */ |
@@ -106,3 +106,3 @@ 'use strict'; | ||
function caml_lex_engine(tbls, i, buf) { | ||
function lex_engine(tbls, i, buf) { | ||
return caml_lex_engine_aux(tbls, i, buf, { | ||
@@ -248,3 +248,3 @@ RE_EXN_ID: "Failure", | ||
function caml_new_lex_engine(tbl, i, buf) { | ||
function new_lex_engine(tbl, i, buf) { | ||
return caml_new_lex_engine_aux(tbl, i, buf, { | ||
@@ -256,4 +256,4 @@ RE_EXN_ID: "Failure", | ||
exports.caml_lex_engine = caml_lex_engine; | ||
exports.caml_new_lex_engine = caml_new_lex_engine; | ||
exports.lex_engine = lex_engine; | ||
exports.new_lex_engine = new_lex_engine; | ||
/* Not a pure module */ |
@@ -98,3 +98,2 @@ 'use strict'; | ||
x[3] = d + x[3] | 0; | ||
} | ||
@@ -128,3 +127,3 @@ | ||
function caml_md5_string(s, start, len) { | ||
function md5_string(s, start, len) { | ||
var s$1 = s.slice(start, len); | ||
@@ -168,3 +167,3 @@ var n = s$1.length; | ||
exports.caml_md5_string = caml_md5_string; | ||
exports.md5_string = md5_string; | ||
/* No side effect */ |
@@ -8,3 +8,3 @@ 'use strict'; | ||
var caml_obj_dup = (function(x){ | ||
var obj_dup = (function(x){ | ||
if(Array.isArray(x)){ | ||
@@ -40,3 +40,3 @@ var len = x.length | ||
function caml_compare(a, b) { | ||
function compare(a, b) { | ||
if (a === b) { | ||
@@ -50,3 +50,3 @@ return 0; | ||
if (b_type === "boolean") { | ||
return Caml.caml_bool_compare(a, b); | ||
return Caml.bool_compare(a, b); | ||
} | ||
@@ -65,3 +65,3 @@ break; | ||
if (b_type === "number") { | ||
return Caml.caml_int_compare(a, b); | ||
return Caml.int_compare(a, b); | ||
} | ||
@@ -71,3 +71,3 @@ break; | ||
if (b_type === "string") { | ||
return Caml.caml_string_compare(a, b); | ||
return Caml.string_compare(a, b); | ||
} else { | ||
@@ -137,3 +137,3 @@ return 1; | ||
if (tag_a === 248) { | ||
return Caml.caml_int_compare(a[1], b[1]); | ||
return Caml.int_compare(a[1], b[1]); | ||
} | ||
@@ -164,3 +164,3 @@ if (tag_a === 251) { | ||
} | ||
var res = caml_compare(a[i], b[i]); | ||
var res = compare(a[i], b[i]); | ||
if (res !== 0) { | ||
@@ -184,3 +184,3 @@ return res; | ||
} | ||
var res$1 = caml_compare(a[i$1], b[i$1]); | ||
var res$1 = compare(a[i$1], b[i$1]); | ||
if (res$1 !== 0) { | ||
@@ -199,3 +199,3 @@ return res$1; | ||
} | ||
var res$2 = caml_compare(a[i$2], b[i$2]); | ||
var res$2 = compare(a[i$2], b[i$2]); | ||
if (res$2 !== 0) { | ||
@@ -221,3 +221,3 @@ return res$2; | ||
var b = param[1]; | ||
if (!(!b.hasOwnProperty(key) || caml_compare(param[0][key], b[key]) > 0)) { | ||
if (!(!Object.prototype.hasOwnProperty.call(b, key) || compare(param[0][key], b[key]) > 0)) { | ||
return ; | ||
@@ -255,3 +255,3 @@ } | ||
if (match$1 !== undefined) { | ||
return Caml.caml_string_compare(match, match$1); | ||
return Caml.string_compare(match, match$1); | ||
} else { | ||
@@ -267,3 +267,3 @@ return -1; | ||
function caml_equal(a, b) { | ||
function equal(a, b) { | ||
if (a === b) { | ||
@@ -312,3 +312,3 @@ return true; | ||
} | ||
if (!caml_equal(a[i], b[i])) { | ||
if (!equal(a[i], b[i])) { | ||
return false; | ||
@@ -326,3 +326,3 @@ } | ||
var do_key_a = function (key) { | ||
if (!b.hasOwnProperty(key)) { | ||
if (!Object.prototype.hasOwnProperty.call(b, key)) { | ||
result.contents = false; | ||
@@ -334,3 +334,3 @@ return ; | ||
var do_key_b = function (key) { | ||
if (!a.hasOwnProperty(key) || !caml_equal(b[key], a[key])) { | ||
if (!Object.prototype.hasOwnProperty.call(a, key) || !equal(b[key], a[key])) { | ||
result.contents = false; | ||
@@ -352,5 +352,5 @@ return ; | ||
function caml_equal_null(x, y) { | ||
function equal_null(x, y) { | ||
if (y !== null) { | ||
return caml_equal(x, y); | ||
return equal(x, y); | ||
} else { | ||
@@ -361,5 +361,5 @@ return x === y; | ||
function caml_equal_undefined(x, y) { | ||
function equal_undefined(x, y) { | ||
if (y !== undefined) { | ||
return caml_equal(x, y); | ||
return equal(x, y); | ||
} else { | ||
@@ -370,32 +370,32 @@ return x === y; | ||
function caml_equal_nullable(x, y) { | ||
function equal_nullable(x, y) { | ||
if (y == null) { | ||
return x === y; | ||
} else { | ||
return caml_equal(x, y); | ||
return equal(x, y); | ||
} | ||
} | ||
function caml_notequal(a, b) { | ||
return !caml_equal(a, b); | ||
function notequal(a, b) { | ||
return !equal(a, b); | ||
} | ||
function caml_greaterequal(a, b) { | ||
return caml_compare(a, b) >= 0; | ||
function greaterequal(a, b) { | ||
return compare(a, b) >= 0; | ||
} | ||
function caml_greaterthan(a, b) { | ||
return caml_compare(a, b) > 0; | ||
function greaterthan(a, b) { | ||
return compare(a, b) > 0; | ||
} | ||
function caml_lessequal(a, b) { | ||
return caml_compare(a, b) <= 0; | ||
function lessequal(a, b) { | ||
return compare(a, b) <= 0; | ||
} | ||
function caml_lessthan(a, b) { | ||
return caml_compare(a, b) < 0; | ||
function lessthan(a, b) { | ||
return compare(a, b) < 0; | ||
} | ||
function caml_min(x, y) { | ||
if (caml_compare(x, y) <= 0) { | ||
function min(x, y) { | ||
if (compare(x, y) <= 0) { | ||
return x; | ||
@@ -407,4 +407,4 @@ } else { | ||
function caml_max(x, y) { | ||
if (caml_compare(x, y) >= 0) { | ||
function max(x, y) { | ||
if (compare(x, y) >= 0) { | ||
return x; | ||
@@ -416,16 +416,16 @@ } else { | ||
exports.caml_obj_dup = caml_obj_dup; | ||
exports.obj_dup = obj_dup; | ||
exports.update_dummy = update_dummy; | ||
exports.caml_compare = caml_compare; | ||
exports.caml_equal = caml_equal; | ||
exports.caml_equal_null = caml_equal_null; | ||
exports.caml_equal_undefined = caml_equal_undefined; | ||
exports.caml_equal_nullable = caml_equal_nullable; | ||
exports.caml_notequal = caml_notequal; | ||
exports.caml_greaterequal = caml_greaterequal; | ||
exports.caml_greaterthan = caml_greaterthan; | ||
exports.caml_lessthan = caml_lessthan; | ||
exports.caml_lessequal = caml_lessequal; | ||
exports.caml_min = caml_min; | ||
exports.caml_max = caml_max; | ||
exports.compare = compare; | ||
exports.equal = equal; | ||
exports.equal_null = equal_null; | ||
exports.equal_undefined = equal_undefined; | ||
exports.equal_nullable = equal_nullable; | ||
exports.notequal = notequal; | ||
exports.greaterequal = greaterequal; | ||
exports.greaterthan = greaterthan; | ||
exports.lessthan = lessthan; | ||
exports.lessequal = lessequal; | ||
exports.min = min; | ||
exports.max = max; | ||
/* No side effect */ |
@@ -68,3 +68,3 @@ 'use strict'; | ||
var caml_parse_engine = (function (tables /* parser_table */, env /* parser_env */, cmd /* parser_input*/, arg /* Obj.t*/) { | ||
var parse_engine = (function (tables /* parser_table */, env /* parser_env */, cmd /* parser_input*/, arg /* Obj.t*/) { | ||
var ERRCODE = 256; | ||
@@ -294,3 +294,3 @@ //var START = 0; | ||
var caml_set_parser_trace = (function (v) { | ||
var set_parser_trace = (function (v) { | ||
var old = PARSER_TRACE; | ||
@@ -301,4 +301,4 @@ PARSER_TRACE = v; | ||
exports.caml_parse_engine = caml_parse_engine; | ||
exports.caml_set_parser_trace = caml_set_parser_trace; | ||
exports.parse_engine = parse_engine; | ||
exports.set_parser_trace = set_parser_trace; | ||
/* Not a pure module */ |
@@ -18,2 +18,17 @@ 'use strict'; | ||
var spliceNewApply = (function (ctor,args){ | ||
var i, argLen; | ||
argLen = args.length | ||
var applied = [null] // Function.prototype.bind.apply(fn, args) requires the first element in `args` to be `null` | ||
for(i = 0; i < argLen - 1; ++i){ | ||
applied.push(args[i]) | ||
} | ||
var lastOne = args[argLen - 1] | ||
for(i = 0; i < lastOne.length; ++i ){ | ||
applied.push(lastOne[i]) | ||
} | ||
var C = Function.prototype.bind.apply(ctor, applied) | ||
return new C() | ||
}); | ||
var spliceObjApply = (function(obj,name,args){ | ||
@@ -34,3 +49,4 @@ var i, argLen; | ||
exports.spliceApply = spliceApply; | ||
exports.spliceNewApply = spliceNewApply; | ||
exports.spliceObjApply = spliceObjApply; | ||
/* No side effect */ |
@@ -12,3 +12,3 @@ 'use strict'; | ||
} | ||
return s.charCodeAt(i); | ||
return s.codePointAt(i); | ||
} | ||
@@ -15,0 +15,0 @@ |
'use strict'; | ||
function caml_sys_getenv(s) { | ||
function sys_getenv(s) { | ||
if (typeof process === "undefined" || process.env === undefined) { | ||
@@ -30,3 +30,3 @@ throw { | ||
function caml_sys_time(param) { | ||
function sys_time(param) { | ||
if (typeof process === "undefined" || process.uptime === undefined) { | ||
@@ -39,7 +39,3 @@ return -1; | ||
function caml_sys_system_command(_cmd) { | ||
return 127; | ||
} | ||
var caml_sys_getcwd = (function(param){ | ||
var sys_getcwd = (function(param){ | ||
if (typeof process === "undefined" || process.cwd === undefined){ | ||
@@ -51,3 +47,3 @@ return "/" | ||
function caml_sys_get_argv(param) { | ||
function sys_get_argv(param) { | ||
if (typeof process === "undefined") { | ||
@@ -73,3 +69,3 @@ return [ | ||
function caml_sys_exit(exit_code) { | ||
function sys_exit(exit_code) { | ||
if (typeof process !== "undefined") { | ||
@@ -81,6 +77,6 @@ return process.exit(exit_code); | ||
function caml_sys_is_directory(_s) { | ||
function sys_is_directory(_s) { | ||
throw { | ||
RE_EXN_ID: "Failure", | ||
_1: "caml_sys_is_directory not implemented", | ||
_1: "sys_is_directory not implemented", | ||
Error: new Error() | ||
@@ -90,6 +86,6 @@ }; | ||
function caml_sys_file_exists(_s) { | ||
function sys_file_exists(_s) { | ||
throw { | ||
RE_EXN_ID: "Failure", | ||
_1: "caml_sys_file_exists not implemented", | ||
_1: "sys_file_exists not implemented", | ||
Error: new Error() | ||
@@ -99,11 +95,10 @@ }; | ||
exports.caml_sys_getenv = caml_sys_getenv; | ||
exports.caml_sys_time = caml_sys_time; | ||
exports.sys_getenv = sys_getenv; | ||
exports.sys_time = sys_time; | ||
exports.os_type = os_type; | ||
exports.caml_sys_system_command = caml_sys_system_command; | ||
exports.caml_sys_getcwd = caml_sys_getcwd; | ||
exports.caml_sys_get_argv = caml_sys_get_argv; | ||
exports.caml_sys_exit = caml_sys_exit; | ||
exports.caml_sys_is_directory = caml_sys_is_directory; | ||
exports.caml_sys_file_exists = caml_sys_file_exists; | ||
exports.sys_getcwd = sys_getcwd; | ||
exports.sys_get_argv = sys_get_argv; | ||
exports.sys_exit = sys_exit; | ||
exports.sys_is_directory = sys_is_directory; | ||
exports.sys_file_exists = sys_file_exists; | ||
/* No side effect */ |
'use strict'; | ||
function caml_int_compare(x, y) { | ||
function int_compare(x, y) { | ||
if (x < y) { | ||
@@ -14,3 +14,3 @@ return -1; | ||
function caml_bool_compare(x, y) { | ||
function bool_compare(x, y) { | ||
if (x) { | ||
@@ -29,3 +29,3 @@ if (y) { | ||
function caml_float_compare(x, y) { | ||
function float_compare(x, y) { | ||
if (x === y) { | ||
@@ -44,3 +44,3 @@ return 0; | ||
function caml_string_compare(s1, s2) { | ||
function string_compare(s1, s2) { | ||
if (s1 === s2) { | ||
@@ -55,3 +55,3 @@ return 0; | ||
function caml_bool_min(x, y) { | ||
function bool_min(x, y) { | ||
if (x) { | ||
@@ -64,3 +64,3 @@ return y; | ||
function caml_int_min(x, y) { | ||
function int_min(x, y) { | ||
if (x < y) { | ||
@@ -73,3 +73,3 @@ return x; | ||
function caml_float_min(x, y) { | ||
function float_min(x, y) { | ||
if (x < y) { | ||
@@ -82,3 +82,3 @@ return x; | ||
function caml_string_min(x, y) { | ||
function string_min(x, y) { | ||
if (x < y) { | ||
@@ -91,11 +91,3 @@ return x; | ||
function caml_int32_min(x, y) { | ||
if (x < y) { | ||
return x; | ||
} else { | ||
return y; | ||
} | ||
} | ||
function caml_bool_max(x, y) { | ||
function bool_max(x, y) { | ||
if (x) { | ||
@@ -108,3 +100,3 @@ return x; | ||
function caml_int_max(x, y) { | ||
function int_max(x, y) { | ||
if (x > y) { | ||
@@ -117,3 +109,3 @@ return x; | ||
function caml_float_max(x, y) { | ||
function float_max(x, y) { | ||
if (x > y) { | ||
@@ -126,3 +118,3 @@ return x; | ||
function caml_string_max(x, y) { | ||
function string_max(x, y) { | ||
if (x > y) { | ||
@@ -135,10 +127,2 @@ return x; | ||
function caml_int32_max(x, y) { | ||
if (x > y) { | ||
return x; | ||
} else { | ||
return y; | ||
} | ||
} | ||
function i64_eq(x, y) { | ||
@@ -202,16 +186,14 @@ if (x[1] === y[1]) { | ||
exports.caml_int_compare = caml_int_compare; | ||
exports.caml_bool_compare = caml_bool_compare; | ||
exports.caml_float_compare = caml_float_compare; | ||
exports.caml_string_compare = caml_string_compare; | ||
exports.caml_bool_min = caml_bool_min; | ||
exports.caml_int_min = caml_int_min; | ||
exports.caml_float_min = caml_float_min; | ||
exports.caml_string_min = caml_string_min; | ||
exports.caml_int32_min = caml_int32_min; | ||
exports.caml_bool_max = caml_bool_max; | ||
exports.caml_int_max = caml_int_max; | ||
exports.caml_float_max = caml_float_max; | ||
exports.caml_string_max = caml_string_max; | ||
exports.caml_int32_max = caml_int32_max; | ||
exports.int_compare = int_compare; | ||
exports.bool_compare = bool_compare; | ||
exports.float_compare = float_compare; | ||
exports.string_compare = string_compare; | ||
exports.bool_min = bool_min; | ||
exports.int_min = int_min; | ||
exports.float_min = float_min; | ||
exports.string_min = string_min; | ||
exports.bool_max = bool_max; | ||
exports.int_max = int_max; | ||
exports.float_max = float_max; | ||
exports.string_max = string_max; | ||
exports.i64_eq = i64_eq; | ||
@@ -218,0 +200,0 @@ exports.i64_neq = i64_neq; |
'use strict'; | ||
var Char = require("./char.js"); | ||
var Bytes = require("./bytes.js"); | ||
var $$String = require("./string.js"); | ||
var Caml_md5 = require("./caml_md5.js"); | ||
var Caml_bytes = require("./caml_bytes.js"); | ||
var Pervasives = require("./pervasives.js"); | ||
var Caml_string = require("./caml_string.js"); | ||
var Caml_external_polyfill = require("./caml_external_polyfill.js"); | ||
function string(str) { | ||
return Caml_md5.caml_md5_string(str, 0, str.length); | ||
return Caml_md5.md5_string(str, 0, str.length); | ||
} | ||
function bytes(b) { | ||
return string(Caml_bytes.bytes_to_string(b)); | ||
return string(Bytes.unsafe_to_string(b)); | ||
} | ||
@@ -27,29 +26,9 @@ | ||
} | ||
return Caml_md5.caml_md5_string(str, ofs, len); | ||
return Caml_md5.md5_string(str, ofs, len); | ||
} | ||
function subbytes(b, ofs, len) { | ||
return substring(Caml_bytes.bytes_to_string(b), ofs, len); | ||
return substring(Bytes.unsafe_to_string(b), ofs, len); | ||
} | ||
function file(filename) { | ||
var ic = Pervasives.open_in_bin(filename); | ||
var d; | ||
try { | ||
d = Caml_external_polyfill.resolve("caml_md5_chan")(ic, -1); | ||
} | ||
catch (e){ | ||
Caml_external_polyfill.resolve("caml_ml_close_channel")(ic); | ||
throw e; | ||
} | ||
Caml_external_polyfill.resolve("caml_ml_close_channel")(ic); | ||
return d; | ||
} | ||
var output = Pervasives.output_string; | ||
function input(chan) { | ||
return Pervasives.really_input_string(chan, 16); | ||
} | ||
function char_hex(n) { | ||
@@ -69,3 +48,3 @@ return n + ( | ||
} | ||
var result = Caml_bytes.caml_create_bytes(32); | ||
var result = Caml_bytes.create(32); | ||
for(var i = 0; i <= 15; ++i){ | ||
@@ -76,3 +55,3 @@ var x = Caml_string.get(d, i); | ||
} | ||
return Caml_bytes.bytes_to_string(result); | ||
return Bytes.unsafe_to_string(result); | ||
} | ||
@@ -121,7 +100,7 @@ | ||
}; | ||
var result = Caml_bytes.caml_create_bytes(16); | ||
var result = Caml_bytes.create(16); | ||
for(var i = 0; i <= 15; ++i){ | ||
Caml_bytes.set(result, i, Char.chr($$byte((i << 1)))); | ||
} | ||
return Caml_bytes.bytes_to_string(result); | ||
return Bytes.unsafe_to_string(result); | ||
} | ||
@@ -139,7 +118,4 @@ | ||
exports.subbytes = subbytes; | ||
exports.file = file; | ||
exports.output = output; | ||
exports.input = input; | ||
exports.to_hex = to_hex; | ||
exports.from_hex = from_hex; | ||
/* No side effect */ |
@@ -11,3 +11,2 @@ 'use strict'; | ||
obj.setItem(k, v); | ||
} | ||
@@ -17,3 +16,2 @@ | ||
obj.removeItem(s); | ||
} | ||
@@ -20,0 +18,0 @@ |
@@ -7,11 +7,6 @@ 'use strict'; | ||
var $$Buffer = require("./buffer.js"); | ||
var Random = require("./random.js"); | ||
var $$String = require("./string.js"); | ||
var Caml_sys = require("./caml_sys.js"); | ||
var Caml_bytes = require("./caml_bytes.js"); | ||
var Pervasives = require("./pervasives.js"); | ||
var Caml_string = require("./caml_string.js"); | ||
var CamlinternalLazy = require("./camlinternalLazy.js"); | ||
var Caml_js_exceptions = require("./caml_js_exceptions.js"); | ||
var Caml_external_polyfill = require("./caml_external_polyfill.js"); | ||
@@ -127,3 +122,3 @@ function generic_basename(is_dir_sep, current_dir_name, name) { | ||
try { | ||
temp_dir_name = Caml_sys.caml_sys_getenv("TMPDIR"); | ||
temp_dir_name = Caml_sys.sys_getenv("TMPDIR"); | ||
} | ||
@@ -203,3 +198,3 @@ catch (raw_exn){ | ||
var s = $$String.sub(name, name.length - suff.length | 0, suff.length); | ||
return Caml_bytes.bytes_to_string(Bytes.lowercase_ascii(Caml_bytes.bytes_of_string(s))) === Caml_bytes.bytes_to_string(Bytes.lowercase_ascii(Caml_bytes.bytes_of_string(suff))); | ||
return Bytes.unsafe_to_string(Bytes.lowercase_ascii(Bytes.unsafe_of_string(s))) === Bytes.unsafe_to_string(Bytes.lowercase_ascii(Bytes.unsafe_of_string(suff))); | ||
} | ||
@@ -210,3 +205,3 @@ | ||
try { | ||
temp_dir_name$1 = Caml_sys.caml_sys_getenv("TEMP"); | ||
temp_dir_name$1 = Caml_sys.sys_getenv("TEMP"); | ||
} | ||
@@ -271,3 +266,2 @@ catch (raw_exn$1){ | ||
} | ||
}; | ||
@@ -460,14 +454,2 @@ loop(0); | ||
var prng = { | ||
LAZY_DONE: false, | ||
VAL: (function () { | ||
return Random.State.make_self_init(undefined); | ||
}) | ||
}; | ||
function temp_file_name(temp_dir, prefix, suffix) { | ||
var rnd = Random.State.bits(CamlinternalLazy.force(prng)) & 16777215; | ||
return concat(temp_dir, "" + prefix + rnd + suffix); | ||
} | ||
var current_temp_dir_name = { | ||
@@ -479,3 +461,2 @@ contents: temp_dir_name$2 | ||
current_temp_dir_name.contents = s; | ||
} | ||
@@ -487,75 +468,2 @@ | ||
function temp_file(temp_dirOpt, prefix, suffix) { | ||
var temp_dir = temp_dirOpt !== undefined ? temp_dirOpt : current_temp_dir_name.contents; | ||
var _counter = 0; | ||
while(true) { | ||
var counter = _counter; | ||
var name = temp_file_name(temp_dir, prefix, suffix); | ||
try { | ||
Caml_external_polyfill.resolve("caml_sys_close")(Caml_external_polyfill.resolve("caml_sys_open")(name, { | ||
hd: /* Open_wronly */1, | ||
tl: { | ||
hd: /* Open_creat */3, | ||
tl: { | ||
hd: /* Open_excl */5, | ||
tl: /* [] */0 | ||
} | ||
} | ||
}, 384)); | ||
return name; | ||
} | ||
catch (raw_e){ | ||
var e = Caml_js_exceptions.internalToOCamlException(raw_e); | ||
if (e.RE_EXN_ID === "Sys_error") { | ||
if (counter >= 1000) { | ||
throw e; | ||
} | ||
_counter = counter + 1 | 0; | ||
continue ; | ||
} | ||
throw e; | ||
} | ||
}; | ||
} | ||
function open_temp_file(modeOpt, permsOpt, temp_dirOpt, prefix, suffix) { | ||
var mode = modeOpt !== undefined ? modeOpt : ({ | ||
hd: /* Open_text */7, | ||
tl: /* [] */0 | ||
}); | ||
var perms = permsOpt !== undefined ? permsOpt : 384; | ||
var temp_dir = temp_dirOpt !== undefined ? temp_dirOpt : current_temp_dir_name.contents; | ||
var _counter = 0; | ||
while(true) { | ||
var counter = _counter; | ||
var name = temp_file_name(temp_dir, prefix, suffix); | ||
try { | ||
return [ | ||
name, | ||
Pervasives.open_out_gen({ | ||
hd: /* Open_wronly */1, | ||
tl: { | ||
hd: /* Open_creat */3, | ||
tl: { | ||
hd: /* Open_excl */5, | ||
tl: mode | ||
} | ||
} | ||
}, perms, name) | ||
]; | ||
} | ||
catch (raw_e){ | ||
var e = Caml_js_exceptions.internalToOCamlException(raw_e); | ||
if (e.RE_EXN_ID === "Sys_error") { | ||
if (counter >= 1000) { | ||
throw e; | ||
} | ||
_counter = counter + 1 | 0; | ||
continue ; | ||
} | ||
throw e; | ||
} | ||
}; | ||
} | ||
var current_dir_name$3 = match[0]; | ||
@@ -590,4 +498,2 @@ | ||
exports.dirname = dirname$3; | ||
exports.temp_file = temp_file; | ||
exports.open_temp_file = open_temp_file; | ||
exports.get_temp_dir_name = get_temp_dir_name; | ||
@@ -594,0 +500,0 @@ exports.set_temp_dir_name = set_temp_dir_name; |
@@ -13,3 +13,3 @@ 'use strict'; | ||
var initial_buffer = Caml_bytes.caml_create_bytes(32); | ||
var initial_buffer = Caml_bytes.create(32); | ||
@@ -27,3 +27,2 @@ var buffer = { | ||
bufpos.contents = 0; | ||
} | ||
@@ -33,3 +32,3 @@ | ||
if (bufpos.contents >= buffer.contents.length) { | ||
var newbuffer = Caml_bytes.caml_create_bytes((bufpos.contents << 1)); | ||
var newbuffer = Caml_bytes.create((bufpos.contents << 1)); | ||
Bytes.blit(buffer.contents, 0, newbuffer, 0, bufpos.contents); | ||
@@ -40,3 +39,2 @@ buffer.contents = newbuffer; | ||
bufpos.contents = bufpos.contents + 1 | 0; | ||
} | ||
@@ -53,6 +51,6 @@ | ||
List.iter((function (s) { | ||
return Hashtbl.add(kwd_table, s, { | ||
TAG: /* Kwd */0, | ||
_0: s | ||
}); | ||
Hashtbl.add(kwd_table, s, { | ||
TAG: /* Kwd */0, | ||
_0: s | ||
}); | ||
}), keywords); | ||
@@ -264,3 +262,3 @@ var ident_or_keyword = function (id) { | ||
exit = c >= 127 ? ( | ||
c >= 192 ? 2 : 1 | ||
c > 255 || c < 192 ? 1 : 2 | ||
) : ( | ||
@@ -285,3 +283,3 @@ c !== 125 ? 3 : 1 | ||
if (c$3 > 122 || c$3 < 95) { | ||
if (c$3 < 192) { | ||
if (c$3 > 255 || c$3 < 192) { | ||
return ident_or_keyword(get_string(undefined)); | ||
@@ -428,3 +426,3 @@ } | ||
TAG: /* Float */3, | ||
_0: Caml_format.caml_float_of_string(get_string(undefined)) | ||
_0: Caml_format.float_of_string(get_string(undefined)) | ||
}; | ||
@@ -436,3 +434,3 @@ }; | ||
TAG: /* Int */2, | ||
_0: Caml_format.caml_int_of_string(get_string(undefined)) | ||
_0: Caml_format.int_of_string(get_string(undefined)) | ||
}; | ||
@@ -457,3 +455,3 @@ }; | ||
TAG: /* Float */3, | ||
_0: Caml_format.caml_float_of_string(get_string(undefined)) | ||
_0: Caml_format.float_of_string(get_string(undefined)) | ||
}; | ||
@@ -464,3 +462,3 @@ } | ||
TAG: /* Float */3, | ||
_0: Caml_format.caml_float_of_string(get_string(undefined)) | ||
_0: Caml_format.float_of_string(get_string(undefined)) | ||
}; | ||
@@ -467,0 +465,0 @@ } |
@@ -15,11 +15,11 @@ 'use strict'; | ||
function hash(x) { | ||
return Caml_hash.caml_hash(10, 100, 0, x); | ||
return Caml_hash.hash(10, 100, 0, x); | ||
} | ||
function hash_param(n1, n2, x) { | ||
return Caml_hash.caml_hash(n1, n2, 0, x); | ||
return Caml_hash.hash(n1, n2, 0, x); | ||
} | ||
function seeded_hash(seed, x) { | ||
return Caml_hash.caml_hash(10, 100, seed, x); | ||
return Caml_hash.hash(10, 100, seed, x); | ||
} | ||
@@ -29,3 +29,2 @@ | ||
h.initial_size = -h.initial_size | 0; | ||
} | ||
@@ -39,3 +38,2 @@ | ||
randomized.contents = true; | ||
} | ||
@@ -86,3 +84,2 @@ | ||
} | ||
} | ||
@@ -130,3 +127,3 @@ | ||
"hashtbl.ml", | ||
114, | ||
104, | ||
23 | ||
@@ -214,7 +211,6 @@ ], | ||
} | ||
} | ||
function key_index(h, key) { | ||
return Caml_hash.caml_hash(10, 100, h.seed, key) & (h.data.length - 1 | 0); | ||
return Caml_hash.hash(10, 100, h.seed, key) & (h.data.length - 1 | 0); | ||
} | ||
@@ -249,3 +245,3 @@ | ||
var next = c.next; | ||
if (Caml_obj.caml_equal(k, key)) { | ||
if (Caml_obj.equal(k, key)) { | ||
h.size = h.size - 1 | 0; | ||
@@ -271,3 +267,3 @@ if (prec) { | ||
var next1 = match.next; | ||
if (Caml_obj.caml_equal(key, k1)) { | ||
if (Caml_obj.equal(key, k1)) { | ||
return d1; | ||
@@ -279,3 +275,3 @@ } | ||
var next2 = next1.next; | ||
if (Caml_obj.caml_equal(key, k2)) { | ||
if (Caml_obj.equal(key, k2)) { | ||
return d2; | ||
@@ -287,3 +283,3 @@ } | ||
var next3 = next2.next; | ||
if (Caml_obj.caml_equal(key, k3)) { | ||
if (Caml_obj.equal(key, k3)) { | ||
return d3; | ||
@@ -298,3 +294,3 @@ } else { | ||
var next = param.next; | ||
if (Caml_obj.caml_equal(key, k)) { | ||
if (Caml_obj.equal(key, k)) { | ||
return data; | ||
@@ -336,3 +332,3 @@ } | ||
var next1 = match.next; | ||
if (Caml_obj.caml_equal(key, k1)) { | ||
if (Caml_obj.equal(key, k1)) { | ||
return Caml_option.some(d1); | ||
@@ -346,3 +342,3 @@ } | ||
var next2 = next1.next; | ||
if (Caml_obj.caml_equal(key, k2)) { | ||
if (Caml_obj.equal(key, k2)) { | ||
return Caml_option.some(d2); | ||
@@ -356,3 +352,3 @@ } | ||
var next3 = next2.next; | ||
if (Caml_obj.caml_equal(key, k3)) { | ||
if (Caml_obj.equal(key, k3)) { | ||
return Caml_option.some(d3); | ||
@@ -369,3 +365,3 @@ } else { | ||
var next = param.next; | ||
if (Caml_obj.caml_equal(key, k)) { | ||
if (Caml_obj.equal(key, k)) { | ||
return Caml_option.some(data); | ||
@@ -389,3 +385,3 @@ } | ||
var next = param.next; | ||
if (Caml_obj.caml_equal(k, key)) { | ||
if (Caml_obj.equal(k, key)) { | ||
return { | ||
@@ -411,3 +407,3 @@ hd: data, | ||
var next = slot.next; | ||
if (Caml_obj.caml_equal(k, key)) { | ||
if (Caml_obj.equal(k, key)) { | ||
slot.key = key; | ||
@@ -450,3 +446,3 @@ slot.data = data; | ||
var next = param.next; | ||
if (Caml_obj.caml_equal(k, key)) { | ||
if (Caml_obj.equal(k, key)) { | ||
return true; | ||
@@ -608,3 +604,3 @@ } | ||
var mbl = $$Array.fold_left((function (m, b) { | ||
return Caml.caml_int_max(m, bucket_length(0, b)); | ||
return Caml.int_max(m, bucket_length(0, b)); | ||
}), 0, h.data); | ||
@@ -614,3 +610,3 @@ var histo = Caml_array.make(mbl + 1 | 0, 0); | ||
var l = bucket_length(0, b); | ||
return Caml_array.set(histo, l, Caml_array.get(histo, l) + 1 | 0); | ||
Caml_array.set(histo, l, Caml_array.get(histo, l) + 1 | 0); | ||
}), h.data); | ||
@@ -1111,3 +1107,3 @@ return { | ||
var seeded_hash_param = Caml_hash.caml_hash; | ||
var seeded_hash_param = Caml_hash.hash; | ||
@@ -1114,0 +1110,0 @@ exports.create = create; |
@@ -28,3 +28,3 @@ 'use strict'; | ||
function to_string(n) { | ||
return Caml_format.caml_int32_format("%d", n); | ||
return Caml_format.format_int("%d", n); | ||
} | ||
@@ -34,3 +34,3 @@ | ||
try { | ||
return Caml_format.caml_int32_of_string(s); | ||
return Caml_format.int_of_string(s); | ||
} | ||
@@ -46,3 +46,3 @@ catch (raw_exn){ | ||
var compare = Caml.caml_int_compare; | ||
var compare = Caml.int_compare; | ||
@@ -49,0 +49,0 @@ function equal(x, y) { |
@@ -26,3 +26,3 @@ 'use strict'; | ||
try { | ||
return Caml_format.caml_int64_of_string(s); | ||
return Caml_format.int64_of_string(s); | ||
} | ||
@@ -40,5 +40,3 @@ catch (raw_exn){ | ||
function equal(x, y) { | ||
return Caml_int64.compare(x, y) === 0; | ||
} | ||
var equal = Caml_int64.equal; | ||
@@ -45,0 +43,0 @@ var zero = Caml_int64.zero; |
@@ -1,1 +0,221 @@ | ||
/* This output is empty. Its source's type definitions, externals and/or unused code got optimized away. */ | ||
'use strict'; | ||
var Curry = require("./curry.js"); | ||
var Caml_option = require("./caml_option.js"); | ||
var Caml_splice_call = require("./caml_splice_call.js"); | ||
function copyWithin(to_, obj) { | ||
return obj.copyWithin(to_); | ||
} | ||
function copyWithinFrom(to_, from, obj) { | ||
return obj.copyWithin(to_, from); | ||
} | ||
function copyWithinFromRange(to_, start, end_, obj) { | ||
return obj.copyWithin(to_, start, end_); | ||
} | ||
function fillInPlace(arg1, obj) { | ||
return obj.fill(arg1); | ||
} | ||
function fillFromInPlace(arg1, from, obj) { | ||
return obj.fill(arg1, from); | ||
} | ||
function fillRangeInPlace(arg1, start, end_, obj) { | ||
return obj.fill(arg1, start, end_); | ||
} | ||
function push(arg1, obj) { | ||
return obj.push(arg1); | ||
} | ||
function pushMany(arg1, obj) { | ||
return Caml_splice_call.spliceObjApply(obj, "push", [arg1]); | ||
} | ||
function sortInPlaceWith(arg1, obj) { | ||
return obj.sort(Curry.__2(arg1)); | ||
} | ||
function spliceInPlace(pos, remove, add, obj) { | ||
return Caml_splice_call.spliceObjApply(obj, "splice", [ | ||
pos, | ||
remove, | ||
add | ||
]); | ||
} | ||
function removeFromInPlace(pos, obj) { | ||
return obj.splice(pos); | ||
} | ||
function removeCountInPlace(pos, count, obj) { | ||
return obj.splice(pos, count); | ||
} | ||
function unshift(arg1, obj) { | ||
return obj.unshift(arg1); | ||
} | ||
function unshiftMany(arg1, obj) { | ||
return Caml_splice_call.spliceObjApply(obj, "unshift", [arg1]); | ||
} | ||
function concat(arg1, obj) { | ||
return obj.concat(arg1); | ||
} | ||
function concatMany(arg1, obj) { | ||
return Caml_splice_call.spliceObjApply(obj, "concat", [arg1]); | ||
} | ||
function includes(arg1, obj) { | ||
return obj.includes(arg1); | ||
} | ||
function indexOf(arg1, obj) { | ||
return obj.indexOf(arg1); | ||
} | ||
function indexOfFrom(arg1, from, obj) { | ||
return obj.indexOf(arg1, from); | ||
} | ||
function joinWith(arg1, obj) { | ||
return obj.join(arg1); | ||
} | ||
function lastIndexOf(arg1, obj) { | ||
return obj.lastIndexOf(arg1); | ||
} | ||
function lastIndexOfFrom(arg1, from, obj) { | ||
return obj.lastIndexOf(arg1, from); | ||
} | ||
function slice(start, end_, obj) { | ||
return obj.slice(start, end_); | ||
} | ||
function sliceFrom(arg1, obj) { | ||
return obj.slice(arg1); | ||
} | ||
function every(arg1, obj) { | ||
return obj.every(Curry.__1(arg1)); | ||
} | ||
function everyi(arg1, obj) { | ||
return obj.every(Curry.__2(arg1)); | ||
} | ||
function filter(arg1, obj) { | ||
return obj.filter(Curry.__1(arg1)); | ||
} | ||
function filteri(arg1, obj) { | ||
return obj.filter(Curry.__2(arg1)); | ||
} | ||
function find(arg1, obj) { | ||
return Caml_option.undefined_to_opt(obj.find(Curry.__1(arg1))); | ||
} | ||
function findi(arg1, obj) { | ||
return Caml_option.undefined_to_opt(obj.find(Curry.__2(arg1))); | ||
} | ||
function findIndex(arg1, obj) { | ||
return obj.findIndex(Curry.__1(arg1)); | ||
} | ||
function findIndexi(arg1, obj) { | ||
return obj.findIndex(Curry.__2(arg1)); | ||
} | ||
function forEach(arg1, obj) { | ||
obj.forEach(Curry.__1(arg1)); | ||
} | ||
function forEachi(arg1, obj) { | ||
obj.forEach(Curry.__2(arg1)); | ||
} | ||
function map(arg1, obj) { | ||
return obj.map(Curry.__1(arg1)); | ||
} | ||
function mapi(arg1, obj) { | ||
return obj.map(Curry.__2(arg1)); | ||
} | ||
function reduce(arg1, arg2, obj) { | ||
return obj.reduce(Curry.__2(arg1), arg2); | ||
} | ||
function reducei(arg1, arg2, obj) { | ||
return obj.reduce(Curry.__3(arg1), arg2); | ||
} | ||
function reduceRight(arg1, arg2, obj) { | ||
return obj.reduceRight(Curry.__2(arg1), arg2); | ||
} | ||
function reduceRighti(arg1, arg2, obj) { | ||
return obj.reduceRight(Curry.__3(arg1), arg2); | ||
} | ||
function some(arg1, obj) { | ||
return obj.some(Curry.__1(arg1)); | ||
} | ||
function somei(arg1, obj) { | ||
return obj.some(Curry.__2(arg1)); | ||
} | ||
exports.copyWithin = copyWithin; | ||
exports.copyWithinFrom = copyWithinFrom; | ||
exports.copyWithinFromRange = copyWithinFromRange; | ||
exports.fillInPlace = fillInPlace; | ||
exports.fillFromInPlace = fillFromInPlace; | ||
exports.fillRangeInPlace = fillRangeInPlace; | ||
exports.push = push; | ||
exports.pushMany = pushMany; | ||
exports.sortInPlaceWith = sortInPlaceWith; | ||
exports.spliceInPlace = spliceInPlace; | ||
exports.removeFromInPlace = removeFromInPlace; | ||
exports.removeCountInPlace = removeCountInPlace; | ||
exports.unshift = unshift; | ||
exports.unshiftMany = unshiftMany; | ||
exports.concat = concat; | ||
exports.concatMany = concatMany; | ||
exports.includes = includes; | ||
exports.indexOf = indexOf; | ||
exports.indexOfFrom = indexOfFrom; | ||
exports.joinWith = joinWith; | ||
exports.lastIndexOf = lastIndexOf; | ||
exports.lastIndexOfFrom = lastIndexOfFrom; | ||
exports.slice = slice; | ||
exports.sliceFrom = sliceFrom; | ||
exports.every = every; | ||
exports.everyi = everyi; | ||
exports.filter = filter; | ||
exports.filteri = filteri; | ||
exports.find = find; | ||
exports.findi = findi; | ||
exports.findIndex = findIndex; | ||
exports.findIndexi = findIndexi; | ||
exports.forEach = forEach; | ||
exports.forEachi = forEachi; | ||
exports.map = map; | ||
exports.mapi = mapi; | ||
exports.reduce = reduce; | ||
exports.reducei = reducei; | ||
exports.reduceRight = reduceRight; | ||
exports.reduceRighti = reduceRighti; | ||
exports.some = some; | ||
exports.somei = somei; | ||
/* No side effect */ |
'use strict'; | ||
var Caml_js_exceptions = require("./caml_js_exceptions.js"); | ||
var anyToExnInternal = Caml_js_exceptions.internalToOCamlException; | ||
function raiseError(str) { | ||
@@ -35,6 +32,5 @@ throw new Error(str); | ||
var $$Error$1 = Caml_js_exceptions.$$Error; | ||
var $$Error$1 = "JsError"; | ||
exports.$$Error = $$Error$1; | ||
exports.anyToExnInternal = anyToExnInternal; | ||
exports.raiseError = raiseError; | ||
@@ -41,0 +37,0 @@ exports.raiseEvalError = raiseEvalError; |
@@ -1,1 +0,15 @@ | ||
/* This output is empty. Its source's type definitions, externals and/or unused code got optimized away. */ | ||
'use strict'; | ||
var Curry = require("./curry.js"); | ||
function then_(arg1, obj) { | ||
return obj.then(Curry.__1(arg1)); | ||
} | ||
function $$catch(arg1, obj) { | ||
return obj.catch(Curry.__1(arg1)); | ||
} | ||
exports.then_ = then_; | ||
exports.$$catch = $$catch; | ||
/* No side effect */ |
@@ -1,1 +0,197 @@ | ||
/* This output is empty. Its source's type definitions, externals and/or unused code got optimized away. */ | ||
'use strict'; | ||
var Curry = require("./curry.js"); | ||
var Caml_option = require("./caml_option.js"); | ||
var Caml_splice_call = require("./caml_splice_call.js"); | ||
function charAt(arg1, obj) { | ||
return obj.charAt(arg1); | ||
} | ||
function charCodeAt(arg1, obj) { | ||
return obj.charCodeAt(arg1); | ||
} | ||
function codePointAt(arg1, obj) { | ||
return obj.codePointAt(arg1); | ||
} | ||
function concat(arg1, obj) { | ||
return obj.concat(arg1); | ||
} | ||
function concatMany(arg1, obj) { | ||
return Caml_splice_call.spliceObjApply(obj, "concat", [arg1]); | ||
} | ||
function endsWith(arg1, obj) { | ||
return obj.endsWith(arg1); | ||
} | ||
function endsWithFrom(arg1, arg2, obj) { | ||
return obj.endsWith(arg1, arg2); | ||
} | ||
function includes(arg1, obj) { | ||
return obj.includes(arg1); | ||
} | ||
function includesFrom(arg1, arg2, obj) { | ||
return obj.includes(arg1, arg2); | ||
} | ||
function indexOf(arg1, obj) { | ||
return obj.indexOf(arg1); | ||
} | ||
function indexOfFrom(arg1, arg2, obj) { | ||
return obj.indexOf(arg1, arg2); | ||
} | ||
function lastIndexOf(arg1, obj) { | ||
return obj.lastIndexOf(arg1); | ||
} | ||
function lastIndexOfFrom(arg1, arg2, obj) { | ||
return obj.lastIndexOf(arg1, arg2); | ||
} | ||
function localeCompare(arg1, obj) { | ||
return obj.localeCompare(arg1); | ||
} | ||
function match_(arg1, obj) { | ||
return Caml_option.null_to_opt(obj.match(arg1)); | ||
} | ||
function normalizeByForm(arg1, obj) { | ||
return obj.normalize(arg1); | ||
} | ||
function repeat(arg1, obj) { | ||
return obj.repeat(arg1); | ||
} | ||
function replace(arg1, arg2, obj) { | ||
return obj.replace(arg1, arg2); | ||
} | ||
function replaceByRe(arg1, arg2, obj) { | ||
return obj.replace(arg1, arg2); | ||
} | ||
function unsafeReplaceBy0(arg1, arg2, obj) { | ||
return obj.replace(arg1, Curry.__3(arg2)); | ||
} | ||
function unsafeReplaceBy1(arg1, arg2, obj) { | ||
return obj.replace(arg1, Curry.__4(arg2)); | ||
} | ||
function unsafeReplaceBy2(arg1, arg2, obj) { | ||
return obj.replace(arg1, Curry.__5(arg2)); | ||
} | ||
function unsafeReplaceBy3(arg1, arg2, obj) { | ||
return obj.replace(arg1, Curry.__6(arg2)); | ||
} | ||
function search(arg1, obj) { | ||
return obj.search(arg1); | ||
} | ||
function slice(from, to_, obj) { | ||
return obj.slice(from, to_); | ||
} | ||
function sliceToEnd(from, obj) { | ||
return obj.slice(from); | ||
} | ||
function split(arg1, obj) { | ||
return obj.split(arg1); | ||
} | ||
function splitAtMost(arg1, limit, obj) { | ||
return obj.split(arg1, limit); | ||
} | ||
function splitByRe(arg1, obj) { | ||
return obj.split(arg1); | ||
} | ||
function splitByReAtMost(arg1, limit, obj) { | ||
return obj.split(arg1, limit); | ||
} | ||
function startsWith(arg1, obj) { | ||
return obj.startsWith(arg1); | ||
} | ||
function startsWithFrom(arg1, arg2, obj) { | ||
return obj.startsWith(arg1, arg2); | ||
} | ||
function substr(from, obj) { | ||
return obj.substr(from); | ||
} | ||
function substrAtMost(from, length, obj) { | ||
return obj.substr(from, length); | ||
} | ||
function substring(from, to_, obj) { | ||
return obj.substring(from, to_); | ||
} | ||
function substringToEnd(from, obj) { | ||
return obj.substring(from); | ||
} | ||
function anchor(arg1, obj) { | ||
return obj.anchor(arg1); | ||
} | ||
function link(arg1, obj) { | ||
return obj.link(arg1); | ||
} | ||
exports.charAt = charAt; | ||
exports.charCodeAt = charCodeAt; | ||
exports.codePointAt = codePointAt; | ||
exports.concat = concat; | ||
exports.concatMany = concatMany; | ||
exports.endsWith = endsWith; | ||
exports.endsWithFrom = endsWithFrom; | ||
exports.includes = includes; | ||
exports.includesFrom = includesFrom; | ||
exports.indexOf = indexOf; | ||
exports.indexOfFrom = indexOfFrom; | ||
exports.lastIndexOf = lastIndexOf; | ||
exports.lastIndexOfFrom = lastIndexOfFrom; | ||
exports.localeCompare = localeCompare; | ||
exports.match_ = match_; | ||
exports.normalizeByForm = normalizeByForm; | ||
exports.repeat = repeat; | ||
exports.replace = replace; | ||
exports.replaceByRe = replaceByRe; | ||
exports.unsafeReplaceBy0 = unsafeReplaceBy0; | ||
exports.unsafeReplaceBy1 = unsafeReplaceBy1; | ||
exports.unsafeReplaceBy2 = unsafeReplaceBy2; | ||
exports.unsafeReplaceBy3 = unsafeReplaceBy3; | ||
exports.search = search; | ||
exports.slice = slice; | ||
exports.sliceToEnd = sliceToEnd; | ||
exports.split = split; | ||
exports.splitAtMost = splitAtMost; | ||
exports.splitByRe = splitByRe; | ||
exports.splitByReAtMost = splitByReAtMost; | ||
exports.startsWith = startsWith; | ||
exports.startsWithFrom = startsWithFrom; | ||
exports.substr = substr; | ||
exports.substrAtMost = substrAtMost; | ||
exports.substring = substring; | ||
exports.substringToEnd = substringToEnd; | ||
exports.anchor = anchor; | ||
exports.link = link; | ||
/* No side effect */ |
'use strict'; | ||
var $$ArrayBuffer = {}; | ||
function slice(start, end_, obj) { | ||
return obj.slice(start, end_); | ||
} | ||
var $$Int8Array = {}; | ||
function sliceFrom(arg1, obj) { | ||
return obj.slice(arg1); | ||
} | ||
var $$Uint8Array = {}; | ||
var $$ArrayBuffer = { | ||
slice: slice, | ||
sliceFrom: sliceFrom | ||
}; | ||
var $$Uint8ClampedArray = {}; | ||
function setArray(arg1, obj) { | ||
obj.set(arg1); | ||
} | ||
var $$Int16Array = {}; | ||
function setArrayOffset(arg1, arg2, obj) { | ||
obj.set(arg1, arg2); | ||
} | ||
var $$Uint16Array = {}; | ||
function copyWithin(to_, obj) { | ||
return obj.copyWithin(to_); | ||
} | ||
var $$Int32Array = {}; | ||
function copyWithinFrom(to_, from, obj) { | ||
return obj.copyWithin(to_, from); | ||
} | ||
var $$Uint32Array = {}; | ||
function copyWithinFromRange(to_, start, end_, obj) { | ||
return obj.copyWithin(to_, start, end_); | ||
} | ||
var $$Float32Array = {}; | ||
function fillInPlace(arg1, obj) { | ||
return obj.fill(arg1); | ||
} | ||
var $$Float64Array = {}; | ||
function fillFromInPlace(arg1, from, obj) { | ||
return obj.fill(arg1, from); | ||
} | ||
function fillRangeInPlace(arg1, start, end_, obj) { | ||
return obj.fill(arg1, start, end_); | ||
} | ||
function sortInPlaceWith(arg1, obj) { | ||
return obj.sort(arg1); | ||
} | ||
function includes(arg1, obj) { | ||
return obj.includes(arg1); | ||
} | ||
function indexOf(arg1, obj) { | ||
return obj.indexOf(arg1); | ||
} | ||
function indexOfFrom(arg1, from, obj) { | ||
return obj.indexOf(arg1, from); | ||
} | ||
function joinWith(arg1, obj) { | ||
return obj.join(arg1); | ||
} | ||
function lastIndexOf(arg1, obj) { | ||
return obj.lastIndexOf(arg1); | ||
} | ||
function lastIndexOfFrom(arg1, from, obj) { | ||
return obj.lastIndexOf(arg1, from); | ||
} | ||
function slice$1(start, end_, obj) { | ||
return obj.slice(start, end_); | ||
} | ||
function sliceFrom$1(arg1, obj) { | ||
return obj.slice(arg1); | ||
} | ||
function subarray(start, end_, obj) { | ||
return obj.subarray(start, end_); | ||
} | ||
function subarrayFrom(arg1, obj) { | ||
return obj.subarray(arg1); | ||
} | ||
function every(arg1, obj) { | ||
return obj.every(arg1); | ||
} | ||
function everyi(arg1, obj) { | ||
return obj.every(arg1); | ||
} | ||
function filter(arg1, obj) { | ||
return obj.filter(arg1); | ||
} | ||
function filteri(arg1, obj) { | ||
return obj.filter(arg1); | ||
} | ||
function find(arg1, obj) { | ||
return obj.find(arg1); | ||
} | ||
function findi(arg1, obj) { | ||
return obj.find(arg1); | ||
} | ||
function findIndex(arg1, obj) { | ||
return obj.findIndex(arg1); | ||
} | ||
function findIndexi(arg1, obj) { | ||
return obj.findIndex(arg1); | ||
} | ||
function forEach(arg1, obj) { | ||
obj.forEach(arg1); | ||
} | ||
function forEachi(arg1, obj) { | ||
obj.forEach(arg1); | ||
} | ||
function map(arg1, obj) { | ||
return obj.map(arg1); | ||
} | ||
function mapi(arg1, obj) { | ||
return obj.map(arg1); | ||
} | ||
function reduce(arg1, arg2, obj) { | ||
return obj.reduce(arg1, arg2); | ||
} | ||
function reducei(arg1, arg2, obj) { | ||
return obj.reduce(arg1, arg2); | ||
} | ||
function reduceRight(arg1, arg2, obj) { | ||
return obj.reduceRight(arg1, arg2); | ||
} | ||
function reduceRighti(arg1, arg2, obj) { | ||
return obj.reduceRight(arg1, arg2); | ||
} | ||
function some(arg1, obj) { | ||
return obj.some(arg1); | ||
} | ||
function somei(arg1, obj) { | ||
return obj.some(arg1); | ||
} | ||
var $$Int8Array = { | ||
setArray: setArray, | ||
setArrayOffset: setArrayOffset, | ||
copyWithin: copyWithin, | ||
copyWithinFrom: copyWithinFrom, | ||
copyWithinFromRange: copyWithinFromRange, | ||
fillInPlace: fillInPlace, | ||
fillFromInPlace: fillFromInPlace, | ||
fillRangeInPlace: fillRangeInPlace, | ||
sortInPlaceWith: sortInPlaceWith, | ||
includes: includes, | ||
indexOf: indexOf, | ||
indexOfFrom: indexOfFrom, | ||
joinWith: joinWith, | ||
lastIndexOf: lastIndexOf, | ||
lastIndexOfFrom: lastIndexOfFrom, | ||
slice: slice$1, | ||
sliceFrom: sliceFrom$1, | ||
subarray: subarray, | ||
subarrayFrom: subarrayFrom, | ||
every: every, | ||
everyi: everyi, | ||
filter: filter, | ||
filteri: filteri, | ||
find: find, | ||
findi: findi, | ||
findIndex: findIndex, | ||
findIndexi: findIndexi, | ||
forEach: forEach, | ||
forEachi: forEachi, | ||
map: map, | ||
mapi: mapi, | ||
reduce: reduce, | ||
reducei: reducei, | ||
reduceRight: reduceRight, | ||
reduceRighti: reduceRighti, | ||
some: some, | ||
somei: somei | ||
}; | ||
function setArray$1(arg1, obj) { | ||
obj.set(arg1); | ||
} | ||
function setArrayOffset$1(arg1, arg2, obj) { | ||
obj.set(arg1, arg2); | ||
} | ||
function copyWithin$1(to_, obj) { | ||
return obj.copyWithin(to_); | ||
} | ||
function copyWithinFrom$1(to_, from, obj) { | ||
return obj.copyWithin(to_, from); | ||
} | ||
function copyWithinFromRange$1(to_, start, end_, obj) { | ||
return obj.copyWithin(to_, start, end_); | ||
} | ||
function fillInPlace$1(arg1, obj) { | ||
return obj.fill(arg1); | ||
} | ||
function fillFromInPlace$1(arg1, from, obj) { | ||
return obj.fill(arg1, from); | ||
} | ||
function fillRangeInPlace$1(arg1, start, end_, obj) { | ||
return obj.fill(arg1, start, end_); | ||
} | ||
function sortInPlaceWith$1(arg1, obj) { | ||
return obj.sort(arg1); | ||
} | ||
function includes$1(arg1, obj) { | ||
return obj.includes(arg1); | ||
} | ||
function indexOf$1(arg1, obj) { | ||
return obj.indexOf(arg1); | ||
} | ||
function indexOfFrom$1(arg1, from, obj) { | ||
return obj.indexOf(arg1, from); | ||
} | ||
function joinWith$1(arg1, obj) { | ||
return obj.join(arg1); | ||
} | ||
function lastIndexOf$1(arg1, obj) { | ||
return obj.lastIndexOf(arg1); | ||
} | ||
function lastIndexOfFrom$1(arg1, from, obj) { | ||
return obj.lastIndexOf(arg1, from); | ||
} | ||
function slice$2(start, end_, obj) { | ||
return obj.slice(start, end_); | ||
} | ||
function sliceFrom$2(arg1, obj) { | ||
return obj.slice(arg1); | ||
} | ||
function subarray$1(start, end_, obj) { | ||
return obj.subarray(start, end_); | ||
} | ||
function subarrayFrom$1(arg1, obj) { | ||
return obj.subarray(arg1); | ||
} | ||
function every$1(arg1, obj) { | ||
return obj.every(arg1); | ||
} | ||
function everyi$1(arg1, obj) { | ||
return obj.every(arg1); | ||
} | ||
function filter$1(arg1, obj) { | ||
return obj.filter(arg1); | ||
} | ||
function filteri$1(arg1, obj) { | ||
return obj.filter(arg1); | ||
} | ||
function find$1(arg1, obj) { | ||
return obj.find(arg1); | ||
} | ||
function findi$1(arg1, obj) { | ||
return obj.find(arg1); | ||
} | ||
function findIndex$1(arg1, obj) { | ||
return obj.findIndex(arg1); | ||
} | ||
function findIndexi$1(arg1, obj) { | ||
return obj.findIndex(arg1); | ||
} | ||
function forEach$1(arg1, obj) { | ||
obj.forEach(arg1); | ||
} | ||
function forEachi$1(arg1, obj) { | ||
obj.forEach(arg1); | ||
} | ||
function map$1(arg1, obj) { | ||
return obj.map(arg1); | ||
} | ||
function mapi$1(arg1, obj) { | ||
return obj.map(arg1); | ||
} | ||
function reduce$1(arg1, arg2, obj) { | ||
return obj.reduce(arg1, arg2); | ||
} | ||
function reducei$1(arg1, arg2, obj) { | ||
return obj.reduce(arg1, arg2); | ||
} | ||
function reduceRight$1(arg1, arg2, obj) { | ||
return obj.reduceRight(arg1, arg2); | ||
} | ||
function reduceRighti$1(arg1, arg2, obj) { | ||
return obj.reduceRight(arg1, arg2); | ||
} | ||
function some$1(arg1, obj) { | ||
return obj.some(arg1); | ||
} | ||
function somei$1(arg1, obj) { | ||
return obj.some(arg1); | ||
} | ||
var $$Uint8Array = { | ||
setArray: setArray$1, | ||
setArrayOffset: setArrayOffset$1, | ||
copyWithin: copyWithin$1, | ||
copyWithinFrom: copyWithinFrom$1, | ||
copyWithinFromRange: copyWithinFromRange$1, | ||
fillInPlace: fillInPlace$1, | ||
fillFromInPlace: fillFromInPlace$1, | ||
fillRangeInPlace: fillRangeInPlace$1, | ||
sortInPlaceWith: sortInPlaceWith$1, | ||
includes: includes$1, | ||
indexOf: indexOf$1, | ||
indexOfFrom: indexOfFrom$1, | ||
joinWith: joinWith$1, | ||
lastIndexOf: lastIndexOf$1, | ||
lastIndexOfFrom: lastIndexOfFrom$1, | ||
slice: slice$2, | ||
sliceFrom: sliceFrom$2, | ||
subarray: subarray$1, | ||
subarrayFrom: subarrayFrom$1, | ||
every: every$1, | ||
everyi: everyi$1, | ||
filter: filter$1, | ||
filteri: filteri$1, | ||
find: find$1, | ||
findi: findi$1, | ||
findIndex: findIndex$1, | ||
findIndexi: findIndexi$1, | ||
forEach: forEach$1, | ||
forEachi: forEachi$1, | ||
map: map$1, | ||
mapi: mapi$1, | ||
reduce: reduce$1, | ||
reducei: reducei$1, | ||
reduceRight: reduceRight$1, | ||
reduceRighti: reduceRighti$1, | ||
some: some$1, | ||
somei: somei$1 | ||
}; | ||
function setArray$2(arg1, obj) { | ||
obj.set(arg1); | ||
} | ||
function setArrayOffset$2(arg1, arg2, obj) { | ||
obj.set(arg1, arg2); | ||
} | ||
function copyWithin$2(to_, obj) { | ||
return obj.copyWithin(to_); | ||
} | ||
function copyWithinFrom$2(to_, from, obj) { | ||
return obj.copyWithin(to_, from); | ||
} | ||
function copyWithinFromRange$2(to_, start, end_, obj) { | ||
return obj.copyWithin(to_, start, end_); | ||
} | ||
function fillInPlace$2(arg1, obj) { | ||
return obj.fill(arg1); | ||
} | ||
function fillFromInPlace$2(arg1, from, obj) { | ||
return obj.fill(arg1, from); | ||
} | ||
function fillRangeInPlace$2(arg1, start, end_, obj) { | ||
return obj.fill(arg1, start, end_); | ||
} | ||
function sortInPlaceWith$2(arg1, obj) { | ||
return obj.sort(arg1); | ||
} | ||
function includes$2(arg1, obj) { | ||
return obj.includes(arg1); | ||
} | ||
function indexOf$2(arg1, obj) { | ||
return obj.indexOf(arg1); | ||
} | ||
function indexOfFrom$2(arg1, from, obj) { | ||
return obj.indexOf(arg1, from); | ||
} | ||
function joinWith$2(arg1, obj) { | ||
return obj.join(arg1); | ||
} | ||
function lastIndexOf$2(arg1, obj) { | ||
return obj.lastIndexOf(arg1); | ||
} | ||
function lastIndexOfFrom$2(arg1, from, obj) { | ||
return obj.lastIndexOf(arg1, from); | ||
} | ||
function slice$3(start, end_, obj) { | ||
return obj.slice(start, end_); | ||
} | ||
function sliceFrom$3(arg1, obj) { | ||
return obj.slice(arg1); | ||
} | ||
function subarray$2(start, end_, obj) { | ||
return obj.subarray(start, end_); | ||
} | ||
function subarrayFrom$2(arg1, obj) { | ||
return obj.subarray(arg1); | ||
} | ||
function every$2(arg1, obj) { | ||
return obj.every(arg1); | ||
} | ||
function everyi$2(arg1, obj) { | ||
return obj.every(arg1); | ||
} | ||
function filter$2(arg1, obj) { | ||
return obj.filter(arg1); | ||
} | ||
function filteri$2(arg1, obj) { | ||
return obj.filter(arg1); | ||
} | ||
function find$2(arg1, obj) { | ||
return obj.find(arg1); | ||
} | ||
function findi$2(arg1, obj) { | ||
return obj.find(arg1); | ||
} | ||
function findIndex$2(arg1, obj) { | ||
return obj.findIndex(arg1); | ||
} | ||
function findIndexi$2(arg1, obj) { | ||
return obj.findIndex(arg1); | ||
} | ||
function forEach$2(arg1, obj) { | ||
obj.forEach(arg1); | ||
} | ||
function forEachi$2(arg1, obj) { | ||
obj.forEach(arg1); | ||
} | ||
function map$2(arg1, obj) { | ||
return obj.map(arg1); | ||
} | ||
function mapi$2(arg1, obj) { | ||
return obj.map(arg1); | ||
} | ||
function reduce$2(arg1, arg2, obj) { | ||
return obj.reduce(arg1, arg2); | ||
} | ||
function reducei$2(arg1, arg2, obj) { | ||
return obj.reduce(arg1, arg2); | ||
} | ||
function reduceRight$2(arg1, arg2, obj) { | ||
return obj.reduceRight(arg1, arg2); | ||
} | ||
function reduceRighti$2(arg1, arg2, obj) { | ||
return obj.reduceRight(arg1, arg2); | ||
} | ||
function some$2(arg1, obj) { | ||
return obj.some(arg1); | ||
} | ||
function somei$2(arg1, obj) { | ||
return obj.some(arg1); | ||
} | ||
var $$Uint8ClampedArray = { | ||
setArray: setArray$2, | ||
setArrayOffset: setArrayOffset$2, | ||
copyWithin: copyWithin$2, | ||
copyWithinFrom: copyWithinFrom$2, | ||
copyWithinFromRange: copyWithinFromRange$2, | ||
fillInPlace: fillInPlace$2, | ||
fillFromInPlace: fillFromInPlace$2, | ||
fillRangeInPlace: fillRangeInPlace$2, | ||
sortInPlaceWith: sortInPlaceWith$2, | ||
includes: includes$2, | ||
indexOf: indexOf$2, | ||
indexOfFrom: indexOfFrom$2, | ||
joinWith: joinWith$2, | ||
lastIndexOf: lastIndexOf$2, | ||
lastIndexOfFrom: lastIndexOfFrom$2, | ||
slice: slice$3, | ||
sliceFrom: sliceFrom$3, | ||
subarray: subarray$2, | ||
subarrayFrom: subarrayFrom$2, | ||
every: every$2, | ||
everyi: everyi$2, | ||
filter: filter$2, | ||
filteri: filteri$2, | ||
find: find$2, | ||
findi: findi$2, | ||
findIndex: findIndex$2, | ||
findIndexi: findIndexi$2, | ||
forEach: forEach$2, | ||
forEachi: forEachi$2, | ||
map: map$2, | ||
mapi: mapi$2, | ||
reduce: reduce$2, | ||
reducei: reducei$2, | ||
reduceRight: reduceRight$2, | ||
reduceRighti: reduceRighti$2, | ||
some: some$2, | ||
somei: somei$2 | ||
}; | ||
function setArray$3(arg1, obj) { | ||
obj.set(arg1); | ||
} | ||
function setArrayOffset$3(arg1, arg2, obj) { | ||
obj.set(arg1, arg2); | ||
} | ||
function copyWithin$3(to_, obj) { | ||
return obj.copyWithin(to_); | ||
} | ||
function copyWithinFrom$3(to_, from, obj) { | ||
return obj.copyWithin(to_, from); | ||
} | ||
function copyWithinFromRange$3(to_, start, end_, obj) { | ||
return obj.copyWithin(to_, start, end_); | ||
} | ||
function fillInPlace$3(arg1, obj) { | ||
return obj.fill(arg1); | ||
} | ||
function fillFromInPlace$3(arg1, from, obj) { | ||
return obj.fill(arg1, from); | ||
} | ||
function fillRangeInPlace$3(arg1, start, end_, obj) { | ||
return obj.fill(arg1, start, end_); | ||
} | ||
function sortInPlaceWith$3(arg1, obj) { | ||
return obj.sort(arg1); | ||
} | ||
function includes$3(arg1, obj) { | ||
return obj.includes(arg1); | ||
} | ||
function indexOf$3(arg1, obj) { | ||
return obj.indexOf(arg1); | ||
} | ||
function indexOfFrom$3(arg1, from, obj) { | ||
return obj.indexOf(arg1, from); | ||
} | ||
function joinWith$3(arg1, obj) { | ||
return obj.join(arg1); | ||
} | ||
function lastIndexOf$3(arg1, obj) { | ||
return obj.lastIndexOf(arg1); | ||
} | ||
function lastIndexOfFrom$3(arg1, from, obj) { | ||
return obj.lastIndexOf(arg1, from); | ||
} | ||
function slice$4(start, end_, obj) { | ||
return obj.slice(start, end_); | ||
} | ||
function sliceFrom$4(arg1, obj) { | ||
return obj.slice(arg1); | ||
} | ||
function subarray$3(start, end_, obj) { | ||
return obj.subarray(start, end_); | ||
} | ||
function subarrayFrom$3(arg1, obj) { | ||
return obj.subarray(arg1); | ||
} | ||
function every$3(arg1, obj) { | ||
return obj.every(arg1); | ||
} | ||
function everyi$3(arg1, obj) { | ||
return obj.every(arg1); | ||
} | ||
function filter$3(arg1, obj) { | ||
return obj.filter(arg1); | ||
} | ||
function filteri$3(arg1, obj) { | ||
return obj.filter(arg1); | ||
} | ||
function find$3(arg1, obj) { | ||
return obj.find(arg1); | ||
} | ||
function findi$3(arg1, obj) { | ||
return obj.find(arg1); | ||
} | ||
function findIndex$3(arg1, obj) { | ||
return obj.findIndex(arg1); | ||
} | ||
function findIndexi$3(arg1, obj) { | ||
return obj.findIndex(arg1); | ||
} | ||
function forEach$3(arg1, obj) { | ||
obj.forEach(arg1); | ||
} | ||
function forEachi$3(arg1, obj) { | ||
obj.forEach(arg1); | ||
} | ||
function map$3(arg1, obj) { | ||
return obj.map(arg1); | ||
} | ||
function mapi$3(arg1, obj) { | ||
return obj.map(arg1); | ||
} | ||
function reduce$3(arg1, arg2, obj) { | ||
return obj.reduce(arg1, arg2); | ||
} | ||
function reducei$3(arg1, arg2, obj) { | ||
return obj.reduce(arg1, arg2); | ||
} | ||
function reduceRight$3(arg1, arg2, obj) { | ||
return obj.reduceRight(arg1, arg2); | ||
} | ||
function reduceRighti$3(arg1, arg2, obj) { | ||
return obj.reduceRight(arg1, arg2); | ||
} | ||
function some$3(arg1, obj) { | ||
return obj.some(arg1); | ||
} | ||
function somei$3(arg1, obj) { | ||
return obj.some(arg1); | ||
} | ||
var $$Int16Array = { | ||
setArray: setArray$3, | ||
setArrayOffset: setArrayOffset$3, | ||
copyWithin: copyWithin$3, | ||
copyWithinFrom: copyWithinFrom$3, | ||
copyWithinFromRange: copyWithinFromRange$3, | ||
fillInPlace: fillInPlace$3, | ||
fillFromInPlace: fillFromInPlace$3, | ||
fillRangeInPlace: fillRangeInPlace$3, | ||
sortInPlaceWith: sortInPlaceWith$3, | ||
includes: includes$3, | ||
indexOf: indexOf$3, | ||
indexOfFrom: indexOfFrom$3, | ||
joinWith: joinWith$3, | ||
lastIndexOf: lastIndexOf$3, | ||
lastIndexOfFrom: lastIndexOfFrom$3, | ||
slice: slice$4, | ||
sliceFrom: sliceFrom$4, | ||
subarray: subarray$3, | ||
subarrayFrom: subarrayFrom$3, | ||
every: every$3, | ||
everyi: everyi$3, | ||
filter: filter$3, | ||
filteri: filteri$3, | ||
find: find$3, | ||
findi: findi$3, | ||
findIndex: findIndex$3, | ||
findIndexi: findIndexi$3, | ||
forEach: forEach$3, | ||
forEachi: forEachi$3, | ||
map: map$3, | ||
mapi: mapi$3, | ||
reduce: reduce$3, | ||
reducei: reducei$3, | ||
reduceRight: reduceRight$3, | ||
reduceRighti: reduceRighti$3, | ||
some: some$3, | ||
somei: somei$3 | ||
}; | ||
function setArray$4(arg1, obj) { | ||
obj.set(arg1); | ||
} | ||
function setArrayOffset$4(arg1, arg2, obj) { | ||
obj.set(arg1, arg2); | ||
} | ||
function copyWithin$4(to_, obj) { | ||
return obj.copyWithin(to_); | ||
} | ||
function copyWithinFrom$4(to_, from, obj) { | ||
return obj.copyWithin(to_, from); | ||
} | ||
function copyWithinFromRange$4(to_, start, end_, obj) { | ||
return obj.copyWithin(to_, start, end_); | ||
} | ||
function fillInPlace$4(arg1, obj) { | ||
return obj.fill(arg1); | ||
} | ||
function fillFromInPlace$4(arg1, from, obj) { | ||
return obj.fill(arg1, from); | ||
} | ||
function fillRangeInPlace$4(arg1, start, end_, obj) { | ||
return obj.fill(arg1, start, end_); | ||
} | ||
function sortInPlaceWith$4(arg1, obj) { | ||
return obj.sort(arg1); | ||
} | ||
function includes$4(arg1, obj) { | ||
return obj.includes(arg1); | ||
} | ||
function indexOf$4(arg1, obj) { | ||
return obj.indexOf(arg1); | ||
} | ||
function indexOfFrom$4(arg1, from, obj) { | ||
return obj.indexOf(arg1, from); | ||
} | ||
function joinWith$4(arg1, obj) { | ||
return obj.join(arg1); | ||
} | ||
function lastIndexOf$4(arg1, obj) { | ||
return obj.lastIndexOf(arg1); | ||
} | ||
function lastIndexOfFrom$4(arg1, from, obj) { | ||
return obj.lastIndexOf(arg1, from); | ||
} | ||
function slice$5(start, end_, obj) { | ||
return obj.slice(start, end_); | ||
} | ||
function sliceFrom$5(arg1, obj) { | ||
return obj.slice(arg1); | ||
} | ||
function subarray$4(start, end_, obj) { | ||
return obj.subarray(start, end_); | ||
} | ||
function subarrayFrom$4(arg1, obj) { | ||
return obj.subarray(arg1); | ||
} | ||
function every$4(arg1, obj) { | ||
return obj.every(arg1); | ||
} | ||
function everyi$4(arg1, obj) { | ||
return obj.every(arg1); | ||
} | ||
function filter$4(arg1, obj) { | ||
return obj.filter(arg1); | ||
} | ||
function filteri$4(arg1, obj) { | ||
return obj.filter(arg1); | ||
} | ||
function find$4(arg1, obj) { | ||
return obj.find(arg1); | ||
} | ||
function findi$4(arg1, obj) { | ||
return obj.find(arg1); | ||
} | ||
function findIndex$4(arg1, obj) { | ||
return obj.findIndex(arg1); | ||
} | ||
function findIndexi$4(arg1, obj) { | ||
return obj.findIndex(arg1); | ||
} | ||
function forEach$4(arg1, obj) { | ||
obj.forEach(arg1); | ||
} | ||
function forEachi$4(arg1, obj) { | ||
obj.forEach(arg1); | ||
} | ||
function map$4(arg1, obj) { | ||
return obj.map(arg1); | ||
} | ||
function mapi$4(arg1, obj) { | ||
return obj.map(arg1); | ||
} | ||
function reduce$4(arg1, arg2, obj) { | ||
return obj.reduce(arg1, arg2); | ||
} | ||
function reducei$4(arg1, arg2, obj) { | ||
return obj.reduce(arg1, arg2); | ||
} | ||
function reduceRight$4(arg1, arg2, obj) { | ||
return obj.reduceRight(arg1, arg2); | ||
} | ||
function reduceRighti$4(arg1, arg2, obj) { | ||
return obj.reduceRight(arg1, arg2); | ||
} | ||
function some$4(arg1, obj) { | ||
return obj.some(arg1); | ||
} | ||
function somei$4(arg1, obj) { | ||
return obj.some(arg1); | ||
} | ||
var $$Uint16Array = { | ||
setArray: setArray$4, | ||
setArrayOffset: setArrayOffset$4, | ||
copyWithin: copyWithin$4, | ||
copyWithinFrom: copyWithinFrom$4, | ||
copyWithinFromRange: copyWithinFromRange$4, | ||
fillInPlace: fillInPlace$4, | ||
fillFromInPlace: fillFromInPlace$4, | ||
fillRangeInPlace: fillRangeInPlace$4, | ||
sortInPlaceWith: sortInPlaceWith$4, | ||
includes: includes$4, | ||
indexOf: indexOf$4, | ||
indexOfFrom: indexOfFrom$4, | ||
joinWith: joinWith$4, | ||
lastIndexOf: lastIndexOf$4, | ||
lastIndexOfFrom: lastIndexOfFrom$4, | ||
slice: slice$5, | ||
sliceFrom: sliceFrom$5, | ||
subarray: subarray$4, | ||
subarrayFrom: subarrayFrom$4, | ||
every: every$4, | ||
everyi: everyi$4, | ||
filter: filter$4, | ||
filteri: filteri$4, | ||
find: find$4, | ||
findi: findi$4, | ||
findIndex: findIndex$4, | ||
findIndexi: findIndexi$4, | ||
forEach: forEach$4, | ||
forEachi: forEachi$4, | ||
map: map$4, | ||
mapi: mapi$4, | ||
reduce: reduce$4, | ||
reducei: reducei$4, | ||
reduceRight: reduceRight$4, | ||
reduceRighti: reduceRighti$4, | ||
some: some$4, | ||
somei: somei$4 | ||
}; | ||
function setArray$5(arg1, obj) { | ||
obj.set(arg1); | ||
} | ||
function setArrayOffset$5(arg1, arg2, obj) { | ||
obj.set(arg1, arg2); | ||
} | ||
function copyWithin$5(to_, obj) { | ||
return obj.copyWithin(to_); | ||
} | ||
function copyWithinFrom$5(to_, from, obj) { | ||
return obj.copyWithin(to_, from); | ||
} | ||
function copyWithinFromRange$5(to_, start, end_, obj) { | ||
return obj.copyWithin(to_, start, end_); | ||
} | ||
function fillInPlace$5(arg1, obj) { | ||
return obj.fill(arg1); | ||
} | ||
function fillFromInPlace$5(arg1, from, obj) { | ||
return obj.fill(arg1, from); | ||
} | ||
function fillRangeInPlace$5(arg1, start, end_, obj) { | ||
return obj.fill(arg1, start, end_); | ||
} | ||
function sortInPlaceWith$5(arg1, obj) { | ||
return obj.sort(arg1); | ||
} | ||
function includes$5(arg1, obj) { | ||
return obj.includes(arg1); | ||
} | ||
function indexOf$5(arg1, obj) { | ||
return obj.indexOf(arg1); | ||
} | ||
function indexOfFrom$5(arg1, from, obj) { | ||
return obj.indexOf(arg1, from); | ||
} | ||
function joinWith$5(arg1, obj) { | ||
return obj.join(arg1); | ||
} | ||
function lastIndexOf$5(arg1, obj) { | ||
return obj.lastIndexOf(arg1); | ||
} | ||
function lastIndexOfFrom$5(arg1, from, obj) { | ||
return obj.lastIndexOf(arg1, from); | ||
} | ||
function slice$6(start, end_, obj) { | ||
return obj.slice(start, end_); | ||
} | ||
function sliceFrom$6(arg1, obj) { | ||
return obj.slice(arg1); | ||
} | ||
function subarray$5(start, end_, obj) { | ||
return obj.subarray(start, end_); | ||
} | ||
function subarrayFrom$5(arg1, obj) { | ||
return obj.subarray(arg1); | ||
} | ||
function every$5(arg1, obj) { | ||
return obj.every(arg1); | ||
} | ||
function everyi$5(arg1, obj) { | ||
return obj.every(arg1); | ||
} | ||
function filter$5(arg1, obj) { | ||
return obj.filter(arg1); | ||
} | ||
function filteri$5(arg1, obj) { | ||
return obj.filter(arg1); | ||
} | ||
function find$5(arg1, obj) { | ||
return obj.find(arg1); | ||
} | ||
function findi$5(arg1, obj) { | ||
return obj.find(arg1); | ||
} | ||
function findIndex$5(arg1, obj) { | ||
return obj.findIndex(arg1); | ||
} | ||
function findIndexi$5(arg1, obj) { | ||
return obj.findIndex(arg1); | ||
} | ||
function forEach$5(arg1, obj) { | ||
obj.forEach(arg1); | ||
} | ||
function forEachi$5(arg1, obj) { | ||
obj.forEach(arg1); | ||
} | ||
function map$5(arg1, obj) { | ||
return obj.map(arg1); | ||
} | ||
function mapi$5(arg1, obj) { | ||
return obj.map(arg1); | ||
} | ||
function reduce$5(arg1, arg2, obj) { | ||
return obj.reduce(arg1, arg2); | ||
} | ||
function reducei$5(arg1, arg2, obj) { | ||
return obj.reduce(arg1, arg2); | ||
} | ||
function reduceRight$5(arg1, arg2, obj) { | ||
return obj.reduceRight(arg1, arg2); | ||
} | ||
function reduceRighti$5(arg1, arg2, obj) { | ||
return obj.reduceRight(arg1, arg2); | ||
} | ||
function some$5(arg1, obj) { | ||
return obj.some(arg1); | ||
} | ||
function somei$5(arg1, obj) { | ||
return obj.some(arg1); | ||
} | ||
var $$Int32Array = { | ||
setArray: setArray$5, | ||
setArrayOffset: setArrayOffset$5, | ||
copyWithin: copyWithin$5, | ||
copyWithinFrom: copyWithinFrom$5, | ||
copyWithinFromRange: copyWithinFromRange$5, | ||
fillInPlace: fillInPlace$5, | ||
fillFromInPlace: fillFromInPlace$5, | ||
fillRangeInPlace: fillRangeInPlace$5, | ||
sortInPlaceWith: sortInPlaceWith$5, | ||
includes: includes$5, | ||
indexOf: indexOf$5, | ||
indexOfFrom: indexOfFrom$5, | ||
joinWith: joinWith$5, | ||
lastIndexOf: lastIndexOf$5, | ||
lastIndexOfFrom: lastIndexOfFrom$5, | ||
slice: slice$6, | ||
sliceFrom: sliceFrom$6, | ||
subarray: subarray$5, | ||
subarrayFrom: subarrayFrom$5, | ||
every: every$5, | ||
everyi: everyi$5, | ||
filter: filter$5, | ||
filteri: filteri$5, | ||
find: find$5, | ||
findi: findi$5, | ||
findIndex: findIndex$5, | ||
findIndexi: findIndexi$5, | ||
forEach: forEach$5, | ||
forEachi: forEachi$5, | ||
map: map$5, | ||
mapi: mapi$5, | ||
reduce: reduce$5, | ||
reducei: reducei$5, | ||
reduceRight: reduceRight$5, | ||
reduceRighti: reduceRighti$5, | ||
some: some$5, | ||
somei: somei$5 | ||
}; | ||
function setArray$6(arg1, obj) { | ||
obj.set(arg1); | ||
} | ||
function setArrayOffset$6(arg1, arg2, obj) { | ||
obj.set(arg1, arg2); | ||
} | ||
function copyWithin$6(to_, obj) { | ||
return obj.copyWithin(to_); | ||
} | ||
function copyWithinFrom$6(to_, from, obj) { | ||
return obj.copyWithin(to_, from); | ||
} | ||
function copyWithinFromRange$6(to_, start, end_, obj) { | ||
return obj.copyWithin(to_, start, end_); | ||
} | ||
function fillInPlace$6(arg1, obj) { | ||
return obj.fill(arg1); | ||
} | ||
function fillFromInPlace$6(arg1, from, obj) { | ||
return obj.fill(arg1, from); | ||
} | ||
function fillRangeInPlace$6(arg1, start, end_, obj) { | ||
return obj.fill(arg1, start, end_); | ||
} | ||
function sortInPlaceWith$6(arg1, obj) { | ||
return obj.sort(arg1); | ||
} | ||
function includes$6(arg1, obj) { | ||
return obj.includes(arg1); | ||
} | ||
function indexOf$6(arg1, obj) { | ||
return obj.indexOf(arg1); | ||
} | ||
function indexOfFrom$6(arg1, from, obj) { | ||
return obj.indexOf(arg1, from); | ||
} | ||
function joinWith$6(arg1, obj) { | ||
return obj.join(arg1); | ||
} | ||
function lastIndexOf$6(arg1, obj) { | ||
return obj.lastIndexOf(arg1); | ||
} | ||
function lastIndexOfFrom$6(arg1, from, obj) { | ||
return obj.lastIndexOf(arg1, from); | ||
} | ||
function slice$7(start, end_, obj) { | ||
return obj.slice(start, end_); | ||
} | ||
function sliceFrom$7(arg1, obj) { | ||
return obj.slice(arg1); | ||
} | ||
function subarray$6(start, end_, obj) { | ||
return obj.subarray(start, end_); | ||
} | ||
function subarrayFrom$6(arg1, obj) { | ||
return obj.subarray(arg1); | ||
} | ||
function every$6(arg1, obj) { | ||
return obj.every(arg1); | ||
} | ||
function everyi$6(arg1, obj) { | ||
return obj.every(arg1); | ||
} | ||
function filter$6(arg1, obj) { | ||
return obj.filter(arg1); | ||
} | ||
function filteri$6(arg1, obj) { | ||
return obj.filter(arg1); | ||
} | ||
function find$6(arg1, obj) { | ||
return obj.find(arg1); | ||
} | ||
function findi$6(arg1, obj) { | ||
return obj.find(arg1); | ||
} | ||
function findIndex$6(arg1, obj) { | ||
return obj.findIndex(arg1); | ||
} | ||
function findIndexi$6(arg1, obj) { | ||
return obj.findIndex(arg1); | ||
} | ||
function forEach$6(arg1, obj) { | ||
obj.forEach(arg1); | ||
} | ||
function forEachi$6(arg1, obj) { | ||
obj.forEach(arg1); | ||
} | ||
function map$6(arg1, obj) { | ||
return obj.map(arg1); | ||
} | ||
function mapi$6(arg1, obj) { | ||
return obj.map(arg1); | ||
} | ||
function reduce$6(arg1, arg2, obj) { | ||
return obj.reduce(arg1, arg2); | ||
} | ||
function reducei$6(arg1, arg2, obj) { | ||
return obj.reduce(arg1, arg2); | ||
} | ||
function reduceRight$6(arg1, arg2, obj) { | ||
return obj.reduceRight(arg1, arg2); | ||
} | ||
function reduceRighti$6(arg1, arg2, obj) { | ||
return obj.reduceRight(arg1, arg2); | ||
} | ||
function some$6(arg1, obj) { | ||
return obj.some(arg1); | ||
} | ||
function somei$6(arg1, obj) { | ||
return obj.some(arg1); | ||
} | ||
var $$Uint32Array = { | ||
setArray: setArray$6, | ||
setArrayOffset: setArrayOffset$6, | ||
copyWithin: copyWithin$6, | ||
copyWithinFrom: copyWithinFrom$6, | ||
copyWithinFromRange: copyWithinFromRange$6, | ||
fillInPlace: fillInPlace$6, | ||
fillFromInPlace: fillFromInPlace$6, | ||
fillRangeInPlace: fillRangeInPlace$6, | ||
sortInPlaceWith: sortInPlaceWith$6, | ||
includes: includes$6, | ||
indexOf: indexOf$6, | ||
indexOfFrom: indexOfFrom$6, | ||
joinWith: joinWith$6, | ||
lastIndexOf: lastIndexOf$6, | ||
lastIndexOfFrom: lastIndexOfFrom$6, | ||
slice: slice$7, | ||
sliceFrom: sliceFrom$7, | ||
subarray: subarray$6, | ||
subarrayFrom: subarrayFrom$6, | ||
every: every$6, | ||
everyi: everyi$6, | ||
filter: filter$6, | ||
filteri: filteri$6, | ||
find: find$6, | ||
findi: findi$6, | ||
findIndex: findIndex$6, | ||
findIndexi: findIndexi$6, | ||
forEach: forEach$6, | ||
forEachi: forEachi$6, | ||
map: map$6, | ||
mapi: mapi$6, | ||
reduce: reduce$6, | ||
reducei: reducei$6, | ||
reduceRight: reduceRight$6, | ||
reduceRighti: reduceRighti$6, | ||
some: some$6, | ||
somei: somei$6 | ||
}; | ||
function setArray$7(arg1, obj) { | ||
obj.set(arg1); | ||
} | ||
function setArrayOffset$7(arg1, arg2, obj) { | ||
obj.set(arg1, arg2); | ||
} | ||
function copyWithin$7(to_, obj) { | ||
return obj.copyWithin(to_); | ||
} | ||
function copyWithinFrom$7(to_, from, obj) { | ||
return obj.copyWithin(to_, from); | ||
} | ||
function copyWithinFromRange$7(to_, start, end_, obj) { | ||
return obj.copyWithin(to_, start, end_); | ||
} | ||
function fillInPlace$7(arg1, obj) { | ||
return obj.fill(arg1); | ||
} | ||
function fillFromInPlace$7(arg1, from, obj) { | ||
return obj.fill(arg1, from); | ||
} | ||
function fillRangeInPlace$7(arg1, start, end_, obj) { | ||
return obj.fill(arg1, start, end_); | ||
} | ||
function sortInPlaceWith$7(arg1, obj) { | ||
return obj.sort(arg1); | ||
} | ||
function includes$7(arg1, obj) { | ||
return obj.includes(arg1); | ||
} | ||
function indexOf$7(arg1, obj) { | ||
return obj.indexOf(arg1); | ||
} | ||
function indexOfFrom$7(arg1, from, obj) { | ||
return obj.indexOf(arg1, from); | ||
} | ||
function joinWith$7(arg1, obj) { | ||
return obj.join(arg1); | ||
} | ||
function lastIndexOf$7(arg1, obj) { | ||
return obj.lastIndexOf(arg1); | ||
} | ||
function lastIndexOfFrom$7(arg1, from, obj) { | ||
return obj.lastIndexOf(arg1, from); | ||
} | ||
function slice$8(start, end_, obj) { | ||
return obj.slice(start, end_); | ||
} | ||
function sliceFrom$8(arg1, obj) { | ||
return obj.slice(arg1); | ||
} | ||
function subarray$7(start, end_, obj) { | ||
return obj.subarray(start, end_); | ||
} | ||
function subarrayFrom$7(arg1, obj) { | ||
return obj.subarray(arg1); | ||
} | ||
function every$7(arg1, obj) { | ||
return obj.every(arg1); | ||
} | ||
function everyi$7(arg1, obj) { | ||
return obj.every(arg1); | ||
} | ||
function filter$7(arg1, obj) { | ||
return obj.filter(arg1); | ||
} | ||
function filteri$7(arg1, obj) { | ||
return obj.filter(arg1); | ||
} | ||
function find$7(arg1, obj) { | ||
return obj.find(arg1); | ||
} | ||
function findi$7(arg1, obj) { | ||
return obj.find(arg1); | ||
} | ||
function findIndex$7(arg1, obj) { | ||
return obj.findIndex(arg1); | ||
} | ||
function findIndexi$7(arg1, obj) { | ||
return obj.findIndex(arg1); | ||
} | ||
function forEach$7(arg1, obj) { | ||
obj.forEach(arg1); | ||
} | ||
function forEachi$7(arg1, obj) { | ||
obj.forEach(arg1); | ||
} | ||
function map$7(arg1, obj) { | ||
return obj.map(arg1); | ||
} | ||
function mapi$7(arg1, obj) { | ||
return obj.map(arg1); | ||
} | ||
function reduce$7(arg1, arg2, obj) { | ||
return obj.reduce(arg1, arg2); | ||
} | ||
function reducei$7(arg1, arg2, obj) { | ||
return obj.reduce(arg1, arg2); | ||
} | ||
function reduceRight$7(arg1, arg2, obj) { | ||
return obj.reduceRight(arg1, arg2); | ||
} | ||
function reduceRighti$7(arg1, arg2, obj) { | ||
return obj.reduceRight(arg1, arg2); | ||
} | ||
function some$7(arg1, obj) { | ||
return obj.some(arg1); | ||
} | ||
function somei$7(arg1, obj) { | ||
return obj.some(arg1); | ||
} | ||
var $$Float32Array = { | ||
setArray: setArray$7, | ||
setArrayOffset: setArrayOffset$7, | ||
copyWithin: copyWithin$7, | ||
copyWithinFrom: copyWithinFrom$7, | ||
copyWithinFromRange: copyWithinFromRange$7, | ||
fillInPlace: fillInPlace$7, | ||
fillFromInPlace: fillFromInPlace$7, | ||
fillRangeInPlace: fillRangeInPlace$7, | ||
sortInPlaceWith: sortInPlaceWith$7, | ||
includes: includes$7, | ||
indexOf: indexOf$7, | ||
indexOfFrom: indexOfFrom$7, | ||
joinWith: joinWith$7, | ||
lastIndexOf: lastIndexOf$7, | ||
lastIndexOfFrom: lastIndexOfFrom$7, | ||
slice: slice$8, | ||
sliceFrom: sliceFrom$8, | ||
subarray: subarray$7, | ||
subarrayFrom: subarrayFrom$7, | ||
every: every$7, | ||
everyi: everyi$7, | ||
filter: filter$7, | ||
filteri: filteri$7, | ||
find: find$7, | ||
findi: findi$7, | ||
findIndex: findIndex$7, | ||
findIndexi: findIndexi$7, | ||
forEach: forEach$7, | ||
forEachi: forEachi$7, | ||
map: map$7, | ||
mapi: mapi$7, | ||
reduce: reduce$7, | ||
reducei: reducei$7, | ||
reduceRight: reduceRight$7, | ||
reduceRighti: reduceRighti$7, | ||
some: some$7, | ||
somei: somei$7 | ||
}; | ||
function setArray$8(arg1, obj) { | ||
obj.set(arg1); | ||
} | ||
function setArrayOffset$8(arg1, arg2, obj) { | ||
obj.set(arg1, arg2); | ||
} | ||
function copyWithin$8(to_, obj) { | ||
return obj.copyWithin(to_); | ||
} | ||
function copyWithinFrom$8(to_, from, obj) { | ||
return obj.copyWithin(to_, from); | ||
} | ||
function copyWithinFromRange$8(to_, start, end_, obj) { | ||
return obj.copyWithin(to_, start, end_); | ||
} | ||
function fillInPlace$8(arg1, obj) { | ||
return obj.fill(arg1); | ||
} | ||
function fillFromInPlace$8(arg1, from, obj) { | ||
return obj.fill(arg1, from); | ||
} | ||
function fillRangeInPlace$8(arg1, start, end_, obj) { | ||
return obj.fill(arg1, start, end_); | ||
} | ||
function sortInPlaceWith$8(arg1, obj) { | ||
return obj.sort(arg1); | ||
} | ||
function includes$8(arg1, obj) { | ||
return obj.includes(arg1); | ||
} | ||
function indexOf$8(arg1, obj) { | ||
return obj.indexOf(arg1); | ||
} | ||
function indexOfFrom$8(arg1, from, obj) { | ||
return obj.indexOf(arg1, from); | ||
} | ||
function joinWith$8(arg1, obj) { | ||
return obj.join(arg1); | ||
} | ||
function lastIndexOf$8(arg1, obj) { | ||
return obj.lastIndexOf(arg1); | ||
} | ||
function lastIndexOfFrom$8(arg1, from, obj) { | ||
return obj.lastIndexOf(arg1, from); | ||
} | ||
function slice$9(start, end_, obj) { | ||
return obj.slice(start, end_); | ||
} | ||
function sliceFrom$9(arg1, obj) { | ||
return obj.slice(arg1); | ||
} | ||
function subarray$8(start, end_, obj) { | ||
return obj.subarray(start, end_); | ||
} | ||
function subarrayFrom$8(arg1, obj) { | ||
return obj.subarray(arg1); | ||
} | ||
function every$8(arg1, obj) { | ||
return obj.every(arg1); | ||
} | ||
function everyi$8(arg1, obj) { | ||
return obj.every(arg1); | ||
} | ||
function filter$8(arg1, obj) { | ||
return obj.filter(arg1); | ||
} | ||
function filteri$8(arg1, obj) { | ||
return obj.filter(arg1); | ||
} | ||
function find$8(arg1, obj) { | ||
return obj.find(arg1); | ||
} | ||
function findi$8(arg1, obj) { | ||
return obj.find(arg1); | ||
} | ||
function findIndex$8(arg1, obj) { | ||
return obj.findIndex(arg1); | ||
} | ||
function findIndexi$8(arg1, obj) { | ||
return obj.findIndex(arg1); | ||
} | ||
function forEach$8(arg1, obj) { | ||
obj.forEach(arg1); | ||
} | ||
function forEachi$8(arg1, obj) { | ||
obj.forEach(arg1); | ||
} | ||
function map$8(arg1, obj) { | ||
return obj.map(arg1); | ||
} | ||
function mapi$8(arg1, obj) { | ||
return obj.map(arg1); | ||
} | ||
function reduce$8(arg1, arg2, obj) { | ||
return obj.reduce(arg1, arg2); | ||
} | ||
function reducei$8(arg1, arg2, obj) { | ||
return obj.reduce(arg1, arg2); | ||
} | ||
function reduceRight$8(arg1, arg2, obj) { | ||
return obj.reduceRight(arg1, arg2); | ||
} | ||
function reduceRighti$8(arg1, arg2, obj) { | ||
return obj.reduceRight(arg1, arg2); | ||
} | ||
function some$8(arg1, obj) { | ||
return obj.some(arg1); | ||
} | ||
function somei$8(arg1, obj) { | ||
return obj.some(arg1); | ||
} | ||
var $$Float64Array = { | ||
setArray: setArray$8, | ||
setArrayOffset: setArrayOffset$8, | ||
copyWithin: copyWithin$8, | ||
copyWithinFrom: copyWithinFrom$8, | ||
copyWithinFromRange: copyWithinFromRange$8, | ||
fillInPlace: fillInPlace$8, | ||
fillFromInPlace: fillFromInPlace$8, | ||
fillRangeInPlace: fillRangeInPlace$8, | ||
sortInPlaceWith: sortInPlaceWith$8, | ||
includes: includes$8, | ||
indexOf: indexOf$8, | ||
indexOfFrom: indexOfFrom$8, | ||
joinWith: joinWith$8, | ||
lastIndexOf: lastIndexOf$8, | ||
lastIndexOfFrom: lastIndexOfFrom$8, | ||
slice: slice$9, | ||
sliceFrom: sliceFrom$9, | ||
subarray: subarray$8, | ||
subarrayFrom: subarrayFrom$8, | ||
every: every$8, | ||
everyi: everyi$8, | ||
filter: filter$8, | ||
filteri: filteri$8, | ||
find: find$8, | ||
findi: findi$8, | ||
findIndex: findIndex$8, | ||
findIndexi: findIndexi$8, | ||
forEach: forEach$8, | ||
forEachi: forEachi$8, | ||
map: map$8, | ||
mapi: mapi$8, | ||
reduce: reduce$8, | ||
reducei: reducei$8, | ||
reduceRight: reduceRight$8, | ||
reduceRighti: reduceRighti$8, | ||
some: some$8, | ||
somei: somei$8 | ||
}; | ||
var $$DataView = {}; | ||
@@ -25,0 +1710,0 @@ |
@@ -15,2 +15,7 @@ 'use strict'; | ||
}; | ||
} else if (ty === "bigint") { | ||
return { | ||
TAG: /* JSBigInt */5, | ||
_0: x | ||
}; | ||
} else if (ty === "string") { | ||
@@ -27,10 +32,10 @@ return { | ||
} | ||
} else if (ty === "function") { | ||
} else if (ty === "symbol") { | ||
return { | ||
TAG: /* JSFunction */2, | ||
TAG: /* JSSymbol */4, | ||
_0: x | ||
}; | ||
} else if (ty === "object") { | ||
} else if (ty === "function") { | ||
return { | ||
TAG: /* JSObject */3, | ||
TAG: /* JSFunction */2, | ||
_0: x | ||
@@ -40,3 +45,3 @@ }; | ||
return { | ||
TAG: /* JSSymbol */4, | ||
TAG: /* JSObject */3, | ||
_0: x | ||
@@ -65,2 +70,4 @@ }; | ||
return typeof x === "symbol"; | ||
case /* BigInt */8 : | ||
return typeof x === "bigint"; | ||
@@ -67,0 +74,0 @@ } |
@@ -16,3 +16,2 @@ 'use strict'; | ||
a.splice(j); | ||
} | ||
@@ -22,3 +21,2 @@ | ||
a.splice(0); | ||
} | ||
@@ -28,3 +26,2 @@ | ||
xs.push(x); | ||
} | ||
@@ -40,3 +37,2 @@ | ||
} | ||
} | ||
@@ -48,3 +44,2 @@ | ||
} | ||
} | ||
@@ -51,0 +46,0 @@ |
@@ -8,6 +8,5 @@ 'use strict'; | ||
var Caml_lexer = require("./caml_lexer.js"); | ||
var Pervasives = require("./pervasives.js"); | ||
function engine(tbl, state, buf) { | ||
var result = Caml_lexer.caml_lex_engine(tbl, state, buf); | ||
var result = Caml_lexer.lex_engine(tbl, state, buf); | ||
if (result >= 0) { | ||
@@ -27,3 +26,3 @@ buf.lex_start_p = buf.lex_curr_p; | ||
function new_engine(tbl, state, buf) { | ||
var result = Caml_lexer.caml_new_lex_engine(tbl, state, buf); | ||
var result = Caml_lexer.new_lex_engine(tbl, state, buf); | ||
if (result >= 0) { | ||
@@ -50,3 +49,3 @@ buf.lex_start_p = buf.lex_curr_p; | ||
function from_function(f) { | ||
var partial_arg = Caml_bytes.caml_create_bytes(512); | ||
var partial_arg = Caml_bytes.create(512); | ||
return { | ||
@@ -68,3 +67,3 @@ refill_buff: (function (param) { | ||
} | ||
var newbuf = Caml_bytes.caml_create_bytes(newlen); | ||
var newbuf = Caml_bytes.create(newlen); | ||
Bytes.blit(param.lex_buffer, param.lex_start_pos, newbuf, 0, param.lex_buffer_len - param.lex_start_pos | 0); | ||
@@ -90,5 +89,4 @@ param.lex_buffer = newbuf; | ||
param.lex_buffer_len = param.lex_buffer_len + n | 0; | ||
}), | ||
lex_buffer: Caml_bytes.caml_create_bytes(1024), | ||
lex_buffer: Caml_bytes.create(1024), | ||
lex_buffer_len: 0, | ||
@@ -107,8 +105,2 @@ lex_abs_pos: 0, | ||
function from_channel(ic) { | ||
return from_function(function (buf, n) { | ||
return Pervasives.input(ic, buf, 0, n); | ||
}); | ||
} | ||
function from_string(s) { | ||
@@ -118,3 +110,2 @@ return { | ||
lexbuf.lex_eof_reached = true; | ||
}), | ||
@@ -192,3 +183,2 @@ lex_buffer: Bytes.of_string(s), | ||
}; | ||
} | ||
@@ -207,3 +197,2 @@ | ||
lb.lex_buffer_len = 0; | ||
} | ||
@@ -219,3 +208,2 @@ | ||
exports.dummy_pos = dummy_pos; | ||
exports.from_channel = from_channel; | ||
exports.from_string = from_string; | ||
@@ -222,0 +210,0 @@ exports.from_function = from_function; |
@@ -501,3 +501,3 @@ 'use strict'; | ||
} | ||
if (Caml_obj.caml_equal(param.hd, x)) { | ||
if (Caml_obj.equal(param.hd, x)) { | ||
return true; | ||
@@ -529,3 +529,3 @@ } | ||
var match = param.hd; | ||
if (Caml_obj.caml_equal(match[0], x)) { | ||
if (Caml_obj.equal(match[0], x)) { | ||
return match[1]; | ||
@@ -550,3 +550,3 @@ } | ||
var match = param.hd; | ||
if (Caml_obj.caml_equal(match[0], x)) { | ||
if (Caml_obj.equal(match[0], x)) { | ||
return Caml_option.some(match[1]); | ||
@@ -598,3 +598,3 @@ } | ||
} | ||
if (Caml_obj.caml_equal(param.hd[0], x)) { | ||
if (Caml_obj.equal(param.hd[0], x)) { | ||
return true; | ||
@@ -627,3 +627,3 @@ } | ||
var pair = param.hd; | ||
if (Caml_obj.caml_equal(pair[0], x)) { | ||
if (Caml_obj.equal(pair[0], x)) { | ||
return l; | ||
@@ -630,0 +630,0 @@ } else { |
'use strict'; | ||
var List = require("./list.js"); | ||
var Curry = require("./curry.js"); | ||
var Caml_obj = require("./caml_obj.js"); | ||
var Pervasives = require("./pervasives.js"); | ||
var Caml_option = require("./caml_option.js"); | ||
var length = List.length; | ||
function length(l) { | ||
var _len = 0; | ||
var _param = l; | ||
while(true) { | ||
var param = _param; | ||
var len = _len; | ||
if (!param) { | ||
return len; | ||
} | ||
_param = param.tl; | ||
_len = len + 1 | 0; | ||
continue ; | ||
}; | ||
} | ||
var hd = List.hd; | ||
function cons(a, l) { | ||
return { | ||
hd: a, | ||
tl: l | ||
}; | ||
} | ||
var compare_lengths = List.compare_lengths; | ||
function hd(param) { | ||
if (param) { | ||
return param.hd; | ||
} | ||
throw { | ||
RE_EXN_ID: "Failure", | ||
_1: "hd", | ||
Error: new Error() | ||
}; | ||
} | ||
var compare_length_with = List.compare_length_with; | ||
function tl(param) { | ||
if (param) { | ||
return param.tl; | ||
} | ||
throw { | ||
RE_EXN_ID: "Failure", | ||
_1: "tl", | ||
Error: new Error() | ||
}; | ||
} | ||
var cons = List.cons; | ||
function nth(l, n) { | ||
if (n < 0) { | ||
throw { | ||
RE_EXN_ID: "Invalid_argument", | ||
_1: "List.nth", | ||
Error: new Error() | ||
}; | ||
} | ||
var _l = l; | ||
var _n = n; | ||
while(true) { | ||
var n$1 = _n; | ||
var l$1 = _l; | ||
if (l$1) { | ||
if (n$1 === 0) { | ||
return l$1.hd; | ||
} | ||
_n = n$1 - 1 | 0; | ||
_l = l$1.tl; | ||
continue ; | ||
} | ||
throw { | ||
RE_EXN_ID: "Failure", | ||
_1: "nth", | ||
Error: new Error() | ||
}; | ||
}; | ||
} | ||
var tl = List.tl; | ||
function nth_opt(l, n) { | ||
if (n < 0) { | ||
throw { | ||
RE_EXN_ID: "Invalid_argument", | ||
_1: "List.nth", | ||
Error: new Error() | ||
}; | ||
} | ||
var _l = l; | ||
var _n = n; | ||
while(true) { | ||
var n$1 = _n; | ||
var l$1 = _l; | ||
if (!l$1) { | ||
return ; | ||
} | ||
if (n$1 === 0) { | ||
return Caml_option.some(l$1.hd); | ||
} | ||
_n = n$1 - 1 | 0; | ||
_l = l$1.tl; | ||
continue ; | ||
}; | ||
} | ||
var nth = List.nth; | ||
function rev_append(_l1, _l2) { | ||
while(true) { | ||
var l2 = _l2; | ||
var l1 = _l1; | ||
if (!l1) { | ||
return l2; | ||
} | ||
_l2 = { | ||
hd: l1.hd, | ||
tl: l2 | ||
}; | ||
_l1 = l1.tl; | ||
continue ; | ||
}; | ||
} | ||
var nth_opt = List.nth_opt; | ||
function rev(l) { | ||
return rev_append(l, /* [] */0); | ||
} | ||
var rev = List.rev; | ||
function init_tailrec_aux(_acc, _i, n, f) { | ||
while(true) { | ||
var i = _i; | ||
var acc = _acc; | ||
if (i >= n) { | ||
return acc; | ||
} | ||
_i = i + 1 | 0; | ||
_acc = { | ||
hd: Curry._1(f, i), | ||
tl: acc | ||
}; | ||
continue ; | ||
}; | ||
} | ||
var init = List.init; | ||
function init_aux(i, n, f) { | ||
if (i >= n) { | ||
return /* [] */0; | ||
} | ||
var r = Curry._1(f, i); | ||
return { | ||
hd: r, | ||
tl: init_aux(i + 1 | 0, n, f) | ||
}; | ||
} | ||
var append = List.append; | ||
function init(len, f) { | ||
if (len < 0) { | ||
throw { | ||
RE_EXN_ID: "Invalid_argument", | ||
_1: "List.init", | ||
Error: new Error() | ||
}; | ||
} | ||
if (len > 10000) { | ||
return rev_append(init_tailrec_aux(/* [] */0, 0, len, f), /* [] */0); | ||
} else { | ||
return init_aux(0, len, f); | ||
} | ||
} | ||
var rev_append = List.rev_append; | ||
function flatten(param) { | ||
if (param) { | ||
return Pervasives.$at(param.hd, flatten(param.tl)); | ||
} else { | ||
return /* [] */0; | ||
} | ||
} | ||
var concat = List.concat; | ||
function map(f, param) { | ||
if (!param) { | ||
return /* [] */0; | ||
} | ||
var r = Curry._1(f, param.hd); | ||
return { | ||
hd: r, | ||
tl: map(f, param.tl) | ||
}; | ||
} | ||
var flatten = List.flatten; | ||
function mapi(i, f, param) { | ||
if (!param) { | ||
return /* [] */0; | ||
} | ||
var r = Curry._2(f, i, param.hd); | ||
return { | ||
hd: r, | ||
tl: mapi(i + 1 | 0, f, param.tl) | ||
}; | ||
} | ||
var iter = List.iter; | ||
function mapi$1(f, l) { | ||
return mapi(0, f, l); | ||
} | ||
var iteri = List.iteri; | ||
function rev_map(f, l) { | ||
var _accu = /* [] */0; | ||
var _param = l; | ||
while(true) { | ||
var param = _param; | ||
var accu = _accu; | ||
if (!param) { | ||
return accu; | ||
} | ||
_param = param.tl; | ||
_accu = { | ||
hd: Curry._1(f, param.hd), | ||
tl: accu | ||
}; | ||
continue ; | ||
}; | ||
} | ||
var map = List.map; | ||
function iter(f, _param) { | ||
while(true) { | ||
var param = _param; | ||
if (!param) { | ||
return ; | ||
} | ||
Curry._1(f, param.hd); | ||
_param = param.tl; | ||
continue ; | ||
}; | ||
} | ||
var mapi = List.mapi; | ||
function iteri(f, l) { | ||
var _i = 0; | ||
var _param = l; | ||
while(true) { | ||
var param = _param; | ||
var i = _i; | ||
if (!param) { | ||
return ; | ||
} | ||
Curry._2(f, i, param.hd); | ||
_param = param.tl; | ||
_i = i + 1 | 0; | ||
continue ; | ||
}; | ||
} | ||
var rev_map = List.rev_map; | ||
function fold_left(f, _accu, _l) { | ||
while(true) { | ||
var l = _l; | ||
var accu = _accu; | ||
if (!l) { | ||
return accu; | ||
} | ||
_l = l.tl; | ||
_accu = Curry._2(f, accu, l.hd); | ||
continue ; | ||
}; | ||
} | ||
var fold_left = List.fold_left; | ||
function fold_right(f, l, accu) { | ||
if (l) { | ||
return Curry._2(f, l.hd, fold_right(f, l.tl, accu)); | ||
} else { | ||
return accu; | ||
} | ||
} | ||
var fold_right = List.fold_right; | ||
function map2(f, l1, l2) { | ||
if (l1) { | ||
if (l2) { | ||
var r = Curry._2(f, l1.hd, l2.hd); | ||
return { | ||
hd: r, | ||
tl: map2(f, l1.tl, l2.tl) | ||
}; | ||
} | ||
throw { | ||
RE_EXN_ID: "Invalid_argument", | ||
_1: "List.map2", | ||
Error: new Error() | ||
}; | ||
} | ||
if (!l2) { | ||
return /* [] */0; | ||
} | ||
throw { | ||
RE_EXN_ID: "Invalid_argument", | ||
_1: "List.map2", | ||
Error: new Error() | ||
}; | ||
} | ||
var iter2 = List.iter2; | ||
function rev_map2(f, l1, l2) { | ||
var _accu = /* [] */0; | ||
var _l1 = l1; | ||
var _l2 = l2; | ||
while(true) { | ||
var l2$1 = _l2; | ||
var l1$1 = _l1; | ||
var accu = _accu; | ||
if (l1$1) { | ||
if (l2$1) { | ||
_l2 = l2$1.tl; | ||
_l1 = l1$1.tl; | ||
_accu = { | ||
hd: Curry._2(f, l1$1.hd, l2$1.hd), | ||
tl: accu | ||
}; | ||
continue ; | ||
} | ||
throw { | ||
RE_EXN_ID: "Invalid_argument", | ||
_1: "List.rev_map2", | ||
Error: new Error() | ||
}; | ||
} | ||
if (l2$1) { | ||
throw { | ||
RE_EXN_ID: "Invalid_argument", | ||
_1: "List.rev_map2", | ||
Error: new Error() | ||
}; | ||
} | ||
return accu; | ||
}; | ||
} | ||
var map2 = List.map2; | ||
function iter2(f, _l1, _l2) { | ||
while(true) { | ||
var l2 = _l2; | ||
var l1 = _l1; | ||
if (l1) { | ||
if (l2) { | ||
Curry._2(f, l1.hd, l2.hd); | ||
_l2 = l2.tl; | ||
_l1 = l1.tl; | ||
continue ; | ||
} | ||
throw { | ||
RE_EXN_ID: "Invalid_argument", | ||
_1: "List.iter2", | ||
Error: new Error() | ||
}; | ||
} | ||
if (!l2) { | ||
return ; | ||
} | ||
throw { | ||
RE_EXN_ID: "Invalid_argument", | ||
_1: "List.iter2", | ||
Error: new Error() | ||
}; | ||
}; | ||
} | ||
var rev_map2 = List.rev_map2; | ||
function fold_left2(f, _accu, _l1, _l2) { | ||
while(true) { | ||
var l2 = _l2; | ||
var l1 = _l1; | ||
var accu = _accu; | ||
if (l1) { | ||
if (l2) { | ||
_l2 = l2.tl; | ||
_l1 = l1.tl; | ||
_accu = Curry._3(f, accu, l1.hd, l2.hd); | ||
continue ; | ||
} | ||
throw { | ||
RE_EXN_ID: "Invalid_argument", | ||
_1: "List.fold_left2", | ||
Error: new Error() | ||
}; | ||
} | ||
if (l2) { | ||
throw { | ||
RE_EXN_ID: "Invalid_argument", | ||
_1: "List.fold_left2", | ||
Error: new Error() | ||
}; | ||
} | ||
return accu; | ||
}; | ||
} | ||
var fold_left2 = List.fold_left2; | ||
function fold_right2(f, l1, l2, accu) { | ||
if (l1) { | ||
if (l2) { | ||
return Curry._3(f, l1.hd, l2.hd, fold_right2(f, l1.tl, l2.tl, accu)); | ||
} | ||
throw { | ||
RE_EXN_ID: "Invalid_argument", | ||
_1: "List.fold_right2", | ||
Error: new Error() | ||
}; | ||
} | ||
if (l2) { | ||
throw { | ||
RE_EXN_ID: "Invalid_argument", | ||
_1: "List.fold_right2", | ||
Error: new Error() | ||
}; | ||
} | ||
return accu; | ||
} | ||
var fold_right2 = List.fold_right2; | ||
function for_all(p, _param) { | ||
while(true) { | ||
var param = _param; | ||
if (!param) { | ||
return true; | ||
} | ||
if (!Curry._1(p, param.hd)) { | ||
return false; | ||
} | ||
_param = param.tl; | ||
continue ; | ||
}; | ||
} | ||
var for_all = List.for_all; | ||
function exists(p, _param) { | ||
while(true) { | ||
var param = _param; | ||
if (!param) { | ||
return false; | ||
} | ||
if (Curry._1(p, param.hd)) { | ||
return true; | ||
} | ||
_param = param.tl; | ||
continue ; | ||
}; | ||
} | ||
var exists = List.exists; | ||
function for_all2(p, _l1, _l2) { | ||
while(true) { | ||
var l2 = _l2; | ||
var l1 = _l1; | ||
if (l1) { | ||
if (l2) { | ||
if (!Curry._2(p, l1.hd, l2.hd)) { | ||
return false; | ||
} | ||
_l2 = l2.tl; | ||
_l1 = l1.tl; | ||
continue ; | ||
} | ||
throw { | ||
RE_EXN_ID: "Invalid_argument", | ||
_1: "List.for_all2", | ||
Error: new Error() | ||
}; | ||
} | ||
if (!l2) { | ||
return true; | ||
} | ||
throw { | ||
RE_EXN_ID: "Invalid_argument", | ||
_1: "List.for_all2", | ||
Error: new Error() | ||
}; | ||
}; | ||
} | ||
var for_all2 = List.for_all2; | ||
function exists2(p, _l1, _l2) { | ||
while(true) { | ||
var l2 = _l2; | ||
var l1 = _l1; | ||
if (l1) { | ||
if (l2) { | ||
if (Curry._2(p, l1.hd, l2.hd)) { | ||
return true; | ||
} | ||
_l2 = l2.tl; | ||
_l1 = l1.tl; | ||
continue ; | ||
} | ||
throw { | ||
RE_EXN_ID: "Invalid_argument", | ||
_1: "List.exists2", | ||
Error: new Error() | ||
}; | ||
} | ||
if (!l2) { | ||
return false; | ||
} | ||
throw { | ||
RE_EXN_ID: "Invalid_argument", | ||
_1: "List.exists2", | ||
Error: new Error() | ||
}; | ||
}; | ||
} | ||
var exists2 = List.exists2; | ||
function mem(x, _set) { | ||
while(true) { | ||
var set = _set; | ||
if (!set) { | ||
return false; | ||
} | ||
if (Caml_obj.equal(set.hd, x)) { | ||
return true; | ||
} | ||
_set = set.tl; | ||
continue ; | ||
}; | ||
} | ||
var mem = List.mem; | ||
function memq(x, _set) { | ||
while(true) { | ||
var set = _set; | ||
if (!set) { | ||
return false; | ||
} | ||
if (set.hd === x) { | ||
return true; | ||
} | ||
_set = set.tl; | ||
continue ; | ||
}; | ||
} | ||
var memq = List.memq; | ||
function assoc(x, _param) { | ||
while(true) { | ||
var param = _param; | ||
if (param) { | ||
var match = param.hd; | ||
if (Caml_obj.equal(match[0], x)) { | ||
return match[1]; | ||
} | ||
_param = param.tl; | ||
continue ; | ||
} | ||
throw { | ||
RE_EXN_ID: "Not_found", | ||
Error: new Error() | ||
}; | ||
}; | ||
} | ||
var find = List.find; | ||
function assoc_opt(x, _param) { | ||
while(true) { | ||
var param = _param; | ||
if (!param) { | ||
return ; | ||
} | ||
var match = param.hd; | ||
if (Caml_obj.equal(match[0], x)) { | ||
return Caml_option.some(match[1]); | ||
} | ||
_param = param.tl; | ||
continue ; | ||
}; | ||
} | ||
var find_opt = List.find_opt; | ||
function assq(x, _param) { | ||
while(true) { | ||
var param = _param; | ||
if (param) { | ||
var match = param.hd; | ||
if (match[0] === x) { | ||
return match[1]; | ||
} | ||
_param = param.tl; | ||
continue ; | ||
} | ||
throw { | ||
RE_EXN_ID: "Not_found", | ||
Error: new Error() | ||
}; | ||
}; | ||
} | ||
var filter = List.filter; | ||
function assq_opt(x, _param) { | ||
while(true) { | ||
var param = _param; | ||
if (!param) { | ||
return ; | ||
} | ||
var match = param.hd; | ||
if (match[0] === x) { | ||
return Caml_option.some(match[1]); | ||
} | ||
_param = param.tl; | ||
continue ; | ||
}; | ||
} | ||
var find_all = List.find_all; | ||
function mem_assoc(x, _map) { | ||
while(true) { | ||
var map = _map; | ||
if (!map) { | ||
return false; | ||
} | ||
if (Caml_obj.equal(map.hd[0], x)) { | ||
return true; | ||
} | ||
_map = map.tl; | ||
continue ; | ||
}; | ||
} | ||
var partition = List.partition; | ||
function mem_assq(x, _map) { | ||
while(true) { | ||
var map = _map; | ||
if (!map) { | ||
return false; | ||
} | ||
if (map.hd[0] === x) { | ||
return true; | ||
} | ||
_map = map.tl; | ||
continue ; | ||
}; | ||
} | ||
var assoc = List.assoc; | ||
function remove_assoc(x, param) { | ||
if (!param) { | ||
return /* [] */0; | ||
} | ||
var l = param.tl; | ||
var pair = param.hd; | ||
if (Caml_obj.equal(pair[0], x)) { | ||
return l; | ||
} else { | ||
return { | ||
hd: pair, | ||
tl: remove_assoc(x, l) | ||
}; | ||
} | ||
} | ||
var assoc_opt = List.assoc_opt; | ||
function remove_assq(x, param) { | ||
if (!param) { | ||
return /* [] */0; | ||
} | ||
var l = param.tl; | ||
var pair = param.hd; | ||
if (pair[0] === x) { | ||
return l; | ||
} else { | ||
return { | ||
hd: pair, | ||
tl: remove_assq(x, l) | ||
}; | ||
} | ||
} | ||
var assq = List.assq; | ||
function find(p, _param) { | ||
while(true) { | ||
var param = _param; | ||
if (param) { | ||
var x = param.hd; | ||
if (Curry._1(p, x)) { | ||
return x; | ||
} | ||
_param = param.tl; | ||
continue ; | ||
} | ||
throw { | ||
RE_EXN_ID: "Not_found", | ||
Error: new Error() | ||
}; | ||
}; | ||
} | ||
var assq_opt = List.assq_opt; | ||
function find_opt(p, _param) { | ||
while(true) { | ||
var param = _param; | ||
if (!param) { | ||
return ; | ||
} | ||
var x = param.hd; | ||
if (Curry._1(p, x)) { | ||
return Caml_option.some(x); | ||
} | ||
_param = param.tl; | ||
continue ; | ||
}; | ||
} | ||
var mem_assoc = List.mem_assoc; | ||
function find_all(p) { | ||
return function (param) { | ||
var _accu = /* [] */0; | ||
var _param = param; | ||
while(true) { | ||
var param$1 = _param; | ||
var accu = _accu; | ||
if (!param$1) { | ||
return rev_append(accu, /* [] */0); | ||
} | ||
var l = param$1.tl; | ||
var x = param$1.hd; | ||
if (Curry._1(p, x)) { | ||
_param = l; | ||
_accu = { | ||
hd: x, | ||
tl: accu | ||
}; | ||
continue ; | ||
} | ||
_param = l; | ||
continue ; | ||
}; | ||
}; | ||
} | ||
var mem_assq = List.mem_assq; | ||
function partition(p, l) { | ||
var _yes = /* [] */0; | ||
var _no = /* [] */0; | ||
var _param = l; | ||
while(true) { | ||
var param = _param; | ||
var no = _no; | ||
var yes = _yes; | ||
if (!param) { | ||
return [ | ||
rev_append(yes, /* [] */0), | ||
rev_append(no, /* [] */0) | ||
]; | ||
} | ||
var l$1 = param.tl; | ||
var x = param.hd; | ||
if (Curry._1(p, x)) { | ||
_param = l$1; | ||
_yes = { | ||
hd: x, | ||
tl: yes | ||
}; | ||
continue ; | ||
} | ||
_param = l$1; | ||
_no = { | ||
hd: x, | ||
tl: no | ||
}; | ||
continue ; | ||
}; | ||
} | ||
var remove_assoc = List.remove_assoc; | ||
function split(param) { | ||
if (!param) { | ||
return [ | ||
/* [] */0, | ||
/* [] */0 | ||
]; | ||
} | ||
var match = param.hd; | ||
var match$1 = split(param.tl); | ||
return [ | ||
{ | ||
hd: match[0], | ||
tl: match$1[0] | ||
}, | ||
{ | ||
hd: match[1], | ||
tl: match$1[1] | ||
} | ||
]; | ||
} | ||
var remove_assq = List.remove_assq; | ||
function combine(l1, l2) { | ||
if (l1) { | ||
if (l2) { | ||
return { | ||
hd: [ | ||
l1.hd, | ||
l2.hd | ||
], | ||
tl: combine(l1.tl, l2.tl) | ||
}; | ||
} | ||
throw { | ||
RE_EXN_ID: "Invalid_argument", | ||
_1: "List.combine", | ||
Error: new Error() | ||
}; | ||
} | ||
if (!l2) { | ||
return /* [] */0; | ||
} | ||
throw { | ||
RE_EXN_ID: "Invalid_argument", | ||
_1: "List.combine", | ||
Error: new Error() | ||
}; | ||
} | ||
var split = List.split; | ||
function merge(cmp, l1, l2) { | ||
if (!l1) { | ||
return l2; | ||
} | ||
if (!l2) { | ||
return l1; | ||
} | ||
var h2 = l2.hd; | ||
var h1 = l1.hd; | ||
if (Curry._2(cmp, h1, h2) <= 0) { | ||
return { | ||
hd: h1, | ||
tl: merge(cmp, l1.tl, l2) | ||
}; | ||
} else { | ||
return { | ||
hd: h2, | ||
tl: merge(cmp, l1, l2.tl) | ||
}; | ||
} | ||
} | ||
var combine = List.combine; | ||
function chop(_k, _l) { | ||
while(true) { | ||
var l = _l; | ||
var k = _k; | ||
if (k === 0) { | ||
return l; | ||
} | ||
if (l) { | ||
_l = l.tl; | ||
_k = k - 1 | 0; | ||
continue ; | ||
} | ||
throw { | ||
RE_EXN_ID: "Assert_failure", | ||
_1: [ | ||
"listLabels.ml", | ||
262, | ||
11 | ||
], | ||
Error: new Error() | ||
}; | ||
}; | ||
} | ||
var sort = List.sort; | ||
function stable_sort(cmp, l) { | ||
var sort = function (n, l) { | ||
if (n !== 2) { | ||
if (n === 3 && l) { | ||
var match = l.tl; | ||
if (match) { | ||
var match$1 = match.tl; | ||
if (match$1) { | ||
var x3 = match$1.hd; | ||
var x2 = match.hd; | ||
var x1 = l.hd; | ||
if (Curry._2(cmp, x1, x2) <= 0) { | ||
if (Curry._2(cmp, x2, x3) <= 0) { | ||
return { | ||
hd: x1, | ||
tl: { | ||
hd: x2, | ||
tl: { | ||
hd: x3, | ||
tl: /* [] */0 | ||
} | ||
} | ||
}; | ||
} else if (Curry._2(cmp, x1, x3) <= 0) { | ||
return { | ||
hd: x1, | ||
tl: { | ||
hd: x3, | ||
tl: { | ||
hd: x2, | ||
tl: /* [] */0 | ||
} | ||
} | ||
}; | ||
} else { | ||
return { | ||
hd: x3, | ||
tl: { | ||
hd: x1, | ||
tl: { | ||
hd: x2, | ||
tl: /* [] */0 | ||
} | ||
} | ||
}; | ||
} | ||
} else if (Curry._2(cmp, x1, x3) <= 0) { | ||
return { | ||
hd: x2, | ||
tl: { | ||
hd: x1, | ||
tl: { | ||
hd: x3, | ||
tl: /* [] */0 | ||
} | ||
} | ||
}; | ||
} else if (Curry._2(cmp, x2, x3) <= 0) { | ||
return { | ||
hd: x2, | ||
tl: { | ||
hd: x3, | ||
tl: { | ||
hd: x1, | ||
tl: /* [] */0 | ||
} | ||
} | ||
}; | ||
} else { | ||
return { | ||
hd: x3, | ||
tl: { | ||
hd: x2, | ||
tl: { | ||
hd: x1, | ||
tl: /* [] */0 | ||
} | ||
} | ||
}; | ||
} | ||
} | ||
} | ||
} | ||
} else if (l) { | ||
var match$2 = l.tl; | ||
if (match$2) { | ||
var x2$1 = match$2.hd; | ||
var x1$1 = l.hd; | ||
if (Curry._2(cmp, x1$1, x2$1) <= 0) { | ||
return { | ||
hd: x1$1, | ||
tl: { | ||
hd: x2$1, | ||
tl: /* [] */0 | ||
} | ||
}; | ||
} else { | ||
return { | ||
hd: x2$1, | ||
tl: { | ||
hd: x1$1, | ||
tl: /* [] */0 | ||
} | ||
}; | ||
} | ||
} | ||
} | ||
var n1 = (n >> 1); | ||
var n2 = n - n1 | 0; | ||
var l2 = chop(n1, l); | ||
var s1 = rev_sort(n1, l); | ||
var s2 = rev_sort(n2, l2); | ||
var _l1 = s1; | ||
var _l2 = s2; | ||
var _accu = /* [] */0; | ||
while(true) { | ||
var accu = _accu; | ||
var l2$1 = _l2; | ||
var l1 = _l1; | ||
if (!l1) { | ||
return rev_append(l2$1, accu); | ||
} | ||
if (!l2$1) { | ||
return rev_append(l1, accu); | ||
} | ||
var h2 = l2$1.hd; | ||
var h1 = l1.hd; | ||
if (Curry._2(cmp, h1, h2) > 0) { | ||
_accu = { | ||
hd: h1, | ||
tl: accu | ||
}; | ||
_l1 = l1.tl; | ||
continue ; | ||
} | ||
_accu = { | ||
hd: h2, | ||
tl: accu | ||
}; | ||
_l2 = l2$1.tl; | ||
continue ; | ||
}; | ||
}; | ||
var rev_sort = function (n, l) { | ||
if (n !== 2) { | ||
if (n === 3 && l) { | ||
var match = l.tl; | ||
if (match) { | ||
var match$1 = match.tl; | ||
if (match$1) { | ||
var x3 = match$1.hd; | ||
var x2 = match.hd; | ||
var x1 = l.hd; | ||
if (Curry._2(cmp, x1, x2) > 0) { | ||
if (Curry._2(cmp, x2, x3) > 0) { | ||
return { | ||
hd: x1, | ||
tl: { | ||
hd: x2, | ||
tl: { | ||
hd: x3, | ||
tl: /* [] */0 | ||
} | ||
} | ||
}; | ||
} else if (Curry._2(cmp, x1, x3) > 0) { | ||
return { | ||
hd: x1, | ||
tl: { | ||
hd: x3, | ||
tl: { | ||
hd: x2, | ||
tl: /* [] */0 | ||
} | ||
} | ||
}; | ||
} else { | ||
return { | ||
hd: x3, | ||
tl: { | ||
hd: x1, | ||
tl: { | ||
hd: x2, | ||
tl: /* [] */0 | ||
} | ||
} | ||
}; | ||
} | ||
} else if (Curry._2(cmp, x1, x3) > 0) { | ||
return { | ||
hd: x2, | ||
tl: { | ||
hd: x1, | ||
tl: { | ||
hd: x3, | ||
tl: /* [] */0 | ||
} | ||
} | ||
}; | ||
} else if (Curry._2(cmp, x2, x3) > 0) { | ||
return { | ||
hd: x2, | ||
tl: { | ||
hd: x3, | ||
tl: { | ||
hd: x1, | ||
tl: /* [] */0 | ||
} | ||
} | ||
}; | ||
} else { | ||
return { | ||
hd: x3, | ||
tl: { | ||
hd: x2, | ||
tl: { | ||
hd: x1, | ||
tl: /* [] */0 | ||
} | ||
} | ||
}; | ||
} | ||
} | ||
} | ||
} | ||
} else if (l) { | ||
var match$2 = l.tl; | ||
if (match$2) { | ||
var x2$1 = match$2.hd; | ||
var x1$1 = l.hd; | ||
if (Curry._2(cmp, x1$1, x2$1) > 0) { | ||
return { | ||
hd: x1$1, | ||
tl: { | ||
hd: x2$1, | ||
tl: /* [] */0 | ||
} | ||
}; | ||
} else { | ||
return { | ||
hd: x2$1, | ||
tl: { | ||
hd: x1$1, | ||
tl: /* [] */0 | ||
} | ||
}; | ||
} | ||
} | ||
} | ||
var n1 = (n >> 1); | ||
var n2 = n - n1 | 0; | ||
var l2 = chop(n1, l); | ||
var s1 = sort(n1, l); | ||
var s2 = sort(n2, l2); | ||
var _l1 = s1; | ||
var _l2 = s2; | ||
var _accu = /* [] */0; | ||
while(true) { | ||
var accu = _accu; | ||
var l2$1 = _l2; | ||
var l1 = _l1; | ||
if (!l1) { | ||
return rev_append(l2$1, accu); | ||
} | ||
if (!l2$1) { | ||
return rev_append(l1, accu); | ||
} | ||
var h2 = l2$1.hd; | ||
var h1 = l1.hd; | ||
if (Curry._2(cmp, h1, h2) <= 0) { | ||
_accu = { | ||
hd: h1, | ||
tl: accu | ||
}; | ||
_l1 = l1.tl; | ||
continue ; | ||
} | ||
_accu = { | ||
hd: h2, | ||
tl: accu | ||
}; | ||
_l2 = l2$1.tl; | ||
continue ; | ||
}; | ||
}; | ||
var len = length(l); | ||
if (len < 2) { | ||
return l; | ||
} else { | ||
return sort(len, l); | ||
} | ||
} | ||
var stable_sort = List.stable_sort; | ||
function sort_uniq(cmp, l) { | ||
var sort = function (n, l) { | ||
if (n !== 2) { | ||
if (n === 3 && l) { | ||
var match = l.tl; | ||
if (match) { | ||
var match$1 = match.tl; | ||
if (match$1) { | ||
var x3 = match$1.hd; | ||
var x2 = match.hd; | ||
var x1 = l.hd; | ||
var c = Curry._2(cmp, x1, x2); | ||
if (c === 0) { | ||
var c$1 = Curry._2(cmp, x2, x3); | ||
if (c$1 === 0) { | ||
return { | ||
hd: x2, | ||
tl: /* [] */0 | ||
}; | ||
} else if (c$1 < 0) { | ||
return { | ||
hd: x2, | ||
tl: { | ||
hd: x3, | ||
tl: /* [] */0 | ||
} | ||
}; | ||
} else { | ||
return { | ||
hd: x3, | ||
tl: { | ||
hd: x2, | ||
tl: /* [] */0 | ||
} | ||
}; | ||
} | ||
} | ||
if (c < 0) { | ||
var c$2 = Curry._2(cmp, x2, x3); | ||
if (c$2 === 0) { | ||
return { | ||
hd: x1, | ||
tl: { | ||
hd: x2, | ||
tl: /* [] */0 | ||
} | ||
}; | ||
} | ||
if (c$2 < 0) { | ||
return { | ||
hd: x1, | ||
tl: { | ||
hd: x2, | ||
tl: { | ||
hd: x3, | ||
tl: /* [] */0 | ||
} | ||
} | ||
}; | ||
} | ||
var c$3 = Curry._2(cmp, x1, x3); | ||
if (c$3 === 0) { | ||
return { | ||
hd: x1, | ||
tl: { | ||
hd: x2, | ||
tl: /* [] */0 | ||
} | ||
}; | ||
} else if (c$3 < 0) { | ||
return { | ||
hd: x1, | ||
tl: { | ||
hd: x3, | ||
tl: { | ||
hd: x2, | ||
tl: /* [] */0 | ||
} | ||
} | ||
}; | ||
} else { | ||
return { | ||
hd: x3, | ||
tl: { | ||
hd: x1, | ||
tl: { | ||
hd: x2, | ||
tl: /* [] */0 | ||
} | ||
} | ||
}; | ||
} | ||
} | ||
var c$4 = Curry._2(cmp, x1, x3); | ||
if (c$4 === 0) { | ||
return { | ||
hd: x2, | ||
tl: { | ||
hd: x1, | ||
tl: /* [] */0 | ||
} | ||
}; | ||
} | ||
if (c$4 < 0) { | ||
return { | ||
hd: x2, | ||
tl: { | ||
hd: x1, | ||
tl: { | ||
hd: x3, | ||
tl: /* [] */0 | ||
} | ||
} | ||
}; | ||
} | ||
var c$5 = Curry._2(cmp, x2, x3); | ||
if (c$5 === 0) { | ||
return { | ||
hd: x2, | ||
tl: { | ||
hd: x1, | ||
tl: /* [] */0 | ||
} | ||
}; | ||
} else if (c$5 < 0) { | ||
return { | ||
hd: x2, | ||
tl: { | ||
hd: x3, | ||
tl: { | ||
hd: x1, | ||
tl: /* [] */0 | ||
} | ||
} | ||
}; | ||
} else { | ||
return { | ||
hd: x3, | ||
tl: { | ||
hd: x2, | ||
tl: { | ||
hd: x1, | ||
tl: /* [] */0 | ||
} | ||
} | ||
}; | ||
} | ||
} | ||
} | ||
} | ||
} else if (l) { | ||
var match$2 = l.tl; | ||
if (match$2) { | ||
var x2$1 = match$2.hd; | ||
var x1$1 = l.hd; | ||
var c$6 = Curry._2(cmp, x1$1, x2$1); | ||
if (c$6 === 0) { | ||
return { | ||
hd: x1$1, | ||
tl: /* [] */0 | ||
}; | ||
} else if (c$6 < 0) { | ||
return { | ||
hd: x1$1, | ||
tl: { | ||
hd: x2$1, | ||
tl: /* [] */0 | ||
} | ||
}; | ||
} else { | ||
return { | ||
hd: x2$1, | ||
tl: { | ||
hd: x1$1, | ||
tl: /* [] */0 | ||
} | ||
}; | ||
} | ||
} | ||
} | ||
var n1 = (n >> 1); | ||
var n2 = n - n1 | 0; | ||
var l2 = chop(n1, l); | ||
var s1 = rev_sort(n1, l); | ||
var s2 = rev_sort(n2, l2); | ||
var _l1 = s1; | ||
var _l2 = s2; | ||
var _accu = /* [] */0; | ||
while(true) { | ||
var accu = _accu; | ||
var l2$1 = _l2; | ||
var l1 = _l1; | ||
if (!l1) { | ||
return rev_append(l2$1, accu); | ||
} | ||
if (!l2$1) { | ||
return rev_append(l1, accu); | ||
} | ||
var t2 = l2$1.tl; | ||
var h2 = l2$1.hd; | ||
var t1 = l1.tl; | ||
var h1 = l1.hd; | ||
var c$7 = Curry._2(cmp, h1, h2); | ||
if (c$7 === 0) { | ||
_accu = { | ||
hd: h1, | ||
tl: accu | ||
}; | ||
_l2 = t2; | ||
_l1 = t1; | ||
continue ; | ||
} | ||
if (c$7 > 0) { | ||
_accu = { | ||
hd: h1, | ||
tl: accu | ||
}; | ||
_l1 = t1; | ||
continue ; | ||
} | ||
_accu = { | ||
hd: h2, | ||
tl: accu | ||
}; | ||
_l2 = t2; | ||
continue ; | ||
}; | ||
}; | ||
var rev_sort = function (n, l) { | ||
if (n !== 2) { | ||
if (n === 3 && l) { | ||
var match = l.tl; | ||
if (match) { | ||
var match$1 = match.tl; | ||
if (match$1) { | ||
var x3 = match$1.hd; | ||
var x2 = match.hd; | ||
var x1 = l.hd; | ||
var c = Curry._2(cmp, x1, x2); | ||
if (c === 0) { | ||
var c$1 = Curry._2(cmp, x2, x3); | ||
if (c$1 === 0) { | ||
return { | ||
hd: x2, | ||
tl: /* [] */0 | ||
}; | ||
} else if (c$1 > 0) { | ||
return { | ||
hd: x2, | ||
tl: { | ||
hd: x3, | ||
tl: /* [] */0 | ||
} | ||
}; | ||
} else { | ||
return { | ||
hd: x3, | ||
tl: { | ||
hd: x2, | ||
tl: /* [] */0 | ||
} | ||
}; | ||
} | ||
} | ||
if (c > 0) { | ||
var c$2 = Curry._2(cmp, x2, x3); | ||
if (c$2 === 0) { | ||
return { | ||
hd: x1, | ||
tl: { | ||
hd: x2, | ||
tl: /* [] */0 | ||
} | ||
}; | ||
} | ||
if (c$2 > 0) { | ||
return { | ||
hd: x1, | ||
tl: { | ||
hd: x2, | ||
tl: { | ||
hd: x3, | ||
tl: /* [] */0 | ||
} | ||
} | ||
}; | ||
} | ||
var c$3 = Curry._2(cmp, x1, x3); | ||
if (c$3 === 0) { | ||
return { | ||
hd: x1, | ||
tl: { | ||
hd: x2, | ||
tl: /* [] */0 | ||
} | ||
}; | ||
} else if (c$3 > 0) { | ||
return { | ||
hd: x1, | ||
tl: { | ||
hd: x3, | ||
tl: { | ||
hd: x2, | ||
tl: /* [] */0 | ||
} | ||
} | ||
}; | ||
} else { | ||
return { | ||
hd: x3, | ||
tl: { | ||
hd: x1, | ||
tl: { | ||
hd: x2, | ||
tl: /* [] */0 | ||
} | ||
} | ||
}; | ||
} | ||
} | ||
var c$4 = Curry._2(cmp, x1, x3); | ||
if (c$4 === 0) { | ||
return { | ||
hd: x2, | ||
tl: { | ||
hd: x1, | ||
tl: /* [] */0 | ||
} | ||
}; | ||
} | ||
if (c$4 > 0) { | ||
return { | ||
hd: x2, | ||
tl: { | ||
hd: x1, | ||
tl: { | ||
hd: x3, | ||
tl: /* [] */0 | ||
} | ||
} | ||
}; | ||
} | ||
var c$5 = Curry._2(cmp, x2, x3); | ||
if (c$5 === 0) { | ||
return { | ||
hd: x2, | ||
tl: { | ||
hd: x1, | ||
tl: /* [] */0 | ||
} | ||
}; | ||
} else if (c$5 > 0) { | ||
return { | ||
hd: x2, | ||
tl: { | ||
hd: x3, | ||
tl: { | ||
hd: x1, | ||
tl: /* [] */0 | ||
} | ||
} | ||
}; | ||
} else { | ||
return { | ||
hd: x3, | ||
tl: { | ||
hd: x2, | ||
tl: { | ||
hd: x1, | ||
tl: /* [] */0 | ||
} | ||
} | ||
}; | ||
} | ||
} | ||
} | ||
} | ||
} else if (l) { | ||
var match$2 = l.tl; | ||
if (match$2) { | ||
var x2$1 = match$2.hd; | ||
var x1$1 = l.hd; | ||
var c$6 = Curry._2(cmp, x1$1, x2$1); | ||
if (c$6 === 0) { | ||
return { | ||
hd: x1$1, | ||
tl: /* [] */0 | ||
}; | ||
} else if (c$6 > 0) { | ||
return { | ||
hd: x1$1, | ||
tl: { | ||
hd: x2$1, | ||
tl: /* [] */0 | ||
} | ||
}; | ||
} else { | ||
return { | ||
hd: x2$1, | ||
tl: { | ||
hd: x1$1, | ||
tl: /* [] */0 | ||
} | ||
}; | ||
} | ||
} | ||
} | ||
var n1 = (n >> 1); | ||
var n2 = n - n1 | 0; | ||
var l2 = chop(n1, l); | ||
var s1 = sort(n1, l); | ||
var s2 = sort(n2, l2); | ||
var _l1 = s1; | ||
var _l2 = s2; | ||
var _accu = /* [] */0; | ||
while(true) { | ||
var accu = _accu; | ||
var l2$1 = _l2; | ||
var l1 = _l1; | ||
if (!l1) { | ||
return rev_append(l2$1, accu); | ||
} | ||
if (!l2$1) { | ||
return rev_append(l1, accu); | ||
} | ||
var t2 = l2$1.tl; | ||
var h2 = l2$1.hd; | ||
var t1 = l1.tl; | ||
var h1 = l1.hd; | ||
var c$7 = Curry._2(cmp, h1, h2); | ||
if (c$7 === 0) { | ||
_accu = { | ||
hd: h1, | ||
tl: accu | ||
}; | ||
_l2 = t2; | ||
_l1 = t1; | ||
continue ; | ||
} | ||
if (c$7 < 0) { | ||
_accu = { | ||
hd: h1, | ||
tl: accu | ||
}; | ||
_l1 = t1; | ||
continue ; | ||
} | ||
_accu = { | ||
hd: h2, | ||
tl: accu | ||
}; | ||
_l2 = t2; | ||
continue ; | ||
}; | ||
}; | ||
var len = length(l); | ||
if (len < 2) { | ||
return l; | ||
} else { | ||
return sort(len, l); | ||
} | ||
} | ||
var fast_sort = List.fast_sort; | ||
function compare_lengths(_l1, _l2) { | ||
while(true) { | ||
var l2 = _l2; | ||
var l1 = _l1; | ||
if (!l1) { | ||
if (l2) { | ||
return -1; | ||
} else { | ||
return 0; | ||
} | ||
} | ||
if (!l2) { | ||
return 1; | ||
} | ||
_l2 = l2.tl; | ||
_l1 = l1.tl; | ||
continue ; | ||
}; | ||
} | ||
var sort_uniq = List.sort_uniq; | ||
function compare_length_with(_l, _n) { | ||
while(true) { | ||
var n = _n; | ||
var l = _l; | ||
if (!l) { | ||
if (n === 0) { | ||
return 0; | ||
} else if (n > 0) { | ||
return -1; | ||
} else { | ||
return 1; | ||
} | ||
} | ||
if (n <= 0) { | ||
return 1; | ||
} | ||
_n = n - 1 | 0; | ||
_l = l.tl; | ||
continue ; | ||
}; | ||
} | ||
var merge = List.merge; | ||
var append = Pervasives.$at; | ||
var concat = flatten; | ||
var filter = find_all; | ||
var sort = stable_sort; | ||
var fast_sort = stable_sort; | ||
exports.length = length; | ||
@@ -126,3 +1676,3 @@ exports.hd = hd; | ||
exports.map = map; | ||
exports.mapi = mapi; | ||
exports.mapi = mapi$1; | ||
exports.rev_map = rev_map; | ||
@@ -129,0 +1679,0 @@ exports.fold_left = fold_left; |
'use strict'; | ||
var $$Map = require("./map.js"); | ||
var $$Set = require("./set.js"); | ||
var Hashtbl = require("./hashtbl.js"); | ||
var List = require("./list.js"); | ||
var Curry = require("./curry.js"); | ||
var Caml_option = require("./caml_option.js"); | ||
var HashtblLabels = require("./hashtblLabels.js"); | ||
var Hashtbl$1 = Hashtbl; | ||
var Hashtbl = { | ||
create: HashtblLabels.create, | ||
clear: HashtblLabels.clear, | ||
reset: HashtblLabels.reset, | ||
copy: HashtblLabels.copy, | ||
add: HashtblLabels.add, | ||
find: HashtblLabels.find, | ||
find_opt: HashtblLabels.find_opt, | ||
find_all: HashtblLabels.find_all, | ||
mem: HashtblLabels.mem, | ||
remove: HashtblLabels.remove, | ||
replace: HashtblLabels.replace, | ||
iter: HashtblLabels.iter, | ||
filter_map_inplace: HashtblLabels.filter_map_inplace, | ||
fold: HashtblLabels.fold, | ||
length: HashtblLabels.length, | ||
randomize: HashtblLabels.randomize, | ||
is_randomized: HashtblLabels.is_randomized, | ||
stats: HashtblLabels.stats, | ||
Make: HashtblLabels.Make, | ||
MakeSeeded: HashtblLabels.MakeSeeded, | ||
hash: HashtblLabels.hash, | ||
seeded_hash: HashtblLabels.seeded_hash, | ||
hash_param: HashtblLabels.hash_param, | ||
seeded_hash_param: HashtblLabels.seeded_hash_param | ||
}; | ||
var $$Map$1 = $$Map; | ||
var $$Map = { | ||
Make: (function (funarg) { | ||
var height = function (param) { | ||
if (param) { | ||
return param.h; | ||
} else { | ||
return 0; | ||
} | ||
}; | ||
var create = function (l, x, d, r) { | ||
var hl = height(l); | ||
var hr = height(r); | ||
return /* Node */{ | ||
l: l, | ||
v: x, | ||
d: d, | ||
r: r, | ||
h: hl >= hr ? hl + 1 | 0 : hr + 1 | 0 | ||
}; | ||
}; | ||
var singleton = function (x, d) { | ||
return /* Node */{ | ||
l: /* Empty */0, | ||
v: x, | ||
d: d, | ||
r: /* Empty */0, | ||
h: 1 | ||
}; | ||
}; | ||
var bal = function (l, x, d, r) { | ||
var hl = l ? l.h : 0; | ||
var hr = r ? r.h : 0; | ||
if (hl > (hr + 2 | 0)) { | ||
if (l) { | ||
var lr = l.r; | ||
var ld = l.d; | ||
var lv = l.v; | ||
var ll = l.l; | ||
if (height(ll) >= height(lr)) { | ||
return create(ll, lv, ld, create(lr, x, d, r)); | ||
} | ||
if (lr) { | ||
return create(create(ll, lv, ld, lr.l), lr.v, lr.d, create(lr.r, x, d, r)); | ||
} | ||
throw { | ||
RE_EXN_ID: "Invalid_argument", | ||
_1: "Map.bal", | ||
Error: new Error() | ||
}; | ||
} | ||
throw { | ||
RE_EXN_ID: "Invalid_argument", | ||
_1: "Map.bal", | ||
Error: new Error() | ||
}; | ||
} | ||
if (hr <= (hl + 2 | 0)) { | ||
return /* Node */{ | ||
l: l, | ||
v: x, | ||
d: d, | ||
r: r, | ||
h: hl >= hr ? hl + 1 | 0 : hr + 1 | 0 | ||
}; | ||
} | ||
if (r) { | ||
var rr = r.r; | ||
var rd = r.d; | ||
var rv = r.v; | ||
var rl = r.l; | ||
if (height(rr) >= height(rl)) { | ||
return create(create(l, x, d, rl), rv, rd, rr); | ||
} | ||
if (rl) { | ||
return create(create(l, x, d, rl.l), rl.v, rl.d, create(rl.r, rv, rd, rr)); | ||
} | ||
throw { | ||
RE_EXN_ID: "Invalid_argument", | ||
_1: "Map.bal", | ||
Error: new Error() | ||
}; | ||
} | ||
throw { | ||
RE_EXN_ID: "Invalid_argument", | ||
_1: "Map.bal", | ||
Error: new Error() | ||
}; | ||
}; | ||
var is_empty = function (param) { | ||
if (param) { | ||
return false; | ||
} else { | ||
return true; | ||
} | ||
}; | ||
var add = function (x, data, m) { | ||
if (!m) { | ||
return /* Node */{ | ||
l: /* Empty */0, | ||
v: x, | ||
d: data, | ||
r: /* Empty */0, | ||
h: 1 | ||
}; | ||
} | ||
var r = m.r; | ||
var d = m.d; | ||
var v = m.v; | ||
var l = m.l; | ||
var c = Curry._2(funarg.compare, x, v); | ||
if (c === 0) { | ||
if (d === data) { | ||
return m; | ||
} else { | ||
return /* Node */{ | ||
l: l, | ||
v: x, | ||
d: data, | ||
r: r, | ||
h: m.h | ||
}; | ||
} | ||
} | ||
if (c < 0) { | ||
var ll = add(x, data, l); | ||
if (l === ll) { | ||
return m; | ||
} else { | ||
return bal(ll, v, d, r); | ||
} | ||
} | ||
var rr = add(x, data, r); | ||
if (r === rr) { | ||
return m; | ||
} else { | ||
return bal(l, v, d, rr); | ||
} | ||
}; | ||
var find = function (x, _param) { | ||
while(true) { | ||
var param = _param; | ||
if (param) { | ||
var c = Curry._2(funarg.compare, x, param.v); | ||
if (c === 0) { | ||
return param.d; | ||
} | ||
_param = c < 0 ? param.l : param.r; | ||
continue ; | ||
} | ||
throw { | ||
RE_EXN_ID: "Not_found", | ||
Error: new Error() | ||
}; | ||
}; | ||
}; | ||
var find_first_aux = function (_v0, _d0, f, _param) { | ||
while(true) { | ||
var param = _param; | ||
var d0 = _d0; | ||
var v0 = _v0; | ||
if (!param) { | ||
return [ | ||
v0, | ||
d0 | ||
]; | ||
} | ||
var v = param.v; | ||
if (Curry._1(f, v)) { | ||
_param = param.l; | ||
_d0 = param.d; | ||
_v0 = v; | ||
continue ; | ||
} | ||
_param = param.r; | ||
continue ; | ||
}; | ||
}; | ||
var find_first = function (f, _param) { | ||
while(true) { | ||
var param = _param; | ||
if (param) { | ||
var v = param.v; | ||
if (Curry._1(f, v)) { | ||
return find_first_aux(v, param.d, f, param.l); | ||
} | ||
_param = param.r; | ||
continue ; | ||
} | ||
throw { | ||
RE_EXN_ID: "Not_found", | ||
Error: new Error() | ||
}; | ||
}; | ||
}; | ||
var find_first_opt_aux = function (_v0, _d0, f, _param) { | ||
while(true) { | ||
var param = _param; | ||
var d0 = _d0; | ||
var v0 = _v0; | ||
if (!param) { | ||
return [ | ||
v0, | ||
d0 | ||
]; | ||
} | ||
var v = param.v; | ||
if (Curry._1(f, v)) { | ||
_param = param.l; | ||
_d0 = param.d; | ||
_v0 = v; | ||
continue ; | ||
} | ||
_param = param.r; | ||
continue ; | ||
}; | ||
}; | ||
var find_first_opt = function (f, _param) { | ||
while(true) { | ||
var param = _param; | ||
if (!param) { | ||
return ; | ||
} | ||
var v = param.v; | ||
if (Curry._1(f, v)) { | ||
return find_first_opt_aux(v, param.d, f, param.l); | ||
} | ||
_param = param.r; | ||
continue ; | ||
}; | ||
}; | ||
var find_last_aux = function (_v0, _d0, f, _param) { | ||
while(true) { | ||
var param = _param; | ||
var d0 = _d0; | ||
var v0 = _v0; | ||
if (!param) { | ||
return [ | ||
v0, | ||
d0 | ||
]; | ||
} | ||
var v = param.v; | ||
if (Curry._1(f, v)) { | ||
_param = param.r; | ||
_d0 = param.d; | ||
_v0 = v; | ||
continue ; | ||
} | ||
_param = param.l; | ||
continue ; | ||
}; | ||
}; | ||
var find_last = function (f, _param) { | ||
while(true) { | ||
var param = _param; | ||
if (param) { | ||
var v = param.v; | ||
if (Curry._1(f, v)) { | ||
return find_last_aux(v, param.d, f, param.r); | ||
} | ||
_param = param.l; | ||
continue ; | ||
} | ||
throw { | ||
RE_EXN_ID: "Not_found", | ||
Error: new Error() | ||
}; | ||
}; | ||
}; | ||
var find_last_opt_aux = function (_v0, _d0, f, _param) { | ||
while(true) { | ||
var param = _param; | ||
var d0 = _d0; | ||
var v0 = _v0; | ||
if (!param) { | ||
return [ | ||
v0, | ||
d0 | ||
]; | ||
} | ||
var v = param.v; | ||
if (Curry._1(f, v)) { | ||
_param = param.r; | ||
_d0 = param.d; | ||
_v0 = v; | ||
continue ; | ||
} | ||
_param = param.l; | ||
continue ; | ||
}; | ||
}; | ||
var find_last_opt = function (f, _param) { | ||
while(true) { | ||
var param = _param; | ||
if (!param) { | ||
return ; | ||
} | ||
var v = param.v; | ||
if (Curry._1(f, v)) { | ||
return find_last_opt_aux(v, param.d, f, param.r); | ||
} | ||
_param = param.l; | ||
continue ; | ||
}; | ||
}; | ||
var find_opt = function (x, _param) { | ||
while(true) { | ||
var param = _param; | ||
if (!param) { | ||
return ; | ||
} | ||
var c = Curry._2(funarg.compare, x, param.v); | ||
if (c === 0) { | ||
return Caml_option.some(param.d); | ||
} | ||
_param = c < 0 ? param.l : param.r; | ||
continue ; | ||
}; | ||
}; | ||
var mem = function (x, _param) { | ||
while(true) { | ||
var param = _param; | ||
if (!param) { | ||
return false; | ||
} | ||
var c = Curry._2(funarg.compare, x, param.v); | ||
if (c === 0) { | ||
return true; | ||
} | ||
_param = c < 0 ? param.l : param.r; | ||
continue ; | ||
}; | ||
}; | ||
var min_binding = function (_param) { | ||
while(true) { | ||
var param = _param; | ||
if (param) { | ||
var l = param.l; | ||
if (!l) { | ||
return [ | ||
param.v, | ||
param.d | ||
]; | ||
} | ||
_param = l; | ||
continue ; | ||
} | ||
throw { | ||
RE_EXN_ID: "Not_found", | ||
Error: new Error() | ||
}; | ||
}; | ||
}; | ||
var min_binding_opt = function (_param) { | ||
while(true) { | ||
var param = _param; | ||
if (!param) { | ||
return ; | ||
} | ||
var l = param.l; | ||
if (!l) { | ||
return [ | ||
param.v, | ||
param.d | ||
]; | ||
} | ||
_param = l; | ||
continue ; | ||
}; | ||
}; | ||
var max_binding = function (_param) { | ||
while(true) { | ||
var param = _param; | ||
if (param) { | ||
var r = param.r; | ||
if (!r) { | ||
return [ | ||
param.v, | ||
param.d | ||
]; | ||
} | ||
_param = r; | ||
continue ; | ||
} | ||
throw { | ||
RE_EXN_ID: "Not_found", | ||
Error: new Error() | ||
}; | ||
}; | ||
}; | ||
var max_binding_opt = function (_param) { | ||
while(true) { | ||
var param = _param; | ||
if (!param) { | ||
return ; | ||
} | ||
var r = param.r; | ||
if (!r) { | ||
return [ | ||
param.v, | ||
param.d | ||
]; | ||
} | ||
_param = r; | ||
continue ; | ||
}; | ||
}; | ||
var remove_min_binding = function (param) { | ||
if (param) { | ||
var l = param.l; | ||
if (l) { | ||
return bal(remove_min_binding(l), param.v, param.d, param.r); | ||
} else { | ||
return param.r; | ||
} | ||
} | ||
throw { | ||
RE_EXN_ID: "Invalid_argument", | ||
_1: "Map.remove_min_elt", | ||
Error: new Error() | ||
}; | ||
}; | ||
var merge = function (t1, t2) { | ||
if (!t1) { | ||
return t2; | ||
} | ||
if (!t2) { | ||
return t1; | ||
} | ||
var match = min_binding(t2); | ||
return bal(t1, match[0], match[1], remove_min_binding(t2)); | ||
}; | ||
var remove = function (x, m) { | ||
if (!m) { | ||
return /* Empty */0; | ||
} | ||
var r = m.r; | ||
var d = m.d; | ||
var v = m.v; | ||
var l = m.l; | ||
var c = Curry._2(funarg.compare, x, v); | ||
if (c === 0) { | ||
return merge(l, r); | ||
} | ||
if (c < 0) { | ||
var ll = remove(x, l); | ||
if (l === ll) { | ||
return m; | ||
} else { | ||
return bal(ll, v, d, r); | ||
} | ||
} | ||
var rr = remove(x, r); | ||
if (r === rr) { | ||
return m; | ||
} else { | ||
return bal(l, v, d, rr); | ||
} | ||
}; | ||
var update = function (x, f, m) { | ||
if (m) { | ||
var r = m.r; | ||
var d = m.d; | ||
var v = m.v; | ||
var l = m.l; | ||
var c = Curry._2(funarg.compare, x, v); | ||
if (c === 0) { | ||
var data = Curry._1(f, Caml_option.some(d)); | ||
if (data === undefined) { | ||
return merge(l, r); | ||
} | ||
var data$1 = Caml_option.valFromOption(data); | ||
if (d === data$1) { | ||
return m; | ||
} else { | ||
return /* Node */{ | ||
l: l, | ||
v: x, | ||
d: data$1, | ||
r: r, | ||
h: m.h | ||
}; | ||
} | ||
} | ||
if (c < 0) { | ||
var ll = update(x, f, l); | ||
if (l === ll) { | ||
return m; | ||
} else { | ||
return bal(ll, v, d, r); | ||
} | ||
} | ||
var rr = update(x, f, r); | ||
if (r === rr) { | ||
return m; | ||
} else { | ||
return bal(l, v, d, rr); | ||
} | ||
} | ||
var data$2 = Curry._1(f, undefined); | ||
if (data$2 !== undefined) { | ||
return /* Node */{ | ||
l: /* Empty */0, | ||
v: x, | ||
d: Caml_option.valFromOption(data$2), | ||
r: /* Empty */0, | ||
h: 1 | ||
}; | ||
} else { | ||
return /* Empty */0; | ||
} | ||
}; | ||
var iter = function (f, _param) { | ||
while(true) { | ||
var param = _param; | ||
if (!param) { | ||
return ; | ||
} | ||
iter(f, param.l); | ||
Curry._2(f, param.v, param.d); | ||
_param = param.r; | ||
continue ; | ||
}; | ||
}; | ||
var map = function (f, param) { | ||
if (!param) { | ||
return /* Empty */0; | ||
} | ||
var l$p = map(f, param.l); | ||
var d$p = Curry._1(f, param.d); | ||
var r$p = map(f, param.r); | ||
return /* Node */{ | ||
l: l$p, | ||
v: param.v, | ||
d: d$p, | ||
r: r$p, | ||
h: param.h | ||
}; | ||
}; | ||
var mapi = function (f, param) { | ||
if (!param) { | ||
return /* Empty */0; | ||
} | ||
var v = param.v; | ||
var l$p = mapi(f, param.l); | ||
var d$p = Curry._2(f, v, param.d); | ||
var r$p = mapi(f, param.r); | ||
return /* Node */{ | ||
l: l$p, | ||
v: v, | ||
d: d$p, | ||
r: r$p, | ||
h: param.h | ||
}; | ||
}; | ||
var fold = function (f, _m, _accu) { | ||
while(true) { | ||
var accu = _accu; | ||
var m = _m; | ||
if (!m) { | ||
return accu; | ||
} | ||
_accu = Curry._3(f, m.v, m.d, fold(f, m.l, accu)); | ||
_m = m.r; | ||
continue ; | ||
}; | ||
}; | ||
var for_all = function (p, _param) { | ||
while(true) { | ||
var param = _param; | ||
if (!param) { | ||
return true; | ||
} | ||
if (!Curry._2(p, param.v, param.d)) { | ||
return false; | ||
} | ||
if (!for_all(p, param.l)) { | ||
return false; | ||
} | ||
_param = param.r; | ||
continue ; | ||
}; | ||
}; | ||
var exists = function (p, _param) { | ||
while(true) { | ||
var param = _param; | ||
if (!param) { | ||
return false; | ||
} | ||
if (Curry._2(p, param.v, param.d)) { | ||
return true; | ||
} | ||
if (exists(p, param.l)) { | ||
return true; | ||
} | ||
_param = param.r; | ||
continue ; | ||
}; | ||
}; | ||
var add_min_binding = function (k, x, param) { | ||
if (param) { | ||
return bal(add_min_binding(k, x, param.l), param.v, param.d, param.r); | ||
} else { | ||
return singleton(k, x); | ||
} | ||
}; | ||
var add_max_binding = function (k, x, param) { | ||
if (param) { | ||
return bal(param.l, param.v, param.d, add_max_binding(k, x, param.r)); | ||
} else { | ||
return singleton(k, x); | ||
} | ||
}; | ||
var join = function (l, v, d, r) { | ||
if (!l) { | ||
return add_min_binding(v, d, r); | ||
} | ||
if (!r) { | ||
return add_max_binding(v, d, l); | ||
} | ||
var rh = r.h; | ||
var lh = l.h; | ||
if (lh > (rh + 2 | 0)) { | ||
return bal(l.l, l.v, l.d, join(l.r, v, d, r)); | ||
} else if (rh > (lh + 2 | 0)) { | ||
return bal(join(l, v, d, r.l), r.v, r.d, r.r); | ||
} else { | ||
return create(l, v, d, r); | ||
} | ||
}; | ||
var concat = function (t1, t2) { | ||
if (!t1) { | ||
return t2; | ||
} | ||
if (!t2) { | ||
return t1; | ||
} | ||
var match = min_binding(t2); | ||
return join(t1, match[0], match[1], remove_min_binding(t2)); | ||
}; | ||
var concat_or_join = function (t1, v, d, t2) { | ||
if (d !== undefined) { | ||
return join(t1, v, Caml_option.valFromOption(d), t2); | ||
} else { | ||
return concat(t1, t2); | ||
} | ||
}; | ||
var split = function (x, param) { | ||
if (!param) { | ||
return [ | ||
/* Empty */0, | ||
undefined, | ||
/* Empty */0 | ||
]; | ||
} | ||
var r = param.r; | ||
var d = param.d; | ||
var v = param.v; | ||
var l = param.l; | ||
var c = Curry._2(funarg.compare, x, v); | ||
if (c === 0) { | ||
return [ | ||
l, | ||
Caml_option.some(d), | ||
r | ||
]; | ||
} | ||
if (c < 0) { | ||
var match = split(x, l); | ||
return [ | ||
match[0], | ||
match[1], | ||
join(match[2], v, d, r) | ||
]; | ||
} | ||
var match$1 = split(x, r); | ||
return [ | ||
join(l, v, d, match$1[0]), | ||
match$1[1], | ||
match$1[2] | ||
]; | ||
}; | ||
var merge$1 = function (f, s1, s2) { | ||
if (s1) { | ||
var v1 = s1.v; | ||
if (s1.h >= height(s2)) { | ||
var match = split(v1, s2); | ||
return concat_or_join(merge$1(f, s1.l, match[0]), v1, Curry._3(f, v1, Caml_option.some(s1.d), match[1]), merge$1(f, s1.r, match[2])); | ||
} | ||
} else if (!s2) { | ||
return /* Empty */0; | ||
} | ||
if (s2) { | ||
var v2 = s2.v; | ||
var match$1 = split(v2, s1); | ||
return concat_or_join(merge$1(f, match$1[0], s2.l), v2, Curry._3(f, v2, match$1[1], Caml_option.some(s2.d)), merge$1(f, match$1[2], s2.r)); | ||
} | ||
throw { | ||
RE_EXN_ID: "Assert_failure", | ||
_1: [ | ||
"mapLabels.ml", | ||
393, | ||
10 | ||
], | ||
Error: new Error() | ||
}; | ||
}; | ||
var union = function (f, s1, s2) { | ||
if (!s1) { | ||
return s2; | ||
} | ||
if (!s2) { | ||
return s1; | ||
} | ||
var d2 = s2.d; | ||
var v2 = s2.v; | ||
var d1 = s1.d; | ||
var v1 = s1.v; | ||
if (s1.h >= s2.h) { | ||
var match = split(v1, s2); | ||
var d2$1 = match[1]; | ||
var l = union(f, s1.l, match[0]); | ||
var r = union(f, s1.r, match[2]); | ||
if (d2$1 !== undefined) { | ||
return concat_or_join(l, v1, Curry._3(f, v1, d1, Caml_option.valFromOption(d2$1)), r); | ||
} else { | ||
return join(l, v1, d1, r); | ||
} | ||
} | ||
var match$1 = split(v2, s1); | ||
var d1$1 = match$1[1]; | ||
var l$1 = union(f, match$1[0], s2.l); | ||
var r$1 = union(f, match$1[2], s2.r); | ||
if (d1$1 !== undefined) { | ||
return concat_or_join(l$1, v2, Curry._3(f, v2, Caml_option.valFromOption(d1$1), d2), r$1); | ||
} else { | ||
return join(l$1, v2, d2, r$1); | ||
} | ||
}; | ||
var filter = function (p, m) { | ||
if (!m) { | ||
return /* Empty */0; | ||
} | ||
var r = m.r; | ||
var d = m.d; | ||
var v = m.v; | ||
var l = m.l; | ||
var l$p = filter(p, l); | ||
var pvd = Curry._2(p, v, d); | ||
var r$p = filter(p, r); | ||
if (pvd) { | ||
if (l === l$p && r === r$p) { | ||
return m; | ||
} else { | ||
return join(l$p, v, d, r$p); | ||
} | ||
} else { | ||
return concat(l$p, r$p); | ||
} | ||
}; | ||
var partition = function (p, param) { | ||
if (!param) { | ||
return [ | ||
/* Empty */0, | ||
/* Empty */0 | ||
]; | ||
} | ||
var d = param.d; | ||
var v = param.v; | ||
var match = partition(p, param.l); | ||
var lf = match[1]; | ||
var lt = match[0]; | ||
var pvd = Curry._2(p, v, d); | ||
var match$1 = partition(p, param.r); | ||
var rf = match$1[1]; | ||
var rt = match$1[0]; | ||
if (pvd) { | ||
return [ | ||
join(lt, v, d, rt), | ||
concat(lf, rf) | ||
]; | ||
} else { | ||
return [ | ||
concat(lt, rt), | ||
join(lf, v, d, rf) | ||
]; | ||
} | ||
}; | ||
var cons_enum = function (_m, _e) { | ||
while(true) { | ||
var e = _e; | ||
var m = _m; | ||
if (!m) { | ||
return e; | ||
} | ||
_e = /* More */{ | ||
_0: m.v, | ||
_1: m.d, | ||
_2: m.r, | ||
_3: e | ||
}; | ||
_m = m.l; | ||
continue ; | ||
}; | ||
}; | ||
var compare = function (cmp, m1, m2) { | ||
var _e1 = cons_enum(m1, /* End */0); | ||
var _e2 = cons_enum(m2, /* End */0); | ||
while(true) { | ||
var e2 = _e2; | ||
var e1 = _e1; | ||
if (!e1) { | ||
if (e2) { | ||
return -1; | ||
} else { | ||
return 0; | ||
} | ||
} | ||
if (!e2) { | ||
return 1; | ||
} | ||
var c = Curry._2(funarg.compare, e1._0, e2._0); | ||
if (c !== 0) { | ||
return c; | ||
} | ||
var c$1 = Curry._2(cmp, e1._1, e2._1); | ||
if (c$1 !== 0) { | ||
return c$1; | ||
} | ||
_e2 = cons_enum(e2._2, e2._3); | ||
_e1 = cons_enum(e1._2, e1._3); | ||
continue ; | ||
}; | ||
}; | ||
var equal = function (cmp, m1, m2) { | ||
var _e1 = cons_enum(m1, /* End */0); | ||
var _e2 = cons_enum(m2, /* End */0); | ||
while(true) { | ||
var e2 = _e2; | ||
var e1 = _e1; | ||
if (!e1) { | ||
if (e2) { | ||
return false; | ||
} else { | ||
return true; | ||
} | ||
} | ||
if (!e2) { | ||
return false; | ||
} | ||
if (Curry._2(funarg.compare, e1._0, e2._0) !== 0) { | ||
return false; | ||
} | ||
if (!Curry._2(cmp, e1._1, e2._1)) { | ||
return false; | ||
} | ||
_e2 = cons_enum(e2._2, e2._3); | ||
_e1 = cons_enum(e1._2, e1._3); | ||
continue ; | ||
}; | ||
}; | ||
var cardinal = function (param) { | ||
if (param) { | ||
return (cardinal(param.l) + 1 | 0) + cardinal(param.r) | 0; | ||
} else { | ||
return 0; | ||
} | ||
}; | ||
var bindings_aux = function (_accu, _param) { | ||
while(true) { | ||
var param = _param; | ||
var accu = _accu; | ||
if (!param) { | ||
return accu; | ||
} | ||
_param = param.l; | ||
_accu = { | ||
hd: [ | ||
param.v, | ||
param.d | ||
], | ||
tl: bindings_aux(accu, param.r) | ||
}; | ||
continue ; | ||
}; | ||
}; | ||
var bindings = function (s) { | ||
return bindings_aux(/* [] */0, s); | ||
}; | ||
return { | ||
empty: /* Empty */0, | ||
is_empty: is_empty, | ||
mem: mem, | ||
add: add, | ||
update: update, | ||
singleton: singleton, | ||
remove: remove, | ||
merge: merge$1, | ||
union: union, | ||
compare: compare, | ||
equal: equal, | ||
iter: iter, | ||
fold: fold, | ||
for_all: for_all, | ||
exists: exists, | ||
filter: filter, | ||
partition: partition, | ||
cardinal: cardinal, | ||
bindings: bindings, | ||
min_binding: min_binding, | ||
min_binding_opt: min_binding_opt, | ||
max_binding: max_binding, | ||
max_binding_opt: max_binding_opt, | ||
choose: min_binding, | ||
choose_opt: min_binding_opt, | ||
split: split, | ||
find: find, | ||
find_opt: find_opt, | ||
find_first: find_first, | ||
find_first_opt: find_first_opt, | ||
find_last: find_last, | ||
find_last_opt: find_last_opt, | ||
map: map, | ||
mapi: mapi | ||
}; | ||
}) | ||
}; | ||
var $$Set$1 = $$Set; | ||
var $$Set = { | ||
Make: (function (funarg) { | ||
var height = function (param) { | ||
if (param) { | ||
return param.h; | ||
} else { | ||
return 0; | ||
} | ||
}; | ||
var create = function (l, v, r) { | ||
var hl = l ? l.h : 0; | ||
var hr = r ? r.h : 0; | ||
return /* Node */{ | ||
l: l, | ||
v: v, | ||
r: r, | ||
h: hl >= hr ? hl + 1 | 0 : hr + 1 | 0 | ||
}; | ||
}; | ||
var bal = function (l, v, r) { | ||
var hl = l ? l.h : 0; | ||
var hr = r ? r.h : 0; | ||
if (hl > (hr + 2 | 0)) { | ||
if (l) { | ||
var lr = l.r; | ||
var lv = l.v; | ||
var ll = l.l; | ||
if (height(ll) >= height(lr)) { | ||
return create(ll, lv, create(lr, v, r)); | ||
} | ||
if (lr) { | ||
return create(create(ll, lv, lr.l), lr.v, create(lr.r, v, r)); | ||
} | ||
throw { | ||
RE_EXN_ID: "Invalid_argument", | ||
_1: "Set.bal", | ||
Error: new Error() | ||
}; | ||
} | ||
throw { | ||
RE_EXN_ID: "Invalid_argument", | ||
_1: "Set.bal", | ||
Error: new Error() | ||
}; | ||
} | ||
if (hr <= (hl + 2 | 0)) { | ||
return /* Node */{ | ||
l: l, | ||
v: v, | ||
r: r, | ||
h: hl >= hr ? hl + 1 | 0 : hr + 1 | 0 | ||
}; | ||
} | ||
if (r) { | ||
var rr = r.r; | ||
var rv = r.v; | ||
var rl = r.l; | ||
if (height(rr) >= height(rl)) { | ||
return create(create(l, v, rl), rv, rr); | ||
} | ||
if (rl) { | ||
return create(create(l, v, rl.l), rl.v, create(rl.r, rv, rr)); | ||
} | ||
throw { | ||
RE_EXN_ID: "Invalid_argument", | ||
_1: "Set.bal", | ||
Error: new Error() | ||
}; | ||
} | ||
throw { | ||
RE_EXN_ID: "Invalid_argument", | ||
_1: "Set.bal", | ||
Error: new Error() | ||
}; | ||
}; | ||
var add = function (x, t) { | ||
if (!t) { | ||
return /* Node */{ | ||
l: /* Empty */0, | ||
v: x, | ||
r: /* Empty */0, | ||
h: 1 | ||
}; | ||
} | ||
var r = t.r; | ||
var v = t.v; | ||
var l = t.l; | ||
var c = Curry._2(funarg.compare, x, v); | ||
if (c === 0) { | ||
return t; | ||
} | ||
if (c < 0) { | ||
var ll = add(x, l); | ||
if (l === ll) { | ||
return t; | ||
} else { | ||
return bal(ll, v, r); | ||
} | ||
} | ||
var rr = add(x, r); | ||
if (r === rr) { | ||
return t; | ||
} else { | ||
return bal(l, v, rr); | ||
} | ||
}; | ||
var singleton = function (x) { | ||
return /* Node */{ | ||
l: /* Empty */0, | ||
v: x, | ||
r: /* Empty */0, | ||
h: 1 | ||
}; | ||
}; | ||
var add_min_element = function (x, param) { | ||
if (param) { | ||
return bal(add_min_element(x, param.l), param.v, param.r); | ||
} else { | ||
return singleton(x); | ||
} | ||
}; | ||
var add_max_element = function (x, param) { | ||
if (param) { | ||
return bal(param.l, param.v, add_max_element(x, param.r)); | ||
} else { | ||
return singleton(x); | ||
} | ||
}; | ||
var join = function (l, v, r) { | ||
if (!l) { | ||
return add_min_element(v, r); | ||
} | ||
if (!r) { | ||
return add_max_element(v, l); | ||
} | ||
var rh = r.h; | ||
var lh = l.h; | ||
if (lh > (rh + 2 | 0)) { | ||
return bal(l.l, l.v, join(l.r, v, r)); | ||
} else if (rh > (lh + 2 | 0)) { | ||
return bal(join(l, v, r.l), r.v, r.r); | ||
} else { | ||
return create(l, v, r); | ||
} | ||
}; | ||
var min_elt = function (_param) { | ||
while(true) { | ||
var param = _param; | ||
if (param) { | ||
var l = param.l; | ||
if (!l) { | ||
return param.v; | ||
} | ||
_param = l; | ||
continue ; | ||
} | ||
throw { | ||
RE_EXN_ID: "Not_found", | ||
Error: new Error() | ||
}; | ||
}; | ||
}; | ||
var min_elt_opt = function (_param) { | ||
while(true) { | ||
var param = _param; | ||
if (!param) { | ||
return ; | ||
} | ||
var l = param.l; | ||
if (!l) { | ||
return Caml_option.some(param.v); | ||
} | ||
_param = l; | ||
continue ; | ||
}; | ||
}; | ||
var max_elt = function (_param) { | ||
while(true) { | ||
var param = _param; | ||
if (param) { | ||
var r = param.r; | ||
if (!r) { | ||
return param.v; | ||
} | ||
_param = r; | ||
continue ; | ||
} | ||
throw { | ||
RE_EXN_ID: "Not_found", | ||
Error: new Error() | ||
}; | ||
}; | ||
}; | ||
var max_elt_opt = function (_param) { | ||
while(true) { | ||
var param = _param; | ||
if (!param) { | ||
return ; | ||
} | ||
var r = param.r; | ||
if (!r) { | ||
return Caml_option.some(param.v); | ||
} | ||
_param = r; | ||
continue ; | ||
}; | ||
}; | ||
var remove_min_elt = function (param) { | ||
if (param) { | ||
var l = param.l; | ||
if (l) { | ||
return bal(remove_min_elt(l), param.v, param.r); | ||
} else { | ||
return param.r; | ||
} | ||
} | ||
throw { | ||
RE_EXN_ID: "Invalid_argument", | ||
_1: "Set.remove_min_elt", | ||
Error: new Error() | ||
}; | ||
}; | ||
var merge = function (t1, t2) { | ||
if (t1) { | ||
if (t2) { | ||
return bal(t1, min_elt(t2), remove_min_elt(t2)); | ||
} else { | ||
return t1; | ||
} | ||
} else { | ||
return t2; | ||
} | ||
}; | ||
var concat = function (t1, t2) { | ||
if (t1) { | ||
if (t2) { | ||
return join(t1, min_elt(t2), remove_min_elt(t2)); | ||
} else { | ||
return t1; | ||
} | ||
} else { | ||
return t2; | ||
} | ||
}; | ||
var split = function (x, param) { | ||
if (!param) { | ||
return [ | ||
/* Empty */0, | ||
false, | ||
/* Empty */0 | ||
]; | ||
} | ||
var r = param.r; | ||
var v = param.v; | ||
var l = param.l; | ||
var c = Curry._2(funarg.compare, x, v); | ||
if (c === 0) { | ||
return [ | ||
l, | ||
true, | ||
r | ||
]; | ||
} | ||
if (c < 0) { | ||
var match = split(x, l); | ||
return [ | ||
match[0], | ||
match[1], | ||
join(match[2], v, r) | ||
]; | ||
} | ||
var match$1 = split(x, r); | ||
return [ | ||
join(l, v, match$1[0]), | ||
match$1[1], | ||
match$1[2] | ||
]; | ||
}; | ||
var is_empty = function (param) { | ||
if (param) { | ||
return false; | ||
} else { | ||
return true; | ||
} | ||
}; | ||
var mem = function (x, _param) { | ||
while(true) { | ||
var param = _param; | ||
if (!param) { | ||
return false; | ||
} | ||
var c = Curry._2(funarg.compare, x, param.v); | ||
if (c === 0) { | ||
return true; | ||
} | ||
_param = c < 0 ? param.l : param.r; | ||
continue ; | ||
}; | ||
}; | ||
var remove = function (x, t) { | ||
if (!t) { | ||
return /* Empty */0; | ||
} | ||
var r = t.r; | ||
var v = t.v; | ||
var l = t.l; | ||
var c = Curry._2(funarg.compare, x, v); | ||
if (c === 0) { | ||
return merge(l, r); | ||
} | ||
if (c < 0) { | ||
var ll = remove(x, l); | ||
if (l === ll) { | ||
return t; | ||
} else { | ||
return bal(ll, v, r); | ||
} | ||
} | ||
var rr = remove(x, r); | ||
if (r === rr) { | ||
return t; | ||
} else { | ||
return bal(l, v, rr); | ||
} | ||
}; | ||
var union = function (s1, s2) { | ||
if (!s1) { | ||
return s2; | ||
} | ||
if (!s2) { | ||
return s1; | ||
} | ||
var h2 = s2.h; | ||
var v2 = s2.v; | ||
var h1 = s1.h; | ||
var v1 = s1.v; | ||
if (h1 >= h2) { | ||
if (h2 === 1) { | ||
return add(v2, s1); | ||
} | ||
var match = split(v1, s2); | ||
return join(union(s1.l, match[0]), v1, union(s1.r, match[2])); | ||
} | ||
if (h1 === 1) { | ||
return add(v1, s2); | ||
} | ||
var match$1 = split(v2, s1); | ||
return join(union(match$1[0], s2.l), v2, union(match$1[2], s2.r)); | ||
}; | ||
var inter = function (s1, s2) { | ||
if (!s1) { | ||
return /* Empty */0; | ||
} | ||
if (!s2) { | ||
return /* Empty */0; | ||
} | ||
var r1 = s1.r; | ||
var v1 = s1.v; | ||
var l1 = s1.l; | ||
var match = split(v1, s2); | ||
var l2 = match[0]; | ||
if (match[1]) { | ||
return join(inter(l1, l2), v1, inter(r1, match[2])); | ||
} else { | ||
return concat(inter(l1, l2), inter(r1, match[2])); | ||
} | ||
}; | ||
var diff = function (s1, s2) { | ||
if (!s1) { | ||
return /* Empty */0; | ||
} | ||
if (!s2) { | ||
return s1; | ||
} | ||
var r1 = s1.r; | ||
var v1 = s1.v; | ||
var l1 = s1.l; | ||
var match = split(v1, s2); | ||
var l2 = match[0]; | ||
if (match[1]) { | ||
return concat(diff(l1, l2), diff(r1, match[2])); | ||
} else { | ||
return join(diff(l1, l2), v1, diff(r1, match[2])); | ||
} | ||
}; | ||
var cons_enum = function (_s, _e) { | ||
while(true) { | ||
var e = _e; | ||
var s = _s; | ||
if (!s) { | ||
return e; | ||
} | ||
_e = /* More */{ | ||
_0: s.v, | ||
_1: s.r, | ||
_2: e | ||
}; | ||
_s = s.l; | ||
continue ; | ||
}; | ||
}; | ||
var compare_aux = function (_e1, _e2) { | ||
while(true) { | ||
var e2 = _e2; | ||
var e1 = _e1; | ||
if (!e1) { | ||
if (e2) { | ||
return -1; | ||
} else { | ||
return 0; | ||
} | ||
} | ||
if (!e2) { | ||
return 1; | ||
} | ||
var c = Curry._2(funarg.compare, e1._0, e2._0); | ||
if (c !== 0) { | ||
return c; | ||
} | ||
_e2 = cons_enum(e2._1, e2._2); | ||
_e1 = cons_enum(e1._1, e1._2); | ||
continue ; | ||
}; | ||
}; | ||
var compare = function (s1, s2) { | ||
return compare_aux(cons_enum(s1, /* End */0), cons_enum(s2, /* End */0)); | ||
}; | ||
var equal = function (s1, s2) { | ||
return compare(s1, s2) === 0; | ||
}; | ||
var subset = function (_s1, _s2) { | ||
while(true) { | ||
var s2 = _s2; | ||
var s1 = _s1; | ||
if (!s1) { | ||
return true; | ||
} | ||
if (!s2) { | ||
return false; | ||
} | ||
var r2 = s2.r; | ||
var l2 = s2.l; | ||
var r1 = s1.r; | ||
var v1 = s1.v; | ||
var l1 = s1.l; | ||
var c = Curry._2(funarg.compare, v1, s2.v); | ||
if (c === 0) { | ||
if (!subset(l1, l2)) { | ||
return false; | ||
} | ||
_s2 = r2; | ||
_s1 = r1; | ||
continue ; | ||
} | ||
if (c < 0) { | ||
if (!subset(/* Node */{ | ||
l: l1, | ||
v: v1, | ||
r: /* Empty */0, | ||
h: 0 | ||
}, l2)) { | ||
return false; | ||
} | ||
_s1 = r1; | ||
continue ; | ||
} | ||
if (!subset(/* Node */{ | ||
l: /* Empty */0, | ||
v: v1, | ||
r: r1, | ||
h: 0 | ||
}, r2)) { | ||
return false; | ||
} | ||
_s1 = l1; | ||
continue ; | ||
}; | ||
}; | ||
var iter = function (f, _param) { | ||
while(true) { | ||
var param = _param; | ||
if (!param) { | ||
return ; | ||
} | ||
iter(f, param.l); | ||
Curry._1(f, param.v); | ||
_param = param.r; | ||
continue ; | ||
}; | ||
}; | ||
var fold = function (f, _s, _accu) { | ||
while(true) { | ||
var accu = _accu; | ||
var s = _s; | ||
if (!s) { | ||
return accu; | ||
} | ||
_accu = Curry._2(f, s.v, fold(f, s.l, accu)); | ||
_s = s.r; | ||
continue ; | ||
}; | ||
}; | ||
var for_all = function (p, _param) { | ||
while(true) { | ||
var param = _param; | ||
if (!param) { | ||
return true; | ||
} | ||
if (!Curry._1(p, param.v)) { | ||
return false; | ||
} | ||
if (!for_all(p, param.l)) { | ||
return false; | ||
} | ||
_param = param.r; | ||
continue ; | ||
}; | ||
}; | ||
var exists = function (p, _param) { | ||
while(true) { | ||
var param = _param; | ||
if (!param) { | ||
return false; | ||
} | ||
if (Curry._1(p, param.v)) { | ||
return true; | ||
} | ||
if (exists(p, param.l)) { | ||
return true; | ||
} | ||
_param = param.r; | ||
continue ; | ||
}; | ||
}; | ||
var filter = function (p, t) { | ||
if (!t) { | ||
return /* Empty */0; | ||
} | ||
var r = t.r; | ||
var v = t.v; | ||
var l = t.l; | ||
var l$p = filter(p, l); | ||
var pv = Curry._1(p, v); | ||
var r$p = filter(p, r); | ||
if (pv) { | ||
if (l === l$p && r === r$p) { | ||
return t; | ||
} else { | ||
return join(l$p, v, r$p); | ||
} | ||
} else { | ||
return concat(l$p, r$p); | ||
} | ||
}; | ||
var partition = function (p, param) { | ||
if (!param) { | ||
return [ | ||
/* Empty */0, | ||
/* Empty */0 | ||
]; | ||
} | ||
var v = param.v; | ||
var match = partition(p, param.l); | ||
var lf = match[1]; | ||
var lt = match[0]; | ||
var pv = Curry._1(p, v); | ||
var match$1 = partition(p, param.r); | ||
var rf = match$1[1]; | ||
var rt = match$1[0]; | ||
if (pv) { | ||
return [ | ||
join(lt, v, rt), | ||
concat(lf, rf) | ||
]; | ||
} else { | ||
return [ | ||
concat(lt, rt), | ||
join(lf, v, rf) | ||
]; | ||
} | ||
}; | ||
var cardinal = function (param) { | ||
if (param) { | ||
return (cardinal(param.l) + 1 | 0) + cardinal(param.r) | 0; | ||
} else { | ||
return 0; | ||
} | ||
}; | ||
var elements_aux = function (_accu, _param) { | ||
while(true) { | ||
var param = _param; | ||
var accu = _accu; | ||
if (!param) { | ||
return accu; | ||
} | ||
_param = param.l; | ||
_accu = { | ||
hd: param.v, | ||
tl: elements_aux(accu, param.r) | ||
}; | ||
continue ; | ||
}; | ||
}; | ||
var elements = function (s) { | ||
return elements_aux(/* [] */0, s); | ||
}; | ||
var find = function (x, _param) { | ||
while(true) { | ||
var param = _param; | ||
if (param) { | ||
var v = param.v; | ||
var c = Curry._2(funarg.compare, x, v); | ||
if (c === 0) { | ||
return v; | ||
} | ||
_param = c < 0 ? param.l : param.r; | ||
continue ; | ||
} | ||
throw { | ||
RE_EXN_ID: "Not_found", | ||
Error: new Error() | ||
}; | ||
}; | ||
}; | ||
var find_first_aux = function (_v0, f, _param) { | ||
while(true) { | ||
var param = _param; | ||
var v0 = _v0; | ||
if (!param) { | ||
return v0; | ||
} | ||
var v = param.v; | ||
if (Curry._1(f, v)) { | ||
_param = param.l; | ||
_v0 = v; | ||
continue ; | ||
} | ||
_param = param.r; | ||
continue ; | ||
}; | ||
}; | ||
var find_first = function (f, _param) { | ||
while(true) { | ||
var param = _param; | ||
if (param) { | ||
var v = param.v; | ||
if (Curry._1(f, v)) { | ||
return find_first_aux(v, f, param.l); | ||
} | ||
_param = param.r; | ||
continue ; | ||
} | ||
throw { | ||
RE_EXN_ID: "Not_found", | ||
Error: new Error() | ||
}; | ||
}; | ||
}; | ||
var find_first_opt_aux = function (_v0, f, _param) { | ||
while(true) { | ||
var param = _param; | ||
var v0 = _v0; | ||
if (!param) { | ||
return Caml_option.some(v0); | ||
} | ||
var v = param.v; | ||
if (Curry._1(f, v)) { | ||
_param = param.l; | ||
_v0 = v; | ||
continue ; | ||
} | ||
_param = param.r; | ||
continue ; | ||
}; | ||
}; | ||
var find_first_opt = function (f, _param) { | ||
while(true) { | ||
var param = _param; | ||
if (!param) { | ||
return ; | ||
} | ||
var v = param.v; | ||
if (Curry._1(f, v)) { | ||
return find_first_opt_aux(v, f, param.l); | ||
} | ||
_param = param.r; | ||
continue ; | ||
}; | ||
}; | ||
var find_last_aux = function (_v0, f, _param) { | ||
while(true) { | ||
var param = _param; | ||
var v0 = _v0; | ||
if (!param) { | ||
return v0; | ||
} | ||
var v = param.v; | ||
if (Curry._1(f, v)) { | ||
_param = param.r; | ||
_v0 = v; | ||
continue ; | ||
} | ||
_param = param.l; | ||
continue ; | ||
}; | ||
}; | ||
var find_last = function (f, _param) { | ||
while(true) { | ||
var param = _param; | ||
if (param) { | ||
var v = param.v; | ||
if (Curry._1(f, v)) { | ||
return find_last_aux(v, f, param.r); | ||
} | ||
_param = param.l; | ||
continue ; | ||
} | ||
throw { | ||
RE_EXN_ID: "Not_found", | ||
Error: new Error() | ||
}; | ||
}; | ||
}; | ||
var find_last_opt_aux = function (_v0, f, _param) { | ||
while(true) { | ||
var param = _param; | ||
var v0 = _v0; | ||
if (!param) { | ||
return Caml_option.some(v0); | ||
} | ||
var v = param.v; | ||
if (Curry._1(f, v)) { | ||
_param = param.r; | ||
_v0 = v; | ||
continue ; | ||
} | ||
_param = param.l; | ||
continue ; | ||
}; | ||
}; | ||
var find_last_opt = function (f, _param) { | ||
while(true) { | ||
var param = _param; | ||
if (!param) { | ||
return ; | ||
} | ||
var v = param.v; | ||
if (Curry._1(f, v)) { | ||
return find_last_opt_aux(v, f, param.r); | ||
} | ||
_param = param.l; | ||
continue ; | ||
}; | ||
}; | ||
var find_opt = function (x, _param) { | ||
while(true) { | ||
var param = _param; | ||
if (!param) { | ||
return ; | ||
} | ||
var v = param.v; | ||
var c = Curry._2(funarg.compare, x, v); | ||
if (c === 0) { | ||
return Caml_option.some(v); | ||
} | ||
_param = c < 0 ? param.l : param.r; | ||
continue ; | ||
}; | ||
}; | ||
var try_join = function (l, v, r) { | ||
if ((l === /* Empty */0 || Curry._2(funarg.compare, max_elt(l), v) < 0) && (r === /* Empty */0 || Curry._2(funarg.compare, v, min_elt(r)) < 0)) { | ||
return join(l, v, r); | ||
} else { | ||
return union(l, add(v, r)); | ||
} | ||
}; | ||
var map = function (f, t) { | ||
if (!t) { | ||
return /* Empty */0; | ||
} | ||
var r = t.r; | ||
var v = t.v; | ||
var l = t.l; | ||
var l$p = map(f, l); | ||
var v$p = Curry._1(f, v); | ||
var r$p = map(f, r); | ||
if (l === l$p && v === v$p && r === r$p) { | ||
return t; | ||
} else { | ||
return try_join(l$p, v$p, r$p); | ||
} | ||
}; | ||
var of_sorted_list = function (l) { | ||
var sub = function (n, l) { | ||
switch (n) { | ||
case 0 : | ||
return [ | ||
/* Empty */0, | ||
l | ||
]; | ||
case 1 : | ||
if (l) { | ||
return [ | ||
/* Node */{ | ||
l: /* Empty */0, | ||
v: l.hd, | ||
r: /* Empty */0, | ||
h: 1 | ||
}, | ||
l.tl | ||
]; | ||
} | ||
break; | ||
case 2 : | ||
if (l) { | ||
var match = l.tl; | ||
if (match) { | ||
return [ | ||
/* Node */{ | ||
l: /* Node */{ | ||
l: /* Empty */0, | ||
v: l.hd, | ||
r: /* Empty */0, | ||
h: 1 | ||
}, | ||
v: match.hd, | ||
r: /* Empty */0, | ||
h: 2 | ||
}, | ||
match.tl | ||
]; | ||
} | ||
} | ||
break; | ||
case 3 : | ||
if (l) { | ||
var match$1 = l.tl; | ||
if (match$1) { | ||
var match$2 = match$1.tl; | ||
if (match$2) { | ||
return [ | ||
/* Node */{ | ||
l: /* Node */{ | ||
l: /* Empty */0, | ||
v: l.hd, | ||
r: /* Empty */0, | ||
h: 1 | ||
}, | ||
v: match$1.hd, | ||
r: /* Node */{ | ||
l: /* Empty */0, | ||
v: match$2.hd, | ||
r: /* Empty */0, | ||
h: 1 | ||
}, | ||
h: 2 | ||
}, | ||
match$2.tl | ||
]; | ||
} | ||
} | ||
} | ||
break; | ||
default: | ||
} | ||
var nl = n / 2 | 0; | ||
var match$3 = sub(nl, l); | ||
var l$1 = match$3[1]; | ||
if (l$1) { | ||
var match$4 = sub((n - nl | 0) - 1 | 0, l$1.tl); | ||
return [ | ||
create(match$3[0], l$1.hd, match$4[0]), | ||
match$4[1] | ||
]; | ||
} | ||
throw { | ||
RE_EXN_ID: "Assert_failure", | ||
_1: [ | ||
"setLabels.ml", | ||
510, | ||
18 | ||
], | ||
Error: new Error() | ||
}; | ||
}; | ||
return sub(List.length(l), l)[0]; | ||
}; | ||
var of_list = function (l) { | ||
if (!l) { | ||
return /* Empty */0; | ||
} | ||
var match = l.tl; | ||
var x0 = l.hd; | ||
if (!match) { | ||
return singleton(x0); | ||
} | ||
var match$1 = match.tl; | ||
var x1 = match.hd; | ||
if (!match$1) { | ||
return add(x1, singleton(x0)); | ||
} | ||
var match$2 = match$1.tl; | ||
var x2 = match$1.hd; | ||
if (!match$2) { | ||
return add(x2, add(x1, singleton(x0))); | ||
} | ||
var match$3 = match$2.tl; | ||
var x3 = match$2.hd; | ||
if (match$3) { | ||
if (match$3.tl) { | ||
return of_sorted_list(List.sort_uniq(funarg.compare, l)); | ||
} else { | ||
return add(match$3.hd, add(x3, add(x2, add(x1, singleton(x0))))); | ||
} | ||
} else { | ||
return add(x3, add(x2, add(x1, singleton(x0)))); | ||
} | ||
}; | ||
return { | ||
empty: /* Empty */0, | ||
is_empty: is_empty, | ||
mem: mem, | ||
add: add, | ||
singleton: singleton, | ||
remove: remove, | ||
union: union, | ||
inter: inter, | ||
diff: diff, | ||
compare: compare, | ||
equal: equal, | ||
subset: subset, | ||
iter: iter, | ||
map: map, | ||
fold: fold, | ||
for_all: for_all, | ||
exists: exists, | ||
filter: filter, | ||
partition: partition, | ||
cardinal: cardinal, | ||
elements: elements, | ||
min_elt: min_elt, | ||
min_elt_opt: min_elt_opt, | ||
max_elt: max_elt, | ||
max_elt_opt: max_elt_opt, | ||
choose: min_elt, | ||
choose_opt: min_elt_opt, | ||
split: split, | ||
find: find, | ||
find_opt: find_opt, | ||
find_first: find_first, | ||
find_first_opt: find_first_opt, | ||
find_last: find_last, | ||
find_last_opt: find_last_opt, | ||
of_list: of_list | ||
}; | ||
}) | ||
}; | ||
exports.Hashtbl = Hashtbl$1; | ||
exports.$$Map = $$Map$1; | ||
exports.$$Set = $$Set$1; | ||
exports.Hashtbl = Hashtbl; | ||
exports.$$Map = $$Map; | ||
exports.$$Set = $$Set; | ||
/* No side effect */ |
@@ -8,7 +8,6 @@ 'use strict'; | ||
Process.env[key] = $$var; | ||
} | ||
function deleteEnvVar(s) { | ||
return Js_dict.unsafeDeleteKey(Process.env, s); | ||
Js_dict.unsafeDeleteKey(Process.env, s); | ||
} | ||
@@ -15,0 +14,0 @@ |
@@ -51,3 +51,2 @@ 'use strict'; | ||
env.stacksize = newsize; | ||
} | ||
@@ -58,3 +57,2 @@ | ||
env.lval = undefined; | ||
} | ||
@@ -85,3 +83,3 @@ | ||
var cmd = _cmd; | ||
var match = Caml_parser.caml_parse_engine(tables, env, cmd, arg); | ||
var match = Caml_parser.parse_engine(tables, env, cmd, arg); | ||
switch (match) { | ||
@@ -178,3 +176,3 @@ case /* Read_token */0 : | ||
var en = Caml_array.get(env.symb_end_stack, (env.asp - i | 0) + 1 | 0); | ||
if (Caml_obj.caml_notequal(st, en)) { | ||
if (Caml_obj.notequal(st, en)) { | ||
return st; | ||
@@ -223,3 +221,3 @@ } | ||
var set_trace = Caml_parser.caml_set_parser_trace; | ||
var set_trace = Caml_parser.set_parser_trace; | ||
@@ -226,0 +224,0 @@ exports.symbol_start = symbol_start; |
'use strict'; | ||
var Curry = require("./curry.js"); | ||
var Caml_io = require("./caml_io.js"); | ||
var Caml_sys = require("./caml_sys.js"); | ||
var Caml_bytes = require("./caml_bytes.js"); | ||
var Caml_format = require("./caml_format.js"); | ||
@@ -11,3 +9,2 @@ var Caml_string = require("./caml_string.js"); | ||
var Caml_js_exceptions = require("./caml_js_exceptions.js"); | ||
var Caml_external_polyfill = require("./caml_external_polyfill.js"); | ||
@@ -109,3 +106,3 @@ function failwith(s) { | ||
try { | ||
return Caml_format.caml_int_of_string(s); | ||
return Caml_format.int_of_string(s); | ||
} | ||
@@ -146,3 +143,3 @@ catch (raw_exn){ | ||
function string_of_float(f) { | ||
return valid_float_lexem(Caml_format.caml_format_float("%.12g", f)); | ||
return valid_float_lexem(Caml_format.format_float("%.12g", f)); | ||
} | ||
@@ -152,3 +149,3 @@ | ||
try { | ||
return Caml_format.caml_float_of_string(s); | ||
return Caml_format.float_of_string(s); | ||
} | ||
@@ -175,338 +172,26 @@ catch (raw_exn){ | ||
var stdin = Caml_io.stdin; | ||
var stdout = Caml_io.stdout; | ||
var stderr = Caml_io.stderr; | ||
function open_out_gen(mode, perm, name) { | ||
var c = Caml_external_polyfill.resolve("caml_ml_open_descriptor_out")(Caml_external_polyfill.resolve("caml_sys_open")(name, mode, perm)); | ||
Caml_external_polyfill.resolve("caml_ml_set_channel_name")(c, name); | ||
return c; | ||
} | ||
function open_out(name) { | ||
return open_out_gen({ | ||
hd: /* Open_wronly */1, | ||
tl: { | ||
hd: /* Open_creat */3, | ||
tl: { | ||
hd: /* Open_trunc */4, | ||
tl: { | ||
hd: /* Open_text */7, | ||
tl: /* [] */0 | ||
} | ||
} | ||
} | ||
}, 438, name); | ||
} | ||
function open_out_bin(name) { | ||
return open_out_gen({ | ||
hd: /* Open_wronly */1, | ||
tl: { | ||
hd: /* Open_creat */3, | ||
tl: { | ||
hd: /* Open_trunc */4, | ||
tl: { | ||
hd: /* Open_binary */6, | ||
tl: /* [] */0 | ||
} | ||
} | ||
} | ||
}, 438, name); | ||
} | ||
function flush_all(param) { | ||
var _param = Caml_io.caml_ml_out_channels_list(undefined); | ||
while(true) { | ||
var param$1 = _param; | ||
if (!param$1) { | ||
return ; | ||
} | ||
try { | ||
Caml_io.caml_ml_flush(param$1.hd); | ||
} | ||
catch (raw_exn){ | ||
var exn = Caml_js_exceptions.internalToOCamlException(raw_exn); | ||
if (exn.RE_EXN_ID !== "Sys_error") { | ||
throw exn; | ||
} | ||
} | ||
_param = param$1.tl; | ||
continue ; | ||
}; | ||
} | ||
function output_bytes(oc, s) { | ||
return Caml_external_polyfill.resolve("caml_ml_output_bytes")(oc, s, 0, s.length); | ||
} | ||
function output_string(oc, s) { | ||
return Caml_io.caml_ml_output(oc, s, 0, s.length); | ||
} | ||
function output(oc, s, ofs, len) { | ||
if (ofs < 0 || len < 0 || ofs > (s.length - len | 0)) { | ||
throw { | ||
RE_EXN_ID: "Invalid_argument", | ||
_1: "output", | ||
Error: new Error() | ||
}; | ||
} | ||
return Caml_external_polyfill.resolve("caml_ml_output_bytes")(oc, s, ofs, len); | ||
} | ||
function output_substring(oc, s, ofs, len) { | ||
if (ofs < 0 || len < 0 || ofs > (s.length - len | 0)) { | ||
throw { | ||
RE_EXN_ID: "Invalid_argument", | ||
_1: "output_substring", | ||
Error: new Error() | ||
}; | ||
} | ||
return Caml_io.caml_ml_output(oc, s, ofs, len); | ||
} | ||
function output_value(chan, v) { | ||
return Caml_external_polyfill.resolve("caml_output_value")(chan, v, /* [] */0); | ||
} | ||
function close_out(oc) { | ||
Caml_io.caml_ml_flush(oc); | ||
return Caml_external_polyfill.resolve("caml_ml_close_channel")(oc); | ||
} | ||
function close_out_noerr(oc) { | ||
try { | ||
Caml_io.caml_ml_flush(oc); | ||
} | ||
catch (exn){ | ||
} | ||
try { | ||
return Caml_external_polyfill.resolve("caml_ml_close_channel")(oc); | ||
} | ||
catch (exn$1){ | ||
return ; | ||
} | ||
} | ||
function open_in_gen(mode, perm, name) { | ||
var c = Caml_external_polyfill.resolve("caml_ml_open_descriptor_in")(Caml_external_polyfill.resolve("caml_sys_open")(name, mode, perm)); | ||
Caml_external_polyfill.resolve("caml_ml_set_channel_name")(c, name); | ||
return c; | ||
} | ||
function open_in(name) { | ||
return open_in_gen({ | ||
hd: /* Open_rdonly */0, | ||
tl: { | ||
hd: /* Open_text */7, | ||
tl: /* [] */0 | ||
} | ||
}, 0, name); | ||
} | ||
function open_in_bin(name) { | ||
return open_in_gen({ | ||
hd: /* Open_rdonly */0, | ||
tl: { | ||
hd: /* Open_binary */6, | ||
tl: /* [] */0 | ||
} | ||
}, 0, name); | ||
} | ||
function input(ic, s, ofs, len) { | ||
if (ofs < 0 || len < 0 || ofs > (s.length - len | 0)) { | ||
throw { | ||
RE_EXN_ID: "Invalid_argument", | ||
_1: "input", | ||
Error: new Error() | ||
}; | ||
} | ||
return Caml_external_polyfill.resolve("caml_ml_input")(ic, s, ofs, len); | ||
} | ||
function unsafe_really_input(ic, s, _ofs, _len) { | ||
while(true) { | ||
var len = _len; | ||
var ofs = _ofs; | ||
if (len <= 0) { | ||
return ; | ||
} | ||
var r = Caml_external_polyfill.resolve("caml_ml_input")(ic, s, ofs, len); | ||
if (r === 0) { | ||
throw { | ||
RE_EXN_ID: "End_of_file", | ||
Error: new Error() | ||
}; | ||
} | ||
_len = len - r | 0; | ||
_ofs = ofs + r | 0; | ||
continue ; | ||
}; | ||
} | ||
function really_input(ic, s, ofs, len) { | ||
if (ofs < 0 || len < 0 || ofs > (s.length - len | 0)) { | ||
throw { | ||
RE_EXN_ID: "Invalid_argument", | ||
_1: "really_input", | ||
Error: new Error() | ||
}; | ||
} | ||
return unsafe_really_input(ic, s, ofs, len); | ||
} | ||
function really_input_string(ic, len) { | ||
var s = Caml_bytes.caml_create_bytes(len); | ||
really_input(ic, s, 0, len); | ||
return Caml_bytes.bytes_to_string(s); | ||
} | ||
function input_line(chan) { | ||
var build_result = function (buf, _pos, _param) { | ||
while(true) { | ||
var param = _param; | ||
var pos = _pos; | ||
if (!param) { | ||
return buf; | ||
} | ||
var hd = param.hd; | ||
var len = hd.length; | ||
Caml_bytes.caml_blit_bytes(hd, 0, buf, pos - len | 0, len); | ||
_param = param.tl; | ||
_pos = pos - len | 0; | ||
continue ; | ||
}; | ||
}; | ||
var scan = function (_accu, _len) { | ||
while(true) { | ||
var len = _len; | ||
var accu = _accu; | ||
var n = Caml_external_polyfill.resolve("caml_ml_input_scan_line")(chan); | ||
if (n === 0) { | ||
if (accu) { | ||
return build_result(Caml_bytes.caml_create_bytes(len), len, accu); | ||
} | ||
throw { | ||
RE_EXN_ID: "End_of_file", | ||
Error: new Error() | ||
}; | ||
} | ||
if (n > 0) { | ||
var res = Caml_bytes.caml_create_bytes(n - 1 | 0); | ||
Caml_external_polyfill.resolve("caml_ml_input")(chan, res, 0, n - 1 | 0); | ||
Caml_external_polyfill.resolve("caml_ml_input_char")(chan); | ||
if (!accu) { | ||
return res; | ||
} | ||
var len$1 = (len + n | 0) - 1 | 0; | ||
return build_result(Caml_bytes.caml_create_bytes(len$1), len$1, { | ||
hd: res, | ||
tl: accu | ||
}); | ||
} | ||
var beg = Caml_bytes.caml_create_bytes(-n | 0); | ||
Caml_external_polyfill.resolve("caml_ml_input")(chan, beg, 0, -n | 0); | ||
_len = len - n | 0; | ||
_accu = { | ||
hd: beg, | ||
tl: accu | ||
}; | ||
continue ; | ||
}; | ||
}; | ||
return Caml_bytes.bytes_to_string(scan(/* [] */0, 0)); | ||
} | ||
function close_in_noerr(ic) { | ||
try { | ||
return Caml_external_polyfill.resolve("caml_ml_close_channel")(ic); | ||
} | ||
catch (exn){ | ||
return ; | ||
} | ||
} | ||
function print_char(c) { | ||
return Caml_io.caml_ml_output_char(stdout, c); | ||
} | ||
function print_string(s) { | ||
return output_string(stdout, s); | ||
} | ||
function print_bytes(s) { | ||
return output_bytes(stdout, s); | ||
} | ||
function print_int(i) { | ||
return output_string(stdout, String(i)); | ||
} | ||
function print_float(f) { | ||
return output_string(stdout, valid_float_lexem(Caml_format.caml_format_float("%.12g", f))); | ||
} | ||
function print_newline(param) { | ||
Caml_io.caml_ml_output_char(stdout, /* '\n' */10); | ||
return Caml_io.caml_ml_flush(stdout); | ||
console.log(""); | ||
} | ||
function prerr_char(c) { | ||
return Caml_io.caml_ml_output_char(stderr, c); | ||
} | ||
function prerr_string(s) { | ||
return output_string(stderr, s); | ||
} | ||
function prerr_bytes(s) { | ||
return output_bytes(stderr, s); | ||
} | ||
function prerr_int(i) { | ||
return output_string(stderr, String(i)); | ||
} | ||
function prerr_float(f) { | ||
return output_string(stderr, valid_float_lexem(Caml_format.caml_format_float("%.12g", f))); | ||
} | ||
function prerr_newline(param) { | ||
Caml_io.caml_ml_output_char(stderr, /* '\n' */10); | ||
return Caml_io.caml_ml_flush(stderr); | ||
console.error(""); | ||
} | ||
function read_line(param) { | ||
Caml_io.caml_ml_flush(stdout); | ||
return input_line(stdin); | ||
function print_int(i) { | ||
console.log(String(i)); | ||
} | ||
function read_int(param) { | ||
return Caml_format.caml_int_of_string((Caml_io.caml_ml_flush(stdout), input_line(stdin))); | ||
function print_float(i) { | ||
console.log(valid_float_lexem(Caml_format.format_float("%.12g", i))); | ||
} | ||
function read_int_opt(param) { | ||
return int_of_string_opt((Caml_io.caml_ml_flush(stdout), input_line(stdin))); | ||
function print_string(prim) { | ||
console.log(prim); | ||
} | ||
function read_float(param) { | ||
return Caml_format.caml_float_of_string((Caml_io.caml_ml_flush(stdout), input_line(stdin))); | ||
} | ||
function read_float_opt(param) { | ||
return float_of_string_opt((Caml_io.caml_ml_flush(stdout), input_line(stdin))); | ||
} | ||
function string_of_format(param) { | ||
return param._1; | ||
} | ||
var exit_function = { | ||
contents: flush_all | ||
contents: (function (prim) { | ||
}) | ||
}; | ||
@@ -518,14 +203,9 @@ | ||
Curry._1(f, undefined); | ||
return Curry._1(g, undefined); | ||
Curry._1(g, undefined); | ||
}); | ||
} | ||
function do_at_exit(param) { | ||
return Curry._1(exit_function.contents, undefined); | ||
} | ||
function exit(retcode) { | ||
do_at_exit(undefined); | ||
return Caml_sys.caml_sys_exit(retcode); | ||
Curry._1(exit_function.contents, undefined); | ||
return Caml_sys.sys_exit(retcode); | ||
} | ||
@@ -545,97 +225,2 @@ | ||
var flush = Caml_io.caml_ml_flush; | ||
var output_char = Caml_io.caml_ml_output_char; | ||
var output_byte = Caml_io.caml_ml_output_char; | ||
function output_binary_int(prim0, prim1) { | ||
return Caml_external_polyfill.resolve("caml_ml_output_int")(prim0, prim1); | ||
} | ||
function seek_out(prim0, prim1) { | ||
return Caml_external_polyfill.resolve("caml_ml_seek_out")(prim0, prim1); | ||
} | ||
function pos_out(prim) { | ||
return Caml_external_polyfill.resolve("caml_ml_pos_out")(prim); | ||
} | ||
function out_channel_length(prim) { | ||
return Caml_external_polyfill.resolve("caml_ml_channel_size")(prim); | ||
} | ||
function set_binary_mode_out(prim0, prim1) { | ||
return Caml_external_polyfill.resolve("caml_ml_set_binary_mode")(prim0, prim1); | ||
} | ||
function input_char(prim) { | ||
return Caml_external_polyfill.resolve("caml_ml_input_char")(prim); | ||
} | ||
function input_byte(prim) { | ||
return Caml_external_polyfill.resolve("caml_ml_input_char")(prim); | ||
} | ||
function input_binary_int(prim) { | ||
return Caml_external_polyfill.resolve("caml_ml_input_int")(prim); | ||
} | ||
function input_value(prim) { | ||
return Caml_external_polyfill.resolve("caml_input_value")(prim); | ||
} | ||
function seek_in(prim0, prim1) { | ||
return Caml_external_polyfill.resolve("caml_ml_seek_in")(prim0, prim1); | ||
} | ||
function pos_in(prim) { | ||
return Caml_external_polyfill.resolve("caml_ml_pos_in")(prim); | ||
} | ||
function in_channel_length(prim) { | ||
return Caml_external_polyfill.resolve("caml_ml_channel_size")(prim); | ||
} | ||
function close_in(prim) { | ||
return Caml_external_polyfill.resolve("caml_ml_close_channel")(prim); | ||
} | ||
function set_binary_mode_in(prim0, prim1) { | ||
return Caml_external_polyfill.resolve("caml_ml_set_binary_mode")(prim0, prim1); | ||
} | ||
function LargeFile_seek_out(prim0, prim1) { | ||
return Caml_external_polyfill.resolve("caml_ml_seek_out_64")(prim0, prim1); | ||
} | ||
function LargeFile_pos_out(prim) { | ||
return Caml_external_polyfill.resolve("caml_ml_pos_out_64")(prim); | ||
} | ||
function LargeFile_out_channel_length(prim) { | ||
return Caml_external_polyfill.resolve("caml_ml_channel_size_64")(prim); | ||
} | ||
function LargeFile_seek_in(prim0, prim1) { | ||
return Caml_external_polyfill.resolve("caml_ml_seek_in_64")(prim0, prim1); | ||
} | ||
function LargeFile_pos_in(prim) { | ||
return Caml_external_polyfill.resolve("caml_ml_pos_in_64")(prim); | ||
} | ||
function LargeFile_in_channel_length(prim) { | ||
return Caml_external_polyfill.resolve("caml_ml_channel_size_64")(prim); | ||
} | ||
var LargeFile = { | ||
seek_out: LargeFile_seek_out, | ||
pos_out: LargeFile_pos_out, | ||
out_channel_length: LargeFile_out_channel_length, | ||
seek_in: LargeFile_seek_in, | ||
pos_in: LargeFile_pos_in, | ||
in_channel_length: LargeFile_in_channel_length | ||
}; | ||
exports.invalid_arg = invalid_arg; | ||
@@ -662,65 +247,10 @@ exports.failwith = failwith; | ||
exports.$at = $at; | ||
exports.stdin = stdin; | ||
exports.stdout = stdout; | ||
exports.stderr = stderr; | ||
exports.print_char = print_char; | ||
exports.print_string = print_string; | ||
exports.print_bytes = print_bytes; | ||
exports.print_int = print_int; | ||
exports.print_float = print_float; | ||
exports.print_newline = print_newline; | ||
exports.prerr_char = prerr_char; | ||
exports.prerr_string = prerr_string; | ||
exports.prerr_bytes = prerr_bytes; | ||
exports.prerr_int = prerr_int; | ||
exports.prerr_float = prerr_float; | ||
exports.prerr_newline = prerr_newline; | ||
exports.read_line = read_line; | ||
exports.read_int = read_int; | ||
exports.read_int_opt = read_int_opt; | ||
exports.read_float = read_float; | ||
exports.read_float_opt = read_float_opt; | ||
exports.open_out = open_out; | ||
exports.open_out_bin = open_out_bin; | ||
exports.open_out_gen = open_out_gen; | ||
exports.flush = flush; | ||
exports.flush_all = flush_all; | ||
exports.output_char = output_char; | ||
exports.output_string = output_string; | ||
exports.output_bytes = output_bytes; | ||
exports.output = output; | ||
exports.output_substring = output_substring; | ||
exports.output_byte = output_byte; | ||
exports.output_binary_int = output_binary_int; | ||
exports.output_value = output_value; | ||
exports.seek_out = seek_out; | ||
exports.pos_out = pos_out; | ||
exports.out_channel_length = out_channel_length; | ||
exports.close_out = close_out; | ||
exports.close_out_noerr = close_out_noerr; | ||
exports.set_binary_mode_out = set_binary_mode_out; | ||
exports.open_in = open_in; | ||
exports.open_in_bin = open_in_bin; | ||
exports.open_in_gen = open_in_gen; | ||
exports.input_char = input_char; | ||
exports.input_line = input_line; | ||
exports.input = input; | ||
exports.really_input = really_input; | ||
exports.really_input_string = really_input_string; | ||
exports.input_byte = input_byte; | ||
exports.input_binary_int = input_binary_int; | ||
exports.input_value = input_value; | ||
exports.seek_in = seek_in; | ||
exports.pos_in = pos_in; | ||
exports.in_channel_length = in_channel_length; | ||
exports.close_in = close_in; | ||
exports.close_in_noerr = close_in_noerr; | ||
exports.set_binary_mode_in = set_binary_mode_in; | ||
exports.LargeFile = LargeFile; | ||
exports.string_of_format = string_of_format; | ||
exports.exit = exit; | ||
exports.at_exit = at_exit; | ||
exports.valid_float_lexem = valid_float_lexem; | ||
exports.unsafe_really_input = unsafe_really_input; | ||
exports.do_at_exit = do_at_exit; | ||
/* No side effect */ |
@@ -47,8 +47,2 @@ 'use strict'; | ||
} | ||
if (x.RE_EXN_ID === "Out_of_memory") { | ||
return "Out of memory"; | ||
} | ||
if (x.RE_EXN_ID === "Stack_overflow") { | ||
return "Stack overflow"; | ||
} | ||
if (x.RE_EXN_ID === "Match_failure") { | ||
@@ -69,3 +63,3 @@ var match = x._1; | ||
} | ||
var constructor = Caml_exceptions.caml_exn_slot_name(x); | ||
var constructor = Caml_exceptions.exn_slot_name(x); | ||
return constructor + fields(x); | ||
@@ -92,3 +86,2 @@ }; | ||
var x = Caml_js_exceptions.internalToOCamlException(raw_x); | ||
Pervasives.flush(Pervasives.stdout); | ||
console.log("Uncaught exception: " + to_string(x)); | ||
@@ -104,3 +97,2 @@ return Pervasives.exit(2); | ||
}; | ||
} | ||
@@ -107,0 +99,0 @@ |
@@ -20,3 +20,2 @@ 'use strict'; | ||
q.last = /* Nil */0; | ||
} | ||
@@ -39,3 +38,2 @@ | ||
} | ||
} | ||
@@ -42,0 +40,0 @@ |
@@ -19,3 +19,2 @@ 'use strict'; | ||
st1.idx = st2.idx; | ||
} | ||
@@ -45,3 +44,2 @@ | ||
s.idx = 0; | ||
} | ||
@@ -239,11 +237,11 @@ | ||
function full_init$1(seed) { | ||
return full_init($$default, seed); | ||
full_init($$default, seed); | ||
} | ||
function init(seed) { | ||
return full_init($$default, [seed]); | ||
full_init($$default, [seed]); | ||
} | ||
function self_init(param) { | ||
return full_init$1(random_seed(undefined)); | ||
full_init$1(random_seed(undefined)); | ||
} | ||
@@ -256,3 +254,3 @@ | ||
function set_state(s) { | ||
return assign($$default, s); | ||
assign($$default, s); | ||
} | ||
@@ -259,0 +257,0 @@ |
@@ -93,3 +93,2 @@ 'use strict'; | ||
arr[j] = tmp; | ||
} | ||
@@ -163,3 +162,2 @@ | ||
} | ||
} | ||
@@ -166,0 +164,0 @@ |
@@ -18,3 +18,2 @@ 'use strict'; | ||
s.len = 0; | ||
} | ||
@@ -35,3 +34,2 @@ | ||
s.len = s.len + 1 | 0; | ||
} | ||
@@ -72,3 +70,3 @@ | ||
function iter(f, s) { | ||
return List.iter(f, s.c); | ||
List.iter(f, s.c); | ||
} | ||
@@ -75,0 +73,0 @@ |
@@ -6,3 +6,2 @@ 'use strict'; | ||
var Caml_bytes = require("./caml_bytes.js"); | ||
var Pervasives = require("./pervasives.js"); | ||
var Caml_option = require("./caml_option.js"); | ||
@@ -33,8 +32,2 @@ var Caml_string = require("./caml_string.js"); | ||
function fill_buff(b) { | ||
b.len = Pervasives.input(b.ic, b.buff, 0, b.buff.length); | ||
b.ind = 0; | ||
} | ||
function get_data(count, _d) { | ||
@@ -71,3 +64,3 @@ while(true) { | ||
"stream.ml", | ||
53, | ||
48, | ||
12 | ||
@@ -107,17 +100,2 @@ ], | ||
} | ||
case /* Sbuffio */4 : | ||
var b = d._0; | ||
if (b.ind >= b.len) { | ||
fill_buff(b); | ||
} | ||
if (b.len === 0) { | ||
return /* Sempty */0; | ||
} | ||
var r = b.buff[b.ind]; | ||
b.ind = b.ind + 1 | 0; | ||
return { | ||
TAG: /* Scons */0, | ||
_0: r, | ||
_1: d | ||
}; | ||
@@ -150,3 +128,3 @@ } | ||
"stream.ml", | ||
82, | ||
71, | ||
12 | ||
@@ -168,13 +146,2 @@ ], | ||
return x; | ||
case /* Sbuffio */4 : | ||
var b = f._0; | ||
if (b.ind >= b.len) { | ||
fill_buff(b); | ||
} | ||
if (b.len === 0) { | ||
s.data = /* Sempty */0; | ||
return ; | ||
} else { | ||
return b.buff[b.ind]; | ||
} | ||
@@ -210,7 +177,2 @@ } | ||
break; | ||
case /* Sbuffio */4 : | ||
var b = g._0; | ||
s.count = s.count + 1 | 0; | ||
b.ind = b.ind + 1 | 0; | ||
return ; | ||
default: | ||
@@ -370,17 +332,2 @@ | ||
function of_channel(ic) { | ||
return { | ||
count: 0, | ||
data: { | ||
TAG: /* Sbuffio */4, | ||
_0: { | ||
ic: ic, | ||
buff: Caml_bytes.caml_create_bytes(4096), | ||
len: 0, | ||
ind: 0 | ||
} | ||
} | ||
}; | ||
} | ||
function iapp(i, s) { | ||
@@ -493,23 +440,26 @@ return { | ||
if (typeof param === "number") { | ||
return Pervasives.print_string("Sempty"); | ||
console.log("Sempty"); | ||
return ; | ||
} | ||
switch (param.TAG | 0) { | ||
case /* Scons */0 : | ||
Pervasives.print_string("Scons ("); | ||
console.log("Scons ("); | ||
Curry._1(f, param._0); | ||
Pervasives.print_string(", "); | ||
console.log(", "); | ||
dump_data(f, param._1); | ||
return Pervasives.print_string(")"); | ||
console.log(")"); | ||
return ; | ||
case /* Sapp */1 : | ||
Pervasives.print_string("Sapp ("); | ||
console.log("Sapp ("); | ||
dump_data(f, param._0); | ||
Pervasives.print_string(", "); | ||
console.log(", "); | ||
dump_data(f, param._1); | ||
return Pervasives.print_string(")"); | ||
console.log(")"); | ||
return ; | ||
case /* Slazy */2 : | ||
return Pervasives.print_string("Slazy"); | ||
console.log("Slazy"); | ||
return ; | ||
case /* Sgen */3 : | ||
return Pervasives.print_string("Sgen"); | ||
case /* Sbuffio */4 : | ||
return Pervasives.print_string("Sbuffio"); | ||
console.log("Sgen"); | ||
return ; | ||
@@ -520,8 +470,9 @@ } | ||
function dump(f, s) { | ||
Pervasives.print_string("{count = "); | ||
Pervasives.print_int(count(s)); | ||
Pervasives.print_string("; data = "); | ||
console.log("{count = "); | ||
var i = count(s); | ||
console.log(String(i)); | ||
console.log("; data = "); | ||
dump_data(f, data(s)); | ||
Pervasives.print_string("}"); | ||
return Pervasives.print_newline(undefined); | ||
console.log("}"); | ||
console.log(""); | ||
} | ||
@@ -537,3 +488,2 @@ | ||
exports.of_bytes = of_bytes; | ||
exports.of_channel = of_channel; | ||
exports.iter = iter; | ||
@@ -540,0 +490,0 @@ exports.next = next; |
@@ -6,3 +6,3 @@ 'use strict'; | ||
var Curry = require("./curry.js"); | ||
var Caml_bytes = require("./caml_bytes.js"); | ||
var Belt_List = require("./belt_List.js"); | ||
var Caml_string = require("./caml_string.js"); | ||
@@ -12,72 +12,17 @@ var Caml_js_exceptions = require("./caml_js_exceptions.js"); | ||
function init(n, f) { | ||
return Caml_bytes.bytes_to_string(Bytes.init(n, f)); | ||
return Bytes.unsafe_to_string(Bytes.init(n, f)); | ||
} | ||
function sub(s, ofs, len) { | ||
return Caml_bytes.bytes_to_string(Bytes.sub(Caml_bytes.bytes_of_string(s), ofs, len)); | ||
return Bytes.unsafe_to_string(Bytes.sub(Bytes.unsafe_of_string(s), ofs, len)); | ||
} | ||
function ensure_ge(x, y) { | ||
if (x >= y) { | ||
return x; | ||
} | ||
throw { | ||
RE_EXN_ID: "Invalid_argument", | ||
_1: "String.concat", | ||
Error: new Error() | ||
}; | ||
function concat(sep, xs) { | ||
return Belt_List.toArray(xs).join(sep); | ||
} | ||
function sum_lengths(_acc, seplen, _param) { | ||
while(true) { | ||
var param = _param; | ||
var acc = _acc; | ||
if (!param) { | ||
return acc; | ||
} | ||
var tl = param.tl; | ||
var hd = param.hd; | ||
if (!tl) { | ||
return hd.length + acc | 0; | ||
} | ||
_param = tl; | ||
_acc = ensure_ge((hd.length + seplen | 0) + acc | 0, acc); | ||
continue ; | ||
}; | ||
} | ||
function unsafe_blits(dst, _pos, sep, seplen, _param) { | ||
while(true) { | ||
var param = _param; | ||
var pos = _pos; | ||
if (!param) { | ||
return dst; | ||
} | ||
var tl = param.tl; | ||
var hd = param.hd; | ||
if (tl) { | ||
Caml_bytes.caml_blit_string(hd, 0, dst, pos, hd.length); | ||
Caml_bytes.caml_blit_string(sep, 0, dst, pos + hd.length | 0, seplen); | ||
_param = tl; | ||
_pos = (pos + hd.length | 0) + seplen | 0; | ||
continue ; | ||
} | ||
Caml_bytes.caml_blit_string(hd, 0, dst, pos, hd.length); | ||
return dst; | ||
}; | ||
} | ||
function concat(sep, l) { | ||
if (!l) { | ||
return ""; | ||
} | ||
var seplen = sep.length; | ||
return Caml_bytes.bytes_to_string(unsafe_blits(Caml_bytes.caml_create_bytes(sum_lengths(0, seplen, l)), 0, sep, seplen, l)); | ||
} | ||
function iter(f, s) { | ||
for(var i = 0 ,i_finish = s.length; i < i_finish; ++i){ | ||
Curry._1(f, s.charCodeAt(i)); | ||
Curry._1(f, s.codePointAt(i)); | ||
} | ||
} | ||
@@ -87,13 +32,12 @@ | ||
for(var i = 0 ,i_finish = s.length; i < i_finish; ++i){ | ||
Curry._2(f, i, s.charCodeAt(i)); | ||
Curry._2(f, i, s.codePointAt(i)); | ||
} | ||
} | ||
function map(f, s) { | ||
return Caml_bytes.bytes_to_string(Bytes.map(f, Caml_bytes.bytes_of_string(s))); | ||
return Bytes.unsafe_to_string(Bytes.map(f, Bytes.unsafe_of_string(s))); | ||
} | ||
function mapi(f, s) { | ||
return Caml_bytes.bytes_to_string(Bytes.mapi(f, Caml_bytes.bytes_of_string(s))); | ||
return Bytes.unsafe_to_string(Bytes.mapi(f, Bytes.unsafe_of_string(s))); | ||
} | ||
@@ -110,6 +54,6 @@ | ||
function trim(s) { | ||
if (s === "" || !(is_space(s.charCodeAt(0)) || is_space(s.charCodeAt(s.length - 1 | 0)))) { | ||
if (s === "" || !(is_space(s.codePointAt(0)) || is_space(s.codePointAt(s.length - 1 | 0)))) { | ||
return s; | ||
} else { | ||
return Caml_bytes.bytes_to_string(Bytes.trim(Caml_bytes.bytes_of_string(s))); | ||
return Bytes.unsafe_to_string(Bytes.trim(Bytes.unsafe_of_string(s))); | ||
} | ||
@@ -125,3 +69,3 @@ } | ||
} | ||
var match = s.charCodeAt(i); | ||
var match = s.codePointAt(i); | ||
if (match < 32) { | ||
@@ -145,3 +89,3 @@ return true; | ||
if (needs_escape(0)) { | ||
return Caml_bytes.bytes_to_string(Bytes.escaped(Caml_bytes.bytes_of_string(s))); | ||
return Bytes.unsafe_to_string(Bytes.escaped(Bytes.unsafe_of_string(s))); | ||
} else { | ||
@@ -161,3 +105,3 @@ return s; | ||
} | ||
if (s.charCodeAt(i) === c) { | ||
if (s.codePointAt(i) === c) { | ||
return i; | ||
@@ -180,3 +124,3 @@ } | ||
} | ||
if (s.charCodeAt(i) === c) { | ||
if (s.codePointAt(i) === c) { | ||
return i; | ||
@@ -226,3 +170,3 @@ } | ||
} | ||
if (s.charCodeAt(i) === c) { | ||
if (s.codePointAt(i) === c) { | ||
return i; | ||
@@ -256,3 +200,3 @@ } | ||
} | ||
if (s.charCodeAt(i) === c) { | ||
if (s.codePointAt(i) === c) { | ||
return i; | ||
@@ -328,19 +272,23 @@ } | ||
function uppercase_ascii(s) { | ||
return Caml_bytes.bytes_to_string(Bytes.uppercase_ascii(Caml_bytes.bytes_of_string(s))); | ||
return Bytes.unsafe_to_string(Bytes.uppercase_ascii(Bytes.unsafe_of_string(s))); | ||
} | ||
function lowercase_ascii(s) { | ||
return Caml_bytes.bytes_to_string(Bytes.lowercase_ascii(Caml_bytes.bytes_of_string(s))); | ||
return Bytes.unsafe_to_string(Bytes.lowercase_ascii(Bytes.unsafe_of_string(s))); | ||
} | ||
function capitalize_ascii(s) { | ||
return Caml_bytes.bytes_to_string(Bytes.capitalize_ascii(Caml_bytes.bytes_of_string(s))); | ||
return Bytes.unsafe_to_string(Bytes.capitalize_ascii(Bytes.unsafe_of_string(s))); | ||
} | ||
function uncapitalize_ascii(s) { | ||
return Caml_bytes.bytes_to_string(Bytes.uncapitalize_ascii(Caml_bytes.bytes_of_string(s))); | ||
return Bytes.unsafe_to_string(Bytes.uncapitalize_ascii(Bytes.unsafe_of_string(s))); | ||
} | ||
var compare = Caml.caml_string_compare; | ||
var compare = Caml.string_compare; | ||
function equal(a, b) { | ||
return a === b; | ||
} | ||
function split_on_char(sep, s) { | ||
@@ -350,3 +298,3 @@ var r = /* [] */0; | ||
for(var i = s.length - 1 | 0; i >= 0; --i){ | ||
if (s.charCodeAt(i) === sep) { | ||
if (s.codePointAt(i) === sep) { | ||
r = { | ||
@@ -366,18 +314,2 @@ hd: sub(s, i + 1 | 0, (j - i | 0) - 1 | 0), | ||
function uppercase(s) { | ||
return Caml_bytes.bytes_to_string(Bytes.uppercase(Caml_bytes.bytes_of_string(s))); | ||
} | ||
function lowercase(s) { | ||
return Caml_bytes.bytes_to_string(Bytes.lowercase(Caml_bytes.bytes_of_string(s))); | ||
} | ||
function capitalize(s) { | ||
return Caml_bytes.bytes_to_string(Bytes.capitalize(Caml_bytes.bytes_of_string(s))); | ||
} | ||
function uncapitalize(s) { | ||
return Caml_bytes.bytes_to_string(Bytes.uncapitalize(Caml_bytes.bytes_of_string(s))); | ||
} | ||
var make = Caml_string.make; | ||
@@ -387,6 +319,2 @@ | ||
function equal(prim0, prim1) { | ||
return prim0 === prim1; | ||
} | ||
exports.make = make; | ||
@@ -414,6 +342,2 @@ exports.init = init; | ||
exports.rcontains_from = rcontains_from; | ||
exports.uppercase = uppercase; | ||
exports.lowercase = lowercase; | ||
exports.capitalize = capitalize; | ||
exports.uncapitalize = uncapitalize; | ||
exports.uppercase_ascii = uppercase_ascii; | ||
@@ -420,0 +344,0 @@ exports.lowercase_ascii = lowercase_ascii; |
'use strict'; | ||
var $$String = require("./string.js"); | ||
var Caml = require("./caml.js"); | ||
var Bytes = require("./bytes.js"); | ||
var Curry = require("./curry.js"); | ||
var Belt_List = require("./belt_List.js"); | ||
var Caml_string = require("./caml_string.js"); | ||
var Caml_js_exceptions = require("./caml_js_exceptions.js"); | ||
var make = $$String.make; | ||
function init(n, f) { | ||
return Bytes.unsafe_to_string(Bytes.init(n, f)); | ||
} | ||
var init = $$String.init; | ||
function sub(s, ofs, len) { | ||
return Bytes.unsafe_to_string(Bytes.sub(Bytes.unsafe_of_string(s), ofs, len)); | ||
} | ||
var sub = $$String.sub; | ||
var blit = Bytes.blit_string; | ||
var blit = $$String.blit; | ||
function concat(sep, xs) { | ||
return Belt_List.toArray(xs).join(sep); | ||
} | ||
var concat = $$String.concat; | ||
function iter(f, s) { | ||
for(var i = 0 ,i_finish = s.length; i < i_finish; ++i){ | ||
Curry._1(f, s.codePointAt(i)); | ||
} | ||
} | ||
var iter = $$String.iter; | ||
function iteri(f, s) { | ||
for(var i = 0 ,i_finish = s.length; i < i_finish; ++i){ | ||
Curry._2(f, i, s.codePointAt(i)); | ||
} | ||
} | ||
var iteri = $$String.iteri; | ||
function map(f, s) { | ||
return Bytes.unsafe_to_string(Bytes.map(f, Bytes.unsafe_of_string(s))); | ||
} | ||
var map = $$String.map; | ||
function mapi(f, s) { | ||
return Bytes.unsafe_to_string(Bytes.mapi(f, Bytes.unsafe_of_string(s))); | ||
} | ||
var mapi = $$String.mapi; | ||
function is_space(param) { | ||
if (param > 13 || param < 9) { | ||
return param === 32; | ||
} else { | ||
return param !== 11; | ||
} | ||
} | ||
var trim = $$String.trim; | ||
function trim(s) { | ||
if (s === "" || !(is_space(s.codePointAt(0)) || is_space(s.codePointAt(s.length - 1 | 0)))) { | ||
return s; | ||
} else { | ||
return Bytes.unsafe_to_string(Bytes.trim(Bytes.unsafe_of_string(s))); | ||
} | ||
} | ||
var escaped = $$String.escaped; | ||
function escaped(s) { | ||
var needs_escape = function (_i) { | ||
while(true) { | ||
var i = _i; | ||
if (i >= s.length) { | ||
return false; | ||
} | ||
var match = s.codePointAt(i); | ||
if (match < 32) { | ||
return true; | ||
} | ||
if (match > 92 || match < 34) { | ||
if (match >= 127) { | ||
return true; | ||
} | ||
_i = i + 1 | 0; | ||
continue ; | ||
} | ||
if (match > 91 || match < 35) { | ||
return true; | ||
} | ||
_i = i + 1 | 0; | ||
continue ; | ||
}; | ||
}; | ||
if (needs_escape(0)) { | ||
return Bytes.unsafe_to_string(Bytes.escaped(Bytes.unsafe_of_string(s))); | ||
} else { | ||
return s; | ||
} | ||
} | ||
var index = $$String.index; | ||
function index_rec(s, lim, _i, c) { | ||
while(true) { | ||
var i = _i; | ||
if (i >= lim) { | ||
throw { | ||
RE_EXN_ID: "Not_found", | ||
Error: new Error() | ||
}; | ||
} | ||
if (s.codePointAt(i) === c) { | ||
return i; | ||
} | ||
_i = i + 1 | 0; | ||
continue ; | ||
}; | ||
} | ||
var index_opt = $$String.index_opt; | ||
function index(s, c) { | ||
return index_rec(s, s.length, 0, c); | ||
} | ||
var rindex = $$String.rindex; | ||
function index_rec_opt(s, lim, _i, c) { | ||
while(true) { | ||
var i = _i; | ||
if (i >= lim) { | ||
return ; | ||
} | ||
if (s.codePointAt(i) === c) { | ||
return i; | ||
} | ||
_i = i + 1 | 0; | ||
continue ; | ||
}; | ||
} | ||
var rindex_opt = $$String.rindex_opt; | ||
function index_opt(s, c) { | ||
return index_rec_opt(s, s.length, 0, c); | ||
} | ||
var index_from = $$String.index_from; | ||
function index_from(s, i, c) { | ||
var l = s.length; | ||
if (i < 0 || i > l) { | ||
throw { | ||
RE_EXN_ID: "Invalid_argument", | ||
_1: "String.index_from / Bytes.index_from", | ||
Error: new Error() | ||
}; | ||
} | ||
return index_rec(s, l, i, c); | ||
} | ||
var index_from_opt = $$String.index_from_opt; | ||
function index_from_opt(s, i, c) { | ||
var l = s.length; | ||
if (i < 0 || i > l) { | ||
throw { | ||
RE_EXN_ID: "Invalid_argument", | ||
_1: "String.index_from_opt / Bytes.index_from_opt", | ||
Error: new Error() | ||
}; | ||
} | ||
return index_rec_opt(s, l, i, c); | ||
} | ||
var rindex_from = $$String.rindex_from; | ||
function rindex_rec(s, _i, c) { | ||
while(true) { | ||
var i = _i; | ||
if (i < 0) { | ||
throw { | ||
RE_EXN_ID: "Not_found", | ||
Error: new Error() | ||
}; | ||
} | ||
if (s.codePointAt(i) === c) { | ||
return i; | ||
} | ||
_i = i - 1 | 0; | ||
continue ; | ||
}; | ||
} | ||
var rindex_from_opt = $$String.rindex_from_opt; | ||
function rindex(s, c) { | ||
return rindex_rec(s, s.length - 1 | 0, c); | ||
} | ||
var contains = $$String.contains; | ||
function rindex_from(s, i, c) { | ||
if (i < -1 || i >= s.length) { | ||
throw { | ||
RE_EXN_ID: "Invalid_argument", | ||
_1: "String.rindex_from / Bytes.rindex_from", | ||
Error: new Error() | ||
}; | ||
} | ||
return rindex_rec(s, i, c); | ||
} | ||
var contains_from = $$String.contains_from; | ||
function rindex_rec_opt(s, _i, c) { | ||
while(true) { | ||
var i = _i; | ||
if (i < 0) { | ||
return ; | ||
} | ||
if (s.codePointAt(i) === c) { | ||
return i; | ||
} | ||
_i = i - 1 | 0; | ||
continue ; | ||
}; | ||
} | ||
var rcontains_from = $$String.rcontains_from; | ||
function rindex_opt(s, c) { | ||
return rindex_rec_opt(s, s.length - 1 | 0, c); | ||
} | ||
var uppercase = $$String.uppercase; | ||
function rindex_from_opt(s, i, c) { | ||
if (i < -1 || i >= s.length) { | ||
throw { | ||
RE_EXN_ID: "Invalid_argument", | ||
_1: "String.rindex_from_opt / Bytes.rindex_from_opt", | ||
Error: new Error() | ||
}; | ||
} | ||
return rindex_rec_opt(s, i, c); | ||
} | ||
var lowercase = $$String.lowercase; | ||
function contains_from(s, i, c) { | ||
var l = s.length; | ||
if (i < 0 || i > l) { | ||
throw { | ||
RE_EXN_ID: "Invalid_argument", | ||
_1: "String.contains_from / Bytes.contains_from", | ||
Error: new Error() | ||
}; | ||
} | ||
try { | ||
index_rec(s, l, i, c); | ||
return true; | ||
} | ||
catch (raw_exn){ | ||
var exn = Caml_js_exceptions.internalToOCamlException(raw_exn); | ||
if (exn.RE_EXN_ID === "Not_found") { | ||
return false; | ||
} | ||
throw exn; | ||
} | ||
} | ||
var capitalize = $$String.capitalize; | ||
function contains(s, c) { | ||
return contains_from(s, 0, c); | ||
} | ||
var uncapitalize = $$String.uncapitalize; | ||
function rcontains_from(s, i, c) { | ||
if (i < 0 || i >= s.length) { | ||
throw { | ||
RE_EXN_ID: "Invalid_argument", | ||
_1: "String.rcontains_from / Bytes.rcontains_from", | ||
Error: new Error() | ||
}; | ||
} | ||
try { | ||
rindex_rec(s, i, c); | ||
return true; | ||
} | ||
catch (raw_exn){ | ||
var exn = Caml_js_exceptions.internalToOCamlException(raw_exn); | ||
if (exn.RE_EXN_ID === "Not_found") { | ||
return false; | ||
} | ||
throw exn; | ||
} | ||
} | ||
var uppercase_ascii = $$String.uppercase_ascii; | ||
function uppercase_ascii(s) { | ||
return Bytes.unsafe_to_string(Bytes.uppercase_ascii(Bytes.unsafe_of_string(s))); | ||
} | ||
var lowercase_ascii = $$String.lowercase_ascii; | ||
function lowercase_ascii(s) { | ||
return Bytes.unsafe_to_string(Bytes.lowercase_ascii(Bytes.unsafe_of_string(s))); | ||
} | ||
var capitalize_ascii = $$String.capitalize_ascii; | ||
function capitalize_ascii(s) { | ||
return Bytes.unsafe_to_string(Bytes.capitalize_ascii(Bytes.unsafe_of_string(s))); | ||
} | ||
var uncapitalize_ascii = $$String.uncapitalize_ascii; | ||
function uncapitalize_ascii(s) { | ||
return Bytes.unsafe_to_string(Bytes.uncapitalize_ascii(Bytes.unsafe_of_string(s))); | ||
} | ||
var compare = $$String.compare; | ||
var compare = Caml.string_compare; | ||
var equal = $$String.equal; | ||
function equal(a, b) { | ||
return a === b; | ||
} | ||
var split_on_char = $$String.split_on_char; | ||
function split_on_char(sep, s) { | ||
var r = /* [] */0; | ||
var j = s.length; | ||
for(var i = s.length - 1 | 0; i >= 0; --i){ | ||
if (s.codePointAt(i) === sep) { | ||
r = { | ||
hd: sub(s, i + 1 | 0, (j - i | 0) - 1 | 0), | ||
tl: r | ||
}; | ||
j = i; | ||
} | ||
} | ||
return { | ||
hd: sub(s, 0, j), | ||
tl: r | ||
}; | ||
} | ||
var make = Caml_string.make; | ||
exports.make = make; | ||
@@ -93,6 +328,2 @@ exports.init = init; | ||
exports.rcontains_from = rcontains_from; | ||
exports.uppercase = uppercase; | ||
exports.lowercase = lowercase; | ||
exports.capitalize = capitalize; | ||
exports.uncapitalize = uncapitalize; | ||
exports.uppercase_ascii = uppercase_ascii; | ||
@@ -99,0 +330,0 @@ exports.lowercase_ascii = lowercase_ascii; |
@@ -6,3 +6,3 @@ 'use strict'; | ||
var match = Caml_sys.caml_sys_get_argv(undefined); | ||
var match = Caml_sys.sys_get_argv(undefined); | ||
@@ -29,2 +29,6 @@ var os_type = Caml_sys.os_type(undefined); | ||
function command(param) { | ||
return 127; | ||
} | ||
var interactive = { | ||
@@ -34,2 +38,6 @@ contents: false | ||
function signal(param, param$1) { | ||
return /* Signal_default */0; | ||
} | ||
function set_signal(sig_num, sig_beh) { | ||
@@ -128,2 +136,3 @@ | ||
exports.getenv_opt = getenv_opt; | ||
exports.command = command; | ||
exports.interactive = interactive; | ||
@@ -140,2 +149,3 @@ exports.os_type = os_type; | ||
exports.max_array_length = max_array_length; | ||
exports.signal = signal; | ||
exports.set_signal = set_signal; | ||
@@ -142,0 +152,0 @@ exports.sigabrt = sigabrt; |
@@ -7,7 +7,7 @@ 'use strict'; | ||
function err_not_sv(i) { | ||
return Caml_format.caml_format_int("%X", i) + " is not an Unicode scalar value"; | ||
return Caml_format.format_int("%X", i) + " is not an Unicode scalar value"; | ||
} | ||
function err_not_latin1(u) { | ||
return "U+" + (Caml_format.caml_format_int("%04X", u) + " is not a latin1 character"); | ||
return "U+" + (Caml_format.format_int("%04X", u) + " is not a latin1 character"); | ||
} | ||
@@ -93,3 +93,3 @@ | ||
var compare = Caml.caml_int_compare; | ||
var compare = Caml.int_compare; | ||
@@ -96,0 +96,0 @@ function hash(prim) { |
{ | ||
"name": "@rescript/std", | ||
"version": "9.1.4", | ||
"version": "10.0.0-alpha.1", | ||
"keywords": [ | ||
@@ -23,5 +23,5 @@ "rescript", | ||
"bugs": { | ||
"url": "https://github.com/rescript-lang/std/issues" | ||
"url": "https://github.com/rescript-compiler/issues" | ||
}, | ||
"homepage": "https://github.com/rescript-lang/std#readme" | ||
"homepage": "http://rescript-lang.org" | ||
} |
@@ -1,6 +0,4 @@ | ||
# A light weight runtime for ReScript. | ||
# A light weight runtime for ReScript. | ||
The motiviation of this repo is that when ReScript users want to | ||
share their library with JS users, the JS users don't need have | ||
ReScript toolchain installed, this makes sharing code with JS users easier. | ||
The motiviation of this repo is that when ReScript users want to share their library with JS users, the JS users don't need have ReScript toolchain installed, this makes sharing code with JS users easier (more details on that topic can be found in our [External Stdlib Docs](https://rescript-lang.org/docs/manual/latest/build-external-stdlib)). | ||
@@ -7,0 +5,0 @@ It shares the same version schema with ReScript compiler. |
New author
Supply chain riskA new npm collaborator published a version of the package for the first time. New collaborators are usually benign additions to a project, but do indicate a change to the security surface area of a package.
Found 1 instance in 1 package
No bug tracker
MaintenancePackage does not have a linked bug tracker in package.json.
Found 1 instance in 1 package
No v1
QualityPackage is not semver >=1. This means it is not stable and does not support ^ ranges.
Found 1 instance in 1 package
New author
Supply chain riskA new npm collaborator published a version of the package for the first time. New collaborators are usually benign additions to a project, but do indicate a change to the security surface area of a package.
Found 1 instance in 1 package
1810335
310
76655
1
1
16