glancey 2.0.0

package/dist/search/chunk-utils.d.ts

@@ -0,0 +1,24 @@
+/**
+ * Shared utilities for code chunking.
+ */
+/**
+ * Base interface for code chunks.
+ * Both ASTChunk and TreeSitterChunk share this structure.
+ */
+export interface BaseChunk {
+    content: string;
+    startLine: number;
+    endLine: number;
+    type: 'function' | 'class' | 'method' | 'interface' | 'type' | 'variable' | 'import' | 'other';
+    name?: string;
+}
+/**
+ * Split a large chunk into smaller pieces.
+ *
+ * @param chunk - The chunk to split
+ * @param maxLines - Maximum lines per chunk
+ * @param minLines - Minimum lines for a chunk (avoid tiny fragments)
+ * @returns Array of smaller chunks
+ */
+export declare function splitLargeChunk<T extends BaseChunk>(chunk: T, maxLines: number, minLines: number): T[];
+//# sourceMappingURL=chunk-utils.d.ts.map

package/dist/search/chunk-utils.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"chunk-utils.d.ts","sourceRoot":"","sources":["../../src/search/chunk-utils.ts"],"names":[],"mappings":"AAAA;;GAEG;AAEH;;;GAGG;AACH,MAAM,WAAW,SAAS;IACxB,OAAO,EAAE,MAAM,CAAC;IAChB,SAAS,EAAE,MAAM,CAAC;IAClB,OAAO,EAAE,MAAM,CAAC;IAChB,IAAI,EAAE,UAAU,GAAG,OAAO,GAAG,QAAQ,GAAG,WAAW,GAAG,MAAM,GAAG,UAAU,GAAG,QAAQ,GAAG,OAAO,CAAC;IAC/F,IAAI,CAAC,EAAE,MAAM,CAAC;CACf;AAED;;;;;;;GAOG;AACH,wBAAgB,eAAe,CAAC,CAAC,SAAS,SAAS,EACjD,KAAK,EAAE,CAAC,EACR,QAAQ,EAAE,MAAM,EAChB,QAAQ,EAAE,MAAM,GACf,CAAC,EAAE,CA+BL"}

package/dist/search/chunk-utils.js

@@ -0,0 +1,41 @@
+/**
+ * Shared utilities for code chunking.
+ */
+/**
+ * Split a large chunk into smaller pieces.
+ *
+ * @param chunk - The chunk to split
+ * @param maxLines - Maximum lines per chunk
+ * @param minLines - Minimum lines for a chunk (avoid tiny fragments)
+ * @returns Array of smaller chunks
+ */
+export function splitLargeChunk(chunk, maxLines, minLines) {
+    const chunkLines = chunk.content.split('\n');
+    const totalLines = chunkLines.length;
+    const chunks = [];
+    // Split into roughly equal parts, each under maxLines
+    const numParts = Math.ceil(totalLines / maxLines);
+    const linesPerPart = Math.ceil(totalLines / numParts);
+    for (let i = 0; i < numParts; i++) {
+        const startIdx = i * linesPerPart;
+        const endIdx = Math.min((i + 1) * linesPerPart, totalLines);
+        const partLines = chunkLines.slice(startIdx, endIdx);
+        if (partLines.length < minLines && chunks.length > 0) {
+            // Merge with previous chunk if too small
+            const lastChunk = chunks[chunks.length - 1];
+            lastChunk.content += '\n' + partLines.join('\n');
+            lastChunk.endLine = chunk.startLine + endIdx - 1;
+        }
+        else {
+            chunks.push({
+                ...chunk,
+                content: partLines.join('\n'),
+                startLine: chunk.startLine + startIdx,
+                endLine: chunk.startLine + endIdx - 1,
+                name: chunk.name ? `${chunk.name} (part ${i + 1})` : undefined,
+            });
+        }
+    }
+    return chunks;
+}
+//# sourceMappingURL=chunk-utils.js.map

package/dist/search/chunk-utils.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"chunk-utils.js","sourceRoot":"","sources":["../../src/search/chunk-utils.ts"],"names":[],"mappings":"AAAA;;GAEG;AAcH;;;;;;;GAOG;AACH,MAAM,UAAU,eAAe,CAC7B,KAAQ,EACR,QAAgB,EAChB,QAAgB;IAEhB,MAAM,UAAU,GAAG,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC;IAC7C,MAAM,UAAU,GAAG,UAAU,CAAC,MAAM,CAAC;IACrC,MAAM,MAAM,GAAQ,EAAE,CAAC;IAEvB,sDAAsD;IACtD,MAAM,QAAQ,GAAG,IAAI,CAAC,IAAI,CAAC,UAAU,GAAG,QAAQ,CAAC,CAAC;IAClD,MAAM,YAAY,GAAG,IAAI,CAAC,IAAI,CAAC,UAAU,GAAG,QAAQ,CAAC,CAAC;IAEtD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,QAAQ,EAAE,CAAC,EAAE,EAAE,CAAC;QAClC,MAAM,QAAQ,GAAG,CAAC,GAAG,YAAY,CAAC;QAClC,MAAM,MAAM,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,YAAY,EAAE,UAAU,CAAC,CAAC;QAC5D,MAAM,SAAS,GAAG,UAAU,CAAC,KAAK,CAAC,QAAQ,EAAE,MAAM,CAAC,CAAC;QAErD,IAAI,SAAS,CAAC,MAAM,GAAG,QAAQ,IAAI,MAAM,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YACrD,yCAAyC;YACzC,MAAM,SAAS,GAAG,MAAM,CAAC,MAAM,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;YAC5C,SAAS,CAAC,OAAO,IAAI,IAAI,GAAG,SAAS,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YACjD,SAAS,CAAC,OAAO,GAAG,KAAK,CAAC,SAAS,GAAG,MAAM,GAAG,CAAC,CAAC;QACnD,CAAC;aAAM,CAAC;YACN,MAAM,CAAC,IAAI,CAAC;gBACV,GAAG,KAAK;gBACR,OAAO,EAAE,SAAS,CAAC,IAAI,CAAC,IAAI,CAAC;gBAC7B,SAAS,EAAE,KAAK,CAAC,SAAS,GAAG,QAAQ;gBACrC,OAAO,EAAE,KAAK,CAAC,SAAS,GAAG,MAAM,GAAG,CAAC;gBACrC,IAAI,EAAE,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,GAAG,KAAK,CAAC,IAAI,UAAU,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,SAAS;aAC1D,CAAC,CAAC;QACV,CAAC;IACH,CAAC;IAED,OAAO,MAAM,CAAC;AAChB,CAAC"}

package/dist/search/clustering.d.ts

