@lzehrung/codegraph 2.1.0

package/dist/indexer/symbols.js

@@ -0,0 +1,272 @@
+import { fileIdentityKey, normalizePath, resolveFilePathFromRoot } from "../util/paths.js";
+import { findReferences, resolveExport, resolveImported } from "./navigation.js";
+import { parseSourceLocationInput } from "../util/sourceLocation.js";
+export function symbolId(def) {
+    const index = def?.range?.start?.index ?? 0;
+    return `${def.file}::${def.localName}::${index}`;
+}
+/** Parse a project-relative file and local symbol identity such as `src/main.ts::run`. */
+export function parseQualifiedSymbolPath(value) {
+    const separator = value.lastIndexOf("::");
+    if (separator <= 0 || separator === value.length - 2 || value.indexOf("::") !== separator)
+        return null;
+    return { file: value.slice(0, separator), name: value.slice(separator + 2) };
+}
+/** Return every local definition named `name` in an already-resolved indexed file. */
+export function findLocalSymbolDefinitions(index, file, name) {
+    const normalizedFile = normalizePath(file);
+    return (index.byFile.get(fileIdentityKey(normalizedFile))?.locals.filter((definition) => definition.localName === name) ??
+        []);
+}
+/**
+ * Resolve a canonical handle, `file::symbol`, source location, or exact name.
+ *
+ * Relative file targets resolve from `index.projectRoot` when it is available.
+ */
+export function resolveSymbolTarget(index, input) {
+    const handle = resolveExactSymbolHandle(index, input);
+    if (handle) {
+        return { status: "exact", input, target: handle };
+    }
+    const qualified = parseQualifiedSymbolPath(input);
+    if (qualified) {
+        const file = resolveIndexedFile(index, qualified.file);
+        const definitions = file ? findLocalSymbolDefinitions(index, file, qualified.name) : [];
+        return resolutionForDefinitions(input, definitions);
+    }
+    const location = parseSourceLocationInput(input);
+    const file = resolveIndexedFile(index, location.file);
+    if (file) {
+        const definitions = (index.byFile.get(fileIdentityKey(file))?.locals ?? []).filter((definition) => {
+            if (location.line !== undefined && definition.range.start.line !== location.line)
+                return false;
+            if (location.column !== undefined && definition.range.start.column !== location.column)
+                return false;
+            return true;
+        });
+        return resolutionForDefinitions(input, definitions);
+    }
+    const definitions = [];
+    for (const module of index.byFile.values()) {
+        for (const definition of module.locals) {
+            if (definition.localName === input)
+                definitions.push(definition);
+        }
+    }
+    return resolutionForDefinitions(input, definitions);
+}
+function resolveIndexedFile(index, file) {
+    const normalized = normalizePath(file);
+    if (index.byFile.has(fileIdentityKey(normalized)))
+        return normalized;
+    if (!index.projectRoot)
+        return undefined;
+    const rooted = normalizePath(resolveFilePathFromRoot(index.projectRoot, file));
+    return index.byFile.has(fileIdentityKey(rooted)) ? rooted : undefined;
+}
+function resolveExactSymbolHandle(index, input) {
+    const parts = input.split("::");
+    if (parts.length !== 3 || !/^\d+$/.test(parts[2] ?? ""))
+        return null;
+    const file = resolveIndexedFile(index, parts[0] ?? "");
+    if (!file)
+        return null;
+    const name = parts[1] ?? "";
+    const startIndex = Number(parts[2]);
+    const definition = index.byFile
+        .get(fileIdentityKey(file))
+        ?.locals.find((candidate) => candidate.localName === name && (candidate.range.start.index ?? 0) === startIndex);
+    if (!definition)
+        return null;
+    return { handle: symbolId(definition), definition };
+}
+function resolutionForDefinitions(input, definitions) {
+    const candidates = definitions
+        .map((definition) => ({ handle: symbolId(definition), definition }))
+        .sort(compareResolvedSymbolTargets);
+    if (candidates.length === 1) {
+        return { status: "exact", input, target: candidates[0] };
+    }
+    if (candidates.length)
+        return { status: "ambiguous", input, candidates };
+    return { status: "not_found", input };
+}
+function compareResolvedSymbolTargets(left, right) {
+    return (left.definition.file.localeCompare(right.definition.file) ||
+        (left.definition.range.start.index ?? 0) - (right.definition.range.start.index ?? 0) ||
+        left.definition.localName.localeCompare(right.definition.localName));
+}
+export function defFromSymbolId(index, id) {
+    if (!id)
+        return null;
+    const parts = id.split("::");
+    if (parts.length < 3)
+        return null;
+    const rawFile = parts[0];
+    const localName = parts[1];
+    const startStr = parts[2];
+    const file = normalizePath(rawFile);
+    const startIndex = Number(startStr);
+    const mod = index.byFile.get(fileIdentityKey(file));
+    if (!mod)
+        return null;
+    const exact = mod.locals.find((def) => def.localName === localName && (def.range?.start?.index ?? 0) === startIndex);
+    if (exact)
+        return exact;
+    const byName = mod.locals.find((def) => def.localName === localName);
+    return byName ?? null;
+}
+export function resolveSymbolId(index, id) {
+    if (!id)
+        return null;
+    const parts = id.split("::");
+    if (parts.length === 3 && parts[2] === "import") {
+        const rawFile = parts[0];
+        const alias = parts[1];
+        const file = normalizePath(rawFile);
+        const mod = index.byFile.get(fileIdentityKey(file));
+        if (!mod)
+            return null;
+        const named = mod.imports.find((imp) => imp.kind === "named" && imp.local === alias);
+        if (named) {
+            const result = resolveImported(index, named, named.imported);
+            if (result && !("namespace" in result))
+                return result;
+            const target = typeof named.resolved === "string" ? named.resolved : undefined;
+            if (target) {
+                const hit = resolveExport(index, target, named.imported);
+                if (hit?.kind === "resolved")
+                    return hit.def;
+            }
+        }
+        const defaultImport = mod.imports.find((imp) => imp.kind === "default" && imp.local === alias);
+        if (defaultImport) {
+            const result = resolveImported(index, defaultImport, "default");
+            if (result && !("namespace" in result))
+                return result;
+            const target = typeof defaultImport.resolved === "string" ? defaultImport.resolved : undefined;
+            if (target) {
+                const hit = resolveExport(index, target, "default");
+                if (hit?.kind === "resolved")
+                    return hit.def;
+                const targetModule = index.byFile.get(fileIdentityKey(target));
+                const first = targetModule?.exports.find((entry) => entry.type === "local");
+                if (first)
+                    return first.target;
+            }
+        }
+        const namespaceImport = mod.imports.find((imp) => imp.kind === "namespace" && imp.localNS === alias);
+        if (namespaceImport) {
+            const target = typeof namespaceImport.resolved === "string" ? namespaceImport.resolved : undefined;
+            if (target) {
+                const targetModule = index.byFile.get(fileIdentityKey(target));
+                const first = targetModule?.exports.find((entry) => entry.type === "local");
+                if (first)
+                    return first.target;
+                const firstLocal = targetModule?.locals?.[0];
+                if (firstLocal)
+                    return firstLocal;
+            }
+        }
+        return null;
+    }
+    return defFromSymbolId(index, id);
+}
+export function goToDefinitionById(index, id) {
+    const def = resolveSymbolId(index, id);
+    if (def)
+        return { status: "ok", definition: def };
+    return { status: "not_found", reason: "No matching definition for handle" };
+}
+export async function findReferencesById(index, id) {
+    const def = resolveSymbolId(index, id);
+    if (!def) {
+        return {
+            status: "not_found",
+            reason: "No matching definition for handle",
+        };
+    }
+    return await findReferences(index, { def });
+}
+export function listSymbols(index, opts) {
+    const out = [];
+    const files = opts?.file ? [opts.file] : Array.from(index.byFile.values(), (module) => module.file);
+    for (const file of files) {
+        const mod = index.byFile.get(fileIdentityKey(file));
+        if (!mod)
+            continue;
+        const displayFile = mod.file;
+        for (const def of mod.locals) {
+            out.push({
+                id: symbolId(def),
+                file: displayFile,
+                name: def.localName,
+                kind: def.kind,
+                range: def.range,
+                ...(def.docstring ? { docstring: def.docstring } : {}),
+            });
+        }
+        if (opts?.includeImports) {
+            for (const imp of mod.imports) {
+                if (imp.kind === "named" || imp.kind === "default") {
+                    out.push({
+                        id: `${displayFile}::${imp.local}::import`,
+                        file: displayFile,
+                        name: imp.local,
+                        kind: "import",
+                    });
+                }
+                else if (imp.kind === "namespace") {
+                    out.push({
+                        id: `${displayFile}::${imp.localNS}::import`,
+                        file: displayFile,
+                        name: imp.localNS,
+                        kind: "namespaceImport",
+                    });
+                }
+            }
+        }
+    }
+    return out;
+}
+export function getApiSurface(index) {
+    const out = [];
+    for (const mod of index.byFile.values()) {
+        const exports = mod.exports.map((entry) => {
+            if (entry.type === "local") {
+                return {
+                    name: entry.target.localName,
+                    kind: entry.target.kind,
+                    exportedAs: entry.exportedAs,
+                };
+            }
+            if (entry.type === "reexport") {
+                return {
+                    name: entry.sourceSpecifier,
+                    kind: "reexport",
+                    exportedAs: entry.exportedAs,
+                    target: { file: entry.fromModule, name: entry.sourceSpecifier },
+                };
+            }
+            if (entry.type === "namespaceReexport") {
+                return {
+                    name: "*",
+                    kind: "namespaceReexport",
+                    exportedAs: entry.exportedAs,
+                    target: { file: entry.fromModule, name: "*" },
+                };
+            }
+            return {
+                name: "*",
+                kind: "exportStar",
+                exportedAs: "*",
+                target: { file: entry.fromModule, name: "*" },
+            };
+        });
+        if (exports.length) {
+            out.push({ file: mod.file, exports });
+        }
+    }
+    return out;
+}
+//# sourceMappingURL=symbols.js.map

