npm - @slicemachine/manager - Versions diffs - 0.22.2-alpha.dani-repeatable-links-codegen.2 → 0.22.2-alpha.dani-repeatable-links-warning.1 - Mend

@slicemachine/manager 0.22.2-alpha.dani-repeatable-links-codegen.2 → 0.22.2-alpha.dani-repeatable-links-warning.1

This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.

Files changed (1995) hide show

package/dist/_node_modules/fp-ts/es6/Either.js.map CHANGED Viewed

	@@ -1 +1 @@
1	- {"version":3,"file":"Either.js","sources":["../../../../../../node_modules/fp-ts/es6/Either.js"],"sourcesContent":["import { getApplicativeMonoid } from './Applicative';\nimport { apFirst as apFirst_, apS as apS_, apSecond as apSecond_, getApplySemigroup as getApplySemigroup_ } from './Apply';\nimport * as chainable from './Chain';\nimport { tailRec } from './ChainRec';\nimport { chainOptionK as chainOptionK_, filterOrElse as filterOrElse_, fromOption as fromOption_, fromOptionK as fromOptionK_, fromPredicate as fromPredicate_ } from './FromEither';\nimport { dual, flow, identity, pipe } from './function';\nimport { as as as_, asUnit as asUnit_, bindTo as bindTo_, flap as flap_, let as let__ } from './Functor';\nimport * as _ from './internal';\nimport { separated } from './Separated';\nimport { wiltDefault, witherDefault } from './Witherable';\n// -------------------------------------------------------------------------------------\n// constructors\n// -------------------------------------------------------------------------------------\n/*\n Constructs a new `Either` holding a `Left` value. This usually represents a failure, due to the right-bias of this\n * structure.\n \n @category constructors\n * @since 2.0.0\n /\nexport var left = _.left;\n/\n Constructs a new `Either` holding a `Right` value. This usually represents a successful value due to the right bias\n * of this structure.\n \n @category constructors\n * @since 2.0.0\n /\nexport var right = _.right;\n/\n @category sequencing\n * @since 2.14.0\n /\nexport var flatMap = /#__PURE__/ dual(2, function (ma, f) { return (isLeft(ma) ? ma : f(ma.right)); });\nvar _map = function (fa, f) { return pipe(fa, map(f)); };\nvar _ap = function (fab, fa) { return pipe(fab, ap(fa)); };\n/ istanbul ignore next /\nvar _reduce = function (fa, b, f) { return pipe(fa, reduce(b, f)); };\n/ istanbul ignore next /\nvar _foldMap = function (M) { return function (fa, f) {\n var foldMapM = foldMap(M);\n return pipe(fa, foldMapM(f));\n}; };\n/ istanbul ignore next /\nvar _reduceRight = function (fa, b, f) { return pipe(fa, reduceRight(b, f)); };\nvar _traverse = function (F) {\n var traverseF = traverse(F);\n return function (ta, f) { return pipe(ta, traverseF(f)); };\n};\nvar _bimap = function (fa, f, g) { return pipe(fa, bimap(f, g)); };\nvar _mapLeft = function (fa, f) { return pipe(fa, mapLeft(f)); };\n/ istanbul ignore next /\nvar _alt = function (fa, that) { return pipe(fa, alt(that)); };\n/ istanbul ignore next /\nvar _extend = function (wa, f) { return pipe(wa, extend(f)); };\nvar _chainRec = function (a, f) {\n return tailRec(f(a), function (e) {\n return isLeft(e) ? right(left(e.left)) : isLeft(e.right) ? left(f(e.right.left)) : right(right(e.right.right));\n });\n};\n/\n @category type lambdas\n * @since 2.0.0\n /\nexport var URI = 'Either';\n/\n @category instances\n * @since 2.0.0\n /\nexport var getShow = function (SE, SA) { return ({\n show: function (ma) { return (isLeft(ma) ? \"left(\".concat(SE.show(ma.left), \")\") : \"right(\".concat(SA.show(ma.right), \")\")); }\n}); };\n/\n @category instances\n * @since 2.0.0\n /\nexport var getEq = function (EL, EA) { return ({\n equals: function (x, y) {\n return x === y \|\| (isLeft(x) ? isLeft(y) && EL.equals(x.left, y.left) : isRight(y) && EA.equals(x.right, y.right));\n }\n}); };\n/\n Semigroup returning the left-most non-`Left` value. If both operands are `Right`s then the inner values are\n * concatenated using the provided `Semigroup`\n \n @example\n * import { getSemigroup, left, right } from 'fp-ts/Either'\n * import { SemigroupSum } from 'fp-ts/number'\n \n const S = getSemigroup<string, number>(SemigroupSum)\n * assert.deepStrictEqual(S.concat(left('a'), left('b')), left('a'))\n * assert.deepStrictEqual(S.concat(left('a'), right(2)), right(2))\n * assert.deepStrictEqual(S.concat(right(1), left('b')), right(1))\n * assert.deepStrictEqual(S.concat(right(1), right(2)), right(3))\n \n @category instances\n * @since 2.0.0\n /\nexport var getSemigroup = function (S) { return ({\n concat: function (x, y) { return (isLeft(y) ? x : isLeft(x) ? y : right(S.concat(x.right, y.right))); }\n}); };\n/\n Builds a `Compactable` instance for `Either` given `Monoid` for the left side.\n \n @category filtering\n * @since 2.10.0\n /\nexport var getCompactable = function (M) {\n var empty = left(M.empty);\n return {\n URI: URI,\n _E: undefined,\n compact: function (ma) { return (isLeft(ma) ? ma : ma.right._tag === 'None' ? empty : right(ma.right.value)); },\n separate: function (ma) {\n return isLeft(ma)\n ? separated(ma, ma)\n : isLeft(ma.right)\n ? separated(right(ma.right.left), empty)\n : separated(empty, right(ma.right.right));\n }\n };\n};\n/\n Builds a `Filterable` instance for `Either` given `Monoid` for the left side\n \n @category filtering\n * @since 2.10.0\n /\nexport var getFilterable = function (M) {\n var empty = left(M.empty);\n var _a = getCompactable(M), compact = _a.compact, separate = _a.separate;\n var filter = function (ma, predicate) {\n return isLeft(ma) ? ma : predicate(ma.right) ? ma : empty;\n };\n var partition = function (ma, p) {\n return isLeft(ma)\n ? separated(ma, ma)\n : p(ma.right)\n ? separated(empty, right(ma.right))\n : separated(right(ma.right), empty);\n };\n return {\n URI: URI,\n _E: undefined,\n map: _map,\n compact: compact,\n separate: separate,\n filter: filter,\n filterMap: function (ma, f) {\n if (isLeft(ma)) {\n return ma;\n }\n var ob = f(ma.right);\n return ob._tag === 'None' ? empty : right(ob.value);\n },\n partition: partition,\n partitionMap: function (ma, f) {\n if (isLeft(ma)) {\n return separated(ma, ma);\n }\n var e = f(ma.right);\n return isLeft(e) ? separated(right(e.left), empty) : separated(empty, right(e.right));\n }\n };\n};\n/\n Builds `Witherable` instance for `Either` given `Monoid` for the left side\n \n @category filtering\n * @since 2.0.0\n /\nexport var getWitherable = function (M) {\n var F_ = getFilterable(M);\n var C = getCompactable(M);\n return {\n URI: URI,\n _E: undefined,\n map: _map,\n compact: F_.compact,\n separate: F_.separate,\n filter: F_.filter,\n filterMap: F_.filterMap,\n partition: F_.partition,\n partitionMap: F_.partitionMap,\n traverse: _traverse,\n sequence: sequence,\n reduce: _reduce,\n foldMap: _foldMap,\n reduceRight: _reduceRight,\n wither: witherDefault(Traversable, C),\n wilt: wiltDefault(Traversable, C)\n };\n};\n/\n The default [`Applicative`](#applicative) instance returns the first error, if you want to\n * get all errors you need to provide a way to concatenate them via a `Semigroup`.\n \n @example\n * import * as A from 'fp-ts/Apply'\n * import * as E from 'fp-ts/Either'\n * import { pipe } from 'fp-ts/function'\n * import * as S from 'fp-ts/Semigroup'\n * import * as string from 'fp-ts/string'\n \n const parseString = (u: unknown): E.Either<string, string> =>\n * typeof u === 'string' ? E.right(u) : E.left('not a string')\n \n const parseNumber = (u: unknown): E.Either<string, number> =>\n * typeof u === 'number' ? E.right(u) : E.left('not a number')\n \n interface Person {\n * readonly name: string\n * readonly age: number\n * }\n \n const parsePerson = (\n * input: Record<string, unknown>\n * ): E.Either<string, Person> =>\n * pipe(\n * E.Do,\n * E.apS('name', parseString(input.name)),\n * E.apS('age', parseNumber(input.age))\n * )\n \n assert.deepStrictEqual(parsePerson({}), E.left('not a string')) // <= first error\n \n const Applicative = E.getApplicativeValidation(\n * pipe(string.Semigroup, S.intercalate(', '))\n * )\n \n const apS = A.apS(Applicative)\n \n const parsePersonAll = (\n * input: Record<string, unknown>\n * ): E.Either<string, Person> =>\n * pipe(\n * E.Do,\n * apS('name', parseString(input.name)),\n * apS('age', parseNumber(input.age))\n * )\n \n assert.deepStrictEqual(parsePersonAll({}), E.left('not a string, not a number')) // <= all errors\n \n @category error handling\n * @since 2.7.0\n /\nexport var getApplicativeValidation = function (SE) { return ({\n URI: URI,\n _E: undefined,\n map: _map,\n ap: function (fab, fa) {\n return isLeft(fab)\n ? isLeft(fa)\n ? left(SE.concat(fab.left, fa.left))\n : fab\n : isLeft(fa)\n ? fa\n : right(fab.right(fa.right));\n },\n of: of\n}); };\n/\n The default [`Alt`](#alt) instance returns the last error, if you want to\n * get all errors you need to provide a way to concatenate them via a `Semigroup`.\n \n @example\n * import * as E from 'fp-ts/Either'\n * import { pipe } from 'fp-ts/function'\n * import * as S from 'fp-ts/Semigroup'\n * import * as string from 'fp-ts/string'\n \n const parseString = (u: unknown): E.Either<string, string> =>\n * typeof u === 'string' ? E.right(u) : E.left('not a string')\n \n const parseNumber = (u: unknown): E.Either<string, number> =>\n * typeof u === 'number' ? E.right(u) : E.left('not a number')\n \n const parse = (u: unknown): E.Either<string, string \| number> =>\n * pipe(\n * parseString(u),\n * E.alt<string, string \| number>(() => parseNumber(u))\n * )\n \n assert.deepStrictEqual(parse(true), E.left('not a number')) // <= last error\n \n const Alt = E.getAltValidation(pipe(string.Semigroup, S.intercalate(', ')))\n \n const parseAll = (u: unknown): E.Either<string, string \| number> =>\n * Alt.alt<string \| number>(parseString(u), () => parseNumber(u))\n \n assert.deepStrictEqual(parseAll(true), E.left('not a string, not a number')) // <= all errors\n \n @category error handling\n * @since 2.7.0\n /\nexport var getAltValidation = function (SE) { return ({\n URI: URI,\n _E: undefined,\n map: _map,\n alt: function (me, that) {\n if (isRight(me)) {\n return me;\n }\n var ea = that();\n return isLeft(ea) ? left(SE.concat(me.left, ea.left)) : ea;\n }\n}); };\n/\n @category mapping\n * @since 2.0.0\n /\nexport var map = function (f) { return function (fa) {\n return isLeft(fa) ? fa : right(f(fa.right));\n}; };\n/\n @category instances\n * @since 2.7.0\n /\nexport var Functor = {\n URI: URI,\n map: _map\n};\n/\n Maps the `Right` value of this `Either` to the specified constant value.\n \n @category mapping\n * @since 2.16.0\n /\nexport var as = dual(2, as_(Functor));\n/\n Maps the `Right` value of this `Either` to the void constant value.\n \n @category mapping\n * @since 2.16.0\n /\nexport var asUnit = asUnit_(Functor);\n/\n @category constructors\n * @since 2.7.0\n /\nexport var of = right;\n/\n @category instances\n * @since 2.10.0\n /\nexport var Pointed = {\n URI: URI,\n of: of\n};\n/\n Less strict version of [`ap`](#ap).\n \n The `W` suffix (short for Widening) means that the error types will be merged.\n \n @since 2.8.0\n /\nexport var apW = function (fa) { return function (fab) {\n return isLeft(fab) ? fab : isLeft(fa) ? fa : right(fab.right(fa.right));\n}; };\n/\n @since 2.0.0\n /\nexport var ap = apW;\n/\n @category instances\n * @since 2.10.0\n /\nexport var Apply = {\n URI: URI,\n map: _map,\n ap: _ap\n};\n/\n @category instances\n * @since 2.7.0\n /\nexport var Applicative = {\n URI: URI,\n map: _map,\n ap: _ap,\n of: of\n};\n/\n @category instances\n * @since 2.10.0\n /\nexport var Chain = {\n URI: URI,\n map: _map,\n ap: _ap,\n chain: flatMap\n};\n/\n @category instances\n * @since 2.7.0\n /\nexport var Monad = {\n URI: URI,\n map: _map,\n ap: _ap,\n of: of,\n chain: flatMap\n};\n/\n Left-associative fold of a structure.\n \n @example\n * import { pipe } from 'fp-ts/function'\n * import * as E from 'fp-ts/Either'\n \n const startWith = 'prefix'\n * const concat = (a: string, b: string) => `${a}:${b}`\n \n assert.deepStrictEqual(\n * pipe(E.right('a'), E.reduce(startWith, concat)),\n * 'prefix:a'\n * )\n \n assert.deepStrictEqual(\n * pipe(E.left('e'), E.reduce(startWith, concat)),\n * 'prefix'\n * )\n \n @category folding\n * @since 2.0.0\n /\nexport var reduce = function (b, f) { return function (fa) {\n return isLeft(fa) ? b : f(b, fa.right);\n}; };\n/\n Map each element of the structure to a monoid, and combine the results.\n \n @example\n * import { pipe } from 'fp-ts/function'\n * import * as E from 'fp-ts/Either'\n * import * as S from 'fp-ts/string'\n \n const yell = (a: string) => `${a}!`\n \n assert.deepStrictEqual(\n * pipe(E.right('a'), E.foldMap(S.Monoid)(yell)),\n * 'a!'\n * )\n \n assert.deepStrictEqual(\n * pipe(E.left('e'), E.foldMap(S.Monoid)(yell)),\n * S.Monoid.empty\n * )\n \n @category folding\n * @since 2.0.0\n /\nexport var foldMap = function (M) { return function (f) { return function (fa) {\n return isLeft(fa) ? M.empty : f(fa.right);\n}; }; };\n/\n Right-associative fold of a structure.\n \n @example\n * import { pipe } from 'fp-ts/function'\n * import * as E from 'fp-ts/Either'\n \n const startWith = 'postfix'\n * const concat = (a: string, b: string) => `${a}:${b}`\n \n assert.deepStrictEqual(\n * pipe(E.right('a'), E.reduceRight(startWith, concat)),\n * 'a:postfix'\n * )\n \n assert.deepStrictEqual(\n * pipe(E.left('e'), E.reduceRight(startWith, concat)),\n * 'postfix'\n * )\n \n @category folding\n * @since 2.0.0\n /\nexport var reduceRight = function (b, f) { return function (fa) {\n return isLeft(fa) ? b : f(fa.right, b);\n}; };\n/\n @category instances\n * @since 2.7.0\n /\nexport var Foldable = {\n URI: URI,\n reduce: _reduce,\n foldMap: _foldMap,\n reduceRight: _reduceRight\n};\n/\n Map each element of a structure to an action, evaluate these actions from left to right, and collect the results.\n \n @example\n * import { pipe } from 'fp-ts/function'\n * import * as RA from 'fp-ts/ReadonlyArray'\n * import * as E from 'fp-ts/Either'\n * import * as O from 'fp-ts/Option'\n \n assert.deepStrictEqual(\n * pipe(E.right(['a']), E.traverse(O.Applicative)(RA.head)),\n * O.some(E.right('a'))\n * )\n \n assert.deepStrictEqual(\n * pipe(E.right([]), E.traverse(O.Applicative)(RA.head)),\n * O.none\n * )\n \n @category traversing\n * @since 2.6.3\n /\nexport var traverse = function (F) {\n return function (f) {\n return function (ta) {\n return isLeft(ta) ? F.of(left(ta.left)) : F.map(f(ta.right), right);\n };\n };\n};\n/\n Evaluate each monadic action in the structure from left to right, and collect the results.\n \n @example\n * import { pipe } from 'fp-ts/function'\n * import * as E from 'fp-ts/Either'\n * import * as O from 'fp-ts/Option'\n \n assert.deepStrictEqual(\n * pipe(E.right(O.some('a')), E.sequence(O.Applicative)),\n * O.some(E.right('a'))\n * )\n \n assert.deepStrictEqual(\n * pipe(E.right(O.none), E.sequence(O.Applicative)),\n * O.none\n * )\n \n @category traversing\n * @since 2.6.3\n /\nexport var sequence = function (F) {\n return function (ma) {\n return isLeft(ma) ? F.of(left(ma.left)) : F.map(ma.right, right);\n };\n};\n/\n @category instances\n * @since 2.7.0\n /\nexport var Traversable = {\n URI: URI,\n map: _map,\n reduce: _reduce,\n foldMap: _foldMap,\n reduceRight: _reduceRight,\n traverse: _traverse,\n sequence: sequence\n};\n/\n Map a pair of functions over the two type arguments of the bifunctor.\n \n @category mapping\n * @since 2.0.0\n /\nexport var bimap = function (f, g) { return function (fa) {\n return isLeft(fa) ? left(f(fa.left)) : right(g(fa.right));\n}; };\n/\n Map a function over the first type argument of a bifunctor.\n \n @category error handling\n * @since 2.0.0\n /\nexport var mapLeft = function (f) { return function (fa) {\n return isLeft(fa) ? left(f(fa.left)) : fa;\n}; };\n/\n @category instances\n * @since 2.7.0\n /\nexport var Bifunctor = {\n URI: URI,\n bimap: _bimap,\n mapLeft: _mapLeft\n};\n/\n Less strict version of [`alt`](#alt).\n \n The `W` suffix (short for Widening) means that the error and the return types will be merged.\n \n @category error handling\n * @since 2.9.0\n /\nexport var altW = function (that) { return function (fa) {\n return isLeft(fa) ? that() : fa;\n}; };\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 `Either` returns the left-most non-`Left` value (or the right-most `Left` value if both values are `Left`).\n \n \| x \| y \| pipe(x, alt(() => y) \|\n * \| -------- \| -------- \| -------------------- \|\n * \| left(a) \| left(b) \| left(b) \|\n * \| left(a) \| right(2) \| right(2) \|\n * \| right(1) \| left(b) \| right(1) \|\n * \| right(1) \| right(2) \| right(1) \|\n \n @example\n * import * as E from 'fp-ts/Either'\n * import { pipe } from 'fp-ts/function'\n \n assert.deepStrictEqual(\n * pipe(\n * E.left('a'),\n * E.alt(() => E.left('b'))\n * ),\n * E.left('b')\n * )\n * assert.deepStrictEqual(\n * pipe(\n * E.left('a'),\n * E.alt(() => E.right(2))\n * ),\n * E.right(2)\n * )\n * assert.deepStrictEqual(\n * pipe(\n * E.right(1),\n * E.alt(() => E.left('b'))\n * ),\n * E.right(1)\n * )\n * assert.deepStrictEqual(\n * pipe(\n * E.right(1),\n * E.alt(() => E.right(2))\n * ),\n * E.right(1)\n * )\n \n @category error handling\n * @since 2.0.0\n /\nexport var alt = altW;\n/\n @category instances\n * @since 2.7.0\n /\nexport var Alt = {\n URI: URI,\n map: _map,\n alt: _alt\n};\n/\n @since 2.0.0\n /\nexport var extend = function (f) { return function (wa) {\n return isLeft(wa) ? wa : right(f(wa));\n}; };\n/\n @category instances\n * @since 2.7.0\n /\nexport var Extend = {\n URI: URI,\n map: _map,\n extend: _extend\n};\n/\n @category instances\n * @since 2.7.0\n /\nexport var ChainRec = {\n URI: URI,\n map: _map,\n ap: _ap,\n chain: flatMap,\n chainRec: _chainRec\n};\n/\n @since 2.6.3\n /\nexport var throwError = left;\n/\n @category instances\n * @since 2.7.0\n /\nexport var MonadThrow = {\n URI: URI,\n map: _map,\n ap: _ap,\n of: of,\n chain: flatMap,\n throwError: throwError\n};\n/\n @category instances\n * @since 2.10.0\n /\nexport var FromEither = {\n URI: URI,\n fromEither: identity\n};\n/\n @example\n * import { fromPredicate, left, right } from 'fp-ts/Either'\n * import { pipe } from 'fp-ts/function'\n \n assert.deepStrictEqual(\n * pipe(\n * 1,\n * fromPredicate(\n * (n) => n > 0,\n * () => 'error'\n * )\n * ),\n * right(1)\n * )\n * assert.deepStrictEqual(\n * pipe(\n * -1,\n * fromPredicate(\n * (n) => n > 0,\n * () => 'error'\n * )\n * ),\n * left('error')\n * )\n \n @category lifting\n * @since 2.0.0\n /\nexport var fromPredicate = /#__PURE__/ fromPredicate_(FromEither);\n// -------------------------------------------------------------------------------------\n// conversions\n// -------------------------------------------------------------------------------------\n/\n @example\n * import * as E from 'fp-ts/Either'\n * import { pipe } from 'fp-ts/function'\n * import * as O from 'fp-ts/Option'\n \n assert.deepStrictEqual(\n * pipe(\n * O.some(1),\n * E.fromOption(() => 'error')\n * ),\n * E.right(1)\n * )\n * assert.deepStrictEqual(\n * pipe(\n * O.none,\n * E.fromOption(() => 'error')\n * ),\n * E.left('error')\n * )\n \n @category conversions\n * @since 2.0.0\n /\nexport var fromOption = \n/#__PURE__/ fromOption_(FromEither);\n// -------------------------------------------------------------------------------------\n// refinements\n// -------------------------------------------------------------------------------------\n/\n Returns `true` if the either is an instance of `Left`, `false` otherwise.\n \n @category refinements\n * @since 2.0.0\n /\nexport var isLeft = _.isLeft;\n/\n Returns `true` if the either is an instance of `Right`, `false` otherwise.\n \n @category refinements\n * @since 2.0.0\n /\nexport var isRight = _.isRight;\n/\n Less strict version of [`match`](#match).\n \n The `W` suffix (short for Widening) means that the handler return types will be merged.\n \n @category pattern matching\n * @since 2.10.0\n /\nexport var matchW = function (onLeft, onRight) {\n return function (ma) {\n return isLeft(ma) ? onLeft(ma.left) : onRight(ma.right);\n };\n};\n/\n Alias of [`matchW`](#matchw).\n \n @category pattern matching\n * @since 2.10.0\n /\nexport var foldW = matchW;\n/\n Takes two functions and an `Either` value, if the value is a `Left` the inner value is applied to the first function,\n * if the value is a `Right` the inner value is applied to the second function.\n \n @example\n * import { match, left, right } from 'fp-ts/Either'\n * import { pipe } from 'fp-ts/function'\n \n function onLeft(errors: Array<string>): string {\n * return `Errors: ${errors.join(', ')}`\n * }\n \n function onRight(value: number): string {\n * return `Ok: ${value}`\n * }\n \n assert.strictEqual(\n * pipe(\n * right(1),\n * match(onLeft, onRight)\n * ),\n * 'Ok: 1'\n * )\n * assert.strictEqual(\n * pipe(\n * left(['error 1', 'error 2']),\n * match(onLeft, onRight)\n * ),\n * 'Errors: error 1, error 2'\n * )\n \n @category pattern matching\n * @since 2.10.0\n /\nexport var match = matchW;\n/\n Alias of [`match`](#match).\n \n @category pattern matching\n * @since 2.0.0\n /\nexport var fold = match;\n/\n Less strict version of [`getOrElse`](#getorelse).\n \n The `W` suffix (short for Widening) means that the handler return type will be merged.\n \n @category error handling\n * @since 2.6.0\n /\nexport var getOrElseW = function (onLeft) {\n return function (ma) {\n return isLeft(ma) ? onLeft(ma.left) : ma.right;\n };\n};\n/\n Returns the wrapped value if it's a `Right` or a default value if is a `Left`.\n \n @example\n * import { getOrElse, left, right } from 'fp-ts/Either'\n * import { pipe } from 'fp-ts/function'\n \n assert.deepStrictEqual(\n * pipe(\n * right(1),\n * getOrElse(() => 0)\n * ),\n * 1\n * )\n * assert.deepStrictEqual(\n * pipe(\n * left('error'),\n * getOrElse(() => 0)\n * ),\n * 0\n * )\n \n @category error handling\n * @since 2.0.0\n /\nexport var getOrElse = getOrElseW;\n// -------------------------------------------------------------------------------------\n// combinators\n// -------------------------------------------------------------------------------------\n/\n @category mapping\n * @since 2.10.0\n /\nexport var flap = /#__PURE__/ flap_(Functor);\n/\n Combine two effectful actions, keeping only the result of the first.\n \n @since 2.0.0\n /\nexport var apFirst = /#__PURE__/ apFirst_(Apply);\n/\n Less strict version of [`apFirst`](#apfirst)\n \n The `W` suffix (short for Widening) means that the error types will be merged.\n \n @since 2.12.0\n /\nexport var apFirstW = apFirst;\n/\n Combine two effectful actions, keeping only the result of the second.\n \n @since 2.0.0\n /\nexport var apSecond = /#__PURE__/ apSecond_(Apply);\n/\n Less strict version of [`apSecond`](#apsecond)\n \n The `W` suffix (short for Widening) means that the error types will be merged.\n \n @since 2.12.0\n /\nexport var apSecondW = apSecond;\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 /\nexport var tap = /#__PURE__/ dual(2, chainable.tap(Chain));\n/\n Less strict version of [`flatten`](#flatten).\n \n The `W` suffix (short for Widening) means that the error types will be merged.\n \n @category sequencing\n * @since 2.11.0\n /\nexport var flattenW = \n/#__PURE__/ flatMap(identity);\n/\n The `flatten` function is the conventional monad join operator. It is used to remove one level of monadic structure, projecting its bound argument into the outer level.\n \n @example\n * import * as E from 'fp-ts/Either'\n \n assert.deepStrictEqual(E.flatten(E.right(E.right('a'))), E.right('a'))\n * assert.deepStrictEqual(E.flatten(E.right(E.left('e'))), E.left('e'))\n * assert.deepStrictEqual(E.flatten(E.left('e')), E.left('e'))\n \n @category sequencing\n * @since 2.0.0\n /\nexport var flatten = flattenW;\n/\n @since 2.0.0\n /\nexport var duplicate = /#__PURE__/ extend(identity);\n/\n Use `liftOption`.\n \n @category legacy\n * @since 2.10.0\n /\nexport var fromOptionK = \n/#__PURE__/ fromOptionK_(FromEither);\n/\n Use `flatMapOption`.\n \n @category legacy\n * @since 2.11.0\n /\nexport var chainOptionK = /#__PURE__/ chainOptionK_(FromEither, Chain);\n/\n Use `flatMapOption`.\n \n @category legacy\n * @since 2.13.2\n /\nexport var chainOptionKW = /#__PURE__/ chainOptionK;\n/* @internal /\nvar _FromEither = {\n fromEither: FromEither.fromEither\n};\n/\n @category lifting\n * @since 2.15.0\n /\nexport var liftNullable = /#__PURE__/ _.liftNullable(_FromEither);\n/\n @category lifting\n * @since 2.15.0\n /\nexport var liftOption = /#__PURE__/ _.liftOption(_FromEither);\n/* @internal /\nvar _FlatMap = {\n flatMap: flatMap\n};\n/\n @category sequencing\n * @since 2.15.0\n /\nexport var flatMapNullable = /#__PURE__/ _.flatMapNullable(_FromEither, _FlatMap);\n/\n @category sequencing\n * @since 2.15.0\n /\nexport var flatMapOption = /#__PURE__/ _.flatMapOption(_FromEither, _FlatMap);\n/\n @example\n * import * as E from 'fp-ts/Either'\n * import { pipe } from 'fp-ts/function'\n \n assert.deepStrictEqual(\n * pipe(\n * E.right(1),\n * E.filterOrElse(\n * (n) => n > 0,\n * () => 'error'\n * )\n * ),\n * E.right(1)\n * )\n * assert.deepStrictEqual(\n * pipe(\n * E.right(-1),\n * E.filterOrElse(\n * (n) => n > 0,\n * () => 'error'\n * )\n * ),\n * E.left('error')\n * )\n * assert.deepStrictEqual(\n * pipe(\n * E.left('a'),\n * E.filterOrElse(\n * (n) => n > 0,\n * () => 'error'\n * )\n * ),\n * E.left('a')\n * )\n \n @category filtering\n * @since 2.0.0\n /\nexport var filterOrElse = /#__PURE__/ filterOrElse_(FromEither, Chain);\n/\n Less strict version of [`filterOrElse`](#filterorelse).\n \n The `W` suffix (short for Widening) means that the error types will be merged.\n \n @category filtering\n * @since 2.9.0\n /\nexport var filterOrElseW = filterOrElse;\n/\n Returns a `Right` if is a `Left` (and vice versa).\n \n @since 2.0.0\n /\nexport var swap = function (ma) { return (isLeft(ma) ? right(ma.left) : left(ma.right)); };\n/\n Less strict version of [`orElse`](#orelse).\n \n The `W` suffix (short for Widening) means that the return types will be merged.\n \n @category error handling\n * @since 2.10.0\n /\nexport var orElseW = function (onLeft) {\n return function (ma) {\n return isLeft(ma) ? onLeft(ma.left) : ma;\n };\n};\n/\n Useful for recovering from errors.\n \n @category error handling\n * @since 2.0.0\n /\nexport var orElse = orElseW;\n/\n Takes a default and a nullable value, if the value is not nully, turn it into a `Right`, if the value is nully use\n * the provided default as a `Left`.\n \n @example\n * import { fromNullable, left, right } from 'fp-ts/Either'\n \n const parse = fromNullable('nully')\n \n assert.deepStrictEqual(parse(1), right(1))\n * assert.deepStrictEqual(parse(null), left('nully'))\n \n @category conversions\n * @since 2.0.0\n /\nexport var fromNullable = function (e) {\n return function (a) {\n return a == null ? left(e) : right(a);\n };\n};\n/\n Constructs a new `Either` from a function that might throw.\n \n See also [`tryCatchK`](#trycatchk).\n \n @example\n * import * as E from 'fp-ts/Either'\n \n const unsafeHead = <A>(as: ReadonlyArray<A>): A => {\n * if (as.length > 0) {\n * return as[0]\n * } else {\n * throw new Error('empty array')\n * }\n * }\n \n const head = <A>(as: ReadonlyArray<A>): E.Either<Error, A> =>\n * E.tryCatch(() => unsafeHead(as), e => (e instanceof Error ? e : new Error('unknown error')))\n \n assert.deepStrictEqual(head([]), E.left(new Error('empty array')))\n * assert.deepStrictEqual(head([1, 2, 3]), E.right(1))\n \n @category interop\n * @since 2.0.0\n /\nexport var tryCatch = function (f, onThrow) {\n try {\n return right(f());\n }\n catch (e) {\n return left(onThrow(e));\n }\n};\n/\n Converts a function that may throw to one returning a `Either`.\n \n @category interop\n * @since 2.10.0\n /\nexport var tryCatchK = function (f, onThrow) {\n return function () {\n var a = [];\n for (var _i = 0; _i < arguments.length; _i++) {\n a[_i] = arguments[_i];\n }\n return tryCatch(function () { return f.apply(void 0, a); }, onThrow);\n };\n};\n/\n Use `liftNullable`.\n \n @category legacy\n * @since 2.9.0\n /\nexport var fromNullableK = function (e) {\n var from = fromNullable(e);\n return function (f) { return flow(f, from); };\n};\n/\n Use `flatMapNullable`.\n \n @category legacy\n * @since 2.9.0\n /\nexport var chainNullableK = function (e) {\n var from = fromNullableK(e);\n return function (f) { return flatMap(from(f)); };\n};\n/\n @category conversions\n * @since 2.10.0\n /\nexport var toUnion = /#__PURE__/ foldW(identity, identity);\n// -------------------------------------------------------------------------------------\n// utils\n// -------------------------------------------------------------------------------------\n/\n Default value for the `onError` argument of `tryCatch`\n \n @since 2.0.0\n /\nexport function toError(e) {\n return e instanceof Error ? e : new Error(String(e));\n}\nexport function 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 isLeft(ma) ? false : E.equals(a, ma.right);\n };\n}\n/\n Returns `false` if `Left` or returns the result of the application of the given predicate to the `Right` value.\n \n @example\n * import { exists, left, right } from 'fp-ts/Either'\n \n const gt2 = exists((n: number) => n > 2)\n \n assert.strictEqual(gt2(left('a')), false)\n * assert.strictEqual(gt2(right(1)), false)\n * assert.strictEqual(gt2(right(3)), true)\n \n @since 2.0.0\n /\nexport var exists = function (predicate) {\n return function (ma) {\n return isLeft(ma) ? false : predicate(ma.right);\n };\n};\n// -------------------------------------------------------------------------------------\n// do notation\n// -------------------------------------------------------------------------------------\n/\n @category do notation\n * @since 2.9.0\n /\nexport var Do = /#__PURE__/ of(_.emptyRecord);\n/\n @category do notation\n * @since 2.8.0\n /\nexport var bindTo = /#__PURE__/ bindTo_(Functor);\nvar let_ = /#__PURE__/ let__(Functor);\nexport { \n/\n @category do notation\n * @since 2.13.0\n /\nlet_ as let };\n/\n @category do notation\n * @since 2.8.0\n /\nexport var bind = /#__PURE__/ chainable.bind(Chain);\n/\n The `W` suffix (short for Widening) means that the error types will be merged.\n \n @category do notation\n * @since 2.8.0\n /\nexport var bindW = bind;\n/\n @category do notation\n * @since 2.8.0\n /\nexport var apS = /#__PURE__/ apS_(Apply);\n/\n Less strict version of [`apS`](#aps).\n \n The `W` suffix (short for Widening) means that the error types will be merged.\n \n @category do notation\n * @since 2.8.0\n /\nexport var apSW = apS;\n/\n @since 2.11.0\n /\nexport var ApT = /#__PURE__/ of(_.emptyReadonlyArray);\n// -------------------------------------------------------------------------------------\n// array utils\n// -------------------------------------------------------------------------------------\n/\n Equivalent to `ReadonlyNonEmptyArray#traverseWithIndex(Applicative)`.\n \n @category traversing\n * @since 2.11.0\n /\nexport var traverseReadonlyNonEmptyArrayWithIndex = function (f) {\n return function (as) {\n var e = f(0, _.head(as));\n if (isLeft(e)) {\n return e;\n }\n var out = [e.right];\n for (var i = 1; i < as.length; i++) {\n var e_1 = f(i, as[i]);\n if (isLeft(e_1)) {\n return e_1;\n }\n out.push(e_1.right);\n }\n return right(out);\n };\n};\n/\n Equivalent to `ReadonlyArray#traverseWithIndex(Applicative)`.\n \n @category traversing\n * @since 2.11.0\n /\nexport var traverseReadonlyArrayWithIndex = function (f) {\n var g = traverseReadonlyNonEmptyArrayWithIndex(f);\n return function (as) { return (_.isNonEmpty(as) ? g(as) : ApT); };\n};\n/\n Equivalent to `ReadonlyArray#traverseWithIndex(Applicative)`.\n \n @category traversing\n * @since 2.9.0\n /\nexport var traverseArrayWithIndex = traverseReadonlyArrayWithIndex;\n/\n Equivalent to `ReadonlyArray#traverse(Applicative)`.\n \n @category traversing\n * @since 2.9.0\n /\nexport var traverseArray = function (f) { return traverseReadonlyArrayWithIndex(function (_, a) { return f(a); }); };\n/\n Equivalent to `ReadonlyArray#sequence(Applicative)`.\n \n @category traversing\n * @since 2.9.0\n /\nexport var sequenceArray = \n/#__PURE__/ traverseArray(identity);\n// -------------------------------------------------------------------------------------\n// legacy\n// -------------------------------------------------------------------------------------\n/\n Alias of `flatMap`.\n \n @category legacy\n * @since 2.6.0\n /\nexport var chainW = flatMap;\n/\n Alias of `flatMap`.\n \n @category legacy\n * @since 2.0.0\n /\nexport var chain = flatMap;\n/\n Alias of `tap`.\n \n @category legacy\n * @since 2.0.0\n /\nexport var chainFirst = tap;\n/\n Alias of `tap`.\n \n @category legacy\n * @since 2.8.0\n /\nexport var chainFirstW = tap;\n/\n Use [`parse`](./Json.ts.html#parse) instead.\n \n @category zone of death\n * @since 2.0.0\n * @deprecated\n /\nexport function parseJSON(s, onError) {\n return tryCatch(function () { return JSON.parse(s); }, onError);\n}\n/\n Use [`stringify`](./Json.ts.html#stringify) instead.\n \n @category zone of death\n * @since 2.0.0\n * @deprecated\n /\nexport var stringifyJSON = function (u, onError) {\n return tryCatch(function () {\n var s = JSON.stringify(u);\n if (typeof s !== 'string') {\n throw new Error('Converting unsupported structure to JSON');\n }\n return s;\n }, onError);\n};\n/\n This instance is deprecated, use small, specific instances instead.\n * For example if a function needs a `Functor` instance, pass `E.Functor` instead of `E.either`\n * (where `E` is from `import E from 'fp-ts/Either'`)\n \n @category zone of death\n * @since 2.0.0\n * @deprecated\n /\nexport var either = {\n URI: URI,\n map: _map,\n of: of,\n ap: _ap,\n chain: flatMap,\n reduce: _reduce,\n foldMap: _foldMap,\n reduceRight: _reduceRight,\n traverse: _traverse,\n sequence: sequence,\n bimap: _bimap,\n mapLeft: _mapLeft,\n alt: _alt,\n extend: _extend,\n chainRec: _chainRec,\n throwError: throwError\n};\n/\n Use [`getApplySemigroup`](./Apply.ts.html#getapplysemigroup) instead.\n \n Semigroup returning the left-most `Left` value. If both operands are `Right`s then the inner values\n * are concatenated using the provided `Semigroup`\n \n @category zone of death\n * @since 2.0.0\n * @deprecated\n /\nexport var getApplySemigroup = \n/#__PURE__/ getApplySemigroup_(Apply);\n/\n Use [`getApplicativeMonoid`](./Applicative.ts.html#getapplicativemonoid) instead.\n \n @category zone of death\n * @since 2.0.0\n * @deprecated\n /\nexport var getApplyMonoid = \n/#__PURE__/ getApplicativeMonoid(Applicative);\n/\n Use [`getApplySemigroup`](./Apply.ts.html#getapplysemigroup) instead.\n \n @category zone of death\n * @since 2.0.0\n * @deprecated\n /\nexport var getValidationSemigroup = function (SE, SA) {\n return getApplySemigroup_(getApplicativeValidation(SE))(SA);\n};\n/\n Use [`getApplicativeMonoid`](./Applicative.ts.html#getapplicativemonoid) instead.\n \n @category zone of death\n * @since 2.0.0\n * @deprecated\n /\nexport var getValidationMonoid = function (SE, MA) {\n return getApplicativeMonoid(getApplicativeValidation(SE))(MA);\n};\n/\n Use [`getApplicativeValidation`](#getapplicativevalidation) and [`getAltValidation`](#getaltvalidation) instead.\n \n @category zone of death\n * @since 2.0.0\n * @deprecated\n */\nexport function getValidation(SE) {\n var ap = getApplicativeValidation(SE).ap;\n var alt = getAltValidation(SE).alt;\n return {\n URI: URI,\n _E: undefined,\n map: _map,\n of: of,\n chain: flatMap,\n bimap: _bimap,\n mapLeft: _mapLeft,\n reduce: _reduce,\n foldMap: _foldMap,\n reduceRight: _reduceRight,\n extend: _extend,\n traverse: _traverse,\n sequence: sequence,\n chainRec: _chainRec,\n throwError: throwError,\n ap: ap,\n alt: alt\n };\n}\n"],"names":["_.left","_.right","as_","asUnit_","fromPredicate_","fromOption_","_.isLeft","_.isRight","flap_","apFirst_","apSecond_","chainable.tap","fromOptionK_","chainOptionK_","_.liftNullable","_.liftOption","_.flatMapNullable","_.flatMapOption","filterOrElse_","ma","_.emptyRecord","bindTo_","let__","chainable.bind","apS_","_.emptyReadonlyArray","as","_.head","_.isNonEmpty","getApplySemigroup_","ap","alt"],"mappings":";;;;;;;;;;AAoBU,IAAC,OAAOA;AAQR,IAAC,QAAQC;AAKT,IAAC,UAAwB,qBAAK,GAAG,SAAU,IAAI,GAAG;AAAE,SAAQ,OAAO,EAAE,IAAI,KAAK,EAAE,GAAG,KAAK;AAAG,CAAE;AACvG,IAAI,OAAO,SAAU,IAAI,GAAG;AAAE,SAAO,KAAK,IAAI,IAAI,CAAC,CAAC;;AACpD,IAAI,MAAM,SAAU,KAAK,IAAI;AAAE,SAAO,KAAK,KAAK,GAAG,EAAE,CAAC;;AAEtD,IAAI,UAAU,SAAU,IAAI,GAAG,GAAG;AAAE,SAAO,KAAK,IAAI,OAAO,GAAG,CAAC,CAAC;AAAE;AAElE,IAAI,WAAW,SAAU,GAAG;AAAE,SAAO,SAAU,IAAI,GAAG;AAClD,QAAI,WAAW,QAAQ,CAAC;AACxB,WAAO,KAAK,IAAI,SAAS,CAAC,CAAC;AAAA,EAC/B;;AAEA,IAAI,eAAe,SAAU,IAAI,GAAG,GAAG;AAAE,SAAO,KAAK,IAAI,YAAY,GAAG,CAAC,CAAC;AAAE;AAC5E,IAAI,YAAY,SAAU,GAAG;AACzB,MAAI,YAAY,SAAS,CAAC;AAC1B,SAAO,SAAU,IAAI,GAAG;AAAE,WAAO,KAAK,IAAI,UAAU,CAAC,CAAC;AAAA;AAC1D;AACA,IAAI,SAAS,SAAU,IAAI,GAAG,GAAG;AAAE,SAAO,KAAK,IAAI,MAAM,GAAG,CAAC,CAAC;AAAE;AAChE,IAAI,WAAW,SAAU,IAAI,GAAG;AAAE,SAAO,KAAK,IAAI,QAAQ,CAAC,CAAC;;AAE5D,IAAI,OAAO,SAAU,IAAI,MAAM;AAAE,SAAO,KAAK,IAAI,IAAI,IAAI,CAAC;;AAE1D,IAAI,UAAU,SAAU,IAAI,GAAG;AAAE,SAAO,KAAK,IAAI,OAAO,CAAC,CAAC;;AAC1D,IAAI,YAAY,SAAU,GAAG,GAAG;AAC5B,SAAO,QAAQ,EAAE,CAAC,GAAG,SAAU,GAAG;AAC9B,WAAO,OAAO,CAAC,IAAI,MAAM,KAAK,EAAE,IAAI,CAAC,IAAI,OAAO,EAAE,KAAK,IAAI,KAAK,EAAE,EAAE,MAAM,IAAI,CAAC,IAAI,MAAM,MAAM,EAAE,MAAM,KAAK,CAAC;AAAA,EACrH,CAAK;AACL;AAKU,IAAC,MAAM;AAKP,IAAC,UAAU,SAAU,IAAI,IAAI;AAAE,SAAQ;AAAA,IAC7C,MAAM,SAAU,IAAI;AAAE,aAAQ,OAAO,EAAE,IAAI,QAAQ,OAAO,GAAG,KAAK,GAAG,IAAI,GAAG,GAAG,IAAI,SAAS,OAAO,GAAG,KAAK,GAAG,KAAK,GAAG,GAAG;AAAA,IAAK;AAAA,EAClI;AAAM;AAKI,IAAC,QAAQ,SAAU,IAAI,IAAI;AAAE,SAAQ;AAAA,IAC3C,QAAQ,SAAU,GAAG,GAAG;AACpB,aAAO,MAAM,MAAM,OAAO,CAAC,IAAI,OAAO,CAAC,KAAK,GAAG,OAAO,EAAE,MAAM,EAAE,IAAI,IAAI,QAAQ,CAAC,KAAK,GAAG,OAAO,EAAE,OAAO,EAAE,KAAK;AAAA,IACnH;AAAA,EACL;AAAM;AAkBI,IAAC,eAAe,SAAU,GAAG;AAAE,SAAQ;AAAA,IAC7C,QAAQ,SAAU,GAAG,GAAG;AAAE,aAAQ,OAAO,CAAC,IAAI,IAAI,OAAO,CAAC,IAAI,IAAI,MAAM,EAAE,OAAO,EAAE,OAAO,EAAE,KAAK,CAAC;AAAA,IAAK;AAAA,EAC3G;AAAM;AAOI,IAAC,iBAAiB,SAAU,GAAG;AACrC,MAAI,QAAQ,KAAK,EAAE,KAAK;AACxB,SAAO;AAAA,IACH;AAAA,IACA,IAAI;AAAA,IACJ,SAAS,SAAU,IAAI;AAAE,aAAQ,OAAO,EAAE,IAAI,KAAK,GAAG,MAAM,SAAS,SAAS,QAAQ,MAAM,GAAG,MAAM,KAAK;AAAA,IAAK;AAAA,IAC/G,UAAU,SAAU,IAAI;AACpB,aAAO,OAAO,EAAE,IACV,UAAU,IAAI,EAAE,IAChB,OAAO,GAAG,KAAK,IACX,UAAU,MAAM,GAAG,MAAM,IAAI,GAAG,KAAK,IACrC,UAAU,OAAO,MAAM,GAAG,MAAM,KAAK,CAAC;AAAA,IACnD;AAAA,EACT;AACA;AAOU,IAAC,gBAAgB,SAAU,GAAG;AACpC,MAAI,QAAQ,KAAK,EAAE,KAAK;AACxB,MAAI,KAAK,eAAe,CAAC,GAAG,UAAU,GAAG,SAAS,WAAW,GAAG;AAChE,MAAI,SAAS,SAAU,IAAI,WAAW;AAClC,WAAO,OAAO,EAAE,IAAI,KAAK,UAAU,GAAG,KAAK,IAAI,KAAK;AAAA,EAC5D;AACI,MAAI,YAAY,SAAU,IAAI,GAAG;AAC7B,WAAO,OAAO,EAAE,IACV,UAAU,IAAI,EAAE,IAChB,EAAE,GAAG,KAAK,IACN,UAAU,OAAO,MAAM,GAAG,KAAK,CAAC,IAChC,UAAU,MAAM,GAAG,KAAK,GAAG,KAAK;AAAA,EAClD;AACI,SAAO;AAAA,IACH;AAAA,IACA,IAAI;AAAA,IACJ,KAAK;AAAA,IACL;AAAA,IACA;AAAA,IACA;AAAA,IACA,WAAW,SAAU,IAAI,GAAG;AACxB,UAAI,OAAO,EAAE,GAAG;AACZ,eAAO;AAAA,MACV;AACD,UAAI,KAAK,EAAE,GAAG,KAAK;AACnB,aAAO,GAAG,SAAS,SAAS,QAAQ,MAAM,GAAG,KAAK;AAAA,IACrD;AAAA,IACD;AAAA,IACA,cAAc,SAAU,IAAI,GAAG;AAC3B,UAAI,OAAO,EAAE,GAAG;AACZ,eAAO,UAAU,IAAI,EAAE;AAAA,MAC1B;AACD,UAAI,IAAI,EAAE,GAAG,KAAK;AAClB,aAAO,OAAO,CAAC,IAAI,UAAU,MAAM,EAAE,IAAI,GAAG,KAAK,IAAI,UAAU,OAAO,MAAM,EAAE,KAAK,CAAC;AAAA,IACvF;AAAA,EACT;AACA;AAOU,IAAC,gBAAgB,SAAU,GAAG;AACpC,MAAI,KAAK,cAAc,CAAC;AACxB,MAAI,IAAI,eAAe,CAAC;AACxB,SAAO;AAAA,IACH;AAAA,IACA,IAAI;AAAA,IACJ,KAAK;AAAA,IACL,SAAS,GAAG;AAAA,IACZ,UAAU,GAAG;AAAA,IACb,QAAQ,GAAG;AAAA,IACX,WAAW,GAAG;AAAA,IACd,WAAW,GAAG;AAAA,IACd,cAAc,GAAG;AAAA,IACjB,UAAU;AAAA,IACV;AAAA,IACA,QAAQ;AAAA,IACR,SAAS;AAAA,IACT,aAAa;AAAA,IACb,QAAQ,cAAc,aAAa,CAAC;AAAA,IACpC,MAAM,YAAY,aAAa,CAAC;AAAA,EACxC;AACA;AAsDU,IAAC,2BAA2B,SAAU,IAAI;AAAE,SAAQ;AAAA,IAC1D;AAAA,IACA,IAAI;AAAA,IACJ,KAAK;AAAA,IACL,IAAI,SAAU,KAAK,IAAI;AACnB,aAAO,OAAO,GAAG,IACX,OAAO,EAAE,IACL,KAAK,GAAG,OAAO,IAAI,MAAM,GAAG,IAAI,CAAC,IACjC,MACJ,OAAO,EAAE,IACL,KACA,MAAM,IAAI,MAAM,GAAG,KAAK,CAAC;AAAA,IACtC;AAAA,IACD;AAAA,EACJ;AAAM;AAmCI,IAAC,mBAAmB,SAAU,IAAI;AAAE,SAAQ;AAAA,IAClD;AAAA,IACA,IAAI;AAAA,IACJ,KAAK;AAAA,IACL,KAAK,SAAU,IAAI,MAAM;AACrB,UAAI,QAAQ,EAAE,GAAG;AACb,eAAO;AAAA,MACV;AACD,UAAI,KAAK;AACT,aAAO,OAAO,EAAE,IAAI,KAAK,GAAG,OAAO,GAAG,MAAM,GAAG,IAAI,CAAC,IAAI;AAAA,IAC3D;AAAA,EACL;AAAM;AAKI,IAAC,MAAM,SAAU,GAAG;AAAE,SAAO,SAAU,IAAI;AACjD,WAAO,OAAO,EAAE,IAAI,KAAK,MAAM,EAAE,GAAG,KAAK,CAAC;AAAA,EAC9C;AAAK;AAKK,IAAC,UAAU;AAAA,EACjB;AAAA,EACA,KAAK;AACT;AAOU,IAAC,KAAK,KAAK,GAAGC,KAAI,OAAO,CAAC;AAO1B,IAAC,SAASC,SAAQ,OAAO;AAKzB,IAAC,KAAK;AAKN,IAAC,UAAU;AAAA,EACjB;AAAA,EACA;AACJ;AAQU,IAAC,MAAM,SAAU,IAAI;AAAE,SAAO,SAAU,KAAK;AACnD,WAAO,OAAO,GAAG,IAAI,MAAM,OAAO,EAAE,IAAI,KAAK,MAAM,IAAI,MAAM,GAAG,KAAK,CAAC;AAAA,EAC1E;AAAK;AAIK,IAAC,KAAK;AAKN,IAAC,QAAQ;AAAA,EACf;AAAA,EACA,KAAK;AAAA,EACL,IAAI;AACR;AAKU,IAAC,cAAc;AAAA,EACrB;AAAA,EACA,KAAK;AAAA,EACL,IAAI;AAAA,EACJ;AACJ;AAKU,IAAC,QAAQ;AAAA,EACf;AAAA,EACA,KAAK;AAAA,EACL,IAAI;AAAA,EACJ,OAAO;AACX;AAKU,IAAC,QAAQ;AAAA,EACf;AAAA,EACA,KAAK;AAAA,EACL,IAAI;AAAA,EACJ;AAAA,EACA,OAAO;AACX;AAwBU,IAAC,SAAS,SAAU,GAAG,GAAG;AAAE,SAAO,SAAU,IAAI;AACvD,WAAO,OAAO,EAAE,IAAI,IAAI,EAAE,GAAG,GAAG,KAAK;AAAA,EACzC;AAAK;AAwBK,IAAC,UAAU,SAAU,GAAG;AAAE,SAAO,SAAU,GAAG;AAAE,WAAO,SAAU,IAAI;AAC3E,aAAO,OAAO,EAAE,IAAI,EAAE,QAAQ,EAAE,GAAG,KAAK;AAAA,IAC5C;AAAA,EAAI;AAAI;AAwBE,IAAC,cAAc,SAAU,GAAG,GAAG;AAAE,SAAO,SAAU,IAAI;AAC5D,WAAO,OAAO,EAAE,IAAI,IAAI,EAAE,GAAG,OAAO,CAAC;AAAA,EACzC;AAAK;AAKK,IAAC,WAAW;AAAA,EAClB;AAAA,EACA,QAAQ;AAAA,EACR,SAAS;AAAA,EACT,aAAa;AACjB;AAuBU,IAAC,WAAW,SAAU,GAAG;AAC/B,SAAO,SAAU,GAAG;AAChB,WAAO,SAAU,IAAI;AACjB,aAAO,OAAO,EAAE,IAAI,EAAE,GAAG,KAAK,GAAG,IAAI,CAAC,IAAI,EAAE,IAAI,EAAE,GAAG,KAAK,GAAG,KAAK;AAAA,IAC9E;AAAA,EACA;AACA;AAsBU,IAAC,WAAW,SAAU,GAAG;AAC/B,SAAO,SAAU,IAAI;AACjB,WAAO,OAAO,EAAE,IAAI,EAAE,GAAG,KAAK,GAAG,IAAI,CAAC,IAAI,EAAE,IAAI,GAAG,OAAO,KAAK;AAAA,EACvE;AACA;AAKU,IAAC,cAAc;AAAA,EACrB;AAAA,EACA,KAAK;AAAA,EACL,QAAQ;AAAA,EACR,SAAS;AAAA,EACT,aAAa;AAAA,EACb,UAAU;AAAA,EACV;AACJ;AAOU,IAAC,QAAQ,SAAU,GAAG,GAAG;AAAE,SAAO,SAAU,IAAI;AACtD,WAAO,OAAO,EAAE,IAAI,KAAK,EAAE,GAAG,IAAI,CAAC,IAAI,MAAM,EAAE,GAAG,KAAK,CAAC;AAAA,EAC5D;AAAK;AAOK,IAAC,UAAU,SAAU,GAAG;AAAE,SAAO,SAAU,IAAI;AACrD,WAAO,OAAO,EAAE,IAAI,KAAK,EAAE,GAAG,IAAI,CAAC,IAAI;AAAA,EAC3C;AAAK;AAKK,IAAC,YAAY;AAAA,EACnB;AAAA,EACA,OAAO;AAAA,EACP,SAAS;AACb;AASU,IAAC,OAAO,SAAU,MAAM;AAAE,SAAO,SAAU,IAAI;AACrD,WAAO,OAAO,EAAE,IAAI,KAAI,IAAK;AAAA,EACjC;AAAK;AAkDK,IAAC,MAAM;AAKP,IAAC,MAAM;AAAA,EACb;AAAA,EACA,KAAK;AAAA,EACL,KAAK;AACT;AAIU,IAAC,SAAS,SAAU,GAAG;AAAE,SAAO,SAAU,IAAI;AACpD,WAAO,OAAO,EAAE,IAAI,KAAK,MAAM,EAAE,EAAE,CAAC;AAAA,EACxC;AAAK;AAKK,IAAC,SAAS;AAAA,EAChB;AAAA,EACA,KAAK;AAAA,EACL,QAAQ;AACZ;AAKU,IAAC,WAAW;AAAA,EAClB;AAAA,EACA,KAAK;AAAA,EACL,IAAI;AAAA,EACJ,OAAO;AAAA,EACP,UAAU;AACd;AAIU,IAAC,aAAa;AAKd,IAAC,aAAa;AAAA,EACpB;AAAA,EACA,KAAK;AAAA,EACL,IAAI;AAAA,EACJ;AAAA,EACA,OAAO;AAAA,EACP;AACJ;AAKU,IAAC,aAAa;AAAA,EACpB;AAAA,EACA,YAAY;AAChB;AA8BU,IAAC,gBAA8BC,gCAAe,UAAU;AA4BxD,IAAC,aACGC,6BAAY,UAAU;AAU1B,IAAC,SAASC;AAOV,IAAC,UAAUC;AASX,IAAC,SAAS,SAAU,QAAQ,SAAS;AAC3C,SAAO,SAAU,IAAI;AACjB,WAAO,OAAO,EAAE,IAAI,OAAO,GAAG,IAAI,IAAI,QAAQ,GAAG,KAAK;AAAA,EAC9D;AACA;AAOU,IAAC,QAAQ;AAmCT,IAAC,QAAQ;AAOT,IAAC,OAAO;AASR,IAAC,aAAa,SAAU,QAAQ;AACtC,SAAO,SAAU,IAAI;AACjB,WAAO,OAAO,EAAE,IAAI,OAAO,GAAG,IAAI,IAAI,GAAG;AAAA,EACjD;AACA;AA0BU,IAAC,YAAY;AAQb,IAAC,OAAqBC,uBAAM,OAAO;AAMnC,IAAC,UAAwBC,0BAAS,KAAK;AAQvC,IAAC,WAAW;AAMZ,IAAC,WAAyBC,2BAAU,KAAK;AAQzC,IAAC,YAAY;AAQb,IAAC,MAAoB,qBAAK,GAAGC,MAAc,KAAK,CAAC;AASjD,IAAC,WACG,wBAAQ,QAAQ;AAcpB,IAAC,UAAU;AAIX,IAAC,YAA0B,uBAAO,QAAQ;AAO1C,IAAC,cACGC,8BAAa,UAAU;AAO3B,IAAC,eAA6BC,+BAAc,YAAY,KAAK;AAO7D,IAAC,gBAA8B;AAEzC,IAAI,cAAc;AAAA,EACd,YAAY,WAAW;AAC3B;AAKU,IAAC,eAA6BC,+BAAe,WAAW;AAKxD,IAAC,aAA2BC,6BAAa,WAAW;AAE9D,IAAI,WAAW;AAAA,EACX;AACJ;AAKU,IAAC,kBAAgCC,kCAAkB,aAAa,QAAQ;AAKxE,IAAC,gBAA8BC,gCAAgB,aAAa,QAAQ;AAwCpE,IAAC,eAA6BC,+BAAc,YAAY,KAAK;AAS7D,IAAC,gBAAgB;AAMjB,IAAC,OAAO,SAAU,IAAI;AAAE,SAAQ,OAAO,EAAE,IAAI,MAAM,GAAG,IAAI,IAAI,KAAK,GAAG,KAAK;AAAM;AASjF,IAAC,UAAU,SAAU,QAAQ;AACnC,SAAO,SAAU,IAAI;AACjB,WAAO,OAAO,EAAE,IAAI,OAAO,GAAG,IAAI,IAAI;AAAA,EAC9C;AACA;AAOU,IAAC,SAAS;AAgBV,IAAC,eAAe,SAAU,GAAG;AACnC,SAAO,SAAU,GAAG;AAChB,WAAO,KAAK,OAAO,KAAK,CAAC,IAAI,MAAM,CAAC;AAAA,EAC5C;AACA;AA0BU,IAAC,WAAW,SAAU,GAAG,SAAS;AACxC,MAAI;AACA,WAAO,MAAM,EAAC,CAAE;AAAA,EACnB,SACM,GAAP;AACI,WAAO,KAAK,QAAQ,CAAC,CAAC;AAAA,EACzB;AACL;AAOU,IAAC,YAAY,SAAU,GAAG,SAAS;AACzC,SAAO,WAAY;AACf,QAAI,IAAI,CAAA;AACR,aAAS,KAAK,GAAG,KAAK,UAAU,QAAQ,MAAM;AAC1C,QAAE,EAAE,IAAI,UAAU,EAAE;AAAA,IACvB;AACD,WAAO,SAAS,WAAY;AAAE,aAAO,EAAE,MAAM,QAAQ,CAAC;AAAA,OAAM,OAAO;AAAA,EAC3E;AACA;AAOU,IAAC,gBAAgB,SAAU,GAAG;AACpC,MAAI,OAAO,aAAa,CAAC;AACzB,SAAO,SAAU,GAAG;AAAE,WAAO,KAAK,GAAG,IAAI;AAAA;AAC7C;AAOU,IAAC,iBAAiB,SAAU,GAAG;AACrC,MAAI,OAAO,cAAc,CAAC;AAC1B,SAAO,SAAU,GAAG;AAAE,WAAO,QAAQ,KAAK,CAAC,CAAC;AAAA;AAChD;AAKU,IAAC,UAAwB,sBAAM,UAAU,QAAQ;AASpD,SAAS,QAAQ,GAAG;AACvB,SAAO,aAAa,QAAQ,IAAI,IAAI,MAAM,OAAO,CAAC,CAAC;AACvD;AACO,SAAS,KAAK,GAAG;AACpB,SAAO,SAAU,GAAG,IAAI;AACpB,QAAI,OAAO,QAAW;AAClB,UAAI,UAAU,KAAK,CAAC;AACpB,aAAO,SAAUC,KAAI;AAAE,eAAO,QAAQ,GAAGA,GAAE;AAAA;IAC9C;AACD,WAAO,OAAO,EAAE,IAAI,QAAQ,EAAE,OAAO,GAAG,GAAG,KAAK;AAAA,EACxD;AACA;AAeU,IAAC,SAAS,SAAU,WAAW;AACrC,SAAO,SAAU,IAAI;AACjB,WAAO,OAAO,EAAE,IAAI,QAAQ,UAAU,GAAG,KAAK;AAAA,EACtD;AACA;AAQU,IAAC,KAAmB,mBAAGC,WAAa;AAKpC,IAAC,SAAuBC,yBAAQ,OAAO;AAC9C,IAAC,OAAqBC,uBAAM,OAAO;AAW5B,IAAC,OAAqBC,uBAAe,KAAK;AAO1C,IAAC,QAAQ;AAKT,IAAC,MAAoBC,sBAAK,KAAK;AAS/B,IAAC,OAAO;AAIR,IAAC,MAAoB,mBAAGC,kBAAoB;AAU5C,IAAC,yCAAyC,SAAU,GAAG;AAC7D,SAAO,SAAUC,KAAI;AACjB,QAAI,IAAI,EAAE,GAAGC,KAAOD,GAAE,CAAC;AACvB,QAAI,OAAO,CAAC,GAAG;AACX,aAAO;AAAA,IACV;AACD,QAAI,MAAM,CAAC,EAAE,KAAK;AAClB,aAAS,IAAI,GAAG,IAAIA,IAAG,QAAQ,KAAK;AAChC,UAAI,MAAM,EAAE,GAAGA,IAAG,CAAC,CAAC;AACpB,UAAI,OAAO,GAAG,GAAG;AACb,eAAO;AAAA,MACV;AACD,UAAI,KAAK,IAAI,KAAK;AAAA,IACrB;AACD,WAAO,MAAM,GAAG;AAAA,EACxB;AACA;AAOU,IAAC,iCAAiC,SAAU,GAAG;AACrD,MAAI,IAAI,uCAAuC,CAAC;AAChD,SAAO,SAAUA,KAAI;AAAE,WAAQE,WAAaF,GAAE,IAAI,EAAEA,GAAE,IAAI;AAAA;AAC9D;AAOU,IAAC,yBAAyB;AAO1B,IAAC,gBAAgB,SAAU,GAAG;AAAE,SAAO,+BAA+B,SAAU,GAAG,GAAG;AAAE,WAAO,EAAE,CAAC;AAAA,EAAE,CAAE;AAAK;AAO3G,IAAC,gBACG,8BAAc,QAAQ;AAU1B,IAAC,SAAS;AAOV,IAAC,QAAQ;AAOT,IAAC,aAAa;AAOd,IAAC,cAAc;AAQlB,SAAS,UAAU,GAAG,SAAS;AAClC,SAAO,SAAS,WAAY;AAAE,WAAO,KAAK,MAAM,CAAC;AAAA,KAAM,OAAO;AAClE;AAQU,IAAC,gBAAgB,SAAU,GAAG,SAAS;AAC7C,SAAO,SAAS,WAAY;AACxB,QAAI,IAAI,KAAK,UAAU,CAAC;AACxB,QAAI,OAAO,MAAM,UAAU;AACvB,YAAM,IAAI,MAAM,0CAA0C;AAAA,IAC7D;AACD,WAAO;AAAA,EACV,GAAE,OAAO;AACd;AAUU,IAAC,SAAS;AAAA,EAChB;AAAA,EACA,KAAK;AAAA,EACL;AAAA,EACA,IAAI;AAAA,EACJ,OAAO;AAAA,EACP,QAAQ;AAAA,EACR,SAAS;AAAA,EACT,aAAa;AAAA,EACb,UAAU;AAAA,EACV;AAAA,EACA,OAAO;AAAA,EACP,SAAS;AAAA,EACT,KAAK;AAAA,EACL,QAAQ;AAAA,EACR,UAAU;AAAA,EACV;AACJ;AAWU,IAAC,oBACGG,oCAAmB,KAAK;AAQ5B,IAAC,iBACG,qCAAqB,WAAW;AAQpC,IAAC,yBAAyB,SAAU,IAAI,IAAI;AAClD,SAAOA,oBAAmB,yBAAyB,EAAE,CAAC,EAAE,EAAE;AAC9D;AAQU,IAAC,sBAAsB,SAAU,IAAI,IAAI;AAC/C,SAAO,qBAAqB,yBAAyB,EAAE,CAAC,EAAE,EAAE;AAChE;AAQO,SAAS,cAAc,IAAI;AAC9B,MAAIC,MAAK,yBAAyB,EAAE,EAAE;AACtC,MAAIC,OAAM,iBAAiB,EAAE,EAAE;AAC/B,SAAO;AAAA,IACH;AAAA,IACA,IAAI;AAAA,IACJ,KAAK;AAAA,IACL;AAAA,IACA,OAAO;AAAA,IACP,OAAO;AAAA,IACP,SAAS;AAAA,IACT,QAAQ;AAAA,IACR,SAAS;AAAA,IACT,aAAa;AAAA,IACb,QAAQ;AAAA,IACR,UAAU;AAAA,IACV;AAAA,IACA,UAAU;AAAA,IACV;AAAA,IACA,IAAID;AAAA,IACJ,KAAKC;AAAA,EACb;AACA;","x_google_ignoreList":[0]}
1	+ {"version":3,"file":"Either.js","sources":["../../../../../../node_modules/fp-ts/es6/Either.js"],"sourcesContent":["import { getApplicativeMonoid } from './Applicative';\nimport { apFirst as apFirst_, apS as apS_, apSecond as apSecond_, getApplySemigroup as getApplySemigroup_ } from './Apply';\nimport * as chainable from './Chain';\nimport { tailRec } from './ChainRec';\nimport { chainOptionK as chainOptionK_, filterOrElse as filterOrElse_, fromOption as fromOption_, fromOptionK as fromOptionK_, fromPredicate as fromPredicate_ } from './FromEither';\nimport { dual, flow, identity, pipe } from './function';\nimport { as as as_, asUnit as asUnit_, bindTo as bindTo_, flap as flap_, let as let__ } from './Functor';\nimport * as _ from './internal';\nimport { separated } from './Separated';\nimport { wiltDefault, witherDefault } from './Witherable';\n// -------------------------------------------------------------------------------------\n// constructors\n// -------------------------------------------------------------------------------------\n/*\n Constructs a new `Either` holding a `Left` value. This usually represents a failure, due to the right-bias of this\n * structure.\n \n @category constructors\n * @since 2.0.0\n /\nexport var left = _.left;\n/\n Constructs a new `Either` holding a `Right` value. This usually represents a successful value due to the right bias\n * of this structure.\n \n @category constructors\n * @since 2.0.0\n /\nexport var right = _.right;\n/\n @category sequencing\n * @since 2.14.0\n /\nexport var flatMap = /#__PURE__/ dual(2, function (ma, f) { return (isLeft(ma) ? ma : f(ma.right)); });\nvar _map = function (fa, f) { return pipe(fa, map(f)); };\nvar _ap = function (fab, fa) { return pipe(fab, ap(fa)); };\n/ istanbul ignore next /\nvar _reduce = function (fa, b, f) { return pipe(fa, reduce(b, f)); };\n/ istanbul ignore next /\nvar _foldMap = function (M) { return function (fa, f) {\n var foldMapM = foldMap(M);\n return pipe(fa, foldMapM(f));\n}; };\n/ istanbul ignore next /\nvar _reduceRight = function (fa, b, f) { return pipe(fa, reduceRight(b, f)); };\nvar _traverse = function (F) {\n var traverseF = traverse(F);\n return function (ta, f) { return pipe(ta, traverseF(f)); };\n};\nvar _bimap = function (fa, f, g) { return pipe(fa, bimap(f, g)); };\nvar _mapLeft = function (fa, f) { return pipe(fa, mapLeft(f)); };\n/ istanbul ignore next /\nvar _alt = function (fa, that) { return pipe(fa, alt(that)); };\n/ istanbul ignore next /\nvar _extend = function (wa, f) { return pipe(wa, extend(f)); };\nvar _chainRec = function (a, f) {\n return tailRec(f(a), function (e) {\n return isLeft(e) ? right(left(e.left)) : isLeft(e.right) ? left(f(e.right.left)) : right(right(e.right.right));\n });\n};\n/\n @category type lambdas\n * @since 2.0.0\n /\nexport var URI = 'Either';\n/\n @category instances\n * @since 2.0.0\n /\nexport var getShow = function (SE, SA) { return ({\n show: function (ma) { return (isLeft(ma) ? \"left(\".concat(SE.show(ma.left), \")\") : \"right(\".concat(SA.show(ma.right), \")\")); }\n}); };\n/\n @category instances\n * @since 2.0.0\n /\nexport var getEq = function (EL, EA) { return ({\n equals: function (x, y) {\n return x === y \|\| (isLeft(x) ? isLeft(y) && EL.equals(x.left, y.left) : isRight(y) && EA.equals(x.right, y.right));\n }\n}); };\n/\n Semigroup returning the left-most non-`Left` value. If both operands are `Right`s then the inner values are\n * concatenated using the provided `Semigroup`\n \n @example\n * import { getSemigroup, left, right } from 'fp-ts/Either'\n * import { SemigroupSum } from 'fp-ts/number'\n \n const S = getSemigroup<string, number>(SemigroupSum)\n * assert.deepStrictEqual(S.concat(left('a'), left('b')), left('a'))\n * assert.deepStrictEqual(S.concat(left('a'), right(2)), right(2))\n * assert.deepStrictEqual(S.concat(right(1), left('b')), right(1))\n * assert.deepStrictEqual(S.concat(right(1), right(2)), right(3))\n \n @category instances\n * @since 2.0.0\n /\nexport var getSemigroup = function (S) { return ({\n concat: function (x, y) { return (isLeft(y) ? x : isLeft(x) ? y : right(S.concat(x.right, y.right))); }\n}); };\n/\n Builds a `Compactable` instance for `Either` given `Monoid` for the left side.\n \n @category filtering\n * @since 2.10.0\n /\nexport var getCompactable = function (M) {\n var empty = left(M.empty);\n return {\n URI: URI,\n _E: undefined,\n compact: function (ma) { return (isLeft(ma) ? ma : ma.right._tag === 'None' ? empty : right(ma.right.value)); },\n separate: function (ma) {\n return isLeft(ma)\n ? separated(ma, ma)\n : isLeft(ma.right)\n ? separated(right(ma.right.left), empty)\n : separated(empty, right(ma.right.right));\n }\n };\n};\n/\n Builds a `Filterable` instance for `Either` given `Monoid` for the left side\n \n @category filtering\n * @since 2.10.0\n /\nexport var getFilterable = function (M) {\n var empty = left(M.empty);\n var _a = getCompactable(M), compact = _a.compact, separate = _a.separate;\n var filter = function (ma, predicate) {\n return isLeft(ma) ? ma : predicate(ma.right) ? ma : empty;\n };\n var partition = function (ma, p) {\n return isLeft(ma)\n ? separated(ma, ma)\n : p(ma.right)\n ? separated(empty, right(ma.right))\n : separated(right(ma.right), empty);\n };\n return {\n URI: URI,\n _E: undefined,\n map: _map,\n compact: compact,\n separate: separate,\n filter: filter,\n filterMap: function (ma, f) {\n if (isLeft(ma)) {\n return ma;\n }\n var ob = f(ma.right);\n return ob._tag === 'None' ? empty : right(ob.value);\n },\n partition: partition,\n partitionMap: function (ma, f) {\n if (isLeft(ma)) {\n return separated(ma, ma);\n }\n var e = f(ma.right);\n return isLeft(e) ? separated(right(e.left), empty) : separated(empty, right(e.right));\n }\n };\n};\n/\n Builds `Witherable` instance for `Either` given `Monoid` for the left side\n \n @category filtering\n * @since 2.0.0\n /\nexport var getWitherable = function (M) {\n var F_ = getFilterable(M);\n var C = getCompactable(M);\n return {\n URI: URI,\n _E: undefined,\n map: _map,\n compact: F_.compact,\n separate: F_.separate,\n filter: F_.filter,\n filterMap: F_.filterMap,\n partition: F_.partition,\n partitionMap: F_.partitionMap,\n traverse: _traverse,\n sequence: sequence,\n reduce: _reduce,\n foldMap: _foldMap,\n reduceRight: _reduceRight,\n wither: witherDefault(Traversable, C),\n wilt: wiltDefault(Traversable, C)\n };\n};\n/\n The default [`Applicative`](#applicative) instance returns the first error, if you want to\n * get all errors you need to provide a way to concatenate them via a `Semigroup`.\n \n @example\n * import * as A from 'fp-ts/Apply'\n * import * as E from 'fp-ts/Either'\n * import { pipe } from 'fp-ts/function'\n * import * as S from 'fp-ts/Semigroup'\n * import * as string from 'fp-ts/string'\n \n const parseString = (u: unknown): E.Either<string, string> =>\n * typeof u === 'string' ? E.right(u) : E.left('not a string')\n \n const parseNumber = (u: unknown): E.Either<string, number> =>\n * typeof u === 'number' ? E.right(u) : E.left('not a number')\n \n interface Person {\n * readonly name: string\n * readonly age: number\n * }\n \n const parsePerson = (\n * input: Record<string, unknown>\n * ): E.Either<string, Person> =>\n * pipe(\n * E.Do,\n * E.apS('name', parseString(input.name)),\n * E.apS('age', parseNumber(input.age))\n * )\n \n assert.deepStrictEqual(parsePerson({}), E.left('not a string')) // <= first error\n \n const Applicative = E.getApplicativeValidation(\n * pipe(string.Semigroup, S.intercalate(', '))\n * )\n \n const apS = A.apS(Applicative)\n \n const parsePersonAll = (\n * input: Record<string, unknown>\n * ): E.Either<string, Person> =>\n * pipe(\n * E.Do,\n * apS('name', parseString(input.name)),\n * apS('age', parseNumber(input.age))\n * )\n \n assert.deepStrictEqual(parsePersonAll({}), E.left('not a string, not a number')) // <= all errors\n \n @category error handling\n * @since 2.7.0\n /\nexport var getApplicativeValidation = function (SE) { return ({\n URI: URI,\n _E: undefined,\n map: _map,\n ap: function (fab, fa) {\n return isLeft(fab)\n ? isLeft(fa)\n ? left(SE.concat(fab.left, fa.left))\n : fab\n : isLeft(fa)\n ? fa\n : right(fab.right(fa.right));\n },\n of: of\n}); };\n/\n The default [`Alt`](#alt) instance returns the last error, if you want to\n * get all errors you need to provide a way to concatenate them via a `Semigroup`.\n \n @example\n * import * as E from 'fp-ts/Either'\n * import { pipe } from 'fp-ts/function'\n * import * as S from 'fp-ts/Semigroup'\n * import * as string from 'fp-ts/string'\n \n const parseString = (u: unknown): E.Either<string, string> =>\n * typeof u === 'string' ? E.right(u) : E.left('not a string')\n \n const parseNumber = (u: unknown): E.Either<string, number> =>\n * typeof u === 'number' ? E.right(u) : E.left('not a number')\n \n const parse = (u: unknown): E.Either<string, string \| number> =>\n * pipe(\n * parseString(u),\n * E.alt<string, string \| number>(() => parseNumber(u))\n * )\n \n assert.deepStrictEqual(parse(true), E.left('not a number')) // <= last error\n \n const Alt = E.getAltValidation(pipe(string.Semigroup, S.intercalate(', ')))\n \n const parseAll = (u: unknown): E.Either<string, string \| number> =>\n * Alt.alt<string \| number>(parseString(u), () => parseNumber(u))\n \n assert.deepStrictEqual(parseAll(true), E.left('not a string, not a number')) // <= all errors\n \n @category error handling\n * @since 2.7.0\n /\nexport var getAltValidation = function (SE) { return ({\n URI: URI,\n _E: undefined,\n map: _map,\n alt: function (me, that) {\n if (isRight(me)) {\n return me;\n }\n var ea = that();\n return isLeft(ea) ? left(SE.concat(me.left, ea.left)) : ea;\n }\n}); };\n/\n @category mapping\n * @since 2.0.0\n /\nexport var map = function (f) { return function (fa) {\n return isLeft(fa) ? fa : right(f(fa.right));\n}; };\n/\n @category instances\n * @since 2.7.0\n /\nexport var Functor = {\n URI: URI,\n map: _map\n};\n/\n Maps the `Right` value of this `Either` to the specified constant value.\n \n @category mapping\n * @since 2.16.0\n /\nexport var as = dual(2, as_(Functor));\n/\n Maps the `Right` value of this `Either` to the void constant value.\n \n @category mapping\n * @since 2.16.0\n /\nexport var asUnit = asUnit_(Functor);\n/\n @category constructors\n * @since 2.7.0\n /\nexport var of = right;\n/\n @category instances\n * @since 2.10.0\n /\nexport var Pointed = {\n URI: URI,\n of: of\n};\n/\n Less strict version of [`ap`](#ap).\n \n The `W` suffix (short for Widening) means that the error types will be merged.\n \n @since 2.8.0\n /\nexport var apW = function (fa) { return function (fab) {\n return isLeft(fab) ? fab : isLeft(fa) ? fa : right(fab.right(fa.right));\n}; };\n/\n @since 2.0.0\n /\nexport var ap = apW;\n/\n @category instances\n * @since 2.10.0\n /\nexport var Apply = {\n URI: URI,\n map: _map,\n ap: _ap\n};\n/\n @category instances\n * @since 2.7.0\n /\nexport var Applicative = {\n URI: URI,\n map: _map,\n ap: _ap,\n of: of\n};\n/\n @category instances\n * @since 2.10.0\n /\nexport var Chain = {\n URI: URI,\n map: _map,\n ap: _ap,\n chain: flatMap\n};\n/\n @category instances\n * @since 2.7.0\n /\nexport var Monad = {\n URI: URI,\n map: _map,\n ap: _ap,\n of: of,\n chain: flatMap\n};\n/\n Left-associative fold of a structure.\n \n @example\n * import { pipe } from 'fp-ts/function'\n * import * as E from 'fp-ts/Either'\n \n const startWith = 'prefix'\n * const concat = (a: string, b: string) => `${a}:${b}`\n \n assert.deepStrictEqual(\n * pipe(E.right('a'), E.reduce(startWith, concat)),\n * 'prefix:a'\n * )\n \n assert.deepStrictEqual(\n * pipe(E.left('e'), E.reduce(startWith, concat)),\n * 'prefix'\n * )\n \n @category folding\n * @since 2.0.0\n /\nexport var reduce = function (b, f) { return function (fa) {\n return isLeft(fa) ? b : f(b, fa.right);\n}; };\n/\n Map each element of the structure to a monoid, and combine the results.\n \n @example\n * import { pipe } from 'fp-ts/function'\n * import * as E from 'fp-ts/Either'\n * import * as S from 'fp-ts/string'\n \n const yell = (a: string) => `${a}!`\n \n assert.deepStrictEqual(\n * pipe(E.right('a'), E.foldMap(S.Monoid)(yell)),\n * 'a!'\n * )\n \n assert.deepStrictEqual(\n * pipe(E.left('e'), E.foldMap(S.Monoid)(yell)),\n * S.Monoid.empty\n * )\n \n @category folding\n * @since 2.0.0\n /\nexport var foldMap = function (M) { return function (f) { return function (fa) {\n return isLeft(fa) ? M.empty : f(fa.right);\n}; }; };\n/\n Right-associative fold of a structure.\n \n @example\n * import { pipe } from 'fp-ts/function'\n * import * as E from 'fp-ts/Either'\n \n const startWith = 'postfix'\n * const concat = (a: string, b: string) => `${a}:${b}`\n \n assert.deepStrictEqual(\n * pipe(E.right('a'), E.reduceRight(startWith, concat)),\n * 'a:postfix'\n * )\n \n assert.deepStrictEqual(\n * pipe(E.left('e'), E.reduceRight(startWith, concat)),\n * 'postfix'\n * )\n \n @category folding\n * @since 2.0.0\n /\nexport var reduceRight = function (b, f) { return function (fa) {\n return isLeft(fa) ? b : f(fa.right, b);\n}; };\n/\n @category instances\n * @since 2.7.0\n /\nexport var Foldable = {\n URI: URI,\n reduce: _reduce,\n foldMap: _foldMap,\n reduceRight: _reduceRight\n};\n/\n Map each element of a structure to an action, evaluate these actions from left to right, and collect the results.\n \n @example\n * import { pipe } from 'fp-ts/function'\n * import * as RA from 'fp-ts/ReadonlyArray'\n * import * as E from 'fp-ts/Either'\n * import * as O from 'fp-ts/Option'\n \n assert.deepStrictEqual(\n * pipe(E.right(['a']), E.traverse(O.Applicative)(RA.head)),\n * O.some(E.right('a'))\n * )\n \n assert.deepStrictEqual(\n * pipe(E.right([]), E.traverse(O.Applicative)(RA.head)),\n * O.none\n * )\n \n @category traversing\n * @since 2.6.3\n /\nexport var traverse = function (F) {\n return function (f) {\n return function (ta) {\n return isLeft(ta) ? F.of(left(ta.left)) : F.map(f(ta.right), right);\n };\n };\n};\n/\n Evaluate each monadic action in the structure from left to right, and collect the results.\n \n @example\n * import { pipe } from 'fp-ts/function'\n * import * as E from 'fp-ts/Either'\n * import * as O from 'fp-ts/Option'\n \n assert.deepStrictEqual(\n * pipe(E.right(O.some('a')), E.sequence(O.Applicative)),\n * O.some(E.right('a'))\n * )\n \n assert.deepStrictEqual(\n * pipe(E.right(O.none), E.sequence(O.Applicative)),\n * O.none\n * )\n \n @category traversing\n * @since 2.6.3\n /\nexport var sequence = function (F) {\n return function (ma) {\n return isLeft(ma) ? F.of(left(ma.left)) : F.map(ma.right, right);\n };\n};\n/\n @category instances\n * @since 2.7.0\n /\nexport var Traversable = {\n URI: URI,\n map: _map,\n reduce: _reduce,\n foldMap: _foldMap,\n reduceRight: _reduceRight,\n traverse: _traverse,\n sequence: sequence\n};\n/\n Map a pair of functions over the two type arguments of the bifunctor.\n \n @category mapping\n * @since 2.0.0\n /\nexport var bimap = function (f, g) { return function (fa) {\n return isLeft(fa) ? left(f(fa.left)) : right(g(fa.right));\n}; };\n/\n Map a function over the first type argument of a bifunctor.\n \n @category error handling\n * @since 2.0.0\n /\nexport var mapLeft = function (f) { return function (fa) {\n return isLeft(fa) ? left(f(fa.left)) : fa;\n}; };\n/\n @category instances\n * @since 2.7.0\n /\nexport var Bifunctor = {\n URI: URI,\n bimap: _bimap,\n mapLeft: _mapLeft\n};\n/\n Less strict version of [`alt`](#alt).\n \n The `W` suffix (short for Widening) means that the error and the return types will be merged.\n \n @category error handling\n * @since 2.9.0\n /\nexport var altW = function (that) { return function (fa) {\n return isLeft(fa) ? that() : fa;\n}; };\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 `Either` returns the left-most non-`Left` value (or the right-most `Left` value if both values are `Left`).\n \n \| x \| y \| pipe(x, alt(() => y) \|\n * \| -------- \| -------- \| -------------------- \|\n * \| left(a) \| left(b) \| left(b) \|\n * \| left(a) \| right(2) \| right(2) \|\n * \| right(1) \| left(b) \| right(1) \|\n * \| right(1) \| right(2) \| right(1) \|\n \n @example\n * import * as E from 'fp-ts/Either'\n * import { pipe } from 'fp-ts/function'\n \n assert.deepStrictEqual(\n * pipe(\n * E.left('a'),\n * E.alt(() => E.left('b'))\n * ),\n * E.left('b')\n * )\n * assert.deepStrictEqual(\n * pipe(\n * E.left('a'),\n * E.alt(() => E.right(2))\n * ),\n * E.right(2)\n * )\n * assert.deepStrictEqual(\n * pipe(\n * E.right(1),\n * E.alt(() => E.left('b'))\n * ),\n * E.right(1)\n * )\n * assert.deepStrictEqual(\n * pipe(\n * E.right(1),\n * E.alt(() => E.right(2))\n * ),\n * E.right(1)\n * )\n \n @category error handling\n * @since 2.0.0\n /\nexport var alt = altW;\n/\n @category instances\n * @since 2.7.0\n /\nexport var Alt = {\n URI: URI,\n map: _map,\n alt: _alt\n};\n/\n @since 2.0.0\n /\nexport var extend = function (f) { return function (wa) {\n return isLeft(wa) ? wa : right(f(wa));\n}; };\n/\n @category instances\n * @since 2.7.0\n /\nexport var Extend = {\n URI: URI,\n map: _map,\n extend: _extend\n};\n/\n @category instances\n * @since 2.7.0\n /\nexport var ChainRec = {\n URI: URI,\n map: _map,\n ap: _ap,\n chain: flatMap,\n chainRec: _chainRec\n};\n/\n @since 2.6.3\n /\nexport var throwError = left;\n/\n @category instances\n * @since 2.7.0\n /\nexport var MonadThrow = {\n URI: URI,\n map: _map,\n ap: _ap,\n of: of,\n chain: flatMap,\n throwError: throwError\n};\n/\n @category instances\n * @since 2.10.0\n /\nexport var FromEither = {\n URI: URI,\n fromEither: identity\n};\n/\n @example\n * import { fromPredicate, left, right } from 'fp-ts/Either'\n * import { pipe } from 'fp-ts/function'\n \n assert.deepStrictEqual(\n * pipe(\n * 1,\n * fromPredicate(\n * (n) => n > 0,\n * () => 'error'\n * )\n * ),\n * right(1)\n * )\n * assert.deepStrictEqual(\n * pipe(\n * -1,\n * fromPredicate(\n * (n) => n > 0,\n * () => 'error'\n * )\n * ),\n * left('error')\n * )\n \n @category lifting\n * @since 2.0.0\n /\nexport var fromPredicate = /#__PURE__/ fromPredicate_(FromEither);\n// -------------------------------------------------------------------------------------\n// conversions\n// -------------------------------------------------------------------------------------\n/\n @example\n * import * as E from 'fp-ts/Either'\n * import { pipe } from 'fp-ts/function'\n * import * as O from 'fp-ts/Option'\n \n assert.deepStrictEqual(\n * pipe(\n * O.some(1),\n * E.fromOption(() => 'error')\n * ),\n * E.right(1)\n * )\n * assert.deepStrictEqual(\n * pipe(\n * O.none,\n * E.fromOption(() => 'error')\n * ),\n * E.left('error')\n * )\n \n @category conversions\n * @since 2.0.0\n /\nexport var fromOption = \n/#__PURE__/ fromOption_(FromEither);\n// -------------------------------------------------------------------------------------\n// refinements\n// -------------------------------------------------------------------------------------\n/\n Returns `true` if the either is an instance of `Left`, `false` otherwise.\n \n @category refinements\n * @since 2.0.0\n /\nexport var isLeft = _.isLeft;\n/\n Returns `true` if the either is an instance of `Right`, `false` otherwise.\n \n @category refinements\n * @since 2.0.0\n /\nexport var isRight = _.isRight;\n/\n Less strict version of [`match`](#match).\n \n The `W` suffix (short for Widening) means that the handler return types will be merged.\n \n @category pattern matching\n * @since 2.10.0\n /\nexport var matchW = function (onLeft, onRight) {\n return function (ma) {\n return isLeft(ma) ? onLeft(ma.left) : onRight(ma.right);\n };\n};\n/\n Alias of [`matchW`](#matchw).\n \n @category pattern matching\n * @since 2.10.0\n /\nexport var foldW = matchW;\n/\n Takes two functions and an `Either` value, if the value is a `Left` the inner value is applied to the first function,\n * if the value is a `Right` the inner value is applied to the second function.\n \n @example\n * import { match, left, right } from 'fp-ts/Either'\n * import { pipe } from 'fp-ts/function'\n \n function onLeft(errors: Array<string>): string {\n * return `Errors: ${errors.join(', ')}`\n * }\n \n function onRight(value: number): string {\n * return `Ok: ${value}`\n * }\n \n assert.strictEqual(\n * pipe(\n * right(1),\n * match(onLeft, onRight)\n * ),\n * 'Ok: 1'\n * )\n * assert.strictEqual(\n * pipe(\n * left(['error 1', 'error 2']),\n * match(onLeft, onRight)\n * ),\n * 'Errors: error 1, error 2'\n * )\n \n @category pattern matching\n * @since 2.10.0\n /\nexport var match = matchW;\n/\n Alias of [`match`](#match).\n \n @category pattern matching\n * @since 2.0.0\n /\nexport var fold = match;\n/\n Less strict version of [`getOrElse`](#getorelse).\n \n The `W` suffix (short for Widening) means that the handler return type will be merged.\n \n @category error handling\n * @since 2.6.0\n /\nexport var getOrElseW = function (onLeft) {\n return function (ma) {\n return isLeft(ma) ? onLeft(ma.left) : ma.right;\n };\n};\n/\n Returns the wrapped value if it's a `Right` or a default value if is a `Left`.\n \n @example\n * import { getOrElse, left, right } from 'fp-ts/Either'\n * import { pipe } from 'fp-ts/function'\n \n assert.deepStrictEqual(\n * pipe(\n * right(1),\n * getOrElse(() => 0)\n * ),\n * 1\n * )\n * assert.deepStrictEqual(\n * pipe(\n * left('error'),\n * getOrElse(() => 0)\n * ),\n * 0\n * )\n \n @category error handling\n * @since 2.0.0\n /\nexport var getOrElse = getOrElseW;\n// -------------------------------------------------------------------------------------\n// combinators\n// -------------------------------------------------------------------------------------\n/\n @category mapping\n * @since 2.10.0\n /\nexport var flap = /#__PURE__/ flap_(Functor);\n/\n Combine two effectful actions, keeping only the result of the first.\n \n @since 2.0.0\n /\nexport var apFirst = /#__PURE__/ apFirst_(Apply);\n/\n Less strict version of [`apFirst`](#apfirst)\n \n The `W` suffix (short for Widening) means that the error types will be merged.\n \n @since 2.12.0\n /\nexport var apFirstW = apFirst;\n/\n Combine two effectful actions, keeping only the result of the second.\n \n @since 2.0.0\n /\nexport var apSecond = /#__PURE__/ apSecond_(Apply);\n/\n Less strict version of [`apSecond`](#apsecond)\n \n The `W` suffix (short for Widening) means that the error types will be merged.\n \n @since 2.12.0\n /\nexport var apSecondW = apSecond;\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 /\nexport var tap = /#__PURE__/ dual(2, chainable.tap(Chain));\n/\n Less strict version of [`flatten`](#flatten).\n \n The `W` suffix (short for Widening) means that the error types will be merged.\n \n @category sequencing\n * @since 2.11.0\n /\nexport var flattenW = \n/#__PURE__/ flatMap(identity);\n/\n The `flatten` function is the conventional monad join operator. It is used to remove one level of monadic structure, projecting its bound argument into the outer level.\n \n @example\n * import * as E from 'fp-ts/Either'\n \n assert.deepStrictEqual(E.flatten(E.right(E.right('a'))), E.right('a'))\n * assert.deepStrictEqual(E.flatten(E.right(E.left('e'))), E.left('e'))\n * assert.deepStrictEqual(E.flatten(E.left('e')), E.left('e'))\n \n @category sequencing\n * @since 2.0.0\n /\nexport var flatten = flattenW;\n/\n @since 2.0.0\n /\nexport var duplicate = /#__PURE__/ extend(identity);\n/\n Use `liftOption`.\n \n @category legacy\n * @since 2.10.0\n /\nexport var fromOptionK = \n/#__PURE__/ fromOptionK_(FromEither);\n/\n Use `flatMapOption`.\n \n @category legacy\n * @since 2.11.0\n /\nexport var chainOptionK = /#__PURE__/ chainOptionK_(FromEither, Chain);\n/\n Use `flatMapOption`.\n \n @category legacy\n * @since 2.13.2\n /\nexport var chainOptionKW = /#__PURE__/ chainOptionK;\n/* @internal /\nvar _FromEither = {\n fromEither: FromEither.fromEither\n};\n/\n @category lifting\n * @since 2.15.0\n /\nexport var liftNullable = /#__PURE__/ _.liftNullable(_FromEither);\n/\n @category lifting\n * @since 2.15.0\n /\nexport var liftOption = /#__PURE__/ _.liftOption(_FromEither);\n/* @internal /\nvar _FlatMap = {\n flatMap: flatMap\n};\n/\n @category sequencing\n * @since 2.15.0\n /\nexport var flatMapNullable = /#__PURE__/ _.flatMapNullable(_FromEither, _FlatMap);\n/\n @category sequencing\n * @since 2.15.0\n /\nexport var flatMapOption = /#__PURE__/ _.flatMapOption(_FromEither, _FlatMap);\n/\n @example\n * import * as E from 'fp-ts/Either'\n * import { pipe } from 'fp-ts/function'\n \n assert.deepStrictEqual(\n * pipe(\n * E.right(1),\n * E.filterOrElse(\n * (n) => n > 0,\n * () => 'error'\n * )\n * ),\n * E.right(1)\n * )\n * assert.deepStrictEqual(\n * pipe(\n * E.right(-1),\n * E.filterOrElse(\n * (n) => n > 0,\n * () => 'error'\n * )\n * ),\n * E.left('error')\n * )\n * assert.deepStrictEqual(\n * pipe(\n * E.left('a'),\n * E.filterOrElse(\n * (n) => n > 0,\n * () => 'error'\n * )\n * ),\n * E.left('a')\n * )\n \n @category filtering\n * @since 2.0.0\n /\nexport var filterOrElse = /#__PURE__/ filterOrElse_(FromEither, Chain);\n/\n Less strict version of [`filterOrElse`](#filterorelse).\n \n The `W` suffix (short for Widening) means that the error types will be merged.\n \n @category filtering\n * @since 2.9.0\n /\nexport var filterOrElseW = filterOrElse;\n/\n Returns a `Right` if is a `Left` (and vice versa).\n \n @since 2.0.0\n /\nexport var swap = function (ma) { return (isLeft(ma) ? right(ma.left) : left(ma.right)); };\n/\n Less strict version of [`orElse`](#orelse).\n \n The `W` suffix (short for Widening) means that the return types will be merged.\n \n @category error handling\n * @since 2.10.0\n /\nexport var orElseW = function (onLeft) {\n return function (ma) {\n return isLeft(ma) ? onLeft(ma.left) : ma;\n };\n};\n/\n Useful for recovering from errors.\n \n @category error handling\n * @since 2.0.0\n /\nexport var orElse = orElseW;\n/\n Takes a default and a nullable value, if the value is not nully, turn it into a `Right`, if the value is nully use\n * the provided default as a `Left`.\n \n @example\n * import { fromNullable, left, right } from 'fp-ts/Either'\n \n const parse = fromNullable('nully')\n \n assert.deepStrictEqual(parse(1), right(1))\n * assert.deepStrictEqual(parse(null), left('nully'))\n \n @category conversions\n * @since 2.0.0\n /\nexport var fromNullable = function (e) {\n return function (a) {\n return a == null ? left(e) : right(a);\n };\n};\n/\n Constructs a new `Either` from a function that might throw.\n \n See also [`tryCatchK`](#trycatchk).\n \n @example\n * import * as E from 'fp-ts/Either'\n \n const unsafeHead = <A>(as: ReadonlyArray<A>): A => {\n * if (as.length > 0) {\n * return as[0]\n * } else {\n * throw new Error('empty array')\n * }\n * }\n \n const head = <A>(as: ReadonlyArray<A>): E.Either<Error, A> =>\n * E.tryCatch(() => unsafeHead(as), e => (e instanceof Error ? e : new Error('unknown error')))\n \n assert.deepStrictEqual(head([]), E.left(new Error('empty array')))\n * assert.deepStrictEqual(head([1, 2, 3]), E.right(1))\n \n @category interop\n * @since 2.0.0\n /\nexport var tryCatch = function (f, onThrow) {\n try {\n return right(f());\n }\n catch (e) {\n return left(onThrow(e));\n }\n};\n/\n Converts a function that may throw to one returning a `Either`.\n \n @category interop\n * @since 2.10.0\n /\nexport var tryCatchK = function (f, onThrow) {\n return function () {\n var a = [];\n for (var _i = 0; _i < arguments.length; _i++) {\n a[_i] = arguments[_i];\n }\n return tryCatch(function () { return f.apply(void 0, a); }, onThrow);\n };\n};\n/\n Use `liftNullable`.\n \n @category legacy\n * @since 2.9.0\n /\nexport var fromNullableK = function (e) {\n var from = fromNullable(e);\n return function (f) { return flow(f, from); };\n};\n/\n Use `flatMapNullable`.\n \n @category legacy\n * @since 2.9.0\n /\nexport var chainNullableK = function (e) {\n var from = fromNullableK(e);\n return function (f) { return flatMap(from(f)); };\n};\n/\n @category conversions\n * @since 2.10.0\n /\nexport var toUnion = /#__PURE__/ foldW(identity, identity);\n// -------------------------------------------------------------------------------------\n// utils\n// -------------------------------------------------------------------------------------\n/\n Default value for the `onError` argument of `tryCatch`\n \n @since 2.0.0\n /\nexport function toError(e) {\n return e instanceof Error ? e : new Error(String(e));\n}\nexport function 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 isLeft(ma) ? false : E.equals(a, ma.right);\n };\n}\n/\n Returns `false` if `Left` or returns the result of the application of the given predicate to the `Right` value.\n \n @example\n * import { exists, left, right } from 'fp-ts/Either'\n \n const gt2 = exists((n: number) => n > 2)\n \n assert.strictEqual(gt2(left('a')), false)\n * assert.strictEqual(gt2(right(1)), false)\n * assert.strictEqual(gt2(right(3)), true)\n \n @since 2.0.0\n /\nexport var exists = function (predicate) {\n return function (ma) {\n return isLeft(ma) ? false : predicate(ma.right);\n };\n};\n// -------------------------------------------------------------------------------------\n// do notation\n// -------------------------------------------------------------------------------------\n/\n @category do notation\n * @since 2.9.0\n /\nexport var Do = /#__PURE__/ of(_.emptyRecord);\n/\n @category do notation\n * @since 2.8.0\n /\nexport var bindTo = /#__PURE__/ bindTo_(Functor);\nvar let_ = /#__PURE__/ let__(Functor);\nexport { \n/\n @category do notation\n * @since 2.13.0\n /\nlet_ as let };\n/\n @category do notation\n * @since 2.8.0\n /\nexport var bind = /#__PURE__/ chainable.bind(Chain);\n/\n The `W` suffix (short for Widening) means that the error types will be merged.\n \n @category do notation\n * @since 2.8.0\n /\nexport var bindW = bind;\n/\n @category do notation\n * @since 2.8.0\n /\nexport var apS = /#__PURE__/ apS_(Apply);\n/\n Less strict version of [`apS`](#aps).\n \n The `W` suffix (short for Widening) means that the error types will be merged.\n \n @category do notation\n * @since 2.8.0\n /\nexport var apSW = apS;\n/\n @since 2.11.0\n /\nexport var ApT = /#__PURE__/ of(_.emptyReadonlyArray);\n// -------------------------------------------------------------------------------------\n// array utils\n// -------------------------------------------------------------------------------------\n/\n Equivalent to `ReadonlyNonEmptyArray#traverseWithIndex(Applicative)`.\n \n @category traversing\n * @since 2.11.0\n /\nexport var traverseReadonlyNonEmptyArrayWithIndex = function (f) {\n return function (as) {\n var e = f(0, _.head(as));\n if (isLeft(e)) {\n return e;\n }\n var out = [e.right];\n for (var i = 1; i < as.length; i++) {\n var e_1 = f(i, as[i]);\n if (isLeft(e_1)) {\n return e_1;\n }\n out.push(e_1.right);\n }\n return right(out);\n };\n};\n/\n Equivalent to `ReadonlyArray#traverseWithIndex(Applicative)`.\n \n @category traversing\n * @since 2.11.0\n /\nexport var traverseReadonlyArrayWithIndex = function (f) {\n var g = traverseReadonlyNonEmptyArrayWithIndex(f);\n return function (as) { return (_.isNonEmpty(as) ? g(as) : ApT); };\n};\n/\n Equivalent to `ReadonlyArray#traverseWithIndex(Applicative)`.\n \n @category traversing\n * @since 2.9.0\n /\nexport var traverseArrayWithIndex = traverseReadonlyArrayWithIndex;\n/\n Equivalent to `ReadonlyArray#traverse(Applicative)`.\n \n @category traversing\n * @since 2.9.0\n /\nexport var traverseArray = function (f) { return traverseReadonlyArrayWithIndex(function (_, a) { return f(a); }); };\n/\n Equivalent to `ReadonlyArray#sequence(Applicative)`.\n \n @category traversing\n * @since 2.9.0\n /\nexport var sequenceArray = \n/#__PURE__/ traverseArray(identity);\n// -------------------------------------------------------------------------------------\n// legacy\n// -------------------------------------------------------------------------------------\n/\n Alias of `flatMap`.\n \n @category legacy\n * @since 2.6.0\n /\nexport var chainW = flatMap;\n/\n Alias of `flatMap`.\n \n @category legacy\n * @since 2.0.0\n /\nexport var chain = flatMap;\n/\n Alias of `tap`.\n \n @category legacy\n * @since 2.0.0\n /\nexport var chainFirst = tap;\n/\n Alias of `tap`.\n \n @category legacy\n * @since 2.8.0\n /\nexport var chainFirstW = tap;\n/\n Use [`parse`](./Json.ts.html#parse) instead.\n \n @category zone of death\n * @since 2.0.0\n * @deprecated\n /\nexport function parseJSON(s, onError) {\n return tryCatch(function () { return JSON.parse(s); }, onError);\n}\n/\n Use [`stringify`](./Json.ts.html#stringify) instead.\n \n @category zone of death\n * @since 2.0.0\n * @deprecated\n /\nexport var stringifyJSON = function (u, onError) {\n return tryCatch(function () {\n var s = JSON.stringify(u);\n if (typeof s !== 'string') {\n throw new Error('Converting unsupported structure to JSON');\n }\n return s;\n }, onError);\n};\n/\n This instance is deprecated, use small, specific instances instead.\n * For example if a function needs a `Functor` instance, pass `E.Functor` instead of `E.either`\n * (where `E` is from `import E from 'fp-ts/Either'`)\n \n @category zone of death\n * @since 2.0.0\n * @deprecated\n /\nexport var either = {\n URI: URI,\n map: _map,\n of: of,\n ap: _ap,\n chain: flatMap,\n reduce: _reduce,\n foldMap: _foldMap,\n reduceRight: _reduceRight,\n traverse: _traverse,\n sequence: sequence,\n bimap: _bimap,\n mapLeft: _mapLeft,\n alt: _alt,\n extend: _extend,\n chainRec: _chainRec,\n throwError: throwError\n};\n/\n Use [`getApplySemigroup`](./Apply.ts.html#getapplysemigroup) instead.\n \n Semigroup returning the left-most `Left` value. If both operands are `Right`s then the inner values\n * are concatenated using the provided `Semigroup`\n \n @category zone of death\n * @since 2.0.0\n * @deprecated\n /\nexport var getApplySemigroup = \n/#__PURE__/ getApplySemigroup_(Apply);\n/\n Use [`getApplicativeMonoid`](./Applicative.ts.html#getapplicativemonoid) instead.\n \n @category zone of death\n * @since 2.0.0\n * @deprecated\n /\nexport var getApplyMonoid = \n/#__PURE__/ getApplicativeMonoid(Applicative);\n/\n Use [`getApplySemigroup`](./Apply.ts.html#getapplysemigroup) instead.\n \n @category zone of death\n * @since 2.0.0\n * @deprecated\n /\nexport var getValidationSemigroup = function (SE, SA) {\n return getApplySemigroup_(getApplicativeValidation(SE))(SA);\n};\n/\n Use [`getApplicativeMonoid`](./Applicative.ts.html#getapplicativemonoid) instead.\n \n @category zone of death\n * @since 2.0.0\n * @deprecated\n /\nexport var getValidationMonoid = function (SE, MA) {\n return getApplicativeMonoid(getApplicativeValidation(SE))(MA);\n};\n/\n Use [`getApplicativeValidation`](#getapplicativevalidation) and [`getAltValidation`](#getaltvalidation) instead.\n \n @category zone of death\n * @since 2.0.0\n * @deprecated\n */\nexport function getValidation(SE) {\n var ap = getApplicativeValidation(SE).ap;\n var alt = getAltValidation(SE).alt;\n return {\n URI: URI,\n _E: undefined,\n map: _map,\n of: of,\n chain: flatMap,\n bimap: _bimap,\n mapLeft: _mapLeft,\n reduce: _reduce,\n foldMap: _foldMap,\n reduceRight: _reduceRight,\n extend: _extend,\n traverse: _traverse,\n sequence: sequence,\n chainRec: _chainRec,\n throwError: throwError,\n ap: ap,\n alt: alt\n };\n}\n"],"names":["_.isLeft"],"mappings":";AAswBU,IAAC,SAASA;AAgBV,IAAC,SAAS,SAAU,QAAQ,SAAS;AAC3C,SAAO,SAAU,IAAI;AACjB,WAAO,OAAO,EAAE,IAAI,OAAO,GAAG,IAAI,IAAI,QAAQ,GAAG,KAAK;AAAA,EAC9D;AACA;AAOU,IAAC,QAAQ;AAmCT,IAAC,QAAQ;AAOT,IAAC,OAAO;","x_google_ignoreList":[0]}