@@ -0,0 +1,77 @@
+/**
+ * K-means clustering for semantic code grouping.
+ * Groups code chunks by similarity to discover concept areas in the codebase.
+ */
+/**
+ * Represents a discovered concept cluster
+ */
+export interface ConceptCluster {
+    /** Unique cluster identifier (0-indexed) */
+    id: number;
+    /** Human-readable label derived from representative chunks */
+    label: string;
+    /** Number of code chunks in this cluster */
+    size: number;
+    /** Representative chunk IDs for this cluster */
+    representativeChunks: string[];
+    /** Centroid vector for this cluster */
+    centroid: number[];
+    /** Keywords extracted from representative chunks */
+    keywords: string[];
+}
+/**
+ * Result of clustering operation
+ */
+export interface ClusteringResult {
+    /** Total number of clusters created */
+    clusterCount: number;
+    /** All discovered concept clusters */
+    clusters: ConceptCluster[];
+    /** Mapping from chunk ID to cluster ID */
+    assignments: Map<string, number>;
+}
+/**
+ * Options for clustering operation
+ */
+export interface ClusteringOptions {
+    /** Target number of clusters (default: auto-determined based on chunk count) */
+    numClusters?: number;
+    /** Maximum iterations for k-means (default: 100) */
+    maxIterations?: number;
+    /** Convergence threshold (default: 0.001) */
+    convergenceThreshold?: number;
+    /** Number of representative chunks to store per cluster (default: 3) */
+    numRepresentatives?: number;
+}
+/**
+ * Chunk data needed for clustering
+ */
+export interface ChunkForClustering {
+    id: string;
+    content: string;
+    filepath: string;
+    embedding: number[];
+    symbolName?: string;
+    symbolType?: string;
+}
+/**
+ * Calculate cosine similarity between two vectors
+ */
+export declare function cosineSimilarity(a: number[], b: number[]): number;
+/**
+ * Calculate Euclidean distance between two vectors
+ */
+export declare function euclideanDistance(a: number[], b: number[]): number;
+/**
+ * Perform k-means clustering on embeddings
+ */
+export declare function kMeansClustering(chunks: ChunkForClustering[], options?: ClusteringOptions): ClusteringResult;
+/**
+ * Find the cluster ID for a given embedding (nearest centroid)
+ */
+export declare function assignToCluster(embedding: number[], clusters: ConceptCluster[]): number;
+/**
+ * Calculate silhouette score for clustering quality assessment
+ */
+export declare function calculateSilhouetteScore(chunks: ChunkForClustering[], assignments: Map<string, number>, clusters: ConceptCluster[]): number;
+//# sourceMappingURL=clustering.d.ts.map

package/dist/search/clustering.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"clustering.d.ts","sourceRoot":"","sources":["../../src/search/clustering.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAEH;;GAEG;AACH,MAAM,WAAW,cAAc;IAC7B,4CAA4C;IAC5C,EAAE,EAAE,MAAM,CAAC;IACX,8DAA8D;IAC9D,KAAK,EAAE,MAAM,CAAC;IACd,4CAA4C;IAC5C,IAAI,EAAE,MAAM,CAAC;IACb,gDAAgD;IAChD,oBAAoB,EAAE,MAAM,EAAE,CAAC;IAC/B,uCAAuC;IACvC,QAAQ,EAAE,MAAM,EAAE,CAAC;IACnB,oDAAoD;IACpD,QAAQ,EAAE,MAAM,EAAE,CAAC;CACpB;AAED;;GAEG;AACH,MAAM,WAAW,gBAAgB;IAC/B,uCAAuC;IACvC,YAAY,EAAE,MAAM,CAAC;IACrB,sCAAsC;IACtC,QAAQ,EAAE,cAAc,EAAE,CAAC;IAC3B,0CAA0C;IAC1C,WAAW,EAAE,GAAG,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;CAClC;AAED;;GAEG;AACH,MAAM,WAAW,iBAAiB;IAChC,gFAAgF;IAChF,WAAW,CAAC,EAAE,MAAM,CAAC;IACrB,oDAAoD;IACpD,aAAa,CAAC,EAAE,MAAM,CAAC;IACvB,6CAA6C;IAC7C,oBAAoB,CAAC,EAAE,MAAM,CAAC;IAC9B,wEAAwE;IACxE,kBAAkB,CAAC,EAAE,MAAM,CAAC;CAC7B;AAED;;GAEG;AACH,MAAM,WAAW,kBAAkB;IACjC,EAAE,EAAE,MAAM,CAAC;IACX,OAAO,EAAE,MAAM,CAAC;IAChB,QAAQ,EAAE,MAAM,CAAC;IACjB,SAAS,EAAE,MAAM,EAAE,CAAC;IACpB,UAAU,CAAC,EAAE,MAAM,CAAC;IACpB,UAAU,CAAC,EAAE,MAAM,CAAC;CACrB;AAED;;GAEG;AACH,wBAAgB,gBAAgB,CAAC,CAAC,EAAE,MAAM,EAAE,EAAE,CAAC,EAAE,MAAM,EAAE,GAAG,MAAM,CAuBjE;AAED;;GAEG;AACH,wBAAgB,iBAAiB,CAAC,CAAC,EAAE,MAAM,EAAE,EAAE,CAAC,EAAE,MAAM,EAAE,GAAG,MAAM,CAYlE;AAwED;;GAEG;AACH,wBAAgB,gBAAgB,CAC9B,MAAM,EAAE,kBAAkB,EAAE,EAC5B,OAAO,GAAE,iBAAsB,GAC9B,gBAAgB,CAqLlB;AA4JD;;GAEG;AACH,wBAAgB,eAAe,CAAC,SAAS,EAAE,MAAM,EAAE,EAAE,QAAQ,EAAE,cAAc,EAAE,GAAG,MAAM,CAavF;AAED;;GAEG;AACH,wBAAgB,wBAAwB,CACtC,MAAM,EAAE,kBAAkB,EAAE,EAC5B,WAAW,EAAE,GAAG,CAAC,MAAM,EAAE,MAAM,CAAC,EAChC,QAAQ,EAAE,cAAc,EAAE,GACzB,MAAM,CA6DR"}

package/dist/search/clustering.js

