@contiva/sapbtp-docs-mcp 1.0.1

package/build/utils/docs-downloader.js

@@ -0,0 +1,82 @@
+import { existsSync } from 'fs';
+import { mkdir } from 'fs/promises';
+import { join } from 'path';
+import { exec } from 'child_process';
+import { promisify } from 'util';
+const execAsync = promisify(exec);
+/**
+ * Repository configuration
+ */
+const DOCS_REPO = 'https://github.com/SAP-docs/btp-cloud-platform.git';
+/**
+ * Checks if documentation exists and downloads it if necessary
+ */
+export async function ensureDocsAvailable(docsPath) {
+    // Check if docs directory exists and has content
+    if (existsSync(docsPath)) {
+        const iSuitePath = join(docsPath, 'ISuite');
+        const ciPath = join(docsPath, 'ci');
+        const apimPath = join(docsPath, 'apim');
+        if (existsSync(iSuitePath) && existsSync(ciPath) && existsSync(apimPath)) {
+            console.error('Documentation found at:', docsPath);
+            return true;
+        }
+    }
+    // Docs not found - download from GitHub
+    console.error('\nDocumentation not found. Downloading from GitHub...');
+    console.error('This is a one-time operation and may take 1-2 minutes.\n');
+    try {
+        await downloadDocs(docsPath);
+        console.error('\n✓ Documentation downloaded successfully!\n');
+        return true;
+    }
+    catch (error) {
+        console.error('\n✗ Failed to download documentation:', error);
+        console.error('\nPlease manually clone the official SAP documentation repository:');
+        console.error(`  git clone ${DOCS_REPO}`);
+        console.error(`  export MCP_DOCS_PATH=/path/to/btp-integration-suite/docs`);
+        console.error('\nThen restart the MCP server.');
+        return false;
+    }
+}
+/**
+ * Downloads documentation from GitHub
+ */
+async function downloadDocs(docsPath) {
+    const parentDir = join(docsPath, '..');
+    // Create parent directory if it doesn't exist
+    await mkdir(parentDir, { recursive: true });
+    console.error('Cloning SAP Business Technology Platform documentation...');
+    const repoDir = join(parentDir, '.docs-repo');
+    // Clean up any existing partial download
+    if (existsSync(repoDir)) {
+        await execAsync(`rm -rf "${repoDir}"`);
+    }
+    // Clone with sparse checkout for docs folder only
+    const commands = [
+        `git clone --filter=blob:none --sparse "${DOCS_REPO}" "${repoDir}"`,
+        `cd "${repoDir}" && git sparse-checkout set docs`,
+        `mv "${repoDir}/docs" "${docsPath}"`,
+        `rm -rf "${repoDir}"`
+    ];
+    for (const cmd of commands) {
+        await execAsync(cmd);
+    }
+    console.error('Documentation download complete.');
+}
+/**
+ * Gets the size of the docs directory in MB
+ */
+export async function getDocsSize(docsPath) {
+    if (!existsSync(docsPath)) {
+        return 0;
+    }
+    try {
+        const { stdout } = await execAsync(`du -sm "${docsPath}" | cut -f1`);
+        return parseInt(stdout.trim(), 10);
+    }
+    catch {
+        return 0;
+    }
+}
+//# sourceMappingURL=docs-downloader.js.map

package/build/utils/docs-downloader.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"docs-downloader.js","sourceRoot":"","sources":["../../src/utils/docs-downloader.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,UAAU,EAAE,MAAM,IAAI,CAAC;AAChC,OAAO,EAAE,KAAK,EAAE,MAAM,aAAa,CAAC;AACpC,OAAO,EAAE,IAAI,EAAE,MAAM,MAAM,CAAC;AAC5B,OAAO,EAAE,IAAI,EAAE,MAAM,eAAe,CAAC;AACrC,OAAO,EAAE,SAAS,EAAE,MAAM,MAAM,CAAC;AAEjC,MAAM,SAAS,GAAG,SAAS,CAAC,IAAI,CAAC,CAAC;AAElC;;GAEG;AACH,MAAM,SAAS,GAAG,oDAAoD,CAAC;AAEvE;;GAEG;AACH,MAAM,CAAC,KAAK,UAAU,mBAAmB,CAAC,QAAgB;IACxD,iDAAiD;IACjD,IAAI,UAAU,CAAC,QAAQ,CAAC,EAAE,CAAC;QACzB,MAAM,UAAU,GAAG,IAAI,CAAC,QAAQ,EAAE,QAAQ,CAAC,CAAC;QAC5C,MAAM,MAAM,GAAG,IAAI,CAAC,QAAQ,EAAE,IAAI,CAAC,CAAC;QACpC,MAAM,QAAQ,GAAG,IAAI,CAAC,QAAQ,EAAE,MAAM,CAAC,CAAC;QAExC,IAAI,UAAU,CAAC,UAAU,CAAC,IAAI,UAAU,CAAC,MAAM,CAAC,IAAI,UAAU,CAAC,QAAQ,CAAC,EAAE,CAAC;YACzE,OAAO,CAAC,KAAK,CAAC,yBAAyB,EAAE,QAAQ,CAAC,CAAC;YACnD,OAAO,IAAI,CAAC;QACd,CAAC;IACH,CAAC;IAED,wCAAwC;IACxC,OAAO,CAAC,KAAK,CAAC,uDAAuD,CAAC,CAAC;IACvE,OAAO,CAAC,KAAK,CAAC,0DAA0D,CAAC,CAAC;IAE1E,IAAI,CAAC;QACH,MAAM,YAAY,CAAC,QAAQ,CAAC,CAAC;QAC7B,OAAO,CAAC,KAAK,CAAC,8CAA8C,CAAC,CAAC;QAC9D,OAAO,IAAI,CAAC;IACd,CAAC;IAAC,OAAO,KAAK,EAAE,CAAC;QACf,OAAO,CAAC,KAAK,CAAC,uCAAuC,EAAE,KAAK,CAAC,CAAC;QAC9D,OAAO,CAAC,KAAK,CAAC,oEAAoE,CAAC,CAAC;QACpF,OAAO,CAAC,KAAK,CAAC,eAAe,SAAS,EAAE,CAAC,CAAC;QAC1C,OAAO,CAAC,KAAK,CAAC,4DAA4D,CAAC,CAAC;QAC5E,OAAO,CAAC,KAAK,CAAC,gCAAgC,CAAC,CAAC;QAChD,OAAO,KAAK,CAAC;IACf,CAAC;AACH,CAAC;AAED;;GAEG;AACH,KAAK,UAAU,YAAY,CAAC,QAAgB;IAC1C,MAAM,SAAS,GAAG,IAAI,CAAC,QAAQ,EAAE,IAAI,CAAC,CAAC;IAEvC,8CAA8C;IAC9C,MAAM,KAAK,CAAC,SAAS,EAAE,EAAE,SAAS,EAAE,IAAI,EAAE,CAAC,CAAC;IAE5C,OAAO,CAAC,KAAK,CAAC,2DAA2D,CAAC,CAAC;IAE3E,MAAM,OAAO,GAAG,IAAI,CAAC,SAAS,EAAE,YAAY,CAAC,CAAC;IAE9C,yCAAyC;IACzC,IAAI,UAAU,CAAC,OAAO,CAAC,EAAE,CAAC;QACxB,MAAM,SAAS,CAAC,WAAW,OAAO,GAAG,CAAC,CAAC;IACzC,CAAC;IAED,kDAAkD;IAClD,MAAM,QAAQ,GAAG;QACf,0CAA0C,SAAS,MAAM,OAAO,GAAG;QACnE,OAAO,OAAO,mCAAmC;QACjD,OAAO,OAAO,WAAW,QAAQ,GAAG;QACpC,WAAW,OAAO,GAAG;KACtB,CAAC;IAEF,KAAK,MAAM,GAAG,IAAI,QAAQ,EAAE,CAAC;QAC3B,MAAM,SAAS,CAAC,GAAG,CAAC,CAAC;IACvB,CAAC;IAED,OAAO,CAAC,KAAK,CAAC,kCAAkC,CAAC,CAAC;AACpD,CAAC;AAED;;GAEG;AACH,MAAM,CAAC,KAAK,UAAU,WAAW,CAAC,QAAgB;IAChD,IAAI,CAAC,UAAU,CAAC,QAAQ,CAAC,EAAE,CAAC;QAC1B,OAAO,CAAC,CAAC;IACX,CAAC;IAED,IAAI,CAAC;QACH,MAAM,EAAE,MAAM,EAAE,GAAG,MAAM,SAAS,CAAC,WAAW,QAAQ,aAAa,CAAC,CAAC;QACrE,OAAO,QAAQ,CAAC,MAAM,CAAC,IAAI,EAAE,EAAE,EAAE,CAAC,CAAC;IACrC,CAAC;IAAC,MAAM,CAAC;QACP,OAAO,CAAC,CAAC;IACX,CAAC;AACH,CAAC"}

