@adea-ai/ui 0.63.4 → 0.65.0

package/dist/components/layout/split-layout/model.d.ts

@@ -0,0 +1,51 @@
+/** A visual identity only. Extend this with host-owned payload; UI never interprets it. */
+export type SplitLayoutLeaf = Readonly<{
+    kind: 'leaf';
+    id: string;
+}>;
+export type SplitLayoutBranch<L extends SplitLayoutLeaf = SplitLayoutLeaf> = Readonly<{
+    kind: 'split';
+    id: string;
+    direction: 'row' | 'column';
+    ratio: number;
+    children: readonly [SplitLayoutNode<L>, SplitLayoutNode<L>];
+}>;
+export type SplitLayoutNode<L extends SplitLayoutLeaf = SplitLayoutLeaf> = L | SplitLayoutBranch<L>;
+export declare const MAX_LAYOUT_LEAVES = 8;
+export declare const MAX_LAYOUT_DEPTH = 8;
+export declare const MIN_SPLIT_RATIO = 0.1;
+export declare const MAX_SPLIT_RATIO = 0.9;
+export type SplitLayoutState<L extends SplitLayoutLeaf = SplitLayoutLeaf> = Readonly<{
+    center: SplitLayoutNode<L>;
+    focusedLeafId: string;
+    closed: readonly Readonly<{
+        center: SplitLayoutNode<L>;
+        leafId: string;
+    }>[];
+}>;
+export type SplitPaneInput<L extends SplitLayoutLeaf = SplitLayoutLeaf> = Readonly<{
+    direction: SplitLayoutBranch<L>['direction'];
+    placement: 'before' | 'after';
+    leaf: L;
+    splitId: string;
+}>;
+export declare function listLeaves<L extends SplitLayoutLeaf>(node: SplitLayoutNode<L>): readonly L[];
+export declare function countLeaves<L extends SplitLayoutLeaf>(node: SplitLayoutNode<L>): number;
+export declare function layoutDepth<L extends SplitLayoutLeaf>(node: SplitLayoutNode<L>): number;
+export declare function createLayoutState<L extends SplitLayoutLeaf>(center: SplitLayoutNode<L>): SplitLayoutState<L>;
+export declare function splitPane<L extends SplitLayoutLeaf>(state: SplitLayoutState<L>, targetLeafId: string, input: SplitPaneInput<L>): SplitLayoutState<L>;
+export declare function closePane<L extends SplitLayoutLeaf>(state: SplitLayoutState<L>, leafId: string, createPlaceholderLeaf: () => L): SplitLayoutState<L>;
+export declare function undoClosePane<L extends SplitLayoutLeaf>(state: SplitLayoutState<L>): SplitLayoutState<L>;
+export declare function focusPane<L extends SplitLayoutLeaf>(state: SplitLayoutState<L>, leafId: string): SplitLayoutState<L>;
+export declare function swapPanes<L extends SplitLayoutLeaf>(state: SplitLayoutState<L>, firstLeafId: string, secondLeafId: string): SplitLayoutState<L>;
+export declare function movePane<L extends SplitLayoutLeaf>(state: SplitLayoutState<L>, leafId: string, targetLeafId: string, placement: 'before' | 'after', direction: SplitLayoutBranch<L>['direction'], splitId: string): SplitLayoutState<L>;
+export declare function resizeSplit<L extends SplitLayoutLeaf>(state: SplitLayoutState<L>, splitId: string, ratio: number): SplitLayoutState<L>;
+/**
+ * Pure repair walk ported from bb's size normalization: every split ratio is
+ * clamped into the normative range and a non-finite ratio falls back to an
+ * even split. Structure, IDs, and focus are untouched.
+ */
+export declare function normalizeLayout<L extends SplitLayoutLeaf>(state: SplitLayoutState<L>): SplitLayoutState<L>;
+/** The leaf immediately after (`1`) or before (`-1`) the given leaf in reading order. */
+export declare function neighborLeaf<L extends SplitLayoutLeaf>(state: SplitLayoutState<L>, leafId: string, step: 1 | -1): L | undefined;
+//# sourceMappingURL=model.d.ts.map

