mcp4openapi 0.3.1 → 0.3.3

package/dist/src/composite-executor.js

@@ -1,193 +0,0 @@
-/**
- * Composite action executor for chaining API calls
- *
- * Why: Reduces roundtrips by fetching related data in sequence (e.g., MR + comments).
- * Aggregates results into single JSON structure as defined by store_as paths.
- */
-import { DAGExecutor } from './dag-executor.js';
-import { isSafePropertyName } from './validation-utils.js';
-export class CompositeExecutor {
-    constructor(parser, httpClient, parameterAliases = {}) {
-        this.parser = parser;
-        this.httpClient = httpClient;
-        this.parameterAliases = parameterAliases;
-    }
-    /**
-     * Execute a series of API calls and merge results
-     *
-     * Why parallel: Steps may have dependencies, but independent steps can run concurrently.
-     * Uses DAG analysis to determine safe parallelization while maintaining correctness.
-     *
-     * Supports partial results: If allowPartial=true, continues after errors and returns
-     * what was completed. Useful for composite actions where some data is better than none.
-     */
-    async execute(steps, args, allowPartial = false, httpClient) {
-        // Analyze DAG and get execution levels
-        const executionLevels = DAGExecutor.topologicalSort(steps);
-        const result = {};
-        const errors = [];
-        let completedSteps = 0;
-        // Execute level by level (each level can run in parallel)
-        for (const level of executionLevels) {
-            // Execute all steps in current level concurrently
-            const levelPromises = level.steps.map((step, levelIndex) => this.executeStep(step, level.stepIndices[levelIndex], args, httpClient));
-            // Wait for all steps in this level to complete
-            const levelResults = await Promise.allSettled(levelPromises);
-            // Process results
-            for (let i = 0; i < levelResults.length; i++) {
-                const promiseResult = levelResults[i];
-                const step = level.steps[i];
-                const originalStepIndex = level.stepIndices[i];
-                if (promiseResult.status === 'fulfilled') {
-                    // Step completed successfully
-                    const response = promiseResult.value;
-                    this.storeResult(result, step.store_as, response.body);
-                    completedSteps++;
-                }
-                else {
-                    // Step failed
-                    const error = promiseResult.reason;
-                    const stepError = {
-                        step_index: originalStepIndex,
-                        step_call: step.call,
-                        error: error instanceof Error ? error.message : String(error),
-                        timestamp: new Date().toISOString(),
-                    };
-                    errors.push(stepError);
-                    // Store error in result for debugging
-                    this.storeResult(result, `${step.store_as}_error`, stepError);
-                    if (!allowPartial) {
-                        throw new Error(`Composite step ${originalStepIndex + 1}/${steps.length} failed: ${stepError.error}\n` +
-                            `Completed steps: ${completedSteps}\n` +
-                            `Failed step: ${step.call}`);
-                    }
-                }
-            }
-        }
-        return {
-            data: result,
-            completed_steps: completedSteps,
-            total_steps: steps.length,
-            errors: errors.length > 0 ? errors : undefined,
-        };
-    }
-    /**
-     * Execute single composite step (extracted for parallel execution)
-     *
-     * @param step The composite step to execute
-     * @param stepIndex Original index for error reporting
-     * @param args Arguments for parameter substitution
-     * @param httpClient Optional HTTP client override
-     * @returns Promise resolving to HTTP response
-     */
-    async executeStep(step, stepIndex, args, httpClient) {
-        const { method, path, operation } = this.parseCall(step.call);
-        if (!operation) {
-            throw new Error(`Operation not found for call: ${step.call}`);
-        }
-        // Substitute path parameters from args
-        const resolvedPath = this.resolvePath(path, args);
-        // Execute request
-        const client = httpClient || this.httpClient;
-        if (!client) {
-            throw new Error('HTTP client not provided');
-        }
-        const response = await client.request(method, resolvedPath, {
-            params: this.extractQueryParams(operation, args),
-            operationId: operation.operationId,
-        });
-        return response;
-    }
-    /**
-     * Parse composite step call syntax
-     *
-     * Format: "GET /projects/{id}/merge_requests/{iid}"
-     */
-    parseCall(call) {
-        const [method, path] = call.split(' ');
-        const pathInfo = this.parser.getPath(path);
-        const operation = pathInfo?.operations[method.toLowerCase()];
-        return { method, path, operation };
-    }
-    /**
-     * Resolve path template with actual values
-     *
-     * Example: "/projects/{id}" + {id: "123"} => "/projects/123"
-     * Supports parameter_aliases: {project_id: "123"} can map to {id} if configured
-     */
-    resolvePath(template, args) {
-        return template.replace(/\{(\w+)\}/g, (_, key) => {
-            // Try direct match first
-            if (args[key] !== undefined) {
-                return String(args[key]);
-            }
-            // Try aliases from profile
-            const possibleAliases = this.parameterAliases[key] || [];
-            for (const alias of possibleAliases) {
-                if (args[alias] !== undefined) {
-                    return String(args[alias]);
-                }
-            }
-            throw new Error(`Missing path parameter: ${key}` +
-                (possibleAliases.length > 0 ? `. Tried aliases: ${possibleAliases.join(', ')}` : ''));
-        });
-    }
-    /**
-     * Extract query parameters from args based on operation definition
-     */
-    extractQueryParams(operation, args) {
-        const params = {};
-        for (const param of operation.parameters) {
-            if (param.in === 'query' && args[param.name] !== undefined) {
-                const value = args[param.name];
-                // Pass arrays as-is for HttpClient serialization
-                if (Array.isArray(value)) {
-                    params[param.name] = value.map(String);
-                }
-                else {
-                    params[param.name] = String(value);
-                }
-            }
-        }
-        return params;
-    }
-    /**
-     * Store value at JSONPath-like location
-     *
-     * Why nested: Allows semantic structure (comments belong under merge_request object).
-     *
-     * Examples:
-     * - "merge_request" => { merge_request: value }
-     * - "merge_request.comments" => { merge_request: { comments: value } }
-     *
-     * Validates path navigation to prevent overwriting non-object values.
-     */
-    storeResult(target, path, value) {
-        const parts = path.split('.');
-        let current = target;
-        for (let i = 0; i < parts.length - 1; i++) {
-            const part = parts[i];
-            // Prevent prototype pollution
-            if (!isSafePropertyName(part)) {
-                throw new Error(`Invalid property name in path: ${part}`);
-            }
-            const existing = current[part];
-            // Validate we can navigate through this path
-            if (existing !== undefined && (typeof existing !== 'object' || existing === null)) {
-                throw new Error(`Cannot store at path '${path}': ` +
-                    `'${parts.slice(0, i + 1).join('.')}' is ${typeof existing}, not an object`);
-            }
-            if (!current[part]) {
-                // nosemgrep: javascript.lang.security.audit.prototype-pollution.prototype-pollution-loop.prototype-pollution-loop
-                current[part] = {};
-            }
-            current = current[part];
-        }
-        const finalKey = parts[parts.length - 1];
-        if (!isSafePropertyName(finalKey)) {
-            throw new Error(`Invalid property name in path: ${finalKey}`);
-        }
-        current[finalKey] = value;
-    }
-}
-//# sourceMappingURL=composite-executor.js.map

