@skillsmith/core 0.2.0 → 2.0.0

package/dist/src/analysis/tree-cache.d.ts

@@ -0,0 +1,208 @@
+/**
+ * SMI-1309: Tree Cache for Incremental Parsing
+ *
+ * LRU cache for parsed AST trees to enable fast incremental updates.
+ * Manages tree lifecycle independently from parse result caching.
+ *
+ * Tree-sitter trees hold native resources and must be explicitly
+ * deleted to free memory. This cache handles that lifecycle.
+ *
+ * @see docs/architecture/multi-language-analysis.md
+ * @module analysis/tree-cache
+ */
+/**
+ * Cached tree entry with metadata
+ */
+export interface CachedTree {
+    /** Tree-sitter Tree object (typed as unknown for flexibility) */
+    tree: unknown;
+    /** Version number for LRU tracking */
+    version: number;
+    /** SHA-256 hash prefix of content (for validation) */
+    contentHash: string;
+    /** Timestamp when entry was created */
+    createdAt: number;
+}
+/**
+ * Cache statistics for monitoring
+ */
+export interface TreeCacheStats {
+    /** Current number of cached trees */
+    size: number;
+    /** Maximum trees allowed */
+    maxSize: number;
+    /** Hit rate (0-1) since last reset */
+    hitRate: number;
+    /** Oldest tree version in cache */
+    oldestVersion: number;
+    /** Newest tree version in cache */
+    newestVersion: number;
+}
+/**
+ * Options for TreeCache
+ */
+export interface TreeCacheOptions {
+    /** Maximum number of trees to cache (default: 100) */
+    maxTrees?: number;
+}
+/**
+ * LRU cache for parsed AST trees
+ *
+ * Manages tree-sitter tree instances with proper lifecycle handling.
+ * Trees require explicit deletion to free native memory.
+ *
+ * Separate from ParseCache because:
+ * 1. Trees have native resources requiring explicit cleanup
+ * 2. Tree reuse enables incremental parsing
+ * 3. Different eviction strategies may be optimal
+ *
+ * @example
+ * ```typescript
+ * const cache = new TreeCache({ maxTrees: 50 })
+ *
+ * // Store tree after initial parse
+ * const tree = parser.parse(content)
+ * cache.set('src/main.ts', tree, hashContent(content))
+ *
+ * // Later, check if tree is valid for incremental parse
+ * if (cache.isValid('src/main.ts', hashContent(newContent))) {
+ *   // Use cached tree as base
+ *   const oldTree = cache.get('src/main.ts')
+ *   oldTree.edit(editInfo)
+ *   const newTree = parser.parse(newContent, oldTree)
+ * }
+ *
+ * // Cleanup
+ * cache.dispose()
+ * ```
+ */
+export declare class TreeCache {
+    private trees;
+    private readonly maxTrees;
+    private version;
+    private hits;
+    private misses;
+    constructor(options?: TreeCacheOptions);
+    /**
+     * Get cached tree for a file
+     *
+     * Returns null if no tree is cached for the path.
+     * Updates hit/miss statistics.
+     *
+     * @param filePath - Path to look up
+     * @returns Cached tree or null
+     */
+    get(filePath: string): unknown | null;
+    /**
+     * Get full cache entry with metadata
+     *
+     * @param filePath - Path to look up
+     * @returns Full cache entry or undefined
+     */
+    getEntry(filePath: string): CachedTree | undefined;
+    /**
+     * Check if cached tree is valid for content
+     *
+     * Compares content hash to detect if the cached tree
+     * can be used as a base for incremental parsing.
+     *
+     * @param filePath - Path to check
+     * @param contentHash - Hash of current content
+     * @returns True if tree matches content
+     */
+    isValid(filePath: string, contentHash: string): boolean;
+    /**
+     * Get version number for a cached tree
+     *
+     * @param filePath - Path to look up
+     * @returns Version number or null if not cached
+     */
+    getVersion(filePath: string): number | null;
+    /**
+     * Store a tree in cache
+     *
+     * Evicts oldest entry if at capacity.
+     * Properly deletes existing tree before replacement.
+     *
+     * @param filePath - File path as cache key
+     * @param tree - Tree-sitter tree to cache
+     * @param contentHash - Hash of content tree was parsed from
+     */
+    set(filePath: string, tree: unknown, contentHash: string): void;
+    /**
+     * Invalidate cached tree for a file
+     *
+     * Deletes tree to free native memory.
+     *
+     * @param filePath - Path to invalidate
+     */
+    invalidate(filePath: string): void;
+    /**
+     * Invalidate multiple files
+     *
+     * @param filePaths - Paths to invalidate
+     */
+    invalidateMany(filePaths: string[]): void;
+    /**
+     * Invalidate files matching a pattern
+     *
+     * @param pattern - Regex pattern to match file paths
+     * @returns Number of entries invalidated
+     */
+    invalidatePattern(pattern: RegExp): number;
+    /**
+     * Check if a file has a cached tree
+     *
+     * @param filePath - Path to check
+     * @returns True if tree is cached
+     */
+    has(filePath: string): boolean;
+    /**
+     * Get current cache size
+     */
+    get size(): number;
+    /**
+     * Get cache statistics
+     *
+     * @returns Current cache statistics
+     */
+    getStats(): TreeCacheStats;
+    /**
+     * Reset hit/miss counters
+     */
+    resetStats(): void;
+    /**
+     * Clear all cached trees
+     *
+     * Properly deletes all trees to free native resources.
+     */
+    clear(): void;
+    /**
+     * Dispose of cache and free all resources
+     *
+     * Call this when the cache is no longer needed.
+     */
+    dispose(): void;
+    /**
+     * Get list of all cached file paths
+     */
+    keys(): string[];
+    /**
+     * Hash content for cache validation
+     *
+     * @param content - Content to hash
+     * @returns SHA-256 hash prefix (16 chars)
+     */
+    static hashContent(content: string): string;
+    /**
+     * Evict the oldest entry from cache
+     */
+    private evictOldest;
+    /**
+     * Safely delete a tree object
+     *
+     * Handles trees that may or may not have a delete method.
+     */
+    private deleteTree;
+}
+//# sourceMappingURL=tree-cache.d.ts.map

