code-auditor-mcp 4.1.0 → 5.0.1

package/dist/languages/json/JsonAdapter.js

@@ -0,0 +1,531 @@
+/**
+ * JSON language adapter with a position-preserving parser.
+ *
+ * Spec 68 Amendment 1 — "json is a format". A `.json` file is parsed like any
+ * other source file, so the `schema-json` rules can go through the same
+ * per-file model as every other rule instead of reading `.json` files off disk
+ * through a config callback (`config.schemaFilePatterns`).
+ *
+ * There is no tree-sitter JSON grammar in this repository (the WASM grammars
+ * are css, go, javascript, scss, tsx, typescript), so this adapter uses a
+ * hand-written recursive-descent JSON parser that records the byte range and
+ * line/column of every value. That is the one property Amendment 1 makes
+ * load-bearing: a finding must carry a real position, so the parser must not
+ * lose it. The parse is deliberately NOT `JSON.parse` + re-walk — `JSON.parse`
+ * discards positions, which is exactly what the old `jsonSchema.ts` `emit` did
+ * when it hardcoded `line: 1, column: 1`.
+ *
+ * JSON has no functions, classes, imports, exports, loops, or variables, so
+ * every extraction/predicate method returns empty/false — the same stub shape
+ * as {@link TreeSitterCssAdapter}. The tree still satisfies the `AST` contract:
+ * each node has a `type` (`object` / `array` / `string` / `number` /
+ * `boolean` / `null`), a real `range`, a real `location`, and `children` for
+ * object members and array elements. An object member's value node carries its
+ * key through a side map (surfaced by `getNodeName`); its raw value is
+ * recoverable by the consumer slicing `source[node.range]` and re-parsing, so
+ * no value object (which §4's serializability would reject) is stored on the
+ * node itself.
+ */
+// ---------------------------------------------------------------------------
+// Side maps (keyed by ASTNode — never serialized, never cross a phase boundary)
+// ---------------------------------------------------------------------------
+/** The object key a member's value node was stored under, when any. */
+const keyMap = new WeakMap();
+// ---------------------------------------------------------------------------
+// Position-preserving JSON parser
+// ---------------------------------------------------------------------------
+/** Byte offsets of each line start (line 1 = offset 0). */
+function buildLineStarts(source) {
+    const starts = [0];
+    for (let i = 0; i < source.length; i++) {
+        if (source[i] === '\n')
+            starts.push(i + 1);
+    }
+    return starts;
+}
+/** 1-based line/column for a byte offset, via binary search over line starts. */
+function locationFor(starts, offset) {
+    let lo = 0;
+    let hi = starts.length - 1;
+    while (lo < hi) {
+        const mid = (lo + hi + 1) >> 1;
+        if (starts[mid] <= offset)
+            lo = mid;
+        else
+            hi = mid - 1;
+    }
+    return { line: lo + 1, column: offset - starts[lo] + 1 };
+}
+class JsonParseError extends Error {
+    location;
+    constructor(message, location) {
+        super(message);
+        this.location = location;
+    }
+}
+class JsonValueParser {
+    source;
+    starts;
+    pos = 0;
+    constructor(source) {
+        this.source = source;
+        this.starts = buildLineStarts(source);
+    }
+    /** Parse the whole document into a positioned value tree. */
+    parse() {
+        const root = this.parseValue();
+        this.skipWs();
+        if (this.pos !== this.source.length) {
+            throw this.err('Unexpected token after JSON value', this.pos);
+        }
+        return root;
+    }
+    // -- cursor primitives ------------------------------------------------------
+    skipWs() {
+        while (this.pos < this.source.length && this.isWhitespace(this.source[this.pos]))
+            this.pos++;
+    }
+    isWhitespace(ch) {
+        return ch === ' ' || ch === '\n' || ch === '\t' || ch === '\r';
+    }
+    peek() {
+        return this.source[this.pos] ?? '';
+    }
+    err(message, at) {
+        const offset = at ?? this.pos;
+        const start = offset;
+        const end = Math.min(offset + 1, this.source.length);
+        return new JsonParseError(message, {
+            start: locationFor(this.starts, start),
+            end: locationFor(this.starts, end),
+        });
+    }
+    makeNode(type, start, end, children) {
+        const node = {
+            type,
+            range: [start, end],
+            location: {
+                start: locationFor(this.starts, start),
+                end: locationFor(this.starts, end),
+            },
+        };
+        if (children && children.length > 0)
+            node.children = children;
+        return node;
+    }
+    // -- values ------------------------------------------------------------------
+    parseValue() {
+        this.skipWs();
+        const ch = this.peek();
+        switch (ch) {
+            case '{': return this.parseObject();
+            case '[': return this.parseArray();
+            case '"': return this.parseStringValue().node;
+            case 't':
+            case 'f':
+            case 'n':
+                return this.parseLiteral();
+            default:
+                return this.parseNumber();
+        }
+    }
+    parseObject() {
+        const start = this.pos;
+        this.pos++; // consume '{'
+        const children = [];
+        this.skipWs();
+        if (this.peek() === '}') {
+            this.pos++;
+            return this.makeNode('object', start, this.pos, children);
+        }
+        for (;;) {
+            this.skipWs();
+            if (this.peek() !== '"')
+                throw this.err('Expected object key string');
+            const key = this.parseStringValue();
+            this.skipWs();
+            if (this.peek() !== ':')
+                throw this.err("Expected ':' after object key");
+            this.pos++; // consume ':'
+            const value = this.parseValue();
+            keyMap.set(value, key.text);
+            children.push(value);
+            this.skipWs();
+            const sep = this.peek();
+            if (sep === ',') {
+                this.pos++;
+                continue;
+            }
+            if (sep === '}') {
+                this.pos++;
+                break;
+            }
+            throw this.err("Expected ',' or '}' in object");
+        }
+        return this.makeNode('object', start, this.pos, children);
+    }
+    parseArray() {
+        const start = this.pos;
+        this.pos++; // consume '['
+        const children = [];
+        this.skipWs();
+        if (this.peek() === ']') {
+            this.pos++;
+            return this.makeNode('array', start, this.pos, children);
+        }
+        for (;;) {
+            const value = this.parseValue();
+            children.push(value);
+            this.skipWs();
+            const sep = this.peek();
+            if (sep === ',') {
+                this.pos++;
+                continue;
+            }
+            if (sep === ']') {
+                this.pos++;
+                break;
+            }
+            throw this.err("Expected ',' or ']' in array");
+        }
+        return this.makeNode('array', start, this.pos, children);
+    }
+    parseStringValue() {
+        const start = this.pos;
+        this.pos++; // consume '"'
+        let text = '';
+        for (;;) {
+            if (this.pos >= this.source.length)
+                throw this.err('Unterminated string', start);
+            const ch = this.source[this.pos];
+            if (ch === '"') {
+                this.pos++;
+                break;
+            }
+            if (ch === '\\') {
+                const esc = this.source[this.pos + 1];
+                switch (esc) {
+                    case '"':
+                        text += '"';
+                        break;
+                    case '\\':
+                        text += '\\';
+                        break;
+                    case '/':
+                        text += '/';
+                        break;
+                    case 'b':
+                        text += '\b';
+                        break;
+                    case 'f':
+                        text += '\f';
+                        break;
+                    case 'n':
+                        text += '\n';
+                        break;
+                    case 'r':
+                        text += '\r';
+                        break;
+                    case 't':
+                        text += '\t';
+                        break;
+                    case 'u': {
+                        const hex = this.source.slice(this.pos + 2, this.pos + 6);
+                        text += String.fromCharCode(parseInt(hex, 16));
+                        this.pos += 4;
+                        break;
+                    }
+                    default:
+                        throw this.err(`Invalid escape '\\${esc}'`, this.pos);
+                }
+                this.pos += 2;
+                continue;
+            }
+            text += ch;
+            this.pos++;
+        }
+        return { node: this.makeNode('string', start, this.pos), text };
+    }
+    parseLiteral() {
+        const start = this.pos;
+        for (const [word, type] of [
+            ['true', 'boolean'],
+            ['false', 'boolean'],
+            ['null', 'null'],
+        ]) {
+            if (this.source.startsWith(word, this.pos)) {
+                this.pos += word.length;
+                return this.makeNode(type, start, this.pos);
+            }
+        }
+        throw this.err('Unexpected token');
+    }
+    parseNumber() {
+        const start = this.pos;
+        if (this.peek() === '-')
+            this.pos++;
+        while (this.pos < this.source.length && /[0-9]/.test(this.source[this.pos]))
+            this.pos++;
+        if (this.peek() === '.') {
+            this.pos++;
+            while (this.pos < this.source.length && /[0-9]/.test(this.source[this.pos]))
+                this.pos++;
+        }
+        if (this.peek() === 'e' || this.peek() === 'E') {
+            this.pos++;
+            if (this.peek() === '+' || this.peek() === '-')
+                this.pos++;
+            while (this.pos < this.source.length && /[0-9]/.test(this.source[this.pos]))
+                this.pos++;
+        }
+        if (this.pos === start || (this.pos === start + 1 && this.source[start] === '-')) {
+            throw this.err('Invalid number', start);
+        }
+        return this.makeNode('number', start, this.pos);
+    }
+}
+// ---------------------------------------------------------------------------
+// Synchronous parse entry point (shared by the adapter and the sync bridge)
+// ---------------------------------------------------------------------------
+/**
+ * Position-preserving parse of a JSON document. Returns the root node and any
+ * parse errors. A document that fails to parse still yields a synthetic `error`
+ * root covering the whole file, so a consumer can always continue. Exported so
+ * `adapterBridge` (the legacy synchronous facade) can parse `.json` correctly
+ * instead of falling through to the tree-sitter TypeScript grammar.
+ *
+ * @param source The JSON source text to parse.
+ * @returns The root node and any parse errors.
+ */
+export function parseJsonSource(source) {
+    const parser = new JsonValueParser(source);
+    try {
+        return { root: parser.parse(), errors: [] };
+    }
+    catch (err) {
+        if (err instanceof JsonParseError) {
+            return {
+                root: {
+                    type: 'error',
+                    range: [0, source.length],
+                    location: {
+                        start: { line: 1, column: 1 },
+                        end: { line: 1, column: source.length + 1 },
+                    },
+                },
+                errors: [{ message: err.message, location: err.location, severity: 'error' }],
+            };
+        }
+        throw err;
+    }
+}
+// ---------------------------------------------------------------------------
+// Adapter
+// ---------------------------------------------------------------------------
+/**
+ * Depth-first node/pattern matcher. Extracted from `JsonAdapter.matches` so the
+ * adapter stays under the class-size method ceiling; `findNodes` passes a
+ * `getName` callback (bound to `getNodeName`) rather than `this`.
+ */
+function matchesNodePattern(node, pattern, getName) {
+    if (pattern.type !== undefined) {
+        const types = Array.isArray(pattern.type) ? pattern.type : [pattern.type];
+        if (!types.includes(node.type))
+            return false;
+    }
+    if (pattern.name !== undefined) {
+        const name = getName(node);
+        if (typeof pattern.name === 'string') {
+            if (name !== pattern.name)
+                return false;
+        }
+        else if (pattern.name instanceof RegExp) {
+            if (name === null || !pattern.name.test(name))
+                return false;
+        }
+    }
+    if (pattern.hasChild !== undefined) {
+        if (!(node.children ?? []).some((c) => matchesNodePattern(c, pattern.hasChild, getName)))
+            return false;
+    }
+    if (pattern.hasParent !== undefined) {
+        if (!node.parent || !matchesNodePattern(node.parent, pattern.hasParent, getName))
+            return false;
+    }
+    if (pattern.custom !== undefined) {
+        if (!pattern.custom(node))
+            return false;
+    }
+    return true;
+}
+/**
+ * JSON adapter. Every program-construct method is a stub: JSON is data, not
+ * code. The one real method is {@link parse}, which produces a positioned
+ * value tree so the `schema-json` producer can read a schema object's fields
+ * with their real line/column.
+ */
+export class JsonAdapter {
+    name = 'json';
+    fileExtensions = ['.json'];
+    /**
+     * Whether this adapter handles the given file path.
+     * @param filePath The path to check.
+     * @returns True when the path ends in `.json`.
+     */
+    supportsFile(filePath) {
+        return filePath.toLowerCase().endsWith('.json');
+    }
+    /**
+     * Parse a JSON file's content into a positioned AST.
+     * @param filePath The path of the file being parsed.
+     * @param content The JSON source text.
+     * @returns A positioned AST with language, path, and parse errors.
+     */
+    async parse(filePath, content) {
+        const { root, errors } = parseJsonSource(content);
+        return {
+            root,
+            language: 'json',
+            filePath,
+            errors,
+            dispose: () => { },
+        };
+    }
+    // -- AST navigation -------------------------------------------------------
+    /**
+     * Find every node matching a pattern via a depth-first traversal.
+     * @param ast The AST to search.
+     * @param pattern The node pattern to match against.
+     * @returns The list of matching nodes.
+     */
+    findNodes(ast, pattern) {
+        const results = [];
+        const visit = (node) => {
+            if (matchesNodePattern(node, pattern, (n) => this.getNodeName(n)))
+                results.push(node);
+            if (node.children)
+                for (const child of node.children)
+                    visit(child);
+        };
+        visit(ast.root);
+        return results;
+    }
+    /**
+     * Return the parent of a node, or null when it has none.
+     * @param node The node to inspect.
+     * @returns The parent node, or null.
+     */
+    getParent(node) {
+        return node.parent ?? null;
+    }
+    /**
+     * Return the children of a node.
+     * @param node The node to inspect.
+     * @returns The node's children, or an empty array.
+     */
+    getChildren(node) {
+        return node.children ?? [];
+    }
+    // -- Node information -----------------------------------------------------
+    /**
+     * Return the type of a node.
+     * @param node The node to inspect.
+     * @returns The node's type.
+     */
+    getNodeType(node) {
+        return node.type;
+    }
+    /**
+     * Return the source text covered by a node's range.
+     * @param node The node to read.
+     * @param sourceCode The full source text the node came from.
+     * @returns The source slice covered by the node.
+     */
+    getNodeText(node, sourceCode) {
+        return sourceCode.slice(node.range[0], node.range[1]);
+    }
+    /**
+     * Return the object key a node's value was stored under, when any.
+     * @param node The node to inspect.
+     * @returns The associated key, or null.
+     */
+    getNodeName(node) {
+        return keyMap.get(node) ?? null;
+    }
+    // -- Extraction (JSON has no code constructs) -----------------------------
+    /**
+     * JSON has no functions, so this always returns an empty list.
+     * @param _ast The (unused) AST.
+     * @returns An empty list.
+     */
+    extractFunctions(_ast) { return []; }
+    /**
+     * JSON has no classes, so this always returns an empty list.
+     * @param _ast The (unused) AST.
+     * @returns An empty list.
+     */
+    extractClasses(_ast) { return []; }
+    /**
+     * JSON has no imports, so this always returns an empty list.
+     * @param _ast The (unused) AST.
+     * @returns An empty list.
+     */
+    extractImports(_ast) { return []; }
+    /**
+     * JSON has no exports, so this always returns an empty list.
+     * @param _ast The (unused) AST.
+     * @returns An empty list.
+     */
+    extractExports(_ast) { return []; }
+    /**
+     * JSON has no interfaces, so this always returns an empty list.
+     * @param _ast The (unused) AST.
+     * @returns An empty list.
+     */
+    extractInterfaces(_ast) { return []; }
+    // -- Predicates (JSON has none of these) ----------------------------------
+    /**
+     * JSON has no classes, so this always returns false.
+     * @param _node The (unused) node.
+     * @returns Always false.
+     */
+    isClass(_node) { return false; }
+    /**
+     * JSON has no functions, so this always returns false.
+     * @param _node The (unused) node.
+     * @returns Always false.
+     */
+    isFunction(_node) { return false; }
+    /**
+     * JSON has no methods, so this always returns false.
+     * @param _node The (unused) node.
+     * @returns Always false.
+     */
+    isMethod(_node) { return false; }
+    /**
+     * JSON has no loops, so this always returns false.
+     * @param _node The (unused) node.
+     * @returns Always false.
+     */
+    isLoop(_node) { return false; }
+    /**
+     * JSON has no variable declarations, so this always returns false.
+     * @param _node The (unused) node.
+     * @returns Always false.
+     */
+    isVariableDeclaration(_node) { return false; }
+    // -- Advanced -------------------------------------------------------------
+    /**
+     * JSON nodes carry no documentation, so this always returns null.
+     * @param _node The (unused) node.
+     * @returns Always null.
+     */
+    getDocumentation(_node) { return null; }
+    /**
+     * JSON nodes have no complexity, so this always returns zero.
+     * @param _node The (unused) node.
+     * @returns Always zero.
+     */
+    getComplexity(_node) { return 0; }
+}
+//# sourceMappingURL=JsonAdapter.js.map

