@hatiolab/things-scene 10.0.0-beta.126 → 10.0.0-beta.128

package/dist-types/flow/flow-graph-coordinator.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"flow-graph-coordinator.d.ts","sourceRoot":"","sources":["../../src/flow/flow-graph-coordinator.ts"],"names":[],"mappings":"AAkBA,OAAO,EAAyC,KAAK,SAAS,EAAsB,KAAK,gBAAgB,EAAE,MAAM,iBAAiB,CAAA;AAElI,OAAO,EAA6B,KAAK,cAAc,EAAE,MAAM,2BAA2B,CAAA;AAG1F,2DAA2D;AAC3D,MAAM,WAAW,aAAa;IAC5B,yCAAyC;IACzC,kBAAkB,IAAI,MAAM,CAAA;IAC5B,kEAAkE;IAClE,aAAa,CAAC,IAAI,MAAM,CAAA;CACzB;AAED,wBAAgB,eAAe,CAAC,CAAC,EAAE,GAAG,GAAG,CAAC,IAAI,aAAa,CAE1D;AA0LD;;;GAGG;AACH,wBAAgB,eAAe,CAAC,IAAI,EAAE,GAAG,GAAG,cAAc,EAAE,CAE3D;AAED,wCAAwC;AACxC,wBAAgB,YAAY,CAAC,IAAI,EAAE,GAAG,GAAG,SAAS,GAAG,IAAI,CAGxD;AAED,+BAA+B;AAC/B,wBAAgB,mBAAmB,CAAC,IAAI,EAAE,GAAG,EAAE,WAAW,EAAE,MAAM,GAAG,MAAM,EAAE,CAE5E;AAED,oBAAoB;AACpB,wBAAgB,gBAAgB,CAAC,IAAI,EAAE,GAAG,EAAE,EAAE,EAAE,MAAM,GAAG,GAAG,CAE3D;AAED,qDAAqD;AACrD,wBAAgB,eAAe,CAAC,IAAI,EAAE,GAAG,GAAG,MAAM,EAAE,CAGnD;AAED,qDAAqD;AACrD,wBAAgB,QAAQ,CAAC,CAAC,EAAE,GAAG,GAAG,MAAM,GAAG,SAAS,CAEnD;AAED;;;;;;;GAOG;AACH,MAAM,MAAM,eAAe,GAAG,OAAO,GAAG,aAAa,GAAG,QAAQ,GAAG,aAAa,CAAA;AAEhF,yFAAyF;AACzF,MAAM,WAAW,cAAc;IAC7B,qDAAqD;IACrD,QAAQ,EAAE,GAAG,CAAC,MAAM,EAAE,MAAM,CAAC,CAAA;CAC9B;AAiCD;;GAEG;AACH,wBAAgB,WAAW,CACzB,MAAM,EAAE,eAAe,EACvB,MAAM,EAAE,MAAM,EACd,KAAK,EAAE,cAAc,EACrB,IAAI,EAAE,gBAAgB,EAAE,EACxB,UAAU,EAAE,GAAG,CAAC,MAAM,EAAE,GAAG,CAAC,GAC3B,gBAAgB,CAsClB;AAED;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GAgCG;AACH,wBAAgB,cAAc,CAAC,IAAI,EAAE,GAAG,EAAE,OAAO,EAAE,GAAG,EAAE,OAAO,CAAC,EAAE;IAAE,MAAM,CAAC,EAAE,eAAe,CAAA;CAAE,GAAG,MAAM,GAAG,IAAI,CAqC7G"}

package/dist-types/flow/flow-graph-validator.d.ts

@@ -0,0 +1,33 @@
+import type { FlowGraph } from './flow-graph.js';
+export type IssueSeverity = 'error' | 'warning';
+export type IssueCode = 'orphan-source' | 'dead-end' | 'cycle' | 'unreachable-target' | 'invalid-weight';
+export interface FlowGraphIssue {
+    severity: IssueSeverity;
+    code: IssueCode;
+    nodeId?: string;
+    /** cycle 의 경우 노드 체인 (정렬: 시작 = lexically min id, 결정론). */
+    cycle?: string[];
+    message: string;
+}
+export interface ValidateOptions {
+    /**
+     * 의도 cycle 자격 — 해당 노드 id 의 cycle 은 skip (예: LoopSorter / LoopConveyor).
+     * 호출자가 root walk 로 isLoop capability 식별 후 전달. validator 자체는 순수.
+     */
+    loopCapableIds?: ReadonlySet<string>;
+    /**
+     * RoutingTarget 자격 노드 id 목록 — sink (dead-end 자격 면제) 판단 + unreachable 검사.
+     * coordinator 의 destToSinks 키로 도출 가능.
+     */
+    routingTargetIds?: ReadonlySet<string>;
+    /**
+     * (Phase B1) routingWeight 추출 결과 — nodeId → weight. 미선언/default 1 인 노드는
+     * 생략 가능. validator 가 weight ≤ 0 의 invalid-weight warning 검출.
+     */
+    routingWeights?: ReadonlyMap<string, number>;
+}
+/**
+ * graph 의 invariants 검증. 같은 입력 → 같은 결과 (결정론).
+ */
+export declare function validate(graph: FlowGraph, opts?: ValidateOptions): FlowGraphIssue[];
+//# sourceMappingURL=flow-graph-validator.d.ts.map

package/dist-types/flow/flow-graph-validator.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"flow-graph-validator.d.ts","sourceRoot":"","sources":["../../src/flow/flow-graph-validator.ts"],"names":[],"mappings":"AAsBA,OAAO,KAAK,EAAE,SAAS,EAAE,MAAM,iBAAiB,CAAA;AAEhD,MAAM,MAAM,aAAa,GAAG,OAAO,GAAG,SAAS,CAAA;AAC/C,MAAM,MAAM,SAAS,GAAG,eAAe,GAAG,UAAU,GAAG,OAAO,GAAG,oBAAoB,GAAG,gBAAgB,CAAA;AAExG,MAAM,WAAW,cAAc;IAC7B,QAAQ,EAAE,aAAa,CAAA;IACvB,IAAI,EAAE,SAAS,CAAA;IACf,MAAM,CAAC,EAAE,MAAM,CAAA;IACf,yDAAyD;IACzD,KAAK,CAAC,EAAE,MAAM,EAAE,CAAA;IAChB,OAAO,EAAE,MAAM,CAAA;CAChB;AAED,MAAM,WAAW,eAAe;IAC9B;;;OAGG;IACH,cAAc,CAAC,EAAE,WAAW,CAAC,MAAM,CAAC,CAAA;IAEpC;;;OAGG;IACH,gBAAgB,CAAC,EAAE,WAAW,CAAC,MAAM,CAAC,CAAA;IAEtC;;;OAGG;IACH,cAAc,CAAC,EAAE,WAAW,CAAC,MAAM,EAAE,MAAM,CAAC,CAAA;CAC7C;AAED;;GAEG;AACH,wBAAgB,QAAQ,CAAC,KAAK,EAAE,SAAS,EAAE,IAAI,GAAE,eAAoB,GAAG,cAAc,EAAE,CA8FvF"}

package/dist-types/flow/flow-graph.d.ts

