mcp-resend 1.0.0-1

package/dist/tools/docs/vector-search.js

@@ -0,0 +1,297 @@
+/**
+ * Core vector search functionality for documentation.
+ * Provides semantic search using embeddings and keyword search as fallback.
+ */
+import { loadEmbeddings } from "./embeddings-loader.js";
+import { createDocsError, DocsErrorCode } from "./errors.js";
+// NOTE: Use console.error for logging - stdout is reserved for MCP protocol
+const log = (message) => console.error(`[docs-search] ${message}`);
+/** Timeout for model loading in milliseconds (2 minutes) */
+const MODEL_LOAD_TIMEOUT_MS = 120000;
+/** Maximum retry attempts for model loading */
+const MODEL_LOAD_MAX_RETRIES = 2;
+/** Delay between retry attempts in milliseconds */
+const MODEL_LOAD_RETRY_DELAY_MS = 1000;
+/** Cached embedding pipeline */
+let embedderPipeline = null;
+/** Loading promise to prevent concurrent model loads */
+let embedderLoadingPromise = null;
+/**
+ * Helper to create a timeout promise.
+ *
+ * @param ms - Timeout in milliseconds
+ * @param operation - Description of the operation for error message
+ * @returns Promise that rejects after timeout
+ */
+function createTimeout(ms, operation) {
+    return new Promise((_, reject) => {
+        setTimeout(() => {
+            reject(createDocsError(DocsErrorCode.NETWORK_TIMEOUT, `${operation} timed out after ${ms}ms`));
+        }, ms);
+    });
+}
+/**
+ * Helper to delay execution.
+ *
+ * @param ms - Delay in milliseconds
+ * @returns Promise that resolves after delay
+ */
+function delay(ms) {
+    return new Promise((resolve) => setTimeout(resolve, ms));
+}
+/**
+ * Internal function to load the model without retry logic.
+ *
+ * @returns Promise resolving to the embedding pipeline
+ */
+async function loadModelInternal() {
+    // Dynamic import to avoid loading the heavy transformers library until needed
+    const { pipeline } = await import("@xenova/transformers");
+    const extractor = await pipeline("feature-extraction", "Xenova/all-MiniLM-L6-v2");
+    return extractor;
+}
+/**
+ * Load the embedding model (Xenova/all-MiniLM-L6-v2).
+ * Lazy loads on first call and caches for subsequent use.
+ * Includes timeout and retry logic for robustness.
+ *
+ * @returns Promise resolving to the embedding pipeline function
+ */
+export async function loadEmbedder() {
+    if (embedderPipeline !== null) {
+        return embedderPipeline;
+    }
+    if (embedderLoadingPromise !== null) {
+        return embedderLoadingPromise;
+    }
+    log("Loading embedding model: Xenova/all-MiniLM-L6-v2");
+    const startTime = Date.now();
+    embedderLoadingPromise = (async () => {
+        let lastError = null;
+        for (let attempt = 0; attempt <= MODEL_LOAD_MAX_RETRIES; attempt++) {
+            if (attempt > 0) {
+                log(`Retrying model load (attempt ${attempt + 1}/${MODEL_LOAD_MAX_RETRIES + 1})...`);
+                await delay(MODEL_LOAD_RETRY_DELAY_MS);
+            }
+            try {
+                // Race between model loading and timeout
+                const extractor = await Promise.race([
+                    loadModelInternal(),
+                    createTimeout(MODEL_LOAD_TIMEOUT_MS, "Model loading"),
+                ]);
+                const loadTime = Date.now() - startTime;
+                log(`Embedding model loaded in ${loadTime}ms`);
+                embedderPipeline = extractor;
+                embedderLoadingPromise = null;
+                return embedderPipeline;
+            }
+            catch (error) {
+                lastError = error instanceof Error ? error : new Error(String(error));
+                log(`Model load attempt ${attempt + 1} failed: ${lastError.message}`);
+                // If it's a timeout or network error, retry
+                // If it's a different error (e.g., invalid model), don't retry
+                const isRetryable = lastError.message.includes("timeout") ||
+                    lastError.message.includes("ETIMEDOUT") ||
+                    lastError.message.includes("ECONNRESET") ||
+                    lastError.message.includes("fetch");
+                if (!isRetryable || attempt >= MODEL_LOAD_MAX_RETRIES) {
+                    break;
+                }
+            }
+        }
+        embedderLoadingPromise = null;
+        // Convert to DocsError if not already
+        if (lastError && "code" in lastError) {
+            throw lastError;
+        }
+        throw createDocsError(DocsErrorCode.MODEL_LOAD_FAILURE, `Failed to load embedding model after ${MODEL_LOAD_MAX_RETRIES + 1} attempts: ${lastError?.message ?? "Unknown error"}`);
+    })();
+    return embedderLoadingPromise;
+}
+/**
+ * Generate embedding vector for a query string.
+ *
+ * @param query - The text to embed
+ * @returns Promise resolving to 384-dimensional embedding vector
+ */
+export async function embedQuery(query) {
+    const extractor = await loadEmbedder();
+    const result = await extractor([query], {
+        pooling: "mean",
+        normalize: true,
+    });
+    // Convert Float32Array to regular array
+    return Array.from(result.data);
+}
+/**
+ * Compute cosine similarity between two vectors.
+ * Assumes vectors are already normalized (which they are from the model).
+ *
+ * @param a - First vector
+ * @param b - Second vector
+ * @returns Cosine similarity score between -1 and 1
+ */
+export function cosineSimilarity(a, b) {
+    if (a.length !== b.length) {
+        throw createDocsError(DocsErrorCode.DIMENSION_MISMATCH, `Vector dimension mismatch: query has ${a.length} dimensions, stored embedding has ${b.length}`);
+    }
+    let dotProduct = 0;
+    for (let i = 0; i < a.length; i++) {
+        dotProduct += a[i] * b[i];
+    }
+    // Vectors are already normalized, so we just return the dot product
+    return dotProduct;
+}
+/**
+ * Perform semantic search using vector embeddings.
+ *
+ * @param query - The search query
+ * @param limit - Maximum number of results to return
+ * @param maxTokensPerResult - Optional max tokens per result for truncation
+ * @returns Promise resolving to array of scored chunks
+ */
+export async function semanticSearch(query, limit, maxTokensPerResult) {
+    const startTime = Date.now();
+    // Load embeddings and generate query embedding in parallel
+    const [index, queryEmbedding] = await Promise.all([
+        loadEmbeddings(),
+        embedQuery(query),
+    ]);
+    // Score all chunks by cosine similarity
+    const scoredChunks = index.chunks.map((chunk) => ({
+        id: chunk.id,
+        section: chunk.section,
+        content: chunk.content,
+        tokenCount: chunk.tokenCount,
+        sourceUrl: chunk.sourceUrl,
+        score: cosineSimilarity(queryEmbedding, chunk.embedding),
+    }));
+    // Sort by score descending and take top results
+    scoredChunks.sort((a, b) => b.score - a.score);
+    const topResults = scoredChunks.slice(0, limit);
+    // Optionally truncate content
+    if (maxTokensPerResult !== undefined) {
+        for (const result of topResults) {
+            if (result.tokenCount > maxTokensPerResult) {
+                result.content = truncateToTokenBudget(result.content, maxTokensPerResult);
+                result.tokenCount = maxTokensPerResult;
+            }
+        }
+    }
+    const searchTime = Date.now() - startTime;
+    log(`Semantic search completed in ${searchTime}ms, found ${topResults.length} results`);
+    return topResults;
+}
+/**
+ * Perform keyword-based search as fallback.
+ * Uses simple case-insensitive substring matching with basic relevance scoring.
+ *
+ * @param query - The search query
+ * @param limit - Maximum number of results to return
+ * @returns Promise resolving to array of scored chunks
+ */
+export async function keywordSearch(query, limit) {
+    const startTime = Date.now();
+    const index = await loadEmbeddings();
+    // Normalize query for matching
+    const queryLower = query.toLowerCase();
+    const queryTerms = queryLower.split(/\s+/).filter((term) => term.length >= 2);
+    if (queryTerms.length === 0) {
+        return [];
+    }
+    // Score chunks based on keyword matches
+    const scoredChunks = [];
+    for (const chunk of index.chunks) {
+        const contentLower = chunk.content.toLowerCase();
+        const sectionLower = chunk.section.toLowerCase();
+        // Count term matches
+        let matchCount = 0;
+        let exactPhraseMatch = false;
+        // Check for exact phrase match (higher weight)
+        if (contentLower.includes(queryLower) || sectionLower.includes(queryLower)) {
+            exactPhraseMatch = true;
+            matchCount += queryTerms.length * 2;
+        }
+        // Check individual term matches
+        for (const term of queryTerms) {
+            if (contentLower.includes(term)) {
+                matchCount++;
+            }
+            if (sectionLower.includes(term)) {
+                matchCount += 0.5; // Section matches are valuable but less than content
+            }
+        }
+        if (matchCount > 0) {
+            // Normalize score to 0-1 range (roughly)
+            // Max possible score: terms * 2 (exact) + terms (content) + terms * 0.5 (section)
+            const maxScore = queryTerms.length * 3.5;
+            const normalizedScore = Math.min(matchCount / maxScore, 1);
+            scoredChunks.push({
+                id: chunk.id,
+                section: chunk.section,
+                content: chunk.content,
+                tokenCount: chunk.tokenCount,
+                sourceUrl: chunk.sourceUrl,
+                score: exactPhraseMatch ? Math.max(normalizedScore, 0.5) : normalizedScore,
+            });
+        }
+    }
+    // Sort by score descending and take top results
+    scoredChunks.sort((a, b) => b.score - a.score);
+    const topResults = scoredChunks.slice(0, limit);
+    const searchTime = Date.now() - startTime;
+    log(`Keyword search completed in ${searchTime}ms, found ${topResults.length} results`);
+    return topResults;
+}
+/**
+ * Truncate content to fit within a token budget.
+ * Uses approximate token estimation (4 chars per token).
+ *
+ * @param content - The content to truncate
+ * @param maxTokens - Maximum tokens allowed
+ * @returns Truncated content with ellipsis if needed
+ */
+export function truncateToTokenBudget(content, maxTokens) {
+    // Approximate: 1 token ~= 4 characters for English text
+    const maxChars = maxTokens * 4;
+    if (content.length <= maxChars) {
+        return content;
+    }
+    // Find a good break point (end of sentence or word)
+    let truncateAt = maxChars;
+    // Try to find end of sentence within last 20% of allowed length
+    const searchStart = Math.floor(maxChars * 0.8);
+    const sentenceEnd = content.lastIndexOf(". ", truncateAt);
+    if (sentenceEnd > searchStart) {
+        truncateAt = sentenceEnd + 1;
+    }
+    else {
+        // Fall back to word boundary
+        const wordEnd = content.lastIndexOf(" ", truncateAt);
+        if (wordEnd > searchStart) {
+            truncateAt = wordEnd;
+        }
+    }
+    return content.slice(0, truncateAt).trim() + "...";
+}
+/**
+ * Get statistics about the loaded embeddings.
+ * Useful for debugging and status reporting.
+ *
+ * @returns Object with embeddings statistics, or null if not loaded
+ */
+export async function getEmbeddingsStats() {
+    try {
+        const index = await loadEmbeddings();
+        return {
+            chunkCount: index.chunks.length,
+            dimensions: index.dimensions,
+            model: index.model,
+            generatedAt: index.generatedAt,
+        };
+    }
+    catch {
+        return null;
+    }
+}
+//# sourceMappingURL=vector-search.js.map