package/dist/languages/json/JsonAdapter.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"JsonAdapter.js","sourceRoot":"","sources":["../../../src/languages/json/JsonAdapter.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;;;;;;GA2BG;AAeH,8EAA8E;AAC9E,gFAAgF;AAChF,8EAA8E;AAE9E,uEAAuE;AACvE,MAAM,MAAM,GAAG,IAAI,OAAO,EAAmB,CAAC;AAE9C,8EAA8E;AAC9E,kCAAkC;AAClC,8EAA8E;AAE9E,2DAA2D;AAC3D,SAAS,eAAe,CAAC,MAAc;IACrC,MAAM,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC;IACnB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,MAAM,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QACvC,IAAI,MAAM,CAAC,CAAC,CAAC,KAAK,IAAI;YAAE,MAAM,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;IAC7C,CAAC;IACD,OAAO,MAAM,CAAC;AAChB,CAAC;AAED,iFAAiF;AACjF,SAAS,WAAW,CAAC,MAAgB,EAAE,MAAc;IACnD,IAAI,EAAE,GAAG,CAAC,CAAC;IACX,IAAI,EAAE,GAAG,MAAM,CAAC,MAAM,GAAG,CAAC,CAAC;IAC3B,OAAO,EAAE,GAAG,EAAE,EAAE,CAAC;QACf,MAAM,GAAG,GAAG,CAAC,EAAE,GAAG,EAAE,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC;QAC/B,IAAI,MAAM,CAAC,GAAG,CAAC,IAAI,MAAM;YAAE,EAAE,GAAG,GAAG,CAAC;;YAC/B,EAAE,GAAG,GAAG,GAAG,CAAC,CAAC;IACpB,CAAC;IACD,OAAO,EAAE,IAAI,EAAE,EAAE,GAAG,CAAC,EAAE,MAAM,EAAE,MAAM,GAAG,MAAM,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC;AAC3D,CAAC;AAED,MAAM,cAAe,SAAQ,KAAK;IACvB,QAAQ,CAAiB;IAClC,YAAY,OAAe,EAAE,QAAwB;QACnD,KAAK,CAAC,OAAO,CAAC,CAAC;QACf,IAAI,CAAC,QAAQ,GAAG,QAAQ,CAAC;IAC3B,CAAC;CACF;AAED,MAAM,eAAe;IAIU;IAHZ,MAAM,CAAW;IAC1B,GAAG,GAAG,CAAC,CAAC;IAEhB,YAA6B,MAAc;QAAd,WAAM,GAAN,MAAM,CAAQ;QACzC,IAAI,CAAC,MAAM,GAAG,eAAe,CAAC,MAAM,CAAC,CAAC;IACxC,CAAC;IAED,6DAA6D;IAC7D,KAAK;QACH,MAAM,IAAI,GAAG,IAAI,CAAC,UAAU,EAAE,CAAC;QAC/B,IAAI,CAAC,MAAM,EAAE,CAAC;QACd,IAAI,IAAI,CAAC,GAAG,KAAK,IAAI,CAAC,MAAM,CAAC,MAAM,EAAE,CAAC;YACpC,MAAM,IAAI,CAAC,GAAG,CAAC,mCAAmC,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC;QAChE,CAAC;QACD,OAAO,IAAI,CAAC;IACd,CAAC;IAED,8EAA8E;IAEtE,MAAM;QACZ,OAAO,IAAI,CAAC,GAAG,GAAG,IAAI,CAAC,MAAM,CAAC,MAAM,IAAI,IAAI,CAAC,YAAY,CAAC,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;YAAE,IAAI,CAAC,GAAG,EAAE,CAAC;IAC/F,CAAC;IAEO,YAAY,CAAC,EAAU;QAC7B,OAAO,EAAE,KAAK,GAAG,IAAI,EAAE,KAAK,IAAI,IAAI,EAAE,KAAK,IAAI,IAAI,EAAE,KAAK,IAAI,CAAC;IACjE,CAAC;IAEO,IAAI;QACV,OAAO,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,GAAG,CAAC,IAAI,EAAE,CAAC;IACrC,CAAC;IAEO,GAAG,CAAC,OAAe,EAAE,EAAW;QACtC,MAAM,MAAM,GAAG,EAAE,IAAI,IAAI,CAAC,GAAG,CAAC;QAC9B,MAAM,KAAK,GAAG,MAAM,CAAC;QACrB,MAAM,GAAG,GAAG,IAAI,CAAC,GAAG,CAAC,MAAM,GAAG,CAAC,EAAE,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC;QACrD,OAAO,IAAI,cAAc,CAAC,OAAO,EAAE;YACjC,KAAK,EAAE,WAAW,CAAC,IAAI,CAAC,MAAM,EAAE,KAAK,CAAC;YACtC,GAAG,EAAE,WAAW,CAAC,IAAI,CAAC,MAAM,EAAE,GAAG,CAAC;SACnC,CAAC,CAAC;IACL,CAAC;IAEO,QAAQ,CAAC,IAAY,EAAE,KAAa,EAAE,GAAW,EAAE,QAAoB;QAC7E,MAAM,IAAI,GAAY;YACpB,IAAI;YACJ,KAAK,EAAE,CAAC,KAAK,EAAE,GAAG,CAAC;YACnB,QAAQ,EAAE;gBACR,KAAK,EAAE,WAAW,CAAC,IAAI,CAAC,MAAM,EAAE,KAAK,CAAC;gBACtC,GAAG,EAAE,WAAW,CAAC,IAAI,CAAC,MAAM,EAAE,GAAG,CAAC;aACnC;SACF,CAAC;QACF,IAAI,QAAQ,IAAI,QAAQ,CAAC,MAAM,GAAG,CAAC;YAAE,IAAI,CAAC,QAAQ,GAAG,QAAQ,CAAC;QAC9D,OAAO,IAAI,CAAC;IACd,CAAC;IAED,+EAA+E;IAEvE,UAAU;QAChB,IAAI,CAAC,MAAM,EAAE,CAAC;QACd,MAAM,EAAE,GAAG,IAAI,CAAC,IAAI,EAAE,CAAC;QACvB,QAAQ,EAAE,EAAE,CAAC;YACX,KAAK,GAAG,CAAC,CAAC,OAAO,IAAI,CAAC,WAAW,EAAE,CAAC;YACpC,KAAK,GAAG,CAAC,CAAC,OAAO,IAAI,CAAC,UAAU,EAAE,CAAC;YACnC,KAAK,GAAG,CAAC,CAAC,OAAO,IAAI,CAAC,gBAAgB,EAAE,CAAC,IAAI,CAAC;YAC9C,KAAK,GAAG,CAAC;YACT,KAAK,GAAG,CAAC;YACT,KAAK,GAAG;gBACN,OAAO,IAAI,CAAC,YAAY,EAAE,CAAC;YAC7B;gBACE,OAAO,IAAI,CAAC,WAAW,EAAE,CAAC;QAC9B,CAAC;IACH,CAAC;IAEO,WAAW;QACjB,MAAM,KAAK,GAAG,IAAI,CAAC,GAAG,CAAC;QACvB,IAAI,CAAC,GAAG,EAAE,CAAC,CAAC,cAAc;QAC1B,MAAM,QAAQ,GAAc,EAAE,CAAC;QAC/B,IAAI,CAAC,MAAM,EAAE,CAAC;QACd,IAAI,IAAI,CAAC,IAAI,EAAE,KAAK,GAAG,EAAE,CAAC;YACxB,IAAI,CAAC,GAAG,EAAE,CAAC;YACX,OAAO,IAAI,CAAC,QAAQ,CAAC,QAAQ,EAAE,KAAK,EAAE,IAAI,CAAC,GAAG,EAAE,QAAQ,CAAC,CAAC;QAC5D,CAAC;QACD,SAAS,CAAC;YACR,IAAI,CAAC,MAAM,EAAE,CAAC;YACd,IAAI,IAAI,CAAC,IAAI,EAAE,KAAK,GAAG;gBAAE,MAAM,IAAI,CAAC,GAAG,CAAC,4BAA4B,CAAC,CAAC;YACtE,MAAM,GAAG,GAAG,IAAI,CAAC,gBAAgB,EAAE,CAAC;YACpC,IAAI,CAAC,MAAM,EAAE,CAAC;YACd,IAAI,IAAI,CAAC,IAAI,EAAE,KAAK,GAAG;gBAAE,MAAM,IAAI,CAAC,GAAG,CAAC,+BAA+B,CAAC,CAAC;YACzE,IAAI,CAAC,GAAG,EAAE,CAAC,CAAC,cAAc;YAC1B,MAAM,KAAK,GAAG,IAAI,CAAC,UAAU,EAAE,CAAC;YAChC,MAAM,CAAC,GAAG,CAAC,KAAK,EAAE,GAAG,CAAC,IAAI,CAAC,CAAC;YAC5B,QAAQ,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;YACrB,IAAI,CAAC,MAAM,EAAE,CAAC;YACd,MAAM,GAAG,GAAG,IAAI,CAAC,IAAI,EAAE,CAAC;YACxB,IAAI,GAAG,KAAK,GAAG,EAAE,CAAC;gBAAC,IAAI,CAAC,GAAG,EAAE,CAAC;gBAAC,SAAS;YAAC,CAAC;YAC1C,IAAI,GAAG,KAAK,GAAG,EAAE,CAAC;gBAAC,IAAI,CAAC,GAAG,EAAE,CAAC;gBAAC,MAAM;YAAC,CAAC;YACvC,MAAM,IAAI,CAAC,GAAG,CAAC,+BAA+B,CAAC,CAAC;QAClD,CAAC;QACD,OAAO,IAAI,CAAC,QAAQ,CAAC,QAAQ,EAAE,KAAK,EAAE,IAAI,CAAC,GAAG,EAAE,QAAQ,CAAC,CAAC;IAC5D,CAAC;IAEO,UAAU;QAChB,MAAM,KAAK,GAAG,IAAI,CAAC,GAAG,CAAC;QACvB,IAAI,CAAC,GAAG,EAAE,CAAC,CAAC,cAAc;QAC1B,MAAM,QAAQ,GAAc,EAAE,CAAC;QAC/B,IAAI,CAAC,MAAM,EAAE,CAAC;QACd,IAAI,IAAI,CAAC,IAAI,EAAE,KAAK,GAAG,EAAE,CAAC;YACxB,IAAI,CAAC,GAAG,EAAE,CAAC;YACX,OAAO,IAAI,CAAC,QAAQ,CAAC,OAAO,EAAE,KAAK,EAAE,IAAI,CAAC,GAAG,EAAE,QAAQ,CAAC,CAAC;QAC3D,CAAC;QACD,SAAS,CAAC;YACR,MAAM,KAAK,GAAG,IAAI,CAAC,UAAU,EAAE,CAAC;YAChC,QAAQ,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;YACrB,IAAI,CAAC,MAAM,EAAE,CAAC;YACd,MAAM,GAAG,GAAG,IAAI,CAAC,IAAI,EAAE,CAAC;YACxB,IAAI,GAAG,KAAK,GAAG,EAAE,CAAC;gBAAC,IAAI,CAAC,GAAG,EAAE,CAAC;gBAAC,SAAS;YAAC,CAAC;YAC1C,IAAI,GAAG,KAAK,GAAG,EAAE,CAAC;gBAAC,IAAI,CAAC,GAAG,EAAE,CAAC;gBAAC,MAAM;YAAC,CAAC;YACvC,MAAM,IAAI,CAAC,GAAG,CAAC,8BAA8B,CAAC,CAAC;QACjD,CAAC;QACD,OAAO,IAAI,CAAC,QAAQ,CAAC,OAAO,EAAE,KAAK,EAAE,IAAI,CAAC,GAAG,EAAE,QAAQ,CAAC,CAAC;IAC3D,CAAC;IAEO,gBAAgB;QACtB,MAAM,KAAK,GAAG,IAAI,CAAC,GAAG,CAAC;QACvB,IAAI,CAAC,GAAG,EAAE,CAAC,CAAC,cAAc;QAC1B,IAAI,IAAI,GAAG,EAAE,CAAC;QACd,SAAS,CAAC;YACR,IAAI,IAAI,CAAC,GAAG,IAAI,IAAI,CAAC,MAAM,CAAC,MAAM;gBAAE,MAAM,IAAI,CAAC,GAAG,CAAC,qBAAqB,EAAE,KAAK,CAAC,CAAC;YACjF,MAAM,EAAE,GAAG,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;YACjC,IAAI,EAAE,KAAK,GAAG,EAAE,CAAC;gBACf,IAAI,CAAC,GAAG,EAAE,CAAC;gBACX,MAAM;YACR,CAAC;YACD,IAAI,EAAE,KAAK,IAAI,EAAE,CAAC;gBAChB,MAAM,GAAG,GAAG,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,GAAG,GAAG,CAAC,CAAC,CAAC;gBACtC,QAAQ,GAAG,EAAE,CAAC;oBACZ,KAAK,GAAG;wBAAE,IAAI,IAAI,GAAG,CAAC;wBAAC,MAAM;oBAC7B,KAAK,IAAI;wBAAE,IAAI,IAAI,IAAI,CAAC;wBAAC,MAAM;oBAC/B,KAAK,GAAG;wBAAE,IAAI,IAAI,GAAG,CAAC;wBAAC,MAAM;oBAC7B,KAAK,GAAG;wBAAE,IAAI,IAAI,IAAI,CAAC;wBAAC,MAAM;oBAC9B,KAAK,GAAG;wBAAE,IAAI,IAAI,IAAI,CAAC;wBAAC,MAAM;oBAC9B,KAAK,GAAG;wBAAE,IAAI,IAAI,IAAI,CAAC;wBAAC,MAAM;oBAC9B,KAAK,GAAG;wBAAE,IAAI,IAAI,IAAI,CAAC;wBAAC,MAAM;oBAC9B,KAAK,GAAG;wBAAE,IAAI,IAAI,IAAI,CAAC;wBAAC,MAAM;oBAC9B,KAAK,GAAG,CAAC,CAAC,CAAC;wBACT,MAAM,GAAG,GAAG,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,IAAI,CAAC,GAAG,GAAG,CAAC,EAAE,IAAI,CAAC,GAAG,GAAG,CAAC,CAAC,CAAC;wBAC1D,IAAI,IAAI,MAAM,CAAC,YAAY,CAAC,QAAQ,CAAC,GAAG,EAAE,EAAE,CAAC,CAAC,CAAC;wBAC/C,IAAI,CAAC,GAAG,IAAI,CAAC,CAAC;wBACd,MAAM;oBACR,CAAC;oBACD;wBACE,MAAM,IAAI,CAAC,GAAG,CAAC,qBAAqB,GAAG,GAAG,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC;gBAC1D,CAAC;gBACD,IAAI,CAAC,GAAG,IAAI,CAAC,CAAC;gBACd,SAAS;YACX,CAAC;YACD,IAAI,IAAI,EAAE,CAAC;YACX,IAAI,CAAC,GAAG,EAAE,CAAC;QACb,CAAC;QACD,OAAO,EAAE,IAAI,EAAE,IAAI,CAAC,QAAQ,CAAC,QAAQ,EAAE,KAAK,EAAE,IAAI,CAAC,GAAG,CAAC,EAAE,IAAI,EAAE,CAAC;IAClE,CAAC;IAEO,YAAY;QAClB,MAAM,KAAK,GAAG,IAAI,CAAC,GAAG,CAAC;QACvB,KAAK,MAAM,CAAC,IAAI,EAAE,IAAI,CAAC,IAAI;YACzB,CAAC,MAAM,EAAE,SAAS,CAAC;YACnB,CAAC,OAAO,EAAE,SAAS,CAAC;YACpB,CAAC,MAAM,EAAE,MAAM,CAAC;SACR,EAAE,CAAC;YACX,IAAI,IAAI,CAAC,MAAM,CAAC,UAAU,CAAC,IAAI,EAAE,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC;gBAC3C,IAAI,CAAC,GAAG,IAAI,IAAI,CAAC,MAAM,CAAC;gBACxB,OAAO,IAAI,CAAC,QAAQ,CAAC,IAAI,EAAE,KAAK,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC;YAC9C,CAAC;QACH,CAAC;QACD,MAAM,IAAI,CAAC,GAAG,CAAC,kBAAkB,CAAC,CAAC;IACrC,CAAC;IAEO,WAAW;QACjB,MAAM,KAAK,GAAG,IAAI,CAAC,GAAG,CAAC;QACvB,IAAI,IAAI,CAAC,IAAI,EAAE,KAAK,GAAG;YAAE,IAAI,CAAC,GAAG,EAAE,CAAC;QACpC,OAAO,IAAI,CAAC,GAAG,GAAG,IAAI,CAAC,MAAM,CAAC,MAAM,IAAI,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;YAAE,IAAI,CAAC,GAAG,EAAE,CAAC;QACxF,IAAI,IAAI,CAAC,IAAI,EAAE,KAAK,GAAG,EAAE,CAAC;YACxB,IAAI,CAAC,GAAG,EAAE,CAAC;YACX,OAAO,IAAI,CAAC,GAAG,GAAG,IAAI,CAAC,MAAM,CAAC,MAAM,IAAI,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;gBAAE,IAAI,CAAC,GAAG,EAAE,CAAC;QAC1F,CAAC;QACD,IAAI,IAAI,CAAC,IAAI,EAAE,KAAK,GAAG,IAAI,IAAI,CAAC,IAAI,EAAE,KAAK,GAAG,EAAE,CAAC;YAC/C,IAAI,CAAC,GAAG,EAAE,CAAC;YACX,IAAI,IAAI,CAAC,IAAI,EAAE,KAAK,GAAG,IAAI,IAAI,CAAC,IAAI,EAAE,KAAK,GAAG;gBAAE,IAAI,CAAC,GAAG,EAAE,CAAC;YAC3D,OAAO,IAAI,CAAC,GAAG,GAAG,IAAI,CAAC,MAAM,CAAC,MAAM,IAAI,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;gBAAE,IAAI,CAAC,GAAG,EAAE,CAAC;QAC1F,CAAC;QACD,IAAI,IAAI,CAAC,GAAG,KAAK,KAAK,IAAI,CAAC,IAAI,CAAC,GAAG,KAAK,KAAK,GAAG,CAAC,IAAI,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,KAAK,GAAG,CAAC,EAAE,CAAC;YACjF,MAAM,IAAI,CAAC,GAAG,CAAC,gBAAgB,EAAE,KAAK,CAAC,CAAC;QAC1C,CAAC;QACD,OAAO,IAAI,CAAC,QAAQ,CAAC,QAAQ,EAAE,KAAK,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC;IAClD,CAAC;CACF;AAED,8EAA8E;AAC9E,4EAA4E;AAC5E,8EAA8E;AAE9E;;;;;;;;;GASG;AACH,MAAM,UAAU,eAAe,CAAC,MAAc;IAC5C,MAAM,MAAM,GAAG,IAAI,eAAe,CAAC,MAAM,CAAC,CAAC;IAC3C,IAAI,CAAC;QACH,OAAO,EAAE,IAAI,EAAE,MAAM,CAAC,KAAK,EAAE,EAAE,MAAM,EAAE,EAAE,EAAE,CAAC;IAC9C,CAAC;IAAC,OAAO,GAAG,EAAE,CAAC;QACb,IAAI,GAAG,YAAY,cAAc,EAAE,CAAC;YAClC,OAAO;gBACL,IAAI,EAAE;oBACJ,IAAI,EAAE,OAAO;oBACb,KAAK,EAAE,CAAC,CAAC,EAAE,MAAM,CAAC,MAAM,CAAC;oBACzB,QAAQ,EAAE;wBACR,KAAK,EAAE,EAAE,IAAI,EAAE,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE;wBAC7B,GAAG,EAAE,EAAE,IAAI,EAAE,CAAC,EAAE,MAAM,EAAE,MAAM,CAAC,MAAM,GAAG,CAAC,EAAE;qBAC5C;iBACF;gBACD,MAAM,EAAE,CAAC,EAAE,OAAO,EAAE,GAAG,CAAC,OAAO,EAAE,QAAQ,EAAE,GAAG,CAAC,QAAQ,EAAE,QAAQ,EAAE,OAAO,EAAE,CAAC;aAC9E,CAAC;QACJ,CAAC;QACD,MAAM,GAAG,CAAC;IACZ,CAAC;AACH,CAAC;AAED,8EAA8E;AAC9E,UAAU;AACV,8EAA8E;AAE9E;;;;GAIG;AACH,SAAS,kBAAkB,CACzB,IAAa,EACb,OAAoB,EACpB,OAAsC;IAEtC,IAAI,OAAO,CAAC,IAAI,KAAK,SAAS,EAAE,CAAC;QAC/B,MAAM,KAAK,GAAG,KAAK,CAAC,OAAO,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC;QAC1E,IAAI,CAAC,KAAK,CAAC,QAAQ,CAAC,IAAI,CAAC,IAAI,CAAC;YAAE,OAAO,KAAK,CAAC;IAC/C,CAAC;IACD,IAAI,OAAO,CAAC,IAAI,KAAK,SAAS,EAAE,CAAC;QAC/B,MAAM,IAAI,GAAG,OAAO,CAAC,IAAI,CAAC,CAAC;QAC3B,IAAI,OAAO,OAAO,CAAC,IAAI,KAAK,QAAQ,EAAE,CAAC;YACrC,IAAI,IAAI,KAAK,OAAO,CAAC,IAAI;gBAAE,OAAO,KAAK,CAAC;QAC1C,CAAC;aAAM,IAAI,OAAO,CAAC,IAAI,YAAY,MAAM,EAAE,CAAC;YAC1C,IAAI,IAAI,KAAK,IAAI,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC;gBAAE,OAAO,KAAK,CAAC;QAC9D,CAAC;IACH,CAAC;IACD,IAAI,OAAO,CAAC,QAAQ,KAAK,SAAS,EAAE,CAAC;QACnC,IAAI,CAAC,CAAC,IAAI,CAAC,QAAQ,IAAI,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,kBAAkB,CAAC,CAAC,EAAE,OAAO,CAAC,QAAS,EAAE,OAAO,CAAC,CAAC;YAAE,OAAO,KAAK,CAAC;IAC1G,CAAC;IACD,IAAI,OAAO,CAAC,SAAS,KAAK,SAAS,EAAE,CAAC;QACpC,IAAI,CAAC,IAAI,CAAC,MAAM,IAAI,CAAC,kBAAkB,CAAC,IAAI,CAAC,MAAM,EAAE,OAAO,CAAC,SAAS,EAAE,OAAO,CAAC;YAAE,OAAO,KAAK,CAAC;IACjG,CAAC;IACD,IAAI,OAAO,CAAC,MAAM,KAAK,SAAS,EAAE,CAAC;QACjC,IAAI,CAAC,OAAO,CAAC,MAAM,CAAC,IAAI,CAAC;YAAE,OAAO,KAAK,CAAC;IAC1C,CAAC;IACD,OAAO,IAAI,CAAC;AACd,CAAC;AAED;;;;;GAKG;AACH,MAAM,OAAO,WAAW;IACb,IAAI,GAAG,MAAM,CAAC;IACd,cAAc,GAAG,CAAC,OAAO,CAAC,CAAC;IAEpC;;;;OAIG;IACH,YAAY,CAAC,QAAgB;QAC3B,OAAO,QAAQ,CAAC,WAAW,EAAE,CAAC,QAAQ,CAAC,OAAO,CAAC,CAAC;IAClD,CAAC;IAED;;;;;OAKG;IACH,KAAK,CAAC,KAAK,CAAC,QAAgB,EAAE,OAAe;QAC3C,MAAM,EAAE,IAAI,EAAE,MAAM,EAAE,GAAG,eAAe,CAAC,OAAO,CAAC,CAAC;QAClD,OAAO;YACL,IAAI;YACJ,QAAQ,EAAE,MAAM;YAChB,QAAQ;YACR,MAAM;YACN,OAAO,EAAE,GAAG,EAAE,GAAE,CAAC;SAClB,CAAC;IACJ,CAAC;IAED,4EAA4E;IAE5E;;;;;OAKG;IACH,SAAS,CAAC,GAAQ,EAAE,OAAoB;QACtC,MAAM,OAAO,GAAc,EAAE,CAAC;QAC9B,MAAM,KAAK,GAAG,CAAC,IAAa,EAAE,EAAE;YAC9B,IAAI,kBAAkB,CAAC,IAAI,EAAE,OAAO,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,IAAI,CAAC,WAAW,CAAC,CAAC,CAAC,CAAC;gBAAE,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YACtF,IAAI,IAAI,CAAC,QAAQ;gBAAE,KAAK,MAAM,KAAK,IAAI,IAAI,CAAC,QAAQ;oBAAE,KAAK,CAAC,KAAK,CAAC,CAAC;QACrE,CAAC,CAAC;QACF,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;QAChB,OAAO,OAAO,CAAC;IACjB,CAAC;IAED;;;;OAIG;IACH,SAAS,CAAC,IAAa;QACrB,OAAO,IAAI,CAAC,MAAM,IAAI,IAAI,CAAC;IAC7B,CAAC;IAED;;;;OAIG;IACH,WAAW,CAAC,IAAa;QACvB,OAAO,IAAI,CAAC,QAAQ,IAAI,EAAE,CAAC;IAC7B,CAAC;IAED,4EAA4E;IAE5E;;;;OAIG;IACH,WAAW,CAAC,IAAa;QACvB,OAAO,IAAI,CAAC,IAAI,CAAC;IACnB,CAAC;IAED;;;;;OAKG;IACH,WAAW,CAAC,IAAa,EAAE,UAAkB;QAC3C,OAAO,UAAU,CAAC,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC;IACxD,CAAC;IAED;;;;OAIG;IACH,WAAW,CAAC,IAAa;QACvB,OAAO,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,IAAI,CAAC;IAClC,CAAC;IAED,4EAA4E;IAE5E;;;;OAIG;IACH,gBAAgB,CAAC,IAAS,IAAoB,OAAO,EAAE,CAAC,CAAC,CAAC;IAC1D;;;;OAIG;IACH,cAAc,CAAC,IAAS,IAAiB,OAAO,EAAE,CAAC,CAAC,CAAC;IACrD;;;;OAIG;IACH,cAAc,CAAC,IAAS,IAAkB,OAAO,EAAE,CAAC,CAAC,CAAC;IACtD;;;;OAIG;IACH,cAAc,CAAC,IAAS,IAAkB,OAAO,EAAE,CAAC,CAAC,CAAC;IACtD;;;;OAIG;IACH,iBAAiB,CAAC,IAAS,IAAqB,OAAO,EAAE,CAAC,CAAC,CAAC;IAE5D,4EAA4E;IAE5E;;;;OAIG;IACH,OAAO,CAAC,KAAc,IAAa,OAAO,KAAK,CAAC,CAAC,CAAC;IAClD;;;;OAIG;IACH,UAAU,CAAC,KAAc,IAAa,OAAO,KAAK,CAAC,CAAC,CAAC;IACrD;;;;OAIG;IACH,QAAQ,CAAC,KAAc,IAAa,OAAO,KAAK,CAAC,CAAC,CAAC;IACnD;;;;OAIG;IACH,MAAM,CAAC,KAAc,IAAa,OAAO,KAAK,CAAC,CAAC,CAAC;IACjD;;;;OAIG;IACH,qBAAqB,CAAC,KAAc,IAAa,OAAO,KAAK,CAAC,CAAC,CAAC;IAEhE,4EAA4E;IAE5E;;;;OAIG;IACH,gBAAgB,CAAC,KAAc,IAAmB,OAAO,IAAI,CAAC,CAAC,CAAC;IAChE;;;;OAIG;IACH,aAAa,CAAC,KAAc,IAAY,OAAO,CAAC,CAAC,CAAC,CAAC;CACpD"}

