tea-rags 0.9.0

package/build/core/ingest/sync/synchronizer.js

@@ -0,0 +1,361 @@
+/**
+ * FileSynchronizer - Optimized incremental updates using Merkle trees + mtime caching
+ * PERFORMANCE: ~40x faster for incremental updates (40s → <1s)
+ *
+ * Key optimizations:
+ * - mtime + size caching to avoid reading unchanged files
+ * - SHA256 computation only for potentially changed files
+ * - Backward compatible with old snapshots
+ */
+import { createHash } from "node:crypto";
+import { promises as fs } from "node:fs";
+import { join, relative } from "node:path";
+import { snapshotsDir } from "../../../bootstrap/config/paths.js";
+import { isDebug } from "../pipeline/infra/runtime.js";
+import { MerkleTree } from "./merkle.js";
+import { SnapshotManager } from "./snapshot.js";
+export class FileSynchronizer {
+    codebasePath;
+    snapshotManager;
+    previousHashes = new Map();
+    previousMetadata = new Map();
+    previousTree = null;
+    checkpointPath;
+    collectionName;
+    constructor(codebasePath, collectionName) {
+        this.codebasePath = codebasePath;
+        this.collectionName = collectionName;
+        const snapshotDir = snapshotsDir();
+        const snapshotPath = join(snapshotDir, `${collectionName}.json`);
+        this.checkpointPath = join(snapshotDir, `${collectionName}.checkpoint.json`);
+        this.snapshotManager = new SnapshotManager(snapshotPath);
+    }
+    /**
+     * Initialize synchronizer by loading previous snapshot
+     */
+    async initialize() {
+        const snapshot = await this.snapshotManager.load();
+        if (snapshot) {
+            this.previousHashes = snapshot.fileHashes;
+            this.previousTree = snapshot.merkleTree;
+            // Load metadata if available (v2 snapshots)
+            if (snapshot.fileMetadata) {
+                this.previousMetadata = snapshot.fileMetadata;
+            }
+            return true;
+        }
+        return false;
+    }
+    /**
+     * AUTO-MIGRATION: Upgrade v1 snapshot to v2 by adding metadata
+     * Called automatically after initialize() if snapshot is v1
+     * This is FAST (only stat calls, no file reading)
+     */
+    async ensureSnapshotV2() {
+        // Check if already v2
+        if (this.previousMetadata.size > 0) {
+            return false; // Already v2, no migration needed
+        }
+        // Check if we have v1 snapshot data
+        if (this.previousHashes.size === 0) {
+            return false; // No snapshot exists
+        }
+        console.error("[FileSynchronizer] Migrating snapshot v1 → v2...");
+        const startTime = Date.now();
+        const metadata = new Map();
+        let migratedCount = 0;
+        let missingCount = 0;
+        // For each file in old snapshot, add metadata
+        for (const [relativePath, hash] of this.previousHashes) {
+            const absolutePath = join(this.codebasePath, relativePath);
+            // Get current mtime + size (fast stat call)
+            const meta = await this.getFileMetadata(absolutePath);
+            if (meta) {
+                metadata.set(relativePath, {
+                    mtime: meta.mtime,
+                    size: meta.size,
+                    hash, // Use existing hash from v1
+                });
+                migratedCount++;
+            }
+            else {
+                // File no longer exists, skip it
+                missingCount++;
+            }
+        }
+        // Save as v2
+        if (metadata.size > 0) {
+            const tree = new MerkleTree();
+            tree.build(this.previousHashes);
+            await this.snapshotManager.save(this.codebasePath, this.previousHashes, tree, metadata);
+            // Update internal state
+            this.previousMetadata = metadata;
+            this.previousTree = tree;
+            const duration = Date.now() - startTime;
+            console.error(`[FileSynchronizer] Migration complete: ${migratedCount} files upgraded ` +
+                `(${missingCount} missing) in ${duration}ms`);
+            return true;
+        }
+        return false;
+    }
+    /**
+     * Get file metadata (mtime + size) without reading content
+     */
+    async getFileMetadata(filePath) {
+        try {
+            const absolutePath = filePath.startsWith(this.codebasePath) ? filePath : join(this.codebasePath, filePath);
+            const stats = await fs.stat(absolutePath);
+            return {
+                mtime: stats.mtimeMs,
+                size: stats.size,
+            };
+        }
+        catch (_error) {
+            return null;
+        }
+    }
+    /**
+     * Compute hash for a file's content
+     */
+    async hashFile(filePath) {
+        try {
+            const absolutePath = filePath.startsWith(this.codebasePath) ? filePath : join(this.codebasePath, filePath);
+            const content = await fs.readFile(absolutePath, "utf-8");
+            return createHash("sha256").update(content).digest("hex");
+        }
+        catch (_error) {
+            return "";
+        }
+    }
+    /**
+     * OPTIMIZED: Compute hashes with mtime/size caching
+     * Only reads files that have potentially changed
+     */
+    async computeFileHashes(filePaths) {
+        const fileHashes = new Map();
+        let cachedHits = 0;
+        let hashComputations = 0;
+        for (const filePath of filePaths) {
+            const relativePath = filePath.startsWith(this.codebasePath) ? relative(this.codebasePath, filePath) : filePath;
+            // Get current metadata
+            const metadata = await this.getFileMetadata(filePath);
+            if (!metadata)
+                continue;
+            // Check if we have cached metadata
+            const cached = this.previousMetadata.get(relativePath);
+            // FAST PATH: Use cached hash if mtime and size match
+            if (cached &&
+                Math.abs(cached.mtime - metadata.mtime) < 1000 && // 1s tolerance for FS precision
+                cached.size === metadata.size) {
+                fileHashes.set(relativePath, cached.hash);
+                cachedHits++;
+                continue;
+            }
+            // SLOW PATH: Compute hash for changed/new file
+            const hash = await this.hashFile(filePath);
+            if (hash) {
+                fileHashes.set(relativePath, hash);
+                hashComputations++;
+            }
+        }
+        // Log performance stats
+        if (isDebug()) {
+            console.error(`[FileSynchronizer] Cache: ${cachedHits} hits, ${hashComputations} computations ` +
+                `(${((cachedHits / (cachedHits + hashComputations)) * 100).toFixed(1)}% cached)`);
+        }
+        return fileHashes;
+    }
+    /**
+     * OPTIMIZED: Compute full metadata for snapshot
+     */
+    async computeFileMetadata(filePaths) {
+        const metadata = new Map();
+        for (const filePath of filePaths) {
+            const relativePath = filePath.startsWith(this.codebasePath) ? relative(this.codebasePath, filePath) : filePath;
+            const meta = await this.getFileMetadata(filePath);
+            if (!meta)
+                continue;
+            const hash = await this.hashFile(filePath);
+            if (!hash)
+                continue;
+            metadata.set(relativePath, {
+                mtime: meta.mtime,
+                size: meta.size,
+                hash,
+            });
+        }
+        return metadata;
+    }
+    /**
+     * Detect changes since last snapshot
+     * OPTIMIZED: Uses mtime/size for fast filtering
+     */
+    async detectChanges(currentFiles) {
+        // Compute current hashes (with caching optimization)
+        const currentHashes = await this.computeFileHashes(currentFiles);
+        // Compare with previous snapshot
+        const changes = MerkleTree.compare(this.previousHashes, currentHashes);
+        // DEBUG: Log change detection results
+        if (isDebug()) {
+            console.error(`[FileSynchronizer] Change detection: ` +
+                `${changes.added.length} added, ` +
+                `${changes.modified.length} modified, ` +
+                `${changes.deleted.length} deleted ` +
+                `(from ${currentFiles.length} current files, ${this.previousHashes.size} in snapshot)`);
+            if (changes.modified.length > 0 && changes.modified.length <= 10) {
+                console.error(`[FileSynchronizer] Modified files: ${changes.modified.join(", ")}`);
+            }
+        }
+        return changes;
+    }
+    /**
+     * Update snapshot with current state
+     * OPTIMIZED: Stores metadata for next run
+     */
+    async updateSnapshot(files) {
+        // Compute full metadata
+        const metadata = await this.computeFileMetadata(files);
+        // Extract hashes
+        const fileHashes = new Map();
+        for (const [path, meta] of metadata) {
+            fileHashes.set(path, meta.hash);
+        }
+        // Build Merkle tree
+        const tree = new MerkleTree();
+        tree.build(fileHashes);
+        // Save snapshot with metadata (v2 format)
+        await this.snapshotManager.save(this.codebasePath, fileHashes, tree, metadata);
+        // Update internal state
+        this.previousHashes = fileHashes;
+        this.previousMetadata = metadata;
+        this.previousTree = tree;
+    }
+    /**
+     * Delete snapshot
+     */
+    async deleteSnapshot() {
+        await this.snapshotManager.delete();
+        this.previousHashes.clear();
+        this.previousMetadata.clear();
+        this.previousTree = null;
+    }
+    /**
+     * Check if snapshot exists
+     */
+    async hasSnapshot() {
+        return this.snapshotManager.exists();
+    }
+    // ============ CHECKPOINT METHODS ============
+    /**
+     * Save checkpoint for resumable indexing
+     * Call every N files (e.g., every 100 files or 500 chunks)
+     */
+    async saveCheckpoint(processedFiles, totalFiles, phase = "indexing") {
+        const checkpoint = {
+            processedFiles,
+            totalFiles,
+            timestamp: Date.now(),
+            phase,
+        };
+        try {
+            const dir = snapshotsDir();
+            await fs.mkdir(dir, { recursive: true });
+            // Write checkpoint atomically (write to temp, then rename)
+            const tempPath = `${this.checkpointPath}.tmp`;
+            await fs.writeFile(tempPath, JSON.stringify(checkpoint, null, 2));
+            await fs.rename(tempPath, this.checkpointPath);
+            if (isDebug()) {
+                console.error(`[Checkpoint] Saved: ${processedFiles.length}/${totalFiles} files (${phase})`);
+            }
+        }
+        catch (error) {
+            console.error("[Checkpoint] Failed to save:", error);
+            // Non-fatal - continue without checkpoint
+        }
+    }
+    /**
+     * Load checkpoint if exists
+     * Returns null if no checkpoint or checkpoint is stale
+     */
+    async loadCheckpoint() {
+        try {
+            const data = await fs.readFile(this.checkpointPath, "utf-8");
+            const checkpoint = JSON.parse(data);
+            // Validate checkpoint
+            if (!checkpoint.processedFiles || !checkpoint.totalFiles) {
+                return null;
+            }
+            // Check if checkpoint is too old (> 24 hours)
+            const maxAge = 24 * 60 * 60 * 1000;
+            if (Date.now() - checkpoint.timestamp > maxAge) {
+                console.error("[Checkpoint] Stale checkpoint (> 24h), ignoring");
+                await this.deleteCheckpoint();
+                return null;
+            }
+            console.error(`[Checkpoint] Found: ${checkpoint.processedFiles.length}/${checkpoint.totalFiles} ` +
+                `files (${checkpoint.phase})`);
+            return checkpoint;
+        }
+        catch {
+            return null;
+        }
+    }
+    /**
+     * Delete checkpoint (call after successful completion)
+     */
+    async deleteCheckpoint() {
+        try {
+            await fs.unlink(this.checkpointPath);
+        }
+        catch {
+            // Ignore - file may not exist
+        }
+    }
+    /**
+     * Check if checkpoint exists
+     */
+    async hasCheckpoint() {
+        try {
+            await fs.access(this.checkpointPath);
+            return true;
+        }
+        catch {
+            return false;
+        }
+    }
+    /**
+     * Filter out already processed files based on checkpoint
+     */
+    filterProcessedFiles(allFiles, checkpoint) {
+        const processedSet = new Set(checkpoint.processedFiles);
+        return allFiles.filter((f) => !processedSet.has(f));
+    }
+    /**
+     * Validate snapshot integrity
+     */
+    async validateSnapshot() {
+        return this.snapshotManager.validate();
+    }
+    /**
+     * Get snapshot age in milliseconds
+     */
+    async getSnapshotAge() {
+        const snapshot = await this.snapshotManager.load();
+        if (!snapshot)
+            return null;
+        return Date.now() - snapshot.timestamp;
+    }
+    /**
+     * Quick check if re-indexing is needed (compare root hashes)
+     * OPTIMIZED: Uses cached hashes when possible
+     */
+    async needsReindex(currentFiles) {
+        if (!this.previousTree)
+            return true;
+        const currentHashes = await this.computeFileHashes(currentFiles);
+        const currentTree = new MerkleTree();
+        currentTree.build(currentHashes);
+        return this.previousTree.getRootHash() !== currentTree.getRootHash();
+    }
+}
+//# sourceMappingURL=synchronizer.js.map