package/dist/indexer/symbols.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"symbols.js","sourceRoot":"","sources":["../../src/indexer/symbols.ts"],"names":[],"mappings":"AAUA,OAAO,EAAE,eAAe,EAAE,aAAa,EAAE,uBAAuB,EAAE,MAAM,kBAAkB,CAAC;AAC3F,OAAO,EAAE,cAAc,EAAE,aAAa,EAAE,eAAe,EAAE,MAAM,iBAAiB,CAAC;AACjF,OAAO,EAAE,wBAAwB,EAAE,MAAM,2BAA2B,CAAC;AAErE,MAAM,UAAU,QAAQ,CAAC,GAAc;IACrC,MAAM,KAAK,GAAG,GAAG,EAAE,KAAK,EAAE,KAAK,EAAE,KAAK,IAAI,CAAC,CAAC;IAC5C,OAAO,GAAG,GAAG,CAAC,IAAI,KAAK,GAAG,CAAC,SAAS,KAAK,KAAK,EAAE,CAAC;AACnD,CAAC;AAOD,0FAA0F;AAC1F,MAAM,UAAU,wBAAwB,CAAC,KAAa;IACpD,MAAM,SAAS,GAAG,KAAK,CAAC,WAAW,CAAC,IAAI,CAAC,CAAC;IAC1C,IAAI,SAAS,IAAI,CAAC,IAAI,SAAS,KAAK,KAAK,CAAC,MAAM,GAAG,CAAC,IAAI,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,KAAK,SAAS;QAAE,OAAO,IAAI,CAAC;IACvG,OAAO,EAAE,IAAI,EAAE,KAAK,CAAC,KAAK,CAAC,CAAC,EAAE,SAAS,CAAC,EAAE,IAAI,EAAE,KAAK,CAAC,KAAK,CAAC,SAAS,GAAG,CAAC,CAAC,EAAE,CAAC;AAC/E,CAAC;AAED,sFAAsF;AACtF,MAAM,UAAU,0BAA0B,CAAC,KAAmB,EAAE,IAAY,EAAE,IAAY;IACxF,MAAM,cAAc,GAAG,aAAa,CAAC,IAAI,CAAC,CAAC;IAC3C,OAAO,CACL,KAAK,CAAC,MAAM,CAAC,GAAG,CAAC,eAAe,CAAC,cAAc,CAAC,CAAC,EAAE,MAAM,CAAC,MAAM,CAAC,CAAC,UAAU,EAAE,EAAE,CAAC,UAAU,CAAC,SAAS,KAAK,IAAI,CAAC;QAC/G,EAAE,CACH,CAAC;AACJ,CAAC;AAmBD;;;;GAIG;AACH,MAAM,UAAU,mBAAmB,CAAC,KAAmB,EAAE,KAAa;IACpE,MAAM,MAAM,GAAG,wBAAwB,CAAC,KAAK,EAAE,KAAK,CAAC,CAAC;IACtD,IAAI,MAAM,EAAE,CAAC;QACX,OAAO,EAAE,MAAM,EAAE,OAAO,EAAE,KAAK,EAAE,MAAM,EAAE,MAAM,EAAE,CAAC;IACpD,CAAC;IAED,MAAM,SAAS,GAAG,wBAAwB,CAAC,KAAK,CAAC,CAAC;IAClD,IAAI,SAAS,EAAE,CAAC;QACd,MAAM,IAAI,GAAG,kBAAkB,CAAC,KAAK,EAAE,SAAS,CAAC,IAAI,CAAC,CAAC;QACvD,MAAM,WAAW,GAAG,IAAI,CAAC,CAAC,CAAC,0BAA0B,CAAC,KAAK,EAAE,IAAI,EAAE,SAAS,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;QACxF,OAAO,wBAAwB,CAAC,KAAK,EAAE,WAAW,CAAC,CAAC;IACtD,CAAC;IAED,MAAM,QAAQ,GAAG,wBAAwB,CAAC,KAAK,CAAC,CAAC;IACjD,MAAM,IAAI,GAAG,kBAAkB,CAAC,KAAK,EAAE,QAAQ,CAAC,IAAI,CAAC,CAAC;IACtD,IAAI,IAAI,EAAE,CAAC;QACT,MAAM,WAAW,GAAG,CAAC,KAAK,CAAC,MAAM,CAAC,GAAG,CAAC,eAAe,CAAC,IAAI,CAAC,CAAC,EAAE,MAAM,IAAI,EAAE,CAAC,CAAC,MAAM,CAAC,CAAC,UAAU,EAAE,EAAE;YAChG,IAAI,QAAQ,CAAC,IAAI,KAAK,SAAS,IAAI,UAAU,CAAC,KAAK,CAAC,KAAK,CAAC,IAAI,KAAK,QAAQ,CAAC,IAAI;gBAAE,OAAO,KAAK,CAAC;YAC/F,IAAI,QAAQ,CAAC,MAAM,KAAK,SAAS,IAAI,UAAU,CAAC,KAAK,CAAC,KAAK,CAAC,MAAM,KAAK,QAAQ,CAAC,MAAM;gBAAE,OAAO,KAAK,CAAC;YACrG,OAAO,IAAI,CAAC;QACd,CAAC,CAAC,CAAC;QACH,OAAO,wBAAwB,CAAC,KAAK,EAAE,WAAW,CAAC,CAAC;IACtD,CAAC;IAED,MAAM,WAAW,GAAgB,EAAE,CAAC;IACpC,KAAK,MAAM,MAAM,IAAI,KAAK,CAAC,MAAM,CAAC,MAAM,EAAE,EAAE,CAAC;QAC3C,KAAK,MAAM,UAAU,IAAI,MAAM,CAAC,MAAM,EAAE,CAAC;YACvC,IAAI,UAAU,CAAC,SAAS,KAAK,KAAK;gBAAE,WAAW,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC;QACnE,CAAC;IACH,CAAC;IACD,OAAO,wBAAwB,CAAC,KAAK,EAAE,WAAW,CAAC,CAAC;AACtD,CAAC;AAED,SAAS,kBAAkB,CAAC,KAAmB,EAAE,IAAY;IAC3D,MAAM,UAAU,GAAG,aAAa,CAAC,IAAI,CAAC,CAAC;IACvC,IAAI,KAAK,CAAC,MAAM,CAAC,GAAG,CAAC,eAAe,CAAC,UAAU,CAAC,CAAC;QAAE,OAAO,UAAU,CAAC;IACrE,IAAI,CAAC,KAAK,CAAC,WAAW;QAAE,OAAO,SAAS,CAAC;IACzC,MAAM,MAAM,GAAG,aAAa,CAAC,uBAAuB,CAAC,KAAK,CAAC,WAAW,EAAE,IAAI,CAAC,CAAC,CAAC;IAC/E,OAAO,KAAK,CAAC,MAAM,CAAC,GAAG,CAAC,eAAe,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,SAAS,CAAC;AACxE,CAAC;AAED,SAAS,wBAAwB,CAAC,KAAmB,EAAE,KAAa;IAClE,MAAM,KAAK,GAAG,KAAK,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC;IAChC,IAAI,KAAK,CAAC,MAAM,KAAK,CAAC,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC;QAAE,OAAO,IAAI,CAAC;IACrE,MAAM,IAAI,GAAG,kBAAkB,CAAC,KAAK,EAAE,KAAK,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC;IACvD,IAAI,CAAC,IAAI;QAAE,OAAO,IAAI,CAAC;IACvB,MAAM,IAAI,GAAG,KAAK,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC;IAC5B,MAAM,UAAU,GAAG,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC;IACpC,MAAM,UAAU,GAAG,KAAK,CAAC,MAAM;SAC5B,GAAG,CAAC,eAAe,CAAC,IAAI,CAAC,CAAC;QAC3B,EAAE,MAAM,CAAC,IAAI,CAAC,CAAC,SAAS,EAAE,EAAE,CAAC,SAAS,CAAC,SAAS,KAAK,IAAI,IAAI,CAAC,SAAS,CAAC,KAAK,CAAC,KAAK,CAAC,KAAK,IAAI,CAAC,CAAC,KAAK,UAAU,CAAC,CAAC;IAClH,IAAI,CAAC,UAAU;QAAE,OAAO,IAAI,CAAC;IAC7B,OAAO,EAAE,MAAM,EAAE,QAAQ,CAAC,UAAU,CAAC,EAAE,UAAU,EAAE,CAAC;AACtD,CAAC;AAED,SAAS,wBAAwB,CAAC,KAAa,EAAE,WAAiC;IAChF,MAAM,UAAU,GAAG,WAAW;SAC3B,GAAG,CAAC,CAAC,UAAU,EAAE,EAAE,CAAC,CAAC,EAAE,MAAM,EAAE,QAAQ,CAAC,UAAU,CAAC,EAAE,UAAU,EAAE,CAAC,CAAC;SACnE,IAAI,CAAC,4BAA4B,CAAC,CAAC;IACtC,IAAI,UAAU,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QAC5B,OAAO,EAAE,MAAM,EAAE,OAAO,EAAE,KAAK,EAAE,MAAM,EAAE,UAAU,CAAC,CAAC,CAAE,EAAE,CAAC;IAC5D,CAAC;IACD,IAAI,UAAU,CAAC,MAAM;QAAE,OAAO,EAAE,MAAM,EAAE,WAAW,EAAE,KAAK,EAAE,UAAU,EAAE,CAAC;IACzE,OAAO,EAAE,MAAM,EAAE,WAAW,EAAE,KAAK,EAAE,CAAC;AACxC,CAAC;AAED,SAAS,4BAA4B,CAAC,IAA0B,EAAE,KAA2B;IAC3F,OAAO,CACL,IAAI,CAAC,UAAU,CAAC,IAAI,CAAC,aAAa,CAAC,KAAK,CAAC,UAAU,CAAC,IAAI,CAAC;QACzD,CAAC,IAAI,CAAC,UAAU,CAAC,KAAK,CAAC,KAAK,CAAC,KAAK,IAAI,CAAC,CAAC,GAAG,CAAC,KAAK,CAAC,UAAU,CAAC,KAAK,CAAC,KAAK,CAAC,KAAK,IAAI,CAAC,CAAC;QACpF,IAAI,CAAC,UAAU,CAAC,SAAS,CAAC,aAAa,CAAC,KAAK,CAAC,UAAU,CAAC,SAAS,CAAC,CACpE,CAAC;AACJ,CAAC;AAED,MAAM,UAAU,eAAe,CAAC,KAAmB,EAAE,EAAgB;IACnE,IAAI,CAAC,EAAE;QAAE,OAAO,IAAI,CAAC;IACrB,MAAM,KAAK,GAAG,EAAE,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC;IAC7B,IAAI,KAAK,CAAC,MAAM,GAAG,CAAC;QAAE,OAAO,IAAI,CAAC;IAClC,MAAM,OAAO,GAAG,KAAK,CAAC,CAAC,CAAE,CAAC;IAC1B,MAAM,SAAS,GAAG,KAAK,CAAC,CAAC,CAAE,CAAC;IAC5B,MAAM,QAAQ,GAAG,KAAK,CAAC,CAAC,CAAE,CAAC;IAC3B,MAAM,IAAI,GAAG,aAAa,CAAC,OAAO,CAAC,CAAC;IACpC,MAAM,UAAU,GAAG,MAAM,CAAC,QAAQ,CAAC,CAAC;IACpC,MAAM,GAAG,GAAG,KAAK,CAAC,MAAM,CAAC,GAAG,CAAC,eAAe,CAAC,IAAI,CAAC,CAAC,CAAC;IACpD,IAAI,CAAC,GAAG;QAAE,OAAO,IAAI,CAAC;IACtB,MAAM,KAAK,GAAG,GAAG,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,GAAG,EAAE,EAAE,CAAC,GAAG,CAAC,SAAS,KAAK,SAAS,IAAI,CAAC,GAAG,CAAC,KAAK,EAAE,KAAK,EAAE,KAAK,IAAI,CAAC,CAAC,KAAK,UAAU,CAAC,CAAC;IACrH,IAAI,KAAK;QAAE,OAAO,KAAK,CAAC;IACxB,MAAM,MAAM,GAAG,GAAG,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,GAAG,EAAE,EAAE,CAAC,GAAG,CAAC,SAAS,KAAK,SAAS,CAAC,CAAC;IACrE,OAAO,MAAM,IAAI,IAAI,CAAC;AACxB,CAAC;AAED,MAAM,UAAU,eAAe,CAAC,KAAmB,EAAE,EAAgB;IACnE,IAAI,CAAC,EAAE;QAAE,OAAO,IAAI,CAAC;IACrB,MAAM,KAAK,GAAG,EAAE,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC;IAC7B,IAAI,KAAK,CAAC,MAAM,KAAK,CAAC,IAAI,KAAK,CAAC,CAAC,CAAC,KAAK,QAAQ,EAAE,CAAC;QAChD,MAAM,OAAO,GAAG,KAAK,CAAC,CAAC,CAAE,CAAC;QAC1B,MAAM,KAAK,GAAG,KAAK,CAAC,CAAC,CAAE,CAAC;QACxB,MAAM,IAAI,GAAG,aAAa,CAAC,OAAO,CAAC,CAAC;QACpC,MAAM,GAAG,GAAG,KAAK,CAAC,MAAM,CAAC,GAAG,CAAC,eAAe,CAAC,IAAI,CAAC,CAAC,CAAC;QACpD,IAAI,CAAC,GAAG;YAAE,OAAO,IAAI,CAAC;QAEtB,MAAM,KAAK,GAAG,GAAG,CAAC,OAAO,CAAC,IAAI,CAC5B,CAAC,GAAG,EAA4C,EAAE,CAAC,GAAG,CAAC,IAAI,KAAK,OAAO,IAAI,GAAG,CAAC,KAAK,KAAK,KAAK,CAC/F,CAAC;QACF,IAAI,KAAK,EAAE,CAAC;YACV,MAAM,MAAM,GAAG,eAAe,CAAC,KAAK,EAAE,KAAK,EAAE,KAAK,CAAC,QAAQ,CAAC,CAAC;YAC7D,IAAI,MAAM,IAAI,CAAC,CAAC,WAAW,IAAI,MAAM,CAAC;gBAAE,OAAO,MAAM,CAAC;YACtD,MAAM,MAAM,GAAG,OAAO,KAAK,CAAC,QAAQ,KAAK,QAAQ,CAAC,CAAC,CAAC,KAAK,CAAC,QAAQ,CAAC,CAAC,CAAC,SAAS,CAAC;YAC/E,IAAI,MAAM,EAAE,CAAC;gBACX,MAAM,GAAG,GAAG,aAAa,CAAC,KAAK,EAAE,MAAM,EAAE,KAAK,CAAC,QAAQ,CAAC,CAAC;gBACzD,IAAI,GAAG,EAAE,IAAI,KAAK,UAAU;oBAAE,OAAO,GAAG,CAAC,GAAG,CAAC;YAC/C,CAAC;QACH,CAAC;QAED,MAAM,aAAa,GAAG,GAAG,CAAC,OAAO,CAAC,IAAI,CACpC,CAAC,GAAG,EAA8C,EAAE,CAAC,GAAG,CAAC,IAAI,KAAK,SAAS,IAAI,GAAG,CAAC,KAAK,KAAK,KAAK,CACnG,CAAC;QACF,IAAI,aAAa,EAAE,CAAC;YAClB,MAAM,MAAM,GAAG,eAAe,CAAC,KAAK,EAAE,aAAa,EAAE,SAAS,CAAC,CAAC;YAChE,IAAI,MAAM,IAAI,CAAC,CAAC,WAAW,IAAI,MAAM,CAAC;gBAAE,OAAO,MAAM,CAAC;YACtD,MAAM,MAAM,GAAG,OAAO,aAAa,CAAC,QAAQ,KAAK,QAAQ,CAAC,CAAC,CAAC,aAAa,CAAC,QAAQ,CAAC,CAAC,CAAC,SAAS,CAAC;YAC/F,IAAI,MAAM,EAAE,CAAC;gBACX,MAAM,GAAG,GAAG,aAAa,CAAC,KAAK,EAAE,MAAM,EAAE,SAAS,CAAC,CAAC;gBACpD,IAAI,GAAG,EAAE,IAAI,KAAK,UAAU;oBAAE,OAAO,GAAG,CAAC,GAAG,CAAC;gBAC7C,MAAM,YAAY,GAAG,KAAK,CAAC,MAAM,CAAC,GAAG,CAAC,eAAe,CAAC,MAAM,CAAC,CAAC,CAAC;gBAC/D,MAAM,KAAK,GAAG,YAAY,EAAE,OAAO,CAAC,IAAI,CACtC,CAAC,KAAK,EAA4C,EAAE,CAAC,KAAK,CAAC,IAAI,KAAK,OAAO,CAC5E,CAAC;gBACF,IAAI,KAAK;oBAAE,OAAO,KAAK,CAAC,MAAM,CAAC;YACjC,CAAC;QACH,CAAC;QAED,MAAM,eAAe,GAAG,GAAG,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC,GAAG,EAAE,EAAE,CAAC,GAAG,CAAC,IAAI,KAAK,WAAW,IAAI,GAAG,CAAC,OAAO,KAAK,KAAK,CAAC,CAAC;QACrG,IAAI,eAAe,EAAE,CAAC;YACpB,MAAM,MAAM,GAAG,OAAO,eAAe,CAAC,QAAQ,KAAK,QAAQ,CAAC,CAAC,CAAC,eAAe,CAAC,QAAQ,CAAC,CAAC,CAAC,SAAS,CAAC;YACnG,IAAI,MAAM,EAAE,CAAC;gBACX,MAAM,YAAY,GAAG,KAAK,CAAC,MAAM,CAAC,GAAG,CAAC,eAAe,CAAC,MAAM,CAAC,CAAC,CAAC;gBAC/D,MAAM,KAAK,GAAG,YAAY,EAAE,OAAO,CAAC,IAAI,CACtC,CAAC,KAAK,EAA4C,EAAE,CAAC,KAAK,CAAC,IAAI,KAAK,OAAO,CAC5E,CAAC;gBACF,IAAI,KAAK;oBAAE,OAAO,KAAK,CAAC,MAAM,CAAC;gBAC/B,MAAM,UAAU,GAAG,YAAY,EAAE,MAAM,EAAE,CAAC,CAAC,CAAC,CAAC;gBAC7C,IAAI,UAAU;oBAAE,OAAO,UAAU,CAAC;YACpC,CAAC;QACH,CAAC;QAED,OAAO,IAAI,CAAC;IACd,CAAC;IAED,OAAO,eAAe,CAAC,KAAK,EAAE,EAAE,CAAC,CAAC;AACpC,CAAC;AAED,MAAM,UAAU,kBAAkB,CAAC,KAAmB,EAAE,EAAgB;IACtE,MAAM,GAAG,GAAG,eAAe,CAAC,KAAK,EAAE,EAAE,CAAC,CAAC;IACvC,IAAI,GAAG;QAAE,OAAO,EAAE,MAAM,EAAE,IAAI,EAAE,UAAU,EAAE,GAAG,EAAE,CAAC;IAClD,OAAO,EAAE,MAAM,EAAE,WAAW,EAAE,MAAM,EAAE,mCAAmC,EAAE,CAAC;AAC9E,CAAC;AAED,MAAM,CAAC,KAAK,UAAU,kBAAkB,CAAC,KAAmB,EAAE,EAAgB;IAC5E,MAAM,GAAG,GAAG,eAAe,CAAC,KAAK,EAAE,EAAE,CAAC,CAAC;IACvC,IAAI,CAAC,GAAG,EAAE,CAAC;QACT,OAAO;YACL,MAAM,EAAE,WAAW;YACnB,MAAM,EAAE,mCAAmC;SACnC,CAAC;IACb,CAAC;IACD,OAAO,MAAM,cAAc,CAAC,KAAK,EAAE,EAAE,GAAG,EAAE,CAAC,CAAC;AAC9C,CAAC;AAED,MAAM,UAAU,WAAW,CAAC,KAAmB,EAAE,IAAkD;IACjG,MAAM,GAAG,GAAqB,EAAE,CAAC;IACjC,MAAM,KAAK,GAAG,IAAI,EAAE,IAAI,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,MAAM,EAAE,EAAE,CAAC,MAAM,EAAE,EAAE,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;IAEpG,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;QACzB,MAAM,GAAG,GAAG,KAAK,CAAC,MAAM,CAAC,GAAG,CAAC,eAAe,CAAC,IAAI,CAAC,CAAC,CAAC;QACpD,IAAI,CAAC,GAAG;YAAE,SAAS;QACnB,MAAM,WAAW,GAAG,GAAG,CAAC,IAAI,CAAC;QAC7B,KAAK,MAAM,GAAG,IAAI,GAAG,CAAC,MAAM,EAAE,CAAC;YAC7B,GAAG,CAAC,IAAI,CAAC;gBACP,EAAE,EAAE,QAAQ,CAAC,GAAG,CAAC;gBACjB,IAAI,EAAE,WAAW;gBACjB,IAAI,EAAE,GAAG,CAAC,SAAS;gBACnB,IAAI,EAAE,GAAG,CAAC,IAAI;gBACd,KAAK,EAAE,GAAG,CAAC,KAAK;gBAChB,GAAG,CAAC,GAAG,CAAC,SAAS,CAAC,CAAC,CAAC,EAAE,SAAS,EAAE,GAAG,CAAC,SAAS,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;aACvD,CAAC,CAAC;QACL,CAAC;QACD,IAAI,IAAI,EAAE,cAAc,EAAE,CAAC;YACzB,KAAK,MAAM,GAAG,IAAI,GAAG,CAAC,OAAO,EAAE,CAAC;gBAC9B,IAAI,GAAG,CAAC,IAAI,KAAK,OAAO,IAAI,GAAG,CAAC,IAAI,KAAK,SAAS,EAAE,CAAC;oBACnD,GAAG,CAAC,IAAI,CAAC;wBACP,EAAE,EAAE,GAAG,WAAW,KAAK,GAAG,CAAC,KAAK,UAAU;wBAC1C,IAAI,EAAE,WAAW;wBACjB,IAAI,EAAE,GAAG,CAAC,KAAK;wBACf,IAAI,EAAE,QAAQ;qBACf,CAAC,CAAC;gBACL,CAAC;qBAAM,IAAI,GAAG,CAAC,IAAI,KAAK,WAAW,EAAE,CAAC;oBACpC,GAAG,CAAC,IAAI,CAAC;wBACP,EAAE,EAAE,GAAG,WAAW,KAAK,GAAG,CAAC,OAAO,UAAU;wBAC5C,IAAI,EAAE,WAAW;wBACjB,IAAI,EAAE,GAAG,CAAC,OAAO;wBACjB,IAAI,EAAE,iBAAiB;qBACxB,CAAC,CAAC;gBACL,CAAC;YACH,CAAC;QACH,CAAC;IACH,CAAC;IAED,OAAO,GAAG,CAAC;AACb,CAAC;AAED,MAAM,UAAU,aAAa,CAAC,KAAmB;IAC/C,MAAM,GAAG,GAAe,EAAE,CAAC;IAC3B,KAAK,MAAM,GAAG,IAAI,KAAK,CAAC,MAAM,CAAC,MAAM,EAAE,EAAE,CAAC;QACxC,MAAM,OAAO,GAAG,GAAG,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,KAAK,EAAE,EAAE;YACxC,IAAI,KAAK,CAAC,IAAI,KAAK,OAAO,EAAE,CAAC;gBAC3B,OAAO;oBACL,IAAI,EAAE,KAAK,CAAC,MAAM,CAAC,SAAS;oBAC5B,IAAI,EAAE,KAAK,CAAC,MAAM,CAAC,IAAI;oBACvB,UAAU,EAAE,KAAK,CAAC,UAAU;iBAC7B,CAAC;YACJ,CAAC;YACD,IAAI,KAAK,CAAC,IAAI,KAAK,UAAU,EAAE,CAAC;gBAC9B,OAAO;oBACL,IAAI,EAAE,KAAK,CAAC,eAAe;oBAC3B,IAAI,EAAE,UAAU;oBAChB,UAAU,EAAE,KAAK,CAAC,UAAU;oBAC5B,MAAM,EAAE,EAAE,IAAI,EAAE,KAAK,CAAC,UAAU,EAAE,IAAI,EAAE,KAAK,CAAC,eAAe,EAAE;iBAChE,CAAC;YACJ,CAAC;YACD,IAAI,KAAK,CAAC,IAAI,KAAK,mBAAmB,EAAE,CAAC;gBACvC,OAAO;oBACL,IAAI,EAAE,GAAG;oBACT,IAAI,EAAE,mBAAmB;oBACzB,UAAU,EAAE,KAAK,CAAC,UAAU;oBAC5B,MAAM,EAAE,EAAE,IAAI,EAAE,KAAK,CAAC,UAAU,EAAE,IAAI,EAAE,GAAG,EAAE;iBAC9C,CAAC;YACJ,CAAC;YACD,OAAO;gBACL,IAAI,EAAE,GAAG;gBACT,IAAI,EAAE,YAAY;gBAClB,UAAU,EAAE,GAAG;gBACf,MAAM,EAAE,EAAE,IAAI,EAAE,KAAK,CAAC,UAAU,EAAE,IAAI,EAAE,GAAG,EAAE;aAC9C,CAAC;QACJ,CAAC,CAAC,CAAC;QACH,IAAI,OAAO,CAAC,MAAM,EAAE,CAAC;YACnB,GAAG,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,GAAG,CAAC,IAAI,EAAE,OAAO,EAAE,CAAC,CAAC;QACxC,CAAC;IACH,CAAC;IACD,OAAO,GAAG,CAAC;AACb,CAAC"}

