@vielzeug/toolkit 1.1.3 → 2.1.0

package/dist/array/remoteList.js

@@ -1,123 +1,122 @@
-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);
-    }
-  };
+//#region src/array/remoteList.ts
+function e(e) {
+	let t = /* @__PURE__ */ 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 = /* @__PURE__ */ new Map(), m = /* @__PURE__ */ 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);
+		}
+	};
 }
-export {
-  Q as remoteList
-};
-//# sourceMappingURL=remoteList.js.map
+//#endregion
+export { e as remoteList };
+
+//# sourceMappingURL=remoteList.js.map

package/dist/array/remoteList.js.map

@@ -1 +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;"}
+{"version":3,"file":"remoteList.js","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,GACqB;CACrB,IAAM,oBAAY,IAAI,KAAiB,EAEjC,IAAe,KAAK,IAAI,GAAG,EAAI,SAAS,GAAG,EAC3C,IAAa,EAAI,cAAc,KAEjC,IAAO,GACP,IAAQ,GACR,IAAS,IACT,IAAS,EAAI,eACb,IAAO,EAAI,aAEX,IAAsB,EAAE,EACxB,IAAQ,GACR,IAAU,IACV,IAAuB,MAErB,oBAAQ,IAAI,KAAsD,EAClE,oBAAW,IAAI,KAA4B,EAE3C,KAAS,MAAyB,KAAK,UAAU,EAAE,EACnD,WAAoC;EACxC;EACA;EACA;EACA,QAAQ,KAAU,KAAA;EAClB;EACD,GAEK,KAAU,MAAyB;AAEvC,EADA,IAAQ,EAAI,OACZ,IAAQ,EAAI,SAAS;EAErB,IAAM,IAAQ,KAAK,IAAI,GAAG,KAAK,KAAK,IAAQ,EAAM,CAAC;AAEnD,MAAO,KAAK,IAAI,KAAK,IAAI,GAAG,EAAK,EAAE,EAAM;IAGrC,UAAe;AACnB,OAAK,IAAM,KAAK,EACd,IAAG;IAID,IAAa,OAAO,MAAyB;EACjD,IAAM,IAAI,EAAM,EAAE,EACZ,IAAQ,EAAM,IAAI,EAAE,EACpB,IAAM,EAAI;AAEhB,MAAI,MAAU,CAAC,KAAO,KAAK,KAAK,GAAG,EAAM,KAAK,IAAM;AAClD,KAAO,EAAM,OAAO;AAEpB;;AAGF,MAAI,EAAS,IAAI,EAAE,EAAE;AAEnB,GADA,MAAM,EAAS,IAAI,EAAE,EACrB,EAAO,EAAM,IAAI,EAAE,CAAE,OAAO;AAE5B;;AAKF,EAFA,IAAU,IACV,IAAQ,MACR,GAAQ;EAER,IAAM,IAAI,EACP,MAAM,EAAE,CACR,MAAM,MAAQ;AAEb,GADA,EAAM,IAAI,GAAG;IAAE,QAAQ;IAAK,IAAI,KAAK,KAAK;IAAE,CAAC,EAC7C,EAAO,EAAI;IACX,CACD,OAAO,MAAM;AAGZ,GAFA,IAAQ,GAAG,WAAW,kBACtB,IAAQ,EAAE,EACV,IAAQ;IACR,CACD,cAAc;AAGb,GAFA,EAAS,OAAO,EAAE,EAClB,IAAU,IACV,GAAQ;IACR;AAGJ,EADA,EAAS,IAAI,GAAG,EAAE,EAClB,MAAM;IAGF,IAAS,YAAY;AACzB,QAAM,EAAW,GAAS,CAAC;IAIzB,GACE,UAAkB;AAGtB,EAFI,KAAO,aAAa,EAAM,EAE9B,IAAQ,iBAAiB;AAElB,GADL,IAAQ,KAAA,GACH,GAAQ;KACZ,EAAW;;AAIhB,QAAO;EACL,MAAM,MAAM,GAAS;GAEnB,IAAI,IAAW,GACX,IAAY,GACZ,IAAa,GACb,IAAa,GACb,IAAW;AA+Bf,GA7BA,EAAQ;IACN,OAAO,MAAc;AACnB,SAAW,KAAK,IAAI,GAAG,IAAI,EAAE;;IAE/B,YAAY,MAAS;AAEnB,KADA,IAAa,GACb,IAAW;;IAEb,WAAW,MAAM;AAEf,KADA,IAAY,KAAK,IAAI,GAAG,EAAE,EAC1B,IAAW;;IAEb,WAAW,MAAc;AAEvB,KADA,IAAa,GACb,IAAW;;IAEb,UAAU,MAAU;AAElB,KADA,IAAW,GACX,IAAW;;IAEd,CAAC,EAGF,IAAO,GACP,IAAQ,GACR,IAAS,GACT,IAAS,GACT,IAAO,GAEP,MAAM,GAAQ;;EAEhB,IAAI,UAAU;AACZ,UAAO;;EAET,MAAM,KAAK,GAAG;AAEZ,GADA,IAAO,KAAK,IAAI,GAAG,IAAI,EAAE,EACzB,MAAM,GAAQ;;EAEhB,aAAa;AACX,KAAM,OAAO;;EAEf,IAAI,OAAO;GACT,IAAM,IAAU,MAAU,GACpB,IAAQ,KAAK,IAAI,GAAG,KAAK,KAAK,IAAQ,EAAM,CAAC,EAC7C,IAAW,KAAK,IAAI,GAAM,EAAM,EAChC,IAAQ,IAAU,KAAK,IAAW,KAAK,IAAQ;AAGrD,UAAO;IACL,KAHU,IAAU,IAAI,KAAK,IAAI,IAAW,GAAO,EAAM;IAIzD;IACA;IACA,SAAS,KAAY;IACrB,QAAQ,KAAY;IACpB;IACA;IACA,MAAM;IACN;IACA;IACA;IACD;;EAEH,MAAM,OAAO;AAEX,GADA,KAAQ,GACR,MAAM,GAAQ;;EAEhB,MAAM,OAAO;AAEX,GADA,IAAO,KAAK,IAAI,GAAG,IAAO,EAAE,EAC5B,MAAM,GAAQ;;EAEhB,MAAM,UAAU;AAEd,GADA,EAAM,OAAO,EAAM,GAAS,CAAC,CAAC,EAC9B,MAAM,GAAQ;;EAEhB,MAAM,QAAQ;AAOZ,GANA,IAAO,GACP,IAAQ,GACR,IAAS,IACT,IAAS,EAAI,eACb,IAAO,EAAI,aACX,EAAM,OAAO,EACb,MAAM,GAAQ;;EAEhB,MAAM,OAAO,GAAG,GAAM;AAIpB,GAHA,IAAS,GACT,IAAO,GAEH,GAAM,YAAW,MAAM,GAAQ,GAC9B,GAAW;;EAElB,MAAM,UAAU,GAAG;AAGjB,GAFA,IAAS,GACT,IAAO,GACP,MAAM,GAAQ;;EAEhB,MAAM,SAAS,GAAG;AAGhB,GAFA,IAAQ,KAAK,IAAI,GAAG,EAAE,EACtB,IAAO,GACP,MAAM,GAAQ;;EAEhB,MAAM,QAAQ,GAAG;AAGf,GAFA,IAAO,GACP,IAAO,GACP,MAAM,GAAQ;;EAEhB,UAAU,GAAU;AAQlB,UAPA,EAAU,IAAI,EAAS,EAGnB,EAAU,SAAS,KAAK,EAAM,WAAW,KAAK,CAAC,KAC5C,GAAQ,QAGF,EAAU,OAAO,EAAS;;EAE1C"}

