universal-agent-protocol 0.5.0

package/dist/utils/calculate-average.js

@@ -0,0 +1,21 @@
+/**
+ * Calculates the arithmetic mean of an array of numbers.
+ *
+ * @param numbers - An array of numbers to calculate the average of
+ * @returns The arithmetic mean of the numbers, or 0 if the array is empty
+ *
+ * @example
+ * ```typescript
+ * calculateAverage([1, 2, 3, 4, 5]); // Returns: 3
+ * calculateAverage([10, 20]); // Returns: 15
+ * calculateAverage([]); // Returns: 0
+ * ```
+ */
+export function calculateAverage(numbers) {
+    if (numbers.length === 0) {
+        return 0;
+    }
+    const sum = numbers.reduce((acc, num) => acc + num, 0);
+    return sum / numbers.length;
+}
+//# sourceMappingURL=calculate-average.js.map

package/dist/utils/calculate-average.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"calculate-average.js","sourceRoot":"","sources":["../../src/utils/calculate-average.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;GAYG;AACH,MAAM,UAAU,gBAAgB,CAAC,OAAiB;IAChD,IAAI,OAAO,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QACzB,OAAO,CAAC,CAAC;IACX,CAAC;IAED,MAAM,GAAG,GAAG,OAAO,CAAC,MAAM,CAAC,CAAC,GAAG,EAAE,GAAG,EAAE,EAAE,CAAC,GAAG,GAAG,GAAG,EAAE,CAAC,CAAC,CAAC;IACvD,OAAO,GAAG,GAAG,OAAO,CAAC,MAAM,CAAC;AAC9B,CAAC"}

package/dist/utils/config-manager.d.ts

@@ -0,0 +1,30 @@
+/**
+ * Singleton configuration manager backed by an in-memory Map.
+ */
+export declare class ConfigManager {
+    private static instance;
+    private config;
+    /**
+     * Creates a new ConfigManager instance.
+     */
+    private constructor();
+    /**
+     * Returns the singleton instance of the ConfigManager.
+     * @returns The singleton ConfigManager instance.
+     */
+    static getInstance(): ConfigManager;
+    /**
+     * Gets a configuration value by key.
+     * @param key - Configuration key to retrieve.
+     * @returns The stored configuration value, or undefined if missing.
+     */
+    get(key: string): any;
+    /**
+     * Sets a configuration value by key.
+     * @param key - Configuration key to set.
+     * @param value - Configuration value to store.
+     * @returns No return value.
+     */
+    set(key: string, value: any): void;
+}
+//# sourceMappingURL=config-manager.d.ts.map

package/dist/utils/config-manager.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"config-manager.d.ts","sourceRoot":"","sources":["../../src/utils/config-manager.ts"],"names":[],"mappings":"AAAA;;GAEG;AACH,qBAAa,aAAa;IACxB,OAAO,CAAC,MAAM,CAAC,QAAQ,CAAgB;IACvC,OAAO,CAAC,MAAM,CAAmB;IAEjC;;OAEG;IACH,OAAO;IAIP;;;OAGG;WACW,WAAW,IAAI,aAAa;IAO1C;;;;OAIG;IACI,GAAG,CAAC,GAAG,EAAE,MAAM,GAAG,GAAG;IAI5B;;;;;OAKG;IACI,GAAG,CAAC,GAAG,EAAE,MAAM,EAAE,KAAK,EAAE,GAAG,GAAG,IAAI;CAG1C"}

package/dist/utils/config-manager.js

@@ -0,0 +1,41 @@
+/**
+ * Singleton configuration manager backed by an in-memory Map.
+ */
+export class ConfigManager {
+    static instance;
+    config;
+    /**
+     * Creates a new ConfigManager instance.
+     */
+    constructor() {
+        this.config = new Map();
+    }
+    /**
+     * Returns the singleton instance of the ConfigManager.
+     * @returns The singleton ConfigManager instance.
+     */
+    static getInstance() {
+        if (!ConfigManager.instance) {
+            ConfigManager.instance = new ConfigManager();
+        }
+        return ConfigManager.instance;
+    }
+    /**
+     * Gets a configuration value by key.
+     * @param key - Configuration key to retrieve.
+     * @returns The stored configuration value, or undefined if missing.
+     */
+    get(key) {
+        return this.config.get(key);
+    }
+    /**
+     * Sets a configuration value by key.
+     * @param key - Configuration key to set.
+     * @param value - Configuration value to store.
+     * @returns No return value.
+     */
+    set(key, value) {
+        this.config.set(key, value);
+    }
+}
+//# sourceMappingURL=config-manager.js.map

