@knowvah/dot-engine 0.1.0

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

@@ -0,0 +1,158 @@
+/**
+ * Osage cluster-packing layout engine.
+ *
+ * Faithful port of lib/osage/osageinit.c. Arranges clusters and loose
+ * nodes by recursively packing bounding rectangles, then routes edges.
+ *
+ * @see lib/osage/osageinit.c
+ * @see lib/osage/osage.h
+ */
+import type { Graph } from '../../model/graph.js';
+import type { Node } from '../../model/node.js';
+import type { Box } from '../../model/geom.js';
+import type { LayoutEngine } from '../../gvc/context.js';
+import type { PackInfo } from '../pack/index.js';
+/**
+ * Return the owning cluster for a node, or null if unclaimed.
+ *
+ * In C this is the PARENT(n) macro: `(Agraph_t*)ND_alg(n)`.
+ * Osage repurposes ND_alg to store cluster ownership during layout.
+ *
+ * @see lib/osage/osageinit.c:#define PARENT(n)
+ */
+export declare function PARENT(n: Node): Graph | null;
+/**
+ * Return true if the subgraph is a cluster: the root, a name beginning
+ * (case-insensitively) with "cluster", OR a truthy `cluster` attribute. The
+ * name-only test dropped `cluster=true` subgraphs (2717's `domestic_cats`).
+ *
+ * @see lib/common/utils.c:695 is_a_cluster
+ */
+export declare function isCluster(g: Graph): boolean;
+/**
+ * Initialize all nodes and edges in the graph for osage layout.
+ *
+ * Forces 2-D layout (ndim=2), initialises each node with neatoInitNode
+ * (sets default width/height in inches), then computes lw/rw/ht in points.
+ *
+ * @see lib/osage/osageinit.c:cluster_init_graph
+ */
+export declare function clusterInitGraph(g: Graph): void;
+/**
+ * Recursively scan subgraphs of g, appending clusters to clist.
+ * Non-cluster subgraphs are transparent — their cluster children are promoted.
+ * @see lib/osage/osageinit.c:mkClusters (inner loop)
+ */
+export declare function mkClustersInto(g: Graph, clist: Array<Graph | null>, parent: Graph): void;
+/**
+ * Discover all cluster subgraphs in g and populate GraphInfo.clust /
+ * GraphInfo.n_cluster for each cluster found.
+ *
+ * Non-cluster subgraphs are transparent: their cluster children are
+ * promoted to the nearest enclosing cluster ancestor.
+ *
+ * @see lib/osage/osageinit.c:mkClusters
+ */
+export declare function mkClusters(g: Graph, pclist: Graph[] | null, parent: Graph): void;
+/** Clone a Box (shallow copy of nested points). */
+export declare function cloneBox(b: Box): Box;
+/** Build a PackInfo initialised from graph attributes. @see lib/osage/osageinit.c:layout */
+export declare function buildPackInfo(g: Graph): PackInfo;
+/** Holds the parallel arrays built before calling putRects. */
+export interface OsageChildLists {
+    gs: Box[];
+    childGraphs: Graph[];
+    childNodes: Node[];
+    vals: number[];
+}
+/** Append one subcluster to the child lists. @see lib/osage/osageinit.c:layout (sortv via late_int) */
+export declare function addSubcluster(lists: OsageChildLists, subg: Graph, useVals: boolean): void;
+/** Append one loose node to the child lists and claim it for cluster g. */
+export declare function addLooseNode(lists: OsageChildLists, n: Node, g: Graph, useVals: boolean): void;
+/** Build the child lists for g's direct children (subclusters + loose nodes). */
+export declare function buildChildLists(g: Graph, nClust: number, nvs: number, useVals: boolean): OsageChildLists;
+/** Raw bounding box accumulator returned by applyOffsets. */
+export interface RawBB {
+    llx: number;
+    lly: number;
+    urx: number;
+    ury: number;
+}
+/** Apply putRects translation offsets; return the union bounding box. */
+export declare function applyOffsets(lists: OsageChildLists, pts: Array<{
+    x: number;
+    y: number;
+}>): RawBB;
+/** Widen rbb horizontally to fit the graph label (if any). */
+export declare function applyLabelExpansion(g: Graph, total: number, rbb: RawBB): RawBB;
+/** Add margin and border padding to rbb.
+ * C: rootbb.LL.y -= margin + GD_border(g)[BOTTOM_IX].y (index 0, NOT 3);
+ *    rootbb.UR.y += margin + GD_border(g)[TOP_IX].y.
+ * @see lib/osage/osageinit.c:186-187, lib/common/const.h:111-114 */
+export declare function addMarginAndBorder(g: Graph, margin: number, rbb: RawBB): RawBB;
+/** Subtract rbb.ll from all child cluster bbs (translate to origin). */
+export declare function originShiftClusters(childGraphs: Graph[], rbb: RawBB): void;
+/** Subtract rbb.ll from all child node coords (translate to origin). */
+export declare function originShiftNodes(childNodes: Node[], rbb: RawBB): void;
+/** Translate all children so the cluster's LL becomes (0,0). */
+export declare function translateToOrigin(lists: OsageChildLists, rbb: RawBB): void;
+/**
+ * Recurse into each direct subcluster; return total node count across them.
+ * @see lib/osage/osageinit.c:layout (subcluster recursion)
+ */
+export declare function recurseSubclusters(g: Graph, nClust: number, depth: number): number;
+/**
+ * Pack the direct children of g and set g.info.bb.
+ * @see lib/osage/osageinit.c:layout (rect-packing block)
+ */
+export declare function packChildren(g: Graph, nClust: number, nvs: number, total: number, depth: number): void;
+/**
+ * Recursively pack all direct children (subclusters + loose nodes) of g
+ * into a bounding box. After this pass every cluster has LL=(0,0).
+ *
+ * @see lib/osage/osageinit.c:layout
+ */
+export declare function osageLayoutRec(g: Graph, depth: number): void;
+/** Shift directly-owned node coords by bb.ll to convert to absolute. */
+export declare function repositionNodes(g: Graph, bb: Box): void;
+/** Shift a subcluster bb by parentBb.ll. */
+export declare function shiftSubclusterBb(subg: Graph, parentBb: Box): void;
+/**
+ * Convert local (cluster-relative) coordinates to absolute root-relative
+ * coordinates by walking the cluster tree top-down and accumulating bb.ll.
+ *
+ * @see lib/osage/osageinit.c:reposition
+ */
+export declare function osageReposition(g: Graph, depth: number): void;
+/**
+ * Main osage layout entry point.
+ *
+ * Pipeline:
+ * 1. clusterInitGraph — node/edge init
+ * 2. mkClusters — cluster discovery
+ * 3. osageLayoutRec — recursive rectangle packing
+ * 4. osageReposition — convert to absolute coordinates
+ * 5. splineEdges — edge routing (skipped when EDGETYPE_NONE)
+ *
+ * @see lib/osage/osageinit.c:osage_layout
+ */
+export declare function osageLayout(g: Graph): void;
+/** Recursively clear cluster arrays from g and all subclusters. */
+export declare function cleanupGraphs(g: Graph): void;
+/**
+ * Free all layout-specific memory attached to g.
+ *
+ * Clears alg (osage ownership tag) from all nodes and removes cluster
+ * arrays from GraphInfo.
+ *
+ * @see lib/osage/osageinit.c:osage_cleanup
+ */
+export declare function osageCleanup(g: Graph): void;
+/**
+ * Osage layout engine plugin object, suitable for registration with
+ * GvcContext.
+ *
+ * @see lib/plugin/neato_layout/gvlayout_neato_layout.c
+ */
+export declare const OSAGE_LAYOUT_ENGINE: LayoutEngine;
+//# sourceMappingURL=index.d.ts.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../../src/layout/osage/index.ts"],"names":[],"mappings":"AAEA;;;;;;;;GAQG;AAEH,OAAO,KAAK,EAAE,KAAK,EAAE,MAAM,sBAAsB,CAAC;AAClD,OAAO,KAAK,EAAE,IAAI,EAAE,MAAM,qBAAqB,CAAC;AAChD,OAAO,KAAK,EAAE,GAAG,EAAE,MAAM,qBAAqB,CAAC;AAC/C,OAAO,KAAK,EAAE,YAAY,EAAE,MAAM,sBAAsB,CAAC;AACzD,OAAO,KAAK,EAAE,QAAQ,EAAE,MAAM,kBAAkB,CAAC;AA2CjD;;;;;;;GAOG;AACH,wBAAgB,MAAM,CAAC,CAAC,EAAE,IAAI,GAAG,KAAK,GAAG,IAAI,CAK5C;AAMD;;;;;;GAMG;AACH,wBAAgB,SAAS,CAAC,CAAC,EAAE,KAAK,GAAG,OAAO,CAI3C;AAMD;;;;;;;GAOG;AACH,wBAAgB,gBAAgB,CAAC,CAAC,EAAE,KAAK,GAAG,IAAI,CAmC/C;AAMD;;;;GAIG;AACH,wBAAgB,cAAc,CAC5B,CAAC,EAAE,KAAK,EACR,KAAK,EAAE,KAAK,CAAC,KAAK,GAAG,IAAI,CAAC,EAC1B,MAAM,EAAE,KAAK,GACZ,IAAI,CAaN;AAED;;;;;;;;GAQG;AACH,wBAAgB,UAAU,CACxB,CAAC,EAAE,KAAK,EACR,MAAM,EAAE,KAAK,EAAE,GAAG,IAAI,EACtB,MAAM,EAAE,KAAK,GACZ,IAAI,CAUN;AAMD,mDAAmD;AACnD,wBAAgB,QAAQ,CAAC,CAAC,EAAE,GAAG,GAAG,GAAG,CAEpC;AAED,4FAA4F;AAC5F,wBAAgB,aAAa,CAAC,CAAC,EAAE,KAAK,GAAG,QAAQ,CAShD;AAED,+DAA+D;AAC/D,MAAM,WAAW,eAAe;IAC9B,EAAE,EAAE,GAAG,EAAE,CAAC;IACV,WAAW,EAAE,KAAK,EAAE,CAAC;IACrB,UAAU,EAAE,IAAI,EAAE,CAAC;IACnB,IAAI,EAAE,MAAM,EAAE,CAAC;CAChB;AAED,uGAAuG;AACvG,wBAAgB,aAAa,CAC3B,KAAK,EAAE,eAAe,EACtB,IAAI,EAAE,KAAK,EACX,OAAO,EAAE,OAAO,GACf,IAAI,CAIN;AAED,2EAA2E;AAC3E,wBAAgB,YAAY,CAC1B,KAAK,EAAE,eAAe,EACtB,CAAC,EAAE,IAAI,EACP,CAAC,EAAE,KAAK,EACR,OAAO,EAAE,OAAO,GACf,IAAI,CAQN;AAED,iFAAiF;AACjF,wBAAgB,eAAe,CAC7B,CAAC,EAAE,KAAK,EACR,MAAM,EAAE,MAAM,EACd,GAAG,EAAE,MAAM,EACX,OAAO,EAAE,OAAO,GACf,eAAe,CAgBjB;AAED,6DAA6D;AAC7D,MAAM,WAAW,KAAK;IACpB,GAAG,EAAE,MAAM,CAAC;IAAC,GAAG,EAAE,MAAM,CAAC;IAAC,GAAG,EAAE,MAAM,CAAC;IAAC,GAAG,EAAE,MAAM,CAAC;CACpD;AAED,yEAAyE;AACzE,wBAAgB,YAAY,CAAC,KAAK,EAAE,eAAe,EAAE,GAAG,EAAE,KAAK,CAAC;IAAE,CAAC,EAAE,MAAM,CAAC;IAAC,CAAC,EAAE,MAAM,CAAA;CAAE,CAAC,GAAG,KAAK,CAoBhG;AAED,8DAA8D;AAC9D,wBAAgB,mBAAmB,CAAC,CAAC,EAAE,KAAK,EAAE,KAAK,EAAE,MAAM,EAAE,GAAG,EAAE,KAAK,GAAG,KAAK,CAQ9E;AAED;;;oEAGoE;AACpE,wBAAgB,kBAAkB,CAAC,CAAC,EAAE,KAAK,EAAE,MAAM,EAAE,MAAM,EAAE,GAAG,EAAE,KAAK,GAAG,KAAK,CAQ9E;AAED,wEAAwE;AACxE,wBAAgB,mBAAmB,CAAC,WAAW,EAAE,KAAK,EAAE,EAAE,GAAG,EAAE,KAAK,GAAG,IAAI,CAS1E;AAED,wEAAwE;AACxE,wBAAgB,gBAAgB,CAAC,UAAU,EAAE,IAAI,EAAE,EAAE,GAAG,EAAE,KAAK,GAAG,IAAI,CAQrE;AAED,gEAAgE;AAChE,wBAAgB,iBAAiB,CAAC,KAAK,EAAE,eAAe,EAAE,GAAG,EAAE,KAAK,GAAG,IAAI,CAG1E;AAMD;;;GAGG;AACH,wBAAgB,kBAAkB,CAAC,CAAC,EAAE,KAAK,EAAE,MAAM,EAAE,MAAM,EAAE,KAAK,EAAE,MAAM,GAAG,MAAM,CAQlF;AAED;;;GAGG;AACH,wBAAgB,YAAY,CAC1B,CAAC,EAAE,KAAK,EAAE,MAAM,EAAE,MAAM,EAAE,GAAG,EAAE,MAAM,EAAE,KAAK,EAAE,MAAM,EAAE,KAAK,EAAE,MAAM,GAClE,IAAI,CAYN;AAED;;;;;GAKG;AACH,wBAAgB,cAAc,CAAC,CAAC,EAAE,KAAK,EAAE,KAAK,EAAE,MAAM,GAAG,IAAI,CAS5D;AAMD,wEAAwE;AACxE,wBAAgB,eAAe,CAAC,CAAC,EAAE,KAAK,EAAE,EAAE,EAAE,GAAG,GAAG,IAAI,CAQvD;AAED,4CAA4C;AAC5C,wBAAgB,iBAAiB,CAAC,IAAI,EAAE,KAAK,EAAE,QAAQ,EAAE,GAAG,GAAG,IAAI,CAMlE;AAMD;;;;;GAKG;AACH,wBAAgB,eAAe,CAAC,CAAC,EAAE,KAAK,EAAE,KAAK,EAAE,MAAM,GAAG,IAAI,CAS7D;AAMD;;;;;;;;;;;GAWG;AACH,wBAAgB,WAAW,CAAC,CAAC,EAAE,KAAK,GAAG,IAAI,CA6B1C;AAMD,mEAAmE;AACnE,wBAAgB,aAAa,CAAC,CAAC,EAAE,KAAK,GAAG,IAAI,CAK5C;AAMD;;;;;;;GAOG;AACH,wBAAgB,YAAY,CAAC,CAAC,EAAE,KAAK,GAAG,IAAI,CAK3C;AAMD;;;;;GAKG;AACH,eAAO,MAAM,mBAAmB,EAAE,YAIjC,CAAC"}

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

