@alife-sdk/core 0.1.0

package/dist/movement/PatrolRoute.d.ts

@@ -0,0 +1,99 @@
+/**
+ * Route types and tracker for NPC patrol movement.
+ *
+ * Three route types are supported:
+ *   LOOP      -- A->B->C->A->B->C->...  (cyclic, infinite)
+ *   PING_PONG -- A->B->C->B->A->B->...  (reverse at each end, infinite)
+ *   ONE_WAY   -- A->B->C (stop at final waypoint, finite)
+ *
+ * PatrolRoute is a plain data object with zero runtime dependencies.
+ * PatrolRouteTracker is a lightweight stateful cursor over a PatrolRoute.
+ */
+export declare const RouteType: {
+    readonly LOOP: "loop";
+    readonly PING_PONG: "ping_pong";
+    readonly ONE_WAY: "one_way";
+};
+export type RouteType = (typeof RouteType)[keyof typeof RouteType] | (string & {});
+/** A single world-space position in a patrol route. */
+export interface IPatrolWaypoint {
+    readonly x: number;
+    readonly y: number;
+    /** Milliseconds to pause at this waypoint before advancing. */
+    readonly waitTime?: number;
+}
+/**
+ * An ordered sequence of waypoints defining a patrol path.
+ *
+ * PatrolRoute instances are stored on SmartTerrain and shared among all
+ * NPCs assigned to that terrain -- they are treated as immutable. Each NPC
+ * holds its own PatrolRouteTracker (a mutable cursor over the shared route).
+ */
+export interface PatrolRoute {
+    /** Unique route identifier within the terrain. */
+    readonly id: string;
+    /** ID of the SmartTerrain this route belongs to. */
+    readonly terrainId: string;
+    /** Ordered list of world-space positions. Must have at least 1 entry. */
+    readonly waypoints: readonly IPatrolWaypoint[];
+    /** How the NPC cycles through the waypoints. */
+    readonly routeType: RouteType;
+}
+/**
+ * Custom route advancement function.
+ *
+ * Called by PatrolRouteTracker.advance() when a custom advancer is provided.
+ * Should return the new index, direction, and whether the route is completed.
+ */
+export type RouteAdvancer = (currentIndex: number, waypointCount: number, direction: 1 | -1) => {
+    index: number;
+    direction: 1 | -1;
+    completed: boolean;
+};
+/**
+ * Tracks an NPC's position along a PatrolRoute.
+ *
+ * One tracker is created per (NPC, route) pair. The tracker is stored on
+ * the entity in online AI and in offline data structures. Memory footprint
+ * is minimal: three primitive fields plus one object reference.
+ */
+export declare class PatrolRouteTracker {
+    private readonly route;
+    private currentIndex;
+    /** +1 = forward, -1 = backward (used by PING_PONG). */
+    private direction;
+    /** Remaining wait time at current waypoint in milliseconds. */
+    private waitRemaining;
+    /** True when a ONE_WAY route has delivered its final waypoint. */
+    private completed;
+    /** Optional custom advancer that overrides built-in route type logic. */
+    private readonly customAdvancer?;
+    constructor(route: PatrolRoute, customAdvancer?: RouteAdvancer);
+    /** The waypoint the NPC is currently heading toward. */
+    get currentWaypoint(): IPatrolWaypoint;
+    /**
+     * True only for ONE_WAY routes once the final waypoint has been delivered.
+     * Always false for LOOP and PING_PONG routes.
+     */
+    get isComplete(): boolean;
+    /** Total number of waypoints in the underlying route. */
+    get waypointCount(): number;
+    /**
+     * Advance to the next waypoint. Handles LOOP / PING_PONG / ONE_WAY.
+     *
+     * If the current waypoint has a waitTime, the wait timer is initialised.
+     * For ONE_WAY routes that have already completed, this is a no-op.
+     */
+    advance(): void;
+    /**
+     * Tick the wait timer. Returns true when the wait is over (or if there
+     * was no wait to begin with), signalling that the NPC may start moving
+     * to the next waypoint.
+     *
+     * @param deltaMs - Milliseconds elapsed since the last tick.
+     */
+    tickWait(deltaMs: number): boolean;
+    /** Reset the tracker to the first waypoint and clear completion state. */
+    reset(): void;
+}
+//# sourceMappingURL=PatrolRoute.d.ts.map

package/dist/movement/PatrolRoute.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"PatrolRoute.d.ts","sourceRoot":"","sources":["../../src/movement/PatrolRoute.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;GAUG;AAMH,eAAO,MAAM,SAAS;;;;CAIZ,CAAC;AAEX,MAAM,MAAM,SAAS,GAAG,CAAC,OAAO,SAAS,CAAC,CAAC,MAAM,OAAO,SAAS,CAAC,GAAG,CAAC,MAAM,GAAG,EAAE,CAAC,CAAC;AAMnF,uDAAuD;AACvD,MAAM,WAAW,eAAe;IAC9B,QAAQ,CAAC,CAAC,EAAE,MAAM,CAAC;IACnB,QAAQ,CAAC,CAAC,EAAE,MAAM,CAAC;IACnB,+DAA+D;IAC/D,QAAQ,CAAC,QAAQ,CAAC,EAAE,MAAM,CAAC;CAC5B;AAMD;;;;;;GAMG;AACH,MAAM,WAAW,WAAW;IAC1B,kDAAkD;IAClD,QAAQ,CAAC,EAAE,EAAE,MAAM,CAAC;IACpB,oDAAoD;IACpD,QAAQ,CAAC,SAAS,EAAE,MAAM,CAAC;IAC3B,yEAAyE;IACzE,QAAQ,CAAC,SAAS,EAAE,SAAS,eAAe,EAAE,CAAC;IAC/C,gDAAgD;IAChD,QAAQ,CAAC,SAAS,EAAE,SAAS,CAAC;CAC/B;AAMD;;;;;GAKG;AACH,MAAM,MAAM,aAAa,GAAG,CAC1B,YAAY,EAAE,MAAM,EACpB,aAAa,EAAE,MAAM,EACrB,SAAS,EAAE,CAAC,GAAG,CAAC,CAAC,KACd;IAAE,KAAK,EAAE,MAAM,CAAC;IAAC,SAAS,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC;IAAC,SAAS,EAAE,OAAO,CAAA;CAAE,CAAC;AAM9D;;;;;;GAMG;AACH,qBAAa,kBAAkB;IAYjB,OAAO,CAAC,QAAQ,CAAC,KAAK;IAXlC,OAAO,CAAC,YAAY,CAAS;IAC7B,uDAAuD;IACvD,OAAO,CAAC,SAAS,CAAa;IAC9B,+DAA+D;IAC/D,OAAO,CAAC,aAAa,CAAK;IAC1B,kEAAkE;IAClE,OAAO,CAAC,SAAS,CAAS;IAC1B,yEAAyE;IACzE,OAAO,CAAC,QAAQ,CAAC,cAAc,CAAC,CAAgB;gBAEpC,KAAK,EAAE,WAAW,EAAE,cAAc,CAAC,EAAE,aAAa;IAU9D,wDAAwD;IACxD,IAAI,eAAe,IAAI,eAAe,CAErC;IAED;;;OAGG;IACH,IAAI,UAAU,IAAI,OAAO,CAExB;IAED,yDAAyD;IACzD,IAAI,aAAa,IAAI,MAAM,CAE1B;IAMD;;;;;OAKG;IACH,OAAO,IAAI,IAAI;IAqDf;;;;;;OAMG;IACH,QAAQ,CAAC,OAAO,EAAE,MAAM,GAAG,OAAO;IAOlC,0EAA0E;IAC1E,KAAK,IAAI,IAAI;CAMd"}

