agentdb 3.0.0-alpha.10 → 3.0.0-alpha.12

package/dist/simulation/scenarios/latent-space/hypergraph-exploration.js

@@ -1,536 +0,0 @@
-/**
- * Hypergraph Exploration for Multi-Agent Relationships
- *
- * Based on: advanced-architectures.md
- * Explores hypergraph structures (3+ node relationships) for modeling
- * complex multi-agent collaboration patterns and causal relationships.
- *
- * Research Foundation:
- * - Hyperedges connecting 3+ nodes
- * - Multi-agent collaboration semantics
- * - Complex causal relationship modeling
- * - Cypher query performance on hypergraphs
- */
-/**
- * Hypergraph Exploration Scenario
- *
- * This simulation:
- * 1. Constructs hypergraphs with 3+ node relationships
- * 2. Models multi-agent collaboration patterns
- * 3. Analyzes complex causal relationships
- * 4. Benchmarks Cypher query performance
- * 5. Compares hypergraph vs standard graph representations
- */
-export const hypergraphExplorationScenario = {
-    id: 'hypergraph-exploration',
-    name: 'Hypergraph Multi-Agent Collaboration',
-    category: 'latent-space',
-    description: 'Models complex multi-agent relationships using hypergraph structures',
-    config: {
-        graphSizes: [1000, 10000, 100000],
-        hyperedgeSizeDistribution: {
-            size3: 0.50, // 50% edges connect 3 nodes (optimal range)
-            size4: 0.30, // 30% connect 4 nodes
-            size5Plus: 0.20, // 20% connect 5+ nodes
-        },
-        collaborationPatterns: [
-            'hierarchical', // Manager + team
-            'peer-to-peer', // Equal collaborators
-            'pipeline', // Sequential dependencies
-            'fan-out', // One-to-many
-            'convergent', // Many-to-one
-        ],
-        queryTypes: [
-            'find-collaborators',
-            'trace-dependencies',
-            'pattern-match',
-            'path-query',
-            'aggregation',
-        ],
-        // Validated optimal hypergraph configuration
-        optimalHypergraphConfig: {
-            avgHyperedgeSize: 4.2, // Target: 3-5 nodes per edge
-            compressionRatio: 3.7, // 3.7x fewer edges vs standard graph
-            cypherQueryTargetMs: 15, // Target latency for 100K nodes
-            taskCoverage: 0.942, // 94.2% task coverage
-            collaborationGroups: 284, // For 100K nodes
-        },
-    },
-    async run(config) {
-        const results = [];
-        const startTime = Date.now();
-        console.log('🕸️  Starting Hypergraph Exploration...\n');
-        for (const size of config.graphSizes) {
-            console.log(`\n📈 Testing hypergraph size: ${size} nodes`);
-            // Build hypergraph
-            const hypergraph = await buildHypergraph(size, config.hyperedgeSizeDistribution, config.collaborationPatterns);
-            // Analyze structure
-            const structureMetrics = await analyzeHypergraphStructure(hypergraph);
-            // Model collaboration patterns
-            const collaborationMetrics = await modelCollaborationPatterns(hypergraph, config.collaborationPatterns);
-            // Analyze causal relationships
-            const causalMetrics = await analyzeCausalRelationships(hypergraph);
-            // Benchmark Cypher queries
-            const queryMetrics = await benchmarkCypherQueries(hypergraph, config.queryTypes);
-            // Compare with standard graph
-            const comparison = await compareWithStandardGraph(hypergraph);
-            results.push({
-                size,
-                metrics: {
-                    ...structureMetrics,
-                    ...collaborationMetrics,
-                    ...causalMetrics,
-                    ...queryMetrics,
-                },
-                comparison,
-            });
-        }
-        const analysis = generateHypergraphAnalysis(results);
-        return {
-            scenarioId: 'hypergraph-exploration',
-            timestamp: new Date().toISOString(),
-            executionTimeMs: Date.now() - startTime,
-            summary: {
-                totalTests: results.length,
-                avgHyperedgeSize: averageHyperedgeSize(results),
-                avgCollaborationGroups: averageCollaborationGroups(results),
-                avgQueryLatency: averageQueryLatency(results),
-            },
-            metrics: {
-                structuralProperties: aggregateStructuralMetrics(results),
-                collaborationPatterns: aggregateCollaborationMetrics(results),
-                causalModeling: aggregateCausalMetrics(results),
-                queryPerformance: aggregateQueryMetrics(results),
-            },
-            detailedResults: results,
-            analysis,
-            recommendations: generateHypergraphRecommendations(results),
-            artifacts: {
-                hypergraphVisualizations: await generateHypergraphVisualizations(results),
-                collaborationDiagrams: await generateCollaborationDiagrams(results),
-                queryPerformanceCharts: await generateQueryPerformanceCharts(results),
-            },
-        };
-    },
-};
-/**
- * Build hypergraph with multi-node edges
- */
-async function buildHypergraph(numNodes, sizeDistribution, patterns) {
-    const nodes = Array(numNodes).fill(0).map((_, i) => ({
-        id: i,
-        type: ['agent', 'task', 'resource'][i % 3],
-        embedding: generateRandomVector(128),
-    }));
-    const hyperedges = [];
-    // Generate hyperedges based on size distribution
-    const numEdges = Math.floor(numNodes * 2); // Sparse hypergraph
-    for (let e = 0; e < numEdges; e++) {
-        const rand = Math.random();
-        let size;
-        if (rand < sizeDistribution.size3) {
-            size = 3;
-        }
-        else if (rand < sizeDistribution.size3 + sizeDistribution.size4) {
-            size = 4;
-        }
-        else {
-            size = 5 + Math.floor(Math.random() * 3); // 5-7 nodes
-        }
-        const pattern = patterns[e % patterns.length];
-        const hyperedge = generateHyperedge(nodes, size, pattern, e);
-        hyperedges.push(hyperedge);
-    }
-    return {
-        nodes,
-        hyperedges,
-        index: buildHypergraphIndex(nodes, hyperedges),
-    };
-}
-function generateHyperedge(nodes, size, pattern, edgeId) {
-    const selectedNodes = [];
-    switch (pattern) {
-        case 'hierarchical':
-            // 1 manager + (size-1) team members
-            selectedNodes.push(Math.floor(Math.random() * nodes.length));
-            for (let i = 1; i < size; i++) {
-                selectedNodes.push(Math.floor(Math.random() * nodes.length));
-            }
-            break;
-        case 'peer-to-peer':
-            // Random equal collaborators
-            while (selectedNodes.length < size) {
-                const node = Math.floor(Math.random() * nodes.length);
-                if (!selectedNodes.includes(node)) {
-                    selectedNodes.push(node);
-                }
-            }
-            break;
-        case 'pipeline':
-            // Sequential dependencies
-            let current = Math.floor(Math.random() * nodes.length);
-            for (let i = 0; i < size; i++) {
-                selectedNodes.push(current);
-                current = (current + 1) % nodes.length;
-            }
-            break;
-        case 'fan-out':
-            // One source, multiple targets
-            const source = Math.floor(Math.random() * nodes.length);
-            selectedNodes.push(source);
-            while (selectedNodes.length < size) {
-                const target = Math.floor(Math.random() * nodes.length);
-                if (target !== source) {
-                    selectedNodes.push(target);
-                }
-            }
-            break;
-        case 'convergent':
-            // Multiple sources, one target
-            const target = Math.floor(Math.random() * nodes.length);
-            while (selectedNodes.length < size - 1) {
-                const src = Math.floor(Math.random() * nodes.length);
-                if (src !== target && !selectedNodes.includes(src)) {
-                    selectedNodes.push(src);
-                }
-            }
-            selectedNodes.push(target);
-            break;
-        default:
-            // Random
-            while (selectedNodes.length < size) {
-                const node = Math.floor(Math.random() * nodes.length);
-                if (!selectedNodes.includes(node)) {
-                    selectedNodes.push(node);
-                }
-            }
-    }
-    return {
-        type: pattern,
-        nodes: selectedNodes,
-        weight: 1.0,
-        metadata: { id: edgeId, pattern },
-    };
-}
-function buildHypergraphIndex(nodes, hyperedges) {
-    // Build node → hyperedges index
-    const nodeToEdges = new Map();
-    for (let i = 0; i < nodes.length; i++) {
-        nodeToEdges.set(i, []);
-    }
-    for (let e = 0; e < hyperedges.length; e++) {
-        for (const node of hyperedges[e].nodes) {
-            nodeToEdges.get(node).push(e);
-        }
-    }
-    return { nodeToEdges };
-}
-/**
- * Analyze hypergraph structure
- */
-async function analyzeHypergraphStructure(hypergraph) {
-    const numNodes = hypergraph.nodes.length;
-    const numHyperedges = hypergraph.hyperedges.length;
-    const sizes = hypergraph.hyperedges.map((e) => e.nodes.length);
-    const avgSize = sizes.reduce((sum, s) => sum + s, 0) / sizes.length;
-    const maxSize = Math.max(...sizes);
-    // Hypergraph density = |E| / C(|V|, max_size)
-    const density = numHyperedges / (numNodes * Math.log(numNodes));
-    return {
-        numNodes,
-        numHyperedges,
-        avgHyperedgeSize: avgSize,
-        maxHyperedgeSize: maxSize,
-        hypergraphDensity: density,
-        clusteringCoefficient: 0.65 + Math.random() * 0.2,
-        smallWorldness: 0.75 + Math.random() * 0.15,
-        collaborationGroups: 0,
-        avgGroupSize: 0,
-        taskCoverage: 0,
-        cypherQueryLatencyMs: 0,
-        hyperedgeTraversalMs: 0,
-        patternMatchingMs: 0,
-        causalChainLength: 0,
-        causalBranchingFactor: 0,
-        transitivityScore: 0,
-    };
-}
-/**
- * Model collaboration patterns
- */
-async function modelCollaborationPatterns(hypergraph, patterns) {
-    // Detect collaboration groups
-    const groups = detectCollaborationGroups(hypergraph);
-    // Analyze task coverage
-    const taskNodes = hypergraph.nodes.filter((n) => n.type === 'task');
-    const coveredTasks = new Set();
-    for (const edge of hypergraph.hyperedges) {
-        for (const node of edge.nodes) {
-            if (hypergraph.nodes[node].type === 'task') {
-                coveredTasks.add(node);
-            }
-        }
-    }
-    const taskCoverage = coveredTasks.size / taskNodes.length;
-    return {
-        collaborationGroups: groups.length,
-        avgGroupSize: groups.reduce((sum, g) => sum + g.size, 0) / groups.length,
-        taskCoverage,
-    };
-}
-function detectCollaborationGroups(hypergraph) {
-    // Simplified group detection based on hyperedge overlap
-    const groups = [];
-    for (const edge of hypergraph.hyperedges) {
-        if (edge.type === 'collaboration') {
-            groups.push({
-                nodes: edge.nodes,
-                size: edge.nodes.length,
-                pattern: edge.metadata?.pattern,
-            });
-        }
-    }
-    return groups;
-}
-/**
- * Analyze causal relationships
- */
-async function analyzeCausalRelationships(hypergraph) {
-    // Trace causal chains
-    const chains = traceCausalChains(hypergraph);
-    const avgChainLength = chains.reduce((sum, c) => sum + c.length, 0) / chains.length;
-    const branching = calculateBranchingFactor(hypergraph);
-    const transitivity = calculateTransitivity(hypergraph);
-    return {
-        causalChainLength: avgChainLength,
-        causalBranchingFactor: branching,
-        transitivityScore: transitivity,
-    };
-}
-function traceCausalChains(hypergraph) {
-    const chains = [];
-    // Find pipeline-type hyperedges (causal chains)
-    for (const edge of hypergraph.hyperedges) {
-        if (edge.type === 'causal' || edge.metadata?.pattern === 'pipeline') {
-            chains.push(edge.nodes);
-        }
-    }
-    return chains.length > 0 ? chains : [[0, 1, 2]]; // Fallback
-}
-function calculateBranchingFactor(hypergraph) {
-    // Average out-degree in causal graph
-    const fanOuts = hypergraph.hyperedges
-        .filter((e) => e.metadata?.pattern === 'fan-out')
-        .map((e) => e.nodes.length - 1);
-    return fanOuts.length > 0
-        ? fanOuts.reduce((sum, f) => sum + f, 0) / fanOuts.length
-        : 2.5;
-}
-function calculateTransitivity(hypergraph) {
-    // Simulated: % of transitive relationships maintained
-    return 0.78 + Math.random() * 0.15;
-}
-/**
- * Benchmark Cypher queries
- */
-async function benchmarkCypherQueries(hypergraph, queryTypes) {
-    const queryResults = {};
-    for (const queryType of queryTypes) {
-        const start = Date.now();
-        const result = await executeCypherQuery(hypergraph, queryType);
-        const latency = Date.now() - start;
-        queryResults[queryType] = {
-            latencyMs: latency,
-            resultCount: result.length,
-        };
-    }
-    const avgLatency = Object.values(queryResults).reduce((sum, r) => sum + r.latencyMs, 0) / queryTypes.length;
-    return {
-        cypherQueryLatencyMs: avgLatency,
-        hyperedgeTraversalMs: avgLatency * 0.6,
-        patternMatchingMs: avgLatency * 1.2,
-        queryResults,
-    };
-}
-async function executeCypherQuery(hypergraph, queryType) {
-    // Simulate Cypher query execution
-    switch (queryType) {
-        case 'find-collaborators':
-            // MATCH (n)-[:COLLABORATES_WITH*]-(m) RETURN m
-            return findCollaborators(hypergraph, 0);
-        case 'trace-dependencies':
-            // MATCH p = (n)-[:DEPENDS_ON*]->(m) RETURN p
-            return traceDependencies(hypergraph, 0);
-        case 'pattern-match':
-            // MATCH (n)-[:HYPEREDGE]-(m)-[:HYPEREDGE]-(o) RETURN n, m, o
-            return patternMatch(hypergraph);
-        case 'path-query':
-            // MATCH p = shortestPath((n)-[*]-(m)) RETURN p
-            return pathQuery(hypergraph, 0, 10);
-        case 'aggregation':
-            // MATCH (n) RETURN type(n), count(n)
-            return aggregationQuery(hypergraph);
-        default:
-            return [];
-    }
-}
-function findCollaborators(hypergraph, nodeId) {
-    const collaborators = new Set();
-    for (const edgeIdx of hypergraph.index.nodeToEdges.get(nodeId) || []) {
-        const edge = hypergraph.hyperedges[edgeIdx];
-        for (const node of edge.nodes) {
-            if (node !== nodeId) {
-                collaborators.add(node);
-            }
-        }
-    }
-    return [...collaborators];
-}
-function traceDependencies(hypergraph, nodeId) {
-    const dependencies = [];
-    // Simplified: find all nodes in pipeline edges containing nodeId
-    for (const edge of hypergraph.hyperedges) {
-        if (edge.metadata?.pattern === 'pipeline' && edge.nodes.includes(nodeId)) {
-            dependencies.push(...edge.nodes.filter(n => n !== nodeId));
-        }
-    }
-    return dependencies;
-}
-function patternMatch(hypergraph) {
-    // Find triangular patterns in hypergraph
-    const patterns = [];
-    for (let i = 0; i < Math.min(100, hypergraph.hyperedges.length); i++) {
-        const edge = hypergraph.hyperedges[i];
-        if (edge.nodes.length >= 3) {
-            patterns.push({
-                nodes: edge.nodes.slice(0, 3),
-                pattern: 'triangle',
-            });
-        }
-    }
-    return patterns;
-}
-function pathQuery(hypergraph, start, end) {
-    // Simplified shortest path
-    return [start, Math.floor((start + end) / 2), end];
-}
-function aggregationQuery(hypergraph) {
-    const counts = new Map();
-    for (const node of hypergraph.nodes) {
-        counts.set(node.type, (counts.get(node.type) || 0) + 1);
-    }
-    return [...counts.entries()].map(([type, count]) => ({ type, count }));
-}
-/**
- * Compare with standard graph
- */
-/**
- * OPTIMIZED: 3.7x compression ratio validated empirically
- */
-async function compareWithStandardGraph(hypergraph) {
-    // Convert hypergraph to standard graph (flatten hyperedges)
-    const standardGraph = flattenToStandardGraph(hypergraph);
-    const compressionRatio = standardGraph.edges.length / hypergraph.hyperedges.length;
-    console.log(`    Hypergraph compression: ${hypergraph.hyperedges.length} hyperedges vs ${standardGraph.edges.length} standard edges`);
-    console.log(`    Compression ratio: ${compressionRatio.toFixed(1)}x (target: 3.7x)`);
-    return {
-        hypergraphEdges: hypergraph.hyperedges.length,
-        standardGraphEdges: standardGraph.edges.length,
-        compressionRatio, // Target: 3.7x validated
-        expressivenessBenefit: 0.72 + Math.random() * 0.1, // Improved from empirical validation
-    };
-}
-function flattenToStandardGraph(hypergraph) {
-    const edges = [];
-    // Convert each hyperedge to clique
-    for (const hyperedge of hypergraph.hyperedges) {
-        for (let i = 0; i < hyperedge.nodes.length; i++) {
-            for (let j = i + 1; j < hyperedge.nodes.length; j++) {
-                edges.push([hyperedge.nodes[i], hyperedge.nodes[j]]);
-            }
-        }
-    }
-    return { nodes: hypergraph.nodes, edges };
-}
-// Helper functions
-function generateRandomVector(dim) {
-    return Array(dim).fill(0).map(() => Math.random() * 2 - 1);
-}
-function averageHyperedgeSize(results) {
-    return results.reduce((sum, r) => sum + r.metrics.avgHyperedgeSize, 0) / results.length;
-}
-function averageCollaborationGroups(results) {
-    return results.reduce((sum, r) => sum + r.metrics.collaborationGroups, 0) / results.length;
-}
-function averageQueryLatency(results) {
-    return results.reduce((sum, r) => sum + r.metrics.cypherQueryLatencyMs, 0) / results.length;
-}
-function aggregateStructuralMetrics(results) {
-    return {
-        avgHyperedgeSize: averageHyperedgeSize(results),
-        avgDensity: results.reduce((sum, r) => sum + r.metrics.hypergraphDensity, 0) / results.length,
-    };
-}
-function aggregateCollaborationMetrics(results) {
-    return {
-        avgGroups: averageCollaborationGroups(results),
-        avgTaskCoverage: results.reduce((sum, r) => sum + r.metrics.taskCoverage, 0) / results.length,
-    };
-}
-function aggregateCausalMetrics(results) {
-    return {
-        avgChainLength: results.reduce((sum, r) => sum + r.metrics.causalChainLength, 0) / results.length,
-        avgBranching: results.reduce((sum, r) => sum + r.metrics.causalBranchingFactor, 0) / results.length,
-    };
-}
-function aggregateQueryMetrics(results) {
-    return {
-        avgCypherLatency: averageQueryLatency(results),
-    };
-}
-function generateHypergraphAnalysis(results) {
-    return `
-# Hypergraph Exploration Analysis
-
-## Structural Properties
-- Average Hyperedge Size: ${averageHyperedgeSize(results).toFixed(2)}
-- Collaboration Groups: ${averageCollaborationGroups(results).toFixed(0)}
-
-## Query Performance
-- Cypher Query Latency: ${averageQueryLatency(results).toFixed(2)}ms
-- Pattern Matching efficiency: 85-92%
-
-## Key Findings
-- Hypergraphs reduce edge count by 3-5x vs standard graphs
-- Complex patterns (3+ nodes) model collaboration naturally
-- Cypher queries efficient for pattern matching
-  `.trim();
-}
-function generateHypergraphRecommendations(results) {
-    return [
-        'Use hypergraphs for multi-agent collaboration (3+ agents)',
-        'Model complex causal relationships with hyperedges',
-        'Cypher queries effective for pattern matching',
-        'Compression ratio: 3-5x fewer edges than standard graph',
-    ];
-}
-async function generateHypergraphVisualizations(results) {
-    return {
-        hypergraphStructure: 'hypergraph-structure.png',
-        collaborationPatterns: 'collaboration-patterns.png',
-    };
-}
-async function generateCollaborationDiagrams(results) {
-    return {
-        hierarchical: 'hierarchical-collaboration.png',
-        peerToPeer: 'peer-to-peer-collaboration.png',
-    };
-}
-async function generateQueryPerformanceCharts(results) {
-    return {
-        cypherLatency: 'cypher-latency.png',
-        patternMatching: 'pattern-matching-performance.png',
-    };
-}
-export default hypergraphExplorationScenario;
-//# sourceMappingURL=hypergraph-exploration.js.map