package/dist/tools/docs/vector-search.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"vector-search.js","sourceRoot":"","sources":["../../../src/tools/docs/vector-search.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAGH,OAAO,EAAE,cAAc,EAAE,MAAM,wBAAwB,CAAC;AACxD,OAAO,EAAE,eAAe,EAAE,aAAa,EAAE,MAAM,aAAa,CAAC;AAE7D,4EAA4E;AAC5E,MAAM,GAAG,GAAG,CAAC,OAAe,EAAE,EAAE,CAAC,OAAO,CAAC,KAAK,CAAC,iBAAiB,OAAO,EAAE,CAAC,CAAC;AAE3E,4DAA4D;AAC5D,MAAM,qBAAqB,GAAG,MAAM,CAAC;AAErC,+CAA+C;AAC/C,MAAM,sBAAsB,GAAG,CAAC,CAAC;AAEjC,mDAAmD;AACnD,MAAM,yBAAyB,GAAG,IAAI,CAAC;AAWvC,gCAAgC;AAChC,IAAI,gBAAgB,GAAoB,IAAI,CAAC;AAE7C,wDAAwD;AACxD,IAAI,sBAAsB,GAA6B,IAAI,CAAC;AAE5D;;;;;;GAMG;AACH,SAAS,aAAa,CAAC,EAAU,EAAE,SAAiB;IAClD,OAAO,IAAI,OAAO,CAAC,CAAC,CAAC,EAAE,MAAM,EAAE,EAAE;QAC/B,UAAU,CAAC,GAAG,EAAE;YACd,MAAM,CACJ,eAAe,CACb,aAAa,CAAC,eAAe,EAC7B,GAAG,SAAS,oBAAoB,EAAE,IAAI,CACvC,CACF,CAAC;QACJ,CAAC,EAAE,EAAE,CAAC,CAAC;IACT,CAAC,CAAC,CAAC;AACL,CAAC;AAED;;;;;GAKG;AACH,SAAS,KAAK,CAAC,EAAU;IACvB,OAAO,IAAI,OAAO,CAAC,CAAC,OAAO,EAAE,EAAE,CAAC,UAAU,CAAC,OAAO,EAAE,EAAE,CAAC,CAAC,CAAC;AAC3D,CAAC;AAED;;;;GAIG;AACH,KAAK,UAAU,iBAAiB;IAC9B,8EAA8E;IAC9E,MAAM,EAAE,QAAQ,EAAE,GAAG,MAAM,MAAM,CAAC,sBAAsB,CAAC,CAAC;IAE1D,MAAM,SAAS,GAAG,MAAM,QAAQ,CAC9B,oBAAoB,EACpB,yBAAyB,CAC1B,CAAC;IAEF,OAAO,SAAqB,CAAC;AAC/B,CAAC;AAED;;;;;;GAMG;AACH,MAAM,CAAC,KAAK,UAAU,YAAY;IAChC,IAAI,gBAAgB,KAAK,IAAI,EAAE,CAAC;QAC9B,OAAO,gBAAgB,CAAC;IAC1B,CAAC;IAED,IAAI,sBAAsB,KAAK,IAAI,EAAE,CAAC;QACpC,OAAO,sBAAsB,CAAC;IAChC,CAAC;IAED,GAAG,CAAC,kDAAkD,CAAC,CAAC;IACxD,MAAM,SAAS,GAAG,IAAI,CAAC,GAAG,EAAE,CAAC;IAE7B,sBAAsB,GAAG,CAAC,KAAK,IAAI,EAAE;QACnC,IAAI,SAAS,GAAiB,IAAI,CAAC;QAEnC,KAAK,IAAI,OAAO,GAAG,CAAC,EAAE,OAAO,IAAI,sBAAsB,EAAE,OAAO,EAAE,EAAE,CAAC;YACnE,IAAI,OAAO,GAAG,CAAC,EAAE,CAAC;gBAChB,GAAG,CAAC,gCAAgC,OAAO,GAAG,CAAC,IAAI,sBAAsB,GAAG,CAAC,MAAM,CAAC,CAAC;gBACrF,MAAM,KAAK,CAAC,yBAAyB,CAAC,CAAC;YACzC,CAAC;YAED,IAAI,CAAC;gBACH,yCAAyC;gBACzC,MAAM,SAAS,GAAG,MAAM,OAAO,CAAC,IAAI,CAAC;oBACnC,iBAAiB,EAAE;oBACnB,aAAa,CAAC,qBAAqB,EAAE,eAAe,CAAC;iBACtD,CAAC,CAAC;gBAEH,MAAM,QAAQ,GAAG,IAAI,CAAC,GAAG,EAAE,GAAG,SAAS,CAAC;gBACxC,GAAG,CAAC,6BAA6B,QAAQ,IAAI,CAAC,CAAC;gBAE/C,gBAAgB,GAAG,SAAS,CAAC;gBAC7B,sBAAsB,GAAG,IAAI,CAAC;gBAC9B,OAAO,gBAAgB,CAAC;YAC1B,CAAC;YAAC,OAAO,KAAK,EAAE,CAAC;gBACf,SAAS,GAAG,KAAK,YAAY,KAAK,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,IAAI,KAAK,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC;gBACtE,GAAG,CAAC,sBAAsB,OAAO,GAAG,CAAC,YAAY,SAAS,CAAC,OAAO,EAAE,CAAC,CAAC;gBAEtE,4CAA4C;gBAC5C,+DAA+D;gBAC/D,MAAM,WAAW,GACf,SAAS,CAAC,OAAO,CAAC,QAAQ,CAAC,SAAS,CAAC;oBACrC,SAAS,CAAC,OAAO,CAAC,QAAQ,CAAC,WAAW,CAAC;oBACvC,SAAS,CAAC,OAAO,CAAC,QAAQ,CAAC,YAAY,CAAC;oBACxC,SAAS,CAAC,OAAO,CAAC,QAAQ,CAAC,OAAO,CAAC,CAAC;gBAEtC,IAAI,CAAC,WAAW,IAAI,OAAO,IAAI,sBAAsB,EAAE,CAAC;oBACtD,MAAM;gBACR,CAAC;YACH,CAAC;QACH,CAAC;QAED,sBAAsB,GAAG,IAAI,CAAC;QAE9B,sCAAsC;QACtC,IAAI,SAAS,IAAI,MAAM,IAAI,SAAS,EAAE,CAAC;YACrC,MAAM,SAAS,CAAC;QAClB,CAAC;QAED,MAAM,eAAe,CACnB,aAAa,CAAC,kBAAkB,EAChC,wCAAwC,sBAAsB,GAAG,CAAC,cAAc,SAAS,EAAE,OAAO,IAAI,eAAe,EAAE,CACxH,CAAC;IACJ,CAAC,CAAC,EAAE,CAAC;IAEL,OAAO,sBAAsB,CAAC;AAChC,CAAC;AAED;;;;;GAKG;AACH,MAAM,CAAC,KAAK,UAAU,UAAU,CAAC,KAAa;IAC5C,MAAM,SAAS,GAAG,MAAM,YAAY,EAAE,CAAC;IAEvC,MAAM,MAAM,GAAG,MAAM,SAAS,CAAC,CAAC,KAAK,CAAC,EAAE;QACtC,OAAO,EAAE,MAAM;QACf,SAAS,EAAE,IAAI;KAChB,CAAC,CAAC;IAEH,wCAAwC;IACxC,OAAO,KAAK,CAAC,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;AACjC,CAAC;AAED;;;;;;;GAOG;AACH,MAAM,UAAU,gBAAgB,CAAC,CAAW,EAAE,CAAW;IACvD,IAAI,CAAC,CAAC,MAAM,KAAK,CAAC,CAAC,MAAM,EAAE,CAAC;QAC1B,MAAM,eAAe,CACnB,aAAa,CAAC,kBAAkB,EAChC,wCAAwC,CAAC,CAAC,MAAM,qCAAqC,CAAC,CAAC,MAAM,EAAE,CAChG,CAAC;IACJ,CAAC;IAED,IAAI,UAAU,GAAG,CAAC,CAAC;IACnB,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;IAC5B,CAAC;IAED,oEAAoE;IACpE,OAAO,UAAU,CAAC;AACpB,CAAC;AAED;;;;;;;GAOG;AACH,MAAM,CAAC,KAAK,UAAU,cAAc,CAClC,KAAa,EACb,KAAa,EACb,kBAA2B;IAE3B,MAAM,SAAS,GAAG,IAAI,CAAC,GAAG,EAAE,CAAC;IAE7B,2DAA2D;IAC3D,MAAM,CAAC,KAAK,EAAE,cAAc,CAAC,GAAG,MAAM,OAAO,CAAC,GAAG,CAAC;QAChD,cAAc,EAAE;QAChB,UAAU,CAAC,KAAK,CAAC;KAClB,CAAC,CAAC;IAEH,wCAAwC;IACxC,MAAM,YAAY,GAAkB,KAAK,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,CAAC;QAC/D,EAAE,EAAE,KAAK,CAAC,EAAE;QACZ,OAAO,EAAE,KAAK,CAAC,OAAO;QACtB,OAAO,EAAE,KAAK,CAAC,OAAO;QACtB,UAAU,EAAE,KAAK,CAAC,UAAU;QAC5B,SAAS,EAAE,KAAK,CAAC,SAAS;QAC1B,KAAK,EAAE,gBAAgB,CAAC,cAAc,EAAE,KAAK,CAAC,SAAS,CAAC;KACzD,CAAC,CAAC,CAAC;IAEJ,gDAAgD;IAChD,YAAY,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC,KAAK,CAAC,CAAC;IAC/C,MAAM,UAAU,GAAG,YAAY,CAAC,KAAK,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC;IAEhD,8BAA8B;IAC9B,IAAI,kBAAkB,KAAK,SAAS,EAAE,CAAC;QACrC,KAAK,MAAM,MAAM,IAAI,UAAU,EAAE,CAAC;YAChC,IAAI,MAAM,CAAC,UAAU,GAAG,kBAAkB,EAAE,CAAC;gBAC3C,MAAM,CAAC,OAAO,GAAG,qBAAqB,CAAC,MAAM,CAAC,OAAO,EAAE,kBAAkB,CAAC,CAAC;gBAC3E,MAAM,CAAC,UAAU,GAAG,kBAAkB,CAAC;YACzC,CAAC;QACH,CAAC;IACH,CAAC;IAED,MAAM,UAAU,GAAG,IAAI,CAAC,GAAG,EAAE,GAAG,SAAS,CAAC;IAC1C,GAAG,CAAC,gCAAgC,UAAU,aAAa,UAAU,CAAC,MAAM,UAAU,CAAC,CAAC;IAExF,OAAO,UAAU,CAAC;AACpB,CAAC;AAED;;;;;;;GAOG;AACH,MAAM,CAAC,KAAK,UAAU,aAAa,CACjC,KAAa,EACb,KAAa;IAEb,MAAM,SAAS,GAAG,IAAI,CAAC,GAAG,EAAE,CAAC;IAC7B,MAAM,KAAK,GAAG,MAAM,cAAc,EAAE,CAAC;IAErC,+BAA+B;IAC/B,MAAM,UAAU,GAAG,KAAK,CAAC,WAAW,EAAE,CAAC;IACvC,MAAM,UAAU,GAAG,UAAU,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,MAAM,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,CAAC,MAAM,IAAI,CAAC,CAAC,CAAC;IAE9E,IAAI,UAAU,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QAC5B,OAAO,EAAE,CAAC;IACZ,CAAC;IAED,wCAAwC;IACxC,MAAM,YAAY,GAAkB,EAAE,CAAC;IAEvC,KAAK,MAAM,KAAK,IAAI,KAAK,CAAC,MAAM,EAAE,CAAC;QACjC,MAAM,YAAY,GAAG,KAAK,CAAC,OAAO,CAAC,WAAW,EAAE,CAAC;QACjD,MAAM,YAAY,GAAG,KAAK,CAAC,OAAO,CAAC,WAAW,EAAE,CAAC;QAEjD,qBAAqB;QACrB,IAAI,UAAU,GAAG,CAAC,CAAC;QACnB,IAAI,gBAAgB,GAAG,KAAK,CAAC;QAE7B,+CAA+C;QAC/C,IAAI,YAAY,CAAC,QAAQ,CAAC,UAAU,CAAC,IAAI,YAAY,CAAC,QAAQ,CAAC,UAAU,CAAC,EAAE,CAAC;YAC3E,gBAAgB,GAAG,IAAI,CAAC;YACxB,UAAU,IAAI,UAAU,CAAC,MAAM,GAAG,CAAC,CAAC;QACtC,CAAC;QAED,gCAAgC;QAChC,KAAK,MAAM,IAAI,IAAI,UAAU,EAAE,CAAC;YAC9B,IAAI,YAAY,CAAC,QAAQ,CAAC,IAAI,CAAC,EAAE,CAAC;gBAChC,UAAU,EAAE,CAAC;YACf,CAAC;YACD,IAAI,YAAY,CAAC,QAAQ,CAAC,IAAI,CAAC,EAAE,CAAC;gBAChC,UAAU,IAAI,GAAG,CAAC,CAAC,qDAAqD;YAC1E,CAAC;QACH,CAAC;QAED,IAAI,UAAU,GAAG,CAAC,EAAE,CAAC;YACnB,yCAAyC;YACzC,kFAAkF;YAClF,MAAM,QAAQ,GAAG,UAAU,CAAC,MAAM,GAAG,GAAG,CAAC;YACzC,MAAM,eAAe,GAAG,IAAI,CAAC,GAAG,CAAC,UAAU,GAAG,QAAQ,EAAE,CAAC,CAAC,CAAC;YAE3D,YAAY,CAAC,IAAI,CAAC;gBAChB,EAAE,EAAE,KAAK,CAAC,EAAE;gBACZ,OAAO,EAAE,KAAK,CAAC,OAAO;gBACtB,OAAO,EAAE,KAAK,CAAC,OAAO;gBACtB,UAAU,EAAE,KAAK,CAAC,UAAU;gBAC5B,SAAS,EAAE,KAAK,CAAC,SAAS;gBAC1B,KAAK,EAAE,gBAAgB,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,eAAe,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC,eAAe;aAC3E,CAAC,CAAC;QACL,CAAC;IACH,CAAC;IAED,gDAAgD;IAChD,YAAY,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC,KAAK,CAAC,CAAC;IAC/C,MAAM,UAAU,GAAG,YAAY,CAAC,KAAK,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC;IAEhD,MAAM,UAAU,GAAG,IAAI,CAAC,GAAG,EAAE,GAAG,SAAS,CAAC;IAC1C,GAAG,CAAC,+BAA+B,UAAU,aAAa,UAAU,CAAC,MAAM,UAAU,CAAC,CAAC;IAEvF,OAAO,UAAU,CAAC;AACpB,CAAC;AAED;;;;;;;GAOG;AACH,MAAM,UAAU,qBAAqB,CAAC,OAAe,EAAE,SAAiB;IACtE,wDAAwD;IACxD,MAAM,QAAQ,GAAG,SAAS,GAAG,CAAC,CAAC;IAE/B,IAAI,OAAO,CAAC,MAAM,IAAI,QAAQ,EAAE,CAAC;QAC/B,OAAO,OAAO,CAAC;IACjB,CAAC;IAED,oDAAoD;IACpD,IAAI,UAAU,GAAG,QAAQ,CAAC;IAE1B,gEAAgE;IAChE,MAAM,WAAW,GAAG,IAAI,CAAC,KAAK,CAAC,QAAQ,GAAG,GAAG,CAAC,CAAC;IAC/C,MAAM,WAAW,GAAG,OAAO,CAAC,WAAW,CAAC,IAAI,EAAE,UAAU,CAAC,CAAC;IAC1D,IAAI,WAAW,GAAG,WAAW,EAAE,CAAC;QAC9B,UAAU,GAAG,WAAW,GAAG,CAAC,CAAC;IAC/B,CAAC;SAAM,CAAC;QACN,6BAA6B;QAC7B,MAAM,OAAO,GAAG,OAAO,CAAC,WAAW,CAAC,GAAG,EAAE,UAAU,CAAC,CAAC;QACrD,IAAI,OAAO,GAAG,WAAW,EAAE,CAAC;YAC1B,UAAU,GAAG,OAAO,CAAC;QACvB,CAAC;IACH,CAAC;IAED,OAAO,OAAO,CAAC,KAAK,CAAC,CAAC,EAAE,UAAU,CAAC,CAAC,IAAI,EAAE,GAAG,KAAK,CAAC;AACrD,CAAC;AAED;;;;;GAKG;AACH,MAAM,CAAC,KAAK,UAAU,kBAAkB;IAMtC,IAAI,CAAC;QACH,MAAM,KAAK,GAAG,MAAM,cAAc,EAAE,CAAC;QACrC,OAAO;YACL,UAAU,EAAE,KAAK,CAAC,MAAM,CAAC,MAAM;YAC/B,UAAU,EAAE,KAAK,CAAC,UAAU;YAC5B,KAAK,EAAE,KAAK,CAAC,KAAK;YAClB,WAAW,EAAE,KAAK,CAAC,WAAW;SAC/B,CAAC;IACJ,CAAC;IAAC,MAAM,CAAC;QACP,OAAO,IAAI,CAAC;IACd,CAAC;AACH,CAAC"}