package/dist/movement/PatrolRoute.js

@@ -0,0 +1,141 @@
+/**
+ * Route types and tracker for NPC patrol movement.
+ *
+ * Three route types are supported:
+ *   LOOP      -- A->B->C->A->B->C->...  (cyclic, infinite)
+ *   PING_PONG -- A->B->C->B->A->B->...  (reverse at each end, infinite)
+ *   ONE_WAY   -- A->B->C (stop at final waypoint, finite)
+ *
+ * PatrolRoute is a plain data object with zero runtime dependencies.
+ * PatrolRouteTracker is a lightweight stateful cursor over a PatrolRoute.
+ */
+// ---------------------------------------------------------------------------
+// Route type
+// ---------------------------------------------------------------------------
+export const RouteType = {
+    LOOP: 'loop',
+    PING_PONG: 'ping_pong',
+    ONE_WAY: 'one_way',
+};
+// ---------------------------------------------------------------------------
+// PatrolRouteTracker (stateful cursor)
+// ---------------------------------------------------------------------------
+/**
+ * Tracks an NPC's position along a PatrolRoute.
+ *
+ * One tracker is created per (NPC, route) pair. The tracker is stored on
+ * the entity in online AI and in offline data structures. Memory footprint
+ * is minimal: three primitive fields plus one object reference.
+ */
+export class PatrolRouteTracker {
+    constructor(route, customAdvancer) {
+        this.route = route;
+        /** +1 = forward, -1 = backward (used by PING_PONG). */
+        this.direction = 1;
+        /** Remaining wait time at current waypoint in milliseconds. */
+        this.waitRemaining = 0;
+        /** True when a ONE_WAY route has delivered its final waypoint. */
+        this.completed = false;
+        this.currentIndex = 0;
+        this.customAdvancer = customAdvancer;
+    }
+    // -----------------------------------------------------------------------
+    // Accessors
+    // -----------------------------------------------------------------------
+    /** The waypoint the NPC is currently heading toward. */
+    get currentWaypoint() {
+        return this.route.waypoints[this.currentIndex];
+    }
+    /**
+     * True only for ONE_WAY routes once the final waypoint has been delivered.
+     * Always false for LOOP and PING_PONG routes.
+     */
+    get isComplete() {
+        return this.completed;
+    }
+    /** Total number of waypoints in the underlying route. */
+    get waypointCount() {
+        return this.route.waypoints.length;
+    }
+    // -----------------------------------------------------------------------
+    // Mutation API
+    // -----------------------------------------------------------------------
+    /**
+     * Advance to the next waypoint. Handles LOOP / PING_PONG / ONE_WAY.
+     *
+     * If the current waypoint has a waitTime, the wait timer is initialised.
+     * For ONE_WAY routes that have already completed, this is a no-op.
+     */
+    advance() {
+        if (this.completed)
+            return;
+        const len = this.route.waypoints.length;
+        if (len <= 1) {
+            if (this.route.routeType === RouteType.ONE_WAY) {
+                this.completed = true;
+            }
+            return;
+        }
+        if (this.customAdvancer) {
+            const result = this.customAdvancer(this.currentIndex, len, this.direction);
+            this.currentIndex = Math.max(0, Math.min(result.index, len - 1));
+            this.direction = result.direction;
+            this.completed = result.completed;
+        }
+        else {
+            switch (this.route.routeType) {
+                case RouteType.LOOP:
+                    this.currentIndex = (this.currentIndex + 1) % len;
+                    break;
+                case RouteType.PING_PONG: {
+                    const next = this.currentIndex + this.direction;
+                    if (next >= len) {
+                        this.direction = -1;
+                        this.currentIndex = len - 2;
+                    }
+                    else if (next < 0) {
+                        this.direction = 1;
+                        this.currentIndex = 1;
+                    }
+                    else {
+                        this.currentIndex = next;
+                    }
+                    break;
+                }
+                case RouteType.ONE_WAY:
+                    if (this.currentIndex < len - 1) {
+                        this.currentIndex += 1;
+                    }
+                    else {
+                        this.completed = true;
+                    }
+                    break;
+            }
+        }
+        const wp = this.route.waypoints[this.currentIndex];
+        if (wp.waitTime !== undefined && wp.waitTime > 0) {
+            this.waitRemaining = wp.waitTime;
+        }
+    }
+    /**
+     * Tick the wait timer. Returns true when the wait is over (or if there
+     * was no wait to begin with), signalling that the NPC may start moving
+     * to the next waypoint.
+     *
+     * @param deltaMs - Milliseconds elapsed since the last tick.
+     */
+    tickWait(deltaMs) {
+        if (this.waitRemaining <= 0)
+            return true;
+        this.waitRemaining -= deltaMs;
+        return this.waitRemaining <= 0;
+    }
+    /** Reset the tracker to the first waypoint and clear completion state. */
+    reset() {
+        this.currentIndex = 0;
+        this.direction = 1;
+        this.waitRemaining = 0;
+        this.completed = false;
+    }
+}
+//# sourceMappingURL=PatrolRoute.js.map

