aontu 0.52.0 → 0.53.0

package/dist/query.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"query.js","sourceRoot":"","sources":["../src/query.ts"],"names":[],"mappings":";AAAA,oDAAoD;;;;;;;;;AAEpD,iCAAiC;AACjC,sEAAsE;AACtE,qEAAqE;AACrE,mDAAmD;AACnD,EAAE;AACF,uEAAuE;AACvE,sEAAsE;AACtE,sEAAsE;AACtE,EAAE;AACF,sEAAsE;AACtE,qEAAqE;AACrE,gDAAgD;AAChD,EAAE;AACF,oEAAoE;AACpE,sEAAsE;AACtE,6DAA6D;AAC7D,oEAAoE;AACpE,gEAAgE;AAChE,oDAAoD;AACpD,EAAE;AACF,+DAA+D;AAC/D,oEAAoE;AACpE,sDAAsD;AACtD,EAAE;AACF,qEAAqE;AACrE,sEAAsE;AAEtE,mCAA+B;AAE/B,2CAAuC;AACvC,+BAAgC;AAEhC,yCAAyC;AACzC,6CAAyC;AAgCzC,MAAM,GAAG,GAAG,KAAK,CAAA;AAGjB,mEAAmE;AACnE,kEAAkE;AAClE,gEAAgE;AAChE,iCAAiC;AACjC,oBACE,IAAY,EAAE,IAAc;IAC5B,IAAI,IAAwB,CAAA;IAC5B,IAAI,KAAK,GAAG,QAAQ,CAAA;IACpB,KAAK,MAAM,CAAC,IAAI,IAAI,EAAE,CAAC;QACrB,MAAM,CAAC,GAAG,YAAY,CAAC,IAAI,EAAE,CAAC,CAAC,CAAA;QAC/B,IAAI,CAAC,GAAG,KAAK,EAAE,CAAC;YACd,KAAK,GAAG,CAAC,CAAA;YACT,IAAI,GAAG,CAAC,CAAA;QACV,CAAC;IACH,CAAC;IACD,iEAAiE;IACjE,sDAAsD;IACtD,OAAO,KAAK,IAAI,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,SAAS,CAAA;AAC7E,CAAC;AAGD,SAAS,YAAY,CAAC,CAAS,EAAE,CAAS;IACxC,MAAM,IAAI,GAAa,EAAE,CAAA;IACzB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QACnC,IAAI,CAAC,CAAC,CAAC,GAAG,CAAC,CAAA;IACb,CAAC;IACD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QACnC,IAAI,IAAI,GAAG,IAAI,CAAC,CAAC,CAAC,CAAA;QAClB,IAAI,CAAC,CAAC,CAAC,GAAG,CAAC,CAAA;QACX,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YACnC,MAAM,GAAG,GAAG,IAAI,CAAC,CAAC,CAAC,CAAA;YACnB,IAAI,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,GAAG,CAChB,IAAI,CAAC,CAAC,CAAC,GAAG,CAAC,EACX,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,EACf,IAAI,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAA;YACzC,IAAI,GAAG,GAAG,CAAA;QACZ,CAAC;IACH,CAAC;IACD,OAAO,IAAI,CAAC,CAAC,CAAC,MAAM,CAAC,CAAA;AACvB,CAAC;AAGD,oEAAoE;AACpE,sCAAsC;AACtC,mBAA0B,IAAY;IACpC,MAAM,OAAO,GAAG,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAA;IAC3D,OAAO,OAAO,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,EAAE,KAAK,CAAC,CAAC,CAAA;AACnD,CAAC;AAGD,gEAAgE;AAChE,gEAAgE;AAChE,mCAAmC;AACnC,SAAS,QAAQ,CAAC,IAAY;IAC5B,MAAM,KAAK,GAAG,SAAS,CAAC,IAAI,CAAC,CAAA;IAC7B,OAAO,GAAG,GAAG,CAAC,CAAC,GAAG,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,GAAG,GAAG,KAAK,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAA;AAC9D,CAAC;AAGD,oEAAoE;AACpE,iEAAiE;AACjE,iEAAiE;AACjE,mEAAmE;AACnE,oBACE,CAAM,EAAE,IAAe,EAAE,KAAa;IACtC,OAAO,OAAO,CAAC,CAAC,EAAE,IAAI,EAAE,KAAK,CAAC,CAAA;AAChC,CAAC;AAGD,mEAAmE;AACnE,sEAAsE;AACtE,mEAAmE;AACnE,mEAAmE;AACnE,SAAS,OAAO,CAAC,CAAM,EAAE,IAAe,EAAE,KAAa;IACrD,IAAI,KAAK,IAAI,CAAC,EAAE,CAAC;QACf,OAAO,GAAG,CAAA;IACZ,CAAC;IACD,IAAI,IAAI,KAAK,CAAC,EAAE,KAAK,EAAE,CAAC;QACtB,MAAM,IAAI,GAAG,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,IAAI,CAAC,uBAAY,CAAC,CAAA;QAClD,OAAO,GAAG;YACR,CAAC,CAAC,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC,CAAC,IAAI,GAAG,OAAO,CAAC,CAAC,CAAC,MAAM,CAAC,EAAE,EAAE,IAAI,EAAE,KAAK,GAAG,CAAC,CAAC;gBACzD,CAAC,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;YACpC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CACb,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC;gBACjB,CAAC,CAAC,CAAC,YAAY,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC;gBACvC,GAAG;gBACH,OAAO,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,IAAI,EAAE,KAAK,GAAG,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC;YAC/C,GAAG,CAAA;IACP,CAAC;IACD,IAAI,IAAI,KAAK,CAAC,EAAE,MAAM,EAAE,CAAC;QACvB,MAAM,IAAI,GAAG,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,GAAG,CAAC,CAAA;QAC/B,OAAO,GAAG;YACR,CAAC,CAAC,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC,CAAC,IAAI,GAAG,OAAO,CAAC,CAAC,CAAC,MAAM,CAAC,EAAE,EAAE,IAAI,EAAE,KAAK,GAAG,CAAC,CAAC;gBACzD,CAAC,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;YACpC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,OAAO,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,IAAI,EAAE,KAAK,GAAG,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC;YAC7D,GAAG,CAAA;IACP,CAAC;IACD,iEAAiE;IACjE,gEAAgE;IAChE,gEAAgE;IAChE,2DAA2D;IAC3D,IAAI,IAAI,KAAK,CAAC,EAAE,MAAM,EAAE,CAAC;QACvB,OAAO,GAAG,GAAG,OAAO,CAAC,CAAC,CAAC,GAAG,EAAE,IAAI,EAAE,KAAK,CAAC,CAAA;IAC1C,CAAC;IACD,IAAI,IAAI,KAAK,CAAC,EAAE,UAAU,IAAI,IAAI,KAAK,CAAC,EAAE,UAAU,EAAE,CAAC;QACrD,OAAO,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAM,EAAE,EAAE,CAC1B,IAAI,KAAK,CAAC,EAAE,UAAU,IAAI,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,MAAM;YACxC,CAAC,CAAC,GAAG,GAAG,OAAO,CAAC,CAAC,EAAE,IAAI,EAAE,KAAK,CAAC,GAAG,GAAG;YACrC,CAAC,CAAC,OAAO,CAAC,CAAC,EAAE,IAAI,EAAE,KAAK,CAAC,CAAC;aAC3B,IAAI,CAAC,IAAI,KAAK,CAAC,CAAC,UAAU,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,CAAA;IAC5C,CAAC;IAED,kEAAkE;IAClE,qEAAqE;IACrE,qEAAqE;IACrE,kEAAkE;IAClE,gEAAgE;IAChE,mEAAmE;IACnE,OAAO,OAAO,KAAK,IAAI,IAAI,IAAI,KAAK,CAAC,EAAE,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC,QAAQ,EAAE,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,KAAK,CAAA;AAChF,CAAC;AAGD,sEAAsE;AACtE,sEAAsE;AACtE,iEAAiE;AACjE,4CAA4C;AAC5C,SAAS,OAAO,CAAC,CAAM;IACrB,IAAI,IAAI,KAAK,CAAC,EAAE,KAAK,EAAE,CAAC;QACtB,OAAO,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,IAAI,CAAC,uBAAY,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAA;IACzD,CAAC;IACD,IAAI,IAAI,KAAK,CAAC,EAAE,MAAM,EAAE,CAAC;QACvB,OAAO,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAA;IACtC,CAAC;IACD,OAAO,EAAE,CAAA;AACX,CAAC;AAGD,SAAS,OAAO,CACd,IAAY,EAAE,IAAY,EAAE,OAAe,EAAE,IAAa;IAC1D,OAAO;QACL,IAAI;QACJ,KAAK,EAAE,WAAW;QAClB,QAAQ,EAAE,OAAO;QACjB,IAAI;QACJ,OAAO;QACP,KAAK,EAAE,EAAE;QACT,GAAG,CAAC,IAAI,IAAI,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,IAAI,EAAE,CAAC;KAClC,CAAA;AACH,CAAC;AAGD,+DAA+D;AAC/D,iEAAiE;AACjE,qEAAqE;AACrE,sEAAsE;AACtE,wDAAwD;AACxD,qBAA4B,GAAQ;IAClC,oEAAoE;IACpE,kEAAkE;IAClE,4DAA4D;IAC5D,mEAAmE;IACnE,4CAA4C;IAC5C,MAAM,GAAG,GAAQ,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,CAAA;IAC3B,OAAO,OAAO,CAAC,GAAG,CAAC,GAAG,EAAE,GAAG,EAAE,GAAG,CAAC,GAAG,CAAC,CAAA;AACvC,CAAC;AAGD,iEAAiE;AACjE,qEAAqE;AACrE,uEAAuE;AACvE,2DAA2D;AAC3D,uBAA8B,IAAS,EAAE,IAAY;IACnD,MAAM,KAAK,GAAG,SAAS,CAAC,IAAI,CAAC,CAAA;IAC7B,IAAI,EAAE,GAAQ,IAAI,CAAA;IAClB,IAAI,IAAI,GAAG,EAAE,CAAA;IACb,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;QACzB,MAAM,IAAI,GAAQ,IAAA,cAAQ,EAAC,EAAE,EAAE,IAAI,CAAC,CAAA;QACpC,IAAI,IAAI,IAAI,IAAI,EAAE,CAAC;YACjB,IAAI,GAAG,IAAI,CAAA;YACX,MAAK;QACP,CAAC;QACD,EAAE,GAAG,IAAI,CAAA;IACX,CAAC;IACD,MAAM,IAAI,GAAG,IAAI,KAAK,EAAE,EAAE,KAAK;QAC7B,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,IAAI,CAAC,uBAAY,CAAC;QACxC,CAAC,CAAC,CAAC,IAAI,KAAK,EAAE,EAAE,MAAM,CAAC,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAA;IACpD,MAAM,IAAI,GAAG,UAAU,CAAC,IAAI,EAAE,IAAI,CAAC,CAAA;IACnC,OAAO,OAAO,CACZ,SAAS,EACT,QAAQ,CAAC,IAAI,CAAC,EACd,YAAY,IAAI,kCAAkC,EAClD,IAAI,IAAI,IAAI,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,gBAAgB,IAAI,GAAG,CAAC,CAAA;AACvD,CAAC;AAGD,mEAAmE;AACnE,aACE,GAAW,EAAE,IAAY,EAAE,IAAmB;IAC9C,MAAM,OAAO,GAAG,IAAI,IAAI,EAAE,CAAA;IAC1B,MAAM,IAAI,GAAc,OAAO,CAAC,IAAI,IAAI,MAAM,CAAA;IAE9C,MAAM,KAAK,GAAG,IAAI,aAAK,CACrB,IAAI,IAAI,OAAO,CAAC,KAAK,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,EAAE,KAAK,EAAE,OAAO,CAAC,KAAK,EAAE,CAAC,CAAA;IAC/D,MAAM,GAAG,GAAG,KAAK,CAAC,GAAG,CAAC,EAAE,OAAO,EAAE,IAAI,EAAE,CAAC,CAAA;IACxC,MAAM,SAAS,GAAG,IAAI,IAAI,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,EAAE,IAAI,EAAE,OAAO,CAAC,IAAI,EAAE,CAAA;IAC3E,MAAM,IAAI,GAAQ,KAAK,CAAC,KAAK,CAAC,GAAG,EAAE,SAAS,EAAE,GAAG,CAAC,CAAA;IAElD,IAAI,CAAC,GAAG,GAAG,CAAC,GAAG,CAAC,MAAM,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,KAAK,IAAI,CAAC,KAAK,EAAE,CAAC;QAC9D,OAAO,EAAE,EAAE,EAAE,KAAK,EAAE,GAAG,EAAE,EAAE,EAAE,QAAQ,EAAE,CAAC,WAAW,CAAC,GAAG,CAAC,CAAC,EAAE,CAAA;IAC7D,CAAC;IAED,MAAM,IAAI,GAAQ,IAAA,cAAQ,EAAC,IAAI,EAAE,IAAI,CAAC,CAAA;IACtC,IAAI,IAAI,IAAI,IAAI,EAAE,CAAC;QACjB,OAAO,EAAE,EAAE,EAAE,KAAK,EAAE,GAAG,EAAE,EAAE,EAAE,QAAQ,EAAE,CAAC,aAAa,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC,EAAE,CAAA;IACtE,CAAC;IAED,IAAI,MAAM,KAAK,IAAI,EAAE,CAAC;QACpB,mEAAmE;QACnE,mEAAmE;QACnE,kEAAkE;QAClE,6DAA6D;QAC7D,mEAAmE;QACnE,4DAA4D;QAC5D,MAAM,MAAM,GAAG,GAAG,CAAC,GAAG,CAAC,MAAM,CAAA;QAC7B,MAAM,GAAG,GAAG,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,CAAA;QACzB,IAAI,MAAM,GAAG,GAAG,CAAC,GAAG,CAAC,MAAM,EAAE,CAAC;YAC5B,MAAM,GAAG,GAAQ,GAAG,CAAC,GAAG,CAAC,MAAM,CAAC,CAAA;YAChC,OAAO;gBACL,EAAE,EAAE,KAAK;gBACT,GAAG,EAAE,EAAE;gBACP,QAAQ,EAAE,CAAC,OAAO,CAChB,GAAG,EAAE,GAAG,IAAI,QAAQ,EACpB,QAAQ,CAAC,IAAI,CAAC,EACd,GAAG,EAAE,GAAG,IAAI,yCAAyC,CAAC,CAAC;aAC1D,CAAA;QACH,CAAC;QACD,OAAO,EAAE,EAAE,EAAE,IAAI,EAAE,GAAG,EAAE,IAAA,qBAAS,EAAC,GAAG,EAAE,CAAC,CAAC,EAAE,QAAQ,EAAE,EAAE,EAAE,CAAA;IAC3D,CAAC;IACD,IAAI,MAAM,KAAK,IAAI,EAAE,CAAC;QACpB,OAAO,EAAE,EAAE,EAAE,IAAI,EAAE,GAAG,EAAE,OAAO,CAAC,IAAI,CAAC,EAAE,QAAQ,EAAE,EAAE,EAAE,CAAA;IACvD,CAAC;IACD,OAAO;QACL,EAAE,EAAE,IAAI;QACR,GAAG,EAAE,OAAO,CAAC,IAAI,EAAE,IAAI,EAAE,OAAO,CAAC,KAAK,IAAI,QAAQ,CAAC;QACnD,QAAQ,EAAE,EAAE;KACb,CAAA;AACH,CAAC;AAUD,qEAAqE;AACrE,qEAAqE;AACrE,2DAA2D;AAC3D,EAAE;AACF,sEAAsE;AACtE,sEAAsE;AACtE,0DAA0D;AAC1D,aACE,GAAW,EAAE,IAAY,EAAE,IAAmB;IAC9C,MAAM,OAAO,GAAG,IAAI,IAAI,EAAE,CAAA;IAC1B,MAAM,KAAK,GAAG,IAAI,aAAK,CACrB,IAAI,IAAI,OAAO,CAAC,KAAK,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,EAAE,KAAK,EAAE,OAAO,CAAC,KAAK,EAAE,CAAC,CAAA;IAC/D,MAAM,IAAI,GAAG,IAAI,uBAAU,EAAE,CAAA;IAC7B,MAAM,GAAG,GAAG,KAAK,CAAC,GAAG,CAAC,EAAE,OAAO,EAAE,IAAI,EAAE,IAAI,EAAE,CAAC,CAAA;IAC9C,MAAM,SAAS,GAAG,IAAI,IAAI,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,EAAE,IAAI,EAAE,OAAO,CAAC,IAAI,EAAE,CAAA;IAE3E,gEAAgE;IAChE,iEAAiE;IACjE,kEAAkE;IAClE,iDAAiD;IACjD,MAAM,MAAM,GAAQ,KAAK,CAAC,KAAK,CAAC,GAAG,EAAE,SAAS,EAAE,GAAG,CAAC,CAAA;IACpD,IAAI,CAAC,GAAG,GAAG,CAAC,GAAG,CAAC,MAAM,IAAI,IAAI,IAAI,MAAM,EAAE,CAAC;QACzC,OAAO,EAAE,EAAE,EAAE,KAAK,EAAE,QAAQ,EAAE,CAAC,WAAW,CAAC,GAAG,CAAC,CAAC,EAAE,CAAA;IACpD,CAAC;IACD,IAAI,CAAC,WAAW,CAAC,MAAM,CAAC,CAAA;IAExB,MAAM,IAAI,GAAQ,KAAK,CAAC,KAAK,CAAC,MAAM,EAAE,SAAS,EAAE,GAAG,CAAC,CAAA;IACrD,IAAI,CAAC,GAAG,GAAG,CAAC,GAAG,CAAC,MAAM,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,KAAK,IAAI,CAAC,KAAK,EAAE,CAAC;QAC9D,OAAO,EAAE,EAAE,EAAE,KAAK,EAAE,QAAQ,EAAE,CAAC,WAAW,CAAC,GAAG,CAAC,CAAC,EAAE,CAAA;IACpD,CAAC;IAED,MAAM,IAAI,GAAQ,IAAA,cAAQ,EAAC,IAAI,EAAE,IAAI,CAAC,CAAA;IACtC,IAAI,IAAI,IAAI,IAAI,EAAE,CAAC;QACjB,OAAO,EAAE,EAAE,EAAE,KAAK,EAAE,QAAQ,EAAE,CAAC,aAAa,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC,EAAE,CAAA;IAC7D,CAAC;IAED,gEAAgE;IAChE,gEAAgE;IAChE,kEAAkE;IAClE,uBAAuB;IACvB,MAAM,KAAK,GAAG,SAAS,CAAC,IAAI,CAAC,CAAA;IAC7B,IAAI,CAAC,MAAM,CAAC,KAAK,EAAE,IAAI,CAAC,CAAA;IAExB,OAAO;QACL,EAAE,EAAE,IAAI;QACR,MAAM,EAAE;YACN,SAAS,EAAE,IAAI,CAAC,EAAE,CAAC,KAAK,CAAC;YACzB,IAAI,EAAE,QAAQ,CAAC,IAAI,CAAC;YACpB,KAAK,EAAE,IAAI,CAAC,KAAK;SAClB;QACD,QAAQ,EAAE,EAAE;KACb,CAAA;AACH,CAAC"}