package/build/utils/paths.d.ts

@@ -0,0 +1,67 @@
+import type { DocumentArea } from '../types/index.js';
+/**
+ * Resolves the docs directory path.
+ * Tries environment variable first, then auto-detects from package location.
+ * Note: This returns a path even if it doesn't exist yet - existence check happens later.
+ */
+export declare function resolveDocsPath(): string;
+/**
+ * Resolves cache directory path.
+ */
+export declare function resolveCacheDir(): string;
+/**
+ * Normalizes a file path (removes trailing slashes, normalizes separators)
+ */
+export declare function normalizePath(path: string): string;
+/**
+ * Resolves a relative link from a source file to an absolute path.
+ *
+ * @param sourcePath - Absolute path of the source file containing the link
+ * @param linkHref - The href from the markdown link
+ * @returns Absolute path to the linked file
+ */
+export declare function resolveRelativeLink(sourcePath: string, linkHref: string): string;
+/**
+ * Checks if a link is external (http://, https://, etc.)
+ */
+export declare function isExternalLink(href: string): boolean;
+/**
+ * Extracts the document area from a file path.
+ *
+ * @param filePath - Absolute or relative file path
+ * @returns The document area (ISuite, ci, or apim)
+ */
+export declare function getDocumentArea(filePath: string): DocumentArea;
+/**
+ * Converts an absolute path to a path relative to the docs directory.
+ */
+export declare function getRelativePath(absolutePath: string, docsPath: string): string;
+/**
+ * Converts a relative path (from docs directory) to an absolute path.
+ */
+export declare function getAbsolutePath(relativePath: string, docsPath: string): string;
+/**
+ * Gets the area-specific directory path.
+ *
+ * @param area - The document area
+ * @param docsPath - Base docs directory path
+ * @returns Absolute path to the area directory
+ */
+export declare function getAreaPath(area: DocumentArea, docsPath: string): string;
+/**
+ * Gets the index.md file path for a specific area.
+ */
+export declare function getIndexPath(area: DocumentArea, docsPath: string): string;
+/**
+ * Checks if a file path belongs to a specific area.
+ */
+export declare function isInArea(filePath: string, area: DocumentArea): boolean;
+/**
+ * Gets all area paths that should be searched.
+ *
+ * @param area - The area filter ('all' or specific area)
+ * @param docsPath - Base docs directory path
+ * @returns Array of area paths to search
+ */
+export declare function getAreaPaths(area: DocumentArea | 'all', docsPath: string): string[];
+//# sourceMappingURL=paths.d.ts.map

