@bpmnkit/core 0.0.27 → 0.1.1

package/dist/layout/coordinates.d.ts

@@ -1,85 +0,0 @@
-import type { BpmnElementType, BpmnFlowElement } from "../bpmn/bpmn-model.js";
-import type { BackEdge, DirectedGraph } from "./graph.js";
-import type { LayoutNode } from "./types.js";
-/** Get the fixed size for a BPMN element type. */
-export declare function getElementSize(type: BpmnElementType): {
-    width: number;
-    height: number;
-};
-/**
- * Assign x,y coordinates to all nodes based on a virtual grid.
- * Each grid cell is GRID_CELL_WIDTH × GRID_CELL_HEIGHT.
- * Elements are centered within their grid cell.
- * If an element is larger than a single cell, adjacent cells are merged.
- */
-export declare function assignCoordinates(orderedLayers: string[][], nodeIndex: Map<string, BpmnFlowElement>): LayoutNode[];
-/**
- * Re-assign x-coordinates after sub-process expansion.
- * Walks layers left-to-right, shifting each layer to avoid overlap with the previous one.
- */
-export declare function reassignXCoordinates(layoutNodes: LayoutNode[], orderedLayers: string[][]): void;
-/**
- * Align nodes in linear sequences to a common y-baseline.
- * A "linear" node has ≤1 predecessor and ≤1 successor, and is not a gateway.
- * Walks forward from each chain root, setting successors to the same center-y.
- * Crosses split/join gateway pairs to align the full branch spine.
- */
-export declare function alignBranchBaselines(layoutNodes: LayoutNode[], dag: DirectedGraph): void;
-/**
- * Align split/join gateway pairs to the same y-coordinate.
- * A split gateway fans out to multiple successors; the corresponding join gateway
- * is the nearest downstream gateway where all branches reconverge.
- */
-export declare function alignSplitJoinPairs(layoutNodes: LayoutNode[], dag: DirectedGraph, backEdges?: BackEdge[]): void;
-/**
- * Ensure early-return branches (shorter paths from split to join) are never on the baseline.
- * The baseline is the split gateway's center-y. If the shortest branch sits on the baseline,
- * swap it with a longer branch.
- */
-export declare function ensureEarlyReturnOffBaseline(layoutNodes: LayoutNode[], dag: DirectedGraph, backEdges?: BackEdge[]): void;
-/**
- * Find the baseline path — the "spine" of the process that all paths share.
- * At split gateways, jumps directly to the corresponding join gateway.
- * Returns the ordered list of node IDs on the baseline.
- */
-export declare function findBaselinePath(layoutNodes: LayoutNode[], dag: DirectedGraph, backEdges?: BackEdge[]): string[];
-/**
- * Align all nodes on the baseline path to the same center-Y.
- * Uses the first node's (start event) center-Y as the baseline.
- */
-export declare function alignBaselinePath(layoutNodes: LayoutNode[], dag: DirectedGraph, backEdges?: BackEdge[]): void;
-/**
- * Distribute branches of split gateways symmetrically around the gateway center Y.
- * Pass 1: multi-branch gateways (2+) — symmetric distribution.
- * Pass 2: single-branch gateways — placed one full grid row away, with peer-aware gap enforcement.
- */
-export declare function distributeSplitBranches(layoutNodes: LayoutNode[], dag: DirectedGraph, backEdges?: BackEdge[]): void;
-/**
- * Assign integer grid-row indices to all nodes based on their final center-Y positions.
- * Nodes whose center-Y values are within EPSILON pixels are placed in the same row.
- * This eliminates pixel-tolerance guessing in port-side decisions: two nodes with the
- * same gridRow are on the same horizontal row and should connect left-to-right.
- *
- * Called once, after ALL coordinate adjustments, just before edge routing.
- */
-export declare function assignGridRows(layoutNodes: LayoutNode[]): void;
-/**
- * Snap nodes to common Y rows for matrix-like alignment.
- * Groups nodes that share a CY (from alignment passes), then merges
- * close groups into a single row — moving entire groups as units.
- * Boundary events are excluded (they are repositioned later).
- */
-export declare function snapToYRows(layoutNodes: LayoutNode[]): void;
-/**
- * Pull each branch subtree toward the baseline, closing unnecessary vertical gaps.
- * Uses per-element 2D collision detection — only actual element-to-element overlaps
- * constrain the movement, not the branch's full bounding box.
- */
-export declare function compactBranches(layoutNodes: LayoutNode[], dag: DirectedGraph, backEdges?: BackEdge[]): void;
-/**
- * Resolve overlaps within each layer by pushing nodes apart.
- * Sorts nodes by Y within each layer and ensures minimum gap.
- * Also normalizes coordinates so no node has negative Y.
- */
-export declare function resolveLayerOverlaps(layoutNodes: LayoutNode[]): void;
-//# sourceMappingURL=coordinates.d.ts.map