@vielzeug/toolkit 1.0.12 → 1.0.14

package/dist/array/remoteList.js

@@ -0,0 +1,123 @@
+function Q(r) {
+  const y = /* @__PURE__ */ new Set(), b = Math.max(1, r.limit ?? 10), O = r.debounceMs ?? 300;
+  let a = 1, n = b, m = "", u = r.initialFilter, d = r.initialSort, M = [], c = 0, f = !1, g = null;
+  const h = /* @__PURE__ */ new Map(), w = /* @__PURE__ */ new Map(), v = (t) => JSON.stringify(t), F = () => ({
+    filter: u,
+    limit: n,
+    page: a,
+    search: m || void 0,
+    sort: d
+  }), p = (t) => {
+    M = t.items, c = t.total ?? 0;
+    const e = Math.max(1, Math.ceil(c / n));
+    a = Math.min(Math.max(1, a), e);
+  }, L = () => {
+    for (const t of y)
+      t();
+  }, k = async (t) => {
+    const e = v(t);
+    if (h.has(e)) {
+      p(h.get(e));
+      return;
+    }
+    if (w.has(e)) {
+      await w.get(e), p(h.get(e));
+      return;
+    }
+    f = !0, g = null, L();
+    const s = r.fetch(t).then((l) => {
+      h.set(e, l), p(l);
+    }).catch((l) => {
+      g = l?.message ?? "Request failed", M = [], c = 0;
+    }).finally(() => {
+      w.delete(e), f = !1, L();
+    });
+    w.set(e, s), await s;
+  }, i = async () => {
+    await k(F());
+  };
+  let x;
+  const P = () => {
+    x && clearTimeout(x), x = setTimeout(() => {
+      x = void 0, i();
+    }, O);
+  };
+  return {
+    async batch(t) {
+      let e = a, s = n, l = m, S = u, T = d;
+      t({
+        goTo: (o) => {
+          e = Math.max(1, o | 0);
+        },
+        setFilter: (o) => {
+          S = o, e = 1;
+        },
+        setLimit: (o) => {
+          s = Math.max(1, o), e = 1;
+        },
+        setQuery: (o) => {
+          l = o, e = 1;
+        },
+        setSort: (o) => {
+          T = o, e = 1;
+        }
+      }), a = e, n = s, m = l, u = S, d = T, await i();
+    },
+    get current() {
+      return M;
+    },
+    async goTo(t) {
+      a = Math.max(1, t | 0), await i();
+    },
+    invalidate() {
+      h.clear();
+    },
+    get meta() {
+      const t = c === 0, e = Math.max(1, Math.ceil(c / n)), s = Math.min(a, e), l = t ? 0 : (s - 1) * n + 1;
+      return {
+        end: t ? 0 : Math.min(s * n, c),
+        error: g,
+        isEmpty: t,
+        isFirst: s <= 1,
+        isLast: s >= e,
+        limit: n,
+        loading: f,
+        page: s,
+        pages: e,
+        start: l,
+        total: c
+      };
+    },
+    async next() {
+      a += 1, await i();
+    },
+    async prev() {
+      a = Math.max(1, a - 1), await i();
+    },
+    async refresh() {
+      h.delete(v(F())), await i();
+    },
+    async reset() {
+      a = 1, n = b, m = "", u = r.initialFilter, d = r.initialSort, h.clear(), await i();
+    },
+    async search(t, e) {
+      m = t, a = 1, e?.immediate ? await i() : P();
+    },
+    async setFilter(t) {
+      u = t, a = 1, await i();
+    },
+    async setLimit(t) {
+      n = Math.max(1, t), a = 1, await i();
+    },
+    async setSort(t) {
+      d = t, a = 1, await i();
+    },
+    subscribe(t) {
+      return y.add(t), y.size === 1 && M.length === 0 && !f && i(), () => y.delete(t);
+    }
+  };
+}
+export {
+  Q as remoteList
+};
+//# sourceMappingURL=remoteList.js.map

package/dist/array/remoteList.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"remoteList.js","sources":["../../src/array/remoteList.ts"],"sourcesContent":["// #region RemoteMeta\nexport type RemoteMeta = Readonly<{\n  end: number; // inclusive\n  error: string | null;\n  isEmpty: boolean;\n  isFirst: boolean;\n  isLast: boolean;\n  limit: number;\n  loading: boolean;\n  page: number; // 1-based\n  pages: number;\n  start: number; // 1-based\n  total: number;\n}>;\n// #endregion RemoteMeta\n\n// #region RemoteList\nexport type RemoteList<T, F, S> = {\n  readonly current: readonly T[];\n  readonly meta: RemoteMeta;\n  subscribe(listener: () => void): () => void;\n\n  goTo(page: number): Promise<void>;\n  invalidate?(): void;\n  next(): Promise<void>;\n  prev(): Promise<void>;\n  refresh(): Promise<void>;\n  reset(): Promise<void>;\n  search(query: string, opts?: { immediate?: boolean }): Promise<void>;\n  setFilter(filter: F): Promise<void>;\n  setLimit(n: number): Promise<void>;\n  setSort(sort?: S): Promise<void>;\n\n  // Batch updates across properties in one recompute/refetch\n  batch(\n    mutator: (ctx: {\n      setLimit(n: number): void;\n      setFilter(f: F): void;\n      setSort(s?: S): void;\n      setQuery(q: string): void;\n      setData?(d: readonly T[]): void; // local-only\n      goTo(p: number): void; // 1-based\n    }) => void,\n  ): Promise<void>;\n};\n// #endregion RemoteList\n\n// #region RemoteConfig\ntype RemoteQuery<F, S> = Readonly<{\n  filter?: F;\n  limit: number;\n  page: number; // 1-based\n  search?: string;\n  sort?: S;\n}>;\n\ntype RemoteResult<T> = Readonly<{ items: readonly T[]; total: number }>;\n\ntype RemoteConfig<T, F, S> = Readonly<{\n  debounceMs?: number;\n  fetch: (q: RemoteQuery<F, S>) => Promise<RemoteResult<T>>;\n  initialFilter?: F;\n  initialSort?: S;\n  limit?: number;\n}>;\n// #endregion RemoteConfig\n\nexport function remoteList<T, F = Record<string, unknown>, S = { key?: string; dir?: 'asc' | 'desc' }>(\n  cfg: RemoteConfig<T, F, S>,\n): RemoteList<T, F, S> {\n  const listeners = new Set<() => void>();\n\n  const limitDefault = Math.max(1, cfg.limit ?? 10);\n  const debounceMs = cfg.debounceMs ?? 300;\n\n  let page = 1;\n  let limit = limitDefault;\n  let search = '';\n  let filter = cfg.initialFilter as F | undefined;\n  let sort = cfg.initialSort as S | undefined;\n\n  let items: readonly T[] = [];\n  let total = 0;\n  let loading = false;\n  let error: string | null = null;\n\n  const cache = new Map<string, RemoteResult<T>>();\n  const inflight = new Map<string, Promise<void>>();\n\n  const keyOf = (q: RemoteQuery<F, S>) => JSON.stringify(q);\n  const queryOf = (): RemoteQuery<F, S> => ({\n    filter,\n    limit,\n    page,\n    search: search || undefined,\n    sort,\n  });\n\n  const assign = (res: RemoteResult<T>) => {\n    items = res.items;\n    total = res.total ?? 0;\n    const pages = Math.max(1, Math.ceil(total / limit));\n    page = Math.min(Math.max(1, page), pages);\n  };\n\n  const notify = () => {\n    for (const l of listeners) {\n      l();\n    }\n  };\n\n  const fetchQuery = async (q: RemoteQuery<F, S>) => {\n    const k = keyOf(q);\n    if (cache.has(k)) {\n      assign(cache.get(k)!);\n      return;\n    }\n    if (inflight.has(k)) {\n      await inflight.get(k);\n      assign(cache.get(k)!);\n      return;\n    }\n    loading = true;\n    error = null;\n    notify();\n    const p = cfg\n      .fetch(q)\n      .then((res) => {\n        cache.set(k, res);\n        assign(res);\n      })\n      .catch((e) => {\n        error = e?.message ?? 'Request failed';\n        items = [];\n        total = 0;\n      })\n      .finally(() => {\n        inflight.delete(k);\n        loading = false;\n        notify();\n      });\n    inflight.set(k, p);\n    await p;\n  };\n\n  const update = async () => {\n    await fetchQuery(queryOf());\n  };\n\n  // debounced search\n  let timer: ReturnType<typeof setTimeout> | undefined;\n  const debounced = () => {\n    if (timer) clearTimeout(timer);\n    timer = setTimeout(() => {\n      timer = undefined;\n      void update();\n    }, debounceMs);\n  };\n\n  // initial fetch is on the first subscriber or call to refresh; up to you\n  return {\n    async batch(mutator) {\n      // Stage local copies\n      let nextPage = page;\n      let nextLimit = limit;\n      let nextSearch = search;\n      let nextFilter = filter as F | undefined;\n      let nextSort = sort as S | undefined;\n\n      mutator({\n        goTo: (p: number) => {\n          nextPage = Math.max(1, p | 0);\n        },\n        setFilter: (f: F) => {\n          nextFilter = f;\n          nextPage = 1;\n        },\n        setLimit: (n) => {\n          nextLimit = Math.max(1, n);\n          nextPage = 1;\n        },\n        setQuery: (q: string) => {\n          nextSearch = q;\n          nextPage = 1;\n        },\n        setSort: (s?: S) => {\n          nextSort = s;\n          nextPage = 1;\n        },\n      });\n\n      // Apply and update at once\n      page = nextPage;\n      limit = nextLimit;\n      search = nextSearch;\n      filter = nextFilter;\n      sort = nextSort;\n\n      await update();\n    },\n    get current() {\n      return items;\n    },\n    async goTo(p) {\n      page = Math.max(1, p | 0);\n      await update();\n    },\n    invalidate() {\n      cache.clear();\n    },\n    get meta() {\n      const isEmpty = total === 0;\n      const pages = Math.max(1, Math.ceil(total / limit));\n      const safePage = Math.min(page, pages);\n      const start = isEmpty ? 0 : (safePage - 1) * limit + 1;\n      const end = isEmpty ? 0 : Math.min(safePage * limit, total);\n      return {\n        end,\n        error,\n        isEmpty,\n        isFirst: safePage <= 1,\n        isLast: safePage >= pages,\n        limit,\n        loading,\n        page: safePage,\n        pages,\n        start,\n        total,\n      };\n    },\n    async next() {\n      page += 1;\n      await update();\n    },\n    async prev() {\n      page = Math.max(1, page - 1);\n      await update();\n    },\n    async refresh() {\n      cache.delete(keyOf(queryOf()));\n      await update();\n    },\n    async reset() {\n      page = 1;\n      limit = limitDefault;\n      search = '';\n      filter = cfg.initialFilter as F | undefined;\n      sort = cfg.initialSort as S | undefined;\n      cache.clear();\n      await update();\n    },\n    async search(q, opts) {\n      search = q;\n      page = 1;\n      if (opts?.immediate) await update();\n      else debounced();\n    },\n    async setFilter(f) {\n      filter = f;\n      page = 1;\n      await update();\n    },\n    async setLimit(n) {\n      limit = Math.max(1, n);\n      page = 1;\n      await update();\n    },\n    async setSort(s) {\n      sort = s;\n      page = 1;\n      await update();\n    },\n    subscribe(listener) {\n      listeners.add(listener);\n      // optional: trigger an initial load on the first subscription\n      if (listeners.size === 1 && items.length === 0 && !loading) {\n        void update();\n      }\n      return () => listeners.delete(listener);\n    },\n  };\n}\n"],"names":["remoteList","cfg","listeners","limitDefault","debounceMs","page","limit","search","filter","sort","items","total","loading","error","cache","inflight","keyOf","q","queryOf","assign","res","pages","notify","l","fetchQuery","k","p","e","update","timer","debounced","mutator","nextPage","nextLimit","nextSearch","nextFilter","nextSort","f","n","s","isEmpty","safePage","start","opts","listener"],"mappings":"AAmEO,SAASA,EACdC,GACqB;AACrB,QAAMC,wBAAgB,IAAA,GAEhBC,IAAe,KAAK,IAAI,GAAGF,EAAI,SAAS,EAAE,GAC1CG,IAAaH,EAAI,cAAc;AAErC,MAAII,IAAO,GACPC,IAAQH,GACRI,IAAS,IACTC,IAASP,EAAI,eACbQ,IAAOR,EAAI,aAEXS,IAAsB,CAAA,GACtBC,IAAQ,GACRC,IAAU,IACVC,IAAuB;AAE3B,QAAMC,wBAAY,IAAA,GACZC,wBAAe,IAAA,GAEfC,IAAQ,CAACC,MAAyB,KAAK,UAAUA,CAAC,GAClDC,IAAU,OAA0B;AAAA,IACxC,QAAAV;AAAA,IACA,OAAAF;AAAA,IACA,MAAAD;AAAA,IACA,QAAQE,KAAU;AAAA,IAClB,MAAAE;AAAA,EAAA,IAGIU,IAAS,CAACC,MAAyB;AACvC,IAAAV,IAAQU,EAAI,OACZT,IAAQS,EAAI,SAAS;AACrB,UAAMC,IAAQ,KAAK,IAAI,GAAG,KAAK,KAAKV,IAAQL,CAAK,CAAC;AAClD,IAAAD,IAAO,KAAK,IAAI,KAAK,IAAI,GAAGA,CAAI,GAAGgB,CAAK;AAAA,EAC1C,GAEMC,IAAS,MAAM;AACnB,eAAWC,KAAKrB;AACd,MAAAqB,EAAA;AAAA,EAEJ,GAEMC,IAAa,OAAOP,MAAyB;AACjD,UAAMQ,IAAIT,EAAMC,CAAC;AACjB,QAAIH,EAAM,IAAIW,CAAC,GAAG;AAChB,MAAAN,EAAOL,EAAM,IAAIW,CAAC,CAAE;AACpB;AAAA,IACF;AACA,QAAIV,EAAS,IAAIU,CAAC,GAAG;AACnB,YAAMV,EAAS,IAAIU,CAAC,GACpBN,EAAOL,EAAM,IAAIW,CAAC,CAAE;AACpB;AAAA,IACF;AACA,IAAAb,IAAU,IACVC,IAAQ,MACRS,EAAA;AACA,UAAMI,IAAIzB,EACP,MAAMgB,CAAC,EACP,KAAK,CAACG,MAAQ;AACb,MAAAN,EAAM,IAAIW,GAAGL,CAAG,GAChBD,EAAOC,CAAG;AAAA,IACZ,CAAC,EACA,MAAM,CAACO,MAAM;AACZ,MAAAd,IAAQc,GAAG,WAAW,kBACtBjB,IAAQ,CAAA,GACRC,IAAQ;AAAA,IACV,CAAC,EACA,QAAQ,MAAM;AACb,MAAAI,EAAS,OAAOU,CAAC,GACjBb,IAAU,IACVU,EAAA;AAAA,IACF,CAAC;AACH,IAAAP,EAAS,IAAIU,GAAGC,CAAC,GACjB,MAAMA;AAAA,EACR,GAEME,IAAS,YAAY;AACzB,UAAMJ,EAAWN,GAAS;AAAA,EAC5B;AAGA,MAAIW;AACJ,QAAMC,IAAY,MAAM;AACtB,IAAID,kBAAoBA,CAAK,GAC7BA,IAAQ,WAAW,MAAM;AACvB,MAAAA,IAAQ,QACHD,EAAA;AAAA,IACP,GAAGxB,CAAU;AAAA,EACf;AAGA,SAAO;AAAA,IACL,MAAM,MAAM2B,GAAS;AAEnB,UAAIC,IAAW3B,GACX4B,IAAY3B,GACZ4B,IAAa3B,GACb4B,IAAa3B,GACb4B,IAAW3B;AAEf,MAAAsB,EAAQ;AAAA,QACN,MAAM,CAACL,MAAc;AACnB,UAAAM,IAAW,KAAK,IAAI,GAAGN,IAAI,CAAC;AAAA,QAC9B;AAAA,QACA,WAAW,CAACW,MAAS;AACnB,UAAAF,IAAaE,GACbL,IAAW;AAAA,QACb;AAAA,QACA,UAAU,CAACM,MAAM;AACf,UAAAL,IAAY,KAAK,IAAI,GAAGK,CAAC,GACzBN,IAAW;AAAA,QACb;AAAA,QACA,UAAU,CAACf,MAAc;AACvB,UAAAiB,IAAajB,GACbe,IAAW;AAAA,QACb;AAAA,QACA,SAAS,CAACO,MAAU;AAClB,UAAAH,IAAWG,GACXP,IAAW;AAAA,QACb;AAAA,MAAA,CACD,GAGD3B,IAAO2B,GACP1B,IAAQ2B,GACR1B,IAAS2B,GACT1B,IAAS2B,GACT1B,IAAO2B,GAEP,MAAMR,EAAA;AAAA,IACR;AAAA,IACA,IAAI,UAAU;AACZ,aAAOlB;AAAA,IACT;AAAA,IACA,MAAM,KAAKgB,GAAG;AACZ,MAAArB,IAAO,KAAK,IAAI,GAAGqB,IAAI,CAAC,GACxB,MAAME,EAAA;AAAA,IACR;AAAA,IACA,aAAa;AACX,MAAAd,EAAM,MAAA;AAAA,IACR;AAAA,IACA,IAAI,OAAO;AACT,YAAM0B,IAAU7B,MAAU,GACpBU,IAAQ,KAAK,IAAI,GAAG,KAAK,KAAKV,IAAQL,CAAK,CAAC,GAC5CmC,IAAW,KAAK,IAAIpC,GAAMgB,CAAK,GAC/BqB,IAAQF,IAAU,KAAKC,IAAW,KAAKnC,IAAQ;AAErD,aAAO;AAAA,QACL,KAFUkC,IAAU,IAAI,KAAK,IAAIC,IAAWnC,GAAOK,CAAK;AAAA,QAGxD,OAAAE;AAAA,QACA,SAAA2B;AAAA,QACA,SAASC,KAAY;AAAA,QACrB,QAAQA,KAAYpB;AAAA,QACpB,OAAAf;AAAA,QACA,SAAAM;AAAA,QACA,MAAM6B;AAAA,QACN,OAAApB;AAAA,QACA,OAAAqB;AAAA,QACA,OAAA/B;AAAA,MAAA;AAAA,IAEJ;AAAA,IACA,MAAM,OAAO;AACX,MAAAN,KAAQ,GACR,MAAMuB,EAAA;AAAA,IACR;AAAA,IACA,MAAM,OAAO;AACX,MAAAvB,IAAO,KAAK,IAAI,GAAGA,IAAO,CAAC,GAC3B,MAAMuB,EAAA;AAAA,IACR;AAAA,IACA,MAAM,UAAU;AACd,MAAAd,EAAM,OAAOE,EAAME,EAAA,CAAS,CAAC,GAC7B,MAAMU,EAAA;AAAA,IACR;AAAA,IACA,MAAM,QAAQ;AACZ,MAAAvB,IAAO,GACPC,IAAQH,GACRI,IAAS,IACTC,IAASP,EAAI,eACbQ,IAAOR,EAAI,aACXa,EAAM,MAAA,GACN,MAAMc,EAAA;AAAA,IACR;AAAA,IACA,MAAM,OAAOX,GAAG0B,GAAM;AACpB,MAAApC,IAASU,GACTZ,IAAO,GACHsC,GAAM,YAAW,MAAMf,EAAA,IACtBE,EAAA;AAAA,IACP;AAAA,IACA,MAAM,UAAUO,GAAG;AACjB,MAAA7B,IAAS6B,GACThC,IAAO,GACP,MAAMuB,EAAA;AAAA,IACR;AAAA,IACA,MAAM,SAASU,GAAG;AAChB,MAAAhC,IAAQ,KAAK,IAAI,GAAGgC,CAAC,GACrBjC,IAAO,GACP,MAAMuB,EAAA;AAAA,IACR;AAAA,IACA,MAAM,QAAQW,GAAG;AACf,MAAA9B,IAAO8B,GACPlC,IAAO,GACP,MAAMuB,EAAA;AAAA,IACR;AAAA,IACA,UAAUgB,GAAU;AAClB,aAAA1C,EAAU,IAAI0C,CAAQ,GAElB1C,EAAU,SAAS,KAAKQ,EAAM,WAAW,KAAK,CAACE,KAC5CgB,EAAA,GAEA,MAAM1B,EAAU,OAAO0C,CAAQ;AAAA,IACxC;AAAA,EAAA;AAEJ;"}

