effect 2.0.0-next.57 → 2.0.0-next.59

package/dist/cjs/Chunk.js

@@ -1,1050 +0,0 @@
-"use strict";
-
-Object.defineProperty(exports, "__esModule", {
-  value: true
-});
-exports.zipWith = exports.zip = exports.unzip = exports.unsafeLast = exports.unsafeHead = exports.unsafeGet = exports.unsafeFromNonEmptyArray = exports.unsafeFromArray = exports.union = exports.toReadonlyArray = exports.toArray = exports.takeWhile = exports.takeRight = exports.take = exports.tailNonEmpty = exports.tail = exports.splitWhere = exports.splitAt = exports.split = exports.sortWith = exports.sort = exports.some = exports.size = exports.separate = exports.reverse = exports.replaceOption = exports.replace = exports.remove = exports.reduceRight = exports.reduce = exports.range = exports.prependAll = exports.prepend = exports.partitionMap = exports.partition = exports.of = exports.modifyOption = exports.modify = exports.mapAccum = exports.map = exports.makeBy = exports.make = exports.last = exports.join = exports.isNonEmpty = exports.isEmpty = exports.isChunk = exports.intersection = exports.headNonEmpty = exports.head = exports.getEquivalence = exports.get = exports.fromIterable = exports.forEach = exports.flatten = exports.flatMap = exports.findLastIndex = exports.findLast = exports.findFirstIndex = exports.findFirst = exports.filterMapWhile = exports.filterMap = exports.filter = exports.every = exports.empty = exports.dropWhile = exports.dropRight = exports.drop = exports.dedupeAdjacent = exports.dedupe = exports.containsWith = exports.contains = exports.compact = exports.chunksOf = exports.appendAll = exports.append = void 0;
-var Equal = /*#__PURE__*/_interopRequireWildcard( /*#__PURE__*/require("./Equal.js"));
-var Equivalence = /*#__PURE__*/_interopRequireWildcard( /*#__PURE__*/require("./Equivalence.js"));
-var _Function = /*#__PURE__*/require("./Function.js");
-var Hash = /*#__PURE__*/_interopRequireWildcard( /*#__PURE__*/require("./Hash.js"));
-var _Inspectable = /*#__PURE__*/require("./Inspectable.js");
-var O = /*#__PURE__*/_interopRequireWildcard( /*#__PURE__*/require("./Option.js"));
-var Order = /*#__PURE__*/_interopRequireWildcard( /*#__PURE__*/require("./Order.js"));
-var _Pipeable = /*#__PURE__*/require("./Pipeable.js");
-var _Predicate = /*#__PURE__*/require("./Predicate.js");
-var RA = /*#__PURE__*/_interopRequireWildcard( /*#__PURE__*/require("./ReadonlyArray.js"));
-function _getRequireWildcardCache(e) {
-  if ("function" != typeof WeakMap) return null;
-  var r = new WeakMap(),
-    t = new WeakMap();
-  return (_getRequireWildcardCache = function (e) {
-    return e ? t : r;
-  })(e);
-}
-function _interopRequireWildcard(e, r) {
-  if (!r && e && e.__esModule) return e;
-  if (null === e || "object" != typeof e && "function" != typeof e) return {
-    default: e
-  };
-  var t = _getRequireWildcardCache(r);
-  if (t && t.has(e)) return t.get(e);
-  var n = {
-      __proto__: null
-    },
-    a = Object.defineProperty && Object.getOwnPropertyDescriptor;
-  for (var u in e) if ("default" !== u && Object.prototype.hasOwnProperty.call(e, u)) {
-    var i = a ? Object.getOwnPropertyDescriptor(e, u) : null;
-    i && (i.get || i.set) ? Object.defineProperty(n, u, i) : n[u] = e[u];
-  }
-  return n.default = e, t && t.set(e, n), n;
-}
-const TypeId = /*#__PURE__*/Symbol.for("effect/Chunk");
-function copy(src, srcPos, dest, destPos, len) {
-  for (let i = srcPos; i < Math.min(src.length, srcPos + len); i++) {
-    dest[destPos + i - srcPos] = src[i];
-  }
-  return dest;
-}
-const emptyArray = [];
-/**
- * Compares the two chunks of equal length using the specified function
- *
- * @category equivalence
- * @since 2.0.0
- */
-const getEquivalence = isEquivalent => Equivalence.make((self, that) => self.length === that.length && toReadonlyArray(self).every((value, i) => isEquivalent(value, unsafeGet(that, i))));
-exports.getEquivalence = getEquivalence;
-const _equivalence = /*#__PURE__*/getEquivalence(Equal.equals);
-const ChunkProto = {
-  [TypeId]: {
-    _A: _ => _
-  },
-  toString() {
-    return (0, _Inspectable.format)(this.toJSON());
-  },
-  toJSON() {
-    return {
-      _id: "Chunk",
-      values: toReadonlyArray(this).map(_Inspectable.toJSON)
-    };
-  },
-  [_Inspectable.NodeInspectSymbol]() {
-    return this.toJSON();
-  },
-  [Equal.symbol](that) {
-    return isChunk(that) && _equivalence(this, that);
-  },
-  [Hash.symbol]() {
-    return Hash.array(toReadonlyArray(this));
-  },
-  [Symbol.iterator]() {
-    switch (this.backing._tag) {
-      case "IArray":
-        {
-          return this.backing.array[Symbol.iterator]();
-        }
-      case "IEmpty":
-        {
-          return emptyArray[Symbol.iterator]();
-        }
-      default:
-        {
-          return toReadonlyArray(this)[Symbol.iterator]();
-        }
-    }
-  },
-  pipe() {
-    return (0, _Pipeable.pipeArguments)(this, arguments);
-  }
-};
-const makeChunk = backing => {
-  const chunk = Object.create(ChunkProto);
-  chunk.backing = backing;
-  switch (backing._tag) {
-    case "IEmpty":
-      {
-        chunk.length = 0;
-        chunk.depth = 0;
-        chunk.left = chunk;
-        chunk.right = chunk;
-        break;
-      }
-    case "IConcat":
-      {
-        chunk.length = backing.left.length + backing.right.length;
-        chunk.depth = 1 + Math.max(backing.left.depth, backing.right.depth);
-        chunk.left = backing.left;
-        chunk.right = backing.right;
-        break;
-      }
-    case "IArray":
-      {
-        chunk.length = backing.array.length;
-        chunk.depth = 0;
-        chunk.left = _empty;
-        chunk.right = _empty;
-        break;
-      }
-    case "ISingleton":
-      {
-        chunk.length = 1;
-        chunk.depth = 0;
-        chunk.left = _empty;
-        chunk.right = _empty;
-        break;
-      }
-    case "ISlice":
-      {
-        chunk.length = backing.length;
-        chunk.depth = backing.chunk.depth + 1;
-        chunk.left = _empty;
-        chunk.right = _empty;
-        break;
-      }
-  }
-  return chunk;
-};
-/**
- * Checks if `u` is a `Chunk<unknown>`
- *
- * @category constructors
- * @since 2.0.0
- */
-const isChunk = u => (0, _Predicate.hasProperty)(u, TypeId);
-exports.isChunk = isChunk;
-const _empty = /*#__PURE__*/makeChunk({
-  _tag: "IEmpty"
-});
-/**
- * @category constructors
- * @since 2.0.0
- */
-const empty = () => _empty;
-/**
- * Builds a `NonEmptyChunk` from an non-empty collection of elements.
- *
- * @category constructors
- * @since 2.0.0
- */
-exports.empty = empty;
-const make = (...as) => as.length === 1 ? of(as[0]) : unsafeFromNonEmptyArray(as);
-/**
- * Builds a `NonEmptyChunk` from a single element.
- *
- * @category constructors
- * @since 2.0.0
- */
-exports.make = make;
-const of = a => makeChunk({
-  _tag: "ISingleton",
-  a
-});
-/**
- * Converts from an `Iterable<A>`
- *
- * @category conversions
- * @since 2.0.0
- */
-exports.of = of;
-const fromIterable = self => isChunk(self) ? self : makeChunk({
-  _tag: "IArray",
-  array: RA.fromIterable(self)
-});
-exports.fromIterable = fromIterable;
-const copyToArray = (self, array, initial) => {
-  switch (self.backing._tag) {
-    case "IArray":
-      {
-        copy(self.backing.array, 0, array, initial, self.length);
-        break;
-      }
-    case "IConcat":
-      {
-        copyToArray(self.left, array, initial);
-        copyToArray(self.right, array, initial + self.left.length);
-        break;
-      }
-    case "ISingleton":
-      {
-        array[initial] = self.backing.a;
-        break;
-      }
-    case "ISlice":
-      {
-        let i = 0;
-        let j = initial;
-        while (i < self.length) {
-          array[j] = unsafeGet(self, i);
-          i += 1;
-          j += 1;
-        }
-        break;
-      }
-  }
-};
-/**
- * Converts the specified `Chunk` to a `Array`.
- *
- * @category conversions
- * @since 2.0.0
- */
-const toArray = self => toReadonlyArray(self).slice();
-/**
- * Converts the specified `Chunk` to a `ReadonlyArray`.
- *
- * @category conversions
- * @since 2.0.0
- */
-exports.toArray = toArray;
-const toReadonlyArray = self => {
-  switch (self.backing._tag) {
-    case "IEmpty":
-      {
-        return emptyArray;
-      }
-    case "IArray":
-      {
-        return self.backing.array;
-      }
-    default:
-      {
-        const arr = new Array(self.length);
-        copyToArray(self, arr, 0);
-        self.backing = {
-          _tag: "IArray",
-          array: arr
-        };
-        self.left = _empty;
-        self.right = _empty;
-        self.depth = 0;
-        return arr;
-      }
-  }
-};
-/**
- * @since 2.0.0
- * @category elements
- */
-exports.toReadonlyArray = toReadonlyArray;
-const reverse = self => {
-  switch (self.backing._tag) {
-    case "IEmpty":
-    case "ISingleton":
-      return self;
-    case "IArray":
-      {
-        return makeChunk({
-          _tag: "IArray",
-          array: RA.reverse(self.backing.array)
-        });
-      }
-    case "IConcat":
-      {
-        return makeChunk({
-          _tag: "IConcat",
-          left: reverse(self.backing.right),
-          right: reverse(self.backing.left)
-        });
-      }
-    case "ISlice":
-      return unsafeFromArray(RA.reverse(toReadonlyArray(self)));
-  }
-};
-/**
- * This function provides a safe way to read a value at a particular index from a `Chunk`.
- *
- * @category elements
- * @since 2.0.0
- */
-exports.reverse = reverse;
-const get = exports.get = /*#__PURE__*/(0, _Function.dual)(2, (self, index) => index < 0 || index >= self.length ? O.none() : O.some(unsafeGet(self, index)));
-/**
- * Wraps an array into a chunk without copying, unsafe on mutable arrays
- *
- * @since 2.0.0
- * @category unsafe
- */
-const unsafeFromArray = self => makeChunk({
-  _tag: "IArray",
-  array: self
-});
-/**
- * Wraps an array into a chunk without copying, unsafe on mutable arrays
- *
- * @since 2.0.0
- * @category unsafe
- */
-exports.unsafeFromArray = unsafeFromArray;
-const unsafeFromNonEmptyArray = self => unsafeFromArray(self);
-/**
- * Gets an element unsafely, will throw on out of bounds
- *
- * @since 2.0.0
- * @category unsafe
- */
-exports.unsafeFromNonEmptyArray = unsafeFromNonEmptyArray;
-const unsafeGet = exports.unsafeGet = /*#__PURE__*/(0, _Function.dual)(2, (self, index) => {
-  switch (self.backing._tag) {
-    case "IEmpty":
-      {
-        throw new Error(`Index out of bounds`);
-      }
-    case "ISingleton":
-      {
-        if (index !== 0) {
-          throw new Error(`Index out of bounds`);
-        }
-        return self.backing.a;
-      }
-    case "IArray":
-      {
-        if (index >= self.length || index < 0) {
-          throw new Error(`Index out of bounds`);
-        }
-        return self.backing.array[index];
-      }
-    case "IConcat":
-      {
-        return index < self.left.length ? unsafeGet(self.left, index) : unsafeGet(self.right, index - self.left.length);
-      }
-    case "ISlice":
-      {
-        return unsafeGet(self.backing.chunk, index + self.backing.offset);
-      }
-  }
-});
-/**
- * Appends the specified element to the end of the `Chunk`.
- *
- * @category concatenating
- * @since 2.0.0
- */
-const append = exports.append = /*#__PURE__*/(0, _Function.dual)(2, (self, a) => appendAll(self, of(a)));
-/**
- * Prepend an element to the front of a `Chunk`, creating a new `NonEmptyChunk`.
- *
- * @category concatenating
- * @since 2.0.0
- */
-const prepend = exports.prepend = /*#__PURE__*/(0, _Function.dual)(2, (self, elem) => appendAll(of(elem), self));
-/**
- * Takes the first up to `n` elements from the chunk
- *
- * @since 2.0.0
- */
-const take = exports.take = /*#__PURE__*/(0, _Function.dual)(2, (self, n) => {
-  if (n <= 0) {
-    return _empty;
-  } else if (n >= self.length) {
-    return self;
-  } else {
-    switch (self.backing._tag) {
-      case "ISlice":
-        {
-          return makeChunk({
-            _tag: "ISlice",
-            chunk: self.backing.chunk,
-            length: n,
-            offset: self.backing.offset
-          });
-        }
-      case "IConcat":
-        {
-          if (n > self.left.length) {
-            return makeChunk({
-              _tag: "IConcat",
-              left: self.left,
-              right: take(self.right, n - self.left.length)
-            });
-          }
-          return take(self.left, n);
-        }
-      default:
-        {
-          return makeChunk({
-            _tag: "ISlice",
-            chunk: self,
-            offset: 0,
-            length: n
-          });
-        }
-    }
-  }
-});
-/**
- * Drops the first up to `n` elements from the chunk
- *
- * @since 2.0.0
- */
-const drop = exports.drop = /*#__PURE__*/(0, _Function.dual)(2, (self, n) => {
-  if (n <= 0) {
-    return self;
-  } else if (n >= self.length) {
-    return _empty;
-  } else {
-    switch (self.backing._tag) {
-      case "ISlice":
-        {
-          return makeChunk({
-            _tag: "ISlice",
-            chunk: self.backing.chunk,
-            offset: self.backing.offset + n,
-            length: self.backing.length - n
-          });
-        }
-      case "IConcat":
-        {
-          if (n > self.left.length) {
-            return drop(self.right, n - self.left.length);
-          }
-          return makeChunk({
-            _tag: "IConcat",
-            left: drop(self.left, n),
-            right: self.right
-          });
-        }
-      default:
-        {
-          return makeChunk({
-            _tag: "ISlice",
-            chunk: self,
-            offset: n,
-            length: self.length - n
-          });
-        }
-    }
-  }
-});
-/**
- * Drops the last `n` elements.
- *
- * @since 2.0.0
- */
-const dropRight = exports.dropRight = /*#__PURE__*/(0, _Function.dual)(2, (self, n) => take(self, Math.max(0, self.length - n)));
-/**
- * Drops all elements so long as the predicate returns true.
- *
- * @since 2.0.0
- */
-const dropWhile = exports.dropWhile = /*#__PURE__*/(0, _Function.dual)(2, (self, predicate) => {
-  const arr = toReadonlyArray(self);
-  const len = arr.length;
-  let i = 0;
-  while (i < len && predicate(arr[i])) {
-    i++;
-  }
-  return drop(self, i);
-});
-/**
- * Prepends the specified prefix chunk to the beginning of the specified chunk.
- * If either chunk is non-empty, the result is also a non-empty chunk.
- *
- * @example
- * import * as Chunk from "effect/Chunk"
- *
- * assert.deepStrictEqual(
- *   Chunk.make(1, 2).pipe(Chunk.prependAll(Chunk.make("a", "b")), Chunk.toArray),
- *   ["a", "b", 1, 2]
- * )
- *
- * @category concatenating
- * @since 2.0.0
- */
-const prependAll = exports.prependAll = /*#__PURE__*/(0, _Function.dual)(2, (self, that) => appendAll(that, self));
-/**
- * Concatenates two chunks, combining their elements.
- * If either chunk is non-empty, the result is also a non-empty chunk.
- *
- * @example
- * import * as Chunk from "effect/Chunk"
- *
- * assert.deepStrictEqual(
- *   Chunk.make(1, 2).pipe(Chunk.appendAll(Chunk.make("a", "b")), Chunk.toArray),
- *   [1, 2, "a", "b"]
- * )
- *
- * @category concatenating
- * @since 2.0.0
- */
-const appendAll = exports.appendAll = /*#__PURE__*/(0, _Function.dual)(2, (self, that) => {
-  if (self.backing._tag === "IEmpty") {
-    return that;
-  }
-  if (that.backing._tag === "IEmpty") {
-    return self;
-  }
-  const diff = that.depth - self.depth;
-  if (Math.abs(diff) <= 1) {
-    return makeChunk({
-      _tag: "IConcat",
-      left: self,
-      right: that
-    });
-  } else if (diff < -1) {
-    if (self.left.depth >= self.right.depth) {
-      const nr = appendAll(self.right, that);
-      return makeChunk({
-        _tag: "IConcat",
-        left: self.left,
-        right: nr
-      });
-    } else {
-      const nrr = appendAll(self.right.right, that);
-      if (nrr.depth === self.depth - 3) {
-        const nr = makeChunk({
-          _tag: "IConcat",
-          left: self.right.left,
-          right: nrr
-        });
-        return makeChunk({
-          _tag: "IConcat",
-          left: self.left,
-          right: nr
-        });
-      } else {
-        const nl = makeChunk({
-          _tag: "IConcat",
-          left: self.left,
-          right: self.right.left
-        });
-        return makeChunk({
-          _tag: "IConcat",
-          left: nl,
-          right: nrr
-        });
-      }
-    }
-  } else {
-    if (that.right.depth >= that.left.depth) {
-      const nl = appendAll(self, that.left);
-      return makeChunk({
-        _tag: "IConcat",
-        left: nl,
-        right: that.right
-      });
-    } else {
-      const nll = appendAll(self, that.left.left);
-      if (nll.depth === that.depth - 3) {
-        const nl = makeChunk({
-          _tag: "IConcat",
-          left: nll,
-          right: that.left.right
-        });
-        return makeChunk({
-          _tag: "IConcat",
-          left: nl,
-          right: that.right
-        });
-      } else {
-        const nr = makeChunk({
-          _tag: "IConcat",
-          left: that.left.right,
-          right: that.right
-        });
-        return makeChunk({
-          _tag: "IConcat",
-          left: nll,
-          right: nr
-        });
-      }
-    }
-  }
-});
-/**
- * Returns a filtered and mapped subset of the elements.
- *
- * @since 2.0.0
- * @category filtering
- */
-const filterMap = exports.filterMap = /*#__PURE__*/(0, _Function.dual)(2, (self, f) => unsafeFromArray(RA.filterMap(self, f)));
-/**
- * Returns a filtered and mapped subset of the elements.
- *
- * @since 2.0.0
- * @category filtering
- */
-const filter = exports.filter = /*#__PURE__*/(0, _Function.dual)(2, (self, predicate) => unsafeFromArray(RA.filterMap(self, O.liftPredicate(predicate))));
-/**
- * Transforms all elements of the chunk for as long as the specified function returns some value
- *
- * @since 2.0.0
- * @category filtering
- */
-const filterMapWhile = exports.filterMapWhile = /*#__PURE__*/(0, _Function.dual)(2, (self, f) => unsafeFromArray(RA.filterMapWhile(self, f)));
-/**
- * Filter out optional values
- *
- * @since 2.0.0
- * @category filtering
- */
-const compact = self => filterMap(self, _Function.identity);
-/**
- * Applies a function to each element in a chunk and returns a new chunk containing the concatenated mapped elements.
- *
- * @since 2.0.0
- * @category sequencing
- */
-exports.compact = compact;
-const flatMap = exports.flatMap = /*#__PURE__*/(0, _Function.dual)(2, (self, f) => {
-  if (self.backing._tag === "ISingleton") {
-    return f(self.backing.a, 0);
-  }
-  let out = _empty;
-  let i = 0;
-  for (const k of self) {
-    out = appendAll(out, f(k, i++));
-  }
-  return out;
-});
-/**
- * Applies the specified function to each element of the `List`.
- *
- * @since 2.0.0
- * @category combinators
- */
-const forEach = exports.forEach = /*#__PURE__*/(0, _Function.dual)(2, (self, f) => toReadonlyArray(self).forEach(f));
-/**
- * Flattens a chunk of chunks into a single chunk by concatenating all chunks.
- *
- * @since 2.0.0
- * @category sequencing
- */
-const flatten = exports.flatten = /*#__PURE__*/flatMap(_Function.identity);
-/**
- * Groups elements in chunks of up to `n` elements.
- *
- * @since 2.0.0
- * @category elements
- */
-const chunksOf = exports.chunksOf = /*#__PURE__*/(0, _Function.dual)(2, (self, n) => {
-  const gr = [];
-  let current = [];
-  toReadonlyArray(self).forEach(a => {
-    current.push(a);
-    if (current.length >= n) {
-      gr.push(unsafeFromArray(current));
-      current = [];
-    }
-  });
-  if (current.length > 0) {
-    gr.push(unsafeFromArray(current));
-  }
-  return unsafeFromArray(gr);
-});
-/**
- * Creates a Chunk of unique values that are included in all given Chunks.
- *
- * The order and references of result values are determined by the Chunk.
- *
- * @since 2.0.0
- * @category elements
- */
-const intersection = exports.intersection = /*#__PURE__*/(0, _Function.dual)(2, (self, that) => unsafeFromArray(RA.intersection(toReadonlyArray(self), toReadonlyArray(that))));
-/**
- * Determines if the chunk is empty.
- *
- * @since 2.0.0
- * @category elements
- */
-const isEmpty = self => self.length === 0;
-/**
- * Determines if the chunk is not empty.
- *
- * @since 2.0.0
- * @category elements
- */
-exports.isEmpty = isEmpty;
-const isNonEmpty = self => self.length > 0;
-/**
- * Returns the first element of this chunk if it exists.
- *
- * @since 2.0.0
- * @category elements
- */
-exports.isNonEmpty = isNonEmpty;
-const head = exports.head = /*#__PURE__*/get(0);
-/**
- * Returns the first element of this chunk.
- *
- * @since 2.0.0
- * @category unsafe
- */
-const unsafeHead = self => unsafeGet(self, 0);
-/**
- * Returns the first element of this non empty chunk.
- *
- * @since 2.0.0
- * @category elements
- */
-exports.unsafeHead = unsafeHead;
-const headNonEmpty = exports.headNonEmpty = unsafeHead;
-/**
- * Returns the last element of this chunk if it exists.
- *
- * @since 2.0.0
- * @category elements
- */
-const last = self => get(self, self.length - 1);
-/**
- * Returns the last element of this chunk.
- *
- * @since 2.0.0
- * @category unsafe
- */
-exports.last = last;
-const unsafeLast = self => unsafeGet(self, self.length - 1);
-/**
- * Transforms the elements of a chunk using the specified mapping function.
- * If the input chunk is non-empty, the resulting chunk will also be non-empty.
- *
- * @example
- * import * as Chunk from "effect/Chunk"
- *
- * assert.deepStrictEqual(
- *   Chunk.map(Chunk.make(1, 2), (n) => n + 1),
- *   Chunk.make(2, 3)
- * )
- *
- * @since 2.0.0
- * @category mapping
- */
-exports.unsafeLast = unsafeLast;
-const map = exports.map = /*#__PURE__*/(0, _Function.dual)(2, (self, f) => self.backing._tag === "ISingleton" ? of(f(self.backing.a, 0)) : unsafeFromArray((0, _Function.pipe)(toReadonlyArray(self), RA.map((a, i) => f(a, i)))));
-/**
- * Statefully maps over the chunk, producing new elements of type `B`.
- *
- * @since 2.0.0
- * @category folding
- */
-const mapAccum = exports.mapAccum = /*#__PURE__*/(0, _Function.dual)(3, (self, s, f) => {
-  const [s1, as] = RA.mapAccum(self, s, f);
-  return [s1, unsafeFromArray(as)];
-});
-/**
- * Separate elements based on a predicate that also exposes the index of the element.
- *
- * @category filtering
- * @since 2.0.0
- */
-const partition = exports.partition = /*#__PURE__*/(0, _Function.dual)(2, (self, predicate) => (0, _Function.pipe)(RA.partition(toReadonlyArray(self), predicate), ([l, r]) => [unsafeFromArray(l), unsafeFromArray(r)]));
-/**
- * Partitions the elements of this chunk into two chunks using f.
- *
- * @category filtering
- * @since 2.0.0
- */
-const partitionMap = exports.partitionMap = /*#__PURE__*/(0, _Function.dual)(2, (self, f) => (0, _Function.pipe)(RA.partitionMap(toReadonlyArray(self), f), ([l, r]) => [unsafeFromArray(l), unsafeFromArray(r)]));
-/**
- * Partitions the elements of this chunk into two chunks.
- *
- * @category filtering
- * @since 2.0.0
- */
-const separate = self => (0, _Function.pipe)(RA.separate(toReadonlyArray(self)), ([l, r]) => [unsafeFromArray(l), unsafeFromArray(r)]);
-/**
- * Retireves the size of the chunk
- *
- * @since 2.0.0
- * @category elements
- */
-exports.separate = separate;
-const size = self => self.length;
-/**
- * Sort the elements of a Chunk in increasing order, creating a new Chunk.
- *
- * @since 2.0.0
- * @category elements
- */
-exports.size = size;
-const sort = exports.sort = /*#__PURE__*/(0, _Function.dual)(2, (self, O) => unsafeFromArray(RA.sort(toReadonlyArray(self), O)));
-/**
- * @since 2.0.0
- * @category elements
- */
-const sortWith = exports.sortWith = /*#__PURE__*/(0, _Function.dual)(3, (self, f, order) => sort(self, Order.mapInput(order, f)));
-/**
- *  Returns two splits of this chunk at the specified index.
- *
- * @since 2.0.0
- * @category elements
- */
-const splitAt = exports.splitAt = /*#__PURE__*/(0, _Function.dual)(2, (self, n) => [take(self, n), drop(self, n)]);
-/**
- * Splits this chunk into `n` equally sized chunks.
- *
- * @since 2.0.0
- * @category elements
- */
-const split = exports.split = /*#__PURE__*/(0, _Function.dual)(2, (self, n) => chunksOf(self, Math.ceil(self.length / Math.floor(n))));
-/**
- * Splits this chunk on the first element that matches this predicate.
- *
- * @category elements
- * @since 2.0.0
- */
-const splitWhere = exports.splitWhere = /*#__PURE__*/(0, _Function.dual)(2, (self, predicate) => {
-  let i = 0;
-  for (const a of toReadonlyArray(self)) {
-    if (predicate(a)) {
-      break;
-    } else {
-      i++;
-    }
-  }
-  return splitAt(self, i);
-});
-/**
- * Returns every elements after the first.
- *
- * @since 2.0.0
- * @category elements
- */
-const tail = self => self.length > 0 ? O.some(drop(self, 1)) : O.none();
-/**
- * Returns every elements after the first.
- *
- * @since 2.0.0
- * @category elements
- */
-exports.tail = tail;
-const tailNonEmpty = self => drop(self, 1);
-/**
- * Takes the last `n` elements.
- *
- * @since 2.0.0
- * @category elements
- */
-exports.tailNonEmpty = tailNonEmpty;
-const takeRight = exports.takeRight = /*#__PURE__*/(0, _Function.dual)(2, (self, n) => drop(self, self.length - n));
-/**
- * Takes all elements so long as the predicate returns true.
- *
- * @since 2.0.0
- * @category elements
- */
-const takeWhile = exports.takeWhile = /*#__PURE__*/(0, _Function.dual)(2, (self, predicate) => {
-  const out = [];
-  for (const a of toReadonlyArray(self)) {
-    if (predicate(a)) {
-      out.push(a);
-    } else {
-      break;
-    }
-  }
-  return unsafeFromArray(out);
-});
-/**
- * Creates a Chunks of unique values, in order, from all given Chunks.
- *
- * @since 2.0.0
- * @category elements
- */
-const union = exports.union = /*#__PURE__*/(0, _Function.dual)(2, (self, that) => unsafeFromArray(RA.union(toReadonlyArray(self), toReadonlyArray(that))));
-/**
- * Remove duplicates from an array, keeping the first occurrence of an element.
- *
- * @since 2.0.0
- * @category elements
- */
-const dedupe = self => unsafeFromArray(RA.dedupe(toReadonlyArray(self)));
-/**
- * Deduplicates adjacent elements that are identical.
- *
- * @since 2.0.0
- * @category filtering
- */
-exports.dedupe = dedupe;
-const dedupeAdjacent = self => unsafeFromArray(RA.dedupeAdjacent(self));
-/**
- * Takes a `Chunk` of pairs and return two corresponding `Chunk`s.
- *
- * Note: The function is reverse of `zip`.
- *
- * @since 2.0.0
- * @category elements
- */
-exports.dedupeAdjacent = dedupeAdjacent;
-const unzip = self => {
-  const [left, right] = RA.unzip(self);
-  return [unsafeFromArray(left), unsafeFromArray(right)];
-};
-/**
- * Zips this chunk pointwise with the specified chunk using the specified combiner.
- *
- * @since 2.0.0
- * @category zipping
- */
-exports.unzip = unzip;
-const zipWith = exports.zipWith = /*#__PURE__*/(0, _Function.dual)(3, (self, that, f) => unsafeFromArray(RA.zipWith(self, that, f)));
-/**
- * Zips this chunk pointwise with the specified chunk.
- *
- * @since 2.0.0
- * @category zipping
- */
-const zip = exports.zip = /*#__PURE__*/(0, _Function.dual)(2, (self, that) => zipWith(self, that, (a, b) => [a, b]));
-/**
- * Delete the element at the specified index, creating a new `Chunk`,
- * or returning the input if the index is out of bounds.
- *
- * @since 2.0.0
- */
-const remove = exports.remove = /*#__PURE__*/(0, _Function.dual)(2, (self, i) => unsafeFromArray(RA.remove(toReadonlyArray(self), i)));
-/**
- * @since 2.0.0
- */
-const modifyOption = exports.modifyOption = /*#__PURE__*/(0, _Function.dual)(3, (self, i, f) => O.map(RA.modifyOption(toReadonlyArray(self), i, f), unsafeFromArray));
-/**
- * Apply a function to the element at the specified index, creating a new `Chunk`,
- * or returning the input if the index is out of bounds.
- *
- * @since 2.0.0
- */
-const modify = exports.modify = /*#__PURE__*/(0, _Function.dual)(3, (self, i, f) => O.getOrElse(modifyOption(self, i, f), () => self));
-/**
- * Change the element at the specified index, creating a new `Chunk`,
- * or returning the input if the index is out of bounds.
- *
- * @since 2.0.0
- */
-const replace = exports.replace = /*#__PURE__*/(0, _Function.dual)(3, (self, i, b) => modify(self, i, () => b));
-/**
- * @since 2.0.0
- */
-const replaceOption = exports.replaceOption = /*#__PURE__*/(0, _Function.dual)(3, (self, i, b) => modifyOption(self, i, () => b));
-/**
- * Return a Chunk of length n with element i initialized with f(i).
- *
- * **Note**. `n` is normalized to an integer >= 1.
- *
- * @category constructors
- * @since 2.0.0
- */
-const makeBy = exports.makeBy = /*#__PURE__*/(0, _Function.dual)(2, (n, f) => fromIterable(RA.makeBy(n, f)));
-/**
- * Create a non empty `Chunk` containing a range of integers, including both endpoints.
- *
- * @category constructors
- * @since 2.0.0
- */
-const range = (start, end) => start <= end ? makeBy(end - start + 1, i => start + i) : of(start);
-// -------------------------------------------------------------------------------------
-// re-exports from ReadonlyArray
-// -------------------------------------------------------------------------------------
-/**
- * Returns a function that checks if a `Chunk` contains a given value using the default `Equivalence`.
- *
- * @category elements
- * @since 2.0.0
- */
-exports.range = range;
-const contains = exports.contains = RA.contains;
-/**
- * Returns a function that checks if a `Chunk` contains a given value using a provided `isEquivalent` function.
- *
- * @category elements
- * @since 2.0.0
- */
-const containsWith = exports.containsWith = RA.containsWith;
-/**
- * Returns the first element that satisfies the specified
- * predicate, or `None` if no such element exists.
- *
- * @category elements
- * @since 2.0.0
- */
-const findFirst = exports.findFirst = RA.findFirst;
-/**
- * Return the first index for which a predicate holds.
- *
- * @category elements
- * @since 2.0.0
- */
-const findFirstIndex = exports.findFirstIndex = RA.findFirstIndex;
-/**
- * Find the last element for which a predicate holds.
- *
- * @category elements
- * @since 2.0.0
- */
-const findLast = exports.findLast = RA.findLast;
-/**
- * Return the last index for which a predicate holds.
- *
- * @category elements
- * @since 2.0.0
- */
-const findLastIndex = exports.findLastIndex = RA.findLastIndex;
-/**
- * Check if a predicate holds true for every `Chunk` element.
- *
- * @category elements
- * @since 2.0.0
- */
-const every = exports.every = /*#__PURE__*/(0, _Function.dual)(2, (self, refinement) => RA.fromIterable(self).every(refinement));
-/**
- * Check if a predicate holds true for some `Chunk` element.
- *
- * @category elements
- * @since 2.0.0
- */
-const some = exports.some = /*#__PURE__*/(0, _Function.dual)(2, (self, predicate) => RA.fromIterable(self).some(predicate));
-/**
- * Joins the elements together with "sep" in the middle.
- *
- * @category folding
- * @since 2.0.0
- */
-const join = exports.join = RA.join;
-/**
- * @category folding
- * @since 2.0.0
- */
-const reduce = exports.reduce = RA.reduce;
-/**
- * @category folding
- * @since 2.0.0
- */
-const reduceRight = exports.reduceRight = RA.reduceRight;
-//# sourceMappingURL=Chunk.js.map