package/dist/indexer/type-hierarchy.d.ts

@@ -0,0 +1,52 @@
+import type { SymbolEdge, SymbolGraph } from "../graphs/symbol-graph.js";
+import type { ProjectIndex } from "./types.js";
+export type TypeHierarchyDirection = "super" | "sub";
+export type TypeHierarchyRelationKind = "extends" | "implements" | "trait" | "mixin" | "unknown";
+export type TypeHierarchyRelationMatch = {
+    targetId: string;
+    relation: TypeHierarchyRelationKind;
+    depth: number;
+    site?: SymbolEdge["site"];
+};
+export type TypeHierarchyResult = {
+    status: "ok";
+    targetId: string;
+    direction: TypeHierarchyDirection;
+    relations: TypeHierarchyRelationMatch[];
+    omitted: number;
+    limit: number;
+} | {
+    status: "not_found" | "invalid_target";
+    reason: string;
+};
+export type ImplementationMatch = {
+    symbolId: string;
+    implementingTypeId?: string;
+    relation: TypeHierarchyRelationKind;
+    site?: SymbolEdge["site"];
+};
+export type UnresolvedImplementationMatch = {
+    symbolId: string;
+    implementingTypeId: string;
+    site?: SymbolEdge["site"];
+};
+export type ImplementationsResult = {
+    status: "ok";
+    targetId: string;
+    implementations: ImplementationMatch[];
+    omitted: number;
+    ambiguous: number;
+    unresolved: UnresolvedImplementationMatch[];
+    limit: number;
+} | {
+    status: "not_found" | "invalid_target" | "unsupported_target";
+    reason: string;
+};
+export declare function findTypeHierarchy(graph: SymbolGraph, targetId: string, direction: TypeHierarchyDirection, options?: {
+    depth?: number;
+    limit?: number;
+}): TypeHierarchyResult;
+export declare function findImplementations(index: ProjectIndex, graph: SymbolGraph, targetId: string, options?: {
+    limit?: number;
+}): ImplementationsResult;
+//# sourceMappingURL=type-hierarchy.d.ts.map