package/dist/utils/config-manager.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"config-manager.js","sourceRoot":"","sources":["../../src/utils/config-manager.ts"],"names":[],"mappings":"AAAA;;GAEG;AACH,MAAM,OAAO,aAAa;IAChB,MAAM,CAAC,QAAQ,CAAgB;IAC/B,MAAM,CAAmB;IAEjC;;OAEG;IACH;QACE,IAAI,CAAC,MAAM,GAAG,IAAI,GAAG,EAAe,CAAC;IACvC,CAAC;IAED;;;OAGG;IACI,MAAM,CAAC,WAAW;QACvB,IAAI,CAAC,aAAa,CAAC,QAAQ,EAAE,CAAC;YAC5B,aAAa,CAAC,QAAQ,GAAG,IAAI,aAAa,EAAE,CAAC;QAC/C,CAAC;QACD,OAAO,aAAa,CAAC,QAAQ,CAAC;IAChC,CAAC;IAED;;;;OAIG;IACI,GAAG,CAAC,GAAW;QACpB,OAAO,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;IAC9B,CAAC;IAED;;;;;OAKG;IACI,GAAG,CAAC,GAAW,EAAE,KAAU;QAChC,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,GAAG,EAAE,KAAK,CAAC,CAAC;IAC9B,CAAC;CACF"}

package/dist/utils/dijkstra.d.ts

@@ -0,0 +1,17 @@
+/**
+ * Result type for shortest path calculation
+ */
+export interface ShortestPathResult {
+    path: string[];
+    distance: number;
+}
+/**
+ * Finds the shortest path between two nodes in a weighted graph using Dijkstra's algorithm.
+ *
+ * @param graph - Weighted graph as adjacency list Map<node, Map<neighbor, weight>>
+ * @param start - Starting node
+ * @param end - Target node
+ * @returns ShortestPathResult with path and distance, or null if no path exists
+ */
+export declare function findShortestPath(graph: Map<string, Map<string, number>>, start: string, end: string): ShortestPathResult | null;
+//# sourceMappingURL=dijkstra.d.ts.map

package/dist/utils/dijkstra.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"dijkstra.d.ts","sourceRoot":"","sources":["../../src/utils/dijkstra.ts"],"names":[],"mappings":"AAAA;;GAEG;AACH,MAAM,WAAW,kBAAkB;IACjC,IAAI,EAAE,MAAM,EAAE,CAAC;IACf,QAAQ,EAAE,MAAM,CAAC;CAClB;AAED;;;;;;;GAOG;AACH,wBAAgB,gBAAgB,CAC9B,KAAK,EAAE,GAAG,CAAC,MAAM,EAAE,GAAG,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC,EACvC,KAAK,EAAE,MAAM,EACb,GAAG,EAAE,MAAM,GACV,kBAAkB,GAAG,IAAI,CAgG3B"}

package/dist/utils/dijkstra.js

