@starktma/minecraft-utils 1.3.111 → 1.5.0

package/dist/math/BFSScanner.js

@@ -0,0 +1,388 @@
+/**
+ * Represents the result of a scan, stored as an optimized chunked heightmap.
+ * Allows for infinite expansion without reallocation.
+ */
+export class ScanResult {
+    // Chunk size (16x16 cells)
+    static CHUNK_SIZE = 16;
+    static CHUNK_MASK = 0xf;
+    static CHUNK_SHIFT = 4;
+    static SENTINEL = -2147483648;
+    // Cell size (8x8 blocks)
+    static CELL_SIZE = 8;
+    static CELL_SHIFT = 3; // 2^3 = 8
+    // Map of chunk key "chunkX,chunkZ" -> Int32Array(256)
+    chunks = new Map();
+    constructor() { }
+    /**
+     * Updates the height at the given coordinates if the new Y is higher.
+     * @param x Absolute X coordinate
+     * @param z Absolute Z coordinate
+     * @param y Absolute Y coordinate
+     */
+    updateHeight(x, z, y) {
+        // Convert world coords to cell coords
+        const cellX = x >> ScanResult.CELL_SHIFT;
+        const cellZ = z >> ScanResult.CELL_SHIFT;
+        const chunkX = cellX >> ScanResult.CHUNK_SHIFT;
+        const chunkZ = cellZ >> ScanResult.CHUNK_SHIFT;
+        const key = `${chunkX},${chunkZ}`;
+        let chunk = this.chunks.get(key);
+        if (!chunk) {
+            chunk = new Int32Array(ScanResult.CHUNK_SIZE * ScanResult.CHUNK_SIZE).fill(ScanResult.SENTINEL);
+            this.chunks.set(key, chunk);
+        }
+        const localX = cellX & ScanResult.CHUNK_MASK;
+        const localZ = cellZ & ScanResult.CHUNK_MASK;
+        const index = (localZ << ScanResult.CHUNK_SHIFT) | localX;
+        if (y > chunk[index]) {
+            chunk[index] = y;
+        }
+    }
+    /**
+     * Retrieves the highest Y coordinate found at the given X, Z.
+     * @param x Absolute X coordinate
+     * @param z Absolute Z coordinate
+     * @returns The Y coordinate, or undefined if no block was scanned at this location.
+     */
+    getHeight(x, z) {
+        const cellX = x >> ScanResult.CELL_SHIFT;
+        const cellZ = z >> ScanResult.CELL_SHIFT;
+        const chunkX = cellX >> ScanResult.CHUNK_SHIFT;
+        const chunkZ = cellZ >> ScanResult.CHUNK_SHIFT;
+        const key = `${chunkX},${chunkZ}`;
+        const chunk = this.chunks.get(key);
+        if (!chunk)
+            return undefined;
+        const localX = cellX & ScanResult.CHUNK_MASK;
+        const localZ = cellZ & ScanResult.CHUNK_MASK;
+        const index = (localZ << ScanResult.CHUNK_SHIFT) | localX;
+        const val = chunk[index];
+        return val === ScanResult.SENTINEL ? undefined : val;
+    }
+    /**
+     * Checks if a location has a valid height recorded.
+     */
+    hasHeight(x, z) {
+        return this.getHeight(x, z) !== undefined;
+    }
+    /**
+     * Clears all scan data.
+     */
+    clear() {
+        this.chunks.clear();
+    }
+    /**
+     * Returns a random valid position from the scanned area.
+     * @param center Optional center position to constrain the random pick.
+     * @param minRadius Optional minimum radius from center.
+     * @param maxRadius Optional maximum radius from center.
+     * @param filter Optional filter function to validate the position.
+     * @returns A Vector3 with the position, or undefined if no data exists.
+     */
+    getRandomPosition(center, minRadius, maxRadius, filter) {
+        if (this.chunks.size === 0)
+            return undefined;
+        let keys = Array.from(this.chunks.keys());
+        // Optimization: Filter chunks if center/maxRadius provided
+        if (center && maxRadius) {
+            // Convert center/radius to chunk coords
+            // Radius in blocks -> Radius in chunks?
+            // Max radius in blocks.
+            // Chunk size in blocks = 16 * 8 = 128.
+            const chunkSizeInBlocks = ScanResult.CHUNK_SIZE * ScanResult.CELL_SIZE;
+            const minChunkX = (center.x - maxRadius) >> (ScanResult.CHUNK_SHIFT + ScanResult.CELL_SHIFT);
+            const maxChunkX = (center.x + maxRadius) >> (ScanResult.CHUNK_SHIFT + ScanResult.CELL_SHIFT);
+            const minChunkZ = (center.z - maxRadius) >> (ScanResult.CHUNK_SHIFT + ScanResult.CELL_SHIFT);
+            const maxChunkZ = (center.z + maxRadius) >> (ScanResult.CHUNK_SHIFT + ScanResult.CELL_SHIFT);
+            keys = keys.filter((key) => {
+                const [cxStr, czStr] = key.split(",");
+                const cx = parseInt(cxStr);
+                const cz = parseInt(czStr);
+                return cx >= minChunkX && cx <= maxChunkX && cz >= minChunkZ && cz <= maxChunkZ;
+            });
+        }
+        if (keys.length === 0)
+            return undefined;
+        const tryFind = (enforceMin) => {
+            for (let attempt = 0; attempt < 20; attempt++) {
+                const randomKey = keys[Math.floor(Math.random() * keys.length)];
+                const chunk = this.chunks.get(randomKey);
+                const [chunkXStr, chunkZStr] = randomKey.split(",");
+                const chunkX = parseInt(chunkXStr);
+                const chunkZ = parseInt(chunkZStr);
+                for (let i = 0; i < 5; i++) {
+                    const localX = Math.floor(Math.random() * ScanResult.CHUNK_SIZE);
+                    const localZ = Math.floor(Math.random() * ScanResult.CHUNK_SIZE);
+                    const index = (localZ << ScanResult.CHUNK_SHIFT) | localX;
+                    const y = chunk[index];
+                    if (y !== ScanResult.SENTINEL) {
+                        // Convert back to world coordinates (first coordinate of the cell)
+                        const cellX = (chunkX << ScanResult.CHUNK_SHIFT) + localX;
+                        const cellZ = (chunkZ << ScanResult.CHUNK_SHIFT) + localZ;
+                        const x = cellX << ScanResult.CELL_SHIFT;
+                        const z = cellZ << ScanResult.CELL_SHIFT;
+                        const pos = { x, y, z };
+                        if (center && maxRadius) {
+                            const dx = x - center.x;
+                            const dz = z - center.z;
+                            const distSq = dx * dx + dz * dz;
+                            if (distSq > maxRadius * maxRadius)
+                                continue;
+                            if (enforceMin && minRadius && distSq < minRadius * minRadius)
+                                continue;
+                        }
+                        if (filter && !filter(pos))
+                            continue;
+                        return pos;
+                    }
+                }
+            }
+            return undefined;
+        };
+        // First attempt: Respect minRadius
+        let pos = tryFind(true);
+        // Second attempt: If failed and minRadius was requested, find the farthest available position
+        if (!pos && minRadius && center) {
+            // Sort keys by distance from center (descending)
+            keys.sort((a, b) => {
+                const [axStr, azStr] = a.split(",");
+                const [bxStr, bzStr] = b.split(",");
+                const ax = parseInt(axStr);
+                const az = parseInt(azStr);
+                const bx = parseInt(bxStr);
+                const bz = parseInt(bzStr);
+                .0; // Approximate distance using chunk coordinates
+                const cx = center.x >> (ScanResult.CHUNK_SHIFT + ScanResult.CELL_SHIFT);
+                const cz = center.z >> (ScanResult.CHUNK_SHIFT + ScanResult.CELL_SHIFT);
+                const distA = (ax - cx) ** 2 + (az - cz) ** 2;
+                const distB = (bx - cx) ** 2 + (bz - cz) ** 2;
+                return distB - distA;
+            });
+            for (const key of keys) {
+                const chunk = this.chunks.get(key);
+                const [chunkXStr, chunkZStr] = key.split(",");
+                const chunkX = parseInt(chunkXStr);
+                const chunkZ = parseInt(chunkZStr);
+                let maxDistSq = -1;
+                let bestPos;
+                for (let i = 0; i < chunk.length; i++) {
+                    const y = chunk[i];
+                    if (y !== ScanResult.SENTINEL) {
+                        const localX = i & ScanResult.CHUNK_MASK;
+                        const localZ = i >> ScanResult.CHUNK_SHIFT;
+                        const cellX = (chunkX << ScanResult.CHUNK_SHIFT) + localX;
+                        const cellZ = (chunkZ << ScanResult.CHUNK_SHIFT) + localZ;
+                        const x = cellX << ScanResult.CELL_SHIFT;
+                        const z = cellZ << ScanResult.CELL_SHIFT;
+                        const pos = { x, y, z };
+                        if (filter && !filter(pos))
+                            continue;
+                        const dx = x - center.x;
+                        const dz = z - center.z;
+                        const distSq = dx * dx + dz * dz;
+                        if (distSq > maxDistSq) {
+                            maxDistSq = distSq;
+                            bestPos = pos;
+                        }
+                    }
+                }
+                if (bestPos) {
+                    pos = bestPos;
+                    break;
+                }
+            }
+        }
+        return pos;
+    }
+}
+/**
+ * A highly optimized BFS Scanner using the Singleton pattern.
+ */
+export class BFSScanner {
+    static instance;
+    // Reusable vector to avoid allocation during getBlock
+    tempPos = { x: 0, y: 0, z: 0 };
+    // Directions: North, South, East, West (Scaled by CELL_SIZE)
+    directions = [
+        { x: ScanResult.CELL_SIZE, y: 0, z: 0 },
+        { x: -ScanResult.CELL_SIZE, y: 0, z: 0 },
+        { x: 0, y: 0, z: ScanResult.CELL_SIZE },
+        { x: 0, y: 0, z: -ScanResult.CELL_SIZE },
+    ];
+    // Global storage for scan results per dimension
+    globalScanResults = new Map();
+    constructor() { }
+    /**
+     * Gets the singleton instance of the BFSScanner.
+     */
+    static getInstance() {
+        if (!BFSScanner.instance) {
+            BFSScanner.instance = new BFSScanner();
+        }
+        return BFSScanner.instance;
+    }
+    /**
+     * Retrieves the global scan result for a specific dimension.
+     * @param dimensionId The identifier of the dimension (e.g., "minecraft:overworld").
+     */
+    getScanResult(dimensionId) {
+        if (!this.globalScanResults.has(dimensionId)) {
+            this.globalScanResults.set(dimensionId, new ScanResult());
+        }
+        return this.globalScanResults.get(dimensionId);
+    }
+    /**
+     * Performs the BFS scan asynchronously.
+     * @param dimension The dimension to scan in.
+     * @param config The scan configuration.
+     * @param existingResult Optional existing ScanResult to update/continue from.
+     * @returns A Generator resolving to the updated ScanResult.
+     */
+    *scan(dimension, config, existingResult) {
+        const { center, shape, geometryDimensions, blockFilter, maxIterations = 10000, forceRescan = false, yieldInterval = 100, } = config;
+        const result = existingResult || new ScanResult();
+        // Optimization: Use Int32Array for queue to save memory compared to standard Array
+        // Initial size 1000 * 3 coordinates. Will grow if needed.
+        let queueCapacity = 3000;
+        let queue = new Int32Array(queueCapacity);
+        let qHead = 0;
+        let qTail = 0;
+        const pushToQueue = (x, y, z) => {
+            if (qTail + 3 >= queueCapacity) {
+                // Grow queue
+                const newCapacity = queueCapacity * 2;
+                const newQueue = new Int32Array(newCapacity);
+                newQueue.set(queue);
+                queue = newQueue;
+                queueCapacity = newCapacity;
+            }
+            queue[qTail++] = x;
+            queue[qTail++] = y;
+            queue[qTail++] = z;
+        };
+        // Start at center, aligned to cell grid
+        const startX = Math.floor(center.x / ScanResult.CELL_SIZE) * ScanResult.CELL_SIZE;
+        const startY = Math.floor(center.y);
+        const startZ = Math.floor(center.z / ScanResult.CELL_SIZE) * ScanResult.CELL_SIZE;
+        pushToQueue(startX, startY, startZ);
+        // Optimization: Use a Map<number, Set<number>> for visited coordinates
+        // Key: (cellX & 0xffff) | ((cellZ & 0xffff) << 16), Value: Set of y coordinates
+        const visitedXZ = new Map();
+        const markVisited = (x, y, z) => {
+            const cellX = x >> 3; // Divide by 8
+            const cellZ = z >> 3;
+            const key = (cellX & 0xffff) | ((cellZ & 0xffff) << 16);
+            let ySet = visitedXZ.get(key);
+            if (!ySet) {
+                ySet = new Set();
+                visitedXZ.set(key, ySet);
+            }
+            ySet.add(y);
+        };
+        const isVisited = (x, y, z) => {
+            const cellX = x >> 3;
+            const cellZ = z >> 3;
+            const key = (cellX & 0xffff) | ((cellZ & 0xffff) << 16);
+            const ySet = visitedXZ.get(key);
+            return ySet ? ySet.has(y) : false;
+        };
+        markVisited(startX, startY, startZ);
+        // Pre-calculate squared radius for distance checks
+        const rSq = geometryDimensions.x * geometryDimensions.x;
+        let iterations = 0;
+        let processedSinceYield = 0;
+        while (qHead < qTail) {
+            if (iterations++ > maxIterations)
+                break;
+            // Yield to event loop periodically
+            if (processedSinceYield++ >= yieldInterval) {
+                processedSinceYield = 0;
+                yield;
+            }
+            const cx = queue[qHead++];
+            const cy = queue[qHead++];
+            const cz = queue[qHead++];
+            // Check if already scanned
+            const alreadyScanned = result.hasHeight(cx, cz);
+            let shouldProcessNeighbors = false;
+            if (alreadyScanned && !forceRescan) {
+                // Optimization: Skip expensive block checks.
+                // We assume if it's in the result, it was valid.
+                // We MUST process neighbors to reach the edge of the known area.
+                shouldProcessNeighbors = true;
+            }
+            else {
+                // Not scanned or forced rescan: Do the expensive check
+                this.tempPos.x = cx;
+                this.tempPos.y = cy;
+                this.tempPos.z = cz;
+                // Geometry Check (Fastest)
+                if (!this.isWithinShape(cx, cy, cz, center, shape, geometryDimensions, rSq)) {
+                    continue;
+                }
+                let isValid = true;
+                // Check 8x8 volume
+                try {
+                    for (let dx = 0; dx < ScanResult.CELL_SIZE; dx++) {
+                        for (let dz = 0; dz < ScanResult.CELL_SIZE; dz++) {
+                            this.tempPos.x = cx + dx;
+                            this.tempPos.z = cz + dz;
+                            const block = dimension.getBlock(this.tempPos);
+                            if (!block || !blockFilter(block)) {
+                                isValid = false;
+                                break;
+                            }
+                        }
+                        if (!isValid)
+                            break;
+                    }
+                }
+                catch (e) {
+                    isValid = false;
+                }
+                if (isValid) {
+                    result.updateHeight(cx, cz, cy);
+                    shouldProcessNeighbors = true;
+                }
+            }
+            if (shouldProcessNeighbors) {
+                for (const dir of this.directions) {
+                    const nx = cx + dir.x;
+                    const ny = cy + dir.y;
+                    const nz = cz + dir.z;
+                    // Check geometry for neighbors before adding to queue to save iterations
+                    if (!this.isWithinShape(nx, ny, nz, center, shape, geometryDimensions, rSq)) {
+                        continue;
+                    }
+                    if (isVisited(nx, ny, nz))
+                        continue;
+                    markVisited(nx, ny, nz);
+                    pushToQueue(nx, ny, nz);
+                }
+            }
+        }
+        // console.warn(`Scan finished. Iterations: ${iterations}, Queue: ${qTail/3}, Result Chunks: ${result['chunks'].size}`);
+        return result;
+    }
+    getCoordKey(x, y, z) {
+        return `${x},${y},${z}`;
+    }
+    isWithinShape(x, y, z, center, shape, dims, rSq) {
+        const dx = x - center.x;
+        const dy = y - center.y;
+        const dz = z - center.z;
+        switch (shape) {
+            case "cube":
+                return Math.abs(dx) <= dims.x && Math.abs(dy) <= dims.y && Math.abs(dz) <= dims.z;
+            case "sphere":
+                return dx * dx + dy * dy + dz * dz <= rSq;
+            case "cylinder":
+                // Cylinder assumed vertical (Y-axis)
+                return dx * dx + dz * dz <= rSq && Math.abs(dy) <= dims.y;
+            default:
+                return false;
+        }
+    }
+}
+//# sourceMappingURL=BFSScanner.js.map

