@pilates/core 1.0.0 → 1.1.0

package/dist/algorithm/index.d.ts

@@ -15,5 +15,36 @@
  * catch any cache-correctness regression as soon as it lands.
  */
 import type { Node } from '../node.js';
+import { type LayoutTrace } from './spineless/layout.js';
+export type { LayoutTrace } from './spineless/layout.js';
+/**
+ * A profiler callback invoked after every public `calculateLayout`
+ * (outside differential mode) with the laid-out root and a
+ * `LayoutTrace` describing what the engine did. Register one with
+ * `setLayoutProfiler`.
+ */
+export type LayoutProfiler = (root: Node, trace: LayoutTrace) => void;
+/**
+ * Register a profiler invoked after every `calculateLayout`, or pass
+ * `null` to disable. While no profiler is registered the layout path
+ * is unchanged — observability is strictly pay-for-what-you-use.
+ */
+export declare function setLayoutProfiler(listener: LayoutProfiler | null): void;
+/**
+ * The engine path `root`'s most recent `calculateLayout` took, or
+ * `undefined` if it has never been laid out. Powers `inspectLayout`.
+ *
+ * @internal
+ */
+export declare function lastLayoutPath(root: Node): LayoutTrace['path'] | undefined;
 export declare function calculateLayout(root: Node, availableWidth: number | undefined, availableHeight: number | undefined): void;
+/**
+ * Run the imperative algorithm + its per-node layout cache directly,
+ * bypassing the Spineless default. The public `calculateLayout`
+ * routes through Spineless; this entry point lets the imperative
+ * cache's own tests exercise the imperative path.
+ *
+ * @internal
+ */
+export declare function calculateLayoutImperative(root: Node, availableWidth?: number, availableHeight?: number): void;
 //# sourceMappingURL=index.d.ts.map

package/dist/algorithm/index.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../src/algorithm/index.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;GAeG;AAEH,OAAO,KAAK,EAAE,IAAI,EAAE,MAAM,YAAY,CAAC;AAevC,wBAAgB,eAAe,CAC7B,IAAI,EAAE,IAAI,EACV,cAAc,EAAE,MAAM,GAAG,SAAS,EAClC,eAAe,EAAE,MAAM,GAAG,SAAS,GAClC,IAAI,CAsBN"}
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../src/algorithm/index.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;GAeG;AAEH,OAAO,KAAK,EAAE,IAAI,EAAE,MAAM,YAAY,CAAC;AAYvC,OAAO,EAAE,KAAK,WAAW,EAAmB,MAAM,uBAAuB,CAAC;AAE1E,YAAY,EAAE,WAAW,EAAE,MAAM,uBAAuB,CAAC;AAIzD;;;;;GAKG;AACH,MAAM,MAAM,cAAc,GAAG,CAAC,IAAI,EAAE,IAAI,EAAE,KAAK,EAAE,WAAW,KAAK,IAAI,CAAC;AAKtE;;;;GAIG;AACH,wBAAgB,iBAAiB,CAAC,QAAQ,EAAE,cAAc,GAAG,IAAI,GAAG,IAAI,CAEvE;AAmBD;;;;;GAKG;AACH,wBAAgB,cAAc,CAAC,IAAI,EAAE,IAAI,GAAG,WAAW,CAAC,MAAM,CAAC,GAAG,SAAS,CAE1E;AAED,wBAAgB,eAAe,CAC7B,IAAI,EAAE,IAAI,EACV,cAAc,EAAE,MAAM,GAAG,SAAS,EAClC,eAAe,EAAE,MAAM,GAAG,SAAS,GAClC,IAAI,CA6DN;AAED;;;;;;;GAOG;AACH,wBAAgB,yBAAyB,CACvC,IAAI,EAAE,IAAI,EACV,cAAc,CAAC,EAAE,MAAM,EACvB,eAAe,CAAC,EAAE,MAAM,GACvB,IAAI,CAEN"}

package/dist/algorithm/index.js

@@ -17,10 +17,83 @@
 import { LayoutCache, clearAllCaches, diffLayouts, markDirtyDeep, restoreFromCache, snapshotForCache, snapshotTreeLayouts, } from './cache.js';
 import { layoutChildren, resolveRootAxisSize } from './main-axis.js';
 import { roundLayout } from './round.js';
+import { SpinelessLayout } from './spineless/layout.js';
 const DIFFERENTIAL = process.env.PILATES_DIFFERENTIAL_LAYOUT === '1';
+/** The registered profiler, or `null` while layout tracing is off. */
+let profiler = null;
+/**
+ * Register a profiler invoked after every `calculateLayout`, or pass
+ * `null` to disable. While no profiler is registered the layout path
+ * is unchanged — observability is strictly pay-for-what-you-use.
+ */
+export function setLayoutProfiler(listener) {
+    profiler = listener;
+}
+/**
+ * Per-root layout-engine state for the public `calculateLayout`.
+ * `'cold'` — laid out once, by the imperative path. A `SpinelessLayout`
+ * — adopted on the second call onward (see `calculateLayout`). Keyed
+ * weakly so a dropped root takes its state with it.
+ */
+const layoutEngines = new WeakMap();
+/**
+ * The engine path each root's most recent `calculateLayout` took —
+ * read by the `inspectLayout` devtools dump (phase 9). Stored
+ * unconditionally (a `WeakMap.set` is negligible beside the O(tree)
+ * `spinelessSupports` walk the call already does), so the path is
+ * known whether or not a profiler is registered.
+ */
+const lastPaths = new WeakMap();
+/**
+ * The engine path `root`'s most recent `calculateLayout` took, or
+ * `undefined` if it has never been laid out. Powers `inspectLayout`.
+ *
+ * @internal
+ */
+export function lastLayoutPath(root) {
+    return lastPaths.get(root);
+}
 export function calculateLayout(root, availableWidth, availableHeight) {
     if (!DIFFERENTIAL) {
-        calculateLayoutImpl(root, availableWidth, availableHeight);
+        // The Spineless grammar covers every tree as of phase 10 (v29
+        // `display: 'none'`, v30 a measure function on an absolute node) —
+        // there is no longer a grammar-unsupported fallback. The
+        // imperative algorithm still serves a root's deliberate cold first
+        // layout (no grammar to amortise) and differential mode.
+        //
+        // `driver` is non-null exactly when the Spineless engine served
+        // this call — its `lastTrace` is then the trace to report.
+        let driver = null;
+        // First layout of a root: the imperative path is faster cold — no
+        // grammar to build. A root laid out a SECOND time is probably
+        // long-lived, so from then on the validated Spineless incremental
+        // engine takes over — build once, relay incrementally.
+        const engine = layoutEngines.get(root);
+        if (engine === undefined) {
+            calculateLayoutImpl(root, availableWidth, availableHeight);
+            layoutEngines.set(root, 'cold');
+        }
+        else {
+            driver = engine === 'cold' ? new SpinelessLayout(root) : engine;
+            if (engine === 'cold')
+                layoutEngines.set(root, driver);
+            driver.layout(availableWidth, availableHeight);
+        }
+        // Record the path for `inspectLayout`. Reading `driver.lastTrace`
+        // costs nothing (a field read); the imperative-trace OBJECT below
+        // is built only when a profiler is registered.
+        lastPaths.set(root, driver !== null ? driver.lastTrace.path : 'imperative');
+        if (profiler !== null) {
+            profiler(root, driver !== null
+                ? driver.lastTrace
+                : {
+                    path: 'imperative',
+                    dirtyNodes: 0,
+                    fieldsRecomputed: 0,
+                    fieldsChanged: 0,
+                    movedSubtrees: 0,
+                });
+        }
         return;
     }
     // First pass: cached path (normal).
@@ -36,6 +109,17 @@ export function calculateLayout(root, availableWidth, availableHeight) {
         throw new Error(`[pilates differential layout] cache produced different result than fresh recompute:\n  ${diff}`);
     }
 }
