@esengine/pathfinding 1.0.1 → 1.0.3

package/dist/pathfinding.js

@@ -0,0 +1,572 @@
+/**
+ * @esengine/pathfinding v1.0.3
+ * 高性能寻路算法库 - 支持A*、广度优先等算法，适用于Cocos Creator、Laya等游戏引擎
+ * 
+ * @author yhh
+ * @license MIT
+ */
+(function (global, factory) {
+    typeof exports === 'object' && typeof module !== 'undefined' ? factory(exports) :
+    typeof define === 'function' && define.amd ? define(['exports'], factory) :
+    (global = typeof globalThis !== 'undefined' ? globalThis : global || self, factory(global.Pathfinding = {}));
+})(this, (function (exports) { 'use strict';
+
+    var Vector2Utils = (function () {
+        function Vector2Utils() {
+        }
+        Vector2Utils.equals = function (a, b) {
+            if (a.equals) {
+                return a.equals(b);
+            }
+            return a.x === b.x && a.y === b.y;
+        };
+        Vector2Utils.create = function (x, y) {
+            return { x: x, y: y };
+        };
+        Vector2Utils.clone = function (vector) {
+            return { x: vector.x, y: vector.y };
+        };
+        Vector2Utils.add = function (a, b) {
+            return { x: a.x + b.x, y: a.y + b.y };
+        };
+        Vector2Utils.manhattanDistance = function (a, b) {
+            return Math.abs(a.x - b.x) + Math.abs(a.y - b.y);
+        };
+        Vector2Utils.distance = function (a, b) {
+            var dx = a.x - b.x;
+            var dy = a.y - b.y;
+            return Math.sqrt(dx * dx + dy * dy);
+        };
+        Vector2Utils.toHash = function (vector) {
+            var x = (vector.x + this.MAX_COORD) | 0;
+            var y = (vector.y + this.MAX_COORD) | 0;
+            return (x << 16) | y;
+        };
+        Vector2Utils.toKey = function (vector) {
+            return "".concat(vector.x, ",").concat(vector.y);
+        };
+        Vector2Utils.fromHash = function (hash) {
+            var x = (hash >> 16) - this.MAX_COORD;
+            var y = (hash & 0xFFFF) - this.MAX_COORD;
+            return { x: x, y: y };
+        };
+        Vector2Utils.HASH_MULTIPLIER = 73856093;
+        Vector2Utils.MAX_COORD = 32767;
+        return Vector2Utils;
+    }());
+
+    var PriorityQueue = (function () {
+        function PriorityQueue() {
+            this._heap = [];
+            this._size = 0;
+        }
+        Object.defineProperty(PriorityQueue.prototype, "size", {
+            get: function () {
+                return this._size;
+            },
+            enumerable: false,
+            configurable: true
+        });
+        Object.defineProperty(PriorityQueue.prototype, "isEmpty", {
+            get: function () {
+                return this._size === 0;
+            },
+            enumerable: false,
+            configurable: true
+        });
+        PriorityQueue.prototype.clear = function () {
+            this._heap.length = 0;
+            this._size = 0;
+        };
+        PriorityQueue.prototype.enqueue = function (item) {
+            this._heap[this._size] = item;
+            this._bubbleUp(this._size);
+            this._size++;
+        };
+        PriorityQueue.prototype.dequeue = function () {
+            if (this._size === 0) {
+                return undefined;
+            }
+            var result = this._heap[0];
+            this._size--;
+            if (this._size > 0) {
+                this._heap[0] = this._heap[this._size];
+                this._bubbleDown(0);
+            }
+            return result;
+        };
+        PriorityQueue.prototype.peek = function () {
+            return this._size > 0 ? this._heap[0] : undefined;
+        };
+        PriorityQueue.prototype._bubbleUp = function (index) {
+            while (index > 0) {
+                var parentIndex = Math.floor((index - 1) / 2);
+                if (this._heap[index].priority >= this._heap[parentIndex].priority) {
+                    break;
+                }
+                this._swap(index, parentIndex);
+                index = parentIndex;
+            }
+        };
+        PriorityQueue.prototype._bubbleDown = function (index) {
+            while (true) {
+                var minIndex = index;
+                var leftChild = 2 * index + 1;
+                var rightChild = 2 * index + 2;
+                if (leftChild < this._size &&
+                    this._heap[leftChild].priority < this._heap[minIndex].priority) {
+                    minIndex = leftChild;
+                }
+                if (rightChild < this._size &&
+                    this._heap[rightChild].priority < this._heap[minIndex].priority) {
+                    minIndex = rightChild;
+                }
+                if (minIndex === index) {
+                    break;
+                }
+                this._swap(index, minIndex);
+                index = minIndex;
+            }
+        };
+        PriorityQueue.prototype._swap = function (i, j) {
+            var temp = this._heap[i];
+            this._heap[i] = this._heap[j];
+            this._heap[j] = temp;
+        };
+        return PriorityQueue;
+    }());
+
+    var __spreadArray = (globalThis && globalThis.__spreadArray) || function (to, from, pack) {
+        if (pack || arguments.length === 2) for (var i = 0, l = from.length, ar; i < l; i++) {
+            if (ar || !(i in from)) {
+                if (!ar) ar = Array.prototype.slice.call(from, 0, i);
+                ar[i] = from[i];
+            }
+        }
+        return to.concat(ar || Array.prototype.slice.call(from));
+    };
+    var AStarNode = (function () {
+        function AStarNode(node, gCost, hCost, parent) {
+            if (gCost === void 0) { gCost = 0; }
+            if (hCost === void 0) { hCost = 0; }
+            if (parent === void 0) { parent = null; }
+            this.priority = 0;
+            this.gCost = 0;
+            this.hCost = 0;
+            this.parent = null;
+            this.hash = 0;
+            this.node = node;
+            this.gCost = gCost;
+            this.hCost = hCost;
+            this.priority = gCost + hCost;
+            this.parent = parent;
+            this.hash = Vector2Utils.toHash(node);
+        }
+        AStarNode.prototype.updateCosts = function (gCost, hCost, parent) {
+            if (parent === void 0) { parent = null; }
+            this.gCost = gCost;
+            this.hCost = hCost;
+            this.priority = gCost + hCost;
+            this.parent = parent;
+        };
+        AStarNode.prototype.updateNode = function (node, gCost, hCost, parent) {
+            if (gCost === void 0) { gCost = 0; }
+            if (hCost === void 0) { hCost = 0; }
+            if (parent === void 0) { parent = null; }
+            this.node = node;
+            this.gCost = gCost;
+            this.hCost = hCost;
+            this.priority = gCost + hCost;
+            this.parent = parent;
+            this.hash = Vector2Utils.toHash(node);
+        };
+        AStarNode.prototype.reset = function () {
+            this.node = null;
+            this.priority = 0;
+            this.gCost = 0;
+            this.hCost = 0;
+            this.parent = null;
+            this.hash = 0;
+        };
+        return AStarNode;
+    }());
+    var AStarPathfinder = (function () {
+        function AStarPathfinder() {
+        }
+        AStarPathfinder._getNode = function (node, gCost, hCost, parent) {
+            if (gCost === void 0) { gCost = 0; }
+            if (hCost === void 0) { hCost = 0; }
+            if (parent === void 0) { parent = null; }
+            var astarNode = this._nodePool.pop();
+            if (!astarNode) {
+                astarNode = new AStarNode(node, gCost, hCost, parent);
+            }
+            else {
+                astarNode.updateNode(node, gCost, hCost, parent);
+            }
+            return astarNode;
+        };
+        AStarPathfinder._recycleNode = function (node) {
+            if (this._nodePool.length < 1000) {
+                node.reset();
+                this._nodePool.push(node);
+            }
+        };
+        AStarPathfinder.search = function (graph, start, goal) {
+            var openSet = new PriorityQueue();
+            var closedSet = new Set();
+            var openSetMap = new Map();
+            var startHash = Vector2Utils.toHash(start);
+            var goalHash = Vector2Utils.toHash(goal);
+            if (startHash === goalHash) {
+                return { found: true, goalNode: this._getNode(start, 0, 0) };
+            }
+            if (!graph.isNodePassable(start)) {
+                return { found: false, openSetNodes: [] };
+            }
+            var startNode = this._getNode(start, 0, graph.heuristic(start, goal));
+            openSet.enqueue(startNode);
+            openSetMap.set(startHash, startNode);
+            var goalNode;
+            var processedNodes = [];
+            while (!openSet.isEmpty) {
+                var current = openSet.dequeue();
+                var currentHash = current.hash;
+                openSetMap.delete(currentHash);
+                if (currentHash === goalHash) {
+                    goalNode = current;
+                    break;
+                }
+                closedSet.add(currentHash);
+                for (var _i = 0, _a = graph.getNeighbors(current.node); _i < _a.length; _i++) {
+                    var neighbor = _a[_i];
+                    var neighborHash = Vector2Utils.toHash(neighbor);
+                    if (closedSet.has(neighborHash)) {
+                        continue;
+                    }
+                    var tentativeGScore = current.gCost + graph.cost(current.node, neighbor);
+                    var existingNode = openSetMap.get(neighborHash);
+                    if (existingNode) {
+                        if (tentativeGScore < existingNode.gCost) {
+                            var hCost = existingNode.hCost;
+                            existingNode.updateCosts(tentativeGScore, hCost, current);
+                        }
+                    }
+                    else {
+                        var hCost = graph.heuristic(neighbor, goal);
+                        var neighborNode = this._getNode(neighbor, tentativeGScore, hCost, current);
+                        openSet.enqueue(neighborNode);
+                        openSetMap.set(neighborHash, neighborNode);
+                    }
+                }
+                processedNodes.push(current);
+            }
+            var remainingNodes = [];
+            while (!openSet.isEmpty) {
+                remainingNodes.push(openSet.dequeue());
+            }
+            var allNodesToRecycle = __spreadArray(__spreadArray([], processedNodes, true), remainingNodes, true);
+            return { found: !!goalNode, goalNode: goalNode, openSetNodes: allNodesToRecycle };
+        };
+        AStarPathfinder.searchPath = function (graph, start, goal) {
+            var result = this.search(graph, start, goal);
+            if (!result.found || !result.goalNode) {
+                if (result.openSetNodes) {
+                    for (var _i = 0, _a = result.openSetNodes; _i < _a.length; _i++) {
+                        var node = _a[_i];
+                        this._recycleNode(node);
+                    }
+                }
+                return [];
+            }
+            var path = this.reconstructPathFromNode(result.goalNode);
+            if (result.openSetNodes) {
+                for (var _b = 0, _c = result.openSetNodes; _b < _c.length; _b++) {
+                    var node = _c[_b];
+                    this._recycleNode(node);
+                }
+            }
+            return path;
+        };
+        AStarPathfinder.reconstructPathFromNode = function (goalNode) {
+            this._tempPath.length = 0;
+            var current = goalNode;
+            while (current) {
+                this._tempPath.unshift(current.node);
+                current = current.parent;
+            }
+            return __spreadArray([], this._tempPath, true);
+        };
+        AStarPathfinder.hasPath = function (graph, start, goal) {
+            var result = this.search(graph, start, goal);
+            if (result.goalNode) {
+                this._recycleNode(result.goalNode);
+            }
+            if (result.openSetNodes) {
+                for (var _i = 0, _a = result.openSetNodes; _i < _a.length; _i++) {
+                    var node = _a[_i];
+                    if (node !== result.goalNode) {
+                        this._recycleNode(node);
+                    }
+                }
+            }
+            return result.found;
+        };
+        AStarPathfinder.clearPool = function () {
+            this._nodePool.length = 0;
+            this._tempPath.length = 0;
+        };
+        AStarPathfinder.getPoolStats = function () {
+            return {
+                poolSize: this._nodePool.length,
+                maxPoolSize: 1000
+            };
+        };
+        AStarPathfinder._nodePool = [];
+        AStarPathfinder._tempPath = [];
+        return AStarPathfinder;
+    }());
+
+    var AstarGridGraph = (function () {
+        function AstarGridGraph(width, height) {
+            this.dirs = [
+                Vector2Utils.create(1, 0),
+                Vector2Utils.create(0, -1),
+                Vector2Utils.create(-1, 0),
+                Vector2Utils.create(0, 1)
+            ];
+            this.walls = [];
+            this.weightedNodes = [];
+            this.defaultWeight = 1;
+            this.weightedNodeWeight = 5;
+            this._neighbors = new Array(4);
+            this._wallsSet = new Set();
+            this._weightedNodesSet = new Set();
+            this._wallsDirty = true;
+            this._weightedNodesDirty = true;
+            this._width = width;
+            this._height = height;
+        }
+        AstarGridGraph.prototype.addWall = function (wall) {
+            this.walls.push(wall);
+            this._wallsDirty = true;
+        };
+        AstarGridGraph.prototype.addWalls = function (walls) {
+            var _a;
+            (_a = this.walls).push.apply(_a, walls);
+            this._wallsDirty = true;
+        };
+        AstarGridGraph.prototype.clearWalls = function () {
+            this.walls.length = 0;
+            this._wallsSet.clear();
+            this._wallsDirty = false;
+        };
+        AstarGridGraph.prototype.addWeightedNode = function (node) {
+            this.weightedNodes.push(node);
+            this._weightedNodesDirty = true;
+        };
+        AstarGridGraph.prototype.addWeightedNodes = function (nodes) {
+            var _a;
+            (_a = this.weightedNodes).push.apply(_a, nodes);
+            this._weightedNodesDirty = true;
+        };
+        AstarGridGraph.prototype.clearWeightedNodes = function () {
+            this.weightedNodes.length = 0;
+            this._weightedNodesSet.clear();
+            this._weightedNodesDirty = false;
+        };
+        AstarGridGraph.prototype._updateHashSets = function () {
+            if (this._wallsDirty) {
+                this._wallsSet.clear();
+                for (var _i = 0, _a = this.walls; _i < _a.length; _i++) {
+                    var wall = _a[_i];
+                    this._wallsSet.add(Vector2Utils.toHash(wall));
+                }
+                this._wallsDirty = false;
+            }
+            if (this._weightedNodesDirty) {
+                this._weightedNodesSet.clear();
+                for (var _b = 0, _c = this.weightedNodes; _b < _c.length; _b++) {
+                    var node = _c[_b];
+                    this._weightedNodesSet.add(Vector2Utils.toHash(node));
+                }
+                this._weightedNodesDirty = false;
+            }
+        };
+        AstarGridGraph.prototype.isNodeInBounds = function (node) {
+            return 0 <= node.x && node.x < this._width && 0 <= node.y && node.y < this._height;
+        };
+        AstarGridGraph.prototype.isNodePassable = function (node) {
+            this._updateHashSets();
+            return !this._wallsSet.has(Vector2Utils.toHash(node));
+        };
+        AstarGridGraph.prototype.search = function (start, goal) {
+            return AStarPathfinder.hasPath(this, start, goal);
+        };
+        AstarGridGraph.prototype.searchPath = function (start, goal) {
+            return AStarPathfinder.searchPath(this, start, goal);
+        };
+        AstarGridGraph.prototype.getNeighbors = function (node) {
+            this._neighbors.length = 0;
+            for (var _i = 0, _a = this.dirs; _i < _a.length; _i++) {
+                var dir = _a[_i];
+                var next = Vector2Utils.add(node, dir);
+                if (this.isNodeInBounds(next) && this.isNodePassable(next)) {
+                    this._neighbors.push(next);
+                }
+            }
+            return this._neighbors;
+        };
+        AstarGridGraph.prototype.cost = function (from, to) {
+            this._updateHashSets();
+            return this._weightedNodesSet.has(Vector2Utils.toHash(to)) ? this.weightedNodeWeight : this.defaultWeight;
+        };
+        AstarGridGraph.prototype.heuristic = function (node, goal) {
+            return Vector2Utils.manhattanDistance(node, goal);
+        };
+        AstarGridGraph.prototype.getStats = function () {
+            this._updateHashSets();
+            return {
+                walls: this.walls.length,
+                weightedNodes: this.weightedNodes.length,
+                gridSize: "".concat(this._width, "x").concat(this._height),
+                wallsSetSize: this._wallsSet.size,
+                weightedNodesSetSize: this._weightedNodesSet.size
+            };
+        };
+        return AstarGridGraph;
+    }());
+
+    var BreadthFirstPathfinder = (function () {
+        function BreadthFirstPathfinder() {
+        }
+        BreadthFirstPathfinder.search = function (graph, start, goal, cameFrom) {
+            var frontier = [];
+            var visited = new Set();
+            var pathMap = cameFrom || new Map();
+            var startHash = Vector2Utils.toHash(start);
+            var goalHash = Vector2Utils.toHash(goal);
+            if (startHash === goalHash) {
+                return true;
+            }
+            frontier.push(start);
+            visited.add(startHash);
+            while (frontier.length > 0) {
+                var current = frontier.shift();
+                var currentHash = Vector2Utils.toHash(current);
+                if (currentHash === goalHash) {
+                    return true;
+                }
+                for (var _i = 0, _a = graph.getNeighbors(current); _i < _a.length; _i++) {
+                    var neighbor = _a[_i];
+                    var neighborHash = Vector2Utils.toHash(neighbor);
+                    if (visited.has(neighborHash)) {
+                        continue;
+                    }
+                    visited.add(neighborHash);
+                    pathMap.set(neighborHash, current);
+                    frontier.push(neighbor);
+                }
+            }
+            return false;
+        };
+        BreadthFirstPathfinder.searchPath = function (graph, start, goal) {
+            var cameFrom = new Map();
+            if (this.search(graph, start, goal, cameFrom)) {
+                return this.reconstructPath(cameFrom, start, goal);
+            }
+            return [];
+        };
+        BreadthFirstPathfinder.reconstructPath = function (cameFrom, start, goal) {
+            var path = [];
+            var current = goal;
+            var startHash = Vector2Utils.toHash(start);
+            while (Vector2Utils.toHash(current) !== startHash) {
+                path.unshift(current);
+                var currentHash = Vector2Utils.toHash(current);
+                var parent_1 = cameFrom.get(currentHash);
+                if (!parent_1)
+                    break;
+                current = parent_1;
+            }
+            path.unshift(start);
+            return path;
+        };
+        return BreadthFirstPathfinder;
+    }());
+
+    var UnweightedGraph = (function () {
+        function UnweightedGraph() {
+            this.edges = new Map();
+        }
+        UnweightedGraph.prototype.addEdgesForNode = function (node, neighbors) {
+            this.edges.set(node, neighbors);
+            return this;
+        };
+        UnweightedGraph.prototype.getNeighbors = function (node) {
+            return this.edges.get(node) || [];
+        };
+        return UnweightedGraph;
+    }());
+
+    var UnweightedGridGraph = (function () {
+        function UnweightedGridGraph(width, height, allowDiagonalSearch) {
+            if (allowDiagonalSearch === void 0) { allowDiagonalSearch = false; }
+            this.walls = [];
+            this._neighbors = [];
+            this._width = width;
+            this._height = height;
+            this._dirs = allowDiagonalSearch ? UnweightedGridGraph.COMPASS_DIRS : UnweightedGridGraph.CARDINAL_DIRS;
+        }
+        UnweightedGridGraph.prototype.isNodeInBounds = function (node) {
+            return 0 <= node.x && node.x < this._width && 0 <= node.y && node.y < this._height;
+        };
+        UnweightedGridGraph.prototype.isNodePassable = function (node) {
+            return !this.walls.find(function (wall) { return Vector2Utils.equals(wall, node); });
+        };
+        UnweightedGridGraph.prototype.getNeighbors = function (node) {
+            this._neighbors.length = 0;
+            for (var _i = 0, _a = this._dirs; _i < _a.length; _i++) {
+                var dir = _a[_i];
+                var next = Vector2Utils.add(node, dir);
+                if (this.isNodeInBounds(next) && this.isNodePassable(next)) {
+                    this._neighbors.push(next);
+                }
+            }
+            return this._neighbors;
+        };
+        UnweightedGridGraph.prototype.searchPath = function (start, goal) {
+            return BreadthFirstPathfinder.searchPath(this, start, goal);
+        };
+        UnweightedGridGraph.prototype.hasPath = function (start, goal) {
+            return BreadthFirstPathfinder.search(this, start, goal);
+        };
+        UnweightedGridGraph.CARDINAL_DIRS = [
+            Vector2Utils.create(1, 0),
+            Vector2Utils.create(0, -1),
+            Vector2Utils.create(-1, 0),
+            Vector2Utils.create(0, 1)
+        ];
+        UnweightedGridGraph.COMPASS_DIRS = [
+            Vector2Utils.create(1, 0),
+            Vector2Utils.create(1, -1),
+            Vector2Utils.create(0, -1),
+            Vector2Utils.create(-1, -1),
+            Vector2Utils.create(-1, 0),
+            Vector2Utils.create(-1, 1),
+            Vector2Utils.create(0, 1),
+            Vector2Utils.create(1, 1),
+        ];
+        return UnweightedGridGraph;
+    }());
+
+    exports.AStarPathfinder = AStarPathfinder;
+    exports.AstarGridGraph = AstarGridGraph;
+    exports.BreadthFirstPathfinder = BreadthFirstPathfinder;
+    exports.PriorityQueue = PriorityQueue;
+    exports.UnweightedGraph = UnweightedGraph;
+    exports.UnweightedGridGraph = UnweightedGridGraph;
+    exports.Vector2Utils = Vector2Utils;
+
+}));
+//# sourceMappingURL=pathfinding.js.map

