seer-mcp 0.1.0

package/dist/parser/walker.js

@@ -0,0 +1,217 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.walkTree = walkTree;
+exports.fieldText = fieldText;
+exports.firstLine = firstLine;
+/**
+ * Walk the tree, tracking the enclosing definition stack so that calls can
+ * be attributed to their containing function/method.
+ *
+ * v4 additions:
+ *   - For function/method/constructor symbols, computes cyclomatic + cognitive
+ *     complexity + max nesting depth + LOC by walking the def's subtree once.
+ *   - Calls `tryExtractRoute` / `tryExtractConfigKey` per node and threads the
+ *     results back through `FileExtraction.routes` / `.configKeys`.
+ *
+ * Optional `candidates` parameter: when provided, the walker only invokes the
+ * extractor's `tryExtract*` callbacks on nodes whose id is in the set. Tree
+ * structure is still fully traversed so the def-stack stays accurate; we just
+ * skip the per-node switch on non-candidates. Pass `undefined` (the default)
+ * to run as a full baseline walker.
+ */
+function walkTree(root, extractor, candidates) {
+    const extraction = {
+        language: extractor.languageName,
+        definitions: [],
+        references: [],
+        importedModules: [],
+        routes: [],
+        configKeys: [],
+        serviceCalls: [],
+    };
+    const defStack = [];
+    // One counter-map per nesting level tracks how many times each short name
+    // has been pushed as a direct child, so overloads get distinct suffixes.
+    const siblingCounts = [new Map()];
+    function pushName(name) {
+        const counters = siblingCounts[siblingCounts.length - 1];
+        const n = counters.get(name) ?? 0;
+        counters.set(name, n + 1);
+        const disambig = n === 0 ? name : `${name}#${n}`;
+        defStack.push(disambig);
+        siblingCounts.push(new Map());
+        return disambig;
+    }
+    function popName() {
+        defStack.pop();
+        siblingCounts.pop();
+    }
+    // When `candidates` is provided, only nodes whose id is in the set get
+    // their tryExtract* callbacks fired. Tree structure is still fully walked
+    // so the def-stack remains correct across non-candidate ancestors.
+    const useCandidates = candidates !== undefined;
+    function walk(node) {
+        const isCandidate = useCandidates ? candidates.has(node.id) : true;
+        const def = isCandidate ? extractor.tryExtractDefinition(node) : null;
+        if (def) {
+            // Out-of-line / qualified definitions (e.g. C++ `Vec::dot` defined at
+            // namespace scope) carry extra owning-scope segments that aren't on the
+            // lexical def stack. Fold them into the local name so the qualified name
+            // reflects the true owner, and key overload disambiguation on the full
+            // (scope + name) so `Foo::bar` and `Baz::bar` don't collapse together.
+            const localName = def.scopePath && def.scopePath.length > 0
+                ? `${def.scopePath.join('.')}.${def.name}`
+                : def.name;
+            const disambig = pushName(localName);
+            def.qualifiedName =
+                defStack.length === 1
+                    ? disambig
+                    : `${defStack.slice(0, -1).join('.')}.${disambig}`;
+            // Compute complexity for behavior-bearing symbols only (kinds where
+            // cyclomatic complexity is meaningful).
+            if ((def.kind === 'function' || def.kind === 'method' || def.kind === 'constructor') &&
+                extractor.branchNodeTypes) {
+                const m = measureComplexity(node, extractor.branchNodeTypes, extractor.nestingNodeTypes);
+                def.cyclomatic = m.cyclomatic;
+                def.cognitive = m.cognitive;
+                def.maxNesting = m.maxNesting;
+                def.loc = m.loc;
+            }
+            else if (def.kind === 'function' || def.kind === 'method' || def.kind === 'constructor') {
+                // LOC even without branchNodeTypes — cheap and useful.
+                def.loc = countNonBlankLines(node);
+            }
+            extraction.definitions.push(def);
+            for (const child of node.children)
+                walk(child);
+            popName();
+            return;
+        }
+        const ctxName = isCandidate ? extractor.tryExtractContextName?.(node) : null;
+        if (ctxName) {
+            defStack.push(ctxName);
+            siblingCounts.push(new Map());
+            for (const child of node.children)
+                walk(child);
+            popName();
+            return;
+        }
+        if (isCandidate) {
+            // Routes are checked before calls because route registrations are
+            // themselves call expressions in JS frameworks (`app.get("/x", handler)`).
+            // Returning routes doesn't prevent the call from also being recorded —
+            // the route registration call is itself useful in the call graph.
+            const routes = extractor.tryExtractRoute?.(node);
+            let wasRoute = false;
+            if (routes && routes.length > 0) {
+                for (const r of routes)
+                    extraction.routes.push(r);
+                wasRoute = true;
+            }
+            const configKey = extractor.tryExtractConfigKey?.(node);
+            if (configKey) {
+                configKey.callerName = defStack.length > 0 ? defStack.join('.') : '';
+                extraction.configKeys.push(configKey);
+            }
+            // Skip service-call extraction on nodes that were already classified as
+            // route registrations — `app.post('/api/x', handler)` is a server-side
+            // mount, not a client dialing /api/x. Without this guard the resolver
+            // would see two service_calls for every route and link the route handler
+            // to its own registration site.
+            const svcCalls = !wasRoute ? extractor.tryExtractServiceCalls?.(node) : null;
+            if (svcCalls && svcCalls.length > 0) {
+                const callerName = defStack.length > 0 ? defStack.join('.') : '';
+                for (const sc of svcCalls) {
+                    sc.callerName = sc.callerName ?? callerName;
+                    extraction.serviceCalls.push(sc);
+                }
+            }
+            const callee = extractor.tryExtractCallName(node);
+            if (callee) {
+                const callerName = defStack.length > 0 ? defStack.join('.') : '';
+                extraction.references.push({
+                    calleeName: callee,
+                    callerName,
+                    kind: 'call',
+                    line: node.startPosition.row,
+                });
+            }
+            const importPath = extractor.tryExtractImport(node);
+            if (importPath) {
+                extraction.importedModules.push(importPath);
+            }
+        }
+        for (const child of node.children)
+            walk(child);
+    }
+    walk(root);
+    return extraction;
+}
+function fieldText(node, fieldName) {
+    return node.childForFieldName(fieldName)?.text ?? null;
+}
+function firstLine(node, maxLen = 120) {
+    const text = node.text;
+    const end = text.indexOf('\n');
+    const line = end === -1 ? text : text.slice(0, end);
+    return line.trim().slice(0, maxLen);
+}
+// ── Complexity computation ─────────────────────────────────────────────────────
+/**
+ * Walk a function/method subtree once and compute:
+ *   - cyclomatic: 1 + count of branch nodes (if/while/for/case/catch/&&/||/?:)
+ *   - cognitive: branch count + extra penalty for nesting depth
+ *   - maxNesting: deepest nesting level reached inside the def body
+ *   - loc: non-blank lines in the def's source span
+ *
+ * Definitions of "branch" come from the extractor — different grammars name
+ * the same constructs differently (Python `if_statement` vs JS `if_statement`
+ * are spelled identically, but Go has `if_statement` + `expression_switch_statement`).
+ */
+function measureComplexity(defNode, branchTypes, nestingTypes) {
+    let cyclomatic = 1;
+    let cognitive = 0;
+    let maxNesting = 0;
+    const nesting = nestingTypes ?? branchTypes;
+    function visit(n, depth) {
+        if (n === defNode) {
+            for (const child of n.children)
+                visit(child, 0);
+            return;
+        }
+        let newDepth = depth;
+        if (branchTypes.has(n.type)) {
+            cyclomatic++;
+            // Cognitive: +1 + current depth for every branch (so deeply nested
+            // branches cost more). This matches Sonar's rough scoring.
+            cognitive += 1 + depth;
+        }
+        if (nesting.has(n.type)) {
+            newDepth = depth + 1;
+            if (newDepth > maxNesting)
+                maxNesting = newDepth;
+        }
+        for (const child of n.children)
+            visit(child, newDepth);
+    }
+    visit(defNode, 0);
+    const loc = countNonBlankLines(defNode);
+    return { cyclomatic, cognitive, maxNesting, loc };
+}
+function countNonBlankLines(node) {
+    const text = node.text;
+    if (!text)
+        return 0;
+    let count = 0;
+    let start = 0;
+    for (let i = 0; i <= text.length; i++) {
+        if (i === text.length || text.charCodeAt(i) === 10) {
+            const line = text.slice(start, i);
+            if (line.trim().length > 0)
+                count++;
+            start = i + 1;
+        }
+    }
+    return count;
+}
+//# sourceMappingURL=walker.js.map

