bigtool-ts 0.1.0

package/dist/search/cache.d.ts

@@ -0,0 +1,76 @@
+/**
+ * Embedding Cache Implementations
+ *
+ * Caches computed embeddings to avoid expensive recomputation.
+ * Embeddings are relatively stable - tool descriptions don't change often.
+ */
+import type { EmbeddingCache } from "./types.js";
+/**
+ * Simple in-memory cache using a Map.
+ * Good for development and single-process deployments.
+ * Cache is lost on process restart.
+ */
+export declare class MemoryCache implements EmbeddingCache {
+    private cache;
+    constructor();
+    get(toolId: string): Promise<number[] | null>;
+    set(toolId: string, embedding: number[]): Promise<void>;
+    invalidate(toolId: string): Promise<void>;
+    clear(): Promise<void>;
+    /**
+     * Get the current size of the cache
+     */
+    get size(): number;
+    /**
+     * Check if a tool ID exists in cache
+     */
+    has(toolId: string): boolean;
+    /**
+     * Get all cached tool IDs
+     */
+    keys(): string[];
+}
+/**
+ * LRU (Least Recently Used) cache with configurable max size.
+ * Automatically evicts oldest entries when capacity is reached.
+ */
+export declare class LRUCache implements EmbeddingCache {
+    private cache;
+    private readonly maxSize;
+    constructor(maxSize?: number);
+    get(toolId: string): Promise<number[] | null>;
+    set(toolId: string, embedding: number[]): Promise<void>;
+    invalidate(toolId: string): Promise<void>;
+    clear(): Promise<void>;
+    /**
+     * Get the current size of the cache
+     */
+    get size(): number;
+}
+/**
+ * Configuration for Redis cache
+ */
+export interface RedisCacheConfig {
+    /** Redis connection URL */
+    url: string;
+    /** Key prefix for namespacing (default: "bigtool:embeddings:") */
+    prefix?: string;
+    /** TTL in seconds (default: no expiry) */
+    ttl?: number;
+}
+/**
+ * Redis-based cache for production deployments.
+ *
+ * NOTE: This is a stub implementation. To use Redis caching,
+ * install the `redis` package and implement the actual Redis client.
+ */
+export declare class RedisCache implements EmbeddingCache {
+    private readonly config;
+    private memoryFallback;
+    constructor(config: RedisCacheConfig);
+    get(toolId: string): Promise<number[] | null>;
+    set(toolId: string, embedding: number[]): Promise<void>;
+    invalidate(toolId: string): Promise<void>;
+    clear(): Promise<void>;
+}
+//# sourceMappingURL=cache.d.ts.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"cache.d.ts","sourceRoot":"","sources":["../../src/search/cache.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;AAEH,OAAO,KAAK,EAAE,cAAc,EAAE,MAAM,YAAY,CAAC;AAMjD;;;;GAIG;AACH,qBAAa,WAAY,YAAW,cAAc;IAChD,OAAO,CAAC,KAAK,CAAwB;;IAM/B,GAAG,CAAC,MAAM,EAAE,MAAM,GAAG,OAAO,CAAC,MAAM,EAAE,GAAG,IAAI,CAAC;IAK7C,GAAG,CAAC,MAAM,EAAE,MAAM,EAAE,SAAS,EAAE,MAAM,EAAE,GAAG,OAAO,CAAC,IAAI,CAAC;IAIvD,UAAU,CAAC,MAAM,EAAE,MAAM,GAAG,OAAO,CAAC,IAAI,CAAC;IAIzC,KAAK,IAAI,OAAO,CAAC,IAAI,CAAC;IAI5B;;OAEG;IACH,IAAI,IAAI,IAAI,MAAM,CAEjB;IAED;;OAEG;IACH,GAAG,CAAC,MAAM,EAAE,MAAM,GAAG,OAAO;IAI5B;;OAEG;IACH,IAAI,IAAI,MAAM,EAAE;CAGjB;AAMD;;;GAGG;AACH,qBAAa,QAAS,YAAW,cAAc;IAC7C,OAAO,CAAC,KAAK,CAAwB;IACrC,OAAO,CAAC,QAAQ,CAAC,OAAO,CAAS;gBAErB,OAAO,GAAE,MAAa;IAK5B,GAAG,CAAC,MAAM,EAAE,MAAM,GAAG,OAAO,CAAC,MAAM,EAAE,GAAG,IAAI,CAAC;IAW7C,GAAG,CAAC,MAAM,EAAE,MAAM,EAAE,SAAS,EAAE,MAAM,EAAE,GAAG,OAAO,CAAC,IAAI,CAAC;IAevD,UAAU,CAAC,MAAM,EAAE,MAAM,GAAG,OAAO,CAAC,IAAI,CAAC;IAIzC,KAAK,IAAI,OAAO,CAAC,IAAI,CAAC;IAI5B;;OAEG;IACH,IAAI,IAAI,IAAI,MAAM,CAEjB;CACF;AAMD;;GAEG;AACH,MAAM,WAAW,gBAAgB;IAC/B,2BAA2B;IAC3B,GAAG,EAAE,MAAM,CAAC;IACZ,kEAAkE;IAClE,MAAM,CAAC,EAAE,MAAM,CAAC;IAChB,0CAA0C;IAC1C,GAAG,CAAC,EAAE,MAAM,CAAC;CACd;AAED;;;;;GAKG;AACH,qBAAa,UAAW,YAAW,cAAc;IAC/C,OAAO,CAAC,QAAQ,CAAC,MAAM,CAA6B;IACpD,OAAO,CAAC,cAAc,CAAc;gBAExB,MAAM,EAAE,gBAAgB;IAa9B,GAAG,CAAC,MAAM,EAAE,MAAM,GAAG,OAAO,CAAC,MAAM,EAAE,GAAG,IAAI,CAAC;IAI7C,GAAG,CAAC,MAAM,EAAE,MAAM,EAAE,SAAS,EAAE,MAAM,EAAE,GAAG,OAAO,CAAC,IAAI,CAAC;IAIvD,UAAU,CAAC,MAAM,EAAE,MAAM,GAAG,OAAO,CAAC,IAAI,CAAC;IAIzC,KAAK,IAAI,OAAO,CAAC,IAAI,CAAC;CAG7B"}

