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

package/dist/_node_modules/fp-ts/lib/Option.js.map

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

package/dist/_node_modules/fp-ts/lib/Ord.cjs

@@ -1,181 +0,0 @@
-"use strict";
-Object.defineProperty(exports, Symbol.toStringTag, { value: "Module" });
-const Ord = require("../../../_virtual/Ord.cjs");
-const Eq = require("./Eq.cjs");
-const _function = require("./function.cjs");
-var hasRequiredOrd;
-function requireOrd() {
-  if (hasRequiredOrd)
-    return Ord.__exports;
-  hasRequiredOrd = 1;
-  (function(exports2) {
-    Object.defineProperty(exports2, "__esModule", { value: true });
-    exports2.ordDate = exports2.ordNumber = exports2.ordString = exports2.ordBoolean = exports2.ord = exports2.getDualOrd = exports2.getTupleOrd = exports2.between = exports2.clamp = exports2.max = exports2.min = exports2.geq = exports2.leq = exports2.gt = exports2.lt = exports2.equals = exports2.trivial = exports2.Contravariant = exports2.getMonoid = exports2.getSemigroup = exports2.URI = exports2.contramap = exports2.reverse = exports2.tuple = exports2.fromCompare = exports2.equalsDefault = void 0;
-    var Eq_1 = Eq.__require();
-    var function_1 = _function.__require();
-    var equalsDefault = function(compare2) {
-      return function(first, second) {
-        return first === second || compare2(first, second) === 0;
-      };
-    };
-    exports2.equalsDefault = equalsDefault;
-    var fromCompare = function(compare2) {
-      return {
-        equals: (0, exports2.equalsDefault)(compare2),
-        compare: function(first, second) {
-          return first === second ? 0 : compare2(first, second);
-        }
-      };
-    };
-    exports2.fromCompare = fromCompare;
-    var tuple = function() {
-      var ords = [];
-      for (var _i = 0; _i < arguments.length; _i++) {
-        ords[_i] = arguments[_i];
-      }
-      return (0, exports2.fromCompare)(function(first, second) {
-        var i = 0;
-        for (; i < ords.length - 1; i++) {
-          var r = ords[i].compare(first[i], second[i]);
-          if (r !== 0) {
-            return r;
-          }
-        }
-        return ords[i].compare(first[i], second[i]);
-      });
-    };
-    exports2.tuple = tuple;
-    var reverse = function(O) {
-      return (0, exports2.fromCompare)(function(first, second) {
-        return O.compare(second, first);
-      });
-    };
-    exports2.reverse = reverse;
-    var contramap_ = function(fa, f) {
-      return (0, function_1.pipe)(fa, (0, exports2.contramap)(f));
-    };
-    var contramap = function(f) {
-      return function(fa) {
-        return (0, exports2.fromCompare)(function(first, second) {
-          return fa.compare(f(first), f(second));
-        });
-      };
-    };
-    exports2.contramap = contramap;
-    exports2.URI = "Ord";
-    var getSemigroup = function() {
-      return {
-        concat: function(first, second) {
-          return (0, exports2.fromCompare)(function(a, b) {
-            var ox = first.compare(a, b);
-            return ox !== 0 ? ox : second.compare(a, b);
-          });
-        }
-      };
-    };
-    exports2.getSemigroup = getSemigroup;
-    var getMonoid = function() {
-      return {
-        concat: (0, exports2.getSemigroup)().concat,
-        empty: (0, exports2.fromCompare)(function() {
-          return 0;
-        })
-      };
-    };
-    exports2.getMonoid = getMonoid;
-    exports2.Contravariant = {
-      URI: exports2.URI,
-      contramap: contramap_
-    };
-    exports2.trivial = {
-      equals: function_1.constTrue,
-      compare: /* @__PURE__ */ (0, function_1.constant)(0)
-    };
-    var equals = function(O) {
-      return function(second) {
-        return function(first) {
-          return first === second || O.compare(first, second) === 0;
-        };
-      };
-    };
-    exports2.equals = equals;
-    var lt = function(O) {
-      return function(first, second) {
-        return O.compare(first, second) === -1;
-      };
-    };
-    exports2.lt = lt;
-    var gt = function(O) {
-      return function(first, second) {
-        return O.compare(first, second) === 1;
-      };
-    };
-    exports2.gt = gt;
-    var leq = function(O) {
-      return function(first, second) {
-        return O.compare(first, second) !== 1;
-      };
-    };
-    exports2.leq = leq;
-    var geq = function(O) {
-      return function(first, second) {
-        return O.compare(first, second) !== -1;
-      };
-    };
-    exports2.geq = geq;
-    var min = function(O) {
-      return function(first, second) {
-        return first === second || O.compare(first, second) < 1 ? first : second;
-      };
-    };
-    exports2.min = min;
-    var max = function(O) {
-      return function(first, second) {
-        return first === second || O.compare(first, second) > -1 ? first : second;
-      };
-    };
-    exports2.max = max;
-    var clamp = function(O) {
-      var minO = (0, exports2.min)(O);
-      var maxO = (0, exports2.max)(O);
-      return function(low, hi) {
-        return function(a) {
-          return maxO(minO(a, hi), low);
-        };
-      };
-    };
-    exports2.clamp = clamp;
-    var between = function(O) {
-      var ltO = (0, exports2.lt)(O);
-      var gtO = (0, exports2.gt)(O);
-      return function(low, hi) {
-        return function(a) {
-          return ltO(a, low) || gtO(a, hi) ? false : true;
-        };
-      };
-    };
-    exports2.between = between;
-    exports2.getTupleOrd = exports2.tuple;
-    exports2.getDualOrd = exports2.reverse;
-    exports2.ord = exports2.Contravariant;
-    function compare(first, second) {
-      return first < second ? -1 : first > second ? 1 : 0;
-    }
-    var strictOrd = {
-      equals: Eq_1.eqStrict.equals,
-      compare
-    };
-    exports2.ordBoolean = strictOrd;
-    exports2.ordString = strictOrd;
-    exports2.ordNumber = strictOrd;
-    exports2.ordDate = (0, function_1.pipe)(
-      exports2.ordNumber,
-      /* @__PURE__ */ (0, exports2.contramap)(function(date) {
-        return date.valueOf();
-      })
-    );
-  })(Ord.__exports);
-  return Ord.__exports;
-}
-exports.__require = requireOrd;
-//# sourceMappingURL=Ord.cjs.map

package/dist/_node_modules/fp-ts/lib/Ord.cjs.map