package/dist/parser/walker.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"walker.js","sourceRoot":"","sources":["../../src/parser/walker.ts"],"names":[],"mappings":";;AAqFA,4BAgJC;AAED,8BAKC;AAED,8BAKC;AA9KD;;;;;;;;;;;;;;;GAeG;AACH,SAAgB,QAAQ,CACtB,IAAuB,EACvB,SAA4B,EAC5B,UAAgC;IAEhC,MAAM,UAAU,GAAmB;QACjC,QAAQ,EAAE,SAAS,CAAC,YAA0C;QAC9D,WAAW,EAAE,EAAE;QACf,UAAU,EAAE,EAAE;QACd,eAAe,EAAE,EAAE;QACnB,MAAM,EAAE,EAAE;QACV,UAAU,EAAE,EAAE;QACd,YAAY,EAAE,EAAE;KACjB,CAAC;IAEF,MAAM,QAAQ,GAAa,EAAE,CAAC;IAC9B,0EAA0E;IAC1E,yEAAyE;IACzE,MAAM,aAAa,GAA0B,CAAC,IAAI,GAAG,EAAE,CAAC,CAAC;IAEzD,SAAS,QAAQ,CAAC,IAAY;QAC5B,MAAM,QAAQ,GAAG,aAAa,CAAC,aAAa,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;QACzD,MAAM,CAAC,GAAG,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAClC,QAAQ,CAAC,GAAG,CAAC,IAAI,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC;QAC1B,MAAM,QAAQ,GAAG,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,GAAG,IAAI,IAAI,CAAC,EAAE,CAAC;QACjD,QAAQ,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;QACxB,aAAa,CAAC,IAAI,CAAC,IAAI,GAAG,EAAE,CAAC,CAAC;QAC9B,OAAO,QAAQ,CAAC;IAClB,CAAC;IAED,SAAS,OAAO;QACd,QAAQ,CAAC,GAAG,EAAE,CAAC;QACf,aAAa,CAAC,GAAG,EAAE,CAAC;IACtB,CAAC;IAED,uEAAuE;IACvE,0EAA0E;IAC1E,mEAAmE;IACnE,MAAM,aAAa,GAAG,UAAU,KAAK,SAAS,CAAC;IAE/C,SAAS,IAAI,CAAC,IAAuB;QACnC,MAAM,WAAW,GAAG,aAAa,CAAC,CAAC,CAAC,UAAW,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC;QAEpE,MAAM,GAAG,GAAG,WAAW,CAAC,CAAC,CAAC,SAAS,CAAC,oBAAoB,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC;QACtE,IAAI,GAAG,EAAE,CAAC;YACR,sEAAsE;YACtE,wEAAwE;YACxE,yEAAyE;YACzE,uEAAuE;YACvE,uEAAuE;YACvE,MAAM,SAAS,GAAG,GAAG,CAAC,SAAS,IAAI,GAAG,CAAC,SAAS,CAAC,MAAM,GAAG,CAAC;gBACzD,CAAC,CAAC,GAAG,GAAG,CAAC,SAAS,CAAC,IAAI,CAAC,GAAG,CAAC,IAAI,GAAG,CAAC,IAAI,EAAE;gBAC1C,CAAC,CAAC,GAAG,CAAC,IAAI,CAAC;YACb,MAAM,QAAQ,GAAG,QAAQ,CAAC,SAAS,CAAC,CAAC;YACrC,GAAG,CAAC,aAAa;gBACf,QAAQ,CAAC,MAAM,KAAK,CAAC;oBACnB,CAAC,CAAC,QAAQ;oBACV,CAAC,CAAC,GAAG,QAAQ,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,IAAI,QAAQ,EAAE,CAAC;YAEvD,oEAAoE;YACpE,wCAAwC;YACxC,IACE,CAAC,GAAG,CAAC,IAAI,KAAK,UAAU,IAAI,GAAG,CAAC,IAAI,KAAK,QAAQ,IAAI,GAAG,CAAC,IAAI,KAAK,aAAa,CAAC;gBAChF,SAAS,CAAC,eAAe,EACzB,CAAC;gBACD,MAAM,CAAC,GAAG,iBAAiB,CAAC,IAAI,EAAE,SAAS,CAAC,eAAe,EAAE,SAAS,CAAC,gBAAgB,CAAC,CAAC;gBACzF,GAAG,CAAC,UAAU,GAAG,CAAC,CAAC,UAAU,CAAC;gBAC9B,GAAG,CAAC,SAAS,GAAG,CAAC,CAAC,SAAS,CAAC;gBAC5B,GAAG,CAAC,UAAU,GAAG,CAAC,CAAC,UAAU,CAAC;gBAC9B,GAAG,CAAC,GAAG,GAAG,CAAC,CAAC,GAAG,CAAC;YAClB,CAAC;iBAAM,IAAI,GAAG,CAAC,IAAI,KAAK,UAAU,IAAI,GAAG,CAAC,IAAI,KAAK,QAAQ,IAAI,GAAG,CAAC,IAAI,KAAK,aAAa,EAAE,CAAC;gBAC1F,uDAAuD;gBACvD,GAAG,CAAC,GAAG,GAAG,kBAAkB,CAAC,IAAI,CAAC,CAAC;YACrC,CAAC;YAED,UAAU,CAAC,WAAW,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;YACjC,KAAK,MAAM,KAAK,IAAI,IAAI,CAAC,QAAQ;gBAAE,IAAI,CAAC,KAAK,CAAC,CAAC;YAC/C,OAAO,EAAE,CAAC;YACV,OAAO;QACT,CAAC;QAED,MAAM,OAAO,GAAG,WAAW,CAAC,CAAC,CAAC,SAAS,CAAC,qBAAqB,EAAE,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC;QAC7E,IAAI,OAAO,EAAE,CAAC;YACZ,QAAQ,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;YACvB,aAAa,CAAC,IAAI,CAAC,IAAI,GAAG,EAAE,CAAC,CAAC;YAC9B,KAAK,MAAM,KAAK,IAAI,IAAI,CAAC,QAAQ;gBAAE,IAAI,CAAC,KAAK,CAAC,CAAC;YAC/C,OAAO,EAAE,CAAC;YACV,OAAO;QACT,CAAC;QAED,IAAI,WAAW,EAAE,CAAC;YAChB,kEAAkE;YAClE,2EAA2E;YAC3E,uEAAuE;YACvE,kEAAkE;YAClE,MAAM,MAAM,GAAG,SAAS,CAAC,eAAe,EAAE,CAAC,IAAI,CAAC,CAAC;YACjD,IAAI,QAAQ,GAAG,KAAK,CAAC;YACrB,IAAI,MAAM,IAAI,MAAM,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;gBAChC,KAAK,MAAM,CAAC,IAAI,MAAM;oBAAE,UAAU,CAAC,MAAO,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;gBACnD,QAAQ,GAAG,IAAI,CAAC;YAClB,CAAC;YAED,MAAM,SAAS,GAAG,SAAS,CAAC,mBAAmB,EAAE,CAAC,IAAI,CAAC,CAAC;YACxD,IAAI,SAAS,EAAE,CAAC;gBACd,SAAS,CAAC,UAAU,GAAG,QAAQ,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,QAAQ,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;gBACrE,UAAU,CAAC,UAAW,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;YACzC,CAAC;YAED,wEAAwE;YACxE,uEAAuE;YACvE,sEAAsE;YACtE,yEAAyE;YACzE,gCAAgC;YAChC,MAAM,QAAQ,GAAG,CAAC,QAAQ,CAAC,CAAC,CAAC,SAAS,CAAC,sBAAsB,EAAE,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC;YAC7E,IAAI,QAAQ,IAAI,QAAQ,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;gBACpC,MAAM,UAAU,GAAG,QAAQ,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,QAAQ,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;gBACjE,KAAK,MAAM,EAAE,IAAI,QAAQ,EAAE,CAAC;oBAC1B,EAAE,CAAC,UAAU,GAAG,EAAE,CAAC,UAAU,IAAI,UAAU,CAAC;oBAC5C,UAAU,CAAC,YAAa,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;gBACpC,CAAC;YACH,CAAC;YAED,MAAM,MAAM,GAAG,SAAS,CAAC,kBAAkB,CAAC,IAAI,CAAC,CAAC;YAClD,IAAI,MAAM,EAAE,CAAC;gBACX,MAAM,UAAU,GAAG,QAAQ,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,QAAQ,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;gBACjE,UAAU,CAAC,UAAU,CAAC,IAAI,CAAC;oBACzB,UAAU,EAAE,MAAM;oBAClB,UAAU;oBACV,IAAI,EAAE,MAAM;oBACZ,IAAI,EAAE,IAAI,CAAC,aAAa,CAAC,GAAG;iBAC7B,CAAC,CAAC;YACL,CAAC;YAED,MAAM,UAAU,GAAG,SAAS,CAAC,gBAAgB,CAAC,IAAI,CAAC,CAAC;YACpD,IAAI,UAAU,EAAE,CAAC;gBACf,UAAU,CAAC,eAAe,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC;YAC9C,CAAC;QACH,CAAC;QAED,KAAK,MAAM,KAAK,IAAI,IAAI,CAAC,QAAQ;YAAE,IAAI,CAAC,KAAK,CAAC,CAAC;IACjD,CAAC;IAED,IAAI,CAAC,IAAI,CAAC,CAAC;IACX,OAAO,UAAU,CAAC;AACpB,CAAC;AAED,SAAgB,SAAS,CACvB,IAAuB,EACvB,SAAiB;IAEjB,OAAO,IAAI,CAAC,iBAAiB,CAAC,SAAS,CAAC,EAAE,IAAI,IAAI,IAAI,CAAC;AACzD,CAAC;AAED,SAAgB,SAAS,CAAC,IAAuB,EAAE,MAAM,GAAG,GAAG;IAC7D,MAAM,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC;IACvB,MAAM,GAAG,GAAG,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC;IAC/B,MAAM,IAAI,GAAG,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC;IACpD,OAAO,IAAI,CAAC,IAAI,EAAE,CAAC,KAAK,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC;AACtC,CAAC;AAED,kFAAkF;AAElF;;;;;;;;;;GAUG;AACH,SAAS,iBAAiB,CACxB,OAA0B,EAC1B,WAAgC,EAChC,YAAkC;IAElC,IAAI,UAAU,GAAG,CAAC,CAAC;IACnB,IAAI,SAAS,GAAG,CAAC,CAAC;IAClB,IAAI,UAAU,GAAG,CAAC,CAAC;IACnB,MAAM,OAAO,GAAG,YAAY,IAAI,WAAW,CAAC;IAE5C,SAAS,KAAK,CAAC,CAAoB,EAAE,KAAa;QAChD,IAAI,CAAC,KAAK,OAAO,EAAE,CAAC;YAClB,KAAK,MAAM,KAAK,IAAI,CAAC,CAAC,QAAQ;gBAAE,KAAK,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC;YAChD,OAAO;QACT,CAAC;QACD,IAAI,QAAQ,GAAG,KAAK,CAAC;QACrB,IAAI,WAAW,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC;YAC5B,UAAU,EAAE,CAAC;YACb,mEAAmE;YACnE,2DAA2D;YAC3D,SAAS,IAAI,CAAC,GAAG,KAAK,CAAC;QACzB,CAAC;QACD,IAAI,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC;YACxB,QAAQ,GAAG,KAAK,GAAG,CAAC,CAAC;YACrB,IAAI,QAAQ,GAAG,UAAU;gBAAE,UAAU,GAAG,QAAQ,CAAC;QACnD,CAAC;QACD,KAAK,MAAM,KAAK,IAAI,CAAC,CAAC,QAAQ;YAAE,KAAK,CAAC,KAAK,EAAE,QAAQ,CAAC,CAAC;IACzD,CAAC;IACD,KAAK,CAAC,OAAO,EAAE,CAAC,CAAC,CAAC;IAElB,MAAM,GAAG,GAAG,kBAAkB,CAAC,OAAO,CAAC,CAAC;IACxC,OAAO,EAAE,UAAU,EAAE,SAAS,EAAE,UAAU,EAAE,GAAG,EAAE,CAAC;AACpD,CAAC;AAED,SAAS,kBAAkB,CAAC,IAAuB;IACjD,MAAM,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC;IACvB,IAAI,CAAC,IAAI;QAAE,OAAO,CAAC,CAAC;IACpB,IAAI,KAAK,GAAG,CAAC,CAAC;IACd,IAAI,KAAK,GAAG,CAAC,CAAC;IACd,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,IAAI,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QACtC,IAAI,CAAC,KAAK,IAAI,CAAC,MAAM,IAAI,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC;YACnD,MAAM,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC;YAClC,IAAI,IAAI,CAAC,IAAI,EAAE,CAAC,MAAM,GAAG,CAAC;gBAAE,KAAK,EAAE,CAAC;YACpC,KAAK,GAAG,CAAC,GAAG,CAAC,CAAC;QAChB,CAAC;IACH,CAAC;IACD,OAAO,KAAK,CAAC;AACf,CAAC"}

