@svgrid/grid 3.0.8 → 3.0.9

package/src/windowed-row-model.ts

@@ -0,0 +1,113 @@
+/**
+ * The row model for windowed data (see windowed-data.ts).
+ *
+ * No build loop and no pipeline stages: `rows` is itself windowed. A row
+ * object is made the first time an index is read and kept (up to
+ * WINDOWED_ROW_CAP) while its data object is the same one, so scrolling back
+ * does not rebuild what is still loaded, and scrolling a 100M-row source end
+ * to end keeps a few thousand rows, not 100M.
+ *
+ * Installed into the core by the first createWindowedData() call rather than
+ * imported by core.ts, so a grid that is never handed windowed data does not
+ * bundle any of this.
+ */
+import {
+  BASE_ROW_METHODS,
+  ROW_CELLS,
+  ROW_CTX,
+  ROW_FILTER_GEN,
+  ROW_FILTER_POS,
+  ROW_SORT_DROPPED,
+  ROW_SORT_KEY,
+  ROW_VALUES,
+  registerWindowedRowModel,
+  type BaseRowCtx,
+  type BaseRowState,
+  type Column,
+  type Row,
+  type RowData,
+  type RowModel,
+} from './core'
+import { makeWindowedArray, windowedSourceOf } from './windowed-brand'
+
+/** The windowed-data version a row's memoised values belong to. */
+const ROW_WINDOW_GEN = Symbol('svgrid.row.windowGen')
+const WINDOWED_ROW_CAP = 20_000
+
+let installed = false
+
+export function enableWindowedRowModel(): void {
+  if (installed) return
+  installed = true
+  registerWindowedRowModel(<TData extends RowData>(ctx: {
+    rowCtxFor: (columns: Array<Column<TData>>) => BaseRowCtx<TData>
+    getRowId: () => ((row: TData, index: number) => string) | undefined
+  }) => {
+    // Per grid: the model for the current input, and the row objects built
+    // so far, by index.
+    let current: { input: unknown; columns: Array<Column<TData>>; model: RowModel<TData> } | null = null
+    const rows = new Map<number, BaseRowState<TData>>()
+    let generation = 0
+
+    return (data: unknown, columns: Array<Column<TData>>): RowModel<TData> | null => {
+      const source = windowedSourceOf<TData>(data)
+      if (!source) return null
+      if (current && current.input === data && current.columns === columns) return current.model
+      if (!current || current.columns !== columns) rows.clear()
+      const rowCtx = ctx.rowCtxFor(columns)
+      const getRowId = ctx.getRowId()
+      const gen = ++generation
+      const m = BASE_ROW_METHODS as unknown as BaseRowState<TData>
+      const rowAt = (index: number): Row<TData> | undefined => {
+        if (index < 0 || index >= source.length) return undefined
+        const original = source.at(index)
+        if (original === undefined) return undefined
+        const kept = rows.get(index) as (BaseRowState<TData> & { [ROW_WINDOW_GEN]?: number }) | undefined
+        if (kept && kept.original === original) {
+          // A new data version may follow an in-place edit of the object, as
+          // in the dense path: drop the memoised values once per version.
+          if (kept[ROW_WINDOW_GEN] !== gen) {
+            kept[ROW_VALUES] = null
+            kept[ROW_CELLS] = null
+            kept[ROW_WINDOW_GEN] = gen
+          }
+          return kept
+        }
+        const row = {
+          id: getRowId ? getRowId(original, index) : String(index),
+          index,
+          original,
+          depth: 0,
+          [ROW_CTX]: rowCtx,
+          [ROW_VALUES]: null,
+          [ROW_CELLS]: null,
+          [ROW_FILTER_GEN]: 0,
+          [ROW_FILTER_POS]: -1,
+          [ROW_SORT_DROPPED]: 0,
+          [ROW_SORT_KEY]: undefined,
+          [ROW_WINDOW_GEN]: gen,
+          getCanExpand: m.getCanExpand,
+          getIsExpanded: m.getIsExpanded,
+          toggleExpanded: m.toggleExpanded,
+          getIsSelected: m.getIsSelected,
+          toggleSelected: m.toggleSelected,
+          getAllCells: m.getAllCells,
+          getCellValueByColumnId: m.getCellValueByColumnId,
+        } as unknown as BaseRowState<TData>
+        rows.set(index, row)
+        if (rows.size > WINDOWED_ROW_CAP) {
+          // Oldest first (Map keeps insertion order); a quarter at a time.
+          let drop = WINDOWED_ROW_CAP / 4
+          for (const key of rows.keys()) {
+            if (drop-- <= 0) break
+            rows.delete(key)
+          }
+        }
+        return row
+      }
+      const model: RowModel<TData> = { rows: makeWindowedArray(source.length, rowAt) as Array<Row<TData>> }
+      current = { input: data, columns, model }
+      return model
+    }
+  })
+}