package/dist/src/composite-executor.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"composite-executor.js","sourceRoot":"","sources":["../../src/composite-executor.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;AAMH,OAAO,EAAE,WAAW,EAAuB,MAAM,mBAAmB,CAAC;AACrE,OAAO,EAAE,kBAAkB,EAAE,MAAM,uBAAuB,CAAC;AAgB3D,MAAM,OAAO,iBAAiB;IAC5B,YACU,MAAqB,EACrB,UAAuB,EACvB,mBAA6C,EAAE;QAF/C,WAAM,GAAN,MAAM,CAAe;QACrB,eAAU,GAAV,UAAU,CAAa;QACvB,qBAAgB,GAAhB,gBAAgB,CAA+B;IACtD,CAAC;IAEJ;;;;;;;;OAQG;IACH,KAAK,CAAC,OAAO,CACX,KAAsB,EACtB,IAA6B,EAC7B,eAAwB,KAAK,EAC7B,UAAuB;QAEvB,uCAAuC;QACvC,MAAM,eAAe,GAAG,WAAW,CAAC,eAAe,CAAC,KAAK,CAAC,CAAC;QAE3D,MAAM,MAAM,GAA4B,EAAE,CAAC;QAC3C,MAAM,MAAM,GAAgB,EAAE,CAAC;QAC/B,IAAI,cAAc,GAAG,CAAC,CAAC;QAEvB,0DAA0D;QAC1D,KAAK,MAAM,KAAK,IAAI,eAAe,EAAE,CAAC;YACpC,kDAAkD;YAClD,MAAM,aAAa,GAAG,KAAK,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,UAAU,EAAE,EAAE,CACzD,IAAI,CAAC,WAAW,CAAC,IAAI,EAAE,KAAK,CAAC,WAAW,CAAC,UAAU,CAAC,EAAE,IAAI,EAAE,UAAU,CAAC,CACxE,CAAC;YAEF,+CAA+C;YAC/C,MAAM,YAAY,GAAG,MAAM,OAAO,CAAC,UAAU,CAAC,aAAa,CAAC,CAAC;YAE7D,kBAAkB;YAClB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,YAAY,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;gBAC7C,MAAM,aAAa,GAAG,YAAY,CAAC,CAAC,CAAC,CAAC;gBACtC,MAAM,IAAI,GAAG,KAAK,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;gBAC5B,MAAM,iBAAiB,GAAG,KAAK,CAAC,WAAW,CAAC,CAAC,CAAC,CAAC;gBAE/C,IAAI,aAAa,CAAC,MAAM,KAAK,WAAW,EAAE,CAAC;oBACzC,8BAA8B;oBAC9B,MAAM,QAAQ,GAAG,aAAa,CAAC,KAAK,CAAC;oBACrC,IAAI,CAAC,WAAW,CAAC,MAAM,EAAE,IAAI,CAAC,QAAQ,EAAE,QAAQ,CAAC,IAAI,CAAC,CAAC;oBACvD,cAAc,EAAE,CAAC;gBACnB,CAAC;qBAAM,CAAC;oBACN,cAAc;oBACd,MAAM,KAAK,GAAG,aAAa,CAAC,MAAM,CAAC;oBACnC,MAAM,SAAS,GAAc;wBAC3B,UAAU,EAAE,iBAAiB;wBAC7B,SAAS,EAAE,IAAI,CAAC,IAAI;wBACpB,KAAK,EAAE,KAAK,YAAY,KAAK,CAAC,CAAC,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,MAAM,CAAC,KAAK,CAAC;wBAC7D,SAAS,EAAE,IAAI,IAAI,EAAE,CAAC,WAAW,EAAE;qBACpC,CAAC;oBAEF,MAAM,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;oBAEvB,sCAAsC;oBACtC,IAAI,CAAC,WAAW,CAAC,MAAM,EAAE,GAAG,IAAI,CAAC,QAAQ,QAAQ,EAAE,SAAS,CAAC,CAAC;oBAE9D,IAAI,CAAC,YAAY,EAAE,CAAC;wBAClB,MAAM,IAAI,KAAK,CACb,kBAAkB,iBAAiB,GAAG,CAAC,IAAI,KAAK,CAAC,MAAM,YAAY,SAAS,CAAC,KAAK,IAAI;4BACtF,oBAAoB,cAAc,IAAI;4BACtC,gBAAgB,IAAI,CAAC,IAAI,EAAE,CAC5B,CAAC;oBACJ,CAAC;gBACH,CAAC;YACH,CAAC;QACH,CAAC;QAED,OAAO;YACL,IAAI,EAAE,MAAM;YACZ,eAAe,EAAE,cAAc;YAC/B,WAAW,EAAE,KAAK,CAAC,MAAM;YACzB,MAAM,EAAE,MAAM,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,SAAS;SAC/C,CAAC;IACJ,CAAC;IAED;;;;;;;;OAQG;IACK,KAAK,CAAC,WAAW,CACvB,IAAmB,EACnB,SAAiB,EACjB,IAA6B,EAC7B,UAAuB;QAEvB,MAAM,EAAE,MAAM,EAAE,IAAI,EAAE,SAAS,EAAE,GAAG,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAE9D,IAAI,CAAC,SAAS,EAAE,CAAC;YACf,MAAM,IAAI,KAAK,CAAC,iCAAiC,IAAI,CAAC,IAAI,EAAE,CAAC,CAAC;QAChE,CAAC;QAED,uCAAuC;QACvC,MAAM,YAAY,GAAG,IAAI,CAAC,WAAW,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC;QAElD,kBAAkB;QAClB,MAAM,MAAM,GAAG,UAAU,IAAI,IAAI,CAAC,UAAU,CAAC;QAC7C,IAAI,CAAC,MAAM,EAAE,CAAC;YACZ,MAAM,IAAI,KAAK,CAAC,0BAA0B,CAAC,CAAC;QAC9C,CAAC;QAED,MAAM,QAAQ,GAAG,MAAM,MAAM,CAAC,OAAO,CAAC,MAAM,EAAE,YAAY,EAAE;YAC1D,MAAM,EAAE,IAAI,CAAC,kBAAkB,CAAC,SAAS,EAAE,IAAI,CAAC;YAChD,WAAW,EAAE,SAAS,CAAC,WAAW;SACnC,CAAC,CAAC;QAEH,OAAO,QAAQ,CAAC;IAClB,CAAC;IAED;;;;OAIG;IACK,SAAS,CAAC,IAAY;QAC5B,MAAM,CAAC,MAAM,EAAE,IAAI,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC;QACvC,MAAM,QAAQ,GAAG,IAAI,CAAC,MAAM,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC;QAC3C,MAAM,SAAS,GAAG,QAAQ,EAAE,UAAU,CAAC,MAAM,CAAC,WAAW,EAAE,CAAC,CAAC;QAE7D,OAAO,EAAE,MAAM,EAAE,IAAI,EAAE,SAAS,EAAE,CAAC;IACrC,CAAC;IAED;;;;;OAKG;IACK,WAAW,CAAC,QAAgB,EAAE,IAA6B;QACjE,OAAO,QAAQ,CAAC,OAAO,CAAC,YAAY,EAAE,CAAC,CAAC,EAAE,GAAG,EAAE,EAAE;YAC/C,yBAAyB;YACzB,IAAI,IAAI,CAAC,GAAG,CAAC,KAAK,SAAS,EAAE,CAAC;gBAC5B,OAAO,MAAM,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC;YAC3B,CAAC;YAED,2BAA2B;YAC3B,MAAM,eAAe,GAAG,IAAI,CAAC,gBAAgB,CAAC,GAAG,CAAC,IAAI,EAAE,CAAC;YACzD,KAAK,MAAM,KAAK,IAAI,eAAe,EAAE,CAAC;gBACpC,IAAI,IAAI,CAAC,KAAK,CAAC,KAAK,SAAS,EAAE,CAAC;oBAC9B,OAAO,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC;gBAC7B,CAAC;YACH,CAAC;YAED,MAAM,IAAI,KAAK,CACb,2BAA2B,GAAG,EAAE;gBAChC,CAAC,eAAe,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,oBAAoB,eAAe,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CACrF,CAAC;QACJ,CAAC,CAAC,CAAC;IACL,CAAC;IAED;;OAEG;IACK,kBAAkB,CAAC,SAAwB,EAAE,IAA6B;QAChF,MAAM,MAAM,GAAsC,EAAE,CAAC;QAErD,KAAK,MAAM,KAAK,IAAI,SAAS,CAAC,UAAU,EAAE,CAAC;YACzC,IAAI,KAAK,CAAC,EAAE,KAAK,OAAO,IAAI,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,KAAK,SAAS,EAAE,CAAC;gBAC3D,MAAM,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC;gBAC/B,iDAAiD;gBACjD,IAAI,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC,EAAE,CAAC;oBACzB,MAAM,CAAC,KAAK,CAAC,IAAI,CAAC,GAAG,KAAK,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;gBACzC,CAAC;qBAAM,CAAC;oBACN,MAAM,CAAC,KAAK,CAAC,IAAI,CAAC,GAAG,MAAM,CAAC,KAAK,CAAC,CAAC;gBACrC,CAAC;YACH,CAAC;QACH,CAAC;QAED,OAAO,MAAM,CAAC;IAChB,CAAC;IAED;;;;;;;;;;OAUG;IACK,WAAW,CAAC,MAA+B,EAAE,IAAY,EAAE,KAAc;QAC/E,MAAM,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC;QAC9B,IAAI,OAAO,GAAG,MAAiC,CAAC;QAEhD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;YAC1C,MAAM,IAAI,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC;YAEtB,8BAA8B;YAC9B,IAAI,CAAC,kBAAkB,CAAC,IAAI,CAAC,EAAE,CAAC;gBAC9B,MAAM,IAAI,KAAK,CAAC,kCAAkC,IAAI,EAAE,CAAC,CAAC;YAC5D,CAAC;YAED,MAAM,QAAQ,GAAG,OAAO,CAAC,IAAI,CAAC,CAAC;YAE/B,6CAA6C;YAC7C,IAAI,QAAQ,KAAK,SAAS,IAAI,CAAC,OAAO,QAAQ,KAAK,QAAQ,IAAI,QAAQ,KAAK,IAAI,CAAC,EAAE,CAAC;gBAClF,MAAM,IAAI,KAAK,CACb,yBAAyB,IAAI,KAAK;oBAClC,IAAI,KAAK,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,QAAQ,OAAO,QAAQ,iBAAiB,CAC5E,CAAC;YACJ,CAAC;YAED,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,EAAE,CAAC;gBACnB,kHAAkH;gBAClH,OAAO,CAAC,IAAI,CAAC,GAAG,EAAE,CAAC;YACrB,CAAC;YACD,OAAO,GAAG,OAAO,CAAC,IAAI,CAA4B,CAAC;QACrD,CAAC;QAED,MAAM,QAAQ,GAAG,KAAK,CAAC,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;QACzC,IAAI,CAAC,kBAAkB,CAAC,QAAQ,CAAC,EAAE,CAAC;YAClC,MAAM,IAAI,KAAK,CAAC,kCAAkC,QAAQ,EAAE,CAAC,CAAC;QAChE,CAAC;QACD,OAAO,CAAC,QAAQ,CAAC,GAAG,KAAK,CAAC;IAC5B,CAAC;CACF"}