@@ -1 +0,0 @@
-{"version":3,"file":"Ord.cjs","sources":["../../../../../../node_modules/fp-ts/lib/Ord.js"],"sourcesContent":["\"use strict\";\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.ordDate = exports.ordNumber = exports.ordString = exports.ordBoolean = exports.ord = exports.getDualOrd = exports.getTupleOrd = exports.between = exports.clamp = exports.max = exports.min = exports.geq = exports.leq = exports.gt = exports.lt = exports.equals = exports.trivial = exports.Contravariant = exports.getMonoid = exports.getSemigroup = exports.URI = exports.contramap = exports.reverse = exports.tuple = exports.fromCompare = exports.equalsDefault = void 0;\nvar Eq_1 = require(\"./Eq\");\nvar function_1 = require(\"./function\");\n// -------------------------------------------------------------------------------------\n// defaults\n// -------------------------------------------------------------------------------------\n/**\n * @category defaults\n * @since 2.10.0\n */\nvar equalsDefault = function (compare) {\n    return function (first, second) {\n        return first === second || compare(first, second) === 0;\n    };\n};\nexports.equalsDefault = equalsDefault;\n// -------------------------------------------------------------------------------------\n// constructors\n// -------------------------------------------------------------------------------------\n/**\n * @category constructors\n * @since 2.0.0\n */\nvar fromCompare = function (compare) { return ({\n    equals: (0, exports.equalsDefault)(compare),\n    compare: function (first, second) { return (first === second ? 0 : compare(first, second)); }\n}); };\nexports.fromCompare = fromCompare;\n// -------------------------------------------------------------------------------------\n// combinators\n// -------------------------------------------------------------------------------------\n/**\n * Given a tuple of `Ord`s returns an `Ord` for the tuple.\n *\n * @example\n * import { tuple } from 'fp-ts/Ord'\n * import * as B from 'fp-ts/boolean'\n * import * as S from 'fp-ts/string'\n * import * as N from 'fp-ts/number'\n *\n * const O = tuple(S.Ord, N.Ord, B.Ord)\n * assert.strictEqual(O.compare(['a', 1, true], ['b', 2, true]), -1)\n * assert.strictEqual(O.compare(['a', 1, true], ['a', 2, true]), -1)\n * assert.strictEqual(O.compare(['a', 1, true], ['a', 1, false]), 1)\n *\n * @since 2.10.0\n */\nvar tuple = function () {\n    var ords = [];\n    for (var _i = 0; _i < arguments.length; _i++) {\n        ords[_i] = arguments[_i];\n    }\n    return (0, exports.fromCompare)(function (first, second) {\n        var i = 0;\n        for (; i < ords.length - 1; i++) {\n            var r = ords[i].compare(first[i], second[i]);\n            if (r !== 0) {\n                return r;\n            }\n        }\n        return ords[i].compare(first[i], second[i]);\n    });\n};\nexports.tuple = tuple;\n/**\n * @since 2.10.0\n */\nvar reverse = function (O) { return (0, exports.fromCompare)(function (first, second) { return O.compare(second, first); }); };\nexports.reverse = reverse;\n/* istanbul ignore next */\nvar contramap_ = function (fa, f) { return (0, function_1.pipe)(fa, (0, exports.contramap)(f)); };\n/**\n * A typical use case for `contramap` would be like, given some `User` type, to construct an `Ord<User>`.\n *\n * We can do so with a function from `User -> X` where `X` is some value that we know how to compare\n * for ordering (meaning we have an `Ord<X>`)\n *\n * For example, given the following `User` type, there are lots of possible choices for `X`,\n * but let's say we want to sort a list of users by `lastName`.\n *\n * If we have a way of comparing `lastName`s for ordering (`ordLastName: Ord<string>`) and we know how to go from `User -> string`,\n * using `contramap` we can do this\n *\n * @example\n * import { pipe } from 'fp-ts/function'\n * import { contramap, Ord } from 'fp-ts/Ord'\n * import * as RA from 'fp-ts/ReadonlyArray'\n * import * as S from 'fp-ts/string'\n *\n * interface User {\n *   readonly firstName: string\n *   readonly lastName: string\n * }\n *\n * const ordLastName: Ord<string> = S.Ord\n *\n * const ordByLastName: Ord<User> = pipe(\n *   ordLastName,\n *   contramap((user) => user.lastName)\n * )\n *\n * assert.deepStrictEqual(\n *   RA.sort(ordByLastName)([\n *     { firstName: 'a', lastName: 'd' },\n *     { firstName: 'c', lastName: 'b' }\n *   ]),\n *   [\n *     { firstName: 'c', lastName: 'b' },\n *     { firstName: 'a', lastName: 'd' }\n *   ]\n * )\n *\n * @since 2.0.0\n */\nvar contramap = function (f) { return function (fa) {\n    return (0, exports.fromCompare)(function (first, second) { return fa.compare(f(first), f(second)); });\n}; };\nexports.contramap = contramap;\n/**\n * @category type lambdas\n * @since 2.0.0\n */\nexports.URI = 'Ord';\n/**\n * A typical use case for the `Semigroup` instance of `Ord` is merging two or more orderings.\n *\n * For example the following snippet builds an `Ord` for a type `User` which\n * sorts by `created` date descending, and **then** `lastName`\n *\n * @example\n * import * as D from 'fp-ts/Date'\n * import { pipe } from 'fp-ts/function'\n * import { contramap, getSemigroup, Ord, reverse } from 'fp-ts/Ord'\n * import * as RA from 'fp-ts/ReadonlyArray'\n * import * as S from 'fp-ts/string'\n *\n * interface User {\n *   readonly id: string\n *   readonly lastName: string\n *   readonly created: Date\n * }\n *\n * const ordByLastName: Ord<User> = pipe(\n *   S.Ord,\n *   contramap((user) => user.lastName)\n * )\n *\n * const ordByCreated: Ord<User> = pipe(\n *   D.Ord,\n *   contramap((user) => user.created)\n * )\n *\n * const ordUserByCreatedDescThenLastName = getSemigroup<User>().concat(\n *   reverse(ordByCreated),\n *   ordByLastName\n * )\n *\n * assert.deepStrictEqual(\n *   RA.sort(ordUserByCreatedDescThenLastName)([\n *     { id: 'c', lastName: 'd', created: new Date(1973, 10, 30) },\n *     { id: 'a', lastName: 'b', created: new Date(1973, 10, 30) },\n *     { id: 'e', lastName: 'f', created: new Date(1980, 10, 30) }\n *   ]),\n *   [\n *     { id: 'e', lastName: 'f', created: new Date(1980, 10, 30) },\n *     { id: 'a', lastName: 'b', created: new Date(1973, 10, 30) },\n *     { id: 'c', lastName: 'd', created: new Date(1973, 10, 30) }\n *   ]\n * )\n *\n * @category instances\n * @since 2.0.0\n */\nvar getSemigroup = function () { return ({\n    concat: function (first, second) {\n        return (0, exports.fromCompare)(function (a, b) {\n            var ox = first.compare(a, b);\n            return ox !== 0 ? ox : second.compare(a, b);\n        });\n    }\n}); };\nexports.getSemigroup = getSemigroup;\n/**\n * Returns a `Monoid` such that:\n *\n * - its `concat(ord1, ord2)` operation will order first by `ord1`, and then by `ord2`\n * - its `empty` value is an `Ord` that always considers compared elements equal\n *\n * @example\n * import { sort } from 'fp-ts/Array'\n * import { contramap, reverse, getMonoid } from 'fp-ts/Ord'\n * import * as S from 'fp-ts/string'\n * import * as B from 'fp-ts/boolean'\n * import { pipe } from 'fp-ts/function'\n * import { concatAll } from 'fp-ts/Monoid'\n * import * as N from 'fp-ts/number'\n *\n * interface User {\n *   readonly id: number\n *   readonly name: string\n *   readonly age: number\n *   readonly rememberMe: boolean\n * }\n *\n * const byName = pipe(\n *   S.Ord,\n *   contramap((p: User) => p.name)\n * )\n *\n * const byAge = pipe(\n *   N.Ord,\n *   contramap((p: User) => p.age)\n * )\n *\n * const byRememberMe = pipe(\n *   B.Ord,\n *   contramap((p: User) => p.rememberMe)\n * )\n *\n * const M = getMonoid<User>()\n *\n * const users: Array<User> = [\n *   { id: 1, name: 'Guido', age: 47, rememberMe: false },\n *   { id: 2, name: 'Guido', age: 46, rememberMe: true },\n *   { id: 3, name: 'Giulio', age: 44, rememberMe: false },\n *   { id: 4, name: 'Giulio', age: 44, rememberMe: true }\n * ]\n *\n * // sort by name, then by age, then by `rememberMe`\n * const O1 = concatAll(M)([byName, byAge, byRememberMe])\n * assert.deepStrictEqual(sort(O1)(users), [\n *   { id: 3, name: 'Giulio', age: 44, rememberMe: false },\n *   { id: 4, name: 'Giulio', age: 44, rememberMe: true },\n *   { id: 2, name: 'Guido', age: 46, rememberMe: true },\n *   { id: 1, name: 'Guido', age: 47, rememberMe: false }\n * ])\n *\n * // now `rememberMe = true` first, then by name, then by age\n * const O2 = concatAll(M)([reverse(byRememberMe), byName, byAge])\n * assert.deepStrictEqual(sort(O2)(users), [\n *   { id: 4, name: 'Giulio', age: 44, rememberMe: true },\n *   { id: 2, name: 'Guido', age: 46, rememberMe: true },\n *   { id: 3, name: 'Giulio', age: 44, rememberMe: false },\n *   { id: 1, name: 'Guido', age: 47, rememberMe: false }\n * ])\n *\n * @category instances\n * @since 2.4.0\n */\nvar getMonoid = function () { return ({\n    concat: (0, exports.getSemigroup)().concat,\n    empty: (0, exports.fromCompare)(function () { return 0; })\n}); };\nexports.getMonoid = getMonoid;\n/**\n * @category instances\n * @since 2.7.0\n */\nexports.Contravariant = {\n    URI: exports.URI,\n    contramap: contramap_\n};\n// -------------------------------------------------------------------------------------\n// utils\n// -------------------------------------------------------------------------------------\n/**\n * @since 2.11.0\n */\nexports.trivial = {\n    equals: function_1.constTrue,\n    compare: /*#__PURE__*/ (0, function_1.constant)(0)\n};\n/**\n * @since 2.11.0\n */\nvar equals = function (O) {\n    return function (second) {\n        return function (first) {\n            return first === second || O.compare(first, second) === 0;\n        };\n    };\n};\nexports.equals = equals;\n// TODO: curry in v3\n/**\n * Test whether one value is _strictly less than_ another\n *\n * @since 2.0.0\n */\nvar lt = function (O) {\n    return function (first, second) {\n        return O.compare(first, second) === -1;\n    };\n};\nexports.lt = lt;\n// TODO: curry in v3\n/**\n * Test whether one value is _strictly greater than_ another\n *\n * @since 2.0.0\n */\nvar gt = function (O) {\n    return function (first, second) {\n        return O.compare(first, second) === 1;\n    };\n};\nexports.gt = gt;\n// TODO: curry in v3\n/**\n * Test whether one value is _non-strictly less than_ another\n *\n * @since 2.0.0\n */\nvar leq = function (O) {\n    return function (first, second) {\n        return O.compare(first, second) !== 1;\n    };\n};\nexports.leq = leq;\n// TODO: curry in v3\n/**\n * Test whether one value is _non-strictly greater than_ another\n *\n * @since 2.0.0\n */\nvar geq = function (O) {\n    return function (first, second) {\n        return O.compare(first, second) !== -1;\n    };\n};\nexports.geq = geq;\n// TODO: curry in v3\n/**\n * Take the minimum of two values. If they are considered equal, the first argument is chosen\n *\n * @since 2.0.0\n */\nvar min = function (O) {\n    return function (first, second) {\n        return first === second || O.compare(first, second) < 1 ? first : second;\n    };\n};\nexports.min = min;\n// TODO: curry in v3\n/**\n * Take the maximum of two values. If they are considered equal, the first argument is chosen\n *\n * @since 2.0.0\n */\nvar max = function (O) {\n    return function (first, second) {\n        return first === second || O.compare(first, second) > -1 ? first : second;\n    };\n};\nexports.max = max;\n/**\n * Clamp a value between a minimum and a maximum\n *\n * @since 2.0.0\n */\nvar clamp = function (O) {\n    var minO = (0, exports.min)(O);\n    var maxO = (0, exports.max)(O);\n    return function (low, hi) { return function (a) { return maxO(minO(a, hi), low); }; };\n};\nexports.clamp = clamp;\n/**\n * Test whether a value is between a minimum and a maximum (inclusive)\n *\n * @since 2.0.0\n */\nvar between = function (O) {\n    var ltO = (0, exports.lt)(O);\n    var gtO = (0, exports.gt)(O);\n    return function (low, hi) { return function (a) { return ltO(a, low) || gtO(a, hi) ? false : true; }; };\n};\nexports.between = between;\n// -------------------------------------------------------------------------------------\n// deprecated\n// -------------------------------------------------------------------------------------\n/**\n * Use [`tuple`](#tuple) instead.\n *\n * @category zone of death\n * @since 2.0.0\n * @deprecated\n */\nexports.getTupleOrd = exports.tuple;\n/**\n * Use [`reverse`](#reverse) instead.\n *\n * @category zone of death\n * @since 2.0.0\n * @deprecated\n */\nexports.getDualOrd = exports.reverse;\n/**\n * Use [`Contravariant`](#contravariant) instead.\n *\n * @category zone of death\n * @since 2.0.0\n * @deprecated\n */\nexports.ord = exports.Contravariant;\n// default compare for primitive types\nfunction compare(first, second) {\n    return first < second ? -1 : first > second ? 1 : 0;\n}\nvar strictOrd = {\n    equals: Eq_1.eqStrict.equals,\n    compare: compare\n};\n/**\n * Use [`Ord`](./boolean.ts.html#ord) instead.\n *\n * @category zone of death\n * @since 2.0.0\n * @deprecated\n */\nexports.ordBoolean = strictOrd;\n/**\n * Use [`Ord`](./string.ts.html#ord) instead.\n *\n * @category zone of death\n * @since 2.0.0\n * @deprecated\n */\nexports.ordString = strictOrd;\n/**\n * Use [`Ord`](./number.ts.html#ord) instead.\n *\n * @category zone of death\n * @since 2.0.0\n * @deprecated\n */\nexports.ordNumber = strictOrd;\n/**\n * Use [`Ord`](./Date.ts.html#ord) instead.\n *\n * @category zone of death\n * @since 2.0.0\n * @deprecated\n */\nexports.ordDate = (0, function_1.pipe)(exports.ordNumber, \n/*#__PURE__*/\n(0, exports.contramap)(function (date) { return date.valueOf(); }));\n"],"names":["exports","require$$0","require$$1","compare"],"mappings":";;;;;;;;;;;AACA,WAAO,eAAcA,UAAU,cAAc,EAAE,OAAO,KAAI,CAAE;AAC5D,IAAAA,SAAkB,UAAAA,SAAA,YAAoBA,SAAoB,YAAAA,SAAA,aAAqBA,SAAc,MAAAA,SAAA,aAAqBA,SAAsB,cAAAA,SAAA,UAAkBA,SAAgB,QAAAA,SAAA,MAAcA,SAAc,MAAAA,SAAA,MAAcA,SAAc,MAAAA,SAAA,KAAaA,SAAa,KAAAA,SAAA,SAAiBA,SAAkB,UAAAA,SAAA,gBAAwBA,SAAoB,YAAAA,SAAA,eAAuBA,SAAc,MAAAA,SAAA,YAAoBA,SAAkB,UAAAA,SAAA,QAAgBA,SAAsB,cAAAA,SAAA,gBAAwB;AACpd,QAAI,OAAOC,GAAAA;AACX,QAAI,aAAaC,UAAAA;AAQjB,QAAI,gBAAgB,SAAUC,UAAS;AACnC,aAAO,SAAU,OAAO,QAAQ;AAC5B,eAAO,UAAU,UAAUA,SAAQ,OAAO,MAAM,MAAM;AAAA,MAC9D;AAAA,IACA;AACA,IAAAH,SAAA,gBAAwB;AAQxB,QAAI,cAAc,SAAUG,UAAS;AAAE,aAAQ;AAAA,QAC3C,SAAY,GAAAH,SAAQ,eAAeG,QAAO;AAAA,QAC1C,SAAS,SAAU,OAAO,QAAQ;AAAE,iBAAQ,UAAU,SAAS,IAAIA,SAAQ,OAAO,MAAM;AAAA,QAAK;AAAA,MAChG;AAAA;AACD,IAAAH,SAAA,cAAsB;AAoBtB,QAAI,QAAQ,WAAY;AACpB,UAAI,OAAO,CAAA;AACX,eAAS,KAAK,GAAG,KAAK,UAAU,QAAQ,MAAM;AAC1C,aAAK,EAAE,IAAI,UAAU,EAAE;AAAA,MAC1B;AACD,cAAW,GAAAA,SAAQ,aAAa,SAAU,OAAO,QAAQ;AACrD,YAAI,IAAI;AACR,eAAO,IAAI,KAAK,SAAS,GAAG,KAAK;AAC7B,cAAI,IAAI,KAAK,CAAC,EAAE,QAAQ,MAAM,CAAC,GAAG,OAAO,CAAC,CAAC;AAC3C,cAAI,MAAM,GAAG;AACT,mBAAO;AAAA,UACV;AAAA,QACJ;AACD,eAAO,KAAK,CAAC,EAAE,QAAQ,MAAM,CAAC,GAAG,OAAO,CAAC,CAAC;AAAA,MAClD,CAAK;AAAA,IACL;AACA,IAAAA,SAAA,QAAgB;AAIhB,QAAI,UAAU,SAAU,GAAG;AAAE,cAAO,GAAIA,SAAQ,aAAa,SAAU,OAAO,QAAQ;AAAE,eAAO,EAAE,QAAQ,QAAQ,KAAK;AAAA,MAAE,CAAE;AAAA;AAC1H,IAAAA,SAAA,UAAkB;AAElB,QAAI,aAAa,SAAU,IAAI,GAAG;AAAE,cAAO,GAAI,WAAW,MAAM,KAAQ,GAAAA,SAAQ,WAAW,CAAC,CAAC;AAAA,IAAE;AA4C/F,QAAI,YAAY,SAAU,GAAG;AAAE,aAAO,SAAU,IAAI;AAChD,gBAAO,GAAIA,SAAQ,aAAa,SAAU,OAAO,QAAQ;AAAE,iBAAO,GAAG,QAAQ,EAAE,KAAK,GAAG,EAAE,MAAM,CAAC;AAAA,QAAE,CAAE;AAAA,MACvG;AAAA;AACD,IAAAA,SAAA,YAAoB;AAKpB,IAAAA,SAAA,MAAc;AAmDd,QAAI,eAAe,WAAY;AAAE,aAAQ;AAAA,QACrC,QAAQ,SAAU,OAAO,QAAQ;AAC7B,kBAAW,GAAAA,SAAQ,aAAa,SAAU,GAAG,GAAG;AAC5C,gBAAI,KAAK,MAAM,QAAQ,GAAG,CAAC;AAC3B,mBAAO,OAAO,IAAI,KAAK,OAAO,QAAQ,GAAG,CAAC;AAAA,UACtD,CAAS;AAAA,QACJ;AAAA,MACJ;AAAA;AACD,IAAAA,SAAA,eAAuB;AAoEvB,QAAI,YAAY,WAAY;AAAE,aAAQ;AAAA,QAClC,SAAY,GAAAA,SAAQ,cAAY,EAAI;AAAA,QACpC,QAAW,GAAAA,SAAQ,aAAa,WAAY;AAAE,iBAAO;AAAA,SAAI;AAAA,MAC5D;AAAA;AACD,IAAAA,SAAA,YAAoB;AAKpB,IAAAA,SAAwB,gBAAA;AAAA,MACpB,KAAKA,SAAQ;AAAA,MACb,WAAW;AAAA,IACf;AAOA,IAAAA,SAAkB,UAAA;AAAA,MACd,QAAQ,WAAW;AAAA,MACnB,SAA2B,oBAAA,WAAW,UAAU,CAAC;AAAA,IACrD;AAIA,QAAI,SAAS,SAAU,GAAG;AACtB,aAAO,SAAU,QAAQ;AACrB,eAAO,SAAU,OAAO;AACpB,iBAAO,UAAU,UAAU,EAAE,QAAQ,OAAO,MAAM,MAAM;AAAA,QACpE;AAAA,MACA;AAAA,IACA;AACA,IAAAA,SAAA,SAAiB;AAOjB,QAAI,KAAK,SAAU,GAAG;AAClB,aAAO,SAAU,OAAO,QAAQ;AAC5B,eAAO,EAAE,QAAQ,OAAO,MAAM,MAAM;AAAA,MAC5C;AAAA,IACA;AACA,IAAAA,SAAA,KAAa;AAOb,QAAI,KAAK,SAAU,GAAG;AAClB,aAAO,SAAU,OAAO,QAAQ;AAC5B,eAAO,EAAE,QAAQ,OAAO,MAAM,MAAM;AAAA,MAC5C;AAAA,IACA;AACA,IAAAA,SAAA,KAAa;AAOb,QAAI,MAAM,SAAU,GAAG;AACnB,aAAO,SAAU,OAAO,QAAQ;AAC5B,eAAO,EAAE,QAAQ,OAAO,MAAM,MAAM;AAAA,MAC5C;AAAA,IACA;AACA,IAAAA,SAAA,MAAc;AAOd,QAAI,MAAM,SAAU,GAAG;AACnB,aAAO,SAAU,OAAO,QAAQ;AAC5B,eAAO,EAAE,QAAQ,OAAO,MAAM,MAAM;AAAA,MAC5C;AAAA,IACA;AACA,IAAAA,SAAA,MAAc;AAOd,QAAI,MAAM,SAAU,GAAG;AACnB,aAAO,SAAU,OAAO,QAAQ;AAC5B,eAAO,UAAU,UAAU,EAAE,QAAQ,OAAO,MAAM,IAAI,IAAI,QAAQ;AAAA,MAC1E;AAAA,IACA;AACA,IAAAA,SAAA,MAAc;AAOd,QAAI,MAAM,SAAU,GAAG;AACnB,aAAO,SAAU,OAAO,QAAQ;AAC5B,eAAO,UAAU,UAAU,EAAE,QAAQ,OAAO,MAAM,IAAI,KAAK,QAAQ;AAAA,MAC3E;AAAA,IACA;AACA,IAAAA,SAAA,MAAc;AAMd,QAAI,QAAQ,SAAU,GAAG;AACrB,UAAI,QAAW,GAAAA,SAAQ,KAAK,CAAC;AAC7B,UAAI,QAAW,GAAAA,SAAQ,KAAK,CAAC;AAC7B,aAAO,SAAU,KAAK,IAAI;AAAE,eAAO,SAAU,GAAG;AAAE,iBAAO,KAAK,KAAK,GAAG,EAAE,GAAG,GAAG;AAAA,QAAE;AAAA,MAAG;AAAA,IACvF;AACA,IAAAA,SAAA,QAAgB;AAMhB,QAAI,UAAU,SAAU,GAAG;AACvB,UAAI,OAAU,GAAAA,SAAQ,IAAI,CAAC;AAC3B,UAAI,OAAU,GAAAA,SAAQ,IAAI,CAAC;AAC3B,aAAO,SAAU,KAAK,IAAI;AAAE,eAAO,SAAU,GAAG;AAAE,iBAAO,IAAI,GAAG,GAAG,KAAK,IAAI,GAAG,EAAE,IAAI,QAAQ;AAAA,QAAO;AAAA;IACxG;AACA,IAAAA,SAAA,UAAkB;AAWlB,IAAAA,SAAsB,cAAAA,SAAQ;AAQ9B,IAAAA,SAAqB,aAAAA,SAAQ;AAQ7B,IAAAA,SAAc,MAAAA,SAAQ;AAEtB,aAAS,QAAQ,OAAO,QAAQ;AAC5B,aAAO,QAAQ,SAAS,KAAK,QAAQ,SAAS,IAAI;AAAA,IACrD;AACD,QAAI,YAAY;AAAA,MACZ,QAAQ,KAAK,SAAS;AAAA,MACtB;AAAA,IACJ;AAQA,IAAAA,SAAA,aAAqB;AAQrB,IAAAA,SAAA,YAAoB;AAQpB,IAAAA,SAAA,YAAoB;AAQpB,IAAAA,SAAkB,WAAA,GAAI,WAAW;AAAA,MAAMA,SAAQ;AAAA,0BAE3CA,SAAQ,WAAW,SAAU,MAAM;AAAE,eAAO,KAAK,QAAO;AAAA,MAAK,CAAA;AAAA,IAAC;AAAA;;;;","x_google_ignoreList":[0]}

