effect 2.0.0-next.55 → 2.0.0-next.57

package/dist/cjs/ReadonlyArray.js

@@ -3,8 +3,8 @@
 Object.defineProperty(exports, "__esModule", {
   value: true
 });
-exports.rotate = exports.reverseNonEmpty = exports.reverse = exports.replicate = exports.replaceOption = exports.replace = exports.remove = exports.reduceRight = exports.reduce = exports.range = exports.prependAllNonEmpty = exports.prependAll = exports.prepend = exports.partitionMap = exports.partition = exports.of = exports.modifyOption = exports.modifyNonEmptyLast = exports.modifyNonEmptyHead = exports.modify = exports.min = exports.max = exports.matchRight = exports.matchLeft = exports.match = exports.mapAccum = exports.map = exports.makeBy = exports.make = exports.liftPredicate = exports.liftOption = exports.liftNullable = exports.liftEither = exports.length = exports.lastNonEmpty = exports.last = exports.join = exports.isNonEmptyReadonlyArray = exports.isNonEmptyArray = exports.isEmptyReadonlyArray = exports.isEmptyArray = exports.intersperseNonEmpty = exports.intersperse = exports.intersectionWith = exports.intersection = exports.insertAt = exports.initNonEmpty = exports.init = exports.headNonEmpty = exports.head = exports.groupWith = exports.groupBy = exports.group = exports.getOrder = exports.getEquivalence = exports.get = exports.fromRecord = exports.fromOption = exports.fromNullable = exports.fromIterable = exports.forEach = exports.flattenNonEmpty = exports.flatten = exports.flatMapNullable = exports.flatMapNonEmpty = exports.flatMap = exports.findLastIndex = exports.findLast = exports.findFirstIndex = exports.findFirst = exports.filterMapWhile = exports.filterMap = exports.filter = exports.extend = exports.every = exports.empty = exports.dropWhile = exports.dropRight = exports.drop = exports.differenceWith = exports.difference = exports.dedupeWith = exports.dedupeNonEmptyWith = exports.dedupeNonEmpty = exports.dedupeAdjacentWith = exports.dedupeAdjacent = exports.dedupe = exports.copy = exports.containsWith = exports.contains = exports.compact = exports.chunksOfNonEmpty = exports.chunksOf = exports.chopNonEmpty = exports.chop = exports.cartesianWith = exports.cartesian = exports.appendAllNonEmpty = exports.appendAll = exports.append = void 0;
-exports.zipWith = exports.zipNonEmptyWith = exports.zipNonEmpty = exports.zip = exports.unzipNonEmpty = exports.unzip = exports.unsafeGet = exports.unprepend = exports.unionWith = exports.unionNonEmptyWith = exports.unionNonEmpty = exports.union = exports.unfold = exports.unappend = exports.takeWhile = exports.takeRight = exports.take = exports.tailNonEmpty = exports.tail = exports.splitNonEmptyAt = exports.splitAt = exports.span = exports.sortWith = exports.sortNonEmpty = exports.sortByNonEmpty = exports.sortBy = exports.sort = exports.some = exports.setNonEmptyLast = exports.setNonEmptyHead = exports.separate = exports.scanRight = exports.scan = exports.rotateNonEmpty = void 0;
+exports.sortBy = exports.sort = exports.some = exports.setNonEmptyLast = exports.setNonEmptyHead = exports.separate = exports.scanRight = exports.scan = exports.rotate = exports.reverse = exports.replicate = 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.modifyNonEmptyLast = exports.modifyNonEmptyHead = exports.modify = exports.min = exports.max = exports.matchRight = exports.matchLeft = exports.match = exports.mapAccum = exports.map = exports.makeBy = exports.make = exports.liftPredicate = exports.liftOption = exports.liftNullable = exports.liftEither = exports.length = exports.lastNonEmpty = exports.last = exports.join = exports.isNonEmptyReadonlyArray = exports.isNonEmptyArray = exports.isEmptyReadonlyArray = exports.isEmptyArray = exports.intersperse = exports.intersectionWith = exports.intersection = exports.insertAt = exports.initNonEmpty = exports.init = exports.headNonEmpty = exports.head = exports.groupWith = exports.groupBy = exports.group = exports.getSomes = exports.getRights = exports.getOrder = exports.getLefts = exports.getEquivalence = exports.get = exports.fromRecord = exports.fromOption = exports.fromNullable = exports.fromIterable = exports.forEach = exports.flatten = exports.flatMapNullable = exports.flatMap = exports.findLastIndex = exports.findLast = exports.findFirstIndex = exports.findFirst = exports.filterMapWhile = exports.filterMap = exports.filter = exports.extend = exports.every = exports.empty = exports.dropWhile = exports.dropRight = exports.drop = exports.differenceWith = exports.difference = exports.dedupeWith = exports.dedupeAdjacentWith = exports.dedupeAdjacent = exports.dedupe = exports.copy = exports.containsWith = exports.contains = exports.chunksOf = exports.chop = exports.cartesianWith = exports.cartesian = exports.appendAll = exports.append = void 0;
+exports.zipWith = exports.zip = exports.unzip = exports.unsafeGet = exports.unprepend = exports.unionWith = exports.union = exports.unfold = exports.unappend = exports.takeWhile = exports.takeRight = exports.take = exports.tailNonEmpty = exports.tail = exports.splitNonEmptyAt = exports.splitAt = exports.span = exports.sortWith = void 0;
 var E = /*#__PURE__*/_interopRequireWildcard( /*#__PURE__*/require("./Either.js"));
 var Equal = /*#__PURE__*/_interopRequireWildcard( /*#__PURE__*/require("./Equal.js"));
 var Equivalence = /*#__PURE__*/_interopRequireWildcard( /*#__PURE__*/require("./Equivalence.js"));
