@nlozgachev/pipelined 0.33.0 → 0.34.0

package/dist/{chunk-W53ZYTLX.mjs → chunk-IJFFWBKW.mjs}

@@ -3,7 +3,7 @@ import {
   Maybe,
   Result,
   Task
-} from "./chunk-GSTKY7MF.mjs";
+} from "./chunk-DLBHVYII.mjs";
 import {
   isNonEmptyList
 } from "./chunk-DBIC62UV.mjs";
@@ -17,35 +17,43 @@ var Arr;
   Arr2.init = (data) => data.length > 0 ? Maybe.some(data.slice(0, -1)) : Maybe.none();
   Arr2.findFirst = (predicate) => (data) => {
     const idx = data.findIndex(predicate);
-    return idx >= 0 ? Maybe.some(data[idx]) : Maybe.none();
+    return idx !== -1 ? Maybe.some(data[idx]) : Maybe.none();
   };
   Arr2.findLast = (predicate) => (data) => {
     for (let i = data.length - 1; i >= 0; i--) {
-      if (predicate(data[i])) return Maybe.some(data[i]);
+      if (predicate(data[i])) {
+        return Maybe.some(data[i]);
+      }
     }
     return Maybe.none();
   };
   Arr2.findIndex = (predicate) => (data) => {
     const idx = data.findIndex(predicate);
-    return idx >= 0 ? Maybe.some(idx) : Maybe.none();
+    return idx !== -1 ? Maybe.some(idx) : Maybe.none();
   };
   Arr2.map = (f) => (data) => {
     const n = data.length;
     const result = new Array(n);
-    for (let i = 0; i < n; i++) result[i] = f(data[i]);
+    for (let i = 0; i < n; i++) {
+      result[i] = f(data[i]);
+    }
     return result;
   };
   Arr2.mapWithIndex = (f) => (data) => {
     const n = data.length;
     const result = new Array(n);
-    for (let i = 0; i < n; i++) result[i] = f(i, data[i]);
+    for (let i = 0; i < n; i++) {
+      result[i] = f(i, data[i]);
+    }
     return result;
   };
   Arr2.filter = (predicate) => (data) => {
     const n = data.length;
     const result = [];
     for (let i = 0; i < n; i++) {
-      if (predicate(data[i])) result.push(data[i]);
+      if (predicate(data[i])) {
+        result.push(data[i]);
+      }
     }
     return result;
   };
@@ -53,7 +61,9 @@ var Arr;
     const result = [];
     for (let i = 0; i < data.length; i++) {
       const mapped = f(data[i]);
-      if (mapped.kind === "Some") result.push(mapped.value);
+      if (mapped.kind === "Some") {
+        result.push(mapped.value);
+      }
     }
     return result;
   };
@@ -103,14 +113,14 @@ var Arr;
     const result = {};
     for (const a of data) {
       const key = f(a);
-      if (!result[key]) result[key] = [];
+      if (!result[key]) {
+        result[key] = [];
+      }
       result[key].push(a);
     }
     return result;
   };