package/dist/array/replace.cjs

@@ -0,0 +1,2 @@
+const e=require(`../function/assert.cjs`),t=require(`../typed/isArray.cjs`);function n(n,r,i){e.assert(t.isArray(n),t.IS_ARRAY_ERROR_MSG,{args:{array:n},type:TypeError});let a=n.findIndex(r);return a===-1?n:[...n.slice(0,a),i,...n.slice(a+1)]}exports.replace=n;
+//# sourceMappingURL=replace.cjs.map

package/dist/array/replace.cjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"replace.cjs","names":[],"sources":["../../src/array/replace.ts"],"sourcesContent":["import type { Predicate } from '../types';\n\nimport { assert } from '../function/assert';\nimport { IS_ARRAY_ERROR_MSG, isArray } from '../typed/isArray';\n\n/**\n * Replaces the first element in an array that satisfies the provided predicate\n * function with a new value.\n *\n * @example\n * ```ts\n * replace([1, 2, 3], (n) => n === 2, 4) // [1, 4, 3]\n * ```\n *\n * @param array - The array to search.\n * @param predicate - A function to test each element of the array.\n * @param value - The new value to replace the found element.\n *\n * @return A new array with the replaced value.\n *\n * @throws {TypeError} If the first argument is not an array.\n */\nexport function replace<T>(array: T[], predicate: Predicate<T>, value: T): T[] {\n  assert(isArray(array), IS_ARRAY_ERROR_MSG, { args: { array }, type: TypeError });\n\n  const index = array.findIndex(predicate);\n\n  if (index === -1) return array;\n\n  return [...array.slice(0, index), value, ...array.slice(index + 1)];\n}\n"],"mappings":"4EAsBA,SAAgB,EAAW,EAAY,EAAyB,EAAe,CAC7E,EAAA,OAAO,EAAA,QAAQ,EAAM,CAAE,EAAA,mBAAoB,CAAE,KAAM,CAAE,QAAO,CAAE,KAAM,UAAW,CAAC,CAEhF,IAAM,EAAQ,EAAM,UAAU,EAAU,CAIxC,OAFI,IAAU,GAAW,EAElB,CAAC,GAAG,EAAM,MAAM,EAAG,EAAM,CAAE,EAAO,GAAG,EAAM,MAAM,EAAQ,EAAE,CAAC"}

package/dist/array/replace.d.ts

@@ -0,0 +1,20 @@
+import type { Predicate } from '../types';
+/**
+ * Replaces the first element in an array that satisfies the provided predicate
+ * function with a new value.
+ *
+ * @example
+ * ```ts
+ * replace([1, 2, 3], (n) => n === 2, 4) // [1, 4, 3]
+ * ```
+ *
+ * @param array - The array to search.
+ * @param predicate - A function to test each element of the array.
+ * @param value - The new value to replace the found element.
+ *
+ * @return A new array with the replaced value.
+ *
+ * @throws {TypeError} If the first argument is not an array.
+ */
+export declare function replace<T>(array: T[], predicate: Predicate<T>, value: T): T[];
+//# sourceMappingURL=replace.d.ts.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"replace.d.ts","sourceRoot":"","sources":["../../src/array/replace.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,SAAS,EAAE,MAAM,UAAU,CAAC;AAK1C;;;;;;;;;;;;;;;;GAgBG;AACH,wBAAgB,OAAO,CAAC,CAAC,EAAE,KAAK,EAAE,CAAC,EAAE,EAAE,SAAS,EAAE,SAAS,CAAC,CAAC,CAAC,EAAE,KAAK,EAAE,CAAC,GAAG,CAAC,EAAE,CAQ7E"}

