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

@@ -0,0 +1,327 @@
+import { identity } from "./function.js";
+import { getShow as getShow$1, getEq as getEq$1, reduce as reduce$1, foldMap as foldMap$1, reduceRight as reduceRight$1, some as some$1, every as every$1, isSubset as isSubset$1, elem as elem$1 } from "./ReadonlySet.js";
+import { separated } from "./Separated.js";
+var getShow = getShow$1;
+var getEq = getEq$1;
+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 /* @__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(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 = reduce$1;
+var foldMap = foldMap$1;
+var reduceRight = reduceRight$1;
+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)(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 = some$1;
+var every = every$1;
+var isSubset = isSubset$1;
+var elem = elem$1;
+var toArray = function(O) {
+  return function(set) {
+    var out = [];
+    set.forEach(function(e) {
+      return out.push(e);
+    });
+    return out.sort(O.compare);
+  };
+};
+var subset = isSubset$1;
+export {
+  chain,
+  compact,
+  difference,
+  elem,
+  empty,
+  every,
+  filter,
+  filterMap,
+  foldMap,
+  fromArray,
+  getDifferenceMagma,
+  getEq,
+  getIntersectionSemigroup,
+  getShow,
+  getUnionMonoid,
+  getUnionSemigroup,
+  insert,
+  intersection,
+  isEmpty,
+  isSubset,
+  map,
+  partition,
+  partitionMap,
+  reduce,
+  reduceRight,
+  remove,
+  separate,
+  singleton,
+  size,
+  some,
+  subset,
+  toArray,
+  toggle,
+  union
+};
+//# sourceMappingURL=Set.js.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"Set.js","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","that","RS.reduce","RS.foldMap","RS.reduceRight","RS.some","RS.every","RS.isSubset","RS.elem"],"mappings":";;;AAOU,IAAC,UAAUA;AAKX,IAAC,QAAQC;AAOZ,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,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,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,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;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;AAKV,IAAC,UAAUC;AAKX,IAAC,cAAcC;AAOf,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,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,OAAOC;AAIR,IAAC,QAAQC;AAIT,IAAC,WAAWC;AAOZ,IAAC,OAAOC;AAOR,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;","x_google_ignoreList":[0]}

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

@@ -0,0 +1,58 @@
+"use strict";
+Object.defineProperty(exports, Symbol.toStringTag, { value: "Module" });
+const internal = require("./internal.cjs");
+var struct = function(shows) {
+  return {
+    show: function(a) {
+      var s = "{";
+      for (var k in shows) {
+        if (internal.has.call(shows, k)) {
+          s += " ".concat(k, ": ").concat(shows[k].show(a[k]), ",");
+        }
+      }
+      if (s.length > 1) {
+        s = s.slice(0, -1) + " ";
+      }
+      s += "}";
+      return s;
+    }
+  };
+};
+var tuple = function() {
+  var shows = [];
+  for (var _i = 0; _i < arguments.length; _i++) {
+    shows[_i] = arguments[_i];
+  }
+  return {
+    show: function(t) {
+      return "[".concat(t.map(function(a, i) {
+        return shows[i].show(a);
+      }).join(", "), "]");
+    }
+  };
+};
+var getTupleShow = tuple;
+var getStructShow = struct;
+var showBoolean = {
+  show: function(a) {
+    return JSON.stringify(a);
+  }
+};
+var showString = {
+  show: function(a) {
+    return JSON.stringify(a);
+  }
+};
+var showNumber = {
+  show: function(a) {
+    return JSON.stringify(a);
+  }
+};
+exports.getStructShow = getStructShow;
+exports.getTupleShow = getTupleShow;
+exports.showBoolean = showBoolean;
+exports.showNumber = showNumber;
+exports.showString = showString;
+exports.struct = struct;
+exports.tuple = tuple;
+//# sourceMappingURL=Show.cjs.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"Show.cjs","sources":["../../../../../../node_modules/fp-ts/es6/Show.js"],"sourcesContent":["/**\n * The `Show` type class represents those types which can be converted into\n * a human-readable `string` representation.\n *\n * While not required, it is recommended that for any expression `x`, the\n * string `show(x)` be executable TypeScript code which evaluates to the same\n * value as the expression `x`.\n *\n * @since 2.0.0\n */\nimport * as _ from './internal';\n// -------------------------------------------------------------------------------------\n// combinators\n// -------------------------------------------------------------------------------------\n/**\n * @since 2.10.0\n */\nexport var struct = function (shows) { return ({\n    show: function (a) {\n        var s = '{';\n        for (var k in shows) {\n            if (_.has.call(shows, k)) {\n                s += \" \".concat(k, \": \").concat(shows[k].show(a[k]), \",\");\n            }\n        }\n        if (s.length > 1) {\n            s = s.slice(0, -1) + ' ';\n        }\n        s += '}';\n        return s;\n    }\n}); };\n/**\n * @since 2.10.0\n */\nexport var tuple = function () {\n    var shows = [];\n    for (var _i = 0; _i < arguments.length; _i++) {\n        shows[_i] = arguments[_i];\n    }\n    return ({\n        show: function (t) { return \"[\".concat(t.map(function (a, i) { return shows[i].show(a); }).join(', '), \"]\"); }\n    });\n};\n// -------------------------------------------------------------------------------------\n// deprecated\n// -------------------------------------------------------------------------------------\n/**\n * Use [`tuple`](#tuple) instead.\n *\n * @category zone of death\n * @since 2.0.0\n * @deprecated\n */\nexport var getTupleShow = tuple;\n/**\n * Use [`struct`](#struct) instead.\n *\n * @category zone of death\n * @since 2.0.0\n * @deprecated\n */\nexport var getStructShow = struct;\n/**\n * Use [`Show`](./boolean.ts.html#show) instead.\n *\n * @category zone of death\n * @since 2.0.0\n * @deprecated\n */\nexport var showBoolean = {\n    show: function (a) { return JSON.stringify(a); }\n};\n/**\n * Use [`Show`](./string.ts.html#show) instead.\n *\n * @category zone of death\n * @since 2.0.0\n * @deprecated\n */\nexport var showString = {\n    show: function (a) { return JSON.stringify(a); }\n};\n/**\n * Use [`Show`](./number.ts.html#show) instead.\n *\n * @category zone of death\n * @since 2.0.0\n * @deprecated\n */\nexport var showNumber = {\n    show: function (a) { return JSON.stringify(a); }\n};\n"],"names":["_.has"],"mappings":";;;AAiBU,IAAC,SAAS,SAAU,OAAO;AAAE,SAAQ;AAAA,IAC3C,MAAM,SAAU,GAAG;AACf,UAAI,IAAI;AACR,eAAS,KAAK,OAAO;AACjB,YAAIA,aAAM,KAAK,OAAO,CAAC,GAAG;AACtB,eAAK,IAAI,OAAO,GAAG,IAAI,EAAE,OAAO,MAAM,CAAC,EAAE,KAAK,EAAE,CAAC,CAAC,GAAG,GAAG;AAAA,QAC3D;AAAA,MACJ;AACD,UAAI,EAAE,SAAS,GAAG;AACd,YAAI,EAAE,MAAM,GAAG,EAAE,IAAI;AAAA,MACxB;AACD,WAAK;AACL,aAAO;AAAA,IACV;AAAA,EACL;AAAM;AAII,IAAC,QAAQ,WAAY;AAC3B,MAAI,QAAQ,CAAA;AACZ,WAAS,KAAK,GAAG,KAAK,UAAU,QAAQ,MAAM;AAC1C,UAAM,EAAE,IAAI,UAAU,EAAE;AAAA,EAC3B;AACD,SAAQ;AAAA,IACJ,MAAM,SAAU,GAAG;AAAE,aAAO,IAAI,OAAO,EAAE,IAAI,SAAU,GAAG,GAAG;AAAE,eAAO,MAAM,CAAC,EAAE,KAAK,CAAC;AAAA,MAAE,CAAE,EAAE,KAAK,IAAI,GAAG,GAAG;AAAA,IAAI;AAAA,EACtH;AACA;AAWU,IAAC,eAAe;AAQhB,IAAC,gBAAgB;AAQjB,IAAC,cAAc;AAAA,EACrB,MAAM,SAAU,GAAG;AAAE,WAAO,KAAK,UAAU,CAAC;AAAA,EAAI;AACpD;AAQU,IAAC,aAAa;AAAA,EACpB,MAAM,SAAU,GAAG;AAAE,WAAO,KAAK,UAAU,CAAC;AAAA,EAAI;AACpD;AAQU,IAAC,aAAa;AAAA,EACpB,MAAM,SAAU,GAAG;AAAE,WAAO,KAAK,UAAU,CAAC;AAAA,EAAI;AACpD;;;;;;;;","x_google_ignoreList":[0]}

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

