@ttsc/graph 0.18.4 → 0.19.1

package/lib/structures/index.js

@@ -21,7 +21,6 @@ var __exportStar = (this && this.__exportStar) || function(m, exports) {
 Object.defineProperty(exports, "__esModule", { value: true });
 __exportStar(require("./ITtscGraphApplication"), exports);
 __exportStar(require("./ITtscGraphDecorator"), exports);
-__exportStar(require("./ITtscGraphDiagnostic"), exports);
 __exportStar(require("./ITtscGraphDump"), exports);
 __exportStar(require("./ITtscGraphEdge"), exports);
 __exportStar(require("./ITtscGraphEvidence"), exports);
@@ -33,6 +32,7 @@ __exportStar(require("./ITtscGraphOverview"), exports);
 __exportStar(require("./ITtscGraphLookup"), exports);
 __exportStar(require("./ITtscGraphNext"), exports);
 __exportStar(require("./ITtscGraphTrace"), exports);
+__exportStar(require("./ITtscGraphSpan"), exports);
 __exportStar(require("./ITtscGraphTour"), exports);
 __exportStar(require("./TtscGraphEdgeKind"), exports);
 __exportStar(require("./TtscGraphNodeKind"), exports);

package/lib/structures/index.js.map

@@ -1 +1 @@
-{"version":3,"file":"index.js","sourceRoot":"","sources":["../../src/structures/index.ts"],"names":[],"mappings":";AAAA,uEAAuE;AACvE,0EAA0E;AAC1E,8EAA8E;AAC9E,gFAAgF;AAChF,6BAA6B;;;;;;;;;;;;;;;;AAE7B,0DAAwC;AACxC,wDAAsC;AACtC,yDAAuC;AACvC,mDAAiC;AACjC,mDAAiC;AACjC,uDAAqC;AACrC,qDAAmC;AACnC,sDAAoC;AACpC,0DAAwC;AACxC,mDAAiC;AACjC,uDAAqC;AACrC,qDAAmC;AACnC,mDAAiC;AACjC,oDAAkC;AAClC,mDAAiC;AACjC,sDAAoC;AACpC,sDAAoC;AACpC,0DAAwC"}
+{"version":3,"file":"index.js","sourceRoot":"","sources":["../../src/structures/index.ts"],"names":[],"mappings":";AAAA,uEAAuE;AACvE,0EAA0E;AAC1E,8EAA8E;AAC9E,gFAAgF;AAChF,6BAA6B;;;;;;;;;;;;;;;;AAE7B,0DAAwC;AACxC,wDAAsC;AACtC,mDAAiC;AACjC,mDAAiC;AACjC,uDAAqC;AACrC,qDAAmC;AACnC,sDAAoC;AACpC,0DAAwC;AACxC,mDAAiC;AACjC,uDAAqC;AACrC,qDAAmC;AACnC,mDAAiC;AACjC,oDAAkC;AAClC,mDAAiC;AACjC,mDAAiC;AACjC,sDAAoC;AACpC,sDAAoC;AACpC,0DAAwC"}

package/lib/view.js

@@ -50,7 +50,9 @@ function parseViewArgs(argv) {
  */
 function runView(argv) {
     const opts = parseViewArgs(argv);
-    const binary = (0, resolveGraphBinary_1.resolveGraphBinary)();
+    // Anchor binary resolution at the project selected by `--cwd`, so `view` from
+    // an unrelated directory still finds the `ttsc` installed under the target.
+    const binary = (0, resolveGraphBinary_1.resolveGraphBinary)(process.env, opts.cwd);
     if (binary === null) {
         process.stderr.write("@ttsc/graph: could not resolve the ttscgraph binary. " +
             "Install `ttsc` so its platform package is present, " +

package/lib/view.js.map

@@ -1 +1 @@
-{"version":3,"file":"view.js","sourceRoot":"","sources":["../src/view.ts"],"names":[],"mappings":";;;;;;AAAA,2DAAsD;AACtD,sDAAyB;AACzB,0DAA6B;AAC7B,0DAA6B;AAE7B,yDAAsD;AACtD,qCAAgD;AAChD,6DAA0D;AAU1D,SAAS,aAAa,CAAC,IAAuB;IAC5C,MAAM,IAAI,GAAgB;QACxB,GAAG,EAAE,OAAO,CAAC,GAAG,EAAE;QAClB,QAAQ,EAAE,eAAe;QACzB,IAAI,EAAE,CAAC;QACP,IAAI,EAAE,IAAI;QACV,QAAQ,EAAE,IAAI;KACf,CAAC;IACF,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QACrC,MAAM,GAAG,GAAG,IAAI,CAAC,CAAC,CAAE,CAAC;QACrB,IAAI,GAAG,KAAK,OAAO;YAAE,IAAI,CAAC,GAAG,GAAG,IAAI,CAAC,EAAE,CAAC,CAAC,IAAI,IAAI,CAAC,GAAG,CAAC;aACjD,IAAI,GAAG,CAAC,UAAU,CAAC,QAAQ,CAAC;YAAE,IAAI,CAAC,GAAG,GAAG,GAAG,CAAC,KAAK,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC;aACpE,IAAI,GAAG,KAAK,YAAY,IAAI,GAAG,KAAK,IAAI;YAC3C,IAAI,CAAC,QAAQ,GAAG,IAAI,CAAC,EAAE,CAAC,CAAC,IAAI,IAAI,CAAC,QAAQ,CAAC;aACxC,IAAI,GAAG,CAAC,UAAU,CAAC,aAAa,CAAC;YACpC,IAAI,CAAC,QAAQ,GAAG,GAAG,CAAC,KAAK,CAAC,aAAa,CAAC,MAAM,CAAC,CAAC;aAC7C,IAAI,GAAG,KAAK,QAAQ;YAAE,IAAI,CAAC,IAAI,GAAG,MAAM,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;aACpD,IAAI,GAAG,CAAC,UAAU,CAAC,SAAS,CAAC;YAChC,IAAI,CAAC,IAAI,GAAG,MAAM,CAAC,GAAG,CAAC,KAAK,CAAC,SAAS,CAAC,MAAM,CAAC,CAAC,CAAC;aAC7C,IAAI,GAAG,KAAK,WAAW;YAAE,IAAI,CAAC,IAAI,GAAG,KAAK,CAAC;aAC3C,IAAI,GAAG,KAAK,aAAa;YAAE,IAAI,CAAC,QAAQ,GAAG,MAAM,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;aAC7D,IAAI,GAAG,CAAC,UAAU,CAAC,cAAc,CAAC;YACrC,IAAI,CAAC,QAAQ,GAAG,MAAM,CAAC,GAAG,CAAC,KAAK,CAAC,cAAc,CAAC,MAAM,CAAC,CAAC,CAAC;IAC7D,CAAC;IACD,OAAO,IAAI,CAAC;AACd,CAAC;AAED;;;;;GAKG;AACH,iBAAwB,IAAuB;IAC7C,MAAM,IAAI,GAAG,aAAa,CAAC,IAAI,CAAC,CAAC;IAEjC,MAAM,MAAM,GAAG,IAAA,uCAAkB,GAAE,CAAC;IACpC,IAAI,MAAM,KAAK,IAAI,EAAE,CAAC;QACpB,OAAO,CAAC,MAAM,CAAC,KAAK,CAClB,uDAAuD;YACrD,qDAAqD;YACrD,iDAAiD,CACpD,CAAC;QACF,OAAO,CAAC,CAAC;IACX,CAAC;IACD,IAAA,mCAAgB,EAAC,MAAM,CAAC,CAAC;IAEzB,OAAO,CAAC,MAAM,CAAC,KAAK,CAClB,uCAAuC,IAAI,CAAC,GAAG,KAAK,IAAI,CAAC,QAAQ,QAAQ,CAC1E,CAAC;IACF,MAAM,IAAI,GAAG,IAAA,8BAAS,EACpB,MAAM,EACN,CAAC,MAAM,EAAE,OAAO,EAAE,IAAI,CAAC,GAAG,EAAE,YAAY,EAAE,IAAI,CAAC,QAAQ,CAAC,EACxD,EAAE,QAAQ,EAAE,MAAM,EAAE,SAAS,EAAE,IAAI,GAAG,IAAI,GAAG,IAAI,EAAE,CACpD,CAAC;IACF,IAAI,IAAI,CAAC,KAAK,EAAE,CAAC;QACf,OAAO,CAAC,MAAM,CAAC,KAAK,CAAC,gBAAgB,IAAI,CAAC,KAAK,CAAC,OAAO,IAAI,CAAC,CAAC;QAC7D,OAAO,CAAC,CAAC;IACX,CAAC;IACD,IAAI,IAAI,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QACtB,OAAO,CAAC,MAAM,CAAC,KAAK,CAAC,IAAI,CAAC,MAAM,IAAI,4BAA4B,CAAC,CAAC;QAClE,OAAO,IAAI,CAAC,MAAM,IAAI,CAAC,CAAC;IAC1B,CAAC;IAED,IAAI,GAAY,CAAC;IACjB,IAAI,CAAC;QACH,GAAG,GAAG,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,MAAM,CAAY,CAAC;IAC3C,CAAC;IAAC,OAAO,GAAG,EAAE,CAAC;QACb,OAAO,CAAC,MAAM,CAAC,KAAK,CAClB,gDAAgD,MAAM,CAAC,GAAG,CAAC,IAAI,CAChE,CAAC;QACF,OAAO,CAAC,CAAC;IACX,CAAC;IAED,MAAM,OAAO,GAAG,IAAA,eAAM,EAAC,GAAG,EAAE,EAAE,QAAQ,EAAE,IAAI,CAAC,QAAQ,EAAE,CAAC,CAAC;IACzD,OAAO,CAAC,OAAO,GAAG,mBAAI,CAAC,QAAQ,CAAC,mBAAI,CAAC,OAAO,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC;IACxD,MAAM,SAAS,GAAG,IAAI,CAAC,SAAS,CAAC,OAAO,CAAC,CAAC;IAE1C,MAAM,SAAS,GAAG,mBAAI,CAAC,IAAI,CAAC,SAAS,EAAE,QAAQ,CAAC,CAAC;IACjD,IAAI,SAAiB,CAAC;IACtB,IAAI,QAAgB,CAAC;IACrB,IAAI,CAAC;QACH,SAAS,GAAG,iBAAE,CAAC,YAAY,CAAC,mBAAI,CAAC,IAAI,CAAC,SAAS,EAAE,YAAY,CAAC,CAAC,CAAC;QAChE,QAAQ,GAAG,iBAAE,CAAC,YAAY,CAAC,mBAAI,CAAC,IAAI,CAAC,SAAS,EAAE,WAAW,CAAC,CAAC,CAAC;IAChE,CAAC;IAAC,OAAO,GAAG,EAAE,CAAC;QACb,OAAO,CAAC,MAAM,CAAC,KAAK,CAClB,+CAA+C,MAAM,CAAC,GAAG,CAAC,KAAK;YAC7D,0BAA0B,CAC7B,CAAC;QACF,OAAO,CAAC,CAAC;IACX,CAAC;IAED,MAAM,MAAM,GAAG,mBAAI,CAAC,YAAY,CAAC,CAAC,GAAG,EAAE,GAAG,EAAE,EAAE;QAC5C,MAAM,GAAG,GAAG,CAAC,GAAG,CAAC,GAAG,IAAI,GAAG,CAAC,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;QAC3C,IAAI,GAAG,KAAK,aAAa,EAAE,CAAC;YAC1B,GAAG,CAAC,SAAS,CAAC,GAAG,EAAE,EAAE,cAAc,EAAE,kBAAkB,EAAE,CAAC,CAAC;YAC3D,GAAG,CAAC,GAAG,CAAC,SAAS,CAAC,CAAC;QACrB,CAAC;aAAM,IAAI,GAAG,KAAK,YAAY,EAAE,CAAC;YAChC,GAAG,CAAC,SAAS,CAAC,GAAG,EAAE;gBACjB,cAAc,EAAE,uCAAuC;aACxD,CAAC,CAAC;YACH,GAAG,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC;QACpB,CAAC;aAAM,CAAC;YACN,GAAG,CAAC,SAAS,CAAC,GAAG,EAAE,EAAE,cAAc,EAAE,0BAA0B,EAAE,CAAC,CAAC;YACnE,GAAG,CAAC,GAAG,CAAC,SAAS,CAAC,CAAC;QACrB,CAAC;IACH,CAAC,CAAC,CAAC;IAEH,MAAM,CAAC,MAAM,CAAC,IAAI,CAAC,IAAI,EAAE,WAAW,EAAE,GAAG,EAAE;QACzC,MAAM,OAAO,GAAG,MAAM,CAAC,OAAO,EAAE,CAAC;QACjC,MAAM,IAAI,GACR,OAAO,OAAO,KAAK,QAAQ,IAAI,OAAO,CAAC,CAAC,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC;QACpE,MAAM,GAAG,GAAG,oBAAoB,IAAI,GAAG,CAAC;QACxC,MAAM,MAAM,GAAG,OAAO,CAAC,MAAM,CAAC;QAC9B,OAAO,CAAC,MAAM,CAAC,KAAK,CAClB,gBAAgB,MAAM,CAAC,KAAK,CAAC,cAAc,EAAE,YAAY,MAAM,CAAC,KAAK,CAAC,cAAc,EAAE,QAAQ;YAC5F,UAAU,MAAM,CAAC,QAAQ,CAAC,cAAc,EAAE,MAAM,MAAM,CAAC,QAAQ,CAAC,cAAc,EAAE,KAAK,CACxF,CAAC;QACF,OAAO,CAAC,MAAM,CAAC,KAAK,CAAC,yCAAyC,GAAG,IAAI,CAAC,CAAC;QACvE,OAAO,CAAC,MAAM,CAAC,KAAK,CAAC,sCAAsC,CAAC,CAAC;QAC7D,IAAI,IAAI,CAAC,IAAI;YAAE,WAAW,CAAC,GAAG,CAAC,CAAC;IAClC,CAAC,CAAC,CAAC;IACH,wEAAwE;AAC1E,CAAC;AAED,kFAAkF;AAClF,SAAS,WAAW,CAAC,GAAW;IAC9B,IAAI,CAAC;QACH,IAAI,OAAO,CAAC,QAAQ,KAAK,OAAO;YAC9B,IAAA,0BAAK,EAAC,KAAK,EAAE,CAAC,IAAI,EAAE,OAAO,EAAE,EAAE,EAAE,GAAG,CAAC,EAAE;gBACrC,KAAK,EAAE,QAAQ;gBACf,QAAQ,EAAE,IAAI;aACf,CAAC,CAAC,KAAK,EAAE,CAAC;aACR,IAAI,OAAO,CAAC,QAAQ,KAAK,QAAQ;YACpC,IAAA,0BAAK,EAAC,MAAM,EAAE,CAAC,GAAG,CAAC,EAAE,EAAE,KAAK,EAAE,QAAQ,EAAE,QAAQ,EAAE,IAAI,EAAE,CAAC,CAAC,KAAK,EAAE,CAAC;;YAC/D,IAAA,0BAAK,EAAC,UAAU,EAAE,CAAC,GAAG,CAAC,EAAE,EAAE,KAAK,EAAE,QAAQ,EAAE,QAAQ,EAAE,IAAI,EAAE,CAAC,CAAC,KAAK,EAAE,CAAC;IAC7E,CAAC;IAAC,MAAM,CAAC;QACP,kDAAkD;IACpD,CAAC;AACH,CAAC"}
+{"version":3,"file":"view.js","sourceRoot":"","sources":["../src/view.ts"],"names":[],"mappings":";;;;;;AAAA,2DAAsD;AACtD,sDAAyB;AACzB,0DAA6B;AAC7B,0DAA6B;AAE7B,yDAAsD;AACtD,qCAAgD;AAChD,6DAA0D;AAU1D,SAAS,aAAa,CAAC,IAAuB;IAC5C,MAAM,IAAI,GAAgB;QACxB,GAAG,EAAE,OAAO,CAAC,GAAG,EAAE;QAClB,QAAQ,EAAE,eAAe;QACzB,IAAI,EAAE,CAAC;QACP,IAAI,EAAE,IAAI;QACV,QAAQ,EAAE,IAAI;KACf,CAAC;IACF,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QACrC,MAAM,GAAG,GAAG,IAAI,CAAC,CAAC,CAAE,CAAC;QACrB,IAAI,GAAG,KAAK,OAAO;YAAE,IAAI,CAAC,GAAG,GAAG,IAAI,CAAC,EAAE,CAAC,CAAC,IAAI,IAAI,CAAC,GAAG,CAAC;aACjD,IAAI,GAAG,CAAC,UAAU,CAAC,QAAQ,CAAC;YAAE,IAAI,CAAC,GAAG,GAAG,GAAG,CAAC,KAAK,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC;aACpE,IAAI,GAAG,KAAK,YAAY,IAAI,GAAG,KAAK,IAAI;YAC3C,IAAI,CAAC,QAAQ,GAAG,IAAI,CAAC,EAAE,CAAC,CAAC,IAAI,IAAI,CAAC,QAAQ,CAAC;aACxC,IAAI,GAAG,CAAC,UAAU,CAAC,aAAa,CAAC;YACpC,IAAI,CAAC,QAAQ,GAAG,GAAG,CAAC,KAAK,CAAC,aAAa,CAAC,MAAM,CAAC,CAAC;aAC7C,IAAI,GAAG,KAAK,QAAQ;YAAE,IAAI,CAAC,IAAI,GAAG,MAAM,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;aACpD,IAAI,GAAG,CAAC,UAAU,CAAC,SAAS,CAAC;YAChC,IAAI,CAAC,IAAI,GAAG,MAAM,CAAC,GAAG,CAAC,KAAK,CAAC,SAAS,CAAC,MAAM,CAAC,CAAC,CAAC;aAC7C,IAAI,GAAG,KAAK,WAAW;YAAE,IAAI,CAAC,IAAI,GAAG,KAAK,CAAC;aAC3C,IAAI,GAAG,KAAK,aAAa;YAAE,IAAI,CAAC,QAAQ,GAAG,MAAM,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;aAC7D,IAAI,GAAG,CAAC,UAAU,CAAC,cAAc,CAAC;YACrC,IAAI,CAAC,QAAQ,GAAG,MAAM,CAAC,GAAG,CAAC,KAAK,CAAC,cAAc,CAAC,MAAM,CAAC,CAAC,CAAC;IAC7D,CAAC;IACD,OAAO,IAAI,CAAC;AACd,CAAC;AAED;;;;;GAKG;AACH,iBAAwB,IAAuB;IAC7C,MAAM,IAAI,GAAG,aAAa,CAAC,IAAI,CAAC,CAAC;IAEjC,8EAA8E;IAC9E,4EAA4E;IAC5E,MAAM,MAAM,GAAG,IAAA,uCAAkB,EAAC,OAAO,CAAC,GAAG,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC;IACzD,IAAI,MAAM,KAAK,IAAI,EAAE,CAAC;QACpB,OAAO,CAAC,MAAM,CAAC,KAAK,CAClB,uDAAuD;YACrD,qDAAqD;YACrD,iDAAiD,CACpD,CAAC;QACF,OAAO,CAAC,CAAC;IACX,CAAC;IACD,IAAA,mCAAgB,EAAC,MAAM,CAAC,CAAC;IAEzB,OAAO,CAAC,MAAM,CAAC,KAAK,CAClB,uCAAuC,IAAI,CAAC,GAAG,KAAK,IAAI,CAAC,QAAQ,QAAQ,CAC1E,CAAC;IACF,MAAM,IAAI,GAAG,IAAA,8BAAS,EACpB,MAAM,EACN,CAAC,MAAM,EAAE,OAAO,EAAE,IAAI,CAAC,GAAG,EAAE,YAAY,EAAE,IAAI,CAAC,QAAQ,CAAC,EACxD,EAAE,QAAQ,EAAE,MAAM,EAAE,SAAS,EAAE,IAAI,GAAG,IAAI,GAAG,IAAI,EAAE,CACpD,CAAC;IACF,IAAI,IAAI,CAAC,KAAK,EAAE,CAAC;QACf,OAAO,CAAC,MAAM,CAAC,KAAK,CAAC,gBAAgB,IAAI,CAAC,KAAK,CAAC,OAAO,IAAI,CAAC,CAAC;QAC7D,OAAO,CAAC,CAAC;IACX,CAAC;IACD,IAAI,IAAI,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QACtB,OAAO,CAAC,MAAM,CAAC,KAAK,CAAC,IAAI,CAAC,MAAM,IAAI,4BAA4B,CAAC,CAAC;QAClE,OAAO,IAAI,CAAC,MAAM,IAAI,CAAC,CAAC;IAC1B,CAAC;IAED,IAAI,GAAY,CAAC;IACjB,IAAI,CAAC;QACH,GAAG,GAAG,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,MAAM,CAAY,CAAC;IAC3C,CAAC;IAAC,OAAO,GAAG,EAAE,CAAC;QACb,OAAO,CAAC,MAAM,CAAC,KAAK,CAClB,gDAAgD,MAAM,CAAC,GAAG,CAAC,IAAI,CAChE,CAAC;QACF,OAAO,CAAC,CAAC;IACX,CAAC;IAED,MAAM,OAAO,GAAG,IAAA,eAAM,EAAC,GAAG,EAAE,EAAE,QAAQ,EAAE,IAAI,CAAC,QAAQ,EAAE,CAAC,CAAC;IACzD,OAAO,CAAC,OAAO,GAAG,mBAAI,CAAC,QAAQ,CAAC,mBAAI,CAAC,OAAO,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC;IACxD,MAAM,SAAS,GAAG,IAAI,CAAC,SAAS,CAAC,OAAO,CAAC,CAAC;IAE1C,MAAM,SAAS,GAAG,mBAAI,CAAC,IAAI,CAAC,SAAS,EAAE,QAAQ,CAAC,CAAC;IACjD,IAAI,SAAiB,CAAC;IACtB,IAAI,QAAgB,CAAC;IACrB,IAAI,CAAC;QACH,SAAS,GAAG,iBAAE,CAAC,YAAY,CAAC,mBAAI,CAAC,IAAI,CAAC,SAAS,EAAE,YAAY,CAAC,CAAC,CAAC;QAChE,QAAQ,GAAG,iBAAE,CAAC,YAAY,CAAC,mBAAI,CAAC,IAAI,CAAC,SAAS,EAAE,WAAW,CAAC,CAAC,CAAC;IAChE,CAAC;IAAC,OAAO,GAAG,EAAE,CAAC;QACb,OAAO,CAAC,MAAM,CAAC,KAAK,CAClB,+CAA+C,MAAM,CAAC,GAAG,CAAC,KAAK;YAC7D,0BAA0B,CAC7B,CAAC;QACF,OAAO,CAAC,CAAC;IACX,CAAC;IAED,MAAM,MAAM,GAAG,mBAAI,CAAC,YAAY,CAAC,CAAC,GAAG,EAAE,GAAG,EAAE,EAAE;QAC5C,MAAM,GAAG,GAAG,CAAC,GAAG,CAAC,GAAG,IAAI,GAAG,CAAC,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;QAC3C,IAAI,GAAG,KAAK,aAAa,EAAE,CAAC;YAC1B,GAAG,CAAC,SAAS,CAAC,GAAG,EAAE,EAAE,cAAc,EAAE,kBAAkB,EAAE,CAAC,CAAC;YAC3D,GAAG,CAAC,GAAG,CAAC,SAAS,CAAC,CAAC;QACrB,CAAC;aAAM,IAAI,GAAG,KAAK,YAAY,EAAE,CAAC;YAChC,GAAG,CAAC,SAAS,CAAC,GAAG,EAAE;gBACjB,cAAc,EAAE,uCAAuC;aACxD,CAAC,CAAC;YACH,GAAG,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC;QACpB,CAAC;aAAM,CAAC;YACN,GAAG,CAAC,SAAS,CAAC,GAAG,EAAE,EAAE,cAAc,EAAE,0BAA0B,EAAE,CAAC,CAAC;YACnE,GAAG,CAAC,GAAG,CAAC,SAAS,CAAC,CAAC;QACrB,CAAC;IACH,CAAC,CAAC,CAAC;IAEH,MAAM,CAAC,MAAM,CAAC,IAAI,CAAC,IAAI,EAAE,WAAW,EAAE,GAAG,EAAE;QACzC,MAAM,OAAO,GAAG,MAAM,CAAC,OAAO,EAAE,CAAC;QACjC,MAAM,IAAI,GACR,OAAO,OAAO,KAAK,QAAQ,IAAI,OAAO,CAAC,CAAC,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC;QACpE,MAAM,GAAG,GAAG,oBAAoB,IAAI,GAAG,CAAC;QACxC,MAAM,MAAM,GAAG,OAAO,CAAC,MAAM,CAAC;QAC9B,OAAO,CAAC,MAAM,CAAC,KAAK,CAClB,gBAAgB,MAAM,CAAC,KAAK,CAAC,cAAc,EAAE,YAAY,MAAM,CAAC,KAAK,CAAC,cAAc,EAAE,QAAQ;YAC5F,UAAU,MAAM,CAAC,QAAQ,CAAC,cAAc,EAAE,MAAM,MAAM,CAAC,QAAQ,CAAC,cAAc,EAAE,KAAK,CACxF,CAAC;QACF,OAAO,CAAC,MAAM,CAAC,KAAK,CAAC,yCAAyC,GAAG,IAAI,CAAC,CAAC;QACvE,OAAO,CAAC,MAAM,CAAC,KAAK,CAAC,sCAAsC,CAAC,CAAC;QAC7D,IAAI,IAAI,CAAC,IAAI;YAAE,WAAW,CAAC,GAAG,CAAC,CAAC;IAClC,CAAC,CAAC,CAAC;IACH,wEAAwE;AAC1E,CAAC;AAED,kFAAkF;AAClF,SAAS,WAAW,CAAC,GAAW;IAC9B,IAAI,CAAC;QACH,IAAI,OAAO,CAAC,QAAQ,KAAK,OAAO;YAC9B,IAAA,0BAAK,EAAC,KAAK,EAAE,CAAC,IAAI,EAAE,OAAO,EAAE,EAAE,EAAE,GAAG,CAAC,EAAE;gBACrC,KAAK,EAAE,QAAQ;gBACf,QAAQ,EAAE,IAAI;aACf,CAAC,CAAC,KAAK,EAAE,CAAC;aACR,IAAI,OAAO,CAAC,QAAQ,KAAK,QAAQ;YACpC,IAAA,0BAAK,EAAC,MAAM,EAAE,CAAC,GAAG,CAAC,EAAE,EAAE,KAAK,EAAE,QAAQ,EAAE,QAAQ,EAAE,IAAI,EAAE,CAAC,CAAC,KAAK,EAAE,CAAC;;YAC/D,IAAA,0BAAK,EAAC,UAAU,EAAE,CAAC,GAAG,CAAC,EAAE,EAAE,KAAK,EAAE,QAAQ,EAAE,QAAQ,EAAE,IAAI,EAAE,CAAC,CAAC,KAAK,EAAE,CAAC;IAC7E,CAAC;IAAC,MAAM,CAAC;QACP,kDAAkD;IACpD,CAAC;AACH,CAAC"}

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "@ttsc/graph",
-  "version": "0.18.4",
+  "version": "0.19.1",
   "description": "Checker-resolved architecture graph over MCP for coding agents, backed by ttsc's in-process TypeScript-Go compiler.",
   "main": "lib/index.js",
   "types": "lib/index.d.ts",
@@ -16,8 +16,8 @@
   },
   "dependencies": {
     "@modelcontextprotocol/sdk": "^1.26.0",
-    "@typia/mcp": "^13.0.0",
-    "typia": "^13.0.0"
+    "@typia/mcp": "13.1.0",
+    "typia": "13.1.0"
   },
   "keywords": [
     "ttsc",
@@ -39,7 +39,7 @@
     "three": "^0.184.0",
     "three-forcegraph": "^1.43.4",
     "typescript": "^7.0.2",
-    "ttsc": "0.18.4"
+    "ttsc": "0.19.1"
   },
   "repository": {
     "type": "git",

package/src/TtscGraphApplication.ts

@@ -1,5 +1,10 @@
 import { TtscGraphMemory } from "./model/TtscGraphMemory";
-import { resultGuide, resultNext } from "./server/resultGuide";
+import {
+  RESULT_AUDIT,
+  RESULT_AUDIT_ESCAPE,
+  RESULT_AUDIT_SELECTION,
+} from "./server/resultAudit";
+import { resultNext } from "./server/resultNext";
 import { runDetails } from "./server/runDetails";
 import { runEntrypoints } from "./server/runEntrypoints";
 import { runLookup } from "./server/runLookup";
@@ -38,65 +43,91 @@ export class TtscGraphApplication implements ITtscGraphApplication {
 
   public async inspect_typescript_graph(
     props: ITtscGraphApplication.IProps,
-  ): Promise<ITtscGraphApplication.IResult> {
+  ): Promise<ITtscGraphApplication.IOutput> {
     if (props.request.type === "escape") {
       const result = this.escape(props.request.reason);
       if (props.request.nextStep !== undefined) {
         result.nextStep = props.request.nextStep;
       }
       return {
+        audit: RESULT_AUDIT_ESCAPE,
+        next: resultNext(
+          "outside",
+          "The caller chose to leave the graph, so this call carries no graph facts.",
+        ),
         result,
       };
     }
     const graph = await this.graph();
     switch (props.request.type) {
-      case "entrypoints":
+      case "entrypoints": {
+        // A ranked shortlist matched against the question: its facts are
+        // compiler-verified, but its selection is heuristic, so it carries the
+        // selection audit rather than the exact-structure one.
+        const r = runEntrypoints(graph, props.request);
         return {
-          result: runEntrypoints(graph, props.request),
+          audit: RESULT_AUDIT_SELECTION,
+          next: r.next,
+          result: r.result,
         };
-      case "lookup":
+      }
+      case "lookup": {
+        // Natural-query ranker (see `runLookup`): scored, ranked, per-file
+        // capped, and limited, so the selection is heuristic.
+        const r = runLookup(graph, props.request);
         return {
-          result: runLookup(graph, props.request),
+          audit: RESULT_AUDIT_SELECTION,
+          next: r.next,
+          result: r.result,
         };
-      case "trace":
+      }
+      case "trace": {
+        const r = runTrace(graph, props.request);
         return {
-          result: runTrace(graph, props.request),
+          audit: RESULT_AUDIT,
+          next: r.next,
+          result: r.result,
         };
-      case "details":
+      }
+      case "details": {
+        const r = runDetails(graph, props.request);
         return {
-          result: runDetails(graph, props.request),
+          audit: RESULT_AUDIT,
+          next: r.next,
+          result: r.result,
         };
-      case "overview":
+      }
+      case "overview": {
+        const r = runOverview(graph, props.request);
         return {
-          result: runOverview(graph, props.request),
+          audit: RESULT_AUDIT,
+          next: r.next,
+          result: r.result,
         };
-      case "tour":
+      }
+      case "tour": {
+        // The tour ranks against the question, and the question is `props`
+        // — the caller wrote it once, at the top, in the user's words. It
+        // ranks seeds, walks bounded flows, and slices to a limit, so its
+        // selection is heuristic.
+        const r = runTour(graph, props.request, props.question);
         return {
-          result: runTour(graph, props.request),
+          audit: RESULT_AUDIT_SELECTION,
+          next: r.next,
+          result: r.result,
         };
+      }
       default:
         props.request satisfies never;
         throw new Error("Unknown graph request type");
     }
   }
 
-  private escape(
-    reason: string,
-    nextStep?: string,
-    action: "answer" | "outside" | "clarify" = "outside",
-  ): ITtscGraphEscape {
+  private escape(reason: string, nextStep?: string): ITtscGraphEscape {
     return {
       type: "escape",
       skipped: true,
       reason,
-      next: resultNext(
-        action,
-        nextStep ??
-          "Graph evidence is exhausted or not the next evidence source.",
-      ),
-      guide: resultGuide(
-        "Finish from existing graph evidence, state the graph gap, or ask for clarification.",
-      ),
       ...(nextStep !== undefined ? { nextStep } : {}),
     };
   }

package/src/index.ts

@@ -6,6 +6,21 @@ import { resolveGraphBinary } from "./resolveGraphBinary";
 import { startServer } from "./server/startServer";
 import { runView } from "./view";
 
+/** What a graph result says about where its facts came from. */
+export {
+  RESULT_AUDIT,
+  RESULT_AUDIT_ESCAPE,
+  RESULT_AUDIT_SELECTION,
+} from "./server/resultAudit";
+
+// Programmatic entry points. Each resolves its native binary from the project
+// `cwd` it is given (see `resolveGraphBinary`), so a caller that graphs a
+// project other than its own process directory names it once and the binary is
+// found under that project's installed `ttsc`.
+export { resolveGraphBinary } from "./resolveGraphBinary";
+export { loadGraph } from "./model/loadGraph";
+export { TtscGraphSession } from "./model/TtscGraphSession";
+
 // The server version reported in the MCP handshake; read from this package.
 const VERSION: string = (require("../package.json") as { version: string })
   .version;
@@ -65,7 +80,10 @@ export function runGraph(
  * on this process's stdout. Returns the child's exit code.
  */
 function runDump(argv: readonly string[]): number {
-  const binary = resolveGraphBinary();
+  // Resolve the native binary from the target project the caller named with
+  // `--cwd`, not from wherever the launcher process happened to start.
+  const { cwd } = parseProjectArgs(argv);
+  const binary = resolveGraphBinary(process.env, cwd);
   if (binary === null) {
     process.stderr.write(
       "@ttsc/graph: could not resolve the ttscgraph binary. " +

package/src/model/TtscGraphMemory.ts

@@ -1,6 +1,8 @@
 import { ITtscGraphDump } from "../structures/ITtscGraphDump";
 import { ITtscGraphEdge } from "../structures/ITtscGraphEdge";
+import { ITtscGraphEvidence } from "../structures/ITtscGraphEvidence";
 import { ITtscGraphNode } from "../structures/ITtscGraphNode";
+import { ITtscGraphSpan } from "../structures/ITtscGraphSpan";
 import { TtscGraphEdgeKind } from "../structures/TtscGraphEdgeKind";
 
 /**
@@ -122,6 +124,24 @@ function fileNodeId(file: string): string {
   return file;
 }
 
+/**
+ * A wire span with its file put back: the one the builder left out because the
+ * reader has it, or the one it kept because it could not be derived (an
+ * implementation in another file).
+ */
+function spanIn(span: ITtscGraphSpan, file: string): ITtscGraphEvidence {
+  return { ...span, file: span.file ?? file };
+}
+
+/**
+ * The source file a node id names. An id is `path#Qualified.Name:kind`, and a
+ * file node's id is the path itself.
+ */
+function fileOfNodeId(id: string): string {
+  const hash = id.indexOf("#");
+  return hash === -1 ? id : id.slice(0, hash);
+}
+
 function basename(file: string): string {
   const slash = file.lastIndexOf("/");
   return slash >= 0 ? file.slice(slash + 1) : file;
@@ -136,9 +156,49 @@ function synthesize(dump: ITtscGraphDump): {
   nodes: ITtscGraphNode[];
   edges: ITtscGraphEdge[];
 } {
-  // Clone nodes so property refinement does not mutate the caller's dump.
-  const nodes: ITtscGraphNode[] = dump.nodes.map((n) => ({ ...n }));
-  const edges: ITtscGraphEdge[] = dump.edges.slice();
+  // A module node is the dump's name for a source file's export surface, and a
+  // file node is this layer's name for the same file. Fold the two: the module
+  // keeps its file present here even when the file declares nothing (a barrel),
+  // and its `exports` edges are re-anchored on the file id every other tool
+  // already traverses. What the module carried, the file now carries.
+  const moduleFiles = new Set(
+    dump.nodes.filter((n) => n.kind === "module").map((n) => n.file),
+  );
+  const moduleIds = new Map(
+    dump.nodes.filter((n) => n.kind === "module").map((n) => [n.id, n.file]),
+  );
+  // Clone nodes so property refinement does not mutate the caller's dump, and
+  // put back the file the builder left out of every span: a node's span is in
+  // the node's file, an edge's span is in the file its `from` id names. The
+  // builder omits both because they are exactly reconstructible and they are not
+  // small — the two copies are 17% of the document, 55 MB of VS Code's 323 MB,
+  // paid again in the encode, the pipe, the parse and the validation. Nothing
+  // downstream of this line sees a span without its file.
+  const nodes: ITtscGraphNode[] = dump.nodes
+    .filter((n) => n.kind !== "module")
+    .map((n) => {
+      const { evidence, implementation, ...rest } = n;
+      return {
+        ...rest,
+        ...(evidence !== undefined
+          ? { evidence: spanIn(evidence, n.file) }
+          : {}),
+        ...(implementation !== undefined
+          ? { implementation: spanIn(implementation, n.file) }
+          : {}),
+      };
+    });
+  const edges: ITtscGraphEdge[] = dump.edges.map((edge) => {
+    const { evidence, ...rest } = edge;
+    const from = moduleIds.get(edge.from);
+    return {
+      ...rest,
+      ...(from !== undefined ? { from: fileNodeId(from) } : {}),
+      ...(evidence !== undefined
+        ? { evidence: spanIn(evidence, fileOfNodeId(edge.from)) }
+        : {}),
+    };
+  });
 
   // Index workspace nodes by (file, within-file key) so ownership can resolve a
   // member to its declaring class/namespace.
@@ -161,23 +221,34 @@ function synthesize(dump: ITtscGraphDump): {
     }
   }
 
-  // One file container node per distinct workspace source file.
+  // One file container node per distinct workspace source file, plus every file
+  // the dump saw an export surface on — a barrel declares nothing, so its only
+  // trace in the dump is its module node, and it is exactly the file a consumer
+  // imports the package from.
   const fileNodes = new Map<string, ITtscGraphNode>();
+  const addFileNode = (file: string): void => {
+    if (file === "" || fileNodes.has(file)) return;
+    fileNodes.set(file, {
+      id: fileNodeId(file),
+      kind: "file",
+      name: basename(file),
+      file,
+      external: false,
+    });
+  };
   for (const node of nodes) {
-    if (node.external || node.file === "") continue;
-    if (!fileNodes.has(node.file)) {
-      fileNodes.set(node.file, {
-        id: fileNodeId(node.file),
-        kind: "file",
-        name: basename(node.file),
-        file: node.file,
-        external: false,
-      });
-    }
+    if (node.external) continue;
+    addFileNode(node.file);
   }
+  for (const file of moduleFiles) addFileNode(file);
 
   // Ownership: a member is contained by its owner; a top-level declaration by
-  // its file. Exports: a file exports each of its public nodes.
+  // its file. Exports are not synthesized here: the dump's `exports` edges come
+  // from the checker's export table, which follows re-exports and barrels, so
+  // they say which module puts a symbol on the wire. Deriving them from the
+  // `exported` flag instead would say only that the declaring file made it
+  // public, which is the fact that cannot tell a package's front door from its
+  // legacy subpath.
   const structural: ITtscGraphEdge[] = [];
   const membersByOwner = new Map<string, ITtscGraphNode[]>();
   for (const node of nodes) {
@@ -190,13 +261,6 @@ function synthesize(dump: ITtscGraphDump): {
       to: node.id,
       kind: "contains",
     });
-    if (node.exported) {
-      structural.push({
-        from: fileNodeId(node.file),
-        to: node.id,
-        kind: "exports" satisfies TtscGraphEdgeKind,
-      });
-    }
   }
 
   const synthesized = [...edges, ...structural];

package/src/model/TtscGraphSession.ts

@@ -45,7 +45,11 @@ export class TtscGraphSession {
     tsconfig: string;
     binary?: string;
   }) {
-    const binary = options.binary ?? resolveGraphBinary();
+    // Resolve the platform binary from the project this session serves, so the
+    // MCP server started from an unrelated directory still finds the target's
+    // installed `ttsc`.
+    const binary =
+      options.binary ?? resolveGraphBinary(process.env, options.cwd);
     if (binary === null) {
       throw new Error(
         "@ttsc/graph: could not resolve the ttscgraph binary. " +

package/src/model/loadGraph.ts

@@ -37,7 +37,9 @@ export function loadGraph(
 ): TtscGraphMemory {
   const cwd = options.cwd ?? process.cwd();
   const tsconfig = options.tsconfig ?? "tsconfig.json";
-  const binary = options.binary ?? resolveGraphBinary();
+  // Resolve the platform binary from the selected project cwd, not the caller's
+  // process directory, so a one-shot load names its own installation.
+  const binary = options.binary ?? resolveGraphBinary(process.env, cwd);
   if (binary === null) {
     throw new Error(
       "@ttsc/graph: could not resolve the ttscgraph binary. " +

package/src/resolveGraphBinary.ts

@@ -15,8 +15,10 @@ import path from "node:path";
  * 2. The per-platform npm package `@ttsc/<platform>-<arch>/bin/ttscgraph[.exe]`.
  *    That package carries `ttsc`, `ttscserver`, and `ttscgraph` together and is
  *    an `optionalDependency` of `ttsc`, so it is resolved from `ttsc`'s
- *    location — found from `process.cwd()` (the project where the agent ran the
- *    server).
+ *    location — found from `cwd`, the project the caller selected (via `--cwd`
+ *    or an API `cwd` option), defaulting to `process.cwd()` when no project was
+ *    named. A launcher started from an unrelated directory still resolves the
+ *    `ttsc` installed under the target project it was asked to graph.
  */
 export function resolveGraphBinary(
   env: NodeJS.ProcessEnv = process.env,
@@ -27,8 +29,10 @@ export function resolveGraphBinary(
   }
   const exe = process.platform === "win32" ? "ttscgraph.exe" : "ttscgraph";
   try {
+    // Anchor package lookup at the absolute project root so a relative `--cwd`
+    // resolves the same way the native process interprets it.
     const ttscPackageJson = require.resolve("ttsc/package.json", {
-      paths: [cwd],
+      paths: [path.resolve(cwd)],
     });
     const fromTtsc = createRequire(ttscPackageJson);
     return fromTtsc.resolve(

package/src/server/createServer.ts

@@ -1,31 +1,38 @@
 import { McpServer } from "@modelcontextprotocol/sdk/server/mcp.js";
 import { createMcpServer } from "@typia/mcp";
-import typia, { type ILlmController } from "typia";
+import typia from "typia";
 
 import { TtscGraphApplication, TtscGraphSource } from "../TtscGraphApplication";
 import { ITtscGraphApplication } from "../structures/ITtscGraphApplication";
 
 /**
- * Build the MCP server for a graph. `typia.llm.application` reflects
- * {@link ITtscGraphApplication} into the tool schema and validator (no
- * hand-written schema), and `createMcpServer` from `@typia/mcp` handles the
- * list/call registration, argument validation, and structured output.
+ * Build the MCP server for a graph.
  *
- * We assemble the `ILlmController` (`{ protocol, name, application, execute }`)
- * directly rather than via `typia.llm.controller` so the server is named
- * "ttsc-graph" on our terms, not coupled to a reflected class name. Handshake
- * instructions come from the class JSDoc; the single tool is named from its
- * method, `inspect_typescript_graph`.
+ * `typia.llm.controller` reflects {@link ITtscGraphApplication} into the tool's
+ * input and output schemas and its argument validator, with no hand-written
+ * schema: the interface's JSDoc becomes the handshake instructions, the
+ * method's becomes the tool description, and every property's becomes the
+ * description of that field — including `audit`, whose JSDoc is how a caller
+ * learns what the server checked before it answered.
+ *
+ * The registration was hand-written here for a while, because a tool that
+ * declares an output schema must answer with `structuredContent` and the helper
+ * also serialized the same JSON into a text block: the payload crossed the wire
+ * twice, a client counted both copies against its tool-result cap, and a 30 KB
+ * tour arrived as 60 KB, blew the cap, and was spilled to a file the model then
+ * shelled out to read back. `@typia/mcp` 13.1.0 ships the structured result
+ * once (samchon/typia#2020), so the hand-written server had nothing left to fix
+ * and the library owns the registration again.
  */
 export function createServer(
   graph: TtscGraphSource,
   version: string,
 ): McpServer {
-  const controller: ILlmController<ITtscGraphApplication> = {
-    protocol: "class",
-    name: "ttsc-graph",
-    application: typia.llm.application<ITtscGraphApplication>(),
-    execute: new TtscGraphApplication(graph),
-  };
-  return createMcpServer(controller, version);
+  void version;
+  return createMcpServer(
+    typia.llm.controller<ITtscGraphApplication>(
+      "ttsc-graph",
+      new TtscGraphApplication(graph),
+    ),
+  );
 }

package/src/server/exportSurface.ts

@@ -0,0 +1,40 @@
+import { TtscGraphMemory } from "../model/TtscGraphMemory";
+
+/**
+ * How public a symbol is, counted from the graph and nothing else.
+ *
+ * A module's `exports` edges are the checker's export table, resolved through
+ * every re-export and barrel it passes. So a symbol carries one edge per module
+ * that puts it on the wire, and that count is the project's own answer to how
+ * far forward the symbol stands: an internal helper is exported by the file
+ * that declares it or by nothing at all, while the name a consumer imports from
+ * the package has been re-exported up a chain of barrels and carries an edge
+ * from each one.
+ *
+ * On zod the count is the whole difference between the current API and the
+ * previous major it still ships: `parse` and `safeParse` in v4's classic
+ * surface carry five, v3's `ZodString` carries three, and v3's
+ * `ZodType.safeParse` — a class method, which no export table ever names —
+ * carries none. A ranker that knew only the `exported` flag saw all of these as
+ * equally public, picked the one whose name matched the question best, and
+ * opened zod's tour on the legacy implementation.
+ *
+ * The count is a fact the compiler resolved. It reads no package.json, guesses
+ * from no filename, and holds for a project that has neither.
+ */
+export function exportFanIn(graph: TtscGraphMemory, id: string): number {
+  let count = 0;
+  for (const edge of graph.incoming(id)) if (edge.kind === "exports") count++;
+  return count;
+}
+
+/** True when the dump carries an export surface at all. */
+export function hasExportSurface(graph: TtscGraphMemory): boolean {
+  const known = cache.get(graph);
+  if (known !== undefined) return known;
+  const found = graph.edges.some((edge) => edge.kind === "exports");
+  cache.set(graph, found);
+  return found;
+}
+
+const cache = new WeakMap<TtscGraphMemory, boolean>();