arceus-s 1.6.4

package/dist/core/ingestion/scope-resolution/graph-bridge/method-dispatch.js

@@ -0,0 +1,40 @@
+/**
+ * Wrap a `DefId → ancestor DefId[]` MRO map in the shared
+ * `MethodDispatchIndex` shape so it slots into
+ * `ScopeResolutionIndexes.methodDispatch`.
+ *
+ * `finalizeScopeModel` builds an empty `MethodDispatchIndex` by design
+ * (per the comment in `finalize-orchestrator.ts`). Per-language
+ * providers compute MRO their own way (Python C3 walk, Java class
+ * hierarchy, Ruby mixin chains, etc.) and use this bridge to plug the
+ * result back into the shared index shape.
+ *
+ * Next-consumer contract: any language that computes its own MRO map
+ * calls `buildPopulatedMethodDispatch(mroByOwnerDefId)` and assigns the
+ * result to `indexes.methodDispatch`. Interface-implementer tracking
+ * (`implsByInterfaceDefId`) stays empty in V1 — providers that need it
+ * can extend the return shape without breaking existing consumers.
+ */
+const EMPTY_DEFS = Object.freeze([]);
+export function buildPopulatedMethodDispatch(mroByDefId, extendsOnlyMroByDefId) {
+    const base = {
+        mroByOwnerDefId: mroByDefId,
+        implsByInterfaceDefId: new Map(),
+        mroFor(ownerDefId) {
+            return mroByDefId.get(ownerDefId) ?? EMPTY_DEFS;
+        },
+        implementorsOf() {
+            return EMPTY_DEFS;
+        },
+    };
+    if (extendsOnlyMroByDefId !== undefined) {
+        return {
+            ...base,
+            extendsOnlyMroByOwnerDefId: extendsOnlyMroByDefId,
+            extendsOnlyMroFor(ownerDefId) {
+                return extendsOnlyMroByDefId.get(ownerDefId) ?? EMPTY_DEFS;
+            },
+        };
+    }
+    return base;
+}

package/dist/core/ingestion/scope-resolution/graph-bridge/node-lookup.d.ts

@@ -0,0 +1,37 @@
+/**
+ * Build a `(filePath, name) → graphNodeId` lookup over the graph's
+ * Function/Method/Class/Constructor nodes. Two keys per node:
+ *
+ *   - simple name (`User` / `save`) — legacy fallback
+ *   - qualified name when derivable from the node id (`User.save`)
+ *
+ * The qualified key is the authoritative one when two classes in the
+ * same file define a method with the same simple name
+ * (`class User: def save` + `class Document: def save`). Without it,
+ * the simple-name key collides and every `document.save()` CALLS edge
+ * would silently target `User.save`. Method node ids encode the
+ * qualifier (`Method:file.py:User.save#1`), so we parse it back out.
+ *
+ * Language-agnostic seam. Any language provider migrating to the
+ * registry-primary path can consume this to translate scope-resolution
+ * `SymbolDefinition.nodeId` values into the legacy graph-node ID
+ * format that downstream consumers (queries, edges, MCP) expect.
+ */
+import type { NodeLabel } from '../../../../_shared/index.js';
+import type { KnowledgeGraph } from '../../../graph/types.js';
+export type GraphNodeLookup = ReadonlyMap<string, string>;
+/**
+ * Build a qualified-key string in a separate keyspace from simple-key
+ * strings. Prefix `<q>` can't appear in a valid filePath on any OS, so
+ * no collision between the two keyspaces is possible.
+ *
+ * Includes the node label so a top-level `def save` (Function,
+ * qualifier = `save`) doesn't alias a class method `User.save` (Method,
+ * simple name = `save`) whose Function-typed qualifier would collapse
+ * to the same simple-key slot in a single map.
+ */
+export declare function qualifiedKey(filePath: string, label: NodeLabel, qualifiedName: string): string;
+/** Simple-name key (legacy fallback keyspace — no `<q>` prefix). */
+export declare function simpleKey(filePath: string, name: string): string;
+export declare function buildGraphNodeLookup(graph: KnowledgeGraph): GraphNodeLookup;
+export declare function isLinkableLabel(label: NodeLabel): boolean;

package/dist/core/ingestion/scope-resolution/graph-bridge/node-lookup.js