package/dist/array/replace.js

@@ -0,0 +1,19 @@
+import { assert as e } from "../function/assert.js";
+import { IS_ARRAY_ERROR_MSG as t, isArray as n } from "../typed/isArray.js";
+//#region src/array/replace.ts
+function r(r, i, a) {
+	e(n(r), t, {
+		args: { array: r },
+		type: TypeError
+	});
+	let o = r.findIndex(i);
+	return o === -1 ? r : [
+		...r.slice(0, o),
+		a,
+		...r.slice(o + 1)
+	];
+}
+//#endregion
+export { r as replace };
+
+//# sourceMappingURL=replace.js.map

package/dist/array/replace.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"replace.js","names":[],"sources":["../../src/array/replace.ts"],"sourcesContent":["import type { Predicate } from '../types';\n\nimport { assert } from '../function/assert';\nimport { IS_ARRAY_ERROR_MSG, isArray } from '../typed/isArray';\n\n/**\n * Replaces the first element in an array that satisfies the provided predicate\n * function with a new value.\n *\n * @example\n * ```ts\n * replace([1, 2, 3], (n) => n === 2, 4) // [1, 4, 3]\n * ```\n *\n * @param array - The array to search.\n * @param predicate - A function to test each element of the array.\n * @param value - The new value to replace the found element.\n *\n * @return A new array with the replaced value.\n *\n * @throws {TypeError} If the first argument is not an array.\n */\nexport function replace<T>(array: T[], predicate: Predicate<T>, value: T): T[] {\n  assert(isArray(array), IS_ARRAY_ERROR_MSG, { args: { array }, type: TypeError });\n\n  const index = array.findIndex(predicate);\n\n  if (index === -1) return array;\n\n  return [...array.slice(0, index), value, ...array.slice(index + 1)];\n}\n"],"mappings":";;;AAsBA,SAAgB,EAAW,GAAY,GAAyB,GAAe;AAC7E,GAAO,EAAQ,EAAM,EAAE,GAAoB;EAAE,MAAM,EAAE,UAAO;EAAE,MAAM;EAAW,CAAC;CAEhF,IAAM,IAAQ,EAAM,UAAU,EAAU;AAIxC,QAFI,MAAU,KAAW,IAElB;EAAC,GAAG,EAAM,MAAM,GAAG,EAAM;EAAE;EAAO,GAAG,EAAM,MAAM,IAAQ,EAAE;EAAC"}

package/dist/array/rotate.cjs

@@ -0,0 +1,2 @@
+const e=require(`../function/assert.cjs`),t=require(`../typed/isArray.cjs`),n=require(`../typed/isNumber.cjs`);function r(r,i,{wrap:a=!1}={}){if(e.assert(t.isArray(r),t.IS_ARRAY_ERROR_MSG,{args:{array:r},type:TypeError}),e.assert(n.isNumber(i),n.IS_NUMBER_ERROR_MSG,{args:{positions:i},type:TypeError}),r.length===0)return r;let o=(i%r.length+r.length)%r.length,s=r.slice(o);return a?[...s,...r.slice(0,o)]:s}exports.rotate=r;
+//# sourceMappingURL=rotate.cjs.map

package/dist/array/rotate.cjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"rotate.cjs","names":[],"sources":["../../src/array/rotate.ts"],"sourcesContent":["import { assert } from '../function/assert';\nimport { IS_ARRAY_ERROR_MSG, isArray } from '../typed/isArray';\nimport { IS_NUMBER_ERROR_MSG, isNumber } from '../typed/isNumber';\n\n/**\n * Rotates the elements of an array by a specified number of positions.\n *\n * @example\n * ```ts\n * const arr = [1, 2, 3, 4, 5];\n * rotate(arr, 2); // [3, 4, 5]\n * rotate(arr, 2, { wrap: true }); // [3, 4, 5, 1, 2]\n * ```\n * @param array - The array to rotate.\n * @param positions - The number of positions to rotate the array.\n * @param [options] - Options for the rotate operation.\n * @param [options.wrap] - If `true`, the rotated-out elements are appended to the end.\n *\n * @returns A new array with the elements rotated.\n *\n * @throws {TypeError} If the first argument is not an array, or the second argument is not a number.\n */\nexport function rotate<T>(array: T[], positions: number, { wrap = false }: { wrap?: boolean } = {}): T[] {\n  assert(isArray(array), IS_ARRAY_ERROR_MSG, { args: { array }, type: TypeError });\n  assert(isNumber(positions), IS_NUMBER_ERROR_MSG, { args: { positions }, type: TypeError });\n\n  if (array.length === 0) return array;\n\n  const normalizedPos = ((positions % array.length) + array.length) % array.length;\n  const rotated = array.slice(normalizedPos);\n\n  return wrap ? [...rotated, ...array.slice(0, normalizedPos)] : rotated;\n}\n"],"mappings":"+GAsBA,SAAgB,EAAU,EAAY,EAAmB,CAAE,OAAO,IAA8B,EAAE,CAAO,CAIvG,GAHA,EAAA,OAAO,EAAA,QAAQ,EAAM,CAAE,EAAA,mBAAoB,CAAE,KAAM,CAAE,QAAO,CAAE,KAAM,UAAW,CAAC,CAChF,EAAA,OAAO,EAAA,SAAS,EAAU,CAAE,EAAA,oBAAqB,CAAE,KAAM,CAAE,YAAW,CAAE,KAAM,UAAW,CAAC,CAEtF,EAAM,SAAW,EAAG,OAAO,EAE/B,IAAM,GAAkB,EAAY,EAAM,OAAU,EAAM,QAAU,EAAM,OACpE,EAAU,EAAM,MAAM,EAAc,CAE1C,OAAO,EAAO,CAAC,GAAG,EAAS,GAAG,EAAM,MAAM,EAAG,EAAc,CAAC,CAAG"}

