@slicemachine/manager 0.22.2-alpha.dani-repeatable-links-codegen.2 → 0.22.2-alpha.dani-repeatable-links-warning.1

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

@@ -1,59 +0,0 @@
-"use strict";
-Object.defineProperty(exports, Symbol.toStringTag, { value: "Module" });
-const _function = require("./function.cjs");
-const Functor$1 = require("./Functor.cjs");
-var separated = function(left2, right2) {
-  return { left: left2, right: right2 };
-};
-var _map = function(fa, f) {
-  return _function.pipe(fa, map(f));
-};
-var _mapLeft = function(fa, f) {
-  return _function.pipe(fa, mapLeft(f));
-};
-var _bimap = function(fa, g, f) {
-  return _function.pipe(fa, bimap(g, f));
-};
-var map = function(f) {
-  return function(fa) {
-    return separated(left(fa), f(right(fa)));
-  };
-};
-var mapLeft = function(f) {
-  return function(fa) {
-    return separated(f(left(fa)), right(fa));
-  };
-};
-var bimap = function(f, g) {
-  return function(fa) {
-    return separated(f(left(fa)), g(right(fa)));
-  };
-};
-var URI = "Separated";
-var Bifunctor = {
-  URI,
-  mapLeft: _mapLeft,
-  bimap: _bimap
-};
-var Functor = {
-  URI,
-  map: _map
-};
-var flap = /* @__PURE__ */ Functor$1.flap(Functor);
-var left = function(s) {
-  return s.left;
-};
-var right = function(s) {
-  return s.right;
-};
-exports.Bifunctor = Bifunctor;
-exports.Functor = Functor;
-exports.URI = URI;
-exports.bimap = bimap;
-exports.flap = flap;
-exports.left = left;
-exports.map = map;
-exports.mapLeft = mapLeft;
-exports.right = right;
-exports.separated = separated;
-//# sourceMappingURL=Separated.cjs.map

package/dist/_node_modules/fp-ts/es6/Separated.cjs.map

@@ -1 +0,0 @@
-{"version":3,"file":"Separated.cjs","sources":["../../../../../../node_modules/fp-ts/es6/Separated.js"],"sourcesContent":["/**\n * ```ts\n * interface Separated<E, A> {\n *    readonly left: E\n *    readonly right: A\n * }\n * ```\n *\n * Represents a result of separating a whole into two parts.\n *\n * @since 2.10.0\n */\nimport { pipe } from './function';\nimport { flap as flap_ } from './Functor';\n// -------------------------------------------------------------------------------------\n// constructors\n// -------------------------------------------------------------------------------------\n/**\n * @category constructors\n * @since 2.10.0\n */\nexport var separated = function (left, right) { return ({ left: left, right: right }); };\nvar _map = function (fa, f) { return pipe(fa, map(f)); };\nvar _mapLeft = function (fa, f) { return pipe(fa, mapLeft(f)); };\nvar _bimap = function (fa, g, f) { return pipe(fa, bimap(g, f)); };\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.10.0\n */\nexport var map = function (f) {\n    return function (fa) {\n        return separated(left(fa), f(right(fa)));\n    };\n};\n/**\n * Map a function over the first type argument of a bifunctor.\n *\n * @category error handling\n * @since 2.10.0\n */\nexport var mapLeft = function (f) {\n    return function (fa) {\n        return separated(f(left(fa)), right(fa));\n    };\n};\n/**\n * Map a pair of functions over the two type arguments of the bifunctor.\n *\n * @category mapping\n * @since 2.10.0\n */\nexport var bimap = function (f, g) {\n    return function (fa) {\n        return separated(f(left(fa)), g(right(fa)));\n    };\n};\n/**\n * @category type lambdas\n * @since 2.10.0\n */\nexport var URI = 'Separated';\n/**\n * @category instances\n * @since 2.10.0\n */\nexport var Bifunctor = {\n    URI: URI,\n    mapLeft: _mapLeft,\n    bimap: _bimap\n};\n/**\n * @category instances\n * @since 2.10.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// utils\n// -------------------------------------------------------------------------------------\n/**\n * @since 2.10.0\n */\nexport var left = function (s) { return s.left; };\n/**\n * @since 2.10.0\n */\nexport var right = function (s) { return s.right; };\n"],"names":["left","right","pipe","flap_"],"mappings":";;;;AAqBU,IAAC,YAAY,SAAUA,OAAMC,QAAO;AAAE,SAAQ,EAAE,MAAMD,OAAM,OAAOC,OAAK;AAAO;AACzF,IAAI,OAAO,SAAU,IAAI,GAAG;AAAE,SAAOC,UAAAA,KAAK,IAAI,IAAI,CAAC,CAAC;;AACpD,IAAI,WAAW,SAAU,IAAI,GAAG;AAAE,SAAOA,UAAAA,KAAK,IAAI,QAAQ,CAAC,CAAC;;AAC5D,IAAI,SAAS,SAAU,IAAI,GAAG,GAAG;AAAE,SAAOA,UAAAA,KAAK,IAAI,MAAM,GAAG,CAAC,CAAC;AAAE;AAQtD,IAAC,MAAM,SAAU,GAAG;AAC1B,SAAO,SAAU,IAAI;AACjB,WAAO,UAAU,KAAK,EAAE,GAAG,EAAE,MAAM,EAAE,CAAC,CAAC;AAAA,EAC/C;AACA;AAOU,IAAC,UAAU,SAAU,GAAG;AAC9B,SAAO,SAAU,IAAI;AACjB,WAAO,UAAU,EAAE,KAAK,EAAE,CAAC,GAAG,MAAM,EAAE,CAAC;AAAA,EAC/C;AACA;AAOU,IAAC,QAAQ,SAAU,GAAG,GAAG;AAC/B,SAAO,SAAU,IAAI;AACjB,WAAO,UAAU,EAAE,KAAK,EAAE,CAAC,GAAG,EAAE,MAAM,EAAE,CAAC,CAAC;AAAA,EAClD;AACA;AAKU,IAAC,MAAM;AAKP,IAAC,YAAY;AAAA,EACnB;AAAA,EACA,SAAS;AAAA,EACT,OAAO;AACX;AAKU,IAAC,UAAU;AAAA,EACjB;AAAA,EACA,KAAK;AACT;AAKU,IAAC,OAAqBC,0BAAK,KAAC,OAAO;AAOnC,IAAC,OAAO,SAAU,GAAG;AAAE,SAAO,EAAE;AAAQ;AAIxC,IAAC,QAAQ,SAAU,GAAG;AAAE,SAAO,EAAE;AAAM;;;;;;;;;;;","x_google_ignoreList":[0]}

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