package/dist/indexer/type-hierarchy.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"type-hierarchy.d.ts","sourceRoot":"","sources":["../../src/indexer/type-hierarchy.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,UAAU,EAAE,WAAW,EAAc,MAAM,2BAA2B,CAAC;AAErF,OAAO,KAAK,EAAE,YAAY,EAAE,MAAM,YAAY,CAAC;AAE/C,MAAM,MAAM,sBAAsB,GAAG,OAAO,GAAG,KAAK,CAAC;AACrD,MAAM,MAAM,yBAAyB,GAAG,SAAS,GAAG,YAAY,GAAG,OAAO,GAAG,OAAO,GAAG,SAAS,CAAC;AAEjG,MAAM,MAAM,0BAA0B,GAAG;IACvC,QAAQ,EAAE,MAAM,CAAC;IACjB,QAAQ,EAAE,yBAAyB,CAAC;IACpC,KAAK,EAAE,MAAM,CAAC;IACd,IAAI,CAAC,EAAE,UAAU,CAAC,MAAM,CAAC,CAAC;CAC3B,CAAC;AAEF,MAAM,MAAM,mBAAmB,GAC3B;IACE,MAAM,EAAE,IAAI,CAAC;IACb,QAAQ,EAAE,MAAM,CAAC;IACjB,SAAS,EAAE,sBAAsB,CAAC;IAClC,SAAS,EAAE,0BAA0B,EAAE,CAAC;IACxC,OAAO,EAAE,MAAM,CAAC;IAChB,KAAK,EAAE,MAAM,CAAC;CACf,GACD;IAAE,MAAM,EAAE,WAAW,GAAG,gBAAgB,CAAC;IAAC,MAAM,EAAE,MAAM,CAAA;CAAE,CAAC;AAE/D,MAAM,MAAM,mBAAmB,GAAG;IAChC,QAAQ,EAAE,MAAM,CAAC;IACjB,kBAAkB,CAAC,EAAE,MAAM,CAAC;IAC5B,QAAQ,EAAE,yBAAyB,CAAC;IACpC,IAAI,CAAC,EAAE,UAAU,CAAC,MAAM,CAAC,CAAC;CAC3B,CAAC;AACF,MAAM,MAAM,6BAA6B,GAAG;IAC1C,QAAQ,EAAE,MAAM,CAAC;IACjB,kBAAkB,EAAE,MAAM,CAAC;IAC3B,IAAI,CAAC,EAAE,UAAU,CAAC,MAAM,CAAC,CAAC;CAC3B,CAAC;AAEF,MAAM,MAAM,qBAAqB,GAC7B;IACE,MAAM,EAAE,IAAI,CAAC;IACb,QAAQ,EAAE,MAAM,CAAC;IACjB,eAAe,EAAE,mBAAmB,EAAE,CAAC;IACvC,OAAO,EAAE,MAAM,CAAC;IAChB,SAAS,EAAE,MAAM,CAAC;IAClB,UAAU,EAAE,6BAA6B,EAAE,CAAC;IAC5C,KAAK,EAAE,MAAM,CAAC;CACf,GACD;IAAE,MAAM,EAAE,WAAW,GAAG,gBAAgB,GAAG,oBAAoB,CAAC;IAAC,MAAM,EAAE,MAAM,CAAA;CAAE,CAAC;AAmBtF,wBAAgB,iBAAiB,CAC/B,KAAK,EAAE,WAAW,EAClB,QAAQ,EAAE,MAAM,EAChB,SAAS,EAAE,sBAAsB,EACjC,OAAO,CAAC,EAAE;IAAE,KAAK,CAAC,EAAE,MAAM,CAAC;IAAC,KAAK,CAAC,EAAE,MAAM,CAAA;CAAE,GAC3C,mBAAmB,CA6CrB;AAED,wBAAgB,mBAAmB,CACjC,KAAK,EAAE,YAAY,EACnB,KAAK,EAAE,WAAW,EAClB,QAAQ,EAAE,MAAM,EAChB,OAAO,CAAC,EAAE;IAAE,KAAK,CAAC,EAAE,MAAM,CAAA;CAAE,GAC3B,qBAAqB,CAsHvB"}