package/dist/array/rotate.d.ts

@@ -0,0 +1,22 @@
+/**
+ * Rotates the elements of an array by a specified number of positions.
+ *
+ * @example
+ * ```ts
+ * const arr = [1, 2, 3, 4, 5];
+ * rotate(arr, 2); // [3, 4, 5]
+ * rotate(arr, 2, { wrap: true }); // [3, 4, 5, 1, 2]
+ * ```
+ * @param array - The array to rotate.
+ * @param positions - The number of positions to rotate the array.
+ * @param [options] - Options for the rotate operation.
+ * @param [options.wrap] - If `true`, the rotated-out elements are appended to the end.
+ *
+ * @returns A new array with the elements rotated.
+ *
+ * @throws {TypeError} If the first argument is not an array, or the second argument is not a number.
+ */
+export declare function rotate<T>(array: T[], positions: number, { wrap }?: {
+    wrap?: boolean;
+}): T[];
+//# sourceMappingURL=rotate.d.ts.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"rotate.d.ts","sourceRoot":"","sources":["../../src/array/rotate.ts"],"names":[],"mappings":"AAIA;;;;;;;;;;;;;;;;;GAiBG;AACH,wBAAgB,MAAM,CAAC,CAAC,EAAE,KAAK,EAAE,CAAC,EAAE,EAAE,SAAS,EAAE,MAAM,EAAE,EAAE,IAAY,EAAE,GAAE;IAAE,IAAI,CAAC,EAAE,OAAO,CAAA;CAAO,GAAG,CAAC,EAAE,CAUvG"}

package/dist/array/rotate.js

@@ -0,0 +1,19 @@
+import { assert as e } from "../function/assert.js";
+import { IS_ARRAY_ERROR_MSG as t, isArray as n } from "../typed/isArray.js";
+import { IS_NUMBER_ERROR_MSG as r, isNumber as i } from "../typed/isNumber.js";
+//#region src/array/rotate.ts
+function a(a, o, { wrap: s = !1 } = {}) {
+	if (e(n(a), t, {
+		args: { array: a },
+		type: TypeError
+	}), e(i(o), r, {
+		args: { positions: o },
+		type: TypeError
+	}), a.length === 0) return a;
+	let c = (o % a.length + a.length) % a.length, l = a.slice(c);
+	return s ? [...l, ...a.slice(0, c)] : l;
+}
+//#endregion
+export { a as rotate };
+
+//# sourceMappingURL=rotate.js.map

package/dist/array/rotate.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"rotate.js","names":[],"sources":["../../src/array/rotate.ts"],"sourcesContent":["import { assert } from '../function/assert';\nimport { IS_ARRAY_ERROR_MSG, isArray } from '../typed/isArray';\nimport { IS_NUMBER_ERROR_MSG, isNumber } from '../typed/isNumber';\n\n/**\n * Rotates the elements of an array by a specified number of positions.\n *\n * @example\n * ```ts\n * const arr = [1, 2, 3, 4, 5];\n * rotate(arr, 2); // [3, 4, 5]\n * rotate(arr, 2, { wrap: true }); // [3, 4, 5, 1, 2]\n * ```\n * @param array - The array to rotate.\n * @param positions - The number of positions to rotate the array.\n * @param [options] - Options for the rotate operation.\n * @param [options.wrap] - If `true`, the rotated-out elements are appended to the end.\n *\n * @returns A new array with the elements rotated.\n *\n * @throws {TypeError} If the first argument is not an array, or the second argument is not a number.\n */\nexport function rotate<T>(array: T[], positions: number, { wrap = false }: { wrap?: boolean } = {}): T[] {\n  assert(isArray(array), IS_ARRAY_ERROR_MSG, { args: { array }, type: TypeError });\n  assert(isNumber(positions), IS_NUMBER_ERROR_MSG, { args: { positions }, type: TypeError });\n\n  if (array.length === 0) return array;\n\n  const normalizedPos = ((positions % array.length) + array.length) % array.length;\n  const rotated = array.slice(normalizedPos);\n\n  return wrap ? [...rotated, ...array.slice(0, normalizedPos)] : rotated;\n}\n"],"mappings":";;;;AAsBA,SAAgB,EAAU,GAAY,GAAmB,EAAE,UAAO,OAA8B,EAAE,EAAO;AAIvG,KAHA,EAAO,EAAQ,EAAM,EAAE,GAAoB;EAAE,MAAM,EAAE,UAAO;EAAE,MAAM;EAAW,CAAC,EAChF,EAAO,EAAS,EAAU,EAAE,GAAqB;EAAE,MAAM,EAAE,cAAW;EAAE,MAAM;EAAW,CAAC,EAEtF,EAAM,WAAW,EAAG,QAAO;CAE/B,IAAM,KAAkB,IAAY,EAAM,SAAU,EAAM,UAAU,EAAM,QACpE,IAAU,EAAM,MAAM,EAAc;AAE1C,QAAO,IAAO,CAAC,GAAG,GAAS,GAAG,EAAM,MAAM,GAAG,EAAc,CAAC,GAAG"}

package/dist/array/search.cjs