@@ -0,0 +1,91 @@
+/**
+ * Finds the shortest path between two nodes in a weighted graph using Dijkstra's algorithm.
+ *
+ * @param graph - Weighted graph as adjacency list Map<node, Map<neighbor, weight>>
+ * @param start - Starting node
+ * @param end - Target node
+ * @returns ShortestPathResult with path and distance, or null if no path exists
+ */
+export function findShortestPath(graph, start, end) {
+    // Handle edge case: start equals end
+    if (start === end) {
+        // Check if node exists in graph
+        if (!graph.has(start)) {
+            return null;
+        }
+        return { path: [start], distance: 0 };
+    }
+    // Check if both nodes exist in the graph
+    if (!graph.has(start) || !graph.has(end)) {
+        return null;
+    }
+    // Distance from start to each node
+    const distances = new Map();
+    // Previous node in optimal path
+    const previous = new Map();
+    // Unvisited nodes
+    const unvisited = new Set();
+    // Initialize distances
+    for (const node of graph.keys()) {
+        distances.set(node, node === start ? 0 : Infinity);
+        previous.set(node, null);
+        unvisited.add(node);
+    }
+    while (unvisited.size > 0) {
+        // Find unvisited node with smallest distance
+        let current = null;
+        let smallestDistance = Infinity;
+        for (const node of unvisited) {
+            const dist = distances.get(node) ?? Infinity;
+            if (dist < smallestDistance) {
+                smallestDistance = dist;
+                current = node;
+            }
+        }
+        // No reachable nodes left
+        if (current === null || smallestDistance === Infinity) {
+            break;
+        }
+        // Found the end node
+        if (current === end) {
+            break;
+        }
+        // Remove current from unvisited
+        unvisited.delete(current);
+        // Update distances to neighbors
+        const neighbors = graph.get(current);
+        if (neighbors) {
+            for (const [neighbor, weight] of neighbors) {
+                if (unvisited.has(neighbor)) {
+                    const newDistance = smallestDistance + weight;
+                    const currentDistance = distances.get(neighbor) ?? Infinity;
+                    if (newDistance < currentDistance) {
+                        distances.set(neighbor, newDistance);
+                        previous.set(neighbor, current);
+                    }
+                }
+            }
+        }
+    }
+    // Check if end node was reached
+    const endDistance = distances.get(end);
+    if (endDistance === undefined || endDistance === Infinity) {
+        return null;
+    }
+    // Reconstruct path
+    const path = [];
+    let current = end;
+    while (current !== null) {
+        path.unshift(current);
+        current = previous.get(current) ?? null;
+    }
+    // Verify path starts with start node
+    if (path[0] !== start) {
+        return null;
+    }
+    return {
+        path,
+        distance: endDistance,
+    };
+}
+//# sourceMappingURL=dijkstra.js.map

package/dist/utils/dijkstra.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"dijkstra.js","sourceRoot":"","sources":["../../src/utils/dijkstra.ts"],"names":[],"mappings":"AAQA;;;;;;;GAOG;AACH,MAAM,UAAU,gBAAgB,CAC9B,KAAuC,EACvC,KAAa,EACb,GAAW;IAEX,qCAAqC;IACrC,IAAI,KAAK,KAAK,GAAG,EAAE,CAAC;QAClB,gCAAgC;QAChC,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,CAAC;YACtB,OAAO,IAAI,CAAC;QACd,CAAC;QACD,OAAO,EAAE,IAAI,EAAE,CAAC,KAAK,CAAC,EAAE,QAAQ,EAAE,CAAC,EAAE,CAAC;IACxC,CAAC;IAED,yCAAyC;IACzC,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC;QACzC,OAAO,IAAI,CAAC;IACd,CAAC;IAED,mCAAmC;IACnC,MAAM,SAAS,GAAG,IAAI,GAAG,EAAkB,CAAC;IAC5C,gCAAgC;IAChC,MAAM,QAAQ,GAAG,IAAI,GAAG,EAAyB,CAAC;IAClD,kBAAkB;IAClB,MAAM,SAAS,GAAG,IAAI,GAAG,EAAU,CAAC;IAEpC,uBAAuB;IACvB,KAAK,MAAM,IAAI,IAAI,KAAK,CAAC,IAAI,EAAE,EAAE,CAAC;QAChC,SAAS,CAAC,GAAG,CAAC,IAAI,EAAE,IAAI,KAAK,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC;QACnD,QAAQ,CAAC,GAAG,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC;QACzB,SAAS,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;IACtB,CAAC;IAED,OAAO,SAAS,CAAC,IAAI,GAAG,CAAC,EAAE,CAAC;QAC1B,6CAA6C;QAC7C,IAAI,OAAO,GAAkB,IAAI,CAAC;QAClC,IAAI,gBAAgB,GAAG,QAAQ,CAAC;QAEhC,KAAK,MAAM,IAAI,IAAI,SAAS,EAAE,CAAC;YAC7B,MAAM,IAAI,GAAG,SAAS,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,QAAQ,CAAC;YAC7C,IAAI,IAAI,GAAG,gBAAgB,EAAE,CAAC;gBAC5B,gBAAgB,GAAG,IAAI,CAAC;gBACxB,OAAO,GAAG,IAAI,CAAC;YACjB,CAAC;QACH,CAAC;QAED,0BAA0B;QAC1B,IAAI,OAAO,KAAK,IAAI,IAAI,gBAAgB,KAAK,QAAQ,EAAE,CAAC;YACtD,MAAM;QACR,CAAC;QAED,qBAAqB;QACrB,IAAI,OAAO,KAAK,GAAG,EAAE,CAAC;YACpB,MAAM;QACR,CAAC;QAED,gCAAgC;QAChC,SAAS,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC;QAE1B,gCAAgC;QAChC,MAAM,SAAS,GAAG,KAAK,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC;QACrC,IAAI,SAAS,EAAE,CAAC;YACd,KAAK,MAAM,CAAC,QAAQ,EAAE,MAAM,CAAC,IAAI,SAAS,EAAE,CAAC;gBAC3C,IAAI,SAAS,CAAC,GAAG,CAAC,QAAQ,CAAC,EAAE,CAAC;oBAC5B,MAAM,WAAW,GAAG,gBAAgB,GAAG,MAAM,CAAC;oBAC9C,MAAM,eAAe,GAAG,SAAS,CAAC,GAAG,CAAC,QAAQ,CAAC,IAAI,QAAQ,CAAC;oBAE5D,IAAI,WAAW,GAAG,eAAe,EAAE,CAAC;wBAClC,SAAS,CAAC,GAAG,CAAC,QAAQ,EAAE,WAAW,CAAC,CAAC;wBACrC,QAAQ,CAAC,GAAG,CAAC,QAAQ,EAAE,OAAO,CAAC,CAAC;oBAClC,CAAC;gBACH,CAAC;YACH,CAAC;QACH,CAAC;IACH,CAAC;IAED,gCAAgC;IAChC,MAAM,WAAW,GAAG,SAAS,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;IACvC,IAAI,WAAW,KAAK,SAAS,IAAI,WAAW,KAAK,QAAQ,EAAE,CAAC;QAC1D,OAAO,IAAI,CAAC;IACd,CAAC;IAED,mBAAmB;IACnB,MAAM,IAAI,GAAa,EAAE,CAAC;IAC1B,IAAI,OAAO,GAAkB,GAAG,CAAC;IAEjC,OAAO,OAAO,KAAK,IAAI,EAAE,CAAC;QACxB,IAAI,CAAC,OAAO,CAAC,OAAO,CAAC,CAAC;QACtB,OAAO,GAAG,QAAQ,CAAC,GAAG,CAAC,OAAO,CAAC,IAAI,IAAI,CAAC;IAC1C,CAAC;IAED,qCAAqC;IACrC,IAAI,IAAI,CAAC,CAAC,CAAC,KAAK,KAAK,EAAE,CAAC;QACtB,OAAO,IAAI,CAAC;IACd,CAAC;IAED,OAAO;QACL,IAAI;QACJ,QAAQ,EAAE,WAAW;KACtB,CAAC;AACJ,CAAC"}

