causantic 0.2.0

package/dist/eval/experiments/vector-decay-sweep/index.d.ts

@@ -0,0 +1,7 @@
+/**
+ * Vector decay parameter sweep experiment.
+ * Tests different weightPerHop values to find optimal vector clock decay.
+ */
+export * from './types.js';
+export * from './run-sweep.js';
+//# sourceMappingURL=index.d.ts.map

package/dist/eval/experiments/vector-decay-sweep/index.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../../../src/eval/experiments/vector-decay-sweep/index.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAEH,cAAc,YAAY,CAAC;AAC3B,cAAc,gBAAgB,CAAC"}

package/dist/eval/experiments/vector-decay-sweep/index.js

@@ -0,0 +1,7 @@
+/**
+ * Vector decay parameter sweep experiment.
+ * Tests different weightPerHop values to find optimal vector clock decay.
+ */
+export * from './types.js';
+export * from './run-sweep.js';
+//# sourceMappingURL=index.js.map

package/dist/eval/experiments/vector-decay-sweep/index.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.js","sourceRoot":"","sources":["../../../../src/eval/experiments/vector-decay-sweep/index.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAEH,cAAc,YAAY,CAAC;AAC3B,cAAc,gBAAgB,CAAC"}

package/dist/eval/experiments/vector-decay-sweep/run-sweep.d.ts

@@ -0,0 +1,30 @@
+/**
+ * Vector decay parameter sweep experiment.
+ *
+ * Tests different weightPerHop values to find optimal decay rate
+ * for vector clock-based edge decay.
+ *
+ * The experiment works by:
+ * 1. For each source chunk, get its actual target chunks (positive samples)
+ * 2. Sample random chunks from the same project as negatives
+ * 3. Rank all candidates using vector clock decay weights
+ * 4. Measure if positive samples rank higher than negatives (MRR)
+ */
+import type { VectorDecayVariant, VectorDecaySweepResults } from './types.js';
+/**
+ * Create decay variants from weight-per-hop values.
+ */
+export declare function createVariants(weightPerHopValues?: number[]): VectorDecayVariant[];
+/**
+ * Run the vector decay sweep experiment.
+ */
+export declare function runVectorDecaySweep(options?: {
+    weightPerHopValues?: number[];
+    verbose?: boolean;
+    maxQueries?: number;
+}): Promise<VectorDecaySweepResults>;
+/**
+ * Format sweep results as a table.
+ */
+export declare function formatSweepResults(results: VectorDecaySweepResults): string;
+//# sourceMappingURL=run-sweep.d.ts.map

package/dist/eval/experiments/vector-decay-sweep/run-sweep.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"run-sweep.d.ts","sourceRoot":"","sources":["../../../../src/eval/experiments/vector-decay-sweep/run-sweep.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;GAWG;AAMH,OAAO,KAAK,EACV,kBAAkB,EAElB,uBAAuB,EAGxB,MAAM,YAAY,CAAC;AAMpB;;GAEG;AACH,wBAAgB,cAAc,CAAC,kBAAkB,GAAE,MAAM,EAA0B,GAAG,kBAAkB,EAAE,CASzG;AAiMD;;GAEG;AACH,wBAAsB,mBAAmB,CACvC,OAAO,GAAE;IACP,kBAAkB,CAAC,EAAE,MAAM,EAAE,CAAC;IAC9B,OAAO,CAAC,EAAE,OAAO,CAAC;IAClB,UAAU,CAAC,EAAE,MAAM,CAAC;CAChB,GACL,OAAO,CAAC,uBAAuB,CAAC,CAuLlC;AAED;;GAEG;AACH,wBAAgB,kBAAkB,CAAC,OAAO,EAAE,uBAAuB,GAAG,MAAM,CAiE3E"}

package/dist/eval/experiments/vector-decay-sweep/run-sweep.js