@@ -1,2 +1,2 @@
-"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const s=require("../function/assert.cjs"),c=require("../object/seek.cjs"),t=require("../typed/isString.cjs"),i=require("../typed/isWithin.cjs"),S=require("./filter.cjs");function u(n,r,e=.25){if(s.assert(t.isString(r),t.IS_STRING_ERROR_MSG,{args:{query:r},type:TypeError}),s.assert(i.isWithin(e,0,1),i.IS_WITHIN_ERROR_MSG,{args:{max:1,min:0,tone:e},type:TypeError}),!r)return[];const o=r.toLowerCase();return S.filter(n,a=>c.seek(a,o,e))}exports.search=u;
-//# sourceMappingURL=search.cjs.map
+const e=require(`../function/assert.cjs`),t=require(`../typed/isString.cjs`),n=require(`../typed/isWithin.cjs`),r=require(`../object/seek.cjs`);function i(i,a,o=.25){if(e.assert(t.isString(a),t.IS_STRING_ERROR_MSG,{args:{query:a},type:TypeError}),e.assert(n.isWithin(o,0,1),n.IS_WITHIN_ERROR_MSG,{args:{max:1,min:0,tone:o},type:TypeError}),!a)return[...i];let s=a.toLowerCase();return i.filter(e=>r.seek(e,s,o))}exports.search=i;
+//# sourceMappingURL=search.cjs.map

package/dist/array/search.cjs.map

@@ -1 +1 @@
-{"version":3,"file":"search.cjs","sources":["../../src/array/search.ts"],"sourcesContent":["import { assert } from '../function/assert';\nimport { seek } from '../object/seek';\nimport { IS_STRING_ERROR_MSG, isString } from '../typed/isString';\nimport { IS_WITHIN_ERROR_MSG, isWithin } from '../typed/isWithin';\nimport { filter } from './filter';\n\n/**\n * Performs a search on an array of objects, checking all values for a match with the search string.\n *\n * @example\n * ```ts\n * const data = [{ name: 'John Doe', age: 25 }, { name: 'Jane Doe', age: 30 }];\n * search(data, 'doe', 0.5); // [{ name: 'John Doe', age: 25 }, { name: 'Jane Doe', age: 30 }]\n * ```\n *\n * @param array - The array of objects to search.\n * @param query - The string to search for.\n * @param [tone=0.25] - Degree of similarity between 0 and 1.\n *\n * @returns The filtered array of objects that match the search string.\n *\n * @throws {Error} If input values are invalid.\n */\nexport function search<T>(array: T[], query: string, tone = 0.25): T[] {\n  assert(isString(query), IS_STRING_ERROR_MSG, { args: { query }, type: TypeError });\n  assert(isWithin(tone, 0, 1), IS_WITHIN_ERROR_MSG, { args: { max: 1, min: 0, tone }, type: TypeError });\n\n  if (!query) return [];\n\n  const searchTerm = query.toLowerCase();\n\n  return filter(array, (obj) => seek(obj, searchTerm, tone));\n}\n"],"names":["search","array","query","tone","assert","isString","IS_STRING_ERROR_MSG","isWithin","IS_WITHIN_ERROR_MSG","searchTerm","filter","obj","seek"],"mappings":"0PAuBO,SAASA,EAAUC,EAAYC,EAAeC,EAAO,IAAW,CAIrE,GAHAC,EAAAA,OAAOC,EAAAA,SAASH,CAAK,EAAGI,sBAAqB,CAAE,KAAM,CAAE,MAAAJ,CAAA,EAAS,KAAM,UAAW,EACjFE,EAAAA,OAAOG,EAAAA,SAASJ,EAAM,EAAG,CAAC,EAAGK,EAAAA,oBAAqB,CAAE,KAAM,CAAE,IAAK,EAAG,IAAK,EAAG,KAAAL,GAAQ,KAAM,UAAW,EAEjG,CAACD,EAAO,MAAO,CAAA,EAEnB,MAAMO,EAAaP,EAAM,YAAA,EAEzB,OAAOQ,EAAAA,OAAOT,EAAQU,GAAQC,EAAAA,KAAKD,EAAKF,EAAYN,CAAI,CAAC,CAC3D"}
+{"version":3,"file":"search.cjs","names":[],"sources":["../../src/array/search.ts"],"sourcesContent":["import { assert } from '../function/assert';\nimport { seek } from '../object/seek';\nimport { IS_STRING_ERROR_MSG, isString } from '../typed/isString';\nimport { IS_WITHIN_ERROR_MSG, isWithin } from '../typed/isWithin';\n\n/**\n * Performs a search on an array of objects, checking all values for a match with the search string.\n *\n * @example\n * ```ts\n * const data = [{ name: 'John Doe', age: 25 }, { name: 'Jane Doe', age: 30 }];\n * search(data, 'doe', 0.5); // [{ name: 'John Doe', age: 25 }, { name: 'Jane Doe', age: 30 }]\n * ```\n *\n * @param array - The array of objects to search.\n * @param query - The string to search for.\n * @param [tone=0.25] - Degree of similarity between 0 and 1.\n *\n * @returns The filtered array of objects that match the search string.\n *\n * @throws {Error} If input values are invalid.\n */\nexport function search<T>(array: T[], query: string, tone = 0.25): T[] {\n  assert(isString(query), IS_STRING_ERROR_MSG, { args: { query }, type: TypeError });\n  assert(isWithin(tone, 0, 1), IS_WITHIN_ERROR_MSG, { args: { max: 1, min: 0, tone }, type: TypeError });\n\n  if (!query) return [...array];\n\n  const searchTerm = query.toLowerCase();\n\n  return array.filter((obj) => seek(obj as object, searchTerm, tone));\n}\n"],"mappings":"gJAsBA,SAAgB,EAAU,EAAY,EAAe,EAAO,IAAW,CAIrE,GAHA,EAAA,OAAO,EAAA,SAAS,EAAM,CAAE,EAAA,oBAAqB,CAAE,KAAM,CAAE,QAAO,CAAE,KAAM,UAAW,CAAC,CAClF,EAAA,OAAO,EAAA,SAAS,EAAM,EAAG,EAAE,CAAE,EAAA,oBAAqB,CAAE,KAAM,CAAE,IAAK,EAAG,IAAK,EAAG,OAAM,CAAE,KAAM,UAAW,CAAC,CAElG,CAAC,EAAO,MAAO,CAAC,GAAG,EAAM,CAE7B,IAAM,EAAa,EAAM,aAAa,CAEtC,OAAO,EAAM,OAAQ,GAAQ,EAAA,KAAK,EAAe,EAAY,EAAK,CAAC"}

