@descent-vtt/spec-graph 0.7.0 → 0.9.0

package/dist/vendor/spec-core/pattern/glob.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"glob.js","sourceRoot":"","sources":["../../../../src/vendor/spec-core/pattern/glob.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GAkCG;AAEH,OAAO,EACL,OAAO,EACP,WAAW,EACX,OAAO,EACP,cAAc,GAIf,MAAM,gBAAgB,CAAC;AACxB,OAAO,EAAE,GAAG,EAAE,QAAQ,EAAE,UAAU,EAAE,SAAS,EAAkB,MAAM,cAAc,CAAC;AA2CpF,MAAM,OAAO,SAAU,SAAQ,KAAK;IACzB,MAAM,CAAS;IACxB,YAAY,MAAc,EAAE,MAAc;QACxC,KAAK,CAAC,iBAAiB,MAAM,MAAM,MAAM,EAAE,CAAC,CAAC;QAC7C,IAAI,CAAC,IAAI,GAAG,WAAW,CAAC;QACxB,IAAI,CAAC,MAAM,GAAG,MAAM,CAAC;IACvB,CAAC;CACF;AAED,6DAA6D;AAC7D,MAAM,CAAC,MAAM,gBAAgB,GAAG,GAAG,CAAC;AAgBpC,gDAAgD;AAChD,MAAM,UAAU,YAAY,CAAC,MAAc;IACzC,OAAO,WAAW,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;AAClC,CAAC;AAED,yDAAyD;AACzD,MAAM,UAAU,SAAS,CAAC,MAAc,EAAE,OAAoB;IAC5D,MAAM,MAAM,GAAG,KAAK,CAAC,MAAM,EAAE,OAAO,CAAC,CAAC;IACtC,OAAO,OAAO,MAAM,KAAK,QAAQ,CAAC,CAAC,CAAC,EAAE,EAAE,EAAE,KAAK,EAAE,KAAK,EAAE,MAAM,EAAE,CAAC,CAAC,CAAC,EAAE,EAAE,EAAE,IAAI,EAAE,IAAI,EAAE,MAAM,EAAE,CAAC;AAChG,CAAC;AAED,6EAA6E;AAC7E,MAAM,UAAU,WAAW,CAAC,MAAc,EAAE,OAAoB;IAC9D,MAAM,MAAM,GAAG,KAAK,CAAC,MAAM,EAAE,OAAO,CAAC,CAAC;IACtC,IAAI,OAAO,MAAM,KAAK,QAAQ;QAAE,MAAM,IAAI,SAAS,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;IACpE,OAAO,MAAM,CAAC;AAChB,CAAC;AAED,SAAS,KAAK,CAAC,MAAc,EAAE,OAAoB;IACjD,MAAM,OAAO,GAAG,OAAO,CAAC,SAAS,KAAK,WAAW,CAAC;IAClD,IAAI,OAAO,GAAG,MAAM,CAAC,IAAI,EAAE,CAAC;IAC5B,IAAI,CAAC,OAAO;QAAE,OAAO,GAAG,OAAO,CAAC,OAAO,CAAC,KAAK,EAAE,GAAG,CAAC,CAAC;IACpD,IAAI,OAAO,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,sBAAsB,CAAC;IACxD,IAAI,OAAO,CAAC,UAAU,CAAC,GAAG,CAAC;QAAE,OAAO,4EAA4E,CAAC;IACjH,IAAI,6BAA6B,CAAC,IAAI,CAAC,OAAO,CAAC;QAAE,OAAO,OAAO,CAAC;IAChE,OAAO,OAAO,CAAC,UAAU,CAAC,IAAI,CAAC;QAAE,OAAO,GAAG,OAAO,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;IAE5D,2EAA2E;IAC3E,6EAA6E;IAC7E,IAAI,MAAM,GAAG,KAAK,CAAC;IACnB,IAAI,QAAQ,GAAG,KAAK,CAAC;IACrB,IAAI,OAAO,CAAC,UAAU,CAAC,GAAG,CAAC,EAAE,CAAC;QAC5B,IAAI,OAAO,CAAC,OAAO,KAAK,WAAW;YAAE,QAAQ,GAAG,IAAI,CAAC;;YAChD,MAAM,GAAG,IAAI,CAAC;QACnB,OAAO,GAAG,OAAO,CAAC,OAAO,CAAC,MAAM,EAAE,EAAE,CAAC,CAAC;IACxC,CAAC;IACD,yEAAyE;IACzE,sDAAsD;IACtD,IAAI,OAAO,CAAC,QAAQ,CAAC,GAAG,CAAC,EAAE,CAAC;QAC1B,OAAO,GAAG,OAAO,CAAC,OAAO,CAAC,MAAM,EAAE,EAAE,CAAC,CAAC;QACtC,IAAI,OAAO,CAAC,OAAO,KAAK,WAAW;YAAE,OAAO,GAAG,GAAG,OAAO,KAAK,CAAC;IACjE,CAAC;IACD,IAAI,OAAO,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,wDAAwD,CAAC;IAE1F,MAAM,QAAQ,GAAG,YAAY,CAAC,OAAO,EAAE,OAAO,CAAC,CAAC;IAChD,IAAI,OAAO,QAAQ,KAAK,QAAQ;QAAE,OAAO,QAAQ,CAAC;IAElD,MAAM,YAAY,GAAkB,EAAE,CAAC;IACvC,KAAK,MAAM,IAAI,IAAI,QAAQ,EAAE,CAAC;QAC5B,MAAM,MAAM,GAAG,gBAAgB,CAAC,IAAI,EAAE,OAAO,CAAC,CAAC;QAC/C,IAAI,OAAO,MAAM,KAAK,QAAQ;YAAE,OAAO,MAAM,CAAC;QAC9C,YAAY,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;IAC5B,CAAC;IAED,MAAM,OAAO,GAAG,IAAI,OAAO,EAAE,CAAC;IAC9B,MAAM,SAAS,GAAe,EAAE,CAAC;IACjC,MAAM,KAAK,GAAa,EAAE,CAAC;IAC3B,KAAK,MAAM,WAAW,IAAI,YAAY,EAAE,CAAC;QACvC,MAAM,QAAQ,GAAG,kBAAkB,CAAC,OAAO,EAAE,WAAW,EAAE,OAAO,EAAE,MAAM,EAAE,QAAQ,CAAC,CAAC;QACrF,SAAS,CAAC,IAAI,CAAC,QAAQ,CAAC,QAAQ,CAAC,CAAC;QAClC,KAAK,CAAC,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC;IAC5B,CAAC;IACD,MAAM,SAAS,GAAG,OAAO,CAAC,MAAM,CAAC,OAAO,CAAC,MAAM,CAAC,SAAS,CAAC,EAAE,OAAO,CAAC,aAAa,CAAC,CAAC;IACnF,IAAI,OAAO,GAAmB,IAAI,CAAC;IACnC,OAAO;QACL,MAAM;QACN,OAAO,EAAE,OAAO,CAAC,OAAO;QACxB,aAAa,EAAE,OAAO,CAAC,aAAa;QACpC,KAAK,EAAE,CAAC,GAAG,IAAI,GAAG,CAAC,KAAK,CAAC,CAAC;QAC1B,SAAS;QACT,KAAK,CAAC,IAAY;YAChB,OAAO,KAAK,IAAI,OAAO,CAAC,SAAS,CAAC,CAAC;YACnC,OAAO,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAC5B,CAAC;KACF,CAAC;AACJ,CAAC;AAED,+EAA+E;AAE/E;;;;;;;GAOG;AACH,SAAS,YAAY,CAAC,OAAe,EAAE,OAAgB;IACrD,IAAI,KAAK,GAAG,CAAC,CAAC;IACd,IAAI,IAAI,GAAG,CAAC,CAAC,CAAC;IACd,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,OAAO,CAAC,MAAM,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC;QAC3C,MAAM,EAAE,GAAG,OAAO,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;QAC7B,IAAI,EAAE,KAAK,IAAI,IAAI,OAAO,EAAE,CAAC;YAC3B,CAAC,IAAI,CAAC,CAAC;YACP,SAAS;QACX,CAAC;QACD,IAAI,EAAE,KAAK,GAAG,EAAE,CAAC;YACf,MAAM,KAAK,GAAG,QAAQ,CAAC,OAAO,EAAE,CAAC,EAAE,OAAO,CAAC,CAAC;YAC5C,IAAI,KAAK,GAAG,CAAC;gBAAE,CAAC,GAAG,KAAK,CAAC;YACzB,SAAS;QACX,CAAC;QACD,IAAI,EAAE,KAAK,GAAG,EAAE,CAAC;YACf,IAAI,KAAK,KAAK,CAAC;gBAAE,IAAI,GAAG,CAAC,CAAC;YAC1B,KAAK,IAAI,CAAC,CAAC;YACX,SAAS;QACX,CAAC;QACD,IAAI,EAAE,KAAK,GAAG,IAAI,KAAK,KAAK,CAAC;YAAE,SAAS;QACxC,KAAK,IAAI,CAAC,CAAC;QACX,IAAI,KAAK,GAAG,CAAC;YAAE,SAAS;QACxB,MAAM,MAAM,GAAG,OAAO,CAAC,KAAK,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC;QACtC,MAAM,MAAM,GAAG,OAAO,CAAC,KAAK,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;QACpC,MAAM,OAAO,GAAa,EAAE,CAAC;QAC7B,KAAK,MAAM,MAAM,IAAI,YAAY,CAAC,OAAO,CAAC,KAAK,CAAC,IAAI,GAAG,CAAC,EAAE,CAAC,CAAC,EAAE,OAAO,CAAC,EAAE,CAAC;YACvE,MAAM,QAAQ,GAAG,YAAY,CAAC,GAAG,MAAM,GAAG,MAAM,GAAG,MAAM,EAAE,EAAE,OAAO,CAAC,CAAC;YACtE,IAAI,OAAO,QAAQ,KAAK,QAAQ;gBAAE,OAAO,QAAQ,CAAC;YAClD,OAAO,CAAC,IAAI,CAAC,GAAG,QAAQ,CAAC,CAAC;YAC1B,IAAI,OAAO,CAAC,MAAM,GAAG,gBAAgB;gBAAE,OAAO,kCAAkC,gBAAgB,WAAW,CAAC;QAC9G,CAAC;QACD,OAAO,OAAO,CAAC;IACjB,CAAC;IACD,IAAI,KAAK,GAAG,CAAC;QAAE,OAAO,uBAAuB,CAAC;IAC9C,OAAO,CAAC,OAAO,CAAC,CAAC;AACnB,CAAC;AAED,mDAAmD;AACnD,SAAS,YAAY,CAAC,IAAY,EAAE,OAAgB;IAClD,MAAM,KAAK,GAAa,EAAE,CAAC;IAC3B,IAAI,KAAK,GAAG,CAAC,CAAC;IACd,IAAI,KAAK,GAAG,CAAC,CAAC;IACd,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,MAAM,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC;QACxC,MAAM,EAAE,GAAG,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;QAC1B,IAAI,EAAE,KAAK,IAAI,IAAI,OAAO,EAAE,CAAC;YAC3B,CAAC,IAAI,CAAC,CAAC;QACT,CAAC;aAAM,IAAI,EAAE,KAAK,GAAG,EAAE,CAAC;YACtB,MAAM,KAAK,GAAG,QAAQ,CAAC,IAAI,EAAE,CAAC,EAAE,OAAO,CAAC,CAAC;YACzC,IAAI,KAAK,GAAG,CAAC;gBAAE,CAAC,GAAG,KAAK,CAAC;QAC3B,CAAC;aAAM,IAAI,EAAE,KAAK,GAAG,EAAE,CAAC;YACtB,KAAK,IAAI,CAAC,CAAC;QACb,CAAC;aAAM,IAAI,EAAE,KAAK,GAAG,EAAE,CAAC;YACtB,KAAK,IAAI,CAAC,CAAC;QACb,CAAC;aAAM,IAAI,EAAE,KAAK,GAAG,IAAI,KAAK,KAAK,CAAC,EAAE,CAAC;YACrC,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC,CAAC;YACjC,KAAK,GAAG,CAAC,GAAG,CAAC,CAAC;QAChB,CAAC;IACH,CAAC;IACD,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,CAAC;IAC9B,OAAO,KAAK,CAAC;AACf,CAAC;AAED,sGAAsG;AACtG,SAAS,QAAQ,CAAC,OAAe,EAAE,IAAY,EAAE,OAAgB;IAC/D,IAAI,CAAC,GAAG,IAAI,GAAG,CAAC,CAAC;IACjB,IAAI,OAAO,CAAC,MAAM,CAAC,CAAC,CAAC,KAAK,GAAG,IAAI,OAAO,CAAC,MAAM,CAAC,CAAC,CAAC,KAAK,GAAG;QAAE,CAAC,IAAI,CAAC,CAAC;IACnE,iDAAiD;IACjD,IAAI,OAAO,CAAC,MAAM,CAAC,CAAC,CAAC,KAAK,GAAG;QAAE,CAAC,IAAI,CAAC,CAAC;IACtC,OAAO,CAAC,GAAG,OAAO,CAAC,MAAM,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC;QAClC,MAAM,EAAE,GAAG,OAAO,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;QAC7B,IAAI,EAAE,KAAK,IAAI,IAAI,OAAO,EAAE,CAAC;YAC3B,CAAC,IAAI,CAAC,CAAC;YACP,SAAS;QACX,CAAC;QACD,IAAI,EAAE,KAAK,GAAG;YAAE,OAAO,CAAC,CAAC,CAAC;QAC1B,IAAI,EAAE,KAAK,GAAG;YAAE,OAAO,CAAC,CAAC;IAC3B,CAAC;IACD,OAAO,CAAC,CAAC,CAAC;AACZ,CAAC;AAED,+EAA+E;AAE/E,SAAS,gBAAgB,CAAC,IAAY,EAAE,OAAgB;IACtD,MAAM,QAAQ,GAAc,EAAE,CAAC;IAC/B,MAAM,GAAG,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC;IAC5B,KAAK,MAAM,IAAI,IAAI,GAAG,EAAE,CAAC;QACvB,IAAI,IAAI,KAAK,EAAE,IAAI,IAAI,KAAK,GAAG;YAAE,SAAS;QAC1C,IAAI,IAAI,KAAK,IAAI;YAAE,OAAO,kDAAkD,CAAC;QAC7E,IAAI,IAAI,KAAK,IAAI,EAAE,CAAC;YAClB,IAAI,QAAQ,CAAC,QAAQ,CAAC,MAAM,GAAG,CAAC,CAAC,EAAE,IAAI,KAAK,UAAU;gBAAE,QAAQ,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,UAAU,EAAE,CAAC,CAAC;YAC5F,SAAS;QACX,CAAC;QACD,MAAM,MAAM,GAAG,QAAQ,CAAC,IAAI,EAAE,OAAO,CAAC,CAAC;QACvC,IAAI,OAAO,MAAM,KAAK,QAAQ;YAAE,OAAO,MAAM,CAAC;QAC9C,QAAQ,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,MAAM,EAAE,MAAM,EAAE,CAAC,CAAC;IAC1C,CAAC;IACD,IAAI,QAAQ,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,2BAA2B,CAAC;IAC9D,OAAO,EAAE,QAAQ,EAAE,OAAO,EAAE,GAAG,CAAC,MAAM,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,KAAK,EAAE,IAAI,IAAI,KAAK,GAAG,CAAC,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;AAC7F,CAAC;AAED,MAAM,OAAO,GAAG,sHAAsH,CAAC;AACvI,MAAM,gBAAgB,GAAG,2HAA2H,CAAC;AAErJ,SAAS,QAAQ,CAAC,OAAe,EAAE,OAAgB;IACjD,MAAM,MAAM,GAAY,EAAE,CAAC;IAC3B,MAAM,KAAK,GAAG,KAAK,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;IAClC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,MAAM,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC;QACzC,MAAM,EAAE,GAAG,KAAK,CAAC,CAAC,CAAW,CAAC;QAC9B,IAAI,EAAE,KAAK,IAAI,IAAI,OAAO,EAAE,CAAC;YAC3B,MAAM,IAAI,GAAG,KAAK,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;YAC1B,IAAI,IAAI,KAAK,SAAS,IAAI,aAAa,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC;gBACnD,OAAO,yDAAyD,CAAC;YACnE,CAAC;YACD,MAAM,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,SAAS,EAAE,KAAK,EAAE,IAAI,CAAC,WAAW,CAAC,CAAC,CAAW,EAAE,CAAC,CAAC;YACvE,CAAC,IAAI,CAAC,CAAC;QACT,CAAC;aAAM,IAAI,EAAE,KAAK,GAAG,EAAE,CAAC;YACtB,mEAAmE;YACnE,oEAAoE;YACpE,oEAAoE;YACpE,sEAAsE;YACtE,IAAI,KAAK,CAAC,CAAC,GAAG,CAAC,CAAC,KAAK,GAAG;gBAAE,OAAO,gBAAgB,CAAC;YAClD,MAAM,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,MAAM,EAAE,CAAC,CAAC;QAChC,CAAC;aAAM,IAAI,EAAE,KAAK,GAAG,EAAE,CAAC;YACtB,MAAM,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,KAAK,EAAE,CAAC,CAAC;QAC/B,CAAC;aAAM,IAAI,EAAE,KAAK,GAAG,EAAE,CAAC;YACtB,MAAM,MAAM,GAAG,SAAS,CAAC,KAAK,EAAE,CAAC,EAAE,OAAO,CAAC,CAAC;YAC5C,IAAI,OAAO,MAAM,KAAK,QAAQ;gBAAE,OAAO,MAAM,CAAC;YAC9C,MAAM,CAAC,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC;YAC1B,CAAC,GAAG,MAAM,CAAC,GAAG,CAAC;QACjB,CAAC;aAAM,CAAC;YACN,MAAM,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,SAAS,EAAE,KAAK,EAAE,EAAE,CAAC,WAAW,CAAC,CAAC,CAAW,EAAE,CAAC,CAAC;QACvE,CAAC;IACH,CAAC;IACD,OAAO,MAAM,CAAC;AAChB,CAAC;AAED,SAAS,SAAS,CAAC,KAAwB,EAAE,IAAY,EAAE,OAAgB;IACzE,IAAI,CAAC,GAAG,IAAI,GAAG,CAAC,CAAC;IACjB,IAAI,OAAO,GAAG,KAAK,CAAC;IACpB,IAAI,KAAK,CAAC,CAAC,CAAC,KAAK,GAAG,IAAI,KAAK,CAAC,CAAC,CAAC,KAAK,GAAG,EAAE,CAAC;QACzC,OAAO,GAAG,IAAI,CAAC;QACf,CAAC,IAAI,CAAC,CAAC;IACT,CAAC;IACD,MAAM,MAAM,GAAgB,EAAE,CAAC;IAC/B,IAAI,KAAK,GAAG,IAAI,CAAC;IACjB,OAAO,CAAC,GAAG,KAAK,CAAC,MAAM,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC;QAChC,MAAM,EAAE,GAAG,KAAK,CAAC,CAAC,CAAW,CAAC;QAC9B,IAAI,EAAE,KAAK,GAAG,IAAI,CAAC,KAAK;YAAE,OAAO,EAAE,KAAK,EAAE,EAAE,IAAI,EAAE,OAAO,EAAE,OAAO,EAAE,MAAM,EAAE,EAAE,GAAG,EAAE,CAAC,EAAE,CAAC;QACvF,KAAK,GAAG,KAAK,CAAC;QACd,IAAI,GAAG,GAAG,EAAE,CAAC;QACb,IAAI,EAAE,KAAK,IAAI,IAAI,OAAO,IAAI,KAAK,CAAC,CAAC,GAAG,CAAC,CAAC,KAAK,SAAS,EAAE,CAAC;YACzD,CAAC,IAAI,CAAC,CAAC;YACP,GAAG,GAAG,KAAK,CAAC,CAAC,CAAW,CAAC;QAC3B,CAAC;QACD,IAAI,IAAI,GAAG,GAAG,CAAC;QACf,IAAI,KAAK,CAAC,CAAC,GAAG,CAAC,CAAC,KAAK,GAAG,IAAI,KAAK,CAAC,CAAC,GAAG,CAAC,CAAC,KAAK,SAAS,IAAI,KAAK,CAAC,CAAC,GAAG,CAAC,CAAC,KAAK,GAAG,EAAE,CAAC;YAC/E,CAAC,IAAI,CAAC,CAAC;YACP,IAAI,GAAG,KAAK,CAAC,CAAC,CAAW,CAAC;YAC1B,IAAI,IAAI,KAAK,IAAI,IAAI,OAAO,IAAI,KAAK,CAAC,CAAC,GAAG,CAAC,CAAC,KAAK,SAAS,EAAE,CAAC;gBAC3D,CAAC,IAAI,CAAC,CAAC;gBACP,IAAI,GAAG,KAAK,CAAC,CAAC,CAAW,CAAC;YAC5B,CAAC;QACH,CAAC;QACD,MAAM,IAAI,GAAG,GAAG,CAAC,WAAW,CAAC,CAAC,CAAW,CAAC;QAC1C,MAAM,EAAE,GAAG,IAAI,CAAC,WAAW,CAAC,CAAC,CAAW,CAAC;QACzC,IAAI,EAAE,GAAG,IAAI;YAAE,OAAO,cAAc,GAAG,IAAI,IAAI,kBAAkB,CAAC;QAClE,MAAM,CAAC,IAAI,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,CAAC,CAAC;IAC1B,CAAC;IACD,OAAO,uBAAuB,CAAC;AACjC,CAAC;AAED,+EAA+E;AAE/E,SAAS,WAAW,CAAC,QAA4B;IAC/C,MAAM,KAAK,GAAa,EAAE,CAAC;IAC3B,KAAK,MAAM,OAAO,IAAI,QAAQ,EAAE,CAAC;QAC/B,IAAI,OAAO,CAAC,IAAI,KAAK,MAAM;YAAE,OAAO,IAAI,CAAC;QACzC,IAAI,IAAI,GAAG,EAAE,CAAC;QACd,KAAK,MAAM,KAAK,IAAI,OAAO,CAAC,MAAM,EAAE,CAAC;YACnC,IAAI,KAAK,CAAC,IAAI,KAAK,SAAS;gBAAE,OAAO,IAAI,CAAC;YAC1C,IAAI,IAAI,MAAM,CAAC,aAAa,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC;QAC5C,CAAC;QACD,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IACnB,CAAC;IACD,OAAO,KAAK,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;AACzB,CAAC;AAED,kEAAkE;AAClE,SAAS,IAAI,CAAC,CAAU;IACtB,OAAO,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC;AAC7B,CAAC;AAED,kDAAkD;AAClD,SAAS,cAAc,CAAC,CAAU;IAChC,OAAO,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC;AAC1D,CAAC;AAED,gEAAgE;AAChE,SAAS,OAAO,CAAC,CAAU;IACzB,OAAO,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,SAAS,CAAC,EAAE,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,SAAS,CAAC,EAAE,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;AACpG,CAAC;AAED,SAAS,MAAM,CAAC,CAAU,EAAE,IAAsB;IAChD,OAAO,CAAC,CAAC,QAAQ,CACf,IAAI,CAAC,GAAG,CAAC,CAAC,KAAK,EAAE,EAAE;QACjB,QAAQ,KAAK,CAAC,IAAI,EAAE,CAAC;YACnB,KAAK,SAAS;gBACZ,OAAO,CAAC,CAAC,IAAI,CAAC,UAAU,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,CAAC;YACzC,KAAK,KAAK;gBACR,OAAO,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;YACrB,KAAK,MAAM;gBACT,OAAO,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC;YAC7B,KAAK,OAAO;gBACV,OAAO,CAAC,CAAC,IAAI,CAAC,QAAQ,CAAC,KAAK,CAAC,MAAM,EAAE,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC;QACzD,CAAC;IACH,CAAC,CAAC,CACH,CAAC;AACJ,CAAC;AAED,SAAS,gBAAgB,CAAC,CAAU,EAAE,QAA4B;IAChE,MAAM,KAAK,GAAe,EAAE,CAAC;IAC7B,QAAQ,CAAC,OAAO,CAAC,CAAC,OAAO,EAAE,CAAC,EAAE,EAAE;QAC9B,MAAM,IAAI,GAAG,CAAC,KAAK,QAAQ,CAAC,MAAM,GAAG,CAAC,CAAC;QACvC,IAAI,OAAO,CAAC,IAAI,KAAK,UAAU,EAAE,CAAC;YAChC,mEAAmE;YACnE,mEAAmE;YACnE,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,SAAS,CAAC,EAAE,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,cAAc,CAAC,CAAC,CAAC,CAAC,CAAC;YAC/G,OAAO;QACT,CAAC;QACD,KAAK,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,EAAE,OAAO,CAAC,MAAM,CAAC,CAAC,CAAC;QACtC,IAAI,CAAC,IAAI;YAAE,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC;IAC3C,CAAC,CAAC,CAAC;IACH,OAAO,CAAC,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC;AAC3B,CAAC;AAED,SAAS,kBAAkB,CACzB,CAAU,EACV,WAAwB,EACxB,OAAoB,EACpB,MAAe,EACf,QAAiB;IAEjB,MAAM,EAAE,QAAQ,EAAE,GAAG,WAAW,CAAC;IACjC,MAAM,IAAI,GAAG,gBAAgB,CAAC,CAAC,EAAE,QAAQ,CAAC,CAAC;IAC3C,MAAM,IAAI,GAAG,MAAM,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC;IAC/B,MAAM,OAAO,GAAG,WAAW,CAAC,QAAQ,CAAC,CAAC;IACtC,MAAM,OAAO,GAAG,cAAc,CAAC,QAAQ,CAAC,CAAC;IAEzC,IAAI,OAAO,CAAC,OAAO,KAAK,WAAW,EAAE,CAAC;QACpC,MAAM,QAAQ,GAAG,CAAC,QAAQ,IAAI,CAAC,WAAW,CAAC,OAAO,CAAC;QACnD,MAAM,KAAK,GAAG,CAAC,IAAI,EAAE,CAAC,CAAC,QAAQ,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QAC7C,IAAI,QAAQ;YAAE,KAAK,CAAC,OAAO,CAAC,cAAc,CAAC,CAAC,CAAC,CAAC,CAAC;QAC/C,MAAM,IAAI,GAAG,OAAO,KAAK,IAAI,CAAC,CAAC,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC;QAC/D,OAAO,EAAE,QAAQ,EAAE,CAAC,CAAC,QAAQ,CAAC,KAAK,CAAC,EAAE,IAAI,EAAE,QAAQ,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC;IAC/E,CAAC;IAED,IAAI,OAAO,CAAC,OAAO,KAAK,SAAS,IAAI,CAAC,MAAM,IAAI,CAAC,WAAW,CAAC,OAAO,EAAE,CAAC;QACrE,OAAO,EAAE,QAAQ,EAAE,CAAC,CAAC,QAAQ,CAAC,CAAC,cAAc,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,EAAE,IAAI,EAAE,EAAE,EAAE,CAAC;IACvE,CAAC;IAED,MAAM,KAAK,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,SAAS,CAAC,EAAE,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;IAC1D,IAAI,OAAO,CAAC,OAAO,KAAK,MAAM,IAAI,OAAO,KAAK,IAAI,EAAE,CAAC;QACnD,MAAM,OAAO,GAAG,OAAO,OAAO,CAAC,OAAO,KAAK,UAAU,CAAC,CAAC,CAAC,OAAO,CAAC,OAAO,CAAC,IAAI,GAAG,OAAO,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,OAAO,IAAI,QAAQ,CAAC;QACtH,IAAI,OAAO,KAAK,WAAW,EAAE,CAAC;YAC5B,KAAK,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC;YACvB,OAAO,EAAE,QAAQ,EAAE,CAAC,CAAC,QAAQ,CAAC,KAAK,CAAC,EAAE,IAAI,EAAE,IAAI,GAAG,OAAO,EAAE,CAAC;QAC/D,CAAC;QACD,IAAI,OAAO,KAAK,QAAQ;YAAE,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,QAAQ,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IAC/D,CAAC;IACD,wEAAwE;IACxE,MAAM,IAAI,GAAG,OAAO,KAAK,IAAI,CAAC,CAAC,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC;IAC/D,OAAO,EAAE,QAAQ,EAAE,CAAC,CAAC,QAAQ,CAAC,KAAK,CAAC,EAAE,IAAI,EAAE,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC;AACtE,CAAC;AAED,SAAS,cAAc,CAAC,QAA4B;IAClD,MAAM,GAAG,GAAa,EAAE,CAAC;IACzB,KAAK,MAAM,OAAO,IAAI,QAAQ,EAAE,CAAC;QAC/B,MAAM,IAAI,GAAG,WAAW,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC;QACpC,IAAI,IAAI,KAAK,IAAI;YAAE,MAAM;QACzB,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IACjB,CAAC;IACD,OAAO,GAAG,CAAC;AACb,CAAC;AAED,gFAAgF;AAEhF,SAAS,gBAAgB,CAAC,KAAsB;IAC9C,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;QACzB,IAAI,CAAC,IAAI,CAAC,aAAa;YAAE,MAAM,IAAI,KAAK,CAAC,IAAI,IAAI,CAAC,MAAM,sDAAsD,CAAC,CAAC;IAClH,CAAC;AACH,CAAC;AAED;;;;GAIG;AACH,MAAM,UAAU,WAAW,CACzB,OAAwB,EACxB,OAAO,GAAoB,EAAE,EAC7B,MAAM,GAAW,cAAc;IAE/B,gBAAgB,CAAC,CAAC,GAAG,OAAO,EAAE,GAAG,OAAO,CAAC,CAAC,CAAC;IAC3C,OAAO,WAAW,CAChB,OAAO,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,CAAC,SAAS,CAAC,EACrC,OAAO,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,CAAC,SAAS,CAAC,EACrC,MAAM,CACP,CAAC;AACJ,CAAC;AAED;;;GAGG;AACH,MAAM,UAAU,UAAU,CACxB,KAAsB,EACtB,KAAW,EACX,MAAM,GAAW,cAAc;IAE/B,MAAM,OAAO,GAAG,WAAW,CAAC,CAAC,KAAK,CAAC,EAAE,KAAK,EAAE,MAAM,CAAC,CAAC;IACpD,OAAO,OAAO,CAAC,IAAI,KAAK,WAAW,CAAC,CAAC,CAAC,WAAW,CAAC,CAAC,CAAC,OAAO,CAAC,IAAI,KAAK,MAAM,CAAC;AAC9E,CAAC;AAYD;;;GAGG;AACH,MAAM,UAAU,aAAa,CAAC,QAA2B,EAAE,OAAoB;IAC7E,MAAM,OAAO,GAAuC,EAAE,CAAC;IACvD,KAAK,MAAM,OAAO,IAAI,QAAQ,EAAE,CAAC;QAC/B,MAAM,OAAO,GAAG,OAAO,CAAC,IAAI,EAAE,CAAC;QAC/B,MAAM,OAAO,GAAG,OAAO,CAAC,UAAU,CAAC,GAAG,CAAC,CAAC;QACxC,MAAM,MAAM,GAAG,SAAS,CAAC,OAAO,CAAC,CAAC,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,OAAO,EAAE,OAAO,CAAC,CAAC;QACxE,IAAI,CAAC,MAAM,CAAC,EAAE;YAAE,OAAO,EAAE,EAAE,EAAE,KAAK,EAAE,KAAK,EAAE,IAAI,OAAO,MAAM,MAAM,CAAC,KAAK,EAAE,EAAE,CAAC;QAC7E,OAAO,CAAC,IAAI,CAAC,EAAE,OAAO,EAAE,IAAI,EAAE,MAAM,CAAC,IAAI,EAAE,CAAC,CAAC;IAC/C,CAAC;IACD,OAAO;QACL,EAAE,EAAE,IAAI;QACR,IAAI,EAAE;YACJ,OAAO;YACP,KAAK,CAAC,IAAY;gBAChB,IAAI,QAAQ,GAAG,KAAK,CAAC;gBACrB,KAAK,MAAM,KAAK,IAAI,OAAO;oBAAE,IAAI,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC;wBAAE,QAAQ,GAAG,CAAC,KAAK,CAAC,OAAO,CAAC;gBACnF,OAAO,QAAQ,CAAC;YAClB,CAAC;SACF;KACF,CAAC;AACJ,CAAC","sourcesContent":["/**\n * Globs, in the three dialects the spec-* tools speak, compiled to one kind of\n * automaton.\n *\n * The syntax is the part people type: `*`, `**`, `?`, `[abc]`, `[!a-z]`,\n * `{a,b}`, and `\\` to escape. What differs between the tools is not the\n * syntax but what a pattern is matched against, and those differences are\n * deliberate, so each has a name (docs/adr/0003-glob-dialects.md):\n *\n * - `path` - the whole repository-relative path, anchored at the root. A\n *   pattern with no glob syntax names a file, a directory, or either, as the\n *   caller says; `src/auth` may cover `src/auth/login.ts`.\n * - `ripgrep` - as ripgrep's `-g`: a pattern with no `/` is matched against\n *   the last segment at any depth, so `*.ts` matches `src/deep/a.ts`; one with\n *   a `/` is matched against the whole path.\n * - `gitignore` - as an exclusion list reads: a pattern matches a path or any\n *   directory above it, so `tests` excludes everything under any `tests`; one\n *   with a `/` other than a trailing one is anchored at the root, and a\n *   leading `/` only anchors.\n *\n * Shared by all three:\n *\n * - `**` is a globstar only as a whole segment. `a/**\\/b` matches `a/b` and\n *   `a/x/y/b`; a trailing `/**` matches everything inside a directory and not\n *   the directory itself. Two stars inside a name, `**.md`, are refused: the\n *   tools read it three ways, and the quiet reading narrowed their scope.\n * - `*`, `?` and classes never match `/`, and `*` matches a leading dot.\n * - Case is the caller's decision, stated every time. A result must not\n *   depend on the host it ran on.\n * - A malformed pattern is an error, never a literal. An unclosed `[` or `{`,\n *   an extended glob, a `..` - each is refused with a reason, because a typo\n *   read as a literal is a scope that silently matches nothing. An extended\n *   glob is a group holding a `|`, `+(a|b)`: without one, `C++(notes).md` is\n *   a name with parentheses in it, as ripgrep and `.gitignore` read it.\n */\n\nimport {\n  Builder,\n  findWitness,\n  Matcher,\n  WITNESS_BUDGET,\n  type Automaton,\n  type Fragment,\n  type Witness,\n} from './automaton.js';\nimport { ANY, classSet, literalSet, SEPARATOR, type CodeRange } from './charset.js';\n\nexport type GlobDialect = 'path' | 'ripgrep' | 'gitignore';\n\n/** How a `path` pattern with no glob syntax is read. */\nexport type LiteralReading = 'file' | 'directory' | 'either';\n\nexport interface GlobOptions {\n  readonly dialect: GlobDialect;\n  /** Whether `A` and `a` differ. No default: the caller decides, every time. */\n  readonly caseSensitive: boolean;\n  /**\n   * `path` dialect only: how a pattern with no glob syntax is read - as a\n   * file, as a directory and everything beneath it, or as either. A function\n   * is asked per literal path, for a caller that knows the tree. `either` when\n   * unset. A trailing `/` always means a directory.\n   */\n  readonly literal?: LiteralReading | ((path: string) => LiteralReading) | undefined;\n  /**\n   * `escape` (the default): `\\` escapes the next character, and a `\\` before a\n   * letter or digit is refused as a Windows separator typed by mistake.\n   * `separator`: every `\\` is a `/`, for patterns typed on a Windows shell.\n   */\n  readonly backslash?: 'escape' | 'separator' | undefined;\n}\n\nexport interface Glob {\n  readonly source: string;\n  readonly dialect: GlobDialect;\n  readonly caseSensitive: boolean;\n  /**\n   * The directories a walk must enter to find every match: one per\n   * alternative, the leading literal segments. `''` for an alternative that\n   * can match at any depth.\n   */\n  readonly bases: readonly string[];\n  readonly automaton: Automaton;\n  /** Whether a canonical path - POSIX, no `.`, no empty or trailing segment - matches. */\n  match(path: string): boolean;\n}\n\nexport type GlobParse = { readonly ok: true; readonly glob: Glob } | { readonly ok: false; readonly error: string };\n\nexport class GlobError extends Error {\n  readonly source: string;\n  constructor(source: string, reason: string) {\n    super(`invalid glob \"${source}\": ${reason}`);\n    this.name = 'GlobError';\n    this.source = source;\n  }\n}\n\n/** More alternatives than this is a pattern nobody meant. */\nexport const MAX_ALTERNATIVES = 256;\n\ntype Token =\n  | { readonly kind: 'literal'; readonly point: number }\n  | { readonly kind: 'any' }\n  | { readonly kind: 'star' }\n  | { readonly kind: 'class'; readonly negated: boolean; readonly ranges: readonly CodeRange[] };\n\ntype Segment = { readonly kind: 'globstar' } | { readonly kind: 'name'; readonly tokens: readonly Token[] };\n\ninterface Alternative {\n  readonly segments: readonly Segment[];\n  /** Written with a `/` somewhere other than at its end. */\n  readonly slashed: boolean;\n}\n\n/** Whether a string uses glob syntax at all. */\nexport function isGlobSyntax(source: string): boolean {\n  return /[*?[\\]{}]/.test(source);\n}\n\n/** Parses and compiles a glob, or says why it cannot. */\nexport function parseGlob(source: string, options: GlobOptions): GlobParse {\n  const result = build(source, options);\n  return typeof result === 'string' ? { ok: false, error: result } : { ok: true, glob: result };\n}\n\n/** Parses and compiles a glob, throwing {@link GlobError} when it cannot. */\nexport function compileGlob(source: string, options: GlobOptions): Glob {\n  const result = build(source, options);\n  if (typeof result === 'string') throw new GlobError(source, result);\n  return result;\n}\n\nfunction build(source: string, options: GlobOptions): Glob | string {\n  const escapes = options.backslash !== 'separator';\n  let pattern = source.trim();\n  if (!escapes) pattern = pattern.replace(/\\\\/g, '/');\n  if (pattern.length === 0) return 'the pattern is empty';\n  if (pattern.startsWith('!')) return 'a negated pattern is a list entry, not a glob; narrow the positive pattern';\n  if (/(?:^|[^\\\\])[?*+@!]\\([^)]*\\|/.test(pattern)) return EXTGLOB;\n  while (pattern.startsWith('./')) pattern = pattern.slice(2);\n\n  // A leading slash roots a pattern at the filesystem's root in the path and\n  // ripgrep dialects, and only anchors it at the repository root in gitignore.\n  let rooted = false;\n  let anchored = false;\n  if (pattern.startsWith('/')) {\n    if (options.dialect === 'gitignore') anchored = true;\n    else rooted = true;\n    pattern = pattern.replace(/^\\/+/, '');\n  }\n  // A trailing slash means a directory's contents, except in an exclusion,\n  // where `build/` and `build` exclude the same things.\n  if (pattern.endsWith('/')) {\n    pattern = pattern.replace(/\\/+$/, '');\n    if (options.dialect !== 'gitignore') pattern = `${pattern}/**`;\n  }\n  if (pattern.length === 0) return 'the pattern names the root itself, not a path under it';\n\n  const expanded = expandBraces(pattern, escapes);\n  if (typeof expanded === 'string') return expanded;\n\n  const alternatives: Alternative[] = [];\n  for (const text of expanded) {\n    const parsed = parseAlternative(text, escapes);\n    if (typeof parsed === 'string') return parsed;\n    alternatives.push(parsed);\n  }\n\n  const builder = new Builder();\n  const fragments: Fragment[] = [];\n  const bases: string[] = [];\n  for (const alternative of alternatives) {\n    const compiled = compileAlternative(builder, alternative, options, rooted, anchored);\n    fragments.push(compiled.fragment);\n    bases.push(compiled.base);\n  }\n  const automaton = builder.finish(builder.either(fragments), options.caseSensitive);\n  let matcher: Matcher | null = null;\n  return {\n    source,\n    dialect: options.dialect,\n    caseSensitive: options.caseSensitive,\n    bases: [...new Set(bases)],\n    automaton,\n    match(path: string): boolean {\n      matcher ??= new Matcher(automaton);\n      return matcher.test(path);\n    },\n  };\n}\n\n/* ------------------------------------------------------------------ braces */\n\n/**\n * Expands `{a,b}` groups into the patterns they stand for, or says why the\n * pattern is malformed.\n *\n * Classes and escapes are skipped while looking for braces and commas, so\n * `{[,]x,y}` is two alternatives, `[,]x` and `y`. A lone `}` is a literal: it\n * cannot be read as anything else. An unclosed `{` is an error.\n */\nfunction expandBraces(pattern: string, escapes: boolean): string[] | string {\n  let depth = 0;\n  let open = -1;\n  for (let i = 0; i < pattern.length; i += 1) {\n    const ch = pattern.charAt(i);\n    if (ch === '\\\\' && escapes) {\n      i += 1;\n      continue;\n    }\n    if (ch === '[') {\n      const close = classEnd(pattern, i, escapes);\n      if (close > 0) i = close;\n      continue;\n    }\n    if (ch === '{') {\n      if (depth === 0) open = i;\n      depth += 1;\n      continue;\n    }\n    if (ch !== '}' || depth === 0) continue;\n    depth -= 1;\n    if (depth > 0) continue;\n    const prefix = pattern.slice(0, open);\n    const suffix = pattern.slice(i + 1);\n    const results: string[] = [];\n    for (const option of splitOptions(pattern.slice(open + 1, i), escapes)) {\n      const expanded = expandBraces(`${prefix}${option}${suffix}`, escapes);\n      if (typeof expanded === 'string') return expanded;\n      results.push(...expanded);\n      if (results.length > MAX_ALTERNATIVES) return `the braces expand to more than ${MAX_ALTERNATIVES} patterns`;\n    }\n    return results;\n  }\n  if (depth > 0) return 'a \"{\" is never closed';\n  return [pattern];\n}\n\n/** Splits a brace body on its top-level commas. */\nfunction splitOptions(body: string, escapes: boolean): string[] {\n  const parts: string[] = [];\n  let depth = 0;\n  let start = 0;\n  for (let i = 0; i < body.length; i += 1) {\n    const ch = body.charAt(i);\n    if (ch === '\\\\' && escapes) {\n      i += 1;\n    } else if (ch === '[') {\n      const close = classEnd(body, i, escapes);\n      if (close > 0) i = close;\n    } else if (ch === '{') {\n      depth += 1;\n    } else if (ch === '}') {\n      depth -= 1;\n    } else if (ch === ',' && depth === 0) {\n      parts.push(body.slice(start, i));\n      start = i + 1;\n    }\n  }\n  parts.push(body.slice(start));\n  return parts;\n}\n\n/** The index of the `]` closing a class opened at `open`, or -1 when none does within the segment. */\nfunction classEnd(pattern: string, open: number, escapes: boolean): number {\n  let i = open + 1;\n  if (pattern.charAt(i) === '!' || pattern.charAt(i) === '^') i += 1;\n  // The first member is always a member, even `]`.\n  if (pattern.charAt(i) === ']') i += 1;\n  for (; i < pattern.length; i += 1) {\n    const ch = pattern.charAt(i);\n    if (ch === '\\\\' && escapes) {\n      i += 1;\n      continue;\n    }\n    if (ch === '/') return -1;\n    if (ch === ']') return i;\n  }\n  return -1;\n}\n\n/* ---------------------------------------------------------------- segments */\n\nfunction parseAlternative(text: string, escapes: boolean): Alternative | string {\n  const segments: Segment[] = [];\n  const raw = text.split('/');\n  for (const part of raw) {\n    if (part === '' || part === '.') continue;\n    if (part === '..') return 'a pattern cannot climb out of its root with \"..\"';\n    if (part === '**') {\n      if (segments[segments.length - 1]?.kind !== 'globstar') segments.push({ kind: 'globstar' });\n      continue;\n    }\n    const tokens = tokenize(part, escapes);\n    if (typeof tokens === 'string') return tokens;\n    segments.push({ kind: 'name', tokens });\n  }\n  if (segments.length === 0) return 'the pattern names no path';\n  return { segments, slashed: raw.filter((part) => part !== '' && part !== '.').length > 1 };\n}\n\nconst EXTGLOB = 'extended globs such as \"+(a|b)\" are not supported: write alternatives as \"{a,b}\", and a literal parenthesis as \"[(]\"';\nconst GLOBSTAR_IN_NAME = '\"**\" means any number of directories only as a whole segment: write \"docs/**/*.md\" for any depth, or \"*.md\" for one level';\n\nfunction tokenize(segment: string, escapes: boolean): Token[] | string {\n  const tokens: Token[] = [];\n  const chars = Array.from(segment);\n  for (let i = 0; i < chars.length; i += 1) {\n    const ch = chars[i] as string;\n    if (ch === '\\\\' && escapes) {\n      const next = chars[i + 1];\n      if (next === undefined || /[A-Za-z0-9]/.test(next)) {\n        return '\"\\\\\" escapes glob syntax; separate directories with \"/\"';\n      }\n      tokens.push({ kind: 'literal', point: next.codePointAt(0) as number });\n      i += 1;\n    } else if (ch === '*') {\n      // Two stars inside a name are refused rather than read as one. The\n      // tools this replaces read `docs/**.md` three ways - recursive, one\n      // level, and as ripgrep does - and reading it as one level silently\n      // dropped every nested document from a run that used to include them.\n      if (chars[i + 1] === '*') return GLOBSTAR_IN_NAME;\n      tokens.push({ kind: 'star' });\n    } else if (ch === '?') {\n      tokens.push({ kind: 'any' });\n    } else if (ch === '[') {\n      const parsed = readClass(chars, i, escapes);\n      if (typeof parsed === 'string') return parsed;\n      tokens.push(parsed.token);\n      i = parsed.end;\n    } else {\n      tokens.push({ kind: 'literal', point: ch.codePointAt(0) as number });\n    }\n  }\n  return tokens;\n}\n\nfunction readClass(chars: readonly string[], open: number, escapes: boolean): { token: Token; end: number } | string {\n  let i = open + 1;\n  let negated = false;\n  if (chars[i] === '!' || chars[i] === '^') {\n    negated = true;\n    i += 1;\n  }\n  const ranges: CodeRange[] = [];\n  let first = true;\n  for (; i < chars.length; i += 1) {\n    const ch = chars[i] as string;\n    if (ch === ']' && !first) return { token: { kind: 'class', negated, ranges }, end: i };\n    first = false;\n    let low = ch;\n    if (ch === '\\\\' && escapes && chars[i + 1] !== undefined) {\n      i += 1;\n      low = chars[i] as string;\n    }\n    let high = low;\n    if (chars[i + 1] === '-' && chars[i + 2] !== undefined && chars[i + 2] !== ']') {\n      i += 2;\n      high = chars[i] as string;\n      if (high === '\\\\' && escapes && chars[i + 1] !== undefined) {\n        i += 1;\n        high = chars[i] as string;\n      }\n    }\n    const from = low.codePointAt(0) as number;\n    const to = high.codePointAt(0) as number;\n    if (to < from) return `the range \"${low}-${high}\" runs backwards`;\n    ranges.push([from, to]);\n  }\n  return 'a \"[\" is never closed';\n}\n\n/* --------------------------------------------------------------- compiling */\n\nfunction literalText(segments: readonly Segment[]): string | null {\n  const names: string[] = [];\n  for (const segment of segments) {\n    if (segment.kind !== 'name') return null;\n    let name = '';\n    for (const token of segment.tokens) {\n      if (token.kind !== 'literal') return null;\n      name += String.fromCodePoint(token.point);\n    }\n    names.push(name);\n  }\n  return names.join('/');\n}\n\n/** One segment name: at least one character, none of them `/`. */\nfunction name(b: Builder): Fragment {\n  return b.plus(b.char(ANY));\n}\n\n/** Zero or more whole directories: `(name/)*`. */\nfunction anyDirectories(b: Builder): Fragment {\n  return b.star(b.sequence([name(b), b.char(SEPARATOR)]));\n}\n\n/** One or more whole segments below a path: `/name(/name)*`. */\nfunction beneath(b: Builder): Fragment {\n  return b.sequence([b.char(SEPARATOR), name(b), b.star(b.sequence([b.char(SEPARATOR), name(b)]))]);\n}\n\nfunction tokens(b: Builder, list: readonly Token[]): Fragment {\n  return b.sequence(\n    list.map((token) => {\n      switch (token.kind) {\n        case 'literal':\n          return b.char(literalSet(token.point));\n        case 'any':\n          return b.char(ANY);\n        case 'star':\n          return b.star(b.char(ANY));\n        case 'class':\n          return b.char(classSet(token.ranges, token.negated));\n      }\n    }),\n  );\n}\n\nfunction segmentsFragment(b: Builder, segments: readonly Segment[]): Fragment {\n  const parts: Fragment[] = [];\n  segments.forEach((segment, i) => {\n    const last = i === segments.length - 1;\n    if (segment.kind === 'globstar') {\n      // Inside a path a globstar is any number of whole directories, the\n      // separator after them included; at its end, at least one segment.\n      parts.push(last ? b.sequence([name(b), b.star(b.sequence([b.char(SEPARATOR), name(b)]))]) : anyDirectories(b));\n      return;\n    }\n    parts.push(tokens(b, segment.tokens));\n    if (!last) parts.push(b.char(SEPARATOR));\n  });\n  return b.sequence(parts);\n}\n\nfunction compileAlternative(\n  b: Builder,\n  alternative: Alternative,\n  options: GlobOptions,\n  rooted: boolean,\n  anchored: boolean,\n): { fragment: Fragment; base: string } {\n  const { segments } = alternative;\n  const body = segmentsFragment(b, segments);\n  const root = rooted ? '/' : '';\n  const literal = literalText(segments);\n  const leading = leadingLiteral(segments);\n\n  if (options.dialect === 'gitignore') {\n    const floating = !anchored && !alternative.slashed;\n    const parts = [body, b.optional(beneath(b))];\n    if (floating) parts.unshift(anyDirectories(b));\n    const base = literal !== null ? leading.slice(0, -1) : leading;\n    return { fragment: b.sequence(parts), base: floating ? '' : base.join('/') };\n  }\n\n  if (options.dialect === 'ripgrep' && !rooted && !alternative.slashed) {\n    return { fragment: b.sequence([anyDirectories(b), body]), base: '' };\n  }\n\n  const parts = rooted ? [b.char(SEPARATOR), body] : [body];\n  if (options.dialect === 'path' && literal !== null) {\n    const reading = typeof options.literal === 'function' ? options.literal(root + literal) : options.literal ?? 'either';\n    if (reading === 'directory') {\n      parts.push(beneath(b));\n      return { fragment: b.sequence(parts), base: root + literal };\n    }\n    if (reading === 'either') parts.push(b.optional(beneath(b)));\n  }\n  // A literal path may be a file, whose base is the directory holding it.\n  const base = literal !== null ? leading.slice(0, -1) : leading;\n  return { fragment: b.sequence(parts), base: root + base.join('/') };\n}\n\nfunction leadingLiteral(segments: readonly Segment[]): string[] {\n  const out: string[] = [];\n  for (const segment of segments) {\n    const text = literalText([segment]);\n    if (text === null) break;\n    out.push(text);\n  }\n  return out;\n}\n\n/* ---------------------------------------------------------------- questions */\n\nfunction assertComparable(globs: readonly Glob[]): void {\n  for (const glob of globs) {\n    if (!glob.caseSensitive) throw new Error(`\"${glob.source}\" ignores case; scopes are compared case-sensitively`);\n  }\n}\n\n/**\n * A shortest path every glob in `include` matches and no glob in `exclude`\n * does: the file two scopes would both write, less what either protects.\n * `none` is a proof that there is no such path. Case-sensitive globs only.\n */\nexport function globWitness(\n  include: readonly Glob[],\n  exclude: readonly Glob[] = [],\n  budget: number = WITNESS_BUDGET,\n): Witness {\n  assertComparable([...include, ...exclude]);\n  return findWitness(\n    include.map((glob) => glob.automaton),\n    exclude.map((glob) => glob.automaton),\n    budget,\n  );\n}\n\n/**\n * Whether every path `inner` matches is matched by one of `outer`: `true`,\n * `false`, or `undecided` when the search met its budget.\n */\nexport function globCovers(\n  outer: readonly Glob[],\n  inner: Glob,\n  budget: number = WITNESS_BUDGET,\n): boolean | 'undecided' {\n  const witness = globWitness([inner], outer, budget);\n  return witness.kind === 'undecided' ? 'undecided' : witness.kind === 'none';\n}\n\n/* -------------------------------------------------------------------- lists */\n\nexport interface GlobList {\n  /** Whether a path is in: the last entry that matches it decides, and a `!` entry takes it out. */\n  match(path: string): boolean;\n  readonly entries: readonly { readonly negated: boolean; readonly glob: Glob }[];\n}\n\nexport type GlobListParse = { readonly ok: true; readonly list: GlobList } | { readonly ok: false; readonly error: string };\n\n/**\n * A list of patterns read the way a `.gitignore` reads: in order, each entry\n * deciding the paths it matches, a leading `!` taking them back out.\n */\nexport function parseGlobList(patterns: readonly string[], options: GlobOptions): GlobListParse {\n  const entries: { negated: boolean; glob: Glob }[] = [];\n  for (const pattern of patterns) {\n    const trimmed = pattern.trim();\n    const negated = trimmed.startsWith('!');\n    const parsed = parseGlob(negated ? trimmed.slice(1) : trimmed, options);\n    if (!parsed.ok) return { ok: false, error: `\"${pattern}\": ${parsed.error}` };\n    entries.push({ negated, glob: parsed.glob });\n  }\n  return {\n    ok: true,\n    list: {\n      entries,\n      match(path: string): boolean {\n        let included = false;\n        for (const entry of entries) if (entry.glob.match(path)) included = !entry.negated;\n        return included;\n      },\n    },\n  };\n}\n"]}

