@ttsc/graph 0.18.4 → 0.19.1

package/src/server/runLookup.ts

@@ -1,8 +1,9 @@
 import { TtscGraphMemory } from "../model/TtscGraphMemory";
 import { ITtscGraphLookup } from "../structures/ITtscGraphLookup";
 import { ITtscGraphNode } from "../structures/ITtscGraphNode";
+import { exportFanIn } from "./exportSurface";
 import { isExternalNode, isSupportPath } from "./pathPolicy";
-import { resultGuide, resultNext } from "./resultGuide";
+import { IRunnerOutput, resultNext } from "./resultNext";
 import { decoratorsOf, signatureOf } from "./runDetails";
 
 // One file should not crowd out the rest of the ranking, so cap hits per file.
@@ -20,7 +21,7 @@ const MAX_LIMIT = 6;
 export function runLookup(
   graph: TtscGraphMemory,
   props: ITtscGraphLookup.IRequest,
-): ITtscGraphLookup {
+): IRunnerOutput<ITtscGraphLookup> {
   const terms = subwords(props.query);
   const codeTerms = exactCodeTerms(props.query);
   const requestedKinds = requestedSymbolKinds(props.query);
@@ -30,14 +31,13 @@ export function runLookup(
   const includeExternal = props.includeExternal === true;
   if (terms.length === 0)
     return {
-      type: "lookup",
-      hits: [],
+      result: {
+        type: "lookup",
+        hits: [],
+      },
       next: resultNext(
         "clarify",
-        "No symbol matched; ask for a concrete symbol or scope.",
-      ),
-      guide: resultGuide(
-        "No symbol matched; answer that the graph did not resolve this name or ask for a more concrete symbol.",
+        "The query carries no searchable terms, so no symbol could be matched.",
       ),
     };
 
@@ -92,16 +92,20 @@ export function runLookup(
     if (sig !== undefined) hit.signature = sig;
   }
   return {
-    type: "lookup",
-    hits,
-    next: resultNext(
-      "inspect",
-      "Use one returned id for trace/details when the answer needs flow or shape.",
-      "details",
-    ),
-    guide: resultGuide(
-      "Use ranked hits and signatures as symbol evidence. If the target is clear, answer or make one focused trace/details call; do not search files to verify the match.",
-    ),
+    result: {
+      type: "lookup",
+      hits,
+    },
+    next:
+      hits.length === 0
+        ? resultNext(
+            "outside",
+            "No symbol matched, so the graph did not resolve this name.",
+          )
+        : resultNext(
+            "answer",
+            "The ranked hits and their signatures resolve the name.",
+          ),
   };
 }
 
@@ -168,6 +172,13 @@ function scoreNode(
   const fan = degree(graph, node.id);
   score += Math.min(8, Math.log2(1 + fan) * 2);
 
+  // How many modules put this symbol on the wire. Two symbols can match a name
+  // equally well while one is what a consumer imports and the other is a leftover
+  // major the package still ships behind a subpath; the re-export chain is what
+  // tells them apart, so it breaks the tie.
+  const surface = exportFanIn(graph, node.id);
+  if (surface > 0) score *= 1 + Math.min(0.4, Math.log2(1 + surface) * 0.14);
+
   // Dampen what is rarely the intended target.
   if (node.ignored) score *= 0.3;
   if (isTestFile(node.file)) score *= 0.7;

package/src/server/runOverview.ts

@@ -2,7 +2,7 @@ import { TtscGraphMemory } from "../model/TtscGraphMemory";
 import { ITtscGraphNode } from "../structures/ITtscGraphNode";
 import { ITtscGraphOverview } from "../structures/ITtscGraphOverview";
 import { isPublicApiNoisePath, isSupportPath } from "./pathPolicy";
-import { resultGuide, resultNext } from "./resultGuide";
+import { IRunnerOutput, resultNext } from "./resultNext";
 
 /** Edges that express nesting/packaging, not code dependency. */
 const STRUCTURAL_KINDS = new Set<string>(["contains", "exports", "imports"]);
@@ -17,7 +17,7 @@ const STRUCTURAL_KINDS = new Set<string>(["contains", "exports", "imports"]);
 export function runOverview(
   graph: TtscGraphMemory,
   props: ITtscGraphOverview.IRequest,
-): ITtscGraphOverview {
+): IRunnerOutput<ITtscGraphOverview> {
   const aspect = props.aspect ?? "all";
   const want = (a: ITtscGraphOverview.IRequest["aspect"]): boolean =>
     aspect === "all" || aspect === a;
@@ -38,18 +38,17 @@ export function runOverview(
       edges: graph.edges.length,
       byKind,
     },
-    next: resultNext(
-      "answer",
-      "Counts, layers, hotspots, and public API are sufficient for broad orientation.",
-    ),
-    guide: resultGuide(
-      "Use counts, layers, hotspots, and public API as a broad orientation map. Do not expand it into file reads unless the user needs exact source body text.",
-    ),
   };
   if (want("layers")) result.layers = layers(graph);
   if (want("hotspots")) result.hotspots = hotspots(graph);
   if (want("publicApi")) result.publicApi = publicApi(graph);
-  return result;
+  return {
+    result,
+    next: resultNext(
+      "answer",
+      "Counts, layers, hotspots, and public API are what the graph holds about the project's shape.",
+    ),
+  };
 }
 
 /** Folder-level layering: how source and its export surface spread by directory. */