@knowvah/dot-engine 0.1.0

package/dist/label/index.d.ts

@@ -0,0 +1,74 @@
+/**
+ * R-tree public API: open/close/insert/search.
+ * @see label/index.h
+ * @see label/index.c
+ */
+import { type Rect } from './rectangle.js';
+import { type Node, type SplitQ } from './node.js';
+import './split-q.js';
+/**
+ * An R-tree leaf: the bounding rect and the caller-supplied data pointer.
+ *
+ * In C this is `Leaf_t { Rect_t rect; void *data; }` and a leaf branch is
+ * cast directly to Leaf_t* — `branch[i].child` holds the data pointer while
+ * `branch[i].rect` is the bounding rectangle.  We replicate that layout here.
+ *
+ * @see label/index.h:Leaf_t
+ */
+export interface Leaf {
+    rect: Rect;
+    /** Caller-supplied opaque data (C: void *). */
+    data: unknown;
+}
+/**
+ * R-tree: root node plus the SplitQ scratchpad.
+ * @see label/index.h:struct RTree
+ */
+export interface RTree {
+    root: Node | null;
+    split: SplitQ;
+}
+/**
+ * Allocate and initialise a new R-tree.
+ * @see label/index.c:RTreeOpen
+ */
+export declare function rTreeOpen(): RTree;
+/**
+ * Close (free) the R-tree.
+ * In GC'd TS this is a no-op in practice, but we walk and clear the tree
+ * faithfully to mirror the C version and release references eagerly.
+ * @see label/index.c:RTreeClose
+ */
+export declare function rTreeClose(rtp: RTree): void;
+/**
+ * Make a new empty index (single leaf node at level 0).
+ * @see label/index.c:RTreeNewIndex
+ */
+export declare function rTreeNewIndex(): Node;
+/**
+ * Search the index for all data rectangles overlapping `r`.
+ *
+ * Returns a Leaf[] whose iteration order matches C's LeafList_t traversal:
+ * within each leaf node hits are in reverse branch-slot order (list-cons
+ * prepend); across internal-node children results are in forward slot order.
+ *
+ * @see label/index.c:RTreeSearch
+ */
+export declare function rTreeSearch(rtp: RTree, n: Node, r: Rect): Leaf[];
+/**
+ * Insert a data rectangle into the index.
+ * Returns 1 if root was split, 0 otherwise. Updates rtp.root on split.
+ * @see label/index.c:RTreeInsert
+ */
+export declare function rTreeInsert(rtp: RTree, r: Rect, data: unknown): number;
+/**
+ * Free a LeafList.  In GC'd TypeScript this is a documented no-op stub;
+ * the caller may discard the Leaf[] returned by rTreeSearch without calling
+ * this function.
+ *
+ * Kept as a named export so callers ported from C can call it without change.
+ *
+ * @see label/index.c:RTreeLeafListFree
+ */
+export declare function rTreeLeafListFree(_leaves: Leaf[]): void;
+//# sourceMappingURL=index.d.ts.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../src/label/index.ts"],"names":[],"mappings":"AAEA;;;;GAIG;AAEH,OAAO,EAAE,KAAK,IAAI,EAAiC,MAAM,gBAAgB,CAAC;AAC1E,OAAO,EAGL,KAAK,IAAI,EACT,KAAK,MAAM,EAOZ,MAAM,WAAW,CAAC;AAInB,OAAO,cAAc,CAAC;AAMtB;;;;;;;;GAQG;AACH,MAAM,WAAW,IAAI;IACnB,IAAI,EAAE,IAAI,CAAC;IACX,+CAA+C;IAC/C,IAAI,EAAE,OAAO,CAAC;CACf;AAED;;;GAGG;AACH,MAAM,WAAW,KAAK;IACpB,IAAI,EAAE,IAAI,GAAG,IAAI,CAAC;IAClB,KAAK,EAAE,MAAM,CAAC;CACf;AAyDD;;;GAGG;AACH,wBAAgB,SAAS,IAAI,KAAK,CAEjC;AAsBD;;;;;GAKG;AACH,wBAAgB,UAAU,CAAC,GAAG,EAAE,KAAK,GAAG,IAAI,CAK3C;AAED;;;GAGG;AACH,wBAAgB,aAAa,IAAI,IAAI,CAIpC;AA4CD;;;;;;;;GAQG;AACH,wBAAgB,WAAW,CAAC,GAAG,EAAE,KAAK,EAAE,CAAC,EAAE,IAAI,EAAE,CAAC,EAAE,IAAI,GAAG,IAAI,EAAE,CAGhE;AA8DD;;;;GAIG;AACH,wBAAgB,WAAW,CAAC,GAAG,EAAE,KAAK,EAAE,CAAC,EAAE,IAAI,EAAE,IAAI,EAAE,OAAO,GAAG,MAAM,CAOtE;AAED;;;;;;;;GAQG;AACH,wBAAgB,iBAAiB,CAAC,OAAO,EAAE,IAAI,EAAE,GAAG,IAAI,CAEvD"}

package/dist/label/node.d.ts

