@ttsc/graph 0.19.2 → 0.20.0

package/lib/server/resolveHandle.js.map

@@ -1 +1 @@
-{"version":3,"file":"resolveHandle.js","sourceRoot":"","sources":["../../src/server/resolveHandle.ts"],"names":[],"mappings":";;;AAEA,mDAA8C;AAC9C,6CAA6C;AAO7C;;;;;;;;;;;;;;;;;;;;;;;;;GAyBG;AACH,4BACE,KAAsB,EACtB,MAAc,EACd,cAAc,GAAG,EAAE;IAEnB,MAAM,IAAI,GAAG,KAAK,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;IAChC,IAAI,IAAI,KAAK,SAAS;QAAE,OAAO,EAAE,IAAI,EAAE,IAAI,EAAE,CAAC;IAE9C,MAAM,MAAM,GAAG,gBAAgB,CAAC,KAAK,EAAE,MAAM,EAAE,cAAc,CAAC,CAAC;IAC/D,IAAI,MAAM,CAAC,IAAI,KAAK,SAAS,IAAI,MAAM,CAAC,UAAU,KAAK,SAAS;QAC9D,OAAO,IAAI,CAAC,KAAK,EAAE,MAAM,EAAE,cAAc,CAAC,CAAC;IAE7C,MAAM,MAAM,GAAG,oBAAoB,CAAC,KAAK,EAAE,MAAM,EAAE,cAAc,CAAC,CAAC;IACnE,IAAI,MAAM,CAAC,IAAI,KAAK,SAAS,IAAI,MAAM,CAAC,UAAU,KAAK,SAAS;QAC9D,OAAO,IAAI,CAAC,KAAK,EAAE,MAAM,EAAE,cAAc,CAAC,CAAC;IAE7C,MAAM,MAAM,GAAG,YAAY,CAAC,MAAM,CAAC,IAAI,YAAY,CAAC,MAAM,CAAC,CAAC;IAC5D,IAAI,MAAM,KAAK,SAAS;QACtB,OAAO,IAAI,CACT,KAAK,EACL,gBAAgB,CAAC,KAAK,EAAE,MAAM,EAAE,cAAc,CAAC,EAC/C,cAAc,CACf,CAAC;IACJ,OAAO,EAAE,CAAC;AACZ,CAAC;AAED;;;;;;;GAOG;AACH,SAAS,YAAY,CAAC,MAAc;IAClC,MAAM,GAAG,GAAG,MAAM,CAAC,WAAW,CAAC,GAAG,CAAC,CAAC;IACpC,IAAI,GAAG,IAAI,CAAC;QAAE,OAAO,SAAS,CAAC;IAC/B,MAAM,MAAM,GAAG,MAAM,CAAC,KAAK,CAAC,GAAG,GAAG,CAAC,CAAC,CAAC;IACrC,OAAO,MAAM,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,SAAS,CAAC;AAChD,CAAC;AAED,6EAA6E;AAC7E,SAAS,YAAY,CAAC,MAAc;IAClC,MAAM,IAAI,GAAG,MAAM,CAAC,WAAW,CAAC,GAAG,CAAC,CAAC;IACrC,IAAI,IAAI,GAAG,CAAC;QAAE,OAAO,SAAS,CAAC;IAC/B,MAAM,MAAM,GAAG,MAAM,CAAC,KAAK,CAAC,IAAI,GAAG,CAAC,CAAC,CAAC;IACtC,MAAM,IAAI,GAAG,MAAM,CAAC,WAAW,CAAC,GAAG,CAAC,CAAC;IACrC,MAAM,IAAI,GAAG,IAAI,GAAG,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC;IACvD,OAAO,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,SAAS,CAAC;AAC5C,CAAC;AAED,SAAS,gBAAgB,CACvB,KAAsB,EACtB,IAAY,EACZ,cAAsB;IAEtB,MAAM,KAAK,GAAG,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC;IAClC,IAAI,KAAK,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,EAAE,IAAI,EAAE,KAAK,CAAC,CAAC,CAAC,EAAE,CAAC;IAClD,IAAI,KAAK,CAAC,MAAM,GAAG,CAAC;QAAE,OAAO,EAAE,UAAU,EAAE,KAAK,CAAC,KAAK,CAAC,CAAC,EAAE,cAAc,CAAC,EAAE,CAAC;IAE5E,IAAI,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,EAAE,CAAC;QACvB,MAAM,MAAM,GAAG,IAAI,IAAI,EAAE,CAAC;QAC1B,MAAM,aAAa,GAAG,KAAK,CAAC,KAAK,CAAC,MAAM,CACtC,CAAC,IAAI,EAAE,EAAE,CACP,IAAI,CAAC,IAAI,KAAK,MAAM,IAAI,IAAI,CAAC,aAAa,EAAE,QAAQ,CAAC,MAAM,CAAC,KAAK,IAAI,CACxE,CAAC;QACF,IAAI,aAAa,CAAC,MAAM,KAAK,CAAC;YAAE,OAAO,EAAE,IAAI,EAAE,aAAa,CAAC,CAAC,CAAC,EAAE,CAAC;QAClE,IAAI,aAAa,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YAC7B,OAAO,EAAE,UAAU,EAAE,aAAa,CAAC,KAAK,CAAC,CAAC,EAAE,cAAc,CAAC,EAAE,CAAC;QAChE,CAAC;IACH,CAAC;IACD,OAAO,EAAE,CAAC;AACZ,CAAC;AAED;;;;;GAKG;AACH,SAAS,oBAAoB,CAC3B,KAAsB,EACtB,MAAc,EACd,cAAsB;IAEtB,MAAM,GAAG,GAAG,MAAM,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC;IAChC,IAAI,GAAG,IAAI,CAAC;QAAE,OAAO,EAAE,CAAC;IACxB,MAAM,IAAI,GAAG,MAAM,CAAC,KAAK,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,WAAW,EAAE,CAAC;IAChD,MAAM,IAAI,GAAG,MAAM,CAAC,KAAK,CAAC,GAAG,GAAG,CAAC,CAAC,CAAC;IACnC,IAAI,IAAI,KAAK,EAAE;QAAE,OAAO,EAAE,CAAC;IAC3B,MAAM,OAAO,GAAG,KAAK;SAClB,OAAO,CAAC,IAAI,CAAC;SACb,MAAM,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,QAAQ,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,IAAI,CAAC,CAAC;IAClD,IAAI,OAAO,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,EAAE,IAAI,EAAE,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC;IACtD,IAAI,OAAO,CAAC,MAAM,GAAG,CAAC;QACpB,OAAO,EAAE,UAAU,EAAE,OAAO,CAAC,KAAK,CAAC,CAAC,EAAE,cAAc,CAAC,EAAE,CAAC;IAC1D,OAAO,EAAE,CAAC;AACZ,CAAC;AAED,qDAAqD;AACrD,SAAS,QAAQ,CAAC,IAAY;IAC5B,MAAM,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,WAAW,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC;IACnD,OAAO,IAAI,CAAC,OAAO,CAAC,iBAAiB,EAAE,EAAE,CAAC,CAAC,WAAW,EAAE,CAAC;AAC3D,CAAC;AAED;;;;;;;GAOG;AACH,SAAS,IAAI,CACX,KAAsB,EACtB,QAA8B,EAC9B,cAAsB;IAEtB,IAAI,QAAQ,CAAC,UAAU,KAAK,SAAS;QAAE,OAAO,QAAQ,CAAC;IACvD,MAAM,MAAM,GAAG,CAAC,GAAG,QAAQ,CAAC,UAAU,CAAC;SACpC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,cAAc,CAAC,KAAK,EAAE,CAAC,CAAC,GAAG,cAAc,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC;SACnE,KAAK,CAAC,CAAC,EAAE,cAAc,CAAC,CAAC;IAC5B,OAAO,EAAE,UAAU,EAAE,MAAM,EAAE,CAAC;AAChC,CAAC;AAED,SAAS,cAAc,CAAC,KAAsB,EAAE,IAAoB;IAClE,IAAI,KAAK,GAAG,IAAI,CAAC,GAAG,CAAC,EAAE,EAAE,IAAI,CAAC,IAAI,CAAC,CAAC,GAAG,IAAA,2BAAW,EAAC,KAAK,EAAE,IAAI,CAAC,EAAE,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC;IAC1E,IAAI,IAAI,CAAC,QAAQ;QAAE,KAAK,IAAI,EAAE,CAAC;IAC/B,IAAI,IAAI,CAAC,QAAQ;QAAE,KAAK,IAAI,EAAE,CAAC;IAC/B,IAAI,IAAA,0BAAa,EAAC,IAAI,CAAC,IAAI,CAAC;QAAE,KAAK,IAAI,EAAE,CAAC;IAC1C,MAAM,MAAM,GACV,KAAK,CAAC,QAAQ,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC,MAAM,GAAG,KAAK,CAAC,QAAQ,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC,MAAM,CAAC;IAClE,KAAK,IAAI,IAAI,CAAC,GAAG,CAAC,EAAE,EAAE,IAAI,CAAC,IAAI,CAAC,CAAC,GAAG,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC;IACjD,OAAO,KAAK,CAAC;AACf,CAAC"}
+{"version":3,"file":"resolveHandle.js","sourceRoot":"","sources":["../../src/server/resolveHandle.ts"],"names":[],"mappings":";;;AACA,8DAAgE;AAEhE,mDAA8C;AAC9C,6CAA6C;AAO7C;;;;;;;;;;;;;;;;;;;;;;;;;GAyBG;AACH,4BACE,KAAsB,EACtB,MAAc,EACd,cAAc,GAAG,EAAE;IAEnB,MAAM,IAAI,GAAG,KAAK,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;IAChC,IAAI,IAAI,KAAK,SAAS;QAAE,OAAO,EAAE,IAAI,EAAE,IAAI,EAAE,CAAC;IAE9C,MAAM,MAAM,GAAG,gBAAgB,CAAC,KAAK,EAAE,MAAM,CAAC,CAAC;IAC/C,IAAI,MAAM,CAAC,IAAI,KAAK,SAAS,IAAI,MAAM,CAAC,UAAU,KAAK,SAAS;QAC9D,OAAO,IAAI,CAAC,KAAK,EAAE,MAAM,EAAE,cAAc,CAAC,CAAC;IAE7C,MAAM,MAAM,GAAG,oBAAoB,CAAC,KAAK,EAAE,MAAM,CAAC,CAAC;IACnD,IAAI,MAAM,CAAC,IAAI,KAAK,SAAS,IAAI,MAAM,CAAC,UAAU,KAAK,SAAS;QAC9D,OAAO,IAAI,CAAC,KAAK,EAAE,MAAM,EAAE,cAAc,CAAC,CAAC;IAE7C,MAAM,MAAM,GAAG,YAAY,CAAC,MAAM,CAAC,IAAI,YAAY,CAAC,MAAM,CAAC,CAAC;IAC5D,IAAI,MAAM,KAAK,SAAS;QACtB,OAAO,IAAI,CAAC,KAAK,EAAE,gBAAgB,CAAC,KAAK,EAAE,MAAM,CAAC,EAAE,cAAc,CAAC,CAAC;IACtE,OAAO,EAAE,CAAC;AACZ,CAAC;AAED;;;;;;;GAOG;AACH,SAAS,YAAY,CAAC,MAAc;IAClC,MAAM,GAAG,GAAG,MAAM,CAAC,WAAW,CAAC,GAAG,CAAC,CAAC;IACpC,IAAI,GAAG,IAAI,CAAC;QAAE,OAAO,SAAS,CAAC;IAC/B,MAAM,MAAM,GAAG,MAAM,CAAC,KAAK,CAAC,GAAG,GAAG,CAAC,CAAC,CAAC;IACrC,OAAO,MAAM,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,SAAS,CAAC;AAChD,CAAC;AAED,6EAA6E;AAC7E,SAAS,YAAY,CAAC,MAAc;IAClC,OAAO,IAAA,sCAAoB,EAAC,MAAM,CAAC,EAAE,IAAI,CAAC;AAC5C,CAAC;AAED,SAAS,gBAAgB,CACvB,KAAsB,EACtB,IAAY;IAEZ,MAAM,KAAK,GAAG,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC;IAClC,IAAI,KAAK,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,EAAE,IAAI,EAAE,KAAK,CAAC,CAAC,CAAC,EAAE,CAAC;IAClD,IAAI,KAAK,CAAC,MAAM,GAAG,CAAC;QAAE,OAAO,EAAE,UAAU,EAAE,CAAC,GAAG,KAAK,CAAC,EAAE,CAAC;IAExD,IAAI,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,EAAE,CAAC;QACvB,MAAM,MAAM,GAAG,IAAI,IAAI,EAAE,CAAC;QAC1B,MAAM,aAAa,GAAG,KAAK,CAAC,KAAK,CAAC,MAAM,CACtC,CAAC,IAAI,EAAE,EAAE,CACP,IAAI,CAAC,IAAI,KAAK,MAAM,IAAI,IAAI,CAAC,aAAa,EAAE,QAAQ,CAAC,MAAM,CAAC,KAAK,IAAI,CACxE,CAAC;QACF,IAAI,aAAa,CAAC,MAAM,KAAK,CAAC;YAAE,OAAO,EAAE,IAAI,EAAE,aAAa,CAAC,CAAC,CAAC,EAAE,CAAC;QAClE,IAAI,aAAa,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YAC7B,OAAO,EAAE,UAAU,EAAE,aAAa,EAAE,CAAC;QACvC,CAAC;IACH,CAAC;IACD,OAAO,EAAE,CAAC;AACZ,CAAC;AAED;;;;;GAKG;AACH,SAAS,oBAAoB,CAC3B,KAAsB,EACtB,MAAc;IAEd,MAAM,GAAG,GAAG,MAAM,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC;IAChC,IAAI,GAAG,IAAI,CAAC;QAAE,OAAO,EAAE,CAAC;IACxB,MAAM,IAAI,GAAG,MAAM,CAAC,KAAK,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,WAAW,EAAE,CAAC;IAChD,MAAM,IAAI,GAAG,MAAM,CAAC,KAAK,CAAC,GAAG,GAAG,CAAC,CAAC,CAAC;IACnC,IAAI,IAAI,KAAK,EAAE;QAAE,OAAO,EAAE,CAAC;IAC3B,MAAM,OAAO,GAAG,KAAK;SAClB,OAAO,CAAC,IAAI,CAAC;SACb,MAAM,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,QAAQ,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,IAAI,CAAC,CAAC;IAClD,IAAI,OAAO,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,EAAE,IAAI,EAAE,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC;IACtD,IAAI,OAAO,CAAC,MAAM,GAAG,CAAC;QAAE,OAAO,EAAE,UAAU,EAAE,OAAO,EAAE,CAAC;IACvD,OAAO,EAAE,CAAC;AACZ,CAAC;AAED,qDAAqD;AACrD,SAAS,QAAQ,CAAC,IAAY;IAC5B,MAAM,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,WAAW,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC;IACnD,OAAO,IAAI,CAAC,OAAO,CAAC,iBAAiB,EAAE,EAAE,CAAC,CAAC,WAAW,EAAE,CAAC;AAC3D,CAAC;AAED;;;;;;;GAOG;AACH,SAAS,IAAI,CACX,KAAsB,EACtB,QAA8B,EAC9B,cAAsB;IAEtB,IAAI,QAAQ,CAAC,UAAU,KAAK,SAAS;QAAE,OAAO,QAAQ,CAAC;IACvD,MAAM,MAAM,GAAG,QAAQ,CAAC,UAAU;SAC/B,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,CAAC,EAAE,IAAI,EAAE,KAAK,EAAE,cAAc,CAAC,KAAK,EAAE,IAAI,CAAC,EAAE,CAAC,CAAC;SAC7D,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE;QACb,MAAM,KAAK,GAAG,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC,KAAK,CAAC;QAChC,OAAO,KAAK,KAAK,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,eAAe,CAAC,CAAC,CAAC,IAAI,CAAC,EAAE,EAAE,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;IACrE,CAAC,CAAC;SACD,KAAK,CAAC,CAAC,EAAE,cAAc,CAAC;SACxB,GAAG,CAAC,CAAC,EAAE,IAAI,EAAE,EAAE,EAAE,CAAC,IAAI,CAAC,CAAC;IAC3B,OAAO,EAAE,UAAU,EAAE,MAAM,EAAE,CAAC;AAChC,CAAC;AAED,yEAAyE;AACzE,SAAS,eAAe,CAAC,IAAY,EAAE,KAAa;IAClD,OAAO,IAAI,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;AAClD,CAAC;AAED,SAAS,cAAc,CAAC,KAAsB,EAAE,IAAoB;IAClE,IAAI,KAAK,GAAG,IAAI,CAAC,GAAG,CAAC,EAAE,EAAE,IAAI,CAAC,IAAI,CAAC,CAAC,GAAG,IAAA,2BAAW,EAAC,KAAK,EAAE,IAAI,CAAC,EAAE,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC;IAC1E,IAAI,IAAI,CAAC,QAAQ;QAAE,KAAK,IAAI,EAAE,CAAC;IAC/B,IAAI,IAAI,CAAC,QAAQ;QAAE,KAAK,IAAI,EAAE,CAAC;IAC/B,IAAI,IAAA,0BAAa,EAAC,IAAI,CAAC,IAAI,CAAC;QAAE,KAAK,IAAI,EAAE,CAAC;IAC1C,MAAM,MAAM,GACV,KAAK,CAAC,QAAQ,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC,MAAM,GAAG,KAAK,CAAC,QAAQ,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC,MAAM,CAAC;IAClE,KAAK,IAAI,IAAI,CAAC,GAAG,CAAC,EAAE,EAAE,IAAI,CAAC,IAAI,CAAC,CAAC,GAAG,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC;IACjD,OAAO,KAAK,CAAC;AACf,CAAC"}