package/dist/src/analysis/tree-cache.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"tree-cache.d.ts","sourceRoot":"","sources":["../../../src/analysis/tree-cache.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;GAWG;AAIH;;GAEG;AACH,MAAM,WAAW,UAAU;IACzB,iEAAiE;IACjE,IAAI,EAAE,OAAO,CAAA;IACb,sCAAsC;IACtC,OAAO,EAAE,MAAM,CAAA;IACf,sDAAsD;IACtD,WAAW,EAAE,MAAM,CAAA;IACnB,uCAAuC;IACvC,SAAS,EAAE,MAAM,CAAA;CAClB;AAED;;GAEG;AACH,MAAM,WAAW,cAAc;IAC7B,qCAAqC;IACrC,IAAI,EAAE,MAAM,CAAA;IACZ,4BAA4B;IAC5B,OAAO,EAAE,MAAM,CAAA;IACf,sCAAsC;IACtC,OAAO,EAAE,MAAM,CAAA;IACf,mCAAmC;IACnC,aAAa,EAAE,MAAM,CAAA;IACrB,mCAAmC;IACnC,aAAa,EAAE,MAAM,CAAA;CACtB;AAED;;GAEG;AACH,MAAM,WAAW,gBAAgB;IAC/B,sDAAsD;IACtD,QAAQ,CAAC,EAAE,MAAM,CAAA;CAClB;AAED;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GA8BG;AACH,qBAAa,SAAS;IACpB,OAAO,CAAC,KAAK,CAAqC;IAClD,OAAO,CAAC,QAAQ,CAAC,QAAQ,CAAQ;IACjC,OAAO,CAAC,OAAO,CAAI;IACnB,OAAO,CAAC,IAAI,CAAI;IAChB,OAAO,CAAC,MAAM,CAAI;gBAEN,OAAO,GAAE,gBAAqB;IAI1C;;;;;;;;OAQG;IACH,GAAG,CAAC,QAAQ,EAAE,MAAM,GAAG,OAAO,GAAG,IAAI;IAUrC;;;;;OAKG;IACH,QAAQ,CAAC,QAAQ,EAAE,MAAM,GAAG,UAAU,GAAG,SAAS;IAIlD;;;;;;;;;OASG;IACH,OAAO,CAAC,QAAQ,EAAE,MAAM,EAAE,WAAW,EAAE,MAAM,GAAG,OAAO;IAKvD;;;;;OAKG;IACH,UAAU,CAAC,QAAQ,EAAE,MAAM,GAAG,MAAM,GAAG,IAAI;IAI3C;;;;;;;;;OASG;IACH,GAAG,CAAC,QAAQ,EAAE,MAAM,EAAE,IAAI,EAAE,OAAO,EAAE,WAAW,EAAE,MAAM,GAAG,IAAI;IAqB/D;;;;;;OAMG;IACH,UAAU,CAAC,QAAQ,EAAE,MAAM,GAAG,IAAI;IAQlC;;;;OAIG;IACH,cAAc,CAAC,SAAS,EAAE,MAAM,EAAE,GAAG,IAAI;IAMzC;;;;;OAKG;IACH,iBAAiB,CAAC,OAAO,EAAE,MAAM,GAAG,MAAM;IAW1C;;;;;OAKG;IACH,GAAG,CAAC,QAAQ,EAAE,MAAM,GAAG,OAAO;IAI9B;;OAEG;IACH,IAAI,IAAI,IAAI,MAAM,CAEjB;IAED;;;;OAIG;IACH,QAAQ,IAAI,cAAc;IAmB1B;;OAEG;IACH,UAAU,IAAI,IAAI;IAKlB;;;;OAIG;IACH,KAAK,IAAI,IAAI;IASb;;;;OAIG;IACH,OAAO,IAAI,IAAI;IAIf;;OAEG;IACH,IAAI,IAAI,MAAM,EAAE;IAIhB;;;;;OAKG;IACH,MAAM,CAAC,WAAW,CAAC,OAAO,EAAE,MAAM,GAAG,MAAM;IAI3C;;OAEG;IACH,OAAO,CAAC,WAAW;IAgBnB;;;;OAIG;IACH,OAAO,CAAC,UAAU;CAYnB"}

