@slicemachine/manager 0.22.2-alpha.dani-snippets.7 → 0.22.2-alpha.dani-repeatable-links-codegen.1

package/dist/_node_modules/fp-ts/es6/Map.js

@@ -0,0 +1,637 @@
+import { pipe } from "./function.js";
+import { flap as flap$1 } from "./Functor.js";
+import { some, none, isNone, isSome, isLeft } from "./internal.js";
+import { map as map$1 } from "./Option.js";
+import { getShow as getShow$1, size as size$1, isEmpty as isEmpty$1, member as member$1, elem as elem$1, lookup as lookup$1, isSubmap as isSubmap$1, getEq as getEq$1, reduce as reduce$1, foldMap as foldMap$1, reduceRight as reduceRight$1, getFoldable as getFoldable$1, reduceWithIndex as reduceWithIndex$1, foldMapWithIndex as foldMapWithIndex$1, reduceRightWithIndex as reduceRightWithIndex$1, getFoldableWithIndex as getFoldableWithIndex$1, union as union$1, intersection as intersection$1, difference as difference$1 } from "./ReadonlyMap.js";
+import { separated } from "./Separated.js";
+import { wiltDefault, witherDefault } from "./Witherable.js";
+var __assign = globalThis && globalThis.__assign || function() {
+  __assign = Object.assign || function(t) {
+    for (var s, i = 1, n = arguments.length; i < n; i++) {
+      s = arguments[i];
+      for (var p in s)
+        if (Object.prototype.hasOwnProperty.call(s, p))
+          t[p] = s[p];
+    }
+    return t;
+  };
+  return __assign.apply(this, arguments);
+};
+var getShow = getShow$1;
+var size = size$1;
+var isEmpty = isEmpty$1;
+var member = member$1;
+var elem = elem$1;
+var keys = function(O) {
+  return function(m) {
+    return Array.from(m.keys()).sort(O.compare);
+  };
+};
+var values = function(O) {
+  return function(m) {
+    return Array.from(m.values()).sort(O.compare);
+  };
+};
+function collect(O) {
+  var keysO = keys(O);
+  return function(f) {
+    return function(m) {
+      var out = [];
+      var ks = keysO(m);
+      for (var _i = 0, ks_1 = ks; _i < ks_1.length; _i++) {
+        var key = ks_1[_i];
+        out.push(f(key, m.get(key)));
+      }
+      return out;
+    };
+  };
+}
+function toArray(O) {
+  return collect(O)(function(k, a) {
+    return [k, a];
+  });
+}
+function toUnfoldable(ord, U) {
+  var toArrayO = toArray(ord);
+  return function(d) {
+    var kas = toArrayO(d);
+    var len = kas.length;
+    return U.unfold(0, function(b) {
+      return b < len ? some([kas[b], b + 1]) : none;
+    });
+  };
+}
+var upsertAt = function(E) {
+  var lookupWithKeyE = lookupWithKey(E);
+  return function(k, a) {
+    var lookupWithKeyEk = lookupWithKeyE(k);
+    return function(m) {
+      var found = lookupWithKeyEk(m);
+      if (isNone(found)) {
+        var out = new Map(m);
+        out.set(k, a);
+        return out;
+      } else if (found.value[1] !== a) {
+        var out = new Map(m);
+        out.set(found.value[0], a);
+        return out;
+      }
+      return m;
+    };
+  };
+};
+var deleteAt = function(E) {
+  var lookupWithKeyE = lookupWithKey(E);
+  return function(k) {
+    return function(m) {
+      var found = lookupWithKeyE(k, m);
+      if (isSome(found)) {
+        var r = new Map(m);
+        r.delete(found.value[0]);
+        return r;
+      }
+      return m;
+    };
+  };
+};
+var updateAt = function(E) {
+  var modifyAtE = modifyAt(E);
+  return function(k, a) {
+    return modifyAtE(k, function() {
+      return a;
+    });
+  };
+};
+var modifyAt = function(E) {
+  var lookupWithKeyE = lookupWithKey(E);
+  return function(k, f) {
+    return function(m) {
+      var found = lookupWithKeyE(k, m);
+      if (isNone(found)) {
+        return none;
+      }
+      var r = new Map(m);
+      r.set(found.value[0], f(found.value[1]));
+      return some(r);
+    };
+  };
+};
+function pop(E) {
+  var lookupE = lookup(E);
+  var deleteAtE = deleteAt(E);
+  return function(k) {
+    var deleteAtEk = deleteAtE(k);
+    return function(m) {
+      return pipe(lookupE(k, m), map$1(function(a) {
+        return [a, deleteAtEk(m)];
+      }));
+    };
+  };
+}
+function lookupWithKey(E) {
+  return function(k, m) {
+    if (m === void 0) {
+      var lookupWithKeyE_1 = lookupWithKey(E);
+      return function(m2) {
+        return lookupWithKeyE_1(k, m2);
+      };
+    }
+    var entries = m.entries();
+    var e;
+    while (!(e = entries.next()).done) {
+      var _a = e.value, ka = _a[0], a = _a[1];
+      if (E.equals(ka, k)) {
+        return some([ka, a]);
+      }
+    }
+    return none;
+  };
+}
+var lookup = lookup$1;
+var isSubmap = isSubmap$1;
+var getEq = getEq$1;
+function getMonoid(SK, SA) {
+  var lookupWithKeyS = lookupWithKey(SK);
+  return {
+    concat: function(mx, my) {
+      if (isEmpty(mx)) {
+        return my;
+      }
+      if (isEmpty(my)) {
+        return mx;
+      }
+      var r = new Map(mx);
+      var entries = my.entries();
+      var e;
+      while (!(e = entries.next()).done) {
+        var _a = e.value, k = _a[0], a = _a[1];
+        var mxOptA = lookupWithKeyS(k, mx);
+        if (isSome(mxOptA)) {
+          r.set(mxOptA.value[0], SA.concat(mxOptA.value[1], a));
+        } else {
+          r.set(k, a);
+        }
+      }
+      return r;
+    },
+    empty: /* @__PURE__ */ new Map()
+  };
+}
+var singleton = function(k, a) {
+  return /* @__PURE__ */ new Map([[k, a]]);
+};
+function fromFoldable(E, M, F) {
+  return function(fka) {
+    var lookupWithKeyE = lookupWithKey(E);
+    return F.reduce(fka, /* @__PURE__ */ new Map(), function(b, _a) {
+      var k = _a[0], a = _a[1];
+      var bOpt = lookupWithKeyE(k, b);
+      if (isSome(bOpt)) {
+        b.set(bOpt.value[0], M.concat(bOpt.value[1], a));
+      } else {
+        b.set(k, a);
+      }
+      return b;
+    });
+  };
+}
+var _mapWithIndex = function(fa, f) {
+  var m = /* @__PURE__ */ new Map();
+  var entries = fa.entries();
+  var e;
+  while (!(e = entries.next()).done) {
+    var _a = e.value, key = _a[0], a = _a[1];
+    m.set(key, f(key, a));
+  }
+  return m;
+};
+var partitionMapWithIndex = function(f) {
+  return function(fa) {
+    var left = /* @__PURE__ */ new Map();
+    var right = /* @__PURE__ */ new Map();
+    var entries = fa.entries();
+    var e;
+    while (!(e = entries.next()).done) {
+      var _a = e.value, k = _a[0], a = _a[1];
+      var ei = f(k, a);
+      if (isLeft(ei)) {
+        left.set(k, ei.left);
+      } else {
+        right.set(k, ei.right);
+      }
+    }
+    return separated(left, right);
+  };
+};
+function partitionWithIndex(predicateWithIndex) {
+  return function(fa) {
+    var left = /* @__PURE__ */ new Map();
+    var right = /* @__PURE__ */ new Map();
+    var entries = fa.entries();
+    var e;
+    while (!(e = entries.next()).done) {
+      var _a = e.value, k = _a[0], a = _a[1];
+      if (predicateWithIndex(k, a)) {
+        right.set(k, a);
+      } else {
+        left.set(k, a);
+      }
+    }
+    return separated(left, right);
+  };
+}
+var filterMapWithIndex = function(f) {
+  return function(fa) {
+    var m = /* @__PURE__ */ new Map();
+    var entries = fa.entries();
+    var e;
+    while (!(e = entries.next()).done) {
+      var _a = e.value, k = _a[0], a = _a[1];
+      var o = f(k, a);
+      if (isSome(o)) {
+        m.set(k, o.value);
+      }
+    }
+    return m;
+  };
+};
+function filterWithIndex(p) {
+  return function(m) {
+    var out = /* @__PURE__ */ new Map();
+    var entries = m.entries();
+    var e;
+    while (!(e = entries.next()).done) {
+      var _a = e.value, k = _a[0], a = _a[1];
+      if (p(k, a)) {
+        out.set(k, a);
+      }
+    }
+    return out;
+  };
+}
+var _map = function(fa, f) {
+  return _mapWithIndex(fa, function(_, a) {
+    return f(a);
+  });
+};
+var _filter = function(fa, p) {
+  return _filterWithIndex(fa, function(_, a) {
+    return p(a);
+  });
+};
+var _filterMap = function(fa, f) {
+  return _filterMapWithIndex(fa, function(_, a) {
+    return f(a);
+  });
+};
+var _partition = function(fa, predicate) {
+  return _partitionWithIndex(fa, function(_, a) {
+    return predicate(a);
+  });
+};
+var _partitionMap = function(fa, f) {
+  return _partitionMapWithIndex(fa, function(_, a) {
+    return f(a);
+  });
+};
+var _filterWithIndex = function(fa, p) {
+  return pipe(fa, filterWithIndex(p));
+};
+var _filterMapWithIndex = function(fa, f) {
+  return pipe(fa, filterMapWithIndex(f));
+};
+var _partitionWithIndex = function(fa, p) {
+  return pipe(fa, partitionWithIndex(p));
+};
+var _partitionMapWithIndex = function(fa, f) {
+  return pipe(fa, partitionMapWithIndex(f));
+};
+var compact = function(fa) {
+  var m = /* @__PURE__ */ new Map();
+  var entries = fa.entries();
+  var e;
+  while (!(e = entries.next()).done) {
+    var _a = e.value, k = _a[0], oa = _a[1];
+    if (isSome(oa)) {
+      m.set(k, oa.value);
+    }
+  }
+  return m;
+};
+var filter = function(predicate) {
+  return function(fa) {
+    return _filter(fa, predicate);
+  };
+};
+var filterMap = function(f) {
+  return function(fa) {
+    return _filterMap(fa, f);
+  };
+};
+var map = function(f) {
+  return function(fa) {
+    return _map(fa, f);
+  };
+};
+var mapWithIndex = function(f) {
+  return function(fa) {
+    return _mapWithIndex(fa, f);
+  };
+};
+var partition = function(predicate) {
+  return function(fa) {
+    return _partition(fa, predicate);
+  };
+};
+var partitionMap = function(f) {
+  return function(fa) {
+    return _partitionMap(fa, f);
+  };
+};
+var separate = function(fa) {
+  var left = /* @__PURE__ */ new Map();
+  var right = /* @__PURE__ */ new Map();
+  var entries = fa.entries();
+  var e;
+  while (!(e = entries.next()).done) {
+    var _a = e.value, k = _a[0], ei = _a[1];
+    if (isLeft(ei)) {
+      left.set(k, ei.left);
+    } else {
+      right.set(k, ei.right);
+    }
+  }
+  return separated(left, right);
+};
+var URI = "Map";
+var getUnionSemigroup = function(E, S) {
+  var unionES = union(E, S);
+  return {
+    concat: function(first, second) {
+      return unionES(second)(first);
+    }
+  };
+};
+var getUnionMonoid = function(E, S) {
+  return {
+    concat: getUnionSemigroup(E, S).concat,
+    empty: /* @__PURE__ */ new Map()
+  };
+};
+var getIntersectionSemigroup = function(E, S) {
+  var intersectionES = intersection(E, S);
+  return {
+    concat: function(first, second) {
+      return intersectionES(second)(first);
+    }
+  };
+};
+var getDifferenceMagma = function(E) {
+  return function() {
+    var differenceE = difference(E);
+    return {
+      concat: function(first, second) {
+        return differenceE(second)(first);
+      }
+    };
+  };
+};
+function getFilterableWithIndex() {
+  return {
+    URI,
+    _E: void 0,
+    map: _map,
+    mapWithIndex: _mapWithIndex,
+    compact,
+    separate,
+    filter: _filter,
+    filterMap: _filterMap,
+    partition: _partition,
+    partitionMap: _partitionMap,
+    partitionMapWithIndex: _partitionMapWithIndex,
+    partitionWithIndex: _partitionWithIndex,
+    filterMapWithIndex: _filterMapWithIndex,
+    filterWithIndex: _filterWithIndex
+  };
+}
+function getWitherable(O) {
+  var TWI = getTraversableWithIndex(O);
+  return {
+    URI,
+    _E: void 0,
+    map: _map,
+    compact,
+    separate,
+    filter: _filter,
+    filterMap: _filterMap,
+    partition: _partition,
+    partitionMap: _partitionMap,
+    reduce: TWI.reduce,
+    foldMap: TWI.foldMap,
+    reduceRight: TWI.reduceRight,
+    traverse: TWI.traverse,
+    sequence: TWI.sequence,
+    mapWithIndex: _mapWithIndex,
+    reduceWithIndex: TWI.reduceWithIndex,
+    foldMapWithIndex: TWI.foldMapWithIndex,
+    reduceRightWithIndex: TWI.reduceRightWithIndex,
+    traverseWithIndex: TWI.traverseWithIndex,
+    wilt: wiltDefault(TWI, Compactable),
+    wither: witherDefault(TWI, Compactable)
+  };
+}
+var reduce = reduce$1;
+var foldMap = foldMap$1;
+var reduceRight = reduceRight$1;
+var getFoldable = function(O) {
+  return __assign(__assign({}, getFoldable$1(O)), { URI });
+};
+var reduceWithIndex = reduceWithIndex$1;
+var foldMapWithIndex = foldMapWithIndex$1;
+var reduceRightWithIndex = reduceRightWithIndex$1;
+var getFoldableWithIndex = function(O) {
+  return __assign(__assign({}, getFoldableWithIndex$1(O)), { URI });
+};
+var getTraversableWithIndex = function(O) {
+  var FWI = getFoldableWithIndex(O);
+  var keysO = keys(O);
+  var traverseWithIndex = function(F) {
+    return function(ta, f) {
+      var fm = F.of(/* @__PURE__ */ new Map());
+      var ks = keysO(ta);
+      var len = ks.length;
+      var _loop_1 = function(i2) {
+        var key = ks[i2];
+        var a = ta.get(key);
+        fm = F.ap(F.map(fm, function(m) {
+          return function(b) {
+            return m.set(key, b);
+          };
+        }), f(key, a));
+      };
+      for (var i = 0; i < len; i++) {
+        _loop_1(i);
+      }
+      return fm;
+    };
+  };
+  var traverse = function(F) {
+    var traverseWithIndexF = traverseWithIndex(F);
+    return function(ta, f) {
+      return traverseWithIndexF(ta, function(_, a) {
+        return f(a);
+      });
+    };
+  };
+  var sequence = function(F) {
+    var traverseWithIndexF = traverseWithIndex(F);
+    return function(ta) {
+      return traverseWithIndexF(ta, function(_, a) {
+        return a;
+      });
+    };
+  };
+  return {
+    URI,
+    _E: void 0,
+    map: _map,
+    mapWithIndex: _mapWithIndex,
+    reduce: FWI.reduce,
+    foldMap: FWI.foldMap,
+    reduceRight: FWI.reduceRight,
+    reduceWithIndex: FWI.reduceWithIndex,
+    foldMapWithIndex: FWI.foldMapWithIndex,
+    reduceRightWithIndex: FWI.reduceRightWithIndex,
+    traverse,
+    sequence,
+    traverseWithIndex
+  };
+};
+var Functor = {
+  URI,
+  map: _map
+};
+var flap = /* @__PURE__ */ flap$1(Functor);
+var Compactable = {
+  URI,
+  compact,
+  separate
+};
+var Filterable = {
+  URI,
+  map: _map,
+  compact,
+  separate,
+  filter: _filter,
+  filterMap: _filterMap,
+  partition: _partition,
+  partitionMap: _partitionMap
+};
+var copy = function(m) {
+  return new Map(m);
+};
+var union = function(E, M) {
+  var unionEM = union$1(E, M);
+  return function(second) {
+    return function(first) {
+      if (isEmpty(first)) {
+        return copy(second);
+      }
+      if (isEmpty(second)) {
+        return copy(first);
+      }
+      return unionEM(second)(first);
+    };
+  };
+};
+var intersection = function(E, M) {
+  var intersectionEM = intersection$1(E, M);
+  return function(second) {
+    return function(first) {
+      if (isEmpty(first) || isEmpty(second)) {
+        return /* @__PURE__ */ new Map();
+      }
+      return intersectionEM(second)(first);
+    };
+  };
+};
+var difference = function(E) {
+  var differenceE = difference$1(E);
+  return function(second) {
+    return function(first) {
+      if (isEmpty(first)) {
+        return copy(second);
+      }
+      if (isEmpty(second)) {
+        return copy(first);
+      }
+      return differenceE(second)(first);
+    };
+  };
+};
+var empty = /* @__PURE__ */ new Map();
+var insertAt = upsertAt;
+var map_ = Filterable;
+export {
+  Compactable,
+  Filterable,
+  Functor,
+  URI,
+  collect,
+  compact,
+  deleteAt,
+  difference,
+  elem,
+  empty,
+  filter,
+  filterMap,
+  filterMapWithIndex,
+  filterWithIndex,
+  flap,
+  foldMap,
+  foldMapWithIndex,
+  fromFoldable,
+  getDifferenceMagma,
+  getEq,
+  getFilterableWithIndex,
+  getFoldable,
+  getFoldableWithIndex,
+  getIntersectionSemigroup,
+  getMonoid,
+  getShow,
+  getTraversableWithIndex,
+  getUnionMonoid,
+  getUnionSemigroup,
+  getWitherable,
+  insertAt,
+  intersection,
+  isEmpty,
+  isSubmap,
+  keys,
+  lookup,
+  lookupWithKey,
+  map,
+  mapWithIndex,
+  map_,
+  member,
+  modifyAt,
+  partition,
+  partitionMap,
+  partitionMapWithIndex,
+  partitionWithIndex,
+  pop,
+  reduce,
+  reduceRight,
+  reduceRightWithIndex,
+  reduceWithIndex,
+  separate,
+  singleton,
+  size,
+  toArray,
+  toUnfoldable,
+  union,
+  updateAt,
+  upsertAt,
+  values
+};
+//# sourceMappingURL=Map.js.map