package/build/core/ingest/sync/synchronizer.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"synchronizer.js","sourceRoot":"","sources":["../../../../src/core/ingest/sync/synchronizer.ts"],"names":[],"mappings":"AAAA;;;;;;;;GAQG;AAEH,OAAO,EAAE,UAAU,EAAE,MAAM,aAAa,CAAC;AACzC,OAAO,EAAE,QAAQ,IAAI,EAAE,EAAE,MAAM,SAAS,CAAC;AACzC,OAAO,EAAE,IAAI,EAAE,QAAQ,EAAE,MAAM,WAAW,CAAC;AAE3C,OAAO,EAAE,YAAY,EAAE,MAAM,oCAAoC,CAAC;AAElE,OAAO,EAAE,OAAO,EAAE,MAAM,8BAA8B,CAAC;AACvD,OAAO,EAAE,UAAU,EAAE,MAAM,aAAa,CAAC;AACzC,OAAO,EAAE,eAAe,EAAE,MAAM,eAAe,CAAC;AAqBhD,MAAM,OAAO,gBAAgB;IASR;IARF,eAAe,CAAkB;IAC1C,cAAc,GAAwB,IAAI,GAAG,EAAE,CAAC;IAChD,gBAAgB,GAA8B,IAAI,GAAG,EAAE,CAAC;IACxD,YAAY,GAAsB,IAAI,CAAC;IAC9B,cAAc,CAAS;IACvB,cAAc,CAAS;IAExC,YACmB,YAAoB,EACrC,cAAsB;QADL,iBAAY,GAAZ,YAAY,CAAQ;QAGrC,IAAI,CAAC,cAAc,GAAG,cAAc,CAAC;QACrC,MAAM,WAAW,GAAG,YAAY,EAAE,CAAC;QACnC,MAAM,YAAY,GAAG,IAAI,CAAC,WAAW,EAAE,GAAG,cAAc,OAAO,CAAC,CAAC;QACjE,IAAI,CAAC,cAAc,GAAG,IAAI,CAAC,WAAW,EAAE,GAAG,cAAc,kBAAkB,CAAC,CAAC;QAC7E,IAAI,CAAC,eAAe,GAAG,IAAI,eAAe,CAAC,YAAY,CAAC,CAAC;IAC3D,CAAC;IAED;;OAEG;IACH,KAAK,CAAC,UAAU;QACd,MAAM,QAAQ,GAAG,MAAM,IAAI,CAAC,eAAe,CAAC,IAAI,EAAE,CAAC;QAEnD,IAAI,QAAQ,EAAE,CAAC;YACb,IAAI,CAAC,cAAc,GAAG,QAAQ,CAAC,UAAU,CAAC;YAC1C,IAAI,CAAC,YAAY,GAAG,QAAQ,CAAC,UAAU,CAAC;YAExC,4CAA4C;YAC5C,IAAI,QAAQ,CAAC,YAAY,EAAE,CAAC;gBAC1B,IAAI,CAAC,gBAAgB,GAAG,QAAQ,CAAC,YAAY,CAAC;YAChD,CAAC;YAED,OAAO,IAAI,CAAC;QACd,CAAC;QAED,OAAO,KAAK,CAAC;IACf,CAAC;IAED;;;;OAIG;IACH,KAAK,CAAC,gBAAgB;QACpB,sBAAsB;QACtB,IAAI,IAAI,CAAC,gBAAgB,CAAC,IAAI,GAAG,CAAC,EAAE,CAAC;YACnC,OAAO,KAAK,CAAC,CAAC,kCAAkC;QAClD,CAAC;QAED,oCAAoC;QACpC,IAAI,IAAI,CAAC,cAAc,CAAC,IAAI,KAAK,CAAC,EAAE,CAAC;YACnC,OAAO,KAAK,CAAC,CAAC,qBAAqB;QACrC,CAAC;QAED,OAAO,CAAC,KAAK,CAAC,kDAAkD,CAAC,CAAC;QAClE,MAAM,SAAS,GAAG,IAAI,CAAC,GAAG,EAAE,CAAC;QAC7B,MAAM,QAAQ,GAAG,IAAI,GAAG,EAAwB,CAAC;QACjD,IAAI,aAAa,GAAG,CAAC,CAAC;QACtB,IAAI,YAAY,GAAG,CAAC,CAAC;QAErB,8CAA8C;QAC9C,KAAK,MAAM,CAAC,YAAY,EAAE,IAAI,CAAC,IAAI,IAAI,CAAC,cAAc,EAAE,CAAC;YACvD,MAAM,YAAY,GAAG,IAAI,CAAC,IAAI,CAAC,YAAY,EAAE,YAAY,CAAC,CAAC;YAE3D,4CAA4C;YAC5C,MAAM,IAAI,GAAG,MAAM,IAAI,CAAC,eAAe,CAAC,YAAY,CAAC,CAAC;YAEtD,IAAI,IAAI,EAAE,CAAC;gBACT,QAAQ,CAAC,GAAG,CAAC,YAAY,EAAE;oBACzB,KAAK,EAAE,IAAI,CAAC,KAAK;oBACjB,IAAI,EAAE,IAAI,CAAC,IAAI;oBACf,IAAI,EAAE,4BAA4B;iBACnC,CAAC,CAAC;gBACH,aAAa,EAAE,CAAC;YAClB,CAAC;iBAAM,CAAC;gBACN,iCAAiC;gBACjC,YAAY,EAAE,CAAC;YACjB,CAAC;QACH,CAAC;QAED,aAAa;QACb,IAAI,QAAQ,CAAC,IAAI,GAAG,CAAC,EAAE,CAAC;YACtB,MAAM,IAAI,GAAG,IAAI,UAAU,EAAE,CAAC;YAC9B,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,cAAc,CAAC,CAAC;YAChC,MAAM,IAAI,CAAC,eAAe,CAAC,IAAI,CAAC,IAAI,CAAC,YAAY,EAAE,IAAI,CAAC,cAAc,EAAE,IAAI,EAAE,QAAQ,CAAC,CAAC;YAExF,wBAAwB;YACxB,IAAI,CAAC,gBAAgB,GAAG,QAAQ,CAAC;YACjC,IAAI,CAAC,YAAY,GAAG,IAAI,CAAC;YAEzB,MAAM,QAAQ,GAAG,IAAI,CAAC,GAAG,EAAE,GAAG,SAAS,CAAC;YACxC,OAAO,CAAC,KAAK,CACX,0CAA0C,aAAa,kBAAkB;gBACvE,IAAI,YAAY,gBAAgB,QAAQ,IAAI,CAC/C,CAAC;YACF,OAAO,IAAI,CAAC;QACd,CAAC;QAED,OAAO,KAAK,CAAC;IACf,CAAC;IAED;;OAEG;IACK,KAAK,CAAC,eAAe,CAAC,QAAgB;QAC5C,IAAI,CAAC;YACH,MAAM,YAAY,GAAG,QAAQ,CAAC,UAAU,CAAC,IAAI,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,YAAY,EAAE,QAAQ,CAAC,CAAC;YAE3G,MAAM,KAAK,GAAG,MAAM,EAAE,CAAC,IAAI,CAAC,YAAY,CAAC,CAAC;YAC1C,OAAO;gBACL,KAAK,EAAE,KAAK,CAAC,OAAO;gBACpB,IAAI,EAAE,KAAK,CAAC,IAAI;aACjB,CAAC;QACJ,CAAC;QAAC,OAAO,MAAM,EAAE,CAAC;YAChB,OAAO,IAAI,CAAC;QACd,CAAC;IACH,CAAC;IAED;;OAEG;IACK,KAAK,CAAC,QAAQ,CAAC,QAAgB;QACrC,IAAI,CAAC;YACH,MAAM,YAAY,GAAG,QAAQ,CAAC,UAAU,CAAC,IAAI,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,YAAY,EAAE,QAAQ,CAAC,CAAC;YAC3G,MAAM,OAAO,GAAG,MAAM,EAAE,CAAC,QAAQ,CAAC,YAAY,EAAE,OAAO,CAAC,CAAC;YACzD,OAAO,UAAU,CAAC,QAAQ,CAAC,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC;QAC5D,CAAC;QAAC,OAAO,MAAM,EAAE,CAAC;YAChB,OAAO,EAAE,CAAC;QACZ,CAAC;IACH,CAAC;IAED;;;OAGG;IACH,KAAK,CAAC,iBAAiB,CAAC,SAAmB;QACzC,MAAM,UAAU,GAAG,IAAI,GAAG,EAAkB,CAAC;QAC7C,IAAI,UAAU,GAAG,CAAC,CAAC;QACnB,IAAI,gBAAgB,GAAG,CAAC,CAAC;QAEzB,KAAK,MAAM,QAAQ,IAAI,SAAS,EAAE,CAAC;YACjC,MAAM,YAAY,GAAG,QAAQ,CAAC,UAAU,CAAC,IAAI,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC,QAAQ,CAAC,IAAI,CAAC,YAAY,EAAE,QAAQ,CAAC,CAAC,CAAC,CAAC,QAAQ,CAAC;YAE/G,uBAAuB;YACvB,MAAM,QAAQ,GAAG,MAAM,IAAI,CAAC,eAAe,CAAC,QAAQ,CAAC,CAAC;YACtD,IAAI,CAAC,QAAQ;gBAAE,SAAS;YAExB,mCAAmC;YACnC,MAAM,MAAM,GAAG,IAAI,CAAC,gBAAgB,CAAC,GAAG,CAAC,YAAY,CAAC,CAAC;YAEvD,qDAAqD;YACrD,IACE,MAAM;gBACN,IAAI,CAAC,GAAG,CAAC,MAAM,CAAC,KAAK,GAAG,QAAQ,CAAC,KAAK,CAAC,GAAG,IAAI,IAAI,gCAAgC;gBAClF,MAAM,CAAC,IAAI,KAAK,QAAQ,CAAC,IAAI,EAC7B,CAAC;gBACD,UAAU,CAAC,GAAG,CAAC,YAAY,EAAE,MAAM,CAAC,IAAI,CAAC,CAAC;gBAC1C,UAAU,EAAE,CAAC;gBACb,SAAS;YACX,CAAC;YAED,+CAA+C;YAC/C,MAAM,IAAI,GAAG,MAAM,IAAI,CAAC,QAAQ,CAAC,QAAQ,CAAC,CAAC;YAC3C,IAAI,IAAI,EAAE,CAAC;gBACT,UAAU,CAAC,GAAG,CAAC,YAAY,EAAE,IAAI,CAAC,CAAC;gBACnC,gBAAgB,EAAE,CAAC;YACrB,CAAC;QACH,CAAC;QAED,wBAAwB;QACxB,IAAI,OAAO,EAAE,EAAE,CAAC;YACd,OAAO,CAAC,KAAK,CACX,6BAA6B,UAAU,UAAU,gBAAgB,gBAAgB;gBAC/E,IAAI,CAAC,CAAC,UAAU,GAAG,CAAC,UAAU,GAAG,gBAAgB,CAAC,CAAC,GAAG,GAAG,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,WAAW,CACnF,CAAC;QACJ,CAAC;QAED,OAAO,UAAU,CAAC;IACpB,CAAC;IAED;;OAEG;IACK,KAAK,CAAC,mBAAmB,CAAC,SAAmB;QACnD,MAAM,QAAQ,GAAG,IAAI,GAAG,EAAwB,CAAC;QAEjD,KAAK,MAAM,QAAQ,IAAI,SAAS,EAAE,CAAC;YACjC,MAAM,YAAY,GAAG,QAAQ,CAAC,UAAU,CAAC,IAAI,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC,QAAQ,CAAC,IAAI,CAAC,YAAY,EAAE,QAAQ,CAAC,CAAC,CAAC,CAAC,QAAQ,CAAC;YAE/G,MAAM,IAAI,GAAG,MAAM,IAAI,CAAC,eAAe,CAAC,QAAQ,CAAC,CAAC;YAClD,IAAI,CAAC,IAAI;gBAAE,SAAS;YAEpB,MAAM,IAAI,GAAG,MAAM,IAAI,CAAC,QAAQ,CAAC,QAAQ,CAAC,CAAC;YAC3C,IAAI,CAAC,IAAI;gBAAE,SAAS;YAEpB,QAAQ,CAAC,GAAG,CAAC,YAAY,EAAE;gBACzB,KAAK,EAAE,IAAI,CAAC,KAAK;gBACjB,IAAI,EAAE,IAAI,CAAC,IAAI;gBACf,IAAI;aACL,CAAC,CAAC;QACL,CAAC;QAED,OAAO,QAAQ,CAAC;IAClB,CAAC;IAED;;;OAGG;IACH,KAAK,CAAC,aAAa,CAAC,YAAsB;QACxC,qDAAqD;QACrD,MAAM,aAAa,GAAG,MAAM,IAAI,CAAC,iBAAiB,CAAC,YAAY,CAAC,CAAC;QAEjE,iCAAiC;QACjC,MAAM,OAAO,GAAG,UAAU,CAAC,OAAO,CAAC,IAAI,CAAC,cAAc,EAAE,aAAa,CAAC,CAAC;QAEvE,sCAAsC;QACtC,IAAI,OAAO,EAAE,EAAE,CAAC;YACd,OAAO,CAAC,KAAK,CACX,uCAAuC;gBACrC,GAAG,OAAO,CAAC,KAAK,CAAC,MAAM,UAAU;gBACjC,GAAG,OAAO,CAAC,QAAQ,CAAC,MAAM,aAAa;gBACvC,GAAG,OAAO,CAAC,OAAO,CAAC,MAAM,WAAW;gBACpC,SAAS,YAAY,CAAC,MAAM,mBAAmB,IAAI,CAAC,cAAc,CAAC,IAAI,eAAe,CACzF,CAAC;YACF,IAAI,OAAO,CAAC,QAAQ,CAAC,MAAM,GAAG,CAAC,IAAI,OAAO,CAAC,QAAQ,CAAC,MAAM,IAAI,EAAE,EAAE,CAAC;gBACjE,OAAO,CAAC,KAAK,CAAC,sCAAsC,OAAO,CAAC,QAAQ,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;YACrF,CAAC;QACH,CAAC;QAED,OAAO,OAAO,CAAC;IACjB,CAAC;IAED;;;OAGG;IACH,KAAK,CAAC,cAAc,CAAC,KAAe;QAClC,wBAAwB;QACxB,MAAM,QAAQ,GAAG,MAAM,IAAI,CAAC,mBAAmB,CAAC,KAAK,CAAC,CAAC;QAEvD,iBAAiB;QACjB,MAAM,UAAU,GAAG,IAAI,GAAG,EAAkB,CAAC;QAC7C,KAAK,MAAM,CAAC,IAAI,EAAE,IAAI,CAAC,IAAI,QAAQ,EAAE,CAAC;YACpC,UAAU,CAAC,GAAG,CAAC,IAAI,EAAE,IAAI,CAAC,IAAI,CAAC,CAAC;QAClC,CAAC;QAED,oBAAoB;QACpB,MAAM,IAAI,GAAG,IAAI,UAAU,EAAE,CAAC;QAC9B,IAAI,CAAC,KAAK,CAAC,UAAU,CAAC,CAAC;QAEvB,0CAA0C;QAC1C,MAAM,IAAI,CAAC,eAAe,CAAC,IAAI,CAAC,IAAI,CAAC,YAAY,EAAE,UAAU,EAAE,IAAI,EAAE,QAAQ,CAAC,CAAC;QAE/E,wBAAwB;QACxB,IAAI,CAAC,cAAc,GAAG,UAAU,CAAC;QACjC,IAAI,CAAC,gBAAgB,GAAG,QAAQ,CAAC;QACjC,IAAI,CAAC,YAAY,GAAG,IAAI,CAAC;IAC3B,CAAC;IAED;;OAEG;IACH,KAAK,CAAC,cAAc;QAClB,MAAM,IAAI,CAAC,eAAe,CAAC,MAAM,EAAE,CAAC;QACpC,IAAI,CAAC,cAAc,CAAC,KAAK,EAAE,CAAC;QAC5B,IAAI,CAAC,gBAAgB,CAAC,KAAK,EAAE,CAAC;QAC9B,IAAI,CAAC,YAAY,GAAG,IAAI,CAAC;IAC3B,CAAC;IAED;;OAEG;IACH,KAAK,CAAC,WAAW;QACf,OAAO,IAAI,CAAC,eAAe,CAAC,MAAM,EAAE,CAAC;IACvC,CAAC;IAED,+CAA+C;IAE/C;;;OAGG;IACH,KAAK,CAAC,cAAc,CAClB,cAAwB,EACxB,UAAkB,EAClB,QAAiC,UAAU;QAE3C,MAAM,UAAU,GAAe;YAC7B,cAAc;YACd,UAAU;YACV,SAAS,EAAE,IAAI,CAAC,GAAG,EAAE;YACrB,KAAK;SACN,CAAC;QAEF,IAAI,CAAC;YACH,MAAM,GAAG,GAAG,YAAY,EAAE,CAAC;YAC3B,MAAM,EAAE,CAAC,KAAK,CAAC,GAAG,EAAE,EAAE,SAAS,EAAE,IAAI,EAAE,CAAC,CAAC;YAEzC,2DAA2D;YAC3D,MAAM,QAAQ,GAAG,GAAG,IAAI,CAAC,cAAc,MAAM,CAAC;YAC9C,MAAM,EAAE,CAAC,SAAS,CAAC,QAAQ,EAAE,IAAI,CAAC,SAAS,CAAC,UAAU,EAAE,IAAI,EAAE,CAAC,CAAC,CAAC,CAAC;YAClE,MAAM,EAAE,CAAC,MAAM,CAAC,QAAQ,EAAE,IAAI,CAAC,cAAc,CAAC,CAAC;YAE/C,IAAI,OAAO,EAAE,EAAE,CAAC;gBACd,OAAO,CAAC,KAAK,CAAC,uBAAuB,cAAc,CAAC,MAAM,IAAI,UAAU,WAAW,KAAK,GAAG,CAAC,CAAC;YAC/F,CAAC;QACH,CAAC;QAAC,OAAO,KAAK,EAAE,CAAC;YACf,OAAO,CAAC,KAAK,CAAC,8BAA8B,EAAE,KAAK,CAAC,CAAC;YACrD,0CAA0C;QAC5C,CAAC;IACH,CAAC;IAED;;;OAGG;IACH,KAAK,CAAC,cAAc;QAClB,IAAI,CAAC;YACH,MAAM,IAAI,GAAG,MAAM,EAAE,CAAC,QAAQ,CAAC,IAAI,CAAC,cAAc,EAAE,OAAO,CAAC,CAAC;YAC7D,MAAM,UAAU,GAAG,IAAI,CAAC,KAAK,CAAC,IAAI,CAAe,CAAC;YAElD,sBAAsB;YACtB,IAAI,CAAC,UAAU,CAAC,cAAc,IAAI,CAAC,UAAU,CAAC,UAAU,EAAE,CAAC;gBACzD,OAAO,IAAI,CAAC;YACd,CAAC;YAED,8CAA8C;YAC9C,MAAM,MAAM,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,IAAI,CAAC;YACnC,IAAI,IAAI,CAAC,GAAG,EAAE,GAAG,UAAU,CAAC,SAAS,GAAG,MAAM,EAAE,CAAC;gBAC/C,OAAO,CAAC,KAAK,CAAC,iDAAiD,CAAC,CAAC;gBACjE,MAAM,IAAI,CAAC,gBAAgB,EAAE,CAAC;gBAC9B,OAAO,IAAI,CAAC;YACd,CAAC;YAED,OAAO,CAAC,KAAK,CACX,uBAAuB,UAAU,CAAC,cAAc,CAAC,MAAM,IAAI,UAAU,CAAC,UAAU,GAAG;gBACjF,UAAU,UAAU,CAAC,KAAK,GAAG,CAChC,CAAC;YACF,OAAO,UAAU,CAAC;QACpB,CAAC;QAAC,MAAM,CAAC;YACP,OAAO,IAAI,CAAC;QACd,CAAC;IACH,CAAC;IAED;;OAEG;IACH,KAAK,CAAC,gBAAgB;QACpB,IAAI,CAAC;YACH,MAAM,EAAE,CAAC,MAAM,CAAC,IAAI,CAAC,cAAc,CAAC,CAAC;QACvC,CAAC;QAAC,MAAM,CAAC;YACP,8BAA8B;QAChC,CAAC;IACH,CAAC;IAED;;OAEG;IACH,KAAK,CAAC,aAAa;QACjB,IAAI,CAAC;YACH,MAAM,EAAE,CAAC,MAAM,CAAC,IAAI,CAAC,cAAc,CAAC,CAAC;YACrC,OAAO,IAAI,CAAC;QACd,CAAC;QAAC,MAAM,CAAC;YACP,OAAO,KAAK,CAAC;QACf,CAAC;IACH,CAAC;IAED;;OAEG;IACH,oBAAoB,CAAC,QAAkB,EAAE,UAAsB;QAC7D,MAAM,YAAY,GAAG,IAAI,GAAG,CAAC,UAAU,CAAC,cAAc,CAAC,CAAC;QACxD,OAAO,QAAQ,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,YAAY,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;IACtD,CAAC;IAED;;OAEG;IACH,KAAK,CAAC,gBAAgB;QACpB,OAAO,IAAI,CAAC,eAAe,CAAC,QAAQ,EAAE,CAAC;IACzC,CAAC;IAED;;OAEG;IACH,KAAK,CAAC,cAAc;QAClB,MAAM,QAAQ,GAAG,MAAM,IAAI,CAAC,eAAe,CAAC,IAAI,EAAE,CAAC;QACnD,IAAI,CAAC,QAAQ;YAAE,OAAO,IAAI,CAAC;QAE3B,OAAO,IAAI,CAAC,GAAG,EAAE,GAAG,QAAQ,CAAC,SAAS,CAAC;IACzC,CAAC;IAED;;;OAGG;IACH,KAAK,CAAC,YAAY,CAAC,YAAsB;QACvC,IAAI,CAAC,IAAI,CAAC,YAAY;YAAE,OAAO,IAAI,CAAC;QAEpC,MAAM,aAAa,GAAG,MAAM,IAAI,CAAC,iBAAiB,CAAC,YAAY,CAAC,CAAC;QACjE,MAAM,WAAW,GAAG,IAAI,UAAU,EAAE,CAAC;QACrC,WAAW,CAAC,KAAK,CAAC,aAAa,CAAC,CAAC;QAEjC,OAAO,IAAI,CAAC,YAAY,CAAC,WAAW,EAAE,KAAK,WAAW,CAAC,WAAW,EAAE,CAAC;IACvE,CAAC;CACF"}

