306 lines
6.8 KiB
JavaScript
306 lines
6.8 KiB
JavaScript
'use strict';
|
|
|
|
var Curry = require("./curry.js");
|
|
var Caml_option = require("./caml_option.js");
|
|
var Belt_internalMapInt = require("./belt_internalMapInt.js");
|
|
var Belt_internalAVLtree = require("./belt_internalAVLtree.js");
|
|
|
|
function set(t, newK, newD) {
|
|
if (t === undefined) {
|
|
return Belt_internalAVLtree.singleton(newK, newD);
|
|
}
|
|
var k = t.k;
|
|
if (newK === k) {
|
|
return Belt_internalAVLtree.updateValue(t, newD);
|
|
}
|
|
var v = t.v;
|
|
if (newK < k) {
|
|
return Belt_internalAVLtree.bal(set(t.l, newK, newD), k, v, t.r);
|
|
} else {
|
|
return Belt_internalAVLtree.bal(t.l, k, v, set(t.r, newK, newD));
|
|
}
|
|
}
|
|
|
|
function updateU(t, x, f) {
|
|
if (t !== undefined) {
|
|
var k = t.k;
|
|
if (x === k) {
|
|
var data = f(Caml_option.some(t.v));
|
|
if (data !== undefined) {
|
|
return Belt_internalAVLtree.updateValue(t, Caml_option.valFromOption(data));
|
|
}
|
|
var l = t.l;
|
|
var r = t.r;
|
|
if (l === undefined) {
|
|
return r;
|
|
}
|
|
if (r === undefined) {
|
|
return l;
|
|
}
|
|
var kr = {
|
|
contents: r.k
|
|
};
|
|
var vr = {
|
|
contents: r.v
|
|
};
|
|
var r$1 = Belt_internalAVLtree.removeMinAuxWithRef(r, kr, vr);
|
|
return Belt_internalAVLtree.bal(l, kr.contents, vr.contents, r$1);
|
|
}
|
|
var v = t.v;
|
|
var l$1 = t.l;
|
|
var r$2 = t.r;
|
|
if (x < k) {
|
|
var ll = updateU(l$1, x, f);
|
|
if (l$1 === ll) {
|
|
return t;
|
|
} else {
|
|
return Belt_internalAVLtree.bal(ll, k, v, r$2);
|
|
}
|
|
}
|
|
var rr = updateU(r$2, x, f);
|
|
if (r$2 === rr) {
|
|
return t;
|
|
} else {
|
|
return Belt_internalAVLtree.bal(l$1, k, v, rr);
|
|
}
|
|
}
|
|
var data$1 = f(undefined);
|
|
if (data$1 !== undefined) {
|
|
return Belt_internalAVLtree.singleton(x, Caml_option.valFromOption(data$1));
|
|
} else {
|
|
return t;
|
|
}
|
|
}
|
|
|
|
function update(t, x, f) {
|
|
return updateU(t, x, Curry.__1(f));
|
|
}
|
|
|
|
function removeAux(n, x) {
|
|
var v = n.k;
|
|
var l = n.l;
|
|
var r = n.r;
|
|
if (x === v) {
|
|
if (l === undefined) {
|
|
return r;
|
|
}
|
|
if (r === undefined) {
|
|
return l;
|
|
}
|
|
var kr = {
|
|
contents: r.k
|
|
};
|
|
var vr = {
|
|
contents: r.v
|
|
};
|
|
var r$1 = Belt_internalAVLtree.removeMinAuxWithRef(r, kr, vr);
|
|
return Belt_internalAVLtree.bal(l, kr.contents, vr.contents, r$1);
|
|
}
|
|
if (x < v) {
|
|
if (l === undefined) {
|
|
return n;
|
|
}
|
|
var ll = removeAux(l, x);
|
|
if (ll === l) {
|
|
return n;
|
|
} else {
|
|
return Belt_internalAVLtree.bal(ll, v, n.v, r);
|
|
}
|
|
}
|
|
if (r === undefined) {
|
|
return n;
|
|
}
|
|
var rr = removeAux(r, x);
|
|
return Belt_internalAVLtree.bal(l, v, n.v, rr);
|
|
}
|
|
|
|
function remove(n, x) {
|
|
if (n !== undefined) {
|
|
return removeAux(n, x);
|
|
}
|
|
|
|
}
|
|
|
|
function removeMany(t, keys) {
|
|
var len = keys.length;
|
|
if (t !== undefined) {
|
|
var _t = t;
|
|
var _i = 0;
|
|
while(true) {
|
|
var i = _i;
|
|
var t$1 = _t;
|
|
if (i >= len) {
|
|
return t$1;
|
|
}
|
|
var ele = keys[i];
|
|
var u = removeAux(t$1, ele);
|
|
if (u === undefined) {
|
|
return u;
|
|
}
|
|
_i = i + 1 | 0;
|
|
_t = u;
|
|
continue ;
|
|
};
|
|
}
|
|
|
|
}
|
|
|
|
function mergeMany(h, arr) {
|
|
var len = arr.length;
|
|
var v = h;
|
|
for(var i = 0; i < len; ++i){
|
|
var match = arr[i];
|
|
v = set(v, match[0], match[1]);
|
|
}
|
|
return v;
|
|
}
|
|
|
|
var empty;
|
|
|
|
var isEmpty = Belt_internalAVLtree.isEmpty;
|
|
|
|
var has = Belt_internalMapInt.has;
|
|
|
|
var cmpU = Belt_internalMapInt.cmpU;
|
|
|
|
var cmp = Belt_internalMapInt.cmp;
|
|
|
|
var eqU = Belt_internalMapInt.eqU;
|
|
|
|
var eq = Belt_internalMapInt.eq;
|
|
|
|
var findFirstByU = Belt_internalAVLtree.findFirstByU;
|
|
|
|
var findFirstBy = Belt_internalAVLtree.findFirstBy;
|
|
|
|
var forEachU = Belt_internalAVLtree.forEachU;
|
|
|
|
var forEach = Belt_internalAVLtree.forEach;
|
|
|
|
var reduceU = Belt_internalAVLtree.reduceU;
|
|
|
|
var reduce = Belt_internalAVLtree.reduce;
|
|
|
|
var everyU = Belt_internalAVLtree.everyU;
|
|
|
|
var every = Belt_internalAVLtree.every;
|
|
|
|
var someU = Belt_internalAVLtree.someU;
|
|
|
|
var some = Belt_internalAVLtree.some;
|
|
|
|
var size = Belt_internalAVLtree.size;
|
|
|
|
var toList = Belt_internalAVLtree.toList;
|
|
|
|
var toArray = Belt_internalAVLtree.toArray;
|
|
|
|
var fromArray = Belt_internalMapInt.fromArray;
|
|
|
|
var keysToArray = Belt_internalAVLtree.keysToArray;
|
|
|
|
var valuesToArray = Belt_internalAVLtree.valuesToArray;
|
|
|
|
var minKey = Belt_internalAVLtree.minKey;
|
|
|
|
var minKeyUndefined = Belt_internalAVLtree.minKeyUndefined;
|
|
|
|
var maxKey = Belt_internalAVLtree.maxKey;
|
|
|
|
var maxKeyUndefined = Belt_internalAVLtree.maxKeyUndefined;
|
|
|
|
var minimum = Belt_internalAVLtree.minimum;
|
|
|
|
var minUndefined = Belt_internalAVLtree.minUndefined;
|
|
|
|
var maximum = Belt_internalAVLtree.maximum;
|
|
|
|
var maxUndefined = Belt_internalAVLtree.maxUndefined;
|
|
|
|
var get = Belt_internalMapInt.get;
|
|
|
|
var getUndefined = Belt_internalMapInt.getUndefined;
|
|
|
|
var getWithDefault = Belt_internalMapInt.getWithDefault;
|
|
|
|
var getExn = Belt_internalMapInt.getExn;
|
|
|
|
var checkInvariantInternal = Belt_internalAVLtree.checkInvariantInternal;
|
|
|
|
var mergeU = Belt_internalMapInt.mergeU;
|
|
|
|
var merge = Belt_internalMapInt.merge;
|
|
|
|
var keepU = Belt_internalAVLtree.keepSharedU;
|
|
|
|
var keep = Belt_internalAVLtree.keepShared;
|
|
|
|
var partitionU = Belt_internalAVLtree.partitionSharedU;
|
|
|
|
var partition = Belt_internalAVLtree.partitionShared;
|
|
|
|
var split = Belt_internalMapInt.split;
|
|
|
|
var mapU = Belt_internalAVLtree.mapU;
|
|
|
|
var map = Belt_internalAVLtree.map;
|
|
|
|
var mapWithKeyU = Belt_internalAVLtree.mapWithKeyU;
|
|
|
|
var mapWithKey = Belt_internalAVLtree.mapWithKey;
|
|
|
|
exports.empty = empty;
|
|
exports.isEmpty = isEmpty;
|
|
exports.has = has;
|
|
exports.cmpU = cmpU;
|
|
exports.cmp = cmp;
|
|
exports.eqU = eqU;
|
|
exports.eq = eq;
|
|
exports.findFirstByU = findFirstByU;
|
|
exports.findFirstBy = findFirstBy;
|
|
exports.forEachU = forEachU;
|
|
exports.forEach = forEach;
|
|
exports.reduceU = reduceU;
|
|
exports.reduce = reduce;
|
|
exports.everyU = everyU;
|
|
exports.every = every;
|
|
exports.someU = someU;
|
|
exports.some = some;
|
|
exports.size = size;
|
|
exports.toList = toList;
|
|
exports.toArray = toArray;
|
|
exports.fromArray = fromArray;
|
|
exports.keysToArray = keysToArray;
|
|
exports.valuesToArray = valuesToArray;
|
|
exports.minKey = minKey;
|
|
exports.minKeyUndefined = minKeyUndefined;
|
|
exports.maxKey = maxKey;
|
|
exports.maxKeyUndefined = maxKeyUndefined;
|
|
exports.minimum = minimum;
|
|
exports.minUndefined = minUndefined;
|
|
exports.maximum = maximum;
|
|
exports.maxUndefined = maxUndefined;
|
|
exports.get = get;
|
|
exports.getUndefined = getUndefined;
|
|
exports.getWithDefault = getWithDefault;
|
|
exports.getExn = getExn;
|
|
exports.checkInvariantInternal = checkInvariantInternal;
|
|
exports.remove = remove;
|
|
exports.removeMany = removeMany;
|
|
exports.set = set;
|
|
exports.updateU = updateU;
|
|
exports.update = update;
|
|
exports.mergeU = mergeU;
|
|
exports.merge = merge;
|
|
exports.mergeMany = mergeMany;
|
|
exports.keepU = keepU;
|
|
exports.keep = keep;
|
|
exports.partitionU = partitionU;
|
|
exports.partition = partition;
|
|
exports.split = split;
|
|
exports.mapU = mapU;
|
|
exports.map = map;
|
|
exports.mapWithKeyU = mapWithKeyU;
|
|
exports.mapWithKey = mapWithKey;
|
|
/* No side effect */
|