package/dist/math/BFSScanner.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"BFSScanner.js","sourceRoot":"","sources":["../../src/math/BFSScanner.ts"],"names":[],"mappings":"AA6CA;;;GAGG;AACH,MAAM,OAAO,UAAU;IACtB,2BAA2B;IACnB,MAAM,CAAU,UAAU,GAAG,EAAE,CAAC;IAChC,MAAM,CAAU,UAAU,GAAG,GAAG,CAAC;IACjC,MAAM,CAAU,WAAW,GAAG,CAAC,CAAC;IAChC,MAAM,CAAU,QAAQ,GAAG,CAAC,UAAU,CAAC;IAE/C,yBAAyB;IAClB,MAAM,CAAU,SAAS,GAAG,CAAC,CAAC;IAC7B,MAAM,CAAU,UAAU,GAAG,CAAC,CAAC,CAAC,UAAU;IAElD,sDAAsD;IACrC,MAAM,GAA4B,IAAI,GAAG,EAAE,CAAC;IAE7D,gBAAe,CAAC;IAEhB;;;;;OAKG;IACI,YAAY,CAAC,CAAS,EAAE,CAAS,EAAE,CAAS;QAClD,sCAAsC;QACtC,MAAM,KAAK,GAAG,CAAC,IAAI,UAAU,CAAC,UAAU,CAAC;QACzC,MAAM,KAAK,GAAG,CAAC,IAAI,UAAU,CAAC,UAAU,CAAC;QAEzC,MAAM,MAAM,GAAG,KAAK,IAAI,UAAU,CAAC,WAAW,CAAC;QAC/C,MAAM,MAAM,GAAG,KAAK,IAAI,UAAU,CAAC,WAAW,CAAC;QAC/C,MAAM,GAAG,GAAG,GAAG,MAAM,IAAI,MAAM,EAAE,CAAC;QAElC,IAAI,KAAK,GAAG,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;QACjC,IAAI,CAAC,KAAK,EAAE,CAAC;YACZ,KAAK,GAAG,IAAI,UAAU,CAAC,UAAU,CAAC,UAAU,GAAG,UAAU,CAAC,UAAU,CAAC,CAAC,IAAI,CAAC,UAAU,CAAC,QAAQ,CAAC,CAAC;YAChG,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,GAAG,EAAE,KAAK,CAAC,CAAC;QAC7B,CAAC;QAED,MAAM,MAAM,GAAG,KAAK,GAAG,UAAU,CAAC,UAAU,CAAC;QAC7C,MAAM,MAAM,GAAG,KAAK,GAAG,UAAU,CAAC,UAAU,CAAC;QAC7C,MAAM,KAAK,GAAG,CAAC,MAAM,IAAI,UAAU,CAAC,WAAW,CAAC,GAAG,MAAM,CAAC;QAE1D,IAAI,CAAC,GAAG,KAAK,CAAC,KAAK,CAAC,EAAE,CAAC;YACtB,KAAK,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC;QAClB,CAAC;IACF,CAAC;IAED;;;;;OAKG;IACI,SAAS,CAAC,CAAS,EAAE,CAAS;QACpC,MAAM,KAAK,GAAG,CAAC,IAAI,UAAU,CAAC,UAAU,CAAC;QACzC,MAAM,KAAK,GAAG,CAAC,IAAI,UAAU,CAAC,UAAU,CAAC;QAEzC,MAAM,MAAM,GAAG,KAAK,IAAI,UAAU,CAAC,WAAW,CAAC;QAC/C,MAAM,MAAM,GAAG,KAAK,IAAI,UAAU,CAAC,WAAW,CAAC;QAC/C,MAAM,GAAG,GAAG,GAAG,MAAM,IAAI,MAAM,EAAE,CAAC;QAElC,MAAM,KAAK,GAAG,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;QACnC,IAAI,CAAC,KAAK;YAAE,OAAO,SAAS,CAAC;QAE7B,MAAM,MAAM,GAAG,KAAK,GAAG,UAAU,CAAC,UAAU,CAAC;QAC7C,MAAM,MAAM,GAAG,KAAK,GAAG,UAAU,CAAC,UAAU,CAAC;QAC7C,MAAM,KAAK,GAAG,CAAC,MAAM,IAAI,UAAU,CAAC,WAAW,CAAC,GAAG,MAAM,CAAC;QAE1D,MAAM,GAAG,GAAG,KAAK,CAAC,KAAK,CAAC,CAAC;QACzB,OAAO,GAAG,KAAK,UAAU,CAAC,QAAQ,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,GAAG,CAAC;IACtD,CAAC;IAED;;OAEG;IACI,SAAS,CAAC,CAAS,EAAE,CAAS;QACpC,OAAO,IAAI,CAAC,SAAS,CAAC,CAAC,EAAE,CAAC,CAAC,KAAK,SAAS,CAAC;IAC3C,CAAC;IAED;;OAEG;IACI,KAAK;QACX,IAAI,CAAC,MAAM,CAAC,KAAK,EAAE,CAAC;IACrB,CAAC;IAED;;;;;;;OAOG;IACI,iBAAiB,CACvB,MAAgB,EAChB,SAAkB,EAClB,SAAkB,EAClB,MAAkC;QAElC,IAAI,IAAI,CAAC,MAAM,CAAC,IAAI,KAAK,CAAC;YAAE,OAAO,SAAS,CAAC;QAE7C,IAAI,IAAI,GAAG,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,IAAI,EAAE,CAAC,CAAC;QAE1C,2DAA2D;QAC3D,IAAI,MAAM,IAAI,SAAS,EAAE,CAAC;YACzB,wCAAwC;YACxC,wCAAwC;YACxC,wBAAwB;YACxB,uCAAuC;YACvC,MAAM,iBAAiB,GAAG,UAAU,CAAC,UAAU,GAAG,UAAU,CAAC,SAAS,CAAC;YACvE,MAAM,SAAS,GAAG,CAAC,MAAM,CAAC,CAAC,GAAG,SAAS,CAAC,IAAI,CAAC,UAAU,CAAC,WAAW,GAAG,UAAU,CAAC,UAAU,CAAC,CAAC;YAC7F,MAAM,SAAS,GAAG,CAAC,MAAM,CAAC,CAAC,GAAG,SAAS,CAAC,IAAI,CAAC,UAAU,CAAC,WAAW,GAAG,UAAU,CAAC,UAAU,CAAC,CAAC;YAC7F,MAAM,SAAS,GAAG,CAAC,MAAM,CAAC,CAAC,GAAG,SAAS,CAAC,IAAI,CAAC,UAAU,CAAC,WAAW,GAAG,UAAU,CAAC,UAAU,CAAC,CAAC;YAC7F,MAAM,SAAS,GAAG,CAAC,MAAM,CAAC,CAAC,GAAG,SAAS,CAAC,IAAI,CAAC,UAAU,CAAC,WAAW,GAAG,UAAU,CAAC,UAAU,CAAC,CAAC;YAE7F,IAAI,GAAG,IAAI,CAAC,MAAM,CAAC,CAAC,GAAG,EAAE,EAAE;gBAC1B,MAAM,CAAC,KAAK,EAAE,KAAK,CAAC,GAAG,GAAG,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC;gBACtC,MAAM,EAAE,GAAG,QAAQ,CAAC,KAAK,CAAC,CAAC;gBAC3B,MAAM,EAAE,GAAG,QAAQ,CAAC,KAAK,CAAC,CAAC;gBAC3B,OAAO,EAAE,IAAI,SAAS,IAAI,EAAE,IAAI,SAAS,IAAI,EAAE,IAAI,SAAS,IAAI,EAAE,IAAI,SAAS,CAAC;YACjF,CAAC,CAAC,CAAC;QACJ,CAAC;QAED,IAAI,IAAI,CAAC,MAAM,KAAK,CAAC;YAAE,OAAO,SAAS,CAAC;QAExC,MAAM,OAAO,GAAG,CAAC,UAAmB,EAAE,EAAE;YACvC,KAAK,IAAI,OAAO,GAAG,CAAC,EAAE,OAAO,GAAG,EAAE,EAAE,OAAO,EAAE,EAAE,CAAC;gBAC/C,MAAM,SAAS,GAAG,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,MAAM,EAAE,GAAG,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC;gBAChE,MAAM,KAAK,GAAG,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,SAAS,CAAE,CAAC;gBAC1C,MAAM,CAAC,SAAS,EAAE,SAAS,CAAC,GAAG,SAAS,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC;gBACpD,MAAM,MAAM,GAAG,QAAQ,CAAC,SAAS,CAAC,CAAC;gBACnC,MAAM,MAAM,GAAG,QAAQ,CAAC,SAAS,CAAC,CAAC;gBAEnC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;oBAC5B,MAAM,MAAM,GAAG,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,MAAM,EAAE,GAAG,UAAU,CAAC,UAAU,CAAC,CAAC;oBACjE,MAAM,MAAM,GAAG,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,MAAM,EAAE,GAAG,UAAU,CAAC,UAAU,CAAC,CAAC;oBACjE,MAAM,KAAK,GAAG,CAAC,MAAM,IAAI,UAAU,CAAC,WAAW,CAAC,GAAG,MAAM,CAAC;oBAC1D,MAAM,CAAC,GAAG,KAAK,CAAC,KAAK,CAAC,CAAC;oBAEvB,IAAI,CAAC,KAAK,UAAU,CAAC,QAAQ,EAAE,CAAC;wBAC/B,mEAAmE;wBACnE,MAAM,KAAK,GAAG,CAAC,MAAM,IAAI,UAAU,CAAC,WAAW,CAAC,GAAG,MAAM,CAAC;wBAC1D,MAAM,KAAK,GAAG,CAAC,MAAM,IAAI,UAAU,CAAC,WAAW,CAAC,GAAG,MAAM,CAAC;wBAC1D,MAAM,CAAC,GAAG,KAAK,IAAI,UAAU,CAAC,UAAU,CAAC;wBACzC,MAAM,CAAC,GAAG,KAAK,IAAI,UAAU,CAAC,UAAU,CAAC;wBACzC,MAAM,GAAG,GAAG,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC;wBAExB,IAAI,MAAM,IAAI,SAAS,EAAE,CAAC;4BACzB,MAAM,EAAE,GAAG,CAAC,GAAG,MAAM,CAAC,CAAC,CAAC;4BACxB,MAAM,EAAE,GAAG,CAAC,GAAG,MAAM,CAAC,CAAC,CAAC;4BACxB,MAAM,MAAM,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,CAAC;4BACjC,IAAI,MAAM,GAAG,SAAS,GAAG,SAAS;gCAAE,SAAS;4BAC7C,IAAI,UAAU,IAAI,SAAS,IAAI,MAAM,GAAG,SAAS,GAAG,SAAS;gCAAE,SAAS;wBACzE,CAAC;wBAED,IAAI,MAAM,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC;4BAAE,SAAS;wBAErC,OAAO,GAAG,CAAC;oBACZ,CAAC;gBACF,CAAC;YACF,CAAC;YACD,OAAO,SAAS,CAAC;QAClB,CAAC,CAAC;QAEF,mCAAmC;QACnC,IAAI,GAAG,GAAG,OAAO,CAAC,IAAI,CAAC,CAAC;QAExB,8FAA8F;QAC9F,IAAI,CAAC,GAAG,IAAI,SAAS,IAAI,MAAM,EAAE,CAAC;YACjC,iDAAiD;YACjD,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE;gBAClB,MAAM,CAAC,KAAK,EAAE,KAAK,CAAC,GAAG,CAAC,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC;gBACpC,MAAM,CAAC,KAAK,EAAE,KAAK,CAAC,GAAG,CAAC,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC;gBACpC,MAAM,EAAE,GAAG,QAAQ,CAAC,KAAK,CAAC,CAAC;gBAC3B,MAAM,EAAE,GAAG,QAAQ,CAAC,KAAK,CAAC,CAAC;gBAC3B,MAAM,EAAE,GAAG,QAAQ,CAAC,KAAK,CAAC,CAAC;gBAC3B,MAAM,EAAE,GAAG,QAAQ,CAAC,KAAK,CAAC,CAAC;gBAG/B,EAAE,CAAA,CAAI,+CAA+C;gBACjD,MAAM,EAAE,GAAG,MAAM,CAAC,CAAC,IAAI,CAAC,UAAU,CAAC,WAAW,GAAG,UAAU,CAAC,UAAU,CAAC,CAAC;gBACxE,MAAM,EAAE,GAAG,MAAM,CAAC,CAAC,IAAI,CAAC,UAAU,CAAC,WAAW,GAAG,UAAU,CAAC,UAAU,CAAC,CAAC;gBAExE,MAAM,KAAK,GAAG,CAAC,EAAE,GAAG,EAAE,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,GAAG,EAAE,CAAC,IAAI,CAAC,CAAC;gBAC9C,MAAM,KAAK,GAAG,CAAC,EAAE,GAAG,EAAE,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,GAAG,EAAE,CAAC,IAAI,CAAC,CAAC;gBAE9C,OAAO,KAAK,GAAG,KAAK,CAAC;YACtB,CAAC,CAAC,CAAC;YAEH,KAAK,MAAM,GAAG,IAAI,IAAI,EAAE,CAAC;gBACxB,MAAM,KAAK,GAAG,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,GAAG,CAAE,CAAC;gBACpC,MAAM,CAAC,SAAS,EAAE,SAAS,CAAC,GAAG,GAAG,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC;gBAC9C,MAAM,MAAM,GAAG,QAAQ,CAAC,SAAS,CAAC,CAAC;gBACnC,MAAM,MAAM,GAAG,QAAQ,CAAC,SAAS,CAAC,CAAC;gBAEnC,IAAI,SAAS,GAAG,CAAC,CAAC,CAAC;gBACnB,IAAI,OAA4B,CAAC;gBAEjC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;oBACvC,MAAM,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC;oBACnB,IAAI,CAAC,KAAK,UAAU,CAAC,QAAQ,EAAE,CAAC;wBAC/B,MAAM,MAAM,GAAG,CAAC,GAAG,UAAU,CAAC,UAAU,CAAC;wBACzC,MAAM,MAAM,GAAG,CAAC,IAAI,UAAU,CAAC,WAAW,CAAC;wBAE3C,MAAM,KAAK,GAAG,CAAC,MAAM,IAAI,UAAU,CAAC,WAAW,CAAC,GAAG,MAAM,CAAC;wBAC1D,MAAM,KAAK,GAAG,CAAC,MAAM,IAAI,UAAU,CAAC,WAAW,CAAC,GAAG,MAAM,CAAC;wBAC1D,MAAM,CAAC,GAAG,KAAK,IAAI,UAAU,CAAC,UAAU,CAAC;wBACzC,MAAM,CAAC,GAAG,KAAK,IAAI,UAAU,CAAC,UAAU,CAAC;wBACzC,MAAM,GAAG,GAAG,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC;wBAExB,IAAI,MAAM,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC;4BAAE,SAAS;wBAErC,MAAM,EAAE,GAAG,CAAC,GAAG,MAAM,CAAC,CAAC,CAAC;wBACxB,MAAM,EAAE,GAAG,CAAC,GAAG,MAAM,CAAC,CAAC,CAAC;wBACxB,MAAM,MAAM,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,CAAC;wBAEjC,IAAI,MAAM,GAAG,SAAS,EAAE,CAAC;4BACxB,SAAS,GAAG,MAAM,CAAC;4BACnB,OAAO,GAAG,GAAG,CAAC;wBACf,CAAC;oBACF,CAAC;gBACF,CAAC;gBAED,IAAI,OAAO,EAAE,CAAC;oBACb,GAAG,GAAG,OAAO,CAAC;oBACd,MAAM;gBACP,CAAC;YACF,CAAC;QACF,CAAC;QAED,OAAO,GAAG,CAAC;IACZ,CAAC;;AAGF;;GAEG;AACH,MAAM,OAAO,UAAU;IACd,MAAM,CAAC,QAAQ,CAAa;IAEpC,sDAAsD;IAC9C,OAAO,GAAY,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC;IAEhD,6DAA6D;IAC5C,UAAU,GAAG;QAC7B,EAAE,CAAC,EAAE,UAAU,CAAC,SAAS,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE;QACvC,EAAE,CAAC,EAAE,CAAC,UAAU,CAAC,SAAS,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE;QACxC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,UAAU,CAAC,SAAS,EAAE;QACvC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,UAAU,CAAC,SAAS,EAAE;KACxC,CAAC;IAEF,gDAAgD;IACxC,iBAAiB,GAA4B,IAAI,GAAG,EAAE,CAAC;IAE/D,gBAAuB,CAAC;IAExB;;OAEG;IACI,MAAM,CAAC,WAAW;QACxB,IAAI,CAAC,UAAU,CAAC,QAAQ,EAAE,CAAC;YAC1B,UAAU,CAAC,QAAQ,GAAG,IAAI,UAAU,EAAE,CAAC;QACxC,CAAC;QACD,OAAO,UAAU,CAAC,QAAQ,CAAC;IAC5B,CAAC;IAED;;;OAGG;IACI,aAAa,CAAC,WAAmB;QACvC,IAAI,CAAC,IAAI,CAAC,iBAAiB,CAAC,GAAG,CAAC,WAAW,CAAC,EAAE,CAAC;YAC9C,IAAI,CAAC,iBAAiB,CAAC,GAAG,CAAC,WAAW,EAAE,IAAI,UAAU,EAAE,CAAC,CAAC;QAC3D,CAAC;QACD,OAAO,IAAI,CAAC,iBAAiB,CAAC,GAAG,CAAC,WAAW,CAAE,CAAC;IACjD,CAAC;IAED;;;;;;OAMG;IACI,CAAC,IAAI,CACX,SAAoB,EACpB,MAAkB,EAClB,cAA2B;QAE3B,MAAM,EACL,MAAM,EACN,KAAK,EACL,kBAAkB,EAClB,WAAW,EACX,aAAa,GAAG,KAAK,EACrB,WAAW,GAAG,KAAK,EACnB,aAAa,GAAG,GAAG,GACnB,GAAG,MAAM,CAAC;QACX,MAAM,MAAM,GAAG,cAAc,IAAI,IAAI,UAAU,EAAE,CAAC;QAElD,mFAAmF;QACnF,0DAA0D;QAC1D,IAAI,aAAa,GAAG,IAAI,CAAC;QACzB,IAAI,KAAK,GAAG,IAAI,UAAU,CAAC,aAAa,CAAC,CAAC;QAC1C,IAAI,KAAK,GAAG,CAAC,CAAC;QACd,IAAI,KAAK,GAAG,CAAC,CAAC;QAEd,MAAM,WAAW,GAAG,CAAC,CAAS,EAAE,CAAS,EAAE,CAAS,EAAE,EAAE;YACvD,IAAI,KAAK,GAAG,CAAC,IAAI,aAAa,EAAE,CAAC;gBAChC,aAAa;gBACb,MAAM,WAAW,GAAG,aAAa,GAAG,CAAC,CAAC;gBACtC,MAAM,QAAQ,GAAG,IAAI,UAAU,CAAC,WAAW,CAAC,CAAC;gBAC7C,QAAQ,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;gBACpB,KAAK,GAAG,QAAQ,CAAC;gBACjB,aAAa,GAAG,WAAW,CAAC;YAC7B,CAAC;YACD,KAAK,CAAC,KAAK,EAAE,CAAC,GAAG,CAAC,CAAC;YACnB,KAAK,CAAC,KAAK,EAAE,CAAC,GAAG,CAAC,CAAC;YACnB,KAAK,CAAC,KAAK,EAAE,CAAC,GAAG,CAAC,CAAC;QACpB,CAAC,CAAC;QAEF,wCAAwC;QACxC,MAAM,MAAM,GAAG,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,GAAG,UAAU,CAAC,SAAS,CAAC,GAAG,UAAU,CAAC,SAAS,CAAC;QAClF,MAAM,MAAM,GAAG,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;QACpC,MAAM,MAAM,GAAG,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,GAAG,UAAU,CAAC,SAAS,CAAC,GAAG,UAAU,CAAC,SAAS,CAAC;QAElF,WAAW,CAAC,MAAM,EAAE,MAAM,EAAE,MAAM,CAAC,CAAC;QAEpC,uEAAuE;QACvE,gFAAgF;QAChF,MAAM,SAAS,GAAG,IAAI,GAAG,EAAuB,CAAC;QAEjD,MAAM,WAAW,GAAG,CAAC,CAAS,EAAE,CAAS,EAAE,CAAS,EAAE,EAAE;YACvD,MAAM,KAAK,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,cAAc;YACpC,MAAM,KAAK,GAAG,CAAC,IAAI,CAAC,CAAC;YACrB,MAAM,GAAG,GAAG,CAAC,KAAK,GAAG,MAAM,CAAC,GAAG,CAAC,CAAC,KAAK,GAAG,MAAM,CAAC,IAAI,EAAE,CAAC,CAAC;YACxD,IAAI,IAAI,GAAG,SAAS,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;YAC9B,IAAI,CAAC,IAAI,EAAE,CAAC;gBACX,IAAI,GAAG,IAAI,GAAG,EAAE,CAAC;gBACjB,SAAS,CAAC,GAAG,CAAC,GAAG,EAAE,IAAI,CAAC,CAAC;YAC1B,CAAC;YACD,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QACb,CAAC,CAAC;QAEF,MAAM,SAAS,GAAG,CAAC,CAAS,EAAE,CAAS,EAAE,CAAS,EAAW,EAAE;YAC9D,MAAM,KAAK,GAAG,CAAC,IAAI,CAAC,CAAC;YACrB,MAAM,KAAK,GAAG,CAAC,IAAI,CAAC,CAAC;YACrB,MAAM,GAAG,GAAG,CAAC,KAAK,GAAG,MAAM,CAAC,GAAG,CAAC,CAAC,KAAK,GAAG,MAAM,CAAC,IAAI,EAAE,CAAC,CAAC;YACxD,MAAM,IAAI,GAAG,SAAS,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;YAChC,OAAO,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC;QACnC,CAAC,CAAC;QAEF,WAAW,CAAC,MAAM,EAAE,MAAM,EAAE,MAAM,CAAC,CAAC;QAEpC,mDAAmD;QACnD,MAAM,GAAG,GAAG,kBAAkB,CAAC,CAAC,GAAG,kBAAkB,CAAC,CAAC,CAAC;QAExD,IAAI,UAAU,GAAG,CAAC,CAAC;QACnB,IAAI,mBAAmB,GAAG,CAAC,CAAC;QAE5B,OAAO,KAAK,GAAG,KAAK,EAAE,CAAC;YACtB,IAAI,UAAU,EAAE,GAAG,aAAa;gBAAE,MAAM;YAExC,mCAAmC;YACnC,IAAI,mBAAmB,EAAE,IAAI,aAAa,EAAE,CAAC;gBAC5C,mBAAmB,GAAG,CAAC,CAAC;gBACxB,KAAK,CAAC;YACP,CAAC;YAED,MAAM,EAAE,GAAG,KAAK,CAAC,KAAK,EAAE,CAAC,CAAC;YAC1B,MAAM,EAAE,GAAG,KAAK,CAAC,KAAK,EAAE,CAAC,CAAC;YAC1B,MAAM,EAAE,GAAG,KAAK,CAAC,KAAK,EAAE,CAAC,CAAC;YAE1B,2BAA2B;YAC3B,MAAM,cAAc,GAAG,MAAM,CAAC,SAAS,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC;YAEhD,IAAI,sBAAsB,GAAG,KAAK,CAAC;YAEnC,IAAI,cAAc,IAAI,CAAC,WAAW,EAAE,CAAC;gBACpC,6CAA6C;gBAC7C,iDAAiD;gBACjD,iEAAiE;gBACjE,sBAAsB,GAAG,IAAI,CAAC;YAC/B,CAAC;iBAAM,CAAC;gBACP,uDAAuD;gBACvD,IAAI,CAAC,OAAO,CAAC,CAAC,GAAG,EAAE,CAAC;gBACpB,IAAI,CAAC,OAAO,CAAC,CAAC,GAAG,EAAE,CAAC;gBACpB,IAAI,CAAC,OAAO,CAAC,CAAC,GAAG,EAAE,CAAC;gBAEpB,2BAA2B;gBAC3B,IAAI,CAAC,IAAI,CAAC,aAAa,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,MAAM,EAAE,KAAK,EAAE,kBAAkB,EAAE,GAAG,CAAC,EAAE,CAAC;oBAC7E,SAAS;gBACV,CAAC;gBAED,IAAI,OAAO,GAAG,IAAI,CAAC;gBACnB,mBAAmB;gBACnB,IAAI,CAAC;oBACJ,KAAK,IAAI,EAAE,GAAG,CAAC,EAAE,EAAE,GAAG,UAAU,CAAC,SAAS,EAAE,EAAE,EAAE,EAAE,CAAC;wBAClD,KAAK,IAAI,EAAE,GAAG,CAAC,EAAE,EAAE,GAAG,UAAU,CAAC,SAAS,EAAE,EAAE,EAAE,EAAE,CAAC;4BAClD,IAAI,CAAC,OAAO,CAAC,CAAC,GAAG,EAAE,GAAG,EAAE,CAAC;4BACzB,IAAI,CAAC,OAAO,CAAC,CAAC,GAAG,EAAE,GAAG,EAAE,CAAC;4BACzB,MAAM,KAAK,GAAG,SAAS,CAAC,QAAQ,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;4BAC/C,IAAI,CAAC,KAAK,IAAI,CAAC,WAAW,CAAC,KAAK,CAAC,EAAE,CAAC;gCACnC,OAAO,GAAG,KAAK,CAAC;gCAChB,MAAM;4BACP,CAAC;wBACF,CAAC;wBACD,IAAI,CAAC,OAAO;4BAAE,MAAM;oBACrB,CAAC;gBACF,CAAC;gBAAC,OAAO,CAAC,EAAE,CAAC;oBACZ,OAAO,GAAG,KAAK,CAAC;gBACjB,CAAC;gBAED,IAAI,OAAO,EAAE,CAAC;oBACb,MAAM,CAAC,YAAY,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,CAAC,CAAC;oBAChC,sBAAsB,GAAG,IAAI,CAAC;gBAC/B,CAAC;YACF,CAAC;YAED,IAAI,sBAAsB,EAAE,CAAC;gBAC5B,KAAK,MAAM,GAAG,IAAI,IAAI,CAAC,UAAU,EAAE,CAAC;oBACnC,MAAM,EAAE,GAAG,EAAE,GAAG,GAAG,CAAC,CAAC,CAAC;oBACtB,MAAM,EAAE,GAAG,EAAE,GAAG,GAAG,CAAC,CAAC,CAAC;oBACtB,MAAM,EAAE,GAAG,EAAE,GAAG,GAAG,CAAC,CAAC,CAAC;oBAEtB,yEAAyE;oBACzE,IAAI,CAAC,IAAI,CAAC,aAAa,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,MAAM,EAAE,KAAK,EAAE,kBAAkB,EAAE,GAAG,CAAC,EAAE,CAAC;wBAC7E,SAAS;oBACV,CAAC;oBAED,IAAI,SAAS,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,CAAC;wBAAE,SAAS;oBAEpC,WAAW,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,CAAC,CAAC;oBACxB,WAAW,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,CAAC,CAAC;gBACzB,CAAC;YACF,CAAC;QACF,CAAC;QACD,wHAAwH;QAExH,OAAO,MAAM,CAAC;IACf,CAAC;IAEO,WAAW,CAAC,CAAS,EAAE,CAAS,EAAE,CAAS;QAClD,OAAO,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC;IACzB,CAAC;IAEO,aAAa,CACpB,CAAS,EACT,CAAS,EACT,CAAS,EACT,MAAe,EACf,KAAgB,EAChB,IAAa,EACb,GAAW;QAEX,MAAM,EAAE,GAAG,CAAC,GAAG,MAAM,CAAC,CAAC,CAAC;QACxB,MAAM,EAAE,GAAG,CAAC,GAAG,MAAM,CAAC,CAAC,CAAC;QACxB,MAAM,EAAE,GAAG,CAAC,GAAG,MAAM,CAAC,CAAC,CAAC;QAExB,QAAQ,KAAK,EAAE,CAAC;YACf,KAAK,MAAM;gBACV,OAAO,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,IAAI,CAAC,CAAC,IAAI,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,IAAI,CAAC,CAAC,IAAI,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,IAAI,CAAC,CAAC,CAAC;YACnF,KAAK,QAAQ;gBACZ,OAAO,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,IAAI,GAAG,CAAC;YAC3C,KAAK,UAAU;gBACd,qCAAqC;gBACrC,OAAO,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,IAAI,GAAG,IAAI,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,IAAI,CAAC,CAAC,CAAC;YAC3D;gBACC,OAAO,KAAK,CAAC;QACf,CAAC;IACF,CAAC;CACD"}