package/dist/src/analysis/tree-cache.js

@@ -0,0 +1,288 @@
+/**
+ * SMI-1309: Tree Cache for Incremental Parsing
+ *
+ * LRU cache for parsed AST trees to enable fast incremental updates.
+ * Manages tree lifecycle independently from parse result caching.
+ *
+ * Tree-sitter trees hold native resources and must be explicitly
+ * deleted to free memory. This cache handles that lifecycle.
+ *
+ * @see docs/architecture/multi-language-analysis.md
+ * @module analysis/tree-cache
+ */
+import { createHash } from 'crypto';
+/**
+ * LRU cache for parsed AST trees
+ *
+ * Manages tree-sitter tree instances with proper lifecycle handling.
+ * Trees require explicit deletion to free native memory.
+ *
+ * Separate from ParseCache because:
+ * 1. Trees have native resources requiring explicit cleanup
+ * 2. Tree reuse enables incremental parsing
+ * 3. Different eviction strategies may be optimal
+ *
+ * @example
+ * ```typescript
+ * const cache = new TreeCache({ maxTrees: 50 })
+ *
+ * // Store tree after initial parse
+ * const tree = parser.parse(content)
+ * cache.set('src/main.ts', tree, hashContent(content))
+ *
+ * // Later, check if tree is valid for incremental parse
+ * if (cache.isValid('src/main.ts', hashContent(newContent))) {
+ *   // Use cached tree as base
+ *   const oldTree = cache.get('src/main.ts')
+ *   oldTree.edit(editInfo)
+ *   const newTree = parser.parse(newContent, oldTree)
+ * }
+ *
+ * // Cleanup
+ * cache.dispose()
+ * ```
+ */
+export class TreeCache {
+    trees = new Map();
+    maxTrees;
+    version = 0;
+    hits = 0;
+    misses = 0;
+    constructor(options = {}) {
+        this.maxTrees = options.maxTrees ?? 100;
+    }
+    /**
+     * Get cached tree for a file
+     *
+     * Returns null if no tree is cached for the path.
+     * Updates hit/miss statistics.
+     *
+     * @param filePath - Path to look up
+     * @returns Cached tree or null
+     */
+    get(filePath) {
+        const entry = this.trees.get(filePath);
+        if (entry) {
+            this.hits++;
+            return entry.tree;
+        }
+        this.misses++;
+        return null;
+    }
+    /**
+     * Get full cache entry with metadata
+     *
+     * @param filePath - Path to look up
+     * @returns Full cache entry or undefined
+     */
+    getEntry(filePath) {
+        return this.trees.get(filePath);
+    }
+    /**
+     * Check if cached tree is valid for content
+     *
+     * Compares content hash to detect if the cached tree
+     * can be used as a base for incremental parsing.
+     *
+     * @param filePath - Path to check
+     * @param contentHash - Hash of current content
+     * @returns True if tree matches content
+     */
+    isValid(filePath, contentHash) {
+        const entry = this.trees.get(filePath);
+        return entry?.contentHash === contentHash;
+    }
+    /**
+     * Get version number for a cached tree
+     *
+     * @param filePath - Path to look up
+     * @returns Version number or null if not cached
+     */
+    getVersion(filePath) {
+        return this.trees.get(filePath)?.version ?? null;
+    }
+    /**
+     * Store a tree in cache
+     *
+     * Evicts oldest entry if at capacity.
+     * Properly deletes existing tree before replacement.
+     *
+     * @param filePath - File path as cache key
+     * @param tree - Tree-sitter tree to cache
+     * @param contentHash - Hash of content tree was parsed from
+     */
+    set(filePath, tree, contentHash) {
+        // Evict oldest if at capacity and this is a new entry
+        if (this.trees.size >= this.maxTrees && !this.trees.has(filePath)) {
+            this.evictOldest();
+        }
+        // Delete existing tree to free native memory
+        const existing = this.trees.get(filePath);
+        if (existing) {
+            this.deleteTree(existing.tree);
+        }
+        this.version++;
+        this.trees.set(filePath, {
+            tree,
+            version: this.version,
+            contentHash,
+            createdAt: Date.now(),
+        });
+    }
+    /**
+     * Invalidate cached tree for a file
+     *
+     * Deletes tree to free native memory.
+     *
+     * @param filePath - Path to invalidate
+     */
+    invalidate(filePath) {
+        const entry = this.trees.get(filePath);
+        if (entry) {
+            this.deleteTree(entry.tree);
+            this.trees.delete(filePath);
+        }
+    }
+    /**
+     * Invalidate multiple files
+     *
+     * @param filePaths - Paths to invalidate
+     */
+    invalidateMany(filePaths) {
+        for (const filePath of filePaths) {
+            this.invalidate(filePath);
+        }
+    }
+    /**
+     * Invalidate files matching a pattern
+     *
+     * @param pattern - Regex pattern to match file paths
+     * @returns Number of entries invalidated
+     */
+    invalidatePattern(pattern) {
+        let count = 0;
+        for (const filePath of this.trees.keys()) {
+            if (pattern.test(filePath)) {
+                this.invalidate(filePath);
+                count++;
+            }
+        }
+        return count;
+    }
+    /**
+     * Check if a file has a cached tree
+     *
+     * @param filePath - Path to check
+     * @returns True if tree is cached
+     */
+    has(filePath) {
+        return this.trees.has(filePath);
+    }
+    /**
+     * Get current cache size
+     */
+    get size() {
+        return this.trees.size;
+    }
+    /**
+     * Get cache statistics
+     *
+     * @returns Current cache statistics
+     */
+    getStats() {
+        let oldestVersion = Infinity;
+        let newestVersion = 0;
+        for (const entry of this.trees.values()) {
+            if (entry.version < oldestVersion)
+                oldestVersion = entry.version;
+            if (entry.version > newestVersion)
+                newestVersion = entry.version;
+        }
+        const total = this.hits + this.misses;
+        return {
+            size: this.trees.size,
+            maxSize: this.maxTrees,
+            hitRate: total > 0 ? this.hits / total : 0,
+            oldestVersion: oldestVersion === Infinity ? 0 : oldestVersion,
+            newestVersion,
+        };
+    }
+    /**
+     * Reset hit/miss counters
+     */
+    resetStats() {
+        this.hits = 0;
+        this.misses = 0;
+    }
+    /**
+     * Clear all cached trees
+     *
+     * Properly deletes all trees to free native resources.
+     */
+    clear() {
+        for (const entry of this.trees.values()) {
+            this.deleteTree(entry.tree);
+        }
+        this.trees.clear();
+        this.hits = 0;
+        this.misses = 0;
+    }
+    /**
+     * Dispose of cache and free all resources
+     *
+     * Call this when the cache is no longer needed.
+     */
+    dispose() {
+        this.clear();
+    }
+    /**
+     * Get list of all cached file paths
+     */
+    keys() {
+        return Array.from(this.trees.keys());
+    }
+    /**
+     * Hash content for cache validation
+     *
+     * @param content - Content to hash
+     * @returns SHA-256 hash prefix (16 chars)
+     */
+    static hashContent(content) {
+        return createHash('sha256').update(content).digest('hex').slice(0, 16);
+    }
+    /**
+     * Evict the oldest entry from cache
+     */
+    evictOldest() {
+        let oldestPath = null;
+        let oldestVersion = Infinity;
+        for (const [path, entry] of this.trees) {
+            if (entry.version < oldestVersion) {
+                oldestVersion = entry.version;
+                oldestPath = path;
+            }
+        }
+        if (oldestPath) {
+            this.invalidate(oldestPath);
+        }
+    }
+    /**
+     * Safely delete a tree object
+     *
+     * Handles trees that may or may not have a delete method.
+     */
+    deleteTree(tree) {
+        if (tree && typeof tree === 'object') {
+            const maybeTree = tree;
+            if (typeof maybeTree.delete === 'function') {
+                try {
+                    maybeTree.delete();
+                }
+                catch {
+                    // Ignore errors during cleanup
+                }
+            }
+        }
+    }
+}
+//# sourceMappingURL=tree-cache.js.map

