@nlozgachev/pipelined 0.16.0 → 0.18.0

package/dist/utils.d.mts

@@ -1,10 +1,10 @@
-import { a as Option, R as Result, T as Task } from './Task-Bd3gXPRQ.mjs';
+import { M as Maybe, R as Result, T as Task } from './Task-DBW4nOZR.mjs';
 import { N as NonEmptyList } from './NonEmptyList-BlGFjor5.mjs';
 
 /**
  * Functional array utilities that compose well with pipe.
  * All functions are data-last and curried where applicable.
- * Safe access functions return Option instead of throwing or returning undefined.
+ * Safe access functions return Maybe instead of throwing or returning undefined.
  *
  * @example
  * ```ts
@@ -26,7 +26,7 @@ declare namespace Arr {
      * Arr.head([]); // None
      * ```
      */
-    const head: <A>(data: readonly A[]) => Option<A>;
+    const head: <A>(data: readonly A[]) => Maybe<A>;
     /**
      * Returns the last element of an array, or None if the array is empty.
      *
@@ -36,7 +36,7 @@ declare namespace Arr {
      * Arr.last([]); // None
      * ```
      */
-    const last: <A>(data: readonly A[]) => Option<A>;
+    const last: <A>(data: readonly A[]) => Maybe<A>;
     /**
      * Returns all elements except the first, or None if the array is empty.
      *
@@ -46,7 +46,7 @@ declare namespace Arr {
      * Arr.tail([]); // None
      * ```
      */
-    const tail: <A>(data: readonly A[]) => Option<readonly A[]>;
+    const tail: <A>(data: readonly A[]) => Maybe<readonly A[]>;
     /**
      * Returns all elements except the last, or None if the array is empty.
      *
@@ -56,7 +56,7 @@ declare namespace Arr {
      * Arr.init([]); // None
      * ```
      */
-    const init: <A>(data: readonly A[]) => Option<readonly A[]>;
+    const init: <A>(data: readonly A[]) => Maybe<readonly A[]>;
     /**
      * Returns the first element matching the predicate, or None.
      *
@@ -65,7 +65,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[]) => Option<A>;
+    const findFirst: <A>(predicate: (a: A) => boolean) => (data: readonly A[]) => Maybe<A>;
     /**
      * Returns the last element matching the predicate, or None.
      *
@@ -74,7 +74,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[]) => Option<A>;
+    const findLast: <A>(predicate: (a: A) => boolean) => (data: readonly A[]) => Maybe<A>;
     /**
      * Returns the index of the first element matching the predicate, or None.
      *
@@ -83,7 +83,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[]) => Option<number>;
+    const findIndex: <A>(predicate: (a: A) => boolean) => (data: readonly A[]) => Maybe<number>;
     /**
      * Transforms each element of an array.
      *
@@ -219,21 +219,21 @@ declare namespace Arr {
      */
     const reduce: <A, B>(initial: B, f: (acc: B, a: A) => B) => (data: readonly A[]) => B;
     /**
-     * Maps each element to an Option and collects the results.
+     * Maps each element to an Maybe and collects the results.
      * Returns None if any mapping returns None.
      *
      * @example
      * ```ts
-     * const parseNum = (s: string): Option<number> => {
+     * const parseNum = (s: string): Maybe<number> => {
      *   const n = Number(s);
-     *   return isNaN(n) ? Option.none() : Option.some(n);
+     *   return isNaN(n) ? Maybe.none() : Maybe.some(n);
      * };
      *
      * pipe(["1", "2", "3"], Arr.traverse(parseNum)); // Some([1, 2, 3])
      * pipe(["1", "x", "3"], Arr.traverse(parseNum)); // None
      * ```
      */