@@ -0,0 +1,76 @@
+import { type SegmentTopology, type SegmentBounds, type MatchTolerance } from './segment-topology.js';
+/** 그래프 노드 입력 — collectAdjacentSegments 출력과 동일 shape. */
+export interface FlowGraphNode {
+    id: string;
+    topology: SegmentTopology;
+    bounds?: SegmentBounds;
+    /**
+     * 명시 링크 — 사용자가 *명시 id* 로 지정한 그래프 엣지. 인접(기하) 자동연결로는
+     * 못 잇는 *떨어진 타겟*(예: 슈트 → 멀리 있는 StockPile)을 연결. 인접 엣지에 *추가*
+     * (대체 아님). coordinator 가 RoutingLinks capability 에서 채운다. refid 아님(시스템
+     * auto-link 와 별개) — 사용자 명시 id.
+     */
+    links?: {
+        /** 이 노드 → target 노드 id(들). */
+        downstream?: string[];
+        /** source 노드 id(들) → 이 노드. */
+        upstream?: string[];
+    };
+}
+/** 산출된 방향 그래프. */
+export interface FlowGraph {
+    /** id → 노드. */
+    nodes: Map<string, FlowGraphNode>;
+    /** id → outbound 별 연결 대상 id (없으면 null). index = outbound 순서. */
+    out: Map<string, Array<string | null>>;
+    /** 말단(outbound 연결 0) — 목적지 후보. */
+    sinks: Set<string>;
+    /** 진입원(inbound 연결 0). */
+    sources: Set<string>;
+}
+/**
+ * 노드 목록 → 방향 그래프. 간선은 matchOutbounds(anchor 정밀 + footprint 배달)
+ * 재사용 — 컨베이어 자동연결과 *동일 판정*이라 그래프가 실제 흐름과 일치.
+ */
+export declare function buildFlowGraph(nodes: ReadonlyArray<FlowGraphNode>, tolerance?: MatchTolerance): FlowGraph;
+/**
+ * fromId 의 *각 outbound* 에서 도달 가능한 노드 집합. 반환 index = outbound 순서.
+ * 연결 없는 outbound = 빈 집합. 분기점 next-hop 선택의 1차 재료.
+ */
+export declare function reachableByOutbound(graph: FlowGraph, fromId: string): Set<string>[];
+/**
+ * fromId 에서 destId 로 가까워지는 *outbound index 목록*, **최단 hop 우선 정렬**.
+ * 동률은 index 순(결정적). 여러 개면 상위(resolver)가 capacity 등으로 tie-break.
+ * 빈 배열 = 도달 불가(이 노드에선 막힘).
+ */
+export declare function nextHops(graph: FlowGraph, fromId: string, destId: string): number[];
+/**
+ * fromId 에서 destId 로 가는 *최단 outbound index 1개* (없으면 -1). resolver 가
+ * capacity 무관할 때의 기본 선택. capacity-reactive 는 nextHops 전체를 받아 거른다.
+ */
+export declare function nextHop(graph: FlowGraph, fromId: string, destId: string): number;
+/** fromId 가 destId 에 도달 가능한가 (어느 outbound 로든). dispatcher canReach 의 망 판정. */
+export declare function canReach(graph: FlowGraph, fromId: string, destId: string): boolean;
+/** fromId 에서 도달 가능한 *말단(sink) 노드 집합*. generator 가 보낼 수 있는 목적지 후보. */
+export declare function reachableSinks(graph: FlowGraph, fromId: string): Set<string>;
+/**
+ * fromId 에서 *목적지 값을 담당하는 여러 sink 중 아무거나* 로 가까워지는 outbound
+ * index 목록 (최단 hop 우선). 논리 목적지를 담당하는 물리 sink 가 여럿일 때
+ * (= 부하분산 여지). destIds = 그 목적지를 담당하는 sink 노드 id 들.
+ */
+export declare function nextHopsToAny(graph: FlowGraph, fromId: string, destIds: Iterable<string>): number[];
+/** Outbound 후보 — Phase B2 balancing 정책에서 hops 동률 그룹 + target sink id 사용. */
+export interface NextHopCandidate {
+    /** outbound port index (FlowGraphNode.topology.outbounds 의 index, = graph.out 의 index). */
+    index: number;
+    /** 이 outbound 의 *_가까운 sink_* 까지의 최단 hop 수 (자기 포함 = 1). */
+    hops: number;
+    /** 그 hop 의 *_가까운 sink id_* (동률 시 lexical first — 결정론). */
+    target: string;
+}
+/**
+ * nextHopsToAny 의 *_상세 버전_* — index + hops + target sink id. balancing 정책이
+ * *_같은 hops 동률 그룹화_* + *_target sink 의 routingWeight 조회_* 등에 사용 (Phase B2).
+ */
+export declare function nextHopsToAnyDetailed(graph: FlowGraph, fromId: string, destIds: Iterable<string>): NextHopCandidate[];
+//# sourceMappingURL=flow-graph.d.ts.map

package/dist-types/flow/flow-graph.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"flow-graph.d.ts","sourceRoot":"","sources":["../../src/flow/flow-graph.ts"],"names":[],"mappings":"AAiCA,OAAO,EAAkB,KAAK,eAAe,EAAE,KAAK,aAAa,EAAE,KAAK,cAAc,EAAE,MAAM,uBAAuB,CAAA;AAErH,wDAAwD;AACxD,MAAM,WAAW,aAAa;IAC5B,EAAE,EAAE,MAAM,CAAA;IACV,QAAQ,EAAE,eAAe,CAAA;IACzB,MAAM,CAAC,EAAE,aAAa,CAAA;IACtB;;;;;OAKG;IACH,KAAK,CAAC,EAAE;QACN,8BAA8B;QAC9B,UAAU,CAAC,EAAE,MAAM,EAAE,CAAA;QACrB,8BAA8B;QAC9B,QAAQ,CAAC,EAAE,MAAM,EAAE,CAAA;KACpB,CAAA;CACF;AAED,kBAAkB;AAClB,MAAM,WAAW,SAAS;IACxB,eAAe;IACf,KAAK,EAAE,GAAG,CAAC,MAAM,EAAE,aAAa,CAAC,CAAA;IACjC,gEAAgE;IAChE,GAAG,EAAE,GAAG,CAAC,MAAM,EAAE,KAAK,CAAC,MAAM,GAAG,IAAI,CAAC,CAAC,CAAA;IACtC,kCAAkC;IAClC,KAAK,EAAE,GAAG,CAAC,MAAM,CAAC,CAAA;IAClB,yBAAyB;IACzB,OAAO,EAAE,GAAG,CAAC,MAAM,CAAC,CAAA;CACrB;AAED;;;GAGG;AACH,wBAAgB,cAAc,CAAC,KAAK,EAAE,aAAa,CAAC,aAAa,CAAC,EAAE,SAAS,CAAC,EAAE,cAAc,GAAG,SAAS,CAwCzG;AA6BD;;;GAGG;AACH,wBAAgB,mBAAmB,CAAC,KAAK,EAAE,SAAS,EAAE,MAAM,EAAE,MAAM,GAAG,GAAG,CAAC,MAAM,CAAC,EAAE,CASnF;AA8BD;;;;GAIG;AACH,wBAAgB,QAAQ,CAAC,KAAK,EAAE,SAAS,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,GAAG,MAAM,EAAE,CAanF;AAED;;;GAGG;AACH,wBAAgB,OAAO,CAAC,KAAK,EAAE,SAAS,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,GAAG,MAAM,CAGhF;AAED,8EAA8E;AAC9E,wBAAgB,QAAQ,CAAC,KAAK,EAAE,SAAS,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,GAAG,OAAO,CAGlF;AAED,qEAAqE;AACrE,wBAAgB,cAAc,CAAC,KAAK,EAAE,SAAS,EAAE,MAAM,EAAE,MAAM,GAAG,GAAG,CAAC,MAAM,CAAC,CAM5E;AAED;;;;GAIG;AACH,wBAAgB,aAAa,CAAC,KAAK,EAAE,SAAS,EAAE,MAAM,EAAE,MAAM,EAAE,OAAO,EAAE,QAAQ,CAAC,MAAM,CAAC,GAAG,MAAM,EAAE,CAEnG;AAED,4EAA4E;AAC5E,MAAM,WAAW,gBAAgB;IAC/B,2FAA2F;IAC3F,KAAK,EAAE,MAAM,CAAA;IACb,0DAA0D;IAC1D,IAAI,EAAE,MAAM,CAAA;IACZ,0DAA0D;IAC1D,MAAM,EAAE,MAAM,CAAA;CACf;AAED;;;GAGG;AACH,wBAAgB,qBAAqB,CACnC,KAAK,EAAE,SAAS,EAChB,MAAM,EAAE,MAAM,EACd,OAAO,EAAE,QAAQ,CAAC,MAAM,CAAC,GACxB,gBAAgB,EAAE,CAwBpB"}

package/dist-types/flow/flow-introspection.d.ts

