@weasel-js/core 1.13.0 → 1.14.1

package/dist/core/scene/layerOps.js

@@ -0,0 +1,82 @@
+//#region src/core/scene/layerOps.ts
+function setParallax(record, to) {
+	if (to === void 0) delete record.parallax;
+	else record.parallax = to;
+}
+/** Register the layer op kinds against `env`'s layer stack. */
+function registerLayerOps(env) {
+	const { state, requireLayerIndex, rebuildLayerIndex } = env;
+	function registerKitOp(kind, handler) {
+		env.register(kind, handler);
+	}
+	registerKitOp("kit:setLayerVisible", {
+		apply: (p) => {
+			state.layers[requireLayerIndex(p.layer)].visible = p.to;
+			if (!p.to) env.narrowSelection();
+		},
+		revert: (p) => {
+			state.layers[requireLayerIndex(p.layer)].visible = p.from;
+		}
+	});
+	registerKitOp("kit:setLayerLocked", {
+		apply: (p) => {
+			state.layers[requireLayerIndex(p.layer)].locked = p.to;
+			if (p.to) env.narrowSelection();
+		},
+		revert: (p) => {
+			state.layers[requireLayerIndex(p.layer)].locked = p.from;
+		}
+	});
+	registerKitOp("kit:setLayerParallax", {
+		apply: (p) => {
+			setParallax(state.layers[requireLayerIndex(p.layer)], p.to);
+		},
+		revert: (p) => {
+			setParallax(state.layers[requireLayerIndex(p.layer)], p.from);
+		}
+	});
+	registerKitOp("kit:addLayer", {
+		apply: (p) => {
+			state.layers.splice(p.index, 0, { ...p.record });
+			rebuildLayerIndex();
+		},
+		revert: (p) => {
+			state.layers.splice(p.index, 1);
+			rebuildLayerIndex();
+		}
+	});
+	registerKitOp("kit:removeLayer", {
+		apply: (p) => {
+			state.layers.splice(p.index, 1);
+			rebuildLayerIndex();
+		},
+		revert: (p) => {
+			state.layers.splice(p.index, 0, { ...p.record });
+			rebuildLayerIndex();
+		}
+	});
+	registerKitOp("kit:renameLayer", {
+		apply: (p) => {
+			state.layers[requireLayerIndex(p.layer)].name = p.to;
+		},
+		revert: (p) => {
+			state.layers[requireLayerIndex(p.layer)].name = p.from;
+		}
+	});
+	/** Finds the layer by id, not by where the payload last left it: moves of
+	*  one layer coalesce, and the entry then reverts the first payload from
+	*  wherever the last one put the layer. */
+	function placeLayer(layer, index) {
+		const [rec] = state.layers.splice(requireLayerIndex(layer), 1);
+		state.layers.splice(index, 0, rec);
+		rebuildLayerIndex();
+	}
+	registerKitOp("kit:moveLayer", {
+		apply: (p) => placeLayer(p.layer, p.to),
+		revert: (p) => placeLayer(p.layer, p.from)
+	});
+}
+
+//#endregion
+export { registerLayerOps };
+//# sourceMappingURL=layerOps.js.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"layerOps.js","names":[],"sources":["../../../src/core/scene/layerOps.ts"],"sourcesContent":["/**\n * The kit's layer op kinds: visibility, lock, parallax, and adding, removing,\n * renaming, and moving a layer.\n */\nimport type { ParallaxOpts } from 'core/viewport/parallax';\nimport type { KitOpsEnv } from './kitOps';\nimport type { LayerRecord, RegisteredOp, UserLayerRecord } from './types';\n\nfunction setParallax(record: { parallax?: ParallaxOpts }, to: ParallaxOpts | undefined): void {\n  if (to === undefined) delete record.parallax;\n  else record.parallax = to;\n}\n\n/** Register the layer op kinds against `env`'s layer stack. */\nexport function registerLayerOps<TData, TLayer extends string, TPose>(\n  env: Pick<KitOpsEnv<TData, TLayer, TPose>, 'state' | 'register' | 'requireLayerIndex' | 'rebuildLayerIndex' | 'narrowSelection'>,\n): void {\n  const { state, requireLayerIndex, rebuildLayerIndex } = env;\n  function registerKitOp<P>(kind: string, handler: RegisteredOp<P>): void {\n    env.register(kind, handler as RegisteredOp<unknown>);\n  }\n\n  registerKitOp<{ layer: TLayer; from: boolean; to: boolean }>('kit:setLayerVisible', {\n    apply: (p) => { state.layers[requireLayerIndex(p.layer)].visible = p.to; if (!p.to) env.narrowSelection(); },\n    revert: (p) => { state.layers[requireLayerIndex(p.layer)].visible = p.from; },\n  });\n\n  registerKitOp<{ layer: TLayer; from: boolean; to: boolean }>('kit:setLayerLocked', {\n    apply: (p) => { state.layers[requireLayerIndex(p.layer)].locked = p.to; if (p.to) env.narrowSelection(); },\n    revert: (p) => { state.layers[requireLayerIndex(p.layer)].locked = p.from; },\n  });\n\n  registerKitOp<{ layer: TLayer; from?: ParallaxOpts; to?: ParallaxOpts }>('kit:setLayerParallax', {\n    apply: (p) => { setParallax(state.layers[requireLayerIndex(p.layer)], p.to); },\n    revert: (p) => { setParallax(state.layers[requireLayerIndex(p.layer)], p.from); },\n  });\n\n  registerKitOp<{ record: UserLayerRecord<TLayer>; index: number }>('kit:addLayer', {\n    apply: (p) => { state.layers.splice(p.index, 0, { ...p.record }); rebuildLayerIndex(); },\n    revert: (p) => { state.layers.splice(p.index, 1); rebuildLayerIndex(); },\n  });\n\n  registerKitOp<{ record: LayerRecord<TLayer>; index: number }>('kit:removeLayer', {\n    apply: (p) => { state.layers.splice(p.index, 1); rebuildLayerIndex(); },\n    revert: (p) => { state.layers.splice(p.index, 0, { ...p.record } as LayerRecord<TLayer>); rebuildLayerIndex(); },\n  });\n\n  registerKitOp<{ layer: TLayer; from: string; to: string }>('kit:renameLayer', {\n    apply: (p) => { (state.layers[requireLayerIndex(p.layer)] as UserLayerRecord<TLayer>).name = p.to; },\n    revert: (p) => { (state.layers[requireLayerIndex(p.layer)] as UserLayerRecord<TLayer>).name = p.from; },\n  });\n\n  /** Finds the layer by id, not by where the payload last left it: moves of\n   *  one layer coalesce, and the entry then reverts the first payload from\n   *  wherever the last one put the layer. */\n  function placeLayer(layer: TLayer, index: number): void {\n    const [rec] = state.layers.splice(requireLayerIndex(layer), 1);\n    state.layers.splice(index, 0, rec);\n    rebuildLayerIndex();\n  }\n\n  registerKitOp<{ layer: TLayer; from: number; to: number }>('kit:moveLayer', {\n    apply: (p) => placeLayer(p.layer, p.to),\n    revert: (p) => placeLayer(p.layer, p.from),\n  });\n}\n"],"mappings":";AAQA,SAAS,YAAY,QAAqC,IAAoC;CAC5F,IAAI,OAAO,QAAW,OAAO,OAAO;MAC/B,OAAO,WAAW;AACzB;;AAGA,SAAgB,iBACd,KACM;CACN,MAAM,EAAE,OAAO,mBAAmB,sBAAsB;CACxD,SAAS,cAAiB,MAAc,SAAgC;EACtE,IAAI,SAAS,MAAM,OAAgC;CACrD;CAEA,cAA6D,uBAAuB;EAClF,QAAQ,MAAM;GAAE,MAAM,OAAO,kBAAkB,EAAE,KAAK,EAAE,CAAC,UAAU,EAAE;GAAI,IAAI,CAAC,EAAE,IAAI,IAAI,gBAAgB;EAAG;EAC3G,SAAS,MAAM;GAAE,MAAM,OAAO,kBAAkB,EAAE,KAAK,EAAE,CAAC,UAAU,EAAE;EAAM;CAC9E,CAAC;CAED,cAA6D,sBAAsB;EACjF,QAAQ,MAAM;GAAE,MAAM,OAAO,kBAAkB,EAAE,KAAK,EAAE,CAAC,SAAS,EAAE;GAAI,IAAI,EAAE,IAAI,IAAI,gBAAgB;EAAG;EACzG,SAAS,MAAM;GAAE,MAAM,OAAO,kBAAkB,EAAE,KAAK,EAAE,CAAC,SAAS,EAAE;EAAM;CAC7E,CAAC;CAED,cAAyE,wBAAwB;EAC/F,QAAQ,MAAM;GAAE,YAAY,MAAM,OAAO,kBAAkB,EAAE,KAAK,IAAI,EAAE,EAAE;EAAG;EAC7E,SAAS,MAAM;GAAE,YAAY,MAAM,OAAO,kBAAkB,EAAE,KAAK,IAAI,EAAE,IAAI;EAAG;CAClF,CAAC;CAED,cAAkE,gBAAgB;EAChF,QAAQ,MAAM;GAAE,MAAM,OAAO,OAAO,EAAE,OAAO,GAAG,EAAE,GAAG,EAAE,OAAO,CAAC;GAAG,kBAAkB;EAAG;EACvF,SAAS,MAAM;GAAE,MAAM,OAAO,OAAO,EAAE,OAAO,CAAC;GAAG,kBAAkB;EAAG;CACzE,CAAC;CAED,cAA8D,mBAAmB;EAC/E,QAAQ,MAAM;GAAE,MAAM,OAAO,OAAO,EAAE,OAAO,CAAC;GAAG,kBAAkB;EAAG;EACtE,SAAS,MAAM;GAAE,MAAM,OAAO,OAAO,EAAE,OAAO,GAAG,EAAE,GAAG,EAAE,OAAO,CAAwB;GAAG,kBAAkB;EAAG;CACjH,CAAC;CAED,cAA2D,mBAAmB;EAC5E,QAAQ,MAAM;GAAE,MAAO,OAAO,kBAAkB,EAAE,KAAK,EAAE,CAA6B,OAAO,EAAE;EAAI;EACnG,SAAS,MAAM;GAAE,MAAO,OAAO,kBAAkB,EAAE,KAAK,EAAE,CAA6B,OAAO,EAAE;EAAM;CACxG,CAAC;;;;CAKD,SAAS,WAAW,OAAe,OAAqB;EACtD,MAAM,CAAC,OAAO,MAAM,OAAO,OAAO,kBAAkB,KAAK,GAAG,CAAC;EAC7D,MAAM,OAAO,OAAO,OAAO,GAAG,GAAG;EACjC,kBAAkB;CACpB;CAEA,cAA2D,iBAAiB;EAC1E,QAAQ,MAAM,WAAW,EAAE,OAAO,EAAE,EAAE;EACtC,SAAS,MAAM,WAAW,EAAE,OAAO,EAAE,IAAI;CAC3C,CAAC;AACH"}

package/dist/core/scene/layoutPass.js

@@ -2,6 +2,7 @@ import { composeWorldPose, rebaseLocalPose } from "./composeFrame.js";
 import { samePoseValue } from "./poseSnapshot.js";
 import { definesFrame, documentPose } from "./effectivePose.js";
 import { carriedDescendants } from "./carryDescendants.js";
+import { strategyView } from "./strategyView.js";
 import { asRectPose } from "./kitRegistry.js";
 
 //#region src/core/scene/layoutPass.ts
@@ -16,8 +17,10 @@ import { asRectPose } from "./kitRegistry.js";
 * resized, had a child moved, or gained or lost children with neither hook —
 * is put back in its resting arrangement, `childPoses`.
 *
-* `LayoutStrategy` is world-framed, so each pose is composed to world before
-* a strategy sees it and each result is rebased into its node's parent frame
+* A strategy sees the container upright: an upright container and its
+* children in world, and a turned one in its own frame, placed where its
+* unturned box sits, so children are laid out along the container's axes.
+* Each result is taken back to world and rebased into its node's parent frame
 * after. A child already where the strategy puts it is left out, so a pass
 * that changes nothing writes nothing. A child the pass moves takes its own
 * descendants along (`carriedDescendants`). A container this pass resizes is
@@ -72,21 +75,20 @@ function runLayoutPass(source, layoutOf, arrivals, changed, frame, departures =
 		if (id !== current && layoutOf(id) !== null && resized(frame, id, before, pose)) queue.push(id);
 	};
 	let current = null;
