@rxflow/manhattan 0.0.2 → 0.0.3

package/esm/utils/pathProcessing.d.ts

@@ -0,0 +1,45 @@
+/**
+ * Path Processing Utilities
+ *
+ * 提供路径后处理功能，包括：
+ * - 移除冗余扩展点
+ * - 插入扩展点
+ * - 优化锯齿模式
+ *
+ * Implements: Requirements 5.3
+ */
+import { Point, Rectangle } from '../geometry';
+import type { ResolvedOptions } from '../options';
+/**
+ * 检测锚点在边界框的哪条边上
+ */
+export declare function detectAnchorEdge(anchor: Point, bbox: Rectangle, tolerance?: number): 'left' | 'right' | 'top' | 'bottom' | null;
+/**
+ * 移除路径起点的扩展点
+ */
+export declare function removeSourceExtensionPoint(route: Point[], sourceAnchor: Point, sourceBBox: Rectangle, step: number, tolerance?: number): Point[];
+/**
+ * 移除路径终点的扩展点
+ */
+export declare function removeTargetExtensionPoint(route: Point[], targetAnchor: Point, targetBBox: Rectangle, step: number, tolerance?: number): Point[];
+/**
+ * 在源点插入扩展点
+ */
+export declare function insertSourceExtension(route: Point[], sourceAnchor: Point, sourceBBox: Rectangle, extensionDistance: number, tolerance?: number): Point[];
+/**
+ * 在目标点插入扩展点
+ */
+export declare function insertTargetExtension(route: Point[], targetAnchor: Point, targetBBox: Rectangle, extensionDistance: number, tolerance?: number): Point[];
+/**
+ * 检测并移除锯齿模式
+ */
+export declare function removeZigzagPatterns(route: Point[], targetBBox: Rectangle, tolerance?: number): Point[];
+/**
+ * 移除冗余点
+ */
+export declare function removeRedundantPoints(route: Point[], anchor: Point, tolerance?: number): Point[];
+/**
+ * 完整的路径后处理流程
+ */
+export declare function processRoute(route: Point[], sourceAnchor: Point, targetAnchor: Point, sourceBBox: Rectangle, targetBBox: Rectangle, options: ResolvedOptions): Point[];
+//# sourceMappingURL=pathProcessing.d.ts.map

package/esm/utils/pathProcessing.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"pathProcessing.d.ts","sourceRoot":"","sources":["../../src/utils/pathProcessing.ts"],"names":[],"mappings":"AAAA;;;;;;;;;GASG;AAEH,OAAO,EAAE,KAAK,EAAE,SAAS,EAAE,MAAM,aAAa,CAAA;AAC9C,OAAO,KAAK,EAAE,eAAe,EAAE,MAAM,YAAY,CAAA;AAEjD;;GAEG;AACH,wBAAgB,gBAAgB,CAC9B,MAAM,EAAE,KAAK,EACb,IAAI,EAAE,SAAS,EACf,SAAS,GAAE,MAAU,GACpB,MAAM,GAAG,OAAO,GAAG,KAAK,GAAG,QAAQ,GAAG,IAAI,CAM5C;AAED;;GAEG;AACH,wBAAgB,0BAA0B,CACxC,KAAK,EAAE,KAAK,EAAE,EACd,YAAY,EAAE,KAAK,EACnB,UAAU,EAAE,SAAS,EACrB,IAAI,EAAE,MAAM,EACZ,SAAS,GAAE,MAAU,GACpB,KAAK,EAAE,CAoBT;AAED;;GAEG;AACH,wBAAgB,0BAA0B,CACxC,KAAK,EAAE,KAAK,EAAE,EACd,YAAY,EAAE,KAAK,EACnB,UAAU,EAAE,SAAS,EACrB,IAAI,EAAE,MAAM,EACZ,SAAS,GAAE,MAAU,GACpB,KAAK,EAAE,CAoBT;AAED;;GAEG;AACH,wBAAgB,qBAAqB,CACnC,KAAK,EAAE,KAAK,EAAE,EACd,YAAY,EAAE,KAAK,EACnB,UAAU,EAAE,SAAS,EACrB,iBAAiB,EAAE,MAAM,EACzB,SAAS,GAAE,MAAU,GACpB,KAAK,EAAE,CA6CT;AAED;;GAEG;AACH,wBAAgB,qBAAqB,CACnC,KAAK,EAAE,KAAK,EAAE,EACd,YAAY,EAAE,KAAK,EACnB,UAAU,EAAE,SAAS,EACrB,iBAAiB,EAAE,MAAM,EACzB,SAAS,GAAE,MAAU,GACpB,KAAK,EAAE,CA6CT;AAED;;GAEG;AACH,wBAAgB,oBAAoB,CAClC,KAAK,EAAE,KAAK,EAAE,EACd,UAAU,EAAE,SAAS,EACrB,SAAS,GAAE,MAAU,GACpB,KAAK,EAAE,CA2BT;AAmCD;;GAEG;AACH,wBAAgB,qBAAqB,CACnC,KAAK,EAAE,KAAK,EAAE,EACd,MAAM,EAAE,KAAK,EACb,SAAS,GAAE,MAAU,GACpB,KAAK,EAAE,CA2BT;AAED;;GAEG;AACH,wBAAgB,YAAY,CAC1B,KAAK,EAAE,KAAK,EAAE,EACd,YAAY,EAAE,KAAK,EACnB,YAAY,EAAE,KAAK,EACnB,UAAU,EAAE,SAAS,EACrB,UAAU,EAAE,SAAS,EACrB,OAAO,EAAE,eAAe,GACvB,KAAK,EAAE,CA2ET"}

