@nlozgachev/pipelined 0.11.0 → 0.13.0

package/dist/utils.js

@@ -0,0 +1,722 @@
+"use strict";
+var __defProp = Object.defineProperty;
+var __getOwnPropDesc = Object.getOwnPropertyDescriptor;
+var __getOwnPropNames = Object.getOwnPropertyNames;
+var __hasOwnProp = Object.prototype.hasOwnProperty;
+var __export = (target, all) => {
+  for (var name in all)
+    __defProp(target, name, { get: all[name], enumerable: true });
+};
+var __copyProps = (to, from, except, desc) => {
+  if (from && typeof from === "object" || typeof from === "function") {
+    for (let key of __getOwnPropNames(from))
+      if (!__hasOwnProp.call(to, key) && key !== except)
+        __defProp(to, key, { get: () => from[key], enumerable: !(desc = __getOwnPropDesc(from, key)) || desc.enumerable });
+  }
+  return to;
+};
+var __toCommonJS = (mod) => __copyProps(__defProp({}, "__esModule", { value: true }), mod);
+
+// src/Utils/index.ts
+var Utils_exports = {};
+__export(Utils_exports, {
+  Arr: () => Arr,
+  Dict: () => Dict,
+  Num: () => Num,
+  Rec: () => Rec,
+  Str: () => Str,
+  Uniq: () => Uniq
+});
+module.exports = __toCommonJS(Utils_exports);
+
+// src/Core/Deferred.ts
+var _store = /* @__PURE__ */ new WeakMap();
+var Deferred;
+((Deferred2) => {
+  Deferred2.fromPromise = (p) => {
+    const d = { then: ((f) => p.then(f)) };
+    _store.set(d, p);
+    return d;
+  };
+  Deferred2.toPromise = (d) => _store.get(d) ?? new Promise((resolve) => d.then(resolve));
+})(Deferred || (Deferred = {}));
+
+// src/Core/Result.ts
+var Result;
+((Result2) => {
+  Result2.ok = (value) => ({ kind: "Ok", value });
+  Result2.err = (error) => ({ kind: "Error", error });
+  Result2.isOk = (data) => data.kind === "Ok";
+  Result2.isErr = (data) => data.kind === "Error";
+  Result2.tryCatch = (f, onError) => {
+    try {
+      return (0, Result2.ok)(f());
+    } catch (e) {
+      return (0, Result2.err)(onError(e));
+    }
+  };
+  Result2.map = (f) => (data) => (0, Result2.isOk)(data) ? (0, Result2.ok)(f(data.value)) : data;
+  Result2.mapError = (f) => (data) => (0, Result2.isErr)(data) ? (0, Result2.err)(f(data.error)) : data;
+  Result2.chain = (f) => (data) => (0, Result2.isOk)(data) ? f(data.value) : data;
+  Result2.fold = (onErr, onOk) => (data) => (0, Result2.isOk)(data) ? onOk(data.value) : onErr(data.error);
+  Result2.match = (cases) => (data) => (0, Result2.isOk)(data) ? cases.ok(data.value) : cases.err(data.error);
+  Result2.getOrElse = (defaultValue) => (data) => (0, Result2.isOk)(data) ? data.value : defaultValue();
+  Result2.tap = (f) => (data) => {
+    if ((0, Result2.isOk)(data)) f(data.value);
+    return data;
+  };
+  Result2.recover = (fallback) => (data) => (0, Result2.isOk)(data) ? data : fallback(data.error);
+  Result2.recoverUnless = (blockedErr, fallback) => (data) => (0, Result2.isErr)(data) && data.error !== blockedErr ? fallback() : data;
+  Result2.toOption = (data) => (0, Result2.isOk)(data) ? Option.some(data.value) : Option.none();
+  Result2.ap = (arg) => (data) => (0, Result2.isOk)(data) && (0, Result2.isOk)(arg) ? (0, Result2.ok)(data.value(arg.value)) : (0, Result2.isErr)(data) ? data : arg;
+})(Result || (Result = {}));
+
+// src/Core/Option.ts
+var _none = { kind: "None" };
+var Option;
+((Option2) => {
+  Option2.some = (value) => ({ kind: "Some", value });
+  Option2.isSome = (data) => data.kind === "Some";
+  Option2.none = () => _none;
+  Option2.isNone = (data) => data.kind === "None";
+  Option2.fromNullable = (value) => value === null || value === void 0 ? (0, Option2.none)() : (0, Option2.some)(value);
+  Option2.toNullable = (data) => (0, Option2.isSome)(data) ? data.value : null;
+  Option2.toUndefined = (data) => (0, Option2.isSome)(data) ? data.value : void 0;
+  Option2.fromUndefined = (value) => value === void 0 ? (0, Option2.none)() : (0, Option2.some)(value);
+  Option2.toResult = (onNone) => (data) => (0, Option2.isSome)(data) ? Result.ok(data.value) : Result.err(onNone());
+  Option2.fromResult = (data) => Result.isOk(data) ? (0, Option2.some)(data.value) : (0, Option2.none)();
+  Option2.map = (f) => (data) => (0, Option2.isSome)(data) ? (0, Option2.some)(f(data.value)) : data;
+  Option2.chain = (f) => (data) => (0, Option2.isSome)(data) ? f(data.value) : data;
+  Option2.fold = (onNone, onSome) => (data) => (0, Option2.isSome)(data) ? onSome(data.value) : onNone();
+  Option2.match = (cases) => (data) => (0, Option2.isSome)(data) ? cases.some(data.value) : cases.none();
+  Option2.getOrElse = (defaultValue) => (data) => (0, Option2.isSome)(data) ? data.value : defaultValue();
+  Option2.tap = (f) => (data) => {
+    if ((0, Option2.isSome)(data)) f(data.value);
+    return data;
+  };
+  Option2.filter = (predicate) => (data) => (0, Option2.isSome)(data) ? predicate(data.value) ? data : (0, Option2.none)() : data;
+  Option2.recover = (fallback) => (data) => (0, Option2.isSome)(data) ? data : fallback();
+  Option2.ap = (arg) => (data) => (0, Option2.isSome)(data) && (0, Option2.isSome)(arg) ? (0, Option2.some)(data.value(arg.value)) : (0, Option2.none)();
+})(Option || (Option = {}));
+
+// src/Core/Task.ts
+var toPromise = (task) => Deferred.toPromise(task());
+var Task;
+((Task2) => {
+  Task2.resolve = (value) => () => Deferred.fromPromise(Promise.resolve(value));
+  Task2.from = (f) => () => Deferred.fromPromise(f());
+  Task2.map = (f) => (data) => (0, Task2.from)(() => toPromise(data).then(f));
+  Task2.chain = (f) => (data) => (0, Task2.from)(() => toPromise(data).then((a) => toPromise(f(a))));
+  Task2.ap = (arg) => (data) => (0, Task2.from)(
+    () => Promise.all([
+      toPromise(data),
+      toPromise(arg)
+    ]).then(([f, a]) => f(a))
+  );
+  Task2.tap = (f) => (data) => (0, Task2.from)(
+    () => toPromise(data).then((a) => {
+      f(a);
+      return a;
+    })
+  );
+  Task2.all = (tasks) => (0, Task2.from)(
+    () => Promise.all(tasks.map((t) => toPromise(t)))
+  );
+  Task2.delay = (ms) => (data) => (0, Task2.from)(
+    () => new Promise(
+      (resolve2) => setTimeout(
+        () => toPromise(data).then(resolve2),
+        ms
+      )
+    )
+  );
+  Task2.repeat = (options) => (task) => (0, Task2.from)(() => {
+    const { times, delay: ms } = options;
+    if (times <= 0) return Promise.resolve([]);
+    const results = [];
+    const wait = () => ms !== void 0 && ms > 0 ? new Promise((r) => setTimeout(r, ms)) : Promise.resolve();
+    const run = (left) => toPromise(task).then((a) => {
+      results.push(a);
+      if (left <= 1) return results;
+      return wait().then(() => run(left - 1));
+    });
+    return run(times);
+  });
+  Task2.repeatUntil = (options) => (task) => (0, Task2.from)(() => {
+    const { when: predicate, delay: ms } = options;
+    const wait = () => ms !== void 0 && ms > 0 ? new Promise((r) => setTimeout(r, ms)) : Promise.resolve();
+    const run = () => toPromise(task).then((a) => {
+      if (predicate(a)) return a;
+      return wait().then(run);
+    });
+    return run();
+  });
+  Task2.race = (tasks) => (0, Task2.from)(() => Promise.race(tasks.map(toPromise)));
+  Task2.sequential = (tasks) => (0, Task2.from)(async () => {
+    const results = [];
+    for (const task of tasks) {
+      results.push(await toPromise(task));
+    }
+    return results;
+  });
+  Task2.timeout = (ms, onTimeout) => (task) => (0, Task2.from)(() => {
+    let timerId;
+    return Promise.race([
+      toPromise(task).then((a) => {
+        clearTimeout(timerId);
+        return Result.ok(a);
+      }),
+      new Promise((resolve2) => {
+        timerId = setTimeout(() => resolve2(Result.err(onTimeout())), ms);
+      })
+    ]);
+  });
+})(Task || (Task = {}));
+
+// src/Types/NonEmptyList.ts
+var isNonEmptyList = (list) => list.length > 0;
+
+// src/Utils/Arr.ts
+var Arr;
+((Arr2) => {
+  Arr2.head = (data) => data.length > 0 ? Option.some(data[0]) : Option.none();
+  Arr2.last = (data) => data.length > 0 ? Option.some(data[data.length - 1]) : Option.none();
+  Arr2.tail = (data) => data.length > 0 ? Option.some(data.slice(1)) : Option.none();
+  Arr2.init = (data) => data.length > 0 ? Option.some(data.slice(0, -1)) : Option.none();
+  Arr2.findFirst = (predicate) => (data) => {
+    const idx = data.findIndex(predicate);
+    return idx >= 0 ? Option.some(data[idx]) : Option.none();
+  };
+  Arr2.findLast = (predicate) => (data) => {
+    for (let i = data.length - 1; i >= 0; i--) {
+      if (predicate(data[i])) return Option.some(data[i]);
+    }
+    return Option.none();
+  };
+  Arr2.findIndex = (predicate) => (data) => {
+    const idx = data.findIndex(predicate);
+    return idx >= 0 ? Option.some(idx) : Option.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]);
+    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]);
+    }
+    return result;
+  };
+  Arr2.partition = (predicate) => (data) => {
+    const pass = [];
+    const fail = [];
+    for (const a of data) {
+      (predicate(a) ? pass : fail).push(a);
+    }
+    return [pass, fail];
+  };
+  Arr2.groupBy = (f) => (data) => {
+    const result = {};
+    for (const a of data) {
+      const key = f(a);
+      if (!result[key]) result[key] = [];
+      result[key].push(a);
+    }
+    return result;
+  };
+  Arr2.uniq = (data) => [
+    ...new Set(data)
+  ];
+  Arr2.uniqBy = (f) => (data) => {
+    const seen = /* @__PURE__ */ new Set();
+    const result = [];
+    for (const a of data) {
+      const key = f(a);
+      if (!seen.has(key)) {
+        seen.add(key);
+        result.push(a);
+      }
+    }
+    return result;
+  };
+  Arr2.sortBy = (compare) => (data) => [...data].sort(compare);
+  Arr2.zip = (other) => (data) => {
+    const len = Math.min(data.length, other.length);
+    const result = new Array(len);
+    for (let i = 0; i < len; i++) {
+      result[i] = [data[i], other[i]];
+    }
+    return result;
+  };
+  Arr2.zipWith = (f) => (other) => (data) => {
+    const len = Math.min(data.length, other.length);
+    const result = new Array(len);
+    for (let i = 0; i < len; i++) {
+      result[i] = f(data[i], other[i]);
+    }
+    return result;
+  };
+  Arr2.intersperse = (sep) => (data) => {
+    if (data.length <= 1) return data;
+    const result = [data[0]];
+    for (let i = 1; i < data.length; i++) {
+      result.push(sep, data[i]);
+    }
+    return result;
+  };
+  Arr2.chunksOf = (n) => (data) => {
+    if (n <= 0) return [];
+    const result = [];
+    for (let i = 0; i < data.length; i += n) {
+      result.push(data.slice(i, i + n));
+    }
+    return result;
+  };
+  Arr2.flatten = (data) => [].concat(...data);
+  Arr2.flatMap = (f) => (data) => {
+    const n = data.length;
+    const result = [];
+    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]);
+    }
+    return result;
+  };
+  Arr2.reduce = (initial, f) => (data) => data.reduce(f, initial);
+  Arr2.traverse = (f) => (data) => {
+    const n = data.length;
+    const result = new Array(n);
+    for (let i = 0; i < n; i++) {
+      const mapped = f(data[i]);
+      if (mapped.kind === "None") return Option.none();
+      result[i] = mapped.value;
+    }
+    return Option.some(result);
+  };
+  Arr2.traverseResult = (f) => (data) => {
+    const n = data.length;
+    const result = new Array(n);
+    for (let i = 0; i < n; i++) {
+      const mapped = f(data[i]);
+      if (mapped.kind === "Error") return mapped;
+      result[i] = mapped.value;
+    }
+    return Result.ok(result);
+  };
+  Arr2.traverseTask = (f) => (data) => Task.from(() => Promise.all(data.map((a) => Deferred.toPromise(f(a)()))));
+  Arr2.sequence = (data) => (0, Arr2.traverse)((a) => a)(data);
+  Arr2.sequenceResult = (data) => (0, Arr2.traverseResult)((a) => a)(data);
+  Arr2.sequenceTask = (data) => (0, Arr2.traverseTask)((a) => a)(data);
+  Arr2.traverseTaskResult = (f) => (data) => Task.from(async () => {
+    const result = [];
+    for (const a of data) {
+      const r = await Deferred.toPromise(f(a)());
+      if (Result.isErr(r)) return r;
+      result.push(r.value);
+    }
+    return Result.ok(result);
+  });
+  Arr2.sequenceTaskResult = (data) => (0, Arr2.traverseTaskResult)((a) => a)(data);
+  Arr2.isNonEmpty = (data) => isNonEmptyList(data);
+  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;
+    return false;
+  };
+  Arr2.every = (predicate) => (data) => {
+    const n = data.length;
+    for (let i = 0; i < n; i++) if (!predicate(data[i])) return false;
+    return true;
+  };
+  Arr2.reverse = (data) => [...data].reverse();
+  Arr2.take = (n) => (data) => n <= 0 ? [] : data.slice(0, n);
+  Arr2.drop = (n) => (data) => data.slice(n);
+  Arr2.takeWhile = (predicate) => (data) => {
+    const result = [];
+    for (const a of data) {
+      if (!predicate(a)) break;
+      result.push(a);
+    }
+    return result;
+  };
+  Arr2.dropWhile = (predicate) => (data) => {
+    let i = 0;
+    while (i < data.length && predicate(data[i])) i++;
+    return data.slice(i);
+  };
+  Arr2.scan = (initial, f) => (data) => {
+    const n = data.length;
+    const result = new Array(n);
+    let acc = initial;
+    for (let i = 0; i < n; i++) {
+      acc = f(acc, data[i]);
+      result[i] = acc;
+    }
+    return result;
+  };
+  Arr2.splitAt = (index) => (data) => {
+    const i = Math.max(0, index);
+    return [data.slice(0, i), data.slice(i)];
+  };
+})(Arr || (Arr = {}));
+
+// src/Utils/Dict.ts
+var Dict;
+((Dict2) => {
+  Dict2.empty = () => new globalThis.Map();
+  Dict2.singleton = (key, value) => new globalThis.Map([[key, value]]);
+  Dict2.fromEntries = (entries2) => new globalThis.Map(entries2);
+  Dict2.fromRecord = (rec) => new globalThis.Map(Object.entries(rec));
+  Dict2.groupBy = (keyFn) => (items) => {
+    const result = new globalThis.Map();
+    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]);
+    }
+    return result;
+  };
+  Dict2.has = (key) => (m) => m.has(key);
+  Dict2.lookup = (key) => (m) => m.has(key) ? Option.some(m.get(key)) : Option.none();
+  Dict2.size = (m) => m.size;
+  Dict2.isEmpty = (m) => m.size === 0;
+  Dict2.keys = (m) => [...m.keys()];
+  Dict2.values = (m) => [...m.values()];
+  Dict2.entries = (m) => [...m.entries()];
+  Dict2.insert = (key, value) => (m) => {
+    const result = new globalThis.Map(m);
+    result.set(key, value);
+    return result;
+  };
+  Dict2.remove = (key) => (m) => {
+    if (!m.has(key)) return m;
+    const result = new globalThis.Map(m);
+    result.delete(key);
+    return result;
+  };
+  Dict2.upsert = (key, f) => (m) => {
+    const result = new globalThis.Map(m);
+    result.set(key, f((0, Dict2.lookup)(key)(m)));
+    return result;
+  };
+  Dict2.map = (f) => (m) => {
+    const result = new globalThis.Map();
+    for (const [k, v] of m) {
+      result.set(k, f(v));
+    }
+    return result;
+  };
+  Dict2.mapWithKey = (f) => (m) => {
+    const result = new globalThis.Map();
+    for (const [k, v] of m) {
+      result.set(k, f(k, v));
+    }
+    return result;
+  };
+  Dict2.filter = (predicate) => (m) => {
+    const result = new globalThis.Map();
+    for (const [k, v] of m) {
+      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);
+    }
+    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);
+    }
+    return result;
+  };
+  Dict2.union = (other) => (m) => {
+    const result = new globalThis.Map(m);
+    for (const [k, v] of other) {
+      result.set(k, v);
+    }
+    return result;
+  };
+  Dict2.intersection = (other) => (m) => {
+    const result = new globalThis.Map();
+    for (const [k, v] of m) {
+      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);
+    }
+    return result;
+  };
+  Dict2.reduce = (init, f) => (m) => {
+    let acc = init;
+    for (const v of m.values()) {
+      acc = f(acc, v);
+    }
+    return acc;
+  };
+  Dict2.reduceWithKey = (init, f) => (m) => {
+    let acc = init;
+    for (const [k, v] of m) {
+      acc = f(acc, v, k);
+    }
+    return acc;
+  };
+  Dict2.toRecord = (m) => Object.fromEntries(m);
+})(Dict || (Dict = {}));
+
+// src/Utils/Num.ts
+var Num;
+((Num2) => {
+  Num2.range = (from, to, step = 1) => {
+    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++) {
+      result[i] = from + i * step;
+    }
+    return result;
+  };
+  Num2.clamp = (min, max) => (n) => Math.min(Math.max(n, min), max);
+  Num2.between = (min, max) => (n) => n >= min && n <= max;
+  Num2.parse = (s) => {
+    if (s.trim() === "") return Option.none();
+    const n = Number(s);
+    return isNaN(n) ? Option.none() : Option.some(n);
+  };
+  Num2.add = (b) => (a) => a + b;
+  Num2.subtract = (b) => (a) => a - b;
+  Num2.multiply = (b) => (a) => a * b;
+  Num2.divide = (b) => (a) => a / b;
+})(Num || (Num = {}));
+
+// src/Utils/Rec.ts
+var Rec;
+((Rec2) => {
+  Rec2.map = (f) => (data) => {
+    const keys2 = Object.keys(data);
+    const vals = Object.values(data);
+    const result = {};
+    for (let i = 0; i < keys2.length; i++) {
+      result[keys2[i]] = f(vals[i]);
+    }
+    return result;
+  };
+  Rec2.mapWithKey = (f) => (data) => {
+    const keys2 = Object.keys(data);
+    const vals = Object.values(data);
+    const result = {};
+    for (let i = 0; i < keys2.length; i++) {
+      result[keys2[i]] = f(keys2[i], vals[i]);
+    }
+    return result;
+  };
+  Rec2.filter = (predicate) => (data) => {
+    const result = {};
+    for (const [k, v] of Object.entries(data)) {
+      if (predicate(v)) result[k] = v;
+    }
+    return result;
+  };
+  Rec2.filterWithKey = (predicate) => (data) => {
+    const result = {};
+    for (const [k, v] of Object.entries(data)) {
+      if (predicate(k, v)) result[k] = v;
+    }
+    return result;
+  };
+  Rec2.lookup = (key) => (data) => Object.hasOwn(data, key) ? Option.some(data[key]) : Option.none();
+  Rec2.keys = (data) => Object.keys(data);
+  Rec2.values = (data) => Object.values(data);
+  Rec2.entries = (data) => Object.entries(data);
+  Rec2.fromEntries = (data) => Object.fromEntries(data);
+  Rec2.groupBy = (keyFn) => (items) => {
+    const result = {};
+    for (const item of items) {
+      const key = keyFn(item);
+      if (key in result) result[key].push(item);
+      else result[key] = [item];
+    }
+    return result;
+  };
+  Rec2.pick = (...pickedKeys) => (data) => {
+    const result = {};
+    for (const key of pickedKeys) {
+      if (Object.hasOwn(data, key)) {
+        result[key] = data[key];
+      }
+    }
+    return result;
+  };
+  Rec2.omit = (...omittedKeys) => (data) => {
+    const omitSet = new Set(omittedKeys);
+    const result = {};
+    for (const key of Object.keys(data)) {
+      if (!omitSet.has(key)) {
+        result[key] = data[key];
+      }
+    }
+    return result;
+  };
+  Rec2.merge = (other) => (data) => ({
+    ...data,
+    ...other
+  });
+  Rec2.isEmpty = (data) => Object.keys(data).length === 0;
+  Rec2.size = (data) => Object.keys(data).length;
+  Rec2.mapKeys = (f) => (data) => {
+    const result = {};
+    for (const [k, v] of Object.entries(data)) {
+      result[f(k)] = v;
+    }
+    return result;
+  };
+  Rec2.compact = (data) => {
+    const result = {};
+    for (const [k, v] of Object.entries(data)) {
+      if (v.kind === "Some") result[k] = v.value;
+    }
+    return result;
+  };
+})(Rec || (Rec = {}));
+
+// src/Utils/Str.ts
+var Str;
+((Str2) => {
+  Str2.split = (separator) => (s) => s.split(separator);
+  Str2.trim = (s) => s.trim();
+  Str2.includes = (substring) => (s) => s.includes(substring);
+  Str2.startsWith = (prefix) => (s) => s.startsWith(prefix);
+  Str2.endsWith = (suffix) => (s) => s.endsWith(suffix);
+  Str2.toUpperCase = (s) => s.toUpperCase();
+  Str2.toLowerCase = (s) => s.toLowerCase();
+  Str2.lines = (s) => s.split(/\r?\n|\r/);
+  Str2.words = (s) => s.trim().split(/\s+/).filter(Boolean);
+  Str2.parse = {
+    /**
+     * Parses a string as an integer (base 10). Returns `None` if the result is `NaN`.
+     *
+     * @example
+     * ```ts
+     * Str.parse.int("42");   // Some(42)
+     * Str.parse.int("3.7");  // Some(3)
+     * Str.parse.int("abc");  // None
+     * ```
+     */
+    int: (s) => {
+      const n = parseInt(s, 10);
+      return isNaN(n) ? Option.none() : Option.some(n);
+    },
+    /**
+     * Parses a string as a floating-point number. Returns `None` if the result is `NaN`.
+     *
+     * @example
+     * ```ts
+     * Str.parse.float("3.14"); // Some(3.14)
+     * Str.parse.float("42");   // Some(42)
+     * Str.parse.float("abc");  // None
+     * ```
+     */
+    float: (s) => {
+      const n = parseFloat(s);
+      return isNaN(n) ? Option.none() : Option.some(n);
+    }
+  };
+})(Str || (Str = {}));
+
+// src/Utils/Uniq.ts
+var Uniq;
+((Uniq2) => {
+  Uniq2.empty = () => new globalThis.Set();
+  Uniq2.singleton = (item) => new globalThis.Set([item]);
+  Uniq2.fromArray = (arr) => new globalThis.Set(arr);
+  Uniq2.has = (item) => (s) => s.has(item);
+  Uniq2.size = (s) => s.size;
+  Uniq2.isEmpty = (s) => s.size === 0;
+  Uniq2.isSubsetOf = (other) => (s) => {
+    const set = s;
+    if (typeof set.isSubsetOf === "function") return set.isSubsetOf(other);
+    for (const item of s) {
+      if (!other.has(item)) return false;
+    }
+    return true;
+  };
+  Uniq2.insert = (item) => (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;
+    const result = new globalThis.Set(s);
+    result.delete(item);
+    return result;
+  };
+  Uniq2.map = (f) => (s) => {
+    const result = new globalThis.Set();
+    for (const item of s) {
+      result.add(f(item));
+    }
+    return result;
+  };
+  Uniq2.filter = (predicate) => (s) => {
+    const result = new globalThis.Set();
+    for (const item of s) {
+      if (predicate(item)) result.add(item);
+    }
+    return result;
+  };
+  Uniq2.union = (other) => (s) => {
+    const set = s;
+    if (typeof set.union === "function") return set.union(other);
+    const result = new globalThis.Set(s);
+    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);
+    const result = new globalThis.Set();
+    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);
+    const result = new globalThis.Set();
+    for (const item of s) if (!other.has(item)) result.add(item);
+    return result;
+  };
+  Uniq2.reduce = (init, f) => (s) => {
+    let acc = init;
+    for (const item of s) {
+      acc = f(acc, item);
+    }
+    return acc;
+  };
+  Uniq2.toArray = (s) => [...s];
+})(Uniq || (Uniq = {}));
+// Annotate the CommonJS export names for ESM import in node:
+0 && (module.exports = {
+  Arr,
+  Dict,
+  Num,
+  Rec,
+  Str,
+  Uniq
+});