package/build/utils/paths.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"paths.d.ts","sourceRoot":"","sources":["../../src/utils/paths.ts"],"names":[],"mappings":"AAEA,OAAO,KAAK,EAAE,YAAY,EAAE,MAAM,mBAAmB,CAAC;AAMtD;;;;GAIG;AACH,wBAAgB,eAAe,IAAI,MAAM,CASxC;AAED;;GAEG;AACH,wBAAgB,eAAe,IAAI,MAAM,CAGxC;AAED;;GAEG;AACH,wBAAgB,aAAa,CAAC,IAAI,EAAE,MAAM,GAAG,MAAM,CAElD;AAED;;;;;;GAMG;AACH,wBAAgB,mBAAmB,CAAC,UAAU,EAAE,MAAM,EAAE,QAAQ,EAAE,MAAM,GAAG,MAAM,CAahF;AAED;;GAEG;AACH,wBAAgB,cAAc,CAAC,IAAI,EAAE,MAAM,GAAG,OAAO,CAEpD;AAED;;;;;GAKG;AACH,wBAAgB,eAAe,CAAC,QAAQ,EAAE,MAAM,GAAG,YAAY,CAa9D;AAED;;GAEG;AACH,wBAAgB,eAAe,CAAC,YAAY,EAAE,MAAM,EAAE,QAAQ,EAAE,MAAM,GAAG,MAAM,CAE9E;AAED;;GAEG;AACH,wBAAgB,eAAe,CAAC,YAAY,EAAE,MAAM,EAAE,QAAQ,EAAE,MAAM,GAAG,MAAM,CAK9E;AAED;;;;;;GAMG;AACH,wBAAgB,WAAW,CAAC,IAAI,EAAE,YAAY,EAAE,QAAQ,EAAE,MAAM,GAAG,MAAM,CAExE;AAED;;GAEG;AACH,wBAAgB,YAAY,CAAC,IAAI,EAAE,YAAY,EAAE,QAAQ,EAAE,MAAM,GAAG,MAAM,CAEzE;AAED;;GAEG;AACH,wBAAgB,QAAQ,CAAC,QAAQ,EAAE,MAAM,EAAE,IAAI,EAAE,YAAY,GAAG,OAAO,CAGtE;AAED;;;;;;GAMG;AACH,wBAAgB,YAAY,CAAC,IAAI,EAAE,YAAY,GAAG,KAAK,EAAE,QAAQ,EAAE,MAAM,GAAG,MAAM,EAAE,CAUnF"}

package/build/utils/paths.js

@@ -0,0 +1,132 @@
+import { fileURLToPath } from 'url';
+import { dirname, join, relative, resolve, isAbsolute, normalize } from 'path';
+// Get the directory of the current module
+const __filename = fileURLToPath(import.meta.url);
+const __dirname = dirname(__filename);
+/**
+ * Resolves the docs directory path.
+ * Tries environment variable first, then auto-detects from package location.
+ * Note: This returns a path even if it doesn't exist yet - existence check happens later.
+ */
+export function resolveDocsPath() {
+    // Check environment variable
+    if (process.env.MCP_DOCS_PATH) {
+        return resolve(process.env.MCP_DOCS_PATH);
+    }
+    // Auto-detect: go up from build/utils/ to package root, then to docs/
+    const projectRoot = resolve(__dirname, '..', '..');
+    return join(projectRoot, 'docs');
+}
+/**
+ * Resolves cache directory path.
+ */
+export function resolveCacheDir() {
+    const cacheDir = process.env.MCP_CACHE_DIR || '.mcp-cache';
+    return resolve(cacheDir);
+}
+/**
+ * Normalizes a file path (removes trailing slashes, normalizes separators)
+ */
+export function normalizePath(path) {
+    return normalize(path).replace(/[/\\]+$/, '');
+}
+/**
+ * Resolves a relative link from a source file to an absolute path.
+ *
+ * @param sourcePath - Absolute path of the source file containing the link
+ * @param linkHref - The href from the markdown link
+ * @returns Absolute path to the linked file
+ */
+export function resolveRelativeLink(sourcePath, linkHref) {
+    // Remove anchor if present
+    const [pathPart] = linkHref.split('#');
+    if (!pathPart) {
+        // Just an anchor (same page)
+        return sourcePath;
+    }
+    const sourceDir = dirname(sourcePath);
+    const resolved = resolve(sourceDir, pathPart);
+    return normalizePath(resolved);
+}
+/**
+ * Checks if a link is external (http://, https://, etc.)
+ */
+export function isExternalLink(href) {
+    return /^(https?|ftp|mailto):/.test(href);
+}
+/**
+ * Extracts the document area from a file path.
+ *
+ * @param filePath - Absolute or relative file path
+ * @returns The document area (ISuite, ci, or apim)
+ */
+export function getDocumentArea(filePath) {
+    const normalized = normalizePath(filePath);
+    if (normalized.includes('/ISuite/') || normalized.includes('\\ISuite\\')) {
+        return 'ISuite';
+    }
+    else if (normalized.includes('/ci/') || normalized.includes('\\ci\\')) {
+        return 'ci';
+    }
+    else if (normalized.includes('/apim/') || normalized.includes('\\apim\\')) {
+        return 'apim';
+    }
+    // Default to ISuite if can't determine
+    return 'ISuite';
+}
+/**
+ * Converts an absolute path to a path relative to the docs directory.
+ */
+export function getRelativePath(absolutePath, docsPath) {
+    return relative(docsPath, absolutePath);
+}
+/**
+ * Converts a relative path (from docs directory) to an absolute path.
+ */
+export function getAbsolutePath(relativePath, docsPath) {
+    if (isAbsolute(relativePath)) {
+        return relativePath;
+    }
+    return join(docsPath, relativePath);
+}
+/**
+ * Gets the area-specific directory path.
+ *
+ * @param area - The document area
+ * @param docsPath - Base docs directory path
+ * @returns Absolute path to the area directory
+ */
+export function getAreaPath(area, docsPath) {
+    return join(docsPath, area);
+}
+/**
+ * Gets the index.md file path for a specific area.
+ */
+export function getIndexPath(area, docsPath) {
+    return join(docsPath, area, 'index.md');
+}
+/**
+ * Checks if a file path belongs to a specific area.
+ */
+export function isInArea(filePath, area) {
+    const documentArea = getDocumentArea(filePath);
+    return documentArea === area;
+}
+/**
+ * Gets all area paths that should be searched.
+ *
+ * @param area - The area filter ('all' or specific area)
+ * @param docsPath - Base docs directory path
+ * @returns Array of area paths to search
+ */
+export function getAreaPaths(area, docsPath) {
+    if (area === 'all') {
+        return [
+            join(docsPath, 'ISuite'),
+            join(docsPath, 'ci'),
+            join(docsPath, 'apim'),
+        ];
+    }
+    return [join(docsPath, area)];
+}
+//# sourceMappingURL=paths.js.map