package/dist/search/cache.js

@@ -0,0 +1,135 @@
+/**
+ * Embedding Cache Implementations
+ *
+ * Caches computed embeddings to avoid expensive recomputation.
+ * Embeddings are relatively stable - tool descriptions don't change often.
+ */
+// ═══════════════════════════════════════════════════════════════════════════
+// Memory Cache - In-memory Map-based cache
+// ═══════════════════════════════════════════════════════════════════════════
+/**
+ * Simple in-memory cache using a Map.
+ * Good for development and single-process deployments.
+ * Cache is lost on process restart.
+ */
+export class MemoryCache {
+    cache;
+    constructor() {
+        this.cache = new Map();
+    }
+    async get(toolId) {
+        const embedding = this.cache.get(toolId);
+        return embedding ?? null;
+    }
+    async set(toolId, embedding) {
+        this.cache.set(toolId, embedding);
+    }
+    async invalidate(toolId) {
+        this.cache.delete(toolId);
+    }
+    async clear() {
+        this.cache.clear();
+    }
+    /**
+     * Get the current size of the cache
+     */
+    get size() {
+        return this.cache.size;
+    }
+    /**
+     * Check if a tool ID exists in cache
+     */
+    has(toolId) {
+        return this.cache.has(toolId);
+    }
+    /**
+     * Get all cached tool IDs
+     */
+    keys() {
+        return Array.from(this.cache.keys());
+    }
+}
+// ═══════════════════════════════════════════════════════════════════════════
+// LRU Cache - Memory cache with size limit
+// ═══════════════════════════════════════════════════════════════════════════
+/**
+ * LRU (Least Recently Used) cache with configurable max size.
+ * Automatically evicts oldest entries when capacity is reached.
+ */
+export class LRUCache {
+    cache;
+    maxSize;
+    constructor(maxSize = 1000) {
+        this.cache = new Map();
+        this.maxSize = maxSize;
+    }
+    async get(toolId) {
+        const embedding = this.cache.get(toolId);
+        if (embedding !== undefined) {
+            // Move to end (most recently used)
+            this.cache.delete(toolId);
+            this.cache.set(toolId, embedding);
+            return embedding;
+        }
+        return null;
+    }
+    async set(toolId, embedding) {
+        // If key exists, delete it first to update position
+        if (this.cache.has(toolId)) {
+            this.cache.delete(toolId);
+        }
+        // Evict oldest entries if at capacity
+        while (this.cache.size >= this.maxSize) {
+            const oldest = this.cache.keys().next().value;
+            if (oldest !== undefined) {
+                this.cache.delete(oldest);
+            }
+        }
+        this.cache.set(toolId, embedding);
+    }
+    async invalidate(toolId) {
+        this.cache.delete(toolId);
+    }
+    async clear() {
+        this.cache.clear();
+    }
+    /**
+     * Get the current size of the cache
+     */
+    get size() {
+        return this.cache.size;
+    }
+}
+/**
+ * Redis-based cache for production deployments.
+ *
+ * NOTE: This is a stub implementation. To use Redis caching,
+ * install the `redis` package and implement the actual Redis client.
+ */
+export class RedisCache {
+    config;
+    memoryFallback;
+    constructor(config) {
+        this.config = {
+            url: config.url,
+            prefix: config.prefix ?? "bigtool:embeddings:",
+            ttl: config.ttl ?? 0,
+        };
+        // Use memory fallback until Redis is actually implemented
+        this.memoryFallback = new MemoryCache();
+        console.warn("[RedisCache] Using memory fallback. Install 'redis' package and implement client for production use.");
+    }
+    async get(toolId) {
+        return this.memoryFallback.get(toolId);
+    }
+    async set(toolId, embedding) {
+        return this.memoryFallback.set(toolId, embedding);
+    }
+    async invalidate(toolId) {
+        return this.memoryFallback.invalidate(toolId);
+    }
+    async clear() {
+        return this.memoryFallback.clear();
+    }
+}
+//# sourceMappingURL=cache.js.map