package/dist/date/expires.cjs.map

@@ -1 +1 @@
-{"version":3,"file":"expires.cjs","sources":["../../src/date/expires.ts"],"sourcesContent":["export type Expires = 'EXPIRED' | 'SOON' | 'LATER' | 'NEVER' | 'UNKNOWN';\n\n/**\n * Determines the expiry status of a given date.\n *\n * @param date - The date to check, as a string or Date object.\n * @param days - Number of days before expiry to be considered \"SOON\" (default: 7).\n * @returns\n *   - 'EXPIRED' if the date is in the past,\n *   - 'SOON' if the date is within the next `days`,\n *   - 'LATER' if the date is further in the future,\n *   - 'NEVER' if the year is >= 9999,\n *   - 'UNKNOWN' if the date is invalid.\n */\nexport function expires(date: string | Date, days = 7): Expires {\n  const target = typeof date === 'string' ? new Date(date) : date;\n  const targetTime = target.getTime();\n\n  if (Number.isNaN(targetTime)) return 'UNKNOWN';\n  if (target.getFullYear() >= 9999) return 'NEVER';\n\n  const now = Date.now();\n  const diff = targetTime - now;\n\n  if (diff <= 0) return 'EXPIRED';\n  if (diff <= days * 24 * 60 * 60 * 1000) return 'SOON';\n\n  return 'LATER';\n}\n"],"names":["expires","date","days","target","targetTime","now","diff"],"mappings":"gFAcO,SAASA,EAAQC,EAAqBC,EAAO,EAAY,CAC9D,MAAMC,EAAS,OAAOF,GAAS,SAAW,IAAI,KAAKA,CAAI,EAAIA,EACrDG,EAAaD,EAAO,QAAA,EAE1B,GAAI,OAAO,MAAMC,CAAU,EAAG,MAAO,UACrC,GAAID,EAAO,eAAiB,KAAM,MAAO,QAEzC,MAAME,EAAM,KAAK,IAAA,EACXC,EAAOF,EAAaC,EAE1B,OAAIC,GAAQ,EAAU,UAClBA,GAAQJ,EAAO,GAAK,GAAK,GAAK,IAAa,OAExC,OACT"}
+{"version":3,"file":"expires.cjs","sources":["../../src/date/expires.ts"],"sourcesContent":["// #region Expires\nexport type Expires = 'EXPIRED' | 'SOON' | 'LATER' | 'NEVER' | 'UNKNOWN';\n// #endregion Expires\n\n/**\n * Determines the expiry status of a given date.\n *\n * @param date - The date to check, as a string or Date object.\n * @param days - Number of days before expiry to be considered \"SOON\" (default: 7).\n * @returns\n *   - 'EXPIRED' if the date is in the past,\n *   - 'SOON' if the date is within the next `days`,\n *   - 'LATER' if the date is further in the future,\n *   - 'NEVER' if the year is >= 9999,\n *   - 'UNKNOWN' if the date is invalid.\n */\nexport function expires(date: string | Date, days = 7): Expires {\n  const target = typeof date === 'string' ? new Date(date) : date;\n  const targetTime = target.getTime();\n\n  if (Number.isNaN(targetTime)) return 'UNKNOWN';\n  if (target.getFullYear() >= 9999) return 'NEVER';\n\n  const now = Date.now();\n  const diff = targetTime - now;\n\n  if (diff <= 0) return 'EXPIRED';\n  if (diff <= days * 24 * 60 * 60 * 1000) return 'SOON';\n\n  return 'LATER';\n}\n"],"names":["expires","date","days","target","targetTime","now","diff"],"mappings":"gFAgBO,SAASA,EAAQC,EAAqBC,EAAO,EAAY,CAC9D,MAAMC,EAAS,OAAOF,GAAS,SAAW,IAAI,KAAKA,CAAI,EAAIA,EACrDG,EAAaD,EAAO,QAAA,EAE1B,GAAI,OAAO,MAAMC,CAAU,EAAG,MAAO,UACrC,GAAID,EAAO,eAAiB,KAAM,MAAO,QAEzC,MAAME,EAAM,KAAK,IAAA,EACXC,EAAOF,EAAaC,EAE1B,OAAIC,GAAQ,EAAU,UAClBA,GAAQJ,EAAO,GAAK,GAAK,GAAK,IAAa,OAExC,OACT"}

package/dist/date/expires.js.map

@@ -1 +1 @@
-{"version":3,"file":"expires.js","sources":["../../src/date/expires.ts"],"sourcesContent":["export type Expires = 'EXPIRED' | 'SOON' | 'LATER' | 'NEVER' | 'UNKNOWN';\n\n/**\n * Determines the expiry status of a given date.\n *\n * @param date - The date to check, as a string or Date object.\n * @param days - Number of days before expiry to be considered \"SOON\" (default: 7).\n * @returns\n *   - 'EXPIRED' if the date is in the past,\n *   - 'SOON' if the date is within the next `days`,\n *   - 'LATER' if the date is further in the future,\n *   - 'NEVER' if the year is >= 9999,\n *   - 'UNKNOWN' if the date is invalid.\n */\nexport function expires(date: string | Date, days = 7): Expires {\n  const target = typeof date === 'string' ? new Date(date) : date;\n  const targetTime = target.getTime();\n\n  if (Number.isNaN(targetTime)) return 'UNKNOWN';\n  if (target.getFullYear() >= 9999) return 'NEVER';\n\n  const now = Date.now();\n  const diff = targetTime - now;\n\n  if (diff <= 0) return 'EXPIRED';\n  if (diff <= days * 24 * 60 * 60 * 1000) return 'SOON';\n\n  return 'LATER';\n}\n"],"names":["expires","date","days","target","targetTime","now","diff"],"mappings":"AAcO,SAASA,EAAQC,GAAqBC,IAAO,GAAY;AAC9D,QAAMC,IAAS,OAAOF,KAAS,WAAW,IAAI,KAAKA,CAAI,IAAIA,GACrDG,IAAaD,EAAO,QAAA;AAE1B,MAAI,OAAO,MAAMC,CAAU,EAAG,QAAO;AACrC,MAAID,EAAO,iBAAiB,KAAM,QAAO;AAEzC,QAAME,IAAM,KAAK,IAAA,GACXC,IAAOF,IAAaC;AAE1B,SAAIC,KAAQ,IAAU,YAClBA,KAAQJ,IAAO,KAAK,KAAK,KAAK,MAAa,SAExC;AACT;"}
+{"version":3,"file":"expires.js","sources":["../../src/date/expires.ts"],"sourcesContent":["// #region Expires\nexport type Expires = 'EXPIRED' | 'SOON' | 'LATER' | 'NEVER' | 'UNKNOWN';\n// #endregion Expires\n\n/**\n * Determines the expiry status of a given date.\n *\n * @param date - The date to check, as a string or Date object.\n * @param days - Number of days before expiry to be considered \"SOON\" (default: 7).\n * @returns\n *   - 'EXPIRED' if the date is in the past,\n *   - 'SOON' if the date is within the next `days`,\n *   - 'LATER' if the date is further in the future,\n *   - 'NEVER' if the year is >= 9999,\n *   - 'UNKNOWN' if the date is invalid.\n */\nexport function expires(date: string | Date, days = 7): Expires {\n  const target = typeof date === 'string' ? new Date(date) : date;\n  const targetTime = target.getTime();\n\n  if (Number.isNaN(targetTime)) return 'UNKNOWN';\n  if (target.getFullYear() >= 9999) return 'NEVER';\n\n  const now = Date.now();\n  const diff = targetTime - now;\n\n  if (diff <= 0) return 'EXPIRED';\n  if (diff <= days * 24 * 60 * 60 * 1000) return 'SOON';\n\n  return 'LATER';\n}\n"],"names":["expires","date","days","target","targetTime","now","diff"],"mappings":"AAgBO,SAASA,EAAQC,GAAqBC,IAAO,GAAY;AAC9D,QAAMC,IAAS,OAAOF,KAAS,WAAW,IAAI,KAAKA,CAAI,IAAIA,GACrDG,IAAaD,EAAO,QAAA;AAE1B,MAAI,OAAO,MAAMC,CAAU,EAAG,QAAO;AACrC,MAAID,EAAO,iBAAiB,KAAM,QAAO;AAEzC,QAAME,IAAM,KAAK,IAAA,GACXC,IAAOF,IAAaC;AAE1B,SAAIC,KAAQ,IAAU,YAClBA,KAAQJ,IAAO,KAAK,KAAK,KAAK,MAAa,SAExC;AACT;"}

package/dist/date/interval.cjs.map