package/dist/utils/fetch-with-retry.d.ts

@@ -0,0 +1,5 @@
+export declare function fetchWithRetry(url: string, retryConfig?: {
+    maxRetries: number;
+    backoffMs: number;
+}): Promise<Response>;
+//# sourceMappingURL=fetch-with-retry.d.ts.map

package/dist/utils/fetch-with-retry.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"fetch-with-retry.d.ts","sourceRoot":"","sources":["../../src/utils/fetch-with-retry.ts"],"names":[],"mappings":"AAAA,wBAAsB,cAAc,CAClC,GAAG,EAAE,MAAM,EACX,WAAW,CAAC,EAAE;IAAE,UAAU,EAAE,MAAM,CAAC;IAAC,SAAS,EAAE,MAAM,CAAA;CAAE,GACtD,OAAO,CAAC,QAAQ,CAAC,CA0FnB"}

package/dist/utils/fetch-with-retry.js

@@ -0,0 +1,61 @@
+export async function fetchWithRetry(url, retryConfig) {
+    const config = {
+        maxRetries: retryConfig?.maxRetries ?? 3,
+        backoffMs: retryConfig?.backoffMs ?? 1000,
+    };
+    let lastError = null;
+    let lastStatusCode;
+    for (let attempt = 0; attempt <= config.maxRetries; attempt++) {
+        try {
+            if (attempt > 0) {
+                const delay = config.backoffMs * Math.pow(2, attempt - 1);
+                await new Promise((resolve) => setTimeout(resolve, delay));
+            }
+            const response = await fetch(url);
+            if (!response.ok) {
+                lastStatusCode = response.status;
+                const isRetryable = response.status >= 500 ||
+                    response.status === 408 ||
+                    response.status === 429;
+                if (isRetryable && attempt < config.maxRetries) {
+                    lastError = new Error(`HTTP ${response.status}: ${response.statusText}`);
+                    continue;
+                }
+                const httpError = new Error(`HTTP error ${response.status}: ${response.statusText}`);
+                httpError.name = 'FetchRetryError';
+                httpError.url = url;
+                httpError.attempts = attempt + 1;
+                httpError.statusCode = response.status;
+                httpError.lastError = null;
+                throw httpError;
+            }
+            return response;
+        }
+        catch (error) {
+            if (error instanceof Error && error.name === 'FetchRetryError') {
+                throw error;
+            }
+            if (error instanceof Error) {
+                lastError = error;
+                if (attempt < config.maxRetries) {
+                    continue;
+                }
+            }
+            const finalError = new Error(`Fetch failed after ${attempt + 1} attempts: ${error instanceof Error ? error.message : String(error)}`);
+            finalError.name = 'FetchRetryError';
+            finalError.url = url;
+            finalError.attempts = attempt + 1;
+            finalError.statusCode = lastStatusCode;
+            finalError.lastError = lastError;
+            throw finalError;
+        }
+    }
+    const exhaustedError = new Error(`All ${config.maxRetries + 1} attempts failed for ${url}`);
+    exhaustedError.name = 'FetchRetryError';
+    exhaustedError.url = url;
+    exhaustedError.attempts = config.maxRetries + 1;
+    exhaustedError.statusCode = lastStatusCode;
+    exhaustedError.lastError = lastError;
+    throw exhaustedError;
+}
+//# sourceMappingURL=fetch-with-retry.js.map