package/dist/search/cache.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"cache.js","sourceRoot":"","sources":["../../src/search/cache.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;AAIH,8EAA8E;AAC9E,2CAA2C;AAC3C,8EAA8E;AAE9E;;;;GAIG;AACH,MAAM,OAAO,WAAW;IACd,KAAK,CAAwB;IAErC;QACE,IAAI,CAAC,KAAK,GAAG,IAAI,GAAG,EAAE,CAAC;IACzB,CAAC;IAED,KAAK,CAAC,GAAG,CAAC,MAAc;QACtB,MAAM,SAAS,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;QACzC,OAAO,SAAS,IAAI,IAAI,CAAC;IAC3B,CAAC;IAED,KAAK,CAAC,GAAG,CAAC,MAAc,EAAE,SAAmB;QAC3C,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,MAAM,EAAE,SAAS,CAAC,CAAC;IACpC,CAAC;IAED,KAAK,CAAC,UAAU,CAAC,MAAc;QAC7B,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC;IAC5B,CAAC;IAED,KAAK,CAAC,KAAK;QACT,IAAI,CAAC,KAAK,CAAC,KAAK,EAAE,CAAC;IACrB,CAAC;IAED;;OAEG;IACH,IAAI,IAAI;QACN,OAAO,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC;IACzB,CAAC;IAED;;OAEG;IACH,GAAG,CAAC,MAAc;QAChB,OAAO,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;IAChC,CAAC;IAED;;OAEG;IACH,IAAI;QACF,OAAO,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,IAAI,EAAE,CAAC,CAAC;IACvC,CAAC;CACF;AAED,8EAA8E;AAC9E,2CAA2C;AAC3C,8EAA8E;AAE9E;;;GAGG;AACH,MAAM,OAAO,QAAQ;IACX,KAAK,CAAwB;IACpB,OAAO,CAAS;IAEjC,YAAY,UAAkB,IAAI;QAChC,IAAI,CAAC,KAAK,GAAG,IAAI,GAAG,EAAE,CAAC;QACvB,IAAI,CAAC,OAAO,GAAG,OAAO,CAAC;IACzB,CAAC;IAED,KAAK,CAAC,GAAG,CAAC,MAAc;QACtB,MAAM,SAAS,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;QACzC,IAAI,SAAS,KAAK,SAAS,EAAE,CAAC;YAC5B,mCAAmC;YACnC,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC;YAC1B,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,MAAM,EAAE,SAAS,CAAC,CAAC;YAClC,OAAO,SAAS,CAAC;QACnB,CAAC;QACD,OAAO,IAAI,CAAC;IACd,CAAC;IAED,KAAK,CAAC,GAAG,CAAC,MAAc,EAAE,SAAmB;QAC3C,oDAAoD;QACpD,IAAI,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,MAAM,CAAC,EAAE,CAAC;YAC3B,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC;QAC5B,CAAC;QACD,sCAAsC;QACtC,OAAO,IAAI,CAAC,KAAK,CAAC,IAAI,IAAI,IAAI,CAAC,OAAO,EAAE,CAAC;YACvC,MAAM,MAAM,GAAG,IAAI,CAAC,KAAK,CAAC,IAAI,EAAE,CAAC,IAAI,EAAE,CAAC,KAAK,CAAC;YAC9C,IAAI,MAAM,KAAK,SAAS,EAAE,CAAC;gBACzB,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC;YAC5B,CAAC;QACH,CAAC;QACD,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,MAAM,EAAE,SAAS,CAAC,CAAC;IACpC,CAAC;IAED,KAAK,CAAC,UAAU,CAAC,MAAc;QAC7B,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC;IAC5B,CAAC;IAED,KAAK,CAAC,KAAK;QACT,IAAI,CAAC,KAAK,CAAC,KAAK,EAAE,CAAC;IACrB,CAAC;IAED;;OAEG;IACH,IAAI,IAAI;QACN,OAAO,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC;IACzB,CAAC;CACF;AAkBD;;;;;GAKG;AACH,MAAM,OAAO,UAAU;IACJ,MAAM,CAA6B;IAC5C,cAAc,CAAc;IAEpC,YAAY,MAAwB;QAClC,IAAI,CAAC,MAAM,GAAG;YACZ,GAAG,EAAE,MAAM,CAAC,GAAG;YACf,MAAM,EAAE,MAAM,CAAC,MAAM,IAAI,qBAAqB;YAC9C,GAAG,EAAE,MAAM,CAAC,GAAG,IAAI,CAAC;SACrB,CAAC;QACF,0DAA0D;QAC1D,IAAI,CAAC,cAAc,GAAG,IAAI,WAAW,EAAE,CAAC;QACxC,OAAO,CAAC,IAAI,CACV,sGAAsG,CACvG,CAAC;IACJ,CAAC;IAED,KAAK,CAAC,GAAG,CAAC,MAAc;QACtB,OAAO,IAAI,CAAC,cAAc,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;IACzC,CAAC;IAED,KAAK,CAAC,GAAG,CAAC,MAAc,EAAE,SAAmB;QAC3C,OAAO,IAAI,CAAC,cAAc,CAAC,GAAG,CAAC,MAAM,EAAE,SAAS,CAAC,CAAC;IACpD,CAAC;IAED,KAAK,CAAC,UAAU,CAAC,MAAc;QAC7B,OAAO,IAAI,CAAC,cAAc,CAAC,UAAU,CAAC,MAAM,CAAC,CAAC;IAChD,CAAC;IAED,KAAK,CAAC,KAAK;QACT,OAAO,IAAI,CAAC,cAAc,CAAC,KAAK,EAAE,CAAC;IACrC,CAAC;CACF"}

