@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/ReadonlySet.js

@@ -1,419 +0,0 @@
-import { fromEquals } from "./Eq.js";
-import { identity } from "./function.js";
-import { not } from "./Predicate.js";
-import { separated } from "./Separated.js";
-var fromSet = function(s) {
-  return new Set(s);
-};
-var singleton = function(a) {
-  return /* @__PURE__ */ new Set([a]);
-};
-var fromReadonlyArray = 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;
-  };
-};
-function toSet(s) {
-  return new Set(s);
-}
-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(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 empty;
-    }
-    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(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);
-  };
-}
-function reduce(O) {
-  var toReadonlyArrayO = toReadonlyArray(O);
-  return function(b, f) {
-    return function(fa) {
-      return toReadonlyArrayO(fa).reduce(f, b);
-    };
-  };
-}
-function foldMap(O, M) {
-  var toReadonlyArrayO = toReadonlyArray(O);
-  return function(f) {
-    return function(fa) {
-      return toReadonlyArrayO(fa).reduce(function(b, a) {
-        return M.concat(b, f(a));
-      }, M.empty);
-    };
-  };
-}
-var reduceRight = function(O) {
-  var toReadonlyArrayO = toReadonlyArray(O);
-  return function(b, f) {
-    return function(fa) {
-      return toReadonlyArrayO(fa).reduceRight(function(b2, a) {
-        return f(a, b2);
-      }, b);
-    };
-  };
-};
-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 compact = function(E) {
-  return filterMap(E)(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(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 = function(predicate) {
-  return function(set) {
-    var values = set.values();
-    var e;
-    var found = false;
-    while (!found && !(e = values.next()).done) {
-      found = predicate(e.value);
-    }
-    return found;
-  };
-};
-function every(predicate) {
-  return not(some(not(predicate)));
-}
-function isSubset(E) {
-  var elemE = elem(E);
-  return function(me, that) {
-    if (that === void 0) {
-      var isSubsetE_1 = isSubset(E);
-      return function(that2) {
-        return isSubsetE_1(that2, me);
-      };
-    }
-    return every(function(a) {
-      return elemE(a, that);
-    })(me);
-  };
-}
-function elem(E) {
-  return function(a, set) {
-    if (set === void 0) {
-      var elemE_1 = elem(E);
-      return function(set2) {
-        return elemE_1(a, set2);
-      };
-    }
-    var values = set.values();
-    var e;
-    var found = false;
-    while (!found && !(e = values.next()).done) {
-      found = E.equals(a, e.value);
-    }
-    return found;
-  };
-}
-var toReadonlyArray = function(O) {
-  return function(set) {
-    var out = [];
-    set.forEach(function(e) {
-      return out.push(e);
-    });
-    return out.sort(O.compare);
-  };
-};
-var URI = "ReadonlySet";
-function getShow(S) {
-  return {
-    show: function(s) {
-      var entries = [];
-      s.forEach(function(a) {
-        entries.push(S.show(a));
-      });
-      return "new Set([".concat(entries.sort().join(", "), "])");
-    }
-  };
-}
-function getEq(E) {
-  var subsetE = isSubset(E);
-  return fromEquals(function(x, y) {
-    return subsetE(x, y) && subsetE(y, x);
-  });
-}
-var getUnionSemigroup = function(E) {
-  return {
-    concat: union(E)
-  };
-};
-var getUnionMonoid = function(E) {
-  return {
-    concat: getUnionSemigroup(E).concat,
-    empty
-  };
-};
-var getIntersectionSemigroup = function(E) {
-  return {
-    concat: intersection(E)
-  };
-};
-var getDifferenceMagma = function(E) {
-  return {
-    concat: difference(E)
-  };
-};
-var fromArray = fromReadonlyArray;
-export {
-  URI,
-  chain,
-  compact,
-  difference,
-  elem,
-  empty,
-  every,
-  filter,
-  filterMap,
-  foldMap,
-  fromArray,
-  fromReadonlyArray,
-  fromSet,
-  getDifferenceMagma,
-  getEq,
-  getIntersectionSemigroup,
-  getShow,
-  getUnionMonoid,
-  getUnionSemigroup,
-  insert,
-  intersection,
-  isEmpty,
-  isSubset,
-  map,
-  partition,
-  partitionMap,
-  reduce,
-  reduceRight,
-  remove,
-  separate,
-  singleton,
-  size,
-  some,
-  toReadonlyArray,
-  toSet,
-  toggle,
-  union
-};
-//# sourceMappingURL=ReadonlySet.js.map

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

@@ -1 +0,0 @@
-{"version":3,"file":"ReadonlySet.js","sources":["../../../../../../node_modules/fp-ts/es6/ReadonlySet.js"],"sourcesContent":["import { fromEquals } from './Eq';\nimport { identity } from './function';\nimport { not } from './Predicate';\nimport { separated } from './Separated';\n/**\n * @category conversions\n * @since 2.5.0\n */\nexport var fromSet = function (s) { return new Set(s); };\n// -------------------------------------------------------------------------------------\n// constructors\n// -------------------------------------------------------------------------------------\n/**\n * Create a set with one element\n *\n * @category constructors\n * @since 2.5.0\n */\nexport var singleton = function (a) { return new Set([a]); };\n/**\n * Create a `ReadonlySet` from a `ReadonlyArray`\n *\n * @category conversions\n * @since 2.10.0\n */\nexport var fromReadonlyArray = 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 * @category conversions\n * @since 2.5.0\n */\nexport function toSet(s) {\n    return new Set(s);\n}\n/**\n * Projects a Set through a function\n *\n * @since 2.5.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 * @since 2.5.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 empty;\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.5.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 * @since 2.5.0\n */\nexport function reduce(O) {\n    var toReadonlyArrayO = toReadonlyArray(O);\n    return function (b, f) { return function (fa) { return toReadonlyArrayO(fa).reduce(f, b); }; };\n}\n/**\n * @since 2.5.0\n */\nexport function foldMap(O, M) {\n    var toReadonlyArrayO = toReadonlyArray(O);\n    return function (f) { return function (fa) { return toReadonlyArrayO(fa).reduce(function (b, a) { return M.concat(b, f(a)); }, M.empty); }; };\n}\n/**\n * @category folding\n * @since 2.11.0\n */\nexport var reduceRight = function (O) {\n    var toReadonlyArrayO = toReadonlyArray(O);\n    return function (b, f) { return function (fa) { return toReadonlyArrayO(fa).reduceRight(function (b, a) { return f(a, b); }, b); }; };\n};\n/**\n * Insert a value into a set\n *\n * @since 2.5.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.5.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.10.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 * @since 2.5.0\n */\nexport var compact = function (E) { return filterMap(E)(identity); };\n/**\n * @since 2.5.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.5.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.5.0\n */\nexport var empty = new Set();\n/**\n * Test whether a `ReadonlySet` 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 `ReadonlySet`.\n *\n * @since 2.10.0\n */\nexport var size = function (set) { return set.size; };\n/**\n * @since 2.5.0\n */\nexport var some = function (predicate) {\n    return function (set) {\n        var values = set.values();\n        var e;\n        var found = false;\n        while (!found && !(e = values.next()).done) {\n            found = predicate(e.value);\n        }\n        return found;\n    };\n};\nexport function every(predicate) {\n    return not(some(not(predicate)));\n}\nexport function isSubset(E) {\n    var elemE = elem(E);\n    return function (me, that) {\n        if (that === undefined) {\n            var isSubsetE_1 = isSubset(E);\n            return function (that) { return isSubsetE_1(that, me); };\n        }\n        return every(function (a) { return elemE(a, that); })(me);\n    };\n}\nexport function elem(E) {\n    return function (a, set) {\n        if (set === undefined) {\n            var elemE_1 = elem(E);\n            return function (set) { return elemE_1(a, set); };\n        }\n        var values = set.values();\n        var e;\n        var found = false;\n        while (!found && !(e = values.next()).done) {\n            found = E.equals(a, e.value);\n        }\n        return found;\n    };\n}\n/**\n * Get a sorted `ReadonlyArray` of the values contained in a `ReadonlySet`.\n *\n * @category conversions\n * @since 2.5.0\n */\nexport var toReadonlyArray = 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 * @category type lambdas\n * @since 2.11.0\n */\nexport var URI = 'ReadonlySet';\n/**\n * @category instances\n * @since 2.5.0\n */\nexport function getShow(S) {\n    return {\n        show: function (s) {\n            var entries = [];\n            s.forEach(function (a) {\n                entries.push(S.show(a));\n            });\n            return \"new Set([\".concat(entries.sort().join(', '), \"])\");\n        }\n    };\n}\n/**\n * @category instances\n * @since 2.5.0\n */\nexport function getEq(E) {\n    var subsetE = isSubset(E);\n    return fromEquals(function (x, y) { return subsetE(x, y) && subsetE(y, x); });\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.5.0\n */\nexport var getUnionMonoid = function (E) { return ({\n    concat: getUnionSemigroup(E).concat,\n    empty: empty\n}); };\n/**\n * @category instances\n * @since 2.5.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// deprecated\n// -------------------------------------------------------------------------------------\n/**\n * Use [`fromReadonlyArray`](#fromreadonlyarray) instead.\n *\n * @category zone of death\n * @since 2.5.0\n * @deprecated\n */\nexport var fromArray = fromReadonlyArray;\n"],"names":["e","that","b","set"],"mappings":";;;;AAQU,IAAC,UAAU,SAAU,GAAG;AAAE,SAAO,IAAI,IAAI,CAAC;AAAK;AAU/C,IAAC,YAAY,SAAU,GAAG;AAAE,SAAO,oBAAI,IAAI,CAAC,CAAC,CAAC;AAAK;AAOnD,IAAC,oBAAoB,SAAU,GAAG;AACxC,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;AAKO,SAAS,MAAM,GAAG;AACrB,SAAO,IAAI,IAAI,CAAC;AACpB;AAMO,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;AAIO,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,SAAUA,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,WAAO,UAAU,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;AAAA,IACV;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,aAAO,UAAU,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,SAAUA,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;AAIO,SAAS,OAAO,GAAG;AACtB,MAAI,mBAAmB,gBAAgB,CAAC;AACxC,SAAO,SAAU,GAAG,GAAG;AAAE,WAAO,SAAU,IAAI;AAAE,aAAO,iBAAiB,EAAE,EAAE,OAAO,GAAG,CAAC;AAAA,IAAE;AAAA,EAAG;AAChG;AAIO,SAAS,QAAQ,GAAG,GAAG;AAC1B,MAAI,mBAAmB,gBAAgB,CAAC;AACxC,SAAO,SAAU,GAAG;AAAE,WAAO,SAAU,IAAI;AAAE,aAAO,iBAAiB,EAAE,EAAE,OAAO,SAAU,GAAG,GAAG;AAAE,eAAO,EAAE,OAAO,GAAG,EAAE,CAAC,CAAC;AAAA,MAAI,GAAE,EAAE,KAAK;AAAA,IAAE;AAAA,EAAG;AAC/I;AAKU,IAAC,cAAc,SAAU,GAAG;AAClC,MAAI,mBAAmB,gBAAgB,CAAC;AACxC,SAAO,SAAU,GAAG,GAAG;AAAE,WAAO,SAAU,IAAI;AAAE,aAAO,iBAAiB,EAAE,EAAE,YAAY,SAAUC,IAAG,GAAG;AAAE,eAAO,EAAE,GAAGA,EAAC;AAAA,MAAE,GAAI,CAAC;AAAA,IAAI;AAAA;AACtI;AAMO,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;AAIU,IAAC,UAAU,SAAU,GAAG;AAAE,SAAO,UAAU,CAAC,EAAE,QAAQ;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,WAAO,UAAU,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,OAAO,SAAU,WAAW;AACnC,SAAO,SAAU,KAAK;AAClB,QAAI,SAAS,IAAI;AACjB,QAAI;AACJ,QAAI,QAAQ;AACZ,WAAO,CAAC,SAAS,EAAE,IAAI,OAAO,KAAM,GAAE,MAAM;AACxC,cAAQ,UAAU,EAAE,KAAK;AAAA,IAC5B;AACD,WAAO;AAAA,EACf;AACA;AACO,SAAS,MAAM,WAAW;AAC7B,SAAO,IAAI,KAAK,IAAI,SAAS,CAAC,CAAC;AACnC;AACO,SAAS,SAAS,GAAG;AACxB,MAAI,QAAQ,KAAK,CAAC;AAClB,SAAO,SAAU,IAAI,MAAM;AACvB,QAAI,SAAS,QAAW;AACpB,UAAI,cAAc,SAAS,CAAC;AAC5B,aAAO,SAAUD,OAAM;AAAE,eAAO,YAAYA,OAAM,EAAE;AAAA;IACvD;AACD,WAAO,MAAM,SAAU,GAAG;AAAE,aAAO,MAAM,GAAG,IAAI;AAAA,IAAE,CAAE,EAAE,EAAE;AAAA,EAChE;AACA;AACO,SAAS,KAAK,GAAG;AACpB,SAAO,SAAU,GAAG,KAAK;AACrB,QAAI,QAAQ,QAAW;AACnB,UAAI,UAAU,KAAK,CAAC;AACpB,aAAO,SAAUE,MAAK;AAAE,eAAO,QAAQ,GAAGA,IAAG;AAAA;IAChD;AACD,QAAI,SAAS,IAAI;AACjB,QAAI;AACJ,QAAI,QAAQ;AACZ,WAAO,CAAC,SAAS,EAAE,IAAI,OAAO,KAAM,GAAE,MAAM;AACxC,cAAQ,EAAE,OAAO,GAAG,EAAE,KAAK;AAAA,IAC9B;AACD,WAAO;AAAA,EACf;AACA;AAOU,IAAC,kBAAkB,SAAU,GAAG;AACtC,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;AAKU,IAAC,MAAM;AAKV,SAAS,QAAQ,GAAG;AACvB,SAAO;AAAA,IACH,MAAM,SAAU,GAAG;AACf,UAAI,UAAU,CAAA;AACd,QAAE,QAAQ,SAAU,GAAG;AACnB,gBAAQ,KAAK,EAAE,KAAK,CAAC,CAAC;AAAA,MACtC,CAAa;AACD,aAAO,YAAY,OAAO,QAAQ,KAAM,EAAC,KAAK,IAAI,GAAG,IAAI;AAAA,IAC5D;AAAA,EACT;AACA;AAKO,SAAS,MAAM,GAAG;AACrB,MAAI,UAAU,SAAS,CAAC;AACxB,SAAO,WAAW,SAAU,GAAG,GAAG;AAAE,WAAO,QAAQ,GAAG,CAAC,KAAK,QAAQ,GAAG,CAAC;AAAA,EAAI,CAAA;AAChF;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;AAAA,EACJ;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;AAWI,IAAC,YAAY;","x_google_ignoreList":[0]}

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

@@ -1,261 +0,0 @@
-"use strict";
-Object.defineProperty(exports, Symbol.toStringTag, { value: "Module" });
-const _function = require("./function.cjs");
-const Functor$1 = require("./Functor.cjs");
-function fst(ea) {
-  return ea[0];
-}
-function snd(ea) {
-  return ea[1];
-}
-var swap = function(ea) {
-  return [snd(ea), fst(ea)];
-};
-function getApply(S) {
-  return {
-    URI,
-    _E: void 0,
-    map: _map,
-    ap: function(fab, fa) {
-      return [fst(fab)(fst(fa)), S.concat(snd(fab), snd(fa))];
-    }
-  };
-}
-var of = function(M) {
-  return function(a) {
-    return [a, M.empty];
-  };
-};
-function getApplicative(M) {
-  var A = getApply(M);
-  return {
-    URI,
-    _E: void 0,
-    map: _map,
-    ap: A.ap,
-    of: of(M)
-  };
-}
-function getChain(S) {
-  var A = getApply(S);
-  return {
-    URI,
-    _E: void 0,
-    map: _map,
-    ap: A.ap,
-    chain: function(ma, f) {
-      var _a = f(fst(ma)), b = _a[0], s = _a[1];
-      return [b, S.concat(snd(ma), s)];
-    }
-  };
-}
-function getMonad(M) {
-  var C = getChain(M);
-  return {
-    URI,
-    _E: void 0,
-    map: _map,
-    ap: C.ap,
-    chain: C.chain,
-    of: of(M)
-  };
-}
-function getChainRec(M) {
-  var chainRec = function(a, f) {
-    var result = f(a);
-    var acc = M.empty;
-    var s = fst(result);
-    while (s._tag === "Left") {
-      acc = M.concat(acc, snd(result));
-      result = f(s.left);
-      s = fst(result);
-    }
-    return [s.right, M.concat(acc, snd(result))];
-  };
-  var C = getChain(M);
-  return {
-    URI,
-    _E: void 0,
-    map: _map,
-    ap: C.ap,
-    chain: C.chain,
-    chainRec
-  };
-}
-var _compose = function(bc, ab) {
-  return _function.pipe(bc, compose(ab));
-};
-var _map = function(fa, f) {
-  return _function.pipe(fa, mapFst(f));
-};
-var _bimap = function(fa, f, g) {
-  return _function.pipe(fa, bimap(f, g));
-};
-var _mapLeft = function(fa, f) {
-  return _function.pipe(fa, mapSnd(f));
-};
-var _extend = function(wa, f) {
-  return _function.pipe(wa, extend(f));
-};
-var _reduce = function(fa, b, f) {
-  return _function.pipe(fa, reduce(b, f));
-};
-var _foldMap = function(M) {
-  var foldMapM = foldMap();
-  return function(fa, f) {
-    return _function.pipe(fa, foldMapM(f));
-  };
-};
-var _reduceRight = function(fa, b, f) {
-  return _function.pipe(fa, reduceRight(b, f));
-};
-var _traverse = function(F) {
-  var traverseF = traverse(F);
-  return function(ta, f) {
-    return _function.pipe(ta, traverseF(f));
-  };
-};
-var bimap = function(f, g) {
-  return function(fa) {
-    return [g(fst(fa)), f(snd(fa))];
-  };
-};
-var mapFst = function(f) {
-  return function(fa) {
-    return [f(fst(fa)), snd(fa)];
-  };
-};
-var mapSnd = function(f) {
-  return function(fa) {
-    return [fst(fa), f(snd(fa))];
-  };
-};
-var compose = function(ab) {
-  return function(bc) {
-    return [fst(bc), snd(ab)];
-  };
-};
-var extend = function(f) {
-  return function(wa) {
-    return [f(wa), snd(wa)];
-  };
-};
-var extract = fst;
-var duplicate = /* @__PURE__ */ extend(_function.identity);
-var reduce = function(b, f) {
-  return function(fa) {
-    return f(b, fst(fa));
-  };
-};
-var foldMap = function() {
-  return function(f) {
-    return function(fa) {
-      return f(fst(fa));
-    };
-  };
-};
-var reduceRight = function(b, f) {
-  return function(fa) {
-    return f(fst(fa), b);
-  };
-};
-var traverse = function(F) {
-  return function(f) {
-    return function(ta) {
-      return F.map(f(fst(ta)), function(b) {
-        return [b, snd(ta)];
-      });
-    };
-  };
-};
-var sequence = function(F) {
-  return function(fas) {
-    return F.map(fst(fas), function(a) {
-      return [a, snd(fas)];
-    });
-  };
-};
-var URI = "ReadonlyTuple";
-var Functor = {
-  URI,
-  map: _map
-};
-var flap = /* @__PURE__ */ Functor$1.flap(Functor);
-var map = mapFst;
-var mapLeft = mapSnd;
-var Bifunctor = {
-  URI,
-  bimap: _bimap,
-  mapLeft: _mapLeft
-};
-var Semigroupoid = {
-  URI,
-  compose: _compose
-};
-var Comonad = {
-  URI,
-  map: _map,
-  extend: _extend,
-  extract
-};
-var Foldable = {
-  URI,
-  reduce: _reduce,
-  foldMap: _foldMap,
-  reduceRight: _reduceRight
-};
-var Traversable = {
-  URI,
-  map: _map,
-  reduce: _reduce,
-  foldMap: _foldMap,
-  reduceRight: _reduceRight,
-  traverse: _traverse,
-  sequence
-};
-var readonlyTuple = {
-  URI,
-  compose: _compose,
-  map: _map,
-  bimap: _bimap,
-  mapLeft: _mapLeft,
-  extract,
-  extend: _extend,
-  reduce: _reduce,
-  foldMap: _foldMap,
-  reduceRight: _reduceRight,
-  traverse: _traverse,
-  sequence
-};
-exports.Bifunctor = Bifunctor;
-exports.Comonad = Comonad;
-exports.Foldable = Foldable;
-exports.Functor = Functor;
-exports.Semigroupoid = Semigroupoid;
-exports.Traversable = Traversable;
-exports.URI = URI;
-exports.bimap = bimap;
-exports.compose = compose;
-exports.duplicate = duplicate;
-exports.extend = extend;
-exports.extract = extract;
-exports.flap = flap;
-exports.foldMap = foldMap;
-exports.fst = fst;
-exports.getApplicative = getApplicative;
-exports.getApply = getApply;
-exports.getChain = getChain;
-exports.getChainRec = getChainRec;
-exports.getMonad = getMonad;
-exports.map = map;
-exports.mapFst = mapFst;
-exports.mapLeft = mapLeft;
-exports.mapSnd = mapSnd;
-exports.readonlyTuple = readonlyTuple;
-exports.reduce = reduce;
-exports.reduceRight = reduceRight;
-exports.sequence = sequence;
-exports.snd = snd;
-exports.swap = swap;
-exports.traverse = traverse;
-//# sourceMappingURL=ReadonlyTuple.cjs.map