@@ -0,0 +1,36 @@
+export interface DataScenario {
+    /** 이 시나리오의 carrier data — 경로의 모든 constraint AND merge. */
+    data: Record<string, any>;
+    /** sampling weight — default 1 (= 균등). 향후 demand-driven 등 확장. */
+    weight: number;
+    /** debug — 경로의 segment id 들. */
+    pathIds?: string[];
+    /**
+     * 경로의 *종착 sink id* (= carrier 의 최종 목적지). generator 가 carrier.meta.
+     * destination 에 주입 → 분기점이 목적지 지향 next-hop 라우팅(flow-graph.canReach)
+     * 으로 분기하게 될 토대. 미상이면 undefined (= 목적지 없는 carrier).
+     */
+    destination?: string;
+}
+interface SegmentLike {
+    state?: {
+        id?: string;
+    };
+    parent?: any;
+    rootModel?: any;
+    root?: any;
+    getSegmentTopology?: () => any;
+}
+/**
+ * 생성기 (= source) 부터 BFS — RoutingCapability 의 constraints 누적 + sink 도달
+ * 시 시나리오 추가. 결과: 가능 data 시나리오 list.
+ *
+ * @returns 데이터 시나리오 list (균등 weight). 빈 list = downstream 추론 실패.
+ */
+export declare function enumerateDataScenarios(source: SegmentLike, maxDepth?: number): DataScenario[];
+/**
+ * AND merge — 두 constraint 의 key-value 합치기. key 충돌 (= 다른 value) 시 null.
+ */
+export declare function mergeConstraints(base: Record<string, any>, add: Record<string, any>): Record<string, any> | null;
+export {};
+//# sourceMappingURL=flow-introspection.d.ts.map

package/dist-types/flow/flow-introspection.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"flow-introspection.d.ts","sourceRoot":"","sources":["../../src/flow/flow-introspection.ts"],"names":[],"mappings":"AAoCA,MAAM,WAAW,YAAY;IAC3B,0DAA0D;IAC1D,IAAI,EAAE,MAAM,CAAC,MAAM,EAAE,GAAG,CAAC,CAAA;IACzB,iEAAiE;IACjE,MAAM,EAAE,MAAM,CAAA;IACd,gCAAgC;IAChC,OAAO,CAAC,EAAE,MAAM,EAAE,CAAA;IAClB;;;;OAIG;IACH,WAAW,CAAC,EAAE,MAAM,CAAA;CACrB;AAED,UAAU,WAAW;IACnB,KAAK,CAAC,EAAE;QAAE,EAAE,CAAC,EAAE,MAAM,CAAA;KAAE,CAAA;IACvB,MAAM,CAAC,EAAE,GAAG,CAAA;IACZ,SAAS,CAAC,EAAE,GAAG,CAAA;IACf,IAAI,CAAC,EAAE,GAAG,CAAA;IACV,kBAAkB,CAAC,EAAE,MAAM,GAAG,CAAA;CAC/B;AAED;;;;;GAKG;AACH,wBAAgB,sBAAsB,CACpC,MAAM,EAAE,WAAW,EACnB,QAAQ,SAAK,GACZ,YAAY,EAAE,CAmGhB;AAED;;GAEG;AACH,wBAAgB,gBAAgB,CAC9B,IAAI,EAAE,MAAM,CAAC,MAAM,EAAE,GAAG,CAAC,EACzB,GAAG,EAAE,MAAM,CAAC,MAAM,EAAE,GAAG,CAAC,GACvB,MAAM,CAAC,MAAM,EAAE,GAAG,CAAC,GAAG,IAAI,CAO5B"}

package/dist-types/flow/flow-node.d.ts

@@ -0,0 +1,69 @@
+import type Component from '../components/component.js';
+type Constructor<T = {}> = new (...args: any[]) => T;
+/** 3D position. */
+export type Vec3 = {
+    x: number;
+    y: number;
+    z: number;
+};
+/**
+ * Port — flow graph 의 edge endpoint (inbound / outbound).
+ * 그래프 측 routing / FlowEngine 이 활용.
+ */
+export interface Port {
+    /** Port id (node 안 유일). */
+    id: string;
+    /** 위치 (node-local). 도메인 측 routing / 시각화 활용. */
+    position?: Vec3;
+    /** 진행 방향 (node-local). 그래프 측 tangent. */
+    direction?: Vec3;
+    /** 도메인 메타데이터 (label / capability tag 등). */
+    meta?: Record<string, any>;
+}
+/**
+ * SlotInfo — node 안 세분 위치 (slot / cell 등).
+ *
+ * 3 capability 가 query 로 활용:
+ *   - Dwellable.attachPointFor(item, { slotId }) — slot.attach 활용
+ *   - Transferable.receive(item, { slotId }) — slot 별 receive
+ *   - Operable.transform(inputs, outputs, { slotId }) — slot 별 변화
+ */
+export interface SlotInfo {
+    /** node-local 위치. */
+    position: Vec3;
+    /** node-local size (옵션). */
+    size?: {
+        width: number;
+        height: number;
+        depth: number;
+    };
+    /** 3D scene-graph attach point (옵션). holder 의 _realObject 자손 object3d. */
+    attach?: any;
+    /** 도메인 메타데이터. */
+    meta?: Record<string, any>;
+}
+/**
+ * FlowNode capability — flow graph 의 노드 (구조 + flow). 보유는 Holdable 위임.
+ *
+ * 모든 자식 (Transferable / Dwellable / Operable) 의 base. Dwellable 적용 안 한 node
+ * 도 Holdable 로 _items 사용 가능 — 정책 (capacity 등) 만 추가 layer.
+ *
+ * Phase D-4 (2026-06-20): ItemsDataBinding 자동 합류 — 모든 FlowNode 자손이
+ * `holder.data` 표준 entry 자동 보유.
+ */
+export default function FlowNode<T extends Constructor<Component>>(superclass: T): any;
+/** Type guard. */
+export declare function isFlowNode(c: any): c is {
+    isFlowNode: true;
+    inboundPorts(): Port[];
+    outboundPorts(): Port[];
+    slotIds?(): string[];
+    slotAt?(slotId: string): SlotInfo | null;
+    _items: any[];
+    addItem: (h: any, o?: any) => void;
+    removeItem: (h: any, silent?: boolean) => void;
+    handoverIn: (c: any, o?: any) => void;
+    handoverOut: (c: any) => void;
+};
+export {};
+//# sourceMappingURL=flow-node.d.ts.map

package/dist-types/flow/flow-node.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"flow-node.d.ts","sourceRoot":"","sources":["../../src/flow/flow-node.ts"],"names":[],"mappings":"AAkBA,OAAO,KAAK,SAAS,MAAM,4BAA4B,CAAA;AA0BvD,KAAK,WAAW,CAAC,CAAC,GAAG,EAAE,IAAI,KAAK,GAAG,IAAI,EAAE,GAAG,EAAE,KAAK,CAAC,CAAA;AAEpD,mBAAmB;AACnB,MAAM,MAAM,IAAI,GAAG;IAAE,CAAC,EAAE,MAAM,CAAC;IAAC,CAAC,EAAE,MAAM,CAAC;IAAC,CAAC,EAAE,MAAM,CAAA;CAAE,CAAA;AAEtD;;;GAGG;AACH,MAAM,WAAW,IAAI;IACnB,2BAA2B;IAC3B,EAAE,EAAE,MAAM,CAAA;IACV,+CAA+C;IAC/C,QAAQ,CAAC,EAAE,IAAI,CAAA;IACf,yCAAyC;IACzC,SAAS,CAAC,EAAE,IAAI,CAAA;IAChB,4CAA4C;IAC5C,IAAI,CAAC,EAAE,MAAM,CAAC,MAAM,EAAE,GAAG,CAAC,CAAA;CAC3B;AAED;;;;;;;GAOG;AACH,MAAM,WAAW,QAAQ;IACvB,qBAAqB;IACrB,QAAQ,EAAE,IAAI,CAAA;IACd,4BAA4B;IAC5B,IAAI,CAAC,EAAE;QAAE,KAAK,EAAE,MAAM,CAAC;QAAC,MAAM,EAAE,MAAM,CAAC;QAAC,KAAK,EAAE,MAAM,CAAA;KAAE,CAAA;IACvD,0EAA0E;IAC1E,MAAM,CAAC,EAAE,GAAG,CAAA;IACZ,iBAAiB;IACjB,IAAI,CAAC,EAAE,MAAM,CAAC,MAAM,EAAE,GAAG,CAAC,CAAA;CAC3B;AAED;;;;;;;;GAQG;AACH,MAAM,CAAC,OAAO,UAAU,QAAQ,CAAC,CAAC,SAAS,WAAW,CAAC,SAAS,CAAC,EAAE,UAAU,EAAE,CAAC,GAAG,GAAG,CA2FrF;AAED,kBAAkB;AAClB,wBAAgB,UAAU,CACxB,CAAC,EAAE,GAAG,GACL,CAAC,IAAI;IACN,UAAU,EAAE,IAAI,CAAA;IAChB,YAAY,IAAI,IAAI,EAAE,CAAA;IACtB,aAAa,IAAI,IAAI,EAAE,CAAA;IACvB,OAAO,CAAC,IAAI,MAAM,EAAE,CAAA;IACpB,MAAM,CAAC,CAAC,MAAM,EAAE,MAAM,GAAG,QAAQ,GAAG,IAAI,CAAA;IACxC,MAAM,EAAE,GAAG,EAAE,CAAA;IACb,OAAO,EAAE,CAAC,CAAC,EAAE,GAAG,EAAE,CAAC,CAAC,EAAE,GAAG,KAAK,IAAI,CAAA;IAClC,UAAU,EAAE,CAAC,CAAC,EAAE,GAAG,EAAE,MAAM,CAAC,EAAE,OAAO,KAAK,IAAI,CAAA;IAC9C,UAAU,EAAE,CAAC,CAAC,EAAE,GAAG,EAAE,CAAC,CAAC,EAAE,GAAG,KAAK,IAAI,CAAA;IACrC,WAAW,EAAE,CAAC,CAAC,EAAE,GAAG,KAAK,IAAI,CAAA;CAC9B,CAEA"}