package/dist/languages/locationIndex.d.ts

@@ -0,0 +1,41 @@
+/**
+ * Per-file AST location index — replaces the per-block BFS `findNodeByLocation`.
+ *
+ * The legacy `findNodeByLocation` ran a fresh breadth-first search from the file
+ * root for every symbol it resolved (one BFS per class method, function, or
+ * block). Each BFS is O(n), and running one per symbol makes the aggregate
+ * O(blocks × n²). This module builds a single `line:column` → node index per
+ * file (one O(n) index-pointer BFS, first-wins to preserve the BFS "shallowest
+ * match" semantics) and memoizes it per root via a WeakMap, turning every lookup
+ * into an O(1) map read.
+ *
+ * `skipRoot` reproduces the one deliberate divergence among the legacy copies:
+ * the DRY analyzer and the code-block producer start their search from
+ * `root.children`, never the root itself, because the whole-file wrapper
+ * (`program`/`source_file`) shares its start position with its first top-level
+ * child and returning the wrapper broke `deduplicateBlocks`. Every other call
+ * site searched from the root, so the root wins the collision there.
+ */
+import type { ASTNode } from './types.js';
+/** The `line:column` key a node's start position maps to. */
+export declare function locationKey(location: {
+    line: number;
+    column: number;
+}): string;
+/** Build (and memoize per root) the `line:column` → node index, in the same
+ *  first-wins BFS order the legacy search returned nodes in.
+ *  @param root The file's root node, the BFS start.
+ *  @param skipRoot When true the root wrapper is excluded, so its first
+ *  top-level child wins the shared start position.
+ *  @returns The `line:column` → node map, cached per root. */
+export declare function buildLocationIndex(root: ASTNode, skipRoot?: boolean): Map<string, ASTNode>;
+/** Look up the node whose start position matches `location`.
+ *  @param root The file's root node, the index root.
+ *  @param location The `line`/`column` start position to resolve.
+ *  @param skipRoot When true the root wrapper is excluded from the index.
+ *  @returns The node whose start position matches, or null when absent. */
+export declare function findNodeByLocation(root: ASTNode, location: {
+    line: number;
+    column: number;
+}, skipRoot?: boolean): ASTNode | null;
+//# sourceMappingURL=locationIndex.d.ts.map

