@pascal-app/core 0.9.1 → 1.0.0-beta.1

package/dist/services/opening-guides.d.ts

@@ -0,0 +1,141 @@
+/** An opening's footprint in its host wall's local frame. */
+export type OpeningSpan = {
+    id: string;
+    /** Centre along the wall, measured from `wall.start` (m). */
+    centerS: number;
+    /** Along-wall extent (m). */
+    width: number;
+    /** Vertical centre above the wall base (floor at y=0) (m). */
+    centerY: number;
+    /** Vertical extent (m). */
+    height: number;
+};
+export type WallExtent = {
+    /** Wall length (m). */
+    length: number;
+    /** Wall height (m). */
+    height: number;
+};
+export type OpeningGuideTolerances = {
+    /** Max distance for an edge/centre to count as aligned with a neighbour (m). */
+    align: number;
+    /** Max difference between two gaps for them to count as equal (m). */
+    equalSpacing: number;
+    /** Gaps below this are treated as touching/overlap noise and ignored (m). */
+    minGap: number;
+};
+export declare const DEFAULT_OPENING_GUIDE_TOLERANCES: OpeningGuideTolerances;
+/** Which along-wall feature of an opening a guide references. */
+export type AlongWallFeature = 'left' | 'center' | 'right';
+/** Which vertical feature of an opening a guide references. */
+export type VerticalFeature = 'sill' | 'center' | 'top';
+export type SillHeadGuide = {
+    /** Floor (y=0) → the opening's bottom edge (m). */
+    sill: number;
+    /** Wall-local y of the bottom edge. */
+    bottomY: number;
+    /** The opening's top edge → the wall top (m). */
+    head: number;
+    /** Wall-local y of the top edge. */
+    topY: number;
+};
+export type EdgeGap = {
+    side: 'left' | 'right';
+    /** Clearance along the wall (m). */
+    distance: number;
+    /** Wall-local s of the moving opening's edge. */
+    fromS: number;
+    /** Wall-local s of the neighbour edge / wall end. */
+    toS: number;
+    target: 'opening' | 'wall-start' | 'wall-end';
+    /** Set when `target === 'opening'`. */
+    targetId?: string;
+};
+export type AlongWallAlignment = {
+    /** Wall-local s the two features share. */
+    s: number;
+    movingFeature: AlongWallFeature;
+    targetId: string;
+    targetFeature: AlongWallFeature;
+    /** Delta to add to the moving opening's `centerS` to make them coincide. */
+    snap: number;
+};
+export type VerticalAlignment = {
+    /** Wall-local y the two features share. */
+    y: number;
+    movingFeature: VerticalFeature;
+    targetId: string;
+    targetFeature: VerticalFeature;
+    /** Delta to add to the moving opening's `centerY` to make them coincide. */
+    snap: number;
+};
+export type EqualSpacingRun = {
+    /** The repeated gap value (average of the run's gaps) (m). */
+    gap: number;
+    /** The equal-gap segments along the wall, in order (left → right). */
+    segments: {
+        fromS: number;
+        toS: number;
+    }[];
+    /** Participating opening ids, ordered along the wall, including the moving one. */
+    openingIds: string[];
+};
+export type OpeningGuides = {
+    sillHead: SillHeadGuide | null;
+    gaps: EdgeGap[];
+    alongWall: AlongWallAlignment | null;
+    vertical: VerticalAlignment | null;
+    equalSpacing: EqualSpacingRun | null;
+};
+export type OpeningGuideInput = {
+    moving: OpeningSpan;
+    /** Other openings on the SAME wall (the moving opening excluded). */
+    siblings: readonly OpeningSpan[];
+    wall: WallExtent;
+    /**
+     * Whether to compute vertical (sill/head/vertical-alignment) guides. True for
+     * windows; false for doors, which sit on the floor so their sill is always 0.
+     */
+    includeVertical: boolean;
+    tolerances?: Partial<OpeningGuideTolerances>;
+};
+/**
+ * Edge-to-edge clearance from the moving opening to the nearest neighbour on
+ * each side, falling back to the wall ends when there is no neighbour — the
+ * "how much wall is left here" reading. Returns 0–2 gaps (one per side); a side
+ * is omitted when its clearance is below `minGap` (the opening is flush against
+ * or overlapping that neighbour).
+ */
+export declare function computeEdgeGaps(moving: OpeningSpan, siblings: readonly OpeningSpan[], wall: WallExtent, minGap: number): EdgeGap[];
+/**
+ * The closest coincidence between any of the moving opening's edges/centre and
+ * any sibling's edges/centre along the wall, within `tolerance`. Edge-to-edge
+ * and centre-to-centre are weighed equally; the single closest pair wins
+ * (matching the one-guide-per-axis behaviour of the floor-plane resolver).
+ */
+export declare function detectAlongWallAlignment(moving: OpeningSpan, siblings: readonly OpeningSpan[], tolerance: number): AlongWallAlignment | null;
+/**
+ * The closest coincidence between the moving opening's sill/centre/top and any
+ * sibling's sill/centre/top, within `tolerance` — the "these two windows share
+ * a sill height" detector. Same single-best-match policy as the along-wall
+ * variant.
+ */
+export declare function detectVerticalAlignment(moving: OpeningSpan, siblings: readonly OpeningSpan[], tolerance: number): VerticalAlignment | null;
+/**
+ * Figma-style equal-spacing detection: order all openings along the wall, look
+ * at the clearances BETWEEN consecutive openings, and return the longest run of
+ * ≥2 consecutive gaps that are equal within `tolerance` and that the moving
+ * opening participates in (so the badges only appear while the drag is actually
+ * forming or extending a series). Returns null when no such run exists.
+ *
+ * Gaps below `minGap` (touching/overlapping openings) break a run — a row of
+ * flush openings is not "equally spaced".
+ */
+export declare function detectEqualSpacing(allOpenings: readonly OpeningSpan[], movingId: string, tolerance: number, minGap: number): EqualSpacingRun | null;
+/**
+ * Compute every proximity/alignment guide for the moving opening in one pass.
+ * Pure: feed it the moving opening's wall-local span, its same-wall siblings,
+ * and the wall extent; render the result in whichever view.
+ */
+export declare function computeOpeningGuides(input: OpeningGuideInput): OpeningGuides;
+//# sourceMappingURL=opening-guides.d.ts.map