package/dist/src/constants.d.ts

@@ -1,85 +0,0 @@
-/**
- * Application constants
- *
- * Why: Centralized constants improve readability and maintainability.
- * Magic numbers scattered through code are harder to understand and change.
- */
-/**
- * Time conversion constants
- */
-export declare const TIME: {
-    readonly MS_PER_SECOND: 1000;
-    readonly MS_PER_MINUTE: 60000;
-    readonly MS_PER_HOUR: 3600000;
-    readonly SECONDS_PER_MINUTE: 60;
-    readonly MINUTES_PER_HOUR: 60;
-};
-/**
- * HTTP status codes
- *
- * Why: Named constants more readable than numeric literals.
- * Makes intent clear (STATUS_TOO_MANY_REQUESTS vs 429).
- */
-export declare const HTTP_STATUS: {
-    readonly OK: 200;
-    readonly CREATED: 201;
-    readonly ACCEPTED: 202;
-    readonly FOUND: 302;
-    readonly MULTIPLE_CHOICES: 300;
-    readonly BAD_REQUEST: 400;
-    readonly UNAUTHORIZED: 401;
-    readonly FORBIDDEN: 403;
-    readonly NOT_FOUND: 404;
-    readonly METHOD_NOT_ALLOWED: 405;
-    readonly NOT_ACCEPTABLE: 406;
-    readonly TOO_MANY_REQUESTS: 429;
-    readonly INTERNAL_SERVER_ERROR: 500;
-    readonly BAD_GATEWAY: 502;
-    readonly SERVICE_UNAVAILABLE: 503;
-    readonly GATEWAY_TIMEOUT: 504;
-};
-/**
- * MIME type constants
- *
- * Why: Prevents typos in content-type headers and ensures consistency.
- */
-export declare const MIME_TYPES: {
-    readonly JSON: "application/json";
-    readonly EVENT_STREAM: "text/event-stream";
-    readonly FORM_URLENCODED: "application/x-www-form-urlencoded";
-};
-/**
- * OAuth and Well-Known URL paths
- *
- * Why: Centralized OAuth-related paths for consistency and easy updates.
- */
-export declare const OAUTH_PATHS: {
-    readonly AUTHORIZE: "/oauth/authorize";
-    readonly TOKEN: "/oauth/token";
-    readonly CALLBACK: "/oauth/callback";
-    readonly REGISTER: "/oauth/register";
-    readonly WELL_KNOWN_AUTHORIZATION_SERVER: "/.well-known/oauth-authorization-server";
-    readonly WELL_KNOWN_PROTECTED_RESOURCE: "/.well-known/oauth-protected-resource/mcp";
-};
-/**
- * Default timeout and interval values (in milliseconds)
- *
- * Why: Centralized timing configuration for sessions, heartbeats, and cleanup.
- */
-export declare const TIMEOUTS: {
-    readonly SESSION_TIMEOUT_MS: number;
-    readonly HEARTBEAT_INTERVAL_MS: number;
-    readonly RATE_LIMIT_WINDOW_MS: 60000;
-    readonly CLEANUP_INTERVAL_MS: 60000;
-};
-/**
- * OAuth rate limiting defaults
- *
- * Why: Centralized OAuth rate limiting configuration to prevent duplication
- * and ensure consistency across mcp-server.ts and http-transport.ts
- */
-export declare const OAUTH_RATE_LIMIT: {
-    readonly MAX_REQUESTS: 10;
-    readonly WINDOW_MS: number;
-};
-//# sourceMappingURL=constants.d.ts.map