package/dist/indexer/type-hierarchy.js

@@ -0,0 +1,296 @@
+import { resolveSymbolId } from "./symbols.js";
+const TYPE_HIERARCHY_CACHE = new WeakMap();
+const DEFAULT_HIERARCHY_LIMIT = 100;
+const MAX_HIERARCHY_LIMIT = 500;
+const MAX_HIERARCHY_DEPTH = 10;
+export function findTypeHierarchy(graph, targetId, direction, options) {
+    const target = graph.nodes.get(targetId);
+    if (!target)
+        return { status: "not_found", reason: "No matching symbol for handle." };
+    if (!isTypeNode(target)) {
+        return { status: "invalid_target", reason: "Type hierarchy requires a class, interface, or type symbol." };
+    }
+    const depthLimit = normalizeDepth(options?.depth);
+    const limit = normalizeLimit(options?.limit);
+    const index = getTypeHierarchyIndex(graph);
+    const adjacency = direction === "super" ? index.outgoing : index.incoming;
+    const queue = [{ id: targetId, depth: 0 }];
+    const visited = new Set([targetId]);
+    const relations = [];
+    for (let cursor = 0; cursor < queue.length; cursor += 1) {
+        const current = queue[cursor];
+        if (current.depth >= depthLimit)
+            continue;
+        const edges = [...(adjacency.get(current.id) ?? [])].sort((left, right) => compareHierarchyEdges(graph, left, right));
+        for (const edge of edges) {
+            const nextId = direction === "super" ? edge.to : edge.from;
+            if (visited.has(nextId))
+                continue;
+            visited.add(nextId);
+            const depth = current.depth + 1;
+            relations.push({
+                targetId: nextId,
+                relation: edge.relation,
+                depth,
+                ...(edge.site ? { site: edge.site } : {}),
+            });
+            queue.push({ id: nextId, depth });
+        }
+    }
+    relations.sort((left, right) => compareRelations(graph, left, right));
+    return {
+        status: "ok",
+        targetId,
+        direction,
+        relations: relations.slice(0, limit),
+        omitted: Math.max(0, relations.length - limit),
+        limit,
+    };
+}
+export function findImplementations(index, graph, targetId, options) {
+    const targetNode = graph.nodes.get(targetId);
+    const targetDef = resolveSymbolId(index, targetId);
+    if (!targetNode || !targetDef)
+        return { status: "not_found", reason: "No matching symbol for handle." };
+    const limit = normalizeLimit(options?.limit);
+    const hierarchy = getTypeHierarchyIndex(graph);
+    if (isTypeNode(targetNode)) {
+        const rootRelations = implementationRootRelations(hierarchy, targetId, targetNode);
+        if (!rootRelations.size) {
+            return {
+                status: "unsupported_target",
+                reason: "Implementation lookup requires an interface, trait, or abstract type.",
+            };
+        }
+        const matches = collectTypeImplementations(graph, hierarchy, targetId, rootRelations);
+        return {
+            status: "ok",
+            targetId,
+            implementations: matches.slice(0, limit),
+            omitted: Math.max(0, matches.length - limit),
+            ambiguous: 0,
+            unresolved: [],
+            limit,
+        };
+    }
+    const ownerEdge = graph.edges.find((edge) => edge.from === targetId && edge.label === "member_of");
+    const ownerId = ownerEdge?.to;
+    const ownerNode = ownerId ? graph.nodes.get(ownerId) : undefined;
+    const ownerDef = ownerId ? resolveSymbolId(index, ownerId) : null;
+    if (!ownerId || !ownerNode || !ownerDef) {
+        return {
+            status: "unsupported_target",
+            reason: "Implementation lookup requires an interface, trait, abstract type, or member owned by one.",
+        };
+    }
+    const sameNameMembers = graph.edges
+        .filter((edge) => edge.to === ownerId && edge.label === "member_of")
+        .map((edge) => edge.from)
+        .filter((id) => graph.nodes.get(id)?.name === targetDef.localName);
+    const sameIdentityMembers = targetNode.memberArity === undefined
+        ? sameNameMembers
+        : sameNameMembers.filter((id) => graph.nodes.get(id)?.memberArity === targetNode.memberArity);
+    if (sameIdentityMembers.length > 1) {
+        return {
+            status: "unsupported_target",
+            reason: "Member implementation lookup is ambiguous because compatible overload identity is unavailable.",
+        };
+    }
+    const rootRelations = implementationRootRelations(hierarchy, ownerId, ownerNode);
+    if (targetNode.implementationTarget)
+        rootRelations.add("extends");
+    if (!rootRelations.size) {
+        return {
+            status: "unsupported_target",
+            reason: "Member implementation lookup requires a proven interface, trait, or abstract override relationship.",
+        };
+    }
+    const typeMatches = collectTypeImplementations(graph, hierarchy, ownerId, rootRelations);
+    const proofEdges = graph.edges.filter((edge) => edge.to === targetId && (edge.label === "implements_member" || edge.label === "overrides"));
+    const memberMatches = new Map();
+    for (const proof of proofEdges) {
+        const implementingTypeId = graph.edges.find((edge) => edge.from === proof.from && edge.label === "member_of")?.to;
+        if (!implementingTypeId)
+            continue;
+        const relation = proof.label === "overrides"
+            ? "extends"
+            : (hierarchy.outgoing.get(implementingTypeId) ?? []).find((edge) => edge.to === ownerId)?.relation;
+        if (!relation)
+            continue;
+        memberMatches.set(proof.from, {
+            symbolId: proof.from,
+            implementingTypeId,
+            relation,
+            ...(proof.site ? { site: proof.site } : {}),
+        });
+    }
+    const provenImplementingTypeIds = new Set();
+    for (const match of memberMatches.values()) {
+        if (match.implementingTypeId)
+            provenImplementingTypeIds.add(match.implementingTypeId);
+    }
+    const unresolved = [];
+    let ambiguous = 0;
+    for (const typeMatch of typeMatches) {
+        const hasProvenImplementation = provenImplementingTypeIds.has(typeMatch.symbolId);
+        const unresolvedMembers = graph.edges
+            .filter((edge) => edge.to === typeMatch.symbolId && edge.label === "member_of")
+            .map((edge) => edge.from)
+            .filter((id) => {
+            const candidate = graph.nodes.get(id);
+            return candidate?.name === targetDef.localName && !hasProvenImplementation && !memberMatches.has(id);
+        });
+        for (const symbolId of unresolvedMembers) {
+            const unresolvedDef = resolveSymbolId(index, symbolId);
+            unresolved.push({
+                symbolId,
+                implementingTypeId: typeMatch.symbolId,
+                ...(unresolvedDef ? { site: { file: unresolvedDef.file, range: unresolvedDef.range } } : {}),
+            });
+        }
+        ambiguous += unresolvedMembers.length;
+    }
+    const sortedUnresolved = unresolved.sort((left, right) => left.symbolId.localeCompare(right.symbolId));
+    const matches = [...memberMatches.values()].sort((left, right) => compareImplementationMatches(graph, left, right));
+    const truncated = Math.max(0, matches.length - limit);
+    return {
+        status: "ok",
+        targetId,
+        implementations: matches.slice(0, limit),
+        omitted: truncated + ambiguous,
+        ambiguous,
+        unresolved: sortedUnresolved.slice(0, limit),
+        limit,
+    };
+}
+function getTypeHierarchyIndex(graph) {
+    const cached = TYPE_HIERARCHY_CACHE.get(graph);
+    if (cached)
+        return cached;
+    const outgoing = new Map();
+    const incoming = new Map();
+    for (const edge of graph.edges) {
+        const relation = hierarchyRelation(edge);
+        if (!relation)
+            continue;
+        const hierarchyEdge = {
+            from: edge.from,
+            to: edge.to,
+            relation,
+            ...(edge.site ? { site: edge.site } : {}),
+        };
+        appendEdge(outgoing, edge.from, hierarchyEdge);
+        appendEdge(incoming, edge.to, hierarchyEdge);
+    }
+    const created = { outgoing, incoming };
+    TYPE_HIERARCHY_CACHE.set(graph, created);
+    return created;
+}
+function hierarchyRelation(edge) {
+    if (edge.label === "extends")
+        return "extends";
+    if (edge.label === "implements")
+        return "implements";
+    if (edge.label === "trait")
+        return "trait";
+    if (edge.label === "mixin")
+        return "mixin";
+    return null;
+}
+function appendEdge(map, key, edge) {
+    const edges = map.get(key);
+    if (!edges) {
+        map.set(key, [edge]);
+        return;
+    }
+    const existingIndex = edges.findIndex((candidate) => candidate.from === edge.from && candidate.to === edge.to && candidate.relation === edge.relation);
+    if (existingIndex < 0) {
+        edges.push(edge);
+        return;
+    }
+    const existing = edges[existingIndex];
+    if (!existing.site && edge.site)
+        edges[existingIndex] = edge;
+}
+function collectTypeImplementations(graph, hierarchy, targetId, acceptedRootRelations) {
+    const direct = hierarchy.incoming.get(targetId) ?? [];
+    const implementationRoots = direct.filter((edge) => acceptedRootRelations.has(edge.relation));
+    const matches = new Map();
+    const queue = [];
+    for (const edge of implementationRoots) {
+        matches.set(edge.from, {
+            symbolId: edge.from,
+            relation: edge.relation,
+            ...(edge.site ? { site: edge.site } : {}),
+        });
+        queue.push(edge.from);
+    }
+    for (let cursor = 0; cursor < queue.length; cursor += 1) {
+        const current = queue[cursor];
+        for (const edge of hierarchy.incoming.get(current) ?? []) {
+            if (matches.has(edge.from))
+                continue;
+            matches.set(edge.from, {
+                symbolId: edge.from,
+                relation: edge.relation,
+                ...(edge.site ? { site: edge.site } : {}),
+            });
+            queue.push(edge.from);
+        }
+    }
+    return [...matches.values()].sort((left, right) => compareImplementationMatches(graph, left, right));
+}
+function implementationRootRelations(hierarchy, targetId, targetNode) {
+    const incoming = hierarchy.incoming.get(targetId) ?? [];
+    const relations = new Set();
+    if (targetNode.kind === "interface" || incoming.some((edge) => edge.relation === "implements")) {
+        relations.add("implements");
+    }
+    if (targetNode.kind === "type" || incoming.some((edge) => edge.relation === "trait")) {
+        relations.add("trait");
+    }
+    if (incoming.some((edge) => edge.relation === "mixin")) {
+        relations.add("mixin");
+    }
+    if (targetNode.implementationTarget)
+        relations.add("extends");
+    return relations;
+}
+function isTypeNode(node) {
+    return node.kind === "class" || node.kind === "interface" || node.kind === "type";
+}
+function compareHierarchyEdges(graph, left, right) {
+    const leftNode = graph.nodes.get(left.to) ?? graph.nodes.get(left.from);
+    const rightNode = graph.nodes.get(right.to) ?? graph.nodes.get(right.from);
+    return compareNodes(leftNode, rightNode) || left.relation.localeCompare(right.relation);
+}
+function compareRelations(graph, left, right) {
+    return left.depth - right.depth || compareNodes(graph.nodes.get(left.targetId), graph.nodes.get(right.targetId));
+}
+function compareImplementationMatches(graph, left, right) {
+    return compareNodes(graph.nodes.get(left.symbolId), graph.nodes.get(right.symbolId));
+}
+function compareNodes(left, right) {
+    if (!left && !right)
+        return 0;
+    if (!left)
+        return 1;
+    if (!right)
+        return -1;
+    return left.file.localeCompare(right.file) || left.name.localeCompare(right.name) || left.id.localeCompare(right.id);
+}
+function normalizeDepth(depth) {
+    if (depth === undefined)
+        return 1;
+    if (!Number.isInteger(depth) || depth < 1)
+        throw new Error("Hierarchy depth must be a positive integer.");
+    return Math.min(depth, MAX_HIERARCHY_DEPTH);
+}
+function normalizeLimit(limit) {
+    if (limit === undefined)
+        return DEFAULT_HIERARCHY_LIMIT;
+    if (!Number.isInteger(limit) || limit < 0)
+        throw new Error("Hierarchy limit must be a non-negative integer.");
+    return Math.min(limit, MAX_HIERARCHY_LIMIT);
+}
+//# sourceMappingURL=type-hierarchy.js.map