package/build/utils/paths.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"paths.js","sourceRoot":"","sources":["../../src/utils/paths.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,aAAa,EAAE,MAAM,KAAK,CAAC;AACpC,OAAO,EAAE,OAAO,EAAE,IAAI,EAAE,QAAQ,EAAE,OAAO,EAAE,UAAU,EAAE,SAAS,EAAE,MAAM,MAAM,CAAC;AAG/E,0CAA0C;AAC1C,MAAM,UAAU,GAAG,aAAa,CAAC,MAAM,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;AAClD,MAAM,SAAS,GAAG,OAAO,CAAC,UAAU,CAAC,CAAC;AAEtC;;;;GAIG;AACH,MAAM,UAAU,eAAe;IAC7B,6BAA6B;IAC7B,IAAI,OAAO,CAAC,GAAG,CAAC,aAAa,EAAE,CAAC;QAC9B,OAAO,OAAO,CAAC,OAAO,CAAC,GAAG,CAAC,aAAa,CAAC,CAAC;IAC5C,CAAC;IAED,sEAAsE;IACtE,MAAM,WAAW,GAAG,OAAO,CAAC,SAAS,EAAE,IAAI,EAAE,IAAI,CAAC,CAAC;IACnD,OAAO,IAAI,CAAC,WAAW,EAAE,MAAM,CAAC,CAAC;AACnC,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,eAAe;IAC7B,MAAM,QAAQ,GAAG,OAAO,CAAC,GAAG,CAAC,aAAa,IAAI,YAAY,CAAC;IAC3D,OAAO,OAAO,CAAC,QAAQ,CAAC,CAAC;AAC3B,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,aAAa,CAAC,IAAY;IACxC,OAAO,SAAS,CAAC,IAAI,CAAC,CAAC,OAAO,CAAC,SAAS,EAAE,EAAE,CAAC,CAAC;AAChD,CAAC;AAED;;;;;;GAMG;AACH,MAAM,UAAU,mBAAmB,CAAC,UAAkB,EAAE,QAAgB;IACtE,2BAA2B;IAC3B,MAAM,CAAC,QAAQ,CAAC,GAAG,QAAQ,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC;IAEvC,IAAI,CAAC,QAAQ,EAAE,CAAC;QACd,6BAA6B;QAC7B,OAAO,UAAU,CAAC;IACpB,CAAC;IAED,MAAM,SAAS,GAAG,OAAO,CAAC,UAAU,CAAC,CAAC;IACtC,MAAM,QAAQ,GAAG,OAAO,CAAC,SAAS,EAAE,QAAQ,CAAC,CAAC;IAE9C,OAAO,aAAa,CAAC,QAAQ,CAAC,CAAC;AACjC,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,cAAc,CAAC,IAAY;IACzC,OAAO,uBAAuB,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;AAC5C,CAAC;AAED;;;;;GAKG;AACH,MAAM,UAAU,eAAe,CAAC,QAAgB;IAC9C,MAAM,UAAU,GAAG,aAAa,CAAC,QAAQ,CAAC,CAAC;IAE3C,IAAI,UAAU,CAAC,QAAQ,CAAC,UAAU,CAAC,IAAI,UAAU,CAAC,QAAQ,CAAC,YAAY,CAAC,EAAE,CAAC;QACzE,OAAO,QAAQ,CAAC;IAClB,CAAC;SAAM,IAAI,UAAU,CAAC,QAAQ,CAAC,MAAM,CAAC,IAAI,UAAU,CAAC,QAAQ,CAAC,QAAQ,CAAC,EAAE,CAAC;QACxE,OAAO,IAAI,CAAC;IACd,CAAC;SAAM,IAAI,UAAU,CAAC,QAAQ,CAAC,QAAQ,CAAC,IAAI,UAAU,CAAC,QAAQ,CAAC,UAAU,CAAC,EAAE,CAAC;QAC5E,OAAO,MAAM,CAAC;IAChB,CAAC;IAED,uCAAuC;IACvC,OAAO,QAAQ,CAAC;AAClB,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,eAAe,CAAC,YAAoB,EAAE,QAAgB;IACpE,OAAO,QAAQ,CAAC,QAAQ,EAAE,YAAY,CAAC,CAAC;AAC1C,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,eAAe,CAAC,YAAoB,EAAE,QAAgB;IACpE,IAAI,UAAU,CAAC,YAAY,CAAC,EAAE,CAAC;QAC7B,OAAO,YAAY,CAAC;IACtB,CAAC;IACD,OAAO,IAAI,CAAC,QAAQ,EAAE,YAAY,CAAC,CAAC;AACtC,CAAC;AAED;;;;;;GAMG;AACH,MAAM,UAAU,WAAW,CAAC,IAAkB,EAAE,QAAgB;IAC9D,OAAO,IAAI,CAAC,QAAQ,EAAE,IAAI,CAAC,CAAC;AAC9B,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,YAAY,CAAC,IAAkB,EAAE,QAAgB;IAC/D,OAAO,IAAI,CAAC,QAAQ,EAAE,IAAI,EAAE,UAAU,CAAC,CAAC;AAC1C,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,QAAQ,CAAC,QAAgB,EAAE,IAAkB;IAC3D,MAAM,YAAY,GAAG,eAAe,CAAC,QAAQ,CAAC,CAAC;IAC/C,OAAO,YAAY,KAAK,IAAI,CAAC;AAC/B,CAAC;AAED;;;;;;GAMG;AACH,MAAM,UAAU,YAAY,CAAC,IAA0B,EAAE,QAAgB;IACvE,IAAI,IAAI,KAAK,KAAK,EAAE,CAAC;QACnB,OAAO;YACL,IAAI,CAAC,QAAQ,EAAE,QAAQ,CAAC;YACxB,IAAI,CAAC,QAAQ,EAAE,IAAI,CAAC;YACpB,IAAI,CAAC,QAAQ,EAAE,MAAM,CAAC;SACvB,CAAC;IACJ,CAAC;IAED,OAAO,CAAC,IAAI,CAAC,QAAQ,EAAE,IAAI,CAAC,CAAC,CAAC;AAChC,CAAC"}

package/build/utils/text-processing.d.ts