@@ -0,0 +1,378 @@
+/**
+ * Vector decay parameter sweep experiment.
+ *
+ * Tests different weightPerHop values to find optimal decay rate
+ * for vector clock-based edge decay.
+ *
+ * The experiment works by:
+ * 1. For each source chunk, get its actual target chunks (positive samples)
+ * 2. Sample random chunks from the same project as negatives
+ * 3. Rank all candidates using vector clock decay weights
+ * 4. Measure if positive samples rank higher than negatives (MRR)
+ */
+import { getDb } from '../../../storage/db.js';
+import { deserialize, hopCount } from '../../../temporal/vector-clock.js';
+import { calculateVectorDecayWeight } from '../../../storage/decay.js';
+import { getReferenceClock } from '../../../storage/clock-store.js';
+import { WEIGHT_PER_HOP_VALUES, HOP_BIN_BOUNDARIES } from './types.js';
+/** Number of negative samples per query */
+const NEGATIVE_SAMPLE_COUNT = 10;
+/**
+ * Create decay variants from weight-per-hop values.
+ */
+export function createVariants(weightPerHopValues = WEIGHT_PER_HOP_VALUES) {
+    return weightPerHopValues.map((wph) => ({
+        id: `wph-${(wph * 100).toFixed(0)}`,
+        name: `Weight/Hop ${(wph * 100).toFixed(0)}%`,
+        config: {
+            weightPerHop: wph,
+            minWeight: 0.01,
+        },
+    }));
+}
+/**
+ * Get hop bin for a given hop count.
+ */
+function getHopBin(hops) {
+    if (hops <= HOP_BIN_BOUNDARIES.near.max)
+        return 'near';
+    if (hops <= HOP_BIN_BOUNDARIES.medium.max)
+        return 'medium';
+    return 'far';
+}
+/**
+ * Load edges with vector clocks from database.
+ */
+function loadEdgesWithClocks() {
+    const db = getDb();
+    return db.prepare(`
+    SELECT id, source_chunk_id as sourceChunkId, target_chunk_id as targetChunkId,
+           vector_clock as vectorClock, initial_weight as initialWeight,
+           reference_type as referenceType
+    FROM edges
+    WHERE vector_clock IS NOT NULL
+  `).all();
+}
+/**
+ * Load chunk metadata.
+ */
+function loadChunks() {
+    const db = getDb();
+    const rows = db.prepare(`
+    SELECT id, session_slug as sessionSlug, vector_clock as vectorClock
+    FROM chunks
+  `).all();
+    return new Map(rows.map((r) => [r.id, r]));
+}
+/**
+ * Group edges by source chunk for retrieval evaluation.
+ */
+function groupEdgesBySource(edges) {
+    const groups = new Map();
+    for (const edge of edges) {
+        const existing = groups.get(edge.sourceChunkId) ?? [];
+        existing.push(edge);
+        groups.set(edge.sourceChunkId, existing);
+    }
+    return groups;
+}
+/**
+ * Sample random chunks from a project to use as negative samples.
+ */
+function sampleNegativeChunks(projectSlug, excludeChunkIds, count, projectChunks) {
+    const available = projectChunks.get(projectSlug) ?? [];
+    const candidates = available.filter((c) => !excludeChunkIds.has(c.id) && c.vectorClock);
+    if (candidates.length === 0)
+        return [];
+    // Fisher-Yates shuffle and take first `count`
+    const shuffled = [...candidates];
+    for (let i = shuffled.length - 1; i > 0; i--) {
+        const j = Math.floor(Math.random() * (i + 1));
+        [shuffled[i], shuffled[j]] = [shuffled[j], shuffled[i]];
+    }
+    return shuffled.slice(0, count);
+}
+/**
+ * Evaluate a single query (source chunk) with positive and negative samples.
+ */
+function evaluateQuery(sourceChunkId, positiveEdges, projectSlug, referenceClock, config, projectChunks) {
+    // Filter to edges with explicit references (not just adjacent)
+    const relevantTypes = ['file-path', 'code-entity', 'explicit-backref', 'error-fragment', 'tool-output'];
+    const relevantEdges = positiveEdges.filter((e) => relevantTypes.includes(e.referenceType ?? ''));
+    if (relevantEdges.length === 0) {
+        return null;
+    }
+    // Get the positive target chunk IDs
+    const positiveTargetIds = new Set(relevantEdges.map((e) => e.targetChunkId));
+    // Sample negative chunks
+    const excludeIds = new Set([sourceChunkId, ...positiveTargetIds]);
+    const negativeChunks = sampleNegativeChunks(projectSlug, excludeIds, NEGATIVE_SAMPLE_COUNT, projectChunks);
+    if (negativeChunks.length === 0) {
+        return null;
+    }
+    const candidates = [];
+    // Add positive samples (from edges)
+    for (const edge of relevantEdges) {
+        if (!edge.vectorClock)
+            continue;
+        const edgeClock = deserialize(edge.vectorClock);
+        const hops = hopCount(edgeClock, referenceClock);
+        const weight = calculateVectorDecayWeight(edgeClock, referenceClock, config);
+        candidates.push({
+            chunkId: edge.targetChunkId,
+            isPositive: true,
+            hops,
+            weight,
+        });
+    }
+    // Add negative samples
+    for (const chunk of negativeChunks) {
+        if (!chunk.vectorClock)
+            continue;
+        const chunkClock = deserialize(chunk.vectorClock);
+        const hops = hopCount(chunkClock, referenceClock);
+        // For negative samples, calculate weight based on chunk's clock
+        const weight = calculateVectorDecayWeight(chunkClock, referenceClock, config);
+        candidates.push({
+            chunkId: chunk.id,
+            isPositive: false,
+            hops,
+            weight,
+        });
+    }
+    if (candidates.filter((c) => c.isPositive).length === 0) {
+        return null;
+    }
+    // Sort by weight descending (best candidates first)
+    candidates.sort((a, b) => b.weight - a.weight);
+    // Find rank of first positive (relevant) sample
+    let firstRelevantRank = 0;
+    for (let i = 0; i < candidates.length; i++) {
+        if (candidates[i].isPositive) {
+            firstRelevantRank = i + 1;
+            break;
+        }
+    }
+    const reciprocalRank = firstRelevantRank > 0 ? 1 / firstRelevantRank : 0;
+    return {
+        sourceChunkId,
+        projectSlug,
+        relevantHops: candidates.filter((c) => c.isPositive).map((c) => c.hops),
+        allHops: candidates.map((c) => c.hops),
+        reciprocalRank,
+        firstRelevantRank,
+    };
+}
+/**
+ * Run the vector decay sweep experiment.
+ */
+export async function runVectorDecaySweep(options = {}) {
+    const { weightPerHopValues = WEIGHT_PER_HOP_VALUES, verbose = true, maxQueries = Infinity, } = options;
+    if (verbose) {
+        console.log('=== Vector Decay Parameter Sweep ===\n');
+    }
+    // Create variants
+    const variants = createVariants(weightPerHopValues);
+    if (verbose) {
+        console.log('Variants to test:');
+        for (const v of variants) {
+            console.log(`  ${v.id}: ${v.name}`);
+        }
+        console.log();
+    }
+    // Load edges
+    if (verbose) {
+        console.log('Loading edges with vector clocks...');
+    }
+    const allEdges = loadEdgesWithClocks();
+    const chunks = loadChunks();
+    if (verbose) {
+        console.log(`  Found ${allEdges.length} edges with vector clocks`);
+    }
+    // Group by source
+    const edgesBySource = groupEdgesBySource(allEdges);
+    if (verbose) {
+        console.log(`  ${edgesBySource.size} unique source chunks`);
+        console.log();
+    }
+    // Get all unique project slugs
+    const projectSlugs = new Set();
+    for (const chunk of chunks.values()) {
+        projectSlugs.add(chunk.sessionSlug);
+    }
+    // Pre-load reference clocks
+    const referenceClocks = new Map();
+    for (const slug of projectSlugs) {
+        referenceClocks.set(slug, getReferenceClock(slug));
+    }
+    // Group chunks by project for negative sampling
+    const projectChunks = new Map();
+    for (const chunk of chunks.values()) {
+        const existing = projectChunks.get(chunk.sessionSlug) ?? [];
+        existing.push(chunk);
+        projectChunks.set(chunk.sessionSlug, existing);
+    }
+    // Run sweep for each variant
+    const results = [];
+    for (const variant of variants) {
+        if (verbose) {
+            console.log(`Evaluating ${variant.name}...`);
+        }
+        const evaluations = [];
+        let queriesProcessed = 0;
+        for (const [sourceChunkId, edges] of edgesBySource) {
+            if (queriesProcessed >= maxQueries)
+                break;
+            const chunk = chunks.get(sourceChunkId);
+            if (!chunk)
+                continue;
+            const refClock = referenceClocks.get(chunk.sessionSlug);
+            if (!refClock)
+                continue;
+            const evaluation = evaluateQuery(sourceChunkId, edges, chunk.sessionSlug, refClock, variant.config, projectChunks);
+            if (evaluation) {
+                evaluations.push(evaluation);
+                queriesProcessed++;
+            }
+        }
+        // Calculate metrics
+        const mrr = evaluations.length > 0
+            ? evaluations.reduce((sum, e) => sum + e.reciprocalRank, 0) / evaluations.length
+            : 0;
+        // Rank distribution
+        const rankDistribution = {
+            rank1: 0,
+            rank2_5: 0,
+            rank6_10: 0,
+            rank11_plus: 0,
+        };
+        for (const e of evaluations) {
+            if (e.firstRelevantRank === 1)
+                rankDistribution.rank1++;
+            else if (e.firstRelevantRank <= 5)
+                rankDistribution.rank2_5++;
+            else if (e.firstRelevantRank <= 10)
+                rankDistribution.rank6_10++;
+            else
+                rankDistribution.rank11_plus++;
+        }
+        // Stratified by hop distance (use minimum hop from relevant edges)
+        const stratified = {
+            near: [],
+            medium: [],
+            far: [],
+        };
+        for (const e of evaluations) {
+            if (e.relevantHops.length === 0)
+                continue;
+            const minHop = Math.min(...e.relevantHops);
+            const bin = getHopBin(minHop);
+            stratified[bin].push(e);
+        }
+        const stratifiedMRR = {
+            near: stratified.near.length > 0
+                ? stratified.near.reduce((s, e) => s + e.reciprocalRank, 0) / stratified.near.length
+                : 0,
+            medium: stratified.medium.length > 0
+                ? stratified.medium.reduce((s, e) => s + e.reciprocalRank, 0) / stratified.medium.length
+                : 0,
+            far: stratified.far.length > 0
+                ? stratified.far.reduce((s, e) => s + e.reciprocalRank, 0) / stratified.far.length
+                : 0,
+        };
+        const result = {
+            variantId: variant.id,
+            variantName: variant.name,
+            weightPerHop: variant.config.weightPerHop,
+            mrr,
+            queryCount: evaluations.length,
+            rankDistribution,
+            stratifiedMRR,
+            stratifiedCounts: {
+                near: stratified.near.length,
+                medium: stratified.medium.length,
+                far: stratified.far.length,
+            },
+        };
+        results.push(result);
+        if (verbose) {
+            console.log(`  MRR: ${mrr.toFixed(3)}, Queries: ${evaluations.length}`);
+            console.log(`    Near: ${stratifiedMRR.near.toFixed(3)} (${stratified.near.length})`);
+            console.log(`    Medium: ${stratifiedMRR.medium.toFixed(3)} (${stratified.medium.length})`);
+            console.log(`    Far: ${stratifiedMRR.far.toFixed(3)} (${stratified.far.length})`);
+        }
+    }
+    // Find best variants
+    const sortedByMRR = [...results].sort((a, b) => b.mrr - a.mrr);
+    const sortedByFar = [...results].sort((a, b) => b.stratifiedMRR.far - a.stratifiedMRR.far);
+    const sweepResults = {
+        generatedAt: new Date().toISOString(),
+        edgeCount: allEdges.length,
+        edgesWithClocks: allEdges.length,
+        results,
+        bestVariantId: sortedByMRR[0]?.variantId ?? '',
+        bestFarHopVariantId: sortedByFar[0]?.variantId ?? '',
+    };
+    if (verbose) {
+        console.log('\n' + formatSweepResults(sweepResults));
+    }
+    return sweepResults;
+}
+/**
+ * Format sweep results as a table.
+ */
+export function formatSweepResults(results) {
+    const lines = [];
+    lines.push('='.repeat(90));
+    lines.push('  VECTOR DECAY PARAMETER SWEEP RESULTS');
+    lines.push('='.repeat(90));
+    lines.push('\nEdges analyzed: ' + results.edgeCount);
+    lines.push('');
+    // Header
+    const header = [
+        'Variant'.padEnd(20),
+        'Weight/Hop'.padEnd(12),
+        'MRR'.padEnd(10),
+        'Rank@1'.padEnd(10),
+        'Near MRR'.padEnd(10),
+        'Med MRR'.padEnd(10),
+        'Far MRR'.padEnd(10),
+    ].join(' | ');
+    lines.push(header);
+    lines.push('-'.repeat(90));
+    // Sort by overall MRR descending
+    const sorted = [...results.results].sort((a, b) => b.mrr - a.mrr);
+    for (const r of sorted) {
+        const row = [
+            r.variantName.padEnd(20),
+            r.weightPerHop.toFixed(2).padEnd(12),
+            r.mrr.toFixed(3).padEnd(10),
+            r.rankDistribution.rank1.toString().padEnd(10),
+            r.stratifiedMRR.near.toFixed(3).padEnd(10),
+            r.stratifiedMRR.medium.toFixed(3).padEnd(10),
+            r.stratifiedMRR.far.toFixed(3).padEnd(10),
+        ].join(' | ');
+        // Mark best overall and best far
+        let suffix = '';
+        if (r.variantId === results.bestVariantId)
+            suffix += ' *BEST*';
+        if (r.variantId === results.bestFarHopVariantId && r.variantId !== results.bestVariantId) {
+            suffix += ' *BEST-FAR*';
+        }
+        lines.push(row + suffix);
+    }
+    lines.push('='.repeat(90));
+    // Recommendations
+    lines.push('\nRecommendations:');
+    const best = sorted[0];
+    lines.push(`  Best overall: ${best.variantName} (MRR=${best.mrr.toFixed(3)})`);
+    if (results.bestFarHopVariantId !== results.bestVariantId) {
+        const bestFar = sorted.find((r) => r.variantId === results.bestFarHopVariantId);
+        if (bestFar) {
+            lines.push(`  Best for far-hop: ${bestFar.variantName} (Far MRR=${bestFar.stratifiedMRR.far.toFixed(3)})`);
+        }
+    }
+    lines.push('');
+    return lines.join('\n');
+}
+//# sourceMappingURL=run-sweep.js.map

