@nlozgachev/pipelined 0.47.0 → 0.49.0

package/dist/{chunk-KOYYDQH4.mjs → chunk-5OFVS5UZ.mjs}

@@ -1,6 +1,6 @@
 import {
   Duration
-} from "./chunk-XTVF5R6R.mjs";
+} from "./chunk-DENXUTKL.mjs";
 
 // src/Composition/compose.ts
 function compose(f0, f1, f2, f3, f4, f5, f6, f7, f8, f9) {
@@ -200,6 +200,8 @@ var once = (f) => {
   };
 };
 var defaultTo = (fallback) => (a) => a === null || a === void 0 ? fallback : a;
+var tuple = (f) => (args) => f(...args);
+var untuple = (f) => (...args) => f(args);
 
 // src/Composition/juxt.ts
 function juxt(fns) {
@@ -207,8 +209,9 @@ function juxt(fns) {
 }
 
 // src/Composition/memoize.ts
-var memoize = (f, keyFn = (a) => a) => {
+var memoize = (f, options) => {
   const cache = /* @__PURE__ */ new Map();
+  const keyFn = options?.key ?? ((a) => a);
   return (a) => {
     const key = keyFn(a);
     if (cache.has(key)) {
@@ -434,6 +437,8 @@ export {
   or,
   once,
   defaultTo,
+  tuple,
+  untuple,
   juxt,
   memoize,
   memoizeWeak,

package/dist/{chunk-XTVF5R6R.mjs → chunk-DENXUTKL.mjs}

@@ -26,7 +26,31 @@ var Duration;
   Duration2.subtract = (other) => (self) => wrap(Brand.unwrap(self) - Brand.unwrap(other));
 })(Duration || (Duration = {}));
 
+// src/Types/RetryPolicy.ts
+var RetryPolicy;
+((RetryPolicy2) => {
+  RetryPolicy2.constant = (options) => ({
+    attempts: Math.max(1, options.attempts),
+    getDelay: () => options.delay
+  });
+  RetryPolicy2.exponential = (options) => {
+    const attempts = Math.max(1, options.attempts);
+    const initialMs = Duration.to.milliseconds(options.initial);
+    const factor = options.factor ?? 2;
+    const jitter = options.jitter ?? false;
+    return {
+      attempts,
+      getDelay: (attempt) => {
+        const rawMs = initialMs * factor ** Math.max(0, attempt - 1);
+        const finalMs = jitter ? Math.random() * rawMs : rawMs;
+        return Duration.milliseconds(finalMs);
+      }
+    };
+  };
+})(RetryPolicy || (RetryPolicy = {}));
+
 export {
   Brand,
+  RetryPolicy,
   Duration
 };

package/dist/{chunk-W2L244AS.mjs → chunk-EPT3GYGN.mjs}

@@ -4,7 +4,7 @@ import {
   Result,
   Task,
   isNonEmptyArr
-} from "./chunk-VSU36S2K.mjs";
+} from "./chunk-IHLH2XYQ.mjs";
 
 // src/Data/Arr.ts
 var ArrMaybe;
@@ -391,9 +391,154 @@ var Arr;
     const i = Math.max(0, index);
     return [data.slice(0, i), data.slice(i)];
   };
+  Arr2.partitionMaybe = (f) => (data) => {
+    const failures = [];
+    const successes = [];
+    for (let i = 0; i < data.length; i++) {
+      const res = f(data[i]);
+      if (res.kind === "Some") {
+        successes.push(res.value);
+      } else {
+        failures.push(data[i]);
+      }
+    }
+    return [failures, successes];
+  };
+  Arr2.at = (index) => (data) => {
+    const targetIndex = index < 0 ? data.length + index : index;
+    if (targetIndex < 0 || targetIndex >= data.length) {
+      return Maybe.make.none();
+    }
+    return Maybe.make.some(data[targetIndex]);
+  };
+  Arr2.findMap = (f) => (data) => {
+    for (let i = 0; i < data.length; i++) {
+      const res = f(data[i]);
+      if (res.kind === "Some") {
+        return res;
+      }
+    }
+    return Maybe.make.none();
+  };
+  Arr2.indexBy = (keyFn) => (data) => {
+    const map2 = new globalThis.Map();
+    for (let i = 0; i < data.length; i++) {
+      map2.set(keyFn(data[i]), data[i]);
+    }
+    return map2;
+  };
+  Arr2.frequencies = (data) => {
+    const map2 = new globalThis.Map();
+    for (let i = 0; i < data.length; i++) {
+      const item = data[i];
+      map2.set(item, (map2.get(item) ?? 0) + 1);
+    }
+    return map2;
+  };
+  Arr2.chunkBy = (keyFn) => (data) => {
+    if (data.length === 0) {
+      return [];
+    }
+    const result = [];
+    let currentChunk = [data[0]];
+    let currentKey = keyFn(data[0]);
+    for (let i = 1; i < data.length; i++) {
+      const item = data[i];
+      const key = keyFn(item);
+      if (Object.is(key, currentKey)) {
+        currentChunk.push(item);
+      } else {
+        result.push(currentChunk);
+        currentChunk = [item];
+        currentKey = key;
+      }
+    }
+    result.push(currentChunk);
+    return result;
+  };
+  Arr2.dedupeAdjacent = (eq = (a, b) => Object.is(a, b)) => (data) => {
+    if (data.length === 0) {
+      return [];
+    }
+    const result = [data[0]];
+    for (let i = 1; i < data.length; i++) {
+      if (!eq(data[i], result[result.length - 1])) {
+        result.push(data[i]);
+      }
+    }
+    return result;
+  };
+  Arr2.windowed = (size2, options) => (data) => {
+    const step = options?.step ?? 1;
+    if (size2 <= 0 || step <= 0 || data.length < size2) {
+      return [];
+    }
+    const result = [];
+    for (let i = 0; i <= data.length - size2; i += step) {
+      result.push(data.slice(i, i + size2));
+    }
+    return result;
+  };
+  Arr2.unfold = (initial, f) => {
+    const result = [];
+    let currentState = initial;
+    while (true) {
+      const next = f(currentState);
+      if (next.kind === "None") {
+        break;
+      }
+      const [item, nextState] = next.value;
+      result.push(item);
+      currentState = nextState;
+    }
+    return result;
+  };
   Arr2.NonEmpty = ArrNonEmpty;
 })(Arr || (Arr = {}));
 