@@ -0,0 +1,455 @@
+/**
+ * K-means clustering for semantic code grouping.
+ * Groups code chunks by similarity to discover concept areas in the codebase.
+ */
+/**
+ * Calculate cosine similarity between two vectors
+ */
+export function cosineSimilarity(a, b) {
+    if (a.length !== b.length) {
+        throw new Error('Vectors must have same length');
+    }
+    let dotProduct = 0;
+    let normA = 0;
+    let normB = 0;
+    for (let i = 0; i < a.length; i++) {
+        dotProduct += a[i] * b[i];
+        normA += a[i] * a[i];
+        normB += b[i] * b[i];
+    }
+    normA = Math.sqrt(normA);
+    normB = Math.sqrt(normB);
+    if (normA === 0 || normB === 0) {
+        return 0;
+    }
+    return dotProduct / (normA * normB);
+}
+/**
+ * Calculate Euclidean distance between two vectors
+ */
+export function euclideanDistance(a, b) {
+    if (a.length !== b.length) {
+        throw new Error('Vectors must have same length');
+    }
+    let sum = 0;
+    for (let i = 0; i < a.length; i++) {
+        const diff = a[i] - b[i];
+        sum += diff * diff;
+    }
+    return Math.sqrt(sum);
+}
+/**
+ * Calculate centroid (mean) of a set of vectors
+ */
+function calculateCentroid(vectors) {
+    if (vectors.length === 0) {
+        throw new Error('Cannot calculate centroid of empty set');
+    }
+    const dimensions = vectors[0].length;
+    const centroid = new Array(dimensions).fill(0);
+    for (const vec of vectors) {
+        for (let i = 0; i < dimensions; i++) {
+            centroid[i] += vec[i];
+        }
+    }
+    for (let i = 0; i < dimensions; i++) {
+        centroid[i] /= vectors.length;
+    }
+    return centroid;
+}
+/**
+ * Initialize centroids using k-means++ algorithm for better initial placement
+ */
+function initializeCentroidsKMeansPP(embeddings, k) {
+    const centroids = [];
+    const n = embeddings.length;
+    // Pick first centroid randomly
+    const firstIdx = Math.floor(Math.random() * n);
+    centroids.push([...embeddings[firstIdx]]);
+    // Pick remaining centroids with probability proportional to squared distance
+    for (let c = 1; c < k; c++) {
+        const distances = [];
+        let totalDist = 0;
+        for (let i = 0; i < n; i++) {
+            // Find minimum distance to existing centroids
+            let minDist = Infinity;
+            for (const centroid of centroids) {
+                const dist = euclideanDistance(embeddings[i], centroid);
+                if (dist < minDist) {
+                    minDist = dist;
+                }
+            }
+            distances.push(minDist * minDist); // Square the distance
+            totalDist += minDist * minDist;
+        }
+        // Weighted random selection
+        let rand = Math.random() * totalDist;
+        let selectedIdx = 0;
+        for (let i = 0; i < n; i++) {
+            rand -= distances[i];
+            if (rand <= 0) {
+                selectedIdx = i;
+                break;
+            }
+        }
+        centroids.push([...embeddings[selectedIdx]]);
+    }
+    return centroids;
+}
+/**
+ * Perform k-means clustering on embeddings
+ */
+export function kMeansClustering(chunks, options = {}) {
+    const { numClusters = Math.max(3, Math.min(20, Math.ceil(Math.sqrt(chunks.length / 2)))), maxIterations = 100, convergenceThreshold = 0.001, numRepresentatives = 3, } = options;
+    if (chunks.length === 0) {
+        return {
+            clusterCount: 0,
+            clusters: [],
+            assignments: new Map(),
+        };
+    }
+    // Handle edge case where we have fewer chunks than requested clusters
+    const k = Math.min(numClusters, chunks.length);
+    if (k <= 1) {
+        // Single cluster case
+        const allEmbeddings = chunks.map((c) => c.embedding);
+        const centroid = calculateCentroid(allEmbeddings);
+        const assignments = new Map();
+        for (const chunk of chunks) {
+            assignments.set(chunk.id, 0);
+        }
+        return {
+            clusterCount: 1,
+            clusters: [
+                {
+                    id: 0,
+                    label: generateClusterLabel(chunks, chunks.slice(0, numRepresentatives)),
+                    size: chunks.length,
+                    representativeChunks: chunks.slice(0, numRepresentatives).map((c) => c.id),
+                    centroid,
+                    keywords: extractKeywords(chunks),
+                },
+            ],
+            assignments,
+        };
+    }
+    const embeddings = chunks.map((c) => c.embedding);
+    // Initialize centroids using k-means++
+    let centroids = initializeCentroidsKMeansPP(embeddings, k);
+    // Assignments array: index = chunk index, value = cluster index
+    let clusterAssignments = new Array(chunks.length).fill(0);
+    for (let iteration = 0; iteration < maxIterations; iteration++) {
+        // Assignment step: assign each point to nearest centroid
+        const newAssignments = new Array(chunks.length).fill(0);
+        for (let i = 0; i < chunks.length; i++) {
+            let minDist = Infinity;
+            let nearestCluster = 0;
+            for (let c = 0; c < k; c++) {
+                const dist = euclideanDistance(embeddings[i], centroids[c]);
+                if (dist < minDist) {
+                    minDist = dist;
+                    nearestCluster = c;
+                }
+            }
+            newAssignments[i] = nearestCluster;
+        }
+        // Check for convergence
+        let changed = false;
+        for (let i = 0; i < chunks.length; i++) {
+            if (newAssignments[i] !== clusterAssignments[i]) {
+                changed = true;
+                break;
+            }
+        }
+        clusterAssignments = newAssignments;
+        if (!changed) {
+            break;
+        }
+        // Update step: recalculate centroids
+        const newCentroids = [];
+        let maxShift = 0;
+        for (let c = 0; c < k; c++) {
+            const clusterVectors = [];
+            for (let i = 0; i < chunks.length; i++) {
+                if (clusterAssignments[i] === c) {
+                    clusterVectors.push(embeddings[i]);
+                }
+            }
+            if (clusterVectors.length > 0) {
+                const newCentroid = calculateCentroid(clusterVectors);
+                const shift = euclideanDistance(centroids[c], newCentroid);
+                maxShift = Math.max(maxShift, shift);
+                newCentroids.push(newCentroid);
+            }
+            else {
+                // Empty cluster - reinitialize with random point
+                const randomIdx = Math.floor(Math.random() * chunks.length);
+                newCentroids.push([...embeddings[randomIdx]]);
+            }
+        }
+        centroids = newCentroids;
+        // Check for convergence based on centroid shift
+        if (maxShift < convergenceThreshold) {
+            break;
+        }
+    }
+    // Build cluster results
+    const clusterChunks = Array(k)
+        .fill(null)
+        .map(() => []);
+    for (let i = 0; i < chunks.length; i++) {
+        clusterChunks[clusterAssignments[i]].push(chunks[i]);
+    }
+    const assignments = new Map();
+    for (let i = 0; i < chunks.length; i++) {
+        assignments.set(chunks[i].id, clusterAssignments[i]);
+    }
+    // Create cluster objects with labels and representatives
+    const clusters = [];
+    for (let c = 0; c < k; c++) {
+        const chunksInCluster = clusterChunks[c];
+        if (chunksInCluster.length === 0)
+            continue;
+        // Find representative chunks (closest to centroid)
+        const sortedByDistance = [...chunksInCluster].sort((a, b) => {
+            const distA = euclideanDistance(a.embedding, centroids[c]);
+            const distB = euclideanDistance(b.embedding, centroids[c]);
+            return distA - distB;
+        });
+        const representatives = sortedByDistance.slice(0, numRepresentatives);
+        const label = generateClusterLabel(chunksInCluster, representatives);
+        const keywords = extractKeywords(chunksInCluster);
+        clusters.push({
+            id: c,
+            label,
+            size: chunksInCluster.length,
+            representativeChunks: representatives.map((r) => r.id),
+            centroid: centroids[c],
+            keywords,
+        });
+    }
+    // Sort clusters by size (largest first)
+    clusters.sort((a, b) => b.size - a.size);
+    // Renumber cluster IDs after sorting
+    const idMapping = new Map();
+    clusters.forEach((cluster, newId) => {
+        idMapping.set(cluster.id, newId);
+        cluster.id = newId;
+    });
+    // Update assignments with new IDs
+    for (const [chunkId, oldClusterId] of assignments) {
+        const newClusterId = idMapping.get(oldClusterId);
+        if (newClusterId !== undefined) {
+            assignments.set(chunkId, newClusterId);
+        }
+    }
+    return {
+        clusterCount: clusters.length,
+        clusters,
+        assignments,
+    };
+}
+/**
+ * Generate a human-readable label for a cluster based on its contents
+ */
+function generateClusterLabel(allChunks, representatives) {
+    // Try to derive label from symbol types and file paths
+    const symbolTypes = new Map();
+    const dirPaths = new Map();
+    for (const chunk of allChunks) {
+        if (chunk.symbolType) {
+            symbolTypes.set(chunk.symbolType, (symbolTypes.get(chunk.symbolType) || 0) + 1);
+        }
+        // Extract directory from filepath
+        const parts = chunk.filepath.split('/');
+        if (parts.length > 1) {
+            const dir = parts.slice(0, -1).join('/');
+            dirPaths.set(dir, (dirPaths.get(dir) || 0) + 1);
+        }
+    }
+    // Find dominant symbol type
+    let dominantType = '';
+    let maxTypeCount = 0;
+    for (const [type, count] of symbolTypes) {
+        if (count > maxTypeCount) {
+            maxTypeCount = count;
+            dominantType = type;
+        }
+    }
+    // Find dominant directory
+    let dominantDir = '';
+    let maxDirCount = 0;
+    for (const [dir, count] of dirPaths) {
+        if (count > maxDirCount) {
+            maxDirCount = count;
+            dominantDir = dir;
+        }
+    }
+    // Build label
+    const parts = [];
+    if (dominantDir) {
+        // Use last directory component
+        const dirParts = dominantDir.split('/');
+        parts.push(dirParts[dirParts.length - 1]);
+    }
+    if (dominantType) {
+        parts.push(`${dominantType}s`);
+    }
+    if (parts.length === 0) {
+        // Fallback: use keywords from representatives
+        const keywords = extractKeywords(representatives);
+        if (keywords.length > 0) {
+            return keywords.slice(0, 2).join(' & ');
+        }
+        return 'Code';
+    }
+    return parts.join(' ');
+}
+/**
+ * Extract keywords from chunk contents for labeling
+ */
+function extractKeywords(chunks) {
+    const wordFreq = new Map();
+    // Common words to exclude
+    const stopWords = new Set([
+        'function',
+        'const',
+        'let',
+        'var',
+        'return',
+        'if',
+        'else',
+        'for',
+        'while',
+        'import',
+        'export',
+        'from',
+        'class',
+        'interface',
+        'type',
+        'async',
+        'await',
+        'new',
+        'this',
+        'true',
+        'false',
+        'null',
+        'undefined',
+        'public',
+        'private',
+        'static',
+        'void',
+        'string',
+        'number',
+        'boolean',
+        'any',
+        'def',
+        'self',
+        'none',
+        'pass',
+        'try',
+        'except',
+        'catch',
+        'throw',
+        'throws',
+        'extends',
+        'implements',
+        'default',
+        'case',
+        'break',
+        'continue',
+    ]);
+    for (const chunk of chunks) {
+        // Extract identifier-like words
+        const words = chunk.content.match(/[a-zA-Z][a-zA-Z0-9_]*[a-zA-Z0-9]/g) || [];
+        for (const word of words) {
+            const lower = word.toLowerCase();
+            if (lower.length >= 4 && !stopWords.has(lower)) {
+                wordFreq.set(lower, (wordFreq.get(lower) || 0) + 1);
+            }
+        }
+        // Add symbol name with higher weight
+        if (chunk.symbolName) {
+            const symbolWords = chunk.symbolName.match(/[A-Z]?[a-z]+/g) || [];
+            for (const word of symbolWords) {
+                const lower = word.toLowerCase();
+                if (lower.length >= 4 && !stopWords.has(lower)) {
+                    wordFreq.set(lower, (wordFreq.get(lower) || 0) + 3);
+                }
+            }
+        }
+    }
+    // Sort by frequency and return top keywords
+    const sorted = [...wordFreq.entries()].sort((a, b) => b[1] - a[1]);
+    return sorted.slice(0, 10).map(([word]) => word);
+}
+/**
+ * Find the cluster ID for a given embedding (nearest centroid)
+ */
+export function assignToCluster(embedding, clusters) {
+    let minDist = Infinity;
+    let nearestCluster = 0;
+    for (const cluster of clusters) {
+        const dist = euclideanDistance(embedding, cluster.centroid);
+        if (dist < minDist) {
+            minDist = dist;
+            nearestCluster = cluster.id;
+        }
+    }
+    return nearestCluster;
+}
+/**
+ * Calculate silhouette score for clustering quality assessment
+ */
+export function calculateSilhouetteScore(chunks, assignments, clusters) {
+    if (clusters.length <= 1 || chunks.length <= 1) {
+        return 0;
+    }
+    let totalScore = 0;
+    let count = 0;
+    for (const chunk of chunks) {
+        const clusterId = assignments.get(chunk.id);
+        if (clusterId === undefined)
+            continue;
+        // Calculate a(i): average distance to other points in same cluster
+        let intraClusterDist = 0;
+        let intraCount = 0;
+        for (const other of chunks) {
+            if (other.id === chunk.id)
+                continue;
+            if (assignments.get(other.id) === clusterId) {
+                intraClusterDist += euclideanDistance(chunk.embedding, other.embedding);
+                intraCount++;
+            }
+        }
+        const a = intraCount > 0 ? intraClusterDist / intraCount : 0;
+        // Calculate b(i): minimum average distance to points in other clusters
+        let minInterClusterDist = Infinity;
+        for (const otherCluster of clusters) {
+            if (otherCluster.id === clusterId)
+                continue;
+            let interDist = 0;
+            let interCount = 0;
+            for (const other of chunks) {
+                if (assignments.get(other.id) === otherCluster.id) {
+                    interDist += euclideanDistance(chunk.embedding, other.embedding);
+                    interCount++;
+                }
+            }
+            if (interCount > 0) {
+                const avgDist = interDist / interCount;
+                if (avgDist < minInterClusterDist) {
+                    minInterClusterDist = avgDist;
+                }
+            }
+        }
+        const b = minInterClusterDist === Infinity ? 0 : minInterClusterDist;
+        // Silhouette coefficient for this point
+        const maxAB = Math.max(a, b);
+        const s = maxAB > 0 ? (b - a) / maxAB : 0;
+        totalScore += s;
+        count++;
+    }
+    return count > 0 ? totalScore / count : 0;
+}
+//# sourceMappingURL=clustering.js.map

