@nlozgachev/pipelined 0.45.0 → 0.46.0

package/dist/utils.d.ts

@@ -2,55 +2,6 @@ import { a as NonEmptyArr, N as NonEmpty } from './InternalTypes-Mssktd7z.js';
 import { M as Maybe, R as Result, E as Equality, b as Ordering, T as Task } from './Validation-BMsvixWH.js';
 import { Brand } from './types.js';
 
-declare namespace ArrMaybe {
-    /**
-     * Maps each element to a Maybe and collects the results.
-     * Returns None if any mapping returns None.
-     *
-     * @example
-     * ```ts
-     * const parseNum = (s: string): Maybe<number> => {
-     *   const n = Number(s);
-     *   return isNaN(n) ? Maybe.make.none() : Maybe.make.some(n);
-     * };
-     *
-     * pipe(["1", "2", "3"], Arr.Maybe.traverse(parseNum)); // Some([1, 2, 3])
-     * pipe(["1", "x", "3"], Arr.Maybe.traverse(parseNum)); // None
-     * ```
-     */
-    const traverse: <A, B>(f: (a: A) => Maybe<B>) => (data: readonly A[]) => Maybe<readonly B[]>;
-    /**
-     * Collects an array of Maybe instances into a Maybe of array.
-     * Returns None if any element is None.
-     *
-     * @example
-     * ```ts
-     * Arr.Maybe.sequence([Maybe.make.some(1), Maybe.make.some(2)]); // Some([1, 2])
-     * Arr.Maybe.sequence([Maybe.make.some(1), Maybe.make.none()]); // None
-     * ```
-     */
-    const sequence: <A>(data: readonly Maybe<A>[]) => Maybe<readonly A[]>;
-}
-declare namespace ArrResult {
-    /**
-     * Maps each element to a Result and collects the results.
-     * Returns the first Err if any mapping fails.
-     *
-     * @example
-     * ```ts
-     * pipe(
-     *   [1, 2, 3],
-     *   Arr.Result.traverse(n => n > 0 ? Result.make.ok(n) : Result.make.err("negative"))
-     * ); // Ok([1, 2, 3])
-     * ```
-     */
-    const traverse: <E, A, B>(f: (a: A) => Result<E, B>) => (data: readonly A[]) => Result<E, readonly B[]>;
-    /**
-     * Collects an array of Results into a Result of array.
-     * Returns the first Err if any element is Err.
-     */
-    const sequence: <E, A>(data: readonly Result<E, A>[]) => Result<E, readonly A[]>;
-}
 declare namespace ArrTaskResult {
     /**
      * Maps each element to a Task.Result and runs them sequentially.
@@ -79,25 +30,6 @@ declare namespace ArrTaskResult {
      */
     const sequence: <E, A>(data: readonly Task<Result<E, A>>[]) => Task<Result<E, readonly A[]>>;
 }
