gitnexus 1.5.3 → 1.6.1

package/dist/core/ingestion/binding-accumulator.js

@@ -0,0 +1,336 @@
+/**
+ * BindingAccumulator — read-append-only accumulator that collects TypeEnv
+ * bindings across files in the GitNexus analyzer pipeline.
+ *
+ * **Current behavior (both execution paths):** The accumulator carries only
+ * file-scope (`scope = ''`) entries. Function-scope bindings are stripped
+ * at both write sites:
+ *
+ * - **Worker path**: `parse-worker.ts` serializes only
+ *   `typeEnv.fileScope()` entries across the IPC boundary.
+ * - **Sequential path**: `type-env.ts::flush()` iterates only the FILE_SCOPE
+ *   entry of the env map and writes `BindingEntry` records with
+ *   `scope: ''` hardcoded.
+ *
+ * The narrowing exists because function-scope bindings have zero downstream
+ * consumers today and were previously costing ~4.9 MB of heap + IPC on
+ * every pipeline run. See `type-env.ts::flush()` and the `FileScopeBindings`
+ * JSDoc in `parse-worker.ts` for the paired Phase 9 reversion checklist.
+ *
+ * **Historical quality asymmetry (Phase 9 consideration):** Even though
+ * both paths now carry only file-scope data, the two paths were built
+ * under different resolution capabilities, and a future Phase 9 reverter
+ * that widens them back to all scopes will inherit that asymmetry:
+ *
+ * - **Sequential path** had (and would regain) access to the full
+ *   `SymbolTable` and `importedBindings`, so its bindings benefit from
+ *   Tier 2 cross-file propagation.
+ * - **Worker path** runs without `SymbolTable` / `importedBindings` and
+ *   can only produce Tier 0 (annotation-declared) and local Tier 1
+ *   (same-file constructor inference) bindings.
+ *
+ * Phase 9 consumers that trust every entry equally will silently produce
+ * worse results for large repos (worker-dominant) than small ones
+ * (sequential-dominant). If Phase 9 needs homogeneous quality, either
+ * (a) tag entries with their tier at insert time so consumers can filter,
+ * or (b) post-process worker-path entries through a follow-up resolution
+ * pass after the main-thread `SymbolTable` is complete.
+ *
+ * **Lifecycle contract**: single-use — `append* → finalize → consume → dispose`.
+ * After `dispose()` the accumulator is permanently dead: any mutating call
+ * (`appendFile`) throws, and read methods return empty/undefined as if the
+ * accumulator had never been appended to. The instance is not recyclable;
+ * construct a new one for a new pipeline run. Finalization and disposal are
+ * orthogonal state dimensions and may be invoked in either order.
+ */
+/**
+ * Merge file-scope bindings from a (finalized) `BindingAccumulator` into an
+ * `exportedTypeMap` for symbols whose graph nodes are marked as exported.
+ *
+ * This is the single source of truth for the worker-path ExportedTypeMap
+ * enrichment loop. Previously the logic lived inline in `pipeline.ts` and
+ * the test suite reimplemented it as a `runEnrichmentLoop` helper — a
+ * drift-prone pattern that meant tests could pass while production regressed.
+ * Extracting it here makes the production code call the same function the
+ * tests call.
+ *
+ * **Node ID candidate order**: `Function:{filePath}:{name}` →
+ * `Variable:{filePath}:{name}` → `Const:{filePath}:{name}`. First match wins.
+ *
+ * **Tier 0 priority**: if `exportedTypeMap` already has an entry for a
+ * `(filePath, name)` pair, the accumulator entry does NOT overwrite it —
+ * the SymbolTable tier-0 pass is authoritative. Without this guard, a
+ * worker-path binding could clobber a higher-quality type from SymbolTable.
+ *
+ * **Finalize precondition**: the accumulator should be finalized before
+ * calling this function. The lifecycle contract is
+ * `append → finalize → enrich → dispose`. Finalization is not asserted
+ * here (the test suite and pipeline both honor it separately), but any
+ * append happening concurrently with this enrichment would be a lifecycle
+ * bug at the caller level.
+ *
+ * @returns The number of new entries written into `exportedTypeMap`
+ *          (0 on empty accumulator or when every candidate was filtered
+ *          out by the export check or the Tier 0 guard).
+ */
+export function enrichExportedTypeMap(bindingAccumulator, graph, exportedTypeMap) {
+    if (bindingAccumulator.fileCount === 0)
+        return 0;
+    let enriched = 0;
+    for (const filePath of bindingAccumulator.files()) {
+        for (const [name, type] of bindingAccumulator.fileScopeEntries(filePath)) {
+            // Three-candidate-ID lookup mirrors the sequential-path export check
+            // in `collectExportedBindings()` (call-processor.ts).
+            const functionNodeId = `Function:${filePath}:${name}`;
+            const variableNodeId = `Variable:${filePath}:${name}`;
+            const constNodeId = `Const:${filePath}:${name}`;
+            const node = graph.getNode(functionNodeId) ??
+                graph.getNode(variableNodeId) ??
+                graph.getNode(constNodeId);
+            if (!node?.properties?.isExported)
+                continue;
+            let fileExports = exportedTypeMap.get(filePath);
+            if (!fileExports) {
+                fileExports = new Map();
+                exportedTypeMap.set(filePath, fileExports);
+            }
+            // Tier 0 priority: SymbolTable-populated entries are authoritative.
+            if (!fileExports.has(name)) {
+                fileExports.set(name, type);
+                enriched++;
+            }
+        }
+    }
+    return enriched;
+}
+const ENTRY_OVERHEAD = 64; // bytes per entry (object overhead + property refs)
+const MAP_ENTRY_OVERHEAD = 80; // bytes per file entry in the map
+export class BindingAccumulator {
+    // Storage is split into two parallel maps so file-scope reads are fast.
+    // - _allByFile holds every BindingEntry (used by getFile, memory estimate).
+    // - _fileScopeByFile is a nested Map<filePath, Map<varName, typeName>> for
+    //   O(1) point-lookup via fileScopeGet(). For iteration-based consumers
+    //   (enrichExportedTypeMap), fileScopeEntries() iterates the inner Map.
+    //   Both maps carry the same key set modulo the `scope === ''` precondition:
+    //   _allByFile has a key as soon as any entry is appended; _fileScopeByFile
+    //   only has a key once a file-scope entry arrives. Code that iterates via
+    //   files() uses _allByFile so files with only function-scope entries
+    //   remain visible.
+    //
+    //   Note: Map.set semantics mean a duplicate varName for the same file
+    //   overwrites the previous value (last-write-wins). This is the correct
+    //   behavior — duplicate top-level bindings in the same file shouldn't
+    //   happen in well-formed source, and if they do the last declaration
+    //   is typically the one the compiler sees.
+    _allByFile = new Map();
+    _fileScopeByFile = new Map();
+    _totalBindings = 0;
+    _finalized = false;
+    _disposed = false;
+    /**
+     * Append bindings for a file. Safe to call multiple times for the same file.
+     * Throws if the accumulator has been finalized. Skips if entries is empty.
+     *
+     * The `entries` parameter is `readonly` — this method never mutates the
+     * caller's array. Internally, the first `appendFile` call per filePath
+     * makes a defensive copy (`slice()`), and subsequent calls push into the
+     * accumulator's own storage.
+     */
+    appendFile(filePath, entries) {
+        if (this._finalized) {
+            throw new Error('[BindingAccumulator] appendFile after finalize — no further appends allowed');
+        }
+        // Single-use lifecycle: once disposed, the accumulator is dead. A
+        // post-dispose append almost always indicates a missed wiring step
+        // (the consumer is reading state that was supposed to be released),
+        // so convert the silent use-after-dispose into a loud failure.
+        if (this._disposed) {
+            throw new Error('BindingAccumulator: use after dispose');
+        }
+        if (entries.length === 0) {
+            return;
+        }
+        // Note on the file-scope-only invariant:
+        // The accumulator does NOT reject function-scope entries at this
+        // boundary. The narrowing contract is enforced by the two production
+        // write sites — `parse-worker.ts` (which uses `typeEnv.fileScope()`
+        // and hardcodes `scope: ''` in the pipeline adapter) and
+        // `type-env.ts::flush()` (which iterates only `env.get(FILE_SCOPE)`).
+        // The class JSDoc documents the invariant and the Phase 9 reversion
+        // path. Making `appendFile` runtime-reject non-file-scope entries
+        // would break the accumulator's own storage-split tests which
+        // legitimately exercise mixed-scope entries. If a future write path
+        // violates the invariant, tests should fail via missing exports in
+        // the enrichment loop, not via an assertion here.
+        // All-scope store.
+        const existingAll = this._allByFile.get(filePath);
+        if (existingAll !== undefined) {
+            for (const e of entries) {
+                existingAll.push(e);
+            }
+        }
+        else {
+            this._allByFile.set(filePath, entries.slice());
+        }
+        // File-scope fast-path store (nested Map for O(1) point-lookup via fileScopeGet).
+        // Populated lazily on first file-scope entry per file.
+        let fileScopeMap = this._fileScopeByFile.get(filePath);
+        for (const e of entries) {
+            if (e.scope === '') {
+                if (fileScopeMap === undefined) {
+                    fileScopeMap = new Map();
+                    this._fileScopeByFile.set(filePath, fileScopeMap);
+                }
+                fileScopeMap.set(e.varName, e.typeName);
+            }
+        }
+        this._totalBindings += entries.length;
+    }
+    /** Lock the accumulator — no further appends. Idempotent. */
+    finalize() {
+        // Dev-mode invariant: verify the parallel storage split is consistent.
+        // `_fileScopeByFile` must be a proper projection of `_allByFile`
+        // where the outer key is a subset and the inner entries are exactly
+        // the `scope === ''` subset of `_allByFile[key]`. A drift would
+        // indicate a bug in `appendFile()` where one map was updated but
+        // not the other.
+        if (process.env.NODE_ENV !== 'production' && !this._finalized) {
+            for (const [filePath, fileScopeMap] of this._fileScopeByFile) {
+                const allEntries = this._allByFile.get(filePath);
+                if (allEntries === undefined) {
+                    throw new Error(`[BindingAccumulator] storage split drift: file ${filePath} has file-scope entries ` +
+                        `but no _allByFile entry`);
+                }
+                // Count unique file-scope varNames in _allByFile (to match Map dedup
+                // semantics in _fileScopeByFile where Map.set deduplicates same-name).
+                const projectedNames = new Set(allEntries.filter((e) => e.scope === '').map((e) => e.varName));
+                if (projectedNames.size !== fileScopeMap.size) {
+                    throw new Error(`[BindingAccumulator] storage split drift: file ${filePath} has ` +
+                        `${fileScopeMap.size} file-scope names in Map but ${projectedNames.size} unique ` +
+                        `file-scope varNames in _allByFile`);
+                }
+            }
+        }
+        this._finalized = true;
+    }
+    /**
+     * Release the accumulator's heap footprint. Clears both internal storage
+     * maps and resets `_totalBindings` to zero. Idempotent — calling twice
+     * is a no-op. Orthogonal to `finalize()` — calling `dispose()` does not
+     * change the finalized state.
+     *
+     * **Single-use lifecycle.** This is a one-way terminal transition: the
+     * accumulator is not recyclable. Any subsequent `appendFile` call throws
+     * (`'BindingAccumulator: use after dispose'`), regardless of whether
+     * `finalize()` was called first. Post-dispose reads do not throw —
+     * they return empty/undefined state matching a never-appended-to
+     * accumulator:
+     *   - `fileCount === 0`
+     *   - `totalBindings === 0`
+     *   - `files()` yields an empty iterator
+     *   - `getFile(x)` returns `undefined` for all `x`
+     *   - `fileScopeEntries(x)` returns `[]` for all `x`
+     *   - `fileScopeGet(x, y)` returns `undefined` for all `x, y`
+     *   - `estimateMemoryBytes()` returns `0`
+     *
+     * Lifecycle note: the pipeline disposes the accumulator inside the
+     * `finally` of the `crossFile` phase, which is scheduled after every
+     * other accumulator consumer (Phase 9 call/assignment processing and
+     * the ExportedTypeMap enrichment loop). The dispose call therefore
+     * runs once, on both the happy path and the throw path of the
+     * crossFile phase.
+     */
+    dispose() {
+        this._allByFile.clear();
+        this._fileScopeByFile.clear();
+        this._totalBindings = 0;
+        this._disposed = true;
+    }
+    /** Get all bindings for a file, or undefined if the file is unknown. */
+    getFile(filePath) {
+        return this._allByFile.get(filePath);
+    }
+    /**
+     * Get only scope='' (file-level) entries as [varName, typeName] tuples.
+     * For iteration-based consumers (e.g., `enrichExportedTypeMap`).
+     * Returns an empty array for an unknown file.
+     *
+     * O(1) map lookup + O(n_file_scope) tuple reconstruction from the inner
+     * Map. Does NOT walk function-scope entries.
+     *
+     * For point-lookup consumers (e.g., Phase 9 fallback), prefer
+     * `fileScopeGet(filePath, name)` — O(1) with no allocation.
+     */
+    fileScopeEntries(filePath) {
+        const map = this._fileScopeByFile.get(filePath);
+        return map ? [...map.entries()] : [];
+    }
+    /**
+     * O(1) point-lookup for a single file-scope binding by (filePath, name).
+     * Returns the typeName if found, `undefined` otherwise.
+     *
+     * This is the preferred lookup path for Phase 9 consumers that resolve
+     * a single callee's return type — avoids the O(n_file_scope) iteration
+     * and defensive-copy allocation of `fileScopeEntries()`.
+     */
+    fileScopeGet(filePath, name) {
+        return this._fileScopeByFile.get(filePath)?.get(name);
+    }
+    /** Iterate over all file paths in insertion order. */
+    files() {
+        return this._allByFile.keys();
+    }
+    /** Number of distinct files with at least one binding. */
+    get fileCount() {
+        return this._allByFile.size;
+    }
+    /** Total number of binding entries across all files. */
+    get totalBindings() {
+        return this._totalBindings;
+    }
+    /** Whether the accumulator has been finalized. */
+    get finalized() {
+        return this._finalized;
+    }
+    /**
+     * Whether the accumulator has been disposed. Exposed for symmetry with
+     * `finalized` so debug tooling and future Phase 9 consumers can detect a
+     * disposed accumulator without inspecting empty state heuristically.
+     *
+     * Disposal and finalization are orthogonal: a disposed accumulator may or
+     * may not be finalized, and vice versa. See `dispose()` for the full
+     * lifecycle contract.
+     */
+    get disposed() {
+        return this._disposed;
+    }
+    /**
+     * Rough memory estimate in bytes (intentionally pessimistic).
+     * Formula: sum of (ENTRY_OVERHEAD + char bytes of scope+varName+typeName) per entry
+     *          + MAP_ENTRY_OVERHEAD + char bytes of filePath per file.
+     *
+     * Note: V8 stores all-ASCII strings as Latin-1 (1 byte/char) and only upgrades
+     * to UCS-2 (2 bytes/char) for non-Latin-1 code points. Source paths and type names
+     * are typically all-ASCII, so actual heap cost is roughly half what this returns.
+     * The pessimistic factor is intentional — better to over-budget than under-budget.
+     *
+     * **⚠ Cost profile**: O(totalBindings) — iterates every entry in
+     * `_allByFile` and reads three string `.length` properties per entry.
+     * At a typical repo scale (10k files × ~20 file-scope bindings) this is
+     * ~200k property reads per call. Call at most once per pipeline run,
+     * NOT per file, per chunk, or per progress tick. The current single
+     * call site is the dev-mode telemetry log at the pipeline finalize
+     * seam. Adding a per-file-progress caller would silently make it
+     * quadratic in repo size.
+     */
+    estimateMemoryBytes() {
+        let total = 0;
+        for (const [filePath, entries] of this._allByFile) {
+            total += MAP_ENTRY_OVERHEAD + filePath.length * 2;
+            for (const e of entries) {
+                total += ENTRY_OVERHEAD + (e.scope.length + e.varName.length + e.typeName.length) * 2;
+            }
+        }
+        return total;
+    }
+}

