{"version":3,"file":"index.js","sourceRoot":"","sources":["../../src/index.ts"],"names":[],"mappings":"AAAA,OAAO,EAAa,UAAU,EAAE,MAAM,kBAAkB,CAAA;AAyCxD,sDAAsD;AACtD,MAAM,KAAK,GAAS,EAAE,CAAC,EAAE,OAAO,EAAE,EAAE,EAAE,CAAC,EAAE,CAAA;AAEzC,MAAM,QAAQ,GAAG,OAAO,CAAA;AAExB,MAAM,GAAG,GAAG,CAAC,EAAU,EAAQ,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,KAAK,EAAE,EAAE,EAAE,CAAC,CAAA;AAEpD,MAAM,QAAQ,GAAG,CAAC,CAAS,EAAE,EAAE,CAAC,CAAC,CAAC,OAAO,CAAC,sBAAsB,EAAE,MAAM,CAAC,CAAA;AAEzE,4DAA4D;AAC5D,MAAM,SAAS,GAAG,CAAC,CAAS,EAAE,EAAE,CAAC,IAAI,MAAM,CAAC,IAAI,QAAQ,CAAC,CAAC,CAAC,GAAG,EAAE,IAAI,CAAC,CAAA;AAErE,oEAAoE;AACpE,qEAAqE;AACrE,SAAS;AACT,MAAM,SAAS,GAAG,IAAI,GAAG,EAAkB,CAAA;AAC3C,MAAM,MAAM,GAAG,CAAC,EAAU,EAAE,EAAE;IAC5B,IAAI,EAAE,GAAG,SAAS,CAAC,GAAG,CAAC,EAAE,CAAC,CAAA;IAC1B,IAAI,CAAC,EAAE,EAAE,CAAC;QACR,EAAE,GAAG,SAAS,CAAC,EAAE,CAAC,CAAA;QAClB,IAAI,SAAS,CAAC,IAAI,IAAI,IAAI;YAAE,SAAS,CAAC,KAAK,EAAE,CAAA;QAC7C,SAAS,CAAC,GAAG,CAAC,EAAE,EAAE,EAAE,CAAC,CAAA;IACvB,CAAC;IACD,OAAO,EAAE,CAAA;AACX,CAAC,CAAA;AASD,MAAM,QAAQ,GAAG,CAAC,CAAM,EAAE,CAAS,EAAE,EAAE;IACrC,IAAI,CAAC,KAAK,CAAC,CAAC,EAAE;QAAE,OAAO,IAAI,CAAA;IAC3B,IAAI,CAAC,CAAC,CAAC,EAAE;QAAE,OAAO,KAAK,CAAA;IACvB,MAAM,IAAI,GAAG,CAAC,CAAC,UAAU,CAAC,CAAC,CAAC,CAAA;IAC5B,IAAI,IAAI,IAAI,GAAG;QAAE,OAAO,CAAC,CAAC,EAAE,CAAC,IAAI,CAAC,CAAC,CAAC,CAAA;IACpC,MAAM,KAAK,GAAG,CAAC,CAAC,CAAC,KAAK,KAAK,IAAI,UAAU,CAAC,GAAG,CAAC,CAAC,CAAA;IAC/C,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAA;IACpC,OAAO,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,CAAA;AAC1B,CAAC,CAAA;AAED,MAAM,QAAQ,GAAG,CACf,CAAS,EACT,MAAe,EACf,KAAc,EACd,IAAW,EACX,EAAE;IACF,MAAM,IAAI,GAAY,EAAE,CAAA;IACxB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,MAAM,GAAG,CAAC;QAC9B,MAAM,CAAC,GAAG,MAAM,CAAC,aAAa,CAAC,CAAC,CAAC,WAAW,CAAC,CAAC,CAAE,CAAC,CAAA;QACjD,IAAI,CAAC,KAAK,IAAI,EAAE,CAAC;YACf,8BAA8B;YAC9B,MAAM,CAAC,GAAG,CAAC,CAAC,WAAW,CAAC,CAAC,GAAG,CAAC,CAAC,CAAA;YAC9B,MAAM,EAAE,GAAG,CAAC,KAAK,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,aAAa,CAAC,CAAC,CAAC,CAAA;YACxD,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,CAAA;YAClB,CAAC,IAAI,CAAC,GAAG,EAAE,CAAC,MAAM,CAAA;YAClB,SAAQ;QACV,CAAC;QACD,IAAI,CAAC,KAAK,GAAG,EAAE,CAAC;YACd,MAAM,CAAC,EAAE,EAAE,QAAQ,CAAC,GAAG,UAAU,CAAC,CAAC,EAAE,CAAC,EAAE,MAAM,EAAE,IAAI,CAAC,CAAA;YACrD,IAAI,QAAQ,EAAE,CAAC;gBACb,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,OAAO,EAAE,EAAE,EAAE,CAAC,CAAA;gBAC7B,CAAC,IAAI,QAAQ,CAAA;gBACb,SAAQ;YACV,CAAC;QACH,CAAC;QACD,IAAI,CAAC,KAAK,IAAI,QAAQ,CAAC,QAAQ,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,KAAK,GAAG,EAAE,CAAC;YACvD,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,MAAM,EAAE,IAAI,EAAE,CAAC,EAAE,CAAC,CAAA;YACjC,CAAC,IAAI,CAAC,CAAA;YACN,SAAQ;QACV,CAAC;QACD,IAAI,CAAC,IAAI,CACP,CAAC,KAAK,IAAI,CAAC,KAAK,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,KAAK,EAAE;YAClC,CAAC,CAAC,CAAC,KAAK,IAAI,CAAC,KAAK,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,OAAO,EAAE;gBACtC,CAAC,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,MAAM,EAAE;oBAC3B,CAAC,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,KAAK,EAAE;wBAC1B,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CACT,CAAA;QACD,CAAC,IAAI,CAAC,CAAC,MAAM,CAAA;IACf,CAAC;IACD,OAAO,IAAI,CAAA;AACb,CAAC,CAAA;AAED,4DAA4D;AAC5D,MAAM,IAAI,GAAG,CAAC,IAAa,EAAE,EAAE;IAC7B,MAAM,KAAK,GAAG,IAAI,GAAG,EAAkB,CAAA;IACvC,MAAM,KAAK,GAAa,EAAE,CAAA;IAC1B,IAAI,CAAC,OAAO,CAAC,CAAC,GAAG,EAAE,CAAC,EAAE,EAAE;QACtB,IAAI,GAAG,CAAC,CAAC,KAAK,MAAM;YAAE,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,CAAA;aAC9B,IAAI,GAAG,CAAC,CAAC,KAAK,OAAO,IAAI,KAAK,CAAC,MAAM;YAAE,KAAK,CAAC,GAAG,CAAC,KAAK,CAAC,GAAG,EAAG,EAAE,CAAC,CAAC,CAAA;IACxE,CAAC,CAAC,CAAA;IACF,OAAO,KAAK,CAAA;AACd,CAAC,CAAA;AAED,mEAAmE;AACnE,mEAAmE;AACnE,4CAA4C;AAC5C,MAAM,KAAK,GAAG,CACZ,IAAa,EACb,KAA0B,EAC1B,KAAa,EACb,GAAW,EACX,GAAY,EACF,EAAE;IACZ,IAAI,GAAG,GAAW,EAAE,CAAA;IACpB,MAAM,IAAI,GAAG,CAAC,GAAG,CAAC,CAAA;IAClB,KAAK,IAAI,CAAC,GAAG,KAAK,EAAE,CAAC,GAAG,GAAG,EAAE,CAAC,EAAE,EAAE,CAAC;QACjC,MAAM,GAAG,GAAG,IAAI,CAAC,CAAC,CAAE,CAAA;QACpB,MAAM,KAAK,GAAG,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,CAAA;QAC1B,IAAI,GAAG,CAAC,CAAC,KAAK,MAAM,IAAI,KAAK,KAAK,SAAS,EAAE,CAAC;YAC5C,MAAM,GAAG,GAAG,KAAK,CAAC,IAAI,EAAE,KAAK,EAAE,CAAC,GAAG,CAAC,EAAE,KAAK,EAAE,KAAK,CAAC,CAAA;YACnD,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,KAAK,EAAE,IAAI,EAAE,GAAG,CAAC,IAAI,EAAE,IAAI,EAAE,GAAG,EAAE,CAAC,CAAA;YACjD,CAAC,GAAG,KAAK,CAAA;QACX,CAAC;aAAM,IAAI,GAAG,CAAC,CAAC,KAAK,KAAK,IAAI,CAAC,GAAG,EAAE,CAAC;YACnC,IAAI,CAAC,IAAI,CAAC,CAAC,GAAG,GAAG,EAAE,CAAC,CAAC,CAAA;QACvB,CAAC;aAAM,IAAI,GAAG,CAAC,CAAC,KAAK,MAAM,EAAE,CAAC;YAC5B,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,GAAG,CAAC,GAAG,CAAC,CAAC,CAAA;QACnC,CAAC;aAAM,IAAI,GAAG,CAAC,CAAC,KAAK,KAAK,EAAE,CAAC;YAC3B,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAA;QACpB,CAAC;aAAM,IAAI,GAAG,CAAC,CAAC,KAAK,OAAO,EAAE,CAAC;YAC7B,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAA;QACpB,CAAC;aAAM,CAAC;YACN,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,CAAA;QACf,CAAC;IACH,CAAC;IACD,OAAO,IAAI,CAAA;AACb,CAAC,CAAA;AAED,oEAAoE;AACpE,oEAAoE;AACpE,kEAAkE;AAClE,yDAAyD;AACzD,MAAM,SAAS,GAAG,CAAC,KAAa,EAAE,IAAU,EAAU,EAAE;IACtD,MAAM,GAAG,GAAW,EAAE,CAAA;IACtB,IAAI,GAAG,GAAG,EAAE,CAAA;IACZ,MAAM,KAAK,GAAG,GAAG,EAAE;QACjB,KAAK,MAAM,EAAE,IAAI,GAAG,CAAC,SAAS,CAAC,IAAI,CAAC;YAAE,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,CAAA;QACvD,GAAG,GAAG,EAAE,CAAA;IACV,CAAC,CAAA;IACD,KAAK,MAAM,EAAE,IAAI,KAAK,EAAE,CAAC;QACvB,IAAI,EAAE,CAAC,CAAC,KAAK,KAAK,EAAE,CAAC;YACnB,GAAG,IAAI,EAAE,CAAC,EAAE,CAAA;YACZ,SAAQ;QACV,CAAC;QACD,KAAK,EAAE,CAAA;QACP,GAAG,CAAC,IAAI,CACN,EAAE,CAAC,CAAC,KAAK,KAAK,CAAC,CAAC;YACd,EAAE,GAAG,EAAE,EAAE,IAAI,EAAE,EAAE,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,SAAS,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,EAAE;YACvD,CAAC,CAAC,EAAE,CACL,CAAA;IACH,CAAC;IACD,KAAK,EAAE,CAAA;IACP,OAAO,GAAG,CAAA;AACZ,CAAC,CAAA;AAED,oEAAoE;AACpE,sBAAsB;AACtB,MAAM,OAAO,GAAG,CACd,KAAa,EACb,MAAe,EACc,EAAE;IAC/B,IAAI,EAAE,GAAG,CAAC,CAAA;IACV,MAAM,KAAK,GAAG,CAAC,GAAW,EAAa,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,OAAO,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,GAAG,EAAE,CAAC,CAAA;IACzE,MAAM,GAAG,GAAG,CAAC,KAAa,EAAE,IAAU,EAAQ,EAAE,CAC9C,KAAK,CAAC,WAAW,CAAC,CAAC,IAAI,EAAE,EAAE,EAAE,EAAE,CAAC,IAAI,CAAC,EAAE,EAAE,IAAI,CAAC,EAAE,IAAI,CAAC,CAAA;IACvD,MAAM,IAAI,GAAG,CAAC,EAAQ,EAAE,IAAU,EAAQ,EAAE;QAC1C,QAAQ,EAAE,CAAC,CAAC,EAAE,CAAC;YACb,KAAK,KAAK;gBACR,MAAM,EAAE,GAAG,MAAM,CAAC,CAAC,CAAC,MAAM,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,SAAS,CAAA;gBAC7C,OAAO,EAAE,CAAC,EAAE,KAAK,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,CAAC,EAAE,EAAE,EAAE,EAAE,IAAI,EAAE,CAAA;YACpD,KAAK,KAAK,CAAC;YACX,KAAK,MAAM;gBACT,OAAO,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,IAAI,EAAE,CAAA;YACpC,KAAK,OAAO;gBACV,OAAO,EAAE,CAAC,EAAE,OAAO,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,CAAC,EAAE,EAAE,IAAI,EAAE,CAAA;QACpD,CAAC;QACD,MAAM,IAAI,GAAG,CAAC,IAAU,EAAE,EAAE,CAAC,EAAE,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,CAAA;QAC3D,QAAQ,EAAE,CAAC,IAAI,EAAE,CAAC;YAChB,KAAK,GAAG;gBACN,OAAO,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAA;YAC1B,KAAK,GAAG;gBACN,OAAO,KAAK,CAAC,CAAC,IAAI,EAAE,GAAG,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAA;YACrC,KAAK,GAAG;gBACN,OAAO,EAAE,CAAC,EAAE,KAAK,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,GAAG,EAAE,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,EAAE,IAAI,EAAE,CAAA;QAChE,CAAC;QACD,sCAAsC;QACtC,MAAM,KAAK,GAAG,KAAK,CAAC,EAAE,CAAC,CAAA;QACvB,MAAM,KAAK,GAAG,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAA;QAChC,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,EAAE,KAAK,CAAC,CAAA;QAC3B,OAAO,EAAE,CAAC,IAAI,KAAK,GAAG,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,KAAK,CAAA;IACxC,CAAC,CAAA;IACD,MAAM,KAAK,GAAG,GAAG,CAAC,KAAK,EAAE,KAAK,CAAC,CAAA;IAC/B,OAAO,CAAC,KAAK,EAAE,EAAE,CAAC,CAAA;AACpB,CAAC,CAAA;AAED,6DAA6D;AAC7D,gEAAgE;AAChE,iDAAiD;AACjD,MAAM,IAAI,GAAG,CAAC,KAAW,EAAU,EAAE;IACnC,MAAM,KAAK,GAAa,EAAE,CAAA;IAC1B,MAAM,IAAI,GAAG,IAAI,GAAG,EAAQ,CAAA;IAC5B,MAAM,GAAG,GAAG,CAAC,CAAO,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,KAAK,OAAO,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAA;IACnE,MAAM,IAAI,GAAG,CAAC,CAAO,EAAE,MAAc,EAAE,EAAE;QACvC,IAAI,CAAC,CAAC,CAAC,KAAK,OAAO,IAAI,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC;YAAE,OAAM;QAC1C,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAA;QACX,MAAM,IAAI,GAAG,CAAC,IAAY,EAAE,EAAE,CAAC,KAAK,CAAC,IAAI,CAAC,GAAG,MAAM,GAAG,CAAC,CAAC,EAAE,KAAK,IAAI,EAAE,CAAC,CAAA;QACtE,QAAQ,CAAC,CAAC,CAAC,EAAE,CAAC;YACZ,KAAK,OAAO;gBACV,IAAI,CAAC,YAAY,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,CAAA;gBAC7C,KAAK,MAAM,CAAC,IAAI,CAAC,CAAC,GAAG;oBAAE,IAAI,CAAC,CAAC,EAAE,MAAM,CAAC,CAAA;gBACtC,OAAM;YACR,KAAK,KAAK;gBACR,IAAI,CAAC,KAAK,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,QAAQ,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC,CAAA;gBAC1C,IAAI,CAAC,CAAC,CAAC,GAAG,EAAE,MAAM,GAAG,IAAI,CAAC,CAAA;gBAC1B,OAAO,IAAI,CAAC,CAAC,CAAC,IAAI,EAAE,MAAM,CAAC,CAAA;YAC7B,KAAK,KAAK;gBACR,IAAI,CAAC,GAAG,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC,EAAE,CAAC,OAAO,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC,CAAA;gBACjD,MAAK;YACP,KAAK,OAAO;gBACV,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,OAAO,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC,CAAA;gBACjC,MAAK;YACP;gBACE,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,KAAK,KAAK,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,OAAO,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC,CAAA;QAC1D,CAAC;QACD,IAAI,CAAC,CAAC,CAAC,IAAI,EAAE,MAAM,CAAC,CAAA;IACtB,CAAC,CAAA;IACD,IAAI,CAAC,KAAK,EAAE,EAAE,CAAC,CAAA;IACf,OAAO,CAAC,YAAY,GAAG,CAAC,KAAK,CAAC,EAAE,EAAE,GAAG,KAAK,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAA;AACxD,CAAC,CAAA;AAOD,iEAAiE;AACjE,mEAAmE;AACnE,4DAA4D;AAC5D,+DAA+D;AAC/D,MAAM,KAAK;IACT,wDAAwD;IACxD,GAAG,CAAQ;IACX,OAAO,GAAW,EAAE,CAAA;IACpB,KAAK,GAAG,KAAK,CAAA;IACb,IAAI,GAAU,EAAE,CAAA;IAChB,8DAA8D;IAC9D,gBAAgB;IAChB,GAAG,GAAa,EAAE,CAAA;IAElB,YAAY,GAAW;QACrB,IAAI,CAAC,GAAG,GAAG,GAAG,CAAA;IAChB,CAAC;IAED,wCAAwC;IACxC,IAAI,IAAI;QACN,OAAO,CAAC,IAAI,CAAC,OAAO,CAAC,MAAM,IAAI,CAAC,IAAI,CAAC,KAAK,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,MAAM,CAAA;IACjE,CAAC;CACF;AAED,+CAA+C;AAC/C,MAAM,SAAS,GAAG,CAAC,CAAQ,EAAE,CAAQ,EAAW,EAAE;IAChD,IAAI,CAAC,CAAC,GAAG,CAAC,MAAM,KAAK,CAAC,CAAC,GAAG,CAAC,MAAM;QAAE,OAAO,KAAK,CAAA;IAC/C,IAAI,CAAC,CAAC,IAAI,CAAC,MAAM,KAAK,CAAC,CAAC,IAAI,CAAC,MAAM;QAAE,OAAO,KAAK,CAAA;IACjD,IAAI,CAAC,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,EAAE,EAAE,CAAC,EAAE,EAAE,CAAC,EAAE,KAAK,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QAAE,OAAO,KAAK,CAAA;IACxD,OAAO,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,CACtB,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,GAAG,KAAK,CAAC,CAAC,GAAG,IAAI,SAAS,CAAC,CAAC,CAAC,KAAK,EAAE,CAAC,CAAC,KAAK,CAAC,CAAC,CACjE,CAAA;AACH,CAAC,CAAA;AAaD,MAAM,KAAK,GAAG,CAAC,IAAY,EAAS,EAAE,CAAC,CAAC;IACtC,GAAG,EAAE,IAAI,YAAY,CAAC,IAAI,CAAC;IAC3B,IAAI,EAAE,IAAI,YAAY,CAAC,IAAI,CAAC;IAC5B,GAAG,EAAE,CAAC;CACP,CAAC,CAAA;AAEF,MAAM,GAAG;IACP,6DAA6D;IAC7D,IAAI,CAAS;IACb,wDAAwD;IACxD,QAAQ,CAAS;IACjB,MAAM,CAAO;IAEb,YAAY,IAAa,EAAE,QAAiB,EAAE,KAAY;QACxD,IAAI,CAAC,IAAI,GAAG,IAAI,CAAA;QAChB,IAAI,CAAC,QAAQ,GAAG,QAAQ,CAAA;QACxB,IAAI,CAAC,MAAM,GAAG,KAAK,CAAA;IACrB,CAAC;IAED,KAAK;QACH,OAAO,IAAI,KAAK,CAAC,EAAE,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,CAAA;IACrC,CAAC;IAED,0DAA0D;IAC1D,IAAI,CAAC,KAAY;QACf,KAAK,CAAC,GAAG,GAAG,KAAK,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAA;QAC9D,IAAI,KAAK,CAAC,KAAK;YAAE,KAAK,CAAC,GAAG,CAAC,OAAO,CAAC,KAAK,CAAC,EAAE,CAAC,CAAA;QAC5C,OAAO,KAAK,CAAA;IACd,CAAC;IAED,gEAAgE;IAChE,+BAA+B;IAC/B,MAAM,CAAC,KAAY,EAAE,IAAU;QAC7B,MAAM,EAAE,IAAI,EAAE,GAAG,IAAI,CAAC,MAAM,CAAA;QAC5B,IAAI,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,KAAK,KAAK,CAAC,GAAG;YAAE,OAAO,KAAK,CAAA;QAC7C,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,GAAG,CAAA;QACzB,OAAO,IAAI,CAAA;IACb,CAAC;IAED,UAAU,CAAC,KAAY,EAAE,IAAU;QACjC,MAAM,EAAE,GAAG,EAAE,GAAG,IAAI,CAAC,MAAM,CAAA;QAC3B,IAAI,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,KAAK,KAAK,CAAC,GAAG;YAAE,OAAO,KAAK,CAAA;QAC5C,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,GAAG,CAAA;QACxB,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC,CAAA;QACxB,OAAO,IAAI,CAAA;IACb,CAAC;IAED,iEAAiE;IACjE,gEAAgE;IAChE,+BAA+B;IAC/B,UAAU,CAAC,CAAS,EAAE,GAAY;QAChC,OAAO,GAAG,IAAI,CAAC,IAAI,CAAC,IAAI,IAAI,CAAC,IAAI,CAAC,QAAQ,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAA;IACzD,CAAC;IAED,GAAG,CAAC,KAAY,EAAE,IAAU,EAAE,CAAS,EAAE,GAAY;QACnD,QAAQ,IAAI,CAAC,CAAC,EAAE,CAAC;YACf,KAAK,OAAO;gBACV,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,KAAK,EAAE,IAAI,CAAC;oBAAE,OAAM;gBACrC,KAAK,MAAM,CAAC,IAAI,IAAI,CAAC,GAAG;oBAAE,IAAI,CAAC,GAAG,CAAC,KAAK,EAAE,CAAC,EAAE,CAAC,EAAE,GAAG,CAAC,CAAA;gBACpD,OAAM;YACR,KAAK,KAAK;gBACR,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,KAAK,EAAE,IAAI,CAAC;oBAAE,OAAM;gBACrC,MAAM,GAAG,GAAG,IAAI,CAAC,KAAK,EAAE,CAAA;gBACxB,IAAI,CAAC,GAAG,CAAC,GAAG,EAAE,IAAI,CAAC,GAAG,EAAE,CAAC,EAAE,KAAK,CAAC,CAAA;gBACjC,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,CAAA;gBACd,OAAO,IAAI,CAAC,MAAM,CAChB,KAAK,EACL,EAAE,CAAC,EAAE,KAAK,EAAE,GAAG,EAAE,IAAI,EAAE,KAAK,EAAE,GAAG,EAAE,EACnC,CAAC,EACD,GAAG,CACJ,CAAA;YACH,KAAK,MAAM;gBACT,0DAA0D;gBAC1D,IAAI,IAAI,CAAC,UAAU,CAAC,CAAC,EAAE,GAAG,CAAC;oBAAE,OAAM;gBACnC,IAAI,IAAI,CAAC,UAAU,CAAC,KAAK,EAAE,IAAI,CAAC;oBAC9B,IAAI,CAAC,GAAG,CAAC,KAAK,EAAE,IAAI,CAAC,IAAI,EAAE,CAAC,EAAE,GAAG,CAAC,CAAA;gBACpC,OAAM;YACR,KAAK,OAAO;gBACV,KAAK,CAAC,KAAK,GAAG,IAAI,CAAA;gBAClB,OAAM;YACR;gBACE,IAAI,CAAC,UAAU,CAAC,KAAK,EAAE,IAAI,CAAC,CAAA;QAChC,CAAC;IACH,CAAC;IAED,MAAM,CAAC,KAAY,EAAE,GAAQ,EAAE,CAAS,EAAE,GAAY;QACpD,KAAK,MAAM,CAAC,IAAI,KAAK,CAAC,IAAI,EAAE,CAAC;YAC3B,IAAI,CAAC,CAAC,GAAG,KAAK,GAAG,CAAC,GAAG,IAAI,SAAS,CAAC,CAAC,CAAC,KAAK,EAAE,GAAG,CAAC,KAAK,CAAC;gBAAE,OAAM;QAChE,CAAC;QACD,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,CAAA;QACpB,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,KAAK,EAAE,CAAC;YACrB,IAAI,CAAC,GAAG,CAAC,KAAK,EAAE,GAAG,CAAC,GAAG,CAAC,IAAI,EAAE,CAAC,EAAE,GAAG,CAAC,CAAA;QACvC,CAAC;IACH,CAAC;IAED,2CAA2C;IAC3C,IAAI,CAAC,KAAY,EAAE,CAAS,EAAE,CAAS,EAAE,GAAY;QACnD,MAAM,IAAI,GAAG,IAAI,CAAC,KAAK,EAAE,CAAA;QACzB,KAAK,MAAM,EAAE,IAAI,KAAK,CAAC,OAAO,EAAE,CAAC;YAC/B,QAAQ,EAAE,CAAC,CAAC,EAAE,CAAC;gBACb,KAAK,KAAK;oBACR,IAAI,QAAQ,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,CAAC;wBACpB,IAAI,CAAC,GAAG,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,EAAE,CAAC,GAAG,CAAC,EAAE,GAAG,CAAC,CAAA;oBACrC,CAAC;oBACD,MAAK;gBACP,KAAK,KAAK;oBACR,IAAI,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC,EAAE,GAAG,CAAC;wBAAE,IAAI,CAAC,GAAG,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,EAAE,CAAC,GAAG,CAAC,EAAE,GAAG,CAAC,CAAA;oBACjE,MAAK;gBACP,KAAK,OAAO;oBACV,IAAI,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC,EAAE,GAAG,CAAC,IAAI,EAAE,CAAC,EAAE,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC;wBAC9C,IAAI,CAAC,GAAG,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,EAAE,CAAC,GAAG,CAAC,EAAE,GAAG,CAAC,CAAA;oBACrC,CAAC;oBACD,MAAK;gBACP,KAAK,MAAM;oBACT,IAAI,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC,EAAE,GAAG,CAAC;wBAAE,IAAI,CAAC,GAAG,CAAC,IAAI,EAAE,EAAE,EAAE,CAAC,GAAG,CAAC,EAAE,GAAG,CAAC,CAAA;YAChE,CAAC;QACH,CAAC;QACD,IAAI,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC,EAAE,GAAG,CAAC,EAAE,CAAC;YAC7B,KAAK,MAAM,GAAG,IAAI,KAAK,CAAC,IAAI,EAAE,CAAC;gBAC7B,4DAA4D;gBAC5D,qBAAqB;gBACrB,IAAI,GAAG,CAAC,KAAK,CAAC,IAAI,EAAE,CAAC;oBACnB,IAAI,CAAC,MAAM,CAAC,IAAI,EAAE,GAAG,EAAE,CAAC,GAAG,CAAC,EAAE,GAAG,CAAC,CAAA;oBAClC,SAAQ;gBACV,CAAC;gBACD,MAAM,GAAG,GAAG,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,KAAK,EAAE,CAAC,EAAE,CAAC,EAAE,KAAK,CAAC,CAAA;gBAC7C,IAAI,CAAC,MAAM,CACT,IAAI,EACJ,EAAE,CAAC,EAAE,KAAK,EAAE,GAAG,EAAE,GAAG,CAAC,GAAG,EAAE,KAAK,EAAE,GAAG,EAAE,EACtC,CAAC,GAAG,CAAC,EACL,GAAG,CACJ,CAAA;YACH,CAAC;QACH,CAAC;QACD,OAAO,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,CAAA;IACxB,CAAC;CACF;AAED,mEAAmE;AACnE,6DAA6D;AAC7D,MAAM,QAAQ,GAAG,CAAC,KAAY,EAAU,EAAE;IACxC,MAAM,GAAG,GAAG,KAAK,CAAC,GAAG,CAAC,IAAI,EAAE,CAAA;IAC5B,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,MAAM;QAAE,OAAO,GAAG,CAAA;IAClC,MAAM,IAAI,GAAG,KAAK,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,EAAE,IAAI,QAAQ,CAAC,CAAC,CAAC,KAAK,CAAC,GAAG,CAAC,CAAA;IACrE,OAAO,GAAG,GAAG,IAAI,IAAI,CAAC,IAAI,EAAE,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAA;AAC1C,CAAC,CAAA;AAeD,6DAA6D;AAC7D,iEAAiE;AACjE,6CAA6C;AAC7C,MAAM,UAAU,GAAG,CAAC,IAAI,EAAE,CAAA;AAE1B,kEAAkE;AAClE,iEAAiE;AACjE,8CAA8C;AAC9C,EAAE;AACF,mEAAmE;AACnE,gEAAgE;AAChE,+DAA+D;AAC/D,6DAA6D;AAC7D,MAAM,GAAG;IACP,MAAM,CAAM;IACZ,OAAO,GAAG,IAAI,GAAG,EAAkB,CAAA;IACnC,KAAK,GAAG,CAAC,CAAA;IACT,MAAM,CAAS;IACf,SAAS,CAAS;IAClB,IAAI,CAAK;IACT,OAAO,CAAK;IAEZ,YAAY,KAAW,EAAE,KAAY;QACnC,IAAI,CAAC,MAAM,GAAG,KAAK,CAAA;QACnB,IAAI,CAAC,IAAI,GAAG,IAAI,GAAG,CAAC,KAAK,EAAE,KAAK,EAAE,KAAK,CAAC,CAAA;QACxC,IAAI,CAAC,OAAO,GAAG,IAAI,GAAG,CAAC,KAAK,EAAE,IAAI,EAAE,KAAK,CAAC,CAAA;IAC5C,CAAC;IAED,KAAK,CAAC,KAAY;QAChB,OAAO;YACL,KAAK;YACL,KAAK,EAAE,KAAK,CAAC,KAAK;YAClB,IAAI,EAAE,KAAK,CAAC,IAAI;YAChB,IAAI,EAAE,IAAI,GAAG,EAAE;SAChB,CAAA;IACH,CAAC;IAED,OAAO,CAAC,KAAY;QAClB,MAAM,GAAG,GAAG,QAAQ,CAAC,KAAK,CAAC,CAAA;QAC3B,MAAM,KAAK,GAAG,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,GAAG,CAAC,CAAA;QACnC,IAAI,KAAK;YAAE,OAAO,KAAK,CAAA;QACvB,IAAI,IAAI,CAAC,KAAK,GAAG,UAAU;YAAE,IAAI,CAAC,MAAM,EAAE,CAAA;QAC1C,MAAM,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,CAAA;QAC3B,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC,CAAC,CAAA;QACxB,IAAI,CAAC,KAAK,IAAI,GAAG,CAAC,MAAM,GAAG,CAAC,CAAA;QAC5B,OAAO,CAAC,CAAA;IACV,CAAC;IAED,MAAM;QACJ,IAAI,CAAC,OAAO,CAAC,KAAK,EAAE,CAAA;QACpB,IAAI,CAAC,KAAK,GAAG,CAAC,CAAA;QACd,IAAI,CAAC,MAAM,GAAG,SAAS,CAAA;QACvB,IAAI,CAAC,SAAS,GAAG,SAAS,CAAA;IAC5B,CAAC;IAED,KAAK,CAAC,QAAiB;QACrB,IAAI,QAAQ,EAAE,CAAC;YACb,IAAI,IAAI,CAAC,SAAS;gBAAE,OAAO,IAAI,CAAC,SAAS,CAAA;YACzC,MAAM,KAAK,GAAG,IAAI,CAAC,OAAO,CAAC,KAAK,EAAE,CAAA;YAClC,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,KAAK,EAAE,IAAI,CAAC,MAAM,EAAE,CAAC,EAAE,IAAI,CAAC,CAAA;YAC7C,OAAO,CAAC,IAAI,CAAC,SAAS,GAAG,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAA;QAChE,CAAC;QACD,IAAI,IAAI,CAAC,MAAM;YAAE,OAAO,IAAI,CAAC,MAAM,CAAA;QACnC,MAAM,KAAK,GAAG,IAAI,CAAC,IAAI,CAAC,KAAK,EAAE,CAAA;QAC/B,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,KAAK,EAAE,IAAI,CAAC,MAAM,EAAE,CAAC,EAAE,IAAI,CAAC,CAAA;QAC1C,OAAO,CAAC,IAAI,CAAC,MAAM,GAAG,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAA;IAC5D,CAAC;IAED,4CAA4C;IAC5C,IAAI,CAAC,CAAS,EAAE,CAAS;QACvB,MAAM,IAAI,GAAG,CAAC,CAAC,UAAU,CAAC,CAAC,CAAC,CAAA;QAC5B,MAAM,KAAK,GAAG,IAAI,GAAG,GAAG,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAA;QACpD,IAAI,KAAK;YAAE,OAAO,KAAK,CAAA;QACvB,+DAA+D;QAC/D,MAAM,CAAC,GACL,CAAC,KAAK,IAAI,CAAC,SAAS,CAAC,CAAC;YACpB,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,KAAK,EAAE,CAAC,EAAE,CAAC,EAAE,IAAI,CAAC,CAAC;YACtD,CAAC,CAAC,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,KAAK,EAAE,CAAC,EAAE,CAAC,EAAE,IAAI,CAAC,CAAC,CAAA;QACrD,IAAI,IAAI,GAAG,GAAG,EAAE,CAAC;YACf,IAAI,CAAC,CAAC,CAAC,KAAK,EAAE,CAAC;gBACb,CAAC,CAAC,KAAK,GAAG,IAAI,KAAK,CAAC,GAAG,CAAC,CAAA;gBACxB,IAAI,CAAC,KAAK,IAAI,GAAG,CAAA;YACnB,CAAC;YACD,CAAC,CAAC,KAAK,CAAC,IAAI,CAAC,GAAG,CAAC,CAAA;QACnB,CAAC;aAAM,CAAC;YACN,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,CAAA;QAClB,CAAC;QACD,IAAI,CAAC,KAAK,EAAE,CAAA;QACZ,OAAO,CAAC,CAAA;IACV,CAAC;CACF;AAWD,qDAAqD;AACrD,MAAM,MAAM,GAAG,CAAC,KAAW,EAA4B,EAAE;IACvD,MAAM,KAAK,GAAiB,EAAE,CAAA;IAC9B,KAAK,IAAI,CAAC,GAAG,KAAK,EAAE,CAAC,CAAC,CAAC,KAAK,OAAO,EAAE,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,CAAC;QAChD,IAAI,CAAC,CAAC,CAAC,KAAK,OAAO,IAAI,CAAC,CAAC,CAAC,KAAK,KAAK;YAAE,OAAO,SAAS,CAAA;QACtD,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,CAAA;IACf,CAAC;IACD,OAAO,KAAK,CAAA;AACd,CAAC,CAAA;AAED,mEAAmE;AACnE,oEAAoE;AACpE,qDAAqD;AACrD,qCAAqC;AACrC,MAAM,UAAU,GAAG,CACjB,KAAmB,EACnB,KAAwB,EACxB,KAAa,EACb,GAAW,EACX,EAAE;IACF,IAAI,EAAE,GAAG,CAAC,CAAA;IACV,IAAI,EAAE,GAAG,KAAK,CAAA;IACd,IAAI,MAAM,GAAG,CAAC,CAAC,CAAA;IACf,IAAI,MAAM,GAAG,CAAC,CAAA;IACd,OAAO,EAAE,GAAG,GAAG,EAAE,CAAC;QAChB,MAAM,CAAC,GAAG,KAAK,CAAC,EAAE,CAAC,CAAA;QACnB,IAAI,CAAC,EAAE,CAAC,KAAK,MAAM,EAAE,CAAC;YACpB,MAAM,GAAG,EAAE,EAAE,CAAA;YACb,MAAM,GAAG,EAAE,CAAA;YACX,SAAQ;QACV,CAAC;QACD,MAAM,CAAC,GAAG,KAAK,CAAC,EAAE,CAAE,CAAA;QACpB,IACE,CAAC;YACD,CAAC,CAAC,CAAC,CAAC,KAAK,KAAK;gBACZ,CAAC,CAAC,CAAC,CAAC,KAAK,KAAK,IAAI,QAAQ,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;gBACjC,CAAC,CAAC,CAAC,CAAC,KAAK,OAAO,IAAI,CAAC,CAAC,EAAE,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,EACpC,CAAC;YACD,EAAE,EAAE,CAAA;YACJ,EAAE,EAAE,CAAA;YACJ,SAAQ;QACV,CAAC;QACD,IAAI,MAAM,KAAK,CAAC,CAAC;YAAE,OAAO,KAAK,CAAA;QAC/B,EAAE,GAAG,MAAM,GAAG,CAAC,CAAA;QACf,EAAE,GAAG,EAAE,MAAM,CAAA;IACf,CAAC;IACD,OAAO,KAAK,CAAC,EAAE,CAAC,EAAE,CAAC,KAAK,MAAM;QAAE,EAAE,EAAE,CAAA;IACpC,OAAO,EAAE,KAAK,KAAK,CAAC,MAAM,CAAA;AAC5B,CAAC,CAAA;AAED,oEAAoE;AACpE,oEAAoE;AACpE,oBAAoB;AACpB,MAAM,OAAO,GAAG,CAAC,KAAa,EAA8B,EAAE;IAC5D,IAAI,GAAG,GAAG,CAAC,CAAA;IACX,IAAI,GAAG,GAAG,CAAC,CAAA;IACX,KAAK,MAAM,EAAE,IAAI,KAAK,EAAE,CAAC;QACvB,MAAM,CAAC,EAAE,EAAE,EAAE,CAAC,GAAG,WAAW,CAAC,EAAE,CAAC,CAAA;QAChC,GAAG,IAAI,EAAE,CAAA;QACT,GAAG,IAAI,EAAE,CAAA;IACX,CAAC;IACD,OAAO,CAAC,GAAG,EAAE,GAAG,CAAC,CAAA;AACnB,CAAC,CAAA;AAED,MAAM,WAAW,GAAG,CAAC,EAAQ,EAA8B,EAAE;IAC3D,IAAI,EAAE,CAAC,CAAC,KAAK,MAAM;QAAE,OAAO,CAAC,CAAC,EAAE,QAAQ,CAAC,CAAA;IACzC,IAAI,EAAE,CAAC,CAAC,KAAK,KAAK;QAAE,OAAO,CAAC,CAAC,EAAE,CAAC,CAAC,CAAA;IACjC,IAAI,EAAE,CAAC,IAAI,KAAK,GAAG;QAAE,OAAO,CAAC,CAAC,EAAE,QAAQ,CAAC,CAAA;IACzC,MAAM,IAAI,GAAG,EAAE,CAAC,IAAI,CAAC,GAAG,CAAC,OAAO,CAAC,CAAA;IACjC,MAAM,GAAG,GAAG,IAAI,CAAC,GAAG,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAA;IAC5C,MAAM,GAAG,GAAG,IAAI,CAAC,GAAG,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAA;IAC5C,mEAAmE;IACnE,MAAM,IAAI,GAAG,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,QAAQ,CAAA;IACrC,OAAO,CACL,EAAE,CAAC,IAAI,KAAK,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,EAAE,GAAG,CAAC;QAC5B,CAAC,CAAC,EAAE,CAAC,IAAI,KAAK,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,GAAG,CAAC;YAC5B,CAAC,CAAC,EAAE,CAAC,IAAI,KAAK,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC;gBAC7B,CAAC,CAAC,CAAC,GAAG,EAAE,IAAI,CAAC,CACd,CAAA;AACH,CAAC,CAAA;AAED,oDAAoD;AACpD,MAAM,QAAQ,GAAG,CACf,IAAW,EACX,KAAwB,EACxB,KAAa,EACb,EAAE;IACF,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QACrC,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC,CAAE,EAAE,KAAK,CAAC,KAAK,GAAG,CAAC,CAAE,CAAC;YAAE,OAAO,KAAK,CAAA;IAC1D,CAAC;IACD,OAAO,IAAI,CAAA;AACb,CAAC,CAAA;AAED,qCAAqC;AACrC,MAAM,gBAAgB,GAAG,kBAAkB,CAAA;AAC3C,MAAM,SAAS,GAAG,iBAAiB,CAAA;AAEnC,iEAAiE;AACjE,QAAQ;AACR,MAAM,UAAU,GAAG,CAAC,CAAS,EAAqB,EAAE,CAClD,SAAS,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAA;AAEhC,MAAM,OAAO,GAAG,CAAC,CAAS,EAAE,EAAE;IAC5B,IAAI,CAAC,CAAC,QAAQ,CAAC,GAAG,CAAC,EAAE,CAAC;QACpB,MAAM,IAAI,KAAK,CAAC,6CAA6C,GAAG,CAAC,CAAC,CAAA;IACpE,CAAC;AACH,CAAC,CAAA;AAED,MAAM,OAAO,OAAO;IAClB,OAAO,CAAQ;IACf,OAAO,CAAgB;IACvB,MAAM,CAAM;IACZ,yBAAyB;IACzB,KAAK,CAAQ;IACb,MAAM,CAAQ;IACd,gDAAgD;IAChD,QAAQ,CAAM;IACd,2DAA2D;IAC3D,+DAA+D;IAC/D,cAAc;IACd,QAAQ,CAAS;IACjB,YAAY,GAAG,KAAK,CAAA;IACpB,UAAU,CAAS;IACnB,6DAA6D;IAC7D,eAAe;IACf,OAAO,CAAe;IACtB,kEAAkE;IAClE,yCAAyC;IACzC,KAAK,GAAG,KAAK,CAAA;IACb,iDAAiD;IACjD,IAAI,GAAG,CAAC,CAAA;IACR,IAAI,GAAG,QAAQ,CAAA;IACf,8DAA8D;IAC9D,+DAA+D;IAC/D,8DAA8D;IAC9D,OAAO,GAAU,EAAE,CAAA;IACnB,OAAO,GAAU,EAAE,CAAA;IACnB,6DAA6D;IAC7D,UAAU,CAAS;IACnB,UAAU,CAAS;IACnB,uCAAuC;IACvC,MAAM,GAAG,KAAK,CAAA;IACd,IAAI,CAAM;IACV,KAAK,CAAO;IAEZ,YAAY,OAAe,EAAE,UAA0B,EAAE;QACvD,IAAI,OAAO,CAAC,QAAQ,CAAC,GAAG,CAAC,EAAE,CAAC;YAC1B,MAAM,IAAI,KAAK,CACb,qDAAqD,GAAG,OAAO,CAChE,CAAA;QACH,CAAC;QACD,IAAI,CAAC,OAAO,GAAG,OAAO,CAAA;QACtB,IAAI,CAAC,OAAO,GAAG,OAAO,CAAA;QACtB,MAAM,EAAE,MAAM,GAAG,KAAK,EAAE,KAAK,GAAG,KAAK,EAAE,SAAS,EAAE,CAAC,EAAE,GAAG,OAAO,CAAA;QAC/D,IAAI,CAAC,KAAK,GAAG,CAAC,KAAK,IAAI,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,IAAI,SAAS,CAAA;QAChD,+DAA+D;QAC/D,uDAAuD;QACvD,MAAM,OAAO,GAAG,cAAc,CAAC,IAAI,CAAC,OAAO,CAAC,CAAA;QAC5C,MAAM,IAAI,GAAG,QAAQ,CAAC,OAAO,EAAE,MAAM,EAAE,KAAK,IAAI,OAAO,EAAE,IAAI,CAAC,KAAK,CAAC,CAAA;QACpE,IAAI,CAAC,KAAK,CAAC,GAAG,KAAK,CAAC,IAAI,EAAE,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,IAAI,CAAC,MAAM,EAAE,IAAI,CAAC,CAAA;QAC3D,IAAI,IAAI,CAAC,KAAK;YAAE,KAAK,GAAG,SAAS,CAAC,KAAM,EAAE,IAAI,CAAC,KAAK,CAAC,CAAA;QACrD,MAAM,CAAC,KAAK,EAAE,IAAI,CAAC,GAAG,OAAO,CAAC,KAAM,EAAE,MAAM,CAAC,CAAA;QAC7C,IAAI,CAAC,MAAM,GAAG,KAAK,CAAA;QACnB,IAAI,CAAC,KAAK,GAAG,IAAI,CAAA;QACjB,IAAI,KAAM,CAAC,KAAK,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,KAAK,KAAK,CAAC,EAAE,CAAC;YACvC,IAAI,CAAC,QAAQ,GAAG,KAAM,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC,CAAA;YAChD,IAAI,CAAC,YAAY,GAAG,MAAM,CAAA;QAC5B,CAAC;aAAM,CAAC;YACN,MAAM,GAAG,GAAG,CAAC,EAAQ,EAAmB,EAAE,CACxC,EAAE,CAAC,CAAC,KAAK,KAAK,CAAC,CAAC,CAAC,SAAS;gBAC1B,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,EAAE,EAAE,CAAC,EAAE,EAAE,EAAE,EAAE,MAAM,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE;oBAC3C,CAAC,CAAC,EAAE,EAAE,EAAE,EAAE,CAAC,EAAE,EAAE,CAAA;YACjB,KAAK,MAAM,EAAE,IAAI,KAAM,EAAE,CAAC;gBACxB,MAAM,CAAC,GAAG,GAAG,CAAC,EAAE,CAAC,CAAA;gBACjB,IAAI,CAAC,CAAC;oBAAE,MAAK;gBACb,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,CAAA;YACtB,CAAC;YACD,KAAK,IAAI,CAAC,GAAG,KAAM,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;gBAC5C,MAAM,CAAC,GAAG,GAAG,CAAC,KAAM,CAAC,CAAC,CAAE,CAAC,CAAA;gBACzB,IAAI,CAAC,CAAC;oBAAE,MAAK;gBACb,IAAI,CAAC,OAAO,CAAC,OAAO,CAAC,CAAC,CAAC,CAAA;YACzB,CAAC;YACD,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,OAAO,CAAC,MAAM,IAAI,IAAI,CAAC,OAAO,CAAC,MAAM,CAAC,CAAA;YAC5D,IAAI,CAAC,MAAM,EAAE,CAAC;gBACZ,IAAI,CAAC,UAAU,GAAG,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC,CAAA;gBACtD,IAAI,CAAC,UAAU,GAAG,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC,CAAA;YACxD,CAAC;YACD,IAAI,CAAC,OAAO,GAAG,MAAM,CAAC,IAAI,CAAC,MAAM,CAAC,EAAE,KAAK,CACvC,IAAI,CAAC,OAAO,CAAC,MAAM,EACnB,CAAC,IAAI,CAAC,OAAO,CAAC,MAAM,IAAI,SAAS,CAClC,CAAA;YACD,IAAI,CAAC,KAAK,GAAG,CAAC,CAAC,IAAI,CAAC,OAAO,EAAE,KAAK,CAChC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,KAAK,MAAM,IAAI,CAAC,CAAC,CAAC,KAAK,KAAK,CACrC,CAAA;YACD,MAAM,CAAC,GAAG,EAAE,GAAG,CAAC,GAAG,OAAO,CAAC,KAAM,CAAC,CAAA;YAClC,IAAI,CAAC,IAAI,GAAG,GAAG,CAAA;YACf,IAAI,CAAC,IAAI,GAAG,GAAG,CAAA;QACjB,CAAC;IACH,CAAC;IAED,IAAI,CAAC,CAAS;QACZ,mEAAmE;QACnE,mEAAmE;QACnE,oEAAoE;QACpE,IAAI,IAAI,CAAC,KAAK,EAAE,CAAC;YACf,OAAO,CAAC,CAAC,CAAC,CAAA;YACV,OAAO,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,SAAS,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAA;QAC5C,CAAC;QACD,IAAI,gBAAgB,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC;YAC7B,OAAO,CAAC,CAAC,CAAC,CAAA;YACV,OAAO,IAAI,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,CAAA;QAC9B,CAAC;QACD,OAAO,IAAI,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAA;IACzB,CAAC;IAED;;;;;;;OAOG;IACH,aAAa,CAAC,CAAS;QACrB,OAAO,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAA;IAC7D,CAAC;IAED,mEAAmE;IACnE,2DAA2D;IAC3D,KAAK,CAAC,CAAS,EAAE,KAAyB;QACxC,IAAI,IAAI,CAAC,QAAQ,KAAK,SAAS,EAAE,CAAC;YAChC,OAAO,IAAI,CAAC,YAAY,CAAC,CAAC;gBACtB,CAAC,IAAI,CAAC,UAAU,KAAK,SAAS,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC;gBACxD,CAAC,CAAC,CAAC,KAAK,IAAI,CAAC,QAAQ,CAAA;QACzB,CAAC;QACD,2DAA2D;QAC3D,gEAAgE;QAChE,iEAAiE;QACjE,4CAA4C;QAC5C,MAAM,GAAG,GAAG,IAAI,CAAC,IAAI,CAAA;QACrB,MAAM,GAAG,GAAG,IAAI,CAAC,IAAI,CAAA;QACrB,IAAI,KAAK,KAAK,SAAS,EAAE,CAAC;YACxB,MAAM,IAAI,GAAG,CAAC,CAAC,MAAM,CAAA;YACrB,MAAM,KAAK,GAAG,CAAC,IAAI,GAAG,CAAC,CAAC,IAAI,CAAC,CAAA;YAC7B,IAAI,IAAI,GAAG,GAAG,IAAI,KAAK,GAAG,GAAG;gBAAE,OAAO,KAAK,CAAA;YAC3C,IAAI,KAAK,GAAG,GAAG,IAAI,IAAI,GAAG,GAAG;gBAAE,KAAK,GAAG,UAAU,CAAC,CAAC,CAAC,CAAA;QACtD,CAAC;QACD,IACE,KAAK,KAAK,SAAS;YACnB,CAAC,KAAK,CAAC,MAAM,GAAG,GAAG,IAAI,KAAK,CAAC,MAAM,GAAG,GAAG,CAAC,EAC1C,CAAC;YACD,OAAO,KAAK,CAAA;QACd,CAAC;QACD,MAAM,MAAM,GAAG,IAAI,CAAC,OAAO,CAAC,MAAM,CAAA;QAClC,IAAI,IAAI,CAAC,MAAM,EAAE,CAAC;YAChB,IAAI,IAAI,CAAC,UAAU,KAAK,SAAS,IAAI,IAAI,CAAC,UAAU,KAAK,SAAS,EAAE,CAAC;gBACnE,IACE,CAAC,CAAC,CAAC,UAAU,CAAC,IAAI,CAAC,UAAU,CAAC;oBAC9B,CAAC,CAAC,CAAC,QAAQ,CAAC,IAAI,CAAC,UAAU,CAAC,EAC5B,CAAC;oBACD,OAAO,KAAK,CAAA;gBACd,CAAC;YACH,CAAC;iBAAM,CAAC;gBACN,KAAK,KAAK,UAAU,CAAC,CAAC,CAAC,CAAA;gBACvB,MAAM,GAAG,GAAG,KAAK,CAAC,MAAM,GAAG,IAAI,CAAC,OAAO,CAAC,MAAM,CAAA;gBAC9C,IACE,CAAC,QAAQ,CAAC,IAAI,CAAC,OAAO,EAAE,KAAK,EAAE,CAAC,CAAC;oBACjC,CAAC,QAAQ,CAAC,IAAI,CAAC,OAAO,EAAE,KAAK,EAAE,GAAG,CAAC,EACnC,CAAC;oBACD,OAAO,KAAK,CAAA;gBACd,CAAC;YACH,CAAC;QACH,CAAC;QACD,MAAM,QAAQ,GAAG,CAAC,IAAI,CAAC,OAAO,CAAC,GAAG,IAAI,CAAC,CAAC,UAAU,CAAC,GAAG,CAAC,CAAA;QACvD,IAAI,IAAI,CAAC,OAAO,EAAE,CAAC;YACjB,6DAA6D;YAC7D,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC,KAAK,IAAI;gBAAE,OAAO,KAAK,CAAA;YACzC,0DAA0D;YAC1D,+CAA+C;YAC/C,IAAI,QAAQ,IAAI,CAAC,MAAM;gBAAE,OAAO,KAAK,CAAA;YACrC,IAAI,IAAI,CAAC,KAAK;gBAAE,OAAO,IAAI,CAAA;YAC3B,KAAK,KAAK,UAAU,CAAC,CAAC,CAAC,CAAA;YACvB,MAAM,GAAG,GAAG,KAAK,CAAC,MAAM,GAAG,IAAI,CAAC,OAAO,CAAC,MAAM,CAAA;YAC9C,OAAO,UAAU,CAAC,IAAI,CAAC,OAAO,EAAE,KAAK,EAAE,MAAM,EAAE,GAAG,CAAC,CAAA;QACrD,CAAC;QACD,KAAK,KAAK,UAAU,CAAC,CAAC,CAAC,CAAA;QACvB,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC,KAAK,IAAI,EAAE,CAAC;YAC5B,IAAI,CAAC,MAAM,KAAK,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,CAAA;YACjC,MAAM,GAAG,GAAG,CAAC,IAAI,CAAC,QAAQ,KAAK,IAAI,GAAG,CAAC,IAAI,EAAE,KAAK,EAAE,IAAI,CAAC,MAAM,CAAC,CAAC,CAAA;YACjE,MAAM,KAAK,GAAG,GAAG,CAAC,KAAK,EAAE,CAAA;YACzB,GAAG,CAAC,GAAG,CAAC,KAAK,EAAE,IAAI,CAAC,MAAM,EAAE,CAAC,EAAE,IAAI,CAAC,CAAA;YACpC,IAAI,KAAK,GAAG,GAAG,CAAC,IAAI,CAAC,KAAK,CAAC,CAAA;YAC3B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;gBACtC,KAAK,GAAG,GAAG,CAAC,IAAI,CAAC,KAAK,EAAE,KAAK,CAAC,CAAC,CAAE,EAAE,CAAC,EAAE,IAAI,CAAC,CAAA;YAC7C,CAAC;YACD,OAAO,KAAK,CAAC,KAAK,CAAA;QACpB,CAAC;QACD,IAAI,CAAC,MAAM,KAAK,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,CAAA;QACjC,MAAM,GAAG,GAAG,CAAC,IAAI,CAAC,IAAI,KAAK,IAAI,GAAG,CAAC,IAAI,CAAC,MAAM,EAAE,IAAI,CAAC,MAAM,CAAC,CAAC,CAAA;QAC7D,IAAI,CAAC,GAAG,GAAG,CAAC,KAAK,CAAC,QAAQ,CAAC,CAAA;QAC3B,gEAAgE;QAChE,6BAA6B;QAC7B,MAAM,GAAG,GAAG,KAAK,KAAK,CAAC,CAAA;QACvB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YACtC,IAAI,CAAC,CAAC,IAAI;gBAAE,OAAO,KAAK,CAAA;YACxB,MAAM,IAAI,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAE,CAAC,UAAU,CAAC,CAAC,CAAC,CAAA;YAC5D,CAAC,GAAG,CAAC,CAAC,KAAK,EAAE,CAAC,IAAI,CAAC,IAAI,GAAG,CAAC,IAAI,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,CAAE,CAAC,CAAA;QAC/C,CAAC;QACD,OAAO,CAAC,CAAC,KAAK,CAAA;IAChB,CAAC;IAED,8CAA8C;IAC9C,QAAQ;QACN,OAAO,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,CAAA;IAC1B,CAAC;CACF","sourcesContent":["import { type Form, parseClass } from './parse-class.js'\n\nexport type { Form }\n\nexport type MatcherOptions = {\n  /** perform a case-insensitive match */\n  nocase?: boolean\n  /** do not treat strings starting with `.` specially */\n  dot?: boolean\n  /** do not match extglobs (treat them as normal strings) */\n  noext?: boolean\n  /**\n   * normalize unicode in the pattern and the tested strings, with\n   * this form. `true` means `'NFC'`.\n   */\n  normalize?: boolean | Form\n}\n\n// parsed pattern items\nexport type Item =\n  | { t: 'lit'; ch: string }\n  | { t: 'any' | 'star' }\n  | { t: 'class'; re: RegExp }\n  | { t: 'ext'; type: string; alts: Item[][] }\n\n// extglob syntax tokens become literals if they are not part of a\n// closed extglob\nexport type Token =\n  Item | { t: 'open'; type: string } | { t: 'bar' } | { t: 'close' }\n\n// state machine nodes\nexport type NegNode = { t: 'neg'; id: number; sub: Node; next: Node }\nexport type SplitNode = { t: 'split'; id: number; out: Node[] }\nexport type Node =\n  | ({ t: 'lit'; id: number; next: Node } & Lit)\n  | { t: 'any' | 'star'; id: number; next: Node }\n  | { t: 'class'; id: number; re: RegExp; next: Node }\n  | SplitNode\n  | NegNode\n  | { t: 'match'; id: number }\n\n// the end of the pattern, or of a negated sub-pattern\nconst MATCH: Node = { t: 'match', id: 0 }\n\nconst extTypes = '!?+*@'\n\nconst lit = (ch: string): Item => ({ t: 'lit', ch })\n\nconst reEscape = (s: string) => s.replace(/[\\\\^$.*+?()[\\]{}|/]/g, '\\\\$&')\n\n// a RegExp that only matches `s`, with unicode case folding\nconst newFoldRe = (s: string) => new RegExp(`^${reEscape(s)}$`, 'iu')\n\n// foldRe for one literal char. The same chars are in most patterns,\n// so keep them. A RegExp without the `g` or `y` flag has no state to\n// share.\nconst foldCache = new Map<string, RegExp>()\nconst foldRe = (ch: string) => {\n  let re = foldCache.get(ch)\n  if (!re) {\n    re = newFoldRe(ch)\n    if (foldCache.size >= 1000) foldCache.clear()\n    foldCache.set(ch, re)\n  }\n  return re\n}\n\n/**\n * A literal char. With `nocase:true`, `re` folds case, and `ascii`\n * holds its results for ASCII chars, by char code: 1 for a match,\n * and 2 for not.\n */\nexport type Lit = { ch: string; re?: RegExp; ascii?: Uint8Array }\n\nconst litMatch = (l: Lit, c: string) => {\n  if (c === l.ch) return true\n  if (!l.re) return false\n  const code = c.charCodeAt(0)\n  if (code >= 128) return l.re.test(c)\n  const ascii = (l.ascii ??= new Uint8Array(128))\n  ascii[code] ||= l.re.test(c) ? 1 : 2\n  return ascii[code] === 1\n}\n\nconst tokenize = (\n  p: string,\n  nocase: boolean,\n  noext: boolean,\n  form?: Form,\n) => {\n  const toks: Token[] = []\n  for (let i = 0; i < p.length;) {\n    const c = String.fromCodePoint(p.codePointAt(i)!)\n    if (c === '\\\\') {\n      // a trailing \\ is a literal \\\n      const e = p.codePointAt(i + 1)\n      const ch = e === undefined ? c : String.fromCodePoint(e)\n      toks.push(lit(ch))\n      i += 1 + ch.length\n      continue\n    }\n    if (c === '[') {\n      const [re, consumed] = parseClass(p, i, nocase, form)\n      if (consumed) {\n        toks.push({ t: 'class', re })\n        i += consumed\n        continue\n      }\n    }\n    if (!noext && extTypes.includes(c) && p[i + 1] === '(') {\n      toks.push({ t: 'open', type: c })\n      i += 2\n      continue\n    }\n    toks.push(\n      !noext && c === '|' ? { t: 'bar' }\n      : !noext && c === ')' ? { t: 'close' }\n      : c === '*' ? { t: 'star' }\n      : c === '?' ? { t: 'any' }\n      : lit(c),\n    )\n    i += c.length\n  }\n  return toks\n}\n\n// map each open token index to the index of its close token\nconst pair = (toks: Token[]) => {\n  const pairs = new Map<number, number>()\n  const stack: number[] = []\n  toks.forEach((tok, i) => {\n    if (tok.t === 'open') stack.push(i)\n    else if (tok.t === 'close' && stack.length) pairs.set(stack.pop()!, i)\n  })\n  return pairs\n}\n\n// build the alternatives between start and end. An open token that\n// is not closed is never inside a closed extglob, so bar and close\n// tokens are only literal at the top level.\nconst build = (\n  toks: Token[],\n  pairs: Map<number, number>,\n  start: number,\n  end: number,\n  top: boolean,\n): Item[][] => {\n  let seq: Item[] = []\n  const alts = [seq]\n  for (let i = start; i < end; i++) {\n    const tok = toks[i]!\n    const close = pairs.get(i)\n    if (tok.t === 'open' && close !== undefined) {\n      const sub = build(toks, pairs, i + 1, close, false)\n      seq.push({ t: 'ext', type: tok.type, alts: sub })\n      i = close\n    } else if (tok.t === 'bar' && !top) {\n      alts.push((seq = []))\n    } else if (tok.t === 'open') {\n      seq.push(lit(tok.type), lit('('))\n    } else if (tok.t === 'bar') {\n      seq.push(lit('|'))\n    } else if (tok.t === 'close') {\n      seq.push(lit(')'))\n    } else {\n      seq.push(tok)\n    }\n  }\n  return alts\n}\n\n// normalize each run of literal chars as one string, so that a char\n// and the combining marks after it compose (or decompose) together.\n// Syntax is already parsed, so a char that normalizes to a syntax\n// char (such as full-width `＊` in NFKC) stays a literal.\nconst normalize = (items: Item[], form: Form): Item[] => {\n  const out: Item[] = []\n  let run = ''\n  const flush = () => {\n    for (const ch of run.normalize(form)) out.push(lit(ch))\n    run = ''\n  }\n  for (const it of items) {\n    if (it.t === 'lit') {\n      run += it.ch\n      continue\n    }\n    flush()\n    out.push(\n      it.t === 'ext' ?\n        { ...it, alts: it.alts.map(a => normalize(a, form)) }\n      : it,\n    )\n  }\n  flush()\n  return out\n}\n\n// the start node, and the number of node ids. Ids are dense, from 0\n// for the match node.\nconst compile = (\n  items: Item[],\n  nocase: boolean,\n): [start: Node, size: number] => {\n  let id = 1\n  const split = (out: Node[]): SplitNode => ({ t: 'split', id: id++, out })\n  const seq = (items: Item[], next: Node): Node =>\n    items.reduceRight((next, it) => item(it, next), next)\n  const item = (it: Item, next: Node): Node => {\n    switch (it.t) {\n      case 'lit':\n        const re = nocase ? foldRe(it.ch) : undefined\n        return { t: 'lit', id: id++, ch: it.ch, re, next }\n      case 'any':\n      case 'star':\n        return { t: it.t, id: id++, next }\n      case 'class':\n        return { t: 'class', id: id++, re: it.re, next }\n    }\n    const alts = (next: Node) => it.alts.map(a => seq(a, next))\n    switch (it.type) {\n      case '@':\n        return split(alts(next))\n      case '?':\n        return split([next, ...alts(next)])\n      case '!':\n        return { t: 'neg', id: id++, sub: split(alts(MATCH)), next }\n    }\n    // * and +, loop back after each match\n    const after = split([])\n    const entry = split(alts(after))\n    after.out.push(next, entry)\n    return it.type === '*' ? after : entry\n  }\n  const start = seq(items, MATCH)\n  return [start, id]\n}\n\n// one line per node, in the order that a walk from the start\n// reaches them. Edges point to node ids. The nodes of a negated\n// sub-pattern are indented under their negation.\nconst show = (start: Node): string => {\n  const lines: string[] = []\n  const seen = new Set<Node>()\n  const ref = (n: Node) => (n.t === 'match' ? 'match' : String(n.id))\n  const walk = (n: Node, indent: string) => {\n    if (n.t === 'match' || seen.has(n)) return\n    seen.add(n)\n    const line = (desc: string) => lines.push(`${indent}${n.id}: ${desc}`)\n    switch (n.t) {\n      case 'split':\n        line(`split -> ${n.out.map(ref).join(', ')}`)\n        for (const o of n.out) walk(o, indent)\n        return\n      case 'neg':\n        line(`!(${ref(n.sub)}) -> ${ref(n.next)}`)\n        walk(n.sub, indent + '  ')\n        return walk(n.next, indent)\n      case 'lit':\n        line(`${JSON.stringify(n.ch)} -> ${ref(n.next)}`)\n        break\n      case 'class':\n        line(`${n.re} -> ${ref(n.next)}`)\n        break\n      default:\n        line(`${n.t === 'any' ? '?' : '*'} -> ${ref(n.next)}`)\n    }\n    walk(n.next, indent)\n  }\n  walk(start, '')\n  return [`start -> ${ref(start)}`, ...lines].join('\\n')\n}\n\n// A thread inside a !(...) negation. It holds the threads of the\n// negated sub-pattern, started where the negation started. The\n// negation matches the chars so far if the sub-pattern does not.\ntype Run = { t: 'run'; neg: NegNode; state: State }\n\n// The threads at one position in the string. Each node thread is\n// only kept once, and runs with the same state are only kept once,\n// so that identical threads merge. The match node is not in\n// `threads`, because it can not step. It sets `match` instead.\nclass State {\n  // set by the Sim, to mark the nodes that this state has\n  gen: number\n  threads: Node[] = []\n  match = false\n  runs: Run[] = []\n  // the sorted ids of the threads, with 0 for a match, once the\n  // state is done\n  ids: number[] = []\n\n  constructor(gen: number) {\n    this.gen = gen\n  }\n\n  // no threads, so nothing more can match\n  get dead() {\n    return !this.threads.length && !this.match && !this.runs.length\n  }\n}\n\n// true if the two states hold the same threads\nconst sameState = (a: State, b: State): boolean => {\n  if (a.ids.length !== b.ids.length) return false\n  if (a.runs.length !== b.runs.length) return false\n  if (a.ids.some((id, i) => id !== b.ids[i])) return false\n  return a.runs.every(r =>\n    b.runs.some(o => o.neg === r.neg && sameState(o.state, r.state)),\n  )\n}\n\n/**\n * For each node id, the gen of the last state that has the node as\n * a thread, and of the last state that walked through it. A state is\n * built to the end before the states around it go on, and the nodes\n * of a negated sub-pattern are only in its states (other than the\n * match node, which is never marked). So one mark for each node is\n * enough to know if the state being built has it. The Sims of a\n * matcher never run at the same time, so they share one Marks.\n */\nexport type Marks = { has: Float64Array; seen: Float64Array; gen: number }\n\nconst marks = (size: number): Marks => ({\n  has: new Float64Array(size),\n  seen: new Float64Array(size),\n  gen: 0,\n})\n\nclass Sim {\n  // `.` and `..` only match literal dots, even with `dot:true`\n  dots: boolean\n  // the string starts with `.`, and `dot:true` is not set\n  dotStart: boolean\n  #marks: Marks\n\n  constructor(dots: boolean, dotStart: boolean, marks: Marks) {\n    this.dots = dots\n    this.dotStart = dotStart\n    this.#marks = marks\n  }\n\n  state() {\n    return new State(++this.#marks.gen)\n  }\n\n  // sort the ids of a state, once it has all of its threads\n  done(state: State) {\n    state.ids = state.threads.map(n => n.id).sort((a, b) => a - b)\n    if (state.match) state.ids.unshift(MATCH.id)\n    return state\n  }\n\n  // true the first time that the state walks through the node, so\n  // that loops in the graph stop\n  #visit(state: State, node: Node) {\n    const { seen } = this.#marks\n    if (seen[node.id] === state.gen) return false\n    seen[node.id] = state.gen\n    return true\n  }\n\n  #addThread(state: State, node: Node) {\n    const { has } = this.#marks\n    if (has[node.id] === state.gen) return false\n    has[node.id] = state.gen\n    state.threads.push(node)\n    return true\n  }\n\n  // wildcards only match a leading dot if `dot:true`. In a negated\n  // sub-pattern, this does not apply, because the negation itself\n  // can not match a leading dot.\n  restricted(i: number, top: boolean) {\n    return top && (this.dots || (this.dotStart && i === 0))\n  }\n\n  add(state: State, node: Node, i: number, top: boolean): void {\n    switch (node.t) {\n      case 'split':\n        if (!this.#visit(state, node)) return\n        for (const o of node.out) this.add(state, o, i, top)\n        return\n      case 'neg':\n        if (!this.#visit(state, node)) return\n        const sub = this.state()\n        this.add(sub, node.sub, i, false)\n        this.done(sub)\n        return this.addRun(\n          state,\n          { t: 'run', neg: node, state: sub },\n          i,\n          top,\n        )\n      case 'star':\n        // a * can not start a dotfile, even if it matches nothing\n        if (this.restricted(i, top)) return\n        if (this.#addThread(state, node))\n          this.add(state, node.next, i, top)\n        return\n      case 'match':\n        state.match = true\n        return\n      default:\n        this.#addThread(state, node)\n    }\n  }\n\n  addRun(state: State, run: Run, i: number, top: boolean) {\n    for (const r of state.runs) {\n      if (r.neg === run.neg && sameState(r.state, run.state)) return\n    }\n    state.runs.push(run)\n    if (!run.state.match) {\n      this.add(state, run.neg.next, i, top)\n    }\n  }\n\n  // the threads after char `c`, at index `i`\n  step(state: State, c: string, i: number, top: boolean): State {\n    const next = this.state()\n    for (const th of state.threads) {\n      switch (th.t) {\n        case 'lit':\n          if (litMatch(th, c)) {\n            this.add(next, th.next, i + 1, top)\n          }\n          break\n        case 'any':\n          if (!this.restricted(i, top)) this.add(next, th.next, i + 1, top)\n          break\n        case 'class':\n          if (!this.restricted(i, top) && th.re.test(c)) {\n            this.add(next, th.next, i + 1, top)\n          }\n          break\n        case 'star':\n          if (!this.restricted(i, top)) this.add(next, th, i + 1, top)\n      }\n    }\n    if (!this.restricted(i, top)) {\n      for (const run of state.runs) {\n        // a sub-pattern with no threads can not match again, so the\n        // run stays the same\n        if (run.state.dead) {\n          this.addRun(next, run, i + 1, top)\n          continue\n        }\n        const sub = this.step(run.state, c, i, false)\n        this.addRun(\n          next,\n          { t: 'run', neg: run.neg, state: sub },\n          i + 1,\n          top,\n        )\n      }\n    }\n    return this.done(next)\n  }\n}\n\n// A canonical key for the threads in a state. States with the same\n// key hold the same threads, so they match the same strings.\nconst stateKey = (state: State): string => {\n  const ids = state.ids.join()\n  if (!state.runs.length) return ids\n  const runs = state.runs.map(r => `${r.neg.id}(${stateKey(r.state)})`)\n  return `${ids}|${runs.sort().join('|')}`\n}\n\n// A cached state of the simulation, and the states that each char\n// leads to.\ntype DState = {\n  state: State\n  match: boolean\n  // no threads, so nothing more can match\n  dead: boolean\n  // the next state for each ASCII char, by char code, and for the\n  // other chars\n  ascii?: (DState | undefined)[]\n  next: Map<string, DState>\n}\n\n// The cache can hold about this many chars of state keys and\n// transitions. When it is full, it is cleared, so that a pattern\n// can not use an unbounded amount of memory.\nconst DFA_BUDGET = 1 << 18\n\n// A cache of the states that the simulation reaches, built as the\n// matcher is used. Each char of a string is then one Map lookup,\n// once the states that it leads to are known.\n//\n// The dot rules only restrict the first char of a dotfile (strings\n// that are only `.` or `..` do not use the cache). So a dotfile\n// starts at its own state, which takes its first step with the\n// restriction, and every other state takes steps without it.\nclass Dfa {\n  #start: Node\n  #states = new Map<string, DState>()\n  #size = 0\n  #plain?: DState\n  #dotStart?: DState\n  #sim: Sim\n  #dotSim: Sim\n\n  constructor(start: Node, marks: Marks) {\n    this.#start = start\n    this.#sim = new Sim(false, false, marks)\n    this.#dotSim = new Sim(false, true, marks)\n  }\n\n  #make(state: State): DState {\n    return {\n      state,\n      match: state.match,\n      dead: state.dead,\n      next: new Map(),\n    }\n  }\n\n  #intern(state: State): DState {\n    const key = stateKey(state)\n    const found = this.#states.get(key)\n    if (found) return found\n    if (this.#size > DFA_BUDGET) this.#clear()\n    const d = this.#make(state)\n    this.#states.set(key, d)\n    this.#size += key.length + 1\n    return d\n  }\n\n  #clear() {\n    this.#states.clear()\n    this.#size = 0\n    this.#plain = undefined\n    this.#dotStart = undefined\n  }\n\n  start(dotStart: boolean): DState {\n    if (dotStart) {\n      if (this.#dotStart) return this.#dotStart\n      const state = this.#dotSim.state()\n      this.#dotSim.add(state, this.#start, 0, true)\n      return (this.#dotStart = this.#make(this.#dotSim.done(state)))\n    }\n    if (this.#plain) return this.#plain\n    const state = this.#sim.state()\n    this.#sim.add(state, this.#start, 0, true)\n    return (this.#plain = this.#intern(this.#sim.done(state)))\n  }\n\n  // the next state, after a miss in `d.ascii`\n  next(d: DState, c: string): DState {\n    const code = c.charCodeAt(0)\n    const found = code < 128 ? undefined : d.next.get(c)\n    if (found) return found\n    // the dotfile start is not in the cache, so it is never shared\n    const n =\n      d === this.#dotStart ?\n        this.#intern(this.#dotSim.step(d.state, c, 0, true))\n      : this.#intern(this.#sim.step(d.state, c, 1, true))\n    if (code < 128) {\n      if (!d.ascii) {\n        d.ascii = new Array(128)\n        this.#size += 128\n      }\n      d.ascii[code] = n\n    } else {\n      d.next.set(c, n)\n    }\n    this.#size++\n    return n\n  }\n}\n\n/**\n * A node in a graph with no splits or negations. Such a graph is a\n * chain of nodes that each match one char, or a `*`.\n */\nexport type LinearNode = Exclude<\n  Node,\n  SplitNode | NegNode | { t: 'match' }\n>\n\n// the nodes in order, if the graph is a single chain\nconst linear = (start: Node): LinearNode[] | undefined => {\n  const nodes: LinearNode[] = []\n  for (let n = start; n.t !== 'match'; n = n.next) {\n    if (n.t === 'split' || n.t === 'neg') return undefined\n    nodes.push(n)\n  }\n  return nodes\n}\n\n// Match a chain of nodes. Each node other than `*` matches exactly\n// one char, so on a failure it is enough to go back to the last `*`\n// and let it match one more char. This takes at most\n// nodes.length * chars.length steps.\nconst testLinear = (\n  nodes: LinearNode[],\n  chars: ArrayLike<string>,\n  start: number,\n  end: number,\n) => {\n  let ni = 0\n  let ci = start\n  let starNi = -1\n  let starCi = 0\n  while (ci < end) {\n    const n = nodes[ni]\n    if (n?.t === 'star') {\n      starNi = ni++\n      starCi = ci\n      continue\n    }\n    const c = chars[ci]!\n    if (\n      n &&\n      (n.t === 'any' ||\n        (n.t === 'lit' && litMatch(n, c)) ||\n        (n.t === 'class' && n.re.test(c)))\n    ) {\n      ni++\n      ci++\n      continue\n    }\n    if (starNi === -1) return false\n    ni = starNi + 1\n    ci = ++starCi\n  }\n  while (nodes[ni]?.t === 'star') ni++\n  return ni === nodes.length\n}\n\n// The least and most chars that the items can match. These are only\n// bounds: a negation can match a string of any length, so it counts\n// as 0 to Infinity.\nconst lengths = (items: Item[]): [min: number, max: number] => {\n  let min = 0\n  let max = 0\n  for (const it of items) {\n    const [lo, hi] = itemLengths(it)\n    min += lo\n    max += hi\n  }\n  return [min, max]\n}\n\nconst itemLengths = (it: Item): [min: number, max: number] => {\n  if (it.t === 'star') return [0, Infinity]\n  if (it.t !== 'ext') return [1, 1]\n  if (it.type === '!') return [0, Infinity]\n  const alts = it.alts.map(lengths)\n  const min = Math.min(...alts.map(a => a[0]))\n  const max = Math.max(...alts.map(a => a[1]))\n  // a loop of alternatives that only match the empty string is empty\n  const loop = max === 0 ? 0 : Infinity\n  return (\n    it.type === '@' ? [min, max]\n    : it.type === '?' ? [0, max]\n    : it.type === '*' ? [0, loop]\n    : [min, loop]\n  )\n}\n\n// true if the chars from `start` match the literals\nconst hasAffix = (\n  lits: Lit[],\n  chars: ArrayLike<string>,\n  start: number,\n) => {\n  for (let j = 0; j < lits.length; j++) {\n    if (!litMatch(lits[j]!, chars[start + j]!)) return false\n  }\n  return true\n}\n\n// a `/`, or half of a surrogate pair\nconst slashOrSurrogate = /[/\\ud800-\\udfff]/\nconst surrogate = /[\\ud800-\\udfff]/\n\n// a string can be indexed by code point, unless it has surrogate\n// pairs\nconst codePoints = (s: string): ArrayLike<string> =>\n  surrogate.test(s) ? [...s] : s\n\nconst noSlash = (s: string) => {\n  if (s.includes('/')) {\n    throw new Error('can only match a single path portion, got: ' + s)\n  }\n}\n\nexport class Matcher {\n  pattern: string\n  options: MatcherOptions\n  #start: Node\n  // the number of node ids\n  #size: number\n  #marks?: Marks\n  // the Sim for strings that are only `.` or `..`\n  #dotsSim?: Sim\n  // the string to compare, if the pattern has no magic. With\n  // `nocase:true`, the RegExp that folds case is made when it is\n  // first used.\n  #literal?: string\n  #literalFold = false\n  #literalRe?: RegExp\n  // the nodes between the prefix and suffix, if the graph is a\n  // single chain\n  #linear?: LinearNode[]\n  // the linear nodes are only `*` and `?`, so the length bounds and\n  // the prefix and suffix decide the match\n  #wild = false\n  // the least and most chars that a match can have\n  #min = 0\n  #max = Infinity\n  // the literals that a match must start and end with. Each one\n  // matches exactly one char, and they are distinct items in the\n  // pattern, so a string that does not have them can not match.\n  #prefix: Lit[] = []\n  #suffix: Lit[] = []\n  // the prefix and suffix as strings, if they do not fold case\n  #prefixStr?: string\n  #suffixStr?: string\n  // there is a prefix or suffix to check\n  #affix = false\n  #dfa?: Dfa\n  #form?: Form\n\n  constructor(pattern: string, options: MatcherOptions = {}) {\n    if (pattern.includes('/')) {\n      throw new Error(\n        'can only match a single path portion, got pattern: ' + pattern,\n      )\n    }\n    this.pattern = pattern\n    this.options = options\n    const { nocase = false, noext = false, normalize: n } = options\n    this.#form = n === true ? 'NFC' : n || undefined\n    // a pattern that is only an empty extglob is a literal string,\n    // except for `!()`, which matches any non-empty string\n    const literal = /^[?*+@]\\(\\)$/.test(pattern)\n    const toks = tokenize(pattern, nocase, noext || literal, this.#form)\n    let [items] = build(toks, pair(toks), 0, toks.length, true)\n    if (this.#form) items = normalize(items!, this.#form)\n    const [start, size] = compile(items!, nocase)\n    this.#start = start\n    this.#size = size\n    if (items!.every(it => it.t === 'lit')) {\n      this.#literal = items!.map(it => it.ch).join('')\n      this.#literalFold = nocase\n    } else {\n      const lit = (it: Item): Lit | undefined =>\n        it.t !== 'lit' ? undefined\n        : nocase ? { ch: it.ch, re: foldRe(it.ch) }\n        : { ch: it.ch }\n      for (const it of items!) {\n        const l = lit(it)\n        if (!l) break\n        this.#prefix.push(l)\n      }\n      for (let j = items!.length - 1; j >= 0; j--) {\n        const l = lit(items![j]!)\n        if (!l) break\n        this.#suffix.unshift(l)\n      }\n      this.#affix = !!(this.#prefix.length || this.#suffix.length)\n      if (!nocase) {\n        this.#prefixStr = this.#prefix.map(l => l.ch).join('')\n        this.#suffixStr = this.#suffix.map(l => l.ch).join('')\n      }\n      this.#linear = linear(this.#start)?.slice(\n        this.#prefix.length,\n        -this.#suffix.length || undefined,\n      )\n      this.#wild = !!this.#linear?.every(\n        n => n.t === 'star' || n.t === 'any',\n      )\n      const [min, max] = lengths(items!)\n      this.#min = min\n      this.#max = max\n    }\n  }\n\n  test(s: string): boolean {\n    // The `/` check uses the string as given, so with normalization it\n    // is a separate step. Otherwise, one scan finds both a `/` and the\n    // surrogate pairs that stop the string being indexed by code point.\n    if (this.#form) {\n      noSlash(s)\n      return this.#test(s.normalize(this.#form))\n    }\n    if (slashOrSurrogate.test(s)) {\n      noSlash(s)\n      return this.#test(s, [...s])\n    }\n    return this.#test(s, s)\n  }\n\n  /**\n   * The same as {@link Matcher#test}, but the string is not checked\n   * for `/` chars, so the result for a string that has one is not\n   * defined. Only use it for a string that is known to be one path\n   * portion, such as a part of a path that was split on `/`. It can\n   * be faster, because some patterns do not need to look at each char\n   * of the string.\n   */\n  testUnchecked(s: string): boolean {\n    return this.#test(this.#form ? s.normalize(this.#form) : s)\n  }\n\n  // Test a string that has no `/`. `chars` indexes it by code point.\n  // If it is not given, it is only found if a step needs it.\n  #test(s: string, chars?: ArrayLike<string>): boolean {\n    if (this.#literal !== undefined) {\n      return this.#literalFold ?\n          (this.#literalRe ??= newFoldRe(this.#literal)).test(s)\n        : s === this.#literal\n    }\n    // the length check means that the prefix and suffix do not\n    // overlap. Without the chars, the length in code points is from\n    // half of the UTF-16 length (if each one is a surrogate pair) to\n    // all of it, which is often enough to know.\n    const min = this.#min\n    const max = this.#max\n    if (chars === undefined) {\n      const most = s.length\n      const least = (most + 1) >> 1\n      if (most < min || least > max) return false\n      if (least < min || most > max) chars = codePoints(s)\n    }\n    if (\n      chars !== undefined &&\n      (chars.length < min || chars.length > max)\n    ) {\n      return false\n    }\n    const prefix = this.#prefix.length\n    if (this.#affix) {\n      if (this.#prefixStr !== undefined && this.#suffixStr !== undefined) {\n        if (\n          !s.startsWith(this.#prefixStr) ||\n          !s.endsWith(this.#suffixStr)\n        ) {\n          return false\n        }\n      } else {\n        chars ??= codePoints(s)\n        const end = chars.length - this.#suffix.length\n        if (\n          !hasAffix(this.#prefix, chars, 0) ||\n          !hasAffix(this.#suffix, chars, end)\n        ) {\n          return false\n        }\n      }\n    }\n    const dotStart = !this.options.dot && s.startsWith('.')\n    if (this.#linear) {\n      // `.` and `..` only match literal dots, even with `dot:true`\n      if (s === '.' || s === '..') return false\n      // only a literal can match the leading dot. A `*` can not\n      // start a dotfile, even if it matches nothing.\n      if (dotStart && !prefix) return false\n      if (this.#wild) return true\n      chars ??= codePoints(s)\n      const end = chars.length - this.#suffix.length\n      return testLinear(this.#linear, chars, prefix, end)\n    }\n    chars ??= codePoints(s)\n    if (s === '.' || s === '..') {\n      this.#marks ??= marks(this.#size)\n      const sim = (this.#dotsSim ??= new Sim(true, false, this.#marks))\n      const start = sim.state()\n      sim.add(start, this.#start, 0, true)\n      let state = sim.done(start)\n      for (let i = 0; i < chars.length; i++) {\n        state = sim.step(state, chars[i]!, i, true)\n      }\n      return state.match\n    }\n    this.#marks ??= marks(this.#size)\n    const dfa = (this.#dfa ??= new Dfa(this.#start, this.#marks))\n    let d = dfa.start(dotStart)\n    // read char codes from the string, so that a one-char string is\n    // only made for a cache miss\n    const str = chars === s\n    for (let i = 0; i < chars.length; i++) {\n      if (d.dead) return false\n      const code = str ? s.charCodeAt(i) : chars[i]!.charCodeAt(0)\n      d = d.ascii?.[code] ?? dfa.next(d, chars[i]!)\n    }\n    return d.match\n  }\n\n  /** a readable listing of the state machine */\n  toString(): string {\n    return show(this.#start)\n  }\n}\n"]}