package/dist/languages/locationIndex.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"locationIndex.d.ts","sourceRoot":"","sources":["../../src/languages/locationIndex.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;GAiBG;AACH,OAAO,KAAK,EAAE,OAAO,EAAE,MAAM,YAAY,CAAC;AAE1C,6DAA6D;AAC7D,wBAAgB,WAAW,CAAC,QAAQ,EAAE;IAAE,IAAI,EAAE,MAAM,CAAC;IAAC,MAAM,EAAE,MAAM,CAAA;CAAE,GAAG,MAAM,CAE9E;AAKD;;;;;8DAK8D;AAC9D,wBAAgB,kBAAkB,CAAC,IAAI,EAAE,OAAO,EAAE,QAAQ,UAAQ,GAAG,GAAG,CAAC,MAAM,EAAE,OAAO,CAAC,CAkBxF;AAED;;;;2EAI2E;AAC3E,wBAAgB,kBAAkB,CAChC,IAAI,EAAE,OAAO,EACb,QAAQ,EAAE;IAAE,IAAI,EAAE,MAAM,CAAC;IAAC,MAAM,EAAE,MAAM,CAAA;CAAE,EAC1C,QAAQ,UAAQ,GACf,OAAO,GAAG,IAAI,CAEhB"}

package/dist/languages/locationIndex.js