-declare namespace ArrTask {
-    /**
-     * Maps each element to a Task and runs all in parallel.
-     *
-     * @example
-     * ```ts
-     * pipe(
-     *   [1, 2, 3],
-     *   Arr.Task.traverse(n => Task.resolve(n * 2))
-     * )(); // Promise<[2, 4, 6]>
-     * ```
-     */
-    const traverse: <A, B>(f: (a: A) => Task<B>) => (data: readonly A[]) => Task<readonly B[]>;
-    /**
-     * Collects an array of Tasks into a Task of array. Runs in parallel.
-     */
-    const sequence: <A>(data: readonly Task<A>[]) => Task<readonly A[]>;
-    const Result: typeof ArrTaskResult;
-}
 declare namespace ArrNonEmpty {
     /**
      * Creates a single-element list.
@@ -227,7 +159,7 @@ declare namespace Arr {
      * const list: Arr.NonEmpty<number> = [1, 2, 3];
      * ```
      */
-    type NonEmpty<A> = NonEmptyArr<A>;
+    export type NonEmpty<A> = NonEmptyArr<A>;
     /**
      * Returns the first element of an array, or None if the array is empty.
      *
@@ -237,7 +169,7 @@ declare namespace Arr {
      * Arr.head([]); // None
      * ```
      */
-    const head: <A>(data: readonly A[]) => Maybe<A>;
+    export const head: <A>(data: readonly A[]) => Maybe<A>;
     /**
      * Returns the last element of an array, or None if the array is empty.
      *
@@ -247,7 +179,7 @@ declare namespace Arr {
      * Arr.last([]); // None
      * ```
      */
-    const last: <A>(data: readonly A[]) => Maybe<A>;
+    export const last: <A>(data: readonly A[]) => Maybe<A>;
     /**
      * Returns all elements except the first, or None if the array is empty.
      *
@@ -257,7 +189,7 @@ declare namespace Arr {
      * Arr.tail([]); // None
      * ```
      */
-    const tail: <A>(data: readonly A[]) => Maybe<readonly A[]>;
+    export const tail: <A>(data: readonly A[]) => Maybe<readonly A[]>;
     /**
      * Returns all elements except the last, or None if the array is empty.
      *
@@ -267,7 +199,7 @@ declare namespace Arr {
      * Arr.init([]); // None
      * ```
      */
-    const init: <A>(data: readonly A[]) => Maybe<readonly A[]>;
+    export const init: <A>(data: readonly A[]) => Maybe<readonly A[]>;
     /**
      * Returns the first element matching the predicate, or None.
      *
@@ -276,7 +208,7 @@ declare namespace Arr {
      * pipe([1, 2, 3, 4], Arr.findFirst(n => n > 2)); // Some(3)
      * ```
      */
-    const findFirst: <A>(predicate: (a: A) => boolean) => (data: readonly A[]) => Maybe<A>;
+    export const findFirst: <A>(predicate: (a: A) => boolean) => (data: readonly A[]) => Maybe<A>;
     /**
      * Returns the last element matching the predicate, or None.
      *
@@ -285,7 +217,7 @@ declare namespace Arr {
      * pipe([1, 2, 3, 4], Arr.findLast(n => n > 2)); // Some(4)
      * ```
      */
-    const findLast: <A>(predicate: (a: A) => boolean) => (data: readonly A[]) => Maybe<A>;
+    export const findLast: <A>(predicate: (a: A) => boolean) => (data: readonly A[]) => Maybe<A>;
     /**
      * Returns the index of the first element matching the predicate, or None.
      *
@@ -294,7 +226,7 @@ declare namespace Arr {
      * pipe([1, 2, 3, 4], Arr.findIndex(n => n > 2)); // Some(2)
      * ```
      */
-    const findIndex: <A>(predicate: (a: A) => boolean) => (data: readonly A[]) => Maybe<number>;
+    export const findIndex: <A>(predicate: (a: A) => boolean) => (data: readonly A[]) => Maybe<number>;
     /**
      * Transforms each element of an array.
      *
@@ -303,7 +235,7 @@ declare namespace Arr {
      * pipe([1, 2, 3], Arr.map(n => n * 2)); // [2, 4, 6]
      * ```
      */
-    const map: <A, B>(f: (a: A) => B) => (data: readonly A[]) => readonly B[];
+    export const map: <A, B>(f: (a: A) => B) => (data: readonly A[]) => readonly B[];
     /**
      * Transforms each element using both its value and its zero-based index.
      *
@@ -315,7 +247,7 @@ declare namespace Arr {
      * ); // [{ position: 1, value: "a" }, { position: 2, value: "b" }, { position: 3, value: "c" }]
      * ```
      */
-    const mapWithIndex: <A, B>(f: (i: number, a: A) => B) => (data: readonly A[]) => readonly B[];
+    export const mapWithIndex: <A, B>(f: (i: number, a: A) => B) => (data: readonly A[]) => readonly B[];
     /**
      * Filters elements that satisfy the predicate.
      *
@@ -324,7 +256,7 @@ declare namespace Arr {
      * pipe([1, 2, 3, 4], Arr.filter(n => n % 2 === 0)); // [2, 4]
      * ```
      */
-    const filter: <A>(predicate: (a: A) => boolean) => (data: readonly A[]) => readonly A[];
+    export const filter: <A>(predicate: (a: A) => boolean) => (data: readonly A[]) => readonly A[];
     /**
      * Maps each element to a Maybe and collects only the Some values.
      * Combines map and filter in a single pass.
@@ -339,7 +271,7 @@ declare namespace Arr {
      * pipe(["1", "abc", "3"], Arr.filterMap(parseNum)); // [1, 3]
      * ```
      */
-    const filterMap: <A, B>(f: (a: A) => Maybe<B>) => (data: readonly A[]) => readonly B[];
+    export const filterMap: <A, B>(f: (a: A) => Maybe<B>) => (data: readonly A[]) => readonly B[];
     /**
      * Splits an array into two groups based on a predicate.
      * First group contains elements that satisfy the predicate,
@@ -350,7 +282,7 @@ declare namespace Arr {
      * pipe([1, 2, 3, 4], Arr.partition(n => n % 2 === 0)); // [[2, 4], [1, 3]]
      * ```
      */
-    const partition: <A>(predicate: (a: A) => boolean) => (data: readonly A[]) => readonly [readonly A[], readonly A[]];
+    export const partition: <A>(predicate: (a: A) => boolean) => (data: readonly A[]) => readonly [readonly A[], readonly A[]];
     /**
      * Narrows a list of Maybe values down to a list of their underlying values,
      * discarding all None instances.
@@ -360,7 +292,7 @@ declare namespace Arr {
      * Arr.compact([Maybe.make.some(1), Maybe.make.none(), Maybe.make.some(3)]); // [1, 3]
      * ```
      */
-    const compact: <A>(data: readonly Maybe<A>[]) => readonly A[];
+    export const compact: <A>(data: readonly Maybe<A>[]) => readonly A[];
     /**
      * Separates an array of Result values into two separate lists of errors and successes.
      * Returns a tuple containing `[errors, successes]`.
@@ -370,7 +302,7 @@ declare namespace Arr {
      * Arr.separate([Result.make.ok(1), Result.make.err("bad"), Result.make.ok(3)]); // [["bad"], [1, 3]]
      * ```
      */
-    const separate: <E, A>(data: readonly Result<E, A>[]) => readonly [readonly E[], readonly A[]];
+    export const separate: <E, A>(data: readonly Result<E, A>[]) => readonly [readonly E[], readonly A[]];
     /**
      * Maps each element to a Result, and separates the results into a tuple of failures and successes.
      *
@@ -382,7 +314,7 @@ declare namespace Arr {
      * ); // [["odd: 1", "odd: 3"], [2, 4]]
      * ```
      */
-    const partitionMap: <A, E, B>(f: (a: A) => Result<E, B>) => (data: readonly A[]) => readonly [readonly E[], readonly B[]];
+    export const partitionMap: <A, E, B>(f: (a: A) => Result<E, B>) => (data: readonly A[]) => readonly [readonly E[], readonly B[]];
     /**
      * Groups elements by a key function.
      *
@@ -394,7 +326,7 @@ declare namespace Arr {
      * ); // { a: ["apple", "avocado"], b: ["banana"] }
      * ```
      */
-    const groupBy: <A>(f: (a: A) => string) => (data: readonly A[]) => Record<string, NonEmptyArr<A>>;
+    export const groupBy: <A>(f: (a: A) => string) => (data: readonly A[]) => Record<string, NonEmptyArr<A>>;
     /**
      * Removes duplicate elements using strict equality.
      *
@@ -403,7 +335,7 @@ declare namespace Arr {
      * Arr.uniq([1, 2, 2, 3, 1]); // [1, 2, 3]
      * ```
      */
-    const uniq: <A>(data: readonly A[]) => readonly A[];
+    export const uniq: <A>(data: readonly A[]) => readonly A[];
     /**
      * Removes duplicate elements by comparing the result of a key function.
      *
@@ -415,7 +347,7 @@ declare namespace Arr {
      * ); // [{id: 1, name: "a"}, {id: 2, name: "c"}]
      * ```
      */
-    const uniqBy: <A, B>(f: (a: A) => B) => (data: readonly A[]) => readonly A[];
+    export const uniqBy: <A, B>(f: (a: A) => B) => (data: readonly A[]) => readonly A[];
     /**
      * Removes duplicate elements using a custom equality check.
      * Preserves the order of first occurrences. Complements `uniq` (reference equality)
@@ -432,7 +364,7 @@ declare namespace Arr {
      * ); // [{ x: 1, y: 1 }, { x: 2, y: 2 }]
      * ```
      */
-    const uniqWith: <A>(eq: Equality<A>) => (data: readonly A[]) => readonly A[];
+    export const uniqWith: <A>(eq: Equality<A>) => (data: readonly A[]) => readonly A[];
     /**
      * Sorts an array using a comparison function. Returns a new array.
      * To sort with a typed `Ordering<A>`, prefer `Arr.sortWith`.
@@ -442,7 +374,7 @@ declare namespace Arr {
      * pipe([3, 1, 2], Arr.sortBy((a, b) => a - b)); // [1, 2, 3]
      * ```
      */
-    const sortBy: <A>(compare: (a: A, b: A) => number) => (data: readonly A[]) => readonly A[];
+    export const sortBy: <A>(compare: (a: A, b: A) => number) => (data: readonly A[]) => readonly A[];
     /**
      * Sorts an array using an `Ordering<A>`. Returns a new array without mutating the original.
      * Use this over `sortBy` when you have a typed `Ordering<A>` from the `Ordering` module.
@@ -455,7 +387,7 @@ declare namespace Arr {
      * pipe(products, Arr.sortWith(byPrice));
      * ```
      */
-    const sortWith: <A>(ord: Ordering<A>) => (data: readonly A[]) => readonly A[];
+    export const sortWith: <A>(ord: Ordering<A>) => (data: readonly A[]) => readonly A[];
     /**
      * Pairs up elements from two arrays. Stops at the shorter array.
      *
@@ -464,7 +396,7 @@ declare namespace Arr {
      * pipe([1, 2, 3], Arr.zip(["a", "b"])); // [[1, "a"], [2, "b"]]
      * ```
      */
-    const zip: <B>(other: readonly B[]) => <A>(data: readonly A[]) => readonly (readonly [A, B])[];
+    export const zip: <B>(other: readonly B[]) => <A>(data: readonly A[]) => readonly (readonly [A, B])[];
     /**
      * Combines elements from two arrays using a function. Stops at the shorter array.
      *
@@ -473,7 +405,7 @@ declare namespace Arr {
      * pipe([1, 2], Arr.zipWith((a, b) => a + b, ["a", "b"])); // ["1a", "2b"]
      * ```
      */
-    const zipWith: <A, B, C>(f: (a: A, b: B) => C) => (other: readonly B[]) => (data: readonly A[]) => readonly C[];
+    export const zipWith: <A, B, C>(f: (a: A, b: B) => C) => (other: readonly B[]) => (data: readonly A[]) => readonly C[];
     /**
      * Inserts a separator between every element.
      *
@@ -482,7 +414,7 @@ declare namespace Arr {
      * pipe([1, 2, 3], Arr.intersperse(0)); // [1, 0, 2, 0, 3]
      * ```
      */
-    const intersperse: <A>(sep: A) => (data: readonly A[]) => readonly A[];
+    export const intersperse: <A>(sep: A) => (data: readonly A[]) => readonly A[];
     /**
      * Concatenates a standard array with another array.
      *
@@ -491,7 +423,7 @@ declare namespace Arr {
      * pipe([1, 2], Arr.concat([3, 4])); // [1, 2, 3, 4]
      * ```
      */
-    const concat: <A>(other: readonly A[]) => (data: readonly A[]) => readonly A[];
+    export const concat: <A>(other: readonly A[]) => (data: readonly A[]) => readonly A[];
     /**
      * Splits an array into chunks of the given size.
      *
@@ -500,7 +432,7 @@ declare namespace Arr {
      * pipe([1, 2, 3, 4, 5], Arr.chunksOf(2)); // [[1, 2], [3, 4], [5]]
      * ```
      */
-    const chunksOf: (n: number) => <A>(data: readonly A[]) => readonly (readonly A[])[];
+    export const chunksOf: (n: number) => <A>(data: readonly A[]) => readonly (readonly A[])[];
     /**
      * Flattens a nested array by one level.
      *
@@ -509,7 +441,7 @@ declare namespace Arr {
      * Arr.flatten([[1, 2], [3], [4, 5]]); // [1, 2, 3, 4, 5]
      * ```
      */
-    const flatten: <A>(data: readonly (readonly A[])[]) => readonly A[];
+    export const flatten: <A>(data: readonly (readonly A[])[]) => readonly A[];
     /**
      * Maps each element to an array and flattens the result.
      *
@@ -518,7 +450,7 @@ declare namespace Arr {
      * pipe([1, 2, 3], Arr.flatMap(n => [n, n * 10])); // [1, 10, 2, 20, 3, 30]
      * ```
      */
-    const flatMap: <A, B>(f: (a: A) => readonly B[]) => (data: readonly A[]) => readonly B[];
+    export const flatMap: <A, B>(f: (a: A) => readonly B[]) => (data: readonly A[]) => readonly B[];
     /**
      * Reduces an array from the left.
      *
@@ -527,11 +459,26 @@ declare namespace Arr {
      * pipe([1, 2, 3], Arr.reduce(0, (acc, n) => acc + n)); // 6
      * ```
      */
-    const reduce: <A, B>(initial: B, f: (acc: B, a: A) => B) => (data: readonly A[]) => B;
-    const Maybe: typeof ArrMaybe;
-    const Result: typeof ArrResult;
-    const Task: typeof ArrTask;
-    namespace is {
+    export const reduce: <A, B>(initial: B, f: (acc: B, a: A) => B) => (data: readonly A[]) => B;
+    interface TaskTraverse {
+        <A, B>(f: (a: A) => Task<B>): (data: readonly A[]) => Task<readonly B[]>;
+        Result: typeof ArrTaskResult.traverse;
+    }
+    interface TaskSequence {
+        <A>(data: readonly Task<A>[]): Task<readonly A[]>;
+        Result: typeof ArrTaskResult.sequence;
+    }
+    export namespace traverse {
+        const Maybe: <A, B>(f: (a: A) => Maybe<B>) => (data: readonly A[]) => Maybe<readonly B[]>;
+        const Result: <E, A, B>(f: (a: A) => Result<E, B>) => (data: readonly A[]) => Result<E, readonly B[]>;
+        const Task: TaskTraverse;
+    }
+    export namespace sequence {
+        const Maybe: <A>(data: readonly Maybe<A>[]) => Maybe<readonly A[]>;
+        const Result: <E, A>(data: readonly Result<E, A>[]) => Result<E, readonly A[]>;
+        const Task: TaskSequence;
+    }
+    export namespace is {
         /**
          * Returns true if the array is empty.
          */
@@ -549,7 +496,7 @@ declare namespace Arr {
      * pipe([1, 2], Arr.prepend(0)); // [0, 1, 2]
      * ```
      */
-    const prepend: <A>(value: A) => (data: readonly A[]) => NonEmpty<A>;
+    export const prepend: <A>(value: A) => (data: readonly A[]) => NonEmpty<A>;
     /**
      * Appends a value to the end of an array, returning a NonEmptyArr.
      *
@@ -558,11 +505,11 @@ declare namespace Arr {
      * pipe([1, 2], Arr.append(3)); // [1, 2, 3]
      * ```
      */
-    const append: <A>(value: A) => (data: readonly A[]) => NonEmpty<A>;
+    export const append: <A>(value: A) => (data: readonly A[]) => NonEmpty<A>;
     /**
      * Returns the length of an array.
      */
-    const size: <A>(data: readonly A[]) => number;
+    export const size: <A>(data: readonly A[]) => number;
     /**
      * Returns true if any element satisfies the predicate.
      *
@@ -571,7 +518,7 @@ declare namespace Arr {
      * pipe([1, 2, 3], Arr.some(n => n > 2)); // true
      * ```
      */
-    const some: <A>(predicate: (a: A) => boolean) => (data: readonly A[]) => boolean;
+    export const some: <A>(predicate: (a: A) => boolean) => (data: readonly A[]) => boolean;
     /**
      * Returns true if all elements satisfy the predicate.
      *
@@ -580,7 +527,7 @@ declare namespace Arr {
      * pipe([1, 2, 3], Arr.every(n => n > 0)); // true
      * ```
      */
-    const every: <A>(predicate: (a: A) => boolean) => (data: readonly A[]) => boolean;
+    export const every: <A>(predicate: (a: A) => boolean) => (data: readonly A[]) => boolean;
     /**
      * Reverses an array. Returns a new array.
      *
@@ -589,7 +536,7 @@ declare namespace Arr {
      * Arr.reverse([1, 2, 3]); // [3, 2, 1]
      * ```
      */
-    const reverse: <A>(data: readonly A[]) => readonly A[];
+    export const reverse: <A>(data: readonly A[]) => readonly A[];
     /**
      * Returns a new array with `item` inserted before the element at `index`.
      * Negative indices are clamped to 0; indices beyond the array length append to the end.
@@ -601,7 +548,7 @@ declare namespace Arr {
      * pipe([1, 2, 3], Arr.insertAt(3, 99)); // [1, 2, 3, 99]
      * ```
      */
-    const insertAt: <A>(index: number, item: A) => (data: readonly A[]) => readonly A[];
+    export const insertAt: <A>(index: number, item: A) => (data: readonly A[]) => readonly A[];
     /**
      * Returns a new array with the element at `index` removed.
      * Returns the original array unchanged if `index` is out of bounds.
@@ -613,7 +560,7 @@ declare namespace Arr {
      * pipe([1, 2, 3], Arr.removeAt(5)); // [1, 2, 3]
      * ```
      */
-    const removeAt: (index: number) => <A>(data: readonly A[]) => readonly A[];
+    export const removeAt: (index: number) => <A>(data: readonly A[]) => readonly A[];
     /**
      * Takes the first n elements from an array.
      *
@@ -622,7 +569,7 @@ declare namespace Arr {
      * pipe([1, 2, 3, 4], Arr.take(2)); // [1, 2]
      * ```
      */
-    const take: (n: number) => <A>(data: readonly A[]) => readonly A[];
+    export const take: (n: number) => <A>(data: readonly A[]) => readonly A[];
     /**
      * Drops the first n elements from an array.
      *
@@ -631,7 +578,7 @@ declare namespace Arr {
      * pipe([1, 2, 3, 4], Arr.drop(2)); // [3, 4]
      * ```
      */
-    const drop: (n: number) => <A>(data: readonly A[]) => readonly A[];
+    export const drop: (n: number) => <A>(data: readonly A[]) => readonly A[];
     /**
      * Takes elements from the start while the predicate holds.
      *
@@ -640,7 +587,7 @@ declare namespace Arr {
      * pipe([1, 2, 3, 1], Arr.takeWhile(n => n < 3)); // [1, 2]
      * ```
      */
-    const takeWhile: <A>(predicate: (a: A) => boolean) => (data: readonly A[]) => readonly A[];
+    export const takeWhile: <A>(predicate: (a: A) => boolean) => (data: readonly A[]) => readonly A[];
     /**
      * Drops elements from the start while the predicate holds.
      *
@@ -649,7 +596,7 @@ declare namespace Arr {
      * pipe([1, 2, 3, 1], Arr.dropWhile(n => n < 3)); // [3, 1]
      * ```
      */
-    const dropWhile: <A>(predicate: (a: A) => boolean) => (data: readonly A[]) => readonly A[];
+    export const dropWhile: <A>(predicate: (a: A) => boolean) => (data: readonly A[]) => readonly A[];
     /**
      * Like `reduce`, but returns every intermediate accumulator as an array.
      * The initial value is not included — the output has the same length as the input.
@@ -659,7 +606,7 @@ declare namespace Arr {
      * pipe([1, 2, 3], Arr.scan(0, (acc, n) => acc + n)); // [1, 3, 6]
      * ```
      */
-    const scan: <A, B>(initial: B, f: (acc: B, a: A) => B) => (data: readonly A[]) => readonly B[];
+    export const scan: <A, B>(initial: B, f: (acc: B, a: A) => B) => (data: readonly A[]) => readonly B[];
     /**
      * Splits an array at an index into a `[before, after]` tuple.
      * Negative indices clamp to 0; indices beyond the array length clamp to the end.
@@ -671,8 +618,9 @@ declare namespace Arr {
      * pipe([1, 2, 3], Arr.splitAt(10));   // [[1, 2, 3], []]
      * ```
      */
-    const splitAt: (index: number) => <A>(data: readonly A[]) => readonly [readonly A[], readonly A[]];
-    const NonEmpty: typeof ArrNonEmpty;
+    export const splitAt: (index: number) => <A>(data: readonly A[]) => readonly [readonly A[], readonly A[]];
+    export const NonEmpty: typeof ArrNonEmpty;
+    export {  };
 }
 
 /**
@@ -1324,58 +1272,6 @@ declare namespace Num {
  * A branded type representing a record with at least one key-value pair.
  */
 type NonEmptyRecord<A, K extends string = string> = Brand<NonEmpty<"Rec">, Readonly<Record<K, A>>>;
-declare namespace RecMaybe {
-    /**
-     * Map a function that returns a `Maybe` over each value of a record,
-     * and combine the results into a single `Maybe` containing the updated record.
-     * If any value results in `None`, the entire operation returns `None` (short-circuits).
-     *
-     * @example
-     * ```ts
-     * const parseNum = (s: string) => s === "NaN" ? Maybe.make.none() : Maybe.make.some(Number(s));
-     * pipe({ a: "1", b: "2" }, Rec.Maybe.traverse(parseNum)); // Some({ a: 1, b: 2 })
-     * pipe({ a: "1", b: "NaN" }, Rec.Maybe.traverse(parseNum)); // None
-     * ```
-     */
-    const traverse: <A, B>(f: (a: A) => Maybe<B>) => (data: Readonly<Record<string, A>>) => Maybe<Readonly<Record<string, B>>>;
-    /**
-     * Sequence a record of `Maybe` values into a `Maybe` of a record.
-     * If any key contains `None`, the entire operation returns `None`.
-     *
-     * @example
-     * ```ts
-     * Rec.Maybe.sequence({ a: Maybe.make.some(1), b: Maybe.make.some(2) }); // Some({ a: 1, b: 2 })
-     * Rec.Maybe.sequence({ a: Maybe.make.some(1), b: Maybe.make.none() }); // None
-     * ```
-     */
-    const sequence: <A>(data: Readonly<Record<string, Maybe<A>>>) => Maybe<Readonly<Record<string, A>>>;
-}
-declare namespace RecResult {
-    /**
-     * Map a function that returns a `Result` over each value of a record,
-     * and combine the results into a single `Result` containing the updated record.
-     * If any value results in an `Err`, the entire operation returns that `Err` (short-circuits).
-     *
-     * @example
-     * ```ts
-     * const checkPositive = (n: number) => n < 0 ? Result.make.err("negative") : Result.make.ok(n);
-     * pipe({ a: 1, b: 2 }, Rec.Result.traverse(checkPositive)); // Ok({ a: 1, b: 2 })
-     * pipe({ a: 1, b: -2 }, Rec.Result.traverse(checkPositive)); // Err("negative")
-     * ```
-     */
-    const traverse: <E, A, B>(f: (a: A) => Result<E, B>) => (data: Readonly<Record<string, A>>) => Result<E, Readonly<Record<string, B>>>;
-    /**
-     * Sequence a record of `Result` values into a `Result` of a record.
-     * If any key contains an `Err`, the entire operation returns that `Err`.
-     *
-     * @example
-     * ```ts
-     * Rec.Result.sequence({ a: Result.make.ok(1), b: Result.make.ok(2) }); // Ok({ a: 1, b: 2 })
-     * Rec.Result.sequence({ a: Result.make.ok(1), b: Result.make.err("oops") }); // Err("oops")
-     * ```
-     */
-    const sequence: <E, A>(data: Readonly<Record<string, Result<E, A>>>) => Result<E, Readonly<Record<string, A>>>;
-}
 declare namespace RecNonEmpty {
     /**
      * Creates a NonEmpty record from a single key-value pair.
@@ -1622,8 +1518,14 @@ declare namespace Rec {
      * ```
      */
     const compact: <A>(data: Readonly<Record<string, Maybe<A>>>) => Readonly<Record<string, A>>;
-    const Maybe: typeof RecMaybe;
-    const Result: typeof RecResult;
+    namespace traverse {
+        const Maybe: <A, B>(f: (a: A) => Maybe<B>) => (data: Readonly<Record<string, A>>) => Maybe<Readonly<Record<string, B>>>;
+        const Result: <E, A, B>(f: (a: A) => Result<E, B>) => (data: Readonly<Record<string, A>>) => Result<E, Readonly<Record<string, B>>>;
+    }
+    namespace sequence {
+        const Maybe: <A>(data: Readonly<Record<string, Maybe<A>>>) => Maybe<Readonly<Record<string, A>>>;
+        const Result: <E, A>(data: Readonly<Record<string, Result<E, A>>>) => Result<E, Readonly<Record<string, A>>>;
+    }
     const NonEmpty: typeof RecNonEmpty;
 }
 

package/dist/utils.js

@@ -982,9 +982,24 @@ var Arr;
     return result;
   };
   Arr2.reduce = (initial, f) => (data) => data.reduce(f, initial);
-  Arr2.Maybe = ArrMaybe;
-  Arr2.Result = ArrResult;
-  Arr2.Task = ArrTask;
+  const _traverseTask = Object.assign((f) => ArrTask.traverse(f), {
+    Result: ArrTaskResult.traverse
+  });
+  const _sequenceTask = Object.assign((data) => ArrTask.sequence(data), {
+    Result: ArrTaskResult.sequence
+  });
+  let traverse;
+  ((traverse2) => {
+    traverse2.Maybe = ArrMaybe.traverse;
+    traverse2.Result = ArrResult.traverse;
+    traverse2.Task = _traverseTask;
+  })(traverse = Arr2.traverse || (Arr2.traverse = {}));
+  let sequence;
+  ((sequence2) => {
+    sequence2.Maybe = ArrMaybe.sequence;
+    sequence2.Result = ArrResult.sequence;
+    sequence2.Task = _sequenceTask;
+  })(sequence = Arr2.sequence || (Arr2.sequence = {}));
   let is;
   ((is2) => {
     is2.empty = (data) => data.length === 0;
@@ -1503,8 +1518,16 @@ var Rec;
     }
     return result;
   };
-  Rec2.Maybe = RecMaybe;
-  Rec2.Result = RecResult;
+  let traverse;
+  ((traverse2) => {
+    traverse2.Maybe = RecMaybe.traverse;
+    traverse2.Result = RecResult.traverse;
+  })(traverse = Rec2.traverse || (Rec2.traverse = {}));
+  let sequence;
+  ((sequence2) => {
+    sequence2.Maybe = RecMaybe.sequence;
+    sequence2.Result = RecResult.sequence;
+  })(sequence = Rec2.sequence || (Rec2.sequence = {}));
   Rec2.NonEmpty = RecNonEmpty;
 })(Rec || (Rec = {}));
 