package/dist/src/analysis/tree-cache.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"tree-cache.js","sourceRoot":"","sources":["../../../src/analysis/tree-cache.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;GAWG;AAEH,OAAO,EAAE,UAAU,EAAE,MAAM,QAAQ,CAAA;AAwCnC;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GA8BG;AACH,MAAM,OAAO,SAAS;IACZ,KAAK,GAA4B,IAAI,GAAG,EAAE,CAAA;IACjC,QAAQ,CAAQ;IACzB,OAAO,GAAG,CAAC,CAAA;IACX,IAAI,GAAG,CAAC,CAAA;IACR,MAAM,GAAG,CAAC,CAAA;IAElB,YAAY,UAA4B,EAAE;QACxC,IAAI,CAAC,QAAQ,GAAG,OAAO,CAAC,QAAQ,IAAI,GAAG,CAAA;IACzC,CAAC;IAED;;;;;;;;OAQG;IACH,GAAG,CAAC,QAAgB;QAClB,MAAM,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAA;QACtC,IAAI,KAAK,EAAE,CAAC;YACV,IAAI,CAAC,IAAI,EAAE,CAAA;YACX,OAAO,KAAK,CAAC,IAAI,CAAA;QACnB,CAAC;QACD,IAAI,CAAC,MAAM,EAAE,CAAA;QACb,OAAO,IAAI,CAAA;IACb,CAAC;IAED;;;;;OAKG;IACH,QAAQ,CAAC,QAAgB;QACvB,OAAO,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAA;IACjC,CAAC;IAED;;;;;;;;;OASG;IACH,OAAO,CAAC,QAAgB,EAAE,WAAmB;QAC3C,MAAM,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAA;QACtC,OAAO,KAAK,EAAE,WAAW,KAAK,WAAW,CAAA;IAC3C,CAAC;IAED;;;;;OAKG;IACH,UAAU,CAAC,QAAgB;QACzB,OAAO,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,QAAQ,CAAC,EAAE,OAAO,IAAI,IAAI,CAAA;IAClD,CAAC;IAED;;;;;;;;;OASG;IACH,GAAG,CAAC,QAAgB,EAAE,IAAa,EAAE,WAAmB;QACtD,sDAAsD;QACtD,IAAI,IAAI,CAAC,KAAK,CAAC,IAAI,IAAI,IAAI,CAAC,QAAQ,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,QAAQ,CAAC,EAAE,CAAC;YAClE,IAAI,CAAC,WAAW,EAAE,CAAA;QACpB,CAAC;QAED,6CAA6C;QAC7C,MAAM,QAAQ,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAA;QACzC,IAAI,QAAQ,EAAE,CAAC;YACb,IAAI,CAAC,UAAU,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAA;QAChC,CAAC;QAED,IAAI,CAAC,OAAO,EAAE,CAAA;QACd,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,QAAQ,EAAE;YACvB,IAAI;YACJ,OAAO,EAAE,IAAI,CAAC,OAAO;YACrB,WAAW;YACX,SAAS,EAAE,IAAI,CAAC,GAAG,EAAE;SACtB,CAAC,CAAA;IACJ,CAAC;IAED;;;;;;OAMG;IACH,UAAU,CAAC,QAAgB;QACzB,MAAM,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAA;QACtC,IAAI,KAAK,EAAE,CAAC;YACV,IAAI,CAAC,UAAU,CAAC,KAAK,CAAC,IAAI,CAAC,CAAA;YAC3B,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAA;QAC7B,CAAC;IACH,CAAC;IAED;;;;OAIG;IACH,cAAc,CAAC,SAAmB;QAChC,KAAK,MAAM,QAAQ,IAAI,SAAS,EAAE,CAAC;YACjC,IAAI,CAAC,UAAU,CAAC,QAAQ,CAAC,CAAA;QAC3B,CAAC;IACH,CAAC;IAED;;;;;OAKG;IACH,iBAAiB,CAAC,OAAe;QAC/B,IAAI,KAAK,GAAG,CAAC,CAAA;QACb,KAAK,MAAM,QAAQ,IAAI,IAAI,CAAC,KAAK,CAAC,IAAI,EAAE,EAAE,CAAC;YACzC,IAAI,OAAO,CAAC,IAAI,CAAC,QAAQ,CAAC,EAAE,CAAC;gBAC3B,IAAI,CAAC,UAAU,CAAC,QAAQ,CAAC,CAAA;gBACzB,KAAK,EAAE,CAAA;YACT,CAAC;QACH,CAAC;QACD,OAAO,KAAK,CAAA;IACd,CAAC;IAED;;;;;OAKG;IACH,GAAG,CAAC,QAAgB;QAClB,OAAO,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAA;IACjC,CAAC;IAED;;OAEG;IACH,IAAI,IAAI;QACN,OAAO,IAAI,CAAC,KAAK,CAAC,IAAI,CAAA;IACxB,CAAC;IAED;;;;OAIG;IACH,QAAQ;QACN,IAAI,aAAa,GAAG,QAAQ,CAAA;QAC5B,IAAI,aAAa,GAAG,CAAC,CAAA;QAErB,KAAK,MAAM,KAAK,IAAI,IAAI,CAAC,KAAK,CAAC,MAAM,EAAE,EAAE,CAAC;YACxC,IAAI,KAAK,CAAC,OAAO,GAAG,aAAa;gBAAE,aAAa,GAAG,KAAK,CAAC,OAAO,CAAA;YAChE,IAAI,KAAK,CAAC,OAAO,GAAG,aAAa;gBAAE,aAAa,GAAG,KAAK,CAAC,OAAO,CAAA;QAClE,CAAC;QAED,MAAM,KAAK,GAAG,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC,MAAM,CAAA;QACrC,OAAO;YACL,IAAI,EAAE,IAAI,CAAC,KAAK,CAAC,IAAI;YACrB,OAAO,EAAE,IAAI,CAAC,QAAQ;YACtB,OAAO,EAAE,KAAK,GAAG,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC;YAC1C,aAAa,EAAE,aAAa,KAAK,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,aAAa;YAC7D,aAAa;SACd,CAAA;IACH,CAAC;IAED;;OAEG;IACH,UAAU;QACR,IAAI,CAAC,IAAI,GAAG,CAAC,CAAA;QACb,IAAI,CAAC,MAAM,GAAG,CAAC,CAAA;IACjB,CAAC;IAED;;;;OAIG;IACH,KAAK;QACH,KAAK,MAAM,KAAK,IAAI,IAAI,CAAC,KAAK,CAAC,MAAM,EAAE,EAAE,CAAC;YACxC,IAAI,CAAC,UAAU,CAAC,KAAK,CAAC,IAAI,CAAC,CAAA;QAC7B,CAAC;QACD,IAAI,CAAC,KAAK,CAAC,KAAK,EAAE,CAAA;QAClB,IAAI,CAAC,IAAI,GAAG,CAAC,CAAA;QACb,IAAI,CAAC,MAAM,GAAG,CAAC,CAAA;IACjB,CAAC;IAED;;;;OAIG;IACH,OAAO;QACL,IAAI,CAAC,KAAK,EAAE,CAAA;IACd,CAAC;IAED;;OAEG;IACH,IAAI;QACF,OAAO,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,IAAI,EAAE,CAAC,CAAA;IACtC,CAAC;IAED;;;;;OAKG;IACH,MAAM,CAAC,WAAW,CAAC,OAAe;QAChC,OAAO,UAAU,CAAC,QAAQ,CAAC,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,KAAK,CAAC,CAAC,EAAE,EAAE,CAAC,CAAA;IACxE,CAAC;IAED;;OAEG;IACK,WAAW;QACjB,IAAI,UAAU,GAAkB,IAAI,CAAA;QACpC,IAAI,aAAa,GAAG,QAAQ,CAAA;QAE5B,KAAK,MAAM,CAAC,IAAI,EAAE,KAAK,CAAC,IAAI,IAAI,CAAC,KAAK,EAAE,CAAC;YACvC,IAAI,KAAK,CAAC,OAAO,GAAG,aAAa,EAAE,CAAC;gBAClC,aAAa,GAAG,KAAK,CAAC,OAAO,CAAA;gBAC7B,UAAU,GAAG,IAAI,CAAA;YACnB,CAAC;QACH,CAAC;QAED,IAAI,UAAU,EAAE,CAAC;YACf,IAAI,CAAC,UAAU,CAAC,UAAU,CAAC,CAAA;QAC7B,CAAC;IACH,CAAC;IAED;;;;OAIG;IACK,UAAU,CAAC,IAAa;QAC9B,IAAI,IAAI,IAAI,OAAO,IAAI,KAAK,QAAQ,EAAE,CAAC;YACrC,MAAM,SAAS,GAAG,IAA+B,CAAA;YACjD,IAAI,OAAO,SAAS,CAAC,MAAM,KAAK,UAAU,EAAE,CAAC;gBAC3C,IAAI,CAAC;oBACH,SAAS,CAAC,MAAM,EAAE,CAAA;gBACpB,CAAC;gBAAC,MAAM,CAAC;oBACP,+BAA+B;gBACjC,CAAC;YACH,CAAC;QACH,CAAC;IACH,CAAC;CACF"}