@@ -0,0 +1,108 @@
+/**
+ * R-tree node types and node-level operations.
+ * @see label/node.h
+ * @see label/node.c
+ * @see label/index.h
+ */
+import { type Rect } from './rectangle.js';
+/** @see label/index.h:NODECARD */
+export declare const NODECARD = 64;
+/**
+ * A single branch in an R-tree node: a bounding rectangle and a child pointer.
+ * @see label/node.h:Branch_t
+ */
+export interface Branch {
+    rect: Rect;
+    /** null means this slot is empty; pointer to child Node otherwise */
+    child: Node | null;
+}
+/**
+ * An R-tree node: up to NODECARD branches.
+ * level 0 = leaf, positive = internal.
+ * @see label/node.h:Node_t
+ */
+export interface Node {
+    count: number;
+    /** 0 is leaf, others positive */
+    level: number;
+    branch: Branch[];
+}
+/**
+ * Per-split partition bookkeeping.
+ * @see label/split.q.h:PartitionVars
+ */
+export interface PartitionVars {
+    partition: number[];
+    taken: boolean[];
+    count: [number, number];
+    cover: [Rect, Rect];
+    area: [number, number];
+}
+/**
+ * Quadratic-split scratchpad stored in the RTree.
+ * @see label/split.q.h:SplitQ_t / split_q_s
+ */
+export interface SplitQ {
+    branchBuf: Branch[];
+    coverSplit: Rect;
+    coverSplitArea: number;
+    partitions: PartitionVars[];
+}
+/**
+ * Minimal RTree fields touched by node.c and split.q.c.
+ * T3 (index.c) will flesh out the full RTree type; this structural
+ * base keeps T2 self-contained.
+ * @see label/index.h:struct RTree
+ */
+export interface RTreeBase {
+    root: Node | null;
+    split: SplitQ;
+}
+/** Build an empty SplitQ. */
+export declare function makeSplitQ(): SplitQ;
+/**
+ * Initialize one branch cell: zeroed rect, null child.
+ * @see label/node.c:InitBranch
+ */
+export declare function initBranch(b: Branch): void;
+/**
+ * Initialize a Node structure: count=0, level=-1, all branches empty.
+ * @see label/node.c:InitNode
+ */
+export declare function initNode(n: Node): void;
+/**
+ * Allocate and initialize a new Node.
+ * @see label/node.c:RTreeNewNode
+ */
+export declare function rTreeNewNode(): Node;
+/** Smallest rect enclosing all occupied branch rects. @see label/node.c:NodeCover */
+export declare function nodeCover(n: Node): Rect;
+/**
+ * Pick the branch that will need the smallest area increase to
+ * accommodate rect r. Ties broken by smaller current area.
+ * @see label/node.c:PickBranch
+ */
+export declare function pickBranch(r: Rect, n: Node): number;
+/**
+ * Add a branch to a node. Splits the node if necessary.
+ * Returns 0 if no split; old node updated.
+ * Returns 1 if split; newNodeOut.value set to the new node.
+ *
+ * Cycle note: addBranch → splitNode (split-q.ts) → loadNodes → addBranch.
+ * Resolved via late-binding shim below; both modules fully initialised
+ * before any function executes at runtime.
+ * @see label/node.c:AddBranch
+ */
+export declare function addBranch(rtp: RTreeBase, b: Branch, n: Node, newNodeOut: {
+    value: Node | null;
+}): number;
+/**
+ * Disconnect a dependent node (clears branch slot, decrements count).
+ * @see label/node.c:DisconBranch
+ */
+export declare function disconnectBranch(n: Node, i: number): void;
+/** Register the splitNode implementation. Called by split-q.ts at load time. */
+export declare function registerSplitNode(impl: (rtp: RTreeBase, n: Node, b: Branch, newNodeOut: {
+    value: Node | null;
+}) => void): void;
+//# sourceMappingURL=node.d.ts.map

package/dist/label/node.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"node.d.ts","sourceRoot":"","sources":["../../src/label/node.ts"],"names":[],"mappings":"AAEA;;;;;GAKG;AAEH,OAAO,EAAE,KAAK,IAAI,EAA6C,MAAM,gBAAgB,CAAC;AAUtF,kCAAkC;AAClC,eAAO,MAAM,QAAQ,KAAK,CAAC;AAS3B;;;GAGG;AACH,MAAM,WAAW,MAAM;IACrB,IAAI,EAAE,IAAI,CAAC;IACX,qEAAqE;IACrE,KAAK,EAAE,IAAI,GAAG,IAAI,CAAC;CACpB;AAED;;;;GAIG;AACH,MAAM,WAAW,IAAI;IACnB,KAAK,EAAE,MAAM,CAAC;IACd,iCAAiC;IACjC,KAAK,EAAE,MAAM,CAAC;IACd,MAAM,EAAE,MAAM,EAAE,CAAC;CAClB;AAED;;;GAGG;AACH,MAAM,WAAW,aAAa;IAC5B,SAAS,EAAE,MAAM,EAAE,CAAC;IACpB,KAAK,EAAE,OAAO,EAAE,CAAC;IACjB,KAAK,EAAE,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;IACxB,KAAK,EAAE,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC;IACpB,IAAI,EAAE,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;CACxB;AAED;;;GAGG;AACH,MAAM,WAAW,MAAM;IACrB,SAAS,EAAE,MAAM,EAAE,CAAC;IACpB,UAAU,EAAE,IAAI,CAAC;IACjB,cAAc,EAAE,MAAM,CAAC;IACvB,UAAU,EAAE,aAAa,EAAE,CAAC;CAC7B;AAED;;;;;GAKG;AACH,MAAM,WAAW,SAAS;IACxB,IAAI,EAAE,IAAI,GAAG,IAAI,CAAC;IAClB,KAAK,EAAE,MAAM,CAAC;CACf;AAsBD,6BAA6B;AAC7B,wBAAgB,UAAU,IAAI,MAAM,CAOnC;AAMD;;;GAGG;AACH,wBAAgB,UAAU,CAAC,CAAC,EAAE,MAAM,GAAG,IAAI,CAG1C;AAED;;;GAGG;AACH,wBAAgB,QAAQ,CAAC,CAAC,EAAE,IAAI,GAAG,IAAI,CAMtC;AAED;;;GAGG;AACH,wBAAgB,YAAY,IAAI,IAAI,CAKnC;AA4BD,qFAAqF;AACrF,wBAAgB,SAAS,CAAC,CAAC,EAAE,IAAI,GAAG,IAAI,CAWvC;AAED;;;;GAIG;AACH,wBAAgB,UAAU,CAAC,CAAC,EAAE,IAAI,EAAE,CAAC,EAAE,IAAI,GAAG,MAAM,CAUnD;AAED;;;;;;;;;GASG;AACH,wBAAgB,SAAS,CACvB,GAAG,EAAE,SAAS,EACd,CAAC,EAAE,MAAM,EACT,CAAC,EAAE,IAAI,EACP,UAAU,EAAE;IAAE,KAAK,EAAE,IAAI,GAAG,IAAI,CAAA;CAAE,GACjC,MAAM,CAiBR;AAED;;;GAGG;AACH,wBAAgB,gBAAgB,CAAC,CAAC,EAAE,IAAI,EAAE,CAAC,EAAE,MAAM,GAAG,IAAI,CAGzD;AAiBD,gFAAgF;AAChF,wBAAgB,iBAAiB,CAC/B,IAAI,EAAE,CAAC,GAAG,EAAE,SAAS,EAAE,CAAC,EAAE,IAAI,EAAE,CAAC,EAAE,MAAM,EAAE,UAAU,EAAE;IAAE,KAAK,EAAE,IAAI,GAAG,IAAI,CAAA;CAAE,KAAK,IAAI,GACrF,IAAI,CAEN"}

package/dist/label/rectangle.d.ts

