effect 4.0.1 → 4.0.2

package/dist/Array.js

@@ -7,6 +7,7 @@
  * arrays and preserve non-empty array types when the result is guaranteed to
  * contain values.
  *
+ * @stability stable
  * @since 2.0.0
  */
 import * as Equal from "./Equal.js";
@@ -40,6 +41,7 @@ import * as Tuple from "./Tuple.js";
  * Array.Array === globalThis.Array // => true
  * ```
  *
+ * @stability stable
  * @category constructors
  * @since 4.0.0
  */
@@ -67,6 +69,7 @@ export const Array = globalThis.Array;
  * @see {@link of} — create a single-element array
  * @see {@link fromIterable} — create from any iterable
  *
+ * @stability stable
  * @category constructors
  * @since 2.0.0
  */
@@ -93,6 +96,7 @@ export const make = (...elements) => elements;
  *
  * @see {@link makeBy} — create an array by computing each element
  *
+ * @stability stable
  * @category constructors
  * @since 2.0.0
  */
@@ -121,6 +125,7 @@ export const allocate = n => new Array(Count.normalize(n));
  * @see {@link range} — create a range of integers
  * @see {@link replicate} — repeat a single value
  *
+ * @stability stable
  * @category constructors
  * @since 2.0.0
  */
@@ -154,6 +159,7 @@ export const makeBy = /*#__PURE__*/dual(2, (n, f) => {
  *
  * @see {@link makeBy} — generate values from a function
  *
+ * @stability stable
  * @category constructors
  * @since 2.0.0
  */
@@ -181,6 +187,7 @@ export const range = (start, end) => start <= end ? makeBy(end - start + 1, i =>
  *
  * @see {@link makeBy} — vary values based on index
  *
+ * @stability stable
  * @category constructors
  * @since 2.0.0
  */
@@ -209,6 +216,7 @@ export const replicate = /*#__PURE__*/dual(2, (a, n) => makeBy(n, () => a));
  * @see {@link ensure} — wrap a single value or return an existing array
  * @see {@link copy} — create a shallow copy of an array
  *
+ * @stability stable
  * @category constructors
  * @since 2.0.0
  */
@@ -239,6 +247,7 @@ export const fromIterable = collection => Array.isArray(collection) ? collection
  * @see {@link of} — always wrap in a single-element array
  * @see {@link fromIterable} — convert any iterable
  *
+ * @stability stable
  * @category constructors
  * @since 3.3.0
  */
@@ -267,6 +276,7 @@ export const ensure = self => Array.isArray(self) ? self : [self];
  * @see {@link Record.toEntries} the equivalent function from the Record module
  * @see {@link Record.fromEntries} to build a record from an array of tuples
  *
+ * @stability stable
  * @category converting
  * @since 2.0.0
  */
@@ -289,6 +299,7 @@ export const fromRecord = Record.toEntries;
  *
  * @see {@link getSomes} — extract `Some` values from an array of Options
  *
+ * @stability stable
  * @category converting
  * @since 2.0.0
  */
@@ -322,6 +333,7 @@ export const fromOption = Option.toArray;
  * @see {@link matchLeft} — destructures into head + tail
  * @see {@link matchRight} — destructures into init + last
  *
+ * @stability stable
  * @category pattern matching
  * @since 2.0.0
  */
@@ -359,6 +371,7 @@ export const match = /*#__PURE__*/dual(2, (self, {
  * @see {@link match} — receives the full non-empty array
  * @see {@link matchRight} — destructures into init + last
  *
+ * @stability stable
  * @category pattern matching
  * @since 2.0.0
  */
@@ -396,6 +409,7 @@ export const matchLeft = /*#__PURE__*/dual(2, (self, {
  * @see {@link match} — receives the full non-empty array
  * @see {@link matchLeft} — destructures into head + tail
  *
+ * @stability stable
  * @category pattern matching
  * @since 2.0.0
  */
@@ -422,6 +436,7 @@ export const matchRight = /*#__PURE__*/dual(2, (self, {
  * @see {@link append} — add to the end
  * @see {@link prependAll} — prepend multiple elements
  *
+ * @stability stable
  * @category combining
  * @since 2.0.0
  */
@@ -448,6 +463,7 @@ export const prepend = /*#__PURE__*/dual(2, (self, head) => [head, ...self]);
  * @see {@link prepend} — add a single element to the front
  * @see {@link appendAll} — add elements to the end
  *
+ * @stability stable
  * @category combining
  * @since 2.0.0
  */
@@ -471,6 +487,7 @@ export const prependAll = /*#__PURE__*/dual(2, (self, that) => fromIterable(that
  * @see {@link prepend} — add to the front
  * @see {@link appendAll} — append multiple elements
  *
+ * @stability stable
  * @category combining
  * @since 2.0.0
  */
@@ -498,6 +515,7 @@ export const append = /*#__PURE__*/dual(2, (self, last) => [...self, last]);
  * @see {@link append} — add a single element to the end
  * @see {@link prependAll} — add elements to the front
  *
+ * @stability stable
  * @category combining
  * @since 2.0.0
  */
@@ -526,6 +544,7 @@ export const appendAll = /*#__PURE__*/dual(2, (self, that) => fromIterable(self)
  * @see {@link scanRight} — right-to-left scan
  * @see {@link reduce} — fold without intermediate values
  *
+ * @stability stable
  * @category folding
  * @since 2.0.0
  */
@@ -562,6 +581,7 @@ export const scan = /*#__PURE__*/dual(3, (self, b, f) => {
  * @see {@link scan} — left-to-right scan
  * @see {@link reduceRight} — fold without intermediate values
  *
+ * @stability stable
  * @category folding
  * @since 2.0.0
  */
@@ -598,6 +618,7 @@ export const scanRight = /*#__PURE__*/dual(3, (self, b, f) => {
  * @see {@link isArrayEmpty} — check for an empty array
  * @see {@link isArrayNonEmpty} — check for a non-empty array
  *
+ * @stability stable
  * @category guards
  * @since 2.0.0
  */
@@ -617,6 +638,7 @@ export const isArray = Array.isArray;
  * @see {@link isReadonlyArrayEmpty} — readonly variant
  * @see {@link isArrayNonEmpty} — opposite check
  *
+ * @stability stable
  * @category guards
  * @since 4.0.0
  */
@@ -636,6 +658,7 @@ export const isArrayEmpty = self => self.length === 0;
  * @see {@link isArrayEmpty} — mutable variant
  * @see {@link isReadonlyArrayNonEmpty} — opposite check
  *
+ * @stability stable
  * @category guards
  * @since 4.0.0
  */
@@ -661,6 +684,7 @@ export const isReadonlyArrayEmpty = isArrayEmpty;
  * @see {@link isReadonlyArrayNonEmpty} — readonly variant
  * @see {@link isArrayEmpty} — opposite check
  *
+ * @stability stable
  * @category guards
  * @since 4.0.0
  */
@@ -686,6 +710,7 @@ export const isArrayNonEmpty = internalArray.isArrayNonEmpty;
  * @see {@link isArrayNonEmpty} — mutable variant
  * @see {@link isReadonlyArrayEmpty} — opposite check
  *
+ * @stability stable
  * @category guards
  * @since 4.0.0
  */
@@ -705,6 +730,7 @@ export const isReadonlyArrayNonEmpty = internalArray.isArrayNonEmpty;
  * Array.length([1, 2, 3]) // => 3
  * ```
  *