package/dist/parser/worker.d.ts

@@ -0,0 +1,66 @@
+import type { FileExtraction, Language } from '../types.js';
+export type WorkerInput = {
+    kind: 'parse';
+    seq: number;
+    abs: string;
+    lang: Language;
+    /** Known DB hash for this file; if the just-read hash matches, skip parse. */
+    expectedHash: string | null;
+    /** 0 = no cap. */
+    maxFileBytes: number;
+} | {
+    kind: 'shutdown';
+};
+export type WorkerOutput = 
+/** Posted exactly once, after `Parser.init()` has succeeded. */
+{
+    kind: 'ready';
+}
+/** Read + hashed + parsed successfully. */
+ | {
+    kind: 'parsed';
+    seq: number;
+    hash: string;
+    lines: number;
+    size: number;
+    /** Cumulative ParserContext reset count in this worker isolate. */
+    wasmResets: number;
+    extraction: FileExtraction;
+}
+/** Read + hashed but parse returned null (tree-sitter gave up). */
+ | {
+    kind: 'parse-error';
+    seq: number;
+    hash: string;
+    lines: number;
+    size: number;
+    wasmResets: number;
+}
+/** Read + hash matched `expectedHash` — no parse performed. */
+ | {
+    kind: 'cached';
+    seq: number;
+    hash: string;
+    lines: number;
+    size: number;
+    wasmResets: number;
+}
+/** stat() reported size > maxFileBytes; file was not read. */
+ | {
+    kind: 'too-large';
+    seq: number;
+    size: number;
+    wasmResets: number;
+}
+/** readFile or stat threw. */
+ | {
+    kind: 'io-error';
+    seq: number;
+    error: string;
+    wasmResets: number;
+}
+/** Posted just before the worker calls process.exit(0) in response to shutdown. */
+ | {
+    kind: 'shutdown-ack';
+};
+//# sourceMappingURL=worker.d.ts.map