package/dist/eval/experiments/vector-decay-sweep/run-sweep.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"run-sweep.js","sourceRoot":"","sources":["../../../../src/eval/experiments/vector-decay-sweep/run-sweep.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;GAWG;AAEH,OAAO,EAAE,KAAK,EAAE,MAAM,wBAAwB,CAAC;AAC/C,OAAO,EAAE,WAAW,EAAoB,QAAQ,EAAE,MAAM,mCAAmC,CAAC;AAC5F,OAAO,EAAE,0BAA0B,EAA0B,MAAM,2BAA2B,CAAC;AAC/F,OAAO,EAAE,iBAAiB,EAAE,MAAM,iCAAiC,CAAC;AAQpE,OAAO,EAAE,qBAAqB,EAAE,kBAAkB,EAAE,MAAM,YAAY,CAAC;AAEvE,2CAA2C;AAC3C,MAAM,qBAAqB,GAAG,EAAE,CAAC;AAEjC;;GAEG;AACH,MAAM,UAAU,cAAc,CAAC,qBAA+B,qBAAqB;IACjF,OAAO,kBAAkB,CAAC,GAAG,CAAC,CAAC,GAAG,EAAE,EAAE,CAAC,CAAC;QACtC,EAAE,EAAE,OAAO,CAAC,GAAG,GAAG,GAAG,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE;QACnC,IAAI,EAAE,cAAc,CAAC,GAAG,GAAG,GAAG,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,GAAG;QAC7C,MAAM,EAAE;YACN,YAAY,EAAE,GAAG;YACjB,SAAS,EAAE,IAAI;SAChB;KACF,CAAC,CAAC,CAAC;AACN,CAAC;AAED;;GAEG;AACH,SAAS,SAAS,CAAC,IAAY;IAC7B,IAAI,IAAI,IAAI,kBAAkB,CAAC,IAAI,CAAC,GAAG;QAAE,OAAO,MAAM,CAAC;IACvD,IAAI,IAAI,IAAI,kBAAkB,CAAC,MAAM,CAAC,GAAG;QAAE,OAAO,QAAQ,CAAC;IAC3D,OAAO,KAAK,CAAC;AACf,CAAC;AAuBD;;GAEG;AACH,SAAS,mBAAmB;IAC1B,MAAM,EAAE,GAAG,KAAK,EAAE,CAAC;IACnB,OAAO,EAAE,CAAC,OAAO,CAAC;;;;;;GAMjB,CAAC,CAAC,GAAG,EAAgB,CAAC;AACzB,CAAC;AAED;;GAEG;AACH,SAAS,UAAU;IACjB,MAAM,EAAE,GAAG,KAAK,EAAE,CAAC;IACnB,MAAM,IAAI,GAAG,EAAE,CAAC,OAAO,CAAC;;;GAGvB,CAAC,CAAC,GAAG,EAAiB,CAAC;IAExB,OAAO,IAAI,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;AAC7C,CAAC;AAED;;GAEG;AACH,SAAS,kBAAkB,CAAC,KAAiB;IAC3C,MAAM,MAAM,GAAG,IAAI,GAAG,EAAsB,CAAC;IAC7C,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;QACzB,MAAM,QAAQ,GAAG,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,aAAa,CAAC,IAAI,EAAE,CAAC;QACtD,QAAQ,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACpB,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,aAAa,EAAE,QAAQ,CAAC,CAAC;IAC3C,CAAC;IACD,OAAO,MAAM,CAAC;AAChB,CAAC;AAED;;GAEG;AACH,SAAS,oBAAoB,CAC3B,WAAmB,EACnB,eAA4B,EAC5B,KAAa,EACb,aAAuC;IAEvC,MAAM,SAAS,GAAG,aAAa,CAAC,GAAG,CAAC,WAAW,CAAC,IAAI,EAAE,CAAC;IACvD,MAAM,UAAU,GAAG,SAAS,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,eAAe,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,IAAI,CAAC,CAAC,WAAW,CAAC,CAAC;IAExF,IAAI,UAAU,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,EAAE,CAAC;IAEvC,8CAA8C;IAC9C,MAAM,QAAQ,GAAG,CAAC,GAAG,UAAU,CAAC,CAAC;IACjC,KAAK,IAAI,CAAC,GAAG,QAAQ,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;QAC7C,MAAM,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,MAAM,EAAE,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QAC9C,CAAC,QAAQ,CAAC,CAAC,CAAC,EAAE,QAAQ,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC,CAAC,EAAE,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC;IAC1D,CAAC;IAED,OAAO,QAAQ,CAAC,KAAK,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC;AAClC,CAAC;AAED;;GAEG;AACH,SAAS,aAAa,CACpB,aAAqB,EACrB,aAAyB,EACzB,WAAmB,EACnB,cAA2B,EAC3B,MAAyB,EACzB,aAAuC;IAEvC,+DAA+D;IAC/D,MAAM,aAAa,GAAG,CAAC,WAAW,EAAE,aAAa,EAAE,kBAAkB,EAAE,gBAAgB,EAAE,aAAa,CAAC,CAAC;IACxG,MAAM,aAAa,GAAG,aAAa,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,aAAa,CAAC,QAAQ,CAAC,CAAC,CAAC,aAAa,IAAI,EAAE,CAAC,CAAC,CAAC;IAEjG,IAAI,aAAa,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QAC/B,OAAO,IAAI,CAAC;IACd,CAAC;IAED,oCAAoC;IACpC,MAAM,iBAAiB,GAAG,IAAI,GAAG,CAAC,aAAa,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,aAAa,CAAC,CAAC,CAAC;IAE7E,yBAAyB;IACzB,MAAM,UAAU,GAAG,IAAI,GAAG,CAAC,CAAC,aAAa,EAAE,GAAG,iBAAiB,CAAC,CAAC,CAAC;IAClE,MAAM,cAAc,GAAG,oBAAoB,CAAC,WAAW,EAAE,UAAU,EAAE,qBAAqB,EAAE,aAAa,CAAC,CAAC;IAE3G,IAAI,cAAc,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QAChC,OAAO,IAAI,CAAC;IACd,CAAC;IAUD,MAAM,UAAU,GAAgB,EAAE,CAAC;IAEnC,oCAAoC;IACpC,KAAK,MAAM,IAAI,IAAI,aAAa,EAAE,CAAC;QACjC,IAAI,CAAC,IAAI,CAAC,WAAW;YAAE,SAAS;QAChC,MAAM,SAAS,GAAG,WAAW,CAAC,IAAI,CAAC,WAAW,CAAC,CAAC;QAChD,MAAM,IAAI,GAAG,QAAQ,CAAC,SAAS,EAAE,cAAc,CAAC,CAAC;QACjD,MAAM,MAAM,GAAG,0BAA0B,CAAC,SAAS,EAAE,cAAc,EAAE,MAAM,CAAC,CAAC;QAC7E,UAAU,CAAC,IAAI,CAAC;YACd,OAAO,EAAE,IAAI,CAAC,aAAa;YAC3B,UAAU,EAAE,IAAI;YAChB,IAAI;YACJ,MAAM;SACP,CAAC,CAAC;IACL,CAAC;IAED,uBAAuB;IACvB,KAAK,MAAM,KAAK,IAAI,cAAc,EAAE,CAAC;QACnC,IAAI,CAAC,KAAK,CAAC,WAAW;YAAE,SAAS;QACjC,MAAM,UAAU,GAAG,WAAW,CAAC,KAAK,CAAC,WAAW,CAAC,CAAC;QAClD,MAAM,IAAI,GAAG,QAAQ,CAAC,UAAU,EAAE,cAAc,CAAC,CAAC;QAClD,gEAAgE;QAChE,MAAM,MAAM,GAAG,0BAA0B,CAAC,UAAU,EAAE,cAAc,EAAE,MAAM,CAAC,CAAC;QAC9E,UAAU,CAAC,IAAI,CAAC;YACd,OAAO,EAAE,KAAK,CAAC,EAAE;YACjB,UAAU,EAAE,KAAK;YACjB,IAAI;YACJ,MAAM;SACP,CAAC,CAAC;IACL,CAAC;IAED,IAAI,UAAU,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,UAAU,CAAC,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QACxD,OAAO,IAAI,CAAC;IACd,CAAC;IAED,oDAAoD;IACpD,UAAU,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,GAAG,CAAC,CAAC,MAAM,CAAC,CAAC;IAE/C,gDAAgD;IAChD,IAAI,iBAAiB,GAAG,CAAC,CAAC;IAC1B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,UAAU,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QAC3C,IAAI,UAAU,CAAC,CAAC,CAAC,CAAC,UAAU,EAAE,CAAC;YAC7B,iBAAiB,GAAG,CAAC,GAAG,CAAC,CAAC;YAC1B,MAAM;QACR,CAAC;IACH,CAAC;IAED,MAAM,cAAc,GAAG,iBAAiB,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,iBAAiB,CAAC,CAAC,CAAC,CAAC,CAAC;IAEzE,OAAO;QACL,aAAa;QACb,WAAW;QACX,YAAY,EAAE,UAAU,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,UAAU,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC;QACvE,OAAO,EAAE,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC;QACtC,cAAc;QACd,iBAAiB;KAClB,CAAC;AACJ,CAAC;AAED;;GAEG;AACH,MAAM,CAAC,KAAK,UAAU,mBAAmB,CACvC,UAII,EAAE;IAEN,MAAM,EACJ,kBAAkB,GAAG,qBAAqB,EAC1C,OAAO,GAAG,IAAI,EACd,UAAU,GAAG,QAAQ,GACtB,GAAG,OAAO,CAAC;IAEZ,IAAI,OAAO,EAAE,CAAC;QACZ,OAAO,CAAC,GAAG,CAAC,wCAAwC,CAAC,CAAC;IACxD,CAAC;IAED,kBAAkB;IAClB,MAAM,QAAQ,GAAG,cAAc,CAAC,kBAAkB,CAAC,CAAC;IAEpD,IAAI,OAAO,EAAE,CAAC;QACZ,OAAO,CAAC,GAAG,CAAC,mBAAmB,CAAC,CAAC;QACjC,KAAK,MAAM,CAAC,IAAI,QAAQ,EAAE,CAAC;YACzB,OAAO,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC;QACtC,CAAC;QACD,OAAO,CAAC,GAAG,EAAE,CAAC;IAChB,CAAC;IAED,aAAa;IACb,IAAI,OAAO,EAAE,CAAC;QACZ,OAAO,CAAC,GAAG,CAAC,qCAAqC,CAAC,CAAC;IACrD,CAAC;IACD,MAAM,QAAQ,GAAG,mBAAmB,EAAE,CAAC;IACvC,MAAM,MAAM,GAAG,UAAU,EAAE,CAAC;IAE5B,IAAI,OAAO,EAAE,CAAC;QACZ,OAAO,CAAC,GAAG,CAAC,WAAW,QAAQ,CAAC,MAAM,2BAA2B,CAAC,CAAC;IACrE,CAAC;IAED,kBAAkB;IAClB,MAAM,aAAa,GAAG,kBAAkB,CAAC,QAAQ,CAAC,CAAC;IACnD,IAAI,OAAO,EAAE,CAAC;QACZ,OAAO,CAAC,GAAG,CAAC,KAAK,aAAa,CAAC,IAAI,uBAAuB,CAAC,CAAC;QAC5D,OAAO,CAAC,GAAG,EAAE,CAAC;IAChB,CAAC;IAED,+BAA+B;IAC/B,MAAM,YAAY,GAAG,IAAI,GAAG,EAAU,CAAC;IACvC,KAAK,MAAM,KAAK,IAAI,MAAM,CAAC,MAAM,EAAE,EAAE,CAAC;QACpC,YAAY,CAAC,GAAG,CAAC,KAAK,CAAC,WAAW,CAAC,CAAC;IACtC,CAAC;IAED,4BAA4B;IAC5B,MAAM,eAAe,GAAG,IAAI,GAAG,EAAuB,CAAC;IACvD,KAAK,MAAM,IAAI,IAAI,YAAY,EAAE,CAAC;QAChC,eAAe,CAAC,GAAG,CAAC,IAAI,EAAE,iBAAiB,CAAC,IAAI,CAAC,CAAC,CAAC;IACrD,CAAC;IAED,gDAAgD;IAChD,MAAM,aAAa,GAAG,IAAI,GAAG,EAAuB,CAAC;IACrD,KAAK,MAAM,KAAK,IAAI,MAAM,CAAC,MAAM,EAAE,EAAE,CAAC;QACpC,MAAM,QAAQ,GAAG,aAAa,CAAC,GAAG,CAAC,KAAK,CAAC,WAAW,CAAC,IAAI,EAAE,CAAC;QAC5D,QAAQ,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QACrB,aAAa,CAAC,GAAG,CAAC,KAAK,CAAC,WAAW,EAAE,QAAQ,CAAC,CAAC;IACjD,CAAC;IAED,6BAA6B;IAC7B,MAAM,OAAO,GAA6B,EAAE,CAAC;IAE7C,KAAK,MAAM,OAAO,IAAI,QAAQ,EAAE,CAAC;QAC/B,IAAI,OAAO,EAAE,CAAC;YACZ,OAAO,CAAC,GAAG,CAAC,cAAc,OAAO,CAAC,IAAI,KAAK,CAAC,CAAC;QAC/C,CAAC;QAED,MAAM,WAAW,GAA4B,EAAE,CAAC;QAChD,IAAI,gBAAgB,GAAG,CAAC,CAAC;QAEzB,KAAK,MAAM,CAAC,aAAa,EAAE,KAAK,CAAC,IAAI,aAAa,EAAE,CAAC;YACnD,IAAI,gBAAgB,IAAI,UAAU;gBAAE,MAAM;YAE1C,MAAM,KAAK,GAAG,MAAM,CAAC,GAAG,CAAC,aAAa,CAAC,CAAC;YACxC,IAAI,CAAC,KAAK;gBAAE,SAAS;YAErB,MAAM,QAAQ,GAAG,eAAe,CAAC,GAAG,CAAC,KAAK,CAAC,WAAW,CAAC,CAAC;YACxD,IAAI,CAAC,QAAQ;gBAAE,SAAS;YAExB,MAAM,UAAU,GAAG,aAAa,CAC9B,aAAa,EACb,KAAK,EACL,KAAK,CAAC,WAAW,EACjB,QAAQ,EACR,OAAO,CAAC,MAAM,EACd,aAAa,CACd,CAAC;YACF,IAAI,UAAU,EAAE,CAAC;gBACf,WAAW,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC;gBAC7B,gBAAgB,EAAE,CAAC;YACrB,CAAC;QACH,CAAC;QAED,oBAAoB;QACpB,MAAM,GAAG,GAAG,WAAW,CAAC,MAAM,GAAG,CAAC;YAChC,CAAC,CAAC,WAAW,CAAC,MAAM,CAAC,CAAC,GAAG,EAAE,CAAC,EAAE,EAAE,CAAC,GAAG,GAAG,CAAC,CAAC,cAAc,EAAE,CAAC,CAAC,GAAG,WAAW,CAAC,MAAM;YAChF,CAAC,CAAC,CAAC,CAAC;QAEN,oBAAoB;QACpB,MAAM,gBAAgB,GAAG;YACvB,KAAK,EAAE,CAAC;YACR,OAAO,EAAE,CAAC;YACV,QAAQ,EAAE,CAAC;YACX,WAAW,EAAE,CAAC;SACf,CAAC;QAEF,KAAK,MAAM,CAAC,IAAI,WAAW,EAAE,CAAC;YAC5B,IAAI,CAAC,CAAC,iBAAiB,KAAK,CAAC;gBAAE,gBAAgB,CAAC,KAAK,EAAE,CAAC;iBACnD,IAAI,CAAC,CAAC,iBAAiB,IAAI,CAAC;gBAAE,gBAAgB,CAAC,OAAO,EAAE,CAAC;iBACzD,IAAI,CAAC,CAAC,iBAAiB,IAAI,EAAE;gBAAE,gBAAgB,CAAC,QAAQ,EAAE,CAAC;;gBAC3D,gBAAgB,CAAC,WAAW,EAAE,CAAC;QACtC,CAAC;QAED,mEAAmE;QACnE,MAAM,UAAU,GAA4C;YAC1D,IAAI,EAAE,EAAE;YACR,MAAM,EAAE,EAAE;YACV,GAAG,EAAE,EAAE;SACR,CAAC;QAEF,KAAK,MAAM,CAAC,IAAI,WAAW,EAAE,CAAC;YAC5B,IAAI,CAAC,CAAC,YAAY,CAAC,MAAM,KAAK,CAAC;gBAAE,SAAS;YAC1C,MAAM,MAAM,GAAG,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,YAAY,CAAC,CAAC;YAC3C,MAAM,GAAG,GAAG,SAAS,CAAC,MAAM,CAAC,CAAC;YAC9B,UAAU,CAAC,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QAC1B,CAAC;QAED,MAAM,aAAa,GAA2B;YAC5C,IAAI,EAAE,UAAU,CAAC,IAAI,CAAC,MAAM,GAAG,CAAC;gBAC9B,CAAC,CAAC,UAAU,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,cAAc,EAAE,CAAC,CAAC,GAAG,UAAU,CAAC,IAAI,CAAC,MAAM;gBACpF,CAAC,CAAC,CAAC;YACL,MAAM,EAAE,UAAU,CAAC,MAAM,CAAC,MAAM,GAAG,CAAC;gBAClC,CAAC,CAAC,UAAU,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,cAAc,EAAE,CAAC,CAAC,GAAG,UAAU,CAAC,MAAM,CAAC,MAAM;gBACxF,CAAC,CAAC,CAAC;YACL,GAAG,EAAE,UAAU,CAAC,GAAG,CAAC,MAAM,GAAG,CAAC;gBAC5B,CAAC,CAAC,UAAU,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,cAAc,EAAE,CAAC,CAAC,GAAG,UAAU,CAAC,GAAG,CAAC,MAAM;gBAClF,CAAC,CAAC,CAAC;SACN,CAAC;QAEF,MAAM,MAAM,GAA2B;YACrC,SAAS,EAAE,OAAO,CAAC,EAAE;YACrB,WAAW,EAAE,OAAO,CAAC,IAAI;YACzB,YAAY,EAAE,OAAO,CAAC,MAAM,CAAC,YAAY;YACzC,GAAG;YACH,UAAU,EAAE,WAAW,CAAC,MAAM;YAC9B,gBAAgB;YAChB,aAAa;YACb,gBAAgB,EAAE;gBAChB,IAAI,EAAE,UAAU,CAAC,IAAI,CAAC,MAAM;gBAC5B,MAAM,EAAE,UAAU,CAAC,MAAM,CAAC,MAAM;gBAChC,GAAG,EAAE,UAAU,CAAC,GAAG,CAAC,MAAM;aAC3B;SACF,CAAC;QAEF,OAAO,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;QAErB,IAAI,OAAO,EAAE,CAAC;YACZ,OAAO,CAAC,GAAG,CAAC,UAAU,GAAG,CAAC,OAAO,CAAC,CAAC,CAAC,cAAc,WAAW,CAAC,MAAM,EAAE,CAAC,CAAC;YACxE,OAAO,CAAC,GAAG,CAAC,aAAa,aAAa,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,KAAK,UAAU,CAAC,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC;YACtF,OAAO,CAAC,GAAG,CAAC,eAAe,aAAa,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC,CAAC,KAAK,UAAU,CAAC,MAAM,CAAC,MAAM,GAAG,CAAC,CAAC;YAC5F,OAAO,CAAC,GAAG,CAAC,YAAY,aAAa,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC,CAAC,KAAK,UAAU,CAAC,GAAG,CAAC,MAAM,GAAG,CAAC,CAAC;QACrF,CAAC;IACH,CAAC;IAED,qBAAqB;IACrB,MAAM,WAAW,GAAG,CAAC,GAAG,OAAO,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,GAAG,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC;IAC/D,MAAM,WAAW,GAAG,CAAC,GAAG,OAAO,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,aAAa,CAAC,GAAG,GAAG,CAAC,CAAC,aAAa,CAAC,GAAG,CAAC,CAAC;IAE3F,MAAM,YAAY,GAA4B;QAC5C,WAAW,EAAE,IAAI,IAAI,EAAE,CAAC,WAAW,EAAE;QACrC,SAAS,EAAE,QAAQ,CAAC,MAAM;QAC1B,eAAe,EAAE,QAAQ,CAAC,MAAM;QAChC,OAAO;QACP,aAAa,EAAE,WAAW,CAAC,CAAC,CAAC,EAAE,SAAS,IAAI,EAAE;QAC9C,mBAAmB,EAAE,WAAW,CAAC,CAAC,CAAC,EAAE,SAAS,IAAI,EAAE;KACrD,CAAC;IAEF,IAAI,OAAO,EAAE,CAAC;QACZ,OAAO,CAAC,GAAG,CAAC,IAAI,GAAG,kBAAkB,CAAC,YAAY,CAAC,CAAC,CAAC;IACvD,CAAC;IAED,OAAO,YAAY,CAAC;AACtB,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,kBAAkB,CAAC,OAAgC;IACjE,MAAM,KAAK,GAAa,EAAE,CAAC;IAE3B,KAAK,CAAC,IAAI,CAAC,GAAG,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC,CAAC;IAC3B,KAAK,CAAC,IAAI,CAAC,wCAAwC,CAAC,CAAC;IACrD,KAAK,CAAC,IAAI,CAAC,GAAG,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC,CAAC;IAE3B,KAAK,CAAC,IAAI,CAAC,oBAAoB,GAAG,OAAO,CAAC,SAAS,CAAC,CAAC;IACrD,KAAK,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;IAEf,SAAS;IACT,MAAM,MAAM,GAAG;QACb,SAAS,CAAC,MAAM,CAAC,EAAE,CAAC;QACpB,YAAY,CAAC,MAAM,CAAC,EAAE,CAAC;QACvB,KAAK,CAAC,MAAM,CAAC,EAAE,CAAC;QAChB,QAAQ,CAAC,MAAM,CAAC,EAAE,CAAC;QACnB,UAAU,CAAC,MAAM,CAAC,EAAE,CAAC;QACrB,SAAS,CAAC,MAAM,CAAC,EAAE,CAAC;QACpB,SAAS,CAAC,MAAM,CAAC,EAAE,CAAC;KACrB,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;IAEd,KAAK,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;IACnB,KAAK,CAAC,IAAI,CAAC,GAAG,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC,CAAC;IAE3B,iCAAiC;IACjC,MAAM,MAAM,GAAG,CAAC,GAAG,OAAO,CAAC,OAAO,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,GAAG,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC;IAElE,KAAK,MAAM,CAAC,IAAI,MAAM,EAAE,CAAC;QACvB,MAAM,GAAG,GAAG;YACV,CAAC,CAAC,WAAW,CAAC,MAAM,CAAC,EAAE,CAAC;YACxB,CAAC,CAAC,YAAY,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,EAAE,CAAC;YACpC,CAAC,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,EAAE,CAAC;YAC3B,CAAC,CAAC,gBAAgB,CAAC,KAAK,CAAC,QAAQ,EAAE,CAAC,MAAM,CAAC,EAAE,CAAC;YAC9C,CAAC,CAAC,aAAa,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,EAAE,CAAC;YAC1C,CAAC,CAAC,aAAa,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,EAAE,CAAC;YAC5C,CAAC,CAAC,aAAa,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,EAAE,CAAC;SAC1C,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QAEd,iCAAiC;QACjC,IAAI,MAAM,GAAG,EAAE,CAAC;QAChB,IAAI,CAAC,CAAC,SAAS,KAAK,OAAO,CAAC,aAAa;YAAE,MAAM,IAAI,SAAS,CAAC;QAC/D,IAAI,CAAC,CAAC,SAAS,KAAK,OAAO,CAAC,mBAAmB,IAAI,CAAC,CAAC,SAAS,KAAK,OAAO,CAAC,aAAa,EAAE,CAAC;YACzF,MAAM,IAAI,aAAa,CAAC;QAC1B,CAAC;QAED,KAAK,CAAC,IAAI,CAAC,GAAG,GAAG,MAAM,CAAC,CAAC;IAC3B,CAAC;IAED,KAAK,CAAC,IAAI,CAAC,GAAG,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC,CAAC;IAE3B,kBAAkB;IAClB,KAAK,CAAC,IAAI,CAAC,oBAAoB,CAAC,CAAC;IACjC,MAAM,IAAI,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC;IACvB,KAAK,CAAC,IAAI,CAAC,mBAAmB,IAAI,CAAC,WAAW,SAAS,IAAI,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;IAE/E,IAAI,OAAO,CAAC,mBAAmB,KAAK,OAAO,CAAC,aAAa,EAAE,CAAC;QAC1D,MAAM,OAAO,GAAG,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,SAAS,KAAK,OAAO,CAAC,mBAAmB,CAAC,CAAC;QAChF,IAAI,OAAO,EAAE,CAAC;YACZ,KAAK,CAAC,IAAI,CAAC,uBAAuB,OAAO,CAAC,WAAW,aAAa,OAAO,CAAC,aAAa,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;QAC7G,CAAC;IACH,CAAC;IAED,KAAK,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;IAEf,OAAO,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;AAC1B,CAAC"}

