agentic-qe 3.6.8 → 3.6.10

package/v3/dist/kernel/unified-memory-hnsw.js

@@ -0,0 +1,547 @@
+/**
+ * In-Memory HNSW Index for Fast Vector Search
+ *
+ * Provides O(log n) approximate nearest neighbor search via a multi-layer
+ * navigable small-world graph. Extracted from unified-memory.ts.
+ *
+ * Algorithm reference: Malkov & Yashunin, "Efficient and robust approximate
+ * nearest neighbor search using Hierarchical Navigable Small World graphs",
+ * IEEE TPAMI 2018.
+ */
+import { cosineSimilarity } from '../shared/utils/vector-math.js';
+import { HNSW_CONSTANTS } from './constants.js';
+// Try to load @ruvector/gnn for native Rust-powered search
+let ruvectorDifferentiableSearch = null;
+let ruvectorInit = null;
+try {
+    // eslint-disable-next-line @typescript-eslint/no-require-imports
+    const gnn = require('@ruvector/gnn');
+    ruvectorDifferentiableSearch = gnn.differentiableSearch;
+    ruvectorInit = gnn.init;
+}
+catch {
+    // @ruvector/gnn not available — RuvectorFlatIndex will fall back to JS cosine
+}
+// ============================================================================
+// Binary Heap (used by HNSW beam search)
+// ============================================================================
+/**
+ * Binary min/max heap for O(log n) insertion and extraction.
+ * Replaces sorted arrays with O(n) splice in HNSW beam search.
+ */
+export class BinaryHeap {
+    data = [];
+    compareFn;
+    constructor(compareFn) {
+        this.compareFn = compareFn;
+    }
+    push(item) {
+        this.data.push(item);
+        this.bubbleUp(this.data.length - 1);
+    }
+    pop() {
+        if (this.data.length === 0)
+            return undefined;
+        const top = this.data[0];
+        const last = this.data.pop();
+        if (this.data.length > 0) {
+            this.data[0] = last;
+            this.sinkDown(0);
+        }
+        return top;
+    }
+    peek() {
+        return this.data[0];
+    }
+    size() {
+        return this.data.length;
+    }
+    bubbleUp(i) {
+        while (i > 0) {
+            const parent = (i - 1) >> 1;
+            if (this.compareFn(this.data[i], this.data[parent]) < 0) {
+                [this.data[i], this.data[parent]] = [this.data[parent], this.data[i]];
+                i = parent;
+            }
+            else {
+                break;
+            }
+        }
+    }
+    sinkDown(i) {
+        const n = this.data.length;
+        while (true) {
+            let smallest = i;
+            const left = 2 * i + 1;
+            const right = 2 * i + 2;
+            if (left < n && this.compareFn(this.data[left], this.data[smallest]) < 0) {
+                smallest = left;
+            }
+            if (right < n && this.compareFn(this.data[right], this.data[smallest]) < 0) {
+                smallest = right;
+            }
+            if (smallest !== i) {
+                [this.data[i], this.data[smallest]] = [this.data[smallest], this.data[i]];
+                i = smallest;
+            }
+            else {
+                break;
+            }
+        }
+    }
+}
+// ============================================================================
+// HNSW Index
+// ============================================================================
+/**
+ * In-memory HNSW (Hierarchical Navigable Small World) index built from
+ * SQLite vectors on startup. Provides O(log n) approximate nearest
+ * neighbor search via a multi-layer navigable small-world graph.
+ */
+export class InMemoryHNSWIndex {
+    nodes = new Map();
+    M = HNSW_CONSTANTS.M_CONNECTIONS;
+    Mmax0 = HNSW_CONSTANTS.M_CONNECTIONS * 2;
+    efConstruction = HNSW_CONSTANTS.EF_CONSTRUCTION;
+    efSearch = HNSW_CONSTANTS.EF_SEARCH;
+    mL = 1 / Math.log(HNSW_CONSTANTS.M_CONNECTIONS);
+    maxLevel = 16;
+    entryPoint = null;
+    currentMaxLevel = -1;
+    /**
+     * Assign a random layer for a new node using a geometric distribution.
+     * level = floor(-ln(uniform_random) * mL), capped at maxLevel.
+     */
+    randomLevel() {
+        return Math.min(Math.floor(-Math.log(Math.random()) * this.mL), this.maxLevel);
+    }
+    /**
+     * Compute cosine similarity between a query vector and a stored node.
+     */
+    similarity(query, nodeId) {
+        const node = this.nodes.get(nodeId);
+        if (!node)
+            return -1;
+        return cosineSimilarity(query, node.embedding);
+    }
+    /**
+     * Greedy search at a single layer: starting from a single entry point,
+     * greedily move to the neighbor closest to the query until no improvement.
+     * Returns the closest node found.
+     */
+    searchLayer(query, entryId, level) {
+        let current = entryId;
+        let currentDist = this.similarity(query, current);
+        let improved = true;
+        while (improved) {
+            improved = false;
+            const node = this.nodes.get(current);
+            if (!node)
+                break;
+            const neighbors = node.neighbors.get(level) ?? [];
+            for (const neighborId of neighbors) {
+                if (!this.nodes.has(neighborId))
+                    continue;
+                const dist = this.similarity(query, neighborId);
+                if (dist > currentDist) {
+                    current = neighborId;
+                    currentDist = dist;
+                    improved = true;
+                }
+            }
+        }
+        return current;
+    }
+    /**
+     * Beam search at a single layer: starting from an entry point, explore
+     * up to `ef` candidates and return the `ef` closest found.
+     * Uses a max-heap for candidates and a min-heap for results to achieve
+     * O(log n) insertion instead of O(n) Array.splice.
+     * Returns results sorted by descending similarity.
+     */
+    searchLayerBeam(query, entryIds, level, ef) {
+        const visited = new Set(entryIds);
+        const initial = entryIds
+            .filter(id => this.nodes.has(id))
+            .map(id => ({ id, score: this.similarity(query, id) }));
+        // Max-heap for candidates (best score = highest priority)
+        const candidateHeap = new BinaryHeap((a, b) => b.score - a.score // max-heap: highest score first
+        );
+        // Min-heap for results (worst score at top for fast eviction)
+        const resultHeap = new BinaryHeap((a, b) => a.score - b.score // min-heap: lowest score first
+        );
+        for (const entry of initial) {
+            candidateHeap.push(entry);
+            resultHeap.push(entry);
+        }
+        while (candidateHeap.size() > 0) {
+            const closest = candidateHeap.pop();
+            // If the closest candidate is worse than the worst in results
+            // and we already have ef results, stop
+            if (resultHeap.size() >= ef && closest.score < resultHeap.peek().score) {
+                break;
+            }
+            const node = this.nodes.get(closest.id);
+            if (!node)
+                continue;
+            const neighbors = node.neighbors.get(level) ?? [];
+            for (const neighborId of neighbors) {
+                if (visited.has(neighborId))
+                    continue;
+                visited.add(neighborId);
+                if (!this.nodes.has(neighborId))
+                    continue;
+                const score = this.similarity(query, neighborId);
+                const worstResult = resultHeap.size() >= ef ? resultHeap.peek().score : -Infinity;
+                if (resultHeap.size() < ef || score > worstResult) {
+                    const entry = { id: neighborId, score };
+                    candidateHeap.push(entry);
+                    resultHeap.push(entry);
+                    // Evict worst result if over capacity
+                    if (resultHeap.size() > ef) {
+                        resultHeap.pop();
+                    }
+                }
+            }
+        }
+        // Drain result heap into array sorted descending by score
+        const results = [];
+        while (resultHeap.size() > 0) {
+            results.push(resultHeap.pop());
+        }
+        results.reverse(); // min-heap drains ascending, reverse for descending
+        return results;
+    }
+    /**
+     * Select the M best neighbors from candidates for a node, using the
+     * simple heuristic (closest M by similarity).
+     */
+    selectNeighbors(_query, candidates, maxConnections) {
+        return candidates
+            .sort((a, b) => b.score - a.score)
+            .slice(0, maxConnections)
+            .map(c => c.id);
+    }
+    /**
+     * Get max connections allowed at a given level.
+     * Level 0 allows Mmax0 (= 2*M), higher levels allow M.
+     */
+    getMaxConnections(level) {
+        return level === 0 ? this.Mmax0 : this.M;
+    }
+    /**
+     * Add a vector to the HNSW index with proper graph construction.
+     * O(log n) amortized via hierarchical layer structure.
+     */
+    add(id, embedding) {
+        // Handle duplicate: remove old node first
+        if (this.nodes.has(id)) {
+            this.remove(id);
+        }
+        const nodeLevel = this.randomLevel();
+        const newNode = {
+            id,
+            embedding,
+            neighbors: new Map(),
+        };
+        // Initialize neighbor lists for each layer
+        for (let l = 0; l <= nodeLevel; l++) {
+            newNode.neighbors.set(l, []);
+        }
+        this.nodes.set(id, newNode);
+        // First node: set as entry point
+        if (this.entryPoint === null) {
+            this.entryPoint = id;
+            this.currentMaxLevel = nodeLevel;
+            return;
+        }
+        let currentEntry = this.entryPoint;
+        // Phase 1: Traverse layers above the new node's level (greedy descent)
+        for (let l = this.currentMaxLevel; l > nodeLevel; l--) {
+            currentEntry = this.searchLayer(embedding, currentEntry, l);
+        }
+        // Phase 2: For each layer from nodeLevel down to 0, find neighbors and link
+        for (let l = Math.min(nodeLevel, this.currentMaxLevel); l >= 0; l--) {
+            const maxConn = this.getMaxConnections(l);
+            // Beam search to find efConstruction nearest neighbors at this layer
+            const nearest = this.searchLayerBeam(embedding, [currentEntry], l, this.efConstruction);
+            // Select M best neighbors
+            const selectedIds = this.selectNeighbors(embedding, nearest, maxConn);
+            // Set the new node's neighbors at this layer
+            newNode.neighbors.set(l, [...selectedIds]);
+            // Add bidirectional connections and prune if over capacity
+            for (const neighborId of selectedIds) {
+                const neighbor = this.nodes.get(neighborId);
+                if (!neighbor)
+                    continue;
+                const neighborList = neighbor.neighbors.get(l) ?? [];
+                neighborList.push(id);
+                // Prune if neighbor has too many connections
+                if (neighborList.length > maxConn) {
+                    // Keep the maxConn closest neighbors
+                    const scored = neighborList
+                        .filter(nId => this.nodes.has(nId))
+                        .map(nId => ({
+                        id: nId,
+                        score: cosineSimilarity(neighbor.embedding, this.nodes.get(nId).embedding),
+                    }));
+                    scored.sort((a, b) => b.score - a.score);
+                    neighbor.neighbors.set(l, scored.slice(0, maxConn).map(s => s.id));
+                }
+                else {
+                    neighbor.neighbors.set(l, neighborList);
+                }
+            }
+            // Update entry for next layer down
+            if (nearest.length > 0) {
+                currentEntry = nearest[0].id;
+            }
+        }
+        // Update entry point if new node's level exceeds current max
+        if (nodeLevel > this.currentMaxLevel) {
+            this.entryPoint = id;
+            this.currentMaxLevel = nodeLevel;
+        }
+    }
+    /**
+     * Remove a node from the HNSW index and repair connections.
+     * Orphaned neighbors are reconnected to the removed node's other neighbors.
+     */
+    remove(id) {
+        const node = this.nodes.get(id);
+        if (!node)
+            return false;
+        // For each layer the node exists in, remove from neighbor lists and repair
+        for (const [level, neighbors] of node.neighbors.entries()) {
+            for (const neighborId of neighbors) {
+                const neighbor = this.nodes.get(neighborId);
+                if (!neighbor)
+                    continue;
+                const neighborList = neighbor.neighbors.get(level);
+                if (!neighborList)
+                    continue;
+                // Remove the deleted node from this neighbor's list
+                const idx = neighborList.indexOf(id);
+                if (idx !== -1) {
+                    neighborList.splice(idx, 1);
+                }
+                // Try to reconnect: for each of the deleted node's other neighbors,
+                // add a connection if capacity allows and not already connected
+                const maxConn = this.getMaxConnections(level);
+                if (neighborList.length < maxConn) {
+                    for (const otherNeighborId of neighbors) {
+                        if (otherNeighborId !== neighborId &&
+                            otherNeighborId !== id &&
+                            this.nodes.has(otherNeighborId) &&
+                            !neighborList.includes(otherNeighborId)) {
+                            neighborList.push(otherNeighborId);
+                            // Add reverse connection too
+                            const otherNeighbor = this.nodes.get(otherNeighborId);
+                            if (otherNeighbor) {
+                                const otherList = otherNeighbor.neighbors.get(level) ?? [];
+                                if (!otherList.includes(neighborId) && otherList.length < maxConn) {
+                                    otherList.push(neighborId);
+                                    otherNeighbor.neighbors.set(level, otherList);
+                                }
+                            }
+                            if (neighborList.length >= maxConn)
+                                break;
+                        }
+                    }
+                }
+                neighbor.neighbors.set(level, neighborList);
+            }
+        }
+        // Delete the node
+        this.nodes.delete(id);
+        // If the entry point was removed, pick a replacement
+        if (this.entryPoint === id) {
+            if (this.nodes.size === 0) {
+                this.entryPoint = null;
+                this.currentMaxLevel = -1;
+            }
+            else {
+                // Find the node with the highest level to be the new entry point
+                let bestId = null;
+                let bestLevel = -1;
+                for (const [nodeId, n] of this.nodes.entries()) {
+                    let maxNodeLevel = -1;
+                    for (const l of n.neighbors.keys()) {
+                        if (l > maxNodeLevel)
+                            maxNodeLevel = l;
+                    }
+                    if (maxNodeLevel > bestLevel) {
+                        bestLevel = maxNodeLevel;
+                        bestId = nodeId;
+                    }
+                }
+                this.entryPoint = bestId;
+                this.currentMaxLevel = bestLevel;
+            }
+        }
+        return true;
+    }
+    /**
+     * Search for k approximate nearest neighbors using HNSW traversal.
+     * O(log n) via hierarchical layer descent + beam search at base layer.
+     */
+    search(query, k) {
+        if (this.nodes.size === 0 || this.entryPoint === null) {
+            return [];
+        }
+        // Single node shortcut
+        if (this.nodes.size === 1) {
+            const node = this.nodes.get(this.entryPoint);
+            return [{ id: node.id, score: cosineSimilarity(query, node.embedding) }];
+        }
+        let currentEntry = this.entryPoint;
+        // Phase 1: Greedily traverse layers above base to find local minimum
+        for (let l = this.currentMaxLevel; l > 0; l--) {
+            currentEntry = this.searchLayer(query, currentEntry, l);
+        }
+        // Phase 2: Beam search at layer 0 with efSearch candidates
+        const ef = Math.max(this.efSearch, k);
+        const results = this.searchLayerBeam(query, [currentEntry], 0, ef);
+        // Return top-k results sorted by descending similarity
+        return results.slice(0, k);
+    }
+    /**
+     * Get index size
+     */
+    size() {
+        return this.nodes.size;
+    }
+    /**
+     * Clear the index and reset entry point
+     */
+    clear() {
+        this.nodes.clear();
+        this.entryPoint = null;
+        this.currentMaxLevel = -1;
+    }
+}
+// ============================================================================
+// Ruvector Flat Index (native Rust brute-force with differentiable search)
+// ============================================================================
+/** Compute L2 norm of a Float32Array. */
+function computeNorm(v) {
+    let sum = 0;
+    for (let i = 0; i < v.length; i++)
+        sum += v[i] * v[i];
+    return Math.sqrt(sum);
+}
+/** Cosine similarity using pre-computed norms — just a dot product + division. */
+function fastCosine(a, b, normA, normB) {
+    const denom = normA * normB;
+    if (denom === 0)
+        return 0;
+    let dot = 0;
+    for (let i = 0; i < a.length; i++)
+        dot += a[i] * b[i];
+    return dot / denom;
+}
+/**
+ * Flat vector index using @ruvector/gnn's native Rust differentiable search.
+ *
+ * Trade-offs vs InMemoryHNSWIndex:
+ * - Build: O(1) per vector (just store) vs O(efConstruction * log n) for HNSW
+ * - Search: O(n) brute-force vs O(log n) for HNSW
+ * - For n < ~50k vectors, brute-force is faster end-to-end because the HNSW
+ *   graph construction cost dominates at startup (16s vs 5ms for 5073 vectors).
+ * - 100% recall vs ~70% for HNSW approximate search.
+ *
+ * Same interface as InMemoryHNSWIndex: add/search/remove/clear/size.
+ */
+export class RuvectorFlatIndex {
+    ids = [];
+    vectors = [];
+    /** Pre-computed L2 norms for each vector (enables dot-product-only cosine). */
+    norms = [];
+    idToIndex = new Map();
+    initialized = false;
+    constructor() {
+        if (ruvectorInit && !this.initialized) {
+            try {
+                ruvectorInit();
+                this.initialized = true;
+            }
+            catch {
+                // Already initialized or not available
+                this.initialized = ruvectorDifferentiableSearch !== null;
+            }
+        }
+    }
+    add(id, embedding) {
+        const f32 = new Float32Array(embedding);
+        const norm = computeNorm(f32);
+        // Handle duplicate: overwrite
+        if (this.idToIndex.has(id)) {
+            const idx = this.idToIndex.get(id);
+            this.vectors[idx] = f32;
+            this.norms[idx] = norm;
+            return;
+        }
+        const idx = this.ids.length;
+        this.ids.push(id);
+        this.vectors.push(f32);
+        this.norms.push(norm);
+        this.idToIndex.set(id, idx);
+    }
+    search(query, k) {
+        if (this.ids.length === 0)
+            return [];
+        const actualK = Math.min(k, this.ids.length);
+        // Use @ruvector/gnn native search for fast top-k ranking, then compute
+        // cosine scores using pre-cached norms (dot product + 1 division only).
+        if (ruvectorDifferentiableSearch && this.vectors.length > 0) {
+            const queryF32 = new Float32Array(query);
+            const queryNorm = computeNorm(queryF32);
+            const result = ruvectorDifferentiableSearch(queryF32, this.vectors, actualK, 1.0);
+            return result.indices.map((idx) => ({
+                id: this.ids[idx],
+                score: fastCosine(queryF32, this.vectors[idx], queryNorm, this.norms[idx]),
+            }));
+        }
+        // Fallback: JS brute-force with pre-cached norms
+        const queryF32 = new Float32Array(query);
+        const queryNorm = computeNorm(queryF32);
+        const scored = [];
+        for (let i = 0; i < this.ids.length; i++) {
+            scored.push({
+                id: this.ids[i],
+                score: fastCosine(queryF32, this.vectors[i], queryNorm, this.norms[i]),
+            });
+        }
+        scored.sort((a, b) => b.score - a.score);
+        return scored.slice(0, actualK);
+    }
+    remove(id) {
+        const idx = this.idToIndex.get(id);
+        if (idx === undefined)
+            return false;
+        // Swap with last element for O(1) removal
+        const lastIdx = this.ids.length - 1;
+        if (idx !== lastIdx) {
+            const lastId = this.ids[lastIdx];
+            this.ids[idx] = lastId;
+            this.vectors[idx] = this.vectors[lastIdx];
+            this.norms[idx] = this.norms[lastIdx];
+            this.idToIndex.set(lastId, idx);
+        }
+        this.ids.pop();
+        this.vectors.pop();
+        this.norms.pop();
+        this.idToIndex.delete(id);
+        return true;
+    }
+    clear() {
+        this.ids = [];
+        this.vectors = [];
+        this.norms = [];
+        this.idToIndex.clear();
+    }
+    size() {
+        return this.ids.length;
+    }
+}
+//# sourceMappingURL=unified-memory-hnsw.js.map