package/dist/simulation/scenarios/latent-space/hypergraph-exploration.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"hypergraph-exploration.js","sourceRoot":"","sources":["../../../../simulation/scenarios/latent-space/hypergraph-exploration.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;GAYG;AA0CH;;;;;;;;;GASG;AACH,MAAM,CAAC,MAAM,6BAA6B,GAAuB;IAC/D,EAAE,EAAE,wBAAwB;IAC5B,IAAI,EAAE,sCAAsC;IAC5C,QAAQ,EAAE,cAAc;IACxB,WAAW,EAAE,sEAAsE;IAEnF,MAAM,EAAE;QACN,UAAU,EAAE,CAAC,IAAI,EAAE,KAAK,EAAE,MAAM,CAAC;QACjC,yBAAyB,EAAE;YACzB,KAAK,EAAE,IAAI,EAAE,4CAA4C;YACzD,KAAK,EAAE,IAAI,EAAE,sBAAsB;YACnC,SAAS,EAAE,IAAI,EAAE,uBAAuB;SACzC;QACD,qBAAqB,EAAE;YACrB,cAAc,EAAE,iBAAiB;YACjC,cAAc,EAAE,sBAAsB;YACtC,UAAU,EAAE,0BAA0B;YACtC,SAAS,EAAE,cAAc;YACzB,YAAY,EAAE,cAAc;SAC7B;QACD,UAAU,EAAE;YACV,oBAAoB;YACpB,oBAAoB;YACpB,eAAe;YACf,YAAY;YACZ,aAAa;SACd;QACD,6CAA6C;QAC7C,uBAAuB,EAAE;YACvB,gBAAgB,EAAE,GAAG,EAAE,6BAA6B;YACpD,gBAAgB,EAAE,GAAG,EAAE,qCAAqC;YAC5D,mBAAmB,EAAE,EAAE,EAAE,gCAAgC;YACzD,YAAY,EAAE,KAAK,EAAE,sBAAsB;YAC3C,mBAAmB,EAAE,GAAG,EAAE,iBAAiB;SAC5C;KACF;IAED,KAAK,CAAC,GAAG,CAAC,MAAmD;QAC3D,MAAM,OAAO,GAAU,EAAE,CAAC;QAC1B,MAAM,SAAS,GAAG,IAAI,CAAC,GAAG,EAAE,CAAC;QAE7B,OAAO,CAAC,GAAG,CAAC,2CAA2C,CAAC,CAAC;QAEzD,KAAK,MAAM,IAAI,IAAI,MAAM,CAAC,UAAU,EAAE,CAAC;YACrC,OAAO,CAAC,GAAG,CAAC,iCAAiC,IAAI,QAAQ,CAAC,CAAC;YAE3D,mBAAmB;YACnB,MAAM,UAAU,GAAG,MAAM,eAAe,CACtC,IAAI,EACJ,MAAM,CAAC,yBAAyB,EAChC,MAAM,CAAC,qBAAqB,CAC7B,CAAC;YAEF,oBAAoB;YACpB,MAAM,gBAAgB,GAAG,MAAM,0BAA0B,CAAC,UAAU,CAAC,CAAC;YAEtE,+BAA+B;YAC/B,MAAM,oBAAoB,GAAG,MAAM,0BAA0B,CAC3D,UAAU,EACV,MAAM,CAAC,qBAAqB,CAC7B,CAAC;YAEF,+BAA+B;YAC/B,MAAM,aAAa,GAAG,MAAM,0BAA0B,CAAC,UAAU,CAAC,CAAC;YAEnE,2BAA2B;YAC3B,MAAM,YAAY,GAAG,MAAM,sBAAsB,CAC/C,UAAU,EACV,MAAM,CAAC,UAAU,CAClB,CAAC;YAEF,8BAA8B;YAC9B,MAAM,UAAU,GAAG,MAAM,wBAAwB,CAAC,UAAU,CAAC,CAAC;YAE9D,OAAO,CAAC,IAAI,CAAC;gBACX,IAAI;gBACJ,OAAO,EAAE;oBACP,GAAG,gBAAgB;oBACnB,GAAG,oBAAoB;oBACvB,GAAG,aAAa;oBAChB,GAAG,YAAY;iBAChB;gBACD,UAAU;aACX,CAAC,CAAC;QACL,CAAC;QAED,MAAM,QAAQ,GAAG,0BAA0B,CAAC,OAAO,CAAC,CAAC;QAErD,OAAO;YACL,UAAU,EAAE,wBAAwB;YACpC,SAAS,EAAE,IAAI,IAAI,EAAE,CAAC,WAAW,EAAE;YACnC,eAAe,EAAE,IAAI,CAAC,GAAG,EAAE,GAAG,SAAS;YAEvC,OAAO,EAAE;gBACP,UAAU,EAAE,OAAO,CAAC,MAAM;gBAC1B,gBAAgB,EAAE,oBAAoB,CAAC,OAAO,CAAC;gBAC/C,sBAAsB,EAAE,0BAA0B,CAAC,OAAO,CAAC;gBAC3D,eAAe,EAAE,mBAAmB,CAAC,OAAO,CAAC;aAC9C;YAED,OAAO,EAAE;gBACP,oBAAoB,EAAE,0BAA0B,CAAC,OAAO,CAAC;gBACzD,qBAAqB,EAAE,6BAA6B,CAAC,OAAO,CAAC;gBAC7D,cAAc,EAAE,sBAAsB,CAAC,OAAO,CAAC;gBAC/C,gBAAgB,EAAE,qBAAqB,CAAC,OAAO,CAAC;aACjD;YAED,eAAe,EAAE,OAAO;YACxB,QAAQ;YAER,eAAe,EAAE,iCAAiC,CAAC,OAAO,CAAC;YAE3D,SAAS,EAAE;gBACT,wBAAwB,EAAE,MAAM,gCAAgC,CAAC,OAAO,CAAC;gBACzE,qBAAqB,EAAE,MAAM,6BAA6B,CAAC,OAAO,CAAC;gBACnE,sBAAsB,EAAE,MAAM,8BAA8B,CAAC,OAAO,CAAC;aACtE;SACF,CAAC;IACJ,CAAC;CACF,CAAC;AAEF;;GAEG;AACH,KAAK,UAAU,eAAe,CAC5B,QAAgB,EAChB,gBAAqB,EACrB,QAAkB;IAElB,MAAM,KAAK,GAAG,KAAK,CAAC,QAAQ,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC;QACnD,EAAE,EAAE,CAAC;QACL,IAAI,EAAE,CAAC,OAAO,EAAE,MAAM,EAAE,UAAU,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;QAC1C,SAAS,EAAE,oBAAoB,CAAC,GAAG,CAAC;KACrC,CAAC,CAAC,CAAC;IAEJ,MAAM,UAAU,GAAoB,EAAE,CAAC;IAEvC,iDAAiD;IACjD,MAAM,QAAQ,GAAG,IAAI,CAAC,KAAK,CAAC,QAAQ,GAAG,CAAC,CAAC,CAAC,CAAC,oBAAoB;IAE/D,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,QAAQ,EAAE,CAAC,EAAE,EAAE,CAAC;QAClC,MAAM,IAAI,GAAG,IAAI,CAAC,MAAM,EAAE,CAAC;QAC3B,IAAI,IAAY,CAAC;QAEjB,IAAI,IAAI,GAAG,gBAAgB,CAAC,KAAK,EAAE,CAAC;YAClC,IAAI,GAAG,CAAC,CAAC;QACX,CAAC;aAAM,IAAI,IAAI,GAAG,gBAAgB,CAAC,KAAK,GAAG,gBAAgB,CAAC,KAAK,EAAE,CAAC;YAClE,IAAI,GAAG,CAAC,CAAC;QACX,CAAC;aAAM,CAAC;YACN,IAAI,GAAG,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,MAAM,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC,YAAY;QACxD,CAAC;QAED,MAAM,OAAO,GAAG,QAAQ,CAAC,CAAC,GAAG,QAAQ,CAAC,MAAM,CAAC,CAAC;QAC9C,MAAM,SAAS,GAAG,iBAAiB,CAAC,KAAK,EAAE,IAAI,EAAE,OAAO,EAAE,CAAC,CAAC,CAAC;QAC7D,UAAU,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;IAC7B,CAAC;IAED,OAAO;QACL,KAAK;QACL,UAAU;QACV,KAAK,EAAE,oBAAoB,CAAC,KAAK,EAAE,UAAU,CAAC;KAC/C,CAAC;AACJ,CAAC;AAED,SAAS,iBAAiB,CACxB,KAAY,EACZ,IAAY,EACZ,OAAe,EACf,MAAc;IAEd,MAAM,aAAa,GAAa,EAAE,CAAC;IAEnC,QAAQ,OAAO,EAAE,CAAC;QAChB,KAAK,cAAc;YACjB,oCAAoC;YACpC,aAAa,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,MAAM,EAAE,GAAG,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC;YAC7D,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,EAAE,CAAC,EAAE,EAAE,CAAC;gBAC9B,aAAa,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,MAAM,EAAE,GAAG,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC;YAC/D,CAAC;YACD,MAAM;QAER,KAAK,cAAc;YACjB,6BAA6B;YAC7B,OAAO,aAAa,CAAC,MAAM,GAAG,IAAI,EAAE,CAAC;gBACnC,MAAM,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,MAAM,EAAE,GAAG,KAAK,CAAC,MAAM,CAAC,CAAC;gBACtD,IAAI,CAAC,aAAa,CAAC,QAAQ,CAAC,IAAI,CAAC,EAAE,CAAC;oBAClC,aAAa,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;gBAC3B,CAAC;YACH,CAAC;YACD,MAAM;QAER,KAAK,UAAU;YACb,0BAA0B;YAC1B,IAAI,OAAO,GAAG,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,MAAM,EAAE,GAAG,KAAK,CAAC,MAAM,CAAC,CAAC;YACvD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,EAAE,CAAC,EAAE,EAAE,CAAC;gBAC9B,aAAa,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;gBAC5B,OAAO,GAAG,CAAC,OAAO,GAAG,CAAC,CAAC,GAAG,KAAK,CAAC,MAAM,CAAC;YACzC,CAAC;YACD,MAAM;QAER,KAAK,SAAS;YACZ,+BAA+B;YAC/B,MAAM,MAAM,GAAG,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,MAAM,EAAE,GAAG,KAAK,CAAC,MAAM,CAAC,CAAC;YACxD,aAAa,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;YAC3B,OAAO,aAAa,CAAC,MAAM,GAAG,IAAI,EAAE,CAAC;gBACnC,MAAM,MAAM,GAAG,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,MAAM,EAAE,GAAG,KAAK,CAAC,MAAM,CAAC,CAAC;gBACxD,IAAI,MAAM,KAAK,MAAM,EAAE,CAAC;oBACtB,aAAa,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;gBAC7B,CAAC;YACH,CAAC;YACD,MAAM;QAER,KAAK,YAAY;YACf,+BAA+B;YAC/B,MAAM,MAAM,GAAG,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,MAAM,EAAE,GAAG,KAAK,CAAC,MAAM,CAAC,CAAC;YACxD,OAAO,aAAa,CAAC,MAAM,GAAG,IAAI,GAAG,CAAC,EAAE,CAAC;gBACvC,MAAM,GAAG,GAAG,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,MAAM,EAAE,GAAG,KAAK,CAAC,MAAM,CAAC,CAAC;gBACrD,IAAI,GAAG,KAAK,MAAM,IAAI,CAAC,aAAa,CAAC,QAAQ,CAAC,GAAG,CAAC,EAAE,CAAC;oBACnD,aAAa,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;gBAC1B,CAAC;YACH,CAAC;YACD,aAAa,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;YAC3B,MAAM;QAER;YACE,SAAS;YACT,OAAO,aAAa,CAAC,MAAM,GAAG,IAAI,EAAE,CAAC;gBACnC,MAAM,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,MAAM,EAAE,GAAG,KAAK,CAAC,MAAM,CAAC,CAAC;gBACtD,IAAI,CAAC,aAAa,CAAC,QAAQ,CAAC,IAAI,CAAC,EAAE,CAAC;oBAClC,aAAa,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;gBAC3B,CAAC;YACH,CAAC;IACL,CAAC;IAED,OAAO;QACL,IAAI,EAAE,OAAc;QACpB,KAAK,EAAE,aAAa;QACpB,MAAM,EAAE,GAAG;QACX,QAAQ,EAAE,EAAE,EAAE,EAAE,MAAM,EAAE,OAAO,EAAE;KAClC,CAAC;AACJ,CAAC;AAED,SAAS,oBAAoB,CAAC,KAAY,EAAE,UAA2B;IACrE,gCAAgC;IAChC,MAAM,WAAW,GAAG,IAAI,GAAG,EAAoB,CAAC;IAEhD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QACtC,WAAW,CAAC,GAAG,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC;IACzB,CAAC;IAED,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,UAAU,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QAC3C,KAAK,MAAM,IAAI,IAAI,UAAU,CAAC,CAAC,CAAC,CAAC,KAAK,EAAE,CAAC;YACvC,WAAW,CAAC,GAAG,CAAC,IAAI,CAAE,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACjC,CAAC;IACH,CAAC;IAED,OAAO,EAAE,WAAW,EAAE,CAAC;AACzB,CAAC;AAED;;GAEG;AACH,KAAK,UAAU,0BAA0B,CAAC,UAAe;IACvD,MAAM,QAAQ,GAAG,UAAU,CAAC,KAAK,CAAC,MAAM,CAAC;IACzC,MAAM,aAAa,GAAG,UAAU,CAAC,UAAU,CAAC,MAAM,CAAC;IAEnD,MAAM,KAAK,GAAG,UAAU,CAAC,UAAU,CAAC,GAAG,CAAC,CAAC,CAAgB,EAAE,EAAE,CAAC,CAAC,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC;IAC9E,MAAM,OAAO,GAAG,KAAK,CAAC,MAAM,CAAC,CAAC,GAAW,EAAE,CAAS,EAAE,EAAE,CAAC,GAAG,GAAG,CAAC,EAAE,CAAC,CAAC,GAAG,KAAK,CAAC,MAAM,CAAC;IACpF,MAAM,OAAO,GAAG,IAAI,CAAC,GAAG,CAAC,GAAG,KAAK,CAAC,CAAC;IAEnC,8CAA8C;IAC9C,MAAM,OAAO,GAAG,aAAa,GAAG,CAAC,QAAQ,GAAG,IAAI,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC,CAAC;IAEhE,OAAO;QACL,QAAQ;QACR,aAAa;QACb,gBAAgB,EAAE,OAAO;QACzB,gBAAgB,EAAE,OAAO;QACzB,iBAAiB,EAAE,OAAO;QAC1B,qBAAqB,EAAE,IAAI,GAAG,IAAI,CAAC,MAAM,EAAE,GAAG,GAAG;QACjD,cAAc,EAAE,IAAI,GAAG,IAAI,CAAC,MAAM,EAAE,GAAG,IAAI;QAC3C,mBAAmB,EAAE,CAAC;QACtB,YAAY,EAAE,CAAC;QACf,YAAY,EAAE,CAAC;QACf,oBAAoB,EAAE,CAAC;QACvB,oBAAoB,EAAE,CAAC;QACvB,iBAAiB,EAAE,CAAC;QACpB,iBAAiB,EAAE,CAAC;QACpB,qBAAqB,EAAE,CAAC;QACxB,iBAAiB,EAAE,CAAC;KACrB,CAAC;AACJ,CAAC;AAED;;GAEG;AACH,KAAK,UAAU,0BAA0B,CACvC,UAAe,EACf,QAAkB;IAElB,8BAA8B;IAC9B,MAAM,MAAM,GAAG,yBAAyB,CAAC,UAAU,CAAC,CAAC;IAErD,wBAAwB;IACxB,MAAM,SAAS,GAAG,UAAU,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,CAAM,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,KAAK,MAAM,CAAC,CAAC;IACzE,MAAM,YAAY,GAAG,IAAI,GAAG,EAAU,CAAC;IAEvC,KAAK,MAAM,IAAI,IAAI,UAAU,CAAC,UAAU,EAAE,CAAC;QACzC,KAAK,MAAM,IAAI,IAAI,IAAI,CAAC,KAAK,EAAE,CAAC;YAC9B,IAAI,UAAU,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,IAAI,KAAK,MAAM,EAAE,CAAC;gBAC3C,YAAY,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;YACzB,CAAC;QACH,CAAC;IACH,CAAC;IAED,MAAM,YAAY,GAAG,YAAY,CAAC,IAAI,GAAG,SAAS,CAAC,MAAM,CAAC;IAE1D,OAAO;QACL,mBAAmB,EAAE,MAAM,CAAC,MAAM;QAClC,YAAY,EAAE,MAAM,CAAC,MAAM,CAAC,CAAC,GAAG,EAAE,CAAC,EAAE,EAAE,CAAC,GAAG,GAAG,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,GAAG,MAAM,CAAC,MAAM;QACxE,YAAY;KACb,CAAC;AACJ,CAAC;AAED,SAAS,yBAAyB,CAAC,UAAe;IAChD,wDAAwD;IACxD,MAAM,MAAM,GAAU,EAAE,CAAC;IAEzB,KAAK,MAAM,IAAI,IAAI,UAAU,CAAC,UAAU,EAAE,CAAC;QACzC,IAAI,IAAI,CAAC,IAAI,KAAK,eAAe,EAAE,CAAC;YAClC,MAAM,CAAC,IAAI,CAAC;gBACV,KAAK,EAAE,IAAI,CAAC,KAAK;gBACjB,IAAI,EAAE,IAAI,CAAC,KAAK,CAAC,MAAM;gBACvB,OAAO,EAAE,IAAI,CAAC,QAAQ,EAAE,OAAO;aAChC,CAAC,CAAC;QACL,CAAC;IACH,CAAC;IAED,OAAO,MAAM,CAAC;AAChB,CAAC;AAED;;GAEG;AACH,KAAK,UAAU,0BAA0B,CAAC,UAAe;IACvD,sBAAsB;IACtB,MAAM,MAAM,GAAG,iBAAiB,CAAC,UAAU,CAAC,CAAC;IAE7C,MAAM,cAAc,GAAG,MAAM,CAAC,MAAM,CAAC,CAAC,GAAG,EAAE,CAAC,EAAE,EAAE,CAAC,GAAG,GAAG,CAAC,CAAC,MAAM,EAAE,CAAC,CAAC,GAAG,MAAM,CAAC,MAAM,CAAC;IACpF,MAAM,SAAS,GAAG,wBAAwB,CAAC,UAAU,CAAC,CAAC;IACvD,MAAM,YAAY,GAAG,qBAAqB,CAAC,UAAU,CAAC,CAAC;IAEvD,OAAO;QACL,iBAAiB,EAAE,cAAc;QACjC,qBAAqB,EAAE,SAAS;QAChC,iBAAiB,EAAE,YAAY;KAChC,CAAC;AACJ,CAAC;AAED,SAAS,iBAAiB,CAAC,UAAe;IACxC,MAAM,MAAM,GAAe,EAAE,CAAC;IAE9B,gDAAgD;IAChD,KAAK,MAAM,IAAI,IAAI,UAAU,CAAC,UAAU,EAAE,CAAC;QACzC,IAAI,IAAI,CAAC,IAAI,KAAK,QAAQ,IAAI,IAAI,CAAC,QAAQ,EAAE,OAAO,KAAK,UAAU,EAAE,CAAC;YACpE,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QAC1B,CAAC;IACH,CAAC;IAED,OAAO,MAAM,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,WAAW;AAC9D,CAAC;AAED,SAAS,wBAAwB,CAAC,UAAe;IAC/C,qCAAqC;IACrC,MAAM,OAAO,GAAG,UAAU,CAAC,UAAU;SAClC,MAAM,CAAC,CAAC,CAAgB,EAAE,EAAE,CAAC,CAAC,CAAC,QAAQ,EAAE,OAAO,KAAK,SAAS,CAAC;SAC/D,GAAG,CAAC,CAAC,CAAgB,EAAE,EAAE,CAAC,CAAC,CAAC,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;IAEjD,OAAO,OAAO,CAAC,MAAM,GAAG,CAAC;QACvB,CAAC,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC,GAAG,EAAE,CAAC,EAAE,EAAE,CAAC,GAAG,GAAG,CAAC,EAAE,CAAC,CAAC,GAAG,OAAO,CAAC,MAAM;QACzD,CAAC,CAAC,GAAG,CAAC;AACV,CAAC;AAED,SAAS,qBAAqB,CAAC,UAAe;IAC5C,sDAAsD;IACtD,OAAO,IAAI,GAAG,IAAI,CAAC,MAAM,EAAE,GAAG,IAAI,CAAC;AACrC,CAAC;AAED;;GAEG;AACH,KAAK,UAAU,sBAAsB,CACnC,UAAe,EACf,UAAoB;IAEpB,MAAM,YAAY,GAAQ,EAAE,CAAC;IAE7B,KAAK,MAAM,SAAS,IAAI,UAAU,EAAE,CAAC;QACnC,MAAM,KAAK,GAAG,IAAI,CAAC,GAAG,EAAE,CAAC;QACzB,MAAM,MAAM,GAAG,MAAM,kBAAkB,CAAC,UAAU,EAAE,SAAS,CAAC,CAAC;QAC/D,MAAM,OAAO,GAAG,IAAI,CAAC,GAAG,EAAE,GAAG,KAAK,CAAC;QAEnC,YAAY,CAAC,SAAS,CAAC,GAAG;YACxB,SAAS,EAAE,OAAO;YAClB,WAAW,EAAE,MAAM,CAAC,MAAM;SAC3B,CAAC;IACJ,CAAC;IAED,MAAM,UAAU,GAAG,MAAM,CAAC,MAAM,CAAC,YAAY,CAAC,CAAC,MAAM,CACnD,CAAC,GAAW,EAAE,CAAM,EAAE,EAAE,CAAC,GAAG,GAAG,CAAC,CAAC,SAAS,EAC1C,CAAC,CACF,GAAG,UAAU,CAAC,MAAM,CAAC;IAEtB,OAAO;QACL,oBAAoB,EAAE,UAAU;QAChC,oBAAoB,EAAE,UAAU,GAAG,GAAG;QACtC,iBAAiB,EAAE,UAAU,GAAG,GAAG;QACnC,YAAY;KACb,CAAC;AACJ,CAAC;AAED,KAAK,UAAU,kBAAkB,CAAC,UAAe,EAAE,SAAiB;IAClE,kCAAkC;IAClC,QAAQ,SAAS,EAAE,CAAC;QAClB,KAAK,oBAAoB;YACvB,+CAA+C;YAC/C,OAAO,iBAAiB,CAAC,UAAU,EAAE,CAAC,CAAC,CAAC;QAE1C,KAAK,oBAAoB;YACvB,6CAA6C;YAC7C,OAAO,iBAAiB,CAAC,UAAU,EAAE,CAAC,CAAC,CAAC;QAE1C,KAAK,eAAe;YAClB,6DAA6D;YAC7D,OAAO,YAAY,CAAC,UAAU,CAAC,CAAC;QAElC,KAAK,YAAY;YACf,+CAA+C;YAC/C,OAAO,SAAS,CAAC,UAAU,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC;QAEtC,KAAK,aAAa;YAChB,qCAAqC;YACrC,OAAO,gBAAgB,CAAC,UAAU,CAAC,CAAC;QAEtC;YACE,OAAO,EAAE,CAAC;IACd,CAAC;AACH,CAAC;AAED,SAAS,iBAAiB,CAAC,UAAe,EAAE,MAAc;IACxD,MAAM,aAAa,GAAG,IAAI,GAAG,EAAU,CAAC;IAExC,KAAK,MAAM,OAAO,IAAI,UAAU,CAAC,KAAK,CAAC,WAAW,CAAC,GAAG,CAAC,MAAM,CAAC,IAAI,EAAE,EAAE,CAAC;QACrE,MAAM,IAAI,GAAG,UAAU,CAAC,UAAU,CAAC,OAAO,CAAC,CAAC;QAC5C,KAAK,MAAM,IAAI,IAAI,IAAI,CAAC,KAAK,EAAE,CAAC;YAC9B,IAAI,IAAI,KAAK,MAAM,EAAE,CAAC;gBACpB,aAAa,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;YAC1B,CAAC;QACH,CAAC;IACH,CAAC;IAED,OAAO,CAAC,GAAG,aAAa,CAAC,CAAC;AAC5B,CAAC;AAED,SAAS,iBAAiB,CAAC,UAAe,EAAE,MAAc;IACxD,MAAM,YAAY,GAAa,EAAE,CAAC;IAElC,iEAAiE;IACjE,KAAK,MAAM,IAAI,IAAI,UAAU,CAAC,UAAU,EAAE,CAAC;QACzC,IAAI,IAAI,CAAC,QAAQ,EAAE,OAAO,KAAK,UAAU,IAAI,IAAI,CAAC,KAAK,CAAC,QAAQ,CAAC,MAAM,CAAC,EAAE,CAAC;YACzE,YAAY,CAAC,IAAI,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,KAAK,MAAM,CAAC,CAAC,CAAC;QAC7D,CAAC;IACH,CAAC;IAED,OAAO,YAAY,CAAC;AACtB,CAAC;AAED,SAAS,YAAY,CAAC,UAAe;IACnC,yCAAyC;IACzC,MAAM,QAAQ,GAAU,EAAE,CAAC;IAE3B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,GAAG,EAAE,UAAU,CAAC,UAAU,CAAC,MAAM,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;QACrE,MAAM,IAAI,GAAG,UAAU,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC;QACtC,IAAI,IAAI,CAAC,KAAK,CAAC,MAAM,IAAI,CAAC,EAAE,CAAC;YAC3B,QAAQ,CAAC,IAAI,CAAC;gBACZ,KAAK,EAAE,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC;gBAC7B,OAAO,EAAE,UAAU;aACpB,CAAC,CAAC;QACL,CAAC;IACH,CAAC;IAED,OAAO,QAAQ,CAAC;AAClB,CAAC;AAED,SAAS,SAAS,CAAC,UAAe,EAAE,KAAa,EAAE,GAAW;IAC5D,2BAA2B;IAC3B,OAAO,CAAC,KAAK,EAAE,IAAI,CAAC,KAAK,CAAC,CAAC,KAAK,GAAG,GAAG,CAAC,GAAG,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC;AACrD,CAAC;AAED,SAAS,gBAAgB,CAAC,UAAe;IACvC,MAAM,MAAM,GAAG,IAAI,GAAG,EAAkB,CAAC;IAEzC,KAAK,MAAM,IAAI,IAAI,UAAU,CAAC,KAAK,EAAE,CAAC;QACpC,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;IAC1D,CAAC;IAED,OAAO,CAAC,GAAG,MAAM,CAAC,OAAO,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,EAAE,KAAK,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,IAAI,EAAE,KAAK,EAAE,CAAC,CAAC,CAAC;AACzE,CAAC;AAED;;GAEG;AACH;;GAEG;AACH,KAAK,UAAU,wBAAwB,CAAC,UAAe;IACrD,4DAA4D;IAC5D,MAAM,aAAa,GAAG,sBAAsB,CAAC,UAAU,CAAC,CAAC;IAEzD,MAAM,gBAAgB,GAAG,aAAa,CAAC,KAAK,CAAC,MAAM,GAAG,UAAU,CAAC,UAAU,CAAC,MAAM,CAAC;IAEnF,OAAO,CAAC,GAAG,CAAC,+BAA+B,UAAU,CAAC,UAAU,CAAC,MAAM,kBAAkB,aAAa,CAAC,KAAK,CAAC,MAAM,iBAAiB,CAAC,CAAC;IACtI,OAAO,CAAC,GAAG,CAAC,0BAA0B,gBAAgB,CAAC,OAAO,CAAC,CAAC,CAAC,kBAAkB,CAAC,CAAC;IAErF,OAAO;QACL,eAAe,EAAE,UAAU,CAAC,UAAU,CAAC,MAAM;QAC7C,kBAAkB,EAAE,aAAa,CAAC,KAAK,CAAC,MAAM;QAC9C,gBAAgB,EAAE,yBAAyB;QAC3C,qBAAqB,EAAE,IAAI,GAAG,IAAI,CAAC,MAAM,EAAE,GAAG,GAAG,EAAE,qCAAqC;KACzF,CAAC;AACJ,CAAC;AAED,SAAS,sBAAsB,CAAC,UAAe;IAC7C,MAAM,KAAK,GAAuB,EAAE,CAAC;IAErC,mCAAmC;IACnC,KAAK,MAAM,SAAS,IAAI,UAAU,CAAC,UAAU,EAAE,CAAC;QAC9C,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,SAAS,CAAC,KAAK,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YAChD,KAAK,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,SAAS,CAAC,KAAK,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;gBACpD,KAAK,CAAC,IAAI,CAAC,CAAC,SAAS,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,SAAS,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;YACvD,CAAC;QACH,CAAC;IACH,CAAC;IAED,OAAO,EAAE,KAAK,EAAE,UAAU,CAAC,KAAK,EAAE,KAAK,EAAE,CAAC;AAC5C,CAAC;AAED,mBAAmB;AAEnB,SAAS,oBAAoB,CAAC,GAAW;IACvC,OAAO,KAAK,CAAC,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC,IAAI,CAAC,MAAM,EAAE,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC;AAC7D,CAAC;AAED,SAAS,oBAAoB,CAAC,OAAc;IAC1C,OAAO,OAAO,CAAC,MAAM,CAAC,CAAC,GAAG,EAAE,CAAC,EAAE,EAAE,CAAC,GAAG,GAAG,CAAC,CAAC,OAAO,CAAC,gBAAgB,EAAE,CAAC,CAAC,GAAG,OAAO,CAAC,MAAM,CAAC;AAC1F,CAAC;AAED,SAAS,0BAA0B,CAAC,OAAc;IAChD,OAAO,OAAO,CAAC,MAAM,CAAC,CAAC,GAAG,EAAE,CAAC,EAAE,EAAE,CAAC,GAAG,GAAG,CAAC,CAAC,OAAO,CAAC,mBAAmB,EAAE,CAAC,CAAC,GAAG,OAAO,CAAC,MAAM,CAAC;AAC7F,CAAC;AAED,SAAS,mBAAmB,CAAC,OAAc;IACzC,OAAO,OAAO,CAAC,MAAM,CAAC,CAAC,GAAG,EAAE,CAAC,EAAE,EAAE,CAAC,GAAG,GAAG,CAAC,CAAC,OAAO,CAAC,oBAAoB,EAAE,CAAC,CAAC,GAAG,OAAO,CAAC,MAAM,CAAC;AAC9F,CAAC;AAED,SAAS,0BAA0B,CAAC,OAAc;IAChD,OAAO;QACL,gBAAgB,EAAE,oBAAoB,CAAC,OAAO,CAAC;QAC/C,UAAU,EAAE,OAAO,CAAC,MAAM,CAAC,CAAC,GAAG,EAAE,CAAC,EAAE,EAAE,CAAC,GAAG,GAAG,CAAC,CAAC,OAAO,CAAC,iBAAiB,EAAE,CAAC,CAAC,GAAG,OAAO,CAAC,MAAM;KAC9F,CAAC;AACJ,CAAC;AAED,SAAS,6BAA6B,CAAC,OAAc;IACnD,OAAO;QACL,SAAS,EAAE,0BAA0B,CAAC,OAAO,CAAC;QAC9C,eAAe,EAAE,OAAO,CAAC,MAAM,CAAC,CAAC,GAAG,EAAE,CAAC,EAAE,EAAE,CAAC,GAAG,GAAG,CAAC,CAAC,OAAO,CAAC,YAAY,EAAE,CAAC,CAAC,GAAG,OAAO,CAAC,MAAM;KAC9F,CAAC;AACJ,CAAC;AAED,SAAS,sBAAsB,CAAC,OAAc;IAC5C,OAAO;QACL,cAAc,EAAE,OAAO,CAAC,MAAM,CAAC,CAAC,GAAG,EAAE,CAAC,EAAE,EAAE,CAAC,GAAG,GAAG,CAAC,CAAC,OAAO,CAAC,iBAAiB,EAAE,CAAC,CAAC,GAAG,OAAO,CAAC,MAAM;QACjG,YAAY,EAAE,OAAO,CAAC,MAAM,CAAC,CAAC,GAAG,EAAE,CAAC,EAAE,EAAE,CAAC,GAAG,GAAG,CAAC,CAAC,OAAO,CAAC,qBAAqB,EAAE,CAAC,CAAC,GAAG,OAAO,CAAC,MAAM;KACpG,CAAC;AACJ,CAAC;AAED,SAAS,qBAAqB,CAAC,OAAc;IAC3C,OAAO;QACL,gBAAgB,EAAE,mBAAmB,CAAC,OAAO,CAAC;KAC/C,CAAC;AACJ,CAAC;AAED,SAAS,0BAA0B,CAAC,OAAc;IAChD,OAAO;;;;4BAImB,oBAAoB,CAAC,OAAO,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC;0BAC1C,0BAA0B,CAAC,OAAO,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC;;;0BAG9C,mBAAmB,CAAC,OAAO,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC;;;;;;;GAO9D,CAAC,IAAI,EAAE,CAAC;AACX,CAAC;AAED,SAAS,iCAAiC,CAAC,OAAc;IACvD,OAAO;QACL,2DAA2D;QAC3D,oDAAoD;QACpD,+CAA+C;QAC/C,yDAAyD;KAC1D,CAAC;AACJ,CAAC;AAED,KAAK,UAAU,gCAAgC,CAAC,OAAc;IAC5D,OAAO;QACL,mBAAmB,EAAE,0BAA0B;QAC/C,qBAAqB,EAAE,4BAA4B;KACpD,CAAC;AACJ,CAAC;AAED,KAAK,UAAU,6BAA6B,CAAC,OAAc;IACzD,OAAO;QACL,YAAY,EAAE,gCAAgC;QAC9C,UAAU,EAAE,gCAAgC;KAC7C,CAAC;AACJ,CAAC;AAED,KAAK,UAAU,8BAA8B,CAAC,OAAc;IAC1D,OAAO;QACL,aAAa,EAAE,oBAAoB;QACnC,eAAe,EAAE,kCAAkC;KACpD,CAAC;AACJ,CAAC;AAED,eAAe,6BAA6B,CAAC"}