package/dist/parser/worker.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"worker.d.ts","sourceRoot":"","sources":["../../src/parser/worker.ts"],"names":[],"mappings":"AA0BA,OAAO,KAAK,EAAE,cAAc,EAAE,QAAQ,EAAE,MAAM,aAAa,CAAC;AAK5D,MAAM,MAAM,WAAW,GACnB;IACE,IAAI,EAAE,OAAO,CAAC;IACd,GAAG,EAAE,MAAM,CAAC;IACZ,GAAG,EAAE,MAAM,CAAC;IACZ,IAAI,EAAE,QAAQ,CAAC;IACf,8EAA8E;IAC9E,YAAY,EAAE,MAAM,GAAG,IAAI,CAAC;IAC5B,kBAAkB;IAClB,YAAY,EAAE,MAAM,CAAC;CACtB,GACD;IAAE,IAAI,EAAE,UAAU,CAAA;CAAE,CAAC;AAEzB,MAAM,MAAM,YAAY;AACtB,gEAAgE;AAC9D;IAAE,IAAI,EAAE,OAAO,CAAA;CAAE;AACnB,2CAA2C;GACzC;IACE,IAAI,EAAE,QAAQ,CAAC;IACf,GAAG,EAAE,MAAM,CAAC;IACZ,IAAI,EAAE,MAAM,CAAC;IACb,KAAK,EAAE,MAAM,CAAC;IACd,IAAI,EAAE,MAAM,CAAC;IACb,mEAAmE;IACnE,UAAU,EAAE,MAAM,CAAC;IACnB,UAAU,EAAE,cAAc,CAAC;CAC5B;AACH,mEAAmE;GACjE;IAAE,IAAI,EAAE,aAAa,CAAC;IAAC,GAAG,EAAE,MAAM,CAAC;IAAC,IAAI,EAAE,MAAM,CAAC;IAAC,KAAK,EAAE,MAAM,CAAC;IAAC,IAAI,EAAE,MAAM,CAAC;IAAC,UAAU,EAAE,MAAM,CAAA;CAAE;AACrG,+DAA+D;GAC7D;IAAE,IAAI,EAAE,QAAQ,CAAC;IAAC,GAAG,EAAE,MAAM,CAAC;IAAC,IAAI,EAAE,MAAM,CAAC;IAAC,KAAK,EAAE,MAAM,CAAC;IAAC,IAAI,EAAE,MAAM,CAAC;IAAC,UAAU,EAAE,MAAM,CAAA;CAAE;AAChG,8DAA8D;GAC5D;IAAE,IAAI,EAAE,WAAW,CAAC;IAAC,GAAG,EAAE,MAAM,CAAC;IAAC,IAAI,EAAE,MAAM,CAAC;IAAC,UAAU,EAAE,MAAM,CAAA;CAAE;AACtE,8BAA8B;GAC5B;IAAE,IAAI,EAAE,UAAU,CAAC;IAAC,GAAG,EAAE,MAAM,CAAC;IAAC,KAAK,EAAE,MAAM,CAAC;IAAC,UAAU,EAAE,MAAM,CAAA;CAAE;AACtE,mFAAmF;GACjF;IAAE,IAAI,EAAE,cAAc,CAAA;CAAE,CAAC"}