package/dist/tools/index.d.ts

@@ -0,0 +1,27 @@
+/**
+ * Tool Definitions for MCP Server
+ *
+ * Central factory for creating ToolDefinition objects with proper
+ * tier and scope assignments per tool-curation.md.
+ *
+ * @module tools
+ */
+import { Resend } from "resend";
+import type { ToolDefinition } from "../services/tool-registry.js";
+/**
+ * Create all tool definitions with Resend client.
+ * Returns array of ToolDefinition objects ready for registry.
+ *
+ * If resend is null, only the documentation search tool is returned
+ * (docs-only mode when no API key is provided).
+ *
+ * @param resend - Resend client instance or null for docs-only mode
+ * @returns Array of tool definitions
+ */
+export declare function createToolDefinitions(resend: Resend | null): ToolDefinition[];
+/**
+ * Get tool names by tier.
+ * Useful for verification and debugging.
+ */
+export declare function getToolNamesByTier(): Record<string, string[]>;
+//# sourceMappingURL=index.d.ts.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../src/tools/index.ts"],"names":[],"mappings":"AAAA;;;;;;;GAOG;AAGH,OAAO,EAAE,MAAM,EAAE,MAAM,QAAQ,CAAC;AAChC,OAAO,KAAK,EAAE,cAAc,EAAgB,MAAM,8BAA8B,CAAC;AAsjHjF;;;;;;;;;GASG;AACH,wBAAgB,qBAAqB,CAAC,MAAM,EAAE,MAAM,GAAG,IAAI,GAAG,cAAc,EAAE,CAsF7E;AAED;;;GAGG;AACH,wBAAgB,kBAAkB,IAAI,MAAM,CAAC,MAAM,EAAE,MAAM,EAAE,CAAC,CAgF7D"}