ruvector 0.1.62 → 0.1.64

package/dist/core/graph-wrapper.js

@@ -0,0 +1,299 @@
+"use strict";
+/**
+ * Graph Wrapper - Hypergraph database for code relationships
+ *
+ * Wraps @ruvector/graph-node for dependency analysis, co-edit patterns,
+ * and code structure understanding.
+ */
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.CodeGraph = void 0;
+exports.isGraphAvailable = isGraphAvailable;
+exports.createCodeDependencyGraph = createCodeDependencyGraph;
+let graphModule = null;
+let loadError = null;
+function getGraphModule() {
+    if (graphModule)
+        return graphModule;
+    if (loadError)
+        throw loadError;
+    try {
+        graphModule = require('@ruvector/graph-node');
+        return graphModule;
+    }
+    catch (e) {
+        loadError = new Error(`@ruvector/graph-node not installed: ${e.message}\n` +
+            `Install with: npm install @ruvector/graph-node`);
+        throw loadError;
+    }
+}
+function isGraphAvailable() {
+    try {
+        getGraphModule();
+        return true;
+    }
+    catch {
+        return false;
+    }
+}
+/**
+ * Graph Database for code relationships
+ */
+class CodeGraph {
+    constructor(options = {}) {
+        const graph = getGraphModule();
+        this.storagePath = options.storagePath;
+        this.inner = new graph.GraphDatabase({
+            storagePath: options.storagePath,
+            inMemory: options.inMemory ?? true,
+        });
+    }
+    // ===========================================================================
+    // Node Operations
+    // ===========================================================================
+    /**
+     * Create a node (file, function, class, etc.)
+     */
+    createNode(id, labels, properties = {}) {
+        this.inner.createNode(id, labels, JSON.stringify(properties));
+        return { id, labels, properties };
+    }
+    /**
+     * Get a node by ID
+     */
+    getNode(id) {
+        const result = this.inner.getNode(id);
+        if (!result)
+            return null;
+        return {
+            id: result.id,
+            labels: result.labels,
+            properties: result.properties ? JSON.parse(result.properties) : {},
+        };
+    }
+    /**
+     * Update node properties
+     */
+    updateNode(id, properties) {
+        return this.inner.updateNode(id, JSON.stringify(properties));
+    }
+    /**
+     * Delete a node
+     */
+    deleteNode(id) {
+        return this.inner.deleteNode(id);
+    }
+    /**
+     * Find nodes by label
+     */
+    findNodesByLabel(label) {
+        const results = this.inner.findNodesByLabel(label);
+        return results.map((r) => ({
+            id: r.id,
+            labels: r.labels,
+            properties: r.properties ? JSON.parse(r.properties) : {},
+        }));
+    }
+    // ===========================================================================
+    // Edge Operations
+    // ===========================================================================
+    /**
+     * Create an edge (import, call, reference, etc.)
+     */
+    createEdge(from, to, type, properties = {}) {
+        const id = this.inner.createEdge(from, to, type, JSON.stringify(properties));
+        return { id, from, to, type, properties };
+    }
+    /**
+     * Get edges from a node
+     */
+    getOutgoingEdges(nodeId, type) {
+        const results = this.inner.getOutgoingEdges(nodeId, type);
+        return results.map((r) => ({
+            id: r.id,
+            from: r.from,
+            to: r.to,
+            type: r.type,
+            properties: r.properties ? JSON.parse(r.properties) : {},
+        }));
+    }
+    /**
+     * Get edges to a node
+     */
+    getIncomingEdges(nodeId, type) {
+        const results = this.inner.getIncomingEdges(nodeId, type);
+        return results.map((r) => ({
+            id: r.id,
+            from: r.from,
+            to: r.to,
+            type: r.type,
+            properties: r.properties ? JSON.parse(r.properties) : {},
+        }));
+    }
+    /**
+     * Delete an edge
+     */
+    deleteEdge(edgeId) {
+        return this.inner.deleteEdge(edgeId);
+    }
+    // ===========================================================================
+    // Hyperedge Operations (for co-edit patterns)
+    // ===========================================================================
+    /**
+     * Create a hyperedge connecting multiple nodes
+     */
+    createHyperedge(nodes, type, properties = {}) {
+        const id = this.inner.createHyperedge(nodes, type, JSON.stringify(properties));
+        return { id, nodes, type, properties };
+    }
+    /**
+     * Get hyperedges containing a node
+     */
+    getHyperedges(nodeId, type) {
+        const results = this.inner.getHyperedges(nodeId, type);
+        return results.map((r) => ({
+            id: r.id,
+            nodes: r.nodes,
+            type: r.type,
+            properties: r.properties ? JSON.parse(r.properties) : {},
+        }));
+    }
+    // ===========================================================================
+    // Query Operations
+    // ===========================================================================
+    /**
+     * Execute a Cypher query
+     */
+    cypher(query, params = {}) {
+        const result = this.inner.cypher(query, JSON.stringify(params));
+        return {
+            columns: result.columns,
+            rows: result.rows,
+        };
+    }
+    /**
+     * Find shortest path between nodes
+     */
+    shortestPath(from, to, maxDepth = 10) {
+        const result = this.inner.shortestPath(from, to, maxDepth);
+        if (!result)
+            return null;
+        return {
+            nodes: result.nodes.map((n) => ({
+                id: n.id,
+                labels: n.labels,
+                properties: n.properties ? JSON.parse(n.properties) : {},
+            })),
+            edges: result.edges.map((e) => ({
+                id: e.id,
+                from: e.from,
+                to: e.to,
+                type: e.type,
+                properties: e.properties ? JSON.parse(e.properties) : {},
+            })),
+            length: result.length,
+        };
+    }
+    /**
+     * Get all paths between nodes (up to maxPaths)
+     */
+    allPaths(from, to, maxDepth = 5, maxPaths = 10) {
+        const results = this.inner.allPaths(from, to, maxDepth, maxPaths);
+        return results.map((r) => ({
+            nodes: r.nodes.map((n) => ({
+                id: n.id,
+                labels: n.labels,
+                properties: n.properties ? JSON.parse(n.properties) : {},
+            })),
+            edges: r.edges.map((e) => ({
+                id: e.id,
+                from: e.from,
+                to: e.to,
+                type: e.type,
+                properties: e.properties ? JSON.parse(e.properties) : {},
+            })),
+            length: r.length,
+        }));
+    }
+    /**
+     * Get neighbors of a node
+     */
+    neighbors(nodeId, depth = 1) {
+        const results = this.inner.neighbors(nodeId, depth);
+        return results.map((n) => ({
+            id: n.id,
+            labels: n.labels,
+            properties: n.properties ? JSON.parse(n.properties) : {},
+        }));
+    }
+    // ===========================================================================
+    // Graph Algorithms
+    // ===========================================================================
+    /**
+     * Calculate PageRank for nodes
+     */
+    pageRank(iterations = 20, dampingFactor = 0.85) {
+        const result = this.inner.pageRank(iterations, dampingFactor);
+        return new Map(Object.entries(result));
+    }
+    /**
+     * Find connected components
+     */
+    connectedComponents() {
+        return this.inner.connectedComponents();
+    }
+    /**
+     * Detect communities (Louvain algorithm)
+     */
+    communities() {
+        const result = this.inner.communities();
+        return new Map(Object.entries(result));
+    }
+    /**
+     * Calculate betweenness centrality
+     */
+    betweennessCentrality() {
+        const result = this.inner.betweennessCentrality();
+        return new Map(Object.entries(result));
+    }
+    // ===========================================================================
+    // Persistence
+    // ===========================================================================
+    /**
+     * Save graph to storage
+     */
+    save() {
+        if (!this.storagePath) {
+            throw new Error('No storage path configured');
+        }
+        this.inner.save();
+    }
+    /**
+     * Load graph from storage
+     */
+    load() {
+        if (!this.storagePath) {
+            throw new Error('No storage path configured');
+        }
+        this.inner.load();
+    }
+    /**
+     * Clear all data
+     */
+    clear() {
+        this.inner.clear();
+    }
+    /**
+     * Get graph statistics
+     */
+    stats() {
+        return this.inner.stats();
+    }
+}
+exports.CodeGraph = CodeGraph;
+/**
+ * Create a code dependency graph from file analysis
+ */
+function createCodeDependencyGraph(storagePath) {
+    return new CodeGraph({ storagePath, inMemory: !storagePath });
+}
+exports.default = CodeGraph;