package/dist/parser/worker.js

@@ -0,0 +1,129 @@
+"use strict";
+var __importDefault = (this && this.__importDefault) || function (mod) {
+    return (mod && mod.__esModule) ? mod : { "default": mod };
+};
+Object.defineProperty(exports, "__esModule", { value: true });
+/**
+ * Parser worker — runs in its own V8 isolate via `worker_threads`.
+ *
+ * Each worker owns ONE `ParserContext` (its own WASM heap + grammar cache).
+ * Workers do their own file I/O so the main thread keeps no prefetcher,
+ * just dispatches paths and drains results.
+ *
+ * Protocol (see `WorkerInput` / `WorkerOutput`):
+ *   main → worker: { kind: 'parse', seq, abs, lang, expectedHash, maxFileBytes }
+ *   main → worker: { kind: 'shutdown' }
+ *   worker → main: { kind: 'ready' }                                          (once, on startup)
+ *   worker → main: { kind: 'parsed' | 'parse-error' | 'cached' | 'too-large' | 'io-error', seq, wasmResets, ... }
+ *   worker → main: { kind: 'shutdown-ack' }                                   (just before exit)
+ *
+ * The worker is intentionally dumb about WHAT to do with extractions — it
+ * just returns the FileExtraction. All DB writes happen on the main thread.
+ *
+ * Failure isolation: a WASM abort inside this worker is contained to this
+ * isolate. The `ParserContext` already auto-resets the WASM runtime after
+ * three consecutive failures. If the worker crashes outright the pool
+ * detects the exit and requeues the inflight job (subject to a per-job
+ * attempt limit so a poison file can't crash workers forever).
+ */
+const worker_threads_1 = require("worker_threads");
+const fs_1 = __importDefault(require("fs"));
+const crypto_1 = __importDefault(require("crypto"));
+const parserContext_js_1 = require("./parserContext.js");
+// ── Worker bootstrap ─────────────────────────────────────────────────────────
+if (!worker_threads_1.parentPort) {
+    throw new Error('parser/worker.ts must be loaded via worker_threads, not require()');
+}
+const port = worker_threads_1.parentPort;
+const ctx = new parserContext_js_1.ParserContext();
+// Test-only crash hook. When `SEER_WORKER_TEST_CRASH_ON=<substr>` is set in
+// the environment of the spawning process, the worker hard-crashes on any
+// parse job whose `abs` contains `<substr>`. Used by `tests/parallel-recovery.ts`
+// to verify that pool crash recovery (respawn + retry, attempt limit) works.
+// Production never sets this variable.
+const TEST_CRASH_ON = (typeof process !== 'undefined' && process.env && process.env.SEER_WORKER_TEST_CRASH_ON)
+    ? process.env.SEER_WORKER_TEST_CRASH_ON
+    : null;
+// Test-only reset hook. It lets worker-pool/indexer tests verify reset-count
+// aggregation deterministically without inducing a real tree-sitter WASM abort.
+// Production never sets this variable.
+const TEST_FAKE_WASM_RESET_ON = (typeof process !== 'undefined' && process.env && process.env.SEER_WORKER_TEST_FAKE_WASM_RESET_ON)
+    ? process.env.SEER_WORKER_TEST_FAKE_WASM_RESET_ON
+    : null;
+let testExtraWasmResets = 0;
+function post(msg) {
+    port.postMessage(msg);
+}
+function sha256Short(content) {
+    return crypto_1.default.createHash('sha256').update(content, 'utf8').digest('hex').slice(0, 16);
+}
+function wasmResetCount() {
+    return ctx.wasmResetCount() + testExtraWasmResets;
+}
+async function handleParse(job) {
+    const { seq, abs, lang, expectedHash, maxFileBytes } = job;
+    // Test-only crash hook.
+    if (TEST_CRASH_ON && abs.includes(TEST_CRASH_ON)) {
+        // Hard-exit so the parent observes a non-zero `exit` event — the pool's
+        // crash path runs and we exercise respawn + retry + attempt-limit.
+        process.exit(13);
+    }
+    if (TEST_FAKE_WASM_RESET_ON && abs.includes(TEST_FAKE_WASM_RESET_ON)) {
+        testExtraWasmResets++;
+    }
+    // Size gate: only stat when a cap is in force, so the default-no-cap path
+    // is one syscall (the readFile) per file.
+    if (maxFileBytes > 0) {
+        let size;
+        try {
+            size = (await fs_1.default.promises.stat(abs)).size;
+        }
+        catch (err) {
+            post({ kind: 'io-error', seq, error: String(err?.message ?? err), wasmResets: wasmResetCount() });
+            return;
+        }
+        if (size > maxFileBytes) {
+            post({ kind: 'too-large', seq, size, wasmResets: wasmResetCount() });
+            return;
+        }
+    }
+    let content;
+    try {
+        content = await fs_1.default.promises.readFile(abs, 'utf8');
+    }
+    catch (err) {
+        post({ kind: 'io-error', seq, error: String(err?.message ?? err), wasmResets: wasmResetCount() });
+        return;
+    }
+    const hash = sha256Short(content);
+    const lines = content.split('\n').length;
+    const size = Buffer.byteLength(content, 'utf8');
+    // Cache hit — main thread gave us a known hash for this path, and it
+    // matches. Skip parsing entirely; main thread will still upsertFileWithCache
+    // (so touchedFileIds is updated and pruneFilesNotIn does not delete this).
+    if (expectedHash !== null && hash === expectedHash) {
+        post({ kind: 'cached', seq, hash, lines, size, wasmResets: wasmResetCount() });
+        return;
+    }
+    const extraction = await ctx.parseFile(content, abs, lang);
+    if (!extraction) {
+        post({ kind: 'parse-error', seq, hash, lines, size, wasmResets: wasmResetCount() });
+        return;
+    }
+    post({ kind: 'parsed', seq, hash, lines, size, wasmResets: wasmResetCount(), extraction });
+}
+port.on('message', (msg) => {
+    if (msg.kind === 'shutdown') {
+        post({ kind: 'shutdown-ack' });
+        // Give the message a tick to flush before exit.
+        setImmediate(() => process.exit(0));
+        return;
+    }
+    // Errors inside handleParse must not crash the worker — they're caught,
+    // logged through the protocol, and the worker stays alive for the next job.
+    handleParse(msg).catch(err => {
+        post({ kind: 'io-error', seq: msg.seq, error: `worker internal: ${String(err?.message ?? err)}`, wasmResets: wasmResetCount() });
+    });
+});
+post({ kind: 'ready' });
+//# sourceMappingURL=worker.js.map