package/dist/pathfinding.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"pathfinding.js","sources":["../bin/Types/IVector2.js","../bin/Utils/PriorityQueue.js","../bin/AI/Pathfinding/AStar/AStarPathfinder.js","../bin/AI/Pathfinding/AStar/AstarGridGraph.js","../bin/AI/Pathfinding/BreadthFirst/BreadthFirstPathfinder.js","../bin/AI/Pathfinding/BreadthFirst/UnweightedGraph.js","../bin/AI/Pathfinding/BreadthFirst/UnweightedGridGraph.js"],"sourcesContent":["var Vector2Utils = (function () {\n    function Vector2Utils() {\n    }\n    Vector2Utils.equals = function (a, b) {\n        if (a.equals) {\n            return a.equals(b);\n        }\n        return a.x === b.x && a.y === b.y;\n    };\n    Vector2Utils.create = function (x, y) {\n        return { x: x, y: y };\n    };\n    Vector2Utils.clone = function (vector) {\n        return { x: vector.x, y: vector.y };\n    };\n    Vector2Utils.add = function (a, b) {\n        return { x: a.x + b.x, y: a.y + b.y };\n    };\n    Vector2Utils.manhattanDistance = function (a, b) {\n        return Math.abs(a.x - b.x) + Math.abs(a.y - b.y);\n    };\n    Vector2Utils.distance = function (a, b) {\n        var dx = a.x - b.x;\n        var dy = a.y - b.y;\n        return Math.sqrt(dx * dx + dy * dy);\n    };\n    Vector2Utils.toHash = function (vector) {\n        var x = (vector.x + this.MAX_COORD) | 0;\n        var y = (vector.y + this.MAX_COORD) | 0;\n        return (x << 16) | y;\n    };\n    Vector2Utils.toKey = function (vector) {\n        return \"\".concat(vector.x, \",\").concat(vector.y);\n    };\n    Vector2Utils.fromHash = function (hash) {\n        var x = (hash >> 16) - this.MAX_COORD;\n        var y = (hash & 0xFFFF) - this.MAX_COORD;\n        return { x: x, y: y };\n    };\n    Vector2Utils.HASH_MULTIPLIER = 73856093;\n    Vector2Utils.MAX_COORD = 32767;\n    return Vector2Utils;\n}());\nexport { Vector2Utils };\n","var PriorityQueue = (function () {\n    function PriorityQueue() {\n        this._heap = [];\n        this._size = 0;\n    }\n    Object.defineProperty(PriorityQueue.prototype, \"size\", {\n        get: function () {\n            return this._size;\n        },\n        enumerable: false,\n        configurable: true\n    });\n    Object.defineProperty(PriorityQueue.prototype, \"isEmpty\", {\n        get: function () {\n            return this._size === 0;\n        },\n        enumerable: false,\n        configurable: true\n    });\n    PriorityQueue.prototype.clear = function () {\n        this._heap.length = 0;\n        this._size = 0;\n    };\n    PriorityQueue.prototype.enqueue = function (item) {\n        this._heap[this._size] = item;\n        this._bubbleUp(this._size);\n        this._size++;\n    };\n    PriorityQueue.prototype.dequeue = function () {\n        if (this._size === 0) {\n            return undefined;\n        }\n        var result = this._heap[0];\n        this._size--;\n        if (this._size > 0) {\n            this._heap[0] = this._heap[this._size];\n            this._bubbleDown(0);\n        }\n        return result;\n    };\n    PriorityQueue.prototype.peek = function () {\n        return this._size > 0 ? this._heap[0] : undefined;\n    };\n    PriorityQueue.prototype._bubbleUp = function (index) {\n        while (index > 0) {\n            var parentIndex = Math.floor((index - 1) / 2);\n            if (this._heap[index].priority >= this._heap[parentIndex].priority) {\n                break;\n            }\n            this._swap(index, parentIndex);\n            index = parentIndex;\n        }\n    };\n    PriorityQueue.prototype._bubbleDown = function (index) {\n        while (true) {\n            var minIndex = index;\n            var leftChild = 2 * index + 1;\n            var rightChild = 2 * index + 2;\n            if (leftChild < this._size &&\n                this._heap[leftChild].priority < this._heap[minIndex].priority) {\n                minIndex = leftChild;\n            }\n            if (rightChild < this._size &&\n                this._heap[rightChild].priority < this._heap[minIndex].priority) {\n                minIndex = rightChild;\n            }\n            if (minIndex === index) {\n                break;\n            }\n            this._swap(index, minIndex);\n            index = minIndex;\n        }\n    };\n    PriorityQueue.prototype._swap = function (i, j) {\n        var temp = this._heap[i];\n        this._heap[i] = this._heap[j];\n        this._heap[j] = temp;\n    };\n    return PriorityQueue;\n}());\nexport { PriorityQueue };\n","var __spreadArray = (this && this.__spreadArray) || function (to, from, pack) {\n    if (pack || arguments.length === 2) for (var i = 0, l = from.length, ar; i < l; i++) {\n        if (ar || !(i in from)) {\n            if (!ar) ar = Array.prototype.slice.call(from, 0, i);\n            ar[i] = from[i];\n        }\n    }\n    return to.concat(ar || Array.prototype.slice.call(from));\n};\nimport { Vector2Utils } from '../../../Types/IVector2';\nimport { PriorityQueue } from '../../../Utils/PriorityQueue';\nvar AStarNode = (function () {\n    function AStarNode(node, gCost, hCost, parent) {\n        if (gCost === void 0) { gCost = 0; }\n        if (hCost === void 0) { hCost = 0; }\n        if (parent === void 0) { parent = null; }\n        this.priority = 0;\n        this.gCost = 0;\n        this.hCost = 0;\n        this.parent = null;\n        this.hash = 0;\n        this.node = node;\n        this.gCost = gCost;\n        this.hCost = hCost;\n        this.priority = gCost + hCost;\n        this.parent = parent;\n        this.hash = Vector2Utils.toHash(node);\n    }\n    AStarNode.prototype.updateCosts = function (gCost, hCost, parent) {\n        if (parent === void 0) { parent = null; }\n        this.gCost = gCost;\n        this.hCost = hCost;\n        this.priority = gCost + hCost;\n        this.parent = parent;\n    };\n    AStarNode.prototype.updateNode = function (node, gCost, hCost, parent) {\n        if (gCost === void 0) { gCost = 0; }\n        if (hCost === void 0) { hCost = 0; }\n        if (parent === void 0) { parent = null; }\n        this.node = node;\n        this.gCost = gCost;\n        this.hCost = hCost;\n        this.priority = gCost + hCost;\n        this.parent = parent;\n        this.hash = Vector2Utils.toHash(node);\n    };\n    AStarNode.prototype.reset = function () {\n        this.node = null;\n        this.priority = 0;\n        this.gCost = 0;\n        this.hCost = 0;\n        this.parent = null;\n        this.hash = 0;\n    };\n    return AStarNode;\n}());\nvar AStarPathfinder = (function () {\n    function AStarPathfinder() {\n    }\n    AStarPathfinder._getNode = function (node, gCost, hCost, parent) {\n        if (gCost === void 0) { gCost = 0; }\n        if (hCost === void 0) { hCost = 0; }\n        if (parent === void 0) { parent = null; }\n        var astarNode = this._nodePool.pop();\n        if (!astarNode) {\n            astarNode = new AStarNode(node, gCost, hCost, parent);\n        }\n        else {\n            astarNode.updateNode(node, gCost, hCost, parent);\n        }\n        return astarNode;\n    };\n    AStarPathfinder._recycleNode = function (node) {\n        if (this._nodePool.length < 1000) {\n            node.reset();\n            this._nodePool.push(node);\n        }\n    };\n    AStarPathfinder.search = function (graph, start, goal) {\n        var openSet = new PriorityQueue();\n        var closedSet = new Set();\n        var openSetMap = new Map();\n        var startHash = Vector2Utils.toHash(start);\n        var goalHash = Vector2Utils.toHash(goal);\n        if (startHash === goalHash) {\n            return { found: true, goalNode: this._getNode(start, 0, 0) };\n        }\n        if (!graph.isNodePassable(start)) {\n            return { found: false, openSetNodes: [] };\n        }\n        var startNode = this._getNode(start, 0, graph.heuristic(start, goal));\n        openSet.enqueue(startNode);\n        openSetMap.set(startHash, startNode);\n        var goalNode;\n        var processedNodes = [];\n        while (!openSet.isEmpty) {\n            var current = openSet.dequeue();\n            var currentHash = current.hash;\n            openSetMap.delete(currentHash);\n            if (currentHash === goalHash) {\n                goalNode = current;\n                break;\n            }\n            closedSet.add(currentHash);\n            for (var _i = 0, _a = graph.getNeighbors(current.node); _i < _a.length; _i++) {\n                var neighbor = _a[_i];\n                var neighborHash = Vector2Utils.toHash(neighbor);\n                if (closedSet.has(neighborHash)) {\n                    continue;\n                }\n                var tentativeGScore = current.gCost + graph.cost(current.node, neighbor);\n                var existingNode = openSetMap.get(neighborHash);\n                if (existingNode) {\n                    if (tentativeGScore < existingNode.gCost) {\n                        var hCost = existingNode.hCost;\n                        existingNode.updateCosts(tentativeGScore, hCost, current);\n                    }\n                }\n                else {\n                    var hCost = graph.heuristic(neighbor, goal);\n                    var neighborNode = this._getNode(neighbor, tentativeGScore, hCost, current);\n                    openSet.enqueue(neighborNode);\n                    openSetMap.set(neighborHash, neighborNode);\n                }\n            }\n            processedNodes.push(current);\n        }\n        var remainingNodes = [];\n        while (!openSet.isEmpty) {\n            remainingNodes.push(openSet.dequeue());\n        }\n        var allNodesToRecycle = __spreadArray(__spreadArray([], processedNodes, true), remainingNodes, true);\n        return { found: !!goalNode, goalNode: goalNode, openSetNodes: allNodesToRecycle };\n    };\n    AStarPathfinder.searchPath = function (graph, start, goal) {\n        var result = this.search(graph, start, goal);\n        if (!result.found || !result.goalNode) {\n            if (result.openSetNodes) {\n                for (var _i = 0, _a = result.openSetNodes; _i < _a.length; _i++) {\n                    var node = _a[_i];\n                    this._recycleNode(node);\n                }\n            }\n            return [];\n        }\n        var path = this.reconstructPathFromNode(result.goalNode);\n        if (result.openSetNodes) {\n            for (var _b = 0, _c = result.openSetNodes; _b < _c.length; _b++) {\n                var node = _c[_b];\n                this._recycleNode(node);\n            }\n        }\n        return path;\n    };\n    AStarPathfinder.reconstructPathFromNode = function (goalNode) {\n        this._tempPath.length = 0;\n        var current = goalNode;\n        while (current) {\n            this._tempPath.unshift(current.node);\n            current = current.parent;\n        }\n        return __spreadArray([], this._tempPath, true);\n    };\n    AStarPathfinder.hasPath = function (graph, start, goal) {\n        var result = this.search(graph, start, goal);\n        if (result.goalNode) {\n            this._recycleNode(result.goalNode);\n        }\n        if (result.openSetNodes) {\n            for (var _i = 0, _a = result.openSetNodes; _i < _a.length; _i++) {\n                var node = _a[_i];\n                if (node !== result.goalNode) {\n                    this._recycleNode(node);\n                }\n            }\n        }\n        return result.found;\n    };\n    AStarPathfinder.clearPool = function () {\n        this._nodePool.length = 0;\n        this._tempPath.length = 0;\n    };\n    AStarPathfinder.getPoolStats = function () {\n        return {\n            poolSize: this._nodePool.length,\n            maxPoolSize: 1000\n        };\n    };\n    AStarPathfinder._nodePool = [];\n    AStarPathfinder._tempPath = [];\n    return AStarPathfinder;\n}());\nexport { AStarPathfinder };\n","import { Vector2Utils } from '../../../Types/IVector2';\nimport { AStarPathfinder } from './AStarPathfinder';\nvar AstarGridGraph = (function () {\n    function AstarGridGraph(width, height) {\n        this.dirs = [\n            Vector2Utils.create(1, 0),\n            Vector2Utils.create(0, -1),\n            Vector2Utils.create(-1, 0),\n            Vector2Utils.create(0, 1)\n        ];\n        this.walls = [];\n        this.weightedNodes = [];\n        this.defaultWeight = 1;\n        this.weightedNodeWeight = 5;\n        this._neighbors = new Array(4);\n        this._wallsSet = new Set();\n        this._weightedNodesSet = new Set();\n        this._wallsDirty = true;\n        this._weightedNodesDirty = true;\n        this._width = width;\n        this._height = height;\n    }\n    AstarGridGraph.prototype.addWall = function (wall) {\n        this.walls.push(wall);\n        this._wallsDirty = true;\n    };\n    AstarGridGraph.prototype.addWalls = function (walls) {\n        var _a;\n        (_a = this.walls).push.apply(_a, walls);\n        this._wallsDirty = true;\n    };\n    AstarGridGraph.prototype.clearWalls = function () {\n        this.walls.length = 0;\n        this._wallsSet.clear();\n        this._wallsDirty = false;\n    };\n    AstarGridGraph.prototype.addWeightedNode = function (node) {\n        this.weightedNodes.push(node);\n        this._weightedNodesDirty = true;\n    };\n    AstarGridGraph.prototype.addWeightedNodes = function (nodes) {\n        var _a;\n        (_a = this.weightedNodes).push.apply(_a, nodes);\n        this._weightedNodesDirty = true;\n    };\n    AstarGridGraph.prototype.clearWeightedNodes = function () {\n        this.weightedNodes.length = 0;\n        this._weightedNodesSet.clear();\n        this._weightedNodesDirty = false;\n    };\n    AstarGridGraph.prototype._updateHashSets = function () {\n        if (this._wallsDirty) {\n            this._wallsSet.clear();\n            for (var _i = 0, _a = this.walls; _i < _a.length; _i++) {\n                var wall = _a[_i];\n                this._wallsSet.add(Vector2Utils.toHash(wall));\n            }\n            this._wallsDirty = false;\n        }\n        if (this._weightedNodesDirty) {\n            this._weightedNodesSet.clear();\n            for (var _b = 0, _c = this.weightedNodes; _b < _c.length; _b++) {\n                var node = _c[_b];\n                this._weightedNodesSet.add(Vector2Utils.toHash(node));\n            }\n            this._weightedNodesDirty = false;\n        }\n    };\n    AstarGridGraph.prototype.isNodeInBounds = function (node) {\n        return 0 <= node.x && node.x < this._width && 0 <= node.y && node.y < this._height;\n    };\n    AstarGridGraph.prototype.isNodePassable = function (node) {\n        this._updateHashSets();\n        return !this._wallsSet.has(Vector2Utils.toHash(node));\n    };\n    AstarGridGraph.prototype.search = function (start, goal) {\n        return AStarPathfinder.hasPath(this, start, goal);\n    };\n    AstarGridGraph.prototype.searchPath = function (start, goal) {\n        return AStarPathfinder.searchPath(this, start, goal);\n    };\n    AstarGridGraph.prototype.getNeighbors = function (node) {\n        this._neighbors.length = 0;\n        for (var _i = 0, _a = this.dirs; _i < _a.length; _i++) {\n            var dir = _a[_i];\n            var next = Vector2Utils.add(node, dir);\n            if (this.isNodeInBounds(next) && this.isNodePassable(next)) {\n                this._neighbors.push(next);\n            }\n        }\n        return this._neighbors;\n    };\n    AstarGridGraph.prototype.cost = function (from, to) {\n        this._updateHashSets();\n        return this._weightedNodesSet.has(Vector2Utils.toHash(to)) ? this.weightedNodeWeight : this.defaultWeight;\n    };\n    AstarGridGraph.prototype.heuristic = function (node, goal) {\n        return Vector2Utils.manhattanDistance(node, goal);\n    };\n    AstarGridGraph.prototype.getStats = function () {\n        this._updateHashSets();\n        return {\n            walls: this.walls.length,\n            weightedNodes: this.weightedNodes.length,\n            gridSize: \"\".concat(this._width, \"x\").concat(this._height),\n            wallsSetSize: this._wallsSet.size,\n            weightedNodesSetSize: this._weightedNodesSet.size\n        };\n    };\n    return AstarGridGraph;\n}());\nexport { AstarGridGraph };\n","import { Vector2Utils } from '../../../Types/IVector2';\nvar BreadthFirstPathfinder = (function () {\n    function BreadthFirstPathfinder() {\n    }\n    BreadthFirstPathfinder.search = function (graph, start, goal, cameFrom) {\n        var frontier = [];\n        var visited = new Set();\n        var pathMap = cameFrom || new Map();\n        var startHash = Vector2Utils.toHash(start);\n        var goalHash = Vector2Utils.toHash(goal);\n        if (startHash === goalHash) {\n            return true;\n        }\n        frontier.push(start);\n        visited.add(startHash);\n        while (frontier.length > 0) {\n            var current = frontier.shift();\n            var currentHash = Vector2Utils.toHash(current);\n            if (currentHash === goalHash) {\n                return true;\n            }\n            for (var _i = 0, _a = graph.getNeighbors(current); _i < _a.length; _i++) {\n                var neighbor = _a[_i];\n                var neighborHash = Vector2Utils.toHash(neighbor);\n                if (visited.has(neighborHash)) {\n                    continue;\n                }\n                visited.add(neighborHash);\n                pathMap.set(neighborHash, current);\n                frontier.push(neighbor);\n            }\n        }\n        return false;\n    };\n    BreadthFirstPathfinder.searchPath = function (graph, start, goal) {\n        var cameFrom = new Map();\n        if (this.search(graph, start, goal, cameFrom)) {\n            return this.reconstructPath(cameFrom, start, goal);\n        }\n        return [];\n    };\n    BreadthFirstPathfinder.reconstructPath = function (cameFrom, start, goal) {\n        var path = [];\n        var current = goal;\n        var startHash = Vector2Utils.toHash(start);\n        while (Vector2Utils.toHash(current) !== startHash) {\n            path.unshift(current);\n            var currentHash = Vector2Utils.toHash(current);\n            var parent_1 = cameFrom.get(currentHash);\n            if (!parent_1)\n                break;\n            current = parent_1;\n        }\n        path.unshift(start);\n        return path;\n    };\n    return BreadthFirstPathfinder;\n}());\nexport { BreadthFirstPathfinder };\n","var UnweightedGraph = (function () {\n    function UnweightedGraph() {\n        this.edges = new Map();\n    }\n    UnweightedGraph.prototype.addEdgesForNode = function (node, neighbors) {\n        this.edges.set(node, neighbors);\n        return this;\n    };\n    UnweightedGraph.prototype.getNeighbors = function (node) {\n        return this.edges.get(node) || [];\n    };\n    return UnweightedGraph;\n}());\nexport { UnweightedGraph };\n","import { Vector2Utils } from '../../../Types/IVector2';\nimport { BreadthFirstPathfinder } from './BreadthFirstPathfinder';\nvar UnweightedGridGraph = (function () {\n    function UnweightedGridGraph(width, height, allowDiagonalSearch) {\n        if (allowDiagonalSearch === void 0) { allowDiagonalSearch = false; }\n        this.walls = [];\n        this._neighbors = [];\n        this._width = width;\n        this._height = height;\n        this._dirs = allowDiagonalSearch ? UnweightedGridGraph.COMPASS_DIRS : UnweightedGridGraph.CARDINAL_DIRS;\n    }\n    UnweightedGridGraph.prototype.isNodeInBounds = function (node) {\n        return 0 <= node.x && node.x < this._width && 0 <= node.y && node.y < this._height;\n    };\n    UnweightedGridGraph.prototype.isNodePassable = function (node) {\n        return !this.walls.find(function (wall) { return Vector2Utils.equals(wall, node); });\n    };\n    UnweightedGridGraph.prototype.getNeighbors = function (node) {\n        this._neighbors.length = 0;\n        for (var _i = 0, _a = this._dirs; _i < _a.length; _i++) {\n            var dir = _a[_i];\n            var next = Vector2Utils.add(node, dir);\n            if (this.isNodeInBounds(next) && this.isNodePassable(next)) {\n                this._neighbors.push(next);\n            }\n        }\n        return this._neighbors;\n    };\n    UnweightedGridGraph.prototype.searchPath = function (start, goal) {\n        return BreadthFirstPathfinder.searchPath(this, start, goal);\n    };\n    UnweightedGridGraph.prototype.hasPath = function (start, goal) {\n        return BreadthFirstPathfinder.search(this, start, goal);\n    };\n    UnweightedGridGraph.CARDINAL_DIRS = [\n        Vector2Utils.create(1, 0),\n        Vector2Utils.create(0, -1),\n        Vector2Utils.create(-1, 0),\n        Vector2Utils.create(0, 1)\n    ];\n    UnweightedGridGraph.COMPASS_DIRS = [\n        Vector2Utils.create(1, 0),\n        Vector2Utils.create(1, -1),\n        Vector2Utils.create(0, -1),\n        Vector2Utils.create(-1, -1),\n        Vector2Utils.create(-1, 0),\n        Vector2Utils.create(-1, 1),\n        Vector2Utils.create(0, 1),\n        Vector2Utils.create(1, 1),\n    ];\n    return UnweightedGridGraph;\n}());\nexport { UnweightedGridGraph };\n"],"names":["this"],"mappings":";;;;;;;;;;;;;AAAG,QAAC,YAAY,IAAI,YAAY;IAChC,IAAI,SAAS,YAAY,GAAG;IAC5B,IAAI;IACJ,IAAI,YAAY,CAAC,MAAM,GAAG,UAAU,CAAC,EAAE,CAAC,EAAE;IAC1C,QAAQ,IAAI,CAAC,CAAC,MAAM,EAAE;IACtB,YAAY,OAAO,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC;IAC9B,QAAQ;IACR,QAAQ,OAAO,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC;IACzC,IAAI,CAAC;IACL,IAAI,YAAY,CAAC,MAAM,GAAG,UAAU,CAAC,EAAE,CAAC,EAAE;IAC1C,QAAQ,OAAO,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE;IAC7B,IAAI,CAAC;IACL,IAAI,YAAY,CAAC,KAAK,GAAG,UAAU,MAAM,EAAE;IAC3C,QAAQ,OAAO,EAAE,CAAC,EAAE,MAAM,CAAC,CAAC,EAAE,CAAC,EAAE,MAAM,CAAC,CAAC,EAAE;IAC3C,IAAI,CAAC;IACL,IAAI,YAAY,CAAC,GAAG,GAAG,UAAU,CAAC,EAAE,CAAC,EAAE;IACvC,QAAQ,OAAO,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE;IAC7C,IAAI,CAAC;IACL,IAAI,YAAY,CAAC,iBAAiB,GAAG,UAAU,CAAC,EAAE,CAAC,EAAE;IACrD,QAAQ,OAAO,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;IACxD,IAAI,CAAC;IACL,IAAI,YAAY,CAAC,QAAQ,GAAG,UAAU,CAAC,EAAE,CAAC,EAAE;IAC5C,QAAQ,IAAI,EAAE,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;IAC1B,QAAQ,IAAI,EAAE,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;IAC1B,QAAQ,OAAO,IAAI,CAAC,IAAI,CAAC,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,CAAC;IAC3C,IAAI,CAAC;IACL,IAAI,YAAY,CAAC,MAAM,GAAG,UAAU,MAAM,EAAE;IAC5C,QAAQ,IAAI,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC,GAAG,IAAI,CAAC,SAAS,IAAI,CAAC;IAC/C,QAAQ,IAAI,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC,GAAG,IAAI,CAAC,SAAS,IAAI,CAAC;IAC/C,QAAQ,OAAO,CAAC,CAAC,IAAI,EAAE,IAAI,CAAC;IAC5B,IAAI,CAAC;IACL,IAAI,YAAY,CAAC,KAAK,GAAG,UAAU,MAAM,EAAE;IAC3C,QAAQ,OAAO,EAAE,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC;IACxD,IAAI,CAAC;IACL,IAAI,YAAY,CAAC,QAAQ,GAAG,UAAU,IAAI,EAAE;IAC5C,QAAQ,IAAI,CAAC,GAAG,CAAC,IAAI,IAAI,EAAE,IAAI,IAAI,CAAC,SAAS;IAC7C,QAAQ,IAAI,CAAC,GAAG,CAAC,IAAI,GAAG,MAAM,IAAI,IAAI,CAAC,SAAS;IAChD,QAAQ,OAAO,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE;IAC7B,IAAI,CAAC;IACL,IAAI,YAAY,CAAC,eAAe,GAAG,QAAQ;IAC3C,IAAI,YAAY,CAAC,SAAS,GAAG,KAAK;IAClC,IAAI,OAAO,YAAY;IACvB,CAAC,EAAE;;AC1CA,QAAC,aAAa,IAAI,YAAY;IACjC,IAAI,SAAS,aAAa,GAAG;IAC7B,QAAQ,IAAI,CAAC,KAAK,GAAG,EAAE;IACvB,QAAQ,IAAI,CAAC,KAAK,GAAG,CAAC;IACtB,IAAI;IACJ,IAAI,MAAM,CAAC,cAAc,CAAC,aAAa,CAAC,SAAS,EAAE,MAAM,EAAE;IAC3D,QAAQ,GAAG,EAAE,YAAY;IACzB,YAAY,OAAO,IAAI,CAAC,KAAK;IAC7B,QAAQ,CAAC;IACT,QAAQ,UAAU,EAAE,KAAK;IACzB,QAAQ,YAAY,EAAE;IACtB,KAAK,CAAC;IACN,IAAI,MAAM,CAAC,cAAc,CAAC,aAAa,CAAC,SAAS,EAAE,SAAS,EAAE;IAC9D,QAAQ,GAAG,EAAE,YAAY;IACzB,YAAY,OAAO,IAAI,CAAC,KAAK,KAAK,CAAC;IACnC,QAAQ,CAAC;IACT,QAAQ,UAAU,EAAE,KAAK;IACzB,QAAQ,YAAY,EAAE;IACtB,KAAK,CAAC;IACN,IAAI,aAAa,CAAC,SAAS,CAAC,KAAK,GAAG,YAAY;IAChD,QAAQ,IAAI,CAAC,KAAK,CAAC,MAAM,GAAG,CAAC;IAC7B,QAAQ,IAAI,CAAC,KAAK,GAAG,CAAC;IACtB,IAAI,CAAC;IACL,IAAI,aAAa,CAAC,SAAS,CAAC,OAAO,GAAG,UAAU,IAAI,EAAE;IACtD,QAAQ,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,GAAG,IAAI;IACrC,QAAQ,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,KAAK,CAAC;IAClC,QAAQ,IAAI,CAAC,KAAK,EAAE;IACpB,IAAI,CAAC;IACL,IAAI,aAAa,CAAC,SAAS,CAAC,OAAO,GAAG,YAAY;IAClD,QAAQ,IAAI,IAAI,CAAC,KAAK,KAAK,CAAC,EAAE;IAC9B,YAAY,OAAO,SAAS;IAC5B,QAAQ;IACR,QAAQ,IAAI,MAAM,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC;IAClC,QAAQ,IAAI,CAAC,KAAK,EAAE;IACpB,QAAQ,IAAI,IAAI,CAAC,KAAK,GAAG,CAAC,EAAE;IAC5B,YAAY,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC;IAClD,YAAY,IAAI,CAAC,WAAW,CAAC,CAAC,CAAC;IAC/B,QAAQ;IACR,QAAQ,OAAO,MAAM;IACrB,IAAI,CAAC;IACL,IAAI,aAAa,CAAC,SAAS,CAAC,IAAI,GAAG,YAAY;IAC/C,QAAQ,OAAO,IAAI,CAAC,KAAK,GAAG,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,GAAG,SAAS;IACzD,IAAI,CAAC;IACL,IAAI,aAAa,CAAC,SAAS,CAAC,SAAS,GAAG,UAAU,KAAK,EAAE;IACzD,QAAQ,OAAO,KAAK,GAAG,CAAC,EAAE;IAC1B,YAAY,IAAI,WAAW,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,KAAK,GAAG,CAAC,IAAI,CAAC,CAAC;IACzD,YAAY,IAAI,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,QAAQ,IAAI,IAAI,CAAC,KAAK,CAAC,WAAW,CAAC,CAAC,QAAQ,EAAE;IAChF,gBAAgB;IAChB,YAAY;IACZ,YAAY,IAAI,CAAC,KAAK,CAAC,KAAK,EAAE,WAAW,CAAC;IAC1C,YAAY,KAAK,GAAG,WAAW;IAC/B,QAAQ;IACR,IAAI,CAAC;IACL,IAAI,aAAa,CAAC,SAAS,CAAC,WAAW,GAAG,UAAU,KAAK,EAAE;IAC3D,QAAQ,OAAO,IAAI,EAAE;IACrB,YAAY,IAAI,QAAQ,GAAG,KAAK;IAChC,YAAY,IAAI,SAAS,GAAG,CAAC,GAAG,KAAK,GAAG,CAAC;IACzC,YAAY,IAAI,UAAU,GAAG,CAAC,GAAG,KAAK,GAAG,CAAC;IAC1C,YAAY,IAAI,SAAS,GAAG,IAAI,CAAC,KAAK;IACtC,gBAAgB,IAAI,CAAC,KAAK,CAAC,SAAS,CAAC,CAAC,QAAQ,GAAG,IAAI,CAAC,KAAK,CAAC,QAAQ,CAAC,CAAC,QAAQ,EAAE;IAChF,gBAAgB,QAAQ,GAAG,SAAS;IACpC,YAAY;IACZ,YAAY,IAAI,UAAU,GAAG,IAAI,CAAC,KAAK;IACvC,gBAAgB,IAAI,CAAC,KAAK,CAAC,UAAU,CAAC,CAAC,QAAQ,GAAG,IAAI,CAAC,KAAK,CAAC,QAAQ,CAAC,CAAC,QAAQ,EAAE;IACjF,gBAAgB,QAAQ,GAAG,UAAU;IACrC,YAAY;IACZ,YAAY,IAAI,QAAQ,KAAK,KAAK,EAAE;IACpC,gBAAgB;IAChB,YAAY;IACZ,YAAY,IAAI,CAAC,KAAK,CAAC,KAAK,EAAE,QAAQ,CAAC;IACvC,YAAY,KAAK,GAAG,QAAQ;IAC5B,QAAQ;IACR,IAAI,CAAC;IACL,IAAI,aAAa,CAAC,SAAS,CAAC,KAAK,GAAG,UAAU,CAAC,EAAE,CAAC,EAAE;IACpD,QAAQ,IAAI,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC;IAChC,QAAQ,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC;IACrC,QAAQ,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,GAAG,IAAI;IAC5B,IAAI,CAAC;IACL,IAAI,OAAO,aAAa;IACxB,CAAC,EAAE;;IC/EH,IAAI,aAAa,GAAG,CAACA,UAAI,IAAIA,UAAI,CAAC,aAAa,KAAK,UAAU,EAAE,EAAE,IAAI,EAAE,IAAI,EAAE;IAC9E,IAAI,IAAI,IAAI,IAAI,SAAS,CAAC,MAAM,KAAK,CAAC,EAAE,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,MAAM,EAAE,EAAE,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE;IACzF,QAAQ,IAAI,EAAE,IAAI,EAAE,CAAC,IAAI,IAAI,CAAC,EAAE;IAChC,YAAY,IAAI,CAAC,EAAE,EAAE,EAAE,GAAG,KAAK,CAAC,SAAS,CAAC,KAAK,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC,EAAE,CAAC,CAAC;IAChE,YAAY,EAAE,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC;IAC3B,QAAQ;IACR,IAAI;IACJ,IAAI,OAAO,EAAE,CAAC,MAAM,CAAC,EAAE,IAAI,KAAK,CAAC,SAAS,CAAC,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IAC5D,CAAC;IAGD,IAAI,SAAS,IAAI,YAAY;IAC7B,IAAI,SAAS,SAAS,CAAC,IAAI,EAAE,KAAK,EAAE,KAAK,EAAE,MAAM,EAAE;IACnD,QAAQ,IAAI,KAAK,KAAK,MAAM,EAAE,EAAE,KAAK,GAAG,CAAC,CAAC,CAAC;IAC3C,QAAQ,IAAI,KAAK,KAAK,MAAM,EAAE,EAAE,KAAK,GAAG,CAAC,CAAC,CAAC;IAC3C,QAAQ,IAAI,MAAM,KAAK,MAAM,EAAE,EAAE,MAAM,GAAG,IAAI,CAAC,CAAC;IAChD,QAAQ,IAAI,CAAC,QAAQ,GAAG,CAAC;IACzB,QAAQ,IAAI,CAAC,KAAK,GAAG,CAAC;IACtB,QAAQ,IAAI,CAAC,KAAK,GAAG,CAAC;IACtB,QAAQ,IAAI,CAAC,MAAM,GAAG,IAAI;IAC1B,QAAQ,IAAI,CAAC,IAAI,GAAG,CAAC;IACrB,QAAQ,IAAI,CAAC,IAAI,GAAG,IAAI;IACxB,QAAQ,IAAI,CAAC,KAAK,GAAG,KAAK;IAC1B,QAAQ,IAAI,CAAC,KAAK,GAAG,KAAK;IAC1B,QAAQ,IAAI,CAAC,QAAQ,GAAG,KAAK,GAAG,KAAK;IACrC,QAAQ,IAAI,CAAC,MAAM,GAAG,MAAM;IAC5B,QAAQ,IAAI,CAAC,IAAI,GAAG,YAAY,CAAC,MAAM,CAAC,IAAI,CAAC;IAC7C,IAAI;IACJ,IAAI,SAAS,CAAC,SAAS,CAAC,WAAW,GAAG,UAAU,KAAK,EAAE,KAAK,EAAE,MAAM,EAAE;IACtE,QAAQ,IAAI,MAAM,KAAK,MAAM,EAAE,EAAE,MAAM,GAAG,IAAI,CAAC,CAAC;IAChD,QAAQ,IAAI,CAAC,KAAK,GAAG,KAAK;IAC1B,QAAQ,IAAI,CAAC,KAAK,GAAG,KAAK;IAC1B,QAAQ,IAAI,CAAC,QAAQ,GAAG,KAAK,GAAG,KAAK;IACrC,QAAQ,IAAI,CAAC,MAAM,GAAG,MAAM;IAC5B,IAAI,CAAC;IACL,IAAI,SAAS,CAAC,SAAS,CAAC,UAAU,GAAG,UAAU,IAAI,EAAE,KAAK,EAAE,KAAK,EAAE,MAAM,EAAE;IAC3E,QAAQ,IAAI,KAAK,KAAK,MAAM,EAAE,EAAE,KAAK,GAAG,CAAC,CAAC,CAAC;IAC3C,QAAQ,IAAI,KAAK,KAAK,MAAM,EAAE,EAAE,KAAK,GAAG,CAAC,CAAC,CAAC;IAC3C,QAAQ,IAAI,MAAM,KAAK,MAAM,EAAE,EAAE,MAAM,GAAG,IAAI,CAAC,CAAC;IAChD,QAAQ,IAAI,CAAC,IAAI,GAAG,IAAI;IACxB,QAAQ,IAAI,CAAC,KAAK,GAAG,KAAK;IAC1B,QAAQ,IAAI,CAAC,KAAK,GAAG,KAAK;IAC1B,QAAQ,IAAI,CAAC,QAAQ,GAAG,KAAK,GAAG,KAAK;IACrC,QAAQ,IAAI,CAAC,MAAM,GAAG,MAAM;IAC5B,QAAQ,IAAI,CAAC,IAAI,GAAG,YAAY,CAAC,MAAM,CAAC,IAAI,CAAC;IAC7C,IAAI,CAAC;IACL,IAAI,SAAS,CAAC,SAAS,CAAC,KAAK,GAAG,YAAY;IAC5C,QAAQ,IAAI,CAAC,IAAI,GAAG,IAAI;IACxB,QAAQ,IAAI,CAAC,QAAQ,GAAG,CAAC;IACzB,QAAQ,IAAI,CAAC,KAAK,GAAG,CAAC;IACtB,QAAQ,IAAI,CAAC,KAAK,GAAG,CAAC;IACtB,QAAQ,IAAI,CAAC,MAAM,GAAG,IAAI;IAC1B,QAAQ,IAAI,CAAC,IAAI,GAAG,CAAC;IACrB,IAAI,CAAC;IACL,IAAI,OAAO,SAAS;IACpB,CAAC,EAAE,CAAC;AACD,QAAC,eAAe,IAAI,YAAY;IACnC,IAAI,SAAS,eAAe,GAAG;IAC/B,IAAI;IACJ,IAAI,eAAe,CAAC,QAAQ,GAAG,UAAU,IAAI,EAAE,KAAK,EAAE,KAAK,EAAE,MAAM,EAAE;IACrE,QAAQ,IAAI,KAAK,KAAK,MAAM,EAAE,EAAE,KAAK,GAAG,CAAC,CAAC,CAAC;IAC3C,QAAQ,IAAI,KAAK,KAAK,MAAM,EAAE,EAAE,KAAK,GAAG,CAAC,CAAC,CAAC;IAC3C,QAAQ,IAAI,MAAM,KAAK,MAAM,EAAE,EAAE,MAAM,GAAG,IAAI,CAAC,CAAC;IAChD,QAAQ,IAAI,SAAS,GAAG,IAAI,CAAC,SAAS,CAAC,GAAG,EAAE;IAC5C,QAAQ,IAAI,CAAC,SAAS,EAAE;IACxB,YAAY,SAAS,GAAG,IAAI,SAAS,CAAC,IAAI,EAAE,KAAK,EAAE,KAAK,EAAE,MAAM,CAAC;IACjE,QAAQ;IACR,aAAa;IACb,YAAY,SAAS,CAAC,UAAU,CAAC,IAAI,EAAE,KAAK,EAAE,KAAK,EAAE,MAAM,CAAC;IAC5D,QAAQ;IACR,QAAQ,OAAO,SAAS;IACxB,IAAI,CAAC;IACL,IAAI,eAAe,CAAC,YAAY,GAAG,UAAU,IAAI,EAAE;IACnD,QAAQ,IAAI,IAAI,CAAC,SAAS,CAAC,MAAM,GAAG,IAAI,EAAE;IAC1C,YAAY,IAAI,CAAC,KAAK,EAAE;IACxB,YAAY,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,IAAI,CAAC;IACrC,QAAQ;IACR,IAAI,CAAC;IACL,IAAI,eAAe,CAAC,MAAM,GAAG,UAAU,KAAK,EAAE,KAAK,EAAE,IAAI,EAAE;IAC3D,QAAQ,IAAI,OAAO,GAAG,IAAI,aAAa,EAAE;IACzC,QAAQ,IAAI,SAAS,GAAG,IAAI,GAAG,EAAE;IACjC,QAAQ,IAAI,UAAU,GAAG,IAAI,GAAG,EAAE;IAClC,QAAQ,IAAI,SAAS,GAAG,YAAY,CAAC,MAAM,CAAC,KAAK,CAAC;IAClD,QAAQ,IAAI,QAAQ,GAAG,YAAY,CAAC,MAAM,CAAC,IAAI,CAAC;IAChD,QAAQ,IAAI,SAAS,KAAK,QAAQ,EAAE;IACpC,YAAY,OAAO,EAAE,KAAK,EAAE,IAAI,EAAE,QAAQ,EAAE,IAAI,CAAC,QAAQ,CAAC,KAAK,EAAE,CAAC,EAAE,CAAC,CAAC,EAAE;IACxE,QAAQ;IACR,QAAQ,IAAI,CAAC,KAAK,CAAC,cAAc,CAAC,KAAK,CAAC,EAAE;IAC1C,YAAY,OAAO,EAAE,KAAK,EAAE,KAAK,EAAE,YAAY,EAAE,EAAE,EAAE;IACrD,QAAQ;IACR,QAAQ,IAAI,SAAS,GAAG,IAAI,CAAC,QAAQ,CAAC,KAAK,EAAE,CAAC,EAAE,KAAK,CAAC,SAAS,CAAC,KAAK,EAAE,IAAI,CAAC,CAAC;IAC7E,QAAQ,OAAO,CAAC,OAAO,CAAC,SAAS,CAAC;IAClC,QAAQ,UAAU,CAAC,GAAG,CAAC,SAAS,EAAE,SAAS,CAAC;IAC5C,QAAQ,IAAI,QAAQ;IACpB,QAAQ,IAAI,cAAc,GAAG,EAAE;IAC/B,QAAQ,OAAO,CAAC,OAAO,CAAC,OAAO,EAAE;IACjC,YAAY,IAAI,OAAO,GAAG,OAAO,CAAC,OAAO,EAAE;IAC3C,YAAY,IAAI,WAAW,GAAG,OAAO,CAAC,IAAI;IAC1C,YAAY,UAAU,CAAC,MAAM,CAAC,WAAW,CAAC;IAC1C,YAAY,IAAI,WAAW,KAAK,QAAQ,EAAE;IAC1C,gBAAgB,QAAQ,GAAG,OAAO;IAClC,gBAAgB;IAChB,YAAY;IACZ,YAAY,SAAS,CAAC,GAAG,CAAC,WAAW,CAAC;IACtC,YAAY,KAAK,IAAI,EAAE,GAAG,CAAC,EAAE,EAAE,GAAG,KAAK,CAAC,YAAY,CAAC,OAAO,CAAC,IAAI,CAAC,EAAE,EAAE,GAAG,EAAE,CAAC,MAAM,EAAE,EAAE,EAAE,EAAE;IAC1F,gBAAgB,IAAI,QAAQ,GAAG,EAAE,CAAC,EAAE,CAAC;IACrC,gBAAgB,IAAI,YAAY,GAAG,YAAY,CAAC,MAAM,CAAC,QAAQ,CAAC;IAChE,gBAAgB,IAAI,SAAS,CAAC,GAAG,CAAC,YAAY,CAAC,EAAE;IACjD,oBAAoB;IACpB,gBAAgB;IAChB,gBAAgB,IAAI,eAAe,GAAG,OAAO,CAAC,KAAK,GAAG,KAAK,CAAC,IAAI,CAAC,OAAO,CAAC,IAAI,EAAE,QAAQ,CAAC;IACxF,gBAAgB,IAAI,YAAY,GAAG,UAAU,CAAC,GAAG,CAAC,YAAY,CAAC;IAC/D,gBAAgB,IAAI,YAAY,EAAE;IAClC,oBAAoB,IAAI,eAAe,GAAG,YAAY,CAAC,KAAK,EAAE;IAC9D,wBAAwB,IAAI,KAAK,GAAG,YAAY,CAAC,KAAK;IACtD,wBAAwB,YAAY,CAAC,WAAW,CAAC,eAAe,EAAE,KAAK,EAAE,OAAO,CAAC;IACjF,oBAAoB;IACpB,gBAAgB;IAChB,qBAAqB;IACrB,oBAAoB,IAAI,KAAK,GAAG,KAAK,CAAC,SAAS,CAAC,QAAQ,EAAE,IAAI,CAAC;IAC/D,oBAAoB,IAAI,YAAY,GAAG,IAAI,CAAC,QAAQ,CAAC,QAAQ,EAAE,eAAe,EAAE,KAAK,EAAE,OAAO,CAAC;IAC/F,oBAAoB,OAAO,CAAC,OAAO,CAAC,YAAY,CAAC;IACjD,oBAAoB,UAAU,CAAC,GAAG,CAAC,YAAY,EAAE,YAAY,CAAC;IAC9D,gBAAgB;IAChB,YAAY;IACZ,YAAY,cAAc,CAAC,IAAI,CAAC,OAAO,CAAC;IACxC,QAAQ;IACR,QAAQ,IAAI,cAAc,GAAG,EAAE;IAC/B,QAAQ,OAAO,CAAC,OAAO,CAAC,OAAO,EAAE;IACjC,YAAY,cAAc,CAAC,IAAI,CAAC,OAAO,CAAC,OAAO,EAAE,CAAC;IAClD,QAAQ;IACR,QAAQ,IAAI,iBAAiB,GAAG,aAAa,CAAC,aAAa,CAAC,EAAE,EAAE,cAAc,EAAE,IAAI,CAAC,EAAE,cAAc,EAAE,IAAI,CAAC;IAC5G,QAAQ,OAAO,EAAE,KAAK,EAAE,CAAC,CAAC,QAAQ,EAAE,QAAQ,EAAE,QAAQ,EAAE,YAAY,EAAE,iBAAiB,EAAE;IACzF,IAAI,CAAC;IACL,IAAI,eAAe,CAAC,UAAU,GAAG,UAAU,KAAK,EAAE,KAAK,EAAE,IAAI,EAAE;IAC/D,QAAQ,IAAI,MAAM,GAAG,IAAI,CAAC,MAAM,CAAC,KAAK,EAAE,KAAK,EAAE,IAAI,CAAC;IACpD,QAAQ,IAAI,CAAC,MAAM,CAAC,KAAK,IAAI,CAAC,MAAM,CAAC,QAAQ,EAAE;IAC/C,YAAY,IAAI,MAAM,CAAC,YAAY,EAAE;IACrC,gBAAgB,KAAK,IAAI,EAAE,GAAG,CAAC,EAAE,EAAE,GAAG,MAAM,CAAC,YAAY,EAAE,EAAE,GAAG,EAAE,CAAC,MAAM,EAAE,EAAE,EAAE,EAAE;IACjF,oBAAoB,IAAI,IAAI,GAAG,EAAE,CAAC,EAAE,CAAC;IACrC,oBAAoB,IAAI,CAAC,YAAY,CAAC,IAAI,CAAC;IAC3C,gBAAgB;IAChB,YAAY;IACZ,YAAY,OAAO,EAAE;IACrB,QAAQ;IACR,QAAQ,IAAI,IAAI,GAAG,IAAI,CAAC,uBAAuB,CAAC,MAAM,CAAC,QAAQ,CAAC;IAChE,QAAQ,IAAI,MAAM,CAAC,YAAY,EAAE;IACjC,YAAY,KAAK,IAAI,EAAE,GAAG,CAAC,EAAE,EAAE,GAAG,MAAM,CAAC,YAAY,EAAE,EAAE,GAAG,EAAE,CAAC,MAAM,EAAE,EAAE,EAAE,EAAE;IAC7E,gBAAgB,IAAI,IAAI,GAAG,EAAE,CAAC,EAAE,CAAC;IACjC,gBAAgB,IAAI,CAAC,YAAY,CAAC,IAAI,CAAC;IACvC,YAAY;IACZ,QAAQ;IACR,QAAQ,OAAO,IAAI;IACnB,IAAI,CAAC;IACL,IAAI,eAAe,CAAC,uBAAuB,GAAG,UAAU,QAAQ,EAAE;IAClE,QAAQ,IAAI,CAAC,SAAS,CAAC,MAAM,GAAG,CAAC;IACjC,QAAQ,IAAI,OAAO,GAAG,QAAQ;IAC9B,QAAQ,OAAO,OAAO,EAAE;IACxB,YAAY,IAAI,CAAC,SAAS,CAAC,OAAO,CAAC,OAAO,CAAC,IAAI,CAAC;IAChD,YAAY,OAAO,GAAG,OAAO,CAAC,MAAM;IACpC,QAAQ;IACR,QAAQ,OAAO,aAAa,CAAC,EAAE,EAAE,IAAI,CAAC,SAAS,EAAE,IAAI,CAAC;IACtD,IAAI,CAAC;IACL,IAAI,eAAe,CAAC,OAAO,GAAG,UAAU,KAAK,EAAE,KAAK,EAAE,IAAI,EAAE;IAC5D,QAAQ,IAAI,MAAM,GAAG,IAAI,CAAC,MAAM,CAAC,KAAK,EAAE,KAAK,EAAE,IAAI,CAAC;IACpD,QAAQ,IAAI,MAAM,CAAC,QAAQ,EAAE;IAC7B,YAAY,IAAI,CAAC,YAAY,CAAC,MAAM,CAAC,QAAQ,CAAC;IAC9C,QAAQ;IACR,QAAQ,IAAI,MAAM,CAAC,YAAY,EAAE;IACjC,YAAY,KAAK,IAAI,EAAE,GAAG,CAAC,EAAE,EAAE,GAAG,MAAM,CAAC,YAAY,EAAE,EAAE,GAAG,EAAE,CAAC,MAAM,EAAE,EAAE,EAAE,EAAE;IAC7E,gBAAgB,IAAI,IAAI,GAAG,EAAE,CAAC,EAAE,CAAC;IACjC,gBAAgB,IAAI,IAAI,KAAK,MAAM,CAAC,QAAQ,EAAE;IAC9C,oBAAoB,IAAI,CAAC,YAAY,CAAC,IAAI,CAAC;IAC3C,gBAAgB;IAChB,YAAY;IACZ,QAAQ;IACR,QAAQ,OAAO,MAAM,CAAC,KAAK;IAC3B,IAAI,CAAC;IACL,IAAI,eAAe,CAAC,SAAS,GAAG,YAAY;IAC5C,QAAQ,IAAI,CAAC,SAAS,CAAC,MAAM,GAAG,CAAC;IACjC,QAAQ,IAAI,CAAC,SAAS,CAAC,MAAM,GAAG,CAAC;IACjC,IAAI,CAAC;IACL,IAAI,eAAe,CAAC,YAAY,GAAG,YAAY;IAC/C,QAAQ,OAAO;IACf,YAAY,QAAQ,EAAE,IAAI,CAAC,SAAS,CAAC,MAAM;IAC3C,YAAY,WAAW,EAAE;IACzB,SAAS;IACT,IAAI,CAAC;IACL,IAAI,eAAe,CAAC,SAAS,GAAG,EAAE;IAClC,IAAI,eAAe,CAAC,SAAS,GAAG,EAAE;IAClC,IAAI,OAAO,eAAe;IAC1B,CAAC,EAAE;;AC7LA,QAAC,cAAc,IAAI,YAAY;IAClC,IAAI,SAAS,cAAc,CAAC,KAAK,EAAE,MAAM,EAAE;IAC3C,QAAQ,IAAI,CAAC,IAAI,GAAG;IACpB,YAAY,YAAY,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC;IACrC,YAAY,YAAY,CAAC,MAAM,CAAC,CAAC,EAAE,EAAE,CAAC;IACtC,YAAY,YAAY,CAAC,MAAM,CAAC,EAAE,EAAE,CAAC,CAAC;IACtC,YAAY,YAAY,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC;IACpC,SAAS;IACT,QAAQ,IAAI,CAAC,KAAK,GAAG,EAAE;IACvB,QAAQ,IAAI,CAAC,aAAa,GAAG,EAAE;IAC/B,QAAQ,IAAI,CAAC,aAAa,GAAG,CAAC;IAC9B,QAAQ,IAAI,CAAC,kBAAkB,GAAG,CAAC;IACnC,QAAQ,IAAI,CAAC,UAAU,GAAG,IAAI,KAAK,CAAC,CAAC,CAAC;IACtC,QAAQ,IAAI,CAAC,SAAS,GAAG,IAAI,GAAG,EAAE;IAClC,QAAQ,IAAI,CAAC,iBAAiB,GAAG,IAAI,GAAG,EAAE;IAC1C,QAAQ,IAAI,CAAC,WAAW,GAAG,IAAI;IAC/B,QAAQ,IAAI,CAAC,mBAAmB,GAAG,IAAI;IACvC,QAAQ,IAAI,CAAC,MAAM,GAAG,KAAK;IAC3B,QAAQ,IAAI,CAAC,OAAO,GAAG,MAAM;IAC7B,IAAI;IACJ,IAAI,cAAc,CAAC,SAAS,CAAC,OAAO,GAAG,UAAU,IAAI,EAAE;IACvD,QAAQ,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC;IAC7B,QAAQ,IAAI,CAAC,WAAW,GAAG,IAAI;IAC/B,IAAI,CAAC;IACL,IAAI,cAAc,CAAC,SAAS,CAAC,QAAQ,GAAG,UAAU,KAAK,EAAE;IACzD,QAAQ,IAAI,EAAE;IACd,QAAQ,CAAC,EAAE,GAAG,IAAI,CAAC,KAAK,EAAE,IAAI,CAAC,KAAK,CAAC,EAAE,EAAE,KAAK,CAAC;IAC/C,QAAQ,IAAI,CAAC,WAAW,GAAG,IAAI;IAC/B,IAAI,CAAC;IACL,IAAI,cAAc,CAAC,SAAS,CAAC,UAAU,GAAG,YAAY;IACtD,QAAQ,IAAI,CAAC,KAAK,CAAC,MAAM,GAAG,CAAC;IAC7B,QAAQ,IAAI,CAAC,SAAS,CAAC,KAAK,EAAE;IAC9B,QAAQ,IAAI,CAAC,WAAW,GAAG,KAAK;IAChC,IAAI,CAAC;IACL,IAAI,cAAc,CAAC,SAAS,CAAC,eAAe,GAAG,UAAU,IAAI,EAAE;IAC/D,QAAQ,IAAI,CAAC,aAAa,CAAC,IAAI,CAAC,IAAI,CAAC;IACrC,QAAQ,IAAI,CAAC,mBAAmB,GAAG,IAAI;IACvC,IAAI,CAAC;IACL,IAAI,cAAc,CAAC,SAAS,CAAC,gBAAgB,GAAG,UAAU,KAAK,EAAE;IACjE,QAAQ,IAAI,EAAE;IACd,QAAQ,CAAC,EAAE,GAAG,IAAI,CAAC,aAAa,EAAE,IAAI,CAAC,KAAK,CAAC,EAAE,EAAE,KAAK,CAAC;IACvD,QAAQ,IAAI,CAAC,mBAAmB,GAAG,IAAI;IACvC,IAAI,CAAC;IACL,IAAI,cAAc,CAAC,SAAS,CAAC,kBAAkB,GAAG,YAAY;IAC9D,QAAQ,IAAI,CAAC,aAAa,CAAC,MAAM,GAAG,CAAC;IACrC,QAAQ,IAAI,CAAC,iBAAiB,CAAC,KAAK,EAAE;IACtC,QAAQ,IAAI,CAAC,mBAAmB,GAAG,KAAK;IACxC,IAAI,CAAC;IACL,IAAI,cAAc,CAAC,SAAS,CAAC,eAAe,GAAG,YAAY;IAC3D,QAAQ,IAAI,IAAI,CAAC,WAAW,EAAE;IAC9B,YAAY,IAAI,CAAC,SAAS,CAAC,KAAK,EAAE;IAClC,YAAY,KAAK,IAAI,EAAE,GAAG,CAAC,EAAE,EAAE,GAAG,IAAI,CAAC,KAAK,EAAE,EAAE,GAAG,EAAE,CAAC,MAAM,EAAE,EAAE,EAAE,EAAE;IACpE,gBAAgB,IAAI,IAAI,GAAG,EAAE,CAAC,EAAE,CAAC;IACjC,gBAAgB,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,YAAY,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;IAC7D,YAAY;IACZ,YAAY,IAAI,CAAC,WAAW,GAAG,KAAK;IACpC,QAAQ;IACR,QAAQ,IAAI,IAAI,CAAC,mBAAmB,EAAE;IACtC,YAAY,IAAI,CAAC,iBAAiB,CAAC,KAAK,EAAE;IAC1C,YAAY,KAAK,IAAI,EAAE,GAAG,CAAC,EAAE,EAAE,GAAG,IAAI,CAAC,aAAa,EAAE,EAAE,GAAG,EAAE,CAAC,MAAM,EAAE,EAAE,EAAE,EAAE;IAC5E,gBAAgB,IAAI,IAAI,GAAG,EAAE,CAAC,EAAE,CAAC;IACjC,gBAAgB,IAAI,CAAC,iBAAiB,CAAC,GAAG,CAAC,YAAY,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;IACrE,YAAY;IACZ,YAAY,IAAI,CAAC,mBAAmB,GAAG,KAAK;IAC5C,QAAQ;IACR,IAAI,CAAC;IACL,IAAI,cAAc,CAAC,SAAS,CAAC,cAAc,GAAG,UAAU,IAAI,EAAE;IAC9D,QAAQ,OAAO,CAAC,IAAI,IAAI,CAAC,CAAC,IAAI,IAAI,CAAC,CAAC,GAAG,IAAI,CAAC,MAAM,IAAI,CAAC,IAAI,IAAI,CAAC,CAAC,IAAI,IAAI,CAAC,CAAC,GAAG,IAAI,CAAC,OAAO;IAC1F,IAAI,CAAC;IACL,IAAI,cAAc,CAAC,SAAS,CAAC,cAAc,GAAG,UAAU,IAAI,EAAE;IAC9D,QAAQ,IAAI,CAAC,eAAe,EAAE;IAC9B,QAAQ,OAAO,CAAC,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,YAAY,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;IAC7D,IAAI,CAAC;IACL,IAAI,cAAc,CAAC,SAAS,CAAC,MAAM,GAAG,UAAU,KAAK,EAAE,IAAI,EAAE;IAC7D,QAAQ,OAAO,eAAe,CAAC,OAAO,CAAC,IAAI,EAAE,KAAK,EAAE,IAAI,CAAC;IACzD,IAAI,CAAC;IACL,IAAI,cAAc,CAAC,SAAS,CAAC,UAAU,GAAG,UAAU,KAAK,EAAE,IAAI,EAAE;IACjE,QAAQ,OAAO,eAAe,CAAC,UAAU,CAAC,IAAI,EAAE,KAAK,EAAE,IAAI,CAAC;IAC5D,IAAI,CAAC;IACL,IAAI,cAAc,CAAC,SAAS,CAAC,YAAY,GAAG,UAAU,IAAI,EAAE;IAC5D,QAAQ,IAAI,CAAC,UAAU,CAAC,MAAM,GAAG,CAAC;IAClC,QAAQ,KAAK,IAAI,EAAE,GAAG,CAAC,EAAE,EAAE,GAAG,IAAI,CAAC,IAAI,EAAE,EAAE,GAAG,EAAE,CAAC,MAAM,EAAE,EAAE,EAAE,EAAE;IAC/D,YAAY,IAAI,GAAG,GAAG,EAAE,CAAC,EAAE,CAAC;IAC5B,YAAY,IAAI,IAAI,GAAG,YAAY,CAAC,GAAG,CAAC,IAAI,EAAE,GAAG,CAAC;IAClD,YAAY,IAAI,IAAI,CAAC,cAAc,CAAC,IAAI,CAAC,IAAI,IAAI,CAAC,cAAc,CAAC,IAAI,CAAC,EAAE;IACxE,gBAAgB,IAAI,CAAC,UAAU,CAAC,IAAI,CAAC,IAAI,CAAC;IAC1C,YAAY;IACZ,QAAQ;IACR,QAAQ,OAAO,IAAI,CAAC,UAAU;IAC9B,IAAI,CAAC;IACL,IAAI,cAAc,CAAC,SAAS,CAAC,IAAI,GAAG,UAAU,IAAI,EAAE,EAAE,EAAE;IACxD,QAAQ,IAAI,CAAC,eAAe,EAAE;IAC9B,QAAQ,OAAO,IAAI,CAAC,iBAAiB,CAAC,GAAG,CAAC,YAAY,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC,GAAG,IAAI,CAAC,kBAAkB,GAAG,IAAI,CAAC,aAAa;IACjH,IAAI,CAAC;IACL,IAAI,cAAc,CAAC,SAAS,CAAC,SAAS,GAAG,UAAU,IAAI,EAAE,IAAI,EAAE;IAC/D,QAAQ,OAAO,YAAY,CAAC,iBAAiB,CAAC,IAAI,EAAE,IAAI,CAAC;IACzD,IAAI,CAAC;IACL,IAAI,cAAc,CAAC,SAAS,CAAC,QAAQ,GAAG,YAAY;IACpD,QAAQ,IAAI,CAAC,eAAe,EAAE;IAC9B,QAAQ,OAAO;IACf,YAAY,KAAK,EAAE,IAAI,CAAC,KAAK,CAAC,MAAM;IACpC,YAAY,aAAa,EAAE,IAAI,CAAC,aAAa,CAAC,MAAM;IACpD,YAAY,QAAQ,EAAE,EAAE,CAAC,MAAM,CAAC,IAAI,CAAC,MAAM,EAAE,GAAG,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,OAAO,CAAC;IACtE,YAAY,YAAY,EAAE,IAAI,CAAC,SAAS,CAAC,IAAI;IAC7C,YAAY,oBAAoB,EAAE,IAAI,CAAC,iBAAiB,CAAC;IACzD,SAAS;IACT,IAAI,CAAC;IACL,IAAI,OAAO,cAAc;IACzB,CAAC,EAAE;;AC7GA,QAAC,sBAAsB,IAAI,YAAY;IAC1C,IAAI,SAAS,sBAAsB,GAAG;IACtC,IAAI;IACJ,IAAI,sBAAsB,CAAC,MAAM,GAAG,UAAU,KAAK,EAAE,KAAK,EAAE,IAAI,EAAE,QAAQ,EAAE;IAC5E,QAAQ,IAAI,QAAQ,GAAG,EAAE;IACzB,QAAQ,IAAI,OAAO,GAAG,IAAI,GAAG,EAAE;IAC/B,QAAQ,IAAI,OAAO,GAAG,QAAQ,IAAI,IAAI,GAAG,EAAE;IAC3C,QAAQ,IAAI,SAAS,GAAG,YAAY,CAAC,MAAM,CAAC,KAAK,CAAC;IAClD,QAAQ,IAAI,QAAQ,GAAG,YAAY,CAAC,MAAM,CAAC,IAAI,CAAC;IAChD,QAAQ,IAAI,SAAS,KAAK,QAAQ,EAAE;IACpC,YAAY,OAAO,IAAI;IACvB,QAAQ;IACR,QAAQ,QAAQ,CAAC,IAAI,CAAC,KAAK,CAAC;IAC5B,QAAQ,OAAO,CAAC,GAAG,CAAC,SAAS,CAAC;IAC9B,QAAQ,OAAO,QAAQ,CAAC,MAAM,GAAG,CAAC,EAAE;IACpC,YAAY,IAAI,OAAO,GAAG,QAAQ,CAAC,KAAK,EAAE;IAC1C,YAAY,IAAI,WAAW,GAAG,YAAY,CAAC,MAAM,CAAC,OAAO,CAAC;IAC1D,YAAY,IAAI,WAAW,KAAK,QAAQ,EAAE;IAC1C,gBAAgB,OAAO,IAAI;IAC3B,YAAY;IACZ,YAAY,KAAK,IAAI,EAAE,GAAG,CAAC,EAAE,EAAE,GAAG,KAAK,CAAC,YAAY,CAAC,OAAO,CAAC,EAAE,EAAE,GAAG,EAAE,CAAC,MAAM,EAAE,EAAE,EAAE,EAAE;IACrF,gBAAgB,IAAI,QAAQ,GAAG,EAAE,CAAC,EAAE,CAAC;IACrC,gBAAgB,IAAI,YAAY,GAAG,YAAY,CAAC,MAAM,CAAC,QAAQ,CAAC;IAChE,gBAAgB,IAAI,OAAO,CAAC,GAAG,CAAC,YAAY,CAAC,EAAE;IAC/C,oBAAoB;IACpB,gBAAgB;IAChB,gBAAgB,OAAO,CAAC,GAAG,CAAC,YAAY,CAAC;IACzC,gBAAgB,OAAO,CAAC,GAAG,CAAC,YAAY,EAAE,OAAO,CAAC;IAClD,gBAAgB,QAAQ,CAAC,IAAI,CAAC,QAAQ,CAAC;IACvC,YAAY;IACZ,QAAQ;IACR,QAAQ,OAAO,KAAK;IACpB,IAAI,CAAC;IACL,IAAI,sBAAsB,CAAC,UAAU,GAAG,UAAU,KAAK,EAAE,KAAK,EAAE,IAAI,EAAE;IACtE,QAAQ,IAAI,QAAQ,GAAG,IAAI,GAAG,EAAE;IAChC,QAAQ,IAAI,IAAI,CAAC,MAAM,CAAC,KAAK,EAAE,KAAK,EAAE,IAAI,EAAE,QAAQ,CAAC,EAAE;IACvD,YAAY,OAAO,IAAI,CAAC,eAAe,CAAC,QAAQ,EAAE,KAAK,EAAE,IAAI,CAAC;IAC9D,QAAQ;IACR,QAAQ,OAAO,EAAE;IACjB,IAAI,CAAC;IACL,IAAI,sBAAsB,CAAC,eAAe,GAAG,UAAU,QAAQ,EAAE,KAAK,EAAE,IAAI,EAAE;IAC9E,QAAQ,IAAI,IAAI,GAAG,EAAE;IACrB,QAAQ,IAAI,OAAO,GAAG,IAAI;IAC1B,QAAQ,IAAI,SAAS,GAAG,YAAY,CAAC,MAAM,CAAC,KAAK,CAAC;IAClD,QAAQ,OAAO,YAAY,CAAC,MAAM,CAAC,OAAO,CAAC,KAAK,SAAS,EAAE;IAC3D,YAAY,IAAI,CAAC,OAAO,CAAC,OAAO,CAAC;IACjC,YAAY,IAAI,WAAW,GAAG,YAAY,CAAC,MAAM,CAAC,OAAO,CAAC;IAC1D,YAAY,IAAI,QAAQ,GAAG,QAAQ,CAAC,GAAG,CAAC,WAAW,CAAC;IACpD,YAAY,IAAI,CAAC,QAAQ;IACzB,gBAAgB;IAChB,YAAY,OAAO,GAAG,QAAQ;IAC9B,QAAQ;IACR,QAAQ,IAAI,CAAC,OAAO,CAAC,KAAK,CAAC;IAC3B,QAAQ,OAAO,IAAI;IACnB,IAAI,CAAC;IACL,IAAI,OAAO,sBAAsB;IACjC,CAAC,EAAE;;ACzDA,QAAC,eAAe,IAAI,YAAY;IACnC,IAAI,SAAS,eAAe,GAAG;IAC/B,QAAQ,IAAI,CAAC,KAAK,GAAG,IAAI,GAAG,EAAE;IAC9B,IAAI;IACJ,IAAI,eAAe,CAAC,SAAS,CAAC,eAAe,GAAG,UAAU,IAAI,EAAE,SAAS,EAAE;IAC3E,QAAQ,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,IAAI,EAAE,SAAS,CAAC;IACvC,QAAQ,OAAO,IAAI;IACnB,IAAI,CAAC;IACL,IAAI,eAAe,CAAC,SAAS,CAAC,YAAY,GAAG,UAAU,IAAI,EAAE;IAC7D,QAAQ,OAAO,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,EAAE;IACzC,IAAI,CAAC;IACL,IAAI,OAAO,eAAe;IAC1B,CAAC,EAAE;;ACVA,QAAC,mBAAmB,IAAI,YAAY;IACvC,IAAI,SAAS,mBAAmB,CAAC,KAAK,EAAE,MAAM,EAAE,mBAAmB,EAAE;IACrE,QAAQ,IAAI,mBAAmB,KAAK,MAAM,EAAE,EAAE,mBAAmB,GAAG,KAAK,CAAC,CAAC;IAC3E,QAAQ,IAAI,CAAC,KAAK,GAAG,EAAE;IACvB,QAAQ,IAAI,CAAC,UAAU,GAAG,EAAE;IAC5B,QAAQ,IAAI,CAAC,MAAM,GAAG,KAAK;IAC3B,QAAQ,IAAI,CAAC,OAAO,GAAG,MAAM;IAC7B,QAAQ,IAAI,CAAC,KAAK,GAAG,mBAAmB,GAAG,mBAAmB,CAAC,YAAY,GAAG,mBAAmB,CAAC,aAAa;IAC/G,IAAI;IACJ,IAAI,mBAAmB,CAAC,SAAS,CAAC,cAAc,GAAG,UAAU,IAAI,EAAE;IACnE,QAAQ,OAAO,CAAC,IAAI,IAAI,CAAC,CAAC,IAAI,IAAI,CAAC,CAAC,GAAG,IAAI,CAAC,MAAM,IAAI,CAAC,IAAI,IAAI,CAAC,CAAC,IAAI,IAAI,CAAC,CAAC,GAAG,IAAI,CAAC,OAAO;IAC1F,IAAI,CAAC;IACL,IAAI,mBAAmB,CAAC,SAAS,CAAC,cAAc,GAAG,UAAU,IAAI,EAAE;IACnE,QAAQ,OAAO,CAAC,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,UAAU,IAAI,EAAE,EAAE,OAAO,YAAY,CAAC,MAAM,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC;IAC5F,IAAI,CAAC;IACL,IAAI,mBAAmB,CAAC,SAAS,CAAC,YAAY,GAAG,UAAU,IAAI,EAAE;IACjE,QAAQ,IAAI,CAAC,UAAU,CAAC,MAAM,GAAG,CAAC;IAClC,QAAQ,KAAK,IAAI,EAAE,GAAG,CAAC,EAAE,EAAE,GAAG,IAAI,CAAC,KAAK,EAAE,EAAE,GAAG,EAAE,CAAC,MAAM,EAAE,EAAE,EAAE,EAAE;IAChE,YAAY,IAAI,GAAG,GAAG,EAAE,CAAC,EAAE,CAAC;IAC5B,YAAY,IAAI,IAAI,GAAG,YAAY,CAAC,GAAG,CAAC,IAAI,EAAE,GAAG,CAAC;IAClD,YAAY,IAAI,IAAI,CAAC,cAAc,CAAC,IAAI,CAAC,IAAI,IAAI,CAAC,cAAc,CAAC,IAAI,CAAC,EAAE;IACxE,gBAAgB,IAAI,CAAC,UAAU,CAAC,IAAI,CAAC,IAAI,CAAC;IAC1C,YAAY;IACZ,QAAQ;IACR,QAAQ,OAAO,IAAI,CAAC,UAAU;IAC9B,IAAI,CAAC;IACL,IAAI,mBAAmB,CAAC,SAAS,CAAC,UAAU,GAAG,UAAU,KAAK,EAAE,IAAI,EAAE;IACtE,QAAQ,OAAO,sBAAsB,CAAC,UAAU,CAAC,IAAI,EAAE,KAAK,EAAE,IAAI,CAAC;IACnE,IAAI,CAAC;IACL,IAAI,mBAAmB,CAAC,SAAS,CAAC,OAAO,GAAG,UAAU,KAAK,EAAE,IAAI,EAAE;IACnE,QAAQ,OAAO,sBAAsB,CAAC,MAAM,CAAC,IAAI,EAAE,KAAK,EAAE,IAAI,CAAC;IAC/D,IAAI,CAAC;IACL,IAAI,mBAAmB,CAAC,aAAa,GAAG;IACxC,QAAQ,YAAY,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC;IACjC,QAAQ,YAAY,CAAC,MAAM,CAAC,CAAC,EAAE,EAAE,CAAC;IAClC,QAAQ,YAAY,CAAC,MAAM,CAAC,EAAE,EAAE,CAAC,CAAC;IAClC,QAAQ,YAAY,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC;IAChC,KAAK;IACL,IAAI,mBAAmB,CAAC,YAAY,GAAG;IACvC,QAAQ,YAAY,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC;IACjC,QAAQ,YAAY,CAAC,MAAM,CAAC,CAAC,EAAE,EAAE,CAAC;IAClC,QAAQ,YAAY,CAAC,MAAM,CAAC,CAAC,EAAE,EAAE,CAAC;IAClC,QAAQ,YAAY,CAAC,MAAM,CAAC,EAAE,EAAE,EAAE,CAAC;IACnC,QAAQ,YAAY,CAAC,MAAM,CAAC,EAAE,EAAE,CAAC,CAAC;IAClC,QAAQ,YAAY,CAAC,MAAM,CAAC,EAAE,EAAE,CAAC,CAAC;IAClC,QAAQ,YAAY,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC;IACjC,QAAQ,YAAY,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC;IACjC,KAAK;IACL,IAAI,OAAO,mBAAmB;IAC9B,CAAC,EAAE;;;;;;;;;;;;;;"}