-    const traverse: <A, B>(f: (a: A) => Option<B>) => (data: readonly A[]) => Option<readonly B[]>;
+    const traverse: <A, B>(f: (a: A) => Maybe<B>) => (data: readonly A[]) => Maybe<readonly B[]>;
     /**
      * Maps each element to a Result and collects the results.
      * Returns the first Err if any mapping fails.
@@ -260,16 +260,16 @@ declare namespace Arr {
      */
     const traverseTask: <A, B>(f: (a: A) => Task<B>) => (data: readonly A[]) => Task<readonly B[]>;
     /**
-     * Collects an array of Options into an Option of array.
+     * Collects an array of Options into an Maybe of array.
      * Returns None if any element is None.
      *
      * @example
      * ```ts
-     * Arr.sequence([Option.some(1), Option.some(2)]); // Some([1, 2])
-     * Arr.sequence([Option.some(1), Option.none()]); // None
+     * Arr.sequence([Maybe.some(1), Maybe.some(2)]); // Some([1, 2])
+     * Arr.sequence([Maybe.some(1), Maybe.none()]); // None
      * ```
      */
-    const sequence: <A>(data: readonly Option<A>[]) => Option<readonly A[]>;
+    const sequence: <A>(data: readonly Maybe<A>[]) => Maybe<readonly A[]>;
     /**
      * Collects an array of Results into a Result of array.
      * Returns the first Err if any element is Err.
@@ -340,6 +340,30 @@ declare namespace Arr {
      * ```
      */
     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.
+     *
+     * @example
+     * ```ts
+     * pipe([1, 2, 3], Arr.insertAt(1, 99)); // [1, 99, 2, 3]
+     * pipe([1, 2, 3], Arr.insertAt(0, 99)); // [99, 1, 2, 3]
+     * pipe([1, 2, 3], Arr.insertAt(3, 99)); // [1, 2, 3, 99]
+     * ```
+     */
+    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.
+     *
+     * @example
+     * ```ts
+     * pipe([1, 2, 3], Arr.removeAt(1)); // [1, 3]
+     * pipe([1, 2, 3], Arr.removeAt(0)); // [2, 3]
+     * pipe([1, 2, 3], Arr.removeAt(5)); // [1, 2, 3]
+     * ```
+     */
+    const removeAt: (index: number) => <A>(data: readonly A[]) => readonly A[];
     /**
      * Takes the first n elements from an array.
      *
@@ -405,7 +429,7 @@ declare namespace Arr {
  * and data-last — they compose naturally with `pipe`.
  *
  * Unlike plain objects (`Rec`), dictionaries support any key type, preserve insertion order, and
- * make membership checks explicit via `lookup` returning `Option`.
+ * make membership checks explicit via `lookup` returning `Maybe`.
  *
  * @example
  * ```ts
@@ -491,7 +515,7 @@ declare namespace Dict {
      * pipe(Dict.fromEntries([["a", 1]]), Dict.lookup("b")); // None
      * ```
      */
-    const lookup: <K>(key: K) => <V>(m: ReadonlyMap<K, V>) => Option<V>;
+    const lookup: <K>(key: K) => <V>(m: ReadonlyMap<K, V>) => Maybe<V>;
     /**
      * Returns the number of entries in the dictionary.
      *
@@ -567,14 +591,14 @@ declare namespace Dict {
      *
      * @example
      * ```ts
-     * import { Option } from "@nlozgachev/pipelined/core";
+     * import { Maybe } from "@nlozgachev/pipelined/core";
      *
-     * const increment = (opt: Option<number>) => Option.getOrElse(() => 0)(opt) + 1;
+     * const increment = (opt: Maybe<number>) => Maybe.getOrElse(() => 0)(opt) + 1;
      * pipe(Dict.fromEntries([["views", 5]]), Dict.upsert("views", increment)); // { views: 6 }
      * pipe(Dict.fromEntries([["views", 5]]), Dict.upsert("likes", increment)); // { views: 5, likes: 1 }
      * ```
      */