package/dist-types/flow/flow-orientation-coordinator.d.ts

@@ -0,0 +1,13 @@
+import { type FlowDir } from './flow-orientation.js';
+/** 트리에서 segment/anchor/hub 수집 → 흐름 방향 map. */
+export declare function computeFlowMap(root: any): Map<string, FlowDir>;
+/**
+ * 컨베이어가 자기 흐름 방향(reverse 여부)을 조회 — getSegmentTopology 에서 호출.
+ * true=reverse, false=forward, undefined=미결정(override 안 함, 수동값 유지).
+ *
+ * 흐름 방향은 *정적 레이아웃의 함수*라 시뮬 중엔 안 바뀐다 → root 당 *1회*만 computeFlowMap
+ * 하고 캐시 (per-call 전체 트리 스캔 제거 = 성능 핵심). 첫 조회는 모델 빌드 완료 후 발생하고,
+ * 모델 재로드 시 root(model_layer)가 새로 생겨 캐시도 자연히 비므로 별도 무효화 불필요.
+ */
+export declare function flowReverseFor(self: any): boolean | undefined;
+//# sourceMappingURL=flow-orientation-coordinator.d.ts.map

package/dist-types/flow/flow-orientation-coordinator.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"flow-orientation-coordinator.d.ts","sourceRoot":"","sources":["../../src/flow/flow-orientation-coordinator.ts"],"names":[],"mappings":"AAoBA,OAAO,EAA+D,KAAK,OAAO,EAAa,MAAM,uBAAuB,CAAA;AAuC5H,8CAA8C;AAC9C,wBAAgB,cAAc,CAAC,IAAI,EAAE,GAAG,GAAG,GAAG,CAAC,MAAM,EAAE,OAAO,CAAC,CAkF9D;AAED;;;;;;;GAOG;AACH,wBAAgB,cAAc,CAAC,IAAI,EAAE,GAAG,GAAG,OAAO,GAAG,SAAS,CAkB7D"}

package/dist-types/flow/flow-orientation.d.ts

@@ -0,0 +1,42 @@
+export interface Vec2 {
+    x: number;
+    z: number;
+}
+/** 방향 추론 대상 segment — start→end 가 intrinsic forward. */
+export interface FlowSegmentInput {
+    id: string;
+    start: Vec2;
+    end: Vec2;
+}
+/** 방향 기준점 — 연결 지점(세그먼트 끝점과 매칭)에서의 소스/싱크. */
+export interface FlowAnchor {
+    pos: Vec2;
+    /** 'source' = 여기서 흘려보냄(연결 세그먼트의 진입), 'sink' = 여기로 빨아들임(진출). */
+    kind: 'source' | 'sink';
+}
+/** forward = start→end, reverse = end→start, unknown = 미결정(anchor 미도달). */
+export type FlowDir = 'forward' | 'reverse' | 'unknown';
+export interface FlowResult {
+    /** segment id → 흐름 방향. */
+    directions: Map<string, FlowDir>;
+    /** anchor 불일치로 충돌한 segment id 들. */
+    conflicts: string[];
+}
+/**
+ * 연결된 segment 들의 흐름 방향을 anchor 에서 전파해 추론.
+ * @param tolerance 끝점 일치(연결) 판정 거리 (scene unit). default 5.
+ * @param hubs joint 처럼 *여러 컨베이어를 잇는 허브* — 한 그룹의 위치들은 단일
+ *   연결점으로 병합돼 그 사이로 흐름이 전파/보존된다 (2-way joint=통과, 3+=분기).
+ * @param anchorTolerance anchor(소스/싱크)→세그먼트 끝점 매칭 거리. 소스(generator)는
+ *   컨베이어와 *면 overlap*(~halfSpan) 으로 연결돼 점거리가 클 수 있어 endpoint
+ *   클러스터(tolerance)보다 넉넉해야 한다. default = tolerance.
+ */
+/** hub 입력 — 위치 그룹(기존) 또는 source/sink 성격을 가진 hub.
+ *  kind 'sink' = drain(연결 세그먼트 모두 hub 로 흘러듦), 'source' = spring(모두 나감).
+ *  joint 가 chute(sink)/generator(source) 를 footprint 에 품으면 그 kind 로 표시. */
+export type FlowHub = ReadonlyArray<Vec2> | {
+    positions: ReadonlyArray<Vec2>;
+    kind?: 'source' | 'sink';
+};
+export declare function inferFlowDirections(segments: ReadonlyArray<FlowSegmentInput>, anchors: ReadonlyArray<FlowAnchor>, tolerance?: number, hubs?: ReadonlyArray<FlowHub>, anchorTolerance?: number): FlowResult;
+//# sourceMappingURL=flow-orientation.d.ts.map

package/dist-types/flow/flow-orientation.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"flow-orientation.d.ts","sourceRoot":"","sources":["../../src/flow/flow-orientation.ts"],"names":[],"mappings":"AAuBA,MAAM,WAAW,IAAI;IACnB,CAAC,EAAE,MAAM,CAAA;IACT,CAAC,EAAE,MAAM,CAAA;CACV;AAED,wDAAwD;AACxD,MAAM,WAAW,gBAAgB;IAC/B,EAAE,EAAE,MAAM,CAAA;IACV,KAAK,EAAE,IAAI,CAAA;IACX,GAAG,EAAE,IAAI,CAAA;CACV;AAED,4CAA4C;AAC5C,MAAM,WAAW,UAAU;IACzB,GAAG,EAAE,IAAI,CAAA;IACT,+DAA+D;IAC/D,IAAI,EAAE,QAAQ,GAAG,MAAM,CAAA;CACxB;AAED,2EAA2E;AAC3E,MAAM,MAAM,OAAO,GAAG,SAAS,GAAG,SAAS,GAAG,SAAS,CAAA;AAEvD,MAAM,WAAW,UAAU;IACzB,0BAA0B;IAC1B,UAAU,EAAE,GAAG,CAAC,MAAM,EAAE,OAAO,CAAC,CAAA;IAChC,oCAAoC;IACpC,SAAS,EAAE,MAAM,EAAE,CAAA;CACpB;AAMD;;;;;;;;GAQG;AACH;;2EAE2E;AAC3E,MAAM,MAAM,OAAO,GAAG,aAAa,CAAC,IAAI,CAAC,GAAG;IAAE,SAAS,EAAE,aAAa,CAAC,IAAI,CAAC,CAAC;IAAC,IAAI,CAAC,EAAE,QAAQ,GAAG,MAAM,CAAA;CAAE,CAAA;AAExG,wBAAgB,mBAAmB,CACjC,QAAQ,EAAE,aAAa,CAAC,gBAAgB,CAAC,EACzC,OAAO,EAAE,aAAa,CAAC,UAAU,CAAC,EAClC,SAAS,SAAI,EACb,IAAI,GAAE,aAAa,CAAC,OAAO,CAAM,EACjC,eAAe,SAAY,GAC1B,UAAU,CAyPZ"}