package/esm/utils/pathValidation.d.ts

@@ -0,0 +1,11 @@
+import { Point } from '../geometry';
+import type { NodeLookup } from '../options';
+/**
+ * Check if a path intersects with any obstacles (nodes)
+ * A path is considered to intersect if it has >= 2 unique intersection points with a node
+ *
+ * Note: pathPoints should be pre-processed by parseSVGPath which samples bezier curves
+ * into line segments, so this function works correctly with curved paths
+ */
+export declare function pathIntersectsObstacles(pathPoints: Point[], nodeLookup: NodeLookup): boolean;
+//# sourceMappingURL=pathValidation.d.ts.map

package/esm/utils/pathValidation.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"pathValidation.d.ts","sourceRoot":"","sources":["../../src/utils/pathValidation.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,KAAK,EAAa,MAAM,aAAa,CAAA;AAC9C,OAAO,KAAK,EAAE,UAAU,EAAE,MAAM,YAAY,CAAA;AAyF5C;;;;;;GAMG;AACH,wBAAgB,uBAAuB,CAAC,UAAU,EAAE,KAAK,EAAE,EAAE,UAAU,EAAE,UAAU,GAAG,OAAO,CAmC5F"}

package/esm/utils/rect.d.ts

@@ -0,0 +1,9 @@
+import { Point, Rectangle } from '../geometry';
+import type { ResolvedOptions, Direction } from '../options';
+import type { Grid } from './grid';
+/**
+ * Get points around a rectangle taking given directions into account
+ * Lines are drawn from anchor in given directions, intersections recorded
+ */
+export declare function getRectPoints(anchor: Point, bbox: Rectangle, directionList: Direction[], grid: Grid, options: ResolvedOptions): Point[];
+//# sourceMappingURL=rect.d.ts.map

package/esm/utils/rect.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"rect.d.ts","sourceRoot":"","sources":["../../src/utils/rect.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,KAAK,EAAE,SAAS,EAAQ,MAAM,aAAa,CAAA;AACpD,OAAO,KAAK,EAAE,eAAe,EAAE,SAAS,EAAE,MAAM,YAAY,CAAA;AAC5D,OAAO,KAAK,EAAE,IAAI,EAAE,MAAM,QAAQ,CAAA;AA6ClC;;;GAGG;AACH,wBAAgB,aAAa,CAC3B,MAAM,EAAE,KAAK,EACb,IAAI,EAAE,SAAS,EACf,aAAa,EAAE,SAAS,EAAE,EAC1B,IAAI,EAAE,IAAI,EACV,OAAO,EAAE,eAAe,GACvB,KAAK,EAAE,CAgFT"}

package/esm/utils/route.d.ts

@@ -0,0 +1,19 @@
+import { Point } from '../geometry';
+/**
+ * Normalize a point to a unit direction vector
+ */
+export declare function normalizePoint(point: Point): Point;
+/**
+ * Get string key for a point
+ */
+export declare function getKey(point: Point): string;
+/**
+ * Calculate minimum Manhattan distance from a point to multiple anchors
+ */
+export declare function getCost(from: Point, anchors: Point[]): number;
+/**
+ * Reconstruct route by concatenating points with their parents
+ * Removes redundant points in the same direction
+ */
+export declare function reconstructRoute(parents: Map<string, Point>, points: Map<string, Point>, tailPoint: Point, startPoint: Point, endPoint: Point): Point[];
+//# sourceMappingURL=route.d.ts.map

package/esm/utils/route.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"route.d.ts","sourceRoot":"","sources":["../../src/utils/route.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,KAAK,EAAE,MAAM,aAAa,CAAA;AAEnC;;GAEG;AACH,wBAAgB,cAAc,CAAC,KAAK,EAAE,KAAK,GAAG,KAAK,CAKlD;AAED;;GAEG;AACH,wBAAgB,MAAM,CAAC,KAAK,EAAE,KAAK,GAAG,MAAM,CAE3C;AAED;;GAEG;AACH,wBAAgB,OAAO,CAAC,IAAI,EAAE,KAAK,EAAE,OAAO,EAAE,KAAK,EAAE,GAAG,MAAM,CAW7D;AAED;;;GAGG;AACH,wBAAgB,gBAAgB,CAC9B,OAAO,EAAE,GAAG,CAAC,MAAM,EAAE,KAAK,CAAC,EAC3B,MAAM,EAAE,GAAG,CAAC,MAAM,EAAE,KAAK,CAAC,EAC1B,SAAS,EAAE,KAAK,EAChB,UAAU,EAAE,KAAK,EACjB,QAAQ,EAAE,KAAK,GACd,KAAK,EAAE,CA6DT"}

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "@rxflow/manhattan",
-  "version": "0.0.2",
+  "version": "0.0.3",
   "description": "Manhattan routing algorithm for ReactFlow - generates orthogonal paths with obstacle avoidance",
   "keywords": [
     "reactflow",