@rxflow/manhattan 0.0.2 → 0.0.3

package/esm/options/types.d.ts

@@ -0,0 +1,210 @@
+import { Point } from '../geometry';
+import type { AdaptiveStepConfig } from '../utils/AdaptiveStepCalculator';
+/**
+ * Direction type for routing
+ */
+export type Direction = 'top' | 'right' | 'bottom' | 'left';
+/**
+ * ReactFlow internal node structure
+ * Based on ReactFlow's InternalNodeBase type
+ */
+export interface InternalNode {
+    id: string;
+    position: {
+        x: number;
+        y: number;
+    };
+    internals: {
+        positionAbsolute: {
+            x: number;
+            y: number;
+        };
+    };
+    measured?: {
+        width?: number;
+        height?: number;
+    };
+    width?: number;
+    height?: number;
+    initialWidth?: number;
+    initialHeight?: number;
+    type?: string;
+    [key: string]: any;
+}
+/**
+ * Node lookup map type (ReactFlow's internal structure)
+ */
+export type NodeLookup = Map<string, InternalNode>;
+/**
+ * Performance optimization configuration
+ */
+export interface PerformanceConfig {
+    /** Enable path caching */
+    enableCache?: boolean;
+    /** Maximum cache size */
+    cacheSize?: number;
+    /** Enable QuadTree for obstacle queries */
+    enableQuadTree?: boolean;
+    /** Enable early termination when good path found */
+    earlyTermination?: boolean;
+}
+/**
+ * Debug configuration
+ */
+export interface DebugConfig {
+    /** Enable logging */
+    enableLogging?: boolean;
+    /** Enable performance metrics collection */
+    enableMetrics?: boolean;
+    /** Log level */
+    logLevel?: 'error' | 'warn' | 'info' | 'debug';
+}
+/**
+ * Manhattan router configuration options
+ */
+export interface ManhattanRouterOptions {
+    /**
+     * The size of step to find a route (the grid of the manhattan pathfinder)
+     * @default 10
+     */
+    step?: number;
+    /**
+     * The number of route finding loops that cause the router to abort and return fallback route instead
+     * @default 2000
+     */
+    maxLoopCount?: number;
+    /**
+     * The number of decimal places to round floating point coordinates
+     * @default 1
+     */
+    precision?: number;
+    /**
+     * The maximum change of direction (in degrees)
+     * @default 90
+     */
+    maxDirectionChange?: number;
+    /**
+     * Possible starting directions from a node
+     * @default ['top', 'right', 'bottom', 'left']
+     */
+    startDirections?: Direction[];
+    /**
+     * Possible ending directions to a node
+     * @default ['top', 'right', 'bottom', 'left']
+     */
+    endDirections?: Direction[];
+    /**
+     * Should certain nodes not be considered as obstacles?
+     */
+    excludeNodes?: string[];
+    /**
+     * Should certain types of nodes not be considered as obstacles?
+     */
+    excludeShapes?: string[];
+    /**
+     * Should the source and/or target not be considered as obstacles?
+     */
+    excludeTerminals?: ('source' | 'target')[];
+    /**
+     * The padding applied on the element bounding boxes
+     */
+    padding?: number | {
+        top: number;
+        right: number;
+        bottom: number;
+        left: number;
+    };
+    /**
+     * Border radius for rounded corners at path turns (in pixels)
+     * Set to 0 for sharp corners
+     * @default 5
+     */
+    borderRadius?: number;
+    /**
+     * Extension distance from node edge for path start/end points (in pixels)
+     * This controls how far the path extends away from the node before turning
+     * @default 20
+     */
+    extensionDistance?: number;
+    /**
+     * Source position (from ReactFlow)
+     * Used for smart point generation
+     */
+    sourcePosition?: string;
+    /**
+     * Target position (from ReactFlow)
+     * Used for smart point generation
+     */
+    targetPosition?: string;
+    /**
+     * A penalty received for direction change
+     */
+    penalties?: {
+        [angle: number]: number;
+    };
+    /**
+     * Fallback route function when pathfinding fails
+     */
+    fallbackRoute?: (from: Point, to: Point) => Point[];
+    /**
+     * Adaptive step configuration
+     * Automatically adjusts step size based on node density and path distance
+     */
+    adaptiveStep?: Partial<AdaptiveStepConfig>;
+    /**
+     * Performance optimization configuration
+     */
+    performance?: PerformanceConfig;
+    /**
+     * Debug configuration
+     */
+    debug?: DebugConfig;
+}
+/**
+ * Resolved options with all defaults applied
+ */
+export interface ResolvedOptions {
+    step: number;
+    maxLoopCount: number;
+    precision: number;
+    maxDirectionChange: number;
+    startDirections: Direction[];
+    endDirections: Direction[];
+    excludeNodes: string[];
+    excludeShapes: string[];
+    excludeTerminals: ('source' | 'target')[];
+    paddingBox: {
+        x: number;
+        y: number;
+        width: number;
+        height: number;
+    };
+    borderRadius: number;
+    extensionDistance: number;
+    sourcePosition?: string;
+    targetPosition?: string;
+    directionMap: {
+        top: Point;
+        right: Point;
+        bottom: Point;
+        left: Point;
+    };
+    directions: Array<{
+        cost: number;
+        offsetX: number;
+        offsetY: number;
+        angle?: number;
+        gridOffsetX?: number;
+        gridOffsetY?: number;
+    }>;
+    penalties: {
+        [angle: number]: number;
+    };
+    cost: number;
+    fallbackRoute?: (from: Point, to: Point) => Point[];
+    previousDirectionAngle?: number | null;
+    adaptiveStep: AdaptiveStepConfig;
+    performance: Required<PerformanceConfig>;
+    debug: Required<DebugConfig>;
+}
+//# sourceMappingURL=types.d.ts.map