@@ -1,59 +0,0 @@
-import { pipe } from "./function.js";
-import { flap as flap$1 } from "./Functor.js";
-var separated = function(left2, right2) {
-  return { left: left2, right: right2 };
-};
-var _map = function(fa, f) {
-  return pipe(fa, map(f));
-};
-var _mapLeft = function(fa, f) {
-  return pipe(fa, mapLeft(f));
-};
-var _bimap = function(fa, g, f) {
-  return pipe(fa, bimap(g, f));
-};
-var map = function(f) {
-  return function(fa) {
-    return separated(left(fa), f(right(fa)));
-  };
-};
-var mapLeft = function(f) {
-  return function(fa) {
-    return separated(f(left(fa)), right(fa));
-  };
-};
-var bimap = function(f, g) {
-  return function(fa) {
-    return separated(f(left(fa)), g(right(fa)));
-  };
-};
-var URI = "Separated";
-var Bifunctor = {
-  URI,
-  mapLeft: _mapLeft,
-  bimap: _bimap
-};
-var Functor = {
-  URI,
-  map: _map
-};
-var flap = /* @__PURE__ */ flap$1(Functor);
-var left = function(s) {
-  return s.left;
-};
-var right = function(s) {
-  return s.right;
-};
-export {
-  Bifunctor,
-  Functor,
-  URI,
-  bimap,
-  flap,
-  left,
-  map,
-  mapLeft,
-  right,
-  separated
-};
-//# sourceMappingURL=Separated.js.map

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

@@ -1 +0,0 @@
-{"version":3,"file":"Separated.js","sources":["../../../../../../node_modules/fp-ts/es6/Separated.js"],"sourcesContent":["/**\n * ```ts\n * interface Separated<E, A> {\n *    readonly left: E\n *    readonly right: A\n * }\n * ```\n *\n * Represents a result of separating a whole into two parts.\n *\n * @since 2.10.0\n */\nimport { pipe } from './function';\nimport { flap as flap_ } from './Functor';\n// -------------------------------------------------------------------------------------\n// constructors\n// -------------------------------------------------------------------------------------\n/**\n * @category constructors\n * @since 2.10.0\n */\nexport var separated = function (left, right) { return ({ left: left, right: right }); };\nvar _map = function (fa, f) { return pipe(fa, map(f)); };\nvar _mapLeft = function (fa, f) { return pipe(fa, mapLeft(f)); };\nvar _bimap = function (fa, g, f) { return pipe(fa, bimap(g, f)); };\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.10.0\n */\nexport var map = function (f) {\n    return function (fa) {\n        return separated(left(fa), f(right(fa)));\n    };\n};\n/**\n * Map a function over the first type argument of a bifunctor.\n *\n * @category error handling\n * @since 2.10.0\n */\nexport var mapLeft = function (f) {\n    return function (fa) {\n        return separated(f(left(fa)), right(fa));\n    };\n};\n/**\n * Map a pair of functions over the two type arguments of the bifunctor.\n *\n * @category mapping\n * @since 2.10.0\n */\nexport var bimap = function (f, g) {\n    return function (fa) {\n        return separated(f(left(fa)), g(right(fa)));\n    };\n};\n/**\n * @category type lambdas\n * @since 2.10.0\n */\nexport var URI = 'Separated';\n/**\n * @category instances\n * @since 2.10.0\n */\nexport var Bifunctor = {\n    URI: URI,\n    mapLeft: _mapLeft,\n    bimap: _bimap\n};\n/**\n * @category instances\n * @since 2.10.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// utils\n// -------------------------------------------------------------------------------------\n/**\n * @since 2.10.0\n */\nexport var left = function (s) { return s.left; };\n/**\n * @since 2.10.0\n */\nexport var right = function (s) { return s.right; };\n"],"names":["left","right","flap_"],"mappings":";;AAqBU,IAAC,YAAY,SAAUA,OAAMC,QAAO;AAAE,SAAQ,EAAE,MAAMD,OAAM,OAAOC,OAAK;AAAO;AACzF,IAAI,OAAO,SAAU,IAAI,GAAG;AAAE,SAAO,KAAK,IAAI,IAAI,CAAC,CAAC;;AACpD,IAAI,WAAW,SAAU,IAAI,GAAG;AAAE,SAAO,KAAK,IAAI,QAAQ,CAAC,CAAC;;AAC5D,IAAI,SAAS,SAAU,IAAI,GAAG,GAAG;AAAE,SAAO,KAAK,IAAI,MAAM,GAAG,CAAC,CAAC;AAAE;AAQtD,IAAC,MAAM,SAAU,GAAG;AAC1B,SAAO,SAAU,IAAI;AACjB,WAAO,UAAU,KAAK,EAAE,GAAG,EAAE,MAAM,EAAE,CAAC,CAAC;AAAA,EAC/C;AACA;AAOU,IAAC,UAAU,SAAU,GAAG;AAC9B,SAAO,SAAU,IAAI;AACjB,WAAO,UAAU,EAAE,KAAK,EAAE,CAAC,GAAG,MAAM,EAAE,CAAC;AAAA,EAC/C;AACA;AAOU,IAAC,QAAQ,SAAU,GAAG,GAAG;AAC/B,SAAO,SAAU,IAAI;AACjB,WAAO,UAAU,EAAE,KAAK,EAAE,CAAC,GAAG,EAAE,MAAM,EAAE,CAAC,CAAC;AAAA,EAClD;AACA;AAKU,IAAC,MAAM;AAKP,IAAC,YAAY;AAAA,EACnB;AAAA,EACA,SAAS;AAAA,EACT,OAAO;AACX;AAKU,IAAC,UAAU;AAAA,EACjB;AAAA,EACA,KAAK;AACT;AAKU,IAAC,OAAqBC,uBAAM,OAAO;AAOnC,IAAC,OAAO,SAAU,GAAG;AAAE,SAAO,EAAE;AAAQ;AAIxC,IAAC,QAAQ,SAAU,GAAG;AAAE,SAAO,EAAE;AAAM;","x_google_ignoreList":[0]}

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