package/dist/utils.mjs

@@ -5,7 +5,7 @@ import {
   Rec,
   Str,
   Uniq
-} from "./chunk-2LKJF45J.mjs";
+} from "./chunk-W2L244AS.mjs";
 import "./chunk-VSU36S2K.mjs";
 import "./chunk-XTVF5R6R.mjs";
 export {

package/package.json

@@ -1,6 +1,6 @@
 {
 	"name": "@nlozgachev/pipelined",
-	"version": "0.45.0",
+	"version": "0.46.0",
 	"description": "Opinionated functional abstractions for TypeScript",
 	"license": "BSD-3-Clause",
 	"homepage": "https://pipelined.lozgachev.dev",
@@ -53,29 +53,39 @@
 		}
 	},
 	"scripts": {
+		"build": "tsup",
 		"test": "vitest run",
 		"bench": "vitest bench",
-		"build": "tsup",
-		"format": "dprint fmt && dprint fmt --config dprint.md.json \"docs/**/*.md\" \"docs/**/*.mdx\" \"README.md\"",
-		"format:check": "dprint check && dprint check --config dprint.md.json \"docs/**/*.md\" \"docs/**/*.mdx\" \"README.md\"",
+		"size": "size-limit",
 		"typecheck": "tsc --noEmit",
-		"lint": "oxlint src/",
 		"publish:npm": "pnpm build && npm publish --access public",
+		"lint": "oxlint src/",
+		"format": "dprint fmt && dprint fmt --config dprint.md.json \"docs/**/*.md\" \"docs/**/*.mdx\" \"README.md\"",
+		"format:check": "dprint check && dprint check --config dprint.md.json \"docs/**/*.md\" \"docs/**/*.mdx\" \"README.md\"",
 		"release:patch": "bumpp --patch -c -t -p",
 		"release:minor": "bumpp --minor -c -t -p",
 		"docs:dev": "pnpm --filter pipelined-docs dev",
 		"docs:build": "pnpm --filter pipelined-docs build"
 	},
 	"devDependencies": {
+		"@size-limit/file": "12.1.0",
 		"@types/node": "25.9.3",
 		"@vitest/coverage-v8": "4.1.8",
 		"bumpp": "11.1.0",
 		"dprint": "0.54.0",
 		"fast-check": "4.8.0",
 		"oxlint": "1.69.0",
+		"size-limit": "12.1.0",
 		"tsup": "8.5.1",
 		"typescript": "6.0.3",
 		"vitest": "4.1.8"
 	},
+	"size-limit": [
+		{ "path": "dist/index.js", "limit": "25 KB", "gzip": true },
+		{ "path": "dist/core.js", "limit": "15 KB", "gzip": true },
+		{ "path": "dist/composition.js", "limit": "4 KB", "gzip": true },
+		{ "path": "dist/utils.js", "limit": "12 KB", "gzip": true },
+		{ "path": "dist/types.js", "limit": "1 KB", "gzip": true }
+	],
 	"packageManager": "pnpm@11.6.0+sha512.9a36518224080c6fe5165afdcfe79bfa118c29be703f3f462b1e32efe1e98e47e8750b148e08286250aad4113cc7993ca413c4e2cd447752708c2ee5751bc95f"
 }