package/dist/parser/worker.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"worker.js","sourceRoot":"","sources":["../../src/parser/worker.ts"],"names":[],"mappings":";;;;;AAAA;;;;;;;;;;;;;;;;;;;;;;GAsBG;AACH,mDAA4C;AAC5C,4CAAoB;AACpB,oDAA4B;AAE5B,yDAAmD;AA0CnD,gFAAgF;AAEhF,IAAI,CAAC,2BAAU,EAAE,CAAC;IAChB,MAAM,IAAI,KAAK,CAAC,mEAAmE,CAAC,CAAC;AACvF,CAAC;AAED,MAAM,IAAI,GAAG,2BAAU,CAAC;AACxB,MAAM,GAAG,GAAG,IAAI,gCAAa,EAAE,CAAC;AAEhC,4EAA4E;AAC5E,0EAA0E;AAC1E,kFAAkF;AAClF,6EAA6E;AAC7E,uCAAuC;AACvC,MAAM,aAAa,GACjB,CAAC,OAAO,OAAO,KAAK,WAAW,IAAI,OAAO,CAAC,GAAG,IAAI,OAAO,CAAC,GAAG,CAAC,yBAAyB,CAAC;IACtF,CAAC,CAAC,OAAO,CAAC,GAAG,CAAC,yBAAyB;IACvC,CAAC,CAAC,IAAI,CAAC;AAEX,6EAA6E;AAC7E,gFAAgF;AAChF,uCAAuC;AACvC,MAAM,uBAAuB,GAC3B,CAAC,OAAO,OAAO,KAAK,WAAW,IAAI,OAAO,CAAC,GAAG,IAAI,OAAO,CAAC,GAAG,CAAC,mCAAmC,CAAC;IAChG,CAAC,CAAC,OAAO,CAAC,GAAG,CAAC,mCAAmC;IACjD,CAAC,CAAC,IAAI,CAAC;AACX,IAAI,mBAAmB,GAAG,CAAC,CAAC;AAE5B,SAAS,IAAI,CAAC,GAAiB;IAC7B,IAAI,CAAC,WAAW,CAAC,GAAG,CAAC,CAAC;AACxB,CAAC;AAED,SAAS,WAAW,CAAC,OAAe;IAClC,OAAO,gBAAM,CAAC,UAAU,CAAC,QAAQ,CAAC,CAAC,MAAM,CAAC,OAAO,EAAE,MAAM,CAAC,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,KAAK,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC;AACxF,CAAC;AAED,SAAS,cAAc;IACrB,OAAO,GAAG,CAAC,cAAc,EAAE,GAAG,mBAAmB,CAAC;AACpD,CAAC;AAED,KAAK,UAAU,WAAW,CAAC,GAA4C;IACrE,MAAM,EAAE,GAAG,EAAE,GAAG,EAAE,IAAI,EAAE,YAAY,EAAE,YAAY,EAAE,GAAG,GAAG,CAAC;IAE3D,wBAAwB;IACxB,IAAI,aAAa,IAAI,GAAG,CAAC,QAAQ,CAAC,aAAa,CAAC,EAAE,CAAC;QACjD,wEAAwE;QACxE,mEAAmE;QACnE,OAAO,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;IACnB,CAAC;IACD,IAAI,uBAAuB,IAAI,GAAG,CAAC,QAAQ,CAAC,uBAAuB,CAAC,EAAE,CAAC;QACrE,mBAAmB,EAAE,CAAC;IACxB,CAAC;IAED,0EAA0E;IAC1E,0CAA0C;IAC1C,IAAI,YAAY,GAAG,CAAC,EAAE,CAAC;QACrB,IAAI,IAAY,CAAC;QACjB,IAAI,CAAC;YACH,IAAI,GAAG,CAAC,MAAM,YAAE,CAAC,QAAQ,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC;QAC5C,CAAC;QAAC,OAAO,GAAG,EAAE,CAAC;YACb,IAAI,CAAC,EAAE,IAAI,EAAE,UAAU,EAAE,GAAG,EAAE,KAAK,EAAE,MAAM,CAAE,GAAa,EAAE,OAAO,IAAI,GAAG,CAAC,EAAE,UAAU,EAAE,cAAc,EAAE,EAAE,CAAC,CAAC;YAC7G,OAAO;QACT,CAAC;QACD,IAAI,IAAI,GAAG,YAAY,EAAE,CAAC;YACxB,IAAI,CAAC,EAAE,IAAI,EAAE,WAAW,EAAE,GAAG,EAAE,IAAI,EAAE,UAAU,EAAE,cAAc,EAAE,EAAE,CAAC,CAAC;YACrE,OAAO;QACT,CAAC;IACH,CAAC;IAED,IAAI,OAAe,CAAC;IACpB,IAAI,CAAC;QACH,OAAO,GAAG,MAAM,YAAE,CAAC,QAAQ,CAAC,QAAQ,CAAC,GAAG,EAAE,MAAM,CAAC,CAAC;IACpD,CAAC;IAAC,OAAO,GAAG,EAAE,CAAC;QACb,IAAI,CAAC,EAAE,IAAI,EAAE,UAAU,EAAE,GAAG,EAAE,KAAK,EAAE,MAAM,CAAE,GAAa,EAAE,OAAO,IAAI,GAAG,CAAC,EAAE,UAAU,EAAE,cAAc,EAAE,EAAE,CAAC,CAAC;QAC7G,OAAO;IACT,CAAC;IAED,MAAM,IAAI,GAAG,WAAW,CAAC,OAAO,CAAC,CAAC;IAClC,MAAM,KAAK,GAAG,OAAO,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,MAAM,CAAC;IACzC,MAAM,IAAI,GAAG,MAAM,CAAC,UAAU,CAAC,OAAO,EAAE,MAAM,CAAC,CAAC;IAEhD,qEAAqE;IACrE,6EAA6E;IAC7E,2EAA2E;IAC3E,IAAI,YAAY,KAAK,IAAI,IAAI,IAAI,KAAK,YAAY,EAAE,CAAC;QACnD,IAAI,CAAC,EAAE,IAAI,EAAE,QAAQ,EAAE,GAAG,EAAE,IAAI,EAAE,KAAK,EAAE,IAAI,EAAE,UAAU,EAAE,cAAc,EAAE,EAAE,CAAC,CAAC;QAC/E,OAAO;IACT,CAAC;IAED,MAAM,UAAU,GAAG,MAAM,GAAG,CAAC,SAAS,CAAC,OAAO,EAAE,GAAG,EAAE,IAAI,CAAC,CAAC;IAC3D,IAAI,CAAC,UAAU,EAAE,CAAC;QAChB,IAAI,CAAC,EAAE,IAAI,EAAE,aAAa,EAAE,GAAG,EAAE,IAAI,EAAE,KAAK,EAAE,IAAI,EAAE,UAAU,EAAE,cAAc,EAAE,EAAE,CAAC,CAAC;QACpF,OAAO;IACT,CAAC;IACD,IAAI,CAAC,EAAE,IAAI,EAAE,QAAQ,EAAE,GAAG,EAAE,IAAI,EAAE,KAAK,EAAE,IAAI,EAAE,UAAU,EAAE,cAAc,EAAE,EAAE,UAAU,EAAE,CAAC,CAAC;AAC7F,CAAC;AAED,IAAI,CAAC,EAAE,CAAC,SAAS,EAAE,CAAC,GAAgB,EAAE,EAAE;IACtC,IAAI,GAAG,CAAC,IAAI,KAAK,UAAU,EAAE,CAAC;QAC5B,IAAI,CAAC,EAAE,IAAI,EAAE,cAAc,EAAE,CAAC,CAAC;QAC/B,gDAAgD;QAChD,YAAY,CAAC,GAAG,EAAE,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC;QACpC,OAAO;IACT,CAAC;IACD,wEAAwE;IACxE,4EAA4E;IAC5E,WAAW,CAAC,GAAG,CAAC,CAAC,KAAK,CAAC,GAAG,CAAC,EAAE;QAC3B,IAAI,CAAC,EAAE,IAAI,EAAE,UAAU,EAAE,GAAG,EAAE,GAAG,CAAC,GAAG,EAAE,KAAK,EAAE,oBAAoB,MAAM,CAAE,GAAa,EAAE,OAAO,IAAI,GAAG,CAAC,EAAE,EAAE,UAAU,EAAE,cAAc,EAAE,EAAE,CAAC,CAAC;IAC9I,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC;AAEH,IAAI,CAAC,EAAE,IAAI,EAAE,OAAO,EAAE,CAAC,CAAC"}