@@ -1,327 +0,0 @@
-"use strict";
-Object.defineProperty(exports, Symbol.toStringTag, { value: "Module" });
-const _function = require("./function.cjs");
-const ReadonlySet = require("./ReadonlySet.cjs");
-const Separated = require("./Separated.cjs");
-var getShow = ReadonlySet.getShow;
-var getEq = ReadonlySet.getEq;
-function map(E) {
-  var elemE = elem(E);
-  return function(f) {
-    return function(set) {
-      var r = /* @__PURE__ */ new Set();
-      set.forEach(function(e) {
-        var v = f(e);
-        if (!elemE(v, r)) {
-          r.add(v);
-        }
-      });
-      return r;
-    };
-  };
-}
-function chain(E) {
-  var elemE = elem(E);
-  return function(f) {
-    return function(set) {
-      var r = /* @__PURE__ */ new Set();
-      set.forEach(function(e) {
-        f(e).forEach(function(e2) {
-          if (!elemE(e2, r)) {
-            r.add(e2);
-          }
-        });
-      });
-      return r;
-    };
-  };
-}
-function filter(predicate) {
-  return function(set) {
-    var values = set.values();
-    var e;
-    var r = /* @__PURE__ */ new Set();
-    while (!(e = values.next()).done) {
-      var a = e.value;
-      if (predicate(a)) {
-        r.add(a);
-      }
-    }
-    return r;
-  };
-}
-function partition(predicate) {
-  return function(set) {
-    var values = set.values();
-    var e;
-    var right = /* @__PURE__ */ new Set();
-    var left = /* @__PURE__ */ new Set();
-    while (!(e = values.next()).done) {
-      var a = e.value;
-      if (predicate(a)) {
-        right.add(a);
-      } else {
-        left.add(a);
-      }
-    }
-    return Separated.separated(left, right);
-  };
-}
-function union(E) {
-  var elemE = elem(E);
-  return function(me, that) {
-    if (that === void 0) {
-      var unionE_1 = union(E);
-      return function(that2) {
-        return unionE_1(me, that2);
-      };
-    }
-    if (isEmpty(me)) {
-      return that;
-    }
-    if (isEmpty(that)) {
-      return me;
-    }
-    var r = new Set(me);
-    that.forEach(function(e) {
-      if (!elemE(e, r)) {
-        r.add(e);
-      }
-    });
-    return r;
-  };
-}
-function intersection(E) {
-  var elemE = elem(E);
-  return function(me, that) {
-    if (that === void 0) {
-      var intersectionE_1 = intersection(E);
-      return function(that2) {
-        return intersectionE_1(that2, me);
-      };
-    }
-    if (isEmpty(me) || isEmpty(that)) {
-      return /* @__PURE__ */ new Set();
-    }
-    var r = /* @__PURE__ */ new Set();
-    me.forEach(function(e) {
-      if (elemE(e, that)) {
-        r.add(e);
-      }
-    });
-    return r;
-  };
-}
-function partitionMap(EB, EC) {
-  return function(f) {
-    return function(set) {
-      var values = set.values();
-      var e;
-      var left = /* @__PURE__ */ new Set();
-      var right = /* @__PURE__ */ new Set();
-      var hasB = elem(EB);
-      var hasC = elem(EC);
-      while (!(e = values.next()).done) {
-        var v = f(e.value);
-        switch (v._tag) {
-          case "Left":
-            if (!hasB(v.left, left)) {
-              left.add(v.left);
-            }
-            break;
-          case "Right":
-            if (!hasC(v.right, right)) {
-              right.add(v.right);
-            }
-            break;
-        }
-      }
-      return Separated.separated(left, right);
-    };
-  };
-}
-function difference(E) {
-  var elemE = elem(E);
-  return function(me, that) {
-    if (that === void 0) {
-      var differenceE_1 = difference(E);
-      return function(that2) {
-        return differenceE_1(that2, me);
-      };
-    }
-    return filter(function(a) {
-      return !elemE(a, that);
-    })(me);
-  };
-}
-var getUnionSemigroup = function(E) {
-  return {
-    concat: union(E)
-  };
-};
-var getUnionMonoid = function(E) {
-  return {
-    concat: getUnionSemigroup(E).concat,
-    empty: /* @__PURE__ */ new Set()
-  };
-};
-var getIntersectionSemigroup = function(E) {
-  return {
-    concat: intersection(E)
-  };
-};
-var getDifferenceMagma = function(E) {
-  return {
-    concat: difference(E)
-  };
-};
-var reduce = ReadonlySet.reduce;
-var foldMap = ReadonlySet.foldMap;
-var reduceRight = ReadonlySet.reduceRight;
-var singleton = function(a) {
-  return /* @__PURE__ */ new Set([a]);
-};
-function insert(E) {
-  var elemE = elem(E);
-  return function(a) {
-    return function(set) {
-      if (!elemE(a)(set)) {
-        var r = new Set(set);
-        r.add(a);
-        return r;
-      } else {
-        return set;
-      }
-    };
-  };
-}
-var remove = function(E) {
-  return function(a) {
-    return function(set) {
-      return filter(function(ax) {
-        return !E.equals(a, ax);
-      })(set);
-    };
-  };
-};
-var toggle = function(E) {
-  var elemE = elem(E);
-  var removeE = remove(E);
-  var insertE = insert(E);
-  return function(a) {
-    return function(set) {
-      return (elemE(a, set) ? removeE : insertE)(a)(set);
-    };
-  };
-};
-var fromArray = function(E) {
-  return function(as) {
-    var len = as.length;
-    var out = /* @__PURE__ */ new Set();
-    var has = elem(E);
-    for (var i = 0; i < len; i++) {
-      var a = as[i];
-      if (!has(a, out)) {
-        out.add(a);
-      }
-    }
-    return out;
-  };
-};
-var compact = function(E) {
-  return filterMap(E)(_function.identity);
-};
-function separate(EE, EA) {
-  return function(fa) {
-    var elemEE = elem(EE);
-    var elemEA = elem(EA);
-    var left = /* @__PURE__ */ new Set();
-    var right = /* @__PURE__ */ new Set();
-    fa.forEach(function(e) {
-      switch (e._tag) {
-        case "Left":
-          if (!elemEE(e.left, left)) {
-            left.add(e.left);
-          }
-          break;
-        case "Right":
-          if (!elemEA(e.right, right)) {
-            right.add(e.right);
-          }
-          break;
-      }
-    });
-    return Separated.separated(left, right);
-  };
-}
-function filterMap(E) {
-  var elemE = elem(E);
-  return function(f) {
-    return function(fa) {
-      var r = /* @__PURE__ */ new Set();
-      fa.forEach(function(a) {
-        var ob = f(a);
-        if (ob._tag === "Some" && !elemE(ob.value, r)) {
-          r.add(ob.value);
-        }
-      });
-      return r;
-    };
-  };
-}
-var empty = /* @__PURE__ */ new Set();
-var isEmpty = function(set) {
-  return set.size === 0;
-};
-var size = function(set) {
-  return set.size;
-};
-var some = ReadonlySet.some;
-var every = ReadonlySet.every;
-var isSubset = ReadonlySet.isSubset;
-var elem = ReadonlySet.elem;
-var toArray = function(O) {
-  return function(set) {
-    var out = [];
-    set.forEach(function(e) {
-      return out.push(e);
-    });
-    return out.sort(O.compare);
-  };
-};
-var subset = ReadonlySet.isSubset;
-exports.chain = chain;
-exports.compact = compact;
-exports.difference = difference;
-exports.elem = elem;
-exports.empty = empty;
-exports.every = every;
-exports.filter = filter;
-exports.filterMap = filterMap;
-exports.foldMap = foldMap;
-exports.fromArray = fromArray;
-exports.getDifferenceMagma = getDifferenceMagma;
-exports.getEq = getEq;
-exports.getIntersectionSemigroup = getIntersectionSemigroup;
-exports.getShow = getShow;
-exports.getUnionMonoid = getUnionMonoid;
-exports.getUnionSemigroup = getUnionSemigroup;
-exports.insert = insert;
-exports.intersection = intersection;
-exports.isEmpty = isEmpty;
-exports.isSubset = isSubset;
-exports.map = map;
-exports.partition = partition;
-exports.partitionMap = partitionMap;
-exports.reduce = reduce;
-exports.reduceRight = reduceRight;
-exports.remove = remove;
-exports.separate = separate;
-exports.singleton = singleton;
-exports.size = size;
-exports.some = some;
-exports.subset = subset;
-exports.toArray = toArray;
-exports.toggle = toggle;
-exports.union = union;
-//# sourceMappingURL=Set.cjs.map