package/v3/dist/kernel/unified-memory-hnsw.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"unified-memory-hnsw.js","sourceRoot":"","sources":["../../src/kernel/unified-memory-hnsw.ts"],"names":[],"mappings":"AAAA;;;;;;;;;GASG;AAEH,OAAO,EAAE,gBAAgB,EAAE,MAAM,gCAAgC,CAAC;AAClE,OAAO,EAAE,cAAc,EAAE,MAAM,gBAAgB,CAAC;AAEhD,2DAA2D;AAC3D,IAAI,4BAA4B,GAEwB,IAAI,CAAC;AAC7D,IAAI,YAAY,GAA0B,IAAI,CAAC;AAE/C,IAAI,CAAC;IACH,iEAAiE;IACjE,MAAM,GAAG,GAAG,OAAO,CAAC,eAAe,CAAC,CAAC;IACrC,4BAA4B,GAAG,GAAG,CAAC,oBAAoB,CAAC;IACxD,YAAY,GAAG,GAAG,CAAC,IAAI,CAAC;AAC1B,CAAC;AAAC,MAAM,CAAC;IACP,8EAA8E;AAChF,CAAC;AAED,+EAA+E;AAC/E,yCAAyC;AACzC,+EAA+E;AAE/E;;;GAGG;AACH,MAAM,OAAO,UAAU;IACb,IAAI,GAAQ,EAAE,CAAC;IACf,SAAS,CAAyB;IAE1C,YAAY,SAAiC;QAC3C,IAAI,CAAC,SAAS,GAAG,SAAS,CAAC;IAC7B,CAAC;IAED,IAAI,CAAC,IAAO;QACV,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACrB,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;IACtC,CAAC;IAED,GAAG;QACD,IAAI,IAAI,CAAC,IAAI,CAAC,MAAM,KAAK,CAAC;YAAE,OAAO,SAAS,CAAC;QAC7C,MAAM,GAAG,GAAG,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACzB,MAAM,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC,GAAG,EAAG,CAAC;QAC9B,IAAI,IAAI,CAAC,IAAI,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YACzB,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC;YACpB,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC;QACnB,CAAC;QACD,OAAO,GAAG,CAAC;IACb,CAAC;IAED,IAAI;QACF,OAAO,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IACtB,CAAC;IAED,IAAI;QACF,OAAO,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC;IAC1B,CAAC;IAEO,QAAQ,CAAC,CAAS;QACxB,OAAO,CAAC,GAAG,CAAC,EAAE,CAAC;YACb,MAAM,MAAM,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC;YAC5B,IAAI,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC;gBACxD,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,EAAE,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC;gBACtE,CAAC,GAAG,MAAM,CAAC;YACb,CAAC;iBAAM,CAAC;gBACN,MAAM;YACR,CAAC;QACH,CAAC;IACH,CAAC;IAEO,QAAQ,CAAC,CAAS;QACxB,MAAM,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC;QAC3B,OAAO,IAAI,EAAE,CAAC;YACZ,IAAI,QAAQ,GAAG,CAAC,CAAC;YACjB,MAAM,IAAI,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;YACvB,MAAM,KAAK,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;YACxB,IAAI,IAAI,GAAG,CAAC,IAAI,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC;gBACzE,QAAQ,GAAG,IAAI,CAAC;YAClB,CAAC;YACD,IAAI,KAAK,GAAG,CAAC,IAAI,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,EAAE,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC;gBAC3E,QAAQ,GAAG,KAAK,CAAC;YACnB,CAAC;YACD,IAAI,QAAQ,KAAK,CAAC,EAAE,CAAC;gBACnB,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC,EAAE,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC;gBAC1E,CAAC,GAAG,QAAQ,CAAC;YACf,CAAC;iBAAM,CAAC;gBACN,MAAM;YACR,CAAC;QACH,CAAC;IACH,CAAC;CACF;AAYD,+EAA+E;AAC/E,aAAa;AACb,+EAA+E;AAE/E;;;;GAIG;AACH,MAAM,OAAO,iBAAiB;IACpB,KAAK,GAA0B,IAAI,GAAG,EAAE,CAAC;IAChC,CAAC,GAAW,cAAc,CAAC,aAAa,CAAC;IACzC,KAAK,GAAW,cAAc,CAAC,aAAa,GAAG,CAAC,CAAC;IACjD,cAAc,GAAW,cAAc,CAAC,eAAe,CAAC;IACxD,QAAQ,GAAW,cAAc,CAAC,SAAS,CAAC;IAC5C,EAAE,GAAW,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,cAAc,CAAC,aAAa,CAAC,CAAC;IACxD,QAAQ,GAAW,EAAE,CAAC;IAE/B,UAAU,GAAkB,IAAI,CAAC;IACjC,eAAe,GAAW,CAAC,CAAC,CAAC;IAErC;;;OAGG;IACK,WAAW;QACjB,OAAO,IAAI,CAAC,GAAG,CACb,IAAI,CAAC,KAAK,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,MAAM,EAAE,CAAC,GAAG,IAAI,CAAC,EAAE,CAAC,EAC9C,IAAI,CAAC,QAAQ,CACd,CAAC;IACJ,CAAC;IAED;;OAEG;IACK,UAAU,CAAC,KAAe,EAAE,MAAc;QAChD,MAAM,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;QACpC,IAAI,CAAC,IAAI;YAAE,OAAO,CAAC,CAAC,CAAC;QACrB,OAAO,gBAAgB,CAAC,KAAK,EAAE,IAAI,CAAC,SAAS,CAAC,CAAC;IACjD,CAAC;IAED;;;;OAIG;IACK,WAAW,CACjB,KAAe,EACf,OAAe,EACf,KAAa;QAEb,IAAI,OAAO,GAAG,OAAO,CAAC;QACtB,IAAI,WAAW,GAAG,IAAI,CAAC,UAAU,CAAC,KAAK,EAAE,OAAO,CAAC,CAAC;QAClD,IAAI,QAAQ,GAAG,IAAI,CAAC;QAEpB,OAAO,QAAQ,EAAE,CAAC;YAChB,QAAQ,GAAG,KAAK,CAAC;YACjB,MAAM,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC;YACrC,IAAI,CAAC,IAAI;gBAAE,MAAM;YAEjB,MAAM,SAAS,GAAG,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,KAAK,CAAC,IAAI,EAAE,CAAC;YAClD,KAAK,MAAM,UAAU,IAAI,SAAS,EAAE,CAAC;gBACnC,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,UAAU,CAAC;oBAAE,SAAS;gBAC1C,MAAM,IAAI,GAAG,IAAI,CAAC,UAAU,CAAC,KAAK,EAAE,UAAU,CAAC,CAAC;gBAChD,IAAI,IAAI,GAAG,WAAW,EAAE,CAAC;oBACvB,OAAO,GAAG,UAAU,CAAC;oBACrB,WAAW,GAAG,IAAI,CAAC;oBACnB,QAAQ,GAAG,IAAI,CAAC;gBAClB,CAAC;YACH,CAAC;QACH,CAAC;QAED,OAAO,OAAO,CAAC;IACjB,CAAC;IAED;;;;;;OAMG;IACK,eAAe,CACrB,KAAe,EACf,QAAkB,EAClB,KAAa,EACb,EAAU;QAEV,MAAM,OAAO,GAAG,IAAI,GAAG,CAAS,QAAQ,CAAC,CAAC;QAE1C,MAAM,OAAO,GAAG,QAAQ;aACrB,MAAM,CAAC,EAAE,CAAC,EAAE,CAAC,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;aAChC,GAAG,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,EAAE,EAAE,EAAE,KAAK,EAAE,IAAI,CAAC,UAAU,CAAC,KAAK,EAAE,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;QAE1D,0DAA0D;QAC1D,MAAM,aAAa,GAAG,IAAI,UAAU,CAClC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC,KAAK,CAAC,gCAAgC;SAC7D,CAAC;QACF,8DAA8D;QAC9D,MAAM,UAAU,GAAG,IAAI,UAAU,CAC/B,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC,KAAK,CAAC,+BAA+B;SAC5D,CAAC;QAEF,KAAK,MAAM,KAAK,IAAI,OAAO,EAAE,CAAC;YAC5B,aAAa,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;YAC1B,UAAU,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QACzB,CAAC;QAED,OAAO,aAAa,CAAC,IAAI,EAAE,GAAG,CAAC,EAAE,CAAC;YAChC,MAAM,OAAO,GAAG,aAAa,CAAC,GAAG,EAAG,CAAC;YAErC,8DAA8D;YAC9D,uCAAuC;YACvC,IAAI,UAAU,CAAC,IAAI,EAAE,IAAI,EAAE,IAAI,OAAO,CAAC,KAAK,GAAG,UAAU,CAAC,IAAI,EAAG,CAAC,KAAK,EAAE,CAAC;gBACxE,MAAM;YACR,CAAC;YAED,MAAM,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,OAAO,CAAC,EAAE,CAAC,CAAC;YACxC,IAAI,CAAC,IAAI;gBAAE,SAAS;YAEpB,MAAM,SAAS,GAAG,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,KAAK,CAAC,IAAI,EAAE,CAAC;YAClD,KAAK,MAAM,UAAU,IAAI,SAAS,EAAE,CAAC;gBACnC,IAAI,OAAO,CAAC,GAAG,CAAC,UAAU,CAAC;oBAAE,SAAS;gBACtC,OAAO,CAAC,GAAG,CAAC,UAAU,CAAC,CAAC;gBAExB,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,UAAU,CAAC;oBAAE,SAAS;gBAE1C,MAAM,KAAK,GAAG,IAAI,CAAC,UAAU,CAAC,KAAK,EAAE,UAAU,CAAC,CAAC;gBACjD,MAAM,WAAW,GAAG,UAAU,CAAC,IAAI,EAAE,IAAI,EAAE,CAAC,CAAC,CAAC,UAAU,CAAC,IAAI,EAAG,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,QAAQ,CAAC;gBAEnF,IAAI,UAAU,CAAC,IAAI,EAAE,GAAG,EAAE,IAAI,KAAK,GAAG,WAAW,EAAE,CAAC;oBAClD,MAAM,KAAK,GAAG,EAAE,EAAE,EAAE,UAAU,EAAE,KAAK,EAAE,CAAC;oBACxC,aAAa,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;oBAC1B,UAAU,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;oBAEvB,sCAAsC;oBACtC,IAAI,UAAU,CAAC,IAAI,EAAE,GAAG,EAAE,EAAE,CAAC;wBAC3B,UAAU,CAAC,GAAG,EAAE,CAAC;oBACnB,CAAC;gBACH,CAAC;YACH,CAAC;QACH,CAAC;QAED,0DAA0D;QAC1D,MAAM,OAAO,GAAyC,EAAE,CAAC;QACzD,OAAO,UAAU,CAAC,IAAI,EAAE,GAAG,CAAC,EAAE,CAAC;YAC7B,OAAO,CAAC,IAAI,CAAC,UAAU,CAAC,GAAG,EAAG,CAAC,CAAC;QAClC,CAAC;QACD,OAAO,CAAC,OAAO,EAAE,CAAC,CAAC,oDAAoD;QACvE,OAAO,OAAO,CAAC;IACjB,CAAC;IAED;;;OAGG;IACK,eAAe,CACrB,MAAgB,EAChB,UAAgD,EAChD,cAAsB;QAEtB,OAAO,UAAU;aACd,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC,KAAK,CAAC;aACjC,KAAK,CAAC,CAAC,EAAE,cAAc,CAAC;aACxB,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;IACpB,CAAC;IAED;;;OAGG;IACK,iBAAiB,CAAC,KAAa;QACrC,OAAO,KAAK,KAAK,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC;IAC3C,CAAC;IAED;;;OAGG;IACH,GAAG,CAAC,EAAU,EAAE,SAAmB;QACjC,0CAA0C;QAC1C,IAAI,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,CAAC;YACvB,IAAI,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC;QAClB,CAAC;QAED,MAAM,SAAS,GAAG,IAAI,CAAC,WAAW,EAAE,CAAC;QACrC,MAAM,OAAO,GAAa;YACxB,EAAE;YACF,SAAS;YACT,SAAS,EAAE,IAAI,GAAG,EAAE;SACrB,CAAC;QAEF,2CAA2C;QAC3C,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,SAAS,EAAE,CAAC,EAAE,EAAE,CAAC;YACpC,OAAO,CAAC,SAAS,CAAC,GAAG,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC;QAC/B,CAAC;QAED,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,EAAE,EAAE,OAAO,CAAC,CAAC;QAE5B,iCAAiC;QACjC,IAAI,IAAI,CAAC,UAAU,KAAK,IAAI,EAAE,CAAC;YAC7B,IAAI,CAAC,UAAU,GAAG,EAAE,CAAC;YACrB,IAAI,CAAC,eAAe,GAAG,SAAS,CAAC;YACjC,OAAO;QACT,CAAC;QAED,IAAI,YAAY,GAAG,IAAI,CAAC,UAAU,CAAC;QAEnC,uEAAuE;QACvE,KAAK,IAAI,CAAC,GAAG,IAAI,CAAC,eAAe,EAAE,CAAC,GAAG,SAAS,EAAE,CAAC,EAAE,EAAE,CAAC;YACtD,YAAY,GAAG,IAAI,CAAC,WAAW,CAAC,SAAS,EAAE,YAAY,EAAE,CAAC,CAAC,CAAC;QAC9D,CAAC;QAED,4EAA4E;QAC5E,KAAK,IAAI,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,SAAS,EAAE,IAAI,CAAC,eAAe,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;YACpE,MAAM,OAAO,GAAG,IAAI,CAAC,iBAAiB,CAAC,CAAC,CAAC,CAAC;YAE1C,qEAAqE;YACrE,MAAM,OAAO,GAAG,IAAI,CAAC,eAAe,CAAC,SAAS,EAAE,CAAC,YAAY,CAAC,EAAE,CAAC,EAAE,IAAI,CAAC,cAAc,CAAC,CAAC;YAExF,0BAA0B;YAC1B,MAAM,WAAW,GAAG,IAAI,CAAC,eAAe,CAAC,SAAS,EAAE,OAAO,EAAE,OAAO,CAAC,CAAC;YAEtE,6CAA6C;YAC7C,OAAO,CAAC,SAAS,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,GAAG,WAAW,CAAC,CAAC,CAAC;YAE3C,2DAA2D;YAC3D,KAAK,MAAM,UAAU,IAAI,WAAW,EAAE,CAAC;gBACrC,MAAM,QAAQ,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,UAAU,CAAC,CAAC;gBAC5C,IAAI,CAAC,QAAQ;oBAAE,SAAS;gBAExB,MAAM,YAAY,GAAG,QAAQ,CAAC,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC;gBACrD,YAAY,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;gBAEtB,6CAA6C;gBAC7C,IAAI,YAAY,CAAC,MAAM,GAAG,OAAO,EAAE,CAAC;oBAClC,qCAAqC;oBACrC,MAAM,MAAM,GAAG,YAAY;yBACxB,MAAM,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;yBAClC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;wBACX,EAAE,EAAE,GAAG;wBACP,KAAK,EAAE,gBAAgB,CAAC,QAAQ,CAAC,SAAS,EAAE,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,GAAG,CAAE,CAAC,SAAS,CAAC;qBAC5E,CAAC,CAAC,CAAC;oBACN,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC,KAAK,CAAC,CAAC;oBACzC,QAAQ,CAAC,SAAS,CAAC,GAAG,CAAC,CAAC,EAAE,MAAM,CAAC,KAAK,CAAC,CAAC,EAAE,OAAO,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;gBACrE,CAAC;qBAAM,CAAC;oBACN,QAAQ,CAAC,SAAS,CAAC,GAAG,CAAC,CAAC,EAAE,YAAY,CAAC,CAAC;gBAC1C,CAAC;YACH,CAAC;YAED,mCAAmC;YACnC,IAAI,OAAO,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;gBACvB,YAAY,GAAG,OAAO,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;YAC/B,CAAC;QACH,CAAC;QAED,6DAA6D;QAC7D,IAAI,SAAS,GAAG,IAAI,CAAC,eAAe,EAAE,CAAC;YACrC,IAAI,CAAC,UAAU,GAAG,EAAE,CAAC;YACrB,IAAI,CAAC,eAAe,GAAG,SAAS,CAAC;QACnC,CAAC;IACH,CAAC;IAED;;;OAGG;IACH,MAAM,CAAC,EAAU;QACf,MAAM,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;QAChC,IAAI,CAAC,IAAI;YAAE,OAAO,KAAK,CAAC;QAExB,2EAA2E;QAC3E,KAAK,MAAM,CAAC,KAAK,EAAE,SAAS,CAAC,IAAI,IAAI,CAAC,SAAS,CAAC,OAAO,EAAE,EAAE,CAAC;YAC1D,KAAK,MAAM,UAAU,IAAI,SAAS,EAAE,CAAC;gBACnC,MAAM,QAAQ,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,UAAU,CAAC,CAAC;gBAC5C,IAAI,CAAC,QAAQ;oBAAE,SAAS;gBAExB,MAAM,YAAY,GAAG,QAAQ,CAAC,SAAS,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;gBACnD,IAAI,CAAC,YAAY;oBAAE,SAAS;gBAE5B,oDAAoD;gBACpD,MAAM,GAAG,GAAG,YAAY,CAAC,OAAO,CAAC,EAAE,CAAC,CAAC;gBACrC,IAAI,GAAG,KAAK,CAAC,CAAC,EAAE,CAAC;oBACf,YAAY,CAAC,MAAM,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC;gBAC9B,CAAC;gBAED,oEAAoE;gBACpE,gEAAgE;gBAChE,MAAM,OAAO,GAAG,IAAI,CAAC,iBAAiB,CAAC,KAAK,CAAC,CAAC;gBAC9C,IAAI,YAAY,CAAC,MAAM,GAAG,OAAO,EAAE,CAAC;oBAClC,KAAK,MAAM,eAAe,IAAI,SAAS,EAAE,CAAC;wBACxC,IACE,eAAe,KAAK,UAAU;4BAC9B,eAAe,KAAK,EAAE;4BACtB,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,eAAe,CAAC;4BAC/B,CAAC,YAAY,CAAC,QAAQ,CAAC,eAAe,CAAC,EACvC,CAAC;4BACD,YAAY,CAAC,IAAI,CAAC,eAAe,CAAC,CAAC;4BACnC,6BAA6B;4BAC7B,MAAM,aAAa,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,eAAe,CAAC,CAAC;4BACtD,IAAI,aAAa,EAAE,CAAC;gCAClB,MAAM,SAAS,GAAG,aAAa,CAAC,SAAS,CAAC,GAAG,CAAC,KAAK,CAAC,IAAI,EAAE,CAAC;gCAC3D,IAAI,CAAC,SAAS,CAAC,QAAQ,CAAC,UAAU,CAAC,IAAI,SAAS,CAAC,MAAM,GAAG,OAAO,EAAE,CAAC;oCAClE,SAAS,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC;oCAC3B,aAAa,CAAC,SAAS,CAAC,GAAG,CAAC,KAAK,EAAE,SAAS,CAAC,CAAC;gCAChD,CAAC;4BACH,CAAC;4BACD,IAAI,YAAY,CAAC,MAAM,IAAI,OAAO;gCAAE,MAAM;wBAC5C,CAAC;oBACH,CAAC;gBACH,CAAC;gBAED,QAAQ,CAAC,SAAS,CAAC,GAAG,CAAC,KAAK,EAAE,YAAY,CAAC,CAAC;YAC9C,CAAC;QACH,CAAC;QAED,kBAAkB;QAClB,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC;QAEtB,qDAAqD;QACrD,IAAI,IAAI,CAAC,UAAU,KAAK,EAAE,EAAE,CAAC;YAC3B,IAAI,IAAI,CAAC,KAAK,CAAC,IAAI,KAAK,CAAC,EAAE,CAAC;gBAC1B,IAAI,CAAC,UAAU,GAAG,IAAI,CAAC;gBACvB,IAAI,CAAC,eAAe,GAAG,CAAC,CAAC,CAAC;YAC5B,CAAC;iBAAM,CAAC;gBACN,iEAAiE;gBACjE,IAAI,MAAM,GAAkB,IAAI,CAAC;gBACjC,IAAI,SAAS,GAAG,CAAC,CAAC,CAAC;gBACnB,KAAK,MAAM,CAAC,MAAM,EAAE,CAAC,CAAC,IAAI,IAAI,CAAC,KAAK,CAAC,OAAO,EAAE,EAAE,CAAC;oBAC/C,IAAI,YAAY,GAAG,CAAC,CAAC,CAAC;oBACtB,KAAK,MAAM,CAAC,IAAI,CAAC,CAAC,SAAS,CAAC,IAAI,EAAE,EAAE,CAAC;wBACnC,IAAI,CAAC,GAAG,YAAY;4BAAE,YAAY,GAAG,CAAC,CAAC;oBACzC,CAAC;oBACD,IAAI,YAAY,GAAG,SAAS,EAAE,CAAC;wBAC7B,SAAS,GAAG,YAAY,CAAC;wBACzB,MAAM,GAAG,MAAM,CAAC;oBAClB,CAAC;gBACH,CAAC;gBACD,IAAI,CAAC,UAAU,GAAG,MAAM,CAAC;gBACzB,IAAI,CAAC,eAAe,GAAG,SAAS,CAAC;YACnC,CAAC;QACH,CAAC;QAED,OAAO,IAAI,CAAC;IACd,CAAC;IAED;;;OAGG;IACH,MAAM,CAAC,KAAe,EAAE,CAAS;QAC/B,IAAI,IAAI,CAAC,KAAK,CAAC,IAAI,KAAK,CAAC,IAAI,IAAI,CAAC,UAAU,KAAK,IAAI,EAAE,CAAC;YACtD,OAAO,EAAE,CAAC;QACZ,CAAC;QAED,uBAAuB;QACvB,IAAI,IAAI,CAAC,KAAK,CAAC,IAAI,KAAK,CAAC,EAAE,CAAC;YAC1B,MAAM,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,UAAU,CAAE,CAAC;YAC9C,OAAO,CAAC,EAAE,EAAE,EAAE,IAAI,CAAC,EAAE,EAAE,KAAK,EAAE,gBAAgB,CAAC,KAAK,EAAE,IAAI,CAAC,SAAS,CAAC,EAAE,CAAC,CAAC;QAC3E,CAAC;QAED,IAAI,YAAY,GAAG,IAAI,CAAC,UAAU,CAAC;QAEnC,qEAAqE;QACrE,KAAK,IAAI,CAAC,GAAG,IAAI,CAAC,eAAe,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;YAC9C,YAAY,GAAG,IAAI,CAAC,WAAW,CAAC,KAAK,EAAE,YAAY,EAAE,CAAC,CAAC,CAAC;QAC1D,CAAC;QAED,2DAA2D;QAC3D,MAAM,EAAE,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,QAAQ,EAAE,CAAC,CAAC,CAAC;QACtC,MAAM,OAAO,GAAG,IAAI,CAAC,eAAe,CAAC,KAAK,EAAE,CAAC,YAAY,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC;QAEnE,uDAAuD;QACvD,OAAO,OAAO,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IAC7B,CAAC;IAED;;OAEG;IACH,IAAI;QACF,OAAO,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC;IACzB,CAAC;IAED;;OAEG;IACH,KAAK;QACH,IAAI,CAAC,KAAK,CAAC,KAAK,EAAE,CAAC;QACnB,IAAI,CAAC,UAAU,GAAG,IAAI,CAAC;QACvB,IAAI,CAAC,eAAe,GAAG,CAAC,CAAC,CAAC;IAC5B,CAAC;CACF;AAED,+EAA+E;AAC/E,2EAA2E;AAC3E,+EAA+E;AAE/E,yCAAyC;AACzC,SAAS,WAAW,CAAC,CAAe;IAClC,IAAI,GAAG,GAAG,CAAC,CAAC;IACZ,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,MAAM,EAAE,CAAC,EAAE;QAAE,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;IACtD,OAAO,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;AACxB,CAAC;AAED,kFAAkF;AAClF,SAAS,UAAU,CAAC,CAAe,EAAE,CAAe,EAAE,KAAa,EAAE,KAAa;IAChF,MAAM,KAAK,GAAG,KAAK,GAAG,KAAK,CAAC;IAC5B,IAAI,KAAK,KAAK,CAAC;QAAE,OAAO,CAAC,CAAC;IAC1B,IAAI,GAAG,GAAG,CAAC,CAAC;IACZ,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,MAAM,EAAE,CAAC,EAAE;QAAE,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;IACtD,OAAO,GAAG,GAAG,KAAK,CAAC;AACrB,CAAC;AAED;;;;;;;;;;;GAWG;AACH,MAAM,OAAO,iBAAiB;IACpB,GAAG,GAAa,EAAE,CAAC;IACnB,OAAO,GAAmB,EAAE,CAAC;IACrC,+EAA+E;IACvE,KAAK,GAAa,EAAE,CAAC;IACrB,SAAS,GAAwB,IAAI,GAAG,EAAE,CAAC;IAC3C,WAAW,GAAG,KAAK,CAAC;IAE5B;QACE,IAAI,YAAY,IAAI,CAAC,IAAI,CAAC,WAAW,EAAE,CAAC;YACtC,IAAI,CAAC;gBACH,YAAY,EAAE,CAAC;gBACf,IAAI,CAAC,WAAW,GAAG,IAAI,CAAC;YAC1B,CAAC;YAAC,MAAM,CAAC;gBACP,uCAAuC;gBACvC,IAAI,CAAC,WAAW,GAAG,4BAA4B,KAAK,IAAI,CAAC;YAC3D,CAAC;QACH,CAAC;IACH,CAAC;IAED,GAAG,CAAC,EAAU,EAAE,SAAmB;QACjC,MAAM,GAAG,GAAG,IAAI,YAAY,CAAC,SAAS,CAAC,CAAC;QACxC,MAAM,IAAI,GAAG,WAAW,CAAC,GAAG,CAAC,CAAC;QAE9B,8BAA8B;QAC9B,IAAI,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,CAAC;YAC3B,MAAM,GAAG,GAAG,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,EAAE,CAAE,CAAC;YACpC,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,GAAG,GAAG,CAAC;YACxB,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,GAAG,IAAI,CAAC;YACvB,OAAO;QACT,CAAC;QACD,MAAM,GAAG,GAAG,IAAI,CAAC,GAAG,CAAC,MAAM,CAAC;QAC5B,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;QAClB,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;QACvB,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACtB,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,EAAE,EAAE,GAAG,CAAC,CAAC;IAC9B,CAAC;IAED,MAAM,CAAC,KAAe,EAAE,CAAS;QAC/B,IAAI,IAAI,CAAC,GAAG,CAAC,MAAM,KAAK,CAAC;YAAE,OAAO,EAAE,CAAC;QACrC,MAAM,OAAO,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;QAE7C,uEAAuE;QACvE,wEAAwE;QACxE,IAAI,4BAA4B,IAAI,IAAI,CAAC,OAAO,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YAC5D,MAAM,QAAQ,GAAG,IAAI,YAAY,CAAC,KAAK,CAAC,CAAC;YACzC,MAAM,SAAS,GAAG,WAAW,CAAC,QAAQ,CAAC,CAAC;YACxC,MAAM,MAAM,GAAG,4BAA4B,CACzC,QAA+B,EAC/B,IAAI,CAAC,OAAgC,EACrC,OAAO,EACP,GAAG,CACJ,CAAC;YACF,OAAO,MAAM,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,GAAG,EAAE,EAAE,CAAC,CAAC;gBAClC,EAAE,EAAE,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC;gBACjB,KAAK,EAAE,UAAU,CAAC,QAAQ,EAAE,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,EAAE,SAAS,EAAE,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC;aAC3E,CAAC,CAAC,CAAC;QACN,CAAC;QAED,iDAAiD;QACjD,MAAM,QAAQ,GAAG,IAAI,YAAY,CAAC,KAAK,CAAC,CAAC;QACzC,MAAM,SAAS,GAAG,WAAW,CAAC,QAAQ,CAAC,CAAC;QACxC,MAAM,MAAM,GAAyC,EAAE,CAAC;QACxD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YACzC,MAAM,CAAC,IAAI,CAAC;gBACV,EAAE,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC;gBACf,KAAK,EAAE,UAAU,CAAC,QAAQ,EAAE,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,SAAS,EAAE,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;aACvE,CAAC,CAAC;QACL,CAAC;QACD,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC,KAAK,CAAC,CAAC;QACzC,OAAO,MAAM,CAAC,KAAK,CAAC,CAAC,EAAE,OAAO,CAAC,CAAC;IAClC,CAAC;IAED,MAAM,CAAC,EAAU;QACf,MAAM,GAAG,GAAG,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;QACnC,IAAI,GAAG,KAAK,SAAS;YAAE,OAAO,KAAK,CAAC;QAEpC,0CAA0C;QAC1C,MAAM,OAAO,GAAG,IAAI,CAAC,GAAG,CAAC,MAAM,GAAG,CAAC,CAAC;QACpC,IAAI,GAAG,KAAK,OAAO,EAAE,CAAC;YACpB,MAAM,MAAM,GAAG,IAAI,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC;YACjC,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,GAAG,MAAM,CAAC;YACvB,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,GAAG,IAAI,CAAC,OAAO,CAAC,OAAO,CAAC,CAAC;YAC1C,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC;YACtC,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,MAAM,EAAE,GAAG,CAAC,CAAC;QAClC,CAAC;QACD,IAAI,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC;QACf,IAAI,CAAC,OAAO,CAAC,GAAG,EAAE,CAAC;QACnB,IAAI,CAAC,KAAK,CAAC,GAAG,EAAE,CAAC;QACjB,IAAI,CAAC,SAAS,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC;QAC1B,OAAO,IAAI,CAAC;IACd,CAAC;IAED,KAAK;QACH,IAAI,CAAC,GAAG,GAAG,EAAE,CAAC;QACd,IAAI,CAAC,OAAO,GAAG,EAAE,CAAC;QAClB,IAAI,CAAC,KAAK,GAAG,EAAE,CAAC;QAChB,IAAI,CAAC,SAAS,CAAC,KAAK,EAAE,CAAC;IACzB,CAAC;IAED,IAAI;QACF,OAAO,IAAI,CAAC,GAAG,CAAC,MAAM,CAAC;IACzB,CAAC;CACF"}