package/esm/options/types.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"types.d.ts","sourceRoot":"","sources":["../../src/options/types.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,KAAK,EAAE,MAAM,aAAa,CAAA;AACnC,OAAO,KAAK,EAAE,kBAAkB,EAAE,MAAM,iCAAiC,CAAA;AAGzE;;GAEG;AACH,MAAM,MAAM,SAAS,GAAG,KAAK,GAAG,OAAO,GAAG,QAAQ,GAAG,MAAM,CAAA;AAE3D;;;GAGG;AACH,MAAM,WAAW,YAAY;IAC3B,EAAE,EAAE,MAAM,CAAA;IACV,QAAQ,EAAE;QAAE,CAAC,EAAE,MAAM,CAAC;QAAC,CAAC,EAAE,MAAM,CAAA;KAAE,CAAA;IAClC,SAAS,EAAE;QACT,gBAAgB,EAAE;YAAE,CAAC,EAAE,MAAM,CAAC;YAAC,CAAC,EAAE,MAAM,CAAA;SAAE,CAAA;KAC3C,CAAA;IACD,QAAQ,CAAC,EAAE;QACT,KAAK,CAAC,EAAE,MAAM,CAAA;QACd,MAAM,CAAC,EAAE,MAAM,CAAA;KAChB,CAAA;IACD,KAAK,CAAC,EAAE,MAAM,CAAA;IACd,MAAM,CAAC,EAAE,MAAM,CAAA;IACf,YAAY,CAAC,EAAE,MAAM,CAAA;IACrB,aAAa,CAAC,EAAE,MAAM,CAAA;IACtB,IAAI,CAAC,EAAE,MAAM,CAAA;IACb,CAAC,GAAG,EAAE,MAAM,GAAG,GAAG,CAAA;CACnB;AAED;;GAEG;AACH,MAAM,MAAM,UAAU,GAAG,GAAG,CAAC,MAAM,EAAE,YAAY,CAAC,CAAA;AAElD;;GAEG;AACH,MAAM,WAAW,iBAAiB;IAChC,0BAA0B;IAC1B,WAAW,CAAC,EAAE,OAAO,CAAA;IACrB,yBAAyB;IACzB,SAAS,CAAC,EAAE,MAAM,CAAA;IAClB,2CAA2C;IAC3C,cAAc,CAAC,EAAE,OAAO,CAAA;IACxB,oDAAoD;IACpD,gBAAgB,CAAC,EAAE,OAAO,CAAA;CAC3B;AAED;;GAEG;AACH,MAAM,WAAW,WAAW;IAC1B,qBAAqB;IACrB,aAAa,CAAC,EAAE,OAAO,CAAA;IACvB,4CAA4C;IAC5C,aAAa,CAAC,EAAE,OAAO,CAAA;IACvB,gBAAgB;IAChB,QAAQ,CAAC,EAAE,OAAO,GAAG,MAAM,GAAG,MAAM,GAAG,OAAO,CAAA;CAC/C;AAED;;GAEG;AACH,MAAM,WAAW,sBAAsB;IACrC;;;OAGG;IACH,IAAI,CAAC,EAAE,MAAM,CAAA;IAEb;;;OAGG;IACH,YAAY,CAAC,EAAE,MAAM,CAAA;IAErB;;;OAGG;IACH,SAAS,CAAC,EAAE,MAAM,CAAA;IAElB;;;OAGG;IACH,kBAAkB,CAAC,EAAE,MAAM,CAAA;IAE3B;;;OAGG;IACH,eAAe,CAAC,EAAE,SAAS,EAAE,CAAA;IAE7B;;;OAGG;IACH,aAAa,CAAC,EAAE,SAAS,EAAE,CAAA;IAE3B;;OAEG;IACH,YAAY,CAAC,EAAE,MAAM,EAAE,CAAA;IAEvB;;OAEG;IACH,aAAa,CAAC,EAAE,MAAM,EAAE,CAAA;IAExB;;OAEG;IACH,gBAAgB,CAAC,EAAE,CAAC,QAAQ,GAAG,QAAQ,CAAC,EAAE,CAAA;IAE1C;;OAEG;IACH,OAAO,CAAC,EAAE,MAAM,GAAG;QAAE,GAAG,EAAE,MAAM,CAAC;QAAC,KAAK,EAAE,MAAM,CAAC;QAAC,MAAM,EAAE,MAAM,CAAC;QAAC,IAAI,EAAE,MAAM,CAAA;KAAE,CAAA;IAE/E;;;;OAIG;IACH,YAAY,CAAC,EAAE,MAAM,CAAA;IAErB;;;;OAIG;IACH,iBAAiB,CAAC,EAAE,MAAM,CAAA;IAE1B;;;OAGG;IACH,cAAc,CAAC,EAAE,MAAM,CAAA;IAEvB;;;OAGG;IACH,cAAc,CAAC,EAAE,MAAM,CAAA;IAEvB;;OAEG;IACH,SAAS,CAAC,EAAE;QAAE,CAAC,KAAK,EAAE,MAAM,GAAG,MAAM,CAAA;KAAE,CAAA;IAEvC;;OAEG;IACH,aAAa,CAAC,EAAE,CAAC,IAAI,EAAE,KAAK,EAAE,EAAE,EAAE,KAAK,KAAK,KAAK,EAAE,CAAA;IAEnD;;;OAGG;IACH,YAAY,CAAC,EAAE,OAAO,CAAC,kBAAkB,CAAC,CAAA;IAE1C;;OAEG;IACH,WAAW,CAAC,EAAE,iBAAiB,CAAA;IAE/B;;OAEG;IACH,KAAK,CAAC,EAAE,WAAW,CAAA;CACpB;AAED;;GAEG;AACH,MAAM,WAAW,eAAe;IAC9B,IAAI,EAAE,MAAM,CAAA;IACZ,YAAY,EAAE,MAAM,CAAA;IACpB,SAAS,EAAE,MAAM,CAAA;IACjB,kBAAkB,EAAE,MAAM,CAAA;IAC1B,eAAe,EAAE,SAAS,EAAE,CAAA;IAC5B,aAAa,EAAE,SAAS,EAAE,CAAA;IAC1B,YAAY,EAAE,MAAM,EAAE,CAAA;IACtB,aAAa,EAAE,MAAM,EAAE,CAAA;IACvB,gBAAgB,EAAE,CAAC,QAAQ,GAAG,QAAQ,CAAC,EAAE,CAAA;IACzC,UAAU,EAAE;QAAE,CAAC,EAAE,MAAM,CAAC;QAAC,CAAC,EAAE,MAAM,CAAC;QAAC,KAAK,EAAE,MAAM,CAAC;QAAC,MAAM,EAAE,MAAM,CAAA;KAAE,CAAA;IACnE,YAAY,EAAE,MAAM,CAAA;IACpB,iBAAiB,EAAE,MAAM,CAAA;IACzB,cAAc,CAAC,EAAE,MAAM,CAAA;IACvB,cAAc,CAAC,EAAE,MAAM,CAAA;IACvB,YAAY,EAAE;QACZ,GAAG,EAAE,KAAK,CAAA;QACV,KAAK,EAAE,KAAK,CAAA;QACZ,MAAM,EAAE,KAAK,CAAA;QACb,IAAI,EAAE,KAAK,CAAA;KACZ,CAAA;IACD,UAAU,EAAE,KAAK,CAAC;QAChB,IAAI,EAAE,MAAM,CAAA;QACZ,OAAO,EAAE,MAAM,CAAA;QACf,OAAO,EAAE,MAAM,CAAA;QACf,KAAK,CAAC,EAAE,MAAM,CAAA;QACd,WAAW,CAAC,EAAE,MAAM,CAAA;QACpB,WAAW,CAAC,EAAE,MAAM,CAAA;KACrB,CAAC,CAAA;IACF,SAAS,EAAE;QAAE,CAAC,KAAK,EAAE,MAAM,GAAG,MAAM,CAAA;KAAE,CAAA;IACtC,IAAI,EAAE,MAAM,CAAA;IACZ,aAAa,CAAC,EAAE,CAAC,IAAI,EAAE,KAAK,EAAE,EAAE,EAAE,KAAK,KAAK,KAAK,EAAE,CAAA;IACnD,sBAAsB,CAAC,EAAE,MAAM,GAAG,IAAI,CAAA;IACtC,YAAY,EAAE,kBAAkB,CAAA;IAChC,WAAW,EAAE,QAAQ,CAAC,iBAAiB,CAAC,CAAA;IACxC,KAAK,EAAE,QAAQ,CAAC,WAAW,CAAC,CAAA;CAC7B"}