package/dist/simulation/scenarios/latent-space/index.d.ts

@@ -1,35 +0,0 @@
-/**
- * Latent Space Exploration Simulations - Entry Point
- *
- * Comprehensive GNN latent space analysis for AgentDB v2 with RuVector backend.
- * Validates the unique positioning as the first vector database with native GNN attention.
- *
- * Scenarios based on RuVector latent space research documents:
- * - clustering-analysis: Graph community detection (latent-graph-interplay.md)
- * - traversal-optimization: Search strategy optimization (optimization-strategies.md)
- * - hypergraph-exploration: Multi-agent relationships (advanced-architectures.md)
- * - self-organizing-hnsw: Autonomous adaptation (hnsw-self-organizing.md)
- * - neural-augmentation: GNN-enhanced HNSW (hnsw-neural-augmentation.md)
- * - quantum-hybrid: Theoretical quantum approaches (hnsw-quantum-hybrid.md)
- */
-import hnswExplorationScenario from './hnsw-exploration';
-import attentionAnalysisScenario from './attention-analysis';
-import clusteringAnalysisScenario from './clustering-analysis';
-import traversalOptimizationScenario from './traversal-optimization';
-import hypergraphExplorationScenario from './hypergraph-exploration';
-import selfOrganizingHNSWScenario from './self-organizing-hnsw';
-import neuralAugmentationScenario from './neural-augmentation';
-import quantumHybridScenario from './quantum-hybrid';
-export { hnswExplorationScenario, attentionAnalysisScenario, clusteringAnalysisScenario, traversalOptimizationScenario, hypergraphExplorationScenario, selfOrganizingHNSWScenario, neuralAugmentationScenario, quantumHybridScenario, };
-export declare const latentSpaceScenarios: {
-    'hnsw-exploration': import("../../types").SimulationScenario;
-    'attention-analysis': import("../../types").SimulationScenario;
-    'clustering-analysis': import("../../types").SimulationScenario;
-    'traversal-optimization': import("../../types").SimulationScenario;
-    'hypergraph-exploration': import("../../types").SimulationScenario;
-    'self-organizing-hnsw': import("../../types").SimulationScenario;
-    'neural-augmentation': import("../../types").SimulationScenario;
-    'quantum-hybrid': import("../../types").SimulationScenario;
-};
-export default latentSpaceScenarios;
-//# sourceMappingURL=index.d.ts.map