@@ -0,0 +1,60 @@
+/**
+ * R-tree rectangle primitives.
+ * @see label/rectangle.h
+ * @see label/rectangle.c
+ * @see label/index.h
+ */
+/** @see label/index.h:NUMDIMS */
+export declare const NUMDIMS = 2;
+/** @see label/index.h:NUMSIDES (2*NUMDIMS) */
+export declare const NUMSIDES: number;
+/**
+ * Flat boundary array: [lowX, lowY, highX, highY].
+ * Indexed via CX/CY/NX/NY helpers matching the C macros.
+ * @see label/rectangle.h:Rect_t
+ */
+export interface Rect {
+    boundary: [number, number, number, number];
+}
+/** @see label/index.h:CX(i) — low side, x-axis offset i */
+export declare function CX(i: number): number;
+/** @see label/index.h:NX(i) — high side, x-axis offset i */
+export declare function NX(i: number): number;
+/** @see label/index.h:CY(i) — low side, y-axis offset i */
+export declare function CY(i: number): number;
+/** @see label/index.h:NY(i) — high side, y-axis offset i */
+export declare function NY(i: number): number;
+/**
+ * Initialize a rectangle to have all 0 coordinates.
+ * @see label/rectangle.c:InitRect
+ */
+export declare function initRect(r: Rect): void;
+/**
+ * Return a rect whose first low side is higher than its opposite side —
+ * interpreted as an undefined rect.
+ * C: boundary[0]=1, boundary[NUMDIMS]=-1, rest 0.
+ * @see label/rectangle.c:NullRect
+ */
+export declare function nullRect(): Rect;
+/**
+ * Calculate the n-dimensional area of a rectangle.
+ * Returns 0 for undefined rects or zero-width dimensions.
+ * Throws if area overflows Number.MAX_SAFE_INTEGER (browser-safe substitute
+ * for C's graphviz_exit on UINT64_MAX overflow).
+ * @see label/rectangle.c:RectArea
+ */
+export declare function rectArea(r: Rect): number;
+/**
+ * Combine two rectangles, making one that includes both.
+ * Uses fmin for both low and high sides — faithful to C source.
+ * @see label/rectangle.c:CombineRect
+ */
+export declare function combineRect(r: Rect, rr: Rect): Rect;
+/**
+ * Decide whether two rectangles overlap.
+ * C: for each dim i, false if r.lo[i] > s.hi[i] OR s.lo[i] > r.hi[i].
+ * Touching edges (equal) are considered overlapping (strict > only).
+ * @see label/rectangle.c:Overlap
+ */
+export declare function overlap(r: Rect, s: Rect): boolean;
+//# sourceMappingURL=rectangle.d.ts.map

package/dist/label/rectangle.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"rectangle.d.ts","sourceRoot":"","sources":["../../src/label/rectangle.ts"],"names":[],"mappings":"AAEA;;;;;GAKG;AAEH,iCAAiC;AACjC,eAAO,MAAM,OAAO,IAAI,CAAC;AAEzB,8CAA8C;AAC9C,eAAO,MAAM,QAAQ,QAAc,CAAC;AAEpC;;;;GAIG;AACH,MAAM,WAAW,IAAI;IACnB,QAAQ,EAAE,CAAC,MAAM,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,CAAC,CAAC;CAC5C;AAED,2DAA2D;AAC3D,wBAAgB,EAAE,CAAC,CAAC,EAAE,MAAM,GAAG,MAAM,CAAc;AAEnD,4DAA4D;AAC5D,wBAAgB,EAAE,CAAC,CAAC,EAAE,MAAM,GAAG,MAAM,CAAwB;AAE7D,2DAA2D;AAC3D,wBAAgB,EAAE,CAAC,CAAC,EAAE,MAAM,GAAG,MAAM,CAAkB;AAEvD,4DAA4D;AAC5D,wBAAgB,EAAE,CAAC,CAAC,EAAE,MAAM,GAAG,MAAM,CAA4B;AAWjE;;;GAGG;AACH,wBAAgB,QAAQ,CAAC,CAAC,EAAE,IAAI,GAAG,IAAI,CAItC;AAED;;;;;GAKG;AACH,wBAAgB,QAAQ,IAAI,IAAI,CAK/B;AAED;;;;;;GAMG;AACH,wBAAgB,QAAQ,CAAC,CAAC,EAAE,IAAI,GAAG,MAAM,CAaxC;AAED;;;;GAIG;AACH,wBAAgB,WAAW,CAAC,CAAC,EAAE,IAAI,EAAE,EAAE,EAAE,IAAI,GAAG,IAAI,CAWnD;AAED;;;;;GAKG;AACH,wBAAgB,OAAO,CAAC,CAAC,EAAE,IAAI,EAAE,CAAC,EAAE,IAAI,GAAG,OAAO,CAQjD"}

package/dist/label/split-q.d.ts

@@ -0,0 +1,13 @@
+import { type Branch, type Node, type RTreeBase } from './node.js';
+/**
+ * Split a node. Divides the node's branches and the extra one between two
+ * nodes. Old node is one of the two; a new node is created and returned via
+ * nn.value.
+ * @see label/split.q.c:SplitNode
+ */
+export declare function splitNode(rtp: RTreeBase, n: Node, b: Branch, nn: {
+    value: Node | null;
+}): void;
+declare const METHODS = 1;
+export { METHODS };
+//# sourceMappingURL=split-q.d.ts.map

package/dist/label/split-q.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"split-q.d.ts","sourceRoot":"","sources":["../../src/label/split-q.ts"],"names":[],"mappings":"AASA,OAAO,EAEL,KAAK,MAAM,EACX,KAAK,IAAI,EAET,KAAK,SAAS,EAKf,MAAM,WAAW,CAAC;AA4LnB;;;;;GAKG;AACH,wBAAgB,SAAS,CACvB,GAAG,EAAE,SAAS,EACd,CAAC,EAAE,IAAI,EACP,CAAC,EAAE,MAAM,EACT,EAAE,EAAE;IAAE,KAAK,EAAE,IAAI,GAAG,IAAI,CAAA;CAAE,GACzB,IAAI,CAON;AAQD,QAAA,MAAM,OAAO,IAAI,CAAC;AAGlB,OAAO,EAAE,OAAO,EAAE,CAAC"}

package/dist/label/xlabels-geom.d.ts