package/dist/reach.d.ts

@@ -0,0 +1,14 @@
+import type { VetFinding } from './vet';
+import type { TrustOptions } from './type';
+export type ReachVerdict = 'reaches' | 'unreachable' | 'error';
+export type ReachReport = {
+    verdict: ReachVerdict;
+    path?: string[];
+    errors?: VetFinding[];
+};
+export type ReachOptions = {
+    path?: string;
+    trust?: TrustOptions;
+    relation?: string;
+};
+export declare function reachCheck(src: string, from: string, to: string, opts?: ReachOptions): ReachReport;

package/dist/reach.js

@@ -0,0 +1,140 @@
+"use strict";
+/* Copyright (c) 2025 Richard Rodger, MIT License */
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.reachCheck = reachCheck;
+// REACHABILITY OVER THE ENTITY GRAPH (the review's finding J,
+// use-cases/REVIEW.md): "ship a transitive `reaches(a, b)` check verb".
+//
+// `relations` answers questions about the edge set as a whole --- is it
+// acyclic, does every edge have its inverse, is every far end what the
+// relation says it is. This answers the question that needs the CLOSURE
+// rather than the edges: does anything `a` depends on, at any remove,
+// end up at `b`? That is the shape of every blast-radius question an
+// operator asks ("if the billing database goes, what falls over?") and
+// every containment question a policy asks ("nothing in the public tier
+// may reach the ledger"), and neither can be expressed by looking one
+// edge at a time.
+//
+// It is a VERB and not a constraint, for the same reason acyclicity is
+// (docs/reference-language.md, "Declared relations"): reachability is
+// global and non-monotone. One more edge can make an unreachable pair
+// reachable, so a lattice citizen asserting non-reachability could be
+// true and then false, and the lattice guarantee is that more
+// information never falsifies what has already been observed.
+//
+// TRANSITIVE, NOT REFLEXIVE-TRANSITIVE: `reaches(a, a)` is true only
+// when a path of one or more edges returns to `a`, which is the useful
+// answer (it says the graph has a cycle through `a`) rather than the
+// vacuous one.
+//
+// The Go twin is go/reach.go; what the two ports must agree on --- the
+// verdict and the path --- is test/spec/reach.tsv.
+const aontu_1 = require("./aontu");
+const vet_1 = require("./vet");
+const graph_1 = require("./graph");
+const keyorder_1 = require("./keyorder");
+// The entity an address names --- everything before the first dot. A
+// link into `svc/auth.ports.http` reaches `svc/auth`: reachability is
+// between ENTITIES, and the path inside one says which part of it the
+// link arrives at. Same rule as relation.ts's entityOf, and it has to
+// be, or the two verbs would disagree about what an edge connects.
+function entityOf(addr) {
+    const dot = addr.indexOf('.');
+    return dot < 0 ? addr : addr.slice(0, dot);
+}
+function endpointFinding(name, known) {
+    return {
+        code: 'refer_unresolved',
+        class: 'reference',
+        severity: 'error',
+        path: '$',
+        // NOT "unreachable". An endpoint that names no entity is a
+        // question the document cannot answer, and answering it `no` would
+        // report a typo as a fact about the model --- the fail-open shape
+        // this review exists to retire.
+        message: `${name} names no entity in this document.`,
+        sites: [],
+        ...(0 === known.length ? {} : {
+            note: 'known entities: ' + known.join(', '),
+        }),
+    };
+}
+// The reachability check for one document.
+function reachCheck(src, from, to, opts) {
+    const options = opts ?? {};
+    const aontu = new aontu_1.Aontu(null == options.trust ? undefined : { trust: options.trust });
+    const ctx = aontu.ctx({ collect: true });
+    const parseOpts = null == options.path ? undefined : { path: options.path };
+    const root = aontu.unify(src, parseOpts, ctx);
+    // A document that does not stand up is not a document with an
+    // unreachable pair: the errors it already has are the answer.
+    if (0 < ctx.err.length || true === root?.isNil) {
+        return {
+            verdict: 'error',
+            errors: [(0, vet_1.failureFinding)(ctx, options.path, root)],
+        };
+    }
+    const graph = (0, graph_1.graphOf)(root);
+    const known = graph.entities.map((e) => e.id).sort(keyorder_1.cmpCodePoint);
+    const missing = [from, to].filter((n) => !known.includes(n));
+    if (0 < missing.length) {
+        return {
+            verdict: 'error',
+            errors: missing.map((n) => endpointFinding(n, known)),
+        };
+    }
+    // The successor map, restricted to one relation when the caller asked
+    // for one. Sorted, so the path the search finds is the same one in
+    // both ports.
+    const succ = new Map();
+    for (const e of graph.edges) {
+        if ('' === e.from ||
+            (null != options.relation && options.relation !== e.key)) {
+            continue;
+        }
+        const list = succ.get(e.from);
+        const dest = entityOf(e.to);
+        if (undefined === list) {
+            succ.set(e.from, [dest]);
+        }
+        else if (!list.includes(dest)) {
+            list.push(dest);
+        }
+    }
+    for (const list of succ.values()) {
+        list.sort(keyorder_1.cmpCodePoint);
+    }
+    // BREADTH-FIRST, so the path reported is a SHORTEST one --- the
+    // evidence an operator wants is the tightest chain, not whichever the
+    // walk happened to find first --- and, with the successors sorted, a
+    // determined one: among shortest paths, the first in code-point order
+    // at the first step that distinguishes them.
+    const prev = new Map();
+    const seen = new Set();
+    let front = [from];
+    while (0 < front.length) {
+        const next = [];
+        for (const node of front) {
+            for (const dest of succ.get(node) ?? []) {
+                if (dest === to) {
+                    const path = [dest];
+                    let step = node;
+                    while (step !== from) {
+                        path.unshift(step);
+                        step = prev.get(step);
+                    }
+                    path.unshift(from);
+                    return { verdict: 'reaches', path };
+                }
+                if (!seen.has(dest)) {
+                    seen.add(dest);
+                    prev.set(dest, node);
+                    next.push(dest);
+                }
+            }
+        }
+        front = next;
+    }
+    return { verdict: 'unreachable' };
+}
+//# sourceMappingURL=reach.js.map