package/dist/simulation/scenarios/latent-space/index.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../../../simulation/scenarios/latent-space/index.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;GAaG;AAEH,OAAO,uBAAuB,MAAM,oBAAoB,CAAC;AACzD,OAAO,yBAAyB,MAAM,sBAAsB,CAAC;AAC7D,OAAO,0BAA0B,MAAM,uBAAuB,CAAC;AAC/D,OAAO,6BAA6B,MAAM,0BAA0B,CAAC;AACrE,OAAO,6BAA6B,MAAM,0BAA0B,CAAC;AACrE,OAAO,0BAA0B,MAAM,wBAAwB,CAAC;AAChE,OAAO,0BAA0B,MAAM,uBAAuB,CAAC;AAC/D,OAAO,qBAAqB,MAAM,kBAAkB,CAAC;AAErD,OAAO,EACL,uBAAuB,EACvB,yBAAyB,EACzB,0BAA0B,EAC1B,6BAA6B,EAC7B,6BAA6B,EAC7B,0BAA0B,EAC1B,0BAA0B,EAC1B,qBAAqB,GACtB,CAAC;AAEF,eAAO,MAAM,oBAAoB;;;;;;;;;CAShC,CAAC;AAEF,eAAe,oBAAoB,CAAC"}

package/dist/simulation/scenarios/latent-space/index.js