package/dist/vendor/spec-core/pattern/index.d.ts

@@ -0,0 +1,6 @@
+export { compileGlob, globCovers, globWitness, isGlobSyntax, parseGlob, parseGlobList, GlobError, MAX_ALTERNATIVES } from './glob.js';
+export type { Glob, GlobDialect, GlobList, GlobListParse, GlobOptions, GlobParse, LiteralReading } from './glob.js';
+export { AutomatonTooLarge, MAX_STATES, WITNESS_BUDGET } from './automaton.js';
+export type { Witness } from './automaton.js';
+export { compileRegex, RegexError } from './regex.js';
+export type { RegexMatcher, RegexOptions } from './regex.js';

package/dist/vendor/spec-core/pattern/index.js

@@ -0,0 +1,4 @@
+export { compileGlob, globCovers, globWitness, isGlobSyntax, parseGlob, parseGlobList, GlobError, MAX_ALTERNATIVES } from './glob.js';
+export { AutomatonTooLarge, MAX_STATES, WITNESS_BUDGET } from './automaton.js';
+export { compileRegex, RegexError } from './regex.js';
+//# sourceMappingURL=index.js.map

package/dist/vendor/spec-core/pattern/index.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.js","sourceRoot":"","sources":["../../../../src/vendor/spec-core/pattern/index.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,WAAW,EAAE,UAAU,EAAE,WAAW,EAAE,YAAY,EAAE,SAAS,EAAE,aAAa,EAAE,SAAS,EAAE,gBAAgB,EAAE,MAAM,WAAW,CAAC;AAEtI,OAAO,EAAE,iBAAiB,EAAE,UAAU,EAAE,cAAc,EAAE,MAAM,gBAAgB,CAAC;AAE/E,OAAO,EAAE,YAAY,EAAE,UAAU,EAAE,MAAM,YAAY,CAAC","sourcesContent":["export { compileGlob, globCovers, globWitness, isGlobSyntax, parseGlob, parseGlobList, GlobError, MAX_ALTERNATIVES } from './glob.js';\nexport type { Glob, GlobDialect, GlobList, GlobListParse, GlobOptions, GlobParse, LiteralReading } from './glob.js';\nexport { AutomatonTooLarge, MAX_STATES, WITNESS_BUDGET } from './automaton.js';\nexport type { Witness } from './automaton.js';\nexport { compileRegex, RegexError } from './regex.js';\nexport type { RegexMatcher, RegexOptions } from './regex.js';\n"]}