@@ -0,0 +1,46 @@
+/**
+ * Geometry helpers for xlabels: Hilbert code, rect conversions, AABB test.
+ * Internal — consumed only by xlabels-intersect.ts and xlabels.ts.
+ * @see lib/label/xlabels.c
+ */
+import { type Rect } from './rectangle.js';
+import { type ObjectT } from './xlabels.js';
+/**
+ * Compute Hilbert curve distance from origin to integer point (x,y) on an
+ * order-n Hilbert curve.  Ported from hackersdelight.org (Henry S. Warren).
+ *
+ * All arithmetic is 32-bit unsigned:
+ *   - `>>> 0`  coerces to Uint32 (correctly wraps -xi negation).
+ *   - `>>>`    unsigned right shift replaces C `>>` on signed ints.
+ *   - `& 0xFFFFFFFF` keeps intermediate values in 32-bit range.
+ *
+ * Precondition: 2^n >= max(px, py).
+ * @see lib/label/xlabels.c:hd_hil_s_from_xy
+ */
+export declare function hdHilSFromXy(px: number, py: number, n: number): number;
+/**
+ * Intersection area of two axis-aligned bounding boxes; 0 when disjoint.
+ * @see lib/label/xlabels.c:aabbaabb
+ */
+export declare function aabbaabb(r: Rect, s: Rect): number;
+/**
+ * Build a Rect from object position + size.
+ * @see lib/label/xlabels.c:objp2rect
+ */
+export declare function objp2rect(op: ObjectT): Rect;
+/**
+ * Build a Rect from the object's attached xlabel position + size.
+ * @see lib/label/xlabels.c:objplp2rect
+ */
+export declare function objplp2rect(objp: ObjectT): Rect;
+/**
+ * Build the bounding Rect enclosing all possible label positions for objp.
+ * @see lib/label/xlabels.c:objplpmks
+ */
+export declare function objplpmks(objp: ObjectT): Rect;
+/**
+ * True if size-zero object objp1 is enclosed within objp's label rectangle.
+ * @see lib/label/xlabels.c:lblenclosing
+ */
+export declare function lblenclosing(objp: ObjectT, objp1: ObjectT): boolean;
+//# sourceMappingURL=xlabels-geom.d.ts.map

package/dist/label/xlabels-geom.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"xlabels-geom.d.ts","sourceRoot":"","sources":["../../src/label/xlabels-geom.ts"],"names":[],"mappings":"AACA;;;;GAIG;AAGH,OAAO,EAAE,KAAK,IAAI,EAAW,MAAM,gBAAgB,CAAC;AACpD,OAAO,EAAE,KAAK,OAAO,EAAgB,MAAM,cAAc,CAAC;AAO1D;;;;;;;;;;;GAWG;AACH,wBAAgB,YAAY,CAAC,EAAE,EAAE,MAAM,EAAE,EAAE,EAAE,MAAM,EAAE,CAAC,EAAE,MAAM,GAAG,MAAM,CAiBtE;AAMD;;;GAGG;AACH,wBAAgB,QAAQ,CAAC,CAAC,EAAE,IAAI,EAAE,CAAC,EAAE,IAAI,GAAG,MAAM,CAOjD;AAMD;;;GAGG;AACH,wBAAgB,SAAS,CAAC,EAAE,EAAE,OAAO,GAAG,IAAI,CAW3C;AAED;;;GAGG;AACH,wBAAgB,WAAW,CAAC,IAAI,EAAE,OAAO,GAAG,IAAI,CAW/C;AAED;;;GAGG;AACH,wBAAgB,SAAS,CAAC,IAAI,EAAE,OAAO,GAAG,IAAI,CAU7C;AAED;;;GAGG;AACH,wBAAgB,YAAY,CAAC,IAAI,EAAE,OAAO,EAAE,KAAK,EAAE,OAAO,GAAG,OAAO,CASnE"}

package/dist/label/xlabels-intersect.d.ts

@@ -0,0 +1,79 @@
+/**
+ * Neighbour-grid intersection recording and xladjust position search.
+ * Internal — consumed only by xlabels.ts.
+ * @see lib/label/xlabels.c
+ */
+import { type Rect } from './rectangle.js';
+import { type RTree } from './index.js';
+import { type ObjectT } from './xlabels.js';
+/** @see lib/label/xlabels.h:XLXDENOM */
+export declare const XLXDENOM = 8;
+/** @see lib/label/xlabels.h:XLYDENOM */
+export declare const XLYDENOM = 2;
+/** 9-neighbour grid size. @see lib/label/xlabels.h:XLNBR */
+export declare const XLNBR = 9;
+/**
+ * Best-position accumulator.
+ * @see lib/label/xlabels.h:BestPos_t
+ */
+export interface BestPosT {
+    n: number;
+    area: number;
+    pos: {
+        x: number;
+        y: number;
+    };
+}
+/**
+ * XLabels state bundle (forward-declared interface; full type in xlabels.ts).
+ */
+export interface XLabelsState {
+    objs: ObjectT[];
+    nObjs: number;
+    spdx: RTree;
+}
+/**
+ * Record intersecting object in neighbour grid.
+ * @see lib/label/xlabels.c:recordointrsx
+ */
+export declare function recordointrsx(op: ObjectT, cp: ObjectT, rp: Rect, a: number, intrsx: (ObjectT | null)[]): number;
+/**
+ * Record intersecting label in neighbour grid.
+ * @see lib/label/xlabels.c:recordlintrsx
+ */
+export declare function recordlintrsx(op: ObjectT, cp: ObjectT, rp: Rect, a: number, intrsx: (ObjectT | null)[]): number;
+/**
+ * Find all objects/labels intersecting objp's current label position.
+ * @see lib/label/xlabels.c:xlintersections
+ */
+export declare function xlintersections(xlp: XLabelsState, objp: ObjectT, intrsx: (ObjectT | null)[]): BestPosT;
+/**
+ * Top-left sliding pass (along top edge then down left edge).
+ * @see lib/label/xlabels.c:xladjust (sliding from top left)
+ */
+export declare function slideFromTopLeft(xlp: XLabelsState, objp: ObjectT, xincr: number, yincr: number, bp: BestPosT, intrsx: (ObjectT | null)[]): {
+    bp: BestPosT;
+    done: boolean;
+};
+/**
+ * Bottom-right sliding pass (along bottom edge then up right edge).
+ * @see lib/label/xlabels.c:xladjust (sliding from bottom right)
+ */
+export declare function slideFromBottomRight(xlp: XLabelsState, objp: ObjectT, xincr: number, yincr: number, bp: BestPosT, intrsx: (ObjectT | null)[]): {
+    bp: BestPosT;
+    done: boolean;
+};
+/**
+ * Try the 7 remaining fixed candidate positions after the initial top-left probe.
+ * @see lib/label/xlabels.c:xladjust (fixed position probes)
+ */
+export declare function tryFixedPositions(xlp: XLabelsState, objp: ObjectT, bp: BestPosT, intrsx: (ObjectT | null)[]): {
+    bp: BestPosT;
+    done: boolean;
+};
+/**
+ * Find the best label position for objp using the 9-candidate + sliding search.
+ * @see lib/label/xlabels.c:xladjust
+ */
+export declare function xladjust(xlp: XLabelsState, objp: ObjectT): BestPosT;
+//# sourceMappingURL=xlabels-intersect.d.ts.map

