vviinn-widgets 2.1.0 → 2.2.2

package/www/build/Array-4b9f84cf.js

@@ -1,4295 +0,0 @@
-import { c as createCommonjsModule, g as getDefaultExportFromCjs, a as commonjsGlobal, i as internal, R as ReadonlyNonEmptyArray, _ as _function, S as Separated, E as Eq, O as Ord, F as Functor, A as Apply, C as Chain, Z as Zero, W as Witherable, b as FromEither, N as NonEmptyArray } from './NonEmptyArray-6ef0d207.js';
-
-var number = createCommonjsModule(function (module, exports) {
-"use strict";
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.Field = exports.MonoidProduct = exports.MonoidSum = exports.SemigroupProduct = exports.SemigroupSum = exports.MagmaSub = exports.Show = exports.Bounded = exports.Ord = exports.Eq = exports.isNumber = void 0;
-// -------------------------------------------------------------------------------------
-// refinements
-// -------------------------------------------------------------------------------------
-/**
- * @category refinements
- * @since 2.11.0
- */
-var isNumber = function (u) { return typeof u === 'number'; };
-exports.isNumber = isNumber;
-// -------------------------------------------------------------------------------------
-// instances
-// -------------------------------------------------------------------------------------
-/**
- * @category instances
- * @since 2.10.0
- */
-exports.Eq = {
-    equals: function (first, second) { return first === second; }
-};
-/**
- * @category instances
- * @since 2.10.0
- */
-exports.Ord = {
-    equals: exports.Eq.equals,
-    compare: function (first, second) { return (first < second ? -1 : first > second ? 1 : 0); }
-};
-/**
- * @category instances
- * @since 2.10.0
- */
-exports.Bounded = {
-    equals: exports.Eq.equals,
-    compare: exports.Ord.compare,
-    top: Infinity,
-    bottom: -Infinity
-};
-/**
- * @category instances
- * @since 2.10.0
- */
-exports.Show = {
-    show: function (n) { return JSON.stringify(n); }
-};
-/**
- * @category instances
- * @since 2.11.0
- */
-exports.MagmaSub = {
-    concat: function (first, second) { return first - second; }
-};
-/**
- * `number` semigroup under addition.
- *
- * @example
- * import { SemigroupSum } from 'fp-ts/number'
- *
- * assert.deepStrictEqual(SemigroupSum.concat(2, 3), 5)
- *
- * @category instances
- * @since 2.10.0
- */
-exports.SemigroupSum = {
-    concat: function (first, second) { return first + second; }
-};
-/**
- * `number` semigroup under multiplication.
- *
- * @example
- * import { SemigroupProduct } from 'fp-ts/number'
- *
- * assert.deepStrictEqual(SemigroupProduct.concat(2, 3), 6)
- *
- * @category instances
- * @since 2.10.0
- */
-exports.SemigroupProduct = {
-    concat: function (first, second) { return first * second; }
-};
-/**
- * `number` monoid under addition.
- *
- * The `empty` value is `0`.
- *
- * @example
- * import { MonoidSum } from 'fp-ts/number'
- *
- * assert.deepStrictEqual(MonoidSum.concat(2, MonoidSum.empty), 2)
- *
- * @category instances
- * @since 2.10.0
- */
-exports.MonoidSum = {
-    concat: exports.SemigroupSum.concat,
-    empty: 0
-};
-/**
- * `number` monoid under multiplication.
- *
- * The `empty` value is `1`.
- *
- * @example
- * import { MonoidProduct } from 'fp-ts/number'
- *
- * assert.deepStrictEqual(MonoidProduct.concat(2, MonoidProduct.empty), 2)
- *
- * @category instances
- * @since 2.10.0
- */
-exports.MonoidProduct = {
-    concat: exports.SemigroupProduct.concat,
-    empty: 1
-};
-/**
- * @category instances
- * @since 2.10.0
- */
-exports.Field = {
-    add: exports.SemigroupSum.concat,
-    zero: 0,
-    mul: exports.SemigroupProduct.concat,
-    one: 1,
-    sub: exports.MagmaSub.concat,
-    degree: function (_) { return 1; },
-    div: function (first, second) { return first / second; },
-    mod: function (first, second) { return first % second; }
-};
-});
-
-const number$1 = /*@__PURE__*/getDefaultExportFromCjs(number);
-
-var ReadonlyArray = createCommonjsModule(function (module, exports) {
-"use strict";
-var __createBinding = (commonjsGlobal && commonjsGlobal.__createBinding) || (Object.create ? (function(o, m, k, k2) {
-    if (k2 === undefined) k2 = k;
-    Object.defineProperty(o, k2, { enumerable: true, get: function() { return m[k]; } });
-}) : (function(o, m, k, k2) {
-    if (k2 === undefined) k2 = k;
-    o[k2] = m[k];
-}));
-var __setModuleDefault = (commonjsGlobal && commonjsGlobal.__setModuleDefault) || (Object.create ? (function(o, v) {
-    Object.defineProperty(o, "default", { enumerable: true, value: v });
-}) : function(o, v) {
-    o["default"] = v;
-});
-var __importStar = (commonjsGlobal && commonjsGlobal.__importStar) || function (mod) {
-    if (mod && mod.__esModule) return mod;
-    var result = {};
-    if (mod != null) for (var k in mod) if (k !== "default" && Object.prototype.hasOwnProperty.call(mod, k)) __createBinding(result, mod, k);
-    __setModuleDefault(result, mod);
-    return result;
-};
-var __spreadArray = (commonjsGlobal && commonjsGlobal.__spreadArray) || function (to, from) {
-    for (var i = 0, il = from.length, j = to.length; i < il; i++, j++)
-        to[j] = from[i];
-    return to;
-};
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.sort = exports.lefts = exports.rights = exports.reverse = exports.modifyAt = exports.deleteAt = exports.updateAt = exports.insertAt = exports.findLastIndex = exports.findLastMap = exports.findLast = exports.findFirstMap = exports.findFirst = exports.findIndex = exports.dropLeftWhile = exports.dropRight = exports.dropLeft = exports.spanLeft = exports.takeLeftWhile = exports.takeRight = exports.takeLeft = exports.init = exports.tail = exports.last = exports.head = exports.lookup = exports.isOutOfBound = exports.size = exports.scanRight = exports.scanLeft = exports.chainWithIndex = exports.foldRight = exports.matchRight = exports.matchRightW = exports.foldLeft = exports.matchLeft = exports.matchLeftW = exports.match = exports.matchW = exports.fromEither = exports.fromOption = exports.fromPredicate = exports.replicate = exports.makeBy = exports.appendW = exports.append = exports.prependW = exports.prepend = exports.isNonEmpty = exports.isEmpty = void 0;
-exports.sequence = exports.traverse = exports.reduceRightWithIndex = exports.reduceRight = exports.reduceWithIndex = exports.foldMap = exports.reduce = exports.foldMapWithIndex = exports.duplicate = exports.extend = exports.filterWithIndex = exports.partitionMapWithIndex = exports.partitionMap = exports.partitionWithIndex = exports.partition = exports.compact = exports.filterMap = exports.filterMapWithIndex = exports.filter = exports.separate = exports.mapWithIndex = exports.map = exports.flatten = exports.chain = exports.ap = exports.alt = exports.altW = exports.zero = exports.of = exports._chainRecBreadthFirst = exports._chainRecDepthFirst = exports.difference = exports.intersection = exports.union = exports.concat = exports.concatW = exports.comprehension = exports.fromOptionK = exports.chunksOf = exports.splitAt = exports.chop = exports.sortBy = exports.uniq = exports.elem = exports.rotate = exports.intersperse = exports.prependAll = exports.unzip = exports.zip = exports.zipWith = void 0;
-exports.toArray = exports.unsafeDeleteAt = exports.unsafeUpdateAt = exports.unsafeInsertAt = exports.fromEitherK = exports.FromEither = exports.filterE = exports.Witherable = exports.ChainRecBreadthFirst = exports.chainRecBreadthFirst = exports.ChainRecDepthFirst = exports.chainRecDepthFirst = exports.TraversableWithIndex = exports.Traversable = exports.FoldableWithIndex = exports.Foldable = exports.FilterableWithIndex = exports.Filterable = exports.Compactable = exports.Extend = exports.Alternative = exports.guard = exports.Zero = exports.Alt = exports.Unfoldable = exports.chainFirst = exports.Monad = exports.Chain = exports.Applicative = exports.apSecond = exports.apFirst = exports.Apply = exports.FunctorWithIndex = exports.Pointed = exports.flap = exports.Functor = exports.getDifferenceMagma = exports.getIntersectionSemigroup = exports.getUnionMonoid = exports.getUnionSemigroup = exports.getOrd = exports.getEq = exports.getMonoid = exports.getSemigroup = exports.getShow = exports.URI = exports.unfold = exports.wilt = exports.wither = exports.traverseWithIndex = void 0;
-exports.readonlyArray = exports.prependToAll = exports.snoc = exports.cons = exports.range = exports.apS = exports.bind = exports.bindTo = exports.Do = exports.exists = exports.some = exports.every = exports.empty = exports.fromArray = void 0;
-
-
-
-
-
-
-var _ = __importStar(internal);
-var N = __importStar(number);
-
-var RNEA = __importStar(ReadonlyNonEmptyArray);
-
-
-
-// -------------------------------------------------------------------------------------
-// refinements
-// -------------------------------------------------------------------------------------
-/**
- * Test whether a `ReadonlyArray` is empty.
- *
- * @example
- * import { isEmpty } from 'fp-ts/ReadonlyArray'
- *
- * assert.strictEqual(isEmpty([]), true)
- *
- * @category refinements
- * @since 2.5.0
- */
-var isEmpty = function (as) { return as.length === 0; };
-exports.isEmpty = isEmpty;
-/**
- * Test whether a `ReadonlyArray` is non empty.
- *
- * @category refinements
- * @since 2.5.0
- */
-exports.isNonEmpty = RNEA.isNonEmpty;
-// -------------------------------------------------------------------------------------
-// constructors
-// -------------------------------------------------------------------------------------
-/**
- * Prepend an element to the front of a `ReadonlyArray`, creating a new `ReadonlyNonEmptyArray`.
- *
- * @example
- * import { prepend } from 'fp-ts/ReadonlyArray'
- * import { pipe } from 'fp-ts/function'
- *
- * assert.deepStrictEqual(pipe([2, 3, 4], prepend(1)), [1, 2, 3, 4])
- *
- * @category constructors
- * @since 2.10.0
- */
-exports.prepend = RNEA.prepend;
-/**
- * Less strict version of [`prepend`](#prepend).
- *
- * @category constructors
- * @since 2.11.0
- */
-exports.prependW = RNEA.prependW;
-/**
- * Append an element to the end of a `ReadonlyArray`, creating a new `ReadonlyNonEmptyArray`.
- *
- * @example
- * import { append } from 'fp-ts/ReadonlyArray'
- * import { pipe } from 'fp-ts/function'
- *
- * assert.deepStrictEqual(pipe([1, 2, 3], append(4)), [1, 2, 3, 4])
- *
- * @category constructors
- * @since 2.10.0
- */
-exports.append = RNEA.append;
-/**
- * Less strict version of [`append`](#append).
- *
- * @category constructors
- * @since 2.11.0
- */
-exports.appendW = RNEA.appendW;
-/**
- * Return a `ReadonlyArray` of length `n` with element `i` initialized with `f(i)`.
- *
- * **Note**. `n` is normalized to a non negative integer.
- *
- * @example
- * import { makeBy } from 'fp-ts/ReadonlyArray'
- *
- * const double = (n: number): number => n * 2
- * assert.deepStrictEqual(makeBy(5, double), [0, 2, 4, 6, 8])
- *
- * @category constructors
- * @since 2.5.0
- */
-var makeBy = function (n, f) { return (n <= 0 ? exports.empty : RNEA.makeBy(f)(n)); };
-exports.makeBy = makeBy;
-/**
- * Create a `ReadonlyArray` containing a value repeated the specified number of times.
- *
- * **Note**. `n` is normalized to a non negative integer.
- *
- * @example
- * import { replicate } from 'fp-ts/ReadonlyArray'
- *
- * assert.deepStrictEqual(replicate(3, 'a'), ['a', 'a', 'a'])
- *
- * @category constructors
- * @since 2.5.0
- */
-var replicate = function (n, a) { return exports.makeBy(n, function () { return a; }); };
-exports.replicate = replicate;
-function fromPredicate(predicate) {
-    return function (a) { return (predicate(a) ? [a] : exports.empty); };
-}
-exports.fromPredicate = fromPredicate;
-// -------------------------------------------------------------------------------------
-// natural transformations
-// -------------------------------------------------------------------------------------
-/**
- * @category natural transformations
- * @since 2.11.0
- */
-var fromOption = function (ma) { return (_.isNone(ma) ? exports.empty : [ma.value]); };
-exports.fromOption = fromOption;
-/**
- * Transforms an `Either` to a `ReadonlyArray`.
- *
- * @category natural transformations
- * @since 2.11.0
- */
-var fromEither = function (e) { return (_.isLeft(e) ? exports.empty : [e.right]); };
-exports.fromEither = fromEither;
-// -------------------------------------------------------------------------------------
-// destructors
-// -------------------------------------------------------------------------------------
-/**
- * Less strict version of [`match`](#match).
- *
- * @category destructors
- * @since 2.11.0
- */
-var matchW = function (onEmpty, onNonEmpty) { return function (as) { return (exports.isNonEmpty(as) ? onNonEmpty(as) : onEmpty()); }; };
-exports.matchW = matchW;
-/**
- * @category destructors
- * @since 2.11.0
- */
-exports.match = exports.matchW;
-/**
- * Less strict version of [`matchLeft`](#matchleft).
- *
- * @category destructors
- * @since 2.11.0
- */
-var matchLeftW = function (onEmpty, onNonEmpty) { return function (as) { return (exports.isNonEmpty(as) ? onNonEmpty(RNEA.head(as), RNEA.tail(as)) : onEmpty()); }; };
-exports.matchLeftW = matchLeftW;
-/**
- * Break a `ReadonlyArray` into its first element and remaining elements.
- *
- * @example
- * import { matchLeft } from 'fp-ts/ReadonlyArray'
- *
- * const len: <A>(as: ReadonlyArray<A>) => number = matchLeft(() => 0, (_, tail) => 1 + len(tail))
- * assert.strictEqual(len([1, 2, 3]), 3)
- *
- * @category destructors
- * @since 2.10.0
- */
-exports.matchLeft = exports.matchLeftW;
-/**
- * Alias of [`matchLeft`](#matchleft).
- *
- * @category destructors
- * @since 2.5.0
- */
-exports.foldLeft = exports.matchLeft;
-/**
- * Less strict version of [`matchRight`](#matchright).
- *
- * @category destructors
- * @since 2.11.0
- */
-var matchRightW = function (onEmpty, onNonEmpty) { return function (as) { return (exports.isNonEmpty(as) ? onNonEmpty(RNEA.init(as), RNEA.last(as)) : onEmpty()); }; };
-exports.matchRightW = matchRightW;
-/**
- * Break a `ReadonlyArray` into its initial elements and the last element.
- *
- * @category destructors
- * @since 2.10.0
- */
-exports.matchRight = exports.matchRightW;
-/**
- * Alias of [`matchRight`](#matchright).
- *
- * @category destructors
- * @since 2.5.0
- */
-exports.foldRight = exports.matchRight;
-// -------------------------------------------------------------------------------------
-// combinators
-// -------------------------------------------------------------------------------------
-/**
- * @category combinators
- * @since 2.7.0
- */
-var chainWithIndex = function (f) { return function (as) {
-    if (exports.isEmpty(as)) {
-        return exports.empty;
-    }
-    var out = [];
-    for (var i = 0; i < as.length; i++) {
-        out.push.apply(out, f(i, as[i]));
-    }
-    return out;
-}; };
-exports.chainWithIndex = chainWithIndex;
-/**
- * Same as `reduce` but it carries over the intermediate steps.
- *
- * @example
- * import { scanLeft } from 'fp-ts/ReadonlyArray'
- *
- * assert.deepStrictEqual(scanLeft(10, (b, a: number) => b - a)([1, 2, 3]), [10, 9, 7, 4])
- *
- * @category combinators
- * @since 2.5.0
- */
-var scanLeft = function (b, f) { return function (as) {
-    var len = as.length;
-    var out = new Array(len + 1);
-    out[0] = b;
-    for (var i = 0; i < len; i++) {
-        out[i + 1] = f(out[i], as[i]);
-    }
-    return out;
-}; };
-exports.scanLeft = scanLeft;
-/**
- * Fold an array from the right, keeping all intermediate results instead of only the final result
- *
- * @example
- * import { scanRight } from 'fp-ts/ReadonlyArray'
- *
- * assert.deepStrictEqual(scanRight(10, (a: number, b) => b - a)([1, 2, 3]), [4, 5, 7, 10])
- *
- * @category combinators
- * @since 2.5.0
- */
-var scanRight = function (b, f) { return function (as) {
-    var len = as.length;
-    var out = new Array(len + 1);
-    out[len] = b;
-    for (var i = len - 1; i >= 0; i--) {
-        out[i] = f(as[i], out[i + 1]);
-    }
-    return out;
-}; };
-exports.scanRight = scanRight;
-/**
- * Calculate the number of elements in a `ReadonlyArray`.
- *
- * @since 2.10.0
- */
-var size = function (as) { return as.length; };
-exports.size = size;
-/**
- * Test whether an array contains a particular index
- *
- * @since 2.5.0
- */
-exports.isOutOfBound = RNEA.isOutOfBound;
-function lookup(i, as) {
-    return as === undefined ? function (as) { return lookup(i, as); } : exports.isOutOfBound(i, as) ? _.none : _.some(as[i]);
-}
-exports.lookup = lookup;
-/**
- * Get the first element in an array, or `None` if the array is empty
- *
- * @example
- * import { head } from 'fp-ts/ReadonlyArray'
- * import { some, none } from 'fp-ts/Option'
- *
- * assert.deepStrictEqual(head([1, 2, 3]), some(1))
- * assert.deepStrictEqual(head([]), none)
- *
- * @since 2.5.0
- */
-var head = function (as) { return (exports.isNonEmpty(as) ? _.some(RNEA.head(as)) : _.none); };
-exports.head = head;
-/**
- * Get the last element in an array, or `None` if the array is empty
- *
- * @example
- * import { last } from 'fp-ts/ReadonlyArray'
- * import { some, none } from 'fp-ts/Option'
- *
- * assert.deepStrictEqual(last([1, 2, 3]), some(3))
- * assert.deepStrictEqual(last([]), none)
- *
- * @since 2.5.0
- */
-var last = function (as) { return (exports.isNonEmpty(as) ? _.some(RNEA.last(as)) : _.none); };
-exports.last = last;
-/**
- * Get all but the first element of an array, creating a new array, or `None` if the array is empty
- *
- * @example
- * import { tail } from 'fp-ts/ReadonlyArray'
- * import { some, none } from 'fp-ts/Option'
- *
- * assert.deepStrictEqual(tail([1, 2, 3]), some([2, 3]))
- * assert.deepStrictEqual(tail([]), none)
- *
- * @since 2.5.0
- */
-var tail = function (as) {
-    return exports.isNonEmpty(as) ? _.some(RNEA.tail(as)) : _.none;
-};
-exports.tail = tail;
-/**
- * Get all but the last element of an array, creating a new array, or `None` if the array is empty
- *
- * @example
- * import { init } from 'fp-ts/ReadonlyArray'
- * import { some, none } from 'fp-ts/Option'
- *
- * assert.deepStrictEqual(init([1, 2, 3]), some([1, 2]))
- * assert.deepStrictEqual(init([]), none)
- *
- * @since 2.5.0
- */
-var init = function (as) {
-    return exports.isNonEmpty(as) ? _.some(RNEA.init(as)) : _.none;
-};
-exports.init = init;
-/**
- * Keep only a max number of elements from the start of an `ReadonlyArray`, creating a new `ReadonlyArray`.
- *
- * **Note**. `n` is normalized to a non negative integer.
- *
- * @example
- * import * as RA from 'fp-ts/ReadonlyArray'
- * import { pipe } from 'fp-ts/function'
- *
- * const input: ReadonlyArray<number> = [1, 2, 3]
- * assert.deepStrictEqual(pipe(input, RA.takeLeft(2)), [1, 2])
- *
- * // out of bounds
- * assert.strictEqual(pipe(input, RA.takeLeft(4)), input)
- * assert.strictEqual(pipe(input, RA.takeLeft(-1)), input)
- *
- * @category combinators
- * @since 2.5.0
- */
-var takeLeft = function (n) { return function (as) {
-    return exports.isOutOfBound(n, as) ? as : n === 0 ? exports.empty : as.slice(0, n);
-}; };
-exports.takeLeft = takeLeft;
-/**
- * Keep only a max number of elements from the end of an `ReadonlyArray`, creating a new `ReadonlyArray`.
- *
- * **Note**. `n` is normalized to a non negative integer.
- *
- * @example
- * import * as RA from 'fp-ts/ReadonlyArray'
- * import { pipe } from 'fp-ts/function'
- *
- * const input: ReadonlyArray<number> = [1, 2, 3]
- * assert.deepStrictEqual(pipe(input, RA.takeRight(2)), [2, 3])
- *
- * // out of bounds
- * assert.strictEqual(pipe(input, RA.takeRight(4)), input)
- * assert.strictEqual(pipe(input, RA.takeRight(-1)), input)
- *
- * @category combinators
- * @since 2.5.0
- */
-var takeRight = function (n) { return function (as) {
-    return exports.isOutOfBound(n, as) ? as : n === 0 ? exports.empty : as.slice(-n);
-}; };
-exports.takeRight = takeRight;
-function takeLeftWhile(predicate) {
-    return function (as) {
-        var out = [];
-        for (var _i = 0, as_1 = as; _i < as_1.length; _i++) {
-            var a = as_1[_i];
-            if (!predicate(a)) {
-                break;
-            }
-            out.push(a);
-        }
-        var len = out.length;
-        return len === as.length ? as : len === 0 ? exports.empty : out;
-    };
-}
-exports.takeLeftWhile = takeLeftWhile;
-var spanLeftIndex = function (as, predicate) {
-    var l = as.length;
-    var i = 0;
-    for (; i < l; i++) {
-        if (!predicate(as[i])) {
-            break;
-        }
-    }
-    return i;
-};
-function spanLeft(predicate) {
-    return function (as) {
-        var _a = exports.splitAt(spanLeftIndex(as, predicate))(as), init = _a[0], rest = _a[1];
-        return { init: init, rest: rest };
-    };
-}
-exports.spanLeft = spanLeft;
-/**
- * Drop a max number of elements from the start of an `ReadonlyArray`, creating a new `ReadonlyArray`.
- *
- * **Note**. `n` is normalized to a non negative integer.
- *
- * @example
- * import * as RA from 'fp-ts/ReadonlyArray'
- * import { pipe } from 'fp-ts/function'
- *
- * const input: ReadonlyArray<number> = [1, 2, 3]
- * assert.deepStrictEqual(pipe(input, RA.dropLeft(2)), [3])
- * assert.strictEqual(pipe(input, RA.dropLeft(0)), input)
- * assert.strictEqual(pipe(input, RA.dropLeft(-1)), input)
- *
- * @category combinators
- * @since 2.5.0
- */
-var dropLeft = function (n) { return function (as) {
-    return n <= 0 || exports.isEmpty(as) ? as : n >= as.length ? exports.empty : as.slice(n, as.length);
-}; };
-exports.dropLeft = dropLeft;
-/**
- * Drop a max number of elements from the end of an `ReadonlyArray`, creating a new `ReadonlyArray`.
- *
- * **Note**. `n` is normalized to a non negative integer.
- *
- * @example
- * import * as RA from 'fp-ts/ReadonlyArray'
- * import { pipe } from 'fp-ts/function'
- *
- * const input: ReadonlyArray<number> = [1, 2, 3]
- * assert.deepStrictEqual(pipe(input, RA.dropRight(2)), [1])
- * assert.strictEqual(pipe(input, RA.dropRight(0)), input)
- * assert.strictEqual(pipe(input, RA.dropRight(-1)), input)
- *
- * @category combinators
- * @since 2.5.0
- */
-var dropRight = function (n) { return function (as) {
-    return n <= 0 || exports.isEmpty(as) ? as : n >= as.length ? exports.empty : as.slice(0, as.length - n);
-}; };
-exports.dropRight = dropRight;
-function dropLeftWhile(predicate) {
-    return function (as) {
-        var i = spanLeftIndex(as, predicate);
-        return i === 0 ? as : i === as.length ? exports.empty : as.slice(i);
-    };
-}
-exports.dropLeftWhile = dropLeftWhile;
-/**
- * Find the first index for which a predicate holds
- *
- * @example
- * import { findIndex } from 'fp-ts/ReadonlyArray'
- * import { some, none } from 'fp-ts/Option'
- *
- * assert.deepStrictEqual(findIndex((n: number) => n === 2)([1, 2, 3]), some(1))
- * assert.deepStrictEqual(findIndex((n: number) => n === 2)([]), none)
- *
- * @since 2.5.0
- */
-var findIndex = function (predicate) { return function (as) {
-    for (var i = 0; i < as.length; i++) {
-        if (predicate(as[i])) {
-            return _.some(i);
-        }
-    }
-    return _.none;
-}; };
-exports.findIndex = findIndex;
-function findFirst(predicate) {
-    return function (as) {
-        for (var i = 0; i < as.length; i++) {
-            if (predicate(as[i])) {
-                return _.some(as[i]);
-            }
-        }
-        return _.none;
-    };
-}
-exports.findFirst = findFirst;
-/**
- * Find the first element returned by an option based selector function
- *
- * @example
- * import { findFirstMap } from 'fp-ts/ReadonlyArray'
- * import { some, none } from 'fp-ts/Option'
- *
- * interface Person {
- *   readonly name: string
- *   readonly age?: number
- * }
- *
- * const persons: ReadonlyArray<Person> = [{ name: 'John' }, { name: 'Mary', age: 45 }, { name: 'Joey', age: 28 }]
- *
- * // returns the name of the first person that has an age
- * assert.deepStrictEqual(findFirstMap((p: Person) => (p.age === undefined ? none : some(p.name)))(persons), some('Mary'))
- *
- * @since 2.5.0
- */
-var findFirstMap = function (f) { return function (as) {
-    for (var i = 0; i < as.length; i++) {
-        var out = f(as[i]);
-        if (_.isSome(out)) {
-            return out;
-        }
-    }
-    return _.none;
-}; };
-exports.findFirstMap = findFirstMap;
-function findLast(predicate) {
-    return function (as) {
-        for (var i = as.length - 1; i >= 0; i--) {
-            if (predicate(as[i])) {
-                return _.some(as[i]);
-            }
-        }
-        return _.none;
-    };
-}
-exports.findLast = findLast;
-/**
- * Find the last element returned by an option based selector function
- *
- * @example
- * import { findLastMap } from 'fp-ts/ReadonlyArray'
- * import { some, none } from 'fp-ts/Option'
- *
- * interface Person {
- *   readonly name: string
- *   readonly age?: number
- * }
- *
- * const persons: ReadonlyArray<Person> = [{ name: 'John' }, { name: 'Mary', age: 45 }, { name: 'Joey', age: 28 }]
- *
- * // returns the name of the last person that has an age
- * assert.deepStrictEqual(findLastMap((p: Person) => (p.age === undefined ? none : some(p.name)))(persons), some('Joey'))
- *
- * @since 2.5.0
- */
-var findLastMap = function (f) { return function (as) {
-    for (var i = as.length - 1; i >= 0; i--) {
-        var out = f(as[i]);
-        if (_.isSome(out)) {
-            return out;
-        }
-    }
-    return _.none;
-}; };
-exports.findLastMap = findLastMap;
-/**
- * Returns the index of the last element of the list which matches the predicate
- *
- * @example
- * import { findLastIndex } from 'fp-ts/ReadonlyArray'
- * import { some, none } from 'fp-ts/Option'
- *
- * interface X {
- *   readonly a: number
- *   readonly b: number
- * }
- * const xs: ReadonlyArray<X> = [{ a: 1, b: 0 }, { a: 1, b: 1 }]
- * assert.deepStrictEqual(findLastIndex((x: { readonly a: number }) => x.a === 1)(xs), some(1))
- * assert.deepStrictEqual(findLastIndex((x: { readonly a: number }) => x.a === 4)(xs), none)
- *
- *
- * @since 2.5.0
- */
-var findLastIndex = function (predicate) { return function (as) {
-    for (var i = as.length - 1; i >= 0; i--) {
-        if (predicate(as[i])) {
-            return _.some(i);
-        }
-    }
-    return _.none;
-}; };
-exports.findLastIndex = findLastIndex;
-/**
- * Insert an element at the specified index, creating a new array, or returning `None` if the index is out of bounds
- *
- * @example
- * import { insertAt } from 'fp-ts/ReadonlyArray'
- * import { some } from 'fp-ts/Option'
- *
- * assert.deepStrictEqual(insertAt(2, 5)([1, 2, 3, 4]), some([1, 2, 5, 3, 4]))
- *
- * @since 2.5.0
- */
-var insertAt = function (i, a) { return function (as) {
-    return i < 0 || i > as.length ? _.none : _.some(RNEA.unsafeInsertAt(i, a, as));
-}; };
-exports.insertAt = insertAt;
-/**
- * Change the element at the specified index, creating a new array, or returning `None` if the index is out of bounds
- *
- * @example
- * import { updateAt } from 'fp-ts/ReadonlyArray'
- * import { some, none } from 'fp-ts/Option'
- *
- * assert.deepStrictEqual(updateAt(1, 1)([1, 2, 3]), some([1, 1, 3]))
- * assert.deepStrictEqual(updateAt(1, 1)([]), none)
- *
- * @since 2.5.0
- */
-var updateAt = function (i, a) {
-    return exports.modifyAt(i, function () { return a; });
-};
-exports.updateAt = updateAt;
-/**
- * Delete the element at the specified index, creating a new array, or returning `None` if the index is out of bounds
- *
- * @example
- * import { deleteAt } from 'fp-ts/ReadonlyArray'
- * import { some, none } from 'fp-ts/Option'
- *
- * assert.deepStrictEqual(deleteAt(0)([1, 2, 3]), some([2, 3]))
- * assert.deepStrictEqual(deleteAt(1)([]), none)
- *
- * @since 2.5.0
- */
-var deleteAt = function (i) { return function (as) {
-    return exports.isOutOfBound(i, as) ? _.none : _.some(exports.unsafeDeleteAt(i, as));
-}; };
-exports.deleteAt = deleteAt;
-/**
- * Apply a function to the element at the specified index, creating a new array, or returning `None` if the index is out
- * of bounds
- *
- * @example
- * import { modifyAt } from 'fp-ts/ReadonlyArray'
- * import { some, none } from 'fp-ts/Option'
- *
- * const double = (x: number): number => x * 2
- * assert.deepStrictEqual(modifyAt(1, double)([1, 2, 3]), some([1, 4, 3]))
- * assert.deepStrictEqual(modifyAt(1, double)([]), none)
- *
- * @since 2.5.0
- */
-var modifyAt = function (i, f) { return function (as) {
-    return exports.isOutOfBound(i, as) ? _.none : _.some(exports.unsafeUpdateAt(i, f(as[i]), as));
-}; };
-exports.modifyAt = modifyAt;
-/**
- * Reverse an array, creating a new array
- *
- * @example
- * import { reverse } from 'fp-ts/ReadonlyArray'
- *
- * assert.deepStrictEqual(reverse([1, 2, 3]), [3, 2, 1])
- *
- * @category combinators
- * @since 2.5.0
- */
-var reverse = function (as) { return (as.length <= 1 ? as : as.slice().reverse()); };
-exports.reverse = reverse;
-/**
- * Extracts from an array of `Either` all the `Right` elements. All the `Right` elements are extracted in order
- *
- * @example
- * import { rights } from 'fp-ts/ReadonlyArray'
- * import { right, left } from 'fp-ts/Either'
- *
- * assert.deepStrictEqual(rights([right(1), left('foo'), right(2)]), [1, 2])
- *
- * @category combinators
- * @since 2.5.0
- */
-var rights = function (as) {
-    var r = [];
-    for (var i = 0; i < as.length; i++) {
-        var a = as[i];
-        if (a._tag === 'Right') {
-            r.push(a.right);
-        }
-    }
-    return r;
-};
-exports.rights = rights;
-/**
- * Extracts from an array of `Either` all the `Left` elements. All the `Left` elements are extracted in order
- *
- * @example
- * import { lefts } from 'fp-ts/ReadonlyArray'
- * import { left, right } from 'fp-ts/Either'
- *
- * assert.deepStrictEqual(lefts([right(1), left('foo'), right(2)]), ['foo'])
- *
- * @category combinators
- * @since 2.5.0
- */
-var lefts = function (as) {
-    var r = [];
-    for (var i = 0; i < as.length; i++) {
-        var a = as[i];
-        if (a._tag === 'Left') {
-            r.push(a.left);
-        }
-    }
-    return r;
-};
-exports.lefts = lefts;
-/**
- * Sort the elements of an array in increasing order, creating a new array
- *
- * @example
- * import { sort } from 'fp-ts/ReadonlyArray'
- * import * as N from 'fp-ts/number'
- *
- * assert.deepStrictEqual(sort(N.Ord)([3, 2, 1]), [1, 2, 3])
- *
- * @category combinators
- * @since 2.5.0
- */
-var sort = function (O) { return function (as) {
-    return as.length <= 1 ? as : as.slice().sort(O.compare);
-}; };
-exports.sort = sort;
-// TODO: curry and make data-last in v3
-/**
- * Apply a function to pairs of elements at the same index in two arrays, collecting the results in a new array. If one
- * input array is short, excess elements of the longer array are discarded.
- *
- * @example
- * import { zipWith } from 'fp-ts/ReadonlyArray'
- *
- * assert.deepStrictEqual(zipWith([1, 2, 3], ['a', 'b', 'c', 'd'], (n, s) => s + n), ['a1', 'b2', 'c3'])
- *
- * @category combinators
- * @since 2.5.0
- */
-var zipWith = function (fa, fb, f) {
-    var fc = [];
-    var len = Math.min(fa.length, fb.length);
-    for (var i = 0; i < len; i++) {
-        fc[i] = f(fa[i], fb[i]);
-    }
-    return fc;
-};
-exports.zipWith = zipWith;
-function zip(as, bs) {
-    if (bs === undefined) {
-        return function (bs) { return zip(bs, as); };
-    }
-    return exports.zipWith(as, bs, function (a, b) { return [a, b]; });
-}
-exports.zip = zip;
-/**
- * The function is reverse of `zip`. Takes an array of pairs and return two corresponding arrays
- *
- * @example
- * import { unzip } from 'fp-ts/ReadonlyArray'
- *
- * assert.deepStrictEqual(unzip([[1, 'a'], [2, 'b'], [3, 'c']]), [[1, 2, 3], ['a', 'b', 'c']])
- *
- * @category combinators
- * @since 2.5.0
- */
-var unzip = function (as) {
-    var fa = [];
-    var fb = [];
-    for (var i = 0; i < as.length; i++) {
-        fa[i] = as[i][0];
-        fb[i] = as[i][1];
-    }
-    return [fa, fb];
-};
-exports.unzip = unzip;
-/**
- * Prepend an element to every member of an array
- *
- * @example
- * import { prependAll } from 'fp-ts/ReadonlyArray'
- *
- * assert.deepStrictEqual(prependAll(9)([1, 2, 3, 4]), [9, 1, 9, 2, 9, 3, 9, 4])
- *
- * @category combinators
- * @since 2.10.0
- */
-var prependAll = function (middle) {
-    var f = RNEA.prependAll(middle);
-    return function (as) { return (exports.isNonEmpty(as) ? f(as) : as); };
-};
-exports.prependAll = prependAll;
-/**
- * Places an element in between members of an array
- *
- * @example
- * import { intersperse } from 'fp-ts/ReadonlyArray'
- *
- * assert.deepStrictEqual(intersperse(9)([1, 2, 3, 4]), [1, 9, 2, 9, 3, 9, 4])
- *
- * @category combinators
- * @since 2.9.0
- */
-var intersperse = function (middle) {
-    var f = RNEA.intersperse(middle);
-    return function (as) { return (exports.isNonEmpty(as) ? f(as) : as); };
-};
-exports.intersperse = intersperse;
-/**
- * Rotate a `ReadonlyArray` by `n` steps.
- *
- * @example
- * import { rotate } from 'fp-ts/ReadonlyArray'
- *
- * assert.deepStrictEqual(rotate(2)([1, 2, 3, 4, 5]), [4, 5, 1, 2, 3])
- *
- * @category combinators
- * @since 2.5.0
- */
-var rotate = function (n) {
-    var f = RNEA.rotate(n);
-    return function (as) { return (exports.isNonEmpty(as) ? f(as) : as); };
-};
-exports.rotate = rotate;
-function elem(E) {
-    return function (a, as) {
-        if (as === undefined) {
-            var elemE_1 = elem(E);
-            return function (as) { return elemE_1(a, as); };
-        }
-        var predicate = function (element) { return E.equals(element, a); };
-        var i = 0;
-        for (; i < as.length; i++) {
-            if (predicate(as[i])) {
-                return true;
-            }
-        }
-        return false;
-    };
-}
-exports.elem = elem;
-/**
- * Remove duplicates from an array, keeping the first occurrence of an element.
- *
- * @example
- * import { uniq } from 'fp-ts/ReadonlyArray'
- * import * as N from 'fp-ts/number'
- *
- * assert.deepStrictEqual(uniq(N.Eq)([1, 2, 1]), [1, 2])
- *
- * @category combinators
- * @since 2.5.0
- */
-var uniq = function (E) {
-    var f = RNEA.uniq(E);
-    return function (as) { return (exports.isNonEmpty(as) ? f(as) : as); };
-};
-exports.uniq = uniq;
-/**
- * Sort the elements of an array in increasing order, where elements are compared using first `ords[0]`, then `ords[1]`,
- * etc...
- *
- * @example
- * import { sortBy } from 'fp-ts/ReadonlyArray'
- * import { contramap } from 'fp-ts/Ord'
- * import * as S from 'fp-ts/string'
- * import * as N from 'fp-ts/number'
- * import { pipe } from 'fp-ts/function'
- *
- * interface Person {
- *   readonly name: string
- *   readonly age: number
- * }
- * const byName = pipe(S.Ord, contramap((p: Person) => p.name))
- * const byAge = pipe(N.Ord, contramap((p: Person) => p.age))
- *
- * const sortByNameByAge = sortBy([byName, byAge])
- *
- * const persons = [{ name: 'a', age: 1 }, { name: 'b', age: 3 }, { name: 'c', age: 2 }, { name: 'b', age: 2 }]
- * assert.deepStrictEqual(sortByNameByAge(persons), [
- *   { name: 'a', age: 1 },
- *   { name: 'b', age: 2 },
- *   { name: 'b', age: 3 },
- *   { name: 'c', age: 2 }
- * ])
- *
- * @category combinators
- * @since 2.5.0
- */
-var sortBy = function (ords) {
-    var f = RNEA.sortBy(ords);
-    return function (as) { return (exports.isNonEmpty(as) ? f(as) : as); };
-};
-exports.sortBy = sortBy;
-/**
- * A useful recursion pattern for processing a `ReadonlyArray` to produce a new `ReadonlyArray`, often used for "chopping" up the input
- * `ReadonlyArray`. Typically `chop` is called with some function that will consume an initial prefix of the `ReadonlyArray` and produce a
- * value and the tail of the `ReadonlyArray`.
- *
- * @example
- * import { Eq } from 'fp-ts/Eq'
- * import * as RA from 'fp-ts/ReadonlyArray'
- * import * as N from 'fp-ts/number'
- * import { pipe } from 'fp-ts/function'
- *
- * const group = <A>(S: Eq<A>): ((as: ReadonlyArray<A>) => ReadonlyArray<ReadonlyArray<A>>) => {
- *   return RA.chop(as => {
- *     const { init, rest } = pipe(as, RA.spanLeft((a: A) => S.equals(a, as[0])))
- *     return [init, rest]
- *   })
- * }
- * assert.deepStrictEqual(group(N.Eq)([1, 1, 2, 3, 3, 4]), [[1, 1], [2], [3, 3], [4]])
- *
- * @category combinators
- * @since 2.5.0
- */
-var chop = function (f) {
-    var g = RNEA.chop(f);
-    return function (as) { return (exports.isNonEmpty(as) ? g(as) : exports.empty); };
-};
-exports.chop = chop;
-/**
- * Splits a `ReadonlyArray` into two pieces, the first piece has max `n` elements.
- *
- * @example
- * import { splitAt } from 'fp-ts/ReadonlyArray'
- *
- * assert.deepStrictEqual(splitAt(2)([1, 2, 3, 4, 5]), [[1, 2], [3, 4, 5]])
- *
- * @category combinators
- * @since 2.5.0
- */
-var splitAt = function (n) { return function (as) {
-    return n >= 1 && exports.isNonEmpty(as) ? RNEA.splitAt(n)(as) : exports.isEmpty(as) ? [as, exports.empty] : [exports.empty, as];
-}; };
-exports.splitAt = splitAt;
-/**
- * Splits a `ReadonlyArray` into length-`n` pieces. The last piece will be shorter if `n` does not evenly divide the length of
- * the `ReadonlyArray`. Note that `chunksOf(n)([])` is `[]`, not `[[]]`. This is intentional, and is consistent with a recursive
- * definition of `chunksOf`; it satisfies the property that:
- *
- * ```ts
- * chunksOf(n)(xs).concat(chunksOf(n)(ys)) == chunksOf(n)(xs.concat(ys)))
- * ```
- *
- * whenever `n` evenly divides the length of `as`.
- *
- * @example
- * import { chunksOf } from 'fp-ts/ReadonlyArray'
- *
- * assert.deepStrictEqual(chunksOf(2)([1, 2, 3, 4, 5]), [[1, 2], [3, 4], [5]])
- *
- * @category combinators
- * @since 2.5.0
- */
-var chunksOf = function (n) {
-    var f = RNEA.chunksOf(n);
-    return function (as) { return (exports.isNonEmpty(as) ? f(as) : exports.empty); };
-};
-exports.chunksOf = chunksOf;
-/**
- * @category combinators
- * @since 2.11.0
- */
-var fromOptionK = function (f) { return function () {
-    var a = [];
-    for (var _i = 0; _i < arguments.length; _i++) {
-        a[_i] = arguments[_i];
-    }
-    return exports.fromOption(f.apply(void 0, a));
-}; };
-exports.fromOptionK = fromOptionK;
-function comprehension(input, f, g) {
-    if (g === void 0) { g = function () { return true; }; }
-    var go = function (scope, input) {
-        return exports.isNonEmpty(input)
-            ? _function.pipe(RNEA.head(input), exports.chain(function (x) { return go(_function.pipe(scope, exports.append(x)), RNEA.tail(input)); }))
-            : g.apply(void 0, scope) ? [f.apply(void 0, scope)]
-                : exports.empty;
-    };
-    return go(exports.empty, input);
-}
-exports.comprehension = comprehension;
-/**
- * @category combinators
- * @since 2.11.0
- */
-var concatW = function (second) { return function (first) {
-    return exports.isEmpty(first) ? second : exports.isEmpty(second) ? first : first.concat(second);
-}; };
-exports.concatW = concatW;
-/**
- * @category combinators
- * @since 2.11.0
- */
-exports.concat = exports.concatW;
-function union(E) {
-    var unionE = RNEA.union(E);
-    return function (first, second) {
-        if (second === undefined) {
-            var unionE_1 = union(E);
-            return function (second) { return unionE_1(second, first); };
-        }
-        return exports.isNonEmpty(first) && exports.isNonEmpty(second) ? unionE(second)(first) : exports.isNonEmpty(first) ? first : second;
-    };
-}
-exports.union = union;
-function intersection(E) {
-    var elemE = elem(E);
-    return function (xs, ys) {
-        if (ys === undefined) {
-            var intersectionE_1 = intersection(E);
-            return function (ys) { return intersectionE_1(ys, xs); };
-        }
-        return xs.filter(function (a) { return elemE(a, ys); });
-    };
-}
-exports.intersection = intersection;
-function difference(E) {
-    var elemE = elem(E);
-    return function (xs, ys) {
-        if (ys === undefined) {
-            var differenceE_1 = difference(E);
-            return function (ys) { return differenceE_1(ys, xs); };
-        }
-        return xs.filter(function (a) { return !elemE(a, ys); });
-    };
-}
-exports.difference = difference;
-// -------------------------------------------------------------------------------------
-// non-pipeables
-// -------------------------------------------------------------------------------------
-var _map = function (fa, f) { return _function.pipe(fa, exports.map(f)); };
-var _mapWithIndex = function (fa, f) { return _function.pipe(fa, exports.mapWithIndex(f)); };
-var _ap = function (fab, fa) { return _function.pipe(fab, exports.ap(fa)); };
-var _chain = function (ma, f) { return _function.pipe(ma, exports.chain(f)); };
-var _filter = function (fa, predicate) {
-    return _function.pipe(fa, exports.filter(predicate));
-};
-var _filterMap = function (fa, f) { return _function.pipe(fa, exports.filterMap(f)); };
-var _partition = function (fa, predicate) {
-    return _function.pipe(fa, exports.partition(predicate));
-};
-var _partitionMap = function (fa, f) { return _function.pipe(fa, exports.partitionMap(f)); };
-var _partitionWithIndex = function (fa, predicateWithIndex) { return _function.pipe(fa, exports.partitionWithIndex(predicateWithIndex)); };
-var _partitionMapWithIndex = function (fa, f) { return _function.pipe(fa, exports.partitionMapWithIndex(f)); };
-var _alt = function (fa, that) { return _function.pipe(fa, exports.alt(that)); };
-var _reduce = function (fa, b, f) { return _function.pipe(fa, exports.reduce(b, f)); };
-var _foldMap = function (M) {
-    var foldMapM = exports.foldMap(M);
-    return function (fa, f) { return _function.pipe(fa, foldMapM(f)); };
-};
-var _reduceRight = function (fa, b, f) { return _function.pipe(fa, exports.reduceRight(b, f)); };
-var _reduceWithIndex = function (fa, b, f) {
-    return _function.pipe(fa, exports.reduceWithIndex(b, f));
-};
-var _foldMapWithIndex = function (M) {
-    var foldMapWithIndexM = exports.foldMapWithIndex(M);
-    return function (fa, f) { return _function.pipe(fa, foldMapWithIndexM(f)); };
-};
-var _reduceRightWithIndex = function (fa, b, f) {
-    return _function.pipe(fa, exports.reduceRightWithIndex(b, f));
-};
-var _filterMapWithIndex = function (fa, f) { return _function.pipe(fa, exports.filterMapWithIndex(f)); };
-var _filterWithIndex = function (fa, predicateWithIndex) { return _function.pipe(fa, exports.filterWithIndex(predicateWithIndex)); };
-var _extend = function (fa, f) { return _function.pipe(fa, exports.extend(f)); };
-var _traverse = function (F) {
-    var traverseF = exports.traverse(F);
-    return function (ta, f) { return _function.pipe(ta, traverseF(f)); };
-};
-/* istanbul ignore next */
-var _traverseWithIndex = function (F) {
-    var traverseWithIndexF = exports.traverseWithIndex(F);
-    return function (ta, f) { return _function.pipe(ta, traverseWithIndexF(f)); };
-};
-/** @internal */
-var _chainRecDepthFirst = function (a, f) { return _function.pipe(a, exports.chainRecDepthFirst(f)); };
-exports._chainRecDepthFirst = _chainRecDepthFirst;
-/** @internal */
-var _chainRecBreadthFirst = function (a, f) { return _function.pipe(a, exports.chainRecBreadthFirst(f)); };
-exports._chainRecBreadthFirst = _chainRecBreadthFirst;
-// -------------------------------------------------------------------------------------
-// type class members
-// -------------------------------------------------------------------------------------
-/**
- * @category Pointed
- * @since 2.5.0
- */
-exports.of = RNEA.of;
-/**
- * @category Zero
- * @since 2.7.0
- */
-var zero = function () { return exports.empty; };
-exports.zero = zero;
-/**
- * Less strict version of [`alt`](#alt).
- *
- * @category Alt
- * @since 2.9.0
- */
-var altW = function (that) { return function (fa) {
-    return fa.concat(that());
-}; };
-exports.altW = altW;
-/**
- * Identifies an associative operation on a type constructor. It is similar to `Semigroup`, except that it applies to
- * types of kind `* -> *`.
- *
- * @category Alt
- * @since 2.5.0
- */
-exports.alt = exports.altW;
-/**
- * Apply a function to an argument under a type constructor.
- *
- * @category Apply
- * @since 2.5.0
- */
-var ap = function (fa) {
-    return exports.chain(function (f) { return _function.pipe(fa, exports.map(f)); });
-};
-exports.ap = ap;
-/**
- * Composes computations in sequence, using the return value of one computation to determine the next computation.
- *
- * @category Monad
- * @since 2.5.0
- */
-var chain = function (f) { return function (ma) {
-    return _function.pipe(ma, exports.chainWithIndex(function (_, a) { return f(a); }));
-}; };
-exports.chain = chain;
-/**
- * Derivable from `Chain`.
- *
- * @category combinators
- * @since 2.5.0
- */
-exports.flatten = 
-/*#__PURE__*/
-exports.chain(_function.identity);
-/**
- * `map` can be used to turn functions `(a: A) => B` into functions `(fa: F<A>) => F<B>` whose argument and return types
- * use the type constructor `F` to represent some computational context.
- *
- * @category Functor
- * @since 2.5.0
- */
-var map = function (f) { return function (fa) {
-    return fa.map(function (a) { return f(a); });
-}; };
-exports.map = map;
-/**
- * @category FunctorWithIndex
- * @since 2.5.0
- */
-var mapWithIndex = function (f) { return function (fa) { return fa.map(function (a, i) { return f(i, a); }); }; };
-exports.mapWithIndex = mapWithIndex;
-/**
- * @category Compactable
- * @since 2.5.0
- */
-var separate = function (fa) {
-    var left = [];
-    var right = [];
-    for (var _i = 0, fa_1 = fa; _i < fa_1.length; _i++) {
-        var e = fa_1[_i];
-        if (e._tag === 'Left') {
-            left.push(e.left);
-        }
-        else {
-            right.push(e.right);
-        }
-    }
-    return Separated.separated(left, right);
-};
-exports.separate = separate;
-/**
- * @category Filterable
- * @since 2.5.0
- */
-var filter = function (predicate) { return function (as) { return as.filter(predicate); }; };
-exports.filter = filter;
-/**
- * @category FilterableWithIndex
- * @since 2.5.0
- */
-var filterMapWithIndex = function (f) { return function (fa) {
-    var out = [];
-    for (var i = 0; i < fa.length; i++) {
-        var optionB = f(i, fa[i]);
-        if (_.isSome(optionB)) {
-            out.push(optionB.value);
-        }
-    }
-    return out;
-}; };
-exports.filterMapWithIndex = filterMapWithIndex;
-/**
- * @category Filterable
- * @since 2.5.0
- */
-var filterMap = function (f) {
-    return exports.filterMapWithIndex(function (_, a) { return f(a); });
-};
-exports.filterMap = filterMap;
-/**
- * @category Compactable
- * @since 2.5.0
- */
-exports.compact = 
-/*#__PURE__*/
-exports.filterMap(_function.identity);
-/**
- * @category Filterable
- * @since 2.5.0
- */
-var partition = function (predicate) {
-    return exports.partitionWithIndex(function (_, a) { return predicate(a); });
-};
-exports.partition = partition;
-/**
- * @category FilterableWithIndex
- * @since 2.5.0
- */
-var partitionWithIndex = function (predicateWithIndex) { return function (as) {
-    var left = [];
-    var right = [];
-    for (var i = 0; i < as.length; i++) {
-        var a = as[i];
-        if (predicateWithIndex(i, a)) {
-            right.push(a);
-        }
-        else {
-            left.push(a);
-        }
-    }
-    return Separated.separated(left, right);
-}; };
-exports.partitionWithIndex = partitionWithIndex;
-/**
- * @category Filterable
- * @since 2.5.0
- */
-var partitionMap = function (f) {
-    return exports.partitionMapWithIndex(function (_, a) { return f(a); });
-};
-exports.partitionMap = partitionMap;
-/**
- * @category FilterableWithIndex
- * @since 2.5.0
- */
-var partitionMapWithIndex = function (f) { return function (fa) {
-    var left = [];
-    var right = [];
-    for (var i = 0; i < fa.length; i++) {
-        var e = f(i, fa[i]);
-        if (e._tag === 'Left') {
-            left.push(e.left);
-        }
-        else {
-            right.push(e.right);
-        }
-    }
-    return Separated.separated(left, right);
-}; };
-exports.partitionMapWithIndex = partitionMapWithIndex;
-/**
- * @category FilterableWithIndex
- * @since 2.5.0
- */
-var filterWithIndex = function (predicateWithIndex) { return function (as) {
-    return as.filter(function (a, i) { return predicateWithIndex(i, a); });
-}; };
-exports.filterWithIndex = filterWithIndex;
-/**
- * @category Extend
- * @since 2.5.0
- */
-var extend = function (f) { return function (wa) { return wa.map(function (_, i) { return f(wa.slice(i)); }); }; };
-exports.extend = extend;
-/**
- * Derivable from `Extend`.
- *
- * @category combinators
- * @since 2.5.0
- */
-exports.duplicate = 
-/*#__PURE__*/
-exports.extend(_function.identity);
-/**
- * @category FoldableWithIndex
- * @since 2.5.0
- */
-var foldMapWithIndex = function (M) { return function (f) { return function (fa) {
-    return fa.reduce(function (b, a, i) { return M.concat(b, f(i, a)); }, M.empty);
-}; }; };
-exports.foldMapWithIndex = foldMapWithIndex;
-/**
- * @category Foldable
- * @since 2.5.0
- */
-var reduce = function (b, f) {
-    return exports.reduceWithIndex(b, function (_, b, a) { return f(b, a); });
-};
-exports.reduce = reduce;
-/**
- * @category Foldable
- * @since 2.5.0
- */
-var foldMap = function (M) {
-    var foldMapWithIndexM = exports.foldMapWithIndex(M);
-    return function (f) { return foldMapWithIndexM(function (_, a) { return f(a); }); };
-};
-exports.foldMap = foldMap;
-/**
- * @category FoldableWithIndex
- * @since 2.5.0
- */
-var reduceWithIndex = function (b, f) { return function (fa) {
-    var len = fa.length;
-    var out = b;
-    for (var i = 0; i < len; i++) {
-        out = f(i, out, fa[i]);
-    }
-    return out;
-}; };
-exports.reduceWithIndex = reduceWithIndex;
-/**
- * @category Foldable
- * @since 2.5.0
- */
-var reduceRight = function (b, f) {
-    return exports.reduceRightWithIndex(b, function (_, a, b) { return f(a, b); });
-};
-exports.reduceRight = reduceRight;
-/**
- * @category FoldableWithIndex
- * @since 2.5.0
- */
-var reduceRightWithIndex = function (b, f) { return function (fa) { return fa.reduceRight(function (b, a, i) { return f(i, a, b); }, b); }; };
-exports.reduceRightWithIndex = reduceRightWithIndex;
-/**
- * @category Traversable
- * @since 2.6.3
- */
-var traverse = function (F) {
-    var traverseWithIndexF = exports.traverseWithIndex(F);
-    return function (f) { return traverseWithIndexF(function (_, a) { return f(a); }); };
-};
-exports.traverse = traverse;
-/**
- * @category Traversable
- * @since 2.6.3
- */
-var sequence = function (F) { return function (ta) {
-    return _reduce(ta, F.of(exports.zero()), function (fas, fa) {
-        return F.ap(F.map(fas, function (as) { return function (a) { return _function.pipe(as, exports.append(a)); }; }), fa);
-    });
-}; };
-exports.sequence = sequence;
-/**
- * @category TraversableWithIndex
- * @since 2.6.3
- */
-var traverseWithIndex = function (F) { return function (f) {
-    return exports.reduceWithIndex(F.of(exports.zero()), function (i, fbs, a) {
-        return F.ap(F.map(fbs, function (bs) { return function (b) { return _function.pipe(bs, exports.append(b)); }; }), f(i, a));
-    });
-}; };
-exports.traverseWithIndex = traverseWithIndex;
-/**
- * @category Witherable
- * @since 2.6.5
- */
-var wither = function (F) {
-    var _witherF = _wither(F);
-    return function (f) { return function (fa) { return _witherF(fa, f); }; };
-};
-exports.wither = wither;
-/**
- * @category Witherable
- * @since 2.6.5
- */
-var wilt = function (F) {
-    var _wiltF = _wilt(F);
-    return function (f) { return function (fa) { return _wiltF(fa, f); }; };
-};
-exports.wilt = wilt;
-/**
- * @category Unfoldable
- * @since 2.6.6
- */
-var unfold = function (b, f) {
-    var out = [];
-    var bb = b;
-    while (true) {
-        var mt = f(bb);
-        if (_.isSome(mt)) {
-            var _a = mt.value, a = _a[0], b_1 = _a[1];
-            out.push(a);
-            bb = b_1;
-        }
-        else {
-            break;
-        }
-    }
-    return out;
-};
-exports.unfold = unfold;
-// -------------------------------------------------------------------------------------
-// instances
-// -------------------------------------------------------------------------------------
-/**
- * @category instances
- * @since 2.5.0
- */
-exports.URI = 'ReadonlyArray';
-/**
- * @category instances
- * @since 2.5.0
- */
-var getShow = function (S) { return ({
-    show: function (as) { return "[" + as.map(S.show).join(', ') + "]"; }
-}); };
-exports.getShow = getShow;
-/**
- * @category instances
- * @since 2.5.0
- */
-var getSemigroup = function () { return ({
-    concat: function (first, second) { return (exports.isEmpty(first) ? second : exports.isEmpty(second) ? first : first.concat(second)); }
-}); };
-exports.getSemigroup = getSemigroup;
-/**
- * Returns a `Monoid` for `ReadonlyArray<A>`.
- *
- * @example
- * import { getMonoid } from 'fp-ts/ReadonlyArray'
- *
- * const M = getMonoid<number>()
- * assert.deepStrictEqual(M.concat([1, 2], [3, 4]), [1, 2, 3, 4])
- *
- * @category instances
- * @since 2.5.0
- */
-var getMonoid = function () { return ({
-    concat: exports.getSemigroup().concat,
-    empty: exports.empty
-}); };
-exports.getMonoid = getMonoid;
-/**
- * Derives an `Eq` over the `ReadonlyArray` of a given element type from the `Eq` of that type. The derived `Eq` defines two
- * arrays as equal if all elements of both arrays are compared equal pairwise with the given `E`. In case of arrays of
- * different lengths, the result is non equality.
- *
- * @example
- * import * as S from 'fp-ts/string'
- * import { getEq } from 'fp-ts/ReadonlyArray'
- *
- * const E = getEq(S.Eq)
- * assert.strictEqual(E.equals(['a', 'b'], ['a', 'b']), true)
- * assert.strictEqual(E.equals(['a'], []), false)
- *
- * @category instances
- * @since 2.5.0
- */
-var getEq = function (E) {
-    return Eq.fromEquals(function (xs, ys) { return xs.length === ys.length && xs.every(function (x, i) { return E.equals(x, ys[i]); }); });
-};
-exports.getEq = getEq;
-/**
- * Derives an `Ord` over the `ReadonlyArray` of a given element type from the `Ord` of that type. The ordering between two such
- * arrays is equal to: the first non equal comparison of each arrays elements taken pairwise in increasing order, in
- * case of equality over all the pairwise elements; the longest array is considered the greatest, if both arrays have
- * the same length, the result is equality.
- *
- * @example
- * import { getOrd } from 'fp-ts/ReadonlyArray'
- * import * as S from 'fp-ts/string'
- *
- * const O = getOrd(S.Ord)
- * assert.strictEqual(O.compare(['b'], ['a']), 1)
- * assert.strictEqual(O.compare(['a'], ['a']), 0)
- * assert.strictEqual(O.compare(['a'], ['b']), -1)
- *
- *
- * @category instances
- * @since 2.5.0
- */
-var getOrd = function (O) {
-    return Ord.fromCompare(function (a, b) {
-        var aLen = a.length;
-        var bLen = b.length;
-        var len = Math.min(aLen, bLen);
-        for (var i = 0; i < len; i++) {
-            var ordering = O.compare(a[i], b[i]);
-            if (ordering !== 0) {
-                return ordering;
-            }
-        }
-        return N.Ord.compare(aLen, bLen);
-    });
-};
-exports.getOrd = getOrd;
-/**
- * @category instances
- * @since 2.11.0
- */
-var getUnionSemigroup = function (E) {
-    var unionE = union(E);
-    return {
-        concat: function (first, second) { return unionE(second)(first); }
-    };
-};
-exports.getUnionSemigroup = getUnionSemigroup;
-/**
- * @category instances
- * @since 2.11.0
- */
-var getUnionMonoid = function (E) { return ({
-    concat: exports.getUnionSemigroup(E).concat,
-    empty: exports.empty
-}); };
-exports.getUnionMonoid = getUnionMonoid;
-/**
- * @category instances
- * @since 2.11.0
- */
-var getIntersectionSemigroup = function (E) {
-    var intersectionE = intersection(E);
-    return {
-        concat: function (first, second) { return intersectionE(second)(first); }
-    };
-};
-exports.getIntersectionSemigroup = getIntersectionSemigroup;
-/**
- * @category instances
- * @since 2.11.0
- */
-var getDifferenceMagma = function (E) {
-    var differenceE = difference(E);
-    return {
-        concat: function (first, second) { return differenceE(second)(first); }
-    };
-};
-exports.getDifferenceMagma = getDifferenceMagma;
-/**
- * @category instances
- * @since 2.7.0
- */
-exports.Functor = {
-    URI: exports.URI,
-    map: _map
-};
-/**
- * Derivable from `Functor`.
- *
- * @category combinators
- * @since 2.10.0
- */
-exports.flap = 
-/*#__PURE__*/
-Functor.flap(exports.Functor);
-/**
- * @category instances
- * @since 2.10.0
- */
-exports.Pointed = {
-    URI: exports.URI,
-    of: exports.of
-};
-/**
- * @category instances
- * @since 2.7.0
- */
-exports.FunctorWithIndex = {
-    URI: exports.URI,
-    map: _map,
-    mapWithIndex: _mapWithIndex
-};
-/**
- * @category instances
- * @since 2.10.0
- */
-exports.Apply = {
-    URI: exports.URI,
-    map: _map,
-    ap: _ap
-};
-/**
- * Combine two effectful actions, keeping only the result of the first.
- *
- * Derivable from `Apply`.
- *
- * @category combinators
- * @since 2.5.0
- */
-exports.apFirst = 
-/*#__PURE__*/
-Apply.apFirst(exports.Apply);
-/**
- * Combine two effectful actions, keeping only the result of the second.
- *
- * Derivable from `Apply`.
- *
- * @category combinators
- * @since 2.5.0
- */
-exports.apSecond = 
-/*#__PURE__*/
-Apply.apSecond(exports.Apply);
-/**
- * @category instances
- * @since 2.7.0
- */
-exports.Applicative = {
-    URI: exports.URI,
-    map: _map,
-    ap: _ap,
-    of: exports.of
-};
-/**
- * @category instances
- * @since 2.10.0
- */
-exports.Chain = {
-    URI: exports.URI,
-    map: _map,
-    ap: _ap,
-    chain: _chain
-};
-/**
- * @category instances
- * @since 2.7.0
- */
-exports.Monad = {
-    URI: exports.URI,
-    map: _map,
-    ap: _ap,
-    of: exports.of,
-    chain: _chain
-};
-/**
- * Composes computations in sequence, using the return value of one computation to determine the next computation and
- * keeping only the result of the first.
- *
- * Derivable from `Chain`.
- *
- * @category combinators
- * @since 2.5.0
- */
-exports.chainFirst = 
-/*#__PURE__*/
-Chain.chainFirst(exports.Chain);
-/**
- * @category instances
- * @since 2.7.0
- */
-exports.Unfoldable = {
-    URI: exports.URI,
-    unfold: exports.unfold
-};
-/**
- * @category instances
- * @since 2.7.0
- */
-exports.Alt = {
-    URI: exports.URI,
-    map: _map,
-    alt: _alt
-};
-/**
- * @category instances
- * @since 2.11.0
- */
-exports.Zero = {
-    URI: exports.URI,
-    zero: exports.zero
-};
-/**
- * @category constructors
- * @since 2.11.0
- */
-exports.guard = 
-/*#__PURE__*/
-Zero.guard(exports.Zero, exports.Pointed);
-/**
- * @category instances
- * @since 2.7.0
- */
-exports.Alternative = {
-    URI: exports.URI,
-    map: _map,
-    ap: _ap,
-    of: exports.of,
-    alt: _alt,
-    zero: exports.zero
-};
-/**
- * @category instances
- * @since 2.7.0
- */
-exports.Extend = {
-    URI: exports.URI,
-    map: _map,
-    extend: _extend
-};
-/**
- * @category instances
- * @since 2.7.0
- */
-exports.Compactable = {
-    URI: exports.URI,
-    compact: exports.compact,
-    separate: exports.separate
-};
-/**
- * @category instances
- * @since 2.7.0
- */
-exports.Filterable = {
-    URI: exports.URI,
-    map: _map,
-    compact: exports.compact,
-    separate: exports.separate,
-    filter: _filter,
-    filterMap: _filterMap,
-    partition: _partition,
-    partitionMap: _partitionMap
-};
-/**
- * @category instances
- * @since 2.7.0
- */
-exports.FilterableWithIndex = {
-    URI: exports.URI,
-    map: _map,
-    mapWithIndex: _mapWithIndex,
-    compact: exports.compact,
-    separate: exports.separate,
-    filter: _filter,
-    filterMap: _filterMap,
-    partition: _partition,
-    partitionMap: _partitionMap,
-    partitionMapWithIndex: _partitionMapWithIndex,
-    partitionWithIndex: _partitionWithIndex,
-    filterMapWithIndex: _filterMapWithIndex,
-    filterWithIndex: _filterWithIndex
-};
-/**
- * @category instances
- * @since 2.7.0
- */
-exports.Foldable = {
-    URI: exports.URI,
-    reduce: _reduce,
-    foldMap: _foldMap,
-    reduceRight: _reduceRight
-};
-/**
- * @category instances
- * @since 2.7.0
- */
-exports.FoldableWithIndex = {
-    URI: exports.URI,
-    reduce: _reduce,
-    foldMap: _foldMap,
-    reduceRight: _reduceRight,
-    reduceWithIndex: _reduceWithIndex,
-    foldMapWithIndex: _foldMapWithIndex,
-    reduceRightWithIndex: _reduceRightWithIndex
-};
-/**
- * @category instances
- * @since 2.7.0
- */
-exports.Traversable = {
-    URI: exports.URI,
-    map: _map,
-    reduce: _reduce,
-    foldMap: _foldMap,
-    reduceRight: _reduceRight,
-    traverse: _traverse,
-    sequence: exports.sequence
-};
-/**
- * @category instances
- * @since 2.7.0
- */
-exports.TraversableWithIndex = {
-    URI: exports.URI,
-    map: _map,
-    mapWithIndex: _mapWithIndex,
-    reduce: _reduce,
-    foldMap: _foldMap,
-    reduceRight: _reduceRight,
-    reduceWithIndex: _reduceWithIndex,
-    foldMapWithIndex: _foldMapWithIndex,
-    reduceRightWithIndex: _reduceRightWithIndex,
-    traverse: _traverse,
-    sequence: exports.sequence,
-    traverseWithIndex: _traverseWithIndex
-};
-/**
- * @category ChainRec
- * @since 2.11.0
- */
-var chainRecDepthFirst = function (f) { return function (a) {
-    var todo = __spreadArray([], f(a));
-    var out = [];
-    while (todo.length > 0) {
-        var e = todo.shift();
-        if (_.isLeft(e)) {
-            todo.unshift.apply(todo, f(e.left));
-        }
-        else {
-            out.push(e.right);
-        }
-    }
-    return out;
-}; };
-exports.chainRecDepthFirst = chainRecDepthFirst;
-/**
- * @category instances
- * @since 2.11.0
- */
-exports.ChainRecDepthFirst = {
-    URI: exports.URI,
-    map: _map,
-    ap: _ap,
-    chain: _chain,
-    chainRec: exports._chainRecDepthFirst
-};
-/**
- * @category ChainRec
- * @since 2.11.0
- */
-var chainRecBreadthFirst = function (f) { return function (a) {
-    var initial = f(a);
-    var todo = [];
-    var out = [];
-    function go(e) {
-        if (_.isLeft(e)) {
-            f(e.left).forEach(function (v) { return todo.push(v); });
-        }
-        else {
-            out.push(e.right);
-        }
-    }
-    for (var _i = 0, initial_1 = initial; _i < initial_1.length; _i++) {
-        var e = initial_1[_i];
-        go(e);
-    }
-    while (todo.length > 0) {
-        go(todo.shift());
-    }
-    return out;
-}; };
-exports.chainRecBreadthFirst = chainRecBreadthFirst;
-/**
- * @category instances
- * @since 2.11.0
- */
-exports.ChainRecBreadthFirst = {
-    URI: exports.URI,
-    map: _map,
-    ap: _ap,
-    chain: _chain,
-    chainRec: exports._chainRecBreadthFirst
-};
-var _wither = Witherable.witherDefault(exports.Traversable, exports.Compactable);
-var _wilt = Witherable.wiltDefault(exports.Traversable, exports.Compactable);
-/**
- * @category instances
- * @since 2.7.0
- */
-exports.Witherable = {
-    URI: exports.URI,
-    map: _map,
-    compact: exports.compact,
-    separate: exports.separate,
-    filter: _filter,
-    filterMap: _filterMap,
-    partition: _partition,
-    partitionMap: _partitionMap,
-    reduce: _reduce,
-    foldMap: _foldMap,
-    reduceRight: _reduceRight,
-    traverse: _traverse,
-    sequence: exports.sequence,
-    wither: _wither,
-    wilt: _wilt
-};
-/**
- * Filter values inside a context.
- *
- * @example
- * import { pipe } from 'fp-ts/function'
- * import * as RA from 'fp-ts/ReadonlyArray'
- * import * as T from 'fp-ts/Task'
- *
- * const filterE = RA.filterE(T.ApplicativePar)
- * async function test() {
- *   assert.deepStrictEqual(
- *     await pipe(
- *       [-1, 2, 3],
- *       filterE((n) => T.of(n > 0))
- *     )(),
- *     [2, 3]
- *   )
- * }
- * test()
- *
- * @since 2.11.0
- */
-exports.filterE = 
-/*#__PURE__*/
-Witherable.filterE(exports.Witherable);
-/**
- * @category instances
- * @since 2.11.0
- */
-exports.FromEither = {
-    URI: exports.URI,
-    fromEither: exports.fromEither
-};
-/**
- * @category combinators
- * @since 2.11.0
- */
-exports.fromEitherK = 
-/*#__PURE__*/
-FromEither.fromEitherK(exports.FromEither);
-// -------------------------------------------------------------------------------------
-// unsafe
-// -------------------------------------------------------------------------------------
-/**
- * @category unsafe
- * @since 2.5.0
- */
-exports.unsafeInsertAt = RNEA.unsafeInsertAt;
-/**
- * @category unsafe
- * @since 2.5.0
- */
-var unsafeUpdateAt = function (i, a, as) {
-    return exports.isNonEmpty(as) ? RNEA.unsafeUpdateAt(i, a, as) : as;
-};
-exports.unsafeUpdateAt = unsafeUpdateAt;
-/**
- * @category unsafe
- * @since 2.5.0
- */
-var unsafeDeleteAt = function (i, as) {
-    var xs = as.slice();
-    xs.splice(i, 1);
-    return xs;
-};
-exports.unsafeDeleteAt = unsafeDeleteAt;
-// -------------------------------------------------------------------------------------
-// interop
-// -------------------------------------------------------------------------------------
-/**
- * @category interop
- * @since 2.5.0
- */
-var toArray = function (as) { return as.slice(); };
-exports.toArray = toArray;
-/**
- * @category interop
- * @since 2.5.0
- */
-var fromArray = function (as) { return (exports.isEmpty(as) ? exports.empty : as.slice()); };
-exports.fromArray = fromArray;
-// -------------------------------------------------------------------------------------
-// utils
-// -------------------------------------------------------------------------------------
-/**
- * An empty array
- *
- * @since 2.5.0
- */
-exports.empty = RNEA.empty;
-/**
- * Check if a predicate holds true for every array member.
- *
- * @example
- * import { every } from 'fp-ts/ReadonlyArray'
- * import { pipe } from 'fp-ts/function'
- *
- * const isPositive = (n: number): boolean => n > 0
- *
- * assert.deepStrictEqual(pipe([1, 2, 3], every(isPositive)), true)
- * assert.deepStrictEqual(pipe([1, 2, -3], every(isPositive)), false)
- *
- * @since 2.9.0
- */
-var every = function (predicate) { return function (as) { return as.every(predicate); }; };
-exports.every = every;
-/**
- * Check if a predicate holds true for any array member.
- *
- * @example
- * import { some } from 'fp-ts/ReadonlyArray'
- * import { pipe } from 'fp-ts/function'
- *
- * const isPositive = (n: number): boolean => n > 0
- *
- * assert.deepStrictEqual(pipe([-1, -2, 3], some(isPositive)), true)
- * assert.deepStrictEqual(pipe([-1, -2, -3], some(isPositive)), false)
- *
- * @since 2.9.0
- */
-var some = function (predicate) { return function (as) {
-    return as.some(predicate);
-}; };
-exports.some = some;
-/**
- * Alias of [`some`](#some)
- *
- * @since 2.11.0
- */
-exports.exists = exports.some;
-// -------------------------------------------------------------------------------------
-// do notation
-// -------------------------------------------------------------------------------------
-/**
- * @since 2.9.0
- */
-exports.Do = 
-/*#__PURE__*/
-exports.of(_.emptyRecord);
-/**
- * @since 2.8.0
- */
-exports.bindTo = 
-/*#__PURE__*/
-Functor.bindTo(exports.Functor);
-/**
- * @since 2.8.0
- */
-exports.bind = 
-/*#__PURE__*/
-Chain.bind(exports.Chain);
-// -------------------------------------------------------------------------------------
-// pipeable sequence S
-// -------------------------------------------------------------------------------------
-/**
- * @since 2.8.0
- */
-exports.apS = 
-/*#__PURE__*/
-Apply.apS(exports.Apply);
-// -------------------------------------------------------------------------------------
-// deprecated
-// -------------------------------------------------------------------------------------
-// tslint:disable: deprecation
-/**
- * Use `ReadonlyNonEmptyArray` module instead.
- *
- * @category constructors
- * @since 2.5.0
- * @deprecated
- */
-exports.range = RNEA.range;
-/**
- * Use [`prepend`](#prepend) instead.
- *
- * @category constructors
- * @since 2.5.0
- * @deprecated
- */
-exports.cons = RNEA.cons;
-/**
- * Use [`append`](#append) instead.
- *
- * @category constructors
- * @since 2.5.0
- * @deprecated
- */
-exports.snoc = RNEA.snoc;
-/**
- * Use [`prependAll`](#prependall) instead.
- *
- * @category combinators
- * @since 2.9.0
- * @deprecated
- */
-exports.prependToAll = exports.prependAll;
-/**
- * Use small, specific instances instead.
- *
- * @category instances
- * @since 2.5.0
- * @deprecated
- */
-exports.readonlyArray = {
-    URI: exports.URI,
-    compact: exports.compact,
-    separate: exports.separate,
-    map: _map,
-    ap: _ap,
-    of: exports.of,
-    chain: _chain,
-    filter: _filter,
-    filterMap: _filterMap,
-    partition: _partition,
-    partitionMap: _partitionMap,
-    mapWithIndex: _mapWithIndex,
-    partitionMapWithIndex: _partitionMapWithIndex,
-    partitionWithIndex: _partitionWithIndex,
-    filterMapWithIndex: _filterMapWithIndex,
-    filterWithIndex: _filterWithIndex,
-    alt: _alt,
-    zero: exports.zero,
-    unfold: exports.unfold,
-    reduce: _reduce,
-    foldMap: _foldMap,
-    reduceRight: _reduceRight,
-    traverse: _traverse,
-    sequence: exports.sequence,
-    reduceWithIndex: _reduceWithIndex,
-    foldMapWithIndex: _foldMapWithIndex,
-    reduceRightWithIndex: _reduceRightWithIndex,
-    traverseWithIndex: _traverseWithIndex,
-    extend: _extend,
-    wither: _wither,
-    wilt: _wilt
-};
-});
-
-const ReadonlyArray$1 = /*@__PURE__*/getDefaultExportFromCjs(ReadonlyArray);
-
-var _Array = createCommonjsModule(function (module, exports) {
-"use strict";
-var __createBinding = (commonjsGlobal && commonjsGlobal.__createBinding) || (Object.create ? (function(o, m, k, k2) {
-    if (k2 === undefined) k2 = k;
-    Object.defineProperty(o, k2, { enumerable: true, get: function() { return m[k]; } });
-}) : (function(o, m, k, k2) {
-    if (k2 === undefined) k2 = k;
-    o[k2] = m[k];
-}));
-var __setModuleDefault = (commonjsGlobal && commonjsGlobal.__setModuleDefault) || (Object.create ? (function(o, v) {
-    Object.defineProperty(o, "default", { enumerable: true, value: v });
-}) : function(o, v) {
-    o["default"] = v;
-});
-var __importStar = (commonjsGlobal && commonjsGlobal.__importStar) || function (mod) {
-    if (mod && mod.__esModule) return mod;
-    var result = {};
-    if (mod != null) for (var k in mod) if (k !== "default" && Object.prototype.hasOwnProperty.call(mod, k)) __createBinding(result, mod, k);
-    __setModuleDefault(result, mod);
-    return result;
-};
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.lefts = exports.rights = exports.reverse = exports.modifyAt = exports.deleteAt = exports.updateAt = exports.insertAt = exports.copy = exports.findLastIndex = exports.findLastMap = exports.findLast = exports.findFirstMap = exports.findFirst = exports.findIndex = exports.dropLeftWhile = exports.dropRight = exports.dropLeft = exports.spanLeft = exports.takeLeftWhile = exports.takeRight = exports.takeLeft = exports.init = exports.tail = exports.last = exports.head = exports.lookup = exports.isOutOfBound = exports.size = exports.scanRight = exports.scanLeft = exports.chainWithIndex = exports.foldRight = exports.matchRight = exports.matchRightW = exports.foldLeft = exports.matchLeft = exports.matchLeftW = exports.match = exports.matchW = exports.fromEither = exports.fromOption = exports.fromPredicate = exports.replicate = exports.makeBy = exports.appendW = exports.append = exports.prependW = exports.prepend = exports.isNonEmpty = exports.isEmpty = void 0;
-exports.traverseWithIndex = exports.sequence = exports.traverse = exports.reduceRightWithIndex = exports.reduceRight = exports.reduceWithIndex = exports.reduce = exports.foldMapWithIndex = exports.foldMap = exports.duplicate = exports.extend = exports.filterWithIndex = exports.alt = exports.altW = exports.partitionMapWithIndex = exports.partitionMap = exports.partitionWithIndex = exports.partition = exports.filter = exports.separate = exports.compact = exports.filterMap = exports.filterMapWithIndex = exports.mapWithIndex = exports.flatten = exports.chain = exports.ap = exports.map = exports.zero = exports.of = exports.difference = exports.intersection = exports.union = exports.concat = exports.concatW = exports.comprehension = exports.fromOptionK = exports.chunksOf = exports.splitAt = exports.chop = exports.sortBy = exports.uniq = exports.elem = exports.rotate = exports.intersperse = exports.prependAll = exports.unzip = exports.zip = exports.zipWith = exports.sort = void 0;
-exports.some = exports.every = exports.unsafeDeleteAt = exports.unsafeUpdateAt = exports.unsafeInsertAt = exports.fromEitherK = exports.FromEither = exports.filterE = exports.ChainRecBreadthFirst = exports.chainRecBreadthFirst = exports.ChainRecDepthFirst = exports.chainRecDepthFirst = exports.Witherable = exports.TraversableWithIndex = exports.Traversable = exports.FoldableWithIndex = exports.Foldable = exports.FilterableWithIndex = exports.Filterable = exports.Compactable = exports.Extend = exports.Alternative = exports.guard = exports.Zero = exports.Alt = exports.Unfoldable = exports.Monad = exports.chainFirst = exports.Chain = exports.Applicative = exports.apSecond = exports.apFirst = exports.Apply = exports.FunctorWithIndex = exports.Pointed = exports.flap = exports.Functor = exports.getDifferenceMagma = exports.getIntersectionSemigroup = exports.getUnionMonoid = exports.getUnionSemigroup = exports.getOrd = exports.getEq = exports.getMonoid = exports.getSemigroup = exports.getShow = exports.URI = exports.unfold = exports.wilt = exports.wither = void 0;
-exports.array = exports.prependToAll = exports.snoc = exports.cons = exports.empty = exports.range = exports.apS = exports.bind = exports.bindTo = exports.Do = exports.exists = void 0;
-
-
-
-
-
-var _ = __importStar(internal);
-var NEA = __importStar(NonEmptyArray);
-var RA = __importStar(ReadonlyArray);
-
-
-
-// -------------------------------------------------------------------------------------
-// refinements
-// -------------------------------------------------------------------------------------
-/**
- * Test whether an array is empty
- *
- * @example
- * import { isEmpty } from 'fp-ts/Array'
- *
- * assert.strictEqual(isEmpty([]), true)
- *
- * @category refinements
- * @since 2.0.0
- */
-var isEmpty = function (as) { return as.length === 0; };
-exports.isEmpty = isEmpty;
-/**
- * Test whether an array is non empty narrowing down the type to `NonEmptyArray<A>`
- *
- * @category refinements
- * @since 2.0.0
- */
-exports.isNonEmpty = NEA.isNonEmpty;
-// -------------------------------------------------------------------------------------
-// constructors
-// -------------------------------------------------------------------------------------
-/**
- * Prepend an element to the front of a `Array`, creating a new `NonEmptyArray`.
- *
- * @example
- * import { prepend } from 'fp-ts/Array'
- * import { pipe } from 'fp-ts/function'
- *
- * assert.deepStrictEqual(pipe([2, 3, 4], prepend(1)), [1, 2, 3, 4])
- *
- * @category constructors
- * @since 2.10.0
- */
-exports.prepend = NEA.prepend;
-/**
- * Less strict version of [`prepend`](#prepend).
- *
- * @category constructors
- * @since 2.11.0
- */
-exports.prependW = NEA.prependW;
-/**
- * Append an element to the end of a `Array`, creating a new `NonEmptyArray`.
- *
- * @example
- * import { append } from 'fp-ts/Array'
- * import { pipe } from 'fp-ts/function'
- *
- * assert.deepStrictEqual(pipe([1, 2, 3], append(4)), [1, 2, 3, 4])
- *
- * @category constructors
- * @since 2.10.0
- */
-exports.append = NEA.append;
-/**
- * Less strict version of [`append`](#append).
- *
- * @category constructors
- * @since 2.11.0
- */
-exports.appendW = NEA.appendW;
-/**
- * Return a `Array` of length `n` with element `i` initialized with `f(i)`.
- *
- * **Note**. `n` is normalized to a non negative integer.
- *
- * @example
- * import { makeBy } from 'fp-ts/Array'
- *
- * const double = (n: number): number => n * 2
- * assert.deepStrictEqual(makeBy(5, double), [0, 2, 4, 6, 8])
- *
- * @category constructors
- * @since 2.0.0
- */
-var makeBy = function (n, f) { return (n <= 0 ? [] : NEA.makeBy(f)(n)); };
-exports.makeBy = makeBy;
-/**
- * Create a `Array` containing a value repeated the specified number of times.
- *
- * **Note**. `n` is normalized to a non negative integer.
- *
- * @example
- * import { replicate } from 'fp-ts/Array'
- *
- * assert.deepStrictEqual(replicate(3, 'a'), ['a', 'a', 'a'])
- *
- * @category constructors
- * @since 2.0.0
- */
-var replicate = function (n, a) { return exports.makeBy(n, function () { return a; }); };
-exports.replicate = replicate;
-function fromPredicate(predicate) {
-    return function (a) { return (predicate(a) ? [a] : []); };
-}
-exports.fromPredicate = fromPredicate;
-// -------------------------------------------------------------------------------------
-// natural transformations
-// -------------------------------------------------------------------------------------
-/**
- * @category natural transformations
- * @since 2.11.0
- */
-var fromOption = function (ma) { return (_.isNone(ma) ? [] : [ma.value]); };
-exports.fromOption = fromOption;
-/**
- * @category natural transformations
- * @since 2.11.0
- */
-var fromEither = function (e) { return (_.isLeft(e) ? [] : [e.right]); };
-exports.fromEither = fromEither;
-// -------------------------------------------------------------------------------------
-// destructors
-// -------------------------------------------------------------------------------------
-/**
- * Less strict version of [`match`](#match).
- *
- * @category destructors
- * @since 2.11.0
- */
-var matchW = function (onEmpty, onNonEmpty) { return function (as) {
-    return exports.isNonEmpty(as) ? onNonEmpty(as) : onEmpty();
-}; };
-exports.matchW = matchW;
-/**
- * Less strict version of [`match`](#match).
- *
- * @category destructors
- * @since 2.11.0
- */
-exports.match = exports.matchW;
-/**
- * Less strict version of [`matchLeft`](#matchleft).
- *
- * @category destructors
- * @since 2.11.0
- */
-var matchLeftW = function (onEmpty, onNonEmpty) { return function (as) { return (exports.isNonEmpty(as) ? onNonEmpty(NEA.head(as), NEA.tail(as)) : onEmpty()); }; };
-exports.matchLeftW = matchLeftW;
-/**
- * Break an `Array` into its first element and remaining elements.
- *
- * @example
- * import { matchLeft } from 'fp-ts/Array'
- *
- * const len: <A>(as: Array<A>) => number = matchLeft(() => 0, (_, tail) => 1 + len(tail))
- * assert.strictEqual(len([1, 2, 3]), 3)
- *
- * @category destructors
- * @since 2.10.0
- */
-exports.matchLeft = exports.matchLeftW;
-/**
- * Alias of [`matchLeft`](#matchleft).
- *
- * @category destructors
- * @since 2.0.0
- */
-exports.foldLeft = exports.matchLeft;
-/**
- * Less strict version of [`matchRight`](#matchright).
- *
- * @category destructors
- * @since 2.11.0
- */
-var matchRightW = function (onEmpty, onNonEmpty) { return function (as) { return (exports.isNonEmpty(as) ? onNonEmpty(NEA.init(as), NEA.last(as)) : onEmpty()); }; };
-exports.matchRightW = matchRightW;
-/**
- * Break an `Array` into its initial elements and the last element.
- *
- * @category destructors
- * @since 2.10.0
- */
-exports.matchRight = exports.matchRightW;
-/**
- * Alias of [`matchRight`](#matchright).
- *
- * @category destructors
- * @since 2.0.0
- */
-exports.foldRight = exports.matchRight;
-// -------------------------------------------------------------------------------------
-// combinators
-// -------------------------------------------------------------------------------------
-/**
- * @category combinators
- * @since 2.7.0
- */
-var chainWithIndex = function (f) { return function (as) {
-    var out = [];
-    for (var i = 0; i < as.length; i++) {
-        out.push.apply(out, f(i, as[i]));
-    }
-    return out;
-}; };
-exports.chainWithIndex = chainWithIndex;
-/**
- * Same as `reduce` but it carries over the intermediate steps
- *
- * @example
- * import { scanLeft } from 'fp-ts/Array'
- *
- * assert.deepStrictEqual(scanLeft(10, (b, a: number) => b - a)([1, 2, 3]), [10, 9, 7, 4])
- *
- * @category combinators
- * @since 2.0.0
- */
-var scanLeft = function (b, f) { return function (as) {
-    var len = as.length;
-    var out = new Array(len + 1);
-    out[0] = b;
-    for (var i = 0; i < len; i++) {
-        out[i + 1] = f(out[i], as[i]);
-    }
-    return out;
-}; };
-exports.scanLeft = scanLeft;
-/**
- * Fold an array from the right, keeping all intermediate results instead of only the final result
- *
- * @example
- * import { scanRight } from 'fp-ts/Array'
- *
- * assert.deepStrictEqual(scanRight(10, (a: number, b) => b - a)([1, 2, 3]), [4, 5, 7, 10])
- *
- * @category combinators
- * @since 2.0.0
- */
-var scanRight = function (b, f) { return function (as) {
-    var len = as.length;
-    var out = new Array(len + 1);
-    out[len] = b;
-    for (var i = len - 1; i >= 0; i--) {
-        out[i] = f(as[i], out[i + 1]);
-    }
-    return out;
-}; };
-exports.scanRight = scanRight;
-/**
- * Calculate the number of elements in a `Array`.
- *
- * @since 2.10.0
- */
-var size = function (as) { return as.length; };
-exports.size = size;
-/**
- * Test whether an array contains a particular index
- *
- * @since 2.0.0
- */
-exports.isOutOfBound = NEA.isOutOfBound;
-// TODO: remove non-curried overloading in v3
-/**
- * This function provides a safe way to read a value at a particular index from an array
- *
- * @example
- * import { lookup } from 'fp-ts/Array'
- * import { some, none } from 'fp-ts/Option'
- * import { pipe } from 'fp-ts/function'
- *
- * assert.deepStrictEqual(pipe([1, 2, 3], lookup(1)), some(2))
- * assert.deepStrictEqual(pipe([1, 2, 3], lookup(3)), none)
- *
- * @since 2.0.0
- */
-exports.lookup = RA.lookup;
-/**
- * Get the first element in an array, or `None` if the array is empty
- *
- * @example
- * import { head } from 'fp-ts/Array'
- * import { some, none } from 'fp-ts/Option'
- *
- * assert.deepStrictEqual(head([1, 2, 3]), some(1))
- * assert.deepStrictEqual(head([]), none)
- *
- * @category destructors
- * @since 2.0.0
- */
-exports.head = RA.head;
-/**
- * Get the last element in an array, or `None` if the array is empty
- *
- * @example
- * import { last } from 'fp-ts/Array'
- * import { some, none } from 'fp-ts/Option'
- *
- * assert.deepStrictEqual(last([1, 2, 3]), some(3))
- * assert.deepStrictEqual(last([]), none)
- *
- * @category destructors
- * @since 2.0.0
- */
-exports.last = RA.last;
-/**
- * Get all but the first element of an array, creating a new array, or `None` if the array is empty
- *
- * @example
- * import { tail } from 'fp-ts/Array'
- * import { some, none } from 'fp-ts/Option'
- *
- * assert.deepStrictEqual(tail([1, 2, 3]), some([2, 3]))
- * assert.deepStrictEqual(tail([]), none)
- *
- * @category destructors
- * @since 2.0.0
- */
-var tail = function (as) { return (exports.isNonEmpty(as) ? _.some(NEA.tail(as)) : _.none); };
-exports.tail = tail;
-/**
- * Get all but the last element of an array, creating a new array, or `None` if the array is empty
- *
- * @example
- * import { init } from 'fp-ts/Array'
- * import { some, none } from 'fp-ts/Option'
- *
- * assert.deepStrictEqual(init([1, 2, 3]), some([1, 2]))
- * assert.deepStrictEqual(init([]), none)
- *
- * @category destructors
- * @since 2.0.0
- */
-var init = function (as) { return (exports.isNonEmpty(as) ? _.some(NEA.init(as)) : _.none); };
-exports.init = init;
-/**
- * Keep only a max number of elements from the start of an `Array`, creating a new `Array`.
- *
- * **Note**. `n` is normalized to a non negative integer.
- *
- * @example
- * import { takeLeft } from 'fp-ts/Array'
- *
- * assert.deepStrictEqual(takeLeft(2)([1, 2, 3]), [1, 2])
- *
- * @category combinators
- * @since 2.0.0
- */
-var takeLeft = function (n) { return function (as) { return (exports.isOutOfBound(n, as) ? exports.copy(as) : as.slice(0, n)); }; };
-exports.takeLeft = takeLeft;
-/**
- * Keep only a max number of elements from the end of an `Array`, creating a new `Array`.
- *
- * **Note**. `n` is normalized to a non negative integer.
- *
- * @example
- * import { takeRight } from 'fp-ts/Array'
- *
- * assert.deepStrictEqual(takeRight(2)([1, 2, 3, 4, 5]), [4, 5])
- *
- * @category combinators
- * @since 2.0.0
- */
-var takeRight = function (n) { return function (as) {
-    return exports.isOutOfBound(n, as) ? exports.copy(as) : n === 0 ? [] : as.slice(-n);
-}; };
-exports.takeRight = takeRight;
-function takeLeftWhile(predicate) {
-    return function (as) {
-        var out = [];
-        for (var _i = 0, as_1 = as; _i < as_1.length; _i++) {
-            var a = as_1[_i];
-            if (!predicate(a)) {
-                break;
-            }
-            out.push(a);
-        }
-        return out;
-    };
-}
-exports.takeLeftWhile = takeLeftWhile;
-var spanLeftIndex = function (as, predicate) {
-    var l = as.length;
-    var i = 0;
-    for (; i < l; i++) {
-        if (!predicate(as[i])) {
-            break;
-        }
-    }
-    return i;
-};
-function spanLeft(predicate) {
-    return function (as) {
-        var _a = exports.splitAt(spanLeftIndex(as, predicate))(as), init = _a[0], rest = _a[1];
-        return { init: init, rest: rest };
-    };
-}
-exports.spanLeft = spanLeft;
-/**
- * Drop a max number of elements from the start of an `Array`, creating a new `Array`.
- *
- * **Note**. `n` is normalized to a non negative integer.
- *
- * @example
- * import { dropLeft } from 'fp-ts/Array'
- *
- * assert.deepStrictEqual(dropLeft(2)([1, 2, 3]), [3])
- *
- * @category combinators
- * @since 2.0.0
- */
-var dropLeft = function (n) { return function (as) {
-    return n <= 0 || exports.isEmpty(as) ? exports.copy(as) : n >= as.length ? [] : as.slice(n, as.length);
-}; };
-exports.dropLeft = dropLeft;
-/**
- * Drop a max number of elements from the end of an `Array`, creating a new `Array`.
- *
- * **Note**. `n` is normalized to a non negative integer.
- *
- * @example
- * import { dropRight } from 'fp-ts/Array'
- *
- * assert.deepStrictEqual(dropRight(2)([1, 2, 3, 4, 5]), [1, 2, 3])
- *
- * @category combinators
- * @since 2.0.0
- */
-var dropRight = function (n) { return function (as) {
-    return n <= 0 || exports.isEmpty(as) ? exports.copy(as) : n >= as.length ? [] : as.slice(0, as.length - n);
-}; };
-exports.dropRight = dropRight;
-function dropLeftWhile(predicate) {
-    return function (as) { return as.slice(spanLeftIndex(as, predicate)); };
-}
-exports.dropLeftWhile = dropLeftWhile;
-/**
- * Find the first index for which a predicate holds
- *
- * @example
- * import { findIndex } from 'fp-ts/Array'
- * import { some, none } from 'fp-ts/Option'
- *
- * assert.deepStrictEqual(findIndex((n: number) => n === 2)([1, 2, 3]), some(1))
- * assert.deepStrictEqual(findIndex((n: number) => n === 2)([]), none)
- *
- * @since 2.0.0
- */
-exports.findIndex = RA.findIndex;
-function findFirst(predicate) {
-    return RA.findFirst(predicate);
-}
-exports.findFirst = findFirst;
-/**
- * Find the first element returned by an option based selector function
- *
- * @example
- * import { findFirstMap } from 'fp-ts/Array'
- * import { some, none } from 'fp-ts/Option'
- *
- * interface Person {
- *   readonly name: string
- *   readonly age?: number
- * }
- *
- * const persons: Array<Person> = [{ name: 'John' }, { name: 'Mary', age: 45 }, { name: 'Joey', age: 28 }]
- *
- * // returns the name of the first person that has an age
- * assert.deepStrictEqual(findFirstMap((p: Person) => (p.age === undefined ? none : some(p.name)))(persons), some('Mary'))
- *
- * @category destructors
- * @since 2.0.0
- */
-exports.findFirstMap = RA.findFirstMap;
-function findLast(predicate) {
-    return RA.findLast(predicate);
-}
-exports.findLast = findLast;
-/**
- * Find the last element returned by an option based selector function
- *
- * @example
- * import { findLastMap } from 'fp-ts/Array'
- * import { some, none } from 'fp-ts/Option'
- *
- * interface Person {
- *   readonly name: string
- *   readonly age?: number
- * }
- *
- * const persons: Array<Person> = [{ name: 'John' }, { name: 'Mary', age: 45 }, { name: 'Joey', age: 28 }]
- *
- * // returns the name of the last person that has an age
- * assert.deepStrictEqual(findLastMap((p: Person) => (p.age === undefined ? none : some(p.name)))(persons), some('Joey'))
- *
- * @category destructors
- * @since 2.0.0
- */
-exports.findLastMap = RA.findLastMap;
-/**
- * Returns the index of the last element of the list which matches the predicate
- *
- * @example
- * import { findLastIndex } from 'fp-ts/Array'
- * import { some, none } from 'fp-ts/Option'
- *
- * interface X {
- *   readonly a: number
- *   readonly b: number
- * }
- * const xs: Array<X> = [{ a: 1, b: 0 }, { a: 1, b: 1 }]
- * assert.deepStrictEqual(findLastIndex((x: { readonly a: number }) => x.a === 1)(xs), some(1))
- * assert.deepStrictEqual(findLastIndex((x: { readonly a: number }) => x.a === 4)(xs), none)
- *
- *
- * @since 2.0.0
- */
-exports.findLastIndex = RA.findLastIndex;
-/**
- * @category combinators
- * @since 2.0.0
- */
-var copy = function (as) { return as.slice(); };
-exports.copy = copy;
-/**
- * Insert an element at the specified index, creating a new array, or returning `None` if the index is out of bounds
- *
- * @example
- * import { insertAt } from 'fp-ts/Array'
- * import { some } from 'fp-ts/Option'
- *
- * assert.deepStrictEqual(insertAt(2, 5)([1, 2, 3, 4]), some([1, 2, 5, 3, 4]))
- *
- * @since 2.0.0
- */
-var insertAt = function (i, a) { return function (as) {
-    return i < 0 || i > as.length ? _.none : _.some(exports.unsafeInsertAt(i, a, as));
-}; };
-exports.insertAt = insertAt;
-/**
- * Change the element at the specified index, creating a new array, or returning `None` if the index is out of bounds
- *
- * @example
- * import { updateAt } from 'fp-ts/Array'
- * import { some, none } from 'fp-ts/Option'
- *
- * assert.deepStrictEqual(updateAt(1, 1)([1, 2, 3]), some([1, 1, 3]))
- * assert.deepStrictEqual(updateAt(1, 1)([]), none)
- *
- * @since 2.0.0
- */
-var updateAt = function (i, a) { return exports.modifyAt(i, function () { return a; }); };
-exports.updateAt = updateAt;
-/**
- * Delete the element at the specified index, creating a new array, or returning `None` if the index is out of bounds
- *
- * @example
- * import { deleteAt } from 'fp-ts/Array'
- * import { some, none } from 'fp-ts/Option'
- *
- * assert.deepStrictEqual(deleteAt(0)([1, 2, 3]), some([2, 3]))
- * assert.deepStrictEqual(deleteAt(1)([]), none)
- *
- * @since 2.0.0
- */
-var deleteAt = function (i) { return function (as) {
-    return exports.isOutOfBound(i, as) ? _.none : _.some(exports.unsafeDeleteAt(i, as));
-}; };
-exports.deleteAt = deleteAt;
-/**
- * Apply a function to the element at the specified index, creating a new array, or returning `None` if the index is out
- * of bounds
- *
- * @example
- * import { modifyAt } from 'fp-ts/Array'
- * import { some, none } from 'fp-ts/Option'
- *
- * const double = (x: number): number => x * 2
- * assert.deepStrictEqual(modifyAt(1, double)([1, 2, 3]), some([1, 4, 3]))
- * assert.deepStrictEqual(modifyAt(1, double)([]), none)
- *
- * @since 2.0.0
- */
-var modifyAt = function (i, f) { return function (as) {
-    return exports.isOutOfBound(i, as) ? _.none : _.some(exports.unsafeUpdateAt(i, f(as[i]), as));
-}; };
-exports.modifyAt = modifyAt;
-/**
- * Reverse an array, creating a new array
- *
- * @example
- * import { reverse } from 'fp-ts/Array'
- *
- * assert.deepStrictEqual(reverse([1, 2, 3]), [3, 2, 1])
- *
- * @category combinators
- * @since 2.0.0
- */
-var reverse = function (as) { return (exports.isEmpty(as) ? [] : as.slice().reverse()); };
-exports.reverse = reverse;
-/**
- * Extracts from an array of `Either` all the `Right` elements. All the `Right` elements are extracted in order
- *
- * @example
- * import { rights } from 'fp-ts/Array'
- * import { right, left } from 'fp-ts/Either'
- *
- * assert.deepStrictEqual(rights([right(1), left('foo'), right(2)]), [1, 2])
- *
- * @category combinators
- * @since 2.0.0
- */
-var rights = function (as) {
-    var r = [];
-    for (var i = 0; i < as.length; i++) {
-        var a = as[i];
-        if (a._tag === 'Right') {
-            r.push(a.right);
-        }
-    }
-    return r;
-};
-exports.rights = rights;
-/**
- * Extracts from an array of `Either` all the `Left` elements. All the `Left` elements are extracted in order
- *
- * @example
- * import { lefts } from 'fp-ts/Array'
- * import { left, right } from 'fp-ts/Either'
- *
- * assert.deepStrictEqual(lefts([right(1), left('foo'), right(2)]), ['foo'])
- *
- * @category combinators
- * @since 2.0.0
- */
-var lefts = function (as) {
-    var r = [];
-    for (var i = 0; i < as.length; i++) {
-        var a = as[i];
-        if (a._tag === 'Left') {
-            r.push(a.left);
-        }
-    }
-    return r;
-};
-exports.lefts = lefts;
-/**
- * Sort the elements of an array in increasing order, creating a new array
- *
- * @example
- * import { sort } from 'fp-ts/Array'
- * import * as N from 'fp-ts/number'
- *
- * assert.deepStrictEqual(sort(N.Ord)([3, 2, 1]), [1, 2, 3])
- *
- * @category combinators
- * @since 2.0.0
- */
-var sort = function (O) { return function (as) {
-    return as.length <= 1 ? exports.copy(as) : as.slice().sort(O.compare);
-}; };
-exports.sort = sort;
-/**
- * Apply a function to pairs of elements at the same index in two arrays, collecting the results in a new array. If one
- * input array is short, excess elements of the longer array are discarded.
- *
- * @example
- * import { zipWith } from 'fp-ts/Array'
- *
- * assert.deepStrictEqual(zipWith([1, 2, 3], ['a', 'b', 'c', 'd'], (n, s) => s + n), ['a1', 'b2', 'c3'])
- *
- * @category combinators
- * @since 2.0.0
- */
-var zipWith = function (fa, fb, f) {
-    var fc = [];
-    var len = Math.min(fa.length, fb.length);
-    for (var i = 0; i < len; i++) {
-        fc[i] = f(fa[i], fb[i]);
-    }
-    return fc;
-};
-exports.zipWith = zipWith;
-function zip(as, bs) {
-    if (bs === undefined) {
-        return function (bs) { return zip(bs, as); };
-    }
-    return exports.zipWith(as, bs, function (a, b) { return [a, b]; });
-}
-exports.zip = zip;
-/**
- * The function is reverse of `zip`. Takes an array of pairs and return two corresponding arrays
- *
- * @example
- * import { unzip } from 'fp-ts/Array'
- *
- * assert.deepStrictEqual(unzip([[1, 'a'], [2, 'b'], [3, 'c']]), [[1, 2, 3], ['a', 'b', 'c']])
- *
- * @since 2.0.0
- */
-var unzip = function (as) {
-    var fa = [];
-    var fb = [];
-    for (var i = 0; i < as.length; i++) {
-        fa[i] = as[i][0];
-        fb[i] = as[i][1];
-    }
-    return [fa, fb];
-};
-exports.unzip = unzip;
-/**
- * Prepend an element to every member of an array
- *
- * @example
- * import { prependAll } from 'fp-ts/Array'
- *
- * assert.deepStrictEqual(prependAll(9)([1, 2, 3, 4]), [9, 1, 9, 2, 9, 3, 9, 4])
- *
- * @category combinators
- * @since 2.10.0
- */
-var prependAll = function (middle) {
-    var f = NEA.prependAll(middle);
-    return function (as) { return (exports.isNonEmpty(as) ? f(as) : []); };
-};
-exports.prependAll = prependAll;
-/**
- * Places an element in between members of an array
- *
- * @example
- * import { intersperse } from 'fp-ts/Array'
- *
- * assert.deepStrictEqual(intersperse(9)([1, 2, 3, 4]), [1, 9, 2, 9, 3, 9, 4])
- *
- * @category combinators
- * @since 2.9.0
- */
-var intersperse = function (middle) {
-    var f = NEA.intersperse(middle);
-    return function (as) { return (exports.isNonEmpty(as) ? f(as) : exports.copy(as)); };
-};
-exports.intersperse = intersperse;
-/**
- * Rotate a `Array` by `n` steps.
- *
- * @example
- * import { rotate } from 'fp-ts/Array'
- *
- * assert.deepStrictEqual(rotate(2)([1, 2, 3, 4, 5]), [4, 5, 1, 2, 3])
- *
- * @category combinators
- * @since 2.0.0
- */
-var rotate = function (n) {
-    var f = NEA.rotate(n);
-    return function (as) { return (exports.isNonEmpty(as) ? f(as) : exports.copy(as)); };
-};
-exports.rotate = rotate;
-// TODO: remove non-curried overloading in v3
-/**
- * Test if a value is a member of an array. Takes a `Eq<A>` as a single
- * argument which returns the function to use to search for a value of type `A` in
- * an array of type `Array<A>`.
- *
- * @example
- * import { elem } from 'fp-ts/Array'
- * import * as N from 'fp-ts/number'
- * import { pipe } from 'fp-ts/function'
- *
- * assert.strictEqual(pipe([1, 2, 3], elem(N.Eq)(2)), true)
- * assert.strictEqual(pipe([1, 2, 3], elem(N.Eq)(0)), false)
- *
- * @since 2.0.0
- */
-exports.elem = RA.elem;
-/**
- * Remove duplicates from an array, keeping the first occurrence of an element.
- *
- * @example
- * import { uniq } from 'fp-ts/Array'
- * import * as N from 'fp-ts/number'
- *
- * assert.deepStrictEqual(uniq(N.Eq)([1, 2, 1]), [1, 2])
- *
- * @category combinators
- * @since 2.0.0
- */
-var uniq = function (E) {
-    var f = NEA.uniq(E);
-    return function (as) { return (exports.isNonEmpty(as) ? f(as) : exports.copy(as)); };
-};
-exports.uniq = uniq;
-/**
- * Sort the elements of an array in increasing order, where elements are compared using first `ords[0]`, then `ords[1]`,
- * etc...
- *
- * @example
- * import { sortBy } from 'fp-ts/Array'
- * import { contramap } from 'fp-ts/Ord'
- * import * as S from 'fp-ts/string'
- * import * as N from 'fp-ts/number'
- * import { pipe } from 'fp-ts/function'
- *
- * interface Person {
- *   readonly name: string
- *   readonly age: number
- * }
- * const byName = pipe(S.Ord, contramap((p: Person) => p.name))
- * const byAge = pipe(N.Ord, contramap((p: Person) => p.age))
- *
- * const sortByNameByAge = sortBy([byName, byAge])
- *
- * const persons = [{ name: 'a', age: 1 }, { name: 'b', age: 3 }, { name: 'c', age: 2 }, { name: 'b', age: 2 }]
- * assert.deepStrictEqual(sortByNameByAge(persons), [
- *   { name: 'a', age: 1 },
- *   { name: 'b', age: 2 },
- *   { name: 'b', age: 3 },
- *   { name: 'c', age: 2 }
- * ])
- *
- * @category combinators
- * @since 2.0.0
- */
-var sortBy = function (ords) {
-    var f = NEA.sortBy(ords);
-    return function (as) { return (exports.isNonEmpty(as) ? f(as) : exports.copy(as)); };
-};
-exports.sortBy = sortBy;
-/**
- * A useful recursion pattern for processing an array to produce a new array, often used for "chopping" up the input
- * array. Typically chop is called with some function that will consume an initial prefix of the array and produce a
- * value and the rest of the array.
- *
- * @example
- * import { Eq } from 'fp-ts/Eq'
- * import * as A from 'fp-ts/Array'
- * import * as N from 'fp-ts/number'
- * import { pipe } from 'fp-ts/function'
- *
- * const group = <A>(S: Eq<A>): ((as: Array<A>) => Array<Array<A>>) => {
- *   return A.chop(as => {
- *     const { init, rest } = pipe(as, A.spanLeft((a: A) => S.equals(a, as[0])))
- *     return [init, rest]
- *   })
- * }
- * assert.deepStrictEqual(group(N.Eq)([1, 1, 2, 3, 3, 4]), [[1, 1], [2], [3, 3], [4]])
- *
- * @category combinators
- * @since 2.0.0
- */
-var chop = function (f) {
-    var g = NEA.chop(f);
-    return function (as) { return (exports.isNonEmpty(as) ? g(as) : []); };
-};
-exports.chop = chop;
-/**
- * Splits an `Array` into two pieces, the first piece has max `n` elements.
- *
- * @example
- * import { splitAt } from 'fp-ts/Array'
- *
- * assert.deepStrictEqual(splitAt(2)([1, 2, 3, 4, 5]), [[1, 2], [3, 4, 5]])
- *
- * @category combinators
- * @since 2.0.0
- */
-var splitAt = function (n) { return function (as) {
-    return n >= 1 && exports.isNonEmpty(as) ? NEA.splitAt(n)(as) : exports.isEmpty(as) ? [exports.copy(as), []] : [[], exports.copy(as)];
-}; };
-exports.splitAt = splitAt;
-/**
- * Splits an array into length-`n` pieces. The last piece will be shorter if `n` does not evenly divide the length of
- * the array. Note that `chunksOf(n)([])` is `[]`, not `[[]]`. This is intentional, and is consistent with a recursive
- * definition of `chunksOf`; it satisfies the property that
- *
- * ```ts
- * chunksOf(n)(xs).concat(chunksOf(n)(ys)) == chunksOf(n)(xs.concat(ys)))
- * ```
- *
- * whenever `n` evenly divides the length of `xs`.
- *
- * @example
- * import { chunksOf } from 'fp-ts/Array'
- *
- * assert.deepStrictEqual(chunksOf(2)([1, 2, 3, 4, 5]), [[1, 2], [3, 4], [5]])
- *
- * @category combinators
- * @since 2.0.0
- */
-var chunksOf = function (n) {
-    var f = NEA.chunksOf(n);
-    return function (as) { return (exports.isNonEmpty(as) ? f(as) : []); };
-};
-exports.chunksOf = chunksOf;
-/**
- * @category combinators
- * @since 2.11.0
- */
-var fromOptionK = function (f) { return function () {
-    var a = [];
-    for (var _i = 0; _i < arguments.length; _i++) {
-        a[_i] = arguments[_i];
-    }
-    return exports.fromOption(f.apply(void 0, a));
-}; };
-exports.fromOptionK = fromOptionK;
-function comprehension(input, f, g) {
-    if (g === void 0) { g = function () { return true; }; }
-    var go = function (scope, input) {
-        return exports.isNonEmpty(input)
-            ? _function.pipe(NEA.head(input), exports.chain(function (x) { return go(_function.pipe(scope, exports.append(x)), NEA.tail(input)); }))
-            : g.apply(void 0, scope) ? [f.apply(void 0, scope)]
-                : [];
-    };
-    return go([], input);
-}
-exports.comprehension = comprehension;
-/**
- * @category combinators
- * @since 2.11.0
- */
-var concatW = function (second) { return function (first) {
-    return exports.isEmpty(first) ? exports.copy(second) : exports.isEmpty(second) ? exports.copy(first) : first.concat(second);
-}; };
-exports.concatW = concatW;
-/**
- * @category combinators
- * @since 2.11.0
- */
-exports.concat = exports.concatW;
-function union(E) {
-    var unionE = NEA.union(E);
-    return function (first, second) {
-        if (second === undefined) {
-            var unionE_1 = union(E);
-            return function (second) { return unionE_1(second, first); };
-        }
-        return exports.isNonEmpty(first) && exports.isNonEmpty(second)
-            ? unionE(second)(first)
-            : exports.isNonEmpty(first)
-                ? exports.copy(first)
-                : exports.copy(second);
-    };
-}
-exports.union = union;
-function intersection(E) {
-    var elemE = exports.elem(E);
-    return function (xs, ys) {
-        if (ys === undefined) {
-            var intersectionE_1 = intersection(E);
-            return function (ys) { return intersectionE_1(ys, xs); };
-        }
-        return xs.filter(function (a) { return elemE(a, ys); });
-    };
-}
-exports.intersection = intersection;
-function difference(E) {
-    var elemE = exports.elem(E);
-    return function (xs, ys) {
-        if (ys === undefined) {
-            var differenceE_1 = difference(E);
-            return function (ys) { return differenceE_1(ys, xs); };
-        }
-        return xs.filter(function (a) { return !elemE(a, ys); });
-    };
-}
-exports.difference = difference;
-// -------------------------------------------------------------------------------------
-// non-pipeables
-// -------------------------------------------------------------------------------------
-var _map = function (fa, f) { return _function.pipe(fa, exports.map(f)); };
-/* istanbul ignore next */
-var _mapWithIndex = function (fa, f) { return _function.pipe(fa, exports.mapWithIndex(f)); };
-var _ap = function (fab, fa) { return _function.pipe(fab, exports.ap(fa)); };
-var _chain = function (ma, f) { return _function.pipe(ma, exports.chain(f)); };
-/* istanbul ignore next */
-var _filter = function (fa, predicate) { return _function.pipe(fa, exports.filter(predicate)); };
-/* istanbul ignore next */
-var _filterMap = function (fa, f) { return _function.pipe(fa, exports.filterMap(f)); };
-/* istanbul ignore next */
-var _partition = function (fa, predicate) {
-    return _function.pipe(fa, exports.partition(predicate));
-};
-/* istanbul ignore next */
-var _partitionMap = function (fa, f) { return _function.pipe(fa, exports.partitionMap(f)); };
-/* istanbul ignore next */
-var _partitionWithIndex = function (fa, predicateWithIndex) { return _function.pipe(fa, exports.partitionWithIndex(predicateWithIndex)); };
-/* istanbul ignore next */
-var _partitionMapWithIndex = function (fa, f) { return _function.pipe(fa, exports.partitionMapWithIndex(f)); };
-/* istanbul ignore next */
-var _alt = function (fa, that) { return _function.pipe(fa, exports.alt(that)); };
-var _reduce = function (fa, b, f) { return _function.pipe(fa, exports.reduce(b, f)); };
-/* istanbul ignore next */
-var _foldMap = function (M) {
-    var foldMapM = exports.foldMap(M);
-    return function (fa, f) { return _function.pipe(fa, foldMapM(f)); };
-};
-/* istanbul ignore next */
-var _reduceRight = function (fa, b, f) { return _function.pipe(fa, exports.reduceRight(b, f)); };
-/* istanbul ignore next */
-var _reduceWithIndex = function (fa, b, f) {
-    return _function.pipe(fa, exports.reduceWithIndex(b, f));
-};
-/* istanbul ignore next */
-var _foldMapWithIndex = function (M) {
-    var foldMapWithIndexM = exports.foldMapWithIndex(M);
-    return function (fa, f) { return _function.pipe(fa, foldMapWithIndexM(f)); };
-};
-/* istanbul ignore next */
-var _reduceRightWithIndex = function (fa, b, f) {
-    return _function.pipe(fa, exports.reduceRightWithIndex(b, f));
-};
-/* istanbul ignore next */
-var _filterMapWithIndex = function (fa, f) { return _function.pipe(fa, exports.filterMapWithIndex(f)); };
-/* istanbul ignore next */
-var _filterWithIndex = function (fa, predicateWithIndex) { return _function.pipe(fa, exports.filterWithIndex(predicateWithIndex)); };
-/* istanbul ignore next */
-var _extend = function (fa, f) { return _function.pipe(fa, exports.extend(f)); };
-/* istanbul ignore next */
-var _traverse = function (F) {
-    var traverseF = exports.traverse(F);
-    return function (ta, f) { return _function.pipe(ta, traverseF(f)); };
-};
-/* istanbul ignore next */
-var _traverseWithIndex = function (F) {
-    var traverseWithIndexF = exports.traverseWithIndex(F);
-    return function (ta, f) { return _function.pipe(ta, traverseWithIndexF(f)); };
-};
-var _chainRecDepthFirst = RA._chainRecDepthFirst;
-var _chainRecBreadthFirst = RA._chainRecBreadthFirst;
-// -------------------------------------------------------------------------------------
-// type class members
-// -------------------------------------------------------------------------------------
-/**
- * @category Pointed
- * @since 2.0.0
- */
-exports.of = NEA.of;
-/**
- * @category Zero
- * @since 2.7.0
- */
-var zero = function () { return []; };
-exports.zero = zero;
-/**
- * `map` can be used to turn functions `(a: A) => B` into functions `(fa: F<A>) => F<B>` whose argument and return types
- * use the type constructor `F` to represent some computational context.
- *
- * @category Functor
- * @since 2.0.0
- */
-var map = function (f) { return function (fa) { return fa.map(function (a) { return f(a); }); }; };
-exports.map = map;
-/**
- * Apply a function to an argument under a type constructor.
- *
- * @category Apply
- * @since 2.0.0
- */
-var ap = function (fa) { return exports.chain(function (f) { return _function.pipe(fa, exports.map(f)); }); };
-exports.ap = ap;
-/**
- * Composes computations in sequence, using the return value of one computation to determine the next computation.
- *
- * @category Monad
- * @since 2.0.0
- */
-var chain = function (f) { return function (ma) {
-    return _function.pipe(ma, exports.chainWithIndex(function (_, a) { return f(a); }));
-}; };
-exports.chain = chain;
-/**
- * Derivable from `Chain`.
- *
- * @category combinators
- * @since 2.5.0
- */
-exports.flatten = 
-/*#__PURE__*/
-exports.chain(_function.identity);
-/**
- * @category FunctorWithIndex
- * @since 2.0.0
- */
-var mapWithIndex = function (f) { return function (fa) {
-    return fa.map(function (a, i) { return f(i, a); });
-}; };
-exports.mapWithIndex = mapWithIndex;
-/**
- * @category FilterableWithIndex
- * @since 2.0.0
- */
-var filterMapWithIndex = function (f) { return function (fa) {
-    var out = [];
-    for (var i = 0; i < fa.length; i++) {
-        var optionB = f(i, fa[i]);
-        if (_.isSome(optionB)) {
-            out.push(optionB.value);
-        }
-    }
-    return out;
-}; };
-exports.filterMapWithIndex = filterMapWithIndex;
-/**
- * @category Filterable
- * @since 2.0.0
- */
-var filterMap = function (f) {
-    return exports.filterMapWithIndex(function (_, a) { return f(a); });
-};
-exports.filterMap = filterMap;
-/**
- * @category Compactable
- * @since 2.0.0
- */
-exports.compact = 
-/*#__PURE__*/
-exports.filterMap(_function.identity);
-/**
- * @category Compactable
- * @since 2.0.0
- */
-var separate = function (fa) {
-    var left = [];
-    var right = [];
-    for (var _i = 0, fa_1 = fa; _i < fa_1.length; _i++) {
-        var e = fa_1[_i];
-        if (e._tag === 'Left') {
-            left.push(e.left);
-        }
-        else {
-            right.push(e.right);
-        }
-    }
-    return Separated.separated(left, right);
-};
-exports.separate = separate;
-/**
- * @category Filterable
- * @since 2.0.0
- */
-var filter = function (predicate) { return function (as) { return as.filter(predicate); }; };
-exports.filter = filter;
-/**
- * @category Filterable
- * @since 2.0.0
- */
-var partition = function (predicate) {
-    return exports.partitionWithIndex(function (_, a) { return predicate(a); });
-};
-exports.partition = partition;
-/**
- * @category FilterableWithIndex
- * @since 2.0.0
- */
-var partitionWithIndex = function (predicateWithIndex) { return function (as) {
-    var left = [];
-    var right = [];
-    for (var i = 0; i < as.length; i++) {
-        var b = as[i];
-        if (predicateWithIndex(i, b)) {
-            right.push(b);
-        }
-        else {
-            left.push(b);
-        }
-    }
-    return Separated.separated(left, right);
-}; };
-exports.partitionWithIndex = partitionWithIndex;
-/**
- * @category Filterable
- * @since 2.0.0
- */
-var partitionMap = function (f) { return exports.partitionMapWithIndex(function (_, a) { return f(a); }); };
-exports.partitionMap = partitionMap;
-/**
- * @category FilterableWithIndex
- * @since 2.0.0
- */
-var partitionMapWithIndex = function (f) { return function (fa) {
-    var left = [];
-    var right = [];
-    for (var i = 0; i < fa.length; i++) {
-        var e = f(i, fa[i]);
-        if (e._tag === 'Left') {
-            left.push(e.left);
-        }
-        else {
-            right.push(e.right);
-        }
-    }
-    return Separated.separated(left, right);
-}; };
-exports.partitionMapWithIndex = partitionMapWithIndex;
-/**
- * Less strict version of [`alt`](#alt).
- *
- * @category Alt
- * @since 2.9.0
- */
-var altW = function (that) { return function (fa) { return fa.concat(that()); }; };
-exports.altW = altW;
-/**
- * Identifies an associative operation on a type constructor. It is similar to `Semigroup`, except that it applies to
- * types of kind `* -> *`.
- *
- * @category Alt
- * @since 2.0.0
- */
-exports.alt = exports.altW;
-/**
- * @category FilterableWithIndex
- * @since 2.0.0
- */
-var filterWithIndex = function (predicateWithIndex) { return function (as) {
-    return as.filter(function (b, i) { return predicateWithIndex(i, b); });
-}; };
-exports.filterWithIndex = filterWithIndex;
-/**
- * @category Extend
- * @since 2.0.0
- */
-var extend = function (f) { return function (wa) {
-    return wa.map(function (_, i) { return f(wa.slice(i)); });
-}; };
-exports.extend = extend;
-/**
- * Derivable from `Extend`.
- *
- * @category combinators
- * @since 2.0.0
- */
-exports.duplicate = 
-/*#__PURE__*/
-exports.extend(_function.identity);
-/**
- * @category Foldable
- * @since 2.0.0
- */
-exports.foldMap = RA.foldMap;
-/**
- * @category FoldableWithIndex
- * @since 2.0.0
- */
-exports.foldMapWithIndex = RA.foldMapWithIndex;
-/**
- * @category Foldable
- * @since 2.0.0
- */
-exports.reduce = RA.reduce;
-/**
- * @category FoldableWithIndex
- * @since 2.0.0
- */
-exports.reduceWithIndex = RA.reduceWithIndex;
-/**
- * @category Foldable
- * @since 2.0.0
- */
-exports.reduceRight = RA.reduceRight;
-/**
- * @category FoldableWithIndex
- * @since 2.0.0
- */
-exports.reduceRightWithIndex = RA.reduceRightWithIndex;
-/**
- * @category Traversable
- * @since 2.6.3
- */
-var traverse = function (F) {
-    var traverseWithIndexF = exports.traverseWithIndex(F);
-    return function (f) { return traverseWithIndexF(function (_, a) { return f(a); }); };
-};
-exports.traverse = traverse;
-/**
- * @category Traversable
- * @since 2.6.3
- */
-var sequence = function (F) { return function (ta) {
-    return _reduce(ta, F.of(exports.zero()), function (fas, fa) {
-        return F.ap(F.map(fas, function (as) { return function (a) { return _function.pipe(as, exports.append(a)); }; }), fa);
-    });
-}; };
-exports.sequence = sequence;
-/**
- * @category TraversableWithIndex
- * @since 2.6.3
- */
-var traverseWithIndex = function (F) { return function (f) {
-    return exports.reduceWithIndex(F.of(exports.zero()), function (i, fbs, a) {
-        return F.ap(F.map(fbs, function (bs) { return function (b) { return _function.pipe(bs, exports.append(b)); }; }), f(i, a));
-    });
-}; };
-exports.traverseWithIndex = traverseWithIndex;
-/**
- * @category Witherable
- * @since 2.6.5
- */
-var wither = function (F) {
-    var _witherF = _wither(F);
-    return function (f) { return function (fa) { return _witherF(fa, f); }; };
-};
-exports.wither = wither;
-/**
- * @category Witherable
- * @since 2.6.5
- */
-var wilt = function (F) {
-    var _wiltF = _wilt(F);
-    return function (f) { return function (fa) { return _wiltF(fa, f); }; };
-};
-exports.wilt = wilt;
-/**
- * Creates an `Array` from the results of `f(b)`, where `b` is an initial value.
- * `unfold` stops when `f` returns `Option.none`.
- * @example
- * import { unfold } from 'fp-ts/Array'
- * import { some, none } from 'fp-ts/Option'
- *
- * assert.deepStrictEqual(
- *   unfold(5, (n) => (n > 0 ? some([n, n - 1]) : none)),
- *   [5, 4, 3, 2, 1]
- * )
- *
- * @category Unfoldable
- * @since 2.6.6
- */
-var unfold = function (b, f) {
-    var out = [];
-    var bb = b;
-    while (true) {
-        var mt = f(bb);
-        if (_.isSome(mt)) {
-            var _a = mt.value, a = _a[0], b_1 = _a[1];
-            out.push(a);
-            bb = b_1;
-        }
-        else {
-            break;
-        }
-    }
-    return out;
-};
-exports.unfold = unfold;
-// -------------------------------------------------------------------------------------
-// instances
-// -------------------------------------------------------------------------------------
-/**
- * @category instances
- * @since 2.0.0
- */
-exports.URI = 'Array';
-/**
- * @category instances
- * @since 2.0.0
- */
-exports.getShow = RA.getShow;
-/**
- * @category instances
- * @since 2.10.0
- */
-var getSemigroup = function () { return ({
-    concat: function (first, second) { return first.concat(second); }
-}); };
-exports.getSemigroup = getSemigroup;
-/**
- * Returns a `Monoid` for `Array<A>`
- *
- * @example
- * import { getMonoid } from 'fp-ts/Array'
- *
- * const M = getMonoid<number>()
- * assert.deepStrictEqual(M.concat([1, 2], [3, 4]), [1, 2, 3, 4])
- *
- * @category instances
- * @since 2.0.0
- */
-var getMonoid = function () { return ({
-    concat: exports.getSemigroup().concat,
-    empty: []
-}); };
-exports.getMonoid = getMonoid;
-/**
- * Derives an `Eq` over the `Array` of a given element type from the `Eq` of that type. The derived `Eq` defines two
- * arrays as equal if all elements of both arrays are compared equal pairwise with the given `E`. In case of arrays of
- * different lengths, the result is non equality.
- *
- * @example
- * import * as S from 'fp-ts/string'
- * import { getEq } from 'fp-ts/Array'
- *
- * const E = getEq(S.Eq)
- * assert.strictEqual(E.equals(['a', 'b'], ['a', 'b']), true)
- * assert.strictEqual(E.equals(['a'], []), false)
- *
- * @category instances
- * @since 2.0.0
- */
-exports.getEq = RA.getEq;
-/**
- * Derives an `Ord` over the `Array` of a given element type from the `Ord` of that type. The ordering between two such
- * arrays is equal to: the first non equal comparison of each arrays elements taken pairwise in increasing order, in
- * case of equality over all the pairwise elements; the longest array is considered the greatest, if both arrays have
- * the same length, the result is equality.
- *
- * @example
- * import { getOrd } from 'fp-ts/Array'
- * import * as S from 'fp-ts/string'
- *
- * const O = getOrd(S.Ord)
- * assert.strictEqual(O.compare(['b'], ['a']), 1)
- * assert.strictEqual(O.compare(['a'], ['a']), 0)
- * assert.strictEqual(O.compare(['a'], ['b']), -1)
- *
- * @category instances
- * @since 2.0.0
- */
-exports.getOrd = RA.getOrd;
-/**
- * @category instances
- * @since 2.11.0
- */
-var getUnionSemigroup = function (E) {
-    var unionE = union(E);
-    return {
-        concat: function (first, second) { return unionE(second)(first); }
-    };
-};
-exports.getUnionSemigroup = getUnionSemigroup;
-/**
- * @category instances
- * @since 2.11.0
- */
-var getUnionMonoid = function (E) { return ({
-    concat: exports.getUnionSemigroup(E).concat,
-    empty: []
-}); };
-exports.getUnionMonoid = getUnionMonoid;
-/**
- * @category instances
- * @since 2.11.0
- */
-var getIntersectionSemigroup = function (E) {
-    var intersectionE = intersection(E);
-    return {
-        concat: function (first, second) { return intersectionE(second)(first); }
-    };
-};
-exports.getIntersectionSemigroup = getIntersectionSemigroup;
-/**
- * @category instances
- * @since 2.11.0
- */
-var getDifferenceMagma = function (E) {
-    var differenceE = difference(E);
-    return {
-        concat: function (first, second) { return differenceE(second)(first); }
-    };
-};
-exports.getDifferenceMagma = getDifferenceMagma;
-/**
- * @category instances
- * @since 2.7.0
- */
-exports.Functor = {
-    URI: exports.URI,
-    map: _map
-};
-/**
- * Derivable from `Functor`.
- *
- * @category combinators
- * @since 2.10.0
- */
-exports.flap = 
-/*#__PURE__*/
-Functor.flap(exports.Functor);
-/**
- * @category instances
- * @since 2.10.0
- */
-exports.Pointed = {
-    URI: exports.URI,
-    of: exports.of
-};
-/**
- * @category instances
- * @since 2.7.0
- */
-exports.FunctorWithIndex = {
-    URI: exports.URI,
-    map: _map,
-    mapWithIndex: _mapWithIndex
-};
-/**
- * @category instances
- * @since 2.10.0
- */
-exports.Apply = {
-    URI: exports.URI,
-    map: _map,
-    ap: _ap
-};
-/**
- * Combine two effectful actions, keeping only the result of the first.
- *
- * Derivable from `Apply`.
- *
- * @category combinators
- * @since 2.5.0
- */
-exports.apFirst = 
-/*#__PURE__*/
-Apply.apFirst(exports.Apply);
-/**
- * Combine two effectful actions, keeping only the result of the second.
- *
- * Derivable from `Apply`.
- *
- * @category combinators
- * @since 2.5.0
- */
-exports.apSecond = 
-/*#__PURE__*/
-Apply.apSecond(exports.Apply);
-/**
- * @category instances
- * @since 2.7.0
- */
-exports.Applicative = {
-    URI: exports.URI,
-    map: _map,
-    ap: _ap,
-    of: exports.of
-};
-/**
- * @category instances
- * @since 2.10.0
- */
-exports.Chain = {
-    URI: exports.URI,
-    map: _map,
-    ap: _ap,
-    chain: _chain
-};
-/**
- * Composes computations in sequence, using the return value of one computation to determine the next computation and
- * keeping only the result of the first.
- *
- * Derivable from `Chain`.
- *
- * @category combinators
- * @since 2.0.0
- */
-exports.chainFirst = 
-/*#__PURE__*/
-Chain.chainFirst(exports.Chain);
-/**
- * @category instances
- * @since 2.7.0
- */
-exports.Monad = {
-    URI: exports.URI,
-    map: _map,
-    ap: _ap,
-    of: exports.of,
-    chain: _chain
-};
-/**
- * @category instances
- * @since 2.7.0
- */
-exports.Unfoldable = {
-    URI: exports.URI,
-    unfold: exports.unfold
-};
-/**
- * @category instances
- * @since 2.7.0
- */
-exports.Alt = {
-    URI: exports.URI,
-    map: _map,
-    alt: _alt
-};
-/**
- * @category instances
- * @since 2.11.0
- */
-exports.Zero = {
-    URI: exports.URI,
-    zero: exports.zero
-};
-/**
- * @category constructors
- * @since 2.11.0
- */
-exports.guard = 
-/*#__PURE__*/
-Zero.guard(exports.Zero, exports.Pointed);
-/**
- * @category instances
- * @since 2.7.0
- */
-exports.Alternative = {
-    URI: exports.URI,
-    map: _map,
-    ap: _ap,
-    of: exports.of,
-    alt: _alt,
-    zero: exports.zero
-};
-/**
- * @category instances
- * @since 2.7.0
- */
-exports.Extend = {
-    URI: exports.URI,
-    map: _map,
-    extend: _extend
-};
-/**
- * @category instances
- * @since 2.7.0
- */
-exports.Compactable = {
-    URI: exports.URI,
-    compact: exports.compact,
-    separate: exports.separate
-};
-/**
- * @category instances
- * @since 2.7.0
- */
-exports.Filterable = {
-    URI: exports.URI,
-    map: _map,
-    compact: exports.compact,
-    separate: exports.separate,
-    filter: _filter,
-    filterMap: _filterMap,
-    partition: _partition,
-    partitionMap: _partitionMap
-};
-/**
- * @category instances
- * @since 2.7.0
- */
-exports.FilterableWithIndex = {
-    URI: exports.URI,
-    map: _map,
-    mapWithIndex: _mapWithIndex,
-    compact: exports.compact,
-    separate: exports.separate,
-    filter: _filter,
-    filterMap: _filterMap,
-    partition: _partition,
-    partitionMap: _partitionMap,
-    partitionMapWithIndex: _partitionMapWithIndex,
-    partitionWithIndex: _partitionWithIndex,
-    filterMapWithIndex: _filterMapWithIndex,
-    filterWithIndex: _filterWithIndex
-};
-/**
- * @category instances
- * @since 2.7.0
- */
-exports.Foldable = {
-    URI: exports.URI,
-    reduce: _reduce,
-    foldMap: _foldMap,
-    reduceRight: _reduceRight
-};
-/**
- * @category instances
- * @since 2.7.0
- */
-exports.FoldableWithIndex = {
-    URI: exports.URI,
-    reduce: _reduce,
-    foldMap: _foldMap,
-    reduceRight: _reduceRight,
-    reduceWithIndex: _reduceWithIndex,
-    foldMapWithIndex: _foldMapWithIndex,
-    reduceRightWithIndex: _reduceRightWithIndex
-};
-/**
- * @category instances
- * @since 2.7.0
- */
-exports.Traversable = {
-    URI: exports.URI,
-    map: _map,
-    reduce: _reduce,
-    foldMap: _foldMap,
-    reduceRight: _reduceRight,
-    traverse: _traverse,
-    sequence: exports.sequence
-};
-/**
- * @category instances
- * @since 2.7.0
- */
-exports.TraversableWithIndex = {
-    URI: exports.URI,
-    map: _map,
-    mapWithIndex: _mapWithIndex,
-    reduce: _reduce,
-    foldMap: _foldMap,
-    reduceRight: _reduceRight,
-    reduceWithIndex: _reduceWithIndex,
-    foldMapWithIndex: _foldMapWithIndex,
-    reduceRightWithIndex: _reduceRightWithIndex,
-    traverse: _traverse,
-    sequence: exports.sequence,
-    traverseWithIndex: _traverseWithIndex
-};
-var _wither = Witherable.witherDefault(exports.Traversable, exports.Compactable);
-var _wilt = Witherable.wiltDefault(exports.Traversable, exports.Compactable);
-/**
- * @category instances
- * @since 2.7.0
- */
-exports.Witherable = {
-    URI: exports.URI,
-    map: _map,
-    compact: exports.compact,
-    separate: exports.separate,
-    filter: _filter,
-    filterMap: _filterMap,
-    partition: _partition,
-    partitionMap: _partitionMap,
-    reduce: _reduce,
-    foldMap: _foldMap,
-    reduceRight: _reduceRight,
-    traverse: _traverse,
-    sequence: exports.sequence,
-    wither: _wither,
-    wilt: _wilt
-};
-/**
- * @category ChainRec
- * @since 2.11.0
- */
-exports.chainRecDepthFirst = RA.chainRecDepthFirst;
-/**
- * @category instances
- * @since 2.11.0
- */
-exports.ChainRecDepthFirst = {
-    URI: exports.URI,
-    map: _map,
-    ap: _ap,
-    chain: _chain,
-    chainRec: _chainRecDepthFirst
-};
-/**
- * @category ChainRec
- * @since 2.11.0
- */
-exports.chainRecBreadthFirst = RA.chainRecBreadthFirst;
-/**
- * @category instances
- * @since 2.11.0
- */
-exports.ChainRecBreadthFirst = {
-    URI: exports.URI,
-    map: _map,
-    ap: _ap,
-    chain: _chain,
-    chainRec: _chainRecBreadthFirst
-};
-/**
- * Filter values inside a context.
- *
- * @since 2.11.0
- */
-exports.filterE = 
-/*#__PURE__*/
-Witherable.filterE(exports.Witherable);
-/**
- * @category instances
- * @since 2.11.0
- */
-exports.FromEither = {
-    URI: exports.URI,
-    fromEither: exports.fromEither
-};
-/**
- * @category combinators
- * @since 2.11.0
- */
-exports.fromEitherK = 
-/*#__PURE__*/
-FromEither.fromEitherK(exports.FromEither);
-// -------------------------------------------------------------------------------------
-// unsafe
-// -------------------------------------------------------------------------------------
-/**
- * @category unsafe
- * @since 2.0.0
- */
-exports.unsafeInsertAt = NEA.unsafeInsertAt;
-/**
- * @category unsafe
- * @since 2.0.0
- */
-var unsafeUpdateAt = function (i, a, as) {
-    return exports.isNonEmpty(as) ? NEA.unsafeUpdateAt(i, a, as) : [];
-};
-exports.unsafeUpdateAt = unsafeUpdateAt;
-/**
- * @category unsafe
- * @since 2.0.0
- */
-var unsafeDeleteAt = function (i, as) {
-    var xs = as.slice();
-    xs.splice(i, 1);
-    return xs;
-};
-exports.unsafeDeleteAt = unsafeDeleteAt;
-// -------------------------------------------------------------------------------------
-// utils
-// -------------------------------------------------------------------------------------
-/**
- * @since 2.9.0
- */
-exports.every = RA.every;
-/**
- * @since 2.9.0
- */
-var some = function (predicate) { return function (as) { return as.some(predicate); }; };
-exports.some = some;
-/**
- * Alias of [`some`](#some)
- *
- * @since 2.11.0
- */
-exports.exists = exports.some;
-// -------------------------------------------------------------------------------------
-// do notation
-// -------------------------------------------------------------------------------------
-/**
- * @since 2.9.0
- */
-exports.Do = 
-/*#__PURE__*/
-exports.of(_.emptyRecord);
-/**
- * @since 2.8.0
- */
-exports.bindTo = 
-/*#__PURE__*/
-Functor.bindTo(exports.Functor);
-/**
- * @since 2.8.0
- */
-exports.bind = 
-/*#__PURE__*/
-Chain.bind(exports.Chain);
-// -------------------------------------------------------------------------------------
-// pipeable sequence S
-// -------------------------------------------------------------------------------------
-/**
- * @since 2.8.0
- */
-exports.apS = 
-/*#__PURE__*/
-Apply.apS(exports.Apply);
-// -------------------------------------------------------------------------------------
-// deprecated
-// -------------------------------------------------------------------------------------
-// tslint:disable: deprecation
-/**
- * Use `NonEmptyArray` module instead.
- *
- * @category constructors
- * @since 2.0.0
- * @deprecated
- */
-exports.range = NEA.range;
-/**
- * Use a new `[]` instead.
- *
- * @since 2.0.0
- * @deprecated
- */
-exports.empty = [];
-/**
- * Use `prepend` instead.
- *
- * @category constructors
- * @since 2.0.0
- * @deprecated
- */
-exports.cons = NEA.cons;
-/**
- * Use `append` instead.
- *
- * @category constructors
- * @since 2.0.0
- * @deprecated
- */
-exports.snoc = NEA.snoc;
-/**
- * Use `prependAll` instead
- *
- * @category combinators
- * @since 2.9.0
- * @deprecated
- */
-exports.prependToAll = exports.prependAll;
-/**
- * Use small, specific instances instead.
- *
- * @category instances
- * @since 2.0.0
- * @deprecated
- */
-exports.array = {
-    URI: exports.URI,
-    compact: exports.compact,
-    separate: exports.separate,
-    map: _map,
-    ap: _ap,
-    of: exports.of,
-    chain: _chain,
-    filter: _filter,
-    filterMap: _filterMap,
-    partition: _partition,
-    partitionMap: _partitionMap,
-    mapWithIndex: _mapWithIndex,
-    partitionMapWithIndex: _partitionMapWithIndex,
-    partitionWithIndex: _partitionWithIndex,
-    filterMapWithIndex: _filterMapWithIndex,
-    filterWithIndex: _filterWithIndex,
-    alt: _alt,
-    zero: exports.zero,
-    unfold: exports.unfold,
-    reduce: _reduce,
-    foldMap: _foldMap,
-    reduceRight: _reduceRight,
-    traverse: _traverse,
-    sequence: exports.sequence,
-    reduceWithIndex: _reduceWithIndex,
-    foldMapWithIndex: _foldMapWithIndex,
-    reduceRightWithIndex: _reduceRightWithIndex,
-    traverseWithIndex: _traverseWithIndex,
-    extend: _extend,
-    wither: _wither,
-    wilt: _wilt
-};
-});
-
-const _Array$1 = /*@__PURE__*/getDefaultExportFromCjs(_Array);
-
-export { _Array as _, number as n };