@@ -1 +1 @@
-{"version":3,"file":"interval.cjs","sources":["../../src/date/interval.ts"],"sourcesContent":["import { assert } from '../function/assert';\nimport { isDate } from '../typed/isDate';\n\ntype IntervalType = 'D' | 'W' | 'M' | 'MS' | 'ME' | 'Y' | 'YS' | 'YE';\ntype IntervalOptions = {\n  interval?: IntervalType;\n  steps?: number;\n  latest?: boolean;\n};\n\n/**\n * Generates an array of dates between a start and end date, with a specified interval and step size.\n *\n * @example\n * ```ts\n * const options = { interval: 'D', steps: 1, latest: false };\n *\n * interval('2022-01-01', '2022-01-31', options); // Returns an array of dates for every day in January 2022\n * ```\n *\n * @param start - The start date (Date object or ISO string).\n * @param end - The end date (Date object or ISO string).\n * @param options - Options for an interval and steps.\n *\n * @returns An array of generated dates.\n */\nexport function interval(\n  start: Date | string,\n  end: Date | string,\n  { interval = 'D', steps = 1, latest = false }: IntervalOptions = {},\n): Date[] {\n  const startDate = new Date(start);\n  const endDate = new Date(end);\n\n  assert([isDate(startDate), isDate(endDate)], 'Invalid date format. Use a valid Date object or ISO string.', {\n    args: { end, start },\n    type: TypeError,\n  });\n\n  const dateArray: Date[] = [];\n  let currentDate = new Date(incrementDate(startDate, interval, 0));\n\n  while (currentDate <= endDate) {\n    dateArray.push(currentDate);\n    currentDate = new Date(incrementDate(currentDate, interval, steps));\n  }\n\n  if (latest && dateArray.length > 0 && dateArray[dateArray.length - 1] < endDate) {\n    dateArray.push(endDate);\n  }\n\n  return dateArray;\n}\n\nfunction incrementDate(date: Date, interval: IntervalType, steps: number): Date {\n  const year = date.getFullYear();\n  const month = date.getMonth();\n  const day = date.getDate();\n\n  switch (interval) {\n    case 'D':\n      return new Date(Date.UTC(year, month, day + steps));\n    case 'W':\n      return new Date(Date.UTC(year, month, day + 7 * steps));\n    case 'M':\n      return new Date(Date.UTC(year, month + steps, day));\n    case 'MS':\n      return new Date(Date.UTC(year, month + steps, 1));\n    case 'ME':\n      return new Date(Date.UTC(year, month + steps + 1, 0));\n    case 'Y':\n      return new Date(Date.UTC(year + steps, month, day));\n    case 'YS':\n      return new Date(Date.UTC(year + steps, 0, 1));\n    case 'YE':\n      return new Date(Date.UTC(year + steps, 11, 31));\n  }\n}\n"],"names":["interval","start","end","steps","latest","startDate","endDate","assert","isDate","dateArray","currentDate","incrementDate","date","year","month","day"],"mappings":"2JA0BO,SAASA,EACdC,EACAC,EACA,CAAE,SAAAF,EAAW,IAAK,MAAAG,EAAQ,EAAG,OAAAC,EAAS,EAAA,EAA2B,CAAA,EACzD,CACR,MAAMC,EAAY,IAAI,KAAKJ,CAAK,EAC1BK,EAAU,IAAI,KAAKJ,CAAG,EAE5BK,EAAAA,OAAO,CAACC,EAAAA,OAAOH,CAAS,EAAGG,EAAAA,OAAOF,CAAO,CAAC,EAAG,8DAA+D,CAC1G,KAAM,CAAE,IAAAJ,EAAK,MAAAD,CAAA,EACb,KAAM,SAAA,CACP,EAED,MAAMQ,EAAoB,CAAA,EAC1B,IAAIC,EAAc,IAAI,KAAKC,EAAcN,EAAWL,EAAU,CAAC,CAAC,EAEhE,KAAOU,GAAeJ,GACpBG,EAAU,KAAKC,CAAW,EAC1BA,EAAc,IAAI,KAAKC,EAAcD,EAAaV,EAAUG,CAAK,CAAC,EAGpE,OAAIC,GAAUK,EAAU,OAAS,GAAKA,EAAUA,EAAU,OAAS,CAAC,EAAIH,GACtEG,EAAU,KAAKH,CAAO,EAGjBG,CACT,CAEA,SAASE,EAAcC,EAAYZ,EAAwBG,EAAqB,CAC9E,MAAMU,EAAOD,EAAK,YAAA,EACZE,EAAQF,EAAK,SAAA,EACbG,EAAMH,EAAK,QAAA,EAEjB,OAAQZ,EAAAA,CACN,IAAK,IACH,OAAO,IAAI,KAAK,KAAK,IAAIa,EAAMC,EAAOC,EAAMZ,CAAK,CAAC,EACpD,IAAK,IACH,OAAO,IAAI,KAAK,KAAK,IAAIU,EAAMC,EAAOC,EAAM,EAAIZ,CAAK,CAAC,EACxD,IAAK,IACH,OAAO,IAAI,KAAK,KAAK,IAAIU,EAAMC,EAAQX,EAAOY,CAAG,CAAC,EACpD,IAAK,KACH,OAAO,IAAI,KAAK,KAAK,IAAIF,EAAMC,EAAQX,EAAO,CAAC,CAAC,EAClD,IAAK,KACH,OAAO,IAAI,KAAK,KAAK,IAAIU,EAAMC,EAAQX,EAAQ,EAAG,CAAC,CAAC,EACtD,IAAK,IACH,OAAO,IAAI,KAAK,KAAK,IAAIU,EAAOV,EAAOW,EAAOC,CAAG,CAAC,EACpD,IAAK,KACH,OAAO,IAAI,KAAK,KAAK,IAAIF,EAAOV,EAAO,EAAG,CAAC,CAAC,EAC9C,IAAK,KACH,OAAO,IAAI,KAAK,KAAK,IAAIU,EAAOV,EAAO,GAAI,EAAE,CAAC,CAAA,CAEpD"}
+{"version":3,"file":"interval.cjs","sources":["../../src/date/interval.ts"],"sourcesContent":["import { assert } from '../function/assert';\nimport { isDate } from '../typed/isDate';\n\n// #region IntervalTypes\ntype IntervalType = 'D' | 'W' | 'M' | 'MS' | 'ME' | 'Y' | 'YS' | 'YE';\ntype IntervalOptions = {\n  interval?: IntervalType;\n  steps?: number;\n  latest?: boolean;\n};\n// #endregion IntervalTypes\n\n/**\n * Generates an array of dates between a start and end date, with a specified interval and step size.\n *\n * @example\n * ```ts\n * const options = { interval: 'D', steps: 1, latest: false };\n *\n * interval('2022-01-01', '2022-01-31', options); // Returns an array of dates for every day in January 2022\n * ```\n *\n * @param start - The start date (Date object or ISO string).\n * @param end - The end date (Date object or ISO string).\n * @param options - Options for an interval and steps.\n *\n * @returns An array of generated dates.\n */\nexport function interval(\n  start: Date | string,\n  end: Date | string,\n  { interval = 'D', steps = 1, latest = false }: IntervalOptions = {},\n): Date[] {\n  const startDate = new Date(start);\n  const endDate = new Date(end);\n\n  assert([isDate(startDate), isDate(endDate)], 'Invalid date format. Use a valid Date object or ISO string.', {\n    args: { end, start },\n    type: TypeError,\n  });\n\n  const dateArray: Date[] = [];\n  let currentDate = new Date(incrementDate(startDate, interval, 0));\n\n  while (currentDate <= endDate) {\n    dateArray.push(currentDate);\n    currentDate = new Date(incrementDate(currentDate, interval, steps));\n  }\n\n  if (latest && dateArray.length > 0 && dateArray[dateArray.length - 1] < endDate) {\n    dateArray.push(endDate);\n  }\n\n  return dateArray;\n}\n\nfunction incrementDate(date: Date, interval: IntervalType, steps: number): Date {\n  const year = date.getFullYear();\n  const month = date.getMonth();\n  const day = date.getDate();\n\n  switch (interval) {\n    case 'D':\n      return new Date(Date.UTC(year, month, day + steps));\n    case 'W':\n      return new Date(Date.UTC(year, month, day + 7 * steps));\n    case 'M':\n      return new Date(Date.UTC(year, month + steps, day));\n    case 'MS':\n      return new Date(Date.UTC(year, month + steps, 1));\n    case 'ME':\n      return new Date(Date.UTC(year, month + steps + 1, 0));\n    case 'Y':\n      return new Date(Date.UTC(year + steps, month, day));\n    case 'YS':\n      return new Date(Date.UTC(year + steps, 0, 1));\n    case 'YE':\n      return new Date(Date.UTC(year + steps, 11, 31));\n  }\n}\n"],"names":["interval","start","end","steps","latest","startDate","endDate","assert","isDate","dateArray","currentDate","incrementDate","date","year","month","day"],"mappings":"2JA4BO,SAASA,EACdC,EACAC,EACA,CAAE,SAAAF,EAAW,IAAK,MAAAG,EAAQ,EAAG,OAAAC,EAAS,EAAA,EAA2B,CAAA,EACzD,CACR,MAAMC,EAAY,IAAI,KAAKJ,CAAK,EAC1BK,EAAU,IAAI,KAAKJ,CAAG,EAE5BK,EAAAA,OAAO,CAACC,EAAAA,OAAOH,CAAS,EAAGG,EAAAA,OAAOF,CAAO,CAAC,EAAG,8DAA+D,CAC1G,KAAM,CAAE,IAAAJ,EAAK,MAAAD,CAAA,EACb,KAAM,SAAA,CACP,EAED,MAAMQ,EAAoB,CAAA,EAC1B,IAAIC,EAAc,IAAI,KAAKC,EAAcN,EAAWL,EAAU,CAAC,CAAC,EAEhE,KAAOU,GAAeJ,GACpBG,EAAU,KAAKC,CAAW,EAC1BA,EAAc,IAAI,KAAKC,EAAcD,EAAaV,EAAUG,CAAK,CAAC,EAGpE,OAAIC,GAAUK,EAAU,OAAS,GAAKA,EAAUA,EAAU,OAAS,CAAC,EAAIH,GACtEG,EAAU,KAAKH,CAAO,EAGjBG,CACT,CAEA,SAASE,EAAcC,EAAYZ,EAAwBG,EAAqB,CAC9E,MAAMU,EAAOD,EAAK,YAAA,EACZE,EAAQF,EAAK,SAAA,EACbG,EAAMH,EAAK,QAAA,EAEjB,OAAQZ,EAAAA,CACN,IAAK,IACH,OAAO,IAAI,KAAK,KAAK,IAAIa,EAAMC,EAAOC,EAAMZ,CAAK,CAAC,EACpD,IAAK,IACH,OAAO,IAAI,KAAK,KAAK,IAAIU,EAAMC,EAAOC,EAAM,EAAIZ,CAAK,CAAC,EACxD,IAAK,IACH,OAAO,IAAI,KAAK,KAAK,IAAIU,EAAMC,EAAQX,EAAOY,CAAG,CAAC,EACpD,IAAK,KACH,OAAO,IAAI,KAAK,KAAK,IAAIF,EAAMC,EAAQX,EAAO,CAAC,CAAC,EAClD,IAAK,KACH,OAAO,IAAI,KAAK,KAAK,IAAIU,EAAMC,EAAQX,EAAQ,EAAG,CAAC,CAAC,EACtD,IAAK,IACH,OAAO,IAAI,KAAK,KAAK,IAAIU,EAAOV,EAAOW,EAAOC,CAAG,CAAC,EACpD,IAAK,KACH,OAAO,IAAI,KAAK,KAAK,IAAIF,EAAOV,EAAO,EAAG,CAAC,CAAC,EAC9C,IAAK,KACH,OAAO,IAAI,KAAK,KAAK,IAAIU,EAAOV,EAAO,GAAI,EAAE,CAAC,CAAA,CAEpD"}

package/dist/date/interval.js.map

@@ -1 +1 @@
-{"version":3,"file":"interval.js","sources":["../../src/date/interval.ts"],"sourcesContent":["import { assert } from '../function/assert';\nimport { isDate } from '../typed/isDate';\n\ntype IntervalType = 'D' | 'W' | 'M' | 'MS' | 'ME' | 'Y' | 'YS' | 'YE';\ntype IntervalOptions = {\n  interval?: IntervalType;\n  steps?: number;\n  latest?: boolean;\n};\n\n/**\n * Generates an array of dates between a start and end date, with a specified interval and step size.\n *\n * @example\n * ```ts\n * const options = { interval: 'D', steps: 1, latest: false };\n *\n * interval('2022-01-01', '2022-01-31', options); // Returns an array of dates for every day in January 2022\n * ```\n *\n * @param start - The start date (Date object or ISO string).\n * @param end - The end date (Date object or ISO string).\n * @param options - Options for an interval and steps.\n *\n * @returns An array of generated dates.\n */\nexport function interval(\n  start: Date | string,\n  end: Date | string,\n  { interval = 'D', steps = 1, latest = false }: IntervalOptions = {},\n): Date[] {\n  const startDate = new Date(start);\n  const endDate = new Date(end);\n\n  assert([isDate(startDate), isDate(endDate)], 'Invalid date format. Use a valid Date object or ISO string.', {\n    args: { end, start },\n    type: TypeError,\n  });\n\n  const dateArray: Date[] = [];\n  let currentDate = new Date(incrementDate(startDate, interval, 0));\n\n  while (currentDate <= endDate) {\n    dateArray.push(currentDate);\n    currentDate = new Date(incrementDate(currentDate, interval, steps));\n  }\n\n  if (latest && dateArray.length > 0 && dateArray[dateArray.length - 1] < endDate) {\n    dateArray.push(endDate);\n  }\n\n  return dateArray;\n}\n\nfunction incrementDate(date: Date, interval: IntervalType, steps: number): Date {\n  const year = date.getFullYear();\n  const month = date.getMonth();\n  const day = date.getDate();\n\n  switch (interval) {\n    case 'D':\n      return new Date(Date.UTC(year, month, day + steps));\n    case 'W':\n      return new Date(Date.UTC(year, month, day + 7 * steps));\n    case 'M':\n      return new Date(Date.UTC(year, month + steps, day));\n    case 'MS':\n      return new Date(Date.UTC(year, month + steps, 1));\n    case 'ME':\n      return new Date(Date.UTC(year, month + steps + 1, 0));\n    case 'Y':\n      return new Date(Date.UTC(year + steps, month, day));\n    case 'YS':\n      return new Date(Date.UTC(year + steps, 0, 1));\n    case 'YE':\n      return new Date(Date.UTC(year + steps, 11, 31));\n  }\n}\n"],"names":["interval","start","end","steps","latest","startDate","endDate","assert","isDate","dateArray","currentDate","incrementDate","date","year","month","day"],"mappings":";;AA0BO,SAASA,EACdC,GACAC,GACA,EAAE,UAAAF,IAAW,KAAK,OAAAG,IAAQ,GAAG,QAAAC,IAAS,GAAA,IAA2B,CAAA,GACzD;AACR,QAAMC,IAAY,IAAI,KAAKJ,CAAK,GAC1BK,IAAU,IAAI,KAAKJ,CAAG;AAE5B,EAAAK,EAAO,CAACC,EAAOH,CAAS,GAAGG,EAAOF,CAAO,CAAC,GAAG,+DAA+D;AAAA,IAC1G,MAAM,EAAE,KAAAJ,GAAK,OAAAD,EAAA;AAAA,IACb,MAAM;AAAA,EAAA,CACP;AAED,QAAMQ,IAAoB,CAAA;AAC1B,MAAIC,IAAc,IAAI,KAAKC,EAAcN,GAAWL,GAAU,CAAC,CAAC;AAEhE,SAAOU,KAAeJ;AACpB,IAAAG,EAAU,KAAKC,CAAW,GAC1BA,IAAc,IAAI,KAAKC,EAAcD,GAAaV,GAAUG,CAAK,CAAC;AAGpE,SAAIC,KAAUK,EAAU,SAAS,KAAKA,EAAUA,EAAU,SAAS,CAAC,IAAIH,KACtEG,EAAU,KAAKH,CAAO,GAGjBG;AACT;AAEA,SAASE,EAAcC,GAAYZ,GAAwBG,GAAqB;AAC9E,QAAMU,IAAOD,EAAK,YAAA,GACZE,IAAQF,EAAK,SAAA,GACbG,IAAMH,EAAK,QAAA;AAEjB,UAAQZ,GAAAA;AAAAA,IACN,KAAK;AACH,aAAO,IAAI,KAAK,KAAK,IAAIa,GAAMC,GAAOC,IAAMZ,CAAK,CAAC;AAAA,IACpD,KAAK;AACH,aAAO,IAAI,KAAK,KAAK,IAAIU,GAAMC,GAAOC,IAAM,IAAIZ,CAAK,CAAC;AAAA,IACxD,KAAK;AACH,aAAO,IAAI,KAAK,KAAK,IAAIU,GAAMC,IAAQX,GAAOY,CAAG,CAAC;AAAA,IACpD,KAAK;AACH,aAAO,IAAI,KAAK,KAAK,IAAIF,GAAMC,IAAQX,GAAO,CAAC,CAAC;AAAA,IAClD,KAAK;AACH,aAAO,IAAI,KAAK,KAAK,IAAIU,GAAMC,IAAQX,IAAQ,GAAG,CAAC,CAAC;AAAA,IACtD,KAAK;AACH,aAAO,IAAI,KAAK,KAAK,IAAIU,IAAOV,GAAOW,GAAOC,CAAG,CAAC;AAAA,IACpD,KAAK;AACH,aAAO,IAAI,KAAK,KAAK,IAAIF,IAAOV,GAAO,GAAG,CAAC,CAAC;AAAA,IAC9C,KAAK;AACH,aAAO,IAAI,KAAK,KAAK,IAAIU,IAAOV,GAAO,IAAI,EAAE,CAAC;AAAA,EAAA;AAEpD;"}
+{"version":3,"file":"interval.js","sources":["../../src/date/interval.ts"],"sourcesContent":["import { assert } from '../function/assert';\nimport { isDate } from '../typed/isDate';\n\n// #region IntervalTypes\ntype IntervalType = 'D' | 'W' | 'M' | 'MS' | 'ME' | 'Y' | 'YS' | 'YE';\ntype IntervalOptions = {\n  interval?: IntervalType;\n  steps?: number;\n  latest?: boolean;\n};\n// #endregion IntervalTypes\n\n/**\n * Generates an array of dates between a start and end date, with a specified interval and step size.\n *\n * @example\n * ```ts\n * const options = { interval: 'D', steps: 1, latest: false };\n *\n * interval('2022-01-01', '2022-01-31', options); // Returns an array of dates for every day in January 2022\n * ```\n *\n * @param start - The start date (Date object or ISO string).\n * @param end - The end date (Date object or ISO string).\n * @param options - Options for an interval and steps.\n *\n * @returns An array of generated dates.\n */\nexport function interval(\n  start: Date | string,\n  end: Date | string,\n  { interval = 'D', steps = 1, latest = false }: IntervalOptions = {},\n): Date[] {\n  const startDate = new Date(start);\n  const endDate = new Date(end);\n\n  assert([isDate(startDate), isDate(endDate)], 'Invalid date format. Use a valid Date object or ISO string.', {\n    args: { end, start },\n    type: TypeError,\n  });\n\n  const dateArray: Date[] = [];\n  let currentDate = new Date(incrementDate(startDate, interval, 0));\n\n  while (currentDate <= endDate) {\n    dateArray.push(currentDate);\n    currentDate = new Date(incrementDate(currentDate, interval, steps));\n  }\n\n  if (latest && dateArray.length > 0 && dateArray[dateArray.length - 1] < endDate) {\n    dateArray.push(endDate);\n  }\n\n  return dateArray;\n}\n\nfunction incrementDate(date: Date, interval: IntervalType, steps: number): Date {\n  const year = date.getFullYear();\n  const month = date.getMonth();\n  const day = date.getDate();\n\n  switch (interval) {\n    case 'D':\n      return new Date(Date.UTC(year, month, day + steps));\n    case 'W':\n      return new Date(Date.UTC(year, month, day + 7 * steps));\n    case 'M':\n      return new Date(Date.UTC(year, month + steps, day));\n    case 'MS':\n      return new Date(Date.UTC(year, month + steps, 1));\n    case 'ME':\n      return new Date(Date.UTC(year, month + steps + 1, 0));\n    case 'Y':\n      return new Date(Date.UTC(year + steps, month, day));\n    case 'YS':\n      return new Date(Date.UTC(year + steps, 0, 1));\n    case 'YE':\n      return new Date(Date.UTC(year + steps, 11, 31));\n  }\n}\n"],"names":["interval","start","end","steps","latest","startDate","endDate","assert","isDate","dateArray","currentDate","incrementDate","date","year","month","day"],"mappings":";;AA4BO,SAASA,EACdC,GACAC,GACA,EAAE,UAAAF,IAAW,KAAK,OAAAG,IAAQ,GAAG,QAAAC,IAAS,GAAA,IAA2B,CAAA,GACzD;AACR,QAAMC,IAAY,IAAI,KAAKJ,CAAK,GAC1BK,IAAU,IAAI,KAAKJ,CAAG;AAE5B,EAAAK,EAAO,CAACC,EAAOH,CAAS,GAAGG,EAAOF,CAAO,CAAC,GAAG,+DAA+D;AAAA,IAC1G,MAAM,EAAE,KAAAJ,GAAK,OAAAD,EAAA;AAAA,IACb,MAAM;AAAA,EAAA,CACP;AAED,QAAMQ,IAAoB,CAAA;AAC1B,MAAIC,IAAc,IAAI,KAAKC,EAAcN,GAAWL,GAAU,CAAC,CAAC;AAEhE,SAAOU,KAAeJ;AACpB,IAAAG,EAAU,KAAKC,CAAW,GAC1BA,IAAc,IAAI,KAAKC,EAAcD,GAAaV,GAAUG,CAAK,CAAC;AAGpE,SAAIC,KAAUK,EAAU,SAAS,KAAKA,EAAUA,EAAU,SAAS,CAAC,IAAIH,KACtEG,EAAU,KAAKH,CAAO,GAGjBG;AACT;AAEA,SAASE,EAAcC,GAAYZ,GAAwBG,GAAqB;AAC9E,QAAMU,IAAOD,EAAK,YAAA,GACZE,IAAQF,EAAK,SAAA,GACbG,IAAMH,EAAK,QAAA;AAEjB,UAAQZ,GAAAA;AAAAA,IACN,KAAK;AACH,aAAO,IAAI,KAAK,KAAK,IAAIa,GAAMC,GAAOC,IAAMZ,CAAK,CAAC;AAAA,IACpD,KAAK;AACH,aAAO,IAAI,KAAK,KAAK,IAAIU,GAAMC,GAAOC,IAAM,IAAIZ,CAAK,CAAC;AAAA,IACxD,KAAK;AACH,aAAO,IAAI,KAAK,KAAK,IAAIU,GAAMC,IAAQX,GAAOY,CAAG,CAAC;AAAA,IACpD,KAAK;AACH,aAAO,IAAI,KAAK,KAAK,IAAIF,GAAMC,IAAQX,GAAO,CAAC,CAAC;AAAA,IAClD,KAAK;AACH,aAAO,IAAI,KAAK,KAAK,IAAIU,GAAMC,IAAQX,IAAQ,GAAG,CAAC,CAAC;AAAA,IACtD,KAAK;AACH,aAAO,IAAI,KAAK,KAAK,IAAIU,IAAOV,GAAOW,GAAOC,CAAG,CAAC;AAAA,IACpD,KAAK;AACH,aAAO,IAAI,KAAK,KAAK,IAAIF,IAAOV,GAAO,GAAG,CAAC,CAAC;AAAA,IAC9C,KAAK;AACH,aAAO,IAAI,KAAK,KAAK,IAAIU,IAAOV,GAAO,IAAI,EAAE,CAAC;AAAA,EAAA;AAEpD;"}