package/dist/services/opening-guides.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"opening-guides.d.ts","sourceRoot":"","sources":["../../src/services/opening-guides.ts"],"names":[],"mappings":"AAwBA,6DAA6D;AAC7D,MAAM,MAAM,WAAW,GAAG;IACxB,EAAE,EAAE,MAAM,CAAA;IACV,6DAA6D;IAC7D,OAAO,EAAE,MAAM,CAAA;IACf,6BAA6B;IAC7B,KAAK,EAAE,MAAM,CAAA;IACb,8DAA8D;IAC9D,OAAO,EAAE,MAAM,CAAA;IACf,2BAA2B;IAC3B,MAAM,EAAE,MAAM,CAAA;CACf,CAAA;AAED,MAAM,MAAM,UAAU,GAAG;IACvB,uBAAuB;IACvB,MAAM,EAAE,MAAM,CAAA;IACd,uBAAuB;IACvB,MAAM,EAAE,MAAM,CAAA;CACf,CAAA;AAED,MAAM,MAAM,sBAAsB,GAAG;IACnC,gFAAgF;IAChF,KAAK,EAAE,MAAM,CAAA;IACb,sEAAsE;IACtE,YAAY,EAAE,MAAM,CAAA;IACpB,6EAA6E;IAC7E,MAAM,EAAE,MAAM,CAAA;CACf,CAAA;AAED,eAAO,MAAM,gCAAgC,EAAE,sBAK9C,CAAA;AAED,iEAAiE;AACjE,MAAM,MAAM,gBAAgB,GAAG,MAAM,GAAG,QAAQ,GAAG,OAAO,CAAA;AAC1D,+DAA+D;AAC/D,MAAM,MAAM,eAAe,GAAG,MAAM,GAAG,QAAQ,GAAG,KAAK,CAAA;AAEvD,MAAM,MAAM,aAAa,GAAG;IAC1B,mDAAmD;IACnD,IAAI,EAAE,MAAM,CAAA;IACZ,uCAAuC;IACvC,OAAO,EAAE,MAAM,CAAA;IACf,iDAAiD;IACjD,IAAI,EAAE,MAAM,CAAA;IACZ,oCAAoC;IACpC,IAAI,EAAE,MAAM,CAAA;CACb,CAAA;AAED,MAAM,MAAM,OAAO,GAAG;IACpB,IAAI,EAAE,MAAM,GAAG,OAAO,CAAA;IACtB,oCAAoC;IACpC,QAAQ,EAAE,MAAM,CAAA;IAChB,iDAAiD;IACjD,KAAK,EAAE,MAAM,CAAA;IACb,qDAAqD;IACrD,GAAG,EAAE,MAAM,CAAA;IACX,MAAM,EAAE,SAAS,GAAG,YAAY,GAAG,UAAU,CAAA;IAC7C,uCAAuC;IACvC,QAAQ,CAAC,EAAE,MAAM,CAAA;CAClB,CAAA;AAED,MAAM,MAAM,kBAAkB,GAAG;IAC/B,2CAA2C;IAC3C,CAAC,EAAE,MAAM,CAAA;IACT,aAAa,EAAE,gBAAgB,CAAA;IAC/B,QAAQ,EAAE,MAAM,CAAA;IAChB,aAAa,EAAE,gBAAgB,CAAA;IAC/B,4EAA4E;IAC5E,IAAI,EAAE,MAAM,CAAA;CACb,CAAA;AAED,MAAM,MAAM,iBAAiB,GAAG;IAC9B,2CAA2C;IAC3C,CAAC,EAAE,MAAM,CAAA;IACT,aAAa,EAAE,eAAe,CAAA;IAC9B,QAAQ,EAAE,MAAM,CAAA;IAChB,aAAa,EAAE,eAAe,CAAA;IAC9B,4EAA4E;IAC5E,IAAI,EAAE,MAAM,CAAA;CACb,CAAA;AAED,MAAM,MAAM,eAAe,GAAG;IAC5B,8DAA8D;IAC9D,GAAG,EAAE,MAAM,CAAA;IACX,sEAAsE;IACtE,QAAQ,EAAE;QAAE,KAAK,EAAE,MAAM,CAAC;QAAC,GAAG,EAAE,MAAM,CAAA;KAAE,EAAE,CAAA;IAC1C,mFAAmF;IACnF,UAAU,EAAE,MAAM,EAAE,CAAA;CACrB,CAAA;AAED,MAAM,MAAM,aAAa,GAAG;IAC1B,QAAQ,EAAE,aAAa,GAAG,IAAI,CAAA;IAC9B,IAAI,EAAE,OAAO,EAAE,CAAA;IACf,SAAS,EAAE,kBAAkB,GAAG,IAAI,CAAA;IACpC,QAAQ,EAAE,iBAAiB,GAAG,IAAI,CAAA;IAClC,YAAY,EAAE,eAAe,GAAG,IAAI,CAAA;CACrC,CAAA;AAED,MAAM,MAAM,iBAAiB,GAAG;IAC9B,MAAM,EAAE,WAAW,CAAA;IACnB,qEAAqE;IACrE,QAAQ,EAAE,SAAS,WAAW,EAAE,CAAA;IAChC,IAAI,EAAE,UAAU,CAAA;IAChB;;;OAGG;IACH,eAAe,EAAE,OAAO,CAAA;IACxB,UAAU,CAAC,EAAE,OAAO,CAAC,sBAAsB,CAAC,CAAA;CAC7C,CAAA;AAsBD;;;;;;GAMG;AACH,wBAAgB,eAAe,CAC7B,MAAM,EAAE,WAAW,EACnB,QAAQ,EAAE,SAAS,WAAW,EAAE,EAChC,IAAI,EAAE,UAAU,EAChB,MAAM,EAAE,MAAM,GACb,OAAO,EAAE,CA2DX;AAED;;;;;GAKG;AACH,wBAAgB,wBAAwB,CACtC,MAAM,EAAE,WAAW,EACnB,QAAQ,EAAE,SAAS,WAAW,EAAE,EAChC,SAAS,EAAE,MAAM,GAChB,kBAAkB,GAAG,IAAI,CAyB3B;AAED;;;;;GAKG;AACH,wBAAgB,uBAAuB,CACrC,MAAM,EAAE,WAAW,EACnB,QAAQ,EAAE,SAAS,WAAW,EAAE,EAChC,SAAS,EAAE,MAAM,GAChB,iBAAiB,GAAG,IAAI,CAyB1B;AAED;;;;;;;;;GASG;AACH,wBAAgB,kBAAkB,CAChC,WAAW,EAAE,SAAS,WAAW,EAAE,EACnC,QAAQ,EAAE,MAAM,EAChB,SAAS,EAAE,MAAM,EACjB,MAAM,EAAE,MAAM,GACb,eAAe,GAAG,IAAI,CAkDxB;AAED;;;;GAIG;AACH,wBAAgB,oBAAoB,CAAC,KAAK,EAAE,iBAAiB,GAAG,aAAa,CAyB5E"}