package/build/core/search/rank-module.d.ts

@@ -0,0 +1,45 @@
+/**
+ * RankModule — scroll-based chunk ranking without vector search.
+ *
+ * Scatter-gather: resolve order_by fields from preset weights → parallel scroll → merge → rerank.
+ */
+import type { DerivedSignalDescriptor, RerankableResult } from "../contracts/types/reranker.js";
+import type { Reranker } from "./reranker.js";
+interface OrderByField {
+    key: string;
+    direction: "asc" | "desc";
+}
+type ScrollFn = (collectionName: string, orderBy: OrderByField, limit: number, filter?: Record<string, unknown>) => Promise<{
+    id: string | number;
+    payload: Record<string, unknown>;
+}[]>;
+type EnsureIndexFn = (collectionName: string, fieldName: string) => Promise<void>;
+export interface RankOptions {
+    weights: Record<string, number>;
+    level: "chunk" | "file";
+    limit: number;
+    scrollFn: ScrollFn;
+    ensureIndexFn?: EnsureIndexFn;
+    filter?: Record<string, unknown>;
+    /** Original preset name — passed to reranker for overlay mask resolution. */
+    presetName?: string;
+}
+export declare class RankModule {
+    private readonly reranker;
+    private readonly descriptors;
+    private readonly descriptorMap;
+    constructor(reranker: Reranker, descriptors: DerivedSignalDescriptor[]);
+    /**
+     * Resolve order_by fields from preset weights + descriptor sources + inverted flag.
+     */
+    resolveOrderByFields(weights: Record<string, number>, level: "chunk" | "file"): OrderByField[];
+    /**
+     * Rank chunks: scatter-gather → merge → rerank → top-N.
+     */
+    rankChunks(collectionName: string, options: RankOptions): Promise<RerankableResult[]>;
+    private resolvePayloadField;
+    private removeAndNormalize;
+    private mergeAndDeduplicate;
+}
+export {};
+//# sourceMappingURL=rank-module.d.ts.map