package/dist/src/constants.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"constants.d.ts","sourceRoot":"","sources":["../../src/constants.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;AAEH;;GAEG;AACH,eAAO,MAAM,IAAI;;;;;;CAMP,CAAC;AAEX;;;;;GAKG;AACH,eAAO,MAAM,WAAW;;;;;;;;;;;;;;;;;CAiBd,CAAC;AAEX;;;;GAIG;AACH,eAAO,MAAM,UAAU;;;;CAIb,CAAC;AAEX;;;;GAIG;AACH,eAAO,MAAM,WAAW;;;;;;;CAOd,CAAC;AAEX;;;;GAIG;AACH,eAAO,MAAM,QAAQ;;;;;CAKX,CAAC;AAEX;;;;;GAKG;AACH,eAAO,MAAM,gBAAgB;;;CAGnB,CAAC"}

package/dist/src/constants.js

@@ -1,85 +0,0 @@
-/**
- * Application constants
- *
- * Why: Centralized constants improve readability and maintainability.
- * Magic numbers scattered through code are harder to understand and change.
- */
-/**
- * Time conversion constants
- */
-export const TIME = {
-    MS_PER_SECOND: 1000,
-    MS_PER_MINUTE: 60000,
-    MS_PER_HOUR: 3600000,
-    SECONDS_PER_MINUTE: 60,
-    MINUTES_PER_HOUR: 60,
-};
-/**
- * HTTP status codes
- *
- * Why: Named constants more readable than numeric literals.
- * Makes intent clear (STATUS_TOO_MANY_REQUESTS vs 429).
- */
-export const HTTP_STATUS = {
-    OK: 200,
-    CREATED: 201,
-    ACCEPTED: 202,
-    FOUND: 302,
-    MULTIPLE_CHOICES: 300,
-    BAD_REQUEST: 400,
-    UNAUTHORIZED: 401,
-    FORBIDDEN: 403,
-    NOT_FOUND: 404,
-    METHOD_NOT_ALLOWED: 405,
-    NOT_ACCEPTABLE: 406,
-    TOO_MANY_REQUESTS: 429,
-    INTERNAL_SERVER_ERROR: 500,
-    BAD_GATEWAY: 502,
-    SERVICE_UNAVAILABLE: 503,
-    GATEWAY_TIMEOUT: 504,
-};
-/**
- * MIME type constants
- *
- * Why: Prevents typos in content-type headers and ensures consistency.
- */
-export const MIME_TYPES = {
-    JSON: 'application/json',
-    EVENT_STREAM: 'text/event-stream',
-    FORM_URLENCODED: 'application/x-www-form-urlencoded',
-};
-/**
- * OAuth and Well-Known URL paths
- *
- * Why: Centralized OAuth-related paths for consistency and easy updates.
- */
-export const OAUTH_PATHS = {
-    AUTHORIZE: '/oauth/authorize',
-    TOKEN: '/oauth/token',
-    CALLBACK: '/oauth/callback',
-    REGISTER: '/oauth/register',
-    WELL_KNOWN_AUTHORIZATION_SERVER: '/.well-known/oauth-authorization-server',
-    WELL_KNOWN_PROTECTED_RESOURCE: '/.well-known/oauth-protected-resource/mcp',
-};
-/**
- * Default timeout and interval values (in milliseconds)
- *
- * Why: Centralized timing configuration for sessions, heartbeats, and cleanup.
- */
-export const TIMEOUTS = {
-    SESSION_TIMEOUT_MS: 30 * TIME.MS_PER_MINUTE, // 30 minutes
-    HEARTBEAT_INTERVAL_MS: 30 * TIME.MS_PER_SECOND, // 30 seconds
-    RATE_LIMIT_WINDOW_MS: TIME.MS_PER_MINUTE, // 1 minute
-    CLEANUP_INTERVAL_MS: TIME.MS_PER_MINUTE, // 1 minute
-};
-/**
- * OAuth rate limiting defaults
- *
- * Why: Centralized OAuth rate limiting configuration to prevent duplication
- * and ensure consistency across mcp-server.ts and http-transport.ts
- */
-export const OAUTH_RATE_LIMIT = {
-    MAX_REQUESTS: 10, // Max OAuth requests per window
-    WINDOW_MS: 10 * TIME.MS_PER_MINUTE, // 10 minutes window
-};
-//# sourceMappingURL=constants.js.map