package/v3/dist/kernel/unified-memory-migration.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"unified-memory-migration.d.ts","sourceRoot":"","sources":["../../src/kernel/unified-memory-migration.ts"],"names":[],"mappings":"AAAA;;;;;;;;GAQG;AAOH,MAAM,WAAW,eAAe;IAC9B,OAAO,EAAE,OAAO,CAAC;IACjB,cAAc,EAAE,MAAM,EAAE,CAAC;IACzB,eAAe,EAAE,MAAM,EAAE,CAAC;IAC1B,YAAY,EAAE,MAAM,CAAC;IACrB,MAAM,EAAE,MAAM,EAAE,CAAC;CAClB;AAED,MAAM,WAAW,gBAAgB;IAC/B,mCAAmC;IACnC,OAAO,EAAE,MAAM,CAAC;IAChB,sCAAsC;IACtC,aAAa,EAAE,OAAO,CAAC;IACvB,qDAAqD;IACrD,0BAA0B,EAAE,OAAO,CAAC;IACpC,yDAAyD;IACzD,MAAM,EAAE,OAAO,CAAC;CACjB;AASD;;GAEG;AACH,wBAAsB,sBAAsB,CAC1C,OAAO,CAAC,EAAE,OAAO,CAAC,gBAAgB,CAAC,GAClC,OAAO,CAAC,eAAe,CAAC,CA2N1B;AAED;;GAEG;AACH,wBAAgB,eAAe,CAAC,OAAO,GAAE,MAAsB,GAAG,OAAO,CAGxE;AAED;;GAEG;AACH,wBAAgB,kBAAkB,CAAC,OAAO,GAAE,MAAsB,GAAG;IACnE,cAAc,EAAE,OAAO,CAAC;IACxB,OAAO,EAAE,MAAM,EAAE,CAAC;IAClB,MAAM,EAAE,MAAM,CAAC;IACf,YAAY,EAAE,OAAO,CAAC;CACvB,CAaA"}
+{"version":3,"file":"unified-memory-migration.d.ts","sourceRoot":"","sources":["../../src/kernel/unified-memory-migration.ts"],"names":[],"mappings":"AAAA;;;;;;;;GAQG;AAWH,MAAM,WAAW,eAAe;IAC9B,OAAO,EAAE,OAAO,CAAC;IACjB,cAAc,EAAE,MAAM,EAAE,CAAC;IACzB,eAAe,EAAE,MAAM,EAAE,CAAC;IAC1B,YAAY,EAAE,MAAM,CAAC;IACrB,MAAM,EAAE,MAAM,EAAE,CAAC;CAClB;AAED,MAAM,WAAW,gBAAgB;IAC/B,mCAAmC;IACnC,OAAO,EAAE,MAAM,CAAC;IAChB,sCAAsC;IACtC,aAAa,EAAE,OAAO,CAAC;IACvB,qDAAqD;IACrD,0BAA0B,EAAE,OAAO,CAAC;IACpC,yDAAyD;IACzD,MAAM,EAAE,OAAO,CAAC;CACjB;AASD;;GAEG;AACH,wBAAsB,sBAAsB,CAC1C,OAAO,CAAC,EAAE,OAAO,CAAC,gBAAgB,CAAC,GAClC,OAAO,CAAC,eAAe,CAAC,CAwN1B;AAED;;GAEG;AACH,wBAAgB,eAAe,CAAC,OAAO,GAAE,MAAsB,GAAG,OAAO,CAGxE;AAED;;GAEG;AACH,wBAAgB,kBAAkB,CAAC,OAAO,GAAE,MAAsB,GAAG;IACnE,cAAc,EAAE,OAAO,CAAC;IACxB,OAAO,EAAE,MAAM,EAAE,CAAC;IAClB,MAAM,EAAE,MAAM,CAAC;IACf,YAAY,EAAE,OAAO,CAAC;CACvB,CAaA"}