package/build/core/search/rank-module.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"rank-module.d.ts","sourceRoot":"","sources":["../../../src/core/search/rank-module.ts"],"names":[],"mappings":"AAAA;;;;GAIG;AAEH,OAAO,KAAK,EAAE,uBAAuB,EAAE,gBAAgB,EAAE,MAAM,gCAAgC,CAAC;AAChG,OAAO,KAAK,EAAE,QAAQ,EAAE,MAAM,eAAe,CAAC;AAE9C,UAAU,YAAY;IACpB,GAAG,EAAE,MAAM,CAAC;IACZ,SAAS,EAAE,KAAK,GAAG,MAAM,CAAC;CAC3B;AAED,KAAK,QAAQ,GAAG,CACd,cAAc,EAAE,MAAM,EACtB,OAAO,EAAE,YAAY,EACrB,KAAK,EAAE,MAAM,EACb,MAAM,CAAC,EAAE,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,KAC7B,OAAO,CAAC;IAAE,EAAE,EAAE,MAAM,GAAG,MAAM,CAAC;IAAC,OAAO,EAAE,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,CAAA;CAAE,EAAE,CAAC,CAAC;AAE1E,KAAK,aAAa,GAAG,CAAC,cAAc,EAAE,MAAM,EAAE,SAAS,EAAE,MAAM,KAAK,OAAO,CAAC,IAAI,CAAC,CAAC;AAElF,MAAM,WAAW,WAAW;IAC1B,OAAO,EAAE,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;IAChC,KAAK,EAAE,OAAO,GAAG,MAAM,CAAC;IACxB,KAAK,EAAE,MAAM,CAAC;IACd,QAAQ,EAAE,QAAQ,CAAC;IACnB,aAAa,CAAC,EAAE,aAAa,CAAC;IAC9B,MAAM,CAAC,EAAE,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,CAAC;IACjC,6EAA6E;IAC7E,UAAU,CAAC,EAAE,MAAM,CAAC;CACrB;AAID,qBAAa,UAAU;IAInB,OAAO,CAAC,QAAQ,CAAC,QAAQ;IACzB,OAAO,CAAC,QAAQ,CAAC,WAAW;IAJ9B,OAAO,CAAC,QAAQ,CAAC,aAAa,CAAuC;gBAGlD,QAAQ,EAAE,QAAQ,EAClB,WAAW,EAAE,uBAAuB,EAAE;IAQzD;;OAEG;IACH,oBAAoB,CAAC,OAAO,EAAE,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,EAAE,KAAK,EAAE,OAAO,GAAG,MAAM,GAAG,YAAY,EAAE;IAqB9F;;OAEG;IACG,UAAU,CAAC,cAAc,EAAE,MAAM,EAAE,OAAO,EAAE,WAAW,GAAG,OAAO,CAAC,gBAAgB,EAAE,CAAC;IA0C3F,OAAO,CAAC,mBAAmB;IAa3B,OAAO,CAAC,kBAAkB;IAmB1B,OAAO,CAAC,mBAAmB;CAgB5B"}