@@ -0,0 +1,118 @@
+/**
+ * Build a `(filePath, name) → graphNodeId` lookup over the graph's
+ * Function/Method/Class/Constructor nodes. Two keys per node:
+ *
+ *   - simple name (`User` / `save`) — legacy fallback
+ *   - qualified name when derivable from the node id (`User.save`)
+ *
+ * The qualified key is the authoritative one when two classes in the
+ * same file define a method with the same simple name
+ * (`class User: def save` + `class Document: def save`). Without it,
+ * the simple-name key collides and every `document.save()` CALLS edge
+ * would silently target `User.save`. Method node ids encode the
+ * qualifier (`Method:file.py:User.save#1`), so we parse it back out.
+ *
+ * Language-agnostic seam. Any language provider migrating to the
+ * registry-primary path can consume this to translate scope-resolution
+ * `SymbolDefinition.nodeId` values into the legacy graph-node ID
+ * format that downstream consumers (queries, edges, MCP) expect.
+ */
+/**
+ * Parse a qualified name out of a Function/Method node id.
+ *
+ * Node id format: `${label}:${filePath}:${qualifiedName}${arityTag}`,
+ * where `arityTag` is `#<n>` (or empty). Strips the known-length
+ * label + filePath prefix so colons inside `filePath` (Windows
+ * `C:\...`) don't break the parse. Returns `undefined` when the id
+ * doesn't match the expected shape.
+ */
+function parseQualifiedFromId(id, label, filePath) {
+    const prefix = `${label}:${filePath}:`;
+    if (!id.startsWith(prefix))
+        return undefined;
+    const suffix = id.slice(prefix.length);
+    if (suffix.length === 0)
+        return undefined;
+    const hash = suffix.indexOf('#');
+    return hash === -1 ? suffix : suffix.slice(0, hash);
+}
+/**
+ * Build a qualified-key string in a separate keyspace from simple-key
+ * strings. Prefix `<q>` can't appear in a valid filePath on any OS, so
+ * no collision between the two keyspaces is possible.
+ *
+ * Includes the node label so a top-level `def save` (Function,
+ * qualifier = `save`) doesn't alias a class method `User.save` (Method,
+ * simple name = `save`) whose Function-typed qualifier would collapse
+ * to the same simple-key slot in a single map.
+ */
+export function qualifiedKey(filePath, label, qualifiedName) {
+    return `<q>:${filePath}::${label}::${qualifiedName}`;
+}
+/** Simple-name key (legacy fallback keyspace — no `<q>` prefix). */
+export function simpleKey(filePath, name) {
+    return `${filePath}::${name}`;
+}
+export function buildGraphNodeLookup(graph) {
+    const lookup = new Map();
+    for (const node of graph.iterNodes()) {
+        const props = node.properties;
+        if (props.filePath === undefined || props.name === undefined)
+            continue;
+        if (!isLinkableLabel(node.label))
+            continue;
+        // Primary key: fully-qualified name + label, in a separate
+        // keyspace from simple names. Class nodes carry `qualifiedName`
+        // in their properties (set by the parsing processor).
+        // Method/Function nodes do not, so derive the qualifier from the
+        // node id — that's where the parse-phase encoded it. Including
+        // the label avoids a collision when a free Function's qualifier
+        // happens to equal a Method's simple name (e.g. top-level
+        // `def save` vs `class User: def save`).
+        const qualified = props.qualifiedName ?? parseQualifiedFromId(node.id, node.label, props.filePath);
+        if (qualified !== undefined && qualified.length > 0) {
+            const qKey = qualifiedKey(props.filePath, node.label, qualified);
+            if (!lookup.has(qKey))
+                lookup.set(qKey, node.id);
+            // Overload-disambiguating key: include parameter types so two
+            // same-arity overloads (e.g. `Lookup(int)` vs `Lookup(string)`)
+            // map to distinct graph nodes. Legacy parse-phase encodes the
+            // type tag into the node id; we register both that node id and
+            // a parameter-types-suffixed key so resolveDefGraphId can find
+            // the right overload by matching its def's parameterTypes.
+            const pTypes = props.parameterTypes;
+            if (pTypes !== undefined && pTypes.length > 0 && node.label === 'Method') {
+                const pKey = qualifiedKey(props.filePath, node.label, `${qualified}~${pTypes.join(',')}`);
+                // Each overload is unique — set unconditionally.
+                lookup.set(pKey, node.id);
+            }
+        }
+        // Fallback key: simple name. First-wins within a file — used when
+        // the caller doesn't know the qualifier (unqualified free-call
+        // fallback, cross-file resolution where MethodRegistry already
+        // disambiguated the owner).
+        const sKey = simpleKey(props.filePath, props.name);
+        if (!lookup.has(sKey))
+            lookup.set(sKey, node.id);
+    }
+    return lookup;
+}
+export function isLinkableLabel(label) {
+    return (label === 'Function' ||
+        label === 'Method' ||
+        label === 'Constructor' ||
+        label === 'Class' ||
+        label === 'Interface' ||
+        label === 'Struct' ||
+        label === 'Enum' ||
+        // Trait nodes are linkable so MRO builders can bridge PHP/Rust trait
+        // defs between scope-resolution DefIds and the graph's node ids.
+        // IMPLEMENTS edges from classes to traits are otherwise invisible to
+        // the scope-resolution MRO pass.
+        label === 'Trait' ||
+        // Variable / Property are linkable too — receiver-bound write/read
+        // ACCESSES edges target field nodes (e.g. `user.name = "x"` →
+        // ACCESSES edge to User's `name` Variable/Property node).
+        label === 'Variable' ||
+        label === 'Property');
+}

