@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/These.cjs

@@ -0,0 +1,385 @@
+"use strict";
+Object.defineProperty(exports, Symbol.toStringTag, { value: "Module" });
+const Eq = require("./Eq.cjs");
+const FromEither$1 = require("./FromEither.cjs");
+const _function = require("./function.cjs");
+const Functor$1 = require("./Functor.cjs");
+const internal = require("./internal.cjs");
+var isLeft = function(fa) {
+  return fa._tag === "Left";
+};
+var isRight = function(fa) {
+  return fa._tag === "Right";
+};
+function isBoth(fa) {
+  return fa._tag === "Both";
+}
+function left(left2) {
+  return { _tag: "Left", left: left2 };
+}
+function right(right2) {
+  return { _tag: "Right", right: right2 };
+}
+function both(left2, right2) {
+  return { _tag: "Both", left: left2, right: right2 };
+}
+var matchW = function(onLeft, onRight, onBoth) {
+  return function(fa) {
+    switch (fa._tag) {
+      case "Left":
+        return onLeft(fa.left);
+      case "Right":
+        return onRight(fa.right);
+      case "Both":
+        return onBoth(fa.left, fa.right);
+    }
+  };
+};
+var foldW = matchW;
+var match = matchW;
+var fold = match;
+var swap = match(right, left, function(e, a) {
+  return both(a, e);
+});
+function getShow(SE, SA) {
+  return {
+    show: match(function(l) {
+      return "left(".concat(SE.show(l), ")");
+    }, function(a) {
+      return "right(".concat(SA.show(a), ")");
+    }, function(l, a) {
+      return "both(".concat(SE.show(l), ", ").concat(SA.show(a), ")");
+    })
+  };
+}
+function getEq(EE, EA) {
+  return Eq.fromEquals(function(x, y) {
+    return isLeft(x) ? isLeft(y) && EE.equals(x.left, y.left) : isRight(x) ? isRight(y) && EA.equals(x.right, y.right) : isBoth(y) && EE.equals(x.left, y.left) && EA.equals(x.right, y.right);
+  });
+}
+function getSemigroup(SE, SA) {
+  return {
+    concat: function(x, y) {
+      return isLeft(x) ? isLeft(y) ? left(SE.concat(x.left, y.left)) : isRight(y) ? both(x.left, y.right) : both(SE.concat(x.left, y.left), y.right) : isRight(x) ? isLeft(y) ? both(y.left, x.right) : isRight(y) ? right(SA.concat(x.right, y.right)) : both(y.left, SA.concat(x.right, y.right)) : isLeft(y) ? both(SE.concat(x.left, y.left), x.right) : isRight(y) ? both(x.left, SA.concat(x.right, y.right)) : both(SE.concat(x.left, y.left), SA.concat(x.right, y.right));
+    }
+  };
+}
+var getApply = function(S) {
+  return {
+    URI,
+    _E: void 0,
+    map: _map,
+    ap: function(fab, fa) {
+      return isLeft(fab) ? isLeft(fa) ? left(S.concat(fab.left, fa.left)) : isRight(fa) ? left(fab.left) : left(S.concat(fab.left, fa.left)) : isRight(fab) ? isLeft(fa) ? left(fa.left) : isRight(fa) ? right(fab.right(fa.right)) : both(fa.left, fab.right(fa.right)) : isLeft(fa) ? left(S.concat(fab.left, fa.left)) : isRight(fa) ? both(fab.left, fab.right(fa.right)) : both(S.concat(fab.left, fa.left), fab.right(fa.right));
+    }
+  };
+};
+function getApplicative(S) {
+  var A = getApply(S);
+  return {
+    URI,
+    _E: void 0,
+    map: _map,
+    ap: A.ap,
+    of
+  };
+}
+function getChain(S) {
+  var A = getApply(S);
+  var chain = function(ma, f) {
+    if (isLeft(ma)) {
+      return ma;
+    }
+    if (isRight(ma)) {
+      return f(ma.right);
+    }
+    var fb = f(ma.right);
+    return isLeft(fb) ? left(S.concat(ma.left, fb.left)) : isRight(fb) ? both(ma.left, fb.right) : both(S.concat(ma.left, fb.left), fb.right);
+  };
+  return {
+    URI,
+    _E: void 0,
+    map: _map,
+    ap: A.ap,
+    chain
+  };
+}
+function getMonad(S) {
+  var C = getChain(S);
+  return {
+    URI,
+    _E: void 0,
+    map: _map,
+    of,
+    ap: C.ap,
+    chain: C.chain,
+    throwError: left
+  };
+}
+function getLeft(fa) {
+  return isLeft(fa) ? internal.some(fa.left) : isRight(fa) ? internal.none : internal.some(fa.left);
+}
+function getRight(fa) {
+  return isLeft(fa) ? internal.none : isRight(fa) ? internal.some(fa.right) : internal.some(fa.right);
+}
+function leftOrBoth(e) {
+  return function(ma) {
+    return internal.isNone(ma) ? left(e) : both(e, ma.value);
+  };
+}
+function rightOrBoth(a) {
+  return function(me) {
+    return internal.isNone(me) ? right(a) : both(me.value, a);
+  };
+}
+function getLeftOnly(fa) {
+  return isLeft(fa) ? internal.some(fa.left) : internal.none;
+}
+function getRightOnly(fa) {
+  return isRight(fa) ? internal.some(fa.right) : internal.none;
+}
+var fromOptions = function(fe, fa) {
+  return internal.isNone(fe) ? internal.isNone(fa) ? internal.none : internal.some(right(fa.value)) : internal.isNone(fa) ? internal.some(left(fe.value)) : internal.some(both(fe.value, fa.value));
+};
+var _map = function(fa, f) {
+  return _function.pipe(fa, map(f));
+};
+var _bimap = function(fa, f, g) {
+  return _function.pipe(fa, bimap(f, g));
+};
+var _mapLeft = function(fa, f) {
+  return _function.pipe(fa, mapLeft(f));
+};
+var _reduce = function(fa, b, f) {
+  return _function.pipe(fa, reduce(b, f));
+};
+var _foldMap = function(M) {
+  var foldMapM = foldMap(M);
+  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 isLeft(fa) ? left(f(fa.left)) : isRight(fa) ? right(g(fa.right)) : both(f(fa.left), g(fa.right));
+  };
+};
+var mapLeft = function(f) {
+  return function(fa) {
+    return isLeft(fa) ? left(f(fa.left)) : isBoth(fa) ? both(f(fa.left), fa.right) : fa;
+  };
+};
+var map = function(f) {
+  return function(fa) {
+    return isLeft(fa) ? fa : isRight(fa) ? right(f(fa.right)) : both(fa.left, f(fa.right));
+  };
+};
+var reduce = function(b, f) {
+  return function(fa) {
+    return isLeft(fa) ? b : f(b, fa.right);
+  };
+};
+var foldMap = function(M) {
+  return function(f) {
+    return function(fa) {
+      return isLeft(fa) ? M.empty : f(fa.right);
+    };
+  };
+};
+var reduceRight = function(b, f) {
+  return function(fa) {
+    return isLeft(fa) ? b : f(fa.right, b);
+  };
+};
+var traverse = function(F) {
+  return function(f) {
+    return function(ta) {
+      return isLeft(ta) ? F.of(ta) : isRight(ta) ? F.map(f(ta.right), right) : F.map(f(ta.right), function(b) {
+        return both(ta.left, b);
+      });
+    };
+  };
+};
+var sequence = function(F) {
+  return function(ta) {
+    return isLeft(ta) ? F.of(ta) : isRight(ta) ? F.map(ta.right, right) : F.map(ta.right, function(b) {
+      return both(ta.left, b);
+    });
+  };
+};
+var of = right;
+var URI = "These";
+var Functor = {
+  URI,
+  map: _map
+};
+var flap = /* @__PURE__ */ Functor$1.flap(Functor);
+var Pointed = {
+  URI,
+  of
+};
+var Bifunctor = {
+  URI,
+  bimap: _bimap,
+  mapLeft: _mapLeft
+};
+var FromThese = {
+  URI,
+  fromThese: _function.identity
+};
+var Foldable = {
+  URI,
+  reduce: _reduce,
+  foldMap: _foldMap,
+  reduceRight: _reduceRight
+};
+var Traversable = {
+  URI,
+  map: _map,
+  reduce: _reduce,
+  foldMap: _foldMap,
+  reduceRight: _reduceRight,
+  traverse: _traverse,
+  sequence
+};
+var FromEither = {
+  URI,
+  fromEither: _function.identity
+};
+var fromPredicate = /* @__PURE__ */ FromEither$1.fromPredicate(FromEither);
+var fromOption = /* @__PURE__ */ FromEither$1.fromOption(FromEither);
+var fromOptionK = /* @__PURE__ */ FromEither$1.fromOptionK(FromEither);
+var elem = function(E) {
+  return function(a) {
+    return function(ma) {
+      return isLeft(ma) ? false : E.equals(a, ma.right);
+    };
+  };
+};
+var exists = function(predicate) {
+  return function(ma) {
+    return isLeft(ma) ? false : predicate(ma.right);
+  };
+};
+var toTuple2 = function(e, a) {
+  return function(fa) {
+    return isLeft(fa) ? [fa.left, a()] : isRight(fa) ? [e(), fa.right] : [fa.left, fa.right];
+  };
+};
+var toTuple = function(e, a) {
+  return toTuple2(function() {
+    return e;
+  }, function() {
+    return a;
+  });
+};
+var ApT = /* @__PURE__ */ of(internal.emptyReadonlyArray);
+var traverseReadonlyNonEmptyArrayWithIndex = function(S) {
+  return function(f) {
+    return function(as) {
+      var e = internal.none;
+      var t = f(0, internal.head(as));
+      if (isLeft(t)) {
+        return t;
+      }
+      if (isBoth(t)) {
+        e = internal.some(t.left);
+      }
+      var out = [t.right];
+      for (var i = 1; i < as.length; i++) {
+        var t_1 = f(i, as[i]);
+        if (isLeft(t_1)) {
+          return t_1;
+        }
+        if (isBoth(t_1)) {
+          e = internal.isNone(e) ? internal.some(t_1.left) : internal.some(S.concat(e.value, t_1.left));
+        }
+        out.push(t_1.right);
+      }
+      return internal.isNone(e) ? right(out) : both(e.value, out);
+    };
+  };
+};
+var traverseReadonlyArrayWithIndex = function(S) {
+  return function(f) {
+    var g = traverseReadonlyNonEmptyArrayWithIndex(S)(f);
+    return function(as) {
+      return internal.isNonEmpty(as) ? g(as) : ApT;
+    };
+  };
+};
+var these = {
+  URI,
+  map: _map,
+  bimap: _bimap,
+  mapLeft: _mapLeft,
+  reduce: _reduce,
+  foldMap: _foldMap,
+  reduceRight: _reduceRight,
+  traverse: _traverse,
+  sequence
+};
+exports.ApT = ApT;
+exports.Bifunctor = Bifunctor;
+exports.Foldable = Foldable;
+exports.FromEither = FromEither;
+exports.FromThese = FromThese;
+exports.Functor = Functor;
+exports.Pointed = Pointed;
+exports.Traversable = Traversable;
+exports.URI = URI;
+exports.bimap = bimap;
+exports.both = both;
+exports.elem = elem;
+exports.exists = exists;
+exports.flap = flap;
+exports.fold = fold;
+exports.foldMap = foldMap;
+exports.foldW = foldW;
+exports.fromOption = fromOption;
+exports.fromOptionK = fromOptionK;
+exports.fromOptions = fromOptions;
+exports.fromPredicate = fromPredicate;
+exports.getApplicative = getApplicative;
+exports.getApply = getApply;
+exports.getChain = getChain;
+exports.getEq = getEq;
+exports.getLeft = getLeft;
+exports.getLeftOnly = getLeftOnly;
+exports.getMonad = getMonad;
+exports.getRight = getRight;
+exports.getRightOnly = getRightOnly;
+exports.getSemigroup = getSemigroup;
+exports.getShow = getShow;
+exports.isBoth = isBoth;
+exports.isLeft = isLeft;
+exports.isRight = isRight;
+exports.left = left;
+exports.leftOrBoth = leftOrBoth;
+exports.map = map;
+exports.mapLeft = mapLeft;
+exports.match = match;
+exports.matchW = matchW;
+exports.of = of;
+exports.reduce = reduce;
+exports.reduceRight = reduceRight;
+exports.right = right;
+exports.rightOrBoth = rightOrBoth;
+exports.sequence = sequence;
+exports.swap = swap;
+exports.these = these;
+exports.toTuple = toTuple;
+exports.toTuple2 = toTuple2;
+exports.traverse = traverse;
+exports.traverseReadonlyArrayWithIndex = traverseReadonlyArrayWithIndex;
+exports.traverseReadonlyNonEmptyArrayWithIndex = traverseReadonlyNonEmptyArrayWithIndex;
+//# sourceMappingURL=These.cjs.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"These.cjs","sources":["../../../../../../node_modules/fp-ts/es6/These.js"],"sourcesContent":["import { fromEquals } from './Eq';\nimport { fromOption as fromOption_, fromOptionK as fromOptionK_, fromPredicate as fromPredicate_ } from './FromEither';\nimport { identity, pipe } from './function';\nimport { flap as flap_ } from './Functor';\nimport * as _ from './internal';\n// -------------------------------------------------------------------------------------\n// refinements\n// -------------------------------------------------------------------------------------\n/**\n * Returns `true` if the these is an instance of `Left`, `false` otherwise\n *\n * @category refinements\n * @since 2.0.0\n */\nexport var isLeft = function (fa) { return fa._tag === 'Left'; };\n/**\n * Returns `true` if the these is an instance of `Right`, `false` otherwise\n *\n * @category refinements\n * @since 2.0.0\n */\nexport var isRight = function (fa) { return fa._tag === 'Right'; };\n/**\n * Returns `true` if the these is an instance of `Both`, `false` otherwise\n *\n * @category refinements\n * @since 2.0.0\n */\nexport function isBoth(fa) {\n    return fa._tag === 'Both';\n}\n// -------------------------------------------------------------------------------------\n// constructors\n// -------------------------------------------------------------------------------------\n/**\n * @category constructors\n * @since 2.0.0\n */\nexport function left(left) {\n    return { _tag: 'Left', left: left };\n}\n/**\n * @category constructors\n * @since 2.0.0\n */\nexport function right(right) {\n    return { _tag: 'Right', right: right };\n}\n/**\n * @category constructors\n * @since 2.0.0\n */\nexport function both(left, right) {\n    return { _tag: 'Both', left: left, right: right };\n}\n/**\n * Less strict version of [`match`](#match).\n *\n * The `W` suffix (short for **W**idening) means that the handler return types will be merged.\n *\n * @category pattern matching\n * @since 2.10.0\n */\nexport var matchW = function (onLeft, onRight, onBoth) {\n    return function (fa) {\n        switch (fa._tag) {\n            case 'Left':\n                return onLeft(fa.left);\n            case 'Right':\n                return onRight(fa.right);\n            case 'Both':\n                return onBoth(fa.left, fa.right);\n        }\n    };\n};\n/**\n * Alias of [`matchW`](#matchw).\n *\n * @category pattern matching\n * @since 2.10.0\n */\nexport var foldW = matchW;\n/**\n * @category pattern matching\n * @since 2.10.0\n */\nexport var match = matchW;\n/**\n * Alias of [`match`](#match).\n *\n * @category pattern matching\n * @since 2.0.0\n */\nexport var fold = match;\n/**\n * @since 2.4.0\n */\nexport var swap = match(right, left, function (e, a) { return both(a, e); });\n/**\n * @category instances\n * @since 2.0.0\n */\nexport function getShow(SE, SA) {\n    return {\n        show: match(function (l) { return \"left(\".concat(SE.show(l), \")\"); }, function (a) { return \"right(\".concat(SA.show(a), \")\"); }, function (l, a) { return \"both(\".concat(SE.show(l), \", \").concat(SA.show(a), \")\"); })\n    };\n}\n/**\n * @category instances\n * @since 2.0.0\n */\nexport function getEq(EE, EA) {\n    return fromEquals(function (x, y) {\n        return isLeft(x)\n            ? isLeft(y) && EE.equals(x.left, y.left)\n            : isRight(x)\n                ? isRight(y) && EA.equals(x.right, y.right)\n                : isBoth(y) && EE.equals(x.left, y.left) && EA.equals(x.right, y.right);\n    });\n}\n/**\n * @category instances\n * @since 2.0.0\n */\nexport function getSemigroup(SE, SA) {\n    return {\n        concat: function (x, y) {\n            return isLeft(x)\n                ? isLeft(y)\n                    ? left(SE.concat(x.left, y.left))\n                    : isRight(y)\n                        ? both(x.left, y.right)\n                        : both(SE.concat(x.left, y.left), y.right)\n                : isRight(x)\n                    ? isLeft(y)\n                        ? both(y.left, x.right)\n                        : isRight(y)\n                            ? right(SA.concat(x.right, y.right))\n                            : both(y.left, SA.concat(x.right, y.right))\n                    : isLeft(y)\n                        ? both(SE.concat(x.left, y.left), x.right)\n                        : isRight(y)\n                            ? both(x.left, SA.concat(x.right, y.right))\n                            : both(SE.concat(x.left, y.left), SA.concat(x.right, y.right));\n        }\n    };\n}\n/**\n * @category instances\n * @since 2.10.0\n */\nexport var getApply = function (S) { return ({\n    URI: URI,\n    _E: undefined,\n    map: _map,\n    ap: function (fab, fa) {\n        return isLeft(fab)\n            ? isLeft(fa)\n                ? left(S.concat(fab.left, fa.left))\n                : isRight(fa)\n                    ? left(fab.left)\n                    : left(S.concat(fab.left, fa.left))\n            : isRight(fab)\n                ? isLeft(fa)\n                    ? left(fa.left)\n                    : isRight(fa)\n                        ? right(fab.right(fa.right))\n                        : both(fa.left, fab.right(fa.right))\n                : isLeft(fa)\n                    ? left(S.concat(fab.left, fa.left))\n                    : isRight(fa)\n                        ? both(fab.left, fab.right(fa.right))\n                        : both(S.concat(fab.left, fa.left), fab.right(fa.right));\n    }\n}); };\n/**\n * @category instances\n * @since 2.7.0\n */\nexport function getApplicative(S) {\n    var A = getApply(S);\n    return {\n        URI: URI,\n        _E: undefined,\n        map: _map,\n        ap: A.ap,\n        of: of\n    };\n}\n/**\n * @category instances\n * @since 2.10.0\n */\nexport function getChain(S) {\n    var A = getApply(S);\n    var chain = function (ma, f) {\n        if (isLeft(ma)) {\n            return ma;\n        }\n        if (isRight(ma)) {\n            return f(ma.right);\n        }\n        var fb = f(ma.right);\n        return isLeft(fb)\n            ? left(S.concat(ma.left, fb.left))\n            : isRight(fb)\n                ? both(ma.left, fb.right)\n                : both(S.concat(ma.left, fb.left), fb.right);\n    };\n    return {\n        URI: URI,\n        _E: undefined,\n        map: _map,\n        ap: A.ap,\n        chain: chain\n    };\n}\n/**\n * @category instances\n * @since 2.0.0\n */\nexport function getMonad(S) {\n    var C = getChain(S);\n    return {\n        URI: URI,\n        _E: undefined,\n        map: _map,\n        of: of,\n        ap: C.ap,\n        chain: C.chain,\n        throwError: left\n    };\n}\n/**\n * Returns an `E` value if possible\n *\n * @example\n * import { getLeft, left, right, both } from 'fp-ts/These'\n * import { none, some } from 'fp-ts/Option'\n *\n * assert.deepStrictEqual(getLeft(left('a')), some('a'))\n * assert.deepStrictEqual(getLeft(right(1)), none)\n * assert.deepStrictEqual(getLeft(both('a', 1)), some('a'))\n *\n * @category conversions\n * @since 2.0.0\n */\nexport function getLeft(fa) {\n    return isLeft(fa) ? _.some(fa.left) : isRight(fa) ? _.none : _.some(fa.left);\n}\n/**\n * Returns an `A` value if possible\n *\n * @example\n * import { getRight, left, right, both } from 'fp-ts/These'\n * import { none, some } from 'fp-ts/Option'\n *\n * assert.deepStrictEqual(getRight(left('a')), none)\n * assert.deepStrictEqual(getRight(right(1)), some(1))\n * assert.deepStrictEqual(getRight(both('a', 1)), some(1))\n *\n * @category conversions\n * @since 2.0.0\n */\nexport function getRight(fa) {\n    return isLeft(fa) ? _.none : isRight(fa) ? _.some(fa.right) : _.some(fa.right);\n}\n// TODO: make lazy in v3\n/**\n * @example\n * import { leftOrBoth, left, both } from 'fp-ts/These'\n * import { none, some } from 'fp-ts/Option'\n *\n * assert.deepStrictEqual(leftOrBoth('a')(none), left('a'))\n * assert.deepStrictEqual(leftOrBoth('a')(some(1)), both('a', 1))\n *\n * @category constructors\n * @since 2.0.0\n */\nexport function leftOrBoth(e) {\n    return function (ma) { return (_.isNone(ma) ? left(e) : both(e, ma.value)); };\n}\n// TODO: make lazy in v3\n/**\n * @example\n * import { rightOrBoth, right, both } from 'fp-ts/These'\n * import { none, some } from 'fp-ts/Option'\n *\n * assert.deepStrictEqual(rightOrBoth(1)(none), right(1))\n * assert.deepStrictEqual(rightOrBoth(1)(some('a')), both('a', 1))\n *\n * @category constructors\n * @since 2.0.0\n */\nexport function rightOrBoth(a) {\n    return function (me) { return (_.isNone(me) ? right(a) : both(me.value, a)); };\n}\n/**\n * Returns the `E` value if and only if the value is constructed with `Left`\n *\n * @example\n * import { getLeftOnly, left, right, both } from 'fp-ts/These'\n * import { none, some } from 'fp-ts/Option'\n *\n * assert.deepStrictEqual(getLeftOnly(left('a')), some('a'))\n * assert.deepStrictEqual(getLeftOnly(right(1)), none)\n * assert.deepStrictEqual(getLeftOnly(both('a', 1)), none)\n *\n * @category conversions\n * @since 2.0.0\n */\nexport function getLeftOnly(fa) {\n    return isLeft(fa) ? _.some(fa.left) : _.none;\n}\n/**\n * Returns the `A` value if and only if the value is constructed with `Right`\n *\n * @example\n * import { getRightOnly, left, right, both } from 'fp-ts/These'\n * import { none, some } from 'fp-ts/Option'\n *\n * assert.deepStrictEqual(getRightOnly(left('a')), none)\n * assert.deepStrictEqual(getRightOnly(right(1)), some(1))\n * assert.deepStrictEqual(getRightOnly(both('a', 1)), none)\n *\n * @category conversions\n * @since 2.0.0\n */\nexport function getRightOnly(fa) {\n    return isRight(fa) ? _.some(fa.right) : _.none;\n}\n/**\n * Takes a pair of `Option`s and attempts to create a `These` from them\n *\n * @example\n * import { fromOptions, left, right, both } from 'fp-ts/These'\n * import { none, some } from 'fp-ts/Option'\n *\n * assert.deepStrictEqual(fromOptions(none, none), none)\n * assert.deepStrictEqual(fromOptions(some('a'), none), some(left('a')))\n * assert.deepStrictEqual(fromOptions(none, some(1)), some(right(1)))\n * assert.deepStrictEqual(fromOptions(some('a'), some(1)), some(both('a', 1)))\n *\n * @category conversions\n * @since 2.0.0\n */\nexport var fromOptions = function (fe, fa) {\n    return _.isNone(fe)\n        ? _.isNone(fa)\n            ? _.none\n            : _.some(right(fa.value))\n        : _.isNone(fa)\n            ? _.some(left(fe.value))\n            : _.some(both(fe.value, fa.value));\n};\nvar _map = function (fa, f) { return pipe(fa, map(f)); };\n/* istanbul ignore next */\nvar _bimap = function (fa, f, g) { return pipe(fa, bimap(f, g)); };\n/* istanbul ignore next */\nvar _mapLeft = function (fa, f) { return pipe(fa, mapLeft(f)); };\n/* istanbul ignore next */\nvar _reduce = function (fa, b, f) { return pipe(fa, reduce(b, f)); };\n/* istanbul ignore next */\nvar _foldMap = function (M) {\n    var foldMapM = foldMap(M);\n    return function (fa, f) { return pipe(fa, foldMapM(f)); };\n};\n/* istanbul ignore next */\nvar _reduceRight = function (fa, b, f) { return pipe(fa, reduceRight(b, f)); };\n/* istanbul ignore next */\nvar _traverse = function (F) {\n    var traverseF = traverse(F);\n    return function (ta, f) { return pipe(ta, traverseF(f)); };\n};\n/**\n * Map a pair of functions over the two type arguments of the bifunctor.\n *\n * @category mapping\n * @since 2.0.0\n */\nexport var bimap = function (f, g) { return function (fa) {\n    return isLeft(fa) ? left(f(fa.left)) : isRight(fa) ? right(g(fa.right)) : both(f(fa.left), g(fa.right));\n}; };\n/**\n * Map a function over the first type argument of a bifunctor.\n *\n * @category error handling\n * @since 2.0.0\n */\nexport var mapLeft = function (f) { return function (fa) {\n    return isLeft(fa) ? left(f(fa.left)) : isBoth(fa) ? both(f(fa.left), fa.right) : fa;\n}; };\n/**\n * `map` can be used to turn functions `(a: A) => B` into functions `(fa: F<A>) => F<B>` whose argument and return types\n * use the type constructor `F` to represent some computational context.\n *\n * @category mapping\n * @since 2.0.0\n */\nexport var map = function (f) { return function (fa) {\n    return isLeft(fa) ? fa : isRight(fa) ? right(f(fa.right)) : both(fa.left, f(fa.right));\n}; };\n/**\n * @category folding\n * @since 2.0.0\n */\nexport var reduce = function (b, f) { return function (fa) {\n    return isLeft(fa) ? b : f(b, fa.right);\n}; };\n/**\n * @category folding\n * @since 2.0.0\n */\nexport var foldMap = function (M) { return function (f) { return function (fa) {\n    return isLeft(fa) ? M.empty : f(fa.right);\n}; }; };\n/**\n * @category folding\n * @since 2.0.0\n */\nexport var reduceRight = function (b, f) { return function (fa) {\n    return isLeft(fa) ? b : f(fa.right, b);\n}; };\n/**\n * @category traversing\n * @since 2.6.3\n */\nexport var traverse = function (F) {\n    return function (f) {\n        return function (ta) {\n            return isLeft(ta) ? F.of(ta) : isRight(ta) ? F.map(f(ta.right), right) : F.map(f(ta.right), function (b) { return both(ta.left, b); });\n        };\n    };\n};\n/**\n * @category traversing\n * @since 2.6.3\n */\nexport var sequence = function (F) {\n    return function (ta) {\n        return isLeft(ta) ? F.of(ta) : isRight(ta) ? F.map(ta.right, right) : F.map(ta.right, function (b) { return both(ta.left, b); });\n    };\n};\n/**\n * @category constructors\n * @since 2.0.0\n */\nexport var of = right;\n/**\n * @category type lambdas\n * @since 2.0.0\n */\nexport var URI = 'These';\n/**\n * @category instances\n * @since 2.7.0\n */\nexport var Functor = {\n    URI: URI,\n    map: _map\n};\n/**\n * @category mapping\n * @since 2.10.0\n */\nexport var flap = /*#__PURE__*/ flap_(Functor);\n/**\n * @category instances\n * @since 2.10.0\n */\nexport var Pointed = {\n    URI: URI,\n    of: of\n};\n/**\n * @category instances\n * @since 2.7.0\n */\nexport var Bifunctor = {\n    URI: URI,\n    bimap: _bimap,\n    mapLeft: _mapLeft\n};\n/**\n * @category instances\n * @since 2.11.0\n */\nexport var FromThese = {\n    URI: URI,\n    fromThese: identity\n};\n/**\n * @category instances\n * @since 2.7.0\n */\nexport var Foldable = {\n    URI: URI,\n    reduce: _reduce,\n    foldMap: _foldMap,\n    reduceRight: _reduceRight\n};\n/**\n * @category instances\n * @since 2.7.0\n */\nexport var Traversable = {\n    URI: URI,\n    map: _map,\n    reduce: _reduce,\n    foldMap: _foldMap,\n    reduceRight: _reduceRight,\n    traverse: _traverse,\n    sequence: sequence\n};\n/**\n * @category instances\n * @since 2.10.0\n */\nexport var FromEither = {\n    URI: URI,\n    fromEither: identity\n};\n/**\n * @category lifting\n * @since 2.13.0\n */\nexport var fromPredicate = /*#__PURE__*/ fromPredicate_(FromEither);\n/**\n * @category conversions\n * @since 2.10.0\n */\nexport var fromOption = \n/*#__PURE__*/ fromOption_(FromEither);\n/**\n * @category lifting\n * @since 2.10.0\n */\nexport var fromOptionK = \n/*#__PURE__*/ fromOptionK_(FromEither);\n// -------------------------------------------------------------------------------------\n// utils\n// -------------------------------------------------------------------------------------\n/**\n * @since 2.11.0\n */\nexport var elem = function (E) {\n    return function (a) {\n        return function (ma) {\n            return isLeft(ma) ? false : E.equals(a, ma.right);\n        };\n    };\n};\n/**\n * @since 2.11.0\n */\nexport var exists = function (predicate) {\n    return function (ma) {\n        return isLeft(ma) ? false : predicate(ma.right);\n    };\n};\n/**\n * @example\n * import { toTuple2, left, right, both } from 'fp-ts/These'\n *\n * assert.deepStrictEqual(toTuple2(() => 'a', () => 1)(left('b')), ['b', 1])\n * assert.deepStrictEqual(toTuple2(() => 'a', () => 1)(right(2)), ['a', 2])\n * assert.deepStrictEqual(toTuple2(() => 'a', () => 1)(both('b', 2)), ['b', 2])\n *\n * @category conversions\n * @since 2.10.0\n */\nexport var toTuple2 = function (e, a) {\n    return function (fa) {\n        return isLeft(fa) ? [fa.left, a()] : isRight(fa) ? [e(), fa.right] : [fa.left, fa.right];\n    };\n};\n// -------------------------------------------------------------------------------------\n// deprecated\n// -------------------------------------------------------------------------------------\n/**\n * Use [`toTuple2`](#totuple2) instead.\n *\n * @category zone of death\n * @since 2.0.0\n * @deprecated\n */\nexport var toTuple = function (e, a) {\n    return toTuple2(function () { return e; }, function () { return a; });\n};\n/**\n * @since 2.11.0\n */\nexport var ApT = /*#__PURE__*/ of(_.emptyReadonlyArray);\n// -------------------------------------------------------------------------------------\n// array utils\n// -------------------------------------------------------------------------------------\n/**\n * Equivalent to `ReadonlyNonEmptyArray#traverseWithIndex(getApplicative(S))`.\n *\n * @category traversing\n * @since 2.11.0\n */\nexport var traverseReadonlyNonEmptyArrayWithIndex = function (S) {\n    return function (f) {\n        return function (as) {\n            var e = _.none;\n            var t = f(0, _.head(as));\n            if (isLeft(t)) {\n                return t;\n            }\n            if (isBoth(t)) {\n                e = _.some(t.left);\n            }\n            var out = [t.right];\n            for (var i = 1; i < as.length; i++) {\n                var t_1 = f(i, as[i]);\n                if (isLeft(t_1)) {\n                    return t_1;\n                }\n                if (isBoth(t_1)) {\n                    e = _.isNone(e) ? _.some(t_1.left) : _.some(S.concat(e.value, t_1.left));\n                }\n                out.push(t_1.right);\n            }\n            return _.isNone(e) ? right(out) : both(e.value, out);\n        };\n    };\n};\n/**\n * Equivalent to `ReadonlyArray#traverseWithIndex(getApplicative(S))`.\n *\n * @category traversing\n * @since 2.11.0\n */\nexport var traverseReadonlyArrayWithIndex = function (S) {\n    return function (f) {\n        var g = traverseReadonlyNonEmptyArrayWithIndex(S)(f);\n        return function (as) { return (_.isNonEmpty(as) ? g(as) : ApT); };\n    };\n};\n// -------------------------------------------------------------------------------------\n// deprecated\n// -------------------------------------------------------------------------------------\n/**\n * This instance is deprecated, use small, specific instances instead.\n * For example if a function needs a `Functor` instance, pass `T.Functor` instead of `T.these`\n * (where `T` is from `import T from 'fp-ts/These'`)\n *\n * @category zone of death\n * @since 2.0.0\n * @deprecated\n */\nexport var these = {\n    URI: URI,\n    map: _map,\n    bimap: _bimap,\n    mapLeft: _mapLeft,\n    reduce: _reduce,\n    foldMap: _foldMap,\n    reduceRight: _reduceRight,\n    traverse: _traverse,\n    sequence: sequence\n};\n"],"names":["left","right","fromEquals","_.some","_.none","_.isNone","pipe","flap_","identity","fromPredicate_","fromOption_","fromOptionK_","_.emptyReadonlyArray","_.head","_.isNonEmpty"],"mappings":";;;;;;;AAcU,IAAC,SAAS,SAAU,IAAI;AAAE,SAAO,GAAG,SAAS;AAAU;AAOvD,IAAC,UAAU,SAAU,IAAI;AAAE,SAAO,GAAG,SAAS;AAAW;AAO5D,SAAS,OAAO,IAAI;AACvB,SAAO,GAAG,SAAS;AACvB;AAQO,SAAS,KAAKA,OAAM;AACvB,SAAO,EAAE,MAAM,QAAQ,MAAMA,MAAI;AACrC;AAKO,SAAS,MAAMC,QAAO;AACzB,SAAO,EAAE,MAAM,SAAS,OAAOA,OAAK;AACxC;AAKO,SAAS,KAAKD,OAAMC,QAAO;AAC9B,SAAO,EAAE,MAAM,QAAQ,MAAMD,OAAM,OAAOC;AAC9C;AASU,IAAC,SAAS,SAAU,QAAQ,SAAS,QAAQ;AACnD,SAAO,SAAU,IAAI;AACjB,YAAQ,GAAG,MAAI;AAAA,MACX,KAAK;AACD,eAAO,OAAO,GAAG,IAAI;AAAA,MACzB,KAAK;AACD,eAAO,QAAQ,GAAG,KAAK;AAAA,MAC3B,KAAK;AACD,eAAO,OAAO,GAAG,MAAM,GAAG,KAAK;AAAA,IACtC;AAAA,EACT;AACA;AAOU,IAAC,QAAQ;AAKT,IAAC,QAAQ;AAOT,IAAC,OAAO;AAIR,IAAC,OAAO,MAAM,OAAO,MAAM,SAAU,GAAG,GAAG;AAAE,SAAO,KAAK,GAAG,CAAC;AAAE,CAAE;AAKpE,SAAS,QAAQ,IAAI,IAAI;AAC5B,SAAO;AAAA,IACH,MAAM,MAAM,SAAU,GAAG;AAAE,aAAO,QAAQ,OAAO,GAAG,KAAK,CAAC,GAAG,GAAG;AAAA,IAAE,GAAI,SAAU,GAAG;AAAE,aAAO,SAAS,OAAO,GAAG,KAAK,CAAC,GAAG,GAAG;AAAA,IAAE,GAAI,SAAU,GAAG,GAAG;AAAE,aAAO,QAAQ,OAAO,GAAG,KAAK,CAAC,GAAG,IAAI,EAAE,OAAO,GAAG,KAAK,CAAC,GAAG,GAAG;AAAA,KAAI;AAAA,EAC7N;AACA;AAKO,SAAS,MAAM,IAAI,IAAI;AAC1B,SAAOC,GAAU,WAAC,SAAU,GAAG,GAAG;AAC9B,WAAO,OAAO,CAAC,IACT,OAAO,CAAC,KAAK,GAAG,OAAO,EAAE,MAAM,EAAE,IAAI,IACrC,QAAQ,CAAC,IACL,QAAQ,CAAC,KAAK,GAAG,OAAO,EAAE,OAAO,EAAE,KAAK,IACxC,OAAO,CAAC,KAAK,GAAG,OAAO,EAAE,MAAM,EAAE,IAAI,KAAK,GAAG,OAAO,EAAE,OAAO,EAAE,KAAK;AAAA,EACtF,CAAK;AACL;AAKO,SAAS,aAAa,IAAI,IAAI;AACjC,SAAO;AAAA,IACH,QAAQ,SAAU,GAAG,GAAG;AACpB,aAAO,OAAO,CAAC,IACT,OAAO,CAAC,IACJ,KAAK,GAAG,OAAO,EAAE,MAAM,EAAE,IAAI,CAAC,IAC9B,QAAQ,CAAC,IACL,KAAK,EAAE,MAAM,EAAE,KAAK,IACpB,KAAK,GAAG,OAAO,EAAE,MAAM,EAAE,IAAI,GAAG,EAAE,KAAK,IAC/C,QAAQ,CAAC,IACL,OAAO,CAAC,IACJ,KAAK,EAAE,MAAM,EAAE,KAAK,IACpB,QAAQ,CAAC,IACL,MAAM,GAAG,OAAO,EAAE,OAAO,EAAE,KAAK,CAAC,IACjC,KAAK,EAAE,MAAM,GAAG,OAAO,EAAE,OAAO,EAAE,KAAK,CAAC,IAChD,OAAO,CAAC,IACJ,KAAK,GAAG,OAAO,EAAE,MAAM,EAAE,IAAI,GAAG,EAAE,KAAK,IACvC,QAAQ,CAAC,IACL,KAAK,EAAE,MAAM,GAAG,OAAO,EAAE,OAAO,EAAE,KAAK,CAAC,IACxC,KAAK,GAAG,OAAO,EAAE,MAAM,EAAE,IAAI,GAAG,GAAG,OAAO,EAAE,OAAO,EAAE,KAAK,CAAC;AAAA,IAChF;AAAA,EACT;AACA;AAKU,IAAC,WAAW,SAAU,GAAG;AAAE,SAAQ;AAAA,IACzC;AAAA,IACA,IAAI;AAAA,IACJ,KAAK;AAAA,IACL,IAAI,SAAU,KAAK,IAAI;AACnB,aAAO,OAAO,GAAG,IACX,OAAO,EAAE,IACL,KAAK,EAAE,OAAO,IAAI,MAAM,GAAG,IAAI,CAAC,IAChC,QAAQ,EAAE,IACN,KAAK,IAAI,IAAI,IACb,KAAK,EAAE,OAAO,IAAI,MAAM,GAAG,IAAI,CAAC,IACxC,QAAQ,GAAG,IACP,OAAO,EAAE,IACL,KAAK,GAAG,IAAI,IACZ,QAAQ,EAAE,IACN,MAAM,IAAI,MAAM,GAAG,KAAK,CAAC,IACzB,KAAK,GAAG,MAAM,IAAI,MAAM,GAAG,KAAK,CAAC,IACzC,OAAO,EAAE,IACL,KAAK,EAAE,OAAO,IAAI,MAAM,GAAG,IAAI,CAAC,IAChC,QAAQ,EAAE,IACN,KAAK,IAAI,MAAM,IAAI,MAAM,GAAG,KAAK,CAAC,IAClC,KAAK,EAAE,OAAO,IAAI,MAAM,GAAG,IAAI,GAAG,IAAI,MAAM,GAAG,KAAK,CAAC;AAAA,IAC1E;AAAA,EACL;AAAM;AAKC,SAAS,eAAe,GAAG;AAC9B,MAAI,IAAI,SAAS,CAAC;AAClB,SAAO;AAAA,IACH;AAAA,IACA,IAAI;AAAA,IACJ,KAAK;AAAA,IACL,IAAI,EAAE;AAAA,IACN;AAAA,EACR;AACA;AAKO,SAAS,SAAS,GAAG;AACxB,MAAI,IAAI,SAAS,CAAC;AAClB,MAAI,QAAQ,SAAU,IAAI,GAAG;AACzB,QAAI,OAAO,EAAE,GAAG;AACZ,aAAO;AAAA,IACV;AACD,QAAI,QAAQ,EAAE,GAAG;AACb,aAAO,EAAE,GAAG,KAAK;AAAA,IACpB;AACD,QAAI,KAAK,EAAE,GAAG,KAAK;AACnB,WAAO,OAAO,EAAE,IACV,KAAK,EAAE,OAAO,GAAG,MAAM,GAAG,IAAI,CAAC,IAC/B,QAAQ,EAAE,IACN,KAAK,GAAG,MAAM,GAAG,KAAK,IACtB,KAAK,EAAE,OAAO,GAAG,MAAM,GAAG,IAAI,GAAG,GAAG,KAAK;AAAA,EAC3D;AACI,SAAO;AAAA,IACH;AAAA,IACA,IAAI;AAAA,IACJ,KAAK;AAAA,IACL,IAAI,EAAE;AAAA,IACN;AAAA,EACR;AACA;AAKO,SAAS,SAAS,GAAG;AACxB,MAAI,IAAI,SAAS,CAAC;AAClB,SAAO;AAAA,IACH;AAAA,IACA,IAAI;AAAA,IACJ,KAAK;AAAA,IACL;AAAA,IACA,IAAI,EAAE;AAAA,IACN,OAAO,EAAE;AAAA,IACT,YAAY;AAAA,EACpB;AACA;AAeO,SAAS,QAAQ,IAAI;AACxB,SAAO,OAAO,EAAE,IAAIC,SAAAA,KAAO,GAAG,IAAI,IAAI,QAAQ,EAAE,IAAIC,SAAM,OAAGD,SAAM,KAAC,GAAG,IAAI;AAC/E;AAeO,SAAS,SAAS,IAAI;AACzB,SAAO,OAAO,EAAE,IAAIC,SAAAA,OAAS,QAAQ,EAAE,IAAID,cAAO,GAAG,KAAK,IAAIA,SAAM,KAAC,GAAG,KAAK;AACjF;AAaO,SAAS,WAAW,GAAG;AAC1B,SAAO,SAAU,IAAI;AAAE,WAAQE,SAAAA,OAAS,EAAE,IAAI,KAAK,CAAC,IAAI,KAAK,GAAG,GAAG,KAAK;AAAA,EAAG;AAC/E;AAaO,SAAS,YAAY,GAAG;AAC3B,SAAO,SAAU,IAAI;AAAE,WAAQA,SAAAA,OAAS,EAAE,IAAI,MAAM,CAAC,IAAI,KAAK,GAAG,OAAO,CAAC;AAAA,EAAG;AAChF;AAeO,SAAS,YAAY,IAAI;AAC5B,SAAO,OAAO,EAAE,IAAIF,SAAAA,KAAO,GAAG,IAAI,IAAIC;AAC1C;AAeO,SAAS,aAAa,IAAI;AAC7B,SAAO,QAAQ,EAAE,IAAID,SAAAA,KAAO,GAAG,KAAK,IAAIC;AAC5C;AAgBU,IAAC,cAAc,SAAU,IAAI,IAAI;AACvC,SAAOC,SAAAA,OAAS,EAAE,IACZA,SAAAA,OAAS,EAAE,IACPD,SAAM,OACND,SAAAA,KAAO,MAAM,GAAG,KAAK,CAAC,IAC1BE,SAAAA,OAAS,EAAE,IACPF,SAAAA,KAAO,KAAK,GAAG,KAAK,CAAC,IACrBA,SAAM,KAAC,KAAK,GAAG,OAAO,GAAG,KAAK,CAAC;AAC7C;AACA,IAAI,OAAO,SAAU,IAAI,GAAG;AAAE,SAAOG,UAAAA,KAAK,IAAI,IAAI,CAAC,CAAC;;AAEpD,IAAI,SAAS,SAAU,IAAI,GAAG,GAAG;AAAE,SAAOA,UAAAA,KAAK,IAAI,MAAM,GAAG,CAAC,CAAC;AAAE;AAEhE,IAAI,WAAW,SAAU,IAAI,GAAG;AAAE,SAAOA,UAAAA,KAAK,IAAI,QAAQ,CAAC,CAAC;;AAE5D,IAAI,UAAU,SAAU,IAAI,GAAG,GAAG;AAAE,SAAOA,UAAAA,KAAK,IAAI,OAAO,GAAG,CAAC,CAAC;AAAE;AAElE,IAAI,WAAW,SAAU,GAAG;AACxB,MAAI,WAAW,QAAQ,CAAC;AACxB,SAAO,SAAU,IAAI,GAAG;AAAE,WAAOA,UAAAA,KAAK,IAAI,SAAS,CAAC,CAAC;AAAA;AACzD;AAEA,IAAI,eAAe,SAAU,IAAI,GAAG,GAAG;AAAE,SAAOA,UAAAA,KAAK,IAAI,YAAY,GAAG,CAAC,CAAC;AAAE;AAE5E,IAAI,YAAY,SAAU,GAAG;AACzB,MAAI,YAAY,SAAS,CAAC;AAC1B,SAAO,SAAU,IAAI,GAAG;AAAE,WAAOA,UAAAA,KAAK,IAAI,UAAU,CAAC,CAAC;AAAA;AAC1D;AAOU,IAAC,QAAQ,SAAU,GAAG,GAAG;AAAE,SAAO,SAAU,IAAI;AACtD,WAAO,OAAO,EAAE,IAAI,KAAK,EAAE,GAAG,IAAI,CAAC,IAAI,QAAQ,EAAE,IAAI,MAAM,EAAE,GAAG,KAAK,CAAC,IAAI,KAAK,EAAE,GAAG,IAAI,GAAG,EAAE,GAAG,KAAK,CAAC;AAAA,EAC1G;AAAK;AAOK,IAAC,UAAU,SAAU,GAAG;AAAE,SAAO,SAAU,IAAI;AACrD,WAAO,OAAO,EAAE,IAAI,KAAK,EAAE,GAAG,IAAI,CAAC,IAAI,OAAO,EAAE,IAAI,KAAK,EAAE,GAAG,IAAI,GAAG,GAAG,KAAK,IAAI;AAAA,EACrF;AAAK;AAQK,IAAC,MAAM,SAAU,GAAG;AAAE,SAAO,SAAU,IAAI;AACjD,WAAO,OAAO,EAAE,IAAI,KAAK,QAAQ,EAAE,IAAI,MAAM,EAAE,GAAG,KAAK,CAAC,IAAI,KAAK,GAAG,MAAM,EAAE,GAAG,KAAK,CAAC;AAAA,EACzF;AAAK;AAKK,IAAC,SAAS,SAAU,GAAG,GAAG;AAAE,SAAO,SAAU,IAAI;AACvD,WAAO,OAAO,EAAE,IAAI,IAAI,EAAE,GAAG,GAAG,KAAK;AAAA,EACzC;AAAK;AAKK,IAAC,UAAU,SAAU,GAAG;AAAE,SAAO,SAAU,GAAG;AAAE,WAAO,SAAU,IAAI;AAC3E,aAAO,OAAO,EAAE,IAAI,EAAE,QAAQ,EAAE,GAAG,KAAK;AAAA,IAC5C;AAAA,EAAI;AAAI;AAKE,IAAC,cAAc,SAAU,GAAG,GAAG;AAAE,SAAO,SAAU,IAAI;AAC5D,WAAO,OAAO,EAAE,IAAI,IAAI,EAAE,GAAG,OAAO,CAAC;AAAA,EACzC;AAAK;AAKK,IAAC,WAAW,SAAU,GAAG;AAC/B,SAAO,SAAU,GAAG;AAChB,WAAO,SAAU,IAAI;AACjB,aAAO,OAAO,EAAE,IAAI,EAAE,GAAG,EAAE,IAAI,QAAQ,EAAE,IAAI,EAAE,IAAI,EAAE,GAAG,KAAK,GAAG,KAAK,IAAI,EAAE,IAAI,EAAE,GAAG,KAAK,GAAG,SAAU,GAAG;AAAE,eAAO,KAAK,GAAG,MAAM,CAAC;AAAA,MAAI,CAAA;AAAA,IACjJ;AAAA,EACA;AACA;AAKU,IAAC,WAAW,SAAU,GAAG;AAC/B,SAAO,SAAU,IAAI;AACjB,WAAO,OAAO,EAAE,IAAI,EAAE,GAAG,EAAE,IAAI,QAAQ,EAAE,IAAI,EAAE,IAAI,GAAG,OAAO,KAAK,IAAI,EAAE,IAAI,GAAG,OAAO,SAAU,GAAG;AAAE,aAAO,KAAK,GAAG,MAAM,CAAC;AAAA,IAAI,CAAA;AAAA,EACvI;AACA;AAKU,IAAC,KAAK;AAKN,IAAC,MAAM;AAKP,IAAC,UAAU;AAAA,EACjB;AAAA,EACA,KAAK;AACT;AAKU,IAAC,OAAqBC,0BAAK,KAAC,OAAO;AAKnC,IAAC,UAAU;AAAA,EACjB;AAAA,EACA;AACJ;AAKU,IAAC,YAAY;AAAA,EACnB;AAAA,EACA,OAAO;AAAA,EACP,SAAS;AACb;AAKU,IAAC,YAAY;AAAA,EACnB;AAAA,EACA,WAAWC,UAAQ;AACvB;AAKU,IAAC,WAAW;AAAA,EAClB;AAAA,EACA,QAAQ;AAAA,EACR,SAAS;AAAA,EACT,aAAa;AACjB;AAKU,IAAC,cAAc;AAAA,EACrB;AAAA,EACA,KAAK;AAAA,EACL,QAAQ;AAAA,EACR,SAAS;AAAA,EACT,aAAa;AAAA,EACb,UAAU;AAAA,EACV;AACJ;AAKU,IAAC,aAAa;AAAA,EACpB;AAAA,EACA,YAAYA,UAAQ;AACxB;AAKU,IAAC,gBAA8BC,6BAAc,cAAC,UAAU;AAKxD,IAAC,aACGC,6BAAAA,WAAY,UAAU;AAK1B,IAAC,cACGC,6BAAAA,YAAa,UAAU;AAO3B,IAAC,OAAO,SAAU,GAAG;AAC3B,SAAO,SAAU,GAAG;AAChB,WAAO,SAAU,IAAI;AACjB,aAAO,OAAO,EAAE,IAAI,QAAQ,EAAE,OAAO,GAAG,GAAG,KAAK;AAAA,IAC5D;AAAA,EACA;AACA;AAIU,IAAC,SAAS,SAAU,WAAW;AACrC,SAAO,SAAU,IAAI;AACjB,WAAO,OAAO,EAAE,IAAI,QAAQ,UAAU,GAAG,KAAK;AAAA,EACtD;AACA;AAYU,IAAC,WAAW,SAAU,GAAG,GAAG;AAClC,SAAO,SAAU,IAAI;AACjB,WAAO,OAAO,EAAE,IAAI,CAAC,GAAG,MAAM,EAAC,CAAE,IAAI,QAAQ,EAAE,IAAI,CAAC,EAAG,GAAE,GAAG,KAAK,IAAI,CAAC,GAAG,MAAM,GAAG,KAAK;AAAA,EAC/F;AACA;AAWU,IAAC,UAAU,SAAU,GAAG,GAAG;AACjC,SAAO,SAAS,WAAY;AAAE,WAAO;AAAA,EAAI,GAAE,WAAY;AAAE,WAAO;AAAA,EAAE,CAAE;AACxE;AAIU,IAAC,MAAoB,mBAAGC,2BAAoB;AAU5C,IAAC,yCAAyC,SAAU,GAAG;AAC7D,SAAO,SAAU,GAAG;AAChB,WAAO,SAAU,IAAI;AACjB,UAAI,IAAIR,SAAAA;AACR,UAAI,IAAI,EAAE,GAAGS,SAAAA,KAAO,EAAE,CAAC;AACvB,UAAI,OAAO,CAAC,GAAG;AACX,eAAO;AAAA,MACV;AACD,UAAI,OAAO,CAAC,GAAG;AACX,YAAIV,SAAM,KAAC,EAAE,IAAI;AAAA,MACpB;AACD,UAAI,MAAM,CAAC,EAAE,KAAK;AAClB,eAAS,IAAI,GAAG,IAAI,GAAG,QAAQ,KAAK;AAChC,YAAI,MAAM,EAAE,GAAG,GAAG,CAAC,CAAC;AACpB,YAAI,OAAO,GAAG,GAAG;AACb,iBAAO;AAAA,QACV;AACD,YAAI,OAAO,GAAG,GAAG;AACb,cAAIE,SAAQ,OAAC,CAAC,IAAIF,SAAAA,KAAO,IAAI,IAAI,IAAIA,SAAM,KAAC,EAAE,OAAO,EAAE,OAAO,IAAI,IAAI,CAAC;AAAA,QAC1E;AACD,YAAI,KAAK,IAAI,KAAK;AAAA,MACrB;AACD,aAAOE,SAAQ,OAAC,CAAC,IAAI,MAAM,GAAG,IAAI,KAAK,EAAE,OAAO,GAAG;AAAA,IAC/D;AAAA,EACA;AACA;AAOU,IAAC,iCAAiC,SAAU,GAAG;AACrD,SAAO,SAAU,GAAG;AAChB,QAAI,IAAI,uCAAuC,CAAC,EAAE,CAAC;AACnD,WAAO,SAAU,IAAI;AAAE,aAAQS,oBAAa,EAAE,IAAI,EAAE,EAAE,IAAI;AAAA;EAClE;AACA;AAaU,IAAC,QAAQ;AAAA,EACf;AAAA,EACA,KAAK;AAAA,EACL,OAAO;AAAA,EACP,SAAS;AAAA,EACT,QAAQ;AAAA,EACR,SAAS;AAAA,EACT,aAAa;AAAA,EACb,UAAU;AAAA,EACV;AACJ;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;","x_google_ignoreList":[0]}