package/build/core/search/rank-module.js

@@ -0,0 +1,115 @@
+/**
+ * RankModule — scroll-based chunk ranking without vector search.
+ *
+ * Scatter-gather: resolve order_by fields from preset weights → parallel scroll → merge → rerank.
+ */
+const OVERFETCH_FACTOR = 3;
+export class RankModule {
+    reranker;
+    descriptors;
+    descriptorMap;
+    constructor(reranker, descriptors) {
+        this.reranker = reranker;
+        this.descriptors = descriptors;
+        this.descriptorMap = new Map();
+        for (const d of descriptors) {
+            this.descriptorMap.set(d.name, d);
+        }
+    }
+    /**
+     * Resolve order_by fields from preset weights + descriptor sources + inverted flag.
+     */
+    resolveOrderByFields(weights, level) {
+        const fields = [];
+        for (const [key, weight] of Object.entries(weights)) {
+            if (key === "similarity" || !weight)
+                continue;
+            const desc = this.descriptorMap.get(key);
+            if (!desc)
+                continue;
+            const payloadField = this.resolvePayloadField(desc.sources, level);
+            if (!payloadField)
+                continue;
+            fields.push({
+                key: payloadField,
+                direction: desc.inverted ? "asc" : "desc",
+            });
+        }
+        return fields;
+    }
+    /**
+     * Rank chunks: scatter-gather → merge → rerank → top-N.
+     */
+    async rankChunks(collectionName, options) {
+        const { weights, level, limit, scrollFn, ensureIndexFn, filter, presetName } = options;
+        // Remove similarity and re-normalize
+        const cleanWeights = this.removeAndNormalize(weights);
+        // Resolve order_by fields
+        const orderByFields = this.resolveOrderByFields(cleanWeights, level);
+        if (orderByFields.length === 0)
+            return [];
+        // Ensure payload indexes exist for order_by fields (Qdrant requires range index)
+        if (ensureIndexFn) {
+            await Promise.all(orderByFields.map(async (field) => ensureIndexFn(collectionName, field.key)));
+        }
+        // Parallel scroll (scatter)
+        const fetchLimit = limit * OVERFETCH_FACTOR;
+        const scrollResults = await Promise.all(orderByFields.map(async (field) => scrollFn(collectionName, field, fetchLimit, filter)));
+        // Merge + deduplicate (gather)
+        const merged = this.mergeAndDeduplicate(scrollResults);
+        if (merged.length === 0)
+            return [];
+        // Convert to RerankableResult (score=0, no similarity)
+        const rerankable = merged.map((p) => ({
+            score: 0,
+            payload: p.payload,
+        }));
+        // Rerank: use cleaned weights (no similarity) with preset overlay mask
+        const rerankMode = presetName
+            ? { custom: cleanWeights, preset: presetName }
+            : { custom: cleanWeights };
+        const reranked = this.reranker.rerank(rerankable, rerankMode, "rank_chunks");
+        return reranked.slice(0, limit);
+    }
+    // -- Private --
+    resolvePayloadField(sources, level) {
+        // 1. Try level-prefixed source (e.g. "chunk.commitCount" → "git.chunk.commitCount")
+        const levelSource = sources.find((s) => s.startsWith(`${level}.`));
+        if (levelSource)
+            return `git.${levelSource}`;
+        // 2. Try unprefixed source (e.g. "methodLines")
+        const unprefixed = sources.find((s) => !s.includes("."));
+        if (unprefixed)
+            return unprefixed;
+        // 3. Fallback: first source with git prefix
+        return sources[0] ? `git.${sources[0]}` : undefined;
+    }
+    removeAndNormalize(weights) {
+        const clean = {};
+        let total = 0;
+        for (const [key, weight] of Object.entries(weights)) {
+            if (key === "similarity" || !weight)
+                continue;
+            clean[key] = weight;
+            total += weight;
+        }
+        if (total === 0)
+            return clean;
+        for (const key of Object.keys(clean)) {
+            clean[key] = clean[key] / total;
+        }
+        return clean;
+    }
+    mergeAndDeduplicate(scrollResults) {
+        const seen = new Map();
+        for (const results of scrollResults) {
+            for (const point of results) {
+                if (!seen.has(point.id)) {
+                    seen.set(point.id, point);
+                }
+            }
+        }
+        return [...seen.values()];
+    }
+}
+//# sourceMappingURL=rank-module.js.map

