@nice2dev/game-engine 0.1.0

package/dist/cjs/node_modules/@microsoft/signalr/dist/esm/XhrHttpClient.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"XhrHttpClient.js","sources":["../../../../../../../../node_modules/@microsoft/signalr/dist/esm/XhrHttpClient.js"],"sourcesContent":["// Licensed to the .NET Foundation under one or more agreements.\r\n// The .NET Foundation licenses this file to you under the MIT license.\r\nimport { AbortError, HttpError, TimeoutError } from \"./Errors\";\r\nimport { HttpClient, HttpResponse } from \"./HttpClient\";\r\nimport { LogLevel } from \"./ILogger\";\r\nimport { isArrayBuffer } from \"./Utils\";\r\nexport class XhrHttpClient extends HttpClient {\r\n    constructor(logger) {\r\n        super();\r\n        this._logger = logger;\r\n    }\r\n    /** @inheritDoc */\r\n    send(request) {\r\n        // Check that abort was not signaled before calling send\r\n        if (request.abortSignal && request.abortSignal.aborted) {\r\n            return Promise.reject(new AbortError());\r\n        }\r\n        if (!request.method) {\r\n            return Promise.reject(new Error(\"No method defined.\"));\r\n        }\r\n        if (!request.url) {\r\n            return Promise.reject(new Error(\"No url defined.\"));\r\n        }\r\n        return new Promise((resolve, reject) => {\r\n            const xhr = new XMLHttpRequest();\r\n            xhr.open(request.method, request.url, true);\r\n            xhr.withCredentials = request.withCredentials === undefined ? true : request.withCredentials;\r\n            xhr.setRequestHeader(\"X-Requested-With\", \"XMLHttpRequest\");\r\n            if (request.content === \"\") {\r\n                request.content = undefined;\r\n            }\r\n            if (request.content) {\r\n                // Explicitly setting the Content-Type header for React Native on Android platform.\r\n                if (isArrayBuffer(request.content)) {\r\n                    xhr.setRequestHeader(\"Content-Type\", \"application/octet-stream\");\r\n                }\r\n                else {\r\n                    xhr.setRequestHeader(\"Content-Type\", \"text/plain;charset=UTF-8\");\r\n                }\r\n            }\r\n            const headers = request.headers;\r\n            if (headers) {\r\n                Object.keys(headers)\r\n                    .forEach((header) => {\r\n                    xhr.setRequestHeader(header, headers[header]);\r\n                });\r\n            }\r\n            if (request.responseType) {\r\n                xhr.responseType = request.responseType;\r\n            }\r\n            if (request.abortSignal) {\r\n                request.abortSignal.onabort = () => {\r\n                    xhr.abort();\r\n                    reject(new AbortError());\r\n                };\r\n            }\r\n            if (request.timeout) {\r\n                xhr.timeout = request.timeout;\r\n            }\r\n            xhr.onload = () => {\r\n                if (request.abortSignal) {\r\n                    request.abortSignal.onabort = null;\r\n                }\r\n                if (xhr.status >= 200 && xhr.status < 300) {\r\n                    resolve(new HttpResponse(xhr.status, xhr.statusText, xhr.response || xhr.responseText));\r\n                }\r\n                else {\r\n                    reject(new HttpError(xhr.response || xhr.responseText || xhr.statusText, xhr.status));\r\n                }\r\n            };\r\n            xhr.onerror = () => {\r\n                this._logger.log(LogLevel.Warning, `Error from HTTP request. ${xhr.status}: ${xhr.statusText}.`);\r\n                reject(new HttpError(xhr.statusText, xhr.status));\r\n            };\r\n            xhr.ontimeout = () => {\r\n                this._logger.log(LogLevel.Warning, `Timeout from HTTP request.`);\r\n                reject(new TimeoutError());\r\n            };\r\n            xhr.send(request.content);\r\n        });\r\n    }\r\n}\r\n//# sourceMappingURL=XhrHttpClient.js.map"],"names":["HttpClient","AbortError","isArrayBuffer","HttpResponse","HttpError","LogLevel","TimeoutError"],"mappings":";;;;;;;AAAA;AACA;AAKO,MAAM,aAAa,SAASA,qBAAU,CAAC;AAC9C,IAAI,WAAW,CAAC,MAAM,EAAE;AACxB,QAAQ,KAAK,EAAE,CAAC;AAChB,QAAQ,IAAI,CAAC,OAAO,GAAG,MAAM,CAAC;AAC9B,IAAI,CAAC;AACL;AACA,IAAI,IAAI,CAAC,OAAO,EAAE;AAClB;AACA,QAAQ,IAAI,OAAO,CAAC,WAAW,IAAI,OAAO,CAAC,WAAW,CAAC,OAAO,EAAE;AAChE,YAAY,OAAO,OAAO,CAAC,MAAM,CAAC,IAAIC,iBAAU,EAAE,CAAC,CAAC;AACpD,QAAQ,CAAC;AACT,QAAQ,IAAI,CAAC,OAAO,CAAC,MAAM,EAAE;AAC7B,YAAY,OAAO,OAAO,CAAC,MAAM,CAAC,IAAI,KAAK,CAAC,oBAAoB,CAAC,CAAC,CAAC;AACnE,QAAQ,CAAC;AACT,QAAQ,IAAI,CAAC,OAAO,CAAC,GAAG,EAAE;AAC1B,YAAY,OAAO,OAAO,CAAC,MAAM,CAAC,IAAI,KAAK,CAAC,iBAAiB,CAAC,CAAC,CAAC;AAChE,QAAQ,CAAC;AACT,QAAQ,OAAO,IAAI,OAAO,CAAC,CAAC,OAAO,EAAE,MAAM,KAAK;AAChD,YAAY,MAAM,GAAG,GAAG,IAAI,cAAc,EAAE,CAAC;AAC7C,YAAY,GAAG,CAAC,IAAI,CAAC,OAAO,CAAC,MAAM,EAAE,OAAO,CAAC,GAAG,EAAE,IAAI,CAAC,CAAC;AACxD,YAAY,GAAG,CAAC,eAAe,GAAG,OAAO,CAAC,eAAe,KAAK,SAAS,GAAG,IAAI,GAAG,OAAO,CAAC,eAAe,CAAC;AACzG,YAAY,GAAG,CAAC,gBAAgB,CAAC,kBAAkB,EAAE,gBAAgB,CAAC,CAAC;AACvE,YAAY,IAAI,OAAO,CAAC,OAAO,KAAK,EAAE,EAAE;AACxC,gBAAgB,OAAO,CAAC,OAAO,GAAG,SAAS,CAAC;AAC5C,YAAY,CAAC;AACb,YAAY,IAAI,OAAO,CAAC,OAAO,EAAE;AACjC;AACA,gBAAgB,IAAIC,mBAAa,CAAC,OAAO,CAAC,OAAO,CAAC,EAAE;AACpD,oBAAoB,GAAG,CAAC,gBAAgB,CAAC,cAAc,EAAE,0BAA0B,CAAC,CAAC;AACrF,gBAAgB,CAAC;AACjB,qBAAqB;AACrB,oBAAoB,GAAG,CAAC,gBAAgB,CAAC,cAAc,EAAE,0BAA0B,CAAC,CAAC;AACrF,gBAAgB,CAAC;AACjB,YAAY,CAAC;AACb,YAAY,MAAM,OAAO,GAAG,OAAO,CAAC,OAAO,CAAC;AAC5C,YAAY,IAAI,OAAO,EAAE;AACzB,gBAAgB,MAAM,CAAC,IAAI,CAAC,OAAO,CAAC;AACpC,qBAAqB,OAAO,CAAC,CAAC,MAAM,KAAK;AACzC,oBAAoB,GAAG,CAAC,gBAAgB,CAAC,MAAM,EAAE,OAAO,CAAC,MAAM,CAAC,CAAC,CAAC;AAClE,gBAAgB,CAAC,CAAC,CAAC;AACnB,YAAY,CAAC;AACb,YAAY,IAAI,OAAO,CAAC,YAAY,EAAE;AACtC,gBAAgB,GAAG,CAAC,YAAY,GAAG,OAAO,CAAC,YAAY,CAAC;AACxD,YAAY,CAAC;AACb,YAAY,IAAI,OAAO,CAAC,WAAW,EAAE;AACrC,gBAAgB,OAAO,CAAC,WAAW,CAAC,OAAO,GAAG,MAAM;AACpD,oBAAoB,GAAG,CAAC,KAAK,EAAE,CAAC;AAChC,oBAAoB,MAAM,CAAC,IAAID,iBAAU,EAAE,CAAC,CAAC;AAC7C,gBAAgB,CAAC,CAAC;AAClB,YAAY,CAAC;AACb,YAAY,IAAI,OAAO,CAAC,OAAO,EAAE;AACjC,gBAAgB,GAAG,CAAC,OAAO,GAAG,OAAO,CAAC,OAAO,CAAC;AAC9C,YAAY,CAAC;AACb,YAAY,GAAG,CAAC,MAAM,GAAG,MAAM;AAC/B,gBAAgB,IAAI,OAAO,CAAC,WAAW,EAAE;AACzC,oBAAoB,OAAO,CAAC,WAAW,CAAC,OAAO,GAAG,IAAI,CAAC;AACvD,gBAAgB,CAAC;AACjB,gBAAgB,IAAI,GAAG,CAAC,MAAM,IAAI,GAAG,IAAI,GAAG,CAAC,MAAM,GAAG,GAAG,EAAE;AAC3D,oBAAoB,OAAO,CAAC,IAAIE,uBAAY,CAAC,GAAG,CAAC,MAAM,EAAE,GAAG,CAAC,UAAU,EAAE,GAAG,CAAC,QAAQ,IAAI,GAAG,CAAC,YAAY,CAAC,CAAC,CAAC;AAC5G,gBAAgB,CAAC;AACjB,qBAAqB;AACrB,oBAAoB,MAAM,CAAC,IAAIC,gBAAS,CAAC,GAAG,CAAC,QAAQ,IAAI,GAAG,CAAC,YAAY,IAAI,GAAG,CAAC,UAAU,EAAE,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC;AAC1G,gBAAgB,CAAC;AACjB,YAAY,CAAC,CAAC;AACd,YAAY,GAAG,CAAC,OAAO,GAAG,MAAM;AAChC,gBAAgB,IAAI,CAAC,OAAO,CAAC,GAAG,CAACC,gBAAQ,CAAC,OAAO,EAAE,CAAC,yBAAyB,EAAE,GAAG,CAAC,MAAM,CAAC,EAAE,EAAE,GAAG,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,CAAC;AACjH,gBAAgB,MAAM,CAAC,IAAID,gBAAS,CAAC,GAAG,CAAC,UAAU,EAAE,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC;AAClE,YAAY,CAAC,CAAC;AACd,YAAY,GAAG,CAAC,SAAS,GAAG,MAAM;AAClC,gBAAgB,IAAI,CAAC,OAAO,CAAC,GAAG,CAACC,gBAAQ,CAAC,OAAO,EAAE,CAAC,0BAA0B,CAAC,CAAC,CAAC;AACjF,gBAAgB,MAAM,CAAC,IAAIC,mBAAY,EAAE,CAAC,CAAC;AAC3C,YAAY,CAAC,CAAC;AACd,YAAY,GAAG,CAAC,IAAI,CAAC,OAAO,CAAC,OAAO,CAAC,CAAC;AACtC,QAAQ,CAAC,CAAC,CAAC;AACX,IAAI,CAAC;AACL;;;;","x_google_ignoreList":[0]}