package/dist/components/layout/split-layout/model.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"model.d.ts","sourceRoot":"","sources":["../../../../src/components/layout/split-layout/model.ts"],"names":[],"mappings":"AAiBA,2FAA2F;AAC3F,MAAM,MAAM,eAAe,GAAG,QAAQ,CAAC;IAAE,IAAI,EAAE,MAAM,CAAC;IAAC,EAAE,EAAE,MAAM,CAAA;CAAE,CAAC,CAAA;AACpE,MAAM,MAAM,iBAAiB,CAAC,CAAC,SAAS,eAAe,GAAG,eAAe,IAAI,QAAQ,CAAC;IACpF,IAAI,EAAE,OAAO,CAAA;IACb,EAAE,EAAE,MAAM,CAAA;IACV,SAAS,EAAE,KAAK,GAAG,QAAQ,CAAA;IAC3B,KAAK,EAAE,MAAM,CAAA;IACb,QAAQ,EAAE,SAAS,CAAC,eAAe,CAAC,CAAC,CAAC,EAAE,eAAe,CAAC,CAAC,CAAC,CAAC,CAAA;CAC5D,CAAC,CAAA;AACF,MAAM,MAAM,eAAe,CAAC,CAAC,SAAS,eAAe,GAAG,eAAe,IAAI,CAAC,GAAG,iBAAiB,CAAC,CAAC,CAAC,CAAA;AAEnG,eAAO,MAAM,iBAAiB,IAAI,CAAA;AAClC,eAAO,MAAM,gBAAgB,IAAI,CAAA;AACjC,eAAO,MAAM,eAAe,MAAM,CAAA;AAClC,eAAO,MAAM,eAAe,MAAM,CAAA;AAElC,MAAM,MAAM,gBAAgB,CAAC,CAAC,SAAS,eAAe,GAAG,eAAe,IAAI,QAAQ,CAAC;IACnF,MAAM,EAAE,eAAe,CAAC,CAAC,CAAC,CAAA;IAC1B,aAAa,EAAE,MAAM,CAAA;IACrB,MAAM,EAAE,SAAS,QAAQ,CAAC;QAAE,MAAM,EAAE,eAAe,CAAC,CAAC,CAAC,CAAC;QAAC,MAAM,EAAE,MAAM,CAAA;KAAE,CAAC,EAAE,CAAA;CAC5E,CAAC,CAAA;AAEF,MAAM,MAAM,cAAc,CAAC,CAAC,SAAS,eAAe,GAAG,eAAe,IAAI,QAAQ,CAAC;IACjF,SAAS,EAAE,iBAAiB,CAAC,CAAC,CAAC,CAAC,WAAW,CAAC,CAAA;IAC5C,SAAS,EAAE,QAAQ,GAAG,OAAO,CAAA;IAC7B,IAAI,EAAE,CAAC,CAAA;IACP,OAAO,EAAE,MAAM,CAAA;CAChB,CAAC,CAAA;AAEF,wBAAgB,UAAU,CAAC,CAAC,SAAS,eAAe,EAAE,IAAI,EAAE,eAAe,CAAC,CAAC,CAAC,GAAG,SAAS,CAAC,EAAE,CAI5F;AAED,wBAAgB,WAAW,CAAC,CAAC,SAAS,eAAe,EAAE,IAAI,EAAE,eAAe,CAAC,CAAC,CAAC,GAAG,MAAM,CAEvF;AAED,wBAAgB,WAAW,CAAC,CAAC,SAAS,eAAe,EAAE,IAAI,EAAE,eAAe,CAAC,CAAC,CAAC,GAAG,MAAM,CAIvF;AA0FD,wBAAgB,iBAAiB,CAAC,CAAC,SAAS,eAAe,EACzD,MAAM,EAAE,eAAe,CAAC,CAAC,CAAC,GACzB,gBAAgB,CAAC,CAAC,CAAC,CAKrB;AAED,wBAAgB,SAAS,CAAC,CAAC,SAAS,eAAe,EACjD,KAAK,EAAE,gBAAgB,CAAC,CAAC,CAAC,EAC1B,YAAY,EAAE,MAAM,EACpB,KAAK,EAAE,cAAc,CAAC,CAAC,CAAC,GACvB,gBAAgB,CAAC,CAAC,CAAC,CAmBrB;AAED,wBAAgB,SAAS,CAAC,CAAC,SAAS,eAAe,EACjD,KAAK,EAAE,gBAAgB,CAAC,CAAC,CAAC,EAC1B,MAAM,EAAE,MAAM,EACd,qBAAqB,EAAE,MAAM,CAAC,GAC7B,gBAAgB,CAAC,CAAC,CAAC,CAmBrB;AAED,wBAAgB,aAAa,CAAC,CAAC,SAAS,eAAe,EACrD,KAAK,EAAE,gBAAgB,CAAC,CAAC,CAAC,GACzB,gBAAgB,CAAC,CAAC,CAAC,CAQrB;AAED,wBAAgB,SAAS,CAAC,CAAC,SAAS,eAAe,EACjD,KAAK,EAAE,gBAAgB,CAAC,CAAC,CAAC,EAC1B,MAAM,EAAE,MAAM,GACb,gBAAgB,CAAC,CAAC,CAAC,CAIrB;AAED,wBAAgB,SAAS,CAAC,CAAC,SAAS,eAAe,EACjD,KAAK,EAAE,gBAAgB,CAAC,CAAC,CAAC,EAC1B,WAAW,EAAE,MAAM,EACnB,YAAY,EAAE,MAAM,GACnB,gBAAgB,CAAC,CAAC,CAAC,CAmBrB;AAED,wBAAgB,QAAQ,CAAC,CAAC,SAAS,eAAe,EAChD,KAAK,EAAE,gBAAgB,CAAC,CAAC,CAAC,EAC1B,MAAM,EAAE,MAAM,EACd,YAAY,EAAE,MAAM,EACpB,SAAS,EAAE,QAAQ,GAAG,OAAO,EAC7B,SAAS,EAAE,iBAAiB,CAAC,CAAC,CAAC,CAAC,WAAW,CAAC,EAC5C,OAAO,EAAE,MAAM,GACd,gBAAgB,CAAC,CAAC,CAAC,CAYrB;AAED,wBAAgB,WAAW,CAAC,CAAC,SAAS,eAAe,EACnD,KAAK,EAAE,gBAAgB,CAAC,CAAC,CAAC,EAC1B,OAAO,EAAE,MAAM,EACf,KAAK,EAAE,MAAM,GACZ,gBAAgB,CAAC,CAAC,CAAC,CAkBrB;AAED;;;;GAIG;AACH,wBAAgB,eAAe,CAAC,CAAC,SAAS,eAAe,EACvD,KAAK,EAAE,gBAAgB,CAAC,CAAC,CAAC,GACzB,gBAAgB,CAAC,CAAC,CAAC,CAgBrB;AAED,yFAAyF;AACzF,wBAAgB,YAAY,CAAC,CAAC,SAAS,eAAe,EACpD,KAAK,EAAE,gBAAgB,CAAC,CAAC,CAAC,EAC1B,MAAM,EAAE,MAAM,EACd,IAAI,EAAE,CAAC,GAAG,CAAC,CAAC,GACX,CAAC,GAAG,SAAS,CAKf"}

package/dist/components/layout/split-layout/model.js