-    const upsert: <K, V>(key: K, f: (existing: Option<V>) => V) => (m: ReadonlyMap<K, V>) => ReadonlyMap<K, V>;
+    const upsert: <K, V>(key: K, f: (existing: Maybe<V>) => V) => (m: ReadonlyMap<K, V>) => ReadonlyMap<K, V>;
     /**
      * Transforms each value in the dictionary.
      *
@@ -617,22 +641,22 @@ declare namespace Dict {
      */
     const filterWithKey: <K, A>(predicate: (key: K, a: A) => boolean) => (m: ReadonlyMap<K, A>) => ReadonlyMap<K, A>;
     /**
-     * Removes all `None` values from a `ReadonlyMap<K, Option<A>>`, returning a plain
+     * Removes all `None` values from a `ReadonlyMap<K, Maybe<A>>`, returning a plain
      * `ReadonlyMap<K, A>`. Useful when building dictionaries from fallible lookups.
      *
      * @example
      * ```ts
-     * import { Option } from "@nlozgachev/pipelined/core";
+     * import { Maybe } from "@nlozgachev/pipelined/core";
      *
      * Dict.compact(Dict.fromEntries([
-     *   ["a", Option.some(1)],
-     *   ["b", Option.none()],
-     *   ["c", Option.some(3)],
+     *   ["a", Maybe.some(1)],
+     *   ["b", Maybe.none()],
+     *   ["c", Maybe.some(3)],
      * ]));
      * // ReadonlyMap { "a" => 1, "c" => 3 }
      * ```
      */
-    const compact: <K, A>(m: ReadonlyMap<K, Option<A>>) => ReadonlyMap<K, A>;
+    const compact: <K, A>(m: ReadonlyMap<K, Maybe<A>>) => ReadonlyMap<K, A>;
     /**
      * Merges two dictionaries. When both contain the same key, the value from `other` takes
      * precedence.
@@ -775,7 +799,7 @@ declare namespace Num {
      * Num.parse("");     // None
      * ```
      */
-    const parse: (s: string) => Option<number>;
+    const parse: (s: string) => Maybe<number>;
     /**
      * Adds `b` to a number. Data-last: use in `pipe` or `Arr.map`.
      *
@@ -871,7 +895,7 @@ declare namespace Rec {
      */
     const filterWithKey: <A>(predicate: (key: string, a: A) => boolean) => (data: Readonly<Record<string, A>>) => Readonly<Record<string, A>>;
     /**
-     * Looks up a value by key, returning Option.
+     * Looks up a value by key, returning Maybe.
      *
      * @example
      * ```ts
@@ -879,19 +903,19 @@ declare namespace Rec {
      * pipe({ a: 1, b: 2 }, Rec.lookup("c")); // None
      * ```
      */
-    const lookup: (key: string) => <A>(data: Readonly<Record<string, A>>) => Option<A>;
+    const lookup: <K extends string>(key: K) => <V>(data: Record<string, V>) => Maybe<V>;
     /**
      * Returns all keys of a record.
      */
-    const keys: <A>(data: Readonly<Record<string, A>>) => readonly string[];
+    const keys: <T extends Record<string, unknown>>(data: T) => readonly (keyof T & string)[];
     /**
      * Returns all values of a record.
      */
-    const values: <A>(data: Readonly<Record<string, A>>) => readonly A[];
+    const values: <T extends Record<string, unknown>>(data: T) => readonly T[keyof T & string][];
     /**
      * Returns all key-value pairs of a record.
      */
