@weasel-js/core 1.14.2 → 1.15.1

package/dist/core/geometry/regionHit.js

@@ -2,7 +2,7 @@ import { nodeMemo } from "../scene/nodeMemo.js";
 import { visualBoundsViaDescriptor } from "./poseDescriptor.js";
 import { boxContainsBox, pathThroughPoseFrame, pointInPolygon, polygonContainsPath, polygonIntersectsPath, poseFrameOf } from "@weasel-js/geom";
 
-//#region src/core/geometry/regionHit.ts
+// src/core/geometry/regionHit.ts
 /**
 * Whether a marquee or a lasso takes one node: the per-node decision the
 * scene's area walk (`canvas/deps/hitTestArea`) makes.
@@ -103,23 +103,16 @@ function poseOutline(pose, b) {
 	};
 }
 /**
-* Whether `region` takes a node under `mode`, given its pose, its bounds `b`
-* from {@link regionBoundsOf}, and its drawn outline on demand.
-*
-* - `intersect` — the outline meets the region anywhere: its interior too,
-*   unless `filled` says nothing paints it.
-* - `enclosed` — the whole outline lies inside it.
-* - `centers` — the center of `b` lies inside it.
-*
-* `b` only rejects: it encloses the outline and may reach past it, so a node
-* is taken by the outline alone. A node without finite bounds is never taken.
+* What `b` alone decides of {@link regionTakes}, or undefined when the
+* outline has to be asked: a caller that builds the outline's thunks per node
+* asks this first and builds them only for the nodes it leaves open.
 */