package/dist/array/search.d.ts

@@ -0,0 +1,19 @@
+/**
+ * Performs a search on an array of objects, checking all values for a match with the search string.
+ *
+ * @example
+ * ```ts
+ * const data = [{ name: 'John Doe', age: 25 }, { name: 'Jane Doe', age: 30 }];
+ * search(data, 'doe', 0.5); // [{ name: 'John Doe', age: 25 }, { name: 'Jane Doe', age: 30 }]
+ * ```
+ *
+ * @param array - The array of objects to search.
+ * @param query - The string to search for.
+ * @param [tone=0.25] - Degree of similarity between 0 and 1.
+ *
+ * @returns The filtered array of objects that match the search string.
+ *
+ * @throws {Error} If input values are invalid.
+ */
+export declare function search<T>(array: T[], query: string, tone?: number): T[];
+//# sourceMappingURL=search.d.ts.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"search.d.ts","sourceRoot":"","sources":["../../src/array/search.ts"],"names":[],"mappings":"AAKA;;;;;;;;;;;;;;;;GAgBG;AACH,wBAAgB,MAAM,CAAC,CAAC,EAAE,KAAK,EAAE,CAAC,EAAE,EAAE,KAAK,EAAE,MAAM,EAAE,IAAI,SAAO,GAAG,CAAC,EAAE,CASrE"}

package/dist/array/search.js