-    const entries: <A>(data: Readonly<Record<string, A>>) => readonly (readonly [string, A])[];
+    const entries: <T extends Record<string, unknown>>(data: T) => readonly (readonly [keyof T, T[keyof T]])[];
     /**
      * Creates a record from key-value pairs.
      *
@@ -964,21 +988,21 @@ declare namespace Rec {
      */
     const mapKeys: (f: (key: string) => string) => <A>(data: Readonly<Record<string, A>>) => Readonly<Record<string, A>>;
     /**
-     * Removes all `None` values from a `Record<string, Option<A>>`, returning a plain `Record<string, A>`.
+     * Removes all `None` values from a `Record<string, Maybe<A>>`, returning a plain `Record<string, A>`.
      * Useful when building records from fallible lookups.
      *
      * @example
      * ```ts
-     * Rec.compact({ a: Option.some(1), b: Option.none(), c: Option.some(3) });
+     * Rec.compact({ a: Maybe.some(1), b: Maybe.none(), c: Maybe.some(3) });
      * // { a: 1, c: 3 }
      * ```
      */
-    const compact: <A>(data: Readonly<Record<string, Option<A>>>) => Readonly<Record<string, A>>;
+    const compact: <A>(data: Readonly<Record<string, Maybe<A>>>) => Readonly<Record<string, A>>;
 }
 
 /**
  * String utilities. All transformation functions are data-last and curried so they
- * compose naturally with `pipe`. Safe parsers return `Option` instead of `NaN`.
+ * compose naturally with `pipe`. Safe parsers return `Maybe` instead of `NaN`.
  *
  * @example
  * ```ts
@@ -1075,7 +1099,7 @@ declare namespace Str {
      */
     const words: (s: string) => readonly string[];
     /**
-     * Safe number parsers that return `Option` instead of `NaN`.
+     * Safe number parsers that return `Maybe` instead of `NaN`.
      */
     const parse: {
         /**
@@ -1088,7 +1112,7 @@ declare namespace Str {
          * Str.parse.int("abc");  // None
          * ```
          */
-        int: (s: string) => Option<number>;
+        int: (s: string) => Maybe<number>;
         /**
          * Parses a string as a floating-point number. Returns `None` if the result is `NaN`.
          *
@@ -1099,7 +1123,7 @@ declare namespace Str {
          * Str.parse.float("abc");  // None
          * ```
          */
-        float: (s: string) => Option<number>;
+        float: (s: string) => Maybe<number>;
     };
 }
 

package/dist/utils.d.ts

@@ -1,10 +1,10 @@
-import { a as Option, R as Result, T as Task } from './Task-BjAkkD6t.js';
+import { M as Maybe, R as Result, T as Task } from './Task-DUdIQm-Q.js';
 import { N as NonEmptyList } from './NonEmptyList-BlGFjor5.js';
 
 /**
  * Functional array utilities that compose well with pipe.
  * All functions are data-last and curried where applicable.
- * Safe access functions return Option instead of throwing or returning undefined.
+ * Safe access functions return Maybe instead of throwing or returning undefined.
  *
  * @example
  * ```ts
@@ -26,7 +26,7 @@ declare namespace Arr {
      * Arr.head([]); // None
      * ```
      */
-    const head: <A>(data: readonly A[]) => Option<A>;
+    const head: <A>(data: readonly A[]) => Maybe<A>;
     /**
      * Returns the last element of an array, or None if the array is empty.
      *
@@ -36,7 +36,7 @@ declare namespace Arr {
      * Arr.last([]); // None
      * ```
      */
-    const last: <A>(data: readonly A[]) => Option<A>;
+    const last: <A>(data: readonly A[]) => Maybe<A>;
     /**
      * Returns all elements except the first, or None if the array is empty.
      *
@@ -46,7 +46,7 @@ declare namespace Arr {
      * Arr.tail([]); // None
      * ```
      */
-    const tail: <A>(data: readonly A[]) => Option<readonly A[]>;
+    const tail: <A>(data: readonly A[]) => Maybe<readonly A[]>;
     /**
      * Returns all elements except the last, or None if the array is empty.
      *
@@ -56,7 +56,7 @@ declare namespace Arr {
      * Arr.init([]); // None
      * ```
      */