package/dist/src/constants.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"constants.js","sourceRoot":"","sources":["../../src/constants.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;AAEH;;GAEG;AACH,MAAM,CAAC,MAAM,IAAI,GAAG;IAClB,aAAa,EAAE,IAAI;IACnB,aAAa,EAAE,KAAK;IACpB,WAAW,EAAE,OAAO;IACpB,kBAAkB,EAAE,EAAE;IACtB,gBAAgB,EAAE,EAAE;CACZ,CAAC;AAEX;;;;;GAKG;AACH,MAAM,CAAC,MAAM,WAAW,GAAG;IACzB,EAAE,EAAE,GAAG;IACP,OAAO,EAAE,GAAG;IACZ,QAAQ,EAAE,GAAG;IACb,KAAK,EAAE,GAAG;IACV,gBAAgB,EAAE,GAAG;IACrB,WAAW,EAAE,GAAG;IAChB,YAAY,EAAE,GAAG;IACjB,SAAS,EAAE,GAAG;IACd,SAAS,EAAE,GAAG;IACd,kBAAkB,EAAE,GAAG;IACvB,cAAc,EAAE,GAAG;IACnB,iBAAiB,EAAE,GAAG;IACtB,qBAAqB,EAAE,GAAG;IAC1B,WAAW,EAAE,GAAG;IAChB,mBAAmB,EAAE,GAAG;IACxB,eAAe,EAAE,GAAG;CACZ,CAAC;AAEX;;;;GAIG;AACH,MAAM,CAAC,MAAM,UAAU,GAAG;IACxB,IAAI,EAAE,kBAAkB;IACxB,YAAY,EAAE,mBAAmB;IACjC,eAAe,EAAE,mCAAmC;CAC5C,CAAC;AAEX;;;;GAIG;AACH,MAAM,CAAC,MAAM,WAAW,GAAG;IACzB,SAAS,EAAE,kBAAkB;IAC7B,KAAK,EAAE,cAAc;IACrB,QAAQ,EAAE,iBAAiB;IAC3B,QAAQ,EAAE,iBAAiB;IAC3B,+BAA+B,EAAE,yCAAyC;IAC1E,6BAA6B,EAAE,2CAA2C;CAClE,CAAC;AAEX;;;;GAIG;AACH,MAAM,CAAC,MAAM,QAAQ,GAAG;IACtB,kBAAkB,EAAE,EAAE,GAAG,IAAI,CAAC,aAAa,EAAG,aAAa;IAC3D,qBAAqB,EAAE,EAAE,GAAG,IAAI,CAAC,aAAa,EAAE,aAAa;IAC7D,oBAAoB,EAAE,IAAI,CAAC,aAAa,EAAM,WAAW;IACzD,mBAAmB,EAAE,IAAI,CAAC,aAAa,EAAO,WAAW;CACjD,CAAC;AAEX;;;;;GAKG;AACH,MAAM,CAAC,MAAM,gBAAgB,GAAG;IAC9B,YAAY,EAAE,EAAE,EAA+B,gCAAgC;IAC/E,SAAS,EAAE,EAAE,GAAG,IAAI,CAAC,aAAa,EAAa,oBAAoB;CAC3D,CAAC"}

package/dist/src/dag-executor.d.ts

@@ -1,49 +0,0 @@
-/**
- * DAG Execution Engine for Composite Steps
- *
- * Why: Enables parallel execution of independent composite steps
- * while maintaining correct dependency order.
- *
- * Uses Kahn's algorithm for topological sorting - BFS-based approach
- * that detects cycles and determines execution levels.
- */
-import type { CompositeStep } from './types/profile.js';
-/**
- * Execution level containing steps that can run in parallel
- */
-export interface ExecutionLevel {
-    steps: CompositeStep[];
-    stepIndices: number[];
-}
-/**
- * Topological sort result for DAG execution
- */
-export interface TopologicalSortResult {
-    levels: ExecutionLevel[];
-    hasCycles: boolean;
-    errorMessage?: string;
-}
-/**
- * Execute composite steps with DAG-based parallelization
- *
- * Why: Some steps may depend on others (e.g., get MR ID, then fetch comments).
- * Independent steps can run in parallel for better performance.
- */
-export declare class DAGExecutor {
-    /**
-     * Sort composite steps into execution levels using Kahn's algorithm
-     *
-     * @param steps Composite steps with optional depends_on
-     * @returns Execution levels where each level can run in parallel
-     * @throws Error if cycles detected or invalid dependencies
-     */
-    static topologicalSort(steps: CompositeStep[]): ExecutionLevel[];
-    /**
-     * Analyze DAG structure without throwing
-     *
-     * @param steps Composite steps to analyze
-     * @returns Analysis result with levels or error info
-     */
-    static analyzeDAG(steps: CompositeStep[]): TopologicalSortResult;
-}
-//# sourceMappingURL=dag-executor.d.ts.map

