@vielzeug/toolkit 1.1.3 → 2.0.0

package/dist/array/list.d.ts

@@ -0,0 +1,58 @@
+import type { Predicate, Sorter } from '../types';
+/** Minimal pagination metadata shared by both `list` and `remoteList`. */
+export type BaseMeta = Readonly<{
+    end: number;
+    isEmpty: boolean;
+    isFirst: boolean;
+    isLast: boolean;
+    limit: number;
+    page: number;
+    pages: number;
+    start: number;
+    total: number;
+}>;
+/**
+ * Minimal shared interface satisfied by both `list()` and `remoteList()` results.
+ * Use this type for code that works with either.
+ */
+export type BaseList<T> = {
+    readonly current: readonly T[];
+    readonly meta: BaseMeta;
+    subscribe(listener: () => void): () => void;
+};
+export type Meta = BaseMeta;
+export type List<T, F, S> = {
+    batch(mutator: (ctx: {
+        goTo(p: number): void;
+        setData?(d: readonly T[]): void;
+        setFilter(f: F): void;
+        setLimit(n: number): void;
+        setQuery(q: string): void;
+        setSort(s?: S): void;
+    }) => void): void;
+    readonly current: readonly T[];
+    goTo(page: number): void;
+    readonly meta: Meta;
+    next(): void;
+    prev(): void;
+    reset(): void;
+    search(query: string, opts?: {
+        immediate?: boolean;
+    }): void;
+    setData?(data: readonly T[]): void;
+    setFilter(filter: F): void;
+    setLimit(n: number): void;
+    setSort(sort?: S): void;
+    subscribe(listener: () => void): () => void;
+};
+type LocalConfig<T> = Readonly<{
+    debounceMs?: number;
+    filterFn?: Predicate<T>;
+    limit?: number;
+    searchFn?: (items: readonly T[], query: string, tone: number) => readonly T[];
+    searchTone?: number;
+    sortFn?: Sorter<T>;
+}>;
+export declare function list<T>(initialData: readonly T[], cfg?: LocalConfig<T>): List<T, Predicate<T>, Sorter<T>>;
+export {};
+//# sourceMappingURL=list.d.ts.map

package/dist/array/list.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"list.d.ts","sourceRoot":"","sources":["../../src/array/list.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,SAAS,EAAE,MAAM,EAAE,MAAM,UAAU,CAAC;AAKlD,0EAA0E;AAC1E,MAAM,MAAM,QAAQ,GAAG,QAAQ,CAAC;IAC9B,GAAG,EAAE,MAAM,CAAC;IACZ,OAAO,EAAE,OAAO,CAAC;IACjB,OAAO,EAAE,OAAO,CAAC;IACjB,MAAM,EAAE,OAAO,CAAC;IAChB,KAAK,EAAE,MAAM,CAAC;IACd,IAAI,EAAE,MAAM,CAAC;IACb,KAAK,EAAE,MAAM,CAAC;IACd,KAAK,EAAE,MAAM,CAAC;IACd,KAAK,EAAE,MAAM,CAAC;CACf,CAAC,CAAC;AAIH;;;GAGG;AACH,MAAM,MAAM,QAAQ,CAAC,CAAC,IAAI;IACxB,QAAQ,CAAC,OAAO,EAAE,SAAS,CAAC,EAAE,CAAC;IAC/B,QAAQ,CAAC,IAAI,EAAE,QAAQ,CAAC;IACxB,SAAS,CAAC,QAAQ,EAAE,MAAM,IAAI,GAAG,MAAM,IAAI,CAAC;CAC7C,CAAC;AAIF,MAAM,MAAM,IAAI,GAAG,QAAQ,CAAC;AAI5B,MAAM,MAAM,IAAI,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,IAAI;IAE1B,KAAK,CACH,OAAO,EAAE,CAAC,GAAG,EAAE;QACb,IAAI,CAAC,CAAC,EAAE,MAAM,GAAG,IAAI,CAAC;QACtB,OAAO,CAAC,CAAC,CAAC,EAAE,SAAS,CAAC,EAAE,GAAG,IAAI,CAAC;QAChC,SAAS,CAAC,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC;QACtB,QAAQ,CAAC,CAAC,EAAE,MAAM,GAAG,IAAI,CAAC;QAC1B,QAAQ,CAAC,CAAC,EAAE,MAAM,GAAG,IAAI,CAAC;QAC1B,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC;KACtB,KAAK,IAAI,GACT,IAAI,CAAC;IACR,QAAQ,CAAC,OAAO,EAAE,SAAS,CAAC,EAAE,CAAC;IAC/B,IAAI,CAAC,IAAI,EAAE,MAAM,GAAG,IAAI,CAAC;IAEzB,QAAQ,CAAC,IAAI,EAAE,IAAI,CAAC;IACpB,IAAI,IAAI,IAAI,CAAC;IACb,IAAI,IAAI,IAAI,CAAC;IACb,KAAK,IAAI,IAAI,CAAC;IACd,MAAM,CAAC,KAAK,EAAE,MAAM,EAAE,IAAI,CAAC,EAAE;QAAE,SAAS,CAAC,EAAE,OAAO,CAAA;KAAE,GAAG,IAAI,CAAC;IAC5D,OAAO,CAAC,CAAC,IAAI,EAAE,SAAS,CAAC,EAAE,GAAG,IAAI,CAAC;IACnC,SAAS,CAAC,MAAM,EAAE,CAAC,GAAG,IAAI,CAAC;IAC3B,QAAQ,CAAC,CAAC,EAAE,MAAM,GAAG,IAAI,CAAC;IAC1B,OAAO,CAAC,IAAI,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC;IAExB,SAAS,CAAC,QAAQ,EAAE,MAAM,IAAI,GAAG,MAAM,IAAI,CAAC;CAC7C,CAAC;AAIF,KAAK,WAAW,CAAC,CAAC,IAAI,QAAQ,CAAC;IAC7B,UAAU,CAAC,EAAE,MAAM,CAAC;IACpB,QAAQ,CAAC,EAAE,SAAS,CAAC,CAAC,CAAC,CAAC;IACxB,KAAK,CAAC,EAAE,MAAM,CAAC;IACf,QAAQ,CAAC,EAAE,CAAC,KAAK,EAAE,SAAS,CAAC,EAAE,EAAE,KAAK,EAAE,MAAM,EAAE,IAAI,EAAE,MAAM,KAAK,SAAS,CAAC,EAAE,CAAC;IAC9E,UAAU,CAAC,EAAE,MAAM,CAAC;IACpB,MAAM,CAAC,EAAE,MAAM,CAAC,CAAC,CAAC,CAAC;CACpB,CAAC,CAAC;AAGH,wBAAgB,IAAI,CAAC,CAAC,EAAE,WAAW,EAAE,SAAS,CAAC,EAAE,EAAE,GAAG,GAAE,WAAW,CAAC,CAAC,CAAM,GAAG,IAAI,CAAC,CAAC,EAAE,SAAS,CAAC,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC,CAAC,CAAC,CAkM7G"}

package/dist/array/list.js

