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

@@ -1 +0,0 @@
-{"version":3,"file":"NonEmptyArray.cjs","sources":["../../../../../../node_modules/fp-ts/lib/NonEmptyArray.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};\nvar __spreadArray = (this && this.__spreadArray) || function (to, from, pack) {\n    if (pack || arguments.length === 2) for (var i = 0, l = from.length, ar; i < l; i++) {\n        if (ar || !(i in from)) {\n            if (!ar) ar = Array.prototype.slice.call(from, 0, i);\n            ar[i] = from[i];\n        }\n    }\n    return to.concat(ar || Array.prototype.slice.call(from));\n};\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.mapWithIndex = exports.map = exports.flatten = exports.duplicate = exports.extend = exports.flatMap = exports.ap = exports.alt = exports.altW = exports.chunksOf = exports.splitAt = exports.chop = exports.chainWithIndex = exports.foldMap = exports.foldMapWithIndex = exports.intersperse = exports.prependAll = exports.unzip = exports.zip = exports.zipWith = exports.of = exports.copy = exports.modifyAt = exports.updateAt = exports.insertAt = exports.sort = exports.groupBy = exports.group = exports.reverse = exports.concat = exports.concatW = exports.unappend = exports.unprepend = exports.range = exports.replicate = exports.makeBy = exports.fromArray = exports.fromReadonlyNonEmptyArray = exports.rotate = exports.union = exports.sortBy = exports.uniq = exports.unsafeUpdateAt = exports.unsafeInsertAt = exports.append = exports.appendW = exports.prepend = exports.prependW = exports.isOutOfBound = exports.isNonEmpty = void 0;\nexports.chain = exports.intercalate = exports.updateLast = exports.modifyLast = exports.updateHead = exports.modifyHead = exports.matchRight = exports.matchLeft = exports.concatAll = exports.max = exports.min = exports.init = exports.last = exports.tail = exports.head = exports.apS = exports.bind = exports.let = exports.bindTo = exports.Do = exports.Comonad = exports.Alt = exports.TraversableWithIndex = exports.Traversable = exports.FoldableWithIndex = exports.Foldable = exports.Monad = exports.chainFirst = exports.Chain = exports.Applicative = exports.apSecond = exports.apFirst = exports.Apply = exports.FunctorWithIndex = exports.Pointed = exports.flap = exports.Functor = exports.getUnionSemigroup = exports.getEq = exports.getSemigroup = exports.getShow = exports.URI = exports.extract = exports.traverseWithIndex = exports.sequence = exports.traverse = exports.reduceRightWithIndex = exports.reduceRight = exports.reduceWithIndex = exports.reduce = void 0;\nexports.nonEmptyArray = exports.fold = exports.prependToAll = exports.snoc = exports.cons = exports.unsnoc = exports.uncons = exports.filterWithIndex = exports.filter = exports.groupSort = void 0;\nvar Apply_1 = require(\"./Apply\");\nvar Chain_1 = require(\"./Chain\");\nvar function_1 = require(\"./function\");\nvar Functor_1 = require(\"./Functor\");\nvar _ = __importStar(require(\"./internal\"));\nvar Ord_1 = require(\"./Ord\");\nvar RNEA = __importStar(require(\"./ReadonlyNonEmptyArray\"));\n// -------------------------------------------------------------------------------------\n// internal\n// -------------------------------------------------------------------------------------\n/**\n * @internal\n */\nvar isNonEmpty = function (as) { return as.length > 0; };\nexports.isNonEmpty = isNonEmpty;\n/**\n * @internal\n */\nvar isOutOfBound = function (i, as) { return i < 0 || i >= as.length; };\nexports.isOutOfBound = isOutOfBound;\n/**\n * @internal\n */\nvar prependW = function (head) {\n    return function (tail) {\n        return __spreadArray([head], tail, true);\n    };\n};\nexports.prependW = prependW;\n/**\n * @internal\n */\nexports.prepend = exports.prependW;\n/**\n * @internal\n */\nvar appendW = function (end) {\n    return function (init) {\n        return __spreadArray(__spreadArray([], init, true), [end], false);\n    };\n};\nexports.appendW = appendW;\n/**\n * @internal\n */\nexports.append = exports.appendW;\n/**\n * @internal\n */\nvar unsafeInsertAt = function (i, a, as) {\n    if ((0, exports.isNonEmpty)(as)) {\n        var xs = (0, exports.fromReadonlyNonEmptyArray)(as);\n        xs.splice(i, 0, a);\n        return xs;\n    }\n    return [a];\n};\nexports.unsafeInsertAt = unsafeInsertAt;\n/**\n * @internal\n */\nvar unsafeUpdateAt = function (i, a, as) {\n    var xs = (0, exports.fromReadonlyNonEmptyArray)(as);\n    xs[i] = a;\n    return xs;\n};\nexports.unsafeUpdateAt = unsafeUpdateAt;\n/**\n * Remove duplicates from a `NonEmptyArray`, keeping the first occurrence of an element.\n *\n * @example\n * import { uniq } from 'fp-ts/NonEmptyArray'\n * import * as N from 'fp-ts/number'\n *\n * assert.deepStrictEqual(uniq(N.Eq)([1, 2, 1]), [1, 2])\n *\n * @since 2.11.0\n */\nvar uniq = function (E) {\n    return function (as) {\n        if (as.length === 1) {\n            return (0, exports.copy)(as);\n        }\n        var out = [(0, exports.head)(as)];\n        var rest = (0, exports.tail)(as);\n        var _loop_1 = function (a) {\n            if (out.every(function (o) { return !E.equals(o, a); })) {\n                out.push(a);\n            }\n        };\n        for (var _i = 0, rest_1 = rest; _i < rest_1.length; _i++) {\n            var a = rest_1[_i];\n            _loop_1(a);\n        }\n        return out;\n    };\n};\nexports.uniq = uniq;\n/**\n * Sort the elements of a `NonEmptyArray` in increasing order, where elements are compared using first `ords[0]`, then `ords[1]`,\n * etc...\n *\n * @example\n * import * as NEA from 'fp-ts/NonEmptyArray'\n * import { contramap } from 'fp-ts/Ord'\n * import * as S from 'fp-ts/string'\n * import * as N from 'fp-ts/number'\n * import { pipe } from 'fp-ts/function'\n *\n * interface Person {\n *   name: string\n *   age: number\n * }\n *\n * const byName = pipe(S.Ord, contramap((p: Person) => p.name))\n *\n * const byAge = pipe(N.Ord, contramap((p: Person) => p.age))\n *\n * const sortByNameByAge = NEA.sortBy([byName, byAge])\n *\n * const persons: NEA.NonEmptyArray<Person> = [\n *   { name: 'a', age: 1 },\n *   { name: 'b', age: 3 },\n *   { name: 'c', age: 2 },\n *   { name: 'b', age: 2 }\n * ]\n *\n * assert.deepStrictEqual(sortByNameByAge(persons), [\n *   { name: 'a', age: 1 },\n *   { name: 'b', age: 2 },\n *   { name: 'b', age: 3 },\n *   { name: 'c', age: 2 }\n * ])\n *\n * @since 2.11.0\n */\nvar sortBy = function (ords) {\n    if ((0, exports.isNonEmpty)(ords)) {\n        var M = (0, Ord_1.getMonoid)();\n        return (0, exports.sort)(ords.reduce(M.concat, M.empty));\n    }\n    return exports.copy;\n};\nexports.sortBy = sortBy;\n/**\n * @since 2.11.0\n */\nvar union = function (E) {\n    var uniqE = (0, exports.uniq)(E);\n    return function (second) { return function (first) { return uniqE((0, function_1.pipe)(first, concat(second))); }; };\n};\nexports.union = union;\n/**\n * Rotate a `NonEmptyArray` by `n` steps.\n *\n * @example\n * import { rotate } from 'fp-ts/NonEmptyArray'\n *\n * assert.deepStrictEqual(rotate(2)([1, 2, 3, 4, 5]), [4, 5, 1, 2, 3])\n * assert.deepStrictEqual(rotate(-2)([1, 2, 3, 4, 5]), [3, 4, 5, 1, 2])\n *\n * @since 2.11.0\n */\nvar rotate = function (n) {\n    return function (as) {\n        var len = as.length;\n        var m = Math.round(n) % len;\n        if ((0, exports.isOutOfBound)(Math.abs(m), as) || m === 0) {\n            return (0, exports.copy)(as);\n        }\n        if (m < 0) {\n            var _a = (0, exports.splitAt)(-m)(as), f = _a[0], s = _a[1];\n            return (0, function_1.pipe)(s, concat(f));\n        }\n        else {\n            return (0, exports.rotate)(m - len)(as);\n        }\n    };\n};\nexports.rotate = rotate;\n// -------------------------------------------------------------------------------------\n// constructors\n// -------------------------------------------------------------------------------------\n/**\n * @category conversions\n * @since 2.10.0\n */\nexports.fromReadonlyNonEmptyArray = _.fromReadonlyNonEmptyArray;\n/**\n * Builds a `NonEmptyArray` from an `Array` returning `none` if `as` is an empty array\n *\n * @category conversions\n * @since 2.0.0\n */\nvar fromArray = function (as) { return ((0, exports.isNonEmpty)(as) ? _.some(as) : _.none); };\nexports.fromArray = fromArray;\n/**\n * Return a `NonEmptyArray` of length `n` with element `i` initialized with `f(i)`.\n *\n * **Note**. `n` is normalized to a natural number.\n *\n * @example\n * import { makeBy } from 'fp-ts/NonEmptyArray'\n * import { pipe } from 'fp-ts/function'\n *\n * const double = (n: number): number => n * 2\n * assert.deepStrictEqual(pipe(5, makeBy(double)), [0, 2, 4, 6, 8])\n *\n * @category constructors\n * @since 2.11.0\n */\nvar makeBy = function (f) {\n    return function (n) {\n        var j = Math.max(0, Math.floor(n));\n        var out = [f(0)];\n        for (var i = 1; i < j; i++) {\n            out.push(f(i));\n        }\n        return out;\n    };\n};\nexports.makeBy = makeBy;\n/**\n * Create a `NonEmptyArray` containing a value repeated the specified number of times.\n *\n * **Note**. `n` is normalized to a natural number.\n *\n * @example\n * import { replicate } from 'fp-ts/NonEmptyArray'\n * import { pipe } from 'fp-ts/function'\n *\n * assert.deepStrictEqual(pipe(3, replicate('a')), ['a', 'a', 'a'])\n *\n * @category constructors\n * @since 2.11.0\n */\nvar replicate = function (a) { return (0, exports.makeBy)(function () { return a; }); };\nexports.replicate = replicate;\n/**\n * Create a `NonEmptyArray` containing a range of integers, including both endpoints.\n *\n * @example\n * import { range } from 'fp-ts/NonEmptyArray'\n *\n * assert.deepStrictEqual(range(1, 5), [1, 2, 3, 4, 5])\n *\n * @category constructors\n * @since 2.11.0\n */\nvar range = function (start, end) {\n    return start <= end ? (0, exports.makeBy)(function (i) { return start + i; })(end - start + 1) : [start];\n};\nexports.range = range;\n/**\n * Return the tuple of the `head` and the `tail`.\n *\n * @example\n * import { unprepend } from 'fp-ts/NonEmptyArray'\n *\n * assert.deepStrictEqual(unprepend([1, 2, 3]), [1, [2, 3]])\n *\n * @since 2.9.0\n */\nvar unprepend = function (as) { return [(0, exports.head)(as), (0, exports.tail)(as)]; };\nexports.unprepend = unprepend;\n/**\n * Return the tuple of the `init` and the `last`.\n *\n * @example\n * import { unappend } from 'fp-ts/NonEmptyArray'\n *\n * assert.deepStrictEqual(unappend([1, 2, 3, 4]), [[1, 2, 3], 4])\n *\n * @since 2.9.0\n */\nvar unappend = function (as) { return [(0, exports.init)(as), (0, exports.last)(as)]; };\nexports.unappend = unappend;\nfunction concatW(second) {\n    return function (first) { return first.concat(second); };\n}\nexports.concatW = concatW;\nfunction concat(x, y) {\n    return y ? x.concat(y) : function (y) { return y.concat(x); };\n}\nexports.concat = concat;\n/**\n * @since 2.0.0\n */\nvar reverse = function (as) { return __spreadArray([(0, exports.last)(as)], as.slice(0, -1).reverse(), true); };\nexports.reverse = reverse;\nfunction group(E) {\n    return function (as) {\n        var len = as.length;\n        if (len === 0) {\n            return [];\n        }\n        var out = [];\n        var head = as[0];\n        var nea = [head];\n        for (var i = 1; i < len; i++) {\n            var a = as[i];\n            if (E.equals(a, head)) {\n                nea.push(a);\n            }\n            else {\n                out.push(nea);\n                head = a;\n                nea = [head];\n            }\n        }\n        out.push(nea);\n        return out;\n    };\n}\nexports.group = group;\n/**\n * Splits an array into sub-non-empty-arrays stored in an object, based on the result of calling a `string`-returning\n * function on each element, and grouping the results according to values returned\n *\n * @example\n * import { groupBy } from 'fp-ts/NonEmptyArray'\n *\n * assert.deepStrictEqual(groupBy((s: string) => String(s.length))(['a', 'b', 'ab']), {\n *   '1': ['a', 'b'],\n *   '2': ['ab']\n * })\n *\n * @since 2.0.0\n */\nvar groupBy = function (f) {\n    return function (as) {\n        var out = {};\n        for (var _i = 0, as_1 = as; _i < as_1.length; _i++) {\n            var a = as_1[_i];\n            var k = f(a);\n            if (_.has.call(out, k)) {\n                out[k].push(a);\n            }\n            else {\n                out[k] = [a];\n            }\n        }\n        return out;\n    };\n};\nexports.groupBy = groupBy;\n/**\n * @since 2.0.0\n */\nvar sort = function (O) {\n    return function (as) {\n        return as.slice().sort(O.compare);\n    };\n};\nexports.sort = sort;\n/**\n * @since 2.0.0\n */\nvar insertAt = function (i, a) {\n    return function (as) {\n        return i < 0 || i > as.length ? _.none : _.some((0, exports.unsafeInsertAt)(i, a, as));\n    };\n};\nexports.insertAt = insertAt;\n/**\n * @since 2.0.0\n */\nvar updateAt = function (i, a) {\n    return (0, exports.modifyAt)(i, function () { return a; });\n};\nexports.updateAt = updateAt;\n/**\n * @since 2.0.0\n */\nvar modifyAt = function (i, f) {\n    return function (as) {\n        return (0, exports.isOutOfBound)(i, as) ? _.none : _.some((0, exports.unsafeUpdateAt)(i, f(as[i]), as));\n    };\n};\nexports.modifyAt = modifyAt;\n/**\n * @since 2.0.0\n */\nexports.copy = exports.fromReadonlyNonEmptyArray;\n/**\n * @category constructors\n * @since 2.0.0\n */\nvar of = function (a) { return [a]; };\nexports.of = of;\n/**\n * @since 2.5.1\n */\nvar zipWith = function (as, bs, f) {\n    var cs = [f(as[0], bs[0])];\n    var len = Math.min(as.length, bs.length);\n    for (var i = 1; i < len; i++) {\n        cs[i] = f(as[i], bs[i]);\n    }\n    return cs;\n};\nexports.zipWith = zipWith;\nfunction zip(as, bs) {\n    if (bs === undefined) {\n        return function (bs) { return zip(bs, as); };\n    }\n    return (0, exports.zipWith)(as, bs, function (a, b) { return [a, b]; });\n}\nexports.zip = zip;\n/**\n * @since 2.5.1\n */\nvar unzip = function (abs) {\n    var fa = [abs[0][0]];\n    var fb = [abs[0][1]];\n    for (var i = 1; i < abs.length; i++) {\n        fa[i] = abs[i][0];\n        fb[i] = abs[i][1];\n    }\n    return [fa, fb];\n};\nexports.unzip = unzip;\n/**\n * Prepend an element to every member of an array\n *\n * @example\n * import { prependAll } from 'fp-ts/NonEmptyArray'\n *\n * assert.deepStrictEqual(prependAll(9)([1, 2, 3, 4]), [9, 1, 9, 2, 9, 3, 9, 4])\n *\n * @since 2.10.0\n */\nvar prependAll = function (middle) {\n    return function (as) {\n        var out = [middle, as[0]];\n        for (var i = 1; i < as.length; i++) {\n            out.push(middle, as[i]);\n        }\n        return out;\n    };\n};\nexports.prependAll = prependAll;\n/**\n * Places an element in between members of an array\n *\n * @example\n * import { intersperse } from 'fp-ts/NonEmptyArray'\n *\n * assert.deepStrictEqual(intersperse(9)([1, 2, 3, 4]), [1, 9, 2, 9, 3, 9, 4])\n *\n * @since 2.9.0\n */\nvar intersperse = function (middle) {\n    return function (as) {\n        var rest = (0, exports.tail)(as);\n        return (0, exports.isNonEmpty)(rest) ? (0, function_1.pipe)(rest, (0, exports.prependAll)(middle), (0, exports.prepend)((0, exports.head)(as))) : (0, exports.copy)(as);\n    };\n};\nexports.intersperse = intersperse;\n/**\n * @category folding\n * @since 2.0.0\n */\nexports.foldMapWithIndex = RNEA.foldMapWithIndex;\n/**\n * @category folding\n * @since 2.0.0\n */\nexports.foldMap = RNEA.foldMap;\n/**\n * @category sequencing\n * @since 2.10.0\n */\nvar chainWithIndex = function (f) {\n    return function (as) {\n        var out = (0, exports.fromReadonlyNonEmptyArray)(f(0, (0, exports.head)(as)));\n        for (var i = 1; i < as.length; i++) {\n            out.push.apply(out, f(i, as[i]));\n        }\n        return out;\n    };\n};\nexports.chainWithIndex = chainWithIndex;\n/**\n * @since 2.10.0\n */\nvar chop = function (f) {\n    return function (as) {\n        var _a = f(as), b = _a[0], rest = _a[1];\n        var out = [b];\n        var next = rest;\n        while ((0, exports.isNonEmpty)(next)) {\n            var _b = f(next), b_1 = _b[0], rest_2 = _b[1];\n            out.push(b_1);\n            next = rest_2;\n        }\n        return out;\n    };\n};\nexports.chop = chop;\n/**\n * Splits a `NonEmptyArray` into two pieces, the first piece has max `n` elements.\n *\n * @since 2.10.0\n */\nvar splitAt = function (n) {\n    return function (as) {\n        var m = Math.max(1, n);\n        return m >= as.length ? [(0, exports.copy)(as), []] : [(0, function_1.pipe)(as.slice(1, m), (0, exports.prepend)((0, exports.head)(as))), as.slice(m)];\n    };\n};\nexports.splitAt = splitAt;\n/**\n * @since 2.10.0\n */\nvar chunksOf = function (n) { return (0, exports.chop)((0, exports.splitAt)(n)); };\nexports.chunksOf = chunksOf;\n/* istanbul ignore next */\nvar _map = function (fa, f) { return (0, function_1.pipe)(fa, (0, exports.map)(f)); };\n/* istanbul ignore next */\nvar _mapWithIndex = function (fa, f) { return (0, function_1.pipe)(fa, (0, exports.mapWithIndex)(f)); };\n/* istanbul ignore next */\nvar _ap = function (fab, fa) { return (0, function_1.pipe)(fab, (0, exports.ap)(fa)); };\n/* istanbul ignore next */\nvar _extend = function (wa, f) { return (0, function_1.pipe)(wa, (0, exports.extend)(f)); };\n/* istanbul ignore next */\nvar _reduce = function (fa, b, f) { return (0, function_1.pipe)(fa, (0, exports.reduce)(b, f)); };\n/* istanbul ignore next */\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};\n/* istanbul ignore next */\nvar _reduceRight = function (fa, b, f) { return (0, function_1.pipe)(fa, (0, exports.reduceRight)(b, f)); };\n/* istanbul ignore next */\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)); };\n/* istanbul ignore next */\nvar _reduceWithIndex = function (fa, b, f) {\n    return (0, function_1.pipe)(fa, (0, exports.reduceWithIndex)(b, f));\n};\n/* istanbul ignore next */\nvar _foldMapWithIndex = function (M) {\n    var foldMapWithIndexM = (0, exports.foldMapWithIndex)(M);\n    return function (fa, f) { return (0, function_1.pipe)(fa, foldMapWithIndexM(f)); };\n};\n/* istanbul ignore next */\nvar _reduceRightWithIndex = function (fa, b, f) {\n    return (0, function_1.pipe)(fa, (0, exports.reduceRightWithIndex)(b, f));\n};\n/* istanbul ignore next */\nvar _traverseWithIndex = function (F) {\n    var traverseWithIndexF = (0, exports.traverseWithIndex)(F);\n    return function (ta, f) { return (0, function_1.pipe)(ta, traverseWithIndexF(f)); };\n};\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 * @example\n * import * as NEA from 'fp-ts/NonEmptyArray'\n * import { pipe } from 'fp-ts/function'\n *\n * assert.deepStrictEqual(\n *   pipe(\n *     [1, 2, 3] as NEA.NonEmptyArray<number>,\n *     NEA.altW(() => ['a', 'b'])\n *   ),\n *   [1, 2, 3, 'a', 'b']\n * )\n *\n * @category error handling\n * @since 2.9.0\n */\nvar altW = function (that) {\n    return function (as) {\n        return (0, function_1.pipe)(as, concatW(that()));\n    };\n};\nexports.altW = altW;\n/**\n * Identifies an associative operation on a type constructor. It is similar to `Semigroup`, except that it applies to\n * types of kind `* -> *`.\n *\n * In case of `NonEmptyArray` concatenates the inputs into a single array.\n *\n * @example\n * import * as NEA from 'fp-ts/NonEmptyArray'\n * import { pipe } from 'fp-ts/function'\n *\n * assert.deepStrictEqual(\n *   pipe(\n *     [1, 2, 3],\n *     NEA.alt(() => [4, 5])\n *   ),\n *   [1, 2, 3, 4, 5]\n * )\n *\n * @category error handling\n * @since 2.6.2\n */\nexports.alt = exports.altW;\n/**\n * Apply a function to an argument under a type constructor.\n *\n * @since 2.0.0\n */\nvar ap = function (as) {\n    return (0, exports.flatMap)(function (f) { return (0, function_1.pipe)(as, (0, exports.map)(f)); });\n};\nexports.ap = ap;\n/**\n * @example\n * import * as NEA from 'fp-ts/NonEmptyArray'\n * import { pipe } from 'fp-ts/function'\n *\n * assert.deepStrictEqual(\n *   pipe(\n *     [1, 2, 3],\n *     NEA.flatMap((n) => [`a${n}`, `b${n}`])\n *   ),\n *   ['a1', 'b1', 'a2', 'b2', 'a3', 'b3']\n * )\n *\n * @category sequencing\n * @since 2.14.0\n */\nexports.flatMap = (0, function_1.dual)(2, function (ma, f) {\n    return (0, function_1.pipe)(ma, (0, exports.chainWithIndex)(function (i, a) { return f(a, i); }));\n});\n/**\n * @since 2.0.0\n */\nvar extend = function (f) {\n    return function (as) {\n        var next = (0, exports.tail)(as);\n        var out = [f(as)];\n        while ((0, exports.isNonEmpty)(next)) {\n            out.push(f(next));\n            next = (0, exports.tail)(next);\n        }\n        return out;\n    };\n};\nexports.extend = extend;\n/**\n * @since 2.5.0\n */\nexports.duplicate = (0, exports.extend)(function_1.identity);\n/**\n * @category sequencing\n * @since 2.5.0\n */\nexports.flatten = (0, exports.flatMap)(function_1.identity);\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 */\nvar map = function (f) { return (0, exports.mapWithIndex)(function (_, a) { return f(a); }); };\nexports.map = map;\n/**\n * @category mapping\n * @since 2.0.0\n */\nvar mapWithIndex = function (f) {\n    return function (as) {\n        var out = [f(0, (0, exports.head)(as))];\n        for (var i = 1; i < as.length; i++) {\n            out.push(f(i, as[i]));\n        }\n        return out;\n    };\n};\nexports.mapWithIndex = mapWithIndex;\n/**\n * @category folding\n * @since 2.0.0\n */\nexports.reduce = RNEA.reduce;\n/**\n * @category folding\n * @since 2.0.0\n */\nexports.reduceWithIndex = RNEA.reduceWithIndex;\n/**\n * @category folding\n * @since 2.0.0\n */\nexports.reduceRight = RNEA.reduceRight;\n/**\n * @category folding\n * @since 2.0.0\n */\nexports.reduceRightWithIndex = RNEA.reduceRightWithIndex;\n/**\n * @category traversing\n * @since 2.6.3\n */\nvar traverse = function (F) {\n    var traverseWithIndexF = (0, exports.traverseWithIndex)(F);\n    return function (f) { return traverseWithIndexF(function (_, a) { return f(a); }); };\n};\nexports.traverse = traverse;\n/**\n * @category traversing\n * @since 2.6.3\n */\nvar sequence = function (F) { return (0, exports.traverseWithIndex)(F)(function (_, a) { return a; }); };\nexports.sequence = sequence;\n/**\n * @category sequencing\n * @since 2.6.3\n */\nvar traverseWithIndex = function (F) {\n    return function (f) {\n        return function (as) {\n            var out = F.map(f(0, (0, exports.head)(as)), exports.of);\n            for (var i = 1; i < as.length; i++) {\n                out = F.ap(F.map(out, function (bs) { return function (b) { return (0, function_1.pipe)(bs, (0, exports.append)(b)); }; }), f(i, as[i]));\n            }\n            return out;\n        };\n    };\n};\nexports.traverseWithIndex = traverseWithIndex;\n/**\n * @since 2.7.0\n */\nexports.extract = RNEA.head;\n/**\n * @category type lambdas\n * @since 2.0.0\n */\nexports.URI = 'NonEmptyArray';\n/**\n * @category instances\n * @since 2.0.0\n */\nexports.getShow = RNEA.getShow;\n/**\n * Builds a `Semigroup` instance for `NonEmptyArray`\n *\n * @category instances\n * @since 2.0.0\n */\nvar getSemigroup = function () { return ({\n    concat: concat\n}); };\nexports.getSemigroup = getSemigroup;\n/**\n * @example\n * import { getEq } from 'fp-ts/NonEmptyArray'\n * import * as N from 'fp-ts/number'\n *\n * const E = getEq(N.Eq)\n * assert.strictEqual(E.equals([1, 2], [1, 2]), true)\n * assert.strictEqual(E.equals([1, 2], [1, 3]), false)\n *\n * @category instances\n * @since 2.0.0\n */\nexports.getEq = RNEA.getEq;\n/**\n * @since 2.11.0\n */\nvar getUnionSemigroup = function (E) {\n    var unionE = (0, exports.union)(E);\n    return {\n        concat: function (first, second) { return unionE(second)(first); }\n    };\n};\nexports.getUnionSemigroup = getUnionSemigroup;\n/**\n * @category instances\n * @since 2.7.0\n */\nexports.Functor = {\n    URI: exports.URI,\n    map: _map\n};\n/**\n * @category mapping\n * @since 2.10.0\n */\nexports.flap = (0, Functor_1.flap)(exports.Functor);\n/**\n * @category instances\n * @since 2.10.0\n */\nexports.Pointed = {\n    URI: exports.URI,\n    of: exports.of\n};\n/**\n * @category instances\n * @since 2.7.0\n */\nexports.FunctorWithIndex = {\n    URI: exports.URI,\n    map: _map,\n    mapWithIndex: _mapWithIndex\n};\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 * Combine two effectful actions, keeping only the result of the first.\n *\n * @since 2.5.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.5.0\n */\nexports.apSecond = (0, Apply_1.apSecond)(exports.Apply);\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 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 * 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 sequencing\n * @since 2.5.0\n */\nexports.chainFirst = \n/*#__PURE__*/ (0, Chain_1.chainFirst)(exports.Chain);\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 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 * @category instances\n * @since 2.7.0\n */\nexports.FoldableWithIndex = {\n    URI: exports.URI,\n    reduce: _reduce,\n    foldMap: _foldMap,\n    reduceRight: _reduceRight,\n    reduceWithIndex: _reduceWithIndex,\n    foldMapWithIndex: _foldMapWithIndex,\n    reduceRightWithIndex: _reduceRightWithIndex\n};\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};\n/**\n * @category instances\n * @since 2.7.0\n */\nexports.TraversableWithIndex = {\n    URI: exports.URI,\n    map: _map,\n    mapWithIndex: _mapWithIndex,\n    reduce: _reduce,\n    foldMap: _foldMap,\n    reduceRight: _reduceRight,\n    traverse: _traverse,\n    sequence: exports.sequence,\n    reduceWithIndex: _reduceWithIndex,\n    foldMapWithIndex: _foldMapWithIndex,\n    reduceRightWithIndex: _reduceRightWithIndex,\n    traverseWithIndex: _traverseWithIndex\n};\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 * @category instances\n * @since 2.7.0\n */\nexports.Comonad = {\n    URI: exports.URI,\n    map: _map,\n    extend: _extend,\n    extract: exports.extract\n};\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 = (0, Chain_1.bind)(exports.Chain);\n/**\n * @category do notation\n * @since 2.8.0\n */\nexports.apS = (0, Apply_1.apS)(exports.Apply);\n// -------------------------------------------------------------------------------------\n// utils\n// -------------------------------------------------------------------------------------\n/**\n * @since 2.0.0\n */\nexports.head = RNEA.head;\n/**\n * @since 2.0.0\n */\nvar tail = function (as) { return as.slice(1); };\nexports.tail = tail;\n/**\n * @since 2.0.0\n */\nexports.last = RNEA.last;\n/**\n * Get all but the last element of a non empty array, creating a new array.\n *\n * @example\n * import { init } from 'fp-ts/NonEmptyArray'\n *\n * assert.deepStrictEqual(init([1, 2, 3]), [1, 2])\n * assert.deepStrictEqual(init([1]), [])\n *\n * @since 2.2.0\n */\nvar init = function (as) { return as.slice(0, -1); };\nexports.init = init;\n/**\n * @since 2.0.0\n */\nexports.min = RNEA.min;\n/**\n * @since 2.0.0\n */\nexports.max = RNEA.max;\n/**\n * @since 2.10.0\n */\nvar concatAll = function (S) {\n    return function (as) {\n        return as.reduce(S.concat);\n    };\n};\nexports.concatAll = concatAll;\n/**\n * Break an `Array` into its first element and remaining elements.\n *\n * @category pattern matching\n * @since 2.11.0\n */\nvar matchLeft = function (f) {\n    return function (as) {\n        return f((0, exports.head)(as), (0, exports.tail)(as));\n    };\n};\nexports.matchLeft = matchLeft;\n/**\n * Break an `Array` into its initial elements and the last element.\n *\n * @category pattern matching\n * @since 2.11.0\n */\nvar matchRight = function (f) {\n    return function (as) {\n        return f((0, exports.init)(as), (0, exports.last)(as));\n    };\n};\nexports.matchRight = matchRight;\n/**\n * Apply a function to the head, creating a new `NonEmptyArray`.\n *\n * @since 2.11.0\n */\nvar modifyHead = function (f) {\n    return function (as) {\n        return __spreadArray([f((0, exports.head)(as))], (0, exports.tail)(as), true);\n    };\n};\nexports.modifyHead = modifyHead;\n/**\n * Change the head, creating a new `NonEmptyArray`.\n *\n * @since 2.11.0\n */\nvar updateHead = function (a) { return (0, exports.modifyHead)(function () { return a; }); };\nexports.updateHead = updateHead;\n/**\n * Apply a function to the last element, creating a new `NonEmptyArray`.\n *\n * @since 2.11.0\n */\nvar modifyLast = function (f) {\n    return function (as) {\n        return (0, function_1.pipe)((0, exports.init)(as), (0, exports.append)(f((0, exports.last)(as))));\n    };\n};\nexports.modifyLast = modifyLast;\n/**\n * Change the last element, creating a new `NonEmptyArray`.\n *\n * @since 2.11.0\n */\nvar updateLast = function (a) { return (0, exports.modifyLast)(function () { return a; }); };\nexports.updateLast = updateLast;\n/**\n * Places an element in between members of a `NonEmptyArray`, then folds the results using the provided `Semigroup`.\n *\n * @example\n * import * as S from 'fp-ts/string'\n * import { intercalate } from 'fp-ts/NonEmptyArray'\n *\n * assert.deepStrictEqual(intercalate(S.Semigroup)('-')(['a', 'b', 'c']), 'a-b-c')\n *\n * @since 2.12.0\n */\nexports.intercalate = RNEA.intercalate;\n// -------------------------------------------------------------------------------------\n// legacy\n// -------------------------------------------------------------------------------------\n/**\n * Alias of `flatMap`.\n *\n * @category legacy\n * @since 2.0.0\n */\nexports.chain = exports.flatMap;\nfunction groupSort(O) {\n    var sortO = (0, exports.sort)(O);\n    var groupO = group(O);\n    return function (as) { return ((0, exports.isNonEmpty)(as) ? groupO(sortO(as)) : []); };\n}\nexports.groupSort = groupSort;\nfunction filter(predicate) {\n    return (0, exports.filterWithIndex)(function (_, a) { return predicate(a); });\n}\nexports.filter = filter;\n/**\n * Use [`filterWithIndex`](./Array.ts.html#filterwithindex) instead.\n *\n * @category zone of death\n * @since 2.0.0\n * @deprecated\n */\nvar filterWithIndex = function (predicate) {\n    return function (as) {\n        return (0, exports.fromArray)(as.filter(function (a, i) { return predicate(i, a); }));\n    };\n};\nexports.filterWithIndex = filterWithIndex;\n/**\n * Use [`unprepend`](#unprepend) instead.\n *\n * @category zone of death\n * @since 2.9.0\n * @deprecated\n */\nexports.uncons = exports.unprepend;\n/**\n * Use [`unappend`](#unappend) instead.\n *\n * @category zone of death\n * @since 2.9.0\n * @deprecated\n */\nexports.unsnoc = exports.unappend;\nfunction cons(head, tail) {\n    return tail === undefined ? (0, exports.prepend)(head) : (0, function_1.pipe)(tail, (0, exports.prepend)(head));\n}\nexports.cons = cons;\n/**\n * Use [`append`](./Array.ts.html#append) instead.\n *\n * @category zone of death\n * @since 2.0.0\n * @deprecated\n */\nvar snoc = function (init, end) { return (0, function_1.pipe)(init, (0, exports.append)(end)); };\nexports.snoc = snoc;\n/**\n * Use [`prependAll`](#prependall) instead.\n *\n * @category zone of death\n * @since 2.9.0\n * @deprecated\n */\nexports.prependToAll = exports.prependAll;\n/**\n * Use [`concatAll`](#concatall) instead.\n *\n * @category zone of death\n * @since 2.5.0\n * @deprecated\n */\nexports.fold = RNEA.concatAll;\n/**\n * This instance is deprecated, use small, specific instances instead.\n * For example if a function needs a `Functor` instance, pass `NEA.Functor` instead of `NEA.nonEmptyArray`\n * (where `NEA` is from `import NEA from 'fp-ts/NonEmptyArray'`)\n *\n * @category zone of death\n * @since 2.0.0\n * @deprecated\n */\nexports.nonEmptyArray = {\n    URI: exports.URI,\n    of: exports.of,\n    map: _map,\n    mapWithIndex: _mapWithIndex,\n    ap: _ap,\n    chain: exports.flatMap,\n    extend: _extend,\n    extract: exports.extract,\n    reduce: _reduce,\n    foldMap: _foldMap,\n    reduceRight: _reduceRight,\n    traverse: _traverse,\n    sequence: exports.sequence,\n    reduceWithIndex: _reduceWithIndex,\n    foldMapWithIndex: _foldMapWithIndex,\n    reduceRightWithIndex: _reduceRightWithIndex,\n    traverseWithIndex: _traverseWithIndex,\n    alt: _alt\n};\n"],"names":["this","exports","require$$0","require$$1","require$$2","require$$3","require$$4","require$$5","require$$6","tail","init","a","y","bs","_"],"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,QAAI,gBAAiBA,iBAAAA,kBAAQA,iBAAI,eAAC,iBAAkB,SAAU,IAAI,MAAM,MAAM;AAC1E,UAAI,QAAQ,UAAU,WAAW;AAAG,iBAAS,IAAI,GAAG,IAAI,KAAK,QAAQ,IAAI,IAAI,GAAG,KAAK;AACjF,cAAI,MAAM,EAAE,KAAK,OAAO;AACpB,gBAAI,CAAC;AAAI,mBAAK,MAAM,UAAU,MAAM,KAAK,MAAM,GAAG,CAAC;AACnD,eAAG,CAAC,IAAI,KAAK,CAAC;AAAA,UACjB;AAAA,QACJ;AACD,aAAO,GAAG,OAAO,MAAM,MAAM,UAAU,MAAM,KAAK,IAAI,CAAC;AAAA,IAC3D;AACA,WAAO,eAAcC,UAAU,cAAc,EAAE,OAAO,KAAI,CAAE;AAC5D,IAAAA,SAAuB,eAAAA,SAAA,MAAcA,mBAAkBA,SAAoB,YAAAA,SAAA,SAAiBA,mBAAkBA,SAAa,KAAAA,SAAA,MAAcA,SAAe,OAAAA,SAAA,WAAmBA,SAAkB,UAAAA,SAAA,OAAeA,0BAAyBA,SAAkB,UAAAA,SAAA,mBAA2BA,SAAsB,cAAAA,SAAA,aAAqBA,SAAgB,QAAAA,SAAA,MAAcA,mBAAkBA,SAAa,KAAAA,SAAA,OAAeA,SAAmB,WAAAA,SAAA,WAAmBA,SAAmB,WAAAA,SAAA,OAAeA,mBAAkBA,SAAgB,QAAAA,SAAA,UAAkBA,SAAiB,SAAAA,SAAA,UAAkBA,SAAmB,WAAAA,SAAA,YAAoBA,iBAAgBA,SAAoB,YAAAA,SAAA,SAAiBA,SAAoB,YAAAA,SAAA,4BAAoCA,SAAiB,SAAAA,SAAA,QAAgBA,kBAAiBA,SAAe,OAAAA,SAAA,iBAAyBA,SAAyB,iBAAAA,SAAA,SAAiBA,SAAkB,UAAAA,SAAA,UAAkBA,oBAAmBA,SAAuB,eAAAA,SAAA,aAAqB;AACn6B,IAAAA,SAAgB,QAAAA,SAAA,cAAsBA,sBAAqBA,SAAqB,aAAAA,SAAA,aAAqBA,sBAAqBA,SAAqB,aAAAA,SAAA,YAAoBA,SAAoB,YAAAA,SAAA,MAAcA,SAAc,MAAAA,SAAA,OAAeA,gBAAeA,SAAe,OAAAA,SAAA,OAAeA,SAAc,MAAAA,SAAA,OAAeA,SAAc,MAAAA,SAAA,SAAiBA,cAAaA,SAAkB,UAAAA,SAAA,MAAcA,SAA+B,uBAAAA,SAAA,cAAsBA,SAA4B,oBAAAA,SAAA,WAAmBA,iBAAgBA,SAAqB,aAAAA,SAAA,QAAgBA,SAAsB,cAAAA,SAAA,WAAmBA,SAAkB,UAAAA,SAAA,QAAgBA,4BAA2BA,SAAkB,UAAAA,SAAA,OAAeA,SAAkB,UAAAA,SAAA,oBAA4BA,SAAgB,QAAAA,SAAA,eAAuBA,mBAAkBA,SAAc,MAAAA,SAAA,UAAkBA,SAA4B,oBAAAA,SAAA,WAAmBA,SAAmB,WAAAA,SAAA,uBAA+BA,uBAAsBA,SAA0B,kBAAAA,SAAA,SAAiB;AACj8B,IAAAA,SAAwB,gBAAAA,SAAA,OAAeA,SAAuB,eAAAA,SAAA,OAAeA,SAAe,OAAAA,SAAA,SAAiBA,SAAiB,SAAAA,SAAA,kBAA0BA,SAAiB,SAAAA,SAAA,YAAoB;AAC7L,QAAI,UAAUC,MAAAA;AACd,QAAI,UAAUC,MAAAA;AACd,QAAI,aAAaC,UAAAA;AACjB,QAAI,YAAYC,QAAAA;AAChB,QAAI,IAAI,aAAaC,SAAA,UAAA,CAAqB;AAC1C,QAAI,QAAQC,IAAAA;AACZ,QAAI,OAAO,aAAaC,sBAAA,UAAA,CAAkC;AAO1D,QAAI,aAAa,SAAU,IAAI;AAAE,aAAO,GAAG,SAAS;AAAA;AACpD,IAAAP,SAAA,aAAqB;AAIrB,QAAI,eAAe,SAAU,GAAG,IAAI;AAAE,aAAO,IAAI,KAAK,KAAK,GAAG;AAAA,IAAO;AACrE,IAAAA,SAAA,eAAuB;AAIvB,QAAI,WAAW,SAAU,MAAM;AAC3B,aAAO,SAAUQ,OAAM;AACnB,eAAO,cAAc,CAAC,IAAI,GAAGA,OAAM,IAAI;AAAA,MAC/C;AAAA,IACA;AACA,IAAAR,SAAA,WAAmB;AAInB,IAAAA,SAAkB,UAAAA,SAAQ;AAI1B,QAAI,UAAU,SAAU,KAAK;AACzB,aAAO,SAAUS,OAAM;AACnB,eAAO,cAAc,cAAc,CAAA,GAAIA,OAAM,IAAI,GAAG,CAAC,GAAG,GAAG,KAAK;AAAA,MACxE;AAAA,IACA;AACA,IAAAT,SAAA,UAAkB;AAIlB,IAAAA,SAAiB,SAAAA,SAAQ;AAIzB,QAAI,iBAAiB,SAAU,GAAG,GAAG,IAAI;AACrC,cAAQA,SAAQ,YAAY,EAAE,GAAG;AAC7B,YAAI,MAAS,GAAAA,SAAQ,2BAA2B,EAAE;AAClD,WAAG,OAAO,GAAG,GAAG,CAAC;AACjB,eAAO;AAAA,MACV;AACD,aAAO,CAAC,CAAC;AAAA,IACb;AACA,IAAAA,SAAA,iBAAyB;AAIzB,QAAI,iBAAiB,SAAU,GAAG,GAAG,IAAI;AACrC,UAAI,MAAS,GAAAA,SAAQ,2BAA2B,EAAE;AAClD,SAAG,CAAC,IAAI;AACR,aAAO;AAAA,IACX;AACA,IAAAA,SAAA,iBAAyB;AAYzB,QAAI,OAAO,SAAU,GAAG;AACpB,aAAO,SAAU,IAAI;AACjB,YAAI,GAAG,WAAW,GAAG;AACjB,qBAAWA,SAAQ,MAAM,EAAE;AAAA,QAC9B;AACD,YAAI,MAAM,EAAK,GAAAA,SAAQ,MAAM,EAAE,CAAC;AAChC,YAAI,QAAW,GAAAA,SAAQ,MAAM,EAAE;AAC/B,YAAI,UAAU,SAAUU,IAAG;AACvB,cAAI,IAAI,MAAM,SAAU,GAAG;AAAE,mBAAO,CAAC,EAAE,OAAO,GAAGA,EAAC;AAAA,UAAI,CAAA,GAAG;AACrD,gBAAI,KAAKA,EAAC;AAAA,UACb;AAAA,QACb;AACQ,iBAAS,KAAK,GAAG,SAAS,MAAM,KAAK,OAAO,QAAQ,MAAM;AACtD,cAAI,IAAI,OAAO,EAAE;AACjB,kBAAQ,CAAC;AAAA,QACZ;AACD,eAAO;AAAA,MACf;AAAA,IACA;AACA,IAAAV,SAAA,OAAe;AAuCf,QAAI,SAAS,SAAU,MAAM;AACzB,cAAQA,SAAQ,YAAY,IAAI,GAAG;AAC/B,YAAI,KAAI,GAAI,MAAM;AAClB,gBAAW,GAAAA,SAAQ,MAAM,KAAK,OAAO,EAAE,QAAQ,EAAE,KAAK,CAAC;AAAA,MAC1D;AACD,aAAOA,SAAQ;AAAA,IACnB;AACA,IAAAA,SAAA,SAAiB;AAIjB,QAAI,QAAQ,SAAU,GAAG;AACrB,UAAI,SAAY,GAAAA,SAAQ,MAAM,CAAC;AAC/B,aAAO,SAAU,QAAQ;AAAE,eAAO,SAAU,OAAO;AAAE,iBAAO,OAAU,GAAA,WAAW,MAAM,OAAO,OAAO,MAAM,CAAC,CAAC;AAAA,QAAI;AAAA;IACrH;AACA,IAAAA,SAAA,QAAgB;AAYhB,QAAI,SAAS,SAAU,GAAG;AACtB,aAAO,SAAU,IAAI;AACjB,YAAI,MAAM,GAAG;AACb,YAAI,IAAI,KAAK,MAAM,CAAC,IAAI;AACxB,aAAQ,GAAAA,SAAQ,cAAc,KAAK,IAAI,CAAC,GAAG,EAAE,KAAK,MAAM,GAAG;AACvD,qBAAWA,SAAQ,MAAM,EAAE;AAAA,QAC9B;AACD,YAAI,IAAI,GAAG;AACP,cAAI,MAAK,GAAIA,SAAQ,SAAS,CAAC,CAAC,EAAE,EAAE,GAAG,IAAI,GAAG,CAAC,GAAG,IAAI,GAAG,CAAC;AAC1D,kBAAO,GAAI,WAAW,MAAM,GAAG,OAAO,CAAC,CAAC;AAAA,QAC3C,OACI;AACD,kBAAO,GAAIA,SAAQ,QAAQ,IAAI,GAAG,EAAE,EAAE;AAAA,QACzC;AAAA,MACT;AAAA,IACA;AACA,IAAAA,SAAA,SAAiB;AAQjB,IAAAA,SAAoC,4BAAA,EAAE;AAOtC,QAAI,YAAY,SAAU,IAAI;AAAE,cAAY,GAAAA,SAAQ,YAAY,EAAE,IAAI,EAAE,KAAK,EAAE,IAAI,EAAE;AAAA,IAAM;AAC3F,IAAAA,SAAA,YAAoB;AAgBpB,QAAI,SAAS,SAAU,GAAG;AACtB,aAAO,SAAU,GAAG;AAChB,YAAI,IAAI,KAAK,IAAI,GAAG,KAAK,MAAM,CAAC,CAAC;AACjC,YAAI,MAAM,CAAC,EAAE,CAAC,CAAC;AACf,iBAAS,IAAI,GAAG,IAAI,GAAG,KAAK;AACxB,cAAI,KAAK,EAAE,CAAC,CAAC;AAAA,QAChB;AACD,eAAO;AAAA,MACf;AAAA,IACA;AACA,IAAAA,SAAA,SAAiB;AAejB,QAAI,YAAY,SAAU,GAAG;AAAE,cAAO,GAAIA,SAAQ,QAAQ,WAAY;AAAE,eAAO;AAAA,MAAI,CAAA;AAAA,IAAE;AACrF,IAAAA,SAAA,YAAoB;AAYpB,QAAI,QAAQ,SAAU,OAAO,KAAK;AAC9B,aAAO,SAAS,OAAU,GAAAA,SAAQ,QAAQ,SAAU,GAAG;AAAE,eAAO,QAAQ;AAAA,MAAE,CAAE,EAAE,MAAM,QAAQ,CAAC,IAAI,CAAC,KAAK;AAAA,IAC3G;AACA,IAAAA,SAAA,QAAgB;AAWhB,QAAI,YAAY,SAAU,IAAI;AAAE,aAAO,EAAK,GAAAA,SAAQ,MAAM,EAAE,IAAO,GAAAA,SAAQ,MAAM,EAAE,CAAC;AAAA,IAAE;AACtF,IAAAA,SAAA,YAAoB;AAWpB,QAAI,WAAW,SAAU,IAAI;AAAE,aAAO,EAAK,GAAAA,SAAQ,MAAM,EAAE,IAAO,GAAAA,SAAQ,MAAM,EAAE,CAAC;AAAA,IAAE;AACrF,IAAAA,SAAA,WAAmB;AACnB,aAAS,QAAQ,QAAQ;AACrB,aAAO,SAAU,OAAO;AAAE,eAAO,MAAM,OAAO,MAAM;AAAA;IACvD;AACD,IAAAA,SAAA,UAAkB;AAClB,aAAS,OAAO,GAAG,GAAG;AAClB,aAAO,IAAI,EAAE,OAAO,CAAC,IAAI,SAAUW,IAAG;AAAE,eAAOA,GAAE,OAAO,CAAC;AAAA,MAAE;AAAA,IAC9D;AACD,IAAAX,SAAA,SAAiB;AAIjB,QAAI,UAAU,SAAU,IAAI;AAAE,aAAO,cAAc,EAAK,GAAAA,SAAQ,MAAM,EAAE,CAAC,GAAG,GAAG,MAAM,GAAG,EAAE,EAAE,QAAS,GAAE,IAAI;AAAA;AAC3G,IAAAA,SAAA,UAAkB;AAClB,aAAS,MAAM,GAAG;AACd,aAAO,SAAU,IAAI;AACjB,YAAI,MAAM,GAAG;AACb,YAAI,QAAQ,GAAG;AACX,iBAAO;QACV;AACD,YAAI,MAAM,CAAA;AACV,YAAI,OAAO,GAAG,CAAC;AACf,YAAI,MAAM,CAAC,IAAI;AACf,iBAAS,IAAI,GAAG,IAAI,KAAK,KAAK;AAC1B,cAAI,IAAI,GAAG,CAAC;AACZ,cAAI,EAAE,OAAO,GAAG,IAAI,GAAG;AACnB,gBAAI,KAAK,CAAC;AAAA,UACb,OACI;AACD,gBAAI,KAAK,GAAG;AACZ,mBAAO;AACP,kBAAM,CAAC,IAAI;AAAA,UACd;AAAA,QACJ;AACD,YAAI,KAAK,GAAG;AACZ,eAAO;AAAA,MACf;AAAA,IACC;AACD,IAAAA,SAAA,QAAgB;AAehB,QAAI,UAAU,SAAU,GAAG;AACvB,aAAO,SAAU,IAAI;AACjB,YAAI,MAAM,CAAA;AACV,iBAAS,KAAK,GAAG,OAAO,IAAI,KAAK,KAAK,QAAQ,MAAM;AAChD,cAAI,IAAI,KAAK,EAAE;AACf,cAAI,IAAI,EAAE,CAAC;AACX,cAAI,EAAE,IAAI,KAAK,KAAK,CAAC,GAAG;AACpB,gBAAI,CAAC,EAAE,KAAK,CAAC;AAAA,UAChB,OACI;AACD,gBAAI,CAAC,IAAI,CAAC,CAAC;AAAA,UACd;AAAA,QACJ;AACD,eAAO;AAAA,MACf;AAAA,IACA;AACA,IAAAA,SAAA,UAAkB;AAIlB,QAAI,OAAO,SAAU,GAAG;AACpB,aAAO,SAAU,IAAI;AACjB,eAAO,GAAG,MAAO,EAAC,KAAK,EAAE,OAAO;AAAA,MACxC;AAAA,IACA;AACA,IAAAA,SAAA,OAAe;AAIf,QAAI,WAAW,SAAU,GAAG,GAAG;AAC3B,aAAO,SAAU,IAAI;AACjB,eAAO,IAAI,KAAK,IAAI,GAAG,SAAS,EAAE,OAAO,EAAE,MAAS,GAAAA,SAAQ,gBAAgB,GAAG,GAAG,EAAE,CAAC;AAAA,MAC7F;AAAA,IACA;AACA,IAAAA,SAAA,WAAmB;AAInB,QAAI,WAAW,SAAU,GAAG,GAAG;AAC3B,cAAO,GAAIA,SAAQ,UAAU,GAAG,WAAY;AAAE,eAAO;AAAA,MAAE,CAAE;AAAA,IAC7D;AACA,IAAAA,SAAA,WAAmB;AAInB,QAAI,WAAW,SAAU,GAAG,GAAG;AAC3B,aAAO,SAAU,IAAI;AACjB,gBAAW,GAAAA,SAAQ,cAAc,GAAG,EAAE,IAAI,EAAE,OAAO,EAAE,MAAK,GAAIA,SAAQ,gBAAgB,GAAG,EAAE,GAAG,CAAC,CAAC,GAAG,EAAE,CAAC;AAAA,MAC9G;AAAA,IACA;AACA,IAAAA,SAAA,WAAmB;AAInB,IAAAA,SAAe,OAAAA,SAAQ;AAKvB,QAAI,KAAK,SAAU,GAAG;AAAE,aAAO,CAAC,CAAC;AAAA;AACjC,IAAAA,SAAA,KAAa;AAIb,QAAI,UAAU,SAAU,IAAI,IAAI,GAAG;AAC/B,UAAI,KAAK,CAAC,EAAE,GAAG,CAAC,GAAG,GAAG,CAAC,CAAC,CAAC;AACzB,UAAI,MAAM,KAAK,IAAI,GAAG,QAAQ,GAAG,MAAM;AACvC,eAAS,IAAI,GAAG,IAAI,KAAK,KAAK;AAC1B,WAAG,CAAC,IAAI,EAAE,GAAG,CAAC,GAAG,GAAG,CAAC,CAAC;AAAA,MACzB;AACD,aAAO;AAAA,IACX;AACA,IAAAA,SAAA,UAAkB;AAClB,aAAS,IAAI,IAAI,IAAI;AACjB,UAAI,OAAO,QAAW;AAClB,eAAO,SAAUY,KAAI;AAAE,iBAAO,IAAIA,KAAI,EAAE;AAAA;MAC3C;AACD,cAAW,GAAAZ,SAAQ,SAAS,IAAI,IAAI,SAAU,GAAG,GAAG;AAAE,eAAO,CAAC,GAAG,CAAC;AAAA,MAAI,CAAA;AAAA,IACzE;AACD,IAAAA,SAAA,MAAc;AAId,QAAI,QAAQ,SAAU,KAAK;AACvB,UAAI,KAAK,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;AACnB,UAAI,KAAK,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;AACnB,eAAS,IAAI,GAAG,IAAI,IAAI,QAAQ,KAAK;AACjC,WAAG,CAAC,IAAI,IAAI,CAAC,EAAE,CAAC;AAChB,WAAG,CAAC,IAAI,IAAI,CAAC,EAAE,CAAC;AAAA,MACnB;AACD,aAAO,CAAC,IAAI,EAAE;AAAA,IAClB;AACA,IAAAA,SAAA,QAAgB;AAWhB,QAAI,aAAa,SAAU,QAAQ;AAC/B,aAAO,SAAU,IAAI;AACjB,YAAI,MAAM,CAAC,QAAQ,GAAG,CAAC,CAAC;AACxB,iBAAS,IAAI,GAAG,IAAI,GAAG,QAAQ,KAAK;AAChC,cAAI,KAAK,QAAQ,GAAG,CAAC,CAAC;AAAA,QACzB;AACD,eAAO;AAAA,MACf;AAAA,IACA;AACA,IAAAA,SAAA,aAAqB;AAWrB,QAAI,cAAc,SAAU,QAAQ;AAChC,aAAO,SAAU,IAAI;AACjB,YAAI,QAAW,GAAAA,SAAQ,MAAM,EAAE;AAC/B,mBAAWA,SAAQ,YAAY,IAAI,KAAI,GAAI,WAAW,MAAM,UAAUA,SAAQ,YAAY,MAAM,IAAO,GAAAA,SAAQ,aAAaA,SAAQ,MAAM,EAAE,CAAC,CAAC,KAAQ,GAAAA,SAAQ,MAAM,EAAE;AAAA,MAC9K;AAAA,IACA;AACA,IAAAA,SAAA,cAAsB;AAKtB,IAAAA,SAA2B,mBAAA,KAAK;AAKhC,IAAAA,SAAkB,UAAA,KAAK;AAKvB,QAAI,iBAAiB,SAAU,GAAG;AAC9B,aAAO,SAAU,IAAI;AACjB,YAAI,OAAM,GAAIA,SAAQ,2BAA2B,EAAE,IAAG,GAAIA,SAAQ,MAAM,EAAE,CAAC,CAAC;AAC5E,iBAAS,IAAI,GAAG,IAAI,GAAG,QAAQ,KAAK;AAChC,cAAI,KAAK,MAAM,KAAK,EAAE,GAAG,GAAG,CAAC,CAAC,CAAC;AAAA,QAClC;AACD,eAAO;AAAA,MACf;AAAA,IACA;AACA,IAAAA,SAAA,iBAAyB;AAIzB,QAAI,OAAO,SAAU,GAAG;AACpB,aAAO,SAAU,IAAI;AACjB,YAAI,KAAK,EAAE,EAAE,GAAG,IAAI,GAAG,CAAC,GAAG,OAAO,GAAG,CAAC;AACtC,YAAI,MAAM,CAAC,CAAC;AACZ,YAAI,OAAO;AACX,mBAAWA,SAAQ,YAAY,IAAI,GAAG;AAClC,cAAI,KAAK,EAAE,IAAI,GAAG,MAAM,GAAG,CAAC,GAAG,SAAS,GAAG,CAAC;AAC5C,cAAI,KAAK,GAAG;AACZ,iBAAO;AAAA,QACV;AACD,eAAO;AAAA,MACf;AAAA,IACA;AACA,IAAAA,SAAA,OAAe;AAMf,QAAI,UAAU,SAAU,GAAG;AACvB,aAAO,SAAU,IAAI;AACjB,YAAI,IAAI,KAAK,IAAI,GAAG,CAAC;AACrB,eAAO,KAAK,GAAG,SAAS,EAAC,GAAIA,SAAQ,MAAM,EAAE,GAAG,CAAE,CAAA,IAAI,EAAK,GAAA,WAAW,MAAM,GAAG,MAAM,GAAG,CAAC,IAAG,GAAIA,SAAQ,UAAa,GAAAA,SAAQ,MAAM,EAAE,CAAC,CAAC,GAAG,GAAG,MAAM,CAAC,CAAC;AAAA,MAC7J;AAAA,IACA;AACA,IAAAA,SAAA,UAAkB;AAIlB,QAAI,WAAW,SAAU,GAAG;AAAE,cAAO,GAAIA,SAAQ,OAAM,GAAIA,SAAQ,SAAS,CAAC,CAAC;AAAA,IAAE;AAChF,IAAAA,SAAA,WAAmB;AAEnB,QAAI,OAAO,SAAU,IAAI,GAAG;AAAE,cAAO,GAAI,WAAW,MAAM,KAAQ,GAAAA,SAAQ,KAAK,CAAC,CAAC;AAAA,IAAE;AAEnF,QAAI,gBAAgB,SAAU,IAAI,GAAG;AAAE,cAAO,GAAI,WAAW,MAAM,KAAQ,GAAAA,SAAQ,cAAc,CAAC,CAAC;AAAA,IAAE;AAErG,QAAI,MAAM,SAAU,KAAK,IAAI;AAAE,cAAO,GAAI,WAAW,MAAM,MAAS,GAAAA,SAAQ,IAAI,EAAE,CAAC;AAAA,IAAE;AAErF,QAAI,UAAU,SAAU,IAAI,GAAG;AAAE,cAAO,GAAI,WAAW,MAAM,KAAQ,GAAAA,SAAQ,QAAQ,CAAC,CAAC;AAAA,IAAE;AAEzF,QAAI,UAAU,SAAU,IAAI,GAAG,GAAG;AAAE,iBAAW,WAAW,MAAM,KAAQ,GAAAA,SAAQ,QAAQ,GAAG,CAAC,CAAC;AAAA;AAE7F,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;AAEA,QAAI,eAAe,SAAU,IAAI,GAAG,GAAG;AAAE,iBAAW,WAAW,MAAM,KAAQ,GAAAA,SAAQ,aAAa,GAAG,CAAC,CAAC;AAAA;AAEvG,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;AAEzF,QAAI,mBAAmB,SAAU,IAAI,GAAG,GAAG;AACvC,cAAW,GAAA,WAAW,MAAM,KAAI,GAAIA,SAAQ,iBAAiB,GAAG,CAAC,CAAC;AAAA,IACtE;AAEA,QAAI,oBAAoB,SAAU,GAAG;AACjC,UAAI,qBAAwB,GAAAA,SAAQ,kBAAkB,CAAC;AACvD,aAAO,SAAU,IAAI,GAAG;AAAE,gBAAO,GAAI,WAAW,MAAM,IAAI,kBAAkB,CAAC,CAAC;AAAA,MAAE;AAAA,IACpF;AAEA,QAAI,wBAAwB,SAAU,IAAI,GAAG,GAAG;AAC5C,cAAW,GAAA,WAAW,MAAM,KAAI,GAAIA,SAAQ,sBAAsB,GAAG,CAAC,CAAC;AAAA,IAC3E;AAEA,QAAI,qBAAqB,SAAU,GAAG;AAClC,UAAI,sBAAyB,GAAAA,SAAQ,mBAAmB,CAAC;AACzD,aAAO,SAAU,IAAI,GAAG;AAAE,gBAAO,GAAI,WAAW,MAAM,IAAI,mBAAmB,CAAC,CAAC;AAAA,MAAE;AAAA,IACrF;AAqBA,QAAI,OAAO,SAAU,MAAM;AACvB,aAAO,SAAU,IAAI;AACjB,gBAAO,GAAI,WAAW,MAAM,IAAI,QAAQ,KAAM,CAAA,CAAC;AAAA,MACvD;AAAA,IACA;AACA,IAAAA,SAAA,OAAe;AAsBf,IAAAA,SAAc,MAAAA,SAAQ;AAMtB,QAAI,KAAK,SAAU,IAAI;AACnB,cAAO,GAAIA,SAAQ,SAAS,SAAU,GAAG;AAAE,gBAAO,GAAI,WAAW,MAAM,KAAQ,GAAAA,SAAQ,KAAK,CAAC,CAAC;AAAA,MAAE,CAAE;AAAA,IACtG;AACA,IAAAA,SAAA,KAAa;AAiBb,IAAAA,SAAA,cAAsB,WAAW,MAAM,GAAG,SAAU,IAAI,GAAG;AACvD,cAAO,GAAI,WAAW,MAAM,KAAQ,GAAAA,SAAQ,gBAAgB,SAAU,GAAG,GAAG;AAAE,eAAO,EAAE,GAAG,CAAC;AAAA,MAAI,CAAA,CAAC;AAAA,IACpG,CAAC;AAID,QAAI,SAAS,SAAU,GAAG;AACtB,aAAO,SAAU,IAAI;AACjB,YAAI,QAAW,GAAAA,SAAQ,MAAM,EAAE;AAC/B,YAAI,MAAM,CAAC,EAAE,EAAE,CAAC;AAChB,mBAAWA,SAAQ,YAAY,IAAI,GAAG;AAClC,cAAI,KAAK,EAAE,IAAI,CAAC;AAChB,kBAAW,GAAAA,SAAQ,MAAM,IAAI;AAAA,QAChC;AACD,eAAO;AAAA,MACf;AAAA,IACA;AACA,IAAAA,SAAA,SAAiB;AAIjB,IAAAA,SAAoB,aAAI,GAAAA,SAAQ,QAAQ,WAAW,QAAQ;AAK3D,IAAAA,SAAkB,WAAI,GAAAA,SAAQ,SAAS,WAAW,QAAQ;AAQ1D,QAAI,MAAM,SAAU,GAAG;AAAE,cAAW,GAAAA,SAAQ,cAAc,SAAUa,IAAG,GAAG;AAAE,eAAO,EAAE,CAAC;AAAA,MAAE,CAAE;AAAA;AAC1F,IAAAb,SAAA,MAAc;AAKd,QAAI,eAAe,SAAU,GAAG;AAC5B,aAAO,SAAU,IAAI;AACjB,YAAI,MAAM,CAAC,EAAE,IAAO,GAAAA,SAAQ,MAAM,EAAE,CAAC,CAAC;AACtC,iBAAS,IAAI,GAAG,IAAI,GAAG,QAAQ,KAAK;AAChC,cAAI,KAAK,EAAE,GAAG,GAAG,CAAC,CAAC,CAAC;AAAA,QACvB;AACD,eAAO;AAAA,MACf;AAAA,IACA;AACA,IAAAA,SAAA,eAAuB;AAKvB,IAAAA,SAAiB,SAAA,KAAK;AAKtB,IAAAA,SAA0B,kBAAA,KAAK;AAK/B,IAAAA,SAAsB,cAAA,KAAK;AAK3B,IAAAA,SAA+B,uBAAA,KAAK;AAKpC,QAAI,WAAW,SAAU,GAAG;AACxB,UAAI,sBAAyB,GAAAA,SAAQ,mBAAmB,CAAC;AACzD,aAAO,SAAU,GAAG;AAAE,eAAO,mBAAmB,SAAUa,IAAG,GAAG;AAAE,iBAAO,EAAE,CAAC;AAAA,QAAI,CAAA;AAAA,MAAE;AAAA,IACtF;AACA,IAAAb,SAAA,WAAmB;AAKnB,QAAI,WAAW,SAAU,GAAG;AAAE,cAAW,GAAAA,SAAQ,mBAAmB,CAAC,EAAE,SAAUa,IAAG,GAAG;AAAE,eAAO;AAAA,MAAE,CAAE;AAAA;AACpG,IAAAb,SAAA,WAAmB;AAKnB,QAAI,oBAAoB,SAAU,GAAG;AACjC,aAAO,SAAU,GAAG;AAChB,eAAO,SAAU,IAAI;AACjB,cAAI,MAAM,EAAE,IAAI,EAAE,IAAG,GAAIA,SAAQ,MAAM,EAAE,CAAC,GAAGA,SAAQ,EAAE;AACvD,mBAAS,IAAI,GAAG,IAAI,GAAG,QAAQ,KAAK;AAChC,kBAAM,EAAE,GAAG,EAAE,IAAI,KAAK,SAAU,IAAI;AAAE,qBAAO,SAAU,GAAG;AAAE,wBAAW,GAAA,WAAW,MAAM,KAAQ,GAAAA,SAAQ,QAAQ,CAAC,CAAC;AAAA,cAAI;AAAA,aAAG,GAAG,EAAE,GAAG,GAAG,CAAC,CAAC,CAAC;AAAA,UAC1I;AACD,iBAAO;AAAA,QACnB;AAAA,MACA;AAAA,IACA;AACA,IAAAA,SAAA,oBAA4B;AAI5B,IAAAA,SAAkB,UAAA,KAAK;AAKvB,IAAAA,SAAA,MAAc;AAKd,IAAAA,SAAkB,UAAA,KAAK;AAOvB,QAAI,eAAe,WAAY;AAAE,aAAQ;AAAA,QACrC;AAAA,MACH;AAAA;AACD,IAAAA,SAAA,eAAuB;AAavB,IAAAA,SAAgB,QAAA,KAAK;AAIrB,QAAI,oBAAoB,SAAU,GAAG;AACjC,UAAI,UAAa,GAAAA,SAAQ,OAAO,CAAC;AACjC,aAAO;AAAA,QACH,QAAQ,SAAU,OAAO,QAAQ;AAAE,iBAAO,OAAO,MAAM,EAAE,KAAK;AAAA,QAAI;AAAA,MAC1E;AAAA,IACA;AACA,IAAAA,SAAA,oBAA4B;AAK5B,IAAAA,SAAkB,UAAA;AAAA,MACd,KAAKA,SAAQ;AAAA,MACb,KAAK;AAAA,IACT;AAKA,IAAAA,SAAe,QAAI,GAAA,UAAU,MAAMA,SAAQ,OAAO;AAKlD,IAAAA,SAAkB,UAAA;AAAA,MACd,KAAKA,SAAQ;AAAA,MACb,IAAIA,SAAQ;AAAA,IAChB;AAKA,IAAAA,SAA2B,mBAAA;AAAA,MACvB,KAAKA,SAAQ;AAAA,MACb,KAAK;AAAA,MACL,cAAc;AAAA,IAClB;AAKA,IAAAA,SAAgB,QAAA;AAAA,MACZ,KAAKA,SAAQ;AAAA,MACb,KAAK;AAAA,MACL,IAAI;AAAA,IACR;AAMA,IAAAA,SAAkB,WAAI,GAAA,QAAQ,SAASA,SAAQ,KAAK;AAMpD,IAAAA,SAAmB,YAAI,GAAA,QAAQ,UAAUA,SAAQ,KAAK;AAKtD,IAAAA,SAAsB,cAAA;AAAA,MAClB,KAAKA,SAAQ;AAAA,MACb,KAAK;AAAA,MACL,IAAI;AAAA,MACJ,IAAIA,SAAQ;AAAA,IAChB;AAKA,IAAAA,SAAgB,QAAA;AAAA,MACZ,KAAKA,SAAQ;AAAA,MACb,KAAK;AAAA,MACL,IAAI;AAAA,MACJ,OAAOA,SAAQ;AAAA,IACnB;AAQA,IAAAA,SAAA,aACc,oBAAI,QAAQ,YAAYA,SAAQ,KAAK;AAKnD,IAAAA,SAAgB,QAAA;AAAA,MACZ,KAAKA,SAAQ;AAAA,MACb,KAAK;AAAA,MACL,IAAI;AAAA,MACJ,IAAIA,SAAQ;AAAA,MACZ,OAAOA,SAAQ;AAAA,IACnB;AAKA,IAAAA,SAAmB,WAAA;AAAA,MACf,KAAKA,SAAQ;AAAA,MACb,QAAQ;AAAA,MACR,SAAS;AAAA,MACT,aAAa;AAAA,IACjB;AAKA,IAAAA,SAA4B,oBAAA;AAAA,MACxB,KAAKA,SAAQ;AAAA,MACb,QAAQ;AAAA,MACR,SAAS;AAAA,MACT,aAAa;AAAA,MACb,iBAAiB;AAAA,MACjB,kBAAkB;AAAA,MAClB,sBAAsB;AAAA,IAC1B;AAKA,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;AAKA,IAAAA,SAA+B,uBAAA;AAAA,MAC3B,KAAKA,SAAQ;AAAA,MACb,KAAK;AAAA,MACL,cAAc;AAAA,MACd,QAAQ;AAAA,MACR,SAAS;AAAA,MACT,aAAa;AAAA,MACb,UAAU;AAAA,MACV,UAAUA,SAAQ;AAAA,MAClB,iBAAiB;AAAA,MACjB,kBAAkB;AAAA,MAClB,sBAAsB;AAAA,MACtB,mBAAmB;AAAA,IACvB;AAKA,IAAAA,SAAc,MAAA;AAAA,MACV,KAAKA,SAAQ;AAAA,MACb,KAAK;AAAA,MACL,KAAK;AAAA,IACT;AAKA,IAAAA,SAAkB,UAAA;AAAA,MACd,KAAKA,SAAQ;AAAA,MACb,KAAK;AAAA,MACL,QAAQ;AAAA,MACR,SAASA,SAAQ;AAAA,IACrB;AAQA,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,QAAI,GAAA,QAAQ,MAAMA,SAAQ,KAAK;AAK9C,IAAAA,SAAc,OAAI,GAAA,QAAQ,KAAKA,SAAQ,KAAK;AAO5C,IAAAA,SAAe,OAAA,KAAK;AAIpB,QAAI,OAAO,SAAU,IAAI;AAAE,aAAO,GAAG,MAAM,CAAC;AAAA;AAC5C,IAAAA,SAAA,OAAe;AAIf,IAAAA,SAAe,OAAA,KAAK;AAYpB,QAAI,OAAO,SAAU,IAAI;AAAE,aAAO,GAAG,MAAM,GAAG,EAAE;AAAA;AAChD,IAAAA,SAAA,OAAe;AAIf,IAAAA,SAAc,MAAA,KAAK;AAInB,IAAAA,SAAc,MAAA,KAAK;AAInB,QAAI,YAAY,SAAU,GAAG;AACzB,aAAO,SAAU,IAAI;AACjB,eAAO,GAAG,OAAO,EAAE,MAAM;AAAA,MACjC;AAAA,IACA;AACA,IAAAA,SAAA,YAAoB;AAOpB,QAAI,YAAY,SAAU,GAAG;AACzB,aAAO,SAAU,IAAI;AACjB,eAAO,MAAMA,SAAQ,MAAM,EAAE,IAAG,GAAIA,SAAQ,MAAM,EAAE,CAAC;AAAA,MAC7D;AAAA,IACA;AACA,IAAAA,SAAA,YAAoB;AAOpB,QAAI,aAAa,SAAU,GAAG;AAC1B,aAAO,SAAU,IAAI;AACjB,eAAO,MAAMA,SAAQ,MAAM,EAAE,IAAG,GAAIA,SAAQ,MAAM,EAAE,CAAC;AAAA,MAC7D;AAAA,IACA;AACA,IAAAA,SAAA,aAAqB;AAMrB,QAAI,aAAa,SAAU,GAAG;AAC1B,aAAO,SAAU,IAAI;AACjB,eAAO,cAAc,CAAC,GAAE,GAAIA,SAAQ,MAAM,EAAE,CAAC,CAAC,IAAO,GAAAA,SAAQ,MAAM,EAAE,GAAG,IAAI;AAAA,MACpF;AAAA,IACA;AACA,IAAAA,SAAA,aAAqB;AAMrB,QAAI,aAAa,SAAU,GAAG;AAAE,cAAO,GAAIA,SAAQ,YAAY,WAAY;AAAE,eAAO;AAAA,MAAI,CAAA;AAAA,IAAE;AAC1F,IAAAA,SAAA,aAAqB;AAMrB,QAAI,aAAa,SAAU,GAAG;AAC1B,aAAO,SAAU,IAAI;AACjB,gBAAO,GAAI,WAAW,OAAU,GAAAA,SAAQ,MAAM,EAAE,IAAG,GAAIA,SAAQ,QAAQ,MAAMA,SAAQ,MAAM,EAAE,CAAC,CAAC,CAAC;AAAA,MACxG;AAAA,IACA;AACA,IAAAA,SAAA,aAAqB;AAMrB,QAAI,aAAa,SAAU,GAAG;AAAE,cAAO,GAAIA,SAAQ,YAAY,WAAY;AAAE,eAAO;AAAA,MAAI,CAAA;AAAA,IAAE;AAC1F,IAAAA,SAAA,aAAqB;AAYrB,IAAAA,SAAsB,cAAA,KAAK;AAU3B,IAAAA,SAAgB,QAAAA,SAAQ;AACxB,aAAS,UAAU,GAAG;AAClB,UAAI,SAAY,GAAAA,SAAQ,MAAM,CAAC;AAC/B,UAAI,SAAS,MAAM,CAAC;AACpB,aAAO,SAAU,IAAI;AAAE,gBAAY,GAAAA,SAAQ,YAAY,EAAE,IAAI,OAAO,MAAM,EAAE,CAAC,IAAI,CAAA;AAAA,MAAI;AAAA,IACxF;AACD,IAAAA,SAAA,YAAoB;AACpB,aAAS,OAAO,WAAW;AACvB,iBAAWA,SAAQ,iBAAiB,SAAUa,IAAG,GAAG;AAAE,eAAO,UAAU,CAAC;AAAA,MAAE,CAAE;AAAA,IAC/E;AACD,IAAAb,SAAA,SAAiB;AAQjB,QAAI,kBAAkB,SAAU,WAAW;AACvC,aAAO,SAAU,IAAI;AACjB,gBAAW,GAAAA,SAAQ,WAAW,GAAG,OAAO,SAAU,GAAG,GAAG;AAAE,iBAAO,UAAU,GAAG,CAAC;AAAA,QAAE,CAAE,CAAC;AAAA,MAC5F;AAAA,IACA;AACA,IAAAA,SAAA,kBAA0B;AAQ1B,IAAAA,SAAiB,SAAAA,SAAQ;AAQzB,IAAAA,SAAiB,SAAAA,SAAQ;AACzB,aAAS,KAAK,MAAMQ,OAAM;AACtB,aAAOA,UAAS,UAAY,GAAIR,SAAQ,SAAS,IAAI,KAAI,GAAI,WAAW,MAAMQ,QAAU,GAAAR,SAAQ,SAAS,IAAI,CAAC;AAAA,IACjH;AACD,IAAAA,SAAA,OAAe;AAQf,QAAI,OAAO,SAAUS,OAAM,KAAK;AAAE,cAAO,GAAI,WAAW,MAAMA,QAAU,GAAAT,SAAQ,QAAQ,GAAG,CAAC;AAAA,IAAE;AAC9F,IAAAA,SAAA,OAAe;AAQf,IAAAA,SAAuB,eAAAA,SAAQ;AAQ/B,IAAAA,SAAe,OAAA,KAAK;AAUpB,IAAAA,SAAwB,gBAAA;AAAA,MACpB,KAAKA,SAAQ;AAAA,MACb,IAAIA,SAAQ;AAAA,MACZ,KAAK;AAAA,MACL,cAAc;AAAA,MACd,IAAI;AAAA,MACJ,OAAOA,SAAQ;AAAA,MACf,QAAQ;AAAA,MACR,SAASA,SAAQ;AAAA,MACjB,QAAQ;AAAA,MACR,SAAS;AAAA,MACT,aAAa;AAAA,MACb,UAAU;AAAA,MACV,UAAUA,SAAQ;AAAA,MAClB,iBAAiB;AAAA,MACjB,kBAAkB;AAAA,MAClB,sBAAsB;AAAA,MACtB,mBAAmB;AAAA,MACnB,KAAK;AAAA;;;;;","x_google_ignoreList":[0]}