package/dist/parser/workerpool.d.ts

@@ -0,0 +1,107 @@
+import type { Language } from '../types.js';
+import type { WorkerOutput } from './worker.js';
+export interface WorkerPoolOptions {
+    /** Number of worker threads. Defaults to min(8, max(1, availableParallelism()-1)). */
+    jobs?: number;
+    /** Path to the compiled worker .js. Defaults to dist/parser/worker.js next to this module. */
+    workerPath?: string;
+    /**
+     * Max gap between the head seq (next to drain) and any dispatched seq.
+     * Bounds the out-of-order buffer at `maxLag` results in memory.
+     * Default: `jobs * 4`.
+     */
+    maxLag?: number;
+    /**
+     * Max times the same seq can be reattempted after a worker crash before
+     * we give up and mark it parse-error. Defaults to 3. (One legitimate try +
+     * two retries through respawned workers.)
+     */
+    maxAttempts?: number;
+}
+export interface WorkItem {
+    abs: string;
+    lang: Language;
+    /** Known DB hash for this file (null if no DB row). */
+    expectedHash: string | null;
+    /** Per-file byte cap. 0 = no cap. */
+    maxFileBytes: number;
+}
+/** What the consumer callback receives. `result` is one of the worker output kinds (minus the lifecycle ones). */
+export type PoolResult = Extract<WorkerOutput, {
+    kind: 'parsed';
+}> | Extract<WorkerOutput, {
+    kind: 'parse-error';
+}> | Extract<WorkerOutput, {
+    kind: 'cached';
+}> | Extract<WorkerOutput, {
+    kind: 'too-large';
+}> | Extract<WorkerOutput, {
+    kind: 'io-error';
+}>;
+export type ResultCallback = (seq: number, result: PoolResult, item: WorkItem) => void | Promise<void>;
+export declare function defaultWorkerPath(): string;
+export declare class WorkerPool {
+    private readonly workerPath;
+    private readonly maxLag;
+    private readonly maxAttempts;
+    private readonly _jobs;
+    private workers;
+    private idle;
+    private nextWorkerId;
+    /** Sequence number of the next result we expect to deliver via the callback. */
+    private headSeq;
+    /** Total jobs in the current dispatch. */
+    private totalJobs;
+    /** Next seq to send to a worker. */
+    private nextDispatchSeq;
+    /** seq → WorkItem (for the entire dispatch). */
+    private items;
+    /** seq → attempt count. */
+    private attempts;
+    /** Out-of-order buffer for seq > headSeq. */
+    private buffered;
+    /** Awaiting-worker queue: seqs that need to be dispatched but no worker is free. */
+    private pendingDispatch;
+    /** Currently active dispatch — null when idle. */
+    private active;
+    /**
+     * Synchronous flag set the moment `dispatch()` is entered. Prevents two
+     * synchronous `dispatch()` calls from both passing the `if (this.active)`
+     * guard before the first reaches its `await this.ready()`. `this.active`
+     * itself is set after that await, so it can't be the only guard.
+     */
+    private dispatching;
+    /** A rolling promise chain so the consumer callback is invoked strictly serially. */
+    private callbackChain;
+    private _wasmResets;
+    private terminated;
+    constructor(opts?: WorkerPoolOptions);
+    /** Number of workers actually spawned (after `ready()`). */
+    get jobs(): number;
+    /** Total worker-local ParserContext resets observed across this pool. */
+    wasmResetCount(): number;
+    /** Spawn workers and wait for all of them to post `ready`. */
+    ready(): Promise<void>;
+    /**
+     * Dispatch every WorkItem to the pool. The callback is invoked exactly once
+     * per item, in input order, regardless of which worker finished it.
+     *
+     * Resolves when every item has been delivered to the callback. Rejects if
+     * the pool is terminated mid-dispatch.
+     */
+    dispatch(items: WorkItem[], onResult: ResultCallback): Promise<void>;
+    /** Shutdown: send 'shutdown' to each worker, await all exits. */
+    shutdown(): Promise<void>;
+    /** Hammer: force-terminate all workers. Use only when shutdown() can't. */
+    terminate(): Promise<void>;
+    /** Pump dispatch + drain until either no work is left or no slack remains. */
+    private pump;
+    private sendJob;
+    private spawnWorker;
+    private respawnWorker;
+    private onWorkerCrash;
+    private onWorkerMessage;
+    private deliver;
+    private invokeCallback;
+}
+//# sourceMappingURL=workerpool.d.ts.map