package/dist/cjs/node_modules/@microsoft/signalr/dist/esm/index.js

@@ -0,0 +1,50 @@
+'use strict';
+
+var Errors = require('./Errors.js');
+var HttpClient = require('./HttpClient.js');
+var DefaultHttpClient = require('./DefaultHttpClient.js');
+var HubConnection = require('./HubConnection.js');
+var HubConnectionBuilder = require('./HubConnectionBuilder.js');
+var IHubProtocol = require('./IHubProtocol.js');
+var ILogger = require('./ILogger.js');
+var ITransport = require('./ITransport.js');
+var Loggers = require('./Loggers.js');
+var JsonHubProtocol = require('./JsonHubProtocol.js');
+var Subject = require('./Subject.js');
+var pkgVersion = require('./pkg-version.js');
+
+
+
+exports.AbortError = Errors.AbortError;
+exports.HttpError = Errors.HttpError;
+exports.TimeoutError = Errors.TimeoutError;
+exports.HttpClient = HttpClient.HttpClient;
+exports.HttpResponse = HttpClient.HttpResponse;
+exports.DefaultHttpClient = DefaultHttpClient.DefaultHttpClient;
+exports.HubConnection = HubConnection.HubConnection;
+Object.defineProperty(exports, "HubConnectionState", {
+	enumerable: true,
+	get: function () { return HubConnection.HubConnectionState; }
+});
+exports.HubConnectionBuilder = HubConnectionBuilder.HubConnectionBuilder;
+Object.defineProperty(exports, "MessageType", {
+	enumerable: true,
+	get: function () { return IHubProtocol.MessageType; }
+});
+Object.defineProperty(exports, "LogLevel", {
+	enumerable: true,
+	get: function () { return ILogger.LogLevel; }
+});
+Object.defineProperty(exports, "HttpTransportType", {
+	enumerable: true,
+	get: function () { return ITransport.HttpTransportType; }
+});
+Object.defineProperty(exports, "TransferFormat", {
+	enumerable: true,
+	get: function () { return ITransport.TransferFormat; }
+});
+exports.NullLogger = Loggers.NullLogger;
+exports.JsonHubProtocol = JsonHubProtocol.JsonHubProtocol;
+exports.Subject = Subject.Subject;
+exports.VERSION = pkgVersion.VERSION;
+//# sourceMappingURL=index.js.map

package/dist/cjs/node_modules/@microsoft/signalr/dist/esm/index.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.js","sources":[],"sourcesContent":[],"names":[],"mappings":";;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;"}

package/dist/cjs/node_modules/@microsoft/signalr/dist/esm/pkg-version.js