package/dist/core/ingestion/scope-resolution/graph-bridge/references-to-edges.d.ts

@@ -0,0 +1,38 @@
+/**
+ * Translate the resolved `ReferenceIndex` into legacy graph edges.
+ *
+ * Per reference:
+ *   1. Resolve `fromScope` → caller graph-node id by walking the scope
+ *      chain looking for an enclosing Function/Method/Class.
+ *   2. Resolve `toDef` → target graph-node id via `nodeLookup`.
+ *   3. Emit the edge (`CALLS` / `READS` / `WRITES` / `EXTENDS` / `USES`)
+ *      with the standard reason format.
+ *
+ * Skips (without throwing) when either side fails to map — either side
+ * may legitimately not exist as a graph node (e.g. a resolved target
+ * lives in an external file that wasn't ingested into the graph).
+ *
+ * Next-consumer contract: this function is the canonical bridge from
+ * a shared `ReferenceIndex` into per-language graph edges. Every
+ * registry-primary language provider calls this exactly once with its
+ * `referenceIndex` output and its own `nodeLookup`.
+ */
+import type { Reference, ScopeId } from '../../../../_shared/index.js';
+import type { KnowledgeGraph } from '../../../graph/types.js';
+import type { ScopeResolutionIndexes } from '../../model/scope-resolution-indexes.js';
+import type { GraphNodeLookup } from '../graph-bridge/node-lookup.js';
+/**
+ * Optional opaque skip key — providers may pre-emit edges (e.g. via
+ * receiver-bound post-passes) and want this loop to skip references at
+ * the same source position so the shared resolver's potentially-wrong
+ * fallback resolution doesn't fight the precise emission. The key is
+ * `${filePath}:${startLine}:${startCol}`.
+ */
+type ReferenceSiteSkipSet = ReadonlySet<string>;
+export declare function emitReferencesViaLookup(graph: KnowledgeGraph, scopes: ScopeResolutionIndexes, referenceIndex: {
+    readonly bySourceScope: ReadonlyMap<ScopeId, readonly Reference[]>;
+}, nodeLookup: GraphNodeLookup, skipSites?: ReferenceSiteSkipSet): {
+    emitted: number;
+    skipped: number;
+};
+export {};

package/dist/core/ingestion/scope-resolution/graph-bridge/references-to-edges.js