package/dist/movement/PatrolRoute.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"PatrolRoute.js","sourceRoot":"","sources":["../../src/movement/PatrolRoute.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;GAUG;AAEH,8EAA8E;AAC9E,aAAa;AACb,8EAA8E;AAE9E,MAAM,CAAC,MAAM,SAAS,GAAG;IACvB,IAAI,EAAE,MAAM;IACZ,SAAS,EAAE,WAAW;IACtB,OAAO,EAAE,SAAS;CACV,CAAC;AAsDX,8EAA8E;AAC9E,uCAAuC;AACvC,8EAA8E;AAE9E;;;;;;GAMG;AACH,MAAM,OAAO,kBAAkB;IAY7B,YAA6B,KAAkB,EAAE,cAA8B;QAAlD,UAAK,GAAL,KAAK,CAAa;QAV/C,uDAAuD;QAC/C,cAAS,GAAW,CAAC,CAAC;QAC9B,+DAA+D;QACvD,kBAAa,GAAG,CAAC,CAAC;QAC1B,kEAAkE;QAC1D,cAAS,GAAG,KAAK,CAAC;QAMxB,IAAI,CAAC,YAAY,GAAG,CAAC,CAAC;QACtB,IAAI,CAAC,cAAc,GAAG,cAAc,CAAC;IACvC,CAAC;IAED,0EAA0E;IAC1E,YAAY;IACZ,0EAA0E;IAE1E,wDAAwD;IACxD,IAAI,eAAe;QACjB,OAAO,IAAI,CAAC,KAAK,CAAC,SAAS,CAAC,IAAI,CAAC,YAAY,CAAC,CAAC;IACjD,CAAC;IAED;;;OAGG;IACH,IAAI,UAAU;QACZ,OAAO,IAAI,CAAC,SAAS,CAAC;IACxB,CAAC;IAED,yDAAyD;IACzD,IAAI,aAAa;QACf,OAAO,IAAI,CAAC,KAAK,CAAC,SAAS,CAAC,MAAM,CAAC;IACrC,CAAC;IAED,0EAA0E;IAC1E,eAAe;IACf,0EAA0E;IAE1E;;;;;OAKG;IACH,OAAO;QACL,IAAI,IAAI,CAAC,SAAS;YAAE,OAAO;QAE3B,MAAM,GAAG,GAAG,IAAI,CAAC,KAAK,CAAC,SAAS,CAAC,MAAM,CAAC;QAExC,IAAI,GAAG,IAAI,CAAC,EAAE,CAAC;YACb,IAAI,IAAI,CAAC,KAAK,CAAC,SAAS,KAAK,SAAS,CAAC,OAAO,EAAE,CAAC;gBAC/C,IAAI,CAAC,SAAS,GAAG,IAAI,CAAC;YACxB,CAAC;YACD,OAAO;QACT,CAAC;QAED,IAAI,IAAI,CAAC,cAAc,EAAE,CAAC;YACxB,MAAM,MAAM,GAAG,IAAI,CAAC,cAAc,CAAC,IAAI,CAAC,YAAY,EAAE,GAAG,EAAE,IAAI,CAAC,SAAS,CAAC,CAAC;YAC3E,IAAI,CAAC,YAAY,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,GAAG,CAAC,MAAM,CAAC,KAAK,EAAE,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC;YACjE,IAAI,CAAC,SAAS,GAAG,MAAM,CAAC,SAAS,CAAC;YAClC,IAAI,CAAC,SAAS,GAAG,MAAM,CAAC,SAAS,CAAC;QACpC,CAAC;aAAM,CAAC;YACN,QAAQ,IAAI,CAAC,KAAK,CAAC,SAAS,EAAE,CAAC;gBAC7B,KAAK,SAAS,CAAC,IAAI;oBACjB,IAAI,CAAC,YAAY,GAAG,CAAC,IAAI,CAAC,YAAY,GAAG,CAAC,CAAC,GAAG,GAAG,CAAC;oBAClD,MAAM;gBAER,KAAK,SAAS,CAAC,SAAS,CAAC,CAAC,CAAC;oBACzB,MAAM,IAAI,GAAG,IAAI,CAAC,YAAY,GAAG,IAAI,CAAC,SAAS,CAAC;oBAChD,IAAI,IAAI,IAAI,GAAG,EAAE,CAAC;wBAChB,IAAI,CAAC,SAAS,GAAG,CAAC,CAAC,CAAC;wBACpB,IAAI,CAAC,YAAY,GAAG,GAAG,GAAG,CAAC,CAAC;oBAC9B,CAAC;yBAAM,IAAI,IAAI,GAAG,CAAC,EAAE,CAAC;wBACpB,IAAI,CAAC,SAAS,GAAG,CAAC,CAAC;wBACnB,IAAI,CAAC,YAAY,GAAG,CAAC,CAAC;oBACxB,CAAC;yBAAM,CAAC;wBACN,IAAI,CAAC,YAAY,GAAG,IAAI,CAAC;oBAC3B,CAAC;oBACD,MAAM;gBACR,CAAC;gBAED,KAAK,SAAS,CAAC,OAAO;oBACpB,IAAI,IAAI,CAAC,YAAY,GAAG,GAAG,GAAG,CAAC,EAAE,CAAC;wBAChC,IAAI,CAAC,YAAY,IAAI,CAAC,CAAC;oBACzB,CAAC;yBAAM,CAAC;wBACN,IAAI,CAAC,SAAS,GAAG,IAAI,CAAC;oBACxB,CAAC;oBACD,MAAM;YACV,CAAC;QACH,CAAC;QAED,MAAM,EAAE,GAAG,IAAI,CAAC,KAAK,CAAC,SAAS,CAAC,IAAI,CAAC,YAAY,CAAC,CAAC;QACnD,IAAI,EAAE,CAAC,QAAQ,KAAK,SAAS,IAAI,EAAE,CAAC,QAAQ,GAAG,CAAC,EAAE,CAAC;YACjD,IAAI,CAAC,aAAa,GAAG,EAAE,CAAC,QAAQ,CAAC;QACnC,CAAC;IACH,CAAC;IAED;;;;;;OAMG;IACH,QAAQ,CAAC,OAAe;QACtB,IAAI,IAAI,CAAC,aAAa,IAAI,CAAC;YAAE,OAAO,IAAI,CAAC;QAEzC,IAAI,CAAC,aAAa,IAAI,OAAO,CAAC;QAC9B,OAAO,IAAI,CAAC,aAAa,IAAI,CAAC,CAAC;IACjC,CAAC;IAED,0EAA0E;IAC1E,KAAK;QACH,IAAI,CAAC,YAAY,GAAG,CAAC,CAAC;QACtB,IAAI,CAAC,SAAS,GAAG,CAAC,CAAC;QACnB,IAAI,CAAC,aAAa,GAAG,CAAC,CAAC;QACvB,IAAI,CAAC,SAAS,GAAG,KAAK,CAAC;IACzB,CAAC;CACF"}

package/dist/movement/index.d.ts

