@weasel-js/core 1.15.0 → 1.15.1

package/dist/core/scene/lockGuard.js

@@ -1,6 +1,6 @@
 import { isNodeHidden, isNodeLocked, nodeGates } from "./nodeGates.js";
 
-//#region src/core/scene/lockGuard.ts
+// src/core/scene/lockGuard.ts
 /**
 * The scene's lock guard: what a lock refuses, what the selection may hold,
 * and how a caller that is restoring an already-legal state gets past it.
@@ -47,6 +47,5 @@ function createLockGuard(state) {
 	};
 }
 
-//#endregion
 export { createLockGuard };
 //# sourceMappingURL=lockGuard.js.map

package/dist/core/scene/minSize.js

@@ -1,4 +1,4 @@
-//#region src/core/scene/minSize.ts
+// src/core/scene/minSize.ts
 /** A node's minimum, from `data.minSize`, or `null` when it has none. A
 *  side that is not a positive number holds nothing. */
 function minSizeOf(data) {
@@ -12,6 +12,5 @@ function minSizeOf(data) {
 	} : null;
 }
 
-//#endregion
 export { minSizeOf };
 //# sourceMappingURL=minSize.js.map

package/dist/core/scene/nestedHit.js

@@ -2,7 +2,7 @@ import { worldPoseLookup } from "./composePose.js";
 import { poseDescriptorForNode } from "../geometry/poseDescriptor.js";
 import { AUTO_POSE_DESCRIPTOR } from "../geometry/autoPoseDescriptor.js";
 
-//#region src/core/scene/nestedHit.ts
+// src/core/scene/nestedHit.ts
 /** Build hit-testers that respect containers: a plain click selects the
 *  top-level ancestor, and alt-clicking descends one level at a time toward
 *  the leaf actually under the pointer. */
@@ -49,6 +49,5 @@ function nestedHitTester(adapter, opts) {
 	};
 }
 
-//#endregion
 export { nestedHitTester };
 //# sourceMappingURL=nestedHit.js.map

package/dist/core/scene/nodeAsShown.js

@@ -1,4 +1,4 @@
-//#region src/core/scene/nodeAsShown.ts
+// src/core/scene/nodeAsShown.ts
 /** Marks a node whose data is already shown. An own enumerable key, so a spread
 *  of the node (`{ ...node, pose }`) carries it, and applying an override to a
 *  copy of a shown node is a no-op however the copy was made. */
@@ -67,6 +67,5 @@ function nodesAsShown(overrides, nodes) {
 	return held.any ? nodes.map((node) => nodeAsShown(overrides, node)) : nodes;
 }
 
-//#endregion
 export { nodeAsShown, nodesAsShown, shownCopyOf, shownLookup, withShownData };
 //# sourceMappingURL=nodeAsShown.js.map

package/dist/core/scene/nodeFlags.js

@@ -1,4 +1,4 @@
-//#region src/core/scene/nodeFlags.ts
+// src/core/scene/nodeFlags.ts
 /** Stored only while set, so a snapshot of an unflagged node carries neither. */
 function write(node, flag, to) {
 	if (to) node[flag] = true;
@@ -44,6 +44,5 @@ function createNodeFlags(env) {
 	};
 }
 
-//#endregion
 export { createNodeFlags };
 //# sourceMappingURL=nodeFlags.js.map

package/dist/core/scene/nodeFnFields.js