package/dist/utils/fetch-with-retry.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"fetch-with-retry.js","sourceRoot":"","sources":["../../src/utils/fetch-with-retry.ts"],"names":[],"mappings":"AAAA,MAAM,CAAC,KAAK,UAAU,cAAc,CAClC,GAAW,EACX,WAAuD;IAEvD,MAAM,MAAM,GAAG;QACb,UAAU,EAAE,WAAW,EAAE,UAAU,IAAI,CAAC;QACxC,SAAS,EAAE,WAAW,EAAE,SAAS,IAAI,IAAI;KAC1C,CAAC;IACF,IAAI,SAAS,GAAiB,IAAI,CAAC;IACnC,IAAI,cAAkC,CAAC;IAEvC,KAAK,IAAI,OAAO,GAAG,CAAC,EAAE,OAAO,IAAI,MAAM,CAAC,UAAU,EAAE,OAAO,EAAE,EAAE,CAAC;QAC9D,IAAI,CAAC;YACH,IAAI,OAAO,GAAG,CAAC,EAAE,CAAC;gBAChB,MAAM,KAAK,GAAG,MAAM,CAAC,SAAS,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,OAAO,GAAG,CAAC,CAAC,CAAC;gBAC1D,MAAM,IAAI,OAAO,CAAC,CAAC,OAAO,EAAE,EAAE,CAAC,UAAU,CAAC,OAAO,EAAE,KAAK,CAAC,CAAC,CAAC;YAC7D,CAAC;YAED,MAAM,QAAQ,GAAG,MAAM,KAAK,CAAC,GAAG,CAAC,CAAC;YAElC,IAAI,CAAC,QAAQ,CAAC,EAAE,EAAE,CAAC;gBACjB,cAAc,GAAG,QAAQ,CAAC,MAAM,CAAC;gBACjC,MAAM,WAAW,GACf,QAAQ,CAAC,MAAM,IAAI,GAAG;oBACtB,QAAQ,CAAC,MAAM,KAAK,GAAG;oBACvB,QAAQ,CAAC,MAAM,KAAK,GAAG,CAAC;gBAE1B,IAAI,WAAW,IAAI,OAAO,GAAG,MAAM,CAAC,UAAU,EAAE,CAAC;oBAC/C,SAAS,GAAG,IAAI,KAAK,CAAC,QAAQ,QAAQ,CAAC,MAAM,KAAK,QAAQ,CAAC,UAAU,EAAE,CAAC,CAAC;oBACzE,SAAS;gBACX,CAAC;gBAED,MAAM,SAAS,GAAG,IAAI,KAAK,CACzB,cAAc,QAAQ,CAAC,MAAM,KAAK,QAAQ,CAAC,UAAU,EAAE,CAMxD,CAAC;gBACF,SAAS,CAAC,IAAI,GAAG,iBAAiB,CAAC;gBACnC,SAAS,CAAC,GAAG,GAAG,GAAG,CAAC;gBACpB,SAAS,CAAC,QAAQ,GAAG,OAAO,GAAG,CAAC,CAAC;gBACjC,SAAS,CAAC,UAAU,GAAG,QAAQ,CAAC,MAAM,CAAC;gBACvC,SAAS,CAAC,SAAS,GAAG,IAAI,CAAC;gBAC3B,MAAM,SAAS,CAAC;YAClB,CAAC;YAED,OAAO,QAAQ,CAAC;QAClB,CAAC;QAAC,OAAO,KAAK,EAAE,CAAC;YACf,IAAI,KAAK,YAAY,KAAK,IAAI,KAAK,CAAC,IAAI,KAAK,iBAAiB,EAAE,CAAC;gBAC/D,MAAM,KAAK,CAAC;YACd,CAAC;YAED,IAAI,KAAK,YAAY,KAAK,EAAE,CAAC;gBAC3B,SAAS,GAAG,KAAK,CAAC;gBAElB,IAAI,OAAO,GAAG,MAAM,CAAC,UAAU,EAAE,CAAC;oBAChC,SAAS;gBACX,CAAC;YACH,CAAC;YAED,MAAM,UAAU,GAAG,IAAI,KAAK,CAC1B,sBAAsB,OAAO,GAAG,CAAC,cAAc,KAAK,YAAY,KAAK,CAAC,CAAC,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,MAAM,CAAC,KAAK,CAAC,EAAE,CAMxG,CAAC;YACF,UAAU,CAAC,IAAI,GAAG,iBAAiB,CAAC;YACpC,UAAU,CAAC,GAAG,GAAG,GAAG,CAAC;YACrB,UAAU,CAAC,QAAQ,GAAG,OAAO,GAAG,CAAC,CAAC;YAClC,UAAU,CAAC,UAAU,GAAG,cAAc,CAAC;YACvC,UAAU,CAAC,SAAS,GAAG,SAAS,CAAC;YACjC,MAAM,UAAU,CAAC;QACnB,CAAC;IACH,CAAC;IAED,MAAM,cAAc,GAAG,IAAI,KAAK,CAC9B,OAAO,MAAM,CAAC,UAAU,GAAG,CAAC,wBAAwB,GAAG,EAAE,CAM1D,CAAC;IACF,cAAc,CAAC,IAAI,GAAG,iBAAiB,CAAC;IACxC,cAAc,CAAC,GAAG,GAAG,GAAG,CAAC;IACzB,cAAc,CAAC,QAAQ,GAAG,MAAM,CAAC,UAAU,GAAG,CAAC,CAAC;IAChD,cAAc,CAAC,UAAU,GAAG,cAAc,CAAC;IAC3C,cAAc,CAAC,SAAS,GAAG,SAAS,CAAC;IACrC,MAAM,cAAc,CAAC;AACvB,CAAC"}