@@ -0,0 +1,255 @@
+//#region src/components/layout/split-layout/model.ts
+var MAX_LAYOUT_LEAVES = 8;
+var MAX_LAYOUT_DEPTH = 8;
+var MIN_SPLIT_RATIO = .1;
+var MAX_SPLIT_RATIO = .9;
+function listLeaves(node) {
+	return node.kind === "leaf" ? [node] : [...listLeaves(node.children[0]), ...listLeaves(node.children[1])];
+}
+function countLeaves(node) {
+	return node.kind === "leaf" ? 1 : countLeaves(node.children[0]) + countLeaves(node.children[1]);
+}
+function layoutDepth(node) {
+	return node.kind === "leaf" ? 1 : 1 + Math.max(layoutDepth(node.children[0]), layoutDepth(node.children[1]));
+}
+function replaceLeaf(node, leafId, replacement) {
+	if (node.kind === "leaf") return node.id === leafId ? replacement : node;
+	const first = replaceLeaf(node.children[0], leafId, replacement);
+	const second = replaceLeaf(node.children[1], leafId, replacement);
+	return first === node.children[0] && second === node.children[1] ? node : {
+		...node,
+		children: [first, second]
+	};
+}
+function removeLeaf(node, leafId) {
+	if (node.kind === "leaf") return node.id === leafId ? null : node;
+	const first = removeLeaf(node.children[0], leafId);
+	const second = removeLeaf(node.children[1], leafId);
+	if (!first) return second;
+	if (!second) return first;
+	return first === node.children[0] && second === node.children[1] ? node : {
+		...node,
+		children: [first, second]
+	};
+}
+function containsLeaf(node, leafId) {
+	return node.kind === "leaf" ? node.id === leafId : containsLeaf(node.children[0], leafId) || containsLeaf(node.children[1], leafId);
+}
+function assertUniqueInput(state, leaf, splitId) {
+	assertLayoutTree(leaf);
+	if (typeof splitId !== "string" || splitId.length === 0) throw new Error("invalid_state: split identity must be nonempty");
+	const ids = /* @__PURE__ */ new Set();
+	const visit = (node) => {
+		if (ids.has(node.id)) throw new Error("invalid_state: duplicate pane id");
+		ids.add(node.id);
+		if (node.kind === "split") node.children.forEach(visit);
+	};
+	visit(state.center);
+	if (ids.has(leaf.id) || ids.has(splitId) || leaf.id === splitId) throw new Error("invalid_state: duplicate pane id");
+}
+/** Visual-tree validation only; applications still decode and scope persisted preferences. */
+function assertLayoutTree(center) {
+	const ids = /* @__PURE__ */ new Set();
+	const seen = /* @__PURE__ */ new WeakSet();
+	let leaves = 0;
+	const visit = (node, depth) => {
+		if (depth > 8) throw new Error("limit_exceeded: layout depth exceeds eight");
+		if (!node || typeof node !== "object") throw new Error("invalid_state: missing layout node");
+		if (seen.has(node)) throw new Error("invalid_state: cyclic or reused layout node");
+		seen.add(node);
+		if (typeof node.id !== "string" || node.id.length === 0) throw new Error("invalid_state: layout identity must be nonempty");
+		if (ids.has(node.id)) throw new Error("invalid_state: duplicate pane id");
+		ids.add(node.id);
+		if (node.kind === "leaf") {
+			leaves += 1;
+			if (leaves > 8) throw new Error("limit_exceeded: layout has more than eight leaves");
+			return;
+		}
+		if (node.kind !== "split" || !Array.isArray(node.children) || node.children.length !== 2 || node.direction !== "row" && node.direction !== "column") throw new Error("invalid_state: layout must be a strict binary row or column tree");
+		visit(node.children[0], depth + 1);
+		visit(node.children[1], depth + 1);
+	};
+	visit(center, 1);
+}
+function createLayoutState(center) {
+	assertLayoutTree(center);
+	const first = listLeaves(center)[0];
+	if (!first) throw new Error("invalid_state: layout requires a leaf");
+	return {
+		center,
+		focusedLeafId: first.id,
+		closed: []
+	};
+}
+function splitPane(state, targetLeafId, input) {
+	if (!containsLeaf(state.center, targetLeafId)) return state;
+	if (countLeaves(state.center) >= 8) throw new Error("limit_exceeded: center layout has eight leaves");
+	assertUniqueInput(state, input.leaf, input.splitId);
+	const target = listLeaves(state.center).find((leaf) => leaf.id === targetLeafId);
+	if (!target) return state;
+	const children = input.placement === "before" ? [input.leaf, target] : [target, input.leaf];
+	const center = replaceLeaf(state.center, targetLeafId, {
+		kind: "split",
+		id: input.splitId,
+		direction: input.direction,
+		ratio: .5,
+		children
+	});
+	if (layoutDepth(center) > 8) throw new Error("limit_exceeded: center layout depth exceeds eight");
+	return {
+		...state,
+		center,
+		focusedLeafId: input.leaf.id,
+		closed: []
+	};
+}
+function closePane(state, leafId, createPlaceholderLeaf) {
+	if (!containsLeaf(state.center, leafId)) return state;
+	const before = state.center;
+	const closedIndex = listLeaves(before).findIndex((leaf) => leaf.id === leafId);
+	const removed = removeLeaf(before, leafId);
+	const center = removed ?? createPlaceholderLeaf();
+	if (!removed) {
+		if (center.kind !== "leaf") throw new Error("invalid_state: placeholder must be a leaf");
+		assertLayoutTree(center);
+	}
+	const leaves = listLeaves(center);
+	const fallback = leaves[Math.min(closedIndex, leaves.length - 1)] ?? leaves[0];
+	if (!fallback) throw new Error("invalid_state: layout requires a leaf");
+	return {
+		center,
+		focusedLeafId: state.focusedLeafId === leafId ? fallback.id : state.focusedLeafId,
+		closed: [...state.closed, {
+			center: before,
+			leafId
+		}]
+	};
+}
+function undoClosePane(state) {
+	const previous = state.closed.at(-1);
+	if (!previous) return state;
+	return {
+		center: previous.center,
+		focusedLeafId: previous.leafId,
+		closed: state.closed.slice(0, -1)
+	};
+}
+function focusPane(state, leafId) {
+	return containsLeaf(state.center, leafId) && state.focusedLeafId !== leafId ? {
+		...state,
+		focusedLeafId: leafId
+	} : state;
+}
+function swapPanes(state, firstLeafId, secondLeafId) {
+	if (firstLeafId === secondLeafId) return state;
+	const leaves = listLeaves(state.center);
+	const first = leaves.find((leaf) => leaf.id === firstLeafId);
+	const second = leaves.find((leaf) => leaf.id === secondLeafId);
+	if (!first || !second) return state;
+	const swap = (node) => {
+		if (node.kind === "leaf") {
+			if (node.id === firstLeafId) return second;
+			if (node.id === secondLeafId) return first;
+			return node;
+		}
+		const left = swap(node.children[0]);
+		const right = swap(node.children[1]);
+		return left === node.children[0] && right === node.children[1] ? node : {
+			...node,
+			children: [left, right]
+		};
+	};
+	return {
+		...state,
+		center: swap(state.center),
+		closed: []
+	};
+}
+function movePane(state, leafId, targetLeafId, placement, direction, splitId) {
+	if (leafId === targetLeafId) return state;
+	const moving = listLeaves(state.center).find((leaf) => leaf.id === leafId);
+	if (!moving || !containsLeaf(state.center, targetLeafId)) return state;
+	const detached = removeLeaf(state.center, leafId);
+	if (!detached) return state;
+	return {
+		...splitPane({
+			center: detached,
+			focusedLeafId: state.focusedLeafId,
+			closed: state.closed
+		}, targetLeafId, {
+			direction,
+			placement,
+			leaf: moving,
+			splitId
+		}),
+		focusedLeafId: leafId
+	};
+}
+function resizeSplit(state, splitId, ratio) {
+	if (!Number.isFinite(ratio)) return state;
+	const nextRatio = Math.min(MAX_SPLIT_RATIO, Math.max(MIN_SPLIT_RATIO, ratio));
+	let found = false;
+	const visit = (node) => {
+		if (node.kind === "leaf") return node;
+		if (node.id === splitId) {
+			found = true;
+			return node.ratio === nextRatio ? node : {
+				...node,
+				ratio: nextRatio
+			};
+		}
+		const first = visit(node.children[0]);
+		const second = visit(node.children[1]);
+		return first === node.children[0] && second === node.children[1] ? node : {
+			...node,
+			children: [first, second]
+		};
+	};
+	const center = visit(state.center);
+	return found && center !== state.center ? {
+		...state,
+		center,
+		closed: []
+	} : state;
+}
+/**
+* Pure repair walk ported from bb's size normalization: every split ratio is
+* clamped into the normative range and a non-finite ratio falls back to an
+* even split. Structure, IDs, and focus are untouched.
+*/
+function normalizeLayout(state) {
+	const visit = (node) => {
+		if (node.kind === "leaf") return {
+			node,
+			changed: false
+		};
+		const first = visit(node.children[0]);
+		const second = visit(node.children[1]);
+		const ratio = Number.isFinite(node.ratio) ? Math.min(MAX_SPLIT_RATIO, Math.max(MIN_SPLIT_RATIO, node.ratio)) : 1 / 2;
+		const changed = first.changed || second.changed || ratio !== node.ratio;
+		return {
+			node: changed ? {
+				...node,
+				ratio,
+				children: [first.node, second.node]
+			} : node,
+			changed
+		};
+	};
+	const result = visit(state.center);
+	return result.changed ? {
+		...state,
+		center: result.node
+	} : state;
+}
+/** The leaf immediately after (`1`) or before (`-1`) the given leaf in reading order. */
+function neighborLeaf(state, leafId, step) {
+	const leaves = listLeaves(state.center);
+	const index = leaves.findIndex((leaf) => leaf.id === leafId);
+	if (index < 0) return void 0;
+	return leaves[index + step];
+}
+//#endregion
+export { MAX_LAYOUT_DEPTH, MAX_LAYOUT_LEAVES, MAX_SPLIT_RATIO, MIN_SPLIT_RATIO, closePane, countLeaves, createLayoutState, focusPane, layoutDepth, listLeaves, movePane, neighborLeaf, normalizeLayout, resizeSplit, splitPane, swapPanes, undoClosePane };
+
+//# sourceMappingURL=model.js.map

