npm - @weasel-js/diagram - Versions diffs - 1.4.4 → 1.5.0 - Mend

@weasel-js/diagram 1.4.4 → 1.5.0

This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.

Files changed (4) hide show

package/dist/index.d.ts CHANGED Viewed

@@ -1,5 +1,5 @@
 import * as _weasel_js_core from '@weasel-js/core';
-import { Path, Vec2, PoseProjection, DerivedDep, SceneRegistry, ChromeState, FillStyle, Stroke, CursorSpec, Affordance, InvocationCtx, GestureBinding, Action, Contribution, RenderLayer, SimulationNode, createSimulation, EasingFn, NodeId, Scene, NodeShapeEntry } from '@weasel-js/core';
+import { Path, Vec2, PoseDescriptor, DerivedDep, SceneRegistry, ChromeState, FillStyle, Stroke, CursorSpec, Affordance, InvocationCtx, GestureBinding, Action, Contribution, RenderLayer, SimulationNode, createSimulation, EasingFn, NodeId, Scene, NodeShapeEntry } from '@weasel-js/core';
 /**
  * The shapes a built body can wear, as paths in the node's bounds.
@@ -11,7 +11,7 @@ import { Path, Vec2, PoseProjection, DerivedDep, SceneRegistry, ChromeState, Fil
  * kit's own `clipFromPose` factories are.
  */
-/** An axis-aligned box, in the shape `PoseProjection.getBounds` returns. */
+/** An axis-aligned box, in the shape `PoseDescriptor.getBounds` returns. */
 interface Bounds {
     x: number;
     y: number;
@@ -406,7 +406,7 @@ declare const DEFAULT_PORTS: readonly PortSpec[];
 interface PortsOptions<TPose> {
     /** Reads the AABB a port is placed in, and the node's rotation. Defaults to
      *  the kit's `AUTO_POSE_DESCRIPTOR`, which handles rect and path poses. */
-    geometry?: PoseProjection<TPose>;
+    geometry?: PoseDescriptor<TPose>;
     /** How the `DiagramNode` trait is read off a node. */
     read?: DiagramNodeReader;
 }
@@ -589,7 +589,7 @@ interface PortAffordanceOptions<TPose> {
     /** Also the chrome-caps visibility id. Default {@link PORT_LAYER_ID}. */
     id?: string;
     read?: DiagramNodeReader;
-    geometry?: PoseProjection<TPose>;
+    geometry?: PoseDescriptor<TPose>;
     /** Which participants show their ports. Default: all of them. Gate on
      *  selection or hover by reading `state`. */
     shows?: (node: DiagramNodeLike, state: ChromeState) => boolean;
@@ -673,7 +673,7 @@ interface ConnectActionOptions<TPose> {
     /** Default {@link CONNECT_ACTION_ID}. */
     id?: string;
     read?: DiagramNodeReader;
-    geometry?: PoseProjection<TPose>;
+    geometry?: PoseDescriptor<TPose>;
     /** Default {@link defaultCanConnect}. */
     canConnect?: CanConnect;
     /** How near the pointer must come to a port, in world units, before the
@@ -683,8 +683,6 @@ interface ConnectActionOptions<TPose> {
      *  Default `'straight'`. */
     router?: string;
     routers?: Readonly<Record<string, Router>>;
-    /** How the in-flight edge is painted. */
-    stroke?: Stroke;
     /**
      * Mints and commits the edge. Called once, on release over a valid port.
      *
@@ -837,7 +835,7 @@ interface Graph {
 }
 interface BuildGraphOptions<TPose> {
     read?: DiagramNodeReader;
-    geometry?: PoseProjection<TPose>;
+    geometry?: PoseDescriptor<TPose>;
 }
 /**
  * Read a graph out of a source of scene nodes.
@@ -875,7 +873,7 @@ declare function diagramLabelOf(node: {
     data: unknown;
 }): DiagramLabel | null;
 interface LabelPoseOptions<TPose> {
-    geometry?: PoseProjection<TPose>;
+    geometry?: PoseDescriptor<TPose>;
 }
 /**
  * A `derivePose` that stations a label along its dependency's path.
@@ -1084,7 +1082,7 @@ interface LiveLayoutFrame {
 }
 type LiveLayoutProducer<TPose> = (ctx: LiveLayoutCtx<TPose>) => LiveLayoutFrame;
 interface ForceProducerOptions<TPose> extends ForceOptions {
-    geometry?: PoseProjection<TPose>;
+    geometry?: PoseDescriptor<TPose>;
     /** Alpha held while something is pinned, so the graph keeps answering a drag
      *  instead of freezing under it. Default 0.3. */
     dragAlpha?: number;
@@ -1131,7 +1129,7 @@ interface UseLiveLayoutOptions<TPose> {
     frames?: number;
     easing?: EasingFn;
     read?: DiagramNodeReader;
-    geometry?: PoseProjection<TPose>;
+    geometry?: PoseDescriptor<TPose>;
     /** The undo entry's name. Default `'Layout'`. */
     label?: string;
     /** Fires once the run has settled or been stopped and its poses are in the
@@ -1204,7 +1202,7 @@ declare const layered: LayoutFn;
 /** The layouts this package ships. A consumer's own go in the same shape. */
 declare const LAYOUTS: Readonly<Record<string, LayoutFn>>;
 interface ApplyLayoutOptions<TPose> {
-    geometry?: PoseProjection<TPose>;
+    geometry?: PoseDescriptor<TPose>;
     /** The undo entry's name. Default `'Layout'`. */
     label?: string;
 }
@@ -1232,7 +1230,7 @@ declare function applyLayout<TPose>(scene: Scene<unknown, string, TPose>, result
  * translation is measured from the node's document pose, which a run in flight
  * never changes, so a frame's answer does not depend on the frame before it.
  */
-declare function layoutPoses<TPose>(scene: Scene<unknown, string, TPose>, result: LayoutResult, geometry?: PoseProjection<TPose>): Map<string, TPose>;
+declare function layoutPoses<TPose>(scene: Scene<unknown, string, TPose>, result: LayoutResult, geometry?: PoseDescriptor<TPose>): Map<string, TPose>;
 /** The default action id. */
 declare const LAYOUT_ACTION_ID = "diagram.layout";
 interface LayoutActionOptions<TPose> {
@@ -1249,7 +1247,7 @@ interface LayoutActionOptions<TPose> {
     algorithm?: string | LayoutFn;
     layout?: LayoutOptions;
     read?: DiagramNodeReader;
-    geometry?: PoseProjection<TPose>;
+    geometry?: PoseDescriptor<TPose>;
 }
 /**
  * `diagram.layout` — rebuild the graph, run a layout, write the result.
@@ -1388,7 +1386,7 @@ interface DiagramShapeOptions<TPose> {
     /** How the trait is read. Default: the node's own `data.diagram`. */
     read?: DiagramNodeReader;
     /** Reads the box the outline is built in. Default `RECT_POSE_DESCRIPTOR`. */
-    geometry?: PoseProjection<TPose>;
+    geometry?: PoseDescriptor<TPose>;
     /** Painted when the node's data declares neither. */
     defaultFill?: FillStyle | null;
     defaultStroke?: Stroke | null;

package/dist/index.js CHANGED Viewed

@@ -676,7 +676,6 @@ var DEFAULT_EDGE_STROKE = {
   markerEnd: "arrow"
 };
 var DEFAULT_ROUTER = "straight";
-var PREVIEW_STROKE = { paint: { color: "#7ba7c7" }, width: 2, dash: [4, 4] };
 function connectBinding(actionId = CONNECT_ACTION_ID) {
   return {
     spec: { kind: "drag", target: `affordance:${PORT_AFFORDANCE_KIND}` },
@@ -730,8 +729,7 @@ function createConnectAction(opts) {
     canConnect = defaultCanConnect,
     snapRadius = DEFAULT_SNAP,
     router: routerKey = DEFAULT_ROUTER,
-    commit = commitEdgeToScene,
-    stroke = PREVIEW_STROKE
+    commit = commitEdgeToScene
   } = opts;
   const routers = opts.routers ?? ROUTERS;
   const portOpts = {
@@ -787,12 +785,7 @@ function createConnectAction(opts) {
             const { end } = endAt(scratch.from, scratch.current);
             const points = route({ from: scratch.from, to: end, waypoints: [] });
             if (points.length < 2) return null;
-            const cmd = {
-              kind: "path",
-              path: polylineFromPoints(points),
-              stroke
-            };
-            return { kind: "commands", commands: [cmd], space: "world" };
+            return { kind: "polyline", points, role: "connector" };
           },
           onEnd(endCtx, reason) {
             scratch.open = false;

package/dist/index.js.map CHANGED Viewed

	@@ -1 +1 @@
1	- {"version":3,"sources":["../src/outline.ts","../src/onOutline.ts","../src/trait.ts","../src/ports.ts","../src/body.ts","../src/label.ts","../src/edge.ts","../src/portAffordance.ts","../src/connect.ts","../src/portLayer.ts","../src/contribution.ts","../src/graph.ts","../src/layout.ts","../src/force.ts","../src/layered.ts","../src/tree.ts","../src/layoutAction.ts","../src/live.ts","../src/shape.ts"],"names":["left","right","top","bottom","center","AUTO_POSE_DESCRIPTOR","polylineFromPoints","push","cursor","translatePoseViaDescriptor"],"mappings":";;;;AAwBA,IAAM,IAAA,GAAO,GAAA;AAIb,IAAM,KAAA,GAAQ,kBAAA;AAIP,SAAS,WAAA,CAAY,SAAkB,MAAA,EAAsB;AAClE,EAAA,IAAI,OAAO,OAAA,KAAY,QAAA,EAAU,OAAO,OAAA;AACxC,EAAA,MAAM,EAAE,CAAA,EAAG,CAAA,EAAG,OAAO,CAAA,EAAG,MAAA,EAAQ,GAAE,GAAI,MAAA;AACtC,EAAA,IAAI,KAAK,CAAA,IAAK,CAAA,IAAK,CAAA,EAAG,OAAO,SAAS,CAAA,EAAG,CAAA,EAAG,IAAA,CAAK,GAAA,CAAI,GAAG,CAAC,CAAA,EAAG,KAAK,GAAA,CAAI,CAAA,EAAG,CAAC,CAAC,CAAA;AAE1E,EAAA,QAAQ,OAAA;AAAS,IACf,KAAK,MAAA;AACH,MAAA,OAAO,QAAA,CAAS,CAAA,EAAG,CAAA,EAAG,CAAA,EAAG,CAAC,CAAA;AAAA,IAE5B,KAAK,SAAA;AACH,MAAA,OAAO,iBAAA,CAAkB;AAAA,QACvB,EAAE,CAAA,EAAG,CAAA,GAAI,CAAA,GAAI,GAAG,CAAA,EAAE;AAAA,QAClB,EAAE,CAAA,EAAG,CAAA,GAAI,GAAG,CAAA,EAAG,CAAA,GAAI,IAAI,CAAA,EAAE;AAAA,QACzB,EAAE,CAAA,EAAG,CAAA,GAAI,IAAI,CAAA,EAAG,CAAA,EAAG,IAAI,CAAA,EAAE;AAAA,QACzB,EAAE,CAAA,EAAG,CAAA,EAAG,CAAA,GAAI,IAAI,CAAA;AAAE,OACnB,CAAA;AAAA,IAEH,KAAK,eAAA,EAAiB;AAEpB,MAAA,MAAM,OAAO,IAAA,CAAK,GAAA,CAAI,CAAA,GAAI,IAAA,EAAM,IAAI,CAAC,CAAA;AACrC,MAAA,OAAO,iBAAA,CAAkB;AAAA,QACvB,EAAE,CAAA,EAAG,CAAA,GAAI,IAAA,EAAM,CAAA,EAAE;AAAA,QACjB,EAAE,CAAA,EAAG,CAAA,GAAI,CAAA,EAAG,CAAA,EAAE;AAAA,QACd,EAAE,CAAA,EAAG,CAAA,GAAI,IAAI,IAAA,EAAM,CAAA,EAAG,IAAI,CAAA,EAAE;AAAA,QAC5B,EAAE,CAAA,EAAG,CAAA,EAAG,CAAA,GAAI,CAAA;AAAE,OACf,CAAA;AAAA,IACH;AAAA,IAEA,KAAK,SAAA;AACH,MAAA,OAAO,WAAA,CAAY,CAAA,EAAG,CAAA,EAAG,CAAA,EAAG,CAAC,CAAA;AAAA;AAEnC;AAKA,SAAS,WAAA,CAAY,CAAA,EAAW,CAAA,EAAW,CAAA,EAAW,CAAA,EAAiB;AACrE,EAAA,MAAM,CAAA,GAAI,IAAA,CAAK,GAAA,CAAI,CAAA,EAAG,CAAC,CAAA,GAAI,CAAA;AAC3B,EAAA,MAAM,IAAI,CAAA,GAAI,KAAA;AACd,EAAA,MAAM,CAAA,GAAI,IAAI,WAAA,EAAY;AAE1B,EAAA,IAAI,KAAK,CAAA,EAAG;AACV,IAAA,MAAMA,QAAO,CAAA,GAAI,CAAA;AACjB,IAAA,MAAMC,MAAAA,GAAQ,IAAI,CAAA,GAAI,CAAA;AACtB,IAAA,MAAMC,IAAAA,GAAM,CAAA;AACZ,IAAA,MAAMC,UAAS,CAAA,GAAI,CAAA;AACnB,IAAA,MAAM,IAAA,GAAO,IAAI,CAAA,GAAI,CAAA;AACrB,IAAA,OAAO,CAAA,CACJ,MAAA,CAAOH,KAAAA,EAAME,IAAG,CAAA,CAChB,MAAA,CAAOD,MAAAA,EAAOC,IAAG,CAAA,CACjB,OAAA,CAAQD,MAAAA,GAAQ,CAAA,EAAGC,IAAAA,EAAK,CAAA,GAAI,CAAA,EAAG,IAAA,GAAO,CAAA,EAAG,CAAA,GAAI,CAAA,EAAG,IAAI,CAAA,CACpD,OAAA,CAAQ,CAAA,GAAI,CAAA,EAAG,IAAA,GAAO,CAAA,EAAGD,MAAAA,GAAQ,CAAA,EAAGE,OAAAA,EAAQF,QAAOE,OAAM,CAAA,CACzD,MAAA,CAAOH,KAAAA,EAAMG,OAAM,CAAA,CACnB,OAAA,CAAQH,KAAAA,GAAO,CAAA,EAAGG,OAAAA,EAAQ,CAAA,EAAG,IAAA,GAAO,CAAA,EAAG,CAAA,EAAG,IAAI,CAAA,CAC9C,OAAA,CAAQ,CAAA,EAAG,IAAA,GAAO,CAAA,EAAGH,KAAAA,GAAO,CAAA,EAAGE,IAAAA,EAAKF,KAAAA,EAAME,IAAG,CAAA,CAC7C,KAAA,EAAM,CACN,KAAA,EAAM;AAAA,EACX;AAEA,EAAA,MAAM,MAAM,CAAA,GAAI,CAAA;AAChB,EAAA,MAAM,MAAA,GAAS,IAAI,CAAA,GAAI,CAAA;AACvB,EAAA,MAAM,IAAA,GAAO,CAAA;AACb,EAAA,MAAM,QAAQ,CAAA,GAAI,CAAA;AAClB,EAAA,MAAM,IAAA,GAAO,IAAI,CAAA,GAAI,CAAA;AACrB,EAAA,OAAO,CAAA,CACJ,MAAA,CAAO,KAAA,EAAO,GAAG,CAAA,CACjB,MAAA,CAAO,KAAA,EAAO,MAAM,CAAA,CACpB,OAAA,CAAQ,KAAA,EAAO,MAAA,GAAS,CAAA,EAAG,IAAA,GAAO,CAAA,EAAG,CAAA,GAAI,CAAA,EAAG,IAAA,EAAM,CAAA,GAAI,CAAC,CAAA,CACvD,OAAA,CAAQ,IAAA,GAAO,CAAA,EAAG,CAAA,GAAI,CAAA,EAAG,IAAA,EAAM,MAAA,GAAS,CAAA,EAAG,MAAM,MAAM,CAAA,CACvD,MAAA,CAAO,IAAA,EAAM,GAAG,CAAA,CAChB,OAAA,CAAQ,IAAA,EAAM,GAAA,GAAM,CAAA,EAAG,IAAA,GAAO,CAAA,EAAG,CAAA,EAAG,IAAA,EAAM,CAAC,CAAA,CAC3C,OAAA,CAAQ,IAAA,GAAO,CAAA,EAAG,CAAA,EAAG,KAAA,EAAO,GAAA,GAAM,CAAA,EAAG,KAAA,EAAO,GAAG,CAAA,CAC/C,KAAA,EAAM,CACN,KAAA,EAAM;AACX;AAYO,SAAS,UAAA,CAAW,SAAkB,MAAA,EAAwB;AACnE,EAAA,IAAI,OAAO,OAAA,KAAY,QAAA,EAAU,OAAO,MAAA;AACxC,EAAA,MAAM,EAAE,CAAA,EAAG,CAAA,EAAG,OAAO,CAAA,EAAG,MAAA,EAAQ,GAAE,GAAI,MAAA;AACtC,EAAA,QAAQ,OAAA;AAAS,IACf,KAAK,MAAA;AACH,MAAA,OAAO,MAAA;AAAA,IACT,KAAK,SAAA;AAEH,MAAA,OAAO,EAAE,CAAA,EAAG,CAAA,GAAI,CAAA,GAAI,GAAG,CAAA,EAAG,CAAA,GAAI,CAAA,GAAI,CAAA,EAAG,KAAA,EAAO,CAAA,GAAI,CAAA,EAAG,MAAA,EAAQ,IAAI,CAAA,EAAE;AAAA,IACnE,KAAK,eAAA,EAAiB;AACpB,MAAA,MAAM,OAAO,IAAA,CAAK,GAAA,CAAI,CAAA,GAAI,IAAA,EAAM,IAAI,CAAC,CAAA;AACrC,MAAA,OAAO,EAAE,CAAA,EAAG,CAAA,GAAI,IAAA,EAAM,GAAG,KAAA,EAAO,IAAA,CAAK,GAAA,CAAI,CAAA,GAAI,IAAA,GAAO,CAAA,EAAG,CAAC,CAAA,EAAG,QAAQ,CAAA,EAAE;AAAA,IACvE;AAAA,IACA,KAAK,SAAA,EAAW;AACd,MAAA,MAAM,CAAA,GAAI,IAAA,CAAK,GAAA,CAAI,CAAA,EAAG,CAAC,CAAA,GAAI,CAAA;AAC3B,MAAA,OAAO,CAAA,IAAK,CAAA,GACR,EAAE,CAAA,EAAG,IAAI,CAAA,EAAG,CAAA,EAAG,KAAA,EAAO,IAAA,CAAK,GAAA,CAAI,CAAA,GAAI,CAAA,GAAI,CAAA,EAAG,CAAC,CAAA,EAAG,MAAA,EAAQ,CAAA,EAAE,GACxD,EAAE,CAAA,EAAG,CAAA,EAAG,CAAA,GAAI,GAAG,KAAA,EAAO,CAAA,EAAG,MAAA,EAAQ,IAAA,CAAK,GAAA,CAAI,CAAA,GAAI,CAAA,GAAI,CAAA,EAAG,CAAC,CAAA,EAAE;AAAA,IAC9D;AAAA;AAEJ;AAUO,SAAS,aAAA,CACd,SACA,OAAA,EACmC;AACnC,EAAA,IAAI,OAAO,OAAA,KAAY,QAAA,EAAU,OAAO,OAAA;AACxC,EAAA,QAAQ,OAAA;AAAS,IACf,KAAK,MAAA;AACH,MAAA,OAAO,OAAA;AAAA,IACT,KAAK,SAAA;AACH,MAAA,OAAO,EAAE,OAAO,OAAA,CAAQ,KAAA,GAAQ,GAAG,MAAA,EAAQ,OAAA,CAAQ,SAAS,CAAA,EAAE;AAAA,IAChE,KAAK,eAAA;AACH,MAAA,OAAO,EAAE,OAAO,OAAA,CAAQ,KAAA,IAAS,IAAI,IAAA,GAAO,CAAA,CAAA,EAAI,MAAA,EAAQ,OAAA,CAAQ,MAAA,EAAO;AAAA,IACzE,KAAK,SAAA;AACH,MAAA,OAAO,EAAE,OAAO,OAAA,CAAQ,KAAA,GAAQ,QAAQ,MAAA,EAAQ,MAAA,EAAQ,QAAQ,MAAA,EAAO;AAAA;AAE7E;ACpJA,IAAM,SAAA,GAAY,IAAA;AAGX,SAAS,eAAA,CAAgB,SAAkB,MAAA,EAA0B;AAC1E,EAAA,MAAM,IAAA,GAAO,WAAA,CAAY,OAAA,EAAS,MAAM,CAAA;AACxC,EAAA,OAAO,YAAY,IAAI,CAAA;AACzB;AAEA,SAAS,YAAY,IAAA,EAAsB;AACzC,EAAA,IAAI,IAAA,CAAK,SAAS,MAAA,EAAQ;AACxB,IAAA,MAAM,EAAE,CAAA,EAAG,CAAA,EAAG,OAAO,CAAA,EAAG,MAAA,EAAQ,GAAE,GAAI,IAAA;AACtC,IAAA,OAAO,CAAC,CAAA,EAAG,CAAA,EAAG,CAAA,GAAI,GAAG,CAAA,EAAG,CAAA,GAAI,CAAA,EAAG,CAAA,GAAI,CAAA,EAAG,CAAA,EAAG,CAAA,GAAI,CAAA,EAAG,GAAG,CAAC,CAAA;AAAA,EACtD;AACA,EAAA,MAAM,MAAgB,EAAC;AACvB,EAAA,MAAM,EAAE,QAAA,EAAU,MAAA,EAAO,GAAI,IAAA;AAC7B,EAAA,IAAI,EAAA,GAAK,CAAA;AACT,EAAA,IAAI,EAAA,GAAK,CAAA;AACT,EAAA,IAAI,EAAA,GAAK,CAAA;AACT,EAAA,IAAI,EAAA,GAAK,CAAA;AACT,EAAA,IAAI,EAAA,GAAK,CAAA;AACT,EAAA,KAAA,MAAW,OAAO,QAAA,EAAU;AAC1B,IAAA,IAAI,QAAQ,MAAA,EAAQ;AAClB,MAAA,EAAA,GAAK,OAAO,EAAE,CAAA;AAAI,MAAA,EAAA,GAAK,MAAA,CAAO,KAAK,CAAC,CAAA;AAAI,MAAA,EAAA,IAAM,CAAA;AAC9C,MAAA,EAAA,GAAK,EAAA;AAAI,MAAA,EAAA,GAAK,EAAA;AACd,MAAA,GAAA,CAAI,IAAA,CAAK,IAAI,EAAE,CAAA;AAAA,IACjB,CAAA,MAAA,IAAW,QAAQ,MAAA,EAAQ;AACzB,MAAA,EAAA,GAAK,OAAO,EAAE,CAAA;AAAI,MAAA,EAAA,GAAK,MAAA,CAAO,KAAK,CAAC,CAAA;AAAI,MAAA,EAAA,IAAM,CAAA;AAC9C,MAAA,GAAA,CAAI,IAAA,CAAK,IAAI,EAAE,CAAA;AAAA,IACjB,CAAA,MAAA,IAAW,QAAQ,MAAA,EAAQ;AACzB,MAAA,MAAM,KAAK,MAAA,CAAO,EAAE,GAAI,EAAA,GAAK,MAAA,CAAO,KAAK,CAAC,CAAA;AAC1C,MAAA,MAAM,EAAA,GAAK,OAAO,EAAA,GAAK,CAAC,GAAI,EAAA,GAAK,MAAA,CAAO,KAAK,CAAC,CAAA;AAC9C,MAAA,MAAM,EAAA,GAAK,OAAO,EAAA,GAAK,CAAC,GAAI,EAAA,GAAK,MAAA,CAAO,KAAK,CAAC,CAAA;AAC9C,MAAA,EAAA,IAAM,CAAA;AACN,MAAA,YAAA,CAAa,EAAA,EAAI,IAAI,EAAA,EAAI,EAAA,EAAI,IAAI,EAAA,EAAI,EAAA,EAAI,EAAA,EAAI,SAAA,EAAW,GAAG,CAAA;AAC3D,MAAA,EAAA,GAAK,EAAA;AAAI,MAAA,EAAA,GAAK,EAAA;AAAA,IAChB,CAAA,MAAA,IAAW,QAAQ,MAAA,EAAQ;AAEzB,MAAA,MAAM,KAAK,MAAA,CAAO,EAAE,GAAI,EAAA,GAAK,MAAA,CAAO,KAAK,CAAC,CAAA;AAC1C,MAAA,MAAM,EAAA,GAAK,OAAO,EAAA,GAAK,CAAC,GAAI,EAAA,GAAK,MAAA,CAAO,KAAK,CAAC,CAAA;AAC9C,MAAA,EAAA,IAAM,CAAA;AACN,MAAA,YAAA;AAAA,QACE,EAAA;AAAA,QAAI,EAAA;AAAA,QACJ,EAAA,GAAM,CAAA,GAAI,CAAA,IAAM,EAAA,GAAK,EAAA,CAAA;AAAA,QAAK,EAAA,GAAM,CAAA,GAAI,CAAA,IAAM,EAAA,GAAK,EAAA,CAAA;AAAA,QAC/C,EAAA,GAAM,CAAA,GAAI,CAAA,IAAM,EAAA,GAAK,EAAA,CAAA;AAAA,QAAK,EAAA,GAAM,CAAA,GAAI,CAAA,IAAM,EAAA,GAAK,EAAA,CAAA;AAAA,QAC/C,EAAA;AAAA,QAAI,EAAA;AAAA,QAAI,SAAA;AAAA,QAAW;AAAA,OACrB;AACA,MAAA,EAAA,GAAK,EAAA;AAAI,MAAA,EAAA,GAAK,EAAA;AAAA,IAChB,CAAA,MAAA,IAAW,QAAQ,MAAA,EAAQ;AACzB,MAAA,GAAA,CAAI,IAAA,CAAK,IAAI,EAAE,CAAA;AACf,MAAA,EAAA,GAAK,EAAA;AAAI,MAAA,EAAA,GAAK,EAAA;AAAA,IAChB;AAAA,EACF;AAEA,EAAA,IAAI,IAAI,MAAA,IAAU,CAAA,KAAM,IAAI,CAAC,CAAA,KAAM,IAAI,GAAA,CAAI,MAAA,GAAS,CAAC,CAAA,IAAK,IAAI,CAAC,CAAA,KAAM,IAAI,GAAA,CAAI,MAAA,GAAS,CAAC,CAAA,CAAA,EAAI;AACzF,IAAA,GAAA,CAAI,KAAK,GAAA,CAAI,CAAC,CAAA,EAAI,GAAA,CAAI,CAAC,CAAE,CAAA;AAAA,EAC3B;AACA,EAAA,OAAO,GAAA;AACT;AASO,SAAS,MAAA,CACd,IAAA,EACAE,OAAAA,EACA,KAAA,EACiC;AACjC,EAAA,MAAM,EAAA,GAAK,KAAA,CAAM,CAAA,GAAIA,OAAAA,CAAO,CAAA;AAC5B,EAAA,MAAM,EAAA,GAAK,KAAA,CAAM,CAAA,GAAIA,OAAAA,CAAO,CAAA;AAC5B,EAAA,IAAI,EAAA,KAAO,CAAA,IAAK,EAAA,KAAO,CAAA,EAAG,OAAO,IAAA;AACjC,EAAA,IAAI,KAAA,GAAQ,CAAA,QAAA;AACZ,EAAA,IAAI,GAAA,GAAuC,IAAA;AAC3C,EAAA,KAAA,IAAS,IAAI,CAAA,EAAG,CAAA,GAAI,IAAI,IAAA,CAAK,MAAA,EAAQ,KAAK,CAAA,EAAG;AAC3C,IAAA,MAAM,KAAK,IAAA,CAAK,CAAC,GAAI,EAAA,GAAK,IAAA,CAAK,IAAI,CAAC,CAAA;AACpC,IAAA,MAAM,EAAA,GAAK,KAAK,CAAA,GAAI,CAAC,GAAI,EAAA,GAAK,IAAA,CAAK,IAAI,CAAC,CAAA;AACxC,IAAA,MAAM,KAAK,EAAA,GAAK,EAAA;AAChB,IAAA,MAAM,KAAK,EAAA,GAAK,EAAA;AAChB,IAAA,MAAM,KAAA,GAAQ,EAAA,GAAK,EAAA,GAAK,EAAA,GAAK,EAAA;AAC7B,IAAA,IAAI,UAAU,CAAA,EAAG;AAEjB,IAAA,MAAM,CAAA,GAAA,CAAA,CAAM,KAAKA,OAAAA,CAAO,CAAA,IAAK,MAAM,EAAA,GAAKA,OAAAA,CAAO,KAAK,EAAA,IAAM,KAAA;AAC1D,IAAA,MAAM,CAAA,GAAA,CAAA,CAAM,KAAKA,OAAAA,CAAO,CAAA,IAAK,MAAM,EAAA,GAAKA,OAAAA,CAAO,KAAK,EAAA,IAAM,KAAA;AAC1D,IAAA,IAAI,CAAA,GAAI,CAAA,IAAK,CAAA,GAAI,CAAA,IAAK,IAAI,CAAA,EAAG;AAC7B,IAAA,IAAI,IAAI,KAAA,EAAO;AACb,MAAA,KAAA,GAAQ,CAAA;AACR,MAAA,GAAA,GAAM,EAAE,CAAA,EAAGA,OAAAA,CAAO,CAAA,GAAI,EAAA,GAAK,GAAG,CAAA,EAAGA,OAAAA,CAAO,CAAA,GAAI,EAAA,GAAK,CAAA,EAAE;AAAA,IACrD;AAAA,EACF;AACA,EAAA,OAAO,GAAA;AACT;AAMO,SAAS,cAAA,CACd,KAAA,EACA,OAAA,EACA,MAAA,EACQ;AACR,EAAA,IAAI,MAAA,CAAO,SAAS,CAAA,IAAK,MAAA,CAAO,UAAU,CAAA,EAAG,OAAO,CAAC,GAAG,KAAK,CAAA;AAC7D,EAAA,MAAM,IAAA,GAAO,eAAA,CAAgB,OAAA,EAAS,MAAM,CAAA;AAC5C,EAAA,MAAMA,OAAAA,GAAS,EAAE,CAAA,EAAG,MAAA,CAAO,CAAA,GAAI,MAAA,CAAO,KAAA,GAAQ,CAAA,EAAG,CAAA,EAAG,MAAA,CAAO,CAAA,GAAI,MAAA,CAAO,SAAS,CAAA,EAAE;AACjF,EAAA,OAAO,KAAA,CAAM,GAAA,CAAI,CAAC,IAAA,KAAS;AACzB,IAAA,MAAM,GAAA,GAAM,MAAA,CAAO,IAAA,EAAMA,OAAAA,EAAQ,KAAK,KAAK,CAAA;AAC3C,IAAA,OAAO,QAAQ,IAAA,GAAO,IAAA,GAAO,EAAE,GAAG,IAAA,EAAM,OAAO,GAAA,EAAI;AAAA,EACrD,CAAC,CAAA;AACH;;;AC3GO,IAAM,iBAAA,GAAoB;AAgC1B,IAAM,aAAA,GAAmC,CAAC,IAAA,KAAS;AACxD,EAAA,MAAM,OAAO,IAAA,CAAK,IAAA;AAClB,EAAA,IAAI,IAAA,KAAS,IAAA,IAAQ,OAAO,IAAA,KAAS,UAAU,OAAO,IAAA;AACtD,EAAA,MAAM,KAAA,GAAS,KAAiC,iBAAiB,CAAA;AACjE,EAAA,IAAI,KAAA,KAAU,IAAA,IAAQ,OAAO,KAAA,KAAU,UAAU,OAAO,IAAA;AACxD,EAAA,IAAI,MAAA,IAAU,KAAA,IAAS,IAAA,IAAQ,KAAA,EAAO,OAAO,IAAA;AAC7C,EAAA,OAAO,KAAA;AACT;AAUO,SAAS,mBAAmB,OAAA,EAAyD;AAC1F,EAAA,MAAM,IAAA,uBAAW,GAAA,EAAY;AAC7B,EAAA,KAAA,MAAW,SAAS,OAAA,EAAS;AAC3B,IAAA,IAAI,IAAA,CAAK,GAAA,CAAI,KAAA,CAAM,IAAI,CAAA,EAAG;AACxB,MAAA,MAAM,IAAI,KAAA,CAAM,CAAA,0CAAA,EAA6C,KAAA,CAAM,IAAI,CAAA,CAAA,CAAG,CAAA;AAAA,IAC5E;AACA,IAAA,IAAA,CAAK,GAAA,CAAI,MAAM,IAAI,CAAA;AAAA,EACrB;AACA,EAAA,OAAO,CAAC,IAAA,KAAS;AACf,IAAA,MAAM,GAAA,GAAM,cAAc,IAAI,CAAA;AAC9B,IAAA,IAAI,GAAA,KAAQ,MAAM,OAAO,GAAA;AACzB,IAAA,KAAA,MAAW,SAAS,OAAA,EAAS;AAC3B,MAAA,IAAI,CAAC,KAAA,CAAM,OAAA,CAAQ,IAAA,CAAK,IAAI,CAAA,EAAG;AAC/B,MAAA,OAAO,OAAO,MAAM,KAAA,KAAU,UAAA,GAAa,MAAM,KAAA,CAAM,IAAA,CAAK,IAAI,CAAA,GAAI,KAAA,CAAM,KAAA;AAAA,IAC5E;AACA,IAAA,OAAO,IAAA;AAAA,EACT,CAAA;AACF;AAGO,SAAS,aAAA,CACd,IAAA,EACA,IAAA,GAA0B,aAAA,EACN;AACpB,EAAA,OAAO,KAAK,IAAI,CAAA;AAClB;AAGO,SAAS,QAAA,CAAS,MAAuB,IAAA,EAAmC;AACjF,EAAA,OAAO,aAAA,CAAc,IAAA,EAAM,IAAI,CAAA,EAAG,MAAA,KAAW,IAAA;AAC/C;;;AC9EO,IAAM,OAAA,GAAU;AAAA,EACrB,EAAA,EAAI,EAAE,CAAA,EAAG,CAAA,EAAG,GAAG,CAAA,EAAE;AAAA,EACjB,CAAA,EAAG,EAAE,CAAA,EAAG,GAAA,EAAK,GAAG,CAAA,EAAE;AAAA,EAClB,EAAA,EAAI,EAAE,CAAA,EAAG,CAAA,EAAG,GAAG,CAAA,EAAE;AAAA,EACjB,CAAA,EAAG,EAAE,CAAA,EAAG,CAAA,EAAG,GAAG,GAAA,EAAI;AAAA,EAClB,EAAA,EAAI,EAAE,CAAA,EAAG,CAAA,EAAG,GAAG,CAAA,EAAE;AAAA,EACjB,CAAA,EAAG,EAAE,CAAA,EAAG,GAAA,EAAK,GAAG,CAAA,EAAE;AAAA,EAClB,EAAA,EAAI,EAAE,CAAA,EAAG,CAAA,EAAG,GAAG,CAAA,EAAE;AAAA,EACjB,CAAA,EAAG,EAAE,CAAA,EAAG,CAAA,EAAG,GAAG,GAAA;AAChB;AAOO,IAAM,aAAA,GAAqC,OAAO,MAAA,CAAO;AAAA,EAC9D,EAAE,EAAA,EAAI,GAAA,EAAK,EAAA,EAAI,QAAQ,CAAA,EAAE;AAAA,EACzB,EAAE,EAAA,EAAI,GAAA,EAAK,EAAA,EAAI,QAAQ,CAAA,EAAE;AAAA,EACzB,EAAE,EAAA,EAAI,GAAA,EAAK,EAAA,EAAI,QAAQ,CAAA,EAAE;AAAA,EACzB,EAAE,EAAA,EAAI,GAAA,EAAK,EAAA,EAAI,QAAQ,CAAA;AACzB,CAAC;AAmBD,SAAS,SAAS,EAAA,EAA6B;AAC7C,EAAA,MAAM,CAAA,GAAI,EAAA,CAAG,CAAA,GAAI,CAAA,GAAI,CAAA;AACrB,EAAA,MAAM,CAAA,GAAI,EAAA,CAAG,CAAA,GAAI,CAAA,GAAI,CAAA;AACrB,EAAA,MAAM,GAAA,GAAM,IAAA,CAAK,KAAA,CAAM,CAAA,EAAG,CAAC,CAAA;AAC3B,EAAA,IAAI,GAAA,KAAQ,GAAG,OAAO,IAAA;AACtB,EAAA,OAAO,EAAE,CAAA,EAAG,CAAA,GAAI,GAAA,EAAK,CAAA,EAAG,IAAI,GAAA,EAAI;AAClC;AASO,SAAS,OAAA,CACd,IAAA,EACA,IAAA,EACA,IAAA,GAA4B,EAAC,EACrB;AACR,EAAA,MAAM,KAAA,GAAQ,aAAA,CAAc,IAAA,EAAM,IAAA,CAAK,IAAI,CAAA;AAC3C,EAAA,IAAI,KAAA,KAAU,IAAA,EAAM,OAAO,EAAC;AAC5B,EAAA,MAAM,QAAA,GAAW,KAAK,QAAA,IAAa,oBAAA;AACnC,EAAA,MAAM,MAAA,GAAS,QAAA,CAAS,SAAA,CAAU,IAAI,CAAA;AACtC,EAAA,MAAM,QAAA,GAAW,QAAA,CAAS,WAAA,GAAc,IAAI,CAAA,IAAK,CAAA;AACjD,EAAA,MAAM,EAAA,GAAK,MAAA,CAAO,CAAA,GAAI,MAAA,CAAO,KAAA,GAAQ,CAAA;AACrC,EAAA,MAAM,EAAA,GAAK,MAAA,CAAO,CAAA,GAAI,MAAA,CAAO,MAAA,GAAS,CAAA;AAKtC,EAAA,MAAM,IAAA,GAAO,KAAA,CAAM,OAAA,KAAY,MAAA,IAAa,OAAO,KAAA,IAAS,CAAA,IAAK,MAAA,CAAO,MAAA,IAAU,CAAA,GAC9E,IAAA,GACA,eAAA,CAAgB,KAAA,CAAM,SAAS,MAAM,CAAA;AAEzC,EAAA,OAAA,CAAQ,KAAA,CAAM,KAAA,IAAS,aAAA,EAAe,GAAA,CAAI,CAAC,IAAA,KAAS;AAClD,IAAA,MAAM,QAAA,GAAiB;AAAA,MACrB,GAAG,MAAA,CAAO,CAAA,GAAI,IAAA,CAAK,EAAA,CAAG,IAAI,MAAA,CAAO,KAAA;AAAA,MACjC,GAAG,MAAA,CAAO,CAAA,GAAI,IAAA,CAAK,EAAA,CAAG,IAAI,MAAA,CAAO;AAAA,KACnC;AACA,IAAA,MAAM,IAAA,GAAA,CAAQ,IAAA,KAAS,IAAA,GAAO,IAAA,GAAO,MAAA,CAAO,IAAA,EAAM,EAAE,CAAA,EAAG,EAAA,EAAI,CAAA,EAAG,EAAA,EAAG,EAAG,QAAQ,CAAA,KAAM,QAAA;AAClF,IAAA,MAAM,MAAA,GAAS,KAAK,MAAA,KAAW,MAAA,GAAY,SAAS,IAAA,CAAK,EAAE,IAAI,IAAA,CAAK,MAAA;AACpE,IAAA,IAAI,aAAa,CAAA,EAAG;AAClB,MAAA,OAAO,EAAE,EAAA,EAAI,IAAA,CAAK,EAAA,EAAI,MAAA,EAAQ,IAAA,CAAK,EAAA,EAAI,KAAA,EAAO,IAAA,EAAM,MAAA,EAAQ,GAAG,MAAA,CAAO,IAAI,CAAA,EAAE;AAAA,IAC9E;AACA,IAAA,OAAO;AAAA,MACL,IAAI,IAAA,CAAK,EAAA;AAAA,MACT,QAAQ,IAAA,CAAK,EAAA;AAAA,MACb,KAAA,EAAO,YAAY,IAAA,CAAK,CAAA,EAAG,KAAK,CAAA,EAAG,EAAA,EAAI,IAAI,QAAQ,CAAA;AAAA;AAAA,MAEnD,MAAA,EAAQ,MAAA,KAAW,IAAA,GAAO,IAAA,GAAO,WAAA,CAAY,MAAA,CAAO,CAAA,EAAG,MAAA,CAAO,CAAA,EAAG,CAAA,EAAG,CAAA,EAAG,QAAQ,CAAA;AAAA,MAC/E,GAAG,OAAO,IAAI;AAAA,KAChB;AAAA,EACF,CAAC,CAAA;AACH;AAGO,SAAS,OACd,IAAA,EACA,IAAA,EACA,MAAA,EACA,IAAA,GAA4B,EAAC,EACX;AAClB,EAAA,OAAO,OAAA,CAAQ,IAAA,EAAM,IAAA,EAAM,IAAI,CAAA,CAAE,KAAK,CAAC,CAAA,KAAM,CAAA,CAAE,EAAA,KAAO,MAAM,CAAA;AAC9D;AAIA,SAAS,OAAO,IAAA,EAAmC;AACjD,EAAA,OAAO,IAAA,CAAK,SAAS,MAAA,GAAY,KAAK,EAAE,IAAA,EAAM,KAAK,IAAA,EAAK;AAC1D;;;AChCA,IAAM,eAAA,GAAkB,CAAA;AACxB,IAAM,WAAA,GAAc,CAAA;AAIpB,IAAM,aAAA,GAAgB,EAAA;AAKf,SAAS,cACd,GAAA,EACgB;AAChB,EAAA,OAAO,CAAC,MAAM,KAAA,KAAU;AACtB,IAAA,MAAM,IAAA,GAAO,MAAM,QAAA,IAAY,aAAA;AAC/B,IAAA,GAAA,CAAI,IAAA,GAAO,CAAA,EAAG,KAAA,CAAM,IAAA,KAAS,IAAA,GAAO,OAAA,GAAU,EAAE,CAAA,EAAG,IAAI,CAAA,GAAA,EAAM,KAAA,CAAM,UAAA,IAAc,YAAY,CAAA,CAAA;AAC7F,IAAA,OAAO,EAAE,KAAA,EAAO,GAAA,CAAI,WAAA,CAAY,IAAI,CAAA,CAAE,KAAA,EAAO,MAAA,EAAQ,IAAA,CAAK,IAAA,CAAK,IAAA,GAAO,GAAG,CAAA,EAAE;AAAA,EAC7E,CAAA;AACF;AAGA,SAAS,UAAA,CAAW,KAAU,OAAA,EAAwE;AACpG,EAAA,MAAM,IAAA,GAAO,CAAC,CAAA,EAAW,KAAA,KACvB,YAAY,MAAA,GACR,EAAE,OAAO,CAAA,CAAE,MAAA,IAAA,CAAY,OAAO,QAAA,IAAY,aAAA,IAAiB,MAAO,MAAA,EAAQ,aAAA,KAC1E,OAAA,CAAQ,CAAA,EAAG,KAAA,IAAS,EAAE,CAAA;AAE5B,EAAA,QAAQ,IAAI,IAAA;AAAM,IAChB,KAAK,OAAA;AACH,MAAA,OAAO,IAAA,CAAK,GAAA,CAAI,IAAA,EAAM,GAAA,CAAI,KAAK,CAAA;AAAA,IACjC,KAAK,OAAA,EAAS;AAEZ,MAAA,MAAM,CAAA,GAAI,IAAA,CAAK,GAAA,CAAI,KAAA,EAAO,IAAI,KAAK,CAAA;AACnC,MAAA,MAAM,CAAA,GAAI,IAAA,CAAK,GAAA,CAAI,KAAA,EAAO,IAAI,KAAK,CAAA;AACnC,MAAA,OAAO,EAAE,KAAA,EAAO,CAAA,CAAE,KAAA,GAAQ,cAAc,CAAA,GAAI,CAAA,CAAE,KAAA,EAAO,MAAA,EAAQ,KAAK,GAAA,CAAI,CAAA,CAAE,MAAA,EAAQ,CAAA,CAAE,MAAM,CAAA,EAAE;AAAA,IAC5F;AAAA,IACA,KAAK,OAAA,EAAS;AACZ,MAAA,MAAM,IAAA,GAAO,CAAC,KAAA,KAAA,CACX,KAAA,IAAS,EAAC,EAAG,MAAA,CAAO,CAAC,CAAA,EAAG,CAAA,KAAM,IAAA,CAAK,IAAI,CAAA,EAAG,CAAA,CAAE,KAAA,KAAU,MAAA,GAAY,CAAA,GAAI,IAAA,CAAK,EAAE,KAAK,CAAA,CAAE,KAAK,CAAA,EAAG,CAAC,CAAA;AAChG,MAAA,MAAM,IAAA,GAAO,IAAA,CAAK,GAAA,CAAI,GAAA,CAAI,IAAA,EAAM,MAAA,IAAU,CAAA,EAAG,GAAA,CAAI,KAAA,EAAO,MAAA,IAAU,CAAA,EAAG,CAAC,CAAA;AACtE,MAAA,OAAO;AAAA,QACL,KAAA,EAAO,KAAK,GAAA,CAAI,IAAI,IAAI,WAAA,GAAc,CAAA,GAAI,IAAA,CAAK,GAAA,CAAI,KAAK,CAAA;AAAA,QACxD,MAAA,EAAQ,GAAA,CAAI,MAAA,IAAU,IAAA,GAAO;AAAA,OAC/B;AAAA,IACF;AAAA,IACA,KAAK,MAAA;AACH,MAAA,OAAO,EAAE,KAAA,EAAO,CAAA,EAAG,MAAA,EAAQ,IAAI,MAAA,EAAO;AAAA;AAE5C;AAMO,SAAS,WAAA,CAAY,MAAgB,OAAA,EAAqC;AAC/E,EAAA,MAAM,OAAA,GAAU,KAAK,OAAA,IAAW,eAAA;AAChC,EAAA,MAAM,GAAA,GAAM,KAAK,GAAA,IAAO,WAAA;AACxB,EAAA,IAAI,KAAA,GAAQ,CAAA;AACZ,EAAA,IAAI,MAAA,GAAS,CAAA;AACb,EAAA,KAAA,MAAW,CAAC,CAAA,EAAG,GAAG,KAAK,IAAA,CAAK,IAAA,CAAK,SAAQ,EAAG;AAC1C,IAAA,MAAM,CAAA,GAAI,UAAA,CAAW,GAAA,EAAK,OAAO,CAAA;AACjC,IAAA,KAAA,GAAQ,IAAA,CAAK,GAAA,CAAI,KAAA,EAAO,CAAA,CAAE,KAAK,CAAA;AAC/B,IAAA,MAAA,IAAU,CAAA,CAAE,MAAA,IAAU,CAAA,GAAI,CAAA,GAAI,GAAA,GAAM,CAAA,CAAA;AAAA,EACtC;AAGA,EAAA,MAAM,GAAA,GAAM,aAAA,CAAc,IAAA,CAAK,OAAA,EAAS;AAAA,IACtC,KAAA,EAAO,QAAQ,OAAA,GAAU,CAAA;AAAA,IACzB,MAAA,EAAQ,SAAS,OAAA,GAAU;AAAA,GAC5B,CAAA;AACD,EAAA,OAAO,EAAE,QAAA,EAAU,GAAA,CAAI,KAAA,EAAO,SAAA,EAAW,IAAI,MAAA,EAAO;AACtD;AAOO,SAAS,UAAA,CAAiC,MAAa,KAAA,EAAyB;AACrF,EAAA,MAAM,QAAQ,IAAA,CAAK,GAAA,CAAI,IAAA,CAAK,KAAA,EAAO,MAAM,QAAQ,CAAA;AACjD,EAAA,MAAM,SAAS,IAAA,CAAK,GAAA,CAAI,IAAA,CAAK,MAAA,EAAQ,MAAM,SAAS,CAAA;AACpD,EAAA,IAAI,UAAU,IAAA,CAAK,KAAA,IAAS,MAAA,KAAW,IAAA,CAAK,QAAQ,OAAO,IAAA;AAC3D,EAAA,OAAO,EAAE,GAAG,IAAA,EAAM,KAAA,EAAO,MAAA,EAAO;AAClC;AAKO,SAAS,UAAA,CACd,IAAA,EACA,MAAA,EACA,OAAA,EACU;AACV,EAAA,MAAM,OAAA,GAAU,KAAK,OAAA,IAAW,eAAA;AAChC,EAAA,MAAM,GAAA,GAAM,KAAK,GAAA,IAAO,WAAA;AACxB,EAAA,MAAM,KAAA,GAAQ,UAAA,CAAW,IAAA,CAAK,OAAA,EAAS,MAAM,CAAA;AAC7C,EAAA,MAAM,QAAQ,IAAA,CAAK,GAAA,CAAI,MAAM,KAAA,GAAQ,OAAA,GAAU,GAAG,CAAC,CAAA;AACnD,EAAA,IAAI,CAAA,GAAI,MAAM,CAAA,GAAI,OAAA;AAClB,EAAA,OAAO,IAAA,CAAK,IAAA,CAAK,GAAA,CAAI,CAAC,KAAK,KAAA,KAAU;AACnC,IAAA,MAAM,CAAA,GAAI,UAAA,CAAW,GAAA,EAAK,OAAO,CAAA,CAAE,MAAA;AACnC,IAAA,MAAM,GAAA,GAAc,EAAE,GAAA,EAAK,KAAA,EAAO,CAAA,EAAG,KAAA,CAAM,CAAA,GAAI,OAAA,EAAS,CAAA,EAAG,KAAA,EAAO,MAAA,EAAQ,CAAA,EAAE;AAC5E,IAAA,CAAA,IAAK,CAAA,GAAI,GAAA;AACT,IAAA,OAAO,GAAA;AAAA,EACT,CAAC,CAAA;AACH;AAWO,SAAS,cAAA,CACd,GAAA,EACA,GAAA,EACA,OAAA,EACc;AACd,EAAA,MAAM,KAAA,GAAQ,CAAC,KAAA,KACb,KAAA,KAAU,SAAY,CAAA,GAAI,UAAA,CAAW,EAAE,IAAA,EAAM,OAAA,EAAS,IAAA,EAAM,KAAA,EAAM,EAAG,OAAO,CAAA,CAAE,KAAA;AAChF,EAAA,MAAM,KAAA,GAAQ,IAAA,CAAK,GAAA,CAAI,GAAA,CAAI,IAAA,EAAM,MAAA,IAAU,CAAA,EAAG,GAAA,CAAI,KAAA,EAAO,MAAA,IAAU,CAAA,EAAG,CAAC,CAAA;AACvE,EAAA,MAAM,UAAA,GAAa,IAAI,MAAA,GAAS,KAAA;AAChC,EAAA,MAAM,MAAoB,EAAC;AAC3B,EAAA,MAAM,IAAA,GAAO,CAAC,KAAA,EAAuC,KAAA,KAAkC;AACrF,IAAA,KAAA,MAAW,CAAC,OAAO,IAAI,CAAA,IAAA,CAAM,SAAS,EAAC,EAAG,SAAQ,EAAG;AACnD,MAAA,MAAM,CAAA,GAAI,KAAA,CAAM,IAAA,CAAK,KAAK,CAAA;AAC1B,MAAA,GAAA,CAAI,IAAA,CAAK;AAAA,QACP,IAAA;AAAA,QACA,IAAA,EAAM,KAAA;AAAA,QACN,KAAA;AAAA,QACA,CAAA,EAAG,UAAU,MAAA,GAAS,GAAA,CAAI,IAAI,GAAA,CAAI,CAAA,GAAI,IAAI,KAAA,GAAQ,CAAA;AAAA,QAClD,CAAA,EAAG,GAAA,CAAI,CAAA,GAAI,KAAA,GAAQ,UAAA;AAAA,QACnB,KAAA,EAAO,CAAA;AAAA,QACP,MAAA,EAAQ;AAAA,OACT,CAAA;AAAA,IACH;AAAA,EACF,CAAA;AACA,EAAA,IAAA,CAAK,GAAA,CAAI,MAAM,MAAM,CAAA;AACrB,EAAA,IAAA,CAAK,GAAA,CAAI,OAAO,OAAO,CAAA;AACvB,EAAA,OAAO,GAAA;AACT;AAgBO,SAAS,SAAA,CAAU,IAAA,EAAgB,MAAA,EAAgB,OAAA,EAAuC;AAC/F,EAAA,MAAM,UAAU,IAAA,CAAK,OAAA;AACrB,EAAA,MAAM,OAAA,GAAsB;AAAA,IAC1B,EAAE,EAAA,EAAI,GAAA,EAAK,EAAA,EAAI,QAAQ,CAAA,EAAE;AAAA,IACzB,EAAE,EAAA,EAAI,GAAA,EAAK,EAAA,EAAI,QAAQ,CAAA,EAAE;AAAA,IACzB,EAAE,EAAA,EAAI,GAAA,EAAK,EAAA,EAAI,QAAQ,CAAA,EAAE;AAAA,IACzB,EAAE,EAAA,EAAI,GAAA,EAAK,EAAA,EAAI,QAAQ,CAAA;AAAE,GAC3B;AACA,EAAA,IAAI,OAAO,MAAA,IAAU,CAAA,SAAU,EAAE,OAAA,EAAS,OAAO,OAAA,EAAQ;AAEzD,EAAA,MAAM,WAAuB,EAAC;AAC9B,EAAA,IAAI,OAAA,GAAU,KAAA;AACd,EAAA,IAAI,QAAA,GAAW,KAAA;AACf,EAAA,KAAA,MAAW,GAAA,IAAO,UAAA,CAAW,IAAA,EAAM,MAAA,EAAQ,OAAO,CAAA,EAAG;AACnD,IAAA,IAAI,GAAA,CAAI,GAAA,CAAI,IAAA,KAAS,OAAA,EAAS;AAC9B,IAAA,KAAA,MAAW,MAAM,cAAA,CAAe,GAAA,CAAI,GAAA,EAAK,GAAA,EAAK,OAAO,CAAA,EAAG;AACtD,MAAA,IAAI,EAAA,CAAG,IAAA,KAAS,MAAA,EAAQ,OAAA,GAAU,IAAA;AAAA,WAC7B,QAAA,GAAW,IAAA;AAChB,MAAA,MAAM,CAAA,GAAA,CAAK,GAAG,CAAA,GAAI,EAAA,CAAG,SAAS,CAAA,GAAI,MAAA,CAAO,KAAK,MAAA,CAAO,MAAA;AACrD,MAAA,QAAA,CAAS,IAAA,CAAK,QAAA;AAAA,QACZ,EAAE,EAAA,EAAI,EAAA,CAAG,IAAA,CAAK,IAAI,EAAA,EAAI,EAAE,CAAA,EAAG,EAAA,CAAG,IAAA,KAAS,MAAA,GAAS,CAAA,GAAI,CAAA,EAAG,GAAE,EAAE;AAAA,QAC3D,GAAG,IAAA,CAAK;AAAA,OACT,CAAA;AAAA,IACH;AAAA,EACF;AACA,EAAA,MAAM,IAAA,GAAO,OAAA,CAAQ,MAAA,CAAO,CAAC,MAC3B,EAAE,CAAA,CAAE,EAAA,KAAO,GAAA,IAAO,OAAA,CAAA,IAAY,EAAE,CAAA,CAAE,EAAA,KAAO,OAAO,QAAA,CAAS,CAAA;AAC3D,EAAA,OAAO,EAAE,SAAS,KAAA,EAAO,CAAC,GAAG,IAAA,EAAM,GAAG,QAAQ,CAAA,EAAE;AAClD;AAEA,SAAS,QAAA,CAAS,MAAgB,IAAA,EAAoC;AACpE,EAAA,OAAO,SAAS,MAAA,GAAY,IAAA,GAAO,EAAE,GAAG,MAAM,IAAA,EAAK;AACrD;AAIO,SAAS,WAAA,CAAY,MAAgB,MAAA,EAAgB;AAC1D,EAAA,OAAO,WAAA,CAAY,IAAA,CAAK,OAAA,EAAS,MAAM,CAAA;AACzC;AAwCO,SAAS,SAAA,CACd,IAAA,EACA,EAAA,EACA,IAAA,EAC8D;AAC9D,EAAA,MAAM,OAAO,UAAA,CAAW,EAAA,EAAI,YAAY,IAAA,EAAM,IAAA,CAAK,OAAO,CAAC,CAAA;AAC3D,EAAA,MAAM,QAA8C,CAAC;AAAA,IACnD,IAAA,EAAM,WAAA;AAAA,IACN,OAAO,IAAA,CAAK,KAAA;AAAA,IACZ,IAAA;AAAA,IACA,IAAA,EAAM,KAAK,IAAA,CAAK,SAAA,CAAU,MAAM,IAAA,EAAM,IAAA,CAAK,OAAO,CAAA,EAAG,IAAI,CAAA;AAAA,IACzD,GAAI,KAAK,EAAA,KAAO,MAAA,GAAY,EAAC,GAAI,EAAE,EAAA,EAAI,IAAA,CAAK,EAAA;AAAG,GAChD,CAAA;AAED,EAAA,MAAM,IAAA,GAAO,CAAC,GAAA,EAAa,IAAA,KAAsB;AAC/C,IAAA,KAAA,CAAM,IAAA,CAAK;AAAA,MACT,IAAA,EAAM,MAAA;AAAA,MACN,OAAO,IAAA,CAAK,KAAA;AAAA,MACZ,IAAA,EAAM,EAAE,GAAG,IAAA,EAAM,GAAG,GAAA,CAAI,CAAA,EAAG,CAAA,EAAG,GAAA,CAAI,GAAG,KAAA,EAAO,GAAA,CAAI,KAAA,EAAO,MAAA,EAAQ,IAAI,MAAA,EAAO;AAAA,MAC1E,IAAA;AAAA,MACA,QAAA,EAAU,KAAA;AAAA,MACV,GAAI,KAAK,EAAA,KAAO,MAAA,GAAY,EAAC,GAAI,EAAE,MAAA,EAAQ,IAAA,CAAK,EAAA;AAAG,KACpD,CAAA;AAAA,EACH,CAAA;AAEA,EAAA,MAAM,YAAY,IAAA,CAAK,SAAA;AACvB,EAAA,KAAA,MAAW,OAAO,UAAA,CAAW,IAAA,EAAM,IAAA,EAAM,IAAA,CAAK,OAAO,CAAA,EAAG;AACtD,IAAA,MAAM,OAAO,IAAA,CAAK,GAAA,CAAI,QAAQ,GAAA,CAAI,GAAG,GAAG,GAAG,CAAA;AAC3C,IAAA,IAAI,IAAA,KAAS,IAAA,EAAM,IAAA,CAAK,GAAA,EAAK,IAAI,CAAA;AACjC,IAAA,IAAI,SAAA,KAAc,MAAA,IAAa,GAAA,CAAI,GAAA,CAAI,SAAS,OAAA,EAAS;AACzD,IAAA,KAAA,MAAW,MAAM,cAAA,CAAe,GAAA,CAAI,KAAK,GAAA,EAAK,IAAA,CAAK,OAAO,CAAA,EAAG;AAC3D,MAAA,IAAI,EAAA,CAAG,IAAA,CAAK,KAAA,KAAU,MAAA,EAAW;AACjC,MAAA,MAAM,SAAA,GAAY,SAAA,CAAU,EAAA,CAAG,IAAA,CAAK,OAAO,EAAE,CAAA;AAC7C,MAAA,IAAI,SAAA,KAAc,IAAA,EAAM,IAAA,CAAK,EAAA,EAAI,SAAS,CAAA;AAAA,IAC5C;AAAA,EACF;AACA,EAAA,OAAO,EAAE,MAAM,KAAA,EAAM;AACvB;AAGA,SAAS,QAAQ,GAAA,EAAkB;AACjC,EAAA,IAAI,GAAA,CAAI,IAAA,KAAS,OAAA,EAAS,OAAO,GAAA,CAAI,IAAA;AACrC,EAAA,IAAI,GAAA,CAAI,SAAS,OAAA,EAAS,OAAO,GAAG,GAAA,CAAI,KAAK,CAAA,EAAA,EAAK,GAAA,CAAI,KAAK,CAAA,CAAA;AAC3D,EAAA,OAAO,EAAA;AACT;AC9VA,IAAM,QAAQ,EAAE,KAAA,EAAO,GAAG,GAAA,EAAK,GAAA,EAAK,KAAK,CAAA,EAAE;AAGpC,SAAS,eAAe,IAAA,EAA8C;AAC3E,EAAA,MAAM,OAAO,IAAA,CAAK,IAAA;AAClB,EAAA,IAAI,IAAA,KAAS,IAAA,IAAQ,OAAO,IAAA,KAAS,UAAU,OAAO,IAAA;AACtD,EAAA,MAAM,QAAS,IAAA,CAA+B,OAAA;AAC9C,EAAA,IAAI,KAAA,KAAU,IAAA,IAAQ,OAAO,KAAA,KAAU,UAAU,OAAO,IAAA;AACxD,EAAA,MAAM,QAAS,KAAA,CAA8B,KAAA;AAC7C,EAAA,IAAI,KAAA,KAAU,IAAA,IAAQ,OAAO,KAAA,KAAU,UAAU,OAAO,IAAA;AACxD,EAAA,OAAO,IAAA,IAAQ,QAAS,KAAA,GAAyB,IAAA;AACnD;AAcO,SAAS,eAAA,CACd,IAAA,GAAgC,EAAC,EACyE;AAC1G,EAAA,MAAM,QAAA,GAAW,KAAK,QAAA,IAAaC,oBAAAA;AAEnC,EAAA,OAAO,CAAC,MAAM,IAAA,KAAS;AACrB,IAAA,MAAM,KAAA,GAAQ,eAAe,IAAI,CAAA;AACjC,IAAA,IAAI,KAAA,KAAU,MAAM,OAAO,IAAA;AAC3B,IAAA,MAAM,IAAA,GAAO,IAAA,CAAK,CAAC,CAAA,EAAG,IAAA,IAAQ,IAAA;AAC9B,IAAA,IAAI,IAAA,KAAS,MAAM,OAAO,IAAA;AAE1B,IAAA,MAAM,CAAA,GAAI,OAAO,KAAA,CAAM,EAAA,KAAO,QAAA,GAAW,MAAM,EAAA,GAAK,KAAA,CAAM,KAAA,CAAM,EAAE,CAAA,IAAK,GAAA;AACvE,IAAA,MAAM,OAAA,GAAU,cAAA,CAAe,IAAA,EAAM,CAAC,CAAA;AACtC,IAAA,IAAI,OAAA,KAAY,MAAM,OAAO,IAAA;AAE7B,IAAA,MAAM,MAAA,GAAS,MAAM,MAAA,IAAU,CAAA;AAE/B,IAAA,MAAM,IAAI,OAAA,CAAQ,KAAA,CAAM,CAAA,GAAI,OAAA,CAAQ,QAAQ,CAAA,GAAI,MAAA;AAChD,IAAA,MAAM,IAAI,OAAA,CAAQ,KAAA,CAAM,CAAA,GAAI,OAAA,CAAQ,QAAQ,CAAA,GAAI,MAAA;AAEhD,IAAA,MAAM,MAAA,GAAS,QAAA,CAAS,SAAA,CAAU,IAAA,CAAK,IAAI,CAAA;AAC3C,IAAA,OAAO,0BAAA;AAAA,MACL,IAAA,CAAK,IAAA;AAAA,MACL,CAAA,IAAK,MAAA,CAAO,CAAA,GAAI,MAAA,CAAO,KAAA,GAAQ,CAAA,CAAA;AAAA,MAC/B,CAAA,IAAK,MAAA,CAAO,CAAA,GAAI,MAAA,CAAO,MAAA,GAAS,CAAA,CAAA;AAAA,MAChC;AAAA,KACF;AAAA,EACF,CAAA;AACF;AAGO,IAAM,aAAA,GAAgB;AAItB,IAAM,oBAAoB,eAAA;;;ACrB1B,IAAM,QAAA,GAAmB,CAAC,GAAA,KAAQ,CAAC,GAAA,CAAI,IAAA,CAAK,KAAA,EAAO,GAAG,GAAA,CAAI,SAAA,EAAW,GAAA,CAAI,EAAA,CAAG,KAAK;AAYjF,IAAM,UAAA,GAAqB,CAAC,GAAA,KAAQ;AACzC,EAAA,MAAM,KAAA,GAAQ,CAAC,GAAA,CAAI,IAAA,CAAK,KAAA,EAAO,GAAG,GAAA,CAAI,SAAA,EAAW,GAAA,CAAI,EAAA,CAAG,KAAK,CAAA;AAC7D,EAAA,MAAM,GAAA,GAAc,CAAC,KAAA,CAAM,CAAC,CAAE,CAAA;AAC9B,EAAA,KAAA,IAAS,CAAA,GAAI,CAAA,EAAG,CAAA,GAAI,KAAA,CAAM,QAAQ,CAAA,EAAA,EAAK;AACrC,IAAA,MAAM,CAAA,GAAI,GAAA,CAAI,GAAA,CAAI,MAAA,GAAS,CAAC,CAAA;AAC5B,IAAA,MAAM,CAAA,GAAI,MAAM,CAAC,CAAA;AACjB,IAAA,IAAI,EAAE,CAAA,KAAM,CAAA,CAAE,KAAK,CAAA,CAAE,CAAA,KAAM,EAAE,CAAA,EAAG;AAC9B,MAAA,GAAA,CAAI,KAAK,CAAC,CAAA;AACV,MAAA;AAAA,IACF;AAGA,IAAA,MAAM,kBAAkB,CAAA,KAAM,CAAA,GAC1B,YAAA,CAAa,GAAA,CAAI,KAAK,MAAM,CAAA,GAC5B,GAAA,CAAI,MAAA,GAAS,KAAK,GAAA,CAAI,GAAA,CAAI,SAAS,CAAC,CAAA,CAAG,MAAM,CAAA,CAAE,CAAA;AAGnD,IAAA,MAAM,WAAW,CAAA,KAAM,KAAA,CAAM,SAAS,CAAA,GAAI,GAAA,CAAI,GAAG,MAAA,GAAS,IAAA;AAC1D,IAAA,MAAM,mBAAmB,QAAA,IAAY,IAAA,GAAO,CAAC,eAAA,GAAkB,aAAa,QAAQ,CAAA;AACpF,IAAA,IAAI,oBAAoB,gBAAA,EAAkB;AACxC,MAAA,GAAA,CAAI,KAAK,eAAA,GAAkB,EAAE,CAAA,EAAG,CAAA,CAAE,GAAG,CAAA,EAAG,CAAA,CAAE,CAAA,EAAE,GAAI,EAAE,CAAA,EAAG,CAAA,CAAE,GAAG,CAAA,EAAG,CAAA,CAAE,GAAG,CAAA;AAClE,MAAA,GAAA,CAAI,KAAK,CAAC,CAAA;AACV,MAAA;AAAA,IACF;AACA,IAAA,IAAI,eAAA,EAAiB;AACnB,MAAA,MAAM,GAAA,GAAA,CAAO,CAAA,CAAE,CAAA,GAAI,CAAA,CAAE,CAAA,IAAK,CAAA;AAC1B,MAAA,GAAA,CAAI,IAAA,CAAK,EAAE,CAAA,EAAG,GAAA,EAAK,GAAG,CAAA,CAAE,CAAA,EAAE,EAAG,EAAE,GAAG,GAAA,EAAK,CAAA,EAAG,CAAA,CAAE,CAAA,IAAK,CAAC,CAAA;AAAA,IACpD,CAAA,MAAO;AACL,MAAA,MAAM,GAAA,GAAA,CAAO,CAAA,CAAE,CAAA,GAAI,CAAA,CAAE,CAAA,IAAK,CAAA;AAC1B,MAAA,GAAA,CAAI,IAAA,CAAK,EAAE,CAAA,EAAG,CAAA,CAAE,GAAG,CAAA,EAAG,GAAA,EAAI,EAAG,EAAE,GAAG,CAAA,CAAE,CAAA,EAAG,CAAA,EAAG,GAAA,IAAO,CAAC,CAAA;AAAA,IACpD;AAAA,EACF;AACA,EAAA,OAAO,GAAA;AACT;AAIA,SAAS,aAAa,MAAA,EAA0C;AAC9D,EAAA,OAAO,IAAA,CAAK,GAAA,CAAI,MAAA,EAAQ,CAAA,IAAK,CAAC,KAAK,IAAA,CAAK,GAAA,CAAI,MAAA,EAAQ,CAAA,IAAK,CAAC,CAAA;AAC5D;AAIA,IAAM,YAAA,GAAe,GAAA;AAWd,IAAM,MAAA,GAAiB,CAAC,GAAA,KAAQ;AACrC,EAAA,MAAM,KAAA,GAAQ,CAAC,GAAA,CAAI,IAAA,CAAK,KAAA,EAAO,GAAG,GAAA,CAAI,SAAA,EAAW,GAAA,CAAI,EAAA,CAAG,KAAK,CAAA;AAC7D,EAAA,MAAM,GAAA,GAAc,CAAC,KAAA,CAAM,CAAC,CAAE,CAAA;AAC9B,EAAA,KAAA,IAAS,CAAA,GAAI,CAAA,EAAG,CAAA,GAAI,KAAA,CAAM,QAAQ,CAAA,EAAA,EAAK;AACrC,IAAA,MAAM,CAAA,GAAI,KAAA,CAAM,CAAA,GAAI,CAAC,CAAA;AACrB,IAAA,MAAM,CAAA,GAAI,MAAM,CAAC,CAAA;AACjB,IAAA,MAAM,KAAA,GAAQ,IAAA,CAAK,KAAA,CAAM,CAAA,CAAE,CAAA,GAAI,CAAA,CAAE,CAAA,EAAG,CAAA,CAAE,CAAA,GAAI,CAAA,CAAE,CAAC,CAAA,GAAI,YAAA;AACjD,IAAA,MAAM,IAAA,GAAO,CAAA,KAAM,CAAA,GAAI,GAAA,CAAI,KAAK,MAAA,GAAS,IAAA;AACzC,IAAA,MAAM,MAAM,CAAA,KAAM,KAAA,CAAM,SAAS,CAAA,GAAI,GAAA,CAAI,GAAG,MAAA,GAAS,IAAA;AACrD,IAAA,MAAM,EAAA,GAAK,IAAA,KAAS,IAAA,IAAQ,IAAA,KAAS,SACjC,EAAE,CAAA,EAAG,CAAA,CAAE,CAAA,GAAA,CAAK,EAAE,CAAA,GAAI,CAAA,CAAE,CAAA,IAAK,YAAA,EAAc,GAAG,CAAA,CAAE,CAAA,GAAA,CAAK,CAAA,CAAE,CAAA,GAAI,EAAE,CAAA,IAAK,YAAA,EAAa,GAC3E,EAAE,GAAG,CAAA,CAAE,CAAA,GAAI,IAAA,CAAK,CAAA,GAAI,OAAO,CAAA,EAAG,CAAA,CAAE,CAAA,GAAI,IAAA,CAAK,IAAI,KAAA,EAAM;AACvD,IAAA,MAAM,EAAA,GAAK,GAAA,KAAQ,IAAA,IAAQ,GAAA,KAAQ,SAC/B,EAAE,CAAA,EAAG,CAAA,CAAE,CAAA,GAAA,CAAK,EAAE,CAAA,GAAI,CAAA,CAAE,CAAA,IAAK,YAAA,EAAc,GAAG,CAAA,CAAE,CAAA,GAAA,CAAK,CAAA,CAAE,CAAA,GAAI,EAAE,CAAA,IAAK,YAAA,EAAa,GAC3E,EAAE,GAAG,CAAA,CAAE,CAAA,GAAI,GAAA,CAAI,CAAA,GAAI,OAAO,CAAA,EAAG,CAAA,CAAE,CAAA,GAAI,GAAA,CAAI,IAAI,KAAA,EAAM;AACrD,IAAA,KAAA,IAAS,CAAA,GAAI,CAAA,EAAG,CAAA,IAAK,cAAA,EAAgB,CAAA,EAAA,EAAK;AACxC,MAAA,GAAA,CAAI,IAAA,CAAK,QAAQ,CAAA,EAAG,EAAA,EAAI,IAAI,CAAA,EAAG,CAAA,GAAI,cAAc,CAAC,CAAA;AAAA,IACpD;AAAA,EACF;AACA,EAAA,OAAO,GAAA;AACT;AAEA,IAAM,cAAA,GAAiB,EAAA;AAEvB,SAAS,OAAA,CAAQ,EAAA,EAAU,EAAA,EAAU,EAAA,EAAU,IAAU,CAAA,EAAiB;AACxE,EAAA,MAAM,IAAI,CAAA,GAAI,CAAA;AACd,EAAA,MAAM,CAAA,GAAI,IAAI,CAAA,GAAI,CAAA;AAClB,EAAA,MAAM,CAAA,GAAI,CAAA,GAAI,CAAA,GAAI,CAAA,GAAI,CAAA;AACtB,EAAA,MAAM,CAAA,GAAI,CAAA,GAAI,CAAA,GAAI,CAAA,GAAI,CAAA;AACtB,EAAA,MAAM,CAAA,GAAI,IAAI,CAAA,GAAI,CAAA;AAClB,EAAA,OAAO;AAAA,IACL,CAAA,EAAG,CAAA,GAAI,EAAA,CAAG,CAAA,GAAI,CAAA,GAAI,EAAA,CAAG,CAAA,GAAI,CAAA,GAAI,EAAA,CAAG,CAAA,GAAI,CAAA,GAAI,EAAA,CAAG,CAAA;AAAA,IAC3C,CAAA,EAAG,CAAA,GAAI,EAAA,CAAG,CAAA,GAAI,CAAA,GAAI,EAAA,CAAG,CAAA,GAAI,CAAA,GAAI,EAAA,CAAG,CAAA,GAAI,CAAA,GAAI,EAAA,CAAG;AAAA,GAC7C;AACF;AAGO,IAAM,OAAA,GAA4C,OAAO,MAAA,CAAO;AAAA,EACrE,QAAA;AAAA,EACA,UAAA;AAAA,EACA;AACF,CAAC;AAGM,SAAS,cAAc,IAAA,EAA6C;AACzE,EAAA,MAAM,OAAO,IAAA,CAAK,IAAA;AAClB,EAAA,IAAI,IAAA,KAAS,IAAA,IAAQ,OAAO,IAAA,KAAS,UAAU,OAAO,IAAA;AACtD,EAAA,MAAM,OAAQ,IAAA,CAA+B,OAAA;AAC7C,EAAA,IAAI,IAAA,KAAS,IAAA,IAAQ,OAAO,IAAA,KAAS,UAAU,OAAO,IAAA;AACtD,EAAA,OAAO,MAAA,IAAU,IAAA,IAAQ,IAAA,IAAQ,IAAA,GAAQ,IAAA,GAAuB,IAAA;AAClE;AAUO,SAAS,UAAA,CACd,GAAA,EACA,GAAA,EACA,MAAA,EACA,MACA,QAAA,EACkB;AAClB,EAAA,IAAI,GAAA,CAAI,SAAS,MAAA,EAAW;AAC1B,IAAA,MAAM,KAAA,GAAQ,OAAO,GAAA,CAAI,IAAA,EAAe,IAAI,IAAA,EAAM,GAAA,CAAI,MAAM,IAAI,CAAA;AAChE,IAAA,IAAI,KAAA,KAAU,QAAW,OAAO,KAAA;AAAA,EAClC;AACA,EAAA,IAAI,IAAA;AACJ,EAAA,IAAI,SAAA,GAAY,CAAA,QAAA;AAChB,EAAA,KAAA,MAAW,IAAA,IAAQ,QAAA,CAAS,GAAG,CAAA,EAAG;AAChC,IAAA,MAAM,EAAA,GAAK,MAAA,CAAO,CAAA,GAAI,IAAA,CAAK,KAAA,CAAM,CAAA;AACjC,IAAA,MAAM,EAAA,GAAK,MAAA,CAAO,CAAA,GAAI,IAAA,CAAK,KAAA,CAAM,CAAA;AACjC,IAAA,MAAM,GAAA,GAAM,IAAA,CAAK,KAAA,CAAM,EAAA,EAAI,EAAE,CAAA,IAAK,CAAA;AAElC,IAAA,MAAM,MAAA,GAAS,IAAA,CAAK,MAAA,KAAW,IAAA,GAC3B,CAAA,GAAA,CACC,IAAA,CAAK,MAAA,CAAO,CAAA,GAAI,EAAA,GAAK,IAAA,CAAK,MAAA,CAAO,CAAA,GAAI,EAAA,IAAM,GAAA;AAChD,IAAA,MAAM,KAAA,GAAQ,SAAS,GAAA,GAAM,GAAA;AAC7B,IAAA,IAAI,QAAQ,SAAA,EAAW;AACrB,MAAA,SAAA,GAAY,KAAA;AACZ,MAAA,IAAA,GAAO,IAAA;AAAA,IACT;AAAA,EACF;AACA,EAAA,OAAO,IAAA;AACT;AAeO,SAAS,cAAA,CACd,IAAA,GAAgC,EAAC,EAC2D;AAC5F,EAAA,MAAM,QAAA,GAAW,KAAK,QAAA,IAAaA,oBAAAA;AACnC,EAAA,MAAM,QAAA,GAAgC,EAAE,QAAA,EAAU,GAAI,IAAA,CAAK,IAAA,GAAO,EAAE,IAAA,EAAM,IAAA,CAAK,IAAA,EAAK,GAAI,EAAC,EAAG;AAC5F,EAAA,MAAM,QAAA,GAAW,CAAC,CAAA,KAChB,OAAA,CAAQ,EAAE,IAAA,EAAe,CAAA,CAAE,MAAM,QAAQ,CAAA;AAC3C,EAAA,MAAM,QAAA,GAAW,CAAC,CAAA,KAA+B;AAC/C,IAAA,MAAM,CAAA,GAAI,QAAA,CAAS,SAAA,CAAU,CAAA,CAAE,IAAI,CAAA;AACnC,IAAA,OAAO,EAAE,CAAA,EAAG,CAAA,CAAE,CAAA,GAAI,CAAA,CAAE,KAAA,GAAQ,CAAA,EAAG,CAAA,EAAG,CAAA,CAAE,CAAA,GAAI,CAAA,CAAE,MAAA,GAAS,CAAA,EAAE;AAAA,EACvD,CAAA;AAEA,EAAA,OAAO,CAAC,MAAM,IAAA,KAAS;AACrB,IAAA,MAAM,IAAA,GAAO,cAAc,IAAI,CAAA;AAC/B,IAAA,IAAI,IAAA,KAAS,MAAM,OAAO,IAAA;AAC1B,IAAA,MAAM,CAAC,OAAA,EAAS,KAAK,CAAA,GAAI,IAAA;AACzB,IAAA,IAAI,OAAA,KAAY,MAAA,IAAa,KAAA,KAAU,MAAA,EAAW,OAAO,IAAA;AAIzD,IAAA,MAAM,IAAA,GAAO,WAAW,IAAA,CAAK,IAAA,EAAM,SAAS,QAAA,CAAS,KAAK,CAAA,EAAG,QAAA,EAAU,QAAQ,CAAA;AAC/E,IAAA,MAAM,EAAA,GAAK,WAAW,IAAA,CAAK,EAAA,EAAI,OAAO,QAAA,CAAS,OAAO,CAAA,EAAG,QAAA,EAAU,QAAQ,CAAA;AAC3E,IAAA,IAAI,IAAA,KAAS,MAAA,IAAa,EAAA,KAAO,MAAA,EAAW,OAAO,IAAA;AAEnD,IAAA,MAAM,OAAA,GAAU,KAAK,OAAA,IAAW,OAAA;AAChC,IAAA,MAAM,SAAU,IAAA,CAAK,MAAA,KAAW,UAAa,OAAA,CAAQ,IAAA,CAAK,MAAM,CAAA,IAAM,QAAA;AACtE,IAAA,MAAM,MAAA,GAAS,MAAA,CAAO,EAAE,IAAA,EAAM,EAAA,EAAI,WAAW,IAAA,CAAK,SAAA,IAAa,EAAC,EAAG,CAAA;AACnE,IAAA,OAAO,MAAA,CAAO,MAAA,GAAS,CAAA,GAAI,IAAA,GAAO,mBAAmB,MAAoC,CAAA;AAAA,EAC3F,CAAA;AACF;AAGO,IAAM,YAAA,GAAe;AAKrB,IAAM,mBAAmB,cAAA;AAIzB,SAAS,mBAAA,CACd,QAAA,GAAiC,EAAC,EACZ;AACtB,EAAA,OAAO;AAAA,IACL,GAAG,QAAA;AAAA,IACH,UAAA,EAAY;AAAA,MACV,CAAC,YAAY,GAAG,gBAAA;AAAA,MAChB,GAAG,QAAA,CAAS;AAAA,KACd;AAAA,IACA,UAAA,EAAY;AAAA,MACV,CAAC,aAAa,GAAG,iBAAA;AAAA,MACjB,GAAG,QAAA,CAAS;AAAA;AACd,GACF;AACF;;;AChQO,IAAM,aAAA,GAAgB;AAKtB,IAAM,oBAAA,GAAuB,SAAS,aAAa,CAAA;AA+C1D,IAAM,cAAA,GAAiB,CAAA;AACvB,IAAM,eAAA,GAAkB,CAAA;AAGjB,SAAS,cAAc,GAAA,EAAmE;AAC/F,EAAA,MAAM,UAAU,GAAA,EAAK,OAAA;AACrB,EAAA,OAAO,YAAY,MAAA,IAAa,OAAO,OAAA,CAAQ,MAAA,KAAW,WAAW,OAAA,GAAU,IAAA;AACjF;AAOO,SAAS,oBAAA,CACd,YAAA,EACA,IAAA,GAAqC,EAAC,EAC1B;AACZ,EAAA,MAAM;AAAA,IACJ,EAAA,GAAK,aAAA;AAAA,IACL,WAAA,GAAc,cAAA;AAAA,IACd,MAAA,GAAS,eAAA;AAAA,IACT,QAAA,GAAW;AAAA,GACb,GAAI,IAAA;AACJ,EAAA,MAAM,QAAA,GAAW;AAAA,IACf,GAAI,KAAK,QAAA,GAAW,EAAE,UAAU,IAAA,CAAK,QAAA,KAAa,EAAC;AAAA,IACnD,GAAI,KAAK,IAAA,GAAO,EAAE,MAAM,IAAA,CAAK,IAAA,KAAS;AAAC,GACzC;AACA,EAAA,MAAM,KAAA,GAAQ,MAAA,IAAU,CAAA,GACpB,MAAA,GACA;AAAA,IACA,IAAA,EAAM,QAAA;AAAA,IACN,MAAA;AAAA,IACA,GAAI,KAAK,IAAA,GAAO,EAAE,MAAM,IAAA,CAAK,IAAA,KAAS,EAAC;AAAA,IACvC,GAAI,KAAK,MAAA,GAAS,EAAE,QAAQ,IAAA,CAAK,MAAA,KAAW;AAAC,GAC/C;AAEF,EAAA,OAAO;AAAA,IACL,EAAA;AAAA,IACA,QAAQ,KAAA,EAAiD;AACvD,MAAA,MAAM,MAA0B,EAAC;AACjC,MAAA,KAAA,MAAW,EAAE,IAAA,EAAM,IAAA,EAAK,IAAK,cAAa,EAAG;AAC3C,QAAA,IAAI,IAAA,CAAK,UAAU,MAAA,IAAa,CAAC,KAAK,KAAA,CAAM,IAAA,EAAM,KAAK,CAAA,EAAG;AAC1D,QAAA,KAAA,MAAW,IAAA,IAAQ,OAAA,CAAQ,IAAA,EAAM,IAAA,EAAM,QAAQ,CAAA,EAAG;AAChD,UAAA,GAAA,CAAI,IAAA,CAAK;AAAA,YACP,IAAI,CAAA,EAAG,IAAA,CAAK,EAAE,CAAA,CAAA,EAAI,KAAK,EAAE,CAAA,CAAA;AAAA,YACzB,QAAA,EAAU,IAAA;AAAA,YACV,KAAA,EAAO,EAAE,IAAA,EAAM,OAAA,EAAS,CAAA,EAAG,IAAA,CAAK,KAAA,CAAM,CAAA,EAAG,CAAA,EAAG,IAAA,CAAK,KAAA,CAAM,CAAA,EAAG,WAAA,EAAY;AAAA,YACtE,GAAI,KAAA,GAAQ,EAAE,KAAA,KAAU,EAAC;AAAA,YACzB,GAAI,KAAK,MAAA,KAAW,MAAA,GAAY,EAAE,MAAA,EAAQ,IAAA,CAAK,MAAA,EAAO,GAAI,EAAC;AAAA,YAC3D,QAAA;AAAA,YACA,YAAA,EAAc,CAAC,SAAS,CAAA;AAAA,YACxB,MAAM,OAAO;AAAA,cACX,cAAA,EAAgB;AAAA,gBACd,UAAU,IAAA,CAAK,EAAA;AAAA,gBACf,QAAQ,IAAA,CAAK,EAAA;AAAA,gBACb,QAAQ,IAAA,CAAK,EAAA;AAAA,gBACb;AAAA;AACF,aACF;AAAA,WACD,CAAA;AAAA,QACH;AAAA,MACF;AACA,MAAA,OAAO,GAAA;AAAA,IACT;AAAA,GACF;AACF;;;AC3GO,IAAM,iBAAA,GAAoB;AAwB1B,IAAM,iBAAA,GAAgC,CAAC,IAAA,EAAM,EAAA,KAAO;AACzD,EAAA,IAAI,IAAA,CAAK,WAAW,EAAA,CAAG,MAAA,IAAU,KAAK,EAAA,KAAO,EAAA,CAAG,IAAI,OAAO,KAAA;AAC3D,EAAA,IAAI,KAAK,IAAA,KAAS,MAAA,IAAa,EAAA,CAAG,IAAA,KAAS,QAAW,OAAO,IAAA;AAC7D,EAAA,OAAO,IAAA,CAAK,SAAS,EAAA,CAAG,IAAA;AAC1B;AAgCA,IAAM,YAAA,GAAe,EAAA;AAGd,IAAM,mBAAA,GAA8B;AAAA,EACzC,KAAA,EAAO,EAAE,KAAA,EAAO,SAAA,EAAU;AAAA,EAC1B,KAAA,EAAO,CAAA;AAAA,EACP,SAAA,EAAW;AACb;AACA,IAAM,cAAA,GAAiB,UAAA;AACvB,IAAM,cAAA,GAAyB,EAAE,KAAA,EAAO,EAAE,KAAA,EAAO,SAAA,EAAU,EAAG,KAAA,EAAO,CAAA,EAAG,IAAA,EAAM,CAAC,CAAA,EAAG,CAAC,CAAA,EAAE;AAoB9E,SAAS,cAAA,CAAe,WAAmB,iBAAA,EAAmC;AACnF,EAAA,OAAO;AAAA,IACL,MAAM,EAAE,IAAA,EAAM,QAAQ,MAAA,EAAQ,CAAA,WAAA,EAAc,oBAAoB,CAAA,CAAA,EAAG;AAAA,IACnE;AAAA,GACF;AACF;AAGO,IAAM,mBAAA,GAAsB;AAa5B,SAAS,cAAA,CAAe,KAAa,mBAAA,EAA6B;AACvE,EAAA,OAAO;AAAA,IACL,EAAA;AAAA,IACA,KAAA,EAAO,WAAA;AAAA,IACP,KAAA,EAAO,SAAA;AAAA,IACP,OAAA,EAAS,EAAE,MAAA,EAAQ,WAAA,EAAa,KAAK,MAAM;AAAA,IAAC,CAAA,EAAE;AAAA,IAC9C,SAAS,MAAM;AAAA,GACjB;AACF;AAGO,SAAS,gBAAA,CAAiB,WAAmB,mBAAA,EAAuC;AACzF,EAAA,OAAO;AAAA,IACL,EAAE,IAAA,EAAM,EAAE,IAAA,EAAM,aAAA,EAAe,QAAQ,CAAA,WAAA,EAAc,oBAAoB,CAAA,CAAA,EAAG,EAAG,QAAA,EAAS;AAAA,IACxF,EAAE,IAAA,EAAM,EAAE,IAAA,EAAM,OAAA,EAAS,QAAQ,CAAA,WAAA,EAAc,oBAAoB,CAAA,CAAA,EAAG,EAAG,QAAA;AAAS,GACpF;AACF;AAWO,SAAS,iBAAA,CAAkB,MAAmB,GAAA,EAA0B;AAC7E,EAAA,MAAM,KAAA,GAAQ,GAAA,CAAI,IAAA,CAAK,OAAO,CAAA;AAC9B,EAAA,IAAI,UAAU,MAAA,EAAW;AACzB,EAAA,MAAM,KAAA,GAAqB;AAAA,IACzB,IAAA,EAAM,EAAE,IAAA,EAAM,IAAA,CAAK,KAAK,EAAA,EAAG;AAAA,IAC3B,EAAA,EAAI,EAAE,IAAA,EAAM,IAAA,CAAK,GAAG,EAAA,EAAG;AAAA,IACvB,QAAQ,IAAA,CAAK;AAAA,GACf;AACA,EAAA,MAAM,MAAA,GAAS,KAAA,CAAM,GAAA,CAAI,IAAA,CAAK,KAAK,MAAe,CAAA;AAClD,EAAA,KAAA,CAAM,GAAA,CAAI;AAAA,IACR,IAAA,EAAM,MAAA;AAAA,IACN,OAAO,MAAA,EAAQ,KAAA,IAAS,KAAA,CAAM,MAAA,CAAO,CAAC,CAAA,CAAG,EAAA;AAAA,IACzC,IAAA,EAAM,EAAE,CAAA,EAAG,CAAA,EAAG,GAAG,CAAA,EAAG,KAAA,EAAO,CAAA,EAAG,MAAA,EAAQ,CAAA,EAAE;AAAA;AAAA;AAAA;AAAA,IAIxC,IAAA,EAAM,EAAE,OAAA,EAAS,KAAA,EAAO,QAAQ,mBAAA,EAAoB;AAAA,IACpD,WAAW,CAAC,IAAA,CAAK,KAAK,MAAA,EAAiB,IAAA,CAAK,GAAG,MAAe,CAAA;AAAA;AAAA;AAAA;AAAA,IAI9D,UAAA,EAAY;AAAA,GACb,CAAA;AACH;AAWO,SAAS,oBAA2B,IAAA,EAA2C;AACpF,EAAA,MAAM;AAAA,IACJ,EAAA,GAAK,iBAAA;AAAA,IACL,UAAA,GAAa,iBAAA;AAAA,IACb,UAAA,GAAa,YAAA;AAAA,IACb,QAAQ,SAAA,GAAY,cAAA;AAAA,IACpB,MAAA,GAAS,iBAAA;AAAA,IACT,MAAA,GAAS;AAAA,GACX,GAAI,IAAA;AACJ,EAAA,MAAM,OAAA,GAAU,KAAK,OAAA,IAAW,OAAA;AAChC,EAAA,MAAM,QAAA,GAAW;AAAA,IACf,GAAI,KAAK,QAAA,GAAW,EAAE,UAAU,IAAA,CAAK,QAAA,KAAa,EAAC;AAAA,IACnD,GAAI,KAAK,IAAA,GAAO,EAAE,MAAM,IAAA,CAAK,IAAA,KAAS;AAAC,GACzC;AACA,EAAA,MAAM,KAAA,GAAgB,QAAQ,SAAS,CAAA,IAAK,QAAQ,UAAU,CAAA,IAAK,QAAQ,UAAU,CAAA;AAOrF,EAAA,SAAS,UAAA,CAAW,MAAY,EAAA,EAAuB;AACrD,IAAA,IAAI,IAAA,GAAoB,IAAA;AACxB,IAAA,IAAI,SAAS,UAAA,GAAa,UAAA;AAC1B,IAAA,KAAA,MAAW,EAAE,IAAA,EAAM,IAAA,EAAK,IAAK,IAAA,CAAK,cAAa,EAAG;AAChD,MAAA,KAAA,MAAW,IAAA,IAAQ,OAAA,CAAQ,IAAA,EAAM,IAAA,EAAM,QAAQ,CAAA,EAAG;AAChD,QAAA,IAAI,CAAC,UAAA,CAAW,IAAA,EAAM,IAAI,CAAA,EAAG;AAC7B,QAAA,MAAM,EAAA,GAAA,CAAM,IAAA,CAAK,KAAA,CAAM,CAAA,GAAI,EAAA,CAAG,CAAA,KAAM,CAAA,GAAA,CAAK,IAAA,CAAK,KAAA,CAAM,CAAA,GAAI,EAAA,CAAG,CAAA,KAAM,CAAA;AACjE,QAAA,IAAI,MAAM,MAAA,EAAQ;AAChB,UAAA,MAAA,GAAS,EAAA;AACT,UAAA,IAAA,GAAO,IAAA;AAAA,QACT;AAAA,MACF;AAAA,IACF;AACA,IAAA,OAAO,IAAA;AAAA,EACT;AAIA,EAAA,SAAS,KAAA,CAAM,MAAY,EAAA,EAA4C;AACrE,IAAA,MAAM,IAAA,GAAO,UAAA,CAAW,IAAA,EAAM,EAAE,CAAA;AAChC,IAAA,OAAO;AAAA,MACL,IAAA;AAAA,MACA,GAAA,EAAK,IAAA,IAAQ,EAAE,EAAA,EAAI,EAAA,EAAI,QAAQ,EAAA,EAAI,KAAA,EAAO,EAAA,EAAI,MAAA,EAAQ,IAAA;AAAK,KAC7D;AAAA,EACF;AAEA,EAAA,OAAO;AAAA,IACL,EAAA;AAAA,IACA,KAAA,EAAO,SAAA;AAAA,IACP,KAAA,EAAO,SAAA;AAAA,IACP,QAAA,EAAU,CAAC,OAAO,CAAA;AAAA,IAClB,OAAA,EAAS;AAAA,MACP,MAAA,EAAQ,SAAA;AAAA,MACR,MAAM,GAAA,EAAmC;AACvC,QAAA,MAAM,OAAA,GAAU,aAAA,CAAc,GAAA,CAAI,IAAA,EAAM,UAAU,CAAA;AAIlD,QAAA,IAAI,OAAA,KAAY,IAAA,EAAM,OAAO,EAAC;AAC9B,QAAA,MAAM,OAAA,GAA0B;AAAA,UAC9B,MAAM,OAAA,CAAQ,IAAA;AAAA,UACd,OAAA,EAAS,EAAE,CAAA,EAAG,GAAA,CAAI,MAAM,CAAA,EAAG,CAAA,EAAG,GAAA,CAAI,KAAA,CAAM,CAAA,EAAE;AAAA,UAC1C,IAAA,EAAM,IAAA;AAAA,UACN,MAAM,GAAA,CAAI;AAAA,SACZ;AAEA,QAAA,OAAO;AAAA,UACL,IAAA,EAAM,iBAAA;AAAA,UACN,OAAO,OAAA,EAA8B;AACnC,YAAA,OAAA,CAAQ,OAAA,GAAU,EAAE,CAAA,EAAG,OAAA,CAAQ,MAAM,CAAA,EAAG,CAAA,EAAG,OAAA,CAAQ,KAAA,CAAM,CAAA,EAAE;AAAA,UAC7D,CAAA;AAAA,UACA,OAAA,GAAiC;AAC/B,YAAA,IAAI,CAAC,OAAA,CAAQ,IAAA,EAAM,OAAO,IAAA;AAC1B,YAAA,MAAM,EAAE,GAAA,EAAI,GAAI,MAAM,OAAA,CAAQ,IAAA,EAAM,QAAQ,OAAO,CAAA;AACnD,YAAA,MAAM,MAAA,GAAS,KAAA,CAAM,EAAE,IAAA,EAAM,OAAA,CAAQ,IAAA,EAAM,EAAA,EAAI,GAAA,EAAK,SAAA,EAAW,EAAC,EAAG,CAAA;AACnE,YAAA,IAAI,MAAA,CAAO,MAAA,GAAS,CAAA,EAAG,OAAO,IAAA;AAC9B,YAAA,MAAM,GAAA,GAAmB;AAAA,cACvB,IAAA,EAAM,MAAA;AAAA,cACN,IAAA,EAAMC,mBAAmB,MAAoC,CAAA;AAAA,cAC7D;AAAA,aACF;AACA,YAAA,OAAO,EAAE,MAAM,UAAA,EAAY,QAAA,EAAU,CAAC,GAAG,CAAA,EAAG,OAAO,OAAA,EAAQ;AAAA,UAC7D,CAAA;AAAA,UACA,KAAA,CAAM,QAAuB,MAAA,EAAmC;AAC9D,YAAA,OAAA,CAAQ,IAAA,GAAO,KAAA;AACf,YAAA,IAAI,WAAW,QAAA,EAAU;AACzB,YAAA,MAAM,EAAE,IAAA,EAAK,GAAI,KAAA,CAAM,QAAQ,IAAA,EAAM,EAAE,CAAA,EAAG,MAAA,CAAO,MAAM,CAAA,EAAG,CAAA,EAAG,MAAA,CAAO,KAAA,CAAM,GAAG,CAAA;AAC7E,YAAA,IAAI,SAAS,IAAA,EAAM;AAEnB,YAAA,MAAA;AAAA,cACE,EAAE,IAAA,EAAM,OAAA,CAAQ,MAAM,EAAA,EAAI,IAAA,EAAM,QAAQ,SAAA,EAAU;AAAA,cAClD,EAAE,GAAG,MAAA,EAAQ,IAAA,EAAM,QAAQ,IAAA;AAAK,aAClC;AAAA,UACF;AAAA,SACF;AAAA,MACF;AAAA,KACF;AAAA,IACA,SAAS,MAAM;AAAA,GACjB;AACF;AC/QO,SAAS,kBACd,KAAA,EACoB;AACpB,EAAA,OAAO,aAAa;AAClB,IAAA,KAAA,MAAW,IAAA,IAAQ,KAAA,CAAM,gBAAA,EAAiB,EAAG;AAC3C,MAAA,MAAM;AAAA,QACJ,IAAA;AAAA,QACA,IAAA,EAAM,aAAA,CAAc,KAAA,EAAgB,IAAa;AAAA,OACnD;AAAA,IACF;AAAA,EACF,CAAA;AACF;AAYO,SAAS,SAAA,CACd,YAAA,EACA,IAAA,GAAqC,EAAC,EAC4C;AAClF,EAAA,OAAO,sBAAA;AAAA,IACL,KAAK,EAAA,IAAM,aAAA;AAAA,IACX,eAAA;AAAA,IACA,CAAC,oBAAA,CAAqB,YAAA,EAAc,IAAI,CAAC;AAAA,GAC3C;AACF;;;AC5CO,SAAS,0BACd,IAAA,EACc;AACd,EAAA,MAAM,QAAA,GAAW,KAAK,EAAA,IAAM,iBAAA;AAC5B,EAAA,OAAO;AAAA,IACL,EAAA,EAAI,gBAAA;AAAA,IACJ,WAAA,EAAa,EAAE,OAAA,EAAS,IAAA,EAAK;AAAA,IAC7B,OAAA,EAAS,CAAC,mBAAA,CAAoB,EAAE,GAAG,IAAA,EAAM,EAAA,EAAI,QAAA,EAAU,CAAA,EAAG,cAAA,EAAgB,CAAA;AAAA,IAC1E,UAAU,CAAC,cAAA,CAAe,QAAQ,CAAA,EAAG,GAAG,kBAAkB;AAAA,GAC5D;AACF;AAUO,SAAS,aAAoB,IAAA,EAGlC;AACA,EAAA,OAAO;AAAA,IACL,KAAA,EAAO,SAAA,CAAU,IAAA,CAAK,YAAA,EAAc,IAAI,CAAA;AAAA,IACxC,YAAA,EAAc,0BAA0B,IAAI;AAAA,GAC9C;AACF;ACeO,SAAS,UAAA,CACd,MAAA,EACA,IAAA,GAAiC,EAAC,EAC3B;AACP,EAAA,MAAM,QAAA,GAAW,KAAK,QAAA,IAAaD,oBAAAA;AACnC,EAAA,MAAM,QAAqB,EAAC;AAC5B,EAAA,MAAM,IAAA,uBAAW,GAAA,EAAuB;AACxC,EAAA,MAAM,aAA0B,EAAC;AAEjC,EAAA,KAAA,MAAW,EAAE,IAAA,EAAM,IAAA,EAAK,IAAK,QAAO,EAAG;AACrC,IAAA,IAAI,aAAA,CAAc,IAAI,CAAA,KAAM,IAAA,EAAM;AAChC,MAAA,MAAM,OAAO,IAAA,CAAK,SAAA;AAClB,MAAA,IAAI,MAAM,OAAA,CAAQ,IAAI,CAAA,IAAK,IAAA,CAAK,WAAW,CAAA,EAAG;AAC5C,QAAA,UAAA,CAAW,IAAA,CAAK,EAAE,EAAA,EAAI,IAAA,CAAK,EAAA,EAAI,IAAA,EAAM,IAAA,CAAK,CAAC,CAAA,EAAI,EAAA,EAAI,IAAA,CAAK,CAAC,GAAI,CAAA;AAAA,MAC/D;AACA,MAAA;AAAA,IACF;AACA,IAAA,MAAM,KAAA,GAAQ,aAAA,CAAc,IAAA,EAAM,IAAA,CAAK,IAAI,CAAA;AAC3C,IAAA,IAAI,UAAU,IAAA,EAAM;AACpB,IAAA,MAAM,KAAA,GAAmB;AAAA,MACvB,IAAI,IAAA,CAAK,EAAA;AAAA,MACT,MAAA,EAAQ,QAAA,CAAS,SAAA,CAAU,IAAI,CAAA;AAAA,MAC/B,MAAA,EAAQ,MAAM,MAAA,KAAW;AAAA,KAC3B;AACA,IAAA,KAAA,CAAM,KAAK,KAAK,CAAA;AAChB,IAAA,IAAA,CAAK,GAAA,CAAI,KAAA,CAAM,EAAA,EAAI,KAAK,CAAA;AAAA,EAC1B;AAEA,EAAA,MAAM,KAAA,GAAQ,UAAA,CAAW,MAAA,CAAO,CAAC,MAAM,IAAA,CAAK,GAAA,CAAI,CAAA,CAAE,IAAI,CAAA,IAAK,IAAA,CAAK,GAAA,CAAI,CAAA,CAAE,EAAE,CAAC,CAAA;AACzE,EAAA,MAAM,GAAA,uBAAU,GAAA,EAAyB;AACzC,EAAA,MAAM,IAAA,uBAAW,GAAA,EAAyB;AAC1C,EAAA,KAAA,MAAW,QAAQ,KAAA,EAAO;AACxB,IAAA,IAAA,CAAK,GAAA,EAAK,IAAA,CAAK,IAAA,EAAM,IAAI,CAAA;AACzB,IAAA,IAAA,CAAK,IAAA,EAAM,IAAA,CAAK,EAAA,EAAI,IAAI,CAAA;AAAA,EAC1B;AAEA,EAAA,MAAM,IAAA,GAA6B,MAAA,CAAO,MAAA,CAAO,EAAE,CAAA;AACnD,EAAA,OAAO;AAAA,IACL,KAAA;AAAA,IACA,KAAA;AAAA,IACA,IAAA,EAAM,CAAC,EAAA,KAAO,IAAA,CAAK,IAAI,EAAE,CAAA;AAAA,IACzB,UAAU,CAAC,EAAA,KAAO,GAAA,CAAI,GAAA,CAAI,EAAE,CAAA,IAAK,IAAA;AAAA,IACjC,UAAU,CAAC,EAAA,KAAO,IAAA,CAAK,GAAA,CAAI,EAAE,CAAA,IAAK;AAAA,GACpC;AACF;AAEA,SAAS,IAAA,CAAK,KAAA,EAAiC,GAAA,EAAa,IAAA,EAAuB;AACjF,EAAA,MAAM,IAAA,GAAO,KAAA,CAAM,GAAA,CAAI,GAAG,CAAA;AAC1B,EAAA,IAAI,SAAS,MAAA,EAAW,KAAA,CAAM,IAAI,GAAA,EAAK,CAAC,IAAI,CAAC,CAAA;AAAA,OACxC,IAAA,CAAK,KAAK,IAAI,CAAA;AACrB;;;AC1EO,IAAM,gBAAA,GAAmB;AACzB,IAAM,gBAAA,GAAmB;AAChC,IAAM,iBAAA,GAAoB,IAAA;AAWnB,SAAS,OAAA,CAAQ,YAA6B,MAAA,EAAoB;AACvE,EAAA,QAAQ,SAAA;AAAW,IACjB,KAAK,IAAA;AACH,MAAA,OAAO,EAAE,IAAA,EAAM,GAAA,EAAK,KAAA,EAAO,GAAA,EAAK,MAAM,EAAA,EAAG;AAAA,IAC3C,KAAK,OAAA;AACH,MAAA,OAAO,EAAE,IAAA,EAAM,GAAA,EAAK,KAAA,EAAO,GAAA,EAAK,MAAM,CAAA,EAAE;AAAA,IAC1C,KAAK,MAAA;AACH,MAAA,OAAO,EAAE,IAAA,EAAM,GAAA,EAAK,KAAA,EAAO,GAAA,EAAK,MAAM,EAAA,EAAG;AAAA,IAC3C;AACE,MAAA,OAAO,EAAE,IAAA,EAAM,GAAA,EAAK,KAAA,EAAO,GAAA,EAAK,MAAM,CAAA,EAAE;AAAA;AAE9C;AAGO,SAAS,MAAA,CAAO,QAAgB,IAAA,EAAyB;AAC9D,EAAA,OAAO,IAAA,KAAS,GAAA,GAAM,MAAA,CAAO,KAAA,GAAQ,MAAA,CAAO,MAAA;AAC9C;AAGO,SAAS,MAAA,CAAO,QAAgB,IAAA,EAAyB;AAC9D,EAAA,OAAO,IAAA,KAAS,GAAA,GAAM,MAAA,CAAO,CAAA,GAAI,MAAA,CAAO,QAAQ,CAAA,GAAI,MAAA,CAAO,CAAA,GAAI,MAAA,CAAO,MAAA,GAAS,CAAA;AACjF;AAGO,SAAS,SAAA,CAAU,KAAA,EAAc,IAAA,GAAsB,EAAC,EAAgB;AAC7E,EAAA,MAAM,SAAS,IAAI,GAAA,CAAY,IAAA,CAAK,GAAA,IAAO,EAAE,CAAA;AAC7C,EAAA,KAAA,MAAW,IAAA,IAAQ,MAAM,KAAA,EAAO;AAC9B,IAAA,IAAI,IAAA,CAAK,MAAA,EAAQ,MAAA,CAAO,GAAA,CAAI,KAAK,EAAE,CAAA;AAAA,EACrC;AACA,EAAA,OAAO,MAAA;AACT;AAyBO,SAAS,MAAA,CACd,KAAA,EACA,KAAA,EACA,IAAA,GAAsB,EAAC,EACT;AACd,EAAA,MAAM,IAAA,GAAO,OAAA,CAAQ,IAAA,CAAK,SAAS,CAAA;AACnC,EAAA,MAAM,MAAA,GAAS,SAAA,CAAU,KAAA,EAAO,IAAI,CAAA;AACpC,EAAA,MAAM,SAAA,GAAY,KAAK,SAAA,IAAa,iBAAA;AAEpC,EAAA,MAAM,MAAA,uBAAa,GAAA,EAAkB;AACrC,EAAA,KAAA,MAAW,IAAA,IAAQ,MAAM,KAAA,EAAO;AAC9B,IAAA,MAAM,IAAA,GAAO,KAAA,CAAM,GAAA,CAAI,IAAA,CAAK,EAAE,CAAA;AAC9B,IAAA,IAAI,SAAS,MAAA,EAAW;AACxB,IAAA,MAAM,KAAA,GAAQ,IAAA,CAAK,IAAA,KAAS,CAAA,GAAI,IAAA,CAAK,IAAA,GAAO,EAAE,IAAA,CAAK,IAAA,GAAO,MAAA,CAAO,IAAA,CAAK,MAAA,EAAQ,KAAK,IAAI,CAAA,CAAA;AACvF,IAAA,MAAA,CAAO,GAAA;AAAA,MACL,IAAA,CAAK,EAAA;AAAA,MACL,IAAA,CAAK,IAAA,KAAS,GAAA,GAAM,EAAE,GAAG,IAAA,CAAK,KAAA,EAAO,CAAA,EAAG,KAAA,KAAU,EAAE,CAAA,EAAG,KAAA,EAAO,CAAA,EAAG,KAAK,KAAA;AAAM,KAC9E;AAAA,EACF;AAEA,EAAA,OAAO,UAAA,CAAW,KAAA,EAAO,MAAA,EAAQ,MAAA,EAAQ,SAAS,CAAA;AACpD;AAOO,SAAS,UAAA,CACd,KAAA,EACA,MAAA,EACA,MAAA,EACA,YAAY,iBAAA,EACE;AACd,EAAA,MAAM,MAAA,GAAS,WAAA,CAAY,KAAA,EAAO,MAAA,EAAQ,MAAM,CAAA;AAChD,EAAA,MAAM,GAAA,uBAAU,GAAA,EAAkB;AAClC,EAAA,KAAA,MAAW,IAAA,IAAQ,MAAM,KAAA,EAAO;AAC9B,IAAA,MAAM,EAAA,GAAK,MAAA,CAAO,GAAA,CAAI,IAAA,CAAK,EAAE,CAAA;AAC7B,IAAA,IAAI,OAAO,MAAA,IAAa,MAAA,CAAO,GAAA,CAAI,IAAA,CAAK,EAAE,CAAA,EAAG;AAC7C,IAAA,MAAM,CAAA,GAAI,EAAA,CAAG,CAAA,GAAI,MAAA,CAAO,CAAA;AACxB,IAAA,MAAM,CAAA,GAAI,EAAA,CAAG,CAAA,GAAI,MAAA,CAAO,CAAA;AACxB,IAAA,IAAI,IAAA,CAAK,GAAA,CAAI,CAAA,GAAI,IAAA,CAAK,OAAO,CAAC,CAAA,IAAK,SAAA,IAAa,IAAA,CAAK,IAAI,CAAA,GAAI,IAAA,CAAK,MAAA,CAAO,CAAC,KAAK,SAAA,EAAW;AACxF,MAAA;AAAA,IACF;AACA,IAAA,GAAA,CAAI,IAAI,IAAA,CAAK,EAAA,EAAI,EAAE,CAAA,EAAG,GAAG,CAAA;AAAA,EAC3B;AACA,EAAA,OAAO,GAAA;AACT;AAEA,SAAS,WAAA,CACP,KAAA,EACA,MAAA,EACA,MAAA,EACM;AACN,EAAA,KAAA,MAAW,IAAA,IAAQ,MAAM,KAAA,EAAO;AAC9B,IAAA,IAAI,CAAC,MAAA,CAAO,GAAA,CAAI,IAAA,CAAK,EAAE,CAAA,EAAG;AAC1B,IAAA,MAAM,EAAA,GAAK,MAAA,CAAO,GAAA,CAAI,IAAA,CAAK,EAAE,CAAA;AAC7B,IAAA,IAAI,EAAA,KAAO,MAAA,EAAW,OAAO,EAAE,GAAG,IAAA,CAAK,MAAA,CAAO,CAAA,GAAI,EAAA,CAAG,GAAG,CAAA,EAAG,IAAA,CAAK,MAAA,CAAO,CAAA,GAAI,GAAG,CAAA,EAAE;AAAA,EAClF;AACA,EAAA,IAAI,OAAA,GAAU,QAAA;AACd,EAAA,IAAI,OAAA,GAAU,QAAA;AACd,EAAA,IAAI,OAAA,GAAU,QAAA;AACd,EAAA,IAAI,OAAA,GAAU,QAAA;AACd,EAAA,KAAA,MAAW,IAAA,IAAQ,MAAM,KAAA,EAAO;AAC9B,IAAA,MAAM,EAAA,GAAK,MAAA,CAAO,GAAA,CAAI,IAAA,CAAK,EAAE,CAAA;AAC7B,IAAA,IAAI,OAAO,MAAA,EAAW;AACtB,IAAA,OAAA,GAAU,IAAA,CAAK,GAAA,CAAI,OAAA,EAAS,IAAA,CAAK,OAAO,CAAC,CAAA;AACzC,IAAA,OAAA,GAAU,IAAA,CAAK,GAAA,CAAI,OAAA,EAAS,IAAA,CAAK,OAAO,CAAC,CAAA;AACzC,IAAA,OAAA,GAAU,IAAA,CAAK,GAAA,CAAI,OAAA,EAAS,EAAA,CAAG,CAAC,CAAA;AAChC,IAAA,OAAA,GAAU,IAAA,CAAK,GAAA,CAAI,OAAA,EAAS,EAAA,CAAG,CAAC,CAAA;AAAA,EAClC;AACA,EAAA,IAAI,CAAC,MAAA,CAAO,QAAA,CAAS,OAAO,CAAA,SAAU,EAAE,CAAA,EAAG,CAAA,EAAG,CAAA,EAAG,CAAA,EAAE;AACnD,EAAA,OAAO,EAAE,CAAA,EAAG,OAAA,GAAU,OAAA,EAAS,CAAA,EAAG,UAAU,OAAA,EAAQ;AACtD;AASO,SAAS,UAAA,CACd,KAAA,EACA,IAAA,EACA,GAAA,EAC2C;AAC3C,EAAA,MAAM,EAAA,uBAAS,GAAA,EAAoB;AACnC,EAAA,IAAI,MAAA,GAAS,CAAA;AACb,EAAA,KAAA,MAAW,QAAQ,KAAA,EAAO;AACxB,IAAA,EAAA,CAAG,GAAA,CAAI,IAAA,CAAK,EAAA,EAAI,MAAM,CAAA;AACtB,IAAA,MAAA,IAAU,MAAA,CAAO,IAAA,CAAK,MAAA,EAAQ,IAAI,CAAA,GAAI,GAAA;AAAA,EACxC;AACA,EAAA,OAAO,EAAE,IAAI,IAAA,EAAM,KAAA,CAAM,WAAW,CAAA,GAAI,CAAA,GAAI,SAAS,GAAA,EAAI;AAC3D;AAKO,SAAS,WAAA,CACd,KAAA,EACA,IAAA,EACA,OAAA,EACa;AACb,EAAA,OAAO,CAAC,GAAG,KAAK,EAAE,IAAA,CAAK,CAAC,GAAG,CAAA,KAAM;AAC/B,IAAA,MAAM,CAAA,GAAI,OAAO,CAAA,CAAE,MAAA,EAAQ,IAAI,CAAA,GAAI,MAAA,CAAO,CAAA,CAAE,MAAA,EAAQ,IAAI,CAAA;AACxD,IAAA,OAAO,CAAA,KAAM,IAAI,CAAA,GAAI,OAAA,CAAQ,EAAE,EAAE,CAAA,GAAI,OAAA,CAAQ,CAAA,CAAE,EAAE,CAAA;AAAA,EACnD,CAAC,CAAA;AACH;AAGO,SAAS,WAAW,KAAA,EAAsC;AAC/D,EAAA,MAAM,KAAA,uBAAY,GAAA,EAAoB;AACtC,EAAA,KAAA,CAAM,KAAA,CAAM,OAAA,CAAQ,CAAC,IAAA,EAAM,CAAA,KAAM,MAAM,GAAA,CAAI,IAAA,CAAK,EAAA,EAAI,CAAC,CAAC,CAAA;AACtD,EAAA,OAAO,CAAC,EAAA,KAAO,KAAA,CAAM,GAAA,CAAI,EAAE,KAAK,MAAA,CAAO,gBAAA;AACzC;;;ACrLA,IAAM,QAAA,GAAW;AAAA,EACf,UAAA,EAAY,GAAA;AAAA,EACZ,YAAA,EAAc,GAAA;AAAA,EACd,YAAA,EAAc,IAAA;AAAA,EACd,MAAA,EAAQ,IAAA;AAAA,EACR,OAAA,EAAS,IAAA;AAAA,EACT,OAAA,EAAS;AACX,CAAA;AAIA,IAAM,SAAS,IAAA,CAAK,EAAA,IAAM,CAAA,GAAI,IAAA,CAAK,KAAK,CAAC,CAAA,CAAA;AAGzC,IAAM,KAAA,GAAQ,GAAA;AAGd,SAAS,MAAA,CAAO,QAAyB,QAAA,EAAyC;AAChF,EAAA,OAAO,CAAC,KAAA,KAAU;AAChB,IAAA,KAAA,IAAS,CAAA,GAAI,CAAA,EAAG,CAAA,GAAI,MAAA,CAAO,QAAQ,CAAA,EAAA,EAAK;AACtC,MAAA,MAAM,CAAA,GAAI,OAAO,CAAC,CAAA;AAClB,MAAA,KAAA,IAAS,IAAI,CAAA,GAAI,CAAA,EAAG,CAAA,GAAI,MAAA,CAAO,QAAQ,CAAA,EAAA,EAAK;AAC1C,QAAA,MAAM,CAAA,GAAI,OAAO,CAAC,CAAA;AAClB,QAAA,MAAM,EAAA,GAAK,CAAA,CAAE,CAAA,GAAI,CAAA,CAAE,CAAA;AACnB,QAAA,MAAM,EAAA,GAAK,CAAA,CAAE,CAAA,GAAI,CAAA,CAAE,CAAA;AACnB,QAAA,MAAM,EAAA,GAAK,EAAA,GAAK,EAAA,GAAK,EAAA,GAAK,EAAA;AAC1B,QAAA,IAAI,OAAO,CAAA,EAAG;AACd,QAAA,MAAM,CAAA,GAAK,WAAW,KAAA,GAAS,EAAA;AAC/B,QAAA,CAAA,CAAE,MAAO,EAAA,GAAK,CAAA;AACd,QAAA,CAAA,CAAE,MAAO,EAAA,GAAK,CAAA;AACd,QAAA,CAAA,CAAE,MAAO,EAAA,GAAK,CAAA;AACd,QAAA,CAAA,CAAE,MAAO,EAAA,GAAK,CAAA;AAAA,MAChB;AAAA,IACF;AAAA,EACF,CAAA;AACF;AAGA,SAAS,KAAA,CACP,MAAA,EACA,KAAA,EACA,QAAA,EACA,QAAA,EACuB;AACvB,EAAA,OAAO,CAAC,KAAA,KAAU;AAChB,IAAA,KAAA,MAAW,IAAA,IAAQ,MAAM,KAAA,EAAO;AAC9B,MAAA,MAAM,CAAA,GAAI,MAAA,CAAO,GAAA,CAAI,IAAA,CAAK,IAAI,CAAA;AAC9B,MAAA,MAAM,CAAA,GAAI,MAAA,CAAO,GAAA,CAAI,IAAA,CAAK,EAAE,CAAA;AAC5B,MAAA,IAAI,CAAA,KAAM,MAAA,IAAa,CAAA,KAAM,MAAA,IAAa,MAAM,CAAA,EAAG;AACnD,MAAA,MAAM,EAAA,GAAK,CAAA,CAAE,CAAA,GAAI,CAAA,CAAE,CAAA;AACnB,MAAA,MAAM,EAAA,GAAK,CAAA,CAAE,CAAA,GAAI,CAAA,CAAE,CAAA;AACnB,MAAA,MAAM,CAAA,GAAI,IAAA,CAAK,KAAA,CAAM,EAAA,EAAI,EAAE,CAAA;AAC3B,MAAA,IAAI,MAAM,CAAA,EAAG;AACb,MAAA,MAAM,IAAA,GAAA,CAAS,CAAA,GAAI,QAAA,IAAY,CAAA,GAAK,KAAA,GAAQ,QAAA;AAC5C,MAAA,CAAA,CAAE,MAAO,EAAA,GAAK,IAAA;AACd,MAAA,CAAA,CAAE,MAAO,EAAA,GAAK,IAAA;AACd,MAAA,CAAA,CAAE,MAAO,EAAA,GAAK,IAAA;AACd,MAAA,CAAA,CAAE,MAAO,EAAA,GAAK,IAAA;AAAA,IAChB;AAAA,EACF,CAAA;AACF;AAUA,SAAS,aAAA,CAAc,QAAyB,OAAA,EAAwC;AACtF,EAAA,OAAO,MAAM;AACX,IAAA,KAAA,IAAS,CAAA,GAAI,CAAA,EAAG,CAAA,GAAI,MAAA,CAAO,QAAQ,CAAA,EAAA,EAAK;AACtC,MAAA,MAAM,CAAA,GAAI,OAAO,CAAC,CAAA;AAClB,MAAA,KAAA,IAAS,IAAI,CAAA,GAAI,CAAA,EAAG,CAAA,GAAI,MAAA,CAAO,QAAQ,CAAA,EAAA,EAAK;AAC1C,QAAA,MAAM,CAAA,GAAI,OAAO,CAAC,CAAA;AAClB,QAAA,MAAM,EAAA,GAAK,CAAA,CAAE,CAAA,GAAI,CAAA,CAAE,CAAA;AACnB,QAAA,MAAM,EAAA,GAAK,CAAA,CAAE,CAAA,GAAI,CAAA,CAAE,CAAA;AACnB,QAAA,MAAM,IAAA,GAAO,EAAE,EAAA,GAAK,CAAA,CAAE,KAAK,OAAA,GAAU,IAAA,CAAK,IAAI,EAAE,CAAA;AAChD,QAAA,MAAM,IAAA,GAAO,EAAE,EAAA,GAAK,CAAA,CAAE,KAAK,OAAA,GAAU,IAAA,CAAK,IAAI,EAAE,CAAA;AAChD,QAAA,IAAI,IAAA,IAAQ,CAAA,IAAK,IAAA,IAAQ,CAAA,EAAG;AAC5B,QAAA,IAAI,OAAO,IAAA,EAAM;AACf,UAAA,MAAME,SAAQ,IAAA,CAAK,IAAA,CAAK,EAAE,CAAA,IAAK,KAAK,IAAA,GAAO,GAAA;AAC3C,UAAA,CAAA,CAAE,EAAA,IAAOA,KAAAA;AACT,UAAA,CAAA,CAAE,EAAA,IAAOA,KAAAA;AAAA,QACX,CAAA,MAAO;AACL,UAAA,MAAMA,SAAQ,IAAA,CAAK,IAAA,CAAK,EAAE,CAAA,IAAK,KAAK,IAAA,GAAO,GAAA;AAC3C,UAAA,CAAA,CAAE,EAAA,IAAOA,KAAAA;AACT,UAAA,CAAA,CAAE,EAAA,IAAOA,KAAAA;AAAA,QACX;AAAA,MACF;AAAA,IACF;AAAA,EACF,CAAA;AACF;AAIA,SAAS,OAAA,CAAQ,MAAA,EAAyB,EAAA,EAA8B,QAAA,EAAyC;AAC/G,EAAA,OAAO,CAAC,KAAA,KAAU;AAChB,IAAA,KAAA,MAAW,QAAQ,MAAA,EAAQ;AACzB,MAAA,IAAA,CAAK,EAAA,IAAA,CAAQ,EAAA,CAAG,CAAA,GAAI,IAAA,CAAK,KAAK,QAAA,GAAW,KAAA;AACzC,MAAA,IAAA,CAAK,EAAA,IAAA,CAAQ,EAAA,CAAG,CAAA,GAAI,IAAA,CAAK,KAAK,QAAA,GAAW,KAAA;AAAA,IAC3C;AAAA,EACF,CAAA;AACF;AAmBO,SAAS,eAAA,CAAgB,KAAA,EAAc,IAAA,GAAqB,EAAC,EAAoB;AACtF,EAAA,MAAM;AAAA,IACJ,eAAe,QAAA,CAAS,YAAA;AAAA,IACxB,eAAe,QAAA,CAAS,YAAA;AAAA,IACxB,MAAA,EAAQ,iBAAiB,QAAA,CAAS,MAAA;AAAA,IAClC,OAAA,EAAS,kBAAkB,QAAA,CAAS,OAAA;AAAA,IACpC,UAAU,QAAA,CAAS;AAAA,GACrB,GAAI,IAAA;AAEJ,EAAA,MAAM,MAAA,GAAS,SAAA,CAAU,KAAA,EAAO,IAAI,CAAA;AACpC,EAAA,MAAM,MAAA,GAAiB,KAAA,CAAM,KAAA,CAAM,GAAA,CAAI,CAAC,IAAA,KAAS;AAC/C,IAAA,MAAM,IAAA,GAAa;AAAA,MACjB,IAAI,IAAA,CAAK,EAAA;AAAA,MACT,CAAA,EAAG,MAAA,CAAO,IAAA,CAAK,MAAA,EAAQ,GAAG,CAAA;AAAA,MAC1B,CAAA,EAAG,MAAA,CAAO,IAAA,CAAK,MAAA,EAAQ,GAAG,CAAA;AAAA,MAC1B,EAAA,EAAI,IAAA,CAAK,MAAA,CAAO,KAAA,GAAQ,CAAA;AAAA,MACxB,EAAA,EAAI,IAAA,CAAK,MAAA,CAAO,MAAA,GAAS;AAAA,KAC3B;AAIA,IAAA,IAAI,MAAA,CAAO,GAAA,CAAI,IAAA,CAAK,EAAE,CAAA,EAAG;AACvB,MAAA,IAAA,CAAK,KAAK,IAAA,CAAK,CAAA;AACf,MAAA,IAAA,CAAK,KAAK,IAAA,CAAK,CAAA;AAAA,IACjB;AACA,IAAA,OAAO,IAAA;AAAA,EACT,CAAC,CAAA;AACD,EAAA,QAAA,CAAS,MAAM,CAAA;AAEf,EAAA,MAAM,IAAA,GAAO,IAAI,GAAA,CAAI,MAAA,CAAO,GAAA,CAAI,CAAC,CAAA,KAAM,CAAC,CAAA,CAAE,EAAA,EAAI,CAAC,CAAC,CAAC,CAAA;AACjD,EAAA,MAAM,QAAA,GAAW;AAAA,IACf,CAAA,EAAG,MAAA,CAAO,MAAA,CAAO,CAAC,GAAA,EAAK,CAAA,KAAM,GAAA,GAAM,CAAA,CAAE,CAAA,EAAG,CAAC,CAAA,GAAI,MAAA,CAAO,MAAA;AAAA,IACpD,CAAA,EAAG,MAAA,CAAO,MAAA,CAAO,CAAC,GAAA,EAAK,CAAA,KAAM,GAAA,GAAM,CAAA,CAAE,CAAA,EAAG,CAAC,CAAA,GAAI,MAAA,CAAO;AAAA,GACtD;AAEA,EAAA,MAAM,MAAM,gBAAA,CAAuB;AAAA,IACjC,KAAA,EAAO,MAAA;AAAA,IACP,MAAA,EAAQ;AAAA,MACN,MAAA,CAAO,QAAQ,cAAc,CAAA;AAAA,MAC7B,KAAA,CAAM,IAAA,EAAM,KAAA,EAAO,YAAA,EAAc,YAAY,CAAA;AAAA,MAC7C,OAAA,CAAQ,MAAA,EAAQ,QAAA,EAAU,eAAe,CAAA;AAAA,MACzC,aAAA,CAAc,QAAQ,OAAO;AAAA;AAC/B,GACD,CAAA;AAED,EAAA,OAAO;AAAA,IACL,MAAA;AAAA,IACA,IAAA;AAAA,IACA,MAAA;AAAA,IACA,GAAA;AAAA,IACA,MAAA,GAAS;AACP,MAAA,MAAM,MAAA,uBAAa,GAAA,EAAsC;AACzD,MAAA,KAAA,MAAW,IAAA,IAAQ,MAAM,KAAA,EAAO;AAC9B,QAAA,MAAM,IAAA,GAAO,IAAA,CAAK,GAAA,CAAI,IAAA,CAAK,EAAE,CAAA;AAC7B,QAAA,MAAA,CAAO,GAAA,CAAI,KAAK,EAAA,EAAI;AAAA,UAClB,CAAA,EAAG,IAAA,CAAK,CAAA,GAAI,IAAA,CAAK,OAAO,KAAA,GAAQ,CAAA;AAAA,UAChC,CAAA,EAAG,IAAA,CAAK,CAAA,GAAI,IAAA,CAAK,OAAO,MAAA,GAAS;AAAA,SAClC,CAAA;AAAA,MACH;AACA,MAAA,OAAO,MAAA;AAAA,IACT;AAAA,GACF;AACF;AAEO,IAAM,KAAA,GAAQ,CAAC,KAAA,EAAc,IAAA,GAAqB,EAAC,KAAoB;AAC5E,EAAA,IAAI,MAAM,KAAA,CAAM,MAAA,KAAW,CAAA,EAAG,2BAAW,GAAA,EAAI;AAC7C,EAAA,MAAM,UAAA,GAAa,eAAA,CAAgB,KAAA,EAAO,IAAI,CAAA;AAC9C,EAAA,UAAA,CAAW,GAAA,CAAI,IAAA,CAAK,IAAA,CAAK,UAAA,IAAc,SAAS,UAAU,CAAA;AAC1D,EAAA,OAAO,UAAA,CAAW,OAAO,UAAA,CAAW,MAAA,IAAU,UAAA,CAAW,MAAA,EAAQ,KAAK,SAAS,CAAA;AACjF;AASA,SAAS,SAAS,MAAA,EAAsB;AACtC,EAAA,MAAM,IAAA,uBAAW,GAAA,EAAoB;AACrC,EAAA,MAAA,CAAO,OAAA,CAAQ,CAAC,IAAA,EAAM,CAAA,KAAM;AAC1B,IAAA,MAAM,MAAM,CAAA,EAAG,IAAA,CAAK,CAAC,CAAA,CAAA,EAAI,KAAK,CAAC,CAAA,CAAA;AAC/B,IAAA,MAAM,GAAA,GAAM,IAAA,CAAK,GAAA,CAAI,GAAG,CAAA,IAAK,CAAA;AAC7B,IAAA,IAAA,CAAK,GAAA,CAAI,GAAA,EAAK,GAAA,GAAM,CAAC,CAAA;AACrB,IAAA,IAAI,QAAQ,CAAA,IAAK,IAAA,CAAK,MAAM,IAAA,IAAQ,IAAA,CAAK,MAAM,IAAA,EAAM;AACrD,IAAA,MAAM,QAAQ,MAAA,GAAS,CAAA;AACvB,IAAA,MAAM,SAAS,KAAA,GAAQ,GAAA;AACvB,IAAA,IAAA,CAAK,CAAA,IAAK,IAAA,CAAK,GAAA,CAAI,KAAK,CAAA,GAAI,MAAA;AAC5B,IAAA,IAAA,CAAK,CAAA,IAAK,IAAA,CAAK,GAAA,CAAI,KAAK,CAAA,GAAI,MAAA;AAAA,EAC9B,CAAC,CAAA;AACH;;;AC3OO,SAAS,UAAU,KAAA,EAA2B;AACnD,EAAA,MAAM,IAAA,uBAAW,GAAA,EAAY;AAC7B,EAAA,MAAM,IAAA,uBAAW,GAAA,EAAY;AAC7B,EAAA,MAAM,OAAA,uBAAc,GAAA,EAAY;AAEhC,EAAA,MAAM,IAAA,GAAO,CAAC,EAAA,KAAqB;AACjC,IAAA,IAAI,IAAA,CAAK,GAAA,CAAI,EAAE,CAAA,EAAG;AAClB,IAAA,OAAA,CAAQ,IAAI,EAAE,CAAA;AACd,IAAA,KAAA,MAAW,IAAA,IAAQ,KAAA,CAAM,QAAA,CAAS,EAAE,CAAA,EAAG;AACrC,MAAA,IAAI,OAAA,CAAQ,IAAI,IAAA,CAAK,EAAE,GAAG,IAAA,CAAK,GAAA,CAAI,KAAK,EAAE,CAAA;AAAA,WACrC,IAAA,CAAK,KAAK,EAAE,CAAA;AAAA,IACnB;AACA,IAAA,OAAA,CAAQ,OAAO,EAAE,CAAA;AACjB,IAAA,IAAA,CAAK,IAAI,EAAE,CAAA;AAAA,EACb,CAAA;AAEA,EAAA,KAAA,MAAW,IAAA,IAAQ,KAAA,CAAM,KAAA,EAAO,IAAA,CAAK,KAAK,EAAE,CAAA;AAC5C,EAAA,OAAO,IAAA;AACT;AAGO,SAAS,OAAA,CAAQ,OAAc,IAAA,EAAgD;AACpF,EAAA,MAAM,KAAA,uBAAY,GAAA,EAAoB;AACtC,EAAA,MAAM,SAAA,uBAAgB,GAAA,EAAY;AAElC,EAAA,MAAM,MAAA,GAAS,CAAC,EAAA,KAAuB;AACrC,IAAA,MAAM,KAAA,GAAQ,KAAA,CAAM,GAAA,CAAI,EAAE,CAAA;AAC1B,IAAA,IAAI,KAAA,KAAU,QAAW,OAAO,KAAA;AAGhC,IAAA,IAAI,SAAA,CAAU,GAAA,CAAI,EAAE,CAAA,EAAG,OAAO,CAAA;AAC9B,IAAA,SAAA,CAAU,IAAI,EAAE,CAAA;AAChB,IAAA,IAAI,IAAA,GAAO,CAAA;AACX,IAAA,KAAA,MAAW,IAAA,IAAQ,KAAA,CAAM,QAAA,CAAS,EAAE,CAAA,EAAG;AACrC,MAAA,IAAI,IAAA,CAAK,GAAA,CAAI,IAAA,CAAK,EAAE,CAAA,EAAG;AACvB,MAAA,IAAA,GAAO,KAAK,GAAA,CAAI,IAAA,EAAM,OAAO,IAAA,CAAK,IAAI,IAAI,CAAC,CAAA;AAAA,IAC7C;AACA,IAAA,SAAA,CAAU,OAAO,EAAE,CAAA;AACnB,IAAA,KAAA,CAAM,GAAA,CAAI,IAAI,IAAI,CAAA;AAClB,IAAA,OAAO,IAAA;AAAA,EACT,CAAA;AAEA,EAAA,KAAA,MAAW,IAAA,IAAQ,KAAA,CAAM,KAAA,EAAO,MAAA,CAAO,KAAK,EAAE,CAAA;AAC9C,EAAA,OAAO,KAAA;AACT;AAEO,IAAM,OAAA,GAAoB,CAAC,KAAA,EAAO,IAAA,GAAO,EAAC,KAAM;AACrD,EAAA,MAAM,IAAA,GAAO,OAAA,CAAQ,IAAA,CAAK,SAAS,CAAA;AACnC,EAAA,MAAM,OAAA,GAAU,KAAK,OAAA,IAAW,gBAAA;AAChC,EAAA,MAAM,OAAA,GAAU,KAAK,OAAA,IAAW,gBAAA;AAChC,EAAA,MAAM,KAAA,GAAQ,WAAW,KAAK,CAAA;AAE9B,EAAA,MAAM,KAAA,GAAQ,OAAA,CAAQ,KAAA,EAAO,SAAA,CAAU,KAAK,CAAC,CAAA;AAC7C,EAAA,MAAM,MAAA,uBAAa,GAAA,EAAyB;AAC5C,EAAA,KAAA,MAAW,IAAA,IAAQ,MAAM,KAAA,EAAO;AAC9B,IAAA,MAAM,IAAA,GAAO,KAAA,CAAM,GAAA,CAAI,IAAA,CAAK,EAAE,CAAA,IAAK,CAAA;AACnC,IAAA,MAAM,IAAA,GAAO,MAAA,CAAO,GAAA,CAAI,IAAI,CAAA;AAC5B,IAAA,IAAI,SAAS,MAAA,EAAW,MAAA,CAAO,IAAI,IAAA,EAAM,CAAC,IAAI,CAAC,CAAA;AAAA,SAC1C,IAAA,CAAK,KAAK,IAAI,CAAA;AAAA,EACrB;AAEA,EAAA,MAAM,IAAA,GAAO,CAAC,GAAG,MAAA,CAAO,IAAA,EAAM,CAAA,CAAE,IAAA,CAAK,CAAC,CAAA,EAAG,CAAA,KAAM,CAAA,GAAI,CAAC,CAAA;AACpD,EAAA,MAAM,MAAA,uBAAa,GAAA,EAA2C;AAC9D,EAAA,IAAI,MAAA,GAAS,CAAA;AACb,EAAA,KAAA,MAAW,QAAQ,IAAA,EAAM;AACvB,IAAA,MAAM,GAAA,GAAM,YAAY,MAAA,CAAO,GAAA,CAAI,IAAI,CAAA,EAAI,IAAA,CAAK,OAAO,KAAK,CAAA;AAC5D,IAAA,MAAM,CAAA,GAAI,UAAA,CAAW,GAAA,EAAK,IAAA,CAAK,OAAO,OAAO,CAAA;AAC7C,IAAA,MAAA,CAAO,GAAA,CAAI,MAAM,CAAC,CAAA;AAClB,IAAA,MAAA,GAAS,IAAA,CAAK,GAAA,CAAI,MAAA,EAAQ,CAAA,CAAE,IAAI,CAAA;AAAA,EAClC;AAEA,EAAA,MAAM,KAAA,uBAAY,GAAA,EAAkB;AACpC,EAAA,IAAI,KAAA,GAAQ,CAAA;AACZ,EAAA,KAAA,MAAW,QAAQ,IAAA,EAAM;AACvB,IAAA,MAAM,GAAA,GAAM,MAAA,CAAO,GAAA,CAAI,IAAI,CAAA;AAC3B,IAAA,MAAM,CAAA,GAAI,MAAA,CAAO,GAAA,CAAI,IAAI,CAAA;AACzB,IAAA,MAAM,MAAA,GAAA,CAAU,MAAA,GAAS,CAAA,CAAE,IAAA,IAAQ,CAAA;AACnC,IAAA,MAAM,KAAA,GAAQ,IAAA,CAAK,GAAA,CAAI,CAAA,EAAG,GAAG,GAAA,CAAI,GAAA,CAAI,CAAC,CAAA,KAAM,OAAO,CAAA,CAAE,MAAA,EAAQ,IAAA,CAAK,IAAI,CAAC,CAAC,CAAA;AACxE,IAAA,KAAA,MAAW,QAAQ,GAAA,EAAK;AACtB,MAAA,KAAA,CAAM,GAAA,CAAI,KAAK,EAAA,EAAI;AAAA,QACjB,OAAO,MAAA,GAAS,CAAA,CAAE,EAAA,CAAG,GAAA,CAAI,KAAK,EAAE,CAAA;AAAA;AAAA;AAAA,QAGhC,IAAA,EAAM,SAAS,KAAA,GAAQ,MAAA,CAAO,KAAK,MAAA,EAAQ,IAAA,CAAK,IAAI,CAAA,IAAK;AAAA,OAC1D,CAAA;AAAA,IACH;AACA,IAAA,KAAA,IAAS,KAAA,GAAQ,OAAA;AAAA,EACnB;AAEA,EAAA,OAAO,MAAA,CAAO,KAAA,EAAO,KAAA,EAAO,IAAI,CAAA;AAClC;;;ACnFO,SAAS,QAAA,CAAS,OAAc,SAAA,EAA8B;AACnE,EAAA,MAAM,KAAA,GAAQ,WAAW,KAAK,CAAA;AAC9B,EAAA,MAAM,QAAA,uBAAe,GAAA,EAAyB;AAC9C,EAAA,MAAM,KAAA,uBAAY,GAAA,EAAoB;AACtC,EAAA,MAAM,QAAqB,EAAC;AAE5B,EAAA,MAAM,KAAA,GAAQ,CAAC,IAAA,EAAiB,EAAA,KAAqB;AACnD,IAAA,KAAA,CAAM,GAAA,CAAI,IAAA,CAAK,EAAA,EAAI,EAAE,CAAA;AACrB,IAAA,MAAM,OAAoB,EAAC;AAC3B,IAAA,KAAA,MAAW,IAAA,IAAQ,KAAA,CAAM,QAAA,CAAS,IAAA,CAAK,EAAE,CAAA,EAAG;AAC1C,MAAA,IAAI,IAAA,CAAK,OAAO,IAAA,CAAK,EAAA,IAAM,MAAM,GAAA,CAAI,IAAA,CAAK,EAAE,CAAA,EAAG;AAC/C,MAAA,MAAM,KAAA,GAAQ,KAAA,CAAM,IAAA,CAAK,IAAA,CAAK,EAAE,CAAA;AAChC,MAAA,IAAI,UAAU,MAAA,EAAW;AAGzB,MAAA,KAAA,CAAM,GAAA,CAAI,KAAA,CAAM,EAAA,EAAI,EAAA,GAAK,CAAC,CAAA;AAC1B,MAAA,IAAA,CAAK,KAAK,KAAK,CAAA;AAAA,IACjB;AACA,IAAA,MAAM,OAAA,GAAU,WAAA,CAAY,IAAA,EAAM,SAAA,EAAW,KAAK,CAAA;AAClD,IAAA,QAAA,CAAS,GAAA,CAAI,IAAA,CAAK,EAAA,EAAI,OAAO,CAAA;AAC7B,IAAA,KAAA,MAAW,KAAA,IAAS,OAAA,EAAS,KAAA,CAAM,KAAA,EAAO,KAAK,CAAC,CAAA;AAAA,EAClD,CAAA;AAEA,EAAA,MAAM,UAAU,KAAA,CAAM,KAAA,CAAM,OAAO,CAAC,IAAA,KAClC,MAAM,QAAA,CAAS,IAAA,CAAK,EAAE,CAAA,CAAE,MAAM,CAAC,IAAA,KAAS,KAAK,IAAA,KAAS,IAAA,CAAK,EAAE,CAAC,CAAA;AAChE,EAAA,KAAA,MAAW,IAAA,IAAQ,WAAA,CAAY,OAAA,EAAS,SAAA,EAAW,KAAK,CAAA,EAAG;AACzD,IAAA,IAAI,KAAA,CAAM,GAAA,CAAI,IAAA,CAAK,EAAE,CAAA,EAAG;AACxB,IAAA,KAAA,CAAM,KAAK,IAAI,CAAA;AACf,IAAA,KAAA,CAAM,MAAM,CAAC,CAAA;AAAA,EACf;AAGA,EAAA,KAAA,MAAW,IAAA,IAAQ,MAAM,KAAA,EAAO;AAC9B,IAAA,IAAI,KAAA,CAAM,GAAA,CAAI,IAAA,CAAK,EAAE,CAAA,EAAG;AACxB,IAAA,KAAA,CAAM,KAAK,IAAI,CAAA;AACf,IAAA,KAAA,CAAM,MAAM,CAAC,CAAA;AAAA,EACf;AAEA,EAAA,OAAO,EAAE,KAAA,EAAO,QAAA,EAAU,KAAA,EAAM;AAClC;AAEO,IAAM,IAAA,GAAiB,CAAC,KAAA,EAAO,IAAA,GAAO,EAAC,KAAM;AAClD,EAAA,MAAM,IAAA,GAAO,OAAA,CAAQ,IAAA,CAAK,SAAS,CAAA;AACnC,EAAA,MAAM,OAAA,GAAU,KAAK,OAAA,IAAW,gBAAA;AAChC,EAAA,MAAM,OAAA,GAAU,KAAK,OAAA,IAAW,gBAAA;AAChC,EAAA,MAAM,EAAE,OAAO,QAAA,EAAU,KAAA,KAAU,QAAA,CAAS,KAAA,EAAO,KAAK,KAAK,CAAA;AAE7D,EAAA,MAAM,KAAA,uBAAY,GAAA,EAAoB;AACtC,EAAA,KAAA,MAAW,IAAA,IAAQ,MAAM,KAAA,EAAO;AAC9B,IAAA,MAAM,EAAA,GAAK,KAAA,CAAM,GAAA,CAAI,IAAA,CAAK,EAAE,CAAA,IAAK,CAAA;AACjC,IAAA,KAAA,CAAM,GAAA,CAAI,EAAA,EAAI,IAAA,CAAK,GAAA,CAAI,MAAM,GAAA,CAAI,EAAE,CAAA,IAAK,CAAA,EAAG,OAAO,IAAA,CAAK,MAAA,EAAQ,IAAA,CAAK,IAAI,CAAC,CAAC,CAAA;AAAA,EAC5E;AACA,EAAA,MAAM,SAAA,uBAAgB,GAAA,EAAoB;AAC1C,EAAA,IAAI,KAAA,GAAQ,CAAA;AACZ,EAAA,KAAA,MAAW,EAAA,IAAM,CAAC,GAAG,KAAA,CAAM,IAAA,EAAM,CAAA,CAAE,IAAA,CAAK,CAAC,CAAA,EAAG,CAAA,KAAM,CAAA,GAAI,CAAC,CAAA,EAAG;AACxD,IAAA,SAAA,CAAU,GAAA,CAAI,IAAI,KAAK,CAAA;AACvB,IAAA,KAAA,IAAS,KAAA,CAAM,GAAA,CAAI,EAAE,CAAA,GAAK,OAAA;AAAA,EAC5B;AAEA,EAAA,MAAM,KAAA,uBAAY,GAAA,EAAkB;AAIpC,EAAA,MAAM,QAAA,uBAAe,GAAA,EAAoB;AACzC,EAAA,MAAM,OAAA,GAAU,CAAC,IAAA,KAA4B;AAC3C,IAAA,MAAM,KAAA,GAAQ,QAAA,CAAS,GAAA,CAAI,IAAA,CAAK,EAAE,CAAA;AAClC,IAAA,IAAI,KAAA,KAAU,QAAW,OAAO,KAAA;AAChC,IAAA,MAAM,OAAO,QAAA,CAAS,GAAA,CAAI,IAAA,CAAK,EAAE,KAAK,EAAC;AACvC,IAAA,IAAI,KAAA,GAAQ,CAAA;AACZ,IAAA,KAAA,MAAW,KAAA,IAAS,IAAA,EAAM,KAAA,IAAS,OAAA,CAAQ,KAAK,CAAA;AAChD,IAAA,IAAI,KAAK,MAAA,GAAS,CAAA,EAAG,KAAA,IAAS,OAAA,IAAW,KAAK,MAAA,GAAS,CAAA,CAAA;AACvD,IAAA,MAAM,KAAA,GAAQ,KAAK,GAAA,CAAI,MAAA,CAAO,KAAK,MAAA,EAAQ,IAAA,CAAK,KAAK,CAAA,EAAG,KAAK,CAAA;AAC7D,IAAA,QAAA,CAAS,GAAA,CAAI,IAAA,CAAK,EAAA,EAAI,KAAK,CAAA;AAC3B,IAAA,OAAO,KAAA;AAAA,EACT,CAAA;AAGA,EAAA,MAAM,KAAA,GAAQ,CAAC,IAAA,EAAiB,IAAA,KAAuB;AACrD,IAAA,MAAM,OAAO,QAAA,CAAS,GAAA,CAAI,IAAA,CAAK,EAAE,KAAK,EAAC;AACvC,IAAA,MAAM,KAAA,GAAQ,QAAQ,IAAI,CAAA;AAC1B,IAAA,MAAM,QAAQ,IAAA,CAAK,MAAA,CAAO,CAAC,GAAA,EAAK,CAAA,KAAM,MAAM,OAAA,CAAQ,CAAC,CAAA,EAAG,CAAC,IACrD,IAAA,CAAK,GAAA,CAAI,GAAG,IAAA,CAAK,MAAA,GAAS,CAAC,CAAA,GAAI,OAAA;AAEnC,IAAA,IAAIC,OAAAA,GAAS,IAAA,GAAA,CAAQ,KAAA,GAAQ,KAAA,IAAS,CAAA;AACtC,IAAA,KAAA,MAAW,SAAS,IAAA,EAAM;AACxB,MAAA,KAAA,CAAM,OAAOA,OAAM,CAAA;AACnB,MAAAA,OAAAA,IAAU,OAAA,CAAQ,KAAK,CAAA,GAAI,OAAA;AAAA,IAC7B;AAEA,IAAA,MAAM,GAAA,GAAM,MAAA,CAAO,IAAA,CAAK,MAAA,EAAQ,KAAK,KAAK,CAAA;AAC1C,IAAA,MAAM,EAAA,GAAK,KAAA,CAAM,GAAA,CAAI,IAAA,CAAK,EAAE,CAAA,IAAK,CAAA;AACjC,IAAA,KAAA,CAAM,GAAA,CAAI,KAAK,EAAA,EAAI;AAAA,MACjB,KAAA,EAAO,IAAA,GAAA,CAAQ,KAAA,GAAQ,GAAA,IAAO,CAAA;AAAA,MAC9B,IAAA,EAAM,SAAA,CAAU,GAAA,CAAI,EAAE,KAAM,KAAA,CAAM,GAAA,CAAI,EAAE,CAAA,GAAK,MAAA,CAAO,IAAA,CAAK,MAAA,EAAQ,IAAA,CAAK,IAAI,CAAA,IAAK;AAAA,KAChF,CAAA;AAAA,EACH,CAAA;AAEA,EAAA,IAAI,MAAA,GAAS,CAAA;AACb,EAAA,KAAA,MAAW,QAAQ,KAAA,EAAO;AACxB,IAAA,KAAA,CAAM,MAAM,MAAM,CAAA;AAClB,IAAA,MAAA,IAAU,OAAA,CAAQ,IAAI,CAAA,GAAI,OAAA;AAAA,EAC5B;AAEA,EAAA,OAAO,MAAA,CAAO,KAAA,EAAO,KAAA,EAAO,IAAI,CAAA;AAClC;;;ACxHO,IAAM,OAAA,GAA8C,OAAO,MAAA,CAAO;AAAA,EACvE,OAAA;AAAA,EACA,IAAA;AAAA,EACA;AACF,CAAC;AAsBM,SAAS,WAAA,CACd,KAAA,EACA,MAAA,EACA,IAAA,GAAkC,EAAC,EAC3B;AACR,EAAA,MAAM,KAAA,GAAQ,WAAA,CAAY,KAAA,EAAO,MAAA,EAAQ,KAAK,QAAQ,CAAA;AACtD,EAAA,IAAI,KAAA,CAAM,IAAA,KAAS,CAAA,EAAG,OAAO,CAAA;AAC7B,EAAA,KAAA,CAAM,KAAA,CAAM,IAAA,CAAK,KAAA,IAAS,QAAA,EAAU,MAAM;AACxC,IAAA,KAAA,MAAW,CAAC,IAAI,IAAI,CAAA,IAAK,OAAO,KAAA,CAAM,OAAA,CAAQ,IAAa,IAAI,CAAA;AAAA,EACjE,CAAC,CAAA;AAGD,EAAA,IAAI,KAAA,GAAQ,CAAA;AACZ,EAAA,KAAA,MAAW,EAAA,IAAM,OAAO,IAAA,EAAK,MAAO,KAAA,CAAM,GAAA,CAAI,EAAE,CAAA,EAAG,KAAA,EAAA;AACnD,EAAA,OAAO,KAAA;AACT;AAWO,SAAS,WAAA,CACd,KAAA,EACA,MAAA,EACA,QAAA,GAAkCH,oBAAAA,EACd;AACpB,EAAA,MAAM,GAAA,uBAAU,GAAA,EAAmB;AACnC,EAAA,KAAA,MAAW,CAAC,EAAA,EAAI,EAAE,CAAA,IAAK,MAAA,EAAQ;AAC7B,IAAA,MAAM,IAAA,GAAO,KAAA,CAAM,GAAA,CAAI,EAAW,CAAA;AAClC,IAAA,IAAI,SAAS,MAAA,EAAW;AACxB,IAAA,MAAM,MAAA,GAAS,QAAA,CAAS,SAAA,CAAU,IAAA,CAAK,IAAI,CAAA;AAC3C,IAAA,MAAM,EAAA,GAAK,EAAA,CAAG,CAAA,GAAI,MAAA,CAAO,CAAA;AACzB,IAAA,MAAM,EAAA,GAAK,EAAA,CAAG,CAAA,GAAI,MAAA,CAAO,CAAA;AACzB,IAAA,IAAI,EAAA,KAAO,CAAA,IAAK,EAAA,KAAO,CAAA,EAAG;AAC1B,IAAA,GAAA,CAAI,GAAA,CAAI,IAAII,0BAAAA,CAA2B,IAAA,CAAK,MAAM,EAAA,EAAI,EAAA,EAAI,QAAQ,CAAC,CAAA;AACnE,IAAA,KAAA,MAAW,UAAA,IAAc,SAAA,CAAU,KAAA,EAAO,EAAE,CAAA,EAAG;AAC7C,MAAA,MAAM,KAAA,GAAQ,KAAA,CAAM,GAAA,CAAI,UAAmB,CAAA;AAC3C,MAAA,IAAI,UAAU,MAAA,EAAW;AACzB,MAAA,GAAA,CAAI,GAAA,CAAI,YAAYA,0BAAAA,CAA2B,KAAA,CAAM,MAAM,EAAA,EAAI,EAAA,EAAI,QAAQ,CAAC,CAAA;AAAA,IAC9E;AAAA,EACF;AACA,EAAA,OAAO,GAAA;AACT;AAEA,SAAS,SAAA,CAAiB,OAAsC,EAAA,EAAsB;AACpF,EAAA,MAAM,MAAgB,EAAC;AACvB,EAAA,MAAM,QAAQ,CAAC,GAAG,KAAA,CAAM,UAAA,CAAW,EAAW,CAAC,CAAA;AAC/C,EAAA,OAAO,KAAA,CAAM,SAAS,CAAA,EAAG;AACvB,IAAA,MAAM,IAAA,GAAO,MAAM,GAAA,EAAI;AACvB,IAAA,GAAA,CAAI,KAAK,IAAI,CAAA;AACb,IAAA,KAAA,CAAM,IAAA,CAAK,GAAG,KAAA,CAAM,UAAA,CAAW,IAAI,CAAC,CAAA;AAAA,EACtC;AACA,EAAA,OAAO,GAAA;AACT;AAGO,IAAM,gBAAA,GAAmB;AA0BzB,SAAS,mBAA0B,IAAA,EAA0C;AAClF,EAAA,MAAM,SAAA,GAAY,OAAO,IAAA,CAAK,SAAA,KAAc,UAAA,GACxC,IAAA,CAAK,SAAA,GACL,OAAA,CAAQ,IAAA,CAAK,SAAA,IAAa,SAAS,CAAA,IAAK,OAAA;AAC5C,EAAA,MAAM,KAAA,GAAQ;AAAA,IACZ,GAAI,KAAK,IAAA,GAAO,EAAE,MAAM,IAAA,CAAK,IAAA,KAAS,EAAC;AAAA,IACvC,GAAI,KAAK,QAAA,GAAW,EAAE,UAAU,IAAA,CAAK,QAAA,KAAa;AAAC,GACrD;AAEA,EAAA,OAAO;AAAA,IACL,EAAA,EAAI,KAAK,EAAA,IAAM,gBAAA;AAAA,IACf,KAAA,EAAO,KAAK,KAAA,IAAS,iBAAA;AAAA,IACrB,KAAA,EAAO,KAAK,KAAA,IAAS,SAAA;AAAA,IACrB,QAAA,EAAU,CAAC,OAAO,CAAA;AAAA,IAClB,OAAA,EAAS;AAAA,MACP,MAAA,EAAQ,WAAA;AAAA,MACR,GAAA,EAAK,CAAC,IAAA,KAAS;AACb,QAAA,MAAM,KAAA,GAAQ,KAAK,OAAO,CAAA;AAC1B,QAAA,IAAI,UAAU,MAAA,EAAW;AACzB,QAAA,MAAM,KAAA,GAAQ,UAAA,CAAW,IAAA,CAAK,MAAA,EAAQ,KAAK,CAAA;AAC3C,QAAA,WAAA,CAAY,KAAA,EAAO,SAAA,CAAU,KAAA,EAAO,IAAA,CAAK,MAAM,CAAA,EAAG;AAAA,UAChD,GAAI,KAAK,QAAA,GAAW,EAAE,UAAU,IAAA,CAAK,QAAA,KAAa,EAAC;AAAA,UACnD,GAAI,KAAK,KAAA,GAAQ,EAAE,OAAO,IAAA,CAAK,KAAA,KAAU;AAAC,SAC3C,CAAA;AAAA,MACH;AAAA,KACF;AAAA,IACA,SAAS,MAAM;AAAA,GACjB;AACF;;;AC7GA,IAAM,WAAA,GAAc,EAAA;AAIpB,IAAM,SAAA,GAAsB,CAAC,CAAA,KAAO,CAAA,GAAI,GAAA,GAAM,CAAA,GAAI,CAAA,GAAI,CAAA,GAAI,CAAA,GAAA,CAAK,EAAA,GAAK,CAAA,GAAI,CAAA,KAAM,CAAA,GAAI,CAAA;AAsB3E,SAAS,aAAA,CACd,KAAA,EACA,IAAA,GAAoC,EAAC,EACV;AAC3B,EAAA,MAAM,QAAA,GAAW,KAAK,QAAA,IAAaJ,oBAAAA;AACnC,EAAA,MAAM,UAAA,GAAa,eAAA,CAAgB,KAAA,EAAO,IAAI,CAAA;AAC9C,EAAA,MAAM,SAAA,GAAY,KAAK,SAAA,IAAa,GAAA;AAEpC,EAAA,OAAO,CAAC,EAAE,MAAA,EAAO,KAAM;AACrB,IAAA,KAAA,MAAW,IAAA,IAAQ,MAAM,KAAA,EAAO;AAC9B,MAAA,MAAM,IAAA,GAAO,UAAA,CAAW,IAAA,CAAK,GAAA,CAAI,KAAK,EAAE,CAAA;AACxC,MAAA,IAAI,SAAS,MAAA,EAAW;AACxB,MAAA,MAAM,IAAA,GAAO,MAAA,CAAO,GAAA,CAAI,IAAA,CAAK,EAAY,CAAA;AACzC,MAAA,IAAI,SAAS,MAAA,EAAW;AAGtB,QAAA,MAAM,MAAA,GAAS,QAAA,CAAS,SAAA,CAAU,IAAI,CAAA;AACtC,QAAA,IAAA,CAAK,EAAA,GAAK,MAAA,CAAO,MAAA,EAAQ,GAAG,CAAA;AAC5B,QAAA,IAAA,CAAK,EAAA,GAAK,MAAA,CAAO,MAAA,EAAQ,GAAG,CAAA;AAAA,MAC9B,WAAW,CAAC,UAAA,CAAW,OAAO,GAAA,CAAI,IAAA,CAAK,EAAE,CAAA,EAAG;AAC1C,QAAA,OAAO,IAAA,CAAK,EAAA;AACZ,QAAA,OAAO,IAAA,CAAK,EAAA;AAAA,MACd;AAAA,IACF;AAGA,IAAA,UAAA,CAAW,IAAI,WAAA,CAAY,MAAA,CAAO,IAAA,GAAO,CAAA,GAAI,YAAY,CAAC,CAAA;AAC1D,IAAA,UAAA,CAAW,IAAI,IAAA,EAAK;AACpB,IAAA,OAAO,EAAE,QAAQ,UAAA,CAAW,MAAA,IAAU,IAAA,EAAM,UAAA,CAAW,GAAA,CAAI,SAAA,EAAU,EAAE;AAAA,EACzE,CAAA;AACF;AAiBO,SAAS,aAAA,CACd,KAAA,EACA,SAAA,EACA,IAAA,GAA6B,EAAC,EACH;AAC3B,EAAA,MAAM,MAAA,GAAS,KAAK,MAAA,IAAU,WAAA;AAC9B,EAAA,MAAM,MAAA,GAAS,KAAK,MAAA,IAAU,SAAA;AAC9B,EAAA,MAAM,MAAA,GAAS,SAAA,CAAU,KAAA,EAAO,IAAA,CAAK,MAAM,CAAA;AAC3C,EAAA,MAAM,IAAA,uBAAW,GAAA,EAAsC;AACvD,EAAA,KAAA,MAAW,QAAQ,KAAA,CAAM,KAAA,EAAO,IAAA,CAAK,GAAA,CAAI,KAAK,EAAA,EAAI,EAAE,CAAA,EAAG,IAAA,CAAK,OAAO,CAAA,EAAG,CAAA,EAAG,IAAA,CAAK,MAAA,CAAO,GAAG,CAAA;AAExF,EAAA,OAAO,CAAC,EAAE,MAAA,EAAQ,KAAA,EAAM,KAAM;AAC5B,IAAA,MAAM,IAAI,IAAA,CAAK,GAAA,CAAA,CAAK,KAAA,GAAQ,CAAA,IAAK,QAAQ,CAAC,CAAA;AAC1C,IAAA,MAAM,CAAA,GAAI,OAAO,CAAC,CAAA;AAClB,IAAA,MAAM,MAAA,uBAAa,GAAA,EAAsC;AACzD,IAAA,KAAA,MAAW,CAAC,EAAA,EAAI,EAAE,CAAA,IAAK,MAAA,EAAQ;AAC7B,MAAA,IAAI,MAAA,CAAO,GAAA,CAAI,EAAY,CAAA,EAAG;AAC9B,MAAA,MAAM,KAAA,GAAQ,IAAA,CAAK,GAAA,CAAI,EAAE,CAAA;AACzB,MAAA,IAAI,UAAU,MAAA,EAAW;AACzB,MAAA,MAAA,CAAO,IAAI,EAAA,EAAI;AAAA,QACb,GAAG,KAAA,CAAM,CAAA,GAAA,CAAK,EAAA,CAAG,CAAA,GAAI,MAAM,CAAA,IAAK,CAAA;AAAA,QAChC,GAAG,KAAA,CAAM,CAAA,GAAA,CAAK,EAAA,CAAG,CAAA,GAAI,MAAM,CAAA,IAAK;AAAA,OACjC,CAAA;AAAA,IACH;AACA,IAAA,OAAO,EAAE,MAAA,EAAQ,IAAA,EAAM,CAAA,IAAK,CAAA,EAAE;AAAA,EAChC,CAAA;AACF;AA0CA,SAAS,QAAQ,KAAA,EAAsB;AACrC,EAAA,MAAM,KAAA,GAAQ,KAAA,CAAM,KAAA,CAAM,GAAA,CAAI,CAAC,CAAA,KAAM,CAAA,CAAE,EAAE,CAAA,CAAE,IAAA,EAAK,CAAE,IAAA,CAAK,GAAG,CAAA;AAC1D,EAAA,MAAM,QAAQ,KAAA,CAAM,KAAA,CAAM,GAAA,CAAI,CAAC,MAAM,CAAA,EAAG,CAAA,CAAE,IAAI,CAAA,CAAA,EAAI,EAAE,EAAE,CAAA,CAAE,EAAE,IAAA,EAAK,CAAE,KAAK,GAAG,CAAA;AACzE,EAAA,OAAO,CAAA,EAAG,KAAK,CAAA,CAAA,EAAI,KAAK,CAAA,CAAA;AAC1B;AASO,SAAS,cAAqB,IAAA,EAA+C;AAClF,EAAA,MAAM,OAAA,GAAU,OAAO,IAAI,CAAA;AAC3B,EAAA,OAAA,CAAQ,OAAA,GAAU,IAAA;AAElB,EAAA,MAAM,QAAA,GAAW,OAAyC,IAAI,CAAA;AAC9D,EAAA,MAAM,aAAA,GAAgB,OAAO,CAAC,CAAA;AAC9B,EAAA,MAAM,KAAA,GAAQ,OAAO,EAAE,CAAA;AAEvB,EAAA,MAAM,KAAA,GAAQ,YAAY,MAAY;AACpC,IAAA,MAAM,IAAI,OAAA,CAAQ,OAAA;AAClB,IAAA,MAAM,KAAA,GAAQ,UAAA,CAAW,CAAA,CAAE,MAAA,EAAQ;AAAA,MACjC,GAAI,EAAE,IAAA,GAAO,EAAE,MAAM,CAAA,CAAE,IAAA,KAAS,EAAC;AAAA,MACjC,GAAI,EAAE,QAAA,GAAW,EAAE,UAAU,CAAA,CAAE,QAAA,KAAa;AAAC,KAC9C,CAAA;AACD,IAAA,KAAA,CAAM,OAAA,GAAU,QAAQ,KAAK,CAAA;AAC7B,IAAA,aAAA,CAAc,OAAA,GAAU,CAAA;AACxB,IAAA,MAAM,SAAA,GAAY,EAAE,SAAA,IAAa,OAAA;AACjC,IAAA,IAAI,cAAc,OAAA,EAAS;AACzB,MAAA,QAAA,CAAS,OAAA,GAAU,cAAqB,KAAA,EAAO;AAAA,QAC7C,GAAG,CAAA,CAAE,MAAA;AAAA,QAAQ,GAAG,CAAA,CAAE,KAAA;AAAA,QAClB,GAAI,EAAE,QAAA,GAAW,EAAE,UAAU,CAAA,CAAE,QAAA,KAAa;AAAC,OAC9C,CAAA;AACD,MAAA;AAAA,IACF;AACA,IAAA,MAAM,KAAK,OAAO,SAAA,KAAc,aAAa,SAAA,GAAY,OAAA,CAAQ,SAAS,CAAA,IAAK,OAAA;AAC/E,IAAA,QAAA,CAAS,OAAA,GAAU,aAAA,CAAqB,KAAA,EAAO,EAAA,EAAI;AAAA,MACjD,GAAI,EAAE,MAAA,GAAS,EAAE,QAAQ,CAAA,CAAE,MAAA,KAAW,EAAC;AAAA,MACvC,GAAI,EAAE,MAAA,KAAW,MAAA,GAAY,EAAC,GAAI,EAAE,MAAA,EAAQ,CAAA,CAAE,MAAA,EAAO;AAAA,MACrD,GAAI,EAAE,MAAA,GAAS,EAAE,QAAQ,CAAA,CAAE,MAAA,KAAW;AAAC,KACxC,CAAA;AAAA,EACH,CAAA,EAAG,EAAE,CAAA;AAEL,EAAA,MAAM,IAAA,GAAO,WAAA,CAAY,CAAC,GAAA,KAA+C;AACvE,IAAA,MAAM,IAAI,OAAA,CAAQ,OAAA;AAClB,IAAA,IAAI,QAAA,CAAS,YAAY,IAAA,EAAM,OAAO,EAAE,KAAA,EAAO,EAAC,EAAG,IAAA,EAAM,IAAA,EAAK;AAC9D,IAAA,MAAM,EAAE,MAAA,EAAQ,IAAA,EAAK,GAAI,SAAS,OAAA,CAAQ;AAAA,MACxC,QAAQ,GAAA,CAAI,MAAA;AAAA,MACZ,OAAO,aAAA,CAAc,OAAA;AAAA,KACtB,CAAA;AAKD,IAAA,IAAI,MAAA,GAAS,MAAA;AACb,IAAA,IAAI,GAAA,CAAI,MAAA,CAAO,IAAA,GAAO,CAAA,EAAG;AACvB,MAAA,MAAM,IAAA,GAAO,IAAI,GAAA,CAAI,MAAM,CAAA;AAC3B,MAAA,KAAA,MAAW,MAAM,GAAA,CAAI,MAAA,CAAO,MAAK,EAAG,IAAA,CAAK,OAAO,EAAY,CAAA;AAC5D,MAAA,MAAA,GAAS,IAAA;AAAA,IACX;AACA,IAAA,MAAM,QAAQ,WAAA,CAAY,CAAA,CAAE,KAAA,EAAO,MAAA,EAAQ,EAAE,QAAQ,CAAA;AACrD,IAAA,OAAO,EAAE,KAAA,EAAO,CAAC,GAAG,KAAK,GAAwB,IAAA,EAAK;AAAA,EACxD,CAAA,EAAG,EAAE,CAAA;AAEL,EAAA,MAAM,MAAM,UAAA,CAAkB;AAAA,IAC5B,OAAO,IAAA,CAAK,KAAA;AAAA,IACZ,IAAA;AAAA,IACA,UAAU,CAAC,KAAA,KAAU,OAAA,CAAQ,OAAA,CAAQ,WAAW,KAAK,CAAA;AAAA,IACrD,GAAI,KAAK,KAAA,GAAQ,EAAE,OAAO,IAAA,CAAK,KAAA,KAAU,EAAC;AAAA,IAC1C,GAAI,KAAK,YAAA,GAAe,EAAE,cAAc,IAAA,CAAK,YAAA,KAAiB,EAAC;AAAA,IAC/D,GAAI,KAAK,WAAA,GAAc,EAAE,aAAa,IAAA,CAAK,WAAA,KAAgB;AAAC,GAC7D,CAAA;AAID,EAAA,SAAA,CAAU,MAAM;AACd,IAAA,IAAI,IAAA,CAAK,wBAAwB,KAAA,EAAO;AACxC,IAAA,OAAO,IAAA,CAAK,KAAA,CAAM,SAAA,CAAU,MAAM;AAChC,MAAA,IAAI,CAAC,GAAA,CAAI,SAAA,EAAU,EAAG;AACtB,MAAA,MAAM,IAAI,OAAA,CAAQ,OAAA;AAClB,MAAA,MAAM,KAAA,GAAQ,UAAA,CAAW,CAAA,CAAE,MAAA,EAAQ;AAAA,QACjC,GAAI,EAAE,IAAA,GAAO,EAAE,MAAM,CAAA,CAAE,IAAA,KAAS,EAAC;AAAA,QACjC,GAAI,EAAE,QAAA,GAAW,EAAE,UAAU,CAAA,CAAE,QAAA,KAAa;AAAC,OAC9C,CAAA;AACD,MAAA,IAAI,OAAA,CAAQ,KAAK,CAAA,KAAM,KAAA,CAAM,OAAA,EAAS;AACtC,MAAA,KAAA,EAAM;AAAA,IACR,CAAC,CAAA;AAAA,EAEH,CAAA,EAAG,CAAC,IAAA,CAAK,KAAA,EAAO,KAAK,mBAAA,EAAqB,GAAA,EAAK,KAAK,CAAC,CAAA;AAErD,EAAA,OAAO,QAAoB,OAAO;AAAA,IAChC,KAAA,GAAQ;AACN,MAAA,IAAI,GAAA,CAAI,WAAU,EAAG;AACrB,MAAA,KAAA,EAAM;AACN,MAAA,GAAA,CAAI,KAAA,EAAM;AAAA,IACZ,CAAA;AAAA,IACA,MAAM,MAAM;AAAE,MAAA,GAAA,CAAI,IAAA,EAAK;AAAA,IAAG,CAAA;AAAA,IAC1B,QAAQ,MAAM;AAAE,MAAA,GAAA,CAAI,MAAA,EAAO;AAAA,IAAG,CAAA;AAAA,IAC9B,OAAA,GAAU;AACR,MAAA,GAAA,CAAI,MAAA,EAAO;AACX,MAAA,KAAA,EAAM;AACN,MAAA,GAAA,CAAI,KAAA,EAAM;AAAA,IACZ,CAAA;AAAA,IACA,SAAA,EAAW,MAAM,GAAA,CAAI,SAAA;AAAU,GACjC,CAAA,EAAI,CAAC,GAAA,EAAK,KAAK,CAAC,CAAA;AAClB;AAGO,IAAM,aAAA,GAAoD,OAAO,MAAA,CAAO;AAAA,EAC7E,OAAA;AAAA,EACA;AACF,CAAC;AChRM,SAAS,YAAA,CACd,IAAA,GAAmC,EAAC,EACJ;AAChC,EAAA,MAAM,QAAA,GAAW,KAAK,QAAA,IAAa,oBAAA;AACnC,EAAA,MAAM,YAAY,CAAC,IAAA,KACjB,cAAc,IAAA,EAAM,IAAA,CAAK,IAAI,CAAA,EAAG,OAAA;AAElC,EAAA,OAAO;AAAA,IACL,EAAA,EAAI,KAAK,EAAA,IAAM,iBAAA;AAAA,IACf,OAAA,EAAS,CAAC,IAAA,KAAS,SAAA,CAAU,IAAI,CAAA,KAAM,MAAA;AAAA,IACvC,KAAA,EAAO,CAAC,IAAA,EAAM,IAAA,KAAS;AACrB,MAAA,MAAM,OAAA,GAAU,UAAU,IAAI,CAAA;AAC9B,MAAA,IAAI,OAAA,KAAY,MAAA,EAAW,OAAO,EAAC;AACnC,MAAA,MAAM,IAAI,IAAA,CAAK,IAAA;AACf,MAAA,MAAM,OAAO,CAAA,CAAE,IAAA,KAAS,MAAA,GAAY,IAAA,CAAK,cAAc,CAAA,CAAE,IAAA;AACzD,MAAA,MAAM,SAAS,CAAA,CAAE,MAAA,KAAW,MAAA,GAAY,IAAA,CAAK,gBAAgB,CAAA,CAAE,MAAA;AAC/D,MAAA,OAAO,CAAC;AAAA,QACN,IAAA,EAAM,MAAA;AAAA,QACN,MAAM,WAAA,CAAY,OAAA,EAAS,QAAA,CAAS,SAAA,CAAU,IAAI,CAAC,CAAA;AAAA,QACnD,GAAI,IAAA,GAAO,EAAE,IAAA,KAAS,EAAC;AAAA,QACvB,GAAI,MAAA,GAAS,EAAE,MAAA,KAAW;AAAC,OAC5B,CAAA;AAAA,IACH,CAAA;AAAA;AAAA;AAAA,IAGA,UAAA,EAAY,CAAC,IAAA,EAAM,IAAA,KAAS;AAC1B,MAAA,MAAM,OAAA,GAAU,UAAU,IAAI,CAAA;AAC9B,MAAA,OAAO,OAAA,KAAY,SAAY,IAAA,GAAO,WAAA,CAAY,SAAS,QAAA,CAAS,SAAA,CAAU,IAAI,CAAC,CAAA;AAAA,IACrF;AAAA,GACF;AACF;AAOO,SAAS,oBAAA,CAA4B,IAAA,GAAmC,EAAC,EAAe;AAC7F,EAAA,OAAO,kBAAkB,YAAA,CAAa,IAAI,GAAG,EAAE,QAAA,EAAU,QAAQ,CAAA;AACnE","file":"index.js","sourcesContent":["/*\n The shapes a built body can wear, as paths in the node's bounds.\n \n These are the flowchart vocabulary — a decision is a diamond, an I/O step a\n * parallelogram, a terminator a stadium — plus `'rect'` for everything else and\n * a `Path` escape hatch for a shape the vocabulary does not have. The path is\n * built in world coordinates from the bounds it is given, the same way the\n * kit's own `clipFromPose` factories are.\n /\nimport { PathBuilder, polygonFromPoints, rectPath, type Path } from '@weasel-js/core';\n\n/* An axis-aligned box, in the shape `PoseProjection.getBounds` returns. /\nexport interface Bounds {\n x: number;\n y: number;\n width: number;\n height: number;\n}\n\n/* A named flowchart shape, or a path a consumer built themselves. /\nexport type Outline = 'rect' \| 'diamond' \| 'stadium' \| 'parallelogram' \| Path;\n\n/* How far a parallelogram's top edge leans past its bottom one, as a\n * fraction of the box's width. The flowchart convention. /\nconst LEAN = 0.2;\n\n/* Cubic approximation of a quarter circle. A stadium's ends are two of these\n * each, which is the same construction `ellipsePath` uses. /\nconst KAPPA = 0.5522847498307936;\n\n/* The path `outline` describes inside `bounds`. A zero-area box gives a\n * zero-area rect rather than a degenerate polygon. /\nexport function outlinePath(outline: Outline, bounds: Bounds): Path {\n if (typeof outline !== 'string') return outline;\n const { x, y, width: w, height: h } = bounds;\n if (w <= 0 \|\| h <= 0) return rectPath(x, y, Math.max(w, 0), Math.max(h, 0));\n\n switch (outline) {\n case 'rect':\n return rectPath(x, y, w, h);\n\n case 'diamond':\n return polygonFromPoints([\n { x: x + w / 2, y },\n { x: x + w, y: y + h / 2 },\n { x: x + w / 2, y: y + h },\n { x, y: y + h / 2 },\n ]);\n\n case 'parallelogram': {\n // The lean is clamped so a narrow box cannot fold through itself.\n const lean = Math.min(w LEAN, w / 2);\n return polygonFromPoints([\n { x: x + lean, y },\n { x: x + w, y },\n { x: x + w - lean, y: y + h },\n { x, y: y + h },\n ]);\n }\n\n case 'stadium':\n return stadiumPath(x, y, w, h);\n }\n}\n\n/** A rect with semicircular ends — the Minkowski sum of a segment and a disc,\n * which puts the flat edges along the box's longer axis. A tall box is a\n * pill standing up, not an ellipse. /\nfunction stadiumPath(x: number, y: number, w: number, h: number): Path {\n const r = Math.min(w, h) / 2;\n const k = r KAPPA;\n const b = new PathBuilder();\n\n if (w >= h) {\n const left = x + r;\n const right = x + w - r;\n const top = y;\n const bottom = y + h;\n const midY = y + h / 2;\n return b\n .moveTo(left, top)\n .lineTo(right, top)\n .curveTo(right + k, top, x + w, midY - k, x + w, midY)\n .curveTo(x + w, midY + k, right + k, bottom, right, bottom)\n .lineTo(left, bottom)\n .curveTo(left - k, bottom, x, midY + k, x, midY)\n .curveTo(x, midY - k, left - k, top, left, top)\n .close()\n .build();\n }\n\n const top = y + r;\n const bottom = y + h - r;\n const left = x;\n const right = x + w;\n const midX = x + w / 2;\n return b\n .moveTo(right, top)\n .lineTo(right, bottom)\n .curveTo(right, bottom + k, midX + k, y + h, midX, y + h)\n .curveTo(midX - k, y + h, left, bottom + k, left, bottom)\n .lineTo(left, top)\n .curveTo(left, top - k, midX - k, y, midX, y)\n .curveTo(midX + k, y, right, top - k, right, top)\n .close()\n .build();\n}\n\n/*\n The largest axis-aligned box a shape's content can occupy without leaving\n * the shape. Rows lay out in here, not in the bounds — a diamond's corners and\n * a parallelogram's lean are outside its own box, and a label placed against\n * the bounding box lands there and gets clipped away by the silhouette.\n \n Conservative rather than exact: the inscribed rect of a rhombus is exact,\n * and a stadium reports the flat span between its rounded ends, which gives up\n * a little height near them.\n /\nexport function contentBox(outline: Outline, bounds: Bounds): Bounds {\n if (typeof outline !== 'string') return bounds;\n const { x, y, width: w, height: h } = bounds;\n switch (outline) {\n case 'rect':\n return bounds;\n case 'diamond':\n // Half the width and half the height, centered — the inscribed rect.\n return { x: x + w / 4, y: y + h / 4, width: w / 2, height: h / 2 };\n case 'parallelogram': {\n const lean = Math.min(w LEAN, w / 2);\n return { x: x + lean, y, width: Math.max(w - lean * 2, 0), height: h };\n }\n case 'stadium': {\n const r = Math.min(w, h) / 2;\n return w >= h\n ? { x: x + r, y, width: Math.max(w - r * 2, 0), height: h }\n : { x, y: y + r, width: w, height: Math.max(h - r * 2, 0) };\n }\n }\n}\n\n/*\n The box whose {@link contentBox} is at least `content` — the inverse, for\n * sizing a node to what its rows measured.\n \n The stadium case is the only inexact one: its inset depends on the height it\n * is solving for, so it assumes the wide orientation and adds one height's\n * worth of end caps.\n /\nexport function boxForContent(\n outline: Outline,\n content: { width: number; height: number },\n): { width: number; height: number } {\n if (typeof outline !== 'string') return content;\n switch (outline) {\n case 'rect':\n return content;\n case 'diamond':\n return { width: content.width 2, height: content.height * 2 };\n case 'parallelogram':\n return { width: content.width / (1 - LEAN * 2), height: content.height };\n case 'stadium':\n return { width: content.width + content.height, height: content.height };\n }\n}\n","/*\n Moving a port from the node's bounding box onto the shape it is drawn as.\n \n A port is placed as a fraction of the node's bounds, which is what makes it\n * survive a resize. For a rect that is already on the outline; for anything\n * else it can be well outside the ink — a parallelogram's west port floats in\n * the gap beside its leaning edge, and an edge that ends there ends in empty\n * space. So the point is cast back onto the outline along the ray from the\n * node's center, which is the direction an edge leaves anyway.\n /\nimport { PATH_C, PATH_L, PATH_M, PATH_Q, PATH_Z, flattenCubic, type Path } from '@weasel-js/core';\nimport { outlinePath, type Bounds, type Outline } from './outline';\nimport type { Port } from './types';\n\n/* Curve flattening tolerance, in world units. Finer than a port is wide. /\nconst TOLERANCE = 0.25;\n\n/* The outline as a closed polyline: `[x0, y0, x1, y1, …]`. /\nexport function outlinePolyline(outline: Outline, bounds: Bounds): number[] {\n const path = outlinePath(outline, bounds);\n return flattenPath(path);\n}\n\nfunction flattenPath(path: Path): number[] {\n if (path.kind === 'rect') {\n const { x, y, width: w, height: h } = path;\n return [x, y, x + w, y, x + w, y + h, x, y + h, x, y];\n }\n const out: number[] = [];\n const { commands, coords } = path as { commands: Uint8Array; coords: Float32Array };\n let ci = 0;\n let cx = 0;\n let cy = 0;\n let sx = 0;\n let sy = 0;\n for (const cmd of commands) {\n if (cmd === PATH_M) {\n cx = coords[ci]!; cy = coords[ci + 1]!; ci += 2;\n sx = cx; sy = cy;\n out.push(cx, cy);\n } else if (cmd === PATH_L) {\n cx = coords[ci]!; cy = coords[ci + 1]!; ci += 2;\n out.push(cx, cy);\n } else if (cmd === PATH_C) {\n const x1 = coords[ci]!, y1 = coords[ci + 1]!;\n const x2 = coords[ci + 2]!, y2 = coords[ci + 3]!;\n const x3 = coords[ci + 4]!, y3 = coords[ci + 5]!;\n ci += 6;\n flattenCubic(cx, cy, x1, y1, x2, y2, x3, y3, TOLERANCE, out);\n cx = x3; cy = y3;\n } else if (cmd === PATH_Q) {\n // Elevated to a cubic rather than given its own flattener.\n const qx = coords[ci]!, qy = coords[ci + 1]!;\n const x3 = coords[ci + 2]!, y3 = coords[ci + 3]!;\n ci += 4;\n flattenCubic(\n cx, cy,\n cx + (2 / 3) (qx - cx), cy + (2 / 3) * (qy - cy),\n x3 + (2 / 3) * (qx - x3), y3 + (2 / 3) * (qy - y3),\n x3, y3, TOLERANCE, out,\n );\n cx = x3; cy = y3;\n } else if (cmd === PATH_Z) {\n out.push(sx, sy);\n cx = sx; cy = sy;\n }\n }\n // Close it, so a ray leaving through the last edge still finds a crossing.\n if (out.length >= 2 && (out[0] !== out[out.length - 2] \|\| out[1] !== out[out.length - 1])) {\n out.push(out[0]!, out[1]!);\n }\n return out;\n}\n\n/*\n Where the ray from `center` through `point` last crosses `poly`, or `null`\n * when it never does.\n \n The last crossing rather than the first: a concave outline can be crossed\n * more than once, and the far side is the boundary an edge should attach to.\n /\nexport function rayHit(\n poly: readonly number[],\n center: { x: number; y: number },\n point: { x: number; y: number },\n): { x: number; y: number } \| null {\n const dx = point.x - center.x;\n const dy = point.y - center.y;\n if (dx === 0 && dy === 0) return null;\n let bestT = -Infinity;\n let hit: { x: number; y: number } \| null = null;\n for (let i = 0; i + 3 < poly.length; i += 2) {\n const ax = poly[i]!, ay = poly[i + 1]!;\n const bx = poly[i + 2]!, by = poly[i + 3]!;\n const ex = bx - ax;\n const ey = by - ay;\n const denom = dx ey - dy * ex;\n if (denom === 0) continue;\n // t along the ray, u along the segment.\n const t = ((ax - center.x) * ey - (ay - center.y) * ex) / denom;\n const u = ((ax - center.x) * dy - (ay - center.y) * dx) / denom;\n if (t < 0 \|\| u < 0 \|\| u > 1) continue;\n if (t > bestT) {\n bestT = t;\n hit = { x: center.x + dx * t, y: center.y + dy * t };\n }\n }\n return hit;\n}\n\n/*\n Every port moved onto `outline`. A port the ray misses — one at the node's\n * dead center, with no direction to cast along — is left where it was.\n /\nexport function portsOnOutline(\n ports: readonly Port[],\n outline: Outline,\n bounds: Bounds,\n): Port[] {\n if (bounds.width <= 0 \|\| bounds.height <= 0) return [...ports];\n const poly = outlinePolyline(outline, bounds);\n const center = { x: bounds.x + bounds.width / 2, y: bounds.y + bounds.height / 2 };\n return ports.map((port) => {\n const hit = rayHit(poly, center, port.point);\n return hit === null ? port : { ...port, point: hit };\n });\n}\n","/\n Reading the `DiagramNode` trait off a scene node.\n \n Two ways to attach it, both of which this module's default reader answers:\n \n - On the node. `data.diagram` holds the trait. One node, one answer;\n * what a connect gesture writes when the author drags a new edge.\n * - By kind. A consumer declares once which data shapes take part, and\n * every matching node gets the trait without being stamped. This mirrors\n * `createNodeRouting` in the kit — a predicate over `data`, first match\n * wins — and is the shape to reach for when the participants are a class\n * of node rather than a hand-picked set.\n \n A reader is a plain function, so a consumer whose data lives somewhere else\n * entirely passes their own and never touches either form.\n /\nimport type { DiagramNode } from './types';\n\n/* The key on a node's `data` the default reader looks under. /\nexport const DIAGRAM_TRAIT_KEY = 'diagram';\n\n/* All a reader looks at. Deliberately not `SceneNode`: naming `TPose` there\n * would put it in a contravariant position for no gain, since nothing here\n * reads a pose. /\nexport interface DiagramNodeLike {\n id: string;\n kind: 'leaf' \| 'container';\n data: unknown;\n}\n\n/* Answers \"is this node a diagram participant, and on what terms\" — `null`\n * for a node that takes no part. /\nexport type DiagramNodeReader = (node: DiagramNodeLike) => DiagramNode \| null;\n\n/* One class of participant, declared once for every node whose data matches.\n * Mirrors `NodeRoutingEntry`. /\nexport interface DiagramNodeEntry {\n /* Unique within a reader; the same vocabulary as `NodeRoutingEntry.name`. /\n name: string;\n matches: (data: unknown) => boolean;\n /* The trait every matching node carries. A function when it varies with the\n * node's own data — a pipeline stage whose ports come from its rows. /\n trait: DiagramNode \| ((data: unknown) => DiagramNode);\n}\n\n/* The trait on the node's own `data.diagram`, or `null`.\n \n An edge's trait lives under the same key, so `from` and `to` are what tells\n * the two apart. Without that test an edge reads as a participant declaring\n * no ports, and collects the four defaults on the degenerate pose an edge\n * carries — four grabbable ports in the middle of nowhere. /\nexport const dataKeyReader: DiagramNodeReader = (node) => {\n const data = node.data;\n if (data === null \|\| typeof data !== 'object') return null;\n const trait = (data as Record<string, unknown>)[DIAGRAM_TRAIT_KEY];\n if (trait === null \|\| typeof trait !== 'object') return null;\n if ('from' in trait && 'to' in trait) return null;\n return trait as DiagramNode;\n};\n\n/\n A reader over declared kinds. A trait on the node's own data still wins, so\n * a single node can opt out of, or override, whatever its kind says.\n \n Throws on a duplicate `name`, for the reason `mergeContributions` does: a\n * class of node silently losing its ports is what this registry exists to make\n * loud.\n /\nexport function createDiagramNodes(entries: readonly DiagramNodeEntry[]): DiagramNodeReader {\n const seen = new Set<string>();\n for (const entry of entries) {\n if (seen.has(entry.name)) {\n throw new Error(`createDiagramNodes: duplicate entry name \"${entry.name}\"`);\n }\n seen.add(entry.name);\n }\n return (node) => {\n const own = dataKeyReader(node);\n if (own !== null) return own;\n for (const entry of entries) {\n if (!entry.matches(node.data)) continue;\n return typeof entry.trait === 'function' ? entry.trait(node.data) : entry.trait;\n }\n return null;\n };\n}\n\n/* The trait `node` carries, through `read` (default: its own `data.diagram`). /\nexport function diagramNodeOf(\n node: DiagramNodeLike,\n read: DiagramNodeReader = dataKeyReader,\n): DiagramNode \| null {\n return read(node);\n}\n\n/* True when layout must leave this node where it is. /\nexport function isPinned(node: DiagramNodeLike, read?: DiagramNodeReader): boolean {\n return diagramNodeOf(node, read)?.pinned === true;\n}\n","/\n Where a node's ports are, in world coordinates.\n \n A port is placed in the node's unrotated bounds, then carried through\n * the pose's rotation — the same pivot every other kit reader uses, the AABB\n * center. Bounds come from the pose descriptor rather than from `pose.width`\n * and friends, so a node whose pose is a path, an ellipse or anything else a\n * consumer wired is connectable on the same terms as a rect.\n /\nimport {\n AUTO_POSE_DESCRIPTOR,\n rotatePoint,\n type PoseProjection,\n type Vec2,\n} from '@weasel-js/core';\nimport { outlinePolyline, rayHit } from './onOutline';\nimport { diagramNodeOf, type DiagramNodeLike, type DiagramNodeReader } from './trait';\nimport type { Port, PortAnchor, PortSpec } from './types';\n\n/* The eight anchors almost everything wants, named the way a compass is. /\nexport const COMPASS = {\n nw: { u: 0, v: 0 },\n n: { u: 0.5, v: 0 },\n ne: { u: 1, v: 0 },\n e: { u: 1, v: 0.5 },\n se: { u: 1, v: 1 },\n s: { u: 0.5, v: 1 },\n sw: { u: 0, v: 1 },\n w: { u: 0, v: 0.5 },\n} as const satisfies Record<string, PortAnchor>;\n\n/\n What a node carrying no `ports` gets: the four edge midpoints of its own\n * bounds. Every node has bounds, so every node is connectable without saying\n * anything.\n /\nexport const DEFAULT_PORTS: readonly PortSpec[] = Object.freeze([\n { id: 'n', at: COMPASS.n },\n { id: 'e', at: COMPASS.e },\n { id: 's', at: COMPASS.s },\n { id: 'w', at: COMPASS.w },\n]);\n\nexport interface PortsOptions<TPose> {\n /* Reads the AABB a port is placed in, and the node's rotation. Defaults to\n * the kit's `AUTO_POSE_DESCRIPTOR`, which handles rect and path poses. /\n geometry?: PoseProjection<TPose>;\n /* How the `DiagramNode` trait is read off a node. /\n read?: DiagramNodeReader;\n}\n\n/\n The direction the anchor implies: away from the center of the bounds.\n \n `(2u-1, 2v-1)` is the anchor in a box that runs -1..1, which is exactly that\n * direction — an edge midpoint gets the axis-aligned normal, a corner gets the\n * diagonal. It is deliberately not scaled by the node's aspect: this is a\n * heading a router leaves along, not a point on the outline. A port at the\n * dead center has no direction, and says so.\n /\nfunction normalOf(at: PortAnchor): Vec2 \| null {\n const x = at.u 2 - 1;\n const y = at.v * 2 - 1;\n const len = Math.hypot(x, y);\n if (len === 0) return null;\n return { x: x / len, y: y / len };\n}\n\n/*\n Every port on `node`, resolved against `pose`.\n \n Pass the pose the node is painted at — `effectivePose(scene, node)` —\n * not `node.pose`. A port that answers from the document pose while the node\n * is mid-drag puts an edge somewhere the user can see the node is not.\n /\nexport function portsOf<TPose>(\n node: DiagramNodeLike,\n pose: TPose,\n opts: PortsOptions<TPose> = {},\n): Port[] {\n const trait = diagramNodeOf(node, opts.read);\n if (trait === null) return [];\n const geometry = opts.geometry ?? (AUTO_POSE_DESCRIPTOR as PoseProjection<TPose>);\n const bounds = geometry.getBounds(pose);\n const rotation = geometry.getRotation?.(pose) ?? 0;\n const cx = bounds.x + bounds.width / 2;\n const cy = bounds.y + bounds.height / 2;\n // A port is anchored in the bounds so it survives a resize, but it has to\n // sit* on the shape: a parallelogram's west anchor is in the gap beside its\n // leaning edge, and an edge ending there ends in empty space. Flattened once\n // per call, not once per port.\n const poly = trait.outline === undefined \|\| bounds.width <= 0 \|\| bounds.height <= 0\n ? null\n : outlinePolyline(trait.outline, bounds);\n\n return (trait.ports ?? DEFAULT_PORTS).map((spec) => {\n const anchored: Vec2 = {\n x: bounds.x + spec.at.u * bounds.width,\n y: bounds.y + spec.at.v * bounds.height,\n };\n const flat = (poly === null ? null : rayHit(poly, { x: cx, y: cy }, anchored)) ?? anchored;\n const normal = spec.normal === undefined ? normalOf(spec.at) : spec.normal;\n if (rotation === 0) {\n return { id: spec.id, nodeId: node.id, point: flat, normal, ...typeOf(spec) };\n }\n return {\n id: spec.id,\n nodeId: node.id,\n point: rotatePoint(flat.x, flat.y, cx, cy, rotation),\n // A direction rotates about the origin, not about the node's center.\n normal: normal === null ? null : rotatePoint(normal.x, normal.y, 0, 0, rotation),\n ...typeOf(spec),\n };\n });\n}\n\n/** One named port, or `undefined` when the node has no such port. /\nexport function portOf<TPose>(\n node: DiagramNodeLike,\n pose: TPose,\n portId: string,\n opts: PortsOptions<TPose> = {},\n): Port \| undefined {\n return portsOf(node, pose, opts).find((p) => p.id === portId);\n}\n\n/* Spread rather than assigned, so a port with no type has no `type` key at\n * all — `exactOptionalPropertyTypes` rejects an explicit `undefined`. /\nfunction typeOf(spec: PortSpec): { type?: string } {\n return spec.type === undefined ? {} : { type: spec.type };\n}\n","/\n The optional body builder: what a node looks like when it should read as a\n * flowchart box or a visual-programming operator, rather than as whatever\n * scene node it already was.\n \n The body measures a floor; the author sets the rest. Rows measure to a\n * `{ minWidth, minHeight }` and the node's pose is the max of that and what\n * the author gave it. Adding a port row can grow a node; nothing here ever\n * shrinks one back. Because the pose stays authored data, resize, align,\n * distribute, guides, snapping and undo need no special case, and a node that\n * did not come from the builder just has whatever size it already had.\n \n Text measurement is a seam rather than an import: measuring needs a 2D\n * context, which a geometry module has no business owning. `canvasMeasure`\n * adapts the kit's own `measureText` for a caller that has one.\n /\nimport { boxForContent, contentBox, outlinePath, type Bounds, type Outline } from './outline';\nimport { COMPASS } from './ports';\nimport type { DiagramNode, PortSpec } from './types';\n\n/* One line of body content. /\nexport type Row =\n /* Text. `label` is the node's name; `field` is a named value. /\n \| { kind: 'label'; text: string; style?: RowTextStyle }\n \| { kind: 'field'; label: string; value: string; style?: RowTextStyle }\n /* A row that carries ports on its own left and right edges — the\n * visual-programming shape, where an operator's inputs line up with the\n * rows they feed. /\n \| { kind: 'ports'; left?: readonly RowPort[]; right?: readonly RowPort[]; height?: number }\n /* Reserved space a consumer paints into. /\n \| { kind: 'slot'; height: number; id?: string };\n\n/* A port declared on a row rather than on the node's perimeter. /\nexport interface RowPort {\n id: string;\n /* Label shown beside it, and what the row measures against. /\n label?: string;\n type?: string;\n}\n\n/* The subset of a text style the body measures against. Deliberately small:\n * a full `ResolvedTextStyle` belongs to whatever paints the row. /\nexport interface RowTextStyle {\n fontSize?: number;\n fontFamily?: string;\n bold?: boolean;\n}\n\n/* Measures one run of text. Returns its advance width and its line height. /\nexport type MeasureRowText = (text: string, style: RowTextStyle) => { width: number; height: number };\n\nexport interface BodySpec {\n outline: Outline;\n rows: readonly Row[];\n /* Space between the outline and its rows. Default 8. /\n padding?: number;\n /* Space between adjacent rows. Default 4. /\n gap?: number;\n}\n\n/* What {@link buildBody} emits: the `AddNodeSpec` fields it fills in. Named\n * structurally rather than imported so a consumer whose scene is typed\n * differently can still spread one. /\nexport interface BodyNodeSpec<TData, TLayer extends string, TPose> {\n kind: 'container' \| 'leaf';\n layer: TLayer;\n pose: TPose;\n data: TData;\n id?: string;\n parent?: string;\n /* Set `false` on every leaf the builder emits: the innermost hit wins, so a\n * row that answers a press is a body that cannot be dragged. /\n pickable?: boolean;\n}\n\n/* The floor a body's content puts under its node's size. /\nexport interface BodyFloor {\n minWidth: number;\n minHeight: number;\n}\n\n/* Where one row landed, in the same frame as the bounds it was laid out in.\n * A `ports` row's own ports anchor to this box. /\nexport interface RowBox extends Bounds {\n row: Row;\n index: number;\n}\n\n/* Where one row port's label sits, in the same frame as the row box it was\n * laid out in. Its vertical center is also where the port itself attaches, so\n * a label and the port it names cannot drift apart. /\nexport interface RowPortBox extends Bounds {\n port: RowPort;\n side: 'left' \| 'right';\n /* Position within its own side, top to bottom. /\n index: number;\n}\n\nconst DEFAULT_PADDING = 8;\nconst DEFAULT_GAP = 4;\n/* What a row is worth when nothing measures its text. Enough that a body\n * laid out headlessly is not zero-height — a zero-height body renders as an\n * empty page with every unit test still green. /\nconst FALLBACK_LINE = 16;\n\n/* Adapts the kit's `measureText` for a caller holding a 2D context. Pass the\n * same context the renderer measures with, or the floor will not match what\n * is painted. /\nexport function canvasMeasure(\n ctx: { measureText(text: string): { width: number } ; font: string },\n): MeasureRowText {\n return (text, style) => {\n const size = style.fontSize ?? FALLBACK_LINE;\n ctx.font = `${style.bold === true ? 'bold ' : ''}${size}px ${style.fontFamily ?? 'sans-serif'}`;\n return { width: ctx.measureText(text).width, height: Math.ceil(size 1.2) };\n };\n}\n\n/** What each row is worth on its own, before padding and gaps. /\nfunction measureRow(row: Row, measure: MeasureRowText \| undefined): { width: number; height: number } {\n const text = (s: string, style?: RowTextStyle): { width: number; height: number } =>\n measure === undefined\n ? { width: s.length (((style?.fontSize ?? FALLBACK_LINE) * 0.6)), height: FALLBACK_LINE }\n : measure(s, style ?? {});\n\n switch (row.kind) {\n case 'label':\n return text(row.text, row.style);\n case 'field': {\n // Label and value sit on one line with a gap between them.\n const l = text(row.label, row.style);\n const v = text(row.value, row.style);\n return { width: l.width + DEFAULT_GAP * 2 + v.width, height: Math.max(l.height, v.height) };\n }\n case 'ports': {\n const side = (ports: readonly RowPort[] \| undefined): number =>\n (ports ?? []).reduce((w, p) => Math.max(w, p.label === undefined ? 0 : text(p.label).width), 0);\n const rows = Math.max(row.left?.length ?? 0, row.right?.length ?? 0, 1);\n return {\n width: side(row.left) + DEFAULT_GAP * 2 + side(row.right),\n height: row.height ?? rows * FALLBACK_LINE,\n };\n }\n case 'slot':\n return { width: 0, height: row.height };\n }\n}\n\n/*\n The smallest box `spec`'s rows fit in. A node's pose is maxed against this,\n * never set to it.\n /\nexport function measureBody(spec: BodySpec, measure?: MeasureRowText): BodyFloor {\n const padding = spec.padding ?? DEFAULT_PADDING;\n const gap = spec.gap ?? DEFAULT_GAP;\n let width = 0;\n let height = 0;\n for (const [i, row] of spec.rows.entries()) {\n const m = measureRow(row, measure);\n width = Math.max(width, m.width);\n height += m.height + (i > 0 ? gap : 0);\n }\n // The rows fit the content* box; the node's own box has to be whatever\n // contains that, or a diamond's label lands outside the diamond.\n const box = boxForContent(spec.outline, {\n width: width + padding * 2,\n height: height + padding * 2,\n });\n return { minWidth: box.width, minHeight: box.height };\n}\n\n/*\n The authored size, grown to fit the body. Never shrinks: a row removed\n * leaves the node the size the author last saw it at, which is the only\n * behavior that survives a resize the author did on purpose.\n /\nexport function sizeToBody<TPose extends Bounds>(pose: TPose, floor: BodyFloor): TPose {\n const width = Math.max(pose.width, floor.minWidth);\n const height = Math.max(pose.height, floor.minHeight);\n if (width === pose.width && height === pose.height) return pose;\n return { ...pose, width, height };\n}\n\n/* Where each row sits inside `bounds`, top to bottom. Rows keep their\n * measured heights; the leftover goes unclaimed at the bottom rather than\n * being distributed, so a row does not move when a sibling grows. /\nexport function layoutBody(\n spec: BodySpec,\n bounds: Bounds,\n measure?: MeasureRowText,\n): RowBox[] {\n const padding = spec.padding ?? DEFAULT_PADDING;\n const gap = spec.gap ?? DEFAULT_GAP;\n const inner = contentBox(spec.outline, bounds);\n const width = Math.max(inner.width - padding 2, 0);\n let y = inner.y + padding;\n return spec.rows.map((row, index) => {\n const h = measureRow(row, measure).height;\n const box: RowBox = { row, index, x: inner.x + padding, y, width, height: h };\n y += h + gap;\n return box;\n });\n}\n\n/*\n Where each of a `ports` row's ports goes inside `box`, on the same terms\n * `layoutBody` gives one box per row.\n \n Both sides are cut into the same number of slots — the longer side's count —\n * so the nth input faces the nth output whichever side has more. A label box\n * is as wide as its own text and pinned to its own edge of the row; an\n * unlabeled port gets a zero-width box there, which is still where it attaches.\n /\nexport function layoutRowPorts(\n row: Extract<Row, { kind: 'ports' }>,\n box: Bounds,\n measure?: MeasureRowText,\n): RowPortBox[] {\n const width = (label: string \| undefined): number =>\n label === undefined ? 0 : measureRow({ kind: 'label', text: label }, measure).width;\n const slots = Math.max(row.left?.length ?? 0, row.right?.length ?? 0, 1);\n const slotHeight = box.height / slots;\n const out: RowPortBox[] = [];\n const side = (ports: readonly RowPort[] \| undefined, which: 'left' \| 'right'): void => {\n for (const [index, port] of (ports ?? []).entries()) {\n const w = width(port.label);\n out.push({\n port,\n side: which,\n index,\n x: which === 'left' ? box.x : box.x + box.width - w,\n y: box.y + index slotHeight,\n width: w,\n height: slotHeight,\n });\n }\n };\n side(row.left, 'left');\n side(row.right, 'right');\n return out;\n}\n\n/*\n The `DiagramNode` trait a built body implies: perimeter ports for the\n * outline, plus one port per `ports`-row entry, anchored to that row's own\n * left or right edge.\n \n Anchors are normalized against `bounds`, so they survive the node being\n * resized — which is the whole reason `PortAnchor` is normalized.\n \n A row port on a side takes that side's compass default with it. Both sit\n * on the same edge, and a row near the vertical middle puts one exactly on top\n * of `w` or `e` — where the later region wins the hit and the other is\n * grabbable nowhere. A body that declares where its inputs attach has said what\n * that side is for.\n /\nexport function bodyTrait(spec: BodySpec, bounds: Bounds, measure?: MeasureRowText): DiagramNode {\n const outline = spec.outline;\n const compass: PortSpec[] = [\n { id: 'n', at: COMPASS.n },\n { id: 'e', at: COMPASS.e },\n { id: 's', at: COMPASS.s },\n { id: 'w', at: COMPASS.w },\n ];\n if (bounds.height <= 0) return { outline, ports: compass };\n\n const rowPorts: PortSpec[] = [];\n let hasLeft = false;\n let hasRight = false;\n for (const box of layoutBody(spec, bounds, measure)) {\n if (box.row.kind !== 'ports') continue;\n for (const pb of layoutRowPorts(box.row, box, measure)) {\n if (pb.side === 'left') hasLeft = true;\n else hasRight = true;\n const v = (pb.y + pb.height / 2 - bounds.y) / bounds.height;\n rowPorts.push(withType(\n { id: pb.port.id, at: { u: pb.side === 'left' ? 0 : 1, v } },\n pb.port.type,\n ));\n }\n }\n const kept = compass.filter((p) =>\n !(p.id === 'w' && hasLeft) && !(p.id === 'e' && hasRight));\n return { outline, ports: [...kept, ...rowPorts] };\n}\n\nfunction withType(spec: PortSpec, type: string \| undefined): PortSpec {\n return type === undefined ? spec : { ...spec, type };\n}\n\n/* The outline path for a built body at `bounds` — what paints it, and what a\n * perimeter-hugging port will eventually be placed on. /\nexport function bodyOutline(spec: BodySpec, bounds: Bounds) {\n return outlinePath(spec.outline, bounds);\n}\n\n/* What a built body's rows are handed to, one call per row.\n \n `text` is the row's content already formatted — a `label`'s own text, or a\n * `field`'s `\"label: value\"` — so the common case needs no discrimination.\n * Return `null` for a row the consumer paints itself; `ports` and `slot` rows\n * arrive with `text` empty and are the usual ones to decline. /\nexport type RowNodeData<TData> = (text: string, box: RowBox) => TData \| null;\n\nexport interface BuildBodyOptions<TData, TLayer extends string, TPose extends Bounds> {\n layer: TLayer;\n /* The container's id. Edges name it, so pass one for anything an edge or a\n * layout `pin` will refer to. /\n id?: string;\n measure?: MeasureRowText;\n /* The container's own data, given the trait the builder computed and the\n * pose it was computed against. /\n body: (trait: DiagramNode, pose: TPose) => TData;\n /* One row's data, or `null` to leave that row undrawn. /\n row: RowNodeData<TData>;\n /* One row port's label, or `null` to leave it undrawn. Ports with no\n * `label` are never offered. Omit to draw none — a body whose ports are\n * named only for the width they claim needs nothing here. /\n portLabel?: (text: string, box: RowPortBox) => TData \| null;\n}\n\n/\n The scene nodes a built body is: one container carrying the trait, and one\n * leaf per row that wants drawing.\n \n Rows are ordinary scene nodes rather than something this package paints, so\n * the kit's own text painter draws them and text editing, styling and\n * selection work on them unchanged. The walk that places them is\n * `layoutBody` — the same one `bodyTrait` anchors its row ports against, which\n * is why a label and its ports cannot drift apart.\n \n The pose is `sizeToBody(at, measureBody(spec))`: the body measures a floor\n * and the authored size is grown to clear it, never shrunk.\n /\nexport function buildBody<TData, TLayer extends string, TPose extends Bounds>(\n spec: BodySpec,\n at: TPose,\n opts: BuildBodyOptions<TData, TLayer, TPose>,\n): { pose: TPose; specs: BodyNodeSpec<TData, TLayer, TPose>[] } {\n const pose = sizeToBody(at, measureBody(spec, opts.measure));\n const specs: BodyNodeSpec<TData, TLayer, TPose>[] = [{\n kind: 'container',\n layer: opts.layer,\n pose,\n data: opts.body(bodyTrait(spec, pose, opts.measure), pose),\n ...(opts.id === undefined ? {} : { id: opts.id }),\n }];\n\n const leaf = (box: Bounds, data: TData): void => {\n specs.push({\n kind: 'leaf',\n layer: opts.layer,\n pose: { ...pose, x: box.x, y: box.y, width: box.width, height: box.height },\n data,\n pickable: false,\n ...(opts.id === undefined ? {} : { parent: opts.id }),\n });\n };\n\n const portLabel = opts.portLabel;\n for (const box of layoutBody(spec, pose, opts.measure)) {\n const data = opts.row(rowText(box.row), box);\n if (data !== null) leaf(box, data);\n if (portLabel === undefined \|\| box.row.kind !== 'ports') continue;\n for (const pb of layoutRowPorts(box.row, box, opts.measure)) {\n if (pb.port.label === undefined) continue;\n const labelData = portLabel(pb.port.label, pb);\n if (labelData !== null) leaf(pb, labelData);\n }\n }\n return { pose, specs };\n}\n\n/* A row's content as one string: empty for a row that carries no text. /\nfunction rowText(row: Row): string {\n if (row.kind === 'label') return row.text;\n if (row.kind === 'field') return `${row.label}: ${row.value}`;\n return '';\n}\n","/\n A label on an edge: an ordinary leaf node that derives its pose from the\n * route it sits on.\n \n It reads the edge's resolved path off its dependency rather than routing\n * again, so the label and the arrowhead can never disagree about where the\n * edge went. Everything else about it is a normal scene node — its own size,\n * data, styling, z-order and selection.\n /\nimport {\n AUTO_POSE_DESCRIPTOR,\n pointAlongPath,\n translatePoseViaDescriptor,\n type DerivedDep,\n type PoseProjection,\n} from '@weasel-js/core';\n\n/* Where along an edge a label sits. /\nexport interface DiagramLabel {\n /* `'start'`, `'mid'` and `'end'` are 0, 0.5 and 1; a number is that\n * fraction of the route's length. /\n at: 'start' \| 'mid' \| 'end' \| number;\n /* World units perpendicular to the route, to the *left of the direction of\n travel** — above a left-to-right edge. Default 0, which centers the label\n * on the line. /\n offset?: number;\n}\n\nconst NAMED = { start: 0, mid: 0.5, end: 1 } as const;\n\n/* The label trait on a node's data, or `null`. /\nexport function diagramLabelOf(node: { data: unknown }): DiagramLabel \| null {\n const data = node.data;\n if (data === null \|\| typeof data !== 'object') return null;\n const trait = (data as { diagram?: unknown }).diagram;\n if (trait === null \|\| typeof trait !== 'object') return null;\n const label = (trait as { label?: unknown }).label;\n if (label === null \|\| typeof label !== 'object') return null;\n return 'at' in label ? (label as DiagramLabel) : null;\n}\n\nexport interface LabelPoseOptions<TPose> {\n geometry?: PoseProjection<TPose>;\n}\n\n/\n A `derivePose` that stations a label along its dependency's path.\n \n Returns `null` — nothing derived, so the node keeps its authored pose —\n * when the node carries no label trait, when the dependency is gone, or when\n * the dependency derives no path. A label that snapped to the origin because\n * its edge was deleted is worse than one that stayed where the author left it.\n /\nexport function labelDerivePose<TPose>(\n opts: LabelPoseOptions<TPose> = {},\n): (node: { pose: TPose; data: unknown }, deps: readonly (DerivedDep<TPose> \| undefined)[]) => TPose \| null {\n const geometry = opts.geometry ?? (AUTO_POSE_DESCRIPTOR as PoseProjection<TPose>);\n\n return (node, deps) => {\n const label = diagramLabelOf(node);\n if (label === null) return null;\n const path = deps[0]?.path ?? null;\n if (path === null) return null;\n\n const t = typeof label.at === 'number' ? label.at : NAMED[label.at] ?? 0.5;\n const station = pointAlongPath(path, t);\n if (station === null) return null;\n\n const offset = label.offset ?? 0;\n // Left of travel: with y down, that is above an edge running rightward.\n const x = station.point.x + station.tangent.y offset;\n const y = station.point.y - station.tangent.x * offset;\n\n const bounds = geometry.getBounds(node.pose);\n return translatePoseViaDescriptor(\n node.pose,\n x - (bounds.x + bounds.width / 2),\n y - (bounds.y + bounds.height / 2),\n geometry,\n );\n };\n}\n\n/** Registry key for {@link LABEL_DERIVE_POSE}. /\nexport const DIAGRAM_LABEL = 'diagram:label';\n\n/* The default label derivation, as one stable function reference so `toJSON`\n * can find its key. /\nexport const LABEL_DERIVE_POSE = labelDerivePose<unknown>();\n","/\n `DiagramEdge` — a connection between two participants.\n \n An edge is an ordinary leaf scene node with `dependsOn: [from, to]` and a\n * `derivePath` that runs a router. Making it a scene node rather than a\n * plugin-owned render layer is the load-bearing choice: it buys selection,\n * hit-testing, hover, styling, z-order, SVG export, undo and copy/paste\n * without implementing any of them. The cost is that an edge costs what a node\n * costs — right for diagrams of tens to hundreds of edges, wrong for a\n * 10k-edge force graph, which keeps its render layer.\n \n *Author-dragged waypoints are data on the edge and the router routes\n through them.** Manual control never authors the path; it authors\n * constraints on the path. That is what keeps derived geometry and hand-tuning\n * compatible — a moved endpoint still re-routes, through the waypoints the\n * author put there.\n \n Arrowheads are not here. They are stroke markers, the same\n * `markerStart` / `markerEnd` any other stroke carries.\n /\nimport {\n AUTO_POSE_DESCRIPTOR,\n polylineFromPoints,\n type DerivedDep,\n type Path,\n type PoseProjection,\n type SceneRegistry,\n type Vec2,\n} from '@weasel-js/core';\nimport { DIAGRAM_LABEL, LABEL_DERIVE_POSE } from './label';\nimport { portOf, portsOf, type PortsOptions } from './ports';\nimport type { Port } from './types';\n\n/* Where an edge attaches at one end. /\nexport interface EdgeEnd {\n /* The port to leave from, when the endpoint declares one. Falls back to\n * the nearest port, so an edge drawn before ports were thought about still\n * meets the shape. /\n port?: string;\n}\n\n/* The trait on an edge's `data`, under the same key participants use. /\nexport interface DiagramEdge {\n from: EdgeEnd;\n to: EdgeEnd;\n /* Registry key for the router. Resolved by whoever builds the edge's\n * `derivePath`; unknown keys fall back to `straight`. /\n router?: string;\n /* Points in world coordinates the route must pass through, in order. The\n * author owns these; the router owns everything between them. /\n waypoints?: readonly Vec2[];\n}\n\n/* What a router is given: the two resolved ends, and the author's waypoints\n * between them. /\nexport interface RouteRequest {\n from: Port;\n to: Port;\n waypoints: readonly Vec2[];\n}\n\n/* A router returns the points the edge runs through, `from.point` first and\n * `to.point` last. Turning those into a `Path` is `edgePath`'s job, so a\n * router never has to know about path encodings. /\nexport type Router = (req: RouteRequest) => readonly Vec2[];\n\n/* The straight run between the two ends, through any waypoints. /\nexport const straight: Router = (req) => [req.from.point, ...req.waypoints, req.to.point];\n\n/\n An axis-aligned route: leave along the departing end's normal and arrive\n * against the receiving one's.\n \n A leg is one elbow where the two ends face different axes and two where they\n * face the same one, turning at the midpoint of the axis they share. Arriving\n * along the port's own facing is what makes the arrowhead point into the\n * shape — a route that lands on a west-facing port from above puts its marker\n * across the corner, which reads as aimed at nothing.\n /\nexport const orthogonal: Router = (req) => {\n const stops = [req.from.point, ...req.waypoints, req.to.point];\n const out: Vec2[] = [stops[0]!];\n for (let i = 1; i < stops.length; i++) {\n const a = out[out.length - 1]!;\n const b = stops[i]!;\n if (a.x === b.x \|\| a.y === b.y) {\n out.push(b);\n continue;\n }\n // Only the first leg has a port to leave along; later legs follow the\n // one before them so the route does not alternate for no reason.\n const leaveHorizontal = i === 1\n ? isHorizontal(req.from.normal)\n : out.length > 1 && out[out.length - 2]!.y === a.y;\n // Likewise only the last leg has a port to arrive against. Without a\n // facing there is nothing to satisfy, so it keeps the single elbow.\n const arriving = i === stops.length - 1 ? req.to.normal : null;\n const arriveHorizontal = arriving == null ? !leaveHorizontal : isHorizontal(arriving);\n if (leaveHorizontal !== arriveHorizontal) {\n out.push(leaveHorizontal ? { x: b.x, y: a.y } : { x: a.x, y: b.y });\n out.push(b);\n continue;\n }\n if (leaveHorizontal) {\n const mid = (a.x + b.x) / 2;\n out.push({ x: mid, y: a.y }, { x: mid, y: b.y }, b);\n } else {\n const mid = (a.y + b.y) / 2;\n out.push({ x: a.x, y: mid }, { x: b.x, y: mid }, b);\n }\n }\n return out;\n};\n\n/* Which axis a port faces. A port with no facing counts as horizontal, which\n * is the leave-rightward default the router has always taken. /\nfunction isHorizontal(normal: Vec2 \| null \| undefined): boolean {\n return Math.abs(normal?.x ?? 1) >= Math.abs(normal?.y ?? 0);\n}\n\n/* How far a bezier reaches along each end's normal, as a fraction of the\n * straight-line distance between the two points it joins. /\nconst BEZIER_REACH = 0.4;\n\n/\n A smooth route, sampled into points.\n \n Each leg is a cubic that leaves along the departing end's normal and arrives\n * against the receiving one's, which is what makes a bezier edge read as\n * plugged into its port rather than aimed at it. Sampled rather than emitted\n * as curve commands so every router returns the same thing; `edgePath` is free\n * to emit curves later without changing the contract.\n /\nexport const bezier: Router = (req) => {\n const stops = [req.from.point, ...req.waypoints, req.to.point];\n const out: Vec2[] = [stops[0]!];\n for (let i = 1; i < stops.length; i++) {\n const a = stops[i - 1]!;\n const b = stops[i]!;\n const reach = Math.hypot(b.x - a.x, b.y - a.y) BEZIER_REACH;\n const outN = i === 1 ? req.from.normal : null;\n const inN = i === stops.length - 1 ? req.to.normal : null;\n const c1 = outN === null \|\| outN === undefined\n ? { x: a.x + (b.x - a.x) * BEZIER_REACH, y: a.y + (b.y - a.y) * BEZIER_REACH }\n : { x: a.x + outN.x * reach, y: a.y + outN.y * reach };\n const c2 = inN === null \|\| inN === undefined\n ? { x: b.x - (b.x - a.x) * BEZIER_REACH, y: b.y - (b.y - a.y) * BEZIER_REACH }\n : { x: b.x + inN.x * reach, y: b.y + inN.y * reach };\n for (let s = 1; s <= BEZIER_SAMPLES; s++) {\n out.push(cubicAt(a, c1, c2, b, s / BEZIER_SAMPLES));\n }\n }\n return out;\n};\n\nconst BEZIER_SAMPLES = 16;\n\nfunction cubicAt(p0: Vec2, p1: Vec2, p2: Vec2, p3: Vec2, t: number): Vec2 {\n const u = 1 - t;\n const a = u * u * u;\n const b = 3 * u * u * t;\n const c = 3 * u * t * t;\n const d = t * t * t;\n return {\n x: a * p0.x + b * p1.x + c * p2.x + d * p3.x,\n y: a * p0.y + b * p1.y + c * p2.y + d * p3.y,\n };\n}\n\n/** The routers this package ships. A consumer's own go in the same shape. /\nexport const ROUTERS: Readonly<Record<string, Router>> = Object.freeze({\n straight,\n orthogonal,\n bezier,\n});\n\n/* The edge trait on a node's data, or `null`. /\nexport function diagramEdgeOf(node: { data: unknown }): DiagramEdge \| null {\n const data = node.data;\n if (data === null \|\| typeof data !== 'object') return null;\n const edge = (data as { diagram?: unknown }).diagram;\n if (edge === null \|\| typeof edge !== 'object') return null;\n return 'from' in edge && 'to' in edge ? (edge as DiagramEdge) : null;\n}\n\n/\n The port an end resolves to: the one it named, else the port facing the\n * other end most directly.\n \n \"Facing\" rather than \"nearest\": a port on the far side of a wide node can be\n * closer in a straight line than the one pointing at the target, and an edge\n * that leaves through its own node reads as a bug however short it is.\n /\nexport function resolveEnd<TPose>(\n end: EdgeEnd,\n dep: DerivedDep<TPose>,\n toward: Vec2,\n opts: PortsOptions<TPose>,\n allPorts: (d: DerivedDep<TPose>) => Port[],\n): Port \| undefined {\n if (end.port !== undefined) {\n const named = portOf(dep.node as never, dep.pose, end.port, opts);\n if (named !== undefined) return named;\n }\n let best: Port \| undefined;\n let bestScore = -Infinity;\n for (const port of allPorts(dep)) {\n const dx = toward.x - port.point.x;\n const dy = toward.y - port.point.y;\n const len = Math.hypot(dx, dy) \|\| 1;\n // Alignment with the port's own facing, tie-broken toward the closer port.\n const facing = port.normal === null\n ? 0\n : (port.normal.x dx + port.normal.y * dy) / len;\n const score = facing - len / 1e6;\n if (score > bestScore) {\n bestScore = score;\n best = port;\n }\n }\n return best;\n}\n\nexport interface EdgeRouteOptions<TPose> extends PortsOptions<TPose> {\n /** Routers by key. Defaults to {@link ROUTERS}. /\n routers?: Readonly<Record<string, Router>>;\n}\n\n/\n A `derivePath` that routes an edge between its two dependencies.\n \n Returns `null` — nothing to draw — when the node is not an edge, when either\n * dependency is gone, or when an endpoint offers no ports at all. A dangling\n * edge painting a line to the origin is worse than a dangling edge painting\n * nothing.\n /\nexport function edgeDerivePath<TPose>(\n opts: EdgeRouteOptions<TPose> = {},\n): (node: { data: unknown }, deps: readonly (DerivedDep<TPose> \| undefined)[]) => Path \| null {\n const geometry = opts.geometry ?? (AUTO_POSE_DESCRIPTOR as PoseProjection<TPose>);\n const portOpts: PortsOptions<TPose> = { geometry, ...(opts.read ? { read: opts.read } : {}) };\n const allPorts = (d: DerivedDep<TPose>): Port[] =>\n portsOf(d.node as never, d.pose, portOpts);\n const centerOf = (d: DerivedDep<TPose>): Vec2 => {\n const b = geometry.getBounds(d.pose);\n return { x: b.x + b.width / 2, y: b.y + b.height / 2 };\n };\n\n return (node, deps) => {\n const edge = diagramEdgeOf(node);\n if (edge === null) return null;\n const [fromDep, toDep] = deps;\n if (fromDep === undefined \|\| toDep === undefined) return null;\n\n // Each end aims at the other's center, which is stable while both are\n // being resolved — aiming at the other port* would be circular.\n const from = resolveEnd(edge.from, fromDep, centerOf(toDep), portOpts, allPorts);\n const to = resolveEnd(edge.to, toDep, centerOf(fromDep), portOpts, allPorts);\n if (from === undefined \|\| to === undefined) return null;\n\n const routers = opts.routers ?? ROUTERS;\n const router = (edge.router !== undefined && routers[edge.router]) \|\| straight;\n const points = router({ from, to, waypoints: edge.waypoints ?? [] });\n return points.length < 2 ? null : polylineFromPoints(points as { x: number; y: number }[]);\n };\n}\n\n/** Registry key for {@link EDGE_DERIVE_PATH}. /\nexport const DIAGRAM_EDGE = 'diagram:edge';\n\n/* The default edge router, as one stable function reference so `toJSON` can\n * find its key. A consumer wanting different options registers their own\n * `edgeDerivePath(...)` under a key of their choosing. /\nexport const EDGE_DERIVE_PATH = edgeDerivePath<unknown>();\n\n/* Merge this package's registry entries under a consumer's, so an edge\n * round-trips through `toJSON` without the consumer wiring the key. /\nexport function withDiagramRegistry<TPose>(\n registry: SceneRegistry<TPose> = {},\n): SceneRegistry<TPose> {\n return {\n ...registry,\n derivePath: {\n [DIAGRAM_EDGE]: EDGE_DERIVE_PATH as NonNullable<SceneRegistry<TPose>['derivePath']>[string],\n ...registry.derivePath,\n },\n derivePose: {\n [DIAGRAM_LABEL]: LABEL_DERIVE_POSE as NonNullable<SceneRegistry<TPose>['derivePose']>[string],\n ...registry.derivePose,\n },\n };\n}\n","/\n Ports as affordances — what makes a painted port a grabbable one.\n \n A port is declared as an `AffordanceRegion`, so the kit's own region walk\n * supplies the hit-test, the screen-pixel hit radius, the cursor and the\n * exclusive claim that keeps a port drag out of the select tool's hands. That\n * is the \"visible chrome is always hittable\" rule doing the work: the walk runs\n * on every pointerdown before any tool sees the event, so a port answers\n * whatever tool happens to be active.\n \n Two things about this are easy to get wrong, and both fail silently.\n \n `targetId` is `null`. The framework composes a target's rotation about\n * its bounds center for any region naming one, and `portsOf` has already\n * rotated the port. Naming the participant here would rotate it twice.\n \n `hitKind` is not set. On the registered-layer route the discriminator is\n * the layer's own id — `<SceneCanvas>` stamps the hit `layer:<RenderLayer.id>`\n * and carries `initialScratch` through as `payload`. A `hitKind` declared here\n * would be dropped, and a binding written against it would never match.\n /\nimport type {\n Affordance,\n AffordanceRegion,\n ChromeState,\n CursorSpec,\n FillStyle,\n PoseProjection,\n Stroke,\n} from '@weasel-js/core';\nimport { portsOf } from './ports';\nimport type { DiagramNodeLike, DiagramNodeReader } from './trait';\nimport type { Port } from './types';\n\n/* The layer id this package composes its port regions into. /\nexport const PORT_LAYER_ID = 'diagram-ports';\n\n/* The affordance kind a press on a port reports — what a binding's\n * `target: 'affordance:...'` has to name. `<SceneCanvas>` builds it from\n * {@link PORT_LAYER_ID}, so the two cannot drift. /\nexport const PORT_AFFORDANCE_KIND = `layer:${PORT_LAYER_ID}` as const;\n\n/* A participant and the pose it is painted at. `effectivePose`, not\n * `node.pose` — a port that answers from the document pose while its node is\n * mid-drag sits somewhere the user can see the node is not. /\nexport interface ParticipantPose<TPose> {\n node: DiagramNodeLike;\n pose: TPose;\n}\n\n/* Where the affordance gets its participants. A thunk rather than a scene so\n * the geometry is testable without one, and so a consumer whose participants\n * come from somewhere else needs no adapter. /\nexport type ParticipantSource<TPose> = () => Iterable<ParticipantPose<TPose>>;\n\n/* What a press on a port hands the action that picks up the drag. Arrives as\n * `InvocationCtx.drag.affordance.payload`. /\nexport interface PortScratch {\n /* `CommonAffordanceScratch.targetId` — becomes `AffordanceHit.targetIds`. /\n targetId: string;\n nodeId: string;\n portId: string;\n /* The port resolved at press time: where it was and which way it faces. /\n port: Port;\n}\n\nexport interface PortAffordanceOptions<TPose> {\n /* Also the chrome-caps visibility id. Default {@link PORT_LAYER_ID}. /\n id?: string;\n read?: DiagramNodeReader;\n geometry?: PoseProjection<TPose>;\n /* Which participants show their ports. Default: all of them. Gate on\n * selection or hover by reading `state`. /\n shows?: (node: DiagramNodeLike, state: ChromeState) => boolean;\n /* Screen-pixel hit radius. Default 8, the kit's `HANDLE_BASE_PX`. /\n hitRadiusPx?: number;\n /* Screen-pixel side of the painted square. Default 7. Omit `paint` entirely\n * by passing 0 — a port the consumer draws itself is still hittable. /\n sizePx?: number;\n fill?: FillStyle;\n stroke?: Stroke;\n cursor?: CursorSpec;\n /* Default `'exclusive'` on pointer gestures: a drag from a port is a\n * connect, never a move of the node underneath it. /\n strength?: 'exclusive' \| 'shared';\n}\n\nconst DEFAULT_HIT_PX = 8;\nconst DEFAULT_SIZE_PX = 7;\n\n/* Read a port press's scratch back off the hit an action was handed. /\nexport function portScratchOf(hit: { payload?: unknown } \| null \| undefined): PortScratch \| null {\n const payload = hit?.payload as PortScratch \| undefined;\n return payload !== undefined && typeof payload.portId === 'string' ? payload : null;\n}\n\n/\n The affordance. Compose it into a layer with `composeAffordanceLayer` and\n * attach that with `CanvasExtensionApi.registerLayer` — the only attach route\n * that is hit-tested. A `Contribution.overlay` is painted and never hit.\n /\nexport function createPortAffordance<TPose>(\n participants: ParticipantSource<TPose>,\n opts: PortAffordanceOptions<TPose> = {},\n): Affordance {\n const {\n id = PORT_LAYER_ID,\n hitRadiusPx = DEFAULT_HIT_PX,\n sizePx = DEFAULT_SIZE_PX,\n strength = 'exclusive',\n } = opts;\n const portOpts = {\n ...(opts.geometry ? { geometry: opts.geometry } : {}),\n ...(opts.read ? { read: opts.read } : {}),\n };\n const paint = sizePx <= 0\n ? undefined\n : {\n kind: 'square' as const,\n sizePx,\n ...(opts.fill ? { fill: opts.fill } : {}),\n ...(opts.stroke ? { stroke: opts.stroke } : {}),\n };\n\n return {\n id,\n regions(state: ChromeState): readonly AffordanceRegion[] {\n const out: AffordanceRegion[] = [];\n for (const { node, pose } of participants()) {\n if (opts.shows !== undefined && !opts.shows(node, state)) continue;\n for (const port of portsOf(node, pose, portOpts)) {\n out.push({\n id: `${node.id}:${port.id}`,\n targetId: null,\n shape: { kind: 'point', x: port.point.x, y: port.point.y, hitRadiusPx },\n ...(paint ? { paint } : {}),\n ...(opts.cursor !== undefined ? { cursor: opts.cursor } : {}),\n strength,\n claimedKinds: ['pointer'],\n bind: () => ({\n initialScratch: {\n targetId: node.id,\n nodeId: node.id,\n portId: port.id,\n port,\n } satisfies PortScratch,\n }),\n });\n }\n }\n return out;\n },\n };\n}\n","/\n The connect gesture — dragging one port onto another to author an edge.\n \n Connect is an ordinary drag binding, not a mode and not a tool of its own:\n * the binding is gated on a press landing on a port affordance, so a connect\n * starts from whatever tool happens to be active. The gate lives in the\n * binding's `target`, which is what lets a press that is not on a port fall\n * through to the tool that wants it instead of being swallowed here.\n \n Where validity is decided. The two halves are decided in different\n * places, and conflating them is the mistake this package is written to avoid:\n \n - Which presses start a connect is routing, and belongs to the binding\n * spec. `connectBinding` names the port layer's affordance kind; nothing in\n * the action body re-checks what was pressed.\n * - Which ports a live connect may land on cannot be routing — the\n * dispatcher never re-reads the affordance under a moving pointer, so a\n * spec has no vocabulary for it. It is decided by `canConnect` filtering\n * the candidate set: an illegal port is never a candidate, so the\n * preview will not snap to it and a release over it commits nothing. That\n * is a narrower thing than an action body that inspects a hit and bails.\n \n One resolver answers both the live preview and the commit, for the reason\n * `insertAction` does the same: a preview computed separately from the commit\n * is a preview that can lie about what releasing will do.\n /\nimport {\n polylineFromPoints,\n type Action,\n type DrawCommand,\n type GestureBinding,\n type InvocationCtx,\n type OngoingHandle,\n type OngoingOverlay,\n type PoseProjection,\n type Scene,\n type Stroke,\n type Vec2,\n} from '@weasel-js/core';\nimport { EDGE_DERIVE_PATH, ROUTERS, type DiagramEdge, type Router } from './edge';\nimport { PORT_AFFORDANCE_KIND, portScratchOf, type ParticipantSource } from './portAffordance';\nimport { portsOf } from './ports';\nimport type { DiagramNodeReader } from './trait';\nimport type { Port } from './types';\n\n/* The default action id, and what {@link connectBinding} points at. /\nexport const CONNECT_ACTION_ID = 'diagram.connect';\n\n/* Whether an edge may run from `from` to `to`. /\nexport type CanConnect = (from: Port, to: Port) => boolean;\n\n/* The edge a finished connect describes. Both ends are resolved ports, so a\n * consumer minting the node has nothing left to look up. /\nexport interface PendingEdge {\n from: Port;\n to: Port;\n /* Registry key for the router the new edge should name. /\n router: string;\n}\n\n/\n The shipped policy: a port may not join itself, and two ports that both\n * declare a `type` must declare the same one.\n \n A port with no type joins anything — `PortSpec.type` is uninterpreted by this\n * package, so an untyped diagram stays fully connectable without opting out.\n * Two ports on the same node may be joined: a self-edge between two different\n * ports is meaningful in a state machine, and refusing it here would be policy\n * masquerading as a rule.\n /\nexport const defaultCanConnect: CanConnect = (from, to) => {\n if (from.nodeId === to.nodeId && from.id === to.id) return false;\n if (from.type === undefined \|\| to.type === undefined) return true;\n return from.type === to.type;\n};\n\nexport interface ConnectActionOptions<TPose> {\n /* Where the droppable ports come from. The same source the port affordance\n * reads, so what is grabbable and what is landable cannot disagree. /\n participants: ParticipantSource<TPose>;\n /* Default {@link CONNECT_ACTION_ID}. /\n id?: string;\n read?: DiagramNodeReader;\n geometry?: PoseProjection<TPose>;\n /* Default {@link defaultCanConnect}. /\n canConnect?: CanConnect;\n /* How near the pointer must come to a port, in world units, before the\n * edge snaps to it. Default 16. /\n snapRadius?: number;\n /* Registry key the new edge names, and the router the preview draws with.\n * Default `'straight'`. /\n router?: string;\n routers?: Readonly<Record<string, Router>>;\n /* How the in-flight edge is painted. /\n stroke?: Stroke;\n /\n Mints and commits the edge. Called once, on release over a valid port.\n \n Defaults to {@link commitEdgeToScene} against `deps.scene`, which is what\n * makes the gesture work with nothing wired. Override it the way a consumer\n * overrides the kit's `insert` dep — to choose the edge node's data, its\n * layer, or its stroke.\n /\n commit?: (edge: PendingEdge, ctx: InvocationCtx) => void;\n}\n\nconst DEFAULT_SNAP = 16;\n/* What a connect-authored edge is drawn with, when the consumer overrides\n * nothing. /\nexport const DEFAULT_EDGE_STROKE: Stroke = {\n paint: { color: '#7ba7c7' },\n width: 2,\n markerEnd: 'arrow',\n};\nconst DEFAULT_ROUTER = 'straight';\nconst PREVIEW_STROKE: Stroke = { paint: { color: '#7ba7c7' }, width: 2, dash: [4, 4] };\n\ninterface ConnectScratch {\n from: Port;\n current: Vec2;\n open: boolean;\n /* The deps bag as it was at `start`. The dispatcher builds it once, so\n * every later pump event carries `deps: {}` — an action that reads a dep at\n * commit time reads nothing and commits nothing, silently. /\n deps: InvocationCtx['deps'];\n}\n\n/\n The binding that starts a connect: a drag whose press landed on the port\n * layer's own chrome.\n \n The string form of `target` rather than a predicate, because it ranks higher\n * in specificity — a bare `{ kind: 'drag' }` on the select tool cannot outrank\n * it, so no tool needs a predicate of its own to keep out of the way.\n /\nexport function connectBinding(actionId: string = CONNECT_ACTION_ID): GestureBinding {\n return {\n spec: { kind: 'drag', target: `affordance:${PORT_AFFORDANCE_KIND}` },\n actionId,\n };\n}\n\n/* The action id that absorbs a press on a port. /\nexport const GRAB_PORT_ACTION_ID = 'diagram.grabPort';\n\n/\n Absorbs a press on a port, and does nothing else.\n \n A port claims the press protocol, not one gesture in it: `pointerDown`,\n * `click` and `drag` are a single claimable `'pointer'` token, and an exclusive\n * claim bars every binding whose target does not consult the affordance. So a\n * bundle that binds only `drag` leaves the pointerdown with nowhere to go, and\n * the dispatcher drops the press — the drag it would have grown into never\n * happens. Absorbing the press is also the behavior you want on its own: a\n * press on a port should not pick or deselect the node underneath it.\n /\nexport function grabPortAction(id: string = GRAB_PORT_ACTION_ID): Action {\n return {\n id,\n label: 'Grab port',\n group: 'diagram',\n invoker: { timing: 'immediate', run: () => {} },\n enabled: () => true as const,\n };\n}\n\n/* The two bindings that keep a port's claim from dropping the press. /\nexport function grabPortBindings(actionId: string = GRAB_PORT_ACTION_ID): GestureBinding[] {\n return [\n { spec: { kind: 'pointerDown', target: `affordance:${PORT_AFFORDANCE_KIND}` }, actionId },\n { spec: { kind: 'click', target: `affordance:${PORT_AFFORDANCE_KIND}` }, actionId },\n ];\n}\n\n/\n The default commit: one leaf node carrying the edge trait, added to\n * `deps.scene`. One `add` is one history entry, so the edge undoes in one.\n \n The edge lands on the source node's layer rather than the bottom one: an\n * edge between two nodes on a `wires` layer belongs on `wires`, and picking the\n * first layer in the stack would quietly move it somewhere the author did not\n * put its endpoints.\n /\nexport function commitEdgeToScene(edge: PendingEdge, ctx: InvocationCtx): void {\n const scene = ctx.deps['scene'] as Scene<unknown, string, unknown> \| undefined;\n if (scene === undefined) return;\n const trait: DiagramEdge = {\n from: { port: edge.from.id },\n to: { port: edge.to.id },\n router: edge.router,\n };\n const source = scene.get(edge.from.nodeId as never);\n scene.add({\n kind: 'leaf',\n layer: source?.layer ?? scene.layers[0]!.id,\n pose: { x: 0, y: 0, width: 0, height: 0 } as never,\n // An edge runs from* one node to another, and a plain line does not say\n // so. The arrowhead is an ordinary stroke marker, which is why nothing in\n // this package draws one.\n data: { diagram: trait, stroke: DEFAULT_EDGE_STROKE } as never,\n dependsOn: [edge.from.nodeId as never, edge.to.nodeId as never],\n // Without this the edge re-resolves on every dependency move and paints\n // nothing. `EDGE_DERIVE_PATH` rather than a fresh `edgeDerivePath()` so the\n // scene can find its registry key and the edge survives `toJSON`.\n derivePath: EDGE_DERIVE_PATH as never,\n });\n}\n\n/*\n The `diagram.connect` action: an ongoing drag whose preview is an ephemeral\n * edge and whose commit is one op batch.\n \n A factory rather than a singleton because every input it needs — which nodes\n * are droppable, what counts as a legal pair, how an edge node is shaped — is\n * the consumer's, and this package has no scene at module scope. Same reason\n * `edgeDerivePath` and `diagramShape` are factories.\n /\nexport function createConnectAction<TPose>(opts: ConnectActionOptions<TPose>): Action {\n const {\n id = CONNECT_ACTION_ID,\n canConnect = defaultCanConnect,\n snapRadius = DEFAULT_SNAP,\n router: routerKey = DEFAULT_ROUTER,\n commit = commitEdgeToScene,\n stroke = PREVIEW_STROKE,\n } = opts;\n const routers = opts.routers ?? ROUTERS;\n const portOpts = {\n ...(opts.geometry ? { geometry: opts.geometry } : {}),\n ...(opts.read ? { read: opts.read } : {}),\n };\n const route: Router = routers[routerKey] ?? routers['straight'] ?? ROUTERS['straight']!;\n\n /* The port the pointer is over and may legally land on, or `null`.\n \n `canConnect` is applied here rather than at commit, so an illegal port is\n * not a candidate at all: the edge does not snap to it and releasing over it\n * does nothing. /\n function targetPort(from: Port, at: Vec2): Port \| null {\n let best: Port \| null = null;\n let bestD2 = snapRadius snapRadius;\n for (const { node, pose } of opts.participants()) {\n for (const port of portsOf(node, pose, portOpts)) {\n if (!canConnect(from, port)) continue;\n const d2 = (port.point.x - at.x) 2 + (port.point.y - at.y) 2;\n if (d2 <= bestD2) {\n bestD2 = d2;\n best = port;\n }\n }\n }\n return best;\n }\n\n /** The end the edge currently runs to: a snapped port, or the bare pointer.\n * A free end is a port with no facing, so a router aims straight at it. /\n function endAt(from: Port, at: Vec2): { port: Port \| null; end: Port } {\n const port = targetPort(from, at);\n return {\n port,\n end: port ?? { id: '', nodeId: '', point: at, normal: null },\n };\n }\n\n return {\n id,\n label: 'Connect',\n group: 'diagram',\n requires: ['scene'],\n invoker: {\n timing: 'ongoing',\n start(ctx: InvocationCtx): OngoingHandle {\n const pressed = portScratchOf(ctx.drag?.affordance);\n // Not a port press. The binding spec already said only port presses\n // reach here, so this is the runtime backstop, not the gate — and an\n // empty handle is how the dispatcher is told to fall through.\n if (pressed === null) return {};\n const scratch: ConnectScratch = {\n from: pressed.port,\n current: { x: ctx.world.x, y: ctx.world.y },\n open: true,\n deps: ctx.deps,\n };\n\n return {\n kind: 'diagram-connect',\n onMove(moveCtx: InvocationCtx): void {\n scratch.current = { x: moveCtx.world.x, y: moveCtx.world.y };\n },\n overlay(): OngoingOverlay \| null {\n if (!scratch.open) return null;\n const { end } = endAt(scratch.from, scratch.current);\n const points = route({ from: scratch.from, to: end, waypoints: [] });\n if (points.length < 2) return null;\n const cmd: DrawCommand = {\n kind: 'path',\n path: polylineFromPoints(points as { x: number; y: number }[]),\n stroke,\n };\n return { kind: 'commands', commands: [cmd], space: 'world' };\n },\n onEnd(endCtx: InvocationCtx, reason: 'commit' \| 'cancel'): void {\n scratch.open = false;\n if (reason === 'cancel') return;\n const { port } = endAt(scratch.from, { x: endCtx.world.x, y: endCtx.world.y });\n if (port === null) return;\n // World and modifiers from the release; deps from the press.\n commit(\n { from: scratch.from, to: port, router: routerKey },\n { ...endCtx, deps: scratch.deps },\n );\n },\n };\n },\n },\n enabled: () => true as const,\n };\n}\n","/\n The port affordance, composed into a layer and pointed at a scene.\n \n Two conveniences over {@link createPortAffordance}, both of which encode a\n * rule that is easy to get wrong rather than merely saving a line.\n /\nimport {\n composeAffordanceLayer,\n effectivePose,\n type RenderLayer,\n} from '@weasel-js/core';\nimport {\n PORT_LAYER_ID,\n createPortAffordance,\n type ParticipantSource,\n type PortAffordanceOptions,\n} from './portAffordance';\nimport type { GraphNodeLike, GraphSource } from './graph';\n\n/* The minimum a participant source needs from a scene. Narrower than `Scene`\n * so a consumer can pass anything that answers these two. /\nexport interface ParticipantScene<TPose> {\n renderOrderNodes(): readonly {\n id: string;\n kind: 'leaf' \| 'container';\n data: unknown;\n pose: TPose;\n dependsOn?: readonly string[] \| 'children';\n }[];\n readonly overrides: { get(id: string): { pose?: TPose } \| undefined };\n get(id: string): unknown;\n childrenOf(id: string): readonly string[];\n}\n\n/\n Every node in `scene`, at the pose it is painted at.\n \n `effectivePose`, not `node.pose`: an override is what a gesture is currently\n * showing, and a port that answers from the document pose while its node is\n * mid-drag sits somewhere the user can see the node is not. Nodes that carry no\n * participant trait cost one reader call each and contribute no regions.\n \n One source answers both the ports and the graph — `GraphSource` is a\n * `ParticipantSource` that also carries `dependsOn`, which is where an edge's\n * two endpoints live.\n /\nexport function sceneParticipants<TPose>(\n scene: ParticipantScene<TPose>,\n): GraphSource<TPose> {\n return function () {\n for (const node of scene.renderOrderNodes()) {\n yield {\n node: node as GraphNodeLike,\n pose: effectivePose(scene as never, node as never) as TPose,\n };\n }\n };\n}\n\n/*\n The composed layer, ready for `CanvasExtensionApi.registerLayer` — the only\n * attach route that is hit-tested. Handing this to `SceneCanvas`'s `layers`\n * prop, or to a `Contribution.overlay`, paints the ports and makes none of them\n * grabbable.\n \n The cast is `composeAffordanceLayer` typing its data slot as `ChromeState`\n * while the layer registry takes `RenderLayer<unknown>`; both are handed the\n * same live `CanvasHelpers` envelope at runtime.\n /\nexport function portLayer<TPose>(\n participants: ParticipantSource<TPose>,\n opts: PortAffordanceOptions<TPose> = {},\n): RenderLayer<unknown> & { hitTest: NonNullable<RenderLayer<unknown>['hitTest']> } {\n return composeAffordanceLayer(\n opts.id ?? PORT_LAYER_ID,\n 'Diagram ports',\n [createPortAffordance(participants, opts)],\n ) as unknown as RenderLayer<unknown> & { hitTest: NonNullable<RenderLayer<unknown>['hitTest']> };\n}\n","/\n The plugin as a `Contribution` bundle — one object a consumer hands to\n * `<SceneCanvas ambient={…}>`.\n \n Ambient, not a tool. Connect is not a mode the author enters: a port is\n * grabbable whatever tool is active, which is the same reason `@weasel-js/hud`\n * ships `eligibility: { claimed: true }`. `claimed` is what makes the bundle\n * live for a press the port layer's affordance claimed, and dormant otherwise.\n \n The layer is not in here, on purpose. `Contribution.overlay` is painted\n * and never hit-tested — only `CanvasExtensionApi.registerLayer` gets a\n * `hitTest` call. Shipping the port layer as an overlay would paint every port\n * and make none of them grabbable, which is exactly the state this arc started\n * from. {@link diagramPorts} hands back the bundle and the layer together so\n * the two cannot be wired half-way.\n /\nimport type { Contribution, RenderLayer } from '@weasel-js/core';\nimport {\n CONNECT_ACTION_ID,\n connectBinding,\n createConnectAction,\n grabPortAction,\n grabPortBindings,\n type ConnectActionOptions,\n} from './connect';\nimport { portLayer } from './portLayer';\nimport type { PortAffordanceOptions } from './portAffordance';\n\nexport { CONNECT_ACTION_ID };\n\nexport interface DiagramContributionOptions<TPose>\n extends ConnectActionOptions<TPose>, PortAffordanceOptions<TPose> {}\n\n/* The bundle: the connect action and the one binding that reaches it. /\nexport function createDiagramContribution<TPose>(\n opts: DiagramContributionOptions<TPose>,\n): Contribution {\n const actionId = opts.id ?? CONNECT_ACTION_ID;\n return {\n id: 'weasel-diagram',\n eligibility: { claimed: true },\n actions: [createConnectAction({ ...opts, id: actionId }), grabPortAction()],\n bindings: [connectBinding(actionId), ...grabPortBindings()],\n };\n}\n\n/\n Both halves of the port affordance: the layer to `registerLayer`, and the\n * contribution to pass as `ambient`.\n \n They are returned together because attaching one without the other fails\n * quietly — the layer alone paints ports that start no gesture, and the\n * contribution alone binds an affordance kind nothing ever reports.\n /\nexport function diagramPorts<TPose>(opts: DiagramContributionOptions<TPose>): {\n layer: RenderLayer<unknown>;\n contribution: Contribution;\n} {\n return {\n layer: portLayer(opts.participants, opts),\n contribution: createDiagramContribution(opts),\n };\n}\n","/\n `Graph` — the adjacency index a layout runs over.\n \n The scene is the document, so there is no second graph kept in sync with it:\n * this one is built from the scene on demand, used, and thrown away. Rebuilding\n * per layout invocation is deliberate — a maintained index is a cache to\n * invalidate on every add, delete, reparent and `dependsOn` edit, and layout is\n * not on the hot path. Measure before changing that.\n \n A node's identity is its id and its size is its bounds; where it currently\n * sits is here too, because a re-layout that ignores where things already are\n * scrambles a diagram the author has arranged.\n /\nimport { AUTO_POSE_DESCRIPTOR, type PoseProjection } from '@weasel-js/core';\nimport { diagramEdgeOf } from './edge';\nimport type { Bounds } from './outline';\nimport { diagramNodeOf, type DiagramNodeLike, type DiagramNodeReader } from './trait';\n\n/* A scene node as the graph reads it. `dependsOn` is what an edge's two\n * endpoints are: the edge trait names ports, and the nodes those ports are\n * on are the dependencies the derivation already runs on. /\nexport interface GraphNodeLike extends DiagramNodeLike {\n dependsOn?: readonly string[] \| 'children';\n}\n\n/* Where the graph gets its nodes. The same thunk shape the port affordance\n * takes, so one source answers both. /\nexport type GraphSource<TPose> = () => Iterable<{ node: GraphNodeLike; pose: TPose }>;\n\n/* One participant. /\nexport interface GraphNode {\n id: string;\n /* Where it is now, in world coordinates. /\n bounds: Bounds;\n /* Layout must not move it. /\n pinned: boolean;\n}\n\n/* One connection. `id` is the edge node's own id, so a caller can go back to\n * the scene for its trait. /\nexport interface GraphEdge {\n id: string;\n from: string;\n to: string;\n}\n\n/\n Nodes, edges, and the two adjacency reads a layout needs.\n \n Every list is in source order — render order, when the source is a scene —\n * which is what a layout's tiebreaks resolve against. There is no RNG anywhere\n * downstream of this, and this is where that starts.\n /\nexport interface Graph {\n readonly nodes: readonly GraphNode[];\n readonly edges: readonly GraphEdge[];\n node(id: string): GraphNode \| undefined;\n /* Edges leaving `id`, in source order. /\n outgoing(id: string): readonly GraphEdge[];\n /* Edges arriving at `id`, in source order. /\n incoming(id: string): readonly GraphEdge[];\n}\n\nexport interface BuildGraphOptions<TPose> {\n read?: DiagramNodeReader;\n geometry?: PoseProjection<TPose>;\n}\n\n/\n Read a graph out of a source of scene nodes.\n \n A node is an edge if it carries the edge trait and names exactly two\n * dependencies; a participant if the reader hands back a `DiagramNode`;\n * neither, and it is not in the diagram at all. An edge whose endpoints are not\n * both participants is dropped — a dangling edge should not be ranking\n * anything.\n /\nexport function buildGraph<TPose>(\n source: GraphSource<TPose>,\n opts: BuildGraphOptions<TPose> = {},\n): Graph {\n const geometry = opts.geometry ?? (AUTO_POSE_DESCRIPTOR as PoseProjection<TPose>);\n const nodes: GraphNode[] = [];\n const byId = new Map<string, GraphNode>();\n const candidates: GraphEdge[] = [];\n\n for (const { node, pose } of source()) {\n if (diagramEdgeOf(node) !== null) {\n const deps = node.dependsOn;\n if (Array.isArray(deps) && deps.length === 2) {\n candidates.push({ id: node.id, from: deps[0]!, to: deps[1]! });\n }\n continue;\n }\n const trait = diagramNodeOf(node, opts.read);\n if (trait === null) continue;\n const entry: GraphNode = {\n id: node.id,\n bounds: geometry.getBounds(pose),\n pinned: trait.pinned === true,\n };\n nodes.push(entry);\n byId.set(entry.id, entry);\n }\n\n const edges = candidates.filter((e) => byId.has(e.from) && byId.has(e.to));\n const out = new Map<string, GraphEdge[]>();\n const into = new Map<string, GraphEdge[]>();\n for (const edge of edges) {\n push(out, edge.from, edge);\n push(into, edge.to, edge);\n }\n\n const NONE: readonly GraphEdge[] = Object.freeze([]);\n return {\n nodes,\n edges,\n node: (id) => byId.get(id),\n outgoing: (id) => out.get(id) ?? NONE,\n incoming: (id) => into.get(id) ?? NONE,\n };\n}\n\nfunction push(index: Map<string, GraphEdge[]>, key: string, edge: GraphEdge): void {\n const list = index.get(key);\n if (list === undefined) index.set(key, [edge]);\n else list.push(edge);\n}\n","/\n Layout: where the participants go.\n \n A layout is a pure function of the graph — no scene, no ops, no history. It\n * hands back the new top-left for every node that moves, and a node already\n * standing where the layout wants it is simply absent from the answer. That is\n * what makes re-running a layout free rather than destructive, and it is the\n * property the idempotence test asserts.\n \n Three rules keep re-layout non-destructive, and all three live here rather\n * than in each algorithm:\n \n - No RNG anywhere. Every tiebreak falls back to the graph's own node\n * order, which is the source's order — render order, for a scene.\n * - Within-rank order is seeded from where the nodes already are, read\n * off the cross axis, rather than from crossing-minimization. An author who\n * dragged two boxes into an order gets that order back.\n * - A pin set nothing moves. Pinned nodes are never in the result, and\n * the rest of the layout is translated to sit around them.\n \n `layered` and `tree` are idempotent by construction: the second run reads the\n * order the first run produced and computes the same slots. `force` is an\n * iterative relaxation and makes no such claim — re-running it keeps relaxing.\n /\nimport type { Vec2 } from '@weasel-js/core';\nimport type { Graph, GraphNode } from './graph';\nimport type { Bounds } from './outline';\n\n/* Which way the ranks stack. `force` ignores it. /\nexport type LayoutDirection = 'down' \| 'up' \| 'right' \| 'left';\n\nexport interface LayoutOptions {\n /* Default `'down'`. /\n direction?: LayoutDirection;\n /* Between neighbors within a rank, in world units. Default 48. /\n nodeGap?: number;\n /* Between one rank and the next. Default 96. /\n rankGap?: number;\n /* Ids layout must not move, on top of whatever carries `pinned: true`. /\n pin?: Iterable<string>;\n /* How far a node has to move to be worth moving, in world units. Default\n * `1e-6` — a float-noise floor, not a snapping quantum. Raise it to let a\n * `force` pass that has stopped doing anything useful commit nothing. /\n tolerance?: number;\n}\n\n/* The new top-left for each node that moves. A node that is already there is\n * absent, so an empty result means \"nothing to do\". /\nexport type LayoutResult = ReadonlyMap<string, Vec2>;\n\n/* Every layout in this package has this shape, and so does a consumer's. /\nexport type LayoutFn = (graph: Graph, opts?: LayoutOptions) => LayoutResult;\n\nexport const DEFAULT_NODE_GAP = 48;\nexport const DEFAULT_RANK_GAP = 96;\nconst DEFAULT_TOLERANCE = 1e-6;\n\n/* Which world axis carries ranks, which carries within-rank order, and\n * whether ranks grow toward positive world coordinates. /\nexport interface LayoutAxes {\n rank: 'x' \| 'y';\n cross: 'x' \| 'y';\n /* `-1` for `'up'` and `'left'`, where the canonical frame is mirrored. /\n sign: 1 \| -1;\n}\n\nexport function axesFor(direction: LayoutDirection = 'down'): LayoutAxes {\n switch (direction) {\n case 'up':\n return { rank: 'y', cross: 'x', sign: -1 };\n case 'right':\n return { rank: 'x', cross: 'y', sign: 1 };\n case 'left':\n return { rank: 'x', cross: 'y', sign: -1 };\n default:\n return { rank: 'y', cross: 'x', sign: 1 };\n }\n}\n\n/* A node's extent along one axis. /\nexport function extent(bounds: Bounds, axis: 'x' \| 'y'): number {\n return axis === 'x' ? bounds.width : bounds.height;\n}\n\n/* A node's center along one axis — what within-rank order is seeded from. /\nexport function center(bounds: Bounds, axis: 'x' \| 'y'): number {\n return axis === 'x' ? bounds.x + bounds.width / 2 : bounds.y + bounds.height / 2;\n}\n\n/* Every id layout must leave alone. /\nexport function pinnedSet(graph: Graph, opts: LayoutOptions = {}): Set<string> {\n const pinned = new Set<string>(opts.pin ?? []);\n for (const node of graph.nodes) {\n if (node.pinned) pinned.add(node.id);\n }\n return pinned;\n}\n\n/\n A placement in the canonical `(cross, rank)` frame, before it is turned into\n * world coordinates. `cross` and `rank` are the node's low corner along each.\n /\nexport interface Slot {\n cross: number;\n rank: number;\n}\n\n/\n Turn canonical slots into the positions to write.\n \n Three steps, in order: map the canonical frame onto the world axes the\n * direction names; translate the whole layout so it lands where the graph\n * already is; drop everything that is pinned or that would not move.\n \n The translation is what makes the layout non-destructive, and it is chosen so\n * that a second run lands on the same answer. With a pin, it is whatever keeps\n * the first pinned node exactly where it is. Without one, it is whatever puts\n * the layout's own bounding box where the graph's bounding box already starts —\n * which the first run then makes true, so the second run computes the same\n * translation and writes nothing.\n /\nexport function settle(\n graph: Graph,\n slots: ReadonlyMap<string, Slot>,\n opts: LayoutOptions = {},\n): LayoutResult {\n const axes = axesFor(opts.direction);\n const pinned = pinnedSet(graph, opts);\n const tolerance = opts.tolerance ?? DEFAULT_TOLERANCE;\n\n const placed = new Map<string, Vec2>();\n for (const node of graph.nodes) {\n const slot = slots.get(node.id);\n if (slot === undefined) continue;\n const along = axes.sign === 1 ? slot.rank : -(slot.rank + extent(node.bounds, axes.rank));\n placed.set(\n node.id,\n axes.rank === 'y' ? { x: slot.cross, y: along } : { x: along, y: slot.cross },\n );\n }\n\n return translated(graph, placed, pinned, tolerance);\n}\n\n/\n {@link settle}'s second half, for a layout that already works in world\n * coordinates — `force` does, since the integrator moves points around rather\n * than filling slots.\n /\nexport function translated(\n graph: Graph,\n placed: ReadonlyMap<string, Vec2>,\n pinned: ReadonlySet<string>,\n tolerance = DEFAULT_TOLERANCE,\n): LayoutResult {\n const anchor = anchorDelta(graph, placed, pinned);\n const out = new Map<string, Vec2>();\n for (const node of graph.nodes) {\n const at = placed.get(node.id);\n if (at === undefined \|\| pinned.has(node.id)) continue;\n const x = at.x + anchor.x;\n const y = at.y + anchor.y;\n if (Math.abs(x - node.bounds.x) <= tolerance && Math.abs(y - node.bounds.y) <= tolerance) {\n continue;\n }\n out.set(node.id, { x, y });\n }\n return out;\n}\n\nfunction anchorDelta(\n graph: Graph,\n placed: ReadonlyMap<string, Vec2>,\n pinned: ReadonlySet<string>,\n): Vec2 {\n for (const node of graph.nodes) {\n if (!pinned.has(node.id)) continue;\n const at = placed.get(node.id);\n if (at !== undefined) return { x: node.bounds.x - at.x, y: node.bounds.y - at.y };\n }\n let minCurX = Infinity;\n let minCurY = Infinity;\n let minNewX = Infinity;\n let minNewY = Infinity;\n for (const node of graph.nodes) {\n const at = placed.get(node.id);\n if (at === undefined) continue;\n minCurX = Math.min(minCurX, node.bounds.x);\n minCurY = Math.min(minCurY, node.bounds.y);\n minNewX = Math.min(minNewX, at.x);\n minNewY = Math.min(minNewY, at.y);\n }\n if (!Number.isFinite(minCurX)) return { x: 0, y: 0 };\n return { x: minCurX - minNewX, y: minCurY - minNewY };\n}\n\n/\n Lay a list of nodes out along the cross axis, in the order given, and hand\n * back each one's low corner plus the total span.\n \n Shared by `layered`'s ranks and `tree`'s sibling rows, which pack a row the\n * same way and differ only in what decides the order.\n /\nexport function packAcross(\n nodes: readonly GraphNode[],\n axis: 'x' \| 'y',\n gap: number,\n): { at: Map<string, number>; span: number } {\n const at = new Map<string, number>();\n let cursor = 0;\n for (const node of nodes) {\n at.set(node.id, cursor);\n cursor += extent(node.bounds, axis) + gap;\n }\n return { at, span: nodes.length === 0 ? 0 : cursor - gap };\n}\n\n/* Order within a rank: where the nodes already sit on the cross axis, with\n * graph order breaking a tie. Never a comparison that could reverse between\n * two runs on the same input. /\nexport function seededOrder(\n nodes: readonly GraphNode[],\n axis: 'x' \| 'y',\n indexOf: (id: string) => number,\n): GraphNode[] {\n return [...nodes].sort((a, b) => {\n const d = center(a.bounds, axis) - center(b.bounds, axis);\n return d !== 0 ? d : indexOf(a.id) - indexOf(b.id);\n });\n}\n\n/* Each node's position in `graph.nodes`, for tiebreaks. /\nexport function graphOrder(graph: Graph): (id: string) => number {\n const index = new Map<string, number>();\n graph.nodes.forEach((node, i) => index.set(node.id, i));\n return (id) => index.get(id) ?? Number.MAX_SAFE_INTEGER;\n}\n","/\n `force` — relaxation, for a graph with no direction to read it in.\n \n Seeded from where the nodes already are rather than from a fresh random\n * scatter: an author who has arranged half a diagram gets that arrangement\n * relaxed, not replaced. There is no RNG in it at all — two coincident nodes\n * are separated along a golden-angle spiral keyed to their index, which is what\n * a random jiggle is for elsewhere.\n \n The integrator is the kit's own `createSimulation`, the same one\n * `useSimulation` runs a frame at a time. Only the forces are local, and they\n * are the naive O(n²) kind — right for the tens-to-hundreds of nodes an\n * edge-per-scene-node diagram is already sized for, wrong for a 10k-node graph,\n * which wants d3-force's Barnes–Hut through `useSimulation` and its own render\n * layer.\n \n This is the one layout that is not idempotent. A relaxation re-run from\n * its own output keeps relaxing; `direction` means nothing to it. Pins and the\n * `tolerance` option are what keep a second pass from scrambling a settled\n * diagram.\n /\nimport { createSimulation, type SimulationForce, type SimulationNode } from '@weasel-js/core';\nimport type { Graph } from './graph';\nimport {\n center,\n pinnedSet,\n translated,\n type LayoutFn,\n type LayoutOptions,\n type LayoutResult,\n} from './layout';\n\nexport interface ForceOptions extends LayoutOptions {\n /* Ticks to run. Default 300 — one full cooling schedule. /\n iterations?: number;\n /* Rest length of an edge, in world units. Default 160. /\n linkDistance?: number;\n /* How hard an edge pulls, 0..1. Default 0.35. /\n linkStrength?: number;\n /* Pairwise repulsion. Negative repels; default -3000. /\n charge?: number;\n /* How hard the graph is held around its own centroid. Default 0.02. /\n gravity?: number;\n /* Clear space kept between two boxes, in world units. Default 24. /\n padding?: number;\n}\n\ninterface Body extends SimulationNode {\n id: string;\n /* Half the node's box, so separation can work on the shape the author sees\n * rather than on a point. /\n hw: number;\n hh: number;\n}\n\nconst DEFAULTS = {\n iterations: 300,\n linkDistance: 160,\n linkStrength: 0.35,\n charge: -3000,\n gravity: 0.02,\n padding: 24,\n} as const;\n\n/* The golden angle. Coincident nodes fan out along it, which spreads any\n * number of them without two landing on the same heading. /\nconst GOLDEN = Math.PI (3 - Math.sqrt(5));\n/** How far the first coincident node is pushed, in world units. Small enough\n * to be invisible, large enough that the repulsion term is finite. /\nconst NUDGE = 0.5;\n\n/* Pairwise repulsion, applied to every pair once. /\nfunction charge(bodies: readonly Body[], strength: number): SimulationForce<Body> {\n return (alpha) => {\n for (let i = 0; i < bodies.length; i++) {\n const a = bodies[i]!;\n for (let j = i + 1; j < bodies.length; j++) {\n const b = bodies[j]!;\n const dx = b.x - a.x;\n const dy = b.y - a.y;\n const d2 = dx dx + dy * dy;\n if (d2 === 0) continue;\n const w = (strength * alpha) / d2;\n a.vx! += dx * w;\n a.vy! += dy * w;\n b.vx! -= dx * w;\n b.vy! -= dy * w;\n }\n }\n };\n}\n\n/** A spring per edge, pulling both ends toward `distance`. /\nfunction links(\n bodies: ReadonlyMap<string, Body>,\n graph: Graph,\n distance: number,\n strength: number,\n): SimulationForce<Body> {\n return (alpha) => {\n for (const edge of graph.edges) {\n const a = bodies.get(edge.from);\n const b = bodies.get(edge.to);\n if (a === undefined \|\| b === undefined \|\| a === b) continue;\n const dx = b.x - a.x;\n const dy = b.y - a.y;\n const d = Math.hypot(dx, dy);\n if (d === 0) continue;\n const pull = ((d - distance) / d) alpha * strength;\n a.vx! += dx * pull;\n a.vy! += dy * pull;\n b.vx! -= dx * pull;\n b.vy! -= dy * pull;\n }\n };\n}\n\n/*\n Push overlapping boxes apart along whichever axis they overlap least.\n \n Charge alone is not enough: it treats a node as a point, so two wide boxes\n * whose centers are a comfortable distance apart still cover each other. This\n * works on the box, and it is not scaled by alpha — an overlap at the end of\n * the run is exactly as wrong as one at the start.\n /\nfunction separateBoxes(bodies: readonly Body[], padding: number): SimulationForce<Body> {\n return () => {\n for (let i = 0; i < bodies.length; i++) {\n const a = bodies[i]!;\n for (let j = i + 1; j < bodies.length; j++) {\n const b = bodies[j]!;\n const dx = b.x - a.x;\n const dy = b.y - a.y;\n const gapX = a.hw + b.hw + padding - Math.abs(dx);\n const gapY = a.hh + b.hh + padding - Math.abs(dy);\n if (gapX <= 0 \|\| gapY <= 0) continue;\n if (gapX < gapY) {\n const push = (Math.sign(dx) \|\| 1) gapX * 0.5;\n a.vx! -= push;\n b.vx! += push;\n } else {\n const push = (Math.sign(dy) \|\| 1) * gapY * 0.5;\n a.vy! -= push;\n b.vy! += push;\n }\n }\n }\n };\n}\n\n/** A pull toward the seed centroid, so a component with nothing to hold it\n * does not drift off under pure repulsion. /\nfunction gravity(bodies: readonly Body[], at: { x: number; y: number }, strength: number): SimulationForce<Body> {\n return (alpha) => {\n for (const body of bodies) {\n body.vx! += (at.x - body.x) strength * alpha;\n body.vy! += (at.y - body.y) * strength * alpha;\n }\n };\n}\n\n/*\n The bodies and the force list, wound up and ready to tick.\n \n Shared by the one-shot `force` below and the live relaxation in `live.ts`,\n * which ticks it a frame at a time. Two copies of a force list drift, and the\n * only thing that would say so is the arrangement they produce.\n /\nexport interface ForceRelaxation {\n bodies: Body[];\n byId: Map<string, Body>;\n /* Ids the caller must not move: declared pins, held as `fx`/`fy`. /\n pinned: ReadonlySet<string>;\n sim: ReturnType<typeof createSimulation<Body>>;\n /* Where a body's node's top-left sits, given the body's center. /\n placed(): Map<string, { x: number; y: number }>;\n}\n\nexport function forceRelaxation(graph: Graph, opts: ForceOptions = {}): ForceRelaxation {\n const {\n linkDistance = DEFAULTS.linkDistance,\n linkStrength = DEFAULTS.linkStrength,\n charge: chargeStrength = DEFAULTS.charge,\n gravity: gravityStrength = DEFAULTS.gravity,\n padding = DEFAULTS.padding,\n } = opts;\n\n const pinned = pinnedSet(graph, opts);\n const bodies: Body[] = graph.nodes.map((node) => {\n const body: Body = {\n id: node.id,\n x: center(node.bounds, 'x'),\n y: center(node.bounds, 'y'),\n hw: node.bounds.width / 2,\n hh: node.bounds.height / 2,\n };\n // A pin is the integrator's own `fx`/`fy`, not a filter applied after the\n // fact: a pinned node has to hold its neighbors while they relax, not be\n // put back once they have finished relaxing around where it wasn't.\n if (pinned.has(node.id)) {\n body.fx = body.x;\n body.fy = body.y;\n }\n return body;\n });\n separate(bodies);\n\n const byId = new Map(bodies.map((b) => [b.id, b]));\n const centroid = {\n x: bodies.reduce((sum, b) => sum + b.x, 0) / bodies.length,\n y: bodies.reduce((sum, b) => sum + b.y, 0) / bodies.length,\n };\n\n const sim = createSimulation<Body>({\n nodes: bodies,\n forces: [\n charge(bodies, chargeStrength),\n links(byId, graph, linkDistance, linkStrength),\n gravity(bodies, centroid, gravityStrength),\n separateBoxes(bodies, padding),\n ],\n });\n\n return {\n bodies,\n byId,\n pinned,\n sim,\n placed() {\n const placed = new Map<string, { x: number; y: number }>();\n for (const node of graph.nodes) {\n const body = byId.get(node.id)!;\n placed.set(node.id, {\n x: body.x - node.bounds.width / 2,\n y: body.y - node.bounds.height / 2,\n });\n }\n return placed;\n },\n };\n}\n\nexport const force = (graph: Graph, opts: ForceOptions = {}): LayoutResult => {\n if (graph.nodes.length === 0) return new Map();\n const relaxation = forceRelaxation(graph, opts);\n relaxation.sim.tick(opts.iterations ?? DEFAULTS.iterations);\n return translated(graph, relaxation.placed(), relaxation.pinned, opts.tolerance);\n};\n\n/* `ForceOptions` only widens `LayoutOptions`, so this is a `LayoutFn` — but\n * declaring it as one would hide the extra options from every caller. /\nforce satisfies LayoutFn;\n\n/* Push coincident bodies apart, deterministically. Two nodes at exactly the\n * same point feel no repulsion from each other and stay stacked forever. A\n * pinned body is counted but never moved — a pin outranks this. /\nfunction separate(bodies: Body[]): void {\n const seen = new Map<string, number>();\n bodies.forEach((body, i) => {\n const key = `${body.x},${body.y}`;\n const nth = seen.get(key) ?? 0;\n seen.set(key, nth + 1);\n if (nth === 0 \|\| body.fx != null \|\| body.fy != null) return;\n const angle = GOLDEN i;\n const radius = NUDGE * nth;\n body.x += Math.cos(angle) * radius;\n body.y += Math.sin(angle) * radius;\n });\n}\n","/*\n `layered` — ranks running one way, nodes running across.\n \n The flowchart / pipeline layout: an edge points from one rank to the next, so\n * reading down the page is reading the order things happen in. Ranks come from\n * longest-path layering, which puts every node as far along as its deepest\n * predecessor allows.\n \n Cycles do not disqualify a graph. A depth-first walk in graph order names the\n * edges that close a cycle, layering ignores those, and they draw as edges\n * running back up the page — which is what a reader expects a loop to look\n * like. Which edges get named depends only on the node order, so it is the same\n * every run.\n \n This is not crossing-minimization: within a rank, nodes keep the order they\n * already have on the cross axis. An author who dragged two branches into an\n * order gets that order back, and re-running the layout is free.\n /\nimport type { Graph, GraphNode } from './graph';\nimport {\n DEFAULT_NODE_GAP,\n DEFAULT_RANK_GAP,\n axesFor,\n extent,\n graphOrder,\n packAcross,\n seededOrder,\n settle,\n type LayoutFn,\n type Slot,\n} from './layout';\n\n/* Edge ids that close a cycle, found by a depth-first walk in graph order. /\nexport function backEdges(graph: Graph): Set<string> {\n const back = new Set<string>();\n const done = new Set<string>();\n const onStack = new Set<string>();\n\n const walk = (id: string): void => {\n if (done.has(id)) return;\n onStack.add(id);\n for (const edge of graph.outgoing(id)) {\n if (onStack.has(edge.to)) back.add(edge.id);\n else walk(edge.to);\n }\n onStack.delete(id);\n done.add(id);\n };\n\n for (const node of graph.nodes) walk(node.id);\n return back;\n}\n\n/* Longest-path rank per node: one past its deepest predecessor. /\nexport function ranksOf(graph: Graph, back: ReadonlySet<string>): Map<string, number> {\n const ranks = new Map<string, number>();\n const resolving = new Set<string>();\n\n const rankOf = (id: string): number => {\n const known = ranks.get(id);\n if (known !== undefined) return known;\n // Only reachable if `back` missed an edge; guarding here keeps a bad\n // cycle-breaker from recursing forever rather than reporting a wrong rank.\n if (resolving.has(id)) return 0;\n resolving.add(id);\n let rank = 0;\n for (const edge of graph.incoming(id)) {\n if (back.has(edge.id)) continue;\n rank = Math.max(rank, rankOf(edge.from) + 1);\n }\n resolving.delete(id);\n ranks.set(id, rank);\n return rank;\n };\n\n for (const node of graph.nodes) rankOf(node.id);\n return ranks;\n}\n\nexport const layered: LayoutFn = (graph, opts = {}) => {\n const axes = axesFor(opts.direction);\n const nodeGap = opts.nodeGap ?? DEFAULT_NODE_GAP;\n const rankGap = opts.rankGap ?? DEFAULT_RANK_GAP;\n const order = graphOrder(graph);\n\n const ranks = ranksOf(graph, backEdges(graph));\n const byRank = new Map<number, GraphNode[]>();\n for (const node of graph.nodes) {\n const rank = ranks.get(node.id) ?? 0;\n const list = byRank.get(rank);\n if (list === undefined) byRank.set(rank, [node]);\n else list.push(node);\n }\n\n const rows = [...byRank.keys()].sort((a, b) => a - b);\n const packed = new Map<number, ReturnType<typeof packAcross>>();\n let widest = 0;\n for (const rank of rows) {\n const row = seededOrder(byRank.get(rank)!, axes.cross, order);\n const p = packAcross(row, axes.cross, nodeGap);\n packed.set(rank, p);\n widest = Math.max(widest, p.span);\n }\n\n const slots = new Map<string, Slot>();\n let along = 0;\n for (const rank of rows) {\n const row = byRank.get(rank)!;\n const p = packed.get(rank)!;\n const indent = (widest - p.span) / 2;\n const depth = Math.max(0, ...row.map((n) => extent(n.bounds, axes.rank)));\n for (const node of row) {\n slots.set(node.id, {\n cross: indent + p.at.get(node.id)!,\n // Centered in its rank's band, so a tall node does not push its\n // neighbors' edges off the line they read along.\n rank: along + (depth - extent(node.bounds, axes.rank)) / 2,\n });\n }\n along += depth + rankGap;\n }\n\n return settle(graph, slots, opts);\n};\n","/\n `tree` — a parent centered over the block its children occupy.\n \n The hierarchy layout: org charts, file trees, decision trees. Depth is the\n * rank axis, so every child sits one band past its parent, and a subtree is\n * packed as a solid block so two siblings' descendants never interleave.\n \n A graph that is not a tree still lays out. Roots are the nodes nothing points\n * at, in graph order; a node reachable from two parents belongs to whichever\n * the depth-first walk reaches first; and anything the walk never reaches — a\n * disconnected part, or a pure cycle — becomes a root of its own. So the answer\n * is always a forest, and which forest depends only on the node order.\n \n The block packing is deliberately not Reingold–Tilford: it never slides a\n * deep subtree under a shallow neighbor's overhang. That costs horizontal\n * space and buys an invariant an author can rely on — a subtree's extent is a\n * rectangle, and dragging one never lands it inside another.\n /\nimport type { Graph, GraphNode } from './graph';\nimport {\n DEFAULT_NODE_GAP,\n DEFAULT_RANK_GAP,\n axesFor,\n extent,\n graphOrder,\n seededOrder,\n settle,\n type LayoutFn,\n type Slot,\n} from './layout';\n\ninterface Forest {\n roots: GraphNode[];\n children: Map<string, GraphNode[]>;\n depth: Map<string, number>;\n}\n\n/* The forest a depth-first walk in graph order finds. Exported because \"which\n * node ended up whose child\" is the question anyone debugging a tree layout\n * asks first. /\nexport function forestOf(graph: Graph, crossAxis: 'x' \| 'y'): Forest {\n const order = graphOrder(graph);\n const children = new Map<string, GraphNode[]>();\n const depth = new Map<string, number>();\n const roots: GraphNode[] = [];\n\n const claim = (node: GraphNode, at: number): void => {\n depth.set(node.id, at);\n const kids: GraphNode[] = [];\n for (const edge of graph.outgoing(node.id)) {\n if (edge.to === node.id \|\| depth.has(edge.to)) continue;\n const child = graph.node(edge.to);\n if (child === undefined) continue;\n // Claimed on sight rather than inside the recursion, so two siblings\n // sharing a descendant cannot both take it.\n depth.set(child.id, at + 1);\n kids.push(child);\n }\n const ordered = seededOrder(kids, crossAxis, order);\n children.set(node.id, ordered);\n for (const child of ordered) claim(child, at + 1);\n };\n\n const rootish = graph.nodes.filter((node) =>\n graph.incoming(node.id).every((edge) => edge.from === node.id));\n for (const node of seededOrder(rootish, crossAxis, order)) {\n if (depth.has(node.id)) continue;\n roots.push(node);\n claim(node, 0);\n }\n // Whatever the walk could not reach: a disconnected part, or a component\n // every node of which is inside a cycle.\n for (const node of graph.nodes) {\n if (depth.has(node.id)) continue;\n roots.push(node);\n claim(node, 0);\n }\n\n return { roots, children, depth };\n}\n\nexport const tree: LayoutFn = (graph, opts = {}) => {\n const axes = axesFor(opts.direction);\n const nodeGap = opts.nodeGap ?? DEFAULT_NODE_GAP;\n const rankGap = opts.rankGap ?? DEFAULT_RANK_GAP;\n const { roots, children, depth } = forestOf(graph, axes.cross);\n\n const bands = new Map<number, number>();\n for (const node of graph.nodes) {\n const at = depth.get(node.id) ?? 0;\n bands.set(at, Math.max(bands.get(at) ?? 0, extent(node.bounds, axes.rank)));\n }\n const bandStart = new Map<number, number>();\n let along = 0;\n for (const at of [...bands.keys()].sort((a, b) => a - b)) {\n bandStart.set(at, along);\n along += bands.get(at)! + rankGap;\n }\n\n const slots = new Map<string, Slot>();\n\n /* How wide `node`'s whole subtree is on the cross axis: its children's\n * blocks side by side, or the node itself when that is wider. /\n const measured = new Map<string, number>();\n const measure = (node: GraphNode): number => {\n const known = measured.get(node.id);\n if (known !== undefined) return known;\n const kids = children.get(node.id) ?? [];\n let width = 0;\n for (const child of kids) width += measure(child);\n if (kids.length > 0) width += nodeGap (kids.length - 1);\n const block = Math.max(extent(node.bounds, axes.cross), width);\n measured.set(node.id, block);\n return block;\n };\n\n /** Place `node`'s subtree with its block starting at `from`. /\n const place = (node: GraphNode, from: number): void => {\n const kids = children.get(node.id) ?? [];\n const block = measure(node);\n const width = kids.reduce((sum, k) => sum + measure(k), 0)\n + Math.max(0, kids.length - 1) nodeGap;\n\n let cursor = from + (block - width) / 2;\n for (const child of kids) {\n place(child, cursor);\n cursor += measure(child) + nodeGap;\n }\n\n const own = extent(node.bounds, axes.cross);\n const at = depth.get(node.id) ?? 0;\n slots.set(node.id, {\n cross: from + (block - own) / 2,\n rank: bandStart.get(at)! + (bands.get(at)! - extent(node.bounds, axes.rank)) / 2,\n });\n };\n\n let cursor = 0;\n for (const root of roots) {\n place(root, cursor);\n cursor += measure(root) + nodeGap;\n }\n\n return settle(graph, slots, opts);\n};\n","/*\n Running a layout against a scene: `LAYOUTS`, one batch of pose writes, and\n * the action that reaches both.\n \n The split is the point. A layout is a pure function of the graph and is\n * tested as one; `applyLayout` is the only thing that touches a scene, and it\n * writes every move inside a single `scene.batch`, so a re-layout is one undo\n * entry rather than one per node.\n /\nimport {\n translatePoseViaDescriptor,\n AUTO_POSE_DESCRIPTOR,\n type Action,\n type PoseProjection,\n type Scene,\n} from '@weasel-js/core';\nimport { force } from './force';\nimport { buildGraph, type GraphSource } from './graph';\nimport { layered } from './layered';\nimport { tree } from './tree';\nimport type { LayoutFn, LayoutOptions, LayoutResult } from './layout';\nimport type { DiagramNodeReader } from './trait';\n\n/* The layouts this package ships. A consumer's own go in the same shape. /\nexport const LAYOUTS: Readonly<Record<string, LayoutFn>> = Object.freeze({\n layered,\n tree,\n force,\n});\n\nexport interface ApplyLayoutOptions<TPose> {\n geometry?: PoseProjection<TPose>;\n /* The undo entry's name. Default `'Layout'`. /\n label?: string;\n}\n\n/\n Write a layout's answer to the scene, as one undoable batch.\n \n Returns how many nodes moved, which is zero for a layout that had nothing to\n * do — nothing is written and no history entry is pushed.\n \n Nodes are translated, never re-posed from the layout's numbers: a node's\n * pose can be a path or anything else a consumer wired, and only its own\n * descriptor knows how to move one.\n \n A participant that is a container takes its whole subtree along. `setPose`\n * does not cascade — poses are absolute — so a built body would otherwise walk\n * out from under its own label rows with every test green.\n /\nexport function applyLayout<TPose>(\n scene: Scene<unknown, string, TPose>,\n result: LayoutResult,\n opts: ApplyLayoutOptions<TPose> = {},\n): number {\n const poses = layoutPoses(scene, result, opts.geometry);\n if (poses.size === 0) return 0;\n scene.batch(opts.label ?? 'Layout', () => {\n for (const [id, pose] of poses) scene.setPose(id as never, pose);\n });\n // Participants, not the descendants they carried along: a caller asking how\n // much a layout did means the nodes it placed.\n let moved = 0;\n for (const id of result.keys()) if (poses.has(id)) moved++;\n return moved;\n}\n\n/\n The poses a layout result implies, without writing any of them: each moved\n * node translated to its new top-left, and its subtree translated with it.\n \n Split out because a live layout needs the same answer every frame and must\n * not write it — it publishes to the override channel and commits once. The\n * translation is measured from the node's document pose, which a run in flight\n * never changes, so a frame's answer does not depend on the frame before it.\n /\nexport function layoutPoses<TPose>(\n scene: Scene<unknown, string, TPose>,\n result: LayoutResult,\n geometry: PoseProjection<TPose> = AUTO_POSE_DESCRIPTOR as PoseProjection<TPose>,\n): Map<string, TPose> {\n const out = new Map<string, TPose>();\n for (const [id, at] of result) {\n const node = scene.get(id as never);\n if (node === undefined) continue;\n const bounds = geometry.getBounds(node.pose);\n const dx = at.x - bounds.x;\n const dy = at.y - bounds.y;\n if (dx === 0 && dy === 0) continue;\n out.set(id, translatePoseViaDescriptor(node.pose, dx, dy, geometry));\n for (const descendant of subtreeOf(scene, id)) {\n const child = scene.get(descendant as never);\n if (child === undefined) continue;\n out.set(descendant, translatePoseViaDescriptor(child.pose, dx, dy, geometry));\n }\n }\n return out;\n}\n\nfunction subtreeOf<TPose>(scene: Scene<unknown, string, TPose>, id: string): string[] {\n const out: string[] = [];\n const stack = [...scene.childrenOf(id as never)];\n while (stack.length > 0) {\n const next = stack.pop()!;\n out.push(next);\n stack.push(...scene.childrenOf(next));\n }\n return out;\n}\n\n/* The default action id. /\nexport const LAYOUT_ACTION_ID = 'diagram.layout';\n\nexport interface LayoutActionOptions<TPose> {\n /* Where the graph is read from. The same thunk the port affordance takes. /\n source: GraphSource<TPose>;\n /* Default {@link LAYOUT_ACTION_ID}. /\n id?: string;\n label?: string;\n /* Which `<ActionBar group>` it lands in. Default `'diagram'`, alongside\n * connect — give a bar of its own a group of its own. /\n group?: string;\n /* A key in {@link LAYOUTS}, or a layout of the consumer's own. Default\n * `'layered'`. /\n algorithm?: string \| LayoutFn;\n layout?: LayoutOptions;\n read?: DiagramNodeReader;\n geometry?: PoseProjection<TPose>;\n}\n\n/\n `diagram.layout` — rebuild the graph, run a layout, write the result.\n \n A factory rather than a singleton for the reason every other entry point in\n * this package is one: which nodes are in the diagram is the consumer's, and\n * this package has no scene at module scope.\n /\nexport function createLayoutAction<TPose>(opts: LayoutActionOptions<TPose>): Action {\n const algorithm = typeof opts.algorithm === 'function'\n ? opts.algorithm\n : LAYOUTS[opts.algorithm ?? 'layered'] ?? layered;\n const build = {\n ...(opts.read ? { read: opts.read } : {}),\n ...(opts.geometry ? { geometry: opts.geometry } : {}),\n };\n\n return {\n id: opts.id ?? LAYOUT_ACTION_ID,\n label: opts.label ?? 'Lay out diagram',\n group: opts.group ?? 'diagram',\n requires: ['scene'],\n invoker: {\n timing: 'immediate',\n run: (deps) => {\n const scene = deps['scene'] as Scene<unknown, string, TPose> \| undefined;\n if (scene === undefined) return;\n const graph = buildGraph(opts.source, build);\n applyLayout(scene, algorithm(graph, opts.layout), {\n ...(opts.geometry ? { geometry: opts.geometry } : {}),\n ...(opts.label ? { label: opts.label } : {}),\n });\n },\n },\n enabled: () => true as const,\n };\n}\n","/\n Layout you can watch, and push against.\n \n A live layout is a producer on core's `usePoseRun`: each frame it hands back\n * where the participants are, the run publishes that to the scene's override\n * channel, and the whole thing commits as one batch when it settles. Nothing\n * here writes the document.\n \n Two producers, because the two kinds of layout are different processes.\n * `force` is a relaxation whose target changes every tick. `layered` and `tree`\n * know where they are going before they start, so they ease into it.\n \n A node another gesture owns is a pin. The run reports it, `force` holds\n * it with `fx`/`fy` and relaxes its neighbors around it, and an eased layout\n * simply leaves it alone. Dragging a body mid-run is therefore the consumer's\n * ordinary move tool — this package contributes no gesture for it.\n /\nimport { useCallback, useEffect, useMemo, useRef } from 'react';\nimport {\n AUTO_POSE_DESCRIPTOR,\n usePoseRun,\n type EasingFn,\n type NodeId,\n type PoseProjection,\n type PoseRunCtx,\n type PoseRunStep,\n type Scene,\n} from '@weasel-js/core';\nimport { forceRelaxation, type ForceOptions } from './force';\nimport { buildGraph, type Graph, type GraphSource } from './graph';\nimport { layered } from './layered';\nimport { LAYOUTS, layoutPoses } from './layoutAction';\nimport { center, type LayoutFn, type LayoutOptions, type LayoutResult } from './layout';\nimport { tree } from './tree';\nimport type { DiagramNodeReader } from './trait';\n\n/* What a live producer is told, and what it answers with. /\nexport interface LiveLayoutCtx<TPose> {\n /* Nodes another gesture is moving, and where each is drawn. /\n pinned: ReadonlyMap<NodeId, TPose>;\n /* Frames since this run heated, starting at 0. /\n frame: number;\n}\n\n/* A frame of a live layout: where the participants are, and whether it is\n * finished. Positions are top-lefts, the same as a `LayoutResult`. /\nexport interface LiveLayoutFrame {\n result: LayoutResult;\n done: boolean;\n}\n\nexport type LiveLayoutProducer<TPose> = (ctx: LiveLayoutCtx<TPose>) => LiveLayoutFrame;\n\n/* How long an eased layout takes to arrive, in frames. Frame-counted rather\n * than timed, so a background tab resumes where it paused rather than\n * arriving the instant it comes back. /\nconst EASE_FRAMES = 24;\n\n/* Smooth start and end. Inlined rather than pulled from the animator, which\n * is a registry of running tweens, not a curve library. /\nconst easeInOut: EasingFn = (t) => (t < 0.5 ? 2 t * t : 1 - (-2 * t + 2) 2 / 2);\n\nexport interface ForceProducerOptions<TPose> extends ForceOptions {\n geometry?: PoseProjection<TPose>;\n / Alpha held while something is pinned, so the graph keeps answering a drag\n * instead of freezing under it. Default 0.3. /\n dragAlpha?: number;\n}\n\n/\n A relaxation, one tick a frame, done when the simulation settles.\n \n The forces are `forceRelaxation`'s — the same ones the one-shot `force`\n * runs, wound up once here and ticked rather than run to completion.\n \n It does not re-anchor the way the one-shot does. That translation exists\n * so a single 300-tick jump does not move the diagram off where the author left\n * it; a live run cannot jump, every frame being one step from the last, and\n * gravity holds the graph around the centroid it was seeded from. Re-anchoring\n * per frame would also fight a drag: the anchor is measured from where the\n * nodes were, and a pinned node is deliberately somewhere else.\n /\nexport function forceProducer<TPose>(\n graph: Graph,\n opts: ForceProducerOptions<TPose> = {},\n): LiveLayoutProducer<TPose> {\n const geometry = opts.geometry ?? (AUTO_POSE_DESCRIPTOR as PoseProjection<TPose>);\n const relaxation = forceRelaxation(graph, opts);\n const dragAlpha = opts.dragAlpha ?? 0.3;\n\n return ({ pinned }) => {\n for (const node of graph.nodes) {\n const body = relaxation.byId.get(node.id);\n if (body === undefined) continue;\n const held = pinned.get(node.id as NodeId);\n if (held !== undefined) {\n // A dragged node holds its neighbors while they relax, which is `fx` /\n // `fy` on the integrator rather than a correction applied afterward.\n const bounds = geometry.getBounds(held);\n body.fx = center(bounds, 'x');\n body.fy = center(bounds, 'y');\n } else if (!relaxation.pinned.has(node.id)) {\n delete body.fx;\n delete body.fy;\n }\n }\n // A pin is a live edit, so the run keeps its temperature up until the\n // pointer lets go.\n relaxation.sim.alphaTarget(pinned.size > 0 ? dragAlpha : 0);\n relaxation.sim.tick();\n return { result: relaxation.placed(), done: relaxation.sim.isSettled() };\n };\n}\n\nexport interface EasedProducerOptions {\n layout?: LayoutOptions;\n /* Frames to arrive in. Default 24. /\n frames?: number;\n easing?: EasingFn;\n}\n\n/\n A layout that knows its destination, walked into place.\n \n The target is computed once, from the graph as it stood when the run heated;\n * each frame is that target scaled by the easing curve, measured from where the\n * nodes started. A pinned node is dropped from the target rather than fought\n * over.\n /\nexport function easedProducer<TPose>(\n graph: Graph,\n algorithm: LayoutFn,\n opts: EasedProducerOptions = {},\n): LiveLayoutProducer<TPose> {\n const frames = opts.frames ?? EASE_FRAMES;\n const easing = opts.easing ?? easeInOut;\n const target = algorithm(graph, opts.layout);\n const from = new Map<string, { x: number; y: number }>();\n for (const node of graph.nodes) from.set(node.id, { x: node.bounds.x, y: node.bounds.y });\n\n return ({ pinned, frame }) => {\n const t = Math.min((frame + 1) / frames, 1);\n const u = easing(t);\n const result = new Map<string, { x: number; y: number }>();\n for (const [id, to] of target) {\n if (pinned.has(id as NodeId)) continue;\n const start = from.get(id);\n if (start === undefined) continue;\n result.set(id, {\n x: start.x + (to.x - start.x) u,\n y: start.y + (to.y - start.y) * u,\n });\n }\n return { result, done: t >= 1 };\n };\n}\n\nexport interface UseLiveLayoutOptions<TPose> {\n scene: Scene<unknown, string, TPose>;\n /** Where the graph is read from. The same thunk the port affordance takes. /\n source: GraphSource<TPose>;\n /* A key in `LAYOUTS`, or a layout of the consumer's own. `'force'` relaxes\n * continuously; anything else eases to its answer. Default `'force'`. /\n algorithm?: string \| LayoutFn;\n layout?: LayoutOptions;\n force?: ForceOptions;\n /* Frames an eased layout takes to arrive. Default 24. /\n frames?: number;\n easing?: EasingFn;\n read?: DiagramNodeReader;\n geometry?: PoseProjection<TPose>;\n /* The undo entry's name. Default `'Layout'`. /\n label?: string;\n /* Fires once the run has settled or been stopped and its poses are in the\n * document, with how many participants moved. /\n onSettle?: (moved: number) => void;\n /* Whether a node or edge appearing or disappearing re-heats the run.\n * Default true — a diagram that ignores a new edge looks broken. /\n reheatOnGraphChange?: boolean;\n /* Clock injection, for tests. Defaults to `requestAnimationFrame`. /\n requestFrame?: (cb: (t: number) => void) => number;\n cancelFrame?: (handle: number) => void;\n}\n\nexport interface LiveLayout {\n /* Heat and run. Idempotent while running. /\n start(): void;\n /* Finish now: commit where the nodes stand. /\n stop(): void;\n /* Abandon: the document keeps the poses it had. /\n cancel(): void;\n /* Rebuild the graph and run again from where the nodes are now. /\n restart(): void;\n isRunning(): boolean;\n}\n\n/* The shape of a graph, as a string that changes when a node or edge does. /\nfunction shapeOf(graph: Graph): string {\n const nodes = graph.nodes.map((n) => n.id).sort().join(',');\n const edges = graph.edges.map((e) => `${e.from}>${e.to}`).sort().join(',');\n return `${nodes}\|${edges}`;\n}\n\n/\n Run a layout live against a scene.\n \n The returned handle is stable. Dragging a participant while it runs needs no\n * wiring: the consumer's move tool publishes an override, and the run treats\n * that as a pin.\n /\nexport function useLiveLayout<TPose>(opts: UseLiveLayoutOptions<TPose>): LiveLayout {\n const optsRef = useRef(opts);\n optsRef.current = opts;\n\n const producer = useRef<LiveLayoutProducer<TPose> \| null>(null);\n const producerFrame = useRef(0);\n const shape = useRef('');\n\n const build = useCallback((): void => {\n const o = optsRef.current;\n const graph = buildGraph(o.source, {\n ...(o.read ? { read: o.read } : {}),\n ...(o.geometry ? { geometry: o.geometry } : {}),\n });\n shape.current = shapeOf(graph);\n producerFrame.current = 0;\n const algorithm = o.algorithm ?? 'force';\n if (algorithm === 'force') {\n producer.current = forceProducer<TPose>(graph, {\n ...o.layout, ...o.force,\n ...(o.geometry ? { geometry: o.geometry } : {}),\n });\n return;\n }\n const fn = typeof algorithm === 'function' ? algorithm : LAYOUTS[algorithm] ?? layered;\n producer.current = easedProducer<TPose>(graph, fn, {\n ...(o.layout ? { layout: o.layout } : {}),\n ...(o.frames === undefined ? {} : { frames: o.frames }),\n ...(o.easing ? { easing: o.easing } : {}),\n });\n }, []);\n\n const step = useCallback((ctx: PoseRunCtx<TPose>): PoseRunStep<TPose> => {\n const o = optsRef.current;\n if (producer.current === null) return { poses: [], done: true };\n const { result, done } = producer.current({\n pinned: ctx.pinned,\n frame: producerFrame.current++,\n });\n // A pinned participant takes its subtree out of the frame with it. The run\n // skips the participant itself, but its rows and labels are ids of their\n // own — left in, they would be published from the pose the document still\n // holds while the gesture carries the box somewhere else.\n let placed = result;\n if (ctx.pinned.size > 0) {\n const held = new Map(result);\n for (const id of ctx.pinned.keys()) held.delete(id as string);\n placed = held;\n }\n const poses = layoutPoses(o.scene, placed, o.geometry);\n return { poses: [...poses] as [NodeId, TPose][], done };\n }, []);\n\n const run = usePoseRun<TPose>({\n scene: opts.scene,\n step,\n onCommit: (moved) => optsRef.current.onSettle?.(moved),\n ...(opts.label ? { label: opts.label } : {}),\n ...(opts.requestFrame ? { requestFrame: opts.requestFrame } : {}),\n ...(opts.cancelFrame ? { cancelFrame: opts.cancelFrame } : {}),\n });\n\n // A node or edge appearing or disappearing is a new problem, so the run\n // re-heats rather than finishing the one it started on.\n useEffect(() => {\n if (opts.reheatOnGraphChange === false) return;\n return opts.scene.subscribe(() => {\n if (!run.isRunning()) return;\n const o = optsRef.current;\n const graph = buildGraph(o.source, {\n ...(o.read ? { read: o.read } : {}),\n ...(o.geometry ? { geometry: o.geometry } : {}),\n });\n if (shapeOf(graph) === shape.current) return;\n build();\n });\n // eslint-disable-next-line react-hooks/exhaustive-deps\n }, [opts.scene, opts.reheatOnGraphChange, run, build]);\n\n return useMemo<LiveLayout>(() => ({\n start() {\n if (run.isRunning()) return;\n build();\n run.start();\n },\n stop: () => { run.stop(); },\n cancel: () => { run.cancel(); },\n restart() {\n run.cancel();\n build();\n run.start();\n },\n isRunning: () => run.isRunning(),\n }), [run, build]);\n}\n\n/* The layouts that ease rather than relax, for a consumer choosing one. /\nexport const EASED_LAYOUTS: Readonly<Record<string, LayoutFn>> = Object.freeze({\n layered,\n tree,\n});\n","/\n The painter for a node whose trait names an `outline`.\n \n Registered the way every other trait's renderer is — a `NodeShapeEntry` with\n * a `matches` over the node's data — so a diagram body is picked, clipped and\n * area-selected by the same walk as everything else, and a participant that\n * already had a look of its own (a text block, an image, a path) keeps it by\n * naming no outline at all.\n \n Rows are not painted here. A built body's rows are ordinary scene nodes\n * under the container, so the kit's own text painter draws them and text\n * editing, selection and styling work on them without a special case.\n /\nimport {\n RECT_POSE_DESCRIPTOR,\n registerNodeShape,\n type FillStyle,\n type NodeShapeEntry,\n type PoseProjection,\n type Stroke,\n} from '@weasel-js/core';\nimport { outlinePath } from './outline';\nimport { diagramNodeOf, type DiagramNodeReader } from './trait';\n\nexport interface DiagramShapeOptions<TPose> {\n /* Distinguishes one registration from another, and is what the disposer\n * removes. Default `'diagram:outline'`. /\n id?: string;\n /* How the trait is read. Default: the node's own `data.diagram`. /\n read?: DiagramNodeReader;\n /* Reads the box the outline is built in. Default `RECT_POSE_DESCRIPTOR`. /\n geometry?: PoseProjection<TPose>;\n /* Painted when the node's data declares neither. /\n defaultFill?: FillStyle \| null;\n defaultStroke?: Stroke \| null;\n}\n\n/* The entry, for a consumer composing their own painter list. /\nexport function diagramShape<TPose>(\n opts: DiagramShapeOptions<TPose> = {},\n): NodeShapeEntry<unknown, TPose> {\n const geometry = opts.geometry ?? (RECT_POSE_DESCRIPTOR as PoseProjection<TPose>);\n const outlineOf = (node: { id: string; kind: 'leaf' \| 'container'; data: unknown }) =>\n diagramNodeOf(node, opts.read)?.outline;\n\n return {\n id: opts.id ?? 'diagram:outline',\n matches: (node) => outlineOf(node) !== undefined,\n paint: (node, pose) => {\n const outline = outlineOf(node);\n if (outline === undefined) return [];\n const d = node.data as { fill?: FillStyle \| null; stroke?: Stroke \| null };\n const fill = d.fill === undefined ? opts.defaultFill : d.fill;\n const stroke = d.stroke === undefined ? opts.defaultStroke : d.stroke;\n return [{\n kind: 'path',\n path: outlinePath(outline, geometry.getBounds(pose)),\n ...(fill ? { fill } : {}),\n ...(stroke ? { stroke } : {}),\n }];\n },\n // The drawn boundary, so picking and clipping follow the diamond rather\n // than its bounding box.\n silhouette: (node, pose) => {\n const outline = outlineOf(node);\n return outline === undefined ? null : outlinePath(outline, geometry.getBounds(pose));\n },\n };\n}\n\n/\n Register {@link diagramShape}. Returns the disposer, and takes `'high'`\n * priority so a body outline wins over a `data.shape` or `data.path` the same\n * node may also carry.\n */\nexport function registerDiagramShape<TPose>(opts: DiagramShapeOptions<TPose> = {}): () => void {\n return registerNodeShape(diagramShape(opts), { priority: 'high' });\n}\n"]}
1	+ {"version":3,"sources":["../src/outline.ts","../src/onOutline.ts","../src/trait.ts","../src/ports.ts","../src/body.ts","../src/label.ts","../src/edge.ts","../src/portAffordance.ts","../src/connect.ts","../src/portLayer.ts","../src/contribution.ts","../src/graph.ts","../src/layout.ts","../src/force.ts","../src/layered.ts","../src/tree.ts","../src/layoutAction.ts","../src/live.ts","../src/shape.ts"],"names":["left","right","top","bottom","center","AUTO_POSE_DESCRIPTOR","push","cursor","translatePoseViaDescriptor"],"mappings":";;;;AAwBA,IAAM,IAAA,GAAO,GAAA;AAIb,IAAM,KAAA,GAAQ,kBAAA;AAIP,SAAS,WAAA,CAAY,SAAkB,MAAA,EAAsB;AAClE,EAAA,IAAI,OAAO,OAAA,KAAY,QAAA,EAAU,OAAO,OAAA;AACxC,EAAA,MAAM,EAAE,CAAA,EAAG,CAAA,EAAG,OAAO,CAAA,EAAG,MAAA,EAAQ,GAAE,GAAI,MAAA;AACtC,EAAA,IAAI,KAAK,CAAA,IAAK,CAAA,IAAK,CAAA,EAAG,OAAO,SAAS,CAAA,EAAG,CAAA,EAAG,IAAA,CAAK,GAAA,CAAI,GAAG,CAAC,CAAA,EAAG,KAAK,GAAA,CAAI,CAAA,EAAG,CAAC,CAAC,CAAA;AAE1E,EAAA,QAAQ,OAAA;AAAS,IACf,KAAK,MAAA;AACH,MAAA,OAAO,QAAA,CAAS,CAAA,EAAG,CAAA,EAAG,CAAA,EAAG,CAAC,CAAA;AAAA,IAE5B,KAAK,SAAA;AACH,MAAA,OAAO,iBAAA,CAAkB;AAAA,QACvB,EAAE,CAAA,EAAG,CAAA,GAAI,CAAA,GAAI,GAAG,CAAA,EAAE;AAAA,QAClB,EAAE,CAAA,EAAG,CAAA,GAAI,GAAG,CAAA,EAAG,CAAA,GAAI,IAAI,CAAA,EAAE;AAAA,QACzB,EAAE,CAAA,EAAG,CAAA,GAAI,IAAI,CAAA,EAAG,CAAA,EAAG,IAAI,CAAA,EAAE;AAAA,QACzB,EAAE,CAAA,EAAG,CAAA,EAAG,CAAA,GAAI,IAAI,CAAA;AAAE,OACnB,CAAA;AAAA,IAEH,KAAK,eAAA,EAAiB;AAEpB,MAAA,MAAM,OAAO,IAAA,CAAK,GAAA,CAAI,CAAA,GAAI,IAAA,EAAM,IAAI,CAAC,CAAA;AACrC,MAAA,OAAO,iBAAA,CAAkB;AAAA,QACvB,EAAE,CAAA,EAAG,CAAA,GAAI,IAAA,EAAM,CAAA,EAAE;AAAA,QACjB,EAAE,CAAA,EAAG,CAAA,GAAI,CAAA,EAAG,CAAA,EAAE;AAAA,QACd,EAAE,CAAA,EAAG,CAAA,GAAI,IAAI,IAAA,EAAM,CAAA,EAAG,IAAI,CAAA,EAAE;AAAA,QAC5B,EAAE,CAAA,EAAG,CAAA,EAAG,CAAA,GAAI,CAAA;AAAE,OACf,CAAA;AAAA,IACH;AAAA,IAEA,KAAK,SAAA;AACH,MAAA,OAAO,WAAA,CAAY,CAAA,EAAG,CAAA,EAAG,CAAA,EAAG,CAAC,CAAA;AAAA;AAEnC;AAKA,SAAS,WAAA,CAAY,CAAA,EAAW,CAAA,EAAW,CAAA,EAAW,CAAA,EAAiB;AACrE,EAAA,MAAM,CAAA,GAAI,IAAA,CAAK,GAAA,CAAI,CAAA,EAAG,CAAC,CAAA,GAAI,CAAA;AAC3B,EAAA,MAAM,IAAI,CAAA,GAAI,KAAA;AACd,EAAA,MAAM,CAAA,GAAI,IAAI,WAAA,EAAY;AAE1B,EAAA,IAAI,KAAK,CAAA,EAAG;AACV,IAAA,MAAMA,QAAO,CAAA,GAAI,CAAA;AACjB,IAAA,MAAMC,MAAAA,GAAQ,IAAI,CAAA,GAAI,CAAA;AACtB,IAAA,MAAMC,IAAAA,GAAM,CAAA;AACZ,IAAA,MAAMC,UAAS,CAAA,GAAI,CAAA;AACnB,IAAA,MAAM,IAAA,GAAO,IAAI,CAAA,GAAI,CAAA;AACrB,IAAA,OAAO,CAAA,CACJ,MAAA,CAAOH,KAAAA,EAAME,IAAG,CAAA,CAChB,MAAA,CAAOD,MAAAA,EAAOC,IAAG,CAAA,CACjB,OAAA,CAAQD,MAAAA,GAAQ,CAAA,EAAGC,IAAAA,EAAK,CAAA,GAAI,CAAA,EAAG,IAAA,GAAO,CAAA,EAAG,CAAA,GAAI,CAAA,EAAG,IAAI,CAAA,CACpD,OAAA,CAAQ,CAAA,GAAI,CAAA,EAAG,IAAA,GAAO,CAAA,EAAGD,MAAAA,GAAQ,CAAA,EAAGE,OAAAA,EAAQF,QAAOE,OAAM,CAAA,CACzD,MAAA,CAAOH,KAAAA,EAAMG,OAAM,CAAA,CACnB,OAAA,CAAQH,KAAAA,GAAO,CAAA,EAAGG,OAAAA,EAAQ,CAAA,EAAG,IAAA,GAAO,CAAA,EAAG,CAAA,EAAG,IAAI,CAAA,CAC9C,OAAA,CAAQ,CAAA,EAAG,IAAA,GAAO,CAAA,EAAGH,KAAAA,GAAO,CAAA,EAAGE,IAAAA,EAAKF,KAAAA,EAAME,IAAG,CAAA,CAC7C,KAAA,EAAM,CACN,KAAA,EAAM;AAAA,EACX;AAEA,EAAA,MAAM,MAAM,CAAA,GAAI,CAAA;AAChB,EAAA,MAAM,MAAA,GAAS,IAAI,CAAA,GAAI,CAAA;AACvB,EAAA,MAAM,IAAA,GAAO,CAAA;AACb,EAAA,MAAM,QAAQ,CAAA,GAAI,CAAA;AAClB,EAAA,MAAM,IAAA,GAAO,IAAI,CAAA,GAAI,CAAA;AACrB,EAAA,OAAO,CAAA,CACJ,MAAA,CAAO,KAAA,EAAO,GAAG,CAAA,CACjB,MAAA,CAAO,KAAA,EAAO,MAAM,CAAA,CACpB,OAAA,CAAQ,KAAA,EAAO,MAAA,GAAS,CAAA,EAAG,IAAA,GAAO,CAAA,EAAG,CAAA,GAAI,CAAA,EAAG,IAAA,EAAM,CAAA,GAAI,CAAC,CAAA,CACvD,OAAA,CAAQ,IAAA,GAAO,CAAA,EAAG,CAAA,GAAI,CAAA,EAAG,IAAA,EAAM,MAAA,GAAS,CAAA,EAAG,MAAM,MAAM,CAAA,CACvD,MAAA,CAAO,IAAA,EAAM,GAAG,CAAA,CAChB,OAAA,CAAQ,IAAA,EAAM,GAAA,GAAM,CAAA,EAAG,IAAA,GAAO,CAAA,EAAG,CAAA,EAAG,IAAA,EAAM,CAAC,CAAA,CAC3C,OAAA,CAAQ,IAAA,GAAO,CAAA,EAAG,CAAA,EAAG,KAAA,EAAO,GAAA,GAAM,CAAA,EAAG,KAAA,EAAO,GAAG,CAAA,CAC/C,KAAA,EAAM,CACN,KAAA,EAAM;AACX;AAYO,SAAS,UAAA,CAAW,SAAkB,MAAA,EAAwB;AACnE,EAAA,IAAI,OAAO,OAAA,KAAY,QAAA,EAAU,OAAO,MAAA;AACxC,EAAA,MAAM,EAAE,CAAA,EAAG,CAAA,EAAG,OAAO,CAAA,EAAG,MAAA,EAAQ,GAAE,GAAI,MAAA;AACtC,EAAA,QAAQ,OAAA;AAAS,IACf,KAAK,MAAA;AACH,MAAA,OAAO,MAAA;AAAA,IACT,KAAK,SAAA;AAEH,MAAA,OAAO,EAAE,CAAA,EAAG,CAAA,GAAI,CAAA,GAAI,GAAG,CAAA,EAAG,CAAA,GAAI,CAAA,GAAI,CAAA,EAAG,KAAA,EAAO,CAAA,GAAI,CAAA,EAAG,MAAA,EAAQ,IAAI,CAAA,EAAE;AAAA,IACnE,KAAK,eAAA,EAAiB;AACpB,MAAA,MAAM,OAAO,IAAA,CAAK,GAAA,CAAI,CAAA,GAAI,IAAA,EAAM,IAAI,CAAC,CAAA;AACrC,MAAA,OAAO,EAAE,CAAA,EAAG,CAAA,GAAI,IAAA,EAAM,GAAG,KAAA,EAAO,IAAA,CAAK,GAAA,CAAI,CAAA,GAAI,IAAA,GAAO,CAAA,EAAG,CAAC,CAAA,EAAG,QAAQ,CAAA,EAAE;AAAA,IACvE;AAAA,IACA,KAAK,SAAA,EAAW;AACd,MAAA,MAAM,CAAA,GAAI,IAAA,CAAK,GAAA,CAAI,CAAA,EAAG,CAAC,CAAA,GAAI,CAAA;AAC3B,MAAA,OAAO,CAAA,IAAK,CAAA,GACR,EAAE,CAAA,EAAG,IAAI,CAAA,EAAG,CAAA,EAAG,KAAA,EAAO,IAAA,CAAK,GAAA,CAAI,CAAA,GAAI,CAAA,GAAI,CAAA,EAAG,CAAC,CAAA,EAAG,MAAA,EAAQ,CAAA,EAAE,GACxD,EAAE,CAAA,EAAG,CAAA,EAAG,CAAA,GAAI,GAAG,KAAA,EAAO,CAAA,EAAG,MAAA,EAAQ,IAAA,CAAK,GAAA,CAAI,CAAA,GAAI,CAAA,GAAI,CAAA,EAAG,CAAC,CAAA,EAAE;AAAA,IAC9D;AAAA;AAEJ;AAUO,SAAS,aAAA,CACd,SACA,OAAA,EACmC;AACnC,EAAA,IAAI,OAAO,OAAA,KAAY,QAAA,EAAU,OAAO,OAAA;AACxC,EAAA,QAAQ,OAAA;AAAS,IACf,KAAK,MAAA;AACH,MAAA,OAAO,OAAA;AAAA,IACT,KAAK,SAAA;AACH,MAAA,OAAO,EAAE,OAAO,OAAA,CAAQ,KAAA,GAAQ,GAAG,MAAA,EAAQ,OAAA,CAAQ,SAAS,CAAA,EAAE;AAAA,IAChE,KAAK,eAAA;AACH,MAAA,OAAO,EAAE,OAAO,OAAA,CAAQ,KAAA,IAAS,IAAI,IAAA,GAAO,CAAA,CAAA,EAAI,MAAA,EAAQ,OAAA,CAAQ,MAAA,EAAO;AAAA,IACzE,KAAK,SAAA;AACH,MAAA,OAAO,EAAE,OAAO,OAAA,CAAQ,KAAA,GAAQ,QAAQ,MAAA,EAAQ,MAAA,EAAQ,QAAQ,MAAA,EAAO;AAAA;AAE7E;ACpJA,IAAM,SAAA,GAAY,IAAA;AAGX,SAAS,eAAA,CAAgB,SAAkB,MAAA,EAA0B;AAC1E,EAAA,MAAM,IAAA,GAAO,WAAA,CAAY,OAAA,EAAS,MAAM,CAAA;AACxC,EAAA,OAAO,YAAY,IAAI,CAAA;AACzB;AAEA,SAAS,YAAY,IAAA,EAAsB;AACzC,EAAA,IAAI,IAAA,CAAK,SAAS,MAAA,EAAQ;AACxB,IAAA,MAAM,EAAE,CAAA,EAAG,CAAA,EAAG,OAAO,CAAA,EAAG,MAAA,EAAQ,GAAE,GAAI,IAAA;AACtC,IAAA,OAAO,CAAC,CAAA,EAAG,CAAA,EAAG,CAAA,GAAI,GAAG,CAAA,EAAG,CAAA,GAAI,CAAA,EAAG,CAAA,GAAI,CAAA,EAAG,CAAA,EAAG,CAAA,GAAI,CAAA,EAAG,GAAG,CAAC,CAAA;AAAA,EACtD;AACA,EAAA,MAAM,MAAgB,EAAC;AACvB,EAAA,MAAM,EAAE,QAAA,EAAU,MAAA,EAAO,GAAI,IAAA;AAC7B,EAAA,IAAI,EAAA,GAAK,CAAA;AACT,EAAA,IAAI,EAAA,GAAK,CAAA;AACT,EAAA,IAAI,EAAA,GAAK,CAAA;AACT,EAAA,IAAI,EAAA,GAAK,CAAA;AACT,EAAA,IAAI,EAAA,GAAK,CAAA;AACT,EAAA,KAAA,MAAW,OAAO,QAAA,EAAU;AAC1B,IAAA,IAAI,QAAQ,MAAA,EAAQ;AAClB,MAAA,EAAA,GAAK,OAAO,EAAE,CAAA;AAAI,MAAA,EAAA,GAAK,MAAA,CAAO,KAAK,CAAC,CAAA;AAAI,MAAA,EAAA,IAAM,CAAA;AAC9C,MAAA,EAAA,GAAK,EAAA;AAAI,MAAA,EAAA,GAAK,EAAA;AACd,MAAA,GAAA,CAAI,IAAA,CAAK,IAAI,EAAE,CAAA;AAAA,IACjB,CAAA,MAAA,IAAW,QAAQ,MAAA,EAAQ;AACzB,MAAA,EAAA,GAAK,OAAO,EAAE,CAAA;AAAI,MAAA,EAAA,GAAK,MAAA,CAAO,KAAK,CAAC,CAAA;AAAI,MAAA,EAAA,IAAM,CAAA;AAC9C,MAAA,GAAA,CAAI,IAAA,CAAK,IAAI,EAAE,CAAA;AAAA,IACjB,CAAA,MAAA,IAAW,QAAQ,MAAA,EAAQ;AACzB,MAAA,MAAM,KAAK,MAAA,CAAO,EAAE,GAAI,EAAA,GAAK,MAAA,CAAO,KAAK,CAAC,CAAA;AAC1C,MAAA,MAAM,EAAA,GAAK,OAAO,EAAA,GAAK,CAAC,GAAI,EAAA,GAAK,MAAA,CAAO,KAAK,CAAC,CAAA;AAC9C,MAAA,MAAM,EAAA,GAAK,OAAO,EAAA,GAAK,CAAC,GAAI,EAAA,GAAK,MAAA,CAAO,KAAK,CAAC,CAAA;AAC9C,MAAA,EAAA,IAAM,CAAA;AACN,MAAA,YAAA,CAAa,EAAA,EAAI,IAAI,EAAA,EAAI,EAAA,EAAI,IAAI,EAAA,EAAI,EAAA,EAAI,EAAA,EAAI,SAAA,EAAW,GAAG,CAAA;AAC3D,MAAA,EAAA,GAAK,EAAA;AAAI,MAAA,EAAA,GAAK,EAAA;AAAA,IAChB,CAAA,MAAA,IAAW,QAAQ,MAAA,EAAQ;AAEzB,MAAA,MAAM,KAAK,MAAA,CAAO,EAAE,GAAI,EAAA,GAAK,MAAA,CAAO,KAAK,CAAC,CAAA;AAC1C,MAAA,MAAM,EAAA,GAAK,OAAO,EAAA,GAAK,CAAC,GAAI,EAAA,GAAK,MAAA,CAAO,KAAK,CAAC,CAAA;AAC9C,MAAA,EAAA,IAAM,CAAA;AACN,MAAA,YAAA;AAAA,QACE,EAAA;AAAA,QAAI,EAAA;AAAA,QACJ,EAAA,GAAM,CAAA,GAAI,CAAA,IAAM,EAAA,GAAK,EAAA,CAAA;AAAA,QAAK,EAAA,GAAM,CAAA,GAAI,CAAA,IAAM,EAAA,GAAK,EAAA,CAAA;AAAA,QAC/C,EAAA,GAAM,CAAA,GAAI,CAAA,IAAM,EAAA,GAAK,EAAA,CAAA;AAAA,QAAK,EAAA,GAAM,CAAA,GAAI,CAAA,IAAM,EAAA,GAAK,EAAA,CAAA;AAAA,QAC/C,EAAA;AAAA,QAAI,EAAA;AAAA,QAAI,SAAA;AAAA,QAAW;AAAA,OACrB;AACA,MAAA,EAAA,GAAK,EAAA;AAAI,MAAA,EAAA,GAAK,EAAA;AAAA,IAChB,CAAA,MAAA,IAAW,QAAQ,MAAA,EAAQ;AACzB,MAAA,GAAA,CAAI,IAAA,CAAK,IAAI,EAAE,CAAA;AACf,MAAA,EAAA,GAAK,EAAA;AAAI,MAAA,EAAA,GAAK,EAAA;AAAA,IAChB;AAAA,EACF;AAEA,EAAA,IAAI,IAAI,MAAA,IAAU,CAAA,KAAM,IAAI,CAAC,CAAA,KAAM,IAAI,GAAA,CAAI,MAAA,GAAS,CAAC,CAAA,IAAK,IAAI,CAAC,CAAA,KAAM,IAAI,GAAA,CAAI,MAAA,GAAS,CAAC,CAAA,CAAA,EAAI;AACzF,IAAA,GAAA,CAAI,KAAK,GAAA,CAAI,CAAC,CAAA,EAAI,GAAA,CAAI,CAAC,CAAE,CAAA;AAAA,EAC3B;AACA,EAAA,OAAO,GAAA;AACT;AASO,SAAS,MAAA,CACd,IAAA,EACAE,OAAAA,EACA,KAAA,EACiC;AACjC,EAAA,MAAM,EAAA,GAAK,KAAA,CAAM,CAAA,GAAIA,OAAAA,CAAO,CAAA;AAC5B,EAAA,MAAM,EAAA,GAAK,KAAA,CAAM,CAAA,GAAIA,OAAAA,CAAO,CAAA;AAC5B,EAAA,IAAI,EAAA,KAAO,CAAA,IAAK,EAAA,KAAO,CAAA,EAAG,OAAO,IAAA;AACjC,EAAA,IAAI,KAAA,GAAQ,CAAA,QAAA;AACZ,EAAA,IAAI,GAAA,GAAuC,IAAA;AAC3C,EAAA,KAAA,IAAS,IAAI,CAAA,EAAG,CAAA,GAAI,IAAI,IAAA,CAAK,MAAA,EAAQ,KAAK,CAAA,EAAG;AAC3C,IAAA,MAAM,KAAK,IAAA,CAAK,CAAC,GAAI,EAAA,GAAK,IAAA,CAAK,IAAI,CAAC,CAAA;AACpC,IAAA,MAAM,EAAA,GAAK,KAAK,CAAA,GAAI,CAAC,GAAI,EAAA,GAAK,IAAA,CAAK,IAAI,CAAC,CAAA;AACxC,IAAA,MAAM,KAAK,EAAA,GAAK,EAAA;AAChB,IAAA,MAAM,KAAK,EAAA,GAAK,EAAA;AAChB,IAAA,MAAM,KAAA,GAAQ,EAAA,GAAK,EAAA,GAAK,EAAA,GAAK,EAAA;AAC7B,IAAA,IAAI,UAAU,CAAA,EAAG;AAEjB,IAAA,MAAM,CAAA,GAAA,CAAA,CAAM,KAAKA,OAAAA,CAAO,CAAA,IAAK,MAAM,EAAA,GAAKA,OAAAA,CAAO,KAAK,EAAA,IAAM,KAAA;AAC1D,IAAA,MAAM,CAAA,GAAA,CAAA,CAAM,KAAKA,OAAAA,CAAO,CAAA,IAAK,MAAM,EAAA,GAAKA,OAAAA,CAAO,KAAK,EAAA,IAAM,KAAA;AAC1D,IAAA,IAAI,CAAA,GAAI,CAAA,IAAK,CAAA,GAAI,CAAA,IAAK,IAAI,CAAA,EAAG;AAC7B,IAAA,IAAI,IAAI,KAAA,EAAO;AACb,MAAA,KAAA,GAAQ,CAAA;AACR,MAAA,GAAA,GAAM,EAAE,CAAA,EAAGA,OAAAA,CAAO,CAAA,GAAI,EAAA,GAAK,GAAG,CAAA,EAAGA,OAAAA,CAAO,CAAA,GAAI,EAAA,GAAK,CAAA,EAAE;AAAA,IACrD;AAAA,EACF;AACA,EAAA,OAAO,GAAA;AACT;AAMO,SAAS,cAAA,CACd,KAAA,EACA,OAAA,EACA,MAAA,EACQ;AACR,EAAA,IAAI,MAAA,CAAO,SAAS,CAAA,IAAK,MAAA,CAAO,UAAU,CAAA,EAAG,OAAO,CAAC,GAAG,KAAK,CAAA;AAC7D,EAAA,MAAM,IAAA,GAAO,eAAA,CAAgB,OAAA,EAAS,MAAM,CAAA;AAC5C,EAAA,MAAMA,OAAAA,GAAS,EAAE,CAAA,EAAG,MAAA,CAAO,CAAA,GAAI,MAAA,CAAO,KAAA,GAAQ,CAAA,EAAG,CAAA,EAAG,MAAA,CAAO,CAAA,GAAI,MAAA,CAAO,SAAS,CAAA,EAAE;AACjF,EAAA,OAAO,KAAA,CAAM,GAAA,CAAI,CAAC,IAAA,KAAS;AACzB,IAAA,MAAM,GAAA,GAAM,MAAA,CAAO,IAAA,EAAMA,OAAAA,EAAQ,KAAK,KAAK,CAAA;AAC3C,IAAA,OAAO,QAAQ,IAAA,GAAO,IAAA,GAAO,EAAE,GAAG,IAAA,EAAM,OAAO,GAAA,EAAI;AAAA,EACrD,CAAC,CAAA;AACH;;;AC3GO,IAAM,iBAAA,GAAoB;AAgC1B,IAAM,aAAA,GAAmC,CAAC,IAAA,KAAS;AACxD,EAAA,MAAM,OAAO,IAAA,CAAK,IAAA;AAClB,EAAA,IAAI,IAAA,KAAS,IAAA,IAAQ,OAAO,IAAA,KAAS,UAAU,OAAO,IAAA;AACtD,EAAA,MAAM,KAAA,GAAS,KAAiC,iBAAiB,CAAA;AACjE,EAAA,IAAI,KAAA,KAAU,IAAA,IAAQ,OAAO,KAAA,KAAU,UAAU,OAAO,IAAA;AACxD,EAAA,IAAI,MAAA,IAAU,KAAA,IAAS,IAAA,IAAQ,KAAA,EAAO,OAAO,IAAA;AAC7C,EAAA,OAAO,KAAA;AACT;AAUO,SAAS,mBAAmB,OAAA,EAAyD;AAC1F,EAAA,MAAM,IAAA,uBAAW,GAAA,EAAY;AAC7B,EAAA,KAAA,MAAW,SAAS,OAAA,EAAS;AAC3B,IAAA,IAAI,IAAA,CAAK,GAAA,CAAI,KAAA,CAAM,IAAI,CAAA,EAAG;AACxB,MAAA,MAAM,IAAI,KAAA,CAAM,CAAA,0CAAA,EAA6C,KAAA,CAAM,IAAI,CAAA,CAAA,CAAG,CAAA;AAAA,IAC5E;AACA,IAAA,IAAA,CAAK,GAAA,CAAI,MAAM,IAAI,CAAA;AAAA,EACrB;AACA,EAAA,OAAO,CAAC,IAAA,KAAS;AACf,IAAA,MAAM,GAAA,GAAM,cAAc,IAAI,CAAA;AAC9B,IAAA,IAAI,GAAA,KAAQ,MAAM,OAAO,GAAA;AACzB,IAAA,KAAA,MAAW,SAAS,OAAA,EAAS;AAC3B,MAAA,IAAI,CAAC,KAAA,CAAM,OAAA,CAAQ,IAAA,CAAK,IAAI,CAAA,EAAG;AAC/B,MAAA,OAAO,OAAO,MAAM,KAAA,KAAU,UAAA,GAAa,MAAM,KAAA,CAAM,IAAA,CAAK,IAAI,CAAA,GAAI,KAAA,CAAM,KAAA;AAAA,IAC5E;AACA,IAAA,OAAO,IAAA;AAAA,EACT,CAAA;AACF;AAGO,SAAS,aAAA,CACd,IAAA,EACA,IAAA,GAA0B,aAAA,EACN;AACpB,EAAA,OAAO,KAAK,IAAI,CAAA;AAClB;AAGO,SAAS,QAAA,CAAS,MAAuB,IAAA,EAAmC;AACjF,EAAA,OAAO,aAAA,CAAc,IAAA,EAAM,IAAI,CAAA,EAAG,MAAA,KAAW,IAAA;AAC/C;;;AC9EO,IAAM,OAAA,GAAU;AAAA,EACrB,EAAA,EAAI,EAAE,CAAA,EAAG,CAAA,EAAG,GAAG,CAAA,EAAE;AAAA,EACjB,CAAA,EAAG,EAAE,CAAA,EAAG,GAAA,EAAK,GAAG,CAAA,EAAE;AAAA,EAClB,EAAA,EAAI,EAAE,CAAA,EAAG,CAAA,EAAG,GAAG,CAAA,EAAE;AAAA,EACjB,CAAA,EAAG,EAAE,CAAA,EAAG,CAAA,EAAG,GAAG,GAAA,EAAI;AAAA,EAClB,EAAA,EAAI,EAAE,CAAA,EAAG,CAAA,EAAG,GAAG,CAAA,EAAE;AAAA,EACjB,CAAA,EAAG,EAAE,CAAA,EAAG,GAAA,EAAK,GAAG,CAAA,EAAE;AAAA,EAClB,EAAA,EAAI,EAAE,CAAA,EAAG,CAAA,EAAG,GAAG,CAAA,EAAE;AAAA,EACjB,CAAA,EAAG,EAAE,CAAA,EAAG,CAAA,EAAG,GAAG,GAAA;AAChB;AAOO,IAAM,aAAA,GAAqC,OAAO,MAAA,CAAO;AAAA,EAC9D,EAAE,EAAA,EAAI,GAAA,EAAK,EAAA,EAAI,QAAQ,CAAA,EAAE;AAAA,EACzB,EAAE,EAAA,EAAI,GAAA,EAAK,EAAA,EAAI,QAAQ,CAAA,EAAE;AAAA,EACzB,EAAE,EAAA,EAAI,GAAA,EAAK,EAAA,EAAI,QAAQ,CAAA,EAAE;AAAA,EACzB,EAAE,EAAA,EAAI,GAAA,EAAK,EAAA,EAAI,QAAQ,CAAA;AACzB,CAAC;AAmBD,SAAS,SAAS,EAAA,EAA6B;AAC7C,EAAA,MAAM,CAAA,GAAI,EAAA,CAAG,CAAA,GAAI,CAAA,GAAI,CAAA;AACrB,EAAA,MAAM,CAAA,GAAI,EAAA,CAAG,CAAA,GAAI,CAAA,GAAI,CAAA;AACrB,EAAA,MAAM,GAAA,GAAM,IAAA,CAAK,KAAA,CAAM,CAAA,EAAG,CAAC,CAAA;AAC3B,EAAA,IAAI,GAAA,KAAQ,GAAG,OAAO,IAAA;AACtB,EAAA,OAAO,EAAE,CAAA,EAAG,CAAA,GAAI,GAAA,EAAK,CAAA,EAAG,IAAI,GAAA,EAAI;AAClC;AASO,SAAS,OAAA,CACd,IAAA,EACA,IAAA,EACA,IAAA,GAA4B,EAAC,EACrB;AACR,EAAA,MAAM,KAAA,GAAQ,aAAA,CAAc,IAAA,EAAM,IAAA,CAAK,IAAI,CAAA;AAC3C,EAAA,IAAI,KAAA,KAAU,IAAA,EAAM,OAAO,EAAC;AAC5B,EAAA,MAAM,QAAA,GAAW,KAAK,QAAA,IAAa,oBAAA;AACnC,EAAA,MAAM,MAAA,GAAS,QAAA,CAAS,SAAA,CAAU,IAAI,CAAA;AACtC,EAAA,MAAM,QAAA,GAAW,QAAA,CAAS,WAAA,GAAc,IAAI,CAAA,IAAK,CAAA;AACjD,EAAA,MAAM,EAAA,GAAK,MAAA,CAAO,CAAA,GAAI,MAAA,CAAO,KAAA,GAAQ,CAAA;AACrC,EAAA,MAAM,EAAA,GAAK,MAAA,CAAO,CAAA,GAAI,MAAA,CAAO,MAAA,GAAS,CAAA;AAKtC,EAAA,MAAM,IAAA,GAAO,KAAA,CAAM,OAAA,KAAY,MAAA,IAAa,OAAO,KAAA,IAAS,CAAA,IAAK,MAAA,CAAO,MAAA,IAAU,CAAA,GAC9E,IAAA,GACA,eAAA,CAAgB,KAAA,CAAM,SAAS,MAAM,CAAA;AAEzC,EAAA,OAAA,CAAQ,KAAA,CAAM,KAAA,IAAS,aAAA,EAAe,GAAA,CAAI,CAAC,IAAA,KAAS;AAClD,IAAA,MAAM,QAAA,GAAiB;AAAA,MACrB,GAAG,MAAA,CAAO,CAAA,GAAI,IAAA,CAAK,EAAA,CAAG,IAAI,MAAA,CAAO,KAAA;AAAA,MACjC,GAAG,MAAA,CAAO,CAAA,GAAI,IAAA,CAAK,EAAA,CAAG,IAAI,MAAA,CAAO;AAAA,KACnC;AACA,IAAA,MAAM,IAAA,GAAA,CAAQ,IAAA,KAAS,IAAA,GAAO,IAAA,GAAO,MAAA,CAAO,IAAA,EAAM,EAAE,CAAA,EAAG,EAAA,EAAI,CAAA,EAAG,EAAA,EAAG,EAAG,QAAQ,CAAA,KAAM,QAAA;AAClF,IAAA,MAAM,MAAA,GAAS,KAAK,MAAA,KAAW,MAAA,GAAY,SAAS,IAAA,CAAK,EAAE,IAAI,IAAA,CAAK,MAAA;AACpE,IAAA,IAAI,aAAa,CAAA,EAAG;AAClB,MAAA,OAAO,EAAE,EAAA,EAAI,IAAA,CAAK,EAAA,EAAI,MAAA,EAAQ,IAAA,CAAK,EAAA,EAAI,KAAA,EAAO,IAAA,EAAM,MAAA,EAAQ,GAAG,MAAA,CAAO,IAAI,CAAA,EAAE;AAAA,IAC9E;AACA,IAAA,OAAO;AAAA,MACL,IAAI,IAAA,CAAK,EAAA;AAAA,MACT,QAAQ,IAAA,CAAK,EAAA;AAAA,MACb,KAAA,EAAO,YAAY,IAAA,CAAK,CAAA,EAAG,KAAK,CAAA,EAAG,EAAA,EAAI,IAAI,QAAQ,CAAA;AAAA;AAAA,MAEnD,MAAA,EAAQ,MAAA,KAAW,IAAA,GAAO,IAAA,GAAO,WAAA,CAAY,MAAA,CAAO,CAAA,EAAG,MAAA,CAAO,CAAA,EAAG,CAAA,EAAG,CAAA,EAAG,QAAQ,CAAA;AAAA,MAC/E,GAAG,OAAO,IAAI;AAAA,KAChB;AAAA,EACF,CAAC,CAAA;AACH;AAGO,SAAS,OACd,IAAA,EACA,IAAA,EACA,MAAA,EACA,IAAA,GAA4B,EAAC,EACX;AAClB,EAAA,OAAO,OAAA,CAAQ,IAAA,EAAM,IAAA,EAAM,IAAI,CAAA,CAAE,KAAK,CAAC,CAAA,KAAM,CAAA,CAAE,EAAA,KAAO,MAAM,CAAA;AAC9D;AAIA,SAAS,OAAO,IAAA,EAAmC;AACjD,EAAA,OAAO,IAAA,CAAK,SAAS,MAAA,GAAY,KAAK,EAAE,IAAA,EAAM,KAAK,IAAA,EAAK;AAC1D;;;AChCA,IAAM,eAAA,GAAkB,CAAA;AACxB,IAAM,WAAA,GAAc,CAAA;AAIpB,IAAM,aAAA,GAAgB,EAAA;AAKf,SAAS,cACd,GAAA,EACgB;AAChB,EAAA,OAAO,CAAC,MAAM,KAAA,KAAU;AACtB,IAAA,MAAM,IAAA,GAAO,MAAM,QAAA,IAAY,aAAA;AAC/B,IAAA,GAAA,CAAI,IAAA,GAAO,CAAA,EAAG,KAAA,CAAM,IAAA,KAAS,IAAA,GAAO,OAAA,GAAU,EAAE,CAAA,EAAG,IAAI,CAAA,GAAA,EAAM,KAAA,CAAM,UAAA,IAAc,YAAY,CAAA,CAAA;AAC7F,IAAA,OAAO,EAAE,KAAA,EAAO,GAAA,CAAI,WAAA,CAAY,IAAI,CAAA,CAAE,KAAA,EAAO,MAAA,EAAQ,IAAA,CAAK,IAAA,CAAK,IAAA,GAAO,GAAG,CAAA,EAAE;AAAA,EAC7E,CAAA;AACF;AAGA,SAAS,UAAA,CAAW,KAAU,OAAA,EAAwE;AACpG,EAAA,MAAM,IAAA,GAAO,CAAC,CAAA,EAAW,KAAA,KACvB,YAAY,MAAA,GACR,EAAE,OAAO,CAAA,CAAE,MAAA,IAAA,CAAY,OAAO,QAAA,IAAY,aAAA,IAAiB,MAAO,MAAA,EAAQ,aAAA,KAC1E,OAAA,CAAQ,CAAA,EAAG,KAAA,IAAS,EAAE,CAAA;AAE5B,EAAA,QAAQ,IAAI,IAAA;AAAM,IAChB,KAAK,OAAA;AACH,MAAA,OAAO,IAAA,CAAK,GAAA,CAAI,IAAA,EAAM,GAAA,CAAI,KAAK,CAAA;AAAA,IACjC,KAAK,OAAA,EAAS;AAEZ,MAAA,MAAM,CAAA,GAAI,IAAA,CAAK,GAAA,CAAI,KAAA,EAAO,IAAI,KAAK,CAAA;AACnC,MAAA,MAAM,CAAA,GAAI,IAAA,CAAK,GAAA,CAAI,KAAA,EAAO,IAAI,KAAK,CAAA;AACnC,MAAA,OAAO,EAAE,KAAA,EAAO,CAAA,CAAE,KAAA,GAAQ,cAAc,CAAA,GAAI,CAAA,CAAE,KAAA,EAAO,MAAA,EAAQ,KAAK,GAAA,CAAI,CAAA,CAAE,MAAA,EAAQ,CAAA,CAAE,MAAM,CAAA,EAAE;AAAA,IAC5F;AAAA,IACA,KAAK,OAAA,EAAS;AACZ,MAAA,MAAM,IAAA,GAAO,CAAC,KAAA,KAAA,CACX,KAAA,IAAS,EAAC,EAAG,MAAA,CAAO,CAAC,CAAA,EAAG,CAAA,KAAM,IAAA,CAAK,IAAI,CAAA,EAAG,CAAA,CAAE,KAAA,KAAU,MAAA,GAAY,CAAA,GAAI,IAAA,CAAK,EAAE,KAAK,CAAA,CAAE,KAAK,CAAA,EAAG,CAAC,CAAA;AAChG,MAAA,MAAM,IAAA,GAAO,IAAA,CAAK,GAAA,CAAI,GAAA,CAAI,IAAA,EAAM,MAAA,IAAU,CAAA,EAAG,GAAA,CAAI,KAAA,EAAO,MAAA,IAAU,CAAA,EAAG,CAAC,CAAA;AACtE,MAAA,OAAO;AAAA,QACL,KAAA,EAAO,KAAK,GAAA,CAAI,IAAI,IAAI,WAAA,GAAc,CAAA,GAAI,IAAA,CAAK,GAAA,CAAI,KAAK,CAAA;AAAA,QACxD,MAAA,EAAQ,GAAA,CAAI,MAAA,IAAU,IAAA,GAAO;AAAA,OAC/B;AAAA,IACF;AAAA,IACA,KAAK,MAAA;AACH,MAAA,OAAO,EAAE,KAAA,EAAO,CAAA,EAAG,MAAA,EAAQ,IAAI,MAAA,EAAO;AAAA;AAE5C;AAMO,SAAS,WAAA,CAAY,MAAgB,OAAA,EAAqC;AAC/E,EAAA,MAAM,OAAA,GAAU,KAAK,OAAA,IAAW,eAAA;AAChC,EAAA,MAAM,GAAA,GAAM,KAAK,GAAA,IAAO,WAAA;AACxB,EAAA,IAAI,KAAA,GAAQ,CAAA;AACZ,EAAA,IAAI,MAAA,GAAS,CAAA;AACb,EAAA,KAAA,MAAW,CAAC,CAAA,EAAG,GAAG,KAAK,IAAA,CAAK,IAAA,CAAK,SAAQ,EAAG;AAC1C,IAAA,MAAM,CAAA,GAAI,UAAA,CAAW,GAAA,EAAK,OAAO,CAAA;AACjC,IAAA,KAAA,GAAQ,IAAA,CAAK,GAAA,CAAI,KAAA,EAAO,CAAA,CAAE,KAAK,CAAA;AAC/B,IAAA,MAAA,IAAU,CAAA,CAAE,MAAA,IAAU,CAAA,GAAI,CAAA,GAAI,GAAA,GAAM,CAAA,CAAA;AAAA,EACtC;AAGA,EAAA,MAAM,GAAA,GAAM,aAAA,CAAc,IAAA,CAAK,OAAA,EAAS;AAAA,IACtC,KAAA,EAAO,QAAQ,OAAA,GAAU,CAAA;AAAA,IACzB,MAAA,EAAQ,SAAS,OAAA,GAAU;AAAA,GAC5B,CAAA;AACD,EAAA,OAAO,EAAE,QAAA,EAAU,GAAA,CAAI,KAAA,EAAO,SAAA,EAAW,IAAI,MAAA,EAAO;AACtD;AAOO,SAAS,UAAA,CAAiC,MAAa,KAAA,EAAyB;AACrF,EAAA,MAAM,QAAQ,IAAA,CAAK,GAAA,CAAI,IAAA,CAAK,KAAA,EAAO,MAAM,QAAQ,CAAA;AACjD,EAAA,MAAM,SAAS,IAAA,CAAK,GAAA,CAAI,IAAA,CAAK,MAAA,EAAQ,MAAM,SAAS,CAAA;AACpD,EAAA,IAAI,UAAU,IAAA,CAAK,KAAA,IAAS,MAAA,KAAW,IAAA,CAAK,QAAQ,OAAO,IAAA;AAC3D,EAAA,OAAO,EAAE,GAAG,IAAA,EAAM,KAAA,EAAO,MAAA,EAAO;AAClC;AAKO,SAAS,UAAA,CACd,IAAA,EACA,MAAA,EACA,OAAA,EACU;AACV,EAAA,MAAM,OAAA,GAAU,KAAK,OAAA,IAAW,eAAA;AAChC,EAAA,MAAM,GAAA,GAAM,KAAK,GAAA,IAAO,WAAA;AACxB,EAAA,MAAM,KAAA,GAAQ,UAAA,CAAW,IAAA,CAAK,OAAA,EAAS,MAAM,CAAA;AAC7C,EAAA,MAAM,QAAQ,IAAA,CAAK,GAAA,CAAI,MAAM,KAAA,GAAQ,OAAA,GAAU,GAAG,CAAC,CAAA;AACnD,EAAA,IAAI,CAAA,GAAI,MAAM,CAAA,GAAI,OAAA;AAClB,EAAA,OAAO,IAAA,CAAK,IAAA,CAAK,GAAA,CAAI,CAAC,KAAK,KAAA,KAAU;AACnC,IAAA,MAAM,CAAA,GAAI,UAAA,CAAW,GAAA,EAAK,OAAO,CAAA,CAAE,MAAA;AACnC,IAAA,MAAM,GAAA,GAAc,EAAE,GAAA,EAAK,KAAA,EAAO,CAAA,EAAG,KAAA,CAAM,CAAA,GAAI,OAAA,EAAS,CAAA,EAAG,KAAA,EAAO,MAAA,EAAQ,CAAA,EAAE;AAC5E,IAAA,CAAA,IAAK,CAAA,GAAI,GAAA;AACT,IAAA,OAAO,GAAA;AAAA,EACT,CAAC,CAAA;AACH;AAWO,SAAS,cAAA,CACd,GAAA,EACA,GAAA,EACA,OAAA,EACc;AACd,EAAA,MAAM,KAAA,GAAQ,CAAC,KAAA,KACb,KAAA,KAAU,SAAY,CAAA,GAAI,UAAA,CAAW,EAAE,IAAA,EAAM,OAAA,EAAS,IAAA,EAAM,KAAA,EAAM,EAAG,OAAO,CAAA,CAAE,KAAA;AAChF,EAAA,MAAM,KAAA,GAAQ,IAAA,CAAK,GAAA,CAAI,GAAA,CAAI,IAAA,EAAM,MAAA,IAAU,CAAA,EAAG,GAAA,CAAI,KAAA,EAAO,MAAA,IAAU,CAAA,EAAG,CAAC,CAAA;AACvE,EAAA,MAAM,UAAA,GAAa,IAAI,MAAA,GAAS,KAAA;AAChC,EAAA,MAAM,MAAoB,EAAC;AAC3B,EAAA,MAAM,IAAA,GAAO,CAAC,KAAA,EAAuC,KAAA,KAAkC;AACrF,IAAA,KAAA,MAAW,CAAC,OAAO,IAAI,CAAA,IAAA,CAAM,SAAS,EAAC,EAAG,SAAQ,EAAG;AACnD,MAAA,MAAM,CAAA,GAAI,KAAA,CAAM,IAAA,CAAK,KAAK,CAAA;AAC1B,MAAA,GAAA,CAAI,IAAA,CAAK;AAAA,QACP,IAAA;AAAA,QACA,IAAA,EAAM,KAAA;AAAA,QACN,KAAA;AAAA,QACA,CAAA,EAAG,UAAU,MAAA,GAAS,GAAA,CAAI,IAAI,GAAA,CAAI,CAAA,GAAI,IAAI,KAAA,GAAQ,CAAA;AAAA,QAClD,CAAA,EAAG,GAAA,CAAI,CAAA,GAAI,KAAA,GAAQ,UAAA;AAAA,QACnB,KAAA,EAAO,CAAA;AAAA,QACP,MAAA,EAAQ;AAAA,OACT,CAAA;AAAA,IACH;AAAA,EACF,CAAA;AACA,EAAA,IAAA,CAAK,GAAA,CAAI,MAAM,MAAM,CAAA;AACrB,EAAA,IAAA,CAAK,GAAA,CAAI,OAAO,OAAO,CAAA;AACvB,EAAA,OAAO,GAAA;AACT;AAgBO,SAAS,SAAA,CAAU,IAAA,EAAgB,MAAA,EAAgB,OAAA,EAAuC;AAC/F,EAAA,MAAM,UAAU,IAAA,CAAK,OAAA;AACrB,EAAA,MAAM,OAAA,GAAsB;AAAA,IAC1B,EAAE,EAAA,EAAI,GAAA,EAAK,EAAA,EAAI,QAAQ,CAAA,EAAE;AAAA,IACzB,EAAE,EAAA,EAAI,GAAA,EAAK,EAAA,EAAI,QAAQ,CAAA,EAAE;AAAA,IACzB,EAAE,EAAA,EAAI,GAAA,EAAK,EAAA,EAAI,QAAQ,CAAA,EAAE;AAAA,IACzB,EAAE,EAAA,EAAI,GAAA,EAAK,EAAA,EAAI,QAAQ,CAAA;AAAE,GAC3B;AACA,EAAA,IAAI,OAAO,MAAA,IAAU,CAAA,SAAU,EAAE,OAAA,EAAS,OAAO,OAAA,EAAQ;AAEzD,EAAA,MAAM,WAAuB,EAAC;AAC9B,EAAA,IAAI,OAAA,GAAU,KAAA;AACd,EAAA,IAAI,QAAA,GAAW,KAAA;AACf,EAAA,KAAA,MAAW,GAAA,IAAO,UAAA,CAAW,IAAA,EAAM,MAAA,EAAQ,OAAO,CAAA,EAAG;AACnD,IAAA,IAAI,GAAA,CAAI,GAAA,CAAI,IAAA,KAAS,OAAA,EAAS;AAC9B,IAAA,KAAA,MAAW,MAAM,cAAA,CAAe,GAAA,CAAI,GAAA,EAAK,GAAA,EAAK,OAAO,CAAA,EAAG;AACtD,MAAA,IAAI,EAAA,CAAG,IAAA,KAAS,MAAA,EAAQ,OAAA,GAAU,IAAA;AAAA,WAC7B,QAAA,GAAW,IAAA;AAChB,MAAA,MAAM,CAAA,GAAA,CAAK,GAAG,CAAA,GAAI,EAAA,CAAG,SAAS,CAAA,GAAI,MAAA,CAAO,KAAK,MAAA,CAAO,MAAA;AACrD,MAAA,QAAA,CAAS,IAAA,CAAK,QAAA;AAAA,QACZ,EAAE,EAAA,EAAI,EAAA,CAAG,IAAA,CAAK,IAAI,EAAA,EAAI,EAAE,CAAA,EAAG,EAAA,CAAG,IAAA,KAAS,MAAA,GAAS,CAAA,GAAI,CAAA,EAAG,GAAE,EAAE;AAAA,QAC3D,GAAG,IAAA,CAAK;AAAA,OACT,CAAA;AAAA,IACH;AAAA,EACF;AACA,EAAA,MAAM,IAAA,GAAO,OAAA,CAAQ,MAAA,CAAO,CAAC,MAC3B,EAAE,CAAA,CAAE,EAAA,KAAO,GAAA,IAAO,OAAA,CAAA,IAAY,EAAE,CAAA,CAAE,EAAA,KAAO,OAAO,QAAA,CAAS,CAAA;AAC3D,EAAA,OAAO,EAAE,SAAS,KAAA,EAAO,CAAC,GAAG,IAAA,EAAM,GAAG,QAAQ,CAAA,EAAE;AAClD;AAEA,SAAS,QAAA,CAAS,MAAgB,IAAA,EAAoC;AACpE,EAAA,OAAO,SAAS,MAAA,GAAY,IAAA,GAAO,EAAE,GAAG,MAAM,IAAA,EAAK;AACrD;AAIO,SAAS,WAAA,CAAY,MAAgB,MAAA,EAAgB;AAC1D,EAAA,OAAO,WAAA,CAAY,IAAA,CAAK,OAAA,EAAS,MAAM,CAAA;AACzC;AAwCO,SAAS,SAAA,CACd,IAAA,EACA,EAAA,EACA,IAAA,EAC8D;AAC9D,EAAA,MAAM,OAAO,UAAA,CAAW,EAAA,EAAI,YAAY,IAAA,EAAM,IAAA,CAAK,OAAO,CAAC,CAAA;AAC3D,EAAA,MAAM,QAA8C,CAAC;AAAA,IACnD,IAAA,EAAM,WAAA;AAAA,IACN,OAAO,IAAA,CAAK,KAAA;AAAA,IACZ,IAAA;AAAA,IACA,IAAA,EAAM,KAAK,IAAA,CAAK,SAAA,CAAU,MAAM,IAAA,EAAM,IAAA,CAAK,OAAO,CAAA,EAAG,IAAI,CAAA;AAAA,IACzD,GAAI,KAAK,EAAA,KAAO,MAAA,GAAY,EAAC,GAAI,EAAE,EAAA,EAAI,IAAA,CAAK,EAAA;AAAG,GAChD,CAAA;AAED,EAAA,MAAM,IAAA,GAAO,CAAC,GAAA,EAAa,IAAA,KAAsB;AAC/C,IAAA,KAAA,CAAM,IAAA,CAAK;AAAA,MACT,IAAA,EAAM,MAAA;AAAA,MACN,OAAO,IAAA,CAAK,KAAA;AAAA,MACZ,IAAA,EAAM,EAAE,GAAG,IAAA,EAAM,GAAG,GAAA,CAAI,CAAA,EAAG,CAAA,EAAG,GAAA,CAAI,GAAG,KAAA,EAAO,GAAA,CAAI,KAAA,EAAO,MAAA,EAAQ,IAAI,MAAA,EAAO;AAAA,MAC1E,IAAA;AAAA,MACA,QAAA,EAAU,KAAA;AAAA,MACV,GAAI,KAAK,EAAA,KAAO,MAAA,GAAY,EAAC,GAAI,EAAE,MAAA,EAAQ,IAAA,CAAK,EAAA;AAAG,KACpD,CAAA;AAAA,EACH,CAAA;AAEA,EAAA,MAAM,YAAY,IAAA,CAAK,SAAA;AACvB,EAAA,KAAA,MAAW,OAAO,UAAA,CAAW,IAAA,EAAM,IAAA,EAAM,IAAA,CAAK,OAAO,CAAA,EAAG;AACtD,IAAA,MAAM,OAAO,IAAA,CAAK,GAAA,CAAI,QAAQ,GAAA,CAAI,GAAG,GAAG,GAAG,CAAA;AAC3C,IAAA,IAAI,IAAA,KAAS,IAAA,EAAM,IAAA,CAAK,GAAA,EAAK,IAAI,CAAA;AACjC,IAAA,IAAI,SAAA,KAAc,MAAA,IAAa,GAAA,CAAI,GAAA,CAAI,SAAS,OAAA,EAAS;AACzD,IAAA,KAAA,MAAW,MAAM,cAAA,CAAe,GAAA,CAAI,KAAK,GAAA,EAAK,IAAA,CAAK,OAAO,CAAA,EAAG;AAC3D,MAAA,IAAI,EAAA,CAAG,IAAA,CAAK,KAAA,KAAU,MAAA,EAAW;AACjC,MAAA,MAAM,SAAA,GAAY,SAAA,CAAU,EAAA,CAAG,IAAA,CAAK,OAAO,EAAE,CAAA;AAC7C,MAAA,IAAI,SAAA,KAAc,IAAA,EAAM,IAAA,CAAK,EAAA,EAAI,SAAS,CAAA;AAAA,IAC5C;AAAA,EACF;AACA,EAAA,OAAO,EAAE,MAAM,KAAA,EAAM;AACvB;AAGA,SAAS,QAAQ,GAAA,EAAkB;AACjC,EAAA,IAAI,GAAA,CAAI,IAAA,KAAS,OAAA,EAAS,OAAO,GAAA,CAAI,IAAA;AACrC,EAAA,IAAI,GAAA,CAAI,SAAS,OAAA,EAAS,OAAO,GAAG,GAAA,CAAI,KAAK,CAAA,EAAA,EAAK,GAAA,CAAI,KAAK,CAAA,CAAA;AAC3D,EAAA,OAAO,EAAA;AACT;AC9VA,IAAM,QAAQ,EAAE,KAAA,EAAO,GAAG,GAAA,EAAK,GAAA,EAAK,KAAK,CAAA,EAAE;AAGpC,SAAS,eAAe,IAAA,EAA8C;AAC3E,EAAA,MAAM,OAAO,IAAA,CAAK,IAAA;AAClB,EAAA,IAAI,IAAA,KAAS,IAAA,IAAQ,OAAO,IAAA,KAAS,UAAU,OAAO,IAAA;AACtD,EAAA,MAAM,QAAS,IAAA,CAA+B,OAAA;AAC9C,EAAA,IAAI,KAAA,KAAU,IAAA,IAAQ,OAAO,KAAA,KAAU,UAAU,OAAO,IAAA;AACxD,EAAA,MAAM,QAAS,KAAA,CAA8B,KAAA;AAC7C,EAAA,IAAI,KAAA,KAAU,IAAA,IAAQ,OAAO,KAAA,KAAU,UAAU,OAAO,IAAA;AACxD,EAAA,OAAO,IAAA,IAAQ,QAAS,KAAA,GAAyB,IAAA;AACnD;AAcO,SAAS,eAAA,CACd,IAAA,GAAgC,EAAC,EACyE;AAC1G,EAAA,MAAM,QAAA,GAAW,KAAK,QAAA,IAAaC,oBAAAA;AAEnC,EAAA,OAAO,CAAC,MAAM,IAAA,KAAS;AACrB,IAAA,MAAM,KAAA,GAAQ,eAAe,IAAI,CAAA;AACjC,IAAA,IAAI,KAAA,KAAU,MAAM,OAAO,IAAA;AAC3B,IAAA,MAAM,IAAA,GAAO,IAAA,CAAK,CAAC,CAAA,EAAG,IAAA,IAAQ,IAAA;AAC9B,IAAA,IAAI,IAAA,KAAS,MAAM,OAAO,IAAA;AAE1B,IAAA,MAAM,CAAA,GAAI,OAAO,KAAA,CAAM,EAAA,KAAO,QAAA,GAAW,MAAM,EAAA,GAAK,KAAA,CAAM,KAAA,CAAM,EAAE,CAAA,IAAK,GAAA;AACvE,IAAA,MAAM,OAAA,GAAU,cAAA,CAAe,IAAA,EAAM,CAAC,CAAA;AACtC,IAAA,IAAI,OAAA,KAAY,MAAM,OAAO,IAAA;AAE7B,IAAA,MAAM,MAAA,GAAS,MAAM,MAAA,IAAU,CAAA;AAE/B,IAAA,MAAM,IAAI,OAAA,CAAQ,KAAA,CAAM,CAAA,GAAI,OAAA,CAAQ,QAAQ,CAAA,GAAI,MAAA;AAChD,IAAA,MAAM,IAAI,OAAA,CAAQ,KAAA,CAAM,CAAA,GAAI,OAAA,CAAQ,QAAQ,CAAA,GAAI,MAAA;AAEhD,IAAA,MAAM,MAAA,GAAS,QAAA,CAAS,SAAA,CAAU,IAAA,CAAK,IAAI,CAAA;AAC3C,IAAA,OAAO,0BAAA;AAAA,MACL,IAAA,CAAK,IAAA;AAAA,MACL,CAAA,IAAK,MAAA,CAAO,CAAA,GAAI,MAAA,CAAO,KAAA,GAAQ,CAAA,CAAA;AAAA,MAC/B,CAAA,IAAK,MAAA,CAAO,CAAA,GAAI,MAAA,CAAO,MAAA,GAAS,CAAA,CAAA;AAAA,MAChC;AAAA,KACF;AAAA,EACF,CAAA;AACF;AAGO,IAAM,aAAA,GAAgB;AAItB,IAAM,oBAAoB,eAAA;;;ACrB1B,IAAM,QAAA,GAAmB,CAAC,GAAA,KAAQ,CAAC,GAAA,CAAI,IAAA,CAAK,KAAA,EAAO,GAAG,GAAA,CAAI,SAAA,EAAW,GAAA,CAAI,EAAA,CAAG,KAAK;AAYjF,IAAM,UAAA,GAAqB,CAAC,GAAA,KAAQ;AACzC,EAAA,MAAM,KAAA,GAAQ,CAAC,GAAA,CAAI,IAAA,CAAK,KAAA,EAAO,GAAG,GAAA,CAAI,SAAA,EAAW,GAAA,CAAI,EAAA,CAAG,KAAK,CAAA;AAC7D,EAAA,MAAM,GAAA,GAAc,CAAC,KAAA,CAAM,CAAC,CAAE,CAAA;AAC9B,EAAA,KAAA,IAAS,CAAA,GAAI,CAAA,EAAG,CAAA,GAAI,KAAA,CAAM,QAAQ,CAAA,EAAA,EAAK;AACrC,IAAA,MAAM,CAAA,GAAI,GAAA,CAAI,GAAA,CAAI,MAAA,GAAS,CAAC,CAAA;AAC5B,IAAA,MAAM,CAAA,GAAI,MAAM,CAAC,CAAA;AACjB,IAAA,IAAI,EAAE,CAAA,KAAM,CAAA,CAAE,KAAK,CAAA,CAAE,CAAA,KAAM,EAAE,CAAA,EAAG;AAC9B,MAAA,GAAA,CAAI,KAAK,CAAC,CAAA;AACV,MAAA;AAAA,IACF;AAGA,IAAA,MAAM,kBAAkB,CAAA,KAAM,CAAA,GAC1B,YAAA,CAAa,GAAA,CAAI,KAAK,MAAM,CAAA,GAC5B,GAAA,CAAI,MAAA,GAAS,KAAK,GAAA,CAAI,GAAA,CAAI,SAAS,CAAC,CAAA,CAAG,MAAM,CAAA,CAAE,CAAA;AAGnD,IAAA,MAAM,WAAW,CAAA,KAAM,KAAA,CAAM,SAAS,CAAA,GAAI,GAAA,CAAI,GAAG,MAAA,GAAS,IAAA;AAC1D,IAAA,MAAM,mBAAmB,QAAA,IAAY,IAAA,GAAO,CAAC,eAAA,GAAkB,aAAa,QAAQ,CAAA;AACpF,IAAA,IAAI,oBAAoB,gBAAA,EAAkB;AACxC,MAAA,GAAA,CAAI,KAAK,eAAA,GAAkB,EAAE,CAAA,EAAG,CAAA,CAAE,GAAG,CAAA,EAAG,CAAA,CAAE,CAAA,EAAE,GAAI,EAAE,CAAA,EAAG,CAAA,CAAE,GAAG,CAAA,EAAG,CAAA,CAAE,GAAG,CAAA;AAClE,MAAA,GAAA,CAAI,KAAK,CAAC,CAAA;AACV,MAAA;AAAA,IACF;AACA,IAAA,IAAI,eAAA,EAAiB;AACnB,MAAA,MAAM,GAAA,GAAA,CAAO,CAAA,CAAE,CAAA,GAAI,CAAA,CAAE,CAAA,IAAK,CAAA;AAC1B,MAAA,GAAA,CAAI,IAAA,CAAK,EAAE,CAAA,EAAG,GAAA,EAAK,GAAG,CAAA,CAAE,CAAA,EAAE,EAAG,EAAE,GAAG,GAAA,EAAK,CAAA,EAAG,CAAA,CAAE,CAAA,IAAK,CAAC,CAAA;AAAA,IACpD,CAAA,MAAO;AACL,MAAA,MAAM,GAAA,GAAA,CAAO,CAAA,CAAE,CAAA,GAAI,CAAA,CAAE,CAAA,IAAK,CAAA;AAC1B,MAAA,GAAA,CAAI,IAAA,CAAK,EAAE,CAAA,EAAG,CAAA,CAAE,GAAG,CAAA,EAAG,GAAA,EAAI,EAAG,EAAE,GAAG,CAAA,CAAE,CAAA,EAAG,CAAA,EAAG,GAAA,IAAO,CAAC,CAAA;AAAA,IACpD;AAAA,EACF;AACA,EAAA,OAAO,GAAA;AACT;AAIA,SAAS,aAAa,MAAA,EAA0C;AAC9D,EAAA,OAAO,IAAA,CAAK,GAAA,CAAI,MAAA,EAAQ,CAAA,IAAK,CAAC,KAAK,IAAA,CAAK,GAAA,CAAI,MAAA,EAAQ,CAAA,IAAK,CAAC,CAAA;AAC5D;AAIA,IAAM,YAAA,GAAe,GAAA;AAWd,IAAM,MAAA,GAAiB,CAAC,GAAA,KAAQ;AACrC,EAAA,MAAM,KAAA,GAAQ,CAAC,GAAA,CAAI,IAAA,CAAK,KAAA,EAAO,GAAG,GAAA,CAAI,SAAA,EAAW,GAAA,CAAI,EAAA,CAAG,KAAK,CAAA;AAC7D,EAAA,MAAM,GAAA,GAAc,CAAC,KAAA,CAAM,CAAC,CAAE,CAAA;AAC9B,EAAA,KAAA,IAAS,CAAA,GAAI,CAAA,EAAG,CAAA,GAAI,KAAA,CAAM,QAAQ,CAAA,EAAA,EAAK;AACrC,IAAA,MAAM,CAAA,GAAI,KAAA,CAAM,CAAA,GAAI,CAAC,CAAA;AACrB,IAAA,MAAM,CAAA,GAAI,MAAM,CAAC,CAAA;AACjB,IAAA,MAAM,KAAA,GAAQ,IAAA,CAAK,KAAA,CAAM,CAAA,CAAE,CAAA,GAAI,CAAA,CAAE,CAAA,EAAG,CAAA,CAAE,CAAA,GAAI,CAAA,CAAE,CAAC,CAAA,GAAI,YAAA;AACjD,IAAA,MAAM,IAAA,GAAO,CAAA,KAAM,CAAA,GAAI,GAAA,CAAI,KAAK,MAAA,GAAS,IAAA;AACzC,IAAA,MAAM,MAAM,CAAA,KAAM,KAAA,CAAM,SAAS,CAAA,GAAI,GAAA,CAAI,GAAG,MAAA,GAAS,IAAA;AACrD,IAAA,MAAM,EAAA,GAAK,IAAA,KAAS,IAAA,IAAQ,IAAA,KAAS,SACjC,EAAE,CAAA,EAAG,CAAA,CAAE,CAAA,GAAA,CAAK,EAAE,CAAA,GAAI,CAAA,CAAE,CAAA,IAAK,YAAA,EAAc,GAAG,CAAA,CAAE,CAAA,GAAA,CAAK,CAAA,CAAE,CAAA,GAAI,EAAE,CAAA,IAAK,YAAA,EAAa,GAC3E,EAAE,GAAG,CAAA,CAAE,CAAA,GAAI,IAAA,CAAK,CAAA,GAAI,OAAO,CAAA,EAAG,CAAA,CAAE,CAAA,GAAI,IAAA,CAAK,IAAI,KAAA,EAAM;AACvD,IAAA,MAAM,EAAA,GAAK,GAAA,KAAQ,IAAA,IAAQ,GAAA,KAAQ,SAC/B,EAAE,CAAA,EAAG,CAAA,CAAE,CAAA,GAAA,CAAK,EAAE,CAAA,GAAI,CAAA,CAAE,CAAA,IAAK,YAAA,EAAc,GAAG,CAAA,CAAE,CAAA,GAAA,CAAK,CAAA,CAAE,CAAA,GAAI,EAAE,CAAA,IAAK,YAAA,EAAa,GAC3E,EAAE,GAAG,CAAA,CAAE,CAAA,GAAI,GAAA,CAAI,CAAA,GAAI,OAAO,CAAA,EAAG,CAAA,CAAE,CAAA,GAAI,GAAA,CAAI,IAAI,KAAA,EAAM;AACrD,IAAA,KAAA,IAAS,CAAA,GAAI,CAAA,EAAG,CAAA,IAAK,cAAA,EAAgB,CAAA,EAAA,EAAK;AACxC,MAAA,GAAA,CAAI,IAAA,CAAK,QAAQ,CAAA,EAAG,EAAA,EAAI,IAAI,CAAA,EAAG,CAAA,GAAI,cAAc,CAAC,CAAA;AAAA,IACpD;AAAA,EACF;AACA,EAAA,OAAO,GAAA;AACT;AAEA,IAAM,cAAA,GAAiB,EAAA;AAEvB,SAAS,OAAA,CAAQ,EAAA,EAAU,EAAA,EAAU,EAAA,EAAU,IAAU,CAAA,EAAiB;AACxE,EAAA,MAAM,IAAI,CAAA,GAAI,CAAA;AACd,EAAA,MAAM,CAAA,GAAI,IAAI,CAAA,GAAI,CAAA;AAClB,EAAA,MAAM,CAAA,GAAI,CAAA,GAAI,CAAA,GAAI,CAAA,GAAI,CAAA;AACtB,EAAA,MAAM,CAAA,GAAI,CAAA,GAAI,CAAA,GAAI,CAAA,GAAI,CAAA;AACtB,EAAA,MAAM,CAAA,GAAI,IAAI,CAAA,GAAI,CAAA;AAClB,EAAA,OAAO;AAAA,IACL,CAAA,EAAG,CAAA,GAAI,EAAA,CAAG,CAAA,GAAI,CAAA,GAAI,EAAA,CAAG,CAAA,GAAI,CAAA,GAAI,EAAA,CAAG,CAAA,GAAI,CAAA,GAAI,EAAA,CAAG,CAAA;AAAA,IAC3C,CAAA,EAAG,CAAA,GAAI,EAAA,CAAG,CAAA,GAAI,CAAA,GAAI,EAAA,CAAG,CAAA,GAAI,CAAA,GAAI,EAAA,CAAG,CAAA,GAAI,CAAA,GAAI,EAAA,CAAG;AAAA,GAC7C;AACF;AAGO,IAAM,OAAA,GAA4C,OAAO,MAAA,CAAO;AAAA,EACrE,QAAA;AAAA,EACA,UAAA;AAAA,EACA;AACF,CAAC;AAGM,SAAS,cAAc,IAAA,EAA6C;AACzE,EAAA,MAAM,OAAO,IAAA,CAAK,IAAA;AAClB,EAAA,IAAI,IAAA,KAAS,IAAA,IAAQ,OAAO,IAAA,KAAS,UAAU,OAAO,IAAA;AACtD,EAAA,MAAM,OAAQ,IAAA,CAA+B,OAAA;AAC7C,EAAA,IAAI,IAAA,KAAS,IAAA,IAAQ,OAAO,IAAA,KAAS,UAAU,OAAO,IAAA;AACtD,EAAA,OAAO,MAAA,IAAU,IAAA,IAAQ,IAAA,IAAQ,IAAA,GAAQ,IAAA,GAAuB,IAAA;AAClE;AAUO,SAAS,UAAA,CACd,GAAA,EACA,GAAA,EACA,MAAA,EACA,MACA,QAAA,EACkB;AAClB,EAAA,IAAI,GAAA,CAAI,SAAS,MAAA,EAAW;AAC1B,IAAA,MAAM,KAAA,GAAQ,OAAO,GAAA,CAAI,IAAA,EAAe,IAAI,IAAA,EAAM,GAAA,CAAI,MAAM,IAAI,CAAA;AAChE,IAAA,IAAI,KAAA,KAAU,QAAW,OAAO,KAAA;AAAA,EAClC;AACA,EAAA,IAAI,IAAA;AACJ,EAAA,IAAI,SAAA,GAAY,CAAA,QAAA;AAChB,EAAA,KAAA,MAAW,IAAA,IAAQ,QAAA,CAAS,GAAG,CAAA,EAAG;AAChC,IAAA,MAAM,EAAA,GAAK,MAAA,CAAO,CAAA,GAAI,IAAA,CAAK,KAAA,CAAM,CAAA;AACjC,IAAA,MAAM,EAAA,GAAK,MAAA,CAAO,CAAA,GAAI,IAAA,CAAK,KAAA,CAAM,CAAA;AACjC,IAAA,MAAM,GAAA,GAAM,IAAA,CAAK,KAAA,CAAM,EAAA,EAAI,EAAE,CAAA,IAAK,CAAA;AAElC,IAAA,MAAM,MAAA,GAAS,IAAA,CAAK,MAAA,KAAW,IAAA,GAC3B,CAAA,GAAA,CACC,IAAA,CAAK,MAAA,CAAO,CAAA,GAAI,EAAA,GAAK,IAAA,CAAK,MAAA,CAAO,CAAA,GAAI,EAAA,IAAM,GAAA;AAChD,IAAA,MAAM,KAAA,GAAQ,SAAS,GAAA,GAAM,GAAA;AAC7B,IAAA,IAAI,QAAQ,SAAA,EAAW;AACrB,MAAA,SAAA,GAAY,KAAA;AACZ,MAAA,IAAA,GAAO,IAAA;AAAA,IACT;AAAA,EACF;AACA,EAAA,OAAO,IAAA;AACT;AAeO,SAAS,cAAA,CACd,IAAA,GAAgC,EAAC,EAC2D;AAC5F,EAAA,MAAM,QAAA,GAAW,KAAK,QAAA,IAAaA,oBAAAA;AACnC,EAAA,MAAM,QAAA,GAAgC,EAAE,QAAA,EAAU,GAAI,IAAA,CAAK,IAAA,GAAO,EAAE,IAAA,EAAM,IAAA,CAAK,IAAA,EAAK,GAAI,EAAC,EAAG;AAC5F,EAAA,MAAM,QAAA,GAAW,CAAC,CAAA,KAChB,OAAA,CAAQ,EAAE,IAAA,EAAe,CAAA,CAAE,MAAM,QAAQ,CAAA;AAC3C,EAAA,MAAM,QAAA,GAAW,CAAC,CAAA,KAA+B;AAC/C,IAAA,MAAM,CAAA,GAAI,QAAA,CAAS,SAAA,CAAU,CAAA,CAAE,IAAI,CAAA;AACnC,IAAA,OAAO,EAAE,CAAA,EAAG,CAAA,CAAE,CAAA,GAAI,CAAA,CAAE,KAAA,GAAQ,CAAA,EAAG,CAAA,EAAG,CAAA,CAAE,CAAA,GAAI,CAAA,CAAE,MAAA,GAAS,CAAA,EAAE;AAAA,EACvD,CAAA;AAEA,EAAA,OAAO,CAAC,MAAM,IAAA,KAAS;AACrB,IAAA,MAAM,IAAA,GAAO,cAAc,IAAI,CAAA;AAC/B,IAAA,IAAI,IAAA,KAAS,MAAM,OAAO,IAAA;AAC1B,IAAA,MAAM,CAAC,OAAA,EAAS,KAAK,CAAA,GAAI,IAAA;AACzB,IAAA,IAAI,OAAA,KAAY,MAAA,IAAa,KAAA,KAAU,MAAA,EAAW,OAAO,IAAA;AAIzD,IAAA,MAAM,IAAA,GAAO,WAAW,IAAA,CAAK,IAAA,EAAM,SAAS,QAAA,CAAS,KAAK,CAAA,EAAG,QAAA,EAAU,QAAQ,CAAA;AAC/E,IAAA,MAAM,EAAA,GAAK,WAAW,IAAA,CAAK,EAAA,EAAI,OAAO,QAAA,CAAS,OAAO,CAAA,EAAG,QAAA,EAAU,QAAQ,CAAA;AAC3E,IAAA,IAAI,IAAA,KAAS,MAAA,IAAa,EAAA,KAAO,MAAA,EAAW,OAAO,IAAA;AAEnD,IAAA,MAAM,OAAA,GAAU,KAAK,OAAA,IAAW,OAAA;AAChC,IAAA,MAAM,SAAU,IAAA,CAAK,MAAA,KAAW,UAAa,OAAA,CAAQ,IAAA,CAAK,MAAM,CAAA,IAAM,QAAA;AACtE,IAAA,MAAM,MAAA,GAAS,MAAA,CAAO,EAAE,IAAA,EAAM,EAAA,EAAI,WAAW,IAAA,CAAK,SAAA,IAAa,EAAC,EAAG,CAAA;AACnE,IAAA,OAAO,MAAA,CAAO,MAAA,GAAS,CAAA,GAAI,IAAA,GAAO,mBAAmB,MAAoC,CAAA;AAAA,EAC3F,CAAA;AACF;AAGO,IAAM,YAAA,GAAe;AAKrB,IAAM,mBAAmB,cAAA;AAIzB,SAAS,mBAAA,CACd,QAAA,GAAiC,EAAC,EACZ;AACtB,EAAA,OAAO;AAAA,IACL,GAAG,QAAA;AAAA,IACH,UAAA,EAAY;AAAA,MACV,CAAC,YAAY,GAAG,gBAAA;AAAA,MAChB,GAAG,QAAA,CAAS;AAAA,KACd;AAAA,IACA,UAAA,EAAY;AAAA,MACV,CAAC,aAAa,GAAG,iBAAA;AAAA,MACjB,GAAG,QAAA,CAAS;AAAA;AACd,GACF;AACF;;;AChQO,IAAM,aAAA,GAAgB;AAKtB,IAAM,oBAAA,GAAuB,SAAS,aAAa,CAAA;AA+C1D,IAAM,cAAA,GAAiB,CAAA;AACvB,IAAM,eAAA,GAAkB,CAAA;AAGjB,SAAS,cAAc,GAAA,EAAmE;AAC/F,EAAA,MAAM,UAAU,GAAA,EAAK,OAAA;AACrB,EAAA,OAAO,YAAY,MAAA,IAAa,OAAO,OAAA,CAAQ,MAAA,KAAW,WAAW,OAAA,GAAU,IAAA;AACjF;AAOO,SAAS,oBAAA,CACd,YAAA,EACA,IAAA,GAAqC,EAAC,EAC1B;AACZ,EAAA,MAAM;AAAA,IACJ,EAAA,GAAK,aAAA;AAAA,IACL,WAAA,GAAc,cAAA;AAAA,IACd,MAAA,GAAS,eAAA;AAAA,IACT,QAAA,GAAW;AAAA,GACb,GAAI,IAAA;AACJ,EAAA,MAAM,QAAA,GAAW;AAAA,IACf,GAAI,KAAK,QAAA,GAAW,EAAE,UAAU,IAAA,CAAK,QAAA,KAAa,EAAC;AAAA,IACnD,GAAI,KAAK,IAAA,GAAO,EAAE,MAAM,IAAA,CAAK,IAAA,KAAS;AAAC,GACzC;AACA,EAAA,MAAM,KAAA,GAAQ,MAAA,IAAU,CAAA,GACpB,MAAA,GACA;AAAA,IACA,IAAA,EAAM,QAAA;AAAA,IACN,MAAA;AAAA,IACA,GAAI,KAAK,IAAA,GAAO,EAAE,MAAM,IAAA,CAAK,IAAA,KAAS,EAAC;AAAA,IACvC,GAAI,KAAK,MAAA,GAAS,EAAE,QAAQ,IAAA,CAAK,MAAA,KAAW;AAAC,GAC/C;AAEF,EAAA,OAAO;AAAA,IACL,EAAA;AAAA,IACA,QAAQ,KAAA,EAAiD;AACvD,MAAA,MAAM,MAA0B,EAAC;AACjC,MAAA,KAAA,MAAW,EAAE,IAAA,EAAM,IAAA,EAAK,IAAK,cAAa,EAAG;AAC3C,QAAA,IAAI,IAAA,CAAK,UAAU,MAAA,IAAa,CAAC,KAAK,KAAA,CAAM,IAAA,EAAM,KAAK,CAAA,EAAG;AAC1D,QAAA,KAAA,MAAW,IAAA,IAAQ,OAAA,CAAQ,IAAA,EAAM,IAAA,EAAM,QAAQ,CAAA,EAAG;AAChD,UAAA,GAAA,CAAI,IAAA,CAAK;AAAA,YACP,IAAI,CAAA,EAAG,IAAA,CAAK,EAAE,CAAA,CAAA,EAAI,KAAK,EAAE,CAAA,CAAA;AAAA,YACzB,QAAA,EAAU,IAAA;AAAA,YACV,KAAA,EAAO,EAAE,IAAA,EAAM,OAAA,EAAS,CAAA,EAAG,IAAA,CAAK,KAAA,CAAM,CAAA,EAAG,CAAA,EAAG,IAAA,CAAK,KAAA,CAAM,CAAA,EAAG,WAAA,EAAY;AAAA,YACtE,GAAI,KAAA,GAAQ,EAAE,KAAA,KAAU,EAAC;AAAA,YACzB,GAAI,KAAK,MAAA,KAAW,MAAA,GAAY,EAAE,MAAA,EAAQ,IAAA,CAAK,MAAA,EAAO,GAAI,EAAC;AAAA,YAC3D,QAAA;AAAA,YACA,YAAA,EAAc,CAAC,SAAS,CAAA;AAAA,YACxB,MAAM,OAAO;AAAA,cACX,cAAA,EAAgB;AAAA,gBACd,UAAU,IAAA,CAAK,EAAA;AAAA,gBACf,QAAQ,IAAA,CAAK,EAAA;AAAA,gBACb,QAAQ,IAAA,CAAK,EAAA;AAAA,gBACb;AAAA;AACF,aACF;AAAA,WACD,CAAA;AAAA,QACH;AAAA,MACF;AACA,MAAA,OAAO,GAAA;AAAA,IACT;AAAA,GACF;AACF;;;AC7GO,IAAM,iBAAA,GAAoB;AAwB1B,IAAM,iBAAA,GAAgC,CAAC,IAAA,EAAM,EAAA,KAAO;AACzD,EAAA,IAAI,IAAA,CAAK,WAAW,EAAA,CAAG,MAAA,IAAU,KAAK,EAAA,KAAO,EAAA,CAAG,IAAI,OAAO,KAAA;AAC3D,EAAA,IAAI,KAAK,IAAA,KAAS,MAAA,IAAa,EAAA,CAAG,IAAA,KAAS,QAAW,OAAO,IAAA;AAC7D,EAAA,OAAO,IAAA,CAAK,SAAS,EAAA,CAAG,IAAA;AAC1B;AA8BA,IAAM,YAAA,GAAe,EAAA;AAGd,IAAM,mBAAA,GAA8B;AAAA,EACzC,KAAA,EAAO,EAAE,KAAA,EAAO,SAAA,EAAU;AAAA,EAC1B,KAAA,EAAO,CAAA;AAAA,EACP,SAAA,EAAW;AACb;AACA,IAAM,cAAA,GAAiB,UAAA;AAoBhB,SAAS,cAAA,CAAe,WAAmB,iBAAA,EAAmC;AACnF,EAAA,OAAO;AAAA,IACL,MAAM,EAAE,IAAA,EAAM,QAAQ,MAAA,EAAQ,CAAA,WAAA,EAAc,oBAAoB,CAAA,CAAA,EAAG;AAAA,IACnE;AAAA,GACF;AACF;AAGO,IAAM,mBAAA,GAAsB;AAa5B,SAAS,cAAA,CAAe,KAAa,mBAAA,EAA6B;AACvE,EAAA,OAAO;AAAA,IACL,EAAA;AAAA,IACA,KAAA,EAAO,WAAA;AAAA,IACP,KAAA,EAAO,SAAA;AAAA,IACP,OAAA,EAAS,EAAE,MAAA,EAAQ,WAAA,EAAa,KAAK,MAAM;AAAA,IAAC,CAAA,EAAE;AAAA,IAC9C,SAAS,MAAM;AAAA,GACjB;AACF;AAGO,SAAS,gBAAA,CAAiB,WAAmB,mBAAA,EAAuC;AACzF,EAAA,OAAO;AAAA,IACL,EAAE,IAAA,EAAM,EAAE,IAAA,EAAM,aAAA,EAAe,QAAQ,CAAA,WAAA,EAAc,oBAAoB,CAAA,CAAA,EAAG,EAAG,QAAA,EAAS;AAAA,IACxF,EAAE,IAAA,EAAM,EAAE,IAAA,EAAM,OAAA,EAAS,QAAQ,CAAA,WAAA,EAAc,oBAAoB,CAAA,CAAA,EAAG,EAAG,QAAA;AAAS,GACpF;AACF;AAWO,SAAS,iBAAA,CAAkB,MAAmB,GAAA,EAA0B;AAC7E,EAAA,MAAM,KAAA,GAAQ,GAAA,CAAI,IAAA,CAAK,OAAO,CAAA;AAC9B,EAAA,IAAI,UAAU,MAAA,EAAW;AACzB,EAAA,MAAM,KAAA,GAAqB;AAAA,IACzB,IAAA,EAAM,EAAE,IAAA,EAAM,IAAA,CAAK,KAAK,EAAA,EAAG;AAAA,IAC3B,EAAA,EAAI,EAAE,IAAA,EAAM,IAAA,CAAK,GAAG,EAAA,EAAG;AAAA,IACvB,QAAQ,IAAA,CAAK;AAAA,GACf;AACA,EAAA,MAAM,MAAA,GAAS,KAAA,CAAM,GAAA,CAAI,IAAA,CAAK,KAAK,MAAe,CAAA;AAClD,EAAA,KAAA,CAAM,GAAA,CAAI;AAAA,IACR,IAAA,EAAM,MAAA;AAAA,IACN,OAAO,MAAA,EAAQ,KAAA,IAAS,KAAA,CAAM,MAAA,CAAO,CAAC,CAAA,CAAG,EAAA;AAAA,IACzC,IAAA,EAAM,EAAE,CAAA,EAAG,CAAA,EAAG,GAAG,CAAA,EAAG,KAAA,EAAO,CAAA,EAAG,MAAA,EAAQ,CAAA,EAAE;AAAA;AAAA;AAAA;AAAA,IAIxC,IAAA,EAAM,EAAE,OAAA,EAAS,KAAA,EAAO,QAAQ,mBAAA,EAAoB;AAAA,IACpD,WAAW,CAAC,IAAA,CAAK,KAAK,MAAA,EAAiB,IAAA,CAAK,GAAG,MAAe,CAAA;AAAA;AAAA;AAAA;AAAA,IAI9D,UAAA,EAAY;AAAA,GACb,CAAA;AACH;AAWO,SAAS,oBAA2B,IAAA,EAA2C;AACpF,EAAA,MAAM;AAAA,IACJ,EAAA,GAAK,iBAAA;AAAA,IACL,UAAA,GAAa,iBAAA;AAAA,IACb,UAAA,GAAa,YAAA;AAAA,IACb,QAAQ,SAAA,GAAY,cAAA;AAAA,IACpB,MAAA,GAAS;AAAA,GACX,GAAI,IAAA;AACJ,EAAA,MAAM,OAAA,GAAU,KAAK,OAAA,IAAW,OAAA;AAChC,EAAA,MAAM,QAAA,GAAW;AAAA,IACf,GAAI,KAAK,QAAA,GAAW,EAAE,UAAU,IAAA,CAAK,QAAA,KAAa,EAAC;AAAA,IACnD,GAAI,KAAK,IAAA,GAAO,EAAE,MAAM,IAAA,CAAK,IAAA,KAAS;AAAC,GACzC;AACA,EAAA,MAAM,KAAA,GAAgB,QAAQ,SAAS,CAAA,IAAK,QAAQ,UAAU,CAAA,IAAK,QAAQ,UAAU,CAAA;AAOrF,EAAA,SAAS,UAAA,CAAW,MAAY,EAAA,EAAuB;AACrD,IAAA,IAAI,IAAA,GAAoB,IAAA;AACxB,IAAA,IAAI,SAAS,UAAA,GAAa,UAAA;AAC1B,IAAA,KAAA,MAAW,EAAE,IAAA,EAAM,IAAA,EAAK,IAAK,IAAA,CAAK,cAAa,EAAG;AAChD,MAAA,KAAA,MAAW,IAAA,IAAQ,OAAA,CAAQ,IAAA,EAAM,IAAA,EAAM,QAAQ,CAAA,EAAG;AAChD,QAAA,IAAI,CAAC,UAAA,CAAW,IAAA,EAAM,IAAI,CAAA,EAAG;AAC7B,QAAA,MAAM,EAAA,GAAA,CAAM,IAAA,CAAK,KAAA,CAAM,CAAA,GAAI,EAAA,CAAG,CAAA,KAAM,CAAA,GAAA,CAAK,IAAA,CAAK,KAAA,CAAM,CAAA,GAAI,EAAA,CAAG,CAAA,KAAM,CAAA;AACjE,QAAA,IAAI,MAAM,MAAA,EAAQ;AAChB,UAAA,MAAA,GAAS,EAAA;AACT,UAAA,IAAA,GAAO,IAAA;AAAA,QACT;AAAA,MACF;AAAA,IACF;AACA,IAAA,OAAO,IAAA;AAAA,EACT;AAIA,EAAA,SAAS,KAAA,CAAM,MAAY,EAAA,EAA4C;AACrE,IAAA,MAAM,IAAA,GAAO,UAAA,CAAW,IAAA,EAAM,EAAE,CAAA;AAChC,IAAA,OAAO;AAAA,MACL,IAAA;AAAA,MACA,GAAA,EAAK,IAAA,IAAQ,EAAE,EAAA,EAAI,EAAA,EAAI,QAAQ,EAAA,EAAI,KAAA,EAAO,EAAA,EAAI,MAAA,EAAQ,IAAA;AAAK,KAC7D;AAAA,EACF;AAEA,EAAA,OAAO;AAAA,IACL,EAAA;AAAA,IACA,KAAA,EAAO,SAAA;AAAA,IACP,KAAA,EAAO,SAAA;AAAA,IACP,QAAA,EAAU,CAAC,OAAO,CAAA;AAAA,IAClB,OAAA,EAAS;AAAA,MACP,MAAA,EAAQ,SAAA;AAAA,MACR,MAAM,GAAA,EAAmC;AACvC,QAAA,MAAM,OAAA,GAAU,aAAA,CAAc,GAAA,CAAI,IAAA,EAAM,UAAU,CAAA;AAIlD,QAAA,IAAI,OAAA,KAAY,IAAA,EAAM,OAAO,EAAC;AAC9B,QAAA,MAAM,OAAA,GAA0B;AAAA,UAC9B,MAAM,OAAA,CAAQ,IAAA;AAAA,UACd,OAAA,EAAS,EAAE,CAAA,EAAG,GAAA,CAAI,MAAM,CAAA,EAAG,CAAA,EAAG,GAAA,CAAI,KAAA,CAAM,CAAA,EAAE;AAAA,UAC1C,IAAA,EAAM,IAAA;AAAA,UACN,MAAM,GAAA,CAAI;AAAA,SACZ;AAEA,QAAA,OAAO;AAAA,UACL,IAAA,EAAM,iBAAA;AAAA,UACN,OAAO,OAAA,EAA8B;AACnC,YAAA,OAAA,CAAQ,OAAA,GAAU,EAAE,CAAA,EAAG,OAAA,CAAQ,MAAM,CAAA,EAAG,CAAA,EAAG,OAAA,CAAQ,KAAA,CAAM,CAAA,EAAE;AAAA,UAC7D,CAAA;AAAA,UACA,OAAA,GAAiC;AAC/B,YAAA,IAAI,CAAC,OAAA,CAAQ,IAAA,EAAM,OAAO,IAAA;AAC1B,YAAA,MAAM,EAAE,GAAA,EAAI,GAAI,MAAM,OAAA,CAAQ,IAAA,EAAM,QAAQ,OAAO,CAAA;AACnD,YAAA,MAAM,MAAA,GAAS,KAAA,CAAM,EAAE,IAAA,EAAM,OAAA,CAAQ,IAAA,EAAM,EAAA,EAAI,GAAA,EAAK,SAAA,EAAW,EAAC,EAAG,CAAA;AACnE,YAAA,IAAI,MAAA,CAAO,MAAA,GAAS,CAAA,EAAG,OAAO,IAAA;AAK9B,YAAA,OAAO,EAAE,IAAA,EAAM,UAAA,EAAY,MAAA,EAAQ,MAAM,WAAA,EAAY;AAAA,UACvD,CAAA;AAAA,UACA,KAAA,CAAM,QAAuB,MAAA,EAAmC;AAC9D,YAAA,OAAA,CAAQ,IAAA,GAAO,KAAA;AACf,YAAA,IAAI,WAAW,QAAA,EAAU;AACzB,YAAA,MAAM,EAAE,IAAA,EAAK,GAAI,KAAA,CAAM,QAAQ,IAAA,EAAM,EAAE,CAAA,EAAG,MAAA,CAAO,MAAM,CAAA,EAAG,CAAA,EAAG,MAAA,CAAO,KAAA,CAAM,GAAG,CAAA;AAC7E,YAAA,IAAI,SAAS,IAAA,EAAM;AAEnB,YAAA,MAAA;AAAA,cACE,EAAE,IAAA,EAAM,OAAA,CAAQ,MAAM,EAAA,EAAI,IAAA,EAAM,QAAQ,SAAA,EAAU;AAAA,cAClD,EAAE,GAAG,MAAA,EAAQ,IAAA,EAAM,QAAQ,IAAA;AAAK,aAClC;AAAA,UACF;AAAA,SACF;AAAA,MACF;AAAA,KACF;AAAA,IACA,SAAS,MAAM;AAAA,GACjB;AACF;ACxQO,SAAS,kBACd,KAAA,EACoB;AACpB,EAAA,OAAO,aAAa;AAClB,IAAA,KAAA,MAAW,IAAA,IAAQ,KAAA,CAAM,gBAAA,EAAiB,EAAG;AAC3C,MAAA,MAAM;AAAA,QACJ,IAAA;AAAA,QACA,IAAA,EAAM,aAAA,CAAc,KAAA,EAAgB,IAAa;AAAA,OACnD;AAAA,IACF;AAAA,EACF,CAAA;AACF;AAYO,SAAS,SAAA,CACd,YAAA,EACA,IAAA,GAAqC,EAAC,EAC4C;AAClF,EAAA,OAAO,sBAAA;AAAA,IACL,KAAK,EAAA,IAAM,aAAA;AAAA,IACX,eAAA;AAAA,IACA,CAAC,oBAAA,CAAqB,YAAA,EAAc,IAAI,CAAC;AAAA,GAC3C;AACF;;;AC5CO,SAAS,0BACd,IAAA,EACc;AACd,EAAA,MAAM,QAAA,GAAW,KAAK,EAAA,IAAM,iBAAA;AAC5B,EAAA,OAAO;AAAA,IACL,EAAA,EAAI,gBAAA;AAAA,IACJ,WAAA,EAAa,EAAE,OAAA,EAAS,IAAA,EAAK;AAAA,IAC7B,OAAA,EAAS,CAAC,mBAAA,CAAoB,EAAE,GAAG,IAAA,EAAM,EAAA,EAAI,QAAA,EAAU,CAAA,EAAG,cAAA,EAAgB,CAAA;AAAA,IAC1E,UAAU,CAAC,cAAA,CAAe,QAAQ,CAAA,EAAG,GAAG,kBAAkB;AAAA,GAC5D;AACF;AAUO,SAAS,aAAoB,IAAA,EAGlC;AACA,EAAA,OAAO;AAAA,IACL,KAAA,EAAO,SAAA,CAAU,IAAA,CAAK,YAAA,EAAc,IAAI,CAAA;AAAA,IACxC,YAAA,EAAc,0BAA0B,IAAI;AAAA,GAC9C;AACF;ACeO,SAAS,UAAA,CACd,MAAA,EACA,IAAA,GAAiC,EAAC,EAC3B;AACP,EAAA,MAAM,QAAA,GAAW,KAAK,QAAA,IAAaA,oBAAAA;AACnC,EAAA,MAAM,QAAqB,EAAC;AAC5B,EAAA,MAAM,IAAA,uBAAW,GAAA,EAAuB;AACxC,EAAA,MAAM,aAA0B,EAAC;AAEjC,EAAA,KAAA,MAAW,EAAE,IAAA,EAAM,IAAA,EAAK,IAAK,QAAO,EAAG;AACrC,IAAA,IAAI,aAAA,CAAc,IAAI,CAAA,KAAM,IAAA,EAAM;AAChC,MAAA,MAAM,OAAO,IAAA,CAAK,SAAA;AAClB,MAAA,IAAI,MAAM,OAAA,CAAQ,IAAI,CAAA,IAAK,IAAA,CAAK,WAAW,CAAA,EAAG;AAC5C,QAAA,UAAA,CAAW,IAAA,CAAK,EAAE,EAAA,EAAI,IAAA,CAAK,EAAA,EAAI,IAAA,EAAM,IAAA,CAAK,CAAC,CAAA,EAAI,EAAA,EAAI,IAAA,CAAK,CAAC,GAAI,CAAA;AAAA,MAC/D;AACA,MAAA;AAAA,IACF;AACA,IAAA,MAAM,KAAA,GAAQ,aAAA,CAAc,IAAA,EAAM,IAAA,CAAK,IAAI,CAAA;AAC3C,IAAA,IAAI,UAAU,IAAA,EAAM;AACpB,IAAA,MAAM,KAAA,GAAmB;AAAA,MACvB,IAAI,IAAA,CAAK,EAAA;AAAA,MACT,MAAA,EAAQ,QAAA,CAAS,SAAA,CAAU,IAAI,CAAA;AAAA,MAC/B,MAAA,EAAQ,MAAM,MAAA,KAAW;AAAA,KAC3B;AACA,IAAA,KAAA,CAAM,KAAK,KAAK,CAAA;AAChB,IAAA,IAAA,CAAK,GAAA,CAAI,KAAA,CAAM,EAAA,EAAI,KAAK,CAAA;AAAA,EAC1B;AAEA,EAAA,MAAM,KAAA,GAAQ,UAAA,CAAW,MAAA,CAAO,CAAC,MAAM,IAAA,CAAK,GAAA,CAAI,CAAA,CAAE,IAAI,CAAA,IAAK,IAAA,CAAK,GAAA,CAAI,CAAA,CAAE,EAAE,CAAC,CAAA;AACzE,EAAA,MAAM,GAAA,uBAAU,GAAA,EAAyB;AACzC,EAAA,MAAM,IAAA,uBAAW,GAAA,EAAyB;AAC1C,EAAA,KAAA,MAAW,QAAQ,KAAA,EAAO;AACxB,IAAA,IAAA,CAAK,GAAA,EAAK,IAAA,CAAK,IAAA,EAAM,IAAI,CAAA;AACzB,IAAA,IAAA,CAAK,IAAA,EAAM,IAAA,CAAK,EAAA,EAAI,IAAI,CAAA;AAAA,EAC1B;AAEA,EAAA,MAAM,IAAA,GAA6B,MAAA,CAAO,MAAA,CAAO,EAAE,CAAA;AACnD,EAAA,OAAO;AAAA,IACL,KAAA;AAAA,IACA,KAAA;AAAA,IACA,IAAA,EAAM,CAAC,EAAA,KAAO,IAAA,CAAK,IAAI,EAAE,CAAA;AAAA,IACzB,UAAU,CAAC,EAAA,KAAO,GAAA,CAAI,GAAA,CAAI,EAAE,CAAA,IAAK,IAAA;AAAA,IACjC,UAAU,CAAC,EAAA,KAAO,IAAA,CAAK,GAAA,CAAI,EAAE,CAAA,IAAK;AAAA,GACpC;AACF;AAEA,SAAS,IAAA,CAAK,KAAA,EAAiC,GAAA,EAAa,IAAA,EAAuB;AACjF,EAAA,MAAM,IAAA,GAAO,KAAA,CAAM,GAAA,CAAI,GAAG,CAAA;AAC1B,EAAA,IAAI,SAAS,MAAA,EAAW,KAAA,CAAM,IAAI,GAAA,EAAK,CAAC,IAAI,CAAC,CAAA;AAAA,OACxC,IAAA,CAAK,KAAK,IAAI,CAAA;AACrB;;;AC1EO,IAAM,gBAAA,GAAmB;AACzB,IAAM,gBAAA,GAAmB;AAChC,IAAM,iBAAA,GAAoB,IAAA;AAWnB,SAAS,OAAA,CAAQ,YAA6B,MAAA,EAAoB;AACvE,EAAA,QAAQ,SAAA;AAAW,IACjB,KAAK,IAAA;AACH,MAAA,OAAO,EAAE,IAAA,EAAM,GAAA,EAAK,KAAA,EAAO,GAAA,EAAK,MAAM,EAAA,EAAG;AAAA,IAC3C,KAAK,OAAA;AACH,MAAA,OAAO,EAAE,IAAA,EAAM,GAAA,EAAK,KAAA,EAAO,GAAA,EAAK,MAAM,CAAA,EAAE;AAAA,IAC1C,KAAK,MAAA;AACH,MAAA,OAAO,EAAE,IAAA,EAAM,GAAA,EAAK,KAAA,EAAO,GAAA,EAAK,MAAM,EAAA,EAAG;AAAA,IAC3C;AACE,MAAA,OAAO,EAAE,IAAA,EAAM,GAAA,EAAK,KAAA,EAAO,GAAA,EAAK,MAAM,CAAA,EAAE;AAAA;AAE9C;AAGO,SAAS,MAAA,CAAO,QAAgB,IAAA,EAAyB;AAC9D,EAAA,OAAO,IAAA,KAAS,GAAA,GAAM,MAAA,CAAO,KAAA,GAAQ,MAAA,CAAO,MAAA;AAC9C;AAGO,SAAS,MAAA,CAAO,QAAgB,IAAA,EAAyB;AAC9D,EAAA,OAAO,IAAA,KAAS,GAAA,GAAM,MAAA,CAAO,CAAA,GAAI,MAAA,CAAO,QAAQ,CAAA,GAAI,MAAA,CAAO,CAAA,GAAI,MAAA,CAAO,MAAA,GAAS,CAAA;AACjF;AAGO,SAAS,SAAA,CAAU,KAAA,EAAc,IAAA,GAAsB,EAAC,EAAgB;AAC7E,EAAA,MAAM,SAAS,IAAI,GAAA,CAAY,IAAA,CAAK,GAAA,IAAO,EAAE,CAAA;AAC7C,EAAA,KAAA,MAAW,IAAA,IAAQ,MAAM,KAAA,EAAO;AAC9B,IAAA,IAAI,IAAA,CAAK,MAAA,EAAQ,MAAA,CAAO,GAAA,CAAI,KAAK,EAAE,CAAA;AAAA,EACrC;AACA,EAAA,OAAO,MAAA;AACT;AAyBO,SAAS,MAAA,CACd,KAAA,EACA,KAAA,EACA,IAAA,GAAsB,EAAC,EACT;AACd,EAAA,MAAM,IAAA,GAAO,OAAA,CAAQ,IAAA,CAAK,SAAS,CAAA;AACnC,EAAA,MAAM,MAAA,GAAS,SAAA,CAAU,KAAA,EAAO,IAAI,CAAA;AACpC,EAAA,MAAM,SAAA,GAAY,KAAK,SAAA,IAAa,iBAAA;AAEpC,EAAA,MAAM,MAAA,uBAAa,GAAA,EAAkB;AACrC,EAAA,KAAA,MAAW,IAAA,IAAQ,MAAM,KAAA,EAAO;AAC9B,IAAA,MAAM,IAAA,GAAO,KAAA,CAAM,GAAA,CAAI,IAAA,CAAK,EAAE,CAAA;AAC9B,IAAA,IAAI,SAAS,MAAA,EAAW;AACxB,IAAA,MAAM,KAAA,GAAQ,IAAA,CAAK,IAAA,KAAS,CAAA,GAAI,IAAA,CAAK,IAAA,GAAO,EAAE,IAAA,CAAK,IAAA,GAAO,MAAA,CAAO,IAAA,CAAK,MAAA,EAAQ,KAAK,IAAI,CAAA,CAAA;AACvF,IAAA,MAAA,CAAO,GAAA;AAAA,MACL,IAAA,CAAK,EAAA;AAAA,MACL,IAAA,CAAK,IAAA,KAAS,GAAA,GAAM,EAAE,GAAG,IAAA,CAAK,KAAA,EAAO,CAAA,EAAG,KAAA,KAAU,EAAE,CAAA,EAAG,KAAA,EAAO,CAAA,EAAG,KAAK,KAAA;AAAM,KAC9E;AAAA,EACF;AAEA,EAAA,OAAO,UAAA,CAAW,KAAA,EAAO,MAAA,EAAQ,MAAA,EAAQ,SAAS,CAAA;AACpD;AAOO,SAAS,UAAA,CACd,KAAA,EACA,MAAA,EACA,MAAA,EACA,YAAY,iBAAA,EACE;AACd,EAAA,MAAM,MAAA,GAAS,WAAA,CAAY,KAAA,EAAO,MAAA,EAAQ,MAAM,CAAA;AAChD,EAAA,MAAM,GAAA,uBAAU,GAAA,EAAkB;AAClC,EAAA,KAAA,MAAW,IAAA,IAAQ,MAAM,KAAA,EAAO;AAC9B,IAAA,MAAM,EAAA,GAAK,MAAA,CAAO,GAAA,CAAI,IAAA,CAAK,EAAE,CAAA;AAC7B,IAAA,IAAI,OAAO,MAAA,IAAa,MAAA,CAAO,GAAA,CAAI,IAAA,CAAK,EAAE,CAAA,EAAG;AAC7C,IAAA,MAAM,CAAA,GAAI,EAAA,CAAG,CAAA,GAAI,MAAA,CAAO,CAAA;AACxB,IAAA,MAAM,CAAA,GAAI,EAAA,CAAG,CAAA,GAAI,MAAA,CAAO,CAAA;AACxB,IAAA,IAAI,IAAA,CAAK,GAAA,CAAI,CAAA,GAAI,IAAA,CAAK,OAAO,CAAC,CAAA,IAAK,SAAA,IAAa,IAAA,CAAK,IAAI,CAAA,GAAI,IAAA,CAAK,MAAA,CAAO,CAAC,KAAK,SAAA,EAAW;AACxF,MAAA;AAAA,IACF;AACA,IAAA,GAAA,CAAI,IAAI,IAAA,CAAK,EAAA,EAAI,EAAE,CAAA,EAAG,GAAG,CAAA;AAAA,EAC3B;AACA,EAAA,OAAO,GAAA;AACT;AAEA,SAAS,WAAA,CACP,KAAA,EACA,MAAA,EACA,MAAA,EACM;AACN,EAAA,KAAA,MAAW,IAAA,IAAQ,MAAM,KAAA,EAAO;AAC9B,IAAA,IAAI,CAAC,MAAA,CAAO,GAAA,CAAI,IAAA,CAAK,EAAE,CAAA,EAAG;AAC1B,IAAA,MAAM,EAAA,GAAK,MAAA,CAAO,GAAA,CAAI,IAAA,CAAK,EAAE,CAAA;AAC7B,IAAA,IAAI,EAAA,KAAO,MAAA,EAAW,OAAO,EAAE,GAAG,IAAA,CAAK,MAAA,CAAO,CAAA,GAAI,EAAA,CAAG,GAAG,CAAA,EAAG,IAAA,CAAK,MAAA,CAAO,CAAA,GAAI,GAAG,CAAA,EAAE;AAAA,EAClF;AACA,EAAA,IAAI,OAAA,GAAU,QAAA;AACd,EAAA,IAAI,OAAA,GAAU,QAAA;AACd,EAAA,IAAI,OAAA,GAAU,QAAA;AACd,EAAA,IAAI,OAAA,GAAU,QAAA;AACd,EAAA,KAAA,MAAW,IAAA,IAAQ,MAAM,KAAA,EAAO;AAC9B,IAAA,MAAM,EAAA,GAAK,MAAA,CAAO,GAAA,CAAI,IAAA,CAAK,EAAE,CAAA;AAC7B,IAAA,IAAI,OAAO,MAAA,EAAW;AACtB,IAAA,OAAA,GAAU,IAAA,CAAK,GAAA,CAAI,OAAA,EAAS,IAAA,CAAK,OAAO,CAAC,CAAA;AACzC,IAAA,OAAA,GAAU,IAAA,CAAK,GAAA,CAAI,OAAA,EAAS,IAAA,CAAK,OAAO,CAAC,CAAA;AACzC,IAAA,OAAA,GAAU,IAAA,CAAK,GAAA,CAAI,OAAA,EAAS,EAAA,CAAG,CAAC,CAAA;AAChC,IAAA,OAAA,GAAU,IAAA,CAAK,GAAA,CAAI,OAAA,EAAS,EAAA,CAAG,CAAC,CAAA;AAAA,EAClC;AACA,EAAA,IAAI,CAAC,MAAA,CAAO,QAAA,CAAS,OAAO,CAAA,SAAU,EAAE,CAAA,EAAG,CAAA,EAAG,CAAA,EAAG,CAAA,EAAE;AACnD,EAAA,OAAO,EAAE,CAAA,EAAG,OAAA,GAAU,OAAA,EAAS,CAAA,EAAG,UAAU,OAAA,EAAQ;AACtD;AASO,SAAS,UAAA,CACd,KAAA,EACA,IAAA,EACA,GAAA,EAC2C;AAC3C,EAAA,MAAM,EAAA,uBAAS,GAAA,EAAoB;AACnC,EAAA,IAAI,MAAA,GAAS,CAAA;AACb,EAAA,KAAA,MAAW,QAAQ,KAAA,EAAO;AACxB,IAAA,EAAA,CAAG,GAAA,CAAI,IAAA,CAAK,EAAA,EAAI,MAAM,CAAA;AACtB,IAAA,MAAA,IAAU,MAAA,CAAO,IAAA,CAAK,MAAA,EAAQ,IAAI,CAAA,GAAI,GAAA;AAAA,EACxC;AACA,EAAA,OAAO,EAAE,IAAI,IAAA,EAAM,KAAA,CAAM,WAAW,CAAA,GAAI,CAAA,GAAI,SAAS,GAAA,EAAI;AAC3D;AAKO,SAAS,WAAA,CACd,KAAA,EACA,IAAA,EACA,OAAA,EACa;AACb,EAAA,OAAO,CAAC,GAAG,KAAK,EAAE,IAAA,CAAK,CAAC,GAAG,CAAA,KAAM;AAC/B,IAAA,MAAM,CAAA,GAAI,OAAO,CAAA,CAAE,MAAA,EAAQ,IAAI,CAAA,GAAI,MAAA,CAAO,CAAA,CAAE,MAAA,EAAQ,IAAI,CAAA;AACxD,IAAA,OAAO,CAAA,KAAM,IAAI,CAAA,GAAI,OAAA,CAAQ,EAAE,EAAE,CAAA,GAAI,OAAA,CAAQ,CAAA,CAAE,EAAE,CAAA;AAAA,EACnD,CAAC,CAAA;AACH;AAGO,SAAS,WAAW,KAAA,EAAsC;AAC/D,EAAA,MAAM,KAAA,uBAAY,GAAA,EAAoB;AACtC,EAAA,KAAA,CAAM,KAAA,CAAM,OAAA,CAAQ,CAAC,IAAA,EAAM,CAAA,KAAM,MAAM,GAAA,CAAI,IAAA,CAAK,EAAA,EAAI,CAAC,CAAC,CAAA;AACtD,EAAA,OAAO,CAAC,EAAA,KAAO,KAAA,CAAM,GAAA,CAAI,EAAE,KAAK,MAAA,CAAO,gBAAA;AACzC;;;ACrLA,IAAM,QAAA,GAAW;AAAA,EACf,UAAA,EAAY,GAAA;AAAA,EACZ,YAAA,EAAc,GAAA;AAAA,EACd,YAAA,EAAc,IAAA;AAAA,EACd,MAAA,EAAQ,IAAA;AAAA,EACR,OAAA,EAAS,IAAA;AAAA,EACT,OAAA,EAAS;AACX,CAAA;AAIA,IAAM,SAAS,IAAA,CAAK,EAAA,IAAM,CAAA,GAAI,IAAA,CAAK,KAAK,CAAC,CAAA,CAAA;AAGzC,IAAM,KAAA,GAAQ,GAAA;AAGd,SAAS,MAAA,CAAO,QAAyB,QAAA,EAAyC;AAChF,EAAA,OAAO,CAAC,KAAA,KAAU;AAChB,IAAA,KAAA,IAAS,CAAA,GAAI,CAAA,EAAG,CAAA,GAAI,MAAA,CAAO,QAAQ,CAAA,EAAA,EAAK;AACtC,MAAA,MAAM,CAAA,GAAI,OAAO,CAAC,CAAA;AAClB,MAAA,KAAA,IAAS,IAAI,CAAA,GAAI,CAAA,EAAG,CAAA,GAAI,MAAA,CAAO,QAAQ,CAAA,EAAA,EAAK;AAC1C,QAAA,MAAM,CAAA,GAAI,OAAO,CAAC,CAAA;AAClB,QAAA,MAAM,EAAA,GAAK,CAAA,CAAE,CAAA,GAAI,CAAA,CAAE,CAAA;AACnB,QAAA,MAAM,EAAA,GAAK,CAAA,CAAE,CAAA,GAAI,CAAA,CAAE,CAAA;AACnB,QAAA,MAAM,EAAA,GAAK,EAAA,GAAK,EAAA,GAAK,EAAA,GAAK,EAAA;AAC1B,QAAA,IAAI,OAAO,CAAA,EAAG;AACd,QAAA,MAAM,CAAA,GAAK,WAAW,KAAA,GAAS,EAAA;AAC/B,QAAA,CAAA,CAAE,MAAO,EAAA,GAAK,CAAA;AACd,QAAA,CAAA,CAAE,MAAO,EAAA,GAAK,CAAA;AACd,QAAA,CAAA,CAAE,MAAO,EAAA,GAAK,CAAA;AACd,QAAA,CAAA,CAAE,MAAO,EAAA,GAAK,CAAA;AAAA,MAChB;AAAA,IACF;AAAA,EACF,CAAA;AACF;AAGA,SAAS,KAAA,CACP,MAAA,EACA,KAAA,EACA,QAAA,EACA,QAAA,EACuB;AACvB,EAAA,OAAO,CAAC,KAAA,KAAU;AAChB,IAAA,KAAA,MAAW,IAAA,IAAQ,MAAM,KAAA,EAAO;AAC9B,MAAA,MAAM,CAAA,GAAI,MAAA,CAAO,GAAA,CAAI,IAAA,CAAK,IAAI,CAAA;AAC9B,MAAA,MAAM,CAAA,GAAI,MAAA,CAAO,GAAA,CAAI,IAAA,CAAK,EAAE,CAAA;AAC5B,MAAA,IAAI,CAAA,KAAM,MAAA,IAAa,CAAA,KAAM,MAAA,IAAa,MAAM,CAAA,EAAG;AACnD,MAAA,MAAM,EAAA,GAAK,CAAA,CAAE,CAAA,GAAI,CAAA,CAAE,CAAA;AACnB,MAAA,MAAM,EAAA,GAAK,CAAA,CAAE,CAAA,GAAI,CAAA,CAAE,CAAA;AACnB,MAAA,MAAM,CAAA,GAAI,IAAA,CAAK,KAAA,CAAM,EAAA,EAAI,EAAE,CAAA;AAC3B,MAAA,IAAI,MAAM,CAAA,EAAG;AACb,MAAA,MAAM,IAAA,GAAA,CAAS,CAAA,GAAI,QAAA,IAAY,CAAA,GAAK,KAAA,GAAQ,QAAA;AAC5C,MAAA,CAAA,CAAE,MAAO,EAAA,GAAK,IAAA;AACd,MAAA,CAAA,CAAE,MAAO,EAAA,GAAK,IAAA;AACd,MAAA,CAAA,CAAE,MAAO,EAAA,GAAK,IAAA;AACd,MAAA,CAAA,CAAE,MAAO,EAAA,GAAK,IAAA;AAAA,IAChB;AAAA,EACF,CAAA;AACF;AAUA,SAAS,aAAA,CAAc,QAAyB,OAAA,EAAwC;AACtF,EAAA,OAAO,MAAM;AACX,IAAA,KAAA,IAAS,CAAA,GAAI,CAAA,EAAG,CAAA,GAAI,MAAA,CAAO,QAAQ,CAAA,EAAA,EAAK;AACtC,MAAA,MAAM,CAAA,GAAI,OAAO,CAAC,CAAA;AAClB,MAAA,KAAA,IAAS,IAAI,CAAA,GAAI,CAAA,EAAG,CAAA,GAAI,MAAA,CAAO,QAAQ,CAAA,EAAA,EAAK;AAC1C,QAAA,MAAM,CAAA,GAAI,OAAO,CAAC,CAAA;AAClB,QAAA,MAAM,EAAA,GAAK,CAAA,CAAE,CAAA,GAAI,CAAA,CAAE,CAAA;AACnB,QAAA,MAAM,EAAA,GAAK,CAAA,CAAE,CAAA,GAAI,CAAA,CAAE,CAAA;AACnB,QAAA,MAAM,IAAA,GAAO,EAAE,EAAA,GAAK,CAAA,CAAE,KAAK,OAAA,GAAU,IAAA,CAAK,IAAI,EAAE,CAAA;AAChD,QAAA,MAAM,IAAA,GAAO,EAAE,EAAA,GAAK,CAAA,CAAE,KAAK,OAAA,GAAU,IAAA,CAAK,IAAI,EAAE,CAAA;AAChD,QAAA,IAAI,IAAA,IAAQ,CAAA,IAAK,IAAA,IAAQ,CAAA,EAAG;AAC5B,QAAA,IAAI,OAAO,IAAA,EAAM;AACf,UAAA,MAAMC,SAAQ,IAAA,CAAK,IAAA,CAAK,EAAE,CAAA,IAAK,KAAK,IAAA,GAAO,GAAA;AAC3C,UAAA,CAAA,CAAE,EAAA,IAAOA,KAAAA;AACT,UAAA,CAAA,CAAE,EAAA,IAAOA,KAAAA;AAAA,QACX,CAAA,MAAO;AACL,UAAA,MAAMA,SAAQ,IAAA,CAAK,IAAA,CAAK,EAAE,CAAA,IAAK,KAAK,IAAA,GAAO,GAAA;AAC3C,UAAA,CAAA,CAAE,EAAA,IAAOA,KAAAA;AACT,UAAA,CAAA,CAAE,EAAA,IAAOA,KAAAA;AAAA,QACX;AAAA,MACF;AAAA,IACF;AAAA,EACF,CAAA;AACF;AAIA,SAAS,OAAA,CAAQ,MAAA,EAAyB,EAAA,EAA8B,QAAA,EAAyC;AAC/G,EAAA,OAAO,CAAC,KAAA,KAAU;AAChB,IAAA,KAAA,MAAW,QAAQ,MAAA,EAAQ;AACzB,MAAA,IAAA,CAAK,EAAA,IAAA,CAAQ,EAAA,CAAG,CAAA,GAAI,IAAA,CAAK,KAAK,QAAA,GAAW,KAAA;AACzC,MAAA,IAAA,CAAK,EAAA,IAAA,CAAQ,EAAA,CAAG,CAAA,GAAI,IAAA,CAAK,KAAK,QAAA,GAAW,KAAA;AAAA,IAC3C;AAAA,EACF,CAAA;AACF;AAmBO,SAAS,eAAA,CAAgB,KAAA,EAAc,IAAA,GAAqB,EAAC,EAAoB;AACtF,EAAA,MAAM;AAAA,IACJ,eAAe,QAAA,CAAS,YAAA;AAAA,IACxB,eAAe,QAAA,CAAS,YAAA;AAAA,IACxB,MAAA,EAAQ,iBAAiB,QAAA,CAAS,MAAA;AAAA,IAClC,OAAA,EAAS,kBAAkB,QAAA,CAAS,OAAA;AAAA,IACpC,UAAU,QAAA,CAAS;AAAA,GACrB,GAAI,IAAA;AAEJ,EAAA,MAAM,MAAA,GAAS,SAAA,CAAU,KAAA,EAAO,IAAI,CAAA;AACpC,EAAA,MAAM,MAAA,GAAiB,KAAA,CAAM,KAAA,CAAM,GAAA,CAAI,CAAC,IAAA,KAAS;AAC/C,IAAA,MAAM,IAAA,GAAa;AAAA,MACjB,IAAI,IAAA,CAAK,EAAA;AAAA,MACT,CAAA,EAAG,MAAA,CAAO,IAAA,CAAK,MAAA,EAAQ,GAAG,CAAA;AAAA,MAC1B,CAAA,EAAG,MAAA,CAAO,IAAA,CAAK,MAAA,EAAQ,GAAG,CAAA;AAAA,MAC1B,EAAA,EAAI,IAAA,CAAK,MAAA,CAAO,KAAA,GAAQ,CAAA;AAAA,MACxB,EAAA,EAAI,IAAA,CAAK,MAAA,CAAO,MAAA,GAAS;AAAA,KAC3B;AAIA,IAAA,IAAI,MAAA,CAAO,GAAA,CAAI,IAAA,CAAK,EAAE,CAAA,EAAG;AACvB,MAAA,IAAA,CAAK,KAAK,IAAA,CAAK,CAAA;AACf,MAAA,IAAA,CAAK,KAAK,IAAA,CAAK,CAAA;AAAA,IACjB;AACA,IAAA,OAAO,IAAA;AAAA,EACT,CAAC,CAAA;AACD,EAAA,QAAA,CAAS,MAAM,CAAA;AAEf,EAAA,MAAM,IAAA,GAAO,IAAI,GAAA,CAAI,MAAA,CAAO,GAAA,CAAI,CAAC,CAAA,KAAM,CAAC,CAAA,CAAE,EAAA,EAAI,CAAC,CAAC,CAAC,CAAA;AACjD,EAAA,MAAM,QAAA,GAAW;AAAA,IACf,CAAA,EAAG,MAAA,CAAO,MAAA,CAAO,CAAC,GAAA,EAAK,CAAA,KAAM,GAAA,GAAM,CAAA,CAAE,CAAA,EAAG,CAAC,CAAA,GAAI,MAAA,CAAO,MAAA;AAAA,IACpD,CAAA,EAAG,MAAA,CAAO,MAAA,CAAO,CAAC,GAAA,EAAK,CAAA,KAAM,GAAA,GAAM,CAAA,CAAE,CAAA,EAAG,CAAC,CAAA,GAAI,MAAA,CAAO;AAAA,GACtD;AAEA,EAAA,MAAM,MAAM,gBAAA,CAAuB;AAAA,IACjC,KAAA,EAAO,MAAA;AAAA,IACP,MAAA,EAAQ;AAAA,MACN,MAAA,CAAO,QAAQ,cAAc,CAAA;AAAA,MAC7B,KAAA,CAAM,IAAA,EAAM,KAAA,EAAO,YAAA,EAAc,YAAY,CAAA;AAAA,MAC7C,OAAA,CAAQ,MAAA,EAAQ,QAAA,EAAU,eAAe,CAAA;AAAA,MACzC,aAAA,CAAc,QAAQ,OAAO;AAAA;AAC/B,GACD,CAAA;AAED,EAAA,OAAO;AAAA,IACL,MAAA;AAAA,IACA,IAAA;AAAA,IACA,MAAA;AAAA,IACA,GAAA;AAAA,IACA,MAAA,GAAS;AACP,MAAA,MAAM,MAAA,uBAAa,GAAA,EAAsC;AACzD,MAAA,KAAA,MAAW,IAAA,IAAQ,MAAM,KAAA,EAAO;AAC9B,QAAA,MAAM,IAAA,GAAO,IAAA,CAAK,GAAA,CAAI,IAAA,CAAK,EAAE,CAAA;AAC7B,QAAA,MAAA,CAAO,GAAA,CAAI,KAAK,EAAA,EAAI;AAAA,UAClB,CAAA,EAAG,IAAA,CAAK,CAAA,GAAI,IAAA,CAAK,OAAO,KAAA,GAAQ,CAAA;AAAA,UAChC,CAAA,EAAG,IAAA,CAAK,CAAA,GAAI,IAAA,CAAK,OAAO,MAAA,GAAS;AAAA,SAClC,CAAA;AAAA,MACH;AACA,MAAA,OAAO,MAAA;AAAA,IACT;AAAA,GACF;AACF;AAEO,IAAM,KAAA,GAAQ,CAAC,KAAA,EAAc,IAAA,GAAqB,EAAC,KAAoB;AAC5E,EAAA,IAAI,MAAM,KAAA,CAAM,MAAA,KAAW,CAAA,EAAG,2BAAW,GAAA,EAAI;AAC7C,EAAA,MAAM,UAAA,GAAa,eAAA,CAAgB,KAAA,EAAO,IAAI,CAAA;AAC9C,EAAA,UAAA,CAAW,GAAA,CAAI,IAAA,CAAK,IAAA,CAAK,UAAA,IAAc,SAAS,UAAU,CAAA;AAC1D,EAAA,OAAO,UAAA,CAAW,OAAO,UAAA,CAAW,MAAA,IAAU,UAAA,CAAW,MAAA,EAAQ,KAAK,SAAS,CAAA;AACjF;AASA,SAAS,SAAS,MAAA,EAAsB;AACtC,EAAA,MAAM,IAAA,uBAAW,GAAA,EAAoB;AACrC,EAAA,MAAA,CAAO,OAAA,CAAQ,CAAC,IAAA,EAAM,CAAA,KAAM;AAC1B,IAAA,MAAM,MAAM,CAAA,EAAG,IAAA,CAAK,CAAC,CAAA,CAAA,EAAI,KAAK,CAAC,CAAA,CAAA;AAC/B,IAAA,MAAM,GAAA,GAAM,IAAA,CAAK,GAAA,CAAI,GAAG,CAAA,IAAK,CAAA;AAC7B,IAAA,IAAA,CAAK,GAAA,CAAI,GAAA,EAAK,GAAA,GAAM,CAAC,CAAA;AACrB,IAAA,IAAI,QAAQ,CAAA,IAAK,IAAA,CAAK,MAAM,IAAA,IAAQ,IAAA,CAAK,MAAM,IAAA,EAAM;AACrD,IAAA,MAAM,QAAQ,MAAA,GAAS,CAAA;AACvB,IAAA,MAAM,SAAS,KAAA,GAAQ,GAAA;AACvB,IAAA,IAAA,CAAK,CAAA,IAAK,IAAA,CAAK,GAAA,CAAI,KAAK,CAAA,GAAI,MAAA;AAC5B,IAAA,IAAA,CAAK,CAAA,IAAK,IAAA,CAAK,GAAA,CAAI,KAAK,CAAA,GAAI,MAAA;AAAA,EAC9B,CAAC,CAAA;AACH;;;AC3OO,SAAS,UAAU,KAAA,EAA2B;AACnD,EAAA,MAAM,IAAA,uBAAW,GAAA,EAAY;AAC7B,EAAA,MAAM,IAAA,uBAAW,GAAA,EAAY;AAC7B,EAAA,MAAM,OAAA,uBAAc,GAAA,EAAY;AAEhC,EAAA,MAAM,IAAA,GAAO,CAAC,EAAA,KAAqB;AACjC,IAAA,IAAI,IAAA,CAAK,GAAA,CAAI,EAAE,CAAA,EAAG;AAClB,IAAA,OAAA,CAAQ,IAAI,EAAE,CAAA;AACd,IAAA,KAAA,MAAW,IAAA,IAAQ,KAAA,CAAM,QAAA,CAAS,EAAE,CAAA,EAAG;AACrC,MAAA,IAAI,OAAA,CAAQ,IAAI,IAAA,CAAK,EAAE,GAAG,IAAA,CAAK,GAAA,CAAI,KAAK,EAAE,CAAA;AAAA,WACrC,IAAA,CAAK,KAAK,EAAE,CAAA;AAAA,IACnB;AACA,IAAA,OAAA,CAAQ,OAAO,EAAE,CAAA;AACjB,IAAA,IAAA,CAAK,IAAI,EAAE,CAAA;AAAA,EACb,CAAA;AAEA,EAAA,KAAA,MAAW,IAAA,IAAQ,KAAA,CAAM,KAAA,EAAO,IAAA,CAAK,KAAK,EAAE,CAAA;AAC5C,EAAA,OAAO,IAAA;AACT;AAGO,SAAS,OAAA,CAAQ,OAAc,IAAA,EAAgD;AACpF,EAAA,MAAM,KAAA,uBAAY,GAAA,EAAoB;AACtC,EAAA,MAAM,SAAA,uBAAgB,GAAA,EAAY;AAElC,EAAA,MAAM,MAAA,GAAS,CAAC,EAAA,KAAuB;AACrC,IAAA,MAAM,KAAA,GAAQ,KAAA,CAAM,GAAA,CAAI,EAAE,CAAA;AAC1B,IAAA,IAAI,KAAA,KAAU,QAAW,OAAO,KAAA;AAGhC,IAAA,IAAI,SAAA,CAAU,GAAA,CAAI,EAAE,CAAA,EAAG,OAAO,CAAA;AAC9B,IAAA,SAAA,CAAU,IAAI,EAAE,CAAA;AAChB,IAAA,IAAI,IAAA,GAAO,CAAA;AACX,IAAA,KAAA,MAAW,IAAA,IAAQ,KAAA,CAAM,QAAA,CAAS,EAAE,CAAA,EAAG;AACrC,MAAA,IAAI,IAAA,CAAK,GAAA,CAAI,IAAA,CAAK,EAAE,CAAA,EAAG;AACvB,MAAA,IAAA,GAAO,KAAK,GAAA,CAAI,IAAA,EAAM,OAAO,IAAA,CAAK,IAAI,IAAI,CAAC,CAAA;AAAA,IAC7C;AACA,IAAA,SAAA,CAAU,OAAO,EAAE,CAAA;AACnB,IAAA,KAAA,CAAM,GAAA,CAAI,IAAI,IAAI,CAAA;AAClB,IAAA,OAAO,IAAA;AAAA,EACT,CAAA;AAEA,EAAA,KAAA,MAAW,IAAA,IAAQ,KAAA,CAAM,KAAA,EAAO,MAAA,CAAO,KAAK,EAAE,CAAA;AAC9C,EAAA,OAAO,KAAA;AACT;AAEO,IAAM,OAAA,GAAoB,CAAC,KAAA,EAAO,IAAA,GAAO,EAAC,KAAM;AACrD,EAAA,MAAM,IAAA,GAAO,OAAA,CAAQ,IAAA,CAAK,SAAS,CAAA;AACnC,EAAA,MAAM,OAAA,GAAU,KAAK,OAAA,IAAW,gBAAA;AAChC,EAAA,MAAM,OAAA,GAAU,KAAK,OAAA,IAAW,gBAAA;AAChC,EAAA,MAAM,KAAA,GAAQ,WAAW,KAAK,CAAA;AAE9B,EAAA,MAAM,KAAA,GAAQ,OAAA,CAAQ,KAAA,EAAO,SAAA,CAAU,KAAK,CAAC,CAAA;AAC7C,EAAA,MAAM,MAAA,uBAAa,GAAA,EAAyB;AAC5C,EAAA,KAAA,MAAW,IAAA,IAAQ,MAAM,KAAA,EAAO;AAC9B,IAAA,MAAM,IAAA,GAAO,KAAA,CAAM,GAAA,CAAI,IAAA,CAAK,EAAE,CAAA,IAAK,CAAA;AACnC,IAAA,MAAM,IAAA,GAAO,MAAA,CAAO,GAAA,CAAI,IAAI,CAAA;AAC5B,IAAA,IAAI,SAAS,MAAA,EAAW,MAAA,CAAO,IAAI,IAAA,EAAM,CAAC,IAAI,CAAC,CAAA;AAAA,SAC1C,IAAA,CAAK,KAAK,IAAI,CAAA;AAAA,EACrB;AAEA,EAAA,MAAM,IAAA,GAAO,CAAC,GAAG,MAAA,CAAO,IAAA,EAAM,CAAA,CAAE,IAAA,CAAK,CAAC,CAAA,EAAG,CAAA,KAAM,CAAA,GAAI,CAAC,CAAA;AACpD,EAAA,MAAM,MAAA,uBAAa,GAAA,EAA2C;AAC9D,EAAA,IAAI,MAAA,GAAS,CAAA;AACb,EAAA,KAAA,MAAW,QAAQ,IAAA,EAAM;AACvB,IAAA,MAAM,GAAA,GAAM,YAAY,MAAA,CAAO,GAAA,CAAI,IAAI,CAAA,EAAI,IAAA,CAAK,OAAO,KAAK,CAAA;AAC5D,IAAA,MAAM,CAAA,GAAI,UAAA,CAAW,GAAA,EAAK,IAAA,CAAK,OAAO,OAAO,CAAA;AAC7C,IAAA,MAAA,CAAO,GAAA,CAAI,MAAM,CAAC,CAAA;AAClB,IAAA,MAAA,GAAS,IAAA,CAAK,GAAA,CAAI,MAAA,EAAQ,CAAA,CAAE,IAAI,CAAA;AAAA,EAClC;AAEA,EAAA,MAAM,KAAA,uBAAY,GAAA,EAAkB;AACpC,EAAA,IAAI,KAAA,GAAQ,CAAA;AACZ,EAAA,KAAA,MAAW,QAAQ,IAAA,EAAM;AACvB,IAAA,MAAM,GAAA,GAAM,MAAA,CAAO,GAAA,CAAI,IAAI,CAAA;AAC3B,IAAA,MAAM,CAAA,GAAI,MAAA,CAAO,GAAA,CAAI,IAAI,CAAA;AACzB,IAAA,MAAM,MAAA,GAAA,CAAU,MAAA,GAAS,CAAA,CAAE,IAAA,IAAQ,CAAA;AACnC,IAAA,MAAM,KAAA,GAAQ,IAAA,CAAK,GAAA,CAAI,CAAA,EAAG,GAAG,GAAA,CAAI,GAAA,CAAI,CAAC,CAAA,KAAM,OAAO,CAAA,CAAE,MAAA,EAAQ,IAAA,CAAK,IAAI,CAAC,CAAC,CAAA;AACxE,IAAA,KAAA,MAAW,QAAQ,GAAA,EAAK;AACtB,MAAA,KAAA,CAAM,GAAA,CAAI,KAAK,EAAA,EAAI;AAAA,QACjB,OAAO,MAAA,GAAS,CAAA,CAAE,EAAA,CAAG,GAAA,CAAI,KAAK,EAAE,CAAA;AAAA;AAAA;AAAA,QAGhC,IAAA,EAAM,SAAS,KAAA,GAAQ,MAAA,CAAO,KAAK,MAAA,EAAQ,IAAA,CAAK,IAAI,CAAA,IAAK;AAAA,OAC1D,CAAA;AAAA,IACH;AACA,IAAA,KAAA,IAAS,KAAA,GAAQ,OAAA;AAAA,EACnB;AAEA,EAAA,OAAO,MAAA,CAAO,KAAA,EAAO,KAAA,EAAO,IAAI,CAAA;AAClC;;;ACnFO,SAAS,QAAA,CAAS,OAAc,SAAA,EAA8B;AACnE,EAAA,MAAM,KAAA,GAAQ,WAAW,KAAK,CAAA;AAC9B,EAAA,MAAM,QAAA,uBAAe,GAAA,EAAyB;AAC9C,EAAA,MAAM,KAAA,uBAAY,GAAA,EAAoB;AACtC,EAAA,MAAM,QAAqB,EAAC;AAE5B,EAAA,MAAM,KAAA,GAAQ,CAAC,IAAA,EAAiB,EAAA,KAAqB;AACnD,IAAA,KAAA,CAAM,GAAA,CAAI,IAAA,CAAK,EAAA,EAAI,EAAE,CAAA;AACrB,IAAA,MAAM,OAAoB,EAAC;AAC3B,IAAA,KAAA,MAAW,IAAA,IAAQ,KAAA,CAAM,QAAA,CAAS,IAAA,CAAK,EAAE,CAAA,EAAG;AAC1C,MAAA,IAAI,IAAA,CAAK,OAAO,IAAA,CAAK,EAAA,IAAM,MAAM,GAAA,CAAI,IAAA,CAAK,EAAE,CAAA,EAAG;AAC/C,MAAA,MAAM,KAAA,GAAQ,KAAA,CAAM,IAAA,CAAK,IAAA,CAAK,EAAE,CAAA;AAChC,MAAA,IAAI,UAAU,MAAA,EAAW;AAGzB,MAAA,KAAA,CAAM,GAAA,CAAI,KAAA,CAAM,EAAA,EAAI,EAAA,GAAK,CAAC,CAAA;AAC1B,MAAA,IAAA,CAAK,KAAK,KAAK,CAAA;AAAA,IACjB;AACA,IAAA,MAAM,OAAA,GAAU,WAAA,CAAY,IAAA,EAAM,SAAA,EAAW,KAAK,CAAA;AAClD,IAAA,QAAA,CAAS,GAAA,CAAI,IAAA,CAAK,EAAA,EAAI,OAAO,CAAA;AAC7B,IAAA,KAAA,MAAW,KAAA,IAAS,OAAA,EAAS,KAAA,CAAM,KAAA,EAAO,KAAK,CAAC,CAAA;AAAA,EAClD,CAAA;AAEA,EAAA,MAAM,UAAU,KAAA,CAAM,KAAA,CAAM,OAAO,CAAC,IAAA,KAClC,MAAM,QAAA,CAAS,IAAA,CAAK,EAAE,CAAA,CAAE,MAAM,CAAC,IAAA,KAAS,KAAK,IAAA,KAAS,IAAA,CAAK,EAAE,CAAC,CAAA;AAChE,EAAA,KAAA,MAAW,IAAA,IAAQ,WAAA,CAAY,OAAA,EAAS,SAAA,EAAW,KAAK,CAAA,EAAG;AACzD,IAAA,IAAI,KAAA,CAAM,GAAA,CAAI,IAAA,CAAK,EAAE,CAAA,EAAG;AACxB,IAAA,KAAA,CAAM,KAAK,IAAI,CAAA;AACf,IAAA,KAAA,CAAM,MAAM,CAAC,CAAA;AAAA,EACf;AAGA,EAAA,KAAA,MAAW,IAAA,IAAQ,MAAM,KAAA,EAAO;AAC9B,IAAA,IAAI,KAAA,CAAM,GAAA,CAAI,IAAA,CAAK,EAAE,CAAA,EAAG;AACxB,IAAA,KAAA,CAAM,KAAK,IAAI,CAAA;AACf,IAAA,KAAA,CAAM,MAAM,CAAC,CAAA;AAAA,EACf;AAEA,EAAA,OAAO,EAAE,KAAA,EAAO,QAAA,EAAU,KAAA,EAAM;AAClC;AAEO,IAAM,IAAA,GAAiB,CAAC,KAAA,EAAO,IAAA,GAAO,EAAC,KAAM;AAClD,EAAA,MAAM,IAAA,GAAO,OAAA,CAAQ,IAAA,CAAK,SAAS,CAAA;AACnC,EAAA,MAAM,OAAA,GAAU,KAAK,OAAA,IAAW,gBAAA;AAChC,EAAA,MAAM,OAAA,GAAU,KAAK,OAAA,IAAW,gBAAA;AAChC,EAAA,MAAM,EAAE,OAAO,QAAA,EAAU,KAAA,KAAU,QAAA,CAAS,KAAA,EAAO,KAAK,KAAK,CAAA;AAE7D,EAAA,MAAM,KAAA,uBAAY,GAAA,EAAoB;AACtC,EAAA,KAAA,MAAW,IAAA,IAAQ,MAAM,KAAA,EAAO;AAC9B,IAAA,MAAM,EAAA,GAAK,KAAA,CAAM,GAAA,CAAI,IAAA,CAAK,EAAE,CAAA,IAAK,CAAA;AACjC,IAAA,KAAA,CAAM,GAAA,CAAI,EAAA,EAAI,IAAA,CAAK,GAAA,CAAI,MAAM,GAAA,CAAI,EAAE,CAAA,IAAK,CAAA,EAAG,OAAO,IAAA,CAAK,MAAA,EAAQ,IAAA,CAAK,IAAI,CAAC,CAAC,CAAA;AAAA,EAC5E;AACA,EAAA,MAAM,SAAA,uBAAgB,GAAA,EAAoB;AAC1C,EAAA,IAAI,KAAA,GAAQ,CAAA;AACZ,EAAA,KAAA,MAAW,EAAA,IAAM,CAAC,GAAG,KAAA,CAAM,IAAA,EAAM,CAAA,CAAE,IAAA,CAAK,CAAC,CAAA,EAAG,CAAA,KAAM,CAAA,GAAI,CAAC,CAAA,EAAG;AACxD,IAAA,SAAA,CAAU,GAAA,CAAI,IAAI,KAAK,CAAA;AACvB,IAAA,KAAA,IAAS,KAAA,CAAM,GAAA,CAAI,EAAE,CAAA,GAAK,OAAA;AAAA,EAC5B;AAEA,EAAA,MAAM,KAAA,uBAAY,GAAA,EAAkB;AAIpC,EAAA,MAAM,QAAA,uBAAe,GAAA,EAAoB;AACzC,EAAA,MAAM,OAAA,GAAU,CAAC,IAAA,KAA4B;AAC3C,IAAA,MAAM,KAAA,GAAQ,QAAA,CAAS,GAAA,CAAI,IAAA,CAAK,EAAE,CAAA;AAClC,IAAA,IAAI,KAAA,KAAU,QAAW,OAAO,KAAA;AAChC,IAAA,MAAM,OAAO,QAAA,CAAS,GAAA,CAAI,IAAA,CAAK,EAAE,KAAK,EAAC;AACvC,IAAA,IAAI,KAAA,GAAQ,CAAA;AACZ,IAAA,KAAA,MAAW,KAAA,IAAS,IAAA,EAAM,KAAA,IAAS,OAAA,CAAQ,KAAK,CAAA;AAChD,IAAA,IAAI,KAAK,MAAA,GAAS,CAAA,EAAG,KAAA,IAAS,OAAA,IAAW,KAAK,MAAA,GAAS,CAAA,CAAA;AACvD,IAAA,MAAM,KAAA,GAAQ,KAAK,GAAA,CAAI,MAAA,CAAO,KAAK,MAAA,EAAQ,IAAA,CAAK,KAAK,CAAA,EAAG,KAAK,CAAA;AAC7D,IAAA,QAAA,CAAS,GAAA,CAAI,IAAA,CAAK,EAAA,EAAI,KAAK,CAAA;AAC3B,IAAA,OAAO,KAAA;AAAA,EACT,CAAA;AAGA,EAAA,MAAM,KAAA,GAAQ,CAAC,IAAA,EAAiB,IAAA,KAAuB;AACrD,IAAA,MAAM,OAAO,QAAA,CAAS,GAAA,CAAI,IAAA,CAAK,EAAE,KAAK,EAAC;AACvC,IAAA,MAAM,KAAA,GAAQ,QAAQ,IAAI,CAAA;AAC1B,IAAA,MAAM,QAAQ,IAAA,CAAK,MAAA,CAAO,CAAC,GAAA,EAAK,CAAA,KAAM,MAAM,OAAA,CAAQ,CAAC,CAAA,EAAG,CAAC,IACrD,IAAA,CAAK,GAAA,CAAI,GAAG,IAAA,CAAK,MAAA,GAAS,CAAC,CAAA,GAAI,OAAA;AAEnC,IAAA,IAAIC,OAAAA,GAAS,IAAA,GAAA,CAAQ,KAAA,GAAQ,KAAA,IAAS,CAAA;AACtC,IAAA,KAAA,MAAW,SAAS,IAAA,EAAM;AACxB,MAAA,KAAA,CAAM,OAAOA,OAAM,CAAA;AACnB,MAAAA,OAAAA,IAAU,OAAA,CAAQ,KAAK,CAAA,GAAI,OAAA;AAAA,IAC7B;AAEA,IAAA,MAAM,GAAA,GAAM,MAAA,CAAO,IAAA,CAAK,MAAA,EAAQ,KAAK,KAAK,CAAA;AAC1C,IAAA,MAAM,EAAA,GAAK,KAAA,CAAM,GAAA,CAAI,IAAA,CAAK,EAAE,CAAA,IAAK,CAAA;AACjC,IAAA,KAAA,CAAM,GAAA,CAAI,KAAK,EAAA,EAAI;AAAA,MACjB,KAAA,EAAO,IAAA,GAAA,CAAQ,KAAA,GAAQ,GAAA,IAAO,CAAA;AAAA,MAC9B,IAAA,EAAM,SAAA,CAAU,GAAA,CAAI,EAAE,KAAM,KAAA,CAAM,GAAA,CAAI,EAAE,CAAA,GAAK,MAAA,CAAO,IAAA,CAAK,MAAA,EAAQ,IAAA,CAAK,IAAI,CAAA,IAAK;AAAA,KAChF,CAAA;AAAA,EACH,CAAA;AAEA,EAAA,IAAI,MAAA,GAAS,CAAA;AACb,EAAA,KAAA,MAAW,QAAQ,KAAA,EAAO;AACxB,IAAA,KAAA,CAAM,MAAM,MAAM,CAAA;AAClB,IAAA,MAAA,IAAU,OAAA,CAAQ,IAAI,CAAA,GAAI,OAAA;AAAA,EAC5B;AAEA,EAAA,OAAO,MAAA,CAAO,KAAA,EAAO,KAAA,EAAO,IAAI,CAAA;AAClC;;;ACxHO,IAAM,OAAA,GAA8C,OAAO,MAAA,CAAO;AAAA,EACvE,OAAA;AAAA,EACA,IAAA;AAAA,EACA;AACF,CAAC;AAsBM,SAAS,WAAA,CACd,KAAA,EACA,MAAA,EACA,IAAA,GAAkC,EAAC,EAC3B;AACR,EAAA,MAAM,KAAA,GAAQ,WAAA,CAAY,KAAA,EAAO,MAAA,EAAQ,KAAK,QAAQ,CAAA;AACtD,EAAA,IAAI,KAAA,CAAM,IAAA,KAAS,CAAA,EAAG,OAAO,CAAA;AAC7B,EAAA,KAAA,CAAM,KAAA,CAAM,IAAA,CAAK,KAAA,IAAS,QAAA,EAAU,MAAM;AACxC,IAAA,KAAA,MAAW,CAAC,IAAI,IAAI,CAAA,IAAK,OAAO,KAAA,CAAM,OAAA,CAAQ,IAAa,IAAI,CAAA;AAAA,EACjE,CAAC,CAAA;AAGD,EAAA,IAAI,KAAA,GAAQ,CAAA;AACZ,EAAA,KAAA,MAAW,EAAA,IAAM,OAAO,IAAA,EAAK,MAAO,KAAA,CAAM,GAAA,CAAI,EAAE,CAAA,EAAG,KAAA,EAAA;AACnD,EAAA,OAAO,KAAA;AACT;AAWO,SAAS,WAAA,CACd,KAAA,EACA,MAAA,EACA,QAAA,GAAkCF,oBAAAA,EACd;AACpB,EAAA,MAAM,GAAA,uBAAU,GAAA,EAAmB;AACnC,EAAA,KAAA,MAAW,CAAC,EAAA,EAAI,EAAE,CAAA,IAAK,MAAA,EAAQ;AAC7B,IAAA,MAAM,IAAA,GAAO,KAAA,CAAM,GAAA,CAAI,EAAW,CAAA;AAClC,IAAA,IAAI,SAAS,MAAA,EAAW;AACxB,IAAA,MAAM,MAAA,GAAS,QAAA,CAAS,SAAA,CAAU,IAAA,CAAK,IAAI,CAAA;AAC3C,IAAA,MAAM,EAAA,GAAK,EAAA,CAAG,CAAA,GAAI,MAAA,CAAO,CAAA;AACzB,IAAA,MAAM,EAAA,GAAK,EAAA,CAAG,CAAA,GAAI,MAAA,CAAO,CAAA;AACzB,IAAA,IAAI,EAAA,KAAO,CAAA,IAAK,EAAA,KAAO,CAAA,EAAG;AAC1B,IAAA,GAAA,CAAI,GAAA,CAAI,IAAIG,0BAAAA,CAA2B,IAAA,CAAK,MAAM,EAAA,EAAI,EAAA,EAAI,QAAQ,CAAC,CAAA;AACnE,IAAA,KAAA,MAAW,UAAA,IAAc,SAAA,CAAU,KAAA,EAAO,EAAE,CAAA,EAAG;AAC7C,MAAA,MAAM,KAAA,GAAQ,KAAA,CAAM,GAAA,CAAI,UAAmB,CAAA;AAC3C,MAAA,IAAI,UAAU,MAAA,EAAW;AACzB,MAAA,GAAA,CAAI,GAAA,CAAI,YAAYA,0BAAAA,CAA2B,KAAA,CAAM,MAAM,EAAA,EAAI,EAAA,EAAI,QAAQ,CAAC,CAAA;AAAA,IAC9E;AAAA,EACF;AACA,EAAA,OAAO,GAAA;AACT;AAEA,SAAS,SAAA,CAAiB,OAAsC,EAAA,EAAsB;AACpF,EAAA,MAAM,MAAgB,EAAC;AACvB,EAAA,MAAM,QAAQ,CAAC,GAAG,KAAA,CAAM,UAAA,CAAW,EAAW,CAAC,CAAA;AAC/C,EAAA,OAAO,KAAA,CAAM,SAAS,CAAA,EAAG;AACvB,IAAA,MAAM,IAAA,GAAO,MAAM,GAAA,EAAI;AACvB,IAAA,GAAA,CAAI,KAAK,IAAI,CAAA;AACb,IAAA,KAAA,CAAM,IAAA,CAAK,GAAG,KAAA,CAAM,UAAA,CAAW,IAAI,CAAC,CAAA;AAAA,EACtC;AACA,EAAA,OAAO,GAAA;AACT;AAGO,IAAM,gBAAA,GAAmB;AA0BzB,SAAS,mBAA0B,IAAA,EAA0C;AAClF,EAAA,MAAM,SAAA,GAAY,OAAO,IAAA,CAAK,SAAA,KAAc,UAAA,GACxC,IAAA,CAAK,SAAA,GACL,OAAA,CAAQ,IAAA,CAAK,SAAA,IAAa,SAAS,CAAA,IAAK,OAAA;AAC5C,EAAA,MAAM,KAAA,GAAQ;AAAA,IACZ,GAAI,KAAK,IAAA,GAAO,EAAE,MAAM,IAAA,CAAK,IAAA,KAAS,EAAC;AAAA,IACvC,GAAI,KAAK,QAAA,GAAW,EAAE,UAAU,IAAA,CAAK,QAAA,KAAa;AAAC,GACrD;AAEA,EAAA,OAAO;AAAA,IACL,EAAA,EAAI,KAAK,EAAA,IAAM,gBAAA;AAAA,IACf,KAAA,EAAO,KAAK,KAAA,IAAS,iBAAA;AAAA,IACrB,KAAA,EAAO,KAAK,KAAA,IAAS,SAAA;AAAA,IACrB,QAAA,EAAU,CAAC,OAAO,CAAA;AAAA,IAClB,OAAA,EAAS;AAAA,MACP,MAAA,EAAQ,WAAA;AAAA,MACR,GAAA,EAAK,CAAC,IAAA,KAAS;AACb,QAAA,MAAM,KAAA,GAAQ,KAAK,OAAO,CAAA;AAC1B,QAAA,IAAI,UAAU,MAAA,EAAW;AACzB,QAAA,MAAM,KAAA,GAAQ,UAAA,CAAW,IAAA,CAAK,MAAA,EAAQ,KAAK,CAAA;AAC3C,QAAA,WAAA,CAAY,KAAA,EAAO,SAAA,CAAU,KAAA,EAAO,IAAA,CAAK,MAAM,CAAA,EAAG;AAAA,UAChD,GAAI,KAAK,QAAA,GAAW,EAAE,UAAU,IAAA,CAAK,QAAA,KAAa,EAAC;AAAA,UACnD,GAAI,KAAK,KAAA,GAAQ,EAAE,OAAO,IAAA,CAAK,KAAA,KAAU;AAAC,SAC3C,CAAA;AAAA,MACH;AAAA,KACF;AAAA,IACA,SAAS,MAAM;AAAA,GACjB;AACF;;;AC7GA,IAAM,WAAA,GAAc,EAAA;AAIpB,IAAM,SAAA,GAAsB,CAAC,CAAA,KAAO,CAAA,GAAI,GAAA,GAAM,CAAA,GAAI,CAAA,GAAI,CAAA,GAAI,CAAA,GAAA,CAAK,EAAA,GAAK,CAAA,GAAI,CAAA,KAAM,CAAA,GAAI,CAAA;AAsB3E,SAAS,aAAA,CACd,KAAA,EACA,IAAA,GAAoC,EAAC,EACV;AAC3B,EAAA,MAAM,QAAA,GAAW,KAAK,QAAA,IAAaH,oBAAAA;AACnC,EAAA,MAAM,UAAA,GAAa,eAAA,CAAgB,KAAA,EAAO,IAAI,CAAA;AAC9C,EAAA,MAAM,SAAA,GAAY,KAAK,SAAA,IAAa,GAAA;AAEpC,EAAA,OAAO,CAAC,EAAE,MAAA,EAAO,KAAM;AACrB,IAAA,KAAA,MAAW,IAAA,IAAQ,MAAM,KAAA,EAAO;AAC9B,MAAA,MAAM,IAAA,GAAO,UAAA,CAAW,IAAA,CAAK,GAAA,CAAI,KAAK,EAAE,CAAA;AACxC,MAAA,IAAI,SAAS,MAAA,EAAW;AACxB,MAAA,MAAM,IAAA,GAAO,MAAA,CAAO,GAAA,CAAI,IAAA,CAAK,EAAY,CAAA;AACzC,MAAA,IAAI,SAAS,MAAA,EAAW;AAGtB,QAAA,MAAM,MAAA,GAAS,QAAA,CAAS,SAAA,CAAU,IAAI,CAAA;AACtC,QAAA,IAAA,CAAK,EAAA,GAAK,MAAA,CAAO,MAAA,EAAQ,GAAG,CAAA;AAC5B,QAAA,IAAA,CAAK,EAAA,GAAK,MAAA,CAAO,MAAA,EAAQ,GAAG,CAAA;AAAA,MAC9B,WAAW,CAAC,UAAA,CAAW,OAAO,GAAA,CAAI,IAAA,CAAK,EAAE,CAAA,EAAG;AAC1C,QAAA,OAAO,IAAA,CAAK,EAAA;AACZ,QAAA,OAAO,IAAA,CAAK,EAAA;AAAA,MACd;AAAA,IACF;AAGA,IAAA,UAAA,CAAW,IAAI,WAAA,CAAY,MAAA,CAAO,IAAA,GAAO,CAAA,GAAI,YAAY,CAAC,CAAA;AAC1D,IAAA,UAAA,CAAW,IAAI,IAAA,EAAK;AACpB,IAAA,OAAO,EAAE,QAAQ,UAAA,CAAW,MAAA,IAAU,IAAA,EAAM,UAAA,CAAW,GAAA,CAAI,SAAA,EAAU,EAAE;AAAA,EACzE,CAAA;AACF;AAiBO,SAAS,aAAA,CACd,KAAA,EACA,SAAA,EACA,IAAA,GAA6B,EAAC,EACH;AAC3B,EAAA,MAAM,MAAA,GAAS,KAAK,MAAA,IAAU,WAAA;AAC9B,EAAA,MAAM,MAAA,GAAS,KAAK,MAAA,IAAU,SAAA;AAC9B,EAAA,MAAM,MAAA,GAAS,SAAA,CAAU,KAAA,EAAO,IAAA,CAAK,MAAM,CAAA;AAC3C,EAAA,MAAM,IAAA,uBAAW,GAAA,EAAsC;AACvD,EAAA,KAAA,MAAW,QAAQ,KAAA,CAAM,KAAA,EAAO,IAAA,CAAK,GAAA,CAAI,KAAK,EAAA,EAAI,EAAE,CAAA,EAAG,IAAA,CAAK,OAAO,CAAA,EAAG,CAAA,EAAG,IAAA,CAAK,MAAA,CAAO,GAAG,CAAA;AAExF,EAAA,OAAO,CAAC,EAAE,MAAA,EAAQ,KAAA,EAAM,KAAM;AAC5B,IAAA,MAAM,IAAI,IAAA,CAAK,GAAA,CAAA,CAAK,KAAA,GAAQ,CAAA,IAAK,QAAQ,CAAC,CAAA;AAC1C,IAAA,MAAM,CAAA,GAAI,OAAO,CAAC,CAAA;AAClB,IAAA,MAAM,MAAA,uBAAa,GAAA,EAAsC;AACzD,IAAA,KAAA,MAAW,CAAC,EAAA,EAAI,EAAE,CAAA,IAAK,MAAA,EAAQ;AAC7B,MAAA,IAAI,MAAA,CAAO,GAAA,CAAI,EAAY,CAAA,EAAG;AAC9B,MAAA,MAAM,KAAA,GAAQ,IAAA,CAAK,GAAA,CAAI,EAAE,CAAA;AACzB,MAAA,IAAI,UAAU,MAAA,EAAW;AACzB,MAAA,MAAA,CAAO,IAAI,EAAA,EAAI;AAAA,QACb,GAAG,KAAA,CAAM,CAAA,GAAA,CAAK,EAAA,CAAG,CAAA,GAAI,MAAM,CAAA,IAAK,CAAA;AAAA,QAChC,GAAG,KAAA,CAAM,CAAA,GAAA,CAAK,EAAA,CAAG,CAAA,GAAI,MAAM,CAAA,IAAK;AAAA,OACjC,CAAA;AAAA,IACH;AACA,IAAA,OAAO,EAAE,MAAA,EAAQ,IAAA,EAAM,CAAA,IAAK,CAAA,EAAE;AAAA,EAChC,CAAA;AACF;AA0CA,SAAS,QAAQ,KAAA,EAAsB;AACrC,EAAA,MAAM,KAAA,GAAQ,KAAA,CAAM,KAAA,CAAM,GAAA,CAAI,CAAC,CAAA,KAAM,CAAA,CAAE,EAAE,CAAA,CAAE,IAAA,EAAK,CAAE,IAAA,CAAK,GAAG,CAAA;AAC1D,EAAA,MAAM,QAAQ,KAAA,CAAM,KAAA,CAAM,GAAA,CAAI,CAAC,MAAM,CAAA,EAAG,CAAA,CAAE,IAAI,CAAA,CAAA,EAAI,EAAE,EAAE,CAAA,CAAE,EAAE,IAAA,EAAK,CAAE,KAAK,GAAG,CAAA;AACzE,EAAA,OAAO,CAAA,EAAG,KAAK,CAAA,CAAA,EAAI,KAAK,CAAA,CAAA;AAC1B;AASO,SAAS,cAAqB,IAAA,EAA+C;AAClF,EAAA,MAAM,OAAA,GAAU,OAAO,IAAI,CAAA;AAC3B,EAAA,OAAA,CAAQ,OAAA,GAAU,IAAA;AAElB,EAAA,MAAM,QAAA,GAAW,OAAyC,IAAI,CAAA;AAC9D,EAAA,MAAM,aAAA,GAAgB,OAAO,CAAC,CAAA;AAC9B,EAAA,MAAM,KAAA,GAAQ,OAAO,EAAE,CAAA;AAEvB,EAAA,MAAM,KAAA,GAAQ,YAAY,MAAY;AACpC,IAAA,MAAM,IAAI,OAAA,CAAQ,OAAA;AAClB,IAAA,MAAM,KAAA,GAAQ,UAAA,CAAW,CAAA,CAAE,MAAA,EAAQ;AAAA,MACjC,GAAI,EAAE,IAAA,GAAO,EAAE,MAAM,CAAA,CAAE,IAAA,KAAS,EAAC;AAAA,MACjC,GAAI,EAAE,QAAA,GAAW,EAAE,UAAU,CAAA,CAAE,QAAA,KAAa;AAAC,KAC9C,CAAA;AACD,IAAA,KAAA,CAAM,OAAA,GAAU,QAAQ,KAAK,CAAA;AAC7B,IAAA,aAAA,CAAc,OAAA,GAAU,CAAA;AACxB,IAAA,MAAM,SAAA,GAAY,EAAE,SAAA,IAAa,OAAA;AACjC,IAAA,IAAI,cAAc,OAAA,EAAS;AACzB,MAAA,QAAA,CAAS,OAAA,GAAU,cAAqB,KAAA,EAAO;AAAA,QAC7C,GAAG,CAAA,CAAE,MAAA;AAAA,QAAQ,GAAG,CAAA,CAAE,KAAA;AAAA,QAClB,GAAI,EAAE,QAAA,GAAW,EAAE,UAAU,CAAA,CAAE,QAAA,KAAa;AAAC,OAC9C,CAAA;AACD,MAAA;AAAA,IACF;AACA,IAAA,MAAM,KAAK,OAAO,SAAA,KAAc,aAAa,SAAA,GAAY,OAAA,CAAQ,SAAS,CAAA,IAAK,OAAA;AAC/E,IAAA,QAAA,CAAS,OAAA,GAAU,aAAA,CAAqB,KAAA,EAAO,EAAA,EAAI;AAAA,MACjD,GAAI,EAAE,MAAA,GAAS,EAAE,QAAQ,CAAA,CAAE,MAAA,KAAW,EAAC;AAAA,MACvC,GAAI,EAAE,MAAA,KAAW,MAAA,GAAY,EAAC,GAAI,EAAE,MAAA,EAAQ,CAAA,CAAE,MAAA,EAAO;AAAA,MACrD,GAAI,EAAE,MAAA,GAAS,EAAE,QAAQ,CAAA,CAAE,MAAA,KAAW;AAAC,KACxC,CAAA;AAAA,EACH,CAAA,EAAG,EAAE,CAAA;AAEL,EAAA,MAAM,IAAA,GAAO,WAAA,CAAY,CAAC,GAAA,KAA+C;AACvE,IAAA,MAAM,IAAI,OAAA,CAAQ,OAAA;AAClB,IAAA,IAAI,QAAA,CAAS,YAAY,IAAA,EAAM,OAAO,EAAE,KAAA,EAAO,EAAC,EAAG,IAAA,EAAM,IAAA,EAAK;AAC9D,IAAA,MAAM,EAAE,MAAA,EAAQ,IAAA,EAAK,GAAI,SAAS,OAAA,CAAQ;AAAA,MACxC,QAAQ,GAAA,CAAI,MAAA;AAAA,MACZ,OAAO,aAAA,CAAc,OAAA;AAAA,KACtB,CAAA;AAKD,IAAA,IAAI,MAAA,GAAS,MAAA;AACb,IAAA,IAAI,GAAA,CAAI,MAAA,CAAO,IAAA,GAAO,CAAA,EAAG;AACvB,MAAA,MAAM,IAAA,GAAO,IAAI,GAAA,CAAI,MAAM,CAAA;AAC3B,MAAA,KAAA,MAAW,MAAM,GAAA,CAAI,MAAA,CAAO,MAAK,EAAG,IAAA,CAAK,OAAO,EAAY,CAAA;AAC5D,MAAA,MAAA,GAAS,IAAA;AAAA,IACX;AACA,IAAA,MAAM,QAAQ,WAAA,CAAY,CAAA,CAAE,KAAA,EAAO,MAAA,EAAQ,EAAE,QAAQ,CAAA;AACrD,IAAA,OAAO,EAAE,KAAA,EAAO,CAAC,GAAG,KAAK,GAAwB,IAAA,EAAK;AAAA,EACxD,CAAA,EAAG,EAAE,CAAA;AAEL,EAAA,MAAM,MAAM,UAAA,CAAkB;AAAA,IAC5B,OAAO,IAAA,CAAK,KAAA;AAAA,IACZ,IAAA;AAAA,IACA,UAAU,CAAC,KAAA,KAAU,OAAA,CAAQ,OAAA,CAAQ,WAAW,KAAK,CAAA;AAAA,IACrD,GAAI,KAAK,KAAA,GAAQ,EAAE,OAAO,IAAA,CAAK,KAAA,KAAU,EAAC;AAAA,IAC1C,GAAI,KAAK,YAAA,GAAe,EAAE,cAAc,IAAA,CAAK,YAAA,KAAiB,EAAC;AAAA,IAC/D,GAAI,KAAK,WAAA,GAAc,EAAE,aAAa,IAAA,CAAK,WAAA,KAAgB;AAAC,GAC7D,CAAA;AAID,EAAA,SAAA,CAAU,MAAM;AACd,IAAA,IAAI,IAAA,CAAK,wBAAwB,KAAA,EAAO;AACxC,IAAA,OAAO,IAAA,CAAK,KAAA,CAAM,SAAA,CAAU,MAAM;AAChC,MAAA,IAAI,CAAC,GAAA,CAAI,SAAA,EAAU,EAAG;AACtB,MAAA,MAAM,IAAI,OAAA,CAAQ,OAAA;AAClB,MAAA,MAAM,KAAA,GAAQ,UAAA,CAAW,CAAA,CAAE,MAAA,EAAQ;AAAA,QACjC,GAAI,EAAE,IAAA,GAAO,EAAE,MAAM,CAAA,CAAE,IAAA,KAAS,EAAC;AAAA,QACjC,GAAI,EAAE,QAAA,GAAW,EAAE,UAAU,CAAA,CAAE,QAAA,KAAa;AAAC,OAC9C,CAAA;AACD,MAAA,IAAI,OAAA,CAAQ,KAAK,CAAA,KAAM,KAAA,CAAM,OAAA,EAAS;AACtC,MAAA,KAAA,EAAM;AAAA,IACR,CAAC,CAAA;AAAA,EACH,CAAA,EAAG,CAAC,IAAA,CAAK,KAAA,EAAO,KAAK,mBAAA,EAAqB,GAAA,EAAK,KAAK,CAAC,CAAA;AAErD,EAAA,OAAO,QAAoB,OAAO;AAAA,IAChC,KAAA,GAAQ;AACN,MAAA,IAAI,GAAA,CAAI,WAAU,EAAG;AACrB,MAAA,KAAA,EAAM;AACN,MAAA,GAAA,CAAI,KAAA,EAAM;AAAA,IACZ,CAAA;AAAA,IACA,MAAM,MAAM;AAAE,MAAA,GAAA,CAAI,IAAA,EAAK;AAAA,IAAG,CAAA;AAAA,IAC1B,QAAQ,MAAM;AAAE,MAAA,GAAA,CAAI,MAAA,EAAO;AAAA,IAAG,CAAA;AAAA,IAC9B,OAAA,GAAU;AACR,MAAA,GAAA,CAAI,MAAA,EAAO;AACX,MAAA,KAAA,EAAM;AACN,MAAA,GAAA,CAAI,KAAA,EAAM;AAAA,IACZ,CAAA;AAAA,IACA,SAAA,EAAW,MAAM,GAAA,CAAI,SAAA;AAAU,GACjC,CAAA,EAAI,CAAC,GAAA,EAAK,KAAK,CAAC,CAAA;AAClB;AAGO,IAAM,aAAA,GAAoD,OAAO,MAAA,CAAO;AAAA,EAC7E,OAAA;AAAA,EACA;AACF,CAAC;AC/QM,SAAS,YAAA,CACd,IAAA,GAAmC,EAAC,EACJ;AAChC,EAAA,MAAM,QAAA,GAAW,KAAK,QAAA,IAAa,oBAAA;AACnC,EAAA,MAAM,YAAY,CAAC,IAAA,KACjB,cAAc,IAAA,EAAM,IAAA,CAAK,IAAI,CAAA,EAAG,OAAA;AAElC,EAAA,OAAO;AAAA,IACL,EAAA,EAAI,KAAK,EAAA,IAAM,iBAAA;AAAA,IACf,OAAA,EAAS,CAAC,IAAA,KAAS,SAAA,CAAU,IAAI,CAAA,KAAM,MAAA;AAAA,IACvC,KAAA,EAAO,CAAC,IAAA,EAAM,IAAA,KAAS;AACrB,MAAA,MAAM,OAAA,GAAU,UAAU,IAAI,CAAA;AAC9B,MAAA,IAAI,OAAA,KAAY,MAAA,EAAW,OAAO,EAAC;AACnC,MAAA,MAAM,IAAI,IAAA,CAAK,IAAA;AACf,MAAA,MAAM,OAAO,CAAA,CAAE,IAAA,KAAS,MAAA,GAAY,IAAA,CAAK,cAAc,CAAA,CAAE,IAAA;AACzD,MAAA,MAAM,SAAS,CAAA,CAAE,MAAA,KAAW,MAAA,GAAY,IAAA,CAAK,gBAAgB,CAAA,CAAE,MAAA;AAC/D,MAAA,OAAO,CAAC;AAAA,QACN,IAAA,EAAM,MAAA;AAAA,QACN,MAAM,WAAA,CAAY,OAAA,EAAS,QAAA,CAAS,SAAA,CAAU,IAAI,CAAC,CAAA;AAAA,QACnD,GAAI,IAAA,GAAO,EAAE,IAAA,KAAS,EAAC;AAAA,QACvB,GAAI,MAAA,GAAS,EAAE,MAAA,KAAW;AAAC,OAC5B,CAAA;AAAA,IACH,CAAA;AAAA;AAAA;AAAA,IAGA,UAAA,EAAY,CAAC,IAAA,EAAM,IAAA,KAAS;AAC1B,MAAA,MAAM,OAAA,GAAU,UAAU,IAAI,CAAA;AAC9B,MAAA,OAAO,OAAA,KAAY,SAAY,IAAA,GAAO,WAAA,CAAY,SAAS,QAAA,CAAS,SAAA,CAAU,IAAI,CAAC,CAAA;AAAA,IACrF;AAAA,GACF;AACF;AAOO,SAAS,oBAAA,CAA4B,IAAA,GAAmC,EAAC,EAAe;AAC7F,EAAA,OAAO,kBAAkB,YAAA,CAAa,IAAI,GAAG,EAAE,QAAA,EAAU,QAAQ,CAAA;AACnE","file":"index.js","sourcesContent":["/*\n The shapes a built body can wear, as paths in the node's bounds.\n \n These are the flowchart vocabulary — a decision is a diamond, an I/O step a\n * parallelogram, a terminator a stadium — plus `'rect'` for everything else and\n * a `Path` escape hatch for a shape the vocabulary does not have. The path is\n * built in world coordinates from the bounds it is given, the same way the\n * kit's own `clipFromPose` factories are.\n /\nimport { PathBuilder, polygonFromPoints, rectPath, type Path } from '@weasel-js/core';\n\n/* An axis-aligned box, in the shape `PoseDescriptor.getBounds` returns. /\nexport interface Bounds {\n x: number;\n y: number;\n width: number;\n height: number;\n}\n\n/* A named flowchart shape, or a path a consumer built themselves. /\nexport type Outline = 'rect' \| 'diamond' \| 'stadium' \| 'parallelogram' \| Path;\n\n/* How far a parallelogram's top edge leans past its bottom one, as a\n * fraction of the box's width. The flowchart convention. /\nconst LEAN = 0.2;\n\n/* Cubic approximation of a quarter circle. A stadium's ends are two of these\n * each, which is the same construction `ellipsePath` uses. /\nconst KAPPA = 0.5522847498307936;\n\n/* The path `outline` describes inside `bounds`. A zero-area box gives a\n * zero-area rect rather than a degenerate polygon. /\nexport function outlinePath(outline: Outline, bounds: Bounds): Path {\n if (typeof outline !== 'string') return outline;\n const { x, y, width: w, height: h } = bounds;\n if (w <= 0 \|\| h <= 0) return rectPath(x, y, Math.max(w, 0), Math.max(h, 0));\n\n switch (outline) {\n case 'rect':\n return rectPath(x, y, w, h);\n\n case 'diamond':\n return polygonFromPoints([\n { x: x + w / 2, y },\n { x: x + w, y: y + h / 2 },\n { x: x + w / 2, y: y + h },\n { x, y: y + h / 2 },\n ]);\n\n case 'parallelogram': {\n // The lean is clamped so a narrow box cannot fold through itself.\n const lean = Math.min(w LEAN, w / 2);\n return polygonFromPoints([\n { x: x + lean, y },\n { x: x + w, y },\n { x: x + w - lean, y: y + h },\n { x, y: y + h },\n ]);\n }\n\n case 'stadium':\n return stadiumPath(x, y, w, h);\n }\n}\n\n/** A rect with semicircular ends — the Minkowski sum of a segment and a disc,\n * which puts the flat edges along the box's longer axis. A tall box is a\n * pill standing up, not an ellipse. /\nfunction stadiumPath(x: number, y: number, w: number, h: number): Path {\n const r = Math.min(w, h) / 2;\n const k = r KAPPA;\n const b = new PathBuilder();\n\n if (w >= h) {\n const left = x + r;\n const right = x + w - r;\n const top = y;\n const bottom = y + h;\n const midY = y + h / 2;\n return b\n .moveTo(left, top)\n .lineTo(right, top)\n .curveTo(right + k, top, x + w, midY - k, x + w, midY)\n .curveTo(x + w, midY + k, right + k, bottom, right, bottom)\n .lineTo(left, bottom)\n .curveTo(left - k, bottom, x, midY + k, x, midY)\n .curveTo(x, midY - k, left - k, top, left, top)\n .close()\n .build();\n }\n\n const top = y + r;\n const bottom = y + h - r;\n const left = x;\n const right = x + w;\n const midX = x + w / 2;\n return b\n .moveTo(right, top)\n .lineTo(right, bottom)\n .curveTo(right, bottom + k, midX + k, y + h, midX, y + h)\n .curveTo(midX - k, y + h, left, bottom + k, left, bottom)\n .lineTo(left, top)\n .curveTo(left, top - k, midX - k, y, midX, y)\n .curveTo(midX + k, y, right, top - k, right, top)\n .close()\n .build();\n}\n\n/*\n The largest axis-aligned box a shape's content can occupy without leaving\n * the shape. Rows lay out in here, not in the bounds — a diamond's corners and\n * a parallelogram's lean are outside its own box, and a label placed against\n * the bounding box lands there and gets clipped away by the silhouette.\n \n Conservative rather than exact: the inscribed rect of a rhombus is exact,\n * and a stadium reports the flat span between its rounded ends, which gives up\n * a little height near them.\n /\nexport function contentBox(outline: Outline, bounds: Bounds): Bounds {\n if (typeof outline !== 'string') return bounds;\n const { x, y, width: w, height: h } = bounds;\n switch (outline) {\n case 'rect':\n return bounds;\n case 'diamond':\n // Half the width and half the height, centered — the inscribed rect.\n return { x: x + w / 4, y: y + h / 4, width: w / 2, height: h / 2 };\n case 'parallelogram': {\n const lean = Math.min(w LEAN, w / 2);\n return { x: x + lean, y, width: Math.max(w - lean * 2, 0), height: h };\n }\n case 'stadium': {\n const r = Math.min(w, h) / 2;\n return w >= h\n ? { x: x + r, y, width: Math.max(w - r * 2, 0), height: h }\n : { x, y: y + r, width: w, height: Math.max(h - r * 2, 0) };\n }\n }\n}\n\n/*\n The box whose {@link contentBox} is at least `content` — the inverse, for\n * sizing a node to what its rows measured.\n \n The stadium case is the only inexact one: its inset depends on the height it\n * is solving for, so it assumes the wide orientation and adds one height's\n * worth of end caps.\n /\nexport function boxForContent(\n outline: Outline,\n content: { width: number; height: number },\n): { width: number; height: number } {\n if (typeof outline !== 'string') return content;\n switch (outline) {\n case 'rect':\n return content;\n case 'diamond':\n return { width: content.width 2, height: content.height * 2 };\n case 'parallelogram':\n return { width: content.width / (1 - LEAN * 2), height: content.height };\n case 'stadium':\n return { width: content.width + content.height, height: content.height };\n }\n}\n","/*\n Moving a port from the node's bounding box onto the shape it is drawn as.\n \n A port is placed as a fraction of the node's bounds, which is what makes it\n * survive a resize. For a rect that is already on the outline; for anything\n * else it can be well outside the ink — a parallelogram's west port floats in\n * the gap beside its leaning edge, and an edge that ends there ends in empty\n * space. So the point is cast back onto the outline along the ray from the\n * node's center, which is the direction an edge leaves anyway.\n /\nimport { PATH_C, PATH_L, PATH_M, PATH_Q, PATH_Z, flattenCubic, type Path } from '@weasel-js/core';\nimport { outlinePath, type Bounds, type Outline } from './outline';\nimport type { Port } from './types';\n\n/* Curve flattening tolerance, in world units. Finer than a port is wide. /\nconst TOLERANCE = 0.25;\n\n/* The outline as a closed polyline: `[x0, y0, x1, y1, …]`. /\nexport function outlinePolyline(outline: Outline, bounds: Bounds): number[] {\n const path = outlinePath(outline, bounds);\n return flattenPath(path);\n}\n\nfunction flattenPath(path: Path): number[] {\n if (path.kind === 'rect') {\n const { x, y, width: w, height: h } = path;\n return [x, y, x + w, y, x + w, y + h, x, y + h, x, y];\n }\n const out: number[] = [];\n const { commands, coords } = path as { commands: Uint8Array; coords: Float32Array };\n let ci = 0;\n let cx = 0;\n let cy = 0;\n let sx = 0;\n let sy = 0;\n for (const cmd of commands) {\n if (cmd === PATH_M) {\n cx = coords[ci]!; cy = coords[ci + 1]!; ci += 2;\n sx = cx; sy = cy;\n out.push(cx, cy);\n } else if (cmd === PATH_L) {\n cx = coords[ci]!; cy = coords[ci + 1]!; ci += 2;\n out.push(cx, cy);\n } else if (cmd === PATH_C) {\n const x1 = coords[ci]!, y1 = coords[ci + 1]!;\n const x2 = coords[ci + 2]!, y2 = coords[ci + 3]!;\n const x3 = coords[ci + 4]!, y3 = coords[ci + 5]!;\n ci += 6;\n flattenCubic(cx, cy, x1, y1, x2, y2, x3, y3, TOLERANCE, out);\n cx = x3; cy = y3;\n } else if (cmd === PATH_Q) {\n // Elevated to a cubic rather than given its own flattener.\n const qx = coords[ci]!, qy = coords[ci + 1]!;\n const x3 = coords[ci + 2]!, y3 = coords[ci + 3]!;\n ci += 4;\n flattenCubic(\n cx, cy,\n cx + (2 / 3) (qx - cx), cy + (2 / 3) * (qy - cy),\n x3 + (2 / 3) * (qx - x3), y3 + (2 / 3) * (qy - y3),\n x3, y3, TOLERANCE, out,\n );\n cx = x3; cy = y3;\n } else if (cmd === PATH_Z) {\n out.push(sx, sy);\n cx = sx; cy = sy;\n }\n }\n // Close it, so a ray leaving through the last edge still finds a crossing.\n if (out.length >= 2 && (out[0] !== out[out.length - 2] \|\| out[1] !== out[out.length - 1])) {\n out.push(out[0]!, out[1]!);\n }\n return out;\n}\n\n/*\n Where the ray from `center` through `point` last crosses `poly`, or `null`\n * when it never does.\n \n The last crossing rather than the first: a concave outline can be crossed\n * more than once, and the far side is the boundary an edge should attach to.\n /\nexport function rayHit(\n poly: readonly number[],\n center: { x: number; y: number },\n point: { x: number; y: number },\n): { x: number; y: number } \| null {\n const dx = point.x - center.x;\n const dy = point.y - center.y;\n if (dx === 0 && dy === 0) return null;\n let bestT = -Infinity;\n let hit: { x: number; y: number } \| null = null;\n for (let i = 0; i + 3 < poly.length; i += 2) {\n const ax = poly[i]!, ay = poly[i + 1]!;\n const bx = poly[i + 2]!, by = poly[i + 3]!;\n const ex = bx - ax;\n const ey = by - ay;\n const denom = dx ey - dy * ex;\n if (denom === 0) continue;\n // t along the ray, u along the segment.\n const t = ((ax - center.x) * ey - (ay - center.y) * ex) / denom;\n const u = ((ax - center.x) * dy - (ay - center.y) * dx) / denom;\n if (t < 0 \|\| u < 0 \|\| u > 1) continue;\n if (t > bestT) {\n bestT = t;\n hit = { x: center.x + dx * t, y: center.y + dy * t };\n }\n }\n return hit;\n}\n\n/*\n Every port moved onto `outline`. A port the ray misses — one at the node's\n * dead center, with no direction to cast along — is left where it was.\n /\nexport function portsOnOutline(\n ports: readonly Port[],\n outline: Outline,\n bounds: Bounds,\n): Port[] {\n if (bounds.width <= 0 \|\| bounds.height <= 0) return [...ports];\n const poly = outlinePolyline(outline, bounds);\n const center = { x: bounds.x + bounds.width / 2, y: bounds.y + bounds.height / 2 };\n return ports.map((port) => {\n const hit = rayHit(poly, center, port.point);\n return hit === null ? port : { ...port, point: hit };\n });\n}\n","/\n Reading the `DiagramNode` trait off a scene node.\n \n Two ways to attach it, both of which this module's default reader answers:\n \n - On the node. `data.diagram` holds the trait. One node, one answer;\n * what a connect gesture writes when the author drags a new edge.\n * - By kind. A consumer declares once which data shapes take part, and\n * every matching node gets the trait without being stamped. This mirrors\n * `createNodeRouting` in the kit — a predicate over `data`, first match\n * wins — and is the shape to reach for when the participants are a class\n * of node rather than a hand-picked set.\n \n A reader is a plain function, so a consumer whose data lives somewhere else\n * entirely passes their own and never touches either form.\n /\nimport type { DiagramNode } from './types';\n\n/* The key on a node's `data` the default reader looks under. /\nexport const DIAGRAM_TRAIT_KEY = 'diagram';\n\n/* All a reader looks at. Deliberately not `SceneNode`: naming `TPose` there\n * would put it in a contravariant position for no gain, since nothing here\n * reads a pose. /\nexport interface DiagramNodeLike {\n id: string;\n kind: 'leaf' \| 'container';\n data: unknown;\n}\n\n/* Answers \"is this node a diagram participant, and on what terms\" — `null`\n * for a node that takes no part. /\nexport type DiagramNodeReader = (node: DiagramNodeLike) => DiagramNode \| null;\n\n/* One class of participant, declared once for every node whose data matches.\n * Mirrors `NodeRoutingEntry`. /\nexport interface DiagramNodeEntry {\n /* Unique within a reader; the same vocabulary as `NodeRoutingEntry.name`. /\n name: string;\n matches: (data: unknown) => boolean;\n /* The trait every matching node carries. A function when it varies with the\n * node's own data — a pipeline stage whose ports come from its rows. /\n trait: DiagramNode \| ((data: unknown) => DiagramNode);\n}\n\n/* The trait on the node's own `data.diagram`, or `null`.\n \n An edge's trait lives under the same key, so `from` and `to` are what tells\n * the two apart. Without that test an edge reads as a participant declaring\n * no ports, and collects the four defaults on the degenerate pose an edge\n * carries — four grabbable ports in the middle of nowhere. /\nexport const dataKeyReader: DiagramNodeReader = (node) => {\n const data = node.data;\n if (data === null \|\| typeof data !== 'object') return null;\n const trait = (data as Record<string, unknown>)[DIAGRAM_TRAIT_KEY];\n if (trait === null \|\| typeof trait !== 'object') return null;\n if ('from' in trait && 'to' in trait) return null;\n return trait as DiagramNode;\n};\n\n/\n A reader over declared kinds. A trait on the node's own data still wins, so\n * a single node can opt out of, or override, whatever its kind says.\n \n Throws on a duplicate `name`, for the reason `mergeContributions` does: a\n * class of node silently losing its ports is what this registry exists to make\n * loud.\n /\nexport function createDiagramNodes(entries: readonly DiagramNodeEntry[]): DiagramNodeReader {\n const seen = new Set<string>();\n for (const entry of entries) {\n if (seen.has(entry.name)) {\n throw new Error(`createDiagramNodes: duplicate entry name \"${entry.name}\"`);\n }\n seen.add(entry.name);\n }\n return (node) => {\n const own = dataKeyReader(node);\n if (own !== null) return own;\n for (const entry of entries) {\n if (!entry.matches(node.data)) continue;\n return typeof entry.trait === 'function' ? entry.trait(node.data) : entry.trait;\n }\n return null;\n };\n}\n\n/* The trait `node` carries, through `read` (default: its own `data.diagram`). /\nexport function diagramNodeOf(\n node: DiagramNodeLike,\n read: DiagramNodeReader = dataKeyReader,\n): DiagramNode \| null {\n return read(node);\n}\n\n/* True when layout must leave this node where it is. /\nexport function isPinned(node: DiagramNodeLike, read?: DiagramNodeReader): boolean {\n return diagramNodeOf(node, read)?.pinned === true;\n}\n","/\n Where a node's ports are, in world coordinates.\n \n A port is placed in the node's unrotated bounds, then carried through\n * the pose's rotation — the same pivot every other kit reader uses, the AABB\n * center. Bounds come from the pose descriptor rather than from `pose.width`\n * and friends, so a node whose pose is a path, an ellipse or anything else a\n * consumer wired is connectable on the same terms as a rect.\n /\nimport {\n AUTO_POSE_DESCRIPTOR,\n rotatePoint,\n type PoseDescriptor,\n type Vec2,\n} from '@weasel-js/core';\nimport { outlinePolyline, rayHit } from './onOutline';\nimport { diagramNodeOf, type DiagramNodeLike, type DiagramNodeReader } from './trait';\nimport type { Port, PortAnchor, PortSpec } from './types';\n\n/* The eight anchors almost everything wants, named the way a compass is. /\nexport const COMPASS = {\n nw: { u: 0, v: 0 },\n n: { u: 0.5, v: 0 },\n ne: { u: 1, v: 0 },\n e: { u: 1, v: 0.5 },\n se: { u: 1, v: 1 },\n s: { u: 0.5, v: 1 },\n sw: { u: 0, v: 1 },\n w: { u: 0, v: 0.5 },\n} as const satisfies Record<string, PortAnchor>;\n\n/\n What a node carrying no `ports` gets: the four edge midpoints of its own\n * bounds. Every node has bounds, so every node is connectable without saying\n * anything.\n /\nexport const DEFAULT_PORTS: readonly PortSpec[] = Object.freeze([\n { id: 'n', at: COMPASS.n },\n { id: 'e', at: COMPASS.e },\n { id: 's', at: COMPASS.s },\n { id: 'w', at: COMPASS.w },\n]);\n\nexport interface PortsOptions<TPose> {\n /* Reads the AABB a port is placed in, and the node's rotation. Defaults to\n * the kit's `AUTO_POSE_DESCRIPTOR`, which handles rect and path poses. /\n geometry?: PoseDescriptor<TPose>;\n /* How the `DiagramNode` trait is read off a node. /\n read?: DiagramNodeReader;\n}\n\n/\n The direction the anchor implies: away from the center of the bounds.\n \n `(2u-1, 2v-1)` is the anchor in a box that runs -1..1, which is exactly that\n * direction — an edge midpoint gets the axis-aligned normal, a corner gets the\n * diagonal. It is deliberately not scaled by the node's aspect: this is a\n * heading a router leaves along, not a point on the outline. A port at the\n * dead center has no direction, and says so.\n /\nfunction normalOf(at: PortAnchor): Vec2 \| null {\n const x = at.u 2 - 1;\n const y = at.v * 2 - 1;\n const len = Math.hypot(x, y);\n if (len === 0) return null;\n return { x: x / len, y: y / len };\n}\n\n/*\n Every port on `node`, resolved against `pose`.\n \n Pass the pose the node is painted at — `effectivePose(scene, node)` —\n * not `node.pose`. A port that answers from the document pose while the node\n * is mid-drag puts an edge somewhere the user can see the node is not.\n /\nexport function portsOf<TPose>(\n node: DiagramNodeLike,\n pose: TPose,\n opts: PortsOptions<TPose> = {},\n): Port[] {\n const trait = diagramNodeOf(node, opts.read);\n if (trait === null) return [];\n const geometry = opts.geometry ?? (AUTO_POSE_DESCRIPTOR as PoseDescriptor<TPose>);\n const bounds = geometry.getBounds(pose);\n const rotation = geometry.getRotation?.(pose) ?? 0;\n const cx = bounds.x + bounds.width / 2;\n const cy = bounds.y + bounds.height / 2;\n // A port is anchored in the bounds so it survives a resize, but it has to\n // sit* on the shape: a parallelogram's west anchor is in the gap beside its\n // leaning edge, and an edge ending there ends in empty space. Flattened once\n // per call, not once per port.\n const poly = trait.outline === undefined \|\| bounds.width <= 0 \|\| bounds.height <= 0\n ? null\n : outlinePolyline(trait.outline, bounds);\n\n return (trait.ports ?? DEFAULT_PORTS).map((spec) => {\n const anchored: Vec2 = {\n x: bounds.x + spec.at.u * bounds.width,\n y: bounds.y + spec.at.v * bounds.height,\n };\n const flat = (poly === null ? null : rayHit(poly, { x: cx, y: cy }, anchored)) ?? anchored;\n const normal = spec.normal === undefined ? normalOf(spec.at) : spec.normal;\n if (rotation === 0) {\n return { id: spec.id, nodeId: node.id, point: flat, normal, ...typeOf(spec) };\n }\n return {\n id: spec.id,\n nodeId: node.id,\n point: rotatePoint(flat.x, flat.y, cx, cy, rotation),\n // A direction rotates about the origin, not about the node's center.\n normal: normal === null ? null : rotatePoint(normal.x, normal.y, 0, 0, rotation),\n ...typeOf(spec),\n };\n });\n}\n\n/** One named port, or `undefined` when the node has no such port. /\nexport function portOf<TPose>(\n node: DiagramNodeLike,\n pose: TPose,\n portId: string,\n opts: PortsOptions<TPose> = {},\n): Port \| undefined {\n return portsOf(node, pose, opts).find((p) => p.id === portId);\n}\n\n/* Spread rather than assigned, so a port with no type has no `type` key at\n * all — `exactOptionalPropertyTypes` rejects an explicit `undefined`. /\nfunction typeOf(spec: PortSpec): { type?: string } {\n return spec.type === undefined ? {} : { type: spec.type };\n}\n","/\n The optional body builder: what a node looks like when it should read as a\n * flowchart box or a visual-programming operator, rather than as whatever\n * scene node it already was.\n \n The body measures a floor; the author sets the rest. Rows measure to a\n * `{ minWidth, minHeight }` and the node's pose is the max of that and what\n * the author gave it. Adding a port row can grow a node; nothing here ever\n * shrinks one back. Because the pose stays authored data, resize, align,\n * distribute, guides, snapping and undo need no special case, and a node that\n * did not come from the builder just has whatever size it already had.\n \n Text measurement is a seam rather than an import: measuring needs a 2D\n * context, which a geometry module has no business owning. `canvasMeasure`\n * adapts the kit's own `measureText` for a caller that has one.\n /\nimport { boxForContent, contentBox, outlinePath, type Bounds, type Outline } from './outline';\nimport { COMPASS } from './ports';\nimport type { DiagramNode, PortSpec } from './types';\n\n/* One line of body content. /\nexport type Row =\n /* Text. `label` is the node's name; `field` is a named value. /\n \| { kind: 'label'; text: string; style?: RowTextStyle }\n \| { kind: 'field'; label: string; value: string; style?: RowTextStyle }\n /* A row that carries ports on its own left and right edges — the\n * visual-programming shape, where an operator's inputs line up with the\n * rows they feed. /\n \| { kind: 'ports'; left?: readonly RowPort[]; right?: readonly RowPort[]; height?: number }\n /* Reserved space a consumer paints into. /\n \| { kind: 'slot'; height: number; id?: string };\n\n/* A port declared on a row rather than on the node's perimeter. /\nexport interface RowPort {\n id: string;\n /* Label shown beside it, and what the row measures against. /\n label?: string;\n type?: string;\n}\n\n/* The subset of a text style the body measures against. Deliberately small:\n * a full `ResolvedTextStyle` belongs to whatever paints the row. /\nexport interface RowTextStyle {\n fontSize?: number;\n fontFamily?: string;\n bold?: boolean;\n}\n\n/* Measures one run of text. Returns its advance width and its line height. /\nexport type MeasureRowText = (text: string, style: RowTextStyle) => { width: number; height: number };\n\nexport interface BodySpec {\n outline: Outline;\n rows: readonly Row[];\n /* Space between the outline and its rows. Default 8. /\n padding?: number;\n /* Space between adjacent rows. Default 4. /\n gap?: number;\n}\n\n/* What {@link buildBody} emits: the `AddNodeSpec` fields it fills in. Named\n * structurally rather than imported so a consumer whose scene is typed\n * differently can still spread one. /\nexport interface BodyNodeSpec<TData, TLayer extends string, TPose> {\n kind: 'container' \| 'leaf';\n layer: TLayer;\n pose: TPose;\n data: TData;\n id?: string;\n parent?: string;\n /* Set `false` on every leaf the builder emits: the innermost hit wins, so a\n * row that answers a press is a body that cannot be dragged. /\n pickable?: boolean;\n}\n\n/* The floor a body's content puts under its node's size. /\nexport interface BodyFloor {\n minWidth: number;\n minHeight: number;\n}\n\n/* Where one row landed, in the same frame as the bounds it was laid out in.\n * A `ports` row's own ports anchor to this box. /\nexport interface RowBox extends Bounds {\n row: Row;\n index: number;\n}\n\n/* Where one row port's label sits, in the same frame as the row box it was\n * laid out in. Its vertical center is also where the port itself attaches, so\n * a label and the port it names cannot drift apart. /\nexport interface RowPortBox extends Bounds {\n port: RowPort;\n side: 'left' \| 'right';\n /* Position within its own side, top to bottom. /\n index: number;\n}\n\nconst DEFAULT_PADDING = 8;\nconst DEFAULT_GAP = 4;\n/* What a row is worth when nothing measures its text. Enough that a body\n * laid out headlessly is not zero-height — a zero-height body renders as an\n * empty page with every unit test still green. /\nconst FALLBACK_LINE = 16;\n\n/* Adapts the kit's `measureText` for a caller holding a 2D context. Pass the\n * same context the renderer measures with, or the floor will not match what\n * is painted. /\nexport function canvasMeasure(\n ctx: { measureText(text: string): { width: number } ; font: string },\n): MeasureRowText {\n return (text, style) => {\n const size = style.fontSize ?? FALLBACK_LINE;\n ctx.font = `${style.bold === true ? 'bold ' : ''}${size}px ${style.fontFamily ?? 'sans-serif'}`;\n return { width: ctx.measureText(text).width, height: Math.ceil(size 1.2) };\n };\n}\n\n/** What each row is worth on its own, before padding and gaps. /\nfunction measureRow(row: Row, measure: MeasureRowText \| undefined): { width: number; height: number } {\n const text = (s: string, style?: RowTextStyle): { width: number; height: number } =>\n measure === undefined\n ? { width: s.length (((style?.fontSize ?? FALLBACK_LINE) * 0.6)), height: FALLBACK_LINE }\n : measure(s, style ?? {});\n\n switch (row.kind) {\n case 'label':\n return text(row.text, row.style);\n case 'field': {\n // Label and value sit on one line with a gap between them.\n const l = text(row.label, row.style);\n const v = text(row.value, row.style);\n return { width: l.width + DEFAULT_GAP * 2 + v.width, height: Math.max(l.height, v.height) };\n }\n case 'ports': {\n const side = (ports: readonly RowPort[] \| undefined): number =>\n (ports ?? []).reduce((w, p) => Math.max(w, p.label === undefined ? 0 : text(p.label).width), 0);\n const rows = Math.max(row.left?.length ?? 0, row.right?.length ?? 0, 1);\n return {\n width: side(row.left) + DEFAULT_GAP * 2 + side(row.right),\n height: row.height ?? rows * FALLBACK_LINE,\n };\n }\n case 'slot':\n return { width: 0, height: row.height };\n }\n}\n\n/*\n The smallest box `spec`'s rows fit in. A node's pose is maxed against this,\n * never set to it.\n /\nexport function measureBody(spec: BodySpec, measure?: MeasureRowText): BodyFloor {\n const padding = spec.padding ?? DEFAULT_PADDING;\n const gap = spec.gap ?? DEFAULT_GAP;\n let width = 0;\n let height = 0;\n for (const [i, row] of spec.rows.entries()) {\n const m = measureRow(row, measure);\n width = Math.max(width, m.width);\n height += m.height + (i > 0 ? gap : 0);\n }\n // The rows fit the content* box; the node's own box has to be whatever\n // contains that, or a diamond's label lands outside the diamond.\n const box = boxForContent(spec.outline, {\n width: width + padding * 2,\n height: height + padding * 2,\n });\n return { minWidth: box.width, minHeight: box.height };\n}\n\n/*\n The authored size, grown to fit the body. Never shrinks: a row removed\n * leaves the node the size the author last saw it at, which is the only\n * behavior that survives a resize the author did on purpose.\n /\nexport function sizeToBody<TPose extends Bounds>(pose: TPose, floor: BodyFloor): TPose {\n const width = Math.max(pose.width, floor.minWidth);\n const height = Math.max(pose.height, floor.minHeight);\n if (width === pose.width && height === pose.height) return pose;\n return { ...pose, width, height };\n}\n\n/* Where each row sits inside `bounds`, top to bottom. Rows keep their\n * measured heights; the leftover goes unclaimed at the bottom rather than\n * being distributed, so a row does not move when a sibling grows. /\nexport function layoutBody(\n spec: BodySpec,\n bounds: Bounds,\n measure?: MeasureRowText,\n): RowBox[] {\n const padding = spec.padding ?? DEFAULT_PADDING;\n const gap = spec.gap ?? DEFAULT_GAP;\n const inner = contentBox(spec.outline, bounds);\n const width = Math.max(inner.width - padding 2, 0);\n let y = inner.y + padding;\n return spec.rows.map((row, index) => {\n const h = measureRow(row, measure).height;\n const box: RowBox = { row, index, x: inner.x + padding, y, width, height: h };\n y += h + gap;\n return box;\n });\n}\n\n/*\n Where each of a `ports` row's ports goes inside `box`, on the same terms\n * `layoutBody` gives one box per row.\n \n Both sides are cut into the same number of slots — the longer side's count —\n * so the nth input faces the nth output whichever side has more. A label box\n * is as wide as its own text and pinned to its own edge of the row; an\n * unlabeled port gets a zero-width box there, which is still where it attaches.\n /\nexport function layoutRowPorts(\n row: Extract<Row, { kind: 'ports' }>,\n box: Bounds,\n measure?: MeasureRowText,\n): RowPortBox[] {\n const width = (label: string \| undefined): number =>\n label === undefined ? 0 : measureRow({ kind: 'label', text: label }, measure).width;\n const slots = Math.max(row.left?.length ?? 0, row.right?.length ?? 0, 1);\n const slotHeight = box.height / slots;\n const out: RowPortBox[] = [];\n const side = (ports: readonly RowPort[] \| undefined, which: 'left' \| 'right'): void => {\n for (const [index, port] of (ports ?? []).entries()) {\n const w = width(port.label);\n out.push({\n port,\n side: which,\n index,\n x: which === 'left' ? box.x : box.x + box.width - w,\n y: box.y + index slotHeight,\n width: w,\n height: slotHeight,\n });\n }\n };\n side(row.left, 'left');\n side(row.right, 'right');\n return out;\n}\n\n/*\n The `DiagramNode` trait a built body implies: perimeter ports for the\n * outline, plus one port per `ports`-row entry, anchored to that row's own\n * left or right edge.\n \n Anchors are normalized against `bounds`, so they survive the node being\n * resized — which is the whole reason `PortAnchor` is normalized.\n \n A row port on a side takes that side's compass default with it. Both sit\n * on the same edge, and a row near the vertical middle puts one exactly on top\n * of `w` or `e` — where the later region wins the hit and the other is\n * grabbable nowhere. A body that declares where its inputs attach has said what\n * that side is for.\n /\nexport function bodyTrait(spec: BodySpec, bounds: Bounds, measure?: MeasureRowText): DiagramNode {\n const outline = spec.outline;\n const compass: PortSpec[] = [\n { id: 'n', at: COMPASS.n },\n { id: 'e', at: COMPASS.e },\n { id: 's', at: COMPASS.s },\n { id: 'w', at: COMPASS.w },\n ];\n if (bounds.height <= 0) return { outline, ports: compass };\n\n const rowPorts: PortSpec[] = [];\n let hasLeft = false;\n let hasRight = false;\n for (const box of layoutBody(spec, bounds, measure)) {\n if (box.row.kind !== 'ports') continue;\n for (const pb of layoutRowPorts(box.row, box, measure)) {\n if (pb.side === 'left') hasLeft = true;\n else hasRight = true;\n const v = (pb.y + pb.height / 2 - bounds.y) / bounds.height;\n rowPorts.push(withType(\n { id: pb.port.id, at: { u: pb.side === 'left' ? 0 : 1, v } },\n pb.port.type,\n ));\n }\n }\n const kept = compass.filter((p) =>\n !(p.id === 'w' && hasLeft) && !(p.id === 'e' && hasRight));\n return { outline, ports: [...kept, ...rowPorts] };\n}\n\nfunction withType(spec: PortSpec, type: string \| undefined): PortSpec {\n return type === undefined ? spec : { ...spec, type };\n}\n\n/* The outline path for a built body at `bounds` — what paints it, and what a\n * perimeter-hugging port will eventually be placed on. /\nexport function bodyOutline(spec: BodySpec, bounds: Bounds) {\n return outlinePath(spec.outline, bounds);\n}\n\n/* What a built body's rows are handed to, one call per row.\n \n `text` is the row's content already formatted — a `label`'s own text, or a\n * `field`'s `\"label: value\"` — so the common case needs no discrimination.\n * Return `null` for a row the consumer paints itself; `ports` and `slot` rows\n * arrive with `text` empty and are the usual ones to decline. /\nexport type RowNodeData<TData> = (text: string, box: RowBox) => TData \| null;\n\nexport interface BuildBodyOptions<TData, TLayer extends string, TPose extends Bounds> {\n layer: TLayer;\n /* The container's id. Edges name it, so pass one for anything an edge or a\n * layout `pin` will refer to. /\n id?: string;\n measure?: MeasureRowText;\n /* The container's own data, given the trait the builder computed and the\n * pose it was computed against. /\n body: (trait: DiagramNode, pose: TPose) => TData;\n /* One row's data, or `null` to leave that row undrawn. /\n row: RowNodeData<TData>;\n /* One row port's label, or `null` to leave it undrawn. Ports with no\n * `label` are never offered. Omit to draw none — a body whose ports are\n * named only for the width they claim needs nothing here. /\n portLabel?: (text: string, box: RowPortBox) => TData \| null;\n}\n\n/\n The scene nodes a built body is: one container carrying the trait, and one\n * leaf per row that wants drawing.\n \n Rows are ordinary scene nodes rather than something this package paints, so\n * the kit's own text painter draws them and text editing, styling and\n * selection work on them unchanged. The walk that places them is\n * `layoutBody` — the same one `bodyTrait` anchors its row ports against, which\n * is why a label and its ports cannot drift apart.\n \n The pose is `sizeToBody(at, measureBody(spec))`: the body measures a floor\n * and the authored size is grown to clear it, never shrunk.\n /\nexport function buildBody<TData, TLayer extends string, TPose extends Bounds>(\n spec: BodySpec,\n at: TPose,\n opts: BuildBodyOptions<TData, TLayer, TPose>,\n): { pose: TPose; specs: BodyNodeSpec<TData, TLayer, TPose>[] } {\n const pose = sizeToBody(at, measureBody(spec, opts.measure));\n const specs: BodyNodeSpec<TData, TLayer, TPose>[] = [{\n kind: 'container',\n layer: opts.layer,\n pose,\n data: opts.body(bodyTrait(spec, pose, opts.measure), pose),\n ...(opts.id === undefined ? {} : { id: opts.id }),\n }];\n\n const leaf = (box: Bounds, data: TData): void => {\n specs.push({\n kind: 'leaf',\n layer: opts.layer,\n pose: { ...pose, x: box.x, y: box.y, width: box.width, height: box.height },\n data,\n pickable: false,\n ...(opts.id === undefined ? {} : { parent: opts.id }),\n });\n };\n\n const portLabel = opts.portLabel;\n for (const box of layoutBody(spec, pose, opts.measure)) {\n const data = opts.row(rowText(box.row), box);\n if (data !== null) leaf(box, data);\n if (portLabel === undefined \|\| box.row.kind !== 'ports') continue;\n for (const pb of layoutRowPorts(box.row, box, opts.measure)) {\n if (pb.port.label === undefined) continue;\n const labelData = portLabel(pb.port.label, pb);\n if (labelData !== null) leaf(pb, labelData);\n }\n }\n return { pose, specs };\n}\n\n/* A row's content as one string: empty for a row that carries no text. /\nfunction rowText(row: Row): string {\n if (row.kind === 'label') return row.text;\n if (row.kind === 'field') return `${row.label}: ${row.value}`;\n return '';\n}\n","/\n A label on an edge: an ordinary leaf node that derives its pose from the\n * route it sits on.\n \n It reads the edge's resolved path off its dependency rather than routing\n * again, so the label and the arrowhead can never disagree about where the\n * edge went. Everything else about it is a normal scene node — its own size,\n * data, styling, z-order and selection.\n /\nimport {\n AUTO_POSE_DESCRIPTOR,\n pointAlongPath,\n translatePoseViaDescriptor,\n type DerivedDep,\n type PoseDescriptor,\n} from '@weasel-js/core';\n\n/* Where along an edge a label sits. /\nexport interface DiagramLabel {\n /* `'start'`, `'mid'` and `'end'` are 0, 0.5 and 1; a number is that\n * fraction of the route's length. /\n at: 'start' \| 'mid' \| 'end' \| number;\n /* World units perpendicular to the route, to the *left of the direction of\n travel** — above a left-to-right edge. Default 0, which centers the label\n * on the line. /\n offset?: number;\n}\n\nconst NAMED = { start: 0, mid: 0.5, end: 1 } as const;\n\n/* The label trait on a node's data, or `null`. /\nexport function diagramLabelOf(node: { data: unknown }): DiagramLabel \| null {\n const data = node.data;\n if (data === null \|\| typeof data !== 'object') return null;\n const trait = (data as { diagram?: unknown }).diagram;\n if (trait === null \|\| typeof trait !== 'object') return null;\n const label = (trait as { label?: unknown }).label;\n if (label === null \|\| typeof label !== 'object') return null;\n return 'at' in label ? (label as DiagramLabel) : null;\n}\n\nexport interface LabelPoseOptions<TPose> {\n geometry?: PoseDescriptor<TPose>;\n}\n\n/\n A `derivePose` that stations a label along its dependency's path.\n \n Returns `null` — nothing derived, so the node keeps its authored pose —\n * when the node carries no label trait, when the dependency is gone, or when\n * the dependency derives no path. A label that snapped to the origin because\n * its edge was deleted is worse than one that stayed where the author left it.\n /\nexport function labelDerivePose<TPose>(\n opts: LabelPoseOptions<TPose> = {},\n): (node: { pose: TPose; data: unknown }, deps: readonly (DerivedDep<TPose> \| undefined)[]) => TPose \| null {\n const geometry = opts.geometry ?? (AUTO_POSE_DESCRIPTOR as PoseDescriptor<TPose>);\n\n return (node, deps) => {\n const label = diagramLabelOf(node);\n if (label === null) return null;\n const path = deps[0]?.path ?? null;\n if (path === null) return null;\n\n const t = typeof label.at === 'number' ? label.at : NAMED[label.at] ?? 0.5;\n const station = pointAlongPath(path, t);\n if (station === null) return null;\n\n const offset = label.offset ?? 0;\n // Left of travel: with y down, that is above an edge running rightward.\n const x = station.point.x + station.tangent.y offset;\n const y = station.point.y - station.tangent.x * offset;\n\n const bounds = geometry.getBounds(node.pose);\n return translatePoseViaDescriptor(\n node.pose,\n x - (bounds.x + bounds.width / 2),\n y - (bounds.y + bounds.height / 2),\n geometry,\n );\n };\n}\n\n/** Registry key for {@link LABEL_DERIVE_POSE}. /\nexport const DIAGRAM_LABEL = 'diagram:label';\n\n/* The default label derivation, as one stable function reference so `toJSON`\n * can find its key. /\nexport const LABEL_DERIVE_POSE = labelDerivePose<unknown>();\n","/\n `DiagramEdge` — a connection between two participants.\n \n An edge is an ordinary leaf scene node with `dependsOn: [from, to]` and a\n * `derivePath` that runs a router. Making it a scene node rather than a\n * plugin-owned render layer is the load-bearing choice: it buys selection,\n * hit-testing, hover, styling, z-order, SVG export, undo and copy/paste\n * without implementing any of them. The cost is that an edge costs what a node\n * costs — right for diagrams of tens to hundreds of edges, wrong for a\n * 10k-edge force graph, which keeps its render layer.\n \n *Author-dragged waypoints are data on the edge and the router routes\n through them.** Manual control never authors the path; it authors\n * constraints on the path. That is what keeps derived geometry and hand-tuning\n * compatible — a moved endpoint still re-routes, through the waypoints the\n * author put there.\n \n Arrowheads are not here. They are stroke markers, the same\n * `markerStart` / `markerEnd` any other stroke carries.\n /\nimport {\n AUTO_POSE_DESCRIPTOR,\n polylineFromPoints,\n type DerivedDep,\n type Path,\n type PoseDescriptor,\n type SceneRegistry,\n type Vec2,\n} from '@weasel-js/core';\nimport { DIAGRAM_LABEL, LABEL_DERIVE_POSE } from './label';\nimport { portOf, portsOf, type PortsOptions } from './ports';\nimport type { Port } from './types';\n\n/* Where an edge attaches at one end. /\nexport interface EdgeEnd {\n /* The port to leave from, when the endpoint declares one. Falls back to\n * the nearest port, so an edge drawn before ports were thought about still\n * meets the shape. /\n port?: string;\n}\n\n/* The trait on an edge's `data`, under the same key participants use. /\nexport interface DiagramEdge {\n from: EdgeEnd;\n to: EdgeEnd;\n /* Registry key for the router. Resolved by whoever builds the edge's\n * `derivePath`; unknown keys fall back to `straight`. /\n router?: string;\n /* Points in world coordinates the route must pass through, in order. The\n * author owns these; the router owns everything between them. /\n waypoints?: readonly Vec2[];\n}\n\n/* What a router is given: the two resolved ends, and the author's waypoints\n * between them. /\nexport interface RouteRequest {\n from: Port;\n to: Port;\n waypoints: readonly Vec2[];\n}\n\n/* A router returns the points the edge runs through, `from.point` first and\n * `to.point` last. Turning those into a `Path` is `edgePath`'s job, so a\n * router never has to know about path encodings. /\nexport type Router = (req: RouteRequest) => readonly Vec2[];\n\n/* The straight run between the two ends, through any waypoints. /\nexport const straight: Router = (req) => [req.from.point, ...req.waypoints, req.to.point];\n\n/\n An axis-aligned route: leave along the departing end's normal and arrive\n * against the receiving one's.\n \n A leg is one elbow where the two ends face different axes and two where they\n * face the same one, turning at the midpoint of the axis they share. Arriving\n * along the port's own facing is what makes the arrowhead point into the\n * shape — a route that lands on a west-facing port from above puts its marker\n * across the corner, which reads as aimed at nothing.\n /\nexport const orthogonal: Router = (req) => {\n const stops = [req.from.point, ...req.waypoints, req.to.point];\n const out: Vec2[] = [stops[0]!];\n for (let i = 1; i < stops.length; i++) {\n const a = out[out.length - 1]!;\n const b = stops[i]!;\n if (a.x === b.x \|\| a.y === b.y) {\n out.push(b);\n continue;\n }\n // Only the first leg has a port to leave along; later legs follow the\n // one before them so the route does not alternate for no reason.\n const leaveHorizontal = i === 1\n ? isHorizontal(req.from.normal)\n : out.length > 1 && out[out.length - 2]!.y === a.y;\n // Likewise only the last leg has a port to arrive against. Without a\n // facing there is nothing to satisfy, so it keeps the single elbow.\n const arriving = i === stops.length - 1 ? req.to.normal : null;\n const arriveHorizontal = arriving == null ? !leaveHorizontal : isHorizontal(arriving);\n if (leaveHorizontal !== arriveHorizontal) {\n out.push(leaveHorizontal ? { x: b.x, y: a.y } : { x: a.x, y: b.y });\n out.push(b);\n continue;\n }\n if (leaveHorizontal) {\n const mid = (a.x + b.x) / 2;\n out.push({ x: mid, y: a.y }, { x: mid, y: b.y }, b);\n } else {\n const mid = (a.y + b.y) / 2;\n out.push({ x: a.x, y: mid }, { x: b.x, y: mid }, b);\n }\n }\n return out;\n};\n\n/* Which axis a port faces. A port with no facing counts as horizontal, which\n * is the leave-rightward default the router has always taken. /\nfunction isHorizontal(normal: Vec2 \| null \| undefined): boolean {\n return Math.abs(normal?.x ?? 1) >= Math.abs(normal?.y ?? 0);\n}\n\n/* How far a bezier reaches along each end's normal, as a fraction of the\n * straight-line distance between the two points it joins. /\nconst BEZIER_REACH = 0.4;\n\n/\n A smooth route, sampled into points.\n \n Each leg is a cubic that leaves along the departing end's normal and arrives\n * against the receiving one's, which is what makes a bezier edge read as\n * plugged into its port rather than aimed at it. Sampled rather than emitted\n * as curve commands so every router returns the same thing; `edgePath` is free\n * to emit curves later without changing the contract.\n /\nexport const bezier: Router = (req) => {\n const stops = [req.from.point, ...req.waypoints, req.to.point];\n const out: Vec2[] = [stops[0]!];\n for (let i = 1; i < stops.length; i++) {\n const a = stops[i - 1]!;\n const b = stops[i]!;\n const reach = Math.hypot(b.x - a.x, b.y - a.y) BEZIER_REACH;\n const outN = i === 1 ? req.from.normal : null;\n const inN = i === stops.length - 1 ? req.to.normal : null;\n const c1 = outN === null \|\| outN === undefined\n ? { x: a.x + (b.x - a.x) * BEZIER_REACH, y: a.y + (b.y - a.y) * BEZIER_REACH }\n : { x: a.x + outN.x * reach, y: a.y + outN.y * reach };\n const c2 = inN === null \|\| inN === undefined\n ? { x: b.x - (b.x - a.x) * BEZIER_REACH, y: b.y - (b.y - a.y) * BEZIER_REACH }\n : { x: b.x + inN.x * reach, y: b.y + inN.y * reach };\n for (let s = 1; s <= BEZIER_SAMPLES; s++) {\n out.push(cubicAt(a, c1, c2, b, s / BEZIER_SAMPLES));\n }\n }\n return out;\n};\n\nconst BEZIER_SAMPLES = 16;\n\nfunction cubicAt(p0: Vec2, p1: Vec2, p2: Vec2, p3: Vec2, t: number): Vec2 {\n const u = 1 - t;\n const a = u * u * u;\n const b = 3 * u * u * t;\n const c = 3 * u * t * t;\n const d = t * t * t;\n return {\n x: a * p0.x + b * p1.x + c * p2.x + d * p3.x,\n y: a * p0.y + b * p1.y + c * p2.y + d * p3.y,\n };\n}\n\n/** The routers this package ships. A consumer's own go in the same shape. /\nexport const ROUTERS: Readonly<Record<string, Router>> = Object.freeze({\n straight,\n orthogonal,\n bezier,\n});\n\n/* The edge trait on a node's data, or `null`. /\nexport function diagramEdgeOf(node: { data: unknown }): DiagramEdge \| null {\n const data = node.data;\n if (data === null \|\| typeof data !== 'object') return null;\n const edge = (data as { diagram?: unknown }).diagram;\n if (edge === null \|\| typeof edge !== 'object') return null;\n return 'from' in edge && 'to' in edge ? (edge as DiagramEdge) : null;\n}\n\n/\n The port an end resolves to: the one it named, else the port facing the\n * other end most directly.\n \n \"Facing\" rather than \"nearest\": a port on the far side of a wide node can be\n * closer in a straight line than the one pointing at the target, and an edge\n * that leaves through its own node reads as a bug however short it is.\n /\nexport function resolveEnd<TPose>(\n end: EdgeEnd,\n dep: DerivedDep<TPose>,\n toward: Vec2,\n opts: PortsOptions<TPose>,\n allPorts: (d: DerivedDep<TPose>) => Port[],\n): Port \| undefined {\n if (end.port !== undefined) {\n const named = portOf(dep.node as never, dep.pose, end.port, opts);\n if (named !== undefined) return named;\n }\n let best: Port \| undefined;\n let bestScore = -Infinity;\n for (const port of allPorts(dep)) {\n const dx = toward.x - port.point.x;\n const dy = toward.y - port.point.y;\n const len = Math.hypot(dx, dy) \|\| 1;\n // Alignment with the port's own facing, tie-broken toward the closer port.\n const facing = port.normal === null\n ? 0\n : (port.normal.x dx + port.normal.y * dy) / len;\n const score = facing - len / 1e6;\n if (score > bestScore) {\n bestScore = score;\n best = port;\n }\n }\n return best;\n}\n\nexport interface EdgeRouteOptions<TPose> extends PortsOptions<TPose> {\n /** Routers by key. Defaults to {@link ROUTERS}. /\n routers?: Readonly<Record<string, Router>>;\n}\n\n/\n A `derivePath` that routes an edge between its two dependencies.\n \n Returns `null` — nothing to draw — when the node is not an edge, when either\n * dependency is gone, or when an endpoint offers no ports at all. A dangling\n * edge painting a line to the origin is worse than a dangling edge painting\n * nothing.\n /\nexport function edgeDerivePath<TPose>(\n opts: EdgeRouteOptions<TPose> = {},\n): (node: { data: unknown }, deps: readonly (DerivedDep<TPose> \| undefined)[]) => Path \| null {\n const geometry = opts.geometry ?? (AUTO_POSE_DESCRIPTOR as PoseDescriptor<TPose>);\n const portOpts: PortsOptions<TPose> = { geometry, ...(opts.read ? { read: opts.read } : {}) };\n const allPorts = (d: DerivedDep<TPose>): Port[] =>\n portsOf(d.node as never, d.pose, portOpts);\n const centerOf = (d: DerivedDep<TPose>): Vec2 => {\n const b = geometry.getBounds(d.pose);\n return { x: b.x + b.width / 2, y: b.y + b.height / 2 };\n };\n\n return (node, deps) => {\n const edge = diagramEdgeOf(node);\n if (edge === null) return null;\n const [fromDep, toDep] = deps;\n if (fromDep === undefined \|\| toDep === undefined) return null;\n\n // Each end aims at the other's center, which is stable while both are\n // being resolved — aiming at the other port* would be circular.\n const from = resolveEnd(edge.from, fromDep, centerOf(toDep), portOpts, allPorts);\n const to = resolveEnd(edge.to, toDep, centerOf(fromDep), portOpts, allPorts);\n if (from === undefined \|\| to === undefined) return null;\n\n const routers = opts.routers ?? ROUTERS;\n const router = (edge.router !== undefined && routers[edge.router]) \|\| straight;\n const points = router({ from, to, waypoints: edge.waypoints ?? [] });\n return points.length < 2 ? null : polylineFromPoints(points as { x: number; y: number }[]);\n };\n}\n\n/** Registry key for {@link EDGE_DERIVE_PATH}. /\nexport const DIAGRAM_EDGE = 'diagram:edge';\n\n/* The default edge router, as one stable function reference so `toJSON` can\n * find its key. A consumer wanting different options registers their own\n * `edgeDerivePath(...)` under a key of their choosing. /\nexport const EDGE_DERIVE_PATH = edgeDerivePath<unknown>();\n\n/* Merge this package's registry entries under a consumer's, so an edge\n * round-trips through `toJSON` without the consumer wiring the key. /\nexport function withDiagramRegistry<TPose>(\n registry: SceneRegistry<TPose> = {},\n): SceneRegistry<TPose> {\n return {\n ...registry,\n derivePath: {\n [DIAGRAM_EDGE]: EDGE_DERIVE_PATH as NonNullable<SceneRegistry<TPose>['derivePath']>[string],\n ...registry.derivePath,\n },\n derivePose: {\n [DIAGRAM_LABEL]: LABEL_DERIVE_POSE as NonNullable<SceneRegistry<TPose>['derivePose']>[string],\n ...registry.derivePose,\n },\n };\n}\n","/\n Ports as affordances — what makes a painted port a grabbable one.\n \n A port is declared as an `AffordanceRegion`, so the kit's own region walk\n * supplies the hit-test, the screen-pixel hit radius, the cursor and the\n * exclusive claim that keeps a port drag out of the select tool's hands. That\n * is the \"visible chrome is always hittable\" rule doing the work: the walk runs\n * on every pointerdown before any tool sees the event, so a port answers\n * whatever tool happens to be active.\n \n Two things about this are easy to get wrong, and both fail silently.\n \n `targetId` is `null`. The framework composes a target's rotation about\n * its bounds center for any region naming one, and `portsOf` has already\n * rotated the port. Naming the participant here would rotate it twice.\n \n `hitKind` is not set. On the registered-layer route the discriminator is\n * the layer's own id — `<SceneCanvas>` stamps the hit `layer:<RenderLayer.id>`\n * and carries `initialScratch` through as `payload`. A `hitKind` declared here\n * would be dropped, and a binding written against it would never match.\n /\nimport type {\n Affordance,\n AffordanceRegion,\n ChromeState,\n CursorSpec,\n FillStyle,\n PoseDescriptor,\n Stroke,\n} from '@weasel-js/core';\nimport { portsOf } from './ports';\nimport type { DiagramNodeLike, DiagramNodeReader } from './trait';\nimport type { Port } from './types';\n\n/* The layer id this package composes its port regions into. /\nexport const PORT_LAYER_ID = 'diagram-ports';\n\n/* The affordance kind a press on a port reports — what a binding's\n * `target: 'affordance:...'` has to name. `<SceneCanvas>` builds it from\n * {@link PORT_LAYER_ID}, so the two cannot drift. /\nexport const PORT_AFFORDANCE_KIND = `layer:${PORT_LAYER_ID}` as const;\n\n/* A participant and the pose it is painted at. `effectivePose`, not\n * `node.pose` — a port that answers from the document pose while its node is\n * mid-drag sits somewhere the user can see the node is not. /\nexport interface ParticipantPose<TPose> {\n node: DiagramNodeLike;\n pose: TPose;\n}\n\n/* Where the affordance gets its participants. A thunk rather than a scene so\n * the geometry is testable without one, and so a consumer whose participants\n * come from somewhere else needs no adapter. /\nexport type ParticipantSource<TPose> = () => Iterable<ParticipantPose<TPose>>;\n\n/* What a press on a port hands the action that picks up the drag. Arrives as\n * `InvocationCtx.drag.affordance.payload`. /\nexport interface PortScratch {\n /* `CommonAffordanceScratch.targetId` — becomes `AffordanceHit.targetIds`. /\n targetId: string;\n nodeId: string;\n portId: string;\n /* The port resolved at press time: where it was and which way it faces. /\n port: Port;\n}\n\nexport interface PortAffordanceOptions<TPose> {\n /* Also the chrome-caps visibility id. Default {@link PORT_LAYER_ID}. /\n id?: string;\n read?: DiagramNodeReader;\n geometry?: PoseDescriptor<TPose>;\n /* Which participants show their ports. Default: all of them. Gate on\n * selection or hover by reading `state`. /\n shows?: (node: DiagramNodeLike, state: ChromeState) => boolean;\n /* Screen-pixel hit radius. Default 8, the kit's `HANDLE_BASE_PX`. /\n hitRadiusPx?: number;\n /* Screen-pixel side of the painted square. Default 7. Omit `paint` entirely\n * by passing 0 — a port the consumer draws itself is still hittable. /\n sizePx?: number;\n fill?: FillStyle;\n stroke?: Stroke;\n cursor?: CursorSpec;\n /* Default `'exclusive'` on pointer gestures: a drag from a port is a\n * connect, never a move of the node underneath it. /\n strength?: 'exclusive' \| 'shared';\n}\n\nconst DEFAULT_HIT_PX = 8;\nconst DEFAULT_SIZE_PX = 7;\n\n/* Read a port press's scratch back off the hit an action was handed. /\nexport function portScratchOf(hit: { payload?: unknown } \| null \| undefined): PortScratch \| null {\n const payload = hit?.payload as PortScratch \| undefined;\n return payload !== undefined && typeof payload.portId === 'string' ? payload : null;\n}\n\n/\n The affordance. Compose it into a layer with `composeAffordanceLayer` and\n * attach that with `CanvasExtensionApi.registerLayer` — the only attach route\n * that is hit-tested. A `Contribution.overlay` is painted and never hit.\n /\nexport function createPortAffordance<TPose>(\n participants: ParticipantSource<TPose>,\n opts: PortAffordanceOptions<TPose> = {},\n): Affordance {\n const {\n id = PORT_LAYER_ID,\n hitRadiusPx = DEFAULT_HIT_PX,\n sizePx = DEFAULT_SIZE_PX,\n strength = 'exclusive',\n } = opts;\n const portOpts = {\n ...(opts.geometry ? { geometry: opts.geometry } : {}),\n ...(opts.read ? { read: opts.read } : {}),\n };\n const paint = sizePx <= 0\n ? undefined\n : {\n kind: 'square' as const,\n sizePx,\n ...(opts.fill ? { fill: opts.fill } : {}),\n ...(opts.stroke ? { stroke: opts.stroke } : {}),\n };\n\n return {\n id,\n regions(state: ChromeState): readonly AffordanceRegion[] {\n const out: AffordanceRegion[] = [];\n for (const { node, pose } of participants()) {\n if (opts.shows !== undefined && !opts.shows(node, state)) continue;\n for (const port of portsOf(node, pose, portOpts)) {\n out.push({\n id: `${node.id}:${port.id}`,\n targetId: null,\n shape: { kind: 'point', x: port.point.x, y: port.point.y, hitRadiusPx },\n ...(paint ? { paint } : {}),\n ...(opts.cursor !== undefined ? { cursor: opts.cursor } : {}),\n strength,\n claimedKinds: ['pointer'],\n bind: () => ({\n initialScratch: {\n targetId: node.id,\n nodeId: node.id,\n portId: port.id,\n port,\n } satisfies PortScratch,\n }),\n });\n }\n }\n return out;\n },\n };\n}\n","/\n The connect gesture — dragging one port onto another to author an edge.\n \n Connect is an ordinary drag binding, not a mode and not a tool of its own:\n * the binding is gated on a press landing on a port affordance, so a connect\n * starts from whatever tool happens to be active. The gate lives in the\n * binding's `target`, which is what lets a press that is not on a port fall\n * through to the tool that wants it instead of being swallowed here.\n \n Where validity is decided. The two halves are decided in different\n * places, and conflating them is the mistake this package is written to avoid:\n \n - Which presses start a connect is routing, and belongs to the binding\n * spec. `connectBinding` names the port layer's affordance kind; nothing in\n * the action body re-checks what was pressed.\n * - Which ports a live connect may land on cannot be routing — the\n * dispatcher never re-reads the affordance under a moving pointer, so a\n * spec has no vocabulary for it. It is decided by `canConnect` filtering\n * the candidate set: an illegal port is never a candidate, so the\n * preview will not snap to it and a release over it commits nothing. That\n * is a narrower thing than an action body that inspects a hit and bails.\n \n One resolver answers both the live preview and the commit, for the reason\n * `insertAction` does the same: a preview computed separately from the commit\n * is a preview that can lie about what releasing will do.\n /\nimport {\n type Action,\n type GestureBinding,\n type InvocationCtx,\n type OngoingHandle,\n type OngoingOverlay,\n type PoseDescriptor,\n type Scene,\n type Stroke,\n type Vec2,\n} from '@weasel-js/core';\nimport { EDGE_DERIVE_PATH, ROUTERS, type DiagramEdge, type Router } from './edge';\nimport { PORT_AFFORDANCE_KIND, portScratchOf, type ParticipantSource } from './portAffordance';\nimport { portsOf } from './ports';\nimport type { DiagramNodeReader } from './trait';\nimport type { Port } from './types';\n\n/* The default action id, and what {@link connectBinding} points at. /\nexport const CONNECT_ACTION_ID = 'diagram.connect';\n\n/* Whether an edge may run from `from` to `to`. /\nexport type CanConnect = (from: Port, to: Port) => boolean;\n\n/* The edge a finished connect describes. Both ends are resolved ports, so a\n * consumer minting the node has nothing left to look up. /\nexport interface PendingEdge {\n from: Port;\n to: Port;\n /* Registry key for the router the new edge should name. /\n router: string;\n}\n\n/\n The shipped policy: a port may not join itself, and two ports that both\n * declare a `type` must declare the same one.\n \n A port with no type joins anything — `PortSpec.type` is uninterpreted by this\n * package, so an untyped diagram stays fully connectable without opting out.\n * Two ports on the same node may be joined: a self-edge between two different\n * ports is meaningful in a state machine, and refusing it here would be policy\n * masquerading as a rule.\n /\nexport const defaultCanConnect: CanConnect = (from, to) => {\n if (from.nodeId === to.nodeId && from.id === to.id) return false;\n if (from.type === undefined \|\| to.type === undefined) return true;\n return from.type === to.type;\n};\n\nexport interface ConnectActionOptions<TPose> {\n /* Where the droppable ports come from. The same source the port affordance\n * reads, so what is grabbable and what is landable cannot disagree. /\n participants: ParticipantSource<TPose>;\n /* Default {@link CONNECT_ACTION_ID}. /\n id?: string;\n read?: DiagramNodeReader;\n geometry?: PoseDescriptor<TPose>;\n /* Default {@link defaultCanConnect}. /\n canConnect?: CanConnect;\n /* How near the pointer must come to a port, in world units, before the\n * edge snaps to it. Default 16. /\n snapRadius?: number;\n /* Registry key the new edge names, and the router the preview draws with.\n * Default `'straight'`. /\n router?: string;\n routers?: Readonly<Record<string, Router>>;\n /\n Mints and commits the edge. Called once, on release over a valid port.\n \n Defaults to {@link commitEdgeToScene} against `deps.scene`, which is what\n * makes the gesture work with nothing wired. Override it the way a consumer\n * overrides the kit's `insert` dep — to choose the edge node's data, its\n * layer, or its stroke.\n /\n commit?: (edge: PendingEdge, ctx: InvocationCtx) => void;\n}\n\nconst DEFAULT_SNAP = 16;\n/* What a connect-authored edge is drawn with, when the consumer overrides\n * nothing. /\nexport const DEFAULT_EDGE_STROKE: Stroke = {\n paint: { color: '#7ba7c7' },\n width: 2,\n markerEnd: 'arrow',\n};\nconst DEFAULT_ROUTER = 'straight';\n\ninterface ConnectScratch {\n from: Port;\n current: Vec2;\n open: boolean;\n /* The deps bag as it was at `start`. The dispatcher builds it once, so\n * every later pump event carries `deps: {}` — an action that reads a dep at\n * commit time reads nothing and commits nothing, silently. /\n deps: InvocationCtx['deps'];\n}\n\n/\n The binding that starts a connect: a drag whose press landed on the port\n * layer's own chrome.\n \n The string form of `target` rather than a predicate, because it ranks higher\n * in specificity — a bare `{ kind: 'drag' }` on the select tool cannot outrank\n * it, so no tool needs a predicate of its own to keep out of the way.\n /\nexport function connectBinding(actionId: string = CONNECT_ACTION_ID): GestureBinding {\n return {\n spec: { kind: 'drag', target: `affordance:${PORT_AFFORDANCE_KIND}` },\n actionId,\n };\n}\n\n/* The action id that absorbs a press on a port. /\nexport const GRAB_PORT_ACTION_ID = 'diagram.grabPort';\n\n/\n Absorbs a press on a port, and does nothing else.\n \n A port claims the press protocol, not one gesture in it: `pointerDown`,\n * `click` and `drag` are a single claimable `'pointer'` token, and an exclusive\n * claim bars every binding whose target does not consult the affordance. So a\n * bundle that binds only `drag` leaves the pointerdown with nowhere to go, and\n * the dispatcher drops the press — the drag it would have grown into never\n * happens. Absorbing the press is also the behavior you want on its own: a\n * press on a port should not pick or deselect the node underneath it.\n /\nexport function grabPortAction(id: string = GRAB_PORT_ACTION_ID): Action {\n return {\n id,\n label: 'Grab port',\n group: 'diagram',\n invoker: { timing: 'immediate', run: () => {} },\n enabled: () => true as const,\n };\n}\n\n/* The two bindings that keep a port's claim from dropping the press. /\nexport function grabPortBindings(actionId: string = GRAB_PORT_ACTION_ID): GestureBinding[] {\n return [\n { spec: { kind: 'pointerDown', target: `affordance:${PORT_AFFORDANCE_KIND}` }, actionId },\n { spec: { kind: 'click', target: `affordance:${PORT_AFFORDANCE_KIND}` }, actionId },\n ];\n}\n\n/\n The default commit: one leaf node carrying the edge trait, added to\n * `deps.scene`. One `add` is one history entry, so the edge undoes in one.\n \n The edge lands on the source node's layer rather than the bottom one: an\n * edge between two nodes on a `wires` layer belongs on `wires`, and picking the\n * first layer in the stack would quietly move it somewhere the author did not\n * put its endpoints.\n /\nexport function commitEdgeToScene(edge: PendingEdge, ctx: InvocationCtx): void {\n const scene = ctx.deps['scene'] as Scene<unknown, string, unknown> \| undefined;\n if (scene === undefined) return;\n const trait: DiagramEdge = {\n from: { port: edge.from.id },\n to: { port: edge.to.id },\n router: edge.router,\n };\n const source = scene.get(edge.from.nodeId as never);\n scene.add({\n kind: 'leaf',\n layer: source?.layer ?? scene.layers[0]!.id,\n pose: { x: 0, y: 0, width: 0, height: 0 } as never,\n // An edge runs from* one node to another, and a plain line does not say\n // so. The arrowhead is an ordinary stroke marker, which is why nothing in\n // this package draws one.\n data: { diagram: trait, stroke: DEFAULT_EDGE_STROKE } as never,\n dependsOn: [edge.from.nodeId as never, edge.to.nodeId as never],\n // Without this the edge re-resolves on every dependency move and paints\n // nothing. `EDGE_DERIVE_PATH` rather than a fresh `edgeDerivePath()` so the\n // scene can find its registry key and the edge survives `toJSON`.\n derivePath: EDGE_DERIVE_PATH as never,\n });\n}\n\n/*\n The `diagram.connect` action: an ongoing drag whose preview is an ephemeral\n * edge and whose commit is one op batch.\n \n A factory rather than a singleton because every input it needs — which nodes\n * are droppable, what counts as a legal pair, how an edge node is shaped — is\n * the consumer's, and this package has no scene at module scope. Same reason\n * `edgeDerivePath` and `diagramShape` are factories.\n /\nexport function createConnectAction<TPose>(opts: ConnectActionOptions<TPose>): Action {\n const {\n id = CONNECT_ACTION_ID,\n canConnect = defaultCanConnect,\n snapRadius = DEFAULT_SNAP,\n router: routerKey = DEFAULT_ROUTER,\n commit = commitEdgeToScene,\n } = opts;\n const routers = opts.routers ?? ROUTERS;\n const portOpts = {\n ...(opts.geometry ? { geometry: opts.geometry } : {}),\n ...(opts.read ? { read: opts.read } : {}),\n };\n const route: Router = routers[routerKey] ?? routers['straight'] ?? ROUTERS['straight']!;\n\n /* The port the pointer is over and may legally land on, or `null`.\n \n `canConnect` is applied here rather than at commit, so an illegal port is\n * not a candidate at all: the edge does not snap to it and releasing over it\n * does nothing. /\n function targetPort(from: Port, at: Vec2): Port \| null {\n let best: Port \| null = null;\n let bestD2 = snapRadius snapRadius;\n for (const { node, pose } of opts.participants()) {\n for (const port of portsOf(node, pose, portOpts)) {\n if (!canConnect(from, port)) continue;\n const d2 = (port.point.x - at.x) 2 + (port.point.y - at.y) 2;\n if (d2 <= bestD2) {\n bestD2 = d2;\n best = port;\n }\n }\n }\n return best;\n }\n\n /** The end the edge currently runs to: a snapped port, or the bare pointer.\n * A free end is a port with no facing, so a router aims straight at it. /\n function endAt(from: Port, at: Vec2): { port: Port \| null; end: Port } {\n const port = targetPort(from, at);\n return {\n port,\n end: port ?? { id: '', nodeId: '', point: at, normal: null },\n };\n }\n\n return {\n id,\n label: 'Connect',\n group: 'diagram',\n requires: ['scene'],\n invoker: {\n timing: 'ongoing',\n start(ctx: InvocationCtx): OngoingHandle {\n const pressed = portScratchOf(ctx.drag?.affordance);\n // Not a port press. The binding spec already said only port presses\n // reach here, so this is the runtime backstop, not the gate — and an\n // empty handle is how the dispatcher is told to fall through.\n if (pressed === null) return {};\n const scratch: ConnectScratch = {\n from: pressed.port,\n current: { x: ctx.world.x, y: ctx.world.y },\n open: true,\n deps: ctx.deps,\n };\n\n return {\n kind: 'diagram-connect',\n onMove(moveCtx: InvocationCtx): void {\n scratch.current = { x: moveCtx.world.x, y: moveCtx.world.y };\n },\n overlay(): OngoingOverlay \| null {\n if (!scratch.open) return null;\n const { end } = endAt(scratch.from, scratch.current);\n const points = route({ from: scratch.from, to: end, waypoints: [] });\n if (points.length < 2) return null;\n // The route, and the word for what it is. How a connector reads —\n // color, weight, dash — belongs to whatever surface paints it;\n // core's own is `useDispatcherOverlayLayer`, whose\n // `DispatcherOverlayStyle.roles` is where a consumer restyles it.\n return { kind: 'polyline', points, role: 'connector' };\n },\n onEnd(endCtx: InvocationCtx, reason: 'commit' \| 'cancel'): void {\n scratch.open = false;\n if (reason === 'cancel') return;\n const { port } = endAt(scratch.from, { x: endCtx.world.x, y: endCtx.world.y });\n if (port === null) return;\n // World and modifiers from the release; deps from the press.\n commit(\n { from: scratch.from, to: port, router: routerKey },\n { ...endCtx, deps: scratch.deps },\n );\n },\n };\n },\n },\n enabled: () => true as const,\n };\n}\n","/\n The port affordance, composed into a layer and pointed at a scene.\n \n Two conveniences over {@link createPortAffordance}, both of which encode a\n * rule that is easy to get wrong rather than merely saving a line.\n /\nimport {\n composeAffordanceLayer,\n effectivePose,\n type RenderLayer,\n} from '@weasel-js/core';\nimport {\n PORT_LAYER_ID,\n createPortAffordance,\n type ParticipantSource,\n type PortAffordanceOptions,\n} from './portAffordance';\nimport type { GraphNodeLike, GraphSource } from './graph';\n\n/* The minimum a participant source needs from a scene. Narrower than `Scene`\n * so a consumer can pass anything that answers these two. /\nexport interface ParticipantScene<TPose> {\n renderOrderNodes(): readonly {\n id: string;\n kind: 'leaf' \| 'container';\n data: unknown;\n pose: TPose;\n dependsOn?: readonly string[] \| 'children';\n }[];\n readonly overrides: { get(id: string): { pose?: TPose } \| undefined };\n get(id: string): unknown;\n childrenOf(id: string): readonly string[];\n}\n\n/\n Every node in `scene`, at the pose it is painted at.\n \n `effectivePose`, not `node.pose`: an override is what a gesture is currently\n * showing, and a port that answers from the document pose while its node is\n * mid-drag sits somewhere the user can see the node is not. Nodes that carry no\n * participant trait cost one reader call each and contribute no regions.\n \n One source answers both the ports and the graph — `GraphSource` is a\n * `ParticipantSource` that also carries `dependsOn`, which is where an edge's\n * two endpoints live.\n /\nexport function sceneParticipants<TPose>(\n scene: ParticipantScene<TPose>,\n): GraphSource<TPose> {\n return function () {\n for (const node of scene.renderOrderNodes()) {\n yield {\n node: node as GraphNodeLike,\n pose: effectivePose(scene as never, node as never) as TPose,\n };\n }\n };\n}\n\n/*\n The composed layer, ready for `CanvasExtensionApi.registerLayer` — the only\n * attach route that is hit-tested. Handing this to `SceneCanvas`'s `layers`\n * prop, or to a `Contribution.overlay`, paints the ports and makes none of them\n * grabbable.\n \n The cast is `composeAffordanceLayer` typing its data slot as `ChromeState`\n * while the layer registry takes `RenderLayer<unknown>`; both are handed the\n * same live `CanvasHelpers` envelope at runtime.\n /\nexport function portLayer<TPose>(\n participants: ParticipantSource<TPose>,\n opts: PortAffordanceOptions<TPose> = {},\n): RenderLayer<unknown> & { hitTest: NonNullable<RenderLayer<unknown>['hitTest']> } {\n return composeAffordanceLayer(\n opts.id ?? PORT_LAYER_ID,\n 'Diagram ports',\n [createPortAffordance(participants, opts)],\n ) as unknown as RenderLayer<unknown> & { hitTest: NonNullable<RenderLayer<unknown>['hitTest']> };\n}\n","/\n The plugin as a `Contribution` bundle — one object a consumer hands to\n * `<SceneCanvas ambient={…}>`.\n \n Ambient, not a tool. Connect is not a mode the author enters: a port is\n * grabbable whatever tool is active, which is the same reason `@weasel-js/hud`\n * ships `eligibility: { claimed: true }`. `claimed` is what makes the bundle\n * live for a press the port layer's affordance claimed, and dormant otherwise.\n \n The layer is not in here, on purpose. `Contribution.overlay` is painted\n * and never hit-tested — only `CanvasExtensionApi.registerLayer` gets a\n * `hitTest` call. Shipping the port layer as an overlay would paint every port\n * and make none of them grabbable, which is exactly the state this arc started\n * from. {@link diagramPorts} hands back the bundle and the layer together so\n * the two cannot be wired half-way.\n /\nimport type { Contribution, RenderLayer } from '@weasel-js/core';\nimport {\n CONNECT_ACTION_ID,\n connectBinding,\n createConnectAction,\n grabPortAction,\n grabPortBindings,\n type ConnectActionOptions,\n} from './connect';\nimport { portLayer } from './portLayer';\nimport type { PortAffordanceOptions } from './portAffordance';\n\nexport { CONNECT_ACTION_ID };\n\nexport interface DiagramContributionOptions<TPose>\n extends ConnectActionOptions<TPose>, PortAffordanceOptions<TPose> {}\n\n/* The bundle: the connect action and the one binding that reaches it. /\nexport function createDiagramContribution<TPose>(\n opts: DiagramContributionOptions<TPose>,\n): Contribution {\n const actionId = opts.id ?? CONNECT_ACTION_ID;\n return {\n id: 'weasel-diagram',\n eligibility: { claimed: true },\n actions: [createConnectAction({ ...opts, id: actionId }), grabPortAction()],\n bindings: [connectBinding(actionId), ...grabPortBindings()],\n };\n}\n\n/\n Both halves of the port affordance: the layer to `registerLayer`, and the\n * contribution to pass as `ambient`.\n \n They are returned together because attaching one without the other fails\n * quietly — the layer alone paints ports that start no gesture, and the\n * contribution alone binds an affordance kind nothing ever reports.\n /\nexport function diagramPorts<TPose>(opts: DiagramContributionOptions<TPose>): {\n layer: RenderLayer<unknown>;\n contribution: Contribution;\n} {\n return {\n layer: portLayer(opts.participants, opts),\n contribution: createDiagramContribution(opts),\n };\n}\n","/\n `Graph` — the adjacency index a layout runs over.\n \n The scene is the document, so there is no second graph kept in sync with it:\n * this one is built from the scene on demand, used, and thrown away. Rebuilding\n * per layout invocation is deliberate — a maintained index is a cache to\n * invalidate on every add, delete, reparent and `dependsOn` edit, and layout is\n * not on the hot path. Measure before changing that.\n \n A node's identity is its id and its size is its bounds; where it currently\n * sits is here too, because a re-layout that ignores where things already are\n * scrambles a diagram the author has arranged.\n /\nimport { AUTO_POSE_DESCRIPTOR, type PoseDescriptor } from '@weasel-js/core';\nimport { diagramEdgeOf } from './edge';\nimport type { Bounds } from './outline';\nimport { diagramNodeOf, type DiagramNodeLike, type DiagramNodeReader } from './trait';\n\n/* A scene node as the graph reads it. `dependsOn` is what an edge's two\n * endpoints are: the edge trait names ports, and the nodes those ports are\n * on are the dependencies the derivation already runs on. /\nexport interface GraphNodeLike extends DiagramNodeLike {\n dependsOn?: readonly string[] \| 'children';\n}\n\n/* Where the graph gets its nodes. The same thunk shape the port affordance\n * takes, so one source answers both. /\nexport type GraphSource<TPose> = () => Iterable<{ node: GraphNodeLike; pose: TPose }>;\n\n/* One participant. /\nexport interface GraphNode {\n id: string;\n /* Where it is now, in world coordinates. /\n bounds: Bounds;\n /* Layout must not move it. /\n pinned: boolean;\n}\n\n/* One connection. `id` is the edge node's own id, so a caller can go back to\n * the scene for its trait. /\nexport interface GraphEdge {\n id: string;\n from: string;\n to: string;\n}\n\n/\n Nodes, edges, and the two adjacency reads a layout needs.\n \n Every list is in source order — render order, when the source is a scene —\n * which is what a layout's tiebreaks resolve against. There is no RNG anywhere\n * downstream of this, and this is where that starts.\n /\nexport interface Graph {\n readonly nodes: readonly GraphNode[];\n readonly edges: readonly GraphEdge[];\n node(id: string): GraphNode \| undefined;\n /* Edges leaving `id`, in source order. /\n outgoing(id: string): readonly GraphEdge[];\n /* Edges arriving at `id`, in source order. /\n incoming(id: string): readonly GraphEdge[];\n}\n\nexport interface BuildGraphOptions<TPose> {\n read?: DiagramNodeReader;\n geometry?: PoseDescriptor<TPose>;\n}\n\n/\n Read a graph out of a source of scene nodes.\n \n A node is an edge if it carries the edge trait and names exactly two\n * dependencies; a participant if the reader hands back a `DiagramNode`;\n * neither, and it is not in the diagram at all. An edge whose endpoints are not\n * both participants is dropped — a dangling edge should not be ranking\n * anything.\n /\nexport function buildGraph<TPose>(\n source: GraphSource<TPose>,\n opts: BuildGraphOptions<TPose> = {},\n): Graph {\n const geometry = opts.geometry ?? (AUTO_POSE_DESCRIPTOR as PoseDescriptor<TPose>);\n const nodes: GraphNode[] = [];\n const byId = new Map<string, GraphNode>();\n const candidates: GraphEdge[] = [];\n\n for (const { node, pose } of source()) {\n if (diagramEdgeOf(node) !== null) {\n const deps = node.dependsOn;\n if (Array.isArray(deps) && deps.length === 2) {\n candidates.push({ id: node.id, from: deps[0]!, to: deps[1]! });\n }\n continue;\n }\n const trait = diagramNodeOf(node, opts.read);\n if (trait === null) continue;\n const entry: GraphNode = {\n id: node.id,\n bounds: geometry.getBounds(pose),\n pinned: trait.pinned === true,\n };\n nodes.push(entry);\n byId.set(entry.id, entry);\n }\n\n const edges = candidates.filter((e) => byId.has(e.from) && byId.has(e.to));\n const out = new Map<string, GraphEdge[]>();\n const into = new Map<string, GraphEdge[]>();\n for (const edge of edges) {\n push(out, edge.from, edge);\n push(into, edge.to, edge);\n }\n\n const NONE: readonly GraphEdge[] = Object.freeze([]);\n return {\n nodes,\n edges,\n node: (id) => byId.get(id),\n outgoing: (id) => out.get(id) ?? NONE,\n incoming: (id) => into.get(id) ?? NONE,\n };\n}\n\nfunction push(index: Map<string, GraphEdge[]>, key: string, edge: GraphEdge): void {\n const list = index.get(key);\n if (list === undefined) index.set(key, [edge]);\n else list.push(edge);\n}\n","/\n Layout: where the participants go.\n \n A layout is a pure function of the graph — no scene, no ops, no history. It\n * hands back the new top-left for every node that moves, and a node already\n * standing where the layout wants it is simply absent from the answer. That is\n * what makes re-running a layout free rather than destructive, and it is the\n * property the idempotence test asserts.\n \n Three rules keep re-layout non-destructive, and all three live here rather\n * than in each algorithm:\n \n - No RNG anywhere. Every tiebreak falls back to the graph's own node\n * order, which is the source's order — render order, for a scene.\n * - Within-rank order is seeded from where the nodes already are, read\n * off the cross axis, rather than from crossing-minimization. An author who\n * dragged two boxes into an order gets that order back.\n * - A pin set nothing moves. Pinned nodes are never in the result, and\n * the rest of the layout is translated to sit around them.\n \n `layered` and `tree` are idempotent by construction: the second run reads the\n * order the first run produced and computes the same slots. `force` is an\n * iterative relaxation and makes no such claim — re-running it keeps relaxing.\n /\nimport type { Vec2 } from '@weasel-js/core';\nimport type { Graph, GraphNode } from './graph';\nimport type { Bounds } from './outline';\n\n/* Which way the ranks stack. `force` ignores it. /\nexport type LayoutDirection = 'down' \| 'up' \| 'right' \| 'left';\n\nexport interface LayoutOptions {\n /* Default `'down'`. /\n direction?: LayoutDirection;\n /* Between neighbors within a rank, in world units. Default 48. /\n nodeGap?: number;\n /* Between one rank and the next. Default 96. /\n rankGap?: number;\n /* Ids layout must not move, on top of whatever carries `pinned: true`. /\n pin?: Iterable<string>;\n /* How far a node has to move to be worth moving, in world units. Default\n * `1e-6` — a float-noise floor, not a snapping quantum. Raise it to let a\n * `force` pass that has stopped doing anything useful commit nothing. /\n tolerance?: number;\n}\n\n/* The new top-left for each node that moves. A node that is already there is\n * absent, so an empty result means \"nothing to do\". /\nexport type LayoutResult = ReadonlyMap<string, Vec2>;\n\n/* Every layout in this package has this shape, and so does a consumer's. /\nexport type LayoutFn = (graph: Graph, opts?: LayoutOptions) => LayoutResult;\n\nexport const DEFAULT_NODE_GAP = 48;\nexport const DEFAULT_RANK_GAP = 96;\nconst DEFAULT_TOLERANCE = 1e-6;\n\n/* Which world axis carries ranks, which carries within-rank order, and\n * whether ranks grow toward positive world coordinates. /\nexport interface LayoutAxes {\n rank: 'x' \| 'y';\n cross: 'x' \| 'y';\n /* `-1` for `'up'` and `'left'`, where the canonical frame is mirrored. /\n sign: 1 \| -1;\n}\n\nexport function axesFor(direction: LayoutDirection = 'down'): LayoutAxes {\n switch (direction) {\n case 'up':\n return { rank: 'y', cross: 'x', sign: -1 };\n case 'right':\n return { rank: 'x', cross: 'y', sign: 1 };\n case 'left':\n return { rank: 'x', cross: 'y', sign: -1 };\n default:\n return { rank: 'y', cross: 'x', sign: 1 };\n }\n}\n\n/* A node's extent along one axis. /\nexport function extent(bounds: Bounds, axis: 'x' \| 'y'): number {\n return axis === 'x' ? bounds.width : bounds.height;\n}\n\n/* A node's center along one axis — what within-rank order is seeded from. /\nexport function center(bounds: Bounds, axis: 'x' \| 'y'): number {\n return axis === 'x' ? bounds.x + bounds.width / 2 : bounds.y + bounds.height / 2;\n}\n\n/* Every id layout must leave alone. /\nexport function pinnedSet(graph: Graph, opts: LayoutOptions = {}): Set<string> {\n const pinned = new Set<string>(opts.pin ?? []);\n for (const node of graph.nodes) {\n if (node.pinned) pinned.add(node.id);\n }\n return pinned;\n}\n\n/\n A placement in the canonical `(cross, rank)` frame, before it is turned into\n * world coordinates. `cross` and `rank` are the node's low corner along each.\n /\nexport interface Slot {\n cross: number;\n rank: number;\n}\n\n/\n Turn canonical slots into the positions to write.\n \n Three steps, in order: map the canonical frame onto the world axes the\n * direction names; translate the whole layout so it lands where the graph\n * already is; drop everything that is pinned or that would not move.\n \n The translation is what makes the layout non-destructive, and it is chosen so\n * that a second run lands on the same answer. With a pin, it is whatever keeps\n * the first pinned node exactly where it is. Without one, it is whatever puts\n * the layout's own bounding box where the graph's bounding box already starts —\n * which the first run then makes true, so the second run computes the same\n * translation and writes nothing.\n /\nexport function settle(\n graph: Graph,\n slots: ReadonlyMap<string, Slot>,\n opts: LayoutOptions = {},\n): LayoutResult {\n const axes = axesFor(opts.direction);\n const pinned = pinnedSet(graph, opts);\n const tolerance = opts.tolerance ?? DEFAULT_TOLERANCE;\n\n const placed = new Map<string, Vec2>();\n for (const node of graph.nodes) {\n const slot = slots.get(node.id);\n if (slot === undefined) continue;\n const along = axes.sign === 1 ? slot.rank : -(slot.rank + extent(node.bounds, axes.rank));\n placed.set(\n node.id,\n axes.rank === 'y' ? { x: slot.cross, y: along } : { x: along, y: slot.cross },\n );\n }\n\n return translated(graph, placed, pinned, tolerance);\n}\n\n/\n {@link settle}'s second half, for a layout that already works in world\n * coordinates — `force` does, since the integrator moves points around rather\n * than filling slots.\n /\nexport function translated(\n graph: Graph,\n placed: ReadonlyMap<string, Vec2>,\n pinned: ReadonlySet<string>,\n tolerance = DEFAULT_TOLERANCE,\n): LayoutResult {\n const anchor = anchorDelta(graph, placed, pinned);\n const out = new Map<string, Vec2>();\n for (const node of graph.nodes) {\n const at = placed.get(node.id);\n if (at === undefined \|\| pinned.has(node.id)) continue;\n const x = at.x + anchor.x;\n const y = at.y + anchor.y;\n if (Math.abs(x - node.bounds.x) <= tolerance && Math.abs(y - node.bounds.y) <= tolerance) {\n continue;\n }\n out.set(node.id, { x, y });\n }\n return out;\n}\n\nfunction anchorDelta(\n graph: Graph,\n placed: ReadonlyMap<string, Vec2>,\n pinned: ReadonlySet<string>,\n): Vec2 {\n for (const node of graph.nodes) {\n if (!pinned.has(node.id)) continue;\n const at = placed.get(node.id);\n if (at !== undefined) return { x: node.bounds.x - at.x, y: node.bounds.y - at.y };\n }\n let minCurX = Infinity;\n let minCurY = Infinity;\n let minNewX = Infinity;\n let minNewY = Infinity;\n for (const node of graph.nodes) {\n const at = placed.get(node.id);\n if (at === undefined) continue;\n minCurX = Math.min(minCurX, node.bounds.x);\n minCurY = Math.min(minCurY, node.bounds.y);\n minNewX = Math.min(minNewX, at.x);\n minNewY = Math.min(minNewY, at.y);\n }\n if (!Number.isFinite(minCurX)) return { x: 0, y: 0 };\n return { x: minCurX - minNewX, y: minCurY - minNewY };\n}\n\n/\n Lay a list of nodes out along the cross axis, in the order given, and hand\n * back each one's low corner plus the total span.\n \n Shared by `layered`'s ranks and `tree`'s sibling rows, which pack a row the\n * same way and differ only in what decides the order.\n /\nexport function packAcross(\n nodes: readonly GraphNode[],\n axis: 'x' \| 'y',\n gap: number,\n): { at: Map<string, number>; span: number } {\n const at = new Map<string, number>();\n let cursor = 0;\n for (const node of nodes) {\n at.set(node.id, cursor);\n cursor += extent(node.bounds, axis) + gap;\n }\n return { at, span: nodes.length === 0 ? 0 : cursor - gap };\n}\n\n/* Order within a rank: where the nodes already sit on the cross axis, with\n * graph order breaking a tie. Never a comparison that could reverse between\n * two runs on the same input. /\nexport function seededOrder(\n nodes: readonly GraphNode[],\n axis: 'x' \| 'y',\n indexOf: (id: string) => number,\n): GraphNode[] {\n return [...nodes].sort((a, b) => {\n const d = center(a.bounds, axis) - center(b.bounds, axis);\n return d !== 0 ? d : indexOf(a.id) - indexOf(b.id);\n });\n}\n\n/* Each node's position in `graph.nodes`, for tiebreaks. /\nexport function graphOrder(graph: Graph): (id: string) => number {\n const index = new Map<string, number>();\n graph.nodes.forEach((node, i) => index.set(node.id, i));\n return (id) => index.get(id) ?? Number.MAX_SAFE_INTEGER;\n}\n","/\n `force` — relaxation, for a graph with no direction to read it in.\n \n Seeded from where the nodes already are rather than from a fresh random\n * scatter: an author who has arranged half a diagram gets that arrangement\n * relaxed, not replaced. There is no RNG in it at all — two coincident nodes\n * are separated along a golden-angle spiral keyed to their index, which is what\n * a random jiggle is for elsewhere.\n \n The integrator is the kit's own `createSimulation`, the same one\n * `useSimulation` runs a frame at a time. Only the forces are local, and they\n * are the naive O(n²) kind — right for the tens-to-hundreds of nodes an\n * edge-per-scene-node diagram is already sized for, wrong for a 10k-node graph,\n * which wants d3-force's Barnes–Hut through `useSimulation` and its own render\n * layer.\n \n This is the one layout that is not idempotent. A relaxation re-run from\n * its own output keeps relaxing; `direction` means nothing to it. Pins and the\n * `tolerance` option are what keep a second pass from scrambling a settled\n * diagram.\n /\nimport { createSimulation, type SimulationForce, type SimulationNode } from '@weasel-js/core';\nimport type { Graph } from './graph';\nimport {\n center,\n pinnedSet,\n translated,\n type LayoutFn,\n type LayoutOptions,\n type LayoutResult,\n} from './layout';\n\nexport interface ForceOptions extends LayoutOptions {\n /* Ticks to run. Default 300 — one full cooling schedule. /\n iterations?: number;\n /* Rest length of an edge, in world units. Default 160. /\n linkDistance?: number;\n /* How hard an edge pulls, 0..1. Default 0.35. /\n linkStrength?: number;\n /* Pairwise repulsion. Negative repels; default -3000. /\n charge?: number;\n /* How hard the graph is held around its own centroid. Default 0.02. /\n gravity?: number;\n /* Clear space kept between two boxes, in world units. Default 24. /\n padding?: number;\n}\n\ninterface Body extends SimulationNode {\n id: string;\n /* Half the node's box, so separation can work on the shape the author sees\n * rather than on a point. /\n hw: number;\n hh: number;\n}\n\nconst DEFAULTS = {\n iterations: 300,\n linkDistance: 160,\n linkStrength: 0.35,\n charge: -3000,\n gravity: 0.02,\n padding: 24,\n} as const;\n\n/* The golden angle. Coincident nodes fan out along it, which spreads any\n * number of them without two landing on the same heading. /\nconst GOLDEN = Math.PI (3 - Math.sqrt(5));\n/** How far the first coincident node is pushed, in world units. Small enough\n * to be invisible, large enough that the repulsion term is finite. /\nconst NUDGE = 0.5;\n\n/* Pairwise repulsion, applied to every pair once. /\nfunction charge(bodies: readonly Body[], strength: number): SimulationForce<Body> {\n return (alpha) => {\n for (let i = 0; i < bodies.length; i++) {\n const a = bodies[i]!;\n for (let j = i + 1; j < bodies.length; j++) {\n const b = bodies[j]!;\n const dx = b.x - a.x;\n const dy = b.y - a.y;\n const d2 = dx dx + dy * dy;\n if (d2 === 0) continue;\n const w = (strength * alpha) / d2;\n a.vx! += dx * w;\n a.vy! += dy * w;\n b.vx! -= dx * w;\n b.vy! -= dy * w;\n }\n }\n };\n}\n\n/** A spring per edge, pulling both ends toward `distance`. /\nfunction links(\n bodies: ReadonlyMap<string, Body>,\n graph: Graph,\n distance: number,\n strength: number,\n): SimulationForce<Body> {\n return (alpha) => {\n for (const edge of graph.edges) {\n const a = bodies.get(edge.from);\n const b = bodies.get(edge.to);\n if (a === undefined \|\| b === undefined \|\| a === b) continue;\n const dx = b.x - a.x;\n const dy = b.y - a.y;\n const d = Math.hypot(dx, dy);\n if (d === 0) continue;\n const pull = ((d - distance) / d) alpha * strength;\n a.vx! += dx * pull;\n a.vy! += dy * pull;\n b.vx! -= dx * pull;\n b.vy! -= dy * pull;\n }\n };\n}\n\n/*\n Push overlapping boxes apart along whichever axis they overlap least.\n \n Charge alone is not enough: it treats a node as a point, so two wide boxes\n * whose centers are a comfortable distance apart still cover each other. This\n * works on the box, and it is not scaled by alpha — an overlap at the end of\n * the run is exactly as wrong as one at the start.\n /\nfunction separateBoxes(bodies: readonly Body[], padding: number): SimulationForce<Body> {\n return () => {\n for (let i = 0; i < bodies.length; i++) {\n const a = bodies[i]!;\n for (let j = i + 1; j < bodies.length; j++) {\n const b = bodies[j]!;\n const dx = b.x - a.x;\n const dy = b.y - a.y;\n const gapX = a.hw + b.hw + padding - Math.abs(dx);\n const gapY = a.hh + b.hh + padding - Math.abs(dy);\n if (gapX <= 0 \|\| gapY <= 0) continue;\n if (gapX < gapY) {\n const push = (Math.sign(dx) \|\| 1) gapX * 0.5;\n a.vx! -= push;\n b.vx! += push;\n } else {\n const push = (Math.sign(dy) \|\| 1) * gapY * 0.5;\n a.vy! -= push;\n b.vy! += push;\n }\n }\n }\n };\n}\n\n/** A pull toward the seed centroid, so a component with nothing to hold it\n * does not drift off under pure repulsion. /\nfunction gravity(bodies: readonly Body[], at: { x: number; y: number }, strength: number): SimulationForce<Body> {\n return (alpha) => {\n for (const body of bodies) {\n body.vx! += (at.x - body.x) strength * alpha;\n body.vy! += (at.y - body.y) * strength * alpha;\n }\n };\n}\n\n/*\n The bodies and the force list, wound up and ready to tick.\n \n Shared by the one-shot `force` below and the live relaxation in `live.ts`,\n * which ticks it a frame at a time. Two copies of a force list drift, and the\n * only thing that would say so is the arrangement they produce.\n /\nexport interface ForceRelaxation {\n bodies: Body[];\n byId: Map<string, Body>;\n /* Ids the caller must not move: declared pins, held as `fx`/`fy`. /\n pinned: ReadonlySet<string>;\n sim: ReturnType<typeof createSimulation<Body>>;\n /* Where a body's node's top-left sits, given the body's center. /\n placed(): Map<string, { x: number; y: number }>;\n}\n\nexport function forceRelaxation(graph: Graph, opts: ForceOptions = {}): ForceRelaxation {\n const {\n linkDistance = DEFAULTS.linkDistance,\n linkStrength = DEFAULTS.linkStrength,\n charge: chargeStrength = DEFAULTS.charge,\n gravity: gravityStrength = DEFAULTS.gravity,\n padding = DEFAULTS.padding,\n } = opts;\n\n const pinned = pinnedSet(graph, opts);\n const bodies: Body[] = graph.nodes.map((node) => {\n const body: Body = {\n id: node.id,\n x: center(node.bounds, 'x'),\n y: center(node.bounds, 'y'),\n hw: node.bounds.width / 2,\n hh: node.bounds.height / 2,\n };\n // A pin is the integrator's own `fx`/`fy`, not a filter applied after the\n // fact: a pinned node has to hold its neighbors while they relax, not be\n // put back once they have finished relaxing around where it wasn't.\n if (pinned.has(node.id)) {\n body.fx = body.x;\n body.fy = body.y;\n }\n return body;\n });\n separate(bodies);\n\n const byId = new Map(bodies.map((b) => [b.id, b]));\n const centroid = {\n x: bodies.reduce((sum, b) => sum + b.x, 0) / bodies.length,\n y: bodies.reduce((sum, b) => sum + b.y, 0) / bodies.length,\n };\n\n const sim = createSimulation<Body>({\n nodes: bodies,\n forces: [\n charge(bodies, chargeStrength),\n links(byId, graph, linkDistance, linkStrength),\n gravity(bodies, centroid, gravityStrength),\n separateBoxes(bodies, padding),\n ],\n });\n\n return {\n bodies,\n byId,\n pinned,\n sim,\n placed() {\n const placed = new Map<string, { x: number; y: number }>();\n for (const node of graph.nodes) {\n const body = byId.get(node.id)!;\n placed.set(node.id, {\n x: body.x - node.bounds.width / 2,\n y: body.y - node.bounds.height / 2,\n });\n }\n return placed;\n },\n };\n}\n\nexport const force = (graph: Graph, opts: ForceOptions = {}): LayoutResult => {\n if (graph.nodes.length === 0) return new Map();\n const relaxation = forceRelaxation(graph, opts);\n relaxation.sim.tick(opts.iterations ?? DEFAULTS.iterations);\n return translated(graph, relaxation.placed(), relaxation.pinned, opts.tolerance);\n};\n\n/* `ForceOptions` only widens `LayoutOptions`, so this is a `LayoutFn` — but\n * declaring it as one would hide the extra options from every caller. /\nforce satisfies LayoutFn;\n\n/* Push coincident bodies apart, deterministically. Two nodes at exactly the\n * same point feel no repulsion from each other and stay stacked forever. A\n * pinned body is counted but never moved — a pin outranks this. /\nfunction separate(bodies: Body[]): void {\n const seen = new Map<string, number>();\n bodies.forEach((body, i) => {\n const key = `${body.x},${body.y}`;\n const nth = seen.get(key) ?? 0;\n seen.set(key, nth + 1);\n if (nth === 0 \|\| body.fx != null \|\| body.fy != null) return;\n const angle = GOLDEN i;\n const radius = NUDGE * nth;\n body.x += Math.cos(angle) * radius;\n body.y += Math.sin(angle) * radius;\n });\n}\n","/*\n `layered` — ranks running one way, nodes running across.\n \n The flowchart / pipeline layout: an edge points from one rank to the next, so\n * reading down the page is reading the order things happen in. Ranks come from\n * longest-path layering, which puts every node as far along as its deepest\n * predecessor allows.\n \n Cycles do not disqualify a graph. A depth-first walk in graph order names the\n * edges that close a cycle, layering ignores those, and they draw as edges\n * running back up the page — which is what a reader expects a loop to look\n * like. Which edges get named depends only on the node order, so it is the same\n * every run.\n \n This is not crossing-minimization: within a rank, nodes keep the order they\n * already have on the cross axis. An author who dragged two branches into an\n * order gets that order back, and re-running the layout is free.\n /\nimport type { Graph, GraphNode } from './graph';\nimport {\n DEFAULT_NODE_GAP,\n DEFAULT_RANK_GAP,\n axesFor,\n extent,\n graphOrder,\n packAcross,\n seededOrder,\n settle,\n type LayoutFn,\n type Slot,\n} from './layout';\n\n/* Edge ids that close a cycle, found by a depth-first walk in graph order. /\nexport function backEdges(graph: Graph): Set<string> {\n const back = new Set<string>();\n const done = new Set<string>();\n const onStack = new Set<string>();\n\n const walk = (id: string): void => {\n if (done.has(id)) return;\n onStack.add(id);\n for (const edge of graph.outgoing(id)) {\n if (onStack.has(edge.to)) back.add(edge.id);\n else walk(edge.to);\n }\n onStack.delete(id);\n done.add(id);\n };\n\n for (const node of graph.nodes) walk(node.id);\n return back;\n}\n\n/* Longest-path rank per node: one past its deepest predecessor. /\nexport function ranksOf(graph: Graph, back: ReadonlySet<string>): Map<string, number> {\n const ranks = new Map<string, number>();\n const resolving = new Set<string>();\n\n const rankOf = (id: string): number => {\n const known = ranks.get(id);\n if (known !== undefined) return known;\n // Only reachable if `back` missed an edge; guarding here keeps a bad\n // cycle-breaker from recursing forever rather than reporting a wrong rank.\n if (resolving.has(id)) return 0;\n resolving.add(id);\n let rank = 0;\n for (const edge of graph.incoming(id)) {\n if (back.has(edge.id)) continue;\n rank = Math.max(rank, rankOf(edge.from) + 1);\n }\n resolving.delete(id);\n ranks.set(id, rank);\n return rank;\n };\n\n for (const node of graph.nodes) rankOf(node.id);\n return ranks;\n}\n\nexport const layered: LayoutFn = (graph, opts = {}) => {\n const axes = axesFor(opts.direction);\n const nodeGap = opts.nodeGap ?? DEFAULT_NODE_GAP;\n const rankGap = opts.rankGap ?? DEFAULT_RANK_GAP;\n const order = graphOrder(graph);\n\n const ranks = ranksOf(graph, backEdges(graph));\n const byRank = new Map<number, GraphNode[]>();\n for (const node of graph.nodes) {\n const rank = ranks.get(node.id) ?? 0;\n const list = byRank.get(rank);\n if (list === undefined) byRank.set(rank, [node]);\n else list.push(node);\n }\n\n const rows = [...byRank.keys()].sort((a, b) => a - b);\n const packed = new Map<number, ReturnType<typeof packAcross>>();\n let widest = 0;\n for (const rank of rows) {\n const row = seededOrder(byRank.get(rank)!, axes.cross, order);\n const p = packAcross(row, axes.cross, nodeGap);\n packed.set(rank, p);\n widest = Math.max(widest, p.span);\n }\n\n const slots = new Map<string, Slot>();\n let along = 0;\n for (const rank of rows) {\n const row = byRank.get(rank)!;\n const p = packed.get(rank)!;\n const indent = (widest - p.span) / 2;\n const depth = Math.max(0, ...row.map((n) => extent(n.bounds, axes.rank)));\n for (const node of row) {\n slots.set(node.id, {\n cross: indent + p.at.get(node.id)!,\n // Centered in its rank's band, so a tall node does not push its\n // neighbors' edges off the line they read along.\n rank: along + (depth - extent(node.bounds, axes.rank)) / 2,\n });\n }\n along += depth + rankGap;\n }\n\n return settle(graph, slots, opts);\n};\n","/\n `tree` — a parent centered over the block its children occupy.\n \n The hierarchy layout: org charts, file trees, decision trees. Depth is the\n * rank axis, so every child sits one band past its parent, and a subtree is\n * packed as a solid block so two siblings' descendants never interleave.\n \n A graph that is not a tree still lays out. Roots are the nodes nothing points\n * at, in graph order; a node reachable from two parents belongs to whichever\n * the depth-first walk reaches first; and anything the walk never reaches — a\n * disconnected part, or a pure cycle — becomes a root of its own. So the answer\n * is always a forest, and which forest depends only on the node order.\n \n The block packing is deliberately not Reingold–Tilford: it never slides a\n * deep subtree under a shallow neighbor's overhang. That costs horizontal\n * space and buys an invariant an author can rely on — a subtree's extent is a\n * rectangle, and dragging one never lands it inside another.\n /\nimport type { Graph, GraphNode } from './graph';\nimport {\n DEFAULT_NODE_GAP,\n DEFAULT_RANK_GAP,\n axesFor,\n extent,\n graphOrder,\n seededOrder,\n settle,\n type LayoutFn,\n type Slot,\n} from './layout';\n\ninterface Forest {\n roots: GraphNode[];\n children: Map<string, GraphNode[]>;\n depth: Map<string, number>;\n}\n\n/* The forest a depth-first walk in graph order finds. Exported because \"which\n * node ended up whose child\" is the question anyone debugging a tree layout\n * asks first. /\nexport function forestOf(graph: Graph, crossAxis: 'x' \| 'y'): Forest {\n const order = graphOrder(graph);\n const children = new Map<string, GraphNode[]>();\n const depth = new Map<string, number>();\n const roots: GraphNode[] = [];\n\n const claim = (node: GraphNode, at: number): void => {\n depth.set(node.id, at);\n const kids: GraphNode[] = [];\n for (const edge of graph.outgoing(node.id)) {\n if (edge.to === node.id \|\| depth.has(edge.to)) continue;\n const child = graph.node(edge.to);\n if (child === undefined) continue;\n // Claimed on sight rather than inside the recursion, so two siblings\n // sharing a descendant cannot both take it.\n depth.set(child.id, at + 1);\n kids.push(child);\n }\n const ordered = seededOrder(kids, crossAxis, order);\n children.set(node.id, ordered);\n for (const child of ordered) claim(child, at + 1);\n };\n\n const rootish = graph.nodes.filter((node) =>\n graph.incoming(node.id).every((edge) => edge.from === node.id));\n for (const node of seededOrder(rootish, crossAxis, order)) {\n if (depth.has(node.id)) continue;\n roots.push(node);\n claim(node, 0);\n }\n // Whatever the walk could not reach: a disconnected part, or a component\n // every node of which is inside a cycle.\n for (const node of graph.nodes) {\n if (depth.has(node.id)) continue;\n roots.push(node);\n claim(node, 0);\n }\n\n return { roots, children, depth };\n}\n\nexport const tree: LayoutFn = (graph, opts = {}) => {\n const axes = axesFor(opts.direction);\n const nodeGap = opts.nodeGap ?? DEFAULT_NODE_GAP;\n const rankGap = opts.rankGap ?? DEFAULT_RANK_GAP;\n const { roots, children, depth } = forestOf(graph, axes.cross);\n\n const bands = new Map<number, number>();\n for (const node of graph.nodes) {\n const at = depth.get(node.id) ?? 0;\n bands.set(at, Math.max(bands.get(at) ?? 0, extent(node.bounds, axes.rank)));\n }\n const bandStart = new Map<number, number>();\n let along = 0;\n for (const at of [...bands.keys()].sort((a, b) => a - b)) {\n bandStart.set(at, along);\n along += bands.get(at)! + rankGap;\n }\n\n const slots = new Map<string, Slot>();\n\n /* How wide `node`'s whole subtree is on the cross axis: its children's\n * blocks side by side, or the node itself when that is wider. /\n const measured = new Map<string, number>();\n const measure = (node: GraphNode): number => {\n const known = measured.get(node.id);\n if (known !== undefined) return known;\n const kids = children.get(node.id) ?? [];\n let width = 0;\n for (const child of kids) width += measure(child);\n if (kids.length > 0) width += nodeGap (kids.length - 1);\n const block = Math.max(extent(node.bounds, axes.cross), width);\n measured.set(node.id, block);\n return block;\n };\n\n /** Place `node`'s subtree with its block starting at `from`. /\n const place = (node: GraphNode, from: number): void => {\n const kids = children.get(node.id) ?? [];\n const block = measure(node);\n const width = kids.reduce((sum, k) => sum + measure(k), 0)\n + Math.max(0, kids.length - 1) nodeGap;\n\n let cursor = from + (block - width) / 2;\n for (const child of kids) {\n place(child, cursor);\n cursor += measure(child) + nodeGap;\n }\n\n const own = extent(node.bounds, axes.cross);\n const at = depth.get(node.id) ?? 0;\n slots.set(node.id, {\n cross: from + (block - own) / 2,\n rank: bandStart.get(at)! + (bands.get(at)! - extent(node.bounds, axes.rank)) / 2,\n });\n };\n\n let cursor = 0;\n for (const root of roots) {\n place(root, cursor);\n cursor += measure(root) + nodeGap;\n }\n\n return settle(graph, slots, opts);\n};\n","/*\n Running a layout against a scene: `LAYOUTS`, one batch of pose writes, and\n * the action that reaches both.\n \n The split is the point. A layout is a pure function of the graph and is\n * tested as one; `applyLayout` is the only thing that touches a scene, and it\n * writes every move inside a single `scene.batch`, so a re-layout is one undo\n * entry rather than one per node.\n /\nimport {\n translatePoseViaDescriptor,\n AUTO_POSE_DESCRIPTOR,\n type Action,\n type PoseDescriptor,\n type Scene,\n} from '@weasel-js/core';\nimport { force } from './force';\nimport { buildGraph, type GraphSource } from './graph';\nimport { layered } from './layered';\nimport { tree } from './tree';\nimport type { LayoutFn, LayoutOptions, LayoutResult } from './layout';\nimport type { DiagramNodeReader } from './trait';\n\n/* The layouts this package ships. A consumer's own go in the same shape. /\nexport const LAYOUTS: Readonly<Record<string, LayoutFn>> = Object.freeze({\n layered,\n tree,\n force,\n});\n\nexport interface ApplyLayoutOptions<TPose> {\n geometry?: PoseDescriptor<TPose>;\n /* The undo entry's name. Default `'Layout'`. /\n label?: string;\n}\n\n/\n Write a layout's answer to the scene, as one undoable batch.\n \n Returns how many nodes moved, which is zero for a layout that had nothing to\n * do — nothing is written and no history entry is pushed.\n \n Nodes are translated, never re-posed from the layout's numbers: a node's\n * pose can be a path or anything else a consumer wired, and only its own\n * descriptor knows how to move one.\n \n A participant that is a container takes its whole subtree along. `setPose`\n * does not cascade — poses are absolute — so a built body would otherwise walk\n * out from under its own label rows with every test green.\n /\nexport function applyLayout<TPose>(\n scene: Scene<unknown, string, TPose>,\n result: LayoutResult,\n opts: ApplyLayoutOptions<TPose> = {},\n): number {\n const poses = layoutPoses(scene, result, opts.geometry);\n if (poses.size === 0) return 0;\n scene.batch(opts.label ?? 'Layout', () => {\n for (const [id, pose] of poses) scene.setPose(id as never, pose);\n });\n // Participants, not the descendants they carried along: a caller asking how\n // much a layout did means the nodes it placed.\n let moved = 0;\n for (const id of result.keys()) if (poses.has(id)) moved++;\n return moved;\n}\n\n/\n The poses a layout result implies, without writing any of them: each moved\n * node translated to its new top-left, and its subtree translated with it.\n \n Split out because a live layout needs the same answer every frame and must\n * not write it — it publishes to the override channel and commits once. The\n * translation is measured from the node's document pose, which a run in flight\n * never changes, so a frame's answer does not depend on the frame before it.\n /\nexport function layoutPoses<TPose>(\n scene: Scene<unknown, string, TPose>,\n result: LayoutResult,\n geometry: PoseDescriptor<TPose> = AUTO_POSE_DESCRIPTOR as PoseDescriptor<TPose>,\n): Map<string, TPose> {\n const out = new Map<string, TPose>();\n for (const [id, at] of result) {\n const node = scene.get(id as never);\n if (node === undefined) continue;\n const bounds = geometry.getBounds(node.pose);\n const dx = at.x - bounds.x;\n const dy = at.y - bounds.y;\n if (dx === 0 && dy === 0) continue;\n out.set(id, translatePoseViaDescriptor(node.pose, dx, dy, geometry));\n for (const descendant of subtreeOf(scene, id)) {\n const child = scene.get(descendant as never);\n if (child === undefined) continue;\n out.set(descendant, translatePoseViaDescriptor(child.pose, dx, dy, geometry));\n }\n }\n return out;\n}\n\nfunction subtreeOf<TPose>(scene: Scene<unknown, string, TPose>, id: string): string[] {\n const out: string[] = [];\n const stack = [...scene.childrenOf(id as never)];\n while (stack.length > 0) {\n const next = stack.pop()!;\n out.push(next);\n stack.push(...scene.childrenOf(next));\n }\n return out;\n}\n\n/* The default action id. /\nexport const LAYOUT_ACTION_ID = 'diagram.layout';\n\nexport interface LayoutActionOptions<TPose> {\n /* Where the graph is read from. The same thunk the port affordance takes. /\n source: GraphSource<TPose>;\n /* Default {@link LAYOUT_ACTION_ID}. /\n id?: string;\n label?: string;\n /* Which `<ActionBar group>` it lands in. Default `'diagram'`, alongside\n * connect — give a bar of its own a group of its own. /\n group?: string;\n /* A key in {@link LAYOUTS}, or a layout of the consumer's own. Default\n * `'layered'`. /\n algorithm?: string \| LayoutFn;\n layout?: LayoutOptions;\n read?: DiagramNodeReader;\n geometry?: PoseDescriptor<TPose>;\n}\n\n/\n `diagram.layout` — rebuild the graph, run a layout, write the result.\n \n A factory rather than a singleton for the reason every other entry point in\n * this package is one: which nodes are in the diagram is the consumer's, and\n * this package has no scene at module scope.\n /\nexport function createLayoutAction<TPose>(opts: LayoutActionOptions<TPose>): Action {\n const algorithm = typeof opts.algorithm === 'function'\n ? opts.algorithm\n : LAYOUTS[opts.algorithm ?? 'layered'] ?? layered;\n const build = {\n ...(opts.read ? { read: opts.read } : {}),\n ...(opts.geometry ? { geometry: opts.geometry } : {}),\n };\n\n return {\n id: opts.id ?? LAYOUT_ACTION_ID,\n label: opts.label ?? 'Lay out diagram',\n group: opts.group ?? 'diagram',\n requires: ['scene'],\n invoker: {\n timing: 'immediate',\n run: (deps) => {\n const scene = deps['scene'] as Scene<unknown, string, TPose> \| undefined;\n if (scene === undefined) return;\n const graph = buildGraph(opts.source, build);\n applyLayout(scene, algorithm(graph, opts.layout), {\n ...(opts.geometry ? { geometry: opts.geometry } : {}),\n ...(opts.label ? { label: opts.label } : {}),\n });\n },\n },\n enabled: () => true as const,\n };\n}\n","/\n Layout you can watch, and push against.\n \n A live layout is a producer on core's `usePoseRun`: each frame it hands back\n * where the participants are, the run publishes that to the scene's override\n * channel, and the whole thing commits as one batch when it settles. Nothing\n * here writes the document.\n \n Two producers, because the two kinds of layout are different processes.\n * `force` is a relaxation whose target changes every tick. `layered` and `tree`\n * know where they are going before they start, so they ease into it.\n \n A node another gesture owns is a pin. The run reports it, `force` holds\n * it with `fx`/`fy` and relaxes its neighbors around it, and an eased layout\n * simply leaves it alone. Dragging a body mid-run is therefore the consumer's\n * ordinary move tool — this package contributes no gesture for it.\n /\nimport { useCallback, useEffect, useMemo, useRef } from 'react';\nimport {\n AUTO_POSE_DESCRIPTOR,\n usePoseRun,\n type EasingFn,\n type NodeId,\n type PoseDescriptor,\n type PoseRunCtx,\n type PoseRunStep,\n type Scene,\n} from '@weasel-js/core';\nimport { forceRelaxation, type ForceOptions } from './force';\nimport { buildGraph, type Graph, type GraphSource } from './graph';\nimport { layered } from './layered';\nimport { LAYOUTS, layoutPoses } from './layoutAction';\nimport { center, type LayoutFn, type LayoutOptions, type LayoutResult } from './layout';\nimport { tree } from './tree';\nimport type { DiagramNodeReader } from './trait';\n\n/* What a live producer is told, and what it answers with. /\nexport interface LiveLayoutCtx<TPose> {\n /* Nodes another gesture is moving, and where each is drawn. /\n pinned: ReadonlyMap<NodeId, TPose>;\n /* Frames since this run heated, starting at 0. /\n frame: number;\n}\n\n/* A frame of a live layout: where the participants are, and whether it is\n * finished. Positions are top-lefts, the same as a `LayoutResult`. /\nexport interface LiveLayoutFrame {\n result: LayoutResult;\n done: boolean;\n}\n\nexport type LiveLayoutProducer<TPose> = (ctx: LiveLayoutCtx<TPose>) => LiveLayoutFrame;\n\n/* How long an eased layout takes to arrive, in frames. Frame-counted rather\n * than timed, so a background tab resumes where it paused rather than\n * arriving the instant it comes back. /\nconst EASE_FRAMES = 24;\n\n/* Smooth start and end. Inlined rather than pulled from the animator, which\n * is a registry of running tweens, not a curve library. /\nconst easeInOut: EasingFn = (t) => (t < 0.5 ? 2 t * t : 1 - (-2 * t + 2) 2 / 2);\n\nexport interface ForceProducerOptions<TPose> extends ForceOptions {\n geometry?: PoseDescriptor<TPose>;\n / Alpha held while something is pinned, so the graph keeps answering a drag\n * instead of freezing under it. Default 0.3. /\n dragAlpha?: number;\n}\n\n/\n A relaxation, one tick a frame, done when the simulation settles.\n \n The forces are `forceRelaxation`'s — the same ones the one-shot `force`\n * runs, wound up once here and ticked rather than run to completion.\n \n It does not re-anchor the way the one-shot does. That translation exists\n * so a single 300-tick jump does not move the diagram off where the author left\n * it; a live run cannot jump, every frame being one step from the last, and\n * gravity holds the graph around the centroid it was seeded from. Re-anchoring\n * per frame would also fight a drag: the anchor is measured from where the\n * nodes were, and a pinned node is deliberately somewhere else.\n /\nexport function forceProducer<TPose>(\n graph: Graph,\n opts: ForceProducerOptions<TPose> = {},\n): LiveLayoutProducer<TPose> {\n const geometry = opts.geometry ?? (AUTO_POSE_DESCRIPTOR as PoseDescriptor<TPose>);\n const relaxation = forceRelaxation(graph, opts);\n const dragAlpha = opts.dragAlpha ?? 0.3;\n\n return ({ pinned }) => {\n for (const node of graph.nodes) {\n const body = relaxation.byId.get(node.id);\n if (body === undefined) continue;\n const held = pinned.get(node.id as NodeId);\n if (held !== undefined) {\n // A dragged node holds its neighbors while they relax, which is `fx` /\n // `fy` on the integrator rather than a correction applied afterward.\n const bounds = geometry.getBounds(held);\n body.fx = center(bounds, 'x');\n body.fy = center(bounds, 'y');\n } else if (!relaxation.pinned.has(node.id)) {\n delete body.fx;\n delete body.fy;\n }\n }\n // A pin is a live edit, so the run keeps its temperature up until the\n // pointer lets go.\n relaxation.sim.alphaTarget(pinned.size > 0 ? dragAlpha : 0);\n relaxation.sim.tick();\n return { result: relaxation.placed(), done: relaxation.sim.isSettled() };\n };\n}\n\nexport interface EasedProducerOptions {\n layout?: LayoutOptions;\n /* Frames to arrive in. Default 24. /\n frames?: number;\n easing?: EasingFn;\n}\n\n/\n A layout that knows its destination, walked into place.\n \n The target is computed once, from the graph as it stood when the run heated;\n * each frame is that target scaled by the easing curve, measured from where the\n * nodes started. A pinned node is dropped from the target rather than fought\n * over.\n /\nexport function easedProducer<TPose>(\n graph: Graph,\n algorithm: LayoutFn,\n opts: EasedProducerOptions = {},\n): LiveLayoutProducer<TPose> {\n const frames = opts.frames ?? EASE_FRAMES;\n const easing = opts.easing ?? easeInOut;\n const target = algorithm(graph, opts.layout);\n const from = new Map<string, { x: number; y: number }>();\n for (const node of graph.nodes) from.set(node.id, { x: node.bounds.x, y: node.bounds.y });\n\n return ({ pinned, frame }) => {\n const t = Math.min((frame + 1) / frames, 1);\n const u = easing(t);\n const result = new Map<string, { x: number; y: number }>();\n for (const [id, to] of target) {\n if (pinned.has(id as NodeId)) continue;\n const start = from.get(id);\n if (start === undefined) continue;\n result.set(id, {\n x: start.x + (to.x - start.x) u,\n y: start.y + (to.y - start.y) * u,\n });\n }\n return { result, done: t >= 1 };\n };\n}\n\nexport interface UseLiveLayoutOptions<TPose> {\n scene: Scene<unknown, string, TPose>;\n /** Where the graph is read from. The same thunk the port affordance takes. /\n source: GraphSource<TPose>;\n /* A key in `LAYOUTS`, or a layout of the consumer's own. `'force'` relaxes\n * continuously; anything else eases to its answer. Default `'force'`. /\n algorithm?: string \| LayoutFn;\n layout?: LayoutOptions;\n force?: ForceOptions;\n /* Frames an eased layout takes to arrive. Default 24. /\n frames?: number;\n easing?: EasingFn;\n read?: DiagramNodeReader;\n geometry?: PoseDescriptor<TPose>;\n /* The undo entry's name. Default `'Layout'`. /\n label?: string;\n /* Fires once the run has settled or been stopped and its poses are in the\n * document, with how many participants moved. /\n onSettle?: (moved: number) => void;\n /* Whether a node or edge appearing or disappearing re-heats the run.\n * Default true — a diagram that ignores a new edge looks broken. /\n reheatOnGraphChange?: boolean;\n /* Clock injection, for tests. Defaults to `requestAnimationFrame`. /\n requestFrame?: (cb: (t: number) => void) => number;\n cancelFrame?: (handle: number) => void;\n}\n\nexport interface LiveLayout {\n /* Heat and run. Idempotent while running. /\n start(): void;\n /* Finish now: commit where the nodes stand. /\n stop(): void;\n /* Abandon: the document keeps the poses it had. /\n cancel(): void;\n /* Rebuild the graph and run again from where the nodes are now. /\n restart(): void;\n isRunning(): boolean;\n}\n\n/* The shape of a graph, as a string that changes when a node or edge does. /\nfunction shapeOf(graph: Graph): string {\n const nodes = graph.nodes.map((n) => n.id).sort().join(',');\n const edges = graph.edges.map((e) => `${e.from}>${e.to}`).sort().join(',');\n return `${nodes}\|${edges}`;\n}\n\n/\n Run a layout live against a scene.\n \n The returned handle is stable. Dragging a participant while it runs needs no\n * wiring: the consumer's move tool publishes an override, and the run treats\n * that as a pin.\n /\nexport function useLiveLayout<TPose>(opts: UseLiveLayoutOptions<TPose>): LiveLayout {\n const optsRef = useRef(opts);\n optsRef.current = opts;\n\n const producer = useRef<LiveLayoutProducer<TPose> \| null>(null);\n const producerFrame = useRef(0);\n const shape = useRef('');\n\n const build = useCallback((): void => {\n const o = optsRef.current;\n const graph = buildGraph(o.source, {\n ...(o.read ? { read: o.read } : {}),\n ...(o.geometry ? { geometry: o.geometry } : {}),\n });\n shape.current = shapeOf(graph);\n producerFrame.current = 0;\n const algorithm = o.algorithm ?? 'force';\n if (algorithm === 'force') {\n producer.current = forceProducer<TPose>(graph, {\n ...o.layout, ...o.force,\n ...(o.geometry ? { geometry: o.geometry } : {}),\n });\n return;\n }\n const fn = typeof algorithm === 'function' ? algorithm : LAYOUTS[algorithm] ?? layered;\n producer.current = easedProducer<TPose>(graph, fn, {\n ...(o.layout ? { layout: o.layout } : {}),\n ...(o.frames === undefined ? {} : { frames: o.frames }),\n ...(o.easing ? { easing: o.easing } : {}),\n });\n }, []);\n\n const step = useCallback((ctx: PoseRunCtx<TPose>): PoseRunStep<TPose> => {\n const o = optsRef.current;\n if (producer.current === null) return { poses: [], done: true };\n const { result, done } = producer.current({\n pinned: ctx.pinned,\n frame: producerFrame.current++,\n });\n // A pinned participant takes its subtree out of the frame with it. The run\n // skips the participant itself, but its rows and labels are ids of their\n // own — left in, they would be published from the pose the document still\n // holds while the gesture carries the box somewhere else.\n let placed = result;\n if (ctx.pinned.size > 0) {\n const held = new Map(result);\n for (const id of ctx.pinned.keys()) held.delete(id as string);\n placed = held;\n }\n const poses = layoutPoses(o.scene, placed, o.geometry);\n return { poses: [...poses] as [NodeId, TPose][], done };\n }, []);\n\n const run = usePoseRun<TPose>({\n scene: opts.scene,\n step,\n onCommit: (moved) => optsRef.current.onSettle?.(moved),\n ...(opts.label ? { label: opts.label } : {}),\n ...(opts.requestFrame ? { requestFrame: opts.requestFrame } : {}),\n ...(opts.cancelFrame ? { cancelFrame: opts.cancelFrame } : {}),\n });\n\n // A node or edge appearing or disappearing is a new problem, so the run\n // re-heats rather than finishing the one it started on.\n useEffect(() => {\n if (opts.reheatOnGraphChange === false) return;\n return opts.scene.subscribe(() => {\n if (!run.isRunning()) return;\n const o = optsRef.current;\n const graph = buildGraph(o.source, {\n ...(o.read ? { read: o.read } : {}),\n ...(o.geometry ? { geometry: o.geometry } : {}),\n });\n if (shapeOf(graph) === shape.current) return;\n build();\n });\n }, [opts.scene, opts.reheatOnGraphChange, run, build]);\n\n return useMemo<LiveLayout>(() => ({\n start() {\n if (run.isRunning()) return;\n build();\n run.start();\n },\n stop: () => { run.stop(); },\n cancel: () => { run.cancel(); },\n restart() {\n run.cancel();\n build();\n run.start();\n },\n isRunning: () => run.isRunning(),\n }), [run, build]);\n}\n\n/* The layouts that ease rather than relax, for a consumer choosing one. /\nexport const EASED_LAYOUTS: Readonly<Record<string, LayoutFn>> = Object.freeze({\n layered,\n tree,\n});\n","/\n The painter for a node whose trait names an `outline`.\n \n Registered the way every other trait's renderer is — a `NodeShapeEntry` with\n * a `matches` over the node's data — so a diagram body is picked, clipped and\n * area-selected by the same walk as everything else, and a participant that\n * already had a look of its own (a text block, an image, a path) keeps it by\n * naming no outline at all.\n \n Rows are not painted here. A built body's rows are ordinary scene nodes\n * under the container, so the kit's own text painter draws them and text\n * editing, selection and styling work on them without a special case.\n /\nimport {\n RECT_POSE_DESCRIPTOR,\n registerNodeShape,\n type FillStyle,\n type NodeShapeEntry,\n type PoseDescriptor,\n type Stroke,\n} from '@weasel-js/core';\nimport { outlinePath } from './outline';\nimport { diagramNodeOf, type DiagramNodeReader } from './trait';\n\nexport interface DiagramShapeOptions<TPose> {\n /* Distinguishes one registration from another, and is what the disposer\n * removes. Default `'diagram:outline'`. /\n id?: string;\n /* How the trait is read. Default: the node's own `data.diagram`. /\n read?: DiagramNodeReader;\n /* Reads the box the outline is built in. Default `RECT_POSE_DESCRIPTOR`. /\n geometry?: PoseDescriptor<TPose>;\n /* Painted when the node's data declares neither. /\n defaultFill?: FillStyle \| null;\n defaultStroke?: Stroke \| null;\n}\n\n/* The entry, for a consumer composing their own painter list. /\nexport function diagramShape<TPose>(\n opts: DiagramShapeOptions<TPose> = {},\n): NodeShapeEntry<unknown, TPose> {\n const geometry = opts.geometry ?? (RECT_POSE_DESCRIPTOR as PoseDescriptor<TPose>);\n const outlineOf = (node: { id: string; kind: 'leaf' \| 'container'; data: unknown }) =>\n diagramNodeOf(node, opts.read)?.outline;\n\n return {\n id: opts.id ?? 'diagram:outline',\n matches: (node) => outlineOf(node) !== undefined,\n paint: (node, pose) => {\n const outline = outlineOf(node);\n if (outline === undefined) return [];\n const d = node.data as { fill?: FillStyle \| null; stroke?: Stroke \| null };\n const fill = d.fill === undefined ? opts.defaultFill : d.fill;\n const stroke = d.stroke === undefined ? opts.defaultStroke : d.stroke;\n return [{\n kind: 'path',\n path: outlinePath(outline, geometry.getBounds(pose)),\n ...(fill ? { fill } : {}),\n ...(stroke ? { stroke } : {}),\n }];\n },\n // The drawn boundary, so picking and clipping follow the diamond rather\n // than its bounding box.\n silhouette: (node, pose) => {\n const outline = outlineOf(node);\n return outline === undefined ? null : outlinePath(outline, geometry.getBounds(pose));\n },\n };\n}\n\n/\n Register {@link diagramShape}. Returns the disposer, and takes `'high'`\n * priority so a body outline wins over a `data.shape` or `data.path` the same\n * node may also carry.\n */\nexport function registerDiagramShape<TPose>(opts: DiagramShapeOptions<TPose> = {}): () => void {\n return registerNodeShape(diagramShape(opts), { priority: 'high' });\n}\n"]}

package/package.json CHANGED Viewed

@@ -1,6 +1,6 @@
 {
   "name": "@weasel-js/diagram",
-  "version": "1.4.4",
+  "version": "1.5.0",
   "description": "Node-link diagramming for weasel: any scene node becomes a diagram participant, with ports on its perimeter and an optional body builder for flowchart-shaped boxes.",
   "license": "MIT",
   "type": "module",
@@ -17,7 +17,7 @@
   },
   "peerDependencies": {
     "react": ">=18",
-    "@weasel-js/core": "1.4.4"
+    "@weasel-js/core": "1.5.0"
   },
   "author": "orochi235",
   "homepage": "https://orochi235.github.io/weasel/",