@@ -0,0 +1,49 @@
+/**
+ * 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

@@ -0,0 +1 @@
+{"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/osage/types.d.ts

@@ -0,0 +1,28 @@
+/**
+ * Shared types for the osage layout module.
+ *
+ * Kept in a separate file so lizard does not conflate interface field
+ * names with function parameter counts in layout.ts.
+ *
+ * @see lib/osage/osageinit.c
+ */
+import type { Graph } from '../../model/graph.js';
+import type { Node } from '../../model/node.js';
+import type { Box } from '../../model/geom.js';
+/**
+ * Parallel arrays describing the direct children of a cluster, built
+ * before calling putRects.
+ *
+ * @see lib/osage/osageinit.c:layout (gs / children / vals lists)
+ */
+export interface ChildLists {
+    /** Bounding boxes of all children (subclusters first, then loose nodes). */
+    gs: Box[];
+    /** Subcluster graphs, in the same index order as the first N entries of gs. */
+    childGraphs: Graph[];
+    /** Loose nodes, in the same index order as entries N+ of gs. */
+    childNodes: Node[];
+    /** Per-child sort values for l_array / PK_USER_VALS mode. */
+    vals: number[];
+}
+//# sourceMappingURL=types.d.ts.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"types.d.ts","sourceRoot":"","sources":["../../../src/layout/osage/types.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,GAAG,EAAE,MAAM,qBAAqB,CAAC;AAE/C;;;;;GAKG;AACH,MAAM,WAAW,UAAU;IACzB,4EAA4E;IAC5E,EAAE,EAAE,GAAG,EAAE,CAAC;IACV,+EAA+E;IAC/E,WAAW,EAAE,KAAK,EAAE,CAAC;IACrB,gEAAgE;IAChE,UAAU,EAAE,IAAI,EAAE,CAAC;IACnB,6DAA6D;IAC7D,IAAI,EAAE,MAAM,EAAE,CAAC;CAChB"}