package/dist-types/flow/flow-trace.d.ts

@@ -0,0 +1,5 @@
+export declare const FLOW_TRACE = false;
+export declare function ftrace(...args: unknown[]): void;
+/** 컴포넌트 식별자 — state.id 우선, refid fallback. */
+export declare function ftId(c: any): string;
+//# sourceMappingURL=flow-trace.d.ts.map

package/dist-types/flow/flow-trace.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"flow-trace.d.ts","sourceRoot":"","sources":["../../src/flow/flow-trace.ts"],"names":[],"mappings":"AAQA,eAAO,MAAM,UAAU,QAAQ,CAAA;AAK/B,wBAAgB,MAAM,CAAC,GAAG,IAAI,EAAE,OAAO,EAAE,GAAG,IAAI,CAM/C;AAED,8CAA8C;AAC9C,wBAAgB,IAAI,CAAC,CAAC,EAAE,GAAG,GAAG,MAAM,CAEnC"}

package/dist-types/flow/index.d.ts

@@ -0,0 +1,16 @@
+export { anchorsConnect, deliversInto, matchOutbounds, pointInRotatedRect, rayAbsDistanceToRect, straightSegmentTopology, straightSegmentEndpoints, arcSegmentTopology, straightSegmentMultiInbound, type Anchor2D, type SegmentTopology, type SegmentBounds, type MatchTolerance } from './segment-topology.js';
+export { rectFaceAnchors, type FaceAnchor } from './face-anchors.js';
+export { buildFlowGraph, nextHops, nextHop, nextHopsToAny, nextHopsToAnyDetailed, canReach, reachableSinks, reachableByOutbound, type FlowGraph, type FlowGraphNode, type NextHopCandidate } from './flow-graph.js';
+export { validate as validateFlowGraph } from './flow-graph-validator.js';
+export type { IssueSeverity, IssueCode, ValidateOptions, FlowGraphIssue } from './flow-graph-validator.js';
+export { inferDownstreamId, collectAdjacentSegments } from './auto-route.js';
+export { enumerateDataScenarios, type DataScenario } from './flow-introspection.js';
+export { inferFlowDirections, type FlowAnchor, type FlowSegmentInput, type FlowDir, type Vec2 } from './flow-orientation.js';
+export { computeFlowMap, flowReverseFor } from './flow-orientation-coordinator.js';
+export { ftrace, ftId } from './flow-trace.js';
+export { next, downstream, reachableDestinations, reachableDestinationsFrom, reachableDestinationsWeightedFrom, pickWeightedDestination, graphFor, validate, FlowEngine, type RoutingResult, type WeightedDestination } from './flow-engine.js';
+export { flowGraphFor, resolveNextHop, flowGraphIssues, sinksForDestination, componentForNode, nodeIdOf, allDestinations, applyPolicy, isRoutingTarget, type RoutingTarget, type BalancingPolicy, type BalancingState } from './flow-graph-coordinator.js';
+export { findNearestStationHost, isStationHost, type StationHostCandidate } from './station-host-inference.js';
+export { default as FlowNode, isFlowNode } from './flow-node.js';
+export type { Port, SlotInfo, Vec3 } from './flow-node.js';
+//# sourceMappingURL=index.d.ts.map

package/dist-types/flow/index.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../src/flow/index.ts"],"names":[],"mappings":"AASA,OAAO,EACL,cAAc,EACd,YAAY,EACZ,cAAc,EACd,kBAAkB,EAClB,oBAAoB,EACpB,uBAAuB,EACvB,wBAAwB,EACxB,kBAAkB,EAClB,2BAA2B,EAC3B,KAAK,QAAQ,EACb,KAAK,eAAe,EACpB,KAAK,aAAa,EAClB,KAAK,cAAc,EACpB,MAAM,uBAAuB,CAAA;AAE9B,OAAO,EAAE,eAAe,EAAE,KAAK,UAAU,EAAE,MAAM,mBAAmB,CAAA;AAGpE,OAAO,EACL,cAAc,EACd,QAAQ,EACR,OAAO,EACP,aAAa,EACb,qBAAqB,EACrB,QAAQ,EACR,cAAc,EACd,mBAAmB,EACnB,KAAK,SAAS,EACd,KAAK,aAAa,EAClB,KAAK,gBAAgB,EACtB,MAAM,iBAAiB,CAAA;AAGxB,OAAO,EAAE,QAAQ,IAAI,iBAAiB,EAAE,MAAM,2BAA2B,CAAA;AACzE,YAAY,EAAE,aAAa,EAAE,SAAS,EAAE,eAAe,EAAE,cAAc,EAAE,MAAM,2BAA2B,CAAA;AAG1G,OAAO,EAAE,iBAAiB,EAAE,uBAAuB,EAAE,MAAM,iBAAiB,CAAA;AAC5E,OAAO,EAAE,sBAAsB,EAAE,KAAK,YAAY,EAAE,MAAM,yBAAyB,CAAA;AACnF,OAAO,EAAE,mBAAmB,EAAE,KAAK,UAAU,EAAE,KAAK,gBAAgB,EAAE,KAAK,OAAO,EAAE,KAAK,IAAI,EAAE,MAAM,uBAAuB,CAAA;AAC5H,OAAO,EAAE,cAAc,EAAE,cAAc,EAAE,MAAM,mCAAmC,CAAA;AAClF,OAAO,EAAE,MAAM,EAAE,IAAI,EAAE,MAAM,iBAAiB,CAAA;AAI9C,OAAO,EACL,IAAI,EACJ,UAAU,EACV,qBAAqB,EACrB,yBAAyB,EACzB,iCAAiC,EACjC,uBAAuB,EACvB,QAAQ,EACR,QAAQ,EACR,UAAU,EACV,KAAK,aAAa,EAClB,KAAK,mBAAmB,EACzB,MAAM,kBAAkB,CAAA;AACzB,OAAO,EACL,YAAY,EACZ,cAAc,EACd,eAAe,EACf,mBAAmB,EACnB,gBAAgB,EAChB,QAAQ,EACR,eAAe,EACf,WAAW,EACX,eAAe,EACf,KAAK,aAAa,EAClB,KAAK,eAAe,EACpB,KAAK,cAAc,EACpB,MAAM,6BAA6B,CAAA;AACpC,OAAO,EAAE,sBAAsB,EAAE,aAAa,EAAE,KAAK,oBAAoB,EAAE,MAAM,6BAA6B,CAAA;AAI9G,OAAO,EAAE,OAAO,IAAI,QAAQ,EAAE,UAAU,EAAE,MAAM,gBAAgB,CAAA;AAChE,YAAY,EAAE,IAAI,EAAE,QAAQ,EAAE,IAAI,EAAE,MAAM,gBAAgB,CAAA"}

package/dist-types/flow/segment-topology.d.ts