@@ -0,0 +1,58 @@
+import { has } from "./internal.js";
+var struct = function(shows) {
+  return {
+    show: function(a) {
+      var s = "{";
+      for (var k in shows) {
+        if (has.call(shows, k)) {
+          s += " ".concat(k, ": ").concat(shows[k].show(a[k]), ",");
+        }
+      }
+      if (s.length > 1) {
+        s = s.slice(0, -1) + " ";
+      }
+      s += "}";
+      return s;
+    }
+  };
+};
+var tuple = function() {
+  var shows = [];
+  for (var _i = 0; _i < arguments.length; _i++) {
+    shows[_i] = arguments[_i];
+  }
+  return {
+    show: function(t) {
+      return "[".concat(t.map(function(a, i) {
+        return shows[i].show(a);
+      }).join(", "), "]");
+    }
+  };
+};
+var getTupleShow = tuple;
+var getStructShow = struct;
+var showBoolean = {
+  show: function(a) {
+    return JSON.stringify(a);
+  }
+};
+var showString = {
+  show: function(a) {
+    return JSON.stringify(a);
+  }
+};
+var showNumber = {
+  show: function(a) {
+    return JSON.stringify(a);
+  }
+};
+export {
+  getStructShow,
+  getTupleShow,
+  showBoolean,
+  showNumber,
+  showString,
+  struct,
+  tuple
+};
+//# sourceMappingURL=Show.js.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"Show.js","sources":["../../../../../../node_modules/fp-ts/es6/Show.js"],"sourcesContent":["/**\n * The `Show` type class represents those types which can be converted into\n * a human-readable `string` representation.\n *\n * While not required, it is recommended that for any expression `x`, the\n * string `show(x)` be executable TypeScript code which evaluates to the same\n * value as the expression `x`.\n *\n * @since 2.0.0\n */\nimport * as _ from './internal';\n// -------------------------------------------------------------------------------------\n// combinators\n// -------------------------------------------------------------------------------------\n/**\n * @since 2.10.0\n */\nexport var struct = function (shows) { return ({\n    show: function (a) {\n        var s = '{';\n        for (var k in shows) {\n            if (_.has.call(shows, k)) {\n                s += \" \".concat(k, \": \").concat(shows[k].show(a[k]), \",\");\n            }\n        }\n        if (s.length > 1) {\n            s = s.slice(0, -1) + ' ';\n        }\n        s += '}';\n        return s;\n    }\n}); };\n/**\n * @since 2.10.0\n */\nexport var tuple = function () {\n    var shows = [];\n    for (var _i = 0; _i < arguments.length; _i++) {\n        shows[_i] = arguments[_i];\n    }\n    return ({\n        show: function (t) { return \"[\".concat(t.map(function (a, i) { return shows[i].show(a); }).join(', '), \"]\"); }\n    });\n};\n// -------------------------------------------------------------------------------------\n// deprecated\n// -------------------------------------------------------------------------------------\n/**\n * Use [`tuple`](#tuple) instead.\n *\n * @category zone of death\n * @since 2.0.0\n * @deprecated\n */\nexport var getTupleShow = tuple;\n/**\n * Use [`struct`](#struct) instead.\n *\n * @category zone of death\n * @since 2.0.0\n * @deprecated\n */\nexport var getStructShow = struct;\n/**\n * Use [`Show`](./boolean.ts.html#show) instead.\n *\n * @category zone of death\n * @since 2.0.0\n * @deprecated\n */\nexport var showBoolean = {\n    show: function (a) { return JSON.stringify(a); }\n};\n/**\n * Use [`Show`](./string.ts.html#show) instead.\n *\n * @category zone of death\n * @since 2.0.0\n * @deprecated\n */\nexport var showString = {\n    show: function (a) { return JSON.stringify(a); }\n};\n/**\n * Use [`Show`](./number.ts.html#show) instead.\n *\n * @category zone of death\n * @since 2.0.0\n * @deprecated\n */\nexport var showNumber = {\n    show: function (a) { return JSON.stringify(a); }\n};\n"],"names":["_.has"],"mappings":";AAiBU,IAAC,SAAS,SAAU,OAAO;AAAE,SAAQ;AAAA,IAC3C,MAAM,SAAU,GAAG;AACf,UAAI,IAAI;AACR,eAAS,KAAK,OAAO;AACjB,YAAIA,IAAM,KAAK,OAAO,CAAC,GAAG;AACtB,eAAK,IAAI,OAAO,GAAG,IAAI,EAAE,OAAO,MAAM,CAAC,EAAE,KAAK,EAAE,CAAC,CAAC,GAAG,GAAG;AAAA,QAC3D;AAAA,MACJ;AACD,UAAI,EAAE,SAAS,GAAG;AACd,YAAI,EAAE,MAAM,GAAG,EAAE,IAAI;AAAA,MACxB;AACD,WAAK;AACL,aAAO;AAAA,IACV;AAAA,EACL;AAAM;AAII,IAAC,QAAQ,WAAY;AAC3B,MAAI,QAAQ,CAAA;AACZ,WAAS,KAAK,GAAG,KAAK,UAAU,QAAQ,MAAM;AAC1C,UAAM,EAAE,IAAI,UAAU,EAAE;AAAA,EAC3B;AACD,SAAQ;AAAA,IACJ,MAAM,SAAU,GAAG;AAAE,aAAO,IAAI,OAAO,EAAE,IAAI,SAAU,GAAG,GAAG;AAAE,eAAO,MAAM,CAAC,EAAE,KAAK,CAAC;AAAA,MAAE,CAAE,EAAE,KAAK,IAAI,GAAG,GAAG;AAAA,IAAI;AAAA,EACtH;AACA;AAWU,IAAC,eAAe;AAQhB,IAAC,gBAAgB;AAQjB,IAAC,cAAc;AAAA,EACrB,MAAM,SAAU,GAAG;AAAE,WAAO,KAAK,UAAU,CAAC;AAAA,EAAI;AACpD;AAQU,IAAC,aAAa;AAAA,EACpB,MAAM,SAAU,GAAG;AAAE,WAAO,KAAK,UAAU,CAAC;AAAA,EAAI;AACpD;AAQU,IAAC,aAAa;AAAA,EACpB,MAAM,SAAU,GAAG;AAAE,WAAO,KAAK,UAAU,CAAC;AAAA,EAAI;AACpD;","x_google_ignoreList":[0]}

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