package/dist/reach.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"reach.js","sourceRoot":"","sources":["../src/reach.ts"],"names":[],"mappings":";AAAA,oDAAoD;;;AAEpD,8DAA8D;AAC9D,wEAAwE;AACxE,EAAE;AACF,wEAAwE;AACxE,uEAAuE;AACvE,wEAAwE;AACxE,sEAAsE;AACtE,qEAAqE;AACrE,uEAAuE;AACvE,wEAAwE;AACxE,sEAAsE;AACtE,kBAAkB;AAClB,EAAE;AACF,uEAAuE;AACvE,sEAAsE;AACtE,sEAAsE;AACtE,sEAAsE;AACtE,8DAA8D;AAC9D,8DAA8D;AAC9D,EAAE;AACF,qEAAqE;AACrE,uEAAuE;AACvE,qEAAqE;AACrE,eAAe;AACf,EAAE;AACF,uEAAuE;AACvE,mDAAmD;AAEnD,mCAA+B;AAC/B,+BAAsC;AAGtC,mCAAiC;AACjC,yCAAyC;AAiCzC,qEAAqE;AACrE,sEAAsE;AACtE,sEAAsE;AACtE,sEAAsE;AACtE,mEAAmE;AACnE,SAAS,QAAQ,CAAC,IAAY;IAC5B,MAAM,GAAG,GAAG,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,CAAA;IAC7B,OAAO,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,EAAE,GAAG,CAAC,CAAA;AAC5C,CAAC;AAGD,SAAS,eAAe,CAAC,IAAY,EAAE,KAAe;IACpD,OAAO;QACL,IAAI,EAAE,kBAAkB;QACxB,KAAK,EAAE,WAAW;QAClB,QAAQ,EAAE,OAAO;QACjB,IAAI,EAAE,GAAG;QACT,2DAA2D;QAC3D,mEAAmE;QACnE,kEAAkE;QAClE,gCAAgC;QAChC,OAAO,EAAE,GAAG,IAAI,oCAAoC;QACpD,KAAK,EAAE,EAAE;QACT,GAAG,CAAC,CAAC,KAAK,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;YAC5B,IAAI,EAAE,kBAAkB,GAAG,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC;SAC5C,CAAC;KACH,CAAA;AACH,CAAC;AAGD,2CAA2C;AAC3C,oBACE,GAAW,EAAE,IAAY,EAAE,EAAU,EAAE,IAAmB;IAE1D,MAAM,OAAO,GAAG,IAAI,IAAI,EAAE,CAAA;IAC1B,MAAM,KAAK,GAAG,IAAI,aAAK,CACrB,IAAI,IAAI,OAAO,CAAC,KAAK,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,EAAE,KAAK,EAAE,OAAO,CAAC,KAAK,EAAE,CAAC,CAAA;IAC/D,MAAM,GAAG,GAAG,KAAK,CAAC,GAAG,CAAC,EAAE,OAAO,EAAE,IAAI,EAAE,CAAC,CAAA;IACxC,MAAM,SAAS,GAAG,IAAI,IAAI,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,EAAE,IAAI,EAAE,OAAO,CAAC,IAAI,EAAE,CAAA;IAC3E,MAAM,IAAI,GAAQ,KAAK,CAAC,KAAK,CAAC,GAAG,EAAE,SAAS,EAAE,GAAG,CAAC,CAAA;IAElD,8DAA8D;IAC9D,8DAA8D;IAC9D,IAAI,CAAC,GAAG,GAAG,CAAC,GAAG,CAAC,MAAM,IAAI,IAAI,KAAK,IAAI,EAAE,KAAK,EAAE,CAAC;QAC/C,OAAO;YACL,OAAO,EAAE,OAAO;YAChB,MAAM,EAAE,CAAC,IAAA,oBAAc,EAAC,GAAG,EAAE,OAAO,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC;SAClD,CAAA;IACH,CAAC;IAED,MAAM,KAAK,GAAG,IAAA,eAAO,EAAC,IAAI,CAAC,CAAA;IAC3B,MAAM,KAAK,GAAG,KAAK,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,IAAI,CAAC,uBAAY,CAAC,CAAA;IAChE,MAAM,OAAO,GAAG,CAAC,IAAI,EAAE,EAAE,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,KAAK,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAA;IAC5D,IAAI,CAAC,GAAG,OAAO,CAAC,MAAM,EAAE,CAAC;QACvB,OAAO;YACL,OAAO,EAAE,OAAO;YAChB,MAAM,EAAE,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,eAAe,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC;SACtD,CAAA;IACH,CAAC;IAED,sEAAsE;IACtE,mEAAmE;IACnE,cAAc;IACd,MAAM,IAAI,GAAG,IAAI,GAAG,EAAoB,CAAA;IACxC,KAAK,MAAM,CAAC,IAAI,KAAK,CAAC,KAAK,EAAE,CAAC;QAC5B,IAAI,EAAE,KAAK,CAAC,CAAC,IAAI;YACf,CAAC,IAAI,IAAI,OAAO,CAAC,QAAQ,IAAI,OAAO,CAAC,QAAQ,KAAK,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC;YAC3D,SAAQ;QACV,CAAC;QACD,MAAM,IAAI,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,CAAA;QAC7B,MAAM,IAAI,GAAG,QAAQ,CAAC,CAAC,CAAC,EAAE,CAAC,CAAA;QAC3B,IAAI,SAAS,KAAK,IAAI,EAAE,CAAC;YACvB,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC,IAAI,CAAC,CAAC,CAAA;QAC1B,CAAC;aACI,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,EAAE,CAAC;YAC9B,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,CAAA;QACjB,CAAC;IACH,CAAC;IACD,KAAK,MAAM,IAAI,IAAI,IAAI,CAAC,MAAM,EAAE,EAAE,CAAC;QACjC,IAAI,CAAC,IAAI,CAAC,uBAAY,CAAC,CAAA;IACzB,CAAC;IAED,gEAAgE;IAChE,sEAAsE;IACtE,qEAAqE;IACrE,sEAAsE;IACtE,6CAA6C;IAC7C,MAAM,IAAI,GAAG,IAAI,GAAG,EAAkB,CAAA;IACtC,MAAM,IAAI,GAAG,IAAI,GAAG,EAAU,CAAA;IAC9B,IAAI,KAAK,GAAa,CAAC,IAAI,CAAC,CAAA;IAC5B,OAAO,CAAC,GAAG,KAAK,CAAC,MAAM,EAAE,CAAC;QACxB,MAAM,IAAI,GAAa,EAAE,CAAA;QACzB,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;YACzB,KAAK,MAAM,IAAI,IAAI,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,EAAE,EAAE,CAAC;gBACxC,IAAI,IAAI,KAAK,EAAE,EAAE,CAAC;oBAChB,MAAM,IAAI,GAAG,CAAC,IAAI,CAAC,CAAA;oBACnB,IAAI,IAAI,GAAG,IAAI,CAAA;oBACf,OAAO,IAAI,KAAK,IAAI,EAAE,CAAC;wBACrB,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,CAAA;wBAClB,IAAI,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,CAAW,CAAA;oBACjC,CAAC;oBACD,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,CAAA;oBAClB,OAAO,EAAE,OAAO,EAAE,SAAS,EAAE,IAAI,EAAE,CAAA;gBACrC,CAAC;gBACD,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC;oBACpB,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,CAAA;oBACd,IAAI,CAAC,GAAG,CAAC,IAAI,EAAE,IAAI,CAAC,CAAA;oBACpB,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,CAAA;gBACjB,CAAC;YACH,CAAC;QACH,CAAC;QACD,KAAK,GAAG,IAAI,CAAA;IACd,CAAC;IAED,OAAO,EAAE,OAAO,EAAE,aAAa,EAAE,CAAA;AACnC,CAAC"}