@@ -1,4 +1,4 @@
-//#region src/core/scene/nodeFnFields.ts
+// src/core/scene/nodeFnFields.ts
 var NODE_FN_FIELDS = [
 	{
 		field: "clipFromPose",
@@ -93,6 +93,5 @@ function fnFieldsOfNode(node) {
 	return out;
 }
 
-//#endregion
 export { NODE_FN_FIELDS, createNodeFnFields, fnFieldsOfNode, fnKeysOf, restoreFn };
 //# sourceMappingURL=nodeFnFields.js.map

package/dist/core/scene/nodeGates.js

@@ -1,4 +1,4 @@
-//#region src/core/scene/nodeGates.ts
+// src/core/scene/nodeGates.ts
 /** Whether `node`'s own flag hides it and its subtree. A walk from the roots
 *  down prunes where this holds instead of asking {@link NodeGates.hidden}
 *  per node; the two agree because this is the flag that answer climbs for. */
@@ -102,6 +102,5 @@ function isNodeLocked(scene, id) {
 	return climbs(scene, id, layers === null ? (node) => node.locked === true : (node) => node.locked === true || layers.has(node.layer));
 }
 
-//#endregion
 export { hidesSubtree, isNodeHidden, isNodeLocked, nodeGates };
 //# sourceMappingURL=nodeGates.js.map

package/dist/core/scene/nodeMemo.js

@@ -1,4 +1,4 @@
-//#region src/core/scene/nodeMemo.ts
+// src/core/scene/nodeMemo.ts
 function createNodeMemoScope() {
 	return /* @__PURE__ */ new WeakMap();
 }
@@ -114,6 +114,5 @@ function dropPoseKeyedMemoSlots(node) {
 	for (const [slot, entry] of record.slots) if (entry.pose !== void 0) record.slots.delete(slot);
 }
 
-//#endregion
 export { bumpNodeMemoGeneration, createNodeMemoScope, dropPoseKeyedMemoSlots, nodeMemo, nodeMemoGeneration };
 //# sourceMappingURL=nodeMemo.js.map

package/dist/core/scene/nodeStore.js

@@ -1,10 +1,10 @@
+import { dwarn } from "../../debug/flag.js";
 import { createDependentsIndex } from "./dependents.js";
 import { dropPoseKeyedMemoSlots } from "./nodeMemo.js";
-import { dwarn } from "../../debug/flag.js";
 import { restoreFn } from "./nodeFnFields.js";
 import { SceneMembershipError } from "./staleReplay.js";
 
-//#region src/core/scene/nodeStore.ts
+// src/core/scene/nodeStore.ts
 /**
 * The scene's node store: the tree links, the reverse index of who derives
 * from whom, and the function fields a node carries beside its data.
@@ -200,6 +200,5 @@ function createNodeStore(state, invalidateOrder, fnFields) {
 	};
 }
 
-//#endregion
 export { createNodeStore };
 //# sourceMappingURL=nodeStore.js.map

package/dist/core/scene/notifier.js

@@ -1,6 +1,6 @@
 import { createEmitter } from "@weasel-js/registry";
 
-//#region src/core/scene/notifier.ts
+// src/core/scene/notifier.ts
 function createNotifier() {
 	const changed = createEmitter();
 	let version = 0;
@@ -43,6 +43,5 @@ function createNotifier() {
 	};
 }
 
-//#endregion
 export { createNotifier };
 //# sourceMappingURL=notifier.js.map

package/dist/core/scene/opTable.js

@@ -1,4 +1,4 @@
-//#region src/core/scene/opTable.ts
+// src/core/scene/opTable.ts
 function createOpTable(env) {
 	const handlers = /* @__PURE__ */ new Map();
 	function handlerFor(kind) {
@@ -51,6 +51,5 @@ function createOpTable(env) {
 	};
 }
 
-//#endregion
 export { createOpTable };
 //# sourceMappingURL=opTable.js.map

package/dist/core/scene/outerOps.js

@@ -1,7 +1,7 @@
 import { rebuildOp } from "../ops/registry.js";
 import { bindOpToAdapter, bindOpToHistoryAdapter } from "./boundOps.js";
 
-//#region src/core/scene/outerOps.ts
+// src/core/scene/outerOps.ts
 /** A kit op under the key of the outer op that caused it, so two edits merge
 *  when their outer ops would have. */
 function keyed(kit, outerKey) {
@@ -68,6 +68,5 @@ function createOuterOps(env) {
 	};
 }
 
-//#endregion
 export { createOuterOps };
 //# sourceMappingURL=outerOps.js.map

package/dist/core/scene/pathEffects/blend.js

@@ -1,7 +1,7 @@
 import { boundsOfPath, measurePath, multiply, prepareBlend, rotate, rotatePathAround, transformPath, translate } from "@weasel-js/geom";
 import { lerpFill, lerpStroke } from "@weasel-js/paint";
 
-//#region src/core/scene/pathEffects/blend.ts
+// src/core/scene/pathEffects/blend.ts
 /**
 * A blend's steps: where each sits between its two sources — evenly by
 * count, or a fixed distance apart — and, with a spine, laid along it.
@@ -75,6 +75,5 @@ function blendParts(effect, a, b, spine) {
 	});
 }
 
-//#endregion
 export { blendParts, blendStations };
 //# sourceMappingURL=blend.js.map

package/dist/core/scene/pathEffects/derive.js

@@ -1,10 +1,10 @@
+import { derivedPartsOf, pathFromParts } from "../derivedParts.js";
 import { fontGeneration, noteFontRead, withFontReads } from "../fontReads.js";
 import { samePoseValue, snapshotPose } from "../poseSnapshot.js";
-import { derivedPartsOf, pathFromParts } from "../derivedParts.js";
 import { effectParts } from "./effects.js";
 import { boundsOfPath } from "@weasel-js/geom";
 
-//#region src/core/scene/pathEffects/derive.ts
+// src/core/scene/pathEffects/derive.ts
 /**
 * A path effect as a scene node: a leaf whose `dependsOn` names its sources,
 * whose `data.pathEffect` says what to make of them, and whose path and pose
@@ -113,6 +113,5 @@ function registeredPathEffects(registry) {
 	} : null;
 }
 
-//#endregion
 export { PATH_EFFECT, createPathEffectDerivations, pathEffectNode, pathEffectOf, pathEffectParts, registeredPathEffects };
 //# sourceMappingURL=derive.js.map

package/dist/core/scene/pathEffects/effects.js

@@ -2,7 +2,7 @@ import { blendParts } from "./blend.js";
 import { textAlongParts, wholeItem } from "./textAlong.js";
 import { bendAlongPath, puckerBloatPath, repeatAlongPath, roughenPath, zigzagPath } from "@weasel-js/geom";
 
-//#region src/core/scene/pathEffects/effects.ts
+// src/core/scene/pathEffects/effects.ts
 /**
 * The path effects, each as the parts it paints from its sources: a blend's
 * steps between two shapes, a shape bent along a spine, copies of a shape
@@ -56,6 +56,5 @@ function effectParts(effect, sources) {
 	}
 }
 
-//#endregion
 export { effectParts };
 //# sourceMappingURL=effects.js.map

package/dist/core/scene/pathEffects/foundHidden.js

@@ -1,6 +1,6 @@
 import { pathEffectOf } from "./derive.js";
 
-//#region src/core/scene/pathEffects/foundHidden.ts
+// src/core/scene/pathEffects/foundHidden.ts
 /**
 * A path effect's `foundHidden` names its sources by position, so a retarget
 * of its `dependsOn` carries the record along: every writer of `dependsOn`
@@ -30,6 +30,5 @@ function foundHiddenRetargeted(data, from, to) {
 	};
 }
 
-//#endregion
 export { foundHiddenRetargeted };
 //# sourceMappingURL=foundHidden.js.map

package/dist/core/scene/pathEffects/textAlong.js

@@ -1,7 +1,7 @@
 import { bandParts } from "./textAlongBands.js";
 import { boundsOfPath, multiply, pathShape, placeAlongRun, rotate, runLength, trackRun, transformPath, translate } from "@weasel-js/geom";
 
-//#region src/core/scene/pathEffects/textAlong.ts
+// src/core/scene/pathEffects/textAlong.ts
 /**
 * Text along a path: a source's items — a text node's grapheme clusters, or a
 * whole shape as one item — laid end to end along a path, each turned to it.
@@ -103,6 +103,5 @@ function itemFrame(place, length, lift) {
 var clamp01 = (v) => v > 1 ? 1 : v > 0 ? v : 0;
 var finiteOr = (v, d) => v !== void 0 && Number.isFinite(v) ? v : d;
 
-//#endregion
 export { textAlongParts, wholeItem };
 //# sourceMappingURL=textAlong.js.map

package/dist/core/scene/pathEffects/textAlongBands.js

@@ -1,6 +1,6 @@
 import { polygonFromPoints, runStationAt } from "@weasel-js/geom";
 
-//#region src/core/scene/pathEffects/textAlongBands.ts
+// src/core/scene/pathEffects/textAlongBands.ts
 /**
 * The bands text along a path carries — decoration rules cut into clusters — joined across neighboring items and drawn
 * as ribbons that bend with the path.
@@ -60,6 +60,5 @@ function ribbonPart(r, run, shift) {
 	};
 }
 
-//#endregion
 export { bandParts };
 //# sourceMappingURL=textAlongBands.js.map

package/dist/core/scene/plyStacks.js

@@ -1,6 +1,6 @@
 import { carryBoxPath } from "./depFrame.js";
 
-//#region src/core/scene/plyStacks.ts
+// src/core/scene/plyStacks.ts
 /** Empty stacks. */
 function createPlyStacks() {
 	const plies = /* @__PURE__ */ new Map();
@@ -84,6 +84,5 @@ function plyPath(stack, pose, held) {
 	}
 }
 
-//#endregion
 export { createPlyStacks, plyPath };
 //# sourceMappingURL=plyStacks.js.map

package/dist/core/scene/poseFeed.js

@@ -1,7 +1,7 @@
 import { effectivePose } from "./effectivePose.js";
 import { createEmitter } from "@weasel-js/registry";
 
-//#region src/core/scene/poseFeed.ts
+// src/core/scene/poseFeed.ts
 var EMPTY = Object.freeze([]);
 /** A {@link PoseFeed} over `scene`, reporting effective poses (committed pose
 *  under any override). The first `read()` is a reset listing every node. */
@@ -117,6 +117,5 @@ function createPoseFeed(scene) {
 	};
 }
 
-//#endregion
 export { createPoseFeed };
 //# sourceMappingURL=poseFeed.js.map

package/dist/core/scene/poseHold.js

@@ -1,4 +1,4 @@
-//#region src/core/scene/poseHold.ts
+// src/core/scene/poseHold.ts
 /** Build the {@link PoseHold} a table hands out from `hold()`. `pliesOf`
 *  answers a node's plies, bottom first. */
 function createPoseHold(table, pliesOf) {
@@ -61,6 +61,5 @@ function* mapped(poses) {
 	for (const [id, pose] of poses) yield [id, { pose }];
 }
 
-//#endregion
 export { createPoseHold };
 //# sourceMappingURL=poseHold.js.map

package/dist/core/scene/poseOverrides.js

@@ -5,7 +5,7 @@ import { foldPlies } from "./posePlies.js";
 import { createPlyStacks, plyPath } from "./plyStacks.js";
 import { createEmitter } from "@weasel-js/registry";
 
-//#region src/core/scene/poseOverrides.ts
+// src/core/scene/poseOverrides.ts
 /**
 * Build a {@link PoseOverrides} map.
 *
@@ -105,6 +105,5 @@ function createPoseOverrides(getNode, onInvalidate) {
 	return table;
 }
 
-//#endregion
 export { createPoseOverrides };
 //# sourceMappingURL=poseOverrides.js.map

package/dist/core/scene/posePlies.js

@@ -1,6 +1,6 @@
 import { kit, last, mix, mul, patch } from "@msb235/blits";
 
-//#region src/core/scene/posePlies.ts
+// src/core/scene/posePlies.ts
 /** What a ply says about a node with fewer plies than its depth. */
 var NOTHING = Object.freeze({});
 /** Per lower function, per upper one, the two run in turn: kept, so a node
@@ -54,6 +54,5 @@ function foldPlies(plies) {
 	};
 }
 
-//#endregion
 export { foldPlies };
 //# sourceMappingURL=posePlies.js.map

package/dist/core/scene/poseRemovals.js

@@ -1,4 +1,4 @@
-//#region src/core/scene/poseRemovals.ts
+// src/core/scene/poseRemovals.ts
 function createRemovalLog(shown) {
 	const removals = /* @__PURE__ */ new Map();
 	return {
@@ -54,6 +54,5 @@ function createRemovalLog(shown) {
 	};
 }
 
-//#endregion
 export { createRemovalLog };
 //# sourceMappingURL=poseRemovals.js.map

package/dist/core/scene/poseSnapshot.js

@@ -1,6 +1,6 @@
 import { isPlainObject, isPlainPrototype } from "../isPlainObject.js";
 
-//#region src/core/scene/poseSnapshot.ts
+// src/core/scene/poseSnapshot.ts
 /**
 * Comparing a pose against what it was, by value.
 *
@@ -70,6 +70,5 @@ function samePoseValue(snapshot, value, depth = DEPTH) {
 	return false;
 }
 
-//#endregion
 export { samePoseValue, snapshotPose };
 //# sourceMappingURL=poseSnapshot.js.map

package/dist/core/scene/poseWrites.js

@@ -1,7 +1,7 @@
 import { createRemovalLog } from "./poseRemovals.js";
 import { createEmitter, deepEqual } from "@weasel-js/registry";
 
-//#region src/core/scene/poseWrites.ts
+// src/core/scene/poseWrites.ts
 /**
 * What a scene reports about the poses it writes: each change's net pose per
 * node, the nodes it removed as they were last shown, and where each came
@@ -147,6 +147,5 @@ function createPoseWriteLog(env) {
 	};
 }
 
-//#endregion
 export { createPoseWriteLog };
 //# sourceMappingURL=poseWrites.js.map

package/dist/core/scene/reconcileSpecs.js

@@ -1,6 +1,6 @@
 import { sameValue } from "./sameValue.js";
 
-//#region src/core/scene/reconcileSpecs.ts
+// src/core/scene/reconcileSpecs.ts
 /**
 * Bring `scene` from `prev` to `next`: add what `next` gained, remove what it
 * lost, and write only the fields that changed between the two.
@@ -11,7 +11,9 @@ import { sameValue } from "./sameValue.js";
 * outside data is not an undo step.
 *
 * Every spec needs an `id`, and `next` must be in an order `createScene` would
-* accept — parents and dependencies before what names them. A node whose
+* accept — parents and dependencies before what names them. Siblings stand in
+* `next`'s order wherever a parent's children in it differ from `prev`'s, by an
+* addition or a reorder; elsewhere a reorder made in the scene stays. A node whose
 * `kind` or derive functions change is removed and added again, along with
 * everything its removal takes with it, and stays selected if it was.
 */
@@ -47,9 +49,31 @@ function reconcileSpecs(scene, prev, next) {
 			if (spec.hidden === true !== (before.hidden === true)) scene.setHidden(id, spec.hidden === true);
 			if (spec.locked === true && before.locked !== true) scene.setLocked(id, true);
 		}
+		reorderToSpecs(scene, prev, next);
 		if (selected.some((id) => removed.has(id))) scene.setSelection(selected.filter((id) => scene.get(id) !== void 0));
 	});
 }