package/dist/services/opening-guides.js

@@ -0,0 +1,267 @@
+// Proximity / alignment guides for wall-hosted openings (doors, windows).
+//
+// Pure geometry over a single host wall's LOCAL frame — no Three.js, no scene
+// store, no React — so it runs identically for the 3D viewport and the 2D
+// floor plan and is unit-testable in isolation. Callers extract the spans from
+// the scene graph (an opening's `position[0]` is its along-wall centre, its
+// `position[1]` its vertical centre with the wall base at y=0) and feed them in;
+// the renderers transform the returned wall-local coordinates back to world
+// (3D) or plan (2D).
+//
+// What it produces, mirroring the affordances architects expect (and Figma's
+// smart guides):
+//   - sill/head    : a window's bottom edge → floor and top edge → wall top.
+//   - edge gaps     : along-wall clearance to the nearest neighbour opening (or
+//                     the wall end) on each side.
+//   - alongWall     : the moving opening's edge/centre lining up with a
+//                     neighbour's edge/centre along the wall.
+//   - vertical      : two openings sharing a sill / head / vertical centre.
+//   - equalSpacing  : a run of 3+ openings with (near-)equal gaps between them.
+//
+// Detection is passive — it reports what currently coincides within tolerance
+// and the snap delta that would make it exact, leaving the snap decision to the
+// caller's manipulation policy (grid vs. alignment vs. Shift bypass).
+export const DEFAULT_OPENING_GUIDE_TOLERANCES = {
+    // Parity with the along-wall snap threshold (`ALONG_WALL_ALIGN_THRESHOLD_M`).
+    align: 0.08,
+    equalSpacing: 0.03,
+    minGap: 0.02,
+};
+const leftEdge = (s) => s.centerS - s.width / 2;
+const rightEdge = (s) => s.centerS + s.width / 2;
+const bottomEdge = (s) => s.centerY - s.height / 2;
+const topEdge = (s) => s.centerY + s.height / 2;
+function alongWallFeatureCoord(s, feature) {
+    if (feature === 'left')
+        return leftEdge(s);
+    if (feature === 'right')
+        return rightEdge(s);
+    return s.centerS;
+}
+function verticalFeatureCoord(s, feature) {
+    if (feature === 'sill')
+        return bottomEdge(s);
+    if (feature === 'top')
+        return topEdge(s);
+    return s.centerY;
+}
+const ALONG_WALL_FEATURES = ['left', 'center', 'right'];
+const VERTICAL_FEATURES = ['sill', 'center', 'top'];
+/**
+ * Edge-to-edge clearance from the moving opening to the nearest neighbour on
+ * each side, falling back to the wall ends when there is no neighbour — the
+ * "how much wall is left here" reading. Returns 0–2 gaps (one per side); a side
+ * is omitted when its clearance is below `minGap` (the opening is flush against
+ * or overlapping that neighbour).
+ */
+export function computeEdgeGaps(moving, siblings, wall, minGap) {
+    const movingLeft = leftEdge(moving);
+    const movingRight = rightEdge(moving);
+    // A sibling that straddles one of the moving opening's edges is an OVERLAP,
+    // not a neighbour: there is no clearance on that side, and we must not fall
+    // back to the wall end (which would report a misleading distance measured
+    // "through" the overlapping opening).
+    const leftCrossed = siblings.some((s) => leftEdge(s) < movingLeft && rightEdge(s) > movingLeft);
+    const rightCrossed = siblings.some((s) => leftEdge(s) < movingRight && rightEdge(s) > movingRight);
+    let leftNeighbour = null;
+    let rightNeighbour = null;
+    for (const sib of siblings) {
+        const sibRight = rightEdge(sib);
+        const sibLeft = leftEdge(sib);
+        // Entirely to the left of the moving opening → candidate left neighbour.
+        if (sibRight <= movingLeft && (leftNeighbour === null || sibRight > leftNeighbour.s)) {
+            leftNeighbour = { s: sibRight, id: sib.id };
+        }
+        // Entirely to the right → candidate right neighbour.
+        if (sibLeft >= movingRight && (rightNeighbour === null || sibLeft < rightNeighbour.s)) {
+            rightNeighbour = { s: sibLeft, id: sib.id };
+        }
+    }
+    const gaps = [];
+    if (!leftCrossed) {
+        const leftToS = leftNeighbour ? leftNeighbour.s : 0;
+        const leftDistance = movingLeft - leftToS;
+        if (leftDistance >= minGap) {
+            gaps.push({
+                side: 'left',
+                distance: leftDistance,
+                fromS: movingLeft,
+                toS: leftToS,
+                target: leftNeighbour ? 'opening' : 'wall-start',
+                targetId: leftNeighbour?.id,
+            });
+        }
+    }
+    if (!rightCrossed) {
+        const rightToS = rightNeighbour ? rightNeighbour.s : wall.length;
+        const rightDistance = rightToS - movingRight;
+        if (rightDistance >= minGap) {
+            gaps.push({
+                side: 'right',
+                distance: rightDistance,
+                fromS: movingRight,
+                toS: rightToS,
+                target: rightNeighbour ? 'opening' : 'wall-end',
+                targetId: rightNeighbour?.id,
+            });
+        }
+    }
+    return gaps;
+}
+/**
+ * The closest coincidence between any of the moving opening's edges/centre and
+ * any sibling's edges/centre along the wall, within `tolerance`. Edge-to-edge
+ * and centre-to-centre are weighed equally; the single closest pair wins
+ * (matching the one-guide-per-axis behaviour of the floor-plane resolver).
+ */
+export function detectAlongWallAlignment(moving, siblings, tolerance) {
+    let best = null;
+    let bestAbs = tolerance;
+    for (const movingFeature of ALONG_WALL_FEATURES) {
+        const movingCoord = alongWallFeatureCoord(moving, movingFeature);
+        for (const sib of siblings) {
+            if (sib.id === moving.id)
+                continue;
+            for (const targetFeature of ALONG_WALL_FEATURES) {
+                const targetCoord = alongWallFeatureCoord(sib, targetFeature);
+                const diff = targetCoord - movingCoord;
+                const abs = Math.abs(diff);
+                if (abs <= bestAbs && (best === null || abs < bestAbs)) {
+                    bestAbs = abs;
+                    best = {
+                        s: targetCoord,
+                        movingFeature,
+                        targetId: sib.id,
+                        targetFeature,
+                        snap: diff,
+                    };
+                }
+            }
+        }
+    }
+    return best;
+}
+/**
+ * The closest coincidence between the moving opening's sill/centre/top and any
+ * sibling's sill/centre/top, within `tolerance` — the "these two windows share
+ * a sill height" detector. Same single-best-match policy as the along-wall
+ * variant.
+ */
+export function detectVerticalAlignment(moving, siblings, tolerance) {
+    let best = null;
+    let bestAbs = tolerance;
+    for (const movingFeature of VERTICAL_FEATURES) {
+        const movingCoord = verticalFeatureCoord(moving, movingFeature);
+        for (const sib of siblings) {
+            if (sib.id === moving.id)
+                continue;
+            for (const targetFeature of VERTICAL_FEATURES) {
+                const targetCoord = verticalFeatureCoord(sib, targetFeature);
+                const diff = targetCoord - movingCoord;
+                const abs = Math.abs(diff);
+                if (abs <= bestAbs && (best === null || abs < bestAbs)) {
+                    bestAbs = abs;
+                    best = {
+                        y: targetCoord,
+                        movingFeature,
+                        targetId: sib.id,
+                        targetFeature,
+                        snap: diff,
+                    };
+                }
+            }
+        }
+    }
+    return best;
+}
+/**
+ * Figma-style equal-spacing detection: order all openings along the wall, look
+ * at the clearances BETWEEN consecutive openings, and return the longest run of
+ * ≥2 consecutive gaps that are equal within `tolerance` and that the moving
+ * opening participates in (so the badges only appear while the drag is actually
+ * forming or extending a series). Returns null when no such run exists.
+ *
+ * Gaps below `minGap` (touching/overlapping openings) break a run — a row of
+ * flush openings is not "equally spaced".
+ */
+export function detectEqualSpacing(allOpenings, movingId, tolerance, minGap) {
+    if (allOpenings.length < 3)
+        return null;
+    const sorted = [...allOpenings].sort((a, b) => a.centerS - b.centerS);
+    const movingIndex = sorted.findIndex((s) => s.id === movingId);
+    if (movingIndex < 0)
+        return null;
+    // Clearance between opening i and i+1.
+    const gaps = [];
+    for (let i = 0; i < sorted.length - 1; i++) {
+        const a = sorted[i];
+        const b = sorted[i + 1];
+        if (!a || !b)
+            continue;
+        const fromS = rightEdge(a);
+        const toS = leftEdge(b);
+        gaps.push({ value: toS - fromS, fromS, toS });
+    }
+    // Longest contiguous window of gaps that are (a) each ≥ minGap and (b)
+    // mutually equal within tolerance (window max − min ≤ tolerance), spanning at
+    // least 2 gaps and including the moving opening. Brute force over windows
+    // (openings per wall are few). A first-gap-anchored greedy scan is NOT
+    // equivalent: it drops a valid run that begins partway through a drifting
+    // sequence — e.g. gaps 1.00, 1.02, 1.04 with the moving opening at the end,
+    // where [1.02, 1.04] is a real run. On a length tie the leftmost window wins,
+    // for determinism.
+    let best = null;
+    for (let lo = 0; lo < gaps.length; lo++) {
+        let min = Number.POSITIVE_INFINITY;
+        let max = Number.NEGATIVE_INFINITY;
+        for (let hi = lo; hi < gaps.length; hi++) {
+            const gap = gaps[hi];
+            if (!gap || gap.value < minGap)
+                break; // a sub-minGap gap can't join a run
+            min = Math.min(min, gap.value);
+            max = Math.max(max, gap.value);
+            if (max - min > tolerance)
+                break; // extending only widens the spread
+            const gapCount = hi - lo + 1;
+            if (gapCount < 2)
+                continue;
+            const firstOpening = lo; // gap i sits between openings i and i+1
+            const lastOpening = hi + 1;
+            if (movingIndex < firstOpening || movingIndex > lastOpening)
+                continue;
+            if (best !== null && gapCount <= best.segments.length)
+                continue;
+            const windowGaps = gaps.slice(lo, hi + 1);
+            best = {
+                gap: windowGaps.reduce((sum, g) => sum + g.value, 0) / windowGaps.length,
+                segments: windowGaps.map((g) => ({ fromS: g.fromS, toS: g.toS })),
+                openingIds: sorted.slice(firstOpening, lastOpening + 1).map((s) => s.id),
+            };
+        }
+    }
+    return best;
+}
+/**
+ * Compute every proximity/alignment guide for the moving opening in one pass.
+ * Pure: feed it the moving opening's wall-local span, its same-wall siblings,
+ * and the wall extent; render the result in whichever view.
+ */
+export function computeOpeningGuides(input) {
+    const tol = { ...DEFAULT_OPENING_GUIDE_TOLERANCES, ...input.tolerances };
+    const { moving, siblings, wall, includeVertical } = input;
+    const sillHead = includeVertical
+        ? {
+            sill: bottomEdge(moving),
+            bottomY: bottomEdge(moving),
+            head: wall.height - topEdge(moving),
+            topY: topEdge(moving),
+        }
+        : null;
+    return {
+        sillHead,
+        gaps: computeEdgeGaps(moving, siblings, wall, tol.minGap),
+        alongWall: detectAlongWallAlignment(moving, siblings, tol.align),
+        vertical: includeVertical ? detectVerticalAlignment(moving, siblings, tol.align) : null,
+        equalSpacing: detectEqualSpacing([moving, ...siblings], moving.id, tol.equalSpacing, tol.minGap),
+    };
+}