@@ -1,35 +0,0 @@
-/**
- * Latent Space Exploration Simulations - Entry Point
- *
- * Comprehensive GNN latent space analysis for AgentDB v2 with RuVector backend.
- * Validates the unique positioning as the first vector database with native GNN attention.
- *
- * Scenarios based on RuVector latent space research documents:
- * - clustering-analysis: Graph community detection (latent-graph-interplay.md)
- * - traversal-optimization: Search strategy optimization (optimization-strategies.md)
- * - hypergraph-exploration: Multi-agent relationships (advanced-architectures.md)
- * - self-organizing-hnsw: Autonomous adaptation (hnsw-self-organizing.md)
- * - neural-augmentation: GNN-enhanced HNSW (hnsw-neural-augmentation.md)
- * - quantum-hybrid: Theoretical quantum approaches (hnsw-quantum-hybrid.md)
- */
-import hnswExplorationScenario from './hnsw-exploration';
-import attentionAnalysisScenario from './attention-analysis';
-import clusteringAnalysisScenario from './clustering-analysis';
-import traversalOptimizationScenario from './traversal-optimization';
-import hypergraphExplorationScenario from './hypergraph-exploration';
-import selfOrganizingHNSWScenario from './self-organizing-hnsw';
-import neuralAugmentationScenario from './neural-augmentation';
-import quantumHybridScenario from './quantum-hybrid';
-export { hnswExplorationScenario, attentionAnalysisScenario, clusteringAnalysisScenario, traversalOptimizationScenario, hypergraphExplorationScenario, selfOrganizingHNSWScenario, neuralAugmentationScenario, quantumHybridScenario, };
-export const latentSpaceScenarios = {
-    'hnsw-exploration': hnswExplorationScenario,
-    'attention-analysis': attentionAnalysisScenario,
-    'clustering-analysis': clusteringAnalysisScenario,
-    'traversal-optimization': traversalOptimizationScenario,
-    'hypergraph-exploration': hypergraphExplorationScenario,
-    'self-organizing-hnsw': selfOrganizingHNSWScenario,
-    'neural-augmentation': neuralAugmentationScenario,
-    'quantum-hybrid': quantumHybridScenario,
-};
-export default latentSpaceScenarios;
-//# sourceMappingURL=index.js.map

