@slicemachine/manager 0.22.2-alpha.dani-snippets.7 → 0.22.2-alpha.dani-repeatable-links-codegen.1

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

@@ -0,0 +1 @@
+{"version":3,"file":"Option.cjs","sources":["../../../../../../node_modules/fp-ts/es6/Option.js"],"sourcesContent":["import { getApplicativeMonoid } from './Applicative';\nimport { apFirst as apFirst_, apS as apS_, apSecond as apSecond_, getApplySemigroup as getApplySemigroup_ } from './Apply';\nimport * as chainable from './Chain';\nimport { chainEitherK as chainEitherK_, fromEitherK as fromEitherK_, tapEither as tapEither_ } from './FromEither';\nimport { constNull, constUndefined, dual, flow, identity, pipe } from './function';\nimport { as as as_, asUnit as asUnit_, bindTo as bindTo_, flap as flap_, let as let__ } from './Functor';\nimport * as _ from './internal';\nimport { not } from './Predicate';\nimport { first, last } from './Semigroup';\nimport { separated } from './Separated';\nimport { wiltDefault, witherDefault } from './Witherable';\nimport { guard as guard_ } from './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 */\nexport var none = _.none;\n/**\n * Constructs a `Some`. Represents an optional value that exists.\n *\n * @category constructors\n * @since 2.0.0\n */\nexport var some = _.some;\nexport function fromPredicate(predicate) {\n    return function (a) { return (predicate(a) ? some(a) : none); };\n}\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 */\nexport var getLeft = function (ma) { return (ma._tag === 'Right' ? none : some(ma.left)); };\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 */\nexport var getRight = function (ma) { return (ma._tag === 'Left' ? none : some(ma.right)); };\nvar _map = function (fa, f) { return pipe(fa, map(f)); };\nvar _ap = function (fab, fa) { return pipe(fab, ap(fa)); };\nvar _reduce = function (fa, b, f) { return pipe(fa, reduce(b, f)); };\nvar _foldMap = function (M) {\n    var foldMapM = foldMap(M);\n    return function (fa, f) { return pipe(fa, foldMapM(f)); };\n};\nvar _reduceRight = function (fa, b, f) { return pipe(fa, reduceRight(b, f)); };\nvar _traverse = function (F) {\n    var traverseF = traverse(F);\n    return function (ta, f) { return pipe(ta, traverseF(f)); };\n};\n/* istanbul ignore next */\nvar _alt = function (fa, that) { return pipe(fa, alt(that)); };\nvar _filter = function (fa, predicate) { return pipe(fa, filter(predicate)); };\n/* istanbul ignore next */\nvar _filterMap = function (fa, f) { return pipe(fa, filterMap(f)); };\n/* istanbul ignore next */\nvar _extend = function (wa, f) { return pipe(wa, extend(f)); };\n/* istanbul ignore next */\nvar _partition = function (fa, predicate) {\n    return pipe(fa, partition(predicate));\n};\n/* istanbul ignore next */\nvar _partitionMap = function (fa, f) { return pipe(fa, partitionMap(f)); };\n/**\n * @category type lambdas\n * @since 2.0.0\n */\nexport var URI = 'Option';\n/**\n * @category instances\n * @since 2.0.0\n */\nexport var getShow = function (S) { return ({\n    show: function (ma) { return (isNone(ma) ? 'none' : \"some(\".concat(S.show(ma.value), \")\")); }\n}); };\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 */\nexport var getEq = function (E) { return ({\n    equals: function (x, y) { return x === y || (isNone(x) ? isNone(y) : isNone(y) ? false : E.equals(x.value, y.value)); }\n}); };\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 */\nexport var getOrd = function (O) { return ({\n    equals: getEq(O).equals,\n    compare: function (x, y) { return (x === y ? 0 : isSome(x) ? (isSome(y) ? O.compare(x.value, y.value) : 1) : -1); }\n}); };\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 */\nexport var getMonoid = function (S) { return ({\n    concat: function (x, y) { return (isNone(x) ? y : isNone(y) ? x : some(S.concat(x.value, y.value))); },\n    empty: none\n}); };\n/**\n * @category mapping\n * @since 2.0.0\n */\nexport var map = function (f) { return function (fa) {\n    return isNone(fa) ? none : some(f(fa.value));\n}; };\n/**\n * @category instances\n * @since 2.7.0\n */\nexport var Functor = {\n    URI: URI,\n    map: _map\n};\n/**\n * Maps the `Some` value of this `Option` to the specified constant value.\n *\n * @category mapping\n * @since 2.16.0\n */\nexport var as = dual(2, as_(Functor));\n/**\n * Maps the `Some` value of this `Option` to the void constant value.\n *\n * @category mapping\n * @since 2.16.0\n */\nexport var asUnit = asUnit_(Functor);\n/**\n * @category constructors\n * @since 2.7.0\n */\nexport var of = some;\n/**\n * @category instances\n * @since 2.10.0\n */\nexport var Pointed = {\n    URI: URI,\n    of: of\n};\n/**\n * @since 2.0.0\n */\nexport var ap = function (fa) { return function (fab) {\n    return isNone(fab) ? none : isNone(fa) ? none : some(fab.value(fa.value));\n}; };\n/**\n * @category instances\n * @since 2.10.0\n */\nexport var Apply = {\n    URI: URI,\n    map: _map,\n    ap: _ap\n};\n/**\n * @category instances\n * @since 2.7.0\n */\nexport var Applicative = {\n    URI: URI,\n    map: _map,\n    ap: _ap,\n    of: of\n};\n/**\n * @category sequencing\n * @since 2.14.0\n */\nexport var flatMap = /*#__PURE__*/ dual(2, function (ma, f) { return (isNone(ma) ? none : f(ma.value)); });\n/**\n * @category instances\n * @since 2.10.0\n */\nexport var Chain = {\n    URI: URI,\n    map: _map,\n    ap: _ap,\n    chain: flatMap\n};\n/**\n * @category instances\n * @since 2.7.0\n */\nexport var Monad = {\n    URI: URI,\n    map: _map,\n    ap: _ap,\n    of: of,\n    chain: flatMap\n};\n/**\n * @category folding\n * @since 2.0.0\n */\nexport var reduce = function (b, f) { return function (fa) {\n    return isNone(fa) ? b : f(b, fa.value);\n}; };\n/**\n * @category folding\n * @since 2.0.0\n */\nexport var foldMap = function (M) { return function (f) { return function (fa) {\n    return isNone(fa) ? M.empty : f(fa.value);\n}; }; };\n/**\n * @category folding\n * @since 2.0.0\n */\nexport var reduceRight = function (b, f) { return function (fa) {\n    return isNone(fa) ? b : f(fa.value, b);\n}; };\n/**\n * @category instances\n * @since 2.7.0\n */\nexport var Foldable = {\n    URI: URI,\n    reduce: _reduce,\n    foldMap: _foldMap,\n    reduceRight: _reduceRight\n};\n/**\n * 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 */\nexport var orElse = dual(2, function (self, that) { return (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 */\nexport var altW = orElse;\n/**\n * Alias of `orElse`.\n *\n * @category legacy\n * @since 2.0.0\n */\nexport var alt = orElse;\n/**\n * @category instances\n * @since 2.7.0\n */\nexport var Alt = {\n    URI: URI,\n    map: _map,\n    alt: _alt\n};\n/**\n * @since 2.7.0\n */\nexport var zero = function () { return none; };\n/**\n * @category instances\n * @since 2.11.0\n */\nexport var Zero = {\n    URI: URI,\n    zero: zero\n};\n/**\n * @category do notation\n * @since 2.11.0\n */\nexport var guard = /*#__PURE__*/ guard_(Zero, Pointed);\n/**\n * @category instances\n * @since 2.7.0\n */\nexport var Alternative = {\n    URI: URI,\n    map: _map,\n    ap: _ap,\n    of: of,\n    alt: _alt,\n    zero: zero\n};\n/**\n * @since 2.0.0\n */\nexport var extend = function (f) { return function (wa) {\n    return isNone(wa) ? none : some(f(wa));\n}; };\n/**\n * @category instances\n * @since 2.7.0\n */\nexport var Extend = {\n    URI: URI,\n    map: _map,\n    extend: _extend\n};\n/**\n * @category filtering\n * @since 2.0.0\n */\nexport var compact = /*#__PURE__*/ flatMap(identity);\nvar defaultSeparated = /*#__PURE__*/ separated(none, none);\n/**\n * @category filtering\n * @since 2.0.0\n */\nexport var separate = function (ma) {\n    return isNone(ma) ? defaultSeparated : separated(getLeft(ma.value), getRight(ma.value));\n};\n/**\n * @category instances\n * @since 2.7.0\n */\nexport var Compactable = {\n    URI: URI,\n    compact: compact,\n    separate: separate\n};\n/**\n * @category filtering\n * @since 2.0.0\n */\nexport var filter = function (predicate) {\n    return function (fa) {\n        return isNone(fa) ? none : predicate(fa.value) ? fa : none;\n    };\n};\n/**\n * @category filtering\n * @since 2.0.0\n */\nexport var filterMap = function (f) { return function (fa) {\n    return isNone(fa) ? none : f(fa.value);\n}; };\n/**\n * @category filtering\n * @since 2.0.0\n */\nexport var partition = function (predicate) {\n    return function (fa) {\n        return separated(_filter(fa, not(predicate)), _filter(fa, predicate));\n    };\n};\n/**\n * @category filtering\n * @since 2.0.0\n */\nexport var partitionMap = function (f) { return flow(map(f), separate); };\n/**\n * @category instances\n * @since 2.7.0\n */\nexport var Filterable = {\n    URI: URI,\n    map: _map,\n    compact: compact,\n    separate: separate,\n    filter: _filter,\n    filterMap: _filterMap,\n    partition: _partition,\n    partitionMap: _partitionMap\n};\n/**\n * @category traversing\n * @since 2.6.3\n */\nexport var traverse = function (F) {\n    return function (f) {\n        return function (ta) {\n            return isNone(ta) ? F.of(none) : F.map(f(ta.value), some);\n        };\n    };\n};\n/**\n * @category traversing\n * @since 2.6.3\n */\nexport var sequence = function (F) {\n    return function (ta) {\n        return isNone(ta) ? F.of(none) : F.map(ta.value, some);\n    };\n};\n/**\n * @category instances\n * @since 2.7.0\n */\nexport var Traversable = {\n    URI: URI,\n    map: _map,\n    reduce: _reduce,\n    foldMap: _foldMap,\n    reduceRight: _reduceRight,\n    traverse: _traverse,\n    sequence: sequence\n};\nvar _wither = /*#__PURE__*/ witherDefault(Traversable, Compactable);\nvar _wilt = /*#__PURE__*/ wiltDefault(Traversable, Compactable);\n/**\n * @category filtering\n * @since 2.6.5\n */\nexport var wither = function (F) {\n    var _witherF = _wither(F);\n    return function (f) { return function (fa) { return _witherF(fa, f); }; };\n};\n/**\n * @category filtering\n * @since 2.6.5\n */\nexport var wilt = function (F) {\n    var _wiltF = _wilt(F);\n    return function (f) { return function (fa) { return _wiltF(fa, f); }; };\n};\n/**\n * @category instances\n * @since 2.7.0\n */\nexport var Witherable = {\n    URI: URI,\n    map: _map,\n    reduce: _reduce,\n    foldMap: _foldMap,\n    reduceRight: _reduceRight,\n    traverse: _traverse,\n    sequence: sequence,\n    compact: compact,\n    separate: 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 */\nexport var throwError = function () { return none; };\n/**\n * @category instances\n * @since 2.7.0\n */\nexport var MonadThrow = {\n    URI: URI,\n    map: _map,\n    ap: _ap,\n    of: of,\n    chain: flatMap,\n    throwError: throwError\n};\n/**\n * 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 */\nexport var fromEither = getRight;\n/**\n * @category instances\n * @since 2.11.0\n */\nexport var FromEither = {\n    URI: URI,\n    fromEither: 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 */\nexport var 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 */\nexport var isNone = function (fa) { return fa._tag === 'None'; };\n/**\n * Less strict version of [`match`](#match).\n *\n * The `W` suffix (short for **W**idening) means that the handler return types will be merged.\n *\n * @category pattern matching\n * @since 2.10.0\n */\nexport var matchW = function (onNone, onSome) {\n    return function (ma) {\n        return isNone(ma) ? onNone() : onSome(ma.value);\n    };\n};\n/**\n * Alias of [`matchW`](#matchw).\n *\n * @category pattern matching\n * @since 2.10.0\n */\nexport var foldW = matchW;\n/**\n * Takes 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 */\nexport var match = matchW;\n/**\n * Alias of [`match`](#match).\n *\n * @category pattern matching\n * @since 2.0.0\n */\nexport var fold = match;\n/**\n * Less strict version of [`getOrElse`](#getorelse).\n *\n * The `W` suffix (short for **W**idening) means that the handler return type will be merged.\n *\n * @category error handling\n * @since 2.6.0\n */\nexport var getOrElseW = function (onNone) {\n    return function (ma) {\n        return isNone(ma) ? onNone() : ma.value;\n    };\n};\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 */\nexport var getOrElse = getOrElseW;\n/**\n * @category mapping\n * @since 2.10.0\n */\nexport var flap = /*#__PURE__*/ flap_(Functor);\n/**\n * Combine two effectful actions, keeping only the result of the first.\n *\n * @since 2.0.0\n */\nexport var apFirst = /*#__PURE__*/ apFirst_(Apply);\n/**\n * Combine two effectful actions, keeping only the result of the second.\n *\n * @since 2.0.0\n */\nexport var apSecond = /*#__PURE__*/ apSecond_(Apply);\n/**\n * @category sequencing\n * @since 2.0.0\n */\nexport var flatten = 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 */\nexport var tap = /*#__PURE__*/ dual(2, chainable.tap(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 */\nexport var tapEither = /*#__PURE__*/ dual(2, tapEither_(FromEither, Chain));\n/**\n * @since 2.0.0\n */\nexport var duplicate = /*#__PURE__*/ extend(identity);\n/**\n * @category lifting\n * @since 2.11.0\n */\nexport var fromEitherK = /*#__PURE__*/ fromEitherK_(FromEither);\n/**\n * @category sequencing\n * @since 2.11.0\n */\nexport var chainEitherK = \n/*#__PURE__*/ chainEitherK_(FromEither, Chain);\n/**\n * Alias of `tapEither`.\n *\n * @category legacy\n * @since 2.12.0\n */\nexport var chainFirstEitherK = 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 */\nexport var fromNullable = function (a) { return (a == null ? none : some(a)); };\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 */\nexport var tryCatch = function (f) {\n    try {\n        return some(f());\n    }\n    catch (e) {\n        return none;\n    }\n};\n/**\n * Converts a function that may throw to one returning a `Option`.\n *\n * @category interop\n * @since 2.10.0\n */\nexport var 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 tryCatch(function () { return f.apply(void 0, a); });\n    };\n};\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 */\nexport var fromNullableK = function (f) { return flow(f, fromNullable); };\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 */\nexport var chainNullableK = function (f) {\n    return function (ma) {\n        return isNone(ma) ? none : fromNullable(f(ma.value));\n    };\n};\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 */\nexport var toNullable = /*#__PURE__*/ match(constNull, 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 */\nexport var toUndefined = /*#__PURE__*/ match(constUndefined, identity);\nexport function elem(E) {\n    return function (a, ma) {\n        if (ma === undefined) {\n            var elemE_1 = elem(E);\n            return function (ma) { return elemE_1(a, ma); };\n        }\n        return isNone(ma) ? false : E.equals(a, ma.value);\n    };\n}\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 */\nexport var exists = function (predicate) {\n    return function (ma) {\n        return isNone(ma) ? false : predicate(ma.value);\n    };\n};\n// -------------------------------------------------------------------------------------\n// do notation\n// -------------------------------------------------------------------------------------\n/**\n * @category do notation\n * @since 2.9.0\n */\nexport var Do = /*#__PURE__*/ of(_.emptyRecord);\n/**\n * @category do notation\n * @since 2.8.0\n */\nexport var bindTo = /*#__PURE__*/ bindTo_(Functor);\nvar let_ = /*#__PURE__*/ let__(Functor);\nexport { \n/**\n * @category do notation\n * @since 2.13.0\n */\nlet_ as let };\n/**\n * @category do notation\n * @since 2.8.0\n */\nexport var bind = /*#__PURE__*/ chainable.bind(Chain);\n/**\n * @category do notation\n * @since 2.8.0\n */\nexport var apS = /*#__PURE__*/ apS_(Apply);\n/**\n * @since 2.11.0\n */\nexport var ApT = /*#__PURE__*/ of(_.emptyReadonlyArray);\n// -------------------------------------------------------------------------------------\n// array utils\n// -------------------------------------------------------------------------------------\n/**\n * Equivalent to `ReadonlyNonEmptyArray#traverseWithIndex(Applicative)`.\n *\n * @category traversing\n * @since 2.11.0\n */\nexport var traverseReadonlyNonEmptyArrayWithIndex = function (f) {\n    return function (as) {\n        var o = f(0, _.head(as));\n        if (isNone(o)) {\n            return 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 (isNone(o_1)) {\n                return none;\n            }\n            out.push(o_1.value);\n        }\n        return some(out);\n    };\n};\n/**\n * Equivalent to `ReadonlyArray#traverseWithIndex(Applicative)`.\n *\n * @category traversing\n * @since 2.11.0\n */\nexport var traverseReadonlyArrayWithIndex = function (f) {\n    var g = traverseReadonlyNonEmptyArrayWithIndex(f);\n    return function (as) { return (_.isNonEmpty(as) ? g(as) : ApT); };\n};\n/**\n * Equivalent to `ReadonlyArray#traverseWithIndex(Applicative)`.\n *\n * @category traversing\n * @since 2.9.0\n */\nexport var traverseArrayWithIndex = traverseReadonlyArrayWithIndex;\n/**\n * Equivalent to `ReadonlyArray#traverse(Applicative)`.\n *\n * @category traversing\n * @since 2.9.0\n */\nexport var traverseArray = function (f) {\n    return traverseReadonlyArrayWithIndex(function (_, a) { return f(a); });\n};\n/**\n * Equivalent to `ReadonlyArray#sequence(Applicative)`.\n *\n * @category traversing\n * @since 2.9.0\n */\nexport var sequenceArray = \n/*#__PURE__*/ traverseArray(identity);\n// -------------------------------------------------------------------------------------\n// legacy\n// -------------------------------------------------------------------------------------\n/**\n * Alias of `flatMap`.\n *\n * @category legacy\n * @since 2.0.0\n */\nexport var chain = flatMap;\n/**\n * Alias of `tap`.\n *\n * @category legacy\n * @since 2.0.0\n */\nexport var chainFirst = tap;\n// -------------------------------------------------------------------------------------\n// deprecated\n// -------------------------------------------------------------------------------------\n/**\n * Use `Refinement` module instead.\n *\n * @category zone of death\n * @since 2.0.0\n * @deprecated\n */\nexport function getRefinement(getOption) {\n    return function (a) { return isSome(getOption(a)); };\n}\n/**\n * Use [`chainNullableK`](#chainnullablek) instead.\n *\n * @category zone of death\n * @since 2.0.0\n * @deprecated\n */\nexport var mapNullable = 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 */\nexport var option = {\n    URI: URI,\n    map: _map,\n    of: of,\n    ap: _ap,\n    chain: flatMap,\n    reduce: _reduce,\n    foldMap: _foldMap,\n    reduceRight: _reduceRight,\n    traverse: _traverse,\n    sequence: sequence,\n    zero: zero,\n    alt: _alt,\n    extend: _extend,\n    compact: compact,\n    separate: separate,\n    filter: _filter,\n    filterMap: _filterMap,\n    partition: _partition,\n    partitionMap: _partitionMap,\n    wither: _wither,\n    wilt: _wilt,\n    throwError: 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 */\nexport var getApplySemigroup = /*#__PURE__*/ getApplySemigroup_(Apply);\n/**\n * Use [`getApplicativeMonoid`](./Applicative.ts.html#getapplicativemonoid) instead.\n *\n * @category zone of death\n * @since 2.0.0\n * @deprecated\n */\nexport var getApplyMonoid = /*#__PURE__*/ getApplicativeMonoid(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 */\nexport var getFirstMonoid = function () { return getMonoid(first()); };\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 */\nexport var getLastMonoid = function () { return getMonoid(last()); };\n"],"names":["_.none","_.some","pipe","dual","as_","asUnit_","guard_","identity","separated","not","flow","witherDefault","wiltDefault","_.isSome","flap_","apFirst_","apSecond_","chainable.tap","tapEither_","fromEitherK_","chainEitherK_","constNull","constUndefined","ma","_.emptyRecord","bindTo_","let__","chainable.bind","apS_","_.emptyReadonlyArray","as","_.head","_.isNonEmpty","getApplySemigroup_","getApplicativeMonoid","first","last"],"mappings":";;;;;;;;;;;;;;AAqBU,IAAC,OAAOA,SAAO;AAOf,IAAC,OAAOC,SAAO;AAClB,SAAS,cAAc,WAAW;AACrC,SAAO,SAAU,GAAG;AAAE,WAAQ,UAAU,CAAC,IAAI,KAAK,CAAC,IAAI;AAAA;AAC3D;AAcU,IAAC,UAAU,SAAU,IAAI;AAAE,SAAQ,GAAG,SAAS,UAAU,OAAO,KAAK,GAAG,IAAI;AAAM;AAclF,IAAC,WAAW,SAAU,IAAI;AAAE,SAAQ,GAAG,SAAS,SAAS,OAAO,KAAK,GAAG,KAAK;AAAM;AAC7F,IAAI,OAAO,SAAU,IAAI,GAAG;AAAE,SAAOC,UAAAA,KAAK,IAAI,IAAI,CAAC,CAAC;;AACpD,IAAI,MAAM,SAAU,KAAK,IAAI;AAAE,SAAOA,UAAAA,KAAK,KAAK,GAAG,EAAE,CAAC;;AACtD,IAAI,UAAU,SAAU,IAAI,GAAG,GAAG;AAAE,SAAOA,UAAAA,KAAK,IAAI,OAAO,GAAG,CAAC,CAAC;AAAE;AAClE,IAAI,WAAW,SAAU,GAAG;AACxB,MAAI,WAAW,QAAQ,CAAC;AACxB,SAAO,SAAU,IAAI,GAAG;AAAE,WAAOA,UAAAA,KAAK,IAAI,SAAS,CAAC,CAAC;AAAA;AACzD;AACA,IAAI,eAAe,SAAU,IAAI,GAAG,GAAG;AAAE,SAAOA,UAAAA,KAAK,IAAI,YAAY,GAAG,CAAC,CAAC;AAAE;AAC5E,IAAI,YAAY,SAAU,GAAG;AACzB,MAAI,YAAY,SAAS,CAAC;AAC1B,SAAO,SAAU,IAAI,GAAG;AAAE,WAAOA,UAAAA,KAAK,IAAI,UAAU,CAAC,CAAC;AAAA;AAC1D;AAEA,IAAI,OAAO,SAAU,IAAI,MAAM;AAAE,SAAOA,UAAAA,KAAK,IAAI,IAAI,IAAI,CAAC;;AAC1D,IAAI,UAAU,SAAU,IAAI,WAAW;AAAE,SAAOA,UAAAA,KAAK,IAAI,OAAO,SAAS,CAAC;;AAE1E,IAAI,aAAa,SAAU,IAAI,GAAG;AAAE,SAAOA,UAAAA,KAAK,IAAI,UAAU,CAAC,CAAC;;AAEhE,IAAI,UAAU,SAAU,IAAI,GAAG;AAAE,SAAOA,UAAAA,KAAK,IAAI,OAAO,CAAC,CAAC;;AAE1D,IAAI,aAAa,SAAU,IAAI,WAAW;AACtC,SAAOA,UAAI,KAAC,IAAI,UAAU,SAAS,CAAC;AACxC;AAEA,IAAI,gBAAgB,SAAU,IAAI,GAAG;AAAE,SAAOA,UAAAA,KAAK,IAAI,aAAa,CAAC,CAAC;;AAK5D,IAAC,MAAM;AAKP,IAAC,UAAU,SAAU,GAAG;AAAE,SAAQ;AAAA,IACxC,MAAM,SAAU,IAAI;AAAE,aAAQ,OAAO,EAAE,IAAI,SAAS,QAAQ,OAAO,EAAE,KAAK,GAAG,KAAK,GAAG,GAAG;AAAA,IAAK;AAAA,EACjG;AAAM;AAgBI,IAAC,QAAQ,SAAU,GAAG;AAAE,SAAQ;AAAA,IACtC,QAAQ,SAAU,GAAG,GAAG;AAAE,aAAO,MAAM,MAAM,OAAO,CAAC,IAAI,OAAO,CAAC,IAAI,OAAO,CAAC,IAAI,QAAQ,EAAE,OAAO,EAAE,OAAO,EAAE,KAAK;AAAA,IAAK;AAAA,EAC3H;AAAM;AAuBI,IAAC,SAAS,SAAU,GAAG;AAAE,SAAQ;AAAA,IACvC,QAAQ,MAAM,CAAC,EAAE;AAAA,IACjB,SAAS,SAAU,GAAG,GAAG;AAAE,aAAQ,MAAM,IAAI,IAAI,OAAO,CAAC,IAAK,OAAO,CAAC,IAAI,EAAE,QAAQ,EAAE,OAAO,EAAE,KAAK,IAAI,IAAK;AAAA,IAAM;AAAA,EACvH;AAAM;AAyBI,IAAC,YAAY,SAAU,GAAG;AAAE,SAAQ;AAAA,IAC1C,QAAQ,SAAU,GAAG,GAAG;AAAE,aAAQ,OAAO,CAAC,IAAI,IAAI,OAAO,CAAC,IAAI,IAAI,KAAK,EAAE,OAAO,EAAE,OAAO,EAAE,KAAK,CAAC;AAAA,IAAK;AAAA,IACtG,OAAO;AAAA,EACX;AAAM;AAKI,IAAC,MAAM,SAAU,GAAG;AAAE,SAAO,SAAU,IAAI;AACjD,WAAO,OAAO,EAAE,IAAI,OAAO,KAAK,EAAE,GAAG,KAAK,CAAC;AAAA,EAC/C;AAAK;AAKK,IAAC,UAAU;AAAA,EACjB;AAAA,EACA,KAAK;AACT;AAOU,IAAC,KAAKC,UAAAA,KAAK,GAAGC,UAAG,GAAC,OAAO,CAAC;AAO1B,IAAC,SAASC,UAAO,OAAC,OAAO;AAKzB,IAAC,KAAK;AAKN,IAAC,UAAU;AAAA,EACjB;AAAA,EACA;AACJ;AAIU,IAAC,KAAK,SAAU,IAAI;AAAE,SAAO,SAAU,KAAK;AAClD,WAAO,OAAO,GAAG,IAAI,OAAO,OAAO,EAAE,IAAI,OAAO,KAAK,IAAI,MAAM,GAAG,KAAK,CAAC;AAAA,EAC5E;AAAK;AAKK,IAAC,QAAQ;AAAA,EACf;AAAA,EACA,KAAK;AAAA,EACL,IAAI;AACR;AAKU,IAAC,cAAc;AAAA,EACrB;AAAA,EACA,KAAK;AAAA,EACL,IAAI;AAAA,EACJ;AACJ;AAKU,IAAC,UAAwBF,0BAAI,KAAC,GAAG,SAAU,IAAI,GAAG;AAAE,SAAQ,OAAO,EAAE,IAAI,OAAO,EAAE,GAAG,KAAK;AAAG,CAAE;AAK/F,IAAC,QAAQ;AAAA,EACf;AAAA,EACA,KAAK;AAAA,EACL,IAAI;AAAA,EACJ,OAAO;AACX;AAKU,IAAC,QAAQ;AAAA,EACf;AAAA,EACA,KAAK;AAAA,EACL,IAAI;AAAA,EACJ;AAAA,EACA,OAAO;AACX;AAKU,IAAC,SAAS,SAAU,GAAG,GAAG;AAAE,SAAO,SAAU,IAAI;AACvD,WAAO,OAAO,EAAE,IAAI,IAAI,EAAE,GAAG,GAAG,KAAK;AAAA,EACzC;AAAK;AAKK,IAAC,UAAU,SAAU,GAAG;AAAE,SAAO,SAAU,GAAG;AAAE,WAAO,SAAU,IAAI;AAC3E,aAAO,OAAO,EAAE,IAAI,EAAE,QAAQ,EAAE,GAAG,KAAK;AAAA,IAC5C;AAAA,EAAI;AAAI;AAKE,IAAC,cAAc,SAAU,GAAG,GAAG;AAAE,SAAO,SAAU,IAAI;AAC5D,WAAO,OAAO,EAAE,IAAI,IAAI,EAAE,GAAG,OAAO,CAAC;AAAA,EACzC;AAAK;AAKK,IAAC,WAAW;AAAA,EAClB;AAAA,EACA,QAAQ;AAAA,EACR,SAAS;AAAA,EACT,aAAa;AACjB;AAkBU,IAAC,SAASA,UAAAA,KAAK,GAAG,SAAU,MAAM,MAAM;AAAE,SAAQ,OAAO,IAAI,IAAI,SAAS;AAAM,CAAE;AAWlF,IAAC,OAAO;AAOR,IAAC,MAAM;AAKP,IAAC,MAAM;AAAA,EACb;AAAA,EACA,KAAK;AAAA,EACL,KAAK;AACT;AAIU,IAAC,OAAO,WAAY;AAAE,SAAO;AAAQ;AAKrC,IAAC,OAAO;AAAA,EACd;AAAA,EACA;AACJ;AAKU,IAAC,QAAsBG,uBAAAA,MAAO,MAAM,OAAO;AAK3C,IAAC,cAAc;AAAA,EACrB;AAAA,EACA,KAAK;AAAA,EACL,IAAI;AAAA,EACJ;AAAA,EACA,KAAK;AAAA,EACL;AACJ;AAIU,IAAC,SAAS,SAAU,GAAG;AAAE,SAAO,SAAU,IAAI;AACpD,WAAO,OAAO,EAAE,IAAI,OAAO,KAAK,EAAE,EAAE,CAAC;AAAA,EACzC;AAAK;AAKK,IAAC,SAAS;AAAA,EAChB;AAAA,EACA,KAAK;AAAA,EACL,QAAQ;AACZ;AAKU,IAAC,UAAwB,wBAAQC,kBAAQ;AACnD,IAAI,mBAAiCC,0BAAS,UAAC,MAAM,IAAI;AAK/C,IAAC,WAAW,SAAU,IAAI;AAChC,SAAO,OAAO,EAAE,IAAI,mBAAmBA,UAAS,UAAC,QAAQ,GAAG,KAAK,GAAG,SAAS,GAAG,KAAK,CAAC;AAC1F;AAKU,IAAC,cAAc;AAAA,EACrB;AAAA,EACA;AAAA,EACA;AACJ;AAKU,IAAC,SAAS,SAAU,WAAW;AACrC,SAAO,SAAU,IAAI;AACjB,WAAO,OAAO,EAAE,IAAI,OAAO,UAAU,GAAG,KAAK,IAAI,KAAK;AAAA,EAC9D;AACA;AAKU,IAAC,YAAY,SAAU,GAAG;AAAE,SAAO,SAAU,IAAI;AACvD,WAAO,OAAO,EAAE,IAAI,OAAO,EAAE,GAAG,KAAK;AAAA,EACzC;AAAK;AAKK,IAAC,YAAY,SAAU,WAAW;AACxC,SAAO,SAAU,IAAI;AACjB,WAAOA,oBAAU,QAAQ,IAAIC,cAAI,SAAS,CAAC,GAAG,QAAQ,IAAI,SAAS,CAAC;AAAA,EAC5E;AACA;AAKU,IAAC,eAAe,SAAU,GAAG;AAAE,SAAOC,UAAAA,KAAK,IAAI,CAAC,GAAG,QAAQ;AAAK;AAKhE,IAAC,aAAa;AAAA,EACpB;AAAA,EACA,KAAK;AAAA,EACL;AAAA,EACA;AAAA,EACA,QAAQ;AAAA,EACR,WAAW;AAAA,EACX,WAAW;AAAA,EACX,cAAc;AAClB;AAKU,IAAC,WAAW,SAAU,GAAG;AAC/B,SAAO,SAAU,GAAG;AAChB,WAAO,SAAU,IAAI;AACjB,aAAO,OAAO,EAAE,IAAI,EAAE,GAAG,IAAI,IAAI,EAAE,IAAI,EAAE,GAAG,KAAK,GAAG,IAAI;AAAA,IACpE;AAAA,EACA;AACA;AAKU,IAAC,WAAW,SAAU,GAAG;AAC/B,SAAO,SAAU,IAAI;AACjB,WAAO,OAAO,EAAE,IAAI,EAAE,GAAG,IAAI,IAAI,EAAE,IAAI,GAAG,OAAO,IAAI;AAAA,EAC7D;AACA;AAKU,IAAC,cAAc;AAAA,EACrB;AAAA,EACA,KAAK;AAAA,EACL,QAAQ;AAAA,EACR,SAAS;AAAA,EACT,aAAa;AAAA,EACb,UAAU;AAAA,EACV;AACJ;AACA,IAAI,UAAwBC,6BAAa,cAAC,aAAa,WAAW;AAClE,IAAI,QAAsBC,6BAAW,YAAC,aAAa,WAAW;AAKpD,IAAC,SAAS,SAAU,GAAG;AAC7B,MAAI,WAAW,QAAQ,CAAC;AACxB,SAAO,SAAU,GAAG;AAAE,WAAO,SAAU,IAAI;AAAE,aAAO,SAAS,IAAI,CAAC;AAAA,IAAE;AAAA,EAAG;AAC3E;AAKU,IAAC,OAAO,SAAU,GAAG;AAC3B,MAAI,SAAS,MAAM,CAAC;AACpB,SAAO,SAAU,GAAG;AAAE,WAAO,SAAU,IAAI;AAAE,aAAO,OAAO,IAAI,CAAC;AAAA,IAAE;AAAA,EAAG;AACzE;AAKU,IAAC,aAAa;AAAA,EACpB;AAAA,EACA,KAAK;AAAA,EACL,QAAQ;AAAA,EACR,SAAS;AAAA,EACT,aAAa;AAAA,EACb,UAAU;AAAA,EACV;AAAA,EACA;AAAA,EACA;AAAA,EACA,QAAQ;AAAA,EACR,WAAW;AAAA,EACX,WAAW;AAAA,EACX,cAAc;AAAA,EACd,QAAQ;AAAA,EACR,MAAM;AACV;AAIU,IAAC,aAAa,WAAY;AAAE,SAAO;AAAQ;AAK3C,IAAC,aAAa;AAAA,EACpB;AAAA,EACA,KAAK;AAAA,EACL,IAAI;AAAA,EACJ;AAAA,EACA,OAAO;AAAA,EACP;AACJ;AASU,IAAC,aAAa;AAKd,IAAC,aAAa;AAAA,EACpB;AAAA,EACA;AACJ;AAgBU,IAAC,SAASC,SAAS;AAanB,IAAC,SAAS,SAAU,IAAI;AAAE,SAAO,GAAG,SAAS;AAAU;AASvD,IAAC,SAAS,SAAU,QAAQ,QAAQ;AAC1C,SAAO,SAAU,IAAI;AACjB,WAAO,OAAO,EAAE,IAAI,OAAQ,IAAG,OAAO,GAAG,KAAK;AAAA,EACtD;AACA;AAOU,IAAC,QAAQ;AA4BT,IAAC,QAAQ;AAOT,IAAC,OAAO;AASR,IAAC,aAAa,SAAU,QAAQ;AACtC,SAAO,SAAU,IAAI;AACjB,WAAO,OAAO,EAAE,IAAI,OAAM,IAAK,GAAG;AAAA,EAC1C;AACA;AA0BU,IAAC,YAAY;AAKb,IAAC,OAAqBC,0BAAK,KAAC,OAAO;AAMnC,IAAC,UAAwBC,wBAAQ,QAAC,KAAK;AAMvC,IAAC,WAAyBC,wBAAS,SAAC,KAAK;AAKzC,IAAC,UAAU;AAQX,IAAC,MAAoBb,0BAAAA,KAAK,GAAGc,QAAa,IAAC,KAAK,CAAC;AAqBjD,IAAC,YAA0Bd,0BAAI,KAAC,GAAGe,aAAU,UAAC,YAAY,KAAK,CAAC;AAIhE,IAAC,YAA0B,uBAAOX,kBAAQ;AAK1C,IAAC,cAA4BY,6BAAY,YAAC,UAAU;AAKpD,IAAC,eACGC,6BAAa,aAAC,YAAY,KAAK;AAOnC,IAAC,oBAAoB;AAerB,IAAC,eAAe,SAAU,GAAG;AAAE,SAAQ,KAAK,OAAO,OAAO,KAAK,CAAC;AAAM;AAqBtE,IAAC,WAAW,SAAU,GAAG;AAC/B,MAAI;AACA,WAAO,KAAK,EAAC,CAAE;AAAA,EAClB,SACM,GAAP;AACI,WAAO;AAAA,EACV;AACL;AAOU,IAAC,YAAY,SAAU,GAAG;AAChC,SAAO,WAAY;AACf,QAAI,IAAI,CAAA;AACR,aAAS,KAAK,GAAG,KAAK,UAAU,QAAQ,MAAM;AAC1C,QAAE,EAAE,IAAI,UAAU,EAAE;AAAA,IACvB;AACD,WAAO,SAAS,WAAY;AAAE,aAAO,EAAE,MAAM,QAAQ,CAAC;AAAA,IAAE,CAAE;AAAA,EAClE;AACA;AAoBU,IAAC,gBAAgB,SAAU,GAAG;AAAE,SAAOV,UAAI,KAAC,GAAG,YAAY;AAAK;AA6ChE,IAAC,iBAAiB,SAAU,GAAG;AACrC,SAAO,SAAU,IAAI;AACjB,WAAO,OAAO,EAAE,IAAI,OAAO,aAAa,EAAE,GAAG,KAAK,CAAC;AAAA,EAC3D;AACA;AA0BU,IAAC,aAA2B,sBAAMW,UAAS,WAAEd,kBAAQ;AA0BrD,IAAC,cAA4B,sBAAMe,UAAc,gBAAEf,kBAAQ;AAC9D,SAAS,KAAK,GAAG;AACpB,SAAO,SAAU,GAAG,IAAI;AACpB,QAAI,OAAO,QAAW;AAClB,UAAI,UAAU,KAAK,CAAC;AACpB,aAAO,SAAUgB,KAAI;AAAE,eAAO,QAAQ,GAAGA,GAAE;AAAA;IAC9C;AACD,WAAO,OAAO,EAAE,IAAI,QAAQ,EAAE,OAAO,GAAG,GAAG,KAAK;AAAA,EACxD;AACA;AAgCU,IAAC,SAAS,SAAU,WAAW;AACrC,SAAO,SAAU,IAAI;AACjB,WAAO,OAAO,EAAE,IAAI,QAAQ,UAAU,GAAG,KAAK;AAAA,EACtD;AACA;AAQU,IAAC,KAAmB,mBAAGC,oBAAa;AAKpC,IAAC,SAAuBC,0BAAO,OAAC,OAAO;AAC9C,IAAC,OAAqBC,0BAAK,IAAC,OAAO;AAW5B,IAAC,OAAqBC,wBAAc,KAAC,KAAK;AAK1C,IAAC,MAAoBC,wBAAI,IAAC,KAAK;AAI/B,IAAC,MAAoB,mBAAGC,2BAAoB;AAU5C,IAAC,yCAAyC,SAAU,GAAG;AAC7D,SAAO,SAAUC,KAAI;AACjB,QAAI,IAAI,EAAE,GAAGC,SAAAA,KAAOD,GAAE,CAAC;AACvB,QAAI,OAAO,CAAC,GAAG;AACX,aAAO;AAAA,IACV;AACD,QAAI,MAAM,CAAC,EAAE,KAAK;AAClB,aAAS,IAAI,GAAG,IAAIA,IAAG,QAAQ,KAAK;AAChC,UAAI,MAAM,EAAE,GAAGA,IAAG,CAAC,CAAC;AACpB,UAAI,OAAO,GAAG,GAAG;AACb,eAAO;AAAA,MACV;AACD,UAAI,KAAK,IAAI,KAAK;AAAA,IACrB;AACD,WAAO,KAAK,GAAG;AAAA,EACvB;AACA;AAOU,IAAC,iCAAiC,SAAU,GAAG;AACrD,MAAI,IAAI,uCAAuC,CAAC;AAChD,SAAO,SAAUA,KAAI;AAAE,WAAQE,oBAAaF,GAAE,IAAI,EAAEA,GAAE,IAAI;AAAA;AAC9D;AAOU,IAAC,yBAAyB;AAO1B,IAAC,gBAAgB,SAAU,GAAG;AACpC,SAAO,+BAA+B,SAAU,GAAG,GAAG;AAAE,WAAO,EAAE,CAAC;AAAA,EAAE,CAAE;AAC1E;AAOU,IAAC,gBACG,8BAAcvB,UAAAA,QAAQ;AAU1B,IAAC,QAAQ;AAOT,IAAC,aAAa;AAWjB,SAAS,cAAc,WAAW;AACrC,SAAO,SAAU,GAAG;AAAE,WAAO,OAAO,UAAU,CAAC,CAAC;AAAA;AACpD;AAQU,IAAC,cAAc;AAUf,IAAC,SAAS;AAAA,EAChB;AAAA,EACA,KAAK;AAAA,EACL;AAAA,EACA,IAAI;AAAA,EACJ,OAAO;AAAA,EACP,QAAQ;AAAA,EACR,SAAS;AAAA,EACT,aAAa;AAAA,EACb,UAAU;AAAA,EACV;AAAA,EACA;AAAA,EACA,KAAK;AAAA,EACL,QAAQ;AAAA,EACR;AAAA,EACA;AAAA,EACA,QAAQ;AAAA,EACR,WAAW;AAAA,EACX,WAAW;AAAA,EACX,cAAc;AAAA,EACd,QAAQ;AAAA,EACR,MAAM;AAAA,EACN;AACJ;AAQU,IAAC,oBAAkC0B,wBAAkB,kBAAC,KAAK;AAQ3D,IAAC,iBAA+BC,8BAAoB,qBAAC,WAAW;AAmChE,IAAC,iBAAiB,WAAY;AAAE,SAAO,UAAUC,UAAK,MAAA,CAAE;AAAK;AAmC7D,IAAC,gBAAgB,WAAY;AAAE,SAAO,UAAUC,UAAAA,KAAM,CAAA;AAAE;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;","x_google_ignoreList":[0]}