package/dist/eval/experiments/vector-decay-sweep/types.d.ts

@@ -0,0 +1,109 @@
+/**
+ * Types for vector decay parameter sweep experiment.
+ */
+import type { VectorDecayConfig } from '../../../storage/decay.js';
+/**
+ * A single weight-per-hop configuration to test.
+ */
+export interface VectorDecayVariant {
+    /** Unique ID for this variant */
+    id: string;
+    /** Human-readable name */
+    name: string;
+    /** The decay configuration */
+    config: VectorDecayConfig;
+}
+/**
+ * Hop distance stratification levels.
+ */
+export type HopBin = 'near' | 'medium' | 'far';
+/**
+ * Evaluation result for a single query.
+ */
+export interface VectorQueryEvaluation {
+    /** Source chunk ID (the query) */
+    sourceChunkId: string;
+    /** Project slug */
+    projectSlug: string;
+    /** Hop counts for relevant edges */
+    relevantHops: number[];
+    /** Hop counts for all candidate edges */
+    allHops: number[];
+    /** Reciprocal rank using vector decay */
+    reciprocalRank: number;
+    /** First relevant rank */
+    firstRelevantRank: number;
+}
+/**
+ * Results for a single decay variant.
+ */
+export interface VectorDecaySweepResult {
+    /** Variant ID */
+    variantId: string;
+    /** Variant name */
+    variantName: string;
+    /** Weight per hop value */
+    weightPerHop: number;
+    /** Mean Reciprocal Rank overall */
+    mrr: number;
+    /** Number of queries evaluated */
+    queryCount: number;
+    /** Rank distribution */
+    rankDistribution: {
+        rank1: number;
+        rank2_5: number;
+        rank6_10: number;
+        rank11_plus: number;
+    };
+    /** MRR stratified by hop distance */
+    stratifiedMRR: {
+        near: number;
+        medium: number;
+        far: number;
+    };
+    /** Query count by hop bin */
+    stratifiedCounts: {
+        near: number;
+        medium: number;
+        far: number;
+    };
+}
+/**
+ * Complete sweep results.
+ */
+export interface VectorDecaySweepResults {
+    /** Timestamp when sweep was run */
+    generatedAt: string;
+    /** Total edges analyzed */
+    edgeCount: number;
+    /** Edges with vector clocks */
+    edgesWithClocks: number;
+    /** Results per variant */
+    results: VectorDecaySweepResult[];
+    /** Best variant by overall MRR */
+    bestVariantId: string;
+    /** Best variant for far-hop retrieval */
+    bestFarHopVariantId: string;
+}
+/**
+ * Default weight-per-hop values to sweep.
+ */
+export declare const WEIGHT_PER_HOP_VALUES: number[];
+/**
+ * Hop bin boundaries.
+ */
+export declare const HOP_BIN_BOUNDARIES: {
+    near: {
+        min: number;
+        max: number;
+    };
+    medium: {
+        min: number;
+        max: number;
+    };
+    far: {
+        min: number;
+        max: number;
+    };
+};
+//# sourceMappingURL=types.d.ts.map