package/dist/search/index.d.ts

@@ -0,0 +1,63 @@
+import type { SearchIndex, SearchOptions, SearchResult, ToolMetadata } from '../types.js';
+/**
+ * Configuration for Orama-based search
+ */
+export interface OramaSearchConfig {
+    /** Search mode */
+    mode: 'bm25' | 'vector' | 'hybrid';
+    /** Embeddings provider (required for vector/hybrid modes) */
+    embeddings?: unknown;
+    /** Field boosting for BM25/hybrid */
+    boost?: {
+        name?: number;
+        description?: number;
+        keywords?: number;
+        categories?: number;
+    };
+    /** Weights for hybrid mode */
+    weights?: {
+        bm25?: number;
+        vector?: number;
+    };
+    /** Embedding cache */
+    cache?: unknown;
+}
+/**
+ * Default search implementation using @orama/orama for BM25 search.
+ *
+ * Supports three modes:
+ * - 'bm25': Fast text search (default, no API keys needed)
+ * - 'vector': Semantic search using embeddings
+ * - 'hybrid': Combination of BM25 and vector search
+ *
+ * @example
+ * ```typescript
+ * // BM25 mode (default)
+ * const search = new OramaSearch();
+ *
+ * // Vector mode
+ * const search = new OramaSearch({
+ *   mode: 'vector',
+ *   embeddings: new OpenAIEmbeddings(),
+ * });
+ *
+ * // Hybrid mode
+ * const search = new OramaSearch({
+ *   mode: 'hybrid',
+ *   embeddings: new OpenAIEmbeddings(),
+ *   weights: { bm25: 0.5, vector: 0.5 },
+ * });
+ * ```
+ */
+export declare class OramaSearch implements SearchIndex {
+    private config;
+    private tools;
+    private initialized;
+    constructor(config?: Partial<OramaSearchConfig>);
+    index(tools: ToolMetadata[]): Promise<void>;
+    search(query: string, options?: SearchOptions): Promise<SearchResult[]>;
+    reindex(): Promise<void>;
+    /** Get current configuration */
+    getConfig(): OramaSearchConfig;
+}
+//# sourceMappingURL=index.d.ts.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../src/search/index.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,WAAW,EAAE,aAAa,EAAE,YAAY,EAAE,YAAY,EAAE,MAAM,aAAa,CAAC;AAE1F;;GAEG;AACH,MAAM,WAAW,iBAAiB;IAChC,kBAAkB;IAClB,IAAI,EAAE,MAAM,GAAG,QAAQ,GAAG,QAAQ,CAAC;IAEnC,6DAA6D;IAC7D,UAAU,CAAC,EAAE,OAAO,CAAC;IAErB,qCAAqC;IACrC,KAAK,CAAC,EAAE;QACN,IAAI,CAAC,EAAE,MAAM,CAAC;QACd,WAAW,CAAC,EAAE,MAAM,CAAC;QACrB,QAAQ,CAAC,EAAE,MAAM,CAAC;QAClB,UAAU,CAAC,EAAE,MAAM,CAAC;KACrB,CAAC;IAEF,8BAA8B;IAC9B,OAAO,CAAC,EAAE;QACR,IAAI,CAAC,EAAE,MAAM,CAAC;QACd,MAAM,CAAC,EAAE,MAAM,CAAC;KACjB,CAAC;IAEF,sBAAsB;IACtB,KAAK,CAAC,EAAE,OAAO,CAAC;CACjB;AAED;;;;;;;;;;;;;;;;;;;;;;;;;;GA0BG;AACH,qBAAa,WAAY,YAAW,WAAW;IAC7C,OAAO,CAAC,MAAM,CAAoB;IAClC,OAAO,CAAC,KAAK,CAAsB;IACnC,OAAO,CAAC,WAAW,CAAS;gBAEhB,MAAM,GAAE,OAAO,CAAC,iBAAiB,CAAM;IAuB7C,KAAK,CAAC,KAAK,EAAE,YAAY,EAAE,GAAG,OAAO,CAAC,IAAI,CAAC;IAY3C,MAAM,CAAC,KAAK,EAAE,MAAM,EAAE,OAAO,GAAE,aAAkB,GAAG,OAAO,CAAC,YAAY,EAAE,CAAC;IA0D3E,OAAO,IAAI,OAAO,CAAC,IAAI,CAAC;IAM9B,gCAAgC;IAChC,SAAS,IAAI,iBAAiB;CAG/B"}