package/build/core/search/rank-module.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"rank-module.js","sourceRoot":"","sources":["../../../src/core/search/rank-module.ts"],"names":[],"mappings":"AAAA;;;;GAIG;AA8BH,MAAM,gBAAgB,GAAG,CAAC,CAAC;AAE3B,MAAM,OAAO,UAAU;IAIF;IACA;IAJF,aAAa,CAAuC;IAErE,YACmB,QAAkB,EAClB,WAAsC;QADtC,aAAQ,GAAR,QAAQ,CAAU;QAClB,gBAAW,GAAX,WAAW,CAA2B;QAEvD,IAAI,CAAC,aAAa,GAAG,IAAI,GAAG,EAAE,CAAC;QAC/B,KAAK,MAAM,CAAC,IAAI,WAAW,EAAE,CAAC;YAC5B,IAAI,CAAC,aAAa,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC;QACpC,CAAC;IACH,CAAC;IAED;;OAEG;IACH,oBAAoB,CAAC,OAA+B,EAAE,KAAuB;QAC3E,MAAM,MAAM,GAAmB,EAAE,CAAC;QAElC,KAAK,MAAM,CAAC,GAAG,EAAE,MAAM,CAAC,IAAI,MAAM,CAAC,OAAO,CAAC,OAAO,CAAC,EAAE,CAAC;YACpD,IAAI,GAAG,KAAK,YAAY,IAAI,CAAC,MAAM;gBAAE,SAAS;YAE9C,MAAM,IAAI,GAAG,IAAI,CAAC,aAAa,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;YACzC,IAAI,CAAC,IAAI;gBAAE,SAAS;YAEpB,MAAM,YAAY,GAAG,IAAI,CAAC,mBAAmB,CAAC,IAAI,CAAC,OAAO,EAAE,KAAK,CAAC,CAAC;YACnE,IAAI,CAAC,YAAY;gBAAE,SAAS;YAE5B,MAAM,CAAC,IAAI,CAAC;gBACV,GAAG,EAAE,YAAY;gBACjB,SAAS,EAAE,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,MAAM;aAC1C,CAAC,CAAC;QACL,CAAC;QAED,OAAO,MAAM,CAAC;IAChB,CAAC;IAED;;OAEG;IACH,KAAK,CAAC,UAAU,CAAC,cAAsB,EAAE,OAAoB;QAC3D,MAAM,EAAE,OAAO,EAAE,KAAK,EAAE,KAAK,EAAE,QAAQ,EAAE,aAAa,EAAE,MAAM,EAAE,UAAU,EAAE,GAAG,OAAO,CAAC;QAEvF,qCAAqC;QACrC,MAAM,YAAY,GAAG,IAAI,CAAC,kBAAkB,CAAC,OAAO,CAAC,CAAC;QAEtD,0BAA0B;QAC1B,MAAM,aAAa,GAAG,IAAI,CAAC,oBAAoB,CAAC,YAAY,EAAE,KAAK,CAAC,CAAC;QACrE,IAAI,aAAa,CAAC,MAAM,KAAK,CAAC;YAAE,OAAO,EAAE,CAAC;QAE1C,iFAAiF;QACjF,IAAI,aAAa,EAAE,CAAC;YAClB,MAAM,OAAO,CAAC,GAAG,CAAC,aAAa,CAAC,GAAG,CAAC,KAAK,EAAE,KAAK,EAAE,EAAE,CAAC,aAAa,CAAC,cAAc,EAAE,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QAClG,CAAC;QAED,4BAA4B;QAC5B,MAAM,UAAU,GAAG,KAAK,GAAG,gBAAgB,CAAC;QAC5C,MAAM,aAAa,GAAG,MAAM,OAAO,CAAC,GAAG,CACrC,aAAa,CAAC,GAAG,CAAC,KAAK,EAAE,KAAK,EAAE,EAAE,CAAC,QAAQ,CAAC,cAAc,EAAE,KAAK,EAAE,UAAU,EAAE,MAAM,CAAC,CAAC,CACxF,CAAC;QAEF,+BAA+B;QAC/B,MAAM,MAAM,GAAG,IAAI,CAAC,mBAAmB,CAAC,aAAa,CAAC,CAAC;QACvD,IAAI,MAAM,CAAC,MAAM,KAAK,CAAC;YAAE,OAAO,EAAE,CAAC;QAEnC,uDAAuD;QACvD,MAAM,UAAU,GAAuB,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC;YACxD,KAAK,EAAE,CAAC;YACR,OAAO,EAAE,CAAC,CAAC,OAAO;SACnB,CAAC,CAAC,CAAC;QAEJ,uEAAuE;QACvE,MAAM,UAAU,GAAG,UAAU;YAC3B,CAAC,CAAC,EAAE,MAAM,EAAE,YAAY,EAAE,MAAM,EAAE,UAAU,EAAE;YAC9C,CAAC,CAAC,EAAE,MAAM,EAAE,YAAY,EAAE,CAAC;QAC7B,MAAM,QAAQ,GAAG,IAAI,CAAC,QAAQ,CAAC,MAAM,CAAC,UAAU,EAAE,UAAU,EAAE,aAAa,CAAC,CAAC;QAE7E,OAAO,QAAQ,CAAC,KAAK,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC;IAClC,CAAC;IAED,gBAAgB;IAER,mBAAmB,CAAC,OAAiB,EAAE,KAAuB;QACpE,oFAAoF;QACpF,MAAM,WAAW,GAAG,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,UAAU,CAAC,GAAG,KAAK,GAAG,CAAC,CAAC,CAAC;QACnE,IAAI,WAAW;YAAE,OAAO,OAAO,WAAW,EAAE,CAAC;QAE7C,gDAAgD;QAChD,MAAM,UAAU,GAAG,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC;QACzD,IAAI,UAAU;YAAE,OAAO,UAAU,CAAC;QAElC,4CAA4C;QAC5C,OAAO,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,OAAO,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,SAAS,CAAC;IACtD,CAAC;IAEO,kBAAkB,CAAC,OAA+B;QACxD,MAAM,KAAK,GAA2B,EAAE,CAAC;QACzC,IAAI,KAAK,GAAG,CAAC,CAAC;QAEd,KAAK,MAAM,CAAC,GAAG,EAAE,MAAM,CAAC,IAAI,MAAM,CAAC,OAAO,CAAC,OAAO,CAAC,EAAE,CAAC;YACpD,IAAI,GAAG,KAAK,YAAY,IAAI,CAAC,MAAM;gBAAE,SAAS;YAC9C,KAAK,CAAC,GAAG,CAAC,GAAG,MAAM,CAAC;YACpB,KAAK,IAAI,MAAM,CAAC;QAClB,CAAC;QAED,IAAI,KAAK,KAAK,CAAC;YAAE,OAAO,KAAK,CAAC;QAE9B,KAAK,MAAM,GAAG,IAAI,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC;YACrC,KAAK,CAAC,GAAG,CAAC,GAAG,KAAK,CAAC,GAAG,CAAC,GAAG,KAAK,CAAC;QAClC,CAAC;QAED,OAAO,KAAK,CAAC;IACf,CAAC;IAEO,mBAAmB,CACzB,aAA4E;QAE5E,MAAM,IAAI,GAAG,IAAI,GAAG,EAA8E,CAAC;QAEnG,KAAK,MAAM,OAAO,IAAI,aAAa,EAAE,CAAC;YACpC,KAAK,MAAM,KAAK,IAAI,OAAO,EAAE,CAAC;gBAC5B,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,CAAC,EAAE,CAAC;oBACxB,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,EAAE,KAAK,CAAC,CAAC;gBAC5B,CAAC;YACH,CAAC;QACH,CAAC;QAED,OAAO,CAAC,GAAG,IAAI,CAAC,MAAM,EAAE,CAAC,CAAC;IAC5B,CAAC;CAEF"}