@@ -0,0 +1,6 @@
+'use strict';
+
+const VERSION = '10.0.0';
+
+exports.VERSION = VERSION;
+//# sourceMappingURL=pkg-version.js.map

package/dist/cjs/node_modules/@microsoft/signalr/dist/esm/pkg-version.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"pkg-version.js","sources":["../../../../../../../../node_modules/@microsoft/signalr/dist/esm/pkg-version.js"],"sourcesContent":["export const VERSION = '10.0.0';\r\n//# sourceMappingURL=pkg-version.js.map"],"names":[],"mappings":";;AAAY,MAAC,OAAO,GAAG;;;;","x_google_ignoreList":[0]}

package/dist/cjs/pathfinding/Pathfinding.js

@@ -0,0 +1,255 @@
+'use strict';
+
+/* ────────────────────────────────────────────────────────────────
+   Pathfinding — A*, grid-based navigation, flow fields
+──────────────────────────────────────────────────────────────── */
+const SQRT2 = Math.SQRT2;
+function heuristic(ax, ay, bx, by, diagonal) {
+    if (diagonal) {
+        // Octile distance
+        const dx = Math.abs(ax - bx);
+        const dy = Math.abs(ay - by);
+        return dx + dy + (SQRT2 - 2) * Math.min(dx, dy);
+    }
+    return Math.abs(ax - bx) + Math.abs(ay - by);
+}
+function findPath(grid, startX, startY, endX, endY, options) {
+    var _a, _b, _c;
+    const diag = (_a = options === null || options === void 0 ? void 0 : options.allowDiagonals) !== null && _a !== void 0 ? _a : true;
+    const maxIter = (_b = options === null || options === void 0 ? void 0 : options.maxIterations) !== null && _b !== void 0 ? _b : 2000;
+    const weight = (_c = options === null || options === void 0 ? void 0 : options.heuristicWeight) !== null && _c !== void 0 ? _c : 1;
+    if (!grid.isWalkable(endX, endY))
+        return null;
+    const key = (x, y) => y * grid.width + x;
+    const start = {
+        x: startX, y: startY,
+        g: 0,
+        h: heuristic(startX, startY, endX, endY, diag) * weight,
+        f: 0,
+        parent: null,
+    };
+    start.f = start.g + start.h;
+    // Simple binary-heap-backed open set
+    const open = [start];
+    const closed = new Set();
+    const gScores = new Map();
+    gScores.set(key(startX, startY), 0);
+    const neighbors = diag
+        ? [[-1, 0, 1], [1, 0, 1], [0, -1, 1], [0, 1, 1], [-1, -1, SQRT2], [1, -1, SQRT2], [-1, 1, SQRT2], [1, 1, SQRT2]]
+        : [[-1, 0, 1], [1, 0, 1], [0, -1, 1], [0, 1, 1]];
+    let iterations = 0;
+    while (open.length > 0 && iterations < maxIter) {
+        iterations++;
+        // Find node with lowest f
+        let bestIdx = 0;
+        for (let i = 1; i < open.length; i++) {
+            if (open[i].f < open[bestIdx].f)
+                bestIdx = i;
+        }
+        const current = open[bestIdx];
+        open[bestIdx] = open[open.length - 1];
+        open.pop();
+        if (current.x === endX && current.y === endY) {
+            return reconstructPath(current);
+        }
+        const currentKey = key(current.x, current.y);
+        closed.add(currentKey);
+        for (const [dx, dy, baseCost] of neighbors) {
+            const nx = current.x + dx;
+            const ny = current.y + dy;
+            if (nx < 0 || ny < 0 || nx >= grid.width || ny >= grid.height)
+                continue;
+            if (!grid.isWalkable(nx, ny))
+                continue;
+            const nKey = key(nx, ny);
+            if (closed.has(nKey))
+                continue;
+            // Diagonal corner-cutting check
+            if (dx !== 0 && dy !== 0) {
+                if (!grid.isWalkable(current.x + dx, current.y) || !grid.isWalkable(current.x, current.y + dy)) {
+                    continue;
+                }
+            }
+            const moveCost = grid.cost ? grid.cost(nx, ny) : 1;
+            const tentativeG = current.g + baseCost * moveCost;
+            const prevG = gScores.get(nKey);
+            if (prevG !== undefined && tentativeG >= prevG)
+                continue;
+            gScores.set(nKey, tentativeG);
+            const node = {
+                x: nx, y: ny,
+                g: tentativeG,
+                h: heuristic(nx, ny, endX, endY, diag) * weight,
+                f: 0,
+                parent: current,
+            };
+            node.f = node.g + node.h;
+            open.push(node);
+        }
+    }
+    return null; // No path found
+}
+function reconstructPath(node) {
+    const path = [];
+    let current = node;
+    while (current) {
+        path.push({ x: current.x, y: current.y });
+        current = current.parent;
+    }
+    path.reverse();
+    return path;
+}
+/* ── Path Smoothing ───────────────────────────────────────────── */
+function smoothPath(path, grid) {
+    if (path.length <= 2)
+        return path;
+    const result = [path[0]];
+    let current = 0;
+    while (current < path.length - 1) {
+        let furthest = current + 1;
+        for (let i = path.length - 1; i > current + 1; i--) {
+            if (hasLineOfSight(grid, path[current], path[i])) {
+                furthest = i;
+                break;
+            }
+        }
+        result.push(path[furthest]);
+        current = furthest;
+    }
+    return result;
+}
+function hasLineOfSight(grid, a, b) {
+    // Bresenham
+    let x0 = a.x, y0 = a.y;
+    const x1 = b.x, y1 = b.y;
+    const dx = Math.abs(x1 - x0);
+    const dy = Math.abs(y1 - y0);
+    const sx = x0 < x1 ? 1 : -1;
+    const sy = y0 < y1 ? 1 : -1;
+    let err = dx - dy;
+    while (true) {
+        if (!grid.isWalkable(x0, y0))
+            return false;
+        if (x0 === x1 && y0 === y1)
+            break;
+        const e2 = 2 * err;
+        if (e2 > -dy) {
+            err -= dy;
+            x0 += sx;
+        }
+        if (e2 < dx) {
+            err += dx;
+            y0 += sy;
+        }
+    }
+    return true;
+}
+/* ── Flow Field ───────────────────────────────────────────────── */
+class FlowField {
+    constructor(width, height) {
+        this.width = width;
+        this.height = height;
+        this.directions = new Array(width * height).fill(null).map(() => ({ x: 0, y: 0 }));
+        this.costs = new Float32Array(width * height).fill(Infinity);
+    }
+    /** Generate flow field towards target (tileX, tileY). */
+    generate(grid, targetX, targetY) {
+        const w = this.width;
+        const idx = (x, y) => y * w + x;
+        // Reset
+        this.costs.fill(Infinity);
+        for (const d of this.directions) {
+            d.x = 0;
+            d.y = 0;
+        }
+        // Dijkstra pass
+        const targetIdx = idx(targetX, targetY);
+        this.costs[targetIdx] = 0;
+        const queue = [[targetX, targetY]];
+        const neighbors = [[-1, 0], [1, 0], [0, -1], [0, 1]];
+        while (queue.length > 0) {
+            const [cx, cy] = queue.shift();
+            const currentCost = this.costs[idx(cx, cy)];
+            for (const [dx, dy] of neighbors) {
+                const nx = cx + dx;
+                const ny = cy + dy;
+                if (nx < 0 || ny < 0 || nx >= w || ny >= this.height)
+                    continue;
+                if (!grid.isWalkable(nx, ny))
+                    continue;
+                const moveCost = grid.cost ? grid.cost(nx, ny) : 1;
+                const newCost = currentCost + moveCost;
+                const nIdx = idx(nx, ny);
+                if (newCost < this.costs[nIdx]) {
+                    this.costs[nIdx] = newCost;
+                    queue.push([nx, ny]);
+                }
+            }
+        }
+        // Direction pass — each cell points toward lowest-cost neighbor
+        for (let y = 0; y < this.height; y++) {
+            for (let x = 0; x < w; x++) {
+                const i = idx(x, y);
+                if (this.costs[i] === Infinity)
+                    continue;
+                if (x === targetX && y === targetY)
+                    continue;
+                let bestCost = this.costs[i];
+                let bx = 0, by = 0;
+                for (const [dx, dy] of [[-1, 0], [1, 0], [0, -1], [0, 1], [-1, -1], [1, -1], [-1, 1], [1, 1]]) {
+                    const nx = x + dx;
+                    const ny = y + dy;
+                    if (nx < 0 || ny < 0 || nx >= w || ny >= this.height)
+                        continue;
+                    const c = this.costs[idx(nx, ny)];
+                    if (c < bestCost) {
+                        bestCost = c;
+                        bx = dx;
+                        by = dy;
+                    }
+                }
+                const len = Math.sqrt(bx * bx + by * by) || 1;
+                this.directions[i].x = bx / len;
+                this.directions[i].y = by / len;
+            }
+        }
+    }
+    getDirection(tileX, tileY) {
+        if (tileX < 0 || tileY < 0 || tileX >= this.width || tileY >= this.height) {
+            return { x: 0, y: 0 };
+        }
+        return this.directions[tileY * this.width + tileX];
+    }
+    getCost(tileX, tileY) {
+        if (tileX < 0 || tileY < 0 || tileX >= this.width || tileY >= this.height) {
+            return Infinity;
+        }
+        return this.costs[tileY * this.width + tileX];
+    }
+}
+/** Find which polygon contains a point (simple point-in-polygon test). */
+function findContainingPolygon(mesh, point) {
+    for (const poly of mesh.polygons) {
+        if (isPointInConvexPolygon(point, poly.vertices)) {
+            return poly;
+        }
+    }
+    return null;
+}
+function isPointInConvexPolygon(point, vertices) {
+    const n = vertices.length;
+    for (let i = 0; i < n; i++) {
+        const a = vertices[i];
+        const b = vertices[(i + 1) % n];
+        const cross = (b.x - a.x) * (point.y - a.y) - (b.y - a.y) * (point.x - a.x);
+        if (cross < 0)
+            return false;
+    }
+    return true;
+}
+
+exports.FlowField = FlowField;
+exports.findContainingPolygon = findContainingPolygon;
+exports.findPath = findPath;
+exports.smoothPath = smoothPath;
+//# sourceMappingURL=Pathfinding.js.map