package/dist/relation.d.ts

@@ -0,0 +1,19 @@
+import type { VetFinding } from './vet';
+import type { TrustOptions } from './type';
+export type RelationVerdict = 'pass' | 'fail' | 'error';
+export type RelationFinding = {
+    code: string;
+    relation: string;
+    at: string;
+    detail: string[];
+};
+export type RelationReport = {
+    verdict: RelationVerdict;
+    findings: RelationFinding[];
+    errors?: VetFinding[];
+};
+export type RelationOptions = {
+    path?: string;
+    trust?: TrustOptions;
+};
+export declare function relationCheck(src: string, opts?: RelationOptions): RelationReport;

package/dist/relation.js

@@ -0,0 +1,305 @@
+"use strict";
+/* Copyright (c) 2025 Richard Rodger, MIT License */
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.relationCheck = relationCheck;
+// RELATION GRAPH CHECKS (G4 phase 5,
+// docs/capability-review/g4-identity-relations.md): acyclicity and
+// inverse consistency over the edge set, checked AFTER unification and
+// never by it.
+//
+// Why not in the lattice. Both properties are GLOBAL and NON-MONOTONE:
+// an acyclic graph becomes cyclic when one more edge unifies in, and an
+// inverse that is present becomes absent when the far side is narrowed.
+// The lattice guarantee is that more information never falsifies what
+// has been observed, so a constraint that could be true and then false
+// is not a constraint the lattice may hold. These are facts about the
+// finished model, and the verb that reports facts about a finished
+// model is where they belong.
+//
+// A relation is DECLARED as data, under the `relations` key of the
+// document root, which is the `std/system` vocabulary's convention:
+//
+//   relations: dependsOn: $.std.Relation & {
+//     target: $.std.Service, inverse: dependedOnBy, acyclic: true
+//   }
+//
+// Nothing in the engine knows the name `relations`; this pass does,
+// and says so.
+const aontu_1 = require("./aontu");
+const vet_1 = require("./vet");
+const graph_1 = require("./graph");
+const keyorder_1 = require("./keyorder");
+const unify_1 = require("./unify");
+// The entity an address names — everything before the first dot. An
+// edge into `svc/auth.ports.http` is an edge to `svc/auth`: a relation
+// holds between ENTITIES, and the path inside one says which part of it
+// the link reaches.
+function entityOf(addr) {
+    const dot = addr.indexOf('.');
+    return dot < 0 ? addr : addr.slice(0, dot);
+}
+// The node an address names, or undefined. The entity's own position
+// comes from the graph (a merged entity sits at every position that
+// declared it, and they hold the same value, so the FIRST in the
+// graph's sorted list is as good as any and is the same one in both
+// ports); the rest of the address walks into it, exactly as the
+// address's own grammar says.
+// NO GUARD ON THE LOOKUP OR THE WALK. An edge exists only because
+// `refer()` RESOLVED its full address, so `find` cannot miss and no
+// segment can fall off: an address that does not walk is
+// `refer_unresolved` at unification and the document never reaches the
+// graph (probed for a missing key, a scalar mid-path and an
+// out-of-range index, in both ports). An unreachable `if` is a branch
+// arm the ADR-002 gate counts and no marker suppresses, so the Go twin
+// keeps its guards — where a nil would PANIC rather than propagate,
+// and where the marker mechanism can carry them — and this one relies
+// on optional chaining instead.
+function addressed(root, graph, addr) {
+    const dot = addr.indexOf('.');
+    const name = dot < 0 ? addr : addr.slice(0, dot);
+    const entry = graph.entities.find((e) => e.id === name);
+    const segs = entry.paths[0].slice(2).split('.')
+        .concat(dot < 0 ? [] : addr.slice(dot + 1).split('.'));
+    let node = root;
+    for (const seg of segs) {
+        node = node?.peg?.[seg];
+    }
+    return node;
+}
+// Does the far end satisfy the declared target? A TEST, never a flow:
+// the check reports on a finished model and writing into it would be
+// generation, which `relations` does not do (the same rule that keeps
+// it from writing an author's inverse for them). So both sides are
+// CLONED into a throwaway context and the meet is taken there; what
+// the document holds is untouched either way.
+//
+// `refer(t)` is the other half of this and does flow, at the site. The
+// two agree on what "satisfies" means -- a meet that is not a nil --
+// which is what lets a relation declare once what every site would
+// otherwise repeat.
+// `root` is the DOCUMENT, not the node: a target lifted out of the
+// model (`target: $.std.Service`) can still hold a reference that
+// resolves against the document, and a probe rooted at the far end
+// answers `no_path` for it -- which the worked example in
+// test/spec/relation.tsv caught the moment this check existed.
+function meets(aontu, root, node, target) {
+    const ctx = aontu.ctx({ collect: true });
+    ctx.root = root;
+    const out = (0, unify_1.unite)(ctx, node.clone(ctx), target.clone(ctx), 'relation-target');
+    if (true === out?.isNil) {
+        return out.why;
+    }
+    if (0 < ctx.err.length) {
+        return ctx.err[0].why;
+    }
+    // A MEET THAT LEAVES A HOLE IS NOT SATISFACTION. `target:
+    // {kind: service, port: integer}` against a far end with no `port`
+    // does not CONFLICT -- the meet simply carries `integer` into a key
+    // that had none -- and a check that stopped at "no conflict" would
+    // pass a far end that is missing half of what the relation demands.
+    //
+    // What `refer(t)` does at the site is the yardstick: it flows `t` in,
+    // and the document then fails to generate, because `integer` is not a
+    // value. So the same question is asked here -- can the far end still
+    // generate once the target is met? -- and the answer is compared with
+    // the far end ALONE, so a node that was already incomplete for its
+    // own reasons is not blamed on the relation that points at it.
+    // The REASON reported is the engine's own -- the code `refer(t)` at
+    // the site would have raised -- rather than a name invented here.
+    const probe = (v) => {
+        const gctx = aontu.ctx({ collect: true });
+        gctx.root = root;
+        v.gen(gctx);
+        return 0 === gctx.err.length ? undefined : gctx.err[0].why;
+    };
+    const alone = probe(node.clone(aontu.ctx({ collect: true })));
+    const met = probe(out);
+    return undefined === alone && undefined !== met ? met : undefined;
+}
+function declaredRelations(root) {
+    const rels = root?.peg?.relations;
+    if (true !== rels?.isMap) {
+        return [];
+    }
+    const out = [];
+    for (const name of Object.keys(rels.peg).sort(keyorder_1.cmpCodePoint)) {
+        const r = rels.peg[name];
+        if (true !== r?.isMap) {
+            continue;
+        }
+        const inv = r.peg.inverse;
+        const acy = r.peg.acyclic;
+        const tgt = r.peg.target;
+        out.push({
+            name,
+            inverse: true === inv?.isScalar && 'string' === typeof inv.peg
+                ? inv.peg : undefined,
+            acyclic: true === acy?.isScalar && true === acy.peg,
+            target: true === tgt?.isVal && true !== tgt.isTop ? tgt : undefined,
+        });
+    }
+    return out;
+}
+// The first cycle reachable from `start`, as the entities it runs
+// through, or undefined. Depth-first with the path as the stack, and
+// the successors visited in sorted order, so the cycle a report names
+// is the same one in both ports.
+function findCycle(start, succ, done) {
+    const stack = [];
+    const onStack = new Set();
+    const walk = (node) => {
+        if (onStack.has(node)) {
+            return [...stack.slice(stack.indexOf(node)), node];
+        }
+        if (done.has(node)) {
+            return undefined;
+        }
+        done.add(node);
+        stack.push(node);
+        onStack.add(node);
+        for (const next of succ.get(node) ?? []) {
+            const found = walk(next);
+            if (undefined !== found) {
+                return found;
+            }
+        }
+        stack.pop();
+        onStack.delete(node);
+        return undefined;
+    };
+    return walk(start);
+}
+// The relation checks for one document.
+function relationCheck(src, opts) {
+    const options = opts ?? {};
+    const aontu = new aontu_1.Aontu(null == options.trust ? undefined : { trust: options.trust });
+    const ctx = aontu.ctx({ collect: true });
+    const parseOpts = null == options.path ? undefined : { path: options.path };
+    const root = aontu.unify(src, parseOpts, ctx);
+    // A document that does not stand up is not a document with a bad
+    // graph: the errors it already has are the answer, and blaming its
+    // relations on top would be noise.
+    if (0 < ctx.err.length || true === root?.isNil) {
+        return {
+            verdict: 'error',
+            findings: [],
+            errors: [(0, vet_1.failureFinding)(ctx, options.path, root)],
+        };
+    }
+    const declared = declaredRelations(root);
+    if (0 === declared.length) {
+        return { verdict: 'pass', findings: [] };
+    }
+    const graph = (0, graph_1.graphOf)(root);
+    const edges = graph.edges;
+    const findings = [];
+    // The edge set, indexed the two ways the checks read it.
+    const byRelation = new Map();
+    const pairs = new Set();
+    for (const e of edges) {
+        if ('' === e.from) {
+            // An edge outside every entity has no source to be a relation OF.
+            continue;
+        }
+        const list = byRelation.get(e.key);
+        if (undefined === list) {
+            byRelation.set(e.key, [e]);
+        }
+        else {
+            list.push(e);
+        }
+        pairs.add(e.key + ' ' + e.from + ' ' + entityOf(e.to));
+    }
+    for (const rel of declared) {
+        const mine = byRelation.get(rel.name) ?? [];
+        if (rel.acyclic) {
+            const succ = new Map();
+            for (const e of mine) {
+                const list = succ.get(e.from);
+                const to = entityOf(e.to);
+                if (undefined === list) {
+                    succ.set(e.from, [to]);
+                }
+                else {
+                    list.push(to);
+                }
+            }
+            for (const list of succ.values()) {
+                list.sort(keyorder_1.cmpCodePoint);
+            }
+            // The roots are visited in sorted order, and a node already
+            // settled is not revisited, so one cycle is reported once and the
+            // SAME one in both ports.
+            const done = new Set();
+            const roots = [...succ.keys()].sort(keyorder_1.cmpCodePoint);
+            for (const from of roots) {
+                const cycle = findCycle(from, succ, done);
+                if (undefined !== cycle) {
+                    // The cycle's first node is a key of `succ`, and every key of
+                    // `succ` came from an edge's `from`, so the edge is there.
+                    const at = mine.find((e) => e.from === cycle[0]);
+                    findings.push({
+                        code: 'relation_cycle',
+                        relation: rel.name,
+                        at: at.at,
+                        detail: cycle,
+                    });
+                    break;
+                }
+            }
+        }
+        // TARGET: the far end IS what the relation says it is (the review's
+        // finding J). The declaration used to be inert -- `target` was read
+        // by nothing, on the reasoning that `refer(t)` already flows the
+        // type in at the site. It does, and that is exactly why the
+        // declaration was worth nothing: the site has to REPEAT it, and the
+        // idiom that avoids repeating it (`refer($.std.Service)`) tripped
+        // the fixpoint until §19 was fixed, so every real model wrote bare
+        // `refer()` and a typed-endpoint declaration checked nothing.
+        //
+        // Reported per EDGE, not per entity: an entity reached by two
+        // relations must satisfy both, and the report points at the link
+        // that made the demand.
+        if (undefined !== rel.target) {
+            for (const e of mine) {
+                // No guard on the node either, and for the same reason
+                // `addressed` needs none: an unresolved link is a nil in the
+                // tree, so this document would not have reached the graph.
+                const why = meets(aontu, root, addressed(root, graph, e.to), rel.target);
+                if (undefined !== why) {
+                    findings.push({
+                        code: 'relation_target_unmet',
+                        relation: rel.name,
+                        at: e.at,
+                        detail: [e.from, e.to, why],
+                    });
+                }
+            }
+        }
+        if (undefined !== rel.inverse) {
+            for (const e of mine) {
+                const to = entityOf(e.to);
+                if (!pairs.has(rel.inverse + ' ' + to + ' ' + e.from)) {
+                    findings.push({
+                        code: 'relation_inverse_missing',
+                        relation: rel.name,
+                        at: e.at,
+                        detail: [e.from, to, rel.inverse],
+                    });
+                }
+            }
+        }
+    }
+    // SORTED, because a report is read by a machine that diffs it: by the
+    // position the offending edge is written at, then by code. No third
+    // key: one edge sits under one key and one key is one relation, so
+    // two findings can share (at, code) only by being the same finding.
+    // The sort is STABLE, and the relations were iterated in sorted
+    // order, so what order remains is fixed anyway.
+    findings.sort((a, b) => (0, keyorder_1.cmpCodePoint)(a.at, b.at) || (0, keyorder_1.cmpCodePoint)(a.code, b.code));
+    return {
+        verdict: 0 === findings.length ? 'pass' : 'fail',
+        findings,
+    };
+}
+//# sourceMappingURL=relation.js.map