package/dist/_node_modules/fp-ts/lib/Ord.js

@@ -1,181 +0,0 @@
-import { __exports as Ord } from "../../../_virtual/Ord.js";
-import { __require as requireEq } from "./Eq.js";
-import { __require as require_function } from "./function.js";
-var hasRequiredOrd;
-function requireOrd() {
-  if (hasRequiredOrd)
-    return Ord;
-  hasRequiredOrd = 1;
-  (function(exports) {
-    Object.defineProperty(exports, "__esModule", { value: true });
-    exports.ordDate = exports.ordNumber = exports.ordString = exports.ordBoolean = exports.ord = exports.getDualOrd = exports.getTupleOrd = exports.between = exports.clamp = exports.max = exports.min = exports.geq = exports.leq = exports.gt = exports.lt = exports.equals = exports.trivial = exports.Contravariant = exports.getMonoid = exports.getSemigroup = exports.URI = exports.contramap = exports.reverse = exports.tuple = exports.fromCompare = exports.equalsDefault = void 0;
-    var Eq_1 = requireEq();
-    var function_1 = require_function();
-    var equalsDefault = function(compare2) {
-      return function(first, second) {
-        return first === second || compare2(first, second) === 0;
-      };
-    };
-    exports.equalsDefault = equalsDefault;
-    var fromCompare = function(compare2) {
-      return {
-        equals: (0, exports.equalsDefault)(compare2),
-        compare: function(first, second) {
-          return first === second ? 0 : compare2(first, second);
-        }
-      };
-    };
-    exports.fromCompare = fromCompare;
-    var tuple = function() {
-      var ords = [];
-      for (var _i = 0; _i < arguments.length; _i++) {
-        ords[_i] = arguments[_i];
-      }
-      return (0, exports.fromCompare)(function(first, second) {
-        var i = 0;
-        for (; i < ords.length - 1; i++) {
-          var r = ords[i].compare(first[i], second[i]);
-          if (r !== 0) {
-            return r;
-          }
-        }
-        return ords[i].compare(first[i], second[i]);
-      });
-    };
-    exports.tuple = tuple;
-    var reverse = function(O) {
-      return (0, exports.fromCompare)(function(first, second) {
-        return O.compare(second, first);
-      });
-    };
-    exports.reverse = reverse;
-    var contramap_ = function(fa, f) {
-      return (0, function_1.pipe)(fa, (0, exports.contramap)(f));
-    };
-    var contramap = function(f) {
-      return function(fa) {
-        return (0, exports.fromCompare)(function(first, second) {
-          return fa.compare(f(first), f(second));
-        });
-      };
-    };
-    exports.contramap = contramap;
-    exports.URI = "Ord";
-    var getSemigroup = function() {
-      return {
-        concat: function(first, second) {
-          return (0, exports.fromCompare)(function(a, b) {
-            var ox = first.compare(a, b);
-            return ox !== 0 ? ox : second.compare(a, b);
-          });
-        }
-      };
-    };
-    exports.getSemigroup = getSemigroup;
-    var getMonoid = function() {
-      return {
-        concat: (0, exports.getSemigroup)().concat,
-        empty: (0, exports.fromCompare)(function() {
-          return 0;
-        })
-      };
-    };
-    exports.getMonoid = getMonoid;
-    exports.Contravariant = {
-      URI: exports.URI,
-      contramap: contramap_
-    };
-    exports.trivial = {
-      equals: function_1.constTrue,
-      compare: /* @__PURE__ */ (0, function_1.constant)(0)
-    };
-    var equals = function(O) {
-      return function(second) {
-        return function(first) {
-          return first === second || O.compare(first, second) === 0;
-        };
-      };
-    };
-    exports.equals = equals;
-    var lt = function(O) {
-      return function(first, second) {
-        return O.compare(first, second) === -1;
-      };
-    };
-    exports.lt = lt;
-    var gt = function(O) {
-      return function(first, second) {
-        return O.compare(first, second) === 1;
-      };
-    };
-    exports.gt = gt;
-    var leq = function(O) {
-      return function(first, second) {
-        return O.compare(first, second) !== 1;
-      };
-    };
-    exports.leq = leq;
-    var geq = function(O) {
-      return function(first, second) {
-        return O.compare(first, second) !== -1;
-      };
-    };
-    exports.geq = geq;
-    var min = function(O) {
-      return function(first, second) {
-        return first === second || O.compare(first, second) < 1 ? first : second;
-      };
-    };
-    exports.min = min;
-    var max = function(O) {
-      return function(first, second) {
-        return first === second || O.compare(first, second) > -1 ? first : second;
-      };
-    };
-    exports.max = max;
-    var clamp = function(O) {
-      var minO = (0, exports.min)(O);
-      var maxO = (0, exports.max)(O);
-      return function(low, hi) {
-        return function(a) {
-          return maxO(minO(a, hi), low);
-        };
-      };
-    };
-    exports.clamp = clamp;
-    var between = function(O) {
-      var ltO = (0, exports.lt)(O);
-      var gtO = (0, exports.gt)(O);
-      return function(low, hi) {
-        return function(a) {
-          return ltO(a, low) || gtO(a, hi) ? false : true;
-        };
-      };
-    };
-    exports.between = between;
-    exports.getTupleOrd = exports.tuple;
-    exports.getDualOrd = exports.reverse;
-    exports.ord = exports.Contravariant;
-    function compare(first, second) {
-      return first < second ? -1 : first > second ? 1 : 0;
-    }
-    var strictOrd = {
-      equals: Eq_1.eqStrict.equals,
-      compare
-    };
-    exports.ordBoolean = strictOrd;
-    exports.ordString = strictOrd;
-    exports.ordNumber = strictOrd;
-    exports.ordDate = (0, function_1.pipe)(
-      exports.ordNumber,
-      /* @__PURE__ */ (0, exports.contramap)(function(date) {
-        return date.valueOf();
-      })
-    );
-  })(Ord);
-  return Ord;
-}
-export {
-  requireOrd as __require
-};
-//# sourceMappingURL=Ord.js.map