package/dist/search/clustering.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"clustering.js","sourceRoot":"","sources":["../../src/search/clustering.ts"],"names":[],"mappings":"AAAA;;;GAGG;AA0DH;;GAEG;AACH,MAAM,UAAU,gBAAgB,CAAC,CAAW,EAAE,CAAW;IACvD,IAAI,CAAC,CAAC,MAAM,KAAK,CAAC,CAAC,MAAM,EAAE,CAAC;QAC1B,MAAM,IAAI,KAAK,CAAC,+BAA+B,CAAC,CAAC;IACnD,CAAC;IAED,IAAI,UAAU,GAAG,CAAC,CAAC;IACnB,IAAI,KAAK,GAAG,CAAC,CAAC;IACd,IAAI,KAAK,GAAG,CAAC,CAAC;IAEd,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QAClC,UAAU,IAAI,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;QAC1B,KAAK,IAAI,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;QACrB,KAAK,IAAI,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;IACvB,CAAC;IAED,KAAK,GAAG,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;IACzB,KAAK,GAAG,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;IAEzB,IAAI,KAAK,KAAK,CAAC,IAAI,KAAK,KAAK,CAAC,EAAE,CAAC;QAC/B,OAAO,CAAC,CAAC;IACX,CAAC;IAED,OAAO,UAAU,GAAG,CAAC,KAAK,GAAG,KAAK,CAAC,CAAC;AACtC,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,iBAAiB,CAAC,CAAW,EAAE,CAAW;IACxD,IAAI,CAAC,CAAC,MAAM,KAAK,CAAC,CAAC,MAAM,EAAE,CAAC;QAC1B,MAAM,IAAI,KAAK,CAAC,+BAA+B,CAAC,CAAC;IACnD,CAAC;IAED,IAAI,GAAG,GAAG,CAAC,CAAC;IACZ,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QAClC,MAAM,IAAI,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;QACzB,GAAG,IAAI,IAAI,GAAG,IAAI,CAAC;IACrB,CAAC;IAED,OAAO,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;AACxB,CAAC;AAED;;GAEG;AACH,SAAS,iBAAiB,CAAC,OAAmB;IAC5C,IAAI,OAAO,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QACzB,MAAM,IAAI,KAAK,CAAC,wCAAwC,CAAC,CAAC;IAC5D,CAAC;IAED,MAAM,UAAU,GAAG,OAAO,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC;IACrC,MAAM,QAAQ,GAAG,IAAI,KAAK,CAAC,UAAU,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IAE/C,KAAK,MAAM,GAAG,IAAI,OAAO,EAAE,CAAC;QAC1B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,UAAU,EAAE,CAAC,EAAE,EAAE,CAAC;YACpC,QAAQ,CAAC,CAAC,CAAC,IAAI,GAAG,CAAC,CAAC,CAAC,CAAC;QACxB,CAAC;IACH,CAAC;IAED,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,UAAU,EAAE,CAAC,EAAE,EAAE,CAAC;QACpC,QAAQ,CAAC,CAAC,CAAC,IAAI,OAAO,CAAC,MAAM,CAAC;IAChC,CAAC;IAED,OAAO,QAAQ,CAAC;AAClB,CAAC;AAED;;GAEG;AACH,SAAS,2BAA2B,CAAC,UAAsB,EAAE,CAAS;IACpE,MAAM,SAAS,GAAe,EAAE,CAAC;IACjC,MAAM,CAAC,GAAG,UAAU,CAAC,MAAM,CAAC;IAE5B,+BAA+B;IAC/B,MAAM,QAAQ,GAAG,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,MAAM,EAAE,GAAG,CAAC,CAAC,CAAC;IAC/C,SAAS,CAAC,IAAI,CAAC,CAAC,GAAG,UAAU,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC;IAE1C,6EAA6E;IAC7E,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;QAC3B,MAAM,SAAS,GAAa,EAAE,CAAC;QAC/B,IAAI,SAAS,GAAG,CAAC,CAAC;QAElB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;YAC3B,8CAA8C;YAC9C,IAAI,OAAO,GAAG,QAAQ,CAAC;YACvB,KAAK,MAAM,QAAQ,IAAI,SAAS,EAAE,CAAC;gBACjC,MAAM,IAAI,GAAG,iBAAiB,CAAC,UAAU,CAAC,CAAC,CAAC,EAAE,QAAQ,CAAC,CAAC;gBACxD,IAAI,IAAI,GAAG,OAAO,EAAE,CAAC;oBACnB,OAAO,GAAG,IAAI,CAAC;gBACjB,CAAC;YACH,CAAC;YACD,SAAS,CAAC,IAAI,CAAC,OAAO,GAAG,OAAO,CAAC,CAAC,CAAC,sBAAsB;YACzD,SAAS,IAAI,OAAO,GAAG,OAAO,CAAC;QACjC,CAAC;QAED,4BAA4B;QAC5B,IAAI,IAAI,GAAG,IAAI,CAAC,MAAM,EAAE,GAAG,SAAS,CAAC;QACrC,IAAI,WAAW,GAAG,CAAC,CAAC;QACpB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;YAC3B,IAAI,IAAI,SAAS,CAAC,CAAC,CAAC,CAAC;YACrB,IAAI,IAAI,IAAI,CAAC,EAAE,CAAC;gBACd,WAAW,GAAG,CAAC,CAAC;gBAChB,MAAM;YACR,CAAC;QACH,CAAC;QAED,SAAS,CAAC,IAAI,CAAC,CAAC,GAAG,UAAU,CAAC,WAAW,CAAC,CAAC,CAAC,CAAC;IAC/C,CAAC;IAED,OAAO,SAAS,CAAC;AACnB,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,gBAAgB,CAC9B,MAA4B,EAC5B,UAA6B,EAAE;IAE/B,MAAM,EACJ,WAAW,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,GAAG,CAAC,EAAE,EAAE,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,EAChF,aAAa,GAAG,GAAG,EACnB,oBAAoB,GAAG,KAAK,EAC5B,kBAAkB,GAAG,CAAC,GACvB,GAAG,OAAO,CAAC;IAEZ,IAAI,MAAM,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QACxB,OAAO;YACL,YAAY,EAAE,CAAC;YACf,QAAQ,EAAE,EAAE;YACZ,WAAW,EAAE,IAAI,GAAG,EAAE;SACvB,CAAC;IACJ,CAAC;IAED,sEAAsE;IACtE,MAAM,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,WAAW,EAAE,MAAM,CAAC,MAAM,CAAC,CAAC;IAE/C,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC;QACX,sBAAsB;QACtB,MAAM,aAAa,GAAG,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC;QACrD,MAAM,QAAQ,GAAG,iBAAiB,CAAC,aAAa,CAAC,CAAC;QAClD,MAAM,WAAW,GAAG,IAAI,GAAG,EAAkB,CAAC;QAC9C,KAAK,MAAM,KAAK,IAAI,MAAM,EAAE,CAAC;YAC3B,WAAW,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC;QAC/B,CAAC;QAED,OAAO;YACL,YAAY,EAAE,CAAC;YACf,QAAQ,EAAE;gBACR;oBACE,EAAE,EAAE,CAAC;oBACL,KAAK,EAAE,oBAAoB,CAAC,MAAM,EAAE,MAAM,CAAC,KAAK,CAAC,CAAC,EAAE,kBAAkB,CAAC,CAAC;oBACxE,IAAI,EAAE,MAAM,CAAC,MAAM;oBACnB,oBAAoB,EAAE,MAAM,CAAC,KAAK,CAAC,CAAC,EAAE,kBAAkB,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;oBAC1E,QAAQ;oBACR,QAAQ,EAAE,eAAe,CAAC,MAAM,CAAC;iBAClC;aACF;YACD,WAAW;SACZ,CAAC;IACJ,CAAC;IAED,MAAM,UAAU,GAAG,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC;IAElD,uCAAuC;IACvC,IAAI,SAAS,GAAG,2BAA2B,CAAC,UAAU,EAAE,CAAC,CAAC,CAAC;IAE3D,gEAAgE;IAChE,IAAI,kBAAkB,GAAG,IAAI,KAAK,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IAE1D,KAAK,IAAI,SAAS,GAAG,CAAC,EAAE,SAAS,GAAG,aAAa,EAAE,SAAS,EAAE,EAAE,CAAC;QAC/D,yDAAyD;QACzD,MAAM,cAAc,GAAG,IAAI,KAAK,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACxD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,MAAM,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YACvC,IAAI,OAAO,GAAG,QAAQ,CAAC;YACvB,IAAI,cAAc,GAAG,CAAC,CAAC;YAEvB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;gBAC3B,MAAM,IAAI,GAAG,iBAAiB,CAAC,UAAU,CAAC,CAAC,CAAC,EAAE,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC;gBAC5D,IAAI,IAAI,GAAG,OAAO,EAAE,CAAC;oBACnB,OAAO,GAAG,IAAI,CAAC;oBACf,cAAc,GAAG,CAAC,CAAC;gBACrB,CAAC;YACH,CAAC;YAED,cAAc,CAAC,CAAC,CAAC,GAAG,cAAc,CAAC;QACrC,CAAC;QAED,wBAAwB;QACxB,IAAI,OAAO,GAAG,KAAK,CAAC;QACpB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,MAAM,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YACvC,IAAI,cAAc,CAAC,CAAC,CAAC,KAAK,kBAAkB,CAAC,CAAC,CAAC,EAAE,CAAC;gBAChD,OAAO,GAAG,IAAI,CAAC;gBACf,MAAM;YACR,CAAC;QACH,CAAC;QAED,kBAAkB,GAAG,cAAc,CAAC;QAEpC,IAAI,CAAC,OAAO,EAAE,CAAC;YACb,MAAM;QACR,CAAC;QAED,qCAAqC;QACrC,MAAM,YAAY,GAAe,EAAE,CAAC;QACpC,IAAI,QAAQ,GAAG,CAAC,CAAC;QAEjB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;YAC3B,MAAM,cAAc,GAAe,EAAE,CAAC;YACtC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,MAAM,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;gBACvC,IAAI,kBAAkB,CAAC,CAAC,CAAC,KAAK,CAAC,EAAE,CAAC;oBAChC,cAAc,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,CAAC;gBACrC,CAAC;YACH,CAAC;YAED,IAAI,cAAc,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;gBAC9B,MAAM,WAAW,GAAG,iBAAiB,CAAC,cAAc,CAAC,CAAC;gBACtD,MAAM,KAAK,GAAG,iBAAiB,CAAC,SAAS,CAAC,CAAC,CAAC,EAAE,WAAW,CAAC,CAAC;gBAC3D,QAAQ,GAAG,IAAI,CAAC,GAAG,CAAC,QAAQ,EAAE,KAAK,CAAC,CAAC;gBACrC,YAAY,CAAC,IAAI,CAAC,WAAW,CAAC,CAAC;YACjC,CAAC;iBAAM,CAAC;gBACN,iDAAiD;gBACjD,MAAM,SAAS,GAAG,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,MAAM,EAAE,GAAG,MAAM,CAAC,MAAM,CAAC,CAAC;gBAC5D,YAAY,CAAC,IAAI,CAAC,CAAC,GAAG,UAAU,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC;YAChD,CAAC;QACH,CAAC;QAED,SAAS,GAAG,YAAY,CAAC;QAEzB,gDAAgD;QAChD,IAAI,QAAQ,GAAG,oBAAoB,EAAE,CAAC;YACpC,MAAM;QACR,CAAC;IACH,CAAC;IAED,wBAAwB;IACxB,MAAM,aAAa,GAA2B,KAAK,CAAC,CAAC,CAAC;SACnD,IAAI,CAAC,IAAI,CAAC;SACV,GAAG,CAAC,GAAG,EAAE,CAAC,EAAE,CAAC,CAAC;IAEjB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,MAAM,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QACvC,aAAa,CAAC,kBAAkB,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC;IACvD,CAAC;IAED,MAAM,WAAW,GAAG,IAAI,GAAG,EAAkB,CAAC;IAC9C,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,MAAM,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QACvC,WAAW,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,EAAE,EAAE,kBAAkB,CAAC,CAAC,CAAC,CAAC,CAAC;IACvD,CAAC;IAED,yDAAyD;IACzD,MAAM,QAAQ,GAAqB,EAAE,CAAC;IACtC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;QAC3B,MAAM,eAAe,GAAG,aAAa,CAAC,CAAC,CAAC,CAAC;QACzC,IAAI,eAAe,CAAC,MAAM,KAAK,CAAC;YAAE,SAAS;QAE3C,mDAAmD;QACnD,MAAM,gBAAgB,GAAG,CAAC,GAAG,eAAe,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE;YAC1D,MAAM,KAAK,GAAG,iBAAiB,CAAC,CAAC,CAAC,SAAS,EAAE,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC;YAC3D,MAAM,KAAK,GAAG,iBAAiB,CAAC,CAAC,CAAC,SAAS,EAAE,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC;YAC3D,OAAO,KAAK,GAAG,KAAK,CAAC;QACvB,CAAC,CAAC,CAAC;QAEH,MAAM,eAAe,GAAG,gBAAgB,CAAC,KAAK,CAAC,CAAC,EAAE,kBAAkB,CAAC,CAAC;QACtE,MAAM,KAAK,GAAG,oBAAoB,CAAC,eAAe,EAAE,eAAe,CAAC,CAAC;QACrE,MAAM,QAAQ,GAAG,eAAe,CAAC,eAAe,CAAC,CAAC;QAElD,QAAQ,CAAC,IAAI,CAAC;YACZ,EAAE,EAAE,CAAC;YACL,KAAK;YACL,IAAI,EAAE,eAAe,CAAC,MAAM;YAC5B,oBAAoB,EAAE,eAAe,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;YACtD,QAAQ,EAAE,SAAS,CAAC,CAAC,CAAC;YACtB,QAAQ;SACT,CAAC,CAAC;IACL,CAAC;IAED,wCAAwC;IACxC,QAAQ,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC;IAEzC,qCAAqC;IACrC,MAAM,SAAS,GAAG,IAAI,GAAG,EAAkB,CAAC;IAC5C,QAAQ,CAAC,OAAO,CAAC,CAAC,OAAO,EAAE,KAAK,EAAE,EAAE;QAClC,SAAS,CAAC,GAAG,CAAC,OAAO,CAAC,EAAE,EAAE,KAAK,CAAC,CAAC;QACjC,OAAO,CAAC,EAAE,GAAG,KAAK,CAAC;IACrB,CAAC,CAAC,CAAC;IAEH,kCAAkC;IAClC,KAAK,MAAM,CAAC,OAAO,EAAE,YAAY,CAAC,IAAI,WAAW,EAAE,CAAC;QAClD,MAAM,YAAY,GAAG,SAAS,CAAC,GAAG,CAAC,YAAY,CAAC,CAAC;QACjD,IAAI,YAAY,KAAK,SAAS,EAAE,CAAC;YAC/B,WAAW,CAAC,GAAG,CAAC,OAAO,EAAE,YAAY,CAAC,CAAC;QACzC,CAAC;IACH,CAAC;IAED,OAAO;QACL,YAAY,EAAE,QAAQ,CAAC,MAAM;QAC7B,QAAQ;QACR,WAAW;KACZ,CAAC;AACJ,CAAC;AAED;;GAEG;AACH,SAAS,oBAAoB,CAC3B,SAA+B,EAC/B,eAAqC;IAErC,uDAAuD;IACvD,MAAM,WAAW,GAAG,IAAI,GAAG,EAAkB,CAAC;IAC9C,MAAM,QAAQ,GAAG,IAAI,GAAG,EAAkB,CAAC;IAE3C,KAAK,MAAM,KAAK,IAAI,SAAS,EAAE,CAAC;QAC9B,IAAI,KAAK,CAAC,UAAU,EAAE,CAAC;YACrB,WAAW,CAAC,GAAG,CAAC,KAAK,CAAC,UAAU,EAAE,CAAC,WAAW,CAAC,GAAG,CAAC,KAAK,CAAC,UAAU,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;QAClF,CAAC;QAED,kCAAkC;QAClC,MAAM,KAAK,GAAG,KAAK,CAAC,QAAQ,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC;QACxC,IAAI,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YACrB,MAAM,GAAG,GAAG,KAAK,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;YACzC,QAAQ,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC,QAAQ,CAAC,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;QAClD,CAAC;IACH,CAAC;IAED,4BAA4B;IAC5B,IAAI,YAAY,GAAG,EAAE,CAAC;IACtB,IAAI,YAAY,GAAG,CAAC,CAAC;IACrB,KAAK,MAAM,CAAC,IAAI,EAAE,KAAK,CAAC,IAAI,WAAW,EAAE,CAAC;QACxC,IAAI,KAAK,GAAG,YAAY,EAAE,CAAC;YACzB,YAAY,GAAG,KAAK,CAAC;YACrB,YAAY,GAAG,IAAI,CAAC;QACtB,CAAC;IACH,CAAC;IAED,0BAA0B;IAC1B,IAAI,WAAW,GAAG,EAAE,CAAC;IACrB,IAAI,WAAW,GAAG,CAAC,CAAC;IACpB,KAAK,MAAM,CAAC,GAAG,EAAE,KAAK,CAAC,IAAI,QAAQ,EAAE,CAAC;QACpC,IAAI,KAAK,GAAG,WAAW,EAAE,CAAC;YACxB,WAAW,GAAG,KAAK,CAAC;YACpB,WAAW,GAAG,GAAG,CAAC;QACpB,CAAC;IACH,CAAC;IAED,cAAc;IACd,MAAM,KAAK,GAAa,EAAE,CAAC;IAE3B,IAAI,WAAW,EAAE,CAAC;QAChB,+BAA+B;QAC/B,MAAM,QAAQ,GAAG,WAAW,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC;QACxC,KAAK,CAAC,IAAI,CAAC,QAAQ,CAAC,QAAQ,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC;IAC5C,CAAC;IAED,IAAI,YAAY,EAAE,CAAC;QACjB,KAAK,CAAC,IAAI,CAAC,GAAG,YAAY,GAAG,CAAC,CAAC;IACjC,CAAC;IAED,IAAI,KAAK,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QACvB,8CAA8C;QAC9C,MAAM,QAAQ,GAAG,eAAe,CAAC,eAAe,CAAC,CAAC;QAClD,IAAI,QAAQ,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YACxB,OAAO,QAAQ,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QAC1C,CAAC;QACD,OAAO,MAAM,CAAC;IAChB,CAAC;IAED,OAAO,KAAK,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;AACzB,CAAC;AAED;;GAEG;AACH,SAAS,eAAe,CAAC,MAA4B;IACnD,MAAM,QAAQ,GAAG,IAAI,GAAG,EAAkB,CAAC;IAE3C,0BAA0B;IAC1B,MAAM,SAAS,GAAG,IAAI,GAAG,CAAC;QACxB,UAAU;QACV,OAAO;QACP,KAAK;QACL,KAAK;QACL,QAAQ;QACR,IAAI;QACJ,MAAM;QACN,KAAK;QACL,OAAO;QACP,QAAQ;QACR,QAAQ;QACR,MAAM;QACN,OAAO;QACP,WAAW;QACX,MAAM;QACN,OAAO;QACP,OAAO;QACP,KAAK;QACL,MAAM;QACN,MAAM;QACN,OAAO;QACP,MAAM;QACN,WAAW;QACX,QAAQ;QACR,SAAS;QACT,QAAQ;QACR,MAAM;QACN,QAAQ;QACR,QAAQ;QACR,SAAS;QACT,KAAK;QACL,KAAK;QACL,MAAM;QACN,MAAM;QACN,MAAM;QACN,KAAK;QACL,QAAQ;QACR,OAAO;QACP,OAAO;QACP,QAAQ;QACR,SAAS;QACT,YAAY;QACZ,SAAS;QACT,MAAM;QACN,OAAO;QACP,UAAU;KACX,CAAC,CAAC;IAEH,KAAK,MAAM,KAAK,IAAI,MAAM,EAAE,CAAC;QAC3B,gCAAgC;QAChC,MAAM,KAAK,GAAG,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC,mCAAmC,CAAC,IAAI,EAAE,CAAC;QAE7E,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;YACzB,MAAM,KAAK,GAAG,IAAI,CAAC,WAAW,EAAE,CAAC;YACjC,IAAI,KAAK,CAAC,MAAM,IAAI,CAAC,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,CAAC;gBAC/C,QAAQ,CAAC,GAAG,CAAC,KAAK,EAAE,CAAC,QAAQ,CAAC,GAAG,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;YACtD,CAAC;QACH,CAAC;QAED,qCAAqC;QACrC,IAAI,KAAK,CAAC,UAAU,EAAE,CAAC;YACrB,MAAM,WAAW,GAAG,KAAK,CAAC,UAAU,CAAC,KAAK,CAAC,eAAe,CAAC,IAAI,EAAE,CAAC;YAClE,KAAK,MAAM,IAAI,IAAI,WAAW,EAAE,CAAC;gBAC/B,MAAM,KAAK,GAAG,IAAI,CAAC,WAAW,EAAE,CAAC;gBACjC,IAAI,KAAK,CAAC,MAAM,IAAI,CAAC,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,CAAC;oBAC/C,QAAQ,CAAC,GAAG,CAAC,KAAK,EAAE,CAAC,QAAQ,CAAC,GAAG,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;gBACtD,CAAC;YACH,CAAC;QACH,CAAC;IACH,CAAC;IAED,4CAA4C;IAC5C,MAAM,MAAM,GAAG,CAAC,GAAG,QAAQ,CAAC,OAAO,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IAEnE,OAAO,MAAM,CAAC,KAAK,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,EAAE,EAAE,CAAC,IAAI,CAAC,CAAC;AACnD,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,eAAe,CAAC,SAAmB,EAAE,QAA0B;IAC7E,IAAI,OAAO,GAAG,QAAQ,CAAC;IACvB,IAAI,cAAc,GAAG,CAAC,CAAC;IAEvB,KAAK,MAAM,OAAO,IAAI,QAAQ,EAAE,CAAC;QAC/B,MAAM,IAAI,GAAG,iBAAiB,CAAC,SAAS,EAAE,OAAO,CAAC,QAAQ,CAAC,CAAC;QAC5D,IAAI,IAAI,GAAG,OAAO,EAAE,CAAC;YACnB,OAAO,GAAG,IAAI,CAAC;YACf,cAAc,GAAG,OAAO,CAAC,EAAE,CAAC;QAC9B,CAAC;IACH,CAAC;IAED,OAAO,cAAc,CAAC;AACxB,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,wBAAwB,CACtC,MAA4B,EAC5B,WAAgC,EAChC,QAA0B;IAE1B,IAAI,QAAQ,CAAC,MAAM,IAAI,CAAC,IAAI,MAAM,CAAC,MAAM,IAAI,CAAC,EAAE,CAAC;QAC/C,OAAO,CAAC,CAAC;IACX,CAAC;IAED,IAAI,UAAU,GAAG,CAAC,CAAC;IACnB,IAAI,KAAK,GAAG,CAAC,CAAC;IAEd,KAAK,MAAM,KAAK,IAAI,MAAM,EAAE,CAAC;QAC3B,MAAM,SAAS,GAAG,WAAW,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC;QAC5C,IAAI,SAAS,KAAK,SAAS;YAAE,SAAS;QAEtC,mEAAmE;QACnE,IAAI,gBAAgB,GAAG,CAAC,CAAC;QACzB,IAAI,UAAU,GAAG,CAAC,CAAC;QAEnB,KAAK,MAAM,KAAK,IAAI,MAAM,EAAE,CAAC;YAC3B,IAAI,KAAK,CAAC,EAAE,KAAK,KAAK,CAAC,EAAE;gBAAE,SAAS;YACpC,IAAI,WAAW,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,CAAC,KAAK,SAAS,EAAE,CAAC;gBAC5C,gBAAgB,IAAI,iBAAiB,CAAC,KAAK,CAAC,SAAS,EAAE,KAAK,CAAC,SAAS,CAAC,CAAC;gBACxE,UAAU,EAAE,CAAC;YACf,CAAC;QACH,CAAC;QAED,MAAM,CAAC,GAAG,UAAU,GAAG,CAAC,CAAC,CAAC,CAAC,gBAAgB,GAAG,UAAU,CAAC,CAAC,CAAC,CAAC,CAAC;QAE7D,uEAAuE;QACvE,IAAI,mBAAmB,GAAG,QAAQ,CAAC;QAEnC,KAAK,MAAM,YAAY,IAAI,QAAQ,EAAE,CAAC;YACpC,IAAI,YAAY,CAAC,EAAE,KAAK,SAAS;gBAAE,SAAS;YAE5C,IAAI,SAAS,GAAG,CAAC,CAAC;YAClB,IAAI,UAAU,GAAG,CAAC,CAAC;YAEnB,KAAK,MAAM,KAAK,IAAI,MAAM,EAAE,CAAC;gBAC3B,IAAI,WAAW,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,CAAC,KAAK,YAAY,CAAC,EAAE,EAAE,CAAC;oBAClD,SAAS,IAAI,iBAAiB,CAAC,KAAK,CAAC,SAAS,EAAE,KAAK,CAAC,SAAS,CAAC,CAAC;oBACjE,UAAU,EAAE,CAAC;gBACf,CAAC;YACH,CAAC;YAED,IAAI,UAAU,GAAG,CAAC,EAAE,CAAC;gBACnB,MAAM,OAAO,GAAG,SAAS,GAAG,UAAU,CAAC;gBACvC,IAAI,OAAO,GAAG,mBAAmB,EAAE,CAAC;oBAClC,mBAAmB,GAAG,OAAO,CAAC;gBAChC,CAAC;YACH,CAAC;QACH,CAAC;QAED,MAAM,CAAC,GAAG,mBAAmB,KAAK,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,mBAAmB,CAAC;QAErE,wCAAwC;QACxC,MAAM,KAAK,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;QAC7B,MAAM,CAAC,GAAG,KAAK,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC;QAE1C,UAAU,IAAI,CAAC,CAAC;QAChB,KAAK,EAAE,CAAC;IACV,CAAC;IAED,OAAO,KAAK,GAAG,CAAC,CAAC,CAAC,CAAC,UAAU,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC;AAC5C,CAAC"}