@@ -0,0 +1,62 @@
+import type { TextChunk } from '../types/index.js';
+/**
+ * Normalizes text for searching (lowercase, trim, normalize whitespace)
+ */
+export declare function normalizeText(text: string): string;
+/**
+ * Tokenizes text into words
+ */
+export declare function tokenize(text: string): string[];
+/**
+ * Extracts a snippet of text around a query match
+ *
+ * @param content - The full text content
+ * @param query - The search query
+ * @param contextLength - Number of characters to include before and after match
+ * @returns A snippet with the query highlighted in context
+ */
+export declare function extractSnippet(content: string, query: string, contextLength?: number): string;
+/**
+ * Calculates Levenshtein distance between two strings (for fuzzy matching)
+ */
+export declare function levenshteinDistance(a: string, b: string): number;
+/**
+ * Calculates fuzzy match score (0-100) based on Levenshtein distance
+ * 100 = exact match, lower scores = more different
+ */
+export declare function fuzzyMatchScore(str1: string, str2: string): number;
+/**
+ * Checks if text contains all words from query
+ */
+export declare function containsAllWords(text: string, query: string): boolean;
+/**
+ * Counts how many query words appear in the text
+ */
+export declare function countMatchingWords(text: string, query: string): number;
+/**
+ * Chunks text into smaller pieces with overlap
+ *
+ * @param text - The text to chunk
+ * @param maxTokens - Maximum tokens per chunk (approximate, using word count)
+ * @param overlapTokens - Number of tokens to overlap between chunks
+ * @returns Array of text chunks with metadata
+ */
+export declare function chunkText(text: string, maxTokens?: number, overlapTokens?: number): TextChunk[];
+/**
+ * Strips markdown from text (basic implementation)
+ * For more robust stripping, use remark-strip-markdown
+ */
+export declare function stripMarkdownBasic(text: string): string;
+/**
+ * Truncates text to a maximum length, breaking at word boundaries
+ */
+export declare function truncateText(text: string, maxLength: number): string;
+/**
+ * Creates a hash from a string (simple implementation for cache keys)
+ */
+export declare function hashString(str: string): string;
+/**
+ * Calculates cosine similarity between two vectors
+ */
+export declare function cosineSimilarity(a: number[], b: number[]): number;
+//# sourceMappingURL=text-processing.d.ts.map

package/build/utils/text-processing.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"text-processing.d.ts","sourceRoot":"","sources":["../../src/utils/text-processing.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,SAAS,EAAE,MAAM,mBAAmB,CAAC;AAEnD;;GAEG;AACH,wBAAgB,aAAa,CAAC,IAAI,EAAE,MAAM,GAAG,MAAM,CAElD;AAED;;GAEG;AACH,wBAAgB,QAAQ,CAAC,IAAI,EAAE,MAAM,GAAG,MAAM,EAAE,CAE/C;AAED;;;;;;;GAOG;AACH,wBAAgB,cAAc,CAAC,OAAO,EAAE,MAAM,EAAE,KAAK,EAAE,MAAM,EAAE,aAAa,GAAE,MAAY,GAAG,MAAM,CA2BlG;AAED;;GAEG;AACH,wBAAgB,mBAAmB,CAAC,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,MAAM,GAAG,MAAM,CA6BhE;AAED;;;GAGG;AACH,wBAAgB,eAAe,CAAC,IAAI,EAAE,MAAM,EAAE,IAAI,EAAE,MAAM,GAAG,MAAM,CAiBlE;AAED;;GAEG;AACH,wBAAgB,gBAAgB,CAAC,IAAI,EAAE,MAAM,EAAE,KAAK,EAAE,MAAM,GAAG,OAAO,CAKrE;AAED;;GAEG;AACH,wBAAgB,kBAAkB,CAAC,IAAI,EAAE,MAAM,EAAE,KAAK,EAAE,MAAM,GAAG,MAAM,CAKtE;AAED;;;;;;;GAOG;AACH,wBAAgB,SAAS,CAAC,IAAI,EAAE,MAAM,EAAE,SAAS,GAAE,MAAY,EAAE,aAAa,GAAE,MAAW,GAAG,SAAS,EAAE,CA4BxG;AAED;;;GAGG;AACH,wBAAgB,kBAAkB,CAAC,IAAI,EAAE,MAAM,GAAG,MAAM,CAwBvD;AAED;;GAEG;AACH,wBAAgB,YAAY,CAAC,IAAI,EAAE,MAAM,EAAE,SAAS,EAAE,MAAM,GAAG,MAAM,CAapE;AAED;;GAEG;AACH,wBAAgB,UAAU,CAAC,GAAG,EAAE,MAAM,GAAG,MAAM,CAQ9C;AAED;;GAEG;AACH,wBAAgB,gBAAgB,CAAC,CAAC,EAAE,MAAM,EAAE,EAAE,CAAC,EAAE,MAAM,EAAE,GAAG,MAAM,CAuBjE"}

package/build/utils/text-processing.js