package/dist/components/layout/split-layout/model.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"model.js","names":[],"sources":["../../../../src/components/layout/split-layout/model.ts"],"sourcesContent":["/*\n * Copyright (c) 2026 Michael Yong\n * Copyright (c) 2026 Muxy\n * SPDX-License-Identifier: MIT\n *\n * Portions of the binary split behavior are substantially translated from:\n * - get-bb/bb apps/app/src/lib/split-layout/ops.ts (MIT), revision\n *   52a9256373d4d36f9b60e9e2a7f333464091a2ac.\n * - muxy-app/muxy Muxy/Models/Workspace/SplitNode.swift (MIT), revision\n *   5c5be8697c57a2fe70cda97fdbaf7c912e2e31b6.\n * Adapted first in Adea packages/dev-view/src/layout/operations.ts at\n * 0322ab09ff5e9775bfddc0bf2d81e1df436dbef7. Extracted here with opaque\n * host-owned leaves and an injected final-pane placeholder; immutable strict\n * binary operations, accepted limits and undoable close are preserved.\n * See NOTICE and docs/research/dev-view-donor-audit.md.\n */\n\n/** A visual identity only. Extend this with host-owned payload; UI never interprets it. */\nexport type SplitLayoutLeaf = Readonly<{ kind: 'leaf'; id: string }>\nexport type SplitLayoutBranch<L extends SplitLayoutLeaf = SplitLayoutLeaf> = Readonly<{\n  kind: 'split'\n  id: string\n  direction: 'row' | 'column'\n  ratio: number\n  children: readonly [SplitLayoutNode<L>, SplitLayoutNode<L>]\n}>\nexport type SplitLayoutNode<L extends SplitLayoutLeaf = SplitLayoutLeaf> = L | SplitLayoutBranch<L>\n\nexport const MAX_LAYOUT_LEAVES = 8\nexport const MAX_LAYOUT_DEPTH = 8\nexport const MIN_SPLIT_RATIO = 0.1\nexport const MAX_SPLIT_RATIO = 0.9\n\nexport type SplitLayoutState<L extends SplitLayoutLeaf = SplitLayoutLeaf> = Readonly<{\n  center: SplitLayoutNode<L>\n  focusedLeafId: string\n  closed: readonly Readonly<{ center: SplitLayoutNode<L>; leafId: string }>[]\n}>\n\nexport type SplitPaneInput<L extends SplitLayoutLeaf = SplitLayoutLeaf> = Readonly<{\n  direction: SplitLayoutBranch<L>['direction']\n  placement: 'before' | 'after'\n  leaf: L\n  splitId: string\n}>\n\nexport function listLeaves<L extends SplitLayoutLeaf>(node: SplitLayoutNode<L>): readonly L[] {\n  return node.kind === 'leaf'\n    ? [node]\n    : [...listLeaves(node.children[0]), ...listLeaves(node.children[1])]\n}\n\nexport function countLeaves<L extends SplitLayoutLeaf>(node: SplitLayoutNode<L>): number {\n  return node.kind === 'leaf' ? 1 : countLeaves(node.children[0]) + countLeaves(node.children[1])\n}\n\nexport function layoutDepth<L extends SplitLayoutLeaf>(node: SplitLayoutNode<L>): number {\n  return node.kind === 'leaf'\n    ? 1\n    : 1 + Math.max(layoutDepth(node.children[0]), layoutDepth(node.children[1]))\n}\n\nfunction replaceLeaf<L extends SplitLayoutLeaf>(\n  node: SplitLayoutNode<L>,\n  leafId: string,\n  replacement: SplitLayoutNode<L>\n): SplitLayoutNode<L> {\n  if (node.kind === 'leaf') return node.id === leafId ? replacement : node\n  const first = replaceLeaf(node.children[0], leafId, replacement)\n  const second = replaceLeaf(node.children[1], leafId, replacement)\n  return first === node.children[0] && second === node.children[1]\n    ? node\n    : { ...node, children: [first, second] }\n}\n\nfunction removeLeaf<L extends SplitLayoutLeaf>(\n  node: SplitLayoutNode<L>,\n  leafId: string\n): SplitLayoutNode<L> | null {\n  if (node.kind === 'leaf') return node.id === leafId ? null : node\n  const first = removeLeaf(node.children[0], leafId)\n  const second = removeLeaf(node.children[1], leafId)\n  if (!first) return second\n  if (!second) return first\n  return first === node.children[0] && second === node.children[1]\n    ? node\n    : { ...node, children: [first, second] }\n}\n\nfunction containsLeaf<L extends SplitLayoutLeaf>(\n  node: SplitLayoutNode<L>,\n  leafId: string\n): boolean {\n  return node.kind === 'leaf'\n    ? node.id === leafId\n    : containsLeaf(node.children[0], leafId) || containsLeaf(node.children[1], leafId)\n}\n\nfunction assertUniqueInput<L extends SplitLayoutLeaf>(\n  state: SplitLayoutState<L>,\n  leaf: L,\n  splitId: string\n) {\n  assertLayoutTree(leaf)\n  if (typeof splitId !== 'string' || splitId.length === 0)\n    throw new Error('invalid_state: split identity must be nonempty')\n  const ids = new Set<string>()\n  const visit = (node: SplitLayoutNode<L>) => {\n    if (ids.has(node.id)) throw new Error('invalid_state: duplicate pane id')\n    ids.add(node.id)\n    if (node.kind === 'split') node.children.forEach(visit)\n  }\n  visit(state.center)\n  if (ids.has(leaf.id) || ids.has(splitId) || leaf.id === splitId)\n    throw new Error('invalid_state: duplicate pane id')\n}\n\n/** Visual-tree validation only; applications still decode and scope persisted preferences. */\nfunction assertLayoutTree<L extends SplitLayoutLeaf>(center: SplitLayoutNode<L>): void {\n  const ids = new Set<string>()\n  const seen = new WeakSet<object>()\n  let leaves = 0\n  const visit = (node: SplitLayoutNode<L>, depth: number) => {\n    if (depth > MAX_LAYOUT_DEPTH) throw new Error('limit_exceeded: layout depth exceeds eight')\n    if (!node || typeof node !== 'object') throw new Error('invalid_state: missing layout node')\n    if (seen.has(node)) throw new Error('invalid_state: cyclic or reused layout node')\n    seen.add(node)\n    if (typeof node.id !== 'string' || node.id.length === 0)\n      throw new Error('invalid_state: layout identity must be nonempty')\n    if (ids.has(node.id)) throw new Error('invalid_state: duplicate pane id')\n    ids.add(node.id)\n    if (node.kind === 'leaf') {\n      leaves += 1\n      if (leaves > MAX_LAYOUT_LEAVES)\n        throw new Error('limit_exceeded: layout has more than eight leaves')\n      return\n    }\n    if (\n      node.kind !== 'split' ||\n      !Array.isArray(node.children) ||\n      node.children.length !== 2 ||\n      (node.direction !== 'row' && node.direction !== 'column')\n    )\n      throw new Error('invalid_state: layout must be a strict binary row or column tree')\n    visit(node.children[0], depth + 1)\n    visit(node.children[1], depth + 1)\n  }\n  visit(center, 1)\n}\n\nexport function createLayoutState<L extends SplitLayoutLeaf>(\n  center: SplitLayoutNode<L>\n): SplitLayoutState<L> {\n  assertLayoutTree(center)\n  const first = listLeaves(center)[0]\n  if (!first) throw new Error('invalid_state: layout requires a leaf')\n  return { center, focusedLeafId: first.id, closed: [] }\n}\n\nexport function splitPane<L extends SplitLayoutLeaf>(\n  state: SplitLayoutState<L>,\n  targetLeafId: string,\n  input: SplitPaneInput<L>\n): SplitLayoutState<L> {\n  if (!containsLeaf(state.center, targetLeafId)) return state\n  if (countLeaves(state.center) >= MAX_LAYOUT_LEAVES)\n    throw new Error('limit_exceeded: center layout has eight leaves')\n  assertUniqueInput(state, input.leaf, input.splitId)\n  const target = listLeaves(state.center).find((leaf) => leaf.id === targetLeafId)\n  if (!target) return state\n  const children =\n    input.placement === 'before' ? ([input.leaf, target] as const) : ([target, input.leaf] as const)\n  const center = replaceLeaf(state.center, targetLeafId, {\n    kind: 'split',\n    id: input.splitId,\n    direction: input.direction,\n    ratio: 0.5,\n    children,\n  })\n  if (layoutDepth(center) > MAX_LAYOUT_DEPTH)\n    throw new Error('limit_exceeded: center layout depth exceeds eight')\n  return { ...state, center, focusedLeafId: input.leaf.id, closed: [] }\n}\n\nexport function closePane<L extends SplitLayoutLeaf>(\n  state: SplitLayoutState<L>,\n  leafId: string,\n  createPlaceholderLeaf: () => L\n): SplitLayoutState<L> {\n  if (!containsLeaf(state.center, leafId)) return state\n  const before = state.center\n  const readingOrder = listLeaves(before)\n  const closedIndex = readingOrder.findIndex((leaf) => leaf.id === leafId)\n  const removed = removeLeaf(before, leafId)\n  const center: SplitLayoutNode<L> = removed ?? createPlaceholderLeaf()\n  if (!removed) {\n    if (center.kind !== 'leaf') throw new Error('invalid_state: placeholder must be a leaf')\n    assertLayoutTree(center)\n  }\n  const leaves = listLeaves(center)\n  const fallback = leaves[Math.min(closedIndex, leaves.length - 1)] ?? leaves[0]\n  if (!fallback) throw new Error('invalid_state: layout requires a leaf')\n  return {\n    center,\n    focusedLeafId: state.focusedLeafId === leafId ? fallback.id : state.focusedLeafId,\n    closed: [...state.closed, { center: before, leafId }],\n  }\n}\n\nexport function undoClosePane<L extends SplitLayoutLeaf>(\n  state: SplitLayoutState<L>\n): SplitLayoutState<L> {\n  const previous = state.closed.at(-1)\n  if (!previous) return state\n  return {\n    center: previous.center,\n    focusedLeafId: previous.leafId,\n    closed: state.closed.slice(0, -1),\n  }\n}\n\nexport function focusPane<L extends SplitLayoutLeaf>(\n  state: SplitLayoutState<L>,\n  leafId: string\n): SplitLayoutState<L> {\n  return containsLeaf(state.center, leafId) && state.focusedLeafId !== leafId\n    ? { ...state, focusedLeafId: leafId }\n    : state\n}\n\nexport function swapPanes<L extends SplitLayoutLeaf>(\n  state: SplitLayoutState<L>,\n  firstLeafId: string,\n  secondLeafId: string\n): SplitLayoutState<L> {\n  if (firstLeafId === secondLeafId) return state\n  const leaves = listLeaves(state.center)\n  const first = leaves.find((leaf) => leaf.id === firstLeafId)\n  const second = leaves.find((leaf) => leaf.id === secondLeafId)\n  if (!first || !second) return state\n  const swap = (node: SplitLayoutNode<L>): SplitLayoutNode<L> => {\n    if (node.kind === 'leaf') {\n      if (node.id === firstLeafId) return second\n      if (node.id === secondLeafId) return first\n      return node\n    }\n    const left = swap(node.children[0])\n    const right = swap(node.children[1])\n    return left === node.children[0] && right === node.children[1]\n      ? node\n      : { ...node, children: [left, right] }\n  }\n  return { ...state, center: swap(state.center), closed: [] }\n}\n\nexport function movePane<L extends SplitLayoutLeaf>(\n  state: SplitLayoutState<L>,\n  leafId: string,\n  targetLeafId: string,\n  placement: 'before' | 'after',\n  direction: SplitLayoutBranch<L>['direction'],\n  splitId: string\n): SplitLayoutState<L> {\n  if (leafId === targetLeafId) return state\n  const moving = listLeaves(state.center).find((leaf) => leaf.id === leafId)\n  if (!moving || !containsLeaf(state.center, targetLeafId)) return state\n  const detached = removeLeaf(state.center, leafId)\n  if (!detached) return state\n  const moved = splitPane(\n    { center: detached, focusedLeafId: state.focusedLeafId, closed: state.closed },\n    targetLeafId,\n    { direction, placement, leaf: moving, splitId }\n  )\n  return { ...moved, focusedLeafId: leafId }\n}\n\nexport function resizeSplit<L extends SplitLayoutLeaf>(\n  state: SplitLayoutState<L>,\n  splitId: string,\n  ratio: number\n): SplitLayoutState<L> {\n  if (!Number.isFinite(ratio)) return state\n  const nextRatio = Math.min(MAX_SPLIT_RATIO, Math.max(MIN_SPLIT_RATIO, ratio))\n  let found = false\n  const visit = (node: SplitLayoutNode<L>): SplitLayoutNode<L> => {\n    if (node.kind === 'leaf') return node\n    if (node.id === splitId) {\n      found = true\n      return node.ratio === nextRatio ? node : { ...node, ratio: nextRatio }\n    }\n    const first = visit(node.children[0])\n    const second = visit(node.children[1])\n    return first === node.children[0] && second === node.children[1]\n      ? node\n      : { ...node, children: [first, second] }\n  }\n  const center = visit(state.center)\n  return found && center !== state.center ? { ...state, center, closed: [] } : state\n}\n\n/**\n * Pure repair walk ported from bb's size normalization: every split ratio is\n * clamped into the normative range and a non-finite ratio falls back to an\n * even split. Structure, IDs, and focus are untouched.\n */\nexport function normalizeLayout<L extends SplitLayoutLeaf>(\n  state: SplitLayoutState<L>\n): SplitLayoutState<L> {\n  const visit = (node: SplitLayoutNode<L>): { node: SplitLayoutNode<L>; changed: boolean } => {\n    if (node.kind === 'leaf') return { node, changed: false }\n    const first = visit(node.children[0])\n    const second = visit(node.children[1])\n    const ratio = Number.isFinite(node.ratio)\n      ? Math.min(MAX_SPLIT_RATIO, Math.max(MIN_SPLIT_RATIO, node.ratio))\n      : (MIN_SPLIT_RATIO + MAX_SPLIT_RATIO) / 2\n    const changed = first.changed || second.changed || ratio !== node.ratio\n    return {\n      node: changed ? { ...node, ratio, children: [first.node, second.node] } : node,\n      changed,\n    }\n  }\n  const result = visit(state.center)\n  return result.changed ? { ...state, center: result.node } : state\n}\n\n/** The leaf immediately after (`1`) or before (`-1`) the given leaf in reading order. */\nexport function neighborLeaf<L extends SplitLayoutLeaf>(\n  state: SplitLayoutState<L>,\n  leafId: string,\n  step: 1 | -1\n): L | undefined {\n  const leaves = listLeaves(state.center)\n  const index = leaves.findIndex((leaf) => leaf.id === leafId)\n  if (index < 0) return undefined\n  return leaves[index + step]\n}\n"],"mappings":";AA4BA,IAAa,oBAAoB;AACjC,IAAa,mBAAmB;AAChC,IAAa,kBAAkB;AAC/B,IAAa,kBAAkB;AAe/B,SAAgB,WAAsC,MAAwC;CAC5F,OAAO,KAAK,SAAS,SACjB,CAAC,IAAI,IACL,CAAC,GAAG,WAAW,KAAK,SAAS,EAAE,GAAG,GAAG,WAAW,KAAK,SAAS,EAAE,CAAC;AACvE;AAEA,SAAgB,YAAuC,MAAkC;CACvF,OAAO,KAAK,SAAS,SAAS,IAAI,YAAY,KAAK,SAAS,EAAE,IAAI,YAAY,KAAK,SAAS,EAAE;AAChG;AAEA,SAAgB,YAAuC,MAAkC;CACvF,OAAO,KAAK,SAAS,SACjB,IACA,IAAI,KAAK,IAAI,YAAY,KAAK,SAAS,EAAE,GAAG,YAAY,KAAK,SAAS,EAAE,CAAC;AAC/E;AAEA,SAAS,YACP,MACA,QACA,aACoB;CACpB,IAAI,KAAK,SAAS,QAAQ,OAAO,KAAK,OAAO,SAAS,cAAc;CACpE,MAAM,QAAQ,YAAY,KAAK,SAAS,IAAI,QAAQ,WAAW;CAC/D,MAAM,SAAS,YAAY,KAAK,SAAS,IAAI,QAAQ,WAAW;CAChE,OAAO,UAAU,KAAK,SAAS,MAAM,WAAW,KAAK,SAAS,KAC1D,OACA;EAAE,GAAG;EAAM,UAAU,CAAC,OAAO,MAAM;CAAE;AAC3C;AAEA,SAAS,WACP,MACA,QAC2B;CAC3B,IAAI,KAAK,SAAS,QAAQ,OAAO,KAAK,OAAO,SAAS,OAAO;CAC7D,MAAM,QAAQ,WAAW,KAAK,SAAS,IAAI,MAAM;CACjD,MAAM,SAAS,WAAW,KAAK,SAAS,IAAI,MAAM;CAClD,IAAI,CAAC,OAAO,OAAO;CACnB,IAAI,CAAC,QAAQ,OAAO;CACpB,OAAO,UAAU,KAAK,SAAS,MAAM,WAAW,KAAK,SAAS,KAC1D,OACA;EAAE,GAAG;EAAM,UAAU,CAAC,OAAO,MAAM;CAAE;AAC3C;AAEA,SAAS,aACP,MACA,QACS;CACT,OAAO,KAAK,SAAS,SACjB,KAAK,OAAO,SACZ,aAAa,KAAK,SAAS,IAAI,MAAM,KAAK,aAAa,KAAK,SAAS,IAAI,MAAM;AACrF;AAEA,SAAS,kBACP,OACA,MACA,SACA;CACA,iBAAiB,IAAI;CACrB,IAAI,OAAO,YAAY,YAAY,QAAQ,WAAW,GACpD,MAAM,IAAI,MAAM,gDAAgD;CAClE,MAAM,sBAAM,IAAI,IAAY;CAC5B,MAAM,SAAS,SAA6B;EAC1C,IAAI,IAAI,IAAI,KAAK,EAAE,GAAG,MAAM,IAAI,MAAM,kCAAkC;EACxE,IAAI,IAAI,KAAK,EAAE;EACf,IAAI,KAAK,SAAS,SAAS,KAAK,SAAS,QAAQ,KAAK;CACxD;CACA,MAAM,MAAM,MAAM;CAClB,IAAI,IAAI,IAAI,KAAK,EAAE,KAAK,IAAI,IAAI,OAAO,KAAK,KAAK,OAAO,SACtD,MAAM,IAAI,MAAM,kCAAkC;AACtD;;AAGA,SAAS,iBAA4C,QAAkC;CACrF,MAAM,sBAAM,IAAI,IAAY;CAC5B,MAAM,uBAAO,IAAI,QAAgB;CACjC,IAAI,SAAS;CACb,MAAM,SAAS,MAA0B,UAAkB;EACzD,IAAI,QAAA,GAA0B,MAAM,IAAI,MAAM,4CAA4C;EAC1F,IAAI,CAAC,QAAQ,OAAO,SAAS,UAAU,MAAM,IAAI,MAAM,oCAAoC;EAC3F,IAAI,KAAK,IAAI,IAAI,GAAG,MAAM,IAAI,MAAM,6CAA6C;EACjF,KAAK,IAAI,IAAI;EACb,IAAI,OAAO,KAAK,OAAO,YAAY,KAAK,GAAG,WAAW,GACpD,MAAM,IAAI,MAAM,iDAAiD;EACnE,IAAI,IAAI,IAAI,KAAK,EAAE,GAAG,MAAM,IAAI,MAAM,kCAAkC;EACxE,IAAI,IAAI,KAAK,EAAE;EACf,IAAI,KAAK,SAAS,QAAQ;GACxB,UAAU;GACV,IAAI,SAAA,GACF,MAAM,IAAI,MAAM,mDAAmD;GACrE;EACF;EACA,IACE,KAAK,SAAS,WACd,CAAC,MAAM,QAAQ,KAAK,QAAQ,KAC5B,KAAK,SAAS,WAAW,KACxB,KAAK,cAAc,SAAS,KAAK,cAAc,UAEhD,MAAM,IAAI,MAAM,kEAAkE;EACpF,MAAM,KAAK,SAAS,IAAI,QAAQ,CAAC;EACjC,MAAM,KAAK,SAAS,IAAI,QAAQ,CAAC;CACnC;CACA,MAAM,QAAQ,CAAC;AACjB;AAEA,SAAgB,kBACd,QACqB;CACrB,iBAAiB,MAAM;CACvB,MAAM,QAAQ,WAAW,MAAM,CAAC,CAAC;CACjC,IAAI,CAAC,OAAO,MAAM,IAAI,MAAM,uCAAuC;CACnE,OAAO;EAAE;EAAQ,eAAe,MAAM;EAAI,QAAQ,CAAC;CAAE;AACvD;AAEA,SAAgB,UACd,OACA,cACA,OACqB;CACrB,IAAI,CAAC,aAAa,MAAM,QAAQ,YAAY,GAAG,OAAO;CACtD,IAAI,YAAY,MAAM,MAAM,KAAA,GAC1B,MAAM,IAAI,MAAM,gDAAgD;CAClE,kBAAkB,OAAO,MAAM,MAAM,MAAM,OAAO;CAClD,MAAM,SAAS,WAAW,MAAM,MAAM,CAAC,CAAC,MAAM,SAAS,KAAK,OAAO,YAAY;CAC/E,IAAI,CAAC,QAAQ,OAAO;CACpB,MAAM,WACJ,MAAM,cAAc,WAAY,CAAC,MAAM,MAAM,MAAM,IAAe,CAAC,QAAQ,MAAM,IAAI;CACvF,MAAM,SAAS,YAAY,MAAM,QAAQ,cAAc;EACrD,MAAM;EACN,IAAI,MAAM;EACV,WAAW,MAAM;EACjB,OAAO;EACP;CACF,CAAC;CACD,IAAI,YAAY,MAAM,IAAA,GACpB,MAAM,IAAI,MAAM,mDAAmD;CACrE,OAAO;EAAE,GAAG;EAAO;EAAQ,eAAe,MAAM,KAAK;EAAI,QAAQ,CAAC;CAAE;AACtE;AAEA,SAAgB,UACd,OACA,QACA,uBACqB;CACrB,IAAI,CAAC,aAAa,MAAM,QAAQ,MAAM,GAAG,OAAO;CAChD,MAAM,SAAS,MAAM;CAErB,MAAM,cADe,WAAW,MACZ,CAAA,CAAa,WAAW,SAAS,KAAK,OAAO,MAAM;CACvE,MAAM,UAAU,WAAW,QAAQ,MAAM;CACzC,MAAM,SAA6B,WAAW,sBAAsB;CACpE,IAAI,CAAC,SAAS;EACZ,IAAI,OAAO,SAAS,QAAQ,MAAM,IAAI,MAAM,2CAA2C;EACvF,iBAAiB,MAAM;CACzB;CACA,MAAM,SAAS,WAAW,MAAM;CAChC,MAAM,WAAW,OAAO,KAAK,IAAI,aAAa,OAAO,SAAS,CAAC,MAAM,OAAO;CAC5E,IAAI,CAAC,UAAU,MAAM,IAAI,MAAM,uCAAuC;CACtE,OAAO;EACL;EACA,eAAe,MAAM,kBAAkB,SAAS,SAAS,KAAK,MAAM;EACpE,QAAQ,CAAC,GAAG,MAAM,QAAQ;GAAE,QAAQ;GAAQ;EAAO,CAAC;CACtD;AACF;AAEA,SAAgB,cACd,OACqB;CACrB,MAAM,WAAW,MAAM,OAAO,GAAG,EAAE;CACnC,IAAI,CAAC,UAAU,OAAO;CACtB,OAAO;EACL,QAAQ,SAAS;EACjB,eAAe,SAAS;EACxB,QAAQ,MAAM,OAAO,MAAM,GAAG,EAAE;CAClC;AACF;AAEA,SAAgB,UACd,OACA,QACqB;CACrB,OAAO,aAAa,MAAM,QAAQ,MAAM,KAAK,MAAM,kBAAkB,SACjE;EAAE,GAAG;EAAO,eAAe;CAAO,IAClC;AACN;AAEA,SAAgB,UACd,OACA,aACA,cACqB;CACrB,IAAI,gBAAgB,cAAc,OAAO;CACzC,MAAM,SAAS,WAAW,MAAM,MAAM;CACtC,MAAM,QAAQ,OAAO,MAAM,SAAS,KAAK,OAAO,WAAW;CAC3D,MAAM,SAAS,OAAO,MAAM,SAAS,KAAK,OAAO,YAAY;CAC7D,IAAI,CAAC,SAAS,CAAC,QAAQ,OAAO;CAC9B,MAAM,QAAQ,SAAiD;EAC7D,IAAI,KAAK,SAAS,QAAQ;GACxB,IAAI,KAAK,OAAO,aAAa,OAAO;GACpC,IAAI,KAAK,OAAO,cAAc,OAAO;GACrC,OAAO;EACT;EACA,MAAM,OAAO,KAAK,KAAK,SAAS,EAAE;EAClC,MAAM,QAAQ,KAAK,KAAK,SAAS,EAAE;EACnC,OAAO,SAAS,KAAK,SAAS,MAAM,UAAU,KAAK,SAAS,KACxD,OACA;GAAE,GAAG;GAAM,UAAU,CAAC,MAAM,KAAK;EAAE;CACzC;CACA,OAAO;EAAE,GAAG;EAAO,QAAQ,KAAK,MAAM,MAAM;EAAG,QAAQ,CAAC;CAAE;AAC5D;AAEA,SAAgB,SACd,OACA,QACA,cACA,WACA,WACA,SACqB;CACrB,IAAI,WAAW,cAAc,OAAO;CACpC,MAAM,SAAS,WAAW,MAAM,MAAM,CAAC,CAAC,MAAM,SAAS,KAAK,OAAO,MAAM;CACzE,IAAI,CAAC,UAAU,CAAC,aAAa,MAAM,QAAQ,YAAY,GAAG,OAAO;CACjE,MAAM,WAAW,WAAW,MAAM,QAAQ,MAAM;CAChD,IAAI,CAAC,UAAU,OAAO;CAMtB,OAAO;EAAE,GALK,UACZ;GAAE,QAAQ;GAAU,eAAe,MAAM;GAAe,QAAQ,MAAM;EAAO,GAC7E,cACA;GAAE;GAAW;GAAW,MAAM;GAAQ;EAAQ,CAEpC;EAAO,eAAe;CAAO;AAC3C;AAEA,SAAgB,YACd,OACA,SACA,OACqB;CACrB,IAAI,CAAC,OAAO,SAAS,KAAK,GAAG,OAAO;CACpC,MAAM,YAAY,KAAK,IAAI,iBAAiB,KAAK,IAAI,iBAAiB,KAAK,CAAC;CAC5E,IAAI,QAAQ;CACZ,MAAM,SAAS,SAAiD;EAC9D,IAAI,KAAK,SAAS,QAAQ,OAAO;EACjC,IAAI,KAAK,OAAO,SAAS;GACvB,QAAQ;GACR,OAAO,KAAK,UAAU,YAAY,OAAO;IAAE,GAAG;IAAM,OAAO;GAAU;EACvE;EACA,MAAM,QAAQ,MAAM,KAAK,SAAS,EAAE;EACpC,MAAM,SAAS,MAAM,KAAK,SAAS,EAAE;EACrC,OAAO,UAAU,KAAK,SAAS,MAAM,WAAW,KAAK,SAAS,KAC1D,OACA;GAAE,GAAG;GAAM,UAAU,CAAC,OAAO,MAAM;EAAE;CAC3C;CACA,MAAM,SAAS,MAAM,MAAM,MAAM;CACjC,OAAO,SAAS,WAAW,MAAM,SAAS;EAAE,GAAG;EAAO;EAAQ,QAAQ,CAAC;CAAE,IAAI;AAC/E;;;;;;AAOA,SAAgB,gBACd,OACqB;CACrB,MAAM,SAAS,SAA6E;EAC1F,IAAI,KAAK,SAAS,QAAQ,OAAO;GAAE;GAAM,SAAS;EAAM;EACxD,MAAM,QAAQ,MAAM,KAAK,SAAS,EAAE;EACpC,MAAM,SAAS,MAAM,KAAK,SAAS,EAAE;EACrC,MAAM,QAAQ,OAAO,SAAS,KAAK,KAAK,IACpC,KAAK,IAAI,iBAAiB,KAAK,IAAI,iBAAiB,KAAK,KAAK,CAAC,IAC9D,IAAqC;EAC1C,MAAM,UAAU,MAAM,WAAW,OAAO,WAAW,UAAU,KAAK;EAClE,OAAO;GACL,MAAM,UAAU;IAAE,GAAG;IAAM;IAAO,UAAU,CAAC,MAAM,MAAM,OAAO,IAAI;GAAE,IAAI;GAC1E;EACF;CACF;CACA,MAAM,SAAS,MAAM,MAAM,MAAM;CACjC,OAAO,OAAO,UAAU;EAAE,GAAG;EAAO,QAAQ,OAAO;CAAK,IAAI;AAC9D;;AAGA,SAAgB,aACd,OACA,QACA,MACe;CACf,MAAM,SAAS,WAAW,MAAM,MAAM;CACtC,MAAM,QAAQ,OAAO,WAAW,SAAS,KAAK,OAAO,MAAM;CAC3D,IAAI,QAAQ,GAAG,OAAO,KAAA;CACtB,OAAO,OAAO,QAAQ;AACxB"}

