@descent-vtt/spec-graph 0.2.0

package/dist/report.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"report.js","sourceRoot":"","sources":["../src/report.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;GAWG;AAGH,OAAO,EAAE,SAAS,EAAE,MAAM,aAAa,CAAC;AA6CxC,oFAAoF;AACpF,MAAM,UAAU,cAAc,CAAC,WAAW,GAAqB,EAAE;IAC/D,MAAM,GAAG,GAAG,WAAW,CAAC,GAAG,IAAI,OAAO,CAAC,GAAG,CAAC;IAC3C,IAAI,GAAG,CAAC,UAAU,CAAC,KAAK,SAAS,IAAI,GAAG,CAAC,UAAU,CAAC,KAAK,EAAE;QAAE,OAAO,KAAK,CAAC;IAC1E,2EAA2E;IAC3E,sEAAsE;IACtE,IAAI,GAAG,CAAC,aAAa,CAAC,KAAK,GAAG;QAAE,OAAO,KAAK,CAAC;IAC7C,IAAI,GAAG,CAAC,aAAa,CAAC,KAAK,SAAS,IAAI,GAAG,CAAC,aAAa,CAAC,KAAK,EAAE;QAAE,OAAO,IAAI,CAAC;IAC/E,IAAI,GAAG,CAAC,MAAM,CAAC,KAAK,MAAM;QAAE,OAAO,KAAK,CAAC;IACzC,IAAI,GAAG,CAAC,IAAI,CAAC,KAAK,SAAS,IAAI,GAAG,CAAC,IAAI,CAAC,KAAK,EAAE;QAAE,OAAO,KAAK,CAAC;IAC9D,OAAO,WAAW,CAAC,KAAK,KAAK,IAAI,CAAC;AACpC,CAAC;AAED,2EAA2E;AAC3E,MAAM,UAAU,cAAc,CAAC,WAAW,GAAqB,EAAE;IAC/D,MAAM,GAAG,GAAG,WAAW,CAAC,GAAG,IAAI,OAAO,CAAC,GAAG,CAAC;IAC3C,IAAI,GAAG,CAAC,kBAAkB,CAAC,KAAK,SAAS,IAAI,GAAG,CAAC,kBAAkB,CAAC,KAAK,EAAE;QAAE,OAAO,IAAI,CAAC;IACzF,IAAI,CAAC,WAAW,CAAC,QAAQ,IAAI,OAAO,CAAC,QAAQ,CAAC,KAAK,OAAO;QAAE,OAAO,KAAK,CAAC;IACzE,6EAA6E;IAC7E,OAAO,GAAG,CAAC,YAAY,CAAC,KAAK,SAAS,IAAI,GAAG,CAAC,cAAc,CAAC,KAAK,SAAS,CAAC;AAC9E,CAAC;AAED,MAAM,WAAW,GAAwB,IAAI,GAAG,EAAU,CAAC;AAc3D,MAAM,UAAU,aAAa,CAAC,KAAc;IAC1C,MAAM,IAAI,GAAG,CAAC,IAAY,EAAS,EAAE,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,UAAU,IAAI,IAAI,IAAI,WAAW,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;IACnG,OAAO;QACL,KAAK,EAAE,IAAI,CAAC,IAAI,CAAC;QACjB,IAAI,EAAE,IAAI,CAAC,IAAI,CAAC;QAChB,IAAI,EAAE,IAAI,CAAC,IAAI,CAAC;QAChB,GAAG,EAAE,IAAI,CAAC,GAAG,CAAC;QACd,IAAI,EAAE,IAAI,CAAC,GAAG,CAAC;QACf,IAAI,EAAE,IAAI,CAAC,IAAI,CAAC;QAChB,QAAQ,EAAE,IAAI,CAAC,GAAG,CAAC;KACpB,CAAC;AACJ,CAAC;AAWD,SAAS,MAAM,CAAC,KAAc;IAC5B,OAAO,KAAK;QACV,CAAC,CAAC,EAAE,KAAK,EAAE,GAAG,EAAE,IAAI,EAAE,GAAG,EAAE,IAAI,EAAE,GAAG,EAAE,OAAO,EAAE,GAAG,EAAE,IAAI,EAAE,GAAG,EAAE,SAAS,EAAE,GAAG,EAAE;QAC/E,CAAC,CAAC,EAAE,KAAK,EAAE,QAAQ,EAAE,IAAI,EAAE,QAAQ,EAAE,IAAI,EAAE,QAAQ,EAAE,OAAO,EAAE,QAAQ,EAAE,IAAI,EAAE,QAAQ,EAAE,SAAS,EAAE,QAAQ,EAAE,CAAC;AAClH,CAAC;AAED,gFAAgF;AAChF,gFAAgF;AAChF,gFAAgF;AAEhF,wCAAwC;AACxC,MAAM,UAAU,YAAY,CAAC,MAAsB,EAAE,OAAO,GAAoB,EAAE;IAChF,MAAM,KAAK,GAAG,aAAa,CAAC,OAAO,CAAC,KAAK,IAAI,KAAK,CAAC,CAAC;IACpD,MAAM,KAAK,GAAG,MAAM,CAAC,OAAO,CAAC,KAAK,IAAI,KAAK,CAAC,CAAC;IAC7C,MAAM,KAAK,GAAa,EAAE,CAAC;IAC3B,MAAM,EAAE,OAAO,EAAE,GAAG,MAAM,CAAC;IAE3B,KAAK,CAAC,IAAI,CACR,GAAG,KAAK,CAAC,IAAI,CAAC,YAAY,CAAC,IAAI,KAAK,CAAC,GAAG,CACtC;QACE,GAAG,OAAO,CAAC,SAAS,IAAI,MAAM,CAAC,OAAO,CAAC,SAAS,EAAE,UAAU,CAAC,EAAE;QAC/D,GAAG,OAAO,CAAC,KAAK,IAAI,MAAM,CAAC,OAAO,CAAC,KAAK,EAAE,MAAM,CAAC,EAAE;QACnD,GAAG,OAAO,CAAC,KAAK,IAAI,MAAM,CAAC,OAAO,CAAC,KAAK,EAAE,UAAU,CAAC,EAAE;QACvD,GAAG,OAAO,CAAC,eAAe,OAAO;KAClC,CAAC,IAAI,CAAC,IAAI,KAAK,CAAC,SAAS,GAAG,CAAC,CAC/B,EAAE,CACJ,CAAC;IACF,KAAK,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;IAEf,MAAM,KAAK,GAAG,OAAO,CAAC,GAAG,IAAI,OAAO,CAAC,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,MAAM,CAAC,WAAW,CAAC,MAAM,CAAC;IACvF,MAAM,KAAK,GAAG,MAAM,CAAC,WAAW,CAAC,KAAK,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC;IAEjD,MAAM,SAAS,GAAG,OAAO,CAAC,SAAS,IAAI,WAAW,CAAC;IACnD,KAAK,MAAM,UAAU,IAAI,KAAK,EAAE,CAAC;QAC/B,KAAK,CAAC,IAAI,CAAC,GAAG,gBAAgB,CAAC,UAAU,EAAE,KAAK,EAAE,KAAK,EAAE,SAAS,CAAC,CAAC,CAAC;QACrE,KAAK,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;IACjB,CAAC;IAED,IAAI,MAAM,CAAC,WAAW,CAAC,MAAM,GAAG,KAAK,CAAC,MAAM,EAAE,CAAC;QAC7C,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,aAAa,MAAM,CAAC,WAAW,CAAC,MAAM,GAAG,KAAK,CAAC,MAAM,OAAO,CAAC,CAAC,CAAC;QACpF,KAAK,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;IACjB,CAAC;IAED,IAAI,OAAO,CAAC,OAAO,IAAI,MAAM,CAAC,QAAQ,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QAClD,KAAK,MAAM,OAAO,IAAI,MAAM,CAAC,QAAQ,EAAE,CAAC;YACtC,KAAK,CAAC,IAAI,CAAC,GAAG,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,IAAI,KAAK,CAAC,QAAQ,CAAC,SAAS,CAAC,OAAO,CAAC,EAAE,CAAC,CAAC,KAAK,OAAO,CAAC,OAAO,EAAE,CAAC,CAAC;QACvG,CAAC;QACD,KAAK,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;IACjB,CAAC;IAED,MAAM,KAAK,GAAa,EAAE,CAAC;IAC3B,IAAI,OAAO,CAAC,MAAM,GAAG,CAAC;QAAE,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,GAAG,OAAO,CAAC,MAAM,IAAI,MAAM,CAAC,OAAO,CAAC,MAAM,EAAE,OAAO,CAAC,EAAE,CAAC,CAAC,CAAC;IACxG,IAAI,OAAO,CAAC,QAAQ,GAAG,CAAC;QAAE,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,GAAG,OAAO,CAAC,QAAQ,IAAI,MAAM,CAAC,OAAO,CAAC,QAAQ,EAAE,SAAS,CAAC,EAAE,CAAC,CAAC,CAAC;IAC/G,IAAI,OAAO,CAAC,KAAK,GAAG,CAAC;QAAE,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,GAAG,OAAO,CAAC,KAAK,IAAI,MAAM,CAAC,OAAO,CAAC,KAAK,EAAE,MAAM,CAAC,EAAE,CAAC,CAAC,CAAC;IACnG,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,GAAG,OAAO,CAAC,UAAU,IAAI,CAAC,CAAC,CAAC;IACjD,MAAM,MAAM,GAAG,MAAM,CAAC,WAAW,CAAC,MAAM,CAAC,CAAC,UAAU,EAAE,EAAE,CAAC,SAAS,CAAC,GAAG,CAAC,UAAU,CAAC,IAAI,CAAC,CAAC,CAAC,MAAM,CAAC;IAChG,IAAI,MAAM,GAAG,CAAC,EAAE,CAAC;QACf,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,GAAG,MAAM,qBAAqB,CAAC,CAAC,CAAC;IACzD,CAAC;IACD,MAAM,QAAQ,GAAG,OAAO,CAAC,QAAQ,CAAC;IAClC,IAAI,QAAQ,KAAK,SAAS,IAAI,QAAQ,CAAC,UAAU,GAAG,CAAC,EAAE,CAAC;QACtD,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,GAAG,QAAQ,CAAC,UAAU,gBAAgB,QAAQ,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC;IACjF,CAAC;IACD,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,IAAI,KAAK,CAAC,SAAS,GAAG,CAAC,CAAC,CAAC;IAE/C,IAAI,QAAQ,KAAK,SAAS,IAAI,QAAQ,CAAC,KAAK,GAAG,CAAC,EAAE,CAAC;QACjD,KAAK,CAAC,IAAI,CACR,KAAK,CAAC,GAAG,CACP,GAAG,QAAQ,CAAC,KAAK,aAAa,MAAM,CAAC,QAAQ,CAAC,KAAK,EAAE,OAAO,EAAE,SAAS,CAAC,cACtE,QAAQ,CAAC,KAAK,KAAK,CAAC,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,OACpC,qDAAqD,QAAQ,CAAC,MAAM,EAAE,CACvE,CACF,CAAC;IACJ,CAAC;IAED,KAAK,CAAC,IAAI,CACR,MAAM,CAAC,EAAE;QACP,CAAC,CAAC,GAAG,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,IAAI,KAAK,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,QAAQ,CAAC,IACjD,OAAO,CAAC,MAAM,GAAG,OAAO,CAAC,QAAQ,KAAK,CAAC;YACrC,CAAC,CAAC,uCAAuC;YACzC,CAAC,CAAC,2CACN,EAAE;QACJ,CAAC,CAAC,GAAG,KAAK,CAAC,KAAK,CAAC,KAAK,CAAC,KAAK,CAAC,0CAA0C,CAC1E,CAAC;IAEF,OAAO,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;AAC1B,CAAC;AAED,SAAS,gBAAgB,CACvB,UAAsB,EACtB,KAAc,EACd,KAAa,EACb,SAA8B;IAE9B,MAAM,IAAI,GAAG,YAAY,CAAC,UAAU,CAAC,QAAQ,EAAE,KAAK,EAAE,KAAK,CAAC,CAAC;IAC7D,MAAM,KAAK,GAAG,SAAS,CAAC,GAAG,CAAC,UAAU,CAAC,IAAI,CAAC;QAC1C,CAAC,CAAC,GAAG,UAAU,CAAC,IAAI,IAAI,KAAK,CAAC,IAAI,CAAC,yBAAyB,CAAC,EAAE;QAC/D,CAAC,CAAC,UAAU,CAAC,IAAI,CAAC;IACpB,MAAM,KAAK,GAAa;QACtB,GAAG,IAAI,IAAI,KAAK,CAAC,QAAQ,CAAC,SAAS,CAAC,UAAU,CAAC,EAAE,CAAC,CAAC,KAAK,KAAK,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE;QAC1E,OAAO,UAAU,CAAC,OAAO,EAAE;KAC5B,CAAC;IAEF,MAAM,KAAK,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,GAAG,UAAU,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,SAAS,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC;IAC5F,KAAK,MAAM,KAAK,IAAI,UAAU,CAAC,OAAO,EAAE,CAAC;QACvC,MAAM,SAAS,GAAG,SAAS,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC;QACtC,KAAK,CAAC,IAAI,CAAC,OAAO,KAAK,CAAC,GAAG,CAAC,KAAK,CAAC,OAAO,CAAC,IAAI,KAAK,CAAC,GAAG,CAAC,SAAS,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,KAAK,KAAK,CAAC,GAAG,CAAC,KAAK,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;IAChH,CAAC;IAED,KAAK,CAAC,IAAI,CAAC,OAAO,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,IAAI,KAAK,CAAC,IAAI,CAAC,UAAU,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;IAC3E,OAAO,KAAK,CAAC;AACf,CAAC;AAED,SAAS,YAAY,CAAC,QAAkC,EAAE,KAAc,EAAE,KAAa;IACrF,QAAQ,QAAQ,EAAE,CAAC;QACjB,KAAK,OAAO;YACV,OAAO,KAAK,CAAC,KAAK,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC;QAClC,KAAK,MAAM;YACT,OAAO,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC;QAChC,KAAK,MAAM;YACT,OAAO,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC;IAClC,CAAC;AACH,CAAC;AAED,SAAS,MAAM,CAAC,KAAa,EAAE,IAAY,EAAE,MAAe;IAC1D,IAAI,KAAK,KAAK,CAAC;QAAE,OAAO,IAAI,CAAC;IAC7B,OAAO,MAAM,IAAI,GAAG,IAAI,GAAG,CAAC;AAC9B,CAAC;AAED,gFAAgF;AAChF,gFAAgF;AAChF,gFAAgF;AAEhF;;;;;GAKG;AACH,MAAM,UAAU,UAAU,CACxB,MAAsB,EACtB,OAAO,GAAgF,EAAE;IAEzF,MAAM,SAAS,GAAG,OAAO,CAAC,SAAS,IAAI,WAAW,CAAC;IACnD,OAAO,GAAG,IAAI,CAAC,SAAS,CACtB;QACE,OAAO,EAAE,CAAC;QACV,EAAE,EAAE,MAAM,CAAC,EAAE;QACb,MAAM,EAAE,SAAS,CAAC,IAAI,GAAG,CAAC;QAC1B,GAAG,CAAC,OAAO,CAAC,QAAQ,KAAK,SAAS,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,QAAQ,EAAE,OAAO,CAAC,QAAQ,EAAE,CAAC;QACzE,OAAO,EAAE,MAAM,CAAC,OAAO;QACvB,KAAK,EAAE,MAAM,CAAC,KAAK;QACnB,WAAW,EAAE,MAAM,CAAC,WAAW,CAAC,GAAG,CAAC,CAAC,UAAU,EAAE,EAAE,CAAC,CAAC;YACnD,IAAI,EAAE,UAAU,CAAC,IAAI;YACrB,QAAQ,EAAE,UAAU,CAAC,QAAQ;YAC7B,+DAA+D;YAC/D,SAAS,EAAE,SAAS,CAAC,GAAG,CAAC,UAAU,CAAC,IAAI,CAAC;YACzC,OAAO,EAAE,UAAU,CAAC,OAAO;YAC3B,IAAI,EAAE,UAAU,CAAC,IAAI;YACrB,KAAK,EAAE,UAAU,CAAC,KAAK;YACvB,MAAM,EAAE,UAAU,CAAC,MAAM;YACzB,IAAI,EAAE,UAAU,CAAC,EAAE,CAAC,IAAI;YACxB,IAAI,EAAE,UAAU,CAAC,EAAE,CAAC,IAAI,CAAC,KAAK,CAAC,IAAI;YACnC,MAAM,EAAE,UAAU,CAAC,EAAE,CAAC,IAAI,CAAC,KAAK,CAAC,MAAM;YACvC,OAAO,EAAE,UAAU,CAAC,EAAE,CAAC,IAAI,CAAC,GAAG,CAAC,IAAI;YACpC,SAAS,EAAE,UAAU,CAAC,EAAE,CAAC,IAAI,CAAC,GAAG,CAAC,MAAM;YACxC,OAAO,EAAE,UAAU,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,CAAC;gBAC1C,IAAI,EAAE,KAAK,CAAC,EAAE,CAAC,IAAI;gBACnB,IAAI,EAAE,KAAK,CAAC,EAAE,CAAC,IAAI,CAAC,KAAK,CAAC,IAAI;gBAC9B,MAAM,EAAE,KAAK,CAAC,EAAE,CAAC,IAAI,CAAC,KAAK,CAAC,MAAM;gBAClC,IAAI,EAAE,KAAK,CAAC,IAAI;aACjB,CAAC,CAAC;SACJ,CAAC,CAAC;QACH,QAAQ,EAAE,MAAM,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,OAAO,EAAE,EAAE,CAAC,CAAC;YAC1C,OAAO,EAAE,OAAO,CAAC,OAAO;YACxB,IAAI,EAAE,OAAO,CAAC,EAAE,CAAC,IAAI;YACrB,IAAI,EAAE,OAAO,CAAC,EAAE,CAAC,IAAI,CAAC,KAAK,CAAC,IAAI;SACjC,CAAC,CAAC;KACJ,EACD,IAAI,EACJ,CAAC,CACF,IAAI,CAAC;AACR,CAAC;AAaD,wEAAwE;AACxE,MAAM,UAAU,WAAW,CAAC,KAAgB,EAAE,MAAmB,EAAE,OAAO,GAAuB,EAAE;IACjG,MAAM,SAAS,GAAG,OAAO,CAAC,aAAa,IAAI,KAAK,CAAC;IACjD,MAAM,KAAK,GAAG,CAAC,GAAG,KAAK,CAAC,KAAK,CAAC,MAAM,EAAE,CAAC,CAAC,MAAM,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,CAAC,SAAS,IAAI,IAAI,CAAC,IAAI,KAAK,UAAU,CAAC,CAAC;IACjG,MAAM,OAAO,GAAG,IAAI,GAAG,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC;IAEtD,4EAA4E;IAC5E,4EAA4E;IAC5E,gEAAgE;IAChE,MAAM,MAAM,GAAG,SAAS;QACtB,CAAC,CAAC,WAAW,CACT,KAAK,CAAC,KAAK;YACT,iEAAiE;YACjE,kEAAkE;YAClE,qEAAqE;aACpE,MAAM,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,CAAC,IAAI,KAAK,UAAU,IAAI,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;aAClE,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE;YACZ,MAAM,IAAI,GAAG,KAAK,CAAC,cAAc,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,EAAE,IAAI,IAAI,CAAC,IAAI,CAAC;YAC9D,MAAM,EAAE,GAAG,KAAK,CAAC,cAAc,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,EAAE,IAAI,IAAI,CAAC,EAAE,CAAC;YACxD,OAAO,IAAI,KAAK,IAAI,CAAC,IAAI,IAAI,EAAE,KAAK,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,GAAG,IAAI,EAAE,IAAI,EAAE,EAAE,EAAE,SAAS,EAAE,IAAI,KAAK,EAAE,EAAE,CAAC;QACrG,CAAC,CAAC;aACD,MAAM,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,CAAC,IAAI,CAAC,SAAS,CAAC,CACrC;QACH,CAAC,CAAC,KAAK,CAAC,KAAK,CAAC;IAEhB,MAAM,KAAK,GAAG,MAAM,CAAC,MAAM,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC;IAEtF,QAAQ,MAAM,EAAE,CAAC;QACf,KAAK,KAAK;YACR,OAAO,KAAK,CAAC,KAAK,EAAE,KAAK,CAAC,CAAC;QAC7B,KAAK,SAAS;YACZ,OAAO,SAAS,CAAC,KAAK,EAAE,KAAK,CAAC,CAAC;QACjC,KAAK,MAAM;YACT,OAAO,GAAG,IAAI,CAAC,SAAS,CACtB;gBACE,OAAO,EAAE,CAAC;gBACV,KAAK,EAAE,KAAK,CAAC,GAAG,CAAC,aAAa,CAAC;gBAC/B,KAAK,EAAE,KAAK,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,CAAC;oBAC1B,IAAI,EAAE,IAAI,CAAC,IAAI;oBACf,IAAI,EAAE,IAAI,CAAC,IAAI;oBACf,EAAE,EAAE,IAAI,CAAC,EAAE;oBACX,MAAM,EAAE,IAAI,CAAC,MAAM;oBACnB,UAAU,EAAE,IAAI,CAAC,UAAU;oBAC3B,IAAI,EAAE,IAAI,CAAC,UAAU,CAAC,IAAI;oBAC1B,IAAI,EAAE,IAAI,CAAC,UAAU,CAAC,IAAI,CAAC,KAAK,CAAC,IAAI;iBACtC,CAAC,CAAC;aACJ,EACD,IAAI,EACJ,CAAC,CACF,IAAI,CAAC;IACV,CAAC;AACH,CAAC;AAED,mFAAmF;AACnF,SAAS,WAAW,CAAC,KAAsB;IACzC,MAAM,IAAI,GAAG,IAAI,GAAG,EAAU,CAAC;IAC/B,MAAM,GAAG,GAAW,EAAE,CAAC;IACvB,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;QACzB,MAAM,GAAG,GAAG,GAAG,IAAI,CAAC,IAAI,IAAI,IAAI,CAAC,IAAI,IAAI,IAAI,CAAC,EAAE,EAAE,CAAC;QACnD,IAAI,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC;YAAE,SAAS;QAC5B,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;QACd,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IACjB,CAAC;IACD,OAAO,GAAG,CAAC;AACb,CAAC;AAED,SAAS,aAAa,CAAC,IAAc;IACnC,MAAM,IAAI,GAAG;QACX,EAAE,EAAE,IAAI,CAAC,EAAE;QACX,IAAI,EAAE,IAAI,CAAC,IAAI;QACf,KAAK,EAAE,IAAI,CAAC,KAAK;QACjB,IAAI,EAAE,IAAI,CAAC,EAAE,CAAC,IAAI;QAClB,IAAI,EAAE,IAAI,CAAC,EAAE,CAAC,IAAI,CAAC,KAAK,CAAC,IAAI;KAC9B,CAAC;IACF,OAAO,IAAI,CAAC,IAAI,KAAK,UAAU;QAC7B,CAAC,CAAC,EAAE,GAAG,IAAI,EAAE,IAAI,EAAE,IAAI,CAAC,IAAI,EAAE,KAAK,EAAE,IAAI,CAAC,KAAK,EAAE,MAAM,EAAE,IAAI,CAAC,SAAS,EAAE,OAAO,EAAE,IAAI,CAAC,OAAO,EAAE;QAChG,CAAC,CAAC;YACE,GAAG,IAAI;YACP,QAAQ,EAAE,IAAI,CAAC,QAAQ;YACvB,OAAO,EAAE,IAAI,CAAC,OAAO;YACrB,WAAW,EAAE,IAAI,CAAC,WAAW;YAC7B,QAAQ,EAAE,IAAI,CAAC,QAAQ;SACxB,CAAC;AACR,CAAC;AAED,+EAA+E;AAC/E,MAAM,UAAU,GAAqC;IACnD,KAAK,EAAE,SAAS;IAChB,MAAM,EAAE,SAAS;IACjB,MAAM,EAAE,SAAS;IACjB,OAAO,EAAE,SAAS;IAClB,MAAM,EAAE,SAAS;IACjB,OAAO,EAAE,SAAS;CACnB,CAAC;AAEF,SAAS,KAAK,CAAC,KAA0B,EAAE,KAAsB;IAC/D,MAAM,KAAK,GAAG,CAAC,gBAAgB,EAAE,eAAe,EAAE,8DAA8D,CAAC,CAAC;IAClH,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;QACzB,MAAM,IAAI,GAAG,IAAI,CAAC,IAAI,KAAK,UAAU,CAAC,CAAC,CAAC,CAAC,UAAU,CAAC,IAAI,CAAC,KAAK,CAAC,IAAI,SAAS,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC;QAC1F,MAAM,KAAK,GAAG,IAAI,CAAC,IAAI,KAAK,UAAU,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,EAAE,MAAM,SAAS,CAAC,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC,CAAC,SAAS,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACxG,MAAM,KAAK,GAAG,IAAI,CAAC,IAAI,KAAK,UAAU,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,MAAM,CAAC;QACxD,KAAK,CAAC,IAAI,CAAC,MAAM,SAAS,CAAC,IAAI,CAAC,EAAE,CAAC,aAAa,KAAK,iBAAiB,IAAI,YAAY,KAAK,IAAI,CAAC,CAAC;IACnG,CAAC;IACD,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;QACzB,MAAM,KAAK,GAAG,IAAI,CAAC,IAAI,KAAK,UAAU,CAAC,CAAC,CAAC,gBAAgB,CAAC,CAAC,CAAC,EAAE,CAAC;QAC/D,KAAK,CAAC,IAAI,CAAC,MAAM,SAAS,CAAC,IAAI,CAAC,IAAI,CAAC,SAAS,SAAS,CAAC,IAAI,CAAC,EAAE,CAAC,aAAa,IAAI,CAAC,IAAI,IAAI,KAAK,IAAI,CAAC,CAAC;IACvG,CAAC;IACD,KAAK,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;IAChB,OAAO,GAAG,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC;AACjC,CAAC;AAED,SAAS,SAAS,CAAC,KAA0B,EAAE,KAAsB;IACnE,MAAM,KAAK,GAAG,CAAC,UAAU,CAAC,CAAC;IAC3B,MAAM,KAAK,GAAG,IAAI,GAAG,EAAkB,CAAC;IACxC,KAAK,CAAC,OAAO,CAAC,CAAC,IAAI,EAAE,QAAQ,EAAE,EAAE,CAAC,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,EAAE,IAAI,QAAQ,EAAE,CAAC,CAAC,CAAC;IAEtE,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;QACzB,MAAM,GAAG,GAAG,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAW,CAAC;QACzC,MAAM,KAAK,GAAG,aAAa,CAAC,IAAI,CAAC,IAAI,KAAK,UAAU,CAAC,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAC5E,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,KAAK,UAAU,CAAC,CAAC,CAAC,KAAK,GAAG,KAAK,KAAK,IAAI,CAAC,CAAC,CAAC,KAAK,GAAG,MAAM,KAAK,KAAK,CAAC,CAAC;QACzF,IAAI,IAAI,CAAC,IAAI,KAAK,UAAU,IAAI,IAAI,CAAC,KAAK,KAAK,SAAS;YAAE,KAAK,CAAC,IAAI,CAAC,WAAW,GAAG,IAAI,IAAI,CAAC,KAAK,GAAG,CAAC,CAAC;IACxG,CAAC;IACD,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;QACzB,MAAM,IAAI,GAAG,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAClC,MAAM,EAAE,GAAG,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;QAC9B,IAAI,CAAC,IAAI,IAAI,CAAC,EAAE;YAAE,SAAS;QAC3B,KAAK,CAAC,IAAI,CAAC,KAAK,IAAI,QAAQ,IAAI,CAAC,IAAI,KAAK,EAAE,EAAE,CAAC,CAAC;IAClD,CAAC;IACD,KAAK,MAAM,CAAC,KAAK,EAAE,IAAI,CAAC,IAAI,MAAM,CAAC,OAAO,CAAC,UAAU,CAAC,EAAE,CAAC;QACvD,IAAI,KAAK,KAAK,SAAS;YAAE,SAAS;QAClC,KAAK,CAAC,IAAI,CAAC,cAAc,KAAK,SAAS,IAAI,kBAAkB,CAAC,CAAC;IACjE,CAAC;IACD,OAAO,GAAG,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC;AACjC,CAAC;AAED,SAAS,SAAS,CAAC,KAAa;IAC9B,OAAO,KAAK,CAAC,OAAO,CAAC,QAAQ,EAAE,MAAM,CAAC,CAAC,OAAO,CAAC,KAAK,EAAE,KAAK,CAAC,CAAC;AAC/D,CAAC;AAED,SAAS,aAAa,CAAC,KAAa;IAClC,OAAO,KAAK,CAAC,OAAO,CAAC,OAAO,EAAE,GAAG,CAAC,CAAC,OAAO,CAAC,MAAM,EAAE,GAAG,CAAC,CAAC,IAAI,EAAE,CAAC;AACjE,CAAC","sourcesContent":["/**\n * Output formatting.\n *\n * Two audiences, one set of facts. In a terminal the report leads with the file\n * and line so an editor can jump there, indents the supporting evidence, and\n * ends with a concrete next action - because a finding a reader cannot act on\n * is a finding they will learn to scroll past. In CI it emits JSON with every\n * position intact, so a bot can annotate a diff.\n *\n * Colour is opt-out and auto-detected, and the glyphs degrade to ASCII when the\n * terminal cannot render them.\n */\n\nimport type { SpecGraph } from './graph.js';\nimport { formatRef } from './source.js';\nimport type { AnalysisResult } from './runner.js';\nimport type { Diagnostic, Edge, RuleId, Severity, SpecNode } from './types.js';\n\nexport interface ReporterOptions {\n  readonly color?: boolean | undefined;\n  readonly ascii?: boolean | undefined;\n  readonly verbose?: boolean | undefined;\n  /** Stop after this many findings. `0` means no limit. */\n  readonly max?: number | undefined;\n  /**\n   * Rules whose severity `--strict` raised.\n   *\n   * A finding that only became an error because of a flag has to say so, or the\n   * reader cannot tell what would happen without it.\n   */\n  readonly escalated?: ReadonlySet<RuleId> | undefined;\n  /**\n   * What a baseline accounted for on this run.\n   *\n   * Reported as counts rather than as a list: the point of accepted debt is\n   * that nobody has to read it every time. `stale` is the ratchet - debt that\n   * has been paid and can be struck from the file.\n   */\n  readonly baseline?: { readonly source: string; readonly suppressed: number; readonly stale: number } | undefined;\n}\n\n/* -------------------------------------------------------------------------- */\n/* Environment detection                                                      */\n/* -------------------------------------------------------------------------- */\n\nexport interface ColorEnvironment {\n  readonly isTTY?: boolean | undefined;\n  readonly env?: Readonly<Record<string, string | undefined>> | undefined;\n  /**\n   * Host platform, defaulting to the real one.\n   *\n   * Injected for the same reason `env` is: without it half of\n   * {@link shouldUseAscii} is unreachable from a test, and a rule about\n   * Windows consoles that only Windows can exercise is a rule that breaks on\n   * Windows and nowhere else.\n   */\n  readonly platform?: NodeJS.Platform | undefined;\n}\n\n/** Honours `NO_COLOR`, `FORCE_COLOR` and `TERM=dumb` before falling back to TTY. */\nexport function shouldUseColor(environment: ColorEnvironment = {}): boolean {\n  const env = environment.env ?? process.env;\n  if (env['NO_COLOR'] !== undefined && env['NO_COLOR'] !== '') return false;\n  // `FORCE_COLOR=0` is the conventional way to turn colour off, so it has to\n  // win over an attached TTY rather than merely failing to force it on.\n  if (env['FORCE_COLOR'] === '0') return false;\n  if (env['FORCE_COLOR'] !== undefined && env['FORCE_COLOR'] !== '') return true;\n  if (env['TERM'] === 'dumb') return false;\n  if (env['CI'] !== undefined && env['CI'] !== '') return false;\n  return environment.isTTY === true;\n}\n\n/** True when the terminal is unlikely to render box-drawing and arrows. */\nexport function shouldUseAscii(environment: ColorEnvironment = {}): boolean {\n  const env = environment.env ?? process.env;\n  if (env['SPEC_GRAPH_ASCII'] !== undefined && env['SPEC_GRAPH_ASCII'] !== '') return true;\n  if ((environment.platform ?? process.platform) !== 'win32') return false;\n  // Windows Terminal and modern shells set these; the legacy console does not.\n  return env['WT_SESSION'] === undefined && env['TERM_PROGRAM'] === undefined;\n}\n\nconst EMPTY_RULES: ReadonlySet<RuleId> = new Set<RuleId>();\n\ntype Paint = (text: string) => string;\n\nexport interface Painter {\n  readonly error: Paint;\n  readonly warn: Paint;\n  readonly info: Paint;\n  readonly dim: Paint;\n  readonly bold: Paint;\n  readonly hint: Paint;\n  readonly location: Paint;\n}\n\nexport function createPainter(color: boolean): Painter {\n  const wrap = (open: string): Paint => (text) => (color ? `\\u001b[${open}m${text}\\u001b[0m` : text);\n  return {\n    error: wrap('31'),\n    warn: wrap('33'),\n    info: wrap('36'),\n    dim: wrap('2'),\n    bold: wrap('1'),\n    hint: wrap('32'),\n    location: wrap('4'),\n  };\n}\n\ninterface Glyphs {\n  readonly error: string;\n  readonly warn: string;\n  readonly info: string;\n  readonly related: string;\n  readonly hint: string;\n  readonly separator: string;\n}\n\nfunction glyphs(ascii: boolean): Glyphs {\n  return ascii\n    ? { error: 'x', warn: '!', info: 'i', related: '|', hint: '>', separator: '-' }\n    : { error: '\\u2716', warn: '\\u26a0', info: '\\u2139', related: '\\u21b3', hint: '\\u2192', separator: '\\u00b7' };\n}\n\n/* -------------------------------------------------------------------------- */\n/* Human report                                                               */\n/* -------------------------------------------------------------------------- */\n\n/** Renders the full terminal report. */\nexport function formatReport(result: AnalysisResult, options: ReporterOptions = {}): string {\n  const paint = createPainter(options.color ?? false);\n  const marks = glyphs(options.ascii ?? false);\n  const lines: string[] = [];\n  const { summary } = result;\n\n  lines.push(\n    `${paint.bold('spec-graph')} ${paint.dim(\n      [\n        `${summary.documents} ${plural(summary.documents, 'document')}`,\n        `${summary.items} ${plural(summary.items, 'item')}`,\n        `${summary.edges} ${plural(summary.edges, 'relation')}`,\n        `${summary.openObligations} open`,\n      ].join(` ${marks.separator} `),\n    )}`,\n  );\n  lines.push('');\n\n  const limit = options.max && options.max > 0 ? options.max : result.diagnostics.length;\n  const shown = result.diagnostics.slice(0, limit);\n\n  const escalated = options.escalated ?? EMPTY_RULES;\n  for (const diagnostic of shown) {\n    lines.push(...formatDiagnostic(diagnostic, paint, marks, escalated));\n    lines.push('');\n  }\n\n  if (result.diagnostics.length > shown.length) {\n    lines.push(paint.dim(`  ... and ${result.diagnostics.length - shown.length} more`));\n    lines.push('');\n  }\n\n  if (options.verbose && result.problems.length > 0) {\n    for (const problem of result.problems) {\n      lines.push(`${paint.warn(marks.warn)} ${paint.location(formatRef(problem.at))}  ${problem.message}`);\n    }\n    lines.push('');\n  }\n\n  const tally: string[] = [];\n  if (summary.errors > 0) tally.push(paint.error(`${summary.errors} ${plural(summary.errors, 'error')}`));\n  if (summary.warnings > 0) tally.push(paint.warn(`${summary.warnings} ${plural(summary.warnings, 'warning')}`));\n  if (summary.infos > 0) tally.push(paint.info(`${summary.infos} ${plural(summary.infos, 'note')}`));\n  tally.push(paint.dim(`${summary.durationMs}ms`));\n  const raised = result.diagnostics.filter((diagnostic) => escalated.has(diagnostic.rule)).length;\n  if (raised > 0) {\n    tally.push(paint.warn(`${raised} raised by --strict`));\n  }\n  const baseline = options.baseline;\n  if (baseline !== undefined && baseline.suppressed > 0) {\n    tally.push(paint.dim(`${baseline.suppressed} accepted by ${baseline.source}`));\n  }\n  lines.push(tally.join(` ${marks.separator} `));\n\n  if (baseline !== undefined && baseline.stale > 0) {\n    lines.push(\n      paint.dim(\n        `${baseline.stale} baseline ${plural(baseline.stale, 'entry', 'entries')} no longer ${\n          baseline.stale === 1 ? 'occurs' : 'occur'\n        } - tighten it: spec-graph check --record-baseline ${baseline.source}`,\n      ),\n    );\n  }\n\n  lines.push(\n    result.ok\n      ? `${paint.hint(marks.hint === '>' ? 'ok' : '\\u2714')} ${\n          summary.errors + summary.warnings === 0\n            ? 'the specification graph is consistent'\n            : 'no errors - the specification graph holds'\n        }`\n      : `${paint.error(marks.error)} the specification graph is inconsistent`,\n  );\n\n  return lines.join('\\n');\n}\n\nfunction formatDiagnostic(\n  diagnostic: Diagnostic,\n  paint: Painter,\n  marks: Glyphs,\n  escalated: ReadonlySet<RuleId>,\n): string[] {\n  const mark = severityMark(diagnostic.severity, paint, marks);\n  const label = escalated.has(diagnostic.rule)\n    ? `${diagnostic.rule} ${paint.warn('(strict: warn -> error)')}`\n    : diagnostic.rule;\n  const lines: string[] = [\n    `${mark} ${paint.location(formatRef(diagnostic.at))}  ${paint.dim(label)}`,\n    `    ${diagnostic.message}`,\n  ];\n\n  const width = Math.max(0, ...diagnostic.related.map((entry) => formatRef(entry.at).length));\n  for (const entry of diagnostic.related) {\n    const reference = formatRef(entry.at);\n    lines.push(`    ${paint.dim(marks.related)} ${paint.dim(reference.padEnd(width))}  ${paint.dim(entry.note)}`);\n  }\n\n  lines.push(`    ${paint.hint(marks.hint)} ${paint.hint(diagnostic.hint)}`);\n  return lines;\n}\n\nfunction severityMark(severity: Exclude<Severity, 'off'>, paint: Painter, marks: Glyphs): string {\n  switch (severity) {\n    case 'error':\n      return paint.error(marks.error);\n    case 'warn':\n      return paint.warn(marks.warn);\n    case 'info':\n      return paint.info(marks.info);\n  }\n}\n\nfunction plural(count: number, word: string, plural?: string): string {\n  if (count === 1) return word;\n  return plural ?? `${word}s`;\n}\n\n/* -------------------------------------------------------------------------- */\n/* JSON                                                                       */\n/* -------------------------------------------------------------------------- */\n\n/**\n * The machine-readable report.\n *\n * Deliberately flat and versioned: this is the contract a CI annotator or a\n * dashboard builds against, and it must be safe to add fields to it later.\n */\nexport function formatJson(\n  result: AnalysisResult,\n  options: { escalated?: ReadonlySet<RuleId>; baseline?: ReporterOptions['baseline'] } = {},\n): string {\n  const escalated = options.escalated ?? EMPTY_RULES;\n  return `${JSON.stringify(\n    {\n      version: 1,\n      ok: result.ok,\n      strict: escalated.size > 0,\n      ...(options.baseline === undefined ? {} : { baseline: options.baseline }),\n      summary: result.summary,\n      files: result.files,\n      diagnostics: result.diagnostics.map((diagnostic) => ({\n        rule: diagnostic.rule,\n        severity: diagnostic.severity,\n        // True when this finding is only an error because of --strict.\n        escalated: escalated.has(diagnostic.rule),\n        message: diagnostic.message,\n        hint: diagnostic.hint,\n        nodes: diagnostic.nodes,\n        target: diagnostic.target,\n        file: diagnostic.at.file,\n        line: diagnostic.at.span.start.line,\n        column: diagnostic.at.span.start.column,\n        endLine: diagnostic.at.span.end.line,\n        endColumn: diagnostic.at.span.end.column,\n        related: diagnostic.related.map((entry) => ({\n          file: entry.at.file,\n          line: entry.at.span.start.line,\n          column: entry.at.span.start.column,\n          note: entry.note,\n        })),\n      })),\n      problems: result.problems.map((problem) => ({\n        message: problem.message,\n        file: problem.at.file,\n        line: problem.at.span.start.line,\n      })),\n    },\n    null,\n    2,\n  )}\\n`;\n}\n\n/* -------------------------------------------------------------------------- */\n/* Graph export                                                               */\n/* -------------------------------------------------------------------------- */\n\nexport type GraphFormat = 'dot' | 'mermaid' | 'json';\n\nexport interface GraphExportOptions {\n  /** Leave out `contains` edges and item nodes. */\n  readonly documentsOnly?: boolean | undefined;\n}\n\n/** Serialises the graph for Graphviz, Mermaid, or a downstream tool. */\nexport function formatGraph(graph: SpecGraph, format: GraphFormat, options: GraphExportOptions = {}): string {\n  const skipItems = options.documentsOnly ?? false;\n  const nodes = [...graph.nodes.values()].filter((node) => !skipItems || node.kind === 'document');\n  const visible = new Set(nodes.map((node) => node.id));\n\n  // Hiding items must not hide what they say. An obligation delegated from an\n  // item to a document is lifted onto the item's owner, so the document-level\n  // view still shows the handover rather than silently losing it.\n  const lifted = skipItems\n    ? dedupeEdges(\n        graph.edges\n          // Containment of an *item* is what hiding items makes redundant.\n          // Containment of a specification by the register that holds it is\n          // structure between documents, and is what this view exists to show.\n          .filter((edge) => edge.kind !== 'contains' || visible.has(edge.to))\n          .map((edge) => {\n            const from = graph.owningDocument(edge.from)?.id ?? edge.from;\n            const to = graph.owningDocument(edge.to)?.id ?? edge.to;\n            return from === edge.from && to === edge.to ? edge : { ...edge, from, to, reflexive: from === to };\n          })\n          .filter((edge) => !edge.reflexive),\n      )\n    : graph.edges;\n\n  const edges = lifted.filter((edge) => visible.has(edge.from) && visible.has(edge.to));\n\n  switch (format) {\n    case 'dot':\n      return toDot(nodes, edges);\n    case 'mermaid':\n      return toMermaid(nodes, edges);\n    case 'json':\n      return `${JSON.stringify(\n        {\n          version: 1,\n          nodes: nodes.map(serialiseNode),\n          edges: edges.map((edge) => ({\n            kind: edge.kind,\n            from: edge.from,\n            to: edge.to,\n            origin: edge.origin,\n            declaredIn: edge.declaredIn,\n            file: edge.declaredAt.file,\n            line: edge.declaredAt.span.start.line,\n          })),\n        },\n        null,\n        2,\n      )}\\n`;\n  }\n}\n\n/** Collapses duplicate relations produced by lifting item edges onto documents. */\nfunction dedupeEdges(edges: readonly Edge[]): Edge[] {\n  const seen = new Set<string>();\n  const out: Edge[] = [];\n  for (const edge of edges) {\n    const key = `${edge.kind} ${edge.from} ${edge.to}`;\n    if (seen.has(key)) continue;\n    seen.add(key);\n    out.push(edge);\n  }\n  return out;\n}\n\nfunction serialiseNode(node: SpecNode): Record<string, unknown> {\n  const base = {\n    id: node.id,\n    kind: node.kind,\n    title: node.title,\n    file: node.at.file,\n    line: node.at.span.start.line,\n  };\n  return node.kind === 'document'\n    ? { ...base, path: node.path, phase: node.phase, status: node.rawStatus, aliases: node.aliases }\n    : {\n        ...base,\n        document: node.document,\n        section: node.section,\n        disposition: node.disposition,\n        openness: node.openness,\n      };\n}\n\n/** Phase colours, chosen to stay legible in both light and dark renderings. */\nconst PHASE_FILL: Readonly<Record<string, string>> = {\n  draft: '#e8f0fe',\n  active: '#e6f4ea',\n  frozen: '#e8eaed',\n  retired: '#fce8e6',\n  record: '#f3e8fd',\n  unknown: '#ffffff',\n};\n\nfunction toDot(nodes: readonly SpecNode[], edges: readonly Edge[]): string {\n  const lines = ['digraph spec {', '  rankdir=LR;', '  node [shape=box, style=\"rounded,filled\", fontname=\"sans\"];'];\n  for (const node of nodes) {\n    const fill = node.kind === 'document' ? (PHASE_FILL[node.phase] ?? '#ffffff') : '#fffbe6';\n    const label = node.kind === 'document' ? `${node.id}\\\\n${escapeDot(node.title)}` : escapeDot(node.text);\n    const shape = node.kind === 'document' ? 'box' : 'note';\n    lines.push(`  \"${escapeDot(node.id)}\" [label=\"${label}\", fillcolor=\"${fill}\", shape=${shape}];`);\n  }\n  for (const edge of edges) {\n    const style = edge.kind === 'contains' ? ', style=dotted' : '';\n    lines.push(`  \"${escapeDot(edge.from)}\" -> \"${escapeDot(edge.to)}\" [label=\"${edge.kind}\"${style}];`);\n  }\n  lines.push('}');\n  return `${lines.join('\\n')}\\n`;\n}\n\nfunction toMermaid(nodes: readonly SpecNode[], edges: readonly Edge[]): string {\n  const lines = ['graph LR'];\n  const alias = new Map<string, string>();\n  nodes.forEach((node, position) => alias.set(node.id, `n${position}`));\n\n  for (const node of nodes) {\n    const key = alias.get(node.id) as string;\n    const label = escapeMermaid(node.kind === 'document' ? node.id : node.text);\n    lines.push(node.kind === 'document' ? `  ${key}[\"${label}\"]` : `  ${key}([\"${label}\"])`);\n    if (node.kind === 'document' && node.phase !== 'unknown') lines.push(`  class ${key} ${node.phase};`);\n  }\n  for (const edge of edges) {\n    const from = alias.get(edge.from);\n    const to = alias.get(edge.to);\n    if (!from || !to) continue;\n    lines.push(`  ${from} -->|${edge.kind}| ${to}`);\n  }\n  for (const [phase, fill] of Object.entries(PHASE_FILL)) {\n    if (phase === 'unknown') continue;\n    lines.push(`  classDef ${phase} fill:${fill},stroke:#5f6368;`);\n  }\n  return `${lines.join('\\n')}\\n`;\n}\n\nfunction escapeDot(value: string): string {\n  return value.replace(/[\"\\\\]/g, '\\\\$&').replace(/\\n/g, '\\\\n');\n}\n\nfunction escapeMermaid(value: string): string {\n  return value.replace(/[\"#]/g, ' ').replace(/\\s+/g, ' ').trim();\n}\n"]}