@@ -0,0 +1,225 @@
+import { rectFaceAnchors } from './face-anchors.js';
+export { rectFaceAnchors };
+/** XZ 평면 vector (= scene world 좌표의 X/Z, Y 는 floor-level 무시). */
+export interface Anchor2D {
+    /** scene world position (x = state.left + offset, z = state.top + offset). */
+    worldPos: {
+        x: number;
+        z: number;
+    };
+    /** 진행 방향 단위 vector (carrier 의 속도 vector 와 일치). */
+    direction: {
+        x: number;
+        z: number;
+    };
+    /**
+     * 면(face) 의 절반 길이 — anchor 가 *면* 에서 유래한 경우. anchorsConnect 가
+     * 접선 방향 판정을 중심 거리 근사가 아닌 *면 segment 겹침* 으로 수행하는 데
+     * 사용. 미지정 (점 anchor) 시 기존 중심 거리 판정 fallback.
+     */
+    halfSpan?: number;
+}
+/** Segment 의 입출구 anchor 들. inbound/outbound 각 1개 이상. */
+export interface SegmentTopology {
+    /** 입구 anchor 들. carrier 가 들어올 수 있는 면. 미구현 segment = 빈 배열. */
+    inbounds: Anchor2D[];
+    /** 출구 anchor 들. carrier 가 나갈 수 있는 면. 미구현 segment = 빈 배열. */
+    outbounds: Anchor2D[];
+}
+/** Anchor 매칭 tolerance (= 자동 연결 판정 기준). */
+export interface MatchTolerance {
+    /** 좌표 distance 임계 (scene unit). default 5. */
+    distance?: number;
+    /** 방향 dot product 임계 (= cosine). 1 = 완전 일치, 0.95 ≈ 18° 이내. default 0.9. */
+    cosine?: number;
+    /** sink(outbound 없는 종착: StockPile/Dock 등) footprint-배달 margin. default 30 —
+     *  딱 안 붙어도 인접하면 자동링크. 흐름연속 후보는 영향 없음(6 고정). */
+    sinkMargin?: number;
+}
+/**
+ * State 기반 *_straight segment_* 의 topology. 가장 흔한 케이스 — Conveyor /
+ * cross-belt-line / induct-station 등. orientation 자동 추정 (horizontal /
+ * vertical / auto by aspect).
+ *
+ * 가정:
+ *   - state.left/top = 좌상단, width/height = 크기
+ *   - rotation = 중심 기준 회전 (radian, CW positive — things-scene 표준)
+ *   - 흐름 방향 = *_긴 축_* (orientation auto 시 width vs height 비교)
+ *   - status='reverse' 시 흐름 반대 (= inbound/outbound swap)
+ *
+ * 결과:
+ *   - inbound  = 시작 짧은 면의 중앙
+ *   - outbound = 끝   짧은 면의 중앙
+ *   - direction = 시작 → 끝 단위 vector
+ */
+export declare function straightSegmentTopology(state: {
+    left?: number;
+    top?: number;
+    width?: number;
+    height?: number;
+    rotation?: number;
+    orientation?: 'horizontal' | 'vertical' | '';
+    status?: string;
+}, reverseOverride?: boolean): SegmentTopology;
+/**
+ * Straight segment 의 *기하 끝점* (start/end) — status/reverse 무관. flow-orientation
+ * 이 흐름 방향을 추론할 때 순환(현재 reverse 가 다음 추론에 영향) 을 피하려 *고정된*
+ * 기하 끝점이 필요. straightSegmentTopology 의 startPos/endPos 와 동일 좌표.
+ * 반환: { start, end } — start→end 가 intrinsic forward (reverse=false 일 때 흐름).
+ */
+export declare function straightSegmentEndpoints(state: {
+    left?: number;
+    top?: number;
+    width?: number;
+    height?: number;
+    rotation?: number;
+    orientation?: 'horizontal' | 'vertical' | '';
+}): {
+    start: {
+        x: number;
+        z: number;
+    };
+    end: {
+        x: number;
+        z: number;
+    };
+} | null;
+/**
+ * Arc (curve) segment topology — cross-belt-curve / conveyor-join 같은 *_도넛
+ * 섹터_* segment. carrier 가 호 위를 따라 시작→끝 각도로 흐름.
+ *
+ * State shape (도넛 섹터):
+ *   - cx, cy: 호 중심 (scene absolute 좌표)
+ *   - rx, ry: 외측 반지름 (x/y 다름 = ellipse 호 가능)
+ *   - ratio (0..100): 내측 반지름 비율 (innerRx = rx * ratio/100)
+ *   - startAngle, endAngle: 시작/끝 각도 (radian, things-scene 컨벤션)
+ *
+ * 호 위 점 공식 (line 348 의 ConveyorJoin.controls 와 일치):
+ *   P(θ) = (cx + r*sin(θ), cy - r*cos(θ))
+ *   tangent (carrier 진행 방향) = (cos(θ), sin(θ))
+ *
+ * Anchor:
+ *   - inbound at startAngle: midR 거리 + 진행 방향 (= θ 증가 방향)
+ *   - outbound at endAngle:  midR 거리 + 진행 방향
+ *   - reverse 시 swap + direction 반전
+ */
+export declare function arcSegmentTopology(state: {
+    cx?: number;
+    cy?: number;
+    rx?: number;
+    ry?: number;
+    ratio?: number;
+    startAngle?: number;
+    endAngle?: number;
+    status?: string;
+}): SegmentTopology;
+/**
+ * Multi-inbound straight segment — 합류 (merger) 의 토대. 흐름축은 그대로 (1
+ * outbound 한 면) 인데, *_나머지 모든 면이 inbound_* (= 어느 옆 conveyor 가
+ * 와도 합류 가능).
+ *
+ *   - outbounds = straightSegmentTopology(state).outbounds (= 1 face)
+ *   - inbounds  = 직교 (흐름축 시작 + 양 perpendicular) + 측면 사선 (45° 전진 편향)
+ *
+ * 사선 anchor — 실물 merger 는 양쪽에서 *사선* 으로 모이는 Y자 합류가 통상.
+ * 측면 (흐름과 perpendicular) inbound 마다 본선 진행방향으로 45° 기운 anchor 를
+ * 추가 선언 — 회전시킨 일반 conveyor 가 비스듬히 닿으면 자동 연결 (새 컴포넌트
+ * 불요). 가로 본선 기준 top 면은 ↘, bottom 면은 ↗ 로 자연 분리돼 양쪽 사선
+ * 합류가 성립. 직교 anchor 보존 (직교 합류도 유효).
+ *
+ * Direction 검사 가 *_같은 방향만 매칭_* 보장 — 옆 conveyor 가 방향 일치
+ * (직교 또는 사선) 시에만 자동 매칭. 의도 안 한 합류 차단.
+ */
+export declare function straightSegmentMultiInbound(state: {
+    left?: number;
+    top?: number;
+    width?: number;
+    height?: number;
+    rotation?: number;
+    orientation?: 'horizontal' | 'vertical' | '';
+    status?: string;
+}): SegmentTopology;
+/**
+ * 두 anchor 가 연결 가능한지 (= 자동 routing 후보). A 의 outbound 가 B 의
+ * inbound 와 *_위치 + 방향_* 일치하면 true.
+ *
+ *   - 위치: distance <= tolerance.distance
+ *   - 방향: outbound.direction · inbound.direction >= tolerance.cosine
+ *     (둘 다 *_carrier 의 진행 방향_*이므로 같은 방향이어야 함)
+ */
+export declare function anchorsConnect(out: Anchor2D, inn: Anchor2D, tolerance?: MatchTolerance): boolean;
+/** 컴포넌트의 board footprint (rotation 포함). matchOutbounds 의 배달 판정용. */
+export interface SegmentBounds {
+    left?: number;
+    top?: number;
+    width?: number;
+    height?: number;
+    rotation?: number;
+}
+/**
+ * 점 (px, pz) 가 회전된 사각 footprint 안인지 — margin 만큼 확장.
+ * board (x = left, z = top) 좌표계.
+ */
+export declare function pointInRotatedRect(px: number, pz: number, b: SegmentBounds, margin?: number): boolean;
+/**
+ * Ray-rectangle 절대값 거리 — chute 출구점을 통과하는 face normal 의 *_양방향 직선_*
+ * 과 사각형의 가장 가까운 교점까지 거리. 광선이 사각형 안에서 출발하면 (겹침) 가까운
+ * face 쪽 거리. 교차 없으면 Infinity.
+ *
+ * # 왜 이 metric 인가 (2026-06-17 사용자 통찰)
+ *
+ * 이전 matchOutbounds 의 ② 단계 tie-break = *_chute 출구점 ↔ stockpile center 의 유클리드
+ * 거리_*. 단점:
+ *   - 큰 stockpile 의 center 가 *_chute face 와 평행하지만 멀게_* 측정됨
+ *   - chute 가 *_정면으로_* 향한 stockpile 이 *_center 가 우연히 가까운_* 다른 sink 에 밀림
+ *
+ * 직교거리 (face normal 방향 ray cast) 가 *_물리적으로 자연_*:
+ *   - "chute 가 정면으로 가까운 face" 가 정확히 측정됨
+ *   - 큰 stockpile 의 긴 face 가 *_chute face 와 평행_* 일 때 hit 거리 짧음
+ *   - 컴포넌트 center 위치와 무관 — center 왜곡 제거
+ *
+ * # 절대값 (양방향) 이유
+ * chute 출구점이 stockpile 영역 안 (겹침) 인 경우도 자연스럽게 처리. 정방향 hit 가 더 멀어도
+ * 역방향에 더 가까운 face 가 있으면 그 거리. 진행 방향 의존성 제거.
+ */
+export declare function rayAbsDistanceToRect(origin: {
+    x: number;
+    z: number;
+}, direction: {
+    x: number;
+    z: number;
+}, rect: SegmentBounds): number;
+/**
+ * source 배출 anchor 가 target footprint 로 *배달* 되는지 — anchor 끝-끝
+ * 매칭의 보완. 사용자가 컴포넌트를 (회전·겹침 포함) 손으로 놓아 배출 끝점이
+ * 상대 입구를 파고들어도 (= 겹침) 자동 연결되도록.
+ *
+ *   - 끝점이 footprint 안 (+ margin) — 물리적으로 들이밀고 있음
+ *   - 방향이 전진 호환 — candidateFlow (target 흐름) 와 dot ≥ 0 (역류 차단).
+ *     flow 없으면 (sink) footprint 중심을 향하는지로 대체.
+ *
+ * 끝-끝 정밀 매칭 (anchorsConnect) 의 거리 tolerance(5) 가 hand-place 겹침
+ * (10~25 unit) 을 갭으로 거부하던 결함 보완 (2026-06-08 보고).
+ */
+export declare function deliversInto(out: Anchor2D, bounds: SegmentBounds, candidateFlow?: {
+    x: number;
+    z: number;
+}, margin?: number): boolean;
+/**
+ * 자기 outbound 각각에 대해 *_연결 가능한 인근 segment_* 의 id 를 매칭.
+ *
+ *   - candidates: scene 안 모든 segment (자기 자신 제외). 각 항목은
+ *     { id, topology } — pure helper 라 component 객체가 아닌 추출 정보만.
+ *   - 결과: outbound index → matched candidate id (또는 null). 자기 outbound
+ *     수 만큼.
+ *
+ * 매칭 우선순위:
+ *   - 정확 일치 후보가 여럿이면 *_가장 가까운 worldPos_*.
+ *   - 그래도 동률이면 id 사전순 (결정성).
+ */
+export declare function matchOutbounds(selfTopology: SegmentTopology, candidates: ReadonlyArray<{
+    id: string;
+    topology: SegmentTopology;
+    bounds?: SegmentBounds;
+}>, tolerance?: MatchTolerance): Array<string | null>;
+//# sourceMappingURL=segment-topology.d.ts.map