@@ -0,0 +1,5 @@
+export { PatrolRouteTracker, RouteType } from './PatrolRoute';
+export type { PatrolRoute, RouteAdvancer } from './PatrolRoute';
+export { MonsterHome } from './MonsterHome';
+export type { ILairConfig } from './MonsterHome';
+//# sourceMappingURL=index.d.ts.map

package/dist/movement/index.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../src/movement/index.ts"],"names":[],"mappings":"AACA,OAAO,EAAE,kBAAkB,EAAE,SAAS,EAAE,MAAM,eAAe,CAAC;AAC9D,YAAY,EAAE,WAAW,EAAE,aAAa,EAAE,MAAM,eAAe,CAAC;AAChE,OAAO,EAAE,WAAW,EAAE,MAAM,eAAe,CAAC;AAC5C,YAAY,EAAE,WAAW,EAAE,MAAM,eAAe,CAAC"}

package/dist/movement/index.js

@@ -0,0 +1,4 @@
+// movement sub-path barrel
+export { PatrolRouteTracker, RouteType } from './PatrolRoute';
+export { MonsterHome } from './MonsterHome';
+//# sourceMappingURL=index.js.map

package/dist/movement/index.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.js","sourceRoot":"","sources":["../../src/movement/index.ts"],"names":[],"mappings":"AAAA,2BAA2B;AAC3B,OAAO,EAAE,kBAAkB,EAAE,SAAS,EAAE,MAAM,eAAe,CAAC;AAE9D,OAAO,EAAE,WAAW,EAAE,MAAM,eAAe,CAAC"}

package/dist/navigation/LevelGraph.d.ts

@@ -0,0 +1,78 @@
+export interface IGraphVertex {
+    readonly id: string;
+    readonly x: number;
+    readonly y: number;
+    /** Terrain/location tags for path filtering (e.g. 'outdoor', 'indoor', 'danger') */
+    readonly tags: ReadonlyArray<string>;
+}
+export interface IGraphEdge {
+    readonly to: string;
+    readonly weight: number;
+}
+export interface ILevelGraphState {
+    vertices: Array<{
+        id: string;
+        x: number;
+        y: number;
+        tags: string[];
+    }>;
+    edges: Array<{
+        from: string;
+        edges: Array<{
+            to: string;
+            weight: number;
+        }>;
+    }>;
+}
+/** Predicate to filter which vertices an NPC can traverse */
+export type TerrainFilter = (vertex: IGraphVertex) => boolean;
+export declare class LevelGraph {
+    private readonly _vertices;
+    private readonly _edges;
+    /** Add a vertex. Overwrites if ID already exists. */
+    addVertex(id: string, x: number, y: number, tags?: string[]): this;
+    /** Add a directed edge from → to. Weight defaults to Euclidean distance. */
+    addEdge(from: string, to: string, weight?: number): this;
+    /** Add an undirected edge (both directions). */
+    addUndirectedEdge(a: string, b: string, weight?: number): this;
+    getVertex(id: string): IGraphVertex | undefined;
+    getEdges(fromId: string): ReadonlyArray<IGraphEdge>;
+    get vertexCount(): number;
+    get edgeCount(): number;
+    /** Check if a vertex exists. */
+    hasVertex(id: string): boolean;
+    /** Returns all vertex IDs. */
+    vertexIds(): IterableIterator<string>;
+    /** Returns an iterator over all IGraphVertex values. */
+    vertices(): IterableIterator<IGraphVertex>;
+    /** Remove a vertex, all its outgoing edges, and all incoming edges from other vertices. */
+    removeVertex(id: string): this;
+    /**
+     * A* pathfinding using a binary min-heap for O(log n) open-set operations.
+     *
+     * Returns an array of vertex IDs from start to goal (inclusive), or null
+     * if no path exists.
+     *
+     * @param filter - Optional predicate; vertices returning false are skipped.
+     *   The start and goal vertices are never filtered out.
+     */
+    findPath(startId: string, goalId: string, filter?: TerrainFilter): string[] | null;
+    /**
+     * Linear interpolation of world position along an edge.
+     * t = 0 → fromVertex position, t = 1 → toVertex position.
+     */
+    interpolatePosition(fromId: string, toId: string, t: number): {
+        x: number;
+        y: number;
+    };
+    /**
+     * Get edge weight between two directly connected vertices.
+     * Returns Infinity if no direct edge exists.
+     */
+    edgeWeight(fromId: string, toId: string): number;
+    /** Serialize graph state for save/load. */
+    serialize(): ILevelGraphState;
+    /** Restore a LevelGraph from serialized state (skips weight recalculation). */
+    static restore(state: ILevelGraphState): LevelGraph;
+}
+//# sourceMappingURL=LevelGraph.d.ts.map