-  Arr2.uniq = (data) => [
-    ...new Set(data)
-  ];
+  Arr2.uniq = (data) => [...new Set(data)];
   Arr2.uniqBy = (f) => (data) => {
     const seen = /* @__PURE__ */ new Set();
     const result = [];
@@ -134,12 +144,16 @@ var Arr;
   };
   Arr2.sortBy = (compare) => (data) => {
     const arr = data;
-    if (typeof arr.toSorted === "function") return arr.toSorted(compare);
-    return [...data].sort(compare);
+    if (typeof arr.toSorted === "function") {
+      return arr.toSorted(compare);
+    }
+    return [...data].toSorted(compare);
   };
   Arr2.sortWith = (ord) => (data) => {
     const arr = data;
-    if (typeof arr.toSorted === "function") return arr.toSorted(ord);
+    if (typeof arr.toSorted === "function") {
+      return arr.toSorted(ord);
+    }
     return [...data].sort(ord);
   };
   Arr2.zip = (other) => (data) => {
@@ -159,7 +173,9 @@ var Arr;
     return result;
   };
   Arr2.intersperse = (sep) => (data) => {
-    if (data.length <= 1) return data;
+    if (data.length <= 1) {
+      return data;
+    }
     const result = [data[0]];
     for (let i = 1; i < data.length; i++) {
       result.push(sep, data[i]);
@@ -167,7 +183,9 @@ var Arr;
     return result;
   };
   Arr2.chunksOf = (n) => (data) => {
-    if (n <= 0) return [];
+    if (n <= 0) {
+      return [];
+    }
     const result = [];
     for (let i = 0; i < data.length; i += n) {
       result.push(data.slice(i, i + n));
@@ -197,7 +215,9 @@ var Arr;
     for (let i = 0; i < n; i++) {
       const chunk = f(data[i]);
       const m = chunk.length;
-      for (let j = 0; j < m; j++) result.push(chunk[j]);
+      for (let j = 0; j < m; j++) {
+        result.push(chunk[j]);
+      }
     }
     return result;
   };
@@ -207,7 +227,9 @@ var Arr;
     const result = new Array(n);
     for (let i = 0; i < n; i++) {
       const mapped = f(data[i]);
-      if (mapped.kind === "None") return Maybe.none();
+      if (mapped.kind === "None") {
+        return Maybe.none();
+      }
       result[i] = mapped.value;
     }
     return Maybe.some(result);
@@ -217,7 +239,9 @@ var Arr;
     const result = new Array(n);
     for (let i = 0; i < n; i++) {
       const mapped = f(data[i]);
-      if (mapped.kind === "Error") return mapped;
+      if (mapped.kind === "Err") {
+        return mapped;
+      }
       result[i] = mapped.value;
     }
     return Result.ok(result);
@@ -230,7 +254,9 @@ var Arr;
     const result = [];
     for (const a of data) {
       const r = await Deferred.toPromise(f(a)());
-      if (Result.isError(r)) return r;
+      if (Result.isErr(r)) {
+        return r;
+      }
       result.push(r.value);
     }
     return Result.ok(result);
@@ -240,27 +266,41 @@ var Arr;
   Arr2.size = (data) => data.length;
   Arr2.some = (predicate) => (data) => {
     const n = data.length;
-    for (let i = 0; i < n; i++) if (predicate(data[i])) return true;
+    for (let i = 0; i < n; i++) {
+      if (predicate(data[i])) {
+        return true;
+      }
+    }
     return false;
   };
   Arr2.every = (predicate) => (data) => {
     const n = data.length;
-    for (let i = 0; i < n; i++) if (!predicate(data[i])) return false;
+    for (let i = 0; i < n; i++) {
+      if (!predicate(data[i])) {
+        return false;
+      }
+    }
     return true;
   };
-  Arr2.reverse = (data) => [...data].reverse();
+  Arr2.reverse = (data) => [...data].toReversed();
   Arr2.insertAt = (index, item) => (data) => {
     const i = Math.max(0, Math.min(index, data.length));
     const arr = data;
-    if (typeof arr.toSpliced === "function") return arr.toSpliced(i, 0, item);
+    if (typeof arr.toSpliced === "function") {
+      return arr.toSpliced(i, 0, item);
+    }
     const result = [...data];
     result.splice(i, 0, item);
     return result;
   };
   Arr2.removeAt = (index) => (data) => {
-    if (index < 0 || index >= data.length) return data;
+    if (index < 0 || index >= data.length) {
+      return data;
+    }
     const arr = data;
-    if (typeof arr.toSpliced === "function") return arr.toSpliced(index, 1);
+    if (typeof arr.toSpliced === "function") {
+      return arr.toSpliced(index, 1);
+    }
     const result = [...data];
     result.splice(index, 1);
     return result;
@@ -270,14 +310,18 @@ var Arr;
   Arr2.takeWhile = (predicate) => (data) => {
     const result = [];
     for (const a of data) {
-      if (!predicate(a)) break;
+      if (!predicate(a)) {
+        break;
+      }
       result.push(a);
     }
     return result;
   };
   Arr2.dropWhile = (predicate) => (data) => {
     let i = 0;
-    while (i < data.length && predicate(data[i])) i++;
+    while (i < data.length && predicate(data[i])) {
+      i++;
+    }
     return data.slice(i);
   };
   Arr2.scan = (initial, f) => (data) => {
@@ -308,8 +352,11 @@ var Dict;
     for (const item of items) {
       const key = keyFn(item);
       const arr = result.get(key);
-      if (arr !== void 0) arr.push(item);
-      else result.set(key, [item]);
+      if (arr !== void 0) {
+        arr.push(item);
+      } else {
+        result.set(key, [item]);
+      }
     }
     return result;
   };
@@ -326,7 +373,9 @@ var Dict;
     return result;
   };
   Dict2.remove = (key) => (m) => {
-    if (!m.has(key)) return m;
+    if (!m.has(key)) {
+      return m;
+    }
     const result = new globalThis.Map(m);
     result.delete(key);
     return result;
@@ -353,21 +402,27 @@ var Dict;
   Dict2.filter = (predicate) => (m) => {
     const result = new globalThis.Map();
     for (const [k, v] of m) {
-      if (predicate(v)) result.set(k, v);
+      if (predicate(v)) {
+        result.set(k, v);
+      }
     }
     return result;
   };
   Dict2.filterWithKey = (predicate) => (m) => {
     const result = new globalThis.Map();
     for (const [k, v] of m) {
-      if (predicate(k, v)) result.set(k, v);
+      if (predicate(k, v)) {
+        result.set(k, v);
+      }
     }
     return result;
   };
   Dict2.compact = (m) => {
     const result = new globalThis.Map();
     for (const [k, v] of m) {
-      if (v.kind === "Some") result.set(k, v.value);
+      if (v.kind === "Some") {
+        result.set(k, v.value);
+      }
     }
     return result;
   };
@@ -375,7 +430,9 @@ var Dict;
     const result = new globalThis.Map();
     for (const [key, value] of m) {
       const mapped = f(value);
-      if (mapped.kind === "Some") result.set(key, mapped.value);
+      if (mapped.kind === "Some") {
+        result.set(key, mapped.value);
+      }
     }
     return result;
   };
@@ -389,14 +446,18 @@ var Dict;
   Dict2.intersection = (other) => (m) => {
     const result = new globalThis.Map();
     for (const [k, v] of m) {
-      if (other.has(k)) result.set(k, v);
+      if (other.has(k)) {
+        result.set(k, v);
+      }
     }
     return result;
   };
   Dict2.difference = (other) => (m) => {
     const result = new globalThis.Map();
     for (const [k, v] of m) {
-      if (!other.has(k)) result.set(k, v);
+      if (!other.has(k)) {
+        result.set(k, v);
+      }
     }
     return result;
   };
@@ -421,7 +482,9 @@ var Dict;
 var Num;
 ((Num2) => {
   Num2.range = (from, to, step = 1) => {
-    if (step <= 0 || from > to) return [];
+    if (step <= 0 || from > to) {
+      return [];
+    }
     const count = Math.floor((to - from) / step) + 1;
     const result = new Array(count);
     for (let i = 0; i < count; i++) {
@@ -432,7 +495,9 @@ var Num;
   Num2.clamp = (min2, max2) => (n) => Math.min(Math.max(n, min2), max2);
   Num2.between = (min2, max2) => (n) => n >= min2 && n <= max2;
   Num2.parse = (s) => {
-    if (s.trim() === "") return Maybe.none();
+    if (s.trim() === "") {
+      return Maybe.none();
+    }
     const n = Number(s);
     return isNaN(n) ? Maybe.none() : Maybe.some(n);
   };
@@ -448,23 +513,33 @@ var Num;
   Num2.remainder = (divisor) => (n) => divisor === 0 ? Maybe.none() : Maybe.some(n % divisor);
   Num2.sum = (ns) => {
     let result = 0;
-    for (let i = 0; i < ns.length; i++) result += ns[i];
+    for (let i = 0; i < ns.length; i++) {
+      result += ns[i];
+    }
     return result;
   };
   Num2.mean = (ns) => ns.length === 0 ? Maybe.none() : Maybe.some((0, Num2.sum)(ns) / ns.length);
   Num2.min = (ns) => {
-    if (ns.length === 0) return Maybe.none();
+    if (ns.length === 0) {
+      return Maybe.none();
+    }
     let [result] = ns;
     for (let i = 1; i < ns.length; i++) {
-      if (ns[i] < result) result = ns[i];
+      if (ns[i] < result) {
+        result = ns[i];
+      }
     }
     return Maybe.some(result);
   };
   Num2.max = (ns) => {
-    if (ns.length === 0) return Maybe.none();
+    if (ns.length === 0) {
+      return Maybe.none();
+    }
     let [result] = ns;
     for (let i = 1; i < ns.length; i++) {
-      if (ns[i] > result) result = ns[i];
+      if (ns[i] > result) {
+        result = ns[i];
+      }
     }
     return Maybe.some(result);
   };
@@ -476,16 +551,33 @@ var Rec;
   Rec2.map = (f) => (data) => {
     const keys2 = Object.keys(data);
     const vals = Object.values(data);
-    const result = {};
+    const result = Object.create(Object.getPrototypeOf(data));
     for (let i = 0; i < keys2.length; i++) {
       Object.defineProperty(result, keys2[i], { value: f(vals[i]), writable: true, enumerable: true, configurable: true });
     }
     return result;
   };
+  Rec2.filterMap = (f) => (data) => {
+    const keys2 = Object.keys(data);
+    const vals = Object.values(data);
+    const result = Object.create(Object.getPrototypeOf(data));
+    for (let i = 0; i < keys2.length; i++) {
+      const maybeVal = f(vals[i]);
+      if (maybeVal.kind === "Some") {
+        Object.defineProperty(result, keys2[i], {
+          value: maybeVal.value,
+          writable: true,
+          enumerable: true,
+          configurable: true
+        });
+      }
+    }
+    return result;
+  };
   Rec2.mapWithKey = (f) => (data) => {
     const keys2 = Object.keys(data);
     const vals = Object.values(data);
-    const result = {};
+    const result = Object.create(Object.getPrototypeOf(data));
     for (let i = 0; i < keys2.length; i++) {
       Object.defineProperty(result, keys2[i], {
         value: f(keys2[i], vals[i]),
@@ -497,10 +589,12 @@ var Rec;
     return result;
   };
   Rec2.filter = (predicate) => (data) => {
-    const result = {};
-    for (const [k, v] of Object.entries(data)) {
-      if (predicate(v)) {
-        Object.defineProperty(result, k, { value: v, writable: true, enumerable: true, configurable: true });
+    const keys2 = Object.keys(data);
+    const vals = Object.values(data);
+    const result = Object.create(Object.getPrototypeOf(data));
+    for (let i = 0; i < keys2.length; i++) {
+      if (predicate(vals[i])) {
+        Object.defineProperty(result, keys2[i], { value: vals[i], writable: true, enumerable: true, configurable: true });
       }
     }
     return result;
@@ -633,8 +727,8 @@ var Str;
   Str2.parseJson = (s) => {
     try {
       return Result.ok(JSON.parse(s));
-    } catch (e) {
-      return Result.error(e);
+    } catch (error) {
+      return Result.err(error);
     }
   };
 })(Str || (Str = {}));
@@ -650,20 +744,28 @@ var Uniq;
   Uniq2.isEmpty = (s) => s.size === 0;
   Uniq2.isSubsetOf = (other) => (s) => {
     const set = s;
-    if (typeof set.isSubsetOf === "function") return set.isSubsetOf(other);
+    if (typeof set.isSubsetOf === "function") {
+      return set.isSubsetOf(other);
+    }
     for (const item of s) {
-      if (!other.has(item)) return false;
+      if (!other.has(item)) {
+        return false;
+      }
     }
     return true;
   };
   Uniq2.insert = (item) => (s) => {
-    if (s.has(item)) return s;
+    if (s.has(item)) {
+      return s;
+    }
     const result = new globalThis.Set(s);
     result.add(item);
     return result;
   };
   Uniq2.remove = (item) => (s) => {
-    if (!s.has(item)) return s;
+    if (!s.has(item)) {
+      return s;
+    }
     const result = new globalThis.Set(s);
     result.delete(item);
     return result;
@@ -678,29 +780,47 @@ var Uniq;
   Uniq2.filter = (predicate) => (s) => {
     const result = new globalThis.Set();
     for (const item of s) {
-      if (predicate(item)) result.add(item);
+      if (predicate(item)) {
+        result.add(item);
+      }
     }
     return result;
   };
   Uniq2.union = (other) => (s) => {
     const set = s;
-    if (typeof set.union === "function") return set.union(other);
+    if (typeof set.union === "function") {
+      return set.union(other);
+    }
     const result = new globalThis.Set(s);
-    for (const item of other) result.add(item);
+    for (const item of other) {
+      result.add(item);
+    }
     return result;
   };
   Uniq2.intersection = (other) => (s) => {
     const set = s;
-    if (typeof set.intersection === "function") return set.intersection(other);
+    if (typeof set.intersection === "function") {
+      return set.intersection(other);
+    }
     const result = new globalThis.Set();
-    for (const item of s) if (other.has(item)) result.add(item);
+    for (const item of s) {
+      if (other.has(item)) {
+        result.add(item);
+      }
+    }
     return result;
   };
   Uniq2.difference = (other) => (s) => {
     const set = s;
-    if (typeof set.difference === "function") return set.difference(other);
+    if (typeof set.difference === "function") {
+      return set.difference(other);
+    }
     const result = new globalThis.Set();
-    for (const item of s) if (!other.has(item)) result.add(item);
+    for (const item of s) {
+      if (!other.has(item)) {
+        result.add(item);
+      }
+    }
     return result;
   };
   Uniq2.reduce = (init, f) => (s) => {

package/dist/composition.d.mts

@@ -144,6 +144,7 @@ declare const flip: <A, B, C>(f: (a: A) => (b: B) => C) => (b: B) => (a: A) => C
  * processUser({ name: "Bob" }); // "Hello, BOB!"
  *
  * // Compare with pipe (one-time use):
+ * const user: User = { name: "Alice" };
  * pipe(
  *   user,
  *   u => u.name,
@@ -363,7 +364,7 @@ declare const on: <A, B, C>(f: (b1: B, b2: B) => C, g: (a: A) => B) => (a: A, b:
  * @example
  * ```ts
  * // Basic usage
- * const result = pipe(
+ * const doubledPlusOne = pipe(
  *   5,
  *   n => n * 2,
  *   n => n + 1
@@ -374,15 +375,15 @@ declare const on: <A, B, C>(f: (b1: B, b2: B) => C, g: (a: A) => B) => (a: A, b:
  *   Maybe.some("Alice"),
  *   Maybe.map(name => name.toUpperCase()),
  *   Maybe.map(name => `Hello, ${name}!`),
- *   Maybe.getOrElse("Hello!")
+ *   Maybe.getOrElse(() => "Hello!")
  * ); // "Hello, ALICE!"
  *
  * // Error handling with Result
- * const result = pipe(
- *   Result.tryCatch(() => JSON.parse(input), e => "Invalid JSON"),
- *   Result.map(data => data.value),
- *   Result.getOrElse(null)
- * );
+ * const parsed = pipe(
+ *   Result.tryCatch(() => JSON.parse('{"value": 42}'), () => "Invalid JSON"),
+ *   Result.map((data: { value: number }) => data.value),
+ *   Result.getOrElse(() => null)
+ * ); // 42
  * ```
  *
  * @see {@link flow} for creating reusable pipelines without an initial value

package/dist/composition.d.ts

@@ -144,6 +144,7 @@ declare const flip: <A, B, C>(f: (a: A) => (b: B) => C) => (b: B) => (a: A) => C
  * processUser({ name: "Bob" }); // "Hello, BOB!"
  *
  * // Compare with pipe (one-time use):
+ * const user: User = { name: "Alice" };
  * pipe(
  *   user,
  *   u => u.name,
@@ -363,7 +364,7 @@ declare const on: <A, B, C>(f: (b1: B, b2: B) => C, g: (a: A) => B) => (a: A, b:
  * @example
  * ```ts
  * // Basic usage
- * const result = pipe(
+ * const doubledPlusOne = pipe(
  *   5,
  *   n => n * 2,
  *   n => n + 1
@@ -374,15 +375,15 @@ declare const on: <A, B, C>(f: (b1: B, b2: B) => C, g: (a: A) => B) => (a: A, b:
  *   Maybe.some("Alice"),
  *   Maybe.map(name => name.toUpperCase()),
  *   Maybe.map(name => `Hello, ${name}!`),
- *   Maybe.getOrElse("Hello!")
+ *   Maybe.getOrElse(() => "Hello!")
  * ); // "Hello, ALICE!"
  *
  * // Error handling with Result
- * const result = pipe(
- *   Result.tryCatch(() => JSON.parse(input), e => "Invalid JSON"),
- *   Result.map(data => data.value),
- *   Result.getOrElse(null)
- * );
+ * const parsed = pipe(
+ *   Result.tryCatch(() => JSON.parse('{"value": 42}'), () => "Invalid JSON"),
+ *   Result.map((data: { value: number }) => data.value),
+ *   Result.getOrElse(() => null)
+ * ); // 42
  * ```
  *
  * @see {@link flow} for creating reusable pipelines without an initial value