@@ -0,0 +1,42 @@
+/** The `line:column` key a node's start position maps to. */
+export function locationKey(location) {
+    return `${location.line}:${location.column}`;
+}
+const rootIndexCache = new WeakMap();
+const childIndexCache = new WeakMap();
+/** Build (and memoize per root) the `line:column` → node index, in the same
+ *  first-wins BFS order the legacy search returned nodes in.
+ *  @param root The file's root node, the BFS start.
+ *  @param skipRoot When true the root wrapper is excluded, so its first
+ *  top-level child wins the shared start position.
+ *  @returns The `line:column` → node map, cached per root. */
+export function buildLocationIndex(root, skipRoot = false) {
+    const cache = skipRoot ? childIndexCache : rootIndexCache;
+    const cached = cache.get(root);
+    if (cached)
+        return cached;
+    const index = new Map();
+    const queue = skipRoot ? [...(root.children ?? [])] : [root];
+    let head = 0;
+    while (head < queue.length) {
+        const node = queue[head++];
+        const key = locationKey(node.location.start);
+        if (!index.has(key))
+            index.set(key, node);
+        if (node.children) {
+            for (const child of node.children)
+                queue.push(child);
+        }
+    }
+    cache.set(root, index);
+    return index;
+}
+/** Look up the node whose start position matches `location`.
+ *  @param root The file's root node, the index root.
+ *  @param location The `line`/`column` start position to resolve.
+ *  @param skipRoot When true the root wrapper is excluded from the index.
+ *  @returns The node whose start position matches, or null when absent. */
+export function findNodeByLocation(root, location, skipRoot = false) {
+    return buildLocationIndex(root, skipRoot).get(locationKey(location)) ?? null;
+}
+//# sourceMappingURL=locationIndex.js.map