package/dist/search/index.js

@@ -0,0 +1,122 @@
+/**
+ * Default search implementation using @orama/orama for BM25 search.
+ *
+ * Supports three modes:
+ * - 'bm25': Fast text search (default, no API keys needed)
+ * - 'vector': Semantic search using embeddings
+ * - 'hybrid': Combination of BM25 and vector search
+ *
+ * @example
+ * ```typescript
+ * // BM25 mode (default)
+ * const search = new OramaSearch();
+ *
+ * // Vector mode
+ * const search = new OramaSearch({
+ *   mode: 'vector',
+ *   embeddings: new OpenAIEmbeddings(),
+ * });
+ *
+ * // Hybrid mode
+ * const search = new OramaSearch({
+ *   mode: 'hybrid',
+ *   embeddings: new OpenAIEmbeddings(),
+ *   weights: { bm25: 0.5, vector: 0.5 },
+ * });
+ * ```
+ */
+export class OramaSearch {
+    config;
+    tools = [];
+    initialized = false;
+    constructor(config = {}) {
+        this.config = {
+            mode: config.mode ?? 'bm25',
+            embeddings: config.embeddings,
+            boost: config.boost ?? {
+                name: 2,
+                keywords: 1.5,
+                description: 1,
+                categories: 1,
+            },
+            weights: config.weights ?? {
+                bm25: 0.5,
+                vector: 0.5,
+            },
+            cache: config.cache,
+        };
+        // Validate config
+        if ((this.config.mode === 'vector' || this.config.mode === 'hybrid') && !this.config.embeddings) {
+            throw new Error(`OramaSearch: 'embeddings' is required for '${this.config.mode}' mode`);
+        }
+    }
+    async index(tools) {
+        this.tools = tools;
+        // TODO: Initialize Orama index
+        // In a real implementation:
+        // 1. Create Orama database with schema
+        // 2. Index all tools
+        // 3. If vector mode, compute/cache embeddings
+        this.initialized = true;
+    }
+    async search(query, options = {}) {
+        if (!this.initialized) {
+            throw new Error('OramaSearch: Must call index() before searching');
+        }
+        const limit = options.limit ?? 5;
+        const threshold = options.threshold ?? 0;
+        // TODO: Implement actual Orama search
+        // For now, return a basic text match implementation
+        const results = [];
+        const queryLower = query.toLowerCase();
+        for (const tool of this.tools) {
+            let score = 0;
+            const matchType = this.config.mode;
+            // Simple text matching (placeholder for BM25)
+            const searchText = [
+                tool.name,
+                tool.description,
+                ...(tool.keywords ?? []),
+                ...(tool.categories ?? []),
+            ].join(' ').toLowerCase();
+            if (searchText.includes(queryLower)) {
+                score = 0.8;
+            }
+            else {
+                // Partial word match
+                const queryWords = queryLower.split(/\s+/);
+                const matchCount = queryWords.filter(word => searchText.includes(word)).length;
+                score = matchCount / queryWords.length * 0.6;
+            }
+            // Filter by categories if specified
+            if (options.categories && options.categories.length > 0) {
+                const toolCategories = new Set(tool.categories ?? []);
+                const hasCategory = options.categories.some(c => toolCategories.has(c));
+                if (!hasCategory) {
+                    continue;
+                }
+            }
+            if (score >= threshold) {
+                results.push({
+                    toolId: tool.id,
+                    score,
+                    matchType,
+                });
+            }
+        }
+        // Sort by score descending and limit
+        return results
+            .sort((a, b) => b.score - a.score)
+            .slice(0, limit);
+    }
+    async reindex() {
+        if (this.tools.length > 0) {
+            await this.index(this.tools);
+        }
+    }
+    /** Get current configuration */
+    getConfig() {
+        return { ...this.config };
+    }
+}
+//# sourceMappingURL=index.js.map