package/dist/cdn/server-block-cache-DIqb3VZn.js

@@ -1,241 +0,0 @@
-//#region src/server-block-cache.ts
-var e = Symbol.for("svgrid.rowPlaceholder"), t = Object.freeze({ [e]: "loading" }), n = Object.freeze({ [e]: "failed" });
-function r(t) {
-	if (typeof t != "object" || !t) return null;
-	let n = t[e];
-	return n === "loading" || n === "failed" ? n : null;
-}
-function i(t, n) {
-	return Object.freeze({
-		...n,
-		[e]: t
-	});
-}
-var a = (e) => {
-	Promise.resolve().then(e);
-};
-function o(e) {
-	let r = Math.max(1, e.blockSize ?? 100), i = e.maxBlocksInCache ?? Infinity, o = Math.max(1, e.maxConcurrentRequests ?? 2), s = Math.max(0, e.blockLoadDebounceMs ?? 0), c = Math.max(0, e.initialRowCount ?? 1), l = Math.max(0, e.overflowRows ?? 1), u = e.schedule ?? a, d = /* @__PURE__ */ new Map(), f = [], p = 0, m = 0, h = null, g = !1, _ = !1, v = 0, y = 0, b = null, x = !1, S = null, C = (e) => Math.floor(e / r), w = (e) => e * r;
-	function T() {
-		if (g && h != null) return h;
-		let e = 0, t = !1;
-		for (let e of d.values()) e.status !== "loading" && (t = !0);
-		for (let [n, i] of d) {
-			let a = i.status === "loaded" ? w(n) + i.rows.length : i.status === "failed" ? n === 0 ? 0 : w(n) + r : t ? w(n) + r : 0;
-			a > e && (e = a);
-		}
-		return t ? Math.max(c, e + l) : c;
-	}
-	function E() {
-		let e = [];
-		for (let [t, n] of d) n.status === "failed" && e.push(t);
-		return {
-			rowCount: g ? h : null,
-			lastRowKnown: g,
-			loading: p > 0,
-			failedBlocks: e.sort((e, t) => e - t)
-		};
-	}
-	function D() {
-		S = null, !(_ || x) && (x = !0, u(() => {
-			x = !1, !_ && e.onChange(E());
-		}));
-	}
-	function O(e) {
-		_ || d.get(e) || f.includes(e) || (f.push(e), k());
-	}
-	function k() {
-		for (; !_ && p < o && f.length > 0;) {
-			let e = f.shift();
-			d.has(e) || A(e);
-		}
-	}
-	async function A(t) {
-		let n = new AbortController(), i = {
-			status: "loading",
-			rows: [],
-			lastTouched: m += 1,
-			controller: n
-		};
-		d.set(t, i), p += 1, D();
-		let a = w(t), o = a + r;
-		try {
-			let r = await e.fetch(a, o, n.signal);
-			if (_ || n.signal.aborted || d.get(t) !== i) return;
-			i.rows = [...r.rows], i.status = "loaded", i.controller = null, j(t, i.rows.length, r.rowCount), M();
-		} catch {
-			if (_ || n.signal.aborted || d.get(t) !== i) return;
-			i.status = "failed", i.rows = [], i.controller = null;
-		} finally {
-			!_ && !n.signal.aborted && (--p, D(), k());
-		}
-	}
-	function j(e, t, n) {
-		if (typeof n == "number" && n >= 0) {
-			h = n, g = !0;
-			return;
-		}
-		t < r && (h = w(e) + t, g = !0);
-	}
-	function M() {
-		if (!Number.isFinite(i)) return;
-		let e = C(v), t = C(Math.max(v, y)), n = [...d.entries()].filter(([n, r]) => r.status === "loaded" && (n < e || n > t)).sort((e, t) => e[1].lastTouched - t[1].lastTouched), r = 0;
-		for (let e of d.values()) e.status === "loaded" && (r += 1);
-		for (let [e] of n) {
-			if (r <= i) break;
-			d.delete(e), --r;
-		}
-	}
-	function N() {
-		if (_) return;
-		let e = C(v), t = C(Math.max(v, y));
-		for (let n = e; n <= t; n += 1) {
-			let e = d.get(n);
-			e ? e.lastTouched = m += 1 : O(n);
-		}
-	}
-	function P() {
-		for (let e of d.values()) e.controller?.abort();
-		p = 0, f.length = 0;
-	}
-	return {
-		setViewport(e, t) {
-			if (!_) {
-				if (v = Math.max(0, e), y = Math.max(v, t), s === 0) {
-					N();
-					return;
-				}
-				b && clearTimeout(b), b = setTimeout(() => {
-					b = null, N();
-				}, s);
-			}
-		},
-		rows() {
-			if (S) return S;
-			let e = T(), i = Array(e);
-			i.fill(t);
-			for (let [t, a] of d) {
-				let o = w(t);
-				if (!(o >= e)) {
-					if (a.status === "failed") {
-						let t = Math.min(o + r, e);
-						for (let e = o; e < t; e += 1) i[e] = n;
-						continue;
-					}
-					for (let t = 0; t < a.rows.length && o + t < e; t += 1) i[o + t] = a.rows[t];
-				}
-			}
-			return S = i, i;
-		},
-		getRow(e) {
-			let r = d.get(C(e));
-			return r ? r.status === "failed" ? n : r.rows[e - w(C(e))] ?? t : t;
-		},
-		rowCount: () => g ? h : null,
-		lastRowKnown: () => g,
-		retryFailed() {
-			let e = !1;
-			for (let [t, n] of [...d]) n.status === "failed" && (d.delete(t), O(t), e = !0);
-			e && D();
-		},
-		retryFailedAt(e) {
-			let t = C(Math.max(0, e));
-			d.get(t)?.status === "failed" && (d.delete(t), O(t), D());
-		},
-		refresh() {
-			for (let [e, t] of [...d]) t.controller?.abort(), d.delete(e), O(e);
-			D();
-		},
-		purge() {
-			P(), d.clear(), h = null, g = !1, S = null, N(), D();
-		},
-		setRowCount(e, t = e != null) {
-			h = e, g = t && e != null, D();
-		},
-		applyRows(e, t, n) {
-			if (e % r !== 0) throw Error(`createBlockCache.applyRows: startRow ${e} is not a multiple of blockSize ${r}`);
-			let i = C(e), a = Math.ceil(t.length / r);
-			for (let e = 0; e < a; e += 1) {
-				let n = i + e;
-				d.get(n)?.controller?.abort(), d.set(n, {
-					status: "loaded",
-					rows: t.slice(e * r, (e + 1) * r),
-					lastTouched: m += 1,
-					controller: null
-				});
-			}
-			let o = d.get(i + a - 1);
-			o ? j(i + a - 1, o.rows.length, n) : typeof n == "number" && n >= 0 && (h = n, g = !0), D();
-		},
-		patch(e, t) {
-			let n = d.get(C(e));
-			if (!n || n.status !== "loaded") return !1;
-			let r = e - w(C(e));
-			return r < 0 || r >= n.rows.length ? !1 : (n.rows[r] = t, D(), !0);
-		},
-		findIndex(e) {
-			for (let [t, n] of d) {
-				if (n.status !== "loaded") continue;
-				let r = w(t);
-				for (let t = 0; t < n.rows.length; t += 1) if (e(n.rows[t], r + t)) return r + t;
-			}
-			return -1;
-		},
-		insert(e, t) {
-			if (t.length === 0) return !1;
-			let n = Math.max(0, Math.min(e, T())), r = F(n);
-			return r ? (r.flat.splice(n - w(r.startBlock), 0, ...t), I(r.startBlock, r.flat)) : L(C(n)), g && h != null && (h += t.length), D(), r != null;
-		},
-		remove(e, t = 1) {
-			if (t <= 0) return 0;
-			let n = F(e);
-			if (!n) return 0;
-			let r = n.flat.splice(e - w(n.startBlock), t).length;
-			return I(n.startBlock, n.flat), g && h != null && (h = Math.max(0, h - r)), D(), r;
-		},
-		getCacheState() {
-			return [...d.entries()].map(([e, t]) => ({
-				blockIndex: e,
-				startRow: w(e),
-				endRow: w(e) + r,
-				status: t.status,
-				lastTouched: t.lastTouched
-			})).sort((e, t) => e.blockIndex - t.blockIndex);
-		},
-		dispose() {
-			_ = !0, b && clearTimeout(b), b = null, P(), d.clear();
-		}
-	};
-	function F(e) {
-		let t = C(e);
-		if (d.get(t)?.status !== "loaded") return null;
-		let n = t;
-		for (; d.get(n - 1)?.status === "loaded";) --n;
-		let i = [];
-		for (let e = n;; e += 1) {
-			let t = d.get(e);
-			if (!t || t.status !== "loaded" || (i.push(...t.rows), t.rows.length < r)) break;
-		}
-		return {
-			startBlock: n,
-			flat: i
-		};
-	}
-	function I(e, t) {
-		let n = Math.ceil(t.length / r);
-		L(e);
-		for (let i = 0; i < n; i += 1) d.set(e + i, {
-			status: "loaded",
-			rows: t.slice(i * r, (i + 1) * r),
-			lastTouched: m += 1,
-			controller: null
-		});
-		S = null;
-	}
-	function L(e) {
-		for (let [t, n] of [...d]) t < e || (n.controller?.abort(), d.delete(t));
-		S = null;
-	}
-}
-//#endregion
-export { i as n, r, o as t };