package/dist/core/index.d.ts

@@ -11,6 +11,10 @@ export * from './sona-wrapper';
 export * from './intelligence-engine';
 export * from './onnx-embedder';
 export * from './parallel-intelligence';
+export * from './parallel-workers';
+export * from './router-wrapper';
+export * from './graph-wrapper';
+export * from './cluster-wrapper';
 export { default as gnnWrapper } from './gnn-wrapper';
 export { default as attentionFallbacks } from './attention-fallbacks';
 export { default as agentdbFast } from './agentdb-fast';
@@ -18,4 +22,8 @@ export { default as Sona } from './sona-wrapper';
 export { default as IntelligenceEngine } from './intelligence-engine';
 export { default as OnnxEmbedder } from './onnx-embedder';
 export { default as ParallelIntelligence } from './parallel-intelligence';
+export { default as ExtendedWorkerPool } from './parallel-workers';
+export { default as SemanticRouter } from './router-wrapper';
+export { default as CodeGraph } from './graph-wrapper';
+export { default as RuvectorCluster } from './cluster-wrapper';
 //# sourceMappingURL=index.d.ts.map

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

@@ -1 +1 @@
-{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../src/core/index.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;AAEH,cAAc,eAAe,CAAC;AAC9B,cAAc,uBAAuB,CAAC;AACtC,cAAc,gBAAgB,CAAC;AAC/B,cAAc,gBAAgB,CAAC;AAC/B,cAAc,uBAAuB,CAAC;AACtC,cAAc,iBAAiB,CAAC;AAChC,cAAc,yBAAyB,CAAC;AAGxC,OAAO,EAAE,OAAO,IAAI,UAAU,EAAE,MAAM,eAAe,CAAC;AACtD,OAAO,EAAE,OAAO,IAAI,kBAAkB,EAAE,MAAM,uBAAuB,CAAC;AACtE,OAAO,EAAE,OAAO,IAAI,WAAW,EAAE,MAAM,gBAAgB,CAAC;AACxD,OAAO,EAAE,OAAO,IAAI,IAAI,EAAE,MAAM,gBAAgB,CAAC;AACjD,OAAO,EAAE,OAAO,IAAI,kBAAkB,EAAE,MAAM,uBAAuB,CAAC;AACtE,OAAO,EAAE,OAAO,IAAI,YAAY,EAAE,MAAM,iBAAiB,CAAC;AAC1D,OAAO,EAAE,OAAO,IAAI,oBAAoB,EAAE,MAAM,yBAAyB,CAAC"}
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../src/core/index.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;AAEH,cAAc,eAAe,CAAC;AAC9B,cAAc,uBAAuB,CAAC;AACtC,cAAc,gBAAgB,CAAC;AAC/B,cAAc,gBAAgB,CAAC;AAC/B,cAAc,uBAAuB,CAAC;AACtC,cAAc,iBAAiB,CAAC;AAChC,cAAc,yBAAyB,CAAC;AACxC,cAAc,oBAAoB,CAAC;AACnC,cAAc,kBAAkB,CAAC;AACjC,cAAc,iBAAiB,CAAC;AAChC,cAAc,mBAAmB,CAAC;AAGlC,OAAO,EAAE,OAAO,IAAI,UAAU,EAAE,MAAM,eAAe,CAAC;AACtD,OAAO,EAAE,OAAO,IAAI,kBAAkB,EAAE,MAAM,uBAAuB,CAAC;AACtE,OAAO,EAAE,OAAO,IAAI,WAAW,EAAE,MAAM,gBAAgB,CAAC;AACxD,OAAO,EAAE,OAAO,IAAI,IAAI,EAAE,MAAM,gBAAgB,CAAC;AACjD,OAAO,EAAE,OAAO,IAAI,kBAAkB,EAAE,MAAM,uBAAuB,CAAC;AACtE,OAAO,EAAE,OAAO,IAAI,YAAY,EAAE,MAAM,iBAAiB,CAAC;AAC1D,OAAO,EAAE,OAAO,IAAI,oBAAoB,EAAE,MAAM,yBAAyB,CAAC;AAC1E,OAAO,EAAE,OAAO,IAAI,kBAAkB,EAAE,MAAM,oBAAoB,CAAC;AACnE,OAAO,EAAE,OAAO,IAAI,cAAc,EAAE,MAAM,kBAAkB,CAAC;AAC7D,OAAO,EAAE,OAAO,IAAI,SAAS,EAAE,MAAM,iBAAiB,CAAC;AACvD,OAAO,EAAE,OAAO,IAAI,eAAe,EAAE,MAAM,mBAAmB,CAAC"}

package/dist/core/index.js

@@ -23,7 +23,7 @@ var __importDefault = (this && this.__importDefault) || function (mod) {
     return (mod && mod.__esModule) ? mod : { "default": mod };
 };
 Object.defineProperty(exports, "__esModule", { value: true });
-exports.ParallelIntelligence = exports.OnnxEmbedder = exports.IntelligenceEngine = exports.Sona = exports.agentdbFast = exports.attentionFallbacks = exports.gnnWrapper = void 0;
+exports.RuvectorCluster = exports.CodeGraph = exports.SemanticRouter = exports.ExtendedWorkerPool = exports.ParallelIntelligence = exports.OnnxEmbedder = exports.IntelligenceEngine = exports.Sona = exports.agentdbFast = exports.attentionFallbacks = exports.gnnWrapper = void 0;
 __exportStar(require("./gnn-wrapper"), exports);
 __exportStar(require("./attention-fallbacks"), exports);
 __exportStar(require("./agentdb-fast"), exports);
@@ -31,6 +31,10 @@ __exportStar(require("./sona-wrapper"), exports);
 __exportStar(require("./intelligence-engine"), exports);
 __exportStar(require("./onnx-embedder"), exports);
 __exportStar(require("./parallel-intelligence"), exports);
+__exportStar(require("./parallel-workers"), exports);
+__exportStar(require("./router-wrapper"), exports);
+__exportStar(require("./graph-wrapper"), exports);
+__exportStar(require("./cluster-wrapper"), exports);
 // Re-export default objects for convenience
 var gnn_wrapper_1 = require("./gnn-wrapper");
 Object.defineProperty(exports, "gnnWrapper", { enumerable: true, get: function () { return __importDefault(gnn_wrapper_1).default; } });
@@ -46,3 +50,11 @@ var onnx_embedder_1 = require("./onnx-embedder");
 Object.defineProperty(exports, "OnnxEmbedder", { enumerable: true, get: function () { return __importDefault(onnx_embedder_1).default; } });
 var parallel_intelligence_1 = require("./parallel-intelligence");
 Object.defineProperty(exports, "ParallelIntelligence", { enumerable: true, get: function () { return __importDefault(parallel_intelligence_1).default; } });
+var parallel_workers_1 = require("./parallel-workers");
+Object.defineProperty(exports, "ExtendedWorkerPool", { enumerable: true, get: function () { return __importDefault(parallel_workers_1).default; } });
+var router_wrapper_1 = require("./router-wrapper");
+Object.defineProperty(exports, "SemanticRouter", { enumerable: true, get: function () { return __importDefault(router_wrapper_1).default; } });
+var graph_wrapper_1 = require("./graph-wrapper");
+Object.defineProperty(exports, "CodeGraph", { enumerable: true, get: function () { return __importDefault(graph_wrapper_1).default; } });
+var cluster_wrapper_1 = require("./cluster-wrapper");
+Object.defineProperty(exports, "RuvectorCluster", { enumerable: true, get: function () { return __importDefault(cluster_wrapper_1).default; } });

package/dist/core/parallel-workers.d.ts

@@ -0,0 +1,183 @@
+/**
+ * Parallel Workers - Extended worker capabilities for RuVector hooks
+ *
+ * Provides parallel processing for advanced operations:
+ *
+ * 1. SPECULATIVE PRE-COMPUTATION
+ *    - Pre-embed likely next files based on co-edit patterns
+ *    - Warm model cache before operations
+ *    - Predictive route caching
+ *
+ * 2. REAL-TIME CODE ANALYSIS
+ *    - Multi-file AST parsing with tree-sitter
+ *    - Cross-file type inference
+ *    - Live complexity metrics
+ *    - Dependency graph updates
+ *
+ * 3. ADVANCED LEARNING
+ *    - Distributed trajectory replay
+ *    - Parallel SONA micro-LoRA updates
+ *    - Background EWC consolidation
+ *    - Online pattern clustering
+ *
+ * 4. INTELLIGENT RETRIEVAL
+ *    - Parallel RAG chunking and retrieval
+ *    - Sharded similarity search
+ *    - Context relevance ranking
+ *    - Semantic deduplication
+ *
+ * 5. SECURITY & QUALITY
+ *    - Parallel SAST scanning
+ *    - Multi-rule linting
+ *    - Vulnerability detection
+ *    - Code smell analysis
+ *
+ * 6. GIT INTELLIGENCE
+ *    - Parallel blame analysis
+ *    - Branch comparison
+ *    - Merge conflict prediction
+ *    - Code churn metrics
+ */
+export interface WorkerPoolConfig {
+    numWorkers?: number;
+    enabled?: boolean;
+    taskTimeout?: number;
+    maxQueueSize?: number;
+}
+export interface SpeculativeEmbedding {
+    file: string;
+    embedding: number[];
+    confidence: number;
+    timestamp: number;
+}
+export interface ASTAnalysis {
+    file: string;
+    language: string;
+    complexity: number;
+    functions: string[];
+    imports: string[];
+    exports: string[];
+    dependencies: string[];
+}
+export interface SecurityFinding {
+    file: string;
+    line: number;
+    severity: 'low' | 'medium' | 'high' | 'critical';
+    rule: string;
+    message: string;
+    suggestion?: string;
+}
+export interface ContextChunk {
+    content: string;
+    source: string;
+    relevance: number;
+    embedding?: number[];
+}
+export interface GitBlame {
+    file: string;
+    lines: Array<{
+        line: number;
+        author: string;
+        date: string;
+        commit: string;
+    }>;
+}
+export interface CodeChurn {
+    file: string;
+    additions: number;
+    deletions: number;
+    commits: number;
+    authors: string[];
+    lastModified: string;
+}
+export declare class ExtendedWorkerPool {
+    private workers;
+    private taskQueue;
+    private busyWorkers;
+    private config;
+    private initialized;
+    private speculativeCache;
+    private astCache;
+    constructor(config?: WorkerPoolConfig);
+    init(): Promise<void>;
+    private getWorkerCode;
+    private getWorkerHandlers;
+    private handleWorkerResult;
+    private processQueue;
+    private execute;
+    /**
+     * Pre-embed files likely to be edited next based on co-edit patterns
+     * Hook: session-start, post-edit
+     */
+    speculativeEmbed(currentFile: string, coEditGraph: Map<string, string[]>): Promise<SpeculativeEmbedding[]>;
+    /**
+     * Analyze AST of multiple files in parallel
+     * Hook: pre-edit, route
+     */
+    analyzeAST(files: string[]): Promise<ASTAnalysis[]>;
+    /**
+     * Analyze code complexity for multiple files
+     * Hook: post-edit, session-end
+     */
+    analyzeComplexity(files: string[]): Promise<Array<{
+        file: string;
+        lines: number;
+        nonEmptyLines: number;
+        cyclomaticComplexity: number;
+        functions: number;
+        avgFunctionSize: number;
+    }>>;
+    /**
+     * Build dependency graph from entry points
+     * Hook: session-start
+     */
+    buildDependencyGraph(entryPoints: string[]): Promise<Record<string, string[]>>;
+    /**
+     * Scan files for security vulnerabilities
+     * Hook: pre-command (before commit), post-edit
+     */
+    securityScan(files: string[], rules?: string[]): Promise<SecurityFinding[]>;
+    /**
+     * Retrieve relevant context chunks in parallel
+     * Hook: suggest-context, recall
+     */
+    ragRetrieve(query: string, chunks: ContextChunk[], topK?: number): Promise<ContextChunk[]>;
+    /**
+     * Rank context items by relevance to query
+     * Hook: suggest-context
+     */
+    rankContext(context: string[], query: string): Promise<Array<{
+        index: number;
+        content: string;
+        relevance: number;
+    }>>;
+    /**
+     * Deduplicate similar items
+     * Hook: remember, suggest-context
+     */
+    deduplicate(items: string[], threshold?: number): Promise<string[]>;
+    /**
+     * Get blame information for files in parallel
+     * Hook: pre-edit (for context), coedit
+     */
+    gitBlame(files: string[]): Promise<GitBlame[]>;
+    /**
+     * Analyze code churn for files
+     * Hook: session-start, route
+     */
+    gitChurn(files: string[], since?: string): Promise<CodeChurn[]>;
+    getStats(): {
+        enabled: boolean;
+        workers: number;
+        busy: number;
+        queued: number;
+        speculativeCacheSize: number;
+        astCacheSize: number;
+    };
+    clearCaches(): void;
+    shutdown(): Promise<void>;
+}
+export declare function getExtendedWorkerPool(config?: WorkerPoolConfig): ExtendedWorkerPool;
+export declare function initExtendedWorkerPool(config?: WorkerPoolConfig): Promise<ExtendedWorkerPool>;
+export default ExtendedWorkerPool;
+//# sourceMappingURL=parallel-workers.d.ts.map

package/dist/core/parallel-workers.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"parallel-workers.d.ts","sourceRoot":"","sources":["../../src/core/parallel-workers.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GAuCG;AAWH,MAAM,WAAW,gBAAgB;IAC/B,UAAU,CAAC,EAAE,MAAM,CAAC;IACpB,OAAO,CAAC,EAAE,OAAO,CAAC;IAClB,WAAW,CAAC,EAAE,MAAM,CAAC;IACrB,YAAY,CAAC,EAAE,MAAM,CAAC;CACvB;AAED,MAAM,WAAW,oBAAoB;IACnC,IAAI,EAAE,MAAM,CAAC;IACb,SAAS,EAAE,MAAM,EAAE,CAAC;IACpB,UAAU,EAAE,MAAM,CAAC;IACnB,SAAS,EAAE,MAAM,CAAC;CACnB;AAED,MAAM,WAAW,WAAW;IAC1B,IAAI,EAAE,MAAM,CAAC;IACb,QAAQ,EAAE,MAAM,CAAC;IACjB,UAAU,EAAE,MAAM,CAAC;IACnB,SAAS,EAAE,MAAM,EAAE,CAAC;IACpB,OAAO,EAAE,MAAM,EAAE,CAAC;IAClB,OAAO,EAAE,MAAM,EAAE,CAAC;IAClB,YAAY,EAAE,MAAM,EAAE,CAAC;CACxB;AAED,MAAM,WAAW,eAAe;IAC9B,IAAI,EAAE,MAAM,CAAC;IACb,IAAI,EAAE,MAAM,CAAC;IACb,QAAQ,EAAE,KAAK,GAAG,QAAQ,GAAG,MAAM,GAAG,UAAU,CAAC;IACjD,IAAI,EAAE,MAAM,CAAC;IACb,OAAO,EAAE,MAAM,CAAC;IAChB,UAAU,CAAC,EAAE,MAAM,CAAC;CACrB;AAED,MAAM,WAAW,YAAY;IAC3B,OAAO,EAAE,MAAM,CAAC;IAChB,MAAM,EAAE,MAAM,CAAC;IACf,SAAS,EAAE,MAAM,CAAC;IAClB,SAAS,CAAC,EAAE,MAAM,EAAE,CAAC;CACtB;AAED,MAAM,WAAW,QAAQ;IACvB,IAAI,EAAE,MAAM,CAAC;IACb,KAAK,EAAE,KAAK,CAAC;QACX,IAAI,EAAE,MAAM,CAAC;QACb,MAAM,EAAE,MAAM,CAAC;QACf,IAAI,EAAE,MAAM,CAAC;QACb,MAAM,EAAE,MAAM,CAAC;KAChB,CAAC,CAAC;CACJ;AAED,MAAM,WAAW,SAAS;IACxB,IAAI,EAAE,MAAM,CAAC;IACb,SAAS,EAAE,MAAM,CAAC;IAClB,SAAS,EAAE,MAAM,CAAC;IAClB,OAAO,EAAE,MAAM,CAAC;IAChB,OAAO,EAAE,MAAM,EAAE,CAAC;IAClB,YAAY,EAAE,MAAM,CAAC;CACtB;AA+BD,qBAAa,kBAAkB;IAC7B,OAAO,CAAC,OAAO,CAAgB;IAC/B,OAAO,CAAC,SAAS,CAKT;IACR,OAAO,CAAC,WAAW,CAAkC;IACrD,OAAO,CAAC,MAAM,CAA6B;IAC3C,OAAO,CAAC,WAAW,CAAS;IAC5B,OAAO,CAAC,gBAAgB,CAAgD;IACxE,OAAO,CAAC,QAAQ,CAAuC;gBAE3C,MAAM,GAAE,gBAAqB;IAYnC,IAAI,IAAI,OAAO,CAAC,IAAI,CAAC;IAgC3B,OAAO,CAAC,aAAa;IAOrB,OAAO,CAAC,iBAAiB;IAqUzB,OAAO,CAAC,kBAAkB;IAmB1B,OAAO,CAAC,YAAY;YAWN,OAAO;IAsCrB;;;OAGG;IACG,gBAAgB,CACpB,WAAW,EAAE,MAAM,EACnB,WAAW,EAAE,GAAG,CAAC,MAAM,EAAE,MAAM,EAAE,CAAC,GACjC,OAAO,CAAC,oBAAoB,EAAE,CAAC;IA4BlC;;;OAGG;IACG,UAAU,CAAC,KAAK,EAAE,MAAM,EAAE,GAAG,OAAO,CAAC,WAAW,EAAE,CAAC;IAoBzD;;;OAGG;IACG,iBAAiB,CAAC,KAAK,EAAE,MAAM,EAAE,GAAG,OAAO,CAAC,KAAK,CAAC;QACtD,IAAI,EAAE,MAAM,CAAC;QACb,KAAK,EAAE,MAAM,CAAC;QACd,aAAa,EAAE,MAAM,CAAC;QACtB,oBAAoB,EAAE,MAAM,CAAC;QAC7B,SAAS,EAAE,MAAM,CAAC;QAClB,eAAe,EAAE,MAAM,CAAC;KACzB,CAAC,CAAC;IAIH;;;OAGG;IACG,oBAAoB,CAAC,WAAW,EAAE,MAAM,EAAE,GAAG,OAAO,CAAC,MAAM,CAAC,MAAM,EAAE,MAAM,EAAE,CAAC,CAAC;IAQpF;;;OAGG;IACG,YAAY,CAAC,KAAK,EAAE,MAAM,EAAE,EAAE,KAAK,CAAC,EAAE,MAAM,EAAE,GAAG,OAAO,CAAC,eAAe,EAAE,CAAC;IAQjF;;;OAGG;IACG,WAAW,CAAC,KAAK,EAAE,MAAM,EAAE,MAAM,EAAE,YAAY,EAAE,EAAE,IAAI,GAAE,MAAU,GAAG,OAAO,CAAC,YAAY,EAAE,CAAC;IAInG;;;OAGG;IACG,WAAW,CAAC,OAAO,EAAE,MAAM,EAAE,EAAE,KAAK,EAAE,MAAM,GAAG,OAAO,CAAC,KAAK,CAAC;QAAE,KAAK,EAAE,MAAM,CAAC;QAAC,OAAO,EAAE,MAAM,CAAC;QAAC,SAAS,EAAE,MAAM,CAAA;KAAE,CAAC,CAAC;IAI1H;;;OAGG;IACG,WAAW,CAAC,KAAK,EAAE,MAAM,EAAE,EAAE,SAAS,GAAE,MAAY,GAAG,OAAO,CAAC,MAAM,EAAE,CAAC;IAQ9E;;;OAGG;IACG,QAAQ,CAAC,KAAK,EAAE,MAAM,EAAE,GAAG,OAAO,CAAC,QAAQ,EAAE,CAAC;IAIpD;;;OAGG;IACG,QAAQ,CAAC,KAAK,EAAE,MAAM,EAAE,EAAE,KAAK,CAAC,EAAE,MAAM,GAAG,OAAO,CAAC,SAAS,EAAE,CAAC;IAQrE,QAAQ,IAAI;QACV,OAAO,EAAE,OAAO,CAAC;QACjB,OAAO,EAAE,MAAM,CAAC;QAChB,IAAI,EAAE,MAAM,CAAC;QACb,MAAM,EAAE,MAAM,CAAC;QACf,oBAAoB,EAAE,MAAM,CAAC;QAC7B,YAAY,EAAE,MAAM,CAAC;KACtB;IAWD,WAAW,IAAI,IAAI;IAKb,QAAQ,IAAI,OAAO,CAAC,IAAI,CAAC;CAchC;AAQD,wBAAgB,qBAAqB,CAAC,MAAM,CAAC,EAAE,gBAAgB,GAAG,kBAAkB,CAKnF;AAED,wBAAsB,sBAAsB,CAAC,MAAM,CAAC,EAAE,gBAAgB,GAAG,OAAO,CAAC,kBAAkB,CAAC,CAInG;AAED,eAAe,kBAAkB,CAAC"}