package/esm/pathfinder/PathCache.d.ts

@@ -0,0 +1,92 @@
+/**
+ * PathCache - LRU cache for computed paths
+ * Feature: manhattan-optimization
+ *
+ * Implements a Least Recently Used (LRU) cache for storing computed paths.
+ * This improves performance by avoiding redundant path calculations for
+ * identical source-target-options combinations.
+ *
+ * Requirements: 3.4
+ */
+import { Point, Rectangle } from '../geometry';
+import type { ResolvedOptions } from '../options';
+/**
+ * Cache entry containing the computed path and metadata
+ */
+export interface CacheEntry {
+    path: Point[];
+    timestamp: number;
+    hitCount: number;
+}
+/**
+ * Configuration for PathCache
+ */
+export interface PathCacheConfig {
+    /** Maximum number of entries in the cache */
+    maxSize: number;
+    /** Time-to-live in milliseconds (0 = no expiration) */
+    ttl: number;
+    /** Whether caching is enabled */
+    enabled: boolean;
+}
+/**
+ * Generate a cache key from path parameters
+ */
+export declare function generateCacheKey(sourceBBox: Rectangle, targetBBox: Rectangle, sourceAnchor: Point, targetAnchor: Point, options: ResolvedOptions): string;
+/**
+ * LRU Cache for computed paths
+ */
+export declare class PathCache {
+    private cache;
+    private config;
+    private hits;
+    private misses;
+    constructor(config?: Partial<PathCacheConfig>);
+    /**
+     * Get a cached path if available and not expired
+     */
+    get(key: string): Point[] | null;
+    /**
+     * Store a path in the cache
+     */
+    set(key: string, path: Point[]): void;
+    /**
+     * Check if a key exists in the cache (without updating LRU order)
+     */
+    has(key: string): boolean;
+    /**
+     * Clear all cached entries
+     */
+    clear(): void;
+    /**
+     * Get cache statistics
+     */
+    getStats(): {
+        size: number;
+        maxSize: number;
+        hits: number;
+        misses: number;
+        hitRate: number;
+    };
+    /**
+     * Update cache configuration
+     */
+    updateConfig(config: Partial<PathCacheConfig>): void;
+    /**
+     * Get current configuration
+     */
+    getConfig(): PathCacheConfig;
+    /**
+     * Remove expired entries (useful for periodic cleanup)
+     */
+    cleanup(): number;
+}
+/**
+ * Get the global path cache instance
+ */
+export declare function getGlobalPathCache(): PathCache;
+/**
+ * Reset the global path cache (useful for testing)
+ */
+export declare function resetGlobalPathCache(): void;
+//# sourceMappingURL=PathCache.d.ts.map