@@ -1,107 +1,104 @@
-import { search as A } from "./search.js";
-function U(S, i = {}) {
-  const T = /* @__PURE__ */ new Set(), u = { debounceMs: 300, limit: 10, searchTone: 0.5 };
-  let x = [...S], a = Math.max(1, i.limit ?? u.limit), m = i.filterFn ?? (() => !0), M = i.sortFn;
-  const y = i.searchFn ?? ((t, e, o) => A([...t], e, o)), D = i.searchTone ?? u.searchTone;
-  let c = "", n = 0, h = [];
-  const d = () => {
-    for (const t of T)
-      t();
-  }, g = () => {
-    let t = x;
-    c && (t = y(t, c, D)), m && (t = t.filter(m)), t = M ? [...t].sort(M) : [...t];
-    const e = Math.max(1, Math.ceil(t.length / a));
-    n = Math.min(n, e - 1), h = t;
-  }, L = () => {
-    if (!h.length) return [];
-    const t = n * a;
-    return h.slice(t, t + a);
-  }, r = () => {
-    g(), d();
-  };
-  let F;
-  const v = (t, e) => {
-    F && clearTimeout(F), F = setTimeout(() => {
-      c = t, F = void 0, r();
-    }, e);
-  };
-  return g(), {
-    batch(t) {
-      let e = a, o = m, l = M, f = c, b = x, p = n;
-      const w = (s, E, Q) => Math.max(0, Math.min(s, Math.max(0, Math.ceil(E / Q) - 1)));
-      t({
-        goTo: (s) => {
-          p = w(s - 1, h.length, e);
-        },
-        setData: (s) => {
-          b = [...s], p = 0;
-        },
-        setFilter: (s) => {
-          o = s;
-        },
-        setLimit: (s) => {
-          e = Math.max(1, s);
-        },
-        setQuery: (s) => {
-          f = s, p = 0;
-        },
-        setSort: (s) => {
-          l = s;
-        }
-      }), a = e, m = o, M = l, c = f, x = b, n = p, r();
-    },
-    get current() {
-      return L();
-    },
-    goTo(t) {
-      const e = Math.max(1, Math.ceil(h.length / a));
-      n = Math.max(0, Math.min(t - 1, e - 1)), d();
-    },
-    get meta() {
-      const t = h.length, e = Math.max(1, Math.ceil(t / a)), o = t === 0, l = Math.min(n + 1, e), f = o ? 0 : (l - 1) * a + 1;
-      return {
-        end: o ? 0 : Math.min(l * a, t),
-        isEmpty: o,
-        isFirst: l <= 1,
-        isLast: l >= e,
-        limit: a,
-        page: l,
-        pages: e,
-        start: f,
-        total: t
-      };
-    },
-    next() {
-      const t = Math.max(1, Math.ceil(h.length / a));
-      n < t - 1 && (n++, d());
-    },
-    prev() {
-      n > 0 && (n--, d());
-    },
-    reset() {
-      a = Math.max(1, i.limit ?? u.limit), m = i.filterFn ?? (() => !0), M = i.sortFn, c = "", n = 0, r();
-    },
-    search(t, e) {
-      c = t, n = 0, e?.immediate ? r() : v(t, i.debounceMs ?? u.debounceMs);
-    },
-    setData(t) {
-      x = [...t], n = 0, r();
-    },
-    setFilter(t) {
-      m = t, n = 0, r();
-    },
-    setLimit(t) {
-      a = Math.max(1, t), n = 0, r();
-    },
-    setSort(t) {
-      M = t, r();
-    },
-    subscribe(t) {
-      return T.add(t), () => T.delete(t);
-    }
-  };
+import { search as e } from "./search.js";
+//#region src/array/list.ts
+function t(t, n = {}) {
+	let r = /* @__PURE__ */ new Set(), i = {
+		debounceMs: 300,
+		limit: 10,
+		searchTone: .5
+	}, a = [...t], o = Math.max(1, n.limit ?? i.limit), s = n.filterFn ?? (() => !0), c = n.sortFn, l = n.searchFn ?? ((t, n, r) => e([...t], n, r)), u = n.searchTone ?? i.searchTone, d = "", f = 0, p = [], m = () => {
+		for (let e of r) e();
+	}, h = () => {
+		let e = a;
+		d && (e = l(e, d, u)), s && (e = e.filter(s)), e = c ? [...e].sort(c) : [...e];
+		let t = Math.max(1, Math.ceil(e.length / o));
+		f = Math.min(f, t - 1), p = e;
+	}, g = () => {
+		if (!p.length) return [];
+		let e = f * o;
+		return p.slice(e, e + o);
+	}, _ = () => {
+		h(), m();
+	}, v, y = (e, t) => {
+		v && clearTimeout(v), v = setTimeout(() => {
+			d = e, v = void 0, _();
+		}, t);
+	};
+	return h(), {
+		batch(e) {
+			let t = o, n = s, r = c, i = d, l = a, u = f, m = (e, t, n) => Math.max(0, Math.min(e, Math.max(0, Math.ceil(t / n) - 1)));
+			e({
+				goTo: (e) => {
+					u = m(e - 1, p.length, t);
+				},
+				setData: (e) => {
+					l = [...e], u = 0;
+				},
+				setFilter: (e) => {
+					n = e;
+				},
+				setLimit: (e) => {
+					t = Math.max(1, e);
+				},
+				setQuery: (e) => {
+					i = e, u = 0;
+				},
+				setSort: (e) => {
+					r = e;
+				}
+			}), o = t, s = n, c = r, d = i, a = l, f = u, _();
+		},
+		get current() {
+			return g();
+		},
+		goTo(e) {
+			let t = Math.max(1, Math.ceil(p.length / o));
+			f = Math.max(0, Math.min(e - 1, t - 1)), m();
+		},
+		get meta() {
+			let e = p.length, t = Math.max(1, Math.ceil(e / o)), n = e === 0, r = Math.min(f + 1, t), i = n ? 0 : (r - 1) * o + 1;
+			return {
+				end: n ? 0 : Math.min(r * o, e),
+				isEmpty: n,
+				isFirst: r <= 1,
+				isLast: r >= t,
+				limit: o,
+				page: r,
+				pages: t,
+				start: i,
+				total: e
+			};
+		},
+		next() {
+			let e = Math.max(1, Math.ceil(p.length / o));
+			f < e - 1 && (f++, m());
+		},
+		prev() {
+			f > 0 && (f--, m());
+		},
+		reset() {
+			o = Math.max(1, n.limit ?? i.limit), s = n.filterFn ?? (() => !0), c = n.sortFn, d = "", f = 0, _();
+		},
+		search(e, t) {
+			t?.immediate ? (d = e, f = 0, _()) : y(e, n.debounceMs ?? i.debounceMs);
+		},
+		setData(e) {
+			a = [...e], f = 0, _();
+		},
+		setFilter(e) {
+			s = e, f = 0, _();
+		},
+		setLimit(e) {
+			o = Math.max(1, e), f = 0, _();
+		},
+		setSort(e) {
+			c = e, _();
+		},
+		subscribe(e) {
+			return r.add(e), () => r.delete(e);
+		}
+	};
 }
-export {
-  U as list
-};
-//# sourceMappingURL=list.js.map
+//#endregion
+export { t as list };
+
+//# sourceMappingURL=list.js.map

package/dist/array/list.js.map

@@ -1 +1 @@
-{"version":3,"file":"list.js","sources":["../../src/array/list.ts"],"sourcesContent":["import type { Predicate, Sorter } from '../types';\nimport { search as defaultSearch } from './search';\n\n// #region Meta\nexport type Meta = Readonly<{\n  end: number; // inclusive\n  isEmpty: boolean;\n  isFirst: boolean;\n  isLast: boolean;\n  limit: number;\n  page: number; // 1-based\n  pages: number;\n  start: number; // 1-based\n  total: number;\n}>;\n// #endregion Meta\n\n// #region List\nexport type List<T, F, S> = {\n  readonly current: readonly T[];\n  readonly meta: Meta;\n  subscribe(listener: () => void): () => void;\n\n  goTo(page: number): void;\n  next(): void;\n  prev(): void;\n  reset(): void;\n  search(query: string, opts?: { immediate?: boolean }): void;\n  setData?(data: readonly T[]): void; // implemented by local\n  setFilter(filter: F): void;\n  setLimit(n: number): void;\n  setSort(sort?: S): 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  ): void;\n};\n// #endregion List\n\n// #region LocalConfig\ntype LocalConfig<T> = Readonly<{\n  debounceMs?: number;\n  filterFn?: Predicate<T>;\n  limit?: number;\n  searchFn?: (items: readonly T[], query: string, tone: number) => readonly T[];\n  searchTone?: number;\n  sortFn?: Sorter<T>;\n}>;\n// #endregion LocalConfig\n\nexport function list<T>(initialData: readonly T[], cfg: LocalConfig<T> = {}): List<T, Predicate<T>, Sorter<T>> {\n  const listeners = new Set<() => void>();\n\n  const DEFAULTS = { debounceMs: 300, limit: 10, searchTone: 0.5 } as const;\n\n  let rawData: readonly T[] = [...initialData];\n  let limit = Math.max(1, cfg.limit ?? DEFAULTS.limit);\n  let filterFn: Predicate<T> = cfg.filterFn ?? (() => true);\n  let sortFn: Sorter<T> | undefined = cfg.sortFn;\n  const searchFn = cfg.searchFn ?? ((items: readonly T[], q: string, t: number) => defaultSearch([...items], q, t));\n  const searchTone = cfg.searchTone ?? DEFAULTS.searchTone;\n\n  let query = '';\n  let offset = 0;\n  let view: readonly T[] = [];\n\n  const notify = () => {\n    for (const l of listeners) {\n      l();\n    }\n  };\n\n  const recompute = () => {\n    let arr = rawData;\n\n    if (query) arr = searchFn(arr, query, searchTone);\n    if (filterFn) arr = arr.filter(filterFn);\n    arr = sortFn ? [...arr].sort(sortFn) : [...arr];\n\n    const pages = Math.max(1, Math.ceil(arr.length / limit));\n    offset = Math.min(offset, pages - 1);\n    view = arr;\n  };\n\n  const slice = (): readonly T[] => {\n    if (!view.length) return [];\n    const start = offset * limit;\n    return view.slice(start, start + limit);\n  };\n\n  const update = () => {\n    recompute();\n    notify();\n  };\n\n  let timer: ReturnType<typeof setTimeout> | undefined;\n  const debouncedSearch = (q: string, ms: number) => {\n    if (timer) clearTimeout(timer);\n    timer = setTimeout(() => {\n      query = q;\n      timer = undefined;\n      void update();\n    }, ms);\n  };\n\n  // initial compute\n  recompute();\n\n  return {\n    batch(mutator) {\n      let nextLimit = limit;\n      let nextFilter = filterFn;\n      let nextSort = sortFn;\n      let nextQuery = query;\n      let nextData = rawData;\n      let nextOffset = offset;\n\n      const clamp = (i: number, total: number, lim: number) =>\n        Math.max(0, Math.min(i, Math.max(0, Math.ceil(total / lim) - 1)));\n\n      mutator({\n        goTo: (p) => {\n          nextOffset = clamp(p - 1, view.length, nextLimit);\n        },\n        setData: (d) => {\n          nextData = [...d];\n          nextOffset = 0;\n        },\n        setFilter: (f) => {\n          nextFilter = f;\n        },\n        setLimit: (n) => {\n          nextLimit = Math.max(1, n);\n        },\n        setQuery: (q) => {\n          nextQuery = q;\n          nextOffset = 0;\n        },\n        setSort: (s) => {\n          nextSort = s;\n        },\n      });\n\n      // apply once\n      limit = nextLimit;\n      filterFn = nextFilter;\n      sortFn = nextSort;\n      query = nextQuery;\n      rawData = nextData;\n      offset = nextOffset;\n\n      update();\n    },\n    get current() {\n      return slice();\n    },\n    goTo(page) {\n      const pages = Math.max(1, Math.ceil(view.length / limit));\n      offset = Math.max(0, Math.min(page - 1, pages - 1));\n      notify();\n    },\n    get meta() {\n      const total = view.length;\n      const pages = Math.max(1, Math.ceil(total / limit));\n      const isEmpty = total === 0;\n      const page = Math.min(offset + 1, pages);\n      const start = isEmpty ? 0 : (page - 1) * limit + 1;\n      const end = isEmpty ? 0 : Math.min(page * limit, total);\n      return {\n        end,\n        isEmpty,\n        isFirst: page <= 1,\n        isLast: page >= pages,\n        limit,\n        page,\n        pages,\n        start,\n        total,\n      };\n    },\n    next() {\n      const pages = Math.max(1, Math.ceil(view.length / limit));\n      if (offset < pages - 1) {\n        offset++;\n        notify();\n      }\n    },\n    prev() {\n      if (offset > 0) {\n        offset--;\n        notify();\n      }\n    },\n    reset() {\n      limit = Math.max(1, cfg.limit ?? DEFAULTS.limit);\n      filterFn = cfg.filterFn ?? (() => true);\n      sortFn = cfg.sortFn;\n      query = '';\n      offset = 0;\n      update();\n    },\n    search(q, opts) {\n      query = q;\n      offset = 0;\n      if (opts?.immediate) {\n        update();\n      } else {\n        debouncedSearch(q, cfg.debounceMs ?? DEFAULTS.debounceMs);\n      }\n    },\n    setData(data) {\n      rawData = [...data];\n      offset = 0;\n      update();\n    },\n    setFilter(f) {\n      filterFn = f;\n      offset = 0;\n      update();\n    },\n    setLimit(n) {\n      limit = Math.max(1, n);\n      offset = 0;\n      update();\n    },\n    setSort(s) {\n      sortFn = s;\n      update();\n    },\n    subscribe(listener) {\n      listeners.add(listener);\n      return () => listeners.delete(listener);\n    },\n  };\n}\n"],"names":["list","initialData","cfg","listeners","DEFAULTS","rawData","limit","filterFn","sortFn","searchFn","items","q","t","defaultSearch","searchTone","query","offset","view","notify","l","recompute","arr","pages","slice","start","update","timer","debouncedSearch","ms","mutator","nextLimit","nextFilter","nextSort","nextQuery","nextData","nextOffset","clamp","i","total","lim","p","d","f","n","page","isEmpty","opts","data","s","listener"],"mappings":";AA0DO,SAASA,EAAQC,GAA2BC,IAAsB,IAAsC;AAC7G,QAAMC,wBAAgB,IAAA,GAEhBC,IAAW,EAAE,YAAY,KAAK,OAAO,IAAI,YAAY,IAAA;AAE3D,MAAIC,IAAwB,CAAC,GAAGJ,CAAW,GACvCK,IAAQ,KAAK,IAAI,GAAGJ,EAAI,SAASE,EAAS,KAAK,GAC/CG,IAAyBL,EAAI,aAAa,MAAM,KAChDM,IAAgCN,EAAI;AACxC,QAAMO,IAAWP,EAAI,aAAa,CAACQ,GAAqBC,GAAWC,MAAcC,EAAc,CAAC,GAAGH,CAAK,GAAGC,GAAGC,CAAC,IACzGE,IAAaZ,EAAI,cAAcE,EAAS;AAE9C,MAAIW,IAAQ,IACRC,IAAS,GACTC,IAAqB,CAAA;AAEzB,QAAMC,IAAS,MAAM;AACnB,eAAWC,KAAKhB;AACd,MAAAgB,EAAA;AAAA,EAEJ,GAEMC,IAAY,MAAM;AACtB,QAAIC,IAAMhB;AAEV,IAAIU,MAAOM,IAAMZ,EAASY,GAAKN,GAAOD,CAAU,IAC5CP,MAAUc,IAAMA,EAAI,OAAOd,CAAQ,IACvCc,IAAMb,IAAS,CAAC,GAAGa,CAAG,EAAE,KAAKb,CAAM,IAAI,CAAC,GAAGa,CAAG;AAE9C,UAAMC,IAAQ,KAAK,IAAI,GAAG,KAAK,KAAKD,EAAI,SAASf,CAAK,CAAC;AACvD,IAAAU,IAAS,KAAK,IAAIA,GAAQM,IAAQ,CAAC,GACnCL,IAAOI;AAAA,EACT,GAEME,IAAQ,MAAoB;AAChC,QAAI,CAACN,EAAK,OAAQ,QAAO,CAAA;AACzB,UAAMO,IAAQR,IAASV;AACvB,WAAOW,EAAK,MAAMO,GAAOA,IAAQlB,CAAK;AAAA,EACxC,GAEMmB,IAAS,MAAM;AACnB,IAAAL,EAAA,GACAF,EAAA;AAAA,EACF;AAEA,MAAIQ;AACJ,QAAMC,IAAkB,CAAChB,GAAWiB,MAAe;AACjD,IAAIF,kBAAoBA,CAAK,GAC7BA,IAAQ,WAAW,MAAM;AACvB,MAAAX,IAAQJ,GACRe,IAAQ,QACHD,EAAA;AAAA,IACP,GAAGG,CAAE;AAAA,EACP;AAGA,SAAAR,EAAA,GAEO;AAAA,IACL,MAAMS,GAAS;AACb,UAAIC,IAAYxB,GACZyB,IAAaxB,GACbyB,IAAWxB,GACXyB,IAAYlB,GACZmB,IAAW7B,GACX8B,IAAanB;AAEjB,YAAMoB,IAAQ,CAACC,GAAWC,GAAeC,MACvC,KAAK,IAAI,GAAG,KAAK,IAAIF,GAAG,KAAK,IAAI,GAAG,KAAK,KAAKC,IAAQC,CAAG,IAAI,CAAC,CAAC,CAAC;AAElE,MAAAV,EAAQ;AAAA,QACN,MAAM,CAACW,MAAM;AACX,UAAAL,IAAaC,EAAMI,IAAI,GAAGvB,EAAK,QAAQa,CAAS;AAAA,QAClD;AAAA,QACA,SAAS,CAACW,MAAM;AACd,UAAAP,IAAW,CAAC,GAAGO,CAAC,GAChBN,IAAa;AAAA,QACf;AAAA,QACA,WAAW,CAACO,MAAM;AAChB,UAAAX,IAAaW;AAAA,QACf;AAAA,QACA,UAAU,CAACC,MAAM;AACf,UAAAb,IAAY,KAAK,IAAI,GAAGa,CAAC;AAAA,QAC3B;AAAA,QACA,UAAU,CAAChC,MAAM;AACf,UAAAsB,IAAYtB,GACZwB,IAAa;AAAA,QACf;AAAA,QACA,SAAS,CAAC,MAAM;AACd,UAAAH,IAAW;AAAA,QACb;AAAA,MAAA,CACD,GAGD1B,IAAQwB,GACRvB,IAAWwB,GACXvB,IAASwB,GACTjB,IAAQkB,GACR5B,IAAU6B,GACVlB,IAASmB,GAETV,EAAA;AAAA,IACF;AAAA,IACA,IAAI,UAAU;AACZ,aAAOF,EAAA;AAAA,IACT;AAAA,IACA,KAAKqB,GAAM;AACT,YAAMtB,IAAQ,KAAK,IAAI,GAAG,KAAK,KAAKL,EAAK,SAASX,CAAK,CAAC;AACxD,MAAAU,IAAS,KAAK,IAAI,GAAG,KAAK,IAAI4B,IAAO,GAAGtB,IAAQ,CAAC,CAAC,GAClDJ,EAAA;AAAA,IACF;AAAA,IACA,IAAI,OAAO;AACT,YAAMoB,IAAQrB,EAAK,QACbK,IAAQ,KAAK,IAAI,GAAG,KAAK,KAAKgB,IAAQhC,CAAK,CAAC,GAC5CuC,IAAUP,MAAU,GACpBM,IAAO,KAAK,IAAI5B,IAAS,GAAGM,CAAK,GACjCE,IAAQqB,IAAU,KAAKD,IAAO,KAAKtC,IAAQ;AAEjD,aAAO;AAAA,QACL,KAFUuC,IAAU,IAAI,KAAK,IAAID,IAAOtC,GAAOgC,CAAK;AAAA,QAGpD,SAAAO;AAAA,QACA,SAASD,KAAQ;AAAA,QACjB,QAAQA,KAAQtB;AAAA,QAChB,OAAAhB;AAAA,QACA,MAAAsC;AAAA,QACA,OAAAtB;AAAA,QACA,OAAAE;AAAA,QACA,OAAAc;AAAA,MAAA;AAAA,IAEJ;AAAA,IACA,OAAO;AACL,YAAMhB,IAAQ,KAAK,IAAI,GAAG,KAAK,KAAKL,EAAK,SAASX,CAAK,CAAC;AACxD,MAAIU,IAASM,IAAQ,MACnBN,KACAE,EAAA;AAAA,IAEJ;AAAA,IACA,OAAO;AACL,MAAIF,IAAS,MACXA,KACAE,EAAA;AAAA,IAEJ;AAAA,IACA,QAAQ;AACN,MAAAZ,IAAQ,KAAK,IAAI,GAAGJ,EAAI,SAASE,EAAS,KAAK,GAC/CG,IAAWL,EAAI,aAAa,MAAM,KAClCM,IAASN,EAAI,QACba,IAAQ,IACRC,IAAS,GACTS,EAAA;AAAA,IACF;AAAA,IACA,OAAOd,GAAGmC,GAAM;AACd,MAAA/B,IAAQJ,GACRK,IAAS,GACL8B,GAAM,YACRrB,EAAA,IAEAE,EAAgBhB,GAAGT,EAAI,cAAcE,EAAS,UAAU;AAAA,IAE5D;AAAA,IACA,QAAQ2C,GAAM;AACZ,MAAA1C,IAAU,CAAC,GAAG0C,CAAI,GAClB/B,IAAS,GACTS,EAAA;AAAA,IACF;AAAA,IACA,UAAUiB,GAAG;AACX,MAAAnC,IAAWmC,GACX1B,IAAS,GACTS,EAAA;AAAA,IACF;AAAA,IACA,SAASkB,GAAG;AACV,MAAArC,IAAQ,KAAK,IAAI,GAAGqC,CAAC,GACrB3B,IAAS,GACTS,EAAA;AAAA,IACF;AAAA,IACA,QAAQuB,GAAG;AACT,MAAAxC,IAASwC,GACTvB,EAAA;AAAA,IACF;AAAA,IACA,UAAUwB,GAAU;AAClB,aAAA9C,EAAU,IAAI8C,CAAQ,GACf,MAAM9C,EAAU,OAAO8C,CAAQ;AAAA,IACxC;AAAA,EAAA;AAEJ;"}
+{"version":3,"file":"list.js","names":[],"sources":["../../src/array/list.ts"],"sourcesContent":["import type { Predicate, Sorter } from '../types';\n\nimport { search as defaultSearch } from './search';\n\n// #region BaseMeta\n/** Minimal pagination metadata shared by both `list` and `remoteList`. */\nexport type BaseMeta = Readonly<{\n  end: number;\n  isEmpty: boolean;\n  isFirst: boolean;\n  isLast: boolean;\n  limit: number;\n  page: number;\n  pages: number;\n  start: number;\n  total: number;\n}>;\n// #endregion BaseMeta\n\n// #region BaseList\n/**\n * Minimal shared interface satisfied by both `list()` and `remoteList()` results.\n * Use this type for code that works with either.\n */\nexport type BaseList<T> = {\n  readonly current: readonly T[];\n  readonly meta: BaseMeta;\n  subscribe(listener: () => void): () => void;\n};\n// #endregion BaseList\n\n// #region Meta\nexport type Meta = BaseMeta;\n// #endregion Meta\n\n// #region List\nexport type List<T, F, S> = {\n  // Batch updates across properties in one recompute/refetch\n  batch(\n    mutator: (ctx: {\n      goTo(p: number): void; // 1-based\n      setData?(d: readonly T[]): void; // local-only\n      setFilter(f: F): void;\n      setLimit(n: number): void;\n      setQuery(q: string): void;\n      setSort(s?: S): void;\n    }) => void,\n  ): void;\n  readonly current: readonly T[];\n  goTo(page: number): void;\n\n  readonly meta: Meta;\n  next(): void;\n  prev(): void;\n  reset(): void;\n  search(query: string, opts?: { immediate?: boolean }): void;\n  setData?(data: readonly T[]): void; // implemented by local\n  setFilter(filter: F): void;\n  setLimit(n: number): void;\n  setSort(sort?: S): void;\n\n  subscribe(listener: () => void): () => void;\n};\n// #endregion List\n\n// #region LocalConfig\ntype LocalConfig<T> = Readonly<{\n  debounceMs?: number;\n  filterFn?: Predicate<T>;\n  limit?: number;\n  searchFn?: (items: readonly T[], query: string, tone: number) => readonly T[];\n  searchTone?: number;\n  sortFn?: Sorter<T>;\n}>;\n// #endregion LocalConfig\n\nexport function list<T>(initialData: readonly T[], cfg: LocalConfig<T> = {}): List<T, Predicate<T>, Sorter<T>> {\n  const listeners = new Set<() => void>();\n\n  const DEFAULTS = { debounceMs: 300, limit: 10, searchTone: 0.5 } as const;\n\n  let rawData: readonly T[] = [...initialData];\n  let limit = Math.max(1, cfg.limit ?? DEFAULTS.limit);\n  let filterFn: Predicate<T> = cfg.filterFn ?? (() => true);\n  let sortFn: Sorter<T> | undefined = cfg.sortFn;\n  const searchFn = cfg.searchFn ?? ((items: readonly T[], q: string, t: number) => defaultSearch([...items], q, t));\n  const searchTone = cfg.searchTone ?? DEFAULTS.searchTone;\n\n  let query = '';\n  let offset = 0;\n  let view: readonly T[] = [];\n\n  const notify = () => {\n    for (const l of listeners) {\n      l();\n    }\n  };\n\n  const recompute = () => {\n    let arr = rawData;\n\n    if (query) arr = searchFn(arr, query, searchTone);\n\n    if (filterFn) arr = arr.filter(filterFn);\n\n    arr = sortFn ? [...arr].sort(sortFn) : [...arr];\n\n    const pages = Math.max(1, Math.ceil(arr.length / limit));\n\n    offset = Math.min(offset, pages - 1);\n    view = arr;\n  };\n\n  const slice = (): readonly T[] => {\n    if (!view.length) return [];\n\n    const start = offset * limit;\n\n    return view.slice(start, start + limit);\n  };\n\n  const update = () => {\n    recompute();\n    notify();\n  };\n\n  let timer: ReturnType<typeof setTimeout> | undefined;\n  const debouncedSearch = (q: string, ms: number) => {\n    if (timer) clearTimeout(timer);\n\n    timer = setTimeout(() => {\n      query = q;\n      timer = undefined;\n      void update();\n    }, ms);\n  };\n\n  // initial compute\n  recompute();\n\n  return {\n    batch(mutator) {\n      let nextLimit = limit;\n      let nextFilter = filterFn;\n      let nextSort = sortFn;\n      let nextQuery = query;\n      let nextData = rawData;\n      let nextOffset = offset;\n\n      const clamp = (i: number, total: number, lim: number) =>\n        Math.max(0, Math.min(i, Math.max(0, Math.ceil(total / lim) - 1)));\n\n      mutator({\n        goTo: (p) => {\n          nextOffset = clamp(p - 1, view.length, nextLimit);\n        },\n        setData: (d) => {\n          nextData = [...d];\n          nextOffset = 0;\n        },\n        setFilter: (f) => {\n          nextFilter = f;\n        },\n        setLimit: (n) => {\n          nextLimit = Math.max(1, n);\n        },\n        setQuery: (q) => {\n          nextQuery = q;\n          nextOffset = 0;\n        },\n        setSort: (s) => {\n          nextSort = s;\n        },\n      });\n\n      // apply once\n      limit = nextLimit;\n      filterFn = nextFilter;\n      sortFn = nextSort;\n      query = nextQuery;\n      rawData = nextData;\n      offset = nextOffset;\n\n      update();\n    },\n    get current() {\n      return slice();\n    },\n    goTo(page) {\n      const pages = Math.max(1, Math.ceil(view.length / limit));\n\n      offset = Math.max(0, Math.min(page - 1, pages - 1));\n      notify();\n    },\n    get meta() {\n      const total = view.length;\n      const pages = Math.max(1, Math.ceil(total / limit));\n      const isEmpty = total === 0;\n      const page = Math.min(offset + 1, pages);\n      const start = isEmpty ? 0 : (page - 1) * limit + 1;\n      const end = isEmpty ? 0 : Math.min(page * limit, total);\n\n      return {\n        end,\n        isEmpty,\n        isFirst: page <= 1,\n        isLast: page >= pages,\n        limit,\n        page,\n        pages,\n        start,\n        total,\n      };\n    },\n    next() {\n      const pages = Math.max(1, Math.ceil(view.length / limit));\n\n      if (offset < pages - 1) {\n        offset++;\n        notify();\n      }\n    },\n    prev() {\n      if (offset > 0) {\n        offset--;\n        notify();\n      }\n    },\n    reset() {\n      limit = Math.max(1, cfg.limit ?? DEFAULTS.limit);\n      filterFn = cfg.filterFn ?? (() => true);\n      sortFn = cfg.sortFn;\n      query = '';\n      offset = 0;\n      update();\n    },\n    search(q, opts) {\n      if (opts?.immediate) {\n        query = q;\n        offset = 0;\n        update();\n      } else {\n        debouncedSearch(q, cfg.debounceMs ?? DEFAULTS.debounceMs);\n      }\n    },\n    setData(data) {\n      rawData = [...data];\n      offset = 0;\n      update();\n    },\n    setFilter(f) {\n      filterFn = f;\n      offset = 0;\n      update();\n    },\n    setLimit(n) {\n      limit = Math.max(1, n);\n      offset = 0;\n      update();\n    },\n    setSort(s) {\n      sortFn = s;\n      update();\n    },\n    subscribe(listener) {\n      listeners.add(listener);\n\n      return () => listeners.delete(listener);\n    },\n  };\n}\n"],"mappings":";;AA4EA,SAAgB,EAAQ,GAA2B,IAAsB,EAAE,EAAoC;CAC7G,IAAM,oBAAY,IAAI,KAAiB,EAEjC,IAAW;EAAE,YAAY;EAAK,OAAO;EAAI,YAAY;EAAK,EAE5D,IAAwB,CAAC,GAAG,EAAY,EACxC,IAAQ,KAAK,IAAI,GAAG,EAAI,SAAS,EAAS,MAAM,EAChD,IAAyB,EAAI,mBAAmB,KAChD,IAAgC,EAAI,QAClC,IAAW,EAAI,cAAc,GAAqB,GAAW,MAAc,EAAc,CAAC,GAAG,EAAM,EAAE,GAAG,EAAE,GAC1G,IAAa,EAAI,cAAc,EAAS,YAE1C,IAAQ,IACR,IAAS,GACT,IAAqB,EAAE,EAErB,UAAe;AACnB,OAAK,IAAM,KAAK,EACd,IAAG;IAID,UAAkB;EACtB,IAAI,IAAM;AAMV,EAJI,MAAO,IAAM,EAAS,GAAK,GAAO,EAAW,GAE7C,MAAU,IAAM,EAAI,OAAO,EAAS,GAExC,IAAM,IAAS,CAAC,GAAG,EAAI,CAAC,KAAK,EAAO,GAAG,CAAC,GAAG,EAAI;EAE/C,IAAM,IAAQ,KAAK,IAAI,GAAG,KAAK,KAAK,EAAI,SAAS,EAAM,CAAC;AAGxD,EADA,IAAS,KAAK,IAAI,GAAQ,IAAQ,EAAE,EACpC,IAAO;IAGH,UAA4B;AAChC,MAAI,CAAC,EAAK,OAAQ,QAAO,EAAE;EAE3B,IAAM,IAAQ,IAAS;AAEvB,SAAO,EAAK,MAAM,GAAO,IAAQ,EAAM;IAGnC,UAAe;AAEnB,EADA,GAAW,EACX,GAAQ;IAGN,GACE,KAAmB,GAAW,MAAe;AAGjD,EAFI,KAAO,aAAa,EAAM,EAE9B,IAAQ,iBAAiB;AAGlB,GAFL,IAAQ,GACR,IAAQ,KAAA,GACH,GAAQ;KACZ,EAAG;;AAMR,QAFA,GAAW,EAEJ;EACL,MAAM,GAAS;GACb,IAAI,IAAY,GACZ,IAAa,GACb,IAAW,GACX,IAAY,GACZ,IAAW,GACX,IAAa,GAEX,KAAS,GAAW,GAAe,MACvC,KAAK,IAAI,GAAG,KAAK,IAAI,GAAG,KAAK,IAAI,GAAG,KAAK,KAAK,IAAQ,EAAI,GAAG,EAAE,CAAC,CAAC;AAiCnE,GA/BA,EAAQ;IACN,OAAO,MAAM;AACX,SAAa,EAAM,IAAI,GAAG,EAAK,QAAQ,EAAU;;IAEnD,UAAU,MAAM;AAEd,KADA,IAAW,CAAC,GAAG,EAAE,EACjB,IAAa;;IAEf,YAAY,MAAM;AAChB,SAAa;;IAEf,WAAW,MAAM;AACf,SAAY,KAAK,IAAI,GAAG,EAAE;;IAE5B,WAAW,MAAM;AAEf,KADA,IAAY,GACZ,IAAa;;IAEf,UAAU,MAAM;AACd,SAAW;;IAEd,CAAC,EAGF,IAAQ,GACR,IAAW,GACX,IAAS,GACT,IAAQ,GACR,IAAU,GACV,IAAS,GAET,GAAQ;;EAEV,IAAI,UAAU;AACZ,UAAO,GAAO;;EAEhB,KAAK,GAAM;GACT,IAAM,IAAQ,KAAK,IAAI,GAAG,KAAK,KAAK,EAAK,SAAS,EAAM,CAAC;AAGzD,GADA,IAAS,KAAK,IAAI,GAAG,KAAK,IAAI,IAAO,GAAG,IAAQ,EAAE,CAAC,EACnD,GAAQ;;EAEV,IAAI,OAAO;GACT,IAAM,IAAQ,EAAK,QACb,IAAQ,KAAK,IAAI,GAAG,KAAK,KAAK,IAAQ,EAAM,CAAC,EAC7C,IAAU,MAAU,GACpB,IAAO,KAAK,IAAI,IAAS,GAAG,EAAM,EAClC,IAAQ,IAAU,KAAK,IAAO,KAAK,IAAQ;AAGjD,UAAO;IACL,KAHU,IAAU,IAAI,KAAK,IAAI,IAAO,GAAO,EAAM;IAIrD;IACA,SAAS,KAAQ;IACjB,QAAQ,KAAQ;IAChB;IACA;IACA;IACA;IACA;IACD;;EAEH,OAAO;GACL,IAAM,IAAQ,KAAK,IAAI,GAAG,KAAK,KAAK,EAAK,SAAS,EAAM,CAAC;AAEzD,GAAI,IAAS,IAAQ,MACnB,KACA,GAAQ;;EAGZ,OAAO;AACL,GAAI,IAAS,MACX,KACA,GAAQ;;EAGZ,QAAQ;AAMN,GALA,IAAQ,KAAK,IAAI,GAAG,EAAI,SAAS,EAAS,MAAM,EAChD,IAAW,EAAI,mBAAmB,KAClC,IAAS,EAAI,QACb,IAAQ,IACR,IAAS,GACT,GAAQ;;EAEV,OAAO,GAAG,GAAM;AACd,GAAI,GAAM,aACR,IAAQ,GACR,IAAS,GACT,GAAQ,IAER,EAAgB,GAAG,EAAI,cAAc,EAAS,WAAW;;EAG7D,QAAQ,GAAM;AAGZ,GAFA,IAAU,CAAC,GAAG,EAAK,EACnB,IAAS,GACT,GAAQ;;EAEV,UAAU,GAAG;AAGX,GAFA,IAAW,GACX,IAAS,GACT,GAAQ;;EAEV,SAAS,GAAG;AAGV,GAFA,IAAQ,KAAK,IAAI,GAAG,EAAE,EACtB,IAAS,GACT,GAAQ;;EAEV,QAAQ,GAAG;AAET,GADA,IAAS,GACT,GAAQ;;EAEV,UAAU,GAAU;AAGlB,UAFA,EAAU,IAAI,EAAS,QAEV,EAAU,OAAO,EAAS;;EAE1C"}

package/dist/array/pick.cjs

@@ -1,2 +1,2 @@
-"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const u=require("../function/assert.cjs"),t=require("../typed/isArray.cjs"),c=require("../typed/isNil.cjs");function s(i,r,n){u.assert(t.isArray(i),t.IS_ARRAY_ERROR_MSG,{args:{array:i},type:TypeError});const o=n??(e=>!c.isNil(e));for(let e=0;e<i.length;e++)if(o(i[e],e,i))return r(i[e],e,i)}s.fp=!0;exports.pick=s;
-//# sourceMappingURL=pick.cjs.map
+const e=require(`../function/assert.cjs`),t=require(`../typed/isArray.cjs`),n=require(`../typed/isNil.cjs`);function r(r,i,a){e.assert(t.isArray(r),t.IS_ARRAY_ERROR_MSG,{args:{array:r},type:TypeError});let o=a??(e=>!n.isNil(e));for(let e=0;e<r.length;e++)if(o(r[e],e,r))return i(r[e],e,r)}exports.pick=r;
+//# sourceMappingURL=pick.cjs.map

package/dist/array/pick.cjs.map

@@ -1 +1 @@
-{"version":3,"file":"pick.cjs","sources":["../../src/array/pick.ts"],"sourcesContent":["import { assert } from '../function/assert';\nimport { IS_ARRAY_ERROR_MSG, isArray } from '../typed/isArray';\nimport { isNil } from '../typed/isNil';\n\n/**\n * Picks the first element from an array that satisfies a predicate function\n *\n * @example\n * ```ts\n * const arr = [1, 2, 3, 4];\n * pick(arr, x => x * x, x => x > 2) // 9\n * await pick(arr, async x => x * x, x => x > 2) // 9\n * ```\n *\n * @param array - The array to search.\n * @param callback - A function that is called for each element in the array.\n * @param predicate - A function that is called to validate each element in the array.\n *\n * @return The first element that satisfies the predicate, or undefined if no such element is found.\n *\n * @throws {TypeError} If the first argument is not an array.\n */\nexport function pick<T, R = T>(\n  array: T[],\n  callback: (item: T, index: number, array: T[]) => R,\n  predicate?: (item: T, index: number, array: T[]) => boolean,\n): R | undefined {\n  assert(isArray(array), IS_ARRAY_ERROR_MSG, { args: { array }, type: TypeError });\n\n  const isValid = predicate ?? ((value: T) => !isNil(value));\n\n  for (let index = 0; index < array.length; index++) {\n    if (isValid(array[index], index, array)) {\n      return callback(array[index], index, array);\n    }\n  }\n\n  return undefined;\n}\n\npick.fp = true;\n"],"names":["pick","array","callback","predicate","assert","isArray","IS_ARRAY_ERROR_MSG","isValid","value","isNil","index"],"mappings":"4LAsBO,SAASA,EACdC,EACAC,EACAC,EACe,CACfC,EAAAA,OAAOC,EAAAA,QAAQJ,CAAK,EAAGK,qBAAoB,CAAE,KAAM,CAAE,MAAAL,CAAA,EAAS,KAAM,UAAW,EAE/E,MAAMM,EAAUJ,IAAeK,GAAa,CAACC,EAAAA,MAAMD,CAAK,GAExD,QAASE,EAAQ,EAAGA,EAAQT,EAAM,OAAQS,IACxC,GAAIH,EAAQN,EAAMS,CAAK,EAAGA,EAAOT,CAAK,EACpC,OAAOC,EAASD,EAAMS,CAAK,EAAGA,EAAOT,CAAK,CAKhD,CAEAD,EAAK,GAAK"}
+{"version":3,"file":"pick.cjs","names":[],"sources":["../../src/array/pick.ts"],"sourcesContent":["import { assert } from '../function/assert';\nimport { IS_ARRAY_ERROR_MSG, isArray } from '../typed/isArray';\nimport { isNil } from '../typed/isNil';\n\n/**\n * Picks the first element from an array that satisfies a predicate function\n *\n * @example\n * ```ts\n * const arr = [1, 2, 3, 4];\n * pick(arr, x => x * x, x => x > 2) // 9\n * ```\n *\n * @param array - The array to search.\n * @param callback - A function that is called for each element in the array.\n * @param predicate - A function that is called to validate each element in the array.\n *\n * @return The first element that satisfies the predicate, or undefined if no such element is found.\n *\n * @throws {TypeError} If the first argument is not an array.\n */\nexport function pick<T, R = T>(\n  array: T[],\n  callback: (item: T, index: number, array: T[]) => R,\n  predicate?: (item: T, index: number, array: T[]) => boolean,\n): R | undefined {\n  assert(isArray(array), IS_ARRAY_ERROR_MSG, { args: { array }, type: TypeError });\n\n  const isValid = predicate ?? ((value: T) => !isNil(value));\n\n  for (let index = 0; index < array.length; index++) {\n    if (isValid(array[index], index, array)) {\n      return callback(array[index], index, array);\n    }\n  }\n\n  return undefined;\n}\n"],"mappings":"4GAqBA,SAAgB,EACd,EACA,EACA,EACe,CACf,EAAA,OAAO,EAAA,QAAQ,EAAM,CAAE,EAAA,mBAAoB,CAAE,KAAM,CAAE,QAAO,CAAE,KAAM,UAAW,CAAC,CAEhF,IAAM,EAAU,IAAe,GAAa,CAAC,EAAA,MAAM,EAAM,EAEzD,IAAK,IAAI,EAAQ,EAAG,EAAQ,EAAM,OAAQ,IACxC,GAAI,EAAQ,EAAM,GAAQ,EAAO,EAAM,CACrC,OAAO,EAAS,EAAM,GAAQ,EAAO,EAAM"}

package/dist/array/pick.d.ts

@@ -0,0 +1,19 @@
+/**
+ * Picks the first element from an array that satisfies a predicate function
+ *
+ * @example
+ * ```ts
+ * const arr = [1, 2, 3, 4];
+ * pick(arr, x => x * x, x => x > 2) // 9
+ * ```
+ *
+ * @param array - The array to search.
+ * @param callback - A function that is called for each element in the array.
+ * @param predicate - A function that is called to validate each element in the array.
+ *
+ * @return The first element that satisfies the predicate, or undefined if no such element is found.
+ *
+ * @throws {TypeError} If the first argument is not an array.
+ */
+export declare function pick<T, R = T>(array: T[], callback: (item: T, index: number, array: T[]) => R, predicate?: (item: T, index: number, array: T[]) => boolean): R | undefined;
+//# sourceMappingURL=pick.d.ts.map

package/dist/array/pick.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"pick.d.ts","sourceRoot":"","sources":["../../src/array/pick.ts"],"names":[],"mappings":"AAIA;;;;;;;;;;;;;;;;GAgBG;AACH,wBAAgB,IAAI,CAAC,CAAC,EAAE,CAAC,GAAG,CAAC,EAC3B,KAAK,EAAE,CAAC,EAAE,EACV,QAAQ,EAAE,CAAC,IAAI,EAAE,CAAC,EAAE,KAAK,EAAE,MAAM,EAAE,KAAK,EAAE,CAAC,EAAE,KAAK,CAAC,EACnD,SAAS,CAAC,EAAE,CAAC,IAAI,EAAE,CAAC,EAAE,KAAK,EAAE,MAAM,EAAE,KAAK,EAAE,CAAC,EAAE,KAAK,OAAO,GAC1D,CAAC,GAAG,SAAS,CAYf"}