package/dist/src/analysis/tree-sitter/manager.d.ts

@@ -0,0 +1,141 @@
+/**
+ * SMI-1303: Tree-sitter Parser Manager
+ *
+ * Manages tree-sitter parser instances with lazy loading.
+ * Uses web-tree-sitter (WASM) to avoid native module conflicts.
+ *
+ * @see docs/architecture/multi-language-analysis.md
+ * @see ADR-002: Docker glibc Requirement
+ * @module analysis/tree-sitter/manager
+ */
+import type { SupportedLanguage } from '../types.js';
+/**
+ * Parser interface (matches web-tree-sitter API)
+ */
+export interface TreeSitterParser {
+    parse(input: string, previousTree?: TreeSitterTree): TreeSitterTree;
+    setLanguage(language: TreeSitterLanguage): void;
+    delete(): void;
+}
+/**
+ * Tree interface (matches web-tree-sitter API)
+ */
+export interface TreeSitterTree {
+    rootNode: TreeSitterNode;
+    delete(): void;
+}
+/**
+ * Node interface (matches web-tree-sitter API)
+ */
+export interface TreeSitterNode {
+    type: string;
+    text: string;
+    startPosition: {
+        row: number;
+        column: number;
+    };
+    endPosition: {
+        row: number;
+        column: number;
+    };
+    children: TreeSitterNode[];
+    namedChildren: TreeSitterNode[];
+    childCount: number;
+    namedChildCount: number;
+    child(index: number): TreeSitterNode | null;
+    namedChild(index: number): TreeSitterNode | null;
+    childForFieldName(fieldName: string): TreeSitterNode | null;
+    descendantsOfType(types: string | string[]): TreeSitterNode[];
+}
+/**
+ * Language module interface
+ */
+export interface TreeSitterLanguage {
+}
+/**
+ * Options for TreeSitterManager
+ */
+export interface TreeSitterManagerOptions {
+    /** Maximum parsers to cache (default: 6, one per language) */
+    maxParsers?: number;
+}
+/**
+ * Manages tree-sitter parser instances with lazy loading
+ *
+ * Parsers are loaded on-demand and cached for reuse.
+ * Uses WASM-based web-tree-sitter to avoid native module issues.
+ *
+ * @example
+ * ```typescript
+ * const manager = new TreeSitterManager()
+ * const parser = await manager.getParser('python')
+ * const tree = parser.parse('def main(): pass')
+ * manager.dispose()
+ * ```
+ */
+export declare class TreeSitterManager {
+    private parsers;
+    private loading;
+    private readonly maxParsers;
+    private initialized;
+    private initPromise;
+    private ParserClass;
+    private accessOrder;
+    constructor(options?: TreeSitterManagerOptions);
+    /**
+     * SMI-1333: Update access order for LRU tracking
+     * Moves the accessed language to the end (most recently used)
+     */
+    private updateAccessOrder;
+    /**
+     * Initialize web-tree-sitter (must be called before first use)
+     *
+     * This initializes the WASM runtime. Called automatically by getParser().
+     */
+    initialize(): Promise<void>;
+    private doInitialize;
+    /**
+     * Get parser for a language, loading if necessary
+     *
+     * Parsers are cached for reuse. If the maximum number of
+     * parsers is reached, the least recently used is evicted.
+     *
+     * @param language - Language to get parser for
+     * @returns Configured parser instance
+     * @throws Error if language is not supported or tree-sitter unavailable
+     *
+     * @example
+     * ```typescript
+     * const parser = await manager.getParser('python')
+     * const tree = parser.parse(pythonCode)
+     * ```
+     */
+    getParser(language: SupportedLanguage): Promise<TreeSitterParser>;
+    /**
+     * Load a parser for a specific language
+     */
+    private loadParser;
+    /**
+     * Load the language module for tree-sitter
+     */
+    private loadLanguageModule;
+    /**
+     * Check if a language is available
+     *
+     * @param language - Language to check
+     * @returns True if the language can be loaded
+     */
+    isLanguageAvailable(language: SupportedLanguage): Promise<boolean>;
+    /**
+     * Get list of currently loaded languages
+     */
+    getLoadedLanguages(): SupportedLanguage[];
+    /**
+     * Clean up all parser resources
+     *
+     * Call this when the manager is no longer needed
+     * to free memory and WASM resources.
+     */
+    dispose(): void;
+}
+//# sourceMappingURL=manager.d.ts.map