package/dist/utils/merge-claude-md.d.ts

@@ -0,0 +1,28 @@
+/**
+ * Intelligent merge of existing CLAUDE.md with newly generated content
+ *
+ * Strategy:
+ * - Preserves user customizations in standard sections
+ * - Extracts valuable content from existing file
+ * - Places extracted content in appropriate new sections
+ * - Never loses information
+ */
+/**
+ * Merge existing CLAUDE.md content with newly generated content
+ *
+ * Intelligent merge strategy:
+ * 1. Use new template structure and preamble
+ * 2. Replace standard sections with new versions
+ * 3. Extract valuable content from existing file
+ * 4. Inject extracted content into appropriate new sections
+ * 5. Append completely custom sections at the end
+ */
+export declare function mergeClaudeMd(existingContent: string, newContent: string): string;
+/**
+ * Validate merge result - ensure no significant content was lost
+ */
+export declare function validateMerge(original: string, merged: string): {
+    valid: boolean;
+    warnings: string[];
+};
+//# sourceMappingURL=merge-claude-md.d.ts.map

package/dist/utils/merge-claude-md.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"merge-claude-md.d.ts","sourceRoot":"","sources":["../../src/utils/merge-claude-md.ts"],"names":[],"mappings":"AAAA;;;;;;;;GAQG;AAkTH;;;;;;;;;GASG;AACH,wBAAgB,aAAa,CAAC,eAAe,EAAE,MAAM,EAAE,UAAU,EAAE,MAAM,GAAG,MAAM,CAkDjF;AAED;;GAEG;AACH,wBAAgB,aAAa,CAAC,QAAQ,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,GAAG;IAAE,KAAK,EAAE,OAAO,CAAC;IAAC,QAAQ,EAAE,MAAM,EAAE,CAAA;CAAE,CAoCtG"}