-	/** The container and its children as the strategy sees them, in world,
-	*  with every write this pass has made so far folded in. */
+	/** The container and its children as the strategy sees them, with every
+	*  write this pass has made so far folded in. */
 	const frameOf = (containerId) => {
-		const pose = world(containerId);
-		const bounds = frame.bounds(pose, containerId);
-		if (bounds === null) return null;
+		const view = strategyView(world(containerId), source.composition, (p) => frame.bounds(p, containerId), (p, from, to) => frame.remap(p, from, to, containerId));
+		if (view === null) return null;
 		const children = source.childrenOf(containerId).map((cid) => ({
 			id: cid,
-			pose: world(cid)
+			pose: view.toStrategy(world(cid))
 		}));
 		return {
-			world: pose,
+			...view,
 			container: {
 				id: containerId,
-				bounds
+				bounds: view.bounds
 			},
 			children
 		};
@@ -94,14 +96,14 @@ function runLayoutPass(source, layoutOf, arrivals, changed, frame, departures =
 	const apply = (containerId, at, result) => {
 		if (result.bounds) {
 			const node = source.get(containerId);
-			const sized = frame.remap(at.world, at.container.bounds, result.bounds, containerId);
+			const sized = at.toWorld(frame.remap(at.upright, at.container.bounds, result.bounds, containerId));
 			write(containerId, rebaseLocalPose(pa, sized, node.parent, compose, decompose));
 		}
 		for (const [cid, pose] of result.poses) {
 			const id = cid;
 			if (source.get(id)?.parent !== containerId) continue;
 			const before = frame.bounds(world(id), id);
-			write(id, rebaseLocalPose(pa, pose, containerId, compose, decompose));
+			write(id, rebaseLocalPose(pa, at.toWorld(pose), containerId, compose, decompose));
 			carry(id, before);
 		}
 	};

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

@@ -1 +1 @@
-{"version":3,"file":"layoutPass.js","names":[],"sources":["../../../src/core/scene/layoutPass.ts"],"sourcesContent":["/**\n * The one computation behind a scene's container layouts: given the\n * containers one edit changed, the pose writes their layouts ask for.\n *\n * A container that lost children and whose strategy has `depart` rearranges\n * the rest through it (and may shrink). One that gained children and whose\n * strategy has `arrive` then places them through it (and may refuse, or\n * grow). Any other changed container — one that reordered children, was\n * resized, had a child moved, or gained or lost children with neither hook —\n * is put back in its resting arrangement, `childPoses`.\n *\n * `LayoutStrategy` is world-framed, so each pose is composed to world before\n * a strategy sees it and each result is rebased into its node's parent frame\n * after. A child already where the strategy puts it is left out, so a pass\n * that changes nothing writes nothing. A child the pass moves takes its own\n * descendants along (`carriedDescendants`). A container this pass resizes is\n * arranged in turn, so nested layouts settle in the same edit.\n */\nimport {\n  composeWorldPose,\n  rebaseLocalPose,\n  type PoseAdapter,\n  type PoseComposition,\n} from './composeFrame';\nimport type { ContainerBounds, LayoutArrival, LayoutChild, LayoutStrategy } from '../../layout/types';\nimport { carriedDescendants } from './carryDescendants';\nimport { definesFrame, documentPose, type PoseSource, type PosedNode } from './effectivePose';\nimport { asRectPose } from './kitRegistry';\nimport { samePoseValue } from './poseSnapshot';\nimport type { LayoutFrame, NodeId } from './types';\n\n/** What the pass reads a scene through. */\nexport interface LayoutPassSource<TPose> extends PoseSource<TPose> {\n  get(id: NodeId): (PosedNode<TPose> & { parent: NodeId | null }) | undefined;\n  readonly composition: PoseComposition<TPose>;\n}\n\n/** How the pass measures and resizes poses, with every default filled. */\nexport interface ResolvedLayoutFrame<TPose> {\n  bounds(pose: TPose, id: NodeId): ContainerBounds | null;\n  remap(pose: TPose, from: ContainerBounds, to: ContainerBounds, id: NodeId): TPose;\n}\n\n/** The pose writes one edit's layouts ask for, or `null` when a strategy\n *  refused the children that joined it. */\nexport type LayoutPassResult<TPose> = Map<NodeId, TPose> | null;\n\nexport function resolveLayoutFrame<TPose>(frame: LayoutFrame<TPose> | undefined): ResolvedLayoutFrame<TPose> {\n  return {\n    bounds: frame?.bounds ?? ((pose) => {\n      const r = asRectPose(pose);\n      return r === null ? null : { x: r.x, y: r.y, width: r.width, height: r.height };\n    }),\n    remap: frame?.remap ?? ((pose, _from, to) => ({ ...(pose as object), ...to }) as TPose),\n  };\n}\n\n/** Whether a node going from `from` to `to` changed size. */\nexport function resized<TPose>(frame: ResolvedLayoutFrame<TPose>, id: NodeId, from: TPose, to: TPose): boolean {\n  const a = frame.bounds(from, id);\n  const b = frame.bounds(to, id);\n  if (a === null || b === null) return a !== b;\n  return a.width !== b.width || a.height !== b.height;\n}\n\n/** How many times one pass may arrange a container before giving up on it —\n *  only nested layouts that keep resizing each other get close. */\nconst MAX_PASSES = 16;\n\nexport function runLayoutPass<TPose>(\n  source: LayoutPassSource<TPose>,\n  layoutOf: (id: NodeId) => LayoutStrategy<TPose> | null,\n  arrivals: ReadonlyMap<NodeId, readonly NodeId[]>,\n  changed: ReadonlySet<NodeId>,\n  frame: ResolvedLayoutFrame<TPose>,\n  departures: ReadonlyMap<NodeId, readonly NodeId[]> = new Map(),\n): LayoutPassResult<TPose> {\n  // Poses already decided in this pass, so a container resized here is the\n  // frame its children are rebased into.\n  const out = new Map<NodeId, TPose>();\n  const poseOf = (id: NodeId): TPose => out.get(id) ?? documentPose(source, source.get(id)!);\n  const pa: PoseAdapter<TPose> = {\n    getPose: (id) => poseOf(id as NodeId),\n    getParent: (id) => source.get(id as NodeId)?.parent ?? null,\n    definesFrame: (id) => {\n      const node = source.get(id as NodeId);\n      return node === undefined || definesFrame(node);\n    },\n  };\n  const { compose, decompose } = source.composition;\n  const world = (id: NodeId): TPose => composeWorldPose(pa, id, compose);\n\n  const queue: NodeId[] = [...new Set<NodeId>([...arrivals.keys(), ...changed])];\n  const passes = new Map<NodeId, number>();\n  const write = (id: NodeId, pose: TPose): void => {\n    const before = poseOf(id);\n    if (samePoseValue(before, pose)) return;\n    out.set(id, pose);\n    // A container its own `depart` or `arrive` resized is arranged already.\n    if (id !== current && layoutOf(id) !== null\n      && resized(frame, id, before, pose)) queue.push(id);\n  };\n  let current: NodeId | null = null;\n\n  /** The container and its children as the strategy sees them, in world,\n   *  with every write this pass has made so far folded in. */\n  const frameOf = (containerId: NodeId) => {\n    const pose = world(containerId);\n    const bounds = frame.bounds(pose, containerId);\n    if (bounds === null) return null;\n    const children: LayoutChild<TPose>[] = source.childrenOf(containerId).map((cid) => ({\n      id: cid as string,\n      pose: world(cid),\n    }));\n    return { world: pose, container: { id: containerId as string, bounds }, children };\n  };\n  const apply = (\n    containerId: NodeId,\n    at: NonNullable<ReturnType<typeof frameOf>>,\n    result: LayoutArrival<TPose>,\n  ): void => {\n    if (result.bounds) {\n      const node = source.get(containerId)!;\n      const sized = frame.remap(at.world, at.container.bounds, result.bounds, containerId);\n      write(containerId, rebaseLocalPose(pa, sized, node.parent, compose, decompose));\n    }\n    for (const [cid, pose] of result.poses) {\n      const id = cid as NodeId;\n      if (source.get(id)?.parent !== containerId) continue;\n      const before = frame.bounds(world(id), id);\n      write(id, rebaseLocalPose(pa, pose, containerId, compose, decompose));\n      carry(id, before);\n    }\n  };\n  /** Moves `id`'s descendants by however far its write just moved it from `before`. */\n  const carry = (id: NodeId, before: ContainerBounds | null): void => {\n    const after = frame.bounds(world(id), id);\n    if (before === null || after === null) return;\n    const dx = after.x - before.x;\n    const dy = after.y - before.y;\n    if (dx === 0 && dy === 0) return;\n    const carried = carriedDescendants(\n      { childrenOf: (cid) => source.childrenOf(cid), poses: pa, composition: source.composition },\n      id,\n      (pose, cid) => {\n        const b = frame.bounds(pose, cid);\n        return b === null ? null : frame.remap(pose, b, { ...b, x: b.x + dx, y: b.y + dy }, cid);\n      },\n    );\n    for (const [cid, pose] of carried) write(cid, pose);\n  };\n\n  while (queue.length > 0) {\n    const containerId = queue.shift()!;\n    current = containerId;\n    const n = (passes.get(containerId) ?? 0) + 1;\n    passes.set(containerId, n);\n    if (n > MAX_PASSES) continue;\n    const layout = layoutOf(containerId);\n    if (layout === null || source.get(containerId) === undefined) continue;\n    const joined = n === 1 ? arrivals.get(containerId) : undefined;\n    const left = n === 1 ? departures.get(containerId) : undefined;\n    let arranged = false;\n    if (left !== undefined && layout.depart) {\n      const at = frameOf(containerId);\n      if (at === null) continue;\n      const joinedSet = new Set<string>(joined ?? []);\n      const staying = at.children.filter((c) => !joinedSet.has(c.id));\n      apply(containerId, at, layout.depart(at.container, staying, new Set<string>(left)));\n      arranged = true;\n    }\n    if (joined !== undefined && layout.arrive) {\n      const at = frameOf(containerId);\n      if (at === null) continue;\n      const result = layout.arrive(at.container, at.children, new Set<string>(joined));\n      if (result === null) return null;\n      apply(containerId, at, result);\n    } else if (!arranged || joined !== undefined) {\n      const at = frameOf(containerId);\n      if (at === null) continue;\n      apply(containerId, at, { poses: layout.childPoses(at.container, at.children) });\n    }\n  }\n  return out;\n}\n"],"mappings":";;;;;;;;;;;;;;;;;;;;;;;;;AA+CA,SAAgB,mBAA0B,OAAmE;CAC3G,OAAO;EACL,QAAQ,OAAO,YAAY,SAAS;GAClC,MAAM,IAAI,WAAW,IAAI;GACzB,OAAO,MAAM,OAAO,OAAO;IAAE,GAAG,EAAE;IAAG,GAAG,EAAE;IAAG,OAAO,EAAE;IAAO,QAAQ,EAAE;GAAO;EAChF;EACA,OAAO,OAAO,WAAW,MAAM,OAAO,QAAQ;GAAE,GAAI;GAAiB,GAAG;EAAG;CAC7E;AACF;;AAGA,SAAgB,QAAe,OAAmC,IAAY,MAAa,IAAoB;CAC7G,MAAM,IAAI,MAAM,OAAO,MAAM,EAAE;CAC/B,MAAM,IAAI,MAAM,OAAO,IAAI,EAAE;CAC7B,IAAI,MAAM,QAAQ,MAAM,MAAM,OAAO,MAAM;CAC3C,OAAO,EAAE,UAAU,EAAE,SAAS,EAAE,WAAW,EAAE;AAC/C;;;AAIA,IAAM,aAAa;AAEnB,SAAgB,cACd,QACA,UACA,UACA,SACA,OACA,6BAAqD,IAAI,IAAI,GACpC;CAGzB,MAAM,sBAAM,IAAI,IAAmB;CACnC,MAAM,UAAU,OAAsB,IAAI,IAAI,EAAE,KAAK,aAAa,QAAQ,OAAO,IAAI,EAAE,CAAE;CACzF,MAAM,KAAyB;EAC7B,UAAU,OAAO,OAAO,EAAY;EACpC,YAAY,OAAO,OAAO,IAAI,EAAY,CAAC,EAAE,UAAU;EACvD,eAAe,OAAO;GACpB,MAAM,OAAO,OAAO,IAAI,EAAY;GACpC,OAAO,SAAS,UAAa,aAAa,IAAI;EAChD;CACF;CACA,MAAM,EAAE,SAAS,cAAc,OAAO;CACtC,MAAM,SAAS,OAAsB,iBAAiB,IAAI,IAAI,OAAO;CAErE,MAAM,QAAkB,CAAC,mBAAG,IAAI,IAAY,CAAC,GAAG,SAAS,KAAK,GAAG,GAAG,OAAO,CAAC,CAAC;CAC7E,MAAM,yBAAS,IAAI,IAAoB;CACvC,MAAM,SAAS,IAAY,SAAsB;EAC/C,MAAM,SAAS,OAAO,EAAE;EACxB,IAAI,cAAc,QAAQ,IAAI,GAAG;EACjC,IAAI,IAAI,IAAI,IAAI;EAEhB,IAAI,OAAO,WAAW,SAAS,EAAE,MAAM,QAClC,QAAQ,OAAO,IAAI,QAAQ,IAAI,GAAG,MAAM,KAAK,EAAE;CACtD;CACA,IAAI,UAAyB;;;CAI7B,MAAM,WAAW,gBAAwB;EACvC,MAAM,OAAO,MAAM,WAAW;EAC9B,MAAM,SAAS,MAAM,OAAO,MAAM,WAAW;EAC7C,IAAI,WAAW,MAAM,OAAO;EAC5B,MAAM,WAAiC,OAAO,WAAW,WAAW,CAAC,CAAC,KAAK,SAAS;GAClF,IAAI;GACJ,MAAM,MAAM,GAAG;EACjB,EAAE;EACF,OAAO;GAAE,OAAO;GAAM,WAAW;IAAE,IAAI;IAAuB;GAAO;GAAG;EAAS;CACnF;CACA,MAAM,SACJ,aACA,IACA,WACS;EACT,IAAI,OAAO,QAAQ;GACjB,MAAM,OAAO,OAAO,IAAI,WAAW;GACnC,MAAM,QAAQ,MAAM,MAAM,GAAG,OAAO,GAAG,UAAU,QAAQ,OAAO,QAAQ,WAAW;GACnF,MAAM,aAAa,gBAAgB,IAAI,OAAO,KAAK,QAAQ,SAAS,SAAS,CAAC;EAChF;EACA,KAAK,MAAM,CAAC,KAAK,SAAS,OAAO,OAAO;GACtC,MAAM,KAAK;GACX,IAAI,OAAO,IAAI,EAAE,CAAC,EAAE,WAAW,aAAa;GAC5C,MAAM,SAAS,MAAM,OAAO,MAAM,EAAE,GAAG,EAAE;GACzC,MAAM,IAAI,gBAAgB,IAAI,MAAM,aAAa,SAAS,SAAS,CAAC;GACpE,MAAM,IAAI,MAAM;EAClB;CACF;;CAEA,MAAM,SAAS,IAAY,WAAyC;EAClE,MAAM,QAAQ,MAAM,OAAO,MAAM,EAAE,GAAG,EAAE;EACxC,IAAI,WAAW,QAAQ,UAAU,MAAM;EACvC,MAAM,KAAK,MAAM,IAAI,OAAO;EAC5B,MAAM,KAAK,MAAM,IAAI,OAAO;EAC5B,IAAI,OAAO,KAAK,OAAO,GAAG;EAC1B,MAAM,UAAU,mBACd;GAAE,aAAa,QAAQ,OAAO,WAAW,GAAG;GAAG,OAAO;GAAI,aAAa,OAAO;EAAY,GAC1F,KACC,MAAM,QAAQ;GACb,MAAM,IAAI,MAAM,OAAO,MAAM,GAAG;GAChC,OAAO,MAAM,OAAO,OAAO,MAAM,MAAM,MAAM,GAAG;IAAE,GAAG;IAAG,GAAG,EAAE,IAAI;IAAI,GAAG,EAAE,IAAI;GAAG,GAAG,GAAG;EACzF,CACF;EACA,KAAK,MAAM,CAAC,KAAK,SAAS,SAAS,MAAM,KAAK,IAAI;CACpD;CAEA,OAAO,MAAM,SAAS,GAAG;EACvB,MAAM,cAAc,MAAM,MAAM;EAChC,UAAU;EACV,MAAM,KAAK,OAAO,IAAI,WAAW,KAAK,KAAK;EAC3C,OAAO,IAAI,aAAa,CAAC;EACzB,IAAI,IAAI,YAAY;EACpB,MAAM,SAAS,SAAS,WAAW;EACnC,IAAI,WAAW,QAAQ,OAAO,IAAI,WAAW,MAAM,QAAW;EAC9D,MAAM,SAAS,MAAM,IAAI,SAAS,IAAI,WAAW,IAAI;EACrD,MAAM,OAAO,MAAM,IAAI,WAAW,IAAI,WAAW,IAAI;EACrD,IAAI,WAAW;EACf,IAAI,SAAS,UAAa,OAAO,QAAQ;GACvC,MAAM,KAAK,QAAQ,WAAW;GAC9B,IAAI,OAAO,MAAM;GACjB,MAAM,YAAY,IAAI,IAAY,UAAU,CAAC,CAAC;GAC9C,MAAM,UAAU,GAAG,SAAS,QAAQ,MAAM,CAAC,UAAU,IAAI,EAAE,EAAE,CAAC;GAC9D,MAAM,aAAa,IAAI,OAAO,OAAO,GAAG,WAAW,SAAS,IAAI,IAAY,IAAI,CAAC,CAAC;GAClF,WAAW;EACb;EACA,IAAI,WAAW,UAAa,OAAO,QAAQ;GACzC,MAAM,KAAK,QAAQ,WAAW;GAC9B,IAAI,OAAO,MAAM;GACjB,MAAM,SAAS,OAAO,OAAO,GAAG,WAAW,GAAG,UAAU,IAAI,IAAY,MAAM,CAAC;GAC/E,IAAI,WAAW,MAAM,OAAO;GAC5B,MAAM,aAAa,IAAI,MAAM;EAC/B,OAAO,IAAI,CAAC,YAAY,WAAW,QAAW;GAC5C,MAAM,KAAK,QAAQ,WAAW;GAC9B,IAAI,OAAO,MAAM;GACjB,MAAM,aAAa,IAAI,EAAE,OAAO,OAAO,WAAW,GAAG,WAAW,GAAG,QAAQ,EAAE,CAAC;EAChF;CACF;CACA,OAAO;AACT"}
+{"version":3,"file":"layoutPass.js","names":[],"sources":["../../../src/core/scene/layoutPass.ts"],"sourcesContent":["/**\n * The one computation behind a scene's container layouts: given the\n * containers one edit changed, the pose writes their layouts ask for.\n *\n * A container that lost children and whose strategy has `depart` rearranges\n * the rest through it (and may shrink). One that gained children and whose\n * strategy has `arrive` then places them through it (and may refuse, or\n * grow). Any other changed container — one that reordered children, was\n * resized, had a child moved, or gained or lost children with neither hook —\n * is put back in its resting arrangement, `childPoses`.\n *\n * A strategy sees the container upright: an upright container and its\n * children in world, and a turned one in its own frame, placed where its\n * unturned box sits, so children are laid out along the container's axes.\n * Each result is taken back to world and rebased into its node's parent frame\n * after. A child already where the strategy puts it is left out, so a pass\n * that changes nothing writes nothing. A child the pass moves takes its own\n * descendants along (`carriedDescendants`). A container this pass resizes is\n * arranged in turn, so nested layouts settle in the same edit.\n */\nimport {\n  composeWorldPose,\n  rebaseLocalPose,\n  type PoseAdapter,\n  type PoseComposition,\n} from './composeFrame';\nimport type { ContainerBounds, LayoutArrival, LayoutChild, LayoutStrategy } from '../../layout/types';\nimport { carriedDescendants } from './carryDescendants';\nimport { definesFrame, documentPose, type PoseSource, type PosedNode } from './effectivePose';\nimport { asRectPose } from './kitRegistry';\nimport { samePoseValue } from './poseSnapshot';\nimport { strategyView } from './strategyView';\nimport type { LayoutFrame, NodeId } from './types';\n\n/** What the pass reads a scene through. */\nexport interface LayoutPassSource<TPose> extends PoseSource<TPose> {\n  get(id: NodeId): (PosedNode<TPose> & { parent: NodeId | null }) | undefined;\n  readonly composition: PoseComposition<TPose>;\n}\n\n/** How the pass measures and resizes poses, with every default filled. */\nexport interface ResolvedLayoutFrame<TPose> {\n  bounds(pose: TPose, id: NodeId): ContainerBounds | null;\n  remap(pose: TPose, from: ContainerBounds, to: ContainerBounds, id: NodeId): TPose;\n}\n\n/** The pose writes one edit's layouts ask for, or `null` when a strategy\n *  refused the children that joined it. */\nexport type LayoutPassResult<TPose> = Map<NodeId, TPose> | null;\n\nexport function resolveLayoutFrame<TPose>(frame: LayoutFrame<TPose> | undefined): ResolvedLayoutFrame<TPose> {\n  return {\n    bounds: frame?.bounds ?? ((pose) => {\n      const r = asRectPose(pose);\n      return r === null ? null : { x: r.x, y: r.y, width: r.width, height: r.height };\n    }),\n    remap: frame?.remap ?? ((pose, _from, to) => ({ ...(pose as object), ...to }) as TPose),\n  };\n}\n\n/** Whether a node going from `from` to `to` changed size. */\nexport function resized<TPose>(frame: ResolvedLayoutFrame<TPose>, id: NodeId, from: TPose, to: TPose): boolean {\n  const a = frame.bounds(from, id);\n  const b = frame.bounds(to, id);\n  if (a === null || b === null) return a !== b;\n  return a.width !== b.width || a.height !== b.height;\n}\n\n/** How many times one pass may arrange a container before giving up on it —\n *  only nested layouts that keep resizing each other get close. */\nconst MAX_PASSES = 16;\n\nexport function runLayoutPass<TPose>(\n  source: LayoutPassSource<TPose>,\n  layoutOf: (id: NodeId) => LayoutStrategy<TPose> | null,\n  arrivals: ReadonlyMap<NodeId, readonly NodeId[]>,\n  changed: ReadonlySet<NodeId>,\n  frame: ResolvedLayoutFrame<TPose>,\n  departures: ReadonlyMap<NodeId, readonly NodeId[]> = new Map(),\n): LayoutPassResult<TPose> {\n  // Poses already decided in this pass, so a container resized here is the\n  // frame its children are rebased into.\n  const out = new Map<NodeId, TPose>();\n  const poseOf = (id: NodeId): TPose => out.get(id) ?? documentPose(source, source.get(id)!);\n  const pa: PoseAdapter<TPose> = {\n    getPose: (id) => poseOf(id as NodeId),\n    getParent: (id) => source.get(id as NodeId)?.parent ?? null,\n    definesFrame: (id) => {\n      const node = source.get(id as NodeId);\n      return node === undefined || definesFrame(node);\n    },\n  };\n  const { compose, decompose } = source.composition;\n  const world = (id: NodeId): TPose => composeWorldPose(pa, id, compose);\n\n  const queue: NodeId[] = [...new Set<NodeId>([...arrivals.keys(), ...changed])];\n  const passes = new Map<NodeId, number>();\n  const write = (id: NodeId, pose: TPose): void => {\n    const before = poseOf(id);\n    if (samePoseValue(before, pose)) return;\n    out.set(id, pose);\n    // A container its own `depart` or `arrive` resized is arranged already.\n    if (id !== current && layoutOf(id) !== null\n      && resized(frame, id, before, pose)) queue.push(id);\n  };\n  let current: NodeId | null = null;\n\n  /** The container and its children as the strategy sees them, with every\n   *  write this pass has made so far folded in. */\n  const frameOf = (containerId: NodeId) => {\n    const view = strategyView(\n      world(containerId),\n      source.composition,\n      (p) => frame.bounds(p, containerId),\n      (p, from, to) => frame.remap(p, from, to, containerId),\n    );\n    if (view === null) return null;\n    const children: LayoutChild<TPose>[] = source.childrenOf(containerId).map((cid) => ({\n      id: cid as string,\n      pose: view.toStrategy(world(cid)),\n    }));\n    return { ...view, container: { id: containerId as string, bounds: view.bounds }, children };\n  };\n  const apply = (\n    containerId: NodeId,\n    at: NonNullable<ReturnType<typeof frameOf>>,\n    result: LayoutArrival<TPose>,\n  ): void => {\n    if (result.bounds) {\n      const node = source.get(containerId)!;\n      const sized = at.toWorld(frame.remap(at.upright, at.container.bounds, result.bounds, containerId));\n      write(containerId, rebaseLocalPose(pa, sized, node.parent, compose, decompose));\n    }\n    for (const [cid, pose] of result.poses) {\n      const id = cid as NodeId;\n      if (source.get(id)?.parent !== containerId) continue;\n      const before = frame.bounds(world(id), id);\n      write(id, rebaseLocalPose(pa, at.toWorld(pose), containerId, compose, decompose));\n      carry(id, before);\n    }\n  };\n  /** Moves `id`'s descendants by however far its write just moved it from `before`. */\n  const carry = (id: NodeId, before: ContainerBounds | null): void => {\n    const after = frame.bounds(world(id), id);\n    if (before === null || after === null) return;\n    const dx = after.x - before.x;\n    const dy = after.y - before.y;\n    if (dx === 0 && dy === 0) return;\n    const carried = carriedDescendants(\n      { childrenOf: (cid) => source.childrenOf(cid), poses: pa, composition: source.composition },\n      id,\n      (pose, cid) => {\n        const b = frame.bounds(pose, cid);\n        return b === null ? null : frame.remap(pose, b, { ...b, x: b.x + dx, y: b.y + dy }, cid);\n      },\n    );\n    for (const [cid, pose] of carried) write(cid, pose);\n  };\n\n  while (queue.length > 0) {\n    const containerId = queue.shift()!;\n    current = containerId;\n    const n = (passes.get(containerId) ?? 0) + 1;\n    passes.set(containerId, n);\n    if (n > MAX_PASSES) continue;\n    const layout = layoutOf(containerId);\n    if (layout === null || source.get(containerId) === undefined) continue;\n    const joined = n === 1 ? arrivals.get(containerId) : undefined;\n    const left = n === 1 ? departures.get(containerId) : undefined;\n    let arranged = false;\n    if (left !== undefined && layout.depart) {\n      const at = frameOf(containerId);\n      if (at === null) continue;\n      const joinedSet = new Set<string>(joined ?? []);\n      const staying = at.children.filter((c) => !joinedSet.has(c.id));\n      apply(containerId, at, layout.depart(at.container, staying, new Set<string>(left)));\n      arranged = true;\n    }\n    if (joined !== undefined && layout.arrive) {\n      const at = frameOf(containerId);\n      if (at === null) continue;\n      const result = layout.arrive(at.container, at.children, new Set<string>(joined));\n      if (result === null) return null;\n      apply(containerId, at, result);\n    } else if (!arranged || joined !== undefined) {\n      const at = frameOf(containerId);\n      if (at === null) continue;\n      apply(containerId, at, { poses: layout.childPoses(at.container, at.children) });\n    }\n  }\n  return out;\n}\n"],"mappings":";;;;;;;;;;;;;;;;;;;;;;;;;;;;AAkDA,SAAgB,mBAA0B,OAAmE;CAC3G,OAAO;EACL,QAAQ,OAAO,YAAY,SAAS;GAClC,MAAM,IAAI,WAAW,IAAI;GACzB,OAAO,MAAM,OAAO,OAAO;IAAE,GAAG,EAAE;IAAG,GAAG,EAAE;IAAG,OAAO,EAAE;IAAO,QAAQ,EAAE;GAAO;EAChF;EACA,OAAO,OAAO,WAAW,MAAM,OAAO,QAAQ;GAAE,GAAI;GAAiB,GAAG;EAAG;CAC7E;AACF;;AAGA,SAAgB,QAAe,OAAmC,IAAY,MAAa,IAAoB;CAC7G,MAAM,IAAI,MAAM,OAAO,MAAM,EAAE;CAC/B,MAAM,IAAI,MAAM,OAAO,IAAI,EAAE;CAC7B,IAAI,MAAM,QAAQ,MAAM,MAAM,OAAO,MAAM;CAC3C,OAAO,EAAE,UAAU,EAAE,SAAS,EAAE,WAAW,EAAE;AAC/C;;;AAIA,IAAM,aAAa;AAEnB,SAAgB,cACd,QACA,UACA,UACA,SACA,OACA,6BAAqD,IAAI,IAAI,GACpC;CAGzB,MAAM,sBAAM,IAAI,IAAmB;CACnC,MAAM,UAAU,OAAsB,IAAI,IAAI,EAAE,KAAK,aAAa,QAAQ,OAAO,IAAI,EAAE,CAAE;CACzF,MAAM,KAAyB;EAC7B,UAAU,OAAO,OAAO,EAAY;EACpC,YAAY,OAAO,OAAO,IAAI,EAAY,CAAC,EAAE,UAAU;EACvD,eAAe,OAAO;GACpB,MAAM,OAAO,OAAO,IAAI,EAAY;GACpC,OAAO,SAAS,UAAa,aAAa,IAAI;EAChD;CACF;CACA,MAAM,EAAE,SAAS,cAAc,OAAO;CACtC,MAAM,SAAS,OAAsB,iBAAiB,IAAI,IAAI,OAAO;CAErE,MAAM,QAAkB,CAAC,mBAAG,IAAI,IAAY,CAAC,GAAG,SAAS,KAAK,GAAG,GAAG,OAAO,CAAC,CAAC;CAC7E,MAAM,yBAAS,IAAI,IAAoB;CACvC,MAAM,SAAS,IAAY,SAAsB;EAC/C,MAAM,SAAS,OAAO,EAAE;EACxB,IAAI,cAAc,QAAQ,IAAI,GAAG;EACjC,IAAI,IAAI,IAAI,IAAI;EAEhB,IAAI,OAAO,WAAW,SAAS,EAAE,MAAM,QAClC,QAAQ,OAAO,IAAI,QAAQ,IAAI,GAAG,MAAM,KAAK,EAAE;CACtD;CACA,IAAI,UAAyB;;;CAI7B,MAAM,WAAW,gBAAwB;EACvC,MAAM,OAAO,aACX,MAAM,WAAW,GACjB,OAAO,cACN,MAAM,MAAM,OAAO,GAAG,WAAW,IACjC,GAAG,MAAM,OAAO,MAAM,MAAM,GAAG,MAAM,IAAI,WAAW,CACvD;EACA,IAAI,SAAS,MAAM,OAAO;EAC1B,MAAM,WAAiC,OAAO,WAAW,WAAW,CAAC,CAAC,KAAK,SAAS;GAClF,IAAI;GACJ,MAAM,KAAK,WAAW,MAAM,GAAG,CAAC;EAClC,EAAE;EACF,OAAO;GAAE,GAAG;GAAM,WAAW;IAAE,IAAI;IAAuB,QAAQ,KAAK;GAAO;GAAG;EAAS;CAC5F;CACA,MAAM,SACJ,aACA,IACA,WACS;EACT,IAAI,OAAO,QAAQ;GACjB,MAAM,OAAO,OAAO,IAAI,WAAW;GACnC,MAAM,QAAQ,GAAG,QAAQ,MAAM,MAAM,GAAG,SAAS,GAAG,UAAU,QAAQ,OAAO,QAAQ,WAAW,CAAC;GACjG,MAAM,aAAa,gBAAgB,IAAI,OAAO,KAAK,QAAQ,SAAS,SAAS,CAAC;EAChF;EACA,KAAK,MAAM,CAAC,KAAK,SAAS,OAAO,OAAO;GACtC,MAAM,KAAK;GACX,IAAI,OAAO,IAAI,EAAE,CAAC,EAAE,WAAW,aAAa;GAC5C,MAAM,SAAS,MAAM,OAAO,MAAM,EAAE,GAAG,EAAE;GACzC,MAAM,IAAI,gBAAgB,IAAI,GAAG,QAAQ,IAAI,GAAG,aAAa,SAAS,SAAS,CAAC;GAChF,MAAM,IAAI,MAAM;EAClB;CACF;;CAEA,MAAM,SAAS,IAAY,WAAyC;EAClE,MAAM,QAAQ,MAAM,OAAO,MAAM,EAAE,GAAG,EAAE;EACxC,IAAI,WAAW,QAAQ,UAAU,MAAM;EACvC,MAAM,KAAK,MAAM,IAAI,OAAO;EAC5B,MAAM,KAAK,MAAM,IAAI,OAAO;EAC5B,IAAI,OAAO,KAAK,OAAO,GAAG;EAC1B,MAAM,UAAU,mBACd;GAAE,aAAa,QAAQ,OAAO,WAAW,GAAG;GAAG,OAAO;GAAI,aAAa,OAAO;EAAY,GAC1F,KACC,MAAM,QAAQ;GACb,MAAM,IAAI,MAAM,OAAO,MAAM,GAAG;GAChC,OAAO,MAAM,OAAO,OAAO,MAAM,MAAM,MAAM,GAAG;IAAE,GAAG;IAAG,GAAG,EAAE,IAAI;IAAI,GAAG,EAAE,IAAI;GAAG,GAAG,GAAG;EACzF,CACF;EACA,KAAK,MAAM,CAAC,KAAK,SAAS,SAAS,MAAM,KAAK,IAAI;CACpD;CAEA,OAAO,MAAM,SAAS,GAAG;EACvB,MAAM,cAAc,MAAM,MAAM;EAChC,UAAU;EACV,MAAM,KAAK,OAAO,IAAI,WAAW,KAAK,KAAK;EAC3C,OAAO,IAAI,aAAa,CAAC;EACzB,IAAI,IAAI,YAAY;EACpB,MAAM,SAAS,SAAS,WAAW;EACnC,IAAI,WAAW,QAAQ,OAAO,IAAI,WAAW,MAAM,QAAW;EAC9D,MAAM,SAAS,MAAM,IAAI,SAAS,IAAI,WAAW,IAAI;EACrD,MAAM,OAAO,MAAM,IAAI,WAAW,IAAI,WAAW,IAAI;EACrD,IAAI,WAAW;EACf,IAAI,SAAS,UAAa,OAAO,QAAQ;GACvC,MAAM,KAAK,QAAQ,WAAW;GAC9B,IAAI,OAAO,MAAM;GACjB,MAAM,YAAY,IAAI,IAAY,UAAU,CAAC,CAAC;GAC9C,MAAM,UAAU,GAAG,SAAS,QAAQ,MAAM,CAAC,UAAU,IAAI,EAAE,EAAE,CAAC;GAC9D,MAAM,aAAa,IAAI,OAAO,OAAO,GAAG,WAAW,SAAS,IAAI,IAAY,IAAI,CAAC,CAAC;GAClF,WAAW;EACb;EACA,IAAI,WAAW,UAAa,OAAO,QAAQ;GACzC,MAAM,KAAK,QAAQ,WAAW;GAC9B,IAAI,OAAO,MAAM;GACjB,MAAM,SAAS,OAAO,OAAO,GAAG,WAAW,GAAG,UAAU,IAAI,IAAY,MAAM,CAAC;GAC/E,IAAI,WAAW,MAAM,OAAO;GAC5B,MAAM,aAAa,IAAI,MAAM;EAC/B,OAAO,IAAI,CAAC,YAAY,WAAW,QAAW;GAC5C,MAAM,KAAK,QAAQ,WAAW;GAC9B,IAAI,OAAO,MAAM;GACjB,MAAM,aAAa,IAAI,EAAE,OAAO,OAAO,WAAW,GAAG,WAAW,GAAG,QAAQ,EAAE,CAAC;EAChF;CACF;CACA,OAAO;AACT"}

package/dist/core/scene/lockGuard.js

@@ -1,4 +1,4 @@
-import { nodeGates } from "./nodeGates.js";
+import { isNodeHidden, isNodeLocked, nodeGates } from "./nodeGates.js";
 
 //#region src/core/scene/lockGuard.ts
 /**
@@ -7,16 +7,19 @@ import { nodeGates } from "./nodeGates.js";
 */
 function createLockGuard(state) {
 	let bypass = 0;
+	/** Whether any node has carried `locked` since the scene was made. It is
+	*  never cleared, so it can only err toward climbing. */
+	let nodeLockSeen = false;
 	const source = {
 		get layers() {
 			return state.layers;
 		},
 		get: (id) => state.nodes.get(id)
 	};
-	const isLocked = (id) => nodeGates(source).locked(id);
+	const isLocked = (id) => (nodeLockSeen || state.layers.some((l) => l.locked)) && isNodeLocked(source, id);
 	return {
 		isLocked,
-		isHidden: (id) => nodeGates(source).hidden(id),
+		isHidden: (id) => isNodeHidden(source, id),
 		refuse(id, verb) {
 			if (bypass > 0 || !isLocked(id)) return;
 			throw new Error(`Scene: cannot ${verb} "${id}" — it is locked`);
@@ -29,6 +32,9 @@ function createLockGuard(state) {
 			const gates = nodeGates(source);
 			return ids.some((id) => gates.locked(id) || gates.hidden(id)) ? ids.filter((id) => !gates.locked(id) && !gates.hidden(id)) : ids;
 		},
+		noteWritten(node) {
+			if (node.locked === true) nodeLockSeen = true;
+		},
 		lifted(fn) {
 			bypass++;
 			try {

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

@@ -1 +1 @@
-{"version":3,"file":"lockGuard.js","names":[],"sources":["../../../src/core/scene/lockGuard.ts"],"sourcesContent":["/**\n * The scene's lock guard: what a lock refuses, what the selection may hold,\n * and how a caller that is restoring an already-legal state gets past it.\n */\nimport { nodeGates } from './nodeGates';\nimport type { Node, NodeId } from './types';\n\n/** What the guard reads of a scene's state. */\nexport interface LockGuardState<TData, TLayer extends string, TPose> {\n  nodes: Map<NodeId, Node<TData, TLayer, TPose>>;\n  layers: { id: string; visible: boolean; locked: boolean }[];\n  layerIndex: Map<TLayer, number>;\n}\n\nexport interface LockGuard<TLayer extends string> {\n  /** See `Scene.isLocked`. */\n  isLocked(id: NodeId): boolean;\n  /** See `Scene.isHidden`. */\n  isHidden(id: NodeId): boolean;\n  /** Throw when `id` is locked and the guard is not lifted. */\n  refuse(id: NodeId, verb: string): void;\n  /** Throw when `layer` is locked and the guard is not lifted. */\n  refuseLayer(layer: TLayer, verb: string): void;\n  /** `ids` less the locked and hidden ones: the scene's selection never\n   *  holds either, whoever writes it. */\n  reachable(ids: readonly NodeId[]): readonly NodeId[];\n  /** Run `fn` with the guard lifted: `unlocked()`, `removeLayer`, and every\n   *  replay — undo, redo, a journal stepping, a rollback — which restores a\n   *  state that was legal when it was recorded. */\n  lifted<T>(fn: () => T): T;\n}\n\nexport function createLockGuard<TData, TLayer extends string, TPose>(\n  state: LockGuardState<TData, TLayer, TPose>,\n): LockGuard<TLayer> {\n  let bypass = 0;\n\n  const source = { get layers() { return state.layers; }, get: (id: NodeId) => state.nodes.get(id) };\n  const isLocked = (id: NodeId): boolean => nodeGates(source).locked(id);\n\n  return {\n    isLocked,\n    isHidden: (id) => nodeGates(source).hidden(id),\n    refuse(id, verb) {\n      if (bypass > 0 || !isLocked(id)) return;\n      throw new Error(`Scene: cannot ${verb} \"${id}\" — it is locked`);\n    },\n    refuseLayer(layer, verb) {\n      if (bypass > 0 || !state.layers[state.layerIndex.get(layer) ?? -1]?.locked) return;\n      throw new Error(`Scene: cannot ${verb} layer \"${layer}\" — it is locked`);\n    },\n    reachable(ids) {\n      const gates = nodeGates(source);\n      return ids.some((id) => gates.locked(id) || gates.hidden(id))\n        ? ids.filter((id) => !gates.locked(id) && !gates.hidden(id))\n        : ids;\n    },\n    lifted(fn) {\n      bypass++;\n      try {\n        return fn();\n      } finally {\n        bypass--;\n      }\n    },\n  };\n}\n"],"mappings":";;;;;;;AAgCA,SAAgB,gBACd,OACmB;CACnB,IAAI,SAAS;CAEb,MAAM,SAAS;EAAE,IAAI,SAAS;GAAE,OAAO,MAAM;EAAQ;EAAG,MAAM,OAAe,MAAM,MAAM,IAAI,EAAE;CAAE;CACjG,MAAM,YAAY,OAAwB,UAAU,MAAM,CAAC,CAAC,OAAO,EAAE;CAErE,OAAO;EACL;EACA,WAAW,OAAO,UAAU,MAAM,CAAC,CAAC,OAAO,EAAE;EAC7C,OAAO,IAAI,MAAM;GACf,IAAI,SAAS,KAAK,CAAC,SAAS,EAAE,GAAG;GACjC,MAAM,IAAI,MAAM,iBAAiB,KAAK,IAAI,GAAG,iBAAiB;EAChE;EACA,YAAY,OAAO,MAAM;GACvB,IAAI,SAAS,KAAK,CAAC,MAAM,OAAO,MAAM,WAAW,IAAI,KAAK,KAAK,GAAG,EAAE,QAAQ;GAC5E,MAAM,IAAI,MAAM,iBAAiB,KAAK,UAAU,MAAM,iBAAiB;EACzE;EACA,UAAU,KAAK;GACb,MAAM,QAAQ,UAAU,MAAM;GAC9B,OAAO,IAAI,MAAM,OAAO,MAAM,OAAO,EAAE,KAAK,MAAM,OAAO,EAAE,CAAC,IACxD,IAAI,QAAQ,OAAO,CAAC,MAAM,OAAO,EAAE,KAAK,CAAC,MAAM,OAAO,EAAE,CAAC,IACzD;EACN;EACA,OAAO,IAAI;GACT;GACA,IAAI;IACF,OAAO,GAAG;GACZ,UAAU;IACR;GACF;EACF;CACF;AACF"}
+{"version":3,"file":"lockGuard.js","names":[],"sources":["../../../src/core/scene/lockGuard.ts"],"sourcesContent":["/**\n * The scene's lock guard: what a lock refuses, what the selection may hold,\n * and how a caller that is restoring an already-legal state gets past it.\n */\nimport { isNodeHidden, isNodeLocked, nodeGates } from './nodeGates';\nimport type { Node, NodeId } from './types';\n\n/** What the guard reads of a scene's state. */\nexport interface LockGuardState<TData, TLayer extends string, TPose> {\n  nodes: Map<NodeId, Node<TData, TLayer, TPose>>;\n  layers: { id: string; visible: boolean; locked: boolean }[];\n  layerIndex: Map<TLayer, number>;\n}\n\nexport interface LockGuard<TLayer extends string> {\n  /** See `Scene.isLocked`. */\n  isLocked(id: NodeId): boolean;\n  /** See `Scene.isHidden`. */\n  isHidden(id: NodeId): boolean;\n  /** Throw when `id` is locked and the guard is not lifted. */\n  refuse(id: NodeId, verb: string): void;\n  /** Throw when `layer` is locked and the guard is not lifted. */\n  refuseLayer(layer: TLayer, verb: string): void;\n  /** `ids` less the locked and hidden ones: the scene's selection never\n   *  holds either, whoever writes it. */\n  reachable(ids: readonly NodeId[]): readonly NodeId[];\n  /** Tell the guard `node` was just written. Until some node carries\n   *  `locked`, and no layer is locked, nothing is locked and a check need\n   *  not climb. Every write that can set the flag calls this. */\n  noteWritten(node: { readonly locked?: boolean }): void;\n  /** Run `fn` with the guard lifted: `unlocked()`, `removeLayer`, and every\n   *  replay — undo, redo, a journal stepping, a rollback — which restores a\n   *  state that was legal when it was recorded. */\n  lifted<T>(fn: () => T): T;\n}\n\nexport function createLockGuard<TData, TLayer extends string, TPose>(\n  state: LockGuardState<TData, TLayer, TPose>,\n): LockGuard<TLayer> {\n  let bypass = 0;\n  /** Whether any node has carried `locked` since the scene was made. It is\n   *  never cleared, so it can only err toward climbing. */\n  let nodeLockSeen = false;\n\n  const source = { get layers() { return state.layers; }, get: (id: NodeId) => state.nodes.get(id) };\n  const isLocked = (id: NodeId): boolean =>\n    (nodeLockSeen || state.layers.some((l) => l.locked)) && isNodeLocked(source, id);\n\n  return {\n    isLocked,\n    isHidden: (id) => isNodeHidden(source, id),\n    refuse(id, verb) {\n      if (bypass > 0 || !isLocked(id)) return;\n      throw new Error(`Scene: cannot ${verb} \"${id}\" — it is locked`);\n    },\n    refuseLayer(layer, verb) {\n      if (bypass > 0 || !state.layers[state.layerIndex.get(layer) ?? -1]?.locked) return;\n      throw new Error(`Scene: cannot ${verb} layer \"${layer}\" — it is locked`);\n    },\n    reachable(ids) {\n      const gates = nodeGates(source);\n      return ids.some((id) => gates.locked(id) || gates.hidden(id))\n        ? ids.filter((id) => !gates.locked(id) && !gates.hidden(id))\n        : ids;\n    },\n    noteWritten(node) {\n      if (node.locked === true) nodeLockSeen = true;\n    },\n    lifted(fn) {\n      bypass++;\n      try {\n        return fn();\n      } finally {\n        bypass--;\n      }\n    },\n  };\n}\n"],"mappings":";;;;;;;AAoCA,SAAgB,gBACd,OACmB;CACnB,IAAI,SAAS;;;CAGb,IAAI,eAAe;CAEnB,MAAM,SAAS;EAAE,IAAI,SAAS;GAAE,OAAO,MAAM;EAAQ;EAAG,MAAM,OAAe,MAAM,MAAM,IAAI,EAAE;CAAE;CACjG,MAAM,YAAY,QACf,gBAAgB,MAAM,OAAO,MAAM,MAAM,EAAE,MAAM,MAAM,aAAa,QAAQ,EAAE;CAEjF,OAAO;EACL;EACA,WAAW,OAAO,aAAa,QAAQ,EAAE;EACzC,OAAO,IAAI,MAAM;GACf,IAAI,SAAS,KAAK,CAAC,SAAS,EAAE,GAAG;GACjC,MAAM,IAAI,MAAM,iBAAiB,KAAK,IAAI,GAAG,iBAAiB;EAChE;EACA,YAAY,OAAO,MAAM;GACvB,IAAI,SAAS,KAAK,CAAC,MAAM,OAAO,MAAM,WAAW,IAAI,KAAK,KAAK,GAAG,EAAE,QAAQ;GAC5E,MAAM,IAAI,MAAM,iBAAiB,KAAK,UAAU,MAAM,iBAAiB;EACzE;EACA,UAAU,KAAK;GACb,MAAM,QAAQ,UAAU,MAAM;GAC9B,OAAO,IAAI,MAAM,OAAO,MAAM,OAAO,EAAE,KAAK,MAAM,OAAO,EAAE,CAAC,IACxD,IAAI,QAAQ,OAAO,CAAC,MAAM,OAAO,EAAE,KAAK,CAAC,MAAM,OAAO,EAAE,CAAC,IACzD;EACN;EACA,YAAY,MAAM;GAChB,IAAI,KAAK,WAAW,MAAM,eAAe;EAC3C;EACA,OAAO,IAAI;GACT;GACA,IAAI;IACF,OAAO,GAAG;GACZ,UAAU;IACR;GACF;EACF;CACF;AACF"}

package/dist/core/scene/nestedHit.js

@@ -19,7 +19,7 @@ function nestedHitTester(adapter, opts) {
 		}
 		return chain;
 	};
-	const hitLeaf = (wx, wy) => {
+	const hitLeaf = ({ x: wx, y: wy }) => {
 		const objs = adapter.getNodes();
 		for (let i = objs.length - 1; i >= 0; i--) {
 			const o = objs[i];
@@ -31,12 +31,12 @@ function nestedHitTester(adapter, opts) {
 		}
 		return null;
 	};
-	const pickOutermost = (wx, wy) => {
-		const leaf = hitLeaf(wx, wy);
+	const pickOutermost = (world) => {
+		const leaf = hitLeaf(world);
 		return leaf === null ? null : ancestorChain(leaf)[0];
 	};
-	const pickBest = (wx, wy, alt, selection) => {
-		const leaf = hitLeaf(wx, wy);
+	const pickBest = (world, alt, selection) => {
+		const leaf = hitLeaf(world);
 		if (leaf === null) return null;
 		const chain = ancestorChain(leaf);
 		if (!alt) return chain[0];

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

@@ -1 +1 @@
-{"version":3,"file":"nestedHit.js","names":[],"sources":["../../../src/core/scene/nestedHit.ts"],"sourcesContent":["import { worldPoseLookup } from 'core/scene/composePose';\nimport { poseDescriptorForNode, type PoseDescriptor } from 'core/geometry/poseDescriptor';\nimport { AUTO_POSE_DESCRIPTOR } from 'core/geometry/autoPoseDescriptor';\n\n/** @internal */\ninterface HitAdapter<TNode extends { id: string }, TPose> {\n  getNode: (id: string) => TNode | undefined;\n  getNodes: () => TNode[];\n  getPose: (id: string) => TPose;\n  getParent: (id: string) => string | null;\n}\n\n/** Options for `nestedHitTester`. */\nexport interface NestedHitOpts<TNode extends { id: string }, TPose> {\n  /** Compose a child's local pose into world coords given its parent's world\n   *  pose. Same shape as `composeRectPose` (the default expectation). */\n  composePose: (parent: TPose, child: TPose) => TPose;\n  /** How to read world poses. Default `AUTO_POSE_DESCRIPTOR`. */\n  poseDescriptor?: PoseDescriptor<TPose>;\n  /** Predicate for \"this object is a nesting parent body\". The leaf scan\n   *  skips objects for which this returns true so a click on a parent's\n   *  painted body resolves to a child leaf, not the parent itself. Default:\n   *  never (treat every object as hittable). */\n  isGroup?: (id: string, obj: TNode | undefined) => boolean;\n}\n\n/** Hit-test entry points for a nested scene: one that always picks the\n *  outermost ancestor, and one that steps deeper on alt-click. */\nexport interface NestedHitTester {\n  /** Outermost-ancestor pick. Suitable as the chrome-level `pickEvery`: a\n   *  casual click selects the whole top-level ancestor. Returns `null` on\n   *  empty space. */\n  pickOutermost: (worldX: number, worldY: number) => string | null;\n  /** Alt-aware selection-update pick. Without `alt`, returns the outermost\n   *  ancestor (same as `pickOutermost`). With `alt`, returns one level\n   *  deeper than the deepest currently-selected ancestor in the leaf's\n   *  chain — repeated alt-clicks step ancestor → descendant → leaf. With\n   *  `alt` and nothing in the chain selected, jumps straight to the leaf.\n   *  Plug into `useSelectTool({ pickBest })`. */\n  pickBest: (\n    worldX: number,\n    worldY: number,\n    alt: boolean,\n    selection: readonly string[],\n  ) => string | null;\n}\n\n/** Build hit-testers that respect containers: a plain click selects the\n *  top-level ancestor, and alt-clicking descends one level at a time toward\n *  the leaf actually under the pointer. */\nexport function nestedHitTester<TNode extends { id: string }, TPose>(\n  adapter: HitAdapter<TNode, TPose>,\n  opts: NestedHitOpts<TNode, TPose>,\n): NestedHitTester {\n  const d = (opts.poseDescriptor ?? AUTO_POSE_DESCRIPTOR) as PoseDescriptor<TPose>;\n  const isGroup = opts.isGroup ?? (() => false);\n  const worldOf = worldPoseLookup(adapter, opts.composePose);\n\n  const ancestorChain = (id: string): string[] => {\n    const chain: string[] = [];\n    let cur: string | null = id;\n    while (cur !== null) {\n      chain.unshift(cur);\n      cur = adapter.getParent(cur);\n    }\n    return chain;\n  };\n\n  const hitLeaf = (wx: number, wy: number): string | null => {\n    const objs = adapter.getNodes();\n    for (let i = objs.length - 1; i >= 0; i--) {\n      const o = objs[i];\n      if (isGroup(o.id, o)) continue;\n      const w = worldOf(o.id);\n      if (!w) continue;\n      const b = poseDescriptorForNode(d, o).getBounds(w);\n      if (wx >= b.x && wx <= b.x + b.width && wy >= b.y && wy <= b.y + b.height) {\n        return o.id;\n      }\n    }\n    return null;\n  };\n\n  const pickOutermost = (wx: number, wy: number): string | null => {\n    const leaf = hitLeaf(wx, wy);\n    return leaf === null ? null : ancestorChain(leaf)[0];\n  };\n\n  const pickBest = (\n    wx: number,\n    wy: number,\n    alt: boolean,\n    selection: readonly string[],\n  ): string | null => {\n    const leaf = hitLeaf(wx, wy);\n    if (leaf === null) return null;\n    const chain = ancestorChain(leaf);\n    if (!alt) return chain[0];\n    for (let i = chain.length - 1; i >= 0; i--) {\n      if (selection.includes(chain[i])) {\n        return chain[Math.min(i + 1, chain.length - 1)];\n      }\n    }\n    return chain[chain.length - 1];\n  };\n\n  return { pickOutermost, pickBest };\n}\n"],"mappings":";;;;;;;;AAkDA,SAAgB,gBACd,SACA,MACiB;CACjB,MAAM,IAAK,KAAK,kBAAkB;CAClC,MAAM,UAAU,KAAK,kBAAkB;CACvC,MAAM,UAAU,gBAAgB,SAAS,KAAK,WAAW;CAEzD,MAAM,iBAAiB,OAAyB;EAC9C,MAAM,QAAkB,CAAC;EACzB,IAAI,MAAqB;EACzB,OAAO,QAAQ,MAAM;GACnB,MAAM,QAAQ,GAAG;GACjB,MAAM,QAAQ,UAAU,GAAG;EAC7B;EACA,OAAO;CACT;CAEA,MAAM,WAAW,IAAY,OAA8B;EACzD,MAAM,OAAO,QAAQ,SAAS;EAC9B,KAAK,IAAI,IAAI,KAAK,SAAS,GAAG,KAAK,GAAG,KAAK;GACzC,MAAM,IAAI,KAAK;GACf,IAAI,QAAQ,EAAE,IAAI,CAAC,GAAG;GACtB,MAAM,IAAI,QAAQ,EAAE,EAAE;GACtB,IAAI,CAAC,GAAG;GACR,MAAM,IAAI,sBAAsB,GAAG,CAAC,CAAC,CAAC,UAAU,CAAC;GACjD,IAAI,MAAM,EAAE,KAAK,MAAM,EAAE,IAAI,EAAE,SAAS,MAAM,EAAE,KAAK,MAAM,EAAE,IAAI,EAAE,QACjE,OAAO,EAAE;EAEb;EACA,OAAO;CACT;CAEA,MAAM,iBAAiB,IAAY,OAA8B;EAC/D,MAAM,OAAO,QAAQ,IAAI,EAAE;EAC3B,OAAO,SAAS,OAAO,OAAO,cAAc,IAAI,CAAC,CAAC;CACpD;CAEA,MAAM,YACJ,IACA,IACA,KACA,cACkB;EAClB,MAAM,OAAO,QAAQ,IAAI,EAAE;EAC3B,IAAI,SAAS,MAAM,OAAO;EAC1B,MAAM,QAAQ,cAAc,IAAI;EAChC,IAAI,CAAC,KAAK,OAAO,MAAM;EACvB,KAAK,IAAI,IAAI,MAAM,SAAS,GAAG,KAAK,GAAG,KACrC,IAAI,UAAU,SAAS,MAAM,EAAE,GAC7B,OAAO,MAAM,KAAK,IAAI,IAAI,GAAG,MAAM,SAAS,CAAC;EAGjD,OAAO,MAAM,MAAM,SAAS;CAC9B;CAEA,OAAO;EAAE;EAAe;CAAS;AACnC"}
+{"version":3,"file":"nestedHit.js","names":[],"sources":["../../../src/core/scene/nestedHit.ts"],"sourcesContent":["import { worldPoseLookup } from 'core/scene/composePose';\nimport { poseDescriptorForNode, type PoseDescriptor } from 'core/geometry/poseDescriptor';\nimport { AUTO_POSE_DESCRIPTOR } from 'core/geometry/autoPoseDescriptor';\nimport type { WorldPoint } from '@weasel-js/routing';\n\n/** @internal */\ninterface HitAdapter<TNode extends { id: string }, TPose> {\n  getNode: (id: string) => TNode | undefined;\n  getNodes: () => TNode[];\n  getPose: (id: string) => TPose;\n  getParent: (id: string) => string | null;\n}\n\n/** Options for `nestedHitTester`. */\nexport interface NestedHitOpts<TNode extends { id: string }, TPose> {\n  /** Compose a child's local pose into world coords given its parent's world\n   *  pose. Same shape as `composeRectPose` (the default expectation). */\n  composePose: (parent: TPose, child: TPose) => TPose;\n  /** How to read world poses. Default `AUTO_POSE_DESCRIPTOR`. */\n  poseDescriptor?: PoseDescriptor<TPose>;\n  /** Predicate for \"this object is a nesting parent body\". The leaf scan\n   *  skips objects for which this returns true so a click on a parent's\n   *  painted body resolves to a child leaf, not the parent itself. Default:\n   *  never (treat every object as hittable). */\n  isGroup?: (id: string, obj: TNode | undefined) => boolean;\n}\n\n/** Hit-test entry points for a nested scene: one that always picks the\n *  outermost ancestor, and one that steps deeper on alt-click. */\nexport interface NestedHitTester {\n  /** Outermost-ancestor pick. Suitable as the chrome-level `pickEvery`: a\n   *  casual click selects the whole top-level ancestor. Returns `null` on\n   *  empty space. */\n  pickOutermost: (world: WorldPoint) => string | null;\n  /** Alt-aware selection-update pick. Without `alt`, returns the outermost\n   *  ancestor (same as `pickOutermost`). With `alt`, returns one level\n   *  deeper than the deepest currently-selected ancestor in the leaf's\n   *  chain — repeated alt-clicks step ancestor → descendant → leaf. With\n   *  `alt` and nothing in the chain selected, jumps straight to the leaf.\n   *  Plug into `useSelectTool({ pickBest })`. */\n  pickBest: (world: WorldPoint, alt: boolean, selection: readonly string[]) => string | null;\n}\n\n/** Build hit-testers that respect containers: a plain click selects the\n *  top-level ancestor, and alt-clicking descends one level at a time toward\n *  the leaf actually under the pointer. */\nexport function nestedHitTester<TNode extends { id: string }, TPose>(\n  adapter: HitAdapter<TNode, TPose>,\n  opts: NestedHitOpts<TNode, TPose>,\n): NestedHitTester {\n  const d = (opts.poseDescriptor ?? AUTO_POSE_DESCRIPTOR) as PoseDescriptor<TPose>;\n  const isGroup = opts.isGroup ?? (() => false);\n  const worldOf = worldPoseLookup(adapter, opts.composePose);\n\n  const ancestorChain = (id: string): string[] => {\n    const chain: string[] = [];\n    let cur: string | null = id;\n    while (cur !== null) {\n      chain.unshift(cur);\n      cur = adapter.getParent(cur);\n    }\n    return chain;\n  };\n\n  const hitLeaf = ({ x: wx, y: wy }: WorldPoint): string | null => {\n    const objs = adapter.getNodes();\n    for (let i = objs.length - 1; i >= 0; i--) {\n      const o = objs[i];\n      if (isGroup(o.id, o)) continue;\n      const w = worldOf(o.id);\n      if (!w) continue;\n      const b = poseDescriptorForNode(d, o).getBounds(w);\n      if (wx >= b.x && wx <= b.x + b.width && wy >= b.y && wy <= b.y + b.height) {\n        return o.id;\n      }\n    }\n    return null;\n  };\n\n  const pickOutermost = (world: WorldPoint): string | null => {\n    const leaf = hitLeaf(world);\n    return leaf === null ? null : ancestorChain(leaf)[0];\n  };\n\n  const pickBest = (world: WorldPoint, alt: boolean, selection: readonly string[]): string | null => {\n    const leaf = hitLeaf(world);\n    if (leaf === null) return null;\n    const chain = ancestorChain(leaf);\n    if (!alt) return chain[0];\n    for (let i = chain.length - 1; i >= 0; i--) {\n      if (selection.includes(chain[i])) {\n        return chain[Math.min(i + 1, chain.length - 1)];\n      }\n    }\n    return chain[chain.length - 1];\n  };\n\n  return { pickOutermost, pickBest };\n}\n"],"mappings":";;;;;;;;AA8CA,SAAgB,gBACd,SACA,MACiB;CACjB,MAAM,IAAK,KAAK,kBAAkB;CAClC,MAAM,UAAU,KAAK,kBAAkB;CACvC,MAAM,UAAU,gBAAgB,SAAS,KAAK,WAAW;CAEzD,MAAM,iBAAiB,OAAyB;EAC9C,MAAM,QAAkB,CAAC;EACzB,IAAI,MAAqB;EACzB,OAAO,QAAQ,MAAM;GACnB,MAAM,QAAQ,GAAG;GACjB,MAAM,QAAQ,UAAU,GAAG;EAC7B;EACA,OAAO;CACT;CAEA,MAAM,WAAW,EAAE,GAAG,IAAI,GAAG,SAAoC;EAC/D,MAAM,OAAO,QAAQ,SAAS;EAC9B,KAAK,IAAI,IAAI,KAAK,SAAS,GAAG,KAAK,GAAG,KAAK;GACzC,MAAM,IAAI,KAAK;GACf,IAAI,QAAQ,EAAE,IAAI,CAAC,GAAG;GACtB,MAAM,IAAI,QAAQ,EAAE,EAAE;GACtB,IAAI,CAAC,GAAG;GACR,MAAM,IAAI,sBAAsB,GAAG,CAAC,CAAC,CAAC,UAAU,CAAC;GACjD,IAAI,MAAM,EAAE,KAAK,MAAM,EAAE,IAAI,EAAE,SAAS,MAAM,EAAE,KAAK,MAAM,EAAE,IAAI,EAAE,QACjE,OAAO,EAAE;EAEb;EACA,OAAO;CACT;CAEA,MAAM,iBAAiB,UAAqC;EAC1D,MAAM,OAAO,QAAQ,KAAK;EAC1B,OAAO,SAAS,OAAO,OAAO,cAAc,IAAI,CAAC,CAAC;CACpD;CAEA,MAAM,YAAY,OAAmB,KAAc,cAAgD;EACjG,MAAM,OAAO,QAAQ,KAAK;EAC1B,IAAI,SAAS,MAAM,OAAO;EAC1B,MAAM,QAAQ,cAAc,IAAI;EAChC,IAAI,CAAC,KAAK,OAAO,MAAM;EACvB,KAAK,IAAI,IAAI,MAAM,SAAS,GAAG,KAAK,GAAG,KACrC,IAAI,UAAU,SAAS,MAAM,EAAE,GAC7B,OAAO,MAAM,KAAK,IAAI,IAAI,GAAG,MAAM,SAAS,CAAC;EAGjD,OAAO,MAAM,MAAM,SAAS;CAC9B;CAEA,OAAO;EAAE;EAAe;CAAS;AACnC"}

package/dist/core/scene/nodeFlags.js

@@ -15,12 +15,18 @@ function createNodeFlags(env) {
 	for (const flag of ["hidden", "locked"]) env.register(KIND[flag], {
 		apply: (p) => {
 			const { id, to } = p;
-			write(env.requireNode(id), flag, to);
+			const node = env.requireNode(id);
+			write(node, flag, to);
+			env.noteWritten(node);
+			if (flag === "hidden") env.invalidateDependents(id);
 			if (to) env.narrowSelection();
 		},
 		revert: (p) => {
 			const { id, from } = p;
-			write(env.requireNode(id), flag, from);
+			const node = env.requireNode(id);
+			write(node, flag, from);
+			env.noteWritten(node);
+			if (flag === "hidden") env.invalidateDependents(id);
 		}
 	});
 	const set = (flag, label) => (id, to) => {

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

@@ -1 +1 @@
-{"version":3,"file":"nodeFlags.js","names":[],"sources":["../../../src/core/scene/nodeFlags.ts"],"sourcesContent":["/**\n * A node's own `hidden` and `locked` flags: the kit ops that write them, and\n * the scene methods that record those ops. What the flags mean to every\n * reader is `nodeGates`.\n */\nimport type { Node, NodeId, RegisteredOp, Scene } from './types';\n\n/** The two per-node flags. */\nexport type NodeFlag = 'hidden' | 'locked';\n\nexport interface NodeFlagsEnv<TData, TLayer extends string, TPose> {\n  register(kind: string, handler: RegisteredOp<unknown>): void;\n  requireNode(id: NodeId): Node<TData, TLayer, TPose>;\n  record(kind: string, payload: unknown, label: string): void;\n  /** Drop from the selection whatever is now hidden or locked. */\n  narrowSelection(): void;\n}\n\ninterface FlagPayload { id: NodeId; from: boolean; to: boolean }\n\n/** Stored only while set, so a snapshot of an unflagged node carries neither. */\nfunction write(node: { hidden?: boolean; locked?: boolean }, flag: NodeFlag, to: boolean): void {\n  if (to) node[flag] = true;\n  else delete node[flag];\n}\n\nconst KIND: Record<NodeFlag, string> = { hidden: 'kit:setHidden', locked: 'kit:setLocked' };\n\n/** Register `kit:setHidden` and `kit:setLocked`, and answer with the scene\n *  methods that record them. Neither is refused by a lock: like a layer's,\n *  a node's lock is what lifts it. */\nexport function createNodeFlags<TData, TLayer extends string, TPose>(\n  env: NodeFlagsEnv<TData, TLayer, TPose>,\n): Pick<Scene<TData, TLayer, TPose>, 'setHidden' | 'setLocked'> {\n  for (const flag of ['hidden', 'locked'] as const) {\n    env.register(KIND[flag], {\n      apply: (p) => {\n        const { id, to } = p as FlagPayload;\n        write(env.requireNode(id), flag, to);\n        if (to) env.narrowSelection();\n      },\n      revert: (p) => {\n        const { id, from } = p as FlagPayload;\n        write(env.requireNode(id), flag, from);\n      },\n    });\n  }\n\n  const set = (flag: NodeFlag, label: string) => (id: NodeId, to: boolean): void => {\n    const from = env.requireNode(id)[flag] === true;\n    if (from === to) return;\n    env.record(KIND[flag], { id, from, to } satisfies FlagPayload, label);\n  };\n\n  return { setHidden: set('hidden', 'setHidden'), setLocked: set('locked', 'setLocked') };\n}\n"],"mappings":";;AAqBA,SAAS,MAAM,MAA8C,MAAgB,IAAmB;CAC9F,IAAI,IAAI,KAAK,QAAQ;MAChB,OAAO,KAAK;AACnB;AAEA,IAAM,OAAiC;CAAE,QAAQ;CAAiB,QAAQ;AAAgB;;;;AAK1F,SAAgB,gBACd,KAC8D;CAC9D,KAAK,MAAM,QAAQ,CAAC,UAAU,QAAQ,GACpC,IAAI,SAAS,KAAK,OAAO;EACvB,QAAQ,MAAM;GACZ,MAAM,EAAE,IAAI,OAAO;GACnB,MAAM,IAAI,YAAY,EAAE,GAAG,MAAM,EAAE;GACnC,IAAI,IAAI,IAAI,gBAAgB;EAC9B;EACA,SAAS,MAAM;GACb,MAAM,EAAE,IAAI,SAAS;GACrB,MAAM,IAAI,YAAY,EAAE,GAAG,MAAM,IAAI;EACvC;CACF,CAAC;CAGH,MAAM,OAAO,MAAgB,WAAmB,IAAY,OAAsB;EAChF,MAAM,OAAO,IAAI,YAAY,EAAE,CAAC,CAAC,UAAU;EAC3C,IAAI,SAAS,IAAI;EACjB,IAAI,OAAO,KAAK,OAAO;GAAE;GAAI;GAAM;EAAG,GAAyB,KAAK;CACtE;CAEA,OAAO;EAAE,WAAW,IAAI,UAAU,WAAW;EAAG,WAAW,IAAI,UAAU,WAAW;CAAE;AACxF"}
+{"version":3,"file":"nodeFlags.js","names":[],"sources":["../../../src/core/scene/nodeFlags.ts"],"sourcesContent":["/**\n * A node's own `hidden` and `locked` flags: the kit ops that write them, and\n * the scene methods that record those ops. What the flags mean to every\n * reader is `nodeGates`.\n */\nimport type { Node, NodeId, RegisteredOp, Scene } from './types';\n\n/** The two per-node flags. */\nexport type NodeFlag = 'hidden' | 'locked';\n\nexport interface NodeFlagsEnv<TData, TLayer extends string, TPose> {\n  register(kind: string, handler: RegisteredOp<unknown>): void;\n  requireNode(id: NodeId): Node<TData, TLayer, TPose>;\n  record(kind: string, payload: unknown, label: string): void;\n  /** Drop from the selection whatever is now hidden or locked. */\n  narrowSelection(): void;\n  /** Drop what derives from `id`: a derivation may leave a hidden node out. */\n  invalidateDependents(id: NodeId): void;\n  /** See `LockGuard.noteWritten`. */\n  noteWritten(node: Node<TData, TLayer, TPose>): void;\n}\n\ninterface FlagPayload { id: NodeId; from: boolean; to: boolean }\n\n/** Stored only while set, so a snapshot of an unflagged node carries neither. */\nfunction write(node: { hidden?: boolean; locked?: boolean }, flag: NodeFlag, to: boolean): void {\n  if (to) node[flag] = true;\n  else delete node[flag];\n}\n\nconst KIND: Record<NodeFlag, string> = { hidden: 'kit:setHidden', locked: 'kit:setLocked' };\n\n/** Register `kit:setHidden` and `kit:setLocked`, and answer with the scene\n *  methods that record them. Neither is refused by a lock: like a layer's,\n *  a node's lock is what lifts it. */\nexport function createNodeFlags<TData, TLayer extends string, TPose>(\n  env: NodeFlagsEnv<TData, TLayer, TPose>,\n): Pick<Scene<TData, TLayer, TPose>, 'setHidden' | 'setLocked'> {\n  for (const flag of ['hidden', 'locked'] as const) {\n    env.register(KIND[flag], {\n      apply: (p) => {\n        const { id, to } = p as FlagPayload;\n        const node = env.requireNode(id);\n        write(node, flag, to);\n        env.noteWritten(node);\n        if (flag === 'hidden') env.invalidateDependents(id);\n        if (to) env.narrowSelection();\n      },\n      revert: (p) => {\n        const { id, from } = p as FlagPayload;\n        const node = env.requireNode(id);\n        write(node, flag, from);\n        env.noteWritten(node);\n        if (flag === 'hidden') env.invalidateDependents(id);\n      },\n    });\n  }\n\n  const set = (flag: NodeFlag, label: string) => (id: NodeId, to: boolean): void => {\n    const from = env.requireNode(id)[flag] === true;\n    if (from === to) return;\n    env.record(KIND[flag], { id, from, to } satisfies FlagPayload, label);\n  };\n\n  return { setHidden: set('hidden', 'setHidden'), setLocked: set('locked', 'setLocked') };\n}\n"],"mappings":";;AAyBA,SAAS,MAAM,MAA8C,MAAgB,IAAmB;CAC9F,IAAI,IAAI,KAAK,QAAQ;MAChB,OAAO,KAAK;AACnB;AAEA,IAAM,OAAiC;CAAE,QAAQ;CAAiB,QAAQ;AAAgB;;;;AAK1F,SAAgB,gBACd,KAC8D;CAC9D,KAAK,MAAM,QAAQ,CAAC,UAAU,QAAQ,GACpC,IAAI,SAAS,KAAK,OAAO;EACvB,QAAQ,MAAM;GACZ,MAAM,EAAE,IAAI,OAAO;GACnB,MAAM,OAAO,IAAI,YAAY,EAAE;GAC/B,MAAM,MAAM,MAAM,EAAE;GACpB,IAAI,YAAY,IAAI;GACpB,IAAI,SAAS,UAAU,IAAI,qBAAqB,EAAE;GAClD,IAAI,IAAI,IAAI,gBAAgB;EAC9B;EACA,SAAS,MAAM;GACb,MAAM,EAAE,IAAI,SAAS;GACrB,MAAM,OAAO,IAAI,YAAY,EAAE;GAC/B,MAAM,MAAM,MAAM,IAAI;GACtB,IAAI,YAAY,IAAI;GACpB,IAAI,SAAS,UAAU,IAAI,qBAAqB,EAAE;EACpD;CACF,CAAC;CAGH,MAAM,OAAO,MAAgB,WAAmB,IAAY,OAAsB;EAChF,MAAM,OAAO,IAAI,YAAY,EAAE,CAAC,CAAC,UAAU;EAC3C,IAAI,SAAS,IAAI;EACjB,IAAI,OAAO,KAAK,OAAO;GAAE;GAAI;GAAM;EAAG,GAAyB,KAAK;CACtE;CAEA,OAAO;EAAE,WAAW,IAAI,UAAU,WAAW;EAAG,WAAW,IAAI,UAAU,WAAW;CAAE;AACxF"}

package/dist/core/scene/nodeGates.js

@@ -44,13 +44,42 @@ function nodeGates(scene) {
 		locked: inherited("locked", lockedLayers)
 	};
 }
+/** Whether `test` holds on the node at `id` or any ancestor, without the
+*  allocation {@link nodeGates} spends on a walk: the scene's lock guard asks
+*  this on every mutation. A parent cycle answers false, as the walk's does. */
+function climbs(scene, id, test) {
+	let seen = null;
+	let hops = 0;
+	for (let at = id; at !== null;) {
+		const node = scene.get(at);
+		if (node === void 0) return false;
+		if (++hops > 64) {
+			seen ??= /* @__PURE__ */ new Set();
+			if (seen.has(at)) return false;
+			seen.add(at);
+		}
+		if (test(node)) return true;
+		at = node.parent ?? null;
+	}
+	return false;
+}
+/** The layers flagged `flag`, or null when none is: the usual answer, which
+*  lets a climb skip the layer test at every hop. */
+function flaggedLayers(scene, flag) {
+	let out = null;
+	for (const l of scene.layers ?? []) if (flag === "locked" ? l.locked === true : l.visible === false) (out ??= /* @__PURE__ */ new Set()).add(l.id);
+	return out;
+}
 /** {@link NodeGates.hidden} for one id. */
 function isNodeHidden(scene, id) {
-	return nodeGates(scene).hidden(id);
+	const node = scene.get(id);
+	if (node === void 0) return false;
+	return flaggedLayers(scene, "hidden")?.has(node.layer) === true || climbs(scene, id, hidesSubtree);
 }
 /** {@link NodeGates.locked} for one id. */
 function isNodeLocked(scene, id) {
-	return nodeGates(scene).locked(id);
+	const layers = flaggedLayers(scene, "locked");
+	return climbs(scene, id, layers === null ? (node) => node.locked === true : (node) => node.locked === true || layers.has(node.layer));
 }
 
 //#endregion

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

@@ -1 +1 @@
-{"version":3,"file":"nodeGates.js","names":[],"sources":["../../../src/core/scene/nodeGates.ts"],"sourcesContent":["/**\n * Whether a node is shown, and whether it is in reach — the one place either\n * question is answered. Painting, picking, area selection, select-all,\n * snapping, export, and the scene's own lock guard all ask here.\n *\n * - **Hidden**: its own layer is not visible, or it or any ancestor carries\n *   `hidden`. A layer hides only the nodes tagged to it; a hidden node hides\n *   its whole subtree, as SVG's `display=\"none\"` does.\n * - **Locked**: it or any ancestor carries `locked`, or sits on a locked\n *   layer. A lock covers the whole subtree, whatever layers it spans.\n */\nimport type { NodeId } from './types';\n\n/** The node fields the gates read. A partial scene stand-in may leave `parent` out. */\nexport interface GatedNode {\n  readonly layer: string;\n  readonly parent?: string | null;\n  readonly hidden?: boolean;\n  readonly locked?: boolean;\n}\n\n/** The layer fields the gates read. Only an explicit `visible: false` hides. */\nexport interface GatedLayer {\n  readonly id: string;\n  readonly visible?: boolean;\n  readonly locked?: boolean;\n}\n\n/** What the gates read of a scene. A `Scene` is one. */\nexport interface GateSource {\n  readonly layers?: readonly GatedLayer[];\n  get(id: NodeId): GatedNode | undefined;\n}\n\n/** Whether `node`'s own flag hides it and its subtree. A walk from the roots\n *  down prunes where this holds instead of asking {@link NodeGates.hidden}\n *  per node; the two agree because this is the flag that answer climbs for. */\nexport function hidesSubtree(node: { readonly hidden?: boolean }): boolean {\n  return node.hidden === true;\n}\n\n/** Both answers, for one read of a scene. */\nexport interface NodeGates {\n  /** Whether `id` is not drawn. An id not in the scene is not hidden. */\n  hidden(id: string): boolean;\n  /** Whether `id` is out of reach. An id not in the scene is not locked. */\n  locked(id: string): boolean;\n}\n\n/**\n * The gates over `scene` as it stands now. Ancestor answers are remembered,\n * so a walk over every node climbs each chain once: build one per walk, and\n * a fresh one after an edit.\n */\nexport function nodeGates(scene: GateSource): NodeGates {\n  const hiddenLayers = new Set<string>();\n  const lockedLayers = new Set<string>();\n  for (const l of scene.layers ?? []) {\n    if (l.visible === false) hiddenLayers.add(l.id);\n    if (l.locked === true) lockedLayers.add(l.id);\n  }\n\n  /** Whether `flag` holds on the node at `id` or any ancestor, the node's\n   *  layer counting when `layers` holds it. */\n  const inherited = (flag: 'hidden' | 'locked', layers: Set<string> | null) => {\n    const memo = new Map<string, boolean>();\n    const climb = (id: string, seen: Set<string>): boolean => {\n      const known = memo.get(id);\n      if (known !== undefined) return known;\n      const node = scene.get(id as NodeId);\n      if (node === undefined || seen.has(id)) return false;\n      seen.add(id);\n      const parent = node.parent ?? null;\n      const out = (flag === 'hidden' ? hidesSubtree(node) : node.locked === true)\n        || (layers !== null && layers.has(node.layer))\n        || (parent !== null && climb(parent, seen));\n      memo.set(id, out);\n      return out;\n    };\n    return (id: string) => climb(id, new Set());\n  };\n\n  const flaggedHidden = inherited('hidden', null);\n  const locked = inherited('locked', lockedLayers);\n  return {\n    hidden(id) {\n      const node = scene.get(id as NodeId);\n      if (node === undefined) return false;\n      return hiddenLayers.has(node.layer) || flaggedHidden(id);\n    },\n    locked,\n  };\n}\n\n/** {@link NodeGates.hidden} for one id. */\nexport function isNodeHidden(scene: GateSource, id: NodeId): boolean {\n  return nodeGates(scene).hidden(id);\n}\n\n/** {@link NodeGates.locked} for one id. */\nexport function isNodeLocked(scene: GateSource, id: NodeId): boolean {\n  return nodeGates(scene).locked(id);\n}\n"],"mappings":";;;;AAqCA,SAAgB,aAAa,MAA8C;CACzE,OAAO,KAAK,WAAW;AACzB;;;;;;AAeA,SAAgB,UAAU,OAA8B;CACtD,MAAM,+BAAe,IAAI,IAAY;CACrC,MAAM,+BAAe,IAAI,IAAY;CACrC,KAAK,MAAM,KAAK,MAAM,UAAU,CAAC,GAAG;EAClC,IAAI,EAAE,YAAY,OAAO,aAAa,IAAI,EAAE,EAAE;EAC9C,IAAI,EAAE,WAAW,MAAM,aAAa,IAAI,EAAE,EAAE;CAC9C;;;CAIA,MAAM,aAAa,MAA2B,WAA+B;EAC3E,MAAM,uBAAO,IAAI,IAAqB;EACtC,MAAM,SAAS,IAAY,SAA+B;GACxD,MAAM,QAAQ,KAAK,IAAI,EAAE;GACzB,IAAI,UAAU,QAAW,OAAO;GAChC,MAAM,OAAO,MAAM,IAAI,EAAY;GACnC,IAAI,SAAS,UAAa,KAAK,IAAI,EAAE,GAAG,OAAO;GAC/C,KAAK,IAAI,EAAE;GACX,MAAM,SAAS,KAAK,UAAU;GAC9B,MAAM,OAAO,SAAS,WAAW,aAAa,IAAI,IAAI,KAAK,WAAW,SAChE,WAAW,QAAQ,OAAO,IAAI,KAAK,KAAK,KACxC,WAAW,QAAQ,MAAM,QAAQ,IAAI;GAC3C,KAAK,IAAI,IAAI,GAAG;GAChB,OAAO;EACT;EACA,QAAQ,OAAe,MAAM,oBAAI,IAAI,IAAI,CAAC;CAC5C;CAEA,MAAM,gBAAgB,UAAU,UAAU,IAAI;CAE9C,OAAO;EACL,OAAO,IAAI;GACT,MAAM,OAAO,MAAM,IAAI,EAAY;GACnC,IAAI,SAAS,QAAW,OAAO;GAC/B,OAAO,aAAa,IAAI,KAAK,KAAK,KAAK,cAAc,EAAE;EACzD;EACA,QAPa,UAAU,UAAU,YAOjC;CACF;AACF;;AAGA,SAAgB,aAAa,OAAmB,IAAqB;CACnE,OAAO,UAAU,KAAK,CAAC,CAAC,OAAO,EAAE;AACnC;;AAGA,SAAgB,aAAa,OAAmB,IAAqB;CACnE,OAAO,UAAU,KAAK,CAAC,CAAC,OAAO,EAAE;AACnC"}
+{"version":3,"file":"nodeGates.js","names":[],"sources":["../../../src/core/scene/nodeGates.ts"],"sourcesContent":["/**\n * Whether a node is shown, and whether it is in reach — the one place either\n * question is answered. Painting, picking, area selection, select-all,\n * snapping, export, and the scene's own lock guard all ask here.\n *\n * - **Hidden**: its own layer is not visible, or it or any ancestor carries\n *   `hidden`. A layer hides only the nodes tagged to it; a hidden node hides\n *   its whole subtree, as SVG's `display=\"none\"` does.\n * - **Locked**: it or any ancestor carries `locked`, or sits on a locked\n *   layer. A lock covers the whole subtree, whatever layers it spans.\n */\nimport type { NodeId } from './types';\n\n/** The node fields the gates read. A partial scene stand-in may leave `parent` out. */\nexport interface GatedNode {\n  readonly layer: string;\n  readonly parent?: string | null;\n  readonly hidden?: boolean;\n  readonly locked?: boolean;\n}\n\n/** The layer fields the gates read. Only an explicit `visible: false` hides. */\nexport interface GatedLayer {\n  readonly id: string;\n  readonly visible?: boolean;\n  readonly locked?: boolean;\n}\n\n/** What the gates read of a scene. A `Scene` is one. */\nexport interface GateSource {\n  readonly layers?: readonly GatedLayer[];\n  get(id: NodeId): GatedNode | undefined;\n}\n\n/** Whether `node`'s own flag hides it and its subtree. A walk from the roots\n *  down prunes where this holds instead of asking {@link NodeGates.hidden}\n *  per node; the two agree because this is the flag that answer climbs for. */\nexport function hidesSubtree(node: { readonly hidden?: boolean }): boolean {\n  return node.hidden === true;\n}\n\n/** Both answers, for one read of a scene. */\nexport interface NodeGates {\n  /** Whether `id` is not drawn. An id not in the scene is not hidden. */\n  hidden(id: string): boolean;\n  /** Whether `id` is out of reach. An id not in the scene is not locked. */\n  locked(id: string): boolean;\n}\n\n/**\n * The gates over `scene` as it stands now. Ancestor answers are remembered,\n * so a walk over every node climbs each chain once: build one per walk, and\n * a fresh one after an edit.\n */\nexport function nodeGates(scene: GateSource): NodeGates {\n  const hiddenLayers = new Set<string>();\n  const lockedLayers = new Set<string>();\n  for (const l of scene.layers ?? []) {\n    if (l.visible === false) hiddenLayers.add(l.id);\n    if (l.locked === true) lockedLayers.add(l.id);\n  }\n\n  /** Whether `flag` holds on the node at `id` or any ancestor, the node's\n   *  layer counting when `layers` holds it. */\n  const inherited = (flag: 'hidden' | 'locked', layers: Set<string> | null) => {\n    const memo = new Map<string, boolean>();\n    const climb = (id: string, seen: Set<string>): boolean => {\n      const known = memo.get(id);\n      if (known !== undefined) return known;\n      const node = scene.get(id as NodeId);\n      if (node === undefined || seen.has(id)) return false;\n      seen.add(id);\n      const parent = node.parent ?? null;\n      const out = (flag === 'hidden' ? hidesSubtree(node) : node.locked === true)\n        || (layers !== null && layers.has(node.layer))\n        || (parent !== null && climb(parent, seen));\n      memo.set(id, out);\n      return out;\n    };\n    return (id: string) => climb(id, new Set());\n  };\n\n  const flaggedHidden = inherited('hidden', null);\n  const locked = inherited('locked', lockedLayers);\n  return {\n    hidden(id) {\n      const node = scene.get(id as NodeId);\n      if (node === undefined) return false;\n      return hiddenLayers.has(node.layer) || flaggedHidden(id);\n    },\n    locked,\n  };\n}\n\n/** Whether `test` holds on the node at `id` or any ancestor, without the\n *  allocation {@link nodeGates} spends on a walk: the scene's lock guard asks\n *  this on every mutation. A parent cycle answers false, as the walk's does. */\nfunction climbs(scene: GateSource, id: string, test: (node: GatedNode) => boolean): boolean {\n  let seen: Set<string> | null = null;\n  let hops = 0;\n  for (let at: string | null = id; at !== null; ) {\n    const node = scene.get(at as NodeId);\n    if (node === undefined) return false;\n    if (++hops > 64) {\n      seen ??= new Set();\n      if (seen.has(at)) return false;\n      seen.add(at);\n    }\n    if (test(node)) return true;\n    at = node.parent ?? null;\n  }\n  return false;\n}\n\n/** The layers flagged `flag`, or null when none is: the usual answer, which\n *  lets a climb skip the layer test at every hop. */\nfunction flaggedLayers(scene: GateSource, flag: 'locked' | 'hidden'): Set<string> | null {\n  let out: Set<string> | null = null;\n  for (const l of scene.layers ?? []) {\n    if (flag === 'locked' ? l.locked === true : l.visible === false) (out ??= new Set()).add(l.id);\n  }\n  return out;\n}\n\n/** {@link NodeGates.hidden} for one id. */\nexport function isNodeHidden(scene: GateSource, id: NodeId): boolean {\n  const node = scene.get(id);\n  if (node === undefined) return false;\n  return flaggedLayers(scene, 'hidden')?.has(node.layer) === true || climbs(scene, id, hidesSubtree);\n}\n\n/** {@link NodeGates.locked} for one id. */\nexport function isNodeLocked(scene: GateSource, id: NodeId): boolean {\n  const layers = flaggedLayers(scene, 'locked');\n  return climbs(scene, id, layers === null\n    ? (node) => node.locked === true\n    : (node) => node.locked === true || layers.has(node.layer));\n}\n"],"mappings":";;;;AAqCA,SAAgB,aAAa,MAA8C;CACzE,OAAO,KAAK,WAAW;AACzB;;;;;;AAeA,SAAgB,UAAU,OAA8B;CACtD,MAAM,+BAAe,IAAI,IAAY;CACrC,MAAM,+BAAe,IAAI,IAAY;CACrC,KAAK,MAAM,KAAK,MAAM,UAAU,CAAC,GAAG;EAClC,IAAI,EAAE,YAAY,OAAO,aAAa,IAAI,EAAE,EAAE;EAC9C,IAAI,EAAE,WAAW,MAAM,aAAa,IAAI,EAAE,EAAE;CAC9C;;;CAIA,MAAM,aAAa,MAA2B,WAA+B;EAC3E,MAAM,uBAAO,IAAI,IAAqB;EACtC,MAAM,SAAS,IAAY,SAA+B;GACxD,MAAM,QAAQ,KAAK,IAAI,EAAE;GACzB,IAAI,UAAU,QAAW,OAAO;GAChC,MAAM,OAAO,MAAM,IAAI,EAAY;GACnC,IAAI,SAAS,UAAa,KAAK,IAAI,EAAE,GAAG,OAAO;GAC/C,KAAK,IAAI,EAAE;GACX,MAAM,SAAS,KAAK,UAAU;GAC9B,MAAM,OAAO,SAAS,WAAW,aAAa,IAAI,IAAI,KAAK,WAAW,SAChE,WAAW,QAAQ,OAAO,IAAI,KAAK,KAAK,KACxC,WAAW,QAAQ,MAAM,QAAQ,IAAI;GAC3C,KAAK,IAAI,IAAI,GAAG;GAChB,OAAO;EACT;EACA,QAAQ,OAAe,MAAM,oBAAI,IAAI,IAAI,CAAC;CAC5C;CAEA,MAAM,gBAAgB,UAAU,UAAU,IAAI;CAE9C,OAAO;EACL,OAAO,IAAI;GACT,MAAM,OAAO,MAAM,IAAI,EAAY;GACnC,IAAI,SAAS,QAAW,OAAO;GAC/B,OAAO,aAAa,IAAI,KAAK,KAAK,KAAK,cAAc,EAAE;EACzD;EACA,QAPa,UAAU,UAAU,YAOjC;CACF;AACF;;;;AAKA,SAAS,OAAO,OAAmB,IAAY,MAA6C;CAC1F,IAAI,OAA2B;CAC/B,IAAI,OAAO;CACX,KAAK,IAAI,KAAoB,IAAI,OAAO,OAAQ;EAC9C,MAAM,OAAO,MAAM,IAAI,EAAY;EACnC,IAAI,SAAS,QAAW,OAAO;EAC/B,IAAI,EAAE,OAAO,IAAI;GACf,yBAAS,IAAI,IAAI;GACjB,IAAI,KAAK,IAAI,EAAE,GAAG,OAAO;GACzB,KAAK,IAAI,EAAE;EACb;EACA,IAAI,KAAK,IAAI,GAAG,OAAO;EACvB,KAAK,KAAK,UAAU;CACtB;CACA,OAAO;AACT;;;AAIA,SAAS,cAAc,OAAmB,MAA+C;CACvF,IAAI,MAA0B;CAC9B,KAAK,MAAM,KAAK,MAAM,UAAU,CAAC,GAC/B,IAAI,SAAS,WAAW,EAAE,WAAW,OAAO,EAAE,YAAY,OAAO,CAAC,wBAAQ,IAAI,IAAI,EAAA,CAAG,IAAI,EAAE,EAAE;CAE/F,OAAO;AACT;;AAGA,SAAgB,aAAa,OAAmB,IAAqB;CACnE,MAAM,OAAO,MAAM,IAAI,EAAE;CACzB,IAAI,SAAS,QAAW,OAAO;CAC/B,OAAO,cAAc,OAAO,QAAQ,CAAC,EAAE,IAAI,KAAK,KAAK,MAAM,QAAQ,OAAO,OAAO,IAAI,YAAY;AACnG;;AAGA,SAAgB,aAAa,OAAmB,IAAqB;CACnE,MAAM,SAAS,cAAc,OAAO,QAAQ;CAC5C,OAAO,OAAO,OAAO,IAAI,WAAW,QAC/B,SAAS,KAAK,WAAW,QACzB,SAAS,KAAK,WAAW,QAAQ,OAAO,IAAI,KAAK,KAAK,CAAC;AAC9D"}

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

@@ -1,19 +1,38 @@
 import { blendParts } from "./blend.js";
 import { textAlongParts, wholeItem } from "./textAlong.js";
-import { bendAlongPath, repeatAlongPath } from "@weasel-js/geom";
+import { bendAlongPath, puckerBloatPath, repeatAlongPath, roughenPath, zigzagPath } from "@weasel-js/geom";
 
 //#region 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
-* along a path, text laid along a path.
+* along a path, text laid along a path, and one shape roughened, zigzagged,
+* or puckered and bloated.
 */
 /** The parts `effect` paints from `sources`, in its sources' order, or
 *  `null` when a source it needs is missing — a blend's spine among them,
 *  where it names one. */
 function effectParts(effect, sources) {
 	const [a, b] = sources;
-	if (!a || !b) return null;
+	if (!a) return null;
+	switch (effect.kind) {
+		case "roughen": return [{
+			path: roughenPath(a.world, effect),
+			fill: a.fill,
+			stroke: a.stroke
+		}];
+		case "zigzag": return [{
+			path: zigzagPath(a.world, effect),
+			fill: a.fill,
+			stroke: a.stroke
+		}];
+		case "puckerBloat": return [{
+			path: puckerBloatPath(a.world, effect),
+			fill: a.fill,
+			stroke: a.stroke
+		}];
+	}
+	if (!b) return null;
 	switch (effect.kind) {
 		case "blend": {
 			if (sources.length < 3) return blendParts(effect, a, b);

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

@@ -1 +1 @@
-{"version":3,"file":"effects.js","names":[],"sources":["../../../../src/core/scene/pathEffects/effects.ts"],"sourcesContent":["/**\n * The path effects, each as the parts it paints from its sources: a blend's\n * steps between two shapes, a shape bent along a spine, copies of a shape\n * along a path, text laid along a path.\n */\nimport {\n  bendAlongPath, repeatAlongPath, type BendAlongPathOptions, type RepeatAlongPathOptions,\n} from '@weasel-js/geom';\nimport type { DerivedPart } from '../derivedParts';\nimport { blendParts, type BlendEffect } from './blend';\nimport type { EffectSource, PathEffectOptions } from './source';\nimport { textAlongParts, wholeItem, type TextAlongEffect } from './textAlong';\n\nexport type { BlendEffect, PathEffectOptions, TextAlongEffect };\n\n/** A shape bent along a spine. Its sources are `[shape, spine]`. */\nexport interface BendAlongEffect extends BendAlongPathOptions, PathEffectOptions {\n  kind: 'bendAlong';\n}\n\n/** Copies of a shape along a path. Its sources are `[shape, path]`. */\nexport interface RepeatAlongEffect extends Omit<RepeatAlongPathOptions, 'flattenTolerance'>, PathEffectOptions {\n  kind: 'repeatAlong';\n}\n\n/** A path effect, as a node's `data.pathEffect` holds it. */\nexport type PathEffect = BlendEffect | BendAlongEffect | RepeatAlongEffect | TextAlongEffect;\n\n/** The parts `effect` paints from `sources`, in its sources' order, or\n *  `null` when a source it needs is missing — a blend's spine among them,\n *  where it names one. */\nexport function effectParts(effect: PathEffect, sources: readonly (EffectSource | null)[]): DerivedPart[] | null {\n  const [a, b] = sources;\n  if (!a || !b) return null;\n  switch (effect.kind) {\n    case 'blend': {\n      if (sources.length < 3) return blendParts(effect, a, b);\n      const spine = sources[2];\n      return spine ? blendParts(effect, a, b, spine.world) : null;\n    }\n    case 'bendAlong': {\n      const path = bendAlongPath(a.world, b.world, effect);\n      return path === null ? null : [{ path, fill: a.fill, stroke: a.stroke }];\n    }\n    case 'repeatAlong':\n      return repeatAlongPath(a.world, b.world, effect).map((path) => ({ path, fill: a.fill, stroke: a.stroke }));\n    case 'textAlong':\n      return textAlongParts(effect, a.items?.() ?? [wholeItem(a)], b.world);\n  }\n}\n"],"mappings":";;;;;;;;;;;;;AA+BA,SAAgB,YAAY,QAAoB,SAAiE;CAC/G,MAAM,CAAC,GAAG,KAAK;CACf,IAAI,CAAC,KAAK,CAAC,GAAG,OAAO;CACrB,QAAQ,OAAO,MAAf;EACE,KAAK,SAAS;GACZ,IAAI,QAAQ,SAAS,GAAG,OAAO,WAAW,QAAQ,GAAG,CAAC;GACtD,MAAM,QAAQ,QAAQ;GACtB,OAAO,QAAQ,WAAW,QAAQ,GAAG,GAAG,MAAM,KAAK,IAAI;EACzD;EACA,KAAK,aAAa;GAChB,MAAM,OAAO,cAAc,EAAE,OAAO,EAAE,OAAO,MAAM;GACnD,OAAO,SAAS,OAAO,OAAO,CAAC;IAAE;IAAM,MAAM,EAAE;IAAM,QAAQ,EAAE;GAAO,CAAC;EACzE;EACA,KAAK,eACH,OAAO,gBAAgB,EAAE,OAAO,EAAE,OAAO,MAAM,CAAC,CAAC,KAAK,UAAU;GAAE;GAAM,MAAM,EAAE;GAAM,QAAQ,EAAE;EAAO,EAAE;EAC3G,KAAK,aACH,OAAO,eAAe,QAAQ,EAAE,QAAQ,KAAK,CAAC,UAAU,CAAC,CAAC,GAAG,EAAE,KAAK;CACxE;AACF"}
+{"version":3,"file":"effects.js","names":[],"sources":["../../../../src/core/scene/pathEffects/effects.ts"],"sourcesContent":["/**\n * The path effects, each as the parts it paints from its sources: a blend's\n * steps between two shapes, a shape bent along a spine, copies of a shape\n * along a path, text laid along a path, and one shape roughened, zigzagged,\n * or puckered and bloated.\n */\nimport {\n  bendAlongPath, puckerBloatPath, repeatAlongPath, roughenPath, zigzagPath, type BendAlongPathOptions,\n  type PuckerBloatPathOptions, type RepeatAlongPathOptions, type RoughenPathOptions, type ZigzagPathOptions,\n} from '@weasel-js/geom';\nimport type { DerivedPart } from '../derivedParts';\nimport { blendParts, type BlendEffect } from './blend';\nimport type { EffectSource, PathEffectOptions } from './source';\nimport { textAlongParts, wholeItem, type TextAlongEffect } from './textAlong';\n\nexport type { BlendEffect, PathEffectOptions, TextAlongEffect };\n\n/** A shape bent along a spine. Its sources are `[shape, spine]`. */\nexport interface BendAlongEffect extends BendAlongPathOptions, PathEffectOptions {\n  kind: 'bendAlong';\n}\n\n/** Copies of a shape along a path. Its sources are `[shape, path]`. */\nexport interface RepeatAlongEffect extends Omit<RepeatAlongPathOptions, 'flattenTolerance'>, PathEffectOptions {\n  kind: 'repeatAlong';\n}\n\n/** A shape with every point of its outline moved at random. Its source is `[shape]`. */\nexport interface RoughenEffect extends RoughenPathOptions, PathEffectOptions {\n  kind: 'roughen';\n}\n\n/** A shape with its outline pushed alternately to either side. Its source is `[shape]`. */\nexport interface ZigzagEffect extends ZigzagPathOptions, PathEffectOptions {\n  kind: 'zigzag';\n}\n\n/** A shape with its anchors pulled toward its middle and its handles pushed\n *  away, or the reverse. Its source is `[shape]`. */\nexport interface PuckerBloatEffect extends PuckerBloatPathOptions, PathEffectOptions {\n  kind: 'puckerBloat';\n}\n\n/** A path effect, as a node's `data.pathEffect` holds it. */\nexport type PathEffect =\n  | BlendEffect | BendAlongEffect | RepeatAlongEffect | TextAlongEffect | RoughenEffect | ZigzagEffect | PuckerBloatEffect;\n\n/** The parts `effect` paints from `sources`, in its sources' order, or\n *  `null` when a source it needs is missing — a blend's spine among them,\n *  where it names one. */\nexport function effectParts(effect: PathEffect, sources: readonly (EffectSource | null)[]): DerivedPart[] | null {\n  const [a, b] = sources;\n  if (!a) return null;\n  switch (effect.kind) {\n    case 'roughen':\n      return [{ path: roughenPath(a.world, effect), fill: a.fill, stroke: a.stroke }];\n    case 'zigzag':\n      return [{ path: zigzagPath(a.world, effect), fill: a.fill, stroke: a.stroke }];\n    case 'puckerBloat':\n      return [{ path: puckerBloatPath(a.world, effect), fill: a.fill, stroke: a.stroke }];\n  }\n  if (!b) return null;\n  switch (effect.kind) {\n    case 'blend': {\n      if (sources.length < 3) return blendParts(effect, a, b);\n      const spine = sources[2];\n      return spine ? blendParts(effect, a, b, spine.world) : null;\n    }\n    case 'bendAlong': {\n      const path = bendAlongPath(a.world, b.world, effect);\n      return path === null ? null : [{ path, fill: a.fill, stroke: a.stroke }];\n    }\n    case 'repeatAlong':\n      return repeatAlongPath(a.world, b.world, effect).map((path) => ({ path, fill: a.fill, stroke: a.stroke }));\n    case 'textAlong':\n      return textAlongParts(effect, a.items?.() ?? [wholeItem(a)], b.world);\n  }\n}\n"],"mappings":";;;;;;;;;;;;;;AAkDA,SAAgB,YAAY,QAAoB,SAAiE;CAC/G,MAAM,CAAC,GAAG,KAAK;CACf,IAAI,CAAC,GAAG,OAAO;CACf,QAAQ,OAAO,MAAf;EACE,KAAK,WACH,OAAO,CAAC;GAAE,MAAM,YAAY,EAAE,OAAO,MAAM;GAAG,MAAM,EAAE;GAAM,QAAQ,EAAE;EAAO,CAAC;EAChF,KAAK,UACH,OAAO,CAAC;GAAE,MAAM,WAAW,EAAE,OAAO,MAAM;GAAG,MAAM,EAAE;GAAM,QAAQ,EAAE;EAAO,CAAC;EAC/E,KAAK,eACH,OAAO,CAAC;GAAE,MAAM,gBAAgB,EAAE,OAAO,MAAM;GAAG,MAAM,EAAE;GAAM,QAAQ,EAAE;EAAO,CAAC;CACtF;CACA,IAAI,CAAC,GAAG,OAAO;CACf,QAAQ,OAAO,MAAf;EACE,KAAK,SAAS;GACZ,IAAI,QAAQ,SAAS,GAAG,OAAO,WAAW,QAAQ,GAAG,CAAC;GACtD,MAAM,QAAQ,QAAQ;GACtB,OAAO,QAAQ,WAAW,QAAQ,GAAG,GAAG,MAAM,KAAK,IAAI;EACzD;EACA,KAAK,aAAa;GAChB,MAAM,OAAO,cAAc,EAAE,OAAO,EAAE,OAAO,MAAM;GACnD,OAAO,SAAS,OAAO,OAAO,CAAC;IAAE;IAAM,MAAM,EAAE;IAAM,QAAQ,EAAE;GAAO,CAAC;EACzE;EACA,KAAK,eACH,OAAO,gBAAgB,EAAE,OAAO,EAAE,OAAO,MAAM,CAAC,CAAC,KAAK,UAAU;GAAE;GAAM,MAAM,EAAE;GAAM,QAAQ,EAAE;EAAO,EAAE;EAC3G,KAAK,aACH,OAAO,eAAe,QAAQ,EAAE,QAAQ,KAAK,CAAC,UAAU,CAAC,CAAC,GAAG,EAAE,KAAK;CACxE;AACF"}

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

@@ -1,3 +1,4 @@
+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
@@ -27,25 +28,37 @@ function textAlongParts(effect, items, path) {
 		side: effect.side ?? "auto",
 		about
 	});
+	const shift = finiteOr(effect.shift, 0);
 	const places = placeAlongRun(run, lengths, {
 		gap,
 		align: "center",
 		at: run.reversed ? L - c : c,
-		shift: finiteOr(effect.shift, 0),
+		shift,
 		wrap: closed
 	});
 	const center = effect.anchor === "center";
 	const out = [];
+	const laid = [];
 	const firstStart = places[0].center - lengths[0] / 2;
 	places.forEach((place, i) => {
-		if (dropped(place, closed ? firstStart : null, L)) return;
+		if (dropped(place, closed ? firstStart : null, L)) {
+			laid.push(null);
+			return;
+		}
 		const item = items[i];
-		const m = itemFrame(place, item.length, center ? item.middle : 0);
+		const lift = center ? item.middle : 0;
+		const m = itemFrame(place, item.length, lift);
 		for (const part of item.parts) out.push({
 			...part,
 			path: transformPath(part.path, m)
 		});
+		laid.push({
+			item,
+			start: place.center - item.length / 2,
+			lift
+		});
 	});
+	if (items.some((it) => it.bands !== void 0 && it.bands.length > 0)) out.push(...bandParts(laid, run, shift));
 	return out;
 }
 /** `source`'s whole outline as one item: its bounds' left at x = 0 and their vertical middle on the anchor line. */

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

@@ -1 +1 @@
-{"version":3,"file":"textAlong.js","names":[],"sources":["../../../../src/core/scene/pathEffects/textAlong.ts"],"sourcesContent":["/**\n * Text along a path: a source's items — a text node's grapheme clusters, or a\n * whole shape as one item — laid end to end along a path, each turned to it.\n */\nimport {\n  boundsOfPath, multiply, pathShape, placeAlongRun, rotate, runLength, trackRun, transformPath, translate,\n  type Affine, type Path, type RunAlign, type RunPlace, type TrackSide,\n} from '@weasel-js/geom';\nimport type { DerivedPart } from '../derivedParts';\nimport type { EffectItem, EffectSource, PathEffectOptions } from './source';\n\n/**\n * Text (or any shape) laid along a path, item by item. Its sources are `[text, path]`. Only the text's first laid line\n * follows the path; a color glyph keeps its advance and paints nothing; underlines and other decorations are not drawn.\n * On an open path an item whose middle falls past either end is not drawn; on a closed one the text wraps past the\n * seam, and an item a whole lap on from the first item's start is not drawn.\n */\nexport interface TextAlongEffect extends PathEffectOptions {\n  kind: 'textAlong';\n  /** Which part of the text sits at `start`. Default `'start'`. */\n  align?: RunAlign;\n  /** Where the text sits, as a fraction 0..1 of the path's length from its first point. Default 0. */\n  start?: number;\n  /** How far the anchor line sits off the path, toward the glyphs' up, in world units. Default 0. */\n  shift?: number;\n  /** What sits on the path: the glyphs' baseline, or (`'center'`) their x-height middle. Default `'baseline'`. */\n  anchor?: 'baseline' | 'center';\n  /** Text longer than its room is cut at the path's end (`'clip'`), or has the gaps between items squeezed until it\n   *  fits (`'fit'`). Default `'clip'`. */\n  overflow?: 'clip' | 'fit';\n  /** Which side of the path the glyphs stand on; see `TrackSide`. Default `'auto'`, whichever reads upright. Turned over,\n   *  the text keeps the stretch of path it had, and on an open path drops whichever letters fall off it. */\n  side?: TrackSide;\n}\n\nconst LEAD: Record<RunAlign, number> = { start: 0, center: 0.5, end: 1 };\n\n/** The parts `items` paint laid along `path` as `effect` says; `[]` when there is nothing to lay or nowhere to lay it. */\nexport function textAlongParts(effect: TextAlongEffect, items: readonly EffectItem[], path: Path): DerivedPart[] {\n  const shape = pathShape(path);\n  if (shape === null || !(shape.length > 0) || items.length === 0) return [];\n  const L = shape.length;\n  const closed = shape.closed;\n  const lengths = items.map((it) => it.length);\n  const k = LEAD[effect.align ?? 'start'];\n  const at = clamp01(effect.start ?? 0) * L;\n  const gap = effect.overflow === 'fit' ? fitGap(lengths, roomAt(at, L, k, closed)) : 0;\n  const total = runLength(lengths, gap);\n  const c = at + (0.5 - k) * total;\n  const about = closed ? ((c / L) % 1 + 1) % 1 : clamp01(c / L);\n  const run = trackRun(shape, 0, 1, { side: effect.side ?? 'auto', about });\n  const places = placeAlongRun(run, lengths, {\n    gap, align: 'center', at: run.reversed ? L - c : c, shift: finiteOr(effect.shift, 0), wrap: closed,\n  });\n  const center = effect.anchor === 'center';\n  const out: DerivedPart[] = [];\n  const firstStart = places[0]!.center - lengths[0]! / 2;\n  places.forEach((place, i) => {\n    // By center (SVG textPath's rule), not by RunPlace.clipped, which judges by extent.\n    if (dropped(place, closed ? firstStart : null, L)) return;\n    const item = items[i]!;\n    const m = itemFrame(place, item.length, center ? item.middle : 0);\n    for (const part of item.parts) out.push({ ...part, path: transformPath(part.path, m) });\n  });\n  return out;\n}\n\n/** `source`'s whole outline as one item: its bounds' left at x = 0 and their vertical middle on the anchor line. */\nexport function wholeItem(source: EffectSource): EffectItem {\n  const b = boundsOfPath(source.world);\n  return {\n    length: b.width,\n    middle: 0,\n    parts: [{\n      path: transformPath(source.world, translate(-b.x, -(b.y + b.height / 2))),\n      fill: source.fill,\n      stroke: source.stroke,\n    }],\n  };\n}\n\n/** SVG `textPath`'s rule: an item is not drawn once its middle is past an open path's ends, or on a closed path a whole\n *  lap or more on from the first item's start. Judged within a hair of rounding. */\nfunction dropped(place: RunPlace, firstStart: number | null, L: number): boolean {\n  const hair = 1e-9 * Math.max(1, L);\n  if (firstStart !== null) return place.center - firstStart >= L - hair;\n  return place.center < -hair || place.center > L + hair;\n}\n\n/** How much path the text has before it runs off, from `at`, with `k` of it laid back behind `at`. */\nfunction roomAt(at: number, L: number, k: number, closed: boolean): number {\n  if (closed) return L;\n  return k === 0 ? L - at : k === 1 ? at : 2 * Math.min(at, L - at);\n}\n\n/** The gap that makes `lengths` fill `room`, or 0 when they fit already. Never so negative that an item's step back\n *  from the one before it (its length plus the gap) goes below zero, so items keep their order in too short a room. */\nfunction fitGap(lengths: readonly number[], room: number): number {\n  const total = runLength(lengths, 0);\n  if (!(total > room) || lengths.length < 2) return 0;\n  let floor = -Infinity;\n  for (let i = 1; i < lengths.length; i++) floor = Math.max(floor, -(lengths[i - 1]! + lengths[i]!) / 2);\n  return Math.max((room - total) / (lengths.length - 1), floor);\n}\n\n/** Item frame to world: its middle on `place`, turned to it, its anchor line `lift` above y = 0 brought onto the path. */\nfunction itemFrame(place: RunPlace, length: number, lift: number): Affine {\n  const turn = multiply(rotate((place.angle * Math.PI) / 180), translate(-length / 2, lift));\n  return multiply(translate(place.point.x, place.point.y), turn);\n}\n\nconst clamp01 = (v: number): number => (v > 1 ? 1 : v > 0 ? v : 0);\nconst finiteOr = (v: number | undefined, d: number): number => (v !== undefined && Number.isFinite(v) ? v : d);\n"],"mappings":";;;;;;;AAmCA,IAAM,OAAiC;CAAE,OAAO;CAAG,QAAQ;CAAK,KAAK;AAAE;;AAGvE,SAAgB,eAAe,QAAyB,OAA8B,MAA2B;CAC/G,MAAM,QAAQ,UAAU,IAAI;CAC5B,IAAI,UAAU,QAAQ,EAAE,MAAM,SAAS,MAAM,MAAM,WAAW,GAAG,OAAO,CAAC;CACzE,MAAM,IAAI,MAAM;CAChB,MAAM,SAAS,MAAM;CACrB,MAAM,UAAU,MAAM,KAAK,OAAO,GAAG,MAAM;CAC3C,MAAM,IAAI,KAAK,OAAO,SAAS;CAC/B,MAAM,KAAK,QAAQ,OAAO,SAAS,CAAC,IAAI;CACxC,MAAM,MAAM,OAAO,aAAa,QAAQ,OAAO,SAAS,OAAO,IAAI,GAAG,GAAG,MAAM,CAAC,IAAI;CACpF,MAAM,QAAQ,UAAU,SAAS,GAAG;CACpC,MAAM,IAAI,MAAM,KAAM,KAAK;CAC3B,MAAM,QAAQ,UAAW,IAAI,IAAK,IAAI,KAAK,IAAI,QAAQ,IAAI,CAAC;CAC5D,MAAM,MAAM,SAAS,OAAO,GAAG,GAAG;EAAE,MAAM,OAAO,QAAQ;EAAQ;CAAM,CAAC;CACxE,MAAM,SAAS,cAAc,KAAK,SAAS;EACzC;EAAK,OAAO;EAAU,IAAI,IAAI,WAAW,IAAI,IAAI;EAAG,OAAO,SAAS,OAAO,OAAO,CAAC;EAAG,MAAM;CAC9F,CAAC;CACD,MAAM,SAAS,OAAO,WAAW;CACjC,MAAM,MAAqB,CAAC;CAC5B,MAAM,aAAa,OAAO,EAAE,CAAE,SAAS,QAAQ,KAAM;CACrD,OAAO,SAAS,OAAO,MAAM;EAE3B,IAAI,QAAQ,OAAO,SAAS,aAAa,MAAM,CAAC,GAAG;EACnD,MAAM,OAAO,MAAM;EACnB,MAAM,IAAI,UAAU,OAAO,KAAK,QAAQ,SAAS,KAAK,SAAS,CAAC;EAChE,KAAK,MAAM,QAAQ,KAAK,OAAO,IAAI,KAAK;GAAE,GAAG;GAAM,MAAM,cAAc,KAAK,MAAM,CAAC;EAAE,CAAC;CACxF,CAAC;CACD,OAAO;AACT;;AAGA,SAAgB,UAAU,QAAkC;CAC1D,MAAM,IAAI,aAAa,OAAO,KAAK;CACnC,OAAO;EACL,QAAQ,EAAE;EACV,QAAQ;EACR,OAAO,CAAC;GACN,MAAM,cAAc,OAAO,OAAO,UAAU,CAAC,EAAE,GAAG,EAAE,EAAE,IAAI,EAAE,SAAS,EAAE,CAAC;GACxE,MAAM,OAAO;GACb,QAAQ,OAAO;EACjB,CAAC;CACH;AACF;;;AAIA,SAAS,QAAQ,OAAiB,YAA2B,GAAoB;CAC/E,MAAM,OAAO,OAAO,KAAK,IAAI,GAAG,CAAC;CACjC,IAAI,eAAe,MAAM,OAAO,MAAM,SAAS,cAAc,IAAI;CACjE,OAAO,MAAM,SAAS,CAAC,QAAQ,MAAM,SAAS,IAAI;AACpD;;AAGA,SAAS,OAAO,IAAY,GAAW,GAAW,QAAyB;CACzE,IAAI,QAAQ,OAAO;CACnB,OAAO,MAAM,IAAI,IAAI,KAAK,MAAM,IAAI,KAAK,IAAI,KAAK,IAAI,IAAI,IAAI,EAAE;AAClE;;;AAIA,SAAS,OAAO,SAA4B,MAAsB;CAChE,MAAM,QAAQ,UAAU,SAAS,CAAC;CAClC,IAAI,EAAE,QAAQ,SAAS,QAAQ,SAAS,GAAG,OAAO;CAClD,IAAI,QAAQ;CACZ,KAAK,IAAI,IAAI,GAAG,IAAI,QAAQ,QAAQ,KAAK,QAAQ,KAAK,IAAI,OAAO,EAAE,QAAQ,IAAI,KAAM,QAAQ,MAAO,CAAC;CACrG,OAAO,KAAK,KAAK,OAAO,UAAU,QAAQ,SAAS,IAAI,KAAK;AAC9D;;AAGA,SAAS,UAAU,OAAiB,QAAgB,MAAsB;CACxE,MAAM,OAAO,SAAS,OAAQ,MAAM,QAAQ,KAAK,KAAM,GAAG,GAAG,UAAU,CAAC,SAAS,GAAG,IAAI,CAAC;CACzF,OAAO,SAAS,UAAU,MAAM,MAAM,GAAG,MAAM,MAAM,CAAC,GAAG,IAAI;AAC/D;AAEA,IAAM,WAAW,MAAuB,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI;AAChE,IAAM,YAAY,GAAuB,MAAuB,MAAM,UAAa,OAAO,SAAS,CAAC,IAAI,IAAI"}
+{"version":3,"file":"textAlong.js","names":[],"sources":["../../../../src/core/scene/pathEffects/textAlong.ts"],"sourcesContent":["/**\n * Text along a path: a source's items — a text node's grapheme clusters, or a\n * whole shape as one item — laid end to end along a path, each turned to it.\n */\nimport {\n  boundsOfPath, multiply, pathShape, placeAlongRun, rotate, runLength, trackRun, transformPath, translate,\n  type Affine, type Path, type RunAlign, type RunPlace, type TrackSide,\n} from '@weasel-js/geom';\nimport type { DerivedPart } from '../derivedParts';\nimport type { EffectItem, EffectSource, PathEffectOptions } from './source';\nimport { bandParts, type LaidItem } from './textAlongBands';\n\n/**\n * Text (or any shape) laid along a path, item by item. Its sources are `[text, path]`. Only the text's first laid line\n * follows the path; a color glyph keeps its advance and paints nothing. An item's bands — underline, strikethrough and\n * overline — join their alike neighbors' and bend with the path as one ribbon, while the glyphs stay rigid.\n * On an open path an item whose middle falls past either end is not drawn; on a closed one the text wraps past the\n * seam, and an item a whole lap on from the first item's start is not drawn.\n */\nexport interface TextAlongEffect extends PathEffectOptions {\n  kind: 'textAlong';\n  /** Which part of the text sits at `start`. Default `'start'`. */\n  align?: RunAlign;\n  /** Where the text sits, as a fraction 0..1 of the path's length from its first point. Default 0. */\n  start?: number;\n  /** How far the anchor line sits off the path, toward the glyphs' up, in world units. Default 0. */\n  shift?: number;\n  /** What sits on the path: the glyphs' baseline, or (`'center'`) their x-height middle. Default `'baseline'`. */\n  anchor?: 'baseline' | 'center';\n  /** Text longer than its room is cut at the path's end (`'clip'`), or has the gaps between items squeezed until it\n   *  fits (`'fit'`). Default `'clip'`. */\n  overflow?: 'clip' | 'fit';\n  /** Which side of the path the glyphs stand on; see `TrackSide`. Default `'auto'`, whichever reads upright. Turned over,\n   *  the text keeps the stretch of path it had, and on an open path drops whichever letters fall off it. */\n  side?: TrackSide;\n}\n\nconst LEAD: Record<RunAlign, number> = { start: 0, center: 0.5, end: 1 };\n\n/** The parts `items` paint laid along `path` as `effect` says; `[]` when there is nothing to lay or nowhere to lay it. */\nexport function textAlongParts(effect: TextAlongEffect, items: readonly EffectItem[], path: Path): DerivedPart[] {\n  const shape = pathShape(path);\n  if (shape === null || !(shape.length > 0) || items.length === 0) return [];\n  const L = shape.length;\n  const closed = shape.closed;\n  const lengths = items.map((it) => it.length);\n  const k = LEAD[effect.align ?? 'start'];\n  const at = clamp01(effect.start ?? 0) * L;\n  const gap = effect.overflow === 'fit' ? fitGap(lengths, roomAt(at, L, k, closed)) : 0;\n  const total = runLength(lengths, gap);\n  const c = at + (0.5 - k) * total;\n  const about = closed ? ((c / L) % 1 + 1) % 1 : clamp01(c / L);\n  const run = trackRun(shape, 0, 1, { side: effect.side ?? 'auto', about });\n  const shift = finiteOr(effect.shift, 0);\n  const places = placeAlongRun(run, lengths, { gap, align: 'center', at: run.reversed ? L - c : c, shift, wrap: closed });\n  const center = effect.anchor === 'center';\n  const out: DerivedPart[] = [];\n  const laid: (LaidItem | null)[] = [];\n  const firstStart = places[0]!.center - lengths[0]! / 2;\n  places.forEach((place, i) => {\n    // By center (SVG textPath's rule), not by RunPlace.clipped, which judges by extent.\n    if (dropped(place, closed ? firstStart : null, L)) {\n      laid.push(null);\n      return;\n    }\n    const item = items[i]!;\n    const lift = center ? item.middle : 0;\n    const m = itemFrame(place, item.length, lift);\n    for (const part of item.parts) out.push({ ...part, path: transformPath(part.path, m) });\n    laid.push({ item, start: place.center - item.length / 2, lift });\n  });\n  if (items.some((it) => it.bands !== undefined && it.bands.length > 0)) out.push(...bandParts(laid, run, shift));\n  return out;\n}\n\n/** `source`'s whole outline as one item: its bounds' left at x = 0 and their vertical middle on the anchor line. */\nexport function wholeItem(source: EffectSource): EffectItem {\n  const b = boundsOfPath(source.world);\n  return {\n    length: b.width,\n    middle: 0,\n    parts: [{\n      path: transformPath(source.world, translate(-b.x, -(b.y + b.height / 2))),\n      fill: source.fill,\n      stroke: source.stroke,\n    }],\n  };\n}\n\n/** SVG `textPath`'s rule: an item is not drawn once its middle is past an open path's ends, or on a closed path a whole\n *  lap or more on from the first item's start. Judged within a hair of rounding. */\nfunction dropped(place: RunPlace, firstStart: number | null, L: number): boolean {\n  const hair = 1e-9 * Math.max(1, L);\n  if (firstStart !== null) return place.center - firstStart >= L - hair;\n  return place.center < -hair || place.center > L + hair;\n}\n\n/** How much path the text has before it runs off, from `at`, with `k` of it laid back behind `at`. */\nfunction roomAt(at: number, L: number, k: number, closed: boolean): number {\n  if (closed) return L;\n  return k === 0 ? L - at : k === 1 ? at : 2 * Math.min(at, L - at);\n}\n\n/** The gap that makes `lengths` fill `room`, or 0 when they fit already. Never so negative that an item's step back\n *  from the one before it (its length plus the gap) goes below zero, so items keep their order in too short a room. */\nfunction fitGap(lengths: readonly number[], room: number): number {\n  const total = runLength(lengths, 0);\n  if (!(total > room) || lengths.length < 2) return 0;\n  let floor = -Infinity;\n  for (let i = 1; i < lengths.length; i++) floor = Math.max(floor, -(lengths[i - 1]! + lengths[i]!) / 2);\n  return Math.max((room - total) / (lengths.length - 1), floor);\n}\n\n/** Item frame to world: its middle on `place`, turned to it, its anchor line `lift` above y = 0 brought onto the path. */\nfunction itemFrame(place: RunPlace, length: number, lift: number): Affine {\n  const turn = multiply(rotate((place.angle * Math.PI) / 180), translate(-length / 2, lift));\n  return multiply(translate(place.point.x, place.point.y), turn);\n}\n\nconst clamp01 = (v: number): number => (v > 1 ? 1 : v > 0 ? v : 0);\nconst finiteOr = (v: number | undefined, d: number): number => (v !== undefined && Number.isFinite(v) ? v : d);\n"],"mappings":";;;;;;;;AAqCA,IAAM,OAAiC;CAAE,OAAO;CAAG,QAAQ;CAAK,KAAK;AAAE;;AAGvE,SAAgB,eAAe,QAAyB,OAA8B,MAA2B;CAC/G,MAAM,QAAQ,UAAU,IAAI;CAC5B,IAAI,UAAU,QAAQ,EAAE,MAAM,SAAS,MAAM,MAAM,WAAW,GAAG,OAAO,CAAC;CACzE,MAAM,IAAI,MAAM;CAChB,MAAM,SAAS,MAAM;CACrB,MAAM,UAAU,MAAM,KAAK,OAAO,GAAG,MAAM;CAC3C,MAAM,IAAI,KAAK,OAAO,SAAS;CAC/B,MAAM,KAAK,QAAQ,OAAO,SAAS,CAAC,IAAI;CACxC,MAAM,MAAM,OAAO,aAAa,QAAQ,OAAO,SAAS,OAAO,IAAI,GAAG,GAAG,MAAM,CAAC,IAAI;CACpF,MAAM,QAAQ,UAAU,SAAS,GAAG;CACpC,MAAM,IAAI,MAAM,KAAM,KAAK;CAC3B,MAAM,QAAQ,UAAW,IAAI,IAAK,IAAI,KAAK,IAAI,QAAQ,IAAI,CAAC;CAC5D,MAAM,MAAM,SAAS,OAAO,GAAG,GAAG;EAAE,MAAM,OAAO,QAAQ;EAAQ;CAAM,CAAC;CACxE,MAAM,QAAQ,SAAS,OAAO,OAAO,CAAC;CACtC,MAAM,SAAS,cAAc,KAAK,SAAS;EAAE;EAAK,OAAO;EAAU,IAAI,IAAI,WAAW,IAAI,IAAI;EAAG;EAAO,MAAM;CAAO,CAAC;CACtH,MAAM,SAAS,OAAO,WAAW;CACjC,MAAM,MAAqB,CAAC;CAC5B,MAAM,OAA4B,CAAC;CACnC,MAAM,aAAa,OAAO,EAAE,CAAE,SAAS,QAAQ,KAAM;CACrD,OAAO,SAAS,OAAO,MAAM;EAE3B,IAAI,QAAQ,OAAO,SAAS,aAAa,MAAM,CAAC,GAAG;GACjD,KAAK,KAAK,IAAI;GACd;EACF;EACA,MAAM,OAAO,MAAM;EACnB,MAAM,OAAO,SAAS,KAAK,SAAS;EACpC,MAAM,IAAI,UAAU,OAAO,KAAK,QAAQ,IAAI;EAC5C,KAAK,MAAM,QAAQ,KAAK,OAAO,IAAI,KAAK;GAAE,GAAG;GAAM,MAAM,cAAc,KAAK,MAAM,CAAC;EAAE,CAAC;EACtF,KAAK,KAAK;GAAE;GAAM,OAAO,MAAM,SAAS,KAAK,SAAS;GAAG;EAAK,CAAC;CACjE,CAAC;CACD,IAAI,MAAM,MAAM,OAAO,GAAG,UAAU,UAAa,GAAG,MAAM,SAAS,CAAC,GAAG,IAAI,KAAK,GAAG,UAAU,MAAM,KAAK,KAAK,CAAC;CAC9G,OAAO;AACT;;AAGA,SAAgB,UAAU,QAAkC;CAC1D,MAAM,IAAI,aAAa,OAAO,KAAK;CACnC,OAAO;EACL,QAAQ,EAAE;EACV,QAAQ;EACR,OAAO,CAAC;GACN,MAAM,cAAc,OAAO,OAAO,UAAU,CAAC,EAAE,GAAG,EAAE,EAAE,IAAI,EAAE,SAAS,EAAE,CAAC;GACxE,MAAM,OAAO;GACb,QAAQ,OAAO;EACjB,CAAC;CACH;AACF;;;AAIA,SAAS,QAAQ,OAAiB,YAA2B,GAAoB;CAC/E,MAAM,OAAO,OAAO,KAAK,IAAI,GAAG,CAAC;CACjC,IAAI,eAAe,MAAM,OAAO,MAAM,SAAS,cAAc,IAAI;CACjE,OAAO,MAAM,SAAS,CAAC,QAAQ,MAAM,SAAS,IAAI;AACpD;;AAGA,SAAS,OAAO,IAAY,GAAW,GAAW,QAAyB;CACzE,IAAI,QAAQ,OAAO;CACnB,OAAO,MAAM,IAAI,IAAI,KAAK,MAAM,IAAI,KAAK,IAAI,KAAK,IAAI,IAAI,IAAI,EAAE;AAClE;;;AAIA,SAAS,OAAO,SAA4B,MAAsB;CAChE,MAAM,QAAQ,UAAU,SAAS,CAAC;CAClC,IAAI,EAAE,QAAQ,SAAS,QAAQ,SAAS,GAAG,OAAO;CAClD,IAAI,QAAQ;CACZ,KAAK,IAAI,IAAI,GAAG,IAAI,QAAQ,QAAQ,KAAK,QAAQ,KAAK,IAAI,OAAO,EAAE,QAAQ,IAAI,KAAM,QAAQ,MAAO,CAAC;CACrG,OAAO,KAAK,KAAK,OAAO,UAAU,QAAQ,SAAS,IAAI,KAAK;AAC9D;;AAGA,SAAS,UAAU,OAAiB,QAAgB,MAAsB;CACxE,MAAM,OAAO,SAAS,OAAQ,MAAM,QAAQ,KAAK,KAAM,GAAG,GAAG,UAAU,CAAC,SAAS,GAAG,IAAI,CAAC;CACzF,OAAO,SAAS,UAAU,MAAM,MAAM,GAAG,MAAM,MAAM,CAAC,GAAG,IAAI;AAC/D;AAEA,IAAM,WAAW,MAAuB,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI;AAChE,IAAM,YAAY,GAAuB,MAAuB,MAAM,UAAa,OAAO,SAAS,CAAC,IAAI,IAAI"}