package/dist/navigation/LevelGraph.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"LevelGraph.d.ts","sourceRoot":"","sources":["../../src/navigation/LevelGraph.ts"],"names":[],"mappings":"AAOA,MAAM,WAAW,YAAY;IAC3B,QAAQ,CAAC,EAAE,EAAE,MAAM,CAAC;IACpB,QAAQ,CAAC,CAAC,EAAE,MAAM,CAAC;IACnB,QAAQ,CAAC,CAAC,EAAE,MAAM,CAAC;IACnB,oFAAoF;IACpF,QAAQ,CAAC,IAAI,EAAE,aAAa,CAAC,MAAM,CAAC,CAAC;CACtC;AAED,MAAM,WAAW,UAAU;IACzB,QAAQ,CAAC,EAAE,EAAE,MAAM,CAAC;IACpB,QAAQ,CAAC,MAAM,EAAE,MAAM,CAAC;CACzB;AAMD,MAAM,WAAW,gBAAgB;IAC/B,QAAQ,EAAE,KAAK,CAAC;QAAE,EAAE,EAAE,MAAM,CAAC;QAAC,CAAC,EAAE,MAAM,CAAC;QAAC,CAAC,EAAE,MAAM,CAAC;QAAC,IAAI,EAAE,MAAM,EAAE,CAAA;KAAE,CAAC,CAAC;IACtE,KAAK,EAAE,KAAK,CAAC;QAAE,IAAI,EAAE,MAAM,CAAC;QAAC,KAAK,EAAE,KAAK,CAAC;YAAE,EAAE,EAAE,MAAM,CAAC;YAAC,MAAM,EAAE,MAAM,CAAA;SAAE,CAAC,CAAA;KAAE,CAAC,CAAC;CAC9E;AAED,6DAA6D;AAC7D,MAAM,MAAM,aAAa,GAAG,CAAC,MAAM,EAAE,YAAY,KAAK,OAAO,CAAC;AAiE9D,qBAAa,UAAU;IACrB,OAAO,CAAC,QAAQ,CAAC,SAAS,CAAmC;IAC7D,OAAO,CAAC,QAAQ,CAAC,MAAM,CAAsC;IAM7D,qDAAqD;IACrD,SAAS,CAAC,EAAE,EAAE,MAAM,EAAE,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,MAAM,EAAE,IAAI,GAAE,MAAM,EAAO,GAAG,IAAI;IAMtE,4EAA4E;IAC5E,OAAO,CAAC,IAAI,EAAE,MAAM,EAAE,EAAE,EAAE,MAAM,EAAE,MAAM,CAAC,EAAE,MAAM,GAAG,IAAI;IASxD,gDAAgD;IAChD,iBAAiB,CAAC,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,MAAM,EAAE,MAAM,CAAC,EAAE,MAAM,GAAG,IAAI;IAU9D,SAAS,CAAC,EAAE,EAAE,MAAM,GAAG,YAAY,GAAG,SAAS;IAI/C,QAAQ,CAAC,MAAM,EAAE,MAAM,GAAG,aAAa,CAAC,UAAU,CAAC;IAInD,IAAI,WAAW,IAAI,MAAM,CAAgC;IAEzD,IAAI,SAAS,IAAI,MAAM,CAItB;IAED,gCAAgC;IAChC,SAAS,CAAC,EAAE,EAAE,MAAM,GAAG,OAAO;IAI9B,8BAA8B;IAC9B,SAAS,IAAI,gBAAgB,CAAC,MAAM,CAAC;IAIrC,wDAAwD;IACxD,QAAQ,IAAI,gBAAgB,CAAC,YAAY,CAAC;IAQ1C,2FAA2F;IAC3F,YAAY,CAAC,EAAE,EAAE,MAAM,GAAG,IAAI;IAgB9B;;;;;;;;OAQG;IACH,QAAQ,CAAC,OAAO,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,CAAC,EAAE,aAAa,GAAG,MAAM,EAAE,GAAG,IAAI;IAoElF;;;OAGG;IACH,mBAAmB,CAAC,MAAM,EAAE,MAAM,EAAE,IAAI,EAAE,MAAM,EAAE,CAAC,EAAE,MAAM,GAAG;QAAE,CAAC,EAAE,MAAM,CAAC;QAAC,CAAC,EAAE,MAAM,CAAA;KAAE;IAWtF;;;OAGG;IACH,UAAU,CAAC,MAAM,EAAE,MAAM,EAAE,IAAI,EAAE,MAAM,GAAG,MAAM;IAWhD,2CAA2C;IAC3C,SAAS,IAAI,gBAAgB;IAe7B,+EAA+E;IAC/E,MAAM,CAAC,OAAO,CAAC,KAAK,EAAE,gBAAgB,GAAG,UAAU;CAepD"}

package/dist/navigation/LevelGraph.js

