time-to-botec/squiggle/node_modules/@rescript/std/lib/es6/belt_Map.js
NunoSempere b6addc7f05 feat: add the node modules
Necessary in order to clearly see the squiggle hotwiring.
2022-12-03 12:44:49 +00:00

377 lines
6.2 KiB
JavaScript

import * as Curry from "./curry.js";
import * as Belt_MapDict from "./belt_MapDict.js";
function fromArray(data, id) {
var cmp = id.cmp;
return {
cmp: cmp,
data: Belt_MapDict.fromArray(data, cmp)
};
}
function remove(m, x) {
var odata = m.data;
var cmp = m.cmp;
var newData = Belt_MapDict.remove(odata, x, cmp);
if (newData === odata) {
return m;
} else {
return {
cmp: cmp,
data: newData
};
}
}
function removeMany(m, x) {
var cmp = m.cmp;
var newData = Belt_MapDict.removeMany(m.data, x, cmp);
return {
cmp: cmp,
data: newData
};
}
function set(m, key, d) {
var cmp = m.cmp;
return {
cmp: cmp,
data: Belt_MapDict.set(m.data, key, d, cmp)
};
}
function mergeMany(m, e) {
var cmp = m.cmp;
return {
cmp: cmp,
data: Belt_MapDict.mergeMany(m.data, e, cmp)
};
}
function updateU(m, key, f) {
var cmp = m.cmp;
return {
cmp: cmp,
data: Belt_MapDict.updateU(m.data, key, f, cmp)
};
}
function update(m, key, f) {
return updateU(m, key, Curry.__1(f));
}
function split(m, x) {
var cmp = m.cmp;
var match = Belt_MapDict.split(m.data, x, cmp);
var match$1 = match[0];
return [
[
{
cmp: cmp,
data: match$1[0]
},
{
cmp: cmp,
data: match$1[1]
}
],
match[1]
];
}
function mergeU(s1, s2, f) {
var cmp = s1.cmp;
return {
cmp: cmp,
data: Belt_MapDict.mergeU(s1.data, s2.data, f, cmp)
};
}
function merge(s1, s2, f) {
return mergeU(s1, s2, Curry.__3(f));
}
function make(id) {
return {
cmp: id.cmp,
data: undefined
};
}
function isEmpty(map) {
return Belt_MapDict.isEmpty(map.data);
}
function findFirstByU(m, f) {
return Belt_MapDict.findFirstByU(m.data, f);
}
function findFirstBy(m, f) {
return Belt_MapDict.findFirstByU(m.data, Curry.__2(f));
}
function forEachU(m, f) {
Belt_MapDict.forEachU(m.data, f);
}
function forEach(m, f) {
Belt_MapDict.forEachU(m.data, Curry.__2(f));
}
function reduceU(m, acc, f) {
return Belt_MapDict.reduceU(m.data, acc, f);
}
function reduce(m, acc, f) {
return reduceU(m, acc, Curry.__3(f));
}
function everyU(m, f) {
return Belt_MapDict.everyU(m.data, f);
}
function every(m, f) {
return Belt_MapDict.everyU(m.data, Curry.__2(f));
}
function someU(m, f) {
return Belt_MapDict.someU(m.data, f);
}
function some(m, f) {
return Belt_MapDict.someU(m.data, Curry.__2(f));
}
function keepU(m, f) {
return {
cmp: m.cmp,
data: Belt_MapDict.keepU(m.data, f)
};
}
function keep(m, f) {
return keepU(m, Curry.__2(f));
}
function partitionU(m, p) {
var cmp = m.cmp;
var match = Belt_MapDict.partitionU(m.data, p);
return [
{
cmp: cmp,
data: match[0]
},
{
cmp: cmp,
data: match[1]
}
];
}
function partition(m, p) {
return partitionU(m, Curry.__2(p));
}
function mapU(m, f) {
return {
cmp: m.cmp,
data: Belt_MapDict.mapU(m.data, f)
};
}
function map(m, f) {
return mapU(m, Curry.__1(f));
}
function mapWithKeyU(m, f) {
return {
cmp: m.cmp,
data: Belt_MapDict.mapWithKeyU(m.data, f)
};
}
function mapWithKey(m, f) {
return mapWithKeyU(m, Curry.__2(f));
}
function size(map) {
return Belt_MapDict.size(map.data);
}
function toList(map) {
return Belt_MapDict.toList(map.data);
}
function toArray(m) {
return Belt_MapDict.toArray(m.data);
}
function keysToArray(m) {
return Belt_MapDict.keysToArray(m.data);
}
function valuesToArray(m) {
return Belt_MapDict.valuesToArray(m.data);
}
function minKey(m) {
return Belt_MapDict.minKey(m.data);
}
function minKeyUndefined(m) {
return Belt_MapDict.minKeyUndefined(m.data);
}
function maxKey(m) {
return Belt_MapDict.maxKey(m.data);
}
function maxKeyUndefined(m) {
return Belt_MapDict.maxKeyUndefined(m.data);
}
function minimum(m) {
return Belt_MapDict.minimum(m.data);
}
function minUndefined(m) {
return Belt_MapDict.minUndefined(m.data);
}
function maximum(m) {
return Belt_MapDict.maximum(m.data);
}
function maxUndefined(m) {
return Belt_MapDict.maxUndefined(m.data);
}
function get(map, x) {
return Belt_MapDict.get(map.data, x, map.cmp);
}
function getUndefined(map, x) {
return Belt_MapDict.getUndefined(map.data, x, map.cmp);
}
function getWithDefault(map, x, def) {
return Belt_MapDict.getWithDefault(map.data, x, def, map.cmp);
}
function getExn(map, x) {
return Belt_MapDict.getExn(map.data, x, map.cmp);
}
function has(map, x) {
return Belt_MapDict.has(map.data, x, map.cmp);
}
function checkInvariantInternal(m) {
Belt_MapDict.checkInvariantInternal(m.data);
}
function eqU(m1, m2, veq) {
return Belt_MapDict.eqU(m1.data, m2.data, m1.cmp, veq);
}
function eq(m1, m2, veq) {
return eqU(m1, m2, Curry.__2(veq));
}
function cmpU(m1, m2, vcmp) {
return Belt_MapDict.cmpU(m1.data, m2.data, m1.cmp, vcmp);
}
function cmp(m1, m2, vcmp) {
return cmpU(m1, m2, Curry.__2(vcmp));
}
function getData(m) {
return m.data;
}
function getId(m) {
var cmp = m.cmp;
return {
cmp: cmp
};
}
function packIdData(id, data) {
return {
cmp: id.cmp,
data: data
};
}
var Int;
var $$String;
var Dict;
export {
Int ,
$$String ,
Dict ,
make ,
isEmpty ,
has ,
cmpU ,
cmp ,
eqU ,
eq ,
findFirstByU ,
findFirstBy ,
forEachU ,
forEach ,
reduceU ,
reduce ,
everyU ,
every ,
someU ,
some ,
size ,
toArray ,
toList ,
fromArray ,
keysToArray ,
valuesToArray ,
minKey ,
minKeyUndefined ,
maxKey ,
maxKeyUndefined ,
minimum ,
minUndefined ,
maximum ,
maxUndefined ,
get ,
getUndefined ,
getWithDefault ,
getExn ,
remove ,
removeMany ,
set ,
updateU ,
update ,
mergeMany ,
mergeU ,
merge ,
keepU ,
keep ,
partitionU ,
partition ,
split ,
mapU ,
map ,
mapWithKeyU ,
mapWithKey ,
getData ,
getId ,
packIdData ,
checkInvariantInternal ,
}
/* No side effect */