package/esm/pathfinder/PathCache.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"PathCache.d.ts","sourceRoot":"","sources":["../../src/pathfinder/PathCache.ts"],"names":[],"mappings":"AAAA;;;;;;;;;GASG;AACH,OAAO,EAAE,KAAK,EAAE,SAAS,EAAE,MAAM,aAAa,CAAA;AAC9C,OAAO,KAAK,EAAE,eAAe,EAAE,MAAM,YAAY,CAAA;AAEjD;;GAEG;AACH,MAAM,WAAW,UAAU;IACzB,IAAI,EAAE,KAAK,EAAE,CAAA;IACb,SAAS,EAAE,MAAM,CAAA;IACjB,QAAQ,EAAE,MAAM,CAAA;CACjB;AAED;;GAEG;AACH,MAAM,WAAW,eAAe;IAC9B,6CAA6C;IAC7C,OAAO,EAAE,MAAM,CAAA;IACf,uDAAuD;IACvD,GAAG,EAAE,MAAM,CAAA;IACX,iCAAiC;IACjC,OAAO,EAAE,OAAO,CAAA;CACjB;AAWD;;GAEG;AACH,wBAAgB,gBAAgB,CAC9B,UAAU,EAAE,SAAS,EACrB,UAAU,EAAE,SAAS,EACrB,YAAY,EAAE,KAAK,EACnB,YAAY,EAAE,KAAK,EACnB,OAAO,EAAE,eAAe,GACvB,MAAM,CAsBR;AAED;;GAEG;AACH,qBAAa,SAAS;IACpB,OAAO,CAAC,KAAK,CAAyB;IACtC,OAAO,CAAC,MAAM,CAAiB;IAC/B,OAAO,CAAC,IAAI,CAAY;IACxB,OAAO,CAAC,MAAM,CAAY;gBAEd,MAAM,GAAE,OAAO,CAAC,eAAe,CAAM;IAKjD;;OAEG;IACH,GAAG,CAAC,GAAG,EAAE,MAAM,GAAG,KAAK,EAAE,GAAG,IAAI;IAiChC;;OAEG;IACH,GAAG,CAAC,GAAG,EAAE,MAAM,EAAE,IAAI,EAAE,KAAK,EAAE,GAAG,IAAI;IAoBrC;;OAEG;IACH,GAAG,CAAC,GAAG,EAAE,MAAM,GAAG,OAAO;IAsBzB;;OAEG;IACH,KAAK,IAAI,IAAI;IAMb;;OAEG;IACH,QAAQ,IAAI;QACV,IAAI,EAAE,MAAM,CAAA;QACZ,OAAO,EAAE,MAAM,CAAA;QACf,IAAI,EAAE,MAAM,CAAA;QACZ,MAAM,EAAE,MAAM,CAAA;QACd,OAAO,EAAE,MAAM,CAAA;KAChB;IAWD;;OAEG;IACH,YAAY,CAAC,MAAM,EAAE,OAAO,CAAC,eAAe,CAAC,GAAG,IAAI;IAiBpD;;OAEG;IACH,SAAS,IAAI,eAAe;IAI5B;;OAEG;IACH,OAAO,IAAI,MAAM;CAiBlB;AAOD;;GAEG;AACH,wBAAgB,kBAAkB,IAAI,SAAS,CAK9C;AAED;;GAEG;AACH,wBAAgB,oBAAoB,IAAI,IAAI,CAK3C"}