package/dist/array/pick.js

@@ -1,15 +1,16 @@
-import { assert as r } from "../function/assert.js";
-import { IS_ARRAY_ERROR_MSG as f, isArray as n } from "../typed/isArray.js";
-import { isNil as s } from "../typed/isNil.js";
-function m(t, o, e) {
-  r(n(t), f, { args: { array: t }, type: TypeError });
-  const p = e ?? ((i) => !s(i));
-  for (let i = 0; i < t.length; i++)
-    if (p(t[i], i, t))
-      return o(t[i], i, t);
+import { assert as e } from "../function/assert.js";
+import { IS_ARRAY_ERROR_MSG as t, isArray as n } from "../typed/isArray.js";
+import { isNil as r } from "../typed/isNil.js";
+//#region src/array/pick.ts
+function i(i, a, o) {
+	e(n(i), t, {
+		args: { array: i },
+		type: TypeError
+	});
+	let s = o ?? ((e) => !r(e));
+	for (let e = 0; e < i.length; e++) if (s(i[e], e, i)) return a(i[e], e, i);
 }
-m.fp = !0;
-export {
-  m as pick
-};
-//# sourceMappingURL=pick.js.map
+//#endregion
+export { i as pick };
+
+//# sourceMappingURL=pick.js.map

package/dist/array/pick.js.map

@@ -1 +1 @@
-{"version":3,"file":"pick.js","sources":["../../src/array/pick.ts"],"sourcesContent":["import { assert } from '../function/assert';\nimport { IS_ARRAY_ERROR_MSG, isArray } from '../typed/isArray';\nimport { isNil } from '../typed/isNil';\n\n/**\n * Picks the first element from an array that satisfies a predicate function\n *\n * @example\n * ```ts\n * const arr = [1, 2, 3, 4];\n * pick(arr, x => x * x, x => x > 2) // 9\n * await pick(arr, async x => x * x, x => x > 2) // 9\n * ```\n *\n * @param array - The array to search.\n * @param callback - A function that is called for each element in the array.\n * @param predicate - A function that is called to validate each element in the array.\n *\n * @return The first element that satisfies the predicate, or undefined if no such element is found.\n *\n * @throws {TypeError} If the first argument is not an array.\n */\nexport function pick<T, R = T>(\n  array: T[],\n  callback: (item: T, index: number, array: T[]) => R,\n  predicate?: (item: T, index: number, array: T[]) => boolean,\n): R | undefined {\n  assert(isArray(array), IS_ARRAY_ERROR_MSG, { args: { array }, type: TypeError });\n\n  const isValid = predicate ?? ((value: T) => !isNil(value));\n\n  for (let index = 0; index < array.length; index++) {\n    if (isValid(array[index], index, array)) {\n      return callback(array[index], index, array);\n    }\n  }\n\n  return undefined;\n}\n\npick.fp = true;\n"],"names":["pick","array","callback","predicate","assert","isArray","IS_ARRAY_ERROR_MSG","isValid","value","isNil","index"],"mappings":";;;AAsBO,SAASA,EACdC,GACAC,GACAC,GACe;AACf,EAAAC,EAAOC,EAAQJ,CAAK,GAAGK,GAAoB,EAAE,MAAM,EAAE,OAAAL,EAAA,GAAS,MAAM,WAAW;AAE/E,QAAMM,IAAUJ,MAAc,CAACK,MAAa,CAACC,EAAMD,CAAK;AAExD,WAASE,IAAQ,GAAGA,IAAQT,EAAM,QAAQS;AACxC,QAAIH,EAAQN,EAAMS,CAAK,GAAGA,GAAOT,CAAK;AACpC,aAAOC,EAASD,EAAMS,CAAK,GAAGA,GAAOT,CAAK;AAKhD;AAEAD,EAAK,KAAK;"}
+{"version":3,"file":"pick.js","names":[],"sources":["../../src/array/pick.ts"],"sourcesContent":["import { assert } from '../function/assert';\nimport { IS_ARRAY_ERROR_MSG, isArray } from '../typed/isArray';\nimport { isNil } from '../typed/isNil';\n\n/**\n * Picks the first element from an array that satisfies a predicate function\n *\n * @example\n * ```ts\n * const arr = [1, 2, 3, 4];\n * pick(arr, x => x * x, x => x > 2) // 9\n * ```\n *\n * @param array - The array to search.\n * @param callback - A function that is called for each element in the array.\n * @param predicate - A function that is called to validate each element in the array.\n *\n * @return The first element that satisfies the predicate, or undefined if no such element is found.\n *\n * @throws {TypeError} If the first argument is not an array.\n */\nexport function pick<T, R = T>(\n  array: T[],\n  callback: (item: T, index: number, array: T[]) => R,\n  predicate?: (item: T, index: number, array: T[]) => boolean,\n): R | undefined {\n  assert(isArray(array), IS_ARRAY_ERROR_MSG, { args: { array }, type: TypeError });\n\n  const isValid = predicate ?? ((value: T) => !isNil(value));\n\n  for (let index = 0; index < array.length; index++) {\n    if (isValid(array[index], index, array)) {\n      return callback(array[index], index, array);\n    }\n  }\n\n  return undefined;\n}\n"],"mappings":";;;;AAqBA,SAAgB,EACd,GACA,GACA,GACe;AACf,GAAO,EAAQ,EAAM,EAAE,GAAoB;EAAE,MAAM,EAAE,UAAO;EAAE,MAAM;EAAW,CAAC;CAEhF,IAAM,IAAU,OAAe,MAAa,CAAC,EAAM,EAAM;AAEzD,MAAK,IAAI,IAAQ,GAAG,IAAQ,EAAM,QAAQ,IACxC,KAAI,EAAQ,EAAM,IAAQ,GAAO,EAAM,CACrC,QAAO,EAAS,EAAM,IAAQ,GAAO,EAAM"}

package/dist/array/remoteList.cjs

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

package/dist/array/remoteList.cjs.map

@@ -1 +1 @@
-{"version":3,"file":"remoteList.cjs","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":"gFAmEO,SAASA,EACdC,EACqB,CACrB,MAAMC,MAAgB,IAEhBC,EAAe,KAAK,IAAI,EAAGF,EAAI,OAAS,EAAE,EAC1CG,EAAaH,EAAI,YAAc,IAErC,IAAII,EAAO,EACPC,EAAQH,EACRI,EAAS,GACTC,EAASP,EAAI,cACbQ,EAAOR,EAAI,YAEXS,EAAsB,CAAA,EACtBC,EAAQ,EACRC,EAAU,GACVC,EAAuB,KAE3B,MAAMC,MAAY,IACZC,MAAe,IAEfC,EAASC,GAAyB,KAAK,UAAUA,CAAC,EAClDC,EAAU,KAA0B,CACxC,OAAAV,EACA,MAAAF,EACA,KAAAD,EACA,OAAQE,GAAU,OAClB,KAAAE,CAAA,GAGIU,EAAUC,GAAyB,CACvCV,EAAQU,EAAI,MACZT,EAAQS,EAAI,OAAS,EACrB,MAAMC,EAAQ,KAAK,IAAI,EAAG,KAAK,KAAKV,EAAQL,CAAK,CAAC,EAClDD,EAAO,KAAK,IAAI,KAAK,IAAI,EAAGA,CAAI,EAAGgB,CAAK,CAC1C,EAEMC,EAAS,IAAM,CACnB,UAAWC,KAAKrB,EACdqB,EAAA,CAEJ,EAEMC,EAAa,MAAOP,GAAyB,CACjD,MAAMQ,EAAIT,EAAMC,CAAC,EACjB,GAAIH,EAAM,IAAIW,CAAC,EAAG,CAChBN,EAAOL,EAAM,IAAIW,CAAC,CAAE,EACpB,MACF,CACA,GAAIV,EAAS,IAAIU,CAAC,EAAG,CACnB,MAAMV,EAAS,IAAIU,CAAC,EACpBN,EAAOL,EAAM,IAAIW,CAAC,CAAE,EACpB,MACF,CACAb,EAAU,GACVC,EAAQ,KACRS,EAAA,EACA,MAAMI,EAAIzB,EACP,MAAMgB,CAAC,EACP,KAAMG,GAAQ,CACbN,EAAM,IAAIW,EAAGL,CAAG,EAChBD,EAAOC,CAAG,CACZ,CAAC,EACA,MAAOO,GAAM,CACZd,EAAQc,GAAG,SAAW,iBACtBjB,EAAQ,CAAA,EACRC,EAAQ,CACV,CAAC,EACA,QAAQ,IAAM,CACbI,EAAS,OAAOU,CAAC,EACjBb,EAAU,GACVU,EAAA,CACF,CAAC,EACHP,EAAS,IAAIU,EAAGC,CAAC,EACjB,MAAMA,CACR,EAEME,EAAS,SAAY,CACzB,MAAMJ,EAAWN,GAAS,CAC5B,EAGA,IAAIW,EACJ,MAAMC,EAAY,IAAM,CAClBD,gBAAoBA,CAAK,EAC7BA,EAAQ,WAAW,IAAM,CACvBA,EAAQ,OACHD,EAAA,CACP,EAAGxB,CAAU,CACf,EAGA,MAAO,CACL,MAAM,MAAM2B,EAAS,CAEnB,IAAIC,EAAW3B,EACX4B,EAAY3B,EACZ4B,EAAa3B,EACb4B,EAAa3B,EACb4B,EAAW3B,EAEfsB,EAAQ,CACN,KAAOL,GAAc,CACnBM,EAAW,KAAK,IAAI,EAAGN,EAAI,CAAC,CAC9B,EACA,UAAYW,GAAS,CACnBF,EAAaE,EACbL,EAAW,CACb,EACA,SAAWM,GAAM,CACfL,EAAY,KAAK,IAAI,EAAGK,CAAC,EACzBN,EAAW,CACb,EACA,SAAWf,GAAc,CACvBiB,EAAajB,EACbe,EAAW,CACb,EACA,QAAUO,GAAU,CAClBH,EAAWG,EACXP,EAAW,CACb,CAAA,CACD,EAGD3B,EAAO2B,EACP1B,EAAQ2B,EACR1B,EAAS2B,EACT1B,EAAS2B,EACT1B,EAAO2B,EAEP,MAAMR,EAAA,CACR,EACA,IAAI,SAAU,CACZ,OAAOlB,CACT,EACA,MAAM,KAAKgB,EAAG,CACZrB,EAAO,KAAK,IAAI,EAAGqB,EAAI,CAAC,EACxB,MAAME,EAAA,CACR,EACA,YAAa,CACXd,EAAM,MAAA,CACR,EACA,IAAI,MAAO,CACT,MAAM0B,EAAU7B,IAAU,EACpBU,EAAQ,KAAK,IAAI,EAAG,KAAK,KAAKV,EAAQL,CAAK,CAAC,EAC5CmC,EAAW,KAAK,IAAIpC,EAAMgB,CAAK,EAC/BqB,EAAQF,EAAU,GAAKC,EAAW,GAAKnC,EAAQ,EAErD,MAAO,CACL,IAFUkC,EAAU,EAAI,KAAK,IAAIC,EAAWnC,EAAOK,CAAK,EAGxD,MAAAE,EACA,QAAA2B,EACA,QAASC,GAAY,EACrB,OAAQA,GAAYpB,EACpB,MAAAf,EACA,QAAAM,EACA,KAAM6B,EACN,MAAApB,EACA,MAAAqB,EACA,MAAA/B,CAAA,CAEJ,EACA,MAAM,MAAO,CACXN,GAAQ,EACR,MAAMuB,EAAA,CACR,EACA,MAAM,MAAO,CACXvB,EAAO,KAAK,IAAI,EAAGA,EAAO,CAAC,EAC3B,MAAMuB,EAAA,CACR,EACA,MAAM,SAAU,CACdd,EAAM,OAAOE,EAAME,EAAA,CAAS,CAAC,EAC7B,MAAMU,EAAA,CACR,EACA,MAAM,OAAQ,CACZvB,EAAO,EACPC,EAAQH,EACRI,EAAS,GACTC,EAASP,EAAI,cACbQ,EAAOR,EAAI,YACXa,EAAM,MAAA,EACN,MAAMc,EAAA,CACR,EACA,MAAM,OAAOX,EAAG0B,EAAM,CACpBpC,EAASU,EACTZ,EAAO,EACHsC,GAAM,UAAW,MAAMf,EAAA,EACtBE,EAAA,CACP,EACA,MAAM,UAAUO,EAAG,CACjB7B,EAAS6B,EACThC,EAAO,EACP,MAAMuB,EAAA,CACR,EACA,MAAM,SAASU,EAAG,CAChBhC,EAAQ,KAAK,IAAI,EAAGgC,CAAC,EACrBjC,EAAO,EACP,MAAMuB,EAAA,CACR,EACA,MAAM,QAAQW,EAAG,CACf9B,EAAO8B,EACPlC,EAAO,EACP,MAAMuB,EAAA,CACR,EACA,UAAUgB,EAAU,CAClB,OAAA1C,EAAU,IAAI0C,CAAQ,EAElB1C,EAAU,OAAS,GAAKQ,EAAM,SAAW,GAAK,CAACE,GAC5CgB,EAAA,EAEA,IAAM1B,EAAU,OAAO0C,CAAQ,CACxC,CAAA,CAEJ"}
+{"version":3,"file":"remoteList.cjs","names":[],"sources":["../../src/array/remoteList.ts"],"sourcesContent":["import type { BaseList } from './list';\n\n// #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> = BaseList<T> & {\n  // Batch updates across properties in one recompute/refetch\n  batch(\n    mutator: (ctx: {\n      goTo(p: number): void; // 1-based\n      setData?(d: readonly T[]): void; // local-only\n      setFilter(f: F): void;\n      setLimit(n: number): void;\n      setQuery(q: string): void;\n      setSort(s?: S): void;\n    }) => void,\n  ): Promise<void>;\n  readonly current: readonly T[];\n  goTo(page: number): Promise<void>;\n\n  invalidate?(): void;\n  readonly meta: RemoteMeta;\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  subscribe(listener: () => void): () => 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  cacheTtl?: number; // milliseconds; omit (or 0) to cache indefinitely\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 = { dir?: 'asc' | 'desc'; key?: string }>(\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, { result: RemoteResult<T>; ts: number }>();\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\n    const pages = Math.max(1, Math.ceil(total / limit));\n\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    const entry = cache.get(k);\n    const ttl = cfg.cacheTtl;\n\n    if (entry && (!ttl || Date.now() - entry.ts < ttl)) {\n      assign(entry.result);\n\n      return;\n    }\n\n    if (inflight.has(k)) {\n      await inflight.get(k);\n      assign(cache.get(k)!.result);\n\n      return;\n    }\n\n    loading = true;\n    error = null;\n    notify();\n\n    const p = cfg\n      .fetch(q)\n      .then((res) => {\n        cache.set(k, { result: res, ts: Date.now() });\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\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\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\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\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\n      // optional: trigger an initial load on the first subscription\n      if (listeners.size === 1 && items.length === 0 && !loading) {\n        void update();\n      }\n\n      return () => listeners.delete(listener);\n    },\n  };\n}\n"],"mappings":"AAqEA,SAAgB,EACd,EACqB,CACrB,IAAM,EAAY,IAAI,IAEhB,EAAe,KAAK,IAAI,EAAG,EAAI,OAAS,GAAG,CAC3C,EAAa,EAAI,YAAc,IAEjC,EAAO,EACP,EAAQ,EACR,EAAS,GACT,EAAS,EAAI,cACb,EAAO,EAAI,YAEX,EAAsB,EAAE,CACxB,EAAQ,EACR,EAAU,GACV,EAAuB,KAErB,EAAQ,IAAI,IACZ,EAAW,IAAI,IAEf,EAAS,GAAyB,KAAK,UAAU,EAAE,CACnD,OAAoC,CACxC,SACA,QACA,OACA,OAAQ,GAAU,IAAA,GAClB,OACD,EAEK,EAAU,GAAyB,CACvC,EAAQ,EAAI,MACZ,EAAQ,EAAI,OAAS,EAErB,IAAM,EAAQ,KAAK,IAAI,EAAG,KAAK,KAAK,EAAQ,EAAM,CAAC,CAEnD,EAAO,KAAK,IAAI,KAAK,IAAI,EAAG,EAAK,CAAE,EAAM,EAGrC,MAAe,CACnB,IAAK,IAAM,KAAK,EACd,GAAG,EAID,EAAa,KAAO,IAAyB,CACjD,IAAM,EAAI,EAAM,EAAE,CACZ,EAAQ,EAAM,IAAI,EAAE,CACpB,EAAM,EAAI,SAEhB,GAAI,IAAU,CAAC,GAAO,KAAK,KAAK,CAAG,EAAM,GAAK,GAAM,CAClD,EAAO,EAAM,OAAO,CAEpB,OAGF,GAAI,EAAS,IAAI,EAAE,CAAE,CACnB,MAAM,EAAS,IAAI,EAAE,CACrB,EAAO,EAAM,IAAI,EAAE,CAAE,OAAO,CAE5B,OAGF,EAAU,GACV,EAAQ,KACR,GAAQ,CAER,IAAM,EAAI,EACP,MAAM,EAAE,CACR,KAAM,GAAQ,CACb,EAAM,IAAI,EAAG,CAAE,OAAQ,EAAK,GAAI,KAAK,KAAK,CAAE,CAAC,CAC7C,EAAO,EAAI,EACX,CACD,MAAO,GAAM,CACZ,EAAQ,GAAG,SAAW,iBACtB,EAAQ,EAAE,CACV,EAAQ,GACR,CACD,YAAc,CACb,EAAS,OAAO,EAAE,CAClB,EAAU,GACV,GAAQ,EACR,CAEJ,EAAS,IAAI,EAAG,EAAE,CAClB,MAAM,GAGF,EAAS,SAAY,CACzB,MAAM,EAAW,GAAS,CAAC,EAIzB,EACE,MAAkB,CAClB,GAAO,aAAa,EAAM,CAE9B,EAAQ,eAAiB,CACvB,EAAQ,IAAA,GACH,GAAQ,EACZ,EAAW,EAIhB,MAAO,CACL,MAAM,MAAM,EAAS,CAEnB,IAAI,EAAW,EACX,EAAY,EACZ,EAAa,EACb,EAAa,EACb,EAAW,EAEf,EAAQ,CACN,KAAO,GAAc,CACnB,EAAW,KAAK,IAAI,EAAG,EAAI,EAAE,EAE/B,UAAY,GAAS,CACnB,EAAa,EACb,EAAW,GAEb,SAAW,GAAM,CACf,EAAY,KAAK,IAAI,EAAG,EAAE,CAC1B,EAAW,GAEb,SAAW,GAAc,CACvB,EAAa,EACb,EAAW,GAEb,QAAU,GAAU,CAClB,EAAW,EACX,EAAW,GAEd,CAAC,CAGF,EAAO,EACP,EAAQ,EACR,EAAS,EACT,EAAS,EACT,EAAO,EAEP,MAAM,GAAQ,EAEhB,IAAI,SAAU,CACZ,OAAO,GAET,MAAM,KAAK,EAAG,CACZ,EAAO,KAAK,IAAI,EAAG,EAAI,EAAE,CACzB,MAAM,GAAQ,EAEhB,YAAa,CACX,EAAM,OAAO,EAEf,IAAI,MAAO,CACT,IAAM,EAAU,IAAU,EACpB,EAAQ,KAAK,IAAI,EAAG,KAAK,KAAK,EAAQ,EAAM,CAAC,CAC7C,EAAW,KAAK,IAAI,EAAM,EAAM,CAChC,EAAQ,EAAU,GAAK,EAAW,GAAK,EAAQ,EAGrD,MAAO,CACL,IAHU,EAAU,EAAI,KAAK,IAAI,EAAW,EAAO,EAAM,CAIzD,QACA,UACA,QAAS,GAAY,EACrB,OAAQ,GAAY,EACpB,QACA,UACA,KAAM,EACN,QACA,QACA,QACD,EAEH,MAAM,MAAO,CACX,GAAQ,EACR,MAAM,GAAQ,EAEhB,MAAM,MAAO,CACX,EAAO,KAAK,IAAI,EAAG,EAAO,EAAE,CAC5B,MAAM,GAAQ,EAEhB,MAAM,SAAU,CACd,EAAM,OAAO,EAAM,GAAS,CAAC,CAAC,CAC9B,MAAM,GAAQ,EAEhB,MAAM,OAAQ,CACZ,EAAO,EACP,EAAQ,EACR,EAAS,GACT,EAAS,EAAI,cACb,EAAO,EAAI,YACX,EAAM,OAAO,CACb,MAAM,GAAQ,EAEhB,MAAM,OAAO,EAAG,EAAM,CACpB,EAAS,EACT,EAAO,EAEH,GAAM,UAAW,MAAM,GAAQ,CAC9B,GAAW,EAElB,MAAM,UAAU,EAAG,CACjB,EAAS,EACT,EAAO,EACP,MAAM,GAAQ,EAEhB,MAAM,SAAS,EAAG,CAChB,EAAQ,KAAK,IAAI,EAAG,EAAE,CACtB,EAAO,EACP,MAAM,GAAQ,EAEhB,MAAM,QAAQ,EAAG,CACf,EAAO,EACP,EAAO,EACP,MAAM,GAAQ,EAEhB,UAAU,EAAU,CAQlB,OAPA,EAAU,IAAI,EAAS,CAGnB,EAAU,OAAS,GAAK,EAAM,SAAW,GAAK,CAAC,GAC5C,GAAQ,KAGF,EAAU,OAAO,EAAS,EAE1C"}

package/dist/array/remoteList.d.ts

@@ -0,0 +1,64 @@
+import type { BaseList } from './list';
+export type RemoteMeta = Readonly<{
+    end: number;
+    error: string | null;
+    isEmpty: boolean;
+    isFirst: boolean;
+    isLast: boolean;
+    limit: number;
+    loading: boolean;
+    page: number;
+    pages: number;
+    start: number;
+    total: number;
+}>;
+export type RemoteList<T, F, S> = BaseList<T> & {
+    batch(mutator: (ctx: {
+        goTo(p: number): void;
+        setData?(d: readonly T[]): void;
+        setFilter(f: F): void;
+        setLimit(n: number): void;
+        setQuery(q: string): void;
+        setSort(s?: S): void;
+    }) => void): Promise<void>;
+    readonly current: readonly T[];
+    goTo(page: number): Promise<void>;
+    invalidate?(): void;
+    readonly meta: RemoteMeta;
+    next(): Promise<void>;
+    prev(): Promise<void>;
+    refresh(): Promise<void>;
+    reset(): Promise<void>;
+    search(query: string, opts?: {
+        immediate?: boolean;
+    }): Promise<void>;
+    setFilter(filter: F): Promise<void>;
+    setLimit(n: number): Promise<void>;
+    setSort(sort?: S): Promise<void>;
+    subscribe(listener: () => void): () => void;
+};
+type RemoteQuery<F, S> = Readonly<{
+    filter?: F;
+    limit: number;
+    page: number;
+    search?: string;
+    sort?: S;
+}>;
+type RemoteResult<T> = Readonly<{
+    items: readonly T[];
+    total: number;
+}>;
+type RemoteConfig<T, F, S> = Readonly<{
+    cacheTtl?: number;
+    debounceMs?: number;
+    fetch: (q: RemoteQuery<F, S>) => Promise<RemoteResult<T>>;
+    initialFilter?: F;
+    initialSort?: S;
+    limit?: number;
+}>;
+export declare function remoteList<T, F = Record<string, unknown>, S = {
+    dir?: 'asc' | 'desc';
+    key?: string;
+}>(cfg: RemoteConfig<T, F, S>): RemoteList<T, F, S>;
+export {};
+//# sourceMappingURL=remoteList.d.ts.map

package/dist/array/remoteList.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"remoteList.d.ts","sourceRoot":"","sources":["../../src/array/remoteList.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,QAAQ,EAAE,MAAM,QAAQ,CAAC;AAGvC,MAAM,MAAM,UAAU,GAAG,QAAQ,CAAC;IAChC,GAAG,EAAE,MAAM,CAAC;IACZ,KAAK,EAAE,MAAM,GAAG,IAAI,CAAC;IACrB,OAAO,EAAE,OAAO,CAAC;IACjB,OAAO,EAAE,OAAO,CAAC;IACjB,MAAM,EAAE,OAAO,CAAC;IAChB,KAAK,EAAE,MAAM,CAAC;IACd,OAAO,EAAE,OAAO,CAAC;IACjB,IAAI,EAAE,MAAM,CAAC;IACb,KAAK,EAAE,MAAM,CAAC;IACd,KAAK,EAAE,MAAM,CAAC;IACd,KAAK,EAAE,MAAM,CAAC;CACf,CAAC,CAAC;AAIH,MAAM,MAAM,UAAU,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,IAAI,QAAQ,CAAC,CAAC,CAAC,GAAG;IAE9C,KAAK,CACH,OAAO,EAAE,CAAC,GAAG,EAAE;QACb,IAAI,CAAC,CAAC,EAAE,MAAM,GAAG,IAAI,CAAC;QACtB,OAAO,CAAC,CAAC,CAAC,EAAE,SAAS,CAAC,EAAE,GAAG,IAAI,CAAC;QAChC,SAAS,CAAC,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC;QACtB,QAAQ,CAAC,CAAC,EAAE,MAAM,GAAG,IAAI,CAAC;QAC1B,QAAQ,CAAC,CAAC,EAAE,MAAM,GAAG,IAAI,CAAC;QAC1B,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC;KACtB,KAAK,IAAI,GACT,OAAO,CAAC,IAAI,CAAC,CAAC;IACjB,QAAQ,CAAC,OAAO,EAAE,SAAS,CAAC,EAAE,CAAC;IAC/B,IAAI,CAAC,IAAI,EAAE,MAAM,GAAG,OAAO,CAAC,IAAI,CAAC,CAAC;IAElC,UAAU,CAAC,IAAI,IAAI,CAAC;IACpB,QAAQ,CAAC,IAAI,EAAE,UAAU,CAAC;IAC1B,IAAI,IAAI,OAAO,CAAC,IAAI,CAAC,CAAC;IACtB,IAAI,IAAI,OAAO,CAAC,IAAI,CAAC,CAAC;IACtB,OAAO,IAAI,OAAO,CAAC,IAAI,CAAC,CAAC;IACzB,KAAK,IAAI,OAAO,CAAC,IAAI,CAAC,CAAC;IACvB,MAAM,CAAC,KAAK,EAAE,MAAM,EAAE,IAAI,CAAC,EAAE;QAAE,SAAS,CAAC,EAAE,OAAO,CAAA;KAAE,GAAG,OAAO,CAAC,IAAI,CAAC,CAAC;IACrE,SAAS,CAAC,MAAM,EAAE,CAAC,GAAG,OAAO,CAAC,IAAI,CAAC,CAAC;IACpC,QAAQ,CAAC,CAAC,EAAE,MAAM,GAAG,OAAO,CAAC,IAAI,CAAC,CAAC;IACnC,OAAO,CAAC,IAAI,CAAC,EAAE,CAAC,GAAG,OAAO,CAAC,IAAI,CAAC,CAAC;IACjC,SAAS,CAAC,QAAQ,EAAE,MAAM,IAAI,GAAG,MAAM,IAAI,CAAC;CAC7C,CAAC;AAIF,KAAK,WAAW,CAAC,CAAC,EAAE,CAAC,IAAI,QAAQ,CAAC;IAChC,MAAM,CAAC,EAAE,CAAC,CAAC;IACX,KAAK,EAAE,MAAM,CAAC;IACd,IAAI,EAAE,MAAM,CAAC;IACb,MAAM,CAAC,EAAE,MAAM,CAAC;IAChB,IAAI,CAAC,EAAE,CAAC,CAAC;CACV,CAAC,CAAC;AAEH,KAAK,YAAY,CAAC,CAAC,IAAI,QAAQ,CAAC;IAAE,KAAK,EAAE,SAAS,CAAC,EAAE,CAAC;IAAC,KAAK,EAAE,MAAM,CAAA;CAAE,CAAC,CAAC;AAExE,KAAK,YAAY,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,IAAI,QAAQ,CAAC;IACpC,QAAQ,CAAC,EAAE,MAAM,CAAC;IAClB,UAAU,CAAC,EAAE,MAAM,CAAC;IACpB,KAAK,EAAE,CAAC,CAAC,EAAE,WAAW,CAAC,CAAC,EAAE,CAAC,CAAC,KAAK,OAAO,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC,CAAC;IAC1D,aAAa,CAAC,EAAE,CAAC,CAAC;IAClB,WAAW,CAAC,EAAE,CAAC,CAAC;IAChB,KAAK,CAAC,EAAE,MAAM,CAAC;CAChB,CAAC,CAAC;AAGH,wBAAgB,UAAU,CAAC,CAAC,EAAE,CAAC,GAAG,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,EAAE,CAAC,GAAG;IAAE,GAAG,CAAC,EAAE,KAAK,GAAG,MAAM,CAAC;IAAC,GAAG,CAAC,EAAE,MAAM,CAAA;CAAE,EACnG,GAAG,EAAE,YAAY,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,GACzB,UAAU,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAoOrB"}