+/** Each parent whose spec children `next` lists differently from `prev` gets
+*  them in `next`'s order, in the slots they hold among its children now, so
+*  a child no spec names keeps its place. */
+function reorderToSpecs(scene, prev, next) {
+	const before = childLists(prev);
+	for (const [parent, wanted] of childLists(next)) {
+		if (sameValue(wanted, before.get(parent))) continue;
+		const named = new Set(wanted);
+		const siblings = parent === null ? scene.roots : scene.childrenOf(parent);
+		const slots = siblings.flatMap((id, i) => named.has(id) ? [i] : []);
+		wanted.filter((id) => siblings.includes(id)).forEach((id, k) => scene.reorder(id, slots[k]));
+	}
+}
+function childLists(specs) {
+	const out = /* @__PURE__ */ new Map();
+	for (const spec of specs) {
+		const parent = spec.parent ?? null;
+		out.set(parent, [...out.get(parent) ?? [], spec.id]);
+	}
+	return out;
+}
 function byId(specs) {
 	const out = /* @__PURE__ */ new Map();
 	for (const spec of specs) {
@@ -63,6 +87,5 @@ function needsReplace(a, b) {
 	return a.kind !== b.kind || a.pickable !== b.pickable || a.consumesChildren !== b.consumesChildren || a.derivePath !== b.derivePath || a.derivePose !== b.derivePose || a.clipFromPose !== b.clipFromPose || a.copiesFromPose !== b.copiesFromPose || a.layout !== b.layout;
 }
 
-//#endregion
 export { reconcileSpecs };
 //# sourceMappingURL=reconcileSpecs.js.map

package/dist/core/scene/reconcileSpecs.js.map

@@ -1 +1 @@
-{"version":3,"file":"reconcileSpecs.js","names":["same"],"sources":["../../../src/core/scene/reconcileSpecs.ts"],"sourcesContent":["import { sameValue as same } from './sameValue';\nimport type { AddNodeSpec, NodeId, Scene } from './types';\n\n/**\n * Bring `scene` from `prev` to `next`: add what `next` gained, remove what it\n * lost, and write only the fields that changed between the two.\n *\n * The diff is spec against spec, not spec against scene, so whatever the scene\n * did since `prev` — a node dragged, an edge authored by a gesture — survives\n * unless `next` changes that same field. The writes are untracked: syncing to\n * outside data is not an undo step.\n *\n * Every spec needs an `id`, and `next` must be in an order `createScene` would\n * accept — parents and dependencies before what names them. A node whose\n * `kind` or derive functions change is removed and added again, along with\n * everything its removal takes with it, and stays selected if it was.\n */\nexport function reconcileSpecs<TData, TLayer extends string, TPose>(\n  scene: Scene<TData, TLayer, TPose>,\n  prev: readonly AddNodeSpec<TData, TLayer, TPose>[],\n  next: readonly AddNodeSpec<TData, TLayer, TPose>[],\n): void {\n  const prevById = byId(prev);\n  const nextById = byId(next);\n  const gone: NodeId[] = [];\n  for (const [id, before] of prevById) {\n    const after = nextById.get(id);\n    if (after === undefined || needsReplace(before, after)) gone.push(id);\n  }\n  const removing = scene.removalClosure(gone.filter((id) => scene.get(id) !== undefined));\n  const removed = new Set(removing);\n\n  // A replaced node is the same node to whoever selected it.\n  const selected = scene.getSelection();\n\n  scene.untracked(() => {\n    scene.removeMany(removing);\n    for (const spec of next) {\n      const id = spec.id!;\n      const before = prevById.get(id);\n      if (scene.get(id) === undefined || before === undefined || removed.has(id)) {\n        scene.add(spec);\n        continue;\n      }\n      // An unlock goes first and a lock last, so the writes between can land.\n      if (before.locked === true && spec.locked !== true) scene.setLocked(id, false);\n      const parent = spec.parent ?? null;\n      if (parent !== (before.parent ?? null)) scene.move(id, parent);\n      if (spec.layer !== before.layer) scene.setLayer(id, spec.layer);\n      if (!same(spec.data, before.data)) scene.update(id, { data: spec.data });\n      if (!same(spec.dependsOn, before.dependsOn)) scene.setDependsOn(id, spec.dependsOn);\n      if (!same(spec.units, before.units)) scene.setUnits(id, spec.units ?? null);\n      if (spec.clip !== before.clip) scene.setClip(id, spec.clip ?? null);\n      if (!same(spec.pose, before.pose)) scene.setPose(id, spec.pose);\n      if ((spec.hidden === true) !== (before.hidden === true)) scene.setHidden(id, spec.hidden === true);\n      if (spec.locked === true && before.locked !== true) scene.setLocked(id, true);\n    }\n    if (selected.some((id) => removed.has(id))) {\n      scene.setSelection(selected.filter((id) => scene.get(id) !== undefined));\n    }\n  });\n}\n\nfunction byId<T extends { id?: NodeId }>(specs: readonly T[]): Map<NodeId, T> {\n  const out = new Map<NodeId, T>();\n  for (const spec of specs) {\n    if (spec.id === undefined) throw new Error('reconcileSpecs: every spec needs an id');\n    if (out.has(spec.id)) throw new Error(`reconcileSpecs: id \"${spec.id}\" appears more than once`);\n    out.set(spec.id, spec);\n  }\n  return out;\n}\n\nfunction needsReplace<TData, TLayer extends string, TPose>(\n  a: AddNodeSpec<TData, TLayer, TPose>,\n  b: AddNodeSpec<TData, TLayer, TPose>,\n): boolean {\n  return a.kind !== b.kind\n    || a.pickable !== b.pickable\n    || a.consumesChildren !== b.consumesChildren\n    || a.derivePath !== b.derivePath\n    || a.derivePose !== b.derivePose\n    || a.clipFromPose !== b.clipFromPose\n    || a.copiesFromPose !== b.copiesFromPose\n    || a.layout !== b.layout;\n}\n"],"mappings":";;;;;;;;;;;;;;;;;AAiBA,SAAgB,eACd,OACA,MACA,MACM;CACN,MAAM,WAAW,KAAK,IAAI;CAC1B,MAAM,WAAW,KAAK,IAAI;CAC1B,MAAM,OAAiB,CAAC;CACxB,KAAK,MAAM,CAAC,IAAI,WAAW,UAAU;EACnC,MAAM,QAAQ,SAAS,IAAI,EAAE;EAC7B,IAAI,UAAU,UAAa,aAAa,QAAQ,KAAK,GAAG,KAAK,KAAK,EAAE;CACtE;CACA,MAAM,WAAW,MAAM,eAAe,KAAK,QAAQ,OAAO,MAAM,IAAI,EAAE,MAAM,MAAS,CAAC;CACtF,MAAM,UAAU,IAAI,IAAI,QAAQ;CAGhC,MAAM,WAAW,MAAM,aAAa;CAEpC,MAAM,gBAAgB;EACpB,MAAM,WAAW,QAAQ;EACzB,KAAK,MAAM,QAAQ,MAAM;GACvB,MAAM,KAAK,KAAK;GAChB,MAAM,SAAS,SAAS,IAAI,EAAE;GAC9B,IAAI,MAAM,IAAI,EAAE,MAAM,UAAa,WAAW,UAAa,QAAQ,IAAI,EAAE,GAAG;IAC1E,MAAM,IAAI,IAAI;IACd;GACF;GAEA,IAAI,OAAO,WAAW,QAAQ,KAAK,WAAW,MAAM,MAAM,UAAU,IAAI,KAAK;GAC7E,MAAM,SAAS,KAAK,UAAU;GAC9B,IAAI,YAAY,OAAO,UAAU,OAAO,MAAM,KAAK,IAAI,MAAM;GAC7D,IAAI,KAAK,UAAU,OAAO,OAAO,MAAM,SAAS,IAAI,KAAK,KAAK;GAC9D,IAAI,CAACA,UAAK,KAAK,MAAM,OAAO,IAAI,GAAG,MAAM,OAAO,IAAI,EAAE,MAAM,KAAK,KAAK,CAAC;GACvE,IAAI,CAACA,UAAK,KAAK,WAAW,OAAO,SAAS,GAAG,MAAM,aAAa,IAAI,KAAK,SAAS;GAClF,IAAI,CAACA,UAAK,KAAK,OAAO,OAAO,KAAK,GAAG,MAAM,SAAS,IAAI,KAAK,SAAS,IAAI;GAC1E,IAAI,KAAK,SAAS,OAAO,MAAM,MAAM,QAAQ,IAAI,KAAK,QAAQ,IAAI;GAClE,IAAI,CAACA,UAAK,KAAK,MAAM,OAAO,IAAI,GAAG,MAAM,QAAQ,IAAI,KAAK,IAAI;GAC9D,IAAK,KAAK,WAAW,UAAW,OAAO,WAAW,OAAO,MAAM,UAAU,IAAI,KAAK,WAAW,IAAI;GACjG,IAAI,KAAK,WAAW,QAAQ,OAAO,WAAW,MAAM,MAAM,UAAU,IAAI,IAAI;EAC9E;EACA,IAAI,SAAS,MAAM,OAAO,QAAQ,IAAI,EAAE,CAAC,GACvC,MAAM,aAAa,SAAS,QAAQ,OAAO,MAAM,IAAI,EAAE,MAAM,MAAS,CAAC;CAE3E,CAAC;AACH;AAEA,SAAS,KAAgC,OAAqC;CAC5E,MAAM,sBAAM,IAAI,IAAe;CAC/B,KAAK,MAAM,QAAQ,OAAO;EACxB,IAAI,KAAK,OAAO,QAAW,MAAM,IAAI,MAAM,wCAAwC;EACnF,IAAI,IAAI,IAAI,KAAK,EAAE,GAAG,MAAM,IAAI,MAAM,uBAAuB,KAAK,GAAG,yBAAyB;EAC9F,IAAI,IAAI,KAAK,IAAI,IAAI;CACvB;CACA,OAAO;AACT;AAEA,SAAS,aACP,GACA,GACS;CACT,OAAO,EAAE,SAAS,EAAE,QACf,EAAE,aAAa,EAAE,YACjB,EAAE,qBAAqB,EAAE,oBACzB,EAAE,eAAe,EAAE,cACnB,EAAE,eAAe,EAAE,cACnB,EAAE,iBAAiB,EAAE,gBACrB,EAAE,mBAAmB,EAAE,kBACvB,EAAE,WAAW,EAAE;AACtB"}
+{"version":3,"file":"reconcileSpecs.js","names":["same"],"sources":["../../../src/core/scene/reconcileSpecs.ts"],"sourcesContent":["import { sameValue as same } from './sameValue';\nimport type { AddNodeSpec, NodeId, Scene } from './types';\n\n/**\n * Bring `scene` from `prev` to `next`: add what `next` gained, remove what it\n * lost, and write only the fields that changed between the two.\n *\n * The diff is spec against spec, not spec against scene, so whatever the scene\n * did since `prev` — a node dragged, an edge authored by a gesture — survives\n * unless `next` changes that same field. The writes are untracked: syncing to\n * outside data is not an undo step.\n *\n * Every spec needs an `id`, and `next` must be in an order `createScene` would\n * accept — parents and dependencies before what names them. Siblings stand in\n * `next`'s order wherever a parent's children in it differ from `prev`'s, by an\n * addition or a reorder; elsewhere a reorder made in the scene stays. A node whose\n * `kind` or derive functions change is removed and added again, along with\n * everything its removal takes with it, and stays selected if it was.\n */\nexport function reconcileSpecs<TData, TLayer extends string, TPose>(\n  scene: Scene<TData, TLayer, TPose>,\n  prev: readonly AddNodeSpec<TData, TLayer, TPose>[],\n  next: readonly AddNodeSpec<TData, TLayer, TPose>[],\n): void {\n  const prevById = byId(prev);\n  const nextById = byId(next);\n  const gone: NodeId[] = [];\n  for (const [id, before] of prevById) {\n    const after = nextById.get(id);\n    if (after === undefined || needsReplace(before, after)) gone.push(id);\n  }\n  const removing = scene.removalClosure(gone.filter((id) => scene.get(id) !== undefined));\n  const removed = new Set(removing);\n\n  // A replaced node is the same node to whoever selected it.\n  const selected = scene.getSelection();\n\n  scene.untracked(() => {\n    scene.removeMany(removing);\n    for (const spec of next) {\n      const id = spec.id!;\n      const before = prevById.get(id);\n      if (scene.get(id) === undefined || before === undefined || removed.has(id)) {\n        scene.add(spec);\n        continue;\n      }\n      // An unlock goes first and a lock last, so the writes between can land.\n      if (before.locked === true && spec.locked !== true) scene.setLocked(id, false);\n      const parent = spec.parent ?? null;\n      if (parent !== (before.parent ?? null)) scene.move(id, parent);\n      if (spec.layer !== before.layer) scene.setLayer(id, spec.layer);\n      if (!same(spec.data, before.data)) scene.update(id, { data: spec.data });\n      if (!same(spec.dependsOn, before.dependsOn)) scene.setDependsOn(id, spec.dependsOn);\n      if (!same(spec.units, before.units)) scene.setUnits(id, spec.units ?? null);\n      if (spec.clip !== before.clip) scene.setClip(id, spec.clip ?? null);\n      if (!same(spec.pose, before.pose)) scene.setPose(id, spec.pose);\n      if ((spec.hidden === true) !== (before.hidden === true)) scene.setHidden(id, spec.hidden === true);\n      if (spec.locked === true && before.locked !== true) scene.setLocked(id, true);\n    }\n    reorderToSpecs(scene, prev, next);\n    if (selected.some((id) => removed.has(id))) {\n      scene.setSelection(selected.filter((id) => scene.get(id) !== undefined));\n    }\n  });\n}\n\n/** Each parent whose spec children `next` lists differently from `prev` gets\n *  them in `next`'s order, in the slots they hold among its children now, so\n *  a child no spec names keeps its place. */\nfunction reorderToSpecs<TData, TLayer extends string, TPose>(\n  scene: Scene<TData, TLayer, TPose>,\n  prev: readonly AddNodeSpec<TData, TLayer, TPose>[],\n  next: readonly AddNodeSpec<TData, TLayer, TPose>[],\n): void {\n  const before = childLists(prev);\n  for (const [parent, wanted] of childLists(next)) {\n    if (same(wanted, before.get(parent))) continue;\n    const named = new Set(wanted);\n    const siblings = parent === null ? scene.roots : scene.childrenOf(parent);\n    const slots = siblings.flatMap((id, i) => (named.has(id) ? [i] : []));\n    const order = wanted.filter((id) => siblings.includes(id));\n    // Filling the slots left to right, each move leaves every earlier slot as it should end.\n    order.forEach((id, k) => scene.reorder(id, slots[k]!));\n  }\n}\n\nfunction childLists<T extends { id?: NodeId; parent?: NodeId | null }>(specs: readonly T[]): Map<NodeId | null, NodeId[]> {\n  const out = new Map<NodeId | null, NodeId[]>();\n  for (const spec of specs) {\n    const parent = spec.parent ?? null;\n    out.set(parent, [...(out.get(parent) ?? []), spec.id!]);\n  }\n  return out;\n}\n\nfunction byId<T extends { id?: NodeId }>(specs: readonly T[]): Map<NodeId, T> {\n  const out = new Map<NodeId, T>();\n  for (const spec of specs) {\n    if (spec.id === undefined) throw new Error('reconcileSpecs: every spec needs an id');\n    if (out.has(spec.id)) throw new Error(`reconcileSpecs: id \"${spec.id}\" appears more than once`);\n    out.set(spec.id, spec);\n  }\n  return out;\n}\n\nfunction needsReplace<TData, TLayer extends string, TPose>(\n  a: AddNodeSpec<TData, TLayer, TPose>,\n  b: AddNodeSpec<TData, TLayer, TPose>,\n): boolean {\n  return a.kind !== b.kind\n    || a.pickable !== b.pickable\n    || a.consumesChildren !== b.consumesChildren\n    || a.derivePath !== b.derivePath\n    || a.derivePose !== b.derivePose\n    || a.clipFromPose !== b.clipFromPose\n    || a.copiesFromPose !== b.copiesFromPose\n    || a.layout !== b.layout;\n}\n"],"mappings":";;;;;;;;;;;;;;;;;;;AAmBA,SAAgB,eACd,OACA,MACA,MACM;CACN,MAAM,WAAW,KAAK,IAAI;CAC1B,MAAM,WAAW,KAAK,IAAI;CAC1B,MAAM,OAAiB,CAAC;CACxB,KAAK,MAAM,CAAC,IAAI,WAAW,UAAU;EACnC,MAAM,QAAQ,SAAS,IAAI,EAAE;EAC7B,IAAI,UAAU,UAAa,aAAa,QAAQ,KAAK,GAAG,KAAK,KAAK,EAAE;CACtE;CACA,MAAM,WAAW,MAAM,eAAe,KAAK,QAAQ,OAAO,MAAM,IAAI,EAAE,MAAM,MAAS,CAAC;CACtF,MAAM,UAAU,IAAI,IAAI,QAAQ;CAGhC,MAAM,WAAW,MAAM,aAAa;CAEpC,MAAM,gBAAgB;EACpB,MAAM,WAAW,QAAQ;EACzB,KAAK,MAAM,QAAQ,MAAM;GACvB,MAAM,KAAK,KAAK;GAChB,MAAM,SAAS,SAAS,IAAI,EAAE;GAC9B,IAAI,MAAM,IAAI,EAAE,MAAM,UAAa,WAAW,UAAa,QAAQ,IAAI,EAAE,GAAG;IAC1E,MAAM,IAAI,IAAI;IACd;GACF;GAEA,IAAI,OAAO,WAAW,QAAQ,KAAK,WAAW,MAAM,MAAM,UAAU,IAAI,KAAK;GAC7E,MAAM,SAAS,KAAK,UAAU;GAC9B,IAAI,YAAY,OAAO,UAAU,OAAO,MAAM,KAAK,IAAI,MAAM;GAC7D,IAAI,KAAK,UAAU,OAAO,OAAO,MAAM,SAAS,IAAI,KAAK,KAAK;GAC9D,IAAI,CAACA,UAAK,KAAK,MAAM,OAAO,IAAI,GAAG,MAAM,OAAO,IAAI,EAAE,MAAM,KAAK,KAAK,CAAC;GACvE,IAAI,CAACA,UAAK,KAAK,WAAW,OAAO,SAAS,GAAG,MAAM,aAAa,IAAI,KAAK,SAAS;GAClF,IAAI,CAACA,UAAK,KAAK,OAAO,OAAO,KAAK,GAAG,MAAM,SAAS,IAAI,KAAK,SAAS,IAAI;GAC1E,IAAI,KAAK,SAAS,OAAO,MAAM,MAAM,QAAQ,IAAI,KAAK,QAAQ,IAAI;GAClE,IAAI,CAACA,UAAK,KAAK,MAAM,OAAO,IAAI,GAAG,MAAM,QAAQ,IAAI,KAAK,IAAI;GAC9D,IAAK,KAAK,WAAW,UAAW,OAAO,WAAW,OAAO,MAAM,UAAU,IAAI,KAAK,WAAW,IAAI;GACjG,IAAI,KAAK,WAAW,QAAQ,OAAO,WAAW,MAAM,MAAM,UAAU,IAAI,IAAI;EAC9E;EACA,eAAe,OAAO,MAAM,IAAI;EAChC,IAAI,SAAS,MAAM,OAAO,QAAQ,IAAI,EAAE,CAAC,GACvC,MAAM,aAAa,SAAS,QAAQ,OAAO,MAAM,IAAI,EAAE,MAAM,MAAS,CAAC;CAE3E,CAAC;AACH;;;;AAKA,SAAS,eACP,OACA,MACA,MACM;CACN,MAAM,SAAS,WAAW,IAAI;CAC9B,KAAK,MAAM,CAAC,QAAQ,WAAW,WAAW,IAAI,GAAG;EAC/C,IAAIA,UAAK,QAAQ,OAAO,IAAI,MAAM,CAAC,GAAG;EACtC,MAAM,QAAQ,IAAI,IAAI,MAAM;EAC5B,MAAM,WAAW,WAAW,OAAO,MAAM,QAAQ,MAAM,WAAW,MAAM;EACxE,MAAM,QAAQ,SAAS,SAAS,IAAI,MAAO,MAAM,IAAI,EAAE,IAAI,CAAC,CAAC,IAAI,CAAC,CAAE;EAGpE,AAFc,OAAO,QAAQ,OAAO,SAAS,SAAS,EAAE,CAExD,CAAA,CAAM,SAAS,IAAI,MAAM,MAAM,QAAQ,IAAI,MAAM,EAAG,CAAC;CACvD;AACF;AAEA,SAAS,WAA8D,OAAmD;CACxH,MAAM,sBAAM,IAAI,IAA6B;CAC7C,KAAK,MAAM,QAAQ,OAAO;EACxB,MAAM,SAAS,KAAK,UAAU;EAC9B,IAAI,IAAI,QAAQ,CAAC,GAAI,IAAI,IAAI,MAAM,KAAK,CAAC,GAAI,KAAK,EAAG,CAAC;CACxD;CACA,OAAO;AACT;AAEA,SAAS,KAAgC,OAAqC;CAC5E,MAAM,sBAAM,IAAI,IAAe;CAC/B,KAAK,MAAM,QAAQ,OAAO;EACxB,IAAI,KAAK,OAAO,QAAW,MAAM,IAAI,MAAM,wCAAwC;EACnF,IAAI,IAAI,IAAI,KAAK,EAAE,GAAG,MAAM,IAAI,MAAM,uBAAuB,KAAK,GAAG,yBAAyB;EAC9F,IAAI,IAAI,KAAK,IAAI,IAAI;CACvB;CACA,OAAO;AACT;AAEA,SAAS,aACP,GACA,GACS;CACT,OAAO,EAAE,SAAS,EAAE,QACf,EAAE,aAAa,EAAE,YACjB,EAAE,qBAAqB,EAAE,oBACzB,EAAE,eAAe,EAAE,cACnB,EAAE,eAAe,EAAE,cACnB,EAAE,iBAAiB,EAAE,gBACrB,EAAE,mBAAmB,EAAE,kBACvB,EAAE,WAAW,EAAE;AACtB"}

package/dist/core/scene/recorder.js

@@ -1,6 +1,6 @@
 import { bindOpToAdapter } from "./boundOps.js";
 
-//#region src/core/scene/recorder.ts
+// src/core/scene/recorder.ts
 /** Take back ops that wrote outside the scene, newest first. The scene's own
 *  writes are reverted by the applied log. */
 function unwind(outer) {
@@ -123,6 +123,5 @@ function createRecorder(env) {
 	};
 }
 
-//#endregion
 export { createRecorder };
 //# sourceMappingURL=recorder.js.map

package/dist/core/scene/renderOrder.js

@@ -1,6 +1,6 @@
 import { hasChildren } from "./treeShape.js";
 
-//#region src/core/scene/renderOrder.ts
+// src/core/scene/renderOrder.ts
 /**
 * A scene's render order: its nodes layer-major, each layer in tree preorder,
 * cached until the structure changes.
@@ -131,6 +131,5 @@ function createRenderOrder(state) {
 	};
 }
 
-//#endregion
 export { createRenderOrder };
 //# sourceMappingURL=renderOrder.js.map

package/dist/core/scene/sameValue.js

@@ -1,6 +1,6 @@
 import { isPlainObject } from "../isPlainObject.js";
 
-//#region src/core/scene/sameValue.ts
+// src/core/scene/sameValue.ts
 /** Structural equality over plain objects and arrays; anything else by identity. */
 function sameValue(a, b) {
 	if (Object.is(a, b)) return true;
@@ -12,6 +12,5 @@ function sameValue(a, b) {
 	return false;
 }
 
-//#endregion
 export { sameValue };
 //# sourceMappingURL=sameValue.js.map

package/dist/core/scene/scene.js

@@ -1,24 +1,24 @@
-import { RIGID_POSE_COMPOSITION } from "./composePose.js";
-import { effectivePose } from "./effectivePose.js";
-import { createScrollOffsets } from "./scrollOffsets.js";
-import { asNodeId } from "./types.js";
-import { documentReads, sceneMutators } from "./sceneMutators.js";
 import { withKitRegistry } from "./kitRegistry.js";
 import { createPoseOverrides } from "./poseOverrides.js";
+import { createScrollOffsets } from "./scrollOffsets.js";
 import { createArrivalWindow } from "./arrivalWindow.js";
+import { documentReads, sceneMutators } from "./sceneMutators.js";
 import { createNotifier } from "./notifier.js";
 import { sceneChanges } from "./sceneChanges.js";
 import { createPoseWriteLog } from "./poseWrites.js";
+import { effectivePose } from "./effectivePose.js";
 import { createEditMode } from "./editMode.js";
-import { resolveLayoutFrame, runLayoutPass } from "./layoutPass.js";
-import { systemLayerRecord } from "./layerStack.js";
 import { createSceneEdits } from "./sceneEdits.js";
 import { createSceneRecording } from "./sceneRecording.js";
 import { createSceneSelection } from "./sceneSelection.js";
-import { layerFromSerialized, specsFromSerialized } from "./serialization.js";
 import { createSceneState } from "./sceneState.js";
+import { systemLayerRecord } from "./layerStack.js";
+import { layerFromSerialized, specsFromSerialized } from "./serialization.js";
+import { resolveLayoutFrame, runLayoutPass } from "./layoutPass.js";
+import { RIGID_POSE_COMPOSITION } from "./composePose.js";
+import { asNodeId } from "./types.js";
 
-//#region src/core/scene/scene.ts
+// src/core/scene/scene.ts
 /** A node still in `scene`, with the pose it is shown at. */
 function shownNode(scene, id) {
 	const node = scene.get(id);
@@ -59,7 +59,7 @@ function buildScene(options, layers, initialNodes, initialDoc) {
 		writePose
 	});
 	const generateId = options.generateId ?? defaultGenerateId;
-	const selection = createSceneSelection(locks.reachable);
+	const selection = createSceneSelection(locks.reachable, (id) => state.nodes.get(id)?.parent);
 	selection.subscribe(notifier.notify);
 	/** Ephemeral, deliberately not part of `state`: not document content, never in `toJSON` or history. */
 	const overrides = createPoseOverrides((id) => state.nodes.get(id), doc.store.invalidateDependents);
@@ -133,7 +133,7 @@ function buildScene(options, layers, initialNodes, initialDoc) {
 			doc.reset(json.systemLayers.map(layerFromSerialized), json.doc);
 			recording.clearHistory();
 			poseWrites.quiet(() => edits.construct(specs));
-			selection.replace(locks.reachable(selection.get().filter((id) => state.nodes.has(id))));
+			selection.replace(selection.legal(selection.get().filter((id) => state.nodes.has(id))));
 			notifier.notify();
 		},
 		...sceneChanges(notifier, selection)
@@ -154,6 +154,5 @@ function sceneFromJSON(json, options = {}) {
 	return buildScene(options, json.systemLayers.map(layerFromSerialized), (registry) => specsFromSerialized(json, registry, options), json.doc);
 }
 
-//#endregion
 export { createScene, sceneFromJSON };
 //# sourceMappingURL=scene.js.map