package/dist/resolve.d.ts

@@ -0,0 +1,61 @@
+/**
+ * Corpus-level reference resolution - the foreign-key check.
+ *
+ * Extraction produces relations whose targets are still just text. This module
+ * turns each into an edge or into an explicit, reportable failure. The whole
+ * value of the exercise is in refusing to do either job carelessly:
+ *
+ * - **A deliberate reference that does not resolve is an error.** A link, a
+ *   front-matter field or a directive naming a document that does not exist is
+ *   a broken foreign key, and silence about it is how reference graphs rot.
+ * - **An opportunistic reference that does not resolve is nothing.** `ADR-0007`
+ *   written in prose is a citation; `SHA-256` is not. Since the two are
+ *   indistinguishable in isolation, bare identifiers are only reported when
+ *   their family already exists in the corpus - so `ADR-0099` in a repository
+ *   full of ADRs is a finding, and `T-1000` in the same repository is not.
+ * - **Two candidates is worse than none.** A reference that matches several
+ *   documents is reported as ambiguous rather than silently bound to whichever
+ *   one happened to be indexed first.
+ */
+import type { ExtractedDocument } from './extract.js';
+import type { DanglingRef, DocumentNode, Edge, ItemNode, ParseProblem, SpecNode } from './types.js';
+export interface ResolveOptions {
+    /**
+     * Whether a repository-relative path exists on disk.
+     *
+     * Used only to tell "you linked to a file that is not a specification" apart
+     * from "you linked to nothing at all", which are different mistakes with
+     * different fixes.
+     */
+    readonly fileExists?: ((path: string) => boolean) | undefined;
+    /**
+     * Targets whose failure to resolve should not be reported.
+     *
+     * This is a *suppression* filter, not a resolution one: it is consulted only
+     * when a reference has already failed to resolve. A reference that resolves
+     * still becomes an edge no matter what this says, so no amount of
+     * configuration can silently delete a relation from the graph.
+     */
+    readonly isIgnoredReference?: ((target: string) => boolean) | undefined;
+    /**
+     * Families that are never citations in this repository.
+     *
+     * `RFC 2119` is the canonical case: every specification cites it, and a
+     * repository that keeps its own `RFC-*` documents will otherwise read that
+     * sentence as a dangling reference to a local RFC 2119 it does not have.
+     * Consulted only after resolution has failed, like every other filter here.
+     */
+    readonly isIgnoredFamily?: ((family: string) => boolean) | undefined;
+}
+export interface ResolvedCorpus {
+    readonly nodes: ReadonlyMap<string, SpecNode>;
+    readonly documents: readonly DocumentNode[];
+    readonly items: readonly ItemNode[];
+    readonly edges: readonly Edge[];
+    readonly dangling: readonly DanglingRef[];
+    readonly problems: readonly ParseProblem[];
+}
+/** Resolves every extracted reference against the whole corpus. */
+export declare function resolveCorpus(extracted: readonly ExtractedDocument[], options?: ResolveOptions): ResolvedCorpus;
+/** The document part of a node id: `ADR-7#q.1` -> `ADR-7`. */
+export declare function documentOf(nodeId: string): string;