package/dist/_node_modules/fp-ts/es6/Option.js

@@ -0,0 +1,570 @@
+import { getApplicativeMonoid } from "./Applicative.js";
+import { apFirst as apFirst$1, apSecond as apSecond$1, apS as apS$1, getApplySemigroup as getApplySemigroup$1 } from "./Apply.js";
+import { bind as bind$1, tap as tap$1 } from "./Chain.js";
+import { fromEitherK as fromEitherK$1, chainEitherK as chainEitherK$1, tapEither as tapEither$1 } from "./FromEither.js";
+import { dual, identity, flow, constNull, constUndefined, pipe } from "./function.js";
+import { asUnit as asUnit$1, flap as flap$1, bindTo as bindTo$1, let as let_$1, as as as$1 } from "./Functor.js";
+import { none as none$1, some as some$1, isSome as isSome$1, head, isNonEmpty, emptyRecord, emptyReadonlyArray } from "./internal.js";
+import { not } from "./Predicate.js";
+import { first, last } from "./Semigroup.js";
+import { separated } from "./Separated.js";
+import { witherDefault, wiltDefault } from "./Witherable.js";
+import { guard as guard$1 } from "./Zero.js";
+var none = none$1;
+var some = some$1;
+function fromPredicate(predicate) {
+  return function(a) {
+    return predicate(a) ? some(a) : none;
+  };
+}
+var getLeft = function(ma) {
+  return ma._tag === "Right" ? none : some(ma.left);
+};
+var getRight = function(ma) {
+  return ma._tag === "Left" ? none : some(ma.right);
+};
+var _map = function(fa, f) {
+  return pipe(fa, map(f));
+};
+var _ap = function(fab, fa) {
+  return pipe(fab, ap(fa));
+};
+var _reduce = function(fa, b, f) {
+  return pipe(fa, reduce(b, f));
+};
+var _foldMap = function(M) {
+  var foldMapM = foldMap(M);
+  return function(fa, f) {
+    return pipe(fa, foldMapM(f));
+  };
+};
+var _reduceRight = function(fa, b, f) {
+  return pipe(fa, reduceRight(b, f));
+};
+var _traverse = function(F) {
+  var traverseF = traverse(F);
+  return function(ta, f) {
+    return pipe(ta, traverseF(f));
+  };
+};
+var _alt = function(fa, that) {
+  return pipe(fa, alt(that));
+};
+var _filter = function(fa, predicate) {
+  return pipe(fa, filter(predicate));
+};
+var _filterMap = function(fa, f) {
+  return pipe(fa, filterMap(f));
+};
+var _extend = function(wa, f) {
+  return pipe(wa, extend(f));
+};
+var _partition = function(fa, predicate) {
+  return pipe(fa, partition(predicate));
+};
+var _partitionMap = function(fa, f) {
+  return pipe(fa, partitionMap(f));
+};
+var URI = "Option";
+var getShow = function(S) {
+  return {
+    show: function(ma) {
+      return isNone(ma) ? "none" : "some(".concat(S.show(ma.value), ")");
+    }
+  };
+};
+var getEq = function(E) {
+  return {
+    equals: function(x, y) {
+      return x === y || (isNone(x) ? isNone(y) : isNone(y) ? false : E.equals(x.value, y.value));
+    }
+  };
+};
+var getOrd = function(O) {
+  return {
+    equals: getEq(O).equals,
+    compare: function(x, y) {
+      return x === y ? 0 : isSome(x) ? isSome(y) ? O.compare(x.value, y.value) : 1 : -1;
+    }
+  };
+};
+var getMonoid = function(S) {
+  return {
+    concat: function(x, y) {
+      return isNone(x) ? y : isNone(y) ? x : some(S.concat(x.value, y.value));
+    },
+    empty: none
+  };
+};
+var map = function(f) {
+  return function(fa) {
+    return isNone(fa) ? none : some(f(fa.value));
+  };
+};
+var Functor = {
+  URI,
+  map: _map
+};
+var as = dual(2, as$1(Functor));
+var asUnit = asUnit$1(Functor);
+var of = some;
+var Pointed = {
+  URI,
+  of
+};
+var ap = function(fa) {
+  return function(fab) {
+    return isNone(fab) ? none : isNone(fa) ? none : some(fab.value(fa.value));
+  };
+};
+var Apply = {
+  URI,
+  map: _map,
+  ap: _ap
+};
+var Applicative = {
+  URI,
+  map: _map,
+  ap: _ap,
+  of
+};
+var flatMap = /* @__PURE__ */ dual(2, function(ma, f) {
+  return isNone(ma) ? none : f(ma.value);
+});
+var Chain = {
+  URI,
+  map: _map,
+  ap: _ap,
+  chain: flatMap
+};
+var Monad = {
+  URI,
+  map: _map,
+  ap: _ap,
+  of,
+  chain: flatMap
+};
+var reduce = function(b, f) {
+  return function(fa) {
+    return isNone(fa) ? b : f(b, fa.value);
+  };
+};
+var foldMap = function(M) {
+  return function(f) {
+    return function(fa) {
+      return isNone(fa) ? M.empty : f(fa.value);
+    };
+  };
+};
+var reduceRight = function(b, f) {
+  return function(fa) {
+    return isNone(fa) ? b : f(fa.value, b);
+  };
+};
+var Foldable = {
+  URI,
+  reduce: _reduce,
+  foldMap: _foldMap,
+  reduceRight: _reduceRight
+};
+var orElse = dual(2, function(self, that) {
+  return isNone(self) ? that() : self;
+});
+var altW = orElse;
+var alt = orElse;
+var Alt = {
+  URI,
+  map: _map,
+  alt: _alt
+};
+var zero = function() {
+  return none;
+};
+var Zero = {
+  URI,
+  zero
+};
+var guard = /* @__PURE__ */ guard$1(Zero, Pointed);
+var Alternative = {
+  URI,
+  map: _map,
+  ap: _ap,
+  of,
+  alt: _alt,
+  zero
+};
+var extend = function(f) {
+  return function(wa) {
+    return isNone(wa) ? none : some(f(wa));
+  };
+};
+var Extend = {
+  URI,
+  map: _map,
+  extend: _extend
+};
+var compact = /* @__PURE__ */ flatMap(identity);
+var defaultSeparated = /* @__PURE__ */ separated(none, none);
+var separate = function(ma) {
+  return isNone(ma) ? defaultSeparated : separated(getLeft(ma.value), getRight(ma.value));
+};
+var Compactable = {
+  URI,
+  compact,
+  separate
+};
+var filter = function(predicate) {
+  return function(fa) {
+    return isNone(fa) ? none : predicate(fa.value) ? fa : none;
+  };
+};
+var filterMap = function(f) {
+  return function(fa) {
+    return isNone(fa) ? none : f(fa.value);
+  };
+};
+var partition = function(predicate) {
+  return function(fa) {
+    return separated(_filter(fa, not(predicate)), _filter(fa, predicate));
+  };
+};
+var partitionMap = function(f) {
+  return flow(map(f), separate);
+};
+var Filterable = {
+  URI,
+  map: _map,
+  compact,
+  separate,
+  filter: _filter,
+  filterMap: _filterMap,
+  partition: _partition,
+  partitionMap: _partitionMap
+};
+var traverse = function(F) {
+  return function(f) {
+    return function(ta) {
+      return isNone(ta) ? F.of(none) : F.map(f(ta.value), some);
+    };
+  };
+};
+var sequence = function(F) {
+  return function(ta) {
+    return isNone(ta) ? F.of(none) : F.map(ta.value, some);
+  };
+};
+var Traversable = {
+  URI,
+  map: _map,
+  reduce: _reduce,
+  foldMap: _foldMap,
+  reduceRight: _reduceRight,
+  traverse: _traverse,
+  sequence
+};
+var _wither = /* @__PURE__ */ witherDefault(Traversable, Compactable);
+var _wilt = /* @__PURE__ */ wiltDefault(Traversable, Compactable);
+var wither = function(F) {
+  var _witherF = _wither(F);
+  return function(f) {
+    return function(fa) {
+      return _witherF(fa, f);
+    };
+  };
+};
+var wilt = function(F) {
+  var _wiltF = _wilt(F);
+  return function(f) {
+    return function(fa) {
+      return _wiltF(fa, f);
+    };
+  };
+};
+var Witherable = {
+  URI,
+  map: _map,
+  reduce: _reduce,
+  foldMap: _foldMap,
+  reduceRight: _reduceRight,
+  traverse: _traverse,
+  sequence,
+  compact,
+  separate,
+  filter: _filter,
+  filterMap: _filterMap,
+  partition: _partition,
+  partitionMap: _partitionMap,
+  wither: _wither,
+  wilt: _wilt
+};
+var throwError = function() {
+  return none;
+};
+var MonadThrow = {
+  URI,
+  map: _map,
+  ap: _ap,
+  of,
+  chain: flatMap,
+  throwError
+};
+var fromEither = getRight;
+var FromEither = {
+  URI,
+  fromEither
+};
+var isSome = isSome$1;
+var isNone = function(fa) {
+  return fa._tag === "None";
+};
+var matchW = function(onNone, onSome) {
+  return function(ma) {
+    return isNone(ma) ? onNone() : onSome(ma.value);
+  };
+};
+var foldW = matchW;
+var match = matchW;
+var fold = match;
+var getOrElseW = function(onNone) {
+  return function(ma) {
+    return isNone(ma) ? onNone() : ma.value;
+  };
+};
+var getOrElse = getOrElseW;
+var flap = /* @__PURE__ */ flap$1(Functor);
+var apFirst = /* @__PURE__ */ apFirst$1(Apply);
+var apSecond = /* @__PURE__ */ apSecond$1(Apply);
+var flatten = compact;
+var tap = /* @__PURE__ */ dual(2, tap$1(Chain));
+var tapEither = /* @__PURE__ */ dual(2, tapEither$1(FromEither, Chain));
+var duplicate = /* @__PURE__ */ extend(identity);
+var fromEitherK = /* @__PURE__ */ fromEitherK$1(FromEither);
+var chainEitherK = /* @__PURE__ */ chainEitherK$1(FromEither, Chain);
+var chainFirstEitherK = tapEither;
+var fromNullable = function(a) {
+  return a == null ? none : some(a);
+};
+var tryCatch = function(f) {
+  try {
+    return some(f());
+  } catch (e) {
+    return none;
+  }
+};
+var tryCatchK = function(f) {
+  return function() {
+    var a = [];
+    for (var _i = 0; _i < arguments.length; _i++) {
+      a[_i] = arguments[_i];
+    }
+    return tryCatch(function() {
+      return f.apply(void 0, a);
+    });
+  };
+};
+var fromNullableK = function(f) {
+  return flow(f, fromNullable);
+};
+var chainNullableK = function(f) {
+  return function(ma) {
+    return isNone(ma) ? none : fromNullable(f(ma.value));
+  };
+};
+var toNullable = /* @__PURE__ */ match(constNull, identity);
+var toUndefined = /* @__PURE__ */ match(constUndefined, identity);
+function elem(E) {
+  return function(a, ma) {
+    if (ma === void 0) {
+      var elemE_1 = elem(E);
+      return function(ma2) {
+        return elemE_1(a, ma2);
+      };
+    }
+    return isNone(ma) ? false : E.equals(a, ma.value);
+  };
+}
+var exists = function(predicate) {
+  return function(ma) {
+    return isNone(ma) ? false : predicate(ma.value);
+  };
+};
+var Do = /* @__PURE__ */ of(emptyRecord);
+var bindTo = /* @__PURE__ */ bindTo$1(Functor);
+var let_ = /* @__PURE__ */ let_$1(Functor);
+var bind = /* @__PURE__ */ bind$1(Chain);
+var apS = /* @__PURE__ */ apS$1(Apply);
+var ApT = /* @__PURE__ */ of(emptyReadonlyArray);
+var traverseReadonlyNonEmptyArrayWithIndex = function(f) {
+  return function(as2) {
+    var o = f(0, head(as2));
+    if (isNone(o)) {
+      return none;
+    }
+    var out = [o.value];
+    for (var i = 1; i < as2.length; i++) {
+      var o_1 = f(i, as2[i]);
+      if (isNone(o_1)) {
+        return none;
+      }
+      out.push(o_1.value);
+    }
+    return some(out);
+  };
+};
+var traverseReadonlyArrayWithIndex = function(f) {
+  var g = traverseReadonlyNonEmptyArrayWithIndex(f);
+  return function(as2) {
+    return isNonEmpty(as2) ? g(as2) : ApT;
+  };
+};
+var traverseArrayWithIndex = traverseReadonlyArrayWithIndex;
+var traverseArray = function(f) {
+  return traverseReadonlyArrayWithIndex(function(_, a) {
+    return f(a);
+  });
+};
+var sequenceArray = /* @__PURE__ */ traverseArray(identity);
+var chain = flatMap;
+var chainFirst = tap;
+function getRefinement(getOption) {
+  return function(a) {
+    return isSome(getOption(a));
+  };
+}
+var mapNullable = chainNullableK;
+var option = {
+  URI,
+  map: _map,
+  of,
+  ap: _ap,
+  chain: flatMap,
+  reduce: _reduce,
+  foldMap: _foldMap,
+  reduceRight: _reduceRight,
+  traverse: _traverse,
+  sequence,
+  zero,
+  alt: _alt,
+  extend: _extend,
+  compact,
+  separate,
+  filter: _filter,
+  filterMap: _filterMap,
+  partition: _partition,
+  partitionMap: _partitionMap,
+  wither: _wither,
+  wilt: _wilt,
+  throwError
+};
+var getApplySemigroup = /* @__PURE__ */ getApplySemigroup$1(Apply);
+var getApplyMonoid = /* @__PURE__ */ getApplicativeMonoid(Applicative);
+var getFirstMonoid = function() {
+  return getMonoid(first());
+};
+var getLastMonoid = function() {
+  return getMonoid(last());
+};
+export {
+  Alt,
+  Alternative,
+  ApT,
+  Applicative,
+  Apply,
+  Chain,
+  Compactable,
+  Do,
+  Extend,
+  Filterable,
+  Foldable,
+  FromEither,
+  Functor,
+  Monad,
+  MonadThrow,
+  Pointed,
+  Traversable,
+  URI,
+  Witherable,
+  Zero,
+  alt,
+  altW,
+  ap,
+  apFirst,
+  apS,
+  apSecond,
+  as,
+  asUnit,
+  bind,
+  bindTo,
+  chain,
+  chainEitherK,
+  chainFirst,
+  chainFirstEitherK,
+  chainNullableK,
+  compact,
+  duplicate,
+  elem,
+  exists,
+  extend,
+  filter,
+  filterMap,
+  flap,
+  flatMap,
+  flatten,
+  fold,
+  foldMap,
+  foldW,
+  fromEither,
+  fromEitherK,
+  fromNullable,
+  fromNullableK,
+  fromPredicate,
+  getApplyMonoid,
+  getApplySemigroup,
+  getEq,
+  getFirstMonoid,
+  getLastMonoid,
+  getLeft,
+  getMonoid,
+  getOrElse,
+  getOrElseW,
+  getOrd,
+  getRefinement,
+  getRight,
+  getShow,
+  guard,
+  isNone,
+  isSome,
+  let_ as let,
+  map,
+  mapNullable,
+  match,
+  matchW,
+  none,
+  of,
+  option,
+  orElse,
+  partition,
+  partitionMap,
+  reduce,
+  reduceRight,
+  separate,
+  sequence,
+  sequenceArray,
+  some,
+  tap,
+  tapEither,
+  throwError,
+  toNullable,
+  toUndefined,
+  traverse,
+  traverseArray,
+  traverseArrayWithIndex,
+  traverseReadonlyArrayWithIndex,
+  traverseReadonlyNonEmptyArrayWithIndex,
+  tryCatch,
+  tryCatchK,
+  wilt,
+  wither,
+  zero
+};
+//# sourceMappingURL=Option.js.map