package/dist/math/Perlin2D.d.ts

@@ -0,0 +1,12 @@
+export declare class Perlin2D {
+    private static _instances;
+    private perm;
+    static getInstance(seed?: number): Perlin2D;
+    constructor(seed?: number);
+    private fade;
+    private grad;
+    private lerp;
+    noise(x: number, y: number): number;
+    fbm(x: number, y: number, octaves: number, persistence: number): number;
+}
+//# sourceMappingURL=Perlin2D.d.ts.map

package/dist/math/Perlin2D.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"Perlin2D.d.ts","sourceRoot":"","sources":["../../src/math/Perlin2D.ts"],"names":[],"mappings":"AAaA,qBAAa,QAAQ;IACpB,OAAO,CAAC,MAAM,CAAC,UAAU,CAAgC;IACzD,OAAO,CAAC,IAAI,CAAW;WAET,WAAW,CAAC,IAAI,CAAC,EAAE,MAAM,GAAG,QAAQ;gBAOtC,IAAI,SAAO;IAgCvB,OAAO,CAAC,IAAI;IAQZ,OAAO,CAAC,IAAI;IAaZ,OAAO,CAAC,IAAI;IAKZ,KAAK,CAAC,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,MAAM,GAAG,MAAM;IAiCnC,GAAG,CAAC,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,MAAM,EAAE,OAAO,EAAE,MAAM,EAAE,WAAW,EAAE,MAAM,GAAG,MAAM;CAcvE"}