package/build/core/search/rerank/presets/index.d.ts

@@ -0,0 +1,21 @@
+/**
+ * Preset resolution infrastructure — merges presets from 2-level hierarchy:
+ *   1. Registry presets (from all registered trajectories)
+ *   2. Composite (future — combines multiple trajectories, overrides by key)
+ *
+ * Resolution rule: later levels override earlier by (name, tool) key.
+ */
+import type { ScoringWeights } from "../../../contracts/types/provider.js";
+import type { RerankPreset } from "../../../contracts/types/reranker.js";
+export type { RerankPreset } from "../../../contracts/types/reranker.js";
+/**
+ * Resolve presets by 2-level hierarchy: registry -> composite.
+ * Later levels override earlier by (name, tool) key.
+ * Multi-tool presets are indexed for each tool they support.
+ */
+export declare function resolvePresets(registry: RerankPreset[], composite: RerankPreset[]): RerankPreset[];
+/** Get preset names for a specific tool. */
+export declare function getPresetNames(presets: RerankPreset[], tool: string): string[];
+/** Get preset weights by name + tool. */
+export declare function getPresetWeights(presets: RerankPreset[], name: string, tool: string): ScoringWeights | undefined;
+//# sourceMappingURL=index.d.ts.map

package/build/core/search/rerank/presets/index.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../../../../src/core/search/rerank/presets/index.ts"],"names":[],"mappings":"AAAA;;;;;;GAMG;AAEH,OAAO,KAAK,EAAE,cAAc,EAAE,MAAM,sCAAsC,CAAC;AAC3E,OAAO,KAAK,EAAE,YAAY,EAAE,MAAM,sCAAsC,CAAC;AAEzE,YAAY,EAAE,YAAY,EAAE,MAAM,sCAAsC,CAAC;AAEzE;;;;GAIG;AACH,wBAAgB,cAAc,CAAC,QAAQ,EAAE,YAAY,EAAE,EAAE,SAAS,EAAE,YAAY,EAAE,GAAG,YAAY,EAAE,CAQlG;AAED,4CAA4C;AAC5C,wBAAgB,cAAc,CAAC,OAAO,EAAE,YAAY,EAAE,EAAE,IAAI,EAAE,MAAM,GAAG,MAAM,EAAE,CAE9E;AAED,yCAAyC;AACzC,wBAAgB,gBAAgB,CAAC,OAAO,EAAE,YAAY,EAAE,EAAE,IAAI,EAAE,MAAM,EAAE,IAAI,EAAE,MAAM,GAAG,cAAc,GAAG,SAAS,CAEhH"}