package/dist/relation.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"relation.js","sourceRoot":"","sources":["../src/relation.ts"],"names":[],"mappings":";AAAA,oDAAoD;;;AAEpD,qCAAqC;AACrC,mEAAmE;AACnE,uEAAuE;AACvE,eAAe;AACf,EAAE;AACF,uEAAuE;AACvE,wEAAwE;AACxE,wEAAwE;AACxE,sEAAsE;AACtE,uEAAuE;AACvE,sEAAsE;AACtE,mEAAmE;AACnE,8BAA8B;AAC9B,EAAE;AACF,mEAAmE;AACnE,oEAAoE;AACpE,EAAE;AACF,6CAA6C;AAC7C,kEAAkE;AAClE,MAAM;AACN,EAAE;AACF,oEAAoE;AACpE,eAAe;AAEf,mCAA+B;AAC/B,+BAAsC;AAGtC,mCAAiC;AAEjC,yCAAyC;AACzC,mCAA+B;AAsD/B,oEAAoE;AACpE,uEAAuE;AACvE,wEAAwE;AACxE,oBAAoB;AACpB,SAAS,QAAQ,CAAC,IAAY;IAC5B,MAAM,GAAG,GAAG,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,CAAA;IAC7B,OAAO,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,EAAE,GAAG,CAAC,CAAA;AAC5C,CAAC;AAGD,qEAAqE;AACrE,oEAAoE;AACpE,iEAAiE;AACjE,oEAAoE;AACpE,gEAAgE;AAChE,8BAA8B;AAC9B,kEAAkE;AAClE,oEAAoE;AACpE,yDAAyD;AACzD,uEAAuE;AACvE,4DAA4D;AAC5D,sEAAsE;AACtE,uEAAuE;AACvE,oEAAoE;AACpE,sEAAsE;AACtE,gCAAgC;AAChC,SAAS,SAAS,CAChB,IAAS,EAAE,KAAY,EAAE,IAAY;IAErC,MAAM,GAAG,GAAG,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,CAAA;IAC7B,MAAM,IAAI,GAAG,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,EAAE,GAAG,CAAC,CAAA;IAChD,MAAM,KAAK,GAAG,KAAK,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,KAAK,IAAI,CAAgB,CAAA;IACtE,MAAM,IAAI,GAAG,KAAK,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,GAAG,CAAC;SAC5C,MAAM,CAAC,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,GAAG,GAAG,CAAC,CAAC,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAA;IACxD,IAAI,IAAI,GAAQ,IAAI,CAAA;IACpB,KAAK,MAAM,GAAG,IAAI,IAAI,EAAE,CAAC;QACvB,IAAI,GAAG,IAAI,EAAE,GAAG,EAAE,CAAC,GAAG,CAAC,CAAA;IACzB,CAAC;IACD,OAAO,IAAI,CAAA;AACb,CAAC;AAGD,sEAAsE;AACtE,qEAAqE;AACrE,sEAAsE;AACtE,mEAAmE;AACnE,oEAAoE;AACpE,8CAA8C;AAC9C,EAAE;AACF,uEAAuE;AACvE,qEAAqE;AACrE,mEAAmE;AACnE,oBAAoB;AACpB,mEAAmE;AACnE,kEAAkE;AAClE,mEAAmE;AACnE,0DAA0D;AAC1D,+DAA+D;AAC/D,SAAS,KAAK,CACZ,KAAU,EAAE,IAAS,EAAE,IAAS,EAAE,MAAW;IAE7C,MAAM,GAAG,GAAG,KAAK,CAAC,GAAG,CAAC,EAAE,OAAO,EAAE,IAAI,EAAE,CAAC,CAAA;IACxC,GAAG,CAAC,IAAI,GAAG,IAAI,CAAA;IACf,MAAM,GAAG,GAAQ,IAAA,aAAK,EAAC,GAAG,EAAE,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,EAAE,MAAM,CAAC,KAAK,CAAC,GAAG,CAAC,EAAE,iBAAiB,CAAC,CAAA;IAClF,IAAI,IAAI,KAAK,GAAG,EAAE,KAAK,EAAE,CAAC;QACxB,OAAO,GAAG,CAAC,GAAa,CAAA;IAC1B,CAAC;IACD,IAAI,CAAC,GAAG,GAAG,CAAC,GAAG,CAAC,MAAM,EAAE,CAAC;QACvB,OAAO,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAa,CAAA;IACjC,CAAC;IAED,0DAA0D;IAC1D,mEAAmE;IACnE,oEAAoE;IACpE,mEAAmE;IACnE,oEAAoE;IACpE,EAAE;IACF,sEAAsE;IACtE,sEAAsE;IACtE,qEAAqE;IACrE,sEAAsE;IACtE,mEAAmE;IACnE,+DAA+D;IAC/D,oEAAoE;IACpE,kEAAkE;IAClE,MAAM,KAAK,GAAG,CAAC,CAAM,EAAsB,EAAE;QAC3C,MAAM,IAAI,GAAG,KAAK,CAAC,GAAG,CAAC,EAAE,OAAO,EAAE,IAAI,EAAE,CAAC,CAAA;QACzC,IAAI,CAAC,IAAI,GAAG,IAAI,CAAA;QAChB,CAAC,CAAC,GAAG,CAAC,IAAI,CAAC,CAAA;QACX,OAAO,CAAC,KAAK,IAAI,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAE,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAc,CAAA;IACxE,CAAC,CAAA;IACD,MAAM,KAAK,GAAG,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,GAAG,CAAC,EAAE,OAAO,EAAE,IAAI,EAAE,CAAC,CAAC,CAAC,CAAA;IAC7D,MAAM,GAAG,GAAG,KAAK,CAAC,GAAG,CAAC,CAAA;IACtB,OAAO,SAAS,KAAK,KAAK,IAAI,SAAS,KAAK,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,SAAS,CAAA;AACnE,CAAC;AAGD,SAAS,iBAAiB,CAAC,IAAS;IAClC,MAAM,IAAI,GAAG,IAAI,EAAE,GAAG,EAAE,SAAS,CAAA;IACjC,IAAI,IAAI,KAAK,IAAI,EAAE,KAAK,EAAE,CAAC;QACzB,OAAO,EAAE,CAAA;IACX,CAAC;IACD,MAAM,GAAG,GAAe,EAAE,CAAA;IAC1B,KAAK,MAAM,IAAI,IAAI,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,IAAI,CAAC,uBAAY,CAAC,EAAE,CAAC;QAC5D,MAAM,CAAC,GAAQ,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,CAAA;QAC7B,IAAI,IAAI,KAAK,CAAC,EAAE,KAAK,EAAE,CAAC;YACtB,SAAQ;QACV,CAAC;QACD,MAAM,GAAG,GAAQ,CAAC,CAAC,GAAG,CAAC,OAAO,CAAA;QAC9B,MAAM,GAAG,GAAQ,CAAC,CAAC,GAAG,CAAC,OAAO,CAAA;QAC9B,MAAM,GAAG,GAAQ,CAAC,CAAC,GAAG,CAAC,MAAM,CAAA;QAC7B,GAAG,CAAC,IAAI,CAAC;YACP,IAAI;YACJ,OAAO,EAAE,IAAI,KAAK,GAAG,EAAE,QAAQ,IAAI,QAAQ,KAAK,OAAO,GAAG,CAAC,GAAG;gBAC5D,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,SAAS;YACvB,OAAO,EAAE,IAAI,KAAK,GAAG,EAAE,QAAQ,IAAI,IAAI,KAAK,GAAG,CAAC,GAAG;YACnD,MAAM,EAAE,IAAI,KAAK,GAAG,EAAE,KAAK,IAAI,IAAI,KAAK,GAAG,CAAC,KAAK,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,SAAS;SACpE,CAAC,CAAA;IACJ,CAAC;IACD,OAAO,GAAG,CAAA;AACZ,CAAC;AAGD,kEAAkE;AAClE,qEAAqE;AACrE,sEAAsE;AACtE,iCAAiC;AACjC,SAAS,SAAS,CAChB,KAAa,EACb,IAA2B,EAC3B,IAAiB;IAEjB,MAAM,KAAK,GAAa,EAAE,CAAA;IAC1B,MAAM,OAAO,GAAG,IAAI,GAAG,EAAU,CAAA;IAEjC,MAAM,IAAI,GAAG,CAAC,IAAY,EAAwB,EAAE;QAClD,IAAI,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC;YACtB,OAAO,CAAC,GAAG,KAAK,CAAC,KAAK,CAAC,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC,EAAE,IAAI,CAAC,CAAA;QACpD,CAAC;QACD,IAAI,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC;YACnB,OAAO,SAAS,CAAA;QAClB,CAAC;QACD,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,CAAA;QACd,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAA;QAChB,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,CAAA;QACjB,KAAK,MAAM,IAAI,IAAI,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,EAAE,EAAE,CAAC;YACxC,MAAM,KAAK,GAAG,IAAI,CAAC,IAAI,CAAC,CAAA;YACxB,IAAI,SAAS,KAAK,KAAK,EAAE,CAAC;gBACxB,OAAO,KAAK,CAAA;YACd,CAAC;QACH,CAAC;QACD,KAAK,CAAC,GAAG,EAAE,CAAA;QACX,OAAO,CAAC,MAAM,CAAC,IAAI,CAAC,CAAA;QACpB,OAAO,SAAS,CAAA;IAClB,CAAC,CAAA;IAED,OAAO,IAAI,CAAC,KAAK,CAAC,CAAA;AACpB,CAAC;AAGD,wCAAwC;AACxC,uBACE,GAAW,EAAE,IAAsB;IACnC,MAAM,OAAO,GAAG,IAAI,IAAI,EAAE,CAAA;IAC1B,MAAM,KAAK,GAAG,IAAI,aAAK,CACrB,IAAI,IAAI,OAAO,CAAC,KAAK,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,EAAE,KAAK,EAAE,OAAO,CAAC,KAAK,EAAE,CAAC,CAAA;IAC/D,MAAM,GAAG,GAAG,KAAK,CAAC,GAAG,CAAC,EAAE,OAAO,EAAE,IAAI,EAAE,CAAC,CAAA;IACxC,MAAM,SAAS,GAAG,IAAI,IAAI,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,EAAE,IAAI,EAAE,OAAO,CAAC,IAAI,EAAE,CAAA;IAC3E,MAAM,IAAI,GAAQ,KAAK,CAAC,KAAK,CAAC,GAAG,EAAE,SAAS,EAAE,GAAG,CAAC,CAAA;IAElD,iEAAiE;IACjE,mEAAmE;IACnE,mCAAmC;IACnC,IAAI,CAAC,GAAG,GAAG,CAAC,GAAG,CAAC,MAAM,IAAI,IAAI,KAAK,IAAI,EAAE,KAAK,EAAE,CAAC;QAC/C,OAAO;YACL,OAAO,EAAE,OAAO;YAChB,QAAQ,EAAE,EAAE;YACZ,MAAM,EAAE,CAAC,IAAA,oBAAc,EAAC,GAAG,EAAE,OAAO,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC;SAClD,CAAA;IACH,CAAC;IAED,MAAM,QAAQ,GAAG,iBAAiB,CAAC,IAAI,CAAC,CAAA;IACxC,IAAI,CAAC,KAAK,QAAQ,CAAC,MAAM,EAAE,CAAC;QAC1B,OAAO,EAAE,OAAO,EAAE,MAAM,EAAE,QAAQ,EAAE,EAAE,EAAE,CAAA;IAC1C,CAAC;IAED,MAAM,KAAK,GAAG,IAAA,eAAO,EAAC,IAAI,CAAC,CAAA;IAC3B,MAAM,KAAK,GAAG,KAAK,CAAC,KAAK,CAAA;IACzB,MAAM,QAAQ,GAAsB,EAAE,CAAA;IAEtC,yDAAyD;IACzD,MAAM,UAAU,GAAG,IAAI,GAAG,EAAkB,CAAA;IAC5C,MAAM,KAAK,GAAG,IAAI,GAAG,EAAU,CAAA;IAC/B,KAAK,MAAM,CAAC,IAAI,KAAK,EAAE,CAAC;QACtB,IAAI,EAAE,KAAK,CAAC,CAAC,IAAI,EAAE,CAAC;YAClB,kEAAkE;YAClE,SAAQ;QACV,CAAC;QACD,MAAM,IAAI,GAAG,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,CAAA;QAClC,IAAI,SAAS,KAAK,IAAI,EAAE,CAAC;YACvB,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC,CAAC,CAAA;QAC5B,CAAC;aACI,CAAC;YACJ,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAA;QACd,CAAC;QACD,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,GAAG,GAAG,GAAG,CAAC,CAAC,IAAI,GAAG,GAAG,GAAG,QAAQ,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAA;IACxD,CAAC;IAED,KAAK,MAAM,GAAG,IAAI,QAAQ,EAAE,CAAC;QAC3B,MAAM,IAAI,GAAG,UAAU,CAAC,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,EAAE,CAAA;QAE3C,IAAI,GAAG,CAAC,OAAO,EAAE,CAAC;YAChB,MAAM,IAAI,GAAG,IAAI,GAAG,EAAoB,CAAA;YACxC,KAAK,MAAM,CAAC,IAAI,IAAI,EAAE,CAAC;gBACrB,MAAM,IAAI,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,CAAA;gBAC7B,MAAM,EAAE,GAAG,QAAQ,CAAC,CAAC,CAAC,EAAE,CAAC,CAAA;gBACzB,IAAI,SAAS,KAAK,IAAI,EAAE,CAAC;oBACvB,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC,EAAE,CAAC,CAAC,CAAA;gBACxB,CAAC;qBACI,CAAC;oBACJ,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,CAAA;gBACf,CAAC;YACH,CAAC;YACD,KAAK,MAAM,IAAI,IAAI,IAAI,CAAC,MAAM,EAAE,EAAE,CAAC;gBACjC,IAAI,CAAC,IAAI,CAAC,uBAAY,CAAC,CAAA;YACzB,CAAC;YAED,4DAA4D;YAC5D,kEAAkE;YAClE,0BAA0B;YAC1B,MAAM,IAAI,GAAG,IAAI,GAAG,EAAU,CAAA;YAC9B,MAAM,KAAK,GAAG,CAAC,GAAG,IAAI,CAAC,IAAI,EAAE,CAAC,CAAC,IAAI,CAAC,uBAAY,CAAC,CAAA;YACjD,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;gBACzB,MAAM,KAAK,GAAG,SAAS,CAAC,IAAI,EAAE,IAAI,EAAE,IAAI,CAAC,CAAA;gBACzC,IAAI,SAAS,KAAK,KAAK,EAAE,CAAC;oBACxB,8DAA8D;oBAC9D,2DAA2D;oBAC3D,MAAM,EAAE,GAAG,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,KAAK,KAAK,CAAC,CAAC,CAAC,CAAS,CAAA;oBACxD,QAAQ,CAAC,IAAI,CAAC;wBACZ,IAAI,EAAE,gBAAgB;wBACtB,QAAQ,EAAE,GAAG,CAAC,IAAI;wBAClB,EAAE,EAAE,EAAE,CAAC,EAAE;wBACT,MAAM,EAAE,KAAK;qBACd,CAAC,CAAA;oBACF,MAAK;gBACP,CAAC;YACH,CAAC;QACH,CAAC;QAED,oEAAoE;QACpE,oEAAoE;QACpE,iEAAiE;QACjE,4DAA4D;QAC5D,oEAAoE;QACpE,kEAAkE;QAClE,mEAAmE;QACnE,8DAA8D;QAC9D,EAAE;QACF,8DAA8D;QAC9D,iEAAiE;QACjE,wBAAwB;QACxB,IAAI,SAAS,KAAK,GAAG,CAAC,MAAM,EAAE,CAAC;YAC7B,KAAK,MAAM,CAAC,IAAI,IAAI,EAAE,CAAC;gBACrB,uDAAuD;gBACvD,6DAA6D;gBAC7D,2DAA2D;gBAC3D,MAAM,GAAG,GAAG,KAAK,CAAC,KAAK,EAAE,IAAI,EAAE,SAAS,CAAC,IAAI,EAAE,KAAK,EAAE,CAAC,CAAC,EAAE,CAAC,EACzD,GAAG,CAAC,MAAM,CAAC,CAAA;gBACb,IAAI,SAAS,KAAK,GAAG,EAAE,CAAC;oBACtB,QAAQ,CAAC,IAAI,CAAC;wBACZ,IAAI,EAAE,uBAAuB;wBAC7B,QAAQ,EAAE,GAAG,CAAC,IAAI;wBAClB,EAAE,EAAE,CAAC,CAAC,EAAE;wBACR,MAAM,EAAE,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,EAAE,EAAE,GAAG,CAAC;qBAC5B,CAAC,CAAA;gBACJ,CAAC;YACH,CAAC;QACH,CAAC;QAED,IAAI,SAAS,KAAK,GAAG,CAAC,OAAO,EAAE,CAAC;YAC9B,KAAK,MAAM,CAAC,IAAI,IAAI,EAAE,CAAC;gBACrB,MAAM,EAAE,GAAG,QAAQ,CAAC,CAAC,CAAC,EAAE,CAAC,CAAA;gBACzB,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,GAAG,CAAC,OAAO,GAAG,GAAG,GAAG,EAAE,GAAG,GAAG,GAAG,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC;oBACtD,QAAQ,CAAC,IAAI,CAAC;wBACZ,IAAI,EAAE,0BAA0B;wBAChC,QAAQ,EAAE,GAAG,CAAC,IAAI;wBAClB,EAAE,EAAE,CAAC,CAAC,EAAE;wBACR,MAAM,EAAE,CAAC,CAAC,CAAC,IAAI,EAAE,EAAE,EAAE,GAAG,CAAC,OAAO,CAAC;qBAClC,CAAC,CAAA;gBACJ,CAAC;YACH,CAAC;QACH,CAAC;IACH,CAAC;IAED,sEAAsE;IACtE,oEAAoE;IACpE,mEAAmE;IACnE,oEAAoE;IACpE,gEAAgE;IAChE,gDAAgD;IAChD,QAAQ,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CACrB,IAAA,uBAAY,EAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,CAAC,IAAI,IAAA,uBAAY,EAAC,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,CAAA;IAE3D,OAAO;QACL,OAAO,EAAE,CAAC,KAAK,QAAQ,CAAC,MAAM,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,MAAM;QAChD,QAAQ;KACT,CAAA;AACH,CAAC"}