package/dist/layout/pack/array-pack.d.ts

@@ -0,0 +1,114 @@
+/**
+ * Array-based rectangle packing algorithm.
+ *
+ * @see lib/pack/pack.c:arrayRects
+ */
+import type { Box, Point } from '../../model/geom.js';
+import { type PackInfo } from './types.js';
+/** Internal info for one rectangle during array packing. */
+export interface AInfo {
+    width: number;
+    height: number;
+    index: number;
+}
+/** Grid layout dimensions. */
+export interface GridDims {
+    nc: number;
+    nr: number;
+    rowMajor: boolean;
+}
+/** Mutable column/row cursor for grid traversal. */
+export interface GridCursor {
+    col: {
+        val: number;
+    };
+    row: {
+        val: number;
+    };
+}
+/**
+ * Advance a grid cursor by one cell.
+ *
+ * @see lib/pack/pack.c:INC
+ */
+export declare function inc(cursor: GridCursor, dims: GridDims): void;
+/**
+ * Compute grid dimensions and row-major flag from pinfo.
+ *
+ * @see lib/pack/pack.c:arrayRects (grid setup block)
+ */
+export declare function computeGrid(ng: number, pinfo: PackInfo): GridDims;
+/**
+ * Build AInfo array from bounding boxes.
+ *
+ * @see lib/pack/pack.c:arrayRects (ainfo construction)
+ */
+export declare function buildAInfo(ng: number, gs: Box[], margin: number): AInfo[];
+/**
+ * Sort comparator: ascending by user vals[index].
+ *
+ * @see lib/pack/pack.c:ucmpf
+ */
+export declare function cmpByUserVals(a: AInfo, b: AInfo, vals: number[]): number;
+/**
+ * Sort comparator: descending by width+height.
+ *
+ * @see lib/pack/pack.c:acmpf
+ */
+export declare function cmpByPerimeter(a: AInfo, b: AInfo): number;
+/**
+ * Sort AInfo array according to pinfo sort flags.
+ *
+ * @see lib/pack/pack.c:arrayRects (sort block)
+ */
+export declare function sortAInfo(info: AInfo[], pinfo: PackInfo): AInfo[];
+/**
+ * Accumulate max width per column and max height per row from sorted info.
+ *
+ * @see lib/pack/pack.c:arrayRects (column/row max pass)
+ */
+export declare function accumulateMaxima(sinfo: AInfo[], widths: number[], heights: number[], dims: GridDims): void;
+/**
+ * Convert widths to cumulative x positions (left to right).
+ *
+ * @see lib/pack/pack.c:arrayRects (widths prefix-sum)
+ */
+export declare function widthsToCumulative(widths: number[]): void;
+/**
+ * Convert heights to cumulative y positions (bottom to top).
+ *
+ * @see lib/pack/pack.c:arrayRects (heights prefix-sum)
+ */
+export declare function heightsToCumulative(heights: number[], nr: number): void;
+/**
+ * Compute x placement for one rect using alignment flags.
+ *
+ * @see lib/pack/pack.c:arrayRects (placement x)
+ */
+export declare function placeX(flags: number, widths: number[], col: number, bb: Box): number;
+/**
+ * Compute y placement for one rect using alignment flags.
+ *
+ * @see lib/pack/pack.c:arrayRects (placement y)
+ */
+export declare function placeY(flags: number, heights: number[], row: number, bb: Box): number;
+/** Accumulated position tables for array packing. */
+interface PosTables {
+    widths: number[];
+    heights: number[];
+}
+/**
+ * Position rects into the places array using sorted info and cumulative tables.
+ *
+ * @see lib/pack/pack.c:arrayRects (position rects block)
+ */
+export declare function positionRects(sinfo: AInfo[], gs: Box[], flags: number, tables: PosTables, dims: GridDims): Point[];
+/**
+ * Pack rectangles into an array layout.
+ * Returns translation points indexed by original rectangle index.
+ *
+ * @see lib/pack/pack.c:arrayRects
+ */
+export declare function arrayRects(ng: number, gs: Box[], pinfo: PackInfo): Point[] | null;
+export {};
+//# sourceMappingURL=array-pack.d.ts.map

