clast-ai 0.1.2 → 0.2.0

package/dist/query/arity.js

@@ -0,0 +1,187 @@
+/** Languages whose signatures are checked. Others (PHP, Ruby, JavaScript, Swift, Dart) accept any count. */
+export const ARITY_LANGS = new Set(['java', 'csharp', 'go', 'c', 'cpp', 'typescript', 'tsx', 'python', 'rust']);
+function escapeRe(s) {
+    return s.replace(/[.*+?^${}()|[\]\\]/g, '\\$&');
+}
+/** Index of the `)` matching the `(` at `open`, or -1. Skips string literals. */
+function closing(sig, open) {
+    let depth = 0;
+    for (let i = open; i < sig.length; i++) {
+        const ch = sig[i];
+        if (ch === '"' || ch === "'" || ch === '`') {
+            const end = sig.indexOf(ch, i + 1);
+            if (end === -1)
+                return -1;
+            i = end;
+        }
+        else if (ch === '(')
+            depth++;
+        else if (ch === ')' && --depth === 0)
+            return i;
+    }
+    return -1;
+}
+/** Split a parameter list on top-level commas. */
+function splitParams(list) {
+    const out = [];
+    let depth = 0;
+    let start = 0;
+    for (let i = 0; i < list.length; i++) {
+        const ch = list[i];
+        if (ch === '"' || ch === "'" || ch === '`') {
+            const end = list.indexOf(ch, i + 1);
+            if (end === -1)
+                break;
+            i = end;
+        }
+        else if (ch === '(' || ch === '[' || ch === '{' || ch === '<')
+            depth++;
+        else if (ch === ')' || ch === ']' || ch === '}')
+            depth--;
+        else if (ch === '>') {
+            // Not the arrow of `=>` / `->`.
+            const prev = list[i - 1];
+            if (prev !== '=' && prev !== '-')
+                depth--;
+        }
+        else if (ch === ',' && depth <= 0) {
+            out.push(list.slice(start, i));
+            start = i + 1;
+            depth = 0;
+        }
+    }
+    out.push(list.slice(start));
+    return out.map(p => p.trim()).filter(Boolean);
+}
+/** True when the parameter has a default value (`x = 1`, `x: int = 1`) at its top level. */
+function hasDefault(param) {
+    let depth = 0;
+    for (let i = 0; i < param.length; i++) {
+        const ch = param[i];
+        if (ch === '(' || ch === '[' || ch === '{' || ch === '<')
+            depth++;
+        else if (ch === ')' || ch === ']' || ch === '}' || (ch === '>' && param[i - 1] !== '=' && param[i - 1] !== '-'))
+            depth--;
+        else if (ch === '=' && depth <= 0) {
+            const next = param[i + 1];
+            const prev = param[i - 1];
+            if (next !== '=' && next !== '>' && prev !== '=' && prev !== '!' && prev !== '<' && prev !== '>')
+                return true;
+        }
+    }
+    return false;
+}
+export function paramRange(signature, name, lang) {
+    if (!ARITY_LANGS.has(lang) || !signature || !name)
+        return null;
+    let sig = signature;
+    if (lang === 'go') {
+        // func (r *T) Name(...): skip the receiver.
+        const recv = /^func\s*\(/.exec(sig);
+        if (recv) {
+            const end = closing(sig, recv[0].length - 1);
+            if (end === -1)
+                return null;
+            sig = sig.slice(end + 1);
+        }
+    }
+    const m = new RegExp('(?:^|[^\\w$])' + escapeRe(name) + '\\s*(?=[<\\[(])').exec(sig);
+    if (!m)
+        return null;
+    let i = m.index + m[0].length;
+    // Type parameters: <T, U> or Go [T any].
+    if (sig[i] === '<' || sig[i] === '[') {
+        const open = sig[i];
+        const close = open === '<' ? '>' : ']';
+        let depth = 0;
+        for (; i < sig.length; i++) {
+            if (sig[i] === open)
+                depth++;
+            else if (sig[i] === close && sig[i - 1] !== '=' && sig[i - 1] !== '-' && --depth === 0) {
+                i++;
+                break;
+            }
+        }
+        while (sig[i] === ' ')
+            i++;
+    }
+    if (sig[i] !== '(')
+        return null;
+    const end = closing(sig, i);
+    if (end === -1)
+        return null; // truncated signature
+    let params = splitParams(sig.slice(i + 1, end));
+    if (lang === 'c' || lang === 'cpp') {
+        if (params.length === 1 && params[0] === 'void')
+            params = [];
+        // `int f()` in C says nothing about the parameters.
+        else if (params.length === 0 && lang === 'c')
+            return null;
+    }
+    if (lang === 'python') {
+        if (params.length && /^(self|cls)\b/.test(params[0]))
+            params = params.slice(1);
+    }
+    else if (lang === 'rust') {
+        if (params.length && /^(&\s*('\w+\s+)?)?(mut\s+)?self\b/.test(params[0]))
+            params = params.slice(1);
+    }
+    else if (lang === 'typescript' || lang === 'tsx') {
+        if (params.length && /^this\s*:/.test(params[0]))
+            params = params.slice(1);
+    }
+    let min = 0;
+    let max = 0;
+    let variadic = false;
+    let ext = false;
+    let voidable = false;
+    for (let k = 0; k < params.length; k++) {
+        const p = params[k];
+        if (lang === 'python') {
+            if (p === '*' || p === '/')
+                continue; // keyword-only / positional-only markers
+            if (p.startsWith('*')) {
+                variadic = true;
+                continue;
+            }
+        }
+        if (p.includes('...') || (lang === 'csharp' && /^(\[[^\]]*\]\s*)*params\s/.test(p))) {
+            variadic = true;
+            continue;
+        }
+        if (lang === 'csharp' && k === 0 && /^(\[[^\]]*\]\s*)*this\s/.test(p))
+            ext = true;
+        max++;
+        const optional = hasDefault(p) ||
+            ((lang === 'typescript' || lang === 'tsx') && /^[\w$]+\?\s*(:|$)/.test(p));
+        if (!optional) {
+            min++;
+            voidable = (lang === 'typescript' || lang === 'tsx') && /:\s*(?:[A-Z]|T[A-Z]\w*)\s*$/.test(p);
+        }
+    }
+    return { min, max: variadic ? Infinity : max, ext, voidable };
+}
+/**
+ * Can a call with `argc` arguments be a call of a function with this range?
+ * `unbound` marks calls written through a type name (`Base.save(self, x)`,
+ * `Type::method(value, x)`), which pass the receiver as an argument.
+ */
+export function arityFits(range, argc, lang, unbound) {
+    if (!range || argc < 0)
+        return true;
+    if (argc >= range.min && argc <= range.max)
+        return true;
+    // `emitter.fire()` on an Emitter<void>: a parameter of type T can be left out when T is void.
+    if (range.voidable && argc === range.min - 1)
+        return true;
+    // Extension method called as a member: the receiver fills the `this` parameter.
+    if (range.ext && argc + 1 >= range.min && argc + 1 <= range.max)
+        return true;
+    if (unbound && (lang === 'python' || lang === 'rust') && argc - 1 >= range.min && argc - 1 <= range.max)
+        return true;
+    // Go: f(g()) forwards all results of g.
+    if (lang === 'go' && argc === 1 && range.min > 1)
+        return true;
+    return false;
+}
+//# sourceMappingURL=arity.js.map

package/dist/query/arity.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"arity.js","sourceRoot":"","sources":["../../src/query/arity.ts"],"names":[],"mappings":"AAmBA,4GAA4G;AAC5G,MAAM,CAAC,MAAM,WAAW,GAAG,IAAI,GAAG,CAAC,CAAC,MAAM,EAAE,QAAQ,EAAE,IAAI,EAAE,GAAG,EAAE,KAAK,EAAE,YAAY,EAAE,KAAK,EAAE,QAAQ,EAAE,MAAM,CAAC,CAAC,CAAC;AAEhH,SAAS,QAAQ,CAAC,CAAS;IACzB,OAAO,CAAC,CAAC,OAAO,CAAC,qBAAqB,EAAE,MAAM,CAAC,CAAC;AAClD,CAAC;AAED,iFAAiF;AACjF,SAAS,OAAO,CAAC,GAAW,EAAE,IAAY;IACxC,IAAI,KAAK,GAAG,CAAC,CAAC;IACd,KAAK,IAAI,CAAC,GAAG,IAAI,EAAE,CAAC,GAAG,GAAG,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QACvC,MAAM,EAAE,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC;QAClB,IAAI,EAAE,KAAK,GAAG,IAAI,EAAE,KAAK,GAAG,IAAI,EAAE,KAAK,GAAG,EAAE,CAAC;YAC3C,MAAM,GAAG,GAAG,GAAG,CAAC,OAAO,CAAC,EAAE,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC;YACnC,IAAI,GAAG,KAAK,CAAC,CAAC;gBAAE,OAAO,CAAC,CAAC,CAAC;YAC1B,CAAC,GAAG,GAAG,CAAC;QACV,CAAC;aAAM,IAAI,EAAE,KAAK,GAAG;YAAE,KAAK,EAAE,CAAC;aAC1B,IAAI,EAAE,KAAK,GAAG,IAAI,EAAE,KAAK,KAAK,CAAC;YAAE,OAAO,CAAC,CAAC;IACjD,CAAC;IACD,OAAO,CAAC,CAAC,CAAC;AACZ,CAAC;AAED,kDAAkD;AAClD,SAAS,WAAW,CAAC,IAAY;IAC/B,MAAM,GAAG,GAAa,EAAE,CAAC;IACzB,IAAI,KAAK,GAAG,CAAC,CAAC;IACd,IAAI,KAAK,GAAG,CAAC,CAAC;IACd,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QACrC,MAAM,EAAE,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC;QACnB,IAAI,EAAE,KAAK,GAAG,IAAI,EAAE,KAAK,GAAG,IAAI,EAAE,KAAK,GAAG,EAAE,CAAC;YAC3C,MAAM,GAAG,GAAG,IAAI,CAAC,OAAO,CAAC,EAAE,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC;YACpC,IAAI,GAAG,KAAK,CAAC,CAAC;gBAAE,MAAM;YACtB,CAAC,GAAG,GAAG,CAAC;QACV,CAAC;aAAM,IAAI,EAAE,KAAK,GAAG,IAAI,EAAE,KAAK,GAAG,IAAI,EAAE,KAAK,GAAG,IAAI,EAAE,KAAK,GAAG;YAAE,KAAK,EAAE,CAAC;aACpE,IAAI,EAAE,KAAK,GAAG,IAAI,EAAE,KAAK,GAAG,IAAI,EAAE,KAAK,GAAG;YAAE,KAAK,EAAE,CAAC;aACpD,IAAI,EAAE,KAAK,GAAG,EAAE,CAAC;YACpB,gCAAgC;YAChC,MAAM,IAAI,GAAG,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;YACzB,IAAI,IAAI,KAAK,GAAG,IAAI,IAAI,KAAK,GAAG;gBAAE,KAAK,EAAE,CAAC;QAC5C,CAAC;aAAM,IAAI,EAAE,KAAK,GAAG,IAAI,KAAK,IAAI,CAAC,EAAE,CAAC;YACpC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC,CAAC;YAC/B,KAAK,GAAG,CAAC,GAAG,CAAC,CAAC;YACd,KAAK,GAAG,CAAC,CAAC;QACZ,CAAC;IACH,CAAC;IACD,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,CAAC;IAC5B,OAAO,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC;AAChD,CAAC;AAED,4FAA4F;AAC5F,SAAS,UAAU,CAAC,KAAa;IAC/B,IAAI,KAAK,GAAG,CAAC,CAAC;IACd,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QACtC,MAAM,EAAE,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC;QACpB,IAAI,EAAE,KAAK,GAAG,IAAI,EAAE,KAAK,GAAG,IAAI,EAAE,KAAK,GAAG,IAAI,EAAE,KAAK,GAAG;YAAE,KAAK,EAAE,CAAC;aAC7D,IAAI,EAAE,KAAK,GAAG,IAAI,EAAE,KAAK,GAAG,IAAI,EAAE,KAAK,GAAG,IAAI,CAAC,EAAE,KAAK,GAAG,IAAI,KAAK,CAAC,CAAC,GAAG,CAAC,CAAC,KAAK,GAAG,IAAI,KAAK,CAAC,CAAC,GAAG,CAAC,CAAC,KAAK,GAAG,CAAC;YAAE,KAAK,EAAE,CAAC;aACpH,IAAI,EAAE,KAAK,GAAG,IAAI,KAAK,IAAI,CAAC,EAAE,CAAC;YAClC,MAAM,IAAI,GAAG,KAAK,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;YAC1B,MAAM,IAAI,GAAG,KAAK,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;YAC1B,IAAI,IAAI,KAAK,GAAG,IAAI,IAAI,KAAK,GAAG,IAAI,IAAI,KAAK,GAAG,IAAI,IAAI,KAAK,GAAG,IAAI,IAAI,KAAK,GAAG,IAAI,IAAI,KAAK,GAAG;gBAAE,OAAO,IAAI,CAAC;QAChH,CAAC;IACH,CAAC;IACD,OAAO,KAAK,CAAC;AACf,CAAC;AAED,MAAM,UAAU,UAAU,CAAC,SAAiB,EAAE,IAAY,EAAE,IAAY;IACtE,IAAI,CAAC,WAAW,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,SAAS,IAAI,CAAC,IAAI;QAAE,OAAO,IAAI,CAAC;IAC/D,IAAI,GAAG,GAAG,SAAS,CAAC;IACpB,IAAI,IAAI,KAAK,IAAI,EAAE,CAAC;QAClB,4CAA4C;QAC5C,MAAM,IAAI,GAAG,YAAY,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;QACpC,IAAI,IAAI,EAAE,CAAC;YACT,MAAM,GAAG,GAAG,OAAO,CAAC,GAAG,EAAE,IAAI,CAAC,CAAC,CAAC,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;YAC7C,IAAI,GAAG,KAAK,CAAC,CAAC;gBAAE,OAAO,IAAI,CAAC;YAC5B,GAAG,GAAG,GAAG,CAAC,KAAK,CAAC,GAAG,GAAG,CAAC,CAAC,CAAC;QAC3B,CAAC;IACH,CAAC;IACD,MAAM,CAAC,GAAG,IAAI,MAAM,CAAC,eAAe,GAAG,QAAQ,CAAC,IAAI,CAAC,GAAG,iBAAiB,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;IACrF,IAAI,CAAC,CAAC;QAAE,OAAO,IAAI,CAAC;IACpB,IAAI,CAAC,GAAG,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC;IAC9B,yCAAyC;IACzC,IAAI,GAAG,CAAC,CAAC,CAAC,KAAK,GAAG,IAAI,GAAG,CAAC,CAAC,CAAC,KAAK,GAAG,EAAE,CAAC;QACrC,MAAM,IAAI,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC;QACpB,MAAM,KAAK,GAAG,IAAI,KAAK,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC;QACvC,IAAI,KAAK,GAAG,CAAC,CAAC;QACd,OAAO,CAAC,GAAG,GAAG,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YAC3B,IAAI,GAAG,CAAC,CAAC,CAAC,KAAK,IAAI;gBAAE,KAAK,EAAE,CAAC;iBACxB,IAAI,GAAG,CAAC,CAAC,CAAC,KAAK,KAAK,IAAI,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,KAAK,GAAG,IAAI,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,KAAK,GAAG,IAAI,EAAE,KAAK,KAAK,CAAC,EAAE,CAAC;gBAAC,CAAC,EAAE,CAAC;gBAAC,MAAM;YAAC,CAAC;QACzG,CAAC;QACD,OAAO,GAAG,CAAC,CAAC,CAAC,KAAK,GAAG;YAAE,CAAC,EAAE,CAAC;IAC7B,CAAC;IACD,IAAI,GAAG,CAAC,CAAC,CAAC,KAAK,GAAG;QAAE,OAAO,IAAI,CAAC;IAChC,MAAM,GAAG,GAAG,OAAO,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC;IAC5B,IAAI,GAAG,KAAK,CAAC,CAAC;QAAE,OAAO,IAAI,CAAC,CAAC,sBAAsB;IACnD,IAAI,MAAM,GAAG,WAAW,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,GAAG,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC;IAEhD,IAAI,IAAI,KAAK,GAAG,IAAI,IAAI,KAAK,KAAK,EAAE,CAAC;QACnC,IAAI,MAAM,CAAC,MAAM,KAAK,CAAC,IAAI,MAAM,CAAC,CAAC,CAAC,KAAK,MAAM;YAAE,MAAM,GAAG,EAAE,CAAC;QAC7D,oDAAoD;aAC/C,IAAI,MAAM,CAAC,MAAM,KAAK,CAAC,IAAI,IAAI,KAAK,GAAG;YAAE,OAAO,IAAI,CAAC;IAC5D,CAAC;IACD,IAAI,IAAI,KAAK,QAAQ,EAAE,CAAC;QACtB,IAAI,MAAM,CAAC,MAAM,IAAI,eAAe,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,CAAE,CAAC;YAAE,MAAM,GAAG,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;IAClF,CAAC;SAAM,IAAI,IAAI,KAAK,MAAM,EAAE,CAAC;QAC3B,IAAI,MAAM,CAAC,MAAM,IAAI,mCAAmC,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,CAAE,CAAC;YAAE,MAAM,GAAG,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;IACtG,CAAC;SAAM,IAAI,IAAI,KAAK,YAAY,IAAI,IAAI,KAAK,KAAK,EAAE,CAAC;QACnD,IAAI,MAAM,CAAC,MAAM,IAAI,WAAW,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,CAAE,CAAC;YAAE,MAAM,GAAG,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;IAC9E,CAAC;IAED,IAAI,GAAG,GAAG,CAAC,CAAC;IACZ,IAAI,GAAG,GAAG,CAAC,CAAC;IACZ,IAAI,QAAQ,GAAG,KAAK,CAAC;IACrB,IAAI,GAAG,GAAG,KAAK,CAAC;IAChB,IAAI,QAAQ,GAAG,KAAK,CAAC;IACrB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,MAAM,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QACvC,MAAM,CAAC,GAAG,MAAM,CAAC,CAAC,CAAE,CAAC;QACrB,IAAI,IAAI,KAAK,QAAQ,EAAE,CAAC;YACtB,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC,KAAK,GAAG;gBAAE,SAAS,CAAC,yCAAyC;YAC/E,IAAI,CAAC,CAAC,UAAU,CAAC,GAAG,CAAC,EAAE,CAAC;gBAAC,QAAQ,GAAG,IAAI,CAAC;gBAAC,SAAS;YAAC,CAAC;QACvD,CAAC;QACD,IAAI,CAAC,CAAC,QAAQ,CAAC,KAAK,CAAC,IAAI,CAAC,IAAI,KAAK,QAAQ,IAAI,2BAA2B,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;YACpF,QAAQ,GAAG,IAAI,CAAC;YAChB,SAAS;QACX,CAAC;QACD,IAAI,IAAI,KAAK,QAAQ,IAAI,CAAC,KAAK,CAAC,IAAI,yBAAyB,CAAC,IAAI,CAAC,CAAC,CAAC;YAAE,GAAG,GAAG,IAAI,CAAC;QAClF,GAAG,EAAE,CAAC;QACN,MAAM,QAAQ,GACZ,UAAU,CAAC,CAAC,CAAC;YACb,CAAC,CAAC,IAAI,KAAK,YAAY,IAAI,IAAI,KAAK,KAAK,CAAC,IAAI,mBAAmB,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC;QAC7E,IAAI,CAAC,QAAQ,EAAE,CAAC;YACd,GAAG,EAAE,CAAC;YACN,QAAQ,GAAG,CAAC,IAAI,KAAK,YAAY,IAAI,IAAI,KAAK,KAAK,CAAC,IAAI,6BAA6B,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QAChG,CAAC;IACH,CAAC;IACD,OAAO,EAAE,GAAG,EAAE,GAAG,EAAE,QAAQ,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,GAAG,EAAE,GAAG,EAAE,QAAQ,EAAE,CAAC;AAChE,CAAC;AAED;;;;GAIG;AACH,MAAM,UAAU,SAAS,CAAC,KAAwB,EAAE,IAAY,EAAE,IAAY,EAAE,OAAgB;IAC9F,IAAI,CAAC,KAAK,IAAI,IAAI,GAAG,CAAC;QAAE,OAAO,IAAI,CAAC;IACpC,IAAI,IAAI,IAAI,KAAK,CAAC,GAAG,IAAI,IAAI,IAAI,KAAK,CAAC,GAAG;QAAE,OAAO,IAAI,CAAC;IACxD,8FAA8F;IAC9F,IAAI,KAAK,CAAC,QAAQ,IAAI,IAAI,KAAK,KAAK,CAAC,GAAG,GAAG,CAAC;QAAE,OAAO,IAAI,CAAC;IAC1D,gFAAgF;IAChF,IAAI,KAAK,CAAC,GAAG,IAAI,IAAI,GAAG,CAAC,IAAI,KAAK,CAAC,GAAG,IAAI,IAAI,GAAG,CAAC,IAAI,KAAK,CAAC,GAAG;QAAE,OAAO,IAAI,CAAC;IAC7E,IAAI,OAAO,IAAI,CAAC,IAAI,KAAK,QAAQ,IAAI,IAAI,KAAK,MAAM,CAAC,IAAI,IAAI,GAAG,CAAC,IAAI,KAAK,CAAC,GAAG,IAAI,IAAI,GAAG,CAAC,IAAI,KAAK,CAAC,GAAG;QAAE,OAAO,IAAI,CAAC;IACrH,wCAAwC;IACxC,IAAI,IAAI,KAAK,IAAI,IAAI,IAAI,KAAK,CAAC,IAAI,KAAK,CAAC,GAAG,GAAG,CAAC;QAAE,OAAO,IAAI,CAAC;IAC9D,OAAO,KAAK,CAAC;AACf,CAAC"}

package/dist/query/callgraph.d.ts

@@ -0,0 +1,113 @@
+import type { ClastDb } from '../db/index.js';
+import { type SymbolRow } from '../types.js';
+import { type Resolver } from './resolve.js';
+export interface CallerEdge {
+    /** Calling symbol, or null for a call at file level. */
+    caller: SymbolRow | null;
+    path: string;
+    line: number;
+    count: number;
+    /** False when name-based resolution could not rule out another target. */
+    certain: boolean;
+    /**
+     * True for call sites whose receiver type is unknown and that could not be
+     * attributed to any definition: they MAY call the target (same method
+     * name), but there is no evidence either way.
+     */
+    weak?: boolean;
+}
+export interface CalleeEdge {
+    name: string;
+    line: number;
+    count: number;
+    receiver: string | null;
+    /** Resolved definition, or null for external / unknown callees. */
+    target: SymbolRow | null;
+    certain: boolean;
+    /** Number of other plausible definitions. */
+    alternatives: number;
+}
+/**
+ * The definition that best stands for a symbol's family member with the same
+ * qualified name: the function body rather than its prototype, the
+ * out-of-line C++ method rather than the in-class declaration.
+ */
+export declare function representative(db: ClastDb, resolver: Resolver, sym: SymbolRow): SymbolRow;
+/**
+ * Who calls `target`? Call sites are matched by name and then filtered by
+ * resolving each site back to its most plausible definition.
+ */
+export interface CallerQuery {
+    /** Only call sites in files whose path contains this text (pushed down to SQL). */
+    pathContains?: string;
+    /** Examine fewer call sites (summaries that only show the first few callers). */
+    quick?: boolean;
+    /** Other overloads of the target whose call sites count too (a bare name means "any overload"). */
+    overloads?: SymbolRow[];
+}
+/** Set by callersOf when a name has more call sites than were examined. */
+export interface CallerStats {
+    examined: number;
+    total: number;
+}
+export declare function callersOf(db: ClastDb, resolver: Resolver, target: SymbolRow, query?: CallerQuery, stats?: CallerStats): CallerEdge[];
+/** What does `sym` call? For containers, the calls of all direct members. */
+export declare function calleesOf(db: ClastDb, resolver: Resolver, sym: SymbolRow): CalleeEdge[];
+/** One entry per calling symbol (call sites inside the same caller are merged). */
+export interface CallerGroup {
+    caller: SymbolRow | null;
+    path: string;
+    /** First call line inside the caller. */
+    line: number;
+    /** Number of call sites in this caller. */
+    sites: number;
+    certain: boolean;
+    /** All call sites in this caller are unattributed (receiver type unknown). */
+    weak: boolean;
+}
+export declare function groupCallers(edges: CallerEdge[]): CallerGroup[];
+/**
+ * Call sites of a name that has no definition in the project (an external
+ * library function, a dynamically defined method).
+ */
+export declare function externalCallSites(db: ClastDb, name: string, limit?: number): CallerEdge[];
+export interface GraphNode {
+    sym: SymbolRow | null;
+    /** For callers: where the call happens. For callees: call line in the parent. */
+    path: string;
+    line: number;
+    certain: boolean;
+    /** Call sites merged into this node. */
+    sites: number;
+    /** Unattributed call site (receiver type unknown). */
+    weak?: boolean;
+    label?: string;
+    children: GraphNode[];
+    /** Set when this symbol was already expanded elsewhere in the tree. */
+    repeated?: boolean;
+    /** Children omitted because of the node budget. */
+    omitted?: number;
+    /** Set when the node has too many edges to expand at this depth. */
+    hub?: number;
+}
+export interface GraphOptions {
+    depth: number;
+    /** Total node budget. */
+    budget: number;
+    includeTests: boolean;
+    /** Only edges whose file matches this path filter. */
+    path?: (path: string) => boolean;
+    /** Text every call-site path must contain (lets the database do the first cut for `within`). */
+    pathContains?: string;
+    /** Filled in for the root symbol: how many call sites of the name exist vs were examined. */
+    stats?: CallerStats;
+    /** Other overloads of the root whose callers are included. */
+    overloads?: SymbolRow[];
+}
+/**
+ * Breadth-first expansion of callers or callees, bounded by a total node
+ * budget so the output stays small. Hubs (symbols with dozens of callers)
+ * are reported but not expanded beyond the first level: their fan-out would
+ * drown the rest of the tree.
+ */
+export declare function buildGraph(db: ClastDb, resolver: Resolver, root: SymbolRow, direction: 'callers' | 'callees', opts: GraphOptions): GraphNode;

package/dist/query/callgraph.js

@@ -0,0 +1,332 @@
+import { CONTAINER_KINDS } from '../types.js';
+import { isTestPath } from './format.js';
+import { goInterfaceMethods } from './hierarchy.js';
+import { langFamily } from './resolve.js';
+const MAX_CALL_ROWS = 4000;
+const MAX_NEAR_ROWS = 20000;
+const QUICK_NEAR_ROWS = 5000;
+const QUICK_FAR_ROWS = 1500;
+const MAX_WEAK = 1500;
+/**
+ * The definition that best stands for a symbol's family member with the same
+ * qualified name: the function body rather than its prototype, the
+ * out-of-line C++ method rather than the in-class declaration.
+ */
+export function representative(db, resolver, sym) {
+    // Only C-family code separates declarations from definitions across files.
+    if (langFamily(sym.lang) !== 'c' && sym.kind !== 'declaration')
+        return sym;
+    let best = sym;
+    let bestScore = (sym.kind === 'declaration' ? 0 : 1000) + (sym.end_line - sym.start_line);
+    for (const id of resolver.familyOf(sym)) {
+        if (id === sym.id)
+            continue;
+        const other = db.symbolById(id);
+        // The same member in another file (header vs source); overloads in the same file are different functions.
+        if (!other || other.qname !== sym.qname || (other.file_id === sym.file_id && sym.kind !== 'declaration'))
+            continue;
+        const score = (other.kind === 'declaration' ? 0 : 1000) + (other.end_line - other.start_line);
+        if (score > bestScore) {
+            best = other;
+            bestScore = score;
+        }
+    }
+    return best;
+}
+/** Ids of the symbol itself plus (for containers) its direct members. */
+function bodyIds(db, sym) {
+    if (CONTAINER_KINDS.has(sym.kind)) {
+        const members = db.all(`SELECT id FROM symbols WHERE parent_id = ?`, sym.id);
+        return [sym.id, ...members.map(m => m.id)];
+    }
+    // A function's body includes the closures and helpers nested inside it.
+    const ids = [sym.id];
+    let frontier = [sym.id];
+    for (let depth = 0; depth < 4 && frontier.length && ids.length < 200; depth++) {
+        const next = [];
+        for (const id of frontier) {
+            for (const row of db.all(`SELECT id FROM symbols WHERE parent_id = ? AND kind IN ('function', 'method')`, id)) {
+                ids.push(row.id);
+                next.push(row.id);
+            }
+        }
+        frontier = next;
+    }
+    return ids;
+}
+export function callersOf(db, resolver, target, query = {}, stats) {
+    const nameId = db.nameId(target.name, false);
+    if (nameId === undefined)
+        return [];
+    const cols = `c.rowid AS id, c.file_id, c.caller_id, c.line, c.receiver, c.rtype, c.via, c.argc, c.count, f.path, f.lang`;
+    const pathClause = query.pathContains ? ` AND f.path LIKE ? ESCAPE '\\'` : '';
+    const pathArg = query.pathContains ? ['%' + query.pathContains.replace(/[\\%_]/g, c => '\\' + c) + '%'] : [];
+    // Very common names (`dispose`, `push`, `get`) have more call sites than can be examined.
+    // Sites that can see the target - its own file and the files that import it - always go first.
+    const near = db.all(`SELECT ${cols} FROM calls c JOIN files f ON f.id = c.file_id
+     WHERE c.name_id = ? AND (c.file_id = ? OR c.file_id IN (SELECT file_id FROM imports WHERE resolved_id = ?))${pathClause}
+     LIMIT ${query.quick ? QUICK_NEAR_ROWS : MAX_NEAR_ROWS}`, nameId, target.file_id, target.file_id, ...pathArg);
+    const seenRows = new Set(near.map(r => r.id));
+    const far = db
+        .all(`SELECT ${cols} FROM calls c JOIN files f ON f.id = c.file_id
+       WHERE c.name_id = ?${pathClause} LIMIT ${MAX_CALL_ROWS + MAX_NEAR_ROWS}`, nameId, ...pathArg)
+        .filter(r => !seenRows.has(r.id))
+        .slice(0, query.quick ? QUICK_FAR_ROWS : MAX_CALL_ROWS);
+    const rows = [...near, ...far];
+    if (stats) {
+        stats.examined = rows.length;
+        stats.total = rows.length < (query.quick ? QUICK_FAR_ROWS : MAX_CALL_ROWS)
+            ? rows.length
+            : db.get(`SELECT COUNT(*) AS n FROM calls WHERE name_id = ?`, nameId)?.n ?? rows.length;
+    }
+    let family = resolver.familyOf(target);
+    // A constructor is called by naming its class: `new Foo(...)` resolves to the class.
+    if (target.parent_id !== null && target.kind === 'method') {
+        const parent = db.symbolById(target.parent_id);
+        if (parent && parent.name === target.name && CONTAINER_KINDS.has(parent.kind))
+            family = new Set([...family, parent.id]);
+    }
+    const arityTargets = query.overloads?.length ? [target, ...query.overloads] : [target];
+    /** Go interface methods the target satisfies structurally: calls through them are possible, not certain. */
+    let structural = null;
+    if (target.lang === 'go' && target.kind === 'method') {
+        // Go interfaces are satisfied structurally: a call through an interface this method's
+        // type implements may reach it.
+        const viaInterface = goInterfaceMethods(db, target);
+        if (viaInterface.length) {
+            family = new Set([...family, ...viaInterface]);
+            structural = new Set(viaInterface);
+        }
+    }
+    const edges = [];
+    const weak = [];
+    const targetIsMember = target.kind === 'method' || target.qname.includes('.');
+    // `get_or_create`, `maybeAutoCommit`: a name like that on an unknown receiver is worth listing as possible
+    // even from files that never mention the class.
+    const distinctive = target.name.length >= 8 && /[a-z0-9][A-Z_]|_[a-z]/.test(target.name);
+    // `@property def count` / `get count()`: read as an attribute, so `.count(...)` calls elsewhere are something else.
+    const propertyLike = /^@(cached_)?property\b|^(public |private |protected |static |override )*get \w/.test(target.signature);
+    const callerCache = new Map();
+    for (const row of rows) {
+        let caller = null;
+        if (row.caller_id !== null) {
+            if (!callerCache.has(row.caller_id))
+                callerCache.set(row.caller_id, db.symbolById(row.caller_id));
+            caller = callerCache.get(row.caller_id) ?? null;
+        }
+        const site = {
+            fileId: row.file_id, path: row.path, lang: row.lang, receiver: row.receiver, rtype: row.rtype, via: row.via,
+            argc: row.argc, caller,
+        };
+        // A call with another number of arguments is a call of another overload (or of something else).
+        if (!arityTargets.some(t => resolver.arityFits(t, site)))
+            continue;
+        // A symbol "calling itself" by name from inside its own definition line is recursion: keep it.
+        const res = resolver.resolve(target.name, site);
+        if (res.candidates.length === 0) {
+            // Nothing could be attributed. If the receiver's type is simply unknown,
+            // keep the site as a possible caller instead of silently dropping it.
+            if (targetIsMember && !propertyLike && weak.length < MAX_WEAK && (distinctive || resolver.canSee(row.file_id, target)) && resolver.isOpaqueReceiver(site) && langFamily(row.lang) === langFamily(target.lang) && !(isTestPath(target.path) && !isTestPath(row.path))) {
+                weak.push({ caller, path: row.path, line: row.line, count: row.count, certain: false, weak: true });
+            }
+            continue;
+        }
+        const top = res.candidates[0];
+        let certain;
+        if (family.has(top.sym.id)) {
+            // Resolved to the target or to its interface/override/overload twin.
+            certain = res.confident;
+            // Any type with these methods satisfies a Go interface: a call through it may reach the
+            // target, but equally one of the other implementers.
+            if (structural && structural.has(top.sym.id))
+                certain = false;
+            // Bound to an override in a subclass: that call does not run the target.
+            if (top.sym.id !== target.id && resolver.overriddenBelow(target, top.sym)) {
+                if (certain)
+                    continue;
+            }
+            // Bound to a supertype's declaration, but on a receiver that cannot be the target's class
+            // (a sibling subclass, or an explicit super call).
+            if (certain && top.sym.id !== target.id && !resolver.reaches(target, top.sym, site))
+                continue;
+        }
+        else {
+            const mine = res.candidates.find(c => family.has(c.sym.id));
+            // Keep near-ties as uncertain edges; drop sites that clearly mean another definition.
+            if (!mine || top.score - mine.score > 10)
+                continue;
+            // The site binds to another copy of this definition (a vendored fork) that its file can see better.
+            if (top.sym.qname === target.qname && top.sym.kind === target.kind && top.sym.file_id !== target.file_id &&
+                top.score - mine.score >= 4)
+                continue;
+            certain = false;
+        }
+        edges.push({ caller, path: row.path, line: row.line, count: row.count, certain });
+    }
+    // Call sites that use a local alias of the target: `import { X as Y }`, default imports, require bindings.
+    for (const use of resolver.aliasesOf(target)) {
+        const aliasId = db.nameId(use.alias, false);
+        if (aliasId === undefined)
+            continue;
+        const aliasRows = db.all(`SELECT c.file_id, c.caller_id, c.line, c.receiver, c.rtype, c.via, c.count, f.path, f.lang
+       FROM calls c JOIN files f ON f.id = c.file_id
+       WHERE c.name_id = ? AND c.file_id = ? AND c.receiver IS NULL`, aliasId, use.fileId);
+        for (const row of aliasRows) {
+            const caller = row.caller_id !== null ? db.symbolById(row.caller_id) ?? null : null;
+            edges.push({ caller, path: row.path, line: row.line, count: row.count, certain: true });
+        }
+    }
+    // Unattributed sites only matter when they are not already explained.
+    const known = new Set(edges.map(e => e.path + ':' + e.line));
+    for (const w of weak)
+        if (!known.has(w.path + ':' + w.line))
+            edges.push(w);
+    // Production code first, then resolved before name-only, then by location.
+    edges.sort((a, b) => Number(isTestPath(a.path)) - Number(isTestPath(b.path)) ||
+        Number(b.certain) - Number(a.certain) ||
+        Number(a.weak ?? false) - Number(b.weak ?? false) ||
+        a.path.localeCompare(b.path) ||
+        a.line - b.line);
+    return edges;
+}
+/** What does `sym` call? For containers, the calls of all direct members. */
+export function calleesOf(db, resolver, sym) {
+    const ids = bodyIds(db, sym);
+    const byName = new Map();
+    for (const id of ids) {
+        const caller = id === sym.id ? sym : db.symbolById(id) ?? sym;
+        const rows = db.all(`SELECT n.name, c.line, c.receiver, c.rtype, c.via, c.argc, c.count
+       FROM calls c JOIN names n ON n.id = c.name_id
+       WHERE c.caller_id = ? ORDER BY c.line`, id);
+        for (const row of rows) {
+            const res = resolver.resolve(row.name, {
+                fileId: sym.file_id, path: sym.path, lang: sym.lang, receiver: row.receiver, rtype: row.rtype, via: row.via,
+                argc: row.argc, caller,
+            });
+            const first = res.candidates[0];
+            // Follow the call to the implementation, not to a prototype / in-class declaration.
+            const top = first ? { ...first, sym: representative(db, resolver, first.sym) } : undefined;
+            const key = row.name + '\0' + (top ? top.sym.id : '');
+            const existing = byName.get(key);
+            if (existing) {
+                existing.count += row.count;
+                continue;
+            }
+            byName.set(key, {
+                name: row.name,
+                line: row.line,
+                count: row.count,
+                receiver: row.receiver,
+                target: top ? top.sym : null,
+                certain: res.confident,
+                alternatives: top
+                    ? Math.max(0, res.candidates.length - 1)
+                    // Unresolved, but the project does define methods with this name: not "external".
+                    : resolver.isOpaqueReceiver({
+                        fileId: sym.file_id, path: sym.path, lang: sym.lang, receiver: row.receiver, rtype: row.rtype, via: row.via, caller,
+                    })
+                        ? resolver.candidates(row.name).filter(c => langFamily(c.lang) === langFamily(sym.lang)).length
+                        : 0,
+            });
+        }
+    }
+    return [...byName.values()].sort((a, b) => a.line - b.line);
+}
+export function groupCallers(edges) {
+    const groups = new Map();
+    for (const e of edges) {
+        const key = e.caller ? 's' + e.caller.id : 'f' + e.path;
+        const g = groups.get(key);
+        if (g) {
+            g.sites += e.count;
+            if (e.certain)
+                g.certain = true;
+            if (!e.weak)
+                g.weak = false;
+            if (e.line < g.line)
+                g.line = e.line;
+        }
+        else {
+            groups.set(key, {
+                caller: e.caller, path: e.path, line: e.line, sites: e.count, certain: e.certain, weak: e.weak ?? false,
+            });
+        }
+    }
+    return [...groups.values()];
+}
+/**
+ * Call sites of a name that has no definition in the project (an external
+ * library function, a dynamically defined method).
+ */
+export function externalCallSites(db, name, limit = 2000) {
+    const nameId = db.nameId(name, false);
+    if (nameId === undefined)
+        return [];
+    const rows = db.all(`SELECT c.file_id, c.caller_id, c.line, c.receiver, c.rtype, c.via, c.count, f.path, f.lang
+     FROM calls c JOIN files f ON f.id = c.file_id WHERE c.name_id = ? LIMIT ?`, nameId, limit);
+    const edges = rows.map(row => ({
+        caller: row.caller_id !== null ? db.symbolById(row.caller_id) ?? null : null,
+        path: row.path, line: row.line, count: row.count, certain: false,
+    }));
+    edges.sort((a, b) => Number(isTestPath(a.path)) - Number(isTestPath(b.path)) || a.path.localeCompare(b.path) || a.line - b.line);
+    return edges;
+}
+/** Symbols with more direct edges than this are not expanded below the first level. */
+const HUB_LIMIT = 30;
+/**
+ * Breadth-first expansion of callers or callees, bounded by a total node
+ * budget so the output stays small. Hubs (symbols with dozens of callers)
+ * are reported but not expanded beyond the first level: their fan-out would
+ * drown the rest of the tree.
+ */
+export function buildGraph(db, resolver, root, direction, opts) {
+    const rootNode = { sym: root, path: root.path, line: root.start_line, certain: true, sites: 1, children: [] };
+    const expanded = new Set([root.id]);
+    let frontier = [rootNode];
+    let remaining = opts.budget;
+    for (let level = 0; level < opts.depth && frontier.length && remaining > 0; level++) {
+        const next = [];
+        // Split the remaining budget fairly across this level's nodes.
+        const perNode = level === 0 ? remaining : Math.max(3, Math.ceil(remaining / frontier.length));
+        for (const node of frontier) {
+            if (!node.sym || remaining <= 0)
+                continue;
+            let children;
+            if (direction === 'callers') {
+                children = groupCallers(callersOf(db, resolver, node.sym, { pathContains: opts.pathContains, overloads: level === 0 ? opts.overloads : undefined }, level === 0 ? opts.stats : undefined))
+                    .filter(g => (opts.includeTests || !isTestPath(g.path)) && (!opts.path || opts.path(g.path)))
+                    .map(g => ({
+                    sym: g.caller, path: g.path, line: g.line, certain: g.certain, sites: g.sites, weak: g.weak,
+                    label: g.caller ? undefined : '<file level>', children: [],
+                }));
+            }
+            else {
+                children = calleesOf(db, resolver, node.sym)
+                    .filter(e => e.target !== null && (opts.includeTests || !isTestPath(e.target.path)))
+                    .map(e => ({ sym: e.target, path: e.target.path, line: e.line, certain: e.certain, sites: e.count, children: [] }));
+            }
+            if (level > 0 && children.length > HUB_LIMIT) {
+                node.hub = children.length;
+                continue;
+            }
+            const take = Math.min(children.length, perNode, remaining);
+            node.omitted = children.length - take;
+            node.children = children.slice(0, take);
+            remaining -= take;
+            for (const child of node.children) {
+                // Only confirmed edges are worth following further.
+                if (!child.sym || child.weak || (direction === 'callers' && !child.certain))
+                    continue;
+                if (expanded.has(child.sym.id)) {
+                    child.repeated = true;
+                    continue;
+                }
+                expanded.add(child.sym.id);
+                next.push(child);
+            }
+        }
+        frontier = next;
+    }
+    return rootNode;
+}
+//# sourceMappingURL=callgraph.js.map