package/dist/services/port-connectivity.d.ts

@@ -0,0 +1,115 @@
+import type { AnyNode, AnyNodeId } from '../schema';
+/**
+ * Connectivity-aware editing for port-bearing distribution kinds
+ * (HVAC ductwork AND DWV plumbing).
+ *
+ * Two nodes are "connected" when a port of one coincides in space with a
+ * port of the other — exactly how the placement tools mate a fitting onto
+ * a duct end (they snap the fitting's collar onto the run's open port).
+ * This service reads that relationship back out so an edit to one node can
+ * carry its neighbours along.
+ *
+ * Pure logic: it asks each node for its ports via `def.ports` (level-local
+ * meters) and does arithmetic. No Three.js, no rendering — it lives in
+ * core and is consumed by the editor's move tool and the duct/pipe
+ * selection affordances alike.
+ *
+ * ## Propagation model
+ *
+ * The joint graph is snapshotted once at drag start (`analyzePortConnectivity`)
+ * and walked every frame (`resolveConnectivityUpdates`) given the moved node's
+ * live transform. Deltas flow outward from the moved node through coincident
+ * ports:
+ *
+ * - **Fitting** (rigid): a collar pushed by delta `d` translates the whole
+ *   fitting by `d`; every other collar carries that same `d` onward.
+ * - **Run** (stretch + slide, never skew): an endpoint pushed by delta `d` is
+ *   split against the run's own axis. The *parallel* part slides only that
+ *   endpoint (the run lengthens / shortens); the *perpendicular* part
+ *   translates the entire run (so its direction is preserved). The far
+ *   endpoint therefore moves by just the perpendicular part, and that part
+ *   propagates onward to whatever is mated to the far endpoint.
+ *
+ * Propagation walks the whole connected component so a joint stays welded all
+ * the way down the chain, with a visited guard so cycles (looped runs) and
+ * shared joints terminate. First-reached (shortest path) wins on a node
+ * reachable two ways.
+ */
+type Point = readonly [number, number, number];
+/** A node carried by the edit, plus the snapshot needed to revert it. Kept
+ *  deliberately small: the move tools read only `kind` + `nodeId` and the
+ *  matching start snapshot to revert before the single tracked commit. */
+export type PortConnection = {
+    /** A fitting mated collar-to-collar: it translates rigidly. */
+    kind: 'rigid-node';
+    nodeId: AnyNodeId;
+    /** Node's `position` at edit-start. */
+    startPosition: Point;
+} | {
+    /** A run whose endpoint(s) ride the edit: it stretches and/or
+     *  translates, never skews. */
+    kind: 'run';
+    nodeId: AnyNodeId;
+    /** The run's full `path` at edit-start. */
+    startPath: Point[];
+};
+/** One node in the snapshotted joint graph (everything reachable from the
+ *  moved node, excluding the moved node itself). */
+type GraphNode = {
+    id: AnyNodeId;
+    role: 'run' | 'fitting';
+    ports: ReadonlyArray<{
+        id: string;
+        position: Point;
+        system?: string;
+    }>;
+    startPath?: Point[];
+    startPosition?: Point;
+};
+/** Who else sits on a given node's port, keyed `nodeId` → `portId` → mates. */
+type Adjacency = Record<string, Record<string, Array<{
+    nodeId: AnyNodeId;
+    portId: string;
+}>>>;
+export type PortConnectivity = {
+    movedNodeId: AnyNodeId;
+    /** The moved node's port world positions at edit-start, keyed by port id —
+     *  the reference each frame's delta is measured from. */
+    startMovedPorts: Record<string, Point>;
+    /** Reachable run/fitting nodes (excludes the moved node), keyed by id. */
+    graph: Record<string, GraphNode>;
+    /** Port coincidence edges across the moved node + every graph node. */
+    adjacency: Adjacency;
+    /** Flat list of carried nodes for the move tools' revert + "anything to
+     *  follow?" check. Derived from `graph`. */
+    connections: PortConnection[];
+};
+/**
+ * Snapshot the joint graph reachable from `movedNode`'s ports, taken at the
+ * start of a move/resize. Call once before the drag; feed the result to
+ * `resolveConnectivityUpdates` on every frame.
+ *
+ * Only `run`-role partners (segments) and `fitting`-role partners are walked —
+ * terminals and equipment usually mount to a surface and shouldn't be yanked
+ * off it when an adjacent fitting nudges. Fittings that declare
+ * `portConnectivityFollow: false` are anchored fixtures (e.g. pipe-trap) and
+ * are skipped, so a connected run stretches against them instead.
+ */
+export declare function analyzePortConnectivity(movedNode: AnyNode, nodes: Record<string, AnyNode>): PortConnectivity;
+/**
+ * Given the moved node in its live (in-drag) transform, produce the patches
+ * that keep every connected node attached. `previewNode` is the moved node
+ * with its current drag position/rotation applied so its ports recompute.
+ *
+ * Walks the snapshotted graph, propagating each port delta outward: fittings
+ * translate rigidly, runs stretch along their axis and translate across it
+ * (never skew when driven from one end), and effective port movement carries on
+ * to neighbouring joints. Port-level output guards bound cycles while still
+ * allowing a looped/shared run to accept constraints at both endpoints.
+ */
+export declare function resolveConnectivityUpdates(connectivity: PortConnectivity, previewNode: AnyNode): {
+    id: AnyNodeId;
+    data: Partial<AnyNode>;
+}[];
+export {};
+//# sourceMappingURL=port-connectivity.d.ts.map