@@ -0,0 +1,192 @@
+"use strict";
+Object.defineProperty(exports, Symbol.toStringTag, { value: "Module" });
+const Apply$1 = require("./Apply.cjs");
+const Chain$1 = require("./Chain.cjs");
+const _function = require("./function.cjs");
+const Functor$1 = require("./Functor.cjs");
+const internal = require("./internal.cjs");
+var get = function() {
+  return function(s) {
+    return [s, s];
+  };
+};
+var put = function(s) {
+  return function() {
+    return [void 0, s];
+  };
+};
+var modify = function(f) {
+  return function(s) {
+    return [void 0, f(s)];
+  };
+};
+var gets = function(f) {
+  return function(s) {
+    return [f(s), s];
+  };
+};
+var _map = function(fa, f) {
+  return _function.pipe(fa, map(f));
+};
+var _ap = function(fab, fa) {
+  return _function.pipe(fab, ap(fa));
+};
+var map = function(f) {
+  return function(fa) {
+    return function(s1) {
+      var _a = fa(s1), a = _a[0], s2 = _a[1];
+      return [f(a), s2];
+    };
+  };
+};
+var ap = function(fa) {
+  return function(fab) {
+    return function(s1) {
+      var _a = fab(s1), f = _a[0], s2 = _a[1];
+      var _b = fa(s2), a = _b[0], s3 = _b[1];
+      return [f(a), s3];
+    };
+  };
+};
+var of = function(a) {
+  return function(s) {
+    return [a, s];
+  };
+};
+var flatMap = /* @__PURE__ */ _function.dual(2, function(ma, f) {
+  return function(s1) {
+    var _a = ma(s1), a = _a[0], s2 = _a[1];
+    return f(a)(s2);
+  };
+});
+var flatten = /* @__PURE__ */ flatMap(_function.identity);
+var URI = "State";
+var Functor = {
+  URI,
+  map: _map
+};
+var flap = /* @__PURE__ */ Functor$1.flap(Functor);
+var Pointed = {
+  URI,
+  of
+};
+var Apply = {
+  URI,
+  map: _map,
+  ap: _ap
+};
+var apFirst = /* @__PURE__ */ Apply$1.apFirst(Apply);
+var apSecond = /* @__PURE__ */ Apply$1.apSecond(Apply);
+var Applicative = {
+  URI,
+  map: _map,
+  ap: _ap,
+  of
+};
+var Chain = {
+  URI,
+  map: _map,
+  ap: _ap,
+  chain: flatMap
+};
+var Monad = {
+  URI,
+  map: _map,
+  ap: _ap,
+  of,
+  chain: flatMap
+};
+var tap = /* @__PURE__ */ _function.dual(2, Chain$1.tap(Chain));
+var FromState = {
+  URI,
+  fromState: _function.identity
+};
+var evaluate = function(s) {
+  return function(ma) {
+    return ma(s)[0];
+  };
+};
+var execute = function(s) {
+  return function(ma) {
+    return ma(s)[1];
+  };
+};
+var bindTo = /* @__PURE__ */ Functor$1.bindTo(Functor);
+var let_ = /* @__PURE__ */ Functor$1.let(Functor);
+var bind = /* @__PURE__ */ Chain$1.bind(Chain);
+var apS = /* @__PURE__ */ Apply$1.apS(Apply);
+var traverseReadonlyNonEmptyArrayWithIndex = function(f) {
+  return function(as) {
+    return function(s) {
+      var _a = f(0, internal.head(as))(s), b = _a[0], s2 = _a[1];
+      var bs = [b];
+      var out = s2;
+      for (var i = 1; i < as.length; i++) {
+        var _b = f(i, as[i])(out), b_1 = _b[0], s2_1 = _b[1];
+        bs.push(b_1);
+        out = s2_1;
+      }
+      return [bs, out];
+    };
+  };
+};
+var traverseReadonlyArrayWithIndex = function(f) {
+  var g = traverseReadonlyNonEmptyArrayWithIndex(f);
+  return function(as) {
+    return internal.isNonEmpty(as) ? g(as) : of(internal.emptyReadonlyArray);
+  };
+};
+var traverseArrayWithIndex = traverseReadonlyArrayWithIndex;
+var traverseArray = function(f) {
+  return traverseReadonlyArrayWithIndex(function(_, a) {
+    return f(a);
+  });
+};
+var sequenceArray = /* @__PURE__ */ traverseArray(_function.identity);
+var chain = flatMap;
+var chainFirst = tap;
+var evalState = function(ma, s) {
+  return ma(s)[0];
+};
+var execState = function(ma, s) {
+  return ma(s)[1];
+};
+var state = Monad;
+exports.Applicative = Applicative;
+exports.Apply = Apply;
+exports.Chain = Chain;
+exports.FromState = FromState;
+exports.Functor = Functor;
+exports.Monad = Monad;
+exports.Pointed = Pointed;
+exports.URI = URI;
+exports.ap = ap;
+exports.apFirst = apFirst;
+exports.apS = apS;
+exports.apSecond = apSecond;
+exports.bind = bind;
+exports.bindTo = bindTo;
+exports.chain = chain;
+exports.chainFirst = chainFirst;
+exports.evalState = evalState;
+exports.evaluate = evaluate;
+exports.execState = execState;
+exports.execute = execute;
+exports.flap = flap;
+exports.flatMap = flatMap;
+exports.flatten = flatten;
+exports.get = get;
+exports.gets = gets;
+exports.let = let_;
+exports.map = map;
+exports.modify = modify;
+exports.of = of;
+exports.put = put;
+exports.sequenceArray = sequenceArray;
+exports.state = state;
+exports.tap = tap;
+exports.traverseArray = traverseArray;
+exports.traverseArrayWithIndex = traverseArrayWithIndex;
+exports.traverseReadonlyArrayWithIndex = traverseReadonlyArrayWithIndex;
+exports.traverseReadonlyNonEmptyArrayWithIndex = traverseReadonlyNonEmptyArrayWithIndex;
+//# sourceMappingURL=State.cjs.map