effect 4.0.0-beta.69 → 4.0.0-beta.70

package/dist/Array.d.ts

@@ -11,6 +11,8 @@ import type { NoInfer, TupleOf } from "./Types.ts";
 /**
  * Reference to the global `Array` constructor.
  *
+ * **When to use**
+ *
  * Use this when you need the native `Array` constructor while the `Array`
  * namespace is in scope (e.g. `Array.Array.isArray`, `Array.Array.from`).
  *
@@ -39,6 +41,8 @@ export interface ReadonlyArrayTypeLambda extends TypeLambda {
 /**
  * A readonly array guaranteed to have at least one element.
  *
+ * **When to use**
+ *
  * Use this type when you need to ensure non-emptiness at the type level while
  * preventing mutation. Many Array module functions accept or return this type.
  *
@@ -61,6 +65,8 @@ export type NonEmptyReadonlyArray<A> = readonly [A, ...Array<A>];
 /**
  * A mutable array guaranteed to have at least one element.
  *
+ * **Details**
+ *
  * This is the mutable counterpart of {@link NonEmptyReadonlyArray}. Most Array
  * module functions return `NonEmptyArray` when the result is guaranteed
  * non-empty.
@@ -84,6 +90,8 @@ export type NonEmptyArray<A> = [A, ...Array<A>];
 /**
  * Creates a `NonEmptyArray` from one or more elements.
  *
+ * **When to use**
+ *
  * - Use when you have literal values and want a typed non-empty array.
  * - The element type is inferred as the union of all arguments.
  * - Always returns a `NonEmptyArray` since at least one argument is required.
@@ -107,6 +115,8 @@ export declare const make: <Elements extends NonEmptyArray<unknown>>(...elements
 /**
  * Creates a new `Array` of the specified length with all slots uninitialized.
  *
+ * **When to use**
+ *
  * - Use when you need a pre-sized array and will fill it imperatively.
  * - Elements are typed as `A | undefined` since slots are empty.
  * - Prefer {@link makeBy} when you can compute each element from its index.
@@ -129,6 +139,8 @@ export declare const allocate: <A = never>(n: number) => Array<A | undefined>;
 /**
  * Creates a `NonEmptyArray` of length `n` where element `i` is computed by `f(i)`.
  *
+ * **When to use**
+ *
  * - Use when you need an array whose values depend on the index.
  * - `n` is normalized to an integer >= 1 — always returns at least one element.
  * - Dual: `Array.makeBy(5, f)` or `pipe(5, Array.makeBy(f))`.
@@ -152,6 +164,8 @@ export declare const makeBy: {
     /**
      * Creates a `NonEmptyArray` of length `n` where element `i` is computed by `f(i)`.
      *
+     * **When to use**
+     *
      * - Use when you need an array whose values depend on the index.
      * - `n` is normalized to an integer >= 1 — always returns at least one element.
      * - Dual: `Array.makeBy(5, f)` or `pipe(5, Array.makeBy(f))`.
@@ -175,6 +189,8 @@ export declare const makeBy: {
     /**
      * Creates a `NonEmptyArray` of length `n` where element `i` is computed by `f(i)`.
      *
+     * **When to use**
+     *
      * - Use when you need an array whose values depend on the index.
      * - `n` is normalized to an integer >= 1 — always returns at least one element.
      * - Dual: `Array.makeBy(5, f)` or `pipe(5, Array.makeBy(f))`.
@@ -200,6 +216,8 @@ export declare const makeBy: {
  * Creates a `NonEmptyArray` containing a range of integers, inclusive on both
  * ends.
  *
+ * **When to use**
+ *
  * - Use when you need a sequence of consecutive integers.
  * - If `start > end`, returns `[start]`.
  * - Always returns a `NonEmptyArray`.
@@ -222,6 +240,8 @@ export declare const range: (start: number, end: number) => NonEmptyArray<number
 /**
  * Creates a `NonEmptyArray` containing a value repeated `n` times.
  *
+ * **When to use**
+ *
  * - Use when you need multiple copies of the same value.
  * - `n` is normalized to an integer >= 1 — always returns at least one element.
  * - Dual: `Array.replicate("a", 3)` or `pipe("a", Array.replicate(3))`.
@@ -244,6 +264,8 @@ export declare const replicate: {
     /**
      * Creates a `NonEmptyArray` containing a value repeated `n` times.
      *
+     * **When to use**
+     *
      * - Use when you need multiple copies of the same value.
      * - `n` is normalized to an integer >= 1 — always returns at least one element.
      * - Dual: `Array.replicate("a", 3)` or `pipe("a", Array.replicate(3))`.
@@ -266,6 +288,8 @@ export declare const replicate: {
     /**
      * Creates a `NonEmptyArray` containing a value repeated `n` times.
      *
+     * **When to use**
+     *
      * - Use when you need multiple copies of the same value.
      * - `n` is normalized to an integer >= 1 — always returns at least one element.
      * - Dual: `Array.replicate("a", 3)` or `pipe("a", Array.replicate(3))`.
@@ -289,6 +313,8 @@ export declare const replicate: {
 /**
  * Converts an `Iterable` to an `Array`.
  *
+ * **Details**
+ *
  * - If the input is already an array, returns it **by reference** (no copy).
  * - Otherwise, creates a new array from the iterable.
  * - Use {@link copy} if you need a fresh array even when the input is already
@@ -313,6 +339,8 @@ export declare const fromIterable: <A>(collection: Iterable<A>) => Array<A>;
 /**
  * Normalizes a value that is either a single element or an array into an array.
  *
+ * **Details**
+ *
  * - If the input is already an array, returns it by reference.
  * - If the input is a single value, wraps it in a one-element array.
  * - Useful for APIs that accept `A | Array<A>`.
@@ -336,6 +364,8 @@ export declare const ensure: <A>(self: ReadonlyArray<A> | A) => Array<A>;
 /**
  * Converts a record into an array of `[key, value]` tuples.
  *
+ * **Details**
+ *
  * - Key order follows `Object.entries` semantics.
  * - Returns an empty array for an empty record.
  *
@@ -373,6 +403,8 @@ export declare const fromOption: <A>(self: Option.Option<A>) => Array<A>;
 /**
  * Pattern-matches on an array, handling empty and non-empty cases separately.
  *
+ * **When to use**
+ *
  * - Use when you need to branch on whether an array has elements.
  * - `onNonEmpty` receives a `NonEmptyReadonlyArray`.
  * - Dual: data-first or data-last.
@@ -400,6 +432,8 @@ export declare const match: {
     /**
      * Pattern-matches on an array, handling empty and non-empty cases separately.
      *
+     * **When to use**
+     *
      * - Use when you need to branch on whether an array has elements.
      * - `onNonEmpty` receives a `NonEmptyReadonlyArray`.
      * - Dual: data-first or data-last.
@@ -430,6 +464,8 @@ export declare const match: {
     /**
      * Pattern-matches on an array, handling empty and non-empty cases separately.
      *
+     * **When to use**
+     *
      * - Use when you need to branch on whether an array has elements.
      * - `onNonEmpty` receives a `NonEmptyReadonlyArray`.
      * - Dual: data-first or data-last.
@@ -462,6 +498,8 @@ export declare const match: {
  * Pattern-matches on an array from the left, providing the first element and
  * the remaining elements separately.
  *
+ * **Details**
+ *
  * - `onNonEmpty` receives `(head, tail)` where `tail` is the rest of the array.
  * - Use when you want to process the first element differently from the rest.
  *
@@ -489,6 +527,8 @@ export declare const matchLeft: {
      * Pattern-matches on an array from the left, providing the first element and
      * the remaining elements separately.
      *
+     * **Details**
+     *
      * - `onNonEmpty` receives `(head, tail)` where `tail` is the rest of the array.
      * - Use when you want to process the first element differently from the rest.
      *
@@ -519,6 +559,8 @@ export declare const matchLeft: {
      * Pattern-matches on an array from the left, providing the first element and
      * the remaining elements separately.
      *
+     * **Details**
+     *
      * - `onNonEmpty` receives `(head, tail)` where `tail` is the rest of the array.
      * - Use when you want to process the first element differently from the rest.
      *
@@ -550,6 +592,8 @@ export declare const matchLeft: {
  * Pattern-matches on an array from the right, providing all elements except the
  * last and the last element separately.
  *
+ * **Details**
+ *
  * - `onNonEmpty` receives `(init, last)` where `init` is everything but the last element.
  * - Use when you want to process the last element differently from the rest.
  *
@@ -577,6 +621,8 @@ export declare const matchRight: {
      * Pattern-matches on an array from the right, providing all elements except the
      * last and the last element separately.
      *
+     * **Details**
+     *
      * - `onNonEmpty` receives `(init, last)` where `init` is everything but the last element.
      * - Use when you want to process the last element differently from the rest.
      *
@@ -607,6 +653,8 @@ export declare const matchRight: {
      * Pattern-matches on an array from the right, providing all elements except the
      * last and the last element separately.
      *
+     * **Details**
+     *
      * - `onNonEmpty` receives `(init, last)` where `init` is everything but the last element.
      * - Use when you want to process the last element differently from the rest.
      *
@@ -637,6 +685,8 @@ export declare const matchRight: {
 /**
  * Adds a single element to the front of an iterable, returning a `NonEmptyArray`.
  *
+ * **Details**
+ *
  * - Always returns a non-empty array.
  * - Does not mutate the input.
  *
@@ -659,6 +709,8 @@ export declare const prepend: {
     /**
      * Adds a single element to the front of an iterable, returning a `NonEmptyArray`.
      *
+     * **Details**
+     *
      * - Always returns a non-empty array.
      * - Does not mutate the input.
      *
@@ -681,6 +733,8 @@ export declare const prepend: {
     /**
      * Adds a single element to the front of an iterable, returning a `NonEmptyArray`.
      *
+     * **Details**
+     *
      * - Always returns a non-empty array.
      * - Does not mutate the input.
      *
@@ -704,6 +758,8 @@ export declare const prepend: {
 /**
  * Prepends all elements from a prefix iterable to the front of an array.
  *
+ * **Details**
+ *
  * - If either input is non-empty, the result is a `NonEmptyArray`.
  * - Does not mutate the input.
  *
@@ -726,6 +782,8 @@ export declare const prependAll: {
     /**
      * Prepends all elements from a prefix iterable to the front of an array.
      *
+     * **Details**
+     *
      * - If either input is non-empty, the result is a `NonEmptyArray`.
      * - Does not mutate the input.
      *
@@ -748,6 +806,8 @@ export declare const prependAll: {
     /**
      * Prepends all elements from a prefix iterable to the front of an array.
      *
+     * **Details**
+     *
      * - If either input is non-empty, the result is a `NonEmptyArray`.
      * - Does not mutate the input.
      *
@@ -770,6 +830,8 @@ export declare const prependAll: {
     /**
      * Prepends all elements from a prefix iterable to the front of an array.
      *
+     * **Details**
+     *
      * - If either input is non-empty, the result is a `NonEmptyArray`.
      * - Does not mutate the input.
      *
@@ -792,6 +854,8 @@ export declare const prependAll: {
     /**
      * Prepends all elements from a prefix iterable to the front of an array.
      *
+     * **Details**
+     *
      * - If either input is non-empty, the result is a `NonEmptyArray`.
      * - Does not mutate the input.
      *
@@ -815,6 +879,8 @@ export declare const prependAll: {
 /**
  * Adds a single element to the end of an iterable, returning a `NonEmptyArray`.
  *
+ * **Details**
+ *
  * - Always returns a non-empty array.
  * - Does not mutate the input.
  *
@@ -837,6 +903,8 @@ export declare const append: {
     /**
      * Adds a single element to the end of an iterable, returning a `NonEmptyArray`.
      *
+     * **Details**
+     *
      * - Always returns a non-empty array.
      * - Does not mutate the input.
      *
@@ -859,6 +927,8 @@ export declare const append: {
     /**
      * Adds a single element to the end of an iterable, returning a `NonEmptyArray`.
      *
+     * **Details**
+     *
      * - Always returns a non-empty array.
      * - Does not mutate the input.
      *
@@ -882,6 +952,8 @@ export declare const append: {
 /**
  * Concatenates two iterables into a single array.
  *
+ * **Details**
+ *
  * - If either input is non-empty, the result is a `NonEmptyArray`.
  * - Does not mutate the inputs.
  *
@@ -904,6 +976,8 @@ export declare const appendAll: {
     /**
      * Concatenates two iterables into a single array.
      *
+     * **Details**
+     *
      * - If either input is non-empty, the result is a `NonEmptyArray`.
      * - Does not mutate the inputs.
      *
@@ -926,6 +1000,8 @@ export declare const appendAll: {
     /**
      * Concatenates two iterables into a single array.
      *
+     * **Details**
+     *
      * - If either input is non-empty, the result is a `NonEmptyArray`.
      * - Does not mutate the inputs.
      *
@@ -948,6 +1024,8 @@ export declare const appendAll: {
     /**
      * Concatenates two iterables into a single array.
      *
+     * **Details**
+     *
      * - If either input is non-empty, the result is a `NonEmptyArray`.
      * - Does not mutate the inputs.
      *
@@ -970,6 +1048,8 @@ export declare const appendAll: {
     /**
      * Concatenates two iterables into a single array.
      *
+     * **Details**
+     *
      * - If either input is non-empty, the result is a `NonEmptyArray`.
      * - Does not mutate the inputs.
      *
@@ -993,6 +1073,8 @@ export declare const appendAll: {
 /**
  * Left-to-right fold that keeps every intermediate accumulator value.
  *
+ * **Details**
+ *
  * - The output length is `input.length + 1` (starts with the initial value).
  * - Always returns a `NonEmptyArray` because the initial value is included.
  * - Use {@link reduce} if you only need the final accumulated value.
@@ -1016,6 +1098,8 @@ export declare const scan: {
     /**
      * Left-to-right fold that keeps every intermediate accumulator value.
      *
+     * **Details**
+     *
      * - The output length is `input.length + 1` (starts with the initial value).
      * - Always returns a `NonEmptyArray` because the initial value is included.
      * - Use {@link reduce} if you only need the final accumulated value.
@@ -1039,6 +1123,8 @@ export declare const scan: {
     /**
      * Left-to-right fold that keeps every intermediate accumulator value.
      *
+     * **Details**
+     *
      * - The output length is `input.length + 1` (starts with the initial value).
      * - Always returns a `NonEmptyArray` because the initial value is included.
      * - Use {@link reduce} if you only need the final accumulated value.
@@ -1063,6 +1149,8 @@ export declare const scan: {
 /**
  * Right-to-left fold that keeps every intermediate accumulator value.
  *
+ * **Details**
+ *
  * - The output length is `input.length + 1` (ends with the initial value).
  * - Always returns a `NonEmptyArray`.
  *
@@ -1085,6 +1173,8 @@ export declare const scanRight: {
     /**
      * Right-to-left fold that keeps every intermediate accumulator value.
      *
+     * **Details**
+     *
      * - The output length is `input.length + 1` (ends with the initial value).
      * - Always returns a `NonEmptyArray`.
      *
@@ -1107,6 +1197,8 @@ export declare const scanRight: {
     /**
      * Right-to-left fold that keeps every intermediate accumulator value.
      *
+     * **Details**
+     *
      * - The output length is `input.length + 1` (ends with the initial value).
      * - Always returns a `NonEmptyArray`.
      *
@@ -1130,6 +1222,8 @@ export declare const scanRight: {
 /**
  * Tests whether a value is an `Array`.
  *
+ * **Details**
+ *
  * - Acts as a type guard narrowing the input to `Array<unknown>`.
  * - Delegates to `globalThis.Array.isArray`.
  *
@@ -1152,6 +1246,8 @@ export declare const isArray: {
     /**
      * Tests whether a value is an `Array`.
      *
+     * **Details**
+     *
      * - Acts as a type guard narrowing the input to `Array<unknown>`.
      * - Delegates to `globalThis.Array.isArray`.
      *
@@ -1174,6 +1270,8 @@ export declare const isArray: {
     /**
      * Tests whether a value is an `Array`.
      *
+     * **Details**
+     *
      * - Acts as a type guard narrowing the input to `Array<unknown>`.
      * - Delegates to `globalThis.Array.isArray`.
      *
@@ -1291,6 +1389,8 @@ export declare const length: <A>(self: ReadonlyArray<A>) => number;
  * Safely reads an element at the given index, returning `Option.some` or
  * `Option.none` if the index is out of bounds.
  *
+ * **Details**
+ *
  * - The index is floored to an integer.
  * - Never throws.
  *
@@ -1315,6 +1415,8 @@ export declare const get: {
      * Safely reads an element at the given index, returning `Option.some` or
      * `Option.none` if the index is out of bounds.
      *
+     * **Details**
+     *
      * - The index is floored to an integer.
      * - Never throws.
      *
@@ -1339,6 +1441,8 @@ export declare const get: {
      * Safely reads an element at the given index, returning `Option.some` or
      * `Option.none` if the index is out of bounds.
      *
+     * **Details**
+     *
      * - The index is floored to an integer.
      * - Never throws.
      *
@@ -1363,6 +1467,8 @@ export declare const get: {
 /**
  * Reads an element at the given index, throwing if the index is out of bounds.
  *
+ * **Details**
+ *
  * - Throws an `Error` with the message `"Index out of bounds: <i>"`.
  * - Prefer {@link get} for safe access.
  *
@@ -1384,6 +1490,8 @@ export declare const getUnsafe: {
     /**
      * Reads an element at the given index, throwing if the index is out of bounds.
      *
+     * **Details**
+     *
      * - Throws an `Error` with the message `"Index out of bounds: <i>"`.
      * - Prefer {@link get} for safe access.
      *
@@ -1405,6 +1513,8 @@ export declare const getUnsafe: {
     /**
      * Reads an element at the given index, throwing if the index is out of bounds.
      *
+     * **Details**
+     *
      * - Throws an `Error` with the message `"Index out of bounds: <i>"`.
      * - Prefer {@link get} for safe access.
      *
@@ -1427,6 +1537,8 @@ export declare const getUnsafe: {
 /**
  * Splits a non-empty array into its first element and the remaining elements.
  *
+ * **Details**
+ *
  * - Returns a tuple `[head, tail]`.
  * - Requires a `NonEmptyReadonlyArray`.
  *
@@ -1451,6 +1563,8 @@ export declare const unprepend: <A>(self: NonEmptyReadonlyArray<A>) => [firstEle
  * Splits a non-empty array into all elements except the last, and the last
  * element.
  *
+ * **Details**
+ *
  * - Returns a tuple `[init, last]`.
  * - Requires a `NonEmptyReadonlyArray`.
  *
@@ -1550,6 +1664,8 @@ export declare const lastNonEmpty: <A>(self: NonEmptyReadonlyArray<A>) => A;
 /**
  * Returns all elements except the first, wrapped in an `Option`.
  *
+ * **Details**
+ *
  * - Allocates a new array via `slice(1)`.
  * - Returns `Option.none()` for empty inputs.
  *
@@ -1590,6 +1706,8 @@ export declare const tailNonEmpty: <A>(self: NonEmptyReadonlyArray<A>) => Array<
 /**
  * Returns all elements except the last, wrapped in an `Option`.
  *
+ * **Details**
+ *
  * - Allocates a new array via `slice(0, -1)`.
  * - Returns `Option.none()` for empty inputs.
  *
@@ -1630,6 +1748,8 @@ export declare const initNonEmpty: <A>(self: NonEmptyReadonlyArray<A>) => Array<
 /**
  * Keeps the first `n` elements, creating a new array.
  *
+ * **Details**
+ *
  * - `n` is clamped to `[0, length]`.
  * - Returns an empty array when `n <= 0`.
  *
@@ -1652,6 +1772,8 @@ export declare const take: {
     /**
      * Keeps the first `n` elements, creating a new array.
      *
+     * **Details**
+     *
      * - `n` is clamped to `[0, length]`.
      * - Returns an empty array when `n <= 0`.
      *
@@ -1674,6 +1796,8 @@ export declare const take: {
     /**
      * Keeps the first `n` elements, creating a new array.
      *
+     * **Details**
+     *
      * - `n` is clamped to `[0, length]`.
      * - Returns an empty array when `n <= 0`.
      *
@@ -1697,6 +1821,8 @@ export declare const take: {
 /**
  * Keeps the last `n` elements, creating a new array.
  *
+ * **Details**
+ *
  * - `n` is clamped to `[0, length]`.
  * - Returns an empty array when `n <= 0`.
  *
@@ -1718,6 +1844,8 @@ export declare const takeRight: {
     /**
      * Keeps the last `n` elements, creating a new array.
      *
+     * **Details**
+     *
      * - `n` is clamped to `[0, length]`.
      * - Returns an empty array when `n <= 0`.
      *
@@ -1739,6 +1867,8 @@ export declare const takeRight: {
     /**
      * Keeps the last `n` elements, creating a new array.
      *
+     * **Details**
+     *
      * - `n` is clamped to `[0, length]`.
      * - Returns an empty array when `n <= 0`.
      *
@@ -1762,6 +1892,8 @@ export declare const takeRight: {
  * Takes elements from the start while the predicate holds, stopping at the
  * first element that fails.
  *
+ * **Details**
+ *
  * - Supports refinements for type narrowing.
  * - The predicate receives `(element, index)`.
  *
@@ -1785,6 +1917,8 @@ export declare const takeWhile: {
      * Takes elements from the start while the predicate holds, stopping at the
      * first element that fails.
      *
+     * **Details**
+     *
      * - Supports refinements for type narrowing.
      * - The predicate receives `(element, index)`.
      *
@@ -1808,6 +1942,8 @@ export declare const takeWhile: {
      * Takes elements from the start while the predicate holds, stopping at the
      * first element that fails.
      *
+     * **Details**
+     *
      * - Supports refinements for type narrowing.
      * - The predicate receives `(element, index)`.
      *
@@ -1831,6 +1967,8 @@ export declare const takeWhile: {
      * Takes elements from the start while the predicate holds, stopping at the
      * first element that fails.
      *
+     * **Details**
+     *
      * - Supports refinements for type narrowing.
      * - The predicate receives `(element, index)`.
      *
@@ -1854,6 +1992,8 @@ export declare const takeWhile: {
      * Takes elements from the start while the predicate holds, stopping at the
      * first element that fails.
      *
+     * **Details**
+     *
      * - Supports refinements for type narrowing.
      * - The predicate receives `(element, index)`.
      *
@@ -1877,6 +2017,8 @@ export declare const takeWhile: {
 /**
  * Takes elements from the start while a `Filter` succeeds, collecting transformed values.
  *
+ * **Details**
+ *
  * - The filter receives `(element, index)`.
  * - Stops at the first filter failure.
  *
@@ -1887,6 +2029,8 @@ export declare const takeWhileFilter: {
     /**
      * Takes elements from the start while a `Filter` succeeds, collecting transformed values.
      *
+     * **Details**
+     *
      * - The filter receives `(element, index)`.
      * - Stops at the first filter failure.
      *
@@ -1897,6 +2041,8 @@ export declare const takeWhileFilter: {
     /**
      * Takes elements from the start while a `Filter` succeeds, collecting transformed values.
      *
+     * **Details**
+     *
      * - The filter receives `(element, index)`.
      * - Stops at the first filter failure.
      *
@@ -1909,6 +2055,8 @@ export declare const takeWhileFilter: {
  * Splits an iterable into two arrays: the longest prefix where the predicate
  * holds, and the remaining elements.
  *
+ * **Details**
+ *
  * - Equivalent to `[takeWhile(pred), dropWhile(pred)]` but more efficient
  *   (single pass).
  * - Supports refinements for type narrowing of the prefix.
@@ -1933,6 +2081,8 @@ export declare const span: {
      * Splits an iterable into two arrays: the longest prefix where the predicate
      * holds, and the remaining elements.
      *
+     * **Details**
+     *
      * - Equivalent to `[takeWhile(pred), dropWhile(pred)]` but more efficient
      *   (single pass).
      * - Supports refinements for type narrowing of the prefix.
@@ -1957,6 +2107,8 @@ export declare const span: {
      * Splits an iterable into two arrays: the longest prefix where the predicate
      * holds, and the remaining elements.
      *
+     * **Details**
+     *
      * - Equivalent to `[takeWhile(pred), dropWhile(pred)]` but more efficient
      *   (single pass).
      * - Supports refinements for type narrowing of the prefix.
@@ -1981,6 +2133,8 @@ export declare const span: {
      * Splits an iterable into two arrays: the longest prefix where the predicate
      * holds, and the remaining elements.
      *
+     * **Details**
+     *
      * - Equivalent to `[takeWhile(pred), dropWhile(pred)]` but more efficient
      *   (single pass).
      * - Supports refinements for type narrowing of the prefix.
@@ -2005,6 +2159,8 @@ export declare const span: {
      * Splits an iterable into two arrays: the longest prefix where the predicate
      * holds, and the remaining elements.
      *
+     * **Details**
+     *
      * - Equivalent to `[takeWhile(pred), dropWhile(pred)]` but more efficient
      *   (single pass).
      * - Supports refinements for type narrowing of the prefix.
@@ -2029,6 +2185,8 @@ export declare const span: {
 /**
  * Removes the first `n` elements, creating a new array.
  *
+ * **Details**
+ *
  * - `n` is clamped to `[0, length]`.
  * - Returns a copy of the full array when `n <= 0`.
  *
@@ -2051,6 +2209,8 @@ export declare const drop: {
     /**
      * Removes the first `n` elements, creating a new array.
      *
+     * **Details**
+     *
      * - `n` is clamped to `[0, length]`.
      * - Returns a copy of the full array when `n <= 0`.
      *
@@ -2073,6 +2233,8 @@ export declare const drop: {
     /**
      * Removes the first `n` elements, creating a new array.
      *
+     * **Details**
+     *
      * - `n` is clamped to `[0, length]`.
      * - Returns a copy of the full array when `n <= 0`.
      *
@@ -2096,6 +2258,8 @@ export declare const drop: {
 /**
  * Removes the last `n` elements, creating a new array.
  *
+ * **Details**
+ *
  * - `n` is clamped to `[0, length]`.
  *
  * **Example** (Dropping from the end)
@@ -2116,6 +2280,8 @@ export declare const dropRight: {
     /**
      * Removes the last `n` elements, creating a new array.
      *
+     * **Details**
+     *
      * - `n` is clamped to `[0, length]`.
      *
      * **Example** (Dropping from the end)
@@ -2136,6 +2302,8 @@ export declare const dropRight: {
     /**
      * Removes the last `n` elements, creating a new array.
      *
+     * **Details**
+     *
      * - `n` is clamped to `[0, length]`.
      *
      * **Example** (Dropping from the end)
@@ -2157,6 +2325,8 @@ export declare const dropRight: {
 /**
  * Drops elements from the start while the predicate holds, returning the rest.
  *
+ * **Details**
+ *
  * - The predicate receives `(element, index)`.
  *
  * **Example** (Dropping while condition holds)
@@ -2177,6 +2347,8 @@ export declare const dropWhile: {
     /**
      * Drops elements from the start while the predicate holds, returning the rest.
      *
+     * **Details**
+     *
      * - The predicate receives `(element, index)`.
      *
      * **Example** (Dropping while condition holds)
@@ -2197,6 +2369,8 @@ export declare const dropWhile: {
     /**
      * Drops elements from the start while the predicate holds, returning the rest.
      *
+     * **Details**
+     *
      * - The predicate receives `(element, index)`.
      *
      * **Example** (Dropping while condition holds)
@@ -2218,6 +2392,8 @@ export declare const dropWhile: {
 /**
  * Drops elements from the start while a `Filter` succeeds.
  *
+ * **Details**
+ *
  * - The filter receives `(element, index)`.
  * - Returns the remaining original elements after the first filter failure.
  *
@@ -2228,6 +2404,8 @@ export declare const dropWhileFilter: {
     /**
      * Drops elements from the start while a `Filter` succeeds.
      *
+     * **Details**
+     *
      * - The filter receives `(element, index)`.
      * - Returns the remaining original elements after the first filter failure.
      *
@@ -2238,6 +2416,8 @@ export declare const dropWhileFilter: {
     /**
      * Drops elements from the start while a `Filter` succeeds.
      *
+     * **Details**
+     *
      * - The filter receives `(element, index)`.
      * - Returns the remaining original elements after the first filter failure.
      *
@@ -2366,6 +2546,8 @@ export declare const findLastIndex: {
  * Returns the first element matching a predicate, refinement, or mapping
  * function, wrapped in `Option`.
  *
+ * **Details**
+ *
  * - Accepts a predicate `(a, i) => boolean`, a refinement, or a function
  *   `(a, i) => Option<B>` for simultaneous find-and-transform.
  * - Returns `Option.none()` if no element matches.
@@ -2390,6 +2572,8 @@ export declare const findFirst: {
      * Returns the first element matching a predicate, refinement, or mapping
      * function, wrapped in `Option`.
      *
+     * **Details**
+     *
      * - Accepts a predicate `(a, i) => boolean`, a refinement, or a function
      *   `(a, i) => Option<B>` for simultaneous find-and-transform.
      * - Returns `Option.none()` if no element matches.
@@ -2414,6 +2598,8 @@ export declare const findFirst: {
      * Returns the first element matching a predicate, refinement, or mapping
      * function, wrapped in `Option`.
      *
+     * **Details**
+     *
      * - Accepts a predicate `(a, i) => boolean`, a refinement, or a function
      *   `(a, i) => Option<B>` for simultaneous find-and-transform.
      * - Returns `Option.none()` if no element matches.
@@ -2438,6 +2624,8 @@ export declare const findFirst: {
      * Returns the first element matching a predicate, refinement, or mapping
      * function, wrapped in `Option`.
      *
+     * **Details**
+     *
      * - Accepts a predicate `(a, i) => boolean`, a refinement, or a function
      *   `(a, i) => Option<B>` for simultaneous find-and-transform.
      * - Returns `Option.none()` if no element matches.
@@ -2462,6 +2650,8 @@ export declare const findFirst: {
      * Returns the first element matching a predicate, refinement, or mapping
      * function, wrapped in `Option`.
      *
+     * **Details**
+     *
      * - Accepts a predicate `(a, i) => boolean`, a refinement, or a function
      *   `(a, i) => Option<B>` for simultaneous find-and-transform.
      * - Returns `Option.none()` if no element matches.
@@ -2486,6 +2676,8 @@ export declare const findFirst: {
      * Returns the first element matching a predicate, refinement, or mapping
      * function, wrapped in `Option`.
      *
+     * **Details**
+     *
      * - Accepts a predicate `(a, i) => boolean`, a refinement, or a function
      *   `(a, i) => Option<B>` for simultaneous find-and-transform.
      * - Returns `Option.none()` if no element matches.
@@ -2510,6 +2702,8 @@ export declare const findFirst: {
      * Returns the first element matching a predicate, refinement, or mapping
      * function, wrapped in `Option`.
      *
+     * **Details**
+     *
      * - Accepts a predicate `(a, i) => boolean`, a refinement, or a function
      *   `(a, i) => Option<B>` for simultaneous find-and-transform.
      * - Returns `Option.none()` if no element matches.
@@ -2535,6 +2729,8 @@ export declare const findFirst: {
  * Returns the first selected value together with its index, wrapped in an
  * `Option`.
  *
+ * **Details**
+ *
  * Accepts a predicate, a refinement, or a function returning `Option`. For an
  * `Option`-returning function, returns `[mappedValue, index]` for the first
  * `Some`, or `Option.none()` if no element is selected.
@@ -2558,6 +2754,8 @@ export declare const findFirstWithIndex: {
      * Returns the first selected value together with its index, wrapped in an
      * `Option`.
      *
+     * **Details**
+     *
      * Accepts a predicate, a refinement, or a function returning `Option`. For an
      * `Option`-returning function, returns `[mappedValue, index]` for the first
      * `Some`, or `Option.none()` if no element is selected.
@@ -2581,6 +2779,8 @@ export declare const findFirstWithIndex: {
      * Returns the first selected value together with its index, wrapped in an
      * `Option`.
      *
+     * **Details**
+     *
      * Accepts a predicate, a refinement, or a function returning `Option`. For an
      * `Option`-returning function, returns `[mappedValue, index]` for the first
      * `Some`, or `Option.none()` if no element is selected.
@@ -2604,6 +2804,8 @@ export declare const findFirstWithIndex: {
      * Returns the first selected value together with its index, wrapped in an
      * `Option`.
      *
+     * **Details**
+     *
      * Accepts a predicate, a refinement, or a function returning `Option`. For an
      * `Option`-returning function, returns `[mappedValue, index]` for the first
      * `Some`, or `Option.none()` if no element is selected.
@@ -2627,6 +2829,8 @@ export declare const findFirstWithIndex: {
      * Returns the first selected value together with its index, wrapped in an
      * `Option`.
      *
+     * **Details**
+     *
      * Accepts a predicate, a refinement, or a function returning `Option`. For an
      * `Option`-returning function, returns `[mappedValue, index]` for the first
      * `Some`, or `Option.none()` if no element is selected.
@@ -2650,6 +2854,8 @@ export declare const findFirstWithIndex: {
      * Returns the first selected value together with its index, wrapped in an
      * `Option`.
      *
+     * **Details**
+     *
      * Accepts a predicate, a refinement, or a function returning `Option`. For an
      * `Option`-returning function, returns `[mappedValue, index]` for the first
      * `Some`, or `Option.none()` if no element is selected.
@@ -2673,6 +2879,8 @@ export declare const findFirstWithIndex: {
      * Returns the first selected value together with its index, wrapped in an
      * `Option`.
      *
+     * **Details**
+     *
      * Accepts a predicate, a refinement, or a function returning `Option`. For an
      * `Option`-returning function, returns `[mappedValue, index]` for the first
      * `Some`, or `Option.none()` if no element is selected.
@@ -2697,6 +2905,8 @@ export declare const findFirstWithIndex: {
  * Returns the last element matching a predicate, refinement, or mapping
  * function, wrapped in `Option`.
  *
+ * **Details**
+ *
  * - Searches from the end of the array.
  * - Returns `Option.none()` if no element matches.
  *
@@ -2719,6 +2929,8 @@ export declare const findLast: {
      * Returns the last element matching a predicate, refinement, or mapping
      * function, wrapped in `Option`.
      *
+     * **Details**
+     *
      * - Searches from the end of the array.
      * - Returns `Option.none()` if no element matches.
      *
@@ -2741,6 +2953,8 @@ export declare const findLast: {
      * Returns the last element matching a predicate, refinement, or mapping
      * function, wrapped in `Option`.
      *
+     * **Details**
+     *
      * - Searches from the end of the array.
      * - Returns `Option.none()` if no element matches.
      *
@@ -2763,6 +2977,8 @@ export declare const findLast: {
      * Returns the last element matching a predicate, refinement, or mapping
      * function, wrapped in `Option`.
      *
+     * **Details**
+     *
      * - Searches from the end of the array.
      * - Returns `Option.none()` if no element matches.
      *
@@ -2785,6 +3001,8 @@ export declare const findLast: {
      * Returns the last element matching a predicate, refinement, or mapping
      * function, wrapped in `Option`.
      *
+     * **Details**
+     *
      * - Searches from the end of the array.
      * - Returns `Option.none()` if no element matches.
      *
@@ -2807,6 +3025,8 @@ export declare const findLast: {
      * Returns the last element matching a predicate, refinement, or mapping
      * function, wrapped in `Option`.
      *
+     * **Details**
+     *
      * - Searches from the end of the array.
      * - Returns `Option.none()` if no element matches.
      *
@@ -2829,6 +3049,8 @@ export declare const findLast: {
      * Returns the last element matching a predicate, refinement, or mapping
      * function, wrapped in `Option`.
      *
+     * **Details**
+     *
      * - Searches from the end of the array.
      * - Returns `Option.none()` if no element matches.
      *
@@ -2852,6 +3074,8 @@ export declare const findLast: {
  * Inserts an element at the specified index, returning a new `NonEmptyArray`
  * wrapped in an `Option`.
  *
+ * **Details**
+ *
  * - Valid indices: `0` to `length` (inclusive — inserting at `length` appends).
  * - Does not mutate the input.
  *
@@ -2874,6 +3098,8 @@ export declare const insertAt: {
      * Inserts an element at the specified index, returning a new `NonEmptyArray`
      * wrapped in an `Option`.
      *
+     * **Details**
+     *
      * - Valid indices: `0` to `length` (inclusive — inserting at `length` appends).
      * - Does not mutate the input.
      *
@@ -2896,6 +3122,8 @@ export declare const insertAt: {
      * Inserts an element at the specified index, returning a new `NonEmptyArray`
      * wrapped in an `Option`.
      *
+     * **Details**
+     *
      * - Valid indices: `0` to `length` (inclusive — inserting at `length` appends).
      * - Does not mutate the input.
      *
@@ -2919,6 +3147,8 @@ export declare const insertAt: {
  * Replaces the element at the specified index with a new value, returning the
  * updated array in `Option.some`.
  *
+ * **Details**
+ *
  * - Returns `Option.none()` when the index is out of bounds.
  * - Does not mutate the input.
  *
@@ -2941,6 +3171,8 @@ export declare const replace: {
      * Replaces the element at the specified index with a new value, returning the
      * updated array in `Option.some`.
      *
+     * **Details**
+     *
      * - Returns `Option.none()` when the index is out of bounds.
      * - Does not mutate the input.
      *
@@ -2963,6 +3195,8 @@ export declare const replace: {
      * Replaces the element at the specified index with a new value, returning the
      * updated array in `Option.some`.
      *
+     * **Details**
+     *
      * - Returns `Option.none()` when the index is out of bounds.
      * - Does not mutate the input.
      *
@@ -2986,6 +3220,8 @@ export declare const replace: {
  * Applies a function to the element at the specified index, returning the
  * updated array in `Option.some`.
  *
+ * **Details**
+ *
  * - Returns `Option.none()` when the index is out of bounds.
  * - Does not mutate the input.
  *
@@ -3010,6 +3246,8 @@ export declare const modify: {
      * Applies a function to the element at the specified index, returning the
      * updated array in `Option.some`.
      *
+     * **Details**
+     *
      * - Returns `Option.none()` when the index is out of bounds.
      * - Does not mutate the input.
      *
@@ -3034,6 +3272,8 @@ export declare const modify: {
      * Applies a function to the element at the specified index, returning the
      * updated array in `Option.some`.
      *
+     * **Details**
+     *
      * - Returns `Option.none()` when the index is out of bounds.
      * - Does not mutate the input.
      *
@@ -3059,6 +3299,8 @@ export declare const modify: {
  * Removes the element at the specified index, returning a new array. If the
  * index is out of bounds, returns a copy of the original.
  *
+ * **Details**
+ *
  * - Does not mutate the input.
  *
  * **Example** (Removing an element)
@@ -3081,6 +3323,8 @@ export declare const remove: {
      * Removes the element at the specified index, returning a new array. If the
      * index is out of bounds, returns a copy of the original.
      *
+     * **Details**
+     *
      * - Does not mutate the input.
      *
      * **Example** (Removing an element)
@@ -3103,6 +3347,8 @@ export declare const remove: {
      * Removes the element at the specified index, returning a new array. If the
      * index is out of bounds, returns a copy of the original.
      *
+     * **Details**
+     *
      * - Does not mutate the input.
      *
      * **Example** (Removing an element)
@@ -3125,6 +3371,8 @@ export declare const remove: {
 /**
  * Reverses an iterable into a new array.
  *
+ * **Details**
+ *
  * - Does not mutate the input.
  * - Preserves `NonEmptyArray` in the return type.
  *
@@ -3143,6 +3391,8 @@ export declare const reverse: <S extends Iterable<any>>(self: S) => S extends No
 /**
  * Sorts an array by the given `Order`, returning a new array.
  *
+ * **Details**
+ *
  * - Does not mutate the input.
  * - Preserves `NonEmptyArray` in the return type.
  * - Use {@link sortWith} to sort by a derived key, or {@link sortBy} for
@@ -3166,6 +3416,8 @@ export declare const sort: {
     /**
      * Sorts an array by the given `Order`, returning a new array.
      *
+     * **Details**
+     *
      * - Does not mutate the input.
      * - Preserves `NonEmptyArray` in the return type.
      * - Use {@link sortWith} to sort by a derived key, or {@link sortBy} for
@@ -3189,6 +3441,8 @@ export declare const sort: {
     /**
      * Sorts an array by the given `Order`, returning a new array.
      *
+     * **Details**
+     *
      * - Does not mutate the input.
      * - Preserves `NonEmptyArray` in the return type.
      * - Use {@link sortWith} to sort by a derived key, or {@link sortBy} for
@@ -3212,6 +3466,8 @@ export declare const sort: {
     /**
      * Sorts an array by the given `Order`, returning a new array.
      *
+     * **Details**
+     *
      * - Does not mutate the input.
      * - Preserves `NonEmptyArray` in the return type.
      * - Use {@link sortWith} to sort by a derived key, or {@link sortBy} for
@@ -3237,6 +3493,8 @@ export declare const sort: {
  * Sorts an array by a derived key using a mapping function and an `Order` for
  * that key.
  *
+ * **Details**
+ *
  * - Equivalent to `sort(Order.mapInput(order, f))` but more convenient.
  * - Does not mutate the input.
  *
@@ -3260,6 +3518,8 @@ export declare const sortWith: {
      * Sorts an array by a derived key using a mapping function and an `Order` for
      * that key.
      *
+     * **Details**
+     *
      * - Equivalent to `sort(Order.mapInput(order, f))` but more convenient.
      * - Does not mutate the input.
      *
@@ -3283,6 +3543,8 @@ export declare const sortWith: {
      * Sorts an array by a derived key using a mapping function and an `Order` for
      * that key.
      *
+     * **Details**
+     *
      * - Equivalent to `sort(Order.mapInput(order, f))` but more convenient.
      * - Does not mutate the input.
      *
@@ -3306,6 +3568,8 @@ export declare const sortWith: {
      * Sorts an array by a derived key using a mapping function and an `Order` for
      * that key.
      *
+     * **Details**
+     *
      * - Equivalent to `sort(Order.mapInput(order, f))` but more convenient.
      * - Does not mutate the input.
      *
@@ -3330,6 +3594,8 @@ export declare const sortWith: {
  * Sorts an array by multiple `Order`s applied in sequence: the first order is
  * used first; ties are broken by the second order, and so on.
  *
+ * **Details**
+ *
  * - Data-last only (returns a function).
  * - Preserves `NonEmptyArray` in the return type.
  *
@@ -3366,6 +3632,8 @@ export declare const sortBy: <S extends Iterable<any>>(...orders: ReadonlyArray<
  * Pairs elements from two iterables by position. If the iterables differ in
  * length, the extra elements from the longer one are discarded.
  *
+ * **Details**
+ *
  * - Returns `NonEmptyArray` when both inputs are non-empty.
  *
  * **Example** (Zipping two arrays)
@@ -3387,6 +3655,8 @@ export declare const zip: {
      * Pairs elements from two iterables by position. If the iterables differ in
      * length, the extra elements from the longer one are discarded.
      *
+     * **Details**
+     *
      * - Returns `NonEmptyArray` when both inputs are non-empty.
      *
      * **Example** (Zipping two arrays)
@@ -3408,6 +3678,8 @@ export declare const zip: {
      * Pairs elements from two iterables by position. If the iterables differ in
      * length, the extra elements from the longer one are discarded.
      *
+     * **Details**
+     *
      * - Returns `NonEmptyArray` when both inputs are non-empty.
      *
      * **Example** (Zipping two arrays)
@@ -3429,6 +3701,8 @@ export declare const zip: {
      * Pairs elements from two iterables by position. If the iterables differ in
      * length, the extra elements from the longer one are discarded.
      *
+     * **Details**
+     *
      * - Returns `NonEmptyArray` when both inputs are non-empty.
      *
      * **Example** (Zipping two arrays)
@@ -3450,6 +3724,8 @@ export declare const zip: {
      * Pairs elements from two iterables by position. If the iterables differ in
      * length, the extra elements from the longer one are discarded.
      *
+     * **Details**
+     *
      * - Returns `NonEmptyArray` when both inputs are non-empty.
      *
      * **Example** (Zipping two arrays)
@@ -3579,6 +3855,8 @@ export declare const unzip: <S extends Iterable<readonly [any, any]>>(self: S) =
 /**
  * Places a separator element between every pair of elements.
  *
+ * **Details**
+ *
  * - Preserves `NonEmptyArray` in the return type.
  * - An empty input produces an empty result.
  *
@@ -3599,6 +3877,8 @@ export declare const intersperse: {
     /**
      * Places a separator element between every pair of elements.
      *
+     * **Details**
+     *
      * - Preserves `NonEmptyArray` in the return type.
      * - An empty input produces an empty result.
      *
@@ -3619,6 +3899,8 @@ export declare const intersperse: {
     /**
      * Places a separator element between every pair of elements.
      *
+     * **Details**
+     *
      * - Preserves `NonEmptyArray` in the return type.
      * - An empty input produces an empty result.
      *
@@ -3639,6 +3921,8 @@ export declare const intersperse: {
     /**
      * Places a separator element between every pair of elements.
      *
+     * **Details**
+     *
      * - Preserves `NonEmptyArray` in the return type.
      * - An empty input produces an empty result.
      *
@@ -3887,6 +4171,8 @@ export declare const setLastNonEmpty: {
  * Rotates an array by `n` steps. Positive `n` rotates right; negative `n`
  * rotates left.
  *
+ * **Details**
+ *
  * - `n` is rounded to the nearest integer before rotating.
  * - Preserves `NonEmptyArray` in the return type.
  * - Returns a copy for empty arrays or when the normalized rotation is `0`.
@@ -3907,6 +4193,8 @@ export declare const rotate: {
      * Rotates an array by `n` steps. Positive `n` rotates right; negative `n`
      * rotates left.
      *
+     * **Details**
+     *
      * - `n` is rounded to the nearest integer before rotating.
      * - Preserves `NonEmptyArray` in the return type.
      * - Returns a copy for empty arrays or when the normalized rotation is `0`.
@@ -3927,6 +4215,8 @@ export declare const rotate: {
      * Rotates an array by `n` steps. Positive `n` rotates right; negative `n`
      * rotates left.
      *
+     * **Details**
+     *
      * - `n` is rounded to the nearest integer before rotating.
      * - Preserves `NonEmptyArray` in the return type.
      * - Returns a copy for empty arrays or when the normalized rotation is `0`.
@@ -3947,6 +4237,8 @@ export declare const rotate: {
      * Rotates an array by `n` steps. Positive `n` rotates right; negative `n`
      * rotates left.
      *
+     * **Details**
+     *
      * - `n` is rounded to the nearest integer before rotating.
      * - Preserves `NonEmptyArray` in the return type.
      * - Returns a copy for empty arrays or when the normalized rotation is `0`.
@@ -4044,6 +4336,8 @@ export declare const contains: {
  * Repeatedly applies a function that consumes a prefix of the array and
  * produces a value plus the remaining elements, collecting the values.
  *
+ * **Details**
+ *
  * - The function receives a `NonEmptyReadonlyArray` and returns
  *   `[value, rest]`.
  * - Continues until the remaining array is empty.
@@ -4072,6 +4366,8 @@ export declare const chop: {
      * Repeatedly applies a function that consumes a prefix of the array and
      * produces a value plus the remaining elements, collecting the values.
      *
+     * **Details**
+     *
      * - The function receives a `NonEmptyReadonlyArray` and returns
      *   `[value, rest]`.
      * - Continues until the remaining array is empty.
@@ -4100,6 +4396,8 @@ export declare const chop: {
      * Repeatedly applies a function that consumes a prefix of the array and
      * produces a value plus the remaining elements, collecting the values.
      *
+     * **Details**
+     *
      * - The function receives a `NonEmptyReadonlyArray` and returns
      *   `[value, rest]`.
      * - Continues until the remaining array is empty.
@@ -4128,6 +4426,8 @@ export declare const chop: {
      * Repeatedly applies a function that consumes a prefix of the array and
      * produces a value plus the remaining elements, collecting the values.
      *
+     * **Details**
+     *
      * - The function receives a `NonEmptyReadonlyArray` and returns
      *   `[value, rest]`.
      * - Continues until the remaining array is empty.
@@ -4156,6 +4456,8 @@ export declare const chop: {
 /**
  * Splits an iterable into two arrays at the given index.
  *
+ * **Details**
+ *
  * - `n` can be `0` (all elements in the second array).
  * - `n` is floored to an integer.
  *
@@ -4177,6 +4479,8 @@ export declare const splitAt: {
     /**
      * Splits an iterable into two arrays at the given index.
      *
+     * **Details**
+     *
      * - `n` can be `0` (all elements in the second array).
      * - `n` is floored to an integer.
      *
@@ -4198,6 +4502,8 @@ export declare const splitAt: {
     /**
      * Splits an iterable into two arrays at the given index.
      *
+     * **Details**
+     *
      * - `n` can be `0` (all elements in the second array).
      * - `n` is floored to an integer.
      *
@@ -4278,6 +4584,8 @@ export declare const splitAtNonEmpty: {
 /**
  * Splits an iterable into `n` roughly equal-sized chunks.
  *
+ * **Details**
+ *
  * - Uses `chunksOf(ceil(length / n))` internally.
  * - The last chunk may be shorter.
  *
@@ -4298,6 +4606,8 @@ export declare const split: {
     /**
      * Splits an iterable into `n` roughly equal-sized chunks.
      *
+     * **Details**
+     *
      * - Uses `chunksOf(ceil(length / n))` internally.
      * - The last chunk may be shorter.
      *
@@ -4318,6 +4628,8 @@ export declare const split: {
     /**
      * Splits an iterable into `n` roughly equal-sized chunks.
      *
+     * **Details**
+     *
      * - Uses `chunksOf(ceil(length / n))` internally.
      * - The last chunk may be shorter.
      *
@@ -4397,6 +4709,8 @@ export declare const splitWhere: {
 /**
  * Creates a shallow copy of an array.
  *
+ * **Details**
+ *
  * - Preserves `NonEmptyArray` in the return type.
  * - Useful when you need a distinct reference (e.g. before mutating).
  *
@@ -4420,6 +4734,8 @@ export declare const copy: {
     /**
      * Creates a shallow copy of an array.
      *
+     * **Details**
+     *
      * - Preserves `NonEmptyArray` in the return type.
      * - Useful when you need a distinct reference (e.g. before mutating).
      *
@@ -4443,6 +4759,8 @@ export declare const copy: {
     /**
      * Creates a shallow copy of an array.
      *
+     * **Details**
+     *
      * - Preserves `NonEmptyArray` in the return type.
      * - Useful when you need a distinct reference (e.g. before mutating).
      *
@@ -4468,6 +4786,8 @@ export declare const copy: {
  * Pads or truncates an array to exactly `n` elements, filling with `fill`
  * if the array is shorter, or slicing if longer.
  *
+ * **Details**
+ *
  * - Returns an empty array when `n <= 0`.
  *
  * **Example** (Padding an array)
@@ -4489,6 +4809,8 @@ export declare const pad: {
      * Pads or truncates an array to exactly `n` elements, filling with `fill`
      * if the array is shorter, or slicing if longer.
      *
+     * **Details**
+     *
      * - Returns an empty array when `n <= 0`.
      *
      * **Example** (Padding an array)
@@ -4510,6 +4832,8 @@ export declare const pad: {
      * Pads or truncates an array to exactly `n` elements, filling with `fill`
      * if the array is shorter, or slicing if longer.
      *
+     * **Details**
+     *
      * - Returns an empty array when `n <= 0`.
      *
      * **Example** (Padding an array)
@@ -4532,6 +4856,8 @@ export declare const pad: {
  * Splits an iterable into chunks of length `n`. The last chunk may be shorter
  * if `n` does not evenly divide the length.
  *
+ * **Details**
+ *
  * - `chunksOf(n)([])` is `[]`, not `[[]]`.
  * - Each chunk is a `NonEmptyArray`.
  * - Preserves `NonEmptyArray` in the outer return type.
@@ -4555,6 +4881,8 @@ export declare const chunksOf: {
      * Splits an iterable into chunks of length `n`. The last chunk may be shorter
      * if `n` does not evenly divide the length.
      *
+     * **Details**
+     *
      * - `chunksOf(n)([])` is `[]`, not `[[]]`.
      * - Each chunk is a `NonEmptyArray`.
      * - Preserves `NonEmptyArray` in the outer return type.
@@ -4578,6 +4906,8 @@ export declare const chunksOf: {
      * Splits an iterable into chunks of length `n`. The last chunk may be shorter
      * if `n` does not evenly divide the length.
      *
+     * **Details**
+     *
      * - `chunksOf(n)([])` is `[]`, not `[[]]`.
      * - Each chunk is a `NonEmptyArray`.
      * - Preserves `NonEmptyArray` in the outer return type.
@@ -4601,6 +4931,8 @@ export declare const chunksOf: {
      * Splits an iterable into chunks of length `n`. The last chunk may be shorter
      * if `n` does not evenly divide the length.
      *
+     * **Details**
+     *
      * - `chunksOf(n)([])` is `[]`, not `[[]]`.
      * - Each chunk is a `NonEmptyArray`.
      * - Preserves `NonEmptyArray` in the outer return type.
@@ -4624,6 +4956,8 @@ export declare const chunksOf: {
 /**
  * Creates overlapping sliding windows of size `n`.
  *
+ * **Details**
+ *
  * - Returns an empty array if `n <= 0` or the array has fewer than `n` elements.
  * - Each window is a tuple of exactly `n` elements.
  *
@@ -4645,6 +4979,8 @@ export declare const window: {
     /**
      * Creates overlapping sliding windows of size `n`.
      *
+     * **Details**
+     *
      * - Returns an empty array if `n <= 0` or the array has fewer than `n` elements.
      * - Each window is a tuple of exactly `n` elements.
      *
@@ -4666,6 +5002,8 @@ export declare const window: {
     /**
      * Creates overlapping sliding windows of size `n`.
      *
+     * **Details**
+     *
      * - Returns an empty array if `n <= 0` or the array has fewer than `n` elements.
      * - Each window is a tuple of exactly `n` elements.
      *
@@ -4688,6 +5026,8 @@ export declare const window: {
 /**
  * Groups consecutive equal elements using a custom equivalence function.
  *
+ * **Details**
+ *
  * - Only groups **adjacent** elements — non-adjacent duplicates stay separate.
  * - Requires a `NonEmptyReadonlyArray`.
  *
@@ -4710,6 +5050,8 @@ export declare const groupWith: {
     /**
      * Groups consecutive equal elements using a custom equivalence function.
      *
+     * **Details**
+     *
      * - Only groups **adjacent** elements — non-adjacent duplicates stay separate.
      * - Requires a `NonEmptyReadonlyArray`.
      *
@@ -4732,6 +5074,8 @@ export declare const groupWith: {
     /**
      * Groups consecutive equal elements using a custom equivalence function.
      *
+     * **Details**
+     *
      * - Only groups **adjacent** elements — non-adjacent duplicates stay separate.
      * - Requires a `NonEmptyReadonlyArray`.
      *
@@ -4755,6 +5099,8 @@ export declare const groupWith: {
 /**
  * Groups consecutive equal elements using `Equal.equivalence()`.
  *
+ * **Details**
+ *
  * - Only groups **adjacent** elements.
  *
  * **Example** (Grouping adjacent equal elements)
@@ -4776,6 +5122,8 @@ export declare const group: <A>(self: NonEmptyReadonlyArray<A>) => NonEmptyArray
  * Groups elements into a record by a key-returning function. Each key maps
  * to a `NonEmptyArray` of elements that produced that key.
  *
+ * **Details**
+ *
  * - Unlike {@link group}/{@link groupWith}, elements do not need to be
  *   adjacent to be grouped together.
  * - Key function must return a `string` or `symbol`.
@@ -4807,6 +5155,8 @@ export declare const groupBy: {
      * Groups elements into a record by a key-returning function. Each key maps
      * to a `NonEmptyArray` of elements that produced that key.
      *
+     * **Details**
+     *
      * - Unlike {@link group}/{@link groupWith}, elements do not need to be
      *   adjacent to be grouped together.
      * - Key function must return a `string` or `symbol`.
@@ -4838,6 +5188,8 @@ export declare const groupBy: {
      * Groups elements into a record by a key-returning function. Each key maps
      * to a `NonEmptyArray` of elements that produced that key.
      *
+     * **Details**
+     *
      * - Unlike {@link group}/{@link groupWith}, elements do not need to be
      *   adjacent to be grouped together.
      * - Key function must return a `string` or `symbol`.
@@ -5377,6 +5729,8 @@ export declare namespace ReadonlyArray {
 /**
  * Transforms each element using a function, returning a new array.
  *
+ * **Details**
+ *
  * - The function receives `(element, index)`.
  * - Preserves `NonEmptyArray` in the return type.
  *
@@ -5397,6 +5751,8 @@ export declare const map: {
     /**
      * Transforms each element using a function, returning a new array.
      *
+     * **Details**
+     *
      * - The function receives `(element, index)`.
      * - Preserves `NonEmptyArray` in the return type.
      *
@@ -5417,6 +5773,8 @@ export declare const map: {
     /**
      * Transforms each element using a function, returning a new array.
      *
+     * **Details**
+     *
      * - The function receives `(element, index)`.
      * - Preserves `NonEmptyArray` in the return type.
      *
@@ -5438,6 +5796,8 @@ export declare const map: {
 /**
  * Maps each element to an array and flattens the results into a single array.
  *
+ * **Details**
+ *
  * - The function receives `(element, index)`.
  * - Returns `NonEmptyArray` when both input and mapped arrays are non-empty.
  *
@@ -5459,6 +5819,8 @@ export declare const flatMap: {
     /**
      * Maps each element to an array and flattens the results into a single array.
      *
+     * **Details**
+     *
      * - The function receives `(element, index)`.
      * - Returns `NonEmptyArray` when both input and mapped arrays are non-empty.
      *
@@ -5480,6 +5842,8 @@ export declare const flatMap: {
     /**
      * Maps each element to an array and flattens the results into a single array.
      *
+     * **Details**
+     *
      * - The function receives `(element, index)`.
      * - Returns `NonEmptyArray` when both input and mapped arrays are non-empty.
      *
@@ -5501,6 +5865,8 @@ export declare const flatMap: {
     /**
      * Maps each element to an array and flattens the results into a single array.
      *
+     * **Details**
+     *
      * - The function receives `(element, index)`.
      * - Returns `NonEmptyArray` when both input and mapped arrays are non-empty.
      *
@@ -5598,6 +5964,8 @@ export declare const getSuccesses: <T extends Iterable<Result.Result<any, any>>>
 /**
  * Keeps transformed values for elements where a `Filter` succeeds.
  *
+ * **Details**
+ *
  * - The filter receives `(element, index)`.
  * - Failures are discarded.
  *
@@ -5619,6 +5987,8 @@ export declare const filterMap: {
     /**
      * Keeps transformed values for elements where a `Filter` succeeds.
      *
+     * **Details**
+     *
      * - The filter receives `(element, index)`.
      * - Failures are discarded.
      *
@@ -5640,6 +6010,8 @@ export declare const filterMap: {
     /**
      * Keeps transformed values for elements where a `Filter` succeeds.
      *
+     * **Details**
+     *
      * - The filter receives `(element, index)`.
      * - Failures are discarded.
      *
@@ -5662,6 +6034,8 @@ export declare const filterMap: {
 /**
  * Keeps only elements satisfying a predicate (or refinement).
  *
+ * **Details**
+ *
  * - The predicate receives `(element, index)`.
  * - Supports refinements for type narrowing.
  *
@@ -5682,6 +6056,8 @@ export declare const filter: {
     /**
      * Keeps only elements satisfying a predicate (or refinement).
      *
+     * **Details**
+     *
      * - The predicate receives `(element, index)`.
      * - Supports refinements for type narrowing.
      *
@@ -5702,6 +6078,8 @@ export declare const filter: {
     /**
      * Keeps only elements satisfying a predicate (or refinement).
      *
+     * **Details**
+     *
      * - The predicate receives `(element, index)`.
      * - Supports refinements for type narrowing.
      *
@@ -5722,6 +6100,8 @@ export declare const filter: {
     /**
      * Keeps only elements satisfying a predicate (or refinement).
      *
+     * **Details**
+     *
      * - The predicate receives `(element, index)`.
      * - Supports refinements for type narrowing.
      *
@@ -5742,6 +6122,8 @@ export declare const filter: {
     /**
      * Keeps only elements satisfying a predicate (or refinement).
      *
+     * **Details**
+     *
      * - The predicate receives `(element, index)`.
      * - Supports refinements for type narrowing.
      *
@@ -5763,6 +6145,8 @@ export declare const filter: {
 /**
  * Splits an iterable using a `Filter` into failures and successes.
  *
+ * **Details**
+ *
  * - Returns `[excluded, satisfying]`.
  * - The filter receives `(element, index)`.
  *
@@ -5787,6 +6171,8 @@ export declare const partition: {
     /**
      * Splits an iterable using a `Filter` into failures and successes.
      *
+     * **Details**
+     *
      * - Returns `[excluded, satisfying]`.
      * - The filter receives `(element, index)`.
      *
@@ -5811,6 +6197,8 @@ export declare const partition: {
     /**
      * Splits an iterable using a `Filter` into failures and successes.
      *
+     * **Details**
+     *
      * - Returns `[excluded, satisfying]`.
      * - The filter receives `(element, index)`.
      *
@@ -5836,6 +6224,8 @@ export declare const partition: {
 /**
  * Separates an iterable of `Result`s into failure values and success values.
  *
+ * **Details**
+ *
  * - Returns `[failures, successes]`.
  * - Equivalent to `partition(identity)`.
  *
@@ -5864,6 +6254,8 @@ export declare const separate: <T extends Iterable<Result.Result<any, any>>>(sel
 /**
  * Folds an iterable from left to right into a single value.
  *
+ * **Details**
+ *
  * - The function receives `(accumulator, element, index)`.
  *
  * **Example** (Summing an array)
@@ -5884,6 +6276,8 @@ export declare const reduce: {
     /**
      * Folds an iterable from left to right into a single value.
      *
+     * **Details**
+     *
      * - The function receives `(accumulator, element, index)`.
      *
      * **Example** (Summing an array)
@@ -5904,6 +6298,8 @@ export declare const reduce: {
     /**
      * Folds an iterable from left to right into a single value.
      *
+     * **Details**
+     *
      * - The function receives `(accumulator, element, index)`.
      *
      * **Example** (Summing an array)
@@ -5925,6 +6321,8 @@ export declare const reduce: {
 /**
  * Folds an iterable from right to left into a single value.
  *
+ * **Details**
+ *
  * - The function receives `(accumulator, element, index)`.
  *
  * **Example** (Right-to-left fold)
@@ -5945,6 +6343,8 @@ export declare const reduceRight: {
     /**
      * Folds an iterable from right to left into a single value.
      *
+     * **Details**
+     *
      * - The function receives `(accumulator, element, index)`.
      *
      * **Example** (Right-to-left fold)
@@ -5965,6 +6365,8 @@ export declare const reduceRight: {
     /**
      * Folds an iterable from right to left into a single value.
      *
+     * **Details**
+     *
      * - The function receives `(accumulator, element, index)`.
      *
      * **Example** (Right-to-left fold)
@@ -6335,6 +6737,8 @@ export declare const some: {
  * Applies a function to each suffix of the array (starting from each index),
  * collecting the results.
  *
+ * **Details**
+ *
  * - For index `i`, the function receives `self.slice(i)`.
  *
  * **Example** (Suffix lengths)
@@ -6353,6 +6757,8 @@ export declare const extend: {
      * Applies a function to each suffix of the array (starting from each index),
      * collecting the results.
      *
+     * **Details**
+     *
      * - For index `i`, the function receives `self.slice(i)`.
      *
      * **Example** (Suffix lengths)
@@ -6371,6 +6777,8 @@ export declare const extend: {
      * Applies a function to each suffix of the array (starting from each index),
      * collecting the results.
      *
+     * **Details**
+     *
      * - For index `i`, the function receives `self.slice(i)`.
      *
      * **Example** (Suffix lengths)
@@ -6708,6 +7116,8 @@ export declare const dedupe: <S extends Iterable<any>>(self: S) => S extends Non
 /**
  * Removes consecutive duplicate elements using a custom equivalence.
  *
+ * **Details**
+ *
  * - Non-adjacent duplicates are preserved.
  *
  * **Example** (Deduplicating adjacent elements)
@@ -6729,6 +7139,8 @@ export declare const dedupeAdjacentWith: {
     /**
      * Removes consecutive duplicate elements using a custom equivalence.
      *
+     * **Details**
+     *
      * - Non-adjacent duplicates are preserved.
      *
      * **Example** (Deduplicating adjacent elements)
@@ -6750,6 +7162,8 @@ export declare const dedupeAdjacentWith: {
     /**
      * Removes consecutive duplicate elements using a custom equivalence.
      *
+     * **Details**
+     *
      * - Non-adjacent duplicates are preserved.
      *
      * **Example** (Deduplicating adjacent elements)
@@ -6842,6 +7256,8 @@ export declare const join: {
 /**
  * Maps over an array while threading an accumulator through each step, returning both the final state and the mapped array.
  *
+ * **Details**
+ *
  * - Combines `map` and `reduce` in a single pass.
  * - The callback receives the current state, element, and index, and returns `[nextState, mappedValue]`.
  * - Returns `[finalState, mappedArray]`.
@@ -6866,6 +7282,8 @@ export declare const mapAccum: {
     /**
      * Maps over an array while threading an accumulator through each step, returning both the final state and the mapped array.
      *
+     * **Details**
+     *
      * - Combines `map` and `reduce` in a single pass.
      * - The callback receives the current state, element, and index, and returns `[nextState, mappedValue]`.
      * - Returns `[finalState, mappedArray]`.
@@ -6890,6 +7308,8 @@ export declare const mapAccum: {
     /**
      * Maps over an array while threading an accumulator through each step, returning both the final state and the mapped array.
      *
+     * **Details**
+     *
      * - Combines `map` and `reduce` in a single pass.
      * - The callback receives the current state, element, and index, and returns `[nextState, mappedValue]`.
      * - Returns `[finalState, mappedArray]`.
@@ -6915,6 +7335,8 @@ export declare const mapAccum: {
 /**
  * Computes the cartesian product of two arrays, applying a combiner to each pair.
  *
+ * **Details**
+ *
  * - Produces every combination of an element from `self` with an element from `that`.
  * - Result length is `self.length * that.length`.
  * - Order: iterates `that` for each element of `self`.
@@ -6937,6 +7359,8 @@ export declare const cartesianWith: {
     /**
      * Computes the cartesian product of two arrays, applying a combiner to each pair.
      *
+     * **Details**
+     *
      * - Produces every combination of an element from `self` with an element from `that`.
      * - Result length is `self.length * that.length`.
      * - Order: iterates `that` for each element of `self`.
@@ -6959,6 +7383,8 @@ export declare const cartesianWith: {
     /**
      * Computes the cartesian product of two arrays, applying a combiner to each pair.
      *
+     * **Details**
+     *
      * - Produces every combination of an element from `self` with an element from `that`.
      * - Result length is `self.length * that.length`.
      * - Order: iterates `that` for each element of `self`.
@@ -6982,6 +7408,8 @@ export declare const cartesianWith: {
 /**
  * Computes the cartesian product of two arrays, returning all pairs as tuples.
  *
+ * **Details**
+ *
  * - Produces every `[a, b]` combination of an element from `self` with an element from `that`.
  * - Result length is `self.length * that.length`.
  *
@@ -7003,6 +7431,8 @@ export declare const cartesian: {
     /**
      * Computes the cartesian product of two arrays, returning all pairs as tuples.
      *
+     * **Details**
+     *
      * - Produces every `[a, b]` combination of an element from `self` with an element from `that`.
      * - Result length is `self.length * that.length`.
      *
@@ -7024,6 +7454,8 @@ export declare const cartesian: {
     /**
      * Computes the cartesian product of two arrays, returning all pairs as tuples.
      *
+     * **Details**
+     *
      * - Produces every `[a, b]` combination of an element from `self` with an element from `that`.
      * - Result length is `self.length * that.length`.
      *
@@ -7046,6 +7478,8 @@ export declare const cartesian: {
 /**
  * Starting point for the "do simulation" — an array comprehension pattern.
  *
+ * **When to use**
+ *
  * - Begin a pipeline with `Do`, then use {@link bind} to introduce array variables and {@link let_ let} for plain values.
  * - Each `bind` produces the cartesian product of all bound variables (like nested loops).
  * - Use `filter` and `map` in the pipeline to add conditions and transformations.
@@ -7076,6 +7510,8 @@ export declare const Do: ReadonlyArray<{}>;
 /**
  * Introduces a new array variable into a do-notation scope, producing the cartesian product with all previous bindings.
  *
+ * **Details**
+ *
  * - Each `bind` call adds a named property to the accumulated object.
  * - The callback receives the current scope and must return an array.
  * - Equivalent to `flatMap` + merging the new value into the scope object.
@@ -7105,6 +7541,8 @@ export declare const bind: {
     /**
      * Introduces a new array variable into a do-notation scope, producing the cartesian product with all previous bindings.
      *
+     * **Details**
+     *
      * - Each `bind` call adds a named property to the accumulated object.
      * - The callback receives the current scope and must return an array.
      * - Equivalent to `flatMap` + merging the new value into the scope object.
@@ -7136,6 +7574,8 @@ export declare const bind: {
     /**
      * Introduces a new array variable into a do-notation scope, producing the cartesian product with all previous bindings.
      *
+     * **Details**
+     *
      * - Each `bind` call adds a named property to the accumulated object.
      * - The callback receives the current scope and must return an array.
      * - Equivalent to `flatMap` + merging the new value into the scope object.
@@ -7168,6 +7608,8 @@ export declare const bind: {
 /**
  * Names the elements of an array by wrapping each in an object with the given key, starting a do-notation scope.
  *
+ * **Details**
+ *
  * - Equivalent to `Array.map(self, (a) => ({ [tag]: a }))`.
  * - Alternative to starting with `Do` + `bind`; useful when you already have an array.
  *
@@ -7193,6 +7635,8 @@ export declare const bindTo: {
     /**
      * Names the elements of an array by wrapping each in an object with the given key, starting a do-notation scope.
      *
+     * **Details**
+     *
      * - Equivalent to `Array.map(self, (a) => ({ [tag]: a }))`.
      * - Alternative to starting with `Do` + `bind`; useful when you already have an array.
      *
@@ -7220,6 +7664,8 @@ export declare const bindTo: {
     /**
      * Names the elements of an array by wrapping each in an object with the given key, starting a do-notation scope.
      *
+     * **Details**
+     *
      * - Equivalent to `Array.map(self, (a) => ({ [tag]: a }))`.
      * - Alternative to starting with `Do` + `bind`; useful when you already have an array.
      *
@@ -7257,6 +7703,8 @@ export {
 /**
  * Adds a computed plain value to the do-notation scope without introducing a new array dimension.
  *
+ * **Details**
+ *
  * - Unlike {@link bind}, the callback returns a single value (not an array), so no cartesian product occurs.
  * - Useful for derived or intermediate values that depend on previously bound variables.
  *
@@ -7302,6 +7750,8 @@ export declare function makeReducerConcat<A>(): Reducer.Reducer<Array<A>>;
 /**
  * Counts the elements in an iterable that satisfy a predicate.
  *
+ * **Details**
+ *
  * - The predicate receives both the element and its index.
  * - Returns `0` for an empty iterable.
  *
@@ -7323,6 +7773,8 @@ export declare const countBy: {
     /**
      * Counts the elements in an iterable that satisfy a predicate.
      *
+     * **Details**
+     *
      * - The predicate receives both the element and its index.
      * - Returns `0` for an empty iterable.
      *
@@ -7344,6 +7796,8 @@ export declare const countBy: {
     /**
      * Counts the elements in an iterable that satisfy a predicate.
      *
+     * **Details**
+     *
      * - The predicate receives both the element and its index.
      * - Returns `0` for an empty iterable.
      *