package/dist/services/port-connectivity.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"port-connectivity.d.ts","sourceRoot":"","sources":["../../src/services/port-connectivity.ts"],"names":[],"mappings":"AACA,OAAO,KAAK,EAAE,OAAO,EAAE,SAAS,EAAE,MAAM,WAAW,CAAA;AAEnD;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GAmCG;AAEH,KAAK,KAAK,GAAG,SAAS,CAAC,MAAM,EAAE,MAAM,EAAE,MAAM,CAAC,CAAA;AAY9C;;0EAE0E;AAC1E,MAAM,MAAM,cAAc,GACtB;IACE,+DAA+D;IAC/D,IAAI,EAAE,YAAY,CAAA;IAClB,MAAM,EAAE,SAAS,CAAA;IACjB,uCAAuC;IACvC,aAAa,EAAE,KAAK,CAAA;CACrB,GACD;IACE;mCAC+B;IAC/B,IAAI,EAAE,KAAK,CAAA;IACX,MAAM,EAAE,SAAS,CAAA;IACjB,2CAA2C;IAC3C,SAAS,EAAE,KAAK,EAAE,CAAA;CACnB,CAAA;AAEL;oDACoD;AACpD,KAAK,SAAS,GAAG;IACf,EAAE,EAAE,SAAS,CAAA;IACb,IAAI,EAAE,KAAK,GAAG,SAAS,CAAA;IACvB,KAAK,EAAE,aAAa,CAAC;QAAE,EAAE,EAAE,MAAM,CAAC;QAAC,QAAQ,EAAE,KAAK,CAAC;QAAC,MAAM,CAAC,EAAE,MAAM,CAAA;KAAE,CAAC,CAAA;IACtE,SAAS,CAAC,EAAE,KAAK,EAAE,CAAA;IACnB,aAAa,CAAC,EAAE,KAAK,CAAA;CACtB,CAAA;AAED,+EAA+E;AAC/E,KAAK,SAAS,GAAG,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,MAAM,EAAE,KAAK,CAAC;IAAE,MAAM,EAAE,SAAS,CAAC;IAAC,MAAM,EAAE,MAAM,CAAA;CAAE,CAAC,CAAC,CAAC,CAAA;AAE7F,MAAM,MAAM,gBAAgB,GAAG;IAC7B,WAAW,EAAE,SAAS,CAAA;IACtB;6DACyD;IACzD,eAAe,EAAE,MAAM,CAAC,MAAM,EAAE,KAAK,CAAC,CAAA;IACtC,0EAA0E;IAC1E,KAAK,EAAE,MAAM,CAAC,MAAM,EAAE,SAAS,CAAC,CAAA;IAChC,uEAAuE;IACvE,SAAS,EAAE,SAAS,CAAA;IACpB;gDAC4C;IAC5C,WAAW,EAAE,cAAc,EAAE,CAAA;CAC9B,CAAA;AAkCD;;;;;;;;;;GAUG;AACH,wBAAgB,uBAAuB,CACrC,SAAS,EAAE,OAAO,EAClB,KAAK,EAAE,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,GAC7B,gBAAgB,CAuFlB;AA4GD;;;;;;;;;;GAUG;AACH,wBAAgB,0BAA0B,CACxC,YAAY,EAAE,gBAAgB,EAC9B,WAAW,EAAE,OAAO,GACnB;IAAE,EAAE,EAAE,SAAS,CAAC;IAAC,IAAI,EAAE,OAAO,CAAC,OAAO,CAAC,CAAA;CAAE,EAAE,CA0F7C"}