package/dist/src/analysis/tree-sitter/manager.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"manager.d.ts","sourceRoot":"","sources":["../../../../src/analysis/tree-sitter/manager.ts"],"names":[],"mappings":"AAAA;;;;;;;;;GASG;AAEH,OAAO,KAAK,EAAE,iBAAiB,EAAE,MAAM,aAAa,CAAA;AAEpD;;GAEG;AACH,MAAM,WAAW,gBAAgB;IAC/B,KAAK,CAAC,KAAK,EAAE,MAAM,EAAE,YAAY,CAAC,EAAE,cAAc,GAAG,cAAc,CAAA;IACnE,WAAW,CAAC,QAAQ,EAAE,kBAAkB,GAAG,IAAI,CAAA;IAC/C,MAAM,IAAI,IAAI,CAAA;CACf;AAED;;GAEG;AACH,MAAM,WAAW,cAAc;IAC7B,QAAQ,EAAE,cAAc,CAAA;IACxB,MAAM,IAAI,IAAI,CAAA;CACf;AAED;;GAEG;AACH,MAAM,WAAW,cAAc;IAC7B,IAAI,EAAE,MAAM,CAAA;IACZ,IAAI,EAAE,MAAM,CAAA;IACZ,aAAa,EAAE;QAAE,GAAG,EAAE,MAAM,CAAC;QAAC,MAAM,EAAE,MAAM,CAAA;KAAE,CAAA;IAC9C,WAAW,EAAE;QAAE,GAAG,EAAE,MAAM,CAAC;QAAC,MAAM,EAAE,MAAM,CAAA;KAAE,CAAA;IAC5C,QAAQ,EAAE,cAAc,EAAE,CAAA;IAC1B,aAAa,EAAE,cAAc,EAAE,CAAA;IAC/B,UAAU,EAAE,MAAM,CAAA;IAClB,eAAe,EAAE,MAAM,CAAA;IACvB,KAAK,CAAC,KAAK,EAAE,MAAM,GAAG,cAAc,GAAG,IAAI,CAAA;IAC3C,UAAU,CAAC,KAAK,EAAE,MAAM,GAAG,cAAc,GAAG,IAAI,CAAA;IAChD,iBAAiB,CAAC,SAAS,EAAE,MAAM,GAAG,cAAc,GAAG,IAAI,CAAA;IAC3D,iBAAiB,CAAC,KAAK,EAAE,MAAM,GAAG,MAAM,EAAE,GAAG,cAAc,EAAE,CAAA;CAC9D;AAED;;GAEG;AAEH,MAAM,WAAW,kBAAkB;CAElC;AAED;;GAEG;AACH,MAAM,WAAW,wBAAwB;IACvC,8DAA8D;IAC9D,UAAU,CAAC,EAAE,MAAM,CAAA;CACpB;AAED;;;;;;;;;;;;;GAaG;AACH,qBAAa,iBAAiB;IAC5B,OAAO,CAAC,OAAO,CAAsD;IACrE,OAAO,CAAC,OAAO,CAA+D;IAC9E,OAAO,CAAC,QAAQ,CAAC,UAAU,CAAQ;IACnC,OAAO,CAAC,WAAW,CAAQ;IAC3B,OAAO,CAAC,WAAW,CAA6B;IAChD,OAAO,CAAC,WAAW,CAA4C;IAE/D,OAAO,CAAC,WAAW,CAA0B;gBAEjC,OAAO,GAAE,wBAA6B;IAIlD;;;OAGG;IACH,OAAO,CAAC,iBAAiB;IAQzB;;;;OAIG;IACG,UAAU,IAAI,OAAO,CAAC,IAAI,CAAC;YAYnB,YAAY;IAuB1B;;;;;;;;;;;;;;;OAeG;IACG,SAAS,CAAC,QAAQ,EAAE,iBAAiB,GAAG,OAAO,CAAC,gBAAgB,CAAC;IA4CvE;;OAEG;YACW,UAAU;IAYxB;;OAEG;YACW,kBAAkB;IA0ChC;;;;;OAKG;IACG,mBAAmB,CAAC,QAAQ,EAAE,iBAAiB,GAAG,OAAO,CAAC,OAAO,CAAC;IASxE;;OAEG;IACH,kBAAkB,IAAI,iBAAiB,EAAE;IAIzC;;;;;OAKG;IACH,OAAO,IAAI,IAAI;CAgBhB"}