package/dist/_node_modules/fp-ts/es6/Set.cjs.map

@@ -1 +0,0 @@
-{"version":3,"file":"Set.cjs","sources":["../../../../../../node_modules/fp-ts/es6/Set.js"],"sourcesContent":["import { identity } from './function';\nimport * as RS from './ReadonlySet';\nimport { separated } from './Separated';\n/**\n * @category instances\n * @since 2.0.0\n */\nexport var getShow = RS.getShow;\n/**\n * @category instances\n * @since 2.0.0\n */\nexport var getEq = RS.getEq;\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 * @since 2.0.0\n */\nexport function map(E) {\n    var elemE = elem(E);\n    return function (f) { return function (set) {\n        var r = new Set();\n        set.forEach(function (e) {\n            var v = f(e);\n            if (!elemE(v, r)) {\n                r.add(v);\n            }\n        });\n        return r;\n    }; };\n}\n/**\n * Composes computations in sequence, using the return value of one computation to determine the next computation.\n *\n * @since 2.0.0\n */\nexport function chain(E) {\n    var elemE = elem(E);\n    return function (f) { return function (set) {\n        var r = new Set();\n        set.forEach(function (e) {\n            f(e).forEach(function (e) {\n                if (!elemE(e, r)) {\n                    r.add(e);\n                }\n            });\n        });\n        return r;\n    }; };\n}\nexport function filter(predicate) {\n    return function (set) {\n        var values = set.values();\n        var e;\n        var r = new Set();\n        while (!(e = values.next()).done) {\n            var a = e.value;\n            if (predicate(a)) {\n                r.add(a);\n            }\n        }\n        return r;\n    };\n}\nexport function partition(predicate) {\n    return function (set) {\n        var values = set.values();\n        var e;\n        var right = new Set();\n        var left = new Set();\n        while (!(e = values.next()).done) {\n            var a = e.value;\n            if (predicate(a)) {\n                right.add(a);\n            }\n            else {\n                left.add(a);\n            }\n        }\n        return separated(left, right);\n    };\n}\nexport function union(E) {\n    var elemE = elem(E);\n    return function (me, that) {\n        if (that === undefined) {\n            var unionE_1 = union(E);\n            return function (that) { return unionE_1(me, that); };\n        }\n        if (isEmpty(me)) {\n            return that;\n        }\n        if (isEmpty(that)) {\n            return me;\n        }\n        var r = new Set(me);\n        that.forEach(function (e) {\n            if (!elemE(e, r)) {\n                r.add(e);\n            }\n        });\n        return r;\n    };\n}\nexport function intersection(E) {\n    var elemE = elem(E);\n    return function (me, that) {\n        if (that === undefined) {\n            var intersectionE_1 = intersection(E);\n            return function (that) { return intersectionE_1(that, me); };\n        }\n        if (isEmpty(me) || isEmpty(that)) {\n            return new Set();\n        }\n        var r = new Set();\n        me.forEach(function (e) {\n            if (elemE(e, that)) {\n                r.add(e);\n            }\n        });\n        return r;\n    };\n}\n/**\n * @since 2.0.0\n */\nexport function partitionMap(EB, EC) {\n    return function (f) {\n        return function (set) {\n            var values = set.values();\n            var e;\n            var left = new Set();\n            var right = new Set();\n            var hasB = elem(EB);\n            var hasC = elem(EC);\n            while (!(e = values.next()).done) {\n                var v = f(e.value);\n                switch (v._tag) {\n                    case 'Left':\n                        if (!hasB(v.left, left)) {\n                            left.add(v.left);\n                        }\n                        break;\n                    case 'Right':\n                        if (!hasC(v.right, right)) {\n                            right.add(v.right);\n                        }\n                        break;\n                }\n            }\n            return separated(left, right);\n        };\n    };\n}\nexport function difference(E) {\n    var elemE = elem(E);\n    return function (me, that) {\n        if (that === undefined) {\n            var differenceE_1 = difference(E);\n            return function (that) { return differenceE_1(that, me); };\n        }\n        return filter(function (a) { return !elemE(a, that); })(me);\n    };\n}\n/**\n * @category instances\n * @since 2.11.0\n */\nexport var getUnionSemigroup = function (E) { return ({\n    concat: union(E)\n}); };\n/**\n * @category instances\n * @since 2.0.0\n */\nexport var getUnionMonoid = function (E) { return ({\n    concat: getUnionSemigroup(E).concat,\n    empty: new Set()\n}); };\n/**\n * @category instances\n * @since 2.0.0\n */\nexport var getIntersectionSemigroup = function (E) { return ({\n    concat: intersection(E)\n}); };\n/**\n * @category instances\n * @since 2.11.0\n */\nexport var getDifferenceMagma = function (E) { return ({\n    concat: difference(E)\n}); };\n/**\n * @category folding\n * @since 2.0.0\n */\nexport var reduce = RS.reduce;\n/**\n * @category folding\n * @since 2.0.0\n */\nexport var foldMap = RS.foldMap;\n/**\n * @category folding\n * @since 2.11.0\n */\nexport var reduceRight = RS.reduceRight;\n/**\n * Create a set with one element\n *\n * @category constructors\n * @since 2.0.0\n */\nexport var singleton = function (a) { return new Set([a]); };\n/**\n * Insert a value into a set\n *\n * @since 2.0.0\n */\nexport function insert(E) {\n    var elemE = elem(E);\n    return function (a) { return function (set) {\n        if (!elemE(a)(set)) {\n            var r = new Set(set);\n            r.add(a);\n            return r;\n        }\n        else {\n            return set;\n        }\n    }; };\n}\n/**\n * Delete a value from a set\n *\n * @since 2.0.0\n */\nexport var remove = function (E) {\n    return function (a) {\n        return function (set) {\n            return filter(function (ax) { return !E.equals(a, ax); })(set);\n        };\n    };\n};\n/**\n * Checks an element is a member of a set;\n * If yes, removes the value from the set\n * If no, inserts the value to the set\n *\n * @since 2.5.0\n */\nexport var toggle = function (E) {\n    var elemE = elem(E);\n    var removeE = remove(E);\n    var insertE = insert(E);\n    return function (a) { return function (set) { return (elemE(a, set) ? removeE : insertE)(a)(set); }; };\n};\n/**\n * Create a set from an array\n *\n * @category conversions\n * @since 2.0.0\n */\nexport var fromArray = function (E) {\n    return function (as) {\n        var len = as.length;\n        var out = new Set();\n        var has = elem(E);\n        for (var i = 0; i < len; i++) {\n            var a = as[i];\n            if (!has(a, out)) {\n                out.add(a);\n            }\n        }\n        return out;\n    };\n};\n/**\n * @since 2.0.0\n */\nexport var compact = function (E) { return filterMap(E)(identity); };\n/**\n * @since 2.0.0\n */\nexport function separate(EE, EA) {\n    return function (fa) {\n        var elemEE = elem(EE);\n        var elemEA = elem(EA);\n        var left = new Set();\n        var right = new Set();\n        fa.forEach(function (e) {\n            switch (e._tag) {\n                case 'Left':\n                    if (!elemEE(e.left, left)) {\n                        left.add(e.left);\n                    }\n                    break;\n                case 'Right':\n                    if (!elemEA(e.right, right)) {\n                        right.add(e.right);\n                    }\n                    break;\n            }\n        });\n        return separated(left, right);\n    };\n}\n/**\n * @since 2.0.0\n */\nexport function filterMap(E) {\n    var elemE = elem(E);\n    return function (f) { return function (fa) {\n        var r = new Set();\n        fa.forEach(function (a) {\n            var ob = f(a);\n            if (ob._tag === 'Some' && !elemE(ob.value, r)) {\n                r.add(ob.value);\n            }\n        });\n        return r;\n    }; };\n}\n// -------------------------------------------------------------------------------------\n// utils\n// -------------------------------------------------------------------------------------\n/**\n * @since 2.0.0\n */\nexport var empty = new Set();\n/**\n * Test whether a `Set` is empty.\n *\n * @since 2.10.0\n */\nexport var isEmpty = function (set) { return set.size === 0; };\n/**\n * Calculate the number of elements in a `Set`.\n *\n * @since 2.10.0\n */\nexport var size = function (set) { return set.size; };\n/**\n * @since 2.0.0\n */\nexport var some = RS.some;\n/**\n * @since 2.0.0\n */\nexport var every = RS.every;\n/**\n * @since 2.10.0\n */\nexport var isSubset = RS.isSubset;\n// TODO: remove non-curried overloading in v3\n/**\n * Test if a value is a member of a set\n *\n * @since 2.0.0\n */\nexport var elem = RS.elem;\n/**\n * Get a sorted `Array` of the values contained in a `Set`.\n *\n * @category conversions\n * @since 2.0.0\n */\nexport var toArray = function (O) {\n    return function (set) {\n        var out = [];\n        set.forEach(function (e) { return out.push(e); });\n        return out.sort(O.compare);\n    };\n};\n// -------------------------------------------------------------------------------------\n// deprecated\n// -------------------------------------------------------------------------------------\n/**\n * Use [`isSubset`](#issubset) instead.\n *\n * @category zone of death\n * @since 2.0.0\n * @deprecated\n */\nexport var subset = RS.isSubset;\n"],"names":["RS.getShow","RS.getEq","e","separated","that","RS.reduce","RS.foldMap","RS.reduceRight","identity","RS.some","RS.every","RS.isSubset","RS.elem"],"mappings":";;;;;AAOU,IAAC,UAAUA,YAAW;AAKtB,IAAC,QAAQC,YAAS;AAOrB,SAAS,IAAI,GAAG;AACnB,MAAI,QAAQ,KAAK,CAAC;AAClB,SAAO,SAAU,GAAG;AAAE,WAAO,SAAU,KAAK;AACxC,UAAI,IAAI,oBAAI;AACZ,UAAI,QAAQ,SAAU,GAAG;AACrB,YAAI,IAAI,EAAE,CAAC;AACX,YAAI,CAAC,MAAM,GAAG,CAAC,GAAG;AACd,YAAE,IAAI,CAAC;AAAA,QACV;AAAA,MACb,CAAS;AACD,aAAO;AAAA,IACV;AAAA;AACL;AAMO,SAAS,MAAM,GAAG;AACrB,MAAI,QAAQ,KAAK,CAAC;AAClB,SAAO,SAAU,GAAG;AAAE,WAAO,SAAU,KAAK;AACxC,UAAI,IAAI,oBAAI;AACZ,UAAI,QAAQ,SAAU,GAAG;AACrB,UAAE,CAAC,EAAE,QAAQ,SAAUC,IAAG;AACtB,cAAI,CAAC,MAAMA,IAAG,CAAC,GAAG;AACd,cAAE,IAAIA,EAAC;AAAA,UACV;AAAA,QACjB,CAAa;AAAA,MACb,CAAS;AACD,aAAO;AAAA,IACV;AAAA;AACL;AACO,SAAS,OAAO,WAAW;AAC9B,SAAO,SAAU,KAAK;AAClB,QAAI,SAAS,IAAI;AACjB,QAAI;AACJ,QAAI,IAAI,oBAAI;AACZ,WAAO,EAAE,IAAI,OAAO,KAAI,GAAI,MAAM;AAC9B,UAAI,IAAI,EAAE;AACV,UAAI,UAAU,CAAC,GAAG;AACd,UAAE,IAAI,CAAC;AAAA,MACV;AAAA,IACJ;AACD,WAAO;AAAA,EACf;AACA;AACO,SAAS,UAAU,WAAW;AACjC,SAAO,SAAU,KAAK;AAClB,QAAI,SAAS,IAAI;AACjB,QAAI;AACJ,QAAI,QAAQ,oBAAI;AAChB,QAAI,OAAO,oBAAI;AACf,WAAO,EAAE,IAAI,OAAO,KAAI,GAAI,MAAM;AAC9B,UAAI,IAAI,EAAE;AACV,UAAI,UAAU,CAAC,GAAG;AACd,cAAM,IAAI,CAAC;AAAA,MACd,OACI;AACD,aAAK,IAAI,CAAC;AAAA,MACb;AAAA,IACJ;AACD,WAAOC,UAAS,UAAC,MAAM,KAAK;AAAA,EACpC;AACA;AACO,SAAS,MAAM,GAAG;AACrB,MAAI,QAAQ,KAAK,CAAC;AAClB,SAAO,SAAU,IAAI,MAAM;AACvB,QAAI,SAAS,QAAW;AACpB,UAAI,WAAW,MAAM,CAAC;AACtB,aAAO,SAAUC,OAAM;AAAE,eAAO,SAAS,IAAIA,KAAI;AAAA;IACpD;AACD,QAAI,QAAQ,EAAE,GAAG;AACb,aAAO;AAAA,IACV;AACD,QAAI,QAAQ,IAAI,GAAG;AACf,aAAO;AAAA,IACV;AACD,QAAI,IAAI,IAAI,IAAI,EAAE;AAClB,SAAK,QAAQ,SAAU,GAAG;AACtB,UAAI,CAAC,MAAM,GAAG,CAAC,GAAG;AACd,UAAE,IAAI,CAAC;AAAA,MACV;AAAA,IACb,CAAS;AACD,WAAO;AAAA,EACf;AACA;AACO,SAAS,aAAa,GAAG;AAC5B,MAAI,QAAQ,KAAK,CAAC;AAClB,SAAO,SAAU,IAAI,MAAM;AACvB,QAAI,SAAS,QAAW;AACpB,UAAI,kBAAkB,aAAa,CAAC;AACpC,aAAO,SAAUA,OAAM;AAAE,eAAO,gBAAgBA,OAAM,EAAE;AAAA;IAC3D;AACD,QAAI,QAAQ,EAAE,KAAK,QAAQ,IAAI,GAAG;AAC9B,aAAO,oBAAI,IAAG;AAAA,IACjB;AACD,QAAI,IAAI,oBAAI;AACZ,OAAG,QAAQ,SAAU,GAAG;AACpB,UAAI,MAAM,GAAG,IAAI,GAAG;AAChB,UAAE,IAAI,CAAC;AAAA,MACV;AAAA,IACb,CAAS;AACD,WAAO;AAAA,EACf;AACA;AAIO,SAAS,aAAa,IAAI,IAAI;AACjC,SAAO,SAAU,GAAG;AAChB,WAAO,SAAU,KAAK;AAClB,UAAI,SAAS,IAAI;AACjB,UAAI;AACJ,UAAI,OAAO,oBAAI;AACf,UAAI,QAAQ,oBAAI;AAChB,UAAI,OAAO,KAAK,EAAE;AAClB,UAAI,OAAO,KAAK,EAAE;AAClB,aAAO,EAAE,IAAI,OAAO,KAAI,GAAI,MAAM;AAC9B,YAAI,IAAI,EAAE,EAAE,KAAK;AACjB,gBAAQ,EAAE,MAAI;AAAA,UACV,KAAK;AACD,gBAAI,CAAC,KAAK,EAAE,MAAM,IAAI,GAAG;AACrB,mBAAK,IAAI,EAAE,IAAI;AAAA,YAClB;AACD;AAAA,UACJ,KAAK;AACD,gBAAI,CAAC,KAAK,EAAE,OAAO,KAAK,GAAG;AACvB,oBAAM,IAAI,EAAE,KAAK;AAAA,YACpB;AACD;AAAA,QACP;AAAA,MACJ;AACD,aAAOD,UAAS,UAAC,MAAM,KAAK;AAAA,IACxC;AAAA,EACA;AACA;AACO,SAAS,WAAW,GAAG;AAC1B,MAAI,QAAQ,KAAK,CAAC;AAClB,SAAO,SAAU,IAAI,MAAM;AACvB,QAAI,SAAS,QAAW;AACpB,UAAI,gBAAgB,WAAW,CAAC;AAChC,aAAO,SAAUC,OAAM;AAAE,eAAO,cAAcA,OAAM,EAAE;AAAA;IACzD;AACD,WAAO,OAAO,SAAU,GAAG;AAAE,aAAO,CAAC,MAAM,GAAG,IAAI;AAAA,KAAI,EAAE,EAAE;AAAA,EAClE;AACA;AAKU,IAAC,oBAAoB,SAAU,GAAG;AAAE,SAAQ;AAAA,IAClD,QAAQ,MAAM,CAAC;AAAA,EACnB;AAAM;AAKI,IAAC,iBAAiB,SAAU,GAAG;AAAE,SAAQ;AAAA,IAC/C,QAAQ,kBAAkB,CAAC,EAAE;AAAA,IAC7B,OAAO,oBAAI,IAAK;AAAA,EACpB;AAAM;AAKI,IAAC,2BAA2B,SAAU,GAAG;AAAE,SAAQ;AAAA,IACzD,QAAQ,aAAa,CAAC;AAAA,EAC1B;AAAM;AAKI,IAAC,qBAAqB,SAAU,GAAG;AAAE,SAAQ;AAAA,IACnD,QAAQ,WAAW,CAAC;AAAA,EACxB;AAAM;AAKI,IAAC,SAASC,YAAU;AAKpB,IAAC,UAAUC,YAAW;AAKtB,IAAC,cAAcC,YAAe;AAO9B,IAAC,YAAY,SAAU,GAAG;AAAE,SAAO,oBAAI,IAAI,CAAC,CAAC,CAAC;AAAK;AAMtD,SAAS,OAAO,GAAG;AACtB,MAAI,QAAQ,KAAK,CAAC;AAClB,SAAO,SAAU,GAAG;AAAE,WAAO,SAAU,KAAK;AACxC,UAAI,CAAC,MAAM,CAAC,EAAE,GAAG,GAAG;AAChB,YAAI,IAAI,IAAI,IAAI,GAAG;AACnB,UAAE,IAAI,CAAC;AACP,eAAO;AAAA,MACV,OACI;AACD,eAAO;AAAA,MACV;AAAA,IACJ;AAAA;AACL;AAMU,IAAC,SAAS,SAAU,GAAG;AAC7B,SAAO,SAAU,GAAG;AAChB,WAAO,SAAU,KAAK;AAClB,aAAO,OAAO,SAAU,IAAI;AAAE,eAAO,CAAC,EAAE,OAAO,GAAG,EAAE;AAAA,OAAI,EAAE,GAAG;AAAA,IACzE;AAAA,EACA;AACA;AAQU,IAAC,SAAS,SAAU,GAAG;AAC7B,MAAI,QAAQ,KAAK,CAAC;AAClB,MAAI,UAAU,OAAO,CAAC;AACtB,MAAI,UAAU,OAAO,CAAC;AACtB,SAAO,SAAU,GAAG;AAAE,WAAO,SAAU,KAAK;AAAE,cAAQ,MAAM,GAAG,GAAG,IAAI,UAAU,SAAS,CAAC,EAAE,GAAG;AAAA,IAAI;AAAA;AACvG;AAOU,IAAC,YAAY,SAAU,GAAG;AAChC,SAAO,SAAU,IAAI;AACjB,QAAI,MAAM,GAAG;AACb,QAAI,MAAM,oBAAI;AACd,QAAI,MAAM,KAAK,CAAC;AAChB,aAAS,IAAI,GAAG,IAAI,KAAK,KAAK;AAC1B,UAAI,IAAI,GAAG,CAAC;AACZ,UAAI,CAAC,IAAI,GAAG,GAAG,GAAG;AACd,YAAI,IAAI,CAAC;AAAA,MACZ;AAAA,IACJ;AACD,WAAO;AAAA,EACf;AACA;AAIU,IAAC,UAAU,SAAU,GAAG;AAAE,SAAO,UAAU,CAAC,EAAEC,UAAQ,QAAA;AAAK;AAI9D,SAAS,SAAS,IAAI,IAAI;AAC7B,SAAO,SAAU,IAAI;AACjB,QAAI,SAAS,KAAK,EAAE;AACpB,QAAI,SAAS,KAAK,EAAE;AACpB,QAAI,OAAO,oBAAI;AACf,QAAI,QAAQ,oBAAI;AAChB,OAAG,QAAQ,SAAU,GAAG;AACpB,cAAQ,EAAE,MAAI;AAAA,QACV,KAAK;AACD,cAAI,CAAC,OAAO,EAAE,MAAM,IAAI,GAAG;AACvB,iBAAK,IAAI,EAAE,IAAI;AAAA,UAClB;AACD;AAAA,QACJ,KAAK;AACD,cAAI,CAAC,OAAO,EAAE,OAAO,KAAK,GAAG;AACzB,kBAAM,IAAI,EAAE,KAAK;AAAA,UACpB;AACD;AAAA,MACP;AAAA,IACb,CAAS;AACD,WAAOL,UAAS,UAAC,MAAM,KAAK;AAAA,EACpC;AACA;AAIO,SAAS,UAAU,GAAG;AACzB,MAAI,QAAQ,KAAK,CAAC;AAClB,SAAO,SAAU,GAAG;AAAE,WAAO,SAAU,IAAI;AACvC,UAAI,IAAI,oBAAI;AACZ,SAAG,QAAQ,SAAU,GAAG;AACpB,YAAI,KAAK,EAAE,CAAC;AACZ,YAAI,GAAG,SAAS,UAAU,CAAC,MAAM,GAAG,OAAO,CAAC,GAAG;AAC3C,YAAE,IAAI,GAAG,KAAK;AAAA,QACjB;AAAA,MACb,CAAS;AACD,aAAO;AAAA,IACV;AAAA;AACL;AAOU,IAAC,QAAQ,oBAAI,IAAM;AAMnB,IAAC,UAAU,SAAU,KAAK;AAAE,SAAO,IAAI,SAAS;AAAK;AAMrD,IAAC,OAAO,SAAU,KAAK;AAAE,SAAO,IAAI;AAAQ;AAI5C,IAAC,OAAOM,YAAQ;AAIhB,IAAC,QAAQC,YAAS;AAIlB,IAAC,WAAWC,YAAY;AAOxB,IAAC,OAAOC,YAAQ;AAOhB,IAAC,UAAU,SAAU,GAAG;AAC9B,SAAO,SAAU,KAAK;AAClB,QAAI,MAAM,CAAA;AACV,QAAI,QAAQ,SAAU,GAAG;AAAE,aAAO,IAAI,KAAK,CAAC;AAAA,IAAE,CAAE;AAChD,WAAO,IAAI,KAAK,EAAE,OAAO;AAAA,EACjC;AACA;AAWU,IAAC,SAASD,YAAAA;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;","x_google_ignoreList":[0]}