package/esm/pathfinder/SortedSet.d.ts

@@ -0,0 +1,35 @@
+/**
+ * SortedSet class for managing open and closed sets in A* algorithm
+ * Maintains items sorted by their values
+ */
+export declare class SortedSet {
+    private items;
+    private hash;
+    private values;
+    constructor();
+    /**
+     * Add an item with its value, maintaining sorted order
+     */
+    add(item: string, value: number): void;
+    /**
+     * Pop the item with minimum value and mark it as closed
+     */
+    pop(): string | undefined;
+    /**
+     * Check if item is in open set
+     */
+    isOpen(item: string): boolean;
+    /**
+     * Check if item is in closed set
+     */
+    isClose(item: string): boolean;
+    /**
+     * Check if open set is empty
+     */
+    isEmpty(): boolean;
+    /**
+     * Find sorted insertion index for an item
+     */
+    private sortedIndexBy;
+}
+//# sourceMappingURL=SortedSet.d.ts.map

package/esm/pathfinder/SortedSet.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"SortedSet.d.ts","sourceRoot":"","sources":["../../src/pathfinder/SortedSet.ts"],"names":[],"mappings":"AAGA;;;GAGG;AACH,qBAAa,SAAS;IACpB,OAAO,CAAC,KAAK,CAAU;IACvB,OAAO,CAAC,IAAI,CAAqB;IACjC,OAAO,CAAC,MAAM,CAAqB;;IAQnC;;OAEG;IACH,GAAG,CAAC,IAAI,EAAE,MAAM,EAAE,KAAK,EAAE,MAAM,GAAG,IAAI;IAkBtC;;OAEG;IACH,GAAG,IAAI,MAAM,GAAG,SAAS;IAQzB;;OAEG;IACH,MAAM,CAAC,IAAI,EAAE,MAAM,GAAG,OAAO;IAI7B;;OAEG;IACH,OAAO,CAAC,IAAI,EAAE,MAAM,GAAG,OAAO;IAI9B;;OAEG;IACH,OAAO,IAAI,OAAO;IAIlB;;OAEG;IACH,OAAO,CAAC,aAAa;CAiBtB"}