@@ -0,0 +1,268 @@
+// navigation/LevelGraph.ts
+// Abstract 2D waypoint graph for offline NPC navigation.
+//
+// Vertices = named waypoints with (x, y) position and optional terrain tags.
+// Edges    = directed connections with distance weight.
+// Path     = A* search returning array of vertex IDs.
+/** Compact binary min-heap over HeapEntry sorted by f score. */
+class MinHeap {
+    constructor() {
+        this.data = [];
+    }
+    get size() { return this.data.length; }
+    push(entry) {
+        this.data.push(entry);
+        this._bubbleUp(this.data.length - 1);
+    }
+    pop() {
+        if (this.data.length === 0)
+            return undefined;
+        const top = this.data[0];
+        const last = this.data.pop();
+        if (this.data.length > 0) {
+            this.data[0] = last;
+            this._sinkDown(0);
+        }
+        return top;
+    }
+    _bubbleUp(i) {
+        while (i > 0) {
+            const parent = (i - 1) >> 1;
+            if (this.data[parent].f <= this.data[i].f)
+                break;
+            const tmp = this.data[parent];
+            this.data[parent] = this.data[i];
+            this.data[i] = tmp;
+            i = parent;
+        }
+    }
+    _sinkDown(i) {
+        const n = this.data.length;
+        for (;;) {
+            let smallest = i;
+            const l = 2 * i + 1;
+            const r = 2 * i + 2;
+            if (l < n && this.data[l].f < this.data[smallest].f)
+                smallest = l;
+            if (r < n && this.data[r].f < this.data[smallest].f)
+                smallest = r;
+            if (smallest === i)
+                break;
+            const tmp = this.data[smallest];
+            this.data[smallest] = this.data[i];
+            this.data[i] = tmp;
+            i = smallest;
+        }
+    }
+}
+// ---------------------------------------------------------------------------
+// LevelGraph
+// ---------------------------------------------------------------------------
+export class LevelGraph {
+    constructor() {
+        this._vertices = new Map();
+        this._edges = new Map();
+    }
+    // -------------------------------------------------------------------------
+    // Graph construction
+    // -------------------------------------------------------------------------
+    /** Add a vertex. Overwrites if ID already exists. */
+    addVertex(id, x, y, tags = []) {
+        this._vertices.set(id, { id, x, y, tags });
+        if (!this._edges.has(id))
+            this._edges.set(id, []);
+        return this;
+    }
+    /** Add a directed edge from → to. Weight defaults to Euclidean distance. */
+    addEdge(from, to, weight) {
+        const src = this._vertices.get(from);
+        const dst = this._vertices.get(to);
+        if (!src || !dst)
+            return this;
+        const w = weight ?? Math.sqrt((dst.x - src.x) ** 2 + (dst.y - src.y) ** 2);
+        this._edges.get(from).push({ to, weight: w });
+        return this;
+    }
+    /** Add an undirected edge (both directions). */
+    addUndirectedEdge(a, b, weight) {
+        this.addEdge(a, b, weight);
+        this.addEdge(b, a, weight);
+        return this;
+    }
+    // -------------------------------------------------------------------------
+    // Accessors
+    // -------------------------------------------------------------------------
+    getVertex(id) {
+        return this._vertices.get(id);
+    }
+    getEdges(fromId) {
+        return this._edges.get(fromId) ?? [];
+    }
+    get vertexCount() { return this._vertices.size; }
+    get edgeCount() {
+        let n = 0;
+        for (const edges of this._edges.values())
+            n += edges.length;
+        return n;
+    }
+    /** Check if a vertex exists. */
+    hasVertex(id) {
+        return this._vertices.has(id);
+    }
+    /** Returns all vertex IDs. */
+    vertexIds() {
+        return this._vertices.keys();
+    }
+    /** Returns an iterator over all IGraphVertex values. */
+    vertices() {
+        return this._vertices.values();
+    }
+    // -------------------------------------------------------------------------
+    // Mutation
+    // -------------------------------------------------------------------------
+    /** Remove a vertex, all its outgoing edges, and all incoming edges from other vertices. */
+    removeVertex(id) {
+        this._vertices.delete(id);
+        this._edges.delete(id);
+        // Remove all incoming edges pointing to `id`
+        for (const edges of this._edges.values()) {
+            for (let i = edges.length - 1; i >= 0; i--) {
+                if (edges[i].to === id)
+                    edges.splice(i, 1);
+            }
+        }
+        return this;
+    }
+    // -------------------------------------------------------------------------
+    // Pathfinding
+    // -------------------------------------------------------------------------
+    /**
+     * A* pathfinding using a binary min-heap for O(log n) open-set operations.
+     *
+     * Returns an array of vertex IDs from start to goal (inclusive), or null
+     * if no path exists.
+     *
+     * @param filter - Optional predicate; vertices returning false are skipped.
+     *   The start and goal vertices are never filtered out.
+     */
+    findPath(startId, goalId, filter) {
+        if (startId === goalId)
+            return [startId];
+        if (!this._vertices.has(startId) || !this._vertices.has(goalId))
+            return null;
+        const goal = this._vertices.get(goalId);
+        const heuristic = (id) => {
+            const v = this._vertices.get(id);
+            const dx = v.x - goal.x;
+            const dy = v.y - goal.y;
+            return Math.sqrt(dx * dx + dy * dy);
+        };
+        const gScore = new Map();
+        const cameFrom = new Map();
+        const closedSet = new Set();
+        const heap = new MinHeap();
+        gScore.set(startId, 0);
+        heap.push({ id: startId, f: heuristic(startId) });
+        while (heap.size > 0) {
+            const { id: current } = heap.pop();
+            if (current === goalId) {
+                // Reconstruct path — push+reverse is O(n) vs unshift which is O(n²)
+                const path = [];
+                let node = goalId;
+                while (node !== undefined) {
+                    path.push(node);
+                    node = cameFrom.get(node);
+                }
+                path.reverse();
+                return path;
+            }
+            if (closedSet.has(current))
+                continue;
+            closedSet.add(current);
+            const edges = this._edges.get(current);
+            if (!edges)
+                continue;
+            for (const edge of edges) {
+                if (closedSet.has(edge.to))
+                    continue;
+                const dst = this._vertices.get(edge.to);
+                if (!dst)
+                    continue;
+                // Start and goal are never filtered
+                if (filter && edge.to !== goalId && !filter(dst))
+                    continue;
+                const tentativeG = (gScore.get(current) ?? Infinity) + edge.weight;
+                if (tentativeG < (gScore.get(edge.to) ?? Infinity)) {
+                    cameFrom.set(edge.to, current);
+                    gScore.set(edge.to, tentativeG);
+                    heap.push({ id: edge.to, f: tentativeG + heuristic(edge.to) });
+                }
+            }
+        }
+        return null; // No path found
+    }
+    // -------------------------------------------------------------------------
+    // Geometry helpers
+    // -------------------------------------------------------------------------
+    /**
+     * Linear interpolation of world position along an edge.
+     * t = 0 → fromVertex position, t = 1 → toVertex position.
+     */
+    interpolatePosition(fromId, toId, t) {
+        const from = this._vertices.get(fromId);
+        const to = this._vertices.get(toId);
+        if (!from || !to)
+            return { x: 0, y: 0 };
+        const clamped = Math.max(0, Math.min(1, t));
+        return {
+            x: from.x + (to.x - from.x) * clamped,
+            y: from.y + (to.y - from.y) * clamped,
+        };
+    }
+    /**
+     * Get edge weight between two directly connected vertices.
+     * Returns Infinity if no direct edge exists.
+     */
+    edgeWeight(fromId, toId) {
+        const edges = this._edges.get(fromId);
+        if (!edges)
+            return Infinity;
+        const edge = edges.find(e => e.to === toId);
+        return edge?.weight ?? Infinity;
+    }
+    // -------------------------------------------------------------------------
+    // Serialization
+    // -------------------------------------------------------------------------
+    /** Serialize graph state for save/load. */
+    serialize() {
+        return {
+            vertices: Array.from(this._vertices.values()).map(v => ({
+                id: v.id,
+                x: v.x,
+                y: v.y,
+                tags: [...v.tags],
+            })),
+            edges: Array.from(this._edges.entries()).map(([from, edges]) => ({
+                from,
+                edges: edges.map(e => ({ to: e.to, weight: e.weight })),
+            })),
+        };
+    }
+    /** Restore a LevelGraph from serialized state (skips weight recalculation). */
+    static restore(state) {
+        const graph = new LevelGraph();
+        for (const v of state.vertices) {
+            graph.addVertex(v.id, v.x, v.y, [...v.tags]);
+        }
+        for (const { from, edges } of state.edges) {
+            const list = graph._edges.get(from);
+            if (list) {
+                for (const e of edges) {
+                    list.push({ to: e.to, weight: e.weight });
+                }
+            }
+        }
+        return graph;
+    }
+}
+//# sourceMappingURL=LevelGraph.js.map