package/dist/{regex.d.ts → vendor/spec-core/pattern/regex.d.ts}

@@ -1,10 +1,10 @@
 /**
  * A regular-expression matcher that cannot backtrack.
  *
- * `~=` is the one predicate in the selector language that used to hand a
- * user-supplied string to `RegExp` and wait. That is tolerable at a prompt,
- * where a human can press Ctrl-C. It is not tolerable in `.spec-graph.json`,
- * where the same string runs unattended in CI against every node in the corpus.
+ * Written for spec-graph, whose `~=` selector used to hand a user-supplied
+ * string to `RegExp` and wait (spec-graph ADR-0017), and moved here so that
+ * every tool that accepts a pattern from configuration or from a document can
+ * run it unattended in CI without a pattern deciding how long CI takes.
  *
  * The cost is neither theoretical nor exotic. `^([A-Za-z0-9_]+[ ]?)+$` is what
  * somebody writes to say "the title is words separated by single spaces", and
@@ -18,34 +18,25 @@
  * the quick brown fox jumps over the lazy dog and keeps!     103s      13us
  * ```
  *
- * Each word of k letters can be cut into pieces 2^(k-1) ways, and the engine
- * tries the product of those, which is why adding one five-letter word costs
- * another factor of sixteen. A sixty-character title does not finish this year.
- *
- * So a pattern here is compiled to a **non-deterministic finite automaton** and
+ * So a pattern here is compiled to a non-deterministic finite automaton and
  * simulated over the subject one character at a time (Thompson, 1968), keeping
  * a set of live states instead of a stack of choices. Each state is visited at
- * most once per position, which makes the work exactly O(pattern x subject):
- * the right-hand column above, growing with the subject and not with the
- * pattern's ambiguity.
+ * most once per position, which makes the work O(pattern x subject), growing
+ * with the subject and not with the pattern's ambiguity.
  *
  * What it costs is a dialect. Backreferences and lookaround are not regular and
- * have no place in a linear automaton, so they are **rejected while compiling**,
- * with a message and an offset, rather than accepted and then slow. That is the
- * whole trade: a predicate that finishes, against a short list of constructs
- * that a documentation selector never needed.
- *
- * Matching is unanchored and, by default, case-insensitive, because that is
- * what `~=` has always been - `new RegExp(source, 'i')` and `.test()`. Globs
- * compile to this as well, and a path on a case-sensitive filesystem needs the
- * case respected, which is the one option. There are no capture groups at all:
- * nothing asks where the match was, only whether there was one, which is why
- * this is a plain NFA simulation rather than a Pike VM.
+ * have no place in a linear automaton, so they are rejected while compiling,
+ * with a message and an offset, rather than accepted and then slow.
  *
- * See ADR-0017.
+ * The dialect is JavaScript's without the `u` flag, character for character,
+ * and is held to that by a differential test against `RegExp`: code units,
+ * not code points, and `i` folding by the specification's `Canonicalize`.
+ * Matching is unanchored and, unless `ignoreCase: false` is passed,
+ * case-insensitive, which is what spec-graph's `~=` has always been. There
+ * are no captures: nothing asks where a match was, only whether there was one.
  */
 /** A pattern that will not compile, and where in it the problem starts. */