+/**
+ * Run the imperative algorithm + its per-node layout cache directly,
+ * bypassing the Spineless default. The public `calculateLayout`
+ * routes through Spineless; this entry point lets the imperative
+ * cache's own tests exercise the imperative path.
+ *
+ * @internal
+ */
+export function calculateLayoutImperative(root, availableWidth, availableHeight) {
+    calculateLayoutImpl(root, availableWidth, availableHeight);
+}
 function calculateLayoutImpl(root, availableWidth, availableHeight) {
     const widthMode = availableWidth === undefined ? 'undefined' : 'exactly';
     const heightMode = availableHeight === undefined ? 'undefined' : 'exactly';

package/dist/algorithm/index.js.map

@@ -1 +1 @@
-{"version":3,"file":"index.js","sourceRoot":"","sources":["../../src/algorithm/index.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;GAeG;AAGH,OAAO,EACL,WAAW,EACX,cAAc,EACd,WAAW,EACX,aAAa,EACb,gBAAgB,EAChB,gBAAgB,EAChB,mBAAmB,GACpB,MAAM,YAAY,CAAC;AACpB,OAAO,EAAE,cAAc,EAAE,mBAAmB,EAAE,MAAM,gBAAgB,CAAC;AACrE,OAAO,EAAE,WAAW,EAAE,MAAM,YAAY,CAAC;AAEzC,MAAM,YAAY,GAAG,OAAO,CAAC,GAAG,CAAC,2BAA2B,KAAK,GAAG,CAAC;AAErE,MAAM,UAAU,eAAe,CAC7B,IAAU,EACV,cAAkC,EAClC,eAAmC;IAEnC,IAAI,CAAC,YAAY,EAAE,CAAC;QAClB,mBAAmB,CAAC,IAAI,EAAE,cAAc,EAAE,eAAe,CAAC,CAAC;QAC3D,OAAO;IACT,CAAC;IAED,oCAAoC;IACpC,mBAAmB,CAAC,IAAI,EAAE,cAAc,EAAE,eAAe,CAAC,CAAC;IAC3D,MAAM,cAAc,GAAG,mBAAmB,CAAC,IAAI,CAAC,CAAC;IAEjD,uDAAuD;IACvD,cAAc,CAAC,IAAI,CAAC,CAAC;IACrB,aAAa,CAAC,IAAI,CAAC,CAAC;IACpB,mBAAmB,CAAC,IAAI,EAAE,cAAc,EAAE,eAAe,CAAC,CAAC;IAC3D,MAAM,YAAY,GAAG,mBAAmB,CAAC,IAAI,CAAC,CAAC;IAE/C,MAAM,IAAI,GAAG,WAAW,CAAC,cAAc,EAAE,YAAY,CAAC,CAAC;IACvD,IAAI,IAAI,KAAK,EAAE,EAAE,CAAC;QAChB,MAAM,IAAI,KAAK,CACb,0FAA0F,IAAI,EAAE,CACjG,CAAC;IACJ,CAAC;AACH,CAAC;AAED,SAAS,mBAAmB,CAC1B,IAAU,EACV,cAAkC,EAClC,eAAmC;IAEnC,MAAM,SAAS,GAAG,cAAc,KAAK,SAAS,CAAC,CAAC,CAAE,WAAqB,CAAC,CAAC,CAAE,SAAmB,CAAC;IAC/F,MAAM,UAAU,GAAG,eAAe,KAAK,SAAS,CAAC,CAAC,CAAE,WAAqB,CAAC,CAAC,CAAE,SAAmB,CAAC;IACjG,MAAM,EAAE,GAAG,cAAc,IAAI,MAAM,CAAC,iBAAiB,CAAC;IACtD,MAAM,EAAE,GAAG,eAAe,IAAI,MAAM,CAAC,iBAAiB,CAAC;IACvD,MAAM,GAAG,GAAG;QACV,cAAc,EAAE,EAAE;QAClB,SAAS;QACT,eAAe,EAAE,EAAE;QACnB,UAAU;KACX,CAAC;IAEF,mDAAmD;IACnD,IAAI,CAAC,IAAI,CAAC,OAAO,EAAE,IAAI,IAAI,CAAC,YAAY,KAAK,SAAS,EAAE,CAAC;QACvD,MAAM,GAAG,GAAG,IAAI,CAAC,YAAY,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC;QAC1C,IAAI,GAAG,KAAK,SAAS,EAAE,CAAC;YACtB,IAAI,CAAC,OAAO,CAAC,IAAI,GAAG,CAAC,CAAC;YACtB,IAAI,CAAC,OAAO,CAAC,GAAG,GAAG,CAAC,CAAC;YACrB,IAAI,CAAC,UAAU,GAAG,CAAC,CAAC;YACpB,IAAI,CAAC,SAAS,GAAG,CAAC,CAAC;YACnB,gBAAgB,CAAC,IAAI,EAAE,GAAG,CAAC,CAAC;YAC5B,kEAAkE;YAClE,uEAAuE;YACvE,qEAAqE;YACrE,uEAAuE;YACvE,uEAAuE;YACvE,EAAE;YACF,kEAAkE;YAClE,2CAA2C;YAC3C,6CAA6C;YAC7C,qEAAqE;YACrE,qEAAqE;YACrE,sEAAsE;YACtE,iEAAiE;YACjE,oDAAoD;YACpD,uEAAuE;YACvE,+DAA+D;YAC/D,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,aAAa,EAAE,EAAE,CAAC,EAAE,EAAE,CAAC;gBAC9C,MAAM,CAAC,GAAG,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAE,CAAC;gBAC5B,IAAI,CAAC,CAAC,KAAK,CAAC,OAAO,KAAK,MAAM;oBAAE,SAAS;gBACzC,IAAI,CAAC,CAAC,CAAC,OAAO,EAAE,IAAI,CAAC,CAAC,CAAC,mBAAmB;oBAAE,SAAS;gBACrD,yEAAyE;gBACzE,qEAAqE;gBACrE,6CAA6C;gBAC7C,cAAc,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC;YAC1B,CAAC;YACD,SAAS,CAAC,IAAI,CAAC,CAAC;YAChB,OAAO;QACT,CAAC;IACH,CAAC;IAED,YAAY;IACZ,IAAI,CAAC,OAAO,CAAC,IAAI,GAAG,CAAC,CAAC;IACtB,IAAI,CAAC,OAAO,CAAC,GAAG,GAAG,CAAC,CAAC;IACrB,IAAI,CAAC,UAAU,GAAG,CAAC,CAAC;IACpB,IAAI,CAAC,SAAS,GAAG,CAAC,CAAC;IACnB,IAAI,CAAC,OAAO,CAAC,KAAK,GAAG,mBAAmB,CAAC,IAAI,EAAE,KAAK,EAAE,cAAc,CAAC,CAAC;IACtE,IAAI,CAAC,OAAO,CAAC,MAAM,GAAG,mBAAmB,CAAC,IAAI,EAAE,QAAQ,EAAE,eAAe,CAAC,CAAC;IAE3E,cAAc,CAAC,IAAI,CAAC,CAAC;IACrB,WAAW,CAAC,IAAI,CAAC,CAAC;IAClB,kBAAkB,CAAC,IAAI,CAAC,CAAC;IACzB,SAAS,CAAC,IAAI,CAAC,CAAC;IAEhB,2EAA2E;IAC3E,IAAI,IAAI,CAAC,YAAY,KAAK,SAAS;QAAE,IAAI,CAAC,YAAY,GAAG,IAAI,WAAW,EAAE,CAAC;IAC3E,IAAI,CAAC,YAAY,CAAC,KAAK,CAAC,GAAG,EAAE,gBAAgB,CAAC,IAAI,CAAC,CAAC,CAAC;AACvD,CAAC;AAED,SAAS,SAAS,CAAC,IAAU;IAC3B,IAAI,CAAC,UAAU,EAAE,CAAC;IAClB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,aAAa,EAAE,EAAE,CAAC,EAAE;QAAE,SAAS,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAE,CAAC,CAAC;AAC9E,CAAC;AAED;;;;;;;;;;;GAWG;AACH,SAAS,kBAAkB,CAAC,IAAU;IACpC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,aAAa,EAAE,EAAE,CAAC,EAAE;QAAE,kBAAkB,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAE,CAAC,CAAC;IAErF,IAAI,YAAY,GAAG,CAAC,CAAC;IACrB,IAAI,aAAa,GAAG,CAAC,CAAC;IACtB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,aAAa,EAAE,EAAE,CAAC,EAAE,EAAE,CAAC;QAC9C,MAAM,CAAC,GAAG,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAE,CAAC;QAC5B,MAAM,EAAE,GAAG,CAAC,CAAC,OAAO,CAAC;QACrB,YAAY,GAAG,IAAI,CAAC,GAAG,CAAC,YAAY,EAAE,EAAE,CAAC,IAAI,GAAG,EAAE,CAAC,KAAK,CAAC,CAAC;QAC1D,aAAa,GAAG,IAAI,CAAC,GAAG,CAAC,aAAa,EAAE,EAAE,CAAC,GAAG,GAAG,EAAE,CAAC,MAAM,CAAC,CAAC;IAC9D,CAAC;IACD,IAAI,CAAC,OAAO,CAAC,WAAW,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,OAAO,CAAC,KAAK,EAAE,YAAY,CAAC,CAAC;IACtE,IAAI,CAAC,OAAO,CAAC,YAAY,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,OAAO,CAAC,MAAM,EAAE,aAAa,CAAC,CAAC;IAEzE,sEAAsE;IACtE,sDAAsD;IACtD,IAAI,IAAI,CAAC,SAAS,EAAE,KAAK,IAAI,EAAE,CAAC;QAC9B,MAAM,QAAQ,GAAG;YACf,cAAc,EAAE,IAAI,CAAC,MAAM,CAAC,KAAK;YACjC,SAAS,EAAE,SAAkB;YAC7B,eAAe,EAAE,IAAI,CAAC,MAAM,CAAC,MAAM;YACnC,UAAU,EAAE,SAAkB;SAC/B,CAAC;QACF,IAAI,IAAI,CAAC,YAAY,KAAK,SAAS;YAAE,IAAI,CAAC,YAAY,GAAG,IAAI,WAAW,EAAE,CAAC;QAC3E,IAAI,CAAC,YAAY,CAAC,KAAK,CAAC,QAAQ,EAAE,gBAAgB,CAAC,IAAI,CAAC,CAAC,CAAC;IAC5D,CAAC;AACH,CAAC"}
+{"version":3,"file":"index.js","sourceRoot":"","sources":["../../src/algorithm/index.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;GAeG;AAGH,OAAO,EACL,WAAW,EACX,cAAc,EACd,WAAW,EACX,aAAa,EACb,gBAAgB,EAChB,gBAAgB,EAChB,mBAAmB,GACpB,MAAM,YAAY,CAAC;AACpB,OAAO,EAAE,cAAc,EAAE,mBAAmB,EAAE,MAAM,gBAAgB,CAAC;AACrE,OAAO,EAAE,WAAW,EAAE,MAAM,YAAY,CAAC;AACzC,OAAO,EAAoB,eAAe,EAAE,MAAM,uBAAuB,CAAC;AAI1E,MAAM,YAAY,GAAG,OAAO,CAAC,GAAG,CAAC,2BAA2B,KAAK,GAAG,CAAC;AAUrE,sEAAsE;AACtE,IAAI,QAAQ,GAA0B,IAAI,CAAC;AAE3C;;;;GAIG;AACH,MAAM,UAAU,iBAAiB,CAAC,QAA+B;IAC/D,QAAQ,GAAG,QAAQ,CAAC;AACtB,CAAC;AAED;;;;;GAKG;AACH,MAAM,aAAa,GAAG,IAAI,OAAO,EAAkC,CAAC;AAEpE;;;;;;GAMG;AACH,MAAM,SAAS,GAAG,IAAI,OAAO,EAA6B,CAAC;AAE3D;;;;;GAKG;AACH,MAAM,UAAU,cAAc,CAAC,IAAU;IACvC,OAAO,SAAS,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;AAC7B,CAAC;AAED,MAAM,UAAU,eAAe,CAC7B,IAAU,EACV,cAAkC,EAClC,eAAmC;IAEnC,IAAI,CAAC,YAAY,EAAE,CAAC;QAClB,8DAA8D;QAC9D,mEAAmE;QACnE,yDAAyD;QACzD,mEAAmE;QACnE,yDAAyD;QACzD,EAAE;QACF,gEAAgE;QAChE,2DAA2D;QAC3D,IAAI,MAAM,GAA2B,IAAI,CAAC;QAC1C,kEAAkE;QAClE,8DAA8D;QAC9D,kEAAkE;QAClE,uDAAuD;QACvD,MAAM,MAAM,GAAG,aAAa,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;QACvC,IAAI,MAAM,KAAK,SAAS,EAAE,CAAC;YACzB,mBAAmB,CAAC,IAAI,EAAE,cAAc,EAAE,eAAe,CAAC,CAAC;YAC3D,aAAa,CAAC,GAAG,CAAC,IAAI,EAAE,MAAM,CAAC,CAAC;QAClC,CAAC;aAAM,CAAC;YACN,MAAM,GAAG,MAAM,KAAK,MAAM,CAAC,CAAC,CAAC,IAAI,eAAe,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC;YAChE,IAAI,MAAM,KAAK,MAAM;gBAAE,aAAa,CAAC,GAAG,CAAC,IAAI,EAAE,MAAM,CAAC,CAAC;YACvD,MAAM,CAAC,MAAM,CAAC,cAAc,EAAE,eAAe,CAAC,CAAC;QACjD,CAAC;QACD,kEAAkE;QAClE,kEAAkE;QAClE,+CAA+C;QAC/C,SAAS,CAAC,GAAG,CAAC,IAAI,EAAE,MAAM,KAAK,IAAI,CAAC,CAAC,CAAC,MAAM,CAAC,SAAU,CAAC,IAAI,CAAC,CAAC,CAAC,YAAY,CAAC,CAAC;QAC7E,IAAI,QAAQ,KAAK,IAAI,EAAE,CAAC;YACtB,QAAQ,CACN,IAAI,EACJ,MAAM,KAAK,IAAI;gBACb,CAAC,CAAC,MAAM,CAAC,SAAU;gBACnB,CAAC,CAAC;oBACE,IAAI,EAAE,YAAY;oBAClB,UAAU,EAAE,CAAC;oBACb,gBAAgB,EAAE,CAAC;oBACnB,aAAa,EAAE,CAAC;oBAChB,aAAa,EAAE,CAAC;iBACjB,CACN,CAAC;QACJ,CAAC;QACD,OAAO;IACT,CAAC;IAED,oCAAoC;IACpC,mBAAmB,CAAC,IAAI,EAAE,cAAc,EAAE,eAAe,CAAC,CAAC;IAC3D,MAAM,cAAc,GAAG,mBAAmB,CAAC,IAAI,CAAC,CAAC;IAEjD,uDAAuD;IACvD,cAAc,CAAC,IAAI,CAAC,CAAC;IACrB,aAAa,CAAC,IAAI,CAAC,CAAC;IACpB,mBAAmB,CAAC,IAAI,EAAE,cAAc,EAAE,eAAe,CAAC,CAAC;IAC3D,MAAM,YAAY,GAAG,mBAAmB,CAAC,IAAI,CAAC,CAAC;IAE/C,MAAM,IAAI,GAAG,WAAW,CAAC,cAAc,EAAE,YAAY,CAAC,CAAC;IACvD,IAAI,IAAI,KAAK,EAAE,EAAE,CAAC;QAChB,MAAM,IAAI,KAAK,CACb,0FAA0F,IAAI,EAAE,CACjG,CAAC;IACJ,CAAC;AACH,CAAC;AAED;;;;;;;GAOG;AACH,MAAM,UAAU,yBAAyB,CACvC,IAAU,EACV,cAAuB,EACvB,eAAwB;IAExB,mBAAmB,CAAC,IAAI,EAAE,cAAc,EAAE,eAAe,CAAC,CAAC;AAC7D,CAAC;AAED,SAAS,mBAAmB,CAC1B,IAAU,EACV,cAAkC,EAClC,eAAmC;IAEnC,MAAM,SAAS,GAAG,cAAc,KAAK,SAAS,CAAC,CAAC,CAAE,WAAqB,CAAC,CAAC,CAAE,SAAmB,CAAC;IAC/F,MAAM,UAAU,GAAG,eAAe,KAAK,SAAS,CAAC,CAAC,CAAE,WAAqB,CAAC,CAAC,CAAE,SAAmB,CAAC;IACjG,MAAM,EAAE,GAAG,cAAc,IAAI,MAAM,CAAC,iBAAiB,CAAC;IACtD,MAAM,EAAE,GAAG,eAAe,IAAI,MAAM,CAAC,iBAAiB,CAAC;IACvD,MAAM,GAAG,GAAG;QACV,cAAc,EAAE,EAAE;QAClB,SAAS;QACT,eAAe,EAAE,EAAE;QACnB,UAAU;KACX,CAAC;IAEF,mDAAmD;IACnD,IAAI,CAAC,IAAI,CAAC,OAAO,EAAE,IAAI,IAAI,CAAC,YAAY,KAAK,SAAS,EAAE,CAAC;QACvD,MAAM,GAAG,GAAG,IAAI,CAAC,YAAY,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC;QAC1C,IAAI,GAAG,KAAK,SAAS,EAAE,CAAC;YACtB,IAAI,CAAC,OAAO,CAAC,IAAI,GAAG,CAAC,CAAC;YACtB,IAAI,CAAC,OAAO,CAAC,GAAG,GAAG,CAAC,CAAC;YACrB,IAAI,CAAC,UAAU,GAAG,CAAC,CAAC;YACpB,IAAI,CAAC,SAAS,GAAG,CAAC,CAAC;YACnB,gBAAgB,CAAC,IAAI,EAAE,GAAG,CAAC,CAAC;YAC5B,kEAAkE;YAClE,uEAAuE;YACvE,qEAAqE;YACrE,uEAAuE;YACvE,uEAAuE;YACvE,EAAE;YACF,kEAAkE;YAClE,2CAA2C;YAC3C,6CAA6C;YAC7C,qEAAqE;YACrE,qEAAqE;YACrE,sEAAsE;YACtE,iEAAiE;YACjE,oDAAoD;YACpD,uEAAuE;YACvE,+DAA+D;YAC/D,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,aAAa,EAAE,EAAE,CAAC,EAAE,EAAE,CAAC;gBAC9C,MAAM,CAAC,GAAG,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAE,CAAC;gBAC5B,IAAI,CAAC,CAAC,KAAK,CAAC,OAAO,KAAK,MAAM;oBAAE,SAAS;gBACzC,IAAI,CAAC,CAAC,CAAC,OAAO,EAAE,IAAI,CAAC,CAAC,CAAC,mBAAmB;oBAAE,SAAS;gBACrD,yEAAyE;gBACzE,qEAAqE;gBACrE,6CAA6C;gBAC7C,cAAc,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC;YAC1B,CAAC;YACD,SAAS,CAAC,IAAI,CAAC,CAAC;YAChB,OAAO;QACT,CAAC;IACH,CAAC;IAED,YAAY;IACZ,IAAI,CAAC,OAAO,CAAC,IAAI,GAAG,CAAC,CAAC;IACtB,IAAI,CAAC,OAAO,CAAC,GAAG,GAAG,CAAC,CAAC;IACrB,IAAI,CAAC,UAAU,GAAG,CAAC,CAAC;IACpB,IAAI,CAAC,SAAS,GAAG,CAAC,CAAC;IACnB,IAAI,CAAC,OAAO,CAAC,KAAK,GAAG,mBAAmB,CAAC,IAAI,EAAE,KAAK,EAAE,cAAc,CAAC,CAAC;IACtE,IAAI,CAAC,OAAO,CAAC,MAAM,GAAG,mBAAmB,CAAC,IAAI,EAAE,QAAQ,EAAE,eAAe,CAAC,CAAC;IAE3E,cAAc,CAAC,IAAI,CAAC,CAAC;IACrB,WAAW,CAAC,IAAI,CAAC,CAAC;IAClB,kBAAkB,CAAC,IAAI,CAAC,CAAC;IACzB,SAAS,CAAC,IAAI,CAAC,CAAC;IAEhB,2EAA2E;IAC3E,IAAI,IAAI,CAAC,YAAY,KAAK,SAAS;QAAE,IAAI,CAAC,YAAY,GAAG,IAAI,WAAW,EAAE,CAAC;IAC3E,IAAI,CAAC,YAAY,CAAC,KAAK,CAAC,GAAG,EAAE,gBAAgB,CAAC,IAAI,CAAC,CAAC,CAAC;AACvD,CAAC;AAED,SAAS,SAAS,CAAC,IAAU;IAC3B,IAAI,CAAC,UAAU,EAAE,CAAC;IAClB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,aAAa,EAAE,EAAE,CAAC,EAAE;QAAE,SAAS,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAE,CAAC,CAAC;AAC9E,CAAC;AAED;;;;;;;;;;;GAWG;AACH,SAAS,kBAAkB,CAAC,IAAU;IACpC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,aAAa,EAAE,EAAE,CAAC,EAAE;QAAE,kBAAkB,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAE,CAAC,CAAC;IAErF,IAAI,YAAY,GAAG,CAAC,CAAC;IACrB,IAAI,aAAa,GAAG,CAAC,CAAC;IACtB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,aAAa,EAAE,EAAE,CAAC,EAAE,EAAE,CAAC;QAC9C,MAAM,CAAC,GAAG,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAE,CAAC;QAC5B,MAAM,EAAE,GAAG,CAAC,CAAC,OAAO,CAAC;QACrB,YAAY,GAAG,IAAI,CAAC,GAAG,CAAC,YAAY,EAAE,EAAE,CAAC,IAAI,GAAG,EAAE,CAAC,KAAK,CAAC,CAAC;QAC1D,aAAa,GAAG,IAAI,CAAC,GAAG,CAAC,aAAa,EAAE,EAAE,CAAC,GAAG,GAAG,EAAE,CAAC,MAAM,CAAC,CAAC;IAC9D,CAAC;IACD,IAAI,CAAC,OAAO,CAAC,WAAW,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,OAAO,CAAC,KAAK,EAAE,YAAY,CAAC,CAAC;IACtE,IAAI,CAAC,OAAO,CAAC,YAAY,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,OAAO,CAAC,MAAM,EAAE,aAAa,CAAC,CAAC;IAEzE,sEAAsE;IACtE,sDAAsD;IACtD,IAAI,IAAI,CAAC,SAAS,EAAE,KAAK,IAAI,EAAE,CAAC;QAC9B,MAAM,QAAQ,GAAG;YACf,cAAc,EAAE,IAAI,CAAC,MAAM,CAAC,KAAK;YACjC,SAAS,EAAE,SAAkB;YAC7B,eAAe,EAAE,IAAI,CAAC,MAAM,CAAC,MAAM;YACnC,UAAU,EAAE,SAAkB;SAC/B,CAAC;QACF,IAAI,IAAI,CAAC,YAAY,KAAK,SAAS;YAAE,IAAI,CAAC,YAAY,GAAG,IAAI,WAAW,EAAE,CAAC;QAC3E,IAAI,CAAC,YAAY,CAAC,KAAK,CAAC,QAAQ,EAAE,gBAAgB,CAAC,IAAI,CAAC,CAAC,CAAC;IAC5D,CAAC;AACH,CAAC"}

package/dist/algorithm/round.d.ts

@@ -34,4 +34,17 @@ export declare function roundLayout(root: Node): void;
  * @internal
  */
 export declare function roundLayoutSubtree(node: Node, parentAbsX: number, parentAbsY: number): void;
+/**
+ * Round a subtree INCLUSIVE of `node`, given the float and rounded
+ * absolute positions of `node`'s parent. Used by the Spineless
+ * incremental relayout path: when only a subtree's float layout
+ * moved, its parent's rounding is unchanged, so the subtree can be
+ * re-rounded in isolation against the parent's stable corner.
+ *
+ * `node`'s `_layout` (and its descendants') must hold the FLOAT
+ * layout, exactly as after a `layoutChildren` pass.
+ *
+ * @internal
+ */
+export declare function roundLayoutFrom(node: Node, parentAbsX: number, parentAbsY: number, parentRoundedX: number, parentRoundedY: number): void;
 //# sourceMappingURL=round.d.ts.map

package/dist/algorithm/round.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"round.d.ts","sourceRoot":"","sources":["../../src/algorithm/round.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;GAgBG;AAEH,OAAO,KAAK,EAAE,IAAI,EAAE,MAAM,YAAY,CAAC;AASvC,wBAAgB,WAAW,CAAC,IAAI,EAAE,IAAI,GAAG,IAAI,CAI5C;AAED;;;;;;;;;;;;;;;GAeG;AACH,wBAAgB,kBAAkB,CAAC,IAAI,EAAE,IAAI,EAAE,UAAU,EAAE,MAAM,EAAE,UAAU,EAAE,MAAM,GAAG,IAAI,CAqB3F"}
+{"version":3,"file":"round.d.ts","sourceRoot":"","sources":["../../src/algorithm/round.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;GAgBG;AAEH,OAAO,KAAK,EAAE,IAAI,EAAE,MAAM,YAAY,CAAC;AASvC,wBAAgB,WAAW,CAAC,IAAI,EAAE,IAAI,GAAG,IAAI,CAI5C;AAED;;;;;;;;;;;;;;;GAeG;AACH,wBAAgB,kBAAkB,CAAC,IAAI,EAAE,IAAI,EAAE,UAAU,EAAE,MAAM,EAAE,UAAU,EAAE,MAAM,GAAG,IAAI,CAqB3F;AAED;;;;;;;;;;;GAWG;AACH,wBAAgB,eAAe,CAC7B,IAAI,EAAE,IAAI,EACV,UAAU,EAAE,MAAM,EAClB,UAAU,EAAE,MAAM,EAClB,cAAc,EAAE,MAAM,EACtB,cAAc,EAAE,MAAM,GACrB,IAAI,CAIN"}

package/dist/algorithm/round.js

@@ -58,6 +58,23 @@ export function roundLayoutSubtree(node, parentAbsX, parentAbsY) {
         applyRounding(node.getChild(i), absolutes, roundedNodeX, roundedNodeY);
     }
 }
+/**
+ * Round a subtree INCLUSIVE of `node`, given the float and rounded
+ * absolute positions of `node`'s parent. Used by the Spineless
+ * incremental relayout path: when only a subtree's float layout
+ * moved, its parent's rounding is unchanged, so the subtree can be
+ * re-rounded in isolation against the parent's stable corner.
+ *
+ * `node`'s `_layout` (and its descendants') must hold the FLOAT
+ * layout, exactly as after a `layoutChildren` pass.
+ *
+ * @internal
+ */
+export function roundLayoutFrom(node, parentAbsX, parentAbsY, parentRoundedX, parentRoundedY) {
+    const absolutes = new Map();
+    collectAbsolutes(node, parentAbsX, parentAbsY, absolutes);
+    applyRounding(node, absolutes, parentRoundedX, parentRoundedY);
+}
 function collectAbsolutes(node, parentX, parentY, out) {
     const x = parentX + node.layout.left;
     const y = parentY + node.layout.top;

package/dist/algorithm/round.js.map

@@ -1 +1 @@
-{"version":3,"file":"round.js","sourceRoot":"","sources":["../../src/algorithm/round.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;GAgBG;AAWH,MAAM,UAAU,WAAW,CAAC,IAAU;IACpC,MAAM,SAAS,GAAG,IAAI,GAAG,EAAmB,CAAC;IAC7C,gBAAgB,CAAC,IAAI,EAAE,CAAC,EAAE,CAAC,EAAE,SAAS,CAAC,CAAC;IACxC,aAAa,CAAC,IAAI,EAAE,SAAS,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;AACvC,CAAC;AAED;;;;;;;;;;;;;;;GAeG;AACH,MAAM,UAAU,kBAAkB,CAAC,IAAU,EAAE,UAAkB,EAAE,UAAkB;IACnF,4EAA4E;IAC5E,8EAA8E;IAC9E,0EAA0E;IAC1E,6EAA6E;IAC7E,8EAA8E;IAC9E,mFAAmF;IACnF,MAAM,QAAQ,GAAG,UAAU,GAAG,IAAI,CAAC,UAAU,CAAC;IAC9C,MAAM,QAAQ,GAAG,UAAU,GAAG,IAAI,CAAC,SAAS,CAAC;IAC7C,MAAM,SAAS,GAAG,IAAI,GAAG,EAAmB,CAAC;IAC7C,2DAA2D;IAC3D,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,aAAa,EAAE,EAAE,CAAC,EAAE,EAAE,CAAC;QAC9C,gBAAgB,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAE,EAAE,QAAQ,EAAE,QAAQ,EAAE,SAAS,CAAC,CAAC;IACrE,CAAC;IACD,6DAA6D;IAC7D,sEAAsE;IACtE,MAAM,YAAY,GAAG,IAAI,CAAC,KAAK,CAAC,QAAQ,CAAC,CAAC;IAC1C,MAAM,YAAY,GAAG,IAAI,CAAC,KAAK,CAAC,QAAQ,CAAC,CAAC;IAC1C,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,aAAa,EAAE,EAAE,CAAC,EAAE,EAAE,CAAC;QAC9C,aAAa,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAE,EAAE,SAAS,EAAE,YAAY,EAAE,YAAY,CAAC,CAAC;IAC1E,CAAC;AACH,CAAC;AAED,SAAS,gBAAgB,CACvB,IAAU,EACV,OAAe,EACf,OAAe,EACf,GAAyB;IAEzB,MAAM,CAAC,GAAG,OAAO,GAAG,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC;IACrC,MAAM,CAAC,GAAG,OAAO,GAAG,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC;IACpC,GAAG,CAAC,GAAG,CAAC,IAAI,EAAE,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,IAAI,CAAC,MAAM,CAAC,KAAK,EAAE,CAAC,EAAE,IAAI,CAAC,MAAM,CAAC,MAAM,EAAE,CAAC,CAAC;IACrE,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,aAAa,EAAE,EAAE,CAAC,EAAE,EAAE,CAAC;QAC9C,gBAAgB,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAE,EAAE,CAAC,EAAE,CAAC,EAAE,GAAG,CAAC,CAAC;IACjD,CAAC;AACH,CAAC;AAED,SAAS,aAAa,CACpB,IAAU,EACV,GAAyB,EACzB,cAAsB,EACtB,cAAsB;IAEtB,MAAM,EAAE,GAAG,GAAG,CAAC,GAAG,CAAC,IAAI,CAAE,CAAC;IAC1B,MAAM,QAAQ,GAAG,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;IAClC,MAAM,QAAQ,GAAG,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;IAClC,MAAM,QAAQ,GAAG,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC,CAAC;IACzC,MAAM,QAAQ,GAAG,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC,CAAC;IAEzC,IAAI,CAAC,OAAO,CAAC,IAAI,GAAG,QAAQ,GAAG,cAAc,CAAC;IAC9C,IAAI,CAAC,OAAO,CAAC,GAAG,GAAG,QAAQ,GAAG,cAAc,CAAC;IAC7C,IAAI,CAAC,OAAO,CAAC,KAAK,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,QAAQ,GAAG,QAAQ,CAAC,CAAC;IACtD,IAAI,CAAC,OAAO,CAAC,MAAM,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,QAAQ,GAAG,QAAQ,CAAC,CAAC;IAEvD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,aAAa,EAAE,EAAE,CAAC,EAAE,EAAE,CAAC;QAC9C,aAAa,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAE,EAAE,GAAG,EAAE,QAAQ,EAAE,QAAQ,CAAC,CAAC;IAC5D,CAAC;AACH,CAAC"}
+{"version":3,"file":"round.js","sourceRoot":"","sources":["../../src/algorithm/round.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;GAgBG;AAWH,MAAM,UAAU,WAAW,CAAC,IAAU;IACpC,MAAM,SAAS,GAAG,IAAI,GAAG,EAAmB,CAAC;IAC7C,gBAAgB,CAAC,IAAI,EAAE,CAAC,EAAE,CAAC,EAAE,SAAS,CAAC,CAAC;IACxC,aAAa,CAAC,IAAI,EAAE,SAAS,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;AACvC,CAAC;AAED;;;;;;;;;;;;;;;GAeG;AACH,MAAM,UAAU,kBAAkB,CAAC,IAAU,EAAE,UAAkB,EAAE,UAAkB;IACnF,4EAA4E;IAC5E,8EAA8E;IAC9E,0EAA0E;IAC1E,6EAA6E;IAC7E,8EAA8E;IAC9E,mFAAmF;IACnF,MAAM,QAAQ,GAAG,UAAU,GAAG,IAAI,CAAC,UAAU,CAAC;IAC9C,MAAM,QAAQ,GAAG,UAAU,GAAG,IAAI,CAAC,SAAS,CAAC;IAC7C,MAAM,SAAS,GAAG,IAAI,GAAG,EAAmB,CAAC;IAC7C,2DAA2D;IAC3D,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,aAAa,EAAE,EAAE,CAAC,EAAE,EAAE,CAAC;QAC9C,gBAAgB,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAE,EAAE,QAAQ,EAAE,QAAQ,EAAE,SAAS,CAAC,CAAC;IACrE,CAAC;IACD,6DAA6D;IAC7D,sEAAsE;IACtE,MAAM,YAAY,GAAG,IAAI,CAAC,KAAK,CAAC,QAAQ,CAAC,CAAC;IAC1C,MAAM,YAAY,GAAG,IAAI,CAAC,KAAK,CAAC,QAAQ,CAAC,CAAC;IAC1C,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,aAAa,EAAE,EAAE,CAAC,EAAE,EAAE,CAAC;QAC9C,aAAa,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAE,EAAE,SAAS,EAAE,YAAY,EAAE,YAAY,CAAC,CAAC;IAC1E,CAAC;AACH,CAAC;AAED;;;;;;;;;;;GAWG;AACH,MAAM,UAAU,eAAe,CAC7B,IAAU,EACV,UAAkB,EAClB,UAAkB,EAClB,cAAsB,EACtB,cAAsB;IAEtB,MAAM,SAAS,GAAG,IAAI,GAAG,EAAmB,CAAC;IAC7C,gBAAgB,CAAC,IAAI,EAAE,UAAU,EAAE,UAAU,EAAE,SAAS,CAAC,CAAC;IAC1D,aAAa,CAAC,IAAI,EAAE,SAAS,EAAE,cAAc,EAAE,cAAc,CAAC,CAAC;AACjE,CAAC;AAED,SAAS,gBAAgB,CACvB,IAAU,EACV,OAAe,EACf,OAAe,EACf,GAAyB;IAEzB,MAAM,CAAC,GAAG,OAAO,GAAG,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC;IACrC,MAAM,CAAC,GAAG,OAAO,GAAG,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC;IACpC,GAAG,CAAC,GAAG,CAAC,IAAI,EAAE,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,IAAI,CAAC,MAAM,CAAC,KAAK,EAAE,CAAC,EAAE,IAAI,CAAC,MAAM,CAAC,MAAM,EAAE,CAAC,CAAC;IACrE,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,aAAa,EAAE,EAAE,CAAC,EAAE,EAAE,CAAC;QAC9C,gBAAgB,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAE,EAAE,CAAC,EAAE,CAAC,EAAE,GAAG,CAAC,CAAC;IACjD,CAAC;AACH,CAAC;AAED,SAAS,aAAa,CACpB,IAAU,EACV,GAAyB,EACzB,cAAsB,EACtB,cAAsB;IAEtB,MAAM,EAAE,GAAG,GAAG,CAAC,GAAG,CAAC,IAAI,CAAE,CAAC;IAC1B,MAAM,QAAQ,GAAG,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;IAClC,MAAM,QAAQ,GAAG,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;IAClC,MAAM,QAAQ,GAAG,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC,CAAC;IACzC,MAAM,QAAQ,GAAG,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC,CAAC;IAEzC,IAAI,CAAC,OAAO,CAAC,IAAI,GAAG,QAAQ,GAAG,cAAc,CAAC;IAC9C,IAAI,CAAC,OAAO,CAAC,GAAG,GAAG,QAAQ,GAAG,cAAc,CAAC;IAC7C,IAAI,CAAC,OAAO,CAAC,KAAK,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,QAAQ,GAAG,QAAQ,CAAC,CAAC;IACtD,IAAI,CAAC,OAAO,CAAC,MAAM,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,QAAQ,GAAG,QAAQ,CAAC,CAAC;IAEvD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,aAAa,EAAE,EAAE,CAAC,EAAE,EAAE,CAAC;QAC9C,aAAa,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAE,EAAE,GAAG,EAAE,QAAQ,EAAE,QAAQ,CAAC,CAAC;IAC5D,CAAC;AACH,CAAC"}

package/dist/algorithm/spineless/flex-grammar.d.ts

@@ -0,0 +1,394 @@
+/**
+ * Flexbox layout expressed as an attribute grammar.
+ *
+ * Current slice (v16b) covers:
+ *
+ *   - flex-direction: `row`, `column`, `row-reverse`, `column-reverse`
+ *   - flex-grow / flex-shrink / flex-basis (v3-v4)
+ *   - padding / margin / gap (v5)
+ *   - justify-content + align-items / align-self (v6)
+ *   - flex-wrap (v7) — single-line wrap and multi-line packing,
+ *     each line independently distributed / justified / aligned
+ *   - positionType: `'absolute'` (v8) — out-of-flow children
+ *     positioned against the parent's OUTER box via `style.position`
+ *     and `style.margin`. Width / height resolve from explicit
+ *     style, from opposing edges (`left`+`right` or `top`+`bottom`),
+ *     or fall back to 0. Absolute children are filtered out of every
+ *     in-flow computation (flex distribution, justify leftover,
+ *     wrap line packing).
+ *   - align-content (v9) — for multi-line wrap containers, the cross-
+ *     axis leftover is distributed among / around the lines per
+ *     `flex-start` / `flex-end` / `center` / `space-between` /
+ *     `space-around` / `stretch`
+ *   - flex-wrap: `wrap-reverse` (v10) — the line stack is mirrored
+ *     on the cross axis
+ *   - flex-direction: `row-reverse` / `column-reverse` (v11) — the
+ *     main axis runs from the container's main END; each in-flow
+ *     child's main position is reflected across the inner-main box,
+ *     mirroring the imperative `flipMainAxis`
+ *   - min / max size clamping (v12) — every node's main size, cross
+ *     size, and an absolute child's width / height are clamped to
+ *     the node's own `[minWidth/Height, maxWidth/Height]`. v12a
+ *     covered the single-shot sites (non-distributed main size,
+ *     cross size, absolute children); v12b folds min/max into the
+ *     flex-distribution freeze loop and the wrap line packer — an
+ *     item whose proportional grow / shrink target breaches a clamp
+ *     is frozen at its bound and its share redistributed, iterating
+ *     to a fixpoint, exactly as the imperative `distributeGrow` /
+ *     `distributeShrink`.
+ *   - `'auto'` main size (v13) — a non-measured `'auto'` main-axis
+ *     size resolves to 0 (mirroring `resolveHypotheticalMainSize`);
+ *     the root's `'auto'` axis resolves from the caller-supplied
+ *     `available` size, modelled as a root input Field so a terminal
+ *     resize is incremental.
+ *   - `'auto'` cross size + `align-items: stretch` (v14) — an
+ *     `'auto'` cross-axis size is 0 under a non-stretch align, but
+ *     `stretch` (the default) resizes it to fill the line's inner
+ *     cross, mirroring the imperative `crossAlignItemsInLine`
+ *     stretch branch.
+ *   - `aspectRatio` (v15) — an `'auto'` axis whose perpendicular
+ *     axis is an explicit number derives `width = height × ratio` /
+ *     `height = width ÷ ratio`, mirroring `effectivePreferredSize`.
+ *     A derived axis is definite (not content-sized) — so it is not
+ *     stretched.
+ *   - measure-func leaves (v16) — a childless node with a measure
+ *     function resolves its `'auto'` axes by calling the measurer.
+ *     v16a covers the MAIN axis (main free, cross constrained,
+ *     mirroring `resolveHypotheticalMainSize`); v16b the CROSS axis
+ *     (cross constrained `AtMost` the parent inner cross, main free
+ *     with a hint, mirroring `naturalCrossSize`). A measured cross
+ *     feeds the wrap line cross-size aggregation and the non-stretch
+ *     cross size; `align-items: stretch` still overrides it.
+ *
+ * With v16 the grammar covers the full imperative `'auto'` /
+ * measure / `aspectRatio` resolution: the Spineless engine is a
+ * drop-in for `calculateLayout` on real content-sized trees.
+ *
+ * Fields emitted per node:
+ *
+ *   - `width`  — main-axis size when parent is `row`, cross-axis size
+ *                when parent is `column`. Cross axis reads
+ *                `style.width` verbatim. Main axis is the result of
+ *                flex distribution when the parent has any child with
+ *                grow > 0, shrink > 0, or numeric `flexBasis`;
+ *                otherwise it equals the basis.
+ *   - `height` — symmetric to `width`.
+ *   - `left`   — position relative to parent. For row-parent children
+ *                this is the main-axis cursor: `padLeft + myMarginLeft
+ *                + sum_priors(marginLeft + width + marginRight) +
+ *                i*gapColumn`. For column-parent children it's the
+ *                cross-axis position: `padLeft + myMarginLeft`. Root
+ *                is at 0.
+ *   - `top`    — symmetric to `left`.
+ *
+ * @internal
+ */
+import type { Node } from '../../node.js';
+import { type Field, type FieldRule, type Grammar } from './grammar.js';
+/**
+ * Per-node input Fields for the style props the grammar reads. Each
+ * is present only if the grammar actually reads that prop for the
+ * node — every in-flow node has all three sizes; a container that
+ * lays children out along an axis has the matching `gap*`; an
+ * absolute child has `width` / `height` only when its size is
+ * explicit.
+ *
+ * @internal
+ */
+export interface StyleInputs {
+    width?: Field<number>;
+    height?: Field<number>;
+    flexBasis?: Field<number>;
+    flexGrow?: Field<number>;
+    flexShrink?: Field<number>;
+    gapRow?: Field<number>;
+    gapColumn?: Field<number>;
+    /**
+     * Min / max size clamps. `min*` default to 0; `max*` carry
+     * `Infinity` when `style.max{Width,Height}` is `undefined` ("no
+     * upper bound"), so a single `clampMinMax` covers both.
+     */
+    minWidth?: Field<number>;
+    minHeight?: Field<number>;
+    maxWidth?: Field<number>;
+    maxHeight?: Field<number>;
+    /**
+     * Per-edge `padding` input Fields, indexed `[top, right, bottom,
+     * left]`. Entries are present only for edges the grammar reads
+     * (a container reads all four of its own padding edges).
+     */
+    padding?: Array<Field<number> | undefined>;
+    /**
+     * Per-edge `margin` input Fields, indexed `[top, right, bottom,
+     * left]`. Present for every non-root in-flow node and every
+     * absolute child (the grammar reads all four edges).
+     */
+    margin?: Array<Field<number> | undefined>;
+}
+/**
+ * Roots used by `buildFlexGrammar` to identify which (Node, name) pair
+ * is the canonical entry point. The Spineless runtime / interpreter
+ * starts evaluation from this set of fields and walks deps.
+ *
+ * @internal
+ */
+export interface FlexGrammarOutput {
+    grammar: Grammar;
+    /** Fields the caller typically wants computed on the root. */
+    rootFields: {
+        width: Field<number>;
+        height: Field<number>;
+        left: Field<number>;
+        top: Field<number>;
+    };
+    /** All emitted fields, in pre-order. Useful for differential tests. */
+    allFields: Array<{
+        node: Node;
+        width: Field<number>;
+        height: Field<number>;
+        left: Field<number>;
+        top: Field<number>;
+    }>;
+    /**
+     * Per-node input Fields for the style props the grammar models as
+     * graph inputs — currently the SIZE props (`width` / `height` /
+     * `flexBasis`), `gap` (`gapRow` / `gapColumn`), `padding` and
+     * `margin` (per-edge). Each is a leaf field whose value is the live
+     * `node.style` value; every layout field that reads one declares
+     * the matching input as a dependency. To drive a precise
+     * incremental relayout after a `setWidth` / `setHeight` /
+     * `setFlexBasis` / `setFlexGrow` / `setFlexShrink` / `setGap` /
+     * `setPadding` / `setMargin`, `markDirty` the input Field for the
+     * mutated `(node, prop)` and call `recompute()` — propagation then
+     * reaches exactly the affected layout fields, with no
+     * `markAllDirty`.
+     *
+     * Every numeric style prop the grammar reads is now an input
+     * field. What still needs a fresh `buildFlexGrammar()` is
+     * STRUCTURAL mutation — flex-direction, flex-wrap on/off, the
+     * justify / align category, `positionType`, and toggling a flex
+     * weight or `flexBasis` across the zero / numeric boundary (which
+     * flips whether the parent flex-distributes).
+     */
+    styleInputs: Map<Node, StyleInputs>;
+    /**
+     * Input Fields for the root's caller-supplied `available` size,
+     * present only for an axis where the root's style is `'auto'`
+     * (v13). `markDirty` one and `recompute()` to re-lay the tree
+     * after a terminal resize.
+     */
+    availableInputs: {
+        width?: Field<number>;
+        height?: Field<number>;
+    };
+    /**
+     * Per-parent intermediate Fields for the phase-12 flex-distribution
+     * grammar. Keyed by each flex-distributing single-line parent; value
+     * is the `mainDistribution` Field emitted for that parent. Fragment
+     * builders (append / remove / reorder) consult this to perform
+     * precise rebinds without a full grammar rebuild.
+     */
+    mainDistributionByParent: Map<Node, Field<MainAxisDistribution>>;
+}
+/** Caller-supplied availability for an `'auto'`-sized root. */
+export interface AvailableSize {
+    width?: number;
+    height?: number;
+}
+/**
+ * Walk the tree rooted at `root` and emit a `Grammar` that computes
+ * each node's `{width, height, left, top}`. See the module header
+ * for the field rules. A whole-tree build — `boundary` is `null`.
+ *
+ * `'auto'` width / height are supported (v13): a non-measured
+ * `'auto'` axis resolves to 0; the root's `'auto'` axis resolves
+ * from `available` (matching `calculateLayout`'s availability args).
+ *
+ * @internal
+ */
+export declare function buildFlexGrammar(root: Node, available?: AvailableSize): FlexGrammarOutput;
+/**
+ * The patch inputs for a fast-pathed child append — see
+ * `buildAppendFragment`.
+ *
+ * @internal
+ */
+export interface AppendFragment {
+    /** Rules for the newly-added subtree's fields, for `graft`. */
+    additions: Grammar;
+    /** The new fields to start `SpinelessRuntime.graft`'s DFS from. */
+    newRoots: Array<Field<unknown>>;
+    /**
+     * Existing fields whose rule the append rewrote, paired with the
+     * new rule — for `SpinelessRuntime.rebindRule`. Empty for a
+     * simple-regime append (`graft` alone suffices); non-empty when
+     * the parent flex-distributes / justifies / wraps, where appending
+     * a child also grows every existing sibling's dependency set.
+     * Apply these AFTER `graft` (the new rules reference the grafted
+     * fields), then call `recompute()`.
+     */
+    rebinds: Array<[Field<unknown>, FieldRule<unknown>]>;
+    /**
+     * A fresh full `FlexGrammarOutput` for the post-append tree. The
+     * caller should adopt it for subsequent operations — its
+     * `allFields` / `styleInputs` cover the new subtree (the runtime's
+     * own grammar is patched in place by `graft` + `rebindRule`).
+     */
+    next: FlexGrammarOutput;
+}
+/**
+ * Fast-path a child INSERT for the Spineless runtime. If adding
+ * `child` under `parent` can be absorbed without a fresh runtime,
+ * return the patch inputs; return `null` when a full rebuild is
+ * required — `child` is not a child of `parent`, or `parent` uses a
+ * reverse `flex-direction` (supported by the grammar since v11, but
+ * not by this structural fast-path — reflecting every sibling's
+ * position is a whole-subtree rewrite).
+ *
+ * The new subtree's fields are always topological-tail additions
+ * handled by `graft` (`additions` / `newRoots`). When `parent` is in
+ * the "simple" regime (no flex distribution, default `flex-start`
+ * justify, no wrap) AND `child` is its LAST child — or `child` is
+ * absolute — that is the whole patch and `rebinds` is empty, and the
+ * fragment is built in **O(subtree)**: `makeEmitter` emits just the
+ * appended subtree against the runtime's grammar as a boundary, no
+ * whole-tree rebuild. Otherwise the insert also rewrites existing
+ * in-flow siblings' rules — a flex-distributing / justified /
+ * wrapping parent reads every sibling, and a MID-LIST insert (v32)
+ * shifts every later in-flow sibling's main position — so the
+ * grammar is rebuilt O(tree) and `rebinds` carries those siblings'
+ * rewritten rules.
+ *
+ * `next.grammar` is always `prev.grammar` — the runtime's own Map,
+ * which `graft` / `rebindRule` patch in place; `next.allFields` /
+ * `next.styleInputs` are refreshed lookup tables the caller adopts.
+ *
+ * @internal
+ */
+export declare function buildAppendFragment(prev: FlexGrammarOutput, root: Node, parent: Node, child: Node, available?: AvailableSize): AppendFragment | null;
+/**
+ * The patch inputs for a fast-pathed child removal — see
+ * `buildRemoveFragment`.
+ *
+ * @internal
+ */
+export interface RemoveFragment {
+    /**
+     * Every field belonging to the removed subtree, for
+     * `SpinelessRuntime.detach`. Apply this AFTER the `rebinds` — a
+     * surviving sibling rebound off the removed child must drop its
+     * dependency on the child's fields before they can be detached.
+     */
+    removed: Array<Field<unknown>>;
+    /**
+     * Existing fields whose rule the removal rewrote, paired with the
+     * new rule — for `SpinelessRuntime.rebindRule`. Empty when removing
+     * a last child from a simple-regime parent (`detach` alone
+     * suffices); non-empty when the parent flex-distributes /
+     * justifies / wraps, or the child is interior — where removing it
+     * shrinks every surviving sibling's dependency set.
+     */
+    rebinds: Array<[Field<unknown>, FieldRule<unknown>]>;
+    /**
+     * A fresh full `FlexGrammarOutput` for the post-removal tree. The
+     * caller adopts it for subsequent operations.
+     */
+    next: FlexGrammarOutput;
+}
+/**
+ * Fast-path a child REMOVAL for the Spineless runtime — the mirror
+ * of `buildAppendFragment`. Call this **before** detaching `child`
+ * from `parent`: the simple-regime check needs `child` still in
+ * place. Returns the patch inputs, or `null` when a full rebuild is
+ * required (`child` is not `parent`'s child, or `parent` uses a
+ * reverse `flex-direction` — supported by the grammar since v11 but
+ * not by this fast-path).
+ *
+ * In the "simple" regime (no flex distribution, default `flex-start`
+ * justify, no wrap — or `child` is absolute) the patch is built in
+ * **O(subtree)**: `removed` is collected directly from `prev` by
+ * walking the removed subtree, with no whole-tree rebuild, and
+ * `rebinds` is empty. `SpinelessRuntime.detach` then drops those
+ * fields and auto-cleans any input field they orphaned (e.g. the new
+ * last child's now-unread main-end margin). Otherwise the removal
+ * shrinks every surviving in-flow sibling's dependency set, so the
+ * grammar is rebuilt O(tree) and `rebinds` carries those siblings'
+ * rewritten rules. The caller applies `rebindRule` for each rebind
+ * FIRST (so survivors stop depending on the removed fields), then
+ * `detach`, then `recompute()`.
+ *
+ * Does not mutate the tree. `next.grammar` is `prev.grammar` — the
+ * runtime's own Map, patched in place by `detach` / `rebindRule`.
+ *
+ * @internal
+ */
+export declare function buildRemoveFragment(prev: FlexGrammarOutput, root: Node, parent: Node, child: Node, available?: AvailableSize): RemoveFragment | null;
+/**
+ * The patch inputs for a fast-pathed child reorder — see
+ * `buildReorderFragment`.
+ *
+ * @internal
+ */
+export interface ReorderFragment {
+    /**
+     * Input fields the reorder newly needs — for `SpinelessRuntime.graft`.
+     * A reorder adds no node, but it can give a node a follower (or
+     * take one away), and a node's main-END margin is read only when it
+     * has a follower. So a node that gained a follower contributes a
+     * newly-read margin input.
+     */
+    additions: Grammar;
+    /** The new fields to start `graft`'s DFS from (every addition). */
+    newRoots: Array<Field<unknown>>;
+    /**
+     * Input fields the reorder no longer needs — for
+     * `SpinelessRuntime.detach`. The mirror of `additions`: a node that
+     * lost its follower (became the last child) no longer has its
+     * main-end margin read.
+     */
+    removed: Array<Field<unknown>>;
+    /**
+     * Existing fields whose rule the reorder rewrote, paired with the
+     * new rule — for `SpinelessRuntime.rebindRule`.
+     */
+    rebinds: Array<[Field<unknown>, FieldRule<unknown>]>;
+    /** A fresh full `FlexGrammarOutput` for the reordered tree. */
+    next: FlexGrammarOutput;
+}
+/**
+ * Fast-path a child REORDER for the Spineless runtime — `parent`'s
+ * children are a permutation of their former order (no node added or
+ * removed). The grammar is rebuilt O(tree) and the patch applied to
+ * the existing runtime without a fresh `init`.
+ *
+ * Reordering `parent`'s children can only change the rules of
+ * `parent` itself (its `'auto'` / wrap content size now packs the
+ * children in a new order) and of its in-flow children (their main
+ * positions, and — under wrap — their line-dependent sizes), so the
+ * rebind set is `parent` + its in-flow children's
+ * `width / height / left / top`. Descendants and ancestors recompute
+ * from the changed VALUES; their rules are untouched.
+ *
+ * A reorder also shifts the "has a follower" boundary, so a node's
+ * main-end margin input can become newly read (`additions`) or
+ * newly unread (`removed`) — the same diff `buildAppendFragment`'s
+ * non-simple branch takes. The caller applies `graft` then
+ * `rebindRule` then `detach`.
+ *
+ * `next.grammar` is `prev.grammar` — the runtime's own Map, patched
+ * in place.
+ *
+ * @internal
+ */
+export declare function buildReorderFragment(prev: FlexGrammarOutput, root: Node, parent: Node, available?: AvailableSize): ReorderFragment;
+/**
+ * The materialised result of a flex-distributing parent's main-axis
+ * pass — sizes plus folded positions. One per qualifying parent.
+ * Cells index into this instead of redoing the distribution each.
+ * @internal
+ */
+export interface MainAxisDistribution {
+    readonly sizes: readonly number[];
+    readonly positions: readonly number[];
+}
+//# sourceMappingURL=flex-grammar.d.ts.map

package/dist/algorithm/spineless/flex-grammar.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"flex-grammar.d.ts","sourceRoot":"","sources":["../../../src/algorithm/spineless/flex-grammar.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GAoFG;AAGH,OAAO,KAAK,EAAE,IAAI,EAAE,MAAM,eAAe,CAAC;AAG1C,OAAO,EAAE,KAAK,KAAK,EAAE,KAAK,SAAS,EAAE,KAAK,OAAO,EAAsB,MAAM,cAAc,CAAC;AAE5F;;;;;;;;;GASG;AACH,MAAM,WAAW,WAAW;IAC1B,KAAK,CAAC,EAAE,KAAK,CAAC,MAAM,CAAC,CAAC;IACtB,MAAM,CAAC,EAAE,KAAK,CAAC,MAAM,CAAC,CAAC;IACvB,SAAS,CAAC,EAAE,KAAK,CAAC,MAAM,CAAC,CAAC;IAC1B,QAAQ,CAAC,EAAE,KAAK,CAAC,MAAM,CAAC,CAAC;IACzB,UAAU,CAAC,EAAE,KAAK,CAAC,MAAM,CAAC,CAAC;IAC3B,MAAM,CAAC,EAAE,KAAK,CAAC,MAAM,CAAC,CAAC;IACvB,SAAS,CAAC,EAAE,KAAK,CAAC,MAAM,CAAC,CAAC;IAC1B;;;;OAIG;IACH,QAAQ,CAAC,EAAE,KAAK,CAAC,MAAM,CAAC,CAAC;IACzB,SAAS,CAAC,EAAE,KAAK,CAAC,MAAM,CAAC,CAAC;IAC1B,QAAQ,CAAC,EAAE,KAAK,CAAC,MAAM,CAAC,CAAC;IACzB,SAAS,CAAC,EAAE,KAAK,CAAC,MAAM,CAAC,CAAC;IAC1B;;;;OAIG;IACH,OAAO,CAAC,EAAE,KAAK,CAAC,KAAK,CAAC,MAAM,CAAC,GAAG,SAAS,CAAC,CAAC;IAC3C;;;;OAIG;IACH,MAAM,CAAC,EAAE,KAAK,CAAC,KAAK,CAAC,MAAM,CAAC,GAAG,SAAS,CAAC,CAAC;CAC3C;AAED;;;;;;GAMG;AACH,MAAM,WAAW,iBAAiB;IAChC,OAAO,EAAE,OAAO,CAAC;IACjB,8DAA8D;IAC9D,UAAU,EAAE;QACV,KAAK,EAAE,KAAK,CAAC,MAAM,CAAC,CAAC;QACrB,MAAM,EAAE,KAAK,CAAC,MAAM,CAAC,CAAC;QACtB,IAAI,EAAE,KAAK,CAAC,MAAM,CAAC,CAAC;QACpB,GAAG,EAAE,KAAK,CAAC,MAAM,CAAC,CAAC;KACpB,CAAC;IACF,uEAAuE;IACvE,SAAS,EAAE,KAAK,CAAC;QACf,IAAI,EAAE,IAAI,CAAC;QACX,KAAK,EAAE,KAAK,CAAC,MAAM,CAAC,CAAC;QACrB,MAAM,EAAE,KAAK,CAAC,MAAM,CAAC,CAAC;QACtB,IAAI,EAAE,KAAK,CAAC,MAAM,CAAC,CAAC;QACpB,GAAG,EAAE,KAAK,CAAC,MAAM,CAAC,CAAC;KACpB,CAAC,CAAC;IACH;;;;;;;;;;;;;;;;;;;;OAoBG;IACH,WAAW,EAAE,GAAG,CAAC,IAAI,EAAE,WAAW,CAAC,CAAC;IACpC;;;;;OAKG;IACH,eAAe,EAAE;QAAE,KAAK,CAAC,EAAE,KAAK,CAAC,MAAM,CAAC,CAAC;QAAC,MAAM,CAAC,EAAE,KAAK,CAAC,MAAM,CAAC,CAAA;KAAE,CAAC;IACnE;;;;;;OAMG;IACH,wBAAwB,EAAE,GAAG,CAAC,IAAI,EAAE,KAAK,CAAC,oBAAoB,CAAC,CAAC,CAAC;CAClE;AAED,+DAA+D;AAC/D,MAAM,WAAW,aAAa;IAC5B,KAAK,CAAC,EAAE,MAAM,CAAC;IACf,MAAM,CAAC,EAAE,MAAM,CAAC;CACjB;AAsiCD;;;;;;;;;;GAUG;AACH,wBAAgB,gBAAgB,CAAC,IAAI,EAAE,IAAI,EAAE,SAAS,GAAE,aAAkB,GAAG,iBAAiB,CA6B7F;AAED;;;;;GAKG;AACH,MAAM,WAAW,cAAc;IAC7B,+DAA+D;IAC/D,SAAS,EAAE,OAAO,CAAC;IACnB,mEAAmE;IACnE,QAAQ,EAAE,KAAK,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC;IAChC;;;;;;;;OAQG;IACH,OAAO,EAAE,KAAK,CAAC,CAAC,KAAK,CAAC,OAAO,CAAC,EAAE,SAAS,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC;IACrD;;;;;OAKG;IACH,IAAI,EAAE,iBAAiB,CAAC;CACzB;AA4CD;;;;;;;;;;;;;;;;;;;;;;;;;;;;GA4BG;AACH,wBAAgB,mBAAmB,CACjC,IAAI,EAAE,iBAAiB,EACvB,IAAI,EAAE,IAAI,EACV,MAAM,EAAE,IAAI,EACZ,KAAK,EAAE,IAAI,EACX,SAAS,GAAE,aAAkB,GAC5B,cAAc,GAAG,IAAI,CA6HvB;AAED;;;;;GAKG;AACH,MAAM,WAAW,cAAc;IAC7B;;;;;OAKG;IACH,OAAO,EAAE,KAAK,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC;IAC/B;;;;;;;OAOG;IACH,OAAO,EAAE,KAAK,CAAC,CAAC,KAAK,CAAC,OAAO,CAAC,EAAE,SAAS,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC;IACrD;;;OAGG;IACH,IAAI,EAAE,iBAAiB,CAAC;CACzB;AAmDD;;;;;;;;;;;;;;;;;;;;;;;;;;GA0BG;AACH,wBAAgB,mBAAmB,CACjC,IAAI,EAAE,iBAAiB,EACvB,IAAI,EAAE,IAAI,EACV,MAAM,EAAE,IAAI,EACZ,KAAK,EAAE,IAAI,EACX,SAAS,GAAE,aAAkB,GAC5B,cAAc,GAAG,IAAI,CAwGvB;AAED;;;;;GAKG;AACH,MAAM,WAAW,eAAe;IAC9B;;;;;;OAMG;IACH,SAAS,EAAE,OAAO,CAAC;IACnB,mEAAmE;IACnE,QAAQ,EAAE,KAAK,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC;IAChC;;;;;OAKG;IACH,OAAO,EAAE,KAAK,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC;IAC/B;;;OAGG;IACH,OAAO,EAAE,KAAK,CAAC,CAAC,KAAK,CAAC,OAAO,CAAC,EAAE,SAAS,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC;IACrD,+DAA+D;IAC/D,IAAI,EAAE,iBAAiB,CAAC;CACzB;AAED;;;;;;;;;;;;;;;;;;;;;;;;GAwBG;AACH,wBAAgB,oBAAoB,CAClC,IAAI,EAAE,iBAAiB,EACvB,IAAI,EAAE,IAAI,EACV,MAAM,EAAE,IAAI,EACZ,SAAS,GAAE,aAAkB,GAC5B,eAAe,CA+CjB;AA4bD;;;;;GAKG;AACH,MAAM,WAAW,oBAAoB;IACnC,QAAQ,CAAC,KAAK,EAAE,SAAS,MAAM,EAAE,CAAC;IAClC,QAAQ,CAAC,SAAS,EAAE,SAAS,MAAM,EAAE,CAAC;CACvC"}