package/dist-types/flow/segment-topology.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"segment-topology.d.ts","sourceRoot":"","sources":["../../src/flow/segment-topology.ts"],"names":[],"mappings":"AAgDA,OAAO,EAAE,eAAe,EAAE,MAAM,mBAAmB,CAAA;AACnD,OAAO,EAAE,eAAe,EAAE,CAAA;AAE1B,gEAAgE;AAChE,MAAM,WAAW,QAAQ;IACvB,8EAA8E;IAC9E,QAAQ,EAAE;QAAE,CAAC,EAAE,MAAM,CAAC;QAAC,CAAC,EAAE,MAAM,CAAA;KAAE,CAAA;IAClC,kDAAkD;IAClD,SAAS,EAAE;QAAE,CAAC,EAAE,MAAM,CAAC;QAAC,CAAC,EAAE,MAAM,CAAA;KAAE,CAAA;IACnC;;;;OAIG;IACH,QAAQ,CAAC,EAAE,MAAM,CAAA;CAClB;AAED,wDAAwD;AACxD,MAAM,WAAW,eAAe;IAC9B,6DAA6D;IAC7D,QAAQ,EAAE,QAAQ,EAAE,CAAA;IACpB,4DAA4D;IAC5D,SAAS,EAAE,QAAQ,EAAE,CAAA;CACtB;AAED,2CAA2C;AAC3C,MAAM,WAAW,cAAc;IAC7B,8CAA8C;IAC9C,QAAQ,CAAC,EAAE,MAAM,CAAA;IACjB,2EAA2E;IAC3E,MAAM,CAAC,EAAE,MAAM,CAAA;IACf;mDAC+C;IAC/C,UAAU,CAAC,EAAE,MAAM,CAAA;CACpB;AAED;;;;;;;;;;;;;;;GAeG;AACH,wBAAgB,uBAAuB,CAAC,KAAK,EAAE;IAC7C,IAAI,CAAC,EAAE,MAAM,CAAA;IACb,GAAG,CAAC,EAAE,MAAM,CAAA;IACZ,KAAK,CAAC,EAAE,MAAM,CAAA;IACd,MAAM,CAAC,EAAE,MAAM,CAAA;IACf,QAAQ,CAAC,EAAE,MAAM,CAAA;IACjB,WAAW,CAAC,EAAE,YAAY,GAAG,UAAU,GAAG,EAAE,CAAA;IAC5C,MAAM,CAAC,EAAE,MAAM,CAAA;CAChB,EAAE,eAAe,CAAC,EAAE,OAAO,GAAG,eAAe,CA+D7C;AAED;;;;;GAKG;AACH,wBAAgB,wBAAwB,CAAC,KAAK,EAAE;IAC9C,IAAI,CAAC,EAAE,MAAM,CAAA;IACb,GAAG,CAAC,EAAE,MAAM,CAAA;IACZ,KAAK,CAAC,EAAE,MAAM,CAAA;IACd,MAAM,CAAC,EAAE,MAAM,CAAA;IACf,QAAQ,CAAC,EAAE,MAAM,CAAA;IACjB,WAAW,CAAC,EAAE,YAAY,GAAG,UAAU,GAAG,EAAE,CAAA;CAC7C,GAAG;IAAE,KAAK,EAAE;QAAE,CAAC,EAAE,MAAM,CAAC;QAAC,CAAC,EAAE,MAAM,CAAA;KAAE,CAAC;IAAC,GAAG,EAAE;QAAE,CAAC,EAAE,MAAM,CAAC;QAAC,CAAC,EAAE,MAAM,CAAA;KAAE,CAAA;CAAE,GAAG,IAAI,CAsB5E;AAED;;;;;;;;;;;;;;;;;;GAkBG;AACH,wBAAgB,kBAAkB,CAAC,KAAK,EAAE;IACxC,EAAE,CAAC,EAAE,MAAM,CAAC;IAAC,EAAE,CAAC,EAAE,MAAM,CAAC;IAAC,EAAE,CAAC,EAAE,MAAM,CAAC;IAAC,EAAE,CAAC,EAAE,MAAM,CAAC;IAAC,KAAK,CAAC,EAAE,MAAM,CAAA;IAClE,UAAU,CAAC,EAAE,MAAM,CAAC;IAAC,QAAQ,CAAC,EAAE,MAAM,CAAC;IAAC,MAAM,CAAC,EAAE,MAAM,CAAA;CACxD,GAAG,eAAe,CAsClB;AAED;;;;;;;;;;;;;;;;GAgBG;AACH,wBAAgB,2BAA2B,CAAC,KAAK,EAAE;IACjD,IAAI,CAAC,EAAE,MAAM,CAAC;IAAC,GAAG,CAAC,EAAE,MAAM,CAAC;IAAC,KAAK,CAAC,EAAE,MAAM,CAAC;IAAC,MAAM,CAAC,EAAE,MAAM,CAAC;IAAC,QAAQ,CAAC,EAAE,MAAM,CAAC;IAChF,WAAW,CAAC,EAAE,YAAY,GAAG,UAAU,GAAG,EAAE,CAAC;IAAC,MAAM,CAAC,EAAE,MAAM,CAAA;CAC9D,GAAG,eAAe,CA+BlB;AAGD;;;;;;;GAOG;AACH,wBAAgB,cAAc,CAC5B,GAAG,EAAE,QAAQ,EACb,GAAG,EAAE,QAAQ,EACb,SAAS,GAAE,cAAmB,GAC7B,OAAO,CA6BT;AAED,oEAAoE;AACpE,MAAM,WAAW,aAAa;IAC5B,IAAI,CAAC,EAAE,MAAM,CAAC;IAAC,GAAG,CAAC,EAAE,MAAM,CAAC;IAAC,KAAK,CAAC,EAAE,MAAM,CAAC;IAAC,MAAM,CAAC,EAAE,MAAM,CAAC;IAAC,QAAQ,CAAC,EAAE,MAAM,CAAA;CAChF;AAED;;;GAGG;AACH,wBAAgB,kBAAkB,CAAC,EAAE,EAAE,MAAM,EAAE,EAAE,EAAE,MAAM,EAAE,CAAC,EAAE,aAAa,EAAE,MAAM,SAAI,GAAG,OAAO,CAehG;AAED;;;;;;;;;;;;;;;;;;;;GAoBG;AACH,wBAAgB,oBAAoB,CAClC,MAAM,EAAE;IAAE,CAAC,EAAE,MAAM,CAAC;IAAC,CAAC,EAAE,MAAM,CAAA;CAAE,EAChC,SAAS,EAAE;IAAE,CAAC,EAAE,MAAM,CAAC;IAAC,CAAC,EAAE,MAAM,CAAA;CAAE,EACnC,IAAI,EAAE,aAAa,GAClB,MAAM,CAsDR;AAED;;;;;;;;;;;GAWG;AACH,wBAAgB,YAAY,CAC1B,GAAG,EAAE,QAAQ,EACb,MAAM,EAAE,aAAa,EACrB,aAAa,CAAC,EAAE;IAAE,CAAC,EAAE,MAAM,CAAC;IAAC,CAAC,EAAE,MAAM,CAAA;CAAE,EACxC,MAAM,SAAI,GACT,OAAO,CAOT;AAED;;;;;;;;;;;GAWG;AACH,wBAAgB,cAAc,CAC5B,YAAY,EAAE,eAAe,EAC7B,UAAU,EAAE,aAAa,CAAC;IAAE,EAAE,EAAE,MAAM,CAAC;IAAC,QAAQ,EAAE,eAAe,CAAC;IAAC,MAAM,CAAC,EAAE,aAAa,CAAA;CAAE,CAAC,EAC5F,SAAS,CAAC,EAAE,cAAc,GACzB,KAAK,CAAC,MAAM,GAAG,IAAI,CAAC,CA4CtB"}