package/dist/eval/experiments/vector-decay-sweep/types.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"types.d.ts","sourceRoot":"","sources":["../../../../src/eval/experiments/vector-decay-sweep/types.ts"],"names":[],"mappings":"AAAA;;GAEG;AAEH,OAAO,KAAK,EAAE,iBAAiB,EAAE,MAAM,2BAA2B,CAAC;AAEnE;;GAEG;AACH,MAAM,WAAW,kBAAkB;IACjC,iCAAiC;IACjC,EAAE,EAAE,MAAM,CAAC;IACX,0BAA0B;IAC1B,IAAI,EAAE,MAAM,CAAC;IACb,8BAA8B;IAC9B,MAAM,EAAE,iBAAiB,CAAC;CAC3B;AAED;;GAEG;AACH,MAAM,MAAM,MAAM,GAAG,MAAM,GAAG,QAAQ,GAAG,KAAK,CAAC;AAE/C;;GAEG;AACH,MAAM,WAAW,qBAAqB;IACpC,kCAAkC;IAClC,aAAa,EAAE,MAAM,CAAC;IACtB,mBAAmB;IACnB,WAAW,EAAE,MAAM,CAAC;IACpB,oCAAoC;IACpC,YAAY,EAAE,MAAM,EAAE,CAAC;IACvB,yCAAyC;IACzC,OAAO,EAAE,MAAM,EAAE,CAAC;IAClB,yCAAyC;IACzC,cAAc,EAAE,MAAM,CAAC;IACvB,0BAA0B;IAC1B,iBAAiB,EAAE,MAAM,CAAC;CAC3B;AAED;;GAEG;AACH,MAAM,WAAW,sBAAsB;IACrC,iBAAiB;IACjB,SAAS,EAAE,MAAM,CAAC;IAClB,mBAAmB;IACnB,WAAW,EAAE,MAAM,CAAC;IACpB,2BAA2B;IAC3B,YAAY,EAAE,MAAM,CAAC;IACrB,mCAAmC;IACnC,GAAG,EAAE,MAAM,CAAC;IACZ,kCAAkC;IAClC,UAAU,EAAE,MAAM,CAAC;IACnB,wBAAwB;IACxB,gBAAgB,EAAE;QAChB,KAAK,EAAE,MAAM,CAAC;QACd,OAAO,EAAE,MAAM,CAAC;QAChB,QAAQ,EAAE,MAAM,CAAC;QACjB,WAAW,EAAE,MAAM,CAAC;KACrB,CAAC;IACF,qCAAqC;IACrC,aAAa,EAAE;QACb,IAAI,EAAE,MAAM,CAAC;QACb,MAAM,EAAE,MAAM,CAAC;QACf,GAAG,EAAE,MAAM,CAAC;KACb,CAAC;IACF,6BAA6B;IAC7B,gBAAgB,EAAE;QAChB,IAAI,EAAE,MAAM,CAAC;QACb,MAAM,EAAE,MAAM,CAAC;QACf,GAAG,EAAE,MAAM,CAAC;KACb,CAAC;CACH;AAED;;GAEG;AACH,MAAM,WAAW,uBAAuB;IACtC,mCAAmC;IACnC,WAAW,EAAE,MAAM,CAAC;IACpB,2BAA2B;IAC3B,SAAS,EAAE,MAAM,CAAC;IAClB,+BAA+B;IAC/B,eAAe,EAAE,MAAM,CAAC;IACxB,0BAA0B;IAC1B,OAAO,EAAE,sBAAsB,EAAE,CAAC;IAClC,kCAAkC;IAClC,aAAa,EAAE,MAAM,CAAC;IACtB,yCAAyC;IACzC,mBAAmB,EAAE,MAAM,CAAC;CAC7B;AAED;;GAEG;AACH,eAAO,MAAM,qBAAqB,UAA2B,CAAC;AAE9D;;GAEG;AACH,eAAO,MAAM,kBAAkB;;;;;;;;;;;;;CAI9B,CAAC"}

