@descent-vtt/spec-graph 0.2.2 → 0.3.0

package/dist/resolve.js.map

@@ -1 +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,6EAA6E;QAC7E,6EAA6E;QAC7E,2EAA2E;QAC3E,oEAAoE;QACpE,4EAA4E;QAC5E,yEAAyE;QACzE,4EAA4E;QAC5E,2EAA2E;QAC3E,6BAA6B;QAC7B,IAAI,KAAK,CAAC,WAAW,KAAK,IAAI,EAAE,CAAC;YAC/B,KAAK,MAAM,IAAI,IAAI,QAAQ,CAAC,KAAK,CAAC,QAAQ,CAAC,IAAI,CAAC;gBAAE,KAAK,CAAC,MAAM,CAAC,GAAG,CAAC,IAAI,EAAE,EAAE,CAAC,CAAC;QAC/E,CAAC;QAED,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    // Only a file answers to its path. A region keeps the path on its node, so a\n    // finding can say where it lives and `document[path=...]` can select it, but\n    // it must not be reachable *by* that path: two nodes answering to one path\n    // makes every link to the file ambiguous, and this index resolves a\n    // collision by keeping whichever was written last. A link to a file holding\n    // a register bound to its final row, quietly and with no diagnostic, and\n    // anchors were then checked against that row's span rather than the file's.\n    // ADR-0009 said a region does not claim the file's path; this is the index\n    // where that had to be true.\n    if (entry.containerId === null) {\n      for (const path of pathKeys(entry.document.path)) index.byPath.set(path, id);\n    }\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"]}
+{"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;AA4DtE,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;IACpC,MAAM,WAAW,GAAiB,EAAE,CAAC;IAErC,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;QACjC,WAAW,CAAC,IAAI,CAAC,GAAG,KAAK,CAAC,WAAW,CAAC,CAAC;IACzC,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,WAAW,EAAE,CAAC;AAC7E,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,WAAW,EAAE,IAAI,GAAG,EAAE;QACtB,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,6EAA6E;QAC7E,6EAA6E;QAC7E,2EAA2E;QAC3E,oEAAoE;QACpE,4EAA4E;QAC5E,yEAAyE;QACzE,4EAA4E;QAC5E,2EAA2E;QAC3E,6BAA6B;QAC7B,IAAI,KAAK,CAAC,WAAW,KAAK,IAAI,EAAE,CAAC;YAC/B,KAAK,CAAC,MAAM,CAAC,GAAG,CAAC,KAAK,CAAC,QAAQ,CAAC,IAAI,CAAC,WAAW,EAAE,EAAE,EAAE,CAAC,CAAC;YACxD,KAAK,MAAM,QAAQ,IAAI,WAAW,CAAC,KAAK,CAAC,QAAQ,CAAC,IAAI,CAAC,EAAE,CAAC;gBACxD,MAAM,GAAG,GAAG,KAAK,CAAC,WAAW,CAAC,GAAG,CAAC,QAAQ,CAAC,IAAI,IAAI,GAAG,EAAU,CAAC;gBACjE,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;gBACZ,KAAK,CAAC,WAAW,CAAC,GAAG,CAAC,QAAQ,EAAE,GAAG,CAAC,CAAC;YACvC,CAAC;QACH,CAAC;QAED,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,gFAAgF;AAChF,SAAS,WAAW,CAAC,IAAY;IAC/B,MAAM,IAAI,GAAG,IAAI,GAAG,EAAU,CAAC;IAC/B,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,uEAAuE;IACvE,6EAA6E;IAC7E,qCAAqC;IACrC,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,WAAW,EAAE,CAAC,CAAC;IAChC,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;;;;;;;;GAQG;AACH,SAAS,cAAc,CAAC,MAAc;IACpC,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,GAAG,CAAC;QAAE,OAAO,IAAI,CAAC;IACvC,IAAI,CAAC;QACH,MAAM,OAAO,GAAG,kBAAkB,CAAC,MAAM,CAAC,CAAC;QAC3C,OAAO,OAAO,KAAK,MAAM,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,OAAO,CAAC;IAC7C,CAAC;IAAC,MAAM,CAAC;QACP,OAAO,IAAI,CAAC;IACd,CAAC;AACH,CAAC;AAED,SAAS,MAAM,CAAC,MAAc,EAAE,KAAwB,EAAE,KAAY;IACpE,MAAM,KAAK,GAAG,WAAW,CAAC,MAAM,EAAE,KAAK,EAAE,KAAK,CAAC,CAAC;IAChD,IAAI,KAAK,CAAC,GAAG,CAAC,MAAM,GAAG,CAAC;QAAE,OAAO,KAAK,CAAC;IACvC,0EAA0E;IAC1E,+EAA+E;IAC/E,MAAM,OAAO,GAAG,cAAc,CAAC,MAAM,CAAC,CAAC;IACvC,OAAO,OAAO,KAAK,IAAI,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,WAAW,CAAC,OAAO,EAAE,KAAK,EAAE,KAAK,CAAC,CAAC;AACvE,CAAC;AAED,SAAS,WAAW,CAAC,MAAc,EAAE,KAAwB,EAAE,KAAY;IACzE,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,2EAA2E;QAC3E,YAAY;QACZ,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,yEAAyE;QACzE,yEAAyE;QACzE,+DAA+D;QAC/D,0EAA0E;QAC1E,yCAAyC;QACzC,MAAM,OAAO,GAAG,KAAK,CAAC,WAAW,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC;QAChD,IAAI,OAAO,IAAI,OAAO,CAAC,IAAI,GAAG,CAAC;YAAE,OAAO,EAAE,GAAG,EAAE,CAAC,GAAG,OAAO,CAAC,EAAE,IAAI,EAAE,EAAE,EAAE,CAAC;QACxE,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, MisreadKey, 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  readonly misreadKeys: readonly MisreadKey[];\n}\n\ninterface Index {\n  readonly byId: Map<string, string>;\n  readonly byAlias: Map<string, Set<string>>;\n  /** The literal path of a file. Unique: no two files share one. */\n  readonly byPath: Map<string, string>;\n  /**\n   * Spellings that address a file without naming it exactly - the extension\n   * dropped, a directory standing for its README. Several files can answer to\n   * one of those, so this is a set, exactly as `byAlias` is.\n   */\n  readonly byPathAlias: Map<string, Set<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  const misreadKeys: MisreadKey[] = [];\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    misreadKeys.push(...entry.misreadKeys);\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, misreadKeys };\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    byPathAlias: 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    // Only a file answers to its path. A region keeps the path on its node, so a\n    // finding can say where it lives and `document[path=...]` can select it, but\n    // it must not be reachable *by* that path: two nodes answering to one path\n    // makes every link to the file ambiguous, and this index resolves a\n    // collision by keeping whichever was written last. A link to a file holding\n    // a register bound to its final row, quietly and with no diagnostic, and\n    // anchors were then checked against that row's span rather than the file's.\n    // ADR-0009 said a region does not claim the file's path; this is the index\n    // where that had to be true.\n    if (entry.containerId === null) {\n      index.byPath.set(entry.document.path.toLowerCase(), id);\n      for (const spelling of pathAliases(entry.document.path)) {\n        const set = index.byPathAlias.get(spelling) ?? new Set<string>();\n        set.add(id);\n        index.byPathAlias.set(spelling, set);\n      }\n    }\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 addresses a file without naming it exactly. */\nfunction pathAliases(path: string): string[] {\n  const keys = new Set<string>();\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  // A file never addresses itself inexactly. Leaving this in would let a\n  // contrived name - `docs/a.md.md`, whose stem is another file's whole path -\n  // make an exact link look ambiguous.\n  keys.delete(path.toLowerCase());\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\n/**\n * The same path with its percent-escapes read.\n *\n * `[Design](docs/my%20design.md)` is what a renderer, a documentation site and\n * GitHub's own \"copy link\" all produce for a file with a space in its name, and\n * it names a real file. Returns `null` when there was nothing to decode or when\n * the escapes are malformed - `100%` in a path is not an escape sequence, and\n * `decodeURIComponent` throws on it.\n */\nfunction percentDecoded(target: string): string | null {\n  if (!target.includes('%')) return null;\n  try {\n    const decoded = decodeURIComponent(target);\n    return decoded === target ? null : decoded;\n  } catch {\n    return null;\n  }\n}\n\nfunction lookup(target: string, entry: ExtractedDocument, index: Index): Lookup {\n  const found = lookupExact(target, entry, index);\n  if (found.ids.length > 0) return found;\n  // Tried second and never first, so a repository holding a file whose name\n  // genuinely contains a percent escape keeps resolving by its written spelling.\n  const decoded = percentDecoded(target);\n  return decoded === null ? found : lookupExact(decoded, entry, index);\n}\n\nfunction lookupExact(target: string, entry: ExtractedDocument, index: Index): Lookup {\n  if (looksLikePath(target)) {\n    const resolved = resolveFrom(entry.document.path, target).toLowerCase();\n    // Naming the file exactly is never ambiguous, whatever else is spelled the\n    // same way.\n    const byPath = index.byPath.get(resolved);\n    if (byPath) return { ids: [byPath], near: [] };\n    // An inexact spelling can belong to more than one file: `docs/A` is both\n    // `docs/A.md` with its extension dropped and `docs/A/README.md` standing\n    // for its directory. Handing back every claimant makes that an\n    // ambiguous-reference the author can settle, rather than a silent pick of\n    // whichever happened to be indexed last.\n    const spelled = index.byPathAlias.get(resolved);\n    if (spelled && spelled.size > 0) return { ids: [...spelled], 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.js

@@ -38,6 +38,7 @@ export const DEFAULT_SEVERITIES = Object.freeze({
     'unreciprocated-supersession': 'warn',
     'state-conflict': 'warn',
     'self-reference': 'info',
+    'unknown-relation-key': 'warn',
 });
 export const RULE_IDS = Object.keys(DEFAULT_SEVERITIES);
 /** One-line descriptions, printed by `spec-graph rules`. */
@@ -53,6 +54,7 @@ export const RULE_DESCRIPTIONS = Object.freeze({
     'unreciprocated-supersession': 'a retired document does not say what replaced it',
     'state-conflict': 'an item declares two states that disagree about whether work remains',
     'self-reference': 'a document delegates to or depends on itself',
+    'unknown-relation-key': 'a front-matter key reads as a relation but declares none',
 });
 /**
  * The severity map `--strict` implies, and which rules it actually moved.
@@ -113,6 +115,7 @@ export function runRules(graph, corpus, options = {}) {
     orphanedObligations(graph, emit, maxRelated);
     supersessions(graph, emit);
     stateConflicts(graph, emit);
+    misreadKeys(corpus, emit);
     selfReferences(graph, emit);
     return sortDiagnostics(out);
 }
@@ -126,6 +129,10 @@ const REFERENCE_RULES = new Set([
     'broken-reference',
     'reference-outside-corpus',
     'ambiguous-reference',
+    // A key that declares no relation is a citation that did not happen, which a
+    // journal answers for as squarely as a link that goes nowhere. ADR-0011 keeps
+    // a record's obligations out of the report, not its references.
+    'unknown-relation-key',
 ]);
 /**
  * Whether a finding is about history rather than about work.
@@ -249,6 +256,29 @@ function stalePremises(graph, emit, claimed) {
 /* -------------------------------------------------------------------------- */
 /* Reference integrity                                                        */
 /* -------------------------------------------------------------------------- */
+/**
+ * Keys that read as relations and declared none.
+ *
+ * The only rule here that is about the text rather than about the graph, and it
+ * earns the place by what its absence costs: the finding is that an edge the
+ * author wrote down is *not* in the graph, and a missing edge is invisible in a
+ * report that says everything is consistent. Nothing else would ever mention it.
+ */
+function misreadKeys(corpus, emit) {
+    for (const misread of corpus.misreadKeys) {
+        emit('unknown-relation-key', () => ({
+            message: `"${misread.key}" declares no relation`,
+            at: misread.at,
+            nodes: [misread.from],
+            // The key, so two misspellings in one document are two findings rather
+            // than one with a count of two - `nodes` names the document and nothing
+            // else here names which key.
+            target: misread.key,
+            related: [],
+            hint: `spell it ${misread.suggestion}, or move it out of front matter if it is not a relation`,
+        }));
+    }
+}
 function brokenReferences(corpus, emit) {
     for (const ref of corpus.dangling) {
         if (ref.reason === 'ambiguous') {

package/dist/rules.js.map

@@ -1 +1 @@
-{"version":3,"file":"rules.js","sourceRoot":"","sources":["../src/rules.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;GAoBG;AAEH,OAAO,EAAE,gBAAgB,EAAkB,MAAM,YAAY,CAAC;AAC9D,OAAO,EAAE,YAAY,EAAE,WAAW,EAAE,MAAM,YAAY,CAAC;AACvD,OAAO,EAAE,OAAO,EAAE,UAAU,EAAkB,MAAM,aAAa,CAAC;AAclE,OAAO,EAAE,WAAW,EAAE,MAAM,YAAY,CAAC;AAEzC,gFAAgF;AAChF,gFAAgF;AAChF,gFAAgF;AAEhF,MAAM,CAAC,MAAM,kBAAkB,GAAuC,MAAM,CAAC,MAAM,CAAC;IAClF,gBAAgB,EAAE,OAAO;IACzB,eAAe,EAAE,OAAO;IACxB,kBAAkB,EAAE,OAAO;IAC3B,0BAA0B,EAAE,MAAM;IAClC,qBAAqB,EAAE,MAAM;IAC7B,qBAAqB,EAAE,OAAO;IAC9B,qBAAqB,EAAE,OAAO;IAC9B,mBAAmB,EAAE,OAAO;IAC5B,6BAA6B,EAAE,MAAM;IACrC,gBAAgB,EAAE,MAAM;IACxB,gBAAgB,EAAE,MAAM;CACzB,CAAC,CAAC;AAEH,MAAM,CAAC,MAAM,QAAQ,GAAG,MAAM,CAAC,IAAI,CAAC,kBAAkB,CAAsB,CAAC;AAE7E,4DAA4D;AAC5D,MAAM,CAAC,MAAM,iBAAiB,GAAqC,MAAM,CAAC,MAAM,CAAC;IAC/E,gBAAgB,EAAE,yEAAyE;IAC3F,eAAe,EAAE,uEAAuE;IACxF,kBAAkB,EAAE,2DAA2D;IAC/E,0BAA0B,EAAE,qEAAqE;IACjG,qBAAqB,EAAE,2CAA2C;IAClE,qBAAqB,EAAE,0EAA0E;IACjG,qBAAqB,EAAE,2DAA2D;IAClF,mBAAmB,EAAE,qEAAqE;IAC1F,6BAA6B,EAAE,kDAAkD;IACjF,gBAAgB,EAAE,sEAAsE;IACxF,gBAAgB,EAAE,8CAA8C;CACjE,CAAC,CAAC;AAEH;;;;;;;;;;;;GAYG;AACH,MAAM,UAAU,aAAa,CAC3B,SAAS,GAAsC,EAAE,EACjD,MAAM,GAAG,KAAK;IAEd,MAAM,UAAU,GAAsC,EAAE,GAAG,SAAS,EAAE,CAAC;IACvE,MAAM,SAAS,GAAG,IAAI,GAAG,EAAU,CAAC;IACpC,IAAI,CAAC,MAAM;QAAE,OAAO,EAAE,UAAU,EAAE,SAAS,EAAE,CAAC;IAE9C,KAAK,MAAM,EAAE,IAAI,QAAQ,EAAE,CAAC;QAC1B,IAAI,SAAS,CAAC,EAAE,CAAC,KAAK,SAAS;YAAE,SAAS;QAC1C,IAAI,kBAAkB,CAAC,EAAE,CAAC,KAAK,MAAM;YAAE,SAAS;QAChD,UAAU,CAAC,EAAE,CAAC,GAAG,OAAO,CAAC;QACzB,SAAS,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;IACpB,CAAC;IACD,OAAO,EAAE,UAAU,EAAE,SAAS,EAAE,CAAC;AACnC,CAAC;AAQD,MAAM,mBAAmB,GAAG,CAAC,CAAC;AAE9B,gFAAgF;AAChF,gFAAgF;AAChF,gFAAgF;AAEhF,oEAAoE;AACpE,MAAM,UAAU,QAAQ,CAAC,KAAgB,EAAE,MAAsB,EAAE,OAAO,GAAgB,EAAE;IAC1F,MAAM,UAAU,GAAG,EAAE,GAAG,kBAAkB,EAAE,GAAG,CAAC,OAAO,CAAC,UAAU,IAAI,EAAE,CAAC,EAAE,CAAC;IAC5E,MAAM,UAAU,GAAG,OAAO,CAAC,UAAU,IAAI,mBAAmB,CAAC;IAC7D,MAAM,GAAG,GAAiB,EAAE,CAAC;IAE7B,MAAM,IAAI,GAAG,CAAC,IAAY,EAAE,KAAkB,EAAQ,EAAE;QACtD,MAAM,QAAQ,GAAG,UAAU,CAAC,IAAI,CAAC,CAAC;QAClC,IAAI,QAAQ,KAAK,KAAK;YAAE,OAAO;QAC/B,MAAM,IAAI,GAAG,KAAK,EAAE,CAAC;QACrB,IAAI,MAAM,CAAC,KAAK,EAAE,IAAI,EAAE,IAAI,CAAC,KAAK,CAAC;YAAE,OAAO;QAC5C,6EAA6E;QAC7E,uDAAuD;QACvD,GAAG,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,QAAQ,EAAE,MAAM,EAAE,IAAI,EAAE,GAAG,IAAI,EAAE,OAAO,EAAE,IAAI,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC,EAAE,UAAU,CAAC,EAAE,CAAC,CAAC;IAClG,CAAC,CAAC;IAEF,oEAAoE;IACpE,+EAA+E;IAC/E,sEAAsE;IACtE,qEAAqE;IACrE,MAAM,OAAO,GAAG,cAAc,CAAC,KAAK,EAAE,IAAI,CAAC,CAAC;IAC5C,aAAa,CAAC,KAAK,EAAE,IAAI,EAAE,OAAO,CAAC,CAAC;IACpC,gBAAgB,CAAC,MAAM,EAAE,IAAI,CAAC,CAAC;IAC/B,mBAAmB,CAAC,KAAK,EAAE,IAAI,CAAC,CAAC;IACjC,mBAAmB,CAAC,KAAK,EAAE,IAAI,EAAE,UAAU,CAAC,CAAC;IAC7C,aAAa,CAAC,KAAK,EAAE,IAAI,CAAC,CAAC;IAC3B,cAAc,CAAC,KAAK,EAAE,IAAI,CAAC,CAAC;IAC5B,cAAc,CAAC,KAAK,EAAE,IAAI,CAAC,CAAC;IAE5B,OAAO,eAAe,CAAC,GAAG,CAAC,CAAC;AAC9B,CAAC;AAOD;;;;;GAKG;AACH,MAAM,eAAe,GAAwB,IAAI,GAAG,CAAS;IAC3D,kBAAkB;IAClB,0BAA0B;IAC1B,qBAAqB;CACtB,CAAC,CAAC;AAEH;;;;;;;;;;;;;GAaG;AACH,SAAS,MAAM,CAAC,KAAgB,EAAE,IAAY,EAAE,KAAwB;IACtE,IAAI,eAAe,CAAC,GAAG,CAAC,IAAI,CAAC;QAAE,OAAO,KAAK,CAAC;IAC5C,MAAM,OAAO,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC;IACzB,IAAI,OAAO,KAAK,SAAS;QAAE,OAAO,KAAK,CAAC;IACxC,OAAO,KAAK,CAAC,cAAc,CAAC,OAAO,CAAC,EAAE,KAAK,KAAK,QAAQ,CAAC;AAC3D,CAAC;AAED,gFAAgF;AAChF,gFAAgF;AAChF,gFAAgF;AAEhF;;;;;;GAMG;AACH,MAAM,cAAc,GAAc,UAAU,CAC1C,sFAAsF,CACvF,CAAC;AAEF,4EAA4E;AAC5E,SAAS,cAAc,CAAC,KAAgB,EAAE,IAAU;IAClD,MAAM,OAAO,GAAG,IAAI,GAAG,EAAU,CAAC;IAClC,KAAK,MAAM,KAAK,IAAI,OAAO,CAAC,KAAK,EAAE,cAAc,CAAC,EAAE,CAAC;QACnD,MAAM,MAAM,GAAG,KAAK,CAAC,KAAK,CAAC,CAAC,CAAa,CAAC;QAC1C,MAAM,MAAM,GAAG,KAAK,CAAC,KAAK,CAAC,CAAC,CAAa,CAAC;QAC1C,MAAM,IAAI,GAAG,KAAK,CAAC,KAAK,CAAC,CAAC,CAAS,CAAC;QACpC,MAAM,cAAc,GAAG,KAAK,CAAC,cAAc,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC;QACvD,IAAI,CAAC,cAAc;YAAE,SAAS;QAE9B,MAAM,MAAM,GAAG,WAAW,CAAC,cAAc,CAAC,KAAK,CAAC,IAAI,QAAQ,CAAC;QAC7D,MAAM,IAAI,GAAG,MAAM,CAAC,IAAI,KAAK,MAAM,CAAC,CAAC,CAAC,iBAAiB,CAAC,CAAC,CAAC,YAAY,CAAC;QACvE,MAAM,IAAI,GAAG,WAAW,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,MAAM,CAAC;QAC3C,OAAO,CAAC,GAAG,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC;QAE3B,IAAI,CAAC,gBAAgB,EAAE,GAAG,EAAE,CAAC,CAAC;YAC5B,OAAO,EAAE,GAAG,IAAI,IAAI,IAAI,IAAI,QAAQ,CAAC,MAAM,CAAC,cAAc,MAAM,EAAE;YAClE,EAAE,EAAE,IAAI,CAAC,UAAU;YACnB,KAAK,EAAE,CAAC,MAAM,CAAC,EAAE,EAAE,MAAM,CAAC,EAAE,CAAC;YAC7B,OAAO,EAAE;gBACP,OAAO,CAAC,cAAc,CAAC,QAAQ,IAAI,cAAc,CAAC,EAAE,EAAE,GAAG,cAAc,CAAC,EAAE,OAAO,MAAM,GAAG,YAAY,CAAC,cAAc,CAAC,EAAE,CAAC;gBACzH,GAAG,CAAC,MAAM,CAAC,IAAI,KAAK,MAAM,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,MAAM,CAAC,EAAE,EAAE,mBAAmB,MAAM,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;aAC1F;YACD,IAAI,EAAE,aAAa,CAAC,cAAc,CAAC,KAAK,CAAC,EAAE,CAAC,cAAc,CAAC,EAAE,CAAC,IAAI,WAAW,CAAC,cAAc,CAAC,EAAE,CAAC;SACjG,CAAC,CAAC,CAAC;IACN,CAAC;IACD,OAAO,OAAO,CAAC;AACjB,CAAC;AAED,oEAAoE;AACpE,MAAM,WAAW,GAA8C;IAC7D,OAAO,EAAE,SAAS;IAClB,MAAM,EAAE,qBAAqB;CAC9B,CAAC;AAEF,MAAM,WAAW,GAAG,CAAC,EAAU,EAAU,EAAE,CACzC,GAAG,EAAE,gFAAgF,CAAC;AAExF,sEAAsE;AACtE,MAAM,aAAa,GAA8D;IAC/E,OAAO,EAAE,CAAC,EAAE,EAAE,EAAE,CAAC,6BAA6B,EAAE,4DAA4D;IAC5G,MAAM,EAAE,CAAC,EAAE,EAAE,EAAE,CAAC,GAAG,EAAE,iFAAiF;CACvG,CAAC;AAEF,0EAA0E;AAC1E,SAAS,OAAO,CAAC,IAAU;IACzB,OAAO,GAAG,IAAI,CAAC,IAAI,IAAI,IAAI,CAAC,IAAI,IAAI,IAAI,CAAC,EAAE,EAAE,CAAC;AAChD,CAAC;AAED,gFAAgF;AAChF,gFAAgF;AAChF,gFAAgF;AAEhF;;;;;;GAMG;AACH,MAAM,sBAAsB,GAAc,UAAU,CAClD,mFAAmF,CACpF,CAAC;AACF,MAAM,kBAAkB,GAAc,UAAU,CAC9C,gFAAgF,CACjF,CAAC;AAEF,SAAS,aAAa,CAAC,KAAgB,EAAE,IAAU,EAAE,OAA4B;IAC/E,MAAM,IAAI,GAAG,IAAI,GAAG,EAAU,CAAC;IAC/B,KAAK,MAAM,IAAI,IAAI,CAAC,sBAAsB,EAAE,kBAAkB,CAAC,EAAE,CAAC;QAChE,KAAK,MAAM,KAAK,IAAI,OAAO,CAAC,KAAK,EAAE,IAAI,CAAC,EAAE,CAAC;YACzC,MAAM,MAAM,GAAG,KAAK,CAAC,KAAK,CAAC,CAAC,CAAa,CAAC;YAC1C,MAAM,MAAM,GAAG,KAAK,CAAC,KAAK,CAAC,CAAC,CAAa,CAAC;YAC1C,MAAM,IAAI,GAAG,KAAK,CAAC,KAAK,CAAC,CAAC,CAAS,CAAC;YACpC,yEAAyE;YACzE,0BAA0B;YAC1B,IAAI,OAAO,CAAC,GAAG,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC;gBAAE,SAAS;YACzC,MAAM,GAAG,GAAG,GAAG,MAAM,CAAC,EAAE,IAAI,MAAM,CAAC,EAAE,IAAI,IAAI,CAAC,IAAI,EAAE,CAAC;YACrD,IAAI,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC;gBAAE,SAAS;YAC5B,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;YAEd,MAAM,cAAc,GAAG,KAAK,CAAC,cAAc,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC;YACvD,MAAM,OAAO,GACX,MAAM,CAAC,IAAI,KAAK,MAAM;gBACpB,CAAC,CAAC,0DAA0D;gBAC5D,CAAC,CAAC,GAAG,MAAM,CAAC,EAAE,cAAc,YAAY,CAAC,cAAc,CAAC,EAAE,CAAC;YAE/D,IAAI,CAAC,eAAe,EAAE,GAAG,EAAE,CAAC,CAAC;gBAC3B,OAAO,EAAE,GAAG,QAAQ,CAAC,MAAM,CAAC,IAAI,WAAW,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,MAAM,IAAI,QAAQ,CAAC,MAAM,CAAC,yBAAyB;gBAC1G,EAAE,EAAE,IAAI,CAAC,UAAU;gBACnB,KAAK,EAAE,CAAC,MAAM,CAAC,EAAE,EAAE,MAAM,CAAC,EAAE,CAAC;gBAC7B,wEAAwE;gBACxE,mEAAmE;gBACnE,8BAA8B;gBAC9B,OAAO,EAAE,CAAC,OAAO,CAAC,MAAM,CAAC,IAAI,KAAK,UAAU,CAAC,CAAC,CAAC,CAAC,cAAc,EAAE,QAAQ,IAAI,MAAM,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,EAAE,EAAE,OAAO,CAAC,CAAC;gBAC7G,IAAI,EAAE,iFAAiF,MAAM,CAAC,IAAI,KAAK,MAAM,CAAC,CAAC,CAAC,qBAAqB,CAAC,CAAC,CAAC,GAAG,MAAM,CAAC,EAAE,cAAc,EAAE;aACrK,CAAC,CAAC,CAAC;QACN,CAAC;IACH,CAAC;AACH,CAAC;AAED,gFAAgF;AAChF,gFAAgF;AAChF,gFAAgF;AAEhF,SAAS,gBAAgB,CAAC,MAAsB,EAAE,IAAU;IAC1D,KAAK,MAAM,GAAG,IAAI,MAAM,CAAC,QAAQ,EAAE,CAAC;QAClC,IAAI,GAAG,CAAC,MAAM,KAAK,WAAW,EAAE,CAAC;YAC/B,IAAI,CAAC,qBAAqB,EAAE,GAAG,EAAE,CAAC,CAAC;gBACjC,OAAO,EAAE,IAAI,GAAG,CAAC,MAAM,aAAa,GAAG,CAAC,UAAU,CAAC,MAAM,YAAY;gBACrE,EAAE,EAAE,GAAG,CAAC,UAAU;gBAClB,KAAK,EAAE,CAAC,GAAG,CAAC,IAAI,CAAC;gBACjB,MAAM,EAAE,GAAG,CAAC,MAAM;gBAClB,OAAO,EAAE,EAAE;gBACX,IAAI,EAAE,iCAAiC,GAAG,CAAC,UAAU,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE;aACnE,CAAC,CAAC,CAAC;YACJ,SAAS;QACX,CAAC;QAED,uEAAuE;QACvE,6EAA6E;QAC7E,4EAA4E;QAC5E,2EAA2E;QAC3E,kBAAkB;QAClB,MAAM,IAAI,GAAW,GAAG,CAAC,MAAM,KAAK,YAAY,CAAC,CAAC,CAAC,0BAA0B,CAAC,CAAC,CAAC,kBAAkB,CAAC;QAEnG,IAAI,CAAC,IAAI,EAAE,GAAG,EAAE,CAAC,CAAC;YAChB,OAAO,EAAE,aAAa,CAAC,GAAG,CAAC;YAC3B,EAAE,EAAE,GAAG,CAAC,UAAU;YAClB,KAAK,EAAE,CAAC,GAAG,CAAC,IAAI,CAAC;YACjB,MAAM,EAAE,GAAG,CAAC,MAAM;YAClB,OAAO,EAAE,EAAE;YACX,IAAI,EAAE,UAAU,CAAC,GAAG,CAAC;SACtB,CAAC,CAAC,CAAC;IACN,CAAC;AACH,CAAC;AAED,SAAS,aAAa,CAAC,GAAgB;IACrC,QAAQ,GAAG,CAAC,MAAM,EAAE,CAAC;QACnB,KAAK,gBAAgB;YACnB,OAAO,IAAI,GAAG,CAAC,MAAM,2CAA2C,CAAC;QACnE,KAAK,YAAY;YACf,OAAO,IAAI,GAAG,CAAC,MAAM,kDAAkD,CAAC;QAC1E;YACE,OAAO,IAAI,GAAG,CAAC,MAAM,oCAAoC,CAAC;IAC9D,CAAC;AACH,CAAC;AAED,SAAS,UAAU,CAAC,GAAgB;IAClC,IAAI,GAAG,CAAC,UAAU,CAAC,MAAM,GAAG,CAAC;QAAE,OAAO,gBAAgB,GAAG,CAAC,UAAU,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC;IAC/F,8EAA8E;IAC9E,4EAA4E;IAC5E,oDAAoD;IACpD,IAAI,GAAG,CAAC,GAAG,CAAC,UAAU,CAAC,IAAI,CAAC,IAAI,GAAG,CAAC,MAAM,KAAK,gBAAgB,EAAE,CAAC;QAChE,OAAO,uFAAuF,oBAAoB,CAAC,GAAG,CAAC,MAAM,CAAC,GAAG,CAAC;IACpI,CAAC;IACD,QAAQ,GAAG,CAAC,MAAM,EAAE,CAAC;QACnB,KAAK,gBAAgB;YACnB,OAAO,qDAAqD,CAAC;QAC/D,KAAK,YAAY;YACf,0EAA0E;YAC1E,iEAAiE;YACjE,OAAO,wCAAwC,cAAc,CAAC,GAAG,CAAC,GAAG,CAAC;QACxE;YACE,OAAO,kDAAkD,CAAC;IAC9D,CAAC;AACH,CAAC;AAED;;;;;;GAMG;AACH,SAAS,oBAAoB,CAAC,MAAc;IAC1C,MAAM,OAAO,GAAG,MAAM,CAAC,IAAI,EAAE,CAAC;IAC9B,MAAM,MAAM,GAAG,oBAAoB,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;IAClD,MAAM,IAAI,GAAG,MAAM,EAAE,CAAC,CAAC,CAAC,EAAE,IAAI,EAAE,CAAC;IACjC,OAAO,IAAI,KAAK,SAAS,IAAI,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,IAAI,IAAI,CAAC,CAAC,CAAC,OAAO,CAAC;AACvE,CAAC;AAED;;;;;;GAMG;AACH,SAAS,cAAc,CAAC,GAAgB;IACtC,MAAM,aAAa,GAAG,CAAC,GAAG,CAAC,MAAM,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,IAAI,GAAG,CAAC,MAAM,CAAC,CAAC,IAAI,EAAE,CAAC;IACtE,MAAM,QAAQ,GAAG,WAAW,CAAC,GAAG,CAAC,UAAU,CAAC,IAAI,EAAE,aAAa,CAAC,CAAC;IACjE,MAAM,SAAS,GAAG,YAAY,CAAC,QAAQ,CAAC,CAAC;IACzC,OAAO,SAAS,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,SAAS,UAAU,CAAC,CAAC,CAAC,SAAS,CAAC;AACnE,CAAC;AAED,gFAAgF;AAChF,gFAAgF;AAChF,gFAAgF;AAEhF,SAAS,mBAAmB,CAAC,KAAgB,EAAE,IAAU;IACvD,MAAM,KAAK,GAAG,CAAC,GAAG,gBAAgB,EAAE,YAAqB,CAAC,CAAC;IAC3D,4EAA4E;IAC5E,6EAA6E;IAC7E,gDAAgD;IAChD,KAAK,MAAM,SAAS,IAAI,KAAK,CAAC,MAAM,CAAC,KAAK,EAAE,EAAE,UAAU,EAAE,IAAI,EAAE,CAAC,EAAE,CAAC;QAClE,MAAM,OAAO,GAAG,SAAS;aACtB,GAAG,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,KAAK,CAAC,QAAQ,CAAC,EAAE,CAAC,CAAC;aAC/B,MAAM,CAAC,CAAC,IAAI,EAAwB,EAAE,CAAC,IAAI,KAAK,SAAS,CAAC,CAAC;QAC9D,IAAI,OAAO,CAAC,MAAM,GAAG,CAAC;YAAE,SAAS;QACjC,6EAA6E;QAC7E,4EAA4E;QAC5E,8CAA8C;QAC9C,IAAI,OAAO,CAAC,IAAI,CAAC,CAAC,MAAM,EAAE,EAAE,CAAC,MAAM,CAAC,KAAK,KAAK,QAAQ,CAAC;YAAE,SAAS;QAElE,MAAM,KAAK,GAAG,UAAU,CAAC,KAAK,EAAE,SAAS,EAAE,KAAK,CAAC,CAAC;QAClD,MAAM,gBAAgB,GAAG,KAAK,CAAC,MAAM,GAAG,CAAC,IAAI,KAAK,CAAC,KAAK,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,CAAC,IAAI,KAAK,YAAY,CAAC,CAAC;QAC/F,MAAM,IAAI,GAAG,OAAO,CAAC,CAAC,CAAiB,CAAC;QAExC,IAAI,CAAC,qBAAqB,EAAE,GAAG,EAAE,CAAC,CAAC;YACjC,OAAO,EAAE,gBAAgB;gBACvB,CAAC,CAAC,6BAA6B,OAAO,CAAC,MAAM,YAAY;gBACzD,CAAC,CAAC,2BAA2B,OAAO,CAAC,MAAM,yCAAyC;YACtF,EAAE,EAAE,KAAK,CAAC,CAAC,CAAC,EAAE,UAAU,IAAI,IAAI,CAAC,EAAE;YACnC,KAAK,EAAE,SAAS;YAChB,OAAO,EAAE,KAAK,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,OAAO,CAAC,IAAI,CAAC,UAAU,EAAE,GAAG,IAAI,CAAC,IAAI,IAAI,WAAW,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,MAAM,IAAI,IAAI,CAAC,EAAE,EAAE,CAAC,CAAC;YAClH,IAAI,EAAE,uEAAuE;SAC9E,CAAC,CAAC,CAAC;IACN,CAAC;AACH,CAAC;AAED;;;;;;GAMG;AACH,SAAS,UAAU,CAAC,KAAgB,EAAE,SAA4B,EAAE,KAA8B;IAChG,MAAM,MAAM,GAAG,IAAI,GAAG,CAAC,SAAS,CAAC,CAAC;IAClC,MAAM,KAAK,GAAG,CAAC,EAAU,EAAU,EAAE,CAAC,KAAK,CAAC,cAAc,CAAC,EAAE,CAAC,EAAE,EAAE,IAAI,EAAE,CAAC;IACzE,MAAM,GAAG,GAAW,EAAE,CAAC;IACvB,KAAK,MAAM,IAAI,IAAI,KAAK,CAAC,KAAK,EAAE,CAAC;QAC/B,IAAI,CAAC,KAAK,CAAC,QAAQ,CAAC,IAAI,CAAC,IAAI,CAAC;YAAE,SAAS;QACzC,MAAM,IAAI,GAAG,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAC9B,MAAM,EAAE,GAAG,KAAK,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;QAC1B,IAAI,IAAI,KAAK,EAAE,IAAI,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,MAAM,CAAC,GAAG,CAAC,EAAE,CAAC;YAAE,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IACxE,CAAC;IACD,OAAO,GAAG,CAAC;AACb,CAAC;AAED,gFAAgF;AAChF,gFAAgF;AAChF,gFAAgF;AAEhF;;;;;;GAMG;AACH,SAAS,mBAAmB,CAAC,KAAgB,EAAE,IAAU,EAAE,UAAkB;IAC3E,KAAK,MAAM,QAAQ,IAAI,KAAK,CAAC,SAAS,EAAE,CAAC;QACvC,IAAI,QAAQ,CAAC,KAAK,KAAK,SAAS,IAAI,QAAQ,CAAC,KAAK,KAAK,QAAQ;YAAE,SAAS;QAC1E,MAAM,IAAI,GAAG,KAAK,CAAC,OAAO,CAAC,QAAQ,CAAC,EAAE,CAAC,CAAC,MAAM,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,CAAC,QAAQ,KAAK,QAAQ,CAAC,CAAC;QACrF,IAAI,IAAI,CAAC,MAAM,KAAK,CAAC;YAAE,SAAS;QAEhC,MAAM,MAAM,GAAG,QAAQ,CAAC,KAAK,KAAK,SAAS,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,QAAQ,CAAC;QACnE,IAAI,CAAC,qBAAqB,EAAE,GAAG,EAAE,CAAC,CAAC;YACjC,OAAO,EAAE,GAAG,MAAM,yBAAyB,IAAI,CAAC,MAAM,SAAS,IAAI,CAAC,MAAM,KAAK,CAAC,CAAC,CAAC,CAAC,YAAY,CAAC,CAAC,CAAC,aAAa,EAAE;YACjH,EAAE,EAAE,QAAQ,CAAC,QAAQ,IAAI,QAAQ,CAAC,EAAE;YACpC,KAAK,EAAE,CAAC,QAAQ,CAAC,EAAE,EAAE,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;YACpD,OAAO,EAAE,IAAI;iBACV,KAAK,CAAC,CAAC,EAAE,UAAU,CAAC;iBACpB,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,OAAO,CAAC,IAAI,CAAC,EAAE,EAAE,GAAG,IAAI,CAAC,WAAW,KAAK,IAAI,CAAC,IAAI,EAAE,CAAC,CAAC;YACvE,IAAI,EAAE,gEAAgE,IAAI,CAAC,MAAM,KAAK,CAAC,CAAC,CAAC,CAAC,eAAe,CAAC,CAAC,CAAC,gBAAgB,SAAS,QAAQ,CAAC,EAAE,EAAE;SACnJ,CAAC,CAAC,CAAC;IACN,CAAC;AACH,CAAC;AAED,gFAAgF;AAChF,gFAAgF;AAChF,gFAAgF;AAEhF,SAAS,aAAa,CAAC,KAAgB,EAAE,IAAU;IACjD,KAAK,MAAM,IAAI,IAAI,KAAK,CAAC,KAAK,EAAE,CAAC;QAC/B,IAAI,IAAI,CAAC,IAAI,KAAK,YAAY,IAAI,IAAI,CAAC,SAAS;YAAE,SAAS;QAC3D,MAAM,UAAU,GAAG,KAAK,CAAC,QAAQ,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;QAC3C,MAAM,WAAW,GAAG,KAAK,CAAC,QAAQ,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAC9C,IAAI,CAAC,UAAU,IAAI,CAAC,WAAW;YAAE,SAAS;QAC1C,iEAAiE;QACjE,yEAAyE;QACzE,yEAAyE;QACzE,yEAAyE;QACzE,oEAAoE;QACpE,IAAI,WAAW,CAAC,KAAK,KAAK,QAAQ;YAAE,SAAS;QAE7C,IAAI,UAAU,CAAC,KAAK,KAAK,SAAS,IAAI,UAAU,CAAC,KAAK,KAAK,SAAS,EAAE,CAAC;YACrE,IAAI,CAAC,mBAAmB,EAAE,GAAG,EAAE,CAAC,CAAC;gBAC/B,mEAAmE;gBACnE,4DAA4D;gBAC5D,OAAO,EAAE,GAAG,UAAU,CAAC,EAAE,qBAAqB,WAAW,CAAC,EAAE,uBAAuB,UAAU,CAAC,KAAK,EAAE;gBACrG,EAAE,EAAE,UAAU,CAAC,QAAQ,IAAI,UAAU,CAAC,EAAE;gBACxC,KAAK,EAAE,CAAC,UAAU,CAAC,EAAE,EAAE,WAAW,CAAC,EAAE,CAAC;gBACtC,OAAO,EAAE,CAAC,OAAO,CAAC,IAAI,CAAC,UAAU,EAAE,mCAAmC,CAAC,CAAC;gBACxE,IAAI,EAAE,QAAQ,UAAU,CAAC,EAAE,wCAAwC,WAAW,CAAC,EAAE,EAAE;aACpF,CAAC,CAAC,CAAC;YACJ,SAAS;QACX,CAAC;QAED,IAAI,UAAU,CAAC,KAAK,KAAK,SAAS,IAAI,CAAC,IAAI,CAAC,UAAU,CAAC,QAAQ,CAAC,UAAU,CAAC,IAAI,CAAC,EAAE,CAAC;YACjF,IAAI,CAAC,6BAA6B,EAAE,GAAG,EAAE,CAAC,CAAC;gBACzC,OAAO,EAAE,GAAG,UAAU,CAAC,EAAE,mCAAmC,WAAW,CAAC,EAAE,cAAc;gBACxF,EAAE,EAAE,UAAU,CAAC,QAAQ,IAAI,UAAU,CAAC,EAAE;gBACxC,KAAK,EAAE,CAAC,UAAU,CAAC,EAAE,EAAE,WAAW,CAAC,EAAE,CAAC;gBACtC,OAAO,EAAE,CAAC,OAAO,CAAC,IAAI,CAAC,UAAU,EAAE,QAAQ,WAAW,CAAC,EAAE,2BAA2B,CAAC,CAAC;gBACtF,IAAI,EAAE,uBAAuB,WAAW,CAAC,EAAE,QAAQ,UAAU,CAAC,IAAI,4CAA4C;aAC/G,CAAC,CAAC,CAAC;QACN,CAAC;IACH,CAAC;AACH,CAAC;AAED,gFAAgF;AAChF,gFAAgF;AAChF,gFAAgF;AAEhF,SAAS,cAAc,CAAC,KAAgB,EAAE,IAAU;IAClD,KAAK,MAAM,IAAI,IAAI,KAAK,CAAC,KAAK,EAAE,CAAC;QAC/B,IAAI,IAAI,CAAC,SAAS,CAAC,MAAM,KAAK,CAAC;YAAE,SAAS;QAC1C,IAAI,CAAC,gBAAgB,EAAE,GAAG,EAAE,CAAC,CAAC;YAC5B,OAAO,EAAE,iBAAiB,IAAI,CAAC,WAAW,qBAAqB,eAAe,CAAC,IAAI,CAAC,EAAE;YACtF,EAAE,EAAE,IAAI,CAAC,QAAQ,CAAC,EAAE;YACpB,KAAK,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC;YAChB,OAAO,EAAE,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,CAAC,MAAM,EAAE,EAAE,CACrC,OAAO,CAAC,MAAM,CAAC,EAAE,EAAE,GAAG,MAAM,CAAC,MAAM,SAAS,MAAM,CAAC,WAAW,GAAG,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,KAAK,MAAM,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CACxG;YACD,IAAI,EAAE,qDAAqD,IAAI,CAAC,QAAQ,EAAE;SAC3E,CAAC,CAAC,CAAC;IACN,CAAC;AACH,CAAC;AAED,SAAS,eAAe,CAAC,IAAc;IACrC,MAAM,KAAK,GAAG,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,CAAC,MAAM,EAAE,EAAE,CAAC,KAAK,MAAM,CAAC,MAAM,WAAW,MAAM,CAAC,WAAW,EAAE,CAAC,CAAC;IAChG,OAAO,KAAK,CAAC,MAAM,KAAK,CAAC,CAAC,CAAC,CAAE,KAAK,CAAC,CAAC,CAAY,CAAC,CAAC,CAAC,GAAG,KAAK,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,QAAQ,KAAK,CAAC,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC,EAAE,CAAC;AACvH,CAAC;AAED,gFAAgF;AAChF,gFAAgF;AAChF,gFAAgF;AAEhF;;;;;;GAMG;AACH,SAAS,cAAc,CAAC,KAAgB,EAAE,IAAU;IAClD,KAAK,MAAM,IAAI,IAAI,KAAK,CAAC,KAAK,EAAE,CAAC;QAC/B,IAAI,CAAC,IAAI,CAAC,SAAS,IAAI,IAAI,CAAC,IAAI,KAAK,UAAU;YAAE,SAAS;QAC1D,MAAM,MAAM,GAAG,WAAW,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACtC,IAAI,CAAC,MAAM,CAAC,mBAAmB,IAAI,CAAC,MAAM,CAAC,WAAW;YAAE,SAAS;QACjE,MAAM,IAAI,GAAG,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACnC,IAAI,CAAC,IAAI;YAAE,SAAS;QAEpB,IAAI,CAAC,gBAAgB,EAAE,GAAG,EAAE,CAAC,CAAC;YAC5B,OAAO,EAAE,GAAG,QAAQ,CAAC,IAAI,CAAC,IAAI,MAAM,CAAC,MAAM,SAAS;YACpD,EAAE,EAAE,IAAI,CAAC,UAAU;YACnB,KAAK,EAAE,CAAC,IAAI,CAAC,IAAI,CAAC;YAClB,OAAO,EAAE,EAAE;YACX,IAAI,EAAE,MAAM,CAAC,mBAAmB;gBAC9B,CAAC,CAAC,+FAA+F;gBACjG,CAAC,CAAC,sEAAsE;SAC3E,CAAC,CAAC,CAAC;IACN,CAAC;AACH,CAAC;AAED,gFAAgF;AAChF,gFAAgF;AAChF,gFAAgF;AAEhF,SAAS,QAAQ,CAAC,IAAc;IAC9B,OAAO,IAAI,CAAC,IAAI,KAAK,UAAU,CAAC,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,QAAQ,KAAK,QAAQ,CAAC,IAAI,CAAC,IAAI,EAAE,EAAE,CAAC,GAAG,CAAC;AAC9F,CAAC;AAED,SAAS,QAAQ,CAAC,IAAY,EAAE,KAAa;IAC3C,OAAO,IAAI,CAAC,MAAM,IAAI,KAAK,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,EAAE,KAAK,GAAG,CAAC,CAAC,KAAK,CAAC;AACxE,CAAC;AAED,SAAS,YAAY,CAAC,QAAkC;IACtD,OAAO,QAAQ,EAAE,SAAS,CAAC,CAAC,CAAC,MAAM,QAAQ,CAAC,SAAS,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC;AACjE,CAAC;AAED,SAAS,OAAO,CAAC,EAAa,EAAE,IAAY;IAC1C,OAAO,EAAE,EAAE,EAAE,IAAI,EAAE,CAAC;AACtB,CAAC;AAED,MAAM,cAAc,GAAuD,EAAE,KAAK,EAAE,CAAC,EAAE,IAAI,EAAE,CAAC,EAAE,IAAI,EAAE,CAAC,EAAE,CAAC;AAE1G;;;;;GAKG;AACH,MAAM,UAAU,eAAe,CAAC,WAAkC;IAChE,OAAO,CAAC,GAAG,WAAW,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE;QACpC,MAAM,UAAU,GAAG,cAAc,CAAC,CAAC,CAAC,QAAQ,CAAC,GAAG,cAAc,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC;QAC3E,IAAI,UAAU,KAAK,CAAC;YAAE,OAAO,UAAU,CAAC;QACxC,IAAI,CAAC,CAAC,EAAE,CAAC,IAAI,KAAK,CAAC,CAAC,EAAE,CAAC,IAAI;YAAE,OAAO,CAAC,CAAC,EAAE,CAAC,IAAI,GAAG,CAAC,CAAC,EAAE,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QACnE,IAAI,CAAC,CAAC,EAAE,CAAC,IAAI,CAAC,KAAK,CAAC,IAAI,KAAK,CAAC,CAAC,EAAE,CAAC,IAAI,CAAC,KAAK,CAAC,IAAI;YAAE,OAAO,CAAC,CAAC,EAAE,CAAC,IAAI,CAAC,KAAK,CAAC,IAAI,GAAG,CAAC,CAAC,EAAE,CAAC,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC;QACtG,IAAI,CAAC,CAAC,EAAE,CAAC,IAAI,CAAC,KAAK,CAAC,MAAM,KAAK,CAAC,CAAC,EAAE,CAAC,IAAI,CAAC,KAAK,CAAC,MAAM;YAAE,OAAO,CAAC,CAAC,EAAE,CAAC,IAAI,CAAC,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC,EAAE,CAAC,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC;QAC9G,IAAI,CAAC,CAAC,IAAI,KAAK,CAAC,CAAC,IAAI;YAAE,OAAO,CAAC,CAAC,IAAI,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QACvD,OAAO,CAAC,CAAC,OAAO,GAAG,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,OAAO,GAAG,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IACpE,CAAC,CAAC,CAAC;AACL,CAAC;AAED,2EAA2E;AAC3E,MAAM,CAAC,MAAM,YAAY,GAA8C,MAAM,CAAC,MAAM,CAAC;IACnF,gBAAgB,EAAE,sFAAsF;IACxG,eAAe,EAAE,mFAAmF;IACpG,qBAAqB,EAAE,iEAAiE;IACxF,gBAAgB,EAAE,2EAA2E;CAC9F,CAAC,CAAC","sourcesContent":["/**\n * The built-in diagnostics.\n *\n * Two of them - the two the whole project exists for - are written as selector\n * queries rather than as bespoke traversals. That is not a stunt: it is the\n * proof that the query language is expressive enough to be worth exposing. A\n * team whose convention spec-graph never anticipated can write the equivalent\n * of a built-in rule on the command line.\n *\n * ```text\n * ghost-handover  *[openness!=closed][phase!=retired] -delegates-to,blocked-by-> *[receptivity=sealed]\n * stale-premise   *[phase!=retired] -depends-on,assumes,amends,blocked-by-> document[phase=retired]\n * ```\n *\n * The rest are not path queries and are not pretended to be: dangling\n * references never became edges, and a cycle is not a fixed-length path.\n *\n * Every rule here obeys one discipline - **report the place a human can fix**.\n * For a supersession that the superseded document never acknowledged, that is\n * the superseded document, not the one that declared the relation.\n */\n\nimport { OBLIGATION_EDGES, type SpecGraph } from './graph.js';\nimport { dirnamePosix, resolveFrom } from './paths.js';\nimport { execute, parseQuery, type QuerySpec } from './select.js';\nimport type { ResolvedCorpus } from './resolve.js';\nimport type {\n  DanglingRef,\n  Diagnostic,\n  DocumentNode,\n  Edge,\n  ItemNode,\n  RelatedLocation,\n  RuleId,\n  Severity,\n  SourceRef,\n  SpecNode,\n} from './types.js';\nimport { EDGE_TRAITS } from './types.js';\n\n/* -------------------------------------------------------------------------- */\n/* Configuration                                                              */\n/* -------------------------------------------------------------------------- */\n\nexport const DEFAULT_SEVERITIES: Readonly<Record<RuleId, Severity>> = Object.freeze({\n  'ghost-handover': 'error',\n  'stale-premise': 'error',\n  'broken-reference': 'error',\n  'reference-outside-corpus': 'warn',\n  'ambiguous-reference': 'warn',\n  'circular-delegation': 'error',\n  'orphaned-obligation': 'error',\n  'live-supersession': 'error',\n  'unreciprocated-supersession': 'warn',\n  'state-conflict': 'warn',\n  'self-reference': 'info',\n});\n\nexport const RULE_IDS = Object.keys(DEFAULT_SEVERITIES) as readonly RuleId[];\n\n/** One-line descriptions, printed by `spec-graph rules`. */\nexport const RULE_DESCRIPTIONS: Readonly<Record<RuleId, string>> = Object.freeze({\n  'ghost-handover': 'an open obligation is handed to a document that can no longer absorb it',\n  'stale-premise': 'a live document rests on a decision that has been retired or obviated',\n  'broken-reference': 'a citation names a document or anchor that does not exist',\n  'reference-outside-corpus': 'a citation names a real document the include patterns did not reach',\n  'ambiguous-reference': 'a citation matches more than one document',\n  'circular-delegation': 'obligations or supersessions form a cycle, so none of them can ever land',\n  'orphaned-obligation': 'a retired or frozen document still holds open obligations',\n  'live-supersession': 'a document has been superseded but still presents itself as current',\n  'unreciprocated-supersession': 'a retired document does not say what replaced it',\n  'state-conflict': 'an item declares two states that disagree about whether work remains',\n  'self-reference': 'a document delegates to or depends on itself',\n});\n\n/**\n * The severity map `--strict` implies, and which rules it actually moved.\n *\n * Strict raises `warn` to `error` and leaves `info` alone. That asymmetry is\n * deliberate: the `info` rules are advisory by nature - a self-link in a table\n * of contents is a formatting quirk - and promoting them would resurrect\n * precisely the false-positive problem ADR-0006 exists to prevent.\n *\n * An explicit `--rule` always wins over strict, so `--strict --rule x=warn`\n * keeps `x` at warn. That is what makes strict usable: a team can turn it on\n * and exempt the one rule their repository disagrees with, rather than choosing\n * between all of it and none of it.\n */\nexport function resolveStrict(\n  overrides: Partial<Record<RuleId, Severity>> = {},\n  strict = false,\n): { severities: Partial<Record<RuleId, Severity>>; escalated: ReadonlySet<RuleId> } {\n  const severities: Partial<Record<RuleId, Severity>> = { ...overrides };\n  const escalated = new Set<RuleId>();\n  if (!strict) return { severities, escalated };\n\n  for (const id of RULE_IDS) {\n    if (overrides[id] !== undefined) continue;\n    if (DEFAULT_SEVERITIES[id] !== 'warn') continue;\n    severities[id] = 'error';\n    escalated.add(id);\n  }\n  return { severities, escalated };\n}\n\nexport interface RuleOptions {\n  readonly severities?: Partial<Record<RuleId, Severity>> | undefined;\n  /** Cap on related locations attached to one finding. */\n  readonly maxRelated?: number | undefined;\n}\n\nconst DEFAULT_MAX_RELATED = 8;\n\n/* -------------------------------------------------------------------------- */\n/* Entry point                                                                */\n/* -------------------------------------------------------------------------- */\n\n/** Runs every enabled rule and returns findings in report order. */\nexport function runRules(graph: SpecGraph, corpus: ResolvedCorpus, options: RuleOptions = {}): Diagnostic[] {\n  const severities = { ...DEFAULT_SEVERITIES, ...(options.severities ?? {}) };\n  const maxRelated = options.maxRelated ?? DEFAULT_MAX_RELATED;\n  const out: Diagnostic[] = [];\n\n  const emit = (rule: RuleId, build: () => Built): void => {\n    const severity = severities[rule];\n    if (severity === 'off') return;\n    const body = build();\n    if (exempt(graph, rule, body.nodes)) return;\n    // `target` ahead of the spread: a rule that names one overrides the default,\n    // and the eight that have nothing to name say nothing.\n    out.push({ rule, severity, target: null, ...body, related: body.related.slice(0, maxRelated) });\n  };\n\n  // Ghost handovers are reported first and claim their edges, because\n  // `blocked-by` is both obligation-transferring and load-bearing: without this,\n  // one open question blocked by an archived decision would produce two\n  // findings on the same line, for the same defect, with the same fix.\n  const claimed = ghostHandovers(graph, emit);\n  stalePremises(graph, emit, claimed);\n  brokenReferences(corpus, emit);\n  circularDelegations(graph, emit);\n  orphanedObligations(graph, emit, maxRelated);\n  supersessions(graph, emit);\n  stateConflicts(graph, emit);\n  selfReferences(graph, emit);\n\n  return sortDiagnostics(out);\n}\n\n/** What a rule returns: the finding, minus what `emit` knows better. */\ntype Built = Omit<Diagnostic, 'rule' | 'severity' | 'target'> & { readonly target?: string };\n\ntype Emit = (rule: RuleId, build: () => Built) => void;\n\n/**\n * Rules about what a document cites, rather than about what it owes.\n *\n * These are the ones a historical record still answers for. A link that goes\n * nowhere is broken whoever wrote it and whenever they wrote it.\n */\nconst REFERENCE_RULES: ReadonlySet<RuleId> = new Set<RuleId>([\n  'broken-reference',\n  'reference-outside-corpus',\n  'ambiguous-reference',\n]);\n\n/**\n * Whether a finding is about history rather than about work.\n *\n * A record reports that something was decided; it does not decide anything. Its\n * open checkboxes are minutes, its delegations are things that were said, and\n * its lifecycle is not a lifecycle. So a record is never the *subject* of a\n * finding about obligations or lifecycle - though it is still a legitimate\n * target of one, because delegating live work into a log is exactly the ghost\n * handover this tool exists to find.\n *\n * Stated once, here, rather than as a guard repeated in eight rules: the\n * exemption is a property of what counts as a finding, not of any one rule, and\n * a rule added later inherits it without having to remember. See ADR-0011.\n */\nfunction exempt(graph: SpecGraph, rule: RuleId, nodes: readonly string[]): boolean {\n  if (REFERENCE_RULES.has(rule)) return false;\n  const subject = nodes[0];\n  if (subject === undefined) return false;\n  return graph.owningDocument(subject)?.phase === 'record';\n}\n\n/* -------------------------------------------------------------------------- */\n/* Ghost handovers                                                            */\n/* -------------------------------------------------------------------------- */\n\n/**\n * The flagship failure mode: an obligation handed into a closed ledger.\n *\n * The source must still be open and must not itself be retired - a retired\n * document delegating to another retired document is history, not a defect,\n * and reporting it would bury the live findings underneath the archive.\n */\nconst GHOST_HANDOVER: QuerySpec = parseQuery(\n  '*[openness!=closed][phase!=retired] -delegates-to,blocked-by-> *[receptivity=sealed]',\n);\n\n/** Emits ghost-handover findings and returns the edges they account for. */\nfunction ghostHandovers(graph: SpecGraph, emit: Emit): Set<string> {\n  const claimed = new Set<string>();\n  for (const match of execute(graph, GHOST_HANDOVER)) {\n    const source = match.nodes[0] as SpecNode;\n    const target = match.nodes[1] as SpecNode;\n    const edge = match.edges[0] as Edge;\n    const targetDocument = graph.owningDocument(target.id);\n    if (!targetDocument) continue;\n\n    const sealed = SEALED_WORD[targetDocument.phase] ?? 'frozen';\n    const what = source.kind === 'item' ? 'open obligation' : 'obligation';\n    const verb = EDGE_TRAITS[edge.kind].phrase;\n    claimed.add(edgeKey(edge));\n\n    emit('ghost-handover', () => ({\n      message: `${what} ${verb} ${describe(target)}, which is ${sealed}`,\n      at: edge.declaredAt,\n      nodes: [source.id, target.id],\n      related: [\n        related(targetDocument.statusAt ?? targetDocument.at, `${targetDocument.id} is ${sealed}${statusSuffix(targetDocument)}`),\n        ...(source.kind === 'item' ? [related(source.at, `the obligation: ${source.text}`)] : []),\n      ],\n      hint: HANDOVER_HINT[targetDocument.phase]?.(targetDocument.id) ?? FROZEN_HINT(targetDocument.id),\n    }));\n  }\n  return claimed;\n}\n\n/** How a sealed target is described in a ghost-handover message. */\nconst SEALED_WORD: Readonly<Partial<Record<string, string>>> = {\n  retired: 'retired',\n  record: 'a historical record',\n};\n\nconst FROZEN_HINT = (id: string): string =>\n  `${id} is frozen and cannot take on new work - open an amendment, or close this here`;\n\n/** What to do about work handed into each kind of sealed document. */\nconst HANDOVER_HINT: Readonly<Partial<Record<string, (id: string) => string>>> = {\n  retired: (id) => `nothing will be read from ${id} again - re-home this in a live document, or close it here`,\n  record: (id) => `${id} is a log of what happened and will never act - re-home this in a live document`,\n};\n\n/** Identity of a relation, for the hand-off between overlapping rules. */\nfunction edgeKey(edge: Edge): string {\n  return `${edge.kind} ${edge.from} ${edge.to}`;\n}\n\n/* -------------------------------------------------------------------------- */\n/* Stale premises                                                             */\n/* -------------------------------------------------------------------------- */\n\n/**\n * A live document resting on something that stopped being true.\n *\n * Only load-bearing relations count. A \"See also\" pointing at a superseded ADR\n * is ordinary cross-referencing; `assumes` pointing at the same document means\n * somebody is designing around a constraint that was abolished.\n */\nconst STALE_PREMISE_DOCUMENT: QuerySpec = parseQuery(\n  '*[phase!=retired] -depends-on,assumes,amends,blocked-by-> document[phase=retired]',\n);\nconst STALE_PREMISE_ITEM: QuerySpec = parseQuery(\n  '*[phase!=retired] -depends-on,assumes,amends,blocked-by-> item[state=obviated]',\n);\n\nfunction stalePremises(graph: SpecGraph, emit: Emit, claimed: ReadonlySet<string>): void {\n  const seen = new Set<string>();\n  for (const spec of [STALE_PREMISE_DOCUMENT, STALE_PREMISE_ITEM]) {\n    for (const match of execute(graph, spec)) {\n      const source = match.nodes[0] as SpecNode;\n      const target = match.nodes[1] as SpecNode;\n      const edge = match.edges[0] as Edge;\n      // Already reported as a ghost handover, which says the same thing in the\n      // terms the reader needs.\n      if (claimed.has(edgeKey(edge))) continue;\n      const key = `${source.id}>${target.id}>${edge.kind}`;\n      if (seen.has(key)) continue;\n      seen.add(key);\n\n      const targetDocument = graph.owningDocument(target.id);\n      const because =\n        target.kind === 'item'\n          ? 'that question was obviated - its premise no longer holds'\n          : `${target.id} is retired${statusSuffix(targetDocument)}`;\n\n      emit('stale-premise', () => ({\n        message: `${describe(source)} ${EDGE_TRAITS[edge.kind].phrase} ${describe(target)}, which no longer holds`,\n        at: edge.declaredAt,\n        nodes: [source.id, target.id],\n        // Point at the status line when there is one: that is the sentence that\n        // makes the premise stale, and repeating the document's first line\n        // underneath it adds nothing.\n        related: [related(target.kind === 'document' ? (targetDocument?.statusAt ?? target.at) : target.at, because)],\n        hint: `re-check this dependency: the constraint it assumes may have been lifted when ${target.kind === 'item' ? 'the question closed' : `${target.id} was retired`}`,\n      }));\n    }\n  }\n}\n\n/* -------------------------------------------------------------------------- */\n/* Reference integrity                                                        */\n/* -------------------------------------------------------------------------- */\n\nfunction brokenReferences(corpus: ResolvedCorpus, emit: Emit): void {\n  for (const ref of corpus.dangling) {\n    if (ref.reason === 'ambiguous') {\n      emit('ambiguous-reference', () => ({\n        message: `\"${ref.target}\" matches ${ref.candidates.length} documents`,\n        at: ref.declaredAt,\n        nodes: [ref.from],\n        target: ref.target,\n        related: [],\n        hint: `disambiguate it - candidates: ${ref.candidates.join(', ')}`,\n      }));\n      continue;\n    }\n\n    // A link to a file that exists but was not included is a configuration\n    // problem: the graph is not broken, the corpus is just incomplete. Reporting\n    // it as an error means a repository whose specifications live somewhere the\n    // default patterns miss fails on its first run, for something the user has\n    // not done wrong.\n    const rule: RuleId = ref.reason === 'not-a-spec' ? 'reference-outside-corpus' : 'broken-reference';\n\n    emit(rule, () => ({\n      message: brokenMessage(ref),\n      at: ref.declaredAt,\n      nodes: [ref.from],\n      target: ref.target,\n      related: [],\n      hint: brokenHint(ref),\n    }));\n  }\n}\n\nfunction brokenMessage(ref: DanglingRef): string {\n  switch (ref.reason) {\n    case 'unknown-anchor':\n      return `\"${ref.target}\" points at an anchor that does not exist`;\n    case 'not-a-spec':\n      return `\"${ref.target}\" resolves to a file that is not a specification`;\n    default:\n      return `\"${ref.target}\" does not resolve to any document`;\n  }\n}\n\nfunction brokenHint(ref: DanglingRef): string {\n  if (ref.candidates.length > 0) return `did you mean ${ref.candidates.slice(0, 3).join(', ')}?`;\n  // A wiki link carries no path, only a name, so whether it means a document at\n  // all is a repository convention. Naming the flag here is what keeps that a\n  // one-run discovery rather than a support question.\n  if (ref.raw.startsWith('[[') && ref.reason === 'unknown-target') {\n    return `fix the identifier, or - if [[...]] tags a concept here - exclude it: --ignore-ref \"${suggestReferenceGlob(ref.target)}\"`;\n  }\n  switch (ref.reason) {\n    case 'unknown-anchor':\n      return 'check the heading or item id it is meant to address';\n    case 'not-a-spec':\n      // Name the pattern that would include it: \"widen your patterns\" is advice\n      // the reader then has to translate, and this is the translation.\n      return `include it, for example: spec-graph \"${suggestPattern(ref)}\"`;\n    default:\n      return 'fix the identifier, or add the document it names';\n  }\n}\n\n/**\n * A glob covering the family of concept tags a target belongs to.\n *\n * `trap 55` suggests `trap *` rather than `trap 55`, because these tags come in\n * numbered series and excluding them one at a time is not a fix anybody would\n * accept. A target with no trailing number is suggested verbatim.\n */\nfunction suggestReferenceGlob(target: string): string {\n  const trimmed = target.trim();\n  const series = /^(.*?)[\\s._-]*\\d+$/.exec(trimmed);\n  const stem = series?.[1]?.trim();\n  return stem !== undefined && stem.length > 0 ? `${stem} *` : trimmed;\n}\n\n/**\n * The narrowest include pattern that would reach a target the corpus missed.\n *\n * Built from the *resolved* repository-relative path, not the link as written:\n * `../notes.md` cited from `docs/adr/` needs `docs/**\\/*.md`, and suggesting\n * `../**\\/*.md` would be worse than saying nothing.\n */\nfunction suggestPattern(ref: DanglingRef): string {\n  const withoutAnchor = (ref.target.split('#')[0] ?? ref.target).trim();\n  const resolved = resolveFrom(ref.declaredAt.file, withoutAnchor);\n  const directory = dirnamePosix(resolved);\n  return directory.length > 0 ? `${directory}/**/*.md` : '**/*.md';\n}\n\n/* -------------------------------------------------------------------------- */\n/* Cycles                                                                     */\n/* -------------------------------------------------------------------------- */\n\nfunction circularDelegations(graph: SpecGraph, emit: Emit): void {\n  const kinds = [...OBLIGATION_EDGES, 'supersedes' as const];\n  // Projected onto documents, so a question handed back and forth between two\n  // of them is found even though each delegation runs item -> document and the\n  // raw graph therefore contains no cycle at all.\n  for (const component of graph.cycles(kinds, { byDocument: true })) {\n    const members = component\n      .map((id) => graph.document(id))\n      .filter((node): node is DocumentNode => node !== undefined);\n    if (members.length < 2) continue;\n    // A cycle is a set, not a subject, so the exemption at `emit` cannot see it.\n    // One record in the loop means the loop is partly a report of what was once\n    // said, and nothing in it is owed by anybody.\n    if (members.some((member) => member.phase === 'record')) continue;\n\n    const edges = cycleEdges(graph, component, kinds);\n    const onlySupersession = edges.length > 0 && edges.every((edge) => edge.kind === 'supersedes');\n    const head = members[0] as DocumentNode;\n\n    emit('circular-delegation', () => ({\n      message: onlySupersession\n        ? `supersession cycle across ${members.length} documents`\n        : `delegation cycle across ${members.length} documents: nothing in it can ever land`,\n      at: edges[0]?.declaredAt ?? head.at,\n      nodes: component,\n      related: edges.map((edge) => related(edge.declaredAt, `${edge.from} ${EDGE_TRAITS[edge.kind].phrase} ${edge.to}`)),\n      hint: 'break the loop: one of these must own the work outright, or be closed',\n    }));\n  }\n}\n\n/**\n * The relations that keep a component strongly connected.\n *\n * Membership is by owning document, because the component is a projection: the\n * edge that closes the loop is usually written on an item, and that is the line\n * the report has to point at.\n */\nfunction cycleEdges(graph: SpecGraph, component: readonly string[], kinds: readonly Edge['kind'][]): Edge[] {\n  const inside = new Set(component);\n  const owner = (id: string): string => graph.owningDocument(id)?.id ?? id;\n  const out: Edge[] = [];\n  for (const edge of graph.edges) {\n    if (!kinds.includes(edge.kind)) continue;\n    const from = owner(edge.from);\n    const to = owner(edge.to);\n    if (from !== to && inside.has(from) && inside.has(to)) out.push(edge);\n  }\n  return out;\n}\n\n/* -------------------------------------------------------------------------- */\n/* Orphaned obligations                                                       */\n/* -------------------------------------------------------------------------- */\n\n/**\n * The black hole itself: a document nobody reads any more, still holding work.\n *\n * Reported once per document rather than once per item. Five findings that all\n * say \"this archived ADR has open questions\" is five times the noise and none\n * of the extra information.\n */\nfunction orphanedObligations(graph: SpecGraph, emit: Emit, maxRelated: number): void {\n  for (const document of graph.documents) {\n    if (document.phase !== 'retired' && document.phase !== 'frozen') continue;\n    const open = graph.itemsOf(document.id).filter((item) => item.openness !== 'closed');\n    if (open.length === 0) continue;\n\n    const sealed = document.phase === 'retired' ? 'retired' : 'frozen';\n    emit('orphaned-obligation', () => ({\n      message: `${sealed} document still holds ${open.length} open ${open.length === 1 ? 'obligation' : 'obligations'}`,\n      at: document.statusAt ?? document.at,\n      nodes: [document.id, ...open.map((item) => item.id)],\n      related: open\n        .slice(0, maxRelated)\n        .map((item) => related(item.at, `${item.disposition}: ${item.text}`)),\n      hint: `move each one to a live document or close it - as it stands, ${open.length === 1 ? 'it disappears' : 'they disappear'} with ${document.id}`,\n    }));\n  }\n}\n\n/* -------------------------------------------------------------------------- */\n/* Supersession consistency                                                   */\n/* -------------------------------------------------------------------------- */\n\nfunction supersessions(graph: SpecGraph, emit: Emit): void {\n  for (const edge of graph.edges) {\n    if (edge.kind !== 'supersedes' || edge.reflexive) continue;\n    const superseded = graph.document(edge.to);\n    const superseding = graph.document(edge.from);\n    if (!superseded || !superseding) continue;\n    // A record narrating \"ADR-0005 replaced ADR-0001\" is reporting a\n    // supersession, not declaring one. Both hints below ask somebody to edit\n    // the document that made the claim, and a log is the one document nobody\n    // can edit - it says what was true when it was written. The exemption at\n    // `emit` cannot see this: the subject here is the *other* document.\n    if (superseding.phase === 'record') continue;\n\n    if (superseded.phase !== 'retired' && superseded.phase !== 'unknown') {\n      emit('live-supersession', () => ({\n        // The fix belongs in the superseded document, so that is where the\n        // finding points - not at the document that made the claim.\n        message: `${superseded.id} is superseded by ${superseding.id} but still reads as ${superseded.phase}`,\n        at: superseded.statusAt ?? superseded.at,\n        nodes: [superseded.id, superseding.id],\n        related: [related(edge.declaredAt, `the supersession is declared here`)],\n        hint: `mark ${superseded.id} as superseded, or drop the claim in ${superseding.id}`,\n      }));\n      continue;\n    }\n\n    if (superseded.phase === 'retired' && !edge.declaredIn.includes(superseded.path)) {\n      emit('unreciprocated-supersession', () => ({\n        message: `${superseded.id} is retired but never says that ${superseding.id} replaced it`,\n        at: superseded.statusAt ?? superseded.at,\n        nodes: [superseded.id, superseding.id],\n        related: [related(edge.declaredAt, `only ${superseding.id} records the relationship`)],\n        hint: `add \"superseded-by: ${superseding.id}\" to ${superseded.path} so a reader who lands there is redirected`,\n      }));\n    }\n  }\n}\n\n/* -------------------------------------------------------------------------- */\n/* Item state                                                                 */\n/* -------------------------------------------------------------------------- */\n\nfunction stateConflicts(graph: SpecGraph, emit: Emit): void {\n  for (const item of graph.items) {\n    if (item.conflicts.length === 0) continue;\n    emit('state-conflict', () => ({\n      message: `item reads as ${item.disposition} but also carries ${describeSignals(item)}`,\n      at: item.evidence.at,\n      nodes: [item.id],\n      related: item.conflicts.map((signal) =>\n        related(signal.at, `${signal.source} says ${signal.disposition}${signal.raw ? `: ${signal.raw}` : ''}`),\n      ),\n      hint: `make the two agree - spec-graph is treating it as ${item.openness}`,\n    }));\n  }\n}\n\nfunction describeSignals(item: ItemNode): string {\n  const parts = item.conflicts.map((signal) => `a ${signal.source} saying ${signal.disposition}`);\n  return parts.length === 1 ? (parts[0] as string) : `${parts.slice(0, -1).join(', ')} and ${parts[parts.length - 1]}`;\n}\n\n/* -------------------------------------------------------------------------- */\n/* Self references                                                            */\n/* -------------------------------------------------------------------------- */\n\n/**\n * A document that delegates to, or depends on, itself.\n *\n * Almost always a copied link that was never repointed. Informational, because\n * a self-link in a table of contents is harmless - but a *delegation* to self\n * means an obligation that looks handed off and was not.\n */\nfunction selfReferences(graph: SpecGraph, emit: Emit): void {\n  for (const edge of graph.edges) {\n    if (!edge.reflexive || edge.kind === 'contains') continue;\n    const traits = EDGE_TRAITS[edge.kind];\n    if (!traits.transfersObligation && !traits.loadBearing) continue;\n    const node = graph.node(edge.from);\n    if (!node) continue;\n\n    emit('self-reference', () => ({\n      message: `${describe(node)} ${traits.phrase} itself`,\n      at: edge.declaredAt,\n      nodes: [edge.from],\n      related: [],\n      hint: traits.transfersObligation\n        ? 'this obligation looks delegated but never left - point it at another document, or own it here'\n        : 'a document cannot depend on itself - repoint or remove the reference',\n    }));\n  }\n}\n\n/* -------------------------------------------------------------------------- */\n/* Helpers                                                                    */\n/* -------------------------------------------------------------------------- */\n\nfunction describe(node: SpecNode): string {\n  return node.kind === 'document' ? node.id : `${node.document} \"${truncate(node.text, 48)}\"`;\n}\n\nfunction truncate(text: string, limit: number): string {\n  return text.length <= limit ? text : `${text.slice(0, limit - 3)}...`;\n}\n\nfunction statusSuffix(document: DocumentNode | undefined): string {\n  return document?.rawStatus ? ` (\"${document.rawStatus}\")` : '';\n}\n\nfunction related(at: SourceRef, note: string): RelatedLocation {\n  return { at, note };\n}\n\nconst SEVERITY_ORDER: Readonly<Record<Exclude<Severity, 'off'>, number>> = { error: 0, warn: 1, info: 2 };\n\n/**\n * Total ordering, so two runs on the same corpus produce byte-identical output.\n *\n * CI output that reorders between runs cannot be diffed, and output that cannot\n * be diffed stops being read.\n */\nexport function sortDiagnostics(diagnostics: readonly Diagnostic[]): Diagnostic[] {\n  return [...diagnostics].sort((a, b) => {\n    const bySeverity = SEVERITY_ORDER[a.severity] - SEVERITY_ORDER[b.severity];\n    if (bySeverity !== 0) return bySeverity;\n    if (a.at.file !== b.at.file) return a.at.file < b.at.file ? -1 : 1;\n    if (a.at.span.start.line !== b.at.span.start.line) return a.at.span.start.line - b.at.span.start.line;\n    if (a.at.span.start.column !== b.at.span.start.column) return a.at.span.start.column - b.at.span.start.column;\n    if (a.rule !== b.rule) return a.rule < b.rule ? -1 : 1;\n    return a.message < b.message ? -1 : a.message > b.message ? 1 : 0;\n  });\n}\n\n/** The selector equivalent of a rule, for `spec-graph rules --explain`. */\nexport const RULE_QUERIES: Readonly<Partial<Record<RuleId, string>>> = Object.freeze({\n  'ghost-handover': '*[openness!=closed][phase!=retired] -delegates-to,blocked-by-> *[receptivity=sealed]',\n  'stale-premise': '*[phase!=retired] -depends-on,assumes,amends,blocked-by-> document[phase=retired]',\n  'orphaned-obligation': 'document[receptivity=sealed] -contains-> item[openness!=closed]',\n  'self-reference': 'see --format json; reflexive edges are excluded from traversal by default',\n});\n"]}
+{"version":3,"file":"rules.js","sourceRoot":"","sources":["../src/rules.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;GAoBG;AAEH,OAAO,EAAE,gBAAgB,EAAkB,MAAM,YAAY,CAAC;AAC9D,OAAO,EAAE,YAAY,EAAE,WAAW,EAAE,MAAM,YAAY,CAAC;AACvD,OAAO,EAAE,OAAO,EAAE,UAAU,EAAkB,MAAM,aAAa,CAAC;AAclE,OAAO,EAAE,WAAW,EAAE,MAAM,YAAY,CAAC;AAEzC,gFAAgF;AAChF,gFAAgF;AAChF,gFAAgF;AAEhF,MAAM,CAAC,MAAM,kBAAkB,GAAuC,MAAM,CAAC,MAAM,CAAC;IAClF,gBAAgB,EAAE,OAAO;IACzB,eAAe,EAAE,OAAO;IACxB,kBAAkB,EAAE,OAAO;IAC3B,0BAA0B,EAAE,MAAM;IAClC,qBAAqB,EAAE,MAAM;IAC7B,qBAAqB,EAAE,OAAO;IAC9B,qBAAqB,EAAE,OAAO;IAC9B,mBAAmB,EAAE,OAAO;IAC5B,6BAA6B,EAAE,MAAM;IACrC,gBAAgB,EAAE,MAAM;IACxB,gBAAgB,EAAE,MAAM;IACxB,sBAAsB,EAAE,MAAM;CAC/B,CAAC,CAAC;AAEH,MAAM,CAAC,MAAM,QAAQ,GAAG,MAAM,CAAC,IAAI,CAAC,kBAAkB,CAAsB,CAAC;AAE7E,4DAA4D;AAC5D,MAAM,CAAC,MAAM,iBAAiB,GAAqC,MAAM,CAAC,MAAM,CAAC;IAC/E,gBAAgB,EAAE,yEAAyE;IAC3F,eAAe,EAAE,uEAAuE;IACxF,kBAAkB,EAAE,2DAA2D;IAC/E,0BAA0B,EAAE,qEAAqE;IACjG,qBAAqB,EAAE,2CAA2C;IAClE,qBAAqB,EAAE,0EAA0E;IACjG,qBAAqB,EAAE,2DAA2D;IAClF,mBAAmB,EAAE,qEAAqE;IAC1F,6BAA6B,EAAE,kDAAkD;IACjF,gBAAgB,EAAE,sEAAsE;IACxF,gBAAgB,EAAE,8CAA8C;IAChE,sBAAsB,EAAE,0DAA0D;CACnF,CAAC,CAAC;AAEH;;;;;;;;;;;;GAYG;AACH,MAAM,UAAU,aAAa,CAC3B,SAAS,GAAsC,EAAE,EACjD,MAAM,GAAG,KAAK;IAEd,MAAM,UAAU,GAAsC,EAAE,GAAG,SAAS,EAAE,CAAC;IACvE,MAAM,SAAS,GAAG,IAAI,GAAG,EAAU,CAAC;IACpC,IAAI,CAAC,MAAM;QAAE,OAAO,EAAE,UAAU,EAAE,SAAS,EAAE,CAAC;IAE9C,KAAK,MAAM,EAAE,IAAI,QAAQ,EAAE,CAAC;QAC1B,IAAI,SAAS,CAAC,EAAE,CAAC,KAAK,SAAS;YAAE,SAAS;QAC1C,IAAI,kBAAkB,CAAC,EAAE,CAAC,KAAK,MAAM;YAAE,SAAS;QAChD,UAAU,CAAC,EAAE,CAAC,GAAG,OAAO,CAAC;QACzB,SAAS,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;IACpB,CAAC;IACD,OAAO,EAAE,UAAU,EAAE,SAAS,EAAE,CAAC;AACnC,CAAC;AAQD,MAAM,mBAAmB,GAAG,CAAC,CAAC;AAE9B,gFAAgF;AAChF,gFAAgF;AAChF,gFAAgF;AAEhF,oEAAoE;AACpE,MAAM,UAAU,QAAQ,CAAC,KAAgB,EAAE,MAAsB,EAAE,OAAO,GAAgB,EAAE;IAC1F,MAAM,UAAU,GAAG,EAAE,GAAG,kBAAkB,EAAE,GAAG,CAAC,OAAO,CAAC,UAAU,IAAI,EAAE,CAAC,EAAE,CAAC;IAC5E,MAAM,UAAU,GAAG,OAAO,CAAC,UAAU,IAAI,mBAAmB,CAAC;IAC7D,MAAM,GAAG,GAAiB,EAAE,CAAC;IAE7B,MAAM,IAAI,GAAG,CAAC,IAAY,EAAE,KAAkB,EAAQ,EAAE;QACtD,MAAM,QAAQ,GAAG,UAAU,CAAC,IAAI,CAAC,CAAC;QAClC,IAAI,QAAQ,KAAK,KAAK;YAAE,OAAO;QAC/B,MAAM,IAAI,GAAG,KAAK,EAAE,CAAC;QACrB,IAAI,MAAM,CAAC,KAAK,EAAE,IAAI,EAAE,IAAI,CAAC,KAAK,CAAC;YAAE,OAAO;QAC5C,6EAA6E;QAC7E,uDAAuD;QACvD,GAAG,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,QAAQ,EAAE,MAAM,EAAE,IAAI,EAAE,GAAG,IAAI,EAAE,OAAO,EAAE,IAAI,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC,EAAE,UAAU,CAAC,EAAE,CAAC,CAAC;IAClG,CAAC,CAAC;IAEF,oEAAoE;IACpE,+EAA+E;IAC/E,sEAAsE;IACtE,qEAAqE;IACrE,MAAM,OAAO,GAAG,cAAc,CAAC,KAAK,EAAE,IAAI,CAAC,CAAC;IAC5C,aAAa,CAAC,KAAK,EAAE,IAAI,EAAE,OAAO,CAAC,CAAC;IACpC,gBAAgB,CAAC,MAAM,EAAE,IAAI,CAAC,CAAC;IAC/B,mBAAmB,CAAC,KAAK,EAAE,IAAI,CAAC,CAAC;IACjC,mBAAmB,CAAC,KAAK,EAAE,IAAI,EAAE,UAAU,CAAC,CAAC;IAC7C,aAAa,CAAC,KAAK,EAAE,IAAI,CAAC,CAAC;IAC3B,cAAc,CAAC,KAAK,EAAE,IAAI,CAAC,CAAC;IAC5B,WAAW,CAAC,MAAM,EAAE,IAAI,CAAC,CAAC;IAC1B,cAAc,CAAC,KAAK,EAAE,IAAI,CAAC,CAAC;IAE5B,OAAO,eAAe,CAAC,GAAG,CAAC,CAAC;AAC9B,CAAC;AAOD;;;;;GAKG;AACH,MAAM,eAAe,GAAwB,IAAI,GAAG,CAAS;IAC3D,kBAAkB;IAClB,0BAA0B;IAC1B,qBAAqB;IACrB,6EAA6E;IAC7E,8EAA8E;IAC9E,gEAAgE;IAChE,sBAAsB;CACvB,CAAC,CAAC;AAEH;;;;;;;;;;;;;GAaG;AACH,SAAS,MAAM,CAAC,KAAgB,EAAE,IAAY,EAAE,KAAwB;IACtE,IAAI,eAAe,CAAC,GAAG,CAAC,IAAI,CAAC;QAAE,OAAO,KAAK,CAAC;IAC5C,MAAM,OAAO,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC;IACzB,IAAI,OAAO,KAAK,SAAS;QAAE,OAAO,KAAK,CAAC;IACxC,OAAO,KAAK,CAAC,cAAc,CAAC,OAAO,CAAC,EAAE,KAAK,KAAK,QAAQ,CAAC;AAC3D,CAAC;AAED,gFAAgF;AAChF,gFAAgF;AAChF,gFAAgF;AAEhF;;;;;;GAMG;AACH,MAAM,cAAc,GAAc,UAAU,CAC1C,sFAAsF,CACvF,CAAC;AAEF,4EAA4E;AAC5E,SAAS,cAAc,CAAC,KAAgB,EAAE,IAAU;IAClD,MAAM,OAAO,GAAG,IAAI,GAAG,EAAU,CAAC;IAClC,KAAK,MAAM,KAAK,IAAI,OAAO,CAAC,KAAK,EAAE,cAAc,CAAC,EAAE,CAAC;QACnD,MAAM,MAAM,GAAG,KAAK,CAAC,KAAK,CAAC,CAAC,CAAa,CAAC;QAC1C,MAAM,MAAM,GAAG,KAAK,CAAC,KAAK,CAAC,CAAC,CAAa,CAAC;QAC1C,MAAM,IAAI,GAAG,KAAK,CAAC,KAAK,CAAC,CAAC,CAAS,CAAC;QACpC,MAAM,cAAc,GAAG,KAAK,CAAC,cAAc,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC;QACvD,IAAI,CAAC,cAAc;YAAE,SAAS;QAE9B,MAAM,MAAM,GAAG,WAAW,CAAC,cAAc,CAAC,KAAK,CAAC,IAAI,QAAQ,CAAC;QAC7D,MAAM,IAAI,GAAG,MAAM,CAAC,IAAI,KAAK,MAAM,CAAC,CAAC,CAAC,iBAAiB,CAAC,CAAC,CAAC,YAAY,CAAC;QACvE,MAAM,IAAI,GAAG,WAAW,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,MAAM,CAAC;QAC3C,OAAO,CAAC,GAAG,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC;QAE3B,IAAI,CAAC,gBAAgB,EAAE,GAAG,EAAE,CAAC,CAAC;YAC5B,OAAO,EAAE,GAAG,IAAI,IAAI,IAAI,IAAI,QAAQ,CAAC,MAAM,CAAC,cAAc,MAAM,EAAE;YAClE,EAAE,EAAE,IAAI,CAAC,UAAU;YACnB,KAAK,EAAE,CAAC,MAAM,CAAC,EAAE,EAAE,MAAM,CAAC,EAAE,CAAC;YAC7B,OAAO,EAAE;gBACP,OAAO,CAAC,cAAc,CAAC,QAAQ,IAAI,cAAc,CAAC,EAAE,EAAE,GAAG,cAAc,CAAC,EAAE,OAAO,MAAM,GAAG,YAAY,CAAC,cAAc,CAAC,EAAE,CAAC;gBACzH,GAAG,CAAC,MAAM,CAAC,IAAI,KAAK,MAAM,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,MAAM,CAAC,EAAE,EAAE,mBAAmB,MAAM,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;aAC1F;YACD,IAAI,EAAE,aAAa,CAAC,cAAc,CAAC,KAAK,CAAC,EAAE,CAAC,cAAc,CAAC,EAAE,CAAC,IAAI,WAAW,CAAC,cAAc,CAAC,EAAE,CAAC;SACjG,CAAC,CAAC,CAAC;IACN,CAAC;IACD,OAAO,OAAO,CAAC;AACjB,CAAC;AAED,oEAAoE;AACpE,MAAM,WAAW,GAA8C;IAC7D,OAAO,EAAE,SAAS;IAClB,MAAM,EAAE,qBAAqB;CAC9B,CAAC;AAEF,MAAM,WAAW,GAAG,CAAC,EAAU,EAAU,EAAE,CACzC,GAAG,EAAE,gFAAgF,CAAC;AAExF,sEAAsE;AACtE,MAAM,aAAa,GAA8D;IAC/E,OAAO,EAAE,CAAC,EAAE,EAAE,EAAE,CAAC,6BAA6B,EAAE,4DAA4D;IAC5G,MAAM,EAAE,CAAC,EAAE,EAAE,EAAE,CAAC,GAAG,EAAE,iFAAiF;CACvG,CAAC;AAEF,0EAA0E;AAC1E,SAAS,OAAO,CAAC,IAAU;IACzB,OAAO,GAAG,IAAI,CAAC,IAAI,IAAI,IAAI,CAAC,IAAI,IAAI,IAAI,CAAC,EAAE,EAAE,CAAC;AAChD,CAAC;AAED,gFAAgF;AAChF,gFAAgF;AAChF,gFAAgF;AAEhF;;;;;;GAMG;AACH,MAAM,sBAAsB,GAAc,UAAU,CAClD,mFAAmF,CACpF,CAAC;AACF,MAAM,kBAAkB,GAAc,UAAU,CAC9C,gFAAgF,CACjF,CAAC;AAEF,SAAS,aAAa,CAAC,KAAgB,EAAE,IAAU,EAAE,OAA4B;IAC/E,MAAM,IAAI,GAAG,IAAI,GAAG,EAAU,CAAC;IAC/B,KAAK,MAAM,IAAI,IAAI,CAAC,sBAAsB,EAAE,kBAAkB,CAAC,EAAE,CAAC;QAChE,KAAK,MAAM,KAAK,IAAI,OAAO,CAAC,KAAK,EAAE,IAAI,CAAC,EAAE,CAAC;YACzC,MAAM,MAAM,GAAG,KAAK,CAAC,KAAK,CAAC,CAAC,CAAa,CAAC;YAC1C,MAAM,MAAM,GAAG,KAAK,CAAC,KAAK,CAAC,CAAC,CAAa,CAAC;YAC1C,MAAM,IAAI,GAAG,KAAK,CAAC,KAAK,CAAC,CAAC,CAAS,CAAC;YACpC,yEAAyE;YACzE,0BAA0B;YAC1B,IAAI,OAAO,CAAC,GAAG,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC;gBAAE,SAAS;YACzC,MAAM,GAAG,GAAG,GAAG,MAAM,CAAC,EAAE,IAAI,MAAM,CAAC,EAAE,IAAI,IAAI,CAAC,IAAI,EAAE,CAAC;YACrD,IAAI,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC;gBAAE,SAAS;YAC5B,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;YAEd,MAAM,cAAc,GAAG,KAAK,CAAC,cAAc,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC;YACvD,MAAM,OAAO,GACX,MAAM,CAAC,IAAI,KAAK,MAAM;gBACpB,CAAC,CAAC,0DAA0D;gBAC5D,CAAC,CAAC,GAAG,MAAM,CAAC,EAAE,cAAc,YAAY,CAAC,cAAc,CAAC,EAAE,CAAC;YAE/D,IAAI,CAAC,eAAe,EAAE,GAAG,EAAE,CAAC,CAAC;gBAC3B,OAAO,EAAE,GAAG,QAAQ,CAAC,MAAM,CAAC,IAAI,WAAW,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,MAAM,IAAI,QAAQ,CAAC,MAAM,CAAC,yBAAyB;gBAC1G,EAAE,EAAE,IAAI,CAAC,UAAU;gBACnB,KAAK,EAAE,CAAC,MAAM,CAAC,EAAE,EAAE,MAAM,CAAC,EAAE,CAAC;gBAC7B,wEAAwE;gBACxE,mEAAmE;gBACnE,8BAA8B;gBAC9B,OAAO,EAAE,CAAC,OAAO,CAAC,MAAM,CAAC,IAAI,KAAK,UAAU,CAAC,CAAC,CAAC,CAAC,cAAc,EAAE,QAAQ,IAAI,MAAM,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,EAAE,EAAE,OAAO,CAAC,CAAC;gBAC7G,IAAI,EAAE,iFAAiF,MAAM,CAAC,IAAI,KAAK,MAAM,CAAC,CAAC,CAAC,qBAAqB,CAAC,CAAC,CAAC,GAAG,MAAM,CAAC,EAAE,cAAc,EAAE;aACrK,CAAC,CAAC,CAAC;QACN,CAAC;IACH,CAAC;AACH,CAAC;AAED,gFAAgF;AAChF,gFAAgF;AAChF,gFAAgF;AAEhF;;;;;;;GAOG;AACH,SAAS,WAAW,CAAC,MAAsB,EAAE,IAAU;IACrD,KAAK,MAAM,OAAO,IAAI,MAAM,CAAC,WAAW,EAAE,CAAC;QACzC,IAAI,CAAC,sBAAsB,EAAE,GAAG,EAAE,CAAC,CAAC;YAClC,OAAO,EAAE,IAAI,OAAO,CAAC,GAAG,wBAAwB;YAChD,EAAE,EAAE,OAAO,CAAC,EAAE;YACd,KAAK,EAAE,CAAC,OAAO,CAAC,IAAI,CAAC;YACrB,uEAAuE;YACvE,wEAAwE;YACxE,6BAA6B;YAC7B,MAAM,EAAE,OAAO,CAAC,GAAG;YACnB,OAAO,EAAE,EAAE;YACX,IAAI,EAAE,YAAY,OAAO,CAAC,UAAU,0DAA0D;SAC/F,CAAC,CAAC,CAAC;IACN,CAAC;AACH,CAAC;AAED,SAAS,gBAAgB,CAAC,MAAsB,EAAE,IAAU;IAC1D,KAAK,MAAM,GAAG,IAAI,MAAM,CAAC,QAAQ,EAAE,CAAC;QAClC,IAAI,GAAG,CAAC,MAAM,KAAK,WAAW,EAAE,CAAC;YAC/B,IAAI,CAAC,qBAAqB,EAAE,GAAG,EAAE,CAAC,CAAC;gBACjC,OAAO,EAAE,IAAI,GAAG,CAAC,MAAM,aAAa,GAAG,CAAC,UAAU,CAAC,MAAM,YAAY;gBACrE,EAAE,EAAE,GAAG,CAAC,UAAU;gBAClB,KAAK,EAAE,CAAC,GAAG,CAAC,IAAI,CAAC;gBACjB,MAAM,EAAE,GAAG,CAAC,MAAM;gBAClB,OAAO,EAAE,EAAE;gBACX,IAAI,EAAE,iCAAiC,GAAG,CAAC,UAAU,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE;aACnE,CAAC,CAAC,CAAC;YACJ,SAAS;QACX,CAAC;QAED,uEAAuE;QACvE,6EAA6E;QAC7E,4EAA4E;QAC5E,2EAA2E;QAC3E,kBAAkB;QAClB,MAAM,IAAI,GAAW,GAAG,CAAC,MAAM,KAAK,YAAY,CAAC,CAAC,CAAC,0BAA0B,CAAC,CAAC,CAAC,kBAAkB,CAAC;QAEnG,IAAI,CAAC,IAAI,EAAE,GAAG,EAAE,CAAC,CAAC;YAChB,OAAO,EAAE,aAAa,CAAC,GAAG,CAAC;YAC3B,EAAE,EAAE,GAAG,CAAC,UAAU;YAClB,KAAK,EAAE,CAAC,GAAG,CAAC,IAAI,CAAC;YACjB,MAAM,EAAE,GAAG,CAAC,MAAM;YAClB,OAAO,EAAE,EAAE;YACX,IAAI,EAAE,UAAU,CAAC,GAAG,CAAC;SACtB,CAAC,CAAC,CAAC;IACN,CAAC;AACH,CAAC;AAED,SAAS,aAAa,CAAC,GAAgB;IACrC,QAAQ,GAAG,CAAC,MAAM,EAAE,CAAC;QACnB,KAAK,gBAAgB;YACnB,OAAO,IAAI,GAAG,CAAC,MAAM,2CAA2C,CAAC;QACnE,KAAK,YAAY;YACf,OAAO,IAAI,GAAG,CAAC,MAAM,kDAAkD,CAAC;QAC1E;YACE,OAAO,IAAI,GAAG,CAAC,MAAM,oCAAoC,CAAC;IAC9D,CAAC;AACH,CAAC;AAED,SAAS,UAAU,CAAC,GAAgB;IAClC,IAAI,GAAG,CAAC,UAAU,CAAC,MAAM,GAAG,CAAC;QAAE,OAAO,gBAAgB,GAAG,CAAC,UAAU,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC;IAC/F,8EAA8E;IAC9E,4EAA4E;IAC5E,oDAAoD;IACpD,IAAI,GAAG,CAAC,GAAG,CAAC,UAAU,CAAC,IAAI,CAAC,IAAI,GAAG,CAAC,MAAM,KAAK,gBAAgB,EAAE,CAAC;QAChE,OAAO,uFAAuF,oBAAoB,CAAC,GAAG,CAAC,MAAM,CAAC,GAAG,CAAC;IACpI,CAAC;IACD,QAAQ,GAAG,CAAC,MAAM,EAAE,CAAC;QACnB,KAAK,gBAAgB;YACnB,OAAO,qDAAqD,CAAC;QAC/D,KAAK,YAAY;YACf,0EAA0E;YAC1E,iEAAiE;YACjE,OAAO,wCAAwC,cAAc,CAAC,GAAG,CAAC,GAAG,CAAC;QACxE;YACE,OAAO,kDAAkD,CAAC;IAC9D,CAAC;AACH,CAAC;AAED;;;;;;GAMG;AACH,SAAS,oBAAoB,CAAC,MAAc;IAC1C,MAAM,OAAO,GAAG,MAAM,CAAC,IAAI,EAAE,CAAC;IAC9B,MAAM,MAAM,GAAG,oBAAoB,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;IAClD,MAAM,IAAI,GAAG,MAAM,EAAE,CAAC,CAAC,CAAC,EAAE,IAAI,EAAE,CAAC;IACjC,OAAO,IAAI,KAAK,SAAS,IAAI,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,IAAI,IAAI,CAAC,CAAC,CAAC,OAAO,CAAC;AACvE,CAAC;AAED;;;;;;GAMG;AACH,SAAS,cAAc,CAAC,GAAgB;IACtC,MAAM,aAAa,GAAG,CAAC,GAAG,CAAC,MAAM,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,IAAI,GAAG,CAAC,MAAM,CAAC,CAAC,IAAI,EAAE,CAAC;IACtE,MAAM,QAAQ,GAAG,WAAW,CAAC,GAAG,CAAC,UAAU,CAAC,IAAI,EAAE,aAAa,CAAC,CAAC;IACjE,MAAM,SAAS,GAAG,YAAY,CAAC,QAAQ,CAAC,CAAC;IACzC,OAAO,SAAS,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,SAAS,UAAU,CAAC,CAAC,CAAC,SAAS,CAAC;AACnE,CAAC;AAED,gFAAgF;AAChF,gFAAgF;AAChF,gFAAgF;AAEhF,SAAS,mBAAmB,CAAC,KAAgB,EAAE,IAAU;IACvD,MAAM,KAAK,GAAG,CAAC,GAAG,gBAAgB,EAAE,YAAqB,CAAC,CAAC;IAC3D,4EAA4E;IAC5E,6EAA6E;IAC7E,gDAAgD;IAChD,KAAK,MAAM,SAAS,IAAI,KAAK,CAAC,MAAM,CAAC,KAAK,EAAE,EAAE,UAAU,EAAE,IAAI,EAAE,CAAC,EAAE,CAAC;QAClE,MAAM,OAAO,GAAG,SAAS;aACtB,GAAG,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,KAAK,CAAC,QAAQ,CAAC,EAAE,CAAC,CAAC;aAC/B,MAAM,CAAC,CAAC,IAAI,EAAwB,EAAE,CAAC,IAAI,KAAK,SAAS,CAAC,CAAC;QAC9D,IAAI,OAAO,CAAC,MAAM,GAAG,CAAC;YAAE,SAAS;QACjC,6EAA6E;QAC7E,4EAA4E;QAC5E,8CAA8C;QAC9C,IAAI,OAAO,CAAC,IAAI,CAAC,CAAC,MAAM,EAAE,EAAE,CAAC,MAAM,CAAC,KAAK,KAAK,QAAQ,CAAC;YAAE,SAAS;QAElE,MAAM,KAAK,GAAG,UAAU,CAAC,KAAK,EAAE,SAAS,EAAE,KAAK,CAAC,CAAC;QAClD,MAAM,gBAAgB,GAAG,KAAK,CAAC,MAAM,GAAG,CAAC,IAAI,KAAK,CAAC,KAAK,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,CAAC,IAAI,KAAK,YAAY,CAAC,CAAC;QAC/F,MAAM,IAAI,GAAG,OAAO,CAAC,CAAC,CAAiB,CAAC;QAExC,IAAI,CAAC,qBAAqB,EAAE,GAAG,EAAE,CAAC,CAAC;YACjC,OAAO,EAAE,gBAAgB;gBACvB,CAAC,CAAC,6BAA6B,OAAO,CAAC,MAAM,YAAY;gBACzD,CAAC,CAAC,2BAA2B,OAAO,CAAC,MAAM,yCAAyC;YACtF,EAAE,EAAE,KAAK,CAAC,CAAC,CAAC,EAAE,UAAU,IAAI,IAAI,CAAC,EAAE;YACnC,KAAK,EAAE,SAAS;YAChB,OAAO,EAAE,KAAK,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,OAAO,CAAC,IAAI,CAAC,UAAU,EAAE,GAAG,IAAI,CAAC,IAAI,IAAI,WAAW,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,MAAM,IAAI,IAAI,CAAC,EAAE,EAAE,CAAC,CAAC;YAClH,IAAI,EAAE,uEAAuE;SAC9E,CAAC,CAAC,CAAC;IACN,CAAC;AACH,CAAC;AAED;;;;;;GAMG;AACH,SAAS,UAAU,CAAC,KAAgB,EAAE,SAA4B,EAAE,KAA8B;IAChG,MAAM,MAAM,GAAG,IAAI,GAAG,CAAC,SAAS,CAAC,CAAC;IAClC,MAAM,KAAK,GAAG,CAAC,EAAU,EAAU,EAAE,CAAC,KAAK,CAAC,cAAc,CAAC,EAAE,CAAC,EAAE,EAAE,IAAI,EAAE,CAAC;IACzE,MAAM,GAAG,GAAW,EAAE,CAAC;IACvB,KAAK,MAAM,IAAI,IAAI,KAAK,CAAC,KAAK,EAAE,CAAC;QAC/B,IAAI,CAAC,KAAK,CAAC,QAAQ,CAAC,IAAI,CAAC,IAAI,CAAC;YAAE,SAAS;QACzC,MAAM,IAAI,GAAG,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAC9B,MAAM,EAAE,GAAG,KAAK,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;QAC1B,IAAI,IAAI,KAAK,EAAE,IAAI,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,MAAM,CAAC,GAAG,CAAC,EAAE,CAAC;YAAE,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IACxE,CAAC;IACD,OAAO,GAAG,CAAC;AACb,CAAC;AAED,gFAAgF;AAChF,gFAAgF;AAChF,gFAAgF;AAEhF;;;;;;GAMG;AACH,SAAS,mBAAmB,CAAC,KAAgB,EAAE,IAAU,EAAE,UAAkB;IAC3E,KAAK,MAAM,QAAQ,IAAI,KAAK,CAAC,SAAS,EAAE,CAAC;QACvC,IAAI,QAAQ,CAAC,KAAK,KAAK,SAAS,IAAI,QAAQ,CAAC,KAAK,KAAK,QAAQ;YAAE,SAAS;QAC1E,MAAM,IAAI,GAAG,KAAK,CAAC,OAAO,CAAC,QAAQ,CAAC,EAAE,CAAC,CAAC,MAAM,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,CAAC,QAAQ,KAAK,QAAQ,CAAC,CAAC;QACrF,IAAI,IAAI,CAAC,MAAM,KAAK,CAAC;YAAE,SAAS;QAEhC,MAAM,MAAM,GAAG,QAAQ,CAAC,KAAK,KAAK,SAAS,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,QAAQ,CAAC;QACnE,IAAI,CAAC,qBAAqB,EAAE,GAAG,EAAE,CAAC,CAAC;YACjC,OAAO,EAAE,GAAG,MAAM,yBAAyB,IAAI,CAAC,MAAM,SAAS,IAAI,CAAC,MAAM,KAAK,CAAC,CAAC,CAAC,CAAC,YAAY,CAAC,CAAC,CAAC,aAAa,EAAE;YACjH,EAAE,EAAE,QAAQ,CAAC,QAAQ,IAAI,QAAQ,CAAC,EAAE;YACpC,KAAK,EAAE,CAAC,QAAQ,CAAC,EAAE,EAAE,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;YACpD,OAAO,EAAE,IAAI;iBACV,KAAK,CAAC,CAAC,EAAE,UAAU,CAAC;iBACpB,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,OAAO,CAAC,IAAI,CAAC,EAAE,EAAE,GAAG,IAAI,CAAC,WAAW,KAAK,IAAI,CAAC,IAAI,EAAE,CAAC,CAAC;YACvE,IAAI,EAAE,gEAAgE,IAAI,CAAC,MAAM,KAAK,CAAC,CAAC,CAAC,CAAC,eAAe,CAAC,CAAC,CAAC,gBAAgB,SAAS,QAAQ,CAAC,EAAE,EAAE;SACnJ,CAAC,CAAC,CAAC;IACN,CAAC;AACH,CAAC;AAED,gFAAgF;AAChF,gFAAgF;AAChF,gFAAgF;AAEhF,SAAS,aAAa,CAAC,KAAgB,EAAE,IAAU;IACjD,KAAK,MAAM,IAAI,IAAI,KAAK,CAAC,KAAK,EAAE,CAAC;QAC/B,IAAI,IAAI,CAAC,IAAI,KAAK,YAAY,IAAI,IAAI,CAAC,SAAS;YAAE,SAAS;QAC3D,MAAM,UAAU,GAAG,KAAK,CAAC,QAAQ,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;QAC3C,MAAM,WAAW,GAAG,KAAK,CAAC,QAAQ,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAC9C,IAAI,CAAC,UAAU,IAAI,CAAC,WAAW;YAAE,SAAS;QAC1C,iEAAiE;QACjE,yEAAyE;QACzE,yEAAyE;QACzE,yEAAyE;QACzE,oEAAoE;QACpE,IAAI,WAAW,CAAC,KAAK,KAAK,QAAQ;YAAE,SAAS;QAE7C,IAAI,UAAU,CAAC,KAAK,KAAK,SAAS,IAAI,UAAU,CAAC,KAAK,KAAK,SAAS,EAAE,CAAC;YACrE,IAAI,CAAC,mBAAmB,EAAE,GAAG,EAAE,CAAC,CAAC;gBAC/B,mEAAmE;gBACnE,4DAA4D;gBAC5D,OAAO,EAAE,GAAG,UAAU,CAAC,EAAE,qBAAqB,WAAW,CAAC,EAAE,uBAAuB,UAAU,CAAC,KAAK,EAAE;gBACrG,EAAE,EAAE,UAAU,CAAC,QAAQ,IAAI,UAAU,CAAC,EAAE;gBACxC,KAAK,EAAE,CAAC,UAAU,CAAC,EAAE,EAAE,WAAW,CAAC,EAAE,CAAC;gBACtC,OAAO,EAAE,CAAC,OAAO,CAAC,IAAI,CAAC,UAAU,EAAE,mCAAmC,CAAC,CAAC;gBACxE,IAAI,EAAE,QAAQ,UAAU,CAAC,EAAE,wCAAwC,WAAW,CAAC,EAAE,EAAE;aACpF,CAAC,CAAC,CAAC;YACJ,SAAS;QACX,CAAC;QAED,IAAI,UAAU,CAAC,KAAK,KAAK,SAAS,IAAI,CAAC,IAAI,CAAC,UAAU,CAAC,QAAQ,CAAC,UAAU,CAAC,IAAI,CAAC,EAAE,CAAC;YACjF,IAAI,CAAC,6BAA6B,EAAE,GAAG,EAAE,CAAC,CAAC;gBACzC,OAAO,EAAE,GAAG,UAAU,CAAC,EAAE,mCAAmC,WAAW,CAAC,EAAE,cAAc;gBACxF,EAAE,EAAE,UAAU,CAAC,QAAQ,IAAI,UAAU,CAAC,EAAE;gBACxC,KAAK,EAAE,CAAC,UAAU,CAAC,EAAE,EAAE,WAAW,CAAC,EAAE,CAAC;gBACtC,OAAO,EAAE,CAAC,OAAO,CAAC,IAAI,CAAC,UAAU,EAAE,QAAQ,WAAW,CAAC,EAAE,2BAA2B,CAAC,CAAC;gBACtF,IAAI,EAAE,uBAAuB,WAAW,CAAC,EAAE,QAAQ,UAAU,CAAC,IAAI,4CAA4C;aAC/G,CAAC,CAAC,CAAC;QACN,CAAC;IACH,CAAC;AACH,CAAC;AAED,gFAAgF;AAChF,gFAAgF;AAChF,gFAAgF;AAEhF,SAAS,cAAc,CAAC,KAAgB,EAAE,IAAU;IAClD,KAAK,MAAM,IAAI,IAAI,KAAK,CAAC,KAAK,EAAE,CAAC;QAC/B,IAAI,IAAI,CAAC,SAAS,CAAC,MAAM,KAAK,CAAC;YAAE,SAAS;QAC1C,IAAI,CAAC,gBAAgB,EAAE,GAAG,EAAE,CAAC,CAAC;YAC5B,OAAO,EAAE,iBAAiB,IAAI,CAAC,WAAW,qBAAqB,eAAe,CAAC,IAAI,CAAC,EAAE;YACtF,EAAE,EAAE,IAAI,CAAC,QAAQ,CAAC,EAAE;YACpB,KAAK,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC;YAChB,OAAO,EAAE,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,CAAC,MAAM,EAAE,EAAE,CACrC,OAAO,CAAC,MAAM,CAAC,EAAE,EAAE,GAAG,MAAM,CAAC,MAAM,SAAS,MAAM,CAAC,WAAW,GAAG,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,KAAK,MAAM,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CACxG;YACD,IAAI,EAAE,qDAAqD,IAAI,CAAC,QAAQ,EAAE;SAC3E,CAAC,CAAC,CAAC;IACN,CAAC;AACH,CAAC;AAED,SAAS,eAAe,CAAC,IAAc;IACrC,MAAM,KAAK,GAAG,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,CAAC,MAAM,EAAE,EAAE,CAAC,KAAK,MAAM,CAAC,MAAM,WAAW,MAAM,CAAC,WAAW,EAAE,CAAC,CAAC;IAChG,OAAO,KAAK,CAAC,MAAM,KAAK,CAAC,CAAC,CAAC,CAAE,KAAK,CAAC,CAAC,CAAY,CAAC,CAAC,CAAC,GAAG,KAAK,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,QAAQ,KAAK,CAAC,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC,EAAE,CAAC;AACvH,CAAC;AAED,gFAAgF;AAChF,gFAAgF;AAChF,gFAAgF;AAEhF;;;;;;GAMG;AACH,SAAS,cAAc,CAAC,KAAgB,EAAE,IAAU;IAClD,KAAK,MAAM,IAAI,IAAI,KAAK,CAAC,KAAK,EAAE,CAAC;QAC/B,IAAI,CAAC,IAAI,CAAC,SAAS,IAAI,IAAI,CAAC,IAAI,KAAK,UAAU;YAAE,SAAS;QAC1D,MAAM,MAAM,GAAG,WAAW,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACtC,IAAI,CAAC,MAAM,CAAC,mBAAmB,IAAI,CAAC,MAAM,CAAC,WAAW;YAAE,SAAS;QACjE,MAAM,IAAI,GAAG,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACnC,IAAI,CAAC,IAAI;YAAE,SAAS;QAEpB,IAAI,CAAC,gBAAgB,EAAE,GAAG,EAAE,CAAC,CAAC;YAC5B,OAAO,EAAE,GAAG,QAAQ,CAAC,IAAI,CAAC,IAAI,MAAM,CAAC,MAAM,SAAS;YACpD,EAAE,EAAE,IAAI,CAAC,UAAU;YACnB,KAAK,EAAE,CAAC,IAAI,CAAC,IAAI,CAAC;YAClB,OAAO,EAAE,EAAE;YACX,IAAI,EAAE,MAAM,CAAC,mBAAmB;gBAC9B,CAAC,CAAC,+FAA+F;gBACjG,CAAC,CAAC,sEAAsE;SAC3E,CAAC,CAAC,CAAC;IACN,CAAC;AACH,CAAC;AAED,gFAAgF;AAChF,gFAAgF;AAChF,gFAAgF;AAEhF,SAAS,QAAQ,CAAC,IAAc;IAC9B,OAAO,IAAI,CAAC,IAAI,KAAK,UAAU,CAAC,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,QAAQ,KAAK,QAAQ,CAAC,IAAI,CAAC,IAAI,EAAE,EAAE,CAAC,GAAG,CAAC;AAC9F,CAAC;AAED,SAAS,QAAQ,CAAC,IAAY,EAAE,KAAa;IAC3C,OAAO,IAAI,CAAC,MAAM,IAAI,KAAK,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,EAAE,KAAK,GAAG,CAAC,CAAC,KAAK,CAAC;AACxE,CAAC;AAED,SAAS,YAAY,CAAC,QAAkC;IACtD,OAAO,QAAQ,EAAE,SAAS,CAAC,CAAC,CAAC,MAAM,QAAQ,CAAC,SAAS,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC;AACjE,CAAC;AAED,SAAS,OAAO,CAAC,EAAa,EAAE,IAAY;IAC1C,OAAO,EAAE,EAAE,EAAE,IAAI,EAAE,CAAC;AACtB,CAAC;AAED,MAAM,cAAc,GAAuD,EAAE,KAAK,EAAE,CAAC,EAAE,IAAI,EAAE,CAAC,EAAE,IAAI,EAAE,CAAC,EAAE,CAAC;AAE1G;;;;;GAKG;AACH,MAAM,UAAU,eAAe,CAAC,WAAkC;IAChE,OAAO,CAAC,GAAG,WAAW,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE;QACpC,MAAM,UAAU,GAAG,cAAc,CAAC,CAAC,CAAC,QAAQ,CAAC,GAAG,cAAc,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC;QAC3E,IAAI,UAAU,KAAK,CAAC;YAAE,OAAO,UAAU,CAAC;QACxC,IAAI,CAAC,CAAC,EAAE,CAAC,IAAI,KAAK,CAAC,CAAC,EAAE,CAAC,IAAI;YAAE,OAAO,CAAC,CAAC,EAAE,CAAC,IAAI,GAAG,CAAC,CAAC,EAAE,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QACnE,IAAI,CAAC,CAAC,EAAE,CAAC,IAAI,CAAC,KAAK,CAAC,IAAI,KAAK,CAAC,CAAC,EAAE,CAAC,IAAI,CAAC,KAAK,CAAC,IAAI;YAAE,OAAO,CAAC,CAAC,EAAE,CAAC,IAAI,CAAC,KAAK,CAAC,IAAI,GAAG,CAAC,CAAC,EAAE,CAAC,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC;QACtG,IAAI,CAAC,CAAC,EAAE,CAAC,IAAI,CAAC,KAAK,CAAC,MAAM,KAAK,CAAC,CAAC,EAAE,CAAC,IAAI,CAAC,KAAK,CAAC,MAAM;YAAE,OAAO,CAAC,CAAC,EAAE,CAAC,IAAI,CAAC,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC,EAAE,CAAC,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC;QAC9G,IAAI,CAAC,CAAC,IAAI,KAAK,CAAC,CAAC,IAAI;YAAE,OAAO,CAAC,CAAC,IAAI,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QACvD,OAAO,CAAC,CAAC,OAAO,GAAG,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,OAAO,GAAG,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IACpE,CAAC,CAAC,CAAC;AACL,CAAC;AAED,2EAA2E;AAC3E,MAAM,CAAC,MAAM,YAAY,GAA8C,MAAM,CAAC,MAAM,CAAC;IACnF,gBAAgB,EAAE,sFAAsF;IACxG,eAAe,EAAE,mFAAmF;IACpG,qBAAqB,EAAE,iEAAiE;IACxF,gBAAgB,EAAE,2EAA2E;CAC9F,CAAC,CAAC","sourcesContent":["/**\n * The built-in diagnostics.\n *\n * Two of them - the two the whole project exists for - are written as selector\n * queries rather than as bespoke traversals. That is not a stunt: it is the\n * proof that the query language is expressive enough to be worth exposing. A\n * team whose convention spec-graph never anticipated can write the equivalent\n * of a built-in rule on the command line.\n *\n * ```text\n * ghost-handover  *[openness!=closed][phase!=retired] -delegates-to,blocked-by-> *[receptivity=sealed]\n * stale-premise   *[phase!=retired] -depends-on,assumes,amends,blocked-by-> document[phase=retired]\n * ```\n *\n * The rest are not path queries and are not pretended to be: dangling\n * references never became edges, and a cycle is not a fixed-length path.\n *\n * Every rule here obeys one discipline - **report the place a human can fix**.\n * For a supersession that the superseded document never acknowledged, that is\n * the superseded document, not the one that declared the relation.\n */\n\nimport { OBLIGATION_EDGES, type SpecGraph } from './graph.js';\nimport { dirnamePosix, resolveFrom } from './paths.js';\nimport { execute, parseQuery, type QuerySpec } from './select.js';\nimport type { ResolvedCorpus } from './resolve.js';\nimport type {\n  DanglingRef,\n  Diagnostic,\n  DocumentNode,\n  Edge,\n  ItemNode,\n  RelatedLocation,\n  RuleId,\n  Severity,\n  SourceRef,\n  SpecNode,\n} from './types.js';\nimport { EDGE_TRAITS } from './types.js';\n\n/* -------------------------------------------------------------------------- */\n/* Configuration                                                              */\n/* -------------------------------------------------------------------------- */\n\nexport const DEFAULT_SEVERITIES: Readonly<Record<RuleId, Severity>> = Object.freeze({\n  'ghost-handover': 'error',\n  'stale-premise': 'error',\n  'broken-reference': 'error',\n  'reference-outside-corpus': 'warn',\n  'ambiguous-reference': 'warn',\n  'circular-delegation': 'error',\n  'orphaned-obligation': 'error',\n  'live-supersession': 'error',\n  'unreciprocated-supersession': 'warn',\n  'state-conflict': 'warn',\n  'self-reference': 'info',\n  'unknown-relation-key': 'warn',\n});\n\nexport const RULE_IDS = Object.keys(DEFAULT_SEVERITIES) as readonly RuleId[];\n\n/** One-line descriptions, printed by `spec-graph rules`. */\nexport const RULE_DESCRIPTIONS: Readonly<Record<RuleId, string>> = Object.freeze({\n  'ghost-handover': 'an open obligation is handed to a document that can no longer absorb it',\n  'stale-premise': 'a live document rests on a decision that has been retired or obviated',\n  'broken-reference': 'a citation names a document or anchor that does not exist',\n  'reference-outside-corpus': 'a citation names a real document the include patterns did not reach',\n  'ambiguous-reference': 'a citation matches more than one document',\n  'circular-delegation': 'obligations or supersessions form a cycle, so none of them can ever land',\n  'orphaned-obligation': 'a retired or frozen document still holds open obligations',\n  'live-supersession': 'a document has been superseded but still presents itself as current',\n  'unreciprocated-supersession': 'a retired document does not say what replaced it',\n  'state-conflict': 'an item declares two states that disagree about whether work remains',\n  'self-reference': 'a document delegates to or depends on itself',\n  'unknown-relation-key': 'a front-matter key reads as a relation but declares none',\n});\n\n/**\n * The severity map `--strict` implies, and which rules it actually moved.\n *\n * Strict raises `warn` to `error` and leaves `info` alone. That asymmetry is\n * deliberate: the `info` rules are advisory by nature - a self-link in a table\n * of contents is a formatting quirk - and promoting them would resurrect\n * precisely the false-positive problem ADR-0006 exists to prevent.\n *\n * An explicit `--rule` always wins over strict, so `--strict --rule x=warn`\n * keeps `x` at warn. That is what makes strict usable: a team can turn it on\n * and exempt the one rule their repository disagrees with, rather than choosing\n * between all of it and none of it.\n */\nexport function resolveStrict(\n  overrides: Partial<Record<RuleId, Severity>> = {},\n  strict = false,\n): { severities: Partial<Record<RuleId, Severity>>; escalated: ReadonlySet<RuleId> } {\n  const severities: Partial<Record<RuleId, Severity>> = { ...overrides };\n  const escalated = new Set<RuleId>();\n  if (!strict) return { severities, escalated };\n\n  for (const id of RULE_IDS) {\n    if (overrides[id] !== undefined) continue;\n    if (DEFAULT_SEVERITIES[id] !== 'warn') continue;\n    severities[id] = 'error';\n    escalated.add(id);\n  }\n  return { severities, escalated };\n}\n\nexport interface RuleOptions {\n  readonly severities?: Partial<Record<RuleId, Severity>> | undefined;\n  /** Cap on related locations attached to one finding. */\n  readonly maxRelated?: number | undefined;\n}\n\nconst DEFAULT_MAX_RELATED = 8;\n\n/* -------------------------------------------------------------------------- */\n/* Entry point                                                                */\n/* -------------------------------------------------------------------------- */\n\n/** Runs every enabled rule and returns findings in report order. */\nexport function runRules(graph: SpecGraph, corpus: ResolvedCorpus, options: RuleOptions = {}): Diagnostic[] {\n  const severities = { ...DEFAULT_SEVERITIES, ...(options.severities ?? {}) };\n  const maxRelated = options.maxRelated ?? DEFAULT_MAX_RELATED;\n  const out: Diagnostic[] = [];\n\n  const emit = (rule: RuleId, build: () => Built): void => {\n    const severity = severities[rule];\n    if (severity === 'off') return;\n    const body = build();\n    if (exempt(graph, rule, body.nodes)) return;\n    // `target` ahead of the spread: a rule that names one overrides the default,\n    // and the eight that have nothing to name say nothing.\n    out.push({ rule, severity, target: null, ...body, related: body.related.slice(0, maxRelated) });\n  };\n\n  // Ghost handovers are reported first and claim their edges, because\n  // `blocked-by` is both obligation-transferring and load-bearing: without this,\n  // one open question blocked by an archived decision would produce two\n  // findings on the same line, for the same defect, with the same fix.\n  const claimed = ghostHandovers(graph, emit);\n  stalePremises(graph, emit, claimed);\n  brokenReferences(corpus, emit);\n  circularDelegations(graph, emit);\n  orphanedObligations(graph, emit, maxRelated);\n  supersessions(graph, emit);\n  stateConflicts(graph, emit);\n  misreadKeys(corpus, emit);\n  selfReferences(graph, emit);\n\n  return sortDiagnostics(out);\n}\n\n/** What a rule returns: the finding, minus what `emit` knows better. */\ntype Built = Omit<Diagnostic, 'rule' | 'severity' | 'target'> & { readonly target?: string };\n\ntype Emit = (rule: RuleId, build: () => Built) => void;\n\n/**\n * Rules about what a document cites, rather than about what it owes.\n *\n * These are the ones a historical record still answers for. A link that goes\n * nowhere is broken whoever wrote it and whenever they wrote it.\n */\nconst REFERENCE_RULES: ReadonlySet<RuleId> = new Set<RuleId>([\n  'broken-reference',\n  'reference-outside-corpus',\n  'ambiguous-reference',\n  // A key that declares no relation is a citation that did not happen, which a\n  // journal answers for as squarely as a link that goes nowhere. ADR-0011 keeps\n  // a record's obligations out of the report, not its references.\n  'unknown-relation-key',\n]);\n\n/**\n * Whether a finding is about history rather than about work.\n *\n * A record reports that something was decided; it does not decide anything. Its\n * open checkboxes are minutes, its delegations are things that were said, and\n * its lifecycle is not a lifecycle. So a record is never the *subject* of a\n * finding about obligations or lifecycle - though it is still a legitimate\n * target of one, because delegating live work into a log is exactly the ghost\n * handover this tool exists to find.\n *\n * Stated once, here, rather than as a guard repeated in eight rules: the\n * exemption is a property of what counts as a finding, not of any one rule, and\n * a rule added later inherits it without having to remember. See ADR-0011.\n */\nfunction exempt(graph: SpecGraph, rule: RuleId, nodes: readonly string[]): boolean {\n  if (REFERENCE_RULES.has(rule)) return false;\n  const subject = nodes[0];\n  if (subject === undefined) return false;\n  return graph.owningDocument(subject)?.phase === 'record';\n}\n\n/* -------------------------------------------------------------------------- */\n/* Ghost handovers                                                            */\n/* -------------------------------------------------------------------------- */\n\n/**\n * The flagship failure mode: an obligation handed into a closed ledger.\n *\n * The source must still be open and must not itself be retired - a retired\n * document delegating to another retired document is history, not a defect,\n * and reporting it would bury the live findings underneath the archive.\n */\nconst GHOST_HANDOVER: QuerySpec = parseQuery(\n  '*[openness!=closed][phase!=retired] -delegates-to,blocked-by-> *[receptivity=sealed]',\n);\n\n/** Emits ghost-handover findings and returns the edges they account for. */\nfunction ghostHandovers(graph: SpecGraph, emit: Emit): Set<string> {\n  const claimed = new Set<string>();\n  for (const match of execute(graph, GHOST_HANDOVER)) {\n    const source = match.nodes[0] as SpecNode;\n    const target = match.nodes[1] as SpecNode;\n    const edge = match.edges[0] as Edge;\n    const targetDocument = graph.owningDocument(target.id);\n    if (!targetDocument) continue;\n\n    const sealed = SEALED_WORD[targetDocument.phase] ?? 'frozen';\n    const what = source.kind === 'item' ? 'open obligation' : 'obligation';\n    const verb = EDGE_TRAITS[edge.kind].phrase;\n    claimed.add(edgeKey(edge));\n\n    emit('ghost-handover', () => ({\n      message: `${what} ${verb} ${describe(target)}, which is ${sealed}`,\n      at: edge.declaredAt,\n      nodes: [source.id, target.id],\n      related: [\n        related(targetDocument.statusAt ?? targetDocument.at, `${targetDocument.id} is ${sealed}${statusSuffix(targetDocument)}`),\n        ...(source.kind === 'item' ? [related(source.at, `the obligation: ${source.text}`)] : []),\n      ],\n      hint: HANDOVER_HINT[targetDocument.phase]?.(targetDocument.id) ?? FROZEN_HINT(targetDocument.id),\n    }));\n  }\n  return claimed;\n}\n\n/** How a sealed target is described in a ghost-handover message. */\nconst SEALED_WORD: Readonly<Partial<Record<string, string>>> = {\n  retired: 'retired',\n  record: 'a historical record',\n};\n\nconst FROZEN_HINT = (id: string): string =>\n  `${id} is frozen and cannot take on new work - open an amendment, or close this here`;\n\n/** What to do about work handed into each kind of sealed document. */\nconst HANDOVER_HINT: Readonly<Partial<Record<string, (id: string) => string>>> = {\n  retired: (id) => `nothing will be read from ${id} again - re-home this in a live document, or close it here`,\n  record: (id) => `${id} is a log of what happened and will never act - re-home this in a live document`,\n};\n\n/** Identity of a relation, for the hand-off between overlapping rules. */\nfunction edgeKey(edge: Edge): string {\n  return `${edge.kind} ${edge.from} ${edge.to}`;\n}\n\n/* -------------------------------------------------------------------------- */\n/* Stale premises                                                             */\n/* -------------------------------------------------------------------------- */\n\n/**\n * A live document resting on something that stopped being true.\n *\n * Only load-bearing relations count. A \"See also\" pointing at a superseded ADR\n * is ordinary cross-referencing; `assumes` pointing at the same document means\n * somebody is designing around a constraint that was abolished.\n */\nconst STALE_PREMISE_DOCUMENT: QuerySpec = parseQuery(\n  '*[phase!=retired] -depends-on,assumes,amends,blocked-by-> document[phase=retired]',\n);\nconst STALE_PREMISE_ITEM: QuerySpec = parseQuery(\n  '*[phase!=retired] -depends-on,assumes,amends,blocked-by-> item[state=obviated]',\n);\n\nfunction stalePremises(graph: SpecGraph, emit: Emit, claimed: ReadonlySet<string>): void {\n  const seen = new Set<string>();\n  for (const spec of [STALE_PREMISE_DOCUMENT, STALE_PREMISE_ITEM]) {\n    for (const match of execute(graph, spec)) {\n      const source = match.nodes[0] as SpecNode;\n      const target = match.nodes[1] as SpecNode;\n      const edge = match.edges[0] as Edge;\n      // Already reported as a ghost handover, which says the same thing in the\n      // terms the reader needs.\n      if (claimed.has(edgeKey(edge))) continue;\n      const key = `${source.id}>${target.id}>${edge.kind}`;\n      if (seen.has(key)) continue;\n      seen.add(key);\n\n      const targetDocument = graph.owningDocument(target.id);\n      const because =\n        target.kind === 'item'\n          ? 'that question was obviated - its premise no longer holds'\n          : `${target.id} is retired${statusSuffix(targetDocument)}`;\n\n      emit('stale-premise', () => ({\n        message: `${describe(source)} ${EDGE_TRAITS[edge.kind].phrase} ${describe(target)}, which no longer holds`,\n        at: edge.declaredAt,\n        nodes: [source.id, target.id],\n        // Point at the status line when there is one: that is the sentence that\n        // makes the premise stale, and repeating the document's first line\n        // underneath it adds nothing.\n        related: [related(target.kind === 'document' ? (targetDocument?.statusAt ?? target.at) : target.at, because)],\n        hint: `re-check this dependency: the constraint it assumes may have been lifted when ${target.kind === 'item' ? 'the question closed' : `${target.id} was retired`}`,\n      }));\n    }\n  }\n}\n\n/* -------------------------------------------------------------------------- */\n/* Reference integrity                                                        */\n/* -------------------------------------------------------------------------- */\n\n/**\n * Keys that read as relations and declared none.\n *\n * The only rule here that is about the text rather than about the graph, and it\n * earns the place by what its absence costs: the finding is that an edge the\n * author wrote down is *not* in the graph, and a missing edge is invisible in a\n * report that says everything is consistent. Nothing else would ever mention it.\n */\nfunction misreadKeys(corpus: ResolvedCorpus, emit: Emit): void {\n  for (const misread of corpus.misreadKeys) {\n    emit('unknown-relation-key', () => ({\n      message: `\"${misread.key}\" declares no relation`,\n      at: misread.at,\n      nodes: [misread.from],\n      // The key, so two misspellings in one document are two findings rather\n      // than one with a count of two - `nodes` names the document and nothing\n      // else here names which key.\n      target: misread.key,\n      related: [],\n      hint: `spell it ${misread.suggestion}, or move it out of front matter if it is not a relation`,\n    }));\n  }\n}\n\nfunction brokenReferences(corpus: ResolvedCorpus, emit: Emit): void {\n  for (const ref of corpus.dangling) {\n    if (ref.reason === 'ambiguous') {\n      emit('ambiguous-reference', () => ({\n        message: `\"${ref.target}\" matches ${ref.candidates.length} documents`,\n        at: ref.declaredAt,\n        nodes: [ref.from],\n        target: ref.target,\n        related: [],\n        hint: `disambiguate it - candidates: ${ref.candidates.join(', ')}`,\n      }));\n      continue;\n    }\n\n    // A link to a file that exists but was not included is a configuration\n    // problem: the graph is not broken, the corpus is just incomplete. Reporting\n    // it as an error means a repository whose specifications live somewhere the\n    // default patterns miss fails on its first run, for something the user has\n    // not done wrong.\n    const rule: RuleId = ref.reason === 'not-a-spec' ? 'reference-outside-corpus' : 'broken-reference';\n\n    emit(rule, () => ({\n      message: brokenMessage(ref),\n      at: ref.declaredAt,\n      nodes: [ref.from],\n      target: ref.target,\n      related: [],\n      hint: brokenHint(ref),\n    }));\n  }\n}\n\nfunction brokenMessage(ref: DanglingRef): string {\n  switch (ref.reason) {\n    case 'unknown-anchor':\n      return `\"${ref.target}\" points at an anchor that does not exist`;\n    case 'not-a-spec':\n      return `\"${ref.target}\" resolves to a file that is not a specification`;\n    default:\n      return `\"${ref.target}\" does not resolve to any document`;\n  }\n}\n\nfunction brokenHint(ref: DanglingRef): string {\n  if (ref.candidates.length > 0) return `did you mean ${ref.candidates.slice(0, 3).join(', ')}?`;\n  // A wiki link carries no path, only a name, so whether it means a document at\n  // all is a repository convention. Naming the flag here is what keeps that a\n  // one-run discovery rather than a support question.\n  if (ref.raw.startsWith('[[') && ref.reason === 'unknown-target') {\n    return `fix the identifier, or - if [[...]] tags a concept here - exclude it: --ignore-ref \"${suggestReferenceGlob(ref.target)}\"`;\n  }\n  switch (ref.reason) {\n    case 'unknown-anchor':\n      return 'check the heading or item id it is meant to address';\n    case 'not-a-spec':\n      // Name the pattern that would include it: \"widen your patterns\" is advice\n      // the reader then has to translate, and this is the translation.\n      return `include it, for example: spec-graph \"${suggestPattern(ref)}\"`;\n    default:\n      return 'fix the identifier, or add the document it names';\n  }\n}\n\n/**\n * A glob covering the family of concept tags a target belongs to.\n *\n * `trap 55` suggests `trap *` rather than `trap 55`, because these tags come in\n * numbered series and excluding them one at a time is not a fix anybody would\n * accept. A target with no trailing number is suggested verbatim.\n */\nfunction suggestReferenceGlob(target: string): string {\n  const trimmed = target.trim();\n  const series = /^(.*?)[\\s._-]*\\d+$/.exec(trimmed);\n  const stem = series?.[1]?.trim();\n  return stem !== undefined && stem.length > 0 ? `${stem} *` : trimmed;\n}\n\n/**\n * The narrowest include pattern that would reach a target the corpus missed.\n *\n * Built from the *resolved* repository-relative path, not the link as written:\n * `../notes.md` cited from `docs/adr/` needs `docs/**\\/*.md`, and suggesting\n * `../**\\/*.md` would be worse than saying nothing.\n */\nfunction suggestPattern(ref: DanglingRef): string {\n  const withoutAnchor = (ref.target.split('#')[0] ?? ref.target).trim();\n  const resolved = resolveFrom(ref.declaredAt.file, withoutAnchor);\n  const directory = dirnamePosix(resolved);\n  return directory.length > 0 ? `${directory}/**/*.md` : '**/*.md';\n}\n\n/* -------------------------------------------------------------------------- */\n/* Cycles                                                                     */\n/* -------------------------------------------------------------------------- */\n\nfunction circularDelegations(graph: SpecGraph, emit: Emit): void {\n  const kinds = [...OBLIGATION_EDGES, 'supersedes' as const];\n  // Projected onto documents, so a question handed back and forth between two\n  // of them is found even though each delegation runs item -> document and the\n  // raw graph therefore contains no cycle at all.\n  for (const component of graph.cycles(kinds, { byDocument: true })) {\n    const members = component\n      .map((id) => graph.document(id))\n      .filter((node): node is DocumentNode => node !== undefined);\n    if (members.length < 2) continue;\n    // A cycle is a set, not a subject, so the exemption at `emit` cannot see it.\n    // One record in the loop means the loop is partly a report of what was once\n    // said, and nothing in it is owed by anybody.\n    if (members.some((member) => member.phase === 'record')) continue;\n\n    const edges = cycleEdges(graph, component, kinds);\n    const onlySupersession = edges.length > 0 && edges.every((edge) => edge.kind === 'supersedes');\n    const head = members[0] as DocumentNode;\n\n    emit('circular-delegation', () => ({\n      message: onlySupersession\n        ? `supersession cycle across ${members.length} documents`\n        : `delegation cycle across ${members.length} documents: nothing in it can ever land`,\n      at: edges[0]?.declaredAt ?? head.at,\n      nodes: component,\n      related: edges.map((edge) => related(edge.declaredAt, `${edge.from} ${EDGE_TRAITS[edge.kind].phrase} ${edge.to}`)),\n      hint: 'break the loop: one of these must own the work outright, or be closed',\n    }));\n  }\n}\n\n/**\n * The relations that keep a component strongly connected.\n *\n * Membership is by owning document, because the component is a projection: the\n * edge that closes the loop is usually written on an item, and that is the line\n * the report has to point at.\n */\nfunction cycleEdges(graph: SpecGraph, component: readonly string[], kinds: readonly Edge['kind'][]): Edge[] {\n  const inside = new Set(component);\n  const owner = (id: string): string => graph.owningDocument(id)?.id ?? id;\n  const out: Edge[] = [];\n  for (const edge of graph.edges) {\n    if (!kinds.includes(edge.kind)) continue;\n    const from = owner(edge.from);\n    const to = owner(edge.to);\n    if (from !== to && inside.has(from) && inside.has(to)) out.push(edge);\n  }\n  return out;\n}\n\n/* -------------------------------------------------------------------------- */\n/* Orphaned obligations                                                       */\n/* -------------------------------------------------------------------------- */\n\n/**\n * The black hole itself: a document nobody reads any more, still holding work.\n *\n * Reported once per document rather than once per item. Five findings that all\n * say \"this archived ADR has open questions\" is five times the noise and none\n * of the extra information.\n */\nfunction orphanedObligations(graph: SpecGraph, emit: Emit, maxRelated: number): void {\n  for (const document of graph.documents) {\n    if (document.phase !== 'retired' && document.phase !== 'frozen') continue;\n    const open = graph.itemsOf(document.id).filter((item) => item.openness !== 'closed');\n    if (open.length === 0) continue;\n\n    const sealed = document.phase === 'retired' ? 'retired' : 'frozen';\n    emit('orphaned-obligation', () => ({\n      message: `${sealed} document still holds ${open.length} open ${open.length === 1 ? 'obligation' : 'obligations'}`,\n      at: document.statusAt ?? document.at,\n      nodes: [document.id, ...open.map((item) => item.id)],\n      related: open\n        .slice(0, maxRelated)\n        .map((item) => related(item.at, `${item.disposition}: ${item.text}`)),\n      hint: `move each one to a live document or close it - as it stands, ${open.length === 1 ? 'it disappears' : 'they disappear'} with ${document.id}`,\n    }));\n  }\n}\n\n/* -------------------------------------------------------------------------- */\n/* Supersession consistency                                                   */\n/* -------------------------------------------------------------------------- */\n\nfunction supersessions(graph: SpecGraph, emit: Emit): void {\n  for (const edge of graph.edges) {\n    if (edge.kind !== 'supersedes' || edge.reflexive) continue;\n    const superseded = graph.document(edge.to);\n    const superseding = graph.document(edge.from);\n    if (!superseded || !superseding) continue;\n    // A record narrating \"ADR-0005 replaced ADR-0001\" is reporting a\n    // supersession, not declaring one. Both hints below ask somebody to edit\n    // the document that made the claim, and a log is the one document nobody\n    // can edit - it says what was true when it was written. The exemption at\n    // `emit` cannot see this: the subject here is the *other* document.\n    if (superseding.phase === 'record') continue;\n\n    if (superseded.phase !== 'retired' && superseded.phase !== 'unknown') {\n      emit('live-supersession', () => ({\n        // The fix belongs in the superseded document, so that is where the\n        // finding points - not at the document that made the claim.\n        message: `${superseded.id} is superseded by ${superseding.id} but still reads as ${superseded.phase}`,\n        at: superseded.statusAt ?? superseded.at,\n        nodes: [superseded.id, superseding.id],\n        related: [related(edge.declaredAt, `the supersession is declared here`)],\n        hint: `mark ${superseded.id} as superseded, or drop the claim in ${superseding.id}`,\n      }));\n      continue;\n    }\n\n    if (superseded.phase === 'retired' && !edge.declaredIn.includes(superseded.path)) {\n      emit('unreciprocated-supersession', () => ({\n        message: `${superseded.id} is retired but never says that ${superseding.id} replaced it`,\n        at: superseded.statusAt ?? superseded.at,\n        nodes: [superseded.id, superseding.id],\n        related: [related(edge.declaredAt, `only ${superseding.id} records the relationship`)],\n        hint: `add \"superseded-by: ${superseding.id}\" to ${superseded.path} so a reader who lands there is redirected`,\n      }));\n    }\n  }\n}\n\n/* -------------------------------------------------------------------------- */\n/* Item state                                                                 */\n/* -------------------------------------------------------------------------- */\n\nfunction stateConflicts(graph: SpecGraph, emit: Emit): void {\n  for (const item of graph.items) {\n    if (item.conflicts.length === 0) continue;\n    emit('state-conflict', () => ({\n      message: `item reads as ${item.disposition} but also carries ${describeSignals(item)}`,\n      at: item.evidence.at,\n      nodes: [item.id],\n      related: item.conflicts.map((signal) =>\n        related(signal.at, `${signal.source} says ${signal.disposition}${signal.raw ? `: ${signal.raw}` : ''}`),\n      ),\n      hint: `make the two agree - spec-graph is treating it as ${item.openness}`,\n    }));\n  }\n}\n\nfunction describeSignals(item: ItemNode): string {\n  const parts = item.conflicts.map((signal) => `a ${signal.source} saying ${signal.disposition}`);\n  return parts.length === 1 ? (parts[0] as string) : `${parts.slice(0, -1).join(', ')} and ${parts[parts.length - 1]}`;\n}\n\n/* -------------------------------------------------------------------------- */\n/* Self references                                                            */\n/* -------------------------------------------------------------------------- */\n\n/**\n * A document that delegates to, or depends on, itself.\n *\n * Almost always a copied link that was never repointed. Informational, because\n * a self-link in a table of contents is harmless - but a *delegation* to self\n * means an obligation that looks handed off and was not.\n */\nfunction selfReferences(graph: SpecGraph, emit: Emit): void {\n  for (const edge of graph.edges) {\n    if (!edge.reflexive || edge.kind === 'contains') continue;\n    const traits = EDGE_TRAITS[edge.kind];\n    if (!traits.transfersObligation && !traits.loadBearing) continue;\n    const node = graph.node(edge.from);\n    if (!node) continue;\n\n    emit('self-reference', () => ({\n      message: `${describe(node)} ${traits.phrase} itself`,\n      at: edge.declaredAt,\n      nodes: [edge.from],\n      related: [],\n      hint: traits.transfersObligation\n        ? 'this obligation looks delegated but never left - point it at another document, or own it here'\n        : 'a document cannot depend on itself - repoint or remove the reference',\n    }));\n  }\n}\n\n/* -------------------------------------------------------------------------- */\n/* Helpers                                                                    */\n/* -------------------------------------------------------------------------- */\n\nfunction describe(node: SpecNode): string {\n  return node.kind === 'document' ? node.id : `${node.document} \"${truncate(node.text, 48)}\"`;\n}\n\nfunction truncate(text: string, limit: number): string {\n  return text.length <= limit ? text : `${text.slice(0, limit - 3)}...`;\n}\n\nfunction statusSuffix(document: DocumentNode | undefined): string {\n  return document?.rawStatus ? ` (\"${document.rawStatus}\")` : '';\n}\n\nfunction related(at: SourceRef, note: string): RelatedLocation {\n  return { at, note };\n}\n\nconst SEVERITY_ORDER: Readonly<Record<Exclude<Severity, 'off'>, number>> = { error: 0, warn: 1, info: 2 };\n\n/**\n * Total ordering, so two runs on the same corpus produce byte-identical output.\n *\n * CI output that reorders between runs cannot be diffed, and output that cannot\n * be diffed stops being read.\n */\nexport function sortDiagnostics(diagnostics: readonly Diagnostic[]): Diagnostic[] {\n  return [...diagnostics].sort((a, b) => {\n    const bySeverity = SEVERITY_ORDER[a.severity] - SEVERITY_ORDER[b.severity];\n    if (bySeverity !== 0) return bySeverity;\n    if (a.at.file !== b.at.file) return a.at.file < b.at.file ? -1 : 1;\n    if (a.at.span.start.line !== b.at.span.start.line) return a.at.span.start.line - b.at.span.start.line;\n    if (a.at.span.start.column !== b.at.span.start.column) return a.at.span.start.column - b.at.span.start.column;\n    if (a.rule !== b.rule) return a.rule < b.rule ? -1 : 1;\n    return a.message < b.message ? -1 : a.message > b.message ? 1 : 0;\n  });\n}\n\n/** The selector equivalent of a rule, for `spec-graph rules --explain`. */\nexport const RULE_QUERIES: Readonly<Partial<Record<RuleId, string>>> = Object.freeze({\n  'ghost-handover': '*[openness!=closed][phase!=retired] -delegates-to,blocked-by-> *[receptivity=sealed]',\n  'stale-premise': '*[phase!=retired] -depends-on,assumes,amends,blocked-by-> document[phase=retired]',\n  'orphaned-obligation': 'document[receptivity=sealed] -contains-> item[openness!=closed]',\n  'self-reference': 'see --format json; reflexive edges are excluded from traversal by default',\n});\n"]}

package/dist/types.d.ts

@@ -246,8 +246,27 @@ export interface DanglingRef {
     /** Candidate ids when `reason` is `ambiguous`, or near-misses otherwise. */
     readonly candidates: readonly string[];
 }
+/**
+ * A front-matter key that reads as a relation and is not one.
+ *
+ * Front matter is an open vocabulary - `title`, `tags`, `sidebar_position` and
+ * whatever else the site generator wants all live there - so an unrecognised key
+ * is normally none of spec-graph's business. This is the exception: a key one
+ * character away from a relation, carrying something shaped like a citation, is
+ * a relation the author believes they declared. The edge does not exist, and
+ * nothing else would ever say so.
+ */
+export interface MisreadKey {
+    /** The key as written. */
+    readonly key: string;
+    /** The relation key it is a hair away from. */
+    readonly suggestion: string;
+    /** The document the key was written in. */
+    readonly from: string;
+    readonly at: SourceRef;
+}
 export type Severity = 'error' | 'warn' | 'info' | 'off';
-export type RuleId = 'ghost-handover' | 'stale-premise' | 'broken-reference' | 'reference-outside-corpus' | 'ambiguous-reference' | 'circular-delegation' | 'orphaned-obligation' | 'unreciprocated-supersession' | 'live-supersession' | 'state-conflict' | 'self-reference';
+export type RuleId = 'ghost-handover' | 'stale-premise' | 'broken-reference' | 'reference-outside-corpus' | 'ambiguous-reference' | 'circular-delegation' | 'orphaned-obligation' | 'unreciprocated-supersession' | 'live-supersession' | 'state-conflict' | 'self-reference' | 'unknown-relation-key';
 export interface RelatedLocation {
     readonly at: SourceRef;
     readonly note: string;
@@ -262,12 +281,13 @@ export interface Diagnostic {
     /** Node ids involved, most relevant first. */
     readonly nodes: readonly string[];
     /**
-     * The citation this finding is about, for the rules that are about one.
+     * What within the document this finding is about, where that is not a node.
      *
      * `null` everywhere else, where `nodes` already names the subject. It exists
      * because a broken reference names something that is not a node - that is
      * what makes it broken - and a baseline still has to be able to tell one
-     * broken reference from another. See ADR-0012.
+     * broken reference from another. A misread front-matter key is the same
+     * shape: a spelling, not a node. See ADR-0012.
      */
     readonly target: string | null;
     /** Supporting locations: the other end of an edge, a cycle members. */

package/dist/types.js.map

@@ -1 +1 @@
-{"version":3,"file":"types.js","sourceRoot":"","sources":["../src/types.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;GAmBG;AA4FH,MAAM,CAAC,MAAM,YAAY,GAA2B,MAAM,CAAC,MAAM,CAAC;IAChE,YAAY;IACZ,UAAU;IACV,WAAW;IACX,WAAW;IACX,eAAe;IACf,UAAU;IACV,UAAU;CACX,CAAC,CAAC;AAEH,gDAAgD;AAChD,MAAM,CAAC,MAAM,WAAW,GAA4C,MAAM,CAAC,MAAM,CAAC;IAChF,UAAU,EAAE,MAAM;IAClB,QAAQ,EAAE,SAAS;IACnB,SAAS,EAAE,MAAM;IACjB,SAAS,EAAE,QAAQ;IACnB,eAAe,EAAE,QAAQ;IACzB,QAAQ,EAAE,QAAQ;IAClB,QAAQ,EAAE,QAAQ;CACnB,CAAC,CAAC;AAkDH,MAAM,CAAC,MAAM,WAAW,GAA2C,MAAM,CAAC,MAAM,CAAC;IAC/E,QAAQ,EAAE,EAAE,WAAW,EAAE,KAAK,EAAE,mBAAmB,EAAE,KAAK,EAAE,SAAS,EAAE,KAAK,EAAE,MAAM,EAAE,UAAU,EAAE;IAClG,UAAU,EAAE,EAAE,WAAW,EAAE,KAAK,EAAE,mBAAmB,EAAE,KAAK,EAAE,SAAS,EAAE,KAAK,EAAE,MAAM,EAAE,YAAY,EAAE;IACtG,YAAY,EAAE,EAAE,WAAW,EAAE,KAAK,EAAE,mBAAmB,EAAE,KAAK,EAAE,SAAS,EAAE,KAAK,EAAE,MAAM,EAAE,YAAY,EAAE;IACxG,YAAY,EAAE,EAAE,WAAW,EAAE,IAAI,EAAE,mBAAmB,EAAE,KAAK,EAAE,SAAS,EAAE,KAAK,EAAE,MAAM,EAAE,YAAY,EAAE;IACvG,OAAO,EAAE,EAAE,WAAW,EAAE,IAAI,EAAE,mBAAmB,EAAE,KAAK,EAAE,SAAS,EAAE,KAAK,EAAE,MAAM,EAAE,SAAS,EAAE;IAC/F,cAAc,EAAE,EAAE,WAAW,EAAE,KAAK,EAAE,mBAAmB,EAAE,IAAI,EAAE,SAAS,EAAE,KAAK,EAAE,MAAM,EAAE,cAAc,EAAE;IAC3G,YAAY,EAAE,EAAE,WAAW,EAAE,IAAI,EAAE,mBAAmB,EAAE,IAAI,EAAE,SAAS,EAAE,KAAK,EAAE,MAAM,EAAE,eAAe,EAAE;IACzG,UAAU,EAAE,EAAE,WAAW,EAAE,KAAK,EAAE,mBAAmB,EAAE,KAAK,EAAE,SAAS,EAAE,IAAI,EAAE,MAAM,EAAE,YAAY,EAAE;IACrG,MAAM,EAAE,EAAE,WAAW,EAAE,IAAI,EAAE,mBAAmB,EAAE,KAAK,EAAE,SAAS,EAAE,IAAI,EAAE,MAAM,EAAE,QAAQ,EAAE;CAC7F,CAAC,CAAC;AAEH,MAAM,CAAC,MAAM,UAAU,GAAG,MAAM,CAAC,IAAI,CAAC,WAAW,CAAwB,CAAC","sourcesContent":["/**\n * The spec-graph data model.\n *\n * Three ideas carry the whole design:\n *\n * 1. **Documents have a lifecycle phase**, normalised from whatever vocabulary\n *    the repository already uses (MADR `accepted`, KEP `implementable`, RFC\n *    `final`, plain English `archived`). The phase answers one question that\n *    matters more than any other: *can this document still absorb new work?*\n *\n * 2. **Items are obligations with nuanced state.** A checkbox is not a boolean.\n *    An item can be open, narrowed to a smaller scope, satisfied, consciously\n *    accepted as debt, or obviated because the premise it rested on evaporated.\n *    Collapsing those five into `[ ]` / `[x]` is what makes ad-hoc greps lie.\n *\n * 3. **Edges are typed and carry provenance.** Every relation records where it\n *    was *declared*, which is frequently not the node it points at. That is what\n *    lets a diagnostic say \"ADR-0009 line 12 claims to supersede ADR-0003\"\n *    instead of \"something, somewhere, is inconsistent\".\n */\n\n/* -------------------------------------------------------------------------- */\n/* Source positions                                                           */\n/* -------------------------------------------------------------------------- */\n\n/** A point in a source file. `offset` is a UTF-16 code-unit index. */\nexport interface Position {\n  readonly offset: number;\n  /** 1-based. */\n  readonly line: number;\n  /** 1-based, counted in UTF-16 code units. */\n  readonly column: number;\n}\n\n/** A half-open `[start, end)` range of a source file. */\nexport interface Span {\n  readonly start: Position;\n  readonly end: Position;\n}\n\n/** A span plus the file it belongs to. Everything user-visible carries one. */\nexport interface SourceRef {\n  /** Repository-relative POSIX path. */\n  readonly file: string;\n  readonly span: Span;\n}\n\n/* -------------------------------------------------------------------------- */\n/* Lifecycle                                                                  */\n/* -------------------------------------------------------------------------- */\n\n/**\n * The normalised document lifecycle, as a four-state lattice.\n *\n * Ecosystem vocabularies are large and mutually incompatible; the *consequences*\n * of a status are not. These four phases are chosen so that every question\n * spec-graph asks can be answered from the phase alone.\n *\n * - `draft`   - not yet binding. Mutable. Absorbs new work.\n * - `active`  - binding and mutable. Absorbs new work.\n * - `frozen`  - binding and immutable. Changes require a new document.\n * - `retired` - no longer binding: superseded, rejected, withdrawn, archived.\n *\n * `unknown` is a fifth, deliberately non-lattice value for documents that never\n * declared a status. Rules treat it permissively rather than guessing.\n */\nexport type Phase = 'draft' | 'active' | 'frozen' | 'retired' | 'record' | 'unknown';\n\n/**\n * Can a document in this phase take on a *new* open obligation?\n *\n * This is the single predicate behind ghost-handover detection. Delegating an\n * open question into a `frozen` or `retired` document is a write to a closed\n * ledger: nobody will ever read it again.\n */\nexport type Receptivity = 'receptive' | 'sealed' | 'unknown';\n\n/* -------------------------------------------------------------------------- */\n/* Item state                                                                 */\n/* -------------------------------------------------------------------------- */\n\n/**\n * How much of an obligation is left.\n *\n * Kept separate from {@link Disposition} because the two answer different\n * questions: `openness` is \"does someone still owe work?\", `disposition` is\n * \"what happened to it?\". Rules almost always want the former; humans reading a\n * report always want the latter.\n */\nexport type Openness = 'open' | 'partial' | 'closed';\n\n/** Why an item is in the state it is in. */\nexport type Disposition =\n  /** Nothing has happened yet. */\n  | 'unresolved'\n  /** Scope was cut down, but a remainder is still owed. */\n  | 'narrowed'\n  /** Ownership moved elsewhere. Still owed - by somebody else. */\n  | 'delegated'\n  /** Done, answered, decided. */\n  | 'satisfied'\n  /** Knowingly not done. A closed item with a scar. */\n  | 'accepted-debt'\n  /** Decided against. */\n  | 'rejected'\n  /**\n   * The premise evaporated, so the question stopped being a question.\n   * Load-bearing citations to an obviated item are stale premises.\n   */\n  | 'obviated';\n\nexport const DISPOSITIONS: readonly Disposition[] = Object.freeze([\n  'unresolved',\n  'narrowed',\n  'delegated',\n  'satisfied',\n  'accepted-debt',\n  'rejected',\n  'obviated',\n]);\n\n/** The openness implied by each disposition. */\nexport const OPENNESS_OF: Readonly<Record<Disposition, Openness>> = Object.freeze({\n  unresolved: 'open',\n  narrowed: 'partial',\n  delegated: 'open',\n  satisfied: 'closed',\n  'accepted-debt': 'closed',\n  rejected: 'closed',\n  obviated: 'closed',\n});\n\n/* -------------------------------------------------------------------------- */\n/* Edges                                                                      */\n/* -------------------------------------------------------------------------- */\n\n/**\n * Relation kinds.\n *\n * The set is small on purpose. Two orthogonal properties - declared once in\n * {@link EDGE_TRAITS} - do the actual work, so adding a kind never means\n * touching a rule.\n */\nexport type EdgeKind =\n  /** Structural: a document contains an item. Never inferred from prose. */\n  | 'contains'\n  /** A neutral citation. */\n  | 'references'\n  /** Explicitly *not* load-bearing: \"See also\", \"History\", \"Prior art\". */\n  | 'relates-to'\n  /** The source design depends on the target content. */\n  | 'depends-on'\n  /** The source rests on a claim made by the target. */\n  | 'assumes'\n  /** The source hands an obligation to the target. */\n  | 'delegates-to'\n  /** The source cannot proceed until the target does. */\n  | 'blocked-by'\n  /** The source replaces the target. */\n  | 'supersedes'\n  /** The source modifies the target without replacing it. */\n  | 'amends';\n\nexport interface EdgeTraits {\n  /**\n   * Does the source continued validity depend on what the target says?\n   *\n   * Load-bearing edges into retired documents are stale premises. Non\n   * load-bearing ones (\"see also\") are just history, and reporting them would\n   * bury the real findings - which is exactly how ad-hoc linters lose trust.\n   */\n  readonly loadBearing: boolean;\n  /** Does the edge move an obligation from source to target? */\n  readonly transfersObligation: boolean;\n  /** Does the edge assert something about the target lifecycle? */\n  readonly lifecycle: boolean;\n  /** Human-readable phrase used in diagnostics: \"ADR-1 <phrase> ADR-2\". */\n  readonly phrase: string;\n}\n\nexport const EDGE_TRAITS: Readonly<Record<EdgeKind, EdgeTraits>> = Object.freeze({\n  contains: { loadBearing: false, transfersObligation: false, lifecycle: false, phrase: 'contains' },\n  references: { loadBearing: false, transfersObligation: false, lifecycle: false, phrase: 'references' },\n  'relates-to': { loadBearing: false, transfersObligation: false, lifecycle: false, phrase: 'relates to' },\n  'depends-on': { loadBearing: true, transfersObligation: false, lifecycle: false, phrase: 'depends on' },\n  assumes: { loadBearing: true, transfersObligation: false, lifecycle: false, phrase: 'assumes' },\n  'delegates-to': { loadBearing: false, transfersObligation: true, lifecycle: false, phrase: 'delegates to' },\n  'blocked-by': { loadBearing: true, transfersObligation: true, lifecycle: false, phrase: 'is blocked by' },\n  supersedes: { loadBearing: false, transfersObligation: false, lifecycle: true, phrase: 'supersedes' },\n  amends: { loadBearing: true, transfersObligation: false, lifecycle: true, phrase: 'amends' },\n});\n\nexport const EDGE_KINDS = Object.keys(EDGE_TRAITS) as readonly EdgeKind[];\n\n/** How an edge came to exist. Reported verbatim so findings are auditable. */\nexport type EdgeOrigin =\n  /** A `<!-- @spec-edge -->` directive. */\n  | 'directive'\n  /** A front-matter field such as `supersedes:` or `superseded-by:`. */\n  | 'front-matter'\n  /** A Markdown link, classified by the section it sits in. */\n  | 'link'\n  /** A bare textual identifier such as `ADR-0007` in prose. */\n  | 'text'\n  /** Synthesised by the extractor (document -> item). */\n  | 'structural';\n\nexport interface Edge {\n  readonly kind: EdgeKind;\n  /** Node id. */\n  readonly from: string;\n  /** Node id. */\n  readonly to: string;\n  readonly origin: EdgeOrigin;\n  /**\n   * Where the relation was written down. Not necessarily inside `from`: a\n   * `superseded-by: ADR-9` field in ADR-3 declares `ADR-9 supersedes ADR-3`,\n   * and the only place a human can go fix it is ADR-3.\n   */\n  readonly declaredAt: SourceRef;\n  /** The raw text that produced the edge, for diagnostics. */\n  readonly raw: string;\n  /**\n   * Every file that declares this relation.\n   *\n   * A supersession stated only in the superseding document leaves the\n   * superseded one silently presenting itself as current, which is a finding in\n   * its own right - so the set of declaration sites has to survive de-duplication.\n   */\n  readonly declaredIn: readonly string[];\n  /** True when `from` and `to` are the same node. Kept, never traversed. */\n  readonly reflexive: boolean;\n}\n\n/* -------------------------------------------------------------------------- */\n/* Nodes                                                                      */\n/* -------------------------------------------------------------------------- */\n\nexport type NodeKind = 'document' | 'item';\n\ninterface NodeBase {\n  /** Canonical, graph-unique. Documents: `ADR-0007`. Items: `ADR-0007#q.1`. */\n  readonly id: string;\n  readonly kind: NodeKind;\n  /** Short human label used in reports. */\n  readonly title: string;\n  readonly at: SourceRef;\n}\n\nexport interface DocumentNode extends NodeBase {\n  readonly kind: 'document';\n  /** Repository-relative POSIX path. */\n  readonly path: string;\n  /** Every spelling that resolves to this document, lowercased. */\n  readonly aliases: readonly string[];\n  readonly phase: Phase;\n  /** The status string as written, before normalisation. `null` if absent. */\n  readonly rawStatus: string | null;\n  /** Where the status was declared, when it was declared anywhere. */\n  readonly statusAt: SourceRef | null;\n  /** Front-matter fields, flattened to strings and string arrays. */\n  readonly frontMatter: Readonly<Record<string, string | readonly string[]>>;\n}\n\nexport interface ItemNode extends NodeBase {\n  readonly kind: 'item';\n  /** Owning document id. */\n  readonly document: string;\n  /** Heading path the item sits under, outermost first. */\n  readonly section: readonly string[];\n  /** First line of the item, normalised to one line for reports. */\n  readonly text: string;\n  /** The full multi-line body, continuations included. */\n  readonly body: string;\n  readonly disposition: Disposition;\n  readonly openness: Openness;\n  /** Which signal decided the disposition. */\n  readonly evidence: StateSignal;\n  /** Conflicting signals found while resolving the state. */\n  readonly conflicts: readonly StateSignal[];\n}\n\nexport type SpecNode = DocumentNode | ItemNode;\n\n/** One observation about an item state. */\nexport interface StateSignal {\n  /** Higher wins. See `SIGNAL_PRIORITY` in `state.ts`. */\n  readonly source: 'directive' | 'marker' | 'strikethrough' | 'checkbox' | 'section' | 'default';\n  readonly disposition: Disposition;\n  /** The literal text that produced the signal. */\n  readonly raw: string;\n  readonly at: SourceRef;\n}\n\n/* -------------------------------------------------------------------------- */\n/* Unresolved references                                                      */\n/* -------------------------------------------------------------------------- */\n\nexport type DanglingReason =\n  /** Nothing in the corpus answers to this identifier. */\n  | 'unknown-target'\n  /** More than one document answers to it. */\n  | 'ambiguous'\n  /** The path exists on disk but is not a parsed specification. */\n  | 'not-a-spec'\n  /** The document resolved, but the `#anchor` did not. */\n  | 'unknown-anchor';\n\n/** A citation that failed foreign-key validation. */\nexport interface DanglingRef {\n  readonly kind: EdgeKind;\n  readonly from: string;\n  /** The identifier as written. */\n  readonly target: string;\n  readonly reason: DanglingReason;\n  readonly origin: EdgeOrigin;\n  readonly declaredAt: SourceRef;\n  readonly raw: string;\n  /** Candidate ids when `reason` is `ambiguous`, or near-misses otherwise. */\n  readonly candidates: readonly string[];\n}\n\n/* -------------------------------------------------------------------------- */\n/* Diagnostics                                                                */\n/* -------------------------------------------------------------------------- */\n\nexport type Severity = 'error' | 'warn' | 'info' | 'off';\n\nexport type RuleId =\n  | 'ghost-handover'\n  | 'stale-premise'\n  | 'broken-reference'\n  | 'reference-outside-corpus'\n  | 'ambiguous-reference'\n  | 'circular-delegation'\n  | 'orphaned-obligation'\n  | 'unreciprocated-supersession'\n  | 'live-supersession'\n  | 'state-conflict'\n  | 'self-reference';\n\nexport interface RelatedLocation {\n  readonly at: SourceRef;\n  readonly note: string;\n}\n\nexport interface Diagnostic {\n  readonly rule: RuleId;\n  readonly severity: Exclude<Severity, 'off'>;\n  /** One line, no trailing period. The headline of the finding. */\n  readonly message: string;\n  /** Where a human should go to fix it. */\n  readonly at: SourceRef;\n  /** Node ids involved, most relevant first. */\n  readonly nodes: readonly string[];\n  /**\n   * The citation this finding is about, for the rules that are about one.\n   *\n   * `null` everywhere else, where `nodes` already names the subject. It exists\n   * because a broken reference names something that is not a node - that is\n   * what makes it broken - and a baseline still has to be able to tell one\n   * broken reference from another. See ADR-0012.\n   */\n  readonly target: string | null;\n  /** Supporting locations: the other end of an edge, a cycle members. */\n  readonly related: readonly RelatedLocation[];\n  /** Concrete next action. */\n  readonly hint: string;\n}\n\n/* -------------------------------------------------------------------------- */\n/* Analysis output                                                            */\n/* -------------------------------------------------------------------------- */\n\n/** A problem with the input itself, as opposed to a finding about the graph. */\nexport interface ParseProblem {\n  readonly message: string;\n  readonly at: SourceRef;\n}\n\nexport interface AnalysisSummary {\n  readonly documents: number;\n  readonly items: number;\n  readonly edges: number;\n  readonly openObligations: number;\n  readonly errors: number;\n  readonly warnings: number;\n  readonly infos: number;\n  /** Milliseconds, wall clock. */\n  readonly durationMs: number;\n}\n"]}
+{"version":3,"file":"types.js","sourceRoot":"","sources":["../src/types.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;GAmBG;AA4FH,MAAM,CAAC,MAAM,YAAY,GAA2B,MAAM,CAAC,MAAM,CAAC;IAChE,YAAY;IACZ,UAAU;IACV,WAAW;IACX,WAAW;IACX,eAAe;IACf,UAAU;IACV,UAAU;CACX,CAAC,CAAC;AAEH,gDAAgD;AAChD,MAAM,CAAC,MAAM,WAAW,GAA4C,MAAM,CAAC,MAAM,CAAC;IAChF,UAAU,EAAE,MAAM;IAClB,QAAQ,EAAE,SAAS;IACnB,SAAS,EAAE,MAAM;IACjB,SAAS,EAAE,QAAQ;IACnB,eAAe,EAAE,QAAQ;IACzB,QAAQ,EAAE,QAAQ;IAClB,QAAQ,EAAE,QAAQ;CACnB,CAAC,CAAC;AAkDH,MAAM,CAAC,MAAM,WAAW,GAA2C,MAAM,CAAC,MAAM,CAAC;IAC/E,QAAQ,EAAE,EAAE,WAAW,EAAE,KAAK,EAAE,mBAAmB,EAAE,KAAK,EAAE,SAAS,EAAE,KAAK,EAAE,MAAM,EAAE,UAAU,EAAE;IAClG,UAAU,EAAE,EAAE,WAAW,EAAE,KAAK,EAAE,mBAAmB,EAAE,KAAK,EAAE,SAAS,EAAE,KAAK,EAAE,MAAM,EAAE,YAAY,EAAE;IACtG,YAAY,EAAE,EAAE,WAAW,EAAE,KAAK,EAAE,mBAAmB,EAAE,KAAK,EAAE,SAAS,EAAE,KAAK,EAAE,MAAM,EAAE,YAAY,EAAE;IACxG,YAAY,EAAE,EAAE,WAAW,EAAE,IAAI,EAAE,mBAAmB,EAAE,KAAK,EAAE,SAAS,EAAE,KAAK,EAAE,MAAM,EAAE,YAAY,EAAE;IACvG,OAAO,EAAE,EAAE,WAAW,EAAE,IAAI,EAAE,mBAAmB,EAAE,KAAK,EAAE,SAAS,EAAE,KAAK,EAAE,MAAM,EAAE,SAAS,EAAE;IAC/F,cAAc,EAAE,EAAE,WAAW,EAAE,KAAK,EAAE,mBAAmB,EAAE,IAAI,EAAE,SAAS,EAAE,KAAK,EAAE,MAAM,EAAE,cAAc,EAAE;IAC3G,YAAY,EAAE,EAAE,WAAW,EAAE,IAAI,EAAE,mBAAmB,EAAE,IAAI,EAAE,SAAS,EAAE,KAAK,EAAE,MAAM,EAAE,eAAe,EAAE;IACzG,UAAU,EAAE,EAAE,WAAW,EAAE,KAAK,EAAE,mBAAmB,EAAE,KAAK,EAAE,SAAS,EAAE,IAAI,EAAE,MAAM,EAAE,YAAY,EAAE;IACrG,MAAM,EAAE,EAAE,WAAW,EAAE,IAAI,EAAE,mBAAmB,EAAE,KAAK,EAAE,SAAS,EAAE,IAAI,EAAE,MAAM,EAAE,QAAQ,EAAE;CAC7F,CAAC,CAAC;AAEH,MAAM,CAAC,MAAM,UAAU,GAAG,MAAM,CAAC,IAAI,CAAC,WAAW,CAAwB,CAAC","sourcesContent":["/**\n * The spec-graph data model.\n *\n * Three ideas carry the whole design:\n *\n * 1. **Documents have a lifecycle phase**, normalised from whatever vocabulary\n *    the repository already uses (MADR `accepted`, KEP `implementable`, RFC\n *    `final`, plain English `archived`). The phase answers one question that\n *    matters more than any other: *can this document still absorb new work?*\n *\n * 2. **Items are obligations with nuanced state.** A checkbox is not a boolean.\n *    An item can be open, narrowed to a smaller scope, satisfied, consciously\n *    accepted as debt, or obviated because the premise it rested on evaporated.\n *    Collapsing those five into `[ ]` / `[x]` is what makes ad-hoc greps lie.\n *\n * 3. **Edges are typed and carry provenance.** Every relation records where it\n *    was *declared*, which is frequently not the node it points at. That is what\n *    lets a diagnostic say \"ADR-0009 line 12 claims to supersede ADR-0003\"\n *    instead of \"something, somewhere, is inconsistent\".\n */\n\n/* -------------------------------------------------------------------------- */\n/* Source positions                                                           */\n/* -------------------------------------------------------------------------- */\n\n/** A point in a source file. `offset` is a UTF-16 code-unit index. */\nexport interface Position {\n  readonly offset: number;\n  /** 1-based. */\n  readonly line: number;\n  /** 1-based, counted in UTF-16 code units. */\n  readonly column: number;\n}\n\n/** A half-open `[start, end)` range of a source file. */\nexport interface Span {\n  readonly start: Position;\n  readonly end: Position;\n}\n\n/** A span plus the file it belongs to. Everything user-visible carries one. */\nexport interface SourceRef {\n  /** Repository-relative POSIX path. */\n  readonly file: string;\n  readonly span: Span;\n}\n\n/* -------------------------------------------------------------------------- */\n/* Lifecycle                                                                  */\n/* -------------------------------------------------------------------------- */\n\n/**\n * The normalised document lifecycle, as a four-state lattice.\n *\n * Ecosystem vocabularies are large and mutually incompatible; the *consequences*\n * of a status are not. These four phases are chosen so that every question\n * spec-graph asks can be answered from the phase alone.\n *\n * - `draft`   - not yet binding. Mutable. Absorbs new work.\n * - `active`  - binding and mutable. Absorbs new work.\n * - `frozen`  - binding and immutable. Changes require a new document.\n * - `retired` - no longer binding: superseded, rejected, withdrawn, archived.\n *\n * `unknown` is a fifth, deliberately non-lattice value for documents that never\n * declared a status. Rules treat it permissively rather than guessing.\n */\nexport type Phase = 'draft' | 'active' | 'frozen' | 'retired' | 'record' | 'unknown';\n\n/**\n * Can a document in this phase take on a *new* open obligation?\n *\n * This is the single predicate behind ghost-handover detection. Delegating an\n * open question into a `frozen` or `retired` document is a write to a closed\n * ledger: nobody will ever read it again.\n */\nexport type Receptivity = 'receptive' | 'sealed' | 'unknown';\n\n/* -------------------------------------------------------------------------- */\n/* Item state                                                                 */\n/* -------------------------------------------------------------------------- */\n\n/**\n * How much of an obligation is left.\n *\n * Kept separate from {@link Disposition} because the two answer different\n * questions: `openness` is \"does someone still owe work?\", `disposition` is\n * \"what happened to it?\". Rules almost always want the former; humans reading a\n * report always want the latter.\n */\nexport type Openness = 'open' | 'partial' | 'closed';\n\n/** Why an item is in the state it is in. */\nexport type Disposition =\n  /** Nothing has happened yet. */\n  | 'unresolved'\n  /** Scope was cut down, but a remainder is still owed. */\n  | 'narrowed'\n  /** Ownership moved elsewhere. Still owed - by somebody else. */\n  | 'delegated'\n  /** Done, answered, decided. */\n  | 'satisfied'\n  /** Knowingly not done. A closed item with a scar. */\n  | 'accepted-debt'\n  /** Decided against. */\n  | 'rejected'\n  /**\n   * The premise evaporated, so the question stopped being a question.\n   * Load-bearing citations to an obviated item are stale premises.\n   */\n  | 'obviated';\n\nexport const DISPOSITIONS: readonly Disposition[] = Object.freeze([\n  'unresolved',\n  'narrowed',\n  'delegated',\n  'satisfied',\n  'accepted-debt',\n  'rejected',\n  'obviated',\n]);\n\n/** The openness implied by each disposition. */\nexport const OPENNESS_OF: Readonly<Record<Disposition, Openness>> = Object.freeze({\n  unresolved: 'open',\n  narrowed: 'partial',\n  delegated: 'open',\n  satisfied: 'closed',\n  'accepted-debt': 'closed',\n  rejected: 'closed',\n  obviated: 'closed',\n});\n\n/* -------------------------------------------------------------------------- */\n/* Edges                                                                      */\n/* -------------------------------------------------------------------------- */\n\n/**\n * Relation kinds.\n *\n * The set is small on purpose. Two orthogonal properties - declared once in\n * {@link EDGE_TRAITS} - do the actual work, so adding a kind never means\n * touching a rule.\n */\nexport type EdgeKind =\n  /** Structural: a document contains an item. Never inferred from prose. */\n  | 'contains'\n  /** A neutral citation. */\n  | 'references'\n  /** Explicitly *not* load-bearing: \"See also\", \"History\", \"Prior art\". */\n  | 'relates-to'\n  /** The source design depends on the target content. */\n  | 'depends-on'\n  /** The source rests on a claim made by the target. */\n  | 'assumes'\n  /** The source hands an obligation to the target. */\n  | 'delegates-to'\n  /** The source cannot proceed until the target does. */\n  | 'blocked-by'\n  /** The source replaces the target. */\n  | 'supersedes'\n  /** The source modifies the target without replacing it. */\n  | 'amends';\n\nexport interface EdgeTraits {\n  /**\n   * Does the source continued validity depend on what the target says?\n   *\n   * Load-bearing edges into retired documents are stale premises. Non\n   * load-bearing ones (\"see also\") are just history, and reporting them would\n   * bury the real findings - which is exactly how ad-hoc linters lose trust.\n   */\n  readonly loadBearing: boolean;\n  /** Does the edge move an obligation from source to target? */\n  readonly transfersObligation: boolean;\n  /** Does the edge assert something about the target lifecycle? */\n  readonly lifecycle: boolean;\n  /** Human-readable phrase used in diagnostics: \"ADR-1 <phrase> ADR-2\". */\n  readonly phrase: string;\n}\n\nexport const EDGE_TRAITS: Readonly<Record<EdgeKind, EdgeTraits>> = Object.freeze({\n  contains: { loadBearing: false, transfersObligation: false, lifecycle: false, phrase: 'contains' },\n  references: { loadBearing: false, transfersObligation: false, lifecycle: false, phrase: 'references' },\n  'relates-to': { loadBearing: false, transfersObligation: false, lifecycle: false, phrase: 'relates to' },\n  'depends-on': { loadBearing: true, transfersObligation: false, lifecycle: false, phrase: 'depends on' },\n  assumes: { loadBearing: true, transfersObligation: false, lifecycle: false, phrase: 'assumes' },\n  'delegates-to': { loadBearing: false, transfersObligation: true, lifecycle: false, phrase: 'delegates to' },\n  'blocked-by': { loadBearing: true, transfersObligation: true, lifecycle: false, phrase: 'is blocked by' },\n  supersedes: { loadBearing: false, transfersObligation: false, lifecycle: true, phrase: 'supersedes' },\n  amends: { loadBearing: true, transfersObligation: false, lifecycle: true, phrase: 'amends' },\n});\n\nexport const EDGE_KINDS = Object.keys(EDGE_TRAITS) as readonly EdgeKind[];\n\n/** How an edge came to exist. Reported verbatim so findings are auditable. */\nexport type EdgeOrigin =\n  /** A `<!-- @spec-edge -->` directive. */\n  | 'directive'\n  /** A front-matter field such as `supersedes:` or `superseded-by:`. */\n  | 'front-matter'\n  /** A Markdown link, classified by the section it sits in. */\n  | 'link'\n  /** A bare textual identifier such as `ADR-0007` in prose. */\n  | 'text'\n  /** Synthesised by the extractor (document -> item). */\n  | 'structural';\n\nexport interface Edge {\n  readonly kind: EdgeKind;\n  /** Node id. */\n  readonly from: string;\n  /** Node id. */\n  readonly to: string;\n  readonly origin: EdgeOrigin;\n  /**\n   * Where the relation was written down. Not necessarily inside `from`: a\n   * `superseded-by: ADR-9` field in ADR-3 declares `ADR-9 supersedes ADR-3`,\n   * and the only place a human can go fix it is ADR-3.\n   */\n  readonly declaredAt: SourceRef;\n  /** The raw text that produced the edge, for diagnostics. */\n  readonly raw: string;\n  /**\n   * Every file that declares this relation.\n   *\n   * A supersession stated only in the superseding document leaves the\n   * superseded one silently presenting itself as current, which is a finding in\n   * its own right - so the set of declaration sites has to survive de-duplication.\n   */\n  readonly declaredIn: readonly string[];\n  /** True when `from` and `to` are the same node. Kept, never traversed. */\n  readonly reflexive: boolean;\n}\n\n/* -------------------------------------------------------------------------- */\n/* Nodes                                                                      */\n/* -------------------------------------------------------------------------- */\n\nexport type NodeKind = 'document' | 'item';\n\ninterface NodeBase {\n  /** Canonical, graph-unique. Documents: `ADR-0007`. Items: `ADR-0007#q.1`. */\n  readonly id: string;\n  readonly kind: NodeKind;\n  /** Short human label used in reports. */\n  readonly title: string;\n  readonly at: SourceRef;\n}\n\nexport interface DocumentNode extends NodeBase {\n  readonly kind: 'document';\n  /** Repository-relative POSIX path. */\n  readonly path: string;\n  /** Every spelling that resolves to this document, lowercased. */\n  readonly aliases: readonly string[];\n  readonly phase: Phase;\n  /** The status string as written, before normalisation. `null` if absent. */\n  readonly rawStatus: string | null;\n  /** Where the status was declared, when it was declared anywhere. */\n  readonly statusAt: SourceRef | null;\n  /** Front-matter fields, flattened to strings and string arrays. */\n  readonly frontMatter: Readonly<Record<string, string | readonly string[]>>;\n}\n\nexport interface ItemNode extends NodeBase {\n  readonly kind: 'item';\n  /** Owning document id. */\n  readonly document: string;\n  /** Heading path the item sits under, outermost first. */\n  readonly section: readonly string[];\n  /** First line of the item, normalised to one line for reports. */\n  readonly text: string;\n  /** The full multi-line body, continuations included. */\n  readonly body: string;\n  readonly disposition: Disposition;\n  readonly openness: Openness;\n  /** Which signal decided the disposition. */\n  readonly evidence: StateSignal;\n  /** Conflicting signals found while resolving the state. */\n  readonly conflicts: readonly StateSignal[];\n}\n\nexport type SpecNode = DocumentNode | ItemNode;\n\n/** One observation about an item state. */\nexport interface StateSignal {\n  /** Higher wins. See `SIGNAL_PRIORITY` in `state.ts`. */\n  readonly source: 'directive' | 'marker' | 'strikethrough' | 'checkbox' | 'section' | 'default';\n  readonly disposition: Disposition;\n  /** The literal text that produced the signal. */\n  readonly raw: string;\n  readonly at: SourceRef;\n}\n\n/* -------------------------------------------------------------------------- */\n/* Unresolved references                                                      */\n/* -------------------------------------------------------------------------- */\n\nexport type DanglingReason =\n  /** Nothing in the corpus answers to this identifier. */\n  | 'unknown-target'\n  /** More than one document answers to it. */\n  | 'ambiguous'\n  /** The path exists on disk but is not a parsed specification. */\n  | 'not-a-spec'\n  /** The document resolved, but the `#anchor` did not. */\n  | 'unknown-anchor';\n\n/** A citation that failed foreign-key validation. */\nexport interface DanglingRef {\n  readonly kind: EdgeKind;\n  readonly from: string;\n  /** The identifier as written. */\n  readonly target: string;\n  readonly reason: DanglingReason;\n  readonly origin: EdgeOrigin;\n  readonly declaredAt: SourceRef;\n  readonly raw: string;\n  /** Candidate ids when `reason` is `ambiguous`, or near-misses otherwise. */\n  readonly candidates: readonly string[];\n}\n\n/**\n * A front-matter key that reads as a relation and is not one.\n *\n * Front matter is an open vocabulary - `title`, `tags`, `sidebar_position` and\n * whatever else the site generator wants all live there - so an unrecognised key\n * is normally none of spec-graph's business. This is the exception: a key one\n * character away from a relation, carrying something shaped like a citation, is\n * a relation the author believes they declared. The edge does not exist, and\n * nothing else would ever say so.\n */\nexport interface MisreadKey {\n  /** The key as written. */\n  readonly key: string;\n  /** The relation key it is a hair away from. */\n  readonly suggestion: string;\n  /** The document the key was written in. */\n  readonly from: string;\n  readonly at: SourceRef;\n}\n\n/* -------------------------------------------------------------------------- */\n/* Diagnostics                                                                */\n/* -------------------------------------------------------------------------- */\n\nexport type Severity = 'error' | 'warn' | 'info' | 'off';\n\nexport type RuleId =\n  | 'ghost-handover'\n  | 'stale-premise'\n  | 'broken-reference'\n  | 'reference-outside-corpus'\n  | 'ambiguous-reference'\n  | 'circular-delegation'\n  | 'orphaned-obligation'\n  | 'unreciprocated-supersession'\n  | 'live-supersession'\n  | 'state-conflict'\n  | 'self-reference'\n  | 'unknown-relation-key';\n\nexport interface RelatedLocation {\n  readonly at: SourceRef;\n  readonly note: string;\n}\n\nexport interface Diagnostic {\n  readonly rule: RuleId;\n  readonly severity: Exclude<Severity, 'off'>;\n  /** One line, no trailing period. The headline of the finding. */\n  readonly message: string;\n  /** Where a human should go to fix it. */\n  readonly at: SourceRef;\n  /** Node ids involved, most relevant first. */\n  readonly nodes: readonly string[];\n  /**\n   * What within the document this finding is about, where that is not a node.\n   *\n   * `null` everywhere else, where `nodes` already names the subject. It exists\n   * because a broken reference names something that is not a node - that is\n   * what makes it broken - and a baseline still has to be able to tell one\n   * broken reference from another. A misread front-matter key is the same\n   * shape: a spelling, not a node. See ADR-0012.\n   */\n  readonly target: string | null;\n  /** Supporting locations: the other end of an edge, a cycle members. */\n  readonly related: readonly RelatedLocation[];\n  /** Concrete next action. */\n  readonly hint: string;\n}\n\n/* -------------------------------------------------------------------------- */\n/* Analysis output                                                            */\n/* -------------------------------------------------------------------------- */\n\n/** A problem with the input itself, as opposed to a finding about the graph. */\nexport interface ParseProblem {\n  readonly message: string;\n  readonly at: SourceRef;\n}\n\nexport interface AnalysisSummary {\n  readonly documents: number;\n  readonly items: number;\n  readonly edges: number;\n  readonly openObligations: number;\n  readonly errors: number;\n  readonly warnings: number;\n  readonly infos: number;\n  /** Milliseconds, wall clock. */\n  readonly durationMs: number;\n}\n"]}