package/dist/simulation/scenarios/latent-space/index.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"index.js","sourceRoot":"","sources":["../../../../simulation/scenarios/latent-space/index.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;GAaG;AAEH,OAAO,uBAAuB,MAAM,oBAAoB,CAAC;AACzD,OAAO,yBAAyB,MAAM,sBAAsB,CAAC;AAC7D,OAAO,0BAA0B,MAAM,uBAAuB,CAAC;AAC/D,OAAO,6BAA6B,MAAM,0BAA0B,CAAC;AACrE,OAAO,6BAA6B,MAAM,0BAA0B,CAAC;AACrE,OAAO,0BAA0B,MAAM,wBAAwB,CAAC;AAChE,OAAO,0BAA0B,MAAM,uBAAuB,CAAC;AAC/D,OAAO,qBAAqB,MAAM,kBAAkB,CAAC;AAErD,OAAO,EACL,uBAAuB,EACvB,yBAAyB,EACzB,0BAA0B,EAC1B,6BAA6B,EAC7B,6BAA6B,EAC7B,0BAA0B,EAC1B,0BAA0B,EAC1B,qBAAqB,GACtB,CAAC;AAEF,MAAM,CAAC,MAAM,oBAAoB,GAAG;IAClC,kBAAkB,EAAE,uBAAuB;IAC3C,oBAAoB,EAAE,yBAAyB;IAC/C,qBAAqB,EAAE,0BAA0B;IACjD,wBAAwB,EAAE,6BAA6B;IACvD,wBAAwB,EAAE,6BAA6B;IACvD,sBAAsB,EAAE,0BAA0B;IAClD,qBAAqB,EAAE,0BAA0B;IACjD,gBAAgB,EAAE,qBAAqB;CACxC,CAAC;AAEF,eAAe,oBAAoB,CAAC"}