package/dist/resolve.js

@@ -0,0 +1,340 @@
+/**
+ * Corpus-level reference resolution - the foreign-key check.
+ *
+ * Extraction produces relations whose targets are still just text. This module
+ * turns each into an edge or into an explicit, reportable failure. The whole
+ * value of the exercise is in refusing to do either job carelessly:
+ *
+ * - **A deliberate reference that does not resolve is an error.** A link, a
+ *   front-matter field or a directive naming a document that does not exist is
+ *   a broken foreign key, and silence about it is how reference graphs rot.
+ * - **An opportunistic reference that does not resolve is nothing.** `ADR-0007`
+ *   written in prose is a citation; `SHA-256` is not. Since the two are
+ *   indistinguishable in isolation, bare identifiers are only reported when
+ *   their family already exists in the corpus - so `ADR-0099` in a repository
+ *   full of ADRs is a finding, and `T-1000` in the same repository is not.
+ * - **Two candidates is worse than none.** A reference that matches several
+ *   documents is reported as ambiguous rather than silently bound to whichever
+ *   one happened to be indexed first.
+ */
+import { isDocumentTarget, isExternal, looksLikePath, normaliseRef, parseBareRef, parsePrefixedRef, splitAnchor, } from './identity.js';
+import { basenamePosix, extnamePosix, resolveFrom } from './paths.js';
+/** Resolves every extracted reference against the whole corpus. */
+export function resolveCorpus(extracted, options = {}) {
+    const index = buildIndex(extracted);
+    const nodes = new Map();
+    const documents = [];
+    const items = [];
+    const problems = [];
+    for (const entry of extracted) {
+        const existing = nodes.get(entry.document.id);
+        if (existing && existing.kind === 'document') {
+            problems.push({
+                message: `duplicate document id "${entry.document.id}", already declared by ${existing.path}`,
+                at: entry.document.at,
+            });
+            continue;
+        }
+        nodes.set(entry.document.id, entry.document);
+        documents.push(entry.document);
+        for (const item of entry.items) {
+            nodes.set(item.id, item);
+            items.push(item);
+        }
+        problems.push(...entry.problems);
+    }
+    const edges = [];
+    const dangling = [];
+    const byKey = new Map();
+    // Structural edges: a register contains the specifications written inside it.
+    for (const entry of extracted) {
+        if (entry.containerId === null)
+            continue;
+        if (!nodes.has(entry.containerId) || !nodes.has(entry.document.id))
+            continue;
+        edges.push({
+            kind: 'contains',
+            from: entry.containerId,
+            to: entry.document.id,
+            origin: 'structural',
+            declaredAt: entry.document.at,
+            raw: entry.document.title,
+            declaredIn: [entry.document.at.file],
+            reflexive: false,
+        });
+    }
+    // Structural edges: a document contains its items.
+    for (const item of items) {
+        edges.push({
+            kind: 'contains',
+            from: item.document,
+            to: item.id,
+            origin: 'structural',
+            declaredAt: item.at,
+            raw: item.text,
+            declaredIn: [item.at.file],
+            reflexive: false,
+        });
+    }
+    for (const entry of extracted) {
+        for (const candidate of entry.references) {
+            if (!nodes.has(candidate.from))
+                continue;
+            const outcome = resolveOne(candidate, entry, index, nodes, options);
+            if (outcome === null)
+                continue;
+            if ('reason' in outcome) {
+                dangling.push(outcome);
+                continue;
+            }
+            // Collapse duplicates: the same relation stated twice is one edge - but
+            // every declaration site is kept, because a supersession recorded in only
+            // one of the two documents is itself a finding.
+            const key = `${outcome.kind} ${outcome.from} ${outcome.to}`;
+            const existing = byKey.get(key);
+            if (existing !== undefined) {
+                const previous = edges[existing];
+                if (!previous.declaredIn.includes(outcome.declaredAt.file)) {
+                    edges[existing] = { ...previous, declaredIn: [...previous.declaredIn, outcome.declaredAt.file] };
+                }
+                continue;
+            }
+            byKey.set(key, edges.length);
+            edges.push(outcome);
+        }
+    }
+    return { nodes, documents, items, edges, dangling, problems };
+}
+/* -------------------------------------------------------------------------- */
+/* Indexing                                                                   */
+/* -------------------------------------------------------------------------- */
+function buildIndex(extracted) {
+    const index = {
+        byId: new Map(),
+        byAlias: new Map(),
+        byPath: new Map(),
+        byFamilyNumber: new Map(),
+        families: new Set(),
+        anchors: new Map(),
+        itemIds: new Set(),
+        familyOf: new Map(),
+    };
+    for (const entry of extracted) {
+        const id = entry.document.id;
+        index.byId.set(normaliseRef(id), id);
+        index.anchors.set(id, entry.anchors);
+        index.familyOf.set(id, entry.identity.family);
+        for (const alias of entry.document.aliases) {
+            const set = index.byAlias.get(alias) ?? new Set();
+            set.add(id);
+            index.byAlias.set(alias, set);
+        }
+        for (const path of pathKeys(entry.document.path))
+            index.byPath.set(path, id);
+        if (entry.identity.family !== null && entry.identity.number !== null) {
+            index.families.add(entry.identity.family);
+            const key = `${entry.identity.family}:${entry.identity.number}`;
+            const set = index.byFamilyNumber.get(key) ?? new Set();
+            set.add(id);
+            index.byFamilyNumber.set(key, set);
+        }
+        for (const item of entry.items)
+            index.itemIds.add(item.id);
+    }
+    return index;
+}
+/** Every spelling of a path that a link might use. */
+function pathKeys(path) {
+    const keys = new Set([path.toLowerCase()]);
+    const extension = extnamePosix(path);
+    if (extension.length > 0)
+        keys.add(path.slice(0, path.length - extension.length).toLowerCase());
+    // `docs/adr/0007/README.md` is also addressed as `docs/adr/0007`.
+    const base = basenamePosix(path);
+    if (/^(readme|index)\./i.test(base)) {
+        const parent = path.slice(0, path.length - base.length - 1);
+        if (parent.length > 0)
+            keys.add(parent.toLowerCase());
+    }
+    return [...keys];
+}
+/* -------------------------------------------------------------------------- */
+/* Resolution                                                                 */
+/* -------------------------------------------------------------------------- */
+function resolveOne(candidate, entry, index, nodes, options) {
+    const { target: bare, anchor } = splitAnchor(candidate.target);
+    // A pure `#anchor` points inside the citing document.
+    if (bare.length === 0 && anchor !== null) {
+        return bindAnchor(candidate, entry.document.id, anchor, index, nodes, options);
+    }
+    if (isExternal(bare))
+        return null;
+    // A link to source code, an image or a config file is not a specification
+    // reference. Validating it would report an error on the most ordinary thing a
+    // design document does.
+    if (!isDocumentTarget(bare))
+        return null;
+    const found = lookup(bare, entry, index);
+    if (found.ids.length === 0) {
+        if (candidate.opportunistic && !worthReporting(bare, index))
+            return null;
+        if (isFiltered(candidate.target, bare, options))
+            return null;
+        // A trailing slash names a directory. Linking to one is ordinary - "the
+        // decisions live in [archive/](archive/)" - and is not a citation of any
+        // document. Resolution is still attempted first, so a directory-style
+        // document written as `0007-sharding/` continues to resolve.
+        if (bare.endsWith('/'))
+            return null;
+        const reason = pathMissingReason(bare, entry, options);
+        return dangle(candidate, reason, found.near);
+    }
+    if (found.ids.length > 1) {
+        if (candidate.opportunistic)
+            return null;
+        if (isFiltered(candidate.target, bare, options))
+            return null;
+        return dangle(candidate, 'ambiguous', found.ids);
+    }
+    const documentId = found.ids[0];
+    // A document naming itself in prose - almost always its own H1, `# ADR-0007:
+    // Sharding` - is not a citation. Deliberate self-links are kept, because a
+    // link that points at its own document is a real mistake worth reporting.
+    if (candidate.opportunistic && documentId === entry.document.id)
+        return null;
+    if (anchor !== null)
+        return bindAnchor(candidate, documentId, anchor, index, nodes, options);
+    return makeEdge(candidate, documentId);
+}
+function lookup(target, entry, index) {
+    if (looksLikePath(target)) {
+        const resolved = resolveFrom(entry.document.path, target).toLowerCase();
+        const byPath = index.byPath.get(resolved);
+        if (byPath)
+            return { ids: [byPath], near: [] };
+        // A path may still be spelled as an identifier in a nested folder layout.
+        const stem = basenamePosix(resolved);
+        const byStem = index.byAlias.get(normaliseRef(stem.replace(/\.[^.]+$/, '')));
+        if (byStem && byStem.size > 0)
+            return { ids: [...byStem], near: [] };
+        return { ids: [], near: [] };
+    }
+    const key = normaliseRef(target);
+    if (key.length === 0)
+        return { ids: [], near: [] };
+    const byId = index.byId.get(key);
+    if (byId)
+        return { ids: [byId], near: [] };
+    const byAlias = index.byAlias.get(key);
+    if (byAlias && byAlias.size > 0)
+        return { ids: [...byAlias], near: [] };
+    const prefixed = parsePrefixedRef(target);
+    if (prefixed) {
+        const byFamily = index.byFamilyNumber.get(`${prefixed.family}:${prefixed.number}`);
+        if (byFamily && byFamily.size > 0)
+            return { ids: [...byFamily], near: [] };
+        return { ids: [], near: [] };
+    }
+    // A bare number resolves only inside the citing document's own family. A
+    // repository with both `adr/0007` and `rfc/0007` is ordinary, and guessing
+    // between them would be worse than reporting nothing.
+    const number = parseBareRef(target);
+    if (number !== null) {
+        const family = index.familyOf.get(entry.document.id) ?? null;
+        if (family === null)
+            return { ids: [], near: [] };
+        const byFamily = index.byFamilyNumber.get(`${family}:${number}`);
+        if (byFamily && byFamily.size > 0)
+            return { ids: [...byFamily], near: [] };
+    }
+    return { ids: [], near: [] };
+}
+/** Whether a repository has declared this reference none of its business. */
+function isFiltered(target, bare, options) {
+    if (options.isIgnoredReference?.(target))
+        return true;
+    const prefixed = parsePrefixedRef(bare);
+    return prefixed !== null && options.isIgnoredFamily?.(prefixed.family) === true;
+}
+/**
+ * Whether an unresolved bare identifier deserves a report.
+ *
+ * Only when the corpus already contains that family. `ADR-0099` in a repository
+ * of ADRs is a real dangling citation; `T-1000` in the same repository is a
+ * sentence about a robot.
+ */
+function worthReporting(target, index) {
+    const prefixed = parsePrefixedRef(target);
+    return prefixed !== null && index.families.has(prefixed.family);
+}
+function pathMissingReason(target, entry, options) {
+    if (!looksLikePath(target) || !options.fileExists)
+        return 'unknown-target';
+    const resolved = resolveFrom(entry.document.path, target);
+    return options.fileExists(resolved) ? 'not-a-spec' : 'unknown-target';
+}
+/**
+ * Binds a `#anchor` to an item or a section.
+ *
+ * Anchors are how a delegation names a specific obligation rather than a whole
+ * document, so resolving them precisely is what lets a ghost-handover finding
+ * say *which* question was handed into the archive.
+ */
+function bindAnchor(candidate, documentId, anchor, index, nodes, options) {
+    const itemId = `${documentId}#${anchor}`;
+    if (index.itemIds.has(itemId))
+        return makeEdge(candidate, itemId);
+    const anchors = index.anchors.get(documentId);
+    if (anchors?.has(anchor.toLowerCase()))
+        return makeEdge(candidate, documentId);
+    // Some renderers slugify differently; try the loosest reasonable match before
+    // calling it broken.
+    const loose = anchor.toLowerCase().replace(/[^\p{L}\p{N}]+/gu, '-').replace(/^-|-$/g, '');
+    if (anchors?.has(loose))
+        return makeEdge(candidate, documentId);
+    if (isFiltered(candidate.target, splitAnchor(candidate.target).target, options))
+        return null;
+    const candidates = [...nodes.keys()].filter((id) => id.startsWith(`${documentId}#`) && id.toLowerCase().includes(loose));
+    return {
+        kind: candidate.kind,
+        from: candidate.from,
+        target: candidate.target,
+        reason: 'unknown-anchor',
+        origin: candidate.origin,
+        declaredAt: candidate.declaredAt,
+        raw: candidate.raw,
+        candidates,
+    };
+}
+function makeEdge(candidate, resolved) {
+    const from = candidate.inverted ? resolved : candidate.from;
+    const to = candidate.inverted ? candidate.from : resolved;
+    return {
+        kind: candidate.kind,
+        from,
+        to,
+        origin: candidate.origin,
+        declaredAt: candidate.declaredAt,
+        raw: candidate.raw,
+        declaredIn: [candidate.declaredAt.file],
+        reflexive: documentOf(from) === documentOf(to),
+    };
+}
+function dangle(candidate, reason, candidates) {
+    return {
+        kind: candidate.kind,
+        from: candidate.from,
+        target: candidate.target,
+        reason,
+        origin: candidate.origin,
+        declaredAt: candidate.declaredAt,
+        raw: candidate.raw,
+        candidates,
+    };
+}
+/** The document part of a node id: `ADR-7#q.1` -> `ADR-7`. */
+export function documentOf(nodeId) {
+    const hash = nodeId.indexOf('#');
+    return hash === -1 ? nodeId : nodeId.slice(0, hash);
+}
+//# sourceMappingURL=resolve.js.map

