time-to-botec/squiggle/node_modules/@rescript/std/lib/es6/belt_internalAVLset.js

941 lines
17 KiB
JavaScript
Raw Normal View History

import * as Curry from "./curry.js";
import * as Caml_option from "./caml_option.js";
import * as Belt_SortArray from "./belt_SortArray.js";
function copy(n) {
if (n !== undefined) {
return {
v: n.v,
h: n.h,
l: copy(n.l),
r: copy(n.r)
};
} else {
return n;
}
}
function create(l, v, r) {
var hl = l !== undefined ? l.h : 0;
var hr = r !== undefined ? r.h : 0;
return {
v: v,
h: (
hl >= hr ? hl : hr
) + 1 | 0,
l: l,
r: r
};
}
function singleton(x) {
return {
v: x,
h: 1,
l: undefined,
r: undefined
};
}
function heightGe(l, r) {
if (r !== undefined) {
if (l !== undefined) {
return l.h >= r.h;
} else {
return false;
}
} else {
return true;
}
}
function bal(l, v, r) {
var hl = l !== undefined ? l.h : 0;
var hr = r !== undefined ? r.h : 0;
if (hl > (hr + 2 | 0)) {
var ll = l.l;
var lr = l.r;
if (heightGe(ll, lr)) {
return create(ll, l.v, create(lr, v, r));
} else {
return create(create(ll, l.v, lr.l), lr.v, create(lr.r, v, r));
}
}
if (hr <= (hl + 2 | 0)) {
return {
v: v,
h: (
hl >= hr ? hl : hr
) + 1 | 0,
l: l,
r: r
};
}
var rl = r.l;
var rr = r.r;
if (heightGe(rr, rl)) {
return create(create(l, v, rl), r.v, rr);
} else {
return create(create(l, v, rl.l), rl.v, create(rl.r, r.v, rr));
}
}
function min0Aux(_n) {
while(true) {
var n = _n;
var n$1 = n.l;
if (n$1 === undefined) {
return n.v;
}
_n = n$1;
continue ;
};
}
function minimum(n) {
if (n !== undefined) {
return Caml_option.some(min0Aux(n));
}
}
function minUndefined(n) {
if (n !== undefined) {
return min0Aux(n);
}
}
function max0Aux(_n) {
while(true) {
var n = _n;
var n$1 = n.r;
if (n$1 === undefined) {
return n.v;
}
_n = n$1;
continue ;
};
}
function maximum(n) {
if (n !== undefined) {
return Caml_option.some(max0Aux(n));
}
}
function maxUndefined(n) {
if (n !== undefined) {
return max0Aux(n);
}
}
function removeMinAuxWithRef(n, v) {
var ln = n.l;
if (ln !== undefined) {
return bal(removeMinAuxWithRef(ln, v), n.v, n.r);
} else {
v.contents = n.v;
return n.r;
}
}
function isEmpty(n) {
return n === undefined;
}
function stackAllLeft(_v, _s) {
while(true) {
var s = _s;
var v = _v;
if (v === undefined) {
return s;
}
_s = {
hd: v,
tl: s
};
_v = v.l;
continue ;
};
}
function forEachU(_n, f) {
while(true) {
var n = _n;
if (n === undefined) {
return ;
}
forEachU(n.l, f);
f(n.v);
_n = n.r;
continue ;
};
}
function forEach(n, f) {
forEachU(n, Curry.__1(f));
}
function reduceU(_s, _accu, f) {
while(true) {
var accu = _accu;
var s = _s;
if (s === undefined) {
return accu;
}
_accu = f(reduceU(s.l, accu, f), s.v);
_s = s.r;
continue ;
};
}
function reduce(s, accu, f) {
return reduceU(s, accu, Curry.__2(f));
}
function everyU(_n, p) {
while(true) {
var n = _n;
if (n === undefined) {
return true;
}
if (!p(n.v)) {
return false;
}
if (!everyU(n.l, p)) {
return false;
}
_n = n.r;
continue ;
};
}
function every(n, p) {
return everyU(n, Curry.__1(p));
}
function someU(_n, p) {
while(true) {
var n = _n;
if (n === undefined) {
return false;
}
if (p(n.v)) {
return true;
}
if (someU(n.l, p)) {
return true;
}
_n = n.r;
continue ;
};
}
function some(n, p) {
return someU(n, Curry.__1(p));
}
function addMinElement(n, v) {
if (n !== undefined) {
return bal(addMinElement(n.l, v), n.v, n.r);
} else {
return singleton(v);
}
}
function addMaxElement(n, v) {
if (n !== undefined) {
return bal(n.l, n.v, addMaxElement(n.r, v));
} else {
return singleton(v);
}
}
function joinShared(ln, v, rn) {
if (ln === undefined) {
return addMinElement(rn, v);
}
if (rn === undefined) {
return addMaxElement(ln, v);
}
var lh = ln.h;
var rh = rn.h;
if (lh > (rh + 2 | 0)) {
return bal(ln.l, ln.v, joinShared(ln.r, v, rn));
} else if (rh > (lh + 2 | 0)) {
return bal(joinShared(ln, v, rn.l), rn.v, rn.r);
} else {
return create(ln, v, rn);
}
}
function concatShared(t1, t2) {
if (t1 === undefined) {
return t2;
}
if (t2 === undefined) {
return t1;
}
var v = {
contents: t2.v
};
var t2r = removeMinAuxWithRef(t2, v);
return joinShared(t1, v.contents, t2r);
}
function partitionSharedU(n, p) {
if (n === undefined) {
return [
undefined,
undefined
];
}
var value = n.v;
var match = partitionSharedU(n.l, p);
var lf = match[1];
var lt = match[0];
var pv = p(value);
var match$1 = partitionSharedU(n.r, p);
var rf = match$1[1];
var rt = match$1[0];
if (pv) {
return [
joinShared(lt, value, rt),
concatShared(lf, rf)
];
} else {
return [
concatShared(lt, rt),
joinShared(lf, value, rf)
];
}
}
function partitionShared(n, p) {
return partitionSharedU(n, Curry.__1(p));
}
function lengthNode(n) {
var l = n.l;
var r = n.r;
var sizeL = l !== undefined ? lengthNode(l) : 0;
var sizeR = r !== undefined ? lengthNode(r) : 0;
return (1 + sizeL | 0) + sizeR | 0;
}
function size(n) {
if (n !== undefined) {
return lengthNode(n);
} else {
return 0;
}
}
function toListAux(_n, _accu) {
while(true) {
var accu = _accu;
var n = _n;
if (n === undefined) {
return accu;
}
_accu = {
hd: n.v,
tl: toListAux(n.r, accu)
};
_n = n.l;
continue ;
};
}
function toList(s) {
return toListAux(s, /* [] */0);
}
function checkInvariantInternal(_v) {
while(true) {
var v = _v;
if (v === undefined) {
return ;
}
var l = v.l;
var r = v.r;
var diff = (
l !== undefined ? l.h : 0
) - (
r !== undefined ? r.h : 0
) | 0;
if (!(diff <= 2 && diff >= -2)) {
throw {
RE_EXN_ID: "Assert_failure",
_1: [
"belt_internalAVLset.ml",
290,
4
],
Error: new Error()
};
}
checkInvariantInternal(l);
_v = r;
continue ;
};
}
function fillArray(_n, _i, arr) {
while(true) {
var i = _i;
var n = _n;
var v = n.v;
var l = n.l;
var r = n.r;
var next = l !== undefined ? fillArray(l, i, arr) : i;
arr[next] = v;
var rnext = next + 1 | 0;
if (r === undefined) {
return rnext;
}
_i = rnext;
_n = r;
continue ;
};
}
function fillArrayWithPartition(_n, cursor, arr, p) {
while(true) {
var n = _n;
var v = n.v;
var l = n.l;
var r = n.r;
if (l !== undefined) {
fillArrayWithPartition(l, cursor, arr, p);
}
if (p(v)) {
var c = cursor.forward;
arr[c] = v;
cursor.forward = c + 1 | 0;
} else {
var c$1 = cursor.backward;
arr[c$1] = v;
cursor.backward = c$1 - 1 | 0;
}
if (r === undefined) {
return ;
}
_n = r;
continue ;
};
}
function fillArrayWithFilter(_n, _i, arr, p) {
while(true) {
var i = _i;
var n = _n;
var v = n.v;
var l = n.l;
var r = n.r;
var next = l !== undefined ? fillArrayWithFilter(l, i, arr, p) : i;
var rnext = p(v) ? (arr[next] = v, next + 1 | 0) : next;
if (r === undefined) {
return rnext;
}
_i = rnext;
_n = r;
continue ;
};
}
function toArray(n) {
if (n === undefined) {
return [];
}
var size = lengthNode(n);
var v = new Array(size);
fillArray(n, 0, v);
return v;
}
function fromSortedArrayRevAux(arr, off, len) {
switch (len) {
case 0 :
return ;
case 1 :
return singleton(arr[off]);
case 2 :
var x0 = arr[off];
var x1 = arr[off - 1 | 0];
return {
v: x1,
h: 2,
l: singleton(x0),
r: undefined
};
case 3 :
var x0$1 = arr[off];
var x1$1 = arr[off - 1 | 0];
var x2 = arr[off - 2 | 0];
return {
v: x1$1,
h: 2,
l: singleton(x0$1),
r: singleton(x2)
};
default:
var nl = len / 2 | 0;
var left = fromSortedArrayRevAux(arr, off, nl);
var mid = arr[off - nl | 0];
var right = fromSortedArrayRevAux(arr, (off - nl | 0) - 1 | 0, (len - nl | 0) - 1 | 0);
return create(left, mid, right);
}
}
function fromSortedArrayAux(arr, off, len) {
switch (len) {
case 0 :
return ;
case 1 :
return singleton(arr[off]);
case 2 :
var x0 = arr[off];
var x1 = arr[off + 1 | 0];
return {
v: x1,
h: 2,
l: singleton(x0),
r: undefined
};
case 3 :
var x0$1 = arr[off];
var x1$1 = arr[off + 1 | 0];
var x2 = arr[off + 2 | 0];
return {
v: x1$1,
h: 2,
l: singleton(x0$1),
r: singleton(x2)
};
default:
var nl = len / 2 | 0;
var left = fromSortedArrayAux(arr, off, nl);
var mid = arr[off + nl | 0];
var right = fromSortedArrayAux(arr, (off + nl | 0) + 1 | 0, (len - nl | 0) - 1 | 0);
return create(left, mid, right);
}
}
function fromSortedArrayUnsafe(arr) {
return fromSortedArrayAux(arr, 0, arr.length);
}
function keepSharedU(n, p) {
if (n === undefined) {
return ;
}
var v = n.v;
var l = n.l;
var r = n.r;
var newL = keepSharedU(l, p);
var pv = p(v);
var newR = keepSharedU(r, p);
if (pv) {
if (l === newL && r === newR) {
return n;
} else {
return joinShared(newL, v, newR);
}
} else {
return concatShared(newL, newR);
}
}
function keepShared(n, p) {
return keepSharedU(n, Curry.__1(p));
}
function keepCopyU(n, p) {
if (n === undefined) {
return ;
}
var size = lengthNode(n);
var v = new Array(size);
var last = fillArrayWithFilter(n, 0, v, p);
return fromSortedArrayAux(v, 0, last);
}
function keepCopy(n, p) {
return keepCopyU(n, Curry.__1(p));
}
function partitionCopyU(n, p) {
if (n === undefined) {
return [
undefined,
undefined
];
}
var size = lengthNode(n);
var v = new Array(size);
var backward = size - 1 | 0;
var cursor = {
forward: 0,
backward: backward
};
fillArrayWithPartition(n, cursor, v, p);
var forwardLen = cursor.forward;
return [
fromSortedArrayAux(v, 0, forwardLen),
fromSortedArrayRevAux(v, backward, size - forwardLen | 0)
];
}
function partitionCopy(n, p) {
return partitionCopyU(n, Curry.__1(p));
}
function has(_t, x, cmp) {
while(true) {
var t = _t;
if (t === undefined) {
return false;
}
var v = t.v;
var c = cmp(x, v);
if (c === 0) {
return true;
}
_t = c < 0 ? t.l : t.r;
continue ;
};
}
function cmp(s1, s2, cmp$1) {
var len1 = size(s1);
var len2 = size(s2);
if (len1 === len2) {
var _e1 = stackAllLeft(s1, /* [] */0);
var _e2 = stackAllLeft(s2, /* [] */0);
while(true) {
var e2 = _e2;
var e1 = _e1;
if (!e1) {
return 0;
}
if (!e2) {
return 0;
}
var h2 = e2.hd;
var h1 = e1.hd;
var c = cmp$1(h1.v, h2.v);
if (c !== 0) {
return c;
}
_e2 = stackAllLeft(h2.r, e2.tl);
_e1 = stackAllLeft(h1.r, e1.tl);
continue ;
};
} else if (len1 < len2) {
return -1;
} else {
return 1;
}
}
function eq(s1, s2, c) {
return cmp(s1, s2, c) === 0;
}
function subset(_s1, _s2, cmp) {
while(true) {
var s2 = _s2;
var s1 = _s1;
if (s1 === undefined) {
return true;
}
if (s2 === undefined) {
return false;
}
var v1 = s1.v;
var l1 = s1.l;
var r1 = s1.r;
var v2 = s2.v;
var l2 = s2.l;
var r2 = s2.r;
var c = cmp(v1, v2);
if (c === 0) {
if (!subset(l1, l2, cmp)) {
return false;
}
_s2 = r2;
_s1 = r1;
continue ;
}
if (c < 0) {
if (!subset(create(l1, v1, undefined), l2, cmp)) {
return false;
}
_s1 = r1;
continue ;
}
if (!subset(create(undefined, v1, r1), r2, cmp)) {
return false;
}
_s1 = l1;
continue ;
};
}
function get(_n, x, cmp) {
while(true) {
var n = _n;
if (n === undefined) {
return ;
}
var v = n.v;
var c = cmp(x, v);
if (c === 0) {
return Caml_option.some(v);
}
_n = c < 0 ? n.l : n.r;
continue ;
};
}
function getUndefined(_n, x, cmp) {
while(true) {
var n = _n;
if (n === undefined) {
return ;
}
var v = n.v;
var c = cmp(x, v);
if (c === 0) {
return v;
}
_n = c < 0 ? n.l : n.r;
continue ;
};
}
function getExn(_n, x, cmp) {
while(true) {
var n = _n;
if (n !== undefined) {
var v = n.v;
var c = cmp(x, v);
if (c === 0) {
return v;
}
_n = c < 0 ? n.l : n.r;
continue ;
}
throw {
RE_EXN_ID: "Not_found",
Error: new Error()
};
};
}
function rotateWithLeftChild(k2) {
var k1 = k2.l;
k2.l = k1.r;
k1.r = k2;
var n = k2.l;
var hlk2 = n !== undefined ? n.h : 0;
var n$1 = k2.r;
var hrk2 = n$1 !== undefined ? n$1.h : 0;
k2.h = (
hlk2 > hrk2 ? hlk2 : hrk2
) + 1 | 0;
var n$2 = k1.l;
var hlk1 = n$2 !== undefined ? n$2.h : 0;
var hk2 = k2.h;
k1.h = (
hlk1 > hk2 ? hlk1 : hk2
) + 1 | 0;
return k1;
}
function rotateWithRightChild(k1) {
var k2 = k1.r;
k1.r = k2.l;
k2.l = k1;
var n = k1.l;
var hlk1 = n !== undefined ? n.h : 0;
var n$1 = k1.r;
var hrk1 = n$1 !== undefined ? n$1.h : 0;
k1.h = (
hlk1 > hrk1 ? hlk1 : hrk1
) + 1 | 0;
var n$2 = k2.r;
var hrk2 = n$2 !== undefined ? n$2.h : 0;
var hk1 = k1.h;
k2.h = (
hrk2 > hk1 ? hrk2 : hk1
) + 1 | 0;
return k2;
}
function doubleWithLeftChild(k3) {
var k3l = k3.l;
var v = rotateWithRightChild(k3l);
k3.l = v;
return rotateWithLeftChild(k3);
}
function doubleWithRightChild(k2) {
var k2r = k2.r;
var v = rotateWithLeftChild(k2r);
k2.r = v;
return rotateWithRightChild(k2);
}
function heightUpdateMutate(t) {
var n = t.l;
var hlt = n !== undefined ? n.h : 0;
var n$1 = t.r;
var hrt = n$1 !== undefined ? n$1.h : 0;
t.h = (
hlt > hrt ? hlt : hrt
) + 1 | 0;
return t;
}
function balMutate(nt) {
var l = nt.l;
var r = nt.r;
var hl = l !== undefined ? l.h : 0;
var hr = r !== undefined ? r.h : 0;
if (hl > (2 + hr | 0)) {
var ll = l.l;
var lr = l.r;
if (heightGe(ll, lr)) {
return heightUpdateMutate(rotateWithLeftChild(nt));
} else {
return heightUpdateMutate(doubleWithLeftChild(nt));
}
}
if (hr > (2 + hl | 0)) {
var rl = r.l;
var rr = r.r;
if (heightGe(rr, rl)) {
return heightUpdateMutate(rotateWithRightChild(nt));
} else {
return heightUpdateMutate(doubleWithRightChild(nt));
}
}
nt.h = (
hl > hr ? hl : hr
) + 1 | 0;
return nt;
}
function addMutate(cmp, t, x) {
if (t === undefined) {
return singleton(x);
}
var k = t.v;
var c = cmp(x, k);
if (c === 0) {
return t;
}
var l = t.l;
var r = t.r;
if (c < 0) {
var ll = addMutate(cmp, l, x);
t.l = ll;
} else {
t.r = addMutate(cmp, r, x);
}
return balMutate(t);
}
function fromArray(xs, cmp) {
var len = xs.length;
if (len === 0) {
return ;
}
var next = Belt_SortArray.strictlySortedLengthU(xs, (function (x, y) {
return cmp(x, y) < 0;
}));
var result;
if (next >= 0) {
result = fromSortedArrayAux(xs, 0, next);
} else {
next = -next | 0;
result = fromSortedArrayRevAux(xs, next - 1 | 0, next);
}
for(var i = next; i < len; ++i){
result = addMutate(cmp, result, xs[i]);
}
return result;
}
function removeMinAuxWithRootMutate(nt, n) {
var ln = n.l;
var rn = n.r;
if (ln !== undefined) {
n.l = removeMinAuxWithRootMutate(nt, ln);
return balMutate(n);
} else {
nt.v = n.v;
return rn;
}
}
export {
copy ,
create ,
bal ,
singleton ,
minimum ,
minUndefined ,
maximum ,
maxUndefined ,
removeMinAuxWithRef ,
isEmpty ,
stackAllLeft ,
forEachU ,
forEach ,
reduceU ,
reduce ,
everyU ,
every ,
someU ,
some ,
joinShared ,
concatShared ,
keepSharedU ,
keepShared ,
keepCopyU ,
keepCopy ,
partitionSharedU ,
partitionShared ,
partitionCopyU ,
partitionCopy ,
lengthNode ,
size ,
toList ,
checkInvariantInternal ,
fillArray ,
toArray ,
fromSortedArrayAux ,
fromSortedArrayRevAux ,
fromSortedArrayUnsafe ,
has ,
cmp ,
eq ,
subset ,
get ,
getUndefined ,
getExn ,
fromArray ,
addMutate ,
balMutate ,
removeMinAuxWithRootMutate ,
}
/* No side effect */