package/dist/search/index.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.js","sourceRoot":"","sources":["../../src/search/index.ts"],"names":[],"mappings":"AA8BA;;;;;;;;;;;;;;;;;;;;;;;;;;GA0BG;AACH,MAAM,OAAO,WAAW;IACd,MAAM,CAAoB;IAC1B,KAAK,GAAmB,EAAE,CAAC;IAC3B,WAAW,GAAG,KAAK,CAAC;IAE5B,YAAY,SAAqC,EAAE;QACjD,IAAI,CAAC,MAAM,GAAG;YACZ,IAAI,EAAE,MAAM,CAAC,IAAI,IAAI,MAAM;YAC3B,UAAU,EAAE,MAAM,CAAC,UAAU;YAC7B,KAAK,EAAE,MAAM,CAAC,KAAK,IAAI;gBACrB,IAAI,EAAE,CAAC;gBACP,QAAQ,EAAE,GAAG;gBACb,WAAW,EAAE,CAAC;gBACd,UAAU,EAAE,CAAC;aACd;YACD,OAAO,EAAE,MAAM,CAAC,OAAO,IAAI;gBACzB,IAAI,EAAE,GAAG;gBACT,MAAM,EAAE,GAAG;aACZ;YACD,KAAK,EAAE,MAAM,CAAC,KAAK;SACpB,CAAC;QAEF,kBAAkB;QAClB,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,IAAI,KAAK,QAAQ,IAAI,IAAI,CAAC,MAAM,CAAC,IAAI,KAAK,QAAQ,CAAC,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,UAAU,EAAE,CAAC;YAChG,MAAM,IAAI,KAAK,CAAC,8CAA8C,IAAI,CAAC,MAAM,CAAC,IAAI,QAAQ,CAAC,CAAC;QAC1F,CAAC;IACH,CAAC;IAED,KAAK,CAAC,KAAK,CAAC,KAAqB;QAC/B,IAAI,CAAC,KAAK,GAAG,KAAK,CAAC;QAEnB,+BAA+B;QAC/B,4BAA4B;QAC5B,uCAAuC;QACvC,qBAAqB;QACrB,8CAA8C;QAE9C,IAAI,CAAC,WAAW,GAAG,IAAI,CAAC;IAC1B,CAAC;IAED,KAAK,CAAC,MAAM,CAAC,KAAa,EAAE,UAAyB,EAAE;QACrD,IAAI,CAAC,IAAI,CAAC,WAAW,EAAE,CAAC;YACtB,MAAM,IAAI,KAAK,CAAC,iDAAiD,CAAC,CAAC;QACrE,CAAC;QAED,MAAM,KAAK,GAAG,OAAO,CAAC,KAAK,IAAI,CAAC,CAAC;QACjC,MAAM,SAAS,GAAG,OAAO,CAAC,SAAS,IAAI,CAAC,CAAC;QAEzC,sCAAsC;QACtC,oDAAoD;QACpD,MAAM,OAAO,GAAmB,EAAE,CAAC;QACnC,MAAM,UAAU,GAAG,KAAK,CAAC,WAAW,EAAE,CAAC;QAEvC,KAAK,MAAM,IAAI,IAAI,IAAI,CAAC,KAAK,EAAE,CAAC;YAC9B,IAAI,KAAK,GAAG,CAAC,CAAC;YACd,MAAM,SAAS,GAA8B,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC;YAE9D,8CAA8C;YAC9C,MAAM,UAAU,GAAG;gBACjB,IAAI,CAAC,IAAI;gBACT,IAAI,CAAC,WAAW;gBAChB,GAAG,CAAC,IAAI,CAAC,QAAQ,IAAI,EAAE,CAAC;gBACxB,GAAG,CAAC,IAAI,CAAC,UAAU,IAAI,EAAE,CAAC;aAC3B,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,WAAW,EAAE,CAAC;YAE1B,IAAI,UAAU,CAAC,QAAQ,CAAC,UAAU,CAAC,EAAE,CAAC;gBACpC,KAAK,GAAG,GAAG,CAAC;YACd,CAAC;iBAAM,CAAC;gBACN,qBAAqB;gBACrB,MAAM,UAAU,GAAG,UAAU,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC;gBAC3C,MAAM,UAAU,GAAG,UAAU,CAAC,MAAM,CAAC,IAAI,CAAC,EAAE,CAAC,UAAU,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC,CAAC,MAAM,CAAC;gBAC/E,KAAK,GAAG,UAAU,GAAG,UAAU,CAAC,MAAM,GAAG,GAAG,CAAC;YAC/C,CAAC;YAED,oCAAoC;YACpC,IAAI,OAAO,CAAC,UAAU,IAAI,OAAO,CAAC,UAAU,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;gBACxD,MAAM,cAAc,GAAG,IAAI,GAAG,CAAC,IAAI,CAAC,UAAU,IAAI,EAAE,CAAC,CAAC;gBACtD,MAAM,WAAW,GAAG,OAAO,CAAC,UAAU,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,cAAc,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;gBACxE,IAAI,CAAC,WAAW,EAAE,CAAC;oBACjB,SAAS;gBACX,CAAC;YACH,CAAC;YAED,IAAI,KAAK,IAAI,SAAS,EAAE,CAAC;gBACvB,OAAO,CAAC,IAAI,CAAC;oBACX,MAAM,EAAE,IAAI,CAAC,EAAE;oBACf,KAAK;oBACL,SAAS;iBACV,CAAC,CAAC;YACL,CAAC;QACH,CAAC;QAED,qCAAqC;QACrC,OAAO,OAAO;aACX,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC,KAAK,CAAC;aACjC,KAAK,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC;IACrB,CAAC;IAED,KAAK,CAAC,OAAO;QACX,IAAI,IAAI,CAAC,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YAC1B,MAAM,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QAC/B,CAAC;IACH,CAAC;IAED,gCAAgC;IAChC,SAAS;QACP,OAAO,EAAE,GAAG,IAAI,CAAC,MAAM,EAAE,CAAC;IAC5B,CAAC;CACF"}

package/dist/search/normalize.d.ts

@@ -0,0 +1,104 @@
+/**
+ * Score Normalization Utilities
+ *
+ * Different search algorithms produce scores in different ranges:
+ * - BM25: 0 to ~25+ (unbounded, depends on corpus)
+ * - Cosine similarity: -1 to 1 (for vectors)
+ * - Orama vector search: 0 to 1 (already normalized)
+ *
+ * We normalize everything to 0-1 for consistent thresholding.
+ */
+import type { SearchResult } from '../types/index.js';
+/**
+ * Normalize BM25 scores to 0-1 range.
+ *
+ * Uses min-max normalization within the result set.
+ * If all scores are the same, returns 1.0 for all.
+ *
+ * @param scores - Array of raw BM25 scores
+ * @returns Array of normalized scores (0-1)
+ */
+export declare function normalizeBM25Scores(scores: number[]): number[];
+/**
+ * Normalize a single BM25 score using a sigmoid function.
+ * This is useful when you don't have the full result set.
+ *
+ * The sigmoid maps scores to (0, 1):
+ * - Low scores (~0-2) map to ~0.0-0.5
+ * - Medium scores (~2-10) map to ~0.5-0.9
+ * - High scores (~10+) map to ~0.9-1.0
+ *
+ * @param score - Raw BM25 score
+ * @param k - Steepness parameter (default: 5)
+ * @returns Normalized score (0-1)
+ */
+export declare function normalizeBM25Sigmoid(score: number, k?: number): number;
+/**
+ * Normalize cosine similarity from [-1, 1] to [0, 1]
+ *
+ * @param similarity - Cosine similarity value (-1 to 1)
+ * @returns Normalized score (0-1)
+ */
+export declare function normalizeCosineSimilarity(similarity: number): number;
+/**
+ * Orama already returns vector scores in 0-1 range (distance-based).
+ * This function clamps to ensure valid range.
+ *
+ * @param score - Orama vector search score
+ * @returns Clamped score (0-1)
+ */
+export declare function normalizeOramaVectorScore(score: number): number;
+/**
+ * Combine BM25 and vector scores using weighted average.
+ *
+ * @param bm25Score - Normalized BM25 score (0-1)
+ * @param vectorScore - Normalized vector score (0-1)
+ * @param weights - Weight configuration
+ * @returns Combined score (0-1)
+ */
+export declare function combineScores(bm25Score: number, vectorScore: number, weights: {
+    bm25: number;
+    vector: number;
+}): number;
+/**
+ * Reciprocal Rank Fusion (RRF) for combining ranked lists.
+ *
+ * RRF is a rank-based fusion method that doesn't require score normalization.
+ * It's useful when BM25 and vector scores are not directly comparable.
+ *
+ * Formula: score = sum(1 / (k + rank)) for each list the item appears in
+ *
+ * @param bm25Rank - Rank in BM25 results (1-indexed, null if not present)
+ * @param vectorRank - Rank in vector results (1-indexed, null if not present)
+ * @param k - Smoothing constant (default: 60, standard value)
+ * @returns RRF score (higher is better)
+ */
+export declare function reciprocalRankFusion(bm25Rank: number | null, vectorRank: number | null, k?: number): number;
+/**
+ * Merge BM25 and vector results using weighted combination.
+ *
+ * Tools that appear in both result sets get combined scores.
+ * Tools that appear in only one set get their score weighted by that mode's weight.
+ *
+ * @param bm25Results - BM25 search results (normalized scores)
+ * @param vectorResults - Vector search results (normalized scores)
+ * @param weights - Weight configuration for combining
+ * @returns Merged and re-ranked results
+ */
+export declare function mergeHybridResults(bm25Results: SearchResult[], vectorResults: SearchResult[], weights: {
+    bm25: number;
+    vector: number;
+}): SearchResult[];
+/**
+ * Merge results using Reciprocal Rank Fusion.
+ *
+ * This method is rank-based rather than score-based,
+ * which can be more robust when score distributions differ significantly.
+ *
+ * @param bm25Results - BM25 search results (order matters, not scores)
+ * @param vectorResults - Vector search results (order matters, not scores)
+ * @param k - RRF smoothing constant
+ * @returns Merged and re-ranked results
+ */
+export declare function mergeWithRRF(bm25Results: SearchResult[], vectorResults: SearchResult[], k?: number): SearchResult[];
+//# sourceMappingURL=normalize.d.ts.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"normalize.d.ts","sourceRoot":"","sources":["../../src/search/normalize.ts"],"names":[],"mappings":"AAAA;;;;;;;;;GASG;AAEH,OAAO,KAAK,EAAE,YAAY,EAAE,MAAM,mBAAmB,CAAC;AAOtD;;;;;;;;GAQG;AACH,wBAAgB,mBAAmB,CAAC,MAAM,EAAE,MAAM,EAAE,GAAG,MAAM,EAAE,CAc9D;AAED;;;;;;;;;;;;GAYG;AACH,wBAAgB,oBAAoB,CAAC,KAAK,EAAE,MAAM,EAAE,CAAC,GAAE,MAAU,GAAG,MAAM,CAIzE;AAMD;;;;;GAKG;AACH,wBAAgB,yBAAyB,CAAC,UAAU,EAAE,MAAM,GAAG,MAAM,CAGpE;AAED;;;;;;GAMG;AACH,wBAAgB,yBAAyB,CAAC,KAAK,EAAE,MAAM,GAAG,MAAM,CAE/D;AAMD;;;;;;;GAOG;AACH,wBAAgB,aAAa,CAC3B,SAAS,EAAE,MAAM,EACjB,WAAW,EAAE,MAAM,EACnB,OAAO,EAAE;IAAE,IAAI,EAAE,MAAM,CAAC;IAAC,MAAM,EAAE,MAAM,CAAA;CAAE,GACxC,MAAM,CAGR;AAED;;;;;;;;;;;;GAYG;AACH,wBAAgB,oBAAoB,CAClC,QAAQ,EAAE,MAAM,GAAG,IAAI,EACvB,UAAU,EAAE,MAAM,GAAG,IAAI,EACzB,CAAC,GAAE,MAAW,GACb,MAAM,CASR;AAMD;;;;;;;;;;GAUG;AACH,wBAAgB,kBAAkB,CAChC,WAAW,EAAE,YAAY,EAAE,EAC3B,aAAa,EAAE,YAAY,EAAE,EAC7B,OAAO,EAAE;IAAE,IAAI,EAAE,MAAM,CAAC;IAAC,MAAM,EAAE,MAAM,CAAA;CAAE,GACxC,YAAY,EAAE,CAuChB;AAED;;;;;;;;;;GAUG;AACH,wBAAgB,YAAY,CAC1B,WAAW,EAAE,YAAY,EAAE,EAC3B,aAAa,EAAE,YAAY,EAAE,EAC7B,CAAC,GAAE,MAAW,GACb,YAAY,EAAE,CAwChB"}