package/dist/_node_modules/fp-ts/es6/Map.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"Map.js","sources":["../../../../../../node_modules/fp-ts/es6/Map.js"],"sourcesContent":["var __assign = (this && this.__assign) || function () {\n    __assign = Object.assign || function(t) {\n        for (var s, i = 1, n = arguments.length; i < n; i++) {\n            s = arguments[i];\n            for (var p in s) if (Object.prototype.hasOwnProperty.call(s, p))\n                t[p] = s[p];\n        }\n        return t;\n    };\n    return __assign.apply(this, arguments);\n};\nimport { pipe } from './function';\nimport { flap as flap_ } from './Functor';\nimport * as _ from './internal';\nimport * as O from './Option';\nimport * as RM from './ReadonlyMap';\nimport { separated } from './Separated';\nimport { wiltDefault, witherDefault } from './Witherable';\n/**\n * @category instances\n * @since 2.0.0\n */\nexport var getShow = RM.getShow;\n/**\n * Calculate the number of key/value pairs in a map\n *\n * @since 2.0.0\n */\nexport var size = RM.size;\n/**\n * Test whether or not a map is empty\n *\n * @since 2.0.0\n */\nexport var isEmpty = RM.isEmpty;\n// TODO: remove non-curried overloading in v3\n/**\n * Test whether or not a key exists in a map\n *\n * @since 2.0.0\n */\nexport var member = RM.member;\n// TODO: remove non-curried overloading in v3\n/**\n * Test whether or not a value is a member of a map\n *\n * @since 2.0.0\n */\nexport var elem = RM.elem;\n/**\n * Get a sorted `Array` of the keys contained in a `Map`.\n *\n * @since 2.0.0\n */\nexport var keys = function (O) {\n    return function (m) {\n        return Array.from(m.keys()).sort(O.compare);\n    };\n};\n/**\n * Get a sorted `Array` of the values contained in a `Map`.\n *\n * @since 2.0.0\n */\nexport var values = function (O) {\n    return function (m) {\n        return Array.from(m.values()).sort(O.compare);\n    };\n};\n/**\n * @since 2.0.0\n */\nexport function collect(O) {\n    var keysO = keys(O);\n    return function (f) {\n        return function (m) {\n            var out = [];\n            var ks = keysO(m);\n            for (var _i = 0, ks_1 = ks; _i < ks_1.length; _i++) {\n                var key = ks_1[_i];\n                out.push(f(key, m.get(key)));\n            }\n            return out;\n        };\n    };\n}\n/**\n * Get a sorted `Array` of the key/value pairs contained in a `Map`.\n *\n * @since 2.0.0\n */\nexport function toArray(O) {\n    return collect(O)(function (k, a) { return [k, a]; });\n}\nexport function toUnfoldable(ord, U) {\n    var toArrayO = toArray(ord);\n    return function (d) {\n        var kas = toArrayO(d);\n        var len = kas.length;\n        return U.unfold(0, function (b) { return (b < len ? _.some([kas[b], b + 1]) : _.none); });\n    };\n}\n/**\n * Insert or replace a key/value pair in a `Map`.\n *\n * @since 2.0.0\n */\nexport var upsertAt = function (E) {\n    var lookupWithKeyE = lookupWithKey(E);\n    return function (k, a) {\n        var lookupWithKeyEk = lookupWithKeyE(k);\n        return function (m) {\n            var found = lookupWithKeyEk(m);\n            if (_.isNone(found)) {\n                var out = new Map(m);\n                out.set(k, a);\n                return out;\n            }\n            else if (found.value[1] !== a) {\n                var out = new Map(m);\n                out.set(found.value[0], a);\n                return out;\n            }\n            return m;\n        };\n    };\n};\n/**\n * Delete a key and value from a map\n *\n * @since 2.0.0\n */\nexport var deleteAt = function (E) {\n    var lookupWithKeyE = lookupWithKey(E);\n    return function (k) { return function (m) {\n        var found = lookupWithKeyE(k, m);\n        if (_.isSome(found)) {\n            var r = new Map(m);\n            r.delete(found.value[0]);\n            return r;\n        }\n        return m;\n    }; };\n};\n/**\n * @since 2.0.0\n */\nexport var updateAt = function (E) {\n    var modifyAtE = modifyAt(E);\n    return function (k, a) { return modifyAtE(k, function () { return a; }); };\n};\n/**\n * @since 2.0.0\n */\nexport var modifyAt = function (E) {\n    var lookupWithKeyE = lookupWithKey(E);\n    return function (k, f) { return function (m) {\n        var found = lookupWithKeyE(k, m);\n        if (_.isNone(found)) {\n            return _.none;\n        }\n        var r = new Map(m);\n        r.set(found.value[0], f(found.value[1]));\n        return _.some(r);\n    }; };\n};\n/**\n * Delete a key and value from a map, returning the value as well as the subsequent map\n *\n * @since 2.0.0\n */\nexport function pop(E) {\n    var lookupE = lookup(E);\n    var deleteAtE = deleteAt(E);\n    return function (k) {\n        var deleteAtEk = deleteAtE(k);\n        return function (m) {\n            return pipe(lookupE(k, m), O.map(function (a) { return [a, deleteAtEk(m)]; }));\n        };\n    };\n}\nexport function lookupWithKey(E) {\n    return function (k, m) {\n        if (m === undefined) {\n            var lookupWithKeyE_1 = lookupWithKey(E);\n            return function (m) { return lookupWithKeyE_1(k, m); };\n        }\n        var entries = m.entries();\n        var e;\n        while (!(e = entries.next()).done) {\n            var _a = e.value, ka = _a[0], a = _a[1];\n            if (E.equals(ka, k)) {\n                return _.some([ka, a]);\n            }\n        }\n        return _.none;\n    };\n}\n// TODO: remove non-curried overloading in v3\n/**\n * Lookup the value for a key in a `Map`.\n *\n * @since 2.0.0\n */\nexport var lookup = RM.lookup;\n// TODO: remove non-curried overloading in v3\n/**\n * Test whether or not one `Map` contains all of the keys and values contained in another `Map`\n *\n * @since 2.0.0\n */\nexport var isSubmap = RM.isSubmap;\n/**\n * @category instances\n * @since 2.0.0\n */\nexport var getEq = RM.getEq;\n/**\n * Gets `Monoid` instance for Maps given `Semigroup` instance for their values\n *\n * @category instances\n * @since 2.0.0\n */\nexport function getMonoid(SK, SA) {\n    var lookupWithKeyS = lookupWithKey(SK);\n    return {\n        concat: function (mx, my) {\n            if (isEmpty(mx)) {\n                return my;\n            }\n            if (isEmpty(my)) {\n                return mx;\n            }\n            var r = new Map(mx);\n            var entries = my.entries();\n            var e;\n            while (!(e = entries.next()).done) {\n                var _a = e.value, k = _a[0], a = _a[1];\n                var mxOptA = lookupWithKeyS(k, mx);\n                if (_.isSome(mxOptA)) {\n                    r.set(mxOptA.value[0], SA.concat(mxOptA.value[1], a));\n                }\n                else {\n                    r.set(k, a);\n                }\n            }\n            return r;\n        },\n        empty: new Map()\n    };\n}\n/**\n * Create a map with one key/value pair\n *\n * @since 2.0.0\n */\nexport var singleton = function (k, a) { return new Map([[k, a]]); };\nexport function fromFoldable(E, M, F) {\n    return function (fka) {\n        var lookupWithKeyE = lookupWithKey(E);\n        return F.reduce(fka, new Map(), function (b, _a) {\n            var k = _a[0], a = _a[1];\n            var bOpt = lookupWithKeyE(k, b);\n            if (_.isSome(bOpt)) {\n                b.set(bOpt.value[0], M.concat(bOpt.value[1], a));\n            }\n            else {\n                b.set(k, a);\n            }\n            return b;\n        });\n    };\n}\nvar _mapWithIndex = function (fa, f) {\n    var m = new Map();\n    var entries = fa.entries();\n    var e;\n    while (!(e = entries.next()).done) {\n        var _a = e.value, key = _a[0], a = _a[1];\n        m.set(key, f(key, a));\n    }\n    return m;\n};\n/**\n * @since 2.10.0\n */\nexport var partitionMapWithIndex = function (f) {\n    return function (fa) {\n        var left = new Map();\n        var right = new Map();\n        var entries = fa.entries();\n        var e;\n        while (!(e = entries.next()).done) {\n            var _a = e.value, k = _a[0], a = _a[1];\n            var ei = f(k, a);\n            if (_.isLeft(ei)) {\n                left.set(k, ei.left);\n            }\n            else {\n                right.set(k, ei.right);\n            }\n        }\n        return separated(left, right);\n    };\n};\nexport function partitionWithIndex(predicateWithIndex) {\n    return function (fa) {\n        var left = new Map();\n        var right = new Map();\n        var entries = fa.entries();\n        var e;\n        while (!(e = entries.next()).done) {\n            var _a = e.value, k = _a[0], a = _a[1];\n            if (predicateWithIndex(k, a)) {\n                right.set(k, a);\n            }\n            else {\n                left.set(k, a);\n            }\n        }\n        return separated(left, right);\n    };\n}\n/**\n * @since 2.10.0\n */\nexport var filterMapWithIndex = function (f) {\n    return function (fa) {\n        var m = new Map();\n        var entries = fa.entries();\n        var e;\n        while (!(e = entries.next()).done) {\n            var _a = e.value, k = _a[0], a = _a[1];\n            var o = f(k, a);\n            if (_.isSome(o)) {\n                m.set(k, o.value);\n            }\n        }\n        return m;\n    };\n};\nexport function filterWithIndex(p) {\n    return function (m) {\n        var out = new Map();\n        var entries = m.entries();\n        var e;\n        while (!(e = entries.next()).done) {\n            var _a = e.value, k = _a[0], a = _a[1];\n            if (p(k, a)) {\n                out.set(k, a);\n            }\n        }\n        return out;\n    };\n}\nvar _map = function (fa, f) { return _mapWithIndex(fa, function (_, a) { return f(a); }); };\nvar _filter = function (fa, p) {\n    return _filterWithIndex(fa, function (_, a) { return p(a); });\n};\nvar _filterMap = function (fa, f) { return _filterMapWithIndex(fa, function (_, a) { return f(a); }); };\nvar _partition = function (fa, predicate) {\n    return _partitionWithIndex(fa, function (_, a) { return predicate(a); });\n};\nvar _partitionMap = function (fa, f) { return _partitionMapWithIndex(fa, function (_, a) { return f(a); }); };\nvar _filterWithIndex = function (fa, p) { return pipe(fa, filterWithIndex(p)); };\nvar _filterMapWithIndex = function (fa, f) { return pipe(fa, filterMapWithIndex(f)); };\nvar _partitionWithIndex = function (fa, p) { return pipe(fa, partitionWithIndex(p)); };\nvar _partitionMapWithIndex = function (fa, f) {\n    return pipe(fa, partitionMapWithIndex(f));\n};\n/**\n * @category filtering\n * @since 2.0.0\n */\nexport var compact = function (fa) {\n    var m = new Map();\n    var entries = fa.entries();\n    var e;\n    while (!(e = entries.next()).done) {\n        var _a = e.value, k = _a[0], oa = _a[1];\n        if (_.isSome(oa)) {\n            m.set(k, oa.value);\n        }\n    }\n    return m;\n};\n/**\n * @category filtering\n * @since 2.0.0\n */\nexport var filter = function (predicate) {\n    return function (fa) {\n        return _filter(fa, predicate);\n    };\n};\n/**\n * @category filtering\n * @since 2.0.0\n */\nexport var filterMap = function (f) { return function (fa) {\n    return _filterMap(fa, f);\n}; };\n/**\n * `map` can be used to turn functions `(a: A) => B` into functions `(fa: F<A>) => F<B>` whose argument and return types\n * use the type constructor `F` to represent some computational context.\n *\n * @category mapping\n * @since 2.0.0\n */\nexport var map = function (f) { return function (fa) { return _map(fa, f); }; };\n/**\n * @category mapping\n * @since 2.7.1\n */\nexport var mapWithIndex = function (f) { return function (fa) {\n    return _mapWithIndex(fa, f);\n}; };\n/**\n * @category filtering\n * @since 2.0.0\n */\nexport var partition = function (predicate) {\n    return function (fa) {\n        return _partition(fa, predicate);\n    };\n};\n/**\n * @category filtering\n * @since 2.0.0\n */\nexport var partitionMap = function (f) { return function (fa) { return _partitionMap(fa, f); }; };\n/**\n * @category filtering\n * @since 2.0.0\n */\nexport var separate = function (fa) {\n    var left = new Map();\n    var right = new Map();\n    var entries = fa.entries();\n    var e;\n    while (!(e = entries.next()).done) {\n        var _a = e.value, k = _a[0], ei = _a[1];\n        if (_.isLeft(ei)) {\n            left.set(k, ei.left);\n        }\n        else {\n            right.set(k, ei.right);\n        }\n    }\n    return separated(left, right);\n};\n/**\n * @category type lambdas\n * @since 2.0.0\n */\nexport var URI = 'Map';\n/**\n * @category instances\n * @since 2.11.0\n */\nexport var getUnionSemigroup = function (E, S) {\n    var unionES = union(E, S);\n    return {\n        concat: function (first, second) { return unionES(second)(first); }\n    };\n};\n/**\n * @category instances\n * @since 2.11.0\n */\nexport var getUnionMonoid = function (E, S) { return ({\n    concat: getUnionSemigroup(E, S).concat,\n    empty: new Map()\n}); };\n/**\n * @category instances\n * @since 2.11.0\n */\nexport var getIntersectionSemigroup = function (E, S) {\n    var intersectionES = intersection(E, S);\n    return {\n        concat: function (first, second) { return intersectionES(second)(first); }\n    };\n};\n/**\n * @category instances\n * @since 2.11.0\n */\nexport var getDifferenceMagma = function (E) {\n    return function () {\n        var differenceE = difference(E);\n        return {\n            concat: function (first, second) { return differenceE(second)(first); }\n        };\n    };\n};\n/**\n * @category filtering\n * @since 2.0.0\n */\nexport function getFilterableWithIndex() {\n    return {\n        URI: URI,\n        _E: undefined,\n        map: _map,\n        mapWithIndex: _mapWithIndex,\n        compact: compact,\n        separate: separate,\n        filter: _filter,\n        filterMap: _filterMap,\n        partition: _partition,\n        partitionMap: _partitionMap,\n        partitionMapWithIndex: _partitionMapWithIndex,\n        partitionWithIndex: _partitionWithIndex,\n        filterMapWithIndex: _filterMapWithIndex,\n        filterWithIndex: _filterWithIndex\n    };\n}\n/**\n * @category filtering\n * @since 2.0.0\n */\nexport function getWitherable(O) {\n    var TWI = getTraversableWithIndex(O);\n    return {\n        URI: URI,\n        _E: undefined,\n        map: _map,\n        compact: compact,\n        separate: separate,\n        filter: _filter,\n        filterMap: _filterMap,\n        partition: _partition,\n        partitionMap: _partitionMap,\n        reduce: TWI.reduce,\n        foldMap: TWI.foldMap,\n        reduceRight: TWI.reduceRight,\n        traverse: TWI.traverse,\n        sequence: TWI.sequence,\n        mapWithIndex: _mapWithIndex,\n        reduceWithIndex: TWI.reduceWithIndex,\n        foldMapWithIndex: TWI.foldMapWithIndex,\n        reduceRightWithIndex: TWI.reduceRightWithIndex,\n        traverseWithIndex: TWI.traverseWithIndex,\n        wilt: wiltDefault(TWI, Compactable),\n        wither: witherDefault(TWI, Compactable)\n    };\n}\n/**\n * @category folding\n * @since 2.11.0\n */\nexport var reduce = RM.reduce;\n/**\n * @category folding\n * @since 2.11.0\n */\nexport var foldMap = RM.foldMap;\n/**\n * @category folding\n * @since 2.11.0\n */\nexport var reduceRight = RM.reduceRight;\n/**\n * @category folding\n * @since 2.11.0\n */\nexport var getFoldable = function (O) {\n    return __assign(__assign({}, RM.getFoldable(O)), { URI: URI });\n};\n/**\n * @category folding\n * @since 2.11.0\n */\nexport var reduceWithIndex = RM.reduceWithIndex;\n/**\n * @category folding\n * @since 2.11.0\n */\nexport var foldMapWithIndex = RM.foldMapWithIndex;\n/**\n * @category folding\n * @since 2.11.0\n */\nexport var reduceRightWithIndex = RM.reduceRightWithIndex;\n/**\n * @category folding\n * @since 2.10.0\n */\nexport var getFoldableWithIndex = function (O) {\n    return __assign(__assign({}, RM.getFoldableWithIndex(O)), { URI: URI });\n};\n/**\n * @category traversing\n * @since 2.10.0\n */\nexport var getTraversableWithIndex = function (O) {\n    var FWI = getFoldableWithIndex(O);\n    var keysO = keys(O);\n    var traverseWithIndex = function (F) {\n        return function (ta, f) {\n            var fm = F.of(new Map());\n            var ks = keysO(ta);\n            var len = ks.length;\n            var _loop_1 = function (i) {\n                var key = ks[i];\n                var a = ta.get(key);\n                fm = F.ap(F.map(fm, function (m) { return function (b) { return m.set(key, b); }; }), f(key, a));\n            };\n            for (var i = 0; i < len; i++) {\n                _loop_1(i);\n            }\n            return fm;\n        };\n    };\n    var traverse = function (F) {\n        var traverseWithIndexF = traverseWithIndex(F);\n        return function (ta, f) { return traverseWithIndexF(ta, function (_, a) { return f(a); }); };\n    };\n    var sequence = function (F) {\n        var traverseWithIndexF = traverseWithIndex(F);\n        return function (ta) { return traverseWithIndexF(ta, function (_, a) { return a; }); };\n    };\n    return {\n        URI: URI,\n        _E: undefined,\n        map: _map,\n        mapWithIndex: _mapWithIndex,\n        reduce: FWI.reduce,\n        foldMap: FWI.foldMap,\n        reduceRight: FWI.reduceRight,\n        reduceWithIndex: FWI.reduceWithIndex,\n        foldMapWithIndex: FWI.foldMapWithIndex,\n        reduceRightWithIndex: FWI.reduceRightWithIndex,\n        traverse: traverse,\n        sequence: sequence,\n        traverseWithIndex: traverseWithIndex\n    };\n};\n/**\n * @category instances\n * @since 2.7.0\n */\nexport var Functor = {\n    URI: URI,\n    map: _map\n};\n/**\n * @category mapping\n * @since 2.10.0\n */\nexport var flap = /*#__PURE__*/ flap_(Functor);\n/**\n * @category instances\n * @since 2.7.0\n */\nexport var Compactable = {\n    URI: URI,\n    compact: compact,\n    separate: separate\n};\n/**\n * @category instances\n * @since 2.7.0\n */\nexport var Filterable = {\n    URI: URI,\n    map: _map,\n    compact: compact,\n    separate: separate,\n    filter: _filter,\n    filterMap: _filterMap,\n    partition: _partition,\n    partitionMap: _partitionMap\n};\n// -------------------------------------------------------------------------------------\n// utils\n// -------------------------------------------------------------------------------------\nvar copy = function (m) { return new Map(m); };\n/**\n * @since 2.11.0\n */\nexport var union = function (E, M) {\n    var unionEM = RM.union(E, M);\n    return function (second) { return function (first) {\n        if (isEmpty(first)) {\n            return copy(second);\n        }\n        if (isEmpty(second)) {\n            return copy(first);\n        }\n        return unionEM(second)(first);\n    }; };\n};\n/**\n * @since 2.11.0\n */\nexport var intersection = function (E, M) {\n    var intersectionEM = RM.intersection(E, M);\n    return function (second) { return function (first) {\n        if (isEmpty(first) || isEmpty(second)) {\n            return new Map();\n        }\n        return intersectionEM(second)(first);\n    }; };\n};\n/**\n * @since 2.11.0\n */\nexport var difference = function (E) {\n    var differenceE = RM.difference(E);\n    return function (second) {\n        return function (first) {\n            if (isEmpty(first)) {\n                return copy(second);\n            }\n            if (isEmpty(second)) {\n                return copy(first);\n            }\n            return differenceE(second)(first);\n        };\n    };\n};\n// -------------------------------------------------------------------------------------\n// deprecated\n// -------------------------------------------------------------------------------------\n/**\n * Use a `new Map()` instead.\n *\n * @category zone of death\n * @since 2.0.0\n * @deprecated\n */\nexport var empty = new Map();\n/**\n * Use [`upsertAt`](#upsertat) instead.\n *\n * @category zone of death\n * @since 2.0.0\n * @deprecated\n */\nexport var insertAt = upsertAt;\n/**\n * Use [`Filterable`](#filterable) instead.\n *\n * @category zone of death\n * @since 2.0.0\n * @deprecated\n */\nexport var map_ = Filterable;\n"],"names":["this","RM.getShow","RM.size","RM.isEmpty","RM.member","RM.elem","_.some","_.none","_.isNone","_.isSome","O.map","m","RM.lookup","RM.isSubmap","RM.getEq","_.isLeft","RM.reduce","RM.foldMap","RM.reduceRight","RM.getFoldable","RM.reduceWithIndex","RM.foldMapWithIndex","RM.reduceRightWithIndex","RM.getFoldableWithIndex","i","flap_","RM.union","RM.intersection","RM.difference"],"mappings":";;;;;;;AAAA,IAAI,WAAYA,cAAQA,WAAK,YAAa,WAAY;AAClD,aAAW,OAAO,UAAU,SAAS,GAAG;AACpC,aAAS,GAAG,IAAI,GAAG,IAAI,UAAU,QAAQ,IAAI,GAAG,KAAK;AACjD,UAAI,UAAU,CAAC;AACf,eAAS,KAAK;AAAG,YAAI,OAAO,UAAU,eAAe,KAAK,GAAG,CAAC;AAC1D,YAAE,CAAC,IAAI,EAAE,CAAC;AAAA,IACjB;AACD,WAAO;AAAA,EACf;AACI,SAAO,SAAS,MAAM,MAAM,SAAS;AACzC;AAYU,IAAC,UAAUC;AAMX,IAAC,OAAOC;AAMR,IAAC,UAAUC;AAOX,IAAC,SAASC;AAOV,IAAC,OAAOC;AAMR,IAAC,OAAO,SAAU,GAAG;AAC3B,SAAO,SAAU,GAAG;AAChB,WAAO,MAAM,KAAK,EAAE,KAAM,CAAA,EAAE,KAAK,EAAE,OAAO;AAAA,EAClD;AACA;AAMU,IAAC,SAAS,SAAU,GAAG;AAC7B,SAAO,SAAU,GAAG;AAChB,WAAO,MAAM,KAAK,EAAE,OAAQ,CAAA,EAAE,KAAK,EAAE,OAAO;AAAA,EACpD;AACA;AAIO,SAAS,QAAQ,GAAG;AACvB,MAAI,QAAQ,KAAK,CAAC;AAClB,SAAO,SAAU,GAAG;AAChB,WAAO,SAAU,GAAG;AAChB,UAAI,MAAM,CAAA;AACV,UAAI,KAAK,MAAM,CAAC;AAChB,eAAS,KAAK,GAAG,OAAO,IAAI,KAAK,KAAK,QAAQ,MAAM;AAChD,YAAI,MAAM,KAAK,EAAE;AACjB,YAAI,KAAK,EAAE,KAAK,EAAE,IAAI,GAAG,CAAC,CAAC;AAAA,MAC9B;AACD,aAAO;AAAA,IACnB;AAAA,EACA;AACA;AAMO,SAAS,QAAQ,GAAG;AACvB,SAAO,QAAQ,CAAC,EAAE,SAAU,GAAG,GAAG;AAAE,WAAO,CAAC,GAAG,CAAC;AAAA,EAAI,CAAA;AACxD;AACO,SAAS,aAAa,KAAK,GAAG;AACjC,MAAI,WAAW,QAAQ,GAAG;AAC1B,SAAO,SAAU,GAAG;AAChB,QAAI,MAAM,SAAS,CAAC;AACpB,QAAI,MAAM,IAAI;AACd,WAAO,EAAE,OAAO,GAAG,SAAU,GAAG;AAAE,aAAQ,IAAI,MAAMC,KAAO,CAAC,IAAI,CAAC,GAAG,IAAI,CAAC,CAAC,IAAIC;AAAAA,IAAQ,CAAE;AAAA,EAChG;AACA;AAMU,IAAC,WAAW,SAAU,GAAG;AAC/B,MAAI,iBAAiB,cAAc,CAAC;AACpC,SAAO,SAAU,GAAG,GAAG;AACnB,QAAI,kBAAkB,eAAe,CAAC;AACtC,WAAO,SAAU,GAAG;AAChB,UAAI,QAAQ,gBAAgB,CAAC;AAC7B,UAAIC,OAAS,KAAK,GAAG;AACjB,YAAI,MAAM,IAAI,IAAI,CAAC;AACnB,YAAI,IAAI,GAAG,CAAC;AACZ,eAAO;AAAA,MACV,WACQ,MAAM,MAAM,CAAC,MAAM,GAAG;AAC3B,YAAI,MAAM,IAAI,IAAI,CAAC;AACnB,YAAI,IAAI,MAAM,MAAM,CAAC,GAAG,CAAC;AACzB,eAAO;AAAA,MACV;AACD,aAAO;AAAA,IACnB;AAAA,EACA;AACA;AAMU,IAAC,WAAW,SAAU,GAAG;AAC/B,MAAI,iBAAiB,cAAc,CAAC;AACpC,SAAO,SAAU,GAAG;AAAE,WAAO,SAAU,GAAG;AACtC,UAAI,QAAQ,eAAe,GAAG,CAAC;AAC/B,UAAIC,OAAS,KAAK,GAAG;AACjB,YAAI,IAAI,IAAI,IAAI,CAAC;AACjB,UAAE,OAAO,MAAM,MAAM,CAAC,CAAC;AACvB,eAAO;AAAA,MACV;AACD,aAAO;AAAA,IACV;AAAA;AACL;AAIU,IAAC,WAAW,SAAU,GAAG;AAC/B,MAAI,YAAY,SAAS,CAAC;AAC1B,SAAO,SAAU,GAAG,GAAG;AAAE,WAAO,UAAU,GAAG,WAAY;AAAE,aAAO;AAAA,IAAI,CAAA;AAAA,EAAE;AAC5E;AAIU,IAAC,WAAW,SAAU,GAAG;AAC/B,MAAI,iBAAiB,cAAc,CAAC;AACpC,SAAO,SAAU,GAAG,GAAG;AAAE,WAAO,SAAU,GAAG;AACzC,UAAI,QAAQ,eAAe,GAAG,CAAC;AAC/B,UAAID,OAAS,KAAK,GAAG;AACjB,eAAOD;AAAAA,MACV;AACD,UAAI,IAAI,IAAI,IAAI,CAAC;AACjB,QAAE,IAAI,MAAM,MAAM,CAAC,GAAG,EAAE,MAAM,MAAM,CAAC,CAAC,CAAC;AACvC,aAAOD,KAAO,CAAC;AAAA,IAClB;AAAA;AACL;AAMO,SAAS,IAAI,GAAG;AACnB,MAAI,UAAU,OAAO,CAAC;AACtB,MAAI,YAAY,SAAS,CAAC;AAC1B,SAAO,SAAU,GAAG;AAChB,QAAI,aAAa,UAAU,CAAC;AAC5B,WAAO,SAAU,GAAG;AAChB,aAAO,KAAK,QAAQ,GAAG,CAAC,GAAGI,MAAM,SAAU,GAAG;AAAE,eAAO,CAAC,GAAG,WAAW,CAAC,CAAC;AAAA,MAAI,CAAA,CAAC;AAAA,IACzF;AAAA,EACA;AACA;AACO,SAAS,cAAc,GAAG;AAC7B,SAAO,SAAU,GAAG,GAAG;AACnB,QAAI,MAAM,QAAW;AACjB,UAAI,mBAAmB,cAAc,CAAC;AACtC,aAAO,SAAUC,IAAG;AAAE,eAAO,iBAAiB,GAAGA,EAAC;AAAA;IACrD;AACD,QAAI,UAAU,EAAE;AAChB,QAAI;AACJ,WAAO,EAAE,IAAI,QAAQ,KAAI,GAAI,MAAM;AAC/B,UAAI,KAAK,EAAE,OAAO,KAAK,GAAG,CAAC,GAAG,IAAI,GAAG,CAAC;AACtC,UAAI,EAAE,OAAO,IAAI,CAAC,GAAG;AACjB,eAAOL,KAAO,CAAC,IAAI,CAAC,CAAC;AAAA,MACxB;AAAA,IACJ;AACD,WAAOC;AAAAA,EACf;AACA;AAOU,IAAC,SAASK;AAOV,IAAC,WAAWC;AAKZ,IAAC,QAAQC;AAOZ,SAAS,UAAU,IAAI,IAAI;AAC9B,MAAI,iBAAiB,cAAc,EAAE;AACrC,SAAO;AAAA,IACH,QAAQ,SAAU,IAAI,IAAI;AACtB,UAAI,QAAQ,EAAE,GAAG;AACb,eAAO;AAAA,MACV;AACD,UAAI,QAAQ,EAAE,GAAG;AACb,eAAO;AAAA,MACV;AACD,UAAI,IAAI,IAAI,IAAI,EAAE;AAClB,UAAI,UAAU,GAAG;AACjB,UAAI;AACJ,aAAO,EAAE,IAAI,QAAQ,KAAI,GAAI,MAAM;AAC/B,YAAI,KAAK,EAAE,OAAO,IAAI,GAAG,CAAC,GAAG,IAAI,GAAG,CAAC;AACrC,YAAI,SAAS,eAAe,GAAG,EAAE;AACjC,YAAIL,OAAS,MAAM,GAAG;AAClB,YAAE,IAAI,OAAO,MAAM,CAAC,GAAG,GAAG,OAAO,OAAO,MAAM,CAAC,GAAG,CAAC,CAAC;AAAA,QACvD,OACI;AACD,YAAE,IAAI,GAAG,CAAC;AAAA,QACb;AAAA,MACJ;AACD,aAAO;AAAA,IACV;AAAA,IACD,OAAO,oBAAI,IAAK;AAAA,EACxB;AACA;AAMU,IAAC,YAAY,SAAU,GAAG,GAAG;AAAE,SAAO,oBAAI,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;AAAK;AAC9D,SAAS,aAAa,GAAG,GAAG,GAAG;AAClC,SAAO,SAAU,KAAK;AAClB,QAAI,iBAAiB,cAAc,CAAC;AACpC,WAAO,EAAE,OAAO,KAAK,oBAAI,OAAO,SAAU,GAAG,IAAI;AAC7C,UAAI,IAAI,GAAG,CAAC,GAAG,IAAI,GAAG,CAAC;AACvB,UAAI,OAAO,eAAe,GAAG,CAAC;AAC9B,UAAIA,OAAS,IAAI,GAAG;AAChB,UAAE,IAAI,KAAK,MAAM,CAAC,GAAG,EAAE,OAAO,KAAK,MAAM,CAAC,GAAG,CAAC,CAAC;AAAA,MAClD,OACI;AACD,UAAE,IAAI,GAAG,CAAC;AAAA,MACb;AACD,aAAO;AAAA,IACnB,CAAS;AAAA,EACT;AACA;AACA,IAAI,gBAAgB,SAAU,IAAI,GAAG;AACjC,MAAI,IAAI,oBAAI;AACZ,MAAI,UAAU,GAAG;AACjB,MAAI;AACJ,SAAO,EAAE,IAAI,QAAQ,KAAI,GAAI,MAAM;AAC/B,QAAI,KAAK,EAAE,OAAO,MAAM,GAAG,CAAC,GAAG,IAAI,GAAG,CAAC;AACvC,MAAE,IAAI,KAAK,EAAE,KAAK,CAAC,CAAC;AAAA,EACvB;AACD,SAAO;AACX;AAIU,IAAC,wBAAwB,SAAU,GAAG;AAC5C,SAAO,SAAU,IAAI;AACjB,QAAI,OAAO,oBAAI;AACf,QAAI,QAAQ,oBAAI;AAChB,QAAI,UAAU,GAAG;AACjB,QAAI;AACJ,WAAO,EAAE,IAAI,QAAQ,KAAI,GAAI,MAAM;AAC/B,UAAI,KAAK,EAAE,OAAO,IAAI,GAAG,CAAC,GAAG,IAAI,GAAG,CAAC;AACrC,UAAI,KAAK,EAAE,GAAG,CAAC;AACf,UAAIM,OAAS,EAAE,GAAG;AACd,aAAK,IAAI,GAAG,GAAG,IAAI;AAAA,MACtB,OACI;AACD,cAAM,IAAI,GAAG,GAAG,KAAK;AAAA,MACxB;AAAA,IACJ;AACD,WAAO,UAAU,MAAM,KAAK;AAAA,EACpC;AACA;AACO,SAAS,mBAAmB,oBAAoB;AACnD,SAAO,SAAU,IAAI;AACjB,QAAI,OAAO,oBAAI;AACf,QAAI,QAAQ,oBAAI;AAChB,QAAI,UAAU,GAAG;AACjB,QAAI;AACJ,WAAO,EAAE,IAAI,QAAQ,KAAI,GAAI,MAAM;AAC/B,UAAI,KAAK,EAAE,OAAO,IAAI,GAAG,CAAC,GAAG,IAAI,GAAG,CAAC;AACrC,UAAI,mBAAmB,GAAG,CAAC,GAAG;AAC1B,cAAM,IAAI,GAAG,CAAC;AAAA,MACjB,OACI;AACD,aAAK,IAAI,GAAG,CAAC;AAAA,MAChB;AAAA,IACJ;AACD,WAAO,UAAU,MAAM,KAAK;AAAA,EACpC;AACA;AAIU,IAAC,qBAAqB,SAAU,GAAG;AACzC,SAAO,SAAU,IAAI;AACjB,QAAI,IAAI,oBAAI;AACZ,QAAI,UAAU,GAAG;AACjB,QAAI;AACJ,WAAO,EAAE,IAAI,QAAQ,KAAI,GAAI,MAAM;AAC/B,UAAI,KAAK,EAAE,OAAO,IAAI,GAAG,CAAC,GAAG,IAAI,GAAG,CAAC;AACrC,UAAI,IAAI,EAAE,GAAG,CAAC;AACd,UAAIN,OAAS,CAAC,GAAG;AACb,UAAE,IAAI,GAAG,EAAE,KAAK;AAAA,MACnB;AAAA,IACJ;AACD,WAAO;AAAA,EACf;AACA;AACO,SAAS,gBAAgB,GAAG;AAC/B,SAAO,SAAU,GAAG;AAChB,QAAI,MAAM,oBAAI;AACd,QAAI,UAAU,EAAE;AAChB,QAAI;AACJ,WAAO,EAAE,IAAI,QAAQ,KAAI,GAAI,MAAM;AAC/B,UAAI,KAAK,EAAE,OAAO,IAAI,GAAG,CAAC,GAAG,IAAI,GAAG,CAAC;AACrC,UAAI,EAAE,GAAG,CAAC,GAAG;AACT,YAAI,IAAI,GAAG,CAAC;AAAA,MACf;AAAA,IACJ;AACD,WAAO;AAAA,EACf;AACA;AACA,IAAI,OAAO,SAAU,IAAI,GAAG;AAAE,SAAO,cAAc,IAAI,SAAU,GAAG,GAAG;AAAE,WAAO,EAAE,CAAC;AAAA,EAAE,CAAE;;AACvF,IAAI,UAAU,SAAU,IAAI,GAAG;AAC3B,SAAO,iBAAiB,IAAI,SAAU,GAAG,GAAG;AAAE,WAAO,EAAE,CAAC;AAAA,EAAE,CAAE;AAChE;AACA,IAAI,aAAa,SAAU,IAAI,GAAG;AAAE,SAAO,oBAAoB,IAAI,SAAU,GAAG,GAAG;AAAE,WAAO,EAAE,CAAC;AAAA,EAAE,CAAE;;AACnG,IAAI,aAAa,SAAU,IAAI,WAAW;AACtC,SAAO,oBAAoB,IAAI,SAAU,GAAG,GAAG;AAAE,WAAO,UAAU,CAAC;AAAA,EAAE,CAAE;AAC3E;AACA,IAAI,gBAAgB,SAAU,IAAI,GAAG;AAAE,SAAO,uBAAuB,IAAI,SAAU,GAAG,GAAG;AAAE,WAAO,EAAE,CAAC;AAAA,EAAE,CAAE;;AACzG,IAAI,mBAAmB,SAAU,IAAI,GAAG;AAAE,SAAO,KAAK,IAAI,gBAAgB,CAAC,CAAC;;AAC5E,IAAI,sBAAsB,SAAU,IAAI,GAAG;AAAE,SAAO,KAAK,IAAI,mBAAmB,CAAC,CAAC;;AAClF,IAAI,sBAAsB,SAAU,IAAI,GAAG;AAAE,SAAO,KAAK,IAAI,mBAAmB,CAAC,CAAC;;AAClF,IAAI,yBAAyB,SAAU,IAAI,GAAG;AAC1C,SAAO,KAAK,IAAI,sBAAsB,CAAC,CAAC;AAC5C;AAKU,IAAC,UAAU,SAAU,IAAI;AAC/B,MAAI,IAAI,oBAAI;AACZ,MAAI,UAAU,GAAG;AACjB,MAAI;AACJ,SAAO,EAAE,IAAI,QAAQ,KAAI,GAAI,MAAM;AAC/B,QAAI,KAAK,EAAE,OAAO,IAAI,GAAG,CAAC,GAAG,KAAK,GAAG,CAAC;AACtC,QAAIA,OAAS,EAAE,GAAG;AACd,QAAE,IAAI,GAAG,GAAG,KAAK;AAAA,IACpB;AAAA,EACJ;AACD,SAAO;AACX;AAKU,IAAC,SAAS,SAAU,WAAW;AACrC,SAAO,SAAU,IAAI;AACjB,WAAO,QAAQ,IAAI,SAAS;AAAA,EACpC;AACA;AAKU,IAAC,YAAY,SAAU,GAAG;AAAE,SAAO,SAAU,IAAI;AACvD,WAAO,WAAW,IAAI,CAAC;AAAA,EAC3B;AAAK;AAQK,IAAC,MAAM,SAAU,GAAG;AAAE,SAAO,SAAU,IAAI;AAAE,WAAO,KAAK,IAAI,CAAC;AAAA,EAAI;AAAI;AAKtE,IAAC,eAAe,SAAU,GAAG;AAAE,SAAO,SAAU,IAAI;AAC1D,WAAO,cAAc,IAAI,CAAC;AAAA,EAC9B;AAAK;AAKK,IAAC,YAAY,SAAU,WAAW;AACxC,SAAO,SAAU,IAAI;AACjB,WAAO,WAAW,IAAI,SAAS;AAAA,EACvC;AACA;AAKU,IAAC,eAAe,SAAU,GAAG;AAAE,SAAO,SAAU,IAAI;AAAE,WAAO,cAAc,IAAI,CAAC;AAAA,EAAI;AAAI;AAKxF,IAAC,WAAW,SAAU,IAAI;AAChC,MAAI,OAAO,oBAAI;AACf,MAAI,QAAQ,oBAAI;AAChB,MAAI,UAAU,GAAG;AACjB,MAAI;AACJ,SAAO,EAAE,IAAI,QAAQ,KAAI,GAAI,MAAM;AAC/B,QAAI,KAAK,EAAE,OAAO,IAAI,GAAG,CAAC,GAAG,KAAK,GAAG,CAAC;AACtC,QAAIM,OAAS,EAAE,GAAG;AACd,WAAK,IAAI,GAAG,GAAG,IAAI;AAAA,IACtB,OACI;AACD,YAAM,IAAI,GAAG,GAAG,KAAK;AAAA,IACxB;AAAA,EACJ;AACD,SAAO,UAAU,MAAM,KAAK;AAChC;AAKU,IAAC,MAAM;AAKP,IAAC,oBAAoB,SAAU,GAAG,GAAG;AAC3C,MAAI,UAAU,MAAM,GAAG,CAAC;AACxB,SAAO;AAAA,IACH,QAAQ,SAAU,OAAO,QAAQ;AAAE,aAAO,QAAQ,MAAM,EAAE,KAAK;AAAA,IAAI;AAAA,EAC3E;AACA;AAKU,IAAC,iBAAiB,SAAU,GAAG,GAAG;AAAE,SAAQ;AAAA,IAClD,QAAQ,kBAAkB,GAAG,CAAC,EAAE;AAAA,IAChC,OAAO,oBAAI,IAAK;AAAA,EACpB;AAAM;AAKI,IAAC,2BAA2B,SAAU,GAAG,GAAG;AAClD,MAAI,iBAAiB,aAAa,GAAG,CAAC;AACtC,SAAO;AAAA,IACH,QAAQ,SAAU,OAAO,QAAQ;AAAE,aAAO,eAAe,MAAM,EAAE,KAAK;AAAA,IAAI;AAAA,EAClF;AACA;AAKU,IAAC,qBAAqB,SAAU,GAAG;AACzC,SAAO,WAAY;AACf,QAAI,cAAc,WAAW,CAAC;AAC9B,WAAO;AAAA,MACH,QAAQ,SAAU,OAAO,QAAQ;AAAE,eAAO,YAAY,MAAM,EAAE,KAAK;AAAA,MAAI;AAAA,IACnF;AAAA,EACA;AACA;AAKO,SAAS,yBAAyB;AACrC,SAAO;AAAA,IACH;AAAA,IACA,IAAI;AAAA,IACJ,KAAK;AAAA,IACL,cAAc;AAAA,IACd;AAAA,IACA;AAAA,IACA,QAAQ;AAAA,IACR,WAAW;AAAA,IACX,WAAW;AAAA,IACX,cAAc;AAAA,IACd,uBAAuB;AAAA,IACvB,oBAAoB;AAAA,IACpB,oBAAoB;AAAA,IACpB,iBAAiB;AAAA,EACzB;AACA;AAKO,SAAS,cAAc,GAAG;AAC7B,MAAI,MAAM,wBAAwB,CAAC;AACnC,SAAO;AAAA,IACH;AAAA,IACA,IAAI;AAAA,IACJ,KAAK;AAAA,IACL;AAAA,IACA;AAAA,IACA,QAAQ;AAAA,IACR,WAAW;AAAA,IACX,WAAW;AAAA,IACX,cAAc;AAAA,IACd,QAAQ,IAAI;AAAA,IACZ,SAAS,IAAI;AAAA,IACb,aAAa,IAAI;AAAA,IACjB,UAAU,IAAI;AAAA,IACd,UAAU,IAAI;AAAA,IACd,cAAc;AAAA,IACd,iBAAiB,IAAI;AAAA,IACrB,kBAAkB,IAAI;AAAA,IACtB,sBAAsB,IAAI;AAAA,IAC1B,mBAAmB,IAAI;AAAA,IACvB,MAAM,YAAY,KAAK,WAAW;AAAA,IAClC,QAAQ,cAAc,KAAK,WAAW;AAAA,EAC9C;AACA;AAKU,IAAC,SAASC;AAKV,IAAC,UAAUC;AAKX,IAAC,cAAcC;AAKf,IAAC,cAAc,SAAU,GAAG;AAClC,SAAO,SAAS,SAAS,CAAA,GAAIC,cAAe,CAAC,CAAC,GAAG,EAAE,IAAQ,CAAE;AACjE;AAKU,IAAC,kBAAkBC;AAKnB,IAAC,mBAAmBC;AAKpB,IAAC,uBAAuBC;AAKxB,IAAC,uBAAuB,SAAU,GAAG;AAC3C,SAAO,SAAS,SAAS,CAAA,GAAIC,uBAAwB,CAAC,CAAC,GAAG,EAAE,IAAQ,CAAE;AAC1E;AAKU,IAAC,0BAA0B,SAAU,GAAG;AAC9C,MAAI,MAAM,qBAAqB,CAAC;AAChC,MAAI,QAAQ,KAAK,CAAC;AAClB,MAAI,oBAAoB,SAAU,GAAG;AACjC,WAAO,SAAU,IAAI,GAAG;AACpB,UAAI,KAAK,EAAE,GAAG,oBAAI,IAAK,CAAA;AACvB,UAAI,KAAK,MAAM,EAAE;AACjB,UAAI,MAAM,GAAG;AACb,UAAI,UAAU,SAAUC,IAAG;AACvB,YAAI,MAAM,GAAGA,EAAC;AACd,YAAI,IAAI,GAAG,IAAI,GAAG;AAClB,aAAK,EAAE,GAAG,EAAE,IAAI,IAAI,SAAU,GAAG;AAAE,iBAAO,SAAU,GAAG;AAAE,mBAAO,EAAE,IAAI,KAAK,CAAC;AAAA,UAAI;AAAA,SAAG,GAAG,EAAE,KAAK,CAAC,CAAC;AAAA,MAC/G;AACY,eAAS,IAAI,GAAG,IAAI,KAAK,KAAK;AAC1B,gBAAQ,CAAC;AAAA,MACZ;AACD,aAAO;AAAA,IACnB;AAAA,EACA;AACI,MAAI,WAAW,SAAU,GAAG;AACxB,QAAI,qBAAqB,kBAAkB,CAAC;AAC5C,WAAO,SAAU,IAAI,GAAG;AAAE,aAAO,mBAAmB,IAAI,SAAU,GAAG,GAAG;AAAE,eAAO,EAAE,CAAC;AAAA,MAAI,CAAA;AAAA,IAAE;AAAA,EAClG;AACI,MAAI,WAAW,SAAU,GAAG;AACxB,QAAI,qBAAqB,kBAAkB,CAAC;AAC5C,WAAO,SAAU,IAAI;AAAE,aAAO,mBAAmB,IAAI,SAAU,GAAG,GAAG;AAAE,eAAO;AAAA,MAAI,CAAA;AAAA,IAAE;AAAA,EAC5F;AACI,SAAO;AAAA,IACH;AAAA,IACA,IAAI;AAAA,IACJ,KAAK;AAAA,IACL,cAAc;AAAA,IACd,QAAQ,IAAI;AAAA,IACZ,SAAS,IAAI;AAAA,IACb,aAAa,IAAI;AAAA,IACjB,iBAAiB,IAAI;AAAA,IACrB,kBAAkB,IAAI;AAAA,IACtB,sBAAsB,IAAI;AAAA,IAC1B;AAAA,IACA;AAAA,IACA;AAAA,EACR;AACA;AAKU,IAAC,UAAU;AAAA,EACjB;AAAA,EACA,KAAK;AACT;AAKU,IAAC,OAAqBC,uBAAM,OAAO;AAKnC,IAAC,cAAc;AAAA,EACrB;AAAA,EACA;AAAA,EACA;AACJ;AAKU,IAAC,aAAa;AAAA,EACpB;AAAA,EACA,KAAK;AAAA,EACL;AAAA,EACA;AAAA,EACA,QAAQ;AAAA,EACR,WAAW;AAAA,EACX,WAAW;AAAA,EACX,cAAc;AAClB;AAIA,IAAI,OAAO,SAAU,GAAG;AAAE,SAAO,IAAI,IAAI,CAAC;;AAIhC,IAAC,QAAQ,SAAU,GAAG,GAAG;AAC/B,MAAI,UAAUC,QAAS,GAAG,CAAC;AAC3B,SAAO,SAAU,QAAQ;AAAE,WAAO,SAAU,OAAO;AAC/C,UAAI,QAAQ,KAAK,GAAG;AAChB,eAAO,KAAK,MAAM;AAAA,MACrB;AACD,UAAI,QAAQ,MAAM,GAAG;AACjB,eAAO,KAAK,KAAK;AAAA,MACpB;AACD,aAAO,QAAQ,MAAM,EAAE,KAAK;AAAA,IAC/B;AAAA;AACL;AAIU,IAAC,eAAe,SAAU,GAAG,GAAG;AACtC,MAAI,iBAAiBC,eAAgB,GAAG,CAAC;AACzC,SAAO,SAAU,QAAQ;AAAE,WAAO,SAAU,OAAO;AAC/C,UAAI,QAAQ,KAAK,KAAK,QAAQ,MAAM,GAAG;AACnC,eAAO,oBAAI,IAAG;AAAA,MACjB;AACD,aAAO,eAAe,MAAM,EAAE,KAAK;AAAA,IACtC;AAAA;AACL;AAIU,IAAC,aAAa,SAAU,GAAG;AACjC,MAAI,cAAcC,aAAc,CAAC;AACjC,SAAO,SAAU,QAAQ;AACrB,WAAO,SAAU,OAAO;AACpB,UAAI,QAAQ,KAAK,GAAG;AAChB,eAAO,KAAK,MAAM;AAAA,MACrB;AACD,UAAI,QAAQ,MAAM,GAAG;AACjB,eAAO,KAAK,KAAK;AAAA,MACpB;AACD,aAAO,YAAY,MAAM,EAAE,KAAK;AAAA,IAC5C;AAAA,EACA;AACA;AAWU,IAAC,QAAQ,oBAAI,IAAM;AAQnB,IAAC,WAAW;AAQZ,IAAC,OAAO;","x_google_ignoreList":[0]}

package/dist/_node_modules/fp-ts/es6/MeetSemilattice.cjs

@@ -0,0 +1,2 @@
+"use strict";
+//# sourceMappingURL=MeetSemilattice.cjs.map