package/lib/server/resultAudit.d.ts

@@ -26,12 +26,22 @@
  * anything was checked afterwards — lost two points and put the file reads
  * back.
  *
- * So the weight is carried by the second party, not by the loud voice. The
- * compiler resolving a fact is where the fact came from; the server checking it
- * again on the way out is why the reader does not have to. Say both, in that
- * order, and the instruction that follows reads as a conclusion rather than a
- * demand. Never mystify the result, and never insult the reader for checking
- * it.
+ * So the weight is carried by named provenance, not by a loud voice. State who
+ * resolved the fact and what this payload did with it, and the instruction that
+ * follows reads as a conclusion rather than a demand. Never mystify the result,
+ * and never insult the reader for checking it.
+ *
+ * The claim has to be one this code can keep. An earlier wording said the
+ * server assembled the result and "verified them again on the way out" — a
+ * second pass, by a second party, after assembly. No such pass exists: this
+ * layer holds no `Program` and no checker, it runs one pure projection over an
+ * in-memory `TtscGraphMemory`, and it selects a constant by request type
+ * (#818). What is true is stronger than it sounds and is what the text now
+ * says: the compiler resolved these facts when the snapshot was built, the
+ * graph holds what it resolved, and this result is a projection of exactly
+ * those facts that adds none of its own. A reader who checks that claim finds
+ * it holds; a reader who checked the old one found a promise the code could not
+ * have kept.
  *
  * ## Two guarantees, not one
  *
@@ -47,14 +57,18 @@
  * payload, and told it to stop where the shortlist's coverage was exactly what
  * needed judging.
  *
- * So there are two audits. {@link RESULT_AUDIT} covers the operations that walk
- * from an explicit handle or structure (`trace`, `details`, `overview`): the
- * result is what the graph holds for what you named, bounded only where
- * `truncated` says. {@link RESULT_AUDIT_SELECTION} covers the ranked shortlists
- * (`lookup`, `entrypoints`, `tour`): it keeps the same fact-verification and
- * adds that the _selection_ is heuristic, so whether the shortlist covers the
- * question is the caller's to judge — and a follow-up request or a read of a
- * cited span is a sound next step, not a failure to trust the result.
+ * So the audits split by what the reader must judge. {@link RESULT_AUDIT} covers
+ * the walks from an explicit handle or structure (`trace`, `overview`): the
+ * result is what the graph holds for what you named, bounded where `truncated`
+ * says. {@link RESULT_AUDIT_DETAILS} covers `details`, whose result is not one
+ * bounded whole but two halves — a symbol's own shape, returned complete, and
+ * its fan-out, returned as a slice with `trace` for the rest — so it names
+ * which half to trust outright and which to follow.
+ * {@link RESULT_AUDIT_SELECTION} covers the ranked shortlists (`lookup`,
+ * `entrypoints`, `tour`): it keeps the same fact-verification and adds that the
+ * _selection_ is heuristic, so whether the shortlist covers the question is the
+ * caller's to judge — and a follow-up request or a read of a cited span is a
+ * sound next step, not a failure to trust the result.
  *
  * Keep both narrow, and keep the stop-or-continue decision with the result's
  * `next`, so neither contradicts a partial result that legitimately asks for
@@ -70,5 +84,33 @@ export declare const RESULT_AUDIT: string;
  * many — is heuristic, so coverage is the caller's to judge.
  */
 export declare const RESULT_AUDIT_SELECTION: string;
+/**
+ * The audit for `details`, whose contract is not the other exact operations'.
+ *
+ * `trace` walks and marks where the walk was cut with `truncated`; `details`
+ * does not walk. It resolves a named handle, and its result splits in two. What
+ * a symbol _is_ — its members, its values, its signature — is bounded by the
+ * declaration and returned whole, so the old "trust it, do not open the file"
+ * is finally true of it rather than contradicted by a capped member list. What
+ * a symbol _reaches or is reached by_ — its calls, its type references, its
+ * implementers, its dependents — is bounded by how widely it is used, not by
+ * the symbol, so returning it whole is a `trace`/impact answer of a thousand
+ * refs in a "what is this" call. That half is a short orientation slice, and
+ * the audit has to say which half is which so the reader trusts the complete
+ * one and reaches for `trace` on the other, instead of reading the file for a
+ * member list that is already here.
+ */
+export declare const RESULT_AUDIT_DETAILS: string;
+/**
+ * The details audit for a result whose member list a caller cap truncated.
+ *
+ * The unconditional text tells the reader a symbol's members are complete and
+ * not to open the file for them. After `memberLimit` cuts the list that is
+ * false, and it is the one claim a caller cannot check from the result: the
+ * members that were removed left nothing behind to notice. So the claim is
+ * withdrawn for exactly that half and everything else the audit verifies is
+ * kept.
+ */
+export declare const RESULT_AUDIT_DETAILS_CAPPED: string;
 /** The escape branch carries no graph facts, so it claims none. */
 export declare const RESULT_AUDIT_ESCAPE: string;

package/lib/server/resultAudit.js

@@ -1,6 +1,6 @@
 "use strict";
 Object.defineProperty(exports, "__esModule", { value: true });
-exports.RESULT_AUDIT_ESCAPE = exports.RESULT_AUDIT_SELECTION = exports.RESULT_AUDIT = void 0;
+exports.RESULT_AUDIT_ESCAPE = exports.RESULT_AUDIT_DETAILS_CAPPED = exports.RESULT_AUDIT_DETAILS = exports.RESULT_AUDIT_SELECTION = exports.RESULT_AUDIT = void 0;
 /**
  * The audit stamped as the first property of every
  * {@link ITtscGraphApplication.IOutput}. Because it serializes before `result`,
@@ -29,12 +29,22 @@ exports.RESULT_AUDIT_ESCAPE = exports.RESULT_AUDIT_SELECTION = exports.RESULT_AU
  * anything was checked afterwards — lost two points and put the file reads
  * back.
  *
- * So the weight is carried by the second party, not by the loud voice. The
- * compiler resolving a fact is where the fact came from; the server checking it
- * again on the way out is why the reader does not have to. Say both, in that
- * order, and the instruction that follows reads as a conclusion rather than a
- * demand. Never mystify the result, and never insult the reader for checking
- * it.
+ * So the weight is carried by named provenance, not by a loud voice. State who
+ * resolved the fact and what this payload did with it, and the instruction that
+ * follows reads as a conclusion rather than a demand. Never mystify the result,
+ * and never insult the reader for checking it.
+ *
+ * The claim has to be one this code can keep. An earlier wording said the
+ * server assembled the result and "verified them again on the way out" — a
+ * second pass, by a second party, after assembly. No such pass exists: this
+ * layer holds no `Program` and no checker, it runs one pure projection over an
+ * in-memory `TtscGraphMemory`, and it selects a constant by request type
+ * (#818). What is true is stronger than it sounds and is what the text now
+ * says: the compiler resolved these facts when the snapshot was built, the
+ * graph holds what it resolved, and this result is a projection of exactly
+ * those facts that adds none of its own. A reader who checks that claim finds
+ * it holds; a reader who checked the old one found a promise the code could not
+ * have kept.
  *
  * ## Two guarantees, not one
  *
@@ -50,14 +60,18 @@ exports.RESULT_AUDIT_ESCAPE = exports.RESULT_AUDIT_SELECTION = exports.RESULT_AU
  * payload, and told it to stop where the shortlist's coverage was exactly what
  * needed judging.
  *
- * So there are two audits. {@link RESULT_AUDIT} covers the operations that walk
- * from an explicit handle or structure (`trace`, `details`, `overview`): the
- * result is what the graph holds for what you named, bounded only where
- * `truncated` says. {@link RESULT_AUDIT_SELECTION} covers the ranked shortlists
- * (`lookup`, `entrypoints`, `tour`): it keeps the same fact-verification and
- * adds that the _selection_ is heuristic, so whether the shortlist covers the
- * question is the caller's to judge — and a follow-up request or a read of a
- * cited span is a sound next step, not a failure to trust the result.
+ * So the audits split by what the reader must judge. {@link RESULT_AUDIT} covers
+ * the walks from an explicit handle or structure (`trace`, `overview`): the
+ * result is what the graph holds for what you named, bounded where `truncated`
+ * says. {@link RESULT_AUDIT_DETAILS} covers `details`, whose result is not one
+ * bounded whole but two halves — a symbol's own shape, returned complete, and
+ * its fan-out, returned as a slice with `trace` for the rest — so it names
+ * which half to trust outright and which to follow.
+ * {@link RESULT_AUDIT_SELECTION} covers the ranked shortlists (`lookup`,
+ * `entrypoints`, `tour`): it keeps the same fact-verification and adds that the
+ * _selection_ is heuristic, so whether the shortlist covers the question is the
+ * caller's to judge — and a follow-up request or a read of a cited span is a
+ * sound next step, not a failure to trust the result.
  *
  * Keep both narrow, and keep the stop-or-continue decision with the result's
  * `next`, so neither contradicts a partial result that legitimately asks for
@@ -68,10 +82,10 @@ exports.RESULT_AUDIT_ESCAPE = exports.RESULT_AUDIT_SELECTION = exports.RESULT_AU
 exports.RESULT_AUDIT = `
 AUDITED BEFORE RETURNING. READ FIRST.
 
-The server assembled this \`result\`, then checked it: every fact in it — each name, span,
-edge, signature, and step — was taken back to the type-checked program for the snapshot this
-call synced to, and resolved there. The compiler resolved these facts and the server
-verified them again on the way out, so for this snapshot a fact here cannot be wrong.
+Every fact in this \`result\` — each name, span, edge, signature, and step — was resolved by
+the TypeScript compiler against the program for the snapshot this call synced to, and the
+graph holds what it resolved. This \`result\` is a projection of exactly those facts and adds
+none of its own, so for this snapshot a fact here cannot disagree with the program.
 
 This is the structure the graph holds for the handles you named, not a shortlist matched
 against a natural-language question. Trust every fact it gives and re-verify none: a returned
@@ -90,11 +104,11 @@ after you edit the source.
 exports.RESULT_AUDIT_SELECTION = `
 AUDITED BEFORE RETURNING. READ FIRST.
 
-Each fact in this \`result\` — every name, span, edge, and signature — was taken back to the
-type-checked program for the snapshot this call synced to, and resolved there. The compiler
-resolved these facts and the server verified them again on the way out, so for this snapshot
-a fact here cannot be wrong: a returned span is the citation, not a cue to open the file to
-confirm it.
+Each fact in this \`result\` — every name, span, edge, and signature — was resolved by the
+TypeScript compiler against the program for the snapshot this call synced to, and the graph
+holds what it resolved. This \`result\` is a projection of exactly those facts and adds none of
+its own, so for this snapshot a fact here cannot disagree with the program: a returned span
+is the citation, not a cue to open the file to confirm it.
 
 What was selected is heuristic, not exhaustive. This result was matched against your
 natural-language question, scored and ranked, held to a few hits per file, and cut to a
@@ -105,6 +119,58 @@ span is a sound next step, not a failure to trust the result.
 
 Follow \`next\` for where that leaves the question.
 `.trim();
+/**
+ * The audit for `details`, whose contract is not the other exact operations'.
+ *
+ * `trace` walks and marks where the walk was cut with `truncated`; `details`
+ * does not walk. It resolves a named handle, and its result splits in two. What
+ * a symbol _is_ — its members, its values, its signature — is bounded by the
+ * declaration and returned whole, so the old "trust it, do not open the file"
+ * is finally true of it rather than contradicted by a capped member list. What
+ * a symbol _reaches or is reached by_ — its calls, its type references, its
+ * implementers, its dependents — is bounded by how widely it is used, not by
+ * the symbol, so returning it whole is a `trace`/impact answer of a thousand
+ * refs in a "what is this" call. That half is a short orientation slice, and
+ * the audit has to say which half is which so the reader trusts the complete
+ * one and reaches for `trace` on the other, instead of reading the file for a
+ * member list that is already here.
+ */
+exports.RESULT_AUDIT_DETAILS = `
+AUDITED BEFORE RETURNING. READ FIRST.
+
+Every fact in this \`result\` — each name, span, edge, signature, member, and value — was
+resolved by the TypeScript compiler against the program for the snapshot this call synced to,
+and the graph holds what it resolved. This \`result\` is a projection of exactly those facts
+and adds none of its own, so for this snapshot a fact here cannot disagree with the program.
+
+This is the structure the graph holds for the handles you named. What a symbol is — its
+members, its values, its signature — is complete: trust it and do not open the file to read
+what is already here. What a symbol reaches or is reached by — its calls, its type
+references, its implementers, and under \`neighbors\` its dependents — is a short orientation
+slice, not the whole set, because that grows with how widely a symbol is used; \`trace\`
+follows it in full.
+
+Follow \`next\`: answer from this result, and re-call the graph only when it says inspect, or
+after you edit the source.
+`.trim();
+/**
+ * The details audit for a result whose member list a caller cap truncated.
+ *
+ * The unconditional text tells the reader a symbol's members are complete and
+ * not to open the file for them. After `memberLimit` cuts the list that is
+ * false, and it is the one claim a caller cannot check from the result: the
+ * members that were removed left nothing behind to notice. So the claim is
+ * withdrawn for exactly that half and everything else the audit verifies is
+ * kept.
+ */
+exports.RESULT_AUDIT_DETAILS_CAPPED = exports.RESULT_AUDIT_DETAILS.replace(
+// Matched by shape rather than by exact spelling. This file is stored with
+// CRLF, so a needle carrying a plain newline never matches the template
+// literal's real line breaks and the replacement would silently do nothing —
+// the capped audit would come out identical to the uncapped one.
+/What a symbol is[\s\S]*?what is already here\./, "What a symbol is — its values and its signature — is complete. Its member list was cut to " +
+    "the `memberLimit` you asked for, so it is a slice, not the whole set: re-request with a " +
+    "larger cap for the rest.");
 /** The escape branch carries no graph facts, so it claims none. */
 exports.RESULT_AUDIT_ESCAPE = "This escape carries no graph facts to audit.";
 //# sourceMappingURL=resultAudit.js.map

package/lib/server/resultAudit.js.map

@@ -1 +1 @@
-{"version":3,"file":"resultAudit.js","sourceRoot":"","sources":["../../src/server/resultAudit.ts"],"names":[],"mappings":";;;AAAA;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GA+DG;AACU,QAAA,YAAY,GAAW;;;;;;;;;;;;;;;CAenC,CAAC,IAAI,EAAE,CAAC;AAET;;;;;GAKG;AACU,QAAA,sBAAsB,GAAW;;;;;;;;;;;;;;;;;CAiB7C,CAAC,IAAI,EAAE,CAAC;AAET,mEAAmE;AACtD,QAAA,mBAAmB,GAC9B,8CAA8C,CAAC"}
+{"version":3,"file":"resultAudit.js","sourceRoot":"","sources":["../../src/server/resultAudit.ts"],"names":[],"mappings":";;;AAAA;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GA6EG;AACU,QAAA,YAAY,GAAW;;;;;;;;;;;;;;;CAenC,CAAC,IAAI,EAAE,CAAC;AAET;;;;;GAKG;AACU,QAAA,sBAAsB,GAAW;;;;;;;;;;;;;;;;;CAiB7C,CAAC,IAAI,EAAE,CAAC;AAET;;;;;;;;;;;;;;;GAeG;AACU,QAAA,oBAAoB,GAAW;;;;;;;;;;;;;;;;;CAiB3C,CAAC,IAAI,EAAE,CAAC;AAET;;;;;;;;;GASG;AACU,QAAA,2BAA2B,GAAW,QAAA,oBAAoB,CAAC,OAAO;AAC7E,2EAA2E;AAC3E,wEAAwE;AACxE,6EAA6E;AAC7E,iEAAiE;AACjE,gDAAgD,EAChD,4FAA4F;IAC1F,0FAA0F;IAC1F,0BAA0B,CAC7B,CAAC;AAEF,mEAAmE;AACtD,QAAA,mBAAmB,GAC9B,8CAA8C,CAAC"}

package/lib/server/resultNext.d.ts

@@ -5,5 +5,10 @@ export interface IRunnerOutput<T> {
     result: T;
     /** How to use the result next. */
     next: ITtscGraphNext;
+    /**
+     * Set when a caller cap removed members from the result, so the audit can
+     * stop claiming the symbol's members are complete.
+     */
+    membersCapped?: boolean;
 }
 export declare function resultNext(action: ITtscGraphNext["action"], reason: string, request?: ITtscGraphNext["request"]): ITtscGraphNext;

package/lib/server/resultNext.js.map

@@ -1 +1 @@
-{"version":3,"file":"resultNext.js","sourceRoot":"","sources":["../../src/server/resultNext.ts"],"names":[],"mappings":";;;AAWA,oBACE,MAAgC,EAChC,MAAc,EACd,OAAmC;IAEnC,OAAO;QACL,MAAM;QACN,MAAM;QACN,GAAG,CAAC,OAAO,KAAK,SAAS,CAAC,CAAC,CAAC,EAAE,OAAO,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;KAC9C,CAAC;AACJ,CAAC"}
+{"version":3,"file":"resultNext.js","sourceRoot":"","sources":["../../src/server/resultNext.ts"],"names":[],"mappings":";;;AAiBA,oBACE,MAAgC,EAChC,MAAc,EACd,OAAmC;IAEnC,OAAO;QACL,MAAM;QACN,MAAM;QACN,GAAG,CAAC,OAAO,KAAK,SAAS,CAAC,CAAC,CAAC,EAAE,OAAO,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;KAC9C,CAAC;AACJ,CAAC"}

package/lib/server/runDetails.d.ts

@@ -27,10 +27,17 @@ export declare function edgeEvidenceOf(edge: ITtscGraphEdge): ITtscGraphEvidence
  * declaration's documentation, not the body of the work: an index that lists a
  * symbol with what it is for is doing an index's job.
  */
-export declare function docOf(project: string, node: ITtscGraphNode): string | undefined;
+export declare function docOf(graph: TtscGraphMemory, node: ITtscGraphNode): string | undefined;
 /**
  * The declaration signature: the head of the declaration up to and including
  * the line that opens its body (`{`), or the single declaration line when there
  * is no brace, capped so a wrapped signature cannot run away.
+ *
+ * It never runs past the declaration's own span. The stop used to be the brace,
+ * the trailing semicolon, or the line cap, and a declaration ending in none of
+ * them read its neighbors instead: an enum member ends in a comma, so `VIEW`
+ * came back as itself plus the two members after it and the closing brace. The
+ * span is the fact that says where the declaration ends, and it was already on
+ * the node.
  */
-export declare function signatureOf(project: string, node: ITtscGraphNode): string | undefined;
+export declare function signatureOf(graph: TtscGraphMemory, node: ITtscGraphNode): string | undefined;