package/esm/pathfinder/findRoute.d.ts

@@ -0,0 +1,8 @@
+import { Point, Rectangle } from '../geometry';
+import type { ResolvedOptions } from '../options';
+import type { ObstacleMap } from '../obstacle';
+/**
+ * Find route between two points using A* algorithm
+ */
+export declare function findRoute(sourceBBox: Rectangle, targetBBox: Rectangle, sourceAnchor: Point, targetAnchor: Point, map: ObstacleMap, options: ResolvedOptions): Point[] | null;
+//# sourceMappingURL=findRoute.d.ts.map

package/esm/pathfinder/findRoute.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"findRoute.d.ts","sourceRoot":"","sources":["../../src/pathfinder/findRoute.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,KAAK,EAAE,SAAS,EAAE,MAAM,aAAa,CAAA;AAC9C,OAAO,KAAK,EAAE,eAAe,EAAE,MAAM,YAAY,CAAA;AACjD,OAAO,KAAK,EAAE,WAAW,EAAE,MAAM,aAAa,CAAA;AAiI9C;;GAEG;AACH,wBAAgB,SAAS,CACvB,UAAU,EAAE,SAAS,EACrB,UAAU,EAAE,SAAS,EACrB,YAAY,EAAE,KAAK,EACnB,YAAY,EAAE,KAAK,EACnB,GAAG,EAAE,WAAW,EAChB,OAAO,EAAE,eAAe,GACvB,KAAK,EAAE,GAAG,IAAI,CA2XhB"}

package/esm/pathfinder/index.d.ts

@@ -0,0 +1,4 @@
+export { SortedSet } from './SortedSet';
+export { findRoute } from './findRoute';
+export { PathCache, generateCacheKey, getGlobalPathCache, resetGlobalPathCache, type CacheEntry, type PathCacheConfig, } from './PathCache';
+//# sourceMappingURL=index.d.ts.map

package/esm/pathfinder/index.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../src/pathfinder/index.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,SAAS,EAAE,MAAM,aAAa,CAAA;AACvC,OAAO,EAAE,SAAS,EAAE,MAAM,aAAa,CAAA;AACvC,OAAO,EACL,SAAS,EACT,gBAAgB,EAChB,kBAAkB,EAClB,oBAAoB,EACpB,KAAK,UAAU,EACf,KAAK,eAAe,GACrB,MAAM,aAAa,CAAA"}

package/esm/svg/index.d.ts

@@ -0,0 +1,3 @@
+export { pointsToPath, snapPathToGrid } from './pathConverter';
+export { parseSVGPath, simplifyPath } from './pathParser';
+//# sourceMappingURL=index.d.ts.map

package/esm/svg/index.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../src/svg/index.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,YAAY,EAAE,cAAc,EAAE,MAAM,iBAAiB,CAAA;AAC9D,OAAO,EAAE,YAAY,EAAE,YAAY,EAAE,MAAM,cAAc,CAAA"}

package/esm/svg/pathConverter.d.ts

@@ -0,0 +1,23 @@
+import { Point } from '../geometry';
+/**
+ * Convert array of points to SVG path string
+ */
+export declare function pointsToPath(points: Point[], precision: number, borderRadius?: number): string;
+/**
+ * Convert array of points to SVG path string with cubic bezier curves
+ * Provides smoother corners than quadratic bezier
+ */
+export declare function pointsToPathCubic(points: Point[], precision: number, borderRadius?: number): string;
+/**
+ * Snap path to grid by aligning consecutive points
+ */
+export declare function snapPathToGrid(points: Point[], gridSize: number): Point[];
+/**
+ * Check if an SVG path contains rounded corners (Q or C commands)
+ */
+export declare function hasRoundedCorners(path: string): boolean;
+/**
+ * Count the number of corners in a path
+ */
+export declare function countCorners(points: Point[]): number;
+//# sourceMappingURL=pathConverter.d.ts.map