package/dist/_node_modules/fp-ts/es6/function.cjs CHANGED Viewed

@@ -1,6 +1,6 @@
 "use strict";
 Object.defineProperty(exports, Symbol.toStringTag, { value: "Module" });
-var __spreadArray = globalThis && globalThis.__spreadArray || function(to, from, pack) {
+globalThis && globalThis.__spreadArray || function(to, from, pack) {
   if (pack || arguments.length === 2)
     for (var i = 0, l = from.length, ar; i < l; i++) {
       if (ar || !(i in from)) {
@@ -11,196 +11,6 @@ var __spreadArray = globalThis && globalThis.__spreadArray || function(to, from,
     }
   return to.concat(ar || Array.prototype.slice.call(from));
 };
-var getBooleanAlgebra = function(B) {
-  return function() {
-    return {
-      meet: function(x, y) {
-        return function(a) {
-          return B.meet(x(a), y(a));
-        };
-      },
-      join: function(x, y) {
-        return function(a) {
-          return B.join(x(a), y(a));
-        };
-      },
-      zero: function() {
-        return B.zero;
-      },
-      one: function() {
-        return B.one;
-      },
-      implies: function(x, y) {
-        return function(a) {
-          return B.implies(x(a), y(a));
-        };
-      },
-      not: function(x) {
-        return function(a) {
-          return B.not(x(a));
-        };
-      }
-    };
-  };
-};
-var getSemigroup = function(S) {
-  return function() {
-    return {
-      concat: function(f, g) {
-        return function(a) {
-          return S.concat(f(a), g(a));
-        };
-      }
-    };
-  };
-};
-var getMonoid = function(M) {
-  var getSemigroupM = getSemigroup(M);
-  return function() {
-    return {
-      concat: getSemigroupM().concat,
-      empty: function() {
-        return M.empty;
-      }
-    };
-  };
-};
-var getSemiring = function(S) {
-  return {
-    add: function(f, g) {
-      return function(x) {
-        return S.add(f(x), g(x));
-      };
-    },
-    zero: function() {
-      return S.zero;
-    },
-    mul: function(f, g) {
-      return function(x) {
-        return S.mul(f(x), g(x));
-      };
-    },
-    one: function() {
-      return S.one;
-    }
-  };
-};
-var getRing = function(R) {
-  var S = getSemiring(R);
-  return {
-    add: S.add,
-    mul: S.mul,
-    one: S.one,
-    zero: S.zero,
-    sub: function(f, g) {
-      return function(x) {
-        return R.sub(f(x), g(x));
-      };
-    }
-  };
-};
-var apply = function(a) {
-  return function(f) {
-    return f(a);
-  };
-};
-function identity(a) {
-  return a;
-}
-var unsafeCoerce = identity;
-function constant(a) {
-  return function() {
-    return a;
-  };
-}
-var constTrue = /* @__PURE__ */ constant(true);
-var constFalse = /* @__PURE__ */ constant(false);
-var constNull = /* @__PURE__ */ constant(null);
-var constUndefined = /* @__PURE__ */ constant(void 0);
-var constVoid = constUndefined;
-function flip(f) {
-  return function() {
-    var args = [];
-    for (var _i = 0; _i < arguments.length; _i++) {
-      args[_i] = arguments[_i];
-    }
-    if (args.length > 1) {
-      return f(args[1], args[0]);
-    }
-    return function(a) {
-      return f(a)(args[0]);
-    };
-  };
-}
-function flow(ab, bc, cd, de, ef, fg, gh, hi, ij) {
-  switch (arguments.length) {
-    case 1:
-      return ab;
-    case 2:
-      return function() {
-        return bc(ab.apply(this, arguments));
-      };
-    case 3:
-      return function() {
-        return cd(bc(ab.apply(this, arguments)));
-      };
-    case 4:
-      return function() {
-        return de(cd(bc(ab.apply(this, arguments))));
-      };
-    case 5:
-      return function() {
-        return ef(de(cd(bc(ab.apply(this, arguments)))));
-      };
-    case 6:
-      return function() {
-        return fg(ef(de(cd(bc(ab.apply(this, arguments))))));
-      };
-    case 7:
-      return function() {
-        return gh(fg(ef(de(cd(bc(ab.apply(this, arguments)))))));
-      };
-    case 8:
-      return function() {
-        return hi(gh(fg(ef(de(cd(bc(ab.apply(this, arguments))))))));
-      };
-    case 9:
-      return function() {
-        return ij(hi(gh(fg(ef(de(cd(bc(ab.apply(this, arguments)))))))));
-      };
-  }
-  return;
-}
-function tuple() {
-  var t = [];
-  for (var _i = 0; _i < arguments.length; _i++) {
-    t[_i] = arguments[_i];
-  }
-  return t;
-}
-function increment(n) {
-  return n + 1;
-}
-function decrement(n) {
-  return n - 1;
-}
-function absurd(_) {
-  throw new Error("Called `absurd` function which should be uncallable");
-}
-function tupled(f) {
-  return function(a) {
-    return f.apply(void 0, a);
-  };
-}
-function untupled(f) {
-  return function() {
-    var a = [];
-    for (var _i = 0; _i < arguments.length; _i++) {
-      a[_i] = arguments[_i];
-    }
-    return f(a);
-  };
-}
 function pipe(a, ab, bc, cd, de, ef, fg, gh, hi) {
   switch (arguments.length) {
     case 1:
@@ -230,63 +40,5 @@ function pipe(a, ab, bc, cd, de, ef, fg, gh, hi) {
     }
   }
 }
-var hole = absurd;
-var SK = function(_, b) {
-  return b;
-};
-function not(predicate) {
-  return function(a) {
-    return !predicate(a);
-  };
-}
-var getEndomorphismMonoid = function() {
-  return {
-    concat: function(first, second) {
-      return flow(first, second);
-    },
-    empty: identity
-  };
-};
-var dual = function(arity, body) {
-  var isDataFirst = typeof arity === "number" ? function(args) {
-    return args.length >= arity;
-  } : arity;
-  return function() {
-    var args = Array.from(arguments);
-    if (isDataFirst(arguments)) {
-      return body.apply(this, args);
-    }
-    return function(self) {
-      return body.apply(void 0, __spreadArray([self], args, false));
-    };
-  };
-};
-exports.SK = SK;
-exports.absurd = absurd;
-exports.apply = apply;
-exports.constFalse = constFalse;
-exports.constNull = constNull;
-exports.constTrue = constTrue;
-exports.constUndefined = constUndefined;
-exports.constVoid = constVoid;
-exports.constant = constant;
-exports.decrement = decrement;
-exports.dual = dual;
-exports.flip = flip;
-exports.flow = flow;
-exports.getBooleanAlgebra = getBooleanAlgebra;
-exports.getEndomorphismMonoid = getEndomorphismMonoid;
-exports.getMonoid = getMonoid;
-exports.getRing = getRing;
-exports.getSemigroup = getSemigroup;
-exports.getSemiring = getSemiring;
-exports.hole = hole;
-exports.identity = identity;
-exports.increment = increment;
-exports.not = not;
 exports.pipe = pipe;
-exports.tuple = tuple;
-exports.tupled = tupled;
-exports.unsafeCoerce = unsafeCoerce;
-exports.untupled = untupled;
 //# sourceMappingURL=function.cjs.map

package/dist/_node_modules/fp-ts/es6/function.cjs.map CHANGED Viewed

	@@ -1 +1 @@
1	- {"version":3,"file":"function.cjs","sources":["../../../../../../node_modules/fp-ts/es6/function.js"],"sourcesContent":["var __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};\n// -------------------------------------------------------------------------------------\n// instances\n// -------------------------------------------------------------------------------------\n/*\n @category instances\n * @since 2.10.0\n /\nexport var getBooleanAlgebra = function (B) {\n return function () { return ({\n meet: function (x, y) { return function (a) { return B.meet(x(a), y(a)); }; },\n join: function (x, y) { return function (a) { return B.join(x(a), y(a)); }; },\n zero: function () { return B.zero; },\n one: function () { return B.one; },\n implies: function (x, y) { return function (a) { return B.implies(x(a), y(a)); }; },\n not: function (x) { return function (a) { return B.not(x(a)); }; }\n }); };\n};\n/\n Unary functions form a semigroup as long as you can provide a semigroup for the codomain.\n \n @example\n * import { Predicate, getSemigroup } from 'fp-ts/function'\n * import * as B from 'fp-ts/boolean'\n \n const f: Predicate<number> = (n) => n <= 2\n * const g: Predicate<number> = (n) => n >= 0\n \n const S1 = getSemigroup(B.SemigroupAll)<number>()\n \n assert.deepStrictEqual(S1.concat(f, g)(1), true)\n * assert.deepStrictEqual(S1.concat(f, g)(3), false)\n \n const S2 = getSemigroup(B.SemigroupAny)<number>()\n \n assert.deepStrictEqual(S2.concat(f, g)(1), true)\n * assert.deepStrictEqual(S2.concat(f, g)(3), true)\n \n @category instances\n * @since 2.10.0\n /\nexport var getSemigroup = function (S) {\n return function () { return ({\n concat: function (f, g) { return function (a) { return S.concat(f(a), g(a)); }; }\n }); };\n};\n/\n Unary functions form a monoid as long as you can provide a monoid for the codomain.\n \n @example\n * import { Predicate } from 'fp-ts/Predicate'\n * import { getMonoid } from 'fp-ts/function'\n * import * as B from 'fp-ts/boolean'\n \n const f: Predicate<number> = (n) => n <= 2\n * const g: Predicate<number> = (n) => n >= 0\n \n const M1 = getMonoid(B.MonoidAll)<number>()\n \n assert.deepStrictEqual(M1.concat(f, g)(1), true)\n * assert.deepStrictEqual(M1.concat(f, g)(3), false)\n \n const M2 = getMonoid(B.MonoidAny)<number>()\n \n assert.deepStrictEqual(M2.concat(f, g)(1), true)\n * assert.deepStrictEqual(M2.concat(f, g)(3), true)\n \n @category instances\n * @since 2.10.0\n /\nexport var getMonoid = function (M) {\n var getSemigroupM = getSemigroup(M);\n return function () { return ({\n concat: getSemigroupM().concat,\n empty: function () { return M.empty; }\n }); };\n};\n/\n @category instances\n * @since 2.10.0\n /\nexport var getSemiring = function (S) { return ({\n add: function (f, g) { return function (x) { return S.add(f(x), g(x)); }; },\n zero: function () { return S.zero; },\n mul: function (f, g) { return function (x) { return S.mul(f(x), g(x)); }; },\n one: function () { return S.one; }\n}); };\n/\n @category instances\n * @since 2.10.0\n /\nexport var getRing = function (R) {\n var S = getSemiring(R);\n return {\n add: S.add,\n mul: S.mul,\n one: S.one,\n zero: S.zero,\n sub: function (f, g) { return function (x) { return R.sub(f(x), g(x)); }; }\n };\n};\n// -------------------------------------------------------------------------------------\n// utils\n// -------------------------------------------------------------------------------------\n/\n @since 2.11.0\n /\nexport var apply = function (a) {\n return function (f) {\n return f(a);\n };\n};\n/\n @since 2.0.0\n /\nexport function identity(a) {\n return a;\n}\n/\n @since 2.0.0\n /\nexport var unsafeCoerce = identity;\n/\n @since 2.0.0\n /\nexport function constant(a) {\n return function () { return a; };\n}\n/\n A thunk that returns always `true`.\n \n @since 2.0.0\n /\nexport var constTrue = /#__PURE__/ constant(true);\n/\n A thunk that returns always `false`.\n \n @since 2.0.0\n /\nexport var constFalse = /#__PURE__/ constant(false);\n/\n A thunk that returns always `null`.\n \n @since 2.0.0\n /\nexport var constNull = /#__PURE__/ constant(null);\n/\n A thunk that returns always `undefined`.\n \n @since 2.0.0\n /\nexport var constUndefined = /#__PURE__/ constant(undefined);\n/\n A thunk that returns always `void`.\n \n @since 2.0.0\n /\nexport var constVoid = constUndefined;\nexport function flip(f) {\n return function () {\n var args = [];\n for (var _i = 0; _i < arguments.length; _i++) {\n args[_i] = arguments[_i];\n }\n if (args.length > 1) {\n return f(args[1], args[0]);\n }\n return function (a) { return f(a)(args[0]); };\n };\n}\nexport function flow(ab, bc, cd, de, ef, fg, gh, hi, ij) {\n switch (arguments.length) {\n case 1:\n return ab;\n case 2:\n return function () {\n return bc(ab.apply(this, arguments));\n };\n case 3:\n return function () {\n return cd(bc(ab.apply(this, arguments)));\n };\n case 4:\n return function () {\n return de(cd(bc(ab.apply(this, arguments))));\n };\n case 5:\n return function () {\n return ef(de(cd(bc(ab.apply(this, arguments)))));\n };\n case 6:\n return function () {\n return fg(ef(de(cd(bc(ab.apply(this, arguments))))));\n };\n case 7:\n return function () {\n return gh(fg(ef(de(cd(bc(ab.apply(this, arguments)))))));\n };\n case 8:\n return function () {\n return hi(gh(fg(ef(de(cd(bc(ab.apply(this, arguments))))))));\n };\n case 9:\n return function () {\n return ij(hi(gh(fg(ef(de(cd(bc(ab.apply(this, arguments)))))))));\n };\n }\n return;\n}\n/\n @since 2.0.0\n /\nexport function tuple() {\n var t = [];\n for (var _i = 0; _i < arguments.length; _i++) {\n t[_i] = arguments[_i];\n }\n return t;\n}\n/\n @since 2.0.0\n /\nexport function increment(n) {\n return n + 1;\n}\n/\n @since 2.0.0\n /\nexport function decrement(n) {\n return n - 1;\n}\n/\n @since 2.0.0\n /\nexport function absurd(_) {\n throw new Error('Called `absurd` function which should be uncallable');\n}\n/\n Creates a tupled version of this function: instead of `n` arguments, it accepts a single tuple argument.\n \n @example\n * import { tupled } from 'fp-ts/function'\n \n const add = tupled((x: number, y: number): number => x + y)\n \n assert.strictEqual(add([1, 2]), 3)\n \n @since 2.4.0\n /\nexport function tupled(f) {\n return function (a) { return f.apply(void 0, a); };\n}\n/\n Inverse function of `tupled`\n \n @since 2.4.0\n /\nexport function untupled(f) {\n return function () {\n var a = [];\n for (var _i = 0; _i < arguments.length; _i++) {\n a[_i] = arguments[_i];\n }\n return f(a);\n };\n}\nexport function pipe(a, ab, bc, cd, de, ef, fg, gh, hi) {\n switch (arguments.length) {\n case 1:\n return a;\n case 2:\n return ab(a);\n case 3:\n return bc(ab(a));\n case 4:\n return cd(bc(ab(a)));\n case 5:\n return de(cd(bc(ab(a))));\n case 6:\n return ef(de(cd(bc(ab(a)))));\n case 7:\n return fg(ef(de(cd(bc(ab(a))))));\n case 8:\n return gh(fg(ef(de(cd(bc(ab(a)))))));\n case 9:\n return hi(gh(fg(ef(de(cd(bc(ab(a))))))));\n default: {\n var ret = arguments[0];\n for (var i = 1; i < arguments.length; i++) {\n ret = arguments[i](ret);\n }\n return ret;\n }\n }\n}\n/\n Type hole simulation\n \n @since 2.7.0\n /\nexport var hole = absurd;\n/\n @since 2.11.0\n /\nexport var SK = function (_, b) { return b; };\n/\n Use `Predicate` module instead.\n \n @category zone of death\n * @since 2.0.0\n * @deprecated\n /\nexport function not(predicate) {\n return function (a) { return !predicate(a); };\n}\n/\n Use `Endomorphism` module instead.\n \n @category zone of death\n * @since 2.10.0\n * @deprecated\n /\nexport var getEndomorphismMonoid = function () { return ({\n concat: function (first, second) { return flow(first, second); },\n empty: identity\n}); };\n/* @internal */\nexport var dual = function (arity, body) {\n var isDataFirst = typeof arity === 'number' ? function (args) { return args.length >= arity; } : arity;\n return function () {\n var args = Array.from(arguments);\n if (isDataFirst(arguments)) {\n return body.apply(this, args);\n }\n return function (self) { return body.apply(void 0, __spreadArray([self], args, false)); };\n };\n};\n"],"names":["this"],"mappings":";;AAAA,IAAI,gBAAiBA,cAAQA,WAAK,iBAAkB,SAAU,IAAI,MAAM,MAAM;AAC1E,MAAI,QAAQ,UAAU,WAAW;AAAG,aAAS,IAAI,GAAG,IAAI,KAAK,QAAQ,IAAI,IAAI,GAAG,KAAK;AACjF,UAAI,MAAM,EAAE,KAAK,OAAO;AACpB,YAAI,CAAC;AAAI,eAAK,MAAM,UAAU,MAAM,KAAK,MAAM,GAAG,CAAC;AACnD,WAAG,CAAC,IAAI,KAAK,CAAC;AAAA,MACjB;AAAA,IACJ;AACD,SAAO,GAAG,OAAO,MAAM,MAAM,UAAU,MAAM,KAAK,IAAI,CAAC;AAC3D;AAQU,IAAC,oBAAoB,SAAU,GAAG;AACxC,SAAO,WAAY;AAAE,WAAQ;AAAA,MACzB,MAAM,SAAU,GAAG,GAAG;AAAE,eAAO,SAAU,GAAG;AAAE,iBAAO,EAAE,KAAK,EAAE,CAAC,GAAG,EAAE,CAAC,CAAC;AAAA,QAAE;AAAA,MAAK;AAAA,MAC7E,MAAM,SAAU,GAAG,GAAG;AAAE,eAAO,SAAU,GAAG;AAAE,iBAAO,EAAE,KAAK,EAAE,CAAC,GAAG,EAAE,CAAC,CAAC;AAAA,QAAE;AAAA,MAAK;AAAA,MAC7E,MAAM,WAAY;AAAE,eAAO,EAAE;AAAA,MAAO;AAAA,MACpC,KAAK,WAAY;AAAE,eAAO,EAAE;AAAA,MAAM;AAAA,MAClC,SAAS,SAAU,GAAG,GAAG;AAAE,eAAO,SAAU,GAAG;AAAE,iBAAO,EAAE,QAAQ,EAAE,CAAC,GAAG,EAAE,CAAC,CAAC;AAAA,QAAE;AAAA,MAAK;AAAA,MACnF,KAAK,SAAU,GAAG;AAAE,eAAO,SAAU,GAAG;AAAE,iBAAO,EAAE,IAAI,EAAE,CAAC,CAAC;AAAA,QAAI;AAAA,MAAG;AAAA,IACrE;AAAA;AACL;AAwBU,IAAC,eAAe,SAAU,GAAG;AACnC,SAAO,WAAY;AAAE,WAAQ;AAAA,MACzB,QAAQ,SAAU,GAAG,GAAG;AAAE,eAAO,SAAU,GAAG;AAAE,iBAAO,EAAE,OAAO,EAAE,CAAC,GAAG,EAAE,CAAC,CAAC;AAAA,QAAE;AAAA,MAAK;AAAA,IACpF;AAAA;AACL;AAyBU,IAAC,YAAY,SAAU,GAAG;AAChC,MAAI,gBAAgB,aAAa,CAAC;AAClC,SAAO,WAAY;AAAE,WAAQ;AAAA,MACzB,QAAQ,cAAa,EAAG;AAAA,MACxB,OAAO,WAAY;AAAE,eAAO,EAAE;AAAA,MAAQ;AAAA,IACzC;AAAA;AACL;AAKU,IAAC,cAAc,SAAU,GAAG;AAAE,SAAQ;AAAA,IAC5C,KAAK,SAAU,GAAG,GAAG;AAAE,aAAO,SAAU,GAAG;AAAE,eAAO,EAAE,IAAI,EAAE,CAAC,GAAG,EAAE,CAAC,CAAC;AAAA,MAAE;AAAA,IAAK;AAAA,IAC3E,MAAM,WAAY;AAAE,aAAO,EAAE;AAAA,IAAO;AAAA,IACpC,KAAK,SAAU,GAAG,GAAG;AAAE,aAAO,SAAU,GAAG;AAAE,eAAO,EAAE,IAAI,EAAE,CAAC,GAAG,EAAE,CAAC,CAAC;AAAA,MAAE;AAAA,IAAK;AAAA,IAC3E,KAAK,WAAY;AAAE,aAAO,EAAE;AAAA,IAAM;AAAA,EACtC;AAAM;AAKI,IAAC,UAAU,SAAU,GAAG;AAC9B,MAAI,IAAI,YAAY,CAAC;AACrB,SAAO;AAAA,IACH,KAAK,EAAE;AAAA,IACP,KAAK,EAAE;AAAA,IACP,KAAK,EAAE;AAAA,IACP,MAAM,EAAE;AAAA,IACR,KAAK,SAAU,GAAG,GAAG;AAAE,aAAO,SAAU,GAAG;AAAE,eAAO,EAAE,IAAI,EAAE,CAAC,GAAG,EAAE,CAAC,CAAC;AAAA,MAAE;AAAA,IAAK;AAAA,EACnF;AACA;AAOU,IAAC,QAAQ,SAAU,GAAG;AAC5B,SAAO,SAAU,GAAG;AAChB,WAAO,EAAE,CAAC;AAAA,EAClB;AACA;AAIO,SAAS,SAAS,GAAG;AACxB,SAAO;AACX;AAIU,IAAC,eAAe;AAInB,SAAS,SAAS,GAAG;AACxB,SAAO,WAAY;AAAE,WAAO;AAAA;AAChC;AAMU,IAAC,YAA0B,yBAAS,IAAI;AAMxC,IAAC,aAA2B,yBAAS,KAAK;AAM1C,IAAC,YAA0B,yBAAS,IAAI;AAMxC,IAAC,iBAA+B,yBAAS,MAAS;AAMlD,IAAC,YAAY;AAChB,SAAS,KAAK,GAAG;AACpB,SAAO,WAAY;AACf,QAAI,OAAO,CAAA;AACX,aAAS,KAAK,GAAG,KAAK,UAAU,QAAQ,MAAM;AAC1C,WAAK,EAAE,IAAI,UAAU,EAAE;AAAA,IAC1B;AACD,QAAI,KAAK,SAAS,GAAG;AACjB,aAAO,EAAE,KAAK,CAAC,GAAG,KAAK,CAAC,CAAC;AAAA,IAC5B;AACD,WAAO,SAAU,GAAG;AAAE,aAAO,EAAE,CAAC,EAAE,KAAK,CAAC,CAAC;AAAA;EACjD;AACA;AACO,SAAS,KAAK,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI;AACrD,UAAQ,UAAU,QAAM;AAAA,IACpB,KAAK;AACD,aAAO;AAAA,IACX,KAAK;AACD,aAAO,WAAY;AACf,eAAO,GAAG,GAAG,MAAM,MAAM,SAAS,CAAC;AAAA,MACnD;AAAA,IACQ,KAAK;AACD,aAAO,WAAY;AACf,eAAO,GAAG,GAAG,GAAG,MAAM,MAAM,SAAS,CAAC,CAAC;AAAA,MACvD;AAAA,IACQ,KAAK;AACD,aAAO,WAAY;AACf,eAAO,GAAG,GAAG,GAAG,GAAG,MAAM,MAAM,SAAS,CAAC,CAAC,CAAC;AAAA,MAC3D;AAAA,IACQ,KAAK;AACD,aAAO,WAAY;AACf,eAAO,GAAG,GAAG,GAAG,GAAG,GAAG,MAAM,MAAM,SAAS,CAAC,CAAC,CAAC,CAAC;AAAA,MAC/D;AAAA,IACQ,KAAK;AACD,aAAO,WAAY;AACf,eAAO,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,MAAM,MAAM,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC;AAAA,MACnE;AAAA,IACQ,KAAK;AACD,aAAO,WAAY;AACf,eAAO,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,MAAM,MAAM,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;AAAA,MACvE;AAAA,IACQ,KAAK;AACD,aAAO,WAAY;AACf,eAAO,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,MAAM,MAAM,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;AAAA,MAC3E;AAAA,IACQ,KAAK;AACD,aAAO,WAAY;AACf,eAAO,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,MAAM,MAAM,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;AAAA,MAC/E;AAAA,EACK;AACD;AACJ;AAIO,SAAS,QAAQ;AACpB,MAAI,IAAI,CAAA;AACR,WAAS,KAAK,GAAG,KAAK,UAAU,QAAQ,MAAM;AAC1C,MAAE,EAAE,IAAI,UAAU,EAAE;AAAA,EACvB;AACD,SAAO;AACX;AAIO,SAAS,UAAU,GAAG;AACzB,SAAO,IAAI;AACf;AAIO,SAAS,UAAU,GAAG;AACzB,SAAO,IAAI;AACf;AAIO,SAAS,OAAO,GAAG;AACtB,QAAM,IAAI,MAAM,qDAAqD;AACzE;AAaO,SAAS,OAAO,GAAG;AACtB,SAAO,SAAU,GAAG;AAAE,WAAO,EAAE,MAAM,QAAQ,CAAC;AAAA;AAClD;AAMO,SAAS,SAAS,GAAG;AACxB,SAAO,WAAY;AACf,QAAI,IAAI,CAAA;AACR,aAAS,KAAK,GAAG,KAAK,UAAU,QAAQ,MAAM;AAC1C,QAAE,EAAE,IAAI,UAAU,EAAE;AAAA,IACvB;AACD,WAAO,EAAE,CAAC;AAAA,EAClB;AACA;AACO,SAAS,KAAK,GAAG,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI;AACpD,UAAQ,UAAU,QAAM;AAAA,IACpB,KAAK;AACD,aAAO;AAAA,IACX,KAAK;AACD,aAAO,GAAG,CAAC;AAAA,IACf,KAAK;AACD,aAAO,GAAG,GAAG,CAAC,CAAC;AAAA,IACnB,KAAK;AACD,aAAO,GAAG,GAAG,GAAG,CAAC,CAAC,CAAC;AAAA,IACvB,KAAK;AACD,aAAO,GAAG,GAAG,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC;AAAA,IAC3B,KAAK;AACD,aAAO,GAAG,GAAG,GAAG,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;AAAA,IAC/B,KAAK;AACD,aAAO,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;AAAA,IACnC,KAAK;AACD,aAAO,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;AAAA,IACvC,KAAK;AACD,aAAO,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;AAAA,IAC3C,SAAS;AACL,UAAI,MAAM,UAAU,CAAC;AACrB,eAAS,IAAI,GAAG,IAAI,UAAU,QAAQ,KAAK;AACvC,cAAM,UAAU,CAAC,EAAE,GAAG;AAAA,MACzB;AACD,aAAO;AAAA,IACV;AAAA,EACJ;AACL;AAMU,IAAC,OAAO;AAIR,IAAC,KAAK,SAAU,GAAG,GAAG;AAAE,SAAO;AAAK;AAQvC,SAAS,IAAI,WAAW;AAC3B,SAAO,SAAU,GAAG;AAAE,WAAO,CAAC,UAAU,CAAC;AAAA;AAC7C;AAQU,IAAC,wBAAwB,WAAY;AAAE,SAAQ;AAAA,IACrD,QAAQ,SAAU,OAAO,QAAQ;AAAE,aAAO,KAAK,OAAO,MAAM;AAAA,IAAI;AAAA,IAChE,OAAO;AAAA,EACX;AAAM;AAEI,IAAC,OAAO,SAAU,OAAO,MAAM;AACrC,MAAI,cAAc,OAAO,UAAU,WAAW,SAAU,MAAM;AAAE,WAAO,KAAK,UAAU;AAAA,EAAM,IAAK;AACjG,SAAO,WAAY;AACf,QAAI,OAAO,MAAM,KAAK,SAAS;AAC/B,QAAI,YAAY,SAAS,GAAG;AACxB,aAAO,KAAK,MAAM,MAAM,IAAI;AAAA,IAC/B;AACD,WAAO,SAAU,MAAM;AAAE,aAAO,KAAK,MAAM,QAAQ,cAAc,CAAC,IAAI,GAAG,MAAM,KAAK,CAAC;AAAA,IAAE;AAAA,EAC/F;AACA;;;;;;;;;;;;;;;;;;;;;;;;;;;;;","x_google_ignoreList":[0]}
1	+ {"version":3,"file":"function.cjs","sources":["../../../../../../node_modules/fp-ts/es6/function.js"],"sourcesContent":["var __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};\n// -------------------------------------------------------------------------------------\n// instances\n// -------------------------------------------------------------------------------------\n/*\n @category instances\n * @since 2.10.0\n /\nexport var getBooleanAlgebra = function (B) {\n return function () { return ({\n meet: function (x, y) { return function (a) { return B.meet(x(a), y(a)); }; },\n join: function (x, y) { return function (a) { return B.join(x(a), y(a)); }; },\n zero: function () { return B.zero; },\n one: function () { return B.one; },\n implies: function (x, y) { return function (a) { return B.implies(x(a), y(a)); }; },\n not: function (x) { return function (a) { return B.not(x(a)); }; }\n }); };\n};\n/\n Unary functions form a semigroup as long as you can provide a semigroup for the codomain.\n \n @example\n * import { Predicate, getSemigroup } from 'fp-ts/function'\n * import * as B from 'fp-ts/boolean'\n \n const f: Predicate<number> = (n) => n <= 2\n * const g: Predicate<number> = (n) => n >= 0\n \n const S1 = getSemigroup(B.SemigroupAll)<number>()\n \n assert.deepStrictEqual(S1.concat(f, g)(1), true)\n * assert.deepStrictEqual(S1.concat(f, g)(3), false)\n \n const S2 = getSemigroup(B.SemigroupAny)<number>()\n \n assert.deepStrictEqual(S2.concat(f, g)(1), true)\n * assert.deepStrictEqual(S2.concat(f, g)(3), true)\n \n @category instances\n * @since 2.10.0\n /\nexport var getSemigroup = function (S) {\n return function () { return ({\n concat: function (f, g) { return function (a) { return S.concat(f(a), g(a)); }; }\n }); };\n};\n/\n Unary functions form a monoid as long as you can provide a monoid for the codomain.\n \n @example\n * import { Predicate } from 'fp-ts/Predicate'\n * import { getMonoid } from 'fp-ts/function'\n * import * as B from 'fp-ts/boolean'\n \n const f: Predicate<number> = (n) => n <= 2\n * const g: Predicate<number> = (n) => n >= 0\n \n const M1 = getMonoid(B.MonoidAll)<number>()\n \n assert.deepStrictEqual(M1.concat(f, g)(1), true)\n * assert.deepStrictEqual(M1.concat(f, g)(3), false)\n \n const M2 = getMonoid(B.MonoidAny)<number>()\n \n assert.deepStrictEqual(M2.concat(f, g)(1), true)\n * assert.deepStrictEqual(M2.concat(f, g)(3), true)\n \n @category instances\n * @since 2.10.0\n /\nexport var getMonoid = function (M) {\n var getSemigroupM = getSemigroup(M);\n return function () { return ({\n concat: getSemigroupM().concat,\n empty: function () { return M.empty; }\n }); };\n};\n/\n @category instances\n * @since 2.10.0\n /\nexport var getSemiring = function (S) { return ({\n add: function (f, g) { return function (x) { return S.add(f(x), g(x)); }; },\n zero: function () { return S.zero; },\n mul: function (f, g) { return function (x) { return S.mul(f(x), g(x)); }; },\n one: function () { return S.one; }\n}); };\n/\n @category instances\n * @since 2.10.0\n /\nexport var getRing = function (R) {\n var S = getSemiring(R);\n return {\n add: S.add,\n mul: S.mul,\n one: S.one,\n zero: S.zero,\n sub: function (f, g) { return function (x) { return R.sub(f(x), g(x)); }; }\n };\n};\n// -------------------------------------------------------------------------------------\n// utils\n// -------------------------------------------------------------------------------------\n/\n @since 2.11.0\n /\nexport var apply = function (a) {\n return function (f) {\n return f(a);\n };\n};\n/\n @since 2.0.0\n /\nexport function identity(a) {\n return a;\n}\n/\n @since 2.0.0\n /\nexport var unsafeCoerce = identity;\n/\n @since 2.0.0\n /\nexport function constant(a) {\n return function () { return a; };\n}\n/\n A thunk that returns always `true`.\n \n @since 2.0.0\n /\nexport var constTrue = /#__PURE__/ constant(true);\n/\n A thunk that returns always `false`.\n \n @since 2.0.0\n /\nexport var constFalse = /#__PURE__/ constant(false);\n/\n A thunk that returns always `null`.\n \n @since 2.0.0\n /\nexport var constNull = /#__PURE__/ constant(null);\n/\n A thunk that returns always `undefined`.\n \n @since 2.0.0\n /\nexport var constUndefined = /#__PURE__/ constant(undefined);\n/\n A thunk that returns always `void`.\n \n @since 2.0.0\n /\nexport var constVoid = constUndefined;\nexport function flip(f) {\n return function () {\n var args = [];\n for (var _i = 0; _i < arguments.length; _i++) {\n args[_i] = arguments[_i];\n }\n if (args.length > 1) {\n return f(args[1], args[0]);\n }\n return function (a) { return f(a)(args[0]); };\n };\n}\nexport function flow(ab, bc, cd, de, ef, fg, gh, hi, ij) {\n switch (arguments.length) {\n case 1:\n return ab;\n case 2:\n return function () {\n return bc(ab.apply(this, arguments));\n };\n case 3:\n return function () {\n return cd(bc(ab.apply(this, arguments)));\n };\n case 4:\n return function () {\n return de(cd(bc(ab.apply(this, arguments))));\n };\n case 5:\n return function () {\n return ef(de(cd(bc(ab.apply(this, arguments)))));\n };\n case 6:\n return function () {\n return fg(ef(de(cd(bc(ab.apply(this, arguments))))));\n };\n case 7:\n return function () {\n return gh(fg(ef(de(cd(bc(ab.apply(this, arguments)))))));\n };\n case 8:\n return function () {\n return hi(gh(fg(ef(de(cd(bc(ab.apply(this, arguments))))))));\n };\n case 9:\n return function () {\n return ij(hi(gh(fg(ef(de(cd(bc(ab.apply(this, arguments)))))))));\n };\n }\n return;\n}\n/\n @since 2.0.0\n /\nexport function tuple() {\n var t = [];\n for (var _i = 0; _i < arguments.length; _i++) {\n t[_i] = arguments[_i];\n }\n return t;\n}\n/\n @since 2.0.0\n /\nexport function increment(n) {\n return n + 1;\n}\n/\n @since 2.0.0\n /\nexport function decrement(n) {\n return n - 1;\n}\n/\n @since 2.0.0\n /\nexport function absurd(_) {\n throw new Error('Called `absurd` function which should be uncallable');\n}\n/\n Creates a tupled version of this function: instead of `n` arguments, it accepts a single tuple argument.\n \n @example\n * import { tupled } from 'fp-ts/function'\n \n const add = tupled((x: number, y: number): number => x + y)\n \n assert.strictEqual(add([1, 2]), 3)\n \n @since 2.4.0\n /\nexport function tupled(f) {\n return function (a) { return f.apply(void 0, a); };\n}\n/\n Inverse function of `tupled`\n \n @since 2.4.0\n /\nexport function untupled(f) {\n return function () {\n var a = [];\n for (var _i = 0; _i < arguments.length; _i++) {\n a[_i] = arguments[_i];\n }\n return f(a);\n };\n}\nexport function pipe(a, ab, bc, cd, de, ef, fg, gh, hi) {\n switch (arguments.length) {\n case 1:\n return a;\n case 2:\n return ab(a);\n case 3:\n return bc(ab(a));\n case 4:\n return cd(bc(ab(a)));\n case 5:\n return de(cd(bc(ab(a))));\n case 6:\n return ef(de(cd(bc(ab(a)))));\n case 7:\n return fg(ef(de(cd(bc(ab(a))))));\n case 8:\n return gh(fg(ef(de(cd(bc(ab(a)))))));\n case 9:\n return hi(gh(fg(ef(de(cd(bc(ab(a))))))));\n default: {\n var ret = arguments[0];\n for (var i = 1; i < arguments.length; i++) {\n ret = arguments[i](ret);\n }\n return ret;\n }\n }\n}\n/\n Type hole simulation\n \n @since 2.7.0\n /\nexport var hole = absurd;\n/\n @since 2.11.0\n /\nexport var SK = function (_, b) { return b; };\n/\n Use `Predicate` module instead.\n \n @category zone of death\n * @since 2.0.0\n * @deprecated\n /\nexport function not(predicate) {\n return function (a) { return !predicate(a); };\n}\n/\n Use `Endomorphism` module instead.\n \n @category zone of death\n * @since 2.10.0\n * @deprecated\n /\nexport var getEndomorphismMonoid = function () { return ({\n concat: function (first, second) { return flow(first, second); },\n empty: identity\n}); };\n/* @internal */\nexport var dual = function (arity, body) {\n var isDataFirst = typeof arity === 'number' ? function (args) { return args.length >= arity; } : arity;\n return function () {\n var args = Array.from(arguments);\n if (isDataFirst(arguments)) {\n return body.apply(this, args);\n }\n return function (self) { return body.apply(void 0, __spreadArray([self], args, false)); };\n };\n};\n"],"names":["this"],"mappings":";;AAAqBA,cAAQA,WAAK,iBAAkB,SAAU,IAAI,MAAM,MAAM;AAC1E,MAAI,QAAQ,UAAU,WAAW;AAAG,aAAS,IAAI,GAAG,IAAI,KAAK,QAAQ,IAAI,IAAI,GAAG,KAAK;AACjF,UAAI,MAAM,EAAE,KAAK,OAAO;AACpB,YAAI,CAAC;AAAI,eAAK,MAAM,UAAU,MAAM,KAAK,MAAM,GAAG,CAAC;AACnD,WAAG,CAAC,IAAI,KAAK,CAAC;AAAA,MACjB;AAAA,IACJ;AACD,SAAO,GAAG,OAAO,MAAM,MAAM,UAAU,MAAM,KAAK,IAAI,CAAC;AAC3D;AA0QO,SAAS,KAAK,GAAG,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI;AACpD,UAAQ,UAAU,QAAM;AAAA,IACpB,KAAK;AACD,aAAO;AAAA,IACX,KAAK;AACD,aAAO,GAAG,CAAC;AAAA,IACf,KAAK;AACD,aAAO,GAAG,GAAG,CAAC,CAAC;AAAA,IACnB,KAAK;AACD,aAAO,GAAG,GAAG,GAAG,CAAC,CAAC,CAAC;AAAA,IACvB,KAAK;AACD,aAAO,GAAG,GAAG,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC;AAAA,IAC3B,KAAK;AACD,aAAO,GAAG,GAAG,GAAG,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;AAAA,IAC/B,KAAK;AACD,aAAO,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;AAAA,IACnC,KAAK;AACD,aAAO,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;AAAA,IACvC,KAAK;AACD,aAAO,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;AAAA,IAC3C,SAAS;AACL,UAAI,MAAM,UAAU,CAAC;AACrB,eAAS,IAAI,GAAG,IAAI,UAAU,QAAQ,KAAK;AACvC,cAAM,UAAU,CAAC,EAAE,GAAG;AAAA,MACzB;AACD,aAAO;AAAA,IACV;AAAA,EACJ;AACL;;","x_google_ignoreList":[0]}