package/dist/eval/experiments/vector-decay-sweep/types.js

@@ -0,0 +1,16 @@
+/**
+ * Types for vector decay parameter sweep experiment.
+ */
+/**
+ * Default weight-per-hop values to sweep.
+ */
+export const WEIGHT_PER_HOP_VALUES = [0.80, 0.85, 0.90, 0.95];
+/**
+ * Hop bin boundaries.
+ */
+export const HOP_BIN_BOUNDARIES = {
+    near: { min: 1, max: 3 },
+    medium: { min: 4, max: 7 },
+    far: { min: 8, max: Infinity },
+};
+//# sourceMappingURL=types.js.map

package/dist/eval/experiments/vector-decay-sweep/types.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"types.js","sourceRoot":"","sources":["../../../../src/eval/experiments/vector-decay-sweep/types.ts"],"names":[],"mappings":"AAAA;;GAEG;AA4FH;;GAEG;AACH,MAAM,CAAC,MAAM,qBAAqB,GAAG,CAAC,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,CAAC,CAAC;AAE9D;;GAEG;AACH,MAAM,CAAC,MAAM,kBAAkB,GAAG;IAChC,IAAI,EAAE,EAAE,GAAG,EAAE,CAAC,EAAE,GAAG,EAAE,CAAC,EAAE;IACxB,MAAM,EAAE,EAAE,GAAG,EAAE,CAAC,EAAE,GAAG,EAAE,CAAC,EAAE;IAC1B,GAAG,EAAE,EAAE,GAAG,EAAE,CAAC,EAAE,GAAG,EAAE,QAAQ,EAAE;CAC/B,CAAC"}