package/dist/layout/pack/array-pack.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"array-pack.d.ts","sourceRoot":"","sources":["../../../src/layout/pack/array-pack.ts"],"names":[],"mappings":"AAEA;;;;GAIG;AAEH,OAAO,KAAK,EAAE,GAAG,EAAE,KAAK,EAAE,MAAM,qBAAqB,CAAC;AACtD,OAAO,EACL,KAAK,QAAQ,EAQd,MAAM,YAAY,CAAC;AAIpB,4DAA4D;AAC5D,MAAM,WAAW,KAAK;IACpB,KAAK,EAAE,MAAM,CAAC;IACd,MAAM,EAAE,MAAM,CAAC;IACf,KAAK,EAAE,MAAM,CAAC;CACf;AAED,8BAA8B;AAC9B,MAAM,WAAW,QAAQ;IACvB,EAAE,EAAE,MAAM,CAAC;IACX,EAAE,EAAE,MAAM,CAAC;IACX,QAAQ,EAAE,OAAO,CAAC;CACnB;AAED,oDAAoD;AACpD,MAAM,WAAW,UAAU;IACzB,GAAG,EAAE;QAAE,GAAG,EAAE,MAAM,CAAA;KAAE,CAAC;IACrB,GAAG,EAAE;QAAE,GAAG,EAAE,MAAM,CAAA;KAAE,CAAC;CACtB;AAED;;;;GAIG;AACH,wBAAgB,GAAG,CAAC,MAAM,EAAE,UAAU,EAAE,IAAI,EAAE,QAAQ,GAAG,IAAI,CAM5D;AAED;;;;GAIG;AACH,wBAAgB,WAAW,CAAC,EAAE,EAAE,MAAM,EAAE,KAAK,EAAE,QAAQ,GAAG,QAAQ,CAQjE;AAED;;;;GAIG;AACH,wBAAgB,UAAU,CAAC,EAAE,EAAE,MAAM,EAAE,EAAE,EAAE,GAAG,EAAE,EAAE,MAAM,EAAE,MAAM,GAAG,KAAK,EAAE,CAYzE;AAED;;;;GAIG;AACH,wBAAgB,aAAa,CAAC,CAAC,EAAE,KAAK,EAAE,CAAC,EAAE,KAAK,EAAE,IAAI,EAAE,MAAM,EAAE,GAAG,MAAM,CAExE;AAED;;;;GAIG;AACH,wBAAgB,cAAc,CAAC,CAAC,EAAE,KAAK,EAAE,CAAC,EAAE,KAAK,GAAG,MAAM,CAEzD;AAED;;;;GAIG;AACH,wBAAgB,SAAS,CAAC,IAAI,EAAE,KAAK,EAAE,EAAE,KAAK,EAAE,QAAQ,GAAG,KAAK,EAAE,CAajE;AAED;;;;GAIG;AACH,wBAAgB,gBAAgB,CAC9B,KAAK,EAAE,KAAK,EAAE,EACd,MAAM,EAAE,MAAM,EAAE,EAChB,OAAO,EAAE,MAAM,EAAE,EACjB,IAAI,EAAE,QAAQ,GACb,IAAI,CAON;AAED;;;;GAIG;AACH,wBAAgB,kBAAkB,CAAC,MAAM,EAAE,MAAM,EAAE,GAAG,IAAI,CAOzD;AAED;;;;GAIG;AACH,wBAAgB,mBAAmB,CAAC,OAAO,EAAE,MAAM,EAAE,EAAE,EAAE,EAAE,MAAM,GAAG,IAAI,CAQvE;AAED;;;;GAIG;AACH,wBAAgB,MAAM,CAAC,KAAK,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,EAAE,EAAE,GAAG,EAAE,MAAM,EAAE,EAAE,EAAE,GAAG,GAAG,MAAM,CASpF;AAED;;;;GAIG;AACH,wBAAgB,MAAM,CAAC,KAAK,EAAE,MAAM,EAAE,OAAO,EAAE,MAAM,EAAE,EAAE,GAAG,EAAE,MAAM,EAAE,EAAE,EAAE,GAAG,GAAG,MAAM,CAOrF;AAED,qDAAqD;AACrD,UAAU,SAAS;IACjB,MAAM,EAAE,MAAM,EAAE,CAAC;IACjB,OAAO,EAAE,MAAM,EAAE,CAAC;CACnB;AAED;;;;GAIG;AACH,wBAAgB,aAAa,CAC3B,KAAK,EAAE,KAAK,EAAE,EACd,EAAE,EAAE,GAAG,EAAE,EACT,KAAK,EAAE,MAAM,EACb,MAAM,EAAE,SAAS,EACjB,IAAI,EAAE,QAAQ,GACb,KAAK,EAAE,CAcT;AAED;;;;;GAKG;AACH,wBAAgB,UAAU,CAAC,EAAE,EAAE,MAAM,EAAE,EAAE,EAAE,GAAG,EAAE,EAAE,KAAK,EAAE,QAAQ,GAAG,KAAK,EAAE,GAAG,IAAI,CASjF"}