package/dist/resolve.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"resolve.js","sourceRoot":"","sources":["../src/resolve.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;GAkBG;AAGH,OAAO,EACL,gBAAgB,EAChB,UAAU,EACV,aAAa,EACb,YAAY,EACZ,YAAY,EACZ,gBAAgB,EAChB,WAAW,GACZ,MAAM,eAAe,CAAC;AACvB,OAAO,EAAE,aAAa,EAAE,YAAY,EAAE,WAAW,EAAE,MAAM,YAAY,CAAC;AAoDtE,mEAAmE;AACnE,MAAM,UAAU,aAAa,CAC3B,SAAuC,EACvC,OAAO,GAAmB,EAAE;IAE5B,MAAM,KAAK,GAAG,UAAU,CAAC,SAAS,CAAC,CAAC;IACpC,MAAM,KAAK,GAAG,IAAI,GAAG,EAAoB,CAAC;IAC1C,MAAM,SAAS,GAAmB,EAAE,CAAC;IACrC,MAAM,KAAK,GAAe,EAAE,CAAC;IAC7B,MAAM,QAAQ,GAAmB,EAAE,CAAC;IAEpC,KAAK,MAAM,KAAK,IAAI,SAAS,EAAE,CAAC;QAC9B,MAAM,QAAQ,GAAG,KAAK,CAAC,GAAG,CAAC,KAAK,CAAC,QAAQ,CAAC,EAAE,CAAC,CAAC;QAC9C,IAAI,QAAQ,IAAI,QAAQ,CAAC,IAAI,KAAK,UAAU,EAAE,CAAC;YAC7C,QAAQ,CAAC,IAAI,CAAC;gBACZ,OAAO,EAAE,0BAA0B,KAAK,CAAC,QAAQ,CAAC,EAAE,0BAA0B,QAAQ,CAAC,IAAI,EAAE;gBAC7F,EAAE,EAAE,KAAK,CAAC,QAAQ,CAAC,EAAE;aACtB,CAAC,CAAC;YACH,SAAS;QACX,CAAC;QACD,KAAK,CAAC,GAAG,CAAC,KAAK,CAAC,QAAQ,CAAC,EAAE,EAAE,KAAK,CAAC,QAAQ,CAAC,CAAC;QAC7C,SAAS,CAAC,IAAI,CAAC,KAAK,CAAC,QAAQ,CAAC,CAAC;QAC/B,KAAK,MAAM,IAAI,IAAI,KAAK,CAAC,KAAK,EAAE,CAAC;YAC/B,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,EAAE,IAAI,CAAC,CAAC;YACzB,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACnB,CAAC;QACD,QAAQ,CAAC,IAAI,CAAC,GAAG,KAAK,CAAC,QAAQ,CAAC,CAAC;IACnC,CAAC;IAED,MAAM,KAAK,GAAW,EAAE,CAAC;IACzB,MAAM,QAAQ,GAAkB,EAAE,CAAC;IACnC,MAAM,KAAK,GAAG,IAAI,GAAG,EAAkB,CAAC;IAExC,8EAA8E;IAC9E,KAAK,MAAM,KAAK,IAAI,SAAS,EAAE,CAAC;QAC9B,IAAI,KAAK,CAAC,WAAW,KAAK,IAAI;YAAE,SAAS;QACzC,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,KAAK,CAAC,WAAW,CAAC,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,KAAK,CAAC,QAAQ,CAAC,EAAE,CAAC;YAAE,SAAS;QAC7E,KAAK,CAAC,IAAI,CAAC;YACT,IAAI,EAAE,UAAU;YAChB,IAAI,EAAE,KAAK,CAAC,WAAW;YACvB,EAAE,EAAE,KAAK,CAAC,QAAQ,CAAC,EAAE;YACrB,MAAM,EAAE,YAAY;YACpB,UAAU,EAAE,KAAK,CAAC,QAAQ,CAAC,EAAE;YAC7B,GAAG,EAAE,KAAK,CAAC,QAAQ,CAAC,KAAK;YACzB,UAAU,EAAE,CAAC,KAAK,CAAC,QAAQ,CAAC,EAAE,CAAC,IAAI,CAAC;YACpC,SAAS,EAAE,KAAK;SACjB,CAAC,CAAC;IACL,CAAC;IAED,mDAAmD;IACnD,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;QACzB,KAAK,CAAC,IAAI,CAAC;YACT,IAAI,EAAE,UAAU;YAChB,IAAI,EAAE,IAAI,CAAC,QAAQ;YACnB,EAAE,EAAE,IAAI,CAAC,EAAE;YACX,MAAM,EAAE,YAAY;YACpB,UAAU,EAAE,IAAI,CAAC,EAAE;YACnB,GAAG,EAAE,IAAI,CAAC,IAAI;YACd,UAAU,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,IAAI,CAAC;YAC1B,SAAS,EAAE,KAAK;SACjB,CAAC,CAAC;IACL,CAAC;IAED,KAAK,MAAM,KAAK,IAAI,SAAS,EAAE,CAAC;QAC9B,KAAK,MAAM,SAAS,IAAI,KAAK,CAAC,UAAU,EAAE,CAAC;YACzC,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,SAAS,CAAC,IAAI,CAAC;gBAAE,SAAS;YACzC,MAAM,OAAO,GAAG,UAAU,CAAC,SAAS,EAAE,KAAK,EAAE,KAAK,EAAE,KAAK,EAAE,OAAO,CAAC,CAAC;YACpE,IAAI,OAAO,KAAK,IAAI;gBAAE,SAAS;YAC/B,IAAI,QAAQ,IAAI,OAAO,EAAE,CAAC;gBACxB,QAAQ,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;gBACvB,SAAS;YACX,CAAC;YACD,wEAAwE;YACxE,0EAA0E;YAC1E,gDAAgD;YAChD,MAAM,GAAG,GAAG,GAAG,OAAO,CAAC,IAAI,IAAI,OAAO,CAAC,IAAI,IAAI,OAAO,CAAC,EAAE,EAAE,CAAC;YAC5D,MAAM,QAAQ,GAAG,KAAK,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;YAChC,IAAI,QAAQ,KAAK,SAAS,EAAE,CAAC;gBAC3B,MAAM,QAAQ,GAAG,KAAK,CAAC,QAAQ,CAAS,CAAC;gBACzC,IAAI,CAAC,QAAQ,CAAC,UAAU,CAAC,QAAQ,CAAC,OAAO,CAAC,UAAU,CAAC,IAAI,CAAC,EAAE,CAAC;oBAC3D,KAAK,CAAC,QAAQ,CAAC,GAAG,EAAE,GAAG,QAAQ,EAAE,UAAU,EAAE,CAAC,GAAG,QAAQ,CAAC,UAAU,EAAE,OAAO,CAAC,UAAU,CAAC,IAAI,CAAC,EAAE,CAAC;gBACnG,CAAC;gBACD,SAAS;YACX,CAAC;YACD,KAAK,CAAC,GAAG,CAAC,GAAG,EAAE,KAAK,CAAC,MAAM,CAAC,CAAC;YAC7B,KAAK,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;QACtB,CAAC;IACH,CAAC;IAED,OAAO,EAAE,KAAK,EAAE,SAAS,EAAE,KAAK,EAAE,KAAK,EAAE,QAAQ,EAAE,QAAQ,EAAE,CAAC;AAChE,CAAC;AAED,gFAAgF;AAChF,gFAAgF;AAChF,gFAAgF;AAEhF,SAAS,UAAU,CAAC,SAAuC;IACzD,MAAM,KAAK,GAAU;QACnB,IAAI,EAAE,IAAI,GAAG,EAAE;QACf,OAAO,EAAE,IAAI,GAAG,EAAE;QAClB,MAAM,EAAE,IAAI,GAAG,EAAE;QACjB,cAAc,EAAE,IAAI,GAAG,EAAE;QACzB,QAAQ,EAAE,IAAI,GAAG,EAAE;QACnB,OAAO,EAAE,IAAI,GAAG,EAAE;QAClB,OAAO,EAAE,IAAI,GAAG,EAAE;QAClB,QAAQ,EAAE,IAAI,GAAG,EAAE;KACpB,CAAC;IAEF,KAAK,MAAM,KAAK,IAAI,SAAS,EAAE,CAAC;QAC9B,MAAM,EAAE,GAAG,KAAK,CAAC,QAAQ,CAAC,EAAE,CAAC;QAC7B,KAAK,CAAC,IAAI,CAAC,GAAG,CAAC,YAAY,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC;QACrC,KAAK,CAAC,OAAO,CAAC,GAAG,CAAC,EAAE,EAAE,KAAK,CAAC,OAAO,CAAC,CAAC;QACrC,KAAK,CAAC,QAAQ,CAAC,GAAG,CAAC,EAAE,EAAE,KAAK,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC;QAE9C,KAAK,MAAM,KAAK,IAAI,KAAK,CAAC,QAAQ,CAAC,OAAO,EAAE,CAAC;YAC3C,MAAM,GAAG,GAAG,KAAK,CAAC,OAAO,CAAC,GAAG,CAAC,KAAK,CAAC,IAAI,IAAI,GAAG,EAAU,CAAC;YAC1D,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;YACZ,KAAK,CAAC,OAAO,CAAC,GAAG,CAAC,KAAK,EAAE,GAAG,CAAC,CAAC;QAChC,CAAC;QAED,KAAK,MAAM,IAAI,IAAI,QAAQ,CAAC,KAAK,CAAC,QAAQ,CAAC,IAAI,CAAC;YAAE,KAAK,CAAC,MAAM,CAAC,GAAG,CAAC,IAAI,EAAE,EAAE,CAAC,CAAC;QAE7E,IAAI,KAAK,CAAC,QAAQ,CAAC,MAAM,KAAK,IAAI,IAAI,KAAK,CAAC,QAAQ,CAAC,MAAM,KAAK,IAAI,EAAE,CAAC;YACrE,KAAK,CAAC,QAAQ,CAAC,GAAG,CAAC,KAAK,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC;YAC1C,MAAM,GAAG,GAAG,GAAG,KAAK,CAAC,QAAQ,CAAC,MAAM,IAAI,KAAK,CAAC,QAAQ,CAAC,MAAM,EAAE,CAAC;YAChE,MAAM,GAAG,GAAG,KAAK,CAAC,cAAc,CAAC,GAAG,CAAC,GAAG,CAAC,IAAI,IAAI,GAAG,EAAU,CAAC;YAC/D,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;YACZ,KAAK,CAAC,cAAc,CAAC,GAAG,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;QACrC,CAAC;QAED,KAAK,MAAM,IAAI,IAAI,KAAK,CAAC,KAAK;YAAE,KAAK,CAAC,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;IAC7D,CAAC;IAED,OAAO,KAAK,CAAC;AACf,CAAC;AAED,sDAAsD;AACtD,SAAS,QAAQ,CAAC,IAAY;IAC5B,MAAM,IAAI,GAAG,IAAI,GAAG,CAAS,CAAC,IAAI,CAAC,WAAW,EAAE,CAAC,CAAC,CAAC;IACnD,MAAM,SAAS,GAAG,YAAY,CAAC,IAAI,CAAC,CAAC;IACrC,IAAI,SAAS,CAAC,MAAM,GAAG,CAAC;QAAE,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,EAAE,IAAI,CAAC,MAAM,GAAG,SAAS,CAAC,MAAM,CAAC,CAAC,WAAW,EAAE,CAAC,CAAC;IAChG,kEAAkE;IAClE,MAAM,IAAI,GAAG,aAAa,CAAC,IAAI,CAAC,CAAC;IACjC,IAAI,oBAAoB,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC;QACpC,MAAM,MAAM,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,EAAE,IAAI,CAAC,MAAM,GAAG,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;QAC5D,IAAI,MAAM,CAAC,MAAM,GAAG,CAAC;YAAE,IAAI,CAAC,GAAG,CAAC,MAAM,CAAC,WAAW,EAAE,CAAC,CAAC;IACxD,CAAC;IACD,OAAO,CAAC,GAAG,IAAI,CAAC,CAAC;AACnB,CAAC;AAED,gFAAgF;AAChF,gFAAgF;AAChF,gFAAgF;AAEhF,SAAS,UAAU,CACjB,SAA6B,EAC7B,KAAwB,EACxB,KAAY,EACZ,KAAoC,EACpC,OAAuB;IAEvB,MAAM,EAAE,MAAM,EAAE,IAAI,EAAE,MAAM,EAAE,GAAG,WAAW,CAAC,SAAS,CAAC,MAAM,CAAC,CAAC;IAE/D,sDAAsD;IACtD,IAAI,IAAI,CAAC,MAAM,KAAK,CAAC,IAAI,MAAM,KAAK,IAAI,EAAE,CAAC;QACzC,OAAO,UAAU,CAAC,SAAS,EAAE,KAAK,CAAC,QAAQ,CAAC,EAAE,EAAE,MAAM,EAAE,KAAK,EAAE,KAAK,EAAE,OAAO,CAAC,CAAC;IACjF,CAAC;IAED,IAAI,UAAU,CAAC,IAAI,CAAC;QAAE,OAAO,IAAI,CAAC;IAClC,0EAA0E;IAC1E,8EAA8E;IAC9E,wBAAwB;IACxB,IAAI,CAAC,gBAAgB,CAAC,IAAI,CAAC;QAAE,OAAO,IAAI,CAAC;IAEzC,MAAM,KAAK,GAAG,MAAM,CAAC,IAAI,EAAE,KAAK,EAAE,KAAK,CAAC,CAAC;IAEzC,IAAI,KAAK,CAAC,GAAG,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QAC3B,IAAI,SAAS,CAAC,aAAa,IAAI,CAAC,cAAc,CAAC,IAAI,EAAE,KAAK,CAAC;YAAE,OAAO,IAAI,CAAC;QACzE,IAAI,UAAU,CAAC,SAAS,CAAC,MAAM,EAAE,IAAI,EAAE,OAAO,CAAC;YAAE,OAAO,IAAI,CAAC;QAC7D,wEAAwE;QACxE,yEAAyE;QACzE,sEAAsE;QACtE,6DAA6D;QAC7D,IAAI,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC;YAAE,OAAO,IAAI,CAAC;QACpC,MAAM,MAAM,GAAG,iBAAiB,CAAC,IAAI,EAAE,KAAK,EAAE,OAAO,CAAC,CAAC;QACvD,OAAO,MAAM,CAAC,SAAS,EAAE,MAAM,EAAE,KAAK,CAAC,IAAI,CAAC,CAAC;IAC/C,CAAC;IAED,IAAI,KAAK,CAAC,GAAG,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QACzB,IAAI,SAAS,CAAC,aAAa;YAAE,OAAO,IAAI,CAAC;QACzC,IAAI,UAAU,CAAC,SAAS,CAAC,MAAM,EAAE,IAAI,EAAE,OAAO,CAAC;YAAE,OAAO,IAAI,CAAC;QAC7D,OAAO,MAAM,CAAC,SAAS,EAAE,WAAW,EAAE,KAAK,CAAC,GAAG,CAAC,CAAC;IACnD,CAAC;IAED,MAAM,UAAU,GAAG,KAAK,CAAC,GAAG,CAAC,CAAC,CAAW,CAAC;IAE1C,6EAA6E;IAC7E,2EAA2E;IAC3E,0EAA0E;IAC1E,IAAI,SAAS,CAAC,aAAa,IAAI,UAAU,KAAK,KAAK,CAAC,QAAQ,CAAC,EAAE;QAAE,OAAO,IAAI,CAAC;IAE7E,IAAI,MAAM,KAAK,IAAI;QAAE,OAAO,UAAU,CAAC,SAAS,EAAE,UAAU,EAAE,MAAM,EAAE,KAAK,EAAE,KAAK,EAAE,OAAO,CAAC,CAAC;IAE7F,OAAO,QAAQ,CAAC,SAAS,EAAE,UAAU,CAAC,CAAC;AACzC,CAAC;AAQD,SAAS,MAAM,CAAC,MAAc,EAAE,KAAwB,EAAE,KAAY;IACpE,IAAI,aAAa,CAAC,MAAM,CAAC,EAAE,CAAC;QAC1B,MAAM,QAAQ,GAAG,WAAW,CAAC,KAAK,CAAC,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAC,CAAC,WAAW,EAAE,CAAC;QACxE,MAAM,MAAM,GAAG,KAAK,CAAC,MAAM,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC;QAC1C,IAAI,MAAM;YAAE,OAAO,EAAE,GAAG,EAAE,CAAC,MAAM,CAAC,EAAE,IAAI,EAAE,EAAE,EAAE,CAAC;QAC/C,0EAA0E;QAC1E,MAAM,IAAI,GAAG,aAAa,CAAC,QAAQ,CAAC,CAAC;QACrC,MAAM,MAAM,GAAG,KAAK,CAAC,OAAO,CAAC,GAAG,CAAC,YAAY,CAAC,IAAI,CAAC,OAAO,CAAC,UAAU,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC;QAC7E,IAAI,MAAM,IAAI,MAAM,CAAC,IAAI,GAAG,CAAC;YAAE,OAAO,EAAE,GAAG,EAAE,CAAC,GAAG,MAAM,CAAC,EAAE,IAAI,EAAE,EAAE,EAAE,CAAC;QACrE,OAAO,EAAE,GAAG,EAAE,EAAE,EAAE,IAAI,EAAE,EAAE,EAAE,CAAC;IAC/B,CAAC;IAED,MAAM,GAAG,GAAG,YAAY,CAAC,MAAM,CAAC,CAAC;IACjC,IAAI,GAAG,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,EAAE,GAAG,EAAE,EAAE,EAAE,IAAI,EAAE,EAAE,EAAE,CAAC;IAEnD,MAAM,IAAI,GAAG,KAAK,CAAC,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;IACjC,IAAI,IAAI;QAAE,OAAO,EAAE,GAAG,EAAE,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,EAAE,EAAE,CAAC;IAE3C,MAAM,OAAO,GAAG,KAAK,CAAC,OAAO,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;IACvC,IAAI,OAAO,IAAI,OAAO,CAAC,IAAI,GAAG,CAAC;QAAE,OAAO,EAAE,GAAG,EAAE,CAAC,GAAG,OAAO,CAAC,EAAE,IAAI,EAAE,EAAE,EAAE,CAAC;IAExE,MAAM,QAAQ,GAAG,gBAAgB,CAAC,MAAM,CAAC,CAAC;IAC1C,IAAI,QAAQ,EAAE,CAAC;QACb,MAAM,QAAQ,GAAG,KAAK,CAAC,cAAc,CAAC,GAAG,CAAC,GAAG,QAAQ,CAAC,MAAM,IAAI,QAAQ,CAAC,MAAM,EAAE,CAAC,CAAC;QACnF,IAAI,QAAQ,IAAI,QAAQ,CAAC,IAAI,GAAG,CAAC;YAAE,OAAO,EAAE,GAAG,EAAE,CAAC,GAAG,QAAQ,CAAC,EAAE,IAAI,EAAE,EAAE,EAAE,CAAC;QAC3E,OAAO,EAAE,GAAG,EAAE,EAAE,EAAE,IAAI,EAAE,EAAE,EAAE,CAAC;IAC/B,CAAC;IAED,yEAAyE;IACzE,2EAA2E;IAC3E,sDAAsD;IACtD,MAAM,MAAM,GAAG,YAAY,CAAC,MAAM,CAAC,CAAC;IACpC,IAAI,MAAM,KAAK,IAAI,EAAE,CAAC;QACpB,MAAM,MAAM,GAAG,KAAK,CAAC,QAAQ,CAAC,GAAG,CAAC,KAAK,CAAC,QAAQ,CAAC,EAAE,CAAC,IAAI,IAAI,CAAC;QAC7D,IAAI,MAAM,KAAK,IAAI;YAAE,OAAO,EAAE,GAAG,EAAE,EAAE,EAAE,IAAI,EAAE,EAAE,EAAE,CAAC;QAClD,MAAM,QAAQ,GAAG,KAAK,CAAC,cAAc,CAAC,GAAG,CAAC,GAAG,MAAM,IAAI,MAAM,EAAE,CAAC,CAAC;QACjE,IAAI,QAAQ,IAAI,QAAQ,CAAC,IAAI,GAAG,CAAC;YAAE,OAAO,EAAE,GAAG,EAAE,CAAC,GAAG,QAAQ,CAAC,EAAE,IAAI,EAAE,EAAE,EAAE,CAAC;IAC7E,CAAC;IAED,OAAO,EAAE,GAAG,EAAE,EAAE,EAAE,IAAI,EAAE,EAAE,EAAE,CAAC;AAC/B,CAAC;AAED,6EAA6E;AAC7E,SAAS,UAAU,CAAC,MAAc,EAAE,IAAY,EAAE,OAAuB;IACvE,IAAI,OAAO,CAAC,kBAAkB,EAAE,CAAC,MAAM,CAAC;QAAE,OAAO,IAAI,CAAC;IACtD,MAAM,QAAQ,GAAG,gBAAgB,CAAC,IAAI,CAAC,CAAC;IACxC,OAAO,QAAQ,KAAK,IAAI,IAAI,OAAO,CAAC,eAAe,EAAE,CAAC,QAAQ,CAAC,MAAM,CAAC,KAAK,IAAI,CAAC;AAClF,CAAC;AAED;;;;;;GAMG;AACH,SAAS,cAAc,CAAC,MAAc,EAAE,KAAY;IAClD,MAAM,QAAQ,GAAG,gBAAgB,CAAC,MAAM,CAAC,CAAC;IAC1C,OAAO,QAAQ,KAAK,IAAI,IAAI,KAAK,CAAC,QAAQ,CAAC,GAAG,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC;AAClE,CAAC;AAED,SAAS,iBAAiB,CACxB,MAAc,EACd,KAAwB,EACxB,OAAuB;IAEvB,IAAI,CAAC,aAAa,CAAC,MAAM,CAAC,IAAI,CAAC,OAAO,CAAC,UAAU;QAAE,OAAO,gBAAgB,CAAC;IAC3E,MAAM,QAAQ,GAAG,WAAW,CAAC,KAAK,CAAC,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAC,CAAC;IAC1D,OAAO,OAAO,CAAC,UAAU,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,YAAY,CAAC,CAAC,CAAC,gBAAgB,CAAC;AACxE,CAAC;AAED;;;;;;GAMG;AACH,SAAS,UAAU,CACjB,SAA6B,EAC7B,UAAkB,EAClB,MAAc,EACd,KAAY,EACZ,KAAoC,EACpC,OAAuB;IAEvB,MAAM,MAAM,GAAG,GAAG,UAAU,IAAI,MAAM,EAAE,CAAC;IACzC,IAAI,KAAK,CAAC,OAAO,CAAC,GAAG,CAAC,MAAM,CAAC;QAAE,OAAO,QAAQ,CAAC,SAAS,EAAE,MAAM,CAAC,CAAC;IAElE,MAAM,OAAO,GAAG,KAAK,CAAC,OAAO,CAAC,GAAG,CAAC,UAAU,CAAC,CAAC;IAC9C,IAAI,OAAO,EAAE,GAAG,CAAC,MAAM,CAAC,WAAW,EAAE,CAAC;QAAE,OAAO,QAAQ,CAAC,SAAS,EAAE,UAAU,CAAC,CAAC;IAE/E,8EAA8E;IAC9E,qBAAqB;IACrB,MAAM,KAAK,GAAG,MAAM,CAAC,WAAW,EAAE,CAAC,OAAO,CAAC,kBAAkB,EAAE,GAAG,CAAC,CAAC,OAAO,CAAC,QAAQ,EAAE,EAAE,CAAC,CAAC;IAC1F,IAAI,OAAO,EAAE,GAAG,CAAC,KAAK,CAAC;QAAE,OAAO,QAAQ,CAAC,SAAS,EAAE,UAAU,CAAC,CAAC;IAEhE,IAAI,UAAU,CAAC,SAAS,CAAC,MAAM,EAAE,WAAW,CAAC,SAAS,CAAC,MAAM,CAAC,CAAC,MAAM,EAAE,OAAO,CAAC;QAAE,OAAO,IAAI,CAAC;IAE7F,MAAM,UAAU,GAAG,CAAC,GAAI,KAAK,CAAC,IAAI,EAAuB,CAAC,CAAC,MAAM,CAC/D,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,CAAC,UAAU,CAAC,GAAG,UAAU,GAAG,CAAC,IAAI,EAAE,CAAC,WAAW,EAAE,CAAC,QAAQ,CAAC,KAAK,CAAC,CAC5E,CAAC;IACF,OAAO;QACL,IAAI,EAAE,SAAS,CAAC,IAAI;QACpB,IAAI,EAAE,SAAS,CAAC,IAAI;QACpB,MAAM,EAAE,SAAS,CAAC,MAAM;QACxB,MAAM,EAAE,gBAAgB;QACxB,MAAM,EAAE,SAAS,CAAC,MAAM;QACxB,UAAU,EAAE,SAAS,CAAC,UAAU;QAChC,GAAG,EAAE,SAAS,CAAC,GAAG;QAClB,UAAU;KACX,CAAC;AACJ,CAAC;AAED,SAAS,QAAQ,CAAC,SAA6B,EAAE,QAAgB;IAC/D,MAAM,IAAI,GAAG,SAAS,CAAC,QAAQ,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,SAAS,CAAC,IAAI,CAAC;IAC5D,MAAM,EAAE,GAAG,SAAS,CAAC,QAAQ,CAAC,CAAC,CAAC,SAAS,CAAC,IAAI,CAAC,CAAC,CAAC,QAAQ,CAAC;IAC1D,OAAO;QACL,IAAI,EAAE,SAAS,CAAC,IAAI;QACpB,IAAI;QACJ,EAAE;QACF,MAAM,EAAE,SAAS,CAAC,MAAM;QACxB,UAAU,EAAE,SAAS,CAAC,UAAU;QAChC,GAAG,EAAE,SAAS,CAAC,GAAG;QAClB,UAAU,EAAE,CAAC,SAAS,CAAC,UAAU,CAAC,IAAI,CAAC;QACvC,SAAS,EAAE,UAAU,CAAC,IAAI,CAAC,KAAK,UAAU,CAAC,EAAE,CAAC;KAC/C,CAAC;AACJ,CAAC;AAED,SAAS,MAAM,CACb,SAA6B,EAC7B,MAA6B,EAC7B,UAA6B;IAE7B,OAAO;QACL,IAAI,EAAE,SAAS,CAAC,IAAI;QACpB,IAAI,EAAE,SAAS,CAAC,IAAI;QACpB,MAAM,EAAE,SAAS,CAAC,MAAM;QACxB,MAAM;QACN,MAAM,EAAE,SAAS,CAAC,MAAM;QACxB,UAAU,EAAE,SAAS,CAAC,UAAU;QAChC,GAAG,EAAE,SAAS,CAAC,GAAG;QAClB,UAAU;KACX,CAAC;AACJ,CAAC;AAED,8DAA8D;AAC9D,MAAM,UAAU,UAAU,CAAC,MAAc;IACvC,MAAM,IAAI,GAAG,MAAM,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC;IACjC,OAAO,IAAI,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC;AACtD,CAAC","sourcesContent":["/**\n * Corpus-level reference resolution - the foreign-key check.\n *\n * Extraction produces relations whose targets are still just text. This module\n * turns each into an edge or into an explicit, reportable failure. The whole\n * value of the exercise is in refusing to do either job carelessly:\n *\n * - **A deliberate reference that does not resolve is an error.** A link, a\n *   front-matter field or a directive naming a document that does not exist is\n *   a broken foreign key, and silence about it is how reference graphs rot.\n * - **An opportunistic reference that does not resolve is nothing.** `ADR-0007`\n *   written in prose is a citation; `SHA-256` is not. Since the two are\n *   indistinguishable in isolation, bare identifiers are only reported when\n *   their family already exists in the corpus - so `ADR-0099` in a repository\n *   full of ADRs is a finding, and `T-1000` in the same repository is not.\n * - **Two candidates is worse than none.** A reference that matches several\n *   documents is reported as ambiguous rather than silently bound to whichever\n *   one happened to be indexed first.\n */\n\nimport type { ExtractedDocument, ReferenceCandidate } from './extract.js';\nimport {\n  isDocumentTarget,\n  isExternal,\n  looksLikePath,\n  normaliseRef,\n  parseBareRef,\n  parsePrefixedRef,\n  splitAnchor,\n} from './identity.js';\nimport { basenamePosix, extnamePosix, resolveFrom } from './paths.js';\nimport type { DanglingRef, DocumentNode, Edge, ItemNode, ParseProblem, SpecNode } from './types.js';\n\nexport interface ResolveOptions {\n  /**\n   * Whether a repository-relative path exists on disk.\n   *\n   * Used only to tell \"you linked to a file that is not a specification\" apart\n   * from \"you linked to nothing at all\", which are different mistakes with\n   * different fixes.\n   */\n  readonly fileExists?: ((path: string) => boolean) | undefined;\n  /**\n   * Targets whose failure to resolve should not be reported.\n   *\n   * This is a *suppression* filter, not a resolution one: it is consulted only\n   * when a reference has already failed to resolve. A reference that resolves\n   * still becomes an edge no matter what this says, so no amount of\n   * configuration can silently delete a relation from the graph.\n   */\n  readonly isIgnoredReference?: ((target: string) => boolean) | undefined;\n  /**\n   * Families that are never citations in this repository.\n   *\n   * `RFC 2119` is the canonical case: every specification cites it, and a\n   * repository that keeps its own `RFC-*` documents will otherwise read that\n   * sentence as a dangling reference to a local RFC 2119 it does not have.\n   * Consulted only after resolution has failed, like every other filter here.\n   */\n  readonly isIgnoredFamily?: ((family: string) => boolean) | undefined;\n}\n\nexport interface ResolvedCorpus {\n  readonly nodes: ReadonlyMap<string, SpecNode>;\n  readonly documents: readonly DocumentNode[];\n  readonly items: readonly ItemNode[];\n  readonly edges: readonly Edge[];\n  readonly dangling: readonly DanglingRef[];\n  readonly problems: readonly ParseProblem[];\n}\n\ninterface Index {\n  readonly byId: Map<string, string>;\n  readonly byAlias: Map<string, Set<string>>;\n  readonly byPath: Map<string, string>;\n  readonly byFamilyNumber: Map<string, Set<string>>;\n  readonly families: Set<string>;\n  readonly anchors: Map<string, ReadonlySet<string>>;\n  readonly itemIds: Set<string>;\n  readonly familyOf: Map<string, string | null>;\n}\n\n/** Resolves every extracted reference against the whole corpus. */\nexport function resolveCorpus(\n  extracted: readonly ExtractedDocument[],\n  options: ResolveOptions = {},\n): ResolvedCorpus {\n  const index = buildIndex(extracted);\n  const nodes = new Map<string, SpecNode>();\n  const documents: DocumentNode[] = [];\n  const items: ItemNode[] = [];\n  const problems: ParseProblem[] = [];\n\n  for (const entry of extracted) {\n    const existing = nodes.get(entry.document.id);\n    if (existing && existing.kind === 'document') {\n      problems.push({\n        message: `duplicate document id \"${entry.document.id}\", already declared by ${existing.path}`,\n        at: entry.document.at,\n      });\n      continue;\n    }\n    nodes.set(entry.document.id, entry.document);\n    documents.push(entry.document);\n    for (const item of entry.items) {\n      nodes.set(item.id, item);\n      items.push(item);\n    }\n    problems.push(...entry.problems);\n  }\n\n  const edges: Edge[] = [];\n  const dangling: DanglingRef[] = [];\n  const byKey = new Map<string, number>();\n\n  // Structural edges: a register contains the specifications written inside it.\n  for (const entry of extracted) {\n    if (entry.containerId === null) continue;\n    if (!nodes.has(entry.containerId) || !nodes.has(entry.document.id)) continue;\n    edges.push({\n      kind: 'contains',\n      from: entry.containerId,\n      to: entry.document.id,\n      origin: 'structural',\n      declaredAt: entry.document.at,\n      raw: entry.document.title,\n      declaredIn: [entry.document.at.file],\n      reflexive: false,\n    });\n  }\n\n  // Structural edges: a document contains its items.\n  for (const item of items) {\n    edges.push({\n      kind: 'contains',\n      from: item.document,\n      to: item.id,\n      origin: 'structural',\n      declaredAt: item.at,\n      raw: item.text,\n      declaredIn: [item.at.file],\n      reflexive: false,\n    });\n  }\n\n  for (const entry of extracted) {\n    for (const candidate of entry.references) {\n      if (!nodes.has(candidate.from)) continue;\n      const outcome = resolveOne(candidate, entry, index, nodes, options);\n      if (outcome === null) continue;\n      if ('reason' in outcome) {\n        dangling.push(outcome);\n        continue;\n      }\n      // Collapse duplicates: the same relation stated twice is one edge - but\n      // every declaration site is kept, because a supersession recorded in only\n      // one of the two documents is itself a finding.\n      const key = `${outcome.kind} ${outcome.from} ${outcome.to}`;\n      const existing = byKey.get(key);\n      if (existing !== undefined) {\n        const previous = edges[existing] as Edge;\n        if (!previous.declaredIn.includes(outcome.declaredAt.file)) {\n          edges[existing] = { ...previous, declaredIn: [...previous.declaredIn, outcome.declaredAt.file] };\n        }\n        continue;\n      }\n      byKey.set(key, edges.length);\n      edges.push(outcome);\n    }\n  }\n\n  return { nodes, documents, items, edges, dangling, problems };\n}\n\n/* -------------------------------------------------------------------------- */\n/* Indexing                                                                   */\n/* -------------------------------------------------------------------------- */\n\nfunction buildIndex(extracted: readonly ExtractedDocument[]): Index {\n  const index: Index = {\n    byId: new Map(),\n    byAlias: new Map(),\n    byPath: new Map(),\n    byFamilyNumber: new Map(),\n    families: new Set(),\n    anchors: new Map(),\n    itemIds: new Set(),\n    familyOf: new Map(),\n  };\n\n  for (const entry of extracted) {\n    const id = entry.document.id;\n    index.byId.set(normaliseRef(id), id);\n    index.anchors.set(id, entry.anchors);\n    index.familyOf.set(id, entry.identity.family);\n\n    for (const alias of entry.document.aliases) {\n      const set = index.byAlias.get(alias) ?? new Set<string>();\n      set.add(id);\n      index.byAlias.set(alias, set);\n    }\n\n    for (const path of pathKeys(entry.document.path)) index.byPath.set(path, id);\n\n    if (entry.identity.family !== null && entry.identity.number !== null) {\n      index.families.add(entry.identity.family);\n      const key = `${entry.identity.family}:${entry.identity.number}`;\n      const set = index.byFamilyNumber.get(key) ?? new Set<string>();\n      set.add(id);\n      index.byFamilyNumber.set(key, set);\n    }\n\n    for (const item of entry.items) index.itemIds.add(item.id);\n  }\n\n  return index;\n}\n\n/** Every spelling of a path that a link might use. */\nfunction pathKeys(path: string): string[] {\n  const keys = new Set<string>([path.toLowerCase()]);\n  const extension = extnamePosix(path);\n  if (extension.length > 0) keys.add(path.slice(0, path.length - extension.length).toLowerCase());\n  // `docs/adr/0007/README.md` is also addressed as `docs/adr/0007`.\n  const base = basenamePosix(path);\n  if (/^(readme|index)\\./i.test(base)) {\n    const parent = path.slice(0, path.length - base.length - 1);\n    if (parent.length > 0) keys.add(parent.toLowerCase());\n  }\n  return [...keys];\n}\n\n/* -------------------------------------------------------------------------- */\n/* Resolution                                                                 */\n/* -------------------------------------------------------------------------- */\n\nfunction resolveOne(\n  candidate: ReferenceCandidate,\n  entry: ExtractedDocument,\n  index: Index,\n  nodes: ReadonlyMap<string, SpecNode>,\n  options: ResolveOptions,\n): Edge | DanglingRef | null {\n  const { target: bare, anchor } = splitAnchor(candidate.target);\n\n  // A pure `#anchor` points inside the citing document.\n  if (bare.length === 0 && anchor !== null) {\n    return bindAnchor(candidate, entry.document.id, anchor, index, nodes, options);\n  }\n\n  if (isExternal(bare)) return null;\n  // A link to source code, an image or a config file is not a specification\n  // reference. Validating it would report an error on the most ordinary thing a\n  // design document does.\n  if (!isDocumentTarget(bare)) return null;\n\n  const found = lookup(bare, entry, index);\n\n  if (found.ids.length === 0) {\n    if (candidate.opportunistic && !worthReporting(bare, index)) return null;\n    if (isFiltered(candidate.target, bare, options)) return null;\n    // A trailing slash names a directory. Linking to one is ordinary - \"the\n    // decisions live in [archive/](archive/)\" - and is not a citation of any\n    // document. Resolution is still attempted first, so a directory-style\n    // document written as `0007-sharding/` continues to resolve.\n    if (bare.endsWith('/')) return null;\n    const reason = pathMissingReason(bare, entry, options);\n    return dangle(candidate, reason, found.near);\n  }\n\n  if (found.ids.length > 1) {\n    if (candidate.opportunistic) return null;\n    if (isFiltered(candidate.target, bare, options)) return null;\n    return dangle(candidate, 'ambiguous', found.ids);\n  }\n\n  const documentId = found.ids[0] as string;\n\n  // A document naming itself in prose - almost always its own H1, `# ADR-0007:\n  // Sharding` - is not a citation. Deliberate self-links are kept, because a\n  // link that points at its own document is a real mistake worth reporting.\n  if (candidate.opportunistic && documentId === entry.document.id) return null;\n\n  if (anchor !== null) return bindAnchor(candidate, documentId, anchor, index, nodes, options);\n\n  return makeEdge(candidate, documentId);\n}\n\ninterface Lookup {\n  readonly ids: readonly string[];\n  /** Near-misses worth suggesting in the report. */\n  readonly near: readonly string[];\n}\n\nfunction lookup(target: string, entry: ExtractedDocument, index: Index): Lookup {\n  if (looksLikePath(target)) {\n    const resolved = resolveFrom(entry.document.path, target).toLowerCase();\n    const byPath = index.byPath.get(resolved);\n    if (byPath) return { ids: [byPath], near: [] };\n    // A path may still be spelled as an identifier in a nested folder layout.\n    const stem = basenamePosix(resolved);\n    const byStem = index.byAlias.get(normaliseRef(stem.replace(/\\.[^.]+$/, '')));\n    if (byStem && byStem.size > 0) return { ids: [...byStem], near: [] };\n    return { ids: [], near: [] };\n  }\n\n  const key = normaliseRef(target);\n  if (key.length === 0) return { ids: [], near: [] };\n\n  const byId = index.byId.get(key);\n  if (byId) return { ids: [byId], near: [] };\n\n  const byAlias = index.byAlias.get(key);\n  if (byAlias && byAlias.size > 0) return { ids: [...byAlias], near: [] };\n\n  const prefixed = parsePrefixedRef(target);\n  if (prefixed) {\n    const byFamily = index.byFamilyNumber.get(`${prefixed.family}:${prefixed.number}`);\n    if (byFamily && byFamily.size > 0) return { ids: [...byFamily], near: [] };\n    return { ids: [], near: [] };\n  }\n\n  // A bare number resolves only inside the citing document's own family. A\n  // repository with both `adr/0007` and `rfc/0007` is ordinary, and guessing\n  // between them would be worse than reporting nothing.\n  const number = parseBareRef(target);\n  if (number !== null) {\n    const family = index.familyOf.get(entry.document.id) ?? null;\n    if (family === null) return { ids: [], near: [] };\n    const byFamily = index.byFamilyNumber.get(`${family}:${number}`);\n    if (byFamily && byFamily.size > 0) return { ids: [...byFamily], near: [] };\n  }\n\n  return { ids: [], near: [] };\n}\n\n/** Whether a repository has declared this reference none of its business. */\nfunction isFiltered(target: string, bare: string, options: ResolveOptions): boolean {\n  if (options.isIgnoredReference?.(target)) return true;\n  const prefixed = parsePrefixedRef(bare);\n  return prefixed !== null && options.isIgnoredFamily?.(prefixed.family) === true;\n}\n\n/**\n * Whether an unresolved bare identifier deserves a report.\n *\n * Only when the corpus already contains that family. `ADR-0099` in a repository\n * of ADRs is a real dangling citation; `T-1000` in the same repository is a\n * sentence about a robot.\n */\nfunction worthReporting(target: string, index: Index): boolean {\n  const prefixed = parsePrefixedRef(target);\n  return prefixed !== null && index.families.has(prefixed.family);\n}\n\nfunction pathMissingReason(\n  target: string,\n  entry: ExtractedDocument,\n  options: ResolveOptions,\n): DanglingRef['reason'] {\n  if (!looksLikePath(target) || !options.fileExists) return 'unknown-target';\n  const resolved = resolveFrom(entry.document.path, target);\n  return options.fileExists(resolved) ? 'not-a-spec' : 'unknown-target';\n}\n\n/**\n * Binds a `#anchor` to an item or a section.\n *\n * Anchors are how a delegation names a specific obligation rather than a whole\n * document, so resolving them precisely is what lets a ghost-handover finding\n * say *which* question was handed into the archive.\n */\nfunction bindAnchor(\n  candidate: ReferenceCandidate,\n  documentId: string,\n  anchor: string,\n  index: Index,\n  nodes: ReadonlyMap<string, SpecNode>,\n  options: ResolveOptions,\n): Edge | DanglingRef | null {\n  const itemId = `${documentId}#${anchor}`;\n  if (index.itemIds.has(itemId)) return makeEdge(candidate, itemId);\n\n  const anchors = index.anchors.get(documentId);\n  if (anchors?.has(anchor.toLowerCase())) return makeEdge(candidate, documentId);\n\n  // Some renderers slugify differently; try the loosest reasonable match before\n  // calling it broken.\n  const loose = anchor.toLowerCase().replace(/[^\\p{L}\\p{N}]+/gu, '-').replace(/^-|-$/g, '');\n  if (anchors?.has(loose)) return makeEdge(candidate, documentId);\n\n  if (isFiltered(candidate.target, splitAnchor(candidate.target).target, options)) return null;\n\n  const candidates = [...(nodes.keys() as Iterable<string>)].filter(\n    (id) => id.startsWith(`${documentId}#`) && id.toLowerCase().includes(loose),\n  );\n  return {\n    kind: candidate.kind,\n    from: candidate.from,\n    target: candidate.target,\n    reason: 'unknown-anchor',\n    origin: candidate.origin,\n    declaredAt: candidate.declaredAt,\n    raw: candidate.raw,\n    candidates,\n  };\n}\n\nfunction makeEdge(candidate: ReferenceCandidate, resolved: string): Edge {\n  const from = candidate.inverted ? resolved : candidate.from;\n  const to = candidate.inverted ? candidate.from : resolved;\n  return {\n    kind: candidate.kind,\n    from,\n    to,\n    origin: candidate.origin,\n    declaredAt: candidate.declaredAt,\n    raw: candidate.raw,\n    declaredIn: [candidate.declaredAt.file],\n    reflexive: documentOf(from) === documentOf(to),\n  };\n}\n\nfunction dangle(\n  candidate: ReferenceCandidate,\n  reason: DanglingRef['reason'],\n  candidates: readonly string[],\n): DanglingRef {\n  return {\n    kind: candidate.kind,\n    from: candidate.from,\n    target: candidate.target,\n    reason,\n    origin: candidate.origin,\n    declaredAt: candidate.declaredAt,\n    raw: candidate.raw,\n    candidates,\n  };\n}\n\n/** The document part of a node id: `ADR-7#q.1` -> `ADR-7`. */\nexport function documentOf(nodeId: string): string {\n  const hash = nodeId.indexOf('#');\n  return hash === -1 ? nodeId : nodeId.slice(0, hash);\n}\n"]}