-    const init: <A>(data: readonly A[]) => Option<readonly A[]>;
+    const init: <A>(data: readonly A[]) => Maybe<readonly A[]>;
     /**
      * Returns the first element matching the predicate, or None.
      *
@@ -65,7 +65,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[]) => Option<A>;
+    const findFirst: <A>(predicate: (a: A) => boolean) => (data: readonly A[]) => Maybe<A>;
     /**
      * Returns the last element matching the predicate, or None.
      *
@@ -74,7 +74,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[]) => Option<A>;
+    const findLast: <A>(predicate: (a: A) => boolean) => (data: readonly A[]) => Maybe<A>;
     /**
      * Returns the index of the first element matching the predicate, or None.
      *
@@ -83,7 +83,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[]) => Option<number>;
+    const findIndex: <A>(predicate: (a: A) => boolean) => (data: readonly A[]) => Maybe<number>;
     /**
      * Transforms each element of an array.
      *
@@ -219,21 +219,21 @@ declare namespace Arr {
      */
     const reduce: <A, B>(initial: B, f: (acc: B, a: A) => B) => (data: readonly A[]) => B;
     /**
-     * Maps each element to an Option and collects the results.
+     * Maps each element to an Maybe and collects the results.
      * Returns None if any mapping returns None.
      *
      * @example
      * ```ts
-     * const parseNum = (s: string): Option<number> => {
+     * const parseNum = (s: string): Maybe<number> => {
      *   const n = Number(s);
-     *   return isNaN(n) ? Option.none() : Option.some(n);
+     *   return isNaN(n) ? Maybe.none() : Maybe.some(n);
      * };
      *
      * pipe(["1", "2", "3"], Arr.traverse(parseNum)); // Some([1, 2, 3])
      * pipe(["1", "x", "3"], Arr.traverse(parseNum)); // None
      * ```
      */
-    const traverse: <A, B>(f: (a: A) => Option<B>) => (data: readonly A[]) => Option<readonly B[]>;
+    const traverse: <A, B>(f: (a: A) => Maybe<B>) => (data: readonly A[]) => Maybe<readonly B[]>;
     /**
      * Maps each element to a Result and collects the results.
      * Returns the first Err if any mapping fails.
@@ -260,16 +260,16 @@ declare namespace Arr {
      */
     const traverseTask: <A, B>(f: (a: A) => Task<B>) => (data: readonly A[]) => Task<readonly B[]>;
     /**
-     * Collects an array of Options into an Option of array.
+     * Collects an array of Options into an Maybe of array.
      * Returns None if any element is None.
      *
      * @example
      * ```ts
-     * Arr.sequence([Option.some(1), Option.some(2)]); // Some([1, 2])
-     * Arr.sequence([Option.some(1), Option.none()]); // None
+     * Arr.sequence([Maybe.some(1), Maybe.some(2)]); // Some([1, 2])
+     * Arr.sequence([Maybe.some(1), Maybe.none()]); // None
      * ```
      */
-    const sequence: <A>(data: readonly Option<A>[]) => Option<readonly A[]>;
+    const sequence: <A>(data: readonly Maybe<A>[]) => Maybe<readonly A[]>;
     /**
      * Collects an array of Results into a Result of array.
      * Returns the first Err if any element is Err.
@@ -340,6 +340,30 @@ declare namespace Arr {
      * ```
      */
     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.