package/dist/layout/pack/index.d.ts

@@ -0,0 +1,157 @@
+/**
+ * Public API for rectangle packing and connected-component decomposition.
+ * Ports lib/pack/pack.c and lib/pack/ccomps.c.
+ *
+ * @see lib/pack/pack.c
+ * @see lib/pack/ccomps.c
+ */
+import type { Graph } from '../../model/graph.js';
+import type { Node } from '../../model/node.js';
+import type { Edge } from '../../model/edge.js';
+import type { Box, Point } from '../../model/geom.js';
+import { PackMode, PackInfo, PS2INCH, PK_COL_MAJOR, PK_USER_VALS, PK_LEFT_ALIGN, PK_RIGHT_ALIGN, PK_TOP_ALIGN, PK_BOT_ALIGN, PK_INPUT_ORDER } from './types.js';
+export { PackMode, PS2INCH, PK_COL_MAJOR, PK_USER_VALS, PK_LEFT_ALIGN, PK_RIGHT_ALIGN, PK_TOP_ALIGN, PK_BOT_ALIGN, PK_INPUT_ORDER, };
+export type { PackInfo };
+export { ps2inch, inch2ps } from './types.js';
+/**
+ * Compute bounding-box packing offsets for ng bare rectangles.
+ * Returns null for Aspect mode (not implemented in C) or Node/Cluster mode
+ * (no node geometry available).
+ * @see lib/pack/pack.c:putRects
+ */
+export declare function putRects(ng: number, bbs: Box[], pinfo: PackInfo): Point[] | null;
+/**
+ * Pack bare rectangles; updates bbs in place. Returns 0 on success.
+ * @see lib/pack/pack.c:packRects
+ */
+export declare function packRects(ng: number, bbs: Box[], pinfo: PackInfo): number;
+/** Node x-coordinate (0 if unset). */
+export declare function nodeCoordX(n: Node): number;
+/** Node y-coordinate (0 if unset). */
+export declare function nodeCoordY(n: Node): number;
+/** Expand accumulated bounds by one node. */
+export declare function expandBounds(b: {
+    llx: number;
+    lly: number;
+    urx: number;
+    ury: number;
+}, n: Node, margin: number): void;
+/**
+ * Compute a graph's bounding box: node extents, plus every routed edge spline
+ * and edge label.
+ *
+ * This is the port of C's `compute_bb` — the final bb of every non-dot engine
+ * (neato/fdp/sfdp/circo/twopi/osage all reach it, and `pack` uses it for
+ * component boxes; dot sets its own bb in `set_aspect`). It was node-only until
+ * 2026-07-12, which truncated the box of any graph whose edges leave the node
+ * hull; see `expandBoundsByEdge`.
+ *
+ * DELIBERATE DEVIATION from C's `compute_bb`, which also expands over node
+ * xlabels, cluster bbs, and the graph label: the port already grows the bb for
+ * those in dedicated passes (the xlabel placement pass, `addClusters`, and
+ * `placeGraphLabel`, each of which runs after this call and expands
+ * `g.info.bb`). Folding them in here as well would double-expand rather than
+ * match C. The edge arm has no such counterpart pass — it was simply missing.
+ *
+ * @see lib/common/utils.c:633 compute_bb
+ * @see lib/neatogen/neatoinit.c:1419 (compute_bb called right after spline_edges)
+ * @see lib/pack/pack.c:801 computeBB
+ */
+export declare function computeSubgraphBB(g: Graph, margin: number, refineSplines?: boolean): Box;
+/** Extract bounding boxes for an array of subgraphs. */
+export declare function subgraphBBs(gs: Graph[], margin: number): Box[];
+/**
+ * Compute packing translation deltas for ng pre-laid-out subgraphs.
+ * Bounding boxes are raw (C compute_bb has no margin; the packers add
+ * the margin themselves).
+ * @see lib/pack/pack.c:putGraphs
+ */
+export declare function putGraphs(ng: number, gs: Graph[], root: Graph, pinfo: PackInfo): Point[] | null;
+/**
+ * Pack subgraphs; returns 0 on success.
+ * @see lib/pack/pack.c:packGraphs
+ */
+export declare function packGraphs(ng: number, gs: Graph[], root: Graph, pinfo: PackInfo): number;
+/**
+ * Pack subgraphs and update root bounding box.
+ * @see lib/pack/pack.c:packSubgraphs
+ */
+export declare function packSubgraphs(ng: number, gs: Graph[], root: Graph, pinfo: PackInfo): number;
+/** Shift all nodes in g by (dx, dy) points. @see lib/pack/pack.c:shiftGraph */
+/**
+ * Shift a graph's bb, label position, and all nested cluster bbs.
+ * @see lib/pack/pack.c:shiftGraph
+ */
+export declare function shiftGraphBBs(g: Graph, dx: number, dy: number): void;
+/** Translate an edge's spline points and all four label kinds.
+ * C shiftEdge moves ED_label, ED_xlabel, ED_head_label, ED_tail_label — every
+ * one, in that order — before the spline. Omitting the port (head/tail) or
+ * external labels leaves them behind the shift delta when normalizeGraphBB
+ * translates a label-expanded drawing to origin (twopi 144 head/tail-label
+ * x-offset). @see lib/pack/pack.c:shiftEdge */
+export declare function shiftEdgePoints(e: Edge, dx: number, dy: number): void;
+export declare function shiftOneGraph(g: Graph, dx: number, dy: number): void;
+/**
+ * Normalize bb.ll to (0,0) by shifting all nodes, edges, and the bb itself.
+ * Uses g.info.bb.ll (which includes spline extent from clipAndInstall) as the
+ * translation offset — matching C's translate_drawing which reads GD_bb(g).LL
+ * after clip_and_install has expanded it via update_bb_bz. A node-only
+ * recompute here would discard spline extent (twopi-self-loop divergence).
+ * @see lib/common/postproc.c:translate_drawing
+ * @see lib/common/splines.c:clip_and_install
+ */
+export declare function normalizeGraphBB(g: Graph): void;
+/**
+ * Apply packing translation DELTAS to subgraphs; shifts coords, pos,
+ * bbs, labels, and cluster bbs. Spline shifting (doSplines) is not
+ * ported — no packing caller has routed edges before packing yet.
+ * @see lib/pack/pack.c:shiftGraphs
+ */
+export declare function shiftGraphs(ng: number, gs: Graph[], pp: Point[], _root: Graph, _doSplines: boolean): number;
+/** DFS to collect connected component nodes. @see lib/pack/ccomps.c */
+export declare function dfsCollect(g: Graph, start: Node, visited: Set<string>): Node[];
+/** Build a subgraph containing only nodes. @see lib/pack/ccomps.c */
+export declare function buildSubgraph(root: Graph, nodes: Node[], name: string): Graph;
+/**
+ * Decompose g into connected components (nodes only, no edges).
+ * @see lib/pack/ccomps.c:ccomps
+ */
+export declare function ccomps(g: Graph, pfx: string): Graph[];
+/**
+ * ccomps variant — same as ccomps for this port.
+ * @see lib/pack/ccomps.c:cccomps
+ */
+export declare function cccomps(g: Graph, pfx: string): Graph[];
+/**
+ * ccomps with pinned-node detection.
+ * @see lib/pack/ccomps.c:pccomps
+ */
+export declare function pccomps(g: Graph, pfx: string): {
+    graphs: Graph[];
+    pinned: boolean;
+};
+/** True if g has exactly one connected component. @see lib/pack/ccomps.c:isConnected */
+export declare function isConnected(g: Graph): boolean;
+/**
+ * Consume an optional `_<flags>` suffix after "array", OR-ing flag
+ * bits into pinfo. Returns the rest of the string (possible column
+ * count). @see lib/pack/pack.c:chkFlags
+ */
+export declare function chkFlags(p: string, pinfo: PackInfo): string;
+/** Parse pack mode from string attribute. @see lib/pack/pack.c:parsePackModeInfo */
+export declare function parsePackModeInfo(p: string, dflt: PackMode, pinfo: PackInfo): PackMode;
+/** Read pack mode from the "packmode" graph attr. @see lib/pack/pack.c:getPackModeInfo */
+export declare function getPackModeInfo(g: Graph, dflt: PackMode, pinfo: PackInfo): PackMode;
+/** Get pack mode from graph. @see lib/pack/pack.c:getPackMode */
+export declare function getPackMode(g: Graph, dflt: PackMode): PackMode;
+/**
+ * Read the "pack" graph attr: unset → notDef; non-negative int →
+ * value; true-ish ('t'/'T') → dflt; otherwise notDef.
+ * @see lib/pack/pack.c:getPack
+ */
+export declare function getPack(g: Graph, notDef: number, dflt: number): number;
+/** Populate PackInfo from graph attributes. @see lib/pack/pack.c:getPackInfo */
+export declare function getPackInfo(g: Graph, dflt: PackMode, dfltMargin: number, pinfo: PackInfo): PackMode;
+/** @see lib/pack/ccomps.c:mapClust */
+export declare function mapClust(cl: Graph): Graph;
+//# sourceMappingURL=index.d.ts.map