package/dist/report-sarif.d.ts

@@ -0,0 +1,14 @@
+import type { VetReport } from './vet';
+/**
+ * Render a vet report as SARIF 2.1.0 text (a minimal profile: one run,
+ * one result per finding, the finding embedded in `properties`).
+ *
+ * @param report   A report from `vet()`.
+ * @param version  The producer version for `tool.driver.version` —
+ *                 the CLI passes its package version; the two ports'
+ *                 version series are independent by design.
+ * @returns        The SARIF JSON text, indented two spaces, keys in
+ *                 the canonical emitter's sorted order.
+ */
+declare function sarifReport(report: VetReport, version: string): string;
+export { sarifReport, };

package/dist/report-sarif.js

@@ -0,0 +1,102 @@
+"use strict";
+/* Copyright (c) 2025 Richard Rodger, MIT License */
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.sarifReport = sarifReport;
+const exactjson_1 = require("./exactjson");
+// SARIF levels are error/warning/note; the report's severities are
+// error/warning/info. Only `info` needs translating, but the map spells
+// out all three so a new severity fails loudly here rather than
+// silently emitting itself.
+const SARIF_LEVEL = {
+    error: 'error',
+    warning: 'warning',
+    info: 'note',
+};
+// A site's file is a filesystem path, and a SARIF artifactLocation.uri
+// is a URI reference: `#`, `%`, spaces and every other URI-significant
+// character must be percent-encoded or a consumer parses the path as
+// something else (text after `#` becomes a fragment). Encoded BY BYTE
+// over UTF-8, with RFC 3986's unreserved and path characters kept
+// literal, so the Go twin produces identical bytes from an identical
+// loop (go/report_sarif.go sarifURI).
+function sarifUri(path) {
+    const bytes = Buffer.from(path, 'utf8');
+    let out = '';
+    for (const b of bytes) {
+        const c = String.fromCharCode(b);
+        if (b < 128 && /[A-Za-z0-9\-._~/!$&'()*+,;=:@]/.test(c)) {
+            out += c;
+        }
+        else {
+            out += '%' + b.toString(16).toUpperCase().padStart(2, '0');
+        }
+    }
+    return out;
+}
+function sarifLocation(site) {
+    const physical = {
+        artifactLocation: { uri: sarifUri(site.file) },
+    };
+    // SARIF regions are 1-based. A finding with no position — a parse
+    // failure reports at -1:-1 — gets a location with no region rather
+    // than an invented one.
+    if (1 <= site.row) {
+        physical.region = { startColumn: site.col, startLine: site.row };
+    }
+    return { physicalLocation: physical };
+}
+function sarifResult(finding) {
+    // The engine orders sites data-first (the thing to fix), so the first
+    // site is the primary location and the rest are related — which for a
+    // two-site conflict puts the schema's declaration under
+    // `relatedLocations`, exactly where a code-scanning UI shows "the
+    // other side".
+    const result = {
+        level: SARIF_LEVEL[finding.severity],
+        locations: [sarifLocation(finding.sites[0])],
+        message: { text: finding.message },
+        properties: finding,
+        ruleId: 'aontu/' + finding.code,
+    };
+    const related = finding.sites.slice(1);
+    if (0 < related.length) {
+        result.relatedLocations = related.map(sarifLocation);
+    }
+    return result;
+}
+/**
+ * Render a vet report as SARIF 2.1.0 text (a minimal profile: one run,
+ * one result per finding, the finding embedded in `properties`).
+ *
+ * @param report   A report from `vet()`.
+ * @param version  The producer version for `tool.driver.version` —
+ *                 the CLI passes its package version; the two ports'
+ *                 version series are independent by design.
+ * @returns        The SARIF JSON text, indented two spaces, keys in
+ *                 the canonical emitter's sorted order.
+ */
+function sarifReport(report, version) {
+    return (0, exactjson_1.exactJSON)({
+        $schema: 'https://json.schemastore.org/sarif-2.1.0.json',
+        runs: [{
+                // An `error` verdict means the run could not be set up (an
+                // unusable schema): zero findings from a FAILED run must not
+                // read like zero findings from a clean one, so the failure is
+                // carried in SARIF's own invocation metadata rather than by an
+                // indistinguishable empty result list.
+                invocations: [{
+                        executionSuccessful: 'error' !== report.verdict,
+                    }],
+                results: report.findings.map(sarifResult),
+                tool: {
+                    driver: {
+                        informationUri: 'https://github.com/rjrodger/aontu',
+                        name: 'aontu',
+                        version,
+                    },
+                },
+            }],
+        version: '2.1.0',
+    }, 2);
+} /* node:coverage ignore next 6 */
+//# sourceMappingURL=report-sarif.js.map

package/dist/report-sarif.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"report-sarif.js","sourceRoot":"","sources":["../src/report-sarif.ts"],"names":[],"mappings":";AAAA,oDAAoD;;QAuIlD,WAAW;AA9Gb,2CAAuC;AAGvC,mEAAmE;AACnE,wEAAwE;AACxE,gEAAgE;AAChE,4BAA4B;AAC5B,MAAM,WAAW,GAA2B;IAC1C,KAAK,EAAE,OAAO;IACd,OAAO,EAAE,SAAS;IAClB,IAAI,EAAE,MAAM;CACb,CAAA;AAGD,uEAAuE;AACvE,uEAAuE;AACvE,qEAAqE;AACrE,sEAAsE;AACtE,kEAAkE;AAClE,qEAAqE;AACrE,sCAAsC;AACtC,SAAS,QAAQ,CAAC,IAAY;IAC5B,MAAM,KAAK,GAAG,MAAM,CAAC,IAAI,CAAC,IAAI,EAAE,MAAM,CAAC,CAAA;IACvC,IAAI,GAAG,GAAG,EAAE,CAAA;IACZ,KAAK,MAAM,CAAC,IAAI,KAAK,EAAE,CAAC;QACtB,MAAM,CAAC,GAAG,MAAM,CAAC,YAAY,CAAC,CAAC,CAAC,CAAA;QAChC,IAAI,CAAC,GAAG,GAAG,IAAI,gCAAgC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC;YACxD,GAAG,IAAI,CAAC,CAAA;QACV,CAAC;aACI,CAAC;YACJ,GAAG,IAAI,GAAG,GAAG,CAAC,CAAC,QAAQ,CAAC,EAAE,CAAC,CAAC,WAAW,EAAE,CAAC,QAAQ,CAAC,CAAC,EAAE,GAAG,CAAC,CAAA;QAC5D,CAAC;IACH,CAAC;IACD,OAAO,GAAG,CAAA;AACZ,CAAC;AAGD,SAAS,aAAa,CAAC,IAAa;IAClC,MAAM,QAAQ,GAAQ;QACpB,gBAAgB,EAAE,EAAE,GAAG,EAAE,QAAQ,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE;KAC/C,CAAA;IACD,kEAAkE;IAClE,mEAAmE;IACnE,wBAAwB;IACxB,IAAI,CAAC,IAAI,IAAI,CAAC,GAAG,EAAE,CAAC;QAClB,QAAQ,CAAC,MAAM,GAAG,EAAE,WAAW,EAAE,IAAI,CAAC,GAAG,EAAE,SAAS,EAAE,IAAI,CAAC,GAAG,EAAE,CAAA;IAClE,CAAC;IACD,OAAO,EAAE,gBAAgB,EAAE,QAAQ,EAAE,CAAA;AACvC,CAAC;AAGD,SAAS,WAAW,CAAC,OAAmB;IACtC,sEAAsE;IACtE,sEAAsE;IACtE,wDAAwD;IACxD,kEAAkE;IAClE,eAAe;IACf,MAAM,MAAM,GAAQ;QAClB,KAAK,EAAE,WAAW,CAAC,OAAO,CAAC,QAAQ,CAAC;QACpC,SAAS,EAAE,CAAC,aAAa,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC;QAC5C,OAAO,EAAE,EAAE,IAAI,EAAE,OAAO,CAAC,OAAO,EAAE;QAClC,UAAU,EAAE,OAAO;QACnB,MAAM,EAAE,QAAQ,GAAG,OAAO,CAAC,IAAI;KAChC,CAAA;IACD,MAAM,OAAO,GAAG,OAAO,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,CAAC,CAAA;IACtC,IAAI,CAAC,GAAG,OAAO,CAAC,MAAM,EAAE,CAAC;QACvB,MAAM,CAAC,gBAAgB,GAAG,OAAO,CAAC,GAAG,CAAC,aAAa,CAAC,CAAA;IACtD,CAAC;IACD,OAAO,MAAM,CAAA;AACf,CAAC;AAGD;;;;;;;;;;GAUG;AACH,SAAS,WAAW,CAAC,MAAiB,EAAE,OAAe;IACrD,OAAO,IAAA,qBAAS,EAAC;QACf,OAAO,EAAE,+CAA+C;QACxD,IAAI,EAAE,CAAC;gBACL,2DAA2D;gBAC3D,6DAA6D;gBAC7D,8DAA8D;gBAC9D,+DAA+D;gBAC/D,uCAAuC;gBACvC,WAAW,EAAE,CAAC;wBACZ,mBAAmB,EAAE,OAAO,KAAK,MAAM,CAAC,OAAO;qBAChD,CAAC;gBACF,OAAO,EAAE,MAAM,CAAC,QAAQ,CAAC,GAAG,CAAC,WAAW,CAAC;gBACzC,IAAI,EAAE;oBACJ,MAAM,EAAE;wBACN,cAAc,EAAE,mCAAmC;wBACnD,IAAI,EAAE,OAAO;wBACb,OAAO;qBACR;iBACF;aACF,CAAC;QACF,OAAO,EAAE,OAAO;KACjB,EAAE,CAAC,CAAC,CAAA;AACP,CAAC,CAAC,iCAAiC"}