@@ -1,14 +1,24 @@
-import { assert as t } from "../function/assert.js";
-import { seek as s } from "../object/seek.js";
-import { IS_STRING_ERROR_MSG as p, isString as f } from "../typed/isString.js";
-import { IS_WITHIN_ERROR_MSG as a, isWithin as R } from "../typed/isWithin.js";
-import { filter as n } from "./filter.js";
-function E(i, r, o = 0.25) {
-  if (t(f(r), p, { args: { query: r }, type: TypeError }), t(R(o, 0, 1), a, { args: { max: 1, min: 0, tone: o }, type: TypeError }), !r) return [];
-  const m = r.toLowerCase();
-  return n(i, (e) => s(e, m, o));
+import { assert as e } from "../function/assert.js";
+import { IS_STRING_ERROR_MSG as t, isString as n } from "../typed/isString.js";
+import { IS_WITHIN_ERROR_MSG as r, isWithin as i } from "../typed/isWithin.js";
+import { seek as a } from "../object/seek.js";
+//#region src/array/search.ts
+function o(o, s, c = .25) {
+	if (e(n(s), t, {
+		args: { query: s },
+		type: TypeError
+	}), e(i(c, 0, 1), r, {
+		args: {
+			max: 1,
+			min: 0,
+			tone: c
+		},
+		type: TypeError
+	}), !s) return [...o];
+	let l = s.toLowerCase();
+	return o.filter((e) => a(e, l, c));
 }
-export {
-  E as search
-};
-//# sourceMappingURL=search.js.map
+//#endregion
+export { o as search };
+
+//# sourceMappingURL=search.js.map

package/dist/array/search.js.map

@@ -1 +1 @@
-{"version":3,"file":"search.js","sources":["../../src/array/search.ts"],"sourcesContent":["import { assert } from '../function/assert';\nimport { seek } from '../object/seek';\nimport { IS_STRING_ERROR_MSG, isString } from '../typed/isString';\nimport { IS_WITHIN_ERROR_MSG, isWithin } from '../typed/isWithin';\nimport { filter } from './filter';\n\n/**\n * Performs a search on an array of objects, checking all values for a match with the search string.\n *\n * @example\n * ```ts\n * const data = [{ name: 'John Doe', age: 25 }, { name: 'Jane Doe', age: 30 }];\n * search(data, 'doe', 0.5); // [{ name: 'John Doe', age: 25 }, { name: 'Jane Doe', age: 30 }]\n * ```\n *\n * @param array - The array of objects to search.\n * @param query - The string to search for.\n * @param [tone=0.25] - Degree of similarity between 0 and 1.\n *\n * @returns The filtered array of objects that match the search string.\n *\n * @throws {Error} If input values are invalid.\n */\nexport function search<T>(array: T[], query: string, tone = 0.25): T[] {\n  assert(isString(query), IS_STRING_ERROR_MSG, { args: { query }, type: TypeError });\n  assert(isWithin(tone, 0, 1), IS_WITHIN_ERROR_MSG, { args: { max: 1, min: 0, tone }, type: TypeError });\n\n  if (!query) return [];\n\n  const searchTerm = query.toLowerCase();\n\n  return filter(array, (obj) => seek(obj, searchTerm, tone));\n}\n"],"names":["search","array","query","tone","assert","isString","IS_STRING_ERROR_MSG","isWithin","IS_WITHIN_ERROR_MSG","searchTerm","filter","obj","seek"],"mappings":";;;;;AAuBO,SAASA,EAAUC,GAAYC,GAAeC,IAAO,MAAW;AAIrE,MAHAC,EAAOC,EAASH,CAAK,GAAGI,GAAqB,EAAE,MAAM,EAAE,OAAAJ,EAAA,GAAS,MAAM,WAAW,GACjFE,EAAOG,EAASJ,GAAM,GAAG,CAAC,GAAGK,GAAqB,EAAE,MAAM,EAAE,KAAK,GAAG,KAAK,GAAG,MAAAL,KAAQ,MAAM,WAAW,GAEjG,CAACD,EAAO,QAAO,CAAA;AAEnB,QAAMO,IAAaP,EAAM,YAAA;AAEzB,SAAOQ,EAAOT,GAAO,CAACU,MAAQC,EAAKD,GAAKF,GAAYN,CAAI,CAAC;AAC3D;"}
+{"version":3,"file":"search.js","names":[],"sources":["../../src/array/search.ts"],"sourcesContent":["import { assert } from '../function/assert';\nimport { seek } from '../object/seek';\nimport { IS_STRING_ERROR_MSG, isString } from '../typed/isString';\nimport { IS_WITHIN_ERROR_MSG, isWithin } from '../typed/isWithin';\n\n/**\n * Performs a search on an array of objects, checking all values for a match with the search string.\n *\n * @example\n * ```ts\n * const data = [{ name: 'John Doe', age: 25 }, { name: 'Jane Doe', age: 30 }];\n * search(data, 'doe', 0.5); // [{ name: 'John Doe', age: 25 }, { name: 'Jane Doe', age: 30 }]\n * ```\n *\n * @param array - The array of objects to search.\n * @param query - The string to search for.\n * @param [tone=0.25] - Degree of similarity between 0 and 1.\n *\n * @returns The filtered array of objects that match the search string.\n *\n * @throws {Error} If input values are invalid.\n */\nexport function search<T>(array: T[], query: string, tone = 0.25): T[] {\n  assert(isString(query), IS_STRING_ERROR_MSG, { args: { query }, type: TypeError });\n  assert(isWithin(tone, 0, 1), IS_WITHIN_ERROR_MSG, { args: { max: 1, min: 0, tone }, type: TypeError });\n\n  if (!query) return [...array];\n\n  const searchTerm = query.toLowerCase();\n\n  return array.filter((obj) => seek(obj as object, searchTerm, tone));\n}\n"],"mappings":";;;;;AAsBA,SAAgB,EAAU,GAAY,GAAe,IAAO,KAAW;AAIrE,KAHA,EAAO,EAAS,EAAM,EAAE,GAAqB;EAAE,MAAM,EAAE,UAAO;EAAE,MAAM;EAAW,CAAC,EAClF,EAAO,EAAS,GAAM,GAAG,EAAE,EAAE,GAAqB;EAAE,MAAM;GAAE,KAAK;GAAG,KAAK;GAAG;GAAM;EAAE,MAAM;EAAW,CAAC,EAElG,CAAC,EAAO,QAAO,CAAC,GAAG,EAAM;CAE7B,IAAM,IAAa,EAAM,aAAa;AAEtC,QAAO,EAAM,QAAQ,MAAQ,EAAK,GAAe,GAAY,EAAK,CAAC"}

package/dist/array/select.cjs

@@ -1,2 +1,2 @@
-"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const l=require("../function/assert.cjs"),r=require("../typed/isArray.cjs"),c=require("../typed/isNil.cjs"),f=require("../typed/isPromise.cjs");function o(s,t,n){l.assert(r.isArray(s),r.IS_ARRAY_ERROR_MSG,{args:{array:s},type:TypeError});const i=[],u=n??(e=>!c.isNil(e));for(let e=0;e<s.length;e++)u(s[e],e,s)&&i.push(t(s[e],e,s));return f.isPromise(t)?Promise.all(i):i}o.fp=!0;exports.select=o;
-//# sourceMappingURL=select.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)),s=[];for(let e=0;e<r.length;e++)o(r[e],e,r)&&s.push(i(r[e],e,r));return s}exports.select=r;
+//# sourceMappingURL=select.cjs.map

package/dist/array/select.cjs.map

@@ -1 +1 @@
-{"version":3,"file":"select.cjs","sources":["../../src/array/select.ts"],"sourcesContent":["import { assert } from '../function/assert';\nimport { IS_ARRAY_ERROR_MSG, isArray } from '../typed/isArray';\nimport { isNil } from '../typed/isNil';\nimport { isPromise } from '../typed/isPromise';\nimport type { CallbackDynamic, Predicate, ResultArray } from '../types';\n\n/**\n * Selects elements from an array based on a callback function and an optional predicate function.\n *\n * @example\n * ```ts\n * const arr = [1, 2, 3, 4];\n * select(arr, x => x * x, x => x > 2) // [9, 16]\n * await select(arr, async x => x * x, x => x > 2) // [9, 16]\n * ```\n *\n * @param array - The array to select from.\n * @param callback - The function to map the values.\n * @param [predicate] - (optional) The function to filter the values.\n *\n * @returns A new array with the selected values.\n *\n * @throws {TypeError} If the provided array is not an array.\n */\nexport function select<T, R, C extends CallbackDynamic<T, R>>(\n  array: T[],\n  callback: C,\n  predicate?: Predicate<T>,\n): ResultArray<C> {\n  assert(isArray(array), IS_ARRAY_ERROR_MSG, { args: { array }, type: TypeError });\n\n  const result = [];\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      result.push(callback(array[index], index, array));\n    }\n  }\n\n  return (isPromise(callback) ? Promise.all(result) : result) as ResultArray<C>;\n}\n\nselect.fp = true;\n"],"names":["select","array","callback","predicate","assert","isArray","IS_ARRAY_ERROR_MSG","result","isValid","value","isNil","index","isPromise"],"mappings":"gOAwBO,SAASA,EACdC,EACAC,EACAC,EACgB,CAChBC,EAAAA,OAAOC,EAAAA,QAAQJ,CAAK,EAAGK,qBAAoB,CAAE,KAAM,CAAE,MAAAL,CAAA,EAAS,KAAM,UAAW,EAE/E,MAAMM,EAAS,CAAA,EAETC,EAAUL,IAAeM,GAAa,CAACC,EAAAA,MAAMD,CAAK,GAExD,QAASE,EAAQ,EAAGA,EAAQV,EAAM,OAAQU,IACpCH,EAAQP,EAAMU,CAAK,EAAGA,EAAOV,CAAK,GACpCM,EAAO,KAAKL,EAASD,EAAMU,CAAK,EAAGA,EAAOV,CAAK,CAAC,EAIpD,OAAQW,EAAAA,UAAUV,CAAQ,EAAI,QAAQ,IAAIK,CAAM,EAAIA,CACtD,CAEAP,EAAO,GAAK"}
+{"version":3,"file":"select.cjs","names":[],"sources":["../../src/array/select.ts"],"sourcesContent":["import type { Predicate } from '../types';\n\nimport { assert } from '../function/assert';\nimport { IS_ARRAY_ERROR_MSG, isArray } from '../typed/isArray';\nimport { isNil } from '../typed/isNil';\n\n/**\n * Selects elements from an array based on a callback function and an optional predicate function.\n *\n * @example\n * ```ts\n * const arr = [1, 2, 3, 4];\n * select(arr, x => x * x, x => x > 2) // [9, 16]\n * select(arr, x => x * x) // [1, 4, 9, 16]\n * ```\n *\n * @param array - The array to select from.\n * @param callback - The function to map the values.\n * @param [predicate] - (optional) The function to filter the values.\n *\n * @returns A new array with the selected values.\n *\n * @throws {TypeError} If the provided array is not an array.\n */\nexport function select<T, R>(\n  array: T[],\n  callback: (item: T, index: number, array: T[]) => R,\n  predicate?: Predicate<T>,\n): R[] {\n  assert(isArray(array), IS_ARRAY_ERROR_MSG, { args: { array }, type: TypeError });\n\n  const isValid = predicate ?? ((value: T) => !isNil(value));\n  const result: R[] = [];\n\n  for (let index = 0; index < array.length; index++) {\n    if (isValid(array[index], index, array)) {\n      result.push(callback(array[index], index, array));\n    }\n  }\n\n  return result;\n}\n"],"mappings":"4GAwBA,SAAgB,EACd,EACA,EACA,EACK,CACL,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,EACnD,EAAc,EAAE,CAEtB,IAAK,IAAI,EAAQ,EAAG,EAAQ,EAAM,OAAQ,IACpC,EAAQ,EAAM,GAAQ,EAAO,EAAM,EACrC,EAAO,KAAK,EAAS,EAAM,GAAQ,EAAO,EAAM,CAAC,CAIrD,OAAO"}

package/dist/array/select.d.ts

@@ -0,0 +1,21 @@
+import type { Predicate } from '../types';
+/**
+ * Selects elements from an array based on a callback function and an optional predicate function.
+ *
+ * @example
+ * ```ts
+ * const arr = [1, 2, 3, 4];
+ * select(arr, x => x * x, x => x > 2) // [9, 16]
+ * select(arr, x => x * x) // [1, 4, 9, 16]
+ * ```
+ *
+ * @param array - The array to select from.
+ * @param callback - The function to map the values.
+ * @param [predicate] - (optional) The function to filter the values.
+ *
+ * @returns A new array with the selected values.
+ *
+ * @throws {TypeError} If the provided array is not an array.
+ */
+export declare function select<T, R>(array: T[], callback: (item: T, index: number, array: T[]) => R, predicate?: Predicate<T>): R[];
+//# sourceMappingURL=select.d.ts.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"select.d.ts","sourceRoot":"","sources":["../../src/array/select.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,SAAS,EAAE,MAAM,UAAU,CAAC;AAM1C;;;;;;;;;;;;;;;;;GAiBG;AACH,wBAAgB,MAAM,CAAC,CAAC,EAAE,CAAC,EACzB,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,SAAS,CAAC,CAAC,CAAC,GACvB,CAAC,EAAE,CAaL"}

package/dist/array/select.js

@@ -1,16 +1,17 @@
-import { assert as m } from "../function/assert.js";
-import { IS_ARRAY_ERROR_MSG as p, isArray as f } from "../typed/isArray.js";
-import { isNil as n } from "../typed/isNil.js";
-import { isPromise as l } from "../typed/isPromise.js";
-function u(t, e, s) {
-  m(f(t), p, { args: { array: t }, type: TypeError });
-  const i = [], r = s ?? ((o) => !n(o));
-  for (let o = 0; o < t.length; o++)
-    r(t[o], o, t) && i.push(e(t[o], o, t));
-  return l(e) ? Promise.all(i) : i;
+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/select.ts
+function i(i, a, o) {
+	e(n(i), t, {
+		args: { array: i },
+		type: TypeError
+	});
+	let s = o ?? ((e) => !r(e)), c = [];
+	for (let e = 0; e < i.length; e++) s(i[e], e, i) && c.push(a(i[e], e, i));
+	return c;
 }
-u.fp = !0;
-export {
-  u as select
-};
-//# sourceMappingURL=select.js.map
+//#endregion
+export { i as select };
+
+//# sourceMappingURL=select.js.map