@graphty/graphty-element 2.5.2 → 2.6.0

package/dist/graphty.js

@@ -1,17 +1,17 @@
-import { A as s, a as r, b as E, D as O, E as o, d as S, G as R, e as t, I as L, L as _, N as C, O as A, R as N, S as g, f as i, g as n, h as I, U as T, i as p } from "./chunks/index-J9MgLio9.js";
-import { L as d, S as G, a as f, r as y } from "./chunks/paletteRegistry-Kt-6CeoN.js";
-import { D as M, E as P } from "./chunks/DataSource-qU-nLhXN.js";
-import { I as m, J as U, p as c, q as x, A as u, C as B, x as V, r as H } from "./chunks/optionsFromZod-B9RncoTX.js";
-import { r as Y } from "./chunks/GraphtyLogger-DOTwCiMR.js";
-import { g as W, b as k, N as w, c as K, P as q, R as v, S as J, d as Q, e as X, f as j } from "./chunks/NodeStyle-CtmA7dXi.js";
+import { A as s, a as r, b as E, D as O, E as o, d as S, G as R, e as t, I as L, L as _, N as C, O as A, R as N, S as g, f as i, g as n, h as T, U as I, i as p } from "./chunks/index-BkBLbvui.js";
+import { L as d, S as G, a as f, r as y } from "./chunks/paletteRegistry-BCFSwJGK.js";
+import { D as M, E as P } from "./chunks/DataSource-BL2UzPff.js";
+import { T as h, U as m, p as c, q as x, A as u, C as B, x as V, r as H } from "./chunks/optionsFromZod-CKMYSwTz.js";
+import { r as Y } from "./chunks/GraphtyLogger-B_O67a6c.js";
+import { g as W, b as k, N as w, c as K, P as q, R as v, S as Q, d as X, e as j, f as z } from "./chunks/NodeStyle-CtmA7dXi.js";
 import { A as Z, a as $, G as aa, i as ea, b as sa } from "./chunks/pluginRegistry-Bs8bEkz9.js";
-import { B as Ea, a as Oa, b as oa, C as Sa, G as Ra, c as ta, I as La, O as _a, d as Ca, e as Aa, f as Na, P as ga, g as ia, h as na, R as Ia, T as Ta, i as pa, V as la, Y as da } from "./chunks/sequential-Zym81qm7.js";
+import { B as Ea, a as Oa, b as oa, C as Sa, G as Ra, c as ta, I as La, O as _a, d as Ca, e as Aa, f as Na, P as ga, g as ia, h as na, R as Ta, T as Ia, i as pa, V as la, Y as da } from "./chunks/sequential-Zym81qm7.js";
 import { a as fa, G as ya, V as Da, i as Ma } from "./chunks/GraphStyle-Cwr55SAE.js";