+// src/Data/BigNum.ts
+var BigNum;
+((BigNum2) => {
+  let from;
+  ((from2) => {
+    from2.string = (s) => {
+      try {
+        if (s.trim() === "") {
+          return Maybe.make.none();
+        }
+        return Maybe.make.some(BigInt(s));
+      } catch {
+        return Maybe.make.none();
+      }
+    };
+    from2.number = (n) => {
+      if (!Number.isInteger(n) || n < Number.MIN_SAFE_INTEGER || n > Number.MAX_SAFE_INTEGER) {
+        return Maybe.make.none();
+      }
+      return Maybe.make.some(BigInt(n));
+    };
+  })(from = BigNum2.from || (BigNum2.from = {}));
+  let to;
+  ((to2) => {
+    to2.number = (b) => {
+      if (b < BigInt(Number.MIN_SAFE_INTEGER) || b > BigInt(Number.MAX_SAFE_INTEGER)) {
+        return Maybe.make.none();
+      }
+      return Maybe.make.some(Number(b));
+    };
+  })(to = BigNum2.to || (BigNum2.to = {}));
+  BigNum2.add = (b) => (a) => a + b;
+  BigNum2.sub = (b) => (a) => a - b;
+  BigNum2.mul = (b) => (a) => a * b;
+  BigNum2.div = (b) => (a) => b === 0n ? Maybe.make.none() : Maybe.make.some(a / b);
+  BigNum2.mod = (b) => (a) => b === 0n ? Maybe.make.none() : Maybe.make.some(a % b);
+  BigNum2.clamp = (min2, max2) => (a) => a < min2 ? min2 : a > max2 ? max2 : a;
+  BigNum2.inRange = (start, end) => (a) => a >= start && a < end;
+  BigNum2.abs = (a) => a < 0n ? -a : a;
+  BigNum2.min = (b) => (a) => a < b ? a : b;
+  BigNum2.max = (b) => (a) => a > b ? a : b;
+})(BigNum || (BigNum = {}));
+
 // src/Data/Dict.ts
 var DictNonEmpty;
 ((DictNonEmpty2) => {
@@ -550,16 +695,86 @@ var Dict;
     }
     return acc;
   };
+  function mergeWith(combine) {
+    return (arg1, arg2) => {
+      if (arg2 !== void 0) {
+        const first = arg1;
+        const second2 = arg2;
+        const res = new globalThis.Map(first);
+        for (const [k, v] of second2) {
+          if (res.has(k)) {
+            res.set(k, combine(res.get(k), v));
+          } else {
+            res.set(k, v);
+          }
+        }
+        return res;
+      }
+      const second = arg1;
+      return (first) => {
+        const res = new globalThis.Map(first);
+        for (const [k, v] of second) {
+          if (res.has(k)) {
+            res.set(k, combine(res.get(k), v));
+          } else {
+            res.set(k, v);
+          }
+        }
+        return res;
+      };
+    };
+  }
+  Dict2.mergeWith = mergeWith;
   let to;
   ((to2) => {
     to2.Record = (m) => Object.fromEntries(m);
   })(to = Dict2.to || (Dict2.to = {}));
+  Dict2.mapEntries = (f) => (data) => {
+    const res = new globalThis.Map();
+    for (const [k, v] of data) {
+      const [nk, nv] = f(k, v);
+      res.set(nk, nv);
+    }
+    return res;
+  };
+  Dict2.mapKeys = (f) => (data) => {
+    const res = new globalThis.Map();
+    for (const [k, v] of data) {
+      res.set(f(k), v);
+    }
+    return res;
+  };
   Dict2.NonEmpty = DictNonEmpty;
 })(Dict || (Dict = {}));
 