+     *
+     * @example
+     * ```ts
+     * pipe([1, 2, 3], Arr.insertAt(1, 99)); // [1, 99, 2, 3]
+     * pipe([1, 2, 3], Arr.insertAt(0, 99)); // [99, 1, 2, 3]
+     * pipe([1, 2, 3], Arr.insertAt(3, 99)); // [1, 2, 3, 99]
+     * ```
+     */
+    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.
+     *
+     * @example
+     * ```ts
+     * pipe([1, 2, 3], Arr.removeAt(1)); // [1, 3]
+     * pipe([1, 2, 3], Arr.removeAt(0)); // [2, 3]
+     * pipe([1, 2, 3], Arr.removeAt(5)); // [1, 2, 3]
+     * ```
+     */
+    const removeAt: (index: number) => <A>(data: readonly A[]) => readonly A[];
     /**
      * Takes the first n elements from an array.
      *
@@ -405,7 +429,7 @@ declare namespace Arr {
  * and data-last — they compose naturally with `pipe`.
  *
  * Unlike plain objects (`Rec`), dictionaries support any key type, preserve insertion order, and
- * make membership checks explicit via `lookup` returning `Option`.
+ * make membership checks explicit via `lookup` returning `Maybe`.
  *
  * @example
  * ```ts
@@ -491,7 +515,7 @@ declare namespace Dict {
      * pipe(Dict.fromEntries([["a", 1]]), Dict.lookup("b")); // None
      * ```
      */
-    const lookup: <K>(key: K) => <V>(m: ReadonlyMap<K, V>) => Option<V>;
+    const lookup: <K>(key: K) => <V>(m: ReadonlyMap<K, V>) => Maybe<V>;
     /**
      * Returns the number of entries in the dictionary.
      *
@@ -567,14 +591,14 @@ declare namespace Dict {
      *
      * @example
      * ```ts
-     * import { Option } from "@nlozgachev/pipelined/core";
+     * import { Maybe } from "@nlozgachev/pipelined/core";
      *
-     * const increment = (opt: Option<number>) => Option.getOrElse(() => 0)(opt) + 1;
+     * const increment = (opt: Maybe<number>) => Maybe.getOrElse(() => 0)(opt) + 1;
      * pipe(Dict.fromEntries([["views", 5]]), Dict.upsert("views", increment)); // { views: 6 }
      * pipe(Dict.fromEntries([["views", 5]]), Dict.upsert("likes", increment)); // { views: 5, likes: 1 }
      * ```
      */
-    const upsert: <K, V>(key: K, f: (existing: Option<V>) => V) => (m: ReadonlyMap<K, V>) => ReadonlyMap<K, V>;
+    const upsert: <K, V>(key: K, f: (existing: Maybe<V>) => V) => (m: ReadonlyMap<K, V>) => ReadonlyMap<K, V>;
     /**
      * Transforms each value in the dictionary.
      *
@@ -617,22 +641,22 @@ declare namespace Dict {
      */
     const filterWithKey: <K, A>(predicate: (key: K, a: A) => boolean) => (m: ReadonlyMap<K, A>) => ReadonlyMap<K, A>;
     /**
-     * Removes all `None` values from a `ReadonlyMap<K, Option<A>>`, returning a plain
+     * Removes all `None` values from a `ReadonlyMap<K, Maybe<A>>`, returning a plain
      * `ReadonlyMap<K, A>`. Useful when building dictionaries from fallible lookups.
      *
      * @example
      * ```ts
-     * import { Option } from "@nlozgachev/pipelined/core";
+     * import { Maybe } from "@nlozgachev/pipelined/core";
      *
      * Dict.compact(Dict.fromEntries([
-     *   ["a", Option.some(1)],
-     *   ["b", Option.none()],
-     *   ["c", Option.some(3)],
+     *   ["a", Maybe.some(1)],
+     *   ["b", Maybe.none()],
+     *   ["c", Maybe.some(3)],
      * ]));
      * // ReadonlyMap { "a" => 1, "c" => 3 }
      * ```
      */
-    const compact: <K, A>(m: ReadonlyMap<K, Option<A>>) => ReadonlyMap<K, A>;
+    const compact: <K, A>(m: ReadonlyMap<K, Maybe<A>>) => ReadonlyMap<K, A>;
     /**
      * Merges two dictionaries. When both contain the same key, the value from `other` takes
      * precedence.
@@ -775,7 +799,7 @@ declare namespace Num {
      * Num.parse("");     // None
      * ```
      */