@@ -13,6 +13,7 @@ var readonlyArray = /*#__PURE__*/_interopRequireWildcard( /*#__PURE__*/require("
 var O = /*#__PURE__*/_interopRequireWildcard( /*#__PURE__*/require("./Option.js"));
 var Order = /*#__PURE__*/_interopRequireWildcard( /*#__PURE__*/require("./Order.js"));
 var RR = /*#__PURE__*/_interopRequireWildcard( /*#__PURE__*/require("./ReadonlyRecord.js"));
+var Tuple = /*#__PURE__*/_interopRequireWildcard( /*#__PURE__*/require("./Tuple.js"));
 function _getRequireWildcardCache(e) {
   if ("function" != typeof WeakMap) return null;
   var r = new WeakMap(),
@@ -159,15 +160,21 @@ const matchRight = exports.matchRight = /*#__PURE__*/(0, _Function.dual)(2, (sel
  */
 const prepend = exports.prepend = /*#__PURE__*/(0, _Function.dual)(2, (self, head) => [head, ...self]);
 /**
+ * Prepends the specified prefix array (or iterable) to the beginning of the specified array (or iterable).
+ * If either array is non-empty, the result is also a non-empty array.
+ *
+ * @example
+ * import * as ReadonlyArray from "effect/ReadonlyArray"
+ *
+ * assert.deepStrictEqual(
+ *   ReadonlyArray.prependAll([1, 2], ["a", "b"]),
+ *   ["a", "b", 1, 2]
+ * )
+ *
  * @category concatenating
  * @since 2.0.0
  */
 const prependAll = exports.prependAll = /*#__PURE__*/(0, _Function.dual)(2, (self, that) => fromIterable(that).concat(fromIterable(self)));
-/**
- * @category concatenating
- * @since 2.0.0
- */
-const prependAllNonEmpty = exports.prependAllNonEmpty = /*#__PURE__*/(0, _Function.dual)(2, (self, that) => prependAll(self, that));
 /**
  * Append an element to the end of an `Iterable`, creating a new `NonEmptyArray`.
  *
@@ -176,15 +183,13 @@ const prependAllNonEmpty = exports.prependAllNonEmpty = /*#__PURE__*/(0, _Functi
  */
 const append = exports.append = /*#__PURE__*/(0, _Function.dual)(2, (self, last) => [...self, last]);
 /**
+ * Concatenates two arrays (or iterables), combining their elements.
+ * If either array is non-empty, the result is also a non-empty array.
+ *
  * @category concatenating
  * @since 2.0.0
  */
 const appendAll = exports.appendAll = /*#__PURE__*/(0, _Function.dual)(2, (self, that) => fromIterable(self).concat(fromIterable(that)));
-/**
- * @category concatenating
- * @since 2.0.0
- */
-const appendAllNonEmpty = exports.appendAllNonEmpty = /*#__PURE__*/(0, _Function.dual)(2, (self, that) => appendAll(self, that));
 /**
  * Reduce an `Iterable` from the left, keeping all intermediate results instead of only the final result.
  *
@@ -616,18 +621,13 @@ const remove = exports.remove = /*#__PURE__*/(0, _Function.dual)(2, (self, i) =>
  */
 const reverse = self => Array.from(self).reverse();
 /**
- * @category elements
- * @since 2.0.0
- */
-exports.reverse = reverse;
-const reverseNonEmpty = self => [lastNonEmpty(self), ...self.slice(0, -1).reverse()];
-/**
- * Sort the elements of an `Iterable` in increasing order, creating a new `Array`.
+ * Create a new array with elements sorted in increasing order based on the specified comparator.
+ * If the input is a `NonEmptyReadonlyArray`, the output will also be a `NonEmptyReadonlyArray`.
  *
  * @category sorting
  * @since 2.0.0
  */
-exports.reverseNonEmpty = reverseNonEmpty;
+exports.reverse = reverse;
 const sort = exports.sort = /*#__PURE__*/(0, _Function.dual)(2, (self, O) => {
   const out = Array.from(self);
   out.sort(O);
@@ -638,13 +638,6 @@ const sort = exports.sort = /*#__PURE__*/(0, _Function.dual)(2, (self, O) => {
  * @category elements
  */
 const sortWith = exports.sortWith = /*#__PURE__*/(0, _Function.dual)(3, (self, f, order) => sort(self, Order.mapInput(order, f)));
-/**
- * Sort the elements of a `NonEmptyReadonlyArray` in increasing order, creating a new `NonEmptyArray`.
- *
- * @category sorting
- * @since 2.0.0
- */
-const sortNonEmpty = exports.sortNonEmpty = /*#__PURE__*/(0, _Function.dual)(2, (self, O) => sort(O)(self));
 /**
  * Sort the elements of an `Iterable` in increasing order, where elements are compared
  * using first `orders[0]`, then `orders[1]`, etc...
@@ -652,50 +645,45 @@ const sortNonEmpty = exports.sortNonEmpty = /*#__PURE__*/(0, _Function.dual)(2,
  * @category sorting
  * @since 2.0.0
  */
-const sortBy = (...orders) => self => {
-  const input = fromIterable(self);
-  return isNonEmptyReadonlyArray(input) ? sortByNonEmpty(...orders)(input) : [];
+const sortBy = (...orders) => {
+  const sortByAll = sort(Order.combineAll(orders));
+  return self => {
+    const input = fromIterable(self);
+    if (isNonEmptyReadonlyArray(input)) {
+      return sortByAll(input);
+    }
+    return [];
+  };
 };
-/**
- * @category sorting
- * @since 2.0.0
- */
-exports.sortBy = sortBy;
-const sortByNonEmpty = (...orders) => sortNonEmpty(Order.combineAll(orders));
 /**
  * Takes two `Iterable`s and returns an `Array` of corresponding pairs.
  * If one input `Iterable` is short, excess elements of the
  * longer `Iterable` are discarded.
  *
+ * @category zipping
  * @since 2.0.0
  */
-exports.sortByNonEmpty = sortByNonEmpty;
-const zip = exports.zip = /*#__PURE__*/(0, _Function.dual)(2, (self, that) => zipWith(self, that, (a, b) => [a, b]));
+exports.sortBy = sortBy;
+const zip = exports.zip = /*#__PURE__*/(0, _Function.dual)(2, (self, that) => zipWith(self, that, Tuple.make));
 /**
  * Apply a function to pairs of elements at the same index in two `Iterable`s, collecting the results in a new `Array`. If one
  * input `Iterable` is short, excess elements of the longer `Iterable` are discarded.
  *
+ * @category zipping
  * @since 2.0.0
  */
 const zipWith = exports.zipWith = /*#__PURE__*/(0, _Function.dual)(3, (self, that, f) => {
   const as = fromIterable(self);
   const bs = fromIterable(that);
-  return isNonEmptyReadonlyArray(as) && isNonEmptyReadonlyArray(bs) ? zipNonEmptyWith(bs, f)(as) : [];
-});
-/**
- * @since 2.0.0
- */
-const zipNonEmpty = exports.zipNonEmpty = /*#__PURE__*/(0, _Function.dual)(2, (self, that) => zipNonEmptyWith(self, that, (a, b) => [a, b]));
-/**
- * @since 2.0.0
- */
-const zipNonEmptyWith = exports.zipNonEmptyWith = /*#__PURE__*/(0, _Function.dual)(3, (self, that, f) => {
-  const cs = [f(headNonEmpty(self), headNonEmpty(that))];
-  const len = Math.min(self.length, that.length);
-  for (let i = 1; i < len; i++) {
-    cs[i] = f(self[i], that[i]);
+  if (isNonEmptyReadonlyArray(as) && isNonEmptyReadonlyArray(bs)) {
+    const out = [f(headNonEmpty(as), headNonEmpty(bs))];
+    const len = Math.min(as.length, bs.length);
+    for (let i = 1; i < len; i++) {
+      out[i] = f(as[i], bs[i]);
+    }
+    return out;
   }
-  return cs;
+  return [];
 });
 /**
  * This function is the inverse of `zip`. Takes an `Iterable` of pairs and return two corresponding `Array`s.
@@ -704,46 +692,38 @@ const zipNonEmptyWith = exports.zipNonEmptyWith = /*#__PURE__*/(0, _Function.dua
  */
 const unzip = self => {
   const input = fromIterable(self);
-  return isNonEmptyReadonlyArray(input) ? unzipNonEmpty(input) : [[], []];
-};
-/**
- * @since 2.0.0
- */
-exports.unzip = unzip;
-const unzipNonEmpty = self => {
-  const fa = [self[0][0]];
-  const fb = [self[0][1]];
-  for (let i = 1; i < self.length; i++) {
-    fa[i] = self[i][0];
-    fb[i] = self[i][1];
+  if (isNonEmptyReadonlyArray(input)) {
+    const fa = [input[0][0]];
+    const fb = [input[0][1]];
+    for (let i = 1; i < input.length; i++) {
+      fa[i] = input[i][0];
+      fb[i] = input[i][1];
+    }
+    return [fa, fb];
   }
-  return [fa, fb];
+  return [[], []];
 };
 /**
- * Places an element in between members of an `Iterable`
+ * Places an element in between members of an `Iterable`.
+ * If the input is a non-empty array, the result is also a non-empty array.
  *
  * @since 2.0.0
  */
-exports.unzipNonEmpty = unzipNonEmpty;
+exports.unzip = unzip;
 const intersperse = exports.intersperse = /*#__PURE__*/(0, _Function.dual)(2, (self, middle) => {
   const input = fromIterable(self);
-  return isNonEmptyReadonlyArray(input) ? intersperseNonEmpty(input, middle) : [];
-});
-/**
- * Places an element in between members of a `NonEmptyReadonlyArray`
- *
- * @since 2.0.0
- */
-const intersperseNonEmpty = exports.intersperseNonEmpty = /*#__PURE__*/(0, _Function.dual)(2, (self, middle) => {
-  const out = [headNonEmpty(self)];
-  const tail = tailNonEmpty(self);
-  for (let i = 0; i < tail.length; i++) {
-    if (i < tail.length) {
-      out.push(middle);
+  if (isNonEmptyReadonlyArray(input)) {
+    const out = [headNonEmpty(input)];
+    const tail = tailNonEmpty(input);
+    for (let i = 0; i < tail.length; i++) {
+      if (i < tail.length) {
+        out.push(middle);
+      }
+      out.push(tail[i]);
     }
-    out.push(tail[i]);
+    return out;
   }
-  return out;
+  return [];
 });
 /**
  * Apply a function to the head, creating a new `NonEmptyReadonlyArray`.
@@ -771,30 +751,26 @@ const modifyNonEmptyLast = exports.modifyNonEmptyLast = /*#__PURE__*/(0, _Functi
 const setNonEmptyLast = exports.setNonEmptyLast = /*#__PURE__*/(0, _Function.dual)(2, (self, b) => modifyNonEmptyLast(self, () => b));
 /**
  * Rotate an `Iterable` by `n` steps.
+ * If the input is a non-empty array, the result is also a non-empty array.
  *
  * @since 2.0.0
  */
 const rotate = exports.rotate = /*#__PURE__*/(0, _Function.dual)(2, (self, n) => {
   const input = fromIterable(self);
-  return isNonEmptyReadonlyArray(input) ? rotateNonEmpty(input, n) : [];
-});
-/**
- * Rotate a `NonEmptyReadonlyArray` by `n` steps.
- *
- * @since 2.0.0
- */
-const rotateNonEmpty = exports.rotateNonEmpty = /*#__PURE__*/(0, _Function.dual)(2, (self, n) => {
-  const len = self.length;
-  const m = Math.round(n) % len;
-  if (isOutOfBound(Math.abs(m), self) || m === 0) {
-    return copy(self);
-  }
-  if (m < 0) {
-    const [f, s] = splitNonEmptyAt(self, -m);
-    return appendAllNonEmpty(s, f);
-  } else {
-    return rotateNonEmpty(self, m - len);
+  if (isNonEmptyReadonlyArray(input)) {
+    const len = input.length;
+    const m = Math.round(n) % len;
+    if (isOutOfBound(Math.abs(m), input) || m === 0) {
+      return copy(input);
+    }
+    if (m < 0) {
+      const [f, s] = splitNonEmptyAt(input, -m);
+      return appendAll(s, f);
+    } else {
+      return rotate(self, m - len);
+    }
   }
+  return [];
 });
 /**
  * Returns a function that checks if a `ReadonlyArray` contains a given value using a provided `isEquivalent` function.
@@ -819,27 +795,6 @@ const _equivalence = /*#__PURE__*/Equal.equivalence();
  * @since 2.0.0
  */
 const contains = exports.contains = /*#__PURE__*/containsWith(_equivalence);
-/**
- * Remove duplicates from a `NonEmptyReadonlyArray`, keeping the first occurrence of an element using the provided `isEquivalent` function.
- *
- * @since 2.0.0
- */
-const dedupeNonEmptyWith = exports.dedupeNonEmptyWith = /*#__PURE__*/(0, _Function.dual)(2, (self, isEquivalent) => {
-  const out = [headNonEmpty(self)];
-  const rest = tailNonEmpty(self);
-  for (const a of rest) {
-    if (out.every(o => !isEquivalent(a, o))) {
-      out.push(a);
-    }
-  }
-  return out;
-});
-/**
- * Remove duplicates from a `NonEmptyReadonlyArray`, keeping the first occurrence of an element.
- *
- * @since 2.0.0
- */
-const dedupeNonEmpty = exports.dedupeNonEmpty = /*#__PURE__*/dedupeNonEmptyWith( /*#__PURE__*/Equal.equivalence());
 /**
  * A useful recursion pattern for processing an `Iterable` to produce a new `Array`, often used for "chopping" up the input
  * `Iterable`. Typically chop is called with some function that will consume an initial prefix of the `Iterable` and produce a
@@ -849,50 +804,52 @@ const dedupeNonEmpty = exports.dedupeNonEmpty = /*#__PURE__*/dedupeNonEmptyWith(
  */
 const chop = exports.chop = /*#__PURE__*/(0, _Function.dual)(2, (self, f) => {
   const input = fromIterable(self);
-  return isNonEmptyReadonlyArray(input) ? chopNonEmpty(input, f) : [];
-});
-/**
- * A useful recursion pattern for processing a `NonEmptyReadonlyArray` to produce a new `NonEmptyReadonlyArray`, often used for "chopping" up the input
- * `NonEmptyReadonlyArray`. Typically `chop` is called with some function that will consume an initial prefix of the `NonEmptyReadonlyArray` and produce a
- * value and the tail of the `NonEmptyReadonlyArray`.
- *
- * @since 2.0.0
- */
-const chopNonEmpty = exports.chopNonEmpty = /*#__PURE__*/(0, _Function.dual)(2, (self, f) => {
-  const [b, rest] = f(self);
-  const out = [b];
-  let next = rest;
-  while (readonlyArray.isNonEmptyArray(next)) {
-    const [b, rest] = f(next);
-    out.push(b);
-    next = rest;
+  if (isNonEmptyReadonlyArray(input)) {
+    const [b, rest] = f(input);
+    const out = [b];
+    let next = rest;
+    while (readonlyArray.isNonEmptyArray(next)) {
+      const [b, rest] = f(next);
+      out.push(b);
+      next = rest;
+    }
+    return out;
   }
-  return out;
+  return [];
 });
 /**
- * Splits an `Iterable` into two pieces, the first piece has max `n` elements.
+ * Splits an `Iterable` into two segments, with the first segment containing a maximum of `n` elements.
+ * The value of `n` can be `0`.
  *
  * @category getters
  * @since 2.0.0
  */
 const splitAt = exports.splitAt = /*#__PURE__*/(0, _Function.dual)(2, (self, n) => {
   const input = Array.from(self);
-  return n >= 1 && isNonEmptyReadonlyArray(input) ? splitNonEmptyAt(input, n) : isEmptyReadonlyArray(input) ? [input, []] : [[], input];
+  const _n = Math.floor(n);
+  if (isNonEmptyReadonlyArray(input)) {
+    if (_n >= 1) {
+      return splitNonEmptyAt(input, _n);
+    }
+    return [[], input];
+  }
+  return [input, []];
 });
 /**
  * @since 2.0.0
  */
 const copy = self => self.slice();
 /**
- * Splits a `NonEmptyReadonlyArray` into two pieces, the first piece has max `n` elements.
+ * Splits a `NonEmptyReadonlyArray` into two segments, with the first segment containing a maximum of `n` elements.
+ * The value of `n` must be `>= 1`.
  *
  * @category getters
  * @since 2.0.0
  */
 exports.copy = copy;
 const splitNonEmptyAt = exports.splitNonEmptyAt = /*#__PURE__*/(0, _Function.dual)(2, (self, n) => {
-  const m = Math.max(1, n);
-  return m >= self.length ? [copy(self), []] : [prepend(self.slice(1, m), headNonEmpty(self)), self.slice(m)];
+  const _n = Math.max(1, Math.floor(n));
+  return _n >= self.length ? [copy(self), []] : [prepend(self.slice(1, _n), headNonEmpty(self)), self.slice(_n)];
 });
 /**
  * Splits an `Iterable` into length-`n` pieces. The last piece will be shorter if `n` does not evenly divide the length of
@@ -910,23 +867,18 @@ const splitNonEmptyAt = exports.splitNonEmptyAt = /*#__PURE__*/(0, _Function.dua
  */
 const chunksOf = exports.chunksOf = /*#__PURE__*/(0, _Function.dual)(2, (self, n) => {
   const input = fromIterable(self);
-  return isNonEmptyReadonlyArray(input) ? chunksOfNonEmpty(input, n) : [];
+  if (isNonEmptyReadonlyArray(input)) {
+    return chop(input, splitNonEmptyAt(n));
+  }
+  return [];
 });
-/**
- * Splits a `NonEmptyReadonlyArray` into length-`n` pieces. The last piece will be shorter if `n` does not evenly divide the length of
- * the `NonEmptyReadonlyArray`.
- *
- * @category getters
- * @since 2.0.0
- */
-const chunksOfNonEmpty = exports.chunksOfNonEmpty = /*#__PURE__*/(0, _Function.dual)(2, (self, n) => chopNonEmpty(self, splitNonEmptyAt(n)));
 /**
  * Group equal, consecutive elements of a `NonEmptyReadonlyArray` into `NonEmptyArray`s using the provided `isEquivalent` function.
  *
  * @category grouping
  * @since 2.0.0
  */
-const groupWith = exports.groupWith = /*#__PURE__*/(0, _Function.dual)(2, (self, isEquivalent) => chopNonEmpty(self, as => {
+const groupWith = exports.groupWith = /*#__PURE__*/(0, _Function.dual)(2, (self, isEquivalent) => chop(self, as => {
   const h = headNonEmpty(as);
   const out = [h];
   let i = 1;
@@ -969,28 +921,22 @@ const groupBy = exports.groupBy = /*#__PURE__*/(0, _Function.dual)(2, (self, f)
 /**
  * @since 2.0.0
  */
-const unionWith = isEquivalent => (0, _Function.dual)(2, (self, that) => {
+const unionWith = exports.unionWith = /*#__PURE__*/(0, _Function.dual)(3, (self, that, isEquivalent) => {
   const a = fromIterable(self);
   const b = fromIterable(that);
-  return isNonEmptyReadonlyArray(a) && isNonEmptyReadonlyArray(b) ? unionNonEmptyWith(isEquivalent)(a, b) : isNonEmptyReadonlyArray(a) ? a : b;
+  if (isNonEmptyReadonlyArray(a)) {
+    if (isNonEmptyReadonlyArray(b)) {
+      const dedupe = dedupeWith(isEquivalent);
+      return dedupe(appendAll(a, b));
+    }
+    return a;
+  }
+  return b;
 });
 /**
  * @since 2.0.0
  */
-exports.unionWith = unionWith;
-const union = exports.union = /*#__PURE__*/unionWith(_equivalence);
-/**
- * @since 2.0.0
- */
-const unionNonEmptyWith = isEquivalent => {
-  const dedupe = dedupeNonEmptyWith(isEquivalent);
-  return (0, _Function.dual)(2, (self, that) => dedupe(appendAllNonEmpty(self, that)));
-};
-/**
- * @since 2.0.0
- */
-exports.unionNonEmptyWith = unionNonEmptyWith;
-const unionNonEmpty = exports.unionNonEmpty = /*#__PURE__*/unionNonEmptyWith(_equivalence);
+const union = exports.union = /*#__PURE__*/(0, _Function.dual)(2, (self, that) => unionWith(self, that, _equivalence));
 /**
  * Creates an `Array` of unique values that are included in all given `Iterable`s using the provided `isEquivalent` function.
  * The order and references of result values are determined by the first `Iterable`.
@@ -1020,7 +966,7 @@ const differenceWith = isEquivalent => {
   return (0, _Function.dual)(2, (self, that) => fromIterable(self).filter(a => !has(that, a)));
 };
 /**
- * Creates a `Array` of values not included in the other given `Iterable` using the provided `isEquivalent` function.
+ * Creates a `Array` of values not included in the other given `Iterable`.
  * The order and references of result values are determined by the first `Iterable`.
  *
  * @since 2.0.0
@@ -1047,6 +993,8 @@ const of = a => [a];
 exports.of = of;
 const map = exports.map = /*#__PURE__*/(0, _Function.dual)(2, (self, f) => self.map(f));
 /**
+ * Applies a function to each element in an array and returns a new array containing the concatenated mapped elements.
+ *
  * @category sequencing
  * @since 2.0.0
  */
@@ -1061,20 +1009,12 @@ const flatMap = exports.flatMap = /*#__PURE__*/(0, _Function.dual)(2, (self, f)
   return out;
 });
 /**
- * @category sequencing
- * @since 2.0.0
- */
-const flatMapNonEmpty = exports.flatMapNonEmpty = flatMap;
-/**
+ * Flattens an array of arrays into a single array by concatenating all arrays.
+ *
  * @category sequencing
  * @since 2.0.0
  */
 const flatten = exports.flatten = /*#__PURE__*/flatMap(_Function.identity);
-/**
- * @category sequencing
- * @since 2.0.0
- */
-const flattenNonEmpty = exports.flattenNonEmpty = /*#__PURE__*/flatMapNonEmpty(_Function.identity);
 /**
  * @category filtering
  * @since 2.0.0
@@ -1127,14 +1067,75 @@ const partitionMap = exports.partitionMap = /*#__PURE__*/(0, _Function.dual)(2,
   return [left, right];
 });
 /**
+ * Retrieves the `Some` values from an `Iterable` of `Option`s, collecting them into an array.
+ *
+ * @example
+ * import { getSomes } from "effect/ReadonlyArray"
+ * import { some, none } from "effect/Option"
+ *
+ * assert.deepStrictEqual(
+ *   getSomes([some(1), none(), some(2)]),
+ *   [1, 2]
+ * )
+ *
+ * @category filtering
+ * @since 2.0.0
+ */
+const getSomes = exports.getSomes = /*#__PURE__*/filterMap(_Function.identity);
+/**
+ * Retrieves the `Left` values from an `Iterable` of `Either`s, collecting them into an array.
+ *
+ * @example
+ * import { getLefts } from "effect/ReadonlyArray"
+ * import { right, left } from "effect/Either"
+ *
+ * assert.deepStrictEqual(
+ *   getLefts([right(1), left("err"), right(2)]),
+ *   ["err"]
+ * )
+ *
+ * @category filtering
+ * @since 2.0.0
+ */
+const getLefts = self => {
+  const out = [];
+  for (const a of self) {
+    if (E.isLeft(a)) {
+      out.push(a.left);
+    }
+  }
+  return out;
+};
+/**
+ * Retrieves the `Right` values from an `Iterable` of `Either`s, collecting them into an array.
+ *
+ * @example
+ * import { getRights } from "effect/ReadonlyArray"
+ * import { right, left } from "effect/Either"
+ *
+ * assert.deepStrictEqual(
+ *   getRights([right(1), left("err"), right(2)]),
+ *   [1, 2]
+ * )
+ *
  * @category filtering
  * @since 2.0.0
  */
-const compact = exports.compact = /*#__PURE__*/filterMap(_Function.identity);
+exports.getLefts = getLefts;
+const getRights = self => {
+  const out = [];
+  for (const a of self) {
+    if (E.isRight(a)) {
+      out.push(a.right);
+    }
+  }
+  return out;
+};
 /**
  * @category filtering
  * @since 2.0.0
  */
+exports.getRights = getRights;
 const filter = exports.filter = /*#__PURE__*/(0, _Function.dual)(2, (self, predicate) => {
   const as = fromIterable(self);
   const out = [];
@@ -1146,6 +1147,8 @@ const filter = exports.filter = /*#__PURE__*/(0, _Function.dual)(2, (self, predi
   return out;
 });
 /**
+ * Separate elements based on a predicate that also exposes the index of the element.
+ *
  * @category filtering
  * @since 2.0.0
  */
@@ -1201,7 +1204,7 @@ const fromNullable = a => a == null ? empty() : [a];
 exports.fromNullable = fromNullable;
 const liftNullable = f => (...a) => fromNullable(f(...a));
 /**
- * @category combining
+ * @category sequencing
  * @since 2.0.0
  */
 exports.liftNullable = liftNullable;
@@ -1279,16 +1282,28 @@ const getEquivalence = exports.getEquivalence = Equivalence.array;
  */
 const forEach = exports.forEach = /*#__PURE__*/(0, _Function.dual)(2, (self, f) => fromIterable(self).forEach((a, i) => f(a, i)));
 /**
- * Remove duplicates from am `Iterable` using the provided `isEquivalent` function, keeping the first occurrence of an element.
+ * Remove duplicates from an `Iterable` using the provided `isEquivalent` function,
+ * preserving the order of the first occurrence of each element.
  *
  * @since 2.0.0
  */
 const dedupeWith = exports.dedupeWith = /*#__PURE__*/(0, _Function.dual)(2, (self, isEquivalent) => {
   const input = fromIterable(self);
-  return isNonEmptyReadonlyArray(input) ? dedupeNonEmptyWith(isEquivalent)(input) : [];
+  if (isNonEmptyReadonlyArray(input)) {
+    const out = [headNonEmpty(input)];
+    const rest = tailNonEmpty(input);
+    for (const r of rest) {
+      if (out.every(a => !isEquivalent(r, a))) {
+        out.push(r);
+      }
+    }
+    return out;
+  }
+  return [];
 });
 /**
- * Remove duplicates from am `Iterable`, keeping the first occurrence of an element.
+ * Remove duplicates from an `Iterable`, preserving the order of the first occurrence of each element.
+ * The equivalence used to compare elements is provided by `Equal.equivalence()` from the `Equal` module.
  *
  * @since 2.0.0
  */