package/dist/src/dag-executor.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"dag-executor.d.ts","sourceRoot":"","sources":["../../src/dag-executor.ts"],"names":[],"mappings":"AAAA;;;;;;;;GAQG;AAEH,OAAO,KAAK,EAAE,aAAa,EAAE,MAAM,oBAAoB,CAAC;AAExD;;GAEG;AACH,MAAM,WAAW,cAAc;IAC7B,KAAK,EAAE,aAAa,EAAE,CAAC;IACvB,WAAW,EAAE,MAAM,EAAE,CAAC;CACvB;AAED;;GAEG;AACH,MAAM,WAAW,qBAAqB;IACpC,MAAM,EAAE,cAAc,EAAE,CAAC;IACzB,SAAS,EAAE,OAAO,CAAC;IACnB,YAAY,CAAC,EAAE,MAAM,CAAC;CACvB;AAED;;;;;GAKG;AACH,qBAAa,WAAW;IACtB;;;;;;OAMG;IACH,MAAM,CAAC,eAAe,CAAC,KAAK,EAAE,aAAa,EAAE,GAAG,cAAc,EAAE;IAQhE;;;;;OAKG;IACH,MAAM,CAAC,UAAU,CAAC,KAAK,EAAE,aAAa,EAAE,GAAG,qBAAqB;CAoHjE"}

package/dist/src/dag-executor.js

@@ -1,138 +0,0 @@
-/**
- * DAG Execution Engine for Composite Steps
- *
- * Why: Enables parallel execution of independent composite steps
- * while maintaining correct dependency order.
- *
- * Uses Kahn's algorithm for topological sorting - BFS-based approach
- * that detects cycles and determines execution levels.
- */
-/**
- * Execute composite steps with DAG-based parallelization
- *
- * Why: Some steps may depend on others (e.g., get MR ID, then fetch comments).
- * Independent steps can run in parallel for better performance.
- */
-export class DAGExecutor {
-    /**
-     * Sort composite steps into execution levels using Kahn's algorithm
-     *
-     * @param steps Composite steps with optional depends_on
-     * @returns Execution levels where each level can run in parallel
-     * @throws Error if cycles detected or invalid dependencies
-     */
-    static topologicalSort(steps) {
-        const result = this.analyzeDAG(steps);
-        if (result.hasCycles) {
-            throw new Error(`DAG analysis failed: ${result.errorMessage}`);
-        }
-        return result.levels;
-    }
-    /**
-     * Analyze DAG structure without throwing
-     *
-     * @param steps Composite steps to analyze
-     * @returns Analysis result with levels or error info
-     */
-    static analyzeDAG(steps) {
-        // Build dependency graph and in-degree map
-        const graph = new Map(); // node -> list of dependent nodes
-        const inDegree = new Map();
-        // Initialize all nodes
-        for (const step of steps) {
-            const node = step.store_as;
-            inDegree.set(node, 0);
-            if (!graph.has(node)) {
-                graph.set(node, []);
-            }
-        }
-        // Build edges and calculate in-degrees
-        for (const step of steps) {
-            if (step.depends_on) {
-                for (const dep of step.depends_on) {
-                    // Validate dependency exists
-                    if (!inDegree.has(dep)) {
-                        return {
-                            levels: [],
-                            hasCycles: true,
-                            errorMessage: `Step '${step.store_as}' depends on '${dep}' but no step produces '${dep}'`
-                        };
-                    }
-                    // Add edge: dep -> step.store_as
-                    if (!graph.has(dep)) {
-                        graph.set(dep, []);
-                    }
-                    graph.get(dep).push(step.store_as);
-                    // Increase in-degree of dependent step
-                    inDegree.set(step.store_as, inDegree.get(step.store_as) + 1);
-                }
-            }
-        }
-        // Kahn's algorithm: BFS with in-degree
-        const levels = [];
-        const queue = [];
-        // Start with nodes having in-degree 0 (no dependencies)
-        for (const [node, degree] of inDegree) {
-            if (degree === 0) {
-                queue.push(node);
-            }
-        }
-        // Process queue level by level
-        while (queue.length > 0) {
-            const currentLevel = [];
-            const currentIndices = [];
-            const levelSize = queue.length;
-            // Process all nodes at current level (can run in parallel)
-            for (let i = 0; i < levelSize; i++) {
-                const node = queue.shift();
-                // Find corresponding step and add to level
-                const stepIndex = steps.findIndex(s => s.store_as === node);
-                if (stepIndex >= 0) {
-                    currentLevel.push(steps[stepIndex]);
-                    currentIndices.push(stepIndex);
-                }
-                // Decrease in-degree of all dependent nodes
-                const neighbors = graph.get(node) || [];
-                for (const neighbor of neighbors) {
-                    const newDegree = inDegree.get(neighbor) - 1;
-                    inDegree.set(neighbor, newDegree);
-                    // If in-degree becomes 0, add to next level
-                    if (newDegree === 0) {
-                        queue.push(neighbor);
-                    }
-                }
-            }
-            // Add level if it contains steps
-            if (currentLevel.length > 0) {
-                levels.push({ steps: currentLevel, stepIndices: currentIndices });
-            }
-        }
-        // Check for cycles: if not all nodes were processed
-        const processedCount = levels.reduce((sum, level) => sum + level.steps.length, 0);
-        if (processedCount !== steps.length) {
-            // Find unprocessed nodes (part of cycle)
-            const processedNodes = new Set();
-            for (const level of levels) {
-                for (const step of level.steps) {
-                    processedNodes.add(step.store_as);
-                }
-            }
-            const cycleNodes = [];
-            for (const step of steps) {
-                if (!processedNodes.has(step.store_as)) {
-                    cycleNodes.push(step.store_as);
-                }
-            }
-            return {
-                levels: [],
-                hasCycles: true,
-                errorMessage: `Circular dependency detected involving: ${cycleNodes.join(', ')}`
-            };
-        }
-        return {
-            levels,
-            hasCycles: false
-        };
-    }
-}
-//# sourceMappingURL=dag-executor.js.map

