@vueye-table/core 3.0.0-alpha.2 → 3.0.0-alpha.4

package/dist/index.js

@@ -893,6 +893,13 @@ function createRow(original, key, index, columns, canExpand = false) {
 		original,
 		canExpand,
 		isExpanded: false,
+		depth: 0,
+		parentKey: void 0,
+		childCount: 0,
+		childStatus: "loaded",
+		selection: "none",
+		isDirty: false,
+		cellIssues: void 0,
 		getValue,
 		getDisplay(columnId) {
 			const cached = displays.get(columnId);
@@ -961,6 +968,576 @@ function freezeState(state, previous) {
 	});
 }
 
+//#endregion
+//#region src/validation.ts
+function isPromise(value) {
+	return typeof value === "object" && value !== null && "then" in value;
+}
+/** Validators receive values; their messages remain plain text. */
+function runValidation(validate, rowKey, column) {
+	const fail = (message, validationCode) => issue("validation_failed", message, {
+		rowKey,
+		column,
+		validationCode
+	});
+	const read = (result) => {
+		if (result === true) return void 0;
+		if (typeof result === "string") return fail(result);
+		if (result && typeof result.message === "string") return fail(result.message, result.code);
+		return fail("The validator returned an invalid result.");
+	};
+	const thrown = (error) => fail(error instanceof Error ? error.message : String(error));
+	try {
+		const result = validate();
+		return isPromise(result) ? Promise.resolve(result).then(read, thrown) : read(result);
+	} catch (error) {
+		return thrown(error);
+	}
+}
+function editorFailure(spec, value) {
+	if (!spec) return void 0;
+	if (spec.maxLength !== void 0 && (!Number.isSafeInteger(spec.maxLength) || spec.maxLength < 0)) return "Editor maxLength must be a non-negative safe integer.";
+	if (spec.min !== void 0 && !Number.isFinite(spec.min) || spec.max !== void 0 && !Number.isFinite(spec.max) || spec.min !== void 0 && spec.max !== void 0 && spec.min > spec.max) return "Editor bounds must be finite and ordered.";
+	if (spec.options && !spec.options.some((option) => Object.is(option, value))) return "Choose one of the allowed values.";
+	if (spec.maxLength !== void 0 && typeof value === "string" && value.length > spec.maxLength) return `Use at most ${spec.maxLength} characters.`;
+	if (spec.min !== void 0 || spec.max !== void 0) {
+		const number = value instanceof Date ? value.getTime() : value;
+		if (typeof number !== "number" || !Number.isFinite(number)) return "Enter a finite numeric value.";
+		if (spec.min !== void 0 && number < spec.min) return `Use a value of at least ${spec.min}.`;
+		if (spec.max !== void 0 && number > spec.max) return `Use a value of at most ${spec.max}.`;
+	}
+	if (spec.pattern !== void 0) try {
+		if (typeof value !== "string" || !new RegExp(spec.pattern, "u").test(value)) return "The value does not match the required pattern.";
+	} catch {
+		return "The editor pattern is invalid.";
+	}
+}
+
+//#endregion
+//#region src/edit-validation.ts
+function readonlyMap(source) {
+	const copy = new Map(source);
+	const result = {
+		size: copy.size,
+		get: (key) => copy.get(key),
+		has: (key) => copy.has(key),
+		entries: () => copy.entries(),
+		keys: () => copy.keys(),
+		values: () => copy.values(),
+		[Symbol.iterator]: () => copy[Symbol.iterator](),
+		forEach(callback, thisArg) {
+			copy.forEach((value, key) => callback.call(thisArg, value, key, result));
+		}
+	};
+	return Object.freeze(result);
+}
+/** All promises in one edit settle together. Tokens fence every cell against stale results. */
+function createEditValidation(host) {
+	const tokens = /* @__PURE__ */ new Map();
+	const pending = /* @__PURE__ */ new Map();
+	const problems = /* @__PURE__ */ new Map();
+	const current = (candidate) => tokens.get(candidate.edit.rowKey)?.get(candidate.edit.column) === candidate.token;
+	const tokenFor = (rowKey, column) => {
+		const row = tokens.get(rowKey) ?? /* @__PURE__ */ new Map();
+		const token = {};
+		row.set(column, token);
+		tokens.set(rowKey, row);
+		pending.get(rowKey)?.delete(column);
+		problems.get(rowKey)?.delete(column);
+		return token;
+	};
+	const setIssues = (issues) => {
+		for (const problem of issues) {
+			if (problem.rowKey === void 0 || problem.column === void 0) continue;
+			const row = problems.get(problem.rowKey) ?? /* @__PURE__ */ new Map();
+			row.set(problem.column, problem);
+			problems.set(problem.rowKey, row);
+		}
+	};
+	function rowValidation(candidates, failures) {
+		if (!host.validateRow) return [...candidates];
+		const rows = /* @__PURE__ */ new Map();
+		for (const candidate of candidates) {
+			const group = rows.get(candidate.edit.rowKey) ?? [];
+			group.push(candidate);
+			rows.set(candidate.edit.rowKey, group);
+		}
+		const results = [];
+		for (const [key, group] of rows) {
+			const previous = group[0].original;
+			let next = previous;
+			try {
+				for (const candidate of group) next = candidate.column.setValue(next, candidate.edit.value) ?? next;
+			} catch (error) {
+				for (const candidate of group) failures.push(issue("validation_failed", String(error), {
+					rowKey: key,
+					column: candidate.edit.column
+				}));
+				continue;
+			}
+			const validation = runValidation(() => host.validateRow(next, previous), key);
+			const accept = (problem) => {
+				if (!problem) return group;
+				for (const candidate of group) if (current(candidate)) failures.push(Object.freeze({
+					...problem,
+					column: candidate.edit.column
+				}));
+				return [];
+			};
+			results.push(isPromise(validation) ? validation.then(accept) : accept(validation));
+		}
+		return results.some(isPromise) ? Promise.all(results.map((result) => Promise.resolve(result))).then((groups) => groups.flat()) : results.flat();
+	}
+	function settle(accepted, all, failures, asynchronous) {
+		return host.batch(() => {
+			const live = accepted.filter(current);
+			const liveKeys = new Set(live);
+			const active = all.filter(current);
+			for (const candidate of active) {
+				const key = candidate.edit.rowKey;
+				pending.get(key)?.delete(candidate.edit.column);
+				if (pending.get(key)?.size === 0) pending.delete(key);
+			}
+			const visibleFailures = failures;
+			setIssues(visibleFailures);
+			let result;
+			if (asynchronous && host.optimistic) {
+				const rollback = active.filter((candidate) => !liveKeys.has(candidate)).map((candidate) => ({
+					...candidate.edit,
+					value: candidate.previous
+				}));
+				result = host.apply(rollback, false, visibleFailures);
+				const changes = live.map((candidate) => Object.freeze({
+					rowKey: candidate.edit.rowKey,
+					column: candidate.edit.column,
+					previous: candidate.previous,
+					value: candidate.edit.value,
+					row: host.snapshot().getRow(candidate.edit.rowKey).original
+				}));
+				if (changes.length) host.record(changes);
+				result = Object.freeze({
+					...result,
+					changes: Object.freeze(changes),
+					status: changes.length ? visibleFailures.length ? "partial" : "applied" : visibleFailures.length ? "rejected" : "unchanged"
+				});
+			} else result = host.apply(live.map((candidate) => candidate.edit), true, visibleFailures);
+			setIssues(result.issues);
+			if (!result.changes.length && (all.length || result.issues.length) || asynchronous && host.optimistic) host.notify();
+			if (asynchronous && !result.issues.length && active.length) host.onIssues([]);
+			return result;
+		});
+	}
+	return {
+		cells: () => Object.freeze([...pending.values()].flatMap((row) => [...row.values()])),
+		problems: () => new Map([...problems].filter(([, row]) => row.size).map(([key, row]) => [key, readonlyMap(row)])),
+		cancel(keys) {
+			if (!keys) {
+				tokens.clear();
+				pending.clear();
+				problems.clear();
+			} else for (const key of keys) {
+				tokens.delete(key);
+				pending.delete(key);
+				problems.delete(key);
+			}
+		},
+		edit(edits, recovered = []) {
+			const metadataChanged = edits.some((edit) => pending.get(edit.rowKey)?.has(edit.column) || problems.get(edit.rowKey)?.has(edit.column) || host.validateRow && pending.get(edit.rowKey)?.size);
+			const snapshot = host.snapshot();
+			const failures = [...recovered];
+			const candidates = [];
+			const drafts = /* @__PURE__ */ new Map();
+			const samples = /* @__PURE__ */ new Map();
+			if (host.validateRow) for (const key of new Set(edits.map((edit) => edit.rowKey))) {
+				tokens.delete(key);
+				pending.delete(key);
+			}
+			for (const edit of edits) {
+				const token = tokenFor(edit.rowKey, edit.column);
+				const row = snapshot.getRow(edit.rowKey);
+				const column = snapshot.getColumn(edit.column);
+				const fail = (code, message) => {
+					failures.push(issue(code, message, {
+						rowKey: edit.rowKey,
+						column: edit.column
+					}));
+				};
+				if (!isSafePath(edit.column)) {
+					fail("unsafe_path", "This path addresses a prototype and cannot be written.");
+					continue;
+				}
+				if (!row) {
+					fail("unknown_row", `No row has the key "${String(edit.rowKey)}".`);
+					continue;
+				}
+				if (!column) {
+					fail("unknown_column", `No column has the id "${edit.column}".`);
+					continue;
+				}
+				const original = drafts.get(row.key) ?? row.original;
+				try {
+					if (!column.isEditable(original)) {
+						fail("read_only_cell", `The "${column.id}" cell is read-only.`);
+						continue;
+					}
+					let value;
+					if ("input" in edit) {
+						if (!samples.has(column.id)) samples.set(column.id, snapshot.processedRows.find((candidate) => candidate.getValue(column.id) !== null && candidate.getValue(column.id) !== void 0)?.getValue(column.id));
+						const parsed = column.parse(edit.input, original, samples.get(column.id));
+						if (!parsed.ok) {
+							fail("invalid_value", parsed.message);
+							continue;
+						}
+						value = parsed.value;
+					} else value = edit.value;
+					const previous = column.getValue(original);
+					if (Object.is(previous, value)) continue;
+					const constraint = editorFailure(column.definition.editor, value);
+					if (constraint) {
+						fail("validation_failed", constraint);
+						continue;
+					}
+					const next = column.setValue(original, value);
+					if (next === void 0) {
+						fail("read_only_cell", "The column has no way to write a value.");
+						continue;
+					}
+					const writeProblem = host.writeIssue(row, next);
+					if (writeProblem) {
+						failures.push(Object.freeze({
+							...writeProblem,
+							column: column.id
+						}));
+						continue;
+					}
+					const validate = column.definition.validate;
+					const validation = validate ? runValidation(() => validate(value, row.original), row.key, column.id) : void 0;
+					if (validation && !isPromise(validation)) {
+						failures.push(validation);
+						continue;
+					}
+					drafts.set(row.key, next);
+					candidates.push({
+						edit: {
+							rowKey: row.key,
+							column: column.id,
+							value
+						},
+						previous: column.getValue(row.original),
+						original: row.original,
+						column,
+						validation,
+						token
+					});
+				} catch (error) {
+					fail("invalid_value", error instanceof Error ? error.message : String(error));
+				}
+			}
+			const asynchronous = candidates.some((candidate) => isPromise(candidate.validation));
+			const validateRows = (accepted) => rowValidation(accepted.filter(current), failures);
+			const outcome = asynchronous ? Promise.all(candidates.map(async (candidate) => {
+				const problem = await candidate.validation;
+				if (problem) {
+					if (current(candidate)) failures.push(problem);
+					return;
+				}
+				return candidate;
+			})).then((accepted) => validateRows(accepted.filter((candidate) => candidate !== void 0))) : validateRows(candidates);
+			if (!isPromise(outcome)) {
+				const result = settle(outcome, candidates, failures, false);
+				if (metadataChanged && !candidates.length && !failures.length) host.notify();
+				return result;
+			}
+			for (const candidate of candidates) {
+				const row = pending.get(candidate.edit.rowKey) ?? /* @__PURE__ */ new Map();
+				row.set(candidate.edit.column, Object.freeze({ ...candidate.edit }));
+				pending.set(candidate.edit.rowKey, row);
+			}
+			setIssues(failures);
+			const optimistic = host.optimistic ? host.apply(candidates.map((candidate) => candidate.edit), false, failures) : void 0;
+			if (!optimistic?.changes.length) host.notify();
+			if (!host.optimistic && failures.length) host.onIssues(failures);
+			outcome.then((accepted) => {
+				if (candidates.some(current)) settle(accepted, candidates, failures, true);
+			});
+			return Object.freeze({
+				status: "pending",
+				changes: optimistic?.changes ?? Object.freeze([]),
+				rowChanges: Object.freeze([]),
+				issues: Object.freeze([...failures]),
+				pendingCells: Object.freeze(candidates.map((candidate) => Object.freeze({ ...candidate.edit })))
+			});
+		}
+	};
+}
+
+//#endregion
+//#region src/pending-changes.ts
+/** A saved baseline only for touched rows; viewing changes never scans source data. */
+function createPendingChanges() {
+	const entries = /* @__PURE__ */ new Map();
+	return {
+		entries,
+		snapshot() {
+			const inserted = [];
+			const removed = [];
+			const updated = [];
+			for (const [rowKey, entry] of entries) if (entry.previous === void 0 && entry.row !== void 0) inserted.push(Object.freeze({
+				kind: "inserted",
+				rowKey,
+				row: entry.row,
+				position: entry.position
+			}));
+			else if (entry.row === void 0 && entry.previous !== void 0) removed.push(Object.freeze({
+				kind: "removed",
+				rowKey,
+				row: entry.previous,
+				position: entry.position
+			}));
+			else if (entry.row !== void 0 && entry.previous !== void 0) updated.push(Object.freeze({
+				rowKey,
+				row: entry.row,
+				previous: entry.previous,
+				changes: Object.freeze([...entry.cells.values()])
+			}));
+			return Object.freeze({
+				inserted: Object.freeze(inserted),
+				updated: Object.freeze(updated),
+				removed: Object.freeze(removed)
+			});
+		},
+		record(key, previous, row, position, changes) {
+			const entry = entries.get(key) ?? {
+				previous,
+				row,
+				position: Object.freeze({ ...position }),
+				cells: /* @__PURE__ */ new Map()
+			};
+			entry.row = row;
+			for (const change of changes) {
+				const original = entry.cells.has(change.column) ? entry.cells.get(change.column).previous : change.previous;
+				if (Object.is(original, change.value)) entry.cells.delete(change.column);
+				else entry.cells.set(change.column, Object.freeze({
+					...change,
+					previous: original
+				}));
+			}
+			if (entry.previous === void 0 && row === void 0 || entry.previous !== void 0 && row !== void 0 && entry.cells.size === 0) entries.delete(key);
+			else entries.set(key, entry);
+		}
+	};
+}
+
+//#endregion
+//#region src/tree.ts
+function buildTree(data, columns, readKey, options, lazy) {
+	const nodes = [];
+	const byKey = /* @__PURE__ */ new Map();
+	const issues = [];
+	const nested = options.getChildren !== void 0;
+	let maxDepth = options.maxDepth ?? 1e3;
+	if (!Number.isSafeInteger(maxDepth) || maxDepth < 1) {
+		issues.push(issue("invalid_tree_option", "maxDepth must be a positive safe integer; 1,000 is used."));
+		maxDepth = 1e3;
+	}
+	if (nested && options.getParentKey) issues.push(issue("invalid_tree_option", "Both tree inputs were supplied; getChildren takes precedence."));
+	const seen = /* @__PURE__ */ new Set();
+	const stack = data.map((original, sourceIndex) => ({
+		original,
+		sourceIndex,
+		parent: void 0,
+		lazy: false
+	})).reverse();
+	while (stack.length) {
+		const entry = stack.pop();
+		const index = nodes.length;
+		let key = readKey(entry.original, index);
+		let parent = entry.parent;
+		const reference = entry.original !== null && (typeof entry.original === "object" || typeof entry.original === "function");
+		const repeated = nested && reference && seen.has(entry.original);
+		if (repeated) {
+			issues.push(issue("tree_cycle", "A repeated nested value recovers as a root without traversing it again.", { rowKey: key }));
+			parent = void 0;
+		}
+		if (reference) seen.add(entry.original);
+		if (byKey.has(key)) {
+			issues.push(issue(entry.lazy ? "tree_duplicate_key" : "duplicate_row_key", entry.lazy ? "A loaded child repeats an existing key and is rejected." : "A repeated row key is replaced with a unique key.", { rowKey: key }));
+			if (entry.lazy) continue;
+			const prefix = `${String(key)}#${index}`;
+			key = prefix;
+			let suffix = 0;
+			while (byKey.has(key)) key = `${prefix}#${++suffix}`;
+		}
+		if (parent && parent.depth + 1 > maxDepth) {
+			issues.push(issue("tree_depth_exceeded", "The maximum tree depth was exceeded; this row recovers as a root.", { rowKey: key }));
+			parent = void 0;
+		}
+		const children = repeated ? void 0 : lazy.get(key) ?? options.getChildren?.(entry.original);
+		const node = {
+			row: createRow(entry.original, key, index, columns),
+			parent,
+			children: [],
+			depth: parent ? parent.depth + 1 : 0,
+			sourceIndex: entry.sourceIndex,
+			lazy: entry.lazy,
+			writable: parent?.writable ?? entry.parent === void 0,
+			unloaded: children === void 0 && (options.hasChildren?.(entry.original) ?? false)
+		};
+		nodes.push(node);
+		byKey.set(key, node);
+		if (parent) parent.children.push(node);
+		if (children) for (let i = children.length - 1; i >= 0; i--) stack.push({
+			original: children[i],
+			sourceIndex: i,
+			parent: node,
+			lazy: entry.lazy || lazy.has(key)
+		});
+	}
+	if (!nested && options.getParentKey) {
+		for (const node of nodes) {
+			if (node.lazy) continue;
+			const key = options.getParentKey(node.row.original);
+			if (key === void 0 || key === null) continue;
+			const parent = byKey.get(key);
+			if (!parent) issues.push(issue("tree_orphan", "The parent is missing; this row recovers as a root.", { rowKey: node.row.key }));
+			else node.parent = parent;
+		}
+		const done = /* @__PURE__ */ new Set();
+		for (const node of nodes) {
+			const path = [];
+			const visiting = /* @__PURE__ */ new Set();
+			let cursor = node;
+			while (cursor && !done.has(cursor)) {
+				if (visiting.has(cursor)) {
+					issues.push(issue("tree_cycle", "A cyclic parent reference is detached to a root.", { rowKey: cursor.row.key }));
+					cursor.parent = void 0;
+					break;
+				}
+				visiting.add(cursor);
+				path.push(cursor);
+				cursor = cursor.parent;
+			}
+			for (let i = path.length - 1; i >= 0; i--) {
+				const current = path[i];
+				done.add(current);
+			}
+		}
+		for (const node of nodes) node.children = [];
+		for (const node of nodes) if (node.parent) node.parent.children.push(node);
+		const pending = nodes.filter((node) => !node.parent);
+		while (pending.length) {
+			const node = pending.pop();
+			node.depth = node.parent ? node.parent.depth + 1 : 0;
+			if (node.depth > maxDepth) {
+				node.parent = void 0;
+				node.depth = 0;
+				issues.push(issue("tree_depth_exceeded", "The maximum tree depth was exceeded; this row recovers as a root.", { rowKey: node.row.key }));
+			}
+			for (const child of node.children) pending.push(child);
+		}
+		for (const node of nodes) node.children = node.children.filter((child) => child.parent === node);
+	}
+	return {
+		nodes,
+		rows: nodes.map((node) => node.row),
+		roots: nodes.filter((node) => !node.parent),
+		byKey,
+		issues
+	};
+}
+function processTree(model, columns, state, mode, manual) {
+	const raw = model.nodes.map((node) => node.row);
+	const matched = manual ? raw : filterRows(raw, columns, state.search, state.filters);
+	const active = matched !== raw;
+	const included = new Set(matched.map((row) => row.key));
+	const autoExpanded = /* @__PURE__ */ new Set();
+	if (active && mode !== "strict") {
+		if (mode === "descendants") {
+			const stack = matched.map((row) => model.byKey.get(row.key));
+			const visited = /* @__PURE__ */ new Set();
+			while (stack.length) {
+				const node = stack.pop();
+				if (visited.has(node.row.key)) continue;
+				visited.add(node.row.key);
+				included.add(node.row.key);
+				if (node.children.length) autoExpanded.add(node.row.key);
+				for (const child of node.children) stack.push(child);
+			}
+		}
+		for (const row of matched) {
+			let parent = model.byKey.get(row.key).parent;
+			while (parent && !autoExpanded.has(parent.row.key)) {
+				included.add(parent.row.key);
+				autoExpanded.add(parent.row.key);
+				parent = parent.parent;
+			}
+		}
+	}
+	if (active && mode === "strict") return {
+		model,
+		roots: ordered(model.nodes.filter((node) => included.has(node.row.key) && node.children.length === 0 && !node.unloaded)),
+		children: /* @__PURE__ */ new Map(),
+		autoExpanded
+	};
+	const children = /* @__PURE__ */ new Map();
+	for (const node of model.nodes) if (node.children.length) children.set(node, ordered(node.children.filter((child) => included.has(child.row.key))));
+	return {
+		model,
+		roots: ordered(model.roots.filter((node) => included.has(node.row.key))),
+		children,
+		autoExpanded
+	};
+	function ordered(nodes) {
+		if (manual || !state.sorting.length || nodes.length < 2) return nodes;
+		return sortRows(nodes.map((node) => node.row), columns, state.sorting).map((row) => model.byKey.get(row.key));
+	}
+}
+/** Expansion changes reuse filtering and sibling order, splicing only a changed subtree. */
+function createTreeFlattener() {
+	let previous;
+	let previousExpanded = [];
+	let visible = [];
+	let previousAncestors;
+	return (tree, expanded, ancestors) => {
+		if (tree === previous && expanded === previousExpanded && ancestors === previousAncestors) return visible;
+		const keys = expanded === true ? void 0 : new Set(expanded);
+		const open = (node) => expanded === true || (keys?.has(node.row.key) ?? false) || ancestors.has(node.row.key) || tree.autoExpanded.has(node.row.key);
+		const walk = (roots) => {
+			const output = [];
+			const stack = [...roots].reverse();
+			while (stack.length) {
+				const node = stack.pop();
+				output.push(node);
+				if (open(node)) {
+					const children = tree.children.get(node) ?? [];
+					for (let i = children.length - 1; i >= 0; i--) stack.push(children[i]);
+				}
+			}
+			return output;
+		};
+		let changed;
+		if (previous === tree && ancestors === previousAncestors && expanded !== true && previousExpanded !== true) {
+			const before = new Set(previousExpanded);
+			const after = new Set(expanded);
+			changed = [...previousExpanded.filter((key) => !after.has(key)), ...expanded.filter((key) => !before.has(key))];
+		}
+		if (changed?.length === 1 && !tree.autoExpanded.has(changed[0])) {
+			const index = visible.findIndex((node) => node.row.key === changed[0]);
+			if (index >= 0) {
+				const node = visible[index];
+				let end = index + 1;
+				while (end < visible.length && visible[end].depth > node.depth) end++;
+				const inserted = walk(open(node) ? tree.children.get(node) ?? [] : []);
+				visible = visible.slice(0, index + 1).concat(inserted, visible.slice(end));
+			}
+		} else visible = walk(tree.roots);
+		previous = tree;
+		previousExpanded = expanded;
+		previousAncestors = ancestors;
+		return visible;
+	};
+}
+
 //#endregion
 //#region src/table.ts
 function isRecord(value) {
@@ -998,7 +1575,17 @@ function createTable(options) {
 	const selectionMode = options.selectionMode ?? "multiple";
 	const selectScope = options.selectScope ?? "all";
 	const manual = options.manual ?? false;
+	const treeEnabled = Boolean(options.getChildren || options.getParentKey || options.hasChildren || options.loadChildren);
+	const rootPagination = treeEnabled && (manual || (options.paginateBy ?? "root") === "root");
+	let lazyVersion = 0;
+	const lazyChildren = /* @__PURE__ */ new Map();
+	const childStatuses = /* @__PURE__ */ new Map();
+	const loadIssues = /* @__PURE__ */ new Map();
+	const loadValidationIssues = /* @__PURE__ */ new Map();
+	const pendingLoads = /* @__PURE__ */ new Map();
+	let destroyed = false;
 	const undoStack = createUndoStack(options.historyLimit);
+	const pendingChanges = createPendingChanges();
 	const listeners = /* @__PURE__ */ new Set();
 	const optionIssues = [];
 	const maxPasteCells = pasteLimit(options.pasteLimit?.maxCells, 1e5, "maxCells", optionIssues);
@@ -1015,6 +1602,36 @@ function createTable(options) {
 	});
 	let state = initialState;
 	let snapshot;
+	let transaction = false;
+	let deferValidationNotify = false;
+	let validationNotifyRequested = false;
+	const validation = createEditValidation({
+		snapshot: getSnapshot,
+		apply: applyChanges,
+		notify,
+		writeIssue(row, next) {
+			const node = treeEnabled ? treeStage(data, resolveColumns(definitions).byId, lazyVersion).byKey.get(row.key) : void 0;
+			if (node && (!node.writable || node.parent && options.getChildren && !options.setChildren)) return issue("read_only_cell", "This nested row has no immutable writable source path.", { rowKey: row.key });
+			if (readKey(next, row.index) !== readKey(row.original, row.index)) return issue("invalid_row_operation", "Editing a row key is not supported; remove and insert the row instead.", { rowKey: row.key });
+		},
+		batch(run) {
+			deferValidationNotify = true;
+			validationNotifyRequested = false;
+			try {
+				return run();
+			} finally {
+				deferValidationNotify = false;
+				if (validationNotifyRequested) notify();
+			}
+		},
+		record: (changes) => undoStack.record({
+			kind: "cells",
+			changes
+		}),
+		onIssues: (issues) => options.onEditIssues?.(issues),
+		optimistic: options.asyncValidation === "optimistic",
+		validateRow: options.validateRow
+	});
 	const readKey = (row, index) => {
 		const { rowKey } = options;
 		if (typeof rowKey === "function") return rowKey(row, index);
@@ -1055,6 +1672,77 @@ function createTable(options) {
 			issues
 		};
 	});