package/esm/svg/pathConverter.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"pathConverter.d.ts","sourceRoot":"","sources":["../../src/svg/pathConverter.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,KAAK,EAAE,MAAM,aAAa,CAAA;AA4CnC;;GAEG;AACH,wBAAgB,YAAY,CAAC,MAAM,EAAE,KAAK,EAAE,EAAE,SAAS,EAAE,MAAM,EAAE,YAAY,GAAE,MAAU,GAAG,MAAM,CAwFjG;AAED;;;GAGG;AACH,wBAAgB,iBAAiB,CAAC,MAAM,EAAE,KAAK,EAAE,EAAE,SAAS,EAAE,MAAM,EAAE,YAAY,GAAE,MAAU,GAAG,MAAM,CAgGtG;AAED;;GAEG;AACH,wBAAgB,cAAc,CAAC,MAAM,EAAE,KAAK,EAAE,EAAE,QAAQ,EAAE,MAAM,GAAG,KAAK,EAAE,CAgCzE;AAED;;GAEG;AACH,wBAAgB,iBAAiB,CAAC,IAAI,EAAE,MAAM,GAAG,OAAO,CAEvD;AAED;;GAEG;AACH,wBAAgB,YAAY,CAAC,MAAM,EAAE,KAAK,EAAE,GAAG,MAAM,CAUpD"}

package/esm/svg/pathParser.d.ts

@@ -0,0 +1,11 @@
+import { Point } from '../geometry';
+/**
+ * Parse SVG path string to extract points
+ * Simplified parser that handles M, L, Q commands
+ */
+export declare function parseSVGPath(pathString: string): Point[];
+/**
+ * Simplify path by removing collinear intermediate points
+ */
+export declare function simplifyPath(points: Point[]): Point[];
+//# sourceMappingURL=pathParser.d.ts.map

package/esm/svg/pathParser.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"pathParser.d.ts","sourceRoot":"","sources":["../../src/svg/pathParser.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,KAAK,EAAE,MAAM,aAAa,CAAA;AAEnC;;;GAGG;AACH,wBAAgB,YAAY,CAAC,UAAU,EAAE,MAAM,GAAG,KAAK,EAAE,CA2CxD;AAED;;GAEG;AACH,wBAAgB,YAAY,CAAC,MAAM,EAAE,KAAK,EAAE,GAAG,KAAK,EAAE,CA0BrD"}

package/esm/utils/AdaptiveStepCalculator.d.ts