package/dist-types/flow/station-host-inference.d.ts

@@ -0,0 +1,23 @@
+export interface StationHostCandidate {
+    id: string;
+    component: any;
+    distance: number;
+}
+/**
+ * StationHost 자격 duck — *_register_*_* 메서드 보유로 sorter 류만 매칭 (chute 처럼
+ * routingLinks 만 가진 노드는 제외).
+ */
+export declare function isStationHost(c: any): boolean;
+/**
+ * 가까운 StationHost 자동 발견 — root 트리를 walk 하며 StationHost 자격 노드 중 입구
+ * 거리 최소. 동률은 id lexical order — 결정론 보장. 미발견 시 null.
+ *
+ * @param entry   chute/induct 의 입구 좌표 (board frame)
+ * @param root    root component
+ * @param exclude self (자기 자신 제외)
+ */
+export declare function findNearestStationHost(entry: {
+    x: number;
+    y: number;
+}, root: any, exclude?: any): StationHostCandidate | null;
+//# sourceMappingURL=station-host-inference.d.ts.map

package/dist-types/flow/station-host-inference.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"station-host-inference.d.ts","sourceRoot":"","sources":["../../src/flow/station-host-inference.ts"],"names":[],"mappings":"AAqBA,MAAM,WAAW,oBAAoB;IACnC,EAAE,EAAE,MAAM,CAAA;IACV,SAAS,EAAE,GAAG,CAAA;IACd,QAAQ,EAAE,MAAM,CAAA;CACjB;AASD;;;GAGG;AACH,wBAAgB,aAAa,CAAC,CAAC,EAAE,GAAG,GAAG,OAAO,CAO7C;AAED;;;;;;;GAOG;AACH,wBAAgB,sBAAsB,CACpC,KAAK,EAAE;IAAE,CAAC,EAAE,MAAM,CAAC;IAAC,CAAC,EAAE,MAAM,CAAA;CAAE,EAC/B,IAAI,EAAE,GAAG,EACT,OAAO,CAAC,EAAE,GAAG,GACZ,oBAAoB,GAAG,IAAI,CAmB7B"}

package/dist-types/items/arrangement/centering-queue-strategy.d.ts

@@ -0,0 +1,10 @@
+import type { ArrangementStrategy, SlotDef, Vec3 } from '../../transfer/types.js';
+export declare class CenteringQueueStrategy implements ArrangementStrategy {
+    private readonly owner;
+    private readonly itemSpacing;
+    private readonly axis;
+    constructor(owner: any, itemSpacing?: number, axis?: 'horizontal' | 'vertical');
+    positionAt(index: number, slotDef: SlotDef, _occupantCount: number, component?: any): Vec3 | null;
+    capacity(slotDef: SlotDef): number;
+}
+//# sourceMappingURL=centering-queue-strategy.d.ts.map

package/dist-types/items/arrangement/centering-queue-strategy.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"centering-queue-strategy.d.ts","sourceRoot":"","sources":["../../../src/items/arrangement/centering-queue-strategy.ts"],"names":[],"mappings":"AAoBA,OAAO,KAAK,EAAE,mBAAmB,EAAE,OAAO,EAAE,IAAI,EAAE,MAAM,yBAAyB,CAAA;AAEjF,qBAAa,sBAAuB,YAAW,mBAAmB;IAE9D,OAAO,CAAC,QAAQ,CAAC,KAAK;IACtB,OAAO,CAAC,QAAQ,CAAC,WAAW;IAC5B,OAAO,CAAC,QAAQ,CAAC,IAAI;gBAFJ,KAAK,EAAE,GAAG,EACV,WAAW,SAAI,EACf,IAAI,GAAE,YAAY,GAAG,UAAyB;IAGjE,UAAU,CAAC,KAAK,EAAE,MAAM,EAAE,OAAO,EAAE,OAAO,EAAE,cAAc,EAAE,MAAM,EAAE,SAAS,CAAC,EAAE,GAAG,GAAG,IAAI,GAAG,IAAI;IA0BjG,QAAQ,CAAC,OAAO,EAAE,OAAO,GAAG,MAAM;CAGnC"}

package/dist-types/items/arrangement/gravity-strategy.d.ts

@@ -0,0 +1,9 @@
+import type { ArrangementStrategy, SlotDef, Vec3 } from '../../transfer/types.js';
+export declare class GravityStrategy implements ArrangementStrategy {
+    /** Height of a single item; determines vertical stacking step (scene units). */
+    readonly itemHeight: number;
+    constructor(itemHeight?: number);
+    positionAt(index: number, slotDef: SlotDef, _occupantCount: number): Vec3 | null;
+    capacity(slotDef: SlotDef): number;
+}
+//# sourceMappingURL=gravity-strategy.d.ts.map

package/dist-types/items/arrangement/gravity-strategy.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"gravity-strategy.d.ts","sourceRoot":"","sources":["../../../src/items/arrangement/gravity-strategy.ts"],"names":[],"mappings":"AAiBA,OAAO,KAAK,EAAE,mBAAmB,EAAE,OAAO,EAAE,IAAI,EAAE,MAAM,yBAAyB,CAAA;AAEjF,qBAAa,eAAgB,YAAW,mBAAmB;IACzD,gFAAgF;IAChF,QAAQ,CAAC,UAAU,EAAE,MAAM,CAAA;gBAEf,UAAU,SAAI;IAI1B,UAAU,CAAC,KAAK,EAAE,MAAM,EAAE,OAAO,EAAE,OAAO,EAAE,cAAc,EAAE,MAAM,GAAG,IAAI,GAAG,IAAI;IAahF,QAAQ,CAAC,OAAO,EAAE,OAAO,GAAG,MAAM;CAGnC"}