-    const parse: (s: string) => Option<number>;
+    const parse: (s: string) => Maybe<number>;
     /**
      * Adds `b` to a number. Data-last: use in `pipe` or `Arr.map`.
      *
@@ -871,7 +895,7 @@ declare namespace Rec {
      */
     const filterWithKey: <A>(predicate: (key: string, a: A) => boolean) => (data: Readonly<Record<string, A>>) => Readonly<Record<string, A>>;
     /**
-     * Looks up a value by key, returning Option.
+     * Looks up a value by key, returning Maybe.
      *
      * @example
      * ```ts
@@ -879,19 +903,19 @@ declare namespace Rec {
      * pipe({ a: 1, b: 2 }, Rec.lookup("c")); // None
      * ```
      */
-    const lookup: (key: string) => <A>(data: Readonly<Record<string, A>>) => Option<A>;
+    const lookup: <K extends string>(key: K) => <V>(data: Record<string, V>) => Maybe<V>;
     /**
      * Returns all keys of a record.
      */
-    const keys: <A>(data: Readonly<Record<string, A>>) => readonly string[];
+    const keys: <T extends Record<string, unknown>>(data: T) => readonly (keyof T & string)[];
     /**
      * Returns all values of a record.
      */
-    const values: <A>(data: Readonly<Record<string, A>>) => readonly A[];
+    const values: <T extends Record<string, unknown>>(data: T) => readonly T[keyof T & string][];
     /**
      * Returns all key-value pairs of a record.
      */
-    const entries: <A>(data: Readonly<Record<string, A>>) => readonly (readonly [string, A])[];
+    const entries: <T extends Record<string, unknown>>(data: T) => readonly (readonly [keyof T, T[keyof T]])[];
     /**
      * Creates a record from key-value pairs.
      *
@@ -964,21 +988,21 @@ declare namespace Rec {
      */
     const mapKeys: (f: (key: string) => string) => <A>(data: Readonly<Record<string, A>>) => Readonly<Record<string, A>>;
     /**
-     * Removes all `None` values from a `Record<string, Option<A>>`, returning a plain `Record<string, A>`.
+     * Removes all `None` values from a `Record<string, Maybe<A>>`, returning a plain `Record<string, A>`.
      * Useful when building records from fallible lookups.
      *
      * @example
      * ```ts
-     * Rec.compact({ a: Option.some(1), b: Option.none(), c: Option.some(3) });
+     * Rec.compact({ a: Maybe.some(1), b: Maybe.none(), c: Maybe.some(3) });
      * // { a: 1, c: 3 }
      * ```
      */
-    const compact: <A>(data: Readonly<Record<string, Option<A>>>) => Readonly<Record<string, A>>;
+    const compact: <A>(data: Readonly<Record<string, Maybe<A>>>) => Readonly<Record<string, A>>;
 }
 
 /**
  * String utilities. All transformation functions are data-last and curried so they
- * compose naturally with `pipe`. Safe parsers return `Option` instead of `NaN`.
+ * compose naturally with `pipe`. Safe parsers return `Maybe` instead of `NaN`.
  *
  * @example
  * ```ts
@@ -1075,7 +1099,7 @@ declare namespace Str {
      */
     const words: (s: string) => readonly string[];
     /**
-     * Safe number parsers that return `Option` instead of `NaN`.
+     * Safe number parsers that return `Maybe` instead of `NaN`.
      */
     const parse: {
         /**
@@ -1088,7 +1112,7 @@ declare namespace Str {
          * Str.parse.int("abc");  // None
          * ```
          */
-        int: (s: string) => Option<number>;
+        int: (s: string) => Maybe<number>;
         /**
          * Parses a string as a floating-point number. Returns `None` if the result is `NaN`.
          *
@@ -1099,7 +1123,7 @@ declare namespace Str {
          * Str.parse.float("abc");  // None
          * ```
          */
-        float: (s: string) => Option<number>;
+        float: (s: string) => Maybe<number>;
     };
 }