-export declare class PatternError extends Error {
+export declare class RegexError extends Error {
     /** Offset into the pattern source. */
     readonly offset: number;
     constructor(message: string, offset: number);
@@ -57,20 +48,20 @@ export declare class PatternError extends Error {
  * out to nothing, and the buffers it keeps between subjects are what make it
  * cheap enough to run against every path a walk visits.
  */
-export interface Matcher {
+export interface RegexMatcher {
     /** True when the pattern matches anywhere in the subject. */
     test(subject: string): boolean;
     /** State count. Published for the size test, and for nothing else. */
     readonly size: number;
 }
-export interface PatternOptions {
+export interface RegexOptions {
     /** Fold case the way the `i` flag does. On unless set to `false`. */
     readonly ignoreCase?: boolean | undefined;
 }
 /**
  * Compiles a pattern into a matcher.
  *
- * Throws {@link PatternError} on anything it cannot run in linear time, which
+ * Throws {@link RegexError} on anything it cannot run in linear time, which
  * is the point: the alternative to a message here is a build that stops.
  */
-export declare function compilePattern(source: string, options?: PatternOptions): Matcher;
+export declare function compileRegex(source: string, options?: RegexOptions): RegexMatcher;

package/dist/{regex.js → vendor/spec-core/pattern/regex.js}

@@ -1,10 +1,10 @@
 /**
  * A regular-expression matcher that cannot backtrack.
  *
- * `~=` is the one predicate in the selector language that used to hand a
- * user-supplied string to `RegExp` and wait. That is tolerable at a prompt,
- * where a human can press Ctrl-C. It is not tolerable in `.spec-graph.json`,
- * where the same string runs unattended in CI against every node in the corpus.
+ * Written for spec-graph, whose `~=` selector used to hand a user-supplied
+ * string to `RegExp` and wait (spec-graph ADR-0017), and moved here so that
+ * every tool that accepts a pattern from configuration or from a document can
+ * run it unattended in CI without a pattern deciding how long CI takes.
  *
  * The cost is neither theoretical nor exotic. `^([A-Za-z0-9_]+[ ]?)+$` is what
  * somebody writes to say "the title is words separated by single spaces", and
@@ -18,42 +18,33 @@
  * the quick brown fox jumps over the lazy dog and keeps!     103s      13us
  * ```
  *
- * Each word of k letters can be cut into pieces 2^(k-1) ways, and the engine
- * tries the product of those, which is why adding one five-letter word costs
- * another factor of sixteen. A sixty-character title does not finish this year.
- *
- * So a pattern here is compiled to a **non-deterministic finite automaton** and
+ * So a pattern here is compiled to a non-deterministic finite automaton and
  * simulated over the subject one character at a time (Thompson, 1968), keeping
  * a set of live states instead of a stack of choices. Each state is visited at
- * most once per position, which makes the work exactly O(pattern x subject):
- * the right-hand column above, growing with the subject and not with the
- * pattern's ambiguity.
+ * most once per position, which makes the work O(pattern x subject), growing
+ * with the subject and not with the pattern's ambiguity.
  *
  * What it costs is a dialect. Backreferences and lookaround are not regular and
- * have no place in a linear automaton, so they are **rejected while compiling**,
- * with a message and an offset, rather than accepted and then slow. That is the
- * whole trade: a predicate that finishes, against a short list of constructs
- * that a documentation selector never needed.
- *
- * Matching is unanchored and, by default, case-insensitive, because that is
- * what `~=` has always been - `new RegExp(source, 'i')` and `.test()`. Globs
- * compile to this as well, and a path on a case-sensitive filesystem needs the
- * case respected, which is the one option. There are no capture groups at all:
- * nothing asks where the match was, only whether there was one, which is why
- * this is a plain NFA simulation rather than a Pike VM.
+ * have no place in a linear automaton, so they are rejected while compiling,
+ * with a message and an offset, rather than accepted and then slow.
  *
- * See ADR-0017.
+ * The dialect is JavaScript's without the `u` flag, character for character,
+ * and is held to that by a differential test against `RegExp`: code units,
+ * not code points, and `i` folding by the specification's `Canonicalize`.
+ * Matching is unanchored and, unless `ignoreCase: false` is passed,
+ * case-insensitive, which is what spec-graph's `~=` has always been. There
+ * are no captures: nothing asks where a match was, only whether there was one.
  */
 /* -------------------------------------------------------------------------- */
 /* Errors                                                                     */
 /* -------------------------------------------------------------------------- */
 /** A pattern that will not compile, and where in it the problem starts. */
-export class PatternError extends Error {
+export class RegexError extends Error {
     /** Offset into the pattern source. */
     offset;
     constructor(message, offset) {
         super(message);
-        this.name = 'PatternError';
+        this.name = 'RegexError';
         this.offset = offset;
     }
 }
@@ -195,7 +186,7 @@ function within(ranges, code) {
  *
  * Written down because the first version of this function widened the set, and
  * the differential test against `RegExp` is what said otherwise. Reading the
- * clause was not enough; running it was. See ADR-0017.
+ * clause was not enough; running it was. See spec-graph ADR-0017.
  */
 function isWordChar(code) {
     return within(WORD, code);
@@ -214,7 +205,7 @@ class PatternParser {
         // Every character is an atom except the two that close something, and
         // `parseSequence` stops on both, so anything left over is an unopened `)`.
         if (this.position < this.source.length)
-            throw new PatternError('unmatched ")"', this.position);
+            throw new RegexError('unmatched ")"', this.position);
         return node;
     }
     parseAlternation() {
@@ -249,7 +240,7 @@ class PatternParser {
         if (bounds === null)
             return atom;
         if (atom.kind === 'assert' && !grouped) {
-            throw new PatternError('nothing to repeat: a quantifier cannot follow an anchor', start);
+            throw new RegexError('nothing to repeat: a quantifier cannot follow an anchor', start);
         }
         return { kind: 'repeat', node: atom, min: bounds.min, max: bounds.max };
     }
@@ -290,7 +281,7 @@ class PatternParser {
         const min = Number(match[1]);
         const max = match[2] === undefined ? min : match[3] === '' ? Infinity : Number(match[3]);
         if (min > max)
-            throw new PatternError('numbers out of order in a counted repetition', this.position);
+            throw new RegexError('numbers out of order in a counted repetition', this.position);
         this.position += match[0].length;
         return { min, max };
     }
@@ -299,7 +290,7 @@ class PatternParser {
         const char = this.peek();
         switch (char) {
             case undefined:
-                throw new PatternError('pattern ends where an expression was expected', start);
+                throw new RegexError('pattern ends where an expression was expected', start);
             case '(':
                 return this.parseGroup();
             case '[':
@@ -315,7 +306,7 @@ class PatternParser {
                 return { kind: 'assert', assertion: 'end' };
             case '*':
             case '+':
-                throw new PatternError(`nothing to repeat before "${char}"`, start);
+                throw new RegexError(`nothing to repeat before "${char}"`, start);
             case '\\':
                 return this.parseEscape();
             default:
@@ -342,15 +333,15 @@ class PatternParser {
                 this.position += named[0].length;
             }
             else if (/^\?(?:=|!|<=|<!)/.test(this.source.slice(this.position))) {
-                throw new PatternError('lookaround is not supported: an automaton that cannot backtrack cannot look ahead - use ^= $= or *= for a fixed prefix, suffix or substring', start);
+                throw new RegexError('lookaround is not supported: an automaton that cannot backtrack cannot look ahead - use ^= $= or *= for a fixed prefix, suffix or substring', start);
             }
             else {
-                throw new PatternError('unsupported group: expected (?:...) or (?<name>...)', start);
+                throw new RegexError('unsupported group: expected (?:...) or (?<name>...)', start);
             }
         }
         const inner = this.parseAlternation();
         if (this.peek() !== ')')
-            throw new PatternError('unmatched "("', start);
+            throw new RegexError('unmatched "("', start);
         this.position += 1;
         return inner;
     }
@@ -382,7 +373,7 @@ class PatternParser {
             const high = this.parseClassAtom();
             if (typeof low === 'number' && typeof high === 'number') {
                 if (low > high)
-                    throw new PatternError('characters out of order in a character class', dash);
+                    throw new RegexError('characters out of order in a character class', dash);
                 ranges.push([low, high]);
                 continue;
             }
@@ -391,7 +382,7 @@ class PatternParser {
             push(ranges, high);
         }
         if (this.peek() !== ']')
-            throw new PatternError('unterminated character class', start);
+            throw new RegexError('unterminated character class', start);
         this.position += 1;
         return { negated, ranges };
     }
@@ -409,7 +400,7 @@ class PatternParser {
             return 0x08;
         }
         if (this.source[this.position + 1] === 'B') {
-            throw new PatternError('"\\B" is an assertion, not a character, so it cannot be in a class', this.position);
+            throw new RegexError('"\\B" is an assertion, not a character, so it cannot be in a class', this.position);
         }
         const set = this.parseCharacterEscape();
         if (!set.negated && set.ranges.length === 1) {
@@ -434,7 +425,7 @@ class PatternParser {
         this.position += 1;
         const char = this.peek();
         if (char === undefined)
-            throw new PatternError('pattern ends with a backslash', start);
+            throw new RegexError('pattern ends with a backslash', start);
         this.position += 1;
         switch (char) {
             case 'd':
@@ -461,7 +452,7 @@ class PatternParser {
                 return literal(0x0b);
             case '0':
                 if (/^\d/.test(this.source.slice(this.position))) {
-                    throw new PatternError('an octal escape is not supported - write \\xHH or \\uHHHH', start);
+                    throw new RegexError('an octal escape is not supported - write \\xHH or \\uHHHH', start);
                 }
                 return literal(0);
             case 'x':
@@ -471,25 +462,25 @@ class PatternParser {
             case 'c': {
                 const letter = this.peek();
                 if (letter === undefined || !/[A-Za-z]/.test(letter)) {
-                    throw new PatternError('expected a letter after "\\c"', start);
+                    throw new RegexError('expected a letter after "\\c"', start);
                 }
                 this.position += 1;
                 return literal(letter.charCodeAt(0) % 32);
             }
             case 'k':
-                throw new PatternError('a named backreference is not supported: a backreference is not a regular expression, and this is an automaton', start);
+                throw new RegexError('a named backreference is not supported: a backreference is not a regular expression, and this is an automaton', start);
             case 'p':
             case 'P':
-                throw new PatternError(`"\\${char}" needs a table of Unicode properties, which this matcher does not carry - write the characters out as a [class]`, start);
+                throw new RegexError(`"\\${char}" needs a table of Unicode properties, which this matcher does not carry - write the characters out as a [class]`, start);
             default:
                 if (/[1-9]/.test(char)) {
-                    throw new PatternError('a backreference is not supported: it is not a regular expression, and this is an automaton', start);
+                    throw new RegexError('a backreference is not supported: it is not a regular expression, and this is an automaton', start);
                 }
                 if (/[A-Za-z]/.test(char)) {
                     // `RegExp` reads an unknown letter escape as the letter itself, so
                     // `\A` quietly matches a capital A and `\z` a lower-case z. Saying so
                     // is worth more than agreeing with a rule nobody wanted.
-                    throw new PatternError(`unknown escape "\\${char}"`, start);
+                    throw new RegexError(`unknown escape "\\${char}"`, start);
                 }
                 return literal(char.charCodeAt(0));
         }
@@ -497,7 +488,7 @@ class PatternParser {
     readHex(digits, start) {
         const raw = this.source.slice(this.position, this.position + digits);
         if (raw.length !== digits || !/^[0-9a-fA-F]+$/.test(raw)) {
-            throw new PatternError(`expected ${digits} hex digits after "\\${this.source[start + 1]}"`, start);
+            throw new RegexError(`expected ${digits} hex digits after "\\${this.source[start + 1]}"`, start);
         }
         this.position += digits;
         return Number.parseInt(raw, 16);
@@ -539,7 +530,7 @@ class Compiler {
     code = [];
     add(instruction) {
         if (this.code.length >= MAX_PROGRAM) {
-            throw new PatternError(`pattern is too large: counted repetition is compiled by copying, and this needs more than ${MAX_PROGRAM} states`, 0);
+            throw new RegexError(`pattern is too large: counted repetition is compiled by copying, and this needs more than ${MAX_PROGRAM} states`, 0);
         }
         this.code.push(instruction);
         return instruction;
@@ -614,10 +605,10 @@ class Compiler {
 /**
  * Compiles a pattern into a matcher.
  *
- * Throws {@link PatternError} on anything it cannot run in linear time, which
+ * Throws {@link RegexError} on anything it cannot run in linear time, which
  * is the point: the alternative to a message here is a build that stops.
  */
-export function compilePattern(source, options = {}) {
+export function compileRegex(source, options = {}) {
     const tree = new PatternParser(source).parse();
     const compiler = new Compiler();
     compiler.compile(tree);

package/dist/vendor/spec-core/pattern/regex.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"regex.js","sourceRoot":"","sources":["../../../../src/vendor/spec-core/pattern/regex.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GAoCG;AAEH,gFAAgF;AAChF,gFAAgF;AAChF,gFAAgF;AAEhF,2EAA2E;AAC3E,MAAM,OAAO,UAAW,SAAQ,KAAK;IACnC,sCAAsC;IAC7B,MAAM,CAAS;IAExB,YAAY,OAAe,EAAE,MAAc;QACzC,KAAK,CAAC,OAAO,CAAC,CAAC;QACf,IAAI,CAAC,IAAI,GAAG,YAAY,CAAC;QACzB,IAAI,CAAC,MAAM,GAAG,MAAM,CAAC;IACvB,CAAC;CACF;AAED;;;;;;;;;;;GAWG;AACH,MAAM,WAAW,GAAG,IAAI,CAAC;AAsBzB,mFAAmF;AACnF,MAAM,GAAG,GAAY,EAAE,OAAO,EAAE,IAAI,EAAE,MAAM,EAAE,CAAC,CAAC,IAAI,EAAE,IAAI,CAAC,EAAE,CAAC,IAAI,EAAE,IAAI,CAAC,EAAE,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC,EAAE,CAAC;AAC/F,MAAM,KAAK,GAAqB,CAAC,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC,CAAC;AAC/C,MAAM,IAAI,GAAqB;IAC7B,CAAC,IAAI,EAAE,IAAI,CAAC;IACZ,CAAC,IAAI,EAAE,IAAI,CAAC;IACZ,CAAC,IAAI,EAAE,IAAI,CAAC;IACZ,CAAC,IAAI,EAAE,IAAI,CAAC;CACb,CAAC;AACF,iEAAiE;AACjE,MAAM,KAAK,GAAqB;IAC9B,CAAC,IAAI,EAAE,IAAI,CAAC;IACZ,CAAC,IAAI,EAAE,IAAI,CAAC;IACZ,CAAC,IAAI,EAAE,IAAI,CAAC;IACZ,CAAC,MAAM,EAAE,MAAM,CAAC;IAChB,CAAC,MAAM,EAAE,MAAM,CAAC;IAChB,CAAC,MAAM,EAAE,MAAM,CAAC;IAChB,CAAC,MAAM,EAAE,MAAM,CAAC;IAChB,CAAC,MAAM,EAAE,MAAM,CAAC;IAChB,CAAC,MAAM,EAAE,MAAM,CAAC;IAChB,CAAC,MAAM,EAAE,MAAM,CAAC;CACjB,CAAC;AAEF;;;;;;;;GAQG;AACH,SAAS,SAAS,CAAC,IAAY;IAC7B,+EAA+E;IAC/E,kEAAkE;IAClE,IAAI,IAAI,GAAG,GAAG;QAAE,OAAO,IAAI,IAAI,EAAE,IAAI,IAAI,IAAI,GAAG,CAAC,CAAC,CAAC,IAAI,GAAG,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC;IACpE,MAAM,KAAK,GAAG,MAAM,CAAC,YAAY,CAAC,IAAI,CAAC,CAAC,WAAW,EAAE,CAAC;IACtD,IAAI,KAAK,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,IAAI,CAAC;IACpC,MAAM,MAAM,GAAG,KAAK,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC;IACnC,IAAI,IAAI,IAAI,GAAG,IAAI,MAAM,GAAG,GAAG;QAAE,OAAO,IAAI,CAAC;IAC7C,OAAO,MAAM,CAAC;AAChB,CAAC;AAED;;;;;;;;;;GAUG;AACH,SAAS,OAAO,CAAC,GAAY,EAAE,IAAY;IACzC,MAAM,MAAM,GAAG,SAAS,CAAC,IAAI,CAAC,CAAC;IAC/B,IAAI,GAAG,GAAG,KAAK,CAAC;IAChB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,GAAG,CAAC,MAAM,CAAC,MAAM,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC;QAC9C,MAAM,CAAC,GAAG,EAAE,IAAI,CAAC,GAAG,GAAG,CAAC,MAAM,CAAC,CAAC,CAAU,CAAC;QAC3C,IAAI,GAAG,KAAK,IAAI,CAAC,CAAC,CAAC,GAAG,KAAK,IAAI,IAAI,SAAS,CAAC,GAAG,CAAC,KAAK,MAAM,CAAC,CAAC,CAAC,OAAO,CAAC,GAAG,EAAE,IAAI,EAAE,IAAI,CAAC,EAAE,CAAC;YACxF,GAAG,GAAG,IAAI,CAAC;YACX,MAAM;QACR,CAAC;IACH,CAAC;IACD,OAAO,GAAG,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC;AAClC,CAAC;AAED;;;;;;;;;GASG;AACH,SAAS,OAAO,CAAC,GAAW,EAAE,IAAY,EAAE,IAAY;IACtD,IAAI,IAAI,IAAI,GAAG,IAAI,IAAI,IAAI,IAAI;QAAE,OAAO,IAAI,CAAC;IAC7C,8EAA8E;IAC9E,uEAAuE;IACvE,IAAI,IAAI,GAAG,GAAG,EAAE,CAAC;QACf,MAAM,IAAI,GAAG,IAAI,IAAI,EAAE,IAAI,IAAI,IAAI,EAAE,CAAC,CAAC,CAAC,IAAI,GAAG,EAAE,CAAC,CAAC,CAAC,IAAI,IAAI,EAAE,IAAI,IAAI,IAAI,GAAG,CAAC,CAAC,CAAC,IAAI,GAAG,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QAC/F,OAAO,IAAI,IAAI,GAAG,IAAI,IAAI,IAAI,IAAI,CAAC;IACrC,CAAC;IACD,MAAM,MAAM,GAAG,SAAS,CAAC,IAAI,CAAC,CAAC;IAC/B,MAAM,IAAI,GAAG,MAAM,CAAC,YAAY,CAAC,IAAI,CAAC,CAAC;IACvC,KAAK,MAAM,OAAO,IAAI,CAAC,IAAI,CAAC,WAAW,EAAE,EAAE,IAAI,CAAC,WAAW,EAAE,CAAC,EAAE,CAAC;QAC/D,IAAI,OAAO,CAAC,MAAM,KAAK,CAAC;YAAE,SAAS;QACnC,MAAM,SAAS,GAAG,OAAO,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC;QACxC,IAAI,SAAS,IAAI,GAAG,IAAI,SAAS,IAAI,IAAI,IAAI,SAAS,CAAC,SAAS,CAAC,KAAK,MAAM;YAAE,OAAO,IAAI,CAAC;IAC5F,CAAC;IACD,OAAO,KAAK,CAAC;AACf,CAAC;AAED;;;;;GAKG;AACH,SAAS,cAAc,CAAC,GAAY,EAAE,IAAY;IAChD,OAAO,MAAM,CAAC,GAAG,CAAC,MAAM,EAAE,IAAI,CAAC,KAAK,GAAG,CAAC,OAAO,CAAC;AAClD,CAAC;AAED,SAAS,MAAM,CAAC,MAAwB,EAAE,IAAY;IACpD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,MAAM,CAAC,MAAM,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC;QAC1C,MAAM,KAAK,GAAG,MAAM,CAAC,CAAC,CAAU,CAAC;QACjC,IAAI,IAAI,IAAI,KAAK,CAAC,CAAC,CAAC,IAAI,IAAI,IAAI,KAAK,CAAC,CAAC,CAAC;YAAE,OAAO,IAAI,CAAC;IACxD,CAAC;IACD,OAAO,KAAK,CAAC;AACf,CAAC;AAED;;;;;;;;;;;;GAYG;AACH,SAAS,UAAU,CAAC,IAAY;IAC9B,OAAO,MAAM,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC;AAC5B,CAAC;AAgBD,gFAAgF;AAChF,gFAAgF;AAChF,gFAAgF;AAEhF,MAAM,aAAa;IACA,MAAM,CAAS;IACxB,QAAQ,GAAG,CAAC,CAAC;IAErB,YAAY,MAAc;QACxB,IAAI,CAAC,MAAM,GAAG,MAAM,CAAC;IACvB,CAAC;IAED,KAAK;QACH,MAAM,IAAI,GAAG,IAAI,CAAC,gBAAgB,EAAE,CAAC;QACrC,sEAAsE;QACtE,2EAA2E;QAC3E,IAAI,IAAI,CAAC,QAAQ,GAAG,IAAI,CAAC,MAAM,CAAC,MAAM;YAAE,MAAM,IAAI,UAAU,CAAC,eAAe,EAAE,IAAI,CAAC,QAAQ,CAAC,CAAC;QAC7F,OAAO,IAAI,CAAC;IACd,CAAC;IAEO,gBAAgB;QACtB,MAAM,OAAO,GAAW,CAAC,IAAI,CAAC,aAAa,EAAE,CAAC,CAAC;QAC/C,OAAO,IAAI,CAAC,IAAI,EAAE,KAAK,GAAG,EAAE,CAAC;YAC3B,IAAI,CAAC,QAAQ,IAAI,CAAC,CAAC;YACnB,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC,aAAa,EAAE,CAAC,CAAC;QACrC,CAAC;QACD,OAAO,OAAO,CAAC,MAAM,KAAK,CAAC,CAAC,CAAC,CAAE,OAAO,CAAC,CAAC,CAAU,CAAC,CAAC,CAAC,EAAE,IAAI,EAAE,WAAW,EAAE,OAAO,EAAE,CAAC;IACtF,CAAC;IAEO,aAAa;QACnB,MAAM,KAAK,GAAW,EAAE,CAAC;QACzB,SAAS,CAAC;YACR,MAAM,IAAI,GAAG,IAAI,CAAC,IAAI,EAAE,CAAC;YACzB,IAAI,IAAI,KAAK,SAAS,IAAI,IAAI,KAAK,GAAG,IAAI,IAAI,KAAK,GAAG;gBAAE,MAAM;YAC9D,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,eAAe,EAAE,CAAC,CAAC;QACrC,CAAC;QACD,IAAI,KAAK,CAAC,MAAM,KAAK,CAAC;YAAE,OAAO,EAAE,IAAI,EAAE,OAAO,EAAE,CAAC;QACjD,OAAO,KAAK,CAAC,MAAM,KAAK,CAAC,CAAC,CAAC,CAAE,KAAK,CAAC,CAAC,CAAU,CAAC,CAAC,CAAC,EAAE,IAAI,EAAE,QAAQ,EAAE,KAAK,EAAE,CAAC;IAC7E,CAAC;IAEO,eAAe;QACrB,MAAM,KAAK,GAAG,IAAI,CAAC,QAAQ,CAAC;QAC5B,sEAAsE;QACtE,yEAAyE;QACzE,yEAAyE;QACzE,yCAAyC;QACzC,MAAM,OAAO,GAAG,IAAI,CAAC,IAAI,EAAE,KAAK,GAAG,CAAC;QACpC,MAAM,IAAI,GAAG,IAAI,CAAC,SAAS,EAAE,CAAC;QAC9B,MAAM,MAAM,GAAG,IAAI,CAAC,eAAe,EAAE,CAAC;QACtC,IAAI,MAAM,KAAK,IAAI;YAAE,OAAO,IAAI,CAAC;QACjC,IAAI,IAAI,CAAC,IAAI,KAAK,QAAQ,IAAI,CAAC,OAAO,EAAE,CAAC;YACvC,MAAM,IAAI,UAAU,CAAC,yDAAyD,EAAE,KAAK,CAAC,CAAC;QACzF,CAAC;QACD,OAAO,EAAE,IAAI,EAAE,QAAQ,EAAE,IAAI,EAAE,IAAI,EAAE,GAAG,EAAE,MAAM,CAAC,GAAG,EAAE,GAAG,EAAE,MAAM,CAAC,GAAG,EAAE,CAAC;IAC1E,CAAC;IAED,iFAAiF;IACzE,eAAe;QACrB,MAAM,IAAI,GAAG,IAAI,CAAC,IAAI,EAAE,CAAC;QACzB,IAAI,MAAM,GAAwC,IAAI,CAAC;QAEvD,IAAI,IAAI,KAAK,GAAG;YAAE,MAAM,GAAG,EAAE,GAAG,EAAE,CAAC,EAAE,GAAG,EAAE,QAAQ,EAAE,CAAC;aAChD,IAAI,IAAI,KAAK,GAAG;YAAE,MAAM,GAAG,EAAE,GAAG,EAAE,CAAC,EAAE,GAAG,EAAE,QAAQ,EAAE,CAAC;aACrD,IAAI,IAAI,KAAK,GAAG;YAAE,MAAM,GAAG,EAAE,GAAG,EAAE,CAAC,EAAE,GAAG,EAAE,CAAC,EAAE,CAAC;QAEnD,IAAI,MAAM,KAAK,IAAI;YAAE,IAAI,CAAC,QAAQ,IAAI,CAAC,CAAC;aACnC,IAAI,IAAI,KAAK,GAAG;YAAE,MAAM,GAAG,IAAI,CAAC,WAAW,EAAE,CAAC;QACnD,IAAI,MAAM,KAAK,IAAI;YAAE,OAAO,IAAI,CAAC;QAEjC,sEAAsE;QACtE,yEAAyE;QACzE,4BAA4B;QAC5B,IAAI,IAAI,CAAC,IAAI,EAAE,KAAK,GAAG;YAAE,IAAI,CAAC,QAAQ,IAAI,CAAC,CAAC;QAC5C,OAAO,MAAM,CAAC;IAChB,CAAC;IAED;;;;;;OAMG;IACK,WAAW;QACjB,MAAM,KAAK,GAAG,yBAAyB,CAAC,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC;QAC/E,IAAI,CAAC,KAAK;YAAE,OAAO,IAAI,CAAC;QACxB,MAAM,GAAG,GAAG,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC;QAC7B,MAAM,GAAG,GAAG,KAAK,CAAC,CAAC,CAAC,KAAK,SAAS,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC;QACzF,IAAI,GAAG,GAAG,GAAG;YAAE,MAAM,IAAI,UAAU,CAAC,8CAA8C,EAAE,IAAI,CAAC,QAAQ,CAAC,CAAC;QACnG,IAAI,CAAC,QAAQ,IAAK,KAAK,CAAC,CAAC,CAAY,CAAC,MAAM,CAAC;QAC7C,OAAO,EAAE,GAAG,EAAE,GAAG,EAAE,CAAC;IACtB,CAAC;IAEO,SAAS;QACf,MAAM,KAAK,GAAG,IAAI,CAAC,QAAQ,CAAC;QAC5B,MAAM,IAAI,GAAG,IAAI,CAAC,IAAI,EAAE,CAAC;QAEzB,QAAQ,IAAI,EAAE,CAAC;YACb,KAAK,SAAS;gBACZ,MAAM,IAAI,UAAU,CAAC,+CAA+C,EAAE,KAAK,CAAC,CAAC;YAC/E,KAAK,GAAG;gBACN,OAAO,IAAI,CAAC,UAAU,EAAE,CAAC;YAC3B,KAAK,GAAG;gBACN,OAAO,EAAE,IAAI,EAAE,MAAM,EAAE,GAAG,EAAE,IAAI,CAAC,UAAU,EAAE,EAAE,CAAC;YAClD,KAAK,GAAG;gBACN,IAAI,CAAC,QAAQ,IAAI,CAAC,CAAC;gBACnB,OAAO,EAAE,IAAI,EAAE,MAAM,EAAE,GAAG,EAAE,GAAG,EAAE,CAAC;YACpC,KAAK,GAAG;gBACN,IAAI,CAAC,QAAQ,IAAI,CAAC,CAAC;gBACnB,OAAO,EAAE,IAAI,EAAE,QAAQ,EAAE,SAAS,EAAE,OAAO,EAAE,CAAC;YAChD,KAAK,GAAG;gBACN,IAAI,CAAC,QAAQ,IAAI,CAAC,CAAC;gBACnB,OAAO,EAAE,IAAI,EAAE,QAAQ,EAAE,SAAS,EAAE,KAAK,EAAE,CAAC;YAC9C,KAAK,GAAG,CAAC;YACT,KAAK,GAAG;gBACN,MAAM,IAAI,UAAU,CAAC,6BAA6B,IAAI,GAAG,EAAE,KAAK,CAAC,CAAC;YACpE,KAAK,IAAI;gBACP,OAAO,IAAI,CAAC,WAAW,EAAE,CAAC;YAC5B;gBACE,IAAI,CAAC,QAAQ,IAAI,CAAC,CAAC;gBACnB,OAAO,EAAE,IAAI,EAAE,MAAM,EAAE,GAAG,EAAE,OAAO,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;QAC9D,CAAC;IACH,CAAC;IAED;;;;;;OAMG;IACK,UAAU;QAChB,MAAM,KAAK,GAAG,IAAI,CAAC,QAAQ,CAAC;QAC5B,IAAI,CAAC,QAAQ,IAAI,CAAC,CAAC;QAEnB,IAAI,IAAI,CAAC,MAAM,CAAC,UAAU,CAAC,IAAI,EAAE,IAAI,CAAC,QAAQ,CAAC,EAAE,CAAC;YAChD,IAAI,CAAC,QAAQ,IAAI,CAAC,CAAC;QACrB,CAAC;aAAM,IAAI,IAAI,CAAC,IAAI,EAAE,KAAK,GAAG,EAAE,CAAC;YAC/B,MAAM,KAAK,GAAG,yBAAyB,CAAC,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC;YAC/E,IAAI,KAAK,EAAE,CAAC;gBACV,IAAI,CAAC,QAAQ,IAAK,KAAK,CAAC,CAAC,CAAY,CAAC,MAAM,CAAC;YAC/C,CAAC;iBAAM,IAAI,kBAAkB,CAAC,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC,EAAE,CAAC;gBACrE,MAAM,IAAI,UAAU,CAClB,6IAA6I,EAC7I,KAAK,CACN,CAAC;YACJ,CAAC;iBAAM,CAAC;gBACN,MAAM,IAAI,UAAU,CAAC,qDAAqD,EAAE,KAAK,CAAC,CAAC;YACrF,CAAC;QACH,CAAC;QAED,MAAM,KAAK,GAAG,IAAI,CAAC,gBAAgB,EAAE,CAAC;QACtC,IAAI,IAAI,CAAC,IAAI,EAAE,KAAK,GAAG;YAAE,MAAM,IAAI,UAAU,CAAC,eAAe,EAAE,KAAK,CAAC,CAAC;QACtE,IAAI,CAAC,QAAQ,IAAI,CAAC,CAAC;QACnB,OAAO,KAAK,CAAC;IACf,CAAC;IAED;;;;;;OAMG;IACK,UAAU;QAChB,MAAM,KAAK,GAAG,IAAI,CAAC,QAAQ,CAAC;QAC5B,IAAI,CAAC,QAAQ,IAAI,CAAC,CAAC;QACnB,MAAM,OAAO,GAAG,IAAI,CAAC,IAAI,EAAE,KAAK,GAAG,CAAC;QACpC,IAAI,OAAO;YAAE,IAAI,CAAC,QAAQ,IAAI,CAAC,CAAC;QAEhC,MAAM,MAAM,GAAY,EAAE,CAAC;QAC3B,OAAO,IAAI,CAAC,QAAQ,GAAG,IAAI,CAAC,MAAM,CAAC,MAAM,IAAI,IAAI,CAAC,IAAI,EAAE,KAAK,GAAG,EAAE,CAAC;YACjE,MAAM,GAAG,GAAG,IAAI,CAAC,cAAc,EAAE,CAAC;YAClC,qEAAqE;YACrE,oEAAoE;YACpE,gEAAgE;YAChE,IAAI,IAAI,CAAC,IAAI,EAAE,KAAK,GAAG,IAAI,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,QAAQ,GAAG,CAAC,CAAC,KAAK,GAAG,IAAI,IAAI,CAAC,QAAQ,GAAG,CAAC,IAAI,IAAI,CAAC,MAAM,CAAC,MAAM,EAAE,CAAC;gBAC7G,IAAI,CAAC,MAAM,EAAE,GAAG,CAAC,CAAC;gBAClB,SAAS;YACX,CAAC;YACD,MAAM,IAAI,GAAG,IAAI,CAAC,QAAQ,CAAC;YAC3B,IAAI,CAAC,QAAQ,IAAI,CAAC,CAAC;YACnB,MAAM,IAAI,GAAG,IAAI,CAAC,cAAc,EAAE,CAAC;YACnC,IAAI,OAAO,GAAG,KAAK,QAAQ,IAAI,OAAO,IAAI,KAAK,QAAQ,EAAE,CAAC;gBACxD,IAAI,GAAG,GAAG,IAAI;oBAAE,MAAM,IAAI,UAAU,CAAC,8CAA8C,EAAE,IAAI,CAAC,CAAC;gBAC3F,MAAM,CAAC,IAAI,CAAC,CAAC,GAAG,EAAE,IAAI,CAAC,CAAC,CAAC;gBACzB,SAAS;YACX,CAAC;YACD,IAAI,CAAC,MAAM,EAAE,GAAG,CAAC,CAAC;YAClB,MAAM,CAAC,IAAI,CAAC,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC,CAAC;YAC1B,IAAI,CAAC,MAAM,EAAE,IAAI,CAAC,CAAC;QACrB,CAAC;QAED,IAAI,IAAI,CAAC,IAAI,EAAE,KAAK,GAAG;YAAE,MAAM,IAAI,UAAU,CAAC,8BAA8B,EAAE,KAAK,CAAC,CAAC;QACrF,IAAI,CAAC,QAAQ,IAAI,CAAC,CAAC;QACnB,OAAO,EAAE,OAAO,EAAE,MAAM,EAAE,CAAC;IAC7B,CAAC;IAED,gFAAgF;IACxE,cAAc;QACpB,IAAI,IAAI,CAAC,IAAI,EAAE,KAAK,IAAI,EAAE,CAAC;YACzB,MAAM,IAAI,GAAI,IAAI,CAAC,IAAI,EAAa,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC;YACnD,IAAI,CAAC,QAAQ,IAAI,CAAC,CAAC;YACnB,OAAO,IAAI,CAAC;QACd,CAAC;QACD,4EAA4E;QAC5E,2DAA2D;QAC3D,IAAI,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,QAAQ,GAAG,CAAC,CAAC,KAAK,GAAG,EAAE,CAAC;YAC3C,IAAI,CAAC,QAAQ,IAAI,CAAC,CAAC;YACnB,OAAO,IAAI,CAAC;QACd,CAAC;QACD,IAAI,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,QAAQ,GAAG,CAAC,CAAC,KAAK,GAAG,EAAE,CAAC;YAC3C,MAAM,IAAI,UAAU,CAAC,oEAAoE,EAAE,IAAI,CAAC,QAAQ,CAAC,CAAC;QAC5G,CAAC;QACD,MAAM,GAAG,GAAG,IAAI,CAAC,oBAAoB,EAAE,CAAC;QACxC,IAAI,CAAC,GAAG,CAAC,OAAO,IAAI,GAAG,CAAC,MAAM,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YAC5C,MAAM,CAAC,GAAG,EAAE,IAAI,CAAC,GAAG,GAAG,CAAC,MAAM,CAAC,CAAC,CAAU,CAAC;YAC3C,IAAI,GAAG,KAAK,IAAI;gBAAE,OAAO,GAAG,CAAC;QAC/B,CAAC;QACD,OAAO,GAAG,CAAC,OAAO,CAAC,CAAC,CAAC,MAAM,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,MAAM,CAAC;IACvD,CAAC;IAED,qEAAqE;IAC7D,WAAW;QACjB,MAAM,IAAI,GAAG,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,QAAQ,GAAG,CAAC,CAAC,CAAC;QAC5C,IAAI,IAAI,KAAK,GAAG,IAAI,IAAI,KAAK,GAAG,EAAE,CAAC;YACjC,IAAI,CAAC,QAAQ,IAAI,CAAC,CAAC;YACnB,OAAO,EAAE,IAAI,EAAE,QAAQ,EAAE,SAAS,EAAE,IAAI,KAAK,GAAG,CAAC,CAAC,CAAC,eAAe,CAAC,CAAC,CAAC,mBAAmB,EAAE,CAAC;QAC7F,CAAC;QACD,OAAO,EAAE,IAAI,EAAE,MAAM,EAAE,GAAG,EAAE,IAAI,CAAC,oBAAoB,EAAE,EAAE,CAAC;IAC5D,CAAC;IAED,iEAAiE;IACzD,oBAAoB;QAC1B,MAAM,KAAK,GAAG,IAAI,CAAC,QAAQ,CAAC;QAC5B,IAAI,CAAC,QAAQ,IAAI,CAAC,CAAC;QACnB,MAAM,IAAI,GAAG,IAAI,CAAC,IAAI,EAAE,CAAC;QACzB,IAAI,IAAI,KAAK,SAAS;YAAE,MAAM,IAAI,UAAU,CAAC,+BAA+B,EAAE,KAAK,CAAC,CAAC;QACrF,IAAI,CAAC,QAAQ,IAAI,CAAC,CAAC;QAEnB,QAAQ,IAAI,EAAE,CAAC;YACb,KAAK,GAAG;gBACN,OAAO,EAAE,OAAO,EAAE,KAAK,EAAE,MAAM,EAAE,KAAK,EAAE,CAAC;YAC3C,KAAK,GAAG;gBACN,OAAO,EAAE,OAAO,EAAE,IAAI,EAAE,MAAM,EAAE,KAAK,EAAE,CAAC;YAC1C,KAAK,GAAG;gBACN,OAAO,EAAE,OAAO,EAAE,KAAK,EAAE,MAAM,EAAE,IAAI,EAAE,CAAC;YAC1C,KAAK,GAAG;gBACN,OAAO,EAAE,OAAO,EAAE,IAAI,EAAE,MAAM,EAAE,IAAI,EAAE,CAAC;YACzC,KAAK,GAAG;gBACN,OAAO,EAAE,OAAO,EAAE,KAAK,EAAE,MAAM,EAAE,KAAK,EAAE,CAAC;YAC3C,KAAK,GAAG;gBACN,OAAO,EAAE,OAAO,EAAE,IAAI,EAAE,MAAM,EAAE,KAAK,EAAE,CAAC;YAC1C,KAAK,GAAG;gBACN,OAAO,OAAO,CAAC,IAAI,CAAC,CAAC;YACvB,KAAK,GAAG;gBACN,OAAO,OAAO,CAAC,IAAI,CAAC,CAAC;YACvB,KAAK,GAAG;gBACN,OAAO,OAAO,CAAC,IAAI,CAAC,CAAC;YACvB,KAAK,GAAG;gBACN,OAAO,OAAO,CAAC,IAAI,CAAC,CAAC;YACvB,KAAK,GAAG;gBACN,OAAO,OAAO,CAAC,IAAI,CAAC,CAAC;YACvB,KAAK,GAAG;gBACN,IAAI,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC,EAAE,CAAC;oBACjD,MAAM,IAAI,UAAU,CAAC,2DAA2D,EAAE,KAAK,CAAC,CAAC;gBAC3F,CAAC;gBACD,OAAO,OAAO,CAAC,CAAC,CAAC,CAAC;YACpB,KAAK,GAAG;gBACN,OAAO,OAAO,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,CAAC;YACzC,KAAK,GAAG;gBACN,OAAO,OAAO,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,CAAC;YACzC,KAAK,GAAG,EAAE,CAAC;gBACT,MAAM,MAAM,GAAG,IAAI,CAAC,IAAI,EAAE,CAAC;gBAC3B,IAAI,MAAM,KAAK,SAAS,IAAI,CAAC,UAAU,CAAC,IAAI,CAAC,MAAM,CAAC,EAAE,CAAC;oBACrD,MAAM,IAAI,UAAU,CAAC,+BAA+B,EAAE,KAAK,CAAC,CAAC;gBAC/D,CAAC;gBACD,IAAI,CAAC,QAAQ,IAAI,CAAC,CAAC;gBACnB,OAAO,OAAO,CAAC,MAAM,CAAC,UAAU,CAAC,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC;YAC5C,CAAC;YACD,KAAK,GAAG;gBACN,MAAM,IAAI,UAAU,CAClB,+GAA+G,EAC/G,KAAK,CACN,CAAC;YACJ,KAAK,GAAG,CAAC;YACT,KAAK,GAAG;gBACN,MAAM,IAAI,UAAU,CAClB,MAAM,IAAI,kHAAkH,EAC5H,KAAK,CACN,CAAC;YACJ;gBACE,IAAI,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC;oBACvB,MAAM,IAAI,UAAU,CAClB,4FAA4F,EAC5F,KAAK,CACN,CAAC;gBACJ,CAAC;gBACD,IAAI,UAAU,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC;oBAC1B,mEAAmE;oBACnE,sEAAsE;oBACtE,yDAAyD;oBACzD,MAAM,IAAI,UAAU,CAAC,qBAAqB,IAAI,GAAG,EAAE,KAAK,CAAC,CAAC;gBAC5D,CAAC;gBACD,OAAO,OAAO,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,CAAC;QACvC,CAAC;IACH,CAAC;IAEO,OAAO,CAAC,MAAc,EAAE,KAAa;QAC3C,MAAM,GAAG,GAAG,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,IAAI,CAAC,QAAQ,EAAE,IAAI,CAAC,QAAQ,GAAG,MAAM,CAAC,CAAC;QACrE,IAAI,GAAG,CAAC,MAAM,KAAK,MAAM,IAAI,CAAC,gBAAgB,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC;YACzD,MAAM,IAAI,UAAU,CAAC,YAAY,MAAM,wBAAwB,IAAI,CAAC,MAAM,CAAC,KAAK,GAAG,CAAC,CAAW,GAAG,EAAE,KAAK,CAAC,CAAC;QAC7G,CAAC;QACD,IAAI,CAAC,QAAQ,IAAI,MAAM,CAAC;QACxB,OAAO,MAAM,CAAC,QAAQ,CAAC,GAAG,EAAE,EAAE,CAAC,CAAC;IAClC,CAAC;IAEO,IAAI;QACV,OAAO,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;IACpC,CAAC;CACF;AAED,SAAS,OAAO,CAAC,IAAY;IAC3B,OAAO,EAAE,OAAO,EAAE,KAAK,EAAE,MAAM,EAAE,CAAC,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC,EAAE,CAAC;AACpD,CAAC;AAED,SAAS,IAAI,CAAC,MAAe,EAAE,IAA+B;IAC5D,IAAI,OAAO,IAAI,KAAK,QAAQ;QAAE,MAAM,CAAC,IAAI,CAAC,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC,CAAC;;QACnD,MAAM,CAAC,IAAI,CAAC,GAAG,IAAI,CAAC,CAAC;AAC5B,CAAC;AAED;;;;;;GAMG;AACH,SAAS,MAAM,CAAC,MAAwB;IACtC,MAAM,MAAM,GAAG,CAAC,GAAG,MAAM,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IACvD,MAAM,GAAG,GAAY,EAAE,CAAC;IACxB,IAAI,MAAM,GAAG,CAAC,CAAC;IACf,KAAK,MAAM,CAAC,GAAG,EAAE,IAAI,CAAC,IAAI,MAAM,EAAE,CAAC;QACjC,IAAI,GAAG,GAAG,MAAM;YAAE,GAAG,CAAC,IAAI,CAAC,CAAC,MAAM,EAAE,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC;QAC9C,MAAM,GAAG,IAAI,CAAC,GAAG,CAAC,MAAM,EAAE,IAAI,GAAG,CAAC,CAAC,CAAC;IACtC,CAAC;IACD,IAAI,MAAM,IAAI,MAAM;QAAE,GAAG,CAAC,IAAI,CAAC,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC,CAAC;IACjD,OAAO,GAAG,CAAC;AACb,CAAC;AA0BD,MAAM,QAAQ;IACH,IAAI,GAAkB,EAAE,CAAC;IAE1B,GAAG,CAAwB,WAAc;QAC/C,IAAI,IAAI,CAAC,IAAI,CAAC,MAAM,IAAI,WAAW,EAAE,CAAC;YACpC,MAAM,IAAI,UAAU,CAClB,6FAA6F,WAAW,SAAS,EACjH,CAAC,CACF,CAAC;QACJ,CAAC;QACD,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,WAAW,CAAC,CAAC;QAC5B,OAAO,WAAW,CAAC;IACrB,CAAC;IAED,IAAI,IAAI;QACN,OAAO,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC;IAC1B,CAAC;IAED,SAAS;QACP,IAAI,CAAC,GAAG,CAAC,EAAE,EAAE,EAAE,OAAO,EAAE,CAAC,CAAC;IAC5B,CAAC;IAED,OAAO,CAAC,IAAU;QAChB,QAAQ,IAAI,CAAC,IAAI,EAAE,CAAC;YAClB,KAAK,OAAO;gBACV,OAAO;YACT,KAAK,MAAM;gBACT,IAAI,CAAC,GAAG,CAAC,EAAE,EAAE,EAAE,MAAM,EAAE,GAAG,EAAE,IAAI,CAAC,GAAG,EAAE,CAAC,CAAC;gBACxC,OAAO;YACT,KAAK,QAAQ;gBACX,IAAI,CAAC,GAAG,CAAC,EAAE,EAAE,EAAE,QAAQ,EAAE,SAAS,EAAE,IAAI,CAAC,SAAS,EAAE,CAAC,CAAC;gBACtD,OAAO;YACT,KAAK,QAAQ;gBACX,KAAK,MAAM,IAAI,IAAI,IAAI,CAAC,KAAK;oBAAE,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC;gBAClD,OAAO;YACT,KAAK,WAAW,EAAE,CAAC;gBACjB,qEAAqE;gBACrE,sEAAsE;gBACtE,mCAAmC;gBACnC,MAAM,IAAI,GAAW,EAAE,CAAC;gBACxB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,OAAO,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC;oBACpD,MAAM,KAAK,GAAG,IAAI,CAAC,GAAG,CAAC,EAAE,EAAE,EAAE,OAAO,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC;oBACpD,KAAK,CAAC,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC;oBACpB,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC,CAAS,CAAC,CAAC;oBACtC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,EAAE,EAAE,MAAM,EAAE,EAAE,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;oBAC3C,KAAK,CAAC,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC;gBACtB,CAAC;gBACD,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,OAAO,CAAC,MAAM,GAAG,CAAC,CAAS,CAAC,CAAC;gBAC5D,KAAK,MAAM,GAAG,IAAI,IAAI;oBAAE,GAAG,CAAC,EAAE,GAAG,IAAI,CAAC,IAAI,CAAC;gBAC3C,OAAO;YACT,CAAC;YACD,KAAK,QAAQ;gBACX,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,IAAI,EAAE,IAAI,CAAC,GAAG,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC;gBAC3C,OAAO;QACX,CAAC;IACH,CAAC;IAEO,MAAM,CAAC,IAAU,EAAE,GAAW,EAAE,GAAW;QACjD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,GAAG,EAAE,CAAC,IAAI,CAAC;YAAE,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC;QAEpD,IAAI,GAAG,KAAK,QAAQ,EAAE,CAAC;YACrB,MAAM,KAAK,GAAG,IAAI,CAAC,GAAG,CAAC,EAAE,EAAE,EAAE,OAAO,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC;YACpD,MAAM,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC;YACvB,KAAK,CAAC,CAAC,GAAG,IAAI,CAAC;YACf,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC;YACnB,IAAI,CAAC,GAAG,CAAC,EAAE,EAAE,EAAE,MAAM,EAAE,EAAE,EAAE,IAAI,GAAG,CAAC,EAAE,CAAC,CAAC;YACvC,KAAK,CAAC,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC;YACpB,OAAO;QACT,CAAC;QAED,yEAAyE;QACzE,iDAAiD;QACjD,MAAM,KAAK,GAAY,EAAE,CAAC;QAC1B,KAAK,IAAI,CAAC,GAAG,GAAG,EAAE,CAAC,GAAG,GAAG,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC;YAClC,MAAM,KAAK,GAAG,IAAI,CAAC,GAAG,CAAC,EAAE,EAAE,EAAE,OAAO,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC;YACpD,KAAK,CAAC,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC;YACpB,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;YAClB,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC;QACrB,CAAC;QACD,KAAK,MAAM,KAAK,IAAI,KAAK;YAAE,KAAK,CAAC,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC;IACjD,CAAC;CACF;AAyBD;;;;;GAKG;AACH,MAAM,UAAU,YAAY,CAAC,MAAc,EAAE,OAAO,GAAiB,EAAE;IACrE,MAAM,IAAI,GAAG,IAAI,aAAa,CAAC,MAAM,CAAC,CAAC,KAAK,EAAE,CAAC;IAC/C,MAAM,QAAQ,GAAG,IAAI,QAAQ,EAAE,CAAC;IAChC,QAAQ,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC;IACvB,QAAQ,CAAC,SAAS,EAAE,CAAC;IACrB,2EAA2E;IAC3E,sEAAsE;IACtE,yEAAyE;IACzE,6CAA6C;IAC7C,MAAM,OAAO,GAAG,IAAI,OAAO,CAAC,QAAQ,CAAC,IAAI,EAAE,cAAc,CAAC,IAAI,CAAC,EAAE,OAAO,CAAC,UAAU,KAAK,KAAK,CAAC,CAAC;IAC/F,OAAO;QACL,IAAI,EAAE,QAAQ,CAAC,IAAI,CAAC,MAAM;QAC1B,IAAI,EAAE,CAAC,OAAe,EAAW,EAAE,CAAC,OAAO,CAAC,IAAI,CAAC,OAAO,CAAC;KAC1D,CAAC;AACJ,CAAC;AAED,6EAA6E;AAC7E,SAAS,cAAc,CAAC,IAAU;IAChC,QAAQ,IAAI,CAAC,IAAI,EAAE,CAAC;QAClB,KAAK,QAAQ;YACX,OAAO,IAAI,CAAC,SAAS,KAAK,OAAO,CAAC;QACpC,KAAK,QAAQ,EAAE,CAAC;YACd,MAAM,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;YAC5B,OAAO,KAAK,KAAK,SAAS,IAAI,cAAc,CAAC,KAAK,CAAC,CAAC;QACtD,CAAC;QACD,KAAK,WAAW;YACd,OAAO,IAAI,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC,MAAM,EAAE,EAAE,CAAC,cAAc,CAAC,MAAM,CAAC,CAAC,CAAC;QAChE,KAAK,QAAQ;YACX,OAAO,IAAI,CAAC,GAAG,GAAG,CAAC,IAAI,cAAc,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACnD;YACE,OAAO,KAAK,CAAC;IACjB,CAAC;AACH,CAAC;AAED,MAAM,OAAO,GAAG,CAAC,CAAC;AAClB,MAAM,QAAQ,GAAG,CAAC,CAAC;AACnB,MAAM,OAAO,GAAG,CAAC,CAAC;AAClB,MAAM,SAAS,GAAG,CAAC,CAAC;AACpB,MAAM,QAAQ,GAAG,CAAC,CAAC;AAEnB,iFAAiF;AACjF,MAAM,OAAO,GAAY,EAAE,OAAO,EAAE,KAAK,EAAE,MAAM,EAAE,EAAE,EAAE,CAAC;AAExD;;;;;;;;;;GAUG;AACH,MAAM,OAAO;IACM,GAAG,CAAa;IACjC,kDAAkD;IACjC,KAAK,CAAa;IACnC,+BAA+B;IACd,MAAM,CAAa;IACnB,IAAI,CAAY;IAChB,UAAU,CAAc;IACxB,QAAQ,CAAU;IAClB,UAAU,CAAU;IAErC;;;OAGG;IACc,OAAO,CAAa;IACrC,qEAAqE;IACpD,KAAK,CAAa;IAC3B,IAAI,CAAa;IACjB,IAAI,CAAa;IAEzB,YAAY,IAA4B,EAAE,QAAiB,EAAE,UAAmB;QAC9E,MAAM,IAAI,GAAG,IAAI,CAAC,MAAM,CAAC;QACzB,IAAI,CAAC,GAAG,GAAG,IAAI,UAAU,CAAC,IAAI,CAAC,CAAC;QAChC,IAAI,CAAC,KAAK,GAAG,IAAI,UAAU,CAAC,IAAI,CAAC,CAAC;QAClC,IAAI,CAAC,MAAM,GAAG,IAAI,UAAU,CAAC,IAAI,CAAC,CAAC;QACnC,IAAI,CAAC,IAAI,GAAG,IAAI,KAAK,CAAU,IAAI,CAAC,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;QACnD,IAAI,CAAC,UAAU,GAAG,IAAI,KAAK,CAAY,IAAI,CAAC,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;QAC3D,IAAI,CAAC,QAAQ,GAAG,QAAQ,CAAC;QACzB,IAAI,CAAC,UAAU,GAAG,UAAU,CAAC;QAC7B,IAAI,CAAC,OAAO,GAAG,IAAI,UAAU,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC;QAC7C,IAAI,CAAC,KAAK,GAAG,IAAI,UAAU,CAAC,CAAC,GAAG,IAAI,GAAG,CAAC,CAAC,CAAC;QAC1C,IAAI,CAAC,IAAI,GAAG,IAAI,UAAU,CAAC,IAAI,CAAC,CAAC;QACjC,IAAI,CAAC,IAAI,GAAG,IAAI,UAAU,CAAC,IAAI,CAAC,CAAC;QAEjC,IAAI,CAAC,OAAO,CAAC,CAAC,WAAW,EAAE,EAAE,EAAE,EAAE;YAC/B,QAAQ,WAAW,CAAC,EAAE,EAAE,CAAC;gBACvB,KAAK,MAAM;oBACT,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,OAAO,CAAC;oBACvB,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,GAAG,WAAW,CAAC,GAAG,CAAC;oBAChC,MAAM;gBACR,KAAK,OAAO;oBACV,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,QAAQ,CAAC;oBACxB,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC,GAAG,WAAW,CAAC,CAAC,CAAC;oBAC/B,IAAI,CAAC,MAAM,CAAC,EAAE,CAAC,GAAG,WAAW,CAAC,CAAC,CAAC;oBAChC,MAAM;gBACR,KAAK,MAAM;oBACT,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,OAAO,CAAC;oBACvB,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC,GAAG,WAAW,CAAC,EAAE,CAAC;oBAChC,MAAM;gBACR,KAAK,QAAQ;oBACX,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,SAAS,CAAC;oBACzB,IAAI,CAAC,UAAU,CAAC,EAAE,CAAC,GAAG,WAAW,CAAC,SAAS,CAAC;oBAC5C,MAAM;gBACR,KAAK,OAAO;oBACV,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,QAAQ,CAAC;oBACxB,MAAM;YACV,CAAC;QACH,CAAC,CAAC,CAAC;IACL,CAAC;IAED,IAAI,CAAC,OAAe;QAClB,MAAM,MAAM,GAAG,OAAO,CAAC,MAAM,CAAC;QAC9B,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC;QAEtB,IAAI,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC;QACrB,IAAI,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC;QACrB,IAAI,KAAK,GAAG,CAAC,CAAC;QAEd,KAAK,IAAI,QAAQ,GAAG,CAAC,EAAE,QAAQ,IAAI,MAAM,EAAE,QAAQ,IAAI,CAAC,EAAE,CAAC;YACzD,IAAI,QAAQ,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,QAAQ,EAAE,CAAC;gBACrC,KAAK,GAAG,IAAI,CAAC,IAAI,CAAC,IAAI,EAAE,KAAK,EAAE,CAAC,EAAE,OAAO,EAAE,QAAQ,CAAC,CAAC;gBACrD,IAAI,KAAK,GAAG,CAAC;oBAAE,OAAO,IAAI,CAAC;YAC7B,CAAC;iBAAM,IAAI,KAAK,KAAK,CAAC,EAAE,CAAC;gBACvB,0EAA0E;gBAC1E,OAAO,KAAK,CAAC;YACf,CAAC;YAED,IAAI,QAAQ,KAAK,MAAM;gBAAE,OAAO,KAAK,CAAC;YACtC,MAAM,IAAI,GAAG,OAAO,CAAC,UAAU,CAAC,QAAQ,CAAC,CAAC;YAC1C,IAAI,QAAQ,GAAG,CAAC,CAAC;YACjB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC;gBAClC,MAAM,EAAE,GAAG,IAAI,CAAC,CAAC,CAAW,CAAC;gBAC7B,MAAM,GAAG,GAAG,IAAI,CAAC,IAAI,CAAC,EAAE,CAAY,CAAC;gBACrC,IAAI,CAAC,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC,OAAO,CAAC,GAAG,EAAE,IAAI,CAAC,CAAC,CAAC,CAAC,cAAc,CAAC,GAAG,EAAE,IAAI,CAAC,CAAC;oBAAE,SAAS;gBAClF,QAAQ,GAAG,IAAI,CAAC,IAAI,CAAC,IAAI,EAAE,QAAQ,EAAE,EAAE,GAAG,CAAC,EAAE,OAAO,EAAE,QAAQ,GAAG,CAAC,CAAC,CAAC;gBACpE,IAAI,QAAQ,GAAG,CAAC;oBAAE,OAAO,IAAI,CAAC;YAChC,CAAC;YACD,MAAM,KAAK,GAAG,IAAI,CAAC;YACnB,IAAI,GAAG,IAAI,CAAC;YACZ,IAAI,GAAG,KAAK,CAAC;YACb,KAAK,GAAG,QAAQ,CAAC;QACnB,CAAC;QAED,OAAO,KAAK,CAAC;IACf,CAAC;IAED;;;;;;;;;;;;;;OAcG;IACK,IAAI,CAAC,IAAgB,EAAE,MAAc,EAAE,KAAa,EAAE,OAAe,EAAE,QAAgB;QAC7F,MAAM,EAAE,GAAG,EAAE,KAAK,EAAE,MAAM,EAAE,OAAO,EAAE,KAAK,EAAE,GAAG,IAAI,CAAC;QACpD,IAAI,KAAK,GAAG,MAAM,CAAC;QACnB,IAAI,GAAG,GAAG,CAAC,CAAC;QACZ,KAAK,CAAC,GAAG,EAAE,CAAC,GAAG,KAAK,CAAC;QACrB,OAAO,GAAG,GAAG,CAAC,EAAE,CAAC;YACf,MAAM,EAAE,GAAG,KAAK,CAAC,EAAE,GAAG,CAAW,CAAC;YAClC,IAAI,OAAO,CAAC,EAAE,CAAC,KAAK,QAAQ;gBAAE,SAAS;YACvC,OAAO,CAAC,EAAE,CAAC,GAAG,QAAQ,CAAC;YACvB,QAAQ,GAAG,CAAC,EAAE,CAAC,EAAE,CAAC;gBAChB,KAAK,QAAQ;oBACX,OAAO,CAAC,CAAC,CAAC;gBACZ,KAAK,OAAO;oBACV,KAAK,CAAC,GAAG,EAAE,CAAC,GAAG,KAAK,CAAC,EAAE,CAAW,CAAC;oBACnC,MAAM;gBACR,KAAK,QAAQ;oBACX,KAAK,CAAC,GAAG,EAAE,CAAC,GAAG,MAAM,CAAC,EAAE,CAAW,CAAC;oBACpC,KAAK,CAAC,GAAG,EAAE,CAAC,GAAG,KAAK,CAAC,EAAE,CAAW,CAAC;oBACnC,MAAM;gBACR,KAAK,SAAS;oBACZ,IAAI,KAAK,CAAC,IAAI,CAAC,UAAU,CAAC,EAAE,CAAc,EAAE,OAAO,EAAE,QAAQ,CAAC;wBAAE,KAAK,CAAC,GAAG,EAAE,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;oBACtF,MAAM;gBACR;oBACE,IAAI,CAAC,KAAK,EAAE,CAAC,GAAG,EAAE,CAAC;YACvB,CAAC;QACH,CAAC;QACD,OAAO,KAAK,CAAC;IACf,CAAC;CACF;AAED,SAAS,KAAK,CAAC,SAAoB,EAAE,OAAe,EAAE,QAAgB;IACpE,QAAQ,SAAS,EAAE,CAAC;QAClB,KAAK,OAAO;YACV,OAAO,QAAQ,KAAK,CAAC,CAAC;QACxB,KAAK,KAAK;YACR,OAAO,QAAQ,KAAK,OAAO,CAAC,MAAM,CAAC;QACrC,SAAS,CAAC;YACR,MAAM,MAAM,GAAG,QAAQ,GAAG,CAAC,IAAI,UAAU,CAAC,OAAO,CAAC,UAAU,CAAC,QAAQ,GAAG,CAAC,CAAC,CAAC,CAAC;YAC5E,MAAM,KAAK,GAAG,QAAQ,GAAG,OAAO,CAAC,MAAM,IAAI,UAAU,CAAC,OAAO,CAAC,UAAU,CAAC,QAAQ,CAAC,CAAC,CAAC;YACpF,OAAO,CAAC,MAAM,KAAK,KAAK,CAAC,KAAK,CAAC,SAAS,KAAK,eAAe,CAAC,CAAC;QAChE,CAAC;IACH,CAAC;AACH,CAAC","sourcesContent":["/**\n * A regular-expression matcher that cannot backtrack.\n *\n * Written for spec-graph, whose `~=` selector used to hand a user-supplied\n * string to `RegExp` and wait (spec-graph ADR-0017), and moved here so that\n * every tool that accepts a pattern from configuration or from a document can\n * run it unattended in CI without a pattern deciding how long CI takes.\n *\n * The cost is neither theoretical nor exotic. `^([A-Za-z0-9_]+[ ]?)+$` is what\n * somebody writes to say \"the title is words separated by single spaces\", and\n * against a title that does not match, V8 tries one branch per way of cutting\n * each word into pieces:\n *\n * ```text\n *                                                          RegExp      here\n * the quick brown fox jumps over the lazy dog!               0.9s      11us\n * the quick brown fox jumps over the lazy dog and!           5.4s      12us\n * the quick brown fox jumps over the lazy dog and keeps!     103s      13us\n * ```\n *\n * So a pattern here is compiled to a non-deterministic finite automaton and\n * simulated over the subject one character at a time (Thompson, 1968), keeping\n * a set of live states instead of a stack of choices. Each state is visited at\n * most once per position, which makes the work O(pattern x subject), growing\n * with the subject and not with the pattern's ambiguity.\n *\n * What it costs is a dialect. Backreferences and lookaround are not regular and\n * have no place in a linear automaton, so they are rejected while compiling,\n * with a message and an offset, rather than accepted and then slow.\n *\n * The dialect is JavaScript's without the `u` flag, character for character,\n * and is held to that by a differential test against `RegExp`: code units,\n * not code points, and `i` folding by the specification's `Canonicalize`.\n * Matching is unanchored and, unless `ignoreCase: false` is passed,\n * case-insensitive, which is what spec-graph's `~=` has always been. There\n * are no captures: nothing asks where a match was, only whether there was one.\n */\n\n/* -------------------------------------------------------------------------- */\n/* Errors                                                                     */\n/* -------------------------------------------------------------------------- */\n\n/** A pattern that will not compile, and where in it the problem starts. */\nexport class RegexError extends Error {\n  /** Offset into the pattern source. */\n  readonly offset: number;\n\n  constructor(message: string, offset: number) {\n    super(message);\n    this.name = 'RegexError';\n    this.offset = offset;\n  }\n}\n\n/**\n * Ceiling on the compiled program.\n *\n * Counted repetition is compiled by copying - `(ab){20}` is twenty copies -\n * which is part of what keeps the simulation flat, and also what makes\n * `(a{99}){99}` into ten thousand states. The bound has to live somewhere, and\n * a number checked while compiling is the only place it can be enforced without\n * measuring anything at match time.\n *\n * Far above any real selector: the widest pattern in this repository's own\n * tests compiles to seventeen states.\n */\nconst MAX_PROGRAM = 4096;\n\n/* -------------------------------------------------------------------------- */\n/* Character sets                                                             */\n/* -------------------------------------------------------------------------- */\n\n/** An inclusive range of UTF-16 code units. */\ntype Range = readonly [number, number];\n\n/**\n * A set of code units, as inclusive ranges.\n *\n * Code units rather than code points, because that is what a `RegExp` without\n * the `u` flag matches: `.` consumes one half of a surrogate pair, and so does\n * this. Agreeing with the engine this replaced matters more than being right\n * about astral planes, which no selector in any corpus has asked about.\n */\ninterface CharSet {\n  readonly negated: boolean;\n  readonly ranges: readonly Range[];\n}\n\n/** `.` - anything but a line terminator, which is the default `RegExp` reading. */\nconst DOT: CharSet = { negated: true, ranges: [[0x0a, 0x0a], [0x0d, 0x0d], [0x2028, 0x2029]] };\nconst DIGIT: readonly Range[] = [[0x30, 0x39]];\nconst WORD: readonly Range[] = [\n  [0x30, 0x39],\n  [0x41, 0x5a],\n  [0x5f, 0x5f],\n  [0x61, 0x7a],\n];\n/** `\\s`, taken from the specification rather than guessed at. */\nconst SPACE: readonly Range[] = [\n  [0x09, 0x0d],\n  [0x20, 0x20],\n  [0xa0, 0xa0],\n  [0x1680, 0x1680],\n  [0x2000, 0x200a],\n  [0x2028, 0x2029],\n  [0x202f, 0x202f],\n  [0x205f, 0x205f],\n  [0x3000, 0x3000],\n  [0xfeff, 0xfeff],\n];\n\n/**\n * Folds a code unit the way a case-insensitive `RegExp` does.\n *\n * This is `Canonicalize` from the language specification, non-Unicode mode:\n * upper-case the character, keep it unchanged if that produced anything other\n * than one code unit, and keep it unchanged if upper-casing dragged a\n * non-ASCII character into ASCII. The last clause is the one nobody expects and\n * the reason U+017F (long s) does not match `s`.\n */\nfunction canonical(code: number): number {\n  // Every subject a glob sees is mostly ASCII, where the answer needs no string.\n  // The general path below gives the same answer here, only slower.\n  if (code < 128) return code >= 97 && code <= 122 ? code - 32 : code;\n  const upper = String.fromCharCode(code).toUpperCase();\n  if (upper.length !== 1) return code;\n  const folded = upper.charCodeAt(0);\n  if (code >= 128 && folded < 128) return code;\n  return folded;\n}\n\n/**\n * Whether a set accepts a code unit, case-insensitively.\n *\n * The specification canonicalises both sides: a character matches a set when\n * *some* member of the set folds to the same thing it does. A single-character\n * member can be asked that exactly. A range cannot without a fold table for\n * every code unit, so a range is asked the question backwards - does the\n * character, or either of its own case forms, fall inside it - which is exact\n * for every character whose fold is its own case change, and therefore for\n * every range anyone has written.\n */\nfunction accepts(set: CharSet, code: number): boolean {\n  const folded = canonical(code);\n  let hit = false;\n  for (let i = 0; i < set.ranges.length; i += 1) {\n    const [low, high] = set.ranges[i] as Range;\n    if (low === high ? low === code || canonical(low) === folded : inRange(low, high, code)) {\n      hit = true;\n      break;\n    }\n  }\n  return set.negated ? !hit : hit;\n}\n\n/**\n * Whether some member of a range folds to the same thing a code unit does.\n *\n * Asked backwards, by trying the character's own case forms against the raw\n * range - and then checking that the form found there really does fold to the\n * same place, which is the part that is easy to leave out. U+017F upper-cases\n * to `S`, so without that check it matches `[A-Z]`, and it must not: the fold\n * keeps it outside ASCII, which is the same clause `isWordChar` gets wrong if\n * nobody is watching. The differential corpus caught both.\n */\nfunction inRange(low: number, high: number, code: number): boolean {\n  if (code >= low && code <= high) return true;\n  // An ASCII character's only other case form is its ASCII letter twin, and the\n  // two always fold together - so the loop below would ask exactly this.\n  if (code < 128) {\n    const twin = code >= 65 && code <= 90 ? code + 32 : code >= 97 && code <= 122 ? code - 32 : -1;\n    return twin >= low && twin <= high;\n  }\n  const folded = canonical(code);\n  const char = String.fromCharCode(code);\n  for (const variant of [char.toLowerCase(), char.toUpperCase()]) {\n    if (variant.length !== 1) continue;\n    const candidate = variant.charCodeAt(0);\n    if (candidate >= low && candidate <= high && canonical(candidate) === folded) return true;\n  }\n  return false;\n}\n\n/**\n * Whether a set accepts a code unit as written.\n *\n * What `RegExp` does without the `i` flag, and so none of the folding above\n * applies - which also means none of its one divergence does.\n */\nfunction acceptsExactly(set: CharSet, code: number): boolean {\n  return within(set.ranges, code) !== set.negated;\n}\n\nfunction within(ranges: readonly Range[], code: number): boolean {\n  for (let i = 0; i < ranges.length; i += 1) {\n    const range = ranges[i] as Range;\n    if (code >= range[0] && code <= range[1]) return true;\n  }\n  return false;\n}\n\n/**\n * Word characters for `\\b`, which is exactly `\\w` here.\n *\n * The specification does widen this set under case-insensitivity - to every\n * character that folds into it, which is U+017F (long s) and U+212A (the\n * Kelvin sign) - but only in Unicode mode, where `Canonicalize` has no clause\n * keeping a non-ASCII character out of ASCII. This is the non-Unicode dialect,\n * so both stay outside and the table for `\\w` answers for `\\b` as well.\n *\n * Written down because the first version of this function widened the set, and\n * the differential test against `RegExp` is what said otherwise. Reading the\n * clause was not enough; running it was. See spec-graph ADR-0017.\n */\nfunction isWordChar(code: number): boolean {\n  return within(WORD, code);\n}\n\n/* -------------------------------------------------------------------------- */\n/* Syntax tree                                                                */\n/* -------------------------------------------------------------------------- */\n\ntype Assertion = 'start' | 'end' | 'word-boundary' | 'not-word-boundary';\n\ntype Node =\n  | { readonly kind: 'empty' }\n  | { readonly kind: 'char'; readonly set: CharSet }\n  | { readonly kind: 'assert'; readonly assertion: Assertion }\n  | { readonly kind: 'concat'; readonly parts: readonly Node[] }\n  | { readonly kind: 'alternate'; readonly options: readonly Node[] }\n  | { readonly kind: 'repeat'; readonly node: Node; readonly min: number; readonly max: number };\n\n/* -------------------------------------------------------------------------- */\n/* Parsing                                                                    */\n/* -------------------------------------------------------------------------- */\n\nclass PatternParser {\n  private readonly source: string;\n  private position = 0;\n\n  constructor(source: string) {\n    this.source = source;\n  }\n\n  parse(): Node {\n    const node = this.parseAlternation();\n    // Every character is an atom except the two that close something, and\n    // `parseSequence` stops on both, so anything left over is an unopened `)`.\n    if (this.position < this.source.length) throw new RegexError('unmatched \")\"', this.position);\n    return node;\n  }\n\n  private parseAlternation(): Node {\n    const options: Node[] = [this.parseSequence()];\n    while (this.peek() === '|') {\n      this.position += 1;\n      options.push(this.parseSequence());\n    }\n    return options.length === 1 ? (options[0] as Node) : { kind: 'alternate', options };\n  }\n\n  private parseSequence(): Node {\n    const parts: Node[] = [];\n    for (;;) {\n      const char = this.peek();\n      if (char === undefined || char === '|' || char === ')') break;\n      parts.push(this.parseQuantified());\n    }\n    if (parts.length === 0) return { kind: 'empty' };\n    return parts.length === 1 ? (parts[0] as Node) : { kind: 'concat', parts };\n  }\n\n  private parseQuantified(): Node {\n    const start = this.position;\n    // A group makes its contents quantifiable: `RegExp` rejects `\\b*` and\n    // accepts `(\\b)*`, which is the same nothing said twice, and this parser\n    // treats a group as transparent - so whether one was written is the only\n    // thing left that distinguishes the two.\n    const grouped = this.peek() === '(';\n    const atom = this.parseAtom();\n    const bounds = this.parseQuantifier();\n    if (bounds === null) return atom;\n    if (atom.kind === 'assert' && !grouped) {\n      throw new RegexError('nothing to repeat: a quantifier cannot follow an anchor', start);\n    }\n    return { kind: 'repeat', node: atom, min: bounds.min, max: bounds.max };\n  }\n\n  /** `*`, `+`, `?`, `{n}`, `{n,}`, `{n,m}`, and a trailing `?` that is ignored. */\n  private parseQuantifier(): { min: number; max: number } | null {\n    const char = this.peek();\n    let bounds: { min: number; max: number } | null = null;\n\n    if (char === '*') bounds = { min: 0, max: Infinity };\n    else if (char === '+') bounds = { min: 1, max: Infinity };\n    else if (char === '?') bounds = { min: 0, max: 1 };\n\n    if (bounds !== null) this.position += 1;\n    else if (char === '{') bounds = this.parseBraces();\n    if (bounds === null) return null;\n\n    // Laziness decides *which* match is found, and nothing here asks: the\n    // question is whether one exists, and a lazy quantifier accepts the same\n    // language as a greedy one.\n    if (this.peek() === '?') this.position += 1;\n    return bounds;\n  }\n\n  /**\n   * Reads `{n,m}`, or nothing.\n   *\n   * A `{` that does not open a counted repetition is a literal brace, which is\n   * what `RegExp` does with `a{` and what any pattern written against a\n   * document full of `{0}` placeholders depends on.\n   */\n  private parseBraces(): { min: number; max: number } | null {\n    const match = /^\\{(\\d+)(?:(,)(\\d*))?\\}/.exec(this.source.slice(this.position));\n    if (!match) return null;\n    const min = Number(match[1]);\n    const max = match[2] === undefined ? min : match[3] === '' ? Infinity : Number(match[3]);\n    if (min > max) throw new RegexError('numbers out of order in a counted repetition', this.position);\n    this.position += (match[0] as string).length;\n    return { min, max };\n  }\n\n  private parseAtom(): Node {\n    const start = this.position;\n    const char = this.peek();\n\n    switch (char) {\n      case undefined:\n        throw new RegexError('pattern ends where an expression was expected', start);\n      case '(':\n        return this.parseGroup();\n      case '[':\n        return { kind: 'char', set: this.parseClass() };\n      case '.':\n        this.position += 1;\n        return { kind: 'char', set: DOT };\n      case '^':\n        this.position += 1;\n        return { kind: 'assert', assertion: 'start' };\n      case '$':\n        this.position += 1;\n        return { kind: 'assert', assertion: 'end' };\n      case '*':\n      case '+':\n        throw new RegexError(`nothing to repeat before \"${char}\"`, start);\n      case '\\\\':\n        return this.parseEscape();\n      default:\n        this.position += 1;\n        return { kind: 'char', set: literal(char.charCodeAt(0)) };\n    }\n  }\n\n  /**\n   * A group, which is never a capture.\n   *\n   * `(a)` and `(?:a)` compile to the same automaton because nothing downstream\n   * can ask what `(a)` caught. A named group is accepted and its name dropped,\n   * so a pattern copied out of somewhere else keeps working.\n   */\n  private parseGroup(): Node {\n    const start = this.position;\n    this.position += 1;\n\n    if (this.source.startsWith('?:', this.position)) {\n      this.position += 2;\n    } else if (this.peek() === '?') {\n      const named = /^\\?<([A-Za-z_$][\\w$]*)>/.exec(this.source.slice(this.position));\n      if (named) {\n        this.position += (named[0] as string).length;\n      } else if (/^\\?(?:=|!|<=|<!)/.test(this.source.slice(this.position))) {\n        throw new RegexError(\n          'lookaround is not supported: an automaton that cannot backtrack cannot look ahead - use ^= $= or *= for a fixed prefix, suffix or substring',\n          start,\n        );\n      } else {\n        throw new RegexError('unsupported group: expected (?:...) or (?<name>...)', start);\n      }\n    }\n\n    const inner = this.parseAlternation();\n    if (this.peek() !== ')') throw new RegexError('unmatched \"(\"', start);\n    this.position += 1;\n    return inner;\n  }\n\n  /**\n   * Reads a `[...]` class.\n   *\n   * `[]` matches nothing and `[^]` matches anything, which reads like a mistake\n   * and is what every JavaScript engine does: the class ends at the first `]`,\n   * even when that `]` is the first character inside it.\n   */\n  private parseClass(): CharSet {\n    const start = this.position;\n    this.position += 1;\n    const negated = this.peek() === '^';\n    if (negated) this.position += 1;\n\n    const ranges: Range[] = [];\n    while (this.position < this.source.length && this.peek() !== ']') {\n      const low = this.parseClassAtom();\n      // A `-` between two single characters is a range. Anywhere else - at\n      // either end of the class, or beside a `\\d`-style set, which has no\n      // endpoint - it is a literal hyphen, exactly as Annex B has it.\n      if (this.peek() !== '-' || this.source[this.position + 1] === ']' || this.position + 1 >= this.source.length) {\n        push(ranges, low);\n        continue;\n      }\n      const dash = this.position;\n      this.position += 1;\n      const high = this.parseClassAtom();\n      if (typeof low === 'number' && typeof high === 'number') {\n        if (low > high) throw new RegexError('characters out of order in a character class', dash);\n        ranges.push([low, high]);\n        continue;\n      }\n      push(ranges, low);\n      ranges.push([0x2d, 0x2d]);\n      push(ranges, high);\n    }\n\n    if (this.peek() !== ']') throw new RegexError('unterminated character class', start);\n    this.position += 1;\n    return { negated, ranges };\n  }\n\n  /** One member of a class: a code unit, or a whole set for `\\d` and its kind. */\n  private parseClassAtom(): number | readonly Range[] {\n    if (this.peek() !== '\\\\') {\n      const code = (this.peek() as string).charCodeAt(0);\n      this.position += 1;\n      return code;\n    }\n    // `\\b` is a backspace inside a class and a word boundary outside one, which\n    // is the only place the two readings of an escape diverge.\n    if (this.source[this.position + 1] === 'b') {\n      this.position += 2;\n      return 0x08;\n    }\n    if (this.source[this.position + 1] === 'B') {\n      throw new RegexError('\"\\\\B\" is an assertion, not a character, so it cannot be in a class', this.position);\n    }\n    const set = this.parseCharacterEscape();\n    if (!set.negated && set.ranges.length === 1) {\n      const [low, high] = set.ranges[0] as Range;\n      if (low === high) return low;\n    }\n    return set.negated ? invert(set.ranges) : set.ranges;\n  }\n\n  /** An escape outside a class, where `\\b` and `\\B` are assertions. */\n  private parseEscape(): Node {\n    const next = this.source[this.position + 1];\n    if (next === 'b' || next === 'B') {\n      this.position += 2;\n      return { kind: 'assert', assertion: next === 'b' ? 'word-boundary' : 'not-word-boundary' };\n    }\n    return { kind: 'char', set: this.parseCharacterEscape() };\n  }\n\n  /** Every escape that stands for a character or a set of them. */\n  private parseCharacterEscape(): CharSet {\n    const start = this.position;\n    this.position += 1;\n    const char = this.peek();\n    if (char === undefined) throw new RegexError('pattern ends with a backslash', start);\n    this.position += 1;\n\n    switch (char) {\n      case 'd':\n        return { negated: false, ranges: DIGIT };\n      case 'D':\n        return { negated: true, ranges: DIGIT };\n      case 'w':\n        return { negated: false, ranges: WORD };\n      case 'W':\n        return { negated: true, ranges: WORD };\n      case 's':\n        return { negated: false, ranges: SPACE };\n      case 'S':\n        return { negated: true, ranges: SPACE };\n      case 'n':\n        return literal(0x0a);\n      case 'r':\n        return literal(0x0d);\n      case 't':\n        return literal(0x09);\n      case 'f':\n        return literal(0x0c);\n      case 'v':\n        return literal(0x0b);\n      case '0':\n        if (/^\\d/.test(this.source.slice(this.position))) {\n          throw new RegexError('an octal escape is not supported - write \\\\xHH or \\\\uHHHH', start);\n        }\n        return literal(0);\n      case 'x':\n        return literal(this.readHex(2, start));\n      case 'u':\n        return literal(this.readHex(4, start));\n      case 'c': {\n        const letter = this.peek();\n        if (letter === undefined || !/[A-Za-z]/.test(letter)) {\n          throw new RegexError('expected a letter after \"\\\\c\"', start);\n        }\n        this.position += 1;\n        return literal(letter.charCodeAt(0) % 32);\n      }\n      case 'k':\n        throw new RegexError(\n          'a named backreference is not supported: a backreference is not a regular expression, and this is an automaton',\n          start,\n        );\n      case 'p':\n      case 'P':\n        throw new RegexError(\n          `\"\\\\${char}\" needs a table of Unicode properties, which this matcher does not carry - write the characters out as a [class]`,\n          start,\n        );\n      default:\n        if (/[1-9]/.test(char)) {\n          throw new RegexError(\n            'a backreference is not supported: it is not a regular expression, and this is an automaton',\n            start,\n          );\n        }\n        if (/[A-Za-z]/.test(char)) {\n          // `RegExp` reads an unknown letter escape as the letter itself, so\n          // `\\A` quietly matches a capital A and `\\z` a lower-case z. Saying so\n          // is worth more than agreeing with a rule nobody wanted.\n          throw new RegexError(`unknown escape \"\\\\${char}\"`, start);\n        }\n        return literal(char.charCodeAt(0));\n    }\n  }\n\n  private readHex(digits: number, start: number): number {\n    const raw = this.source.slice(this.position, this.position + digits);\n    if (raw.length !== digits || !/^[0-9a-fA-F]+$/.test(raw)) {\n      throw new RegexError(`expected ${digits} hex digits after \"\\\\${this.source[start + 1] as string}\"`, start);\n    }\n    this.position += digits;\n    return Number.parseInt(raw, 16);\n  }\n\n  private peek(): string | undefined {\n    return this.source[this.position];\n  }\n}\n\nfunction literal(code: number): CharSet {\n  return { negated: false, ranges: [[code, code]] };\n}\n\nfunction push(ranges: Range[], atom: number | readonly Range[]): void {\n  if (typeof atom === 'number') ranges.push([atom, atom]);\n  else ranges.push(...atom);\n}\n\n/**\n * Complement of a range list, so `[\\D]` can sit inside a class.\n *\n * A negated escape is a set with no endpoints, and a class is a union of\n * ranges, so the only way to put one inside the other is to spell out what it\n * leaves.\n */\nfunction invert(ranges: readonly Range[]): readonly Range[] {\n  const sorted = [...ranges].sort((a, b) => a[0] - b[0]);\n  const out: Range[] = [];\n  let cursor = 0;\n  for (const [low, high] of sorted) {\n    if (low > cursor) out.push([cursor, low - 1]);\n    cursor = Math.max(cursor, high + 1);\n  }\n  if (cursor <= 0xffff) out.push([cursor, 0xffff]);\n  return out;\n}\n\n/* -------------------------------------------------------------------------- */\n/* Compilation                                                                */\n/* -------------------------------------------------------------------------- */\n\ninterface Split {\n  readonly op: 'split';\n  /** Where the first branch starts. */\n  x: number;\n  /** Where the second branch starts. */\n  y: number;\n}\n\ninterface Jump {\n  readonly op: 'jump';\n  to: number;\n}\n\ntype Instruction =\n  | { readonly op: 'char'; readonly set: CharSet }\n  | Split\n  | Jump\n  | { readonly op: 'assert'; readonly assertion: Assertion }\n  | { readonly op: 'match' };\n\nclass Compiler {\n  readonly code: Instruction[] = [];\n\n  private add<T extends Instruction>(instruction: T): T {\n    if (this.code.length >= MAX_PROGRAM) {\n      throw new RegexError(\n        `pattern is too large: counted repetition is compiled by copying, and this needs more than ${MAX_PROGRAM} states`,\n        0,\n      );\n    }\n    this.code.push(instruction);\n    return instruction;\n  }\n\n  get here(): number {\n    return this.code.length;\n  }\n\n  emitMatch(): void {\n    this.add({ op: 'match' });\n  }\n\n  compile(node: Node): void {\n    switch (node.kind) {\n      case 'empty':\n        return;\n      case 'char':\n        this.add({ op: 'char', set: node.set });\n        return;\n      case 'assert':\n        this.add({ op: 'assert', assertion: node.assertion });\n        return;\n      case 'concat':\n        for (const part of node.parts) this.compile(part);\n        return;\n      case 'alternate': {\n        // One split per option but the last. Each split falls through to its\n        // own branch and points its second arm at the next split; each branch\n        // ends in a jump past all of them.\n        const ends: Jump[] = [];\n        for (let i = 0; i < node.options.length - 1; i += 1) {\n          const split = this.add({ op: 'split', x: 0, y: 0 });\n          split.x = this.here;\n          this.compile(node.options[i] as Node);\n          ends.push(this.add({ op: 'jump', to: 0 }));\n          split.y = this.here;\n        }\n        this.compile(node.options[node.options.length - 1] as Node);\n        for (const end of ends) end.to = this.here;\n        return;\n      }\n      case 'repeat':\n        this.repeat(node.node, node.min, node.max);\n        return;\n    }\n  }\n\n  private repeat(node: Node, min: number, max: number): void {\n    for (let i = 0; i < min; i += 1) this.compile(node);\n\n    if (max === Infinity) {\n      const split = this.add({ op: 'split', x: 0, y: 0 });\n      const body = this.here;\n      split.x = body;\n      this.compile(node);\n      this.add({ op: 'jump', to: body - 1 });\n      split.y = this.here;\n      return;\n    }\n\n    // `{2,5}` is two copies and then three optional ones, each able to leave\n    // for the far end rather than for the next copy.\n    const exits: Split[] = [];\n    for (let i = min; i < max; i += 1) {\n      const split = this.add({ op: 'split', x: 0, y: 0 });\n      split.x = this.here;\n      exits.push(split);\n      this.compile(node);\n    }\n    for (const split of exits) split.y = this.here;\n  }\n}\n\n/* -------------------------------------------------------------------------- */\n/* Simulation                                                                 */\n/* -------------------------------------------------------------------------- */\n\n/**\n * A compiled pattern. Reusable and safe to cache.\n *\n * Not reentrant, which nothing can ask of it: `test` is synchronous and calls\n * out to nothing, and the buffers it keeps between subjects are what make it\n * cheap enough to run against every path a walk visits.\n */\nexport interface RegexMatcher {\n  /** True when the pattern matches anywhere in the subject. */\n  test(subject: string): boolean;\n  /** State count. Published for the size test, and for nothing else. */\n  readonly size: number;\n}\n\nexport interface RegexOptions {\n  /** Fold case the way the `i` flag does. On unless set to `false`. */\n  readonly ignoreCase?: boolean | undefined;\n}\n\n/**\n * Compiles a pattern into a matcher.\n *\n * Throws {@link RegexError} on anything it cannot run in linear time, which\n * is the point: the alternative to a message here is a build that stops.\n */\nexport function compileRegex(source: string, options: RegexOptions = {}): RegexMatcher {\n  const tree = new PatternParser(source).parse();\n  const compiler = new Compiler();\n  compiler.compile(tree);\n  compiler.emitMatch();\n  // A pattern that begins by asserting the start of the subject cannot match\n  // anywhere else, so the simulation stops seeding new threads at every\n  // position. Nothing depends on this being noticed - it is the difference\n  // between one pass and two over a long body.\n  const machine = new Machine(compiler.code, startsAnchored(tree), options.ignoreCase !== false);\n  return {\n    size: compiler.code.length,\n    test: (subject: string): boolean => machine.test(subject),\n  };\n}\n\n/** True when every path through the pattern opens by asserting the start. */\nfunction startsAnchored(node: Node): boolean {\n  switch (node.kind) {\n    case 'assert':\n      return node.assertion === 'start';\n    case 'concat': {\n      const first = node.parts[0];\n      return first !== undefined && startsAnchored(first);\n    }\n    case 'alternate':\n      return node.options.every((option) => startsAnchored(option));\n    case 'repeat':\n      return node.min > 0 && startsAnchored(node.node);\n    default:\n      return false;\n  }\n}\n\nconst OP_CHAR = 0;\nconst OP_SPLIT = 1;\nconst OP_JUMP = 2;\nconst OP_ASSERT = 3;\nconst OP_MATCH = 4;\n\n/** Fills the slots of states that are not characters, where nothing reads it. */\nconst NOTHING: CharSet = { negated: false, ranges: [] };\n\n/**\n * The simulation, over the program flattened into typed arrays.\n *\n * The compiler's instructions are objects of five shapes, and one loop reading\n * `op` off all five is a megamorphic property read on every step. Simulated that\n * way, with a fresh visited table per subject, a glob cost about 3.5\n * microseconds a path and a path that failed on its first character still paid\n * half a microsecond for the allocation. Flat arrays and buffers kept between\n * subjects bring those to 0.6 and 0.04 - `RegExp` takes 0.06 - which matters\n * because a walk tests every path it visits against every pattern.\n */\nclass Machine {\n  private readonly ops: Uint8Array;\n  /** A split's first branch, or a jump's target. */\n  private readonly first: Int32Array;\n  /** A split's second branch. */\n  private readonly second: Int32Array;\n  private readonly sets: CharSet[];\n  private readonly assertions: Assertion[];\n  private readonly anchored: boolean;\n  private readonly ignoreCase: boolean;\n\n  /**\n   * The position each state was last reached at. One visit per state per\n   * position is exactly what turns the exponent into a product.\n   */\n  private readonly visited: Int32Array;\n  /** Each visit pushes at most two states, so this cannot overflow. */\n  private readonly stack: Int32Array;\n  private live: Int32Array;\n  private next: Int32Array;\n\n  constructor(code: readonly Instruction[], anchored: boolean, ignoreCase: boolean) {\n    const size = code.length;\n    this.ops = new Uint8Array(size);\n    this.first = new Int32Array(size);\n    this.second = new Int32Array(size);\n    this.sets = new Array<CharSet>(size).fill(NOTHING);\n    this.assertions = new Array<Assertion>(size).fill('start');\n    this.anchored = anchored;\n    this.ignoreCase = ignoreCase;\n    this.visited = new Int32Array(size).fill(-1);\n    this.stack = new Int32Array(2 * size + 1);\n    this.live = new Int32Array(size);\n    this.next = new Int32Array(size);\n\n    code.forEach((instruction, pc) => {\n      switch (instruction.op) {\n        case 'char':\n          this.ops[pc] = OP_CHAR;\n          this.sets[pc] = instruction.set;\n          break;\n        case 'split':\n          this.ops[pc] = OP_SPLIT;\n          this.first[pc] = instruction.x;\n          this.second[pc] = instruction.y;\n          break;\n        case 'jump':\n          this.ops[pc] = OP_JUMP;\n          this.first[pc] = instruction.to;\n          break;\n        case 'assert':\n          this.ops[pc] = OP_ASSERT;\n          this.assertions[pc] = instruction.assertion;\n          break;\n        case 'match':\n          this.ops[pc] = OP_MATCH;\n          break;\n      }\n    });\n  }\n\n  test(subject: string): boolean {\n    const length = subject.length;\n    this.visited.fill(-1);\n\n    let live = this.live;\n    let next = this.next;\n    let alive = 0;\n\n    for (let position = 0; position <= length; position += 1) {\n      if (position === 0 || !this.anchored) {\n        alive = this.seed(live, alive, 0, subject, position);\n        if (alive < 0) return true;\n      } else if (alive === 0) {\n        // An anchored pattern gets one chance, and every thread from it has died.\n        return false;\n      }\n\n      if (position === length) return false;\n      const char = subject.charCodeAt(position);\n      let arriving = 0;\n      for (let i = 0; i < alive; i += 1) {\n        const pc = live[i] as number;\n        const set = this.sets[pc] as CharSet;\n        if (!(this.ignoreCase ? accepts(set, char) : acceptsExactly(set, char))) continue;\n        arriving = this.seed(next, arriving, pc + 1, subject, position + 1);\n        if (arriving < 0) return true;\n      }\n      const spent = live;\n      live = next;\n      next = spent;\n      alive = arriving;\n    }\n\n    return false;\n  }\n\n  /**\n   * Follows every zero-width transition out of one state, appending the\n   * character states it reaches to `list`.\n   *\n   * Returns the new length of the list, or -1 the moment a thread reaches the\n   * end of the pattern: the only question is whether a match exists, so there\n   * is no leftmost-longest to settle and no captures to keep, and the first\n   * thread to arrive is the answer.\n   *\n   * A stray thread at state 0 changes no answer: an unanchored pattern seeds it\n   * at every position anyway, and an anchored one opens by asserting the start.\n   * That makes two mutants here equivalent, with no test to write - the loop\n   * running once past an empty stack, and a jump read as a split, both of which\n   * add exactly that thread.\n   */\n  private seed(list: Int32Array, length: number, start: number, subject: string, position: number): number {\n    const { ops, first, second, visited, stack } = this;\n    let count = length;\n    let top = 0;\n    stack[top++] = start;\n    while (top > 0) {\n      const pc = stack[--top] as number;\n      if (visited[pc] === position) continue;\n      visited[pc] = position;\n      switch (ops[pc]) {\n        case OP_MATCH:\n          return -1;\n        case OP_JUMP:\n          stack[top++] = first[pc] as number;\n          break;\n        case OP_SPLIT:\n          stack[top++] = second[pc] as number;\n          stack[top++] = first[pc] as number;\n          break;\n        case OP_ASSERT:\n          if (holds(this.assertions[pc] as Assertion, subject, position)) stack[top++] = pc + 1;\n          break;\n        default:\n          list[count++] = pc;\n      }\n    }\n    return count;\n  }\n}\n\nfunction holds(assertion: Assertion, subject: string, position: number): boolean {\n  switch (assertion) {\n    case 'start':\n      return position === 0;\n    case 'end':\n      return position === subject.length;\n    default: {\n      const before = position > 0 && isWordChar(subject.charCodeAt(position - 1));\n      const after = position < subject.length && isWordChar(subject.charCodeAt(position));\n      return (before !== after) === (assertion === 'word-boundary');\n    }\n  }\n}\n"]}

package/dist/vendor/spec-core/text/index.d.ts

@@ -0,0 +1,2 @@
+export { createLineIndex, inRanges, lineEnding, lineStarts, locate, maskRanges, mergeRanges, splitLines, stripBom, } from './lines.js';
+export type { LineIndex, Position, Range } from './lines.js';

package/dist/vendor/spec-core/text/index.js

@@ -0,0 +1,2 @@
+export { createLineIndex, inRanges, lineEnding, lineStarts, locate, maskRanges, mergeRanges, splitLines, stripBom, } from './lines.js';
+//# sourceMappingURL=index.js.map

package/dist/vendor/spec-core/text/index.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.js","sourceRoot":"","sources":["../../../../src/vendor/spec-core/text/index.ts"],"names":[],"mappings":"AAAA,OAAO,EACL,eAAe,EACf,QAAQ,EACR,UAAU,EACV,UAAU,EACV,MAAM,EACN,UAAU,EACV,WAAW,EACX,UAAU,EACV,QAAQ,GACT,MAAM,YAAY,CAAC","sourcesContent":["export {\n  createLineIndex,\n  inRanges,\n  lineEnding,\n  lineStarts,\n  locate,\n  maskRanges,\n  mergeRanges,\n  splitLines,\n  stripBom,\n} from './lines.js';\nexport type { LineIndex, Position, Range } from './lines.js';\n"]}