@@ -0,0 +1,214 @@
+/**
+ * Normalizes text for searching (lowercase, trim, normalize whitespace)
+ */
+export function normalizeText(text) {
+    return text.toLowerCase().trim().replace(/\s+/g, ' ');
+}
+/**
+ * Tokenizes text into words
+ */
+export function tokenize(text) {
+    return normalizeText(text).split(/\s+/).filter(word => word.length > 0);
+}
+/**
+ * Extracts a snippet of text around a query match
+ *
+ * @param content - The full text content
+ * @param query - The search query
+ * @param contextLength - Number of characters to include before and after match
+ * @returns A snippet with the query highlighted in context
+ */
+export function extractSnippet(content, query, contextLength = 100) {
+    const normalizedContent = content.toLowerCase();
+    const normalizedQuery = query.toLowerCase();
+    // Find the first occurrence of the query
+    const index = normalizedContent.indexOf(normalizedQuery);
+    if (index === -1) {
+        // Query not found, return beginning of content
+        return content.substring(0, contextLength * 2) + (content.length > contextLength * 2 ? '...' : '');
+    }
+    // Calculate snippet boundaries
+    const start = Math.max(0, index - contextLength);
+    const end = Math.min(content.length, index + query.length + contextLength);
+    let snippet = content.substring(start, end);
+    // Add ellipsis if needed
+    if (start > 0) {
+        snippet = '...' + snippet;
+    }
+    if (end < content.length) {
+        snippet = snippet + '...';
+    }
+    return snippet.trim();
+}
+/**
+ * Calculates Levenshtein distance between two strings (for fuzzy matching)
+ */
+export function levenshteinDistance(a, b) {
+    const matrix = [];
+    // Initialize first column
+    for (let i = 0; i <= b.length; i++) {
+        matrix[i] = [i];
+    }
+    // Initialize first row
+    for (let j = 0; j <= a.length; j++) {
+        matrix[0][j] = j;
+    }
+    // Fill the matrix
+    for (let i = 1; i <= b.length; i++) {
+        for (let j = 1; j <= a.length; j++) {
+            if (b.charAt(i - 1) === a.charAt(j - 1)) {
+                matrix[i][j] = matrix[i - 1][j - 1];
+            }
+            else {
+                matrix[i][j] = Math.min(matrix[i - 1][j - 1] + 1, // substitution
+                matrix[i][j - 1] + 1, // insertion
+                matrix[i - 1][j] + 1 // deletion
+                );
+            }
+        }
+    }
+    return matrix[b.length][a.length];
+}
+/**
+ * Calculates fuzzy match score (0-100) based on Levenshtein distance
+ * 100 = exact match, lower scores = more different
+ */
+export function fuzzyMatchScore(str1, str2) {
+    const normalized1 = normalizeText(str1);
+    const normalized2 = normalizeText(str2);
+    if (normalized1 === normalized2) {
+        return 100;
+    }
+    const maxLen = Math.max(normalized1.length, normalized2.length);
+    if (maxLen === 0) {
+        return 100;
+    }
+    const distance = levenshteinDistance(normalized1, normalized2);
+    const score = Math.max(0, 100 - (distance / maxLen) * 100);
+    return Math.round(score);
+}
+/**
+ * Checks if text contains all words from query
+ */
+export function containsAllWords(text, query) {
+    const textWords = new Set(tokenize(text));
+    const queryWords = tokenize(query);
+    return queryWords.every(word => textWords.has(word));
+}
+/**
+ * Counts how many query words appear in the text
+ */
+export function countMatchingWords(text, query) {
+    const textWords = new Set(tokenize(text));
+    const queryWords = tokenize(query);
+    return queryWords.filter(word => textWords.has(word)).length;
+}
+/**
+ * Chunks text into smaller pieces with overlap
+ *
+ * @param text - The text to chunk
+ * @param maxTokens - Maximum tokens per chunk (approximate, using word count)
+ * @param overlapTokens - Number of tokens to overlap between chunks
+ * @returns Array of text chunks with metadata
+ */
+export function chunkText(text, maxTokens = 500, overlapTokens = 50) {
+    const words = text.split(/\s+/);
+    const chunks = [];
+    let chunkIndex = 0;
+    let currentPosition = 0;
+    while (currentPosition < words.length) {
+        const chunkWords = words.slice(currentPosition, currentPosition + maxTokens);
+        const chunkText = chunkWords.join(' ');
+        chunks.push({
+            text: chunkText,
+            chunkIndex,
+            startOffset: currentPosition,
+            endOffset: currentPosition + chunkWords.length,
+        });
+        chunkIndex++;
+        currentPosition += maxTokens - overlapTokens;
+        // Prevent infinite loop
+        if (chunkWords.length === 0) {
+            break;
+        }
+    }
+    return chunks;
+}
+/**
+ * Strips markdown from text (basic implementation)
+ * For more robust stripping, use remark-strip-markdown
+ */
+export function stripMarkdownBasic(text) {
+    return text
+        // Remove HTML comments
+        .replace(/<!--[\s\S]*?-->/g, '')
+        // Remove code blocks
+        .replace(/```[\s\S]*?```/g, '')
+        // Remove inline code
+        .replace(/`[^`]+`/g, '')
+        // Remove images
+        .replace(/!\[.*?\]\(.*?\)/g, '')
+        // Remove links but keep text
+        .replace(/\[([^\]]+)\]\([^\)]+\)/g, '$1')
+        // Remove headers
+        .replace(/^#+\s+/gm, '')
+        // Remove bold/italic
+        .replace(/\*\*([^*]+)\*\*/g, '$1')
+        .replace(/\*([^*]+)\*/g, '$1')
+        .replace(/__([^_]+)__/g, '$1')
+        .replace(/_([^_]+)_/g, '$1')
+        // Remove blockquotes
+        .replace(/^>\s+/gm, '')
+        // Normalize whitespace
+        .replace(/\n\n+/g, '\n\n')
+        .trim();
+}
+/**
+ * Truncates text to a maximum length, breaking at word boundaries
+ */
+export function truncateText(text, maxLength) {
+    if (text.length <= maxLength) {
+        return text;
+    }
+    const truncated = text.substring(0, maxLength);
+    const lastSpace = truncated.lastIndexOf(' ');
+    if (lastSpace > 0) {
+        return truncated.substring(0, lastSpace) + '...';
+    }
+    return truncated + '...';
+}
+/**
+ * Creates a hash from a string (simple implementation for cache keys)
+ */
+export function hashString(str) {
+    let hash = 0;
+    for (let i = 0; i < str.length; i++) {
+        const char = str.charCodeAt(i);
+        hash = ((hash << 5) - hash) + char;
+        hash = hash & hash; // Convert to 32-bit integer
+    }
+    return Math.abs(hash).toString(36);
+}
+/**
+ * Calculates cosine similarity between two vectors
+ */
+export function cosineSimilarity(a, b) {
+    if (a.length !== b.length) {
+        throw new Error('Vectors must have the 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);
+}
+//# sourceMappingURL=text-processing.js.map

package/build/utils/text-processing.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"text-processing.js","sourceRoot":"","sources":["../../src/utils/text-processing.ts"],"names":[],"mappings":"AAEA;;GAEG;AACH,MAAM,UAAU,aAAa,CAAC,IAAY;IACxC,OAAO,IAAI,CAAC,WAAW,EAAE,CAAC,IAAI,EAAE,CAAC,OAAO,CAAC,MAAM,EAAE,GAAG,CAAC,CAAC;AACxD,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,QAAQ,CAAC,IAAY;IACnC,OAAO,aAAa,CAAC,IAAI,CAAC,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,EAAE,CAAC,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;AAC1E,CAAC;AAED;;;;;;;GAOG;AACH,MAAM,UAAU,cAAc,CAAC,OAAe,EAAE,KAAa,EAAE,gBAAwB,GAAG;IACxF,MAAM,iBAAiB,GAAG,OAAO,CAAC,WAAW,EAAE,CAAC;IAChD,MAAM,eAAe,GAAG,KAAK,CAAC,WAAW,EAAE,CAAC;IAE5C,yCAAyC;IACzC,MAAM,KAAK,GAAG,iBAAiB,CAAC,OAAO,CAAC,eAAe,CAAC,CAAC;IAEzD,IAAI,KAAK,KAAK,CAAC,CAAC,EAAE,CAAC;QACjB,+CAA+C;QAC/C,OAAO,OAAO,CAAC,SAAS,CAAC,CAAC,EAAE,aAAa,GAAG,CAAC,CAAC,GAAG,CAAC,OAAO,CAAC,MAAM,GAAG,aAAa,GAAG,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;IACrG,CAAC;IAED,+BAA+B;IAC/B,MAAM,KAAK,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,KAAK,GAAG,aAAa,CAAC,CAAC;IACjD,MAAM,GAAG,GAAG,IAAI,CAAC,GAAG,CAAC,OAAO,CAAC,MAAM,EAAE,KAAK,GAAG,KAAK,CAAC,MAAM,GAAG,aAAa,CAAC,CAAC;IAE3E,IAAI,OAAO,GAAG,OAAO,CAAC,SAAS,CAAC,KAAK,EAAE,GAAG,CAAC,CAAC;IAE5C,yBAAyB;IACzB,IAAI,KAAK,GAAG,CAAC,EAAE,CAAC;QACd,OAAO,GAAG,KAAK,GAAG,OAAO,CAAC;IAC5B,CAAC;IACD,IAAI,GAAG,GAAG,OAAO,CAAC,MAAM,EAAE,CAAC;QACzB,OAAO,GAAG,OAAO,GAAG,KAAK,CAAC;IAC5B,CAAC;IAED,OAAO,OAAO,CAAC,IAAI,EAAE,CAAC;AACxB,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,mBAAmB,CAAC,CAAS,EAAE,CAAS;IACtD,MAAM,MAAM,GAAe,EAAE,CAAC;IAE9B,0BAA0B;IAC1B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QACnC,MAAM,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;IAClB,CAAC;IAED,uBAAuB;IACvB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QACnC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;IACnB,CAAC;IAED,kBAAkB;IAClB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QACnC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YACnC,IAAI,CAAC,CAAC,MAAM,CAAC,CAAC,GAAG,CAAC,CAAC,KAAK,CAAC,CAAC,MAAM,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC;gBACxC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,MAAM,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;YACtC,CAAC;iBAAM,CAAC;gBACN,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,GAAG,CACrB,MAAM,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,EAAE,eAAe;gBACzC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,EAAM,YAAY;gBACtC,MAAM,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAM,WAAW;iBACtC,CAAC;YACJ,CAAC;QACH,CAAC;IACH,CAAC;IAED,OAAO,MAAM,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC;AACpC,CAAC;AAED;;;GAGG;AACH,MAAM,UAAU,eAAe,CAAC,IAAY,EAAE,IAAY;IACxD,MAAM,WAAW,GAAG,aAAa,CAAC,IAAI,CAAC,CAAC;IACxC,MAAM,WAAW,GAAG,aAAa,CAAC,IAAI,CAAC,CAAC;IAExC,IAAI,WAAW,KAAK,WAAW,EAAE,CAAC;QAChC,OAAO,GAAG,CAAC;IACb,CAAC;IAED,MAAM,MAAM,GAAG,IAAI,CAAC,GAAG,CAAC,WAAW,CAAC,MAAM,EAAE,WAAW,CAAC,MAAM,CAAC,CAAC;IAChE,IAAI,MAAM,KAAK,CAAC,EAAE,CAAC;QACjB,OAAO,GAAG,CAAC;IACb,CAAC;IAED,MAAM,QAAQ,GAAG,mBAAmB,CAAC,WAAW,EAAE,WAAW,CAAC,CAAC;IAC/D,MAAM,KAAK,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,GAAG,GAAG,CAAC,QAAQ,GAAG,MAAM,CAAC,GAAG,GAAG,CAAC,CAAC;IAE3D,OAAO,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC;AAC3B,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,gBAAgB,CAAC,IAAY,EAAE,KAAa;IAC1D,MAAM,SAAS,GAAG,IAAI,GAAG,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC,CAAC;IAC1C,MAAM,UAAU,GAAG,QAAQ,CAAC,KAAK,CAAC,CAAC;IAEnC,OAAO,UAAU,CAAC,KAAK,CAAC,IAAI,CAAC,EAAE,CAAC,SAAS,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC;AACvD,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,kBAAkB,CAAC,IAAY,EAAE,KAAa;IAC5D,MAAM,SAAS,GAAG,IAAI,GAAG,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC,CAAC;IAC1C,MAAM,UAAU,GAAG,QAAQ,CAAC,KAAK,CAAC,CAAC;IAEnC,OAAO,UAAU,CAAC,MAAM,CAAC,IAAI,CAAC,EAAE,CAAC,SAAS,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,MAAM,CAAC;AAC/D,CAAC;AAED;;;;;;;GAOG;AACH,MAAM,UAAU,SAAS,CAAC,IAAY,EAAE,YAAoB,GAAG,EAAE,gBAAwB,EAAE;IACzF,MAAM,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC;IAChC,MAAM,MAAM,GAAgB,EAAE,CAAC;IAE/B,IAAI,UAAU,GAAG,CAAC,CAAC;IACnB,IAAI,eAAe,GAAG,CAAC,CAAC;IAExB,OAAO,eAAe,GAAG,KAAK,CAAC,MAAM,EAAE,CAAC;QACtC,MAAM,UAAU,GAAG,KAAK,CAAC,KAAK,CAAC,eAAe,EAAE,eAAe,GAAG,SAAS,CAAC,CAAC;QAC7E,MAAM,SAAS,GAAG,UAAU,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;QAEvC,MAAM,CAAC,IAAI,CAAC;YACV,IAAI,EAAE,SAAS;YACf,UAAU;YACV,WAAW,EAAE,eAAe;YAC5B,SAAS,EAAE,eAAe,GAAG,UAAU,CAAC,MAAM;SAC/C,CAAC,CAAC;QAEH,UAAU,EAAE,CAAC;QACb,eAAe,IAAI,SAAS,GAAG,aAAa,CAAC;QAE7C,wBAAwB;QACxB,IAAI,UAAU,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YAC5B,MAAM;QACR,CAAC;IACH,CAAC;IAED,OAAO,MAAM,CAAC;AAChB,CAAC;AAED;;;GAGG;AACH,MAAM,UAAU,kBAAkB,CAAC,IAAY;IAC7C,OAAO,IAAI;QACT,uBAAuB;SACtB,OAAO,CAAC,kBAAkB,EAAE,EAAE,CAAC;QAChC,qBAAqB;SACpB,OAAO,CAAC,iBAAiB,EAAE,EAAE,CAAC;QAC/B,qBAAqB;SACpB,OAAO,CAAC,UAAU,EAAE,EAAE,CAAC;QACxB,gBAAgB;SACf,OAAO,CAAC,kBAAkB,EAAE,EAAE,CAAC;QAChC,6BAA6B;SAC5B,OAAO,CAAC,yBAAyB,EAAE,IAAI,CAAC;QACzC,iBAAiB;SAChB,OAAO,CAAC,UAAU,EAAE,EAAE,CAAC;QACxB,qBAAqB;SACpB,OAAO,CAAC,kBAAkB,EAAE,IAAI,CAAC;SACjC,OAAO,CAAC,cAAc,EAAE,IAAI,CAAC;SAC7B,OAAO,CAAC,cAAc,EAAE,IAAI,CAAC;SAC7B,OAAO,CAAC,YAAY,EAAE,IAAI,CAAC;QAC5B,qBAAqB;SACpB,OAAO,CAAC,SAAS,EAAE,EAAE,CAAC;QACvB,uBAAuB;SACtB,OAAO,CAAC,QAAQ,EAAE,MAAM,CAAC;SACzB,IAAI,EAAE,CAAC;AACZ,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,YAAY,CAAC,IAAY,EAAE,SAAiB;IAC1D,IAAI,IAAI,CAAC,MAAM,IAAI,SAAS,EAAE,CAAC;QAC7B,OAAO,IAAI,CAAC;IACd,CAAC;IAED,MAAM,SAAS,GAAG,IAAI,CAAC,SAAS,CAAC,CAAC,EAAE,SAAS,CAAC,CAAC;IAC/C,MAAM,SAAS,GAAG,SAAS,CAAC,WAAW,CAAC,GAAG,CAAC,CAAC;IAE7C,IAAI,SAAS,GAAG,CAAC,EAAE,CAAC;QAClB,OAAO,SAAS,CAAC,SAAS,CAAC,CAAC,EAAE,SAAS,CAAC,GAAG,KAAK,CAAC;IACnD,CAAC;IAED,OAAO,SAAS,GAAG,KAAK,CAAC;AAC3B,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,UAAU,CAAC,GAAW;IACpC,IAAI,IAAI,GAAG,CAAC,CAAC;IACb,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,GAAG,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QACpC,MAAM,IAAI,GAAG,GAAG,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC;QAC/B,IAAI,GAAG,CAAC,CAAC,IAAI,IAAI,CAAC,CAAC,GAAG,IAAI,CAAC,GAAG,IAAI,CAAC;QACnC,IAAI,GAAG,IAAI,GAAG,IAAI,CAAC,CAAC,4BAA4B;IAClD,CAAC;IACD,OAAO,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,QAAQ,CAAC,EAAE,CAAC,CAAC;AACrC,CAAC;AAED;;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,mCAAmC,CAAC,CAAC;IACvD,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"}

package/package.json

@@ -0,0 +1,63 @@
+{
+  "name": "@contiva/sapbtp-docs-mcp",
+  "version": "1.0.1",
+  "description": "MCP server for SAP Business Technology Platform documentation - enables AI assistants to search and navigate SAP Business Technology Platform docs",
+  "type": "module",
+  "main": "./build/index.js",
+  "bin": {
+    "sapbtp-docs-mcp": "build/index.js"
+  },
+  "scripts": {
+    "build": "tsc",
+    "prepare": "npm run build",
+    "dev": "tsc --watch",
+    "start": "node ./build/index.js",
+    "prepublishOnly": "npm run build"
+  },
+  "files": [
+    "build/**/*",
+    "README.md",
+    "LICENSE"
+  ],
+  "keywords": [
+    "mcp",
+    "sap",
+    "business-technology-platform",
+    "documentation",
+    "search",
+    "ai",
+    "claude"
+  ],
+  "author": "Robert Fels",
+  "license": "Apache-2.0",
+  "repository": {
+    "type": "git",
+    "url": "git+https://github.com/robertfels/sapbtp-docs-mcp.git"
+  },
+  "homepage": "https://github.com/robertfels/sapbtp-docs-mcp#readme",
+  "bugs": {
+    "url": "https://github.com/robertfels/sapbtp-docs-mcp/issues"
+  },
+  "dependencies": {
+    "@modelcontextprotocol/sdk": "^1.0.4",
+    "@xenova/transformers": "^2.17.2",
+    "gray-matter": "^4.0.3",
+    "remark": "^15.0.1",
+    "remark-gfm": "^4.0.0",
+    "strip-markdown": "^6.0.0"
+  },
+  "optionalDependencies": {
+    "voyageai": "^0.0.6",
+    "openai": "^4.77.0"
+  },
+  "devDependencies": {
+    "@types/node": "^22.10.2",
+    "typescript": "^5.7.2"
+  },
+  "engines": {
+    "node": ">=18.0.0"
+  },
+  "publishConfig": {
+    "access": "public"
+  }
+}