package/dist/components/layout/split-layout/split-layout.d.ts

@@ -0,0 +1,30 @@
+import { type Accessor, type JSX } from 'solid-js';
+import { type PaneDropIntent } from './drop';
+export type { PaneDropIntent } from './drop';
+import { type SplitLayoutBranch, type SplitLayoutLeaf, type SplitLayoutState } from './model';
+export type SplitLayoutProps<L extends SplitLayoutLeaf> = {
+    state: SplitLayoutState<L>;
+    label: string;
+    /** Accessible name for a pane region and its close button. */
+    labelForLeaf: (leaf: L) => string;
+    /** Called once per stable leaf owner; the accessor tracks opaque payload replacement. */
+    renderLeaf: (leaf: Accessor<L>) => JSX.Element;
+    /** Inline visible header composition, separate from the region and close-button name. */
+    renderPaneLabel?: (leaf: Accessor<L>) => JSX.Element;
+    /** Whether pane regions participate in sequential keyboard navigation; defaults to programmatic focus only. */
+    paneTabIndex?: 0 | -1;
+    /** Accessible splitter name; defaults to the current orientation-specific label. */
+    labelForSeparator?: (branch: SplitLayoutBranch<L>) => string;
+    onResize: (splitId: string, ratio: number) => void;
+    onFocus?: (leafId: string) => void;
+    /** Host performs the model transition and returns the surviving focus destination. */
+    onClose?: (leafId: string) => string | undefined;
+    /** Pointer placement only; the host supplies keyboard commands and performs the model transition. */
+    onMove?: (leafId: string, targetId: string, intent: PaneDropIntent) => void;
+    /** Stable header composition for host-owned keyboard actions/capability feedback. */
+    renderPaneActions?: (leaf: Accessor<L>) => JSX.Element;
+    class?: string;
+};
+/** Muxy frame geometry keeps leaf owners stable; Corvu owns constrained separator interactions. */
+export declare function SplitLayout<L extends SplitLayoutLeaf>(props: SplitLayoutProps<L>): JSX.Element;
+//# sourceMappingURL=split-layout.d.ts.map