+	const treeStage = memo((rows, byId, _version) => buildTree(rows, byId, readKey, options, lazyChildren));
+	const treeIndex = memo((model) => ({
+		rows: model.rows,
+		byKey: new Map(model.rows.map((row) => [row.key, row])),
+		issues: model.issues
+	}));
+	const treePositions = memo((model) => {
+		const result = /* @__PURE__ */ new Map();
+		const index = (siblings, parent) => {
+			siblings.forEach((node, position) => result.set(node.row.key, Object.freeze({
+				parent,
+				before: siblings[position + 1]?.row.key
+			})));
+		};
+		index(model.roots);
+		for (const node of model.nodes) index(node.children, node.row.key);
+		return result;
+	});
+	const processedTreeStage = memo((model, columns, search, filters, sorting) => processTree(model, columns, {
+		...state,
+		search,
+		filters,
+		sorting
+	}, options.treeFilter ?? "ancestors", manual));
+	const flattenTree = createTreeFlattener();
+	const emptyAncestors = /* @__PURE__ */ new Set();
+	const singleTreePath = memo((model, expanded) => {
+		const ancestors = /* @__PURE__ */ new Set();
+		if (expanded !== true) for (const key of expanded) {
+			let parent = model.byKey.get(key)?.parent;
+			while (parent && !ancestors.has(parent.row.key)) {
+				ancestors.add(parent.row.key);
+				parent = parent.parent;
+			}
+		}
+		return ancestors;
+	});
+	const treeSelection = memo((model, selection) => {
+		const selected = new Set(selection);
+		const counts = /* @__PURE__ */ new Map();
+		const stack = model.roots.map((node) => ({
+			node,
+			exit: false
+		}));
+		while (stack.length) {
+			const { node, exit } = stack.pop();
+			if (!exit) {
+				stack.push({
+					node,
+					exit: true
+				});
+				for (const child of node.children) stack.push({
+					node: child,
+					exit: false
+				});
+			} else {
+				let count = selected.has(node.row.key) ? 1 : 0;
+				let total = 1;
+				for (const child of node.children) {
+					const value = counts.get(child);
+					count += value.selected;
+					total += value.total;
+				}
+				counts.set(node, {
+					selected: count,
+					total
+				});
+			}
+		}
+		return counts;
+	});
 	const orderColumns = memo((columns, columnOrder, hiddenColumns) => {
 		const position = new Map(columnOrder.map((id, index) => [id, index]));
 		const ordered = columns.map((column, index) => ({
@@ -1072,12 +1760,17 @@ function createTable(options) {
 	const filterStage = memo(filterRows);
 	const sortStage = memo(sortRows);
 	const selectedSet = memo((selection) => new Set(selection));
-	const expansionStage = memo((indexed, expanded) => {
+	const expansionStage = memo((indexed, expanded, selection) => {
 		const keys = expanded === true ? void 0 : new Set(expanded);
-		const rows = indexed.rows.map((row) => row.canExpand && (expanded === true || keys?.has(row.key)) ? Object.freeze({
-			...row,
-			isExpanded: true
-		}) : row);
+		const selected = new Set(selection);
+		const rows = indexed.rows.map((row) => {
+			const isExpanded = row.canExpand && (expanded === true || (keys?.has(row.key) ?? false));
+			return isExpanded || selected.has(row.key) ? Object.freeze({
+				...row,
+				isExpanded,
+				selection: selected.has(row.key) ? "all" : "none"
+			}) : row;
+		});
 		return {
 			rows,
 			byKey: new Map(rows.map((row) => [row.key, row]))
@@ -1099,15 +1792,29 @@ function createTable(options) {
 		return issues;
 	}
 	function computeSnapshot() {
+		const cellProblems = validation.problems();
+		const dirty = new Set(pendingChanges.entries.keys());
+		const metadata = (row) => dirty.has(row.key) || cellProblems.has(row.key) ? Object.freeze({
+			...row,
+			isDirty: dirty.has(row.key),
+			cellIssues: cellProblems.get(row.key)
+		}) : row;
 		const { columns, byId, issues: columnIssues } = resolveColumns(definitions);
-		const indexed = indexRows(data, byId);
-		const expanded = expansionStage(indexed, state.expanded);
+		const model = treeEnabled ? treeStage(data, byId, lazyVersion) : void 0;
+		const indexed = model ? {
+			rows: model.rows,
+			issues: model.issues
+		} : indexRows(data, byId);
+		const expanded = model ? void 0 : expansionStage(indexed, state.expanded, state.selection);
 		const ordered = orderColumns(columns, state.columnOrder, state.hiddenColumns);
 		const issues = [
 			...optionIssues,
 			...columnIssues,
 			...indexed.issues,
-			...stateIssues(byId)
+			...stateIssues(byId),
+			...loadIssues.values(),
+			...Array.from(loadValidationIssues.values()).flat(),
+			...Array.from(cellProblems.values()).flatMap((row) => [...row.values()])
 		];
 		const requestedSize = state.pagination.pageSize;
 		let pageSize = Number.isInteger(requestedSize) && requestedSize >= 1 ? requestedSize : 10;
@@ -1116,7 +1823,60 @@ function createTable(options) {
 		let filteredCount;
 		let page;
 		let pageCount;
-		if (manual) {
+		let treeRow;
+		let totalCount = indexed.rows.length;
+		if (model) {
+			const processed = processedTreeStage(model, columns, state.search, state.filters, state.sorting);
+			const ancestors = expandMode === "single" ? singleTreePath(model, state.expanded) : emptyAncestors;
+			const visible = flattenTree(processed, state.expanded, ancestors);
+			const expandedState = state.expanded;
+			const keys = state.expanded === true ? void 0 : new Set(state.expanded);
+			const selected = treeSelection(model, state.selection);
+			const projected = /* @__PURE__ */ new Map();
+			const statuses = new Map(childStatuses);
+			treeRow = (key) => {
+				const cached = projected.get(key);
+				if (cached) return cached;
+				const node = model.byKey.get(key);
+				if (!node) return void 0;
+				const status = statuses.get(key) ?? (node.children.length || !node.unloaded ? "loaded" : "idle");
+				const count = selected.get(node);
+				const canExpand = node.children.length > 0 || status !== "loaded" || (options.getRowCanExpand?.(node.row.original) ?? false);
+				const result = Object.freeze({
+					...node.row,
+					isDirty: dirty.has(key),
+					cellIssues: cellProblems.get(key),
+					depth: node.depth,
+					parentKey: node.parent?.row.key,
+					childCount: status === "loaded" ? node.children.length : void 0,
+					childStatus: status,
+					canExpand,
+					isExpanded: canExpand && (expandedState === true || (keys?.has(key) ?? false) || ancestors.has(key) || processed.autoExpanded.has(key)),
+					selection: coverage(count.selected, count.total)
+				});
+				projected.set(key, result);
+				return result;
+			};
+			processedRows = visible.map((node) => treeRow(node.row.key));
+			filteredCount = manual ? rowCount ?? model.roots.length : rootPagination ? processed.roots.length : visible.length;
+			totalCount = rootPagination ? model.roots.length : model.nodes.length;
+			pageCount = countPages(filteredCount, pageSize);
+			page = clampPage(state.pagination.page, pageCount);
+			if (manual) rows = processedRows;
+			else if (rootPagination) {
+				const roots = new Set(processed.roots.slice((page - 1) * pageSize, page * pageSize));
+				const allRoots = new Set(processed.roots);
+				let root;
+				rows = processedRows.filter((_row, index) => {
+					const node = visible[index];
+					if (allRoots.has(node)) root = node;
+					return root !== void 0 && roots.has(root);
+				});
+			} else rows = paginateRows(processedRows, {
+				page,
+				pageSize
+			});
+		} else if (manual) {
 			processedRows = expanded.rows;
 			rows = expanded.rows;
 			filteredCount = rowCount ?? indexed.rows.length;
@@ -1139,6 +1899,20 @@ function createTable(options) {
 			pageCount = 1;
 			pageSize = Math.max(1, rows.length);
 		}
+		const flatProjected = /* @__PURE__ */ new Map();
+		if (!model) {
+			const project = (row) => {
+				let result = flatProjected.get(row.key);
+				if (!result) {
+					result = metadata(row);
+					flatProjected.set(row.key, result);
+				}
+				return result;
+			};
+			const shared = rows === processedRows;
+			processedRows = processedRows.map(project);
+			rows = shared ? processedRows : rows.map(project);
+		}
 		const selected = selectedSet(state.selection);
 		const pageSelected = rows.filter((row) => selected.has(row.key)).length;
 		const scopeRows = selectScope === "page" || manual ? rows : processedRows;
@@ -1160,7 +1934,7 @@ function createTable(options) {
 					row,
 					rowIndex
 				});
-				return row.isExpanded ? [item, Object.freeze({
+				return row.isExpanded && (!model || (options.getRowCanExpand?.(row.original) ?? false)) ? [item, Object.freeze({
 					kind: "detail",
 					key: getRowItemKey(row.key, "detail"),
 					row,
@@ -1173,23 +1947,24 @@ function createTable(options) {
 			pageSize,
 			pageCount,
 			rowCount: filteredCount,
-			totalRowCount: manual ? filteredCount : indexed.rows.length,
+			totalRowCount: manual ? filteredCount : totalCount,
 			pageStart,
-			pageEnd: rows.length === 0 ? 0 : pageStart + rows.length - 1,
+			pageEnd: rows.length === 0 ? 0 : rootPagination ? Math.min(filteredCount, page * pageSize) : pageStart + rows.length - 1,
 			pageItems: paginationItems(page, pageCount),
 			canPreviousPage: page > 1,
 			canNextPage: page < pageCount,
 			selectionMode,
-			selectedCount: state.selection.length,
+			selectedCount: model ? state.selection.filter((key) => model.byKey.has(key)).length : state.selection.length,
 			pageSelection: coverage(pageSelected, rows.length),
 			allSelection: coverage(scopeSelected, scopeRows.length),
 			canUndo: undoStack.canUndo,
 			canRedo: undoStack.canRedo,
 			issues: Object.freeze(issues),
+			pendingCells: validation.cells(),
 			isSelected: (key) => selected.has(key),
 			getSort: (columnId) => sortIndex.get(columnId),
 			getColumn: (columnId) => byId.get(columnId),
-			getRow: (key) => expanded.byKey.get(key)
+			getRow: (key) => treeRow ? treeRow(key) : flatProjected.get(key) ?? (expanded.byKey.get(key) ? metadata(expanded.byKey.get(key)) : void 0)
 		});
 	}
 	function getSnapshot() {
@@ -1198,10 +1973,105 @@ function createTable(options) {
 	}
 	function notify() {
 		snapshot = void 0;
+		if (deferValidationNotify) {
+			validationNotifyRequested = true;
+			return;
+		}
+		if (transaction) return;
 		if (listeners.size === 0) return;
 		const next = getSnapshot();
 		for (const listener of listeners) listener(next);
 	}
+	function abortLoads(all = false) {
+		for (const [key, controller] of pendingLoads) {
+			const row = all ? void 0 : getSnapshot().getRow(key);
+			const visible = !all && getSnapshot().processedRows.some((candidate) => candidate.key === key);
+			if (all || !row?.isExpanded || !visible) {
+				pendingLoads.delete(key);
+				childStatuses.delete(key);
+				controller.abort();
+				snapshot = void 0;
+			}
+		}
+	}
+	function requestChildren(row) {
+		if (!options.loadChildren || destroyed || pendingLoads.has(row.key) || lazyChildren.has(row.key) || row.childStatus === "loaded") return;
+		const key = row.key;
+		if (!options.createChildLoadController) {
+			childStatuses.set(key, "error");
+			loadIssues.set(key, issue("invalid_tree_option", "Lazy children require createChildLoadController from the caller's runtime.", { rowKey: key }));
+			notify();
+			return;
+		}
+		let controller;
+		try {
+			controller = options.createChildLoadController();
+		} catch (error) {
+			loadIssues.set(key, issue("tree_load_error", String(error), { rowKey: key }));
+			childStatuses.set(key, "error");
+			notify();
+			return;
+		}
+		pendingLoads.set(key, controller);
+		childStatuses.set(key, "loading");
+		loadIssues.delete(key);
+		loadValidationIssues.delete(key);
+		notify();
+		Promise.resolve().then(() => controller.signal.aborted ? [] : options.loadChildren(row, controller.signal)).then((children) => {
+			if (controller.signal.aborted || pendingLoads.get(key) !== controller || destroyed) return void 0;
+			const { byId } = resolveColumns(definitions);
+			const existing = treeStage(data, byId, lazyVersion);
+			const candidate = buildTree(children, byId, readKey, {
+				...options,
+				getParentKey: void 0
+			}, /* @__PURE__ */ new Map());
+			pendingLoads.delete(key);
+			loadValidationIssues.set(key, candidate.issues.filter((problem) => problem.code === "tree_cycle" || problem.code === "tree_depth_exceeded"));
+			if (candidate.nodes.filter((node) => existing.byKey.has(node.row.key)).length || candidate.issues.some((problem) => problem.code === "duplicate_row_key")) {
+				childStatuses.set(key, "error");
+				loadIssues.set(key, issue("tree_duplicate_key", "Loaded children collide with existing keys; the batch is rejected.", { rowKey: key }));
+			} else {
+				lazyChildren.set(key, children);
+				childStatuses.set(key, "loaded");
+				lazyVersion++;
+				if (state.selection.includes(key) && selectionMode === "multiple") {
+					const nextModel = treeStage(data, byId, lazyVersion);
+					applySelection([...state.selection, ...selectionKeys([key], nextModel)]);
+				}
+			}
+			notify();
+			startVisibleLoads();
+		}).catch((error) => {
+			if (controller.signal.aborted || pendingLoads.get(key) !== controller || destroyed) return;
+			pendingLoads.delete(key);
+			childStatuses.set(key, "error");
+			loadIssues.set(key, issue("tree_load_error", `Children could not be loaded: ${String(error)}`, { rowKey: key }));
+			notify();
+		});
+	}
+	function startVisibleLoads() {
+		if (!treeEnabled || !options.loadChildren || destroyed) return;
+		const current = getSnapshot();
+		for (const row of current.rows) if (row.isExpanded && row.childStatus === "idle") requestChildren(row);
+	}
+	function selectionKeys(keys, model) {
+		if (!treeEnabled || selectionMode !== "multiple") return [...keys];
+		model ??= treeStage(data, resolveColumns(definitions).byId, lazyVersion);
+		const result = new Set(keys);
+		const stack = keys.flatMap((key) => {
+			const node = model.byKey.get(key);
+			return node ? [node] : [];
+		});
+		const visited = /* @__PURE__ */ new Set();
+		while (stack.length) {
+			const node = stack.pop();
+			if (visited.has(node.row.key)) continue;
+			visited.add(node.row.key);
+			result.add(node.row.key);
+			for (const child of node.children) stack.push(child);
+		}
+		return [...result];
+	}
 	/** Apply a change made by a table operation. */
 	function commit(patch) {
 		const previous = state;
@@ -1209,13 +2079,21 @@ function createTable(options) {
 		const next = mergePatch(patch);
 		if (next === previous && previousIssue === expandedIssue) return;
 		state = next;
+		snapshot = void 0;
+		abortLoads();
 		if (next !== previous) options.onStateChange?.(state, previous);
 		notify();
+		startVisibleLoads();
 	}
 	function canonicalExpanded(expanded, candidate = state) {
 		if (expandMode === "multiple") return expanded;
 		if (expanded !== true) return expanded.slice(-1);
 		const { columns, byId } = resolveColumns(definitions);
+		if (treeEnabled) {
+			const model = treeStage(data, byId, lazyVersion);
+			const first = processedTreeStage(model, columns, candidate.search, candidate.filters, candidate.sorting).roots.find((node) => node.children.length > 0 || (options.hasChildren?.(node.row.original) ?? false) || (options.getRowCanExpand?.(node.row.original) ?? false));
+			return first ? [first.row.key] : [];
+		}
 		const indexed = indexRows(data, byId);
 		const first = (manual ? indexed.rows : sortStage(filterStage(indexed.rows, columns, candidate.search, candidate.filters), columns, candidate.sorting)).find((row) => row.canExpand);
 		return first ? [first.key] : [];
@@ -1262,6 +2140,10 @@ function createTable(options) {
 	function applyChanges(edits, record, recoveredIssues = []) {
 		const current = getSnapshot();
 		const working = [...data];
+		const model = treeEnabled ? treeStage(data, resolveColumns(definitions).byId, lazyVersion) : void 0;
+		const replacements = /* @__PURE__ */ new Map();
+		const cache = new Map(lazyChildren);
+		const originalOf = (node) => replacements.get(node) ?? node.row.original;
 		const issues = [...recoveredIssues];
 		const changes = [];
 		const samples = /* @__PURE__ */ new Map();
@@ -1299,7 +2181,22 @@ function createTable(options) {
 				}));
 				continue;
 			}
-			const original = working[row.index];
+			const node = model?.byKey.get(row.key);
+			const original = node ? originalOf(node) : working[row.index];
+			if (node && !node.writable) {
+				issues.push(issue("read_only_cell", "A recovered nested root has no unambiguous source path for editing.", {
+					rowKey: row.key,
+					column: column.id
+				}));
+				continue;
+			}
+			if (node?.parent && options.getChildren && !options.setChildren) {
+				issues.push(issue("read_only_cell", "Editing a nested child requires an immutable setChildren callback.", {
+					rowKey: row.key,
+					column: column.id
+				}));
+				continue;
+			}
 			if (record && !column.isEditable(original)) {
 				issues.push(issue("read_only_cell", `The "${column.id}" cell of row "${String(row.key)}" is read-only.`, {
 					rowKey: row.key,
@@ -1321,7 +2218,16 @@ function createTable(options) {
 			} else value = edit.value;
 			const previous = column.getValue(original);
 			if (Object.is(previous, value)) continue;
-			const updated = column.setValue(original, value);
+			let updated;
+			try {
+				updated = column.setValue(original, value);
+			} catch (error) {
+				issues.push(issue("invalid_value", error instanceof Error ? error.message : String(error), {
+					rowKey: row.key,
+					column: column.id
+				}));
+				continue;
+			}
 			if (updated === void 0) {
 				issues.push(issue("read_only_cell", `The "${column.id}" column has no way to write a value.`, {
 					rowKey: row.key,
@@ -1329,7 +2235,38 @@ function createTable(options) {
 				}));
 				continue;
 			}
-			working[row.index] = updated;
+			if (readKey(updated, row.index) !== readKey(original, row.index)) {
+				issues.push(issue("invalid_row_operation", "Editing a row key is not supported; remove and insert the row instead.", {
+					rowKey: row.key,
+					column: column.id
+				}));
+				continue;
+			}
+			if (!node) working[row.index] = updated;
+			else {
+				const planned = /* @__PURE__ */ new Map([[node, updated]]);
+				const plannedCache = /* @__PURE__ */ new Map();
+				let cursor = node;
+				try {
+					while (cursor.parent) {
+						const parent = cursor.parent;
+						const children = parent.children.map((child) => planned.get(child) ?? originalOf(child));
+						if (cursor.lazy) plannedCache.set(parent.row.key, children);
+						if (options.setChildren) planned.set(parent, options.setChildren(originalOf(parent), children));
+						cursor = parent;
+					}
+				} catch (error) {
+					issues.push(issue("invalid_value", error instanceof Error ? error.message : String(error), {
+						rowKey: row.key,
+						column: column.id
+					}));
+					continue;
+				}
+				for (const [item, plannedRow] of planned) replacements.set(item, plannedRow);
+				for (const [key, children] of plannedCache) cache.set(key, children);
+				if (!options.getChildren && !node.lazy) working[node.sourceIndex] = updated;
+				if (options.getChildren || options.setChildren) working[cursor.sourceIndex] = originalOf(cursor);
+			}
 			changes.push({
 				rowKey: row.key,
 				column: column.id,
@@ -1343,17 +2280,390 @@ function createTable(options) {
 		else {
 			status = issues.length > 0 ? "partial" : "applied";
 			data = working;
-			if (record) undoStack.record(changes);
-			options.onDataChange?.(data, changes);
+			if (model) {
+				lazyChildren.clear();
+				for (const [key, children] of cache) lazyChildren.set(key, children);
+				lazyVersion++;
+			}
+			if (record) {
+				if (!transaction) undoStack.record({
+					kind: "cells",
+					changes
+				});
+			}
+			const groups = /* @__PURE__ */ new Map();
+			for (const change of changes) {
+				const group = groups.get(change.rowKey) ?? [];
+				group.push(change);
+				groups.set(change.rowKey, group);
+			}
+			for (const [key, group] of groups) pendingChanges.record(key, current.getRow(key).original, group.at(-1).row, positionOf(key), group);
+			if (!transaction) options.onDataChange?.(data, changes);
 			notify();
 		}
-		if (issues.length > 0) options.onEditIssues?.(issues);
+		if (issues.length > 0 && !transaction) options.onEditIssues?.(issues);
 		return Object.freeze({
 			status,
 			changes: Object.freeze(changes),
-			issues: Object.freeze(issues)
+			issues: Object.freeze(issues),
+			rowChanges: Object.freeze([]),
+			pendingCells: Object.freeze([])
 		});
 	}
+	function sourceRows() {
+		const { byId } = resolveColumns(definitions);
+		const model = treeEnabled ? treeStage(data, byId, lazyVersion) : void 0;
+		return model ? treeIndex(model) : indexRows(data, byId);
+	}
+	function positionOf(key) {
+		const { byId } = resolveColumns(definitions);
+		if (treeEnabled) {
+			const model = treeStage(data, byId, lazyVersion);
+			return treePositions(model).get(key) ?? Object.freeze({});
+		}
+		const indexed = indexRows(data, byId);
+		const row = indexed.byKey.get(key);
+		return Object.freeze({ before: row ? indexed.rows[row.index + 1]?.key : void 0 });
+	}
+	function scene() {
+		return {
+			data,
+			lazy: new Map(lazyChildren)
+		};
+	}
+	function resultForRows(changes, issues, cells = []) {
+		return Object.freeze({
+			status: changes.length || cells.length ? issues.length ? "partial" : "applied" : issues.length ? "rejected" : "unchanged",
+			changes: Object.freeze([...cells]),
+			rowChanges: Object.freeze([...changes]),
+			pendingCells: Object.freeze([]),
+			issues: Object.freeze([...issues])
+		});
+	}
+	function rowProblem(message, rowKey) {
+		return issue("invalid_row_operation", message, { rowKey });
+	}
+	function stableRows(rows) {
+		return options.rowKey !== void 0 || rows.every((row) => {
+			const key = getPath(row, "id");
+			return typeof key === "string" || typeof key === "number";
+		});
+	}
+	function cellDifferences(previous, row, key) {
+		return resolveColumns(definitions).columns.flatMap((column) => {
+			const before = column.getValue(previous);
+			const value = column.getValue(row);
+			return Object.is(before, value) ? [] : [{
+				rowKey: key,
+				column: column.id,
+				previous: before,
+				value,
+				row
+			}];
+		});
+	}
+	function recordRows(previous, keys, positions, baselines = /* @__PURE__ */ new Map()) {
+		const next = sourceRows();
+		const rowChanges = [];
+		for (const key of keys) {
+			const before = previous.byKey.get(key)?.original;
+			const row = next.byKey.get(key)?.original;
+			const position = positions.get(key) ?? positionOf(key);
+			const cells = before !== void 0 && row !== void 0 ? cellDifferences(before, row, key) : [];
+			const baseline = baselines.get(key);
+			const pending = pendingChanges.entries.get(key);
+			if (row === void 0 && baseline !== void 0 && pending?.previous !== void 0) pending.previous = baseline;
+			pendingChanges.record(key, row === void 0 ? baseline ?? before : before, row, position, cells);
+			if (before === void 0 && row !== void 0) rowChanges.push(Object.freeze({
+				kind: "inserted",
+				rowKey: key,
+				row,
+				position: positionOf(key)
+			}));
+			else if (row === void 0 && before !== void 0) rowChanges.push(Object.freeze({
+				kind: "removed",
+				rowKey: key,
+				row: before,
+				position
+			}));
+		}
+		return rowChanges;
+	}
+	function publishRows(before, previous, keys, positions, issues, baselines = /* @__PURE__ */ new Map()) {
+		const rowChanges = recordRows(previous, keys, positions, baselines);
+		if (!transaction) {
+			undoStack.record({
+				kind: "rows",
+				before,
+				after: scene(),
+				keys
+			});
+			options.onDataChange?.(data, []);
+			if (issues.length) options.onEditIssues?.(issues);
+		}
+		notify();
+		return resultForRows(rowChanges, issues);
+	}
+	function restoreScene(entry, direction) {
+		const previous = sourceRows();
+		const baselines = removalBaselines();
+		const positions = new Map(entry.keys.map((key) => [key, positionOf(key)]));
+		const target = direction === "undo" ? entry.before : entry.after;
+		data = target.data;
+		const changed = /* @__PURE__ */ new Set([...entry.before.lazy.keys(), ...entry.after.lazy.keys()]);
+		for (const key of changed) {
+			if (entry.before.lazy.get(key) === entry.after.lazy.get(key)) continue;
+			const rows = target.lazy.get(key);
+			if (rows) lazyChildren.set(key, rows);
+			else lazyChildren.delete(key);
+		}
+		lazyVersion++;
+		recordRows(previous, entry.keys, positions, baselines);
+		options.onDataChange?.(data, []);
+		notify();
+	}
+	function removalBaselines() {
+		const baselines = /* @__PURE__ */ new Map();
+		if (!options.getChildren || !options.setChildren) return baselines;
+		const model = treeStage(data, resolveColumns(definitions).byId, lazyVersion);
+		for (const node of model.nodes.toReversed()) {
+			const entry = pendingChanges.entries.get(node.row.key);
+			if (entry && entry.previous === void 0) continue;
+			let baseline = entry?.previous ?? node.row.original;
+			const children = node.children.filter((child) => !pendingChanges.entries.has(child.row.key) || pendingChanges.entries.get(child.row.key).previous !== void 0).map((child) => baselines.get(child.row.key) ?? child.row.original);
+			const originalChildren = options.getChildren(baseline) ?? [];
+			if (children.length !== originalChildren.length || children.some((child, index) => child !== originalChildren[index])) baseline = options.setChildren(baseline, children);
+			baselines.set(node.row.key, baseline);
+		}
+		return baselines;
+	}
+	function rewriteNested(model, removed, overrides, cache) {
+		const replacements = /* @__PURE__ */ new Map();
+		for (const node of model.nodes.toReversed()) {
+			if (removed.has(node.row.key)) continue;
+			const children = overrides.get(node.row.key) ?? node.children.filter((child) => !removed.has(child.row.key)).map((child) => replacements.get(child) ?? child.row.original);
+			if (!(overrides.has(node.row.key) || children.length !== node.children.length || children.some((child, index) => child !== node.children[index]?.row.original))) continue;
+			if (!options.setChildren) throw new Error("Changing nested children requires setChildren.");
+			replacements.set(node, options.setChildren(node.row.original, children));
+			if (cache.has(node.row.key)) cache.set(node.row.key, children);
+		}
+		const roots = new Map(model.roots.filter((node) => node.writable).map((node) => [node.sourceIndex, node]));
+		return data.flatMap((row, index) => {
+			const node = roots.get(index);
+			return node && removed.has(node.row.key) ? [] : [node ? replacements.get(node) ?? row : row];
+		});
+	}
+	function insertRows(rows, at = {}) {
+		const before = scene();
+		const previous = sourceRows();
+		const problems = [];
+		const reject = (problem) => {
+			if (!transaction) options.onEditIssues?.([problem]);
+			return resultForRows([], [problem]);
+		};
+		let incoming;
+		try {
+			incoming = rows ?? (options.createRow ? [options.createRow()] : []);
+		} catch (error) {
+			return reject(rowProblem(error instanceof Error ? error.message : String(error)));
+		}
+		if (rows === void 0 && !options.createRow) return reject(rowProblem("insertRows() requires rows or a createRow callback."));
+		if (!incoming.length) return resultForRows([], []);
+		if (!stableRows(data) || !stableRows(incoming)) return reject(rowProblem("Row operations require stable row keys; supply rowKey or an id on every row."));
+		const { byId } = resolveColumns(definitions);
+		const model = treeEnabled ? treeStage(data, byId, lazyVersion) : void 0;
+		const parent = at.parent === void 0 ? void 0 : model?.byKey.get(at.parent);
+		const sibling = at.before === void 0 ? void 0 : previous.byKey.get(at.before);
+		if (at.parent !== void 0 && !parent) return reject(issue("unknown_row", "The insertion parent does not exist.", { rowKey: at.parent }));
+		if (at.before !== void 0 && !sibling) return reject(issue("unknown_row", "The insertion sibling does not exist.", { rowKey: at.before }));
+		if (sibling && (model?.byKey.get(sibling.key)?.parent?.row.key ?? sibling.parentKey) !== at.parent) return reject(rowProblem("The before row must belong to the requested parent.", sibling.key));
+		if (parent && !parent.writable) return reject(rowProblem("A recovered parent has no writable source path.", parent.row.key));
+		if (parent && getSnapshot().getRow(parent.row.key)?.childStatus !== "loaded") return reject(rowProblem("Load the parent's children before inserting rows.", parent.row.key));
+		const cache = new Map(lazyChildren);
+		let next;
+		try {
+			if (options.getChildren && parent && model) {
+				const children = parent.children.map((child) => child.row.original);
+				const index = at.before === void 0 ? children.length : parent.children.findIndex((child) => child.row.key === at.before);
+				children.splice(index, 0, ...incoming);
+				next = rewriteNested(model, /* @__PURE__ */ new Set(), /* @__PURE__ */ new Map([[parent.row.key, children]]), cache);
+			} else if (parent && cache.has(parent.row.key)) {
+				incoming = incoming.map((row) => options.setParentKey ? options.setParentKey(row, parent.row.key) : row);
+				const children = [...cache.get(parent.row.key)];
+				const index = at.before === void 0 ? children.length : parent.children.findIndex((child) => child.row.key === at.before);
+				children.splice(index, 0, ...incoming);
+				cache.set(parent.row.key, children);
+				next = [...data];
+			} else {
+				if (parent && options.getParentKey) {
+					incoming = incoming.map((row) => options.setParentKey ? options.setParentKey(row, parent.row.key) : row);
+					if (incoming.some((row) => options.getParentKey(row) !== parent.row.key)) return reject(rowProblem("Supply setParentKey or rows already addressed to the requested parent."));
+				}
+				const working = [...data];
+				working.splice(sibling?.index ?? working.length, 0, ...incoming);
+				next = working;
+			}
+			const candidate = treeEnabled ? buildTree(next, byId, readKey, options, cache) : indexRows(next, byId);
+			if (!stableRows(candidate.rows.map((row) => row.original))) return reject(rowProblem("Every inserted descendant must have a stable key."));
+			const baseline = /* @__PURE__ */ new Map();
+			for (const problem of previous.issues) {
+				const key = `${problem.code}:${String(problem.rowKey)}`;
+				baseline.set(key, (baseline.get(key) ?? 0) + 1);
+			}
+			problems.push(...candidate.issues.filter((problem) => {
+				const key = `${problem.code}:${String(problem.rowKey)}`;
+				const remaining = baseline.get(key) ?? 0;
+				if (!remaining) return true;
+				baseline.set(key, remaining - 1);
+				return false;
+			}));
+			if (problems.length) {
+				if (!transaction) options.onEditIssues?.(problems);
+				return resultForRows([], problems);
+			}
+			const keys = candidate.rows.filter((row) => !previous.byKey.has(row.key)).map((row) => row.key);
+			if (!keys.length) return reject(rowProblem("No unique rows can be inserted."));
+			data = next;
+			lazyChildren.clear();
+			for (const [key, value] of cache) lazyChildren.set(key, value);
+			lazyVersion++;
+			return publishRows(before, previous, keys, /* @__PURE__ */ new Map(), []);
+		} catch (error) {
+			return reject(rowProblem(error instanceof Error ? error.message : String(error)));
+		}
+	}
+	function removeRows(keys) {
+		const before = scene();
+		const previous = sourceRows();
+		const problems = [];
+		const removed = /* @__PURE__ */ new Set();
+		const { byId } = resolveColumns(definitions);
+		const model = treeEnabled ? treeStage(data, byId, lazyVersion) : void 0;
+		if (!stableRows(data)) {
+			const problem = rowProblem("Row operations require stable row keys.");
+			if (!transaction) options.onEditIssues?.([problem]);
+			return resultForRows([], [problem]);
+		}
+		for (const key of keys) {
+			if (!previous.byKey.has(key)) {
+				problems.push(issue("unknown_row", "The row to remove does not exist.", { rowKey: key }));
+				continue;
+			}
+			const node = model?.byKey.get(key);
+			if (node && !node.writable) {
+				problems.push(rowProblem("A recovered row has no writable source path.", key));
+				continue;
+			}
+			const stack = node ? [node] : [];
+			removed.add(key);
+			while (stack.length) {
+				const item = stack.pop();
+				removed.add(item.row.key);
+				for (const child of item.children) stack.push(child);
+			}
+		}
+		if (!removed.size) {
+			if (problems.length && !transaction) options.onEditIssues?.(problems);
+			return resultForRows([], problems);
+		}
+		const positions = new Map([...removed].map((key) => [key, positionOf(key)]));
+		const cache = new Map(lazyChildren);
+		try {
+			const baselines = removalBaselines();
+			const next = options.getChildren && model ? rewriteNested(model, removed, /* @__PURE__ */ new Map(), cache) : data.filter((row, index) => !removed.has(readKey(row, index)));
+			for (const [key, children] of cache) if (removed.has(key)) cache.delete(key);
+			else cache.set(key, children.filter((row, index) => !removed.has(readKey(row, index))));
+			data = next;
+			lazyChildren.clear();
+			for (const [key, value] of cache) lazyChildren.set(key, value);
+			lazyVersion++;
+			validation.cancel([...removed]);
+			abortLoads();
+			return publishRows(before, previous, [...removed], positions, problems, baselines);
+		} catch (error) {
+			problems.push(rowProblem(error instanceof Error ? error.message : String(error)));
+			if (!transaction) options.onEditIssues?.(problems);
+			return resultForRows([], problems);
+		}
+	}
+	function revert(keys) {
+		const selected = new Set(keys ?? pendingChanges.entries.keys());
+		const entries = [...pendingChanges.entries].filter(([key]) => selected.has(key)).map(([key, entry]) => [key, {
+			...entry,
+			cells: new Map(entry.cells)
+		}]);
+		if (!entries.length) return resultForRows([], []);
+		const before = scene();
+		const previous = sourceRows();
+		const positions = new Map([...selected].map((key) => [key, positionOf(key)]));
+		const problems = [];
+		const cells = [];
+		transaction = true;
+		try {
+			problems.push(...removeRows(entries.filter(([, entry]) => entry.previous === void 0).map(([key]) => key)).issues);
+			const missing = entries.filter(([, entry]) => entry.previous !== void 0 && entry.row === void 0);
+			for (let pass = 0; missing.length && pass <= entries.length; pass++) {
+				let progress = false;
+				for (let index = missing.length - 1; index >= 0; index--) {
+					const [key, entry] = missing[index];
+					if (sourceRows().byKey.has(key)) {
+						missing.splice(index, 1);
+						progress = true;
+						continue;
+					}
+					if (entry.position.parent !== void 0 && !sourceRows().byKey.has(entry.position.parent)) continue;
+					const at = {
+						...entry.position,
+						before: entry.position.before !== void 0 && sourceRows().byKey.has(entry.position.before) ? entry.position.before : void 0
+					};
+					const result = insertRows([entry.previous], at);
+					problems.push(...result.issues);
+					missing.splice(index, 1);
+					progress = true;
+				}
+				if (!progress) break;
+			}
+			for (const [key] of missing) problems.push(rowProblem("The saved parent is missing; restore it before this child.", key));
+			const result = applyChanges(entries.flatMap(([key, entry]) => entry.previous !== void 0 && sourceRows().byKey.has(key) ? [...entry.cells.values()].map((change) => ({
+				rowKey: key,
+				column: change.column,
+				value: change.previous
+			})) : []), false);
+			cells.push(...result.changes);
+			problems.push(...result.issues);
+			for (const [key] of entries) if (!problems.some((problem) => problem.rowKey === key)) pendingChanges.entries.delete(key);
+			validation.cancel([...selected]);
+		} finally {
+			transaction = false;
+		}
+		const after = scene();
+		if (before.data !== after.data || cells.length) undoStack.record({
+			kind: "rows",
+			before,
+			after,
+			keys: [...selected]
+		});
+		const next = sourceRows();
+		const rowChanges = [...selected].flatMap((key) => {
+			const old = previous.byKey.get(key);
+			const row = next.byKey.get(key);
+			return !old && row ? [{
+				kind: "inserted",
+				rowKey: key,
+				row: row.original,
+				position: positionOf(key)
+			}] : old && !row ? [{
+				kind: "removed",
+				rowKey: key,
+				row: old.original,
+				position: positions.get(key)
+			}] : [];
+		});
+		if (before.data !== after.data) options.onDataChange?.(data, cells);
+		if (problems.length) options.onEditIssues?.(problems);
+		notify();
+		return resultForRows(rowChanges, problems, cells);
+	}
 	function rangeEdits(origin, matrix) {
 		const { rows, columns } = getSnapshot();
 		const edits = [];
@@ -1372,7 +2682,7 @@ function createTable(options) {
 		return edits;
 	}
 	function replay(changes, direction) {
-		applyChanges(changes.map((change) => ({
+		applyChanges((direction === "undo" ? changes.toReversed() : changes).map((change) => ({
 			rowKey: change.rowKey,
 			column: change.column,
 			value: direction === "undo" ? change.previous : change.value
@@ -1384,6 +2694,15 @@ function createTable(options) {
 		snapshot = void 0;
 	}
 	const table = {
+		insertRows,
+		removeRows,
+		revert,
+		getPendingChanges: () => pendingChanges.snapshot(),
+		markSaved(keys) {
+			if (!keys) pendingChanges.entries.clear();
+			else for (const key of keys) pendingChanges.entries.delete(key);
+			notify();
+		},
 		getSnapshot,
 		getState: () => state,
 		subscribe(listener) {
@@ -1397,18 +2716,31 @@ function createTable(options) {
 			const next = mergePatch(patch);
 			if (next !== state || previousIssue !== expandedIssue) {
 				state = next;
+				snapshot = void 0;
+				abortLoads();
 				notify();
+				startVisibleLoads();
 			}
 		},
 		setData(next) {
 			if (next === data) return;
+			validation.cancel();
+			pendingChanges.entries.clear();
+			abortLoads(true);
+			lazyChildren.clear();
+			childStatuses.clear();
+			loadIssues.clear();
+			loadValidationIssues.clear();
+			lazyVersion++;
 			data = next;
 			undoStack.clear();
 			notify();
+			startVisibleLoads();
 		},
 		setColumns(next) {
 			if (next === definitions) return;
 			definitions = next;
+			validation.cancel();
 			notify();
 		},
 		setRowCount(next) {
@@ -1475,14 +2807,14 @@ function createTable(options) {
 			} });
 		},
 		select(keys) {
-			applySelection([...state.selection, ...keys]);
+			applySelection([...state.selection, ...selectionKeys(keys)]);
 		},
 		deselect(keys) {
-			const removed = new Set(keys);
+			const removed = new Set(selectionKeys(keys));
 			applySelection(state.selection.filter((key) => !removed.has(key)));
 		},
 		toggleRow(key, selected) {
-			const isSelected = state.selection.includes(key);
+			const isSelected = treeEnabled ? getSnapshot().getRow(key)?.selection === "all" : state.selection.includes(key);
 			const next = selected ?? !isSelected;
 			if (next === isSelected) return;
 			if (next) table.select([key]);
@@ -1509,12 +2841,16 @@ function createTable(options) {
 			const row = getSnapshot().getRow(key);
 			if (!row?.canExpand) return;
 			const open = expanded ?? !row.isExpanded;
-			if (open === row.isExpanded) return;
+			if (open === row.isExpanded) {
+				if (open && row.childStatus === "error") requestChildren(row);
+				return;
+			}
 			if (expandMode === "single") commit({ expanded: open ? [key] : [] });
 			else if (state.expanded === true) {
 				const { byId } = resolveColumns(definitions);
-				commit({ expanded: indexRows(data, byId).rows.filter((candidate) => candidate.canExpand && candidate.key !== key).map((candidate) => candidate.key) });
+				commit({ expanded: (treeEnabled ? treeStage(data, byId, lazyVersion).rows.map((candidate) => getSnapshot().getRow(candidate.key)) : indexRows(data, byId).rows).filter((candidate) => candidate.canExpand && candidate.key !== key).map((candidate) => candidate.key) });
 			} else commit({ expanded: open ? [...state.expanded, key] : state.expanded.filter((candidate) => candidate !== key) });
+			if (open) requestChildren(getSnapshot().getRow(key));
 		},
 		expandAll() {
 			commit({ expanded: true });
@@ -1540,18 +2876,22 @@ function createTable(options) {
 			commit({ columnOrder: order });
 		},
 		edit(edits) {
-			return applyChanges(Array.isArray(edits) ? edits : [edits], true);
+			return validation.edit(Array.isArray(edits) ? edits : [edits]);
 		},
 		undo() {
-			const changes = undoStack.undo();
-			if (!changes) return false;
-			replay(changes, "undo");
+			const entry = undoStack.undo();
+			if (!entry) return false;
+			validation.cancel();
+			if (entry.kind === "cells") replay(entry.changes, "undo");
+			else restoreScene(entry, "undo");
 			return true;
 		},
 		redo() {
-			const changes = undoStack.redo();
-			if (!changes) return false;
-			replay(changes, "redo");
+			const entry = undoStack.redo();
+			if (!entry) return false;
+			validation.cancel();
+			if (entry.kind === "cells") replay(entry.changes, "redo");
+			else restoreScene(entry, "redo");
 			return true;
 		},
 		copy(range, { escapeFormulas = false } = {}) {
@@ -1573,7 +2913,7 @@ function createTable(options) {
 			return toDelimited(matrix);
 		},
 		paste(origin, text) {
-			if (!Number.isInteger(origin.row) || !Number.isInteger(origin.column) || origin.row < 0 || origin.column < 0) return applyChanges([], true, [issue("invalid_value", "The paste origin must use non-negative whole row and column indices.")]);
+			if (!Number.isInteger(origin.row) || !Number.isInteger(origin.column) || origin.row < 0 || origin.column < 0) return validation.edit([], [issue("invalid_value", "The paste origin must use non-negative whole row and column indices.")]);
 			const { rows, columns } = getSnapshot();
 			const parsed = readDelimited(text, {
 				maxRows: Math.max(0, rows.length - origin.row),
@@ -1582,39 +2922,49 @@ function createTable(options) {
 				maxLength: maxPasteLength
 			});
 			const issues = parsed.truncated ? [issue("paste_truncated", "The paste exceeds the visible grid or parsing limits; only complete cells within those limits are applied.")] : [];
-			return applyChanges(rangeEdits(origin, parsed.rows), true, issues);
+			return validation.edit(rangeEdits(origin, parsed.rows), issues);
 		},
 		clear(range) {
 			const matrix = Array.from({ length: range.bottom - range.top + 1 }, () => Array.from({ length: range.right - range.left + 1 }, () => ""));
 			const current = getSnapshot();
-			return applyChanges(rangeEdits({
+			const edits = rangeEdits({
 				row: range.top,
 				column: range.left
 			}, matrix).filter((edit) => {
 				const row = current.getRow(edit.rowKey);
 				return row !== void 0 && current.getColumn(edit.column)?.isEditable(row.original) === true;
-			}), true);
+			});
+			return validation.edit(edits);
 		},
-		exportRows({ format = "csv", columns: ids, pageOnly = false, headers = true, escapeFormulas = true } = {}) {
+		exportRows({ format = "csv", columns: ids, pageOnly = false, headers = true, escapeFormulas = true, depth = false, indent = "" } = {}) {
 			const current = getSnapshot();
 			const columns = ids ? ids.flatMap((id) => {
 				const column = current.getColumn(id);
 				return column ? [column] : [];
 			}) : current.columns;
-			const matrix = (pageOnly ? current.rows : current.processedRows).map((row) => columns.map((column) => {
-				const display = row.getDisplay(column.id);
+			const rows = pageOnly ? current.rows : current.processedRows;
+			const matrix = rows.map((row) => columns.map((column, index) => {
+				const display = (index === 0 ? indent.repeat(row.depth) : "") + row.getDisplay(column.id);
 				return escapeFormulas ? escapeFormula(display, row.getValue(column.id)) : display;
 			}));
-			if (headers) matrix.unshift(columns.map((column) => escapeFormulas ? escapeFormula(column.header) : column.header));
+			if (depth) matrix.forEach((line, index) => line.unshift(String(rows[index].depth)));
+			if (headers) {
+				matrix.unshift(columns.map((column) => escapeFormulas ? escapeFormula(column.header) : column.header));
+				if (depth) matrix[0].unshift("Depth");
+			}
 			return toDelimited(matrix, format === "csv" ? "," : "	");
 		},
 		reset() {
 			commit(initialState);
 		},
 		destroy() {
+			destroyed = true;
+			validation.cancel();
+			abortLoads(true);
 			listeners.clear();
 		}
 	};
+	startVisibleLoads();
 	return table;
 }