package/dist/src/dag-executor.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"dag-executor.js","sourceRoot":"","sources":["../../src/dag-executor.ts"],"names":[],"mappings":"AAAA;;;;;;;;GAQG;AAqBH;;;;;GAKG;AACH,MAAM,OAAO,WAAW;IACtB;;;;;;OAMG;IACH,MAAM,CAAC,eAAe,CAAC,KAAsB;QAC3C,MAAM,MAAM,GAAG,IAAI,CAAC,UAAU,CAAC,KAAK,CAAC,CAAC;QACtC,IAAI,MAAM,CAAC,SAAS,EAAE,CAAC;YACrB,MAAM,IAAI,KAAK,CAAC,wBAAwB,MAAM,CAAC,YAAY,EAAE,CAAC,CAAC;QACjE,CAAC;QACD,OAAO,MAAM,CAAC,MAAM,CAAC;IACvB,CAAC;IAED;;;;;OAKG;IACH,MAAM,CAAC,UAAU,CAAC,KAAsB;QACtC,2CAA2C;QAC3C,MAAM,KAAK,GAAG,IAAI,GAAG,EAAoB,CAAC,CAAC,kCAAkC;QAC7E,MAAM,QAAQ,GAAG,IAAI,GAAG,EAAkB,CAAC;QAE3C,uBAAuB;QACvB,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;YACzB,MAAM,IAAI,GAAG,IAAI,CAAC,QAAQ,CAAC;YAC3B,QAAQ,CAAC,GAAG,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC;YACtB,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC;gBACrB,KAAK,CAAC,GAAG,CAAC,IAAI,EAAE,EAAE,CAAC,CAAC;YACtB,CAAC;QACH,CAAC;QAED,uCAAuC;QACvC,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;YACzB,IAAI,IAAI,CAAC,UAAU,EAAE,CAAC;gBACpB,KAAK,MAAM,GAAG,IAAI,IAAI,CAAC,UAAU,EAAE,CAAC;oBAClC,6BAA6B;oBAC7B,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC;wBACvB,OAAO;4BACL,MAAM,EAAE,EAAE;4BACV,SAAS,EAAE,IAAI;4BACf,YAAY,EAAE,SAAS,IAAI,CAAC,QAAQ,iBAAiB,GAAG,2BAA2B,GAAG,GAAG;yBAC1F,CAAC;oBACJ,CAAC;oBAED,iCAAiC;oBACjC,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC;wBACpB,KAAK,CAAC,GAAG,CAAC,GAAG,EAAE,EAAE,CAAC,CAAC;oBACrB,CAAC;oBACD,KAAK,CAAC,GAAG,CAAC,GAAG,CAAE,CAAC,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;oBAEpC,uCAAuC;oBACvC,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,QAAQ,EAAE,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,QAAQ,CAAE,GAAG,CAAC,CAAC,CAAC;gBAChE,CAAC;YACH,CAAC;QACH,CAAC;QAED,uCAAuC;QACvC,MAAM,MAAM,GAAqB,EAAE,CAAC;QACpC,MAAM,KAAK,GAAa,EAAE,CAAC;QAE3B,wDAAwD;QACxD,KAAK,MAAM,CAAC,IAAI,EAAE,MAAM,CAAC,IAAI,QAAQ,EAAE,CAAC;YACtC,IAAI,MAAM,KAAK,CAAC,EAAE,CAAC;gBACjB,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YACnB,CAAC;QACH,CAAC;QAED,+BAA+B;QAC/B,OAAO,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YACxB,MAAM,YAAY,GAAoB,EAAE,CAAC;YACzC,MAAM,cAAc,GAAa,EAAE,CAAC;YACpC,MAAM,SAAS,GAAG,KAAK,CAAC,MAAM,CAAC;YAE/B,2DAA2D;YAC3D,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,SAAS,EAAE,CAAC,EAAE,EAAE,CAAC;gBACnC,MAAM,IAAI,GAAG,KAAK,CAAC,KAAK,EAAG,CAAC;gBAE5B,2CAA2C;gBAC3C,MAAM,SAAS,GAAG,KAAK,CAAC,SAAS,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,QAAQ,KAAK,IAAI,CAAC,CAAC;gBAC5D,IAAI,SAAS,IAAI,CAAC,EAAE,CAAC;oBACnB,YAAY,CAAC,IAAI,CAAC,KAAK,CAAC,SAAS,CAAC,CAAC,CAAC;oBACpC,cAAc,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;gBACjC,CAAC;gBAED,4CAA4C;gBAC5C,MAAM,SAAS,GAAG,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC;gBACxC,KAAK,MAAM,QAAQ,IAAI,SAAS,EAAE,CAAC;oBACjC,MAAM,SAAS,GAAG,QAAQ,CAAC,GAAG,CAAC,QAAQ,CAAE,GAAG,CAAC,CAAC;oBAC9C,QAAQ,CAAC,GAAG,CAAC,QAAQ,EAAE,SAAS,CAAC,CAAC;oBAElC,4CAA4C;oBAC5C,IAAI,SAAS,KAAK,CAAC,EAAE,CAAC;wBACpB,KAAK,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;oBACvB,CAAC;gBACH,CAAC;YACH,CAAC;YAED,iCAAiC;YACjC,IAAI,YAAY,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;gBAC5B,MAAM,CAAC,IAAI,CAAC,EAAE,KAAK,EAAE,YAAY,EAAE,WAAW,EAAE,cAAc,EAAE,CAAC,CAAC;YACpE,CAAC;QACH,CAAC;QAED,oDAAoD;QACpD,MAAM,cAAc,GAAG,MAAM,CAAC,MAAM,CAAC,CAAC,GAAG,EAAE,KAAK,EAAE,EAAE,CAAC,GAAG,GAAG,KAAK,CAAC,KAAK,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC;QAClF,IAAI,cAAc,KAAK,KAAK,CAAC,MAAM,EAAE,CAAC;YACpC,yCAAyC;YACzC,MAAM,cAAc,GAAG,IAAI,GAAG,EAAU,CAAC;YACzC,KAAK,MAAM,KAAK,IAAI,MAAM,EAAE,CAAC;gBAC3B,KAAK,MAAM,IAAI,IAAI,KAAK,CAAC,KAAK,EAAE,CAAC;oBAC/B,cAAc,CAAC,GAAG,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;gBACpC,CAAC;YACH,CAAC;YAED,MAAM,UAAU,GAAa,EAAE,CAAC;YAChC,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;gBACzB,IAAI,CAAC,cAAc,CAAC,GAAG,CAAC,IAAI,CAAC,QAAQ,CAAC,EAAE,CAAC;oBACvC,UAAU,CAAC,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;gBACjC,CAAC;YACH,CAAC;YAED,OAAO;gBACL,MAAM,EAAE,EAAE;gBACV,SAAS,EAAE,IAAI;gBACf,YAAY,EAAE,2CAA2C,UAAU,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE;aACjF,CAAC;QACJ,CAAC;QAED,OAAO;YACL,MAAM;YACN,SAAS,EAAE,KAAK;SACjB,CAAC;IACJ,CAAC;CACF"}