package/dist/components/layout/split-layout/split-layout.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"split-layout.d.ts","sourceRoot":"","sources":["../../../../src/components/layout/split-layout/split-layout.tsx"],"names":[],"mappings":"AACA,OAAO,EAQL,KAAK,QAAQ,EACb,KAAK,GAAG,EACT,MAAM,UAAU,CAAA;AAKjB,OAAO,EAAkB,KAAK,cAAc,EAAE,MAAM,QAAQ,CAAA;AAC5D,YAAY,EAAE,cAAc,EAAE,MAAM,QAAQ,CAAA;AAE5C,OAAO,EAIL,KAAK,iBAAiB,EACtB,KAAK,eAAe,EACpB,KAAK,gBAAgB,EACtB,MAAM,SAAS,CAAA;AAEhB,MAAM,MAAM,gBAAgB,CAAC,CAAC,SAAS,eAAe,IAAI;IACxD,KAAK,EAAE,gBAAgB,CAAC,CAAC,CAAC,CAAA;IAC1B,KAAK,EAAE,MAAM,CAAA;IACb,8DAA8D;IAC9D,YAAY,EAAE,CAAC,IAAI,EAAE,CAAC,KAAK,MAAM,CAAA;IACjC,yFAAyF;IACzF,UAAU,EAAE,CAAC,IAAI,EAAE,QAAQ,CAAC,CAAC,CAAC,KAAK,GAAG,CAAC,OAAO,CAAA;IAC9C,yFAAyF;IACzF,eAAe,CAAC,EAAE,CAAC,IAAI,EAAE,QAAQ,CAAC,CAAC,CAAC,KAAK,GAAG,CAAC,OAAO,CAAA;IACpD,+GAA+G;IAC/G,YAAY,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,CAAA;IACrB,oFAAoF;IACpF,iBAAiB,CAAC,EAAE,CAAC,MAAM,EAAE,iBAAiB,CAAC,CAAC,CAAC,KAAK,MAAM,CAAA;IAC5D,QAAQ,EAAE,CAAC,OAAO,EAAE,MAAM,EAAE,KAAK,EAAE,MAAM,KAAK,IAAI,CAAA;IAClD,OAAO,CAAC,EAAE,CAAC,MAAM,EAAE,MAAM,KAAK,IAAI,CAAA;IAClC,sFAAsF;IACtF,OAAO,CAAC,EAAE,CAAC,MAAM,EAAE,MAAM,KAAK,MAAM,GAAG,SAAS,CAAA;IAChD,qGAAqG;IACrG,MAAM,CAAC,EAAE,CAAC,MAAM,EAAE,MAAM,EAAE,QAAQ,EAAE,MAAM,EAAE,MAAM,EAAE,cAAc,KAAK,IAAI,CAAA;IAC3E,qFAAqF;IACrF,iBAAiB,CAAC,EAAE,CAAC,IAAI,EAAE,QAAQ,CAAC,CAAC,CAAC,KAAK,GAAG,CAAC,OAAO,CAAA;IACtD,KAAK,CAAC,EAAE,MAAM,CAAA;CACf,CAAA;AASD,mGAAmG;AACnG,wBAAgB,WAAW,CAAC,CAAC,SAAS,eAAe,EAAE,KAAK,EAAE,gBAAgB,CAAC,CAAC,CAAC,eA6RhF"}