package/dist/eval/metrics.d.ts

@@ -0,0 +1,45 @@
+/**
+ * Evaluation metrics for embedding quality.
+ *
+ * - ROC AUC from labeled pairs scored by angular distance
+ * - Silhouette score for cluster quality
+ */
+import type { LabeledPair } from './annotation-schema.js';
+export interface ScoredPair {
+    pair: LabeledPair;
+    distance: number;
+}
+/**
+ * Score all labeled pairs by angular distance between their embeddings.
+ */
+export declare function scorePairs(pairs: LabeledPair[], embeddings: Map<string, number[]>): ScoredPair[];
+/**
+ * Compute ROC AUC for binary classification.
+ *
+ * Positive class: 'related' or 'code-nl-pair' (should have low distance)
+ * Negative class: 'unrelated' (should have high distance)
+ *
+ * We use distance as the score, so lower distance = more likely positive.
+ * For AUC calculation we invert: score = 1 - distance.
+ */
+export declare function rocAuc(scoredPairs: ScoredPair[]): number;
+/**
+ * Compute silhouette score for a clustering.
+ *
+ * For each point:
+ *   a(i) = mean distance to other points in same cluster
+ *   b(i) = min over clusters C != own: mean distance to points in C
+ *   s(i) = (b(i) - a(i)) / max(a(i), b(i))
+ *
+ * Returns mean silhouette across all clustered points. Range [-1, 1].
+ */
+export declare function silhouetteScore(embeddings: number[][], labels: number[]): number;
+/**
+ * Compute the noise ratio (proportion of unclustered points).
+ */
+export declare function noiseRatio(labels: number[]): number;
+/**
+ * Count the number of unique clusters (excluding noise).
+ */
+export declare function clusterCount(labels: number[]): number;
+//# sourceMappingURL=metrics.d.ts.map