package/dist/languages/locationIndex.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"locationIndex.js","sourceRoot":"","sources":["../../src/languages/locationIndex.ts"],"names":[],"mappings":"AAoBA,6DAA6D;AAC7D,MAAM,UAAU,WAAW,CAAC,QAA0C;IACpE,OAAO,GAAG,QAAQ,CAAC,IAAI,IAAI,QAAQ,CAAC,MAAM,EAAE,CAAC;AAC/C,CAAC;AAED,MAAM,cAAc,GAAG,IAAI,OAAO,EAAiC,CAAC;AACpE,MAAM,eAAe,GAAG,IAAI,OAAO,EAAiC,CAAC;AAErE;;;;;8DAK8D;AAC9D,MAAM,UAAU,kBAAkB,CAAC,IAAa,EAAE,QAAQ,GAAG,KAAK;IAChE,MAAM,KAAK,GAAG,QAAQ,CAAC,CAAC,CAAC,eAAe,CAAC,CAAC,CAAC,cAAc,CAAC;IAC1D,MAAM,MAAM,GAAG,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;IAC/B,IAAI,MAAM;QAAE,OAAO,MAAM,CAAC;IAE1B,MAAM,KAAK,GAAG,IAAI,GAAG,EAAmB,CAAC;IACzC,MAAM,KAAK,GAAc,QAAQ,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,IAAI,CAAC,QAAQ,IAAI,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;IACxE,IAAI,IAAI,GAAG,CAAC,CAAC;IACb,OAAO,IAAI,GAAG,KAAK,CAAC,MAAM,EAAE,CAAC;QAC3B,MAAM,IAAI,GAAG,KAAK,CAAC,IAAI,EAAE,CAAC,CAAC;QAC3B,MAAM,GAAG,GAAG,WAAW,CAAC,IAAI,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC;QAC7C,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,GAAG,CAAC;YAAE,KAAK,CAAC,GAAG,CAAC,GAAG,EAAE,IAAI,CAAC,CAAC;QAC1C,IAAI,IAAI,CAAC,QAAQ,EAAE,CAAC;YAClB,KAAK,MAAM,KAAK,IAAI,IAAI,CAAC,QAAQ;gBAAE,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QACvD,CAAC;IACH,CAAC;IACD,KAAK,CAAC,GAAG,CAAC,IAAI,EAAE,KAAK,CAAC,CAAC;IACvB,OAAO,KAAK,CAAC;AACf,CAAC;AAED;;;;2EAI2E;AAC3E,MAAM,UAAU,kBAAkB,CAChC,IAAa,EACb,QAA0C,EAC1C,QAAQ,GAAG,KAAK;IAEhB,OAAO,kBAAkB,CAAC,IAAI,EAAE,QAAQ,CAAC,CAAC,GAAG,CAAC,WAAW,CAAC,QAAQ,CAAC,CAAC,IAAI,IAAI,CAAC;AAC/E,CAAC"}