package/dist/layout/pack/index.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../../src/layout/pack/index.ts"],"names":[],"mappings":"AAEA;;;;;;GAMG;AAEH,OAAO,KAAK,EAAE,KAAK,EAAE,MAAM,sBAAsB,CAAC;AAClD,OAAO,KAAK,EAAE,IAAI,EAAE,MAAM,qBAAqB,CAAC;AAChD,OAAO,KAAK,EAAE,IAAI,EAAE,MAAM,qBAAqB,CAAC;AAChD,OAAO,KAAK,EAAE,GAAG,EAAE,KAAK,EAAE,MAAM,qBAAqB,CAAC;AAOtD,OAAO,EACL,QAAQ,EAAE,QAAQ,EAClB,OAAO,EAAE,YAAY,EAAE,YAAY,EAAE,aAAa,EAClD,cAAc,EAAE,YAAY,EAAE,YAAY,EAAE,cAAc,EAC3D,MAAM,YAAY,CAAC;AAEpB,OAAO,EACL,QAAQ,EAAE,OAAO,EACjB,YAAY,EAAE,YAAY,EAAE,aAAa,EAAE,cAAc,EACzD,YAAY,EAAE,YAAY,EAAE,cAAc,GAC3C,CAAC;AACF,YAAY,EAAE,QAAQ,EAAE,CAAC;AACzB,OAAO,EAAE,OAAO,EAAE,OAAO,EAAE,MAAM,YAAY,CAAC;AAM9C;;;;;GAKG;AACH,wBAAgB,QAAQ,CAAC,EAAE,EAAE,MAAM,EAAE,GAAG,EAAE,GAAG,EAAE,EAAE,KAAK,EAAE,QAAQ,GAAG,KAAK,EAAE,GAAG,IAAI,CAMhF;AAED;;;GAGG;AACH,wBAAgB,SAAS,CAAC,EAAE,EAAE,MAAM,EAAE,GAAG,EAAE,GAAG,EAAE,EAAE,KAAK,EAAE,QAAQ,GAAG,MAAM,CAYzE;AAMD,sCAAsC;AACtC,wBAAgB,UAAU,CAAC,CAAC,EAAE,IAAI,GAAG,MAAM,CAE1C;AACD,sCAAsC;AACtC,wBAAgB,UAAU,CAAC,CAAC,EAAE,IAAI,GAAG,MAAM,CAE1C;AACD,6CAA6C;AAC7C,wBAAgB,YAAY,CAC1B,CAAC,EAAE;IAAE,GAAG,EAAE,MAAM,CAAC;IAAC,GAAG,EAAE,MAAM,CAAC;IAAC,GAAG,EAAE,MAAM,CAAC;IAAC,GAAG,EAAE,MAAM,CAAA;CAAE,EACzD,CAAC,EAAE,IAAI,EAAE,MAAM,EAAE,MAAM,GACtB,IAAI,CAUN;AA0ED;;;;;;;;;;;;;;;;;;;;GAoBG;AACH,wBAAgB,iBAAiB,CAAC,CAAC,EAAE,KAAK,EAAE,MAAM,EAAE,MAAM,EAAE,aAAa,UAAQ,GAAG,GAAG,CAOtF;AAED,wDAAwD;AACxD,wBAAgB,WAAW,CAAC,EAAE,EAAE,KAAK,EAAE,EAAE,MAAM,EAAE,MAAM,GAAG,GAAG,EAAE,CAE9D;AAMD;;;;;GAKG;AACH,wBAAgB,SAAS,CAAC,EAAE,EAAE,MAAM,EAAE,EAAE,EAAE,KAAK,EAAE,EAAE,IAAI,EAAE,KAAK,EAAE,KAAK,EAAE,QAAQ,GAAG,KAAK,EAAE,GAAG,IAAI,CAkB/F;AAED;;;GAGG;AACH,wBAAgB,UAAU,CAAC,EAAE,EAAE,MAAM,EAAE,EAAE,EAAE,KAAK,EAAE,EAAE,IAAI,EAAE,KAAK,EAAE,KAAK,EAAE,QAAQ,GAAG,MAAM,CAIxF;AAED;;;GAGG;AACH,wBAAgB,aAAa,CAAC,EAAE,EAAE,MAAM,EAAE,EAAE,EAAE,KAAK,EAAE,EAAE,IAAI,EAAE,KAAK,EAAE,KAAK,EAAE,QAAQ,GAAG,MAAM,CAI3F;AAMD,+EAA+E;AAC/E;;;GAGG;AACH,wBAAgB,aAAa,CAAC,CAAC,EAAE,KAAK,EAAE,EAAE,EAAE,MAAM,EAAE,EAAE,EAAE,MAAM,GAAG,IAAI,CAiBpE;AAED;;;;;+CAK+C;AAC/C,wBAAgB,eAAe,CAAC,CAAC,EAAE,IAAI,EAAE,EAAE,EAAE,MAAM,EAAE,EAAE,EAAE,MAAM,GAAG,IAAI,CA0BrE;AAED,wBAAgB,aAAa,CAAC,CAAC,EAAE,KAAK,EAAE,EAAE,EAAE,MAAM,EAAE,EAAE,EAAE,MAAM,GAAG,IAAI,CAcpE;AAED;;;;;;;;GAQG;AACH,wBAAgB,gBAAgB,CAAC,CAAC,EAAE,KAAK,GAAG,IAAI,CAM/C;AAED;;;;;GAKG;AACH,wBAAgB,WAAW,CACzB,EAAE,EAAE,MAAM,EAAE,EAAE,EAAE,KAAK,EAAE,EAAE,EAAE,EAAE,KAAK,EAAE,EAAE,KAAK,EAAE,KAAK,EAAE,UAAU,EAAE,OAAO,GACtE,MAAM,CAOR;AAMD,uEAAuE;AACvE,wBAAgB,UAAU,CAAC,CAAC,EAAE,KAAK,EAAE,KAAK,EAAE,IAAI,EAAE,OAAO,EAAE,GAAG,CAAC,MAAM,CAAC,GAAG,IAAI,EAAE,CAc9E;AAED,qEAAqE;AACrE,wBAAgB,aAAa,CAAC,IAAI,EAAE,KAAK,EAAE,KAAK,EAAE,IAAI,EAAE,EAAE,IAAI,EAAE,MAAM,GAAG,KAAK,CAa7E;AAED;;;GAGG;AACH,wBAAgB,MAAM,CAAC,CAAC,EAAE,KAAK,EAAE,GAAG,EAAE,MAAM,GAAG,KAAK,EAAE,CAUrD;AAED;;;GAGG;AACH,wBAAgB,OAAO,CAAC,CAAC,EAAE,KAAK,EAAE,GAAG,EAAE,MAAM,GAAG,KAAK,EAAE,CAEtD;AAED;;;GAGG;AACH,wBAAgB,OAAO,CAAC,CAAC,EAAE,KAAK,EAAE,GAAG,EAAE,MAAM,GAAG;IAAE,MAAM,EAAE,KAAK,EAAE,CAAC;IAAC,MAAM,EAAE,OAAO,CAAA;CAAE,CA4BnF;AAED,wFAAwF;AACxF,wBAAgB,WAAW,CAAC,CAAC,EAAE,KAAK,GAAG,OAAO,CAE7C;AAiBD;;;;GAIG;AACH,wBAAgB,QAAQ,CAAC,CAAC,EAAE,MAAM,EAAE,KAAK,EAAE,QAAQ,GAAG,MAAM,CAU3D;AAED,oFAAoF;AACpF,wBAAgB,iBAAiB,CAAC,CAAC,EAAE,MAAM,EAAE,IAAI,EAAE,QAAQ,EAAE,KAAK,EAAE,QAAQ,GAAG,QAAQ,CAsBtF;AAOD,0FAA0F;AAC1F,wBAAgB,eAAe,CAAC,CAAC,EAAE,KAAK,EAAE,IAAI,EAAE,QAAQ,EAAE,KAAK,EAAE,QAAQ,GAAG,QAAQ,CAEnF;AAED,iEAAiE;AACjE,wBAAgB,WAAW,CAAC,CAAC,EAAE,KAAK,EAAE,IAAI,EAAE,QAAQ,GAAG,QAAQ,CAG9D;AAED;;;;GAIG;AACH,wBAAgB,OAAO,CAAC,CAAC,EAAE,KAAK,EAAE,MAAM,EAAE,MAAM,EAAE,IAAI,EAAE,MAAM,GAAG,MAAM,CAOtE;AAED,gFAAgF;AAChF,wBAAgB,WAAW,CAAC,CAAC,EAAE,KAAK,EAAE,IAAI,EAAE,QAAQ,EAAE,UAAU,EAAE,MAAM,EAAE,KAAK,EAAE,QAAQ,GAAG,QAAQ,CASnG;AAED,sCAAsC;AACtC,wBAAgB,QAAQ,CAAC,EAAE,EAAE,KAAK,GAAG,KAAK,CAEzC"}