package/dist/cjs/pathfinding/Pathfinding.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"Pathfinding.js","sources":["../../../src/pathfinding/Pathfinding.ts"],"sourcesContent":[null],"names":[],"mappings":";;AAAA;;AAEmE;AAmCnE,MAAM,KAAK,GAAG,IAAI,CAAC,KAAK;AAExB,SAAS,SAAS,CAAC,EAAU,EAAE,EAAU,EAAE,EAAU,EAAE,EAAU,EAAE,QAAiB,EAAA;IAClF,IAAI,QAAQ,EAAE;;QAEZ,MAAM,EAAE,GAAG,IAAI,CAAC,GAAG,CAAC,EAAE,GAAG,EAAE,CAAC;QAC5B,MAAM,EAAE,GAAG,IAAI,CAAC,GAAG,CAAC,EAAE,GAAG,EAAE,CAAC;AAC5B,QAAA,OAAO,EAAE,GAAG,EAAE,GAAG,CAAC,KAAK,GAAG,CAAC,IAAI,IAAI,CAAC,GAAG,CAAC,EAAE,EAAE,EAAE,CAAC;IACjD;AACA,IAAA,OAAO,IAAI,CAAC,GAAG,CAAC,EAAE,GAAG,EAAE,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,EAAE,GAAG,EAAE,CAAC;AAC9C;AAEM,SAAU,QAAQ,CACtB,IAAc,EACd,MAAc,EACd,MAAc,EACd,IAAY,EACZ,IAAY,EACZ,OAA2B,EAAA;;AAE3B,IAAA,MAAM,IAAI,GAAG,CAAA,EAAA,GAAA,OAAO,KAAA,IAAA,IAAP,OAAO,KAAA,MAAA,GAAA,MAAA,GAAP,OAAO,CAAE,cAAc,MAAA,IAAA,IAAA,EAAA,KAAA,MAAA,GAAA,EAAA,GAAI,IAAI;AAC5C,IAAA,MAAM,OAAO,GAAG,CAAA,EAAA,GAAA,OAAO,KAAA,IAAA,IAAP,OAAO,KAAA,MAAA,GAAA,MAAA,GAAP,OAAO,CAAE,aAAa,MAAA,IAAA,IAAA,EAAA,KAAA,MAAA,GAAA,EAAA,GAAI,IAAI;AAC9C,IAAA,MAAM,MAAM,GAAG,CAAA,EAAA,GAAA,OAAO,KAAA,IAAA,IAAP,OAAO,KAAA,MAAA,GAAA,MAAA,GAAP,OAAO,CAAE,eAAe,MAAA,IAAA,IAAA,EAAA,KAAA,MAAA,GAAA,EAAA,GAAI,CAAC;IAE5C,IAAI,CAAC,IAAI,CAAC,UAAU,CAAC,IAAI,EAAE,IAAI,CAAC;AAAE,QAAA,OAAO,IAAI;AAE7C,IAAA,MAAM,GAAG,GAAG,CAAC,CAAS,EAAE,CAAS,KAAK,CAAC,GAAG,IAAI,CAAC,KAAK,GAAG,CAAC;AAExD,IAAA,MAAM,KAAK,GAAS;AAClB,QAAA,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,MAAM;AACpB,QAAA,CAAC,EAAE,CAAC;AACJ,QAAA,CAAC,EAAE,SAAS,CAAC,MAAM,EAAE,MAAM,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,CAAC,GAAG,MAAM;AACvD,QAAA,CAAC,EAAE,CAAC;AACJ,QAAA,MAAM,EAAE,IAAI;KACb;IACD,KAAK,CAAC,CAAC,GAAG,KAAK,CAAC,CAAC,GAAG,KAAK,CAAC,CAAC;;AAG3B,IAAA,MAAM,IAAI,GAAW,CAAC,KAAK,CAAC;AAC5B,IAAA,MAAM,MAAM,GAAG,IAAI,GAAG,EAAU;AAChC,IAAA,MAAM,OAAO,GAAG,IAAI,GAAG,EAAkB;AACzC,IAAA,OAAO,CAAC,GAAG,CAAC,GAAG,CAAC,MAAM,EAAE,MAAM,CAAC,EAAE,CAAC,CAAC;IAEnC,MAAM,SAAS,GAA+B;AAC5C,UAAE,CAAC,CAAC,EAAE,EAAC,CAAC,EAAC,CAAC,CAAC,EAAC,CAAC,CAAC,EAAC,CAAC,EAAC,CAAC,CAAC,EAAC,CAAC,CAAC,EAAC,EAAE,EAAC,CAAC,CAAC,EAAC,CAAC,CAAC,EAAC,CAAC,EAAC,CAAC,CAAC,EAAC,CAAC,EAAE,EAAC,EAAE,EAAC,KAAK,CAAC,EAAC,CAAC,CAAC,EAAC,EAAE,EAAC,KAAK,CAAC,EAAC,CAAC,EAAE,EAAC,CAAC,EAAC,KAAK,CAAC,EAAC,CAAC,CAAC,EAAC,CAAC,EAAC,KAAK,CAAC;AACxF,UAAE,CAAC,CAAC,EAAE,EAAC,CAAC,EAAC,CAAC,CAAC,EAAC,CAAC,CAAC,EAAC,CAAC,EAAC,CAAC,CAAC,EAAC,CAAC,CAAC,EAAC,EAAE,EAAC,CAAC,CAAC,EAAC,CAAC,CAAC,EAAC,CAAC,EAAC,CAAC,CAAC,CAAC;IAEvC,IAAI,UAAU,GAAG,CAAC;IAElB,OAAO,IAAI,CAAC,MAAM,GAAG,CAAC,IAAI,UAAU,GAAG,OAAO,EAAE;AAC9C,QAAA,UAAU,EAAE;;QAGZ,IAAI,OAAO,GAAG,CAAC;AACf,QAAA,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;AACpC,YAAA,IAAI,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC;gBAAE,OAAO,GAAG,CAAC;QAC9C;AACA,QAAA,MAAM,OAAO,GAAG,IAAI,CAAC,OAAO,CAAC;AAC7B,QAAA,IAAI,CAAC,OAAO,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC;QACrC,IAAI,CAAC,GAAG,EAAE;AAEV,QAAA,IAAI,OAAO,CAAC,CAAC,KAAK,IAAI,IAAI,OAAO,CAAC,CAAC,KAAK,IAAI,EAAE;AAC5C,YAAA,OAAO,eAAe,CAAC,OAAO,CAAC;QACjC;AAEA,QAAA,MAAM,UAAU,GAAG,GAAG,CAAC,OAAO,CAAC,CAAC,EAAE,OAAO,CAAC,CAAC,CAAC;AAC5C,QAAA,MAAM,CAAC,GAAG,CAAC,UAAU,CAAC;QAEtB,KAAK,MAAM,CAAC,EAAE,EAAE,EAAE,EAAE,QAAQ,CAAC,IAAI,SAAS,EAAE;AAC1C,YAAA,MAAM,EAAE,GAAG,OAAO,CAAC,CAAC,GAAG,EAAE;AACzB,YAAA,MAAM,EAAE,GAAG,OAAO,CAAC,CAAC,GAAG,EAAE;AAEzB,YAAA,IAAI,EAAE,GAAG,CAAC,IAAI,EAAE,GAAG,CAAC,IAAI,EAAE,IAAI,IAAI,CAAC,KAAK,IAAI,EAAE,IAAI,IAAI,CAAC,MAAM;gBAAE;YAC/D,IAAI,CAAC,IAAI,CAAC,UAAU,CAAC,EAAE,EAAE,EAAE,CAAC;gBAAE;YAE9B,MAAM,IAAI,GAAG,GAAG,CAAC,EAAE,EAAE,EAAE,CAAC;AACxB,YAAA,IAAI,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC;gBAAE;;YAGtB,IAAI,EAAE,KAAK,CAAC,IAAI,EAAE,KAAK,CAAC,EAAE;AACxB,gBAAA,IAAI,CAAC,IAAI,CAAC,UAAU,CAAC,OAAO,CAAC,CAAC,GAAG,EAAE,EAAE,OAAO,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,UAAU,CAAC,OAAO,CAAC,CAAC,EAAE,OAAO,CAAC,CAAC,GAAG,EAAE,CAAC,EAAE;oBAC9F;gBACF;YACF;YAEA,MAAM,QAAQ,GAAG,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC,EAAE,EAAE,EAAE,CAAC,GAAG,CAAC;YAClD,MAAM,UAAU,GAAG,OAAO,CAAC,CAAC,GAAG,QAAQ,GAAG,QAAQ;YAElD,MAAM,KAAK,GAAG,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC;AAC/B,YAAA,IAAI,KAAK,KAAK,SAAS,IAAI,UAAU,IAAI,KAAK;gBAAE;AAEhD,YAAA,OAAO,CAAC,GAAG,CAAC,IAAI,EAAE,UAAU,CAAC;AAE7B,YAAA,MAAM,IAAI,GAAS;AACjB,gBAAA,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,EAAE;AACZ,gBAAA,CAAC,EAAE,UAAU;AACb,gBAAA,CAAC,EAAE,SAAS,CAAC,EAAE,EAAE,EAAE,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,CAAC,GAAG,MAAM;AAC/C,gBAAA,CAAC,EAAE,CAAC;AACJ,gBAAA,MAAM,EAAE,OAAO;aAChB;YACD,IAAI,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC;AACxB,YAAA,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC;QACjB;IACF;IAEA,OAAO,IAAI,CAAC;AACd;AAEA,SAAS,eAAe,CAAC,IAAU,EAAA;IACjC,MAAM,IAAI,GAAW,EAAE;IACvB,IAAI,OAAO,GAAgB,IAAI;IAC/B,OAAO,OAAO,EAAE;AACd,QAAA,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,OAAO,CAAC,CAAC,EAAE,CAAC,EAAE,OAAO,CAAC,CAAC,EAAE,CAAC;AACzC,QAAA,OAAO,GAAG,OAAO,CAAC,MAAM;IAC1B;IACA,IAAI,CAAC,OAAO,EAAE;AACd,IAAA,OAAO,IAAI;AACb;AAEA;AAEM,SAAU,UAAU,CAAC,IAAY,EAAE,IAAc,EAAA;AACrD,IAAA,IAAI,IAAI,CAAC,MAAM,IAAI,CAAC;AAAE,QAAA,OAAO,IAAI;IAEjC,MAAM,MAAM,GAAW,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IAChC,IAAI,OAAO,GAAG,CAAC;IAEf,OAAO,OAAO,GAAG,IAAI,CAAC,MAAM,GAAG,CAAC,EAAE;AAChC,QAAA,IAAI,QAAQ,GAAG,OAAO,GAAG,CAAC;AAE1B,QAAA,KAAK,IAAI,CAAC,GAAG,IAAI,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC,GAAG,OAAO,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE;AAClD,YAAA,IAAI,cAAc,CAAC,IAAI,EAAE,IAAI,CAAC,OAAO,CAAC,EAAE,IAAI,CAAC,CAAC,CAAC,CAAC,EAAE;gBAChD,QAAQ,GAAG,CAAC;gBACZ;YACF;QACF;QAEA,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;QAC3B,OAAO,GAAG,QAAQ;IACpB;AAEA,IAAA,OAAO,MAAM;AACf;AAEA,SAAS,cAAc,CAAC,IAAc,EAAE,CAAO,EAAE,CAAO,EAAA;;IAEtD,IAAI,EAAE,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,GAAG,CAAC,CAAC,CAAC;IACtB,MAAM,EAAE,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,GAAG,CAAC,CAAC,CAAC;IACxB,MAAM,EAAE,GAAG,IAAI,CAAC,GAAG,CAAC,EAAE,GAAG,EAAE,CAAC;IAC5B,MAAM,EAAE,GAAG,IAAI,CAAC,GAAG,CAAC,EAAE,GAAG,EAAE,CAAC;AAC5B,IAAA,MAAM,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,CAAC,GAAG,EAAE;AAC3B,IAAA,MAAM,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,CAAC,GAAG,EAAE;AAC3B,IAAA,IAAI,GAAG,GAAG,EAAE,GAAG,EAAE;IAEjB,OAAO,IAAI,EAAE;QACX,IAAI,CAAC,IAAI,CAAC,UAAU,CAAC,EAAE,EAAE,EAAE,CAAC;AAAE,YAAA,OAAO,KAAK;AAC1C,QAAA,IAAI,EAAE,KAAK,EAAE,IAAI,EAAE,KAAK,EAAE;YAAE;AAC5B,QAAA,MAAM,EAAE,GAAG,CAAC,GAAG,GAAG;AAClB,QAAA,IAAI,EAAE,GAAG,CAAC,EAAE,EAAE;YAAE,GAAG,IAAI,EAAE;YAAE,EAAE,IAAI,EAAE;QAAE;AACrC,QAAA,IAAI,EAAE,GAAG,EAAE,EAAE;YAAE,GAAG,IAAI,EAAE;YAAE,EAAE,IAAI,EAAE;QAAE;IACtC;AACA,IAAA,OAAO,IAAI;AACb;AAEA;MAEa,SAAS,CAAA;IAQpB,WAAA,CAAY,KAAa,EAAE,MAAc,EAAA;AACvC,QAAA,IAAI,CAAC,KAAK,GAAG,KAAK;AAClB,QAAA,IAAI,CAAC,MAAM,GAAG,MAAM;AACpB,QAAA,IAAI,CAAC,UAAU,GAAG,IAAI,KAAK,CAAC,KAAK,GAAG,MAAM,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,OAAO,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC;AAClF,QAAA,IAAI,CAAC,KAAK,GAAG,IAAI,YAAY,CAAC,KAAK,GAAG,MAAM,CAAC,CAAC,IAAI,CAAC,QAAQ,CAAC;IAC9D;;AAGA,IAAA,QAAQ,CAAC,IAAc,EAAE,OAAe,EAAE,OAAe,EAAA;AACvD,QAAA,MAAM,CAAC,GAAG,IAAI,CAAC,KAAK;AACpB,QAAA,MAAM,GAAG,GAAG,CAAC,CAAS,EAAE,CAAS,KAAK,CAAC,GAAG,CAAC,GAAG,CAAC;;AAG/C,QAAA,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,QAAQ,CAAC;AACzB,QAAA,KAAK,MAAM,CAAC,IAAI,IAAI,CAAC,UAAU,EAAE;AAAE,YAAA,CAAC,CAAC,CAAC,GAAG,CAAC;AAAE,YAAA,CAAC,CAAC,CAAC,GAAG,CAAC;QAAE;;QAGrD,MAAM,SAAS,GAAG,GAAG,CAAC,OAAO,EAAE,OAAO,CAAC;AACvC,QAAA,IAAI,CAAC,KAAK,CAAC,SAAS,CAAC,GAAG,CAAC;QAEzB,MAAM,KAAK,GAAuB,CAAC,CAAC,OAAO,EAAE,OAAO,CAAC,CAAC;AACtD,QAAA,MAAM,SAAS,GAAuB,CAAC,CAAC,EAAE,EAAC,CAAC,CAAC,EAAC,CAAC,CAAC,EAAC,CAAC,CAAC,EAAC,CAAC,CAAC,EAAC,EAAE,CAAC,EAAC,CAAC,CAAC,EAAC,CAAC,CAAC,CAAC;AAEjE,QAAA,OAAO,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE;YACvB,MAAM,CAAC,EAAE,EAAE,EAAE,CAAC,GAAG,KAAK,CAAC,KAAK,EAAG;AAC/B,YAAA,MAAM,WAAW,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC;YAE3C,KAAK,MAAM,CAAC,EAAE,EAAE,EAAE,CAAC,IAAI,SAAS,EAAE;AAChC,gBAAA,MAAM,EAAE,GAAG,EAAE,GAAG,EAAE;AAClB,gBAAA,MAAM,EAAE,GAAG,EAAE,GAAG,EAAE;AAClB,gBAAA,IAAI,EAAE,GAAG,CAAC,IAAI,EAAE,GAAG,CAAC,IAAI,EAAE,IAAI,CAAC,IAAI,EAAE,IAAI,IAAI,CAAC,MAAM;oBAAE;gBACtD,IAAI,CAAC,IAAI,CAAC,UAAU,CAAC,EAAE,EAAE,EAAE,CAAC;oBAAE;gBAE9B,MAAM,QAAQ,GAAG,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC,EAAE,EAAE,EAAE,CAAC,GAAG,CAAC;AAClD,gBAAA,MAAM,OAAO,GAAG,WAAW,GAAG,QAAQ;gBACtC,MAAM,IAAI,GAAG,GAAG,CAAC,EAAE,EAAE,EAAE,CAAC;gBAExB,IAAI,OAAO,GAAG,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,EAAE;AAC9B,oBAAA,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,GAAG,OAAO;oBAC1B,KAAK,CAAC,IAAI,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC;gBACtB;YACF;QACF;;AAGA,QAAA,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;AACpC,YAAA,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE;gBAC1B,MAAM,CAAC,GAAG,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC;AACnB,gBAAA,IAAI,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,KAAK,QAAQ;oBAAE;AAChC,gBAAA,IAAI,CAAC,KAAK,OAAO,IAAI,CAAC,KAAK,OAAO;oBAAE;gBAEpC,IAAI,QAAQ,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC;AAC5B,gBAAA,IAAI,EAAE,GAAG,CAAC,EAAE,EAAE,GAAG,CAAC;AAElB,gBAAA,KAAK,MAAM,CAAC,EAAE,EAAE,EAAE,CAAC,IAAI,CAAC,CAAC,EAAE,EAAC,CAAC,CAAC,EAAC,CAAC,CAAC,EAAC,CAAC,CAAC,EAAC,CAAC,CAAC,EAAC,EAAE,CAAC,EAAC,CAAC,CAAC,EAAC,CAAC,CAAC,EAAC,CAAC,EAAE,EAAC,EAAE,CAAC,EAAC,CAAC,CAAC,EAAC,EAAE,CAAC,EAAC,CAAC,EAAE,EAAC,CAAC,CAAC,EAAC,CAAC,CAAC,EAAC,CAAC,CAAC,CAAsB,EAAE;AACnG,oBAAA,MAAM,EAAE,GAAG,CAAC,GAAG,EAAE;AACjB,oBAAA,MAAM,EAAE,GAAG,CAAC,GAAG,EAAE;AACjB,oBAAA,IAAI,EAAE,GAAG,CAAC,IAAI,EAAE,GAAG,CAAC,IAAI,EAAE,IAAI,CAAC,IAAI,EAAE,IAAI,IAAI,CAAC,MAAM;wBAAE;AACtD,oBAAA,MAAM,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC;AACjC,oBAAA,IAAI,CAAC,GAAG,QAAQ,EAAE;wBAChB,QAAQ,GAAG,CAAC;wBACZ,EAAE,GAAG,EAAE;wBACP,EAAE,GAAG,EAAE;oBACT;gBACF;AAEA,gBAAA,MAAM,GAAG,GAAG,IAAI,CAAC,IAAI,CAAC,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,CAAC,IAAI,CAAC;gBAC7C,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,EAAE,GAAG,GAAG;gBAC/B,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,EAAE,GAAG,GAAG;YACjC;QACF;IACF;IAEA,YAAY,CAAC,KAAa,EAAE,KAAa,EAAA;QACvC,IAAI,KAAK,GAAG,CAAC,IAAI,KAAK,GAAG,CAAC,IAAI,KAAK,IAAI,IAAI,CAAC,KAAK,IAAI,KAAK,IAAI,IAAI,CAAC,MAAM,EAAE;YACzE,OAAO,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE;QACvB;AACA,QAAA,OAAO,IAAI,CAAC,UAAU,CAAC,KAAK,GAAG,IAAI,CAAC,KAAK,GAAG,KAAK,CAAC;IACpD;IAEA,OAAO,CAAC,KAAa,EAAE,KAAa,EAAA;QAClC,IAAI,KAAK,GAAG,CAAC,IAAI,KAAK,GAAG,CAAC,IAAI,KAAK,IAAI,IAAI,CAAC,KAAK,IAAI,KAAK,IAAI,IAAI,CAAC,MAAM,EAAE;AACzE,YAAA,OAAO,QAAQ;QACjB;AACA,QAAA,OAAO,IAAI,CAAC,KAAK,CAAC,KAAK,GAAG,IAAI,CAAC,KAAK,GAAG,KAAK,CAAC;IAC/C;AACD;AAcD;AACM,SAAU,qBAAqB,CAAC,IAAa,EAAE,KAAW,EAAA;AAC9D,IAAA,KAAK,MAAM,IAAI,IAAI,IAAI,CAAC,QAAQ,EAAE;QAChC,IAAI,sBAAsB,CAAC,KAAK,EAAE,IAAI,CAAC,QAAQ,CAAC,EAAE;AAChD,YAAA,OAAO,IAAI;QACb;IACF;AACA,IAAA,OAAO,IAAI;AACb;AAEA,SAAS,sBAAsB,CAAC,KAAW,EAAE,QAAgB,EAAA;AAC3D,IAAA,MAAM,CAAC,GAAG,QAAQ,CAAC,MAAM;AACzB,IAAA,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE;AAC1B,QAAA,MAAM,CAAC,GAAG,QAAQ,CAAC,CAAC,CAAC;AACrB,QAAA,MAAM,CAAC,GAAG,QAAQ,CAAC,CAAC,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;AAC/B,QAAA,MAAM,KAAK,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,KAAK,KAAK,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,KAAK,KAAK,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QAC3E,IAAI,KAAK,GAAG,CAAC;AAAE,YAAA,OAAO,KAAK;IAC7B;AACA,IAAA,OAAO,IAAI;AACb;;;;;;;"}