package/dist/rules.d.ts

@@ -0,0 +1,61 @@
+/**
+ * The built-in diagnostics.
+ *
+ * Two of them - the two the whole project exists for - are written as selector
+ * queries rather than as bespoke traversals. That is not a stunt: it is the
+ * proof that the query language is expressive enough to be worth exposing. A
+ * team whose convention spec-graph never anticipated can write the equivalent
+ * of a built-in rule on the command line.
+ *
+ * ```text
+ * ghost-handover  *[openness!=closed][phase!=retired] -delegates-to,blocked-by-> *[receptivity=sealed]
+ * stale-premise   *[phase!=retired] -depends-on,assumes,amends,blocked-by-> document[phase=retired]
+ * ```
+ *
+ * The rest are not path queries and are not pretended to be: dangling
+ * references never became edges, and a cycle is not a fixed-length path.
+ *
+ * Every rule here obeys one discipline - **report the place a human can fix**.
+ * For a supersession that the superseded document never acknowledged, that is
+ * the superseded document, not the one that declared the relation.
+ */
+import { type SpecGraph } from './graph.js';
+import type { ResolvedCorpus } from './resolve.js';
+import type { Diagnostic, RuleId, Severity } from './types.js';
+export declare const DEFAULT_SEVERITIES: Readonly<Record<RuleId, Severity>>;
+export declare const RULE_IDS: readonly RuleId[];
+/** One-line descriptions, printed by `spec-graph rules`. */
+export declare const RULE_DESCRIPTIONS: Readonly<Record<RuleId, string>>;
+/**
+ * The severity map `--strict` implies, and which rules it actually moved.
+ *
+ * Strict raises `warn` to `error` and leaves `info` alone. That asymmetry is
+ * deliberate: the `info` rules are advisory by nature - a self-link in a table
+ * of contents is a formatting quirk - and promoting them would resurrect
+ * precisely the false-positive problem ADR-0006 exists to prevent.
+ *
+ * An explicit `--rule` always wins over strict, so `--strict --rule x=warn`
+ * keeps `x` at warn. That is what makes strict usable: a team can turn it on
+ * and exempt the one rule their repository disagrees with, rather than choosing
+ * between all of it and none of it.
+ */
+export declare function resolveStrict(overrides?: Partial<Record<RuleId, Severity>>, strict?: boolean): {
+    severities: Partial<Record<RuleId, Severity>>;
+    escalated: ReadonlySet<RuleId>;
+};
+export interface RuleOptions {
+    readonly severities?: Partial<Record<RuleId, Severity>> | undefined;
+    /** Cap on related locations attached to one finding. */
+    readonly maxRelated?: number | undefined;
+}
+/** Runs every enabled rule and returns findings in report order. */
+export declare function runRules(graph: SpecGraph, corpus: ResolvedCorpus, options?: RuleOptions): Diagnostic[];
+/**
+ * Total ordering, so two runs on the same corpus produce byte-identical output.
+ *
+ * CI output that reorders between runs cannot be diffed, and output that cannot
+ * be diffed stops being read.
+ */
+export declare function sortDiagnostics(diagnostics: readonly Diagnostic[]): Diagnostic[];
+/** The selector equivalent of a rule, for `spec-graph rules --explain`. */
+export declare const RULE_QUERIES: Readonly<Partial<Record<RuleId, string>>>;