@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/lib/Option.cjs.map

@@ -1 +0,0 @@
-{"version":3,"file":"Option.cjs","sources":["../../../../../../node_modules/fp-ts/lib/Option.js"],"sourcesContent":["\"use strict\";\nvar __createBinding = (this && this.__createBinding) || (Object.create ? (function(o, m, k, k2) {\n    if (k2 === undefined) k2 = k;\n    var desc = Object.getOwnPropertyDescriptor(m, k);\n    if (!desc || (\"get\" in desc ? !m.__esModule : desc.writable || desc.configurable)) {\n      desc = { enumerable: true, get: function() { return m[k]; } };\n    }\n    Object.defineProperty(o, k2, desc);\n}) : (function(o, m, k, k2) {\n    if (k2 === undefined) k2 = k;\n    o[k2] = m[k];\n}));\nvar __setModuleDefault = (this && this.__setModuleDefault) || (Object.create ? (function(o, v) {\n    Object.defineProperty(o, \"default\", { enumerable: true, value: v });\n}) : function(o, v) {\n    o[\"default\"] = v;\n});\nvar __importStar = (this && this.__importStar) || function (mod) {\n    if (mod && mod.__esModule) return mod;\n    var result = {};\n    if (mod != null) for (var k in mod) if (k !== \"default\" && Object.prototype.hasOwnProperty.call(mod, k)) __createBinding(result, mod, k);\n    __setModuleDefault(result, mod);\n    return result;\n};\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.Witherable = exports.wilt = exports.wither = exports.Traversable = exports.sequence = exports.traverse = exports.Filterable = exports.partitionMap = exports.partition = exports.filterMap = exports.filter = exports.Compactable = exports.separate = exports.compact = exports.Extend = exports.extend = exports.Alternative = exports.guard = exports.Zero = exports.zero = exports.Alt = exports.alt = exports.altW = exports.orElse = exports.Foldable = exports.reduceRight = exports.foldMap = exports.reduce = exports.Monad = exports.Chain = exports.flatMap = exports.Applicative = exports.Apply = exports.ap = exports.Pointed = exports.of = exports.asUnit = exports.as = exports.Functor = exports.map = exports.getMonoid = exports.getOrd = exports.getEq = exports.getShow = exports.URI = exports.getRight = exports.getLeft = exports.fromPredicate = exports.some = exports.none = void 0;\nexports.getFirstMonoid = exports.getApplyMonoid = exports.getApplySemigroup = exports.option = exports.mapNullable = exports.getRefinement = exports.chainFirst = exports.chain = exports.sequenceArray = exports.traverseArray = exports.traverseArrayWithIndex = exports.traverseReadonlyArrayWithIndex = exports.traverseReadonlyNonEmptyArrayWithIndex = exports.ApT = exports.apS = exports.bind = exports.let = exports.bindTo = exports.Do = exports.exists = exports.elem = exports.toUndefined = exports.toNullable = exports.chainNullableK = exports.fromNullableK = exports.tryCatchK = exports.tryCatch = exports.fromNullable = exports.chainFirstEitherK = exports.chainEitherK = exports.fromEitherK = exports.duplicate = exports.tapEither = exports.tap = exports.flatten = exports.apSecond = exports.apFirst = exports.flap = exports.getOrElse = exports.getOrElseW = exports.fold = exports.match = exports.foldW = exports.matchW = exports.isNone = exports.isSome = exports.FromEither = exports.fromEither = exports.MonadThrow = exports.throwError = void 0;\nexports.getLastMonoid = void 0;\nvar Applicative_1 = require(\"./Applicative\");\nvar Apply_1 = require(\"./Apply\");\nvar chainable = __importStar(require(\"./Chain\"));\nvar FromEither_1 = require(\"./FromEither\");\nvar function_1 = require(\"./function\");\nvar Functor_1 = require(\"./Functor\");\nvar _ = __importStar(require(\"./internal\"));\nvar Predicate_1 = require(\"./Predicate\");\nvar Semigroup_1 = require(\"./Semigroup\");\nvar Separated_1 = require(\"./Separated\");\nvar Witherable_1 = require(\"./Witherable\");\nvar Zero_1 = require(\"./Zero\");\n// -------------------------------------------------------------------------------------\n// constructors\n// -------------------------------------------------------------------------------------\n/**\n * `None` doesn't have a constructor, instead you can use it directly as a value. Represents a missing value.\n *\n * @category constructors\n * @since 2.0.0\n */\nexports.none = _.none;\n/**\n * Constructs a `Some`. Represents an optional value that exists.\n *\n * @category constructors\n * @since 2.0.0\n */\nexports.some = _.some;\nfunction fromPredicate(predicate) {\n    return function (a) { return (predicate(a) ? (0, exports.some)(a) : exports.none); };\n}\nexports.fromPredicate = fromPredicate;\n/**\n * Returns the `Left` value of an `Either` if possible.\n *\n * @example\n * import { getLeft, none, some } from 'fp-ts/Option'\n * import { right, left } from 'fp-ts/Either'\n *\n * assert.deepStrictEqual(getLeft(right(1)), none)\n * assert.deepStrictEqual(getLeft(left('a')), some('a'))\n *\n * @category constructors\n * @since 2.0.0\n */\nvar getLeft = function (ma) { return (ma._tag === 'Right' ? exports.none : (0, exports.some)(ma.left)); };\nexports.getLeft = getLeft;\n/**\n * Returns the `Right` value of an `Either` if possible.\n *\n * @example\n * import { getRight, none, some } from 'fp-ts/Option'\n * import { right, left } from 'fp-ts/Either'\n *\n * assert.deepStrictEqual(getRight(right(1)), some(1))\n * assert.deepStrictEqual(getRight(left('a')), none)\n *\n * @category constructors\n * @since 2.0.0\n */\nvar getRight = function (ma) { return (ma._tag === 'Left' ? exports.none : (0, exports.some)(ma.right)); };\nexports.getRight = getRight;\nvar _map = function (fa, f) { return (0, function_1.pipe)(fa, (0, exports.map)(f)); };\nvar _ap = function (fab, fa) { return (0, function_1.pipe)(fab, (0, exports.ap)(fa)); };\nvar _reduce = function (fa, b, f) { return (0, function_1.pipe)(fa, (0, exports.reduce)(b, f)); };\nvar _foldMap = function (M) {\n    var foldMapM = (0, exports.foldMap)(M);\n    return function (fa, f) { return (0, function_1.pipe)(fa, foldMapM(f)); };\n};\nvar _reduceRight = function (fa, b, f) { return (0, function_1.pipe)(fa, (0, exports.reduceRight)(b, f)); };\nvar _traverse = function (F) {\n    var traverseF = (0, exports.traverse)(F);\n    return function (ta, f) { return (0, function_1.pipe)(ta, traverseF(f)); };\n};\n/* istanbul ignore next */\nvar _alt = function (fa, that) { return (0, function_1.pipe)(fa, (0, exports.alt)(that)); };\nvar _filter = function (fa, predicate) { return (0, function_1.pipe)(fa, (0, exports.filter)(predicate)); };\n/* istanbul ignore next */\nvar _filterMap = function (fa, f) { return (0, function_1.pipe)(fa, (0, exports.filterMap)(f)); };\n/* istanbul ignore next */\nvar _extend = function (wa, f) { return (0, function_1.pipe)(wa, (0, exports.extend)(f)); };\n/* istanbul ignore next */\nvar _partition = function (fa, predicate) {\n    return (0, function_1.pipe)(fa, (0, exports.partition)(predicate));\n};\n/* istanbul ignore next */\nvar _partitionMap = function (fa, f) { return (0, function_1.pipe)(fa, (0, exports.partitionMap)(f)); };\n/**\n * @category type lambdas\n * @since 2.0.0\n */\nexports.URI = 'Option';\n/**\n * @category instances\n * @since 2.0.0\n */\nvar getShow = function (S) { return ({\n    show: function (ma) { return ((0, exports.isNone)(ma) ? 'none' : \"some(\".concat(S.show(ma.value), \")\")); }\n}); };\nexports.getShow = getShow;\n/**\n * @example\n * import { none, some, getEq } from 'fp-ts/Option'\n * import * as N from 'fp-ts/number'\n *\n * const E = getEq(N.Eq)\n * assert.strictEqual(E.equals(none, none), true)\n * assert.strictEqual(E.equals(none, some(1)), false)\n * assert.strictEqual(E.equals(some(1), none), false)\n * assert.strictEqual(E.equals(some(1), some(2)), false)\n * assert.strictEqual(E.equals(some(1), some(1)), true)\n *\n * @category instances\n * @since 2.0.0\n */\nvar getEq = function (E) { return ({\n    equals: function (x, y) { return x === y || ((0, exports.isNone)(x) ? (0, exports.isNone)(y) : (0, exports.isNone)(y) ? false : E.equals(x.value, y.value)); }\n}); };\nexports.getEq = getEq;\n/**\n * The `Ord` instance allows `Option` values to be compared with\n * `compare`, whenever there is an `Ord` instance for\n * the type the `Option` contains.\n *\n * `None` is considered to be less than any `Some` value.\n *\n *\n * @example\n * import { none, some, getOrd } from 'fp-ts/Option'\n * import * as N from 'fp-ts/number'\n *\n * const O = getOrd(N.Ord)\n * assert.strictEqual(O.compare(none, none), 0)\n * assert.strictEqual(O.compare(none, some(1)), -1)\n * assert.strictEqual(O.compare(some(1), none), 1)\n * assert.strictEqual(O.compare(some(1), some(2)), -1)\n * assert.strictEqual(O.compare(some(1), some(1)), 0)\n *\n * @category instances\n * @since 2.0.0\n */\nvar getOrd = function (O) { return ({\n    equals: (0, exports.getEq)(O).equals,\n    compare: function (x, y) { return (x === y ? 0 : (0, exports.isSome)(x) ? ((0, exports.isSome)(y) ? O.compare(x.value, y.value) : 1) : -1); }\n}); };\nexports.getOrd = getOrd;\n/**\n * Monoid returning the left-most non-`None` value. If both operands are `Some`s then the inner values are\n * concatenated using the provided `Semigroup`\n *\n * | x       | y       | concat(x, y)       |\n * | ------- | ------- | ------------------ |\n * | none    | none    | none               |\n * | some(a) | none    | some(a)            |\n * | none    | some(b) | some(b)            |\n * | some(a) | some(b) | some(concat(a, b)) |\n *\n * @example\n * import { getMonoid, some, none } from 'fp-ts/Option'\n * import { SemigroupSum } from 'fp-ts/number'\n *\n * const M = getMonoid(SemigroupSum)\n * assert.deepStrictEqual(M.concat(none, none), none)\n * assert.deepStrictEqual(M.concat(some(1), none), some(1))\n * assert.deepStrictEqual(M.concat(none, some(1)), some(1))\n * assert.deepStrictEqual(M.concat(some(1), some(2)), some(3))\n *\n * @category instances\n * @since 2.0.0\n */\nvar getMonoid = function (S) { return ({\n    concat: function (x, y) { return ((0, exports.isNone)(x) ? y : (0, exports.isNone)(y) ? x : (0, exports.some)(S.concat(x.value, y.value))); },\n    empty: exports.none\n}); };\nexports.getMonoid = getMonoid;\n/**\n * @category mapping\n * @since 2.0.0\n */\nvar map = function (f) { return function (fa) {\n    return (0, exports.isNone)(fa) ? exports.none : (0, exports.some)(f(fa.value));\n}; };\nexports.map = map;\n/**\n * @category instances\n * @since 2.7.0\n */\nexports.Functor = {\n    URI: exports.URI,\n    map: _map\n};\n/**\n * Maps the `Some` value of this `Option` to the specified constant value.\n *\n * @category mapping\n * @since 2.16.0\n */\nexports.as = (0, function_1.dual)(2, (0, Functor_1.as)(exports.Functor));\n/**\n * Maps the `Some` value of this `Option` to the void constant value.\n *\n * @category mapping\n * @since 2.16.0\n */\nexports.asUnit = (0, Functor_1.asUnit)(exports.Functor);\n/**\n * @category constructors\n * @since 2.7.0\n */\nexports.of = exports.some;\n/**\n * @category instances\n * @since 2.10.0\n */\nexports.Pointed = {\n    URI: exports.URI,\n    of: exports.of\n};\n/**\n * @since 2.0.0\n */\nvar ap = function (fa) { return function (fab) {\n    return (0, exports.isNone)(fab) ? exports.none : (0, exports.isNone)(fa) ? exports.none : (0, exports.some)(fab.value(fa.value));\n}; };\nexports.ap = ap;\n/**\n * @category instances\n * @since 2.10.0\n */\nexports.Apply = {\n    URI: exports.URI,\n    map: _map,\n    ap: _ap\n};\n/**\n * @category instances\n * @since 2.7.0\n */\nexports.Applicative = {\n    URI: exports.URI,\n    map: _map,\n    ap: _ap,\n    of: exports.of\n};\n/**\n * @category sequencing\n * @since 2.14.0\n */\nexports.flatMap = (0, function_1.dual)(2, function (ma, f) { return ((0, exports.isNone)(ma) ? exports.none : f(ma.value)); });\n/**\n * @category instances\n * @since 2.10.0\n */\nexports.Chain = {\n    URI: exports.URI,\n    map: _map,\n    ap: _ap,\n    chain: exports.flatMap\n};\n/**\n * @category instances\n * @since 2.7.0\n */\nexports.Monad = {\n    URI: exports.URI,\n    map: _map,\n    ap: _ap,\n    of: exports.of,\n    chain: exports.flatMap\n};\n/**\n * @category folding\n * @since 2.0.0\n */\nvar reduce = function (b, f) { return function (fa) {\n    return (0, exports.isNone)(fa) ? b : f(b, fa.value);\n}; };\nexports.reduce = reduce;\n/**\n * @category folding\n * @since 2.0.0\n */\nvar foldMap = function (M) { return function (f) { return function (fa) {\n    return (0, exports.isNone)(fa) ? M.empty : f(fa.value);\n}; }; };\nexports.foldMap = foldMap;\n/**\n * @category folding\n * @since 2.0.0\n */\nvar reduceRight = function (b, f) { return function (fa) {\n    return (0, exports.isNone)(fa) ? b : f(fa.value, b);\n}; };\nexports.reduceRight = reduceRight;\n/**\n * @category instances\n * @since 2.7.0\n */\nexports.Foldable = {\n    URI: exports.URI,\n    reduce: _reduce,\n    foldMap: _foldMap,\n    reduceRight: _reduceRight\n};\n/**\n * Returns the provided `Option` `that` if `self` is `None`, otherwise returns `self`.\n *\n * @param self - The first `Option` to be checked.\n * @param that - The `Option` to return if `self` is `None`.\n *\n * @example\n * import * as O from \"fp-ts/Option\"\n *\n * assert.deepStrictEqual(O.orElse(O.none, () => O.none), O.none)\n * assert.deepStrictEqual(O.orElse(O.some(1), () => O.none), O.some(1))\n * assert.deepStrictEqual(O.orElse(O.none, () => O.some('b')), O.some('b'))\n * assert.deepStrictEqual(O.orElse(O.some(1), () => O.some('b')), O.some(1))\n *\n * @category error handling\n * @since 2.16.0\n */\nexports.orElse = (0, function_1.dual)(2, function (self, that) { return ((0, exports.isNone)(self) ? that() : self); });\n/**\n * Alias of `orElse`.\n *\n * Less strict version of [`alt`](#alt).\n *\n * The `W` suffix (short for **W**idening) means that the return types will be merged.\n *\n * @category legacy\n * @since 2.9.0\n */\nexports.altW = exports.orElse;\n/**\n * Alias of `orElse`.\n *\n * @category legacy\n * @since 2.0.0\n */\nexports.alt = exports.orElse;\n/**\n * @category instances\n * @since 2.7.0\n */\nexports.Alt = {\n    URI: exports.URI,\n    map: _map,\n    alt: _alt\n};\n/**\n * @since 2.7.0\n */\nvar zero = function () { return exports.none; };\nexports.zero = zero;\n/**\n * @category instances\n * @since 2.11.0\n */\nexports.Zero = {\n    URI: exports.URI,\n    zero: exports.zero\n};\n/**\n * @category do notation\n * @since 2.11.0\n */\nexports.guard = (0, Zero_1.guard)(exports.Zero, exports.Pointed);\n/**\n * @category instances\n * @since 2.7.0\n */\nexports.Alternative = {\n    URI: exports.URI,\n    map: _map,\n    ap: _ap,\n    of: exports.of,\n    alt: _alt,\n    zero: exports.zero\n};\n/**\n * @since 2.0.0\n */\nvar extend = function (f) { return function (wa) {\n    return (0, exports.isNone)(wa) ? exports.none : (0, exports.some)(f(wa));\n}; };\nexports.extend = extend;\n/**\n * @category instances\n * @since 2.7.0\n */\nexports.Extend = {\n    URI: exports.URI,\n    map: _map,\n    extend: _extend\n};\n/**\n * @category filtering\n * @since 2.0.0\n */\nexports.compact = (0, exports.flatMap)(function_1.identity);\nvar defaultSeparated = /*#__PURE__*/ (0, Separated_1.separated)(exports.none, exports.none);\n/**\n * @category filtering\n * @since 2.0.0\n */\nvar separate = function (ma) {\n    return (0, exports.isNone)(ma) ? defaultSeparated : (0, Separated_1.separated)((0, exports.getLeft)(ma.value), (0, exports.getRight)(ma.value));\n};\nexports.separate = separate;\n/**\n * @category instances\n * @since 2.7.0\n */\nexports.Compactable = {\n    URI: exports.URI,\n    compact: exports.compact,\n    separate: exports.separate\n};\n/**\n * @category filtering\n * @since 2.0.0\n */\nvar filter = function (predicate) {\n    return function (fa) {\n        return (0, exports.isNone)(fa) ? exports.none : predicate(fa.value) ? fa : exports.none;\n    };\n};\nexports.filter = filter;\n/**\n * @category filtering\n * @since 2.0.0\n */\nvar filterMap = function (f) { return function (fa) {\n    return (0, exports.isNone)(fa) ? exports.none : f(fa.value);\n}; };\nexports.filterMap = filterMap;\n/**\n * @category filtering\n * @since 2.0.0\n */\nvar partition = function (predicate) {\n    return function (fa) {\n        return (0, Separated_1.separated)(_filter(fa, (0, Predicate_1.not)(predicate)), _filter(fa, predicate));\n    };\n};\nexports.partition = partition;\n/**\n * @category filtering\n * @since 2.0.0\n */\nvar partitionMap = function (f) { return (0, function_1.flow)((0, exports.map)(f), exports.separate); };\nexports.partitionMap = partitionMap;\n/**\n * @category instances\n * @since 2.7.0\n */\nexports.Filterable = {\n    URI: exports.URI,\n    map: _map,\n    compact: exports.compact,\n    separate: exports.separate,\n    filter: _filter,\n    filterMap: _filterMap,\n    partition: _partition,\n    partitionMap: _partitionMap\n};\n/**\n * @category traversing\n * @since 2.6.3\n */\nvar traverse = function (F) {\n    return function (f) {\n        return function (ta) {\n            return (0, exports.isNone)(ta) ? F.of(exports.none) : F.map(f(ta.value), exports.some);\n        };\n    };\n};\nexports.traverse = traverse;\n/**\n * @category traversing\n * @since 2.6.3\n */\nvar sequence = function (F) {\n    return function (ta) {\n        return (0, exports.isNone)(ta) ? F.of(exports.none) : F.map(ta.value, exports.some);\n    };\n};\nexports.sequence = sequence;\n/**\n * @category instances\n * @since 2.7.0\n */\nexports.Traversable = {\n    URI: exports.URI,\n    map: _map,\n    reduce: _reduce,\n    foldMap: _foldMap,\n    reduceRight: _reduceRight,\n    traverse: _traverse,\n    sequence: exports.sequence\n};\nvar _wither = /*#__PURE__*/ (0, Witherable_1.witherDefault)(exports.Traversable, exports.Compactable);\nvar _wilt = /*#__PURE__*/ (0, Witherable_1.wiltDefault)(exports.Traversable, exports.Compactable);\n/**\n * @category filtering\n * @since 2.6.5\n */\nvar wither = function (F) {\n    var _witherF = _wither(F);\n    return function (f) { return function (fa) { return _witherF(fa, f); }; };\n};\nexports.wither = wither;\n/**\n * @category filtering\n * @since 2.6.5\n */\nvar wilt = function (F) {\n    var _wiltF = _wilt(F);\n    return function (f) { return function (fa) { return _wiltF(fa, f); }; };\n};\nexports.wilt = wilt;\n/**\n * @category instances\n * @since 2.7.0\n */\nexports.Witherable = {\n    URI: exports.URI,\n    map: _map,\n    reduce: _reduce,\n    foldMap: _foldMap,\n    reduceRight: _reduceRight,\n    traverse: _traverse,\n    sequence: exports.sequence,\n    compact: exports.compact,\n    separate: exports.separate,\n    filter: _filter,\n    filterMap: _filterMap,\n    partition: _partition,\n    partitionMap: _partitionMap,\n    wither: _wither,\n    wilt: _wilt\n};\n/**\n * @since 2.7.0\n */\nvar throwError = function () { return exports.none; };\nexports.throwError = throwError;\n/**\n * @category instances\n * @since 2.7.0\n */\nexports.MonadThrow = {\n    URI: exports.URI,\n    map: _map,\n    ap: _ap,\n    of: exports.of,\n    chain: exports.flatMap,\n    throwError: exports.throwError\n};\n/**\n * Transforms an `Either` to an `Option` discarding the error.\n *\n * Alias of [getRight](#getright)\n *\n * @category conversions\n * @since 2.0.0\n */\nexports.fromEither = exports.getRight;\n/**\n * @category instances\n * @since 2.11.0\n */\nexports.FromEither = {\n    URI: exports.URI,\n    fromEither: exports.fromEither\n};\n// -------------------------------------------------------------------------------------\n// refinements\n// -------------------------------------------------------------------------------------\n/**\n * Returns `true` if the option is an instance of `Some`, `false` otherwise.\n *\n * @example\n * import { some, none, isSome } from 'fp-ts/Option'\n *\n * assert.strictEqual(isSome(some(1)), true)\n * assert.strictEqual(isSome(none), false)\n *\n * @category refinements\n * @since 2.0.0\n */\nexports.isSome = _.isSome;\n/**\n * Returns `true` if the option is `None`, `false` otherwise.\n *\n * @example\n * import { some, none, isNone } from 'fp-ts/Option'\n *\n * assert.strictEqual(isNone(some(1)), false)\n * assert.strictEqual(isNone(none), true)\n *\n * @category refinements\n * @since 2.0.0\n */\nvar isNone = function (fa) { return fa._tag === 'None'; };\nexports.isNone = isNone;\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 */\nvar matchW = function (onNone, onSome) {\n    return function (ma) {\n        return (0, exports.isNone)(ma) ? onNone() : onSome(ma.value);\n    };\n};\nexports.matchW = matchW;\n/**\n * Alias of [`matchW`](#matchw).\n *\n * @category pattern matching\n * @since 2.10.0\n */\nexports.foldW = exports.matchW;\n/**\n * Takes a (lazy) default value, a function, and an `Option` value, if the `Option` value is `None` the default value is\n * returned, otherwise the function is applied to the value inside the `Some` and the result is returned.\n *\n * @example\n * import { some, none, match } from 'fp-ts/Option'\n * import { pipe } from 'fp-ts/function'\n *\n * assert.strictEqual(\n *   pipe(\n *     some(1),\n *     match(() => 'a none', a => `a some containing ${a}`)\n *   ),\n *   'a some containing 1'\n * )\n *\n * assert.strictEqual(\n *   pipe(\n *     none,\n *     match(() => 'a none', a => `a some containing ${a}`)\n *   ),\n *   'a none'\n * )\n *\n * @category pattern matching\n * @since 2.10.0\n */\nexports.match = exports.matchW;\n/**\n * Alias of [`match`](#match).\n *\n * @category pattern matching\n * @since 2.0.0\n */\nexports.fold = exports.match;\n/**\n * Less strict version of [`getOrElse`](#getorelse).\n *\n * The `W` suffix (short for **W**idening) means that the handler return type will be merged.\n *\n * @category error handling\n * @since 2.6.0\n */\nvar getOrElseW = function (onNone) {\n    return function (ma) {\n        return (0, exports.isNone)(ma) ? onNone() : ma.value;\n    };\n};\nexports.getOrElseW = getOrElseW;\n/**\n * Extracts the value out of the structure, if it exists. Otherwise returns the given default value\n *\n * @example\n * import { some, none, getOrElse } from 'fp-ts/Option'\n * import { pipe } from 'fp-ts/function'\n *\n * assert.strictEqual(\n *   pipe(\n *     some(1),\n *     getOrElse(() => 0)\n *   ),\n *   1\n * )\n * assert.strictEqual(\n *   pipe(\n *     none,\n *     getOrElse(() => 0)\n *   ),\n *   0\n * )\n *\n * @category error handling\n * @since 2.0.0\n */\nexports.getOrElse = exports.getOrElseW;\n/**\n * @category mapping\n * @since 2.10.0\n */\nexports.flap = (0, Functor_1.flap)(exports.Functor);\n/**\n * Combine two effectful actions, keeping only the result of the first.\n *\n * @since 2.0.0\n */\nexports.apFirst = (0, Apply_1.apFirst)(exports.Apply);\n/**\n * Combine two effectful actions, keeping only the result of the second.\n *\n * @since 2.0.0\n */\nexports.apSecond = (0, Apply_1.apSecond)(exports.Apply);\n/**\n * @category sequencing\n * @since 2.0.0\n */\nexports.flatten = exports.compact;\n/**\n * Composes computations in sequence, using the return value of one computation to determine the next computation and\n * keeping only the result of the first.\n *\n * @category combinators\n * @since 2.15.0\n */\nexports.tap = (0, function_1.dual)(2, chainable.tap(exports.Chain));\n/**\n * Composes computations in sequence, using the return value of one computation to determine the next computation and\n * keeping only the result of the first.\n *\n * @example\n * import { pipe } from 'fp-ts/function'\n * import * as O from 'fp-ts/Option'\n * import * as E from 'fp-ts/Either'\n *\n * const compute = (value: number) => pipe(\n *   O.of(value),\n *   O.tapEither((value) => value > 0 ? E.right('ok') : E.left('error')),\n * )\n *\n * assert.deepStrictEqual(compute(1), O.of(1))\n * assert.deepStrictEqual(compute(-42), O.none)\n *\n * @category combinators\n * @since 2.16.0\n */\nexports.tapEither = (0, function_1.dual)(2, (0, FromEither_1.tapEither)(exports.FromEither, exports.Chain));\n/**\n * @since 2.0.0\n */\nexports.duplicate = (0, exports.extend)(function_1.identity);\n/**\n * @category lifting\n * @since 2.11.0\n */\nexports.fromEitherK = (0, FromEither_1.fromEitherK)(exports.FromEither);\n/**\n * @category sequencing\n * @since 2.11.0\n */\nexports.chainEitherK = \n/*#__PURE__*/ (0, FromEither_1.chainEitherK)(exports.FromEither, exports.Chain);\n/**\n * Alias of `tapEither`.\n *\n * @category legacy\n * @since 2.12.0\n */\nexports.chainFirstEitherK = exports.tapEither;\n/**\n * Constructs a new `Option` from a nullable type. If the value is `null` or `undefined`, returns `None`, otherwise\n * returns the value wrapped in a `Some`.\n *\n * @example\n * import { none, some, fromNullable } from 'fp-ts/Option'\n *\n * assert.deepStrictEqual(fromNullable(undefined), none)\n * assert.deepStrictEqual(fromNullable(null), none)\n * assert.deepStrictEqual(fromNullable(1), some(1))\n *\n * @category conversions\n * @since 2.0.0\n */\nvar fromNullable = function (a) { return (a == null ? exports.none : (0, exports.some)(a)); };\nexports.fromNullable = fromNullable;\n/**\n * Transforms an exception into an `Option`. If `f` throws, returns `None`, otherwise returns the output wrapped in a\n * `Some`.\n *\n * See also [`tryCatchK`](#trycatchk).\n *\n * @example\n * import { none, some, tryCatch } from 'fp-ts/Option'\n *\n * assert.deepStrictEqual(\n *   tryCatch(() => {\n *     throw new Error()\n *   }),\n *   none\n * )\n * assert.deepStrictEqual(tryCatch(() => 1), some(1))\n *\n * @category interop\n * @since 2.0.0\n */\nvar tryCatch = function (f) {\n    try {\n        return (0, exports.some)(f());\n    }\n    catch (e) {\n        return exports.none;\n    }\n};\nexports.tryCatch = tryCatch;\n/**\n * Converts a function that may throw to one returning a `Option`.\n *\n * @category interop\n * @since 2.10.0\n */\nvar tryCatchK = function (f) {\n    return function () {\n        var a = [];\n        for (var _i = 0; _i < arguments.length; _i++) {\n            a[_i] = arguments[_i];\n        }\n        return (0, exports.tryCatch)(function () { return f.apply(void 0, a); });\n    };\n};\nexports.tryCatchK = tryCatchK;\n/**\n * Returns a *smart constructor* from a function that returns a nullable value.\n *\n * @example\n * import { fromNullableK, none, some } from 'fp-ts/Option'\n *\n * const f = (s: string): number | undefined => {\n *   const n = parseFloat(s)\n *   return isNaN(n) ? undefined : n\n * }\n *\n * const g = fromNullableK(f)\n *\n * assert.deepStrictEqual(g('1'), some(1))\n * assert.deepStrictEqual(g('a'), none)\n *\n * @category lifting\n * @since 2.9.0\n */\nvar fromNullableK = function (f) { return (0, function_1.flow)(f, exports.fromNullable); };\nexports.fromNullableK = fromNullableK;\n/**\n * This is `chain` + `fromNullable`, useful when working with optional values.\n *\n * @example\n * import { some, none, fromNullable, chainNullableK } from 'fp-ts/Option'\n * import { pipe } from 'fp-ts/function'\n *\n * interface Employee {\n *   readonly company?: {\n *     readonly address?: {\n *       readonly street?: {\n *         readonly name?: string\n *       }\n *     }\n *   }\n * }\n *\n * const employee1: Employee = { company: { address: { street: { name: 'high street' } } } }\n *\n * assert.deepStrictEqual(\n *   pipe(\n *     fromNullable(employee1.company),\n *     chainNullableK(company => company.address),\n *     chainNullableK(address => address.street),\n *     chainNullableK(street => street.name)\n *   ),\n *   some('high street')\n * )\n *\n * const employee2: Employee = { company: { address: { street: {} } } }\n *\n * assert.deepStrictEqual(\n *   pipe(\n *     fromNullable(employee2.company),\n *     chainNullableK(company => company.address),\n *     chainNullableK(address => address.street),\n *     chainNullableK(street => street.name)\n *   ),\n *   none\n * )\n *\n * @category sequencing\n * @since 2.9.0\n */\nvar chainNullableK = function (f) {\n    return function (ma) {\n        return (0, exports.isNone)(ma) ? exports.none : (0, exports.fromNullable)(f(ma.value));\n    };\n};\nexports.chainNullableK = chainNullableK;\n/**\n * Extracts the value out of the structure, if it exists. Otherwise returns `null`.\n *\n * @example\n * import { some, none, toNullable } from 'fp-ts/Option'\n * import { pipe } from 'fp-ts/function'\n *\n * assert.strictEqual(\n *   pipe(\n *     some(1),\n *     toNullable\n *   ),\n *   1\n * )\n * assert.strictEqual(\n *   pipe(\n *     none,\n *     toNullable\n *   ),\n *   null\n * )\n *\n * @category conversions\n * @since 2.0.0\n */\nexports.toNullable = (0, exports.match)(function_1.constNull, function_1.identity);\n/**\n * Extracts the value out of the structure, if it exists. Otherwise returns `undefined`.\n *\n * @example\n * import { some, none, toUndefined } from 'fp-ts/Option'\n * import { pipe } from 'fp-ts/function'\n *\n * assert.strictEqual(\n *   pipe(\n *     some(1),\n *     toUndefined\n *   ),\n *   1\n * )\n * assert.strictEqual(\n *   pipe(\n *     none,\n *     toUndefined\n *   ),\n *   undefined\n * )\n *\n * @category conversions\n * @since 2.0.0\n */\nexports.toUndefined = (0, exports.match)(function_1.constUndefined, function_1.identity);\nfunction elem(E) {\n    return function (a, ma) {\n        if (ma === undefined) {\n            var elemE_1 = elem(E);\n            return function (ma) { return elemE_1(a, ma); };\n        }\n        return (0, exports.isNone)(ma) ? false : E.equals(a, ma.value);\n    };\n}\nexports.elem = elem;\n/**\n * Returns `true` if the predicate is satisfied by the wrapped value\n *\n * @example\n * import { some, none, exists } from 'fp-ts/Option'\n * import { pipe } from 'fp-ts/function'\n *\n * assert.strictEqual(\n *   pipe(\n *     some(1),\n *     exists(n => n > 0)\n *   ),\n *   true\n * )\n * assert.strictEqual(\n *   pipe(\n *     some(1),\n *     exists(n => n > 1)\n *   ),\n *   false\n * )\n * assert.strictEqual(\n *   pipe(\n *     none,\n *     exists(n => n > 0)\n *   ),\n *   false\n * )\n *\n * @since 2.0.0\n */\nvar exists = function (predicate) {\n    return function (ma) {\n        return (0, exports.isNone)(ma) ? false : predicate(ma.value);\n    };\n};\nexports.exists = exists;\n// -------------------------------------------------------------------------------------\n// do notation\n// -------------------------------------------------------------------------------------\n/**\n * @category do notation\n * @since 2.9.0\n */\nexports.Do = (0, exports.of)(_.emptyRecord);\n/**\n * @category do notation\n * @since 2.8.0\n */\nexports.bindTo = (0, Functor_1.bindTo)(exports.Functor);\nvar let_ = /*#__PURE__*/ (0, Functor_1.let)(exports.Functor);\nexports.let = let_;\n/**\n * @category do notation\n * @since 2.8.0\n */\nexports.bind = chainable.bind(exports.Chain);\n/**\n * @category do notation\n * @since 2.8.0\n */\nexports.apS = (0, Apply_1.apS)(exports.Apply);\n/**\n * @since 2.11.0\n */\nexports.ApT = (0, exports.of)(_.emptyReadonlyArray);\n// -------------------------------------------------------------------------------------\n// array utils\n// -------------------------------------------------------------------------------------\n/**\n * Equivalent to `ReadonlyNonEmptyArray#traverseWithIndex(Applicative)`.\n *\n * @category traversing\n * @since 2.11.0\n */\nvar traverseReadonlyNonEmptyArrayWithIndex = function (f) {\n    return function (as) {\n        var o = f(0, _.head(as));\n        if ((0, exports.isNone)(o)) {\n            return exports.none;\n        }\n        var out = [o.value];\n        for (var i = 1; i < as.length; i++) {\n            var o_1 = f(i, as[i]);\n            if ((0, exports.isNone)(o_1)) {\n                return exports.none;\n            }\n            out.push(o_1.value);\n        }\n        return (0, exports.some)(out);\n    };\n};\nexports.traverseReadonlyNonEmptyArrayWithIndex = traverseReadonlyNonEmptyArrayWithIndex;\n/**\n * Equivalent to `ReadonlyArray#traverseWithIndex(Applicative)`.\n *\n * @category traversing\n * @since 2.11.0\n */\nvar traverseReadonlyArrayWithIndex = function (f) {\n    var g = (0, exports.traverseReadonlyNonEmptyArrayWithIndex)(f);\n    return function (as) { return (_.isNonEmpty(as) ? g(as) : exports.ApT); };\n};\nexports.traverseReadonlyArrayWithIndex = traverseReadonlyArrayWithIndex;\n/**\n * Equivalent to `ReadonlyArray#traverseWithIndex(Applicative)`.\n *\n * @category traversing\n * @since 2.9.0\n */\nexports.traverseArrayWithIndex = exports.traverseReadonlyArrayWithIndex;\n/**\n * Equivalent to `ReadonlyArray#traverse(Applicative)`.\n *\n * @category traversing\n * @since 2.9.0\n */\nvar traverseArray = function (f) {\n    return (0, exports.traverseReadonlyArrayWithIndex)(function (_, a) { return f(a); });\n};\nexports.traverseArray = traverseArray;\n/**\n * Equivalent to `ReadonlyArray#sequence(Applicative)`.\n *\n * @category traversing\n * @since 2.9.0\n */\nexports.sequenceArray = \n/*#__PURE__*/ (0, exports.traverseArray)(function_1.identity);\n// -------------------------------------------------------------------------------------\n// legacy\n// -------------------------------------------------------------------------------------\n/**\n * Alias of `flatMap`.\n *\n * @category legacy\n * @since 2.0.0\n */\nexports.chain = exports.flatMap;\n/**\n * Alias of `tap`.\n *\n * @category legacy\n * @since 2.0.0\n */\nexports.chainFirst = exports.tap;\n// -------------------------------------------------------------------------------------\n// deprecated\n// -------------------------------------------------------------------------------------\n/**\n * Use `Refinement` module instead.\n *\n * @category zone of death\n * @since 2.0.0\n * @deprecated\n */\nfunction getRefinement(getOption) {\n    return function (a) { return (0, exports.isSome)(getOption(a)); };\n}\nexports.getRefinement = getRefinement;\n/**\n * Use [`chainNullableK`](#chainnullablek) instead.\n *\n * @category zone of death\n * @since 2.0.0\n * @deprecated\n */\nexports.mapNullable = exports.chainNullableK;\n/**\n * This instance is deprecated, use small, specific instances instead.\n * For example if a function needs a `Functor` instance, pass `O.Functor` instead of `O.option`\n * (where `O` is from `import O from 'fp-ts/Option'`)\n *\n * @category zone of death\n * @since 2.0.0\n * @deprecated\n */\nexports.option = {\n    URI: exports.URI,\n    map: _map,\n    of: exports.of,\n    ap: _ap,\n    chain: exports.flatMap,\n    reduce: _reduce,\n    foldMap: _foldMap,\n    reduceRight: _reduceRight,\n    traverse: _traverse,\n    sequence: exports.sequence,\n    zero: exports.zero,\n    alt: _alt,\n    extend: _extend,\n    compact: exports.compact,\n    separate: exports.separate,\n    filter: _filter,\n    filterMap: _filterMap,\n    partition: _partition,\n    partitionMap: _partitionMap,\n    wither: _wither,\n    wilt: _wilt,\n    throwError: exports.throwError\n};\n/**\n * Use [`getApplySemigroup`](./Apply.ts.html#getapplysemigroup) instead.\n *\n * @category zone of death\n * @since 2.0.0\n * @deprecated\n */\nexports.getApplySemigroup = (0, Apply_1.getApplySemigroup)(exports.Apply);\n/**\n * Use [`getApplicativeMonoid`](./Applicative.ts.html#getapplicativemonoid) instead.\n *\n * @category zone of death\n * @since 2.0.0\n * @deprecated\n */\nexports.getApplyMonoid = (0, Applicative_1.getApplicativeMonoid)(exports.Applicative);\n/**\n * Use\n *\n * ```ts\n * import { first } from 'fp-ts/Semigroup'\n * import { getMonoid } from 'fp-ts/Option'\n *\n * getMonoid(first())\n * ```\n *\n * instead.\n *\n * Monoid returning the left-most non-`None` value\n *\n * | x       | y       | concat(x, y) |\n * | ------- | ------- | ------------ |\n * | none    | none    | none         |\n * | some(a) | none    | some(a)      |\n * | none    | some(b) | some(b)      |\n * | some(a) | some(b) | some(a)      |\n *\n * @example\n * import { getFirstMonoid, some, none } from 'fp-ts/Option'\n *\n * const M = getFirstMonoid<number>()\n * assert.deepStrictEqual(M.concat(none, none), none)\n * assert.deepStrictEqual(M.concat(some(1), none), some(1))\n * assert.deepStrictEqual(M.concat(none, some(2)), some(2))\n * assert.deepStrictEqual(M.concat(some(1), some(2)), some(1))\n *\n * @category zone of death\n * @since 2.0.0\n * @deprecated\n */\nvar getFirstMonoid = function () { return (0, exports.getMonoid)((0, Semigroup_1.first)()); };\nexports.getFirstMonoid = getFirstMonoid;\n/**\n * Use\n *\n * ```ts\n * import { last } from 'fp-ts/Semigroup'\n * import { getMonoid } from 'fp-ts/Option'\n *\n * getMonoid(last())\n * ```\n *\n * instead.\n *\n * Monoid returning the right-most non-`None` value\n *\n * | x       | y       | concat(x, y) |\n * | ------- | ------- | ------------ |\n * | none    | none    | none         |\n * | some(a) | none    | some(a)      |\n * | none    | some(b) | some(b)      |\n * | some(a) | some(b) | some(b)      |\n *\n * @example\n * import { getLastMonoid, some, none } from 'fp-ts/Option'\n *\n * const M = getLastMonoid<number>()\n * assert.deepStrictEqual(M.concat(none, none), none)\n * assert.deepStrictEqual(M.concat(some(1), none), some(1))\n * assert.deepStrictEqual(M.concat(none, some(2)), some(2))\n * assert.deepStrictEqual(M.concat(some(1), some(2)), some(2))\n *\n * @category zone of death\n * @since 2.0.0\n * @deprecated\n */\nvar getLastMonoid = function () { return (0, exports.getMonoid)((0, Semigroup_1.last)()); };\nexports.getLastMonoid = getLastMonoid;\n"],"names":["this","exports","require$$0","require$$1","require$$2","require$$3","require$$4","require$$5","require$$6","require$$7","require$$8","require$$9","require$$10","require$$11","ma","_"],"mappings":";;;;;;;;;;;;;;;;;;;;;;AACA,QAAI,kBAAmBA,mCAAQA,iBAAAA,eAAK,oBAAqB,OAAO,SAAU,SAAS,GAAG,GAAG,GAAG,IAAI;AAC5F,UAAI,OAAO;AAAW,aAAK;AAC3B,UAAI,OAAO,OAAO,yBAAyB,GAAG,CAAC;AAC/C,UAAI,CAAC,SAAS,SAAS,OAAO,CAAC,EAAE,aAAa,KAAK,YAAY,KAAK,eAAe;AACjF,eAAO,EAAE,YAAY,MAAM,KAAK,WAAW;AAAE,iBAAO,EAAE,CAAC;AAAA,QAAE;MAC1D;AACD,aAAO,eAAe,GAAG,IAAI,IAAI;AAAA,IACpC,IAAK,SAAS,GAAG,GAAG,GAAG,IAAI;AACxB,UAAI,OAAO;AAAW,aAAK;AAC3B,QAAE,EAAE,IAAI,EAAE,CAAC;AAAA,IACd;AACD,QAAI,qBAAsBA,iBAAI,kBAAIA,gCAAK,uBAAwB,OAAO,SAAU,SAAS,GAAG,GAAG;AAC3F,aAAO,eAAe,GAAG,WAAW,EAAE,YAAY,MAAM,OAAO,EAAC,CAAE;AAAA,IACtE,IAAK,SAAS,GAAG,GAAG;AAChB,QAAE,SAAS,IAAI;AAAA,IACnB;AACA,QAAI,eAAgBA,iBAAI,kBAAIA,iBAAI,eAAC,gBAAiB,SAAU,KAAK;AAC7D,UAAI,OAAO,IAAI;AAAY,eAAO;AAClC,UAAI,SAAS,CAAA;AACb,UAAI,OAAO;AAAM,iBAAS,KAAK;AAAK,cAAI,MAAM,aAAa,OAAO,UAAU,eAAe,KAAK,KAAK,CAAC;AAAG,4BAAgB,QAAQ,KAAK,CAAC;AAAA;AACvI,yBAAmB,QAAQ,GAAG;AAC9B,aAAO;AAAA,IACX;AACA,WAAO,eAAcC,UAAU,cAAc,EAAE,OAAO,KAAI,CAAE;AAC5D,IAAAA,SAAqB,aAAAA,SAAA,OAAeA,kBAAiBA,SAAsB,cAAAA,SAAA,WAAmBA,oBAAmBA,SAAqB,aAAAA,SAAA,eAAuBA,SAAoB,YAAAA,SAAA,YAAoBA,SAAiB,SAAAA,SAAA,cAAsBA,oBAAmBA,SAAkB,UAAAA,SAAA,SAAiBA,SAAiB,SAAAA,SAAA,cAAsBA,SAAgB,QAAAA,SAAA,OAAeA,gBAAeA,SAAc,MAAAA,SAAA,MAAcA,SAAe,OAAAA,SAAA,SAAiBA,SAAmB,WAAAA,SAAA,cAAsBA,mBAAkBA,SAAiB,SAAAA,SAAA,QAAgBA,SAAgB,QAAAA,SAAA,UAAkBA,SAAsB,cAAAA,SAAA,QAAgBA,cAAaA,SAAkB,UAAAA,SAAA,KAAaA,SAAiB,SAAAA,SAAA,KAAaA,SAAkB,UAAAA,SAAA,MAAcA,qBAAoBA,SAAiB,SAAAA,SAAA,QAAgBA,SAAkB,UAAAA,SAAA,MAAcA,SAAmB,WAAAA,SAAA,UAAkBA,yBAAwBA,SAAe,OAAAA,SAAA,OAAe;AACj3B,IAAAA,SAAyB,iBAAAA,SAAA,iBAAyBA,6BAA4BA,SAAiB,SAAAA,SAAA,cAAsBA,yBAAwBA,SAAqB,aAAAA,SAAA,QAAgBA,SAAwB,gBAAAA,SAAA,gBAAwBA,SAAiC,yBAAAA,SAAA,iCAAyCA,kDAAiDA,SAAc,MAAAA,SAAA,MAAcA,SAAe,OAAAA,SAAA,MAAcA,SAAiB,SAAAA,SAAA,KAAaA,kBAAiBA,SAAe,OAAAA,SAAA,cAAsBA,SAAqB,aAAAA,SAAA,iBAAyBA,SAAwB,gBAAAA,SAAA,YAAoBA,oBAAmBA,SAAuB,eAAAA,SAAA,oBAA4BA,SAAuB,eAAAA,SAAA,cAAsBA,SAAoB,YAAAA,SAAA,YAAoBA,eAAcA,SAAkB,UAAAA,SAAA,WAAmBA,SAAkB,UAAAA,SAAA,OAAeA,SAAoB,YAAAA,SAAA,aAAqBA,gBAAeA,SAAgB,QAAAA,SAAA,QAAgBA,SAAiB,SAAAA,SAAA,SAAiBA,SAAiB,SAAAA,SAAA,aAAqBA,sBAAqBA,SAAqB,aAAAA,SAAA,aAAqB;AAClhC,IAAAA,SAAwB,gBAAA;AACxB,QAAI,gBAAgBC,YAAAA;AACpB,QAAI,UAAUC,MAAAA;AACd,QAAI,YAAY,aAAaC,MAAA,UAAA,CAAkB;AAC/C,QAAI,eAAeC,WAAAA;AACnB,QAAI,aAAaC,UAAAA;AACjB,QAAI,YAAYC,QAAAA;AAChB,QAAI,IAAI,aAAaC,SAAA,UAAA,CAAqB;AAC1C,QAAI,cAAcC,UAAAA;AAClB,QAAI,cAAcC,UAAAA;AAClB,QAAI,cAAcC,UAAAA;AAClB,QAAI,eAAeC,WAAAA;AACnB,QAAI,SAASC,KAAAA;AAUb,IAAAZ,SAAe,OAAA,EAAE;AAOjB,IAAAA,SAAe,OAAA,EAAE;AACjB,aAAS,cAAc,WAAW;AAC9B,aAAO,SAAU,GAAG;AAAE,eAAQ,UAAU,CAAC,KAAI,GAAIA,SAAQ,MAAM,CAAC,IAAIA,SAAQ;AAAA,MAAM;AAAA,IACrF;AACD,IAAAA,SAAA,gBAAwB;AAcxB,QAAI,UAAU,SAAU,IAAI;AAAE,aAAQ,GAAG,SAAS,UAAUA,SAAQ,QAAW,GAAAA,SAAQ,MAAM,GAAG,IAAI;AAAA;AACpG,IAAAA,SAAA,UAAkB;AAclB,QAAI,WAAW,SAAU,IAAI;AAAE,aAAQ,GAAG,SAAS,SAASA,SAAQ,QAAW,GAAAA,SAAQ,MAAM,GAAG,KAAK;AAAA;AACrG,IAAAA,SAAA,WAAmB;AACnB,QAAI,OAAO,SAAU,IAAI,GAAG;AAAE,cAAO,GAAI,WAAW,MAAM,KAAQ,GAAAA,SAAQ,KAAK,CAAC,CAAC;AAAA,IAAE;AACnF,QAAI,MAAM,SAAU,KAAK,IAAI;AAAE,cAAO,GAAI,WAAW,MAAM,MAAS,GAAAA,SAAQ,IAAI,EAAE,CAAC;AAAA,IAAE;AACrF,QAAI,UAAU,SAAU,IAAI,GAAG,GAAG;AAAE,iBAAW,WAAW,MAAM,KAAQ,GAAAA,SAAQ,QAAQ,GAAG,CAAC,CAAC;AAAA;AAC7F,QAAI,WAAW,SAAU,GAAG;AACxB,UAAI,YAAe,GAAAA,SAAQ,SAAS,CAAC;AACrC,aAAO,SAAU,IAAI,GAAG;AAAE,gBAAO,GAAI,WAAW,MAAM,IAAI,SAAS,CAAC,CAAC;AAAA,MAAE;AAAA,IAC3E;AACA,QAAI,eAAe,SAAU,IAAI,GAAG,GAAG;AAAE,iBAAW,WAAW,MAAM,KAAQ,GAAAA,SAAQ,aAAa,GAAG,CAAC,CAAC;AAAA;AACvG,QAAI,YAAY,SAAU,GAAG;AACzB,UAAI,aAAgB,GAAAA,SAAQ,UAAU,CAAC;AACvC,aAAO,SAAU,IAAI,GAAG;AAAE,gBAAO,GAAI,WAAW,MAAM,IAAI,UAAU,CAAC,CAAC;AAAA,MAAE;AAAA,IAC5E;AAEA,QAAI,OAAO,SAAU,IAAI,MAAM;AAAE,cAAO,GAAI,WAAW,MAAM,KAAQ,GAAAA,SAAQ,KAAK,IAAI,CAAC;AAAA,IAAE;AACzF,QAAI,UAAU,SAAU,IAAI,WAAW;AAAE,cAAO,GAAI,WAAW,MAAM,KAAQ,GAAAA,SAAQ,QAAQ,SAAS,CAAC;AAAA,IAAE;AAEzG,QAAI,aAAa,SAAU,IAAI,GAAG;AAAE,cAAO,GAAI,WAAW,MAAM,KAAQ,GAAAA,SAAQ,WAAW,CAAC,CAAC;AAAA,IAAE;AAE/F,QAAI,UAAU,SAAU,IAAI,GAAG;AAAE,cAAO,GAAI,WAAW,MAAM,KAAQ,GAAAA,SAAQ,QAAQ,CAAC,CAAC;AAAA,IAAE;AAEzF,QAAI,aAAa,SAAU,IAAI,WAAW;AACtC,cAAW,GAAA,WAAW,MAAM,KAAQ,GAAAA,SAAQ,WAAW,SAAS,CAAC;AAAA,IACrE;AAEA,QAAI,gBAAgB,SAAU,IAAI,GAAG;AAAE,cAAO,GAAI,WAAW,MAAM,KAAQ,GAAAA,SAAQ,cAAc,CAAC,CAAC;AAAA,IAAE;AAKrG,IAAAA,SAAA,MAAc;AAKd,QAAI,UAAU,SAAU,GAAG;AAAE,aAAQ;AAAA,QACjC,MAAM,SAAU,IAAI;AAAE,kBAAY,GAAAA,SAAQ,QAAQ,EAAE,IAAI,SAAS,QAAQ,OAAO,EAAE,KAAK,GAAG,KAAK,GAAG,GAAG;AAAA,QAAK;AAAA,MAC7G;AAAA;AACD,IAAAA,SAAA,UAAkB;AAgBlB,QAAI,QAAQ,SAAU,GAAG;AAAE,aAAQ;AAAA,QAC/B,QAAQ,SAAU,GAAG,GAAG;AAAE,iBAAO,MAAM,OAAU,GAAAA,SAAQ,QAAQ,CAAC,KAAI,GAAIA,SAAQ,QAAQ,CAAC,KAAQ,GAAAA,SAAQ,QAAQ,CAAC,IAAI,QAAQ,EAAE,OAAO,EAAE,OAAO,EAAE,KAAK;AAAA,QAAK;AAAA,MACjK;AAAA;AACD,IAAAA,SAAA,QAAgB;AAuBhB,QAAI,SAAS,SAAU,GAAG;AAAE,aAAQ;AAAA,QAChC,SAAQ,GAAIA,SAAQ,OAAO,CAAC,EAAE;AAAA,QAC9B,SAAS,SAAU,GAAG,GAAG;AAAE,iBAAQ,MAAM,IAAI,KAAQ,GAAAA,SAAQ,QAAQ,CAAC,KAAK,GAAIA,SAAQ,QAAQ,CAAC,IAAI,EAAE,QAAQ,EAAE,OAAO,EAAE,KAAK,IAAI,IAAK;AAAA,QAAM;AAAA,MAChJ;AAAA;AACD,IAAAA,SAAA,SAAiB;AAyBjB,QAAI,YAAY,SAAU,GAAG;AAAE,aAAQ;AAAA,QACnC,QAAQ,SAAU,GAAG,GAAG;AAAE,kBAAY,GAAAA,SAAQ,QAAQ,CAAC,IAAI,KAAI,GAAIA,SAAQ,QAAQ,CAAC,IAAI,KAAI,GAAIA,SAAQ,MAAM,EAAE,OAAO,EAAE,OAAO,EAAE,KAAK,CAAC;AAAA,QAAK;AAAA,QAC7I,OAAOA,SAAQ;AAAA,MAClB;AAAA;AACD,IAAAA,SAAA,YAAoB;AAKpB,QAAI,MAAM,SAAU,GAAG;AAAE,aAAO,SAAU,IAAI;AAC1C,gBAAW,GAAAA,SAAQ,QAAQ,EAAE,IAAIA,SAAQ,QAAW,GAAAA,SAAQ,MAAM,EAAE,GAAG,KAAK,CAAC;AAAA,MAChF;AAAA;AACD,IAAAA,SAAA,MAAc;AAKd,IAAAA,SAAkB,UAAA;AAAA,MACd,KAAKA,SAAQ;AAAA,MACb,KAAK;AAAA,IACT;AAOA,IAAAA,SAAa,SAAI,WAAW,MAAM,IAAO,GAAA,UAAU,IAAIA,SAAQ,OAAO,CAAC;AAOvE,IAAAA,SAAiB,UAAI,GAAA,UAAU,QAAQA,SAAQ,OAAO;AAKtD,IAAAA,SAAa,KAAAA,SAAQ;AAKrB,IAAAA,SAAkB,UAAA;AAAA,MACd,KAAKA,SAAQ;AAAA,MACb,IAAIA,SAAQ;AAAA,IAChB;AAIA,QAAI,KAAK,SAAU,IAAI;AAAE,aAAO,SAAU,KAAK;AAC3C,gBAAW,GAAAA,SAAQ,QAAQ,GAAG,IAAIA,SAAQ,WAAWA,SAAQ,QAAQ,EAAE,IAAIA,SAAQ,QAAW,GAAAA,SAAQ,MAAM,IAAI,MAAM,GAAG,KAAK,CAAC;AAAA,MAClI;AAAA;AACD,IAAAA,SAAA,KAAa;AAKb,IAAAA,SAAgB,QAAA;AAAA,MACZ,KAAKA,SAAQ;AAAA,MACb,KAAK;AAAA,MACL,IAAI;AAAA,IACR;AAKA,IAAAA,SAAsB,cAAA;AAAA,MAClB,KAAKA,SAAQ;AAAA,MACb,KAAK;AAAA,MACL,IAAI;AAAA,MACJ,IAAIA,SAAQ;AAAA,IAChB;AAKA,IAAAA,SAAA,WAAkB,GAAI,WAAW,MAAM,GAAG,SAAU,IAAI,GAAG;AAAE,cAAQ,GAAIA,SAAQ,QAAQ,EAAE,IAAIA,SAAQ,OAAO,EAAE,GAAG,KAAK;AAAA,IAAG,CAAE;AAK7H,IAAAA,SAAgB,QAAA;AAAA,MACZ,KAAKA,SAAQ;AAAA,MACb,KAAK;AAAA,MACL,IAAI;AAAA,MACJ,OAAOA,SAAQ;AAAA,IACnB;AAKA,IAAAA,SAAgB,QAAA;AAAA,MACZ,KAAKA,SAAQ;AAAA,MACb,KAAK;AAAA,MACL,IAAI;AAAA,MACJ,IAAIA,SAAQ;AAAA,MACZ,OAAOA,SAAQ;AAAA,IACnB;AAKA,QAAI,SAAS,SAAU,GAAG,GAAG;AAAE,aAAO,SAAU,IAAI;AAChD,gBAAW,GAAAA,SAAQ,QAAQ,EAAE,IAAI,IAAI,EAAE,GAAG,GAAG,KAAK;AAAA,MACrD;AAAA;AACD,IAAAA,SAAA,SAAiB;AAKjB,QAAI,UAAU,SAAU,GAAG;AAAE,aAAO,SAAU,GAAG;AAAE,eAAO,SAAU,IAAI;AACpE,kBAAW,GAAAA,SAAQ,QAAQ,EAAE,IAAI,EAAE,QAAQ,EAAE,GAAG,KAAK;AAAA,QACzD;AAAA,MAAE;AAAA,IAAG;AACL,IAAAA,SAAA,UAAkB;AAKlB,QAAI,cAAc,SAAU,GAAG,GAAG;AAAE,aAAO,SAAU,IAAI;AACrD,gBAAW,GAAAA,SAAQ,QAAQ,EAAE,IAAI,IAAI,EAAE,GAAG,OAAO,CAAC;AAAA,MACrD;AAAA;AACD,IAAAA,SAAA,cAAsB;AAKtB,IAAAA,SAAmB,WAAA;AAAA,MACf,KAAKA,SAAQ;AAAA,MACb,QAAQ;AAAA,MACR,SAAS;AAAA,MACT,aAAa;AAAA,IACjB;AAkBA,IAAAA,SAAA,aAAqB,WAAW,MAAM,GAAG,SAAU,MAAM,MAAM;AAAE,cAAY,GAAAA,SAAQ,QAAQ,IAAI,IAAI,SAAS;AAAA,IAAM,CAAE;AAWtH,IAAAA,SAAe,OAAAA,SAAQ;AAOvB,IAAAA,SAAc,MAAAA,SAAQ;AAKtB,IAAAA,SAAc,MAAA;AAAA,MACV,KAAKA,SAAQ;AAAA,MACb,KAAK;AAAA,MACL,KAAK;AAAA,IACT;AAIA,QAAI,OAAO,WAAY;AAAE,aAAOA,SAAQ;AAAA,IAAK;AAC7C,IAAAA,SAAA,OAAe;AAKf,IAAAA,SAAe,OAAA;AAAA,MACX,KAAKA,SAAQ;AAAA,MACb,MAAMA,SAAQ;AAAA,IAClB;AAKA,IAAAA,SAAA,SAAgB,GAAI,OAAO,OAAOA,SAAQ,MAAMA,SAAQ,OAAO;AAK/D,IAAAA,SAAsB,cAAA;AAAA,MAClB,KAAKA,SAAQ;AAAA,MACb,KAAK;AAAA,MACL,IAAI;AAAA,MACJ,IAAIA,SAAQ;AAAA,MACZ,KAAK;AAAA,MACL,MAAMA,SAAQ;AAAA,IAClB;AAIA,QAAI,SAAS,SAAU,GAAG;AAAE,aAAO,SAAU,IAAI;AAC7C,mBAAWA,SAAQ,QAAQ,EAAE,IAAIA,SAAQ,QAAO,GAAIA,SAAQ,MAAM,EAAE,EAAE,CAAC;AAAA,MAC1E;AAAA;AACD,IAAAA,SAAA,SAAiB;AAKjB,IAAAA,SAAiB,SAAA;AAAA,MACb,KAAKA,SAAQ;AAAA,MACb,KAAK;AAAA,MACL,QAAQ;AAAA,IACZ;AAKA,IAAAA,SAAkB,WAAI,GAAAA,SAAQ,SAAS,WAAW,QAAQ;AAC1D,QAAI,mBAAqC,oBAAA,YAAY,WAAWA,SAAQ,MAAMA,SAAQ,IAAI;AAK1F,QAAI,WAAW,SAAU,IAAI;AACzB,cAAW,GAAAA,SAAQ,QAAQ,EAAE,IAAI,oBAAuB,GAAA,YAAY,YAAe,GAAAA,SAAQ,SAAS,GAAG,KAAK,IAAO,GAAAA,SAAQ,UAAU,GAAG,KAAK,CAAC;AAAA,IAClJ;AACA,IAAAA,SAAA,WAAmB;AAKnB,IAAAA,SAAsB,cAAA;AAAA,MAClB,KAAKA,SAAQ;AAAA,MACb,SAASA,SAAQ;AAAA,MACjB,UAAUA,SAAQ;AAAA,IACtB;AAKA,QAAI,SAAS,SAAU,WAAW;AAC9B,aAAO,SAAU,IAAI;AACjB,gBAAW,GAAAA,SAAQ,QAAQ,EAAE,IAAIA,SAAQ,OAAO,UAAU,GAAG,KAAK,IAAI,KAAKA,SAAQ;AAAA,MAC3F;AAAA,IACA;AACA,IAAAA,SAAA,SAAiB;AAKjB,QAAI,YAAY,SAAU,GAAG;AAAE,aAAO,SAAU,IAAI;AAChD,gBAAW,GAAAA,SAAQ,QAAQ,EAAE,IAAIA,SAAQ,OAAO,EAAE,GAAG,KAAK;AAAA,MAC7D;AAAA;AACD,IAAAA,SAAA,YAAoB;AAKpB,QAAI,YAAY,SAAU,WAAW;AACjC,aAAO,SAAU,IAAI;AACjB,gBAAW,GAAA,YAAY,WAAW,QAAQ,KAAI,GAAI,YAAY,KAAK,SAAS,CAAC,GAAG,QAAQ,IAAI,SAAS,CAAC;AAAA,MAC9G;AAAA,IACA;AACA,IAAAA,SAAA,YAAoB;AAKpB,QAAI,eAAe,SAAU,GAAG;AAAE,cAAO,GAAI,WAAW,OAAU,GAAAA,SAAQ,KAAK,CAAC,GAAGA,SAAQ,QAAQ;AAAA,IAAE;AACrG,IAAAA,SAAA,eAAuB;AAKvB,IAAAA,SAAqB,aAAA;AAAA,MACjB,KAAKA,SAAQ;AAAA,MACb,KAAK;AAAA,MACL,SAASA,SAAQ;AAAA,MACjB,UAAUA,SAAQ;AAAA,MAClB,QAAQ;AAAA,MACR,WAAW;AAAA,MACX,WAAW;AAAA,MACX,cAAc;AAAA,IAClB;AAKA,QAAI,WAAW,SAAU,GAAG;AACxB,aAAO,SAAU,GAAG;AAChB,eAAO,SAAU,IAAI;AACjB,kBAAO,GAAIA,SAAQ,QAAQ,EAAE,IAAI,EAAE,GAAGA,SAAQ,IAAI,IAAI,EAAE,IAAI,EAAE,GAAG,KAAK,GAAGA,SAAQ,IAAI;AAAA,QACjG;AAAA,MACA;AAAA,IACA;AACA,IAAAA,SAAA,WAAmB;AAKnB,QAAI,WAAW,SAAU,GAAG;AACxB,aAAO,SAAU,IAAI;AACjB,gBAAO,GAAIA,SAAQ,QAAQ,EAAE,IAAI,EAAE,GAAGA,SAAQ,IAAI,IAAI,EAAE,IAAI,GAAG,OAAOA,SAAQ,IAAI;AAAA,MAC1F;AAAA,IACA;AACA,IAAAA,SAAA,WAAmB;AAKnB,IAAAA,SAAsB,cAAA;AAAA,MAClB,KAAKA,SAAQ;AAAA,MACb,KAAK;AAAA,MACL,QAAQ;AAAA,MACR,SAAS;AAAA,MACT,aAAa;AAAA,MACb,UAAU;AAAA,MACV,UAAUA,SAAQ;AAAA,IACtB;AACA,QAAI,UAA4B,oBAAA,aAAa,eAAeA,SAAQ,aAAaA,SAAQ,WAAW;AACpG,QAAI,QAA0B,oBAAA,aAAa,aAAaA,SAAQ,aAAaA,SAAQ,WAAW;AAKhG,QAAI,SAAS,SAAU,GAAG;AACtB,UAAI,WAAW,QAAQ,CAAC;AACxB,aAAO,SAAU,GAAG;AAAE,eAAO,SAAU,IAAI;AAAE,iBAAO,SAAS,IAAI,CAAC;AAAA,QAAE;AAAA,MAAG;AAAA,IAC3E;AACA,IAAAA,SAAA,SAAiB;AAKjB,QAAI,OAAO,SAAU,GAAG;AACpB,UAAI,SAAS,MAAM,CAAC;AACpB,aAAO,SAAU,GAAG;AAAE,eAAO,SAAU,IAAI;AAAE,iBAAO,OAAO,IAAI,CAAC;AAAA,QAAE;AAAA,MAAG;AAAA,IACzE;AACA,IAAAA,SAAA,OAAe;AAKf,IAAAA,SAAqB,aAAA;AAAA,MACjB,KAAKA,SAAQ;AAAA,MACb,KAAK;AAAA,MACL,QAAQ;AAAA,MACR,SAAS;AAAA,MACT,aAAa;AAAA,MACb,UAAU;AAAA,MACV,UAAUA,SAAQ;AAAA,MAClB,SAASA,SAAQ;AAAA,MACjB,UAAUA,SAAQ;AAAA,MAClB,QAAQ;AAAA,MACR,WAAW;AAAA,MACX,WAAW;AAAA,MACX,cAAc;AAAA,MACd,QAAQ;AAAA,MACR,MAAM;AAAA,IACV;AAIA,QAAI,aAAa,WAAY;AAAE,aAAOA,SAAQ;AAAA,IAAK;AACnD,IAAAA,SAAA,aAAqB;AAKrB,IAAAA,SAAqB,aAAA;AAAA,MACjB,KAAKA,SAAQ;AAAA,MACb,KAAK;AAAA,MACL,IAAI;AAAA,MACJ,IAAIA,SAAQ;AAAA,MACZ,OAAOA,SAAQ;AAAA,MACf,YAAYA,SAAQ;AAAA,IACxB;AASA,IAAAA,SAAqB,aAAAA,SAAQ;AAK7B,IAAAA,SAAqB,aAAA;AAAA,MACjB,KAAKA,SAAQ;AAAA,MACb,YAAYA,SAAQ;AAAA,IACxB;AAgBA,IAAAA,SAAiB,SAAA,EAAE;AAanB,QAAI,SAAS,SAAU,IAAI;AAAE,aAAO,GAAG,SAAS;AAAA;AAChD,IAAAA,SAAA,SAAiB;AASjB,QAAI,SAAS,SAAU,QAAQ,QAAQ;AACnC,aAAO,SAAU,IAAI;AACjB,gBAAW,GAAAA,SAAQ,QAAQ,EAAE,IAAI,OAAM,IAAK,OAAO,GAAG,KAAK;AAAA,MACnE;AAAA,IACA;AACA,IAAAA,SAAA,SAAiB;AAOjB,IAAAA,SAAgB,QAAAA,SAAQ;AA4BxB,IAAAA,SAAgB,QAAAA,SAAQ;AAOxB,IAAAA,SAAe,OAAAA,SAAQ;AASvB,QAAI,aAAa,SAAU,QAAQ;AAC/B,aAAO,SAAU,IAAI;AACjB,gBAAO,GAAIA,SAAQ,QAAQ,EAAE,IAAI,OAAQ,IAAG,GAAG;AAAA,MACvD;AAAA,IACA;AACA,IAAAA,SAAA,aAAqB;AA0BrB,IAAAA,SAAoB,YAAAA,SAAQ;AAK5B,IAAAA,SAAe,QAAI,GAAA,UAAU,MAAMA,SAAQ,OAAO;AAMlD,IAAAA,SAAkB,WAAI,GAAA,QAAQ,SAASA,SAAQ,KAAK;AAMpD,IAAAA,SAAmB,YAAI,GAAA,QAAQ,UAAUA,SAAQ,KAAK;AAKtD,IAAAA,SAAkB,UAAAA,SAAQ;AAQ1B,IAAAA,SAAA,UAAkB,WAAW,MAAM,GAAG,UAAU,IAAIA,SAAQ,KAAK,CAAC;AAqBlE,IAAAA,SAAoB,aAAA,GAAI,WAAW,MAAM,IAAG,GAAI,aAAa,WAAWA,SAAQ,YAAYA,SAAQ,KAAK,CAAC;AAI1G,IAAAA,SAAoB,aAAI,GAAAA,SAAQ,QAAQ,WAAW,QAAQ;AAK3D,IAAAA,SAAsB,eAAI,GAAA,aAAa,aAAaA,SAAQ,UAAU;AAKtE,IAAAA,SAAA,eACkB,oBAAA,aAAa,cAAcA,SAAQ,YAAYA,SAAQ,KAAK;AAO9E,IAAAA,SAA4B,oBAAAA,SAAQ;AAepC,QAAI,eAAe,SAAU,GAAG;AAAE,aAAQ,KAAK,OAAOA,SAAQ,QAAO,GAAIA,SAAQ,MAAM,CAAC;AAAA,IAAG;AAC3F,IAAAA,SAAA,eAAuB;AAqBvB,QAAI,WAAW,SAAU,GAAG;AACxB,UAAI;AACA,gBAAQ,GAAGA,SAAQ,MAAM,EAAG,CAAA;AAAA,MAC/B,SACM,GAAP;AACI,eAAOA,SAAQ;AAAA,MAClB;AAAA,IACL;AACA,IAAAA,SAAA,WAAmB;AAOnB,QAAI,YAAY,SAAU,GAAG;AACzB,aAAO,WAAY;AACf,YAAI,IAAI,CAAA;AACR,iBAAS,KAAK,GAAG,KAAK,UAAU,QAAQ,MAAM;AAC1C,YAAE,EAAE,IAAI,UAAU,EAAE;AAAA,QACvB;AACD,mBAAWA,SAAQ,UAAU,WAAY;AAAE,iBAAO,EAAE,MAAM,QAAQ,CAAC;AAAA,QAAI,CAAA;AAAA,MAC/E;AAAA,IACA;AACA,IAAAA,SAAA,YAAoB;AAoBpB,QAAI,gBAAgB,SAAU,GAAG;AAAE,cAAW,GAAA,WAAW,MAAM,GAAGA,SAAQ,YAAY;AAAA,IAAE;AACxF,IAAAA,SAAA,gBAAwB;AA6CxB,QAAI,iBAAiB,SAAU,GAAG;AAC9B,aAAO,SAAU,IAAI;AACjB,gBAAW,GAAAA,SAAQ,QAAQ,EAAE,IAAIA,SAAQ,QAAW,GAAAA,SAAQ,cAAc,EAAE,GAAG,KAAK,CAAC;AAAA,MAC7F;AAAA,IACA;AACA,IAAAA,SAAA,iBAAyB;AA0BzB,IAAAA,SAAA,cAAqB,GAAIA,SAAQ,OAAO,WAAW,WAAW,WAAW,QAAQ;AA0BjF,IAAAA,SAAA,eAAsB,GAAIA,SAAQ,OAAO,WAAW,gBAAgB,WAAW,QAAQ;AACvF,aAAS,KAAK,GAAG;AACb,aAAO,SAAU,GAAG,IAAI;AACpB,YAAI,OAAO,QAAW;AAClB,cAAI,UAAU,KAAK,CAAC;AACpB,iBAAO,SAAUa,KAAI;AAAE,mBAAO,QAAQ,GAAGA,GAAE;AAAA;QAC9C;AACD,mBAAWb,SAAQ,QAAQ,EAAE,IAAI,QAAQ,EAAE,OAAO,GAAG,GAAG,KAAK;AAAA,MACrE;AAAA,IACC;AACD,IAAAA,SAAA,OAAe;AAgCf,QAAI,SAAS,SAAU,WAAW;AAC9B,aAAO,SAAU,IAAI;AACjB,gBAAW,GAAAA,SAAQ,QAAQ,EAAE,IAAI,QAAQ,UAAU,GAAG,KAAK;AAAA,MACnE;AAAA,IACA;AACA,IAAAA,SAAA,SAAiB;AAQjB,IAAAA,SAAa,MAAI,GAAAA,SAAQ,IAAI,EAAE,WAAW;AAK1C,IAAAA,SAAiB,UAAI,GAAA,UAAU,QAAQA,SAAQ,OAAO;AACtD,QAAI,OAAqB,oBAAI,UAAU,KAAKA,SAAQ,OAAO;AAC3D,IAAAA,SAAA,MAAc;AAKd,IAAAA,SAAe,OAAA,UAAU,KAAKA,SAAQ,KAAK;AAK3C,IAAAA,SAAc,OAAI,GAAA,QAAQ,KAAKA,SAAQ,KAAK;AAI5C,IAAAA,SAAc,OAAI,GAAAA,SAAQ,IAAI,EAAE,kBAAkB;AAUlD,QAAI,yCAAyC,SAAU,GAAG;AACtD,aAAO,SAAU,IAAI;AACjB,YAAI,IAAI,EAAE,GAAG,EAAE,KAAK,EAAE,CAAC;AACvB,gBAAQA,SAAQ,QAAQ,CAAC,GAAG;AACxB,iBAAOA,SAAQ;AAAA,QAClB;AACD,YAAI,MAAM,CAAC,EAAE,KAAK;AAClB,iBAAS,IAAI,GAAG,IAAI,GAAG,QAAQ,KAAK;AAChC,cAAI,MAAM,EAAE,GAAG,GAAG,CAAC,CAAC;AACpB,kBAAQA,SAAQ,QAAQ,GAAG,GAAG;AAC1B,mBAAOA,SAAQ;AAAA,UAClB;AACD,cAAI,KAAK,IAAI,KAAK;AAAA,QACrB;AACD,mBAAWA,SAAQ,MAAM,GAAG;AAAA,MACpC;AAAA,IACA;AACA,IAAAA,SAAA,yCAAiD;AAOjD,QAAI,iCAAiC,SAAU,GAAG;AAC9C,UAAI,KAAQ,GAAAA,SAAQ,wCAAwC,CAAC;AAC7D,aAAO,SAAU,IAAI;AAAE,eAAQ,EAAE,WAAW,EAAE,IAAI,EAAE,EAAE,IAAIA,SAAQ;AAAA,MAAK;AAAA,IAC3E;AACA,IAAAA,SAAA,iCAAyC;AAOzC,IAAAA,SAAiC,yBAAAA,SAAQ;AAOzC,QAAI,gBAAgB,SAAU,GAAG;AAC7B,iBAAWA,SAAQ,gCAAgC,SAAUc,IAAG,GAAG;AAAE,eAAO,EAAE,CAAC;AAAA,MAAE,CAAE;AAAA,IACvF;AACA,IAAAd,SAAA,gBAAwB;AAOxB,IAAAA,SAAA,gBACc,oBAAIA,SAAQ,eAAe,WAAW,QAAQ;AAU5D,IAAAA,SAAgB,QAAAA,SAAQ;AAOxB,IAAAA,SAAqB,aAAAA,SAAQ;AAW7B,aAAS,cAAc,WAAW;AAC9B,aAAO,SAAU,GAAG;AAAE,mBAAWA,SAAQ,QAAQ,UAAU,CAAC,CAAC;AAAA;IAChE;AACD,IAAAA,SAAA,gBAAwB;AAQxB,IAAAA,SAAsB,cAAAA,SAAQ;AAU9B,IAAAA,SAAiB,SAAA;AAAA,MACb,KAAKA,SAAQ;AAAA,MACb,KAAK;AAAA,MACL,IAAIA,SAAQ;AAAA,MACZ,IAAI;AAAA,MACJ,OAAOA,SAAQ;AAAA,MACf,QAAQ;AAAA,MACR,SAAS;AAAA,MACT,aAAa;AAAA,MACb,UAAU;AAAA,MACV,UAAUA,SAAQ;AAAA,MAClB,MAAMA,SAAQ;AAAA,MACd,KAAK;AAAA,MACL,QAAQ;AAAA,MACR,SAASA,SAAQ;AAAA,MACjB,UAAUA,SAAQ;AAAA,MAClB,QAAQ;AAAA,MACR,WAAW;AAAA,MACX,WAAW;AAAA,MACX,cAAc;AAAA,MACd,QAAQ;AAAA,MACR,MAAM;AAAA,MACN,YAAYA,SAAQ;AAAA,IACxB;AAQA,IAAAA,SAA4B,qBAAI,GAAA,QAAQ,mBAAmBA,SAAQ,KAAK;AAQxE,IAAAA,SAAyB,kBAAI,GAAA,cAAc,sBAAsBA,SAAQ,WAAW;AAmCpF,QAAI,iBAAiB,WAAY;AAAE,iBAAWA,SAAQ,YAAW,GAAI,YAAY,QAAQ;AAAA;AACzF,IAAAA,SAAA,iBAAyB;AAmCzB,QAAI,gBAAgB,WAAY;AAAE,iBAAWA,SAAQ,YAAW,GAAI,YAAY,OAAO;AAAA;AACvF,IAAAA,SAAA,gBAAwB;AAAA;;;;","x_google_ignoreList":[0]}