package/dist/cjs/performance/BenchmarkSuite.js

@@ -0,0 +1,318 @@
+'use strict';
+
+/* ────────────────────────────────────────────────────────────────
+   Benchmark Suite — LEGENDARY L11
+   
+   • Standardized benchmark scenarios
+   • Frame-time measurement with percentiles
+   • Memory usage tracking
+   • Regression detection (compare results)
+   • JSON-serializable report output
+──────────────────────────────────────────────────────────────── */
+/* ══════════════════════════════════════════════════════════════
+   BenchmarkRunner
+   ══════════════════════════════════════════════════════════════ */
+class BenchmarkRunner {
+    constructor() {
+        this.scenarios = new Map();
+        this.results = [];
+    }
+    /** Register a benchmark scenario. */
+    register(scenario) {
+        this.scenarios.set(scenario.id, scenario);
+    }
+    /** Register multiple scenarios. */
+    registerAll(scenarios) {
+        for (const s of scenarios) {
+            this.register(s);
+        }
+    }
+    /** Run a single scenario. */
+    runScenario(id) {
+        var _a, _b, _c;
+        const scenario = this.scenarios.get(id);
+        if (!scenario)
+            return null;
+        const warmup = (_a = scenario.warmup) !== null && _a !== void 0 ? _a : 10;
+        const iterations = (_b = scenario.iterations) !== null && _b !== void 0 ? _b : 100;
+        // Setup
+        let cleanup;
+        if (scenario.setup) {
+            cleanup = scenario.setup();
+        }
+        // Warm-up
+        for (let i = 0; i < warmup; i++) {
+            scenario.run();
+        }
+        // Measure memory before
+        const memBefore = this.getHeapUsed();
+        // Measure iterations
+        const samples = [];
+        const totalStart = performance.now();
+        for (let i = 0; i < iterations; i++) {
+            const start = performance.now();
+            scenario.run();
+            const end = performance.now();
+            samples.push(end - start);
+        }
+        const totalMs = performance.now() - totalStart;
+        const memAfter = this.getHeapUsed();
+        // Teardown
+        if (typeof cleanup === 'function')
+            cleanup();
+        if (scenario.teardown)
+            scenario.teardown();
+        // Calculate timings
+        const timings = this.calculateTimings(samples, totalMs, iterations);
+        // Memory delta
+        const memory = (memBefore !== null && memAfter !== null) ? {
+            heapUsedBefore: memBefore,
+            heapUsedAfter: memAfter,
+            heapDelta: memAfter - memBefore,
+        } : null;
+        const withinBudget = scenario.budgetMs != null ? (timings.mean <= scenario.budgetMs) : null;
+        const result = {
+            scenarioId: scenario.id,
+            scenarioName: scenario.name,
+            category: scenario.category,
+            timings,
+            memory,
+            budgetMs: (_c = scenario.budgetMs) !== null && _c !== void 0 ? _c : null,
+            withinBudget,
+            timestamp: Date.now(),
+        };
+        this.results.push(result);
+        return result;
+    }
+    /** Run all registered scenarios. */
+    runAll() {
+        this.results = [];
+        const ids = Array.from(this.scenarios.keys());
+        for (const id of ids) {
+            this.runScenario(id);
+        }
+        return this.generateReport();
+    }
+    /** Run scenarios in a specific category. */
+    runCategory(category) {
+        this.results = [];
+        for (const [id, scenario] of this.scenarios) {
+            if (scenario.category === category) {
+                this.runScenario(id);
+            }
+        }
+        return this.generateReport();
+    }
+    /** Generate a full report from collected results. */
+    generateReport(label) {
+        let passed = 0;
+        let failed = 0;
+        let totalTimeMs = 0;
+        for (const r of this.results) {
+            totalTimeMs += r.timings.totalMs;
+            if (r.withinBudget === true)
+                passed++;
+            else if (r.withinBudget === false)
+                failed++;
+        }
+        return {
+            label: label !== null && label !== void 0 ? label : 'benchmark',
+            date: new Date().toISOString(),
+            platform: typeof navigator !== 'undefined' ? navigator.userAgent : 'node',
+            results: [...this.results],
+            summary: {
+                totalScenarios: this.results.length,
+                passed,
+                failed,
+                skipped: this.results.length - passed - failed,
+                totalTimeMs,
+            },
+        };
+    }
+    /** Compare two reports for regressions. */
+    static compareReports(baseline, current, regressionThresholdPercent = 10) {
+        const baseMap = new Map();
+        for (const r of baseline.results)
+            baseMap.set(r.scenarioId, r);
+        const regressions = [];
+        for (const cur of current.results) {
+            const base = baseMap.get(cur.scenarioId);
+            if (!base)
+                continue;
+            const meanDelta = ((cur.timings.mean - base.timings.mean) / base.timings.mean) * 100;
+            const p95Delta = ((cur.timings.p95 - base.timings.p95) / base.timings.p95) * 100;
+            regressions.push({
+                scenarioId: cur.scenarioId,
+                scenarioName: cur.scenarioName,
+                meanDeltaPercent: Math.round(meanDelta * 100) / 100,
+                p95DeltaPercent: Math.round(p95Delta * 100) / 100,
+                regressed: meanDelta > regressionThresholdPercent,
+                improved: meanDelta < -regressionThresholdPercent,
+            });
+        }
+        return regressions;
+    }
+    /** Get last results. */
+    getResults() {
+        return [...this.results];
+    }
+    /** Clear all scenarios and results. */
+    clear() {
+        this.scenarios.clear();
+        this.results = [];
+    }
+    /* ── Internals ──────────────────────────────────────────────── */
+    calculateTimings(samples, totalMs, iterations) {
+        const sorted = [...samples].sort((a, b) => a - b);
+        const mean = samples.reduce((s, v) => s + v, 0) / samples.length;
+        const variance = samples.reduce((s, v) => s + (v - mean) ** 2, 0) / samples.length;
+        return {
+            min: sorted[0],
+            max: sorted[sorted.length - 1],
+            mean,
+            median: sorted[Math.floor(sorted.length / 2)],
+            p95: sorted[Math.floor(sorted.length * 0.95)],
+            p99: sorted[Math.floor(sorted.length * 0.99)],
+            stdDev: Math.sqrt(variance),
+            totalMs,
+            iterations,
+        };
+    }
+    getHeapUsed() {
+        if (typeof performance !== 'undefined' && performance.memory) {
+            return performance.memory.usedJSHeapSize;
+        }
+        return null;
+    }
+}
+/* ══════════════════════════════════════════════════════════════
+   Built-in Benchmark Scenarios
+   ══════════════════════════════════════════════════════════════ */
+const BUILTIN_BENCHMARKS = [
+    {
+        id: 'ecs-create-entities',
+        name: 'ECS: Create 1000 entities',
+        category: 'ecs',
+        iterations: 200,
+        budgetMs: 2,
+        run: () => {
+        },
+    },
+    {
+        id: 'ecs-iterate-10k',
+        name: 'ECS: Iterate 10k components',
+        category: 'ecs',
+        iterations: 200,
+        budgetMs: 1,
+        run: () => {
+            const arr = new Float64Array(10000);
+            for (let i = 0; i < 10000; i++) {
+                arr[i] = i * 0.01;
+            }
+        },
+    },
+    {
+        id: 'physics-aabb-1k',
+        name: 'Physics: 1k AABB overlap checks',
+        category: 'physics',
+        iterations: 200,
+        budgetMs: 1,
+        run: () => {
+        },
+    },
+    {
+        id: 'rendering-transform-10k',
+        name: 'Rendering: 10k transform multiplications',
+        category: 'rendering',
+        iterations: 200,
+        budgetMs: 2,
+        run: () => {
+            const m = new Float64Array(9);
+            for (let i = 0; i < 10000; i++) {
+                m[0] = Math.cos(i);
+                m[1] = -Math.sin(i);
+                m[2] = i;
+                m[3] = Math.sin(i);
+                m[4] = Math.cos(i);
+                m[5] = i;
+                m[6] = 0;
+                m[7] = 0;
+                m[8] = 1;
+            }
+        },
+    },
+    {
+        id: 'scene-graph-traverse',
+        name: 'Scene: Traverse 1000-node tree',
+        category: 'scene',
+        iterations: 200,
+        budgetMs: 1,
+        setup: () => {
+            // Build a tree in setup
+            const nodes = [];
+            for (let i = 0; i < 1000; i++) {
+                nodes.push({ id: i, children: [] });
+            }
+            for (let i = 1; i < 1000; i++) {
+                const parentIdx = Math.floor(Math.random() * i);
+                nodes[parentIdx].children.push(i);
+            }
+            globalThis.__benchNodes = nodes;
+            return () => { delete globalThis.__benchNodes; };
+        },
+        run: () => {
+            const nodes = globalThis.__benchNodes;
+            if (!nodes)
+                return;
+            const stack = [0];
+            while (stack.length > 0) {
+                const idx = stack.pop();
+                const node = nodes[idx];
+                for (let i = node.children.length - 1; i >= 0; i--) {
+                    stack.push(node.children[i]);
+                }
+            }
+        },
+    },
+    {
+        id: 'general-event-dispatch',
+        name: 'General: 10k event dispatches',
+        category: 'general',
+        iterations: 200,
+        budgetMs: 2,
+        run: () => {
+            const handlers = [];
+            for (let i = 0; i < 10; i++) {
+                handlers.push(() => { });
+            }
+            for (let i = 0; i < 10000; i++) {
+                for (const h of handlers)
+                    h();
+            }
+        },
+    },
+    {
+        id: 'general-object-pool',
+        name: 'General: Object pool acquire/release 10k',
+        category: 'general',
+        iterations: 200,
+        budgetMs: 1,
+        run: () => {
+            var _a;
+            const pool = [];
+            for (let i = 0; i < 100; i++) {
+                pool.push({ x: 0, y: 0 });
+            }
+            for (let i = 0; i < 10000; i++) {
+                const obj = (_a = pool.pop()) !== null && _a !== void 0 ? _a : { x: 0, y: 0 };
+                obj.x = i;
+                obj.y = i;
+                pool.push(obj);
+            }
+        },
+    },
+];
+
+exports.BUILTIN_BENCHMARKS = BUILTIN_BENCHMARKS;
+exports.BenchmarkRunner = BenchmarkRunner;
+//# sourceMappingURL=BenchmarkSuite.js.map