-import { c as ha } from "./chunks/common-DWNKjpH_.js";
+import { c as Ua } from "./chunks/common-DWNKjpH_.js";
 export {
   Z as ACCELERATION_ERROR_CODES,
-  m as ACCELERATION_MIN_NODES_DEFAULT,
-  U as ACCELERATION_MIN_NODES_KEY,
+  h as ACCELERATION_MIN_NODES_DEFAULT,
+  m as ACCELERATION_MIN_NODES_KEY,
   c as ACCELERATION_POLICIES,
   x as ACCELERATION_POLICY_DEFAULT,
   u as Algorithm,
@@ -54,26 +54,26 @@ export {
   ia as PLASMA_COLORS,
   na as PURPLE_GREEN_COLORS,
   q as PolyhedronType,
-  Ia as RED_BLUE_COLORS,
+  Ta as RED_BLUE_COLORS,
   N as RenderManager,
   v as RichTextStyle,
-  J as SHAPE_CONSTANTS,
+  Q as SHAPE_CONSTANTS,
   g as ScreenshotError,
   i as ScreenshotErrorCode,
   n as SelectionManager,
   G as SimpleLayoutConfig,
   f as SimpleLayoutEngine,
-  I as StatsManager,
-  Ta as TOL_MUTED_COLORS,
+  T as StatsManager,
+  Ia as TOL_MUTED_COLORS,
   pa as TOL_VIBRANT_COLORS,
-  T as UpdateManager,
+  I as UpdateManager,
   Da as VIEW_MODE_VALUES,
   la as VIRIDIS_COLORS,
   da as YLORBR_COLORS,
-  ha as colorToHex,
-  Q as defaultEdgeStyle,
-  X as defaultNodeStyle,
-  j as defaultRichTextLabelStyle,
+  Ua as colorToHex,
+  X as defaultEdgeStyle,
+  j as defaultNodeStyle,
+  z as defaultRichTextLabelStyle,
   p as defaultXRConfig,
   V as isAccelerationPolicy,
   ea as isGraphtyError,

package/dist/index.d.ts

@@ -61,7 +61,7 @@ export type { CameraStateChangedEvent, DataLoadingCompleteEvent, DataLoadingErro
 export type { Manager, ManagerConfig, ManagerContext, QueueableManager } from "./src/managers/index";
 export { AlgorithmManager, DataManager, EventManager, InputManager, LayoutManager, OperationQueueManager, RenderManager, SelectionManager, StatsManager, UpdateManager, } from "./src/managers/index";
 export type { GraphContext, GraphContextConfig } from "./src/managers/index";
-export type { QueueableOptions, RunAlgorithmOptions } from "./src/utils/queue-migration";
+export type { QueueableOptions, RunAlgorithmOptions, SetLayoutOptions } from "./src/utils/queue-migration";
 export { EDGE_CONSTANTS, PolyhedronType, SHAPE_CONSTANTS } from "./src/constants/meshConstants";
 export { ScreenshotError, ScreenshotErrorCode } from "./src/screenshot/ScreenshotError";
 export type { CameraAnimationOptions, CameraState, ClipboardStatus, QualityEnhancementOptions, ScreenshotOptions, ScreenshotResult, } from "./src/screenshot/types";

package/dist/logging.js

@@ -1,5 +1,5 @@
-import { d as c, p } from "./chunks/GraphtyLogger-DOTwCiMR.js";
-import { G, e as C, f as M, g as w, h as N, i as V, j as I, k as P, m as U, n as T, o as x } from "./chunks/GraphtyLogger-DOTwCiMR.js";
+import { d as c, p } from "./chunks/GraphtyLogger-B_O67a6c.js";
+import { G, e as C, f as M, g as w, h as N, i as V, j as I, k as P, m as U, n as T, o as x } from "./chunks/GraphtyLogger-B_O67a6c.js";
 const g = "graphty-element-logging-config";
 function O(t) {
   try {

package/dist/schema.d.ts

@@ -19,7 +19,8 @@
  * Node-safety is enforced by a test: `test/packaging/node-safe-entries.test.ts` resolves this
  * module's import graph and fails if Babylon.js, Lit or a DOM global appears in it.
  */
-export type { Binding, BindingOverflow, Channel, ChannelValue, EdgeId, EdgeLinePattern, Encoding, LabelStyle, LayerId, LayerKind, LayerSource, LayerSpec, NodeId, Path, Query, ResultShape, Rgba, RunId, Scope, ScopeId, Selector, StaticStyle, StyleDocument, ThemeDescriptor, } from "./src/catalog/types";
+import type { RuleTree, SelectionDirection } from "./src/catalog/types";
+export type { Binding, BindingOverflow, Channel, ChannelValue, EdgeId, EdgeLinePattern, EdgeMember, EdgeReading, EdgeRef, Encoding, ItemKey, LabelStyle, LayerId, LayerKind, LayerSource, LayerSpec, NodeId, Path, PathKind, Query, ResultId, ResultItem, ResultShape, Rgba, RuleTree, RunId, Scope, ScopeId, ScopeInput, SelectionDirection, Selector, SetCombine, SetCreatedFrom, SetDefinition, SetDefinitionInput, SetId, SetOperand, StaticStyle, StyleDocument, ThemeDescriptor, } from "./src/catalog/types";
 export { isResultShape, RESULT_SHAPES } from "./src/catalog/types";
 export type { AdHocData, EdgeStyleConfig, GraphBackgroundConfig, GraphSelectionStyleConfig, GraphSelectionStyleInput, ImageData, NodeStyleConfig, RichTextStyleType, ViewMode, } from "./src/config/index";
 export { colorToHex, DEFAULT_SELECTION_STYLE, DEFAULT_VIEW_MODE, defaultEdgeStyle, defaultNodeStyle, defaultRichTextLabelStyle, EdgeArrowTypes, EdgeLineTypes, EdgeStyle, GraphBackground, GraphSelectionStyleOpts, isViewMode, NodeShapes, NodeStyle, RichTextStyle, VIEW_MODE_VALUES, } from "./src/config/index";
@@ -27,3 +28,16 @@ export * from "./src/config/palettes/index";
 export { areDistinguishableInGrayscale, colorDifference, isPaletteSafe, simulateDeuteranopia, simulateProtanopia, simulateTritanopia, toGrayscale, } from "./src/utils/styleHelpers/accessibility/colorblindSimulation";
 export type { RgbColor } from "./src/utils/styleHelpers/color/interpolation";
 export { hexToRgb, interpolatePalette, MISSING_DATA_COLOR } from "./src/utils/styleHelpers/color/interpolation";
+/**
+ * A rule tree: what the visibility filter keeps.
+ * @deprecated Use {@link RuleTree}, the same type under the name the rule grammar uses: a rule
+ * tree is also what a rule set holds, not only what the visibility filter keeps. Removed in the
+ * major version that ships the project file.
+ */
+export type Filter = RuleTree;
+/**
+ * Which arcs a degree filter counts.
+ * @deprecated Use {@link SelectionDirection}, the same type under the name the rule grammar uses.
+ * Removed in the major version that ships the project file.
+ */
+export type FilterDirection = SelectionDirection;

package/dist/schema.js

@@ -1,4 +1,4 @@
-import { R as N, e as x } from "./chunks/types-C_c53VgR.js";
+import { R as N, e as x } from "./chunks/types-DFchv4Ny.js";
 import { M as h, h as y, i as M } from "./chunks/interpolation-DY-PNpqX.js";
 import { B as D, a as U, b as B, C as P, G as H, c as V, I as w, O as $, d as F, e as W, f as Y, P as j, g as k, h as q, R as K, T as v, i as z, V as J, Y as Q } from "./chunks/sequential-Zym81qm7.js";
 import { D as Z, a as tt, G as nt, b as at, V as et, i as st } from "./chunks/GraphStyle-Cwr55SAE.js";

package/dist/session.d.ts

@@ -54,6 +54,8 @@
  * Node-safety is enforced by a test: `test/packaging/node-safe-entries.test.ts` resolves this
  * module's import graph and fails if Babylon.js, Lit or a DOM global appears in it.
  */
+import type { RuleTree, SelectionDirection } from "./src/catalog/types";
+import type { SelectionOp } from "./src/session/selection";
 export type { ComponentStatistics, CreateGraphSessionOptions, EdgeRecord, GraphSession, GraphStatistics, NodeRecord, SessionAttributes, SessionCatalogApi, SessionConfig, SessionDataApi, SessionDataConfig, SessionEventMap, SessionGraphStore, SessionRecordSource, SessionRunsOptions, SessionStatus, StyleProblem, } from "./src/session";
 export { createGraphSession } from "./src/session";
 /**
@@ -79,23 +81,44 @@ export { recommendLayout } from "./src/session";
 export type { BatchResult, BatchStep, Caveats, EngineVersions, Precision, Progress, QueueEntry, QueuePolicy, ResolvedScope, Run, RunChange, RunDirection, RunExecutionContext, RunExecutor, RunOptions, RunOutcome, RunPhase, RunProgressReport, RunQueue, RunRecord, RunRemoval, RunsApi, RunScopeRecord, RunSpec, RunStatus, RunStyle, StaleNote, StartOptions, WeightMeaning, } from "./src/session/runs";
 export { isRunId, isRunStatus, isTerminalRunStatus, QUEUE_POLICIES, RUN_ID_PATTERN, RUN_PHASES, RUN_STATUSES, TERMINAL_RUN_STATUSES, } from "./src/session/runs";
 export type { Histogram, HistogramBin, HistogramBinning, HistogramOptions, Normalization, NumericColumnView, RankingEntry, ReadingOptions, ResultsApi, ResultSummary, RunRef, RunResult, SummaryEntry, SummaryGroup, TopRanking, } from "./src/session/results";
-export { defaultReading, RESULT_FIELD_NAMES, RESULT_ROOT, RESULT_SHAPE_CONTRACTS, resultPath } from "./src/session/results";
+export { defaultReading, RESULT_FIELD_NAMES, RESULT_ROOT, RESULT_SHAPE_CONTRACTS, resultPath, } from "./src/session/results";
 export type { SavedScope, ScopeApi, ScopeCount, ScopeCountOptions } from "./src/session/scope";
 export { DEFAULT_SCOPE_SAMPLE } from "./src/session/scope";
-export type { SelectionApi, SelectionAttributeStatistics, SelectionCause, SelectionDelta, SelectionDirection, SelectionStatistics, SelectionTarget, SelectionTextMode, SetOp, } from "./src/session/selection";
+export type { ElementSet, Memberships, SetChange, SetOffer, SetsApi, SetStatus, SetStatusReason, SetUser, } from "./src/session/sets/types";
+export type { SelectionApi, SelectionAttributeStatistics, SelectionCause, SelectionDelta, SelectionDirection, SelectionOp, SelectionStatistics, SelectionTarget, SelectionTextMode, } from "./src/session/selection";
 export { DEFAULT_SELECTION_CAP, SET_OPS } from "./src/session/selection";
-export type { Filter, FilterDirection, FilterResult, TimeStep, TimeWindow, VisibilityApi, VisibilityChange, VisibilitySummary, } from "./src/session/visibility";
-export type { AlgorithmRunCommand, Plan, PlanBlock, PlanEffect, SessionCommand, } from "./src/session";
+export type { FilterResult, RuleTree, TimeStep, TimeWindow, VisibilityApi, VisibilityChange, VisibilitySummary, } from "./src/session/visibility";
+export type { AlgorithmRunCommand, Plan, PlanBlock, PlanEffect, SessionCommand } from "./src/session";
 export { isAlgorithmRunCommand } from "./src/session";
 export type { CostConfidence, CostEstimate, CostGateDecision, CostGateLimits, CostMeasurement, MachineCalibration, } from "./src/session/cost";
 export { DEFAULT_COST_GATE_LIMITS, DEFAULT_EXACT_COMPUTATION_CAP_SECONDS } from "./src/session/cost";
-export type { Binding, BindingOverflow, Channel, EdgeId, Encoding, FieldDescriptor, LayerId, LayerKind, LayerSource, LayerSpec, NodeId, Path, Query, QueryValidation, ResultShape, RunId, Scope, ScopeId, Selector, StaticStyle, StyleDocument, } from "./src/catalog/types";
+export { parseScope, parseSetDefinition } from "./src/catalog/sets/parse";
+export type { Binding, BindingOverflow, Channel, EdgeId, EdgeMember, EdgeReading, EdgeRef, Encoding, FieldDescriptor, ItemKey, LayerId, LayerKind, LayerSource, LayerSpec, NodeId, Path, PathKind, Query, QueryValidation, ResultId, ResultItem, ResultShape, RunId, Scope, ScopeId, ScopeInput, Selector, SetCombine, SetCreatedFrom, SetDefinition, SetDefinitionInput, SetId, SetOperand, StaticStyle, StyleDocument, } from "./src/catalog/types";
 export { isResultShape, RESULT_SHAPES } from "./src/catalog/types";
 export type { ChannelExplanation, ElementLayerSpec, EncodingRun, EncodingSpec, ExplainTarget, FieldWords, HighlightSpec, Layer, LayerPosition, LayerProblem, LegendBlock, LegendSwatch, RepaintReason, RepaintReport, SessionStylesApi, StyleChange, StyleContribution, StyleExplanation, StylesApi, TemplateOptions, TemplateReport, UnboundLayer, ValidationResult, } from "./src/session/styles";
 export { quotePath } from "./src/session/styles";
 export type { AccelerationCapabilities, AccelerationPolicy, AccelerationPrecision, AccelerationState, AccelerationStatus, AcceleratorDeviceInfo, Capabilities, CaptureCapability, GraphAccelerator, Limits, WorkerCapability, XrCapability, } from "./src/acceleration";
-export { ACCELERATION_POLICIES, ACCELERATION_POLICY_DEFAULT, isAccelerationPolicy, } from "./src/acceleration";
+export { ACCELERATION_POLICIES, ACCELERATION_POLICY_DEFAULT, isAccelerationPolicy } from "./src/acceleration";
 export type { DefaultableLimits } from "./src/session";
 export { DEFAULT_LIMITS } from "./src/session";
 export type { AccelerationErrorCode, GraphtyErrorCode, GraphtyErrorInit, GraphtyErrorJson, GraphtyErrorSource, GraphtyErrorTarget, } from "./src/errors";
-export { ACCELERATION_ERROR_CODES, GRAPHTY_ERROR_CODES, GraphtyError, isGraphtyError, isGraphtyErrorCode } from "./src/errors";
+export { ACCELERATION_ERROR_CODES, GRAPHTY_ERROR_CODES, GraphtyError, isGraphtyError, isGraphtyErrorCode, } from "./src/errors";
+/**
+ * A rule tree: what the visibility filter keeps.
+ * @deprecated Use {@link RuleTree}, the same type under the name the rule grammar uses: a rule
+ * tree is also what a rule set holds, not only what the visibility filter keeps. Removed in the
+ * major version that ships the project file.
+ */
+export type Filter = RuleTree;
+/**
+ * Which arcs a degree filter counts.
+ * @deprecated Use {@link SelectionDirection}, the same type under the name the rule grammar uses.
+ * Removed in the major version that ships the project file.
+ */
+export type FilterDirection = SelectionDirection;
+/**
+ * What a mutation does with the elements a target named.
+ * @deprecated Use {@link SelectionOp}, the same type under a name that does not read as a set
+ * operation. Removed in the major version that ships the project file.
+ */
+export type SetOp = SelectionOp;

package/dist/session.js

@@ -1,9 +1,10 @@
-import { R, e as _ } from "./chunks/types-C_c53VgR.js";
-import { A as c, a as C, G as p, i as m, b as L } from "./chunks/pluginRegistry-Bs8bEkz9.js";
-import { p as O, q as U, R as I, t as P, u as y, w as N, x as D, y as w, z as v } from "./chunks/optionsFromZod-B9RncoTX.js";
-import { D as h } from "./chunks/GraphSession-DuAhRgCd.js";
-import { a as b, b as x, c as F, d as z, Q as M, R as k, e as H, f as Y, S as j, T as q, g as Q, i as X, h as B, j as J, k as K } from "./chunks/GraphSession-DuAhRgCd.js";
-import { L as s } from "./chunks/scales-CJCRwi2J.js";
+import { L as s } from "./chunks/parse-BMTqt4SS.js";
+import { p, a as R } from "./chunks/parse-BMTqt4SS.js";
+import { R as c, e as A } from "./chunks/types-DFchv4Ny.js";
+import { A as m, a as L, G as g, i as O, b as U } from "./chunks/pluginRegistry-Bs8bEkz9.js";
+import { p as P, q as y, R as N, t as D, u as w, w as v, x as G, y as b, z as x } from "./chunks/optionsFromZod-CKMYSwTz.js";
+import { D as h } from "./chunks/GraphSession-BhuHSXIo.js";
+import { a as z, b as M, c as k, d as H, Q as Y, R as j, e as q, f as Q, S as X, T as B, g as J, i as K, h as V, j as W, k as Z } from "./chunks/GraphSession-BhuHSXIo.js";
 const u = [
   {
     id: "fixed",
@@ -49,37 +50,39 @@ function T(e, a = {}) {
   });
 }
 export {
-  c as ACCELERATION_ERROR_CODES,
-  O as ACCELERATION_POLICIES,
-  U as ACCELERATION_POLICY_DEFAULT,
-  b as DEFAULT_COST_GATE_LIMITS,
-  x as DEFAULT_EXACT_COMPUTATION_CAP_SECONDS,
+  m as ACCELERATION_ERROR_CODES,
+  P as ACCELERATION_POLICIES,
+  y as ACCELERATION_POLICY_DEFAULT,
+  z as DEFAULT_COST_GATE_LIMITS,
+  M as DEFAULT_EXACT_COMPUTATION_CAP_SECONDS,
   h as DEFAULT_LIMITS,
-  F as DEFAULT_SCOPE_SAMPLE,
-  z as DEFAULT_SELECTION_CAP,
-  C as GRAPHTY_ERROR_CODES,
-  p as GraphtyError,
-  M as QUEUE_POLICIES,
-  I as RESULT_FIELD_NAMES,
-  P as RESULT_ROOT,
-  R as RESULT_SHAPES,
-  y as RESULT_SHAPE_CONTRACTS,
-  k as RUN_ID_PATTERN,
-  H as RUN_PHASES,
-  Y as RUN_STATUSES,
-  j as SET_OPS,
-  q as TERMINAL_RUN_STATUSES,
-  Q as createGraphSession,
-  N as defaultReading,
-  D as isAccelerationPolicy,
-  X as isAlgorithmRunCommand,
-  m as isGraphtyError,
-  L as isGraphtyErrorCode,
-  _ as isResultShape,
-  B as isRunId,
-  J as isRunStatus,
-  K as isTerminalRunStatus,
-  w as quotePath,
+  k as DEFAULT_SCOPE_SAMPLE,
+  H as DEFAULT_SELECTION_CAP,
+  L as GRAPHTY_ERROR_CODES,
+  g as GraphtyError,
+  Y as QUEUE_POLICIES,
+  N as RESULT_FIELD_NAMES,
+  D as RESULT_ROOT,
+  c as RESULT_SHAPES,
+  w as RESULT_SHAPE_CONTRACTS,
+  j as RUN_ID_PATTERN,
+  q as RUN_PHASES,
+  Q as RUN_STATUSES,
+  X as SET_OPS,
+  B as TERMINAL_RUN_STATUSES,
+  J as createGraphSession,
+  v as defaultReading,
+  G as isAccelerationPolicy,
+  K as isAlgorithmRunCommand,
+  O as isGraphtyError,
+  U as isGraphtyErrorCode,
+  A as isResultShape,
+  V as isRunId,
+  W as isRunStatus,
+  Z as isTerminalRunStatus,
+  p as parseScope,
+  R as parseSetDefinition,
+  b as quotePath,
   T as recommendLayout,
-  v as resultPath
+  x as resultPath
 };

package/dist/src/Graph.d.ts

@@ -9,7 +9,7 @@ import { VoiceInputAdapter } from "./ai/input/VoiceInputAdapter";
 import type { ApiKeyManager } from "./ai/keys";
 import type { CameraState } from "./camera/types.js";
 import { type CameraController, type CameraKey, CameraManager } from "./cameras/CameraManager";
-import type { AlgorithmKey, Scope } from "./catalog/types";
+import type { AlgorithmKey, Scope, ScopeInput } from "./catalog/types";
 import { AdHocData, FetchEdgesFn, FetchNodesFn, type GraphBackgroundConfig, type GraphBehaviorConfig, type GraphSelectionStyleInput, type ViewMode, type XRConfig } from "./config";
 import { type PartialXRConfig } from "./config/xr-config-schema";
 import { EventOfType, EventType } from "./events";
@@ -19,10 +19,10 @@ import { Node } from "./Node";
 import type { ScreenshotOptions, ScreenshotResult } from "./screenshot/types.js";
 import { type GraphSession } from "./session";
 import type { Run, StartOptions } from "./session/runs";
-import type { SelectionDelta, SelectionTarget, SetOp } from "./session/selection";
+import type { SelectionDelta, SelectionOp, SelectionTarget } from "./session/selection";
 import type { StyleSuggestion } from "./session/styles";
 import { Styles } from "./Styles";
-import type { QueueableOptions, RunAlgorithmOptions } from "./utils/queue-migration";
+import type { QueueableOptions, RunAlgorithmOptions, SetLayoutOptions } from "./utils/queue-migration";
 import { XRSessionManager } from "./xr/XRSessionManager";
 /**
  * Main orchestrator class for graph visualization and interaction.
@@ -433,8 +433,10 @@ export declare class Graph implements GraphContext {
      * animate nodes from their current positions to new positions.
      * @param type - Layout algorithm name
      * @param opts - Layout-specific configuration options
-     * @param options - Options for operation queue behavior
+     * @param options - Options for operation queue behavior, and `scope`: what the layout runs
+     *   over (see {@link SetLayoutOptions.scope})
      * @returns Promise that resolves when layout is initialized
+     * @throws A `GraphtyError` with `E_UNSUPPORTED` for a scope on a layout that is not scoped.
      * @since 1.0.0
      * @see {@link waitForSettled} to wait for layout completion
      * @see {@link https://graphty.app/storybook/graphty-element/?path=/story/layout-3d--circular | 3D Layout Examples}
@@ -457,7 +459,26 @@ export declare class Graph implements GraphContext {
      * await graph.setLayout('circular', { radius: 5 });
      * ```
      */
-    setLayout(type: string, opts?: object, options?: QueueableOptions): Promise<void>;
+    setLayout(type: string, opts?: object, options?: SetLayoutOptions): Promise<void>;
+    /**
+     * What layouts run over: the scope the running layout was given, carried to the next one.
+     * @returns The canonical scope, or undefined when layouts run over the whole graph.
+     * @since 2.5.0
+     */
+    getLayoutScope(): Scope | undefined;
+    /**
+     * Change what layouts run over, and restart the running layout over it.
+     *
+     * The scope is carried at once, so a layout set after this call runs over it too. It never
+     * refuses a scope that cannot be laid out -- one naming a removed set, or a running layout
+     * that is not scoped -- because it is not an explicit `setLayout`: such a scope is inactive,
+     * and the layout runs over the whole graph.
+     * @param scope - The scope; undefined or `"graph"` for the whole graph.
+     * @returns A promise that resolves once the running layout has restarted.
+     * @throws A `GraphtyError` with `E_BAD_COMMAND` when the value is not a scope.
+     * @since 2.5.0
+     */
+    setLayoutScope(scope: ScopeInput | undefined): Promise<void>;
     /**
      * Run a graph algorithm, addressed the 1.10 way.
      * @remarks
@@ -611,6 +632,13 @@ export declare class Graph implements GraphContext {
      * @param options - Queue options for operation ordering
      */
     removeNodes(nodeIds: (string | number)[], options?: QueueableOptions): Promise<void>;
+    /**
+     * Write each update into its node's attributes through the one attribute writer, so the
+     * revision of every field written moves. `id` is the address, not an attribute, and is not
+     * written.
+     * @param updates - the updates, each naming its node by `id`
+     */
+    private writeNodeUpdates;
     /**
      * Update node data for existing nodes in the graph.
      * @param updates - Array of update objects containing node ID and properties to update
@@ -927,7 +955,7 @@ export declare class Graph implements GraphContext {
      *     does.
      * @returns What changed: what joined, what left, and what the selection holds now.
      */
-    select(target: SelectionTarget, op?: SetOp): Promise<SelectionDelta>;
+    select(target: SelectionTarget, op?: SelectionOp): Promise<SelectionDelta>;
     /**
      * Set up a scene pointer observer to handle background clicks for deselection.
      * When the user clicks on an area with no node, the current selection is cleared.
@@ -1575,7 +1603,7 @@ export declare class Graph implements GraphContext {
      * `E_OPTION_RANGE`, exactly as `resolveCameraPreset` does.
      */
     applyCameraView(id: string, options?: {
-        scope?: Scope;
+        scope?: ScopeInput;
         params?: Readonly<Record<string, unknown>>;
     } & import("./screenshot/types.js").CameraAnimationOptions): Promise<void>;
     /**

package/dist/src/acceleration/types.d.ts

@@ -373,7 +373,7 @@ export declare const ACCELERATION_MIN_NODES_DEFAULT = 0;
 /**
  * Where and when the per-capability floors below were measured, as the plan's reason quotes it.
  */
-export declare const ACCELERATION_MIN_NODES_MEASUREMENT = "RTX 4070 SUPER, headless Chromium, 2026-09-25";
+export declare const ACCELERATION_MIN_NODES_MEASUREMENT = "RTX 4070 SUPER, headless Chromium, 2026-09-27";
 /**
  * The node count below which the element declines the accelerator for one capability, when the
  * consumer has not set {@link ACCELERATION_MIN_NODES_KEY} themselves.
@@ -385,44 +385,81 @@ export declare const ACCELERATION_MIN_NODES_MEASUREMENT = "RTX 4070 SUPER, headl
  * before the device has started. One number cannot serve both, which is why the layout default
  * stays 0 and each algorithm capability the adapters route carries its own floor here.
  *
- * MEASURED, not guessed. `tmp/traversal-threshold/kernel-cpu-vs-gpu.ts` (the harness, kept
- * out of the tree) mounted `<graphty-element acceleration="required">` in headless Chromium on
- * the dev box (RTX 4070 SUPER through ANGLE's Vulkan backend, 2026-09-25, load average
- * 18 to 23), took the accelerator the element built, built seeded undirected graphs with ten
- * edges per node and integer weights 1..10 in the page, and timed the two dispatchers
- * `Algorithm.accelerated()` uses -- `accelerated(null)` for the CPU port and
- * `accelerated(narrowAlgorithms(accelerator))` for the device -- directly on the snapshot, so no
- * renderer frame is in the loop. Medians of nine warm calls after one cold call, in ms:
- *
- * | nodes / edges | BFS cpu | BFS gpu | sssp cpu | sssp gpu | pageRank cpu | pageRank gpu | components cpu | components gpu |
- * | ------------- | ------: | ------: | -------: | -------: | -----------: | -----------: | -------------: | -------------: |
- * | 1k / 10k      |     0.1 |     7.8 |      0.3 |      7.3 |          0.7 |          3.0 |            0.2 |            3.9 |
- * | 5k / 50k      |     0.6 |     8.8 |      1.6 |      7.9 |          5.3 |          2.9 |            1.2 |            5.3 |
- * | 10k / 100k    |     1.0 |     7.5 |      2.8 |      7.2 |          4.6 |          2.9 |            2.3 |            7.4 |
- * | 20k / 200k    |     1.7 |     9.1 |      3.8 |     13.5 |         16.2 |          3.0 |            4.8 |            7.5 |
- * | 50k / 500k    |     5.7 |    13.0 |     25.8 |     27.6 |         50.3 |          4.3 |           11.6 |            7.8 |
- * | 100k / 1M     |     9.8 |    17.3 |     30.4 |     49.2 |         67.4 |          5.6 |           16.2 |            8.6 |
- * | 200k / 2M     |    17.6 |    23.2 |     73.0 |     79.6 |        148.3 |         10.5 |           29.9 |           11.5 |
- * | 500k / 5M     |    88.3 |    33.6 |    343.8 |    150.3 |        523.0 |         36.1 |           99.7 |           20.9 |
- * | 1M / 10M      |   250.9 |    24.2 |   1031.1 |    274.9 |       1762.4 |         17.5 |          215.7 |           43.2 |
- *
- * The two traversals were then measured twice more around their crossover, because the device's
- * time at one size moves with what else the box is doing (the first sweep's 200k row was taken
- * at a load average of 22.6, the repeats at about 18):
- *
- * | nodes / edges | BFS cpu | BFS gpu | sssp cpu | sssp gpu |
- * | ------------- | ------: | ------: | -------: | -------: |
- * | 100k / 1M     |     7.4 |     9.5 |     26.9 |     20.9 |
- * | 200k / 2M     |    15.6 |    10.1 |     66.3 |     37.8 |
- * | 200k / 2M     |    17.8 |    11.0 |     70.6 |     42.5 |
- * | 300k / 3M     |    35.2 |    13.3 |    129.2 |     77.1 |
- * | 300k / 3M     |    34.4 |    18.9 |    129.8 |     65.2 |
- * | 400k / 4M     |    63.3 |    30.7 |    226.6 |    128.2 |
- * | 500k / 5M     |    93.1 |    32.5 |    361.9 |    200.0 |
- *
- * So: BFS loses at 100k in both runs and splits at 200k (one loss, two wins); Dijkstra splits at
- * both 100k and 200k; from 300k up the device wins every run of both by two to ten times.
- * PageRank wins from 5k and connected components from 50k, in the one run each was measured.
+ * MEASURED END TO END THROUGH THE ELEMENT, 2026-09-27, on the dev box (RTX 4070 SUPER through
+ * ANGLE's Vulkan backend, headless Chromium 143; the page reported the renderer as
+ * "ANGLE (NVIDIA, Vulkan 1.4.312 (NVIDIA GeForce RTX 4070 SUPER), NVIDIA)", so no software
+ * rasteriser is in these numbers). `<graphty-element acceleration="required">` was mounted with
+ * `layout="random"`, a seeded undirected graph was built in the page, and each capability was
+ * timed as `session.runs.start(...)` -- the call a consumer makes -- so the snapshot derivation,
+ * the dispatch and the publication of the result rows are all inside the number. The two arms
+ * were selected on ONE loaded element by flipping `acceleration-min-nodes` between 0 and
+ * 1,000,000,000: that threshold is the one gate that still sends `"required"` to the CPU port, so
+ * the accelerator stayed attached and the graph stayed resident across both arms, and a run whose
+ * `caveats.precision` did not read `f32` on the device arm and `f64` on the processor arm was
+ * rejected rather than counted.
+ *
+ * Medians of fifteen passes after one discarded pass of each arm, in ms, with the minimum of the
+ * fifteen beside it. Measured on a quiet box: the one-minute load average was 5.3 at the start and
+ * 3.2 at the end on 32 hardware threads, and a capability's fastest and slowest pass were usually
+ * within 10 percent of each other. An earlier sweep of the same code at load 55 to 74 read up to
+ * three times these absolute costs and landed on the same crossovers, because interleaving the
+ * arms put both under the same interference -- which is why a busy-box RATIO can be trusted where
+ * a busy-box millisecond cannot. Node counts above 10,000 carry 100,000 edges rather than ten per
+ * node, because 100,000 edges is the most the element will hold (see below):
+ *
+ * | nodes / edges     | BFS cpu | BFS gpu | sssp cpu | sssp gpu | pageRank cpu | pageRank gpu | components cpu | components gpu |
+ * | ----------------- | ------: | ------: | -------: | -------: | -----------: | -----------: | -------------: | -------------: |
+ * | 1,000 / 10,000    |     4.7 |    11.3 |      5.5 |     11.6 |          5.3 |          7.8 |            4.4 |            9.5 |
+ * | 5,000 / 50,000    |     2.1 |    17.1 |      6.9 |     21.9 |          5.3 |         13.2 |            1.4 |           26.5 |
+ * | 10,000 / 100,000  |     3.9 |    18.0 |     14.6 |     32.8 |         11.3 |         19.4 |            2.6 |           23.9 |
+ * | 20,000 / 100,000  |     7.5 |    20.4 |     26.7 |     36.2 |         22.4 |         27.6 |            4.5 |           27.4 |
+ * | 50,000 / 100,000  |    22.5 |    41.7 |     27.7 |     40.4 |         73.6 |         59.3 |            9.5 |           35.3 |
+ *
+ * The same sizes by the minimum of the fifteen passes:
+ *
+ * | nodes / edges     | BFS cpu | BFS gpu | sssp cpu | sssp gpu | pageRank cpu | pageRank gpu | components cpu | components gpu |
+ * | ----------------- | ------: | ------: | -------: | -------: | -----------: | -----------: | -------------: | -------------: |
+ * | 1,000 / 10,000    |     4.4 |    10.9 |      5.1 |     11.1 |          5.0 |          7.5 |            4.3 |            5.5 |
+ * | 5,000 / 50,000    |     1.8 |    14.0 |      6.4 |     20.4 |          4.6 |         11.7 |            1.3 |           25.2 |
+ * | 10,000 / 100,000  |     3.4 |    15.9 |     13.0 |     27.1 |         11.2 |         16.3 |            2.5 |           22.9 |
+ * | 20,000 / 100,000  |     7.0 |    19.0 |     17.2 |     27.7 |         22.0 |         24.4 |            4.2 |           24.5 |
+ * | 50,000 / 100,000  |    19.6 |    31.4 |     24.8 |     35.6 |         70.5 |         55.8 |            8.7 |           32.2 |
+ *
+ * WHAT THE ELEMENT CAN HOLD IS THE BINDING CONSTRAINT, and it is why four of the five rows above
+ * stop at 100,000 edges. `DEFAULT_LIMITS.renderCeiling` is 50,000 nodes and
+ * `DEFAULT_LIMITS.edgesDrawn` is 100,000 edges, and a load past either is REFUSED with
+ * `E_TOO_LARGE` rather than drawn badly. So the largest graph a consumer can put in front of
+ * these algorithms is 50,000 nodes with 100,000 edges -- or 10,000 nodes if the graph has the ten
+ * edges per node the sweep above uses for its smaller sizes. Sizes beyond that cannot be
+ * measured through the element, only through the package underneath it.
+ *
+ * ONLY PAGERANK CROSSES INSIDE WHAT THE ELEMENT CAN HOLD. It wins at 50,000 nodes by 1.24x on the
+ * medians and 1.26x on the minima, and loses at every smaller size, 20,000 included, where it
+ * reads 0.81x and 0.90x. That settles 20,000, which the busy-box sweep could not: three runs there
+ * disagreed at 1.09x, 0.94x and 0.86x, and the same sweep reported a tie at 10,000 on the minima
+ * that the quiet run shows was interference (0.69x). So 20,000 is below the floor and 50,000 is
+ * the floor. Breadth-first search, shortest paths and connected components lose at EVERY size the
+ * element can hold: the device's best showing is 0.54x for breadth-first search and 0.69x for
+ * shortest paths at 50,000 / 100,000, and connected components never gets past 0.46x on the
+ * medians because the processor implementation finishes a 50,000-node graph in 8.7 to 15.8 ms.
+ *
+ * The reason is a fixed cost, not a slow kernel. An accelerated call through the element never
+ * came back in less than about 5.5 ms at any size, and took 7.5 to 11 ms at the smallest, because
+ * each level of a traversal and each convergence test of an iterative algorithm is a readback, and
+ * a readback in Chromium is about 2 ms of round trip. The processor path pays no such floor: it
+ * answered in 1.3 ms at 5,000 nodes.
+ * Below the point where the processor's own work exceeds the device's round trips, the device
+ * cannot win however fast its arithmetic is.
+ *
+ * SO THREE OF THE FOUR FLOORS ARE ABOVE THE RENDER CEILING AND THOSE CAPABILITIES ARE NOT ROUTED
+ * TO THE DEVICE AT ALL TODAY. Their numbers are not from the sweep above -- it cannot reach them
+ * -- but from the crossovers measured on `@graphty/webgpu-graph-algorithms` itself with the graph
+ * resident, in `design/decisions/2026-09-26-which-algorithms-earn-the-gpu.md`: 141,000 nodes for
+ * breadth-first search, 107,000 for shortest paths and 132,000 for connected components. Those are
+ * floors for the KERNEL, and the element adds the readback round trips above to the device arm and
+ * a few milliseconds of result publication to both, so the element's true crossing is at or above
+ * each. Carrying them is what makes the element's behaviour and that record agree; raising the
+ * render ceiling (issue #419) is what would let any of the three be measured here and sharpened.
  *
  * A floor is the smallest measured size at which the device's median was at or below the CPU
  * port's IN EVERY RUN, so a size that won under one load and lost under another is below it. A
@@ -430,10 +467,9 @@ export declare const ACCELERATION_MIN_NODES_MEASUREMENT = "RTX 4070 SUPER, headl
  *
  * Two things the table does not cover. It is one card and one browser: a slower CPU or a
  * slower device moves the crossover, and a consumer who has measured their own machine sets
- * `acceleration.minNodes`, which replaces every floor here with their number. And it is the
- * kernel's time, not the run's: through the element a run also publishes its result rows,
- * which costs the same on either path and is why the element-level numbers in the issue read
- * higher on both sides.
+ * `acceleration.minNodes`, which replaces every floor here with their number. And a PageRank run
+ * that sets `personalization` or `initialRanks`, or runs over an undirected graph, takes the CPU
+ * implementation whatever the node count, so the floor never applies to it.
  *
  * Under `acceleration="required"` the floors do not apply: `"required"` is what a benchmark
  * runs under, and a benchmark of the small end of the curve has to reach the device.