@knowvah/dot-engine 1.2.2 → 1.2.4

package/dist/xdot/parse.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"parse.d.ts","sourceRoot":"","sources":["../../src/xdot/parse.ts"],"names":[],"mappings":"AACA;;;;;GAKG;AAEH,OAAO,KAAK,EACV,IAAI,EAAU,QAAQ,EAAE,YAAY,EACf,SAAS,EACC,WAAW,EAC3C,MAAM,YAAY,CAAC;AAGpB,KAAK,EAAE,CAAC,CAAC,IAAI;IAAE,GAAG,EAAE,CAAC,CAAC;IAAC,GAAG,EAAE,MAAM,CAAA;CAAE,GAAG,IAAI,CAAC;AAkU5C,wBAAgB,SAAS,CAAC,CAAC,EAAE,MAAM,EAAE,GAAG,EAAE,MAAM,GAAG,EAAE,CAAC,QAAQ,CAAC,CAAyC;AACxG,wBAAgB,aAAa,CAAC,CAAC,EAAE,MAAM,EAAE,GAAG,EAAE,MAAM,GAAG,EAAE,CAAC,YAAY,CAAC,CAA6C;AACpH,wBAAgB,WAAW,CAAC,CAAC,EAAE,MAAM,EAAE,GAAG,EAAE,MAAM,GAAG,EAAE,CAAC,MAAM,CAAC,CAA2C;AAC1G,wBAAgB,gBAAgB,CAAC,CAAC,EAAE,MAAM,EAAE,GAAG,EAAE,MAAM,GAAG,EAAE,CAAC,SAAS,CAAC,CAAgD;AACvH,wBAAgB,YAAY,CAAC,CAAC,EAAE,MAAM,EAAE,KAAK,EAAE,OAAO,CAAC,WAAW,CAAC,EAAE,EAAE,EAAE,MAAM,EAAE,CAAC,EAAE,IAAI,GAAG,IAAI,GAAG,IAAI,GAAG,IAAI,CAE5G;AACD,wBAAgB,UAAU,CAAC,CAAC,EAAE,MAAM,EAAE,KAAK,EAAE,OAAO,CAAC,WAAW,CAAC,EAAE,EAAE,EAAE,MAAM,GAAG,IAAI,GAAG,IAAI,CAE1F;AACD,wBAAgB,SAAS,CAAC,CAAC,EAAE,MAAM,GAAG,IAAI,GAAG,IAAI,CAAoC;AACrF,wBAAgB,cAAc,CAAC,CAAC,EAAE,MAAM,GAAG,SAAS,GAAG,IAAI,CAAyC"}
+{"version":3,"file":"parse.d.ts","sourceRoot":"","sources":["../../src/xdot/parse.ts"],"names":[],"mappings":"AACA;;;;;GAKG;AAEH,OAAO,KAAK,EACV,IAAI,EAAU,QAAQ,EAAE,YAAY,EACf,SAAS,EACC,WAAW,EAC3C,MAAM,YAAY,CAAC;AAGpB,KAAK,EAAE,CAAC,CAAC,IAAI;IAAE,GAAG,EAAE,CAAC,CAAC;IAAC,GAAG,EAAE,MAAM,CAAA;CAAE,GAAG,IAAI,CAAC;AAoU5C,wBAAgB,SAAS,CAAC,CAAC,EAAE,MAAM,EAAE,GAAG,EAAE,MAAM,GAAG,EAAE,CAAC,QAAQ,CAAC,CAAyC;AACxG,wBAAgB,aAAa,CAAC,CAAC,EAAE,MAAM,EAAE,GAAG,EAAE,MAAM,GAAG,EAAE,CAAC,YAAY,CAAC,CAA6C;AACpH,wBAAgB,WAAW,CAAC,CAAC,EAAE,MAAM,EAAE,GAAG,EAAE,MAAM,GAAG,EAAE,CAAC,MAAM,CAAC,CAA2C;AAC1G,wBAAgB,gBAAgB,CAAC,CAAC,EAAE,MAAM,EAAE,GAAG,EAAE,MAAM,GAAG,EAAE,CAAC,SAAS,CAAC,CAAgD;AACvH,wBAAgB,YAAY,CAAC,CAAC,EAAE,MAAM,EAAE,KAAK,EAAE,OAAO,CAAC,WAAW,CAAC,EAAE,EAAE,EAAE,MAAM,EAAE,CAAC,EAAE,IAAI,GAAG,IAAI,GAAG,IAAI,GAAG,IAAI,CAE5G;AACD,wBAAgB,UAAU,CAAC,CAAC,EAAE,MAAM,EAAE,KAAK,EAAE,OAAO,CAAC,WAAW,CAAC,EAAE,EAAE,EAAE,MAAM,GAAG,IAAI,GAAG,IAAI,CAE1F;AACD,wBAAgB,SAAS,CAAC,CAAC,EAAE,MAAM,GAAG,IAAI,GAAG,IAAI,CAAoC;AACrF,wBAAgB,cAAc,CAAC,CAAC,EAAE,MAAM,GAAG,SAAS,GAAG,IAAI,CAAyC"}

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "@knowvah/dot-engine",
-  "version": "1.2.2",
+  "version": "1.2.4",
   "description": "Faithful TypeScript port of Graphviz (dot, neato, fdp, sfdp, circo, twopi, osage, patchwork) — no C: no native binary, no WASM. Oracle-verified against the C implementation, runs in the browser.",
   "keywords": [
     "graphviz",
@@ -103,6 +103,7 @@
     "fontkit": "^2.0.4",
     "peggy": "^5.0.0",
     "semantic-release": "^25.0.8",
+    "tsx": "^4.23.1",
     "typedoc": "^0.28.20",
     "typedoc-plugin-markdown": "^4.12.0",
     "typedoc-vitepress-theme": "^1.1.3",

package/src/cdt/bag.ts

@@ -3,10 +3,12 @@
  * DtBag — ordered multiset (Dtobag) backed by a splay tree.
  *
  * Unlike DtSplay (DT_OSET), DtBag allows duplicate keys.  On insert of a
- * duplicate, the new node is inserted immediately to the LEFT of the
- * matching node (mirrors C dttree.c DT_OBAG insert: new node placed in
- * link.left, i.e. the right partition, becoming the successor of the
- * matching group — faithfully ported from dttree.c lines 226-230).
+ * duplicate, the matched (old) node is threaded onto the new node's RIGHT
+ * subtree — not the left, as an earlier version of this comment claimed.
+ * C dttree.c DT_INSERT's DT_OBAG found-branch does
+ * `root->left = NULL; root->right = link.left; link.left = root;`
+ * (dttree.c:223-231): the old matched node is pushed onto the head of the
+ * RIGHT partition, which becomes the new root's `.right` subtree.
  *
  * Iteration (first/next) produces ascending comparator order.  Among
  * equal-key nodes the sub-order is the deterministic order CDT's Dtobag
@@ -32,50 +34,20 @@ import type { SplayNode } from "./splay-core.js";
 // ---------------------------------------------------------------------------
 
 /**
- * Walk left-spine from `start` to find a node whose `.obj === target`.
- * All nodes on the spine share the same key.
- * Returns [node, parent] or [null, null] when not found.
- */
-function findByIdentity<T, K>(
-  start: SplayNode<T>,
-  target: T,
-  key: K,
-  keyOf: KeyOf<T, K>,
-  compare: Comparator<K>,
-): [SplayNode<T> | null, SplayNode<T> | null] {
-  let cur: SplayNode<T> | null = start;
-  let parent: SplayNode<T> | null = null;
-  while (cur !== null) {
-    if (cur.obj === target) return [cur, parent];
-    if (compare(key, keyOf(cur.obj)) !== 0) return [null, null];
-    parent = cur;
-    cur = cur.left;
-  }
-  return [null, null];
-}
-
-/**
- * Unlink `cur` from the tree.  `parent` is its direct parent (null → root).
+ * Remove `root` itself from the tree, joining its two subtrees.  delete()
+ * always walks the equal-key duplicate group (via splay + next()) until the
+ * target identity is splayed to root, so unlinking only ever needs to
+ * handle the "match is at root" case — mirrors dttree.c:211-222 dt_delete's
+ * reassembly (`l->right = root->left; r->left = root->right; ...`).
  * Returns the new root.
  */
-function unlinkNode<T>(
-  root: SplayNode<T>,
-  cur: SplayNode<T>,
-  parent: SplayNode<T> | null,
-): SplayNode<T> | null {
-  const left  = cur.left;
-  const right = cur.right;
-  let replacement: SplayNode<T> | null;
-  if (left === null) {
-    replacement = right;
-  } else {
-    const maxLeft = splayMax(left);
-    maxLeft.right = right;
-    replacement = maxLeft;
-  }
-  if (parent === null) return replacement;
-  parent.left = replacement;
-  return root;
+function removeRoot<T>(root: SplayNode<T>): SplayNode<T> | null {
+  const left  = root.left;
+  const right = root.right;
+  if (left === null) return right;
+  const maxLeft = splayMax(left);
+  maxLeft.right = right;
+  return maxLeft;
 }
 
 // ---------------------------------------------------------------------------
@@ -123,12 +95,18 @@ export class DtBag<T, K = T> {
     const key = this._keyOf(obj);
     this._root = splay(this._root, key, this._keyOf, this._compare);
     if (this._compare(key, this._keyOf(this._root.obj)) !== 0) return false;
-    const [cur, parent] = findByIdentity(
-      this._root, obj, key, this._keyOf, this._compare,
-    );
-    if (cur === null) return false;
-    const newRoot = unlinkNode(this._root, cur, parent);
-    this._root = newRoot;
+    // Mirror dttree.c:67-79's DT_OBAG DELETE/DETACH pre-pass: dtsearch
+    // splays an equal-key node to root, then dtnext (also splaying) walks
+    // the equal-key duplicate group by pointer identity until it finds
+    // `obj`. Each next() call re-splays `this._root`, mirroring C's
+    // mutate-on-lookup contract.
+    while (this._root.obj !== obj) {
+      const nxt = this.next(this._root.obj);
+      if (nxt === undefined || this._compare(key, this._keyOf(nxt)) !== 0) {
+        return false;
+      }
+    }
+    this._root = removeRoot(this._root);
     this._size--;
     return true;
   }

package/src/common/arrows-shapes-poly.ts

@@ -9,6 +9,7 @@
  */
 
 import type { Point } from '../model/geom.js';
+import { ccwrotatepf, cwrotatepf } from '../model/geom.js';
 import type { GenResult } from './arrows-shapes-util.js';
 import {
   vsub, vadd, miterShape, negUnit, backwardDelta, axialProjection,
@@ -217,7 +218,25 @@ function curveControlPoints(p: Point, v: Point, w: Point, flag: number): Point[]
 }
 
 /** @see lib/common/arrows.c:arrow_type_curve */
-export function genCurve(p0: Point, u: Point, _arrowsize: number, penwidth: number, flag: number): GenResult {
+export function genCurve(
+  p0: Point, u: Point, _arrowsize: number, penwidth: number, flag: number,
+  rankdir = 0,
+): GenResult {
+  // C generates arrowheads at RENDER time, in the final (post-rankdir) frame;
+  // the port generates during routing and postproc rotates the stored ops.
+  // That round-trip is exact for every other generator, but this formula is
+  // not rotation-equivariant (0.95 shortens the x arm only; the y arm comes
+  // from AF0/AF3 verbatim), so run it in the final frame and rotate back.
+  // The rankdir maps are pure sign/swaps — rankdir 0 (TB) is untouched.
+  if (rankdir !== 0) {
+    const rot = rankdir * 90;
+    const fin = genCurve(ccwrotatepf(p0, rot), ccwrotatepf(u, rot), _arrowsize, penwidth, flag);
+    return {
+      ops: fin.ops.map((op) =>
+        'points' in op ? { ...op, points: op.points.map((pt) => cwrotatepf(pt, rot)) } : op),
+      q: cwrotatepf(fin.q, rot),
+    };
+  }
   const arrowwidth = penwidth > 4 ? (0.5 * penwidth) / 4 : 0.5;
   const noShift = (flag & ARR_MOD_INV) || (u.x === 0 && u.y === 0);
   const p = noShift ? p0 : vsub(p0, backwardDelta(u, penwidth));

package/src/common/arrows-shapes.ts

@@ -319,6 +319,7 @@ export function arrowLength(comps: ResolvedArrow[], arrowsize: number, penwidth:
  */
 export function dispatchSimple(
   r: ResolvedArrow, tip: Point, dir: Point, arrowsize: number, penwidth: number,
+  rankdir = 0,
 ): GenResult {
   const flag = arrowFlag(r);
   const u = componentU(dir, r.lenfact, arrowsize);
@@ -328,7 +329,9 @@ export function dispatchSimple(
     case ARR_TYPE_BOX: return genBox(tip, u, arrowsize, penwidth, flag);
     case ARR_TYPE_DIAMOND: return genDiamond(tip, u, arrowsize, penwidth, flag);
     case ARR_TYPE_DOT: return genDot(tip, u, arrowsize, penwidth, flag);
-    case ARR_TYPE_CURVE: return genCurve(tip, u, arrowsize, penwidth, flag);
+    // curve is the one generator that is not rotation-equivariant; it needs
+    // the rankdir to reproduce C's render-time (final-frame) generation.
+    case ARR_TYPE_CURVE: return genCurve(tip, u, arrowsize, penwidth, flag, rankdir);
     case ARR_TYPE_GAP: return genGap(tip, u, arrowsize, penwidth, flag);
     case ARR_TYPE_NORM:
     default:
@@ -345,6 +348,7 @@ export function dispatchSimple(
  */
 export function arrowDrawOps(
   comps: ResolvedArrow[], tip: Point, dir: Point, arrowsize: number, penwidth: number,
+  rankdir = 0,
 ): ArrowDrawOp[] {
   const ops: ArrowDrawOp[] = [];
   let p = tip;
@@ -352,7 +356,7 @@ export function arrowDrawOps(
   for (let i = 0; i < n; i++) {
     const r = comps[i];
     if ((r.type & ARR_TYPE_MASK) === ARR_TYPE_NONE) break;
-    const res = dispatchSimple(r, p, dir, arrowsize, penwidth);
+    const res = dispatchSimple(r, p, dir, arrowsize, penwidth, rankdir);
     ops.push(...res.ops);
     p = res.q;
   }

package/src/common/htmltable-lex.ts

@@ -66,13 +66,25 @@ function parseAttrs(raw: string) {
   return out;
 }
 
+/**
+ * TH is a row-boundary synonym for TR, not a cell tag: the C lexer
+ * dispatches both open and close TH identically to TR (T_row/T_end_row).
+ * Normalizing here — the single point where tags become tokens — means
+ * every downstream consumer (parser) sees TH and TR as structurally
+ * identical, mirroring the C lexer's dispatch exactly.
+ * @see lib/common/htmllex.c:614,669 (startElement/endElement)
+ */
+function normalizeTag(tag: string): string {
+  return tag === 'TH' ? 'TR' : tag;
+}
+
 /** Parse close tag. @see lib/common/htmllex.c:endElement */
 function parseCloseToken(inner: string) {
   const body = inner.slice(1).trim();
   const sp = body.search(/\s/);
   const tag = (sp === -1 ? body : body.slice(0, sp)).toUpperCase();
   checkTag(tag);
-  return { type: 'close' as const, tag };
+  return { type: 'close' as const, tag: normalizeTag(tag) };
 }
 
 /** @see lib/common/htmllex.c:characterData */
@@ -119,12 +131,13 @@ function scanTag(src: string, start: number, tokens: Token[]) {
 function parseOpenToken(inner: string) {
   const sp = inner.search(/\s/);
   if (sp === -1) {
-    checkTag(inner.toUpperCase());
-    return { type: 'open' as const, tag: inner.toUpperCase(), attrs: parseAttrs('') };
+    const tag = inner.toUpperCase();
+    checkTag(tag);
+    return { type: 'open' as const, tag: normalizeTag(tag), attrs: parseAttrs('') };
   }
   const tag = inner.slice(0, sp).toUpperCase();
   checkTag(tag);
-  return { type: 'open' as const, tag, attrs: parseAttrs(inner.slice(sp + 1)) };
+  return { type: 'open' as const, tag: normalizeTag(tag), attrs: parseAttrs(inner.slice(sp + 1)) };
 }
 
 /** @see lib/common/htmllex.c:findNext */

package/src/common/htmltable-parse.ts

@@ -362,7 +362,7 @@ const parseCell = (
 const processRowToken = (
   s: ParseState, t: Token, cells: HtmlCell[], fontStack: FontState[],
 ): void => {
-  if (t.type === 'open' && (t.tag === 'TD' || t.tag === 'TH')) {
+  if (t.type === 'open' && t.tag === 'TD') {
     consume(s);
     cells.push(parseCell(s, t.attrs, fontStack));
     return;

package/src/common/record.ts

@@ -25,6 +25,7 @@ import { renderLabel, applyNodeStyle } from './poly-gencode.js';
 import { transformPoint } from '../gvc/device.js';
 import { emitRoundedBezier } from './poly-shapes.js';
 import { parseStyleFlags } from './style-resolve.js';
+import { mapbool } from '../layout/dot/rank.js';
 
 // Parse-mode bits. @see lib/common/shapes.c
 const HASTEXT = 1;
@@ -344,12 +345,9 @@ export function posReclbl(f: FieldT, ul: Point, sides: number): void {
 // record_init
 // ---------------------------------------------------------------------------
 
-/** mapbool for attr strings. @see lib/common/utils.c:mapbool */
+/** mapbool for attr strings. @see lib/common/utils.c:mapBool */
 function attrBool(n: Node, g: Graph, key: string): boolean {
-  const s = nodeAttr(n, g, key);
-  if (!s || s.toLowerCase() === 'false' || s.toLowerCase() === 'no') return false;
-  if (s.toLowerCase() === 'true' || s.toLowerCase() === 'yes') return true;
-  return parseInt(s, 10) !== 0;
+  return mapbool(nodeAttr(n, g, key));
 }
 
 function recAttrSize(n: Node, g: Graph): Point {

package/src/layout/dot/edge-route-arrow.ts

@@ -56,7 +56,11 @@ export function arrowheadPolygon(arrowTip: Point, arrowDir: Point, penwidth = 1.
 // ---------------------------------------------------------------------------
 
 /** Minimal edge shape exposing the arrow-related attributes. */
-interface ArrowAttrEdge { attrs: Map<string, string> }
+interface ArrowAttrEdge {
+  attrs: Map<string, string>;
+  /** Present on real edges; the curve generator needs the rankdir frame. */
+  tail?: { root?: { info?: { rankdir?: number } } };
+}
 
 /** The arrowhead/arrowtail name for an edge end (default "normal"). */
 export function edgeArrowName(e: ArrowAttrEdge, end: 'head' | 'tail'): string {
@@ -81,7 +85,8 @@ export function arrowDrawOpsForEnd(
   e: ArrowAttrEdge, end: 'head' | 'tail', tip: Point, dir: Point, penwidth: number,
 ): ArrowDrawOp[] {
   const comps = parseArrow(edgeArrowName(e, end)).map(resolveArrowType);
+  const rankdir = (e.tail?.root?.info?.rankdir ?? 0) & 0x3;
   // Pass the RAW direction (not normalized): componentU reproduces arrow_gen's
   // EPSILON normalization, which is relative to the raw shaft magnitude.
-  return arrowDrawOps(comps, tip, dir, edgeArrowsize(e), penwidth);
+  return arrowDrawOps(comps, tip, dir, edgeArrowsize(e), penwidth, rankdir);
 }

package/src/model/geom.ts

@@ -144,6 +144,20 @@ export function ccwrotatepf(p: Point, ccwrot: number): Point {
   }
 }
 
+/**
+ * Clockwise counterpart — the exact inverse of {@link ccwrotatepf} per case.
+ * @see lib/common/geom.c:cwrotatepf
+ */
+export function cwrotatepf(p: Point, cwrot: number): Point {
+  switch (cwrot) {
+    case 0:   return p;
+    case 90:  return { x: p.y, y: -p.x };
+    case 180: return { x: p.x, y: -p.y };
+    case 270: return { x: p.y, y: p.x };
+    default:  return p;
+  }
+}
+
 /**
  * Returns true if box `b0` completely contains box `b1`.
  *

package/src/xdot/parse.ts

@@ -122,7 +122,9 @@ class XdotParser {
     let accounted = 0;
     let j = 0;
     while (accounted < len) {
-      if (cur + j >= s.length) break; // C strncpy semantics: stop at end of input
+      // C fails hard the moment input runs out before the byte budget is
+      // satisfied (`s[j] == '\0'` mid-loop). @see xdot/xdot.c:139-141.
+      if (cur + j >= s.length) return null;
       const ch = s[cur + j];
       const prev = j > 0 ? s[cur + j - 1] : "";
       out += ch;

package/dist/gvc/textlayout.d.ts

@@ -1,33 +0,0 @@
-/**
- * Text layout selection and measurement.
- *
- * Ports gvtextlayout_select and gvtextlayout from lib/gvc/gvtextlayout.c,
- * simplified for the TypeScript model where the text-layout engine is always
- * the context's registered TextMeasurer (no dynamic plugin loading).
- *
- * @see lib/gvc/gvtextlayout.c:gvtextlayout_select
- * @see lib/gvc/gvtextlayout.c:gvtextlayout
- */
-import type { GvcContext } from './context.js';
-import type { TextMeasurer } from '../common/textmeasure.js';
-import type { TextSpan } from '../common/emit-types.js';
-/**
- * Return the text measurer registered on ctx.
- *
- * Replaces gvtextlayout_select / plugin load with direct access to the
- * context's measurer, per AD-2 (static registration, no libltdl).
- *
- * @see lib/gvc/gvtextlayout.c:gvtextlayout_select
- */
-export declare function selectTextLayout(ctx: GvcContext): TextMeasurer;
-/**
- * Measure a text span and write the result into span.size.
- *
- * Mirrors gvtextlayout: calls the engine's textlayout method to populate
- * the size field on the span.  Falls back to 'Times-Roman' / 14pt when
- * fontName or fontSize are unspecified.
- *
- * @see lib/gvc/gvtextlayout.c:gvtextlayout
- */
-export declare function measure(span: TextSpan, ctx: GvcContext): void;
-//# sourceMappingURL=textlayout.d.ts.map

package/dist/gvc/textlayout.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"textlayout.d.ts","sourceRoot":"","sources":["../../src/gvc/textlayout.ts"],"names":[],"mappings":"AAEA;;;;;;;;;GASG;AAEH,OAAO,KAAK,EAAE,UAAU,EAAE,MAAM,cAAc,CAAC;AAC/C,OAAO,KAAK,EAAE,YAAY,EAAE,MAAM,0BAA0B,CAAC;AAC7D,OAAO,KAAK,EAAE,QAAQ,EAAE,MAAM,yBAAyB,CAAC;AAExD;;;;;;;GAOG;AACH,wBAAgB,gBAAgB,CAAC,GAAG,EAAE,UAAU,GAAG,YAAY,CAE9D;AAED;;;;;;;;GAQG;AACH,wBAAgB,OAAO,CAAC,IAAI,EAAE,QAAQ,EAAE,GAAG,EAAE,UAAU,GAAG,IAAI,CAK7D"}

package/dist/layout/osage/layout.d.ts

@@ -1,49 +0,0 @@
-/**
- * Osage recursive layout helpers.
- *
- * @see lib/osage/osageinit.c:layout
- * @see lib/osage/osageinit.c:reposition
- */
-import type { Graph } from '../../model/graph.js';
-import type { Box, Point } from '../../model/geom.js';
-import type { PackInfo } from '../pack/index.js';
-import type { ChildLists } from './types.js';
-export type { ChildLists };
-/** Build and populate a PackInfo from graph attributes. @see lib/osage/osageinit.c:layout */
-export declare const buildPackInfo: (g: Graph) => PackInfo;
-/**
- * Build child arrays for putRects.
- * @see lib/osage/osageinit.c:layout (child list construction)
- */
-export declare const buildChildLists: (g: Graph, nClust: number, nvs: number, p: PackInfo) => ChildLists;
-/**
- * Apply putRects offsets to child bbs/coords; return union bounding box.
- * @see lib/osage/osageinit.c:layout (offset application loop)
- */
-export declare const applyOffsets: (lists: ChildLists, pts: Point[]) => Box;
-/**
- * Widen union bb if the graph label is wider than packed content.
- * @see lib/osage/osageinit.c:layout (GD_label block)
- */
-export declare const applyLabelExpansion: (g: Graph, total: number, u: Box) => Box;
-/**
- * Add margin and label-border padding to the union bounding box.
- * @see lib/osage/osageinit.c:layout (margin/border block)
- */
-export declare const addMarginAndBorder: (g: Graph, margin: number, u: Box) => Box;
-/**
- * Subtract union.ll from all child positions so this cluster's LL = (0,0).
- * @see lib/osage/osageinit.c:layout (translate-to-origin loop)
- */
-export declare const translateToOrigin: (lists: ChildLists, u: Box) => void;
-/**
- * Recursively pack all direct children (subclusters + loose nodes) of g.
- * @see lib/osage/osageinit.c:layout
- */
-export declare const osageLayoutRec: (g: Graph, depth: number) => void;
-/**
- * Convert cluster-relative coordinates to absolute root-relative coordinates.
- * @see lib/osage/osageinit.c:reposition
- */
-export declare const osageReposition: (g: Graph, depth: number) => void;
-//# sourceMappingURL=layout.d.ts.map

package/dist/layout/osage/layout.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"layout.d.ts","sourceRoot":"","sources":["../../../src/layout/osage/layout.ts"],"names":[],"mappings":"AAEA;;;;;GAKG;AAEH,OAAO,KAAK,EAAE,KAAK,EAAE,MAAM,sBAAsB,CAAC;AAElD,OAAO,KAAK,EAAE,GAAG,EAAE,KAAK,EAAE,MAAM,qBAAqB,CAAC;AACtD,OAAO,KAAK,EAAE,QAAQ,EAAE,MAAM,kBAAkB,CAAC;AACjD,OAAO,KAAK,EAAE,UAAU,EAAE,MAAM,YAAY,CAAC;AAI7C,YAAY,EAAE,UAAU,EAAE,CAAC;AAsB3B,6FAA6F;AAC7F,eAAO,MAAM,aAAa,GAAI,GAAG,KAAK,KAAG,QAMxC,CAAC;AAiCF;;;GAGG;AACH,eAAO,MAAM,eAAe,GAAI,GAAG,KAAK,EAAE,QAAQ,MAAM,EAAE,KAAK,MAAM,EAAE,GAAG,QAAQ,KAAG,UAMpF,CAAC;AAyBF;;;GAGG;AACH,eAAO,MAAM,YAAY,GAAI,OAAO,UAAU,EAAE,KAAK,KAAK,EAAE,KAAG,GAQ9D,CAAC;AAMF;;;GAGG;AACH,eAAO,MAAM,mBAAmB,GAAI,GAAG,KAAK,EAAE,OAAO,MAAM,EAAE,GAAG,GAAG,KAAG,GAOrE,CAAC;AAKF;;;GAGG;AACH,eAAO,MAAM,kBAAkB,GAAI,GAAG,KAAK,EAAE,QAAQ,MAAM,EAAE,GAAG,GAAG,KAAG,GAInE,CAAC;AAeJ;;;GAGG;AACH,eAAO,MAAM,iBAAiB,GAAI,OAAO,UAAU,EAAE,GAAG,GAAG,KAAG,IAG7D,CAAC;AA6BF;;;GAGG;AACH,eAAO,MAAM,cAAc,GAAI,GAAG,KAAK,EAAE,OAAO,MAAM,KAAG,IAQxD,CAAC;AAqBF;;;GAGG;AACH,eAAO,MAAM,eAAe,GAAI,GAAG,KAAK,EAAE,OAAO,MAAM,KAAG,IASzD,CAAC"}

package/dist/layout/pack/test-helpers.d.ts

@@ -1,7 +0,0 @@
-import type { Box, Point } from '../../model/geom.js';
-import { type PackInfo } from './types.js';
-export declare function box(llx: number, lly: number, urx: number, ury: number): Box;
-export declare function defaultPackInfo(overrides?: Partial<PackInfo>): PackInfo;
-export declare function applyPlaces(bbs: Box[], places: Point[]): Box[];
-export declare function assertNoOverlap(placed: Box[]): void;
-//# sourceMappingURL=test-helpers.d.ts.map

package/dist/layout/pack/test-helpers.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"test-helpers.d.ts","sourceRoot":"","sources":["../../../src/layout/pack/test-helpers.ts"],"names":[],"mappings":"AAQA,OAAO,KAAK,EAAE,GAAG,EAAE,KAAK,EAAE,MAAM,qBAAqB,CAAC;AACtD,OAAO,EAAE,KAAK,QAAQ,EAAY,MAAM,YAAY,CAAC;AAErD,wBAAgB,GAAG,CAAC,GAAG,EAAE,MAAM,EAAE,GAAG,EAAE,MAAM,EAAE,GAAG,EAAE,MAAM,EAAE,GAAG,EAAE,MAAM,GAAG,GAAG,CAE3E;AAED,wBAAgB,eAAe,CAAC,SAAS,CAAC,EAAE,OAAO,CAAC,QAAQ,CAAC,GAAG,QAAQ,CAMvE;AAED,wBAAgB,WAAW,CAAC,GAAG,EAAE,GAAG,EAAE,EAAE,MAAM,EAAE,KAAK,EAAE,GAAG,GAAG,EAAE,CAK9D;AAOD,wBAAgB,eAAe,CAAC,MAAM,EAAE,GAAG,EAAE,GAAG,IAAI,CAUnD"}

package/dist/layout/patchwork/tree-node.d.ts

@@ -1,46 +0,0 @@
-/**
- * Internal tree node and construction helpers for the patchwork layout.
- *
- * Mirrors treenode_t and mkTree from lib/patchwork/patchwork.c.
- *
- * @see lib/patchwork/patchwork.c:treenode_t
- * @see lib/patchwork/patchwork.c:mkTree
- */
-import type { Graph } from '../../model/graph.js';
-import type { Node } from '../../model/node.js';
-import type { Rectangle } from './tree-map.js';
-/** @see lib/patchwork/patchwork.c:treenode_t */
-export interface TreeNode {
-    area: number;
-    childArea: number;
-    r: Rectangle;
-    leftChild: TreeNode | null;
-    rightSib: TreeNode | null;
-    kind: 'graph' | 'node';
-    ref: Graph | Node;
-    nChildren: number;
-}
-/** @see lib/patchwork/patchwork.c:getArea */
-export declare function getArea(attrs: Map<string, string>): number;
-/** @see lib/patchwork/patchwork.c:fullArea (mp parameter) */
-export declare function getInset(attrs: Map<string, string>): number;
-/** wid = 2*inset + sqrt(childArea), area = wid². @see lib/patchwork/patchwork.c:fullArea */
-export declare function fullArea(childArea: number, inset: number): number;
-/** Mutable accumulator used during tree construction. */
-export interface ChildAccum {
-    first: TreeNode | null;
-    prev: TreeNode | null;
-    area: number;
-    nChildren: number;
-}
-/** Append all cluster children of g to accum. @see lib/patchwork/patchwork.c:mkTree */
-export declare function appendClusters(g: Graph, sparent: Map<Node, Graph>, accum: ChildAccum): void;
-/** Append unclaimed direct nodes of g to accum. @see lib/patchwork/patchwork.c:mkTree */
-export declare function appendNodes(g: Graph, sparent: Map<Node, Graph>, accum: ChildAccum): void;
-/**
- * Recursively build the internal TreeNode tree from a Graph hierarchy.
- * Nodes already owned by a cluster (sparent set) are skipped.
- * @see lib/patchwork/patchwork.c:mkTree
- */
-export declare function mkTree(g: Graph, sparent: Map<Node, Graph>): TreeNode;
-//# sourceMappingURL=tree-node.d.ts.map

package/dist/layout/patchwork/tree-node.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"tree-node.d.ts","sourceRoot":"","sources":["../../../src/layout/patchwork/tree-node.ts"],"names":[],"mappings":"AAEA;;;;;;;GAOG;AAEH,OAAO,KAAK,EAAE,KAAK,EAAE,MAAM,sBAAsB,CAAC;AAClD,OAAO,KAAK,EAAE,IAAI,EAAE,MAAM,qBAAqB,CAAC;AAChD,OAAO,KAAK,EAAE,SAAS,EAAE,MAAM,eAAe,CAAC;AAE/C,gDAAgD;AAChD,MAAM,WAAW,QAAQ;IACvB,IAAI,EAAE,MAAM,CAAC;IACb,SAAS,EAAE,MAAM,CAAC;IAClB,CAAC,EAAE,SAAS,CAAC;IACb,SAAS,EAAE,QAAQ,GAAG,IAAI,CAAC;IAC3B,QAAQ,EAAE,QAAQ,GAAG,IAAI,CAAC;IAC1B,IAAI,EAAE,OAAO,GAAG,MAAM,CAAC;IACvB,GAAG,EAAE,KAAK,GAAG,IAAI,CAAC;IAClB,SAAS,EAAE,MAAM,CAAC;CACnB;AAQD,6CAA6C;AAC7C,wBAAgB,OAAO,CAAC,KAAK,EAAE,GAAG,CAAC,MAAM,EAAE,MAAM,CAAC,GAAG,MAAM,CAK1D;AAED,6DAA6D;AAC7D,wBAAgB,QAAQ,CAAC,KAAK,EAAE,GAAG,CAAC,MAAM,EAAE,MAAM,CAAC,GAAG,MAAM,CAK3D;AAED,4FAA4F;AAC5F,wBAAgB,QAAQ,CAAC,SAAS,EAAE,MAAM,EAAE,KAAK,EAAE,MAAM,GAAG,MAAM,CAGjE;AAED,yDAAyD;AACzD,MAAM,WAAW,UAAU;IACzB,KAAK,EAAE,QAAQ,GAAG,IAAI,CAAC;IACvB,IAAI,EAAE,QAAQ,GAAG,IAAI,CAAC;IACtB,IAAI,EAAE,MAAM,CAAC;IACb,SAAS,EAAE,MAAM,CAAC;CACnB;AAED,uFAAuF;AACvF,wBAAgB,cAAc,CAAC,CAAC,EAAE,KAAK,EAAE,OAAO,EAAE,GAAG,CAAC,IAAI,EAAE,KAAK,CAAC,EAAE,KAAK,EAAE,UAAU,GAAG,IAAI,CAS3F;AAED,yFAAyF;AACzF,wBAAgB,WAAW,CAAC,CAAC,EAAE,KAAK,EAAE,OAAO,EAAE,GAAG,CAAC,IAAI,EAAE,KAAK,CAAC,EAAE,KAAK,EAAE,UAAU,GAAG,IAAI,CAiBxF;AAED;;;;GAIG;AACH,wBAAgB,MAAM,CAAC,CAAC,EAAE,KAAK,EAAE,OAAO,EAAE,GAAG,CAAC,IAAI,EAAE,KAAK,CAAC,GAAG,QAAQ,CAmBpE"}

package/dist/xdot/lex.d.ts

@@ -1,22 +0,0 @@
-/**
- * Low-level lexer primitives for xdot attribute string parsing.
- * Ported from ~/git/graphviz/lib/xdot/xdot.c helper functions.
- */
-import type { XdotAlign, XdotRect, XdotPolyline } from "./types.js";
-export type PR<T> = {
-    val: T;
-    pos: number;
-} | null;
-export declare function isWs(c: string): boolean;
-export declare function isDigit(c: string): boolean;
-export declare function isAlnum(c: string): boolean;
-export declare function skipWs(s: string, pos: number): number;
-export declare function consumeDigits(s: string, i: number): number;
-export declare function parseReal(s: string, pos: number): PR<number>;
-export declare function parseInt_(s: string, pos: number): PR<number>;
-export declare function parseUInt_(s: string, pos: number): PR<number>;
-export declare function parseRect(s: string, pos: number): PR<XdotRect>;
-export declare function parsePolyline(s: string, pos: number): PR<XdotPolyline>;
-export declare function parseString(s: string, pos: number): PR<string>;
-export declare function parseAlign(s: string, pos: number): PR<XdotAlign>;
-//# sourceMappingURL=lex.d.ts.map

package/dist/xdot/lex.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"lex.d.ts","sourceRoot":"","sources":["../../src/xdot/lex.ts"],"names":[],"mappings":"AACA;;;GAGG;AAEH,OAAO,KAAK,EAAE,SAAS,EAAa,QAAQ,EAAE,YAAY,EAAE,MAAM,YAAY,CAAC;AAE/E,MAAM,MAAM,EAAE,CAAC,CAAC,IAAI;IAAE,GAAG,EAAE,CAAC,CAAC;IAAC,GAAG,EAAE,MAAM,CAAA;CAAE,GAAG,IAAI,CAAC;AAKnD,wBAAgB,IAAI,CAAC,CAAC,EAAE,MAAM,GAAG,OAAO,CAEvC;AAED,wBAAgB,OAAO,CAAC,CAAC,EAAE,MAAM,GAAG,OAAO,CAE1C;AAED,wBAAgB,OAAO,CAAC,CAAC,EAAE,MAAM,GAAG,OAAO,CAE1C;AAED,wBAAgB,MAAM,CAAC,CAAC,EAAE,MAAM,EAAE,GAAG,EAAE,MAAM,GAAG,MAAM,CAGrD;AAKD,wBAAgB,aAAa,CAAC,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,MAAM,GAAG,MAAM,CAG1D;AAaD,wBAAgB,SAAS,CAAC,CAAC,EAAE,MAAM,EAAE,GAAG,EAAE,MAAM,GAAG,EAAE,CAAC,MAAM,CAAC,CAU5D;AAKD,wBAAgB,SAAS,CAAC,CAAC,EAAE,MAAM,EAAE,GAAG,EAAE,MAAM,GAAG,EAAE,CAAC,MAAM,CAAC,CAQ5D;AAKD,wBAAgB,UAAU,CAAC,CAAC,EAAE,MAAM,EAAE,GAAG,EAAE,MAAM,GAAG,EAAE,CAAC,MAAM,CAAC,CAK7D;AAKD,wBAAgB,SAAS,CAAC,CAAC,EAAE,MAAM,EAAE,GAAG,EAAE,MAAM,GAAG,EAAE,CAAC,QAAQ,CAAC,CAM9D;AAWD,wBAAgB,aAAa,CAAC,CAAC,EAAE,MAAM,EAAE,GAAG,EAAE,MAAM,GAAG,EAAE,CAAC,YAAY,CAAC,CAUtE;AAUD,wBAAgB,WAAW,CAAC,CAAC,EAAE,MAAM,EAAE,GAAG,EAAE,MAAM,GAAG,EAAE,CAAC,MAAM,CAAC,CAiB9D;AAKD,wBAAgB,UAAU,CAAC,CAAC,EAAE,MAAM,EAAE,GAAG,EAAE,MAAM,GAAG,EAAE,CAAC,SAAS,CAAC,CAIhE"}

package/src/gvc/textlayout.ts

@@ -1,44 +0,0 @@
-// SPDX-License-Identifier: EPL-2.0
-
-/**
- * Text layout selection and measurement.
- *
- * Ports gvtextlayout_select and gvtextlayout from lib/gvc/gvtextlayout.c,
- * simplified for the TypeScript model where the text-layout engine is always
- * the context's registered TextMeasurer (no dynamic plugin loading).
- *
- * @see lib/gvc/gvtextlayout.c:gvtextlayout_select
- * @see lib/gvc/gvtextlayout.c:gvtextlayout
- */
-
-import type { GvcContext } from './context.js';
-import type { TextMeasurer } from '../common/textmeasure.js';
-import type { TextSpan } from '../common/emit-types.js';
-
-/**
- * Return the text measurer registered on ctx.
- *
- * Replaces gvtextlayout_select / plugin load with direct access to the
- * context's measurer, per AD-2 (static registration, no libltdl).
- *
- * @see lib/gvc/gvtextlayout.c:gvtextlayout_select
- */
-export function selectTextLayout(ctx: GvcContext): TextMeasurer {
-  return ctx.textMeasurer;
-}
-
-/**
- * Measure a text span and write the result into span.size.
- *
- * Mirrors gvtextlayout: calls the engine's textlayout method to populate
- * the size field on the span.  Falls back to 'Times-Roman' / 14pt when
- * fontName or fontSize are unspecified.
- *
- * @see lib/gvc/gvtextlayout.c:gvtextlayout
- */
-export function measure(span: TextSpan, ctx: GvcContext): void {
-  const fontName = span.fontName ?? 'Times-Roman';
-  const fontSize = span.fontSize > 0 ? span.fontSize : 14;
-  const size = ctx.textMeasurer.measure(span.str, fontName, fontSize);
-  span.size = { x: size.w, y: size.h };
-}