universal-physics-tensor 8.0.0 → 10.0.0

package/dist/bridges/catalog-adapter.js.map

@@ -1 +1 @@
-{"version":3,"file":"catalog-adapter.js","sourceRoot":"","sources":["../../src/bridges/catalog-adapter.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GA6BG;AAWH,OAAO,EAAE,4BAA4B,EAAE,MAAM,gCAAgC,CAAC;AAC9E,OAAO,EAAE,MAAM,EAAE,MAAM,2BAA2B,CAAC;AA4CnD;;;;;GAKG;AACH,MAAM,OAAO,qBAAsB,SAAQ,KAAK;IAC9B,MAAM,CAAyB;IAE/C,YAAY,MAA8B;QACxC,KAAK,CACH,0BAA0B,MAAM,CAAC,MAAM,CAAC,MAAM,2BAA2B;YACzE,eAAe,MAAM,CAAC,OAAO,CAAC,MAAM,oBAAoB;YACxD,gBAAgB,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,OAAO,IAAI,QAAQ,EAAE,CACxD,CAAC;QACF,IAAI,CAAC,IAAI,GAAG,uBAAuB,CAAC;QACpC,IAAI,CAAC,MAAM,GAAG,MAAM,CAAC;IACvB,CAAC;CACF;AAED,8EAA8E;AAC9E,uCAAuC;AACvC,8EAA8E;AAE9E;;;;;;;GAOG;AACH,SAAS,sBAAsB,CAAC,MAAc;IAC5C,QAAQ,MAAM,EAAE,CAAC;QACf,KAAK,aAAa,EAAE,OAAO,aAAa,CAAC;QACzC,KAAK,aAAa,EAAE,OAAO,aAAa,CAAC;QACzC,KAAK,oBAAoB,EAAE,OAAO,oBAAoB,CAAC;QACvD,KAAK,SAAS;YACZ,yDAAyD;YACzD,6DAA6D;YAC7D,0DAA0D;YAC1D,OAAO,oBAAoB,CAAC;QAC9B;YACE,OAAO,oBAAoB,CAAC;IAChC,CAAC;AACH,CAAC;AAED;;;;;;;;;GASG;AACH,SAAS,YAAY,CAAC,KAAa;IACjC,QAAQ,KAAK,EAAE,CAAC;QACd,KAAK,SAAS,CAAC;QACf,KAAK,YAAY,CAAC;QAClB,KAAK,WAAW,CAAC;QACjB,KAAK,cAAc;YACjB,OAAO,KAAK,CAAC;QACf;YACE,OAAO,SAAS,CAAC;IACrB,CAAC;AACH,CAAC;AAED,8EAA8E;AAC9E,4CAA4C;AAC5C,8EAA8E;AAE9E;;;;;;;;;GASG;AACH,MAAM,UAAU,cAAc,CAC5B,OAA2C;IAE3C,MAAM,GAAG,GAAiB,EAAE,CAAC;IAC7B,KAAK,MAAM,KAAK,IAAI,OAAO,EAAE,CAAC;QAC5B,MAAM,IAAI,GAAG,iBAAiB,CAAC,KAAK,CAAC,CAAC;QACtC,IAAI,IAAI,KAAK,IAAI;YAAE,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IACpC,CAAC;IACD,OAAO,GAAG,CAAC;AACb,CAAC;AAED;;;;;;GAMG;AACH,SAAS,iBAAiB,CAAC,KAA0B;IACnD,MAAM,CAAC,SAAS,EAAE,OAAO,CAAC,GAAG,KAAK,CAAC,OAAO,CAAC;IAC3C,MAAM,SAAS,GAAG,YAAY,CAAC,SAAS,CAAC,CAAC;IAC1C,MAAM,OAAO,GAAG,YAAY,CAAC,OAAO,CAAC,CAAC;IACtC,MAAM,MAAM,GAAkB,SAAS,CAAC,CAAC,CAAC,EAAE,KAAK,EAAE,SAAS,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;IACpE,MAAM,MAAM,GAAkB,OAAO,CAAC,CAAC,CAAC,EAAE,KAAK,EAAE,OAAO,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;IAEhE,iEAAiE;IACjE,mEAAmE;IACnE,uDAAuD;IACvD,iBAAiB;IACjB,IACE,MAAM,CAAC,KAAK,KAAK,SAAS;QAC1B,MAAM,CAAC,KAAK,KAAK,SAAS,EAC1B,CAAC;QACD,OAAO,IAAI,CAAC;IACd,CAAC;IAED,gEAAgE;IAChE,MAAM,QAAQ,GAAG,KAAK,CAAC,aAAa,IAAI,KAAK,CAAC,aAAa,CAAC,MAAM,GAAG,CAAC;QACpE,CAAC,CAAC,KAAK,CAAC,aAAa;QACrB,CAAC,CAAC,6BAA6B,KAAK,CAAC,EAAE,GAAG,CAAC;IAE7C,OAAO;QACL,IAAI,EAAE,QAAQ;QACd,EAAE,EAAE,MAAM,KAAK,CAAC,EAAE,EAAE;QACpB,IAAI,EAAE,KAAK,CAAC,IAAI;QAChB,QAAQ;QACR,UAAU,EAAE,sBAAsB,CAAC,KAAK,CAAC,MAAM,CAAC;QAChD,MAAM;QACN,MAAM;QACN,SAAS,EAAE,KAAK,CAAC,MAAM,KAAK,aAAa;QACzC,WAAW,EAAE,KAAK,CAAC,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,IAAI;KAC7E,CAAC;AACJ,CAAC;AAED,8EAA8E;AAC9E,gEAAgE;AAChE,8EAA8E;AAE9E;;;;;;;;;;;;GAYG;AACH,SAAS,2BAA2B,CAClC,KAA0B;IAE1B,MAAM,MAAM,GAAG,MAAM,KAAK,CAAC,EAAE,EAAE,CAAC;IAChC,iEAAiE;IACjE,iEAAiE;IACjE,gBAAgB;IAChB,IAAI,KAAK,CAAC,qBAAqB,KAAK,IAAI,EAAE,CAAC;QACzC,OAAO;YACL,QAAQ,EAAE,OAAO;YACjB,QAAQ,EAAE,yBAAyB;YACnC,MAAM;YACN,OAAO,EACL,MAAM,KAAK,CAAC,EAAE,MAAM,KAAK,CAAC,IAAI,gCAAgC;gBAC9D,6DAA6D;gBAC7D,wBAAwB;SAC3B,CAAC;IACJ,CAAC;IACD,gCAAgC;IAChC,MAAM,QAAQ,GAAG,4BAA4B,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC;IAC5D,IAAI,QAAQ,KAAK,SAAS,EAAE,CAAC;QAC3B,OAAO;YACL,QAAQ,EAAE,MAAM;YAChB,QAAQ,EAAE,yBAAyB;YACnC,MAAM;YACN,OAAO,EACL,MAAM,KAAK,CAAC,EAAE,MAAM,KAAK,CAAC,IAAI,qBAAqB;gBACnD,2DAA2D;gBAC3D,uDAAuD;SAC1D,CAAC;IACJ,CAAC;IACD,MAAM,iBAAiB,GAAG,MAAM,CAAC,QAAQ,CAAC,CAAC;IAC3C,IAAI,KAAK,CAAC,qBAAqB,KAAK,iBAAiB,EAAE,CAAC;QACtD,OAAO;YACL,QAAQ,EAAE,OAAO;YACjB,QAAQ,EAAE,yBAAyB;YACnC,MAAM;YACN,OAAO,EACL,MAAM,KAAK,CAAC,EAAE,MAAM,KAAK,CAAC,IAAI,+BAA+B;gBAC7D,IAAI,KAAK,CAAC,qBAAqB,qCAAqC;gBACpE,SAAS,iBAAiB,sCAAsC;SACnE,CAAC;IACJ,CAAC;IACD,OAAO,SAAS,CAAC;AACnB,CAAC;AAED,8EAA8E;AAC9E,sBAAsB;AACtB,8EAA8E;AAE9E;;;;;;GAMG;AACH,MAAM,UAAU,WAAW,CACzB,OAA2C;IAE3C,MAAM,QAAQ,GAAyB,EAAE,CAAC;IAC1C,MAAM,MAAM,GAAqB,EAAE,CAAC;IACpC,MAAM,QAAQ,GAAqB,EAAE,CAAC;IACtC,MAAM,IAAI,GAAqB,EAAE,CAAC;IAClC,MAAM,WAAW,GAAa,EAAE,CAAC;IACjC,MAAM,SAAS,GAAiB,EAAE,CAAC;IAEnC,KAAK,MAAM,KAAK,IAAI,OAAO,EAAE,CAAC;QAC5B,MAAM,UAAU,GAAG,2BAA2B,CAAC,KAAK,CAAC,CAAC;QACtD,MAAM,IAAI,GAAG,iBAAiB,CAAC,KAAK,CAAC,CAAC;QACtC,MAAM,WAAW,GAAG,IAAI,KAAK,IAAI,CAAC;QAClC,IAAI,CAAC,WAAW;YAAE,WAAW,CAAC,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC;;YACxC,SAAS,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAE1B,IAAI,UAAU,EAAE,CAAC;YACf,QAAQ,UAAU,CAAC,QAAQ,EAAE,CAAC;gBAC5B,KAAK,OAAO;oBAAE,MAAM,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC;oBAAC,MAAM;gBAC7C,KAAK,SAAS;oBAAE,QAAQ,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC;oBAAC,MAAM;gBACjD,KAAK,MAAM;oBAAE,IAAI,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC;oBAAC,MAAM;YAC5C,CAAC;QACH,CAAC;QAED,QAAQ,CAAC,IAAI,CAAC;YACZ,QAAQ,EAAE,KAAK,CAAC,EAAE;YAClB,IAAI,EAAE,KAAK,CAAC,IAAI;YAChB,SAAS,EAAE,WAAW;YACtB,GAAG,CAAC,UAAU,CAAC,CAAC,CAAC,EAAE,UAAU,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;SACtC,CAAC,CAAC;IACL,CAAC;IAED,OAAO;QACL,OAAO,EAAE,QAAQ;QACjB,MAAM;QACN,QAAQ;QACR,IAAI;QACJ,WAAW;QACX,SAAS;KACV,CAAC;AACJ,CAAC;AAED;;;;;;;GAOG;AACH,MAAM,UAAU,aAAa,CAC3B,MAAuB,EACvB,OAA2C;IAE3C,MAAM,MAAM,GAAG,WAAW,CAAC,OAAO,CAAC,CAAC;IACpC,IAAI,MAAM,CAAC,MAAM,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QAC7B,MAAM,IAAI,qBAAqB,CAAC,MAAM,CAAC,CAAC;IAC1C,CAAC;IACD,KAAK,MAAM,IAAI,IAAI,MAAM,CAAC,SAAS,EAAE,CAAC;QACpC,MAAM,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC;IACvB,CAAC;IACD,OAAO,MAAM,CAAC;AAChB,CAAC;AAED;;;;;;GAMG;AACH,MAAM,UAAU,2BAA2B,CACzC,MAA8B;IAE9B,MAAM,WAAW,GAAG;QAClB,GAAG,MAAM,CAAC,MAAM;QAChB,GAAG,MAAM,CAAC,QAAQ;QAClB,GAAG,MAAM,CAAC,IAAI;KACf,CAAC;IACF,OAAO;QACL,WAAW;QACX,UAAU,EAAE,MAAM,CAAC,MAAM,CAAC,MAAM;QAChC,YAAY,EAAE,MAAM,CAAC,QAAQ,CAAC,MAAM;QACpC,SAAS,EAAE,MAAM,CAAC,IAAI,CAAC,MAAM;KAC9B,CAAC;AACJ,CAAC"}
+{"version":3,"file":"catalog-adapter.js","sourceRoot":"","sources":["../../src/bridges/catalog-adapter.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GAiCG;AAYH,OAAO,EAAE,4BAA4B,EAAE,MAAM,gCAAgC,CAAC;AAC9E,OAAO,EAAE,cAAc,EAAE,MAAM,mBAAmB,CAAC;AACnD,OAAO,EAAE,MAAM,EAAE,MAAM,2BAA2B,CAAC;AA8CnD;;;;;GAKG;AACH,MAAM,OAAO,qBAAsB,SAAQ,KAAK;IAC9B,MAAM,CAAyB;IAE/C,YAAY,MAA8B;QACxC,KAAK,CACH,0BAA0B,MAAM,CAAC,MAAM,CAAC,MAAM,2BAA2B;YACzE,eAAe,MAAM,CAAC,OAAO,CAAC,MAAM,oBAAoB;YACxD,gBAAgB,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,OAAO,IAAI,QAAQ,EAAE,CACxD,CAAC;QACF,IAAI,CAAC,IAAI,GAAG,uBAAuB,CAAC;QACpC,IAAI,CAAC,MAAM,GAAG,MAAM,CAAC;IACvB,CAAC;CACF;AAED,8EAA8E;AAC9E,uCAAuC;AACvC,8EAA8E;AAE9E;;;;;;;GAOG;AACH,SAAS,sBAAsB,CAAC,MAA4B;IAC1D,QAAQ,MAAM,EAAE,CAAC;QACf,KAAK,aAAa,EAAE,OAAO,aAAa,CAAC;QACzC,KAAK,aAAa,EAAE,OAAO,aAAa,CAAC;QACzC,KAAK,oBAAoB,EAAE,OAAO,oBAAoB,CAAC;QACvD,KAAK,SAAS;YACZ,sEAAsE;YACtE,yEAAyE;YACzE,OAAO,oBAAoB,CAAC;IAChC,CAAC;AACH,CAAC;AAED;;;;;;;;;GASG;AACH,SAAS,YAAY,CAAC,KAAa;IACjC,QAAQ,KAAK,EAAE,CAAC;QACd,KAAK,SAAS,CAAC;QACf,KAAK,YAAY,CAAC;QAClB,KAAK,WAAW,CAAC;QACjB,KAAK,cAAc;YACjB,OAAO,KAAK,CAAC;QACf;YACE,OAAO,SAAS,CAAC;IACrB,CAAC;AACH,CAAC;AAED,8EAA8E;AAC9E,4CAA4C;AAC5C,8EAA8E;AAE9E;;;;;;;;;GASG;AACH,MAAM,UAAU,cAAc,CAC5B,OAA2C;IAE3C,MAAM,GAAG,GAAiB,EAAE,CAAC;IAC7B,KAAK,MAAM,KAAK,IAAI,OAAO,EAAE,CAAC;QAC5B,MAAM,IAAI,GAAG,iBAAiB,CAAC,KAAK,CAAC,CAAC;QACtC,IAAI,IAAI,KAAK,IAAI;YAAE,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IACpC,CAAC;IACD,OAAO,GAAG,CAAC;AACb,CAAC;AAED;;;;;;GAMG;AACH,SAAS,iBAAiB,CAAC,KAA0B;IACnD,MAAM,CAAC,SAAS,EAAE,OAAO,CAAC,GAAG,KAAK,CAAC,OAAO,CAAC;IAC3C,MAAM,SAAS,GAAG,YAAY,CAAC,SAAS,CAAC,CAAC;IAC1C,MAAM,OAAO,GAAG,YAAY,CAAC,OAAO,CAAC,CAAC;IACtC,MAAM,MAAM,GAAkB,SAAS,CAAC,CAAC,CAAC,EAAE,KAAK,EAAE,SAAS,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;IACpE,MAAM,MAAM,GAAkB,OAAO,CAAC,CAAC,CAAC,EAAE,KAAK,EAAE,OAAO,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;IAEhE,iEAAiE;IACjE,mEAAmE;IACnE,uDAAuD;IACvD,iBAAiB;IACjB,IACE,MAAM,CAAC,KAAK,KAAK,SAAS;QAC1B,MAAM,CAAC,KAAK,KAAK,SAAS,EAC1B,CAAC;QACD,OAAO,IAAI,CAAC;IACd,CAAC;IAED,gEAAgE;IAChE,MAAM,QAAQ,GAAG,KAAK,CAAC,aAAa,IAAI,KAAK,CAAC,aAAa,CAAC,MAAM,GAAG,CAAC;QACpE,CAAC,CAAC,KAAK,CAAC,aAAa;QACrB,CAAC,CAAC,6BAA6B,KAAK,CAAC,EAAE,GAAG,CAAC;IAE7C,OAAO;QACL,IAAI,EAAE,QAAQ;QACd,EAAE,EAAE,MAAM,KAAK,CAAC,EAAE,EAAE;QACpB,IAAI,EAAE,KAAK,CAAC,IAAI;QAChB,QAAQ;QACR,UAAU,EAAE,sBAAsB,CAAC,KAAK,CAAC,MAAM,CAAC;QAChD,MAAM;QACN,MAAM;QACN,SAAS,EAAE,KAAK,CAAC,MAAM,KAAK,aAAa;QACzC,WAAW,EAAE,KAAK,CAAC,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,IAAI;KAC7E,CAAC;AACJ,CAAC;AAED,8EAA8E;AAC9E,gEAAgE;AAChE,8EAA8E;AAE9E;;;;;;;;;;;GAWG;AACH,SAAS,2BAA2B,CAClC,KAA0B;IAE1B,MAAM,MAAM,GAAG,MAAM,KAAK,CAAC,EAAE,EAAE,CAAC;IAChC,iEAAiE;IACjE,iEAAiE;IACjE,gBAAgB;IAChB,IAAI,KAAK,CAAC,qBAAqB,KAAK,IAAI,EAAE,CAAC;QACzC,OAAO;YACL,QAAQ,EAAE,OAAO;YACjB,QAAQ,EAAE,yBAAyB;YACnC,MAAM;YACN,OAAO,EACL,MAAM,KAAK,CAAC,EAAE,MAAM,KAAK,CAAC,IAAI,gCAAgC;gBAC9D,6DAA6D;gBAC7D,wBAAwB;SAC3B,CAAC;IACJ,CAAC;IACD,gCAAgC;IAChC,MAAM,QAAQ,GAAG,4BAA4B,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC;IAC5D,IAAI,QAAQ,KAAK,SAAS,EAAE,CAAC;QAC3B,OAAO;YACL,QAAQ,EAAE,MAAM;YAChB,QAAQ,EAAE,yBAAyB;YACnC,MAAM;YACN,OAAO,EACL,MAAM,KAAK,CAAC,EAAE,MAAM,KAAK,CAAC,IAAI,qBAAqB;gBACnD,iCAAiC,4BAA4B,CAAC,IAAI,OAAO,cAAc,EAAE,CAAC,MAAM,0BAA0B;gBAC1H,uDAAuD;SAC1D,CAAC;IACJ,CAAC;IACD,MAAM,iBAAiB,GAAG,MAAM,CAAC,QAAQ,CAAC,CAAC;IAC3C,IAAI,KAAK,CAAC,qBAAqB,KAAK,iBAAiB,EAAE,CAAC;QACtD,OAAO;YACL,QAAQ,EAAE,OAAO;YACjB,QAAQ,EAAE,yBAAyB;YACnC,MAAM;YACN,OAAO,EACL,MAAM,KAAK,CAAC,EAAE,MAAM,KAAK,CAAC,IAAI,+BAA+B;gBAC7D,IAAI,KAAK,CAAC,qBAAqB,qCAAqC;gBACpE,SAAS,iBAAiB,sCAAsC;SACnE,CAAC;IACJ,CAAC;IACD,OAAO,SAAS,CAAC;AACnB,CAAC;AAED,8EAA8E;AAC9E,sBAAsB;AACtB,8EAA8E;AAE9E;;;;;;GAMG;AACH,MAAM,UAAU,WAAW,CACzB,OAA2C;IAE3C,MAAM,QAAQ,GAAyB,EAAE,CAAC;IAC1C,MAAM,MAAM,GAAqB,EAAE,CAAC;IACpC,MAAM,QAAQ,GAAqB,EAAE,CAAC;IACtC,MAAM,IAAI,GAAqB,EAAE,CAAC;IAClC,MAAM,WAAW,GAAa,EAAE,CAAC;IACjC,MAAM,OAAO,GAA2C,EAAE,CAAC;IAC3D,MAAM,SAAS,GAAiB,EAAE,CAAC;IAEnC,KAAK,MAAM,KAAK,IAAI,OAAO,EAAE,CAAC;QAC5B,MAAM,UAAU,GAAG,2BAA2B,CAAC,KAAK,CAAC,CAAC;QACtD,MAAM,IAAI,GAAG,iBAAiB,CAAC,KAAK,CAAC,CAAC;QACtC,MAAM,WAAW,GAAG,IAAI,KAAK,IAAI,CAAC;QAClC,IAAI,CAAC,WAAW,EAAE,CAAC;YACjB,WAAW,CAAC,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC;YAC3B,OAAO,CAAC,IAAI,CAAC;gBACX,QAAQ,EAAE,KAAK,CAAC,EAAE;gBAClB,MAAM,EAAE,kBAAkB,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC,uFAAuF;aAC1I,CAAC,CAAC;QACL,CAAC;;YAAM,SAAS,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAE5B,IAAI,UAAU,EAAE,CAAC;YACf,QAAQ,UAAU,CAAC,QAAQ,EAAE,CAAC;gBAC5B,KAAK,OAAO;oBAAE,MAAM,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC;oBAAC,MAAM;gBAC7C,KAAK,SAAS;oBAAE,QAAQ,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC;oBAAC,MAAM;gBACjD,KAAK,MAAM;oBAAE,IAAI,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC;oBAAC,MAAM;YAC5C,CAAC;QACH,CAAC;QAED,QAAQ,CAAC,IAAI,CAAC;YACZ,QAAQ,EAAE,KAAK,CAAC,EAAE;YAClB,IAAI,EAAE,KAAK,CAAC,IAAI;YAChB,SAAS,EAAE,WAAW;YACtB,GAAG,CAAC,UAAU,CAAC,CAAC,CAAC,EAAE,UAAU,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;SACtC,CAAC,CAAC;IACL,CAAC;IAED,OAAO;QACL,OAAO,EAAE,QAAQ;QACjB,MAAM;QACN,QAAQ;QACR,IAAI;QACJ,WAAW;QACX,OAAO;QACP,SAAS;KACV,CAAC;AACJ,CAAC;AAED;;;;;;;GAOG;AACH,MAAM,UAAU,aAAa,CAC3B,MAAuB,EACvB,OAA2C;IAE3C,MAAM,MAAM,GAAG,WAAW,CAAC,OAAO,CAAC,CAAC;IACpC,IAAI,MAAM,CAAC,MAAM,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QAC7B,MAAM,IAAI,qBAAqB,CAAC,MAAM,CAAC,CAAC;IAC1C,CAAC;IACD,KAAK,MAAM,IAAI,IAAI,MAAM,CAAC,SAAS,EAAE,CAAC;QACpC,MAAM,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC;IACvB,CAAC;IACD,OAAO,MAAM,CAAC;AAChB,CAAC;AAED;;;;;;GAMG;AACH,MAAM,UAAU,2BAA2B,CACzC,MAA8B;IAE9B,MAAM,WAAW,GAAG;QAClB,GAAG,MAAM,CAAC,MAAM;QAChB,GAAG,MAAM,CAAC,QAAQ;QAClB,GAAG,MAAM,CAAC,IAAI;KACf,CAAC;IACF,OAAO;QACL,WAAW;QACX,UAAU,EAAE,MAAM,CAAC,MAAM,CAAC,MAAM;QAChC,YAAY,EAAE,MAAM,CAAC,QAAQ,CAAC,MAAM;QACpC,SAAS,EAAE,MAAM,CAAC,IAAI,CAAC,MAAM;KAC9B,CAAC;AACJ,CAAC","sourcesContent":["/**\n * Catalog adapter: ingests `BRIDGE_EQUATIONS` into the v0.7-p2 sparse\n * semantic catalog as `BridgeCell` values.\n *\n * A cell needs a `PhysicalScale` on at least one end, and the catalog's\n * `bridges` tuple names a scale on only part of the rows (the rest name a\n * field such as `chemistry` or `plasma`). The adapter submits the rows it\n * can place and lists every other row in `unsubmitted`, with the reason in\n * `skipped`; it never guesses a scale. Phase 3 of v0.7 Proposal 2.\n *\n * Two entry points:\n *\n *   `catalogToCells(entries)` — pure mapping `BridgeEquationEntry[]\n *     → BridgeCell[]`. Filters out entries that would fail the\n *     legacy `addBridge` validation (e.g. `bridges: ['unknown',\n *     'unknown']` collapses to identical empty `source`/`target`).\n *\n *   `scanCatalog(entries)` — best-effort variant: builds candidates,\n *     runs Rule 1 (dimensional consistency), returns a\n *     `CatalogIngestionReport` without throwing. Caller decides\n *     what to do with the diagnostics.\n *\n *   `ingestCatalog(tensor, entries)` — strict variant: two-pass\n *     collect-then-commit (Decision #11). If Rule 1 reports any\n *     errors, throws `CatalogIngestionError(report)` and the\n *     tensor is untouched. Otherwise calls `tensor.addCell` for\n *     each candidate.\n *\n * Rule 1 (Dimensional Consistency) operates on\n * `BridgeEquationEntry`, NOT on `Cell` (Decision #3, resolves\n * Adam-V3). It reads `entry.dimensional_signature` directly.\n *\n * @module bridges/catalog-adapter\n */\n\nimport type {\n  BridgeEquationEntry,\n  BridgeEquationStatus,\n} from './index.js';\nimport type { BridgeCell, CellConfidence } from '../core/cell.js';\nimport type { UniversalTensor } from '../core/tensor.js';\nimport type {\n  FluxDiagnostic,\n  FluxReport,\n} from '../core/flux-rules.js';\nimport { EXPECTED_DIMENSION_BY_BRIDGE } from '../dimensional/bridge-check.js';\nimport { catalogEntries } from './catalog-load.js';\nimport { format } from '../dimensional/algebra.js';\nimport type { PhysicalScale, TensorIndices } from '../core/types.js';\n\n// ---------------------------------------------------------------------------\n// Public types\n// ---------------------------------------------------------------------------\n\n/**\n * Per-entry summary of the catalog ingestion attempt.\n *\n * @public\n */\nexport interface CatalogEntryStatus {\n  readonly bridgeId: number;\n  readonly name: string;\n  /** True iff the entry would be (or was) submitted to `addCell`. */\n  readonly submitted: boolean;\n  /**\n   * Diagnostics from Rule 1 (dimensional consistency) for this entry.\n   * `undefined` means the entry passed Rule 1 cleanly.\n   */\n  readonly diagnostic?: FluxDiagnostic;\n}\n\n/**\n * Aggregate report returned by `scanCatalog` / `ingestCatalog`. The\n * diagnostics surface Rule 1 results; `unsubmitted` lists entries\n * that the adapter filtered out before submission (typically\n * `'unknown' → 'unknown'` bridges that would fail the legacy\n * `addBridge` source !== target check).\n *\n * @public\n */\nexport interface CatalogIngestionReport {\n  readonly entries: ReadonlyArray<CatalogEntryStatus>;\n  readonly errors: ReadonlyArray<FluxDiagnostic>;\n  readonly warnings: ReadonlyArray<FluxDiagnostic>;\n  readonly info: ReadonlyArray<FluxDiagnostic>;\n  /** Bridge IDs the adapter filtered out before submission. */\n  readonly unsubmitted: ReadonlyArray<number>;\n  /** Why each unsubmitted id was not placed: the tuple labels that name no `PhysicalScale`. */\n  readonly skipped: ReadonlyArray<{ readonly bridgeId: number; readonly reason: string }>;\n  /** Cells that PASSED Rule 1 and would be submitted (or were). */\n  readonly submitted: ReadonlyArray<BridgeCell>;\n}\n\n/**\n * Thrown by `ingestCatalog` when Rule 1 reports any errors. The\n * caller can inspect `report` for per-entry diagnostics.\n *\n * @public\n */\nexport class CatalogIngestionError extends Error {\n  public readonly report: CatalogIngestionReport;\n\n  constructor(report: CatalogIngestionReport) {\n    super(\n      `CatalogIngestionError: ${report.errors.length} dimensional-consistency ` +\n      `error(s) in ${report.entries.length} catalog entries. ` +\n      `First error: ${report.errors[0]?.message ?? '(none)'}`,\n    );\n    this.name = 'CatalogIngestionError';\n    this.report = report;\n  }\n}\n\n// ---------------------------------------------------------------------------\n// Internal: confidence + scale mapping\n// ---------------------------------------------------------------------------\n\n/**\n * Map the catalog's `BridgeEquationStatus` string vocabulary onto\n * the `CellConfidence` vocabulary used by `BridgeCell`. The two\n * vocabularies are nearly aligned — only the `'invalid'` arm differs\n * (catalog allows it; CellConfidence excludes it per the design).\n *\n * @internal\n */\nfunction statusToCellConfidence(status: BridgeEquationStatus): CellConfidence {\n  switch (status) {\n    case 'established': return 'established';\n    case 'speculative': return 'speculative';\n    case 'highly-speculative': return 'highly-speculative';\n    case 'invalid':\n      // An invalid row is not a claim; the catalog carries none (the status\n      // distribution test pins 0). A cell built from one is the weakest grade.\n      return 'highly-speculative';\n  }\n}\n\n/**\n * Translate a free-form catalog `bridges` axis label (e.g.\n * `'classical'`, `'quantum'`, `'unknown'`) to a `PhysicalScale`\n * value or `undefined`. The four-element `PhysicalScale` union is\n * exhaustive; anything else (including the `'unknown'` sentinel)\n * maps to `undefined` — making `source`/`target` an empty\n * `TensorIndices` whose serialized key is `''`.\n *\n * @internal\n */\nfunction labelToScale(label: string): PhysicalScale | undefined {\n  switch (label) {\n    case 'quantum':\n    case 'mesoscopic':\n    case 'classical':\n    case 'cosmological':\n      return label;\n    default:\n      return undefined;\n  }\n}\n\n// ---------------------------------------------------------------------------\n// Mapping: BridgeEquationEntry → BridgeCell\n// ---------------------------------------------------------------------------\n\n/**\n * Pure mapper from `BridgeEquationEntry` (legacy catalog shape) to\n * `BridgeCell` (v0.7 typed Cell variant). Filters out entries whose\n * `bridges: [from, to]` collapses to an identical source/target\n * (typically `['unknown', 'unknown']`) — those would fail the\n * legacy `addBridge` validation. The filtering decision is surfaced\n * via the `unsubmitted` array in `CatalogIngestionReport`.\n *\n * @public\n */\nexport function catalogToCells(\n  entries: ReadonlyArray<BridgeEquationEntry>,\n): ReadonlyArray<BridgeCell> {\n  const out: BridgeCell[] = [];\n  for (const entry of entries) {\n    const cell = entryToBridgeCell(entry);\n    if (cell !== null) out.push(cell);\n  }\n  return out;\n}\n\n/**\n * Internal: build a `BridgeCell` from a single entry, returning\n * `null` if the entry is filterable (identical source/target after\n * label translation).\n *\n * @internal\n */\nfunction entryToBridgeCell(entry: BridgeEquationEntry): BridgeCell | null {\n  const [fromLabel, toLabel] = entry.bridges;\n  const fromScale = labelToScale(fromLabel);\n  const toScale = labelToScale(toLabel);\n  const source: TensorIndices = fromScale ? { scale: fromScale } : {};\n  const target: TensorIndices = toScale ? { scale: toScale } : {};\n\n  // Filter out entries whose source and target are both empty (the\n  // 'unknown' -> 'unknown' case at HEAD). Legacy `addBridge` rejects\n  // them with a TypeError; the adapter surfaces them via\n  // `unsubmitted`.\n  if (\n    source.scale === undefined &&\n    target.scale === undefined\n  ) {\n    return null;\n  }\n\n  // Equation: use formula_latex if non-empty, else a placeholder.\n  const equation = entry.formula_latex && entry.formula_latex.length > 0\n    ? entry.formula_latex\n    : `(no LaTeX provided for BE-${entry.id})`;\n\n  return {\n    kind: 'bridge',\n    id: `BE-${entry.id}`,\n    name: entry.name,\n    equation,\n    confidence: statusToCellConfidence(entry.status),\n    source,\n    target,\n    validated: entry.status === 'established',\n    description: entry.notes.length > 0 ? entry.notes.slice(0, 200) : entry.name,\n  };\n}\n\n// ---------------------------------------------------------------------------\n// Rule 1 — Dimensional Consistency (ERROR tier per Decision #3)\n// ---------------------------------------------------------------------------\n\n/**\n * Fires per-entry. Returns one of:\n *   - undefined (no diagnostic): entry passes Rule 1.\n *   - 'error' diagnostic: dimensional_signature is structurally null,\n *     or non-null but does not match the expected dimension from\n *     `EXPECTED_DIMENSION_BY_BRIDGE`.\n *   - 'info' diagnostic: no expected entry for this bridge ID; the\n *     message states how many catalog rows the table covers, counted\n *     when it is printed. We can't enforce, but we record the gap.\n *\n * @internal\n */\nfunction checkDimensionalConsistency(\n  entry: BridgeEquationEntry,\n): FluxDiagnostic | undefined {\n  const cellId = `BE-${entry.id}`;\n  // Structural null check (Eve-R1 lesson — at HEAD this fires zero\n  // times; future catalog edits that introduce a null will surface\n  // immediately).\n  if (entry.dimensional_signature === null) {\n    return {\n      severity: 'error',\n      ruleName: 'dimensional-consistency',\n      cellId,\n      message:\n        `BE-${entry.id} ('${entry.name}') has dimensional_signature: ` +\n        `null. Every active catalog entry must declare a structural ` +\n        `dimensional signature.`,\n    };\n  }\n  // Field-vs-expected comparison.\n  const expected = EXPECTED_DIMENSION_BY_BRIDGE.get(entry.id);\n  if (expected === undefined) {\n    return {\n      severity: 'info',\n      ruleName: 'dimensional-consistency',\n      cellId,\n      message:\n        `BE-${entry.id} ('${entry.name}') has no entry in ` +\n        `EXPECTED_DIMENSION_BY_BRIDGE (${EXPECTED_DIMENSION_BY_BRIDGE.size} of ${catalogEntries().length} catalog rows covered); ` +\n        `dimensional-consistency check skipped for this entry.`,\n    };\n  }\n  const expectedFormatted = format(expected);\n  if (entry.dimensional_signature !== expectedFormatted) {\n    return {\n      severity: 'error',\n      ruleName: 'dimensional-consistency',\n      cellId,\n      message:\n        `BE-${entry.id} ('${entry.name}') has dimensional_signature ` +\n        `'${entry.dimensional_signature}' but EXPECTED_DIMENSION_BY_BRIDGE ` +\n        `says '${expectedFormatted}'. Catalog and expectation disagree.`,\n    };\n  }\n  return undefined;\n}\n\n// ---------------------------------------------------------------------------\n// Public entry points\n// ---------------------------------------------------------------------------\n\n/**\n * Best-effort catalog scan: builds candidates, runs Rule 1 per\n * entry, returns a `CatalogIngestionReport`. Does NOT mutate any\n * tensor and does NOT throw.\n *\n * @public\n */\nexport function scanCatalog(\n  entries: ReadonlyArray<BridgeEquationEntry>,\n): CatalogIngestionReport {\n  const statuses: CatalogEntryStatus[] = [];\n  const errors: FluxDiagnostic[] = [];\n  const warnings: FluxDiagnostic[] = [];\n  const info: FluxDiagnostic[] = [];\n  const unsubmitted: number[] = [];\n  const skipped: { bridgeId: number; reason: string }[] = [];\n  const submitted: BridgeCell[] = [];\n\n  for (const entry of entries) {\n    const diagnostic = checkDimensionalConsistency(entry);\n    const cell = entryToBridgeCell(entry);\n    const submittable = cell !== null;\n    if (!submittable) {\n      unsubmitted.push(entry.id);\n      skipped.push({\n        bridgeId: entry.id,\n        reason: `bridges tuple [${entry.bridges.join(', ')}] names no PhysicalScale (quantum, mesoscopic, classical, cosmological) on either end`,\n      });\n    } else submitted.push(cell);\n\n    if (diagnostic) {\n      switch (diagnostic.severity) {\n        case 'error': errors.push(diagnostic); break;\n        case 'warning': warnings.push(diagnostic); break;\n        case 'info': info.push(diagnostic); break;\n      }\n    }\n\n    statuses.push({\n      bridgeId: entry.id,\n      name: entry.name,\n      submitted: submittable,\n      ...(diagnostic ? { diagnostic } : {}),\n    });\n  }\n\n  return {\n    entries: statuses,\n    errors,\n    warnings,\n    info,\n    unsubmitted,\n    skipped,\n    submitted,\n  };\n}\n\n/**\n * Strict catalog ingestion: two-pass collect-then-commit per\n * Decision #11. If Rule 1 reports any errors, throws\n * `CatalogIngestionError(report)` and the tensor is untouched.\n * Otherwise calls `tensor.addCell` for each filterable candidate.\n *\n * @public\n */\nexport function ingestCatalog(\n  tensor: UniversalTensor,\n  entries: ReadonlyArray<BridgeEquationEntry>,\n): CatalogIngestionReport {\n  const report = scanCatalog(entries);\n  if (report.errors.length > 0) {\n    throw new CatalogIngestionError(report);\n  }\n  for (const cell of report.submitted) {\n    tensor.addCell(cell);\n  }\n  return report;\n}\n\n/**\n * Bridge-level FluxReport summary, derived from a\n * `CatalogIngestionReport`. Used by consumers that want the\n * flux-rule report shape rather than the catalog-specific report.\n *\n * @public\n */\nexport function ingestionReportToFluxReport(\n  report: CatalogIngestionReport,\n): FluxReport {\n  const diagnostics = [\n    ...report.errors,\n    ...report.warnings,\n    ...report.info,\n  ];\n  return {\n    diagnostics,\n    errorCount: report.errors.length,\n    warningCount: report.warnings.length,\n    infoCount: report.info.length,\n  };\n}\n"]}

package/dist/bridges/catalog-load.d.ts

@@ -4,7 +4,15 @@
  *
  * @module bridges/catalog-load
  */
-import type { CatalogConfrontation, CatalogEntry, CatalogEvaluator, CatalogFile, CatalogRelation } from './catalog-types.js';
+import type { CatalogConfrontation, CatalogEntry, CatalogEvaluator, CatalogFile, CatalogFileRecord, CatalogRejection, CatalogRelation } from './catalog-types.js';
+/**
+ * The loaded catalog from a file record: the records are in id order, each
+ * outcome is checked on its kind, each relation takes its row's status as its
+ * confidence, then the sign clauses its evaluator parameters state. The
+ * production catalog is this function on `data/bridge-catalog.json`.
+ * @internal
+ */
+export declare function loadCatalog(file: CatalogFileRecord): CatalogFile;
 /** The loaded catalog. */
 export declare function bridgeCatalog(): CatalogFile;
 /** Catalog rows, in file order. */
@@ -13,8 +21,10 @@ export declare function catalogEntries(): readonly CatalogEntry[];
 export declare function catalogRelations(): readonly CatalogRelation[];
 /** Evaluator input contracts, in file order. */
 export declare function catalogEvaluators(): readonly CatalogEvaluator[];
-/** Confrontations, in file order. */
+/** Confrontations, in file order; one per catalog id. */
 export declare function catalogConfrontations(): readonly CatalogConfrontation[];
+/** The negative catalog, in file order. */
+export declare function catalogRejections(): readonly CatalogRejection[];
 /** The row for a catalog id, or undefined. */
 export declare function catalogEntry(id: number): CatalogEntry | undefined;
 /** Relations whose catalog id is `id`, in file order. */
@@ -24,6 +34,13 @@ export declare function relationsForCatalog(id: number): readonly CatalogRelatio
  * when several relations share the id. Otherwise the first relation does.
  */
 export declare function primaryRelation(id: number): CatalogRelation | undefined;
+/**
+ * The catalog number a piece of text names (`42`, `be-42`, `BE-42`), or
+ * undefined when it names none (an atlas id, a canonical id, a quantity).
+ * The one place a bridge id is read from text; {@link parseBridgeId} throws
+ * where this returns undefined.
+ */
+export declare function catalogIdNumber(raw: string): number | undefined;
 /**
  * Parse a catalog id from a number or from text the caller typed.
  * Accepts `42`, `be-42`, and `BE-42`. This is the only such parser.

package/dist/bridges/catalog-load.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"catalog-load.d.ts","sourceRoot":"","sources":["../../src/bridges/catalog-load.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;AAKH,OAAO,KAAK,EACV,oBAAoB,EACpB,YAAY,EACZ,gBAAgB,EAChB,WAAW,EACX,eAAe,EAChB,MAAM,oBAAoB,CAAC;AAe5B,0BAA0B;AAC1B,wBAAgB,aAAa,IAAI,WAAW,CAE3C;AAED,mCAAmC;AACnC,wBAAgB,cAAc,IAAI,SAAS,YAAY,EAAE,CAExD;AAED,mCAAmC;AACnC,wBAAgB,gBAAgB,IAAI,SAAS,eAAe,EAAE,CAE7D;AAED,gDAAgD;AAChD,wBAAgB,iBAAiB,IAAI,SAAS,gBAAgB,EAAE,CAE/D;AAED,qCAAqC;AACrC,wBAAgB,qBAAqB,IAAI,SAAS,oBAAoB,EAAE,CAEvE;AAWD,8CAA8C;AAC9C,wBAAgB,YAAY,CAAC,EAAE,EAAE,MAAM,GAAG,YAAY,GAAG,SAAS,CAEjE;AAED,yDAAyD;AACzD,wBAAgB,mBAAmB,CAAC,EAAE,EAAE,MAAM,GAAG,SAAS,eAAe,EAAE,CAE1E;AAED;;;GAGG;AACH,wBAAgB,eAAe,CAAC,EAAE,EAAE,MAAM,GAAG,eAAe,GAAG,SAAS,CAGvE;AAED;;;GAGG;AACH,wBAAgB,aAAa,CAAC,QAAQ,EAAE,MAAM,GAAG,MAAM,GAAG,MAAM,CAY/D;AAED,mEAAmE;AACnE,wBAAgB,cAAc,CAAC,EAAE,EAAE,MAAM,GAAG,MAAM,CAEjD"}
+{"version":3,"file":"catalog-load.d.ts","sourceRoot":"","sources":["../../src/bridges/catalog-load.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;AAIH,OAAO,KAAK,EACV,oBAAoB,EAEpB,YAAY,EACZ,gBAAgB,EAEhB,WAAW,EACX,iBAAiB,EACjB,gBAAgB,EAChB,eAAe,EAChB,MAAM,oBAAoB,CAAC;AA6M5B;;;;;;GAMG;AACH,wBAAgB,WAAW,CAAC,IAAI,EAAE,iBAAiB,GAAG,WAAW,CAGhE;AAID,0BAA0B;AAC1B,wBAAgB,aAAa,IAAI,WAAW,CAE3C;AAED,mCAAmC;AACnC,wBAAgB,cAAc,IAAI,SAAS,YAAY,EAAE,CAExD;AAED,mCAAmC;AACnC,wBAAgB,gBAAgB,IAAI,SAAS,eAAe,EAAE,CAE7D;AAED,gDAAgD;AAChD,wBAAgB,iBAAiB,IAAI,SAAS,gBAAgB,EAAE,CAE/D;AAED,yDAAyD;AACzD,wBAAgB,qBAAqB,IAAI,SAAS,oBAAoB,EAAE,CAEvE;AAED,2CAA2C;AAC3C,wBAAgB,iBAAiB,IAAI,SAAS,gBAAgB,EAAE,CAE/D;AAWD,8CAA8C;AAC9C,wBAAgB,YAAY,CAAC,EAAE,EAAE,MAAM,GAAG,YAAY,GAAG,SAAS,CAEjE;AAED,yDAAyD;AACzD,wBAAgB,mBAAmB,CAAC,EAAE,EAAE,MAAM,GAAG,SAAS,eAAe,EAAE,CAE1E;AAED;;;GAGG;AACH,wBAAgB,eAAe,CAAC,EAAE,EAAE,MAAM,GAAG,eAAe,GAAG,SAAS,CAGvE;AAED;;;;;GAKG;AACH,wBAAgB,eAAe,CAAC,GAAG,EAAE,MAAM,GAAG,MAAM,GAAG,SAAS,CAG/D;AAED;;;GAGG;AACH,wBAAgB,aAAa,CAAC,QAAQ,EAAE,MAAM,GAAG,MAAM,GAAG,MAAM,CAY/D;AAED,mEAAmE;AACnE,wBAAgB,cAAc,CAAC,EAAE,EAAE,MAAM,GAAG,MAAM,CAEjD"}

package/dist/bridges/catalog-load.js

@@ -4,20 +4,225 @@
  *
  * @module bridges/catalog-load
  */
-import { readFileSync } from 'node:fs';
-import { dirname, join } from 'node:path';
-import { fileURLToPath } from 'node:url';
+import { residualInSigma } from './observations/types.js';
+import { checkedDataFile } from '../core/data-file.js';
+/**
+ * `data/bridge-catalog.json`, checked against `data/bridge-catalog.schema.json`
+ * (every record's `type`, the relation, evaluator, parameter and confrontation
+ * shapes). What a schema cannot state is checked by {@link loadCatalog}.
+ */
 function loadFile() {
-    const path = join(dirname(fileURLToPath(import.meta.url)), '../../data/bridge-catalog.json');
-    const file = JSON.parse(readFileSync(path, 'utf8'));
-    for (const entry of file.entries) {
-        if (entry.type !== 'standard' && entry.type !== 'cross-domain') {
-            throw new Error(`catalog record ${entry.id} has no type`);
+    return checkedDataFile('bridge-catalog.json');
+}
+/** Records in ascending id order; a duplicate or a disordered id is refused. */
+function checkOrder(file) {
+    for (let i = 1; i < file.entries.length; i += 1) {
+        const previous = file.entries[i - 1].id;
+        const current = file.entries[i].id;
+        if (current <= previous) {
+            throw new Error(`data/bridge-catalog.json: entry ${current} follows entry ${previous}; records are in ascending id order`);
         }
     }
-    return file;
+    const seen = new Set();
+    for (const row of file.confrontations) {
+        if (seen.has(row.catalogId))
+            throw new Error(`data/bridge-catalog.json: catalog id ${row.catalogId} has two confrontations`);
+        seen.add(row.catalogId);
+    }
+    const rejected = new Set();
+    const ids = new Set(file.entries.map((entry) => entry.id));
+    for (const row of file.rejections) {
+        if (!ids.has(row.catalogId))
+            throw new Error(`data/bridge-catalog.json: rejection ${row.catalogId} names no catalog row`);
+        if (rejected.has(row.catalogId))
+            throw new Error(`data/bridge-catalog.json: catalog id ${row.catalogId} is rejected twice`);
+        rejected.add(row.catalogId);
+    }
+}
+const number = (o, key, where) => {
+    const v = o[key];
+    if (typeof v !== 'number' || !Number.isFinite(v))
+        throw new Error(`${where}: outcome.${key} must be a finite number`);
+    return v;
+};
+const boolean = (o, key, where) => {
+    const v = o[key];
+    if (typeof v !== 'boolean')
+        throw new Error(`${where}: outcome.${key} must be a boolean`);
+    return v;
+};
+/**
+ * The outcome of one confrontation, checked arm by arm on its `kind`. The
+ * schema states the shared fields (`kind`, `units`, `provenance`, the data
+ * handling); the fields each arm must carry are checked here, so the loaded
+ * record is a {@link ConfrontationOutcome} by inspection, not by assertion.
+ */
+/** A stored number is written to a few significant digits; it agrees when it rounds to the computed one within 1e-3 relative (or absolute near zero). */
+function agreesToStoredPrecision(stored, computed) {
+    return Math.abs(stored - computed) <= 1e-3 * Math.max(1, Math.abs(computed));
+}
+/** True when `holds` contains `clause` as a whole clause, not as the tail of a longer name. */
+function holdsStatesClause(holds, clause) {
+    let from = 0;
+    for (;;) {
+        const at = holds.indexOf(clause, from);
+        if (at < 0)
+            return false;
+        const before = at === 0 ? ' ' : holds[at - 1];
+        if (!/[A-Za-z0-9_-]/.test(before))
+            return true;
+        from = at + 1;
+    }
 }
-const CATALOG = loadFile();
+function readOutcome(row) {
+    const where = `data/bridge-catalog.json: confrontation ${row.catalogId}`;
+    const o = row.outcome;
+    if (o['kind'] !== row.kind)
+        throw new Error(`${where}: outcome.kind ${String(o['kind'])} is not the record kind ${row.kind}`);
+    switch (row.kind) {
+        case 'value': {
+            // The verdict is derived from the numbers, never read as stored (AGENTS law 1): a stored
+            // residual or verdict that disagrees with |predicted − observed|/σ is refused.
+            const predicted = number(o, 'predicted', where);
+            const observed = number(o, 'observed', where);
+            const sigma = number(o, 'sigma', where);
+            const stored = number(o, 'residualInSigma', where);
+            const computed = residualInSigma(predicted, observed, sigma);
+            if (!agreesToStoredPrecision(stored, computed)) {
+                throw new Error(`${where}: outcome.residualInSigma ${stored} is not |predicted − observed|/sigma = ${computed}`);
+            }
+            if (boolean(o, 'withinObserved', where) !== computed <= 1) {
+                throw new Error(`${where}: outcome.withinObserved must be residualInSigma <= 1 (${computed})`);
+            }
+            break;
+        }
+        case 'upper-bound': {
+            const predicted = number(o, 'predicted', where);
+            const bound = number(o, 'bound', where);
+            // `predictedIs` picks the comparison (`observations/types.ts`): a point is satisfied at or
+            // below the observed limit; an encoded bound (|x| ≤ predicted) when the limit lies inside it.
+            const encodedBound = o['predictedIs'] === 'encoded-bound';
+            const expected = encodedBound ? bound <= predicted : predicted <= bound;
+            if (boolean(o, 'satisfied', where) !== expected) {
+                throw new Error(`${where}: outcome.satisfied must be ${encodedBound ? 'bound <= predicted' : 'predicted <= bound'} (${predicted} vs ${bound})`);
+            }
+            break;
+        }
+        case 'consistency': {
+            const predicted = number(o, 'predicted', where);
+            const approaches = number(o, 'approaches', where);
+            const gap = number(o, 'fractionalGap', where);
+            if (o['fractionalGapIs'] !== 'agreement-bound' && o['fractionalGapIs'] !== 'observed-difference') {
+                throw new Error(`${where}: outcome.fractionalGapIs must name what fractionalGap holds`);
+            }
+            // An agreement bound is the record's stated tolerance; an observed difference is derived.
+            if (o['fractionalGapIs'] === 'observed-difference' && predicted !== 0) {
+                const computed = (approaches - predicted) / predicted;
+                if (!agreesToStoredPrecision(gap, computed)) {
+                    throw new Error(`${where}: outcome.fractionalGap ${gap} is not (approaches − predicted)/predicted = ${computed}`);
+                }
+            }
+            break;
+        }
+        case 'table':
+            if (!Array.isArray(o['rows']))
+                throw new Error(`${where}: outcome.rows must be an array`);
+            break;
+    }
+    return o;
+}
+function narrowConfrontations(file) {
+    return file.confrontations.map((row) => ({ ...row, outcome: readOutcome(row) }));
+}
+/**
+ * A relation's confidence is its catalog row's `status`. The row is the one
+ * owner, so the file may not store a confidence beside a catalog id; a
+ * relation with no row stores its own. A row that is `invalid` has no
+ * relation to evaluate.
+ */
+function deriveConfidence(file) {
+    const entries = new Map(file.entries.map((entry) => [entry.id, entry]));
+    const confrontations = narrowConfrontations(file);
+    const relations = file.relations.map((relation) => {
+        if (relation.catalogId === null) {
+            if (relation.confidence === undefined) {
+                throw new Error(`data/bridge-catalog.json: relation ${relation.id} has no catalog row and no confidence`);
+            }
+            return { ...relation, confidence: relation.confidence };
+        }
+        if (relation.confidence !== undefined) {
+            throw new Error(`data/bridge-catalog.json: relation ${relation.id} stores a confidence; the row's status is the owner`);
+        }
+        const entry = entries.get(relation.catalogId);
+        if (entry === undefined) {
+            throw new Error(`data/bridge-catalog.json: relation ${relation.id} names an unknown catalog id ${relation.catalogId}`);
+        }
+        if (entry.status === 'invalid') {
+            throw new Error(`data/bridge-catalog.json: relation ${relation.id} has a closed form but its row is invalid`);
+        }
+        return { ...relation, confidence: entry.status };
+    });
+    return { ...file, relations, confrontations };
+}
+/**
+ * The validity clause a parameter's sign states, in the relation's own source
+ * name. An absolute temperature is nonnegative unless the parameter says `any`.
+ */
+function signClause(parameter, source) {
+    const sign = parameter.sign ?? (parameter.temperature === 'absolute' ? 'nonnegative' : undefined);
+    if (sign === 'positive')
+        return `${source} > 0`;
+    if (sign === 'nonnegative')
+        return `${source} >= 0`;
+    return undefined;
+}
+/**
+ * Add the sign clauses the evaluator parameters state to the relation they
+ * evaluate. The validity domain is derived from the flags, so a new bridge
+ * that flags its inputs cannot leave the domain behind. A clause the record
+ * already states is not repeated.
+ */
+function deriveDomains(file) {
+    const relations = file.relations.map((relation) => {
+        if (relation.catalogId === null)
+            return relation;
+        const evaluator = file.evaluators.find((row) => row.catalogId === relation.catalogId);
+        if (evaluator === undefined)
+            return relation;
+        const clauses = [];
+        for (const parameter of evaluator.parameters) {
+            const source = relation.sources.find((name) => name === parameter.key || (relation.aliases[name] ?? []).includes(parameter.key)) ??
+                (relation.sources.includes(parameter.quantity) ? parameter.quantity : undefined);
+            if (source === undefined)
+                continue;
+            const clause = signClause(parameter, source);
+            // A whole-clause match: `radius > 0` is not already stated by `near-radius > 0`.
+            if (clause !== undefined && !holdsStatesClause(relation.holds, clause))
+                clauses.push(clause);
+        }
+        if (clauses.length === 0)
+            return relation;
+        const stated = relation.holds.trim() === 'true' ? '' : `${relation.holds} and `;
+        return {
+            ...relation,
+            holds: `${stated}${clauses.join(' and ')}`,
+            domain: relation.domain === '' ? clauses.join(', ') : `${relation.domain}; ${clauses.join(', ')}`,
+        };
+    });
+    return { ...file, relations };
+}
+/**
+ * The loaded catalog from a file record: the records are in id order, each
+ * outcome is checked on its kind, each relation takes its row's status as its
+ * confidence, then the sign clauses its evaluator parameters state. The
+ * production catalog is this function on `data/bridge-catalog.json`.
+ * @internal
+ */
+export function loadCatalog(file) {
+    checkOrder(file);
+    return deriveDomains(deriveConfidence(file));
+}
+const CATALOG = loadCatalog(loadFile());
 /** The loaded catalog. */
 export function bridgeCatalog() {
     return CATALOG;
@@ -34,10 +239,14 @@ export function catalogRelations() {
 export function catalogEvaluators() {
     return CATALOG.evaluators;
 }
-/** Confrontations, in file order. */
+/** Confrontations, in file order; one per catalog id. */
 export function catalogConfrontations() {
     return CATALOG.confrontations;
 }
+/** The negative catalog, in file order. */
+export function catalogRejections() {
+    return CATALOG.rejections;
+}
 const ENTRY_BY_ID = new Map(CATALOG.entries.map((entry) => [entry.id, entry]));
 const RELATIONS_BY_CATALOG = new Map();
 for (const relation of CATALOG.relations) {
@@ -65,6 +274,16 @@ export function primaryRelation(id) {
     const rows = relationsForCatalog(id);
     return rows.find((row) => row.id === `be-${id}`) ?? rows[0];
 }
+/**
+ * The catalog number a piece of text names (`42`, `be-42`, `BE-42`), or
+ * undefined when it names none (an atlas id, a canonical id, a quantity).
+ * The one place a bridge id is read from text; {@link parseBridgeId} throws
+ * where this returns undefined.
+ */
+export function catalogIdNumber(raw) {
+    const match = /^(?:be-)?(\d+)$/i.exec(raw.trim());
+    return match === null ? undefined : Number(match[1]);
+}
 /**
  * Parse a catalog id from a number or from text the caller typed.
  * Accepts `42`, `be-42`, and `BE-42`. This is the only such parser.
@@ -76,11 +295,11 @@ export function parseBridgeId(bridgeId) {
         }
         return bridgeId;
     }
-    const match = /^(?:be-)?(\d+)$/i.exec(bridgeId.trim());
-    if (match === null) {
+    const id = catalogIdNumber(bridgeId);
+    if (id === undefined) {
         throw new TypeError(`parseBridgeId: '${bridgeId}' is not a catalog id`);
     }
-    return Number(match[1]);
+    return id;
 }
 /** Graph id for a catalog number: the stable key, not a switch. */
 export function catalogEdgeKey(id) {

package/dist/bridges/catalog-load.js.map

@@ -1 +1 @@
-{"version":3,"file":"catalog-load.js","sourceRoot":"","sources":["../../src/bridges/catalog-load.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;AAEH,OAAO,EAAE,YAAY,EAAE,MAAM,SAAS,CAAC;AACvC,OAAO,EAAE,OAAO,EAAE,IAAI,EAAE,MAAM,WAAW,CAAC;AAC1C,OAAO,EAAE,aAAa,EAAE,MAAM,UAAU,CAAC;AASzC,SAAS,QAAQ;IACf,MAAM,IAAI,GAAG,IAAI,CAAC,OAAO,CAAC,aAAa,CAAC,OAAO,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,gCAAgC,CAAC,CAAC;IAC7F,MAAM,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC,YAAY,CAAC,IAAI,EAAE,MAAM,CAAC,CAAgB,CAAC;IACnE,KAAK,MAAM,KAAK,IAAI,IAAI,CAAC,OAAO,EAAE,CAAC;QACjC,IAAI,KAAK,CAAC,IAAI,KAAK,UAAU,IAAI,KAAK,CAAC,IAAI,KAAK,cAAc,EAAE,CAAC;YAC/D,MAAM,IAAI,KAAK,CAAC,kBAAkB,KAAK,CAAC,EAAE,cAAc,CAAC,CAAC;QAC5D,CAAC;IACH,CAAC;IACD,OAAO,IAAI,CAAC;AACd,CAAC;AAED,MAAM,OAAO,GAAG,QAAQ,EAAE,CAAC;AAE3B,0BAA0B;AAC1B,MAAM,UAAU,aAAa;IAC3B,OAAO,OAAO,CAAC;AACjB,CAAC;AAED,mCAAmC;AACnC,MAAM,UAAU,cAAc;IAC5B,OAAO,OAAO,CAAC,OAAO,CAAC;AACzB,CAAC;AAED,mCAAmC;AACnC,MAAM,UAAU,gBAAgB;IAC9B,OAAO,OAAO,CAAC,SAAS,CAAC;AAC3B,CAAC;AAED,gDAAgD;AAChD,MAAM,UAAU,iBAAiB;IAC/B,OAAO,OAAO,CAAC,UAAU,CAAC;AAC5B,CAAC;AAED,qCAAqC;AACrC,MAAM,UAAU,qBAAqB;IACnC,OAAO,OAAO,CAAC,cAAc,CAAC;AAChC,CAAC;AAED,MAAM,WAAW,GAAG,IAAI,GAAG,CAAC,OAAO,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,CAAC,KAAK,CAAC,EAAE,EAAE,KAAK,CAAC,CAAC,CAAC,CAAC;AAC/E,MAAM,oBAAoB,GAAG,IAAI,GAAG,EAA6B,CAAC;AAClE,KAAK,MAAM,QAAQ,IAAI,OAAO,CAAC,SAAS,EAAE,CAAC;IACzC,IAAI,QAAQ,CAAC,SAAS,KAAK,IAAI;QAAE,SAAS;IAC1C,MAAM,IAAI,GAAG,oBAAoB,CAAC,GAAG,CAAC,QAAQ,CAAC,SAAS,CAAC,CAAC;IAC1D,IAAI,IAAI,KAAK,SAAS;QAAE,oBAAoB,CAAC,GAAG,CAAC,QAAQ,CAAC,SAAS,EAAE,CAAC,QAAQ,CAAC,CAAC,CAAC;;QAC5E,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;AAC3B,CAAC;AAED,8CAA8C;AAC9C,MAAM,UAAU,YAAY,CAAC,EAAU;IACrC,OAAO,WAAW,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;AAC7B,CAAC;AAED,yDAAyD;AACzD,MAAM,UAAU,mBAAmB,CAAC,EAAU;IAC5C,OAAO,oBAAoB,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,EAAE,CAAC;AAC5C,CAAC;AAED;;;GAGG;AACH,MAAM,UAAU,eAAe,CAAC,EAAU;IACxC,MAAM,IAAI,GAAG,mBAAmB,CAAC,EAAE,CAAC,CAAC;IACrC,OAAO,IAAI,CAAC,IAAI,CAAC,CAAC,GAAG,EAAE,EAAE,CAAC,GAAG,CAAC,EAAE,KAAK,MAAM,EAAE,EAAE,CAAC,IAAI,IAAI,CAAC,CAAC,CAAC,CAAC;AAC9D,CAAC;AAED;;;GAGG;AACH,MAAM,UAAU,aAAa,CAAC,QAAyB;IACrD,IAAI,OAAO,QAAQ,KAAK,QAAQ,EAAE,CAAC;QACjC,IAAI,CAAC,MAAM,CAAC,SAAS,CAAC,QAAQ,CAAC,EAAE,CAAC;YAChC,MAAM,IAAI,UAAU,CAAC,kBAAkB,QAAQ,+BAA+B,CAAC,CAAC;QAClF,CAAC;QACD,OAAO,QAAQ,CAAC;IAClB,CAAC;IACD,MAAM,KAAK,GAAG,kBAAkB,CAAC,IAAI,CAAC,QAAQ,CAAC,IAAI,EAAE,CAAC,CAAC;IACvD,IAAI,KAAK,KAAK,IAAI,EAAE,CAAC;QACnB,MAAM,IAAI,SAAS,CAAC,mBAAmB,QAAQ,uBAAuB,CAAC,CAAC;IAC1E,CAAC;IACD,OAAO,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC;AAC1B,CAAC;AAED,mEAAmE;AACnE,MAAM,UAAU,cAAc,CAAC,EAAU;IACvC,OAAO,MAAM,EAAE,EAAE,CAAC;AACpB,CAAC"}
+{"version":3,"file":"catalog-load.js","sourceRoot":"","sources":["../../src/bridges/catalog-load.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;AAEH,OAAO,EAAE,eAAe,EAAE,MAAM,yBAAyB,CAAC;AAC1D,OAAO,EAAE,eAAe,EAAE,MAAM,sBAAsB,CAAC;AAcvD;;;;GAIG;AACH,SAAS,QAAQ;IACf,OAAO,eAAe,CAAC,qBAAqB,CAAsB,CAAC;AACrE,CAAC;AAED,gFAAgF;AAChF,SAAS,UAAU,CAAC,IAAuB;IACzC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,OAAO,CAAC,MAAM,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC;QAChD,MAAM,QAAQ,GAAG,IAAI,CAAC,OAAO,CAAC,CAAC,GAAG,CAAC,CAAE,CAAC,EAAE,CAAC;QACzC,MAAM,OAAO,GAAG,IAAI,CAAC,OAAO,CAAC,CAAC,CAAE,CAAC,EAAE,CAAC;QACpC,IAAI,OAAO,IAAI,QAAQ,EAAE,CAAC;YACxB,MAAM,IAAI,KAAK,CAAC,mCAAmC,OAAO,kBAAkB,QAAQ,qCAAqC,CAAC,CAAC;QAC7H,CAAC;IACH,CAAC;IACD,MAAM,IAAI,GAAG,IAAI,GAAG,EAAU,CAAC;IAC/B,KAAK,MAAM,GAAG,IAAI,IAAI,CAAC,cAAc,EAAE,CAAC;QACtC,IAAI,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,SAAS,CAAC;YAAE,MAAM,IAAI,KAAK,CAAC,wCAAwC,GAAG,CAAC,SAAS,yBAAyB,CAAC,CAAC;QAC7H,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,SAAS,CAAC,CAAC;IAC1B,CAAC;IACD,MAAM,QAAQ,GAAG,IAAI,GAAG,EAAU,CAAC;IACnC,MAAM,GAAG,GAAG,IAAI,GAAG,CAAC,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC,CAAC;IAC3D,KAAK,MAAM,GAAG,IAAI,IAAI,CAAC,UAAU,EAAE,CAAC;QAClC,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,SAAS,CAAC;YAAE,MAAM,IAAI,KAAK,CAAC,uCAAuC,GAAG,CAAC,SAAS,uBAAuB,CAAC,CAAC;QAC1H,IAAI,QAAQ,CAAC,GAAG,CAAC,GAAG,CAAC,SAAS,CAAC;YAAE,MAAM,IAAI,KAAK,CAAC,wCAAwC,GAAG,CAAC,SAAS,oBAAoB,CAAC,CAAC;QAC5H,QAAQ,CAAC,GAAG,CAAC,GAAG,CAAC,SAAS,CAAC,CAAC;IAC9B,CAAC;AACH,CAAC;AAED,MAAM,MAAM,GAAG,CAAC,CAAoC,EAAE,GAAW,EAAE,KAAa,EAAU,EAAE;IAC1F,MAAM,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC;IACjB,IAAI,OAAO,CAAC,KAAK,QAAQ,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAC,CAAC;QAAE,MAAM,IAAI,KAAK,CAAC,GAAG,KAAK,aAAa,GAAG,0BAA0B,CAAC,CAAC;IACtH,OAAO,CAAC,CAAC;AACX,CAAC,CAAC;AACF,MAAM,OAAO,GAAG,CAAC,CAAoC,EAAE,GAAW,EAAE,KAAa,EAAW,EAAE;IAC5F,MAAM,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC;IACjB,IAAI,OAAO,CAAC,KAAK,SAAS;QAAE,MAAM,IAAI,KAAK,CAAC,GAAG,KAAK,aAAa,GAAG,oBAAoB,CAAC,CAAC;IAC1F,OAAO,CAAC,CAAC;AACX,CAAC,CAAC;AAEF;;;;;GAKG;AACH,yJAAyJ;AACzJ,SAAS,uBAAuB,CAAC,MAAc,EAAE,QAAgB;IAC/D,OAAO,IAAI,CAAC,GAAG,CAAC,MAAM,GAAG,QAAQ,CAAC,IAAI,IAAI,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC,CAAC;AAC/E,CAAC;AAED,+FAA+F;AAC/F,SAAS,iBAAiB,CAAC,KAAa,EAAE,MAAc;IACtD,IAAI,IAAI,GAAG,CAAC,CAAC;IACb,SAAS,CAAC;QACR,MAAM,EAAE,GAAG,KAAK,CAAC,OAAO,CAAC,MAAM,EAAE,IAAI,CAAC,CAAC;QACvC,IAAI,EAAE,GAAG,CAAC;YAAE,OAAO,KAAK,CAAC;QACzB,MAAM,MAAM,GAAG,EAAE,KAAK,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,KAAK,CAAC,EAAE,GAAG,CAAC,CAAE,CAAC;QAC/C,IAAI,CAAC,eAAe,CAAC,IAAI,CAAC,MAAM,CAAC;YAAE,OAAO,IAAI,CAAC;QAC/C,IAAI,GAAG,EAAE,GAAG,CAAC,CAAC;IAChB,CAAC;AACH,CAAC;AAED,SAAS,WAAW,CAAC,GAA+B;IAClD,MAAM,KAAK,GAAG,2CAA2C,GAAG,CAAC,SAAS,EAAE,CAAC;IACzE,MAAM,CAAC,GAAG,GAAG,CAAC,OAAO,CAAC;IACtB,IAAI,CAAC,CAAC,MAAM,CAAC,KAAK,GAAG,CAAC,IAAI;QAAE,MAAM,IAAI,KAAK,CAAC,GAAG,KAAK,kBAAkB,MAAM,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,2BAA2B,GAAG,CAAC,IAAI,EAAE,CAAC,CAAC;IAC9H,QAAQ,GAAG,CAAC,IAAI,EAAE,CAAC;QACjB,KAAK,OAAO,EAAE,CAAC;YACb,yFAAyF;YACzF,+EAA+E;YAC/E,MAAM,SAAS,GAAG,MAAM,CAAC,CAAC,EAAE,WAAW,EAAE,KAAK,CAAC,CAAC;YAChD,MAAM,QAAQ,GAAG,MAAM,CAAC,CAAC,EAAE,UAAU,EAAE,KAAK,CAAC,CAAC;YAC9C,MAAM,KAAK,GAAG,MAAM,CAAC,CAAC,EAAE,OAAO,EAAE,KAAK,CAAC,CAAC;YACxC,MAAM,MAAM,GAAG,MAAM,CAAC,CAAC,EAAE,iBAAiB,EAAE,KAAK,CAAC,CAAC;YACnD,MAAM,QAAQ,GAAG,eAAe,CAAC,SAAS,EAAE,QAAQ,EAAE,KAAK,CAAC,CAAC;YAC7D,IAAI,CAAC,uBAAuB,CAAC,MAAM,EAAE,QAAQ,CAAC,EAAE,CAAC;gBAC/C,MAAM,IAAI,KAAK,CAAC,GAAG,KAAK,6BAA6B,MAAM,0CAA0C,QAAQ,EAAE,CAAC,CAAC;YACnH,CAAC;YACD,IAAI,OAAO,CAAC,CAAC,EAAE,gBAAgB,EAAE,KAAK,CAAC,KAAK,QAAQ,IAAI,CAAC,EAAE,CAAC;gBAC1D,MAAM,IAAI,KAAK,CAAC,GAAG,KAAK,0DAA0D,QAAQ,GAAG,CAAC,CAAC;YACjG,CAAC;YACD,MAAM;QACR,CAAC;QACD,KAAK,aAAa,EAAE,CAAC;YACnB,MAAM,SAAS,GAAG,MAAM,CAAC,CAAC,EAAE,WAAW,EAAE,KAAK,CAAC,CAAC;YAChD,MAAM,KAAK,GAAG,MAAM,CAAC,CAAC,EAAE,OAAO,EAAE,KAAK,CAAC,CAAC;YACxC,2FAA2F;YAC3F,8FAA8F;YAC9F,MAAM,YAAY,GAAG,CAAC,CAAC,aAAa,CAAC,KAAK,eAAe,CAAC;YAC1D,MAAM,QAAQ,GAAG,YAAY,CAAC,CAAC,CAAC,KAAK,IAAI,SAAS,CAAC,CAAC,CAAC,SAAS,IAAI,KAAK,CAAC;YACxE,IAAI,OAAO,CAAC,CAAC,EAAE,WAAW,EAAE,KAAK,CAAC,KAAK,QAAQ,EAAE,CAAC;gBAChD,MAAM,IAAI,KAAK,CACb,GAAG,KAAK,+BAA+B,YAAY,CAAC,CAAC,CAAC,oBAAoB,CAAC,CAAC,CAAC,oBAAoB,KAAK,SAAS,OAAO,KAAK,GAAG,CAC/H,CAAC;YACJ,CAAC;YACD,MAAM;QACR,CAAC;QACD,KAAK,aAAa,EAAE,CAAC;YACnB,MAAM,SAAS,GAAG,MAAM,CAAC,CAAC,EAAE,WAAW,EAAE,KAAK,CAAC,CAAC;YAChD,MAAM,UAAU,GAAG,MAAM,CAAC,CAAC,EAAE,YAAY,EAAE,KAAK,CAAC,CAAC;YAClD,MAAM,GAAG,GAAG,MAAM,CAAC,CAAC,EAAE,eAAe,EAAE,KAAK,CAAC,CAAC;YAC9C,IAAI,CAAC,CAAC,iBAAiB,CAAC,KAAK,iBAAiB,IAAI,CAAC,CAAC,iBAAiB,CAAC,KAAK,qBAAqB,EAAE,CAAC;gBACjG,MAAM,IAAI,KAAK,CAAC,GAAG,KAAK,8DAA8D,CAAC,CAAC;YAC1F,CAAC;YACD,0FAA0F;YAC1F,IAAI,CAAC,CAAC,iBAAiB,CAAC,KAAK,qBAAqB,IAAI,SAAS,KAAK,CAAC,EAAE,CAAC;gBACtE,MAAM,QAAQ,GAAG,CAAC,UAAU,GAAG,SAAS,CAAC,GAAG,SAAS,CAAC;gBACtD,IAAI,CAAC,uBAAuB,CAAC,GAAG,EAAE,QAAQ,CAAC,EAAE,CAAC;oBAC5C,MAAM,IAAI,KAAK,CAAC,GAAG,KAAK,2BAA2B,GAAG,gDAAgD,QAAQ,EAAE,CAAC,CAAC;gBACpH,CAAC;YACH,CAAC;YACD,MAAM;QACR,CAAC;QACD,KAAK,OAAO;YACV,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC;gBAAE,MAAM,IAAI,KAAK,CAAC,GAAG,KAAK,iCAAiC,CAAC,CAAC;YAC1F,MAAM;IACV,CAAC;IACD,OAAO,CAAoC,CAAC;AAC9C,CAAC;AAED,SAAS,oBAAoB,CAAC,IAAuB;IACnD,OAAO,IAAI,CAAC,cAAc,CAAC,GAAG,CAAC,CAAC,GAAG,EAAE,EAAE,CAAC,CAAC,EAAE,GAAG,GAAG,EAAE,OAAO,EAAE,WAAW,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,CAAC;AACnF,CAAC;AAED;;;;;GAKG;AACH,SAAS,gBAAgB,CAAC,IAAuB;IAC/C,MAAM,OAAO,GAAG,IAAI,GAAG,CAAC,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,CAAC,KAAK,CAAC,EAAE,EAAE,KAAK,CAAC,CAAC,CAAC,CAAC;IACxE,MAAM,cAAc,GAAG,oBAAoB,CAAC,IAAI,CAAC,CAAC;IAClD,MAAM,SAAS,GAAG,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,CAAC,QAAQ,EAAmB,EAAE;QACjE,IAAI,QAAQ,CAAC,SAAS,KAAK,IAAI,EAAE,CAAC;YAChC,IAAI,QAAQ,CAAC,UAAU,KAAK,SAAS,EAAE,CAAC;gBACtC,MAAM,IAAI,KAAK,CAAC,sCAAsC,QAAQ,CAAC,EAAE,uCAAuC,CAAC,CAAC;YAC5G,CAAC;YACD,OAAO,EAAE,GAAG,QAAQ,EAAE,UAAU,EAAE,QAAQ,CAAC,UAAU,EAAE,CAAC;QAC1D,CAAC;QACD,IAAI,QAAQ,CAAC,UAAU,KAAK,SAAS,EAAE,CAAC;YACtC,MAAM,IAAI,KAAK,CAAC,sCAAsC,QAAQ,CAAC,EAAE,qDAAqD,CAAC,CAAC;QAC1H,CAAC;QACD,MAAM,KAAK,GAAG,OAAO,CAAC,GAAG,CAAC,QAAQ,CAAC,SAAS,CAAC,CAAC;QAC9C,IAAI,KAAK,KAAK,SAAS,EAAE,CAAC;YACxB,MAAM,IAAI,KAAK,CAAC,sCAAsC,QAAQ,CAAC,EAAE,gCAAgC,QAAQ,CAAC,SAAS,EAAE,CAAC,CAAC;QACzH,CAAC;QACD,IAAI,KAAK,CAAC,MAAM,KAAK,SAAS,EAAE,CAAC;YAC/B,MAAM,IAAI,KAAK,CAAC,sCAAsC,QAAQ,CAAC,EAAE,2CAA2C,CAAC,CAAC;QAChH,CAAC;QACD,OAAO,EAAE,GAAG,QAAQ,EAAE,UAAU,EAAE,KAAK,CAAC,MAAM,EAAE,CAAC;IACnD,CAAC,CAAC,CAAC;IACH,OAAO,EAAE,GAAG,IAAI,EAAE,SAAS,EAAE,cAAc,EAAE,CAAC;AAChD,CAAC;AAED;;;GAGG;AACH,SAAS,UAAU,CAAC,SAAoC,EAAE,MAAc;IACtE,MAAM,IAAI,GAAG,SAAS,CAAC,IAAI,IAAI,CAAC,SAAS,CAAC,WAAW,KAAK,UAAU,CAAC,CAAC,CAAC,aAAa,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC;IAClG,IAAI,IAAI,KAAK,UAAU;QAAE,OAAO,GAAG,MAAM,MAAM,CAAC;IAChD,IAAI,IAAI,KAAK,aAAa;QAAE,OAAO,GAAG,MAAM,OAAO,CAAC;IACpD,OAAO,SAAS,CAAC;AACnB,CAAC;AAED;;;;;GAKG;AACH,SAAS,aAAa,CAAC,IAAiB;IACtC,MAAM,SAAS,GAAG,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,CAAC,QAAQ,EAAE,EAAE;QAChD,IAAI,QAAQ,CAAC,SAAS,KAAK,IAAI;YAAE,OAAO,QAAQ,CAAC;QACjD,MAAM,SAAS,GAAG,IAAI,CAAC,UAAU,CAAC,IAAI,CAAC,CAAC,GAAG,EAAE,EAAE,CAAC,GAAG,CAAC,SAAS,KAAK,QAAQ,CAAC,SAAS,CAAC,CAAC;QACtF,IAAI,SAAS,KAAK,SAAS;YAAE,OAAO,QAAQ,CAAC;QAC7C,MAAM,OAAO,GAAa,EAAE,CAAC;QAC7B,KAAK,MAAM,SAAS,IAAI,SAAS,CAAC,UAAU,EAAE,CAAC;YAC7C,MAAM,MAAM,GACV,QAAQ,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,KAAK,SAAS,CAAC,GAAG,IAAI,CAAC,QAAQ,CAAC,OAAO,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC,CAAC,QAAQ,CAAC,SAAS,CAAC,GAAG,CAAC,CAAC;gBACjH,CAAC,QAAQ,CAAC,OAAO,CAAC,QAAQ,CAAC,SAAS,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC,QAAQ,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC;YACnF,IAAI,MAAM,KAAK,SAAS;gBAAE,SAAS;YACnC,MAAM,MAAM,GAAG,UAAU,CAAC,SAAS,EAAE,MAAM,CAAC,CAAC;YAC7C,iFAAiF;YACjF,IAAI,MAAM,KAAK,SAAS,IAAI,CAAC,iBAAiB,CAAC,QAAQ,CAAC,KAAK,EAAE,MAAM,CAAC;gBAAE,OAAO,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;QAC/F,CAAC;QACD,IAAI,OAAO,CAAC,MAAM,KAAK,CAAC;YAAE,OAAO,QAAQ,CAAC;QAC1C,MAAM,MAAM,GAAG,QAAQ,CAAC,KAAK,CAAC,IAAI,EAAE,KAAK,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,GAAG,QAAQ,CAAC,KAAK,OAAO,CAAC;QAChF,OAAO;YACL,GAAG,QAAQ;YACX,KAAK,EAAE,GAAG,MAAM,GAAG,OAAO,CAAC,IAAI,CAAC,OAAO,CAAC,EAAE;YAC1C,MAAM,EAAE,QAAQ,CAAC,MAAM,KAAK,EAAE,CAAC,CAAC,CAAC,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,GAAG,QAAQ,CAAC,MAAM,KAAK,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE;SAClG,CAAC;IACJ,CAAC,CAAC,CAAC;IACH,OAAO,EAAE,GAAG,IAAI,EAAE,SAAS,EAAE,CAAC;AAChC,CAAC;AAED;;;;;;GAMG;AACH,MAAM,UAAU,WAAW,CAAC,IAAuB;IACjD,UAAU,CAAC,IAAI,CAAC,CAAC;IACjB,OAAO,aAAa,CAAC,gBAAgB,CAAC,IAAI,CAAC,CAAC,CAAC;AAC/C,CAAC;AAED,MAAM,OAAO,GAAG,WAAW,CAAC,QAAQ,EAAE,CAAC,CAAC;AAExC,0BAA0B;AAC1B,MAAM,UAAU,aAAa;IAC3B,OAAO,OAAO,CAAC;AACjB,CAAC;AAED,mCAAmC;AACnC,MAAM,UAAU,cAAc;IAC5B,OAAO,OAAO,CAAC,OAAO,CAAC;AACzB,CAAC;AAED,mCAAmC;AACnC,MAAM,UAAU,gBAAgB;IAC9B,OAAO,OAAO,CAAC,SAAS,CAAC;AAC3B,CAAC;AAED,gDAAgD;AAChD,MAAM,UAAU,iBAAiB;IAC/B,OAAO,OAAO,CAAC,UAAU,CAAC;AAC5B,CAAC;AAED,yDAAyD;AACzD,MAAM,UAAU,qBAAqB;IACnC,OAAO,OAAO,CAAC,cAAc,CAAC;AAChC,CAAC;AAED,2CAA2C;AAC3C,MAAM,UAAU,iBAAiB;IAC/B,OAAO,OAAO,CAAC,UAAU,CAAC;AAC5B,CAAC;AAED,MAAM,WAAW,GAAG,IAAI,GAAG,CAAC,OAAO,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,CAAC,KAAK,CAAC,EAAE,EAAE,KAAK,CAAC,CAAC,CAAC,CAAC;AAC/E,MAAM,oBAAoB,GAAG,IAAI,GAAG,EAA6B,CAAC;AAClE,KAAK,MAAM,QAAQ,IAAI,OAAO,CAAC,SAAS,EAAE,CAAC;IACzC,IAAI,QAAQ,CAAC,SAAS,KAAK,IAAI;QAAE,SAAS;IAC1C,MAAM,IAAI,GAAG,oBAAoB,CAAC,GAAG,CAAC,QAAQ,CAAC,SAAS,CAAC,CAAC;IAC1D,IAAI,IAAI,KAAK,SAAS;QAAE,oBAAoB,CAAC,GAAG,CAAC,QAAQ,CAAC,SAAS,EAAE,CAAC,QAAQ,CAAC,CAAC,CAAC;;QAC5E,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;AAC3B,CAAC;AAED,8CAA8C;AAC9C,MAAM,UAAU,YAAY,CAAC,EAAU;IACrC,OAAO,WAAW,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;AAC7B,CAAC;AAED,yDAAyD;AACzD,MAAM,UAAU,mBAAmB,CAAC,EAAU;IAC5C,OAAO,oBAAoB,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,EAAE,CAAC;AAC5C,CAAC;AAED;;;GAGG;AACH,MAAM,UAAU,eAAe,CAAC,EAAU;IACxC,MAAM,IAAI,GAAG,mBAAmB,CAAC,EAAE,CAAC,CAAC;IACrC,OAAO,IAAI,CAAC,IAAI,CAAC,CAAC,GAAG,EAAE,EAAE,CAAC,GAAG,CAAC,EAAE,KAAK,MAAM,EAAE,EAAE,CAAC,IAAI,IAAI,CAAC,CAAC,CAAC,CAAC;AAC9D,CAAC;AAED;;;;;GAKG;AACH,MAAM,UAAU,eAAe,CAAC,GAAW;IACzC,MAAM,KAAK,GAAG,kBAAkB,CAAC,IAAI,CAAC,GAAG,CAAC,IAAI,EAAE,CAAC,CAAC;IAClD,OAAO,KAAK,KAAK,IAAI,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC;AACvD,CAAC;AAED;;;GAGG;AACH,MAAM,UAAU,aAAa,CAAC,QAAyB;IACrD,IAAI,OAAO,QAAQ,KAAK,QAAQ,EAAE,CAAC;QACjC,IAAI,CAAC,MAAM,CAAC,SAAS,CAAC,QAAQ,CAAC,EAAE,CAAC;YAChC,MAAM,IAAI,UAAU,CAAC,kBAAkB,QAAQ,+BAA+B,CAAC,CAAC;QAClF,CAAC;QACD,OAAO,QAAQ,CAAC;IAClB,CAAC;IACD,MAAM,EAAE,GAAG,eAAe,CAAC,QAAQ,CAAC,CAAC;IACrC,IAAI,EAAE,KAAK,SAAS,EAAE,CAAC;QACrB,MAAM,IAAI,SAAS,CAAC,mBAAmB,QAAQ,uBAAuB,CAAC,CAAC;IAC1E,CAAC;IACD,OAAO,EAAE,CAAC;AACZ,CAAC;AAED,mEAAmE;AACnE,MAAM,UAAU,cAAc,CAAC,EAAU;IACvC,OAAO,MAAM,EAAE,EAAE,CAAC;AACpB,CAAC","sourcesContent":["/**\n * The catalog loader. This module is the only place that parses a bridge id\n * out of text. Everywhere else reads the loaded records.\n *\n * @module bridges/catalog-load\n */\n\nimport { residualInSigma } from './observations/types.js';\nimport { checkedDataFile } from '../core/data-file.js';\nimport type {\n  CatalogConfrontation,\n  CatalogConfrontationRecord,\n  CatalogEntry,\n  CatalogEvaluator,\n  CatalogEvaluatorParameter,\n  CatalogFile,\n  CatalogFileRecord,\n  CatalogRejection,\n  CatalogRelation,\n} from './catalog-types.js';\nimport type { ConfrontationOutcome } from './observations/types.js';\n\n/**\n * `data/bridge-catalog.json`, checked against `data/bridge-catalog.schema.json`\n * (every record's `type`, the relation, evaluator, parameter and confrontation\n * shapes). What a schema cannot state is checked by {@link loadCatalog}.\n */\nfunction loadFile(): CatalogFileRecord {\n  return checkedDataFile('bridge-catalog.json') as CatalogFileRecord;\n}\n\n/** Records in ascending id order; a duplicate or a disordered id is refused. */\nfunction checkOrder(file: CatalogFileRecord): void {\n  for (let i = 1; i < file.entries.length; i += 1) {\n    const previous = file.entries[i - 1]!.id;\n    const current = file.entries[i]!.id;\n    if (current <= previous) {\n      throw new Error(`data/bridge-catalog.json: entry ${current} follows entry ${previous}; records are in ascending id order`);\n    }\n  }\n  const seen = new Set<number>();\n  for (const row of file.confrontations) {\n    if (seen.has(row.catalogId)) throw new Error(`data/bridge-catalog.json: catalog id ${row.catalogId} has two confrontations`);\n    seen.add(row.catalogId);\n  }\n  const rejected = new Set<number>();\n  const ids = new Set(file.entries.map((entry) => entry.id));\n  for (const row of file.rejections) {\n    if (!ids.has(row.catalogId)) throw new Error(`data/bridge-catalog.json: rejection ${row.catalogId} names no catalog row`);\n    if (rejected.has(row.catalogId)) throw new Error(`data/bridge-catalog.json: catalog id ${row.catalogId} is rejected twice`);\n    rejected.add(row.catalogId);\n  }\n}\n\nconst number = (o: Readonly<Record<string, unknown>>, key: string, where: string): number => {\n  const v = o[key];\n  if (typeof v !== 'number' || !Number.isFinite(v)) throw new Error(`${where}: outcome.${key} must be a finite number`);\n  return v;\n};\nconst boolean = (o: Readonly<Record<string, unknown>>, key: string, where: string): boolean => {\n  const v = o[key];\n  if (typeof v !== 'boolean') throw new Error(`${where}: outcome.${key} must be a boolean`);\n  return v;\n};\n\n/**\n * The outcome of one confrontation, checked arm by arm on its `kind`. The\n * schema states the shared fields (`kind`, `units`, `provenance`, the data\n * handling); the fields each arm must carry are checked here, so the loaded\n * record is a {@link ConfrontationOutcome} by inspection, not by assertion.\n */\n/** A stored number is written to a few significant digits; it agrees when it rounds to the computed one within 1e-3 relative (or absolute near zero). */\nfunction agreesToStoredPrecision(stored: number, computed: number): boolean {\n  return Math.abs(stored - computed) <= 1e-3 * Math.max(1, Math.abs(computed));\n}\n\n/** True when `holds` contains `clause` as a whole clause, not as the tail of a longer name. */\nfunction holdsStatesClause(holds: string, clause: string): boolean {\n  let from = 0;\n  for (;;) {\n    const at = holds.indexOf(clause, from);\n    if (at < 0) return false;\n    const before = at === 0 ? ' ' : holds[at - 1]!;\n    if (!/[A-Za-z0-9_-]/.test(before)) return true;\n    from = at + 1;\n  }\n}\n\nfunction readOutcome(row: CatalogConfrontationRecord): ConfrontationOutcome {\n  const where = `data/bridge-catalog.json: confrontation ${row.catalogId}`;\n  const o = row.outcome;\n  if (o['kind'] !== row.kind) throw new Error(`${where}: outcome.kind ${String(o['kind'])} is not the record kind ${row.kind}`);\n  switch (row.kind) {\n    case 'value': {\n      // The verdict is derived from the numbers, never read as stored (AGENTS law 1): a stored\n      // residual or verdict that disagrees with |predicted − observed|/σ is refused.\n      const predicted = number(o, 'predicted', where);\n      const observed = number(o, 'observed', where);\n      const sigma = number(o, 'sigma', where);\n      const stored = number(o, 'residualInSigma', where);\n      const computed = residualInSigma(predicted, observed, sigma);\n      if (!agreesToStoredPrecision(stored, computed)) {\n        throw new Error(`${where}: outcome.residualInSigma ${stored} is not |predicted − observed|/sigma = ${computed}`);\n      }\n      if (boolean(o, 'withinObserved', where) !== computed <= 1) {\n        throw new Error(`${where}: outcome.withinObserved must be residualInSigma <= 1 (${computed})`);\n      }\n      break;\n    }\n    case 'upper-bound': {\n      const predicted = number(o, 'predicted', where);\n      const bound = number(o, 'bound', where);\n      // `predictedIs` picks the comparison (`observations/types.ts`): a point is satisfied at or\n      // below the observed limit; an encoded bound (|x| ≤ predicted) when the limit lies inside it.\n      const encodedBound = o['predictedIs'] === 'encoded-bound';\n      const expected = encodedBound ? bound <= predicted : predicted <= bound;\n      if (boolean(o, 'satisfied', where) !== expected) {\n        throw new Error(\n          `${where}: outcome.satisfied must be ${encodedBound ? 'bound <= predicted' : 'predicted <= bound'} (${predicted} vs ${bound})`,\n        );\n      }\n      break;\n    }\n    case 'consistency': {\n      const predicted = number(o, 'predicted', where);\n      const approaches = number(o, 'approaches', where);\n      const gap = number(o, 'fractionalGap', where);\n      if (o['fractionalGapIs'] !== 'agreement-bound' && o['fractionalGapIs'] !== 'observed-difference') {\n        throw new Error(`${where}: outcome.fractionalGapIs must name what fractionalGap holds`);\n      }\n      // An agreement bound is the record's stated tolerance; an observed difference is derived.\n      if (o['fractionalGapIs'] === 'observed-difference' && predicted !== 0) {\n        const computed = (approaches - predicted) / predicted;\n        if (!agreesToStoredPrecision(gap, computed)) {\n          throw new Error(`${where}: outcome.fractionalGap ${gap} is not (approaches − predicted)/predicted = ${computed}`);\n        }\n      }\n      break;\n    }\n    case 'table':\n      if (!Array.isArray(o['rows'])) throw new Error(`${where}: outcome.rows must be an array`);\n      break;\n  }\n  return o as unknown as ConfrontationOutcome;\n}\n\nfunction narrowConfrontations(file: CatalogFileRecord): readonly CatalogConfrontation[] {\n  return file.confrontations.map((row) => ({ ...row, outcome: readOutcome(row) }));\n}\n\n/**\n * A relation's confidence is its catalog row's `status`. The row is the one\n * owner, so the file may not store a confidence beside a catalog id; a\n * relation with no row stores its own. A row that is `invalid` has no\n * relation to evaluate.\n */\nfunction deriveConfidence(file: CatalogFileRecord): CatalogFile {\n  const entries = new Map(file.entries.map((entry) => [entry.id, entry]));\n  const confrontations = narrowConfrontations(file);\n  const relations = file.relations.map((relation): CatalogRelation => {\n    if (relation.catalogId === null) {\n      if (relation.confidence === undefined) {\n        throw new Error(`data/bridge-catalog.json: relation ${relation.id} has no catalog row and no confidence`);\n      }\n      return { ...relation, confidence: relation.confidence };\n    }\n    if (relation.confidence !== undefined) {\n      throw new Error(`data/bridge-catalog.json: relation ${relation.id} stores a confidence; the row's status is the owner`);\n    }\n    const entry = entries.get(relation.catalogId);\n    if (entry === undefined) {\n      throw new Error(`data/bridge-catalog.json: relation ${relation.id} names an unknown catalog id ${relation.catalogId}`);\n    }\n    if (entry.status === 'invalid') {\n      throw new Error(`data/bridge-catalog.json: relation ${relation.id} has a closed form but its row is invalid`);\n    }\n    return { ...relation, confidence: entry.status };\n  });\n  return { ...file, relations, confrontations };\n}\n\n/**\n * The validity clause a parameter's sign states, in the relation's own source\n * name. An absolute temperature is nonnegative unless the parameter says `any`.\n */\nfunction signClause(parameter: CatalogEvaluatorParameter, source: string): string | undefined {\n  const sign = parameter.sign ?? (parameter.temperature === 'absolute' ? 'nonnegative' : undefined);\n  if (sign === 'positive') return `${source} > 0`;\n  if (sign === 'nonnegative') return `${source} >= 0`;\n  return undefined;\n}\n\n/**\n * Add the sign clauses the evaluator parameters state to the relation they\n * evaluate. The validity domain is derived from the flags, so a new bridge\n * that flags its inputs cannot leave the domain behind. A clause the record\n * already states is not repeated.\n */\nfunction deriveDomains(file: CatalogFile): CatalogFile {\n  const relations = file.relations.map((relation) => {\n    if (relation.catalogId === null) return relation;\n    const evaluator = file.evaluators.find((row) => row.catalogId === relation.catalogId);\n    if (evaluator === undefined) return relation;\n    const clauses: string[] = [];\n    for (const parameter of evaluator.parameters) {\n      const source =\n        relation.sources.find((name) => name === parameter.key || (relation.aliases[name] ?? []).includes(parameter.key)) ??\n        (relation.sources.includes(parameter.quantity) ? parameter.quantity : undefined);\n      if (source === undefined) continue;\n      const clause = signClause(parameter, source);\n      // A whole-clause match: `radius > 0` is not already stated by `near-radius > 0`.\n      if (clause !== undefined && !holdsStatesClause(relation.holds, clause)) clauses.push(clause);\n    }\n    if (clauses.length === 0) return relation;\n    const stated = relation.holds.trim() === 'true' ? '' : `${relation.holds} and `;\n    return {\n      ...relation,\n      holds: `${stated}${clauses.join(' and ')}`,\n      domain: relation.domain === '' ? clauses.join(', ') : `${relation.domain}; ${clauses.join(', ')}`,\n    };\n  });\n  return { ...file, relations };\n}\n\n/**\n * The loaded catalog from a file record: the records are in id order, each\n * outcome is checked on its kind, each relation takes its row's status as its\n * confidence, then the sign clauses its evaluator parameters state. The\n * production catalog is this function on `data/bridge-catalog.json`.\n * @internal\n */\nexport function loadCatalog(file: CatalogFileRecord): CatalogFile {\n  checkOrder(file);\n  return deriveDomains(deriveConfidence(file));\n}\n\nconst CATALOG = loadCatalog(loadFile());\n\n/** The loaded catalog. */\nexport function bridgeCatalog(): CatalogFile {\n  return CATALOG;\n}\n\n/** Catalog rows, in file order. */\nexport function catalogEntries(): readonly CatalogEntry[] {\n  return CATALOG.entries;\n}\n\n/** Closed forms, in file order. */\nexport function catalogRelations(): readonly CatalogRelation[] {\n  return CATALOG.relations;\n}\n\n/** Evaluator input contracts, in file order. */\nexport function catalogEvaluators(): readonly CatalogEvaluator[] {\n  return CATALOG.evaluators;\n}\n\n/** Confrontations, in file order; one per catalog id. */\nexport function catalogConfrontations(): readonly CatalogConfrontation[] {\n  return CATALOG.confrontations;\n}\n\n/** The negative catalog, in file order. */\nexport function catalogRejections(): readonly CatalogRejection[] {\n  return CATALOG.rejections;\n}\n\nconst ENTRY_BY_ID = new Map(CATALOG.entries.map((entry) => [entry.id, entry]));\nconst RELATIONS_BY_CATALOG = new Map<number, CatalogRelation[]>();\nfor (const relation of CATALOG.relations) {\n  if (relation.catalogId === null) continue;\n  const list = RELATIONS_BY_CATALOG.get(relation.catalogId);\n  if (list === undefined) RELATIONS_BY_CATALOG.set(relation.catalogId, [relation]);\n  else list.push(relation);\n}\n\n/** The row for a catalog id, or undefined. */\nexport function catalogEntry(id: number): CatalogEntry | undefined {\n  return ENTRY_BY_ID.get(id);\n}\n\n/** Relations whose catalog id is `id`, in file order. */\nexport function relationsForCatalog(id: number): readonly CatalogRelation[] {\n  return RELATIONS_BY_CATALOG.get(id) ?? [];\n}\n\n/**\n * The relation a numeric catalog id evaluates. The graph id `be-<id>` wins\n * when several relations share the id. Otherwise the first relation does.\n */\nexport function primaryRelation(id: number): CatalogRelation | undefined {\n  const rows = relationsForCatalog(id);\n  return rows.find((row) => row.id === `be-${id}`) ?? rows[0];\n}\n\n/**\n * The catalog number a piece of text names (`42`, `be-42`, `BE-42`), or\n * undefined when it names none (an atlas id, a canonical id, a quantity).\n * The one place a bridge id is read from text; {@link parseBridgeId} throws\n * where this returns undefined.\n */\nexport function catalogIdNumber(raw: string): number | undefined {\n  const match = /^(?:be-)?(\\d+)$/i.exec(raw.trim());\n  return match === null ? undefined : Number(match[1]);\n}\n\n/**\n * Parse a catalog id from a number or from text the caller typed.\n * Accepts `42`, `be-42`, and `BE-42`. This is the only such parser.\n */\nexport function parseBridgeId(bridgeId: number | string): number {\n  if (typeof bridgeId === 'number') {\n    if (!Number.isInteger(bridgeId)) {\n      throw new RangeError(`parseBridgeId: ${bridgeId} is not an integer catalog id`);\n    }\n    return bridgeId;\n  }\n  const id = catalogIdNumber(bridgeId);\n  if (id === undefined) {\n    throw new TypeError(`parseBridgeId: '${bridgeId}' is not a catalog id`);\n  }\n  return id;\n}\n\n/** Graph id for a catalog number: the stable key, not a switch. */\nexport function catalogEdgeKey(id: number): string {\n  return `be-${id}`;\n}\n"]}