package/dist/_node_modules/fp-ts/lib/Ord.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"Ord.js","sources":["../../../../../../node_modules/fp-ts/lib/Ord.js"],"sourcesContent":["\"use strict\";\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.ordDate = exports.ordNumber = exports.ordString = exports.ordBoolean = exports.ord = exports.getDualOrd = exports.getTupleOrd = exports.between = exports.clamp = exports.max = exports.min = exports.geq = exports.leq = exports.gt = exports.lt = exports.equals = exports.trivial = exports.Contravariant = exports.getMonoid = exports.getSemigroup = exports.URI = exports.contramap = exports.reverse = exports.tuple = exports.fromCompare = exports.equalsDefault = void 0;\nvar Eq_1 = require(\"./Eq\");\nvar function_1 = require(\"./function\");\n// -------------------------------------------------------------------------------------\n// defaults\n// -------------------------------------------------------------------------------------\n/**\n * @category defaults\n * @since 2.10.0\n */\nvar equalsDefault = function (compare) {\n    return function (first, second) {\n        return first === second || compare(first, second) === 0;\n    };\n};\nexports.equalsDefault = equalsDefault;\n// -------------------------------------------------------------------------------------\n// constructors\n// -------------------------------------------------------------------------------------\n/**\n * @category constructors\n * @since 2.0.0\n */\nvar fromCompare = function (compare) { return ({\n    equals: (0, exports.equalsDefault)(compare),\n    compare: function (first, second) { return (first === second ? 0 : compare(first, second)); }\n}); };\nexports.fromCompare = fromCompare;\n// -------------------------------------------------------------------------------------\n// combinators\n// -------------------------------------------------------------------------------------\n/**\n * Given a tuple of `Ord`s returns an `Ord` for the tuple.\n *\n * @example\n * import { tuple } from 'fp-ts/Ord'\n * import * as B from 'fp-ts/boolean'\n * import * as S from 'fp-ts/string'\n * import * as N from 'fp-ts/number'\n *\n * const O = tuple(S.Ord, N.Ord, B.Ord)\n * assert.strictEqual(O.compare(['a', 1, true], ['b', 2, true]), -1)\n * assert.strictEqual(O.compare(['a', 1, true], ['a', 2, true]), -1)\n * assert.strictEqual(O.compare(['a', 1, true], ['a', 1, false]), 1)\n *\n * @since 2.10.0\n */\nvar tuple = function () {\n    var ords = [];\n    for (var _i = 0; _i < arguments.length; _i++) {\n        ords[_i] = arguments[_i];\n    }\n    return (0, exports.fromCompare)(function (first, second) {\n        var i = 0;\n        for (; i < ords.length - 1; i++) {\n            var r = ords[i].compare(first[i], second[i]);\n            if (r !== 0) {\n                return r;\n            }\n        }\n        return ords[i].compare(first[i], second[i]);\n    });\n};\nexports.tuple = tuple;\n/**\n * @since 2.10.0\n */\nvar reverse = function (O) { return (0, exports.fromCompare)(function (first, second) { return O.compare(second, first); }); };\nexports.reverse = reverse;\n/* istanbul ignore next */\nvar contramap_ = function (fa, f) { return (0, function_1.pipe)(fa, (0, exports.contramap)(f)); };\n/**\n * A typical use case for `contramap` would be like, given some `User` type, to construct an `Ord<User>`.\n *\n * We can do so with a function from `User -> X` where `X` is some value that we know how to compare\n * for ordering (meaning we have an `Ord<X>`)\n *\n * For example, given the following `User` type, there are lots of possible choices for `X`,\n * but let's say we want to sort a list of users by `lastName`.\n *\n * If we have a way of comparing `lastName`s for ordering (`ordLastName: Ord<string>`) and we know how to go from `User -> string`,\n * using `contramap` we can do this\n *\n * @example\n * import { pipe } from 'fp-ts/function'\n * import { contramap, Ord } from 'fp-ts/Ord'\n * import * as RA from 'fp-ts/ReadonlyArray'\n * import * as S from 'fp-ts/string'\n *\n * interface User {\n *   readonly firstName: string\n *   readonly lastName: string\n * }\n *\n * const ordLastName: Ord<string> = S.Ord\n *\n * const ordByLastName: Ord<User> = pipe(\n *   ordLastName,\n *   contramap((user) => user.lastName)\n * )\n *\n * assert.deepStrictEqual(\n *   RA.sort(ordByLastName)([\n *     { firstName: 'a', lastName: 'd' },\n *     { firstName: 'c', lastName: 'b' }\n *   ]),\n *   [\n *     { firstName: 'c', lastName: 'b' },\n *     { firstName: 'a', lastName: 'd' }\n *   ]\n * )\n *\n * @since 2.0.0\n */\nvar contramap = function (f) { return function (fa) {\n    return (0, exports.fromCompare)(function (first, second) { return fa.compare(f(first), f(second)); });\n}; };\nexports.contramap = contramap;\n/**\n * @category type lambdas\n * @since 2.0.0\n */\nexports.URI = 'Ord';\n/**\n * A typical use case for the `Semigroup` instance of `Ord` is merging two or more orderings.\n *\n * For example the following snippet builds an `Ord` for a type `User` which\n * sorts by `created` date descending, and **then** `lastName`\n *\n * @example\n * import * as D from 'fp-ts/Date'\n * import { pipe } from 'fp-ts/function'\n * import { contramap, getSemigroup, Ord, reverse } from 'fp-ts/Ord'\n * import * as RA from 'fp-ts/ReadonlyArray'\n * import * as S from 'fp-ts/string'\n *\n * interface User {\n *   readonly id: string\n *   readonly lastName: string\n *   readonly created: Date\n * }\n *\n * const ordByLastName: Ord<User> = pipe(\n *   S.Ord,\n *   contramap((user) => user.lastName)\n * )\n *\n * const ordByCreated: Ord<User> = pipe(\n *   D.Ord,\n *   contramap((user) => user.created)\n * )\n *\n * const ordUserByCreatedDescThenLastName = getSemigroup<User>().concat(\n *   reverse(ordByCreated),\n *   ordByLastName\n * )\n *\n * assert.deepStrictEqual(\n *   RA.sort(ordUserByCreatedDescThenLastName)([\n *     { id: 'c', lastName: 'd', created: new Date(1973, 10, 30) },\n *     { id: 'a', lastName: 'b', created: new Date(1973, 10, 30) },\n *     { id: 'e', lastName: 'f', created: new Date(1980, 10, 30) }\n *   ]),\n *   [\n *     { id: 'e', lastName: 'f', created: new Date(1980, 10, 30) },\n *     { id: 'a', lastName: 'b', created: new Date(1973, 10, 30) },\n *     { id: 'c', lastName: 'd', created: new Date(1973, 10, 30) }\n *   ]\n * )\n *\n * @category instances\n * @since 2.0.0\n */\nvar getSemigroup = function () { return ({\n    concat: function (first, second) {\n        return (0, exports.fromCompare)(function (a, b) {\n            var ox = first.compare(a, b);\n            return ox !== 0 ? ox : second.compare(a, b);\n        });\n    }\n}); };\nexports.getSemigroup = getSemigroup;\n/**\n * Returns a `Monoid` such that:\n *\n * - its `concat(ord1, ord2)` operation will order first by `ord1`, and then by `ord2`\n * - its `empty` value is an `Ord` that always considers compared elements equal\n *\n * @example\n * import { sort } from 'fp-ts/Array'\n * import { contramap, reverse, getMonoid } from 'fp-ts/Ord'\n * import * as S from 'fp-ts/string'\n * import * as B from 'fp-ts/boolean'\n * import { pipe } from 'fp-ts/function'\n * import { concatAll } from 'fp-ts/Monoid'\n * import * as N from 'fp-ts/number'\n *\n * interface User {\n *   readonly id: number\n *   readonly name: string\n *   readonly age: number\n *   readonly rememberMe: boolean\n * }\n *\n * const byName = pipe(\n *   S.Ord,\n *   contramap((p: User) => p.name)\n * )\n *\n * const byAge = pipe(\n *   N.Ord,\n *   contramap((p: User) => p.age)\n * )\n *\n * const byRememberMe = pipe(\n *   B.Ord,\n *   contramap((p: User) => p.rememberMe)\n * )\n *\n * const M = getMonoid<User>()\n *\n * const users: Array<User> = [\n *   { id: 1, name: 'Guido', age: 47, rememberMe: false },\n *   { id: 2, name: 'Guido', age: 46, rememberMe: true },\n *   { id: 3, name: 'Giulio', age: 44, rememberMe: false },\n *   { id: 4, name: 'Giulio', age: 44, rememberMe: true }\n * ]\n *\n * // sort by name, then by age, then by `rememberMe`\n * const O1 = concatAll(M)([byName, byAge, byRememberMe])\n * assert.deepStrictEqual(sort(O1)(users), [\n *   { id: 3, name: 'Giulio', age: 44, rememberMe: false },\n *   { id: 4, name: 'Giulio', age: 44, rememberMe: true },\n *   { id: 2, name: 'Guido', age: 46, rememberMe: true },\n *   { id: 1, name: 'Guido', age: 47, rememberMe: false }\n * ])\n *\n * // now `rememberMe = true` first, then by name, then by age\n * const O2 = concatAll(M)([reverse(byRememberMe), byName, byAge])\n * assert.deepStrictEqual(sort(O2)(users), [\n *   { id: 4, name: 'Giulio', age: 44, rememberMe: true },\n *   { id: 2, name: 'Guido', age: 46, rememberMe: true },\n *   { id: 3, name: 'Giulio', age: 44, rememberMe: false },\n *   { id: 1, name: 'Guido', age: 47, rememberMe: false }\n * ])\n *\n * @category instances\n * @since 2.4.0\n */\nvar getMonoid = function () { return ({\n    concat: (0, exports.getSemigroup)().concat,\n    empty: (0, exports.fromCompare)(function () { return 0; })\n}); };\nexports.getMonoid = getMonoid;\n/**\n * @category instances\n * @since 2.7.0\n */\nexports.Contravariant = {\n    URI: exports.URI,\n    contramap: contramap_\n};\n// -------------------------------------------------------------------------------------\n// utils\n// -------------------------------------------------------------------------------------\n/**\n * @since 2.11.0\n */\nexports.trivial = {\n    equals: function_1.constTrue,\n    compare: /*#__PURE__*/ (0, function_1.constant)(0)\n};\n/**\n * @since 2.11.0\n */\nvar equals = function (O) {\n    return function (second) {\n        return function (first) {\n            return first === second || O.compare(first, second) === 0;\n        };\n    };\n};\nexports.equals = equals;\n// TODO: curry in v3\n/**\n * Test whether one value is _strictly less than_ another\n *\n * @since 2.0.0\n */\nvar lt = function (O) {\n    return function (first, second) {\n        return O.compare(first, second) === -1;\n    };\n};\nexports.lt = lt;\n// TODO: curry in v3\n/**\n * Test whether one value is _strictly greater than_ another\n *\n * @since 2.0.0\n */\nvar gt = function (O) {\n    return function (first, second) {\n        return O.compare(first, second) === 1;\n    };\n};\nexports.gt = gt;\n// TODO: curry in v3\n/**\n * Test whether one value is _non-strictly less than_ another\n *\n * @since 2.0.0\n */\nvar leq = function (O) {\n    return function (first, second) {\n        return O.compare(first, second) !== 1;\n    };\n};\nexports.leq = leq;\n// TODO: curry in v3\n/**\n * Test whether one value is _non-strictly greater than_ another\n *\n * @since 2.0.0\n */\nvar geq = function (O) {\n    return function (first, second) {\n        return O.compare(first, second) !== -1;\n    };\n};\nexports.geq = geq;\n// TODO: curry in v3\n/**\n * Take the minimum of two values. If they are considered equal, the first argument is chosen\n *\n * @since 2.0.0\n */\nvar min = function (O) {\n    return function (first, second) {\n        return first === second || O.compare(first, second) < 1 ? first : second;\n    };\n};\nexports.min = min;\n// TODO: curry in v3\n/**\n * Take the maximum of two values. If they are considered equal, the first argument is chosen\n *\n * @since 2.0.0\n */\nvar max = function (O) {\n    return function (first, second) {\n        return first === second || O.compare(first, second) > -1 ? first : second;\n    };\n};\nexports.max = max;\n/**\n * Clamp a value between a minimum and a maximum\n *\n * @since 2.0.0\n */\nvar clamp = function (O) {\n    var minO = (0, exports.min)(O);\n    var maxO = (0, exports.max)(O);\n    return function (low, hi) { return function (a) { return maxO(minO(a, hi), low); }; };\n};\nexports.clamp = clamp;\n/**\n * Test whether a value is between a minimum and a maximum (inclusive)\n *\n * @since 2.0.0\n */\nvar between = function (O) {\n    var ltO = (0, exports.lt)(O);\n    var gtO = (0, exports.gt)(O);\n    return function (low, hi) { return function (a) { return ltO(a, low) || gtO(a, hi) ? false : true; }; };\n};\nexports.between = between;\n// -------------------------------------------------------------------------------------\n// deprecated\n// -------------------------------------------------------------------------------------\n/**\n * Use [`tuple`](#tuple) instead.\n *\n * @category zone of death\n * @since 2.0.0\n * @deprecated\n */\nexports.getTupleOrd = exports.tuple;\n/**\n * Use [`reverse`](#reverse) instead.\n *\n * @category zone of death\n * @since 2.0.0\n * @deprecated\n */\nexports.getDualOrd = exports.reverse;\n/**\n * Use [`Contravariant`](#contravariant) instead.\n *\n * @category zone of death\n * @since 2.0.0\n * @deprecated\n */\nexports.ord = exports.Contravariant;\n// default compare for primitive types\nfunction compare(first, second) {\n    return first < second ? -1 : first > second ? 1 : 0;\n}\nvar strictOrd = {\n    equals: Eq_1.eqStrict.equals,\n    compare: compare\n};\n/**\n * Use [`Ord`](./boolean.ts.html#ord) instead.\n *\n * @category zone of death\n * @since 2.0.0\n * @deprecated\n */\nexports.ordBoolean = strictOrd;\n/**\n * Use [`Ord`](./string.ts.html#ord) instead.\n *\n * @category zone of death\n * @since 2.0.0\n * @deprecated\n */\nexports.ordString = strictOrd;\n/**\n * Use [`Ord`](./number.ts.html#ord) instead.\n *\n * @category zone of death\n * @since 2.0.0\n * @deprecated\n */\nexports.ordNumber = strictOrd;\n/**\n * Use [`Ord`](./Date.ts.html#ord) instead.\n *\n * @category zone of death\n * @since 2.0.0\n * @deprecated\n */\nexports.ordDate = (0, function_1.pipe)(exports.ordNumber, \n/*#__PURE__*/\n(0, exports.contramap)(function (date) { return date.valueOf(); }));\n"],"names":["require$$0","require$$1","compare"],"mappings":";;;;;;;;;AACA,WAAO,eAAc,SAAU,cAAc,EAAE,OAAO,KAAI,CAAE;AAC5D,YAAkB,UAAA,QAAA,YAAoB,QAAoB,YAAA,QAAA,aAAqB,QAAc,MAAA,QAAA,aAAqB,QAAsB,cAAA,QAAA,UAAkB,QAAgB,QAAA,QAAA,MAAc,QAAc,MAAA,QAAA,MAAc,QAAc,MAAA,QAAA,KAAa,QAAa,KAAA,QAAA,SAAiB,QAAkB,UAAA,QAAA,gBAAwB,QAAoB,YAAA,QAAA,eAAuB,QAAc,MAAA,QAAA,YAAoB,QAAkB,UAAA,QAAA,QAAgB,QAAsB,cAAA,QAAA,gBAAwB;AACpd,QAAI,OAAOA;AACX,QAAI,aAAaC;AAQjB,QAAI,gBAAgB,SAAUC,UAAS;AACnC,aAAO,SAAU,OAAO,QAAQ;AAC5B,eAAO,UAAU,UAAUA,SAAQ,OAAO,MAAM,MAAM;AAAA,MAC9D;AAAA,IACA;AACA,YAAA,gBAAwB;AAQxB,QAAI,cAAc,SAAUA,UAAS;AAAE,aAAQ;AAAA,QAC3C,SAAY,GAAA,QAAQ,eAAeA,QAAO;AAAA,QAC1C,SAAS,SAAU,OAAO,QAAQ;AAAE,iBAAQ,UAAU,SAAS,IAAIA,SAAQ,OAAO,MAAM;AAAA,QAAK;AAAA,MAChG;AAAA;AACD,YAAA,cAAsB;AAoBtB,QAAI,QAAQ,WAAY;AACpB,UAAI,OAAO,CAAA;AACX,eAAS,KAAK,GAAG,KAAK,UAAU,QAAQ,MAAM;AAC1C,aAAK,EAAE,IAAI,UAAU,EAAE;AAAA,MAC1B;AACD,cAAW,GAAA,QAAQ,aAAa,SAAU,OAAO,QAAQ;AACrD,YAAI,IAAI;AACR,eAAO,IAAI,KAAK,SAAS,GAAG,KAAK;AAC7B,cAAI,IAAI,KAAK,CAAC,EAAE,QAAQ,MAAM,CAAC,GAAG,OAAO,CAAC,CAAC;AAC3C,cAAI,MAAM,GAAG;AACT,mBAAO;AAAA,UACV;AAAA,QACJ;AACD,eAAO,KAAK,CAAC,EAAE,QAAQ,MAAM,CAAC,GAAG,OAAO,CAAC,CAAC;AAAA,MAClD,CAAK;AAAA,IACL;AACA,YAAA,QAAgB;AAIhB,QAAI,UAAU,SAAU,GAAG;AAAE,cAAO,GAAI,QAAQ,aAAa,SAAU,OAAO,QAAQ;AAAE,eAAO,EAAE,QAAQ,QAAQ,KAAK;AAAA,MAAE,CAAE;AAAA;AAC1H,YAAA,UAAkB;AAElB,QAAI,aAAa,SAAU,IAAI,GAAG;AAAE,cAAO,GAAI,WAAW,MAAM,KAAQ,GAAA,QAAQ,WAAW,CAAC,CAAC;AAAA,IAAE;AA4C/F,QAAI,YAAY,SAAU,GAAG;AAAE,aAAO,SAAU,IAAI;AAChD,gBAAO,GAAI,QAAQ,aAAa,SAAU,OAAO,QAAQ;AAAE,iBAAO,GAAG,QAAQ,EAAE,KAAK,GAAG,EAAE,MAAM,CAAC;AAAA,QAAE,CAAE;AAAA,MACvG;AAAA;AACD,YAAA,YAAoB;AAKpB,YAAA,MAAc;AAmDd,QAAI,eAAe,WAAY;AAAE,aAAQ;AAAA,QACrC,QAAQ,SAAU,OAAO,QAAQ;AAC7B,kBAAW,GAAA,QAAQ,aAAa,SAAU,GAAG,GAAG;AAC5C,gBAAI,KAAK,MAAM,QAAQ,GAAG,CAAC;AAC3B,mBAAO,OAAO,IAAI,KAAK,OAAO,QAAQ,GAAG,CAAC;AAAA,UACtD,CAAS;AAAA,QACJ;AAAA,MACJ;AAAA;AACD,YAAA,eAAuB;AAoEvB,QAAI,YAAY,WAAY;AAAE,aAAQ;AAAA,QAClC,SAAY,GAAA,QAAQ,cAAY,EAAI;AAAA,QACpC,QAAW,GAAA,QAAQ,aAAa,WAAY;AAAE,iBAAO;AAAA,SAAI;AAAA,MAC5D;AAAA;AACD,YAAA,YAAoB;AAKpB,YAAwB,gBAAA;AAAA,MACpB,KAAK,QAAQ;AAAA,MACb,WAAW;AAAA,IACf;AAOA,YAAkB,UAAA;AAAA,MACd,QAAQ,WAAW;AAAA,MACnB,SAA2B,oBAAA,WAAW,UAAU,CAAC;AAAA,IACrD;AAIA,QAAI,SAAS,SAAU,GAAG;AACtB,aAAO,SAAU,QAAQ;AACrB,eAAO,SAAU,OAAO;AACpB,iBAAO,UAAU,UAAU,EAAE,QAAQ,OAAO,MAAM,MAAM;AAAA,QACpE;AAAA,MACA;AAAA,IACA;AACA,YAAA,SAAiB;AAOjB,QAAI,KAAK,SAAU,GAAG;AAClB,aAAO,SAAU,OAAO,QAAQ;AAC5B,eAAO,EAAE,QAAQ,OAAO,MAAM,MAAM;AAAA,MAC5C;AAAA,IACA;AACA,YAAA,KAAa;AAOb,QAAI,KAAK,SAAU,GAAG;AAClB,aAAO,SAAU,OAAO,QAAQ;AAC5B,eAAO,EAAE,QAAQ,OAAO,MAAM,MAAM;AAAA,MAC5C;AAAA,IACA;AACA,YAAA,KAAa;AAOb,QAAI,MAAM,SAAU,GAAG;AACnB,aAAO,SAAU,OAAO,QAAQ;AAC5B,eAAO,EAAE,QAAQ,OAAO,MAAM,MAAM;AAAA,MAC5C;AAAA,IACA;AACA,YAAA,MAAc;AAOd,QAAI,MAAM,SAAU,GAAG;AACnB,aAAO,SAAU,OAAO,QAAQ;AAC5B,eAAO,EAAE,QAAQ,OAAO,MAAM,MAAM;AAAA,MAC5C;AAAA,IACA;AACA,YAAA,MAAc;AAOd,QAAI,MAAM,SAAU,GAAG;AACnB,aAAO,SAAU,OAAO,QAAQ;AAC5B,eAAO,UAAU,UAAU,EAAE,QAAQ,OAAO,MAAM,IAAI,IAAI,QAAQ;AAAA,MAC1E;AAAA,IACA;AACA,YAAA,MAAc;AAOd,QAAI,MAAM,SAAU,GAAG;AACnB,aAAO,SAAU,OAAO,QAAQ;AAC5B,eAAO,UAAU,UAAU,EAAE,QAAQ,OAAO,MAAM,IAAI,KAAK,QAAQ;AAAA,MAC3E;AAAA,IACA;AACA,YAAA,MAAc;AAMd,QAAI,QAAQ,SAAU,GAAG;AACrB,UAAI,QAAW,GAAA,QAAQ,KAAK,CAAC;AAC7B,UAAI,QAAW,GAAA,QAAQ,KAAK,CAAC;AAC7B,aAAO,SAAU,KAAK,IAAI;AAAE,eAAO,SAAU,GAAG;AAAE,iBAAO,KAAK,KAAK,GAAG,EAAE,GAAG,GAAG;AAAA,QAAE;AAAA,MAAG;AAAA,IACvF;AACA,YAAA,QAAgB;AAMhB,QAAI,UAAU,SAAU,GAAG;AACvB,UAAI,OAAU,GAAA,QAAQ,IAAI,CAAC;AAC3B,UAAI,OAAU,GAAA,QAAQ,IAAI,CAAC;AAC3B,aAAO,SAAU,KAAK,IAAI;AAAE,eAAO,SAAU,GAAG;AAAE,iBAAO,IAAI,GAAG,GAAG,KAAK,IAAI,GAAG,EAAE,IAAI,QAAQ;AAAA,QAAO;AAAA;IACxG;AACA,YAAA,UAAkB;AAWlB,YAAsB,cAAA,QAAQ;AAQ9B,YAAqB,aAAA,QAAQ;AAQ7B,YAAc,MAAA,QAAQ;AAEtB,aAAS,QAAQ,OAAO,QAAQ;AAC5B,aAAO,QAAQ,SAAS,KAAK,QAAQ,SAAS,IAAI;AAAA,IACrD;AACD,QAAI,YAAY;AAAA,MACZ,QAAQ,KAAK,SAAS;AAAA,MACtB;AAAA,IACJ;AAQA,YAAA,aAAqB;AAQrB,YAAA,YAAoB;AAQpB,YAAA,YAAoB;AAQpB,YAAkB,WAAA,GAAI,WAAW;AAAA,MAAM,QAAQ;AAAA,0BAE3C,QAAQ,WAAW,SAAU,MAAM;AAAE,eAAO,KAAK,QAAO;AAAA,MAAK,CAAA;AAAA,IAAC;AAAA;;;","x_google_ignoreList":[0]}