@@ -0,0 +1,90 @@
+/**
+ * AdaptiveStepCalculator - 自适应步长计算器
+ *
+ * 根据场景自动调整网格步长，平衡性能和路径质量
+ * - 高密度区域使用小步长，提高路径精度
+ * - 长距离路径使用大步长，提高计算性能
+ *
+ * Feature: manhattan-optimization
+ * Requirements: 2.3, 2.4
+ */
+import type { InternalNode, NodeLookup } from '../options/types';
+import { Point } from '../geometry';
+/**
+ * 自适应步长配置
+ */
+export interface AdaptiveStepConfig {
+    /** 是否启用自适应步长 */
+    enabled: boolean;
+    /** 最小步长 */
+    minStep: number;
+    /** 最大步长 */
+    maxStep: number;
+    /** 基于密度的调整配置 */
+    densityBased: {
+        enabled: boolean;
+        /** 节点密度阈值（节点数/10000平方像素） */
+        threshold: number;
+    };
+    /** 基于距离的调整配置 */
+    distanceBased: {
+        enabled: boolean;
+        /** 短路径阈值（像素） */
+        shortPathThreshold: number;
+        /** 长路径阈值（像素） */
+        longPathThreshold: number;
+    };
+}
+/**
+ * 默认自适应步长配置
+ */
+export declare const DEFAULT_ADAPTIVE_STEP_CONFIG: AdaptiveStepConfig;
+/**
+ * 自适应步长计算器
+ */
+export declare class AdaptiveStepCalculator {
+    private config;
+    constructor(config?: Partial<AdaptiveStepConfig>);
+    /**
+     * 合并配置与默认值
+     */
+    private mergeConfig;
+    /**
+     * 计算节点密度
+     * @param nodeLookup 节点查找表
+     * @returns 密度值（节点数/10000平方像素）
+     */
+    calculateNodeDensity(nodeLookup: NodeLookup): number;
+    /**
+     * 计算两点之间的曼哈顿距离
+     */
+    calculateDistance(source: Point | {
+        x: number;
+        y: number;
+    }, target: Point | {
+        x: number;
+        y: number;
+    }): number;
+    /**
+     * 基于距离计算步长
+     */
+    calculateDistanceBasedStep(distance: number): number;
+    /**
+     * 基于密度计算步长
+     */
+    calculateDensityBasedStep(density: number): number;
+    /**
+     * 计算自适应步长
+     * 综合考虑距离和密度因素
+     */
+    calculateStep(sourceNode: InternalNode, targetNode: InternalNode, nodeLookup: NodeLookup): number;
+    /**
+     * 获取当前配置
+     */
+    getConfig(): AdaptiveStepConfig;
+    /**
+     * 更新配置
+     */
+    updateConfig(config: Partial<AdaptiveStepConfig>): void;
+}
+//# sourceMappingURL=AdaptiveStepCalculator.d.ts.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"AdaptiveStepCalculator.d.ts","sourceRoot":"","sources":["../../src/utils/AdaptiveStepCalculator.ts"],"names":[],"mappings":"AAAA;;;;;;;;;GASG;AAEH,OAAO,KAAK,EAAE,YAAY,EAAE,UAAU,EAAE,MAAM,kBAAkB,CAAA;AAChE,OAAO,EAAE,KAAK,EAAE,MAAM,aAAa,CAAA;AAEnC;;GAEG;AACH,MAAM,WAAW,kBAAkB;IACjC,gBAAgB;IAChB,OAAO,EAAE,OAAO,CAAA;IAChB,WAAW;IACX,OAAO,EAAE,MAAM,CAAA;IACf,WAAW;IACX,OAAO,EAAE,MAAM,CAAA;IACf,gBAAgB;IAChB,YAAY,EAAE;QACZ,OAAO,EAAE,OAAO,CAAA;QAChB,4BAA4B;QAC5B,SAAS,EAAE,MAAM,CAAA;KAClB,CAAA;IACD,gBAAgB;IAChB,aAAa,EAAE;QACb,OAAO,EAAE,OAAO,CAAA;QAChB,gBAAgB;QAChB,kBAAkB,EAAE,MAAM,CAAA;QAC1B,gBAAgB;QAChB,iBAAiB,EAAE,MAAM,CAAA;KAC1B,CAAA;CACF;AAED;;GAEG;AACH,eAAO,MAAM,4BAA4B,EAAE,kBAa1C,CAAA;AAED;;GAEG;AACH,qBAAa,sBAAsB;IACjC,OAAO,CAAC,MAAM,CAAoB;gBAEtB,MAAM,GAAE,OAAO,CAAC,kBAAkB,CAAM;IAIpD;;OAEG;IACH,OAAO,CAAC,WAAW;IAiBnB;;;;OAIG;IACH,oBAAoB,CAAC,UAAU,EAAE,UAAU,GAAG,MAAM;IA2BpD;;OAEG;IACH,iBAAiB,CAAC,MAAM,EAAE,KAAK,GAAG;QAAE,CAAC,EAAE,MAAM,CAAC;QAAC,CAAC,EAAE,MAAM,CAAA;KAAE,EAAE,MAAM,EAAE,KAAK,GAAG;QAAE,CAAC,EAAE,MAAM,CAAC;QAAC,CAAC,EAAE,MAAM,CAAA;KAAE,GAAG,MAAM;IAI7G;;OAEG;IACH,0BAA0B,CAAC,QAAQ,EAAE,MAAM,GAAG,MAAM;IAsBpD;;OAEG;IACH,yBAAyB,CAAC,OAAO,EAAE,MAAM,GAAG,MAAM;IAsBlD;;;OAGG;IACH,aAAa,CACX,UAAU,EAAE,YAAY,EACxB,UAAU,EAAE,YAAY,EACxB,UAAU,EAAE,UAAU,GACrB,MAAM;IAyCT;;OAEG;IACH,SAAS,IAAI,kBAAkB;IAI/B;;OAEG;IACH,YAAY,CAAC,MAAM,EAAE,OAAO,CAAC,kBAAkB,CAAC,GAAG,IAAI;CAGxD"}