+ * @stability stable
  * @category getters
  * @since 2.0.0
  */
@@ -750,6 +776,7 @@ export function isOutOfBounds(i, as) {
  * @see {@link head} for reading the first element as an `Option`
  * @see {@link last} for reading the last element as an `Option`
  *
+ * @stability stable
  * @category getters
  * @since 2.0.0
  */
@@ -781,6 +808,7 @@ export const get = /*#__PURE__*/dual(2, (self, index) => {
  *
  * @see {@link get} — safe version returning `Option`
  *
+ * @stability stable
  * @category unsafe
  * @since 4.0.0
  */
@@ -815,6 +843,7 @@ export const getUnsafe = /*#__PURE__*/dual(2, (self, index) => {
  * @see {@link headNonEmpty} for getting only the first element
  * @see {@link tailNonEmpty} for getting only the elements after the first
  *
+ * @stability stable
  * @category splitting
  * @since 2.0.0
  */
@@ -844,6 +873,7 @@ export const unprepend = self => [headNonEmpty(self), tailNonEmpty(self)];
  * @see {@link initNonEmpty} for getting only the elements before the last
  * @see {@link lastNonEmpty} for getting only the last element
  *
+ * @stability stable
  * @category splitting
  * @since 2.0.0
  */
@@ -868,6 +898,7 @@ export const unappend = self => [initNonEmpty(self), lastNonEmpty(self)];
  * @see {@link headNonEmpty} — direct access when array is known non-empty
  * @see {@link last} — get the last element
  *
+ * @stability stable
  * @category getters
  * @since 2.0.0
  */
@@ -891,6 +922,7 @@ export const head = /*#__PURE__*/get(0);
  *
  * @see {@link head} — safe version for possibly-empty arrays
  *
+ * @stability stable
  * @category getters
  * @since 2.0.0
  */
@@ -915,6 +947,7 @@ export const headNonEmpty = /*#__PURE__*/getUnsafe(0);
  * @see {@link lastNonEmpty} — direct access when array is known non-empty
  * @see {@link head} — get the first element
  *
+ * @stability stable
  * @category getters
  * @since 2.0.0
  */
@@ -938,6 +971,7 @@ export const last = self => isReadonlyArrayNonEmpty(self) ? Option.some(lastNonE
  *
  * @see {@link last} — safe version for possibly-empty arrays
  *
+ * @stability stable
  * @category getters
  * @since 2.0.0
  */
@@ -965,6 +999,7 @@ export const lastNonEmpty = self => self[self.length - 1];
  * @see {@link tailNonEmpty} — when the array is known non-empty
  * @see {@link init} — all elements except the last
  *
+ * @stability stable
  * @category getters
  * @since 2.0.0
  */
@@ -990,6 +1025,7 @@ export function tail(self) {
  * @see {@link tail} — safe version for possibly-empty arrays
  * @see {@link initNonEmpty} — all elements except the last
  *
+ * @stability stable
  * @category getters
  * @since 2.0.0
  */
@@ -1018,6 +1054,7 @@ export const tailNonEmpty = self => self.slice(1);
  * @see {@link initNonEmpty} — when the array is known non-empty
  * @see {@link tail} — all elements except the first
  *
+ * @stability stable
  * @category getters
  * @since 2.0.0
  */
@@ -1043,6 +1080,7 @@ export function init(self) {
  * @see {@link init} — safe version for possibly-empty arrays
  * @see {@link tailNonEmpty} — all elements except the first
  *
+ * @stability stable
  * @category getters
  * @since 2.0.0
  */
@@ -1072,6 +1110,7 @@ const clampCount = (n, length) => Math.min(Count.normalize(n), length);
  * @see {@link takeWhile} for keeping an initial prefix while a predicate holds
  * @see {@link drop} for removing elements from the start
  *
+ * @stability stable
  * @category getters
  * @since 2.0.0
  */
@@ -1102,6 +1141,7 @@ export const take = /*#__PURE__*/dual(2, (self, n) => {
  * @see {@link take} — keep from the start
  * @see {@link dropRight} — remove from the end
  *
+ * @stability stable
  * @category getters
  * @since 2.0.0
  */
@@ -1136,6 +1176,7 @@ export const takeRight = /*#__PURE__*/dual(2, (self, n) => {
  * @see {@link dropWhile} for removing the matching prefix and keeping the rest
  * @see {@link span} for splitting the matching prefix from the remaining elements
  *
+ * @stability stable
  * @category getters
  * @since 2.0.0
  */
@@ -1167,6 +1208,7 @@ export const takeWhile = /*#__PURE__*/dual(2, (self, predicate) => {
  *
  * @see {@link takeWhile} for taking a prefix based on a boolean predicate
  *
+ * @stability stable
  * @category getters
  * @since 4.0.0
  */
@@ -1220,6 +1262,7 @@ const spanIndex = (self, predicate) => {
  * @see {@link dropWhile} for keeping only the elements after the matching prefix
  * @see {@link splitWhere} for splitting at the first element that satisfies a predicate
  *
+ * @stability stable
  * @category splitting
  * @since 2.0.0
  */
@@ -1252,6 +1295,7 @@ export const span = /*#__PURE__*/dual(2, (self, predicate) => {
  * @see {@link dropWhile} for removing a prefix based on a predicate instead of a fixed count
  * @see {@link take} for keeping a fixed number of elements from the start
  *
+ * @stability stable
  * @category getters
  * @since 2.0.0
  */
@@ -1281,6 +1325,7 @@ export const drop = /*#__PURE__*/dual(2, (self, n) => {
  * @see {@link drop} — remove from the start
  * @see {@link takeRight} — keep from the end
  *
+ * @stability stable
  * @category getters
  * @since 2.0.0
  */
@@ -1310,6 +1355,7 @@ export const dropRight = /*#__PURE__*/dual(2, (self, n) => {
  * @see {@link takeWhile} — keep the matching prefix instead
  * @see {@link drop} — drop a fixed count
  *
+ * @stability stable
  * @category getters
  * @since 2.0.0
  */
@@ -1340,6 +1386,7 @@ export const dropWhile = /*#__PURE__*/dual(2, (self, predicate) => {
  * @see {@link dropWhile} for dropping a prefix with a simple boolean predicate
  * @see {@link takeWhileFilter} for keeping only the matching prefix
  *
+ * @stability stable
  * @category getters
  * @since 4.0.0
  */
@@ -1374,6 +1421,7 @@ export const dropWhileFilter = /*#__PURE__*/dual(2, (self, f) => {
  * @see {@link findLastIndex} — search from the end
  * @see {@link findFirst} — get the element itself
  *
+ * @stability stable
  * @category searching
  * @since 2.0.0
  */
@@ -1406,6 +1454,7 @@ export const findFirstIndex = /*#__PURE__*/dual(2, (self, predicate) => {
  * @see {@link findFirstIndex} — search from the start
  * @see {@link findLast} — get the element itself
  *
+ * @stability stable
  * @category searching
  * @since 2.0.0
  */
@@ -1445,6 +1494,7 @@ export const findLastIndex = /*#__PURE__*/dual(2, (self, predicate) => {
  * @see {@link findFirstIndex} — get the index instead
  * @see {@link findFirstWithIndex} — get both element and index
  *
+ * @stability stable
  * @category searching
  * @since 2.0.0
  */
@@ -1474,6 +1524,7 @@ export const findFirst = moduleIterable.findFirst;
  * @see {@link findFirst} — get only the element
  * @see {@link findFirstIndex} — get only the index
  *
+ * @stability stable
  * @category searching
  * @since 3.17.0
  */
@@ -1518,6 +1569,7 @@ export const findFirstWithIndex = /*#__PURE__*/dual(2, (self, f) => {
  * @see {@link findFirst} — search from the start
  * @see {@link findLastIndex} — get the index instead
  *
+ * @stability stable
  * @category searching
  * @since 2.0.0
  */
@@ -1561,6 +1613,7 @@ export const findLast = /*#__PURE__*/dual(2, (self, f) => {
  * @see {@link replace} — replace an existing element
  * @see {@link modify} — transform an element at an index
  *
+ * @stability stable
  * @category transforming
  * @since 2.0.0
  */
@@ -1596,6 +1649,7 @@ export const insertAt = /*#__PURE__*/dual(3, (self, i, b) => {
  * @see {@link modify} — transform an element with a function
  * @see {@link insertAt} — insert without removing
  *
+ * @stability stable
  * @category transforming
  * @since 2.0.0
  */
@@ -1629,6 +1683,7 @@ export const replace = /*#__PURE__*/dual(3, (self, i, b) => modify(self, i, () =
  * @see {@link modifyHeadNonEmpty} — modify the first element
  * @see {@link modifyLastNonEmpty} — modify the last element
  *
+ * @stability stable
  * @category transforming
  * @since 2.0.0
  */
@@ -1664,6 +1719,7 @@ export const modify = /*#__PURE__*/dual(3, (self, i, f) => {
  * @see {@link insertAt} — insert an element
  * @see {@link filter} — remove elements by predicate
  *
+ * @stability stable
  * @category transforming
  * @since 2.0.0
  */
@@ -1696,6 +1752,7 @@ export const remove = /*#__PURE__*/dual(2, (self, i) => {
  * Array.reverse([1, 2, 3, 4]) // => [4, 3, 2, 1]
  * ```
  *
+ * @stability stable
  * @category transforming
  * @since 2.0.0
  */
@@ -1723,6 +1780,7 @@ export const reverse = self => Array.from(self).reverse();
  * @see {@link sortWith} — sort by a mapping function
  * @see {@link sortBy} — sort by multiple orders
  *
+ * @stability stable
  * @category sorting
  * @since 2.0.0
  */
@@ -1755,6 +1813,7 @@ export const sort = /*#__PURE__*/dual(2, (self, O) => {
  * @see {@link sort} for sorting with an `Order` that compares the elements directly
  * @see {@link sortBy} for sorting with multiple `Order`s applied in sequence
  *
+ * @stability stable
  * @category sorting
  * @since 2.0.0
  */
@@ -1798,6 +1857,7 @@ export const sortWith = /*#__PURE__*/dual(3, (self, f, order) => Array.from(self
  * @see {@link sort} — sort by a single `Order`
  * @see {@link sortWith} — sort by a derived key
  *
+ * @stability stable
  * @category sorting
  * @since 2.0.0
  */
@@ -1834,6 +1894,7 @@ export const sortBy = (...orders) => {
  * @see {@link zipWith} — zip with a combiner function
  * @see {@link unzip} — inverse operation
  *
+ * @stability stable
  * @category zipping
  * @since 2.0.0
  */
@@ -1857,6 +1918,7 @@ export const zip = /*#__PURE__*/dual(2, (self, that) => zipWith(self, that, Tupl
  *
  * @see {@link zip} — zip into tuples
  *
+ * @stability stable
  * @category zipping
  * @since 2.0.0
  */
@@ -1886,6 +1948,7 @@ export const zipWith = /*#__PURE__*/dual(3, (self, that, f) => {
  *
  * @see {@link zip} — combine two arrays into pairs
  *
+ * @stability stable
  * @category zipping
  * @since 2.0.0
  */
@@ -1924,6 +1987,7 @@ export const unzip = self => {
  *
  * @see {@link join} — intersperse and join into a string
  *
+ * @stability stable
  * @category transforming
  * @since 2.0.0
  */
@@ -1961,6 +2025,7 @@ export const intersperse = /*#__PURE__*/dual(2, (self, middle) => {
  * @see {@link setHeadNonEmpty} — replace with a fixed value
  * @see {@link modifyLastNonEmpty} — modify the last element
  *
+ * @stability stable
  * @category transforming
  * @since 4.0.0
  */
@@ -1984,6 +2049,7 @@ export const modifyHeadNonEmpty = /*#__PURE__*/dual(2, (self, f) => [f(headNonEm
  * @see {@link modifyHeadNonEmpty} — transform the head with a function
  * @see {@link setLastNonEmpty} — replace the last element
  *
+ * @stability stable
  * @category transforming
  * @since 4.0.0
  */
@@ -2008,6 +2074,7 @@ export const setHeadNonEmpty = /*#__PURE__*/dual(2, (self, b) => modifyHeadNonEm
  * @see {@link setLastNonEmpty} — replace with a fixed value
  * @see {@link modifyHeadNonEmpty} — modify the first element
  *
+ * @stability stable
  * @category transforming
  * @since 4.0.0
  */
@@ -2031,6 +2098,7 @@ export const modifyLastNonEmpty = /*#__PURE__*/dual(2, (self, f) => append(initN
  * @see {@link modifyLastNonEmpty} — transform the last element with a function
  * @see {@link setHeadNonEmpty} — replace the first element
  *
+ * @stability stable
  * @category transforming
  * @since 4.0.0
  */
@@ -2061,6 +2129,7 @@ export const setLastNonEmpty = /*#__PURE__*/dual(2, (self, b) => modifyLastNonEm
  * @see {@link take} for taking a fixed number of elements from the start
  * @see {@link drop} for dropping a fixed number of elements from the start
  *
+ * @stability stable
  * @category transforming
  * @since 2.0.0
  */
@@ -2101,6 +2170,7 @@ export const rotate = /*#__PURE__*/dual(2, (self, n) => {
  *
  * @see {@link contains} for the `Equal.equivalence()` variant
  *
+ * @stability stable
  * @category predicates
  * @since 2.0.0
  */
@@ -2131,6 +2201,7 @@ export const containsWith = isEquivalent => dual(2, (self, a) => {
  *
  * @see {@link containsWith} — use custom equality
  *
+ * @stability stable
  * @category predicates
  * @since 2.0.0
  */
@@ -2160,6 +2231,7 @@ export const contains = /*#__PURE__*/containsWith(/*#__PURE__*/Equal.asEquivalen
  * @see {@link chunksOf} — split into fixed-size chunks
  * @see {@link splitAt} — split at an index
  *
+ * @stability stable
  * @category splitting
  * @since 2.0.0
  */
@@ -2201,6 +2273,7 @@ export const chop = /*#__PURE__*/dual(2, (self, f) => {
  * @see {@link splitAtNonEmpty} — for non-empty arrays
  * @see {@link splitWhere} — split at a predicate boundary
  *
+ * @stability stable
  * @category splitting
  * @since 2.0.0
  */
@@ -2238,6 +2311,7 @@ export const splitAt = /*#__PURE__*/dual(2, (self, n) => {
  *
  * @see {@link splitAt} — for possibly-empty arrays
  *
+ * @stability stable
  * @category splitting
  * @since 4.0.0
  */
@@ -2267,6 +2341,7 @@ export const splitAtNonEmpty = /*#__PURE__*/dual(2, (self, n) => {
  *
  * @see {@link chunksOf} — split into fixed-size chunks
  *
+ * @stability stable
  * @category splitting
  * @since 2.0.0
  */
@@ -2294,6 +2369,7 @@ export const split = /*#__PURE__*/dual(2, (self, n) => {
  * @see {@link span} — splits at the first element that fails the predicate
  * @see {@link splitAt} — split at a fixed index
  *
+ * @stability stable
  * @category splitting
  * @since 2.0.0
  */
@@ -2325,6 +2401,7 @@ export const splitWhere = /*#__PURE__*/dual(2, (self, predicate) => span(self, (
  *
  * @see {@link fromIterable} — returns the same reference for arrays
  *
+ * @stability stable
  * @category transforming
  * @since 2.0.0
  */
@@ -2353,6 +2430,7 @@ export const copy = self => self.slice();
  * @see {@link take} — truncate without padding
  * @see {@link replicate} — create an array of a single repeated value
  *
+ * @stability stable
  * @category transforming
  * @since 3.8.4
  */
@@ -2390,6 +2468,7 @@ export const pad = /*#__PURE__*/dual(3, (self, n, fill) => {
  * @see {@link split} — split into a given number of groups
  * @see {@link window} — sliding windows
  *
+ * @stability stable
  * @category splitting
  * @since 2.0.0
  */
@@ -2426,6 +2505,7 @@ export const chunksOf = /*#__PURE__*/dual(2, (self, n) => {
  *
  * @see {@link chunksOf} — non-overlapping chunks
  *
+ * @stability stable
  * @category splitting
  * @since 3.13.2
  */
@@ -2466,6 +2546,7 @@ export const window = /*#__PURE__*/dual(2, (self, n) => {
  * @see {@link group} for grouping adjacent elements with `Equal.equivalence()`
  * @see {@link groupBy} for grouping all elements into a record by key, regardless of adjacency
  *
+ * @stability stable
  * @category grouping
  * @since 2.0.0
  */
@@ -2506,6 +2587,7 @@ export const groupWith = /*#__PURE__*/dual(2, (self, isEquivalent) => chop(self,
  * @see {@link groupWith} — use custom equality
  * @see {@link groupBy} — group by a key function into a record
  *
+ * @stability stable
  * @category grouping
  * @since 2.0.0
  */
@@ -2547,6 +2629,7 @@ export const group = /*#__PURE__*/groupWith(/*#__PURE__*/Equal.asEquivalence());
  * @see {@link group} — group adjacent equal elements
  * @see {@link groupWith} — group adjacent elements by custom equality
  *
+ * @stability stable
  * @category grouping
  * @since 2.0.0
  */
@@ -2618,6 +2701,7 @@ const hashBucketsHas = (buckets, value) => {
  * @see {@link intersectionWith} for keeping elements present in both arrays
  * @see {@link differenceWith} for keeping elements present only in the first array
  *
+ * @stability stable
  * @category set operations
  * @since 2.0.0
  */
@@ -2649,6 +2733,7 @@ export const unionWith = /*#__PURE__*/dual(3, (self, that, isEquivalent) => {
  * @see {@link intersection} — elements in both arrays
  * @see {@link difference} — elements only in the first array
  *
+ * @stability stable
  * @category set operations
  * @since 2.0.0
  */
@@ -2685,6 +2770,7 @@ export const union = /*#__PURE__*/dual(2, (self, that) => {
  * @see {@link unionWith} for keeping values from either array with custom equality
  * @see {@link differenceWith} for keeping values only from the first array with custom equality
  *
+ * @stability stable
  * @category set operations
  * @since 2.0.0
  */
@@ -2716,6 +2802,7 @@ export const intersectionWith = isEquivalent => {
  * @see {@link union} — elements in either array
  * @see {@link difference} — elements only in the first array
  *
+ * @stability stable
  * @category set operations
  * @since 2.0.0
  */
@@ -2749,6 +2836,7 @@ export const intersection = /*#__PURE__*/dual(2, (self, that) => {
  * @see {@link unionWith} for keeping values from either array with custom equality
  * @see {@link intersectionWith} for keeping values present in both arrays with custom equality
  *
+ * @stability stable
  * @category set operations
  * @since 2.0.0
  */
@@ -2780,6 +2868,7 @@ export const differenceWith = isEquivalent => {
  * @see {@link union} — elements in either array
  * @see {@link intersection} — elements in both arrays
  *
+ * @stability stable
  * @category set operations
  * @since 2.0.0
  */
@@ -2813,6 +2902,7 @@ export const difference = /*#__PURE__*/dual(2, (self, that) => {
  * @see {@link of} — create a single-element array
  * @see {@link make} — create from multiple values
  *
+ * @stability stable
  * @category constructors
  * @since 2.0.0
  */
@@ -2831,6 +2921,7 @@ export const empty = () => [];
  * @see {@link make} — create from multiple values
  * @see {@link empty} — create an empty array
  *
+ * @stability stable
  * @category constructors
  * @since 2.0.0
  */
@@ -2857,6 +2948,7 @@ export const of = a => [a];
  *
  * @see {@link flatMap} — map and flatten
  *
+ * @stability stable
  * @category mapping
  * @since 2.0.0
  */
@@ -2885,6 +2977,7 @@ export const map = /*#__PURE__*/dual(2, (self, f) => self.map(f));
  * @see {@link map} — transform without flattening
  * @see {@link flatten} — flatten without mapping
  *
+ * @stability stable
  * @category sequencing
  * @since 2.0.0
  */
@@ -2919,6 +3012,7 @@ export const flatMap = /*#__PURE__*/dual(2, (self, f) => {
  *
  * @see {@link flatMap} — map then flatten in one step
  *
+ * @stability stable
  * @category sequencing
  * @since 2.0.0
  */
@@ -2942,6 +3036,7 @@ export const flatten = /*#__PURE__*/flatMap(identity);
  * @see {@link fromOption} — convert a single Option
  * @see {@link getSuccesses} — extract successes from Results
  *
+ * @stability stable
  * @category filtering
  * @since 2.0.0
  */
@@ -2974,6 +3069,7 @@ export const getSomes = self => {
  * @see {@link getSuccesses} — extract success values
  * @see {@link separate} — split into successes and failures
  *
+ * @stability stable
  * @category filtering
  * @since 4.0.0
  */
@@ -3006,6 +3102,7 @@ export const getFailures = self => {
  * @see {@link getFailures} — extract failure values
  * @see {@link separate} — split into successes and failures
  *
+ * @stability stable
  * @category filtering
  * @since 4.0.0
  */
@@ -3041,6 +3138,7 @@ export const getSuccesses = self => {
  * @see {@link filter} — keep original elements matching a predicate
  * @see {@link partition} for keeping both successes and failures
  *
+ * @stability stable
  * @category filtering
  * @since 2.0.0
  */
@@ -3079,6 +3177,7 @@ export const filterMap = /*#__PURE__*/dual(2, (self, f) => {
  * @see {@link partition} — split into matching and non-matching
  * @see {@link filterMap} for transforming while filtering
  *
+ * @stability stable
  * @category filtering
  * @since 2.0.0
  */
@@ -3118,6 +3217,7 @@ export const filter = /*#__PURE__*/dual(2, (self, predicate) => {
  * @see {@link filterMap} for discarding failures
  * @see {@link separate} — split an iterable of `Result` values
  *
+ * @stability stable
  * @category filtering
  * @since 2.0.0
  */
@@ -3159,6 +3259,7 @@ export const partition = /*#__PURE__*/dual(2, (self, f) => {
  * @see {@link getSuccesses} — extract only successes
  * @see {@link partition} for computing `Result` values while splitting
  *
+ * @stability stable
  * @category filtering
  * @since 2.0.0
  */
@@ -3185,6 +3286,7 @@ export const separate = /*#__PURE__*/partition(identity);
  * @see {@link reduceRight} — fold from right to left
  * @see {@link scan} — fold keeping intermediate values
  *
+ * @stability stable
  * @category folding
  * @since 2.0.0
  */
@@ -3211,6 +3313,7 @@ export const reduce = /*#__PURE__*/dual(3, (self, b, f) => fromIterable(self).re
  * @see {@link reduce} — fold from left to right
  * @see {@link scanRight} — fold keeping intermediate values
  *
+ * @stability stable
  * @category folding
  * @since 2.0.0
  */
@@ -3232,6 +3335,7 @@ export const reduceRight = /*#__PURE__*/dual(3, (self, b, f) => fromIterable(sel
  *
  * @see {@link liftOption} — lift an Option-returning function
  *
+ * @stability stable
  * @category lifting
  * @since 2.0.0
  */
@@ -3262,6 +3366,7 @@ export const liftPredicate = predicate => b => predicate(b) ? [b] : [];
  * @see {@link liftPredicate} — lift a boolean predicate
  * @see {@link liftResult} — lift a Result-returning function
  *
+ * @stability stable
  * @category lifting
  * @since 2.0.0
  */
@@ -3287,6 +3392,7 @@ export const liftOption = f => (...a) => fromOption(f(...a));
  * @see {@link liftNullishOr} — lift a nullable-returning function
  * @see {@link fromOption} — convert from Option
  *
+ * @stability stable
  * @category converting
  * @since 4.0.0
  */
@@ -3312,6 +3418,7 @@ export const fromNullishOr = a => a == null ? empty() : [a];
  * @see {@link fromNullishOr} — convert a single nullable value
  * @see {@link liftOption} — lift an Option-returning function
  *
+ * @stability stable
  * @category lifting
  * @since 4.0.0
  */
@@ -3336,6 +3443,7 @@ export const liftNullishOr = f => (...a) => fromNullishOr(f(...a));
  * @see {@link flatMap} for mapping each element to an array and flattening
  * @see {@link fromNullishOr} for converting a single nullable value to an array
  *
+ * @stability stable
  * @category sequencing
  * @since 4.0.0
  */
@@ -3368,6 +3476,7 @@ export const flatMapNullishOr = /*#__PURE__*/dual(2, (self, f) => flatMap(self,
  * @see {@link liftOption} — lift an Option-returning function
  * @see {@link liftPredicate} — lift a boolean predicate
  *
+ * @stability stable
  * @category lifting
  * @since 4.0.0
  */
@@ -3395,6 +3504,7 @@ export const liftResult = f => (...a) => {
  *
  * @see {@link some} — test if any element matches
  *
+ * @stability stable
  * @category guards
  * @since 2.0.0
  */
@@ -3415,6 +3525,7 @@ export const every = /*#__PURE__*/dual(2, (self, refinement) => self.every(refin
  * @see {@link every} — test if all elements match
  * @see {@link contains} — test for a specific value
  *
+ * @stability stable
  * @category guards
  * @since 2.0.0
  */
@@ -3442,6 +3553,7 @@ export const some = /*#__PURE__*/dual(2, (self, predicate) => self.some(predicat
  *
  * @see {@link scan} for keeping intermediate accumulator values during a fold
  *
+ * @stability stable
  * @category mapping
  * @since 2.0.0
  */
@@ -3461,6 +3573,7 @@ export const extend = /*#__PURE__*/dual(2, (self, f) => self.map((_, i, as) => f
  * @see {@link max} — find the maximum
  * @see {@link sort} — sort the entire array
  *
+ * @stability stable
  * @category getters
  * @since 2.0.0
  */
@@ -3480,6 +3593,7 @@ export const min = /*#__PURE__*/dual(2, (self, O) => self.reduce(Order.min(O)));
  * @see {@link min} — find the minimum
  * @see {@link sort} — sort the entire array
  *
+ * @stability stable
  * @category getters
  * @since 2.0.0
  */
@@ -3500,6 +3614,7 @@ export const max = /*#__PURE__*/dual(2, (self, O) => self.reduce(Order.max(O)));
  * @see {@link makeBy} — generate from index
  * @see {@link range} — generate a numeric range
  *
+ * @stability stable
  * @category constructors
  * @since 2.0.0
  */
@@ -3534,6 +3649,7 @@ export const unfold = (b, f) => {
  *
  * @see {@link makeEquivalence} — create an equivalence for arrays
  *
+ * @stability stable
  * @category instances
  * @since 4.0.0
  */
@@ -3555,6 +3671,7 @@ export const makeOrder = Order.Array;
  *
  * @see {@link makeOrder} — create an ordering for arrays
  *
+ * @stability stable
  * @category instances
  * @since 4.0.0
  */
@@ -3580,6 +3697,7 @@ export const makeEquivalence = Equivalence.Array;
  *
  * @see {@link map} for transforming each element into a new array
  *
+ * @stability stable
  * @category traversing
  * @since 2.0.0
  */
@@ -3604,6 +3722,7 @@ export const forEach = /*#__PURE__*/dual(2, (self, f) => fromIterable(self).forE
  * @see {@link dedupe} — uses default equality
  * @see {@link dedupeAdjacentWith} — only dedupes consecutive elements
  *
+ * @stability stable
  * @category deduplication
  * @since 2.0.0
  */
@@ -3637,6 +3756,7 @@ export const dedupeWith = /*#__PURE__*/dual(2, (self, isEquivalent) => {
  * @see {@link dedupeWith} — use custom equality
  * @see {@link dedupeAdjacent} — only dedupes consecutive elements
  *
+ * @stability stable
  * @category deduplication
  * @since 2.0.0
  */
@@ -3678,6 +3798,7 @@ export const dedupe = self => {
  * @see {@link dedupeAdjacent} — uses default equality
  * @see {@link dedupeWith} — dedupes all duplicates, not just adjacent
  *
+ * @stability stable
  * @category deduplication
  * @since 2.0.0
  */
@@ -3711,6 +3832,7 @@ export const dedupeAdjacentWith = /*#__PURE__*/dual(2, (self, isEquivalent) => {
  * @see {@link dedupeAdjacentWith} — use custom equality
  * @see {@link dedupe} — remove all duplicates
  *
+ * @stability stable
  * @category deduplication
  * @since 2.0.0
  */
@@ -3728,6 +3850,7 @@ export const dedupeAdjacent = /*#__PURE__*/dedupeAdjacentWith(/*#__PURE__*/Equal
  *
  * @see {@link intersperse} — insert separator elements without joining
  *
+ * @stability stable
  * @category folding
  * @since 2.0.0
  */
@@ -3758,6 +3881,7 @@ export const join = /*#__PURE__*/dual(2, (self, sep) => fromIterable(self).join(
  * @see {@link scan} — when you only need the accumulated results (not the final state)
  * @see {@link reduce} — when you only need the final accumulated value
  *
+ * @stability stable
  * @category folding
  * @since 2.0.0
  */
@@ -3797,6 +3921,7 @@ export const mapAccum = /*#__PURE__*/dual(3, (self, s, f) => {
  *
  * @see {@link cartesian} for returning tuples instead of applying a combiner
  *
+ * @stability stable
  * @category combining
  * @since 2.0.0
  */
@@ -3823,6 +3948,7 @@ export const cartesianWith = /*#__PURE__*/dual(3, (self, that, f) => flatMap(sel
  *
  * @see {@link cartesianWith} — apply a combiner to each pair
  *
+ * @stability stable
  * @category combining
  * @since 2.0.0
  */
@@ -3862,6 +3988,7 @@ export const cartesian = /*#__PURE__*/dual(2, (self, that) => cartesianWith(self
  * @see {@link bindTo} — start a pipeline by naming the first array
  * @see {@link let_ let} — introduce a plain computed value
  *
+ * @stability stable
  * @category constructors
  * @since 3.2.0
  */
@@ -3896,6 +4023,7 @@ export const Do = /*#__PURE__*/of({});
  * @see {@link bindTo} — name the first array in a pipeline
  * @see {@link let_ let} — add a plain computed value
  *
+ * @stability stable
  * @category sequencing
  * @since 3.2.0
  */
@@ -3924,6 +4052,7 @@ export const bind = /*#__PURE__*/internalDoNotation.bind(map, flatMap);
  * @see {@link Do} — start with an empty scope
  * @see {@link bind} — add another array variable to the scope
  *
+ * @stability stable
  * @category mapping
  * @since 3.2.0
  */
@@ -3959,32 +4088,42 @@ export {
  * @see {@link Do} — start a do-notation pipeline
  * @see {@link bind} — introduce an array variable (produces cartesian product)
  *
+ * @stability stable
  * @category mapping
  * @since 3.2.0
  */
 let_ as let };
-const reducer = /*#__PURE__*/Reducer.make((a, b) => a.concat(b), []);
+const combineConcat = (a, b) => a.concat(b);
+const combineAllConcat = collection => {
+  let out = [];
+  for (const value of collection) {
+    out = out.concat(value);
+  }
+  return out;
+};
 /**
  * Returns a `Reducer` that combines `ReadonlyArray` values by concatenation.
  *
  * @see {@link makeReducerConcat} — mutable `Array` variant
  *
+ * @stability stable
  * @category folding
  * @since 4.0.0
  */
 export function getReadonlyReducerConcat() {
-  return reducer;
+  return Reducer.make(combineConcat, [], combineAllConcat);
 }
 /**
  * Returns a `Reducer` that combines `Array` values by concatenation.
  *
  * @see {@link getReadonlyReducerConcat} — readonly variant
  *
+ * @stability stable
  * @category folding
  * @since 4.0.0
  */
 export function makeReducerConcat() {
-  return reducer;
+  return Reducer.make(combineConcat, [], combineAllConcat);
 }
 /**
  * Computes the number of elements in an iterable that satisfy a predicate.
@@ -4009,6 +4148,7 @@ export function makeReducerConcat() {
  *
  * @see {@link filter} — when you need the matching elements, not just the count
  *
+ * @stability stable
  * @category folding
  * @since 3.16.0
  */