package/dist/_node_modules/fp-ts/lib/Predicate.cjs

@@ -1,84 +0,0 @@
-"use strict";
-Object.defineProperty(exports, Symbol.toStringTag, { value: "Module" });
-const Predicate = require("../../../_virtual/Predicate.cjs");
-const _function = require("./function.cjs");
-var hasRequiredPredicate;
-function requirePredicate() {
-  if (hasRequiredPredicate)
-    return Predicate.__exports;
-  hasRequiredPredicate = 1;
-  (function(exports2) {
-    Object.defineProperty(exports2, "__esModule", { value: true });
-    exports2.and = exports2.or = exports2.not = exports2.Contravariant = exports2.getMonoidAll = exports2.getSemigroupAll = exports2.getMonoidAny = exports2.getSemigroupAny = exports2.URI = exports2.contramap = void 0;
-    var function_1 = _function.__require();
-    var contramap_ = function(predicate, f) {
-      return (0, function_1.pipe)(predicate, (0, exports2.contramap)(f));
-    };
-    var contramap = function(f) {
-      return function(predicate) {
-        return (0, function_1.flow)(f, predicate);
-      };
-    };
-    exports2.contramap = contramap;
-    exports2.URI = "Predicate";
-    var getSemigroupAny = function() {
-      return {
-        concat: function(first, second) {
-          return (0, function_1.pipe)(first, (0, exports2.or)(second));
-        }
-      };
-    };
-    exports2.getSemigroupAny = getSemigroupAny;
-    var getMonoidAny = function() {
-      return {
-        concat: (0, exports2.getSemigroupAny)().concat,
-        empty: function_1.constFalse
-      };
-    };
-    exports2.getMonoidAny = getMonoidAny;
-    var getSemigroupAll = function() {
-      return {
-        concat: function(first, second) {
-          return (0, function_1.pipe)(first, (0, exports2.and)(second));
-        }
-      };
-    };
-    exports2.getSemigroupAll = getSemigroupAll;
-    var getMonoidAll = function() {
-      return {
-        concat: (0, exports2.getSemigroupAll)().concat,
-        empty: function_1.constTrue
-      };
-    };
-    exports2.getMonoidAll = getMonoidAll;
-    exports2.Contravariant = {
-      URI: exports2.URI,
-      contramap: contramap_
-    };
-    var not = function(predicate) {
-      return function(a) {
-        return !predicate(a);
-      };
-    };
-    exports2.not = not;
-    var or = function(second) {
-      return function(first) {
-        return function(a) {
-          return first(a) || second(a);
-        };
-      };
-    };
-    exports2.or = or;
-    var and = function(second) {
-      return function(first) {
-        return function(a) {
-          return first(a) && second(a);
-        };
-      };
-    };
-    exports2.and = and;
-  })(Predicate.__exports);
-  return Predicate.__exports;
-}
-exports.__require = requirePredicate;
-//# sourceMappingURL=Predicate.cjs.map