@@ -0,0 +1,73 @@
+/**
+ * Translate the resolved `ReferenceIndex` into legacy graph edges.
+ *
+ * Per reference:
+ *   1. Resolve `fromScope` → caller graph-node id by walking the scope
+ *      chain looking for an enclosing Function/Method/Class.
+ *   2. Resolve `toDef` → target graph-node id via `nodeLookup`.
+ *   3. Emit the edge (`CALLS` / `READS` / `WRITES` / `EXTENDS` / `USES`)
+ *      with the standard reason format.
+ *
+ * Skips (without throwing) when either side fails to map — either side
+ * may legitimately not exist as a graph node (e.g. a resolved target
+ * lives in an external file that wasn't ingested into the graph).
+ *
+ * Next-consumer contract: this function is the canonical bridge from
+ * a shared `ReferenceIndex` into per-language graph edges. Every
+ * registry-primary language provider calls this exactly once with its
+ * `referenceIndex` output and its own `nodeLookup`.
+ */
+import { resolveCallerGraphId, resolveDefGraphId } from '../graph-bridge/ids.js';
+import { mapReferenceKindToEdgeType } from '../graph-bridge/edges.js';
+export function emitReferencesViaLookup(graph, scopes, referenceIndex, nodeLookup, skipSites) {
+    let emitted = 0;
+    let skipped = 0;
+    const seen = new Set();
+    for (const [fromScope, refs] of referenceIndex.bySourceScope) {
+        const callerGraphId = resolveCallerGraphId(fromScope, scopes, nodeLookup);
+        if (callerGraphId === undefined) {
+            skipped += refs.length;
+            continue;
+        }
+        const fromScopeMeta = scopes.scopeTree.getScope(fromScope);
+        const fromFilePath = fromScopeMeta?.filePath;
+        for (const ref of refs) {
+            if (skipSites !== undefined && fromFilePath !== undefined) {
+                const siteKey = `${fromFilePath}:${ref.atRange.startLine}:${ref.atRange.startCol}`;
+                if (skipSites.has(siteKey)) {
+                    skipped++;
+                    continue;
+                }
+            }
+            const targetDef = scopes.defs.get(ref.toDef);
+            if (targetDef === undefined) {
+                skipped++;
+                continue;
+            }
+            const targetGraphId = resolveDefGraphId(targetDef.filePath, targetDef, nodeLookup);
+            if (targetGraphId === undefined) {
+                skipped++;
+                continue;
+            }
+            const edgeType = mapReferenceKindToEdgeType(ref.kind);
+            if (edgeType === undefined) {
+                skipped++;
+                continue;
+            }
+            const dedupKey = `${edgeType}:${callerGraphId}->${targetGraphId}:${ref.atRange.startLine}:${ref.atRange.startCol}`;
+            if (seen.has(dedupKey))
+                continue;
+            seen.add(dedupKey);
+            graph.addRelationship({
+                id: `rel:${dedupKey}`,
+                sourceId: callerGraphId,
+                targetId: targetGraphId,
+                type: edgeType,
+                confidence: ref.confidence,
+                reason: `scope-resolution: ${ref.kind}`,
+            });
+            emitted++;
+        }
+    }
+    return { emitted, skipped };
+}

package/dist/core/ingestion/scope-resolution/passes/compound-receiver.d.ts

@@ -0,0 +1,42 @@
+/**
+ * Resolve a compound-receiver expression's TYPE — `user.address.save()`,
+ * `svc.get_user().save()`, `c.greet().save()` — to the class def of
+ * the value the receiver expression produces.
+ *
+ * Three shapes (parsed C-family-style):
+ *   - bare identifier `name` — look up via typeBinding chain
+ *   - dotted `obj.field[.field]…` — walk fields via class-scope typeBindings
+ *   - call `expr.method()` — recurse into expr, find method's return-type
+ *     typeBinding on its class, resolve to a class
+ *
+ * **Field-fallback heuristic** (Phase-9C "unified fixpoint"): when the
+ * receiver class has no `methodName`, walk its fields and try the
+ * lookup on each field's type. Useful for dynamically-typed languages
+ * (Python). Strictly-typed languages should pass
+ * `fieldFallbackOnMethodLookup: false` via `ScopeResolver`.
+ *
+ * Generic for any C-family language (`.` member access, `()` call
+ * syntax). Languages with non-C-family syntax (Ruby blocks, COBOL)
+ * either don't trigger the call branch or skip this pass entirely.
+ */
+import type { ScopeId, SymbolDefinition } from '../../../../_shared/index.js';
+import type { ScopeResolutionIndexes } from '../../model/scope-resolution-indexes.js';
+import type { WorkspaceResolutionIndex } from '../workspace-index.js';
+interface ResolveCompoundReceiverOptions {
+    /** When true (default), if method lookup fails on the receiver's
+     *  class, walk its fields and try the lookup on each field's class.
+     *  Phase-9C "unified fixpoint" — Python-shaped heuristic. */
+    readonly fieldFallback?: boolean;
+    /** Language-specific accessor unwrap — `data.Values` on a
+     *  Dictionary<K,V>-typed receiver yields V (C#), etc. Returns the
+     *  element type's simple name, or `undefined` to let the regular
+     *  field-walk handle the access. */
+    readonly unwrapCollectionAccessor?: (receiverType: string, accessor: string) => string | undefined;
+    /** Walk up from the class scope to ancestor (Module) scopes when
+     *  looking up a method's return-type typeBinding. Only enable for
+     *  languages that hoist return-type bindings to Module scope (C#);
+     *  otherwise we risk picking up unrelated module-level bindings. */
+    readonly hoistTypeBindingsToModule?: boolean;
+}
+export declare function resolveCompoundReceiverClass(receiverText: string, inScope: ScopeId, scopes: ScopeResolutionIndexes, index: WorkspaceResolutionIndex, options?: ResolveCompoundReceiverOptions, depth?: number): SymbolDefinition | undefined;
+export {};