package/dist/layout/pack/poly-pack.d.ts

@@ -0,0 +1,126 @@
+/**
+ * Polyomino-based rectangle packing algorithm.
+ *
+ * Based on "Disconnected Graph Layout and the Polyomino Packing Approach",
+ * K. Freivalds et al., GD'01, LNCS 2265, pp. 378-391.
+ *
+ * @see lib/pack/pack.c:polyRects
+ * @see lib/pack/pack.c:computeStep
+ * @see lib/pack/pack.c:placeGraph
+ * @see lib/pack/pack.c:fits
+ */
+import type { Box, Point } from '../../model/geom.js';
+import type { PackInfo } from './types.js';
+/** Grid cell coverage info for one rectangle. */
+export interface GInfo {
+    perim: number;
+    cells: Point[];
+    index: number;
+}
+/** A set of occupied grid cells (string-keyed for O(1) lookup). */
+export type PointSet = Set<string>;
+/**
+ * Encode a grid point as a canonical string key.
+ *
+ * C keys its PointSet dict on the `pointf` cell itself (exact double compare,
+ * no rounding). Every cell coordinate reaching here is an exact integer grid
+ * index produced by genBox's `cround(cval(...))`, so the rounding mode is
+ * unobservable; `cround` is used only so no `Math.round` survives in a layout
+ * coordinate path.
+ * @see lib/common/pointset.h:45 (insertPS/inPS take pointf)
+ */
+export declare function psKey(x: number, y: number): string;
+/** Check if a cell is in the point set. @see lib/pack/pack.c:inPS */
+export declare function inPS(ps: PointSet, p: Point): boolean;
+/** Insert a cell into the point set. @see lib/pack/pack.c:insertPS */
+export declare function insertPS(ps: PointSet, p: Point): void;
+/**
+ * Compute the polyomino grid step size (positive root of quadratic).
+ *
+ * @see lib/pack/pack.c:computeStep
+ */
+export declare function computeStep(ng: number, bbs: Box[], margin: number): number;
+/**
+ * Number of grid cells required to cover length x at cell size s.
+ *
+ * @see lib/pack/pack.c:GRID
+ */
+export declare function gridCells(x: number, s: number): number;
+/**
+ * Grid cell index containing coordinate v at cell size s.
+ *
+ * C's `CVAL` macro is applied to the DOUBLE `pointf` fields inside `CELL`
+ * (genBox), so the division is floating-point — it yields a fractional cell
+ * coordinate that genBox then rounds (see {@link cround}). Modelling it with
+ * integer/truncating division (the previous `Math.floor`/`Math.trunc` form)
+ * diverges: e.g. `CVAL(-4, 5)` is `((-4+1)/5)-1 = -1.6` (→ round -2), not
+ * `-1`. That shrank every packed box's footprint by a cell on the negative
+ * side, packing the osage pack_neato2 grid tighter than native.
+ *
+ * @see lib/pack/pack.c:CVAL / CELL
+ */
+export declare function cval(v: number, s: number): number;
+/** Parameters for genBox. */
+export interface GenBoxParams {
+    bb: Box;
+    ssize: number;
+    margin: number;
+    idx: number;
+}
+/**
+ * Generate the grid cell coverage for a bounding box.
+ *
+ * @see lib/pack/pack.c:genBox
+ */
+export declare function genBox(p: GenBoxParams): GInfo;
+/** Context passed to fits() and placeGraph(). */
+export interface PlaceCtx {
+    ps: PointSet;
+    step: number;
+    bbs: Box[];
+}
+/**
+ * Test whether any shifted cell collides with the occupied set.
+ * Returns true if there is a collision (polyomino does NOT fit).
+ *
+ * @see lib/pack/pack.c:fits (collision check loop)
+ */
+export declare function hasCollision(cells: Point[], dx: number, dy: number, ps: PointSet): boolean;
+/**
+ * Mark all shifted cells as occupied in the point set.
+ *
+ * @see lib/pack/pack.c:fits (cell insertion loop)
+ */
+export declare function markCells(cells: Point[], dx: number, dy: number, ps: PointSet): void;
+/**
+ * Test if a polyomino fits at (x,y); if so, record placement and fill cells.
+ *
+ * @see lib/pack/pack.c:fits
+ */
+export declare function fits(x: number, y: number, info: GInfo, ctx: PlaceCtx): Point | null;
+/**
+ * Try centered placement for the first graph (i === 0).
+ *
+ * @see lib/pack/pack.c:placeGraph (i==0 branch)
+ */
+export declare function tryCenter(info: GInfo, ctx: PlaceCtx, margin: number): Point | null;
+/**
+ * Search concentric square spiral for a placement of the polyomino.
+ *
+ * @see lib/pack/pack.c:placeGraph
+ */
+export declare function placeGraph(i: number, info: GInfo, ctx: PlaceCtx, margin: number): Point;
+/**
+ * Sort GInfo by descending perimeter.
+ *
+ * @see lib/pack/pack.c:cmpf
+ */
+export declare function cmpByGPerimeter(a: GInfo, b: GInfo): number;
+/**
+ * Pack rectangles using polyomino placement.
+ * Returns translation points indexed by original rectangle index.
+ *
+ * @see lib/pack/pack.c:polyRects
+ */
+export declare function polyRects(ng: number, bbs: Box[], pinfo: PackInfo): Point[] | null;
+//# sourceMappingURL=poly-pack.d.ts.map