package/dist/src/errors.d.ts

@@ -1,59 +0,0 @@
-/**
- * Structured error types for MCP server
- *
- * Provides type-safe error handling with machine-readable error codes
- * and structured error details for better debugging and client handling.
- */
-export declare class MCPError extends Error {
-    code: string;
-    details?: Record<string, unknown> | undefined;
-    constructor(message: string, code: string, details?: Record<string, unknown> | undefined);
-}
-export declare class ValidationError extends MCPError {
-    constructor(message: string, details?: Record<string, unknown>);
-}
-export declare class OperationNotFoundError extends MCPError {
-    constructor(operationId: string);
-}
-export declare class ResourceNotFoundError extends MCPError {
-    constructor(resource: string, resourceType?: string);
-}
-export declare class ParameterError extends MCPError {
-    constructor(paramName: string, reason: string);
-}
-export declare class AuthenticationError extends MCPError {
-    constructor(message?: string, details?: Record<string, unknown>);
-}
-export declare class AuthorizationError extends MCPError {
-    constructor(message?: string);
-}
-export declare class RateLimitError extends MCPError {
-    constructor(message: string, retryAfter?: number);
-}
-export declare class NetworkError extends MCPError {
-    constructor(message: string, statusCode?: number, details?: Record<string, unknown>);
-}
-export declare class ConfigurationError extends MCPError {
-    constructor(message: string, details?: Record<string, unknown>);
-}
-export declare class SessionError extends MCPError {
-    constructor(message: string, sessionId?: string);
-}
-export declare class UnknownCliFlagError extends MCPError {
-    constructor(flags: string[]);
-}
-/**
- * Helper function to check if an error is an MCPError
- */
-export declare function isMCPError(error: unknown): error is MCPError;
-/**
- * Generate a unique correlation ID for error tracking
- *
- * Why: Allows matching client-reported errors with server logs
- */
-export declare function generateCorrelationId(): string;
-/**
- * Helper function to get error details for logging
- */
-export declare function getErrorDetails(error: unknown): Record<string, unknown>;
-//# sourceMappingURL=errors.d.ts.map

package/dist/src/errors.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"errors.d.ts","sourceRoot":"","sources":["../../src/errors.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;AAIH,qBAAa,QAAS,SAAQ,KAAK;IAGxB,IAAI,EAAE,MAAM;IACZ,OAAO,CAAC,EAAE,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC;gBAFxC,OAAO,EAAE,MAAM,EACR,IAAI,EAAE,MAAM,EACZ,OAAO,CAAC,EAAE,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,YAAA;CAK3C;AAED,qBAAa,eAAgB,SAAQ,QAAQ;gBAC/B,OAAO,EAAE,MAAM,EAAE,OAAO,CAAC,EAAE,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC;CAI/D;AAED,qBAAa,sBAAuB,SAAQ,QAAQ;gBACtC,WAAW,EAAE,MAAM;CAQhC;AAED,qBAAa,qBAAsB,SAAQ,QAAQ;gBACrC,QAAQ,EAAE,MAAM,EAAE,YAAY,GAAE,MAAmB;CAQhE;AAED,qBAAa,cAAe,SAAQ,QAAQ;gBAC9B,SAAS,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM;CAQ9C;AAED,qBAAa,mBAAoB,SAAQ,QAAQ;gBACnC,OAAO,GAAE,MAAkC,EAAE,OAAO,CAAC,EAAE,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC;CAI3F;AAED,qBAAa,kBAAmB,SAAQ,QAAQ;gBAClC,OAAO,GAAE,MAAmC;CAIzD;AAED,qBAAa,cAAe,SAAQ,QAAQ;gBAC9B,OAAO,EAAE,MAAM,EAAE,UAAU,CAAC,EAAE,MAAM;CAIjD;AAED,qBAAa,YAAa,SAAQ,QAAQ;gBAC5B,OAAO,EAAE,MAAM,EAAE,UAAU,CAAC,EAAE,MAAM,EAAE,OAAO,CAAC,EAAE,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC;CAIpF;AAED,qBAAa,kBAAmB,SAAQ,QAAQ;gBAClC,OAAO,EAAE,MAAM,EAAE,OAAO,CAAC,EAAE,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC;CAI/D;AAED,qBAAa,YAAa,SAAQ,QAAQ;gBAC5B,OAAO,EAAE,MAAM,EAAE,SAAS,CAAC,EAAE,MAAM;CAIhD;AAED,qBAAa,mBAAoB,SAAQ,QAAQ;gBACnC,KAAK,EAAE,MAAM,EAAE;CAS5B;AAED;;GAEG;AACH,wBAAgB,UAAU,CAAC,KAAK,EAAE,OAAO,GAAG,KAAK,IAAI,QAAQ,CAE5D;AAED;;;;GAIG;AACH,wBAAgB,qBAAqB,IAAI,MAAM,CAE9C;AAED;;GAEG;AACH,wBAAgB,eAAe,CAAC,KAAK,EAAE,OAAO,GAAG,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,CAoBvE"}