package/build/core/search/rerank/presets/index.js

@@ -0,0 +1,30 @@
+/**
+ * Preset resolution infrastructure — merges presets from 2-level hierarchy:
+ *   1. Registry presets (from all registered trajectories)
+ *   2. Composite (future — combines multiple trajectories, overrides by key)
+ *
+ * Resolution rule: later levels override earlier by (name, tool) key.
+ */
+/**
+ * Resolve presets by 2-level hierarchy: registry -> composite.
+ * Later levels override earlier by (name, tool) key.
+ * Multi-tool presets are indexed for each tool they support.
+ */
+export function resolvePresets(registry, composite) {
+    const map = new Map();
+    for (const preset of [...registry, ...composite]) {
+        for (const t of preset.tools) {
+            map.set(`${t}:${preset.name}`, preset);
+        }
+    }
+    return [...new Set(map.values())];
+}
+/** Get preset names for a specific tool. */
+export function getPresetNames(presets, tool) {
+    return presets.filter((p) => p.tools.includes(tool)).map((p) => p.name);
+}
+/** Get preset weights by name + tool. */
+export function getPresetWeights(presets, name, tool) {
+    return presets.find((p) => p.name === name && p.tools.includes(tool))?.weights;
+}
+//# sourceMappingURL=index.js.map

package/build/core/search/rerank/presets/index.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.js","sourceRoot":"","sources":["../../../../../src/core/search/rerank/presets/index.ts"],"names":[],"mappings":"AAAA;;;;;;GAMG;AAOH;;;;GAIG;AACH,MAAM,UAAU,cAAc,CAAC,QAAwB,EAAE,SAAyB;IAChF,MAAM,GAAG,GAAG,IAAI,GAAG,EAAwB,CAAC;IAC5C,KAAK,MAAM,MAAM,IAAI,CAAC,GAAG,QAAQ,EAAE,GAAG,SAAS,CAAC,EAAE,CAAC;QACjD,KAAK,MAAM,CAAC,IAAI,MAAM,CAAC,KAAK,EAAE,CAAC;YAC7B,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,IAAI,MAAM,CAAC,IAAI,EAAE,EAAE,MAAM,CAAC,CAAC;QACzC,CAAC;IACH,CAAC;IACD,OAAO,CAAC,GAAG,IAAI,GAAG,CAAC,GAAG,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC;AACpC,CAAC;AAED,4CAA4C;AAC5C,MAAM,UAAU,cAAc,CAAC,OAAuB,EAAE,IAAY;IAClE,OAAO,OAAO,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,KAAK,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;AAC1E,CAAC;AAED,yCAAyC;AACzC,MAAM,UAAU,gBAAgB,CAAC,OAAuB,EAAE,IAAY,EAAE,IAAY;IAClF,OAAO,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,KAAK,IAAI,IAAI,CAAC,CAAC,KAAK,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC,EAAE,OAAO,CAAC;AACjF,CAAC"}