package/dist/date/timeDiff.cjs

@@ -1,2 +1,2 @@
-"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});let a=["YEAR","MONTH","WEEK","DAY","HOUR","MINUTE","SECOND"];const f=1e3,c=60*f,N=60*c,e=24*N,D=7*e,_=30*e,S=365*e,R=[{ms:S,unit:"YEAR"},{ms:_,unit:"MONTH"},{ms:D,unit:"WEEK"},{ms:e,unit:"DAY"},{ms:N,unit:"HOUR"},{ms:c,unit:"MINUTE"},{ms:f,unit:"SECOND"}];function M(t,i=new Date,l=a){const o=typeof t=="string"?Date.parse(t):t.getTime(),E=typeof i=="string"?Date.parse(i):i.getTime();if(Number.isNaN(o)||Number.isNaN(E))return{unit:"INVALID_DATE",value:0};const s=R.filter(n=>l.includes(n.unit)),u=Math.abs(o-E),r=s[s.length-1]?.unit??"SECOND";if(u<=0)return{unit:r,value:0};for(const{ms:n,unit:m}of s)if(u>=n)return{unit:m,value:Math.floor(u/n)};return{unit:r,value:0}}M.defaultUnits=t=>{a=t};exports.timeDiff=M;
+"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});let c=["YEAR","MONTH","WEEK","DAY","HOUR","MINUTE","SECOND"];const f=1e3,N=60*f,m=60*N,n=24*m,D=7*n,_=30*n,S=365*n,R=[{ms:S,unit:"YEAR"},{ms:_,unit:"MONTH"},{ms:D,unit:"WEEK"},{ms:n,unit:"DAY"},{ms:m,unit:"HOUR"},{ms:N,unit:"MINUTE"},{ms:f,unit:"SECOND"}];function M(t,e=new Date,l=c){const o=typeof t=="string"?Date.parse(t):t.getTime(),a=typeof e=="string"?Date.parse(e):e.getTime();if(Number.isNaN(o)||Number.isNaN(a))return{unit:"INVALID_DATE",value:0};const i=R.filter(E=>l.includes(E.unit)),s=Math.abs(o-a),r=i[i.length-1]?.unit??"SECOND";if(s<=0)return{unit:r,value:0};const u=i.find(E=>s>=E.ms);return u?{unit:u.unit,value:Math.floor(s/u.ms)}:{unit:r,value:0}}M.defaultUnits=t=>{c=t};exports.timeDiff=M;
 //# sourceMappingURL=timeDiff.cjs.map

package/dist/date/timeDiff.cjs.map

@@ -1 +1 @@
-{"version":3,"file":"timeDiff.cjs","sources":["../../src/date/timeDiff.ts"],"sourcesContent":["export type TimeUnit = 'YEAR' | 'MONTH' | 'WEEK' | 'DAY' | 'HOUR' | 'MINUTE' | 'SECOND' | 'INVALID_DATE';\nexport type TimeDirection = 'FUTURE' | 'PAST';\nexport type TimeResult = { unit: TimeUnit; value: number };\n\nlet defaultUnits: TimeUnit[] = ['YEAR', 'MONTH', 'WEEK', 'DAY', 'HOUR', 'MINUTE', 'SECOND'];\n\nconst MS_PER_SECOND = 1000;\nconst MS_PER_MINUTE = 60 * MS_PER_SECOND;\nconst MS_PER_HOUR = 60 * MS_PER_MINUTE;\nconst MS_PER_DAY = 24 * MS_PER_HOUR;\nconst MS_PER_WEEK = 7 * MS_PER_DAY;\nconst MS_PER_MONTH = 30 * MS_PER_DAY;\nconst MS_PER_YEAR = 365 * MS_PER_DAY;\n\nconst TIME_UNITS = [\n  { ms: MS_PER_YEAR, unit: 'YEAR' as const },\n  { ms: MS_PER_MONTH, unit: 'MONTH' as const },\n  { ms: MS_PER_WEEK, unit: 'WEEK' as const },\n  { ms: MS_PER_DAY, unit: 'DAY' as const },\n  { ms: MS_PER_HOUR, unit: 'HOUR' as const },\n  { ms: MS_PER_MINUTE, unit: 'MINUTE' as const },\n  { ms: MS_PER_SECOND, unit: 'SECOND' as const },\n];\n\n/**\n * Calculates the remaining time until a target date.\n *\n * @example\n * ```ts\n * timeDiff(new Date(Date.now() + 1000 * 60 * 60 * 24 * 5)); // { value: 5, unit: 'DAY' }\n * timeDiff(new Date(Date.now() - 1000 * 60 * 60 * 24 * 3), 'past'); // { value: 3, unit: 'DAY' }\n * timeDiff(new Date(Date.now() + 1000 * 60 * 60 * 24 * 31)); // { value: 1, unit: 'MONTH' }\n * timeDiff(new Date(Date.now() + 1000 * 60 * 60 * 24 * 365)); // { value: 1, unit: 'YEAR' }\n * ```\n *\n * @param a - The target date (Date object or ISO string).\n * @param b - The target date (Date object or ISO string).\n * @param allowedUnits - (optional) array of units to filter the result. If provided, only these units will be considered.\n *\n * @returns An object containing the remaining time and its unit ('DAY', 'HOUR', or 'MINUTE').\n */\nexport function timeDiff(\n  a: Date | string,\n  b: Date | string = new Date(),\n  allowedUnits: TimeUnit[] = defaultUnits,\n): TimeResult {\n  const aDate = typeof a === 'string' ? Date.parse(a) : a.getTime();\n  const bDate = typeof b === 'string' ? Date.parse(b) : b.getTime();\n\n  if (Number.isNaN(aDate) || Number.isNaN(bDate)) {\n    return { unit: 'INVALID_DATE', value: 0 };\n  }\n\n  const units = TIME_UNITS.filter((u) => allowedUnits.includes(u.unit));\n  const diff = Math.abs(aDate - bDate);\n  const smallestUnit = units[units.length - 1]?.unit ?? 'SECOND';\n\n  if (diff <= 0) {\n    return { unit: smallestUnit, value: 0 };\n  }\n\n  for (const { ms, unit } of units) {\n    if (diff >= ms) {\n      return { unit, value: Math.floor(diff / ms) };\n    }\n  }\n\n  return { unit: smallestUnit, value: 0 };\n}\n\ntimeDiff.defaultUnits = (units: TimeUnit[]) => {\n  defaultUnits = units;\n};\n"],"names":["defaultUnits","MS_PER_SECOND","MS_PER_MINUTE","MS_PER_HOUR","MS_PER_DAY","MS_PER_WEEK","MS_PER_MONTH","MS_PER_YEAR","TIME_UNITS","timeDiff","a","b","allowedUnits","aDate","bDate","units","u","diff","smallestUnit","ms","unit"],"mappings":"gFAIA,IAAIA,EAA2B,CAAC,OAAQ,QAAS,OAAQ,MAAO,OAAQ,SAAU,QAAQ,EAE1F,MAAMC,EAAgB,IAChBC,EAAgB,GAAKD,EACrBE,EAAc,GAAKD,EACnBE,EAAa,GAAKD,EAClBE,EAAc,EAAID,EAClBE,EAAe,GAAKF,EACpBG,EAAc,IAAMH,EAEpBI,EAAa,CACjB,CAAE,GAAID,EAAa,KAAM,MAAA,EACzB,CAAE,GAAID,EAAc,KAAM,OAAA,EAC1B,CAAE,GAAID,EAAa,KAAM,MAAA,EACzB,CAAE,GAAID,EAAY,KAAM,KAAA,EACxB,CAAE,GAAID,EAAa,KAAM,MAAA,EACzB,CAAE,GAAID,EAAe,KAAM,QAAA,EAC3B,CAAE,GAAID,EAAe,KAAM,QAAA,CAC7B,EAmBO,SAASQ,EACdC,EACAC,MAAuB,KACvBC,EAA2BZ,EACf,CACZ,MAAMa,EAAQ,OAAOH,GAAM,SAAW,KAAK,MAAMA,CAAC,EAAIA,EAAE,QAAA,EAClDI,EAAQ,OAAOH,GAAM,SAAW,KAAK,MAAMA,CAAC,EAAIA,EAAE,QAAA,EAExD,GAAI,OAAO,MAAME,CAAK,GAAK,OAAO,MAAMC,CAAK,EAC3C,MAAO,CAAE,KAAM,eAAgB,MAAO,CAAA,EAGxC,MAAMC,EAAQP,EAAW,OAAQQ,GAAMJ,EAAa,SAASI,EAAE,IAAI,CAAC,EAC9DC,EAAO,KAAK,IAAIJ,EAAQC,CAAK,EAC7BI,EAAeH,EAAMA,EAAM,OAAS,CAAC,GAAG,MAAQ,SAEtD,GAAIE,GAAQ,EACV,MAAO,CAAE,KAAMC,EAAc,MAAO,CAAA,EAGtC,SAAW,CAAE,GAAAC,EAAI,KAAAC,CAAA,IAAUL,EACzB,GAAIE,GAAQE,EACV,MAAO,CAAE,KAAAC,EAAM,MAAO,KAAK,MAAMH,EAAOE,CAAE,CAAA,EAI9C,MAAO,CAAE,KAAMD,EAAc,MAAO,CAAA,CACtC,CAEAT,EAAS,aAAgBM,GAAsB,CAC7Cf,EAAee,CACjB"}
+{"version":3,"file":"timeDiff.cjs","sources":["../../src/date/timeDiff.ts"],"sourcesContent":["// #region TimeDiffTypes\nexport type TimeUnit = 'YEAR' | 'MONTH' | 'WEEK' | 'DAY' | 'HOUR' | 'MINUTE' | 'SECOND' | 'INVALID_DATE';\nexport type TimeDirection = 'FUTURE' | 'PAST';\nexport type TimeResult = { unit: TimeUnit; value: number };\n// #endregion TimeDiffTypes\n\nlet defaultUnits: TimeUnit[] = ['YEAR', 'MONTH', 'WEEK', 'DAY', 'HOUR', 'MINUTE', 'SECOND'];\n\nconst MS_PER_SECOND = 1000;\nconst MS_PER_MINUTE = 60 * MS_PER_SECOND;\nconst MS_PER_HOUR = 60 * MS_PER_MINUTE;\nconst MS_PER_DAY = 24 * MS_PER_HOUR;\nconst MS_PER_WEEK = 7 * MS_PER_DAY;\nconst MS_PER_MONTH = 30 * MS_PER_DAY;\nconst MS_PER_YEAR = 365 * MS_PER_DAY;\n\nconst TIME_UNITS = [\n  { ms: MS_PER_YEAR, unit: 'YEAR' as const },\n  { ms: MS_PER_MONTH, unit: 'MONTH' as const },\n  { ms: MS_PER_WEEK, unit: 'WEEK' as const },\n  { ms: MS_PER_DAY, unit: 'DAY' as const },\n  { ms: MS_PER_HOUR, unit: 'HOUR' as const },\n  { ms: MS_PER_MINUTE, unit: 'MINUTE' as const },\n  { ms: MS_PER_SECOND, unit: 'SECOND' as const },\n];\n\n/**\n * Calculates the remaining time until a target date.\n *\n * @example\n * ```ts\n * timeDiff(new Date(Date.now() + 1000 * 60 * 60 * 24 * 5)); // { value: 5, unit: 'DAY' }\n * timeDiff(new Date(Date.now() - 1000 * 60 * 60 * 24 * 3), 'past'); // { value: 3, unit: 'DAY' }\n * timeDiff(new Date(Date.now() + 1000 * 60 * 60 * 24 * 31)); // { value: 1, unit: 'MONTH' }\n * timeDiff(new Date(Date.now() + 1000 * 60 * 60 * 24 * 365)); // { value: 1, unit: 'YEAR' }\n * ```\n *\n * @param a - The target date (Date object or ISO string).\n * @param b - The target date (Date object or ISO string).\n * @param allowedUnits - (optional) array of units to filter the result. If provided, only these units will be considered.\n *\n * @returns An object containing the remaining time and its unit ('DAY', 'HOUR', or 'MINUTE').\n */\nexport function timeDiff(\n  a: Date | string,\n  b: Date | string = new Date(),\n  allowedUnits: TimeUnit[] = defaultUnits,\n): TimeResult {\n  const aDate = typeof a === 'string' ? Date.parse(a) : a.getTime();\n  const bDate = typeof b === 'string' ? Date.parse(b) : b.getTime();\n\n  if (Number.isNaN(aDate) || Number.isNaN(bDate)) {\n    return { unit: 'INVALID_DATE', value: 0 };\n  }\n\n  const units = TIME_UNITS.filter((u) => allowedUnits.includes(u.unit));\n  const diff = Math.abs(aDate - bDate);\n  const smallestUnit = units[units.length - 1]?.unit ?? 'SECOND';\n\n  if (diff <= 0) {\n    return { unit: smallestUnit, value: 0 };\n  }\n\n  // Find the largest unit that fits\n  const bestUnit = units.find((u) => diff >= u.ms);\n\n  if (bestUnit) {\n    return { unit: bestUnit.unit, value: Math.floor(diff / bestUnit.ms) };\n  }\n\n  return { unit: smallestUnit, value: 0 };\n}\n\ntimeDiff.defaultUnits = (units: TimeUnit[]) => {\n  defaultUnits = units;\n};\n"],"names":["defaultUnits","MS_PER_SECOND","MS_PER_MINUTE","MS_PER_HOUR","MS_PER_DAY","MS_PER_WEEK","MS_PER_MONTH","MS_PER_YEAR","TIME_UNITS","timeDiff","a","b","allowedUnits","aDate","bDate","units","u","diff","smallestUnit","bestUnit"],"mappings":"gFAMA,IAAIA,EAA2B,CAAC,OAAQ,QAAS,OAAQ,MAAO,OAAQ,SAAU,QAAQ,EAE1F,MAAMC,EAAgB,IAChBC,EAAgB,GAAKD,EACrBE,EAAc,GAAKD,EACnBE,EAAa,GAAKD,EAClBE,EAAc,EAAID,EAClBE,EAAe,GAAKF,EACpBG,EAAc,IAAMH,EAEpBI,EAAa,CACjB,CAAE,GAAID,EAAa,KAAM,MAAA,EACzB,CAAE,GAAID,EAAc,KAAM,OAAA,EAC1B,CAAE,GAAID,EAAa,KAAM,MAAA,EACzB,CAAE,GAAID,EAAY,KAAM,KAAA,EACxB,CAAE,GAAID,EAAa,KAAM,MAAA,EACzB,CAAE,GAAID,EAAe,KAAM,QAAA,EAC3B,CAAE,GAAID,EAAe,KAAM,QAAA,CAC7B,EAmBO,SAASQ,EACdC,EACAC,MAAuB,KACvBC,EAA2BZ,EACf,CACZ,MAAMa,EAAQ,OAAOH,GAAM,SAAW,KAAK,MAAMA,CAAC,EAAIA,EAAE,QAAA,EAClDI,EAAQ,OAAOH,GAAM,SAAW,KAAK,MAAMA,CAAC,EAAIA,EAAE,QAAA,EAExD,GAAI,OAAO,MAAME,CAAK,GAAK,OAAO,MAAMC,CAAK,EAC3C,MAAO,CAAE,KAAM,eAAgB,MAAO,CAAA,EAGxC,MAAMC,EAAQP,EAAW,OAAQQ,GAAMJ,EAAa,SAASI,EAAE,IAAI,CAAC,EAC9DC,EAAO,KAAK,IAAIJ,EAAQC,CAAK,EAC7BI,EAAeH,EAAMA,EAAM,OAAS,CAAC,GAAG,MAAQ,SAEtD,GAAIE,GAAQ,EACV,MAAO,CAAE,KAAMC,EAAc,MAAO,CAAA,EAItC,MAAMC,EAAWJ,EAAM,KAAMC,GAAMC,GAAQD,EAAE,EAAE,EAE/C,OAAIG,EACK,CAAE,KAAMA,EAAS,KAAM,MAAO,KAAK,MAAMF,EAAOE,EAAS,EAAE,CAAA,EAG7D,CAAE,KAAMD,EAAc,MAAO,CAAA,CACtC,CAEAT,EAAS,aAAgBM,GAAsB,CAC7Cf,EAAee,CACjB"}