package/dist/navigation/LevelGraph.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"LevelGraph.js","sourceRoot":"","sources":["../../src/navigation/LevelGraph.ts"],"names":[],"mappings":"AAAA,2BAA2B;AAC3B,yDAAyD;AACzD,EAAE;AACF,6EAA6E;AAC7E,wDAAwD;AACxD,sDAAsD;AAoCtD,gEAAgE;AAChE,MAAM,OAAO;IAAb;QACmB,SAAI,GAAgB,EAAE,CAAC;IA8C1C,CAAC;IA5CC,IAAI,IAAI,KAAa,OAAO,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC;IAE/C,IAAI,CAAC,KAAgB;QACnB,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QACtB,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;IACvC,CAAC;IAED,GAAG;QACD,IAAI,IAAI,CAAC,IAAI,CAAC,MAAM,KAAK,CAAC;YAAE,OAAO,SAAS,CAAC;QAC7C,MAAM,GAAG,GAAG,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACzB,MAAM,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC,GAAG,EAAG,CAAC;QAC9B,IAAI,IAAI,CAAC,IAAI,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YACzB,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC;YACpB,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC;QACpB,CAAC;QACD,OAAO,GAAG,CAAC;IACb,CAAC;IAEO,SAAS,CAAC,CAAS;QACzB,OAAO,CAAC,GAAG,CAAC,EAAE,CAAC;YACb,MAAM,MAAM,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC;YAC5B,IAAI,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,IAAI,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC;gBAAE,MAAM;YACjD,MAAM,GAAG,GAAG,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;YAC9B,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YACjC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,GAAG,GAAG,CAAC;YACnB,CAAC,GAAG,MAAM,CAAC;QACb,CAAC;IACH,CAAC;IAEO,SAAS,CAAC,CAAS;QACzB,MAAM,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC;QAC3B,SAAS,CAAC;YACR,IAAI,QAAQ,GAAG,CAAC,CAAC;YACjB,MAAM,CAAC,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;YACpB,MAAM,CAAC,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;YACpB,IAAI,CAAC,GAAG,CAAC,IAAI,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC;gBAAE,QAAQ,GAAG,CAAC,CAAC;YAClE,IAAI,CAAC,GAAG,CAAC,IAAI,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC;gBAAE,QAAQ,GAAG,CAAC,CAAC;YAClE,IAAI,QAAQ,KAAK,CAAC;gBAAE,MAAM;YAC1B,MAAM,GAAG,GAAG,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;YAChC,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YACnC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,GAAG,GAAG,CAAC;YACnB,CAAC,GAAG,QAAQ,CAAC;QACf,CAAC;IACH,CAAC;CACF;AAED,8EAA8E;AAC9E,aAAa;AACb,8EAA8E;AAE9E,MAAM,OAAO,UAAU;IAAvB;QACmB,cAAS,GAAG,IAAI,GAAG,EAAwB,CAAC;QAC5C,WAAM,GAAM,IAAI,GAAG,EAAwB,CAAC;IAiO/D,CAAC;IA/NC,4EAA4E;IAC5E,qBAAqB;IACrB,4EAA4E;IAE5E,qDAAqD;IACrD,SAAS,CAAC,EAAU,EAAE,CAAS,EAAE,CAAS,EAAE,OAAiB,EAAE;QAC7D,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,CAAC,EAAE,CAAC,EAAE,IAAI,EAAE,CAAC,CAAC;QAC3C,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,EAAE,CAAC;YAAE,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC;QAClD,OAAO,IAAI,CAAC;IACd,CAAC;IAED,4EAA4E;IAC5E,OAAO,CAAC,IAAY,EAAE,EAAU,EAAE,MAAe;QAC/C,MAAM,GAAG,GAAG,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;QACrC,MAAM,GAAG,GAAG,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;QACnC,IAAI,CAAC,GAAG,IAAI,CAAC,GAAG;YAAE,OAAO,IAAI,CAAC;QAC9B,MAAM,CAAC,GAAG,MAAM,IAAI,IAAI,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,GAAG,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC;QAC3E,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,IAAI,CAAE,CAAC,IAAI,CAAC,EAAE,EAAE,EAAE,MAAM,EAAE,CAAC,EAAE,CAAC,CAAC;QAC/C,OAAO,IAAI,CAAC;IACd,CAAC;IAED,gDAAgD;IAChD,iBAAiB,CAAC,CAAS,EAAE,CAAS,EAAE,MAAe;QACrD,IAAI,CAAC,OAAO,CAAC,CAAC,EAAE,CAAC,EAAE,MAAM,CAAC,CAAC;QAC3B,IAAI,CAAC,OAAO,CAAC,CAAC,EAAE,CAAC,EAAE,MAAM,CAAC,CAAC;QAC3B,OAAO,IAAI,CAAC;IACd,CAAC;IAED,4EAA4E;IAC5E,YAAY;IACZ,4EAA4E;IAE5E,SAAS,CAAC,EAAU;QAClB,OAAO,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;IAChC,CAAC;IAED,QAAQ,CAAC,MAAc;QACrB,OAAO,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,MAAM,CAAC,IAAI,EAAE,CAAC;IACvC,CAAC;IAED,IAAI,WAAW,KAAa,OAAO,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,CAAC,CAAC;IAEzD,IAAI,SAAS;QACX,IAAI,CAAC,GAAG,CAAC,CAAC;QACV,KAAK,MAAM,KAAK,IAAI,IAAI,CAAC,MAAM,CAAC,MAAM,EAAE;YAAE,CAAC,IAAI,KAAK,CAAC,MAAM,CAAC;QAC5D,OAAO,CAAC,CAAC;IACX,CAAC;IAED,gCAAgC;IAChC,SAAS,CAAC,EAAU;QAClB,OAAO,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;IAChC,CAAC;IAED,8BAA8B;IAC9B,SAAS;QACP,OAAO,IAAI,CAAC,SAAS,CAAC,IAAI,EAAE,CAAC;IAC/B,CAAC;IAED,wDAAwD;IACxD,QAAQ;QACN,OAAO,IAAI,CAAC,SAAS,CAAC,MAAM,EAAE,CAAC;IACjC,CAAC;IAED,4EAA4E;IAC5E,WAAW;IACX,4EAA4E;IAE5E,2FAA2F;IAC3F,YAAY,CAAC,EAAU;QACrB,IAAI,CAAC,SAAS,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC;QAC1B,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC;QACvB,6CAA6C;QAC7C,KAAK,MAAM,KAAK,IAAI,IAAI,CAAC,MAAM,CAAC,MAAM,EAAE,EAAE,CAAC;YACzC,KAAK,IAAI,CAAC,GAAG,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;gBAC3C,IAAI,KAAK,CAAC,CAAC,CAAC,CAAC,EAAE,KAAK,EAAE;oBAAE,KAAK,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;YAC7C,CAAC;QACH,CAAC;QACD,OAAO,IAAI,CAAC;IACd,CAAC;IAED,4EAA4E;IAC5E,cAAc;IACd,4EAA4E;IAE5E;;;;;;;;OAQG;IACH,QAAQ,CAAC,OAAe,EAAE,MAAc,EAAE,MAAsB;QAC9D,IAAI,OAAO,KAAK,MAAM;YAAE,OAAO,CAAC,OAAO,CAAC,CAAC;QACzC,IAAI,CAAC,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,MAAM,CAAC;YAAE,OAAO,IAAI,CAAC;QAE7E,MAAM,IAAI,GAAG,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,MAAM,CAAE,CAAC;QAEzC,MAAM,SAAS,GAAG,CAAC,EAAU,EAAU,EAAE;YACvC,MAAM,CAAC,GAAG,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,EAAE,CAAE,CAAC;YAClC,MAAM,EAAE,GAAG,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC;YACxB,MAAM,EAAE,GAAG,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC;YACxB,OAAO,IAAI,CAAC,IAAI,CAAC,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,CAAC,CAAC;QACtC,CAAC,CAAC;QAEF,MAAM,MAAM,GAAG,IAAI,GAAG,EAAkB,CAAC;QACzC,MAAM,QAAQ,GAAG,IAAI,GAAG,EAAkB,CAAC;QAC3C,MAAM,SAAS,GAAG,IAAI,GAAG,EAAU,CAAC;QAEpC,MAAM,IAAI,GAAG,IAAI,OAAO,EAAE,CAAC;QAE3B,MAAM,CAAC,GAAG,CAAC,OAAO,EAAE,CAAC,CAAC,CAAC;QACvB,IAAI,CAAC,IAAI,CAAC,EAAE,EAAE,EAAE,OAAO,EAAE,CAAC,EAAE,SAAS,CAAC,OAAO,CAAC,EAAE,CAAC,CAAC;QAElD,OAAO,IAAI,CAAC,IAAI,GAAG,CAAC,EAAE,CAAC;YACrB,MAAM,EAAE,EAAE,EAAE,OAAO,EAAE,GAAG,IAAI,CAAC,GAAG,EAAG,CAAC;YAEpC,IAAI,OAAO,KAAK,MAAM,EAAE,CAAC;gBACvB,oEAAoE;gBACpE,MAAM,IAAI,GAAa,EAAE,CAAC;gBAC1B,IAAI,IAAI,GAAuB,MAAM,CAAC;gBACtC,OAAO,IAAI,KAAK,SAAS,EAAE,CAAC;oBAC1B,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;oBAChB,IAAI,GAAG,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;gBAC5B,CAAC;gBACD,IAAI,CAAC,OAAO,EAAE,CAAC;gBACf,OAAO,IAAI,CAAC;YACd,CAAC;YAED,IAAI,SAAS,CAAC,GAAG,CAAC,OAAO,CAAC;gBAAE,SAAS;YACrC,SAAS,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC;YAEvB,MAAM,KAAK,GAAG,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC;YACvC,IAAI,CAAC,KAAK;gBAAE,SAAS;YAErB,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;gBACzB,IAAI,SAAS,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC;oBAAE,SAAS;gBAErC,MAAM,GAAG,GAAG,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;gBACxC,IAAI,CAAC,GAAG;oBAAE,SAAS;gBAEnB,oCAAoC;gBACpC,IAAI,MAAM,IAAI,IAAI,CAAC,EAAE,KAAK,MAAM,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC;oBAAE,SAAS;gBAE3D,MAAM,UAAU,GAAG,CAAC,MAAM,CAAC,GAAG,CAAC,OAAO,CAAC,IAAI,QAAQ,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC;gBACnE,IAAI,UAAU,GAAG,CAAC,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,IAAI,QAAQ,CAAC,EAAE,CAAC;oBACnD,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,EAAE,OAAO,CAAC,CAAC;oBAC/B,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,EAAE,UAAU,CAAC,CAAC;oBAChC,IAAI,CAAC,IAAI,CAAC,EAAE,EAAE,EAAE,IAAI,CAAC,EAAE,EAAE,CAAC,EAAE,UAAU,GAAG,SAAS,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC;gBACjE,CAAC;YACH,CAAC;QACH,CAAC;QAED,OAAO,IAAI,CAAC,CAAC,gBAAgB;IAC/B,CAAC;IAED,4EAA4E;IAC5E,mBAAmB;IACnB,4EAA4E;IAE5E;;;OAGG;IACH,mBAAmB,CAAC,MAAc,EAAE,IAAY,EAAE,CAAS;QACzD,MAAM,IAAI,GAAG,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;QACxC,MAAM,EAAE,GAAK,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;QACtC,IAAI,CAAC,IAAI,IAAI,CAAC,EAAE;YAAE,OAAO,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC;QACxC,MAAM,OAAO,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;QAC5C,OAAO;YACL,CAAC,EAAE,IAAI,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC,GAAG,OAAO;YACrC,CAAC,EAAE,IAAI,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC,GAAG,OAAO;SACtC,CAAC;IACJ,CAAC;IAED;;;OAGG;IACH,UAAU,CAAC,MAAc,EAAE,IAAY;QACrC,MAAM,KAAK,GAAG,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;QACtC,IAAI,CAAC,KAAK;YAAE,OAAO,QAAQ,CAAC;QAC5B,MAAM,IAAI,GAAG,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,KAAK,IAAI,CAAC,CAAC;QAC5C,OAAO,IAAI,EAAE,MAAM,IAAI,QAAQ,CAAC;IAClC,CAAC;IAED,4EAA4E;IAC5E,gBAAgB;IAChB,4EAA4E;IAE5E,2CAA2C;IAC3C,SAAS;QACP,OAAO;YACL,QAAQ,EAAE,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,SAAS,CAAC,MAAM,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;gBACtD,EAAE,EAAE,CAAC,CAAC,EAAE;gBACR,CAAC,EAAE,CAAC,CAAC,CAAC;gBACN,CAAC,EAAE,CAAC,CAAC,CAAC;gBACN,IAAI,EAAE,CAAC,GAAG,CAAC,CAAC,IAAI,CAAC;aAClB,CAAC,CAAC;YACH,KAAK,EAAE,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,OAAO,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,EAAE,KAAK,CAAC,EAAE,EAAE,CAAC,CAAC;gBAC/D,IAAI;gBACJ,KAAK,EAAE,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC,EAAE,EAAE,MAAM,EAAE,CAAC,CAAC,MAAM,EAAE,CAAC,CAAC;aACxD,CAAC,CAAC;SACJ,CAAC;IACJ,CAAC;IAED,+EAA+E;IAC/E,MAAM,CAAC,OAAO,CAAC,KAAuB;QACpC,MAAM,KAAK,GAAG,IAAI,UAAU,EAAE,CAAC;QAC/B,KAAK,MAAM,CAAC,IAAI,KAAK,CAAC,QAAQ,EAAE,CAAC;YAC/B,KAAK,CAAC,SAAS,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC;QAC/C,CAAC;QACD,KAAK,MAAM,EAAE,IAAI,EAAE,KAAK,EAAE,IAAI,KAAK,CAAC,KAAK,EAAE,CAAC;YAC1C,MAAM,IAAI,GAAG,KAAK,CAAC,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;YACpC,IAAI,IAAI,EAAE,CAAC;gBACT,KAAK,MAAM,CAAC,IAAI,KAAK,EAAE,CAAC;oBACtB,IAAI,CAAC,IAAI,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC,EAAE,EAAE,MAAM,EAAE,CAAC,CAAC,MAAM,EAAE,CAAC,CAAC;gBAC5C,CAAC;YACH,CAAC;QACH,CAAC;QACD,OAAO,KAAK,CAAC;IACf,CAAC;CACF"}