-function regionTakes(region, mode, pose, b, outline, filled = () => true) {
+function regionTakesByBounds(region, mode, b) {
 	if (!Number.isFinite(b.x) || !Number.isFinite(b.y) || !Number.isFinite(b.width) || !Number.isFinite(b.height)) return false;
 	const ab = region.bounds;
 	if (b.x >= ab.x + ab.width || b.x + b.width <= ab.x || b.y >= ab.y + ab.height || b.y + b.height <= ab.y) return false;
 	if (mode === "centers") return pointInPolygon(region.coords, b.x + b.width / 2, b.y + b.height / 2);
-	const inBox = boxContainsBox([
+	if (mode === "intersect" && region.isRect && boxContainsBox([
 		ab.x,
 		ab.y,
 		ab.x + ab.width,
@@ -129,19 +122,44 @@ function regionTakes(region, mode, pose, b, outline, filled = () => true) {
 		b.y,
 		b.x + b.width,
 		b.y + b.height
-	]);
+	])) return true;
+}
+/**
+* Whether `region` takes a node under `mode`, given its pose, its bounds `b`
+* from {@link regionBoundsOf}, and its drawn outline on demand.
+*
+* - `intersect` — the outline meets the region anywhere: its interior too,
+*   unless `filled` says nothing paints it.
+* - `enclosed` — the whole outline lies inside it.
+* - `centers` — the center of `b` lies inside it.
+*
+* `b` only rejects: it encloses the outline and may reach past it, so a node
+* is taken by the outline alone. A node without finite bounds is never taken.
+*/
+function regionTakes(region, mode, pose, b, outline, filled = () => true) {
+	const decided = regionTakesByBounds(region, mode, b);
+	if (decided !== void 0) return decided;
+	const ab = region.bounds;
 	const silhouette = isSilhouettePose(pose);
 	if (mode === "enclosed") {
-		if (silhouette && !inBox) return false;
+		if (silhouette && !boxContainsBox([
+			ab.x,
+			ab.y,
+			ab.x + ab.width,
+			ab.y + ab.height
+		], [
+			b.x,
+			b.y,
+			b.x + b.width,
+			b.y + b.height
+		])) return false;
 		return polygonContainsPath(region.verts, silhouette ? pose : outline());
 	}
-	if (region.isRect && inBox) return true;
 	const drawn = silhouette ? pose : outline();
 	if (!filled()) return polygonIntersectsPath(region.verts, drawn, { filled: false });
 	if (drawn.kind === "rect" && region.isRect) return drawn.x < ab.x + ab.width && drawn.x + drawn.width > ab.x && drawn.y < ab.y + ab.height && drawn.y + drawn.height > ab.y;
 	return polygonIntersectsPath(region.verts, drawn);
 }
 
-//#endregion
-export { isSilhouettePose, polygonRegion, poseOutline, rectRegion, regionBoundsOf, regionOf, regionTakes };
+export { isSilhouettePose, polygonRegion, poseOutline, rectRegion, regionBoundsOf, regionOf, regionTakes, regionTakesByBounds };
 //# sourceMappingURL=regionHit.js.map

package/dist/core/geometry/regionHit.js.map

@@ -1 +1 @@
-{"version":3,"file":"regionHit.js","names":[],"sources":["../../../src/core/geometry/regionHit.ts"],"sourcesContent":["/**\n * Whether a marquee or a lasso takes one node: the per-node decision the\n * scene's area walk (`canvas/deps/hitTestArea`) makes.\n *\n * What a node draws is not knowable here — the painters sit above `core/` — so\n * the caller hands in the node's outline as a thunk, asked for only when the\n * bounds cannot decide. A pose that is itself a polygon path is its own\n * outline and never asks.\n */\nimport {\n  boxContainsBox,\n  pointInPolygon,\n  polygonContainsPath,\n  polygonIntersectsPath,\n  type Path,\n  type PolygonPath,\n} from '@weasel-js/geom';\nimport type { Bounds } from 'core/viewport/fitViewToBounds';\nimport type { LassoHitMode } from 'core/adapters/types';\nimport { nodeMemo } from 'core/scene/nodeMemo';\nimport type { Vec2 } from './vec2';\nimport { pathThroughPoseFrame, poseFrameOf } from '@weasel-js/geom';\nimport { visualBoundsViaDescriptor, type PoseDescriptor } from './poseDescriptor';\n\n/** A closed selection area: a marquee rect or a lasso polygon. */\nexport interface SelectRegion {\n  /** The area's vertices; the closing edge back to the first is implicit. */\n  readonly verts: readonly Vec2[];\n  /** `verts` interleaved as `[x0, y0, x1, y1, …]`. */\n  readonly coords: readonly number[];\n  readonly bounds: Bounds;\n  /** True when the area is its own bounding rect, so a node inside `bounds`\n   *  is inside the area without further work. Never true for a lasso: a node\n   *  inside the hull's box can still miss the hull. */\n  readonly isRect: boolean;\n}\n\n/** A marquee's region. */\nexport function rectRegion(r: Bounds): SelectRegion {\n  const { x, y, width: w, height: h } = r;\n  return regionOf([x, y, x + w, y, x + w, y + h, x, y + h], { x, y, width: w, height: h }, true)!;\n}\n\n/** A region from interleaved coords. `bounds` is derived when omitted; `null`\n *  when there are no coords to bound. */\nexport function regionOf(\n  coords: ArrayLike<number>,\n  bounds?: Bounds,\n  isRect = false,\n): SelectRegion | null {\n  const verts: Vec2[] = [];\n  const flat: number[] = [];\n  let minX = Infinity, minY = Infinity, maxX = -Infinity, maxY = -Infinity;\n  for (let i = 0; i + 1 < coords.length; i += 2) {\n    const x = coords[i], y = coords[i + 1];\n    verts.push({ x, y });\n    flat.push(x, y);\n    if (x < minX) minX = x;\n    if (y < minY) minY = y;\n    if (x > maxX) maxX = x;\n    if (y > maxY) maxY = y;\n  }\n  if (verts.length === 0) return null;\n  return {\n    verts,\n    coords: flat,\n    bounds: bounds ?? { x: minX, y: minY, width: maxX - minX, height: maxY - minY },\n    isRect,\n  };\n}\n\n/** A lasso's region, or `null` for fewer than three vertices. */\nexport function polygonRegion(polygon: ReadonlyArray<Vec2>): SelectRegion | null {\n  if (polygon.length < 3) return null;\n  const coords: number[] = [];\n  for (const p of polygon) coords.push(p.x, p.y);\n  return regionOf(coords);\n}\n\n/** A pose that is its own drawn outline. */\nexport function isSilhouettePose(pose: unknown): pose is PolygonPath {\n  return pose !== null && typeof pose === 'object' && (pose as Path).kind === 'polygon';\n}\n\n/**\n * The box a region fast-rejects a node against: a silhouette pose's own bounds,\n * else the pose's visual bounds — which for a rotated pose is the box of its\n * rotated ink, reaching past the pose box. `g` is the node's descriptor.\n */\nexport function regionBoundsOf(node: object, pose: unknown, g: PoseDescriptor<unknown>): Bounds {\n  // Memo is silhouettes-only: a rect pose's bounds are the pose itself, and\n  // memoizing it costs more than it saves. The result may be shared; never mutate it.\n  return isSilhouettePose(pose)\n    ? nodeMemo(node, 'aabb', pose, () => g.getBounds(pose))\n    : visualBoundsViaDescriptor(pose, g);\n}\n\n/** The outline of a node nothing paints: its pose rect through the pose's\n *  frame, else its visual bounds `b`. */\nexport function poseOutline(pose: unknown, b: Bounds): Path {\n  if (poseFrameOf(pose)) {\n    const p = pose as Bounds;\n    return pathThroughPoseFrame({ kind: 'rect', x: p.x, y: p.y, width: p.width, height: p.height }, pose);\n  }\n  return { kind: 'rect', x: b.x, y: b.y, width: b.width, height: b.height };\n}\n\n/**\n * Whether `region` takes a node under `mode`, given its pose, its bounds `b`\n * from {@link regionBoundsOf}, and its drawn outline on demand.\n *\n * - `intersect` — the outline meets the region anywhere: its interior too,\n *   unless `filled` says nothing paints it.\n * - `enclosed` — the whole outline lies inside it.\n * - `centers` — the center of `b` lies inside it.\n *\n * `b` only rejects: it encloses the outline and may reach past it, so a node\n * is taken by the outline alone. A node without finite bounds is never taken.\n */\nexport function regionTakes(\n  region: SelectRegion,\n  mode: LassoHitMode,\n  pose: unknown,\n  b: Bounds,\n  outline: () => Path,\n  filled: () => boolean = () => true,\n): boolean {\n  if (\n    !Number.isFinite(b.x) || !Number.isFinite(b.y) ||\n    !Number.isFinite(b.width) || !Number.isFinite(b.height)\n  ) {\n    return false;\n  }\n  const ab = region.bounds;\n  if (\n    b.x >= ab.x + ab.width || b.x + b.width <= ab.x ||\n    b.y >= ab.y + ab.height || b.y + b.height <= ab.y\n  ) {\n    return false;\n  }\n  if (mode === 'centers') {\n    return pointInPolygon(region.coords, b.x + b.width / 2, b.y + b.height / 2);\n  }\n  const inBox = boxContainsBox(\n    [ab.x, ab.y, ab.x + ab.width, ab.y + ab.height],\n    [b.x, b.y, b.x + b.width, b.y + b.height],\n  );\n  const silhouette = isSilhouettePose(pose);\n  if (mode === 'enclosed') {\n    // A silhouette pose's bounds are its outline's: sticking out of the\n    // region's box, it cannot be inside the region.\n    if (silhouette && !inBox) return false;\n    return polygonContainsPath(region.verts, silhouette ? pose : outline());\n  }\n  // Swallowed whole by a marquee: no outline can change the answer.\n  if (region.isRect && inBox) return true;\n  const drawn = silhouette ? pose : outline();\n  if (!filled()) return polygonIntersectsPath(region.verts, drawn, { filled: false });\n  // Two axis-aligned rects meet exactly when their boxes overlap.\n  if (drawn.kind === 'rect' && region.isRect) {\n    return (\n      drawn.x < ab.x + ab.width && drawn.x + drawn.width > ab.x &&\n      drawn.y < ab.y + ab.height && drawn.y + drawn.height > ab.y\n    );\n  }\n  return polygonIntersectsPath(region.verts, drawn);\n}\n"],"mappings":";;;;;;;;;;;;;;;AAsCA,SAAgB,WAAW,GAAyB;CAClD,MAAM,EAAE,GAAG,GAAG,OAAO,GAAG,QAAQ,MAAM;CACtC,OAAO,SAAS;EAAC;EAAG;EAAG,IAAI;EAAG;EAAG,IAAI;EAAG,IAAI;EAAG;EAAG,IAAI;CAAC,GAAG;EAAE;EAAG;EAAG,OAAO;EAAG,QAAQ;CAAE,GAAG,IAAI;AAC/F;;;AAIA,SAAgB,SACd,QACA,QACA,SAAS,OACY;CACrB,MAAM,QAAgB,CAAC;CACvB,MAAM,OAAiB,CAAC;CACxB,IAAI,OAAO,UAAU,OAAO,UAAU,OAAO,WAAW,OAAO;CAC/D,KAAK,IAAI,IAAI,GAAG,IAAI,IAAI,OAAO,QAAQ,KAAK,GAAG;EAC7C,MAAM,IAAI,OAAO,IAAI,IAAI,OAAO,IAAI;EACpC,MAAM,KAAK;GAAE;GAAG;EAAE,CAAC;EACnB,KAAK,KAAK,GAAG,CAAC;EACd,IAAI,IAAI,MAAM,OAAO;EACrB,IAAI,IAAI,MAAM,OAAO;EACrB,IAAI,IAAI,MAAM,OAAO;EACrB,IAAI,IAAI,MAAM,OAAO;CACvB;CACA,IAAI,MAAM,WAAW,GAAG,OAAO;CAC/B,OAAO;EACL;EACA,QAAQ;EACR,QAAQ,UAAU;GAAE,GAAG;GAAM,GAAG;GAAM,OAAO,OAAO;GAAM,QAAQ,OAAO;EAAK;EAC9E;CACF;AACF;;AAGA,SAAgB,cAAc,SAAmD;CAC/E,IAAI,QAAQ,SAAS,GAAG,OAAO;CAC/B,MAAM,SAAmB,CAAC;CAC1B,KAAK,MAAM,KAAK,SAAS,OAAO,KAAK,EAAE,GAAG,EAAE,CAAC;CAC7C,OAAO,SAAS,MAAM;AACxB;;AAGA,SAAgB,iBAAiB,MAAoC;CACnE,OAAO,SAAS,QAAQ,OAAO,SAAS,YAAa,KAAc,SAAS;AAC9E;;;;;;AAOA,SAAgB,eAAe,MAAc,MAAe,GAAoC;CAG9F,OAAO,iBAAiB,IAAI,IACxB,SAAS,MAAM,QAAQ,YAAY,EAAE,UAAU,IAAI,CAAC,IACpD,0BAA0B,MAAM,CAAC;AACvC;;;AAIA,SAAgB,YAAY,MAAe,GAAiB;CAC1D,IAAI,YAAY,IAAI,GAAG;EACrB,MAAM,IAAI;EACV,OAAO,qBAAqB;GAAE,MAAM;GAAQ,GAAG,EAAE;GAAG,GAAG,EAAE;GAAG,OAAO,EAAE;GAAO,QAAQ,EAAE;EAAO,GAAG,IAAI;CACtG;CACA,OAAO;EAAE,MAAM;EAAQ,GAAG,EAAE;EAAG,GAAG,EAAE;EAAG,OAAO,EAAE;EAAO,QAAQ,EAAE;CAAO;AAC1E;;;;;;;;;;;;;AAcA,SAAgB,YACd,QACA,MACA,MACA,GACA,SACA,eAA8B,MACrB;CACT,IACE,CAAC,OAAO,SAAS,EAAE,CAAC,KAAK,CAAC,OAAO,SAAS,EAAE,CAAC,KAC7C,CAAC,OAAO,SAAS,EAAE,KAAK,KAAK,CAAC,OAAO,SAAS,EAAE,MAAM,GAEtD,OAAO;CAET,MAAM,KAAK,OAAO;CAClB,IACE,EAAE,KAAK,GAAG,IAAI,GAAG,SAAS,EAAE,IAAI,EAAE,SAAS,GAAG,KAC9C,EAAE,KAAK,GAAG,IAAI,GAAG,UAAU,EAAE,IAAI,EAAE,UAAU,GAAG,GAEhD,OAAO;CAET,IAAI,SAAS,WACX,OAAO,eAAe,OAAO,QAAQ,EAAE,IAAI,EAAE,QAAQ,GAAG,EAAE,IAAI,EAAE,SAAS,CAAC;CAE5E,MAAM,QAAQ,eACZ;EAAC,GAAG;EAAG,GAAG;EAAG,GAAG,IAAI,GAAG;EAAO,GAAG,IAAI,GAAG;CAAM,GAC9C;EAAC,EAAE;EAAG,EAAE;EAAG,EAAE,IAAI,EAAE;EAAO,EAAE,IAAI,EAAE;CAAM,CAC1C;CACA,MAAM,aAAa,iBAAiB,IAAI;CACxC,IAAI,SAAS,YAAY;EAGvB,IAAI,cAAc,CAAC,OAAO,OAAO;EACjC,OAAO,oBAAoB,OAAO,OAAO,aAAa,OAAO,QAAQ,CAAC;CACxE;CAEA,IAAI,OAAO,UAAU,OAAO,OAAO;CACnC,MAAM,QAAQ,aAAa,OAAO,QAAQ;CAC1C,IAAI,CAAC,OAAO,GAAG,OAAO,sBAAsB,OAAO,OAAO,OAAO,EAAE,QAAQ,MAAM,CAAC;CAElF,IAAI,MAAM,SAAS,UAAU,OAAO,QAClC,OACE,MAAM,IAAI,GAAG,IAAI,GAAG,SAAS,MAAM,IAAI,MAAM,QAAQ,GAAG,KACxD,MAAM,IAAI,GAAG,IAAI,GAAG,UAAU,MAAM,IAAI,MAAM,SAAS,GAAG;CAG9D,OAAO,sBAAsB,OAAO,OAAO,KAAK;AAClD"}
+{"version":3,"file":"regionHit.js","names":[],"sources":["../../../src/core/geometry/regionHit.ts"],"sourcesContent":["/**\n * Whether a marquee or a lasso takes one node: the per-node decision the\n * scene's area walk (`canvas/deps/hitTestArea`) makes.\n *\n * What a node draws is not knowable here — the painters sit above `core/` — so\n * the caller hands in the node's outline as a thunk, asked for only when the\n * bounds cannot decide. A pose that is itself a polygon path is its own\n * outline and never asks.\n */\nimport {\n  boxContainsBox,\n  pointInPolygon,\n  polygonContainsPath,\n  polygonIntersectsPath,\n  type Path,\n  type PolygonPath,\n} from '@weasel-js/geom';\nimport type { Bounds } from 'core/viewport/fitViewToBounds';\nimport type { LassoHitMode } from 'core/adapters/types';\nimport { nodeMemo } from 'core/scene/nodeMemo';\nimport type { Vec2 } from './vec2';\nimport { pathThroughPoseFrame, poseFrameOf } from '@weasel-js/geom';\nimport { visualBoundsViaDescriptor, type PoseDescriptor } from './poseDescriptor';\n\n/** A closed selection area: a marquee rect or a lasso polygon. */\nexport interface SelectRegion {\n  /** The area's vertices; the closing edge back to the first is implicit. */\n  readonly verts: readonly Vec2[];\n  /** `verts` interleaved as `[x0, y0, x1, y1, …]`. */\n  readonly coords: readonly number[];\n  readonly bounds: Bounds;\n  /** True when the area is its own bounding rect, so a node inside `bounds`\n   *  is inside the area without further work. Never true for a lasso: a node\n   *  inside the hull's box can still miss the hull. */\n  readonly isRect: boolean;\n}\n\n/** A marquee's region. */\nexport function rectRegion(r: Bounds): SelectRegion {\n  const { x, y, width: w, height: h } = r;\n  return regionOf([x, y, x + w, y, x + w, y + h, x, y + h], { x, y, width: w, height: h }, true)!;\n}\n\n/** A region from interleaved coords. `bounds` is derived when omitted; `null`\n *  when there are no coords to bound. */\nexport function regionOf(\n  coords: ArrayLike<number>,\n  bounds?: Bounds,\n  isRect = false,\n): SelectRegion | null {\n  const verts: Vec2[] = [];\n  const flat: number[] = [];\n  let minX = Infinity, minY = Infinity, maxX = -Infinity, maxY = -Infinity;\n  for (let i = 0; i + 1 < coords.length; i += 2) {\n    const x = coords[i], y = coords[i + 1];\n    verts.push({ x, y });\n    flat.push(x, y);\n    if (x < minX) minX = x;\n    if (y < minY) minY = y;\n    if (x > maxX) maxX = x;\n    if (y > maxY) maxY = y;\n  }\n  if (verts.length === 0) return null;\n  return {\n    verts,\n    coords: flat,\n    bounds: bounds ?? { x: minX, y: minY, width: maxX - minX, height: maxY - minY },\n    isRect,\n  };\n}\n\n/** A lasso's region, or `null` for fewer than three vertices. */\nexport function polygonRegion(polygon: ReadonlyArray<Vec2>): SelectRegion | null {\n  if (polygon.length < 3) return null;\n  const coords: number[] = [];\n  for (const p of polygon) coords.push(p.x, p.y);\n  return regionOf(coords);\n}\n\n/** A pose that is its own drawn outline. */\nexport function isSilhouettePose(pose: unknown): pose is PolygonPath {\n  return pose !== null && typeof pose === 'object' && (pose as Path).kind === 'polygon';\n}\n\n/**\n * The box a region fast-rejects a node against: a silhouette pose's own bounds,\n * else the pose's visual bounds — which for a rotated pose is the box of its\n * rotated ink, reaching past the pose box. `g` is the node's descriptor.\n */\nexport function regionBoundsOf(node: object, pose: unknown, g: PoseDescriptor<unknown>): Bounds {\n  // Memo is silhouettes-only: a rect pose's bounds are the pose itself, and\n  // memoizing it costs more than it saves. The result may be shared; never mutate it.\n  return isSilhouettePose(pose)\n    ? nodeMemo(node, 'aabb', pose, () => g.getBounds(pose))\n    : visualBoundsViaDescriptor(pose, g);\n}\n\n/** The outline of a node nothing paints: its pose rect through the pose's\n *  frame, else its visual bounds `b`. */\nexport function poseOutline(pose: unknown, b: Bounds): Path {\n  if (poseFrameOf(pose)) {\n    const p = pose as Bounds;\n    return pathThroughPoseFrame({ kind: 'rect', x: p.x, y: p.y, width: p.width, height: p.height }, pose);\n  }\n  return { kind: 'rect', x: b.x, y: b.y, width: b.width, height: b.height };\n}\n\n/**\n * What `b` alone decides of {@link regionTakes}, or undefined when the\n * outline has to be asked: a caller that builds the outline's thunks per node\n * asks this first and builds them only for the nodes it leaves open.\n */\nexport function regionTakesByBounds(region: SelectRegion, mode: LassoHitMode, b: Bounds): boolean | undefined {\n  if (\n    !Number.isFinite(b.x) || !Number.isFinite(b.y) ||\n    !Number.isFinite(b.width) || !Number.isFinite(b.height)\n  ) {\n    return false;\n  }\n  const ab = region.bounds;\n  if (\n    b.x >= ab.x + ab.width || b.x + b.width <= ab.x ||\n    b.y >= ab.y + ab.height || b.y + b.height <= ab.y\n  ) {\n    return false;\n  }\n  if (mode === 'centers') {\n    return pointInPolygon(region.coords, b.x + b.width / 2, b.y + b.height / 2);\n  }\n  // Swallowed whole by a marquee: no outline can change the answer.\n  if (mode === 'intersect' && region.isRect && boxContainsBox(\n    [ab.x, ab.y, ab.x + ab.width, ab.y + ab.height],\n    [b.x, b.y, b.x + b.width, b.y + b.height],\n  )) return true;\n  return undefined;\n}\n\n/**\n * Whether `region` takes a node under `mode`, given its pose, its bounds `b`\n * from {@link regionBoundsOf}, and its drawn outline on demand.\n *\n * - `intersect` — the outline meets the region anywhere: its interior too,\n *   unless `filled` says nothing paints it.\n * - `enclosed` — the whole outline lies inside it.\n * - `centers` — the center of `b` lies inside it.\n *\n * `b` only rejects: it encloses the outline and may reach past it, so a node\n * is taken by the outline alone. A node without finite bounds is never taken.\n */\nexport function regionTakes(\n  region: SelectRegion,\n  mode: LassoHitMode,\n  pose: unknown,\n  b: Bounds,\n  outline: () => Path,\n  filled: () => boolean = () => true,\n): boolean {\n  const decided = regionTakesByBounds(region, mode, b);\n  if (decided !== undefined) return decided;\n  const ab = region.bounds;\n  const silhouette = isSilhouettePose(pose);\n  if (mode === 'enclosed') {\n    // A silhouette pose's bounds are its outline's: sticking out of the\n    // region's box, it cannot be inside the region.\n    if (silhouette && !boxContainsBox(\n      [ab.x, ab.y, ab.x + ab.width, ab.y + ab.height],\n      [b.x, b.y, b.x + b.width, b.y + b.height],\n    )) return false;\n    return polygonContainsPath(region.verts, silhouette ? pose : outline());\n  }\n  const drawn = silhouette ? pose : outline();\n  if (!filled()) return polygonIntersectsPath(region.verts, drawn, { filled: false });\n  // Two axis-aligned rects meet exactly when their boxes overlap.\n  if (drawn.kind === 'rect' && region.isRect) {\n    return (\n      drawn.x < ab.x + ab.width && drawn.x + drawn.width > ab.x &&\n      drawn.y < ab.y + ab.height && drawn.y + drawn.height > ab.y\n    );\n  }\n  return polygonIntersectsPath(region.verts, drawn);\n}\n"],"mappings":";;;;;;;;;;;;;;;AAsCA,SAAgB,WAAW,GAAyB;CAClD,MAAM,EAAE,GAAG,GAAG,OAAO,GAAG,QAAQ,MAAM;CACtC,OAAO,SAAS;EAAC;EAAG;EAAG,IAAI;EAAG;EAAG,IAAI;EAAG,IAAI;EAAG;EAAG,IAAI;CAAC,GAAG;EAAE;EAAG;EAAG,OAAO;EAAG,QAAQ;CAAE,GAAG,IAAI;AAC/F;;;AAIA,SAAgB,SACd,QACA,QACA,SAAS,OACY;CACrB,MAAM,QAAgB,CAAC;CACvB,MAAM,OAAiB,CAAC;CACxB,IAAI,OAAO,UAAU,OAAO,UAAU,OAAO,WAAW,OAAO;CAC/D,KAAK,IAAI,IAAI,GAAG,IAAI,IAAI,OAAO,QAAQ,KAAK,GAAG;EAC7C,MAAM,IAAI,OAAO,IAAI,IAAI,OAAO,IAAI;EACpC,MAAM,KAAK;GAAE;GAAG;EAAE,CAAC;EACnB,KAAK,KAAK,GAAG,CAAC;EACd,IAAI,IAAI,MAAM,OAAO;EACrB,IAAI,IAAI,MAAM,OAAO;EACrB,IAAI,IAAI,MAAM,OAAO;EACrB,IAAI,IAAI,MAAM,OAAO;CACvB;CACA,IAAI,MAAM,WAAW,GAAG,OAAO;CAC/B,OAAO;EACL;EACA,QAAQ;EACR,QAAQ,UAAU;GAAE,GAAG;GAAM,GAAG;GAAM,OAAO,OAAO;GAAM,QAAQ,OAAO;EAAK;EAC9E;CACF;AACF;;AAGA,SAAgB,cAAc,SAAmD;CAC/E,IAAI,QAAQ,SAAS,GAAG,OAAO;CAC/B,MAAM,SAAmB,CAAC;CAC1B,KAAK,MAAM,KAAK,SAAS,OAAO,KAAK,EAAE,GAAG,EAAE,CAAC;CAC7C,OAAO,SAAS,MAAM;AACxB;;AAGA,SAAgB,iBAAiB,MAAoC;CACnE,OAAO,SAAS,QAAQ,OAAO,SAAS,YAAa,KAAc,SAAS;AAC9E;;;;;;AAOA,SAAgB,eAAe,MAAc,MAAe,GAAoC;CAG9F,OAAO,iBAAiB,IAAI,IACxB,SAAS,MAAM,QAAQ,YAAY,EAAE,UAAU,IAAI,CAAC,IACpD,0BAA0B,MAAM,CAAC;AACvC;;;AAIA,SAAgB,YAAY,MAAe,GAAiB;CAC1D,IAAI,YAAY,IAAI,GAAG;EACrB,MAAM,IAAI;EACV,OAAO,qBAAqB;GAAE,MAAM;GAAQ,GAAG,EAAE;GAAG,GAAG,EAAE;GAAG,OAAO,EAAE;GAAO,QAAQ,EAAE;EAAO,GAAG,IAAI;CACtG;CACA,OAAO;EAAE,MAAM;EAAQ,GAAG,EAAE;EAAG,GAAG,EAAE;EAAG,OAAO,EAAE;EAAO,QAAQ,EAAE;CAAO;AAC1E;;;;;;AAOA,SAAgB,oBAAoB,QAAsB,MAAoB,GAAgC;CAC5G,IACE,CAAC,OAAO,SAAS,EAAE,CAAC,KAAK,CAAC,OAAO,SAAS,EAAE,CAAC,KAC7C,CAAC,OAAO,SAAS,EAAE,KAAK,KAAK,CAAC,OAAO,SAAS,EAAE,MAAM,GAEtD,OAAO;CAET,MAAM,KAAK,OAAO;CAClB,IACE,EAAE,KAAK,GAAG,IAAI,GAAG,SAAS,EAAE,IAAI,EAAE,SAAS,GAAG,KAC9C,EAAE,KAAK,GAAG,IAAI,GAAG,UAAU,EAAE,IAAI,EAAE,UAAU,GAAG,GAEhD,OAAO;CAET,IAAI,SAAS,WACX,OAAO,eAAe,OAAO,QAAQ,EAAE,IAAI,EAAE,QAAQ,GAAG,EAAE,IAAI,EAAE,SAAS,CAAC;CAG5E,IAAI,SAAS,eAAe,OAAO,UAAU,eAC3C;EAAC,GAAG;EAAG,GAAG;EAAG,GAAG,IAAI,GAAG;EAAO,GAAG,IAAI,GAAG;CAAM,GAC9C;EAAC,EAAE;EAAG,EAAE;EAAG,EAAE,IAAI,EAAE;EAAO,EAAE,IAAI,EAAE;CAAM,CAC1C,GAAG,OAAO;AAEZ;;;;;;;;;;;;;AAcA,SAAgB,YACd,QACA,MACA,MACA,GACA,SACA,eAA8B,MACrB;CACT,MAAM,UAAU,oBAAoB,QAAQ,MAAM,CAAC;CACnD,IAAI,YAAY,QAAW,OAAO;CAClC,MAAM,KAAK,OAAO;CAClB,MAAM,aAAa,iBAAiB,IAAI;CACxC,IAAI,SAAS,YAAY;EAGvB,IAAI,cAAc,CAAC,eACjB;GAAC,GAAG;GAAG,GAAG;GAAG,GAAG,IAAI,GAAG;GAAO,GAAG,IAAI,GAAG;EAAM,GAC9C;GAAC,EAAE;GAAG,EAAE;GAAG,EAAE,IAAI,EAAE;GAAO,EAAE,IAAI,EAAE;EAAM,CAC1C,GAAG,OAAO;EACV,OAAO,oBAAoB,OAAO,OAAO,aAAa,OAAO,QAAQ,CAAC;CACxE;CACA,MAAM,QAAQ,aAAa,OAAO,QAAQ;CAC1C,IAAI,CAAC,OAAO,GAAG,OAAO,sBAAsB,OAAO,OAAO,OAAO,EAAE,QAAQ,MAAM,CAAC;CAElF,IAAI,MAAM,SAAS,UAAU,OAAO,QAClC,OACE,MAAM,IAAI,GAAG,IAAI,GAAG,SAAS,MAAM,IAAI,MAAM,QAAQ,GAAG,KACxD,MAAM,IAAI,GAAG,IAAI,GAAG,UAAU,MAAM,IAAI,MAAM,SAAS,GAAG;CAG9D,OAAO,sBAAsB,OAAO,OAAO,KAAK;AAClD"}

package/dist/core/geometry/targetFrame.js

@@ -1,6 +1,6 @@
 import { applyToPoint, invert, poseFrameOf, pxExtentInFrame } from "@weasel-js/geom";
 
-//#region src/core/geometry/targetFrame.ts
+// src/core/geometry/targetFrame.ts
 /**
 * The frame selection chrome reads a target in: `poseFrameOf` over the
 * target's bounds, with the helpers the outline, the handles, their hit
@@ -102,6 +102,5 @@ function targetCorners(b, xf) {
 	];
 }
 
-//#endregion
 export { IDENTITY_TARGET, angleOf, isRigid, localToWorld, normalToWorld, pxExtentIn, targetCorners, targetTransformOf, worldDeltaToLocal, worldToLocal };
 //# sourceMappingURL=targetFrame.js.map

package/dist/core/geometry/unionBounds.js

@@ -1,6 +1,6 @@
 import { applyToPoint, poseFrameOf } from "@weasel-js/geom";
 
-//#region src/core/geometry/unionBounds.ts
+// src/core/geometry/unionBounds.ts
 /**
 * Union math over rect-shaped poses.
 *
@@ -111,6 +111,5 @@ function unionAABB(parts) {
 	};
 }
 
-//#endregion
 export { axisAlignedBounds, unionAABB, unionBounds };
 //# sourceMappingURL=unionBounds.js.map

package/dist/core/layers/backgroundFill.js

@@ -1,6 +1,6 @@
 import { commandPaint } from "@weasel-js/renderer";
 
-//#region src/core/layers/backgroundFill.ts
+// src/core/layers/backgroundFill.ts
 /** The id of the layer {@link createBackgroundFillLayer} builds. */
 var BACKGROUND_FILL_LAYER_ID = "scene-background-fill";
 /**
@@ -34,6 +34,5 @@ function createBackgroundFillLayer(paint) {
 	};
 }
 
-//#endregion
 export { BACKGROUND_FILL_LAYER_ID, backgroundFillCommands, createBackgroundFillLayer };
 //# sourceMappingURL=backgroundFill.js.map

package/dist/core/layers/children.js

@@ -1,4 +1,4 @@
-//#region src/core/layers/children.ts
+// src/core/layers/children.ts
 /** Build a `RenderLayer` that draws an `OrderedAdapter`'s children in z-order. */
 function createChildrenLayer(opts) {
 	return {
@@ -19,6 +19,5 @@ function createChildrenLayer(opts) {
 	};
 }
 
-//#endregion
 export { createChildrenLayer };
 //# sourceMappingURL=children.js.map

package/dist/core/layers/gateLayer.js

@@ -1,6 +1,6 @@
 import { subscribeToSources } from "./redrawSource.js";
 
-//#region src/core/layers/gateLayer.ts
+// src/core/layers/gateLayer.ts
 /**
 * `RenderLayer` wrapper that conditionally emits draw commands based on a
 * predicate.
@@ -23,6 +23,5 @@ function gateLayer(opts) {
 	return wrapped;
 }
 
-//#endregion
 export { gateLayer };
 //# sourceMappingURL=gateLayer.js.map

package/dist/core/layers/layerGroup.js

@@ -1,4 +1,4 @@
-//#region src/core/layers/layerGroup.ts
+// src/core/layers/layerGroup.ts
 /**
 * Layer id → the group that owns it. First claim wins across groups, with a
 * warning for the second; the same group naming a layer twice — `['scene',
@@ -48,6 +48,5 @@ function wrapGroup(group, children, view, dims) {
 	}];
 }
 
-//#endregion
 export { groupMembership, wrapGroup };
 //# sourceMappingURL=layerGroup.js.map

package/dist/core/layers/redrawSource.js

@@ -1,4 +1,4 @@
-//#region src/core/layers/redrawSource.ts
+// src/core/layers/redrawSource.ts
 /** The `subscribe` for a layer that draws `sources`: it notifies whenever any
 *  of them does. A thunk is read when the subscription is made. */
 function subscribeToSources(sources) {
@@ -10,6 +10,5 @@ function subscribeToSources(sources) {
 	};
 }
 
-//#endregion
 export { subscribeToSources };
 //# sourceMappingURL=redrawSource.js.map

package/dist/core/layers/render.js

@@ -3,7 +3,7 @@ import { DEFAULT_LAYER_RETAIN, retainedId } from "./retain.js";
 import { subscribeToSources } from "./redrawSource.js";
 import { viewToMat3 } from "@weasel-js/renderer";
 
-//#region src/core/layers/render.ts
+// src/core/layers/render.ts
 var IDENTITY_VIEW = {
 	x: 0,
 	y: 0,
@@ -210,6 +210,5 @@ function depsUnchanged(a, b) {
 	return true;
 }
 
-//#endregion
 export { DEFAULT_LAYER_RETAIN, depsUnchanged, drawLayers, drawOneLayer, isLayerPainted, isLayerVisible, paintedLayers, subscribeToSources };
 //# sourceMappingURL=render.js.map

package/dist/core/layers/retain.js

@@ -1,4 +1,4 @@
-//#region src/core/layers/retain.ts
+// src/core/layers/retain.ts
 /** Measured on 1280x800 at dpr 2: an unchanged layer composites cheaper than
 *  it submits from about 130 to 250 commands, depending on the layer count. */
 var DEFAULT_LAYER_RETAIN = { minCommands: 250 };
@@ -35,6 +35,5 @@ function retainedId(layer, cache, view, policy) {
 	return layer.retain === true || countDrawCommands(entry.cmds) >= policy.minCommands ? layer.id : void 0;
 }
 
-//#endregion
 export { DEFAULT_LAYER_RETAIN, countDrawCommands, retainedId };
 //# sourceMappingURL=retain.js.map

package/dist/core/ops/arrange.js

@@ -1,6 +1,6 @@
 import { registerOpFactory } from "./registry.js";
 
-//#region src/core/ops/arrange.ts
+// src/core/ops/arrange.ts
 /**
 * Op: write a set of poses decided when the op first applies, not when it is
 * built. The scene appends one to an edit that moves nodes into a container,
@@ -38,6 +38,5 @@ function createArrangeOp(args, compute, write) {
 }
 registerOpFactory("arrange", (args) => createArrangeOp(args));
 
-//#endregion
 export { createArrangeOp };
 //# sourceMappingURL=arrange.js.map

package/dist/core/ops/create.js

@@ -1,8 +1,8 @@
+import { createDeleteOp } from "./delete.js";
 import { registerOpFactory } from "./registry.js";
 import { parentOf, resolveSlot, slotFromIndex } from "./slot.js";
-import { createDeleteOp } from "./delete.js";
 
-//#region src/core/ops/create.ts
+// src/core/ops/create.ts
 /** Op: insert `node`, and the rest of `cascaded` with it; inverts to a delete
 *  of `node`. */
 function createInsertOp(args) {
@@ -41,6 +41,5 @@ function createInsertOp(args) {
 }
 registerOpFactory("insert", (args) => createInsertOp(args));
 
-//#endregion
 export { createInsertOp };
 //# sourceMappingURL=create.js.map

package/dist/core/ops/createHistory.js

@@ -1,8 +1,8 @@
-import { dlog, dwarn } from "../../debug/flag.js";
 import { rebuildOp } from "./registry.js";
+import { dlog, dwarn } from "../../debug/flag.js";
 import { createHistory } from "@weasel-js/history";
 
-//#region src/core/ops/createHistory.ts
+// src/core/ops/createHistory.ts
 /** Routes the engine's diagnostics into the kit's `history` debug namespace,
 *  so `localStorage.setItem('weasel.debug', '1')` still surfaces them. */
 var kitLogger = {
@@ -24,6 +24,5 @@ function createHistory$1(adapter, options = {}) {
 	});
 }
 
-//#endregion
 export { createHistory$1 as createHistory };
 //# sourceMappingURL=createHistory.js.map

package/dist/core/ops/delete.js

@@ -1,8 +1,8 @@
+import { createInsertOp } from "./create.js";
 import { registerOpFactory } from "./registry.js";
 import { captureSlot, parentOf, slotFromIndex } from "./slot.js";
-import { createInsertOp } from "./create.js";
 
-//#region src/core/ops/delete.ts
+// src/core/ops/delete.ts
 /** `id`'s ordinal among `parentId`'s children, or `-1` when it is not one. */
 function indexIn(a, parentId, id) {
 	return a.getChildren(parentId).indexOf(id);
@@ -95,6 +95,5 @@ function createDeleteOp(args) {
 }
 registerOpFactory("delete", (args) => createDeleteOp(args));
 
-//#endregion
 export { createDeleteOp };
 //# sourceMappingURL=delete.js.map

package/dist/core/ops/nodeFlags.js

@@ -1,6 +1,6 @@
 import { registerOpFactory } from "./registry.js";
 
-//#region src/core/ops/nodeFlags.ts
+// src/core/ops/nodeFlags.ts
 function flagOp(name, args) {
 	const { id, from, to, label, coalesceKey } = args;
 	return {
@@ -39,6 +39,5 @@ function createSetLockedOp(args) {
 registerOpFactory("setHidden", (args) => createSetHiddenOp(args));
 registerOpFactory("setLocked", (args) => createSetLockedOp(args));
 
-//#endregion
 export { createSetHiddenOp, createSetLockedOp };
 //# sourceMappingURL=nodeFlags.js.map

package/dist/core/ops/registry.js

@@ -1,6 +1,6 @@
 import { createReflectable } from "@weasel-js/registry";
 
-//#region src/core/ops/registry.ts
+// src/core/ops/registry.ts
 var FACTORIES = createReflectable();
 /** Every registered op factory, keyed by op name, in registration order. */
 var opFactoryRegistry = FACTORIES.reflection;
@@ -27,6 +27,5 @@ function registeredOpNames() {
 	return FACTORIES.entries().map((e) => e.key);
 }
 
-//#endregion
 export { opFactoryRegistry, rebuildOp, registerOpFactory, registeredOpNames };
 //# sourceMappingURL=registry.js.map

package/dist/core/ops/reorder/algorithms.js

@@ -1,4 +1,4 @@
-//#region src/core/ops/reorder/algorithms.ts
+// src/core/ops/reorder/algorithms.ts
 /**
 * Pure reorder primitives. All operate on a flat ordered id list (z-order:
 * index 0 = bottom, last = top) and return a new list. Stable: relative
@@ -74,6 +74,5 @@ function canSendBackward(list, ids) {
 	return false;
 }
 
-//#endregion
 export { bringForward, bringToFront, canBringForward, canSendBackward, moveToIndex, sendBackward, sendToBack };
 //# sourceMappingURL=algorithms.js.map

package/dist/core/ops/reorder/index.js

@@ -2,7 +2,7 @@ import { registerOpFactory } from "../registry.js";
 import { bringForward, bringToFront, canBringForward, canSendBackward, moveToIndex, sendBackward, sendToBack } from "./algorithms.js";
 import { createSetChildOrderOp } from "./setChildOrder.js";
 
-//#region src/core/ops/reorder/index.ts
+// src/core/ops/reorder/index.ts
 function arraysEqual(a, b) {
 	if (a.length !== b.length) return false;
 	for (let i = 0; i < a.length; i++) if (a[i] !== b[i]) return false;
@@ -174,6 +174,5 @@ function createMoveToIndexOp(args) {
 }
 registerOpFactory("moveToIndex", (args) => createMoveToIndexOp(args));
 
-//#endregion
 export { canBringForward, canSendBackward, createMoveToIndexOp, createReorderOp, createSetChildOrderOp };
 //# sourceMappingURL=index.js.map

package/dist/core/ops/reorder/setChildOrder.js

@@ -1,6 +1,6 @@
 import { registerOpFactory } from "../registry.js";
 
-//#region src/core/ops/reorder/setChildOrder.ts
+// src/core/ops/reorder/setChildOrder.ts
 /** Op: write each listed parent's whole child order; inverts to a write of the
 *  orders it replaced. Where `createMoveToIndexOp` keeps the moved ids in their
 *  current relative order, this states every position. */
@@ -36,6 +36,5 @@ function createSetChildOrderOp(args) {
 }
 registerOpFactory("setChildOrder", (args) => createSetChildOrderOp(args));
 
-//#endregion
 export { createSetChildOrderOp };
 //# sourceMappingURL=setChildOrder.js.map

package/dist/core/ops/reparent.js

@@ -1,7 +1,7 @@
 import { registerOpFactory } from "./registry.js";
 import { captureSlot, resolveSlot, slotFromIndex } from "./slot.js";
 
-//#region src/core/ops/reparent.ts
+// src/core/ops/reparent.ts
 /** Move `id` to `slot` among `parentId`'s children. No-op when `id` isn't
 *  there or is already in place. */
 function placeAt(a, parentId, id, slot) {
@@ -72,6 +72,5 @@ function createReparentOp(args) {
 }
 registerOpFactory("reparent", (args) => createReparentOp(args));
 
-//#endregion
 export { createReparentOp };
 //# sourceMappingURL=reparent.js.map

package/dist/core/ops/select.js

@@ -1,6 +1,6 @@
 import { registerOpFactory } from "./registry.js";
 
-//#region src/core/ops/select.ts
+// src/core/ops/select.ts
 /** Op: replace the current selection with `to`; inverts back to `from`. */
 function createSetSelectionOp(args) {
 	const { from, to, label } = args;
@@ -32,6 +32,5 @@ function sequenceEqual(a, b) {
 	return true;
 }
 
-//#endregion
 export { createSetSelectionOp };
 //# sourceMappingURL=select.js.map

package/dist/core/ops/setData.js

@@ -1,6 +1,6 @@
 import { registerOpFactory } from "./registry.js";
 
-//#region src/core/ops/setData.ts
+// src/core/ops/setData.ts
 /** Op: set a node's app-defined `data` payload, inverting back to `from`. */
 function createSetDataOp(args) {
 	const { id, from, to, label, coalesceKey } = args;
@@ -31,6 +31,5 @@ function createSetDataOp(args) {
 }
 registerOpFactory("setData", (args) => createSetDataOp(args));
 
-//#endregion
 export { createSetDataOp };
 //# sourceMappingURL=setData.js.map

package/dist/core/ops/setDependsOn.js

@@ -1,6 +1,6 @@
 import { registerOpFactory } from "./registry.js";
 
-//#region src/core/ops/setDependsOn.ts
+// src/core/ops/setDependsOn.ts
 /** Op: set what a derived node's geometry derives from, inverting back to
 *  `from`. */
 function createSetDependsOnOp(args) {
@@ -32,6 +32,5 @@ function createSetDependsOnOp(args) {
 }
 registerOpFactory("setDependsOn", (args) => createSetDependsOnOp(args));
 
-//#endregion
 export { createSetDependsOnOp };
 //# sourceMappingURL=setDependsOn.js.map

package/dist/core/ops/setLayer.js

@@ -1,6 +1,6 @@
 import { registerOpFactory } from "./registry.js";
 
-//#region src/core/ops/setLayer.ts
+// src/core/ops/setLayer.ts
 /** Op: set a node's `layer` tag, inverting back to `from`. `coalesceKey`
 *  defaults to `setLayer:${id}` so successive layer changes to the same node
 *  merge into one undo entry within the history's coalesce window. Pass an
@@ -34,6 +34,5 @@ function createSetLayerOp(args) {
 }
 registerOpFactory("setLayer", (args) => createSetLayerOp(args));
 
-//#endregion
 export { createSetLayerOp };
 //# sourceMappingURL=setLayer.js.map

package/dist/core/ops/setLayout.js

@@ -1,6 +1,6 @@
 import { registerOpFactory } from "./registry.js";
 
-//#region src/core/ops/setLayout.ts
+// src/core/ops/setLayout.ts
 /**
 * Op: give a container a different layout, inverting back to `from`. Applied
 * through a scene adapter (`adapter.setLayout`), the scene re-arranges the
@@ -35,6 +35,5 @@ function createSetLayoutOp(args) {
 }
 registerOpFactory("setLayout", (args) => createSetLayoutOp(args));
 
-//#endregion
 export { createSetLayoutOp };
 //# sourceMappingURL=setLayout.js.map

package/dist/core/ops/setPath.js

@@ -1,7 +1,7 @@
 import { registerOpFactory } from "./registry.js";
 import { originOf } from "@weasel-js/geom";
 
-//#region src/core/ops/setPath.ts
+// src/core/ops/setPath.ts
 /**
 * Op: atomically replace a PathObj's geometric fields (path + closed + params).
 * Used for pen-edit anchor mutations and parametric-shape trapdoor conversions.
@@ -74,6 +74,5 @@ function shallowEqual(a, b) {
 	return true;
 }
 
-//#endregion
 export { createSetPathOp };
 //# sourceMappingURL=setPath.js.map

package/dist/core/ops/setText.js

@@ -1,6 +1,6 @@
 import { registerOpFactory } from "./registry.js";
 
-//#region src/core/ops/setText.ts
+// src/core/ops/setText.ts
 /** Op: set a text node's text content, inverting back to `from`. `coalesceKey`
 *  defaults to `setText:${id}` so successive edits to the same node (typing)
 *  merge into one undo entry within the history's coalesce window. Pass an
@@ -34,6 +34,5 @@ function createSetTextOp(args) {
 }
 registerOpFactory("setText", (args) => createSetTextOp(args));
 
-//#endregion
 export { createSetTextOp };
 //# sourceMappingURL=setText.js.map

package/dist/core/ops/slot.js

@@ -1,4 +1,4 @@
-//#region src/core/ops/slot.ts
+// src/core/ops/slot.ts
 /** Observe `id`'s slot among `parentId`'s children. `null` when `id` isn't
 *  there — callers keep whatever weaker slot they already had rather than
 *  overwriting it with a guess. */
@@ -43,6 +43,5 @@ function parentOf(node) {
 	return node.parent ?? null;
 }
 
-//#endregion
 export { captureSlot, locateChild, parentOf, resolveSlot, slotFromIndex };
 //# sourceMappingURL=slot.js.map

package/dist/core/ops/transform.js

@@ -1,6 +1,6 @@
 import { registerOpFactory } from "./registry.js";
 
-//#region src/core/ops/transform.ts
+// src/core/ops/transform.ts
 /** Op: set an object's pose, inverting back to `from`. `coalesceKey` defaults to
 *  `transform:${id}` so successive pose writes to the same node (drag-move,
 *  resize, repeated nudges) merge into one undo entry within the history's
@@ -44,6 +44,5 @@ function poseShallowEqual(a, b) {
 	return true;
 }
 
-//#endregion
 export { createTransformOp };
 //# sourceMappingURL=transform.js.map

package/dist/core/ops/writtenBy.js

@@ -1,6 +1,6 @@
 import { sceneMutators } from "../scene/sceneMutators.js";
 
-//#region src/core/ops/writtenBy.ts
+// src/core/ops/writtenBy.ts
 /**
 * The pose and data `ops` leave each node they write, by id, read by applying
 * them to a recorder rather than the scene; null when one cannot be read that
@@ -48,6 +48,5 @@ function writtenBy(sc, ops) {
 	return after;
 }
 
-//#endregion
 export { writtenBy };
 //# sourceMappingURL=writtenBy.js.map

package/dist/core/pages/fitViewToPage.js

@@ -1,7 +1,7 @@
 import { fitViewToBounds } from "../viewport/fitViewToBounds.js";
 import { pageOfBounds } from "./pages.js";
 
-//#region src/core/pages/fitViewToPage.ts
+// src/core/pages/fitViewToPage.ts
 /** The view that shows one placed page whole: `fitViewToBounds` on its rect. */
 function fitViewToPage(page, viewportDims, currentView, options) {
 	const { x, y, width, height } = page;
@@ -23,6 +23,5 @@ function pageInView(pages, view, viewportDims) {
 	return pageOfBounds(pages, visible);
 }
 
-//#endregion
 export { fitViewToPage, pageInView };
 //# sourceMappingURL=fitViewToPage.js.map

package/dist/core/pages/pageEdits.js

@@ -1,9 +1,9 @@
-import { effectivePose, isEnvelope } from "../scene/effectivePose.js";
-import { layoutPages, pageOfBounds } from "./pages.js";
 import { RECT_POSE_DESCRIPTOR, poseDescriptorForNode, translatePoseViaDescriptor } from "../geometry/poseDescriptor.js";
 import { carriedDescendants, sceneCarrySource } from "../scene/carryDescendants.js";
+import { effectivePose, isEnvelope } from "../scene/effectivePose.js";
+import { layoutPages, pageOfBounds } from "./pages.js";
 
-//#region src/core/pages/pageEdits.ts
+// src/core/pages/pageEdits.ts
 /**
 * A document's pages as a scene document value, and the edits that change
 * them. Each edit moves the nodes on a page by however far the page itself
@@ -158,6 +158,5 @@ function renamePage(scene, id, name, options = {}) {
 	}));
 }
 
-//#endregion
 export { PAGES_DOC_KEY, addPage, movePage, nextPageId, pageMembers, pagesOf, placedPagesOf, removePage, renamePage, resizePage, setPages };
 //# sourceMappingURL=pageEdits.js.map

package/dist/core/pages/pages.js

@@ -1,4 +1,4 @@
-//#region src/core/pages/pages.ts
+// src/core/pages/pages.ts
 var ALIGN = {
 	start: 0,
 	center: .5,
@@ -120,6 +120,5 @@ function pagesBounds(pages) {
 	};
 }
 
-//#endregion
 export { adjacentPage, layoutPages, pageAt, pageHolding, pageName, pageOfBounds, pagesBounds };
 //# sourceMappingURL=pages.js.map