package/dist/date/timeDiff.js

@@ -8,22 +8,20 @@ const N = [
   { ms: 6e4, unit: "MINUTE" },
   { ms: 1e3, unit: "SECOND" }
 ];
-function o(t, n = /* @__PURE__ */ new Date(), u = R) {
-  const e = typeof t == "string" ? Date.parse(t) : t.getTime(), i = typeof n == "string" ? Date.parse(n) : n.getTime();
-  if (Number.isNaN(e) || Number.isNaN(i))
+function D(t, n = /* @__PURE__ */ new Date(), S = R) {
+  const i = typeof t == "string" ? Date.parse(t) : t.getTime(), M = typeof n == "string" ? Date.parse(n) : n.getTime();
+  if (Number.isNaN(i) || Number.isNaN(M))
     return { unit: "INVALID_DATE", value: 0 };
-  const _ = N.filter((E) => u.includes(E.unit)), s = Math.abs(e - i), M = _[_.length - 1]?.unit ?? "SECOND";
-  if (s <= 0)
-    return { unit: M, value: 0 };
-  for (const { ms: E, unit: S } of _)
-    if (s >= E)
-      return { unit: S, value: Math.floor(s / E) };
-  return { unit: M, value: 0 };
+  const E = N.filter((e) => S.includes(e.unit)), _ = Math.abs(i - M), u = E[E.length - 1]?.unit ?? "SECOND";
+  if (_ <= 0)
+    return { unit: u, value: 0 };
+  const s = E.find((e) => _ >= e.ms);
+  return s ? { unit: s.unit, value: Math.floor(_ / s.ms) } : { unit: u, value: 0 };
 }
-o.defaultUnits = (t) => {
+D.defaultUnits = (t) => {
   R = t;
 };
 export {
-  o as timeDiff
+  D as timeDiff
 };
 //# sourceMappingURL=timeDiff.js.map

package/dist/date/timeDiff.js.map

@@ -1 +1 @@
-{"version":3,"file":"timeDiff.js","sources":["../../src/date/timeDiff.ts"],"sourcesContent":["export type TimeUnit = 'YEAR' | 'MONTH' | 'WEEK' | 'DAY' | 'HOUR' | 'MINUTE' | 'SECOND' | 'INVALID_DATE';\nexport type TimeDirection = 'FUTURE' | 'PAST';\nexport type TimeResult = { unit: TimeUnit; value: number };\n\nlet defaultUnits: TimeUnit[] = ['YEAR', 'MONTH', 'WEEK', 'DAY', 'HOUR', 'MINUTE', 'SECOND'];\n\nconst MS_PER_SECOND = 1000;\nconst MS_PER_MINUTE = 60 * MS_PER_SECOND;\nconst MS_PER_HOUR = 60 * MS_PER_MINUTE;\nconst MS_PER_DAY = 24 * MS_PER_HOUR;\nconst MS_PER_WEEK = 7 * MS_PER_DAY;\nconst MS_PER_MONTH = 30 * MS_PER_DAY;\nconst MS_PER_YEAR = 365 * MS_PER_DAY;\n\nconst TIME_UNITS = [\n  { ms: MS_PER_YEAR, unit: 'YEAR' as const },\n  { ms: MS_PER_MONTH, unit: 'MONTH' as const },\n  { ms: MS_PER_WEEK, unit: 'WEEK' as const },\n  { ms: MS_PER_DAY, unit: 'DAY' as const },\n  { ms: MS_PER_HOUR, unit: 'HOUR' as const },\n  { ms: MS_PER_MINUTE, unit: 'MINUTE' as const },\n  { ms: MS_PER_SECOND, unit: 'SECOND' as const },\n];\n\n/**\n * Calculates the remaining time until a target date.\n *\n * @example\n * ```ts\n * timeDiff(new Date(Date.now() + 1000 * 60 * 60 * 24 * 5)); // { value: 5, unit: 'DAY' }\n * timeDiff(new Date(Date.now() - 1000 * 60 * 60 * 24 * 3), 'past'); // { value: 3, unit: 'DAY' }\n * timeDiff(new Date(Date.now() + 1000 * 60 * 60 * 24 * 31)); // { value: 1, unit: 'MONTH' }\n * timeDiff(new Date(Date.now() + 1000 * 60 * 60 * 24 * 365)); // { value: 1, unit: 'YEAR' }\n * ```\n *\n * @param a - The target date (Date object or ISO string).\n * @param b - The target date (Date object or ISO string).\n * @param allowedUnits - (optional) array of units to filter the result. If provided, only these units will be considered.\n *\n * @returns An object containing the remaining time and its unit ('DAY', 'HOUR', or 'MINUTE').\n */\nexport function timeDiff(\n  a: Date | string,\n  b: Date | string = new Date(),\n  allowedUnits: TimeUnit[] = defaultUnits,\n): TimeResult {\n  const aDate = typeof a === 'string' ? Date.parse(a) : a.getTime();\n  const bDate = typeof b === 'string' ? Date.parse(b) : b.getTime();\n\n  if (Number.isNaN(aDate) || Number.isNaN(bDate)) {\n    return { unit: 'INVALID_DATE', value: 0 };\n  }\n\n  const units = TIME_UNITS.filter((u) => allowedUnits.includes(u.unit));\n  const diff = Math.abs(aDate - bDate);\n  const smallestUnit = units[units.length - 1]?.unit ?? 'SECOND';\n\n  if (diff <= 0) {\n    return { unit: smallestUnit, value: 0 };\n  }\n\n  for (const { ms, unit } of units) {\n    if (diff >= ms) {\n      return { unit, value: Math.floor(diff / ms) };\n    }\n  }\n\n  return { unit: smallestUnit, value: 0 };\n}\n\ntimeDiff.defaultUnits = (units: TimeUnit[]) => {\n  defaultUnits = units;\n};\n"],"names":["defaultUnits","TIME_UNITS","timeDiff","a","b","allowedUnits","aDate","bDate","units","u","diff","smallestUnit","ms","unit"],"mappings":"AAIA,IAAIA,IAA2B,CAAC,QAAQ,SAAS,QAAQ,OAAO,QAAQ,UAAU,QAAQ;AAU1F,MAAMC,IAAa;AAAA,EACjB,EAAE,IAAI,SAAa,MAAM,OAAA;AAAA,EACzB,EAAE,IAAI,QAAc,MAAM,QAAA;AAAA,EAC1B,EAAE,IAAI,QAAa,MAAM,OAAA;AAAA,EACzB,EAAE,IAAI,OAAY,MAAM,MAAA;AAAA,EACxB,EAAE,IAAI,MAAa,MAAM,OAAA;AAAA,EACzB,EAAE,IAAI,KAAe,MAAM,SAAA;AAAA,EAC3B,EAAE,IAAI,KAAe,MAAM,SAAA;AAC7B;AAmBO,SAASC,EACdC,GACAC,wBAAuB,KAAA,GACvBC,IAA2BL,GACf;AACZ,QAAMM,IAAQ,OAAOH,KAAM,WAAW,KAAK,MAAMA,CAAC,IAAIA,EAAE,QAAA,GAClDI,IAAQ,OAAOH,KAAM,WAAW,KAAK,MAAMA,CAAC,IAAIA,EAAE,QAAA;AAExD,MAAI,OAAO,MAAME,CAAK,KAAK,OAAO,MAAMC,CAAK;AAC3C,WAAO,EAAE,MAAM,gBAAgB,OAAO,EAAA;AAGxC,QAAMC,IAAQP,EAAW,OAAO,CAACQ,MAAMJ,EAAa,SAASI,EAAE,IAAI,CAAC,GAC9DC,IAAO,KAAK,IAAIJ,IAAQC,CAAK,GAC7BI,IAAeH,EAAMA,EAAM,SAAS,CAAC,GAAG,QAAQ;AAEtD,MAAIE,KAAQ;AACV,WAAO,EAAE,MAAMC,GAAc,OAAO,EAAA;AAGtC,aAAW,EAAE,IAAAC,GAAI,MAAAC,EAAA,KAAUL;AACzB,QAAIE,KAAQE;AACV,aAAO,EAAE,MAAAC,GAAM,OAAO,KAAK,MAAMH,IAAOE,CAAE,EAAA;AAI9C,SAAO,EAAE,MAAMD,GAAc,OAAO,EAAA;AACtC;AAEAT,EAAS,eAAe,CAACM,MAAsB;AAC7C,EAAAR,IAAeQ;AACjB;"}
+{"version":3,"file":"timeDiff.js","sources":["../../src/date/timeDiff.ts"],"sourcesContent":["// #region TimeDiffTypes\nexport type TimeUnit = 'YEAR' | 'MONTH' | 'WEEK' | 'DAY' | 'HOUR' | 'MINUTE' | 'SECOND' | 'INVALID_DATE';\nexport type TimeDirection = 'FUTURE' | 'PAST';\nexport type TimeResult = { unit: TimeUnit; value: number };\n// #endregion TimeDiffTypes\n\nlet defaultUnits: TimeUnit[] = ['YEAR', 'MONTH', 'WEEK', 'DAY', 'HOUR', 'MINUTE', 'SECOND'];\n\nconst MS_PER_SECOND = 1000;\nconst MS_PER_MINUTE = 60 * MS_PER_SECOND;\nconst MS_PER_HOUR = 60 * MS_PER_MINUTE;\nconst MS_PER_DAY = 24 * MS_PER_HOUR;\nconst MS_PER_WEEK = 7 * MS_PER_DAY;\nconst MS_PER_MONTH = 30 * MS_PER_DAY;\nconst MS_PER_YEAR = 365 * MS_PER_DAY;\n\nconst TIME_UNITS = [\n  { ms: MS_PER_YEAR, unit: 'YEAR' as const },\n  { ms: MS_PER_MONTH, unit: 'MONTH' as const },\n  { ms: MS_PER_WEEK, unit: 'WEEK' as const },\n  { ms: MS_PER_DAY, unit: 'DAY' as const },\n  { ms: MS_PER_HOUR, unit: 'HOUR' as const },\n  { ms: MS_PER_MINUTE, unit: 'MINUTE' as const },\n  { ms: MS_PER_SECOND, unit: 'SECOND' as const },\n];\n\n/**\n * Calculates the remaining time until a target date.\n *\n * @example\n * ```ts\n * timeDiff(new Date(Date.now() + 1000 * 60 * 60 * 24 * 5)); // { value: 5, unit: 'DAY' }\n * timeDiff(new Date(Date.now() - 1000 * 60 * 60 * 24 * 3), 'past'); // { value: 3, unit: 'DAY' }\n * timeDiff(new Date(Date.now() + 1000 * 60 * 60 * 24 * 31)); // { value: 1, unit: 'MONTH' }\n * timeDiff(new Date(Date.now() + 1000 * 60 * 60 * 24 * 365)); // { value: 1, unit: 'YEAR' }\n * ```\n *\n * @param a - The target date (Date object or ISO string).\n * @param b - The target date (Date object or ISO string).\n * @param allowedUnits - (optional) array of units to filter the result. If provided, only these units will be considered.\n *\n * @returns An object containing the remaining time and its unit ('DAY', 'HOUR', or 'MINUTE').\n */\nexport function timeDiff(\n  a: Date | string,\n  b: Date | string = new Date(),\n  allowedUnits: TimeUnit[] = defaultUnits,\n): TimeResult {\n  const aDate = typeof a === 'string' ? Date.parse(a) : a.getTime();\n  const bDate = typeof b === 'string' ? Date.parse(b) : b.getTime();\n\n  if (Number.isNaN(aDate) || Number.isNaN(bDate)) {\n    return { unit: 'INVALID_DATE', value: 0 };\n  }\n\n  const units = TIME_UNITS.filter((u) => allowedUnits.includes(u.unit));\n  const diff = Math.abs(aDate - bDate);\n  const smallestUnit = units[units.length - 1]?.unit ?? 'SECOND';\n\n  if (diff <= 0) {\n    return { unit: smallestUnit, value: 0 };\n  }\n\n  // Find the largest unit that fits\n  const bestUnit = units.find((u) => diff >= u.ms);\n\n  if (bestUnit) {\n    return { unit: bestUnit.unit, value: Math.floor(diff / bestUnit.ms) };\n  }\n\n  return { unit: smallestUnit, value: 0 };\n}\n\ntimeDiff.defaultUnits = (units: TimeUnit[]) => {\n  defaultUnits = units;\n};\n"],"names":["defaultUnits","TIME_UNITS","timeDiff","a","b","allowedUnits","aDate","bDate","units","u","diff","smallestUnit","bestUnit"],"mappings":"AAMA,IAAIA,IAA2B,CAAC,QAAQ,SAAS,QAAQ,OAAO,QAAQ,UAAU,QAAQ;AAU1F,MAAMC,IAAa;AAAA,EACjB,EAAE,IAAI,SAAa,MAAM,OAAA;AAAA,EACzB,EAAE,IAAI,QAAc,MAAM,QAAA;AAAA,EAC1B,EAAE,IAAI,QAAa,MAAM,OAAA;AAAA,EACzB,EAAE,IAAI,OAAY,MAAM,MAAA;AAAA,EACxB,EAAE,IAAI,MAAa,MAAM,OAAA;AAAA,EACzB,EAAE,IAAI,KAAe,MAAM,SAAA;AAAA,EAC3B,EAAE,IAAI,KAAe,MAAM,SAAA;AAC7B;AAmBO,SAASC,EACdC,GACAC,wBAAuB,KAAA,GACvBC,IAA2BL,GACf;AACZ,QAAMM,IAAQ,OAAOH,KAAM,WAAW,KAAK,MAAMA,CAAC,IAAIA,EAAE,QAAA,GAClDI,IAAQ,OAAOH,KAAM,WAAW,KAAK,MAAMA,CAAC,IAAIA,EAAE,QAAA;AAExD,MAAI,OAAO,MAAME,CAAK,KAAK,OAAO,MAAMC,CAAK;AAC3C,WAAO,EAAE,MAAM,gBAAgB,OAAO,EAAA;AAGxC,QAAMC,IAAQP,EAAW,OAAO,CAACQ,MAAMJ,EAAa,SAASI,EAAE,IAAI,CAAC,GAC9DC,IAAO,KAAK,IAAIJ,IAAQC,CAAK,GAC7BI,IAAeH,EAAMA,EAAM,SAAS,CAAC,GAAG,QAAQ;AAEtD,MAAIE,KAAQ;AACV,WAAO,EAAE,MAAMC,GAAc,OAAO,EAAA;AAItC,QAAMC,IAAWJ,EAAM,KAAK,CAACC,MAAMC,KAAQD,EAAE,EAAE;AAE/C,SAAIG,IACK,EAAE,MAAMA,EAAS,MAAM,OAAO,KAAK,MAAMF,IAAOE,EAAS,EAAE,EAAA,IAG7D,EAAE,MAAMD,GAAc,OAAO,EAAA;AACtC;AAEAT,EAAS,eAAe,CAACM,MAAsB;AAC7C,EAAAR,IAAeQ;AACjB;"}

package/dist/function/curry.cjs

@@ -1,2 +1,2 @@
-"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const n=t=>{const e=(...r)=>r.length>=t.length?t(...r):(...c)=>e(...r.concat(c));return e};exports.curry=n;
+"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});function c(e,u=e.length){const t=(...r)=>r.length>=u?e(...r):(...n)=>t(...r,...n);return t}exports.curry=c;
 //# sourceMappingURL=curry.cjs.map

package/dist/function/curry.cjs.map

@@ -1 +1 @@
-{"version":3,"file":"curry.cjs","sources":["../../src/function/curry.ts"],"sourcesContent":["/**\n * Curries a function, allowing it to be called with partial arguments.\n *\n * @example\n * ```ts\n * const add = (a: number, b: number) => a + b;\n * const curriedAdd = curry(add);\n * curriedAdd(1)(2) // 3;\n * ```\n *\n * @param fn - The function to curry.\n *\n * @returns A curried version of the function.\n */\n\n// biome-ignore lint/suspicious/noExplicitAny: -\nexport const curry = <T extends (...args: any[]) => any>(fn: T) => {\n  // biome-ignore lint/suspicious/noExplicitAny: -\n  const curried = (...args: Parameters<T>): any => {\n    if (args.length >= fn.length) {\n      return fn(...args);\n    }\n    return (...rest: Exclude<Parameters<T>, typeof args>) => curried(...(args.concat(rest) as Parameters<T>));\n  };\n  return curried as T extends (...args: infer P) => infer R ? CurriedFunction<P, R> : never;\n};\n\n// biome-ignore lint/suspicious/noExplicitAny: -\ntype CurriedFunction<Params extends any[], R> = Params extends [infer A, ...infer Rest]\n  ? (arg: A) => CurriedFunction<Rest, R>\n  : R;\n"],"names":["curry","fn","curried","args","rest"],"mappings":"gFAgBO,MAAMA,EAA4CC,GAAU,CAEjE,MAAMC,EAAU,IAAIC,IACdA,EAAK,QAAUF,EAAG,OACbA,EAAG,GAAGE,CAAI,EAEZ,IAAIC,IAA8CF,EAAQ,GAAIC,EAAK,OAAOC,CAAI,CAAmB,EAE1G,OAAOF,CACT"}
+{"version":3,"file":"curry.cjs","sources":["../../src/function/curry.ts"],"sourcesContent":["/** biome-ignore-all lint/suspicious/noExplicitAny: - */\n\n/**\n * Curries a function, allowing it to be called with partial arguments.\n *\n * @example\n * ```ts\n * const add = (a: number, b: number) => a + b;\n * const curriedAdd = curry(add);\n * curriedAdd(1)(2) // 3;\n * ```\n *\n * @param fn - The function to curry.\n * @param arity - The number of arguments the function expects. Defaults to the function's length.\n *\n * @returns A curried version of the function.\n */\n\n// Take first N items from tuple T\ntype Take<N extends number, T extends readonly unknown[], Acc extends readonly unknown[] = []> = Acc['length'] extends N\n  ? Acc\n  : T extends readonly [infer H, ...infer R]\n    ? Take<N, R, readonly [...Acc, H]>\n    : Acc;\n// Curried: at each step, accept a non-empty tuple of args A,\n// ensure it's a prefix of P, then either return R (if done) or recurse.\nexport type Curried<P extends readonly unknown[], R> = P extends readonly []\n  ? () => R\n  : <A extends readonly [unknown, ...(readonly unknown[])]>(\n      ...args: A\n    ) => P extends readonly [...A, ...infer Rest] ? (Rest extends readonly [] ? R : Curried<Rest, R>) : never;\n// Overloads to reflect default arity vs. a custom arity.\nexport function curry<T extends (...args: any[]) => any>(fn: T): Curried<Parameters<T>, ReturnType<T>>;\nexport function curry<T extends (...args: any[]) => any, N extends number>(\n  fn: T,\n  arity: N,\n): Curried<Take<N, Parameters<T>>, ReturnType<T>>;\n// Runtime implementation\nexport function curry(fn: (...args: any[]) => any, arity = fn.length) {\n  const curried = (...args: any[]): any => {\n    if (args.length >= arity) {\n      return fn(...args);\n    }\n    return (...rest: any[]) => curried(...args, ...rest);\n  };\n  return curried as any;\n}\n"],"names":["curry","fn","arity","curried","args","rest"],"mappings":"gFAsCO,SAASA,EAAMC,EAA6BC,EAAQD,EAAG,OAAQ,CACpE,MAAME,EAAU,IAAIC,IACdA,EAAK,QAAUF,EACVD,EAAG,GAAGG,CAAI,EAEZ,IAAIC,IAAgBF,EAAQ,GAAGC,EAAM,GAAGC,CAAI,EAErD,OAAOF,CACT"}

package/dist/function/curry.js

@@ -1,7 +1,7 @@
-const c = (t) => {
-  const e = (...r) => r.length >= t.length ? t(...r) : (...n) => e(...r.concat(n));
+function c(t, n = t.length) {
+  const e = (...r) => r.length >= n ? t(...r) : (...u) => e(...r, ...u);
   return e;
-};
+}
 export {
   c as curry
 };

package/dist/function/curry.js.map

@@ -1 +1 @@
-{"version":3,"file":"curry.js","sources":["../../src/function/curry.ts"],"sourcesContent":["/**\n * Curries a function, allowing it to be called with partial arguments.\n *\n * @example\n * ```ts\n * const add = (a: number, b: number) => a + b;\n * const curriedAdd = curry(add);\n * curriedAdd(1)(2) // 3;\n * ```\n *\n * @param fn - The function to curry.\n *\n * @returns A curried version of the function.\n */\n\n// biome-ignore lint/suspicious/noExplicitAny: -\nexport const curry = <T extends (...args: any[]) => any>(fn: T) => {\n  // biome-ignore lint/suspicious/noExplicitAny: -\n  const curried = (...args: Parameters<T>): any => {\n    if (args.length >= fn.length) {\n      return fn(...args);\n    }\n    return (...rest: Exclude<Parameters<T>, typeof args>) => curried(...(args.concat(rest) as Parameters<T>));\n  };\n  return curried as T extends (...args: infer P) => infer R ? CurriedFunction<P, R> : never;\n};\n\n// biome-ignore lint/suspicious/noExplicitAny: -\ntype CurriedFunction<Params extends any[], R> = Params extends [infer A, ...infer Rest]\n  ? (arg: A) => CurriedFunction<Rest, R>\n  : R;\n"],"names":["curry","fn","curried","args","rest"],"mappings":"AAgBO,MAAMA,IAAQ,CAAoCC,MAAU;AAEjE,QAAMC,IAAU,IAAIC,MACdA,EAAK,UAAUF,EAAG,SACbA,EAAG,GAAGE,CAAI,IAEZ,IAAIC,MAA8CF,EAAQ,GAAIC,EAAK,OAAOC,CAAI,CAAmB;AAE1G,SAAOF;AACT;"}
+{"version":3,"file":"curry.js","sources":["../../src/function/curry.ts"],"sourcesContent":["/** biome-ignore-all lint/suspicious/noExplicitAny: - */\n\n/**\n * Curries a function, allowing it to be called with partial arguments.\n *\n * @example\n * ```ts\n * const add = (a: number, b: number) => a + b;\n * const curriedAdd = curry(add);\n * curriedAdd(1)(2) // 3;\n * ```\n *\n * @param fn - The function to curry.\n * @param arity - The number of arguments the function expects. Defaults to the function's length.\n *\n * @returns A curried version of the function.\n */\n\n// Take first N items from tuple T\ntype Take<N extends number, T extends readonly unknown[], Acc extends readonly unknown[] = []> = Acc['length'] extends N\n  ? Acc\n  : T extends readonly [infer H, ...infer R]\n    ? Take<N, R, readonly [...Acc, H]>\n    : Acc;\n// Curried: at each step, accept a non-empty tuple of args A,\n// ensure it's a prefix of P, then either return R (if done) or recurse.\nexport type Curried<P extends readonly unknown[], R> = P extends readonly []\n  ? () => R\n  : <A extends readonly [unknown, ...(readonly unknown[])]>(\n      ...args: A\n    ) => P extends readonly [...A, ...infer Rest] ? (Rest extends readonly [] ? R : Curried<Rest, R>) : never;\n// Overloads to reflect default arity vs. a custom arity.\nexport function curry<T extends (...args: any[]) => any>(fn: T): Curried<Parameters<T>, ReturnType<T>>;\nexport function curry<T extends (...args: any[]) => any, N extends number>(\n  fn: T,\n  arity: N,\n): Curried<Take<N, Parameters<T>>, ReturnType<T>>;\n// Runtime implementation\nexport function curry(fn: (...args: any[]) => any, arity = fn.length) {\n  const curried = (...args: any[]): any => {\n    if (args.length >= arity) {\n      return fn(...args);\n    }\n    return (...rest: any[]) => curried(...args, ...rest);\n  };\n  return curried as any;\n}\n"],"names":["curry","fn","arity","curried","args","rest"],"mappings":"AAsCO,SAASA,EAAMC,GAA6BC,IAAQD,EAAG,QAAQ;AACpE,QAAME,IAAU,IAAIC,MACdA,EAAK,UAAUF,IACVD,EAAG,GAAGG,CAAI,IAEZ,IAAIC,MAAgBF,EAAQ,GAAGC,GAAM,GAAGC,CAAI;AAErD,SAAOF;AACT;"}

package/dist/function/debounce.cjs

@@ -1,2 +1,2 @@
-"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});function i(t,o=300){let e;return(...u)=>{clearTimeout(e),e=setTimeout(()=>t(...u),o)}}exports.debounce=i;
+"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const l=require("./assert.cjs");function v(s,o=300){l.assert(typeof s=="function","First argument must be a function",{args:{fn:s},type:TypeError}),l.assert(typeof o=="number"&&o>=0,"Delay must be a non-negative number",{args:{delay:o},type:TypeError});let e,t,r,c;const i=()=>{e!==void 0&&(clearTimeout(e),e=void 0)},a=()=>{if(i(),!t)return;const u=t,d=r;return t=void 0,r=void 0,c=s.apply(d,u),c},n=function(...u){t=u,r=this,i(),e=setTimeout(a,o)};return n.cancel=()=>{i(),t=void 0,r=void 0},n.flush=()=>a(),n.pending=()=>e!==void 0,n}exports.debounce=v;
 //# sourceMappingURL=debounce.cjs.map

package/dist/function/debounce.cjs.map

@@ -1 +1 @@
-{"version":3,"file":"debounce.cjs","sources":["../../src/function/debounce.ts"],"sourcesContent":["import type { Fn } from '../types';\n\n/**\n * Creates a debounced function that delays invoking the provided function until after\n * a specified wait time has elapsed since the last invocation.\n *\n * @example\n * ```ts\n * const debouncedLog = debounce(console.log, 1000);\n *\n * debouncedLog('Hello'); // Will log after 1 second if not called again\n * debouncedLog('World'); // Resets the timer, will log 'World' after 1 second\n * ```\n *\n * @param fn - The function to debounce.\n * @param [delay=300] - - The number of milliseconds to delay invoking the function.\n *\n * @returns - A debounced function\n */\nexport function debounce<T extends Fn>(fn: T, delay = 300): (...args: Parameters<T>) => void {\n  let timeoutId: ReturnType<typeof setTimeout>;\n\n  return (...args: Parameters<T>) => {\n    clearTimeout(timeoutId);\n    timeoutId = setTimeout(() => fn(...args), delay);\n  };\n}\n"],"names":["debounce","fn","delay","timeoutId","args"],"mappings":"gFAmBO,SAASA,EAAuBC,EAAOC,EAAQ,IAAuC,CAC3F,IAAIC,EAEJ,MAAO,IAAIC,IAAwB,CACjC,aAAaD,CAAS,EACtBA,EAAY,WAAW,IAAMF,EAAG,GAAGG,CAAI,EAAGF,CAAK,CACjD,CACF"}
+{"version":3,"file":"debounce.cjs","sources":["../../src/function/debounce.ts"],"sourcesContent":["import type { Fn } from '../types';\nimport { assert } from './assert';\n\nexport type Debounced<T extends Fn> = ((this: ThisParameterType<T>, ...args: Parameters<T>) => void) & {\n  cancel(): void;\n  flush(): ReturnType<T> | undefined;\n  pending(): boolean;\n};\n\n/**\n * Debounce a function (trailing). Use `flush` to invoke immediately,\n * `cancel` to clear, and `pending` to check if an invocation is scheduled.\n */\nexport function debounce<T extends Fn>(fn: T, delay = 300): Debounced<T> {\n  assert(typeof fn === 'function', 'First argument must be a function', {\n    args: { fn },\n    type: TypeError,\n  });\n  assert(typeof delay === 'number' && delay >= 0, 'Delay must be a non-negative number', {\n    args: { delay },\n    type: TypeError,\n  });\n\n  let timer: ReturnType<typeof setTimeout> | undefined;\n  let lastArgs: Parameters<T> | undefined;\n  let lastThis: ThisParameterType<T> | undefined;\n  let lastResult: ReturnType<T> | undefined;\n\n  const clearTimer = () => {\n    if (timer !== undefined) {\n      clearTimeout(timer);\n      timer = undefined;\n    }\n  };\n\n  const invoke = () => {\n    clearTimer();\n    if (!lastArgs) return undefined; // nothing to invoke\n    const args = lastArgs;\n    const ctx = lastThis as ThisParameterType<T>;\n    lastArgs = undefined;\n    lastThis = undefined;\n    // biome-ignore lint/suspicious/noExplicitAny: -\n    lastResult = fn.apply(ctx as any, args);\n    return lastResult;\n  };\n\n  const debounced = function (this: ThisParameterType<T>, ...args: Parameters<T>) {\n    lastArgs = args;\n    lastThis = this;\n    clearTimer();\n    timer = setTimeout(invoke, delay);\n  } as Debounced<T>;\n\n  debounced.cancel = () => {\n    clearTimer();\n    lastArgs = undefined;\n    lastThis = undefined;\n  };\n\n  debounced.flush = () => invoke() as ReturnType<T> | undefined;\n\n  debounced.pending = () => timer !== undefined;\n\n  return debounced;\n}\n"],"names":["debounce","fn","delay","assert","timer","lastArgs","lastThis","lastResult","clearTimer","invoke","args","ctx","debounced"],"mappings":"gHAaO,SAASA,EAAuBC,EAAOC,EAAQ,IAAmB,CACvEC,EAAAA,OAAO,OAAOF,GAAO,WAAY,oCAAqC,CACpE,KAAM,CAAE,GAAAA,CAAA,EACR,KAAM,SAAA,CACP,EACDE,EAAAA,OAAO,OAAOD,GAAU,UAAYA,GAAS,EAAG,sCAAuC,CACrF,KAAM,CAAE,MAAAA,CAAA,EACR,KAAM,SAAA,CACP,EAED,IAAIE,EACAC,EACAC,EACAC,EAEJ,MAAMC,EAAa,IAAM,CACnBJ,IAAU,SACZ,aAAaA,CAAK,EAClBA,EAAQ,OAEZ,EAEMK,EAAS,IAAM,CAEnB,GADAD,EAAA,EACI,CAACH,EAAU,OACf,MAAMK,EAAOL,EACPM,EAAML,EACZ,OAAAD,EAAW,OACXC,EAAW,OAEXC,EAAaN,EAAG,MAAMU,EAAYD,CAAI,EAC/BH,CACT,EAEMK,EAAY,YAAyCF,EAAqB,CAC9EL,EAAWK,EACXJ,EAAW,KACXE,EAAA,EACAJ,EAAQ,WAAWK,EAAQP,CAAK,CAClC,EAEA,OAAAU,EAAU,OAAS,IAAM,CACvBJ,EAAA,EACAH,EAAW,OACXC,EAAW,MACb,EAEAM,EAAU,MAAQ,IAAMH,EAAA,EAExBG,EAAU,QAAU,IAAMR,IAAU,OAE7BQ,CACT"}

package/dist/function/debounce.js

@@ -1,10 +1,27 @@
-function i(t, o = 300) {
-  let e;
-  return (...u) => {
-    clearTimeout(e), e = setTimeout(() => t(...u), o);
+import { assert as l } from "./assert.js";
+function v(i, o = 300) {
+  l(typeof i == "function", "First argument must be a function", {
+    args: { fn: i },
+    type: TypeError
+  }), l(typeof o == "number" && o >= 0, "Delay must be a non-negative number", {
+    args: { delay: o },
+    type: TypeError
+  });
+  let t, e, r, c;
+  const s = () => {
+    t !== void 0 && (clearTimeout(t), t = void 0);
+  }, a = () => {
+    if (s(), !e) return;
+    const u = e, m = r;
+    return e = void 0, r = void 0, c = i.apply(m, u), c;
+  }, n = function(...u) {
+    e = u, r = this, s(), t = setTimeout(a, o);
   };
+  return n.cancel = () => {
+    s(), e = void 0, r = void 0;
+  }, n.flush = () => a(), n.pending = () => t !== void 0, n;
 }
 export {
-  i as debounce
+  v as debounce
 };
 //# sourceMappingURL=debounce.js.map

package/dist/function/debounce.js.map

@@ -1 +1 @@
-{"version":3,"file":"debounce.js","sources":["../../src/function/debounce.ts"],"sourcesContent":["import type { Fn } from '../types';\n\n/**\n * Creates a debounced function that delays invoking the provided function until after\n * a specified wait time has elapsed since the last invocation.\n *\n * @example\n * ```ts\n * const debouncedLog = debounce(console.log, 1000);\n *\n * debouncedLog('Hello'); // Will log after 1 second if not called again\n * debouncedLog('World'); // Resets the timer, will log 'World' after 1 second\n * ```\n *\n * @param fn - The function to debounce.\n * @param [delay=300] - - The number of milliseconds to delay invoking the function.\n *\n * @returns - A debounced function\n */\nexport function debounce<T extends Fn>(fn: T, delay = 300): (...args: Parameters<T>) => void {\n  let timeoutId: ReturnType<typeof setTimeout>;\n\n  return (...args: Parameters<T>) => {\n    clearTimeout(timeoutId);\n    timeoutId = setTimeout(() => fn(...args), delay);\n  };\n}\n"],"names":["debounce","fn","delay","timeoutId","args"],"mappings":"AAmBO,SAASA,EAAuBC,GAAOC,IAAQ,KAAuC;AAC3F,MAAIC;AAEJ,SAAO,IAAIC,MAAwB;AACjC,iBAAaD,CAAS,GACtBA,IAAY,WAAW,MAAMF,EAAG,GAAGG,CAAI,GAAGF,CAAK;AAAA,EACjD;AACF;"}
+{"version":3,"file":"debounce.js","sources":["../../src/function/debounce.ts"],"sourcesContent":["import type { Fn } from '../types';\nimport { assert } from './assert';\n\nexport type Debounced<T extends Fn> = ((this: ThisParameterType<T>, ...args: Parameters<T>) => void) & {\n  cancel(): void;\n  flush(): ReturnType<T> | undefined;\n  pending(): boolean;\n};\n\n/**\n * Debounce a function (trailing). Use `flush` to invoke immediately,\n * `cancel` to clear, and `pending` to check if an invocation is scheduled.\n */\nexport function debounce<T extends Fn>(fn: T, delay = 300): Debounced<T> {\n  assert(typeof fn === 'function', 'First argument must be a function', {\n    args: { fn },\n    type: TypeError,\n  });\n  assert(typeof delay === 'number' && delay >= 0, 'Delay must be a non-negative number', {\n    args: { delay },\n    type: TypeError,\n  });\n\n  let timer: ReturnType<typeof setTimeout> | undefined;\n  let lastArgs: Parameters<T> | undefined;\n  let lastThis: ThisParameterType<T> | undefined;\n  let lastResult: ReturnType<T> | undefined;\n\n  const clearTimer = () => {\n    if (timer !== undefined) {\n      clearTimeout(timer);\n      timer = undefined;\n    }\n  };\n\n  const invoke = () => {\n    clearTimer();\n    if (!lastArgs) return undefined; // nothing to invoke\n    const args = lastArgs;\n    const ctx = lastThis as ThisParameterType<T>;\n    lastArgs = undefined;\n    lastThis = undefined;\n    // biome-ignore lint/suspicious/noExplicitAny: -\n    lastResult = fn.apply(ctx as any, args);\n    return lastResult;\n  };\n\n  const debounced = function (this: ThisParameterType<T>, ...args: Parameters<T>) {\n    lastArgs = args;\n    lastThis = this;\n    clearTimer();\n    timer = setTimeout(invoke, delay);\n  } as Debounced<T>;\n\n  debounced.cancel = () => {\n    clearTimer();\n    lastArgs = undefined;\n    lastThis = undefined;\n  };\n\n  debounced.flush = () => invoke() as ReturnType<T> | undefined;\n\n  debounced.pending = () => timer !== undefined;\n\n  return debounced;\n}\n"],"names":["debounce","fn","delay","assert","timer","lastArgs","lastThis","lastResult","clearTimer","invoke","args","ctx","debounced"],"mappings":";AAaO,SAASA,EAAuBC,GAAOC,IAAQ,KAAmB;AACvE,EAAAC,EAAO,OAAOF,KAAO,YAAY,qCAAqC;AAAA,IACpE,MAAM,EAAE,IAAAA,EAAA;AAAA,IACR,MAAM;AAAA,EAAA,CACP,GACDE,EAAO,OAAOD,KAAU,YAAYA,KAAS,GAAG,uCAAuC;AAAA,IACrF,MAAM,EAAE,OAAAA,EAAA;AAAA,IACR,MAAM;AAAA,EAAA,CACP;AAED,MAAIE,GACAC,GACAC,GACAC;AAEJ,QAAMC,IAAa,MAAM;AACvB,IAAIJ,MAAU,WACZ,aAAaA,CAAK,GAClBA,IAAQ;AAAA,EAEZ,GAEMK,IAAS,MAAM;AAEnB,QADAD,EAAA,GACI,CAACH,EAAU;AACf,UAAMK,IAAOL,GACPM,IAAML;AACZ,WAAAD,IAAW,QACXC,IAAW,QAEXC,IAAaN,EAAG,MAAMU,GAAYD,CAAI,GAC/BH;AAAA,EACT,GAEMK,IAAY,YAAyCF,GAAqB;AAC9E,IAAAL,IAAWK,GACXJ,IAAW,MACXE,EAAA,GACAJ,IAAQ,WAAWK,GAAQP,CAAK;AAAA,EAClC;AAEA,SAAAU,EAAU,SAAS,MAAM;AACvB,IAAAJ,EAAA,GACAH,IAAW,QACXC,IAAW;AAAA,EACb,GAEAM,EAAU,QAAQ,MAAMH,EAAA,GAExBG,EAAU,UAAU,MAAMR,MAAU,QAE7BQ;AACT;"}

package/dist/function/memo.cjs

@@ -1,2 +1,2 @@
-"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});function f(l,{ttl:u,maxSize:i}={}){const t=new Map,s=n=>{if(n.length===0)return"__empty__";if(n.length===1){const e=n[0],r=typeof e;if(r==="string"||r==="number"||r==="boolean")return`${r}:${e}`;if(e===null)return"null";if(e===void 0)return"undefined"}return JSON.stringify(n)};return(...n)=>{const e=s(n),r=Date.now(),o=t.get(e);if(o&&(!u||r-o.timestamp<u))return t.delete(e),t.set(e,o),o.value;const c=l(...n);return t.set(e,{timestamp:r,value:c}),i&&t.size>i&&t.delete(t.keys().next().value),c}}exports.memo=f;
+"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});function m(f,{ttl:o,maxSize:i,resolver:c}={}){const n=new Map,s=t=>{if(c)return c(...t);if(t.length===0)return"__empty__";if(t.length===1){const e=t[0],r=typeof e;if(r==="string"||r==="number"||r==="boolean")return`${r}:${e}`;if(e===null)return"null";if(e===void 0)return"undefined"}return JSON.stringify(t)};return(...t)=>{const e=s(t),r=Date.now(),u=n.get(e);if(u&&(!o||r-u.timestamp<o))return n.delete(e),n.set(e,u),u.value;const l=f(...t);return n.set(e,{timestamp:r,value:l}),i&&n.size>i&&n.delete(n.keys().next().value),l}}exports.memo=m;
 //# sourceMappingURL=memo.cjs.map

package/dist/function/memo.cjs.map

@@ -1 +1 @@
-{"version":3,"file":"memo.cjs","sources":["../../src/function/memo.ts"],"sourcesContent":["/** biome-ignore-all lint/suspicious/noExplicitAny: - */\nimport type { Fn } from '../types';\n\ntype MemoizeOptions = {\n  ttl?: number; // Time-to-live in milliseconds\n  maxSize?: number; // Maximum number of items in cache\n};\n\ntype CacheEntry<T extends Fn> = {\n  value: ReturnType<T>;\n  timestamp: number;\n};\n\n/**\n * Creates a function that memorizes the result of the provided function.\n * Supports expiration (TTL) and limited cache size (LRU).\n *\n * @example\n * ```ts\n * const add = (x, y) => x + y;\n * const memoizedAdd = memo(add, { ttl: 5000, maxSize: 10 });\n *\n * memoizedAdd(1, 2); // 3 (caches the result)\n * memoizedAdd(1, 2); // 3 (from cache)\n * ```\n *\n * @param fn - The function to memorize.\n * @param options - Memoization options.\n * @param [options.ttl] - (optional) time-to-live (TTL) for cache expiration (in milliseconds).\n * @param [options.maxSize] - (optional) maximum cache size (LRU eviction).\n *\n * @returns A new function that memorizes the input function.\n */\nexport function memo<T extends Fn>(\n  fn: T,\n  { ttl, maxSize }: MemoizeOptions = {},\n): (...args: Parameters<T>) => ReturnType<T> {\n  const cache = new Map<string, CacheEntry<T>>();\n\n  const keyGen = (args: Parameters<T>): string => {\n    if (args.length === 0) return '__empty__';\n    if (args.length === 1) {\n      const arg = args[0];\n      const argType = typeof arg;\n      if (argType === 'string' || argType === 'number' || argType === 'boolean') {\n        return `${argType}:${arg}`;\n      }\n      if (arg === null) return 'null';\n      if (arg === undefined) return 'undefined';\n    }\n    return JSON.stringify(args);\n  };\n\n  return (...args: Parameters<T>): ReturnType<T> => {\n    const key = keyGen(args);\n    const now = Date.now();\n    const cached = cache.get(key);\n\n    if (cached && (!ttl || now - cached.timestamp < ttl)) {\n      cache.delete(key);\n      cache.set(key, cached); // Move to end (most recently used)\n      return cached.value;\n    }\n\n    const result = fn(...args);\n    cache.set(key, { timestamp: now, value: result });\n\n    if (maxSize && cache.size > maxSize) {\n      cache.delete(cache.keys().next().value!); // Remove least recently used\n    }\n\n    return result;\n  };\n}\n"],"names":["memo","fn","ttl","maxSize","cache","keyGen","args","arg","argType","key","now","cached","result"],"mappings":"gFAiCO,SAASA,EACdC,EACA,CAAE,IAAAC,EAAK,QAAAC,CAAA,EAA4B,CAAA,EACQ,CAC3C,MAAMC,MAAY,IAEZC,EAAUC,GAAgC,CAC9C,GAAIA,EAAK,SAAW,EAAG,MAAO,YAC9B,GAAIA,EAAK,SAAW,EAAG,CACrB,MAAMC,EAAMD,EAAK,CAAC,EACZE,EAAU,OAAOD,EACvB,GAAIC,IAAY,UAAYA,IAAY,UAAYA,IAAY,UAC9D,MAAO,GAAGA,CAAO,IAAID,CAAG,GAE1B,GAAIA,IAAQ,KAAM,MAAO,OACzB,GAAIA,IAAQ,OAAW,MAAO,WAChC,CACA,OAAO,KAAK,UAAUD,CAAI,CAC5B,EAEA,MAAO,IAAIA,IAAuC,CAChD,MAAMG,EAAMJ,EAAOC,CAAI,EACjBI,EAAM,KAAK,IAAA,EACXC,EAASP,EAAM,IAAIK,CAAG,EAE5B,GAAIE,IAAW,CAACT,GAAOQ,EAAMC,EAAO,UAAYT,GAC9C,OAAAE,EAAM,OAAOK,CAAG,EAChBL,EAAM,IAAIK,EAAKE,CAAM,EACdA,EAAO,MAGhB,MAAMC,EAASX,EAAG,GAAGK,CAAI,EACzB,OAAAF,EAAM,IAAIK,EAAK,CAAE,UAAWC,EAAK,MAAOE,EAAQ,EAE5CT,GAAWC,EAAM,KAAOD,GAC1BC,EAAM,OAAOA,EAAM,KAAA,EAAO,KAAA,EAAO,KAAM,EAGlCQ,CACT,CACF"}
+{"version":3,"file":"memo.cjs","sources":["../../src/function/memo.ts"],"sourcesContent":["/** biome-ignore-all lint/suspicious/noExplicitAny: - */\nimport type { Fn } from '../types';\n\n// #region MemoizeOptions\ntype MemoizeOptions<T extends Fn> = {\n  ttl?: number; // Time-to-live in milliseconds\n  maxSize?: number; // Maximum number of items in cache\n  resolver?: (...args: Parameters<T>) => string; // Custom key generator\n};\n// #endregion MemoizeOptions\n\ntype CacheEntry<T extends Fn> = {\n  value: ReturnType<T>;\n  timestamp: number;\n};\n\n/**\n * Creates a function that memorizes the result of the provided function.\n * Supports expiration (TTL) and limited cache size (LRU).\n *\n * @example\n * ```ts\n * const add = (x, y) => x + y;\n * const memoizedAdd = memo(add, { ttl: 5000, maxSize: 10 });\n *\n * memoizedAdd(1, 2); // 3 (caches the result)\n * memoizedAdd(1, 2); // 3 (from cache)\n * ```\n *\n * @param fn - The function to memorize.\n * @param options - Memoization options.\n * @param [options.ttl] - (optional) time-to-live (TTL) for cache expiration (in milliseconds).\n * @param [options.maxSize] - (optional) maximum cache size (LRU eviction).\n * @param [options.resolver] - (optional) custom function to resolve the cache key.\n *\n * @returns A new function that memorizes the input function.\n */\nexport function memo<T extends Fn>(\n  fn: T,\n  { ttl, maxSize, resolver }: MemoizeOptions<T> = {},\n): (...args: Parameters<T>) => ReturnType<T> {\n  const cache = new Map<string, CacheEntry<T>>();\n\n  // biome-ignore lint/complexity/noExcessiveCognitiveComplexity: -\n  const keyGen = (args: Parameters<T>): string => {\n    if (resolver) return resolver(...args);\n    if (args.length === 0) return '__empty__';\n    if (args.length === 1) {\n      const arg = args[0];\n      const argType = typeof arg;\n      if (argType === 'string' || argType === 'number' || argType === 'boolean') {\n        return `${argType}:${arg}`;\n      }\n      if (arg === null) return 'null';\n      if (arg === undefined) return 'undefined';\n    }\n    return JSON.stringify(args);\n  };\n\n  return (...args: Parameters<T>): ReturnType<T> => {\n    const key = keyGen(args);\n    const now = Date.now();\n    const cached = cache.get(key);\n\n    if (cached && (!ttl || now - cached.timestamp < ttl)) {\n      cache.delete(key);\n      cache.set(key, cached); // Move to end (most recently used)\n      return cached.value;\n    }\n\n    const result = fn(...args);\n    cache.set(key, { timestamp: now, value: result });\n\n    if (maxSize && cache.size > maxSize) {\n      cache.delete(cache.keys().next().value!); // Remove least recently used\n    }\n\n    return result;\n  };\n}\n"],"names":["memo","fn","ttl","maxSize","resolver","cache","keyGen","args","arg","argType","key","now","cached","result"],"mappings":"gFAqCO,SAASA,EACdC,EACA,CAAE,IAAAC,EAAK,QAAAC,EAAS,SAAAC,CAAA,EAAgC,GACL,CAC3C,MAAMC,MAAY,IAGZC,EAAUC,GAAgC,CAC9C,GAAIH,EAAU,OAAOA,EAAS,GAAGG,CAAI,EACrC,GAAIA,EAAK,SAAW,EAAG,MAAO,YAC9B,GAAIA,EAAK,SAAW,EAAG,CACrB,MAAMC,EAAMD,EAAK,CAAC,EACZE,EAAU,OAAOD,EACvB,GAAIC,IAAY,UAAYA,IAAY,UAAYA,IAAY,UAC9D,MAAO,GAAGA,CAAO,IAAID,CAAG,GAE1B,GAAIA,IAAQ,KAAM,MAAO,OACzB,GAAIA,IAAQ,OAAW,MAAO,WAChC,CACA,OAAO,KAAK,UAAUD,CAAI,CAC5B,EAEA,MAAO,IAAIA,IAAuC,CAChD,MAAMG,EAAMJ,EAAOC,CAAI,EACjBI,EAAM,KAAK,IAAA,EACXC,EAASP,EAAM,IAAIK,CAAG,EAE5B,GAAIE,IAAW,CAACV,GAAOS,EAAMC,EAAO,UAAYV,GAC9C,OAAAG,EAAM,OAAOK,CAAG,EAChBL,EAAM,IAAIK,EAAKE,CAAM,EACdA,EAAO,MAGhB,MAAMC,EAASZ,EAAG,GAAGM,CAAI,EACzB,OAAAF,EAAM,IAAIK,EAAK,CAAE,UAAWC,EAAK,MAAOE,EAAQ,EAE5CV,GAAWE,EAAM,KAAOF,GAC1BE,EAAM,OAAOA,EAAM,KAAA,EAAO,KAAA,EAAO,KAAM,EAGlCQ,CACT,CACF"}

package/dist/function/memo.js

@@ -1,24 +1,25 @@
-function f(s, { ttl: u, maxSize: i } = {}) {
-  const t = /* @__PURE__ */ new Map(), l = (n) => {
-    if (n.length === 0) return "__empty__";
-    if (n.length === 1) {
-      const e = n[0], r = typeof e;
+function m(l, { ttl: i, maxSize: o, resolver: c } = {}) {
+  const n = /* @__PURE__ */ new Map(), s = (t) => {
+    if (c) return c(...t);
+    if (t.length === 0) return "__empty__";
+    if (t.length === 1) {
+      const e = t[0], r = typeof e;
       if (r === "string" || r === "number" || r === "boolean")
         return `${r}:${e}`;
       if (e === null) return "null";
       if (e === void 0) return "undefined";
     }
-    return JSON.stringify(n);
+    return JSON.stringify(t);
   };
-  return (...n) => {
-    const e = l(n), r = Date.now(), o = t.get(e);
-    if (o && (!u || r - o.timestamp < u))
-      return t.delete(e), t.set(e, o), o.value;
-    const c = s(...n);
-    return t.set(e, { timestamp: r, value: c }), i && t.size > i && t.delete(t.keys().next().value), c;
+  return (...t) => {
+    const e = s(t), r = Date.now(), u = n.get(e);
+    if (u && (!i || r - u.timestamp < i))
+      return n.delete(e), n.set(e, u), u.value;
+    const f = l(...t);
+    return n.set(e, { timestamp: r, value: f }), o && n.size > o && n.delete(n.keys().next().value), f;
   };
 }
 export {
-  f as memo
+  m as memo
 };
 //# sourceMappingURL=memo.js.map

package/dist/function/memo.js.map

@@ -1 +1 @@
-{"version":3,"file":"memo.js","sources":["../../src/function/memo.ts"],"sourcesContent":["/** biome-ignore-all lint/suspicious/noExplicitAny: - */\nimport type { Fn } from '../types';\n\ntype MemoizeOptions = {\n  ttl?: number; // Time-to-live in milliseconds\n  maxSize?: number; // Maximum number of items in cache\n};\n\ntype CacheEntry<T extends Fn> = {\n  value: ReturnType<T>;\n  timestamp: number;\n};\n\n/**\n * Creates a function that memorizes the result of the provided function.\n * Supports expiration (TTL) and limited cache size (LRU).\n *\n * @example\n * ```ts\n * const add = (x, y) => x + y;\n * const memoizedAdd = memo(add, { ttl: 5000, maxSize: 10 });\n *\n * memoizedAdd(1, 2); // 3 (caches the result)\n * memoizedAdd(1, 2); // 3 (from cache)\n * ```\n *\n * @param fn - The function to memorize.\n * @param options - Memoization options.\n * @param [options.ttl] - (optional) time-to-live (TTL) for cache expiration (in milliseconds).\n * @param [options.maxSize] - (optional) maximum cache size (LRU eviction).\n *\n * @returns A new function that memorizes the input function.\n */\nexport function memo<T extends Fn>(\n  fn: T,\n  { ttl, maxSize }: MemoizeOptions = {},\n): (...args: Parameters<T>) => ReturnType<T> {\n  const cache = new Map<string, CacheEntry<T>>();\n\n  const keyGen = (args: Parameters<T>): string => {\n    if (args.length === 0) return '__empty__';\n    if (args.length === 1) {\n      const arg = args[0];\n      const argType = typeof arg;\n      if (argType === 'string' || argType === 'number' || argType === 'boolean') {\n        return `${argType}:${arg}`;\n      }\n      if (arg === null) return 'null';\n      if (arg === undefined) return 'undefined';\n    }\n    return JSON.stringify(args);\n  };\n\n  return (...args: Parameters<T>): ReturnType<T> => {\n    const key = keyGen(args);\n    const now = Date.now();\n    const cached = cache.get(key);\n\n    if (cached && (!ttl || now - cached.timestamp < ttl)) {\n      cache.delete(key);\n      cache.set(key, cached); // Move to end (most recently used)\n      return cached.value;\n    }\n\n    const result = fn(...args);\n    cache.set(key, { timestamp: now, value: result });\n\n    if (maxSize && cache.size > maxSize) {\n      cache.delete(cache.keys().next().value!); // Remove least recently used\n    }\n\n    return result;\n  };\n}\n"],"names":["memo","fn","ttl","maxSize","cache","keyGen","args","arg","argType","key","now","cached","result"],"mappings":"AAiCO,SAASA,EACdC,GACA,EAAE,KAAAC,GAAK,SAAAC,EAAA,IAA4B,CAAA,GACQ;AAC3C,QAAMC,wBAAY,IAAA,GAEZC,IAAS,CAACC,MAAgC;AAC9C,QAAIA,EAAK,WAAW,EAAG,QAAO;AAC9B,QAAIA,EAAK,WAAW,GAAG;AACrB,YAAMC,IAAMD,EAAK,CAAC,GACZE,IAAU,OAAOD;AACvB,UAAIC,MAAY,YAAYA,MAAY,YAAYA,MAAY;AAC9D,eAAO,GAAGA,CAAO,IAAID,CAAG;AAE1B,UAAIA,MAAQ,KAAM,QAAO;AACzB,UAAIA,MAAQ,OAAW,QAAO;AAAA,IAChC;AACA,WAAO,KAAK,UAAUD,CAAI;AAAA,EAC5B;AAEA,SAAO,IAAIA,MAAuC;AAChD,UAAMG,IAAMJ,EAAOC,CAAI,GACjBI,IAAM,KAAK,IAAA,GACXC,IAASP,EAAM,IAAIK,CAAG;AAE5B,QAAIE,MAAW,CAACT,KAAOQ,IAAMC,EAAO,YAAYT;AAC9C,aAAAE,EAAM,OAAOK,CAAG,GAChBL,EAAM,IAAIK,GAAKE,CAAM,GACdA,EAAO;AAGhB,UAAMC,IAASX,EAAG,GAAGK,CAAI;AACzB,WAAAF,EAAM,IAAIK,GAAK,EAAE,WAAWC,GAAK,OAAOE,GAAQ,GAE5CT,KAAWC,EAAM,OAAOD,KAC1BC,EAAM,OAAOA,EAAM,KAAA,EAAO,KAAA,EAAO,KAAM,GAGlCQ;AAAA,EACT;AACF;"}
+{"version":3,"file":"memo.js","sources":["../../src/function/memo.ts"],"sourcesContent":["/** biome-ignore-all lint/suspicious/noExplicitAny: - */\nimport type { Fn } from '../types';\n\n// #region MemoizeOptions\ntype MemoizeOptions<T extends Fn> = {\n  ttl?: number; // Time-to-live in milliseconds\n  maxSize?: number; // Maximum number of items in cache\n  resolver?: (...args: Parameters<T>) => string; // Custom key generator\n};\n// #endregion MemoizeOptions\n\ntype CacheEntry<T extends Fn> = {\n  value: ReturnType<T>;\n  timestamp: number;\n};\n\n/**\n * Creates a function that memorizes the result of the provided function.\n * Supports expiration (TTL) and limited cache size (LRU).\n *\n * @example\n * ```ts\n * const add = (x, y) => x + y;\n * const memoizedAdd = memo(add, { ttl: 5000, maxSize: 10 });\n *\n * memoizedAdd(1, 2); // 3 (caches the result)\n * memoizedAdd(1, 2); // 3 (from cache)\n * ```\n *\n * @param fn - The function to memorize.\n * @param options - Memoization options.\n * @param [options.ttl] - (optional) time-to-live (TTL) for cache expiration (in milliseconds).\n * @param [options.maxSize] - (optional) maximum cache size (LRU eviction).\n * @param [options.resolver] - (optional) custom function to resolve the cache key.\n *\n * @returns A new function that memorizes the input function.\n */\nexport function memo<T extends Fn>(\n  fn: T,\n  { ttl, maxSize, resolver }: MemoizeOptions<T> = {},\n): (...args: Parameters<T>) => ReturnType<T> {\n  const cache = new Map<string, CacheEntry<T>>();\n\n  // biome-ignore lint/complexity/noExcessiveCognitiveComplexity: -\n  const keyGen = (args: Parameters<T>): string => {\n    if (resolver) return resolver(...args);\n    if (args.length === 0) return '__empty__';\n    if (args.length === 1) {\n      const arg = args[0];\n      const argType = typeof arg;\n      if (argType === 'string' || argType === 'number' || argType === 'boolean') {\n        return `${argType}:${arg}`;\n      }\n      if (arg === null) return 'null';\n      if (arg === undefined) return 'undefined';\n    }\n    return JSON.stringify(args);\n  };\n\n  return (...args: Parameters<T>): ReturnType<T> => {\n    const key = keyGen(args);\n    const now = Date.now();\n    const cached = cache.get(key);\n\n    if (cached && (!ttl || now - cached.timestamp < ttl)) {\n      cache.delete(key);\n      cache.set(key, cached); // Move to end (most recently used)\n      return cached.value;\n    }\n\n    const result = fn(...args);\n    cache.set(key, { timestamp: now, value: result });\n\n    if (maxSize && cache.size > maxSize) {\n      cache.delete(cache.keys().next().value!); // Remove least recently used\n    }\n\n    return result;\n  };\n}\n"],"names":["memo","fn","ttl","maxSize","resolver","cache","keyGen","args","arg","argType","key","now","cached","result"],"mappings":"AAqCO,SAASA,EACdC,GACA,EAAE,KAAAC,GAAK,SAAAC,GAAS,UAAAC,EAAA,IAAgC,IACL;AAC3C,QAAMC,wBAAY,IAAA,GAGZC,IAAS,CAACC,MAAgC;AAC9C,QAAIH,EAAU,QAAOA,EAAS,GAAGG,CAAI;AACrC,QAAIA,EAAK,WAAW,EAAG,QAAO;AAC9B,QAAIA,EAAK,WAAW,GAAG;AACrB,YAAMC,IAAMD,EAAK,CAAC,GACZE,IAAU,OAAOD;AACvB,UAAIC,MAAY,YAAYA,MAAY,YAAYA,MAAY;AAC9D,eAAO,GAAGA,CAAO,IAAID,CAAG;AAE1B,UAAIA,MAAQ,KAAM,QAAO;AACzB,UAAIA,MAAQ,OAAW,QAAO;AAAA,IAChC;AACA,WAAO,KAAK,UAAUD,CAAI;AAAA,EAC5B;AAEA,SAAO,IAAIA,MAAuC;AAChD,UAAMG,IAAMJ,EAAOC,CAAI,GACjBI,IAAM,KAAK,IAAA,GACXC,IAASP,EAAM,IAAIK,CAAG;AAE5B,QAAIE,MAAW,CAACV,KAAOS,IAAMC,EAAO,YAAYV;AAC9C,aAAAG,EAAM,OAAOK,CAAG,GAChBL,EAAM,IAAIK,GAAKE,CAAM,GACdA,EAAO;AAGhB,UAAMC,IAASZ,EAAG,GAAGM,CAAI;AACzB,WAAAF,EAAM,IAAIK,GAAK,EAAE,WAAWC,GAAK,OAAOE,GAAQ,GAE5CV,KAAWE,EAAM,OAAOF,KAC1BE,EAAM,OAAOA,EAAM,KAAA,EAAO,KAAA,EAAO,KAAM,GAGlCQ;AAAA,EACT;AACF;"}

package/dist/function/parallel.cjs

@@ -0,0 +1,2 @@
+"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});async function f(n,r,a,l){if(n<1)throw new Error("Limit must be at least 1");if(l?.aborted)throw new DOMException("Aborted","AbortError");const s=new Array(r.length);let c=0,t=!1,o;const u=()=>l?.aborted?(t=!0,o=new DOMException("Aborted","AbortError"),!0):!1,w=async()=>{for(;c<r.length&&!t&&!u();){const e=c++;try{s[e]=await a(r[e],e,r)}catch(h){t=!0,o=h;break}}},i=[],b=Math.min(n,r.length);for(let e=0;e<b;e++)i.push(w());if(await Promise.all(i),t)throw o;return s}exports.parallel=f;
+//# sourceMappingURL=parallel.cjs.map

package/dist/function/parallel.cjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"parallel.cjs","sources":["../../src/function/parallel.ts"],"sourcesContent":["/**\n * Processes an array with an async callback with controlled parallelism.\n * Similar to Promise.all, but limits how many items are processed concurrently.\n * Returns an ordered array of results.\n *\n * @example\n * ```ts\n * // Process 3 items at a time\n * const results = await parallel(3, [1, 2, 3, 4, 5], async (n) => {\n *   await delay(100);\n *   return n * 2;\n * });\n * // [2, 4, 6, 8, 10]\n *\n * // With abort signal\n * const controller = new AbortController();\n * const results = await parallel(2, items, async (item) => {\n *   return processItem(item);\n * }, controller.signal);\n * ```\n *\n * @param limit - Maximum number of concurrent operations (must be >= 1)\n * @param array - Array of items to process\n * @param callback - Async function to process each item\n * @param signal - Optional AbortSignal to cancel processing\n * @returns Promise resolving to an ordered array of results\n * @throws {Error} If limit is less than 1\n * @throws {DOMException} If aborted via signal\n */\nexport async function parallel<T, R>(\n  limit: number,\n  array: T[],\n  callback: (item: T, index: number, array: T[]) => Promise<R>,\n  signal?: AbortSignal,\n): Promise<R[]> {\n  if (limit < 1) {\n    throw new Error('Limit must be at least 1');\n  }\n\n  if (signal?.aborted) {\n    throw new DOMException('Aborted', 'AbortError');\n  }\n\n  const results: R[] = new Array(array.length);\n  let currentIndex = 0;\n  let hasError = false;\n  let error: unknown;\n\n  // Check for abort\n  const checkAbort = () => {\n    if (signal?.aborted) {\n      hasError = true;\n      error = new DOMException('Aborted', 'AbortError');\n      return true;\n    }\n    return false;\n  };\n\n  // Worker function that processes items from the queue\n  const worker = async (): Promise<void> => {\n    while (currentIndex < array.length && !hasError) {\n      if (checkAbort()) {\n        break;\n      }\n\n      const index = currentIndex++;\n\n      try {\n        results[index] = await callback(array[index], index, array);\n      } catch (err) {\n        hasError = true;\n        error = err;\n        break;\n      }\n    }\n  };\n\n  // Create workers up to the limit\n  const workers: Promise<void>[] = [];\n  const workerCount = Math.min(limit, array.length);\n\n  for (let i = 0; i < workerCount; i++) {\n    workers.push(worker());\n  }\n\n  // Wait for all workers to complete\n  await Promise.all(workers);\n\n  // If there was an error, throw it\n  if (hasError) {\n    throw error;\n  }\n\n  return results;\n}\n"],"names":["parallel","limit","array","callback","signal","results","currentIndex","hasError","error","checkAbort","worker","index","err","workers","workerCount","i"],"mappings":"gFA6BA,eAAsBA,EACpBC,EACAC,EACAC,EACAC,EACc,CACd,GAAIH,EAAQ,EACV,MAAM,IAAI,MAAM,0BAA0B,EAG5C,GAAIG,GAAQ,QACV,MAAM,IAAI,aAAa,UAAW,YAAY,EAGhD,MAAMC,EAAe,IAAI,MAAMH,EAAM,MAAM,EAC3C,IAAII,EAAe,EACfC,EAAW,GACXC,EAGJ,MAAMC,EAAa,IACbL,GAAQ,SACVG,EAAW,GACXC,EAAQ,IAAI,aAAa,UAAW,YAAY,EACzC,IAEF,GAIHE,EAAS,SAA2B,CACxC,KAAOJ,EAAeJ,EAAM,QAAU,CAACK,GACjC,CAAAE,KAD2C,CAK/C,MAAME,EAAQL,IAEd,GAAI,CACFD,EAAQM,CAAK,EAAI,MAAMR,EAASD,EAAMS,CAAK,EAAGA,EAAOT,CAAK,CAC5D,OAASU,EAAK,CACZL,EAAW,GACXC,EAAQI,EACR,KACF,CACF,CACF,EAGMC,EAA2B,CAAA,EAC3BC,EAAc,KAAK,IAAIb,EAAOC,EAAM,MAAM,EAEhD,QAASa,EAAI,EAAGA,EAAID,EAAaC,IAC/BF,EAAQ,KAAKH,GAAQ,EAOvB,GAHA,MAAM,QAAQ,IAAIG,CAAO,EAGrBN,EACF,MAAMC,EAGR,OAAOH,CACT"}

package/dist/function/parallel.js

@@ -0,0 +1,28 @@
+async function f(n, t, w, s) {
+  if (n < 1)
+    throw new Error("Limit must be at least 1");
+  if (s?.aborted)
+    throw new DOMException("Aborted", "AbortError");
+  const c = new Array(t.length);
+  let l = 0, e = !1, o;
+  const a = () => s?.aborted ? (e = !0, o = new DOMException("Aborted", "AbortError"), !0) : !1, h = async () => {
+    for (; l < t.length && !e && !a(); ) {
+      const r = l++;
+      try {
+        c[r] = await w(t[r], r, t);
+      } catch (b) {
+        e = !0, o = b;
+        break;
+      }
+    }
+  }, i = [], u = Math.min(n, t.length);
+  for (let r = 0; r < u; r++)
+    i.push(h());
+  if (await Promise.all(i), e)
+    throw o;
+  return c;
+}
+export {
+  f as parallel
+};
+//# sourceMappingURL=parallel.js.map