package/dist/label/xlabels-intersect.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"xlabels-intersect.d.ts","sourceRoot":"","sources":["../../src/label/xlabels-intersect.ts"],"names":[],"mappings":"AACA;;;;GAIG;AAEH,OAAO,EAAE,KAAK,IAAI,EAAE,MAAM,gBAAgB,CAAC;AAC3C,OAAO,EACL,KAAK,KAAK,EAIX,MAAM,YAAY,CAAC;AACpB,OAAO,EAAE,KAAK,OAAO,EAAgB,MAAM,cAAc,CAAC;AAY1D,wCAAwC;AACxC,eAAO,MAAM,QAAQ,IAAI,CAAC;AAC1B,wCAAwC;AACxC,eAAO,MAAM,QAAQ,IAAI,CAAC;AAC1B,4DAA4D;AAC5D,eAAO,MAAM,KAAK,IAAI,CAAC;AAgBvB;;;GAGG;AACH,MAAM,WAAW,QAAQ;IACvB,CAAC,EAAE,MAAM,CAAC;IACV,IAAI,EAAE,MAAM,CAAC;IACb,GAAG,EAAE;QAAE,CAAC,EAAE,MAAM,CAAC;QAAC,CAAC,EAAE,MAAM,CAAA;KAAE,CAAC;CAC/B;AAED;;GAEG;AACH,MAAM,WAAW,YAAY;IAC3B,IAAI,EAAE,OAAO,EAAE,CAAC;IAChB,KAAK,EAAE,MAAM,CAAC;IACd,IAAI,EAAE,KAAK,CAAC;CACb;AAkFD;;;GAGG;AACH,wBAAgB,aAAa,CAC3B,EAAE,EAAE,OAAO,EAAE,EAAE,EAAE,OAAO,EAAE,EAAE,EAAE,IAAI,EAAE,CAAC,EAAE,MAAM,EAC7C,MAAM,EAAE,CAAC,OAAO,GAAG,IAAI,CAAC,EAAE,GACzB,MAAM,CAWR;AAED;;;GAGG;AACH,wBAAgB,aAAa,CAC3B,EAAE,EAAE,OAAO,EAAE,EAAE,EAAE,OAAO,EAAE,EAAE,EAAE,IAAI,EAAE,CAAC,EAAE,MAAM,EAC7C,MAAM,EAAE,CAAC,OAAO,GAAG,IAAI,CAAC,EAAE,GACzB,MAAM,CAWR;AAsBD;;;GAGG;AACH,wBAAgB,eAAe,CAC7B,GAAG,EAAE,YAAY,EAAE,IAAI,EAAE,OAAO,EAChC,MAAM,EAAE,CAAC,OAAO,GAAG,IAAI,CAAC,EAAE,GACzB,QAAQ,CAcV;AAqFD;;;GAGG;AACH,wBAAgB,gBAAgB,CAC9B,GAAG,EAAE,YAAY,EAAE,IAAI,EAAE,OAAO,EAAE,KAAK,EAAE,MAAM,EAAE,KAAK,EAAE,MAAM,EAC9D,EAAE,EAAE,QAAQ,EAAE,MAAM,EAAE,CAAC,OAAO,GAAG,IAAI,CAAC,EAAE,GACvC;IAAE,EAAE,EAAE,QAAQ,CAAC;IAAC,IAAI,EAAE,OAAO,CAAA;CAAE,CAUjC;AAED;;;GAGG;AACH,wBAAgB,oBAAoB,CAClC,GAAG,EAAE,YAAY,EAAE,IAAI,EAAE,OAAO,EAAE,KAAK,EAAE,MAAM,EAAE,KAAK,EAAE,MAAM,EAC9D,EAAE,EAAE,QAAQ,EAAE,MAAM,EAAE,CAAC,OAAO,GAAG,IAAI,CAAC,EAAE,GACvC;IAAE,EAAE,EAAE,QAAQ,CAAC;IAAC,IAAI,EAAE,OAAO,CAAA;CAAE,CAUjC;AAED;;;GAGG;AACH,wBAAgB,iBAAiB,CAC/B,GAAG,EAAE,YAAY,EAAE,IAAI,EAAE,OAAO,EAChC,EAAE,EAAE,QAAQ,EAAE,MAAM,EAAE,CAAC,OAAO,GAAG,IAAI,CAAC,EAAE,GACvC;IAAE,EAAE,EAAE,QAAQ,CAAC;IAAC,IAAI,EAAE,OAAO,CAAA;CAAE,CAkBjC;AAMD;;;GAGG;AACH,wBAAgB,QAAQ,CAAC,GAAG,EAAE,YAAY,EAAE,IAAI,EAAE,OAAO,GAAG,QAAQ,CAmCnE"}

package/dist/label/xlabels.d.ts

@@ -0,0 +1,67 @@
+/**
+ * External-label placement — public types and placeLabels entry point.
+ *
+ * Internal algorithm is split across:
+ *   xlabels-geom.ts      — Hilbert code, rect helpers
+ *   xlabels-intersect.ts — neighbour-grid recording, xladjust
+ *
+ * @see lib/label/xlabels.h
+ * @see lib/label/xlabels.c
+ */
+import { type Box } from '../model/geom.js';
+/**
+ * External label attached to a graph object.
+ * @see lib/label/xlabels.h:xlabel_t
+ */
+export interface XLabelT {
+    /** Size of label (input). @see xlabel_t.sz */
+    sz: {
+        x: number;
+        y: number;
+    };
+    /** Position of lower-left corner (output). @see xlabel_t.pos */
+    pos: {
+        x: number;
+        y: number;
+    };
+    /** Opaque pointer to label in the graph. @see xlabel_t.lbl */
+    lbl: unknown;
+    /** Non-zero when position has been set. @see xlabel_t.set */
+    set: number;
+}
+/**
+ * Graph object that may carry an external label.
+ * @see lib/label/xlabels.h:object_t
+ */
+export interface ObjectT {
+    /** Position of lower-left corner. @see object_t.pos */
+    pos: {
+        x: number;
+        y: number;
+    };
+    /** Size; may be zero for a point object. @see object_t.sz */
+    sz: {
+        x: number;
+        y: number;
+    };
+    /** Attached label, or null. @see object_t.lbl */
+    lbl: XLabelT | null;
+}
+/**
+ * Parameters controlling label placement.
+ * @see lib/label/xlabels.h:label_params_t
+ */
+export interface LabelParamsT {
+    /** Bounding box of all objects. @see label_params_t.bb */
+    bb: Box;
+    /** When true, all labels must be placed even if overlaps result. */
+    force: boolean;
+}
+/**
+ * Place external labels near their attached objects, minimising overlaps.
+ * Returns 0 when all labels were placed without overlap; non-zero otherwise.
+ *
+ * @see lib/label/xlabels.c:placeLabels
+ */
+export declare function placeLabels(objs: ObjectT[], lbls: XLabelT[], params: LabelParamsT): number;
+//# sourceMappingURL=xlabels.d.ts.map

package/dist/label/xlabels.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"xlabels.d.ts","sourceRoot":"","sources":["../../src/label/xlabels.ts"],"names":[],"mappings":"AACA;;;;;;;;;GASG;AAEH,OAAO,EAAE,KAAK,GAAG,EAAE,MAAM,kBAAkB,CAAC;AAY5C;;;GAGG;AACH,MAAM,WAAW,OAAO;IACtB,8CAA8C;IAC9C,EAAE,EAAE;QAAE,CAAC,EAAE,MAAM,CAAC;QAAC,CAAC,EAAE,MAAM,CAAA;KAAE,CAAC;IAC7B,gEAAgE;IAChE,GAAG,EAAE;QAAE,CAAC,EAAE,MAAM,CAAC;QAAC,CAAC,EAAE,MAAM,CAAA;KAAE,CAAC;IAC9B,8DAA8D;IAC9D,GAAG,EAAE,OAAO,CAAC;IACb,6DAA6D;IAC7D,GAAG,EAAE,MAAM,CAAC;CACb;AAED;;;GAGG;AACH,MAAM,WAAW,OAAO;IACtB,uDAAuD;IACvD,GAAG,EAAE;QAAE,CAAC,EAAE,MAAM,CAAC;QAAC,CAAC,EAAE,MAAM,CAAA;KAAE,CAAC;IAC9B,6DAA6D;IAC7D,EAAE,EAAE;QAAE,CAAC,EAAE,MAAM,CAAC;QAAC,CAAC,EAAE,MAAM,CAAA;KAAE,CAAC;IAC7B,iDAAiD;IACjD,GAAG,EAAE,OAAO,GAAG,IAAI,CAAC;CACrB;AAED;;;GAGG;AACH,MAAM,WAAW,YAAY;IAC3B,0DAA0D;IAC1D,EAAE,EAAE,GAAG,CAAC;IACR,oEAAoE;IACpE,KAAK,EAAE,OAAO,CAAC;CAChB;AA+HD;;;;;GAKG;AACH,wBAAgB,WAAW,CACzB,IAAI,EAAE,OAAO,EAAE,EACf,IAAI,EAAE,OAAO,EAAE,EACf,MAAM,EAAE,YAAY,GACnB,MAAM,CAaR"}

package/dist/layout/circo/blockpath.d.ts

@@ -0,0 +1,120 @@
+/**
+ * Per-block circle layout: skeleton extraction, spanning tree, longest-path
+ * heuristic, crossing reduction, radius and position assignment.
+ *
+ * Ports lib/circogen/blockpath.c. All functions are exported so lizard
+ * counts each one independently.
+ *
+ * @see lib/circogen/blockpath.c
+ */
+import type { Node } from '../../model/node.js';
+import type { Block, SubGraph, CircState, DerivedNode, DerivedEdge } from './blocks.js';
+export type SpanNode = {
+    dn: DerivedNode;
+    tparent: SpanNode | null;
+    visited: boolean;
+    distone: number;
+    disttwo: number;
+    leafone: SpanNode | null;
+    leaftwo: SpanNode | null;
+    onpath: boolean;
+};
+export declare function blockGraph(allEdges: DerivedEdge[], sn: Block): void;
+export declare function derivedOf(n: Node): DerivedNode | null;
+export declare function closeOpenEdge(e: DerivedEdge, d: DerivedNode, opened: DerivedEdge[]): number;
+export declare function openEdgesAt(d: DerivedNode, edges: DerivedEdge[], opened: DerivedEdge[], order: number): void;
+/**
+ * C's count_all_crossings — INCLUDING its load-bearing bug: remove_edge keys
+ * the open-edge dict by the half-edge POINTER handed to it, and the closing
+ * node's agfstedge always yields the OPPOSITE half from the one stored when
+ * the edge was opened, so dtdelete never matches and the list only grows
+ * (circogen/edgelist.c:cmpItem on Agedge_t*). Each edge's close therefore
+ * counts EVERY edge opened after it (nested as well as interleaved spans),
+ * minus edges incident to the closing node — an inflated count that reduce()
+ * uses to accept moves. Do not "fix" this to true interleave counting: the
+ * final circle order depends on it.
+ * @see lib/circogen/blockpath.c:count_all_crossings
+ * @see lib/circogen/edgelist.c:remove_edge
+ */
+export declare function countCrossings(list: Node[], edges: DerivedEdge[]): number;
+export declare function insertNode(list: Node[], cn: Node, neighbor: Node, pos: number): void;
+/**
+ * One reduce pass, mirroring C's reduce (blockpath.c:439): iterate the
+ * SUBGRAPH's nodes in agfstnode (root-seq) order — NOT the current list
+ * order — and each node's incident edges in agfstedge order; the neighbour
+ * is agtail(e) unless that is curnode. The first-improving-move order is
+ * load-bearing for the final arrangement.
+ */
+export declare function reducePass(list: Node[], edges: DerivedEdge[], cnt: {
+    v: number;
+}, nodes: DerivedNode[]): void;
+/** @see lib/circogen/blockpath.c:reduce_edge_crossings */
+export declare function reduceEdgeCrossings(list: Node[], edges: DerivedEdge[], nodes: DerivedNode[]): Node[];
+/**
+ * Incident edges of dn in agfstedge order over the (possibly pruned)
+ * subgraph edge set: out-edges (by head order, seq) then in-edges (by tail
+ * order, seq). `ord`/`seq` maps carry the derived root's node and edge
+ * creation orders. @see lib/cgraph/edge.c:agfstedge
+ */
+export declare function spanIncident(dn: DerivedNode, edges: DerivedEdge[], ord: Map<DerivedNode, number>, seq: Map<DerivedEdge, number>): DerivedEdge[];
+export declare function dfsSpan(sn: SpanNode, map: Map<DerivedNode, SpanNode>, edges: DerivedEdge[], ord: Map<DerivedNode, number>, seq: Map<DerivedEdge, number>): void;
+export declare function buildSpanTree(nodes: DerivedNode[], edges: DerivedEdge[]): Map<DerivedNode, SpanNode>;
+export declare function measureDist(leaf: SpanNode, anc: SpanNode, dist: number, change: SpanNode | null): void;
+export declare function pathToNode(from: SpanNode, stop: SpanNode): SpanNode[];
+export declare function leafDegree(sn: SpanNode, all: SpanNode[]): number;
+export declare function findCommon(spanNodes: SpanNode[]): SpanNode | null;
+export declare function findLongestPath(spanNodes: SpanNode[]): SpanNode[];
+export declare function largestNodesize(list: Node[]): number;
+export declare function neighborSet(dn: DerivedNode, edges: DerivedEdge[]): Set<DerivedNode>;
+export declare function isNeighbor(n: Node, nbrs: Set<DerivedNode>): boolean;
+export declare function placeNodeBetweenTwo(list: Node[], dn: DerivedNode, nbrs: Set<DerivedNode>): boolean;
+export declare function placeNodeAfterAny(list: Node[], dn: DerivedNode, nbrs: Set<DerivedNode>): boolean;
+export declare function placeNode(dn: DerivedNode, edges: DerivedEdge[], list: Node[]): void;
+export declare function placeResiduals(sn: Block, edges: DerivedEdge[], list: Node[]): void;
+export declare function realignToParent(list: Node[]): void;
+export declare function assignPositions(list: Node[], radius: number): void;
+/** Mutable clone edge (xclone in C's clone_graph). */
+interface XEdge {
+    tail: XNode;
+    head: XNode;
+    /** Original derived edge; null once its deletion from outg is recorded. */
+    orige: DerivedEdge | null;
+    /** Creation order — cgraph edge seq proxy. */
+    seq: number;
+    alive: boolean;
+}
+/** Mutable clone node. `idx` is creation order — C compares node POINTERS
+ * ((uintptr_t)n1 < n2, allocation order); creation index is the proxy. */
+interface XNode {
+    dn: DerivedNode;
+    idx: number;
+    degree: number;
+    out: XEdge[];
+    in: XEdge[];
+    alive: boolean;
+}
+/** Working state threaded through the find_pair_edges passes. */
+interface PairCtx {
+    pruned: Set<DerivedEdge>;
+    nextSeq: {
+        v: number;
+    };
+}
+/**
+ * The pair-edge scan for one node: delete "paired" original edges from the
+ * skeleton and add synthetic clone edges between unpaired neighbours.
+ * @see lib/circogen/blockpath.c:find_pair_edges
+ */
+export declare function findPairEdges(n: XNode, ctx: PairCtx): void;
+/**
+ * Create the layout skeleton: repeatedly take the minimum-degree clone node,
+ * delete paired original edges around it, and remove it. Returns the block's
+ * edges minus the pruned ones (C's outg), which the spanning tree runs over.
+ * The deglist is qsort-sorted (descending degree, LIST_SORT -> libc qsort) —
+ * the equal-degree tie permutation decides the processing order.
+ * @see lib/circogen/blockpath.c:remove_pair_edges
+ */
+export declare function removePairEdges(nodes: DerivedNode[], edges: DerivedEdge[]): DerivedEdge[];
+export declare function layoutBlock(g: SubGraph, sn: Block, minDist: number, _state: CircState): Node[];
+export {};
+//# sourceMappingURL=blockpath.d.ts.map

package/dist/layout/circo/blockpath.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"blockpath.d.ts","sourceRoot":"","sources":["../../../src/layout/circo/blockpath.ts"],"names":[],"mappings":"AAEA;;;;;;;;GAQG;AAEH,OAAO,KAAK,EAAE,IAAI,EAAE,MAAM,qBAAqB,CAAC;AAChD,OAAO,KAAK,EAAE,KAAK,EAAE,QAAQ,EAAE,SAAS,EAAE,WAAW,EAAE,WAAW,EAAE,MAAM,aAAa,CAAC;AAIxF,MAAM,MAAM,QAAQ,GAAG;IACrB,EAAE,EAAE,WAAW,CAAC;IAAC,OAAO,EAAE,QAAQ,GAAG,IAAI,CAAC;IAAC,OAAO,EAAE,OAAO,CAAC;IAC5D,OAAO,EAAE,MAAM,CAAC;IAAC,OAAO,EAAE,MAAM,CAAC;IACjC,OAAO,EAAE,QAAQ,GAAG,IAAI,CAAC;IAAC,OAAO,EAAE,QAAQ,GAAG,IAAI,CAAC;IAAC,MAAM,EAAE,OAAO,CAAC;CACrE,CAAC;AAMF,wBAAgB,UAAU,CAAC,QAAQ,EAAE,WAAW,EAAE,EAAE,EAAE,EAAE,KAAK,GAAG,IAAI,CAQnE;AAMD,wBAAgB,SAAS,CAAC,CAAC,EAAE,IAAI,GAAG,WAAW,GAAG,IAAI,CAErD;AAED,wBAAgB,aAAa,CAAC,CAAC,EAAE,WAAW,EAAE,CAAC,EAAE,WAAW,EAAE,MAAM,EAAE,WAAW,EAAE,GAAG,MAAM,CAM3F;AAED,wBAAgB,WAAW,CAAC,CAAC,EAAE,WAAW,EAAE,KAAK,EAAE,WAAW,EAAE,EAAE,MAAM,EAAE,WAAW,EAAE,EAAE,KAAK,EAAE,MAAM,GAAG,IAAI,CAI5G;AAED;;;;;;;;;;;;GAYG;AACH,wBAAgB,cAAc,CAAC,IAAI,EAAE,IAAI,EAAE,EAAE,KAAK,EAAE,WAAW,EAAE,GAAG,MAAM,CAiBzE;AAMD,wBAAgB,UAAU,CAAC,IAAI,EAAE,IAAI,EAAE,EAAE,EAAE,EAAE,IAAI,EAAE,QAAQ,EAAE,IAAI,EAAE,GAAG,EAAE,MAAM,GAAG,IAAI,CAKpF;AAED;;;;;;GAMG;AACH,wBAAgB,UAAU,CACxB,IAAI,EAAE,IAAI,EAAE,EAAE,KAAK,EAAE,WAAW,EAAE,EAAE,GAAG,EAAE;IAAE,CAAC,EAAE,MAAM,CAAA;CAAE,EAAE,KAAK,EAAE,WAAW,EAAE,GAC3E,IAAI,CAkBN;AAID,0DAA0D;AAC1D,wBAAgB,mBAAmB,CACjC,IAAI,EAAE,IAAI,EAAE,EAAE,KAAK,EAAE,WAAW,EAAE,EAAE,KAAK,EAAE,WAAW,EAAE,GACvD,IAAI,EAAE,CAOR;AAMD;;;;;GAKG;AACH,wBAAgB,YAAY,CAC1B,EAAE,EAAE,WAAW,EAAE,KAAK,EAAE,WAAW,EAAE,EACrC,GAAG,EAAE,GAAG,CAAC,WAAW,EAAE,MAAM,CAAC,EAAE,GAAG,EAAE,GAAG,CAAC,WAAW,EAAE,MAAM,CAAC,GAC3D,WAAW,EAAE,CAMf;AAED,wBAAgB,OAAO,CACrB,EAAE,EAAE,QAAQ,EAAE,GAAG,EAAE,GAAG,CAAC,WAAW,EAAE,QAAQ,CAAC,EAAE,KAAK,EAAE,WAAW,EAAE,EACnE,GAAG,EAAE,GAAG,CAAC,WAAW,EAAE,MAAM,CAAC,EAAE,GAAG,EAAE,GAAG,CAAC,WAAW,EAAE,MAAM,CAAC,GAC3D,IAAI,CASN;AAED,wBAAgB,aAAa,CAAC,KAAK,EAAE,WAAW,EAAE,EAAE,KAAK,EAAE,WAAW,EAAE,GAAG,GAAG,CAAC,WAAW,EAAE,QAAQ,CAAC,CAepG;AAMD,wBAAgB,WAAW,CAAC,IAAI,EAAE,QAAQ,EAAE,GAAG,EAAE,QAAQ,EAAE,IAAI,EAAE,MAAM,EAAE,MAAM,EAAE,QAAQ,GAAG,IAAI,GAAG,IAAI,CAetG;AAED,wBAAgB,UAAU,CAAC,IAAI,EAAE,QAAQ,EAAE,IAAI,EAAE,QAAQ,GAAG,QAAQ,EAAE,CAKrE;AAED,wBAAgB,UAAU,CAAC,EAAE,EAAE,QAAQ,EAAE,GAAG,EAAE,QAAQ,EAAE,GAAG,MAAM,CAEhE;AAED,wBAAgB,UAAU,CAAC,SAAS,EAAE,QAAQ,EAAE,GAAG,QAAQ,GAAG,IAAI,CAOjE;AAED,wBAAgB,eAAe,CAAC,SAAS,EAAE,QAAQ,EAAE,GAAG,QAAQ,EAAE,CAajE;AAMD,wBAAgB,eAAe,CAAC,IAAI,EAAE,IAAI,EAAE,GAAG,MAAM,CAMpD;AAED,wBAAgB,WAAW,CAAC,EAAE,EAAE,WAAW,EAAE,KAAK,EAAE,WAAW,EAAE,GAAG,GAAG,CAAC,WAAW,CAAC,CAOnF;AAED,wBAAgB,UAAU,CAAC,CAAC,EAAE,IAAI,EAAE,IAAI,EAAE,GAAG,CAAC,WAAW,CAAC,GAAG,OAAO,CAEnE;AAED,wBAAgB,mBAAmB,CAAC,IAAI,EAAE,IAAI,EAAE,EAAE,EAAE,EAAE,WAAW,EAAE,IAAI,EAAE,GAAG,CAAC,WAAW,CAAC,GAAG,OAAO,CAMlG;AAED,wBAAgB,iBAAiB,CAAC,IAAI,EAAE,IAAI,EAAE,EAAE,EAAE,EAAE,WAAW,EAAE,IAAI,EAAE,GAAG,CAAC,WAAW,CAAC,GAAG,OAAO,CAKhG;AAED,wBAAgB,SAAS,CAAC,EAAE,EAAE,WAAW,EAAE,KAAK,EAAE,WAAW,EAAE,EAAE,IAAI,EAAE,IAAI,EAAE,GAAG,IAAI,CAKnF;AAED,wBAAgB,cAAc,CAAC,EAAE,EAAE,KAAK,EAAE,KAAK,EAAE,WAAW,EAAE,EAAE,IAAI,EAAE,IAAI,EAAE,GAAG,IAAI,CAGlF;AAMD,wBAAgB,eAAe,CAAC,IAAI,EAAE,IAAI,EAAE,GAAG,IAAI,CAKlD;AAED,wBAAgB,eAAe,CAAC,IAAI,EAAE,IAAI,EAAE,EAAE,MAAM,EAAE,MAAM,GAAG,IAAI,CAWlE;AAQD,sDAAsD;AACtD,UAAU,KAAK;IACb,IAAI,EAAE,KAAK,CAAC;IACZ,IAAI,EAAE,KAAK,CAAC;IACZ,2EAA2E;IAC3E,KAAK,EAAE,WAAW,GAAG,IAAI,CAAC;IAC1B,8CAA8C;IAC9C,GAAG,EAAE,MAAM,CAAC;IACZ,KAAK,EAAE,OAAO,CAAC;CAChB;AAED;0EAC0E;AAC1E,UAAU,KAAK;IACb,EAAE,EAAE,WAAW,CAAC;IAChB,GAAG,EAAE,MAAM,CAAC;IACZ,MAAM,EAAE,MAAM,CAAC;IACf,GAAG,EAAE,KAAK,EAAE,CAAC;IACb,EAAE,EAAE,KAAK,EAAE,CAAC;IACZ,KAAK,EAAE,OAAO,CAAC;CAChB;AAiCD,iEAAiE;AACjE,UAAU,OAAO;IACf,MAAM,EAAE,GAAG,CAAC,WAAW,CAAC,CAAC;IACzB,OAAO,EAAE;QAAE,CAAC,EAAE,MAAM,CAAA;KAAE,CAAC;CACxB;AAED;;;;GAIG;AACH,wBAAgB,aAAa,CAAC,CAAC,EAAE,KAAK,EAAE,GAAG,EAAE,OAAO,GAAG,IAAI,CA2D1D;AAED;;;;;;;GAOG;AACH,wBAAgB,eAAe,CAC7B,KAAK,EAAE,WAAW,EAAE,EAAE,KAAK,EAAE,WAAW,EAAE,GACzC,WAAW,EAAE,CAuDf;AAOD,wBAAgB,WAAW,CAAC,CAAC,EAAE,QAAQ,EAAE,EAAE,EAAE,KAAK,EAAE,OAAO,EAAE,MAAM,EAAE,MAAM,EAAE,SAAS,GAAG,IAAI,EAAE,CA2B9F"}