+// src/Data/Json.ts
+var isSyntaxError = (err) => typeof err === "object" && err !== null && "name" in err && err.name === "SyntaxError";
+var isTypeError = (err) => typeof err === "object" && err !== null && "name" in err && err.name === "TypeError";
+var Json;
+((Json2) => {
+  Json2.parse = (text) => Result.tryCatch(() => JSON.parse(text), {
+    onError: (err) => isSyntaxError(err) ? err : new SyntaxError(String(err))
+  });
+  Json2.stringify = (value, replacer, space) => Result.tryCatch(() => JSON.stringify(value, replacer, space), {
+    onError: (err) => isTypeError(err) ? err : new TypeError(String(err))
+  });
+})(Json || (Json = {}));
+
 // src/Data/Num.ts
 var Num;
 ((Num2) => {
+  let is;
+  ((is2) => {
+    is2.zero = (n) => n === 0;
+    is2.integer = (n) => Number.isInteger(n);
+    is2.float = (n) => Number.isFinite(n) && !Number.isInteger(n);
+    is2.finite = (n) => Number.isFinite(n);
+    is2.nan = (n) => Number.isNaN(n);
+    is2.even = (n) => Number.isInteger(n) && n % 2 === 0;
+    is2.odd = (n) => Number.isInteger(n) && n % 2 !== 0;
+    is2.positive = (n) => n > 0;
+    is2.negative = (n) => n < 0;
+  })(is = Num2.is || (Num2.is = {}));
   Num2.range = (from, to, step = 1) => {
     if (step <= 0 || from > to) {
       return [];
@@ -623,6 +838,7 @@ var Num;
     }
     return Maybe.make.some(result);
   };
+  Num2.format = (options, locales) => (n) => !Number.isFinite(n) ? Maybe.make.none() : Maybe.make.some(new Intl.NumberFormat(locales, options).format(n));
 })(Num || (Num = {}));
 
 // src/Data/Rec.ts
@@ -810,6 +1026,36 @@ var Rec;
     ...data,
     ...other
   });
+  function mergeWith(combine) {
+    return (arg1, arg2) => {
+      if (arg2 !== void 0) {
+        const first = arg1;
+        const second2 = arg2;
+        const result = { ...first };
+        for (const [k, v] of Object.entries(second2)) {
+          if (Object.hasOwn(result, k)) {
+            result[k] = combine(result[k], v);
+          } else {
+            result[k] = v;
+          }
+        }
+        return result;
+      }
+      const second = arg1;
+      return (first) => {
+        const result = { ...first };
+        for (const [k, v] of Object.entries(second)) {
+          if (Object.hasOwn(result, k)) {
+            result[k] = combine(result[k], v);
+          } else {
+            result[k] = v;
+          }
+        }
+        return result;
+      };
+    };
+  }
+  Rec2.mergeWith = mergeWith;
   Rec2.size = (data) => Object.keys(data).length;
   Rec2.mapKeys = (f) => (data) => {
     const result = {};
@@ -827,6 +1073,25 @@ var Rec;
     }
     return result;
   };
+  Rec2.mapEntries = (f) => (data) => {
+    const result = {};
+    for (const [k, v] of Object.entries(data)) {
+      const [newKey, newVal] = f(k, v);
+      Object.defineProperty(result, newKey, { value: newVal, writable: true, enumerable: true, configurable: true });
+    }
+    return result;
+  };
+  Rec2.updateIn = (path, f) => (data) => {
+    const updateNode = (obj, keys2) => {
+      const [head, ...tail] = keys2;
+      if (tail.length === 0) {
+        return { ...obj, [head]: f(obj?.[head]) };
+      }
+      const child = obj && typeof obj === "object" && head in obj ? obj[head] : {};
+      return { ...obj, [head]: updateNode(child, tail) };
+    };
+    return updateNode(data, path);
+  };
   let traverse;
   ((traverse2) => {
     traverse2.Maybe = RecMaybe.traverse;
@@ -909,6 +1174,17 @@ var Str;
       return Result.make.err(error);
     }
   };
+  Str2.uncapitalize = (s) => s.length === 0 ? "" : s.charAt(0).toLowerCase() + s.slice(1);
+  Str2.truncate = (options) => (s) => {
+    const { length: targetLength, suffix = "..." } = options;
+    if (s.length <= targetLength) {
+      return s;
+    }
+    if (targetLength <= suffix.length) {
+      return suffix.slice(0, targetLength);
+    }
+    return s.slice(0, targetLength - suffix.length) + suffix;
+  };
   Str2.NonEmpty = StrNonEmpty;
 })(Str || (Str = {}));
 
@@ -1039,7 +1315,9 @@ var Uniq;
 
 export {
   Arr,
+  BigNum,
   Dict,
+  Json,
   Num,
   Rec,
   Str,