package/dist/eval/metrics.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"metrics.d.ts","sourceRoot":"","sources":["../../src/eval/metrics.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;AAGH,OAAO,KAAK,EAAE,WAAW,EAAE,MAAM,wBAAwB,CAAC;AAE1D,MAAM,WAAW,UAAU;IACzB,IAAI,EAAE,WAAW,CAAC;IAClB,QAAQ,EAAE,MAAM,CAAC;CAClB;AAED;;GAEG;AACH,wBAAgB,UAAU,CACxB,KAAK,EAAE,WAAW,EAAE,EACpB,UAAU,EAAE,GAAG,CAAC,MAAM,EAAE,MAAM,EAAE,CAAC,GAChC,UAAU,EAAE,CAYd;AAED;;;;;;;;GAQG;AACH,wBAAgB,MAAM,CAAC,WAAW,EAAE,UAAU,EAAE,GAAG,MAAM,CA2BxD;AAED;;;;;;;;;GASG;AACH,wBAAgB,eAAe,CAC7B,UAAU,EAAE,MAAM,EAAE,EAAE,EACtB,MAAM,EAAE,MAAM,EAAE,GACf,MAAM,CA0DR;AAED;;GAEG;AACH,wBAAgB,UAAU,CAAC,MAAM,EAAE,MAAM,EAAE,GAAG,MAAM,CAInD;AAED;;GAEG;AACH,wBAAgB,YAAY,CAAC,MAAM,EAAE,MAAM,EAAE,GAAG,MAAM,CAErD"}