package/dist/core/ingestion/call-processor.d.ts

@@ -1,13 +1,26 @@
 import { KnowledgeGraph } from '../graph/types.js';
 import { ASTCache } from './ast-cache.js';
-import type { SymbolTable } from './symbol-table.js';
-import type { ResolutionContext } from './resolution-context.js';
-import type { ExtractedCall, ExtractedAssignment, ExtractedHeritage, ExtractedRoute, ExtractedFetchCall, FileConstructorBindings } from './workers/parse-worker.js';
+import type { SymbolDefinition, SymbolTableReader } from './model/symbol-table.js';
+import type { ResolutionContext } from './model/resolution-context.js';
+import type { TieredCandidates } from './model/resolution-context.js';
+import type { TypeEnvironment } from './type-env.js';
+import type { HeritageMap } from './model/heritage-map.js';
+import type { BindingAccumulator } from './binding-accumulator.js';
+import type { ExtractedCall, ExtractedAssignment, ExtractedRoute, ExtractedFetchCall, FileConstructorBindings } from './workers/parse-worker.js';
+import type { ExtractedHeritage } from './model/heritage-map.js';
+import type { LiteralTypeInferrer } from './type-extractors/types.js';
+import type { SyntaxNode } from './utils/ast-helpers.js';
 /** Per-file resolved type bindings for exported symbols.
  *  Populated during call processing, consumed by Phase 14 re-resolution pass. */
 export type ExportedTypeMap = Map<string, Map<string, string>>;
 /** Build a map of imported callee names → return types for cross-file call-result binding.
- *  Consulted ONLY when SymbolTable has no unambiguous local match (local-first principle). */
+ *  Consulted ONLY when SymbolTable has no unambiguous local match (local-first principle).
+ *
+ *  Overlapping mechanism (1 of 3): this is the SymbolTable-backed path.
+ *  See also:
+ *    2. collectExportedBindings (~line 168) / enrichExportedTypeMap — TypeEnv + graph isExported
+ *    3. Phase 9 fallback in verifyConstructorBindings (~line 563) — namedImportMap + BindingAccumulator
+ *  A future cleanup should merge these into a single resolution pass. */
 export declare function buildImportedReturnTypes(filePath: string, namedImportMap: ReadonlyMap<string, ReadonlyMap<string, {
     sourcePath: string;
     exportedName: string;
@@ -31,7 +44,7 @@ export declare function buildImportedRawReturnTypes(filePath: string, namedImpor
 /** Build ExportedTypeMap from graph nodes — used for worker path where TypeEnv
  *  is not available in the main thread. Collects returnType/declaredType from
  *  exported symbols that have callables with known return types. */
-export declare function buildExportedTypeMapFromGraph(graph: KnowledgeGraph, symbolTable: SymbolTable): ExportedTypeMap;
+export declare function buildExportedTypeMapFromGraph(graph: KnowledgeGraph, symbolTable: SymbolTableReader): ExportedTypeMap;
 /** Seed cross-file receiver types into pre-extracted call records.
  *  Fills missing receiverTypeName for single-hop imported variables
  *  using ExportedTypeMap + namedImportMap — zero disk I/O, zero AST re-parsing.
@@ -42,24 +55,15 @@ export declare function seedCrossFileReceiverTypes(calls: ExtractedCall[], named
 }>>, exportedTypeMap: ReadonlyMap<string, ReadonlyMap<string, string>>): {
     enrichedCount: number;
 };
-/** Maps interface/abstract-class name → set of file paths of direct implementors. */
-export type ImplementorMap = ReadonlyMap<string, ReadonlySet<string>>;
 /**
- * Build an ImplementorMap from extracted heritage data.
- * Only direct `implements` relationships are tracked (transitive not needed for
- * the common Java/Kotlin/C# interface dispatch pattern).
- * `extends` is ignored — dispatch keyed on abstract class bases is not modeled here.
+ * Resolution result with confidence scoring
  */
-/**
- * Maps interface name → file paths of classes that implement it (direct only).
- * When `ctx` is set, `kind: 'extends'` rows are classified like heritage-processor
- * (C#/Java base_list: class vs interface parents share one capture name).
- */
-export declare const buildImplementorMap: (heritage: readonly ExtractedHeritage[], ctx?: ResolutionContext) => Map<string, Set<string>>;
-/**
- * Merge a chunk's implementor map into the global accumulator.
- */
-export declare const mergeImplementorMaps: (target: Map<string, Set<string>>, source: ReadonlyMap<string, ReadonlySet<string>>) => void;
+interface ResolveResult {
+    nodeId: string;
+    confidence: number;
+    reason: string;
+    returnType?: string;
+}
 export declare const processCalls: (graph: KnowledgeGraph, files: {
     path: string;
     content: string;
@@ -70,18 +74,144 @@ importedBindingsMap?: ReadonlyMap<string, ReadonlyMap<string, string>>,
  *  Consulted ONLY when SymbolTable has no unambiguous match (local-first principle). */
 importedReturnTypesMap?: ReadonlyMap<string, ReadonlyMap<string, string>>, 
 /** Phase 14 E3: cross-file RAW return types for for-loop element extraction. Keyed by filePath → Map<calleeName, rawReturnType>. */
-importedRawReturnTypesMap?: ReadonlyMap<string, ReadonlyMap<string, string>>, implementorMap?: ImplementorMap) => Promise<ExtractedHeritage[]>;
+importedRawReturnTypesMap?: ReadonlyMap<string, ReadonlyMap<string, string>>, heritageMap?: HeritageMap, bindingAccumulator?: BindingAccumulator) => Promise<ExtractedHeritage[]>;
+/** Per-file cache for module-alias widening. Cleared between files. */
+type WidenCache = Map<string, readonly SymbolDefinition[]>;
+/**
+ * Optional hints for overload disambiguation via argument literal types.
+ * Only available on the sequential path (has AST); worker path passes undefined.
+ *
+ * @internal Exported so tests can exercise the D0 skip-condition path without
+ *           constructing a real SyntaxNode. Do not use outside `call-processor.ts`
+ *           and its unit tests.
+ */
+export interface OverloadHints {
+    callNode: SyntaxNode;
+    inferLiteralType: LiteralTypeInferrer;
+    typeEnv?: TypeEnvironment;
+}
+/** @internal Exported for unit tests. Do not use outside tests. */
+export declare const _resolveCallTargetForTesting: (call: Pick<ExtractedCall, "calledName" | "argCount" | "callForm" | "receiverTypeName" | "receiverName">, currentFile: string, ctx: ResolutionContext, opts?: {
+    overloadHints?: OverloadHints;
+    widenCache?: WidenCache;
+    preComputedArgTypes?: (string | undefined)[];
+    heritageMap?: HeritageMap;
+}) => ResolveResult | null;
+/**
+ * Resolve a member call using owner-scoped + MRO resolution only (no fuzzy lookup).
+ * Used for `obj.method()` calls where the receiver type is known.
+ *
+ * Delegates to {@link resolveMethodByOwner} which performs an O(1) owner-scoped
+ * method lookup and, when a {@link HeritageMap} is provided, walks the MRO chain
+ * via {@link lookupMethodByOwnerWithMRO}.
+ *
+ * {@link resolveCallTarget} delegates here for member calls.
+ *
+ * **SEMANTIC CHANGE (2026-04-09):** The confidence tier reflects how the
+ * owner TYPE was resolved, not how the method NAME was resolved globally.
+ * more accurate for owner-scoped resolution (the discriminant IS the class,
+ * not the method name). Downstream consumers that filter CALLS edges by
+ * confidence threshold may see shifted values on otherwise-unchanged code.
+ * See the "returns result with correct confidence tier" tests below for the
+ * locked-in behavior.
+ *
+ * **Performance:** Callers that only need the return type (e.g. `walkMixedChain`)
+ * should call {@link resolveMethodByOwner} directly and use the `.def.returnType`
+ * field instead, to avoid building a throwaway `ResolveResult`.
+ *
+ * @param ownerType   - The receiver's type name (e.g. 'User')
+ * @param methodName  - The method being called (e.g. 'save')
+ * @param currentFile - File path of the call site
+ * @param ctx         - Resolution context
+ * @param heritageMap - Optional heritage map for MRO-aware ancestor walking
+ */
+export declare const resolveMemberCall: (ownerType: string, methodName: string, currentFile: string, ctx: ResolutionContext, heritageMap?: HeritageMap, argCount?: number) => ResolveResult | null;
+/**
+ * Resolve a free-function call using `lookupExact` (same-file) + import-scoped
+ * resolution via `ctx.resolve()`.
+ *
+ * Used for `foo()`, `doStuff()` — unqualified calls with no receiver.
+ * Also handles Swift/Kotlin implicit constructors (`User()` without `new`)
+ * by delegating to {@link resolveStaticCall} when the tiered pool contains
+ * class-like targets.
+ *
+ * {@link resolveCallTarget} delegates here for `callForm === 'free'`.
+ *
+ * `resolveFreeCall` does not take a `widenCache` parameter. Free calls
+ * have no receiver type and rely exclusively on the tiered pool
+ * from `ctx.resolve()`.
+ *
+ * @param calledName  - The called function name (e.g. 'doStuff')
+ * @param filePath    - File path of the call site
+ * @param ctx         - Resolution context
+ * @param argCount    - Optional argument count for arity filtering
+ * @param tieredOverride - Pre-computed tiered candidates from an upstream
+ *                       `ctx.resolve` call. When provided, skips the redundant
+ *                       lookup inside this function.
+ * @param overloadHints  - Optional AST-based overload disambiguation hints
+ * @param preComputedArgTypes - Optional pre-computed argument types (worker path)
+ */
+export declare const resolveFreeCall: (calledName: string, filePath: string, ctx: ResolutionContext, argCount?: number, tieredOverride?: TieredCandidates, overloadHints?: OverloadHints, preComputedArgTypes?: (string | undefined)[]) => ResolveResult | null;
+/**
+ * Resolve a constructor or static call using class-scoped lookup (no fuzzy lookup).
+ * Used for `new User()` / `User()` calls where the calledName targets a class.
+ *
+ * Uses {@link TypeRegistry.lookupClassByName} for O(1) class lookup and
+ * {@link MethodRegistry.lookupMethodByOwner} for constructor resolution.
+ * {@link resolveCallTarget} delegates here for constructor and free-form calls
+ * that target a class.
+ *
+ * Resolution strategy:
+ *   1. `lookupClassByName(className)` — O(1) pre-check; bail early if no class exists.
+ *   2. `ctx.resolve(className, currentFile)` — import-scoped tier for confidence.
+ *   3. Filter to class-like candidates via `CLASS_LIKE_TYPES` and walk each
+ *      with `lookupMethodByOwner(classNodeId, className, argCount)` — O(1)
+ *      constructor lookup. Only accept results with `type === 'Constructor'`.
+ *   4. If step 3 found nothing and the tiered pool contains ownerless
+ *      `Constructor` nodes (common in some extractors), bail out so
+ *      `filterCallableCandidates` downstream handles Constructor-vs-Class
+ *      preference correctly.
+ *   5. Class-node fallback: filter `classCandidates` through
+ *      `INSTANTIABLE_CLASS_TYPES` and return the sole survivor when there is
+ *      exactly one. Null-route on zero survivors (Interface / Trait / Impl
+ *      stripped) or multiple (homonym ambiguity).
+ *
+ * @param className   - The class name (e.g. 'User'). Also used as the method
+ *                       name for the `lookupMethodByOwner` scan, because the
+ *                       only constructor-shaped call we handle today is
+ *                       `ClassName(...)` / `new ClassName(...)`. Named
+ *                       constructors like Dart `User.fromJson()` arrive as
+ *                       member calls and route through `resolveMemberCall`,
+ *                       so this function does not yet need a separate
+ *                       `methodName` parameter. Revisit if a language surfaces
+ *                       a static-method-shaped call with a distinct member
+ *                       name.
+ * @param currentFile - File path of the call site
+ * @param ctx         - Resolution context
+ * @param argCount    - Optional argument count for arity filtering
+ * @param tieredOverride - Pre-computed tiered candidates for `className` from
+ *                       an upstream `ctx.resolve` call. When provided, skips
+ *                       the redundant lookup inside this function. Leave
+ *                       unset for direct callers without a prior resolution.
+ */
+export declare const resolveStaticCall: (className: string, currentFile: string, ctx: ResolutionContext, argCount?: number, tieredOverride?: TieredCandidates, overloadHints?: OverloadHints, preComputedArgTypes?: (string | undefined)[]) => ResolveResult | null;
 /**
  * Fast path: resolve pre-extracted call sites from workers.
  * No AST parsing — workers already extracted calledName + sourceId.
+ *
+ * @param bindingAccumulator  Phase 9: optional accumulator carrying file-scope
+ *   TypeEnv bindings from all worker-processed files. When the SymbolTable has
+ *   no return type for a cross-file callee, `verifyConstructorBindings` falls
+ *   back to the accumulator via `namedImportMap` to bind the variable to the
+ *   callee's resolved type (e.g. `var x = getUser()` → `x: User`).
  */
-export declare const processCallsFromExtracted: (graph: KnowledgeGraph, extractedCalls: ExtractedCall[], ctx: ResolutionContext, onProgress?: (current: number, total: number) => void, constructorBindings?: FileConstructorBindings[], implementorMap?: ImplementorMap) => Promise<void>;
+export declare const processCallsFromExtracted: (graph: KnowledgeGraph, extractedCalls: ExtractedCall[], ctx: ResolutionContext, onProgress?: (current: number, total: number) => void, constructorBindings?: FileConstructorBindings[], heritageMap?: HeritageMap, bindingAccumulator?: BindingAccumulator) => Promise<void>;
 /**
  * Resolve pre-extracted field write assignments to ACCESSES {reason: 'write'} edges.
  * Accepts optional constructorBindings for return-type-aware receiver inference,
  * mirroring processCallsFromExtracted's verified binding lookup.
  */
-export declare const processAssignmentsFromExtracted: (graph: KnowledgeGraph, assignments: ExtractedAssignment[], ctx: ResolutionContext, constructorBindings?: FileConstructorBindings[]) => void;
+export declare const processAssignmentsFromExtracted: (graph: KnowledgeGraph, assignments: ExtractedAssignment[], ctx: ResolutionContext, constructorBindings?: FileConstructorBindings[], bindingAccumulator?: BindingAccumulator) => void;
 /**
  * Resolve pre-extracted Laravel routes to CALLS edges from route files to controller methods.
  */
@@ -103,3 +233,4 @@ export declare const extractFetchCallsFromFiles: (files: {
     path: string;
     content: string;
 }[], astCache: ASTCache) => Promise<ExtractedFetchCall[]>;
+export {};