package/dist/parser/workerpool.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"workerpool.d.ts","sourceRoot":"","sources":["../../src/parser/workerpool.ts"],"names":[],"mappings":"AA2BA,OAAO,KAAK,EAAE,QAAQ,EAAE,MAAM,aAAa,CAAC;AAC5C,OAAO,KAAK,EAAe,YAAY,EAAE,MAAM,aAAa,CAAC;AAI7D,MAAM,WAAW,iBAAiB;IAChC,sFAAsF;IACtF,IAAI,CAAC,EAAE,MAAM,CAAC;IACd,8FAA8F;IAC9F,UAAU,CAAC,EAAE,MAAM,CAAC;IACpB;;;;OAIG;IACH,MAAM,CAAC,EAAE,MAAM,CAAC;IAChB;;;;OAIG;IACH,WAAW,CAAC,EAAE,MAAM,CAAC;CACtB;AAED,MAAM,WAAW,QAAQ;IACvB,GAAG,EAAE,MAAM,CAAC;IACZ,IAAI,EAAE,QAAQ,CAAC;IACf,uDAAuD;IACvD,YAAY,EAAE,MAAM,GAAG,IAAI,CAAC;IAC5B,qCAAqC;IACrC,YAAY,EAAE,MAAM,CAAC;CACtB;AAED,kHAAkH;AAClH,MAAM,MAAM,UAAU,GAClB,OAAO,CAAC,YAAY,EAAE;IAAE,IAAI,EAAE,QAAQ,CAAA;CAAE,CAAC,GACzC,OAAO,CAAC,YAAY,EAAE;IAAE,IAAI,EAAE,aAAa,CAAA;CAAE,CAAC,GAC9C,OAAO,CAAC,YAAY,EAAE;IAAE,IAAI,EAAE,QAAQ,CAAA;CAAE,CAAC,GACzC,OAAO,CAAC,YAAY,EAAE;IAAE,IAAI,EAAE,WAAW,CAAA;CAAE,CAAC,GAC5C,OAAO,CAAC,YAAY,EAAE;IAAE,IAAI,EAAE,UAAU,CAAA;CAAE,CAAC,CAAC;AAEhD,MAAM,MAAM,cAAc,GAAG,CAAC,GAAG,EAAE,MAAM,EAAE,MAAM,EAAE,UAAU,EAAE,IAAI,EAAE,QAAQ,KAAK,IAAI,GAAG,OAAO,CAAC,IAAI,CAAC,CAAC;AAoBvG,wBAAgB,iBAAiB,IAAI,MAAM,CAiB1C;AAID,qBAAa,UAAU;IACrB,OAAO,CAAC,QAAQ,CAAC,UAAU,CAAS;IACpC,OAAO,CAAC,QAAQ,CAAC,MAAM,CAAS;IAChC,OAAO,CAAC,QAAQ,CAAC,WAAW,CAAS;IACrC,OAAO,CAAC,QAAQ,CAAC,KAAK,CAAS;IAE/B,OAAO,CAAC,OAAO,CAAsB;IACrC,OAAO,CAAC,IAAI,CAAsB;IAClC,OAAO,CAAC,YAAY,CAAK;IAEzB,gFAAgF;IAChF,OAAO,CAAC,OAAO,CAAK;IACpB,0CAA0C;IAC1C,OAAO,CAAC,SAAS,CAAK;IACtB,oCAAoC;IACpC,OAAO,CAAC,eAAe,CAAK;IAC5B,gDAAgD;IAChD,OAAO,CAAC,KAAK,CAAkB;IAC/B,2BAA2B;IAC3B,OAAO,CAAC,QAAQ,CAA6B;IAC7C,6CAA6C;IAC7C,OAAO,CAAC,QAAQ,CAAiC;IACjD,oFAAoF;IACpF,OAAO,CAAC,eAAe,CAAgB;IACvC,kDAAkD;IAClD,OAAO,CAAC,MAAM,CAKE;IAChB;;;;;OAKG;IACH,OAAO,CAAC,WAAW,CAAS;IAC5B,qFAAqF;IACrF,OAAO,CAAC,aAAa,CAAoC;IACzD,OAAO,CAAC,WAAW,CAAK;IAExB,OAAO,CAAC,UAAU,CAAS;gBAEf,IAAI,GAAE,iBAAsB;IAOxC,4DAA4D;IAC5D,IAAI,IAAI,IAAI,MAAM,CAAuB;IAEzC,yEAAyE;IACzE,cAAc,IAAI,MAAM;IAExB,8DAA8D;IACxD,KAAK,IAAI,OAAO,CAAC,IAAI,CAAC;IAwB5B;;;;;;OAMG;IACG,QAAQ,CAAC,KAAK,EAAE,QAAQ,EAAE,EAAE,QAAQ,EAAE,cAAc,GAAG,OAAO,CAAC,IAAI,CAAC;IAwC1E,iEAAiE;IAC3D,QAAQ,IAAI,OAAO,CAAC,IAAI,CAAC;IAgB/B,2EAA2E;IACrE,SAAS,IAAI,OAAO,CAAC,IAAI,CAAC;IAYhC,8EAA8E;IAC9E,OAAO,CAAC,IAAI;IA2BZ,OAAO,CAAC,OAAO;IAmBf,OAAO,CAAC,WAAW;IAuBnB,OAAO,CAAC,aAAa;IAoBrB,OAAO,CAAC,aAAa;IAiCrB,OAAO,CAAC,eAAe;IAkBvB,OAAO,CAAC,OAAO;IAkBf,OAAO,CAAC,cAAc;CAUvB"}