package/dist/math/Perlin2D.js

@@ -0,0 +1,115 @@
+// =================================================================================
+//                               PERLIN NOISE (2D)
+// =================================================================================
+// We implement a compact, deterministic 2D Perlin:
+// - A seedable xorshift32 RNG shuffles a 0..255 array into a permutation table.
+//   Why xorshift? Tiny, fast, deterministic — perfect for shuffling; cryptographic
+//   quality is unnecessary here.
+// - Quintic fade (6t^5-15t^4+10t^3) ensures C2 continuity at lattice boundaries,
+//   preventing creases where cells meet.
+// - Hash-derived gradient directions avoid storing a gradient table yet keep uniform
+//   angular spread (8 directions).
+// - Standard bilinear interpolation with faded weights blends the 4 corner grads.
+export class Perlin2D {
+    static _instances = {};
+    perm; // 512-length perm table (0..255 duplicated) for fast, wraparound indexing
+    static getInstance(seed) {
+        if (!this._instances[seed ?? 1337]) {
+            this._instances[seed ?? 1337] = new Perlin2D(seed);
+        }
+        return this._instances[seed ?? 1337];
+    }
+    constructor(seed = 1337) {
+        // --- Seeded RNG (xorshift32) — tiny & fast, good enough for permutation shuffle ---
+        // In other words, a fancy way to make a "pseudorandom number generator"
+        let state = seed | 0 || 1; // force 32-bit int; avoid 0 state by falling back to 1
+        const random = () => {
+            // Advance the state using xorshift recipe (Marsaglia):
+            state ^= state << 13; // mix high bits into low by left shift and XOR
+            state ^= state >>> 17; // spread entropy across the word with right shift XOR
+            state ^= state << 5; // another left shift XOR to finish the cycle
+            // // Convert unsigned 32-bit int to [0,1) float
+            return (state >>> 0) / 0xffffffff;
+        };
+        // Build base array [0..255]
+        const permutation = Array.from({ length: 256 }, (_, i) => i);
+        // Fisher-Yates shuffle using our seeded RNG for reproducibility
+        // In other words, a fancy way to "randomize" the array
+        // Pseudo-random, but deterministic given the same seed
+        for (let currentIndex = 255; currentIndex > 0; currentIndex--) {
+            const randomIndex = Math.floor(random() * (currentIndex + 1));
+            [permutation[currentIndex], permutation[randomIndex]] = [permutation[randomIndex], permutation[currentIndex]]; // swap
+        }
+        // Duplicate to 512 to allow cheap indexing with i & 255 and i+1 without bounds checks
+        this.perm = new Array(512);
+        for (let i = 0; i < 512; i++)
+            this.perm[i] = permutation[i & 255]; // i & 255 == i % 256
+    }
+    // Quintic fade: smoothstep with zero first/second derivatives at t=0 and t=1.
+    // Prevents visible grid seams when interpolating across cells.
+    // (6t^5-15t^4+10t^3) https://www.desmos.com/calculator/ykrjhcst6v
+    fade(weight) {
+        return weight * weight * weight * (weight * (6 * weight - 15) + 10);
+    }
+    // Derive a small set of 2D gradient directions from the hashed corner index.
+    // A dot product of the gradient and the (x,y) offset from the corner gives
+    // This calculates the alignment of our pseudorandom gradient value with XY
+    // and is used to determine the behaviour of the slope between the points.
+    grad(cornerHash, x, y) {
+        // We have 8 possible directions (N,NE,E,SE,S,SW,W,NW)
+        const direction = cornerHash & 7; // 0..7 → choose among 8 directions
+        const primary = direction < 4 ? x : y; // select primary component
+        const secondary = direction < 4 ? y : x; // select secondary component
+        // Assign signs based on low bits; compute dot product with (x,y)
+        const gradX = (direction & 1) === 0 ? 1 : -1; // primary sign
+        const gradY = (direction & 2) === 0 ? 1 : -1; // secondary sign
+        // return gradX * primary + gradY * secondary; // dot product with (x,y)
+        return gradX * primary + gradY * secondary;
+    }
+    // Linear interpolation between a and b with weight t
+    lerp(weight, start, end) {
+        return start + weight * (end - start);
+    }
+    // Raw Perlin value in roughly [-1, 1]
+    noise(x, y) {
+        // Locate integer cell (X,Y) and fractional offset inside it (xf,yf)
+        const cellX = Math.floor(x) & 255; // wrap to 0..255 for perm indexing
+        const cellY = Math.floor(y) & 255;
+        const offsetX = x - Math.floor(x); // 0..1
+        const offsetY = y - Math.floor(y);
+        // Compute eased weights along x and y
+        const fadedX = this.fade(offsetX);
+        const fadedY = this.fade(offsetY);
+        // Hash 4 corners of the cell
+        // (Find pseudo-random gradient indices for each corner using permutation table)
+        // grab a random cell indexed by cellX then use that value to index cellY
+        const cornerHash00 = this.perm[this.perm[cellX] + cellY];
+        const cornerHash01 = this.perm[this.perm[cellX] + cellY + 1];
+        const cornerHash10 = this.perm[this.perm[cellX + 1] + cellY];
+        const cornerHash11 = this.perm[this.perm[cellX + 1] + cellY + 1];
+        // Dot products of gradients with offsets, then bilinear interpolate with eased weights
+        const startBottom = this.grad(cornerHash00, offsetX, offsetY); // bottom-left corner
+        const endBottom = this.grad(cornerHash10, offsetX - 1, offsetY); // bottom-right corner
+        const interpolatedBottom = this.lerp(fadedX, startBottom, endBottom);
+        const startTop = this.grad(cornerHash01, offsetX, offsetY - 1); // top-left corner
+        const endTop = this.grad(cornerHash11, offsetX - 1, offsetY - 1); // top-right corner
+        const interpolatedTop = this.lerp(fadedX, startTop, endTop);
+        return this.lerp(fadedY, interpolatedBottom, interpolatedTop);
+    }
+    // Fractal Brownian Motion: sum octaves with increasing frequency and decaying amplitude,
+    // then normalize by total amplitude to keep overall range stable across octave counts.
+    fbm(x, y, octaves, persistence) {
+        let amplitude = 1; // starting amplitude
+        let frequency = 1; // starting frequency
+        let noiseSum = 0; // accumulated value
+        let totalAmplitude = 0; // accumulated amplitude for normalization
+        for (let octave = 0; octave < octaves; octave++) {
+            noiseSum += this.noise(x * frequency, y * frequency) * amplitude; // sample at current freq, scale by amp
+            totalAmplitude += amplitude; // track amplitude sum
+            amplitude *= persistence; // next octave is quieter
+            frequency *= 2; // and higher frequency
+        }
+        return noiseSum / totalAmplitude; // keep output roughly within [-1,1] regardless of octave count
+    }
+}
+//# sourceMappingURL=Perlin2D.js.map

package/dist/math/Perlin2D.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"Perlin2D.js","sourceRoot":"","sources":["../../src/math/Perlin2D.ts"],"names":[],"mappings":"AAAA,oFAAoF;AACpF,kDAAkD;AAClD,oFAAoF;AACpF,mDAAmD;AACnD,gFAAgF;AAChF,mFAAmF;AACnF,iCAAiC;AACjC,iFAAiF;AACjF,yCAAyC;AACzC,qFAAqF;AACrF,mCAAmC;AACnC,kFAAkF;AAElF,MAAM,OAAO,QAAQ;IACZ,MAAM,CAAC,UAAU,GAA6B,EAAE,CAAC;IACjD,IAAI,CAAW,CAAC,0EAA0E;IAE3F,MAAM,CAAC,WAAW,CAAC,IAAa;QACtC,IAAI,CAAC,IAAI,CAAC,UAAU,CAAC,IAAI,IAAI,IAAI,CAAC,EAAE,CAAC;YACpC,IAAI,CAAC,UAAU,CAAC,IAAI,IAAI,IAAI,CAAC,GAAG,IAAI,QAAQ,CAAC,IAAI,CAAC,CAAC;QACpD,CAAC;QACD,OAAO,IAAI,CAAC,UAAU,CAAC,IAAI,IAAI,IAAI,CAAC,CAAC;IACtC,CAAC;IAED,YAAY,IAAI,GAAG,IAAI;QACtB,qFAAqF;QACrF,wEAAwE;QACxE,IAAI,KAAK,GAAG,IAAI,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,uDAAuD;QAClF,MAAM,MAAM,GAAG,GAAG,EAAE;YACnB,uDAAuD;YACvD,KAAK,IAAI,KAAK,IAAI,EAAE,CAAC,CAAC,+CAA+C;YACrE,KAAK,IAAI,KAAK,KAAK,EAAE,CAAC,CAAC,sDAAsD;YAC7E,KAAK,IAAI,KAAK,IAAI,CAAC,CAAC,CAAC,6CAA6C;YAClE,gDAAgD;YAChD,OAAO,CAAC,KAAK,KAAK,CAAC,CAAC,GAAG,UAAU,CAAC;QACnC,CAAC,CAAC;QAEF,4BAA4B;QAC5B,MAAM,WAAW,GAAa,KAAK,CAAC,IAAI,CAAC,EAAE,MAAM,EAAE,GAAG,EAAE,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC;QAEvE,gEAAgE;QAChE,uDAAuD;QACvD,uDAAuD;QACvD,KAAK,IAAI,YAAY,GAAG,GAAG,EAAE,YAAY,GAAG,CAAC,EAAE,YAAY,EAAE,EAAE,CAAC;YAC/D,MAAM,WAAW,GAAG,IAAI,CAAC,KAAK,CAAC,MAAM,EAAE,GAAG,CAAC,YAAY,GAAG,CAAC,CAAC,CAAC,CAAC;YAC9D,CAAC,WAAW,CAAC,YAAY,CAAC,EAAE,WAAW,CAAC,WAAW,CAAC,CAAC,GAAG,CAAC,WAAW,CAAC,WAAW,CAAC,EAAE,WAAW,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC,OAAO;QACvH,CAAC;QAED,sFAAsF;QACtF,IAAI,CAAC,IAAI,GAAG,IAAI,KAAK,CAAC,GAAG,CAAC,CAAC;QAC3B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,GAAG,EAAE,CAAC,EAAE;YAAE,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,GAAG,WAAW,CAAC,CAAC,GAAG,GAAG,CAAC,CAAC,CAAC,qBAAqB;IACzF,CAAC;IAED,8EAA8E;IAC9E,+DAA+D;IAC/D,kEAAkE;IAC1D,IAAI,CAAC,MAAc;QAC1B,OAAO,MAAM,GAAG,MAAM,GAAG,MAAM,GAAG,CAAC,MAAM,GAAG,CAAC,CAAC,GAAG,MAAM,GAAG,EAAE,CAAC,GAAG,EAAE,CAAC,CAAC;IACrE,CAAC;IAED,6EAA6E;IAC7E,2EAA2E;IAC3E,2EAA2E;IAC3E,0EAA0E;IAClE,IAAI,CAAC,UAAkB,EAAE,CAAS,EAAE,CAAS;QACpD,sDAAsD;QACtD,MAAM,SAAS,GAAG,UAAU,GAAG,CAAC,CAAC,CAAC,mCAAmC;QACrE,MAAM,OAAO,GAAG,SAAS,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,2BAA2B;QAClE,MAAM,SAAS,GAAG,SAAS,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,6BAA6B;QACtE,iEAAiE;QACjE,MAAM,KAAK,GAAG,CAAC,SAAS,GAAG,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,eAAe;QAC7D,MAAM,KAAK,GAAG,CAAC,SAAS,GAAG,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,iBAAiB;QAC/D,wEAAwE;QACxE,OAAO,KAAK,GAAG,OAAO,GAAG,KAAK,GAAG,SAAS,CAAC;IAC5C,CAAC;IAED,qDAAqD;IAC7C,IAAI,CAAC,MAAc,EAAE,KAAa,EAAE,GAAW;QACtD,OAAO,KAAK,GAAG,MAAM,GAAG,CAAC,GAAG,GAAG,KAAK,CAAC,CAAC;IACvC,CAAC;IAED,sCAAsC;IACtC,KAAK,CAAC,CAAS,EAAE,CAAS;QACzB,oEAAoE;QACpE,MAAM,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,GAAG,GAAG,CAAC,CAAC,mCAAmC;QACtE,MAAM,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,GAAG,GAAG,CAAC;QAClC,MAAM,OAAO,GAAG,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,OAAO;QAC1C,MAAM,OAAO,GAAG,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;QAElC,sCAAsC;QACtC,MAAM,MAAM,GAAG,IAAI,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;QAClC,MAAM,MAAM,GAAG,IAAI,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;QAElC,6BAA6B;QAC7B,gFAAgF;QAChF,yEAAyE;QACzE,MAAM,YAAY,GAAG,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,GAAG,KAAK,CAAC,CAAC;QACzD,MAAM,YAAY,GAAG,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,GAAG,KAAK,GAAG,CAAC,CAAC,CAAC;QAC7D,MAAM,YAAY,GAAG,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,GAAG,CAAC,CAAC,GAAG,KAAK,CAAC,CAAC;QAC7D,MAAM,YAAY,GAAG,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,GAAG,CAAC,CAAC,GAAG,KAAK,GAAG,CAAC,CAAC,CAAC;QAEjE,uFAAuF;QACvF,MAAM,WAAW,GAAG,IAAI,CAAC,IAAI,CAAC,YAAY,EAAE,OAAO,EAAE,OAAO,CAAC,CAAC,CAAC,qBAAqB;QACpF,MAAM,SAAS,GAAG,IAAI,CAAC,IAAI,CAAC,YAAY,EAAE,OAAO,GAAG,CAAC,EAAE,OAAO,CAAC,CAAC,CAAC,sBAAsB;QACvF,MAAM,kBAAkB,GAAG,IAAI,CAAC,IAAI,CAAC,MAAM,EAAE,WAAW,EAAE,SAAS,CAAC,CAAC;QAErE,MAAM,QAAQ,GAAG,IAAI,CAAC,IAAI,CAAC,YAAY,EAAE,OAAO,EAAE,OAAO,GAAG,CAAC,CAAC,CAAC,CAAC,kBAAkB;QAClF,MAAM,MAAM,GAAG,IAAI,CAAC,IAAI,CAAC,YAAY,EAAE,OAAO,GAAG,CAAC,EAAE,OAAO,GAAG,CAAC,CAAC,CAAC,CAAC,mBAAmB;QACrF,MAAM,eAAe,GAAG,IAAI,CAAC,IAAI,CAAC,MAAM,EAAE,QAAQ,EAAE,MAAM,CAAC,CAAC;QAE5D,OAAO,IAAI,CAAC,IAAI,CAAC,MAAM,EAAE,kBAAkB,EAAE,eAAe,CAAC,CAAC;IAC/D,CAAC;IAED,yFAAyF;IACzF,uFAAuF;IACvF,GAAG,CAAC,CAAS,EAAE,CAAS,EAAE,OAAe,EAAE,WAAmB;QAC7D,IAAI,SAAS,GAAG,CAAC,CAAC,CAAC,qBAAqB;QACxC,IAAI,SAAS,GAAG,CAAC,CAAC,CAAC,qBAAqB;QACxC,IAAI,QAAQ,GAAG,CAAC,CAAC,CAAC,oBAAoB;QACtC,IAAI,cAAc,GAAG,CAAC,CAAC,CAAC,0CAA0C;QAElE,KAAK,IAAI,MAAM,GAAG,CAAC,EAAE,MAAM,GAAG,OAAO,EAAE,MAAM,EAAE,EAAE,CAAC;YACjD,QAAQ,IAAI,IAAI,CAAC,KAAK,CAAC,CAAC,GAAG,SAAS,EAAE,CAAC,GAAG,SAAS,CAAC,GAAG,SAAS,CAAC,CAAC,uCAAuC;YACzG,cAAc,IAAI,SAAS,CAAC,CAAC,sBAAsB;YACnD,SAAS,IAAI,WAAW,CAAC,CAAC,yBAAyB;YACnD,SAAS,IAAI,CAAC,CAAC,CAAC,uBAAuB;QACxC,CAAC;QACD,OAAO,QAAQ,GAAG,cAAc,CAAC,CAAC,+DAA+D;IAClG,CAAC"}