@vibgrate/cli 2026.807.1 → 2026.814.1

package/dist/chunk-7CYFCSY2.js.map

@@ -1 +0,0 @@
-{"version":3,"sources":["../src/engine/relations.ts","../src/engine/query.ts","../src/engine/impact.ts"],"names":["push","l","v","affinity","text","round"],"mappings":";;;;AAGO,IAAM,aAAN,MAAiB;AAAA,EAKtB,YAAqB,KAAA,EAAgB;AAAhB,IAAA,IAAA,CAAA,KAAA,GAAA,KAAA;AACnB,IAAA,KAAA,MAAW,CAAA,IAAK,MAAM,KAAA,EAAO,IAAA,CAAK,SAAS,GAAA,CAAI,CAAA,CAAE,IAAI,CAAC,CAAA;AACtD,IAAA,KAAA,MAAW,CAAA,IAAK,MAAM,KAAA,EAAO;AAC3B,MAAA,IAAA,CAAK,IAAA,CAAK,OAAA,EAAS,CAAA,CAAE,GAAA,EAAK,CAAC,CAAA;AAC3B,MAAA,IAAA,CAAK,IAAA,CAAK,MAAA,EAAQ,CAAA,CAAE,GAAA,EAAK,CAAC,CAAA;AAAA,IAC5B;AAAA,EACF;AAAA,EANqB,KAAA;AAAA,EAJZ,QAAA,uBAAe,GAAA,EAAuB;AAAA,EACvC,OAAA,uBAAc,GAAA,EAAyB;AAAA,EACvC,MAAA,uBAAa,GAAA,EAAyB;AAAA,EAU9C,GAAA,CAAI,IAAY,IAAA,EAA8B;AAC5C,IAAA,MAAM,MAAM,IAAA,CAAK,OAAA,CAAQ,GAAA,CAAI,EAAE,KAAK,EAAC;AACrC,IAAA,OAAO,IAAA,GAAO,IAAI,MAAA,CAAO,CAAC,MAAM,CAAA,CAAE,IAAA,KAAS,IAAI,CAAA,GAAI,GAAA;AAAA,EACrD;AAAA,EAEA,EAAA,CAAG,IAAY,IAAA,EAA8B;AAC3C,IAAA,MAAM,MAAM,IAAA,CAAK,MAAA,CAAO,GAAA,CAAI,EAAE,KAAK,EAAC;AACpC,IAAA,OAAO,IAAA,GAAO,IAAI,MAAA,CAAO,CAAC,MAAM,CAAA,CAAE,IAAA,KAAS,IAAI,CAAA,GAAI,GAAA;AAAA,EACrD;AAAA,EAEA,KAAK,EAAA,EAAmC;AACtC,IAAA,OAAO,IAAA,CAAK,QAAA,CAAS,GAAA,CAAI,EAAE,CAAA;AAAA,EAC7B;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EASA,QAAQ,EAAA,EAAoD;AAC1D,IAAA,OAAO,IAAA,CAAK,eAAe,IAAA,CAAK,GAAA,CAAI,EAAE,CAAA,CAAE,MAAA,CAAO,WAAW,CAAA,EAAG,KAAK,CAAA;AAAA,EACpE;AAAA;AAAA,EAGA,QAAQ,EAAA,EAAoD;AAC1D,IAAA,OAAO,IAAA,CAAK,eAAe,IAAA,CAAK,EAAA,CAAG,EAAE,CAAA,CAAE,MAAA,CAAO,WAAW,CAAA,EAAG,KAAK,CAAA;AAAA,EACnE;AAAA,EAEQ,cAAA,CAAe,OAAoB,GAAA,EAAoB;AAC7D,IAAA,MAAM,MAA8C,EAAC;AACrD,IAAA,KAAA,MAAW,KAAK,KAAA,EAAO;AACrB,MAAA,MAAM,OAAO,IAAA,CAAK,QAAA,CAAS,GAAA,CAAI,CAAA,CAAE,GAAG,CAAC,CAAA;AACrC,MAAA,IAAI,MAAM,GAAA,CAAI,IAAA,CAAK,EAAE,IAAA,EAAM,CAAA,EAAG,MAAM,CAAA;AAAA,IACtC;AACA,IAAA,OAAO,GAAA;AAAA,EACT;AACF;AAEA,IAAM,8BAAqC,IAAI,GAAA,CAAI,CAAC,MAAA,EAAQ,YAAY,CAAC,CAAA;AACzE,SAAS,YAAY,CAAA,EAAuB;AAC1C,EAAA,OAAO,WAAA,CAAY,GAAA,CAAI,CAAA,CAAE,IAAI,CAAA;AAC/B;AAEA,SAAS,IAAA,CAAK,GAAA,EAA+B,GAAA,EAAa,KAAA,EAAwB;AAChF,EAAA,MAAM,IAAA,GAAO,GAAA,CAAI,GAAA,CAAI,GAAG,CAAA;AACxB,EAAA,IAAI,IAAA,EAAM,IAAA,CAAK,IAAA,CAAK,KAAK,CAAA;AAAA,OACpB,GAAA,CAAI,GAAA,CAAI,GAAA,EAAK,CAAC,KAAK,CAAC,CAAA;AAC3B;AAoBA,IAAM,WAAA,uBAAkB,OAAA,EAA6B;AAE9C,SAAS,SAAS,KAAA,EAA4B;AACnD,EAAA,IAAI,GAAA,GAAM,WAAA,CAAY,GAAA,CAAI,KAAK,CAAA;AAC/B,EAAA,IAAI,CAAC,GAAA,EAAK;AACR,IAAA,GAAA,GAAM,IAAI,WAAW,KAAK,CAAA;AAC1B,IAAA,WAAA,CAAY,GAAA,CAAI,OAAO,GAAG,CAAA;AAAA,EAC5B;AACA,EAAA,OAAO,GAAA;AACT;;;ACxCA,IAAM,SAAA,uBAAgB,GAAA,CAAI;AAAA,EACxB,KAAA;AAAA,EAAO,GAAA;AAAA,EAAK,IAAA;AAAA,EAAM,IAAA;AAAA,EAAM,KAAA;AAAA,EAAO,KAAA;AAAA,EAAO,MAAA;AAAA,EAAQ,IAAA;AAAA,EAAM,IAAA;AAAA,EAAM,IAAA;AAAA,EAAM,IAAA;AAAA,EAAM,IAAA;AAAA,EAAM,KAAA;AAAA,EAAO,KAAA;AAAA,EAAO,IAAA;AAAA,EAC1F,OAAA;AAAA,EAAS,MAAA;AAAA,EAAQ,OAAA;AAAA,EAAS,KAAA;AAAA,EAAO,IAAA;AAAA,EAAM,MAAA;AAAA,EAAQ,KAAA;AAAA,EAAO,GAAA;AAAA,EAAK,IAAA;AAAA,EAAM,IAAA;AAAA,EAAM,MAAA;AAAA,EAAQ,MAAA;AAAA,EAAQ,MAAA;AAAA,EACvF,MAAA;AAAA,EAAQ,KAAA;AAAA,EAAO,KAAA;AAAA,EAAO,KAAA;AAAA,EAAO,QAAA;AAAA,EAAU,IAAA;AAAA,EAAM,KAAA;AAAA,EAAO,KAAA;AAAA,EAAO,MAAA;AAAA,EAAQ,MAAA;AAAA,EAAQ,IAAA;AAAA,EAAM,IAAA;AAAA,EAAM,IAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAQvF,MAAA;AAAA,EAAQ,MAAA;AAAA,EAAQ,aAAA;AAAA,EAAe,MAAA;AAAA,EAAQ,QAAA;AAAA,EAAU,IAAA;AAAA,EACjD,gBAAA;AAAA,EAAkB,SAAA;AAAA,EAAW,OAAA;AAAA,EAAS,UAAA;AAAA,EAAY,UAAA;AAAA,EAAY,MAAA;AAAA;AAAA;AAAA;AAAA,EAI9D,KAAA;AAAA,EAAO,IAAA;AAAA,EAAM,OAAA;AAAA,EAAS,QAAA;AAAA,EAAU,UAAA;AAAA,EAAY,YAAA;AAAA,EAAc,aAAA;AAAA,EAC1D,WAAA;AAAA,EAAa,YAAA;AAAA,EAAc,OAAA;AAAA,EAAS,OAAA;AAAA,EAAS,QAAA;AAAA,EAAU,QAAA;AAAA,EAAU,SAAA;AAAA,EACjE,MAAA;AAAA,EAAQ,QAAA;AAAA,EAAU,QAAA;AAAA,EAAU,MAAA;AAAA,EAAQ,SAAA;AAAA,EAAW,MAAA;AAAA,EAAQ,MAAA;AAAA,EAAQ;AACjE,CAAC,CAAA;AAQD,SAAS,eAAe,GAAA,EAAqB;AAC3C,EAAA,IAAI,CAAA,GAAI,IAAI,IAAA,EAAK;AAEjB,EAAA,CAAA,GAAI,CAAA,CAAE,OAAA,CAAQ,iBAAA,EAAmB,EAAE,CAAA;AAEnC,EAAA,IAAI,CAAA,CAAE,QAAA,CAAS,GAAG,CAAA,EAAG;AACnB,IAAA,MAAM,EAAA,GAAK,CAAA,CAAE,WAAA,CAAY,GAAG,CAAA;AAC5B,IAAA,IAAI,EAAA,KAAO,EAAE,MAAA,GAAS,CAAA,MAAO,CAAA,CAAE,KAAA,CAAM,GAAG,EAAE,CAAA;AAAA,EAC5C;AACA,EAAA,OAAO,CAAA;AACT;AASO,SAAS,sBAAsB,QAAA,EAA4B;AAChE,EAAA,MAAM,MAAgB,EAAC;AACvB,EAAA,MAAM,IAAA,uBAAW,GAAA,EAAY;AAC7B,EAAA,MAAMA,KAAAA,GAAO,CAAC,GAAA,EAAa,IAAA,KAA0B;AACnD,IAAA,IAAI,CAAA,GAAI,IAAI,IAAA,EAAK;AACjB,IAAA,CAAA,GAAI,IAAA,KAAS,QAAQ,cAAA,CAAe,CAAC,IAAI,CAAA,CAAE,OAAA,CAAQ,oBAAoB,EAAE,CAAA;AACzE,IAAA,IAAI,EAAE,MAAA,GAAS,CAAA,IAAK,IAAA,CAAK,GAAA,CAAI,CAAC,CAAA,EAAG;AACjC,IAAA,IAAA,CAAK,IAAI,CAAC,CAAA;AACV,IAAA,GAAA,CAAI,KAAK,CAAC,CAAA;AAAA,EACZ,CAAA;AACA,EAAA,KAAA,MAAW,CAAA,IAAK,QAAA,CAAS,QAAA,CAAS,0BAA0B,CAAA,EAAGA,KAAAA,CAAK,CAAA,CAAE,CAAC,CAAA,EAAI,KAAK,CAAA;AAChF,EAAA,KAAA,MAAW,CAAA,IAAK,QAAA,CAAS,QAAA,CAAS,qCAAqC,CAAA,EAAG;AACxE,IAAAA,KAAAA,CAAK,EAAE,CAAC,CAAA,CAAG,QAAQ,QAAA,EAAU,IAAI,GAAG,OAAO,CAAA;AAAA,EAC7C;AACA,EAAA,OAAO,GAAA;AACT;AAGO,SAAS,oBAAoB,QAAA,EAA0B;AAC5D,EAAA,IAAI,CAAA,GAAI,QAAA;AAER,EAAA,KAAA,MAAW,CAAA,IAAK,QAAA,CAAS,QAAA,CAAS,0BAA0B,CAAA,EAAG;AAC7D,IAAA,CAAA,GAAI,EAAE,KAAA,CAAM,CAAA,CAAE,CAAC,CAAE,CAAA,CAAE,KAAK,GAAG,CAAA;AAAA,EAC7B;AACA,EAAA,KAAA,MAAW,GAAA,IAAO,qBAAA,CAAsB,QAAQ,CAAA,EAAG;AACjD,IAAA,CAAA,GAAI,CAAA,CAAE,KAAA,CAAM,GAAG,CAAA,CAAE,KAAK,GAAG,CAAA;AAAA,EAC3B;AAEA,EAAA,CAAA,GAAI,CAAA,CAAE,OAAA,CAAQ,eAAA,EAAiB,GAAG,CAAA;AAClC,EAAA,OAAO,CAAA,CAAE,OAAA,CAAQ,MAAA,EAAQ,GAAG,EAAE,IAAA,EAAK;AACrC;AAOO,SAAS,wBAAwB,QAAA,EAA0B;AAChE,EAAA,MAAM,QAAA,GAAW,sBAAsB,QAAQ,CAAA;AAC/C,EAAA,IAAI,QAAA,CAAS,MAAA,KAAW,CAAA,EAAG,OAAO,SAAS,IAAA,EAAK;AAChD,EAAA,MAAM,QAAA,GAAW,oBAAoB,QAAQ,CAAA;AAC7C,EAAA,OAAO,QAAA,CAAS,QAAQ,CAAA,CAAE,MAAA,KAAW,IAAI,EAAA,GAAK,QAAA;AAChD;AAOO,SAAS,wBAAwB,WAAA,EAA8B;AACpE,EAAA,MAAM,CAAA,GAAI,YAAY,IAAA,EAAK;AAC3B,EAAA,IAAI,CAAC,GAAG,OAAO,KAAA;AACf,EAAA,MAAM,OAAA,GAAU,sBAAsB,CAAC,CAAA;AACvC,EAAA,MAAM,iBACJ,6HAAA,CAA8H,IAAA;AAAA,IAC5H;AAAA,OAED,OAAA,CAAQ,MAAA,GAAS,CAAA,IAAK,eAAA,CAAgB,KAAK,CAAC,CAAA;AAE/C,EAAA,MAAM,YAAA,GAAe,CAAA,CAAE,OAAA,CAAQ,0BAAA,EAA4B,GAAG,CAAA;AAC9D,EAAA,IACE,qHAAA,CAAsH,IAAA;AAAA,IACpH;AAAA,GACF,EACA;AACA,IAAA,OAAO,KAAA;AAAA,EACT;AACA,EAAA,IAAI,OAAA,CAAQ,KAAK,CAAC,CAAA,KAAM,gBAAgB,IAAA,CAAK,CAAC,CAAC,CAAA,EAAG,OAAO,IAAA;AACzD,EAAA,OAAO,cAAA,IAAkB,QAAQ,MAAA,GAAS,CAAA;AAC5C;AAEO,SAAS,UAAA,CAAW,KAAA,EAAgB,QAAA,EAAkB,OAAA,GAAwB,EAAC,EAAgB;AACpG,EAAA,MAAM,MAAA,GAAS,QAAQ,MAAA,IAAU,GAAA;AACjC,EAAA,MAAM,KAAA,GAAQ,QAAQ,KAAA,IAAS,EAAA;AAI/B,EAAA,MAAM,QAAA,GAAW,sBAAsB,QAAQ,CAAA;AAC/C,EAAA,MAAM,YAAY,QAAA,CAAS,MAAA,GAAS,CAAA,GAAI,mBAAA,CAAoB,QAAQ,CAAA,GAAI,QAAA;AACxE,EAAA,MAAM,IAAA,GAAO,aAAa,SAAA,EAAW,OAAA,CAAQ,WAAW,aAAA,CAAc,OAAA,CAAQ,aAAa,CAAC,CAAA;AAC5F,EAAA,MAAM,QAAA,GAAW,WAAA,CAAY,KAAA,EAAO,IAAA,CAAK,KAAA,CAAM,IAAI,CAAC,CAAA,KAAM,CAAA,CAAE,IAAI,CAAC,CAAA;AACjE,EAAA,MAAM,KAAA,GAAQ,SAAS,KAAK,CAAA;AAE5B,EAAA,MAAM,SAAuB,EAAC;AAK9B,EAAA,IAAI,KAAK,UAAA,EAAY;AACnB,IAAA,KAAA,MAAW,IAAA,IAAQ,MAAM,KAAA,EAAO;AAC9B,MAAA,IAAI,IAAA,CAAK,IAAA,KAAS,MAAA,IAAU,IAAA,CAAK,SAAS,UAAA,EAAY;AACtD,MAAA,MAAM,EAAE,OAAO,GAAA,EAAI,GAAI,UAAU,IAAA,EAAM,IAAA,CAAK,OAAO,QAAQ,CAAA;AAC3D,MAAA,IAAI,QAAQ,CAAA,EAAG;AACb,QAAA,MAAM,WAAW,aAAA,CAAc,IAAA,CAAK,IAAI,OAAA,CAAQ,SAAA,EAAW,QAAQ,SAAS,CAAA;AAC5E,QAAA,MAAA,CAAO,IAAA,CAAK;AAAA,UACV,IAAA;AAAA,UACA,KAAA,EAAO,MAAM,KAAA,GAAQ,QAAA,CAAS,SAAS,CAAA,GAAI,iBAAA,GAAoB,KAAK,UAAA,CAAW,CAAA;AAAA,UAC/E,GAAA,EAAK,MAAM,QAAA,CAAS;AAAA,SACrB,CAAA;AAAA,MACH;AAAA,IACF;AACA,IAAA,MAAA,CAAO,IAAA,CAAK,CAAC,CAAA,EAAG,CAAA,KAAM,EAAE,KAAA,GAAQ,CAAA,CAAE,KAAA,IAAS,CAAA,CAAE,KAAK,aAAA,CAAc,aAAA,CAAc,CAAA,CAAE,IAAA,CAAK,aAAa,CAAC,CAAA;AAAA,EACrG;AAEA,EAAA,MAAM,KAAA,GAAQ,MAAA,CAAO,KAAA,CAAM,CAAA,EAAG,KAAK,CAAA;AACnC,EAAA,MAAM,EAAE,OAAA,EAAS,cAAA,EAAe,GAAI,YAAA,CAAa,OAAO,KAAA,EAAO,QAAA,EAAU,KAAA,EAAO,MAAA,EAAQ,QAAQ,CAAA;AAEhG,EAAA,OAAO,EAAE,QAAA,EAAU,OAAA,EAAS,KAAA,EAAO,SAAS,cAAA,EAAe;AAC7D;AAeA,IAAM,KAAA,GAAQ,EAAA;AAGd,SAAS,OAAA,CAAQ,QAA6B,MAAA,EAAqD;AACjG,EAAA,MAAM,GAAA,GAAM,CAAC,GAAG,MAAA,CAAO,SAAS,CAAA,CAC7B,OAAO,CAAC,GAAG,CAAC,CAAA,KAAM,IAAI,CAAC,CAAA,CACvB,KAAK,CAAC,CAAA,EAAG,MAAM,CAAA,CAAE,CAAC,IAAI,CAAA,CAAE,CAAC,KAAK,MAAA,CAAO,CAAA,CAAE,CAAC,CAAC,CAAA,CAAE,cAAc,MAAA,CAAO,CAAA,CAAE,CAAC,CAAC,CAAC,CAAC,CAAA,CACtE,GAAA,CAAI,CAAC,CAAC,EAAE,MAAM,EAAE,CAAA;AACnB,EAAA,OAAO,IAAI,GAAA,CAAI,GAAA,CAAI,GAAA,CAAI,CAAC,EAAA,EAAI,CAAA,KAAM,CAAC,EAAA,EAAI,CAAA,GAAI,CAAC,CAAC,CAAC,CAAA;AAChD;AAUA,eAAsB,kBAAA,CACpB,KAAA,EACA,QAAA,EACA,OAAA,EACsB;AACtB,EAAA,MAAM,MAAA,GAAS,QAAQ,MAAA,IAAU,GAAA;AACjC,EAAA,MAAM,KAAA,GAAQ,QAAQ,KAAA,IAAS,EAAA;AAC/B,EAAA,MAAM,QAAA,GAAW,sBAAsB,QAAQ,CAAA;AAC/C,EAAA,MAAM,YAAY,QAAA,CAAS,MAAA,GAAS,CAAA,GAAI,mBAAA,CAAoB,QAAQ,CAAA,GAAI,QAAA;AACxE,EAAA,MAAM,IAAA,GAAO,aAAa,SAAA,EAAW,OAAA,CAAQ,WAAW,aAAA,CAAc,OAAA,CAAQ,aAAa,CAAC,CAAA;AAC5F,EAAA,MAAM,QAAQ,IAAA,CAAK,KAAA,CAAM,IAAI,CAAC,CAAA,KAAM,EAAE,IAAI,CAAA;AAC1C,EAAA,MAAM,QAAA,GAAW,WAAA,CAAY,KAAA,EAAO,KAAK,CAAA;AACzC,EAAA,MAAM,KAAA,GAAQ,SAAS,KAAK,CAAA;AAG5B,EAAA,MAAM,WAAW,MAAM,OAAA,CAAQ,QAAA,CAAS,UAAA,CAAW,aAAa,QAAQ,CAAA;AAKxE,EAAA,MAAM,MAAA,uBAAa,GAAA,EAAoB;AACvC,EAAA,MAAM,OAAA,uBAAc,GAAA,EAAoB;AACxC,EAAA,IAAI,KAAK,UAAA,EAAY;AACnB,IAAA,KAAA,MAAW,IAAA,IAAQ,MAAM,KAAA,EAAO;AAC9B,MAAA,IAAI,IAAA,CAAK,IAAA,KAAS,MAAA,IAAU,IAAA,CAAK,SAAS,UAAA,EAAY;AACtD,MAAA,MAAM,EAAE,OAAO,GAAA,EAAI,GAAI,UAAU,IAAA,EAAM,IAAA,CAAK,OAAO,QAAQ,CAAA;AAC3D,MAAA,MAAA,CAAO,GAAA,CAAI,IAAA,CAAK,EAAA,EAAI,KAAK,CAAA;AACzB,MAAA,OAAA,CAAQ,GAAA,CAAI,IAAA,CAAK,EAAA,EAAI,GAAG,CAAA;AAAA,IAC1B;AAAA,EACF;AAEA,EAAA,MAAM,SAAuB,EAAC;AAG9B,EAAA,IAAI,KAAA,CAAM,MAAA,GAAS,CAAA,IAAK,QAAA,CAAS,WAAW,CAAA,EAAG;AAE7C,IAAA,MAAM,MAAA,uBAAa,GAAA,EAAoB;AACvC,IAAA,MAAM,QAAA,uBAAe,GAAA,EAAuB;AAC5C,IAAA,KAAA,MAAW,IAAA,IAAQ,MAAM,KAAA,EAAO;AAC9B,MAAA,IAAI,IAAA,CAAK,IAAA,KAAS,MAAA,IAAU,IAAA,CAAK,SAAS,UAAA,EAAY;AACtD,MAAA,QAAA,CAAS,GAAA,CAAI,IAAA,CAAK,EAAA,EAAI,IAAI,CAAA;AAC1B,MAAA,MAAM,GAAA,GAAM,OAAA,CAAQ,WAAA,CAAY,GAAA,CAAI,KAAK,EAAE,CAAA;AAC3C,MAAA,MAAM,GAAA,GAAM,GAAA,IAAO,KAAA,CAAM,MAAA,GAAS,CAAA,GAAI,IAAA,CAAK,GAAA,CAAI,CAAA,EAAG,MAAA,CAAO,QAAA,EAAU,GAAG,CAAC,CAAA,GAAI,CAAA;AAC3E,MAAA,IAAI,MAAM,CAAA,EAAG,MAAA,CAAO,GAAA,CAAI,IAAA,CAAK,IAAI,GAAG,CAAA;AAAA,IACtC;AACA,IAAA,MAAM,SAAS,CAAC,EAAA,KAAe,SAAS,GAAA,CAAI,EAAE,GAAG,aAAA,IAAiB,EAAA;AAClE,IAAA,MAAM,QAAA,GAAW,OAAA,CAAQ,MAAA,EAAQ,MAAM,CAAA;AACvC,IAAA,MAAM,QAAA,GAAW,OAAA,CAAQ,MAAA,EAAQ,MAAM,CAAA;AACvC,IAAA,KAAA,MAAW,CAAC,EAAA,EAAI,IAAI,CAAA,IAAK,QAAA,EAAU;AACjC,MAAA,MAAM,EAAA,GAAK,QAAA,CAAS,GAAA,CAAI,EAAE,CAAA;AAC1B,MAAA,MAAM,EAAA,GAAK,QAAA,CAAS,GAAA,CAAI,EAAE,CAAA;AAC1B,MAAA,IAAI,EAAA,KAAO,MAAA,IAAa,EAAA,KAAO,MAAA,EAAW;AAC1C,MAAA,MAAM,KAAA,GAAA,CAAS,EAAA,KAAO,MAAA,GAAY,CAAA,IAAK,KAAA,GAAQ,EAAA,CAAA,GAAM,CAAA,KAAM,EAAA,KAAO,MAAA,GAAY,CAAA,IAAK,KAAA,GAAQ,EAAA,CAAA,GAAM,CAAA,CAAA;AACjG,MAAA,MAAM,GAAA,GAAM,MAAA,CAAO,GAAA,CAAI,EAAE,CAAA,IAAK,CAAA;AAC9B,MAAA,MAAM,MAAA,GAAS,OAAA,CAAQ,GAAA,CAAI,EAAE,CAAA;AAC7B,MAAA,MAAM,WAAW,aAAA,CAAc,EAAA,EAAI,OAAA,CAAQ,SAAA,EAAW,QAAQ,SAAS,CAAA;AACvE,MAAA,MAAM,GAAA,GAAA,CAAO,MAAA,KAAW,GAAA,GAAM,GAAA,GAAM,CAAA,gBAAA,EAAmB,GAAA,CAAI,OAAA,CAAQ,CAAC,CAAC,CAAA,CAAA,CAAA,GAAM,YAAA,CAAA,IAAiB,QAAA,CAAS,KAAA;AACrG,MAAA,MAAA,CAAO,IAAA,CAAK,EAAE,IAAA,EAAM,KAAA,EAAO,MAAM,KAAA,GAAQ,QAAA,CAAS,KAAA,IAAS,CAAA,GAAI,iBAAA,GAAoB,IAAA,CAAK,UAAA,CAAW,CAAA,EAAG,KAAK,CAAA;AAAA,IAC7G;AACA,IAAA,MAAA,CAAO,IAAA,CAAK,CAAC,CAAA,EAAG,CAAA,KAAM,EAAE,KAAA,GAAQ,CAAA,CAAE,KAAA,IAAS,CAAA,CAAE,KAAK,aAAA,CAAc,aAAA,CAAc,CAAA,CAAE,IAAA,CAAK,aAAa,CAAC,CAAA;AAAA,EACrG;AAEA,EAAA,MAAM,KAAA,GAAQ,MAAA,CAAO,KAAA,CAAM,CAAA,EAAG,KAAK,CAAA;AACnC,EAAA,MAAM,EAAE,OAAA,EAAS,cAAA,EAAe,GAAI,YAAA,CAAa,OAAO,KAAA,EAAO,QAAA,EAAU,KAAA,EAAO,MAAA,EAAQ,QAAQ,CAAA;AAChG,EAAA,OAAO,EAAE,QAAA,EAAU,OAAA,EAAS,KAAA,EAAO,SAAS,cAAA,EAAe;AAC7D;AAaA,SAAS,SAAS,CAAA,EAAqB;AACrC,EAAA,OAAO;AAAA,IACL,GAAG,IAAI,GAAA;AAAA,MACL,EACG,WAAA,EAAY,CACZ,KAAA,CAAM,iBAAiB,EACvB,MAAA,CAAO,CAAC,CAAA,KAAM,CAAA,CAAE,UAAU,CAAA,IAAK,CAAC,SAAA,CAAU,GAAA,CAAI,CAAC,CAAC;AAAA;AACrD,GACF;AACF;AAIA,SAAS,gBAAgB,CAAA,EAAqB;AAC5C,EAAA,OAAO,CAAA,CACJ,WAAA,EAAY,CACZ,KAAA,CAAM,iBAAiB,CAAA,CACvB,MAAA,CAAO,CAAC,CAAA,KAAM,CAAA,CAAE,MAAA,IAAU,CAAC,CAAA;AAChC;AAgCA,IAAM,gBAAA,GAAmB,IAAA;AAEzB,IAAM,gBAAA,GAAmB,GAAA;AAIzB,IAAM,cAAA,GAAiB,IAAA;AAKvB,IAAM,YAAA,GAAe,GAAA;AAGrB,SAAS,YAAA,CAAa,SAAA,EAAmB,SAAA,EAAsC,KAAA,EAAsC;AACnH,EAAA,MAAM,IAAA,GAAO,SAAS,SAAS,CAAA;AAC/B,EAAA,MAAM,OAAA,GAAU,gBAAgB,SAAS,CAAA;AACzC,EAAA,MAAM,OAAA,GAAU,IAAI,GAAA,CAAI,IAAI,CAAA;AAI5B,EAAA,MAAM,QAAA,GAAW,qBAAqB,OAAO,CAAA;AAC7C,EAAA,MAAM,QAAqB,IAAA,CAAK,GAAA,CAAI,CAAC,CAAA,MAAO,EAAE,IAAA,EAAM,CAAA,EAAG,IAAA,EAAM,UAAA,CAAW,IAAI,CAAC,CAAA,IAAK,SAAS,GAAA,CAAI,CAAC,GAAE,CAAE,CAAA;AACpG,EAAA,MAAM,IAAA,GAAO,IAAI,GAAA,CAAI,IAAI,CAAA;AACzB,EAAA,KAAA,MAAW,CAAA,IAAK,cAAA,CAAe,OAAO,CAAA,EAAG;AACvC,IAAA,IAAI,OAAA,CAAQ,GAAA,CAAI,CAAA,CAAE,IAAI,CAAA,EAAG;AACzB,IAAA,KAAA,CAAM,IAAA,CAAK,EAAE,IAAA,EAAM,CAAA,CAAE,IAAA,EAAM,MAAM,KAAA,EAAO,IAAA,EAAM,CAAA,CAAE,IAAA,EAAM,CAAA;AACtD,IAAA,IAAA,CAAK,GAAA,CAAI,EAAE,IAAI,CAAA;AAAA,EACjB;AAKA,EAAA,KAAA,MAAW,CAAA,IAAK,SAAA,EAAW,UAAA,IAAc,EAAC,EAAG;AAC3C,IAAA,IAAI,IAAA,CAAK,GAAA,CAAI,CAAA,CAAE,IAAI,CAAA,EAAG;AACtB,IAAA,KAAA,CAAM,IAAA,CAAK,EAAE,IAAA,EAAM,CAAA,CAAE,IAAA,EAAM,IAAA,EAAM,KAAA,EAAO,IAAA,EAAM,CAAA,CAAE,IAAA,EAAM,cAAA,EAAgB,CAAA,CAAE,QAAQ,CAAA;AAChF,IAAA,IAAA,CAAK,GAAA,CAAI,EAAE,IAAI,CAAA;AAAA,EACjB;AAOA,EAAA,IAAI,KAAA,EAAO,MAAK,EAAG;AACjB,IAAA,MAAM,YAAA,GAAe,gBAAgB,KAAK,CAAA;AAC1C,IAAA,MAAM,aAAA,GAAgB,qBAAqB,YAAY,CAAA;AACvD,IAAA,KAAA,MAAW,CAAA,IAAK,QAAA,CAAS,KAAK,CAAA,EAAG;AAC/B,MAAA,IAAI,IAAA,CAAK,GAAA,CAAI,CAAC,CAAA,IAAK,UAAA,CAAW,GAAA,CAAI,CAAC,CAAA,IAAK,aAAA,CAAc,GAAA,CAAI,CAAC,CAAA,EAAG;AAC9D,MAAA,KAAA,CAAM,IAAA,CAAK,EAAE,IAAA,EAAM,CAAA,EAAG,MAAM,KAAA,EAAO,OAAA,EAAS,MAAM,CAAA;AAClD,MAAA,IAAA,CAAK,IAAI,CAAC,CAAA;AAAA,IACZ;AACA,IAAA,KAAA,MAAW,CAAA,IAAK,cAAA,CAAe,YAAY,CAAA,EAAG;AAC5C,MAAA,IAAI,IAAA,CAAK,GAAA,CAAI,CAAA,CAAE,IAAI,CAAA,EAAG;AACtB,MAAA,KAAA,CAAM,IAAA,CAAK,EAAE,IAAA,EAAM,CAAA,CAAE,IAAA,EAAM,IAAA,EAAM,KAAA,EAAO,IAAA,EAAM,CAAA,CAAE,IAAA,EAAM,OAAA,EAAS,IAAA,EAAM,CAAA;AACrE,MAAA,IAAA,CAAK,GAAA,CAAI,EAAE,IAAI,CAAA;AAAA,IACjB;AAAA,EACF;AACA,EAAA,MAAM,aAAa,KAAA,CAAM,IAAA,CAAK,CAAC,CAAA,KAAM,CAAC,EAAE,IAAI,CAAA;AAC5C,EAAA,OAAO,EAAE,OAAO,UAAA,EAAW;AAC7B;AAIA,SAAS,cAAc,KAAA,EAAiD;AACtE,EAAA,MAAM,GAAA,GAAM,OAAO,IAAA,EAAK;AACxB,EAAA,IAAI,CAAC,KAAK,OAAO,IAAA;AACjB,EAAA,OAAO,sBAAsB,GAAG,CAAA,CAAE,SAAS,CAAA,GAAI,mBAAA,CAAoB,GAAG,CAAA,GAAI,GAAA;AAC5E;AAYO,SAAS,eAAA,CACd,QAAA,EACA,SAAA,EACA,aAAA,EACU;AACV,EAAA,MAAM,GAAA,GAAM,CAAC,EAAA,KAAiB,CAAC,GAAG,IAAI,GAAA,CAAI,EAAE,CAAC,EAAE,KAAA,CAAM,CAAA,EAAG,CAAC,CAAA,CAAE,KAAK,IAAI,CAAA;AACpE,EAAA,MAAM,QAAA,GAAW,sBAAsB,QAAQ,CAAA;AAC/C,EAAA,MAAM,WAAW,QAAA,CAAS,MAAA,GAAS,CAAA,GAAI,mBAAA,CAAoB,QAAQ,CAAA,GAAI,QAAA;AACvE,EAAA,MAAM,QAAkB,EAAC;AAGzB,EAAA,MAAM,MAAA,uBAAa,GAAA,EAAsB;AACzC,EAAA,KAAA,MAAW,CAAA,IAAK,cAAA,CAAe,eAAA,CAAgB,QAAQ,CAAC,CAAA,EAAG;AACzD,IAAA,MAAM,OAAO,MAAA,CAAO,GAAA,CAAI,CAAA,CAAE,IAAI,KAAK,EAAC;AACpC,IAAA,IAAA,CAAK,IAAA,CAAK,EAAE,IAAI,CAAA;AAChB,IAAA,MAAA,CAAO,GAAA,CAAI,CAAA,CAAE,IAAA,EAAM,IAAI,CAAA;AAAA,EACzB;AACA,EAAA,KAAA,MAAW,CAAC,IAAA,EAAM,KAAK,CAAA,IAAK,MAAA,EAAQ;AAClC,IAAA,KAAA,CAAM,KAAK,CAAA,GAAA,EAAM,IAAI,oDAAoD,GAAA,CAAI,KAAK,CAAC,CAAA,CAAA,CAAG,CAAA;AAAA,EACxF;AAYA,EAAA,MAAM,OAAA,GAAU,SAAA,EAAW,QAAA,IAAY,EAAC;AACxC,EAAA,IAAI,QAAQ,MAAA,EAAQ;AAGlB,IAAA,MAAM,QAAA,uBAAe,GAAA,EAAY;AACjC,IAAA,MAAM,SAA8E,EAAC;AACrF,IAAA,KAAA,MAAW,KAAK,OAAA,EAAS;AACvB,MAAA,KAAA,MAAW,CAAA,IAAK,EAAE,MAAA,EAAQ;AACxB,QAAA,IAAI,QAAA,CAAS,GAAA,CAAI,CAAA,CAAE,IAAI,CAAA,EAAG;AAC1B,QAAA,QAAA,CAAS,GAAA,CAAI,EAAE,IAAI,CAAA;AACnB,QAAA,MAAA,CAAO,KAAK,EAAE,IAAA,EAAM,EAAE,IAAA,EAAM,EAAA,EAAI,EAAE,EAAA,EAAI,KAAA,EAAO,CAAA,CAAE,IAAA,CAAK,MAAM,GAAG,CAAA,CAAE,QAAQ,KAAA,EAAO,CAAA,CAAE,OAAO,CAAA;AAAA,MACzF;AAAA,IACF;AACA,IAAA,MAAM,OAAA,GAAU,IAAA,CAAK,GAAA,CAAI,GAAG,MAAA,CAAO,IAAI,CAAC,CAAA,KAAM,CAAA,CAAE,KAAK,CAAC,CAAA;AACtD,IAAA,MAAM,QAAA,GAAW,CAAC,CAAA,EAAoC,IAAA,KACpD,EAAE,KAAA,CAAM,MAAA,GACJ,CAAA,EAAG,IAAI,CAAA,CAAA,EAAI,CAAA,CAAE,EAAE,CAAA,8BAAA,EAAiC,GAAA,CAAI,EAAE,KAAK,CAAC,MAC5D,CAAA,EAAG,IAAI,CAAA,CAAA,EAAI,CAAA,CAAE,EAAE,CAAA,CAAA,CAAA;AAErB,IAAA,KAAA,MAAW,CAAA,IAAK,OAAO,MAAA,CAAO,CAACC,OAAMA,EAAAA,CAAE,KAAA,KAAU,OAAO,CAAA,EAAG;AACzD,MAAA,KAAA,CAAM,IAAA,CAAK,QAAA,CAAS,CAAA,EAAG,iCAAiC,CAAC,CAAA;AAAA,IAC3D;AAMA,IAAA,MAAM,aAAa,IAAI,GAAA,CAAI,MAAA,CAAO,MAAA,CAAO,CAAC,CAAA,KAAM,CAAA,CAAE,KAAA,KAAU,OAAO,EAAE,GAAA,CAAI,CAAC,CAAA,KAAM,CAAA,CAAE,EAAE,CAAC,CAAA;AACrF,IAAA,KAAA,MAAW,CAAA,IAAA,CAAM,SAAA,EAAW,OAAA,IAAW,IAAI,MAAA,CAAO,CAACC,EAAAA,KAAMA,EAAAA,CAAE,QAAQ,CAAC,CAAA,CAAE,KAAA,CAAM,CAAA,EAAG,CAAC,CAAA,EAAG;AACjF,MAAA,IAAI,UAAA,CAAW,GAAA,CAAI,CAAA,CAAE,IAAI,CAAA,EAAG;AAC1B,QAAA,IAAI,CAAA,CAAE,SAAS,CAAA,CAAE,IAAA,QAAY,IAAA,CAAK,CAAA,0BAAA,EAA6B,CAAA,CAAE,IAAI,CAAA,EAAA,CAAI,CAAA;AACzE,QAAA;AAAA,MACF;AACA,MAAA,KAAA,CAAM,IAAA;AAAA,QACJ,CAAA,CAAE,IAAA,KAAS,CAAA,CAAE,IAAA,GACT,CAAA,wBAAA,EAA2B,CAAA,CAAE,IAAI,CAAA,EAAA,CAAA,GACjC,CAAA,wBAAA,EAA2B,CAAA,CAAE,IAAI,CAAA,UAAA,EAAa,EAAE,IAAI,CAAA,GAAA;AAAA,OAC1D;AAAA,IACF;AAIA,IAAA,MAAM,KAAA,GAAQ,IAAI,GAAA,CAAA,CAAK,SAAA,EAAW,OAAA,IAAW,EAAC,EAAG,GAAA,CAAI,CAAC,CAAA,KAAM,CAAA,CAAE,IAAI,CAAC,CAAA;AACnE,IAAA,KAAA,IAAS,CAAA,GAAI,OAAA,GAAU,CAAA,EAAG,CAAA,IAAK,GAAG,CAAA,EAAA,EAAK;AACrC,MAAA,KAAA,MAAW,CAAA,IAAK,MAAA,CAAO,MAAA,CAAO,CAACD,OAAMA,EAAAA,CAAE,KAAA,KAAU,CAAA,IAAK,CAAC,KAAA,CAAM,GAAA,CAAIA,EAAAA,CAAE,EAAE,CAAC,CAAA,EAAG;AACvE,QAAA,KAAA,CAAM,IAAA,CAAK,QAAA,CAAS,CAAA,EAAG,yBAAyB,CAAC,CAAA;AAAA,MACnD;AAAA,IACF;AAAA,EACF,CAAA,MAAA,IAAW,SAAA,EAAW,MAAA,EAAQ,MAAA,EAAQ;AAEpC,IAAA,MAAM,UAAA,uBAAiB,GAAA,EAAsB;AAC7C,IAAA,KAAA,MAAW,CAAA,IAAK,SAAA,CAAU,UAAA,IAAc,EAAC,EAAG;AAC1C,MAAA,MAAM,OAAO,UAAA,CAAW,GAAA,CAAI,CAAA,CAAE,IAAI,KAAK,EAAC;AACxC,MAAA,IAAA,CAAK,IAAA,CAAK,EAAE,IAAI,CAAA;AAChB,MAAA,UAAA,CAAW,GAAA,CAAI,CAAA,CAAE,IAAA,EAAM,IAAI,CAAA;AAAA,IAC7B;AACA,IAAA,KAAA,MAAW,KAAK,SAAA,CAAU,MAAA,CAAO,KAAA,CAAM,CAAA,EAAG,CAAC,CAAA,EAAG;AAC5C,MAAA,MAAM,KAAA,GAAQ,UAAA,CAAW,GAAA,CAAI,CAAA,CAAE,EAAE,CAAA;AACjC,MAAA,KAAA,CAAM,IAAA;AAAA,QACJ,KAAA,EAAO,MAAA,GACH,CAAA,wBAAA,EAA2B,CAAA,CAAE,EAAE,CAAA,sCAAA,EAAyC,GAAA,CAAI,KAAK,CAAC,CAAA,CAAA,CAAA,GAClF,CAAA,wBAAA,EAA2B,CAAA,CAAE,EAAE,CAAA,SAAA;AAAA,OACrC;AAAA,IACF;AAAA,EACF;AAKA,EAAA,MAAM,SAAA,GAAY,SAAA,EAAW,SAAA,IAAa,EAAC;AAC3C,EAAA,IAAI,UAAU,MAAA,EAAQ;AACpB,IAAA,MAAM,QAAQ,SAAA,CAAU,MAAA,CAAO,CAAC,EAAA,KAAO,EAAA,CAAG,SAAS,YAAY,CAAA;AAC/D,IAAA,MAAM,QAAQ,SAAA,CAAU,MAAA,CAAO,CAAC,EAAA,KAAO,EAAA,CAAG,SAAS,YAAY,CAAA;AAC/D,IAAA,MAAM,MAAA,GAAS,CAAC,IAAA,KACd,IAAA,CACG,KAAA,CAAM,GAAG,CAAC,CAAA,CACV,GAAA,CAAI,CAAC,EAAA,KAAQ,EAAA,CAAG,YAAY,CAAA,EAAG,EAAA,CAAG,IAAI,CAAA,EAAA,EAAK,EAAA,CAAG,SAAS,MAAM,EAAA,CAAG,IAAK,CAAA,CACrE,IAAA,CAAK,IAAI,CAAA;AAGd,IAAA,IAAI,KAAA,CAAM,QAAQ,KAAA,CAAM,IAAA,CAAK,sCAAsC,MAAA,CAAO,KAAK,CAAC,CAAA,CAAA,CAAG,CAAA;AACnF,IAAA,IAAI,KAAA,CAAM,QAAQ,KAAA,CAAM,IAAA,CAAK,kCAAkC,MAAA,CAAO,KAAK,CAAC,CAAA,CAAA,CAAG,CAAA;AAAA,EACjF;AAIA,EAAA,MAAM,UAAA,GAAa,SAAA,EAAW,UAAA,IAAc,EAAC;AAC7C,EAAA,IAAI,WAAW,MAAA,EAAQ;AACrB,IAAA,KAAA,CAAM,IAAA,CAAK,CAAA,sBAAA,EAAyB,GAAA,CAAI,UAAU,CAAC,CAAA,CAAA,CAAG,CAAA;AAAA,EACxD;AAGA,EAAA,MAAM,SAAA,GAAY,SAAA,EAAW,KAAA,IAAS,EAAC;AACvC,EAAA,IAAI,UAAU,MAAA,EAAQ;AACpB,IAAA,KAAA,CAAM,IAAA,CAAK,CAAA,6DAAA,EAAgE,GAAA,CAAI,SAAS,CAAC,CAAA,CAAA,CAAG,CAAA;AAAA,EAC9F;AAGA,EAAA,KAAA,MAAW,CAAA,IAAA,CAAM,WAAW,WAAA,IAAe,IAAI,KAAA,CAAM,CAAA,EAAG,CAAC,CAAA,EAAG;AAC1D,IAAA,KAAA,CAAM,KAAK,CAAA,QAAA,EAAW,CAAA,CAAE,IAAI,CAAA,iBAAA,EAAoB,CAAA,CAAE,EAAE,CAAA,EAAA,CAAI,CAAA;AAAA,EAC1D;AAGA,EAAA,MAAM,SAAA,GAAY,cAAc,aAAa,CAAA;AAC7C,EAAA,IAAI,SAAA,EAAW;AACb,IAAA,MAAM,OAAA,GAAU,IAAI,GAAA,CAAI,QAAA,CAAS,QAAQ,CAAC,CAAA;AAC1C,IAAA,MAAM,QAAA,GAAW,oBAAA,CAAqB,eAAA,CAAgB,SAAS,CAAC,CAAA;AAChE,IAAA,MAAM,OAAA,GAAU,SAAS,SAAS,CAAA,CAAE,OAAO,CAAC,CAAA,KAAM,CAAC,OAAA,CAAQ,GAAA,CAAI,CAAC,CAAA,IAAK,CAAC,WAAW,GAAA,CAAI,CAAC,KAAK,CAAC,QAAA,CAAS,GAAA,CAAI,CAAC,CAAC,CAAA;AAC3G,IAAA,IAAI,QAAQ,MAAA,EAAQ;AAClB,MAAA,KAAA,CAAM,IAAA,CAAK,CAAA,kEAAA,EAAqE,GAAA,CAAI,OAAO,CAAC,CAAA,CAAA,CAAG,CAAA;AAAA,IACjG;AAAA,EACF;AAEA,EAAA,IAAI,MAAM,MAAA,EAAQ;AAChB,IAAA,KAAA,CAAM,IAAA;AAAA,MACJ;AAAA,KACF;AAAA,EACF;AACA,EAAA,OAAO,KAAA;AACT;AAEA,SAAS,SAAA,CAAU,IAAA,EAAiB,KAAA,EAAoB,QAAA,GAAkC,MAAM,CAAA,EAAmC;AACjI,EAAA,IAAI,KAAA,GAAQ,CAAA;AACZ,EAAA,IAAI,WAAA,GAAc,CAAA;AAClB,EAAA,MAAM,OAAiB,EAAC;AACxB,EAAA,MAAM,IAAA,GAAO,IAAA,CAAK,IAAA,CAAK,WAAA,EAAY;AACnC,EAAA,MAAM,EAAA,GAAK,IAAA,CAAK,aAAA,CAAc,WAAA,EAAY;AAC1C,EAAA,MAAM,IAAA,GAAO,IAAA,CAAK,IAAA,CAAK,WAAA,EAAY;AAInC,EAAA,MAAM,WAAA,GAAc,IAAI,GAAA,CAAI,IAAA,CAAK,KAAA,CAAM,GAAG,CAAA,CAAE,KAAA,CAAM,CAAA,EAAG,EAAE,CAAC,CAAA;AAGxD,EAAA,MAAM,SAAA,GAAY,eAAA,CAAgB,IAAA,CAAK,IAAI,CAAA;AAC3C,EAAA,KAAA,MAAW,EAAE,MAAM,CAAA,EAAG,IAAA,EAAM,MAAM,cAAA,EAAgB,OAAA,MAAa,KAAA,EAAO;AAapE,IAAA,MAAM,UAAA,GAAa,mBAAmB,MAAA,GAAY,IAAA,CAAK,IAAI,cAAA,EAAgB,gBAAgB,CAAA,GAAI,IAAA,GAAO,gBAAA,GAAmB,CAAA;AACzH,IAAA,MAAM,CAAA,GAAI,SAAS,CAAC,CAAA,IAAK,OAAO,gBAAA,GAAmB,CAAA,CAAA,GAAK,UAAA,IAAc,OAAA,GAAU,YAAA,GAAe,CAAA,CAAA;AAC/F,IAAA,MAAM,KAAA,GAAA,CAAS,UAAU,QAAA,GAAM,EAAA,KAAO,OAAO,CAAA,EAAG,IAAI,CAAA,MAAA,EAAI,CAAC,CAAA,CAAA,GAAK,CAAA,CAAA;AAC9D,IAAA,IAAI,YAAA,GAAe,CAAA;AACnB,IAAA,IAAI,SAAS,CAAA,EAAG;AACd,MAAA,YAAA,GAAe,EAAA,GAAK,CAAA;AACpB,MAAA,IAAA,CAAK,KAAK,KAAK,CAAA;AAAA,IACjB,CAAA,MAAA,IAAW,SAAA,CAAU,GAAA,CAAI,CAAC,CAAA,EAAG;AAC3B,MAAA,YAAA,GAAe,CAAA,GAAI,CAAA;AACnB,MAAA,IAAA,CAAK,KAAK,KAAK,CAAA;AAAA,IACjB,CAAA,MAAA,IAAW,IAAA,CAAK,QAAA,CAAS,CAAC,CAAA,EAAG;AAC3B,MAAA,YAAA,GAAe,CAAA,GAAI,CAAA;AACnB,MAAA,IAAA,CAAK,KAAK,KAAK,CAAA;AAAA,IACjB,CAAA,MAAA,IAAW,EAAA,CAAG,QAAA,CAAS,CAAC,CAAA,EAAG;AACzB,MAAA,YAAA,GAAe,CAAA,GAAI,CAAA;AACnB,MAAA,IAAA,CAAK,KAAK,KAAK,CAAA;AAAA,IACjB,CAAA,MAAA,IAAW,cAAA,CAAe,CAAA,EAAG,SAAS,CAAA,EAAG;AAIvC,MAAA,YAAA,GAAe,CAAA,GAAI,CAAA;AACnB,MAAA,IAAA,CAAK,IAAA,CAAA,CAAM,OAAA,GAAU,QAAA,GAAM,EAAA,KAAO,IAAA,GAAO,CAAA,CAAA,EAAI,IAAI,CAAA,MAAA,EAAI,CAAC,CAAA,CAAA,GAAK,CAAA,CAAA,EAAI,CAAC,CAAA,CAAA,CAAG,CAAA;AAAA,IACrE,CAAA,MAAA,IAAW,WAAA,CAAY,GAAA,CAAI,CAAC,CAAA,EAAG;AAC7B,MAAA,YAAA,GAAe,CAAA,GAAI,CAAA;AACnB,MAAA,IAAA,CAAK,KAAK,KAAK,CAAA;AAAA,IACjB,CAAA,MAAA,IAAW,IAAA,CAAK,QAAA,CAAS,CAAC,CAAA,EAAG;AAC3B,MAAA,YAAA,GAAe,CAAA,GAAI,CAAA;AACnB,MAAA,IAAA,CAAK,KAAK,KAAK,CAAA;AAAA,IACjB;AACA,IAAA,IAAI,eAAe,CAAA,EAAG;AACpB,MAAA,KAAA,IAAS,YAAA;AACT,MAAA,IAAI,CAAC,MAAM,WAAA,IAAe,CAAA;AAAA,IAC5B;AAAA,EACF;AAIA,EAAA,IAAI,gBAAgB,CAAA,EAAG,OAAO,EAAE,KAAA,EAAO,CAAA,EAAG,KAAK,EAAA,EAAG;AAGlD,EAAA,KAAA,IAAS,IAAI,cAAA,GAAiB,IAAA,CAAK,GAAA,CAAI,WAAA,GAAc,GAAG,CAAC,CAAA;AACzD,EAAA,OAAO,EAAE,KAAA,EAAO,GAAA,EAAK,IAAA,CAAK,MAAA,GAAS,CAAA,SAAA,EAAY,IAAA,CAAK,IAAA,CAAK,IAAI,CAAC,CAAA,CAAA,GAAK,EAAA,EAAG;AACxE;AAQA,IAAM,iBAAA,GAAoB,GAAA;AAW1B,IAAM,qBAAA,GAAwB,GAAA;AAO9B,SAAS,WAAA,CAAY,GAAW,CAAA,EAAmB;AACjD,EAAA,MAAM,EAAA,GAAK,CAAA,CAAE,KAAA,CAAM,GAAG,CAAA;AACtB,EAAA,MAAM,EAAA,GAAK,CAAA,CAAE,KAAA,CAAM,GAAG,CAAA;AACtB,EAAA,IAAI,CAAA,GAAI,CAAA;AACR,EAAA,OAAO,CAAA,GAAI,EAAA,CAAG,MAAA,IAAU,CAAA,GAAI,EAAA,CAAG,MAAA,IAAU,EAAA,CAAG,CAAC,CAAA,KAAM,EAAA,CAAG,CAAC,CAAA,EAAG,CAAA,EAAA;AAC1D,EAAA,OAAO,CAAA;AACT;AAgBA,SAAS,aAAA,CACP,MAAA,EACA,SAAA,EACA,SAAA,EACkC;AAClC,EAAA,IAAI,CAAC,SAAA,EAAW,OAAO,EAAE,KAAA,EAAO,CAAA,EAAG,OAAO,EAAA,EAAG;AAC7C,EAAA,MAAM,IAAA,GAAO,SAAA,CAAU,GAAA,CAAI,MAAM,CAAA;AACjC,EAAA,IAAI,CAAC,MAAM,MAAA,EAAQ,OAAO,EAAE,KAAA,EAAO,CAAA,EAAG,OAAO,EAAA,EAAG;AAEhD,EAAA,MAAM,KAAA,GAAQ,SAAA,EAAW,QAAA,IAAY,EAAC;AACtC,EAAA,IAAI,KAAA,CAAM,MAAA,IAAU,IAAA,CAAK,IAAA,CAAK,CAAC,MAAM,CAAA,CAAE,QAAA,CAAS,GAAG,CAAC,CAAA,EAAG;AACrD,IAAA,IAAI,IAAA,GAAO,CAAA;AACX,IAAA,IAAI,KAAA,GAAQ,EAAA;AACZ,IAAA,KAAA,MAAW,SAAS,KAAA,EAAO;AACzB,MAAA,MAAM,QAAA,GAAW,KAAA,CAAM,IAAA,CAAK,KAAA,CAAM,GAAG,CAAA,CAAE,MAAA;AACvC,MAAA,KAAA,MAAW,OAAO,IAAA,EAAM;AACtB,QAAA,MAAM,MAAA,GAAS,WAAA,CAAY,KAAA,CAAM,IAAA,EAAM,GAAG,CAAA;AAC1C,QAAA,IAAI,WAAW,CAAA,EAAG;AAElB,QAAA,MAAME,SAAAA,GAAY,MAAA,GAAS,QAAA,GAAY,KAAA,CAAM,KAAA;AAC7C,QAAA,IAAIA,YAAW,IAAA,EAAM;AACnB,UAAA,IAAA,GAAOA,SAAAA;AACP,UAAA,KAAA,GAAQ,MAAA,KAAW,QAAA,GAAW,KAAA,CAAM,IAAA,GAAO,MAAM,IAAA,CAAK,KAAA,CAAM,GAAG,CAAA,CAAE,KAAA,CAAM,CAAA,EAAG,MAAM,CAAA,CAAE,KAAK,GAAG,CAAA;AAAA,QAC5F;AAAA,MACF;AAAA,IACF;AACA,IAAA,IAAI,QAAQ,CAAA,EAAG,OAAO,EAAE,KAAA,EAAO,CAAA,EAAG,OAAO,EAAA,EAAG;AAC5C,IAAA,OAAO,EAAE,KAAA,EAAO,CAAA,GAAI,qBAAA,GAAwB,IAAA,CAAK,GAAA,CAAI,IAAA,EAAM,CAAC,CAAA,EAAG,KAAA,EAAO,CAAA,QAAA,EAAW,KAAK,CAAA,CAAA,EAAG;AAAA,EAC3F;AAEA,EAAA,IAAI,CAAC,WAAW,MAAA,EAAQ,MAAA,SAAe,EAAE,KAAA,EAAO,CAAA,EAAG,KAAA,EAAO,EAAA,EAAG;AAC7D,EAAA,IAAI,QAAA,GAAW,CAAA;AACf,EAAA,MAAM,UAAoB,EAAC;AAC3B,EAAA,KAAA,MAAW,CAAA,IAAK,UAAU,MAAA,EAAQ;AAChC,IAAA,IAAI,IAAA,CAAK,QAAA,CAAS,CAAA,CAAE,EAAE,CAAA,EAAG;AACvB,MAAA,QAAA,IAAY,CAAA,CAAE,KAAA;AACd,MAAA,OAAA,CAAQ,IAAA,CAAK,EAAE,EAAE,CAAA;AAAA,IACnB;AAAA,EACF;AACA,EAAA,IAAI,YAAY,CAAA,EAAG,OAAO,EAAE,KAAA,EAAO,CAAA,EAAG,OAAO,EAAA,EAAG;AAChD,EAAA,OAAO,EAAE,KAAA,EAAO,CAAA,GAAI,qBAAA,GAAwB,IAAA,CAAK,IAAI,QAAA,EAAU,CAAC,CAAA,EAAG,KAAA,EAAO,WAAW,OAAA,CAAQ,IAAA,GAAO,IAAA,CAAK,GAAG,CAAC,CAAA,CAAA,EAAG;AAClH;AAUA,SAAS,WAAA,CAAY,OAAgB,KAAA,EAAwC;AAC3E,EAAA,IAAI,KAAA,CAAM,MAAA,KAAW,CAAA,EAAG,OAAO,MAAM,CAAA;AACrC,EAAA,MAAM,EAAA,uBAAS,GAAA,EAAoB;AACnC,EAAA,IAAI,CAAA,GAAI,CAAA;AACR,EAAA,KAAA,MAAW,IAAA,IAAQ,MAAM,KAAA,EAAO;AAC9B,IAAA,IAAI,IAAA,CAAK,IAAA,KAAS,MAAA,IAAU,IAAA,CAAK,SAAS,UAAA,EAAY;AACtD,IAAA,CAAA,EAAA;AACA,IAAA,MAAM,IAAA,GAAO,IAAA,CAAK,IAAA,CAAK,WAAA,EAAY;AACnC,IAAA,MAAM,KAAA,GAAQ,eAAA,CAAgB,IAAA,CAAK,IAAI,CAAA;AACvC,IAAA,KAAA,MAAW,KAAK,KAAA,EAAO;AACrB,MAAA,IAAI,MAAM,GAAA,CAAI,CAAC,CAAA,IAAK,IAAA,CAAK,SAAS,CAAC,CAAA,EAAG,EAAA,CAAG,GAAA,CAAI,IAAI,EAAA,CAAG,GAAA,CAAI,CAAC,CAAA,IAAK,KAAK,CAAC,CAAA;AAAA,IACtE;AAAA,EACF;AACA,EAAA,MAAM,CAAA,uBAAQ,GAAA,EAAoB;AAClC,EAAA,KAAA,MAAW,KAAK,KAAA,EAAO;AACrB,IAAA,MAAM,GAAA,GAAM,IAAA,CAAK,GAAA,CAAA,CAAK,CAAA,GAAI,CAAA,KAAA,CAAO,EAAA,CAAG,GAAA,CAAI,CAAC,CAAA,IAAK,CAAA,IAAK,CAAA,CAAE,CAAA,GAAI,CAAA;AAGzD,IAAA,CAAA,CAAE,GAAA,CAAI,CAAA,EAAG,IAAA,CAAK,GAAA,CAAI,GAAA,EAAK,KAAK,GAAA,CAAI,CAAA,EAAG,GAAG,CAAC,CAAC,CAAA;AAAA,EAC1C;AACA,EAAA,OAAO,CAAC,CAAA,KAAc,CAAA,CAAE,GAAA,CAAI,CAAC,CAAA,IAAK,CAAA;AACpC;AAWO,SAAS,gBAAgB,IAAA,EAA2B;AACzD,EAAA,OAAO,IAAI,GAAA;AAAA,IACT,IAAA,CACG,KAAA,CAAM,iEAAiE,CAAA,CACvE,MAAA,CAAO,OAAO,CAAA,CACd,GAAA,CAAI,CAAC,CAAA,KAAM,CAAA,CAAE,WAAA,EAAa;AAAA,GAC/B;AACF;AAGA,SAAS,cAAA,CAAe,MAAc,KAAA,EAA6B;AACjE,EAAA,KAAA,MAAW,QAAQ,KAAA,EAAO;AACxB,IAAA,MAAM,MAAA,GAAS,eAAA,CAAgB,IAAA,EAAM,IAAI,CAAA;AACzC,IAAA,IAAI,MAAA,IAAU,CAAA,IAAK,MAAA,IAAU,GAAA,GAAM,IAAA,CAAK,GAAA,CAAI,IAAA,CAAK,MAAA,EAAQ,IAAA,CAAK,MAAM,CAAA,EAAG,OAAO,IAAA;AAAA,EAChF;AACA,EAAA,OAAO,KAAA;AACT;AAEA,SAAS,eAAA,CAAgB,GAAW,CAAA,EAAmB;AACrD,EAAA,MAAM,IAAI,IAAA,CAAK,GAAA,CAAI,CAAA,CAAE,MAAA,EAAQ,EAAE,MAAM,CAAA;AACrC,EAAA,IAAI,CAAA,GAAI,CAAA;AACR,EAAA,OAAO,IAAI,CAAA,IAAK,CAAA,CAAE,CAAC,CAAA,KAAM,CAAA,CAAE,CAAC,CAAA,EAAG,CAAA,EAAA;AAC/B,EAAA,OAAO,CAAA;AACT;AAEA,SAAS,YAAA,CACP,OACA,KAAA,EACA,QAAA,EACA,OACA,MAAA,EACA,QAAA,GAAqB,EAAC,EACuB;AAC7C,EAAA,MAAM,QAAkB,EAAC;AACzB,EAAA,KAAA,CAAM,IAAA,CAAK,CAAA,eAAA,EAAkB,QAAQ,CAAA,CAAE,CAAA;AACvC,EAAA,KAAA,CAAM,KAAK,EAAE,CAAA;AACb,EAAA,IAAI,SAAS,MAAA,EAAQ;AACnB,IAAA,KAAA,CAAM,KAAK,+DAA+D,CAAA;AAC1E,IAAA,KAAA,MAAW,OAAO,QAAA,EAAU,KAAA,CAAM,IAAA,CAAK,CAAA,IAAA,EAAO,GAAG,CAAA,EAAA,CAAI,CAAA;AACrD,IAAA,KAAA,CAAM,IAAA;AAAA,MACJ;AAAA,KACF;AACA,IAAA,KAAA,CAAM,KAAK,EAAE,CAAA;AAAA,EACf;AACA,EAAA,IAAI,KAAA,CAAM,WAAW,CAAA,EAAG;AACtB,IAAA,KAAA,CAAM,IAAA;AAAA,MACJ,QAAA,CAAS,SACL,wJAAA,GACA;AAAA,KACN;AACA,IAAA,MAAMC,KAAAA,GAAO,KAAA,CAAM,IAAA,CAAK,IAAI,CAAA;AAC5B,IAAA,OAAO,EAAE,OAAA,EAASA,KAAAA,EAAM,cAAA,EAAgB,cAAA,CAAeA,KAAI,CAAA,EAAE;AAAA,EAC/D;AAEA,EAAA,KAAA,MAAW,EAAE,IAAA,EAAM,GAAA,EAAI,IAAK,KAAA,EAAO;AACjC,IAAA,MAAM,QAAkB,EAAC;AACzB,IAAA,KAAA,CAAM,IAAA,CAAK,CAAA,GAAA,EAAM,IAAA,CAAK,aAAa,MAAM,IAAA,CAAK,IAAI,CAAA,EAAA,EAAK,IAAA,CAAK,IAAI,CAAA,CAAA,EAAI,IAAA,CAAK,IAAA,CAAK,KAAK,CAAA,CAAA,CAAG,CAAA;AACtF,IAAA,IAAI,KAAK,SAAA,EAAW,KAAA,CAAM,KAAK,GAAA,GAAM,IAAA,CAAK,YAAY,GAAG,CAAA;AACzD,IAAA,MAAM,OAAA,GAAU,KAAA,CAAM,OAAA,CAAQ,IAAA,CAAK,EAAE,CAAA,CAAE,GAAA,CAAI,CAAC,CAAA,KAAM,CAAA,CAAE,IAAA,CAAK,aAAa,CAAA;AACtE,IAAA,MAAM,OAAA,GAAU,KAAA,CAAM,OAAA,CAAQ,IAAA,CAAK,EAAE,CAAA,CAAE,GAAA,CAAI,CAAC,CAAA,KAAM,CAAA,CAAE,IAAA,CAAK,aAAa,CAAA;AACtE,IAAA,IAAI,OAAA,CAAQ,MAAA,EAAQ,KAAA,CAAM,IAAA,CAAK,UAAU,MAAA,CAAO,OAAO,CAAA,CAAE,KAAA,CAAM,GAAG,CAAC,CAAA,CAAE,IAAA,CAAK,IAAI,CAAC,CAAA,CAAE,CAAA;AACjF,IAAA,IAAI,OAAA,CAAQ,MAAA,EAAQ,KAAA,CAAM,IAAA,CAAK,cAAc,MAAA,CAAO,OAAO,CAAA,CAAE,KAAA,CAAM,GAAG,CAAC,CAAA,CAAE,IAAA,CAAK,IAAI,CAAC,CAAA,CAAE,CAAA;AACrF,IAAA,KAAA,CAAM,KAAK,CAAA,WAAA,EAAc,IAAA,CAAK,UAAA,CAAW,OAAA,CAAQ,CAAC,CAAC,CAAA,YAAA,EAAY,IAAA,CAAK,IAAI,GAAG,IAAA,CAAK,KAAA,GAAQ,cAAW,EAAE,CAAA,MAAA,EAAM,GAAG,CAAA,CAAE,CAAA;AAChH,IAAA,KAAA,CAAM,KAAK,EAAE,CAAA;AAEb,IAAA,MAAM,YAAY,KAAA,CAAM,MAAA,CAAO,KAAK,CAAA,CAAE,KAAK,IAAI,CAAA;AAC/C,IAAA,IAAI,eAAe,SAAS,CAAA,GAAI,MAAA,IAAU,KAAA,CAAM,SAAS,CAAA,EAAG;AAC5D,IAAA,KAAA,CAAM,IAAA,CAAK,GAAG,KAAK,CAAA;AAAA,EACrB;AAEA,EAAA,MAAM,IAAA,GAAO,KAAA,CAAM,IAAA,CAAK,IAAI,CAAA;AAC5B,EAAA,OAAO,EAAE,OAAA,EAAS,IAAA,EAAM,cAAA,EAAgB,cAAA,CAAe,IAAI,CAAA,EAAE;AAC/D;AAEA,SAAS,OAAO,EAAA,EAAwB;AACtC,EAAA,OAAO,CAAC,GAAG,IAAI,GAAA,CAAI,EAAE,CAAC,CAAA;AACxB;AAEA,SAAS,eAAe,IAAA,EAAsB;AAE5C,EAAA,OAAO,IAAA,CAAK,IAAA,CAAK,IAAA,CAAK,MAAA,GAAS,CAAC,CAAA;AAClC;AAEA,SAAS,MAAM,CAAA,EAAmB;AAChC,EAAA,OAAO,IAAA,CAAK,KAAA,CAAM,CAAA,GAAI,GAAG,CAAA,GAAI,GAAA;AAC/B;;;ACz2BA,IAAM,YAAA,uBAAmB,GAAA,CAAc,CAAC,QAAQ,QAAA,EAAU,SAAA,EAAW,YAAA,EAAc,YAAY,CAAC,CAAA;AAsBzF,SAAS,QAAA,CAAS,KAAA,EAAgB,MAAA,EAAgB,IAAA,GAA2B,EAAC,EAAiB;AACpG,EAAA,MAAM,WAAW,IAAA,CAAK,GAAA,CAAI,CAAA,EAAG,IAAA,CAAK,SAAS,CAAC,CAAA;AAC5C,EAAA,MAAM,KAAA,GAAQ,SAAS,KAAK,CAAA;AAC5B,EAAA,MAAM,IAAA,GAAO,KAAA,CAAM,IAAA,CAAK,MAAM,CAAA;AAE9B,EAAA,MAAM,QAAA,uBAAe,GAAA,EAAwB;AAC7C,EAAA,IAAI,iBAAA,GAAoB,CAAA;AAGxB,EAAA,IAAI,WAA2C,CAAC,EAAE,IAAI,MAAA,EAAQ,IAAA,EAAM,GAAG,CAAA;AACvE,EAAA,KAAA,IAAS,KAAA,GAAQ,CAAA,EAAG,KAAA,IAAS,QAAA,EAAU,KAAA,EAAA,EAAS;AAC9C,IAAA,MAAM,eAA+C,EAAC;AACtD,IAAA,KAAA,MAAW,EAAE,EAAA,EAAI,IAAA,EAAK,IAAK,QAAA,EAAU;AACnC,MAAA,KAAA,MAAW,CAAA,IAAK,KAAA,CAAM,EAAA,CAAG,EAAE,CAAA,EAAG;AAC5B,QAAA,IAAI,CAAC,YAAA,CAAa,GAAA,CAAI,CAAA,CAAE,IAAI,CAAA,EAAG;AAC/B,QAAA,iBAAA,GAAoB,IAAA,CAAK,GAAA,CAAI,iBAAA,EAAmB,CAAA,CAAE,UAAU,CAAA;AAC5D,QAAA,MAAM,cAAc,CAAA,CAAE,GAAA;AACtB,QAAA,IAAI,WAAA,KAAgB,MAAA,IAAU,QAAA,CAAS,GAAA,CAAI,WAAW,CAAA,EAAG;AACzD,QAAA,MAAM,IAAA,GAAO,KAAA,CAAM,IAAA,CAAK,WAAW,CAAA;AACnC,QAAA,IAAI,CAAC,IAAA,EAAM;AACX,QAAA,MAAM,KAAA,GAAQC,MAAAA,CAAM,IAAA,GAAO,CAAA,CAAE,aAAa,GAAG,CAAA;AAC7C,QAAA,QAAA,CAAS,IAAI,WAAA,EAAa;AAAA,UACxB,IAAI,IAAA,CAAK,EAAA;AAAA,UACT,MAAM,IAAA,CAAK,aAAA;AAAA,UACX,MAAM,IAAA,CAAK,IAAA;AAAA,UACX,MAAM,IAAA,CAAK,IAAA;AAAA,UACX,IAAA,EAAM,KAAK,IAAA,CAAK,KAAA;AAAA,UAChB,KAAA;AAAA,UACA,UAAA,EAAY;AAAA,SACb,CAAA;AACD,QAAA,YAAA,CAAa,KAAK,EAAE,EAAA,EAAI,WAAA,EAAa,IAAA,EAAM,OAAO,CAAA;AAAA,MACpD;AAAA,IACF;AACA,IAAA,QAAA,GAAW,YAAA;AACX,IAAA,IAAI,QAAA,CAAS,WAAW,CAAA,EAAG;AAAA,EAC7B;AAEA,EAAA,MAAM,QAAQ,CAAC,GAAG,QAAA,CAAS,MAAA,EAAQ,CAAA,CAAE,IAAA;AAAA,IACnC,CAAC,CAAA,EAAG,CAAA,KAAM,CAAA,CAAE,QAAQ,CAAA,CAAE,KAAA,IAAS,CAAA,CAAE,UAAA,GAAa,EAAE,UAAA,IAAc,CAAA,CAAE,IAAA,CAAK,aAAA,CAAc,EAAE,IAAI;AAAA,GAC3F;AAEA,EAAA,OAAO;AAAA,IACL,MAAM,EAAE,EAAA,EAAI,QAAQ,IAAA,EAAM,IAAA,EAAM,iBAAiB,MAAA,EAAO;AAAA,IACxD,KAAA,EAAO,QAAA;AAAA,IACP,QAAA,EAAU,KAAA;AAAA,IACV,MAAA,EAAQ,MAAM,MAAA,CAAO,CAAC,MAAM,CAAA,CAAE,KAAA,KAAU,CAAC,CAAA,CAAE,MAAA;AAAA,IAC3C,UAAA,EAAY,MAAM,MAAA,CAAO,CAAC,MAAM,CAAA,CAAE,KAAA,GAAQ,CAAC,CAAA,CAAE,MAAA;AAAA,IAC7C,iBAAA,EAAmBA,OAAM,iBAAiB;AAAA,GAC5C;AACF;AAEA,SAASA,OAAM,CAAA,EAAmB;AAChC,EAAA,OAAO,IAAA,CAAK,KAAA,CAAM,CAAA,GAAI,GAAG,CAAA,GAAI,GAAA;AAC/B","file":"chunk-7CYFCSY2.js","sourcesContent":["import type { EdgeKind, GraphEdge, GraphNode, VgGraph } from '../schema.js';\n\n/** Indexes over a graph for O(1) neighbor lookups (built once per command). */\nexport class GraphIndex {\n  readonly nodeById = new Map<string, GraphNode>();\n  private outById = new Map<string, GraphEdge[]>();\n  private inById = new Map<string, GraphEdge[]>();\n\n  constructor(readonly graph: VgGraph) {\n    for (const n of graph.nodes) this.nodeById.set(n.id, n);\n    for (const e of graph.edges) {\n      push(this.outById, e.src, e);\n      push(this.inById, e.dst, e);\n    }\n  }\n\n  out(id: string, kind?: EdgeKind): GraphEdge[] {\n    const all = this.outById.get(id) ?? [];\n    return kind ? all.filter((e) => e.kind === kind) : all;\n  }\n\n  in(id: string, kind?: EdgeKind): GraphEdge[] {\n    const all = this.inById.get(id) ?? [];\n    return kind ? all.filter((e) => e.kind === kind) : all;\n  }\n\n  node(id: string): GraphNode | undefined {\n    return this.nodeById.get(id);\n  }\n\n  /**\n   * Resolved nodes called by `id` — invocations (`call`) plus structural\n   * dependency references (`references`, e.g. a constructor-injected field's\n   * type), since both represent real usage a caller/impact question cares\n   * about. `references` is otherwise only emitted by the precise SCIP/tsc\n   * rungs and (for Java DI wiring) the heuristic rung — never a guess.\n   */\n  callees(id: string): { edge: GraphEdge; node: GraphNode }[] {\n    return this.resolveTargets(this.out(id).filter(isUsageEdge), 'dst');\n  }\n\n  /** Resolved nodes that call or structurally reference `id`. */\n  callers(id: string): { edge: GraphEdge; node: GraphNode }[] {\n    return this.resolveTargets(this.in(id).filter(isUsageEdge), 'src');\n  }\n\n  private resolveTargets(edges: GraphEdge[], end: 'src' | 'dst') {\n    const out: { edge: GraphEdge; node: GraphNode }[] = [];\n    for (const e of edges) {\n      const node = this.nodeById.get(e[end]);\n      if (node) out.push({ edge: e, node });\n    }\n    return out;\n  }\n}\n\nconst USAGE_KINDS: ReadonlySet<EdgeKind> = new Set(['call', 'references']);\nfunction isUsageEdge(e: GraphEdge): boolean {\n  return USAGE_KINDS.has(e.kind);\n}\n\nfunction push(map: Map<string, GraphEdge[]>, key: string, value: GraphEdge): void {\n  const list = map.get(key);\n  if (list) list.push(value);\n  else map.set(key, [value]);\n}\n\n/**\n * Memoized `GraphIndex`, keyed on the graph object's identity.\n *\n * The index (node-by-id + in/out adjacency) is a pure function of the graph's\n * content, and every read path rebuilds it from scratch — an O(nodes + edges)\n * pass that, on a large map, costs hundreds of milliseconds *per query*. Under\n * `vg serve` the same parsed graph object is reused across many tool calls\n * (`GraphSource` caches it by file mtime and only replaces the reference when\n * `graph.json` actually changes), so rebuilding the index on every call is pure\n * waste. Keying a `WeakMap` on that object identity builds the index once and\n * reuses it until the file is rebuilt — at which point `GraphSource` hands back a\n * *new* object, this map misses, and the stale index is collected with the old\n * graph. Correct and stale-safe by construction: a different graph is a\n * different object, so there is no cross-graph reuse and nothing to invalidate.\n *\n * `GraphIndex` is read-only (no method mutates its maps), so sharing one\n * instance across callers is safe.\n */\nconst INDEX_CACHE = new WeakMap<VgGraph, GraphIndex>();\n\nexport function indexFor(graph: VgGraph): GraphIndex {\n  let idx = INDEX_CACHE.get(graph);\n  if (!idx) {\n    idx = new GraphIndex(graph);\n    INDEX_CACHE.set(graph, idx);\n  }\n  return idx;\n}\n","import { indexFor, type GraphIndex } from './relations.js';\nimport { cosine, type Embedder } from './embeddings.js';\nimport { WEAK_TERMS, expandConcepts, bigramConsumedTokens } from './concepts.js';\nimport type { RelevanceAnalysis } from './relevance-provider.js';\nimport type { GraphNode, VgGraph } from '../schema.js';\n\n/**\n * Deterministic retrieval for `vg ask` (VG-CLI-SPEC §3.2).\n *\n * Builds a structured, fact-annotated, budget-bounded context block for a\n * question — designed to drop straight into an assistant's context. The default\n * is deterministic lexical+structural retrieval: identifier/term matching with\n * morphological prefix-fuzzing, term-role weighting (process verbs like \"add\"\n * only corroborate, never seed — see engine/concepts.ts), static concept\n * expansion (\"payments\" → stripe/billing/…, \"direct debit\" → sepa/bacs/mandate),\n * and a multi-term coverage bonus, ranked with importance as a mild tiebreaker.\n * `--semantic`/`--deep` adds\n * a hybrid local-embedding pass (`queryGraphSemantic`) that surfaces conceptually\n * related code even when no word is shared — still no API key.\n */\n\nexport interface QueryOptions {\n  budget?: number; // approx token budget for the context block (default 2000)\n  limit?: number; // max seed matches to expand (default 12)\n  /** Optional pre-computed relevance analysis (engine/relevance-provider.ts).\n   *  Injected by async callers so this module stays pure and sync; when\n   *  absent, ranking is exactly the built-in lexicon path. */\n  relevance?: RelevanceAnalysis | null;\n  /** Optional per-node topic tags (engine/relevance-enrich.ts). Combined with\n   *  `relevance.topics` into a bounded affinity bonus: a node structurally\n   *  tagged with a topic the question is about ranks above an equal textual\n   *  match outside it. Never seeds alone — it multiplies existing evidence. */\n  topicTags?: Map<string, readonly string[]> | null;\n  /** Previous conversational ask (multi-turn `vg code`). Its content terms —\n   *  never its process verbs — join ranking at a damped weight (CARRY_WEIGHT)\n   *  so a follow-up like \"can we use direct debits?\" keeps the prior turn's\n   *  topic (\"where is stripe used?\") instead of ranking the repo on the\n   *  follow-up's words alone. Absent → behaviour is unchanged. */\n  priorQuestion?: string | null;\n}\n\nexport interface QueryMatch {\n  node: GraphNode;\n  score: number;\n  why: string;\n}\n\nexport interface QueryResult {\n  question: string;\n  matches: QueryMatch[];\n  context: string;\n  tokensEstimate: number;\n}\n\nconst STOPWORDS = new Set([\n  'the', 'a', 'an', 'is', 'are', 'was', 'were', 'be', 'to', 'of', 'in', 'on', 'for', 'and', 'or',\n  'where', 'what', 'which', 'how', 'do', 'does', 'did', 'i', 'we', 'it', 'this', 'that', 'with',\n  'when', 'who', 'why', 'can', 'should', 'my', 'our', 'you', 'your', 'from', 'by', 'at', 'as',\n  // Discovery-question scaffolding: words a caller uses to FRAME the ask\n  // (\"find the code responsible for X\", \"I need to modify X, where do I\n  // start?\", \"explain how X works in this codebase\") rather than to name the\n  // target. Left in, these compete on equal footing with the real identifier\n  // terms and can outrank it outright — e.g. \"find the code responsible for\n  // deleteAsync\" let \"find\" alone drag in every FindByIdAsync/FindAll method\n  // in the repo, none of them the target (VG-LOCATE-FAILURE-ANALYSIS.md).\n  'find', 'code', 'responsible', 'need', 'modify', 'me',\n  'implementation', 'explain', 'works', 'codebase', 'contains', 'file',\n  // String/URL occurrence scaffolding: \"does not exist\", \"find occurrences of …\"\n  // must not light up DoesNot*/NonExisting*/commandExists via weak substrings\n  // (field report: https://…/signup does not exist find occurrences).\n  'not', 'no', 'exist', 'exists', 'existing', 'occurrence', 'occurrences',\n  'occurence', 'occurences', 'every', 'place', 'places', 'string', 'literal',\n  'text', 'search', 'locate', 'look', 'looking', 'show', 'list', 'all',\n]);\n\n/**\n * Strip sentence punctuation from a URL match without breaking real query\n * strings (`?key=value`). A lone trailing `?` / `!` is English punctuation\n * (\"where is https://…/signup?\") — leaving it in the needle makes the literal\n * sweep miss the bare path in source.\n */\nfunction cleanUrlNeedle(raw: string): string {\n  let s = raw.trim();\n  // Trailing ) ] } > , ; : ! . from markdown links / sentence ends.\n  s = s.replace(/[.,;:!)\\]}>]+$/g, '');\n  // Lone trailing `?` → drop. Keep `?key=…` (content after `?`).\n  if (s.endsWith('?')) {\n    const qi = s.lastIndexOf('?');\n    if (qi === s.length - 1) s = s.slice(0, -1);\n  }\n  return s;\n}\n\n/**\n * Extract string/URL needles a caller is asking to *locate as text*, not as\n * bag-of-words symbol terms. URLs and quoted phrases are exact-match material\n * for the literal sweep (`search_symbols` / `search_code`); feeding their path\n * segments into lexical symbol ranking produces confidently wrong seeds\n * (dash → dashboard package, exist → NonExisting, …).\n */\nexport function extractLiteralNeedles(question: string): string[] {\n  const out: string[] = [];\n  const seen = new Set<string>();\n  const push = (raw: string, kind: 'url' | 'quote') => {\n    let s = raw.trim();\n    s = kind === 'url' ? cleanUrlNeedle(s) : s.replace(/[.,;:!)\\]}>?]+$/g, '');\n    if (s.length < 2 || seen.has(s)) return;\n    seen.add(s);\n    out.push(s);\n  };\n  for (const m of question.matchAll(/https?:\\/\\/[^\\s\"'`<>]+/gi)) push(m[0]!, 'url');\n  for (const m of question.matchAll(/([\"'`])((?:(?!\\1)[^\\\\]|\\\\.){2,})\\1/g)) {\n    push(m[2]!.replace(/\\\\(.)/g, '$1'), 'quote');\n  }\n  return out;\n}\n\n/** Question text with URL/quoted needles removed so residual tokens can name symbols. */\nexport function stripLiteralNeedles(question: string): string {\n  let s = question;\n  // Strip raw URL spans first (may still carry a trailing `?` from the ask).\n  for (const m of question.matchAll(/https?:\\/\\/[^\\s\"'`<>]+/gi)) {\n    s = s.split(m[0]!).join(' ');\n  }\n  for (const lit of extractLiteralNeedles(question)) {\n    s = s.split(lit).join(' ');\n  }\n  // Also strip bare quote pairs left behind.\n  s = s.replace(/([\"'`])\\s*\\1/g, ' ');\n  return s.replace(/\\s+/g, ' ').trim();\n}\n\n/**\n * Residual ask used for graph symbol ranking when the question embeds a\n * URL/quote. Empty when only framing words remain (\"where is …?\") so we do\n * not light up unrelated symbols like `applyPlan.where`.\n */\nexport function residualForSymbolSearch(question: string): string {\n  const literals = extractLiteralNeedles(question);\n  if (literals.length === 0) return question.trim();\n  const stripped = stripLiteralNeedles(question);\n  return tokenize(stripped).length === 0 ? '' : stripped;\n}\n\n/**\n * True when the instruction is a string/URL occurrence locate (not an edit).\n * Used to skip PatchIR grammar and answer from the literal sweep without\n * dumping constrained-decoding JSON into the VG Code panel.\n */\nexport function isLocateOnlyInstruction(instruction: string): boolean {\n  const q = instruction.trim();\n  if (!q) return false;\n  const needles = extractLiteralNeedles(q);\n  const hasLocateFrame =\n    /\\b(where\\s+is|where\\s+are|find\\s+(all\\s+|every\\s+)?occurrence|find\\s+occurrences|does\\s+not\\s+exist|locate|search\\s+for)\\b/i.test(\n      q,\n    ) ||\n    (needles.length > 0 && /^https?:\\/\\//i.test(q));\n  // Strong edit verbs cancel locate-only (ignore \"does not exist\" as non-edit).\n  const withoutExist = q.replace(/\\bdoes\\s+not\\s+exist\\b/gi, ' ');\n  if (\n    /\\b(fix|edit|change|replace|implement|refactor|rename|patch|create\\s+file|delete\\s+file|add\\s+a\\b|remove\\s+the\\b)\\b/i.test(\n      withoutExist,\n    )\n  ) {\n    return false;\n  }\n  if (needles.some((n) => /^https?:\\/\\//i.test(n))) return true;\n  return hasLocateFrame && needles.length > 0;\n}\n\nexport function queryGraph(graph: VgGraph, question: string, options: QueryOptions = {}): QueryResult {\n  const budget = options.budget ?? 2000;\n  const limit = options.limit ?? 12;\n  // When the ask embeds a URL or quoted string, score symbols only on the\n  // residual framing text. Empty residual → empty matches (honest miss) rather\n  // than path-token false positives that poison Task Capsules.\n  const literals = extractLiteralNeedles(question);\n  const forTokens = literals.length > 0 ? stripLiteralNeedles(question) : question;\n  const prep = prepareTerms(forTokens, options.relevance, priorResidual(options.priorQuestion));\n  const weightOf = termWeights(graph, prep.terms.map((t) => t.term));\n  const index = indexFor(graph);\n\n  const scored: QueryMatch[] = [];\n  // Two honest-miss paths: literal-only locate (no identifier terms after\n  // stripping needles) and weak-only asks (\"add a new feature\") whose every\n  // term is a process verb — seeding those from `add*`/`create*` surface\n  // matches is exactly the capsule-poisoning failure (field report 2026-07).\n  if (prep.hasContent) {\n    for (const node of graph.nodes) {\n      if (node.kind === 'file' || node.kind === 'external') continue;\n      const { score, why } = scoreNode(node, prep.terms, weightOf);\n      if (score > 0) {\n        const affinity = topicAffinity(node.id, options.relevance, options.topicTags);\n        scored.push({\n          node,\n          score: round(score * affinity.boost * (1 + IMPORTANCE_WEIGHT * node.importance)),\n          why: why + affinity.label,\n        });\n      }\n    }\n    scored.sort((a, b) => b.score - a.score || a.node.qualifiedName.localeCompare(b.node.qualifiedName));\n  }\n\n  const seeds = scored.slice(0, limit);\n  const { context, tokensEstimate } = buildContext(graph, index, question, seeds, budget, literals);\n\n  return { question, matches: seeds, context, tokensEstimate };\n}\n\nexport interface SemanticQueryOptions extends QueryOptions {\n  embedder: Embedder;\n  /** Precomputed node vectors (from getNodeEmbeddings); falls back to lexical for nodes without one. */\n  nodeVectors: Map<string, number[]>;\n}\n\n/**\n * Reciprocal Rank Fusion constant (the standard k=60). Fusing RANKINGS\n * instead of blending raw scores removes the need to calibrate two\n * incomparable scales (tiered lexical evidence vs cosine similarity): a node's\n * fused score is Σ 1/(k + rankᵢ) over the lists it appears in, so agreement\n * between signals dominates and a single signal's outlier magnitude cannot.\n */\nconst RRF_K = 60;\n\n/** 1-based ranks for a scored id list (desc score, qualifiedName tiebreak). */\nfunction ranksOf(scores: Map<string, number>, nameOf: (id: string) => string): Map<string, number> {\n  const ids = [...scores.entries()]\n    .filter(([, s]) => s > 0)\n    .sort((a, b) => b[1] - a[1] || nameOf(a[0]).localeCompare(nameOf(b[0])))\n    .map(([id]) => id);\n  return new Map(ids.map((id, i) => [id, i + 1]));\n}\n\n/**\n * Hybrid lexical + local-embedding retrieval, combined with Reciprocal Rank\n * Fusion (Phase 3.2 — replaces the former 50/50 score blend), so a question\n * like \"where do we handle auth failures?\" can surface `verify_token` even\n * with no shared identifier. Topic affinity and importance stay multiplicative\n * tiebreakers on the fused score. Deterministic given the same model + cached\n * vectors; embeddings live in a binary sidecar next to the map, never in `graph.json`.\n */\nexport async function queryGraphSemantic(\n  graph: VgGraph,\n  question: string,\n  options: SemanticQueryOptions,\n): Promise<QueryResult> {\n  const budget = options.budget ?? 2000;\n  const limit = options.limit ?? 12;\n  const literals = extractLiteralNeedles(question);\n  const forTokens = literals.length > 0 ? stripLiteralNeedles(question) : question;\n  const prep = prepareTerms(forTokens, options.relevance, priorResidual(options.priorQuestion));\n  const terms = prep.terms.map((t) => t.term);\n  const weightOf = termWeights(graph, terms);\n  const index = indexFor(graph);\n  // Embed the residual ask (without URL/quote noise) so semantic neighbours\n  // aren't dragged toward package names that share host path segments.\n  const queryVec = await options.embedder.embedQuery(forTokens || question);\n\n  // Raw lexical scores (pre-importance) — RRF consumes only their ORDER.\n  // Weak-only asks get no lexical evidence (same suppression as queryGraph);\n  // the semantic cosine below may still surface conceptual neighbours for them.\n  const lexRaw = new Map<string, number>();\n  const whyById = new Map<string, string>();\n  if (prep.hasContent) {\n    for (const node of graph.nodes) {\n      if (node.kind === 'file' || node.kind === 'external') continue;\n      const { score, why } = scoreNode(node, prep.terms, weightOf);\n      lexRaw.set(node.id, score);\n      whyById.set(node.id, why);\n    }\n  }\n\n  const scored: QueryMatch[] = [];\n  // Literal-only asks: skip the semantic loop entirely — embeddings over\n  // \"does not exist find occurrences\" still surface unrelated hubs.\n  if (terms.length > 0 || literals.length === 0) {\n    // Independent per-signal rankings, then RRF.\n    const semRaw = new Map<string, number>();\n    const nodeById = new Map<string, GraphNode>();\n    for (const node of graph.nodes) {\n      if (node.kind === 'file' || node.kind === 'external') continue;\n      nodeById.set(node.id, node);\n      const vec = options.nodeVectors.get(node.id);\n      const sem = vec && terms.length > 0 ? Math.max(0, cosine(queryVec, vec)) : 0;\n      if (sem > 0) semRaw.set(node.id, sem);\n    }\n    const nameOf = (id: string) => nodeById.get(id)?.qualifiedName ?? id;\n    const lexRanks = ranksOf(lexRaw, nameOf);\n    const semRanks = ranksOf(semRaw, nameOf);\n    for (const [id, node] of nodeById) {\n      const lr = lexRanks.get(id);\n      const sr = semRanks.get(id);\n      if (lr === undefined && sr === undefined) continue;\n      const fused = (lr !== undefined ? 1 / (RRF_K + lr) : 0) + (sr !== undefined ? 1 / (RRF_K + sr) : 0);\n      const sem = semRaw.get(id) ?? 0;\n      const lexWhy = whyById.get(id);\n      const affinity = topicAffinity(id, options.relevance, options.topicTags);\n      const why = (lexWhy || (sem > 0.3 ? `semantic match (${sem.toFixed(2)})` : 'weak match')) + affinity.label;\n      scored.push({ node, score: round(fused * affinity.boost * (1 + IMPORTANCE_WEIGHT * node.importance)), why });\n    }\n    scored.sort((a, b) => b.score - a.score || a.node.qualifiedName.localeCompare(b.node.qualifiedName));\n  }\n\n  const seeds = scored.slice(0, limit);\n  const { context, tokensEstimate } = buildContext(graph, index, question, seeds, budget, literals);\n  return { question, matches: seeds, context, tokensEstimate };\n}\n\n/**\n * Split on anything that isn't a Unicode letter/number (`\\p{L}\\p{N}`, not the\n * ASCII-only `[a-z0-9]`) so identifiers in non-Latin scripts (Japanese,\n * Cyrillic, ...) survive tokenization instead of vanishing entirely — the\n * ASCII-only split treated every character of e.g. `名前` as a separator,\n * producing zero terms and a guaranteed empty result for any question about\n * it (VG-LOCATE-FAILURE-ANALYSIS.md). Length floor is 1, not 2: a single\n * non-stopword letter/digit is still the whole identifier when that's genuinely\n * the symbol's name (adversarial fixtures deliberately use bare `f`/`x`/`h`\n * names to stress this) — STOPWORDS already screens out short function words.\n */\nfunction tokenize(q: string): string[] {\n  return [\n    ...new Set(\n      q\n        .toLowerCase()\n        .split(/[^\\p{L}\\p{N}]+/u)\n        .filter((t) => t.length >= 1 && !STOPWORDS.has(t)),\n    ),\n  ];\n}\n\n/** Ordered, lowercased token stream WITH stopwords — bigram concepts (\"sign in\",\n *  \"direct debit\") need adjacency over the raw word order. */\nfunction tokenizeOrdered(q: string): string[] {\n  return q\n    .toLowerCase()\n    .split(/[^\\p{L}\\p{N}]+/u)\n    .filter((t) => t.length >= 1);\n}\n\n/**\n * A query term with its role resolved. Roles decide how much evidence a match\n * carries (see scoreNode):\n *  - content  — names the topic; full weight, counts toward coverage\n *  - weak     — process verb (\"add\", \"create\", \"via\"); down-weighted, can only\n *               corroborate a content match, never carry a seed alone\n *  - expansion — concept vocabulary from the lexicon (\"payments\"→\"stripe\");\n *               reduced weight, counts as content evidence, provenance in `why`\n */\ninterface QueryTerm {\n  term: string;\n  weak: boolean;\n  /** Source token/bigram when this term came from concept expansion. */\n  from?: string;\n  /** Provider-supplied confidence (0..1) when this term came from the optional\n   *  relevance provider; replaces the flat EXPANSION_WEIGHT for that term. */\n  providerWeight?: number;\n  /** True when this term was carried over from the previous conversational\n   *  turn (QueryOptions.priorQuestion); scores at CARRY_WEIGHT. */\n  carried?: boolean;\n}\n\ninterface PreparedTerms {\n  terms: QueryTerm[];\n  /** True when at least one content or expansion term exists — the bar a\n   *  question must clear before ANY node may seed. */\n  hasContent: boolean;\n}\n\n/** Weak process verbs corroborate at a fraction of a content term's weight. */\nconst WEAK_TERM_WEIGHT = 0.25;\n/** Concept expansions score below a literal question term of the same rarity. */\nconst EXPANSION_WEIGHT = 0.7;\n/** Per extra distinct content term matched, the multiplicative coverage bonus.\n *  Multi-topic evidence (\"direct\" + \"debit\" + \"payments\") must beat any\n *  single-term surface hit (\"add\") by construction, not by luck. */\nconst COVERAGE_BONUS = 0.35;\n/** Terms carried from the previous conversational turn score at half weight:\n *  enough to keep a follow-up anchored to the conversation's topic (and to\n *  rescue weak-only follow-ups like \"can we use it?\"), never enough for stale\n *  context to outrank a clearly-named new topic in the current ask. */\nconst CARRY_WEIGHT = 0.5;\n\n/** Resolve term roles + concept expansions for the residual ask text. */\nfunction prepareTerms(forTokens: string, relevance?: RelevanceAnalysis | null, prior?: string | null): PreparedTerms {\n  const base = tokenize(forTokens);\n  const ordered = tokenizeOrdered(forTokens);\n  const baseSet = new Set(base);\n  // A token consumed by a fired bigram concept (\"direct\" in \"direct debits\")\n  // is demoted to the weak role: the bigram's expansions carry the topic, and\n  // the constituent alone is a distractor magnet (directGet, redirectUrl, …).\n  const consumed = bigramConsumedTokens(ordered);\n  const terms: QueryTerm[] = base.map((t) => ({ term: t, weak: WEAK_TERMS.has(t) || consumed.has(t) }));\n  const have = new Set(base);\n  for (const e of expandConcepts(ordered)) {\n    if (baseSet.has(e.term)) continue;\n    terms.push({ term: e.term, weak: false, from: e.from });\n    have.add(e.term);\n  }\n  // Provider expansions (already sanitized by engine/relevance-provider.ts)\n  // join as expansion-role terms with their own confidence weight. The\n  // built-in lexicon wins ties: a term it already produced is not re-added,\n  // so provider presence never changes the score of a lexicon-covered term.\n  for (const e of relevance?.expansions ?? []) {\n    if (have.has(e.term)) continue;\n    terms.push({ term: e.term, weak: false, from: e.from, providerWeight: e.weight });\n    have.add(e.term);\n  }\n  // Conversation carry-over: the previous turn's CONTENT terms (plus their\n  // lexicon expansions) join at CARRY_WEIGHT. Weak process verbs from the\n  // prior turn are dropped outright — carrying \"add\"/\"use\" forward would\n  // re-open the grab-bag failure this module exists to prevent. A term the\n  // current ask already produced is never re-added, so the current turn\n  // always wins ties and single-turn behaviour is byte-identical.\n  if (prior?.trim()) {\n    const priorOrdered = tokenizeOrdered(prior);\n    const priorConsumed = bigramConsumedTokens(priorOrdered);\n    for (const t of tokenize(prior)) {\n      if (have.has(t) || WEAK_TERMS.has(t) || priorConsumed.has(t)) continue;\n      terms.push({ term: t, weak: false, carried: true });\n      have.add(t);\n    }\n    for (const e of expandConcepts(priorOrdered)) {\n      if (have.has(e.term)) continue;\n      terms.push({ term: e.term, weak: false, from: e.from, carried: true });\n      have.add(e.term);\n    }\n  }\n  const hasContent = terms.some((t) => !t.weak);\n  return { terms, hasContent };\n}\n\n/** Residual text of the previous ask, with URL/quoted needles stripped so a\n *  pasted link in turn N-1 cannot poison turn N's carried vocabulary. */\nfunction priorResidual(prior: string | null | undefined): string | null {\n  const raw = prior?.trim();\n  if (!raw) return null;\n  return extractLiteralNeedles(raw).length > 0 ? stripLiteralNeedles(raw) : raw;\n}\n\n/**\n * Plain-language concept map for one ask: how its words were interpreted —\n * fired concept/bigram expansions, relevance-kernel topics and vocabulary,\n * and terms carried from the previous conversational turn. Rendered into the\n * Task Capsule so a model (especially a small local one) can read the\n * inference chain (\"direct debits\" → debit/mandate/…; topic payments →\n * stripe/billing/…) as sentences instead of reverse-engineering the `a→b`\n * slugs in per-seed match provenance. Deterministic and bounded; empty when\n * nothing fired (honest-empty asks stay empty).\n */\nexport function conceptMapLines(\n  question: string,\n  relevance?: RelevanceAnalysis | null,\n  priorQuestion?: string | null,\n): string[] {\n  const cap = (xs: string[]) => [...new Set(xs)].slice(0, 8).join(', ');\n  const literals = extractLiteralNeedles(question);\n  const residual = literals.length > 0 ? stripLiteralNeedles(question) : question;\n  const lines: string[] = [];\n\n  // Lexicon / bigram expansions, grouped by the ask term that fired them.\n  const byFrom = new Map<string, string[]>();\n  for (const e of expandConcepts(tokenizeOrdered(residual))) {\n    const list = byFrom.get(e.from) ?? [];\n    list.push(e.term);\n    byFrom.set(e.from, list);\n  }\n  for (const [from, terms] of byFrom) {\n    lines.push(`- \"${from}\" in the ask implies these codebase identifiers: ${cap(terms)}.`);\n  }\n\n  // ---------------------------------------------------------------------\n  // What the ask is about, deepest first.\n  //\n  // Order is the message. A reader (or a model) wants the most specific thing\n  // first — \"cname\" — then the product that makes it concrete — \"cloudflare\" —\n  // then the containing levels, widening out to \"infrastructure\". Files come\n  // after that, because they are where to look once you know what you are\n  // looking for. Corrections come last: they explain how the ask was read,\n  // which only matters once the reading itself is on the page.\n  // ---------------------------------------------------------------------\n  const matches = relevance?.taxonomy ?? [];\n  if (matches.length) {\n    // Every matched level, deduped, deepest first. Ties keep provider order,\n    // which is evidence-ranked.\n    const seenPath = new Set<string>();\n    const levels: Array<{ path: string; id: string; depth: number; terms: string[] }> = [];\n    for (const m of matches) {\n      for (const l of m.levels) {\n        if (seenPath.has(l.path)) continue;\n        seenPath.add(l.path);\n        levels.push({ path: l.path, id: l.id, depth: l.path.split('/').length, terms: l.terms });\n      }\n    }\n    const deepest = Math.max(...levels.map((l) => l.depth));\n    const describe = (l: { id: string; terms: string[] }, lead: string) =>\n      l.terms.length\n        ? `${lead} ${l.id}; code for it typically uses: ${cap(l.terms)}.`\n        : `${lead} ${l.id}.`;\n\n    for (const l of levels.filter((l) => l.depth === deepest)) {\n      lines.push(describe(l, '- The ask is specifically about'));\n    }\n\n    // The product named sits directly under the most specific topic — it is\n    // what turns that topic into this codebase's version of it. When the\n    // product IS the most specific topic, the line above already said so, and\n    // only the typed form is worth adding.\n    const deepestIds = new Set(levels.filter((l) => l.depth === deepest).map((l) => l.id));\n    for (const v of (relevance?.vendors ?? []).filter((v) => v.score > 0).slice(0, 3)) {\n      if (deepestIds.has(v.name)) {\n        if (v.from !== v.name) lines.push(`- That product was typed \"${v.from}\".`);\n        continue;\n      }\n      lines.push(\n        v.from === v.name\n          ? `- It names the product \"${v.name}\".`\n          : `- It names the product \"${v.name}\" (typed \"${v.from}\").`,\n      );\n    }\n\n    // Then widen, one level at a time — skipping any level the vendor line\n    // already named, so a Cloudflare ask does not say \"cloudflare\" twice.\n    const named = new Set((relevance?.vendors ?? []).map((v) => v.name));\n    for (let d = deepest - 1; d >= 1; d--) {\n      for (const l of levels.filter((l) => l.depth === d && !named.has(l.id))) {\n        lines.push(describe(l, '- More broadly, this is'));\n      }\n    }\n  } else if (relevance?.topics?.length) {\n    // Provider without a taxonomy (or an older one): flat topics, as before.\n    const topicVocab = new Map<string, string[]>();\n    for (const e of relevance.expansions ?? []) {\n      const list = topicVocab.get(e.from) ?? [];\n      list.push(e.term);\n      topicVocab.set(e.from, list);\n    }\n    for (const t of relevance.topics.slice(0, 3)) {\n      const vocab = topicVocab.get(t.id);\n      lines.push(\n        vocab?.length\n          ? `- The ask is about the \"${t.id}\" domain; code for it typically uses: ${cap(vocab)}.`\n          : `- The ask is about the \"${t.id}\" domain.`,\n      );\n    }\n  }\n\n  // What governs the work, named at the revision the provider tracks. This is\n  // the difference between \"this is accessibility work\" and \"this is\n  // accessibility work, and WCAG 2.2 is what it has to satisfy\".\n  const standards = relevance?.standards ?? [];\n  if (standards.length) {\n    const specs = standards.filter((st) => st.kind !== 'regulation');\n    const rules = standards.filter((st) => st.kind === 'regulation');\n    const render = (list: typeof standards) =>\n      list\n        .slice(0, 3)\n        .map((st) => (st.publisher ? `${st.name} (${st.publisher})` : st.name))\n        .join('; ');\n    // A spec and a legal duty are not the same obligation, so they are not\n    // pooled into one sentence.\n    if (specs.length) lines.push(`- Standards that govern this area: ${render(specs)}.`);\n    if (rules.length) lines.push(`- Regulations that apply here: ${render(rules)}.`);\n  }\n\n  // The site's own category slugs for everything above, so a reader (or a\n  // lookup) can cross-reference content by the same key.\n  const categories = relevance?.categories ?? [];\n  if (categories.length) {\n    lines.push(`- Related categories: ${cap(categories)}.`);\n  }\n\n  // Where that work usually lives — the concrete lead, after the abstract one.\n  const fileHints = relevance?.files ?? [];\n  if (fileHints.length) {\n    lines.push(`- Files for this kind of work are usually named or extended: ${cap(fileHints)}.`);\n  }\n\n  // How the ask was read, if it was read as something other than typed.\n  for (const c of (relevance?.corrections ?? []).slice(0, 3)) {\n    lines.push(`- Read \"${c.from}\" in the ask as \"${c.to}\".`);\n  }\n\n  // Conversation carry-over provenance.\n  const priorText = priorResidual(priorQuestion);\n  if (priorText) {\n    const current = new Set(tokenize(residual));\n    const consumed = bigramConsumedTokens(tokenizeOrdered(priorText));\n    const carried = tokenize(priorText).filter((t) => !current.has(t) && !WEAK_TERMS.has(t) && !consumed.has(t));\n    if (carried.length) {\n      lines.push(`- This is a follow-up; topic words carried from the previous ask: ${cap(carried)}.`);\n    }\n  }\n\n  if (lines.length) {\n    lines.push(\n      '- Seed notation below: `a→b` = ask term \"a\" implied identifier \"b\"; `~t` = word-form match; `↩t` = carried from the previous ask.',\n    );\n  }\n  return lines;\n}\n\nfunction scoreNode(node: GraphNode, terms: QueryTerm[], weightOf: (t: string) => number = () => 1): { score: number; why: string } {\n  let score = 0;\n  let contentHits = 0;\n  const hits: string[] = [];\n  const name = node.name.toLowerCase();\n  const qn = node.qualifiedName.toLowerCase();\n  const file = node.file.toLowerCase();\n  // Directory segments of the file path: a term naming a whole directory\n  // (\"payments\" → src/payments/…) is domain evidence, stronger than an\n  // incidental substring somewhere in the path.\n  const dirSegments = new Set(file.split('/').slice(0, -1));\n  // Split the ORIGINAL name on camelCase / snake_case, then lowercase the parts\n  // (splitting must see the capitals, so it happens before lowercasing).\n  const nameParts = identifierParts(node.name);\n  for (const { term: t, weak, from, providerWeight, carried } of terms) {\n    // Each term's contribution is weighted by its specificity (IDF over symbol\n    // names): a match on a distinctive term (\"toComparable\", \"layoutFor\") counts\n    // for more than a match on a term shared by hundreds of symbols (\"code\",\n    // \"get\", \"run\"). Without this, an incidental exact-name hit on a common word\n    // in a natural-language question outranked the conceptually-correct symbol,\n    // and importance weighting amplified the wrong hit (VG-NAVIGATION trace).\n    // Role multipliers stack on top: process verbs corroborate at a fraction,\n    // concept expansions score below a literal term of the same rarity.\n    // Expansion role multiplier: provider expansions carry their own 0..1\n    // confidence (capped at the lexicon's EXPANSION_WEIGHT so an installed\n    // provider can widen vocabulary but never outrank the reviewed lexicon's\n    // evidence class); lexicon expansions keep the flat EXPANSION_WEIGHT.\n    const expansionW = providerWeight !== undefined ? Math.min(providerWeight, EXPANSION_WEIGHT) : from ? EXPANSION_WEIGHT : 1;\n    const w = weightOf(t) * (weak ? WEAK_TERM_WEIGHT : 1) * expansionW * (carried ? CARRY_WEIGHT : 1);\n    const label = (carried ? '↩' : '') + (from ? `${from}→${t}` : t);\n    let contribution = 0;\n    if (name === t) {\n      contribution = 10 * w;\n      hits.push(label);\n    } else if (nameParts.has(t)) {\n      contribution = 6 * w;\n      hits.push(label);\n    } else if (name.includes(t)) {\n      contribution = 4 * w;\n      hits.push(label);\n    } else if (qn.includes(t)) {\n      contribution = 3 * w;\n      hits.push(label);\n    } else if (fuzzyPartMatch(t, nameParts)) {\n      // Morphological / subword match: \"authentication\" ↔ \"authenticate\"\n      // (shared prefix), so lexical ask survives word-form differences without\n      // a model. The semantic path handles non-shared-root synonyms.\n      contribution = 2 * w;\n      hits.push((carried ? '↩' : '') + (from ? `~${from}→${t}` : `~${t}`));\n    } else if (dirSegments.has(t)) {\n      contribution = 2 * w;\n      hits.push(label);\n    } else if (file.includes(t)) {\n      contribution = 1 * w;\n      hits.push(label);\n    }\n    if (contribution > 0) {\n      score += contribution;\n      if (!weak) contentHits += 1;\n    }\n  }\n  // A node whose only evidence is weak process verbs is noise by definition —\n  // the `add`-grab-bag capsule failure. Suppress it outright: weak terms\n  // corroborate content matches, they never carry a seed.\n  if (contentHits === 0) return { score: 0, why: '' };\n  // Reward multi-term topic coverage multiplicatively so converging evidence\n  // (\"direct\" + \"debit\" + payments-expansion) dominates single-term hits.\n  score *= 1 + COVERAGE_BONUS * Math.min(contentHits - 1, 4);\n  return { score, why: hits.length ? `matched: ${hits.join(', ')}` : '' };\n}\n\n/**\n * Importance is a mild tiebreaker, not a doubling. The old `1 + importance`\n * let a hub (importance→1) double its score and outrank a stronger textual\n * match on the actual target; at 0.4 a top hub adds at most 40%, enough to\n * break genuine ties without overriding term evidence.\n */\nconst IMPORTANCE_WEIGHT = 0.4;\n\n/**\n * Topic-affinity bonus cap: a node whose enrichment tags intersect the\n * question's inferred topics gains at most this fraction on top of its\n * textual evidence. Sized between IMPORTANCE_WEIGHT (0.4) and nothing:\n * strong enough to break domain ties (\"direct debits\" → the payments file\n * over an equal-scoring name hit elsewhere), never strong enough to outrank\n * a clearly better textual match — and it multiplies an existing non-zero\n * score, so it can never conjure a seed by itself.\n */\nconst TOPIC_AFFINITY_WEIGHT = 0.3;\n\n/** Affinity multiplier + provenance for one node under the current analysis. */\n/**\n * Shared root-first path depth between two taxonomy paths.\n * \"infrastructure/networking/dns/cname\" vs \"infrastructure/networking/dns\" → 3.\n */\nfunction sharedDepth(a: string, b: string): number {\n  const as = a.split('/');\n  const bs = b.split('/');\n  let n = 0;\n  while (n < as.length && n < bs.length && as[n] === bs[n]) n++;\n  return n;\n}\n\n/**\n * How strongly a node's taxonomy tags match what the ask is about.\n *\n * Tags and query matches are both PATHS, so agreement is measured by how far\n * down the tree they agree, not merely whether they share a label. A DNS ask\n * and a file tagged `infrastructure/networking/dns` agree three levels deep\n * and get most of the bonus; the same ask and a file tagged\n * `infrastructure/containers` agree only at the root and get a fraction of it.\n * That is the whole reason tags carry paths.\n *\n * Falls back to flat topic-id matching when the provider predates the\n * taxonomy (or a stale sidecar still holds flat tags), so an older install\n * ranks exactly as it did before.\n */\nfunction topicAffinity(\n  nodeId: string,\n  relevance: RelevanceAnalysis | null | undefined,\n  topicTags: Map<string, readonly string[]> | null | undefined,\n): { boost: number; label: string } {\n  if (!topicTags) return { boost: 1, label: '' };\n  const tags = topicTags.get(nodeId);\n  if (!tags?.length) return { boost: 1, label: '' };\n\n  const paths = relevance?.taxonomy ?? [];\n  if (paths.length && tags.some((t) => t.includes('/'))) {\n    let best = 0;\n    let label = '';\n    for (const match of paths) {\n      const askDepth = match.path.split('/').length;\n      for (const tag of tags) {\n        const shared = sharedDepth(match.path, tag);\n        if (shared === 0) continue;\n        // Specificity of agreement × confidence in the match.\n        const affinity = (shared / askDepth) * match.score;\n        if (affinity > best) {\n          best = affinity;\n          label = shared === askDepth ? match.path : match.path.split('/').slice(0, shared).join('/');\n        }\n      }\n    }\n    if (best <= 0) return { boost: 1, label: '' };\n    return { boost: 1 + TOPIC_AFFINITY_WEIGHT * Math.min(best, 1), label: `, topic:${label}` };\n  }\n\n  if (!relevance?.topics?.length) return { boost: 1, label: '' };\n  let affinity = 0;\n  const matched: string[] = [];\n  for (const t of relevance.topics) {\n    if (tags.includes(t.id)) {\n      affinity += t.score;\n      matched.push(t.id);\n    }\n  }\n  if (affinity <= 0) return { boost: 1, label: '' };\n  return { boost: 1 + TOPIC_AFFINITY_WEIGHT * Math.min(affinity, 1), label: `, topic:${matched.sort().join('+')}` };\n}\n\n/**\n * Per-term specificity weights (IDF) for one question, computed over the graph's\n * symbol-name vocabulary: `ln((N+1)/(df+1)) + 1`, clamped to a sane band. A term\n * that appears in one symbol name is highly discriminating; one that appears in\n * hundreds (\"get\", \"code\", \"run\", \"handler\") is near-noise. Clamped so a term\n * matching nothing (huge idf, but it scores 0 anyway) or everything can't\n * distort the scale. Cost is one O(nodes) pass, dwarfed by the scoring loop.\n */\nfunction termWeights(graph: VgGraph, terms: string[]): (t: string) => number {\n  if (terms.length === 0) return () => 1;\n  const df = new Map<string, number>();\n  let n = 0;\n  for (const node of graph.nodes) {\n    if (node.kind === 'file' || node.kind === 'external') continue;\n    n++;\n    const name = node.name.toLowerCase();\n    const parts = identifierParts(node.name);\n    for (const t of terms) {\n      if (parts.has(t) || name.includes(t)) df.set(t, (df.get(t) ?? 0) + 1);\n    }\n  }\n  const w = new Map<string, number>();\n  for (const t of terms) {\n    const idf = Math.log((n + 1) / ((df.get(t) ?? 0) + 1)) + 1;\n    // Ceiling of 8 (vs a natural df≈40 idf ≈ 5.4) keeps genuinely rare terms\n    // dominant while a term matching nothing/only a file path can't distort.\n    w.set(t, Math.max(0.5, Math.min(8, idf)));\n  }\n  return (t: string) => w.get(t) ?? 1;\n}\n\n/**\n * camelCase / snake_case / kebab split of an identifier → lowercased parts.\n * The separator alternative is Unicode-letter-aware (`\\p{L}\\p{N}`, not\n * ASCII-only `a-zA-Z0-9`) so non-Latin identifiers split on punctuation\n * without losing every character to it; the camelCase boundary lookaround\n * stays ASCII-only since upper/lowercase casing is itself an ASCII-script\n * concept — scripts without case simply never trigger it and fall through to\n * the separator split.\n */\nexport function identifierParts(name: string): Set<string> {\n  return new Set(\n    name\n      .split(/[^\\p{L}\\p{N}]+|(?<=[a-z0-9])(?=[A-Z])|(?<=[A-Z])(?=[A-Z][a-z])/u)\n      .filter(Boolean)\n      .map((s) => s.toLowerCase()),\n  );\n}\n\n/** A term fuzzily matches a part if they share a long-enough prefix (same root). */\nfunction fuzzyPartMatch(term: string, parts: Set<string>): boolean {\n  for (const part of parts) {\n    const shared = sharedPrefixLen(term, part);\n    if (shared >= 5 && shared >= 0.6 * Math.min(term.length, part.length)) return true;\n  }\n  return false;\n}\n\nfunction sharedPrefixLen(a: string, b: string): number {\n  const n = Math.min(a.length, b.length);\n  let i = 0;\n  while (i < n && a[i] === b[i]) i++;\n  return i;\n}\n\nfunction buildContext(\n  graph: VgGraph,\n  index: GraphIndex,\n  question: string,\n  seeds: QueryMatch[],\n  budget: number,\n  literals: string[] = [],\n): { context: string; tokensEstimate: number } {\n  const lines: string[] = [];\n  lines.push(`# Context for: ${question}`);\n  lines.push('');\n  if (literals.length) {\n    lines.push('## Literal string(s) to locate (exact text, not symbol names)');\n    for (const lit of literals) lines.push(`- \\`${lit}\\``);\n    lines.push(\n      '_Use a quoted phrase / URL search (`search_symbols` or `search_code` with the exact needle) for occurrences. Graph symbols below (if any) are residual identifier hints only._',\n    );\n    lines.push('');\n  }\n  if (seeds.length === 0) {\n    lines.push(\n      literals.length\n        ? '_No graph symbols matched residual terms — this is expected for a pure string/URL occurrence search. Run a literal sweep on the needle(s) above._'\n        : '_No matching symbols found in the map. Try different terms, or `vg hubs` for the most important code._',\n    );\n    const text = lines.join('\\n');\n    return { context: text, tokensEstimate: estimateTokens(text) };\n  }\n\n  for (const { node, why } of seeds) {\n    const block: string[] = [];\n    block.push(`## ${node.qualifiedName}  (${node.kind}, ${node.file}:${node.span.start})`);\n    if (node.signature) block.push('`' + node.signature + '`');\n    const callees = index.callees(node.id).map((x) => x.node.qualifiedName);\n    const callers = index.callers(node.id).map((x) => x.node.qualifiedName);\n    if (callees.length) block.push(`calls: ${unique(callees).slice(0, 8).join(', ')}`);\n    if (callers.length) block.push(`called by: ${unique(callers).slice(0, 8).join(', ')}`);\n    block.push(`importance ${node.importance.toFixed(3)} · area #${node.area}${node.isHub ? ' · hub' : ''} · ${why}`);\n    block.push('');\n\n    const candidate = lines.concat(block).join('\\n');\n    if (estimateTokens(candidate) > budget && lines.length > 2) break;\n    lines.push(...block);\n  }\n\n  const text = lines.join('\\n');\n  return { context: text, tokensEstimate: estimateTokens(text) };\n}\n\nfunction unique(xs: string[]): string[] {\n  return [...new Set(xs)];\n}\n\nfunction estimateTokens(text: string): number {\n  // ~4 chars per token, the standard rough estimate.\n  return Math.ceil(text.length / 4);\n}\n\nfunction round(x: number): number {\n  return Math.round(x * 1e6) / 1e6;\n}\n","import { indexFor } from './relations.js';\nimport type { EdgeKind, VgGraph } from '../schema.js';\n\n/**\n * Deterministic reverse-reachability impact analysis (VG-CLI-SPEC §3.5).\n *\n * \"What breaks if `<node>` changes\" = everything that (transitively) depends on\n * it: its callers, importers, and subtypes. We BFS *backwards* along dependency\n * edges, bounded by depth, with a confidence that decays with distance (direct =\n * high; transitive lower; ambiguous/dynamic edges already carry lower edge\n * confidence which we fold in). Test-impact selection (`--tests`) lands in\n * Phase 2; this is the structural blast radius.\n */\n\nconst DEPEND_EDGES = new Set<EdgeKind>(['call', 'import', 'extends', 'implements', 'references']);\n\nexport interface ImpactItem {\n  id: string;\n  name: string;\n  kind: string;\n  file: string;\n  line: number;\n  depth: number;\n  confidence: number;\n}\n\nexport interface ImpactResult {\n  root: { id: string; name: string };\n  depth: number;\n  affected: ImpactItem[];\n  direct: number;\n  transitive: number;\n  /** Lowest edge confidence encountered (e.g. a dynamic-dispatch edge). */\n  minEdgeConfidence: number;\n}\n\nexport function impactOf(graph: VgGraph, rootId: string, opts: { depth?: number } = {}): ImpactResult {\n  const maxDepth = Math.max(1, opts.depth ?? 4);\n  const index = indexFor(graph);\n  const root = index.node(rootId);\n\n  const affected = new Map<string, ImpactItem>();\n  let minEdgeConfidence = 1;\n\n  // BFS over incoming dependency edges (dependents of the frontier).\n  let frontier: { id: string; conf: number }[] = [{ id: rootId, conf: 1 }];\n  for (let depth = 1; depth <= maxDepth; depth++) {\n    const nextFrontier: { id: string; conf: number }[] = [];\n    for (const { id, conf } of frontier) {\n      for (const e of index.in(id)) {\n        if (!DEPEND_EDGES.has(e.kind)) continue;\n        minEdgeConfidence = Math.min(minEdgeConfidence, e.confidence);\n        const dependentId = e.src;\n        if (dependentId === rootId || affected.has(dependentId)) continue;\n        const node = index.node(dependentId);\n        if (!node) continue;\n        const conf2 = round(conf * e.confidence * 0.9); // decay with distance\n        affected.set(dependentId, {\n          id: node.id,\n          name: node.qualifiedName,\n          kind: node.kind,\n          file: node.file,\n          line: node.span.start,\n          depth,\n          confidence: conf2,\n        });\n        nextFrontier.push({ id: dependentId, conf: conf2 });\n      }\n    }\n    frontier = nextFrontier;\n    if (frontier.length === 0) break;\n  }\n\n  const items = [...affected.values()].sort(\n    (a, b) => a.depth - b.depth || b.confidence - a.confidence || a.name.localeCompare(b.name),\n  );\n\n  return {\n    root: { id: rootId, name: root?.qualifiedName ?? rootId },\n    depth: maxDepth,\n    affected: items,\n    direct: items.filter((i) => i.depth === 1).length,\n    transitive: items.filter((i) => i.depth > 1).length,\n    minEdgeConfidence: round(minEdgeConfidence),\n  };\n}\n\nfunction round(x: number): number {\n  return Math.round(x * 1e6) / 1e6;\n}\n"]}

package/dist/chunk-ADP6ITGF.js.map

@@ -1 +0,0 @@
-{"version":3,"sources":["../src/code/prompt.ts","../src/code/apply.ts","../src/code/diff.ts","../src/code/providers.ts"],"names":["i","j"],"mappings":";;;AAoBO,IAAM,kBAAA,GAAqB;AAAA,EAChC,6EAAA;AAAA,EACA,wFAAA;AAAA,EACA,qEAAA;AAAA,EACA,EAAA;AAAA,EACA,mEAAA;AAAA,EACA,EAAA;AAAA,EACA,gBAAA;AAAA,EACA,gBAAA;AAAA,EACA,+BAAA;AAAA,EACA,SAAA;AAAA,EACA,qBAAA;AAAA,EACA,iBAAA;AAAA,EACA,EAAA;AAAA,EACA,qFAAA;AAAA,EACA,wBAAA;AAAA,EACA,uBAAA;AAAA,EACA,kBAAA;AAAA,EACA,YAAA;AAAA,EACA,6CAAA;AAAA,EACA,EAAA;AAAA,EACA;AACF,CAAA,CAAE,KAAK,IAAI,CAAA;AAWJ,SAAS,cAAc,OAAA,EAAqC;AACjE,EAAA,OAAO;AAAA,IACL,EAAE,IAAA,EAAM,QAAA,EAAU,OAAA,EAAS,kBAAA,EAAmB;AAAA,IAC9C,EAAE,IAAA,EAAM,MAAA,EAAQ,OAAA,EAAS,QAAQ,QAAA,EAAS;AAAA,IAC1C,EAAE,IAAA,EAAM,MAAA,EAAQ,SAAS,CAAA,iCAAA,EAAoC,OAAA,CAAQ,WAAW,CAAA,CAAA;AAAG,GACrF;AACF;AAOO,IAAM,mBAAA,GAAsB;AAAA,EACjC,wHAAA;AAAA,EACA,wKAAA;AAAA,EACA,yGAAA;AAAA,EACA,wDAAA;AAAA,EACA,EAAA;AAAA,EACA,6FAAA;AAAA,EACA,uDAAA;AAAA,EACA,EAAA;AAAA,EACA,wHAAA;AAAA,EACA,0GAAA;AAAA,EACA,yDAAA;AAAA,EACA,EAAA;AAAA,EACA,0EAAA;AAAA,EACA,8EAAA;AAAA,EACA,6EAAA;AAAA,EACA,mFAAA;AAAA,EACA,EAAA;AAAA,EACA,gBAAA;AAAA,EACA,+DAAA;AAAA,EACA,uGAAA;AAAA,EACA,4GAAA;AAAA,EACA,4EAAA;AAAA,EACA,0GAAA;AAAA,EACA,yEAAA;AAAA,EACA,EAAA;AAAA,EACA,2BAAA;AAAA,EACA,iGAAA;AAAA,EACA,wHAAA;AAAA,EACA,4HAAA;AAAA,EACA,EAAA;AAAA,EACA,eAAA;AAAA,EACA,0GAAA;AAAA,EACA,gGAAA;AAAA,EACA,4EAAA;AAAA,EACA,EAAA;AAAA,EACA;AACF,CAAA,CAAE,KAAK,IAAI,CAAA;AAGJ,SAAS,mBAAmB,OAAA,EAAqC;AACtE,EAAA,OAAO;AAAA,IACL,EAAE,IAAA,EAAM,QAAA,EAAU,OAAA,EAAS,mBAAA,EAAoB;AAAA,IAC/C,EAAE,IAAA,EAAM,MAAA,EAAQ,OAAA,EAAS,QAAQ,QAAA,EAAS;AAAA,IAC1C,EAAE,IAAA,EAAM,MAAA,EAAQ,SAAS,CAAA,MAAA,EAAS,OAAA,CAAQ,WAAW,CAAA,CAAA;AAAG,GAC1D;AACF;;;AC/DO,SAAS,WAAW,IAAA,EAA0B;AACnD,EAAA,MAAM,QAAoB,EAAC;AAC3B,EAAA,MAAM,KAAA,GAAQ,IAAA,CAAK,KAAA,CAAM,IAAI,CAAA;AAC7B,EAAA,IAAI,CAAA,GAAI,CAAA;AACR,EAAA,IAAI,WAAA,GAAc,EAAA;AAElB,EAAA,MAAM,OAAA,GAAU,CAAC,CAAA,KAAuB,SAAA,CAAU,KAAK,CAAC,CAAA;AAExD,EAAA,OAAO,CAAA,GAAI,MAAM,MAAA,EAAQ;AACvB,IAAA,MAAM,IAAA,GAAO,MAAM,CAAC,CAAA;AAGpB,IAAA,MAAM,MAAA,GAAS,0BAAA,CAA2B,IAAA,CAAK,IAAI,CAAA;AACnD,IAAA,IAAI,MAAA,EAAQ;AACV,MAAA,MAAM,IAAA,GAAO,OAAO,CAAC,CAAA;AACrB,MAAA,MAAM,OAAiB,EAAC;AACxB,MAAA,CAAA,EAAA;AACA,MAAA,OAAO,CAAA,GAAI,MAAM,MAAA,IAAU,CAAC,qBAAqB,IAAA,CAAK,KAAA,CAAM,CAAC,CAAC,CAAA,EAAG;AAC/D,QAAA,IAAI,CAAC,OAAA,CAAQ,KAAA,CAAM,CAAC,CAAC,GAAG,IAAA,CAAK,IAAA,CAAK,KAAA,CAAM,CAAC,CAAC,CAAA;AAC1C,QAAA,CAAA,EAAA;AAAA,MACF;AACA,MAAA,CAAA,EAAA;AACA,MAAA,KAAA,CAAM,IAAA,CAAK,EAAE,EAAA,EAAI,QAAA,EAAU,IAAA,EAAM,SAAS,IAAA,CAAK,IAAA,CAAK,IAAI,CAAA,EAAG,CAAA;AAC3D,MAAA,WAAA,GAAc,EAAA;AACd,MAAA;AAAA,IACF;AAGA,IAAA,MAAM,GAAA,GAAM,0BAAA,CAA2B,IAAA,CAAK,IAAI,CAAA;AAChD,IAAA,IAAI,GAAA,EAAK;AACP,MAAA,KAAA,CAAM,IAAA,CAAK,EAAE,EAAA,EAAI,QAAA,EAAU,MAAM,GAAA,CAAI,CAAC,GAAG,CAAA;AACzC,MAAA,CAAA,EAAA;AACA,MAAA,WAAA,GAAc,EAAA;AACd,MAAA;AAAA,IACF;AAIA,IAAA,IAAI,oBAAA,CAAqB,IAAA,CAAK,IAAI,CAAA,EAAG;AACnC,MAAA,MAAM,IAAA,GAAO,WAAA;AACb,MAAA,MAAM,SAAmB,EAAC;AAC1B,MAAA,MAAM,UAAoB,EAAC;AAC3B,MAAA,CAAA,EAAA;AACA,MAAA,OAAO,CAAA,GAAI,MAAM,MAAA,IAAU,CAAC,gBAAgB,IAAA,CAAK,KAAA,CAAM,CAAC,CAAC,CAAA,EAAG;AAC1D,QAAA,MAAA,CAAO,IAAA,CAAK,KAAA,CAAM,CAAC,CAAC,CAAA;AACpB,QAAA,CAAA,EAAA;AAAA,MACF;AACA,MAAA,CAAA,EAAA;AACA,MAAA,OAAO,CAAA,GAAI,MAAM,MAAA,IAAU,CAAC,sBAAsB,IAAA,CAAK,KAAA,CAAM,CAAC,CAAC,CAAA,EAAG;AAChE,QAAA,OAAA,CAAQ,IAAA,CAAK,KAAA,CAAM,CAAC,CAAC,CAAA;AACrB,QAAA,CAAA,EAAA;AAAA,MACF;AACA,MAAA,CAAA,EAAA;AACA,MAAA,KAAA,CAAM,IAAA,CAAK;AAAA,QACT,EAAA,EAAI,SAAA;AAAA,QACJ,IAAA;AAAA,QACA,MAAA,EAAQ,MAAA,CAAO,IAAA,CAAK,IAAI,CAAA;AAAA,QACxB,OAAA,EAAS,OAAA,CAAQ,IAAA,CAAK,IAAI,CAAA;AAAA,QAC1B,YAAA,EAAc;AAAA,OACf,CAAA;AACD,MAAA;AAAA,IACF;AAIA,IAAA,MAAM,OAAA,GAAU,KAAK,IAAA,EAAK;AAC1B,IAAA,IAAI,OAAA,IAAW,CAAC,OAAA,CAAQ,IAAI,CAAA,IAAK,aAAA,CAAc,OAAO,CAAA,EAAG,WAAA,GAAc,OAAA,CAAQ,OAAA,CAAQ,QAAA,EAAU,EAAE,CAAA;AACnG,IAAA,CAAA,EAAA;AAAA,EACF;AAEA,EAAA,OAAO,KAAA;AACT;AAEA,SAAS,cAAc,CAAA,EAAoB;AACzC,EAAA,IAAI,IAAA,CAAK,KAAK,CAAA,CAAE,OAAA,CAAQ,MAAM,EAAE,CAAC,GAAG,OAAO,KAAA;AAC3C,EAAA,OAAO,KAAK,IAAA,CAAK,CAAC,CAAA,IAAK,uBAAA,CAAwB,KAAK,CAAC,CAAA;AACvD;AASO,SAAS,SAAA,CACd,OAAA,EACA,IAAA,EACA,KAAA,GAAsB,EAAC,EAC2B;AAClD,EAAA,IAAI,IAAA,CAAK,OAAO,QAAA,EAAU;AACxB,IAAA,IAAI,OAAA,KAAY,IAAA,IAAQ,OAAA,KAAY,IAAA,CAAK,OAAA,EAAS;AAChD,MAAA,OAAO,EAAE,OAAA,EAAS,OAAA,EAAS,EAAE,IAAA,EAAM,MAAA,EAAQ,UAAA,EAAY,MAAA,EAAQ,CAAA,EAAG,IAAA,CAAK,IAAI,CAAA,yFAAA,CAAA,EAAuF,EAAE;AAAA,IACtK;AACA,IAAA,OAAO,EAAE,OAAA,EAAS,IAAA,CAAK,OAAA,EAAS,SAAS,EAAE,IAAA,EAAM,MAAA,EAAQ,OAAA,KAAY,KAAK,OAAA,GAAU,OAAA,GAAU,SAAA,EAAW,SAAA,EAAW,SAAQ,EAAE;AAAA,EAChI;AAEA,EAAA,IAAI,IAAA,CAAK,OAAO,QAAA,EAAU;AACxB,IAAA,IAAI,YAAY,IAAA,EAAM,OAAO,EAAE,OAAA,EAAS,MAAM,OAAA,EAAS,EAAE,IAAA,EAAM,MAAA,EAAQ,SAAS,MAAA,EAAQ,CAAA,EAAG,IAAA,CAAK,IAAI,4CAAsC,EAAE;AAC5I,IAAA,OAAO,EAAE,OAAA,EAAS,IAAA,EAAM,OAAA,EAAS,EAAE,MAAM,MAAA,EAAQ,SAAA,EAAW,SAAA,EAAW,OAAA,EAAQ,EAAE;AAAA,EACnF;AAGA,EAAA,IAAI,YAAY,IAAA,EAAM;AACpB,IAAA,OAAO,EAAE,OAAA,EAAS,IAAA,EAAM,OAAA,EAAS,EAAE,MAAM,MAAA,EAAQ,WAAA,EAAa,MAAA,EAAQ,CAAA,EAAG,KAAK,IAAI,CAAA,6EAAA,EAA2E,IAAA,CAAK,IAAI,MAAK,EAAE;AAAA,EAC/K;AACA,EAAA,IAAI,IAAA,CAAK,WAAW,EAAA,EAAI;AAGtB,IAAA,IAAI,OAAA,KAAY,EAAA,EAAI,OAAO,EAAE,SAAS,IAAA,CAAK,OAAA,EAAS,OAAA,EAAS,EAAE,IAAA,EAAM,MAAA,EAAQ,SAAA,EAAW,SAAA,EAAW,SAAQ,EAAE;AAC7G,IAAA,OAAO,EAAE,SAAS,OAAA,EAAS,EAAE,MAAM,MAAA,EAAQ,SAAA,EAAW,MAAA,EAAQ,uFAAA,EAAmF,EAAE;AAAA,EACrJ;AACA,EAAA,IAAI,IAAA,CAAK,MAAA,KAAW,IAAA,CAAK,OAAA,EAAS;AAChC,IAAA,OAAO,EAAE,SAAS,OAAA,EAAS,EAAE,MAAM,MAAA,EAAQ,OAAA,EAAS,MAAA,EAAQ,mDAAA,EAA+C,EAAE;AAAA,EAC/G;AAEA,EAAA,MAAM,OAAA,GAAU,OAAO,OAAA,EAAS,IAAA,CAAK,QAAQ,IAAA,CAAK,YAAA,EAAc,KAAA,EAAO,IAAA,CAAK,IAAI,CAAA;AAChF,EAAA,IAAI,OAAA,CAAQ,SAAS,MAAA,EAAQ;AAC3B,IAAA,OAAO,EAAE,OAAA,EAAS,OAAA,EAAS,EAAE,IAAA,EAAM,MAAA,EAAQ,WAAA,EAAa,MAAA,EAAQ,CAAA,iCAAA,EAAoC,IAAA,CAAK,IAAI,CAAA,oEAAA,CAAA,EAAkE,EAAE;AAAA,EACnL;AACA,EAAA,IAAI,OAAA,CAAQ,SAAS,WAAA,EAAa;AAChC,IAAA,OAAO;AAAA,MACL,OAAA;AAAA,MACA,OAAA,EAAS;AAAA,QACP,IAAA;AAAA,QACA,MAAA,EAAQ,WAAA;AAAA,QACR,QAAQ,CAAA,wBAAA,EAA2B,OAAA,CAAQ,KAAK,CAAA,WAAA,EAAc,KAAK,IAAI,CAAA,oFAAA;AAAA;AACzE,KACF;AAAA,EACF;AACA,EAAA,MAAM,IAAA,GAAO,OAAA,CAAQ,KAAA,CAAM,CAAA,EAAG,OAAA,CAAQ,IAAI,CAAA,GAAI,IAAA,CAAK,OAAA,GAAU,OAAA,CAAQ,KAAA,CAAM,OAAA,CAAQ,EAAE,CAAA;AACrF,EAAA,OAAO,EAAE,OAAA,EAAS,IAAA,EAAM,OAAA,EAAS,EAAE,IAAA,EAAM,MAAA,EAAQ,SAAA,EAAW,SAAA,EAAW,OAAA,CAAQ,SAAA,EAAU,EAAE;AAC7F;AAUO,SAAS,WACd,KAAA,EACA,IAAA,EACA,WAAA,GAA8C,MAAM,EAAC,EACkC;AACvF,EAAA,MAAM,KAAA,uBAAY,GAAA,EAAsF;AACxG,EAAA,KAAA,MAAW,QAAQ,KAAA,EAAO;AACxB,IAAA,IAAI,KAAA,GAAQ,KAAA,CAAM,GAAA,CAAI,IAAA,CAAK,IAAI,CAAA;AAC/B,IAAA,IAAI,CAAC,KAAA,EAAO;AACV,MAAA,MAAM,MAAA,GAAS,IAAA,CAAK,IAAA,CAAK,IAAI,CAAA;AAC7B,MAAA,KAAA,GAAQ,EAAE,MAAA,EAAQ,KAAA,EAAO,MAAA,EAAQ,QAAA,EAAU,EAAC,EAAE;AAC9C,MAAA,KAAA,CAAM,GAAA,CAAI,IAAA,CAAK,IAAA,EAAM,KAAK,CAAA;AAAA,IAC5B;AACA,IAAA,MAAM,EAAE,OAAA,EAAS,OAAA,EAAQ,GAAI,SAAA,CAAU,KAAA,CAAM,KAAA,EAAO,IAAA,EAAM,WAAA,CAAY,IAAA,CAAK,IAAI,CAAC,CAAA;AAChF,IAAA,KAAA,CAAM,KAAA,GAAQ,OAAA;AACd,IAAA,KAAA,CAAM,QAAA,CAAS,KAAK,OAAO,CAAA;AAAA,EAC7B;AACA,EAAA,OAAO,KAAA;AACT;AAaA,SAAS,MAAA,CAAO,OAAA,EAAiB,MAAA,EAAgB,MAAA,EAA4B,OAAqB,IAAA,EAAuB;AACvH,EAAA,MAAM,KAAA,GAAQ,UAAA,CAAW,OAAA,EAAS,MAAM,CAAA;AACxC,EAAA,IAAI,MAAM,MAAA,KAAW,CAAA,SAAU,EAAE,IAAA,EAAM,UAAU,IAAA,EAAM,KAAA,CAAM,CAAC,CAAA,EAAG,IAAI,KAAA,CAAM,CAAC,IAAI,MAAA,CAAO,MAAA,EAAQ,WAAW,OAAA,EAAQ;AAClH,EAAA,IAAI,KAAA,CAAM,SAAS,CAAA,EAAG;AACpB,IAAA,MAAM,SAAS,aAAA,CAAc,OAAA,EAAS,KAAA,CAAM,GAAA,CAAI,CAAC,IAAA,MAAU,EAAE,IAAA,EAAM,EAAA,EAAI,OAAO,MAAA,CAAO,MAAA,GAAS,CAAA,EAAG,MAAA,EAAQ,OAAO,IAAI,CAAA;AACpH,IAAA,IAAI,QAAQ,OAAO,EAAE,GAAG,MAAA,EAAQ,WAAW,YAAA,EAAa;AACxD,IAAA,OAAO,EAAE,IAAA,EAAM,WAAA,EAAa,KAAA,EAAO,MAAM,MAAA,EAAO;AAAA,EAClD;AAIA,EAAA,MAAM,IAAA,GAAO,WAAA,CAAY,OAAA,EAAS,MAAM,CAAA;AACxC,EAAA,IAAI,KAAK,MAAA,KAAW,CAAA,SAAU,EAAE,IAAA,EAAM,UAAU,IAAA,EAAM,IAAA,CAAK,CAAC,CAAA,CAAE,MAAM,EAAA,EAAI,IAAA,CAAK,CAAC,CAAA,CAAE,EAAA,EAAI,WAAW,YAAA,EAAa;AAC5G,EAAA,IAAI,IAAA,CAAK,SAAS,CAAA,EAAG;AACnB,IAAA,MAAM,SAAS,aAAA,CAAc,OAAA,EAAS,IAAA,EAAM,MAAA,EAAQ,OAAO,IAAI,CAAA;AAC/D,IAAA,IAAI,QAAQ,OAAO,EAAE,GAAG,MAAA,EAAQ,WAAW,YAAA,EAAa;AACxD,IAAA,OAAO,EAAE,IAAA,EAAM,WAAA,EAAa,KAAA,EAAO,KAAK,MAAA,EAAO;AAAA,EACjD;AACA,EAAA,OAAO,EAAE,MAAM,MAAA,EAAO;AACxB;AAGA,SAAS,UAAA,CAAW,KAAa,MAAA,EAA0B;AACzD,EAAA,MAAM,MAAgB,EAAC;AACvB,EAAA,IAAI,MAAA,KAAW,IAAI,OAAO,GAAA;AAC1B,EAAA,IAAI,IAAA,GAAO,CAAA;AACX,EAAA,WAAS;AACP,IAAA,MAAM,GAAA,GAAM,GAAA,CAAI,OAAA,CAAQ,MAAA,EAAQ,IAAI,CAAA;AACpC,IAAA,IAAI,QAAQ,EAAA,EAAI;AAChB,IAAA,GAAA,CAAI,KAAK,GAAG,CAAA;AACZ,IAAA,IAAA,GAAO,MAAM,MAAA,CAAO,MAAA;AAAA,EACtB;AACA,EAAA,OAAO,GAAA;AACT;AAQA,SAAS,WAAA,CAAY,SAAiB,MAAA,EAAgD;AACpF,EAAA,MAAM,MAAA,GAAS,OAAA,CAAQ,KAAA,CAAM,IAAI,CAAA;AACjC,EAAA,MAAM,MAAA,GAAS,MAAA,CAAO,KAAA,CAAM,IAAI,CAAA;AAEhC,EAAA,OAAO,MAAA,CAAO,UAAU,MAAA,CAAO,CAAC,EAAE,IAAA,EAAK,KAAM,EAAA,EAAI,MAAA,CAAO,KAAA,EAAM;AAC9D,EAAA,OAAO,MAAA,CAAO,MAAA,IAAU,MAAA,CAAO,MAAA,CAAO,MAAA,GAAS,CAAC,CAAA,CAAE,IAAA,EAAK,KAAM,EAAA,EAAI,MAAA,CAAO,GAAA,EAAI;AAC5E,EAAA,IAAI,MAAA,CAAO,MAAA,KAAW,CAAA,EAAG,OAAO,EAAC;AACjC,EAAA,MAAM,QAAQ,MAAA,CAAO,GAAA,CAAI,CAAC,CAAA,KAAM,CAAA,CAAE,MAAM,CAAA;AAGxC,EAAA,MAAM,YAAsB,EAAC;AAC7B,EAAA,IAAI,GAAA,GAAM,CAAA;AACV,EAAA,KAAA,MAAW,KAAK,MAAA,EAAQ;AACtB,IAAA,SAAA,CAAU,KAAK,GAAG,CAAA;AAClB,IAAA,GAAA,IAAO,EAAE,MAAA,GAAS,CAAA;AAAA,EACpB;AAEA,EAAA,MAAM,MAAsC,EAAC;AAC7C,EAAA,KAAA,IAAS,IAAI,CAAA,EAAG,CAAA,GAAI,MAAM,MAAA,IAAU,MAAA,CAAO,QAAQ,CAAA,EAAA,EAAK;AACtD,IAAA,IAAI,EAAA,GAAK,IAAA;AACT,IAAA,KAAA,IAAS,CAAA,GAAI,CAAA,EAAG,CAAA,GAAI,KAAA,CAAM,QAAQ,CAAA,EAAA,EAAK;AACrC,MAAA,IAAI,MAAA,CAAO,IAAI,CAAC,CAAA,CAAE,MAAK,KAAM,KAAA,CAAM,CAAC,CAAA,EAAG;AACrC,QAAA,EAAA,GAAK,KAAA;AACL,QAAA;AAAA,MACF;AAAA,IACF;AACA,IAAA,IAAI,CAAC,EAAA,EAAI;AACT,IAAA,MAAM,IAAA,GAAO,UAAU,CAAC,CAAA;AACxB,IAAA,MAAM,QAAA,GAAW,CAAA,GAAI,KAAA,CAAM,MAAA,GAAS,CAAA;AACpC,IAAA,MAAM,KAAK,SAAA,CAAU,QAAQ,CAAA,GAAI,MAAA,CAAO,QAAQ,CAAA,CAAE,MAAA;AAClD,IAAA,GAAA,CAAI,IAAA,CAAK,EAAE,IAAA,EAAM,EAAA,EAAI,CAAA;AAAA,EACvB;AACA,EAAA,OAAO,GAAA;AACT;AAGA,SAAS,aAAA,CACP,OAAA,EACA,UAAA,EACA,MAAA,EACA,OACA,IAAA,EACqD;AACrD,EAAA,IAAI,CAAC,QAAQ,OAAO,IAAA;AACpB,EAAA,MAAM,IAAA,GAAO,KAAA,CAAM,IAAA,CAAK,CAAC,CAAA,KAAM,EAAE,IAAA,KAAS,IAAA,IAAQ,CAAA,CAAE,aAAA,KAAkB,MAAM,CAAA;AAC5E,EAAA,IAAI,CAAC,MAAM,OAAO,IAAA;AAClB,EAAA,MAAM,MAAA,GAAS,YAAY,OAAO,CAAA;AAClC,EAAA,MAAM,MAAA,GAAS,UAAA,CAAW,MAAA,CAAO,CAAC,CAAA,KAAM;AACtC,IAAA,MAAM,IAAA,GAAO,MAAA,CAAO,CAAA,CAAE,IAAI,CAAA;AAC1B,IAAA,OAAO,IAAA,IAAQ,IAAA,CAAK,KAAA,IAAS,IAAA,IAAQ,IAAA,CAAK,GAAA;AAAA,EAC5C,CAAC,CAAA;AACD,EAAA,IAAI,OAAO,MAAA,KAAW,CAAA,EAAG,OAAO,EAAE,MAAM,QAAA,EAAU,IAAA,EAAM,MAAA,CAAO,CAAC,EAAE,IAAA,EAAM,EAAA,EAAI,MAAA,CAAO,CAAC,EAAE,EAAA,EAAG;AACzF,EAAA,OAAO,IAAA;AACT;AAGA,SAAS,YAAY,OAAA,EAA6C;AAChE,EAAA,MAAM,MAAA,GAAmB,CAAC,CAAC,CAAA;AAC3B,EAAA,KAAA,IAAS,CAAA,GAAI,CAAA,EAAG,CAAA,GAAI,OAAA,CAAQ,QAAQ,CAAA,EAAA,EAAK,IAAI,OAAA,CAAQ,CAAC,CAAA,KAAM,IAAA,EAAM,MAAA,CAAO,IAAA,CAAK,IAAI,CAAC,CAAA;AACnF,EAAA,OAAO,CAAC,MAAA,KAAmB;AAEzB,IAAA,IAAI,EAAA,GAAK,CAAA;AACT,IAAA,IAAI,EAAA,GAAK,OAAO,MAAA,GAAS,CAAA;AACzB,IAAA,OAAO,KAAK,EAAA,EAAI;AACd,MAAA,MAAM,GAAA,GAAO,EAAA,GAAK,EAAA,GAAK,CAAA,IAAM,CAAA;AAC7B,MAAA,IAAI,MAAA,CAAO,GAAG,CAAA,IAAK,MAAA,EAAQ,EAAA,GAAK,GAAA;AAAA,gBACtB,GAAA,GAAM,CAAA;AAAA,IAClB;AACA,IAAA,OAAO,EAAA,GAAK,CAAA;AAAA,EACd,CAAA;AACF;;;ACjUO,SAAS,WAAA,CAAY,MAAA,EAAuB,KAAA,EAAsB,IAAA,EAAc,UAAU,CAAA,EAAW;AAC1G,EAAA,IAAI,MAAA,KAAW,OAAO,OAAO,EAAA;AAC7B,EAAA,IAAI,WAAW,IAAA,EAAM,OAAO,WAAA,CAAY,KAAA,IAAS,IAAI,IAAI,CAAA;AACzD,EAAA,IAAI,KAAA,KAAU,IAAA,EAAM,OAAO,eAAA,CAAgB,QAAQ,IAAI,CAAA;AAEvD,EAAA,MAAM,CAAA,GAAI,WAAW,MAAM,CAAA;AAC3B,EAAA,MAAM,CAAA,GAAI,WAAW,KAAK,CAAA;AAC1B,EAAA,MAAM,GAAA,GAAM,SAAA,CAAU,CAAA,EAAG,CAAC,CAAA;AAC1B,EAAA,MAAM,KAAA,GAAQ,UAAA,CAAW,GAAA,EAAK,OAAO,CAAA;AACrC,EAAA,IAAI,KAAA,CAAM,MAAA,KAAW,CAAA,EAAG,OAAO,EAAA;AAE/B,EAAA,MAAM,MAAgB,CAAC,CAAA,MAAA,EAAS,IAAI,CAAA,CAAA,EAAI,CAAA,MAAA,EAAS,IAAI,CAAA,CAAE,CAAA;AACvD,EAAA,KAAA,MAAW,KAAK,KAAA,EAAO;AACrB,IAAA,GAAA,CAAI,IAAA,CAAK,CAAA,IAAA,EAAO,CAAA,CAAE,MAAM,CAAA,CAAA,EAAI,CAAA,CAAE,IAAI,CAAA,EAAA,EAAK,CAAA,CAAE,MAAM,CAAA,CAAA,EAAI,CAAA,CAAE,IAAI,CAAA,GAAA,CAAK,CAAA;AAC9D,IAAA,KAAA,MAAW,IAAA,IAAQ,CAAA,CAAE,KAAA,EAAO,GAAA,CAAI,KAAK,IAAI,CAAA;AAAA,EAC3C;AACA,EAAA,OAAO,GAAA,CAAI,KAAK,IAAI,CAAA;AACtB;AAOA,IAAM,kBAAA,GAAqB,EAAA;AAE3B,SAAS,WAAA,CAAY,OAAe,IAAA,EAAsB;AACxD,EAAA,MAAM,KAAA,GAAQ,WAAW,KAAK,CAAA;AAC9B,EAAA,MAAM,GAAA,GAAM,CAAC,CAAA,aAAA,CAAA,EAAiB,CAAA,MAAA,EAAS,IAAI,CAAA,CAAA,EAAI,CAAA,WAAA,EAAc,KAAA,CAAM,MAAM,CAAA,GAAA,CAAK,CAAA;AAC9E,EAAA,IAAI,KAAA,CAAM,SAAS,kBAAA,EAAoB;AACrC,IAAA,GAAA,CAAI,IAAA,CAAK,CAAA,QAAA,EAAM,KAAA,CAAM,MAAM,CAAA,mBAAA,CAAgB,CAAA;AAC3C,IAAA,OAAO,GAAA,CAAI,KAAK,IAAI,CAAA;AAAA,EACtB;AACA,EAAA,KAAA,MAAW,KAAK,KAAA,EAAO,GAAA,CAAI,IAAA,CAAK,CAAA,CAAA,EAAI,CAAC,CAAA,CAAE,CAAA;AACvC,EAAA,OAAO,GAAA,CAAI,KAAK,IAAI,CAAA;AACtB;AAEA,SAAS,eAAA,CAAgB,QAAgB,IAAA,EAAsB;AAC7D,EAAA,MAAM,KAAA,GAAQ,WAAW,MAAM,CAAA;AAC/B,EAAA,MAAM,IAAI,KAAA,CAAM,MAAA;AAChB,EAAA,MAAM,GAAA,GAAM,CAAC,CAAA,MAAA,EAAS,IAAI,IAAI,CAAA,aAAA,CAAA,EAAiB,CAAA,MAAA,EAAS,CAAC,CAAA,QAAA,CAAU,CAAA;AAGnE,EAAA,IAAI,IAAI,kBAAA,EAAoB;AAC1B,IAAA,GAAA,CAAI,IAAA,CAAK,CAAA,QAAA,EAAM,CAAC,CAAA,qBAAA,CAAkB,CAAA;AAClC,IAAA,OAAO,GAAA,CAAI,KAAK,IAAI,CAAA;AAAA,EACtB;AACA,EAAA,KAAA,MAAW,KAAK,KAAA,EAAO,GAAA,CAAI,IAAA,CAAK,CAAA,CAAA,EAAI,CAAC,CAAA,CAAE,CAAA;AACvC,EAAA,OAAO,GAAA,CAAI,KAAK,IAAI,CAAA;AACtB;AAEA,SAAS,WAAW,CAAA,EAAqB;AACvC,EAAA,IAAI,CAAA,KAAM,EAAA,EAAI,OAAO,EAAC;AACtB,EAAA,MAAM,KAAA,GAAQ,CAAA,CAAE,KAAA,CAAM,IAAI,CAAA;AAE1B,EAAA,IAAI,KAAA,CAAM,UAAU,KAAA,CAAM,KAAA,CAAM,SAAS,CAAC,CAAA,KAAM,EAAA,EAAI,KAAA,CAAM,GAAA,EAAI;AAC9D,EAAA,OAAO,KAAA;AACT;AASA,SAAS,SAAA,CAAU,GAAa,CAAA,EAAmB;AACjD,EAAA,MAAM,IAAI,CAAA,CAAE,MAAA;AACZ,EAAA,MAAM,IAAI,CAAA,CAAE,MAAA;AACZ,EAAA,MAAM,KAAiB,KAAA,CAAM,IAAA,CAAK,EAAE,MAAA,EAAQ,IAAI,CAAA,EAAE,EAAG,MAAM,IAAI,MAAM,CAAA,GAAI,CAAC,CAAA,CAAE,IAAA,CAAK,CAAC,CAAC,CAAA;AACnF,EAAA,KAAA,IAASA,EAAAA,GAAI,CAAA,GAAI,CAAA,EAAGA,EAAAA,IAAK,GAAGA,EAAAA,EAAAA,EAAK;AAC/B,IAAA,KAAA,IAASC,EAAAA,GAAI,CAAA,GAAI,CAAA,EAAGA,EAAAA,IAAK,GAAGA,EAAAA,EAAAA,EAAK;AAC/B,MAAA,EAAA,CAAGD,EAAC,CAAA,CAAEC,EAAC,CAAA,GAAI,CAAA,CAAED,EAAC,CAAA,KAAM,CAAA,CAAEC,EAAC,CAAA,GAAI,EAAA,CAAGD,EAAAA,GAAI,CAAC,CAAA,CAAEC,EAAAA,GAAI,CAAC,CAAA,GAAI,CAAA,GAAI,IAAA,CAAK,GAAA,CAAI,EAAA,CAAGD,KAAI,CAAC,CAAA,CAAEC,EAAC,CAAA,EAAG,EAAA,CAAGD,EAAC,CAAA,CAAEC,EAAAA,GAAI,CAAC,CAAC,CAAA;AAAA,IACvF;AAAA,EACF;AACA,EAAA,MAAM,MAAY,EAAC;AACnB,EAAA,IAAI,CAAA,GAAI,CAAA;AACR,EAAA,IAAI,CAAA,GAAI,CAAA;AACR,EAAA,OAAO,CAAA,GAAI,CAAA,IAAK,CAAA,GAAI,CAAA,EAAG;AACrB,IAAA,IAAI,CAAA,CAAE,CAAC,CAAA,KAAM,CAAA,CAAE,CAAC,CAAA,EAAG;AACjB,MAAA,GAAA,CAAI,IAAA,CAAK,EAAE,GAAA,EAAK,IAAA,EAAM,MAAM,CAAA,CAAE,CAAC,GAAG,CAAA;AAClC,MAAA,CAAA,EAAA;AACA,MAAA,CAAA,EAAA;AAAA,IACF,CAAA,MAAA,IAAW,EAAA,CAAG,CAAA,GAAI,CAAC,CAAA,CAAE,CAAC,CAAA,IAAK,EAAA,CAAG,CAAC,CAAA,CAAE,CAAA,GAAI,CAAC,CAAA,EAAG;AACvC,MAAA,GAAA,CAAI,IAAA,CAAK,EAAE,GAAA,EAAK,KAAA,EAAO,MAAM,CAAA,CAAE,CAAC,GAAG,CAAA;AACnC,MAAA,CAAA,EAAA;AAAA,IACF,CAAA,MAAO;AACL,MAAA,GAAA,CAAI,IAAA,CAAK,EAAE,GAAA,EAAK,KAAA,EAAO,MAAM,CAAA,CAAE,CAAC,GAAG,CAAA;AACnC,MAAA,CAAA,EAAA;AAAA,IACF;AAAA,EACF;AACA,EAAA,OAAO,CAAA,GAAI,CAAA,EAAG,GAAA,CAAI,IAAA,CAAK,EAAE,GAAA,EAAK,KAAA,EAAO,IAAA,EAAM,CAAA,CAAE,CAAA,EAAG,CAAA,EAAG,CAAA;AACnD,EAAA,OAAO,CAAA,GAAI,CAAA,EAAG,GAAA,CAAI,IAAA,CAAK,EAAE,GAAA,EAAK,KAAA,EAAO,IAAA,EAAM,CAAA,CAAE,CAAA,EAAG,CAAA,EAAG,CAAA;AACnD,EAAA,OAAO,GAAA;AACT;AAWA,SAAS,UAAA,CAAW,KAAW,OAAA,EAAyB;AAEtD,EAAA,MAAM,YAAY,GAAA,CAAI,GAAA,CAAI,CAAC,CAAA,EAAG,MAAO,CAAA,CAAE,GAAA,KAAQ,IAAA,GAAO,EAAA,GAAK,CAAE,CAAA,CAAE,MAAA,CAAO,CAAC,CAAA,KAAM,KAAK,CAAC,CAAA;AACnF,EAAA,IAAI,SAAA,CAAU,MAAA,KAAW,CAAA,EAAG,OAAO,EAAC;AAGpC,EAAA,MAAM,UAA8B,EAAC;AACrC,EAAA,IAAI,QAAQ,IAAA,CAAK,GAAA,CAAI,GAAG,SAAA,CAAU,CAAC,IAAI,OAAO,CAAA;AAC9C,EAAA,IAAI,GAAA,GAAM,KAAK,GAAA,CAAI,GAAA,CAAI,SAAS,CAAA,EAAG,SAAA,CAAU,CAAC,CAAA,GAAI,OAAO,CAAA;AACzD,EAAA,KAAA,IAAS,CAAA,GAAI,CAAA,EAAG,CAAA,GAAI,SAAA,CAAU,QAAQ,CAAA,EAAA,EAAK;AACzC,IAAA,MAAM,KAAK,IAAA,CAAK,GAAA,CAAI,GAAG,SAAA,CAAU,CAAC,IAAI,OAAO,CAAA;AAC7C,IAAA,MAAM,EAAA,GAAK,KAAK,GAAA,CAAI,GAAA,CAAI,SAAS,CAAA,EAAG,SAAA,CAAU,CAAC,CAAA,GAAI,OAAO,CAAA;AAC1D,IAAA,IAAI,EAAA,IAAM,MAAM,CAAA,EAAG;AACjB,MAAA,GAAA,GAAM,EAAA;AAAA,IACR,CAAA,MAAO;AACL,MAAA,OAAA,CAAQ,IAAA,CAAK,CAAC,KAAA,EAAO,GAAG,CAAC,CAAA;AACzB,MAAA,KAAA,GAAQ,EAAA;AACR,MAAA,GAAA,GAAM,EAAA;AAAA,IACR;AAAA,EACF;AACA,EAAA,OAAA,CAAQ,IAAA,CAAK,CAAC,KAAA,EAAO,GAAG,CAAC,CAAA;AAEzB,EAAA,MAAM,QAAgB,EAAC;AAEvB,EAAA,IAAI,KAAA,GAAQ,CAAA;AACZ,EAAA,IAAI,KAAA,GAAQ,CAAA;AACZ,EAAA,IAAI,GAAA,GAAM,CAAA;AACV,EAAA,KAAA,MAAW,CAAC,EAAA,EAAI,EAAE,CAAA,IAAK,OAAA,EAAS;AAE9B,IAAA,OAAO,MAAM,EAAA,EAAI;AACf,MAAA,MAAM,CAAA,GAAI,IAAI,GAAG,CAAA;AACjB,MAAA,IAAI,CAAA,CAAE,QAAQ,KAAA,EAAO,KAAA,EAAA;AACrB,MAAA,IAAI,CAAA,CAAE,QAAQ,KAAA,EAAO,KAAA,EAAA;AACrB,MAAA,GAAA,EAAA;AAAA,IACF;AACA,IAAA,MAAM,IAAA,GAAa,EAAE,MAAA,EAAQ,KAAA,EAAO,IAAA,EAAM,CAAA,EAAG,MAAA,EAAQ,KAAA,EAAO,IAAA,EAAM,CAAA,EAAG,KAAA,EAAO,EAAC,EAAE;AAC/E,IAAA,KAAA,IAAS,CAAA,GAAI,EAAA,EAAI,CAAA,IAAK,EAAA,EAAI,CAAA,EAAA,EAAK;AAC7B,MAAA,MAAM,CAAA,GAAI,IAAI,CAAC,CAAA;AACf,MAAA,IAAI,CAAA,CAAE,QAAQ,IAAA,EAAM;AAClB,QAAA,IAAA,CAAK,KAAA,CAAM,IAAA,CAAK,CAAA,CAAA,EAAI,CAAA,CAAE,IAAI,CAAA,CAAE,CAAA;AAC5B,QAAA,IAAA,CAAK,IAAA,EAAA;AACL,QAAA,IAAA,CAAK,IAAA,EAAA;AACL,QAAA,KAAA,EAAA;AACA,QAAA,KAAA,EAAA;AAAA,MACF,CAAA,MAAA,IAAW,CAAA,CAAE,GAAA,KAAQ,KAAA,EAAO;AAC1B,QAAA,IAAA,CAAK,KAAA,CAAM,IAAA,CAAK,CAAA,CAAA,EAAI,CAAA,CAAE,IAAI,CAAA,CAAE,CAAA;AAC5B,QAAA,IAAA,CAAK,IAAA,EAAA;AACL,QAAA,KAAA,EAAA;AAAA,MACF,CAAA,MAAO;AACL,QAAA,IAAA,CAAK,KAAA,CAAM,IAAA,CAAK,CAAA,CAAA,EAAI,CAAA,CAAE,IAAI,CAAA,CAAE,CAAA;AAC5B,QAAA,IAAA,CAAK,IAAA,EAAA;AACL,QAAA,KAAA,EAAA;AAAA,MACF;AACA,MAAA,GAAA,GAAM,CAAA,GAAI,CAAA;AAAA,IACZ;AAEA,IAAA,IAAI,IAAA,CAAK,IAAA,KAAS,CAAA,EAAG,IAAA,CAAK,MAAA,GAAS,KAAK,GAAA,CAAI,CAAA,EAAG,IAAA,CAAK,MAAA,GAAS,CAAC,CAAA;AAC9D,IAAA,IAAI,IAAA,CAAK,IAAA,KAAS,CAAA,EAAG,IAAA,CAAK,MAAA,GAAS,KAAK,GAAA,CAAI,CAAA,EAAG,IAAA,CAAK,MAAA,GAAS,CAAC,CAAA;AAC9D,IAAA,KAAA,CAAM,KAAK,IAAI,CAAA;AAAA,EACjB;AACA,EAAA,OAAO,KAAA;AACT;AAOO,SAAS,eAAe,IAAA,EAAkD;AAC/E,EAAA,IAAI,CAAC,IAAA,EAAM,OAAO,EAAE,KAAA,EAAO,CAAA,EAAG,SAAS,CAAA,EAAE;AAEzC,EAAA,MAAM,aAAA,GAAgB,uBAAA,CAAwB,IAAA,CAAK,IAAI,CAAA;AACvD,EAAA,MAAM,aAAA,GAAgB,oBAAA,CAAqB,IAAA,CAAK,IAAI,CAAA;AACpD,EAAA,IAAI,aAAA,EAAe;AACjB,IAAA,MAAM,CAAA,GAAI,IAAA,CAAK,KAAA,CAAM,oCAAoC,CAAA;AACzD,IAAA,IAAI,CAAA,EAAG;AACL,MAAA,MAAM,CAAA,GAAI,CAAA,CAAE,CAAC,CAAA,IAAK,OAAO,MAAA,CAAO,CAAA,CAAE,CAAC,CAAC,CAAA,GAAI,MAAA,CAAO,CAAA,CAAE,CAAC,CAAC,CAAA,IAAK,CAAA;AACxD,MAAA,OAAO,EAAE,OAAO,CAAA,EAAG,OAAA,EAAS,OAAO,QAAA,CAAS,CAAC,CAAA,GAAI,CAAA,GAAI,CAAA,EAAE;AAAA,IACzD;AAAA,EACF;AACA,EAAA,IAAI,aAAA,EAAe;AACjB,IAAA,MAAM,CAAA,GAAI,IAAA,CAAK,KAAA,CAAM,oCAAoC,CAAA;AACzD,IAAA,IAAI,CAAA,EAAG;AACL,MAAA,MAAM,CAAA,GAAI,CAAA,CAAE,CAAC,CAAA,IAAK,OAAO,MAAA,CAAO,CAAA,CAAE,CAAC,CAAC,CAAA,GAAI,MAAA,CAAO,CAAA,CAAE,CAAC,CAAC,CAAA,IAAK,CAAA;AACxD,MAAA,OAAO,EAAE,OAAO,MAAA,CAAO,QAAA,CAAS,CAAC,CAAA,GAAI,CAAA,GAAI,CAAA,EAAG,OAAA,EAAS,CAAA,EAAE;AAAA,IACzD;AAAA,EACF;AAEA,EAAA,IAAI,KAAA,GAAQ,CAAA;AACZ,EAAA,IAAI,OAAA,GAAU,CAAA;AACd,EAAA,KAAA,MAAW,IAAA,IAAQ,IAAA,CAAK,KAAA,CAAM,IAAI,CAAA,EAAG;AACnC,IAAA,IAAI,IAAA,CAAK,WAAW,GAAG,CAAA,IAAK,CAAC,IAAA,CAAK,UAAA,CAAW,KAAK,CAAA,EAAG,KAAA,EAAA;AAAA,SAAA,IAC5C,IAAA,CAAK,WAAW,GAAG,CAAA,IAAK,CAAC,IAAA,CAAK,UAAA,CAAW,KAAK,CAAA,EAAG,OAAA,EAAA;AAAA,EAC5D;AACA,EAAA,OAAO,EAAE,OAAO,OAAA,EAAQ;AAC1B;AAGO,SAAS,eAAe,KAAA,EAAiD;AAC9E,EAAA,IAAI,IAAA,GAAO,CAAA;AACX,EAAA,IAAI,IAAA,GAAO,CAAA;AACX,EAAA,IAAI,OAAA,GAAU,CAAA;AACd,EAAA,KAAA,MAAW,EAAE,IAAA,EAAK,IAAK,KAAA,EAAO;AAC5B,IAAA,IAAI,CAAC,IAAA,EAAM;AACX,IAAA,OAAA,EAAA;AACA,IAAA,MAAM,EAAE,KAAA,EAAO,OAAA,EAAQ,GAAI,eAAe,IAAI,CAAA;AAC9C,IAAA,IAAA,IAAQ,KAAA;AACR,IAAA,IAAA,IAAQ,OAAA;AAAA,EACV;AACA,EAAA,OAAO,CAAA,CAAA,EAAI,IAAI,CAAA,EAAA,EAAK,IAAI,WAAW,OAAO,CAAA,QAAA,CAAA;AAC5C;;;ACxMA,SAAS,eAAe,QAAA,EAAoC;AAC1D,EAAA,OAAO,QAAA,CAAS,GAAA,CAAI,CAAC,CAAA,KAAM;AACzB,IAAA,IAAI,CAAA,CAAE,IAAA,KAAS,MAAA,EAAQ,OAAO,EAAE,IAAA,EAAM,MAAA,EAAQ,YAAA,EAAc,CAAA,CAAE,YAAY,IAAA,EAAM,CAAA,CAAE,IAAA,EAAM,OAAA,EAAS,EAAE,OAAA,EAAQ;AAC3G,IAAA,IAAI,CAAA,CAAE,IAAA,KAAS,WAAA,IAAe,CAAA,CAAE,WAAW,MAAA,EAAQ;AACjD,MAAA,OAAO;AAAA,QACL,IAAA,EAAM,WAAA;AAAA,QACN,OAAA,EAAS,EAAE,OAAA,IAAW,IAAA;AAAA,QACtB,UAAA,EAAY,CAAA,CAAE,SAAA,CAAU,GAAA,CAAI,CAAC,OAAO,EAAE,EAAA,EAAI,CAAA,CAAE,EAAA,EAAI,IAAA,EAAM,UAAA,EAAY,UAAU,EAAE,IAAA,EAAM,CAAA,CAAE,IAAA,EAAM,SAAA,EAAW,IAAA,CAAK,UAAU,CAAA,CAAE,SAAS,CAAA,EAAE,EAAE,CAAE;AAAA,OACzI;AAAA,IACF;AAEA,IAAA,IAAI,CAAA,CAAE,IAAA,KAAS,MAAA,IAAU,CAAA,CAAE,QAAQ,MAAA,EAAQ;AACzC,MAAA,OAAO;AAAA,QACL,IAAA,EAAM,MAAA;AAAA,QACN,OAAA,EAAS;AAAA,UACP,EAAE,IAAA,EAAM,MAAA,EAAQ,IAAA,EAAM,EAAE,OAAA,EAAQ;AAAA,UAChC,GAAG,CAAA,CAAE,MAAA,CAAO,GAAA,CAAI,CAAC,GAAA,MAAS;AAAA,YACxB,IAAA,EAAM,WAAA;AAAA,YACN,SAAA,EAAW,EAAE,GAAA,EAAK,CAAA,KAAA,EAAQ,IAAI,SAAS,CAAA,QAAA,EAAW,GAAA,CAAI,UAAU,CAAA,CAAA;AAAG,WACrE,CAAE;AAAA;AACJ,OACF;AAAA,IACF;AACA,IAAA,OAAO,EAAE,IAAA,EAAM,CAAA,CAAE,IAAA,EAAM,OAAA,EAAS,EAAE,OAAA,EAAQ;AAAA,EAC5C,CAAC,CAAA;AACH;AAGA,SAAS,eAAe,QAAA,EAAoC;AAC1D,EAAA,OAAO,eAAe,QAAQ,CAAA,CAAE,GAAA,CAAI,CAAC,MAAM,CAAA,KAAM;AAC/C,IAAA,MAAM,CAAA,GAAI,SAAS,CAAC,CAAA;AACpB,IAAA,IAAI,CAAA,CAAE,IAAA,KAAS,MAAA,IAAU,CAAA,CAAE,QAAQ,MAAA,EAAQ;AACzC,MAAA,OAAO,EAAE,IAAA,EAAM,MAAA,EAAQ,OAAA,EAAS,EAAE,OAAA,EAAS,MAAA,EAAQ,CAAA,CAAE,MAAA,CAAO,GAAA,CAAI,CAAC,GAAA,KAAQ,GAAA,CAAI,UAAU,CAAA,EAAE;AAAA,IAC3F;AACA,IAAA,OAAO,IAAA;AAAA,EACT,CAAC,CAAA;AACH;AAGA,SAAS,YAAY,KAAA,EAAsD;AACzE,EAAA,IAAI,CAAC,KAAA,EAAO,MAAA,EAAQ,OAAO,MAAA;AAC3B,EAAA,OAAO,MAAM,GAAA,CAAI,CAAC,OAAO,EAAE,IAAA,EAAM,YAAY,QAAA,EAAU,EAAE,MAAM,CAAA,CAAE,IAAA,EAAM,aAAa,CAAA,CAAE,WAAA,EAAa,YAAY,CAAA,CAAE,UAAA,IAAa,CAAE,CAAA;AAClI;AAGA,SAAS,cAAA,CAAe,GAAA,EAAc,gBAAA,GAAmB,MAAA,EAAoB;AAC3E,EAAA,MAAM,KAAA,GAAQ,GAAA;AACd,EAAA,IAAI,CAAC,KAAA,CAAM,OAAA,CAAQ,KAAK,CAAA,SAAU,EAAC;AACnC,EAAA,OAAO,KAAA,CAAM,GAAA,CAAI,CAAC,CAAA,EAAG,CAAA,MAAO;AAAA,IAC1B,EAAA,EAAI,OAAO,CAAA,CAAE,EAAA,KAAO,QAAA,IAAY,CAAA,CAAE,EAAA,GAAK,CAAA,CAAE,EAAA,GAAK,CAAA,EAAG,gBAAgB,CAAA,CAAA,EAAI,CAAC,CAAA,CAAA;AAAA,IACtE,IAAA,EAAM,CAAA,CAAE,QAAA,EAAU,IAAA,IAAQ,SAAA;AAAA,IAC1B,SAAA,EAAW,UAAA,CAAW,CAAA,CAAE,QAAA,EAAU,SAAS;AAAA,GAC7C,CAAE,CAAA;AACJ;AAEA,SAAS,WAAW,GAAA,EAAuC;AACzD,EAAA,IAAI,GAAA,IAAO,OAAO,GAAA,KAAQ,QAAA,EAAU,OAAO,GAAA;AAC3C,EAAA,IAAI,OAAO,QAAQ,QAAA,EAAU;AAC3B,IAAA,IAAI;AACF,MAAA,MAAM,MAAA,GAAS,IAAA,CAAK,KAAA,CAAM,GAAG,CAAA;AAC7B,MAAA,OAAO,MAAA,IAAU,OAAO,MAAA,KAAW,QAAA,GAAY,SAAqC,EAAC;AAAA,IACvF,CAAA,CAAA,MAAQ;AACN,MAAA,OAAO,EAAC;AAAA,IACV;AAAA,EACF;AACA,EAAA,OAAO,EAAC;AACV;AAGO,SAAS,cAAc,CAAA,EAAmB;AAC/C,EAAA,OAAO,EACJ,OAAA,CAAQ,sDAAA,EAAwD,mBAAmB,CAAA,CACnF,OAAA,CAAQ,iCAAiC,uBAAuB,CAAA;AACrE;AAGA,SAAS,SAAA,CAAU,KAAA,EAAe,MAAA,EAAgB,IAAA,EAAqB;AACrE,EAAA,OAAO,IAAI,MAAM,CAAA,EAAG,KAAK,kBAAkB,MAAM,CAAA,QAAA,EAAM,IAAI,CAAA,CAAE,CAAA;AAC/D;AAqBO,SAAS,sBAAsB,IAAA,EAAsB;AAC1D,EAAA,MAAM,OAAA,GAAA,CAAW,IAAA,IAAQ,EAAA,EAAI,IAAA,EAAK;AAClC,EAAA,IAAI,CAAC,OAAA,CAAQ,UAAA,CAAW,GAAG,GAAG,OAAO,OAAA;AACrC,EAAA,IAAI,MAAA;AACJ,EAAA,IAAI;AACF,IAAA,MAAA,GAAS,IAAA,CAAK,MAAM,OAAO,CAAA;AAAA,EAC7B,CAAA,CAAA,MAAQ;AACN,IAAA,OAAO,OAAA;AAAA,EACT;AACA,EAAA,MAAM,GAAA,GAAO,UAAU,EAAC;AACxB,EAAA,MAAM,MAAM,GAAA,CAAI,KAAA;AAChB,EAAA,MAAM,SAAU,OAAO,GAAA,KAAQ,QAAA,IAAY,GAAA,GAAM,MAAM,EAAC;AACxD,EAAA,MAAM,UACJ,OAAO,GAAA,KAAQ,QAAA,GAAW,GAAA,GAAM,OAAO,MAAA,CAAO,OAAA,KAAY,QAAA,GAAW,MAAA,CAAO,UAAU,OAAO,GAAA,CAAI,OAAA,KAAY,QAAA,GAAW,IAAI,OAAA,GAAU,IAAA;AACxI,EAAA,IAAI,CAAC,OAAA,EAAS,IAAA,EAAK,EAAG,OAAO,OAAA;AAC7B,EAAA,MAAM,QAAA,GAAY,OAAO,MAAA,CAAO,QAAA,KAAa,YAAY,MAAA,CAAO,QAAA,GAAW,MAAA,CAAO,QAAA,GAAW,EAAC;AAI9F,EAAA,MAAM,KAAA,GAAQ,CAAC,KAAA,KACb,KAAA,CAAM,QAAQ,KAAK,CAAA,GAAI,MAAM,MAAA,CAAO,CAAC,MAAmB,OAAO,CAAA,KAAM,YAAY,CAAC,CAAC,EAAE,IAAA,EAAM,IAAI,EAAC;AAClG,EAAA,MAAM,SAAA,GAAY,KAAA,CAAM,QAAA,CAAS,mBAAmB,CAAA;AACpD,EAAA,MAAM,SAAA,GAAY,KAAA,CAAM,QAAA,CAAS,mBAAmB,CAAA;AACpD,EAAA,MAAM,KAAA,GAAQ,CAAC,OAAA,CAAQ,IAAA,EAAM,CAAA;AAI7B,EAAA,IAAI,SAAA,CAAU,QAAQ,KAAA,CAAM,IAAA,CAAK,8BAA8B,SAAA,CAAU,IAAA,CAAK,IAAI,CAAC,CAAA,CAAE,CAAA;AACrF,EAAA,IAAI,SAAA,CAAU,QAAQ,KAAA,CAAM,IAAA,CAAK,4BAA4B,SAAA,CAAU,IAAA,CAAK,IAAI,CAAC,CAAA,CAAE,CAAA;AACnF,EAAA,OAAO,KAAA,CAAM,KAAK,UAAK,CAAA;AACzB;AAEO,SAAS,iBAAiB,IAAA,EAA6B;AAC5D,EAAA,IAAI,CAAC,MAAM,OAAO,IAAA;AAClB,EAAA,IAAI,MAAA;AACJ,EAAA,IAAI;AACF,IAAA,MAAA,GAAS,IAAA,CAAK,MAAM,IAAI,CAAA;AAAA,EAC1B,CAAA,CAAA,MAAQ;AACN,IAAA,OAAO,mBAAmB,IAAI,CAAA;AAAA,EAChC;AACA,EAAA,MAAM,GAAA,GAAM,MAAA;AACZ,EAAA,MAAM,MAAM,GAAA,EAAK,KAAA;AACjB,EAAA,MAAM,SAAU,OAAO,GAAA,KAAQ,QAAA,IAAY,GAAA,GAAM,MAAM,EAAC;AACxD,EAAA,MAAM,UACJ,OAAO,GAAA,KAAQ,QAAA,GACX,GAAA,GACA,OAAO,MAAA,CAAO,OAAA,KAAY,QAAA,GACxB,MAAA,CAAO,UACP,OAAO,GAAA,EAAK,OAAA,KAAY,QAAA,GACtB,IAAI,OAAA,GACJ,IAAA;AACV,EAAA,MAAM,WAAA,GAAc,OAAO,GAAA,EAAK,MAAA,KAAW,QAAA,GAAW,GAAA,CAAI,MAAA,GAAS,OAAO,MAAA,CAAO,MAAA,KAAW,QAAA,GAAW,MAAA,CAAO,MAAA,GAAS,IAAA;AACvH,EAAA,MAAM,SAAS,WAAA,IAAe,WAAA,CAAY,MAAK,GAAI,qBAAA,CAAsB,WAAW,CAAA,GAAI,IAAA;AACxF,EAAA,MAAM,KAAA,GAAQ,CAAC,OAAA,EAAS,MAAM,EAAE,MAAA,CAAO,CAAC,CAAA,KAAmB,CAAC,CAAC,CAAA,IAAK,CAAA,CAAE,IAAA,EAAK,CAAE,SAAS,CAAC,CAAA;AACrF,EAAA,IAAI,CAAC,KAAA,CAAM,MAAA,EAAQ,OAAO,IAAA;AAC1B,EAAA,MAAM,gBAAgB,OAAO,GAAA,EAAK,cAAA,KAAmB,QAAA,IAAY,IAAI,cAAA,GACjE,GAAA,CAAI,cAAA,GACJ,OAAO,OAAO,cAAA,KAAmB,QAAA,IAAY,MAAA,CAAO,cAAA,GAClD,OAAO,cAAA,GACP,IAAA;AACN,EAAA,MAAM,EAAA,GAAK,aAAA,GAAgB,CAAA,iBAAA,EAAoB,aAAa,CAAA,CAAA,CAAA,GAAM,EAAA;AAClE,EAAA,OAAO,GAAG,CAAC,GAAG,IAAI,GAAA,CAAI,KAAK,CAAC,CAAA,CAAE,IAAA,CAAK,UAAK,EAAE,KAAA,CAAM,CAAA,EAAG,GAAG,CAAC,GAAG,EAAE,CAAA,CAAA;AAC9D;AAUA,SAAS,mBAAmB,IAAA,EAA6B;AACvD,EAAA,MAAM,IAAA,GAAO,KAAK,IAAA,EAAK;AACvB,EAAA,IAAI,CAAC,MAAM,OAAO,IAAA;AAClB,EAAA,IAAI,IAAA,CAAK,MAAA,IAAU,GAAA,EAAK,OAAO,IAAA;AAC/B,EAAA,MAAM,KAAA,GAAQ,kCAAA,CAAmC,IAAA,CAAK,IAAI,CAAA,GAAI,CAAC,CAAA,EAAG,OAAA,CAAQ,MAAA,EAAQ,GAAG,CAAA,CAAE,IAAA,EAAK;AAC5F,EAAA,IAAI,KAAA,EAAO,OAAO,KAAA,CAAM,KAAA,CAAM,GAAG,GAAG,CAAA;AAEpC,EAAA,MAAM,IAAA,GAAO,qBAAA,CAAsB,IAAA,CAAK,IAAI,IAAI,CAAC,CAAA;AACjD,EAAA,OAAO,IAAA,IAAQ,IAAA;AACjB;AAQO,SAAS,UAAA,CAAW,MAAA,EAAgB,KAAA,EAAe,SAAA,EAAuC;AAC/F,EAAA,IAAI,MAAA,KAAW,OAAO,MAAA,KAAW,GAAA,SAAY,CAAA,WAAA,EAAc,SAAA,IAAa,QAAQ,CAAA,6CAAA,EAA2C,KAAK,CAAA,CAAA,CAAA;AAChI,EAAA,IAAI,MAAA,KAAW,KAAK,OAAO,iHAAA;AAC3B,EAAA,IAAI,MAAA,KAAW,GAAA,EAAK,OAAO,CAAA,4BAAA,EAA+B,KAAK,CAAA,8DAAA,CAAA;AAC/D,EAAA,IAAI,MAAA,KAAW,GAAA,IAAO,MAAA,KAAW,GAAA,EAAK,OAAO,+FAAA;AAC7C,EAAA,IAAI,MAAA,KAAW,KAAK,OAAO,iFAAA;AAC3B,EAAA,IAAI,MAAA,IAAU,GAAA,EAAK,OAAO,CAAA,uGAAA,EAAqG,KAAK,CAAA,oDAAA,CAAA;AACpI,EAAA,OAAO,uBAAuB,KAAK,CAAA,kBAAA,CAAA;AACrC;AAGA,gBAAgB,YAAY,GAAA,EAAuC;AACjE,EAAA,MAAM,MAAA,GAAS,GAAA,CAAI,IAAA,EAAM,SAAA,EAAU;AACnC,EAAA,IAAI,CAAC,MAAA,EAAQ;AACb,EAAA,MAAM,OAAA,GAAU,IAAI,WAAA,EAAY;AAChC,EAAA,IAAI,GAAA,GAAM,EAAA;AACV,EAAA,WAAS;AACP,IAAA,MAAM,EAAE,IAAA,EAAM,KAAA,EAAM,GAAI,MAAM,OAAO,IAAA,EAAK;AAC1C,IAAA,IAAI,IAAA,EAAM;AACV,IAAA,GAAA,IAAO,QAAQ,MAAA,CAAO,KAAA,EAAO,EAAE,MAAA,EAAQ,MAAM,CAAA;AAC7C,IAAA,IAAI,GAAA;AACJ,IAAA,OAAA,CAAQ,GAAA,GAAM,GAAA,CAAI,OAAA,CAAQ,IAAI,MAAM,CAAA,EAAG;AACrC,MAAA,MAAM,OAAO,GAAA,CAAI,KAAA,CAAM,CAAA,EAAG,GAAG,EAAE,IAAA,EAAK;AACpC,MAAA,GAAA,GAAM,GAAA,CAAI,KAAA,CAAM,GAAA,GAAM,CAAC,CAAA;AACvB,MAAA,IAAI,MAAM,MAAM,IAAA;AAAA,IAClB;AAAA,EACF;AACA,EAAA,IAAI,GAAA,CAAI,IAAA,EAAK,EAAG,MAAM,IAAI,IAAA,EAAK;AACjC;AAGO,SAAS,qBAAA,CACd,GAAA,EAOA,KAAA,EACA,OAAA,EACM;AACN,EAAA,MAAM,CAAA,GAAI,KAAA;AACV,EAAA,MAAM,MAAA,GAAS,CAAA,CAAE,OAAA,GAAU,CAAC,CAAA,EAAG,aAAA;AAC/B,EAAA,IAAI,OAAO,MAAA,KAAW,QAAA,IAAY,MAAA,MAAY,YAAA,GAAe,MAAA;AAC7D,EAAA,MAAM,KAAA,GAAQ,CAAA,CAAE,OAAA,GAAU,CAAC,CAAA,EAAG,KAAA;AAC9B,EAAA,IAAI,OAAO,OAAA,EAAS;AAClB,IAAA,GAAA,CAAI,QAAQ,KAAA,CAAM,OAAA;AAClB,IAAA,OAAA,GAAU,MAAM,OAAO,CAAA;AAAA,EACzB;AACA,EAAA,KAAA,MAAW,EAAA,IAAM,KAAA,EAAO,UAAA,IAAc,EAAC,EAAG;AACxC,IAAA,MAAM,GAAA,GAAM,GAAG,KAAA,IAAS,CAAA;AACxB,IAAA,MAAM,CAAA,GAAI,IAAI,KAAA,CAAM,GAAA,CAAI,GAAG,CAAA,IAAK,EAAE,MAAM,EAAA,EAAG;AAC3C,IAAA,IAAI,EAAA,CAAG,EAAA,EAAI,CAAA,CAAE,EAAA,GAAK,EAAA,CAAG,EAAA;AACrB,IAAA,IAAI,GAAG,QAAA,EAAU,IAAA,EAAM,CAAA,CAAE,IAAA,GAAO,GAAG,QAAA,CAAS,IAAA;AAC5C,IAAA,IAAI,GAAG,QAAA,EAAU,SAAA,EAAW,CAAA,CAAE,IAAA,IAAQ,GAAG,QAAA,CAAS,SAAA;AAClD,IAAA,GAAA,CAAI,KAAA,CAAM,GAAA,CAAI,GAAA,EAAK,CAAC,CAAA;AAAA,EACtB;AACA,EAAA,IAAI,EAAE,KAAA,EAAO;AACX,IAAA,GAAA,CAAI,KAAA,CAAM,YAAA,GAAe,CAAA,CAAE,KAAA,CAAM,aAAA;AACjC,IAAA,GAAA,CAAI,KAAA,CAAM,gBAAA,GAAmB,CAAA,CAAE,KAAA,CAAM,iBAAA;AAAA,EACvC;AACF;AAGA,SAAS,cAAc,KAAA,EAA8E;AACnG,EAAA,OAAO,CAAC,GAAG,KAAA,CAAM,OAAA,EAAS,EACvB,IAAA,CAAK,CAAC,CAAA,EAAG,CAAA,KAAM,EAAE,CAAC,CAAA,GAAI,EAAE,CAAC,CAAC,EAC1B,GAAA,CAAI,CAAC,CAAC,CAAA,EAAG,CAAC,CAAA,MAAO,EAAE,IAAI,CAAA,CAAE,EAAA,IAAM,QAAQ,CAAC,CAAA,CAAA,EAAI,IAAA,EAAM,CAAA,CAAE,QAAQ,SAAA,EAAW,SAAA,EAAW,WAAW,CAAA,CAAE,IAAI,GAAE,CAAE,CAAA;AAC5G;AAEA,eAAe,QAAA,CAAS,GAAA,EAAa,IAAA,EAAe,OAAA,EAAiC,SAAA,EAAsC;AACzH,EAAA,MAAM,UAAA,GAAa,IAAI,eAAA,EAAgB;AACvC,EAAA,MAAM,QAAQ,UAAA,CAAW,MAAM,UAAA,CAAW,KAAA,IAAS,SAAS,CAAA;AAC5D,EAAA,IAAI;AACF,IAAA,OAAO,MAAM,MAAM,GAAA,EAAK,EAAE,QAAQ,MAAA,EAAQ,OAAA,EAAS,EAAE,cAAA,EAAgB,kBAAA,EAAoB,GAAG,OAAA,EAAQ,EAAG,MAAM,IAAA,CAAK,SAAA,CAAU,IAAI,CAAA,EAAG,MAAA,EAAQ,UAAA,CAAW,MAAA,EAAQ,CAAA;AAAA,EAChK,CAAA,SAAE;AACA,IAAA,YAAA,CAAa,KAAK,CAAA;AAAA,EACpB;AACF;AAWO,IAAM,eAAN,MAAuC;AAAA,EAI5C,WAAA,CACW,OACQ,KAAA,EACjB;AAFS,IAAA,IAAA,CAAA,KAAA,GAAA,KAAA;AACQ,IAAA,IAAA,CAAA,KAAA,GAAA,KAAA;AAAA,EAChB;AAAA,EAFQ,KAAA;AAAA,EACQ,KAAA;AAAA,EALV,EAAA,GAAK,MAAA;AAAA,EACL,KAAA,GAAQ,sBAAA;AAAA,EACR,KAAA,GAAQ,IAAA;AAAA,EAKjB,MAAM,IAAA,CAAK,SAAA,EAA2B,KAAA,EAA8C;AAClF,IAAA,OAAO,EAAE,MAAM,IAAA,CAAK,KAAA,EAAO,OAAO,IAAA,CAAK,KAAA,EAAO,QAAA,EAAU,IAAA,CAAK,EAAA,EAAG;AAAA,EAClE;AACF;AAMO,IAAM,iBAAN,MAAyC;AAAA,EAI9C,YACW,KAAA,EACQ,IAAA,GAAO,OAAA,CAAQ,GAAA,CAAI,eAAe,wBAAA,EACnD;AAFS,IAAA,IAAA,CAAA,KAAA,GAAA,KAAA;AACQ,IAAA,IAAA,CAAA,IAAA,GAAA,IAAA;AAAA,EAChB;AAAA,EAFQ,KAAA;AAAA,EACQ,IAAA;AAAA,EALV,EAAA,GAAK,QAAA;AAAA,EACL,KAAA,GAAQ,gBAAA;AAAA,EACR,KAAA,GAAQ,IAAA;AAAA,EAKjB,MAAM,IAAA,CAAK,QAAA,EAAyB,IAAA,GAAoB,EAAC,EAA4B;AACnF,IAAA,MAAM,SAAA,GAAY,CAAC,EAAE,IAAA,CAAK,UAAU,IAAA,CAAK,OAAA,CAAA;AACzC,IAAA,IAAI,GAAA;AACJ,IAAA,IAAI;AACF,MAAA,GAAA,GAAM,MAAM,QAAA;AAAA,QACV,GAAG,IAAA,CAAK,IAAA,CAAK,OAAA,CAAQ,KAAA,EAAO,EAAE,CAAC,CAAA,SAAA,CAAA;AAAA,QAC/B,EAAE,OAAO,IAAA,CAAK,KAAA,EAAO,UAAU,cAAA,CAAe,QAAQ,GAAG,MAAA,EAAQ,SAAA,EAAW,OAAO,WAAA,CAAY,IAAA,CAAK,KAAK,CAAA,EAAG,OAAA,EAAS,EAAE,WAAA,EAAa,IAAA,CAAK,WAAA,IAAe,CAAA,EAAE,EAAE;AAAA,QAC5J,EAAC;AAAA,QACD,KAAK,SAAA,IAAa;AAAA,OACpB;AAAA,IACF,CAAA,CAAA,MAAQ;AACN,MAAA,MAAM,IAAI,KAAA,CAAM,CAAA,yBAAA,EAA4B,IAAA,CAAK,IAAI,CAAA,8FAAA,CAA2F,CAAA;AAAA,IAClJ;AACA,IAAA,IAAI,CAAC,GAAA,CAAI,EAAA,QAAU,SAAA,CAAU,QAAA,EAAU,IAAI,MAAA,EAAQ,GAAA,CAAI,MAAA,KAAW,GAAA,GAAM,UAAU,IAAA,CAAK,KAAK,2CAAsC,IAAA,CAAK,KAAK,oCAAoC,yCAAyC,CAAA;AAEzN,IAAA,IAAI,SAAA,EAAW;AACb,MAAA,IAAI,IAAA,GAAO,EAAA;AACX,MAAA,IAAI,YAAA;AACJ,MAAA,IAAI,SAAA,GAAY,KAAA;AAChB,MAAA,MAAM,QAA8D,EAAC;AACrE,MAAA,WAAA,MAAiB,IAAA,IAAQ,WAAA,CAAY,GAAG,CAAA,EAAG;AACzC,QAAA,IAAI;AACF,UAAA,MAAM,GAAA,GAAM,IAAA,CAAK,KAAA,CAAM,IAAI,CAAA;AAC3B,UAAA,MAAM,KAAA,GAAQ,IAAI,OAAA,EAAS,OAAA;AAC3B,UAAA,IAAI,KAAA,EAAO;AACT,YAAA,IAAA,IAAQ,KAAA;AACR,YAAA,IAAA,CAAK,UAAU,KAAK,CAAA;AAAA,UACtB;AACA,UAAA,IAAI,GAAA,CAAI,OAAA,EAAS,UAAA,EAAY,YAAA,GAAe,IAAI,OAAA,CAAQ,UAAA;AACxD,UAAA,IAAI,OAAO,GAAA,CAAI,iBAAA,KAAsB,QAAA,EAAU,KAAA,CAAM,eAAe,GAAA,CAAI,iBAAA;AACxE,UAAA,IAAI,OAAO,GAAA,CAAI,UAAA,KAAe,QAAA,EAAU,KAAA,CAAM,mBAAmB,GAAA,CAAI,UAAA;AAErE,UAAA,IAAI,GAAA,CAAI,WAAA,KAAgB,QAAA,EAAU,SAAA,GAAY,IAAA;AAAA,QAChD,CAAA,CAAA,MAAQ;AAAA,QAER;AAAA,MACF;AACA,MAAA,OAAO,EAAE,IAAA,EAAM,KAAA,EAAO,IAAA,CAAK,KAAA,EAAO,QAAA,EAAU,IAAA,CAAK,EAAA,EAAI,SAAA,EAAW,cAAA,CAAe,YAAY,CAAA,EAAG,OAAO,SAAA,EAAU;AAAA,IACjH;AAEA,IAAA,MAAM,IAAA,GAAQ,MAAM,GAAA,CAAI,IAAA,EAAK;AAC7B,IAAA,OAAO;AAAA,MACL,IAAA,EAAM,IAAA,CAAK,OAAA,EAAS,OAAA,IAAW,EAAA;AAAA,MAC/B,OAAO,IAAA,CAAK,KAAA;AAAA,MACZ,UAAU,IAAA,CAAK,EAAA;AAAA,MACf,SAAA,EAAW,cAAA,CAAe,IAAA,CAAK,OAAA,EAAS,UAAU,CAAA;AAAA,MAClD,OAAO,EAAE,YAAA,EAAc,KAAK,iBAAA,EAAmB,gBAAA,EAAkB,KAAK,UAAA,EAAW;AAAA,MACjF,SAAA,EAAW,KAAK,WAAA,KAAgB;AAAA,KAClC;AAAA,EACF;AACF;AAkBO,IAAM,2BAAN,MAAmD;AAAA,EAIxD,WAAA,CACW,OACQ,MAAA,EACjB;AAFS,IAAA,IAAA,CAAA,KAAA,GAAA,KAAA;AACQ,IAAA,IAAA,CAAA,MAAA,GAAA,MAAA;AAEjB,IAAA,IAAA,CAAK,KAAK,MAAA,CAAO,EAAA;AACjB,IAAA,IAAA,CAAK,QAAQ,MAAA,CAAO,KAAA;AACpB,IAAA,IAAA,CAAK,QAAQ,MAAA,CAAO,KAAA;AAAA,EACtB;AAAA,EANW,KAAA;AAAA,EACQ,MAAA;AAAA,EALV,EAAA;AAAA,EACA,KAAA;AAAA,EACA,KAAA;AAAA,EAST,MAAM,IAAA,CAAK,QAAA,EAAyB,IAAA,GAAoB,EAAC,EAA4B;AACnF,IAAA,MAAM,UAAkC,EAAC;AACzC,IAAA,IAAI,IAAA,CAAK,OAAO,SAAA,EAAW;AACzB,MAAA,MAAM,GAAA,GAAM,OAAA,CAAQ,GAAA,CAAI,IAAA,CAAK,OAAO,SAAS,CAAA;AAC7C,MAAA,IAAI,CAAC,GAAA,EAAK;AACR,QAAA,MAAM,IAAI,MAAM,CAAA,EAAG,IAAA,CAAK,KAAK,CAAA,qBAAA,EAAwB,IAAA,CAAK,MAAA,CAAO,SAAS,CAAA,uGAAA,CAAoG,CAAA;AAAA,MAChL;AACA,MAAA,OAAA,CAAQ,aAAA,GAAgB,UAAU,GAAG,CAAA,CAAA;AAAA,IACvC;AACA,IAAA,MAAM,SAAA,GAAY,CAAC,EAAE,IAAA,CAAK,UAAU,IAAA,CAAK,OAAA,CAAA;AACzC,IAAA,MAAM,GAAA,GAAM,GAAG,IAAA,CAAK,MAAA,CAAO,QAAQ,OAAA,CAAQ,KAAA,EAAO,EAAE,CAAC,CAAA,iBAAA,CAAA;AACrD,IAAA,MAAM,IAAA,GAAO;AAAA,MACX,OAAO,IAAA,CAAK,KAAA;AAAA,MACZ,QAAA,EAAU,eAAe,QAAQ,CAAA;AAAA,MACjC,KAAA,EAAO,WAAA,CAAY,IAAA,CAAK,KAAK,CAAA;AAAA,MAC7B,WAAA,EAAa,KAAK,WAAA,IAAe,CAAA;AAAA,MACjC,YAAY,IAAA,CAAK,SAAA;AAAA,MACjB,MAAA,EAAQ,SAAA;AAAA,MACR,GAAI,YAAY,EAAE,cAAA,EAAgB,EAAE,aAAA,EAAe,IAAA,EAAK,EAAE,GAAI;AAAC,KACjE;AACA,IAAA,IAAI,GAAA;AACJ,IAAA,IAAI;AACF,MAAA,GAAA,GAAM,MAAM,QAAA,CAAS,GAAA,EAAK,MAAM,OAAA,EAAS,IAAA,CAAK,aAAa,IAAO,CAAA;AAAA,IACpE,CAAA,CAAA,MAAQ;AACN,MAAA,MAAM,IAAI,MAAM,CAAA,eAAA,EAAkB,IAAA,CAAK,KAAK,CAAA,IAAA,EAAO,IAAA,CAAK,MAAA,CAAO,OAAO,CAAA,kDAAA,CAA+C,CAAA;AAAA,IACvH;AACA,IAAA,IAAI,CAAC,IAAI,EAAA,EAAI;AACX,MAAA,MAAM,MAAA,GAAS,iBAAiB,MAAM,GAAA,CAAI,MAAK,CAAE,KAAA,CAAM,MAAM,EAAE,CAAC,CAAA;AAChE,MAAA,MAAM,IAAA,GAAO,UAAU,UAAA,CAAW,GAAA,CAAI,QAAQ,IAAA,CAAK,KAAA,EAAO,IAAA,CAAK,MAAA,CAAO,SAAS,CAAA;AAC/E,MAAA,MAAM,SAAA,CAAU,IAAA,CAAK,KAAA,EAAO,GAAA,CAAI,QAAQ,IAAI,CAAA;AAAA,IAC9C;AAEA,IAAA,IAAI,SAAA,EAAW;AACb,MAAA,MAAM,GAAA,GAAM,EAAE,IAAA,EAAM,EAAA,EAAI,KAAA,kBAAO,IAAI,GAAA,EAA0D,EAAG,KAAA,EAAO,EAAC,EAA2D,YAAA,EAAc,MAAA,EAAgC;AACjN,MAAA,WAAA,MAAiB,IAAA,IAAQ,WAAA,CAAY,GAAG,CAAA,EAAG;AACzC,QAAA,IAAI,CAAC,IAAA,CAAK,UAAA,CAAW,OAAO,CAAA,EAAG;AAC/B,QAAA,MAAM,OAAA,GAAU,IAAA,CAAK,KAAA,CAAM,CAAC,EAAE,IAAA,EAAK;AACnC,QAAA,IAAI,YAAY,QAAA,EAAU;AAC1B,QAAA,IAAI;AACF,UAAA,qBAAA,CAAsB,KAAK,IAAA,CAAK,KAAA,CAAM,OAAO,CAAA,EAAG,KAAK,OAAO,CAAA;AAAA,QAC9D,CAAA,CAAA,MAAQ;AAAA,QAER;AAAA,MACF;AACA,MAAA,MAAM,KAAA,GAAQ,aAAA,CAAc,GAAA,CAAI,KAAK,CAAA;AACrC,MAAA,OAAO,EAAE,MAAM,GAAA,CAAI,IAAA,EAAM,OAAO,IAAA,CAAK,KAAA,EAAO,UAAU,IAAA,CAAK,EAAA,EAAI,WAAW,KAAA,CAAM,MAAA,GAAS,QAAQ,MAAA,EAAW,KAAA,EAAO,IAAI,KAAA,EAAO,SAAA,EAAW,GAAA,CAAI,YAAA,KAAiB,QAAA,EAAS;AAAA,IACzK;AACA,IAAA,MAAM,IAAA,GAAQ,MAAM,GAAA,CAAI,IAAA,EAAK;AAC7B,IAAA,MAAM,OAAA,GAAU,IAAA,CAAK,OAAA,GAAU,CAAC,CAAA,EAAG,OAAA;AACnC,IAAA,OAAO;AAAA,MACL,IAAA,EAAM,SAAS,OAAA,IAAW,EAAA;AAAA,MAC1B,OAAO,IAAA,CAAK,KAAA;AAAA,MACZ,UAAU,IAAA,CAAK,EAAA;AAAA,MACf,SAAA,EAAW,cAAA,CAAe,OAAA,EAAS,UAAU,CAAA;AAAA,MAC7C,KAAA,EAAO,EAAE,YAAA,EAAc,IAAA,CAAK,OAAO,aAAA,EAAe,gBAAA,EAAkB,IAAA,CAAK,KAAA,EAAO,iBAAA,EAAkB;AAAA,MAClG,SAAA,EAAW,IAAA,CAAK,OAAA,GAAU,CAAC,GAAG,aAAA,KAAkB;AAAA,KAClD;AAAA,EACF;AACF;AAYO,IAAM,mBAAN,MAA2C;AAAA,EAKhD,WAAA,CACW,OACQ,KAAA,EACjB;AAFS,IAAA,IAAA,CAAA,KAAA,GAAA,KAAA;AACQ,IAAA,IAAA,CAAA,KAAA,GAAA,KAAA;AAAA,EAChB;AAAA,EAFQ,KAAA;AAAA,EACQ,KAAA;AAAA,EANV,EAAA,GAAK,UAAA;AAAA,EACL,KAAA,GAAQ,0BAAA;AAAA,EACR,KAAA,GAAQ,IAAA;AAAA,EACT,IAAA,GAAO,CAAA;AAAA;AAAA,EAMf,MAAM,IAAA,CAAK,SAAA,EAA2B,KAAA,EAA8C;AAClF,IAAA,MAAM,IAAA,GAAO,IAAA,CAAK,KAAA,CAAM,IAAA,CAAK,GAAA,CAAI,IAAA,CAAK,IAAA,EAAM,IAAA,CAAK,KAAA,CAAM,MAAA,GAAS,CAAC,CAAC,CAAA;AAClE,IAAA,IAAA,CAAK,IAAA,EAAA;AACL,IAAA,OAAO,EAAE,IAAA,EAAM,IAAA,CAAK,IAAA,IAAQ,EAAA,EAAI,OAAO,IAAA,CAAK,KAAA,EAAO,QAAA,EAAU,IAAA,CAAK,IAAI,SAAA,EAAW,IAAA,CAAK,SAAA,EAAW,SAAA,EAAW,KAAK,SAAA,EAAU;AAAA,EAC7H;AACF;AAGO,IAAM,iBAAA,GAAsG;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAMjH,gBAAA,EAAkB;AAAA,IAChB,OAAA,EAAS,OAAA,CAAQ,GAAA,CAAI,kBAAA,IAAsB,mCAAA;AAAA,IAC3C,SAAA,EAAW,sBAAA;AAAA,IACX,KAAA,EAAO,KAAA;AAAA,IACP,KAAA,EAAO;AAAA,GACT;AAAA,EACA,UAAA,EAAY,EAAE,OAAA,EAAS,8BAAA,EAAgC,WAAW,oBAAA,EAAsB,KAAA,EAAO,KAAA,EAAO,KAAA,EAAO,YAAA,EAAa;AAAA,EAC1H,OAAA,EAAS,EAAE,OAAA,EAAS,OAAA,CAAQ,GAAA,CAAI,gBAAA,IAAoB,uBAAA,EAAyB,SAAA,EAAW,iBAAA,EAAmB,KAAA,EAAO,KAAA,EAAO,KAAA,EAAO,SAAA,EAAU;AAAA,EAC1I,MAAA,EAAQ,EAAE,OAAA,EAAS,2BAAA,EAA6B,WAAW,gBAAA,EAAkB,KAAA,EAAO,KAAA,EAAO,KAAA,EAAO,QAAA,EAAS;AAAA,EAC3G,QAAA,EAAU,EAAE,OAAA,EAAS,6BAAA,EAA+B,WAAW,kBAAA,EAAoB,KAAA,EAAO,KAAA,EAAO,KAAA,EAAO,UAAA,EAAW;AAAA;AAAA;AAAA;AAAA;AAAA,EAKnH,WAAA,EAAa;AAAA,IACX,OAAA,EAAS,OAAA,CAAQ,GAAA,CAAI,kBAAA,IAAsB,uBAAA;AAAA,IAC3C,KAAA,EAAO,IAAA;AAAA,IACP,KAAA,EAAO;AAAA,GACT;AAAA,EACA,QAAA,EAAU,EAAE,OAAA,EAAS,OAAA,CAAQ,GAAA,CAAI,qBAAqB,0BAAA,EAA4B,KAAA,EAAO,IAAA,EAAM,KAAA,EAAO,mBAAA,EAAoB;AAAA;AAAA;AAAA;AAAA;AAAA,EAK1H,eAAA,EAAiB;AAAA,IACf,OAAA,EAAS,OAAA,CAAQ,GAAA,CAAI,sBAAA,IAA0B,0BAAA;AAAA,IAC/C,KAAA,EAAO,IAAA;AAAA,IACP,KAAA,EAAO;AAAA;AAEX;AAYO,IAAM,kBAAA,GAAN,MAAM,mBAAA,CAAuC;AAAA,EAgBlD,WAAA,CACW,OACQ,SAAA,EACA,MAAA,GAA+B,eAC/B,OAAA,GAAU,KAAA,EAEV,SAAA,GAAoC,UAAA,EACpC,eAAA,EACjB;AAPS,IAAA,IAAA,CAAA,KAAA,GAAA,KAAA;AACQ,IAAA,IAAA,CAAA,SAAA,GAAA,SAAA;AACA,IAAA,IAAA,CAAA,MAAA,GAAA,MAAA;AACA,IAAA,IAAA,CAAA,OAAA,GAAA,OAAA;AAEA,IAAA,IAAA,CAAA,SAAA,GAAA,SAAA;AACA,IAAA,IAAA,CAAA,eAAA,GAAA,eAAA;AAAA,EAChB;AAAA,EAPQ,KAAA;AAAA,EACQ,SAAA;AAAA,EACA,MAAA;AAAA,EACA,OAAA;AAAA,EAEA,SAAA;AAAA,EACA,eAAA;AAAA,EAtBV,EAAA,GAAK,WAAA;AAAA;AAAA,EAEL,KAAA,GAAQ,kBAAA;AAAA,EACR,KAAA,GAAQ,IAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAMR,aAAA,GAAgB,KAAA;AAAA;AAAA,EAEzB,OAAe,WAAA,GAA8B,IAAA;AAAA,EAC7C,OAAe,QAAA,GAA6E,IAAA;AAAA,EAC5F,OAAe,QAAA,GAA0B,IAAA;AAAA,EAWzC,MAAM,IAAA,CAAK,QAAA,EAAyB,IAAA,GAAoB,EAAC,EAA4B;AACnF,IAAA,MAAM;AAAA,MACJ,aAAA;AAAA,MACA,eAAA;AAAA,MACA,yBAAA;AAAA,MACA,kBAAA;AAAA,MACA,iBAAA;AAAA,MACA;AAAA,KACF,GAAI,MAAM,OAAO,wBAA8B,CAAA;AAC/C,IAAA,MAAM,SAAA,GAAY,yBAAA,CAA0B,IAAA,CAAK,SAAS,CAAA;AAC1D,IAAA,IAAI;AACF,MAAA,MAAM,YAAA,GAAe,QAAA,CAAS,GAAA,CAAI,CAAC,CAAA,MAAO;AAAA,QACxC,IAAA,EAAO,CAAA,CAAE,IAAA,KAAS,MAAA,GAAS,SAAS,CAAA,CAAE,IAAA;AAAA,QACtC,SAAS,CAAA,CAAE;AAAA,OACb,CAAE,CAAA;AACF,MAAA,MAAM,OAAA,GAAU;AAAA,QACd,WAAA,EAAa,KAAK,WAAA,IAAe,CAAA;AAAA,QACjC,WAAW,IAAA,CAAK,SAAA;AAAA,QAChB,SAAS,IAAA,CAAK,OAAA;AAAA,QACd,gBAAgB,IAAA,CAAK,cAAA;AAAA,QACrB,gBAAgB,IAAA,CAAK,cAAA;AAAA,QACrB,0BAAA,EAA4B,CAAC,CAAC,IAAA,CAAK,cAAA;AAAA,QACnC,iBAAiB,IAAA,CAAK,eAAA;AAAA,QACtB,gBAAgB,IAAA,CAAK;AAAA,OACvB;AAEA,MAAA,IAAI,cAAc,SAAA,EAAW;AAC3B,QAAA,MAAM,IAAA,GAAO,cAAc,EAAE,SAAA,EAAW,WAAW,QAAA,EAAU,IAAA,CAAK,iBAAiB,CAAA;AACnF,QAAA,MAAM,IAAA,CAAK,IAAA,CAAK,IAAA,CAAK,SAAS,CAAA;AAC9B,QAAA,MAAM,GAAA,GAAM,MAAM,IAAA,CAAK,QAAA,CAAS,cAAc,OAAO,CAAA;AACrD,QAAA,OAAO,EAAE,MAAM,GAAA,CAAI,IAAA,EAAM,OAAO,IAAA,CAAK,KAAA,EAAO,QAAA,EAAU,IAAA,CAAK,EAAA,EAAG;AAAA,MAChE;AAGA,MAAA,IAAI,CAAC,oBAAmB,WAAA,EAAa;AACnC,QAAA,MAAM,GAAA,GAAM,MAAM,IAAA,CAAK,MAAA,CAAO,mBAAA,EAAqB,EAAE,OAAA,EAAS,IAAA,CAAK,OAAA,EAAS,aAAA,EAAe,MAAM;AAAA,QAAC,GAAG,CAAA;AACrG,QAAA,IAAI,CAAC,IAAI,MAAA,EAAQ;AACf,UAAA,MAAM,IAAI,MAAM,wBAAA,CAAyB,GAAA,CAAI,UAAU,YAAA,EAAc,gBAAA,EAAkB,GAAA,CAAI,MAAM,CAAC,CAAA;AAAA,QACpG;AACA,QAAA,mBAAA,CAAmB,cAAc,GAAA,CAAI,MAAA;AAAA,MACvC;AACA,MAAA,iBAAA,CAAkB,CAAC,CAAA;AAGnB,MAAA,MAAM,UAAU,MAAM,kBAAA,CAAmB,mBAAA,CAAmB,WAAA,EAAa,KAAK,SAAS,CAAA;AACvF,MAAA,MAAM,MAAA,GAAS,MAAM,iBAAA,CAAkB,OAAA,EAAS,cAAc,OAAO,CAAA;AAIrE,MAAA,MAAM,YAAA,GAAe,OAAO,MAAA,EAAQ,WAAA;AACpC,MAAA,MAAM,gBAAA,GAAmB,MAAA,CAAO,IAAA,GAAO,IAAA,CAAK,GAAA,CAAI,CAAA,EAAG,IAAA,CAAK,IAAA,CAAK,MAAA,CAAO,IAAA,CAAK,MAAA,GAAS,CAAC,CAAC,CAAA,GAAI,KAAA,CAAA;AACxF,MAAA,OAAO;AAAA,QACL,MAAM,MAAA,CAAO,IAAA;AAAA,QACb,OAAO,IAAA,CAAK,KAAA;AAAA,QACZ,UAAU,IAAA,CAAK,EAAA;AAAA,QACf,KAAA,EAAO;AAAA,UACL,GAAI,OAAO,YAAA,KAAiB,QAAA,IAAY,eAAe,CAAA,GAAI,EAAE,YAAA,EAAa,GAAI,EAAC;AAAA,UAC/E,GAAI,gBAAA,IAAoB,IAAA,GAAO,EAAE,gBAAA,KAAqB;AAAC;AACzD,OACF;AAAA,IACF,SAAS,CAAA,EAAG;AAEV,MAAA,IAAI;AACF,QAAA,IAAI,oBAAmB,WAAA,EAAa;AAClC,UAAA,IACE,CAAC,mBAAA,CAAmB,QAAA,IACpB,mBAAA,CAAmB,QAAA,KAAa,KAAK,SAAA,EACrC;AACA,YAAA,MAAM,OAAO,aAAA,CAAc;AAAA,cACzB,SAAA,EAAW,UAAA;AAAA,cACX,SAAS,mBAAA,CAAmB,WAAA;AAAA,cAC5B,aAAA,EAAe,CAAC,CAAC,IAAA,CAAK;AAAA,aACvB,CAAA;AACD,YAAA,IAAI,gBAAgB,eAAA,EAAiB;AACnC,cAAA,mBAAA,CAAmB,QAAA,GAAW,IAAA;AAC9B,cAAA,mBAAA,CAAmB,WAAW,IAAA,CAAK,SAAA;AACnC,cAAA,MAAM,IAAA,CAAK,IAAA,CAAK,IAAA,CAAK,SAAS,CAAA;AAAA,YAChC;AAAA,UACF;AACA,UAAA,IAAI,oBAAmB,QAAA,EAAU;AAC/B,YAAA,MAAM,GAAA,GAAM,MAAM,mBAAA,CAAmB,QAAA,CAAS,QAAA;AAAA,cAC5C,QAAA,CAAS,GAAA,CAAI,CAAC,CAAA,MAAO;AAAA,gBACnB,IAAA,EAAO,CAAA,CAAE,IAAA,KAAS,MAAA,GAAS,SAAS,CAAA,CAAE,IAAA;AAAA,gBACtC,SAAS,CAAA,CAAE;AAAA,eACb,CAAE,CAAA;AAAA,cACF;AAAA,gBACE,WAAA,EAAa,KAAK,WAAA,IAAe,CAAA;AAAA,gBACjC,WAAW,IAAA,CAAK,SAAA;AAAA,gBAChB,SAAS,IAAA,CAAK,OAAA;AAAA,gBACd,gBAAgB,IAAA,CAAK,cAAA;AAAA,gBACrB,gBAAgB,IAAA,CAAK,cAAA;AAAA,gBACrB,0BAAA,EAA4B,CAAC,CAAC,IAAA,CAAK,cAAA;AAAA,gBACnC,iBAAiB,IAAA,CAAK,eAAA;AAAA,gBACtB,gBAAgB,IAAA,CAAK;AAAA;AACvB,aACF;AACA,YAAA,OAAO,EAAE,MAAM,GAAA,CAAI,IAAA,EAAM,OAAO,IAAA,CAAK,KAAA,EAAO,QAAA,EAAU,IAAA,CAAK,EAAA,EAAG;AAAA,UAChE;AAAA,QACF;AAAA,MACF,CAAA,CAAA,MAAQ;AAAA,MAER;AACA,MAAA,MAAM,IAAI,KAAA,CAAM,CAAA,qCAAA,EAAwC,IAAA,CAAK,SAAS,WAAM,aAAA,CAAe,CAAA,CAAY,OAAO,CAAC,CAAA,CAAE,CAAA;AAAA,IACnH;AAAA,EACF;AACF","file":"chunk-ADP6ITGF.js","sourcesContent":["/**\n * Prompt assembly with cache-stable ordering (VG-CLI-CODE §5.1).\n *\n * The fast coding tools lean hard on prompt caching — cached tokens are roughly\n * an order of magnitude cheaper and skip re-encoding, so hit-rate is a\n * first-class speed lever. A cache only helps if the *prefix* is byte-stable\n * across turns, which makes prompt ordering a scheduling constraint, not a\n * cosmetic choice: put the invariant material (the instruction contract + the\n * repo-derived context) first and the volatile turn-specific ask last. This\n * module is the single place that ordering is enforced, so every provider\n * inherits it.\n */\n\nimport type { ChatMessage, CodeContext } from './types.js';\n\n/**\n * The system contract for the planner. Intentionally fixed (no interpolation)\n * so it is a perfectly stable cache prefix. It pins the edit *format* the\n * deterministic applier expects — the model's only job is to emit these blocks.\n */\nexport const CODE_SYSTEM_PROMPT = [\n  'You are a precise code-editing assistant operating inside the Vibgrate CLI.',\n  'You are given repository context derived from a deterministic code graph, then a task.',\n  'Propose the smallest correct change. Do not restate unchanged code.',\n  '',\n  'Reply ONLY with edit blocks in this exact format, one per change:',\n  '',\n  '<path/to/file>',\n  '<<<<<<< SEARCH',\n  '<exact current lines to find>',\n  '=======',\n  '<replacement lines>',\n  '>>>>>>> REPLACE',\n  '',\n  'The SEARCH text must match the current file (whitespace differences are tolerated).',\n  'To add a new file use:',\n  'CREATE <path/to/file>',\n  '<full file body>',\n  'END CREATE',\n  'To remove a file use: DELETE <path/to/file>',\n  '',\n  'Respect every hard constraint in the context. Keep edits minimal and self-consistent.',\n].join('\\n');\n\n/**\n * Build the chat messages for a planning turn, in cache-stable order:\n *   1. system contract (fixed)\n *   2. repository context (stable for the repo/turn — the big, reusable prefix)\n *   3. the task instruction (volatile — always last)\n *\n * Keeping the volatile instruction in its own trailing user turn maximizes the\n * reusable prefix when the same repo is edited across multiple asks.\n */\nexport function buildMessages(context: CodeContext): ChatMessage[] {\n  return [\n    { role: 'system', content: CODE_SYSTEM_PROMPT },\n    { role: 'user', content: context.rendered },\n    { role: 'user', content: `Now produce the edit blocks for: ${context.instruction}` },\n  ];\n}\n\n/**\n * The system contract for the agentic loop (tool-calling). Fixed text → stable\n * cache prefix. Full coding agent (Claude Code / Codex / Cline / OpenHands class):\n * free tool use, Markdown answers, edits only via tools — never a forced edit IR.\n */\nexport const AGENT_SYSTEM_PROMPT = [\n  'You are VG Code — a full coding agent in a real repository (parity with Claude Code / Codex / Cline / OpenHands).',\n  'You handle every intent: questions, locate/search, design discussion, and multi-file edits. The host never forces an edit format on your turn — you choose tools.',\n  'Most requests change application source. Prefer editing code under packages/src, not package manifests,',\n  'unless the user asks for dependency or packaging work.',\n  '',\n  'You receive a Task Capsule (ranked symbols + source slices) as first-turn evidence. Use it;',\n  'it does not replace tools when you need more context.',\n  '',\n  'Tools: search_code (graph + literal string/URL sweep — like workspace Find), read_file, list_files, graph_impact,',\n  'library_docs, edit_file, create_file, delete_file, apply_patch, run_command, set_progress, inspect_task,',\n  'inspect_change, verify_change, ask_user, finish, abort.',\n  '',\n  'You also always have the local Vibgrate AI Context MCP tools (namespaced',\n  'mcp__vibgrate__*): search_symbols, query_graph, orient, get_node, impact_of,',\n  'library_docs, check_drift, and the rest of `vg serve`. Prefer them for deep',\n  'graph navigation, docs, and drift. Project MCP servers may add more mcp__* tools.',\n  '',\n  '## How to work',\n  '- Search or read before you edit. Never invent file contents.',\n  '- Smallest correct change; check graph_impact / mcp__vibgrate__impact_of before touching shared hubs.',\n  '- edit_file SEARCH must match current file (whitespace-flexible). Prefer apply_patch for multi-file edits.',\n  '- Run tests or build when useful; use verify_change after multi-file work.',\n  '- For multi-step tasks, call set_progress early with a short plan; mark items done as you complete them.',\n  '- Mutating tools and shell need user approval — adapt if declined.',\n  '',\n  '## Answers and task space',\n  '- Call finish with a Markdown summary: what you did or found, key `file:line` refs, next steps.',\n  '- Q&A / locate / explain: use search_code (pass the exact needle, e.g. stripe or \"stripe\"), then finish with Markdown.',\n  '- Do not invent PatchIR, dummy edits, or raw JSON as the user-facing answer. Edits only via edit_file / apply_patch tools.',\n  '',\n  '## When stuck',\n  '- If intent, scope, or trade-off is ambiguous, call ask_user with one clear question (optional options).',\n  '- Prefer ask_user over abort when the user can unblock you. Do not guess product requirements.',\n  '- abort only when the request is impossible after clarification or lookup.',\n  '',\n  'Never dump raw JSON schemas, PatchIR templates, or tool wire formats as the user-facing answer.',\n].join('\\n');\n\n/** Build the opening messages for an agent run: system contract + graph-grounded context + task. */\nexport function buildAgentMessages(context: CodeContext): ChatMessage[] {\n  return [\n    { role: 'system', content: AGENT_SYSTEM_PROMPT },\n    { role: 'user', content: context.rendered },\n    { role: 'user', content: `Task: ${context.instruction}` },\n  ];\n}\n","/**\n * The deterministic fast-apply merge engine (VG-CLI-CODE §4).\n *\n * Speed in the fast coding tools comes from letting the planner emit a *terse*\n * edit instead of rewriting a whole file; correctness comes from applying that\n * edit **deterministically and scoped**, never by letting the model free-hand\n * the merge. This module is that deterministic floor: it parses the\n * search/replace edit form and applies it with three escalating match\n * strategies — exact, whitespace-flexible, then graph-span-scoped — so an\n * ambiguous SEARCH is resolved to the symbol the planner actually named rather\n * than the first textual hit. No model is required to apply an edit; a hosted\n * fast-apply model is only ever an *acceleration* over this same contract.\n *\n * Everything here is pure and deterministic: identical (content, edit) always\n * yields the identical outcome, which is what makes it unit- and\n * benchmark-testable offline.\n */\n\nimport type { CodeEdit, EditOutcome } from './types.js';\n\n/** A symbol span the graph knows about, used to disambiguate a SEARCH match. */\nexport interface SymbolSpan {\n  /** Qualified name, matched against `anchorSymbol`. */\n  qualifiedName: string;\n  file: string;\n  /** 1-based inclusive line range. */\n  start: number;\n  end: number;\n}\n\n/**\n * Parse a model's reply into structured edits. The accepted form is the\n * widely-supported search/replace block (robust to surrounding prose and code\n * fences), plus explicit whole-file create/delete markers:\n *\n * ```\n * path/to/file.ts\n * <<<<<<< SEARCH\n * old code\n * =======\n * new code\n * >>>>>>> REPLACE\n * ```\n *\n * `CREATE path/to/new.ts` … `END CREATE` wraps a new file's whole body;\n * `DELETE path/to/gone.ts` removes a file. Parsing is forgiving of blank lines\n * and fences but strict about the block markers, so a malformed block surfaces\n * as an `invalid` outcome at apply time rather than silently corrupting a file.\n */\nexport function parseEdits(text: string): CodeEdit[] {\n  const edits: CodeEdit[] = [];\n  const lines = text.split('\\n');\n  let i = 0;\n  let pendingFile = '';\n\n  const isFence = (s: string): boolean => /^\\s*```/.test(s);\n\n  while (i < lines.length) {\n    const line = lines[i];\n\n    // Whole-file create: `CREATE <path>` … `END CREATE`.\n    const create = /^\\s*CREATE\\s+(\\S.*?)\\s*$/.exec(line);\n    if (create) {\n      const file = create[1];\n      const body: string[] = [];\n      i++;\n      while (i < lines.length && !/^\\s*END CREATE\\s*$/.test(lines[i])) {\n        if (!isFence(lines[i])) body.push(lines[i]);\n        i++;\n      }\n      i++; // consume END CREATE\n      edits.push({ op: 'create', file, content: body.join('\\n') });\n      pendingFile = '';\n      continue;\n    }\n\n    // Whole-file delete: `DELETE <path>`.\n    const del = /^\\s*DELETE\\s+(\\S.*?)\\s*$/.exec(line);\n    if (del) {\n      edits.push({ op: 'delete', file: del[1] });\n      i++;\n      pendingFile = '';\n      continue;\n    }\n\n    // Search/replace block. The file path is the most recent non-fence,\n    // non-blank line before the SEARCH marker (or an inline `path` on it).\n    if (/^\\s*<{5,}\\s*SEARCH/.test(line)) {\n      const file = pendingFile;\n      const search: string[] = [];\n      const replace: string[] = [];\n      i++;\n      while (i < lines.length && !/^\\s*={5,}\\s*$/.test(lines[i])) {\n        search.push(lines[i]);\n        i++;\n      }\n      i++; // consume =======\n      while (i < lines.length && !/^\\s*>{5,}\\s*REPLACE/.test(lines[i])) {\n        replace.push(lines[i]);\n        i++;\n      }\n      i++; // consume >>>>>>> REPLACE\n      edits.push({\n        op: 'replace',\n        file,\n        search: search.join('\\n'),\n        replace: replace.join('\\n'),\n        anchorSymbol: undefined,\n      });\n      continue;\n    }\n\n    // Track the most recent file-path candidate: a lone token that looks like a\n    // path (has a slash or a file extension) and isn't a fence/marker.\n    const trimmed = line.trim();\n    if (trimmed && !isFence(line) && looksLikePath(trimmed)) pendingFile = trimmed.replace(/[:`]+$/, '');\n    i++;\n  }\n\n  return edits;\n}\n\nfunction looksLikePath(s: string): boolean {\n  if (/\\s/.test(s.replace(/:$/, ''))) return false; // paths don't contain spaces\n  return /\\//.test(s) || /\\.[A-Za-z0-9]{1,8}:?$/.test(s);\n}\n\n/**\n * Apply a single edit to a file's current content (or `null` when the file does\n * not exist). Pure: returns the new content and an outcome; never touches disk.\n * The `spans` are the graph's symbol spans for this file — when a SEARCH is\n * textually ambiguous, a match inside the `anchorSymbol` span wins, which is how\n * the graph makes a terse edit land where the planner meant it to.\n */\nexport function applyEdit(\n  content: string | null,\n  edit: CodeEdit,\n  spans: SymbolSpan[] = [],\n): { content: string | null; outcome: EditOutcome } {\n  if (edit.op === 'create') {\n    if (content !== null && content !== edit.content) {\n      return { content, outcome: { edit, status: 'conflict', reason: `${edit.file} already exists — refusing to overwrite it with a create; use a replace edit instead` } };\n    }\n    return { content: edit.content, outcome: { edit, status: content === edit.content ? 'no-op' : 'applied', matchedBy: 'exact' } };\n  }\n\n  if (edit.op === 'delete') {\n    if (content === null) return { content: null, outcome: { edit, status: 'no-op', reason: `${edit.file} does not exist — nothing to delete` } };\n    return { content: null, outcome: { edit, status: 'applied', matchedBy: 'exact' } };\n  }\n\n  // op === 'replace'\n  if (content === null) {\n    return { content: null, outcome: { edit, status: 'not-found', reason: `${edit.file} does not exist — a replace needs an existing file (did you mean CREATE ${edit.file}?)` } };\n  }\n  if (edit.search === '') {\n    // Empty SEARCH means \"prepend\" only when the file is empty; otherwise it is\n    // ambiguous and we refuse rather than guess a location.\n    if (content === '') return { content: edit.replace, outcome: { edit, status: 'applied', matchedBy: 'exact' } };\n    return { content, outcome: { edit, status: 'invalid', reason: 'empty SEARCH on a non-empty file is ambiguous — quote the exact lines to replace' } };\n  }\n  if (edit.search === edit.replace) {\n    return { content, outcome: { edit, status: 'no-op', reason: 'SEARCH and REPLACE are identical — no change' } };\n  }\n\n  const located = locate(content, edit.search, edit.anchorSymbol, spans, edit.file);\n  if (located.kind === 'none') {\n    return { content, outcome: { edit, status: 'not-found', reason: `the SEARCH text was not found in ${edit.file} — it must match the current file exactly (whitespace-flexible)` } };\n  }\n  if (located.kind === 'ambiguous') {\n    return {\n      content,\n      outcome: {\n        edit,\n        status: 'ambiguous',\n        reason: `the SEARCH text matches ${located.count} places in ${edit.file} — add more surrounding lines, or name the symbol so the graph can disambiguate`,\n      },\n    };\n  }\n  const next = content.slice(0, located.from) + edit.replace + content.slice(located.to);\n  return { content: next, outcome: { edit, status: 'applied', matchedBy: located.matchedBy } };\n}\n\n/**\n * Apply a set of edits across a set of files. `read(file)` returns current\n * content or `null`. Edits are applied in the order given, threading each\n * file's evolving content so two edits to the same file compose. Returns, per\n * file, its before/after content and the per-edit outcomes — the dry-run\n * product the session turns into diffs. Deterministic given a deterministic\n * `read`.\n */\nexport function applyEdits(\n  edits: CodeEdit[],\n  read: (file: string) => string | null,\n  spansByFile: (file: string) => SymbolSpan[] = () => [],\n): Map<string, { before: string | null; after: string | null; outcomes: EditOutcome[] }> {\n  const state = new Map<string, { before: string | null; after: string | null; outcomes: EditOutcome[] }>();\n  for (const edit of edits) {\n    let entry = state.get(edit.file);\n    if (!entry) {\n      const before = read(edit.file);\n      entry = { before, after: before, outcomes: [] };\n      state.set(edit.file, entry);\n    }\n    const { content, outcome } = applyEdit(entry.after, edit, spansByFile(edit.file));\n    entry.after = content;\n    entry.outcomes.push(outcome);\n  }\n  return state;\n}\n\ntype Located =\n  | { kind: 'unique'; from: number; to: number; matchedBy: 'exact' | 'whitespace' | 'graph-span' }\n  | { kind: 'ambiguous'; count: number }\n  | { kind: 'none' };\n\n/**\n * Find the SEARCH text in the content. Escalates: (1) exact substring; (2)\n * whitespace-flexible (indentation/trailing-space differences tolerated); and\n * when either is ambiguous, (3) narrow to the `anchorSymbol`'s graph span so the\n * intended occurrence wins. Line-oriented so offsets map back to real edits.\n */\nfunction locate(content: string, search: string, anchor: string | undefined, spans: SymbolSpan[], file: string): Located {\n  const exact = allIndexes(content, search);\n  if (exact.length === 1) return { kind: 'unique', from: exact[0], to: exact[0] + search.length, matchedBy: 'exact' };\n  if (exact.length > 1) {\n    const scoped = scopeToAnchor(content, exact.map((from) => ({ from, to: from + search.length })), anchor, spans, file);\n    if (scoped) return { ...scoped, matchedBy: 'graph-span' };\n    return { kind: 'ambiguous', count: exact.length };\n  }\n\n  // Whitespace-flexible: compare with runs of whitespace collapsed and each\n  // line trimmed, then map the match back to real character offsets.\n  const flex = flexIndexes(content, search);\n  if (flex.length === 1) return { kind: 'unique', from: flex[0].from, to: flex[0].to, matchedBy: 'whitespace' };\n  if (flex.length > 1) {\n    const scoped = scopeToAnchor(content, flex, anchor, spans, file);\n    if (scoped) return { ...scoped, matchedBy: 'graph-span' };\n    return { kind: 'ambiguous', count: flex.length };\n  }\n  return { kind: 'none' };\n}\n\n/** Every start index of `needle` in `hay` (non-overlapping left-to-right). */\nfunction allIndexes(hay: string, needle: string): number[] {\n  const out: number[] = [];\n  if (needle === '') return out;\n  let from = 0;\n  for (;;) {\n    const idx = hay.indexOf(needle, from);\n    if (idx === -1) break;\n    out.push(idx);\n    from = idx + needle.length;\n  }\n  return out;\n}\n\n/**\n * Whitespace-flexible match: align the search's trimmed non-empty lines against\n * the content's lines, tolerating indentation and trailing-whitespace drift\n * (the single most common reason an otherwise-correct terse edit fails to\n * apply). Returns real character offset ranges for each full-block match.\n */\nfunction flexIndexes(content: string, search: string): { from: number; to: number }[] {\n  const cLines = content.split('\\n');\n  const sLines = search.split('\\n');\n  // Trim a possible leading/trailing blank line from the search block.\n  while (sLines.length && sLines[0].trim() === '') sLines.shift();\n  while (sLines.length && sLines[sLines.length - 1].trim() === '') sLines.pop();\n  if (sLines.length === 0) return [];\n  const sNorm = sLines.map((l) => l.trim());\n\n  // Precompute char offset of the start of each content line.\n  const lineStart: number[] = [];\n  let acc = 0;\n  for (const l of cLines) {\n    lineStart.push(acc);\n    acc += l.length + 1; // +1 for the '\\n'\n  }\n\n  const out: { from: number; to: number }[] = [];\n  for (let i = 0; i + sNorm.length <= cLines.length; i++) {\n    let ok = true;\n    for (let j = 0; j < sNorm.length; j++) {\n      if (cLines[i + j].trim() !== sNorm[j]) {\n        ok = false;\n        break;\n      }\n    }\n    if (!ok) continue;\n    const from = lineStart[i];\n    const lastLine = i + sNorm.length - 1;\n    const to = lineStart[lastLine] + cLines[lastLine].length; // end of the last matched line (exclusive of '\\n')\n    out.push({ from, to });\n  }\n  return out;\n}\n\n/** If exactly one candidate falls inside the anchor symbol's span, pick it. */\nfunction scopeToAnchor(\n  content: string,\n  candidates: { from: number; to: number }[],\n  anchor: string | undefined,\n  spans: SymbolSpan[],\n  file: string,\n): { kind: 'unique'; from: number; to: number } | null {\n  if (!anchor) return null;\n  const span = spans.find((s) => s.file === file && s.qualifiedName === anchor);\n  if (!span) return null;\n  const lineOf = lineIndexer(content);\n  const inside = candidates.filter((c) => {\n    const line = lineOf(c.from); // 1-based\n    return line >= span.start && line <= span.end;\n  });\n  if (inside.length === 1) return { kind: 'unique', from: inside[0].from, to: inside[0].to };\n  return null;\n}\n\n/** Returns a function mapping a char offset → 1-based line number. */\nfunction lineIndexer(content: string): (offset: number) => number {\n  const starts: number[] = [0];\n  for (let i = 0; i < content.length; i++) if (content[i] === '\\n') starts.push(i + 1);\n  return (offset: number) => {\n    // binary search for the greatest line start <= offset\n    let lo = 0;\n    let hi = starts.length - 1;\n    while (lo < hi) {\n      const mid = (lo + hi + 1) >> 1;\n      if (starts[mid] <= offset) lo = mid;\n      else hi = mid - 1;\n    }\n    return lo + 1;\n  };\n}\n","/**\n * Deterministic unified diff (VG-CLI-CODE §4.3).\n *\n * A `vg code` dry-run shows the human/agent exactly what would change *before*\n * anything is written — the \"inspect the proposal\" half of the governance\n * lifecycle. This is a small, dependency-free Myers-style line diff producing\n * standard unified-diff hunks. Identical (before, after) always renders the\n * identical text, so the dry-run output is stable and diff-able in tests and\n * benchmarks.\n */\n\n/** Render a unified diff for one file. Returns '' when there is no change. */\nexport function unifiedDiff(before: string | null, after: string | null, file: string, context = 3): string {\n  if (before === after) return '';\n  if (before === null) return newFileDiff(after ?? '', file);\n  if (after === null) return deletedFileDiff(before, file);\n\n  const a = splitLines(before);\n  const b = splitLines(after);\n  const ops = diffLines(a, b);\n  const hunks = groupHunks(ops, context);\n  if (hunks.length === 0) return '';\n\n  const out: string[] = [`--- a/${file}`, `+++ b/${file}`];\n  for (const h of hunks) {\n    out.push(`@@ -${h.aStart},${h.aLen} +${h.bStart},${h.bLen} @@`);\n    for (const line of h.lines) out.push(line);\n  }\n  return out.join('\\n');\n}\n\n/**\n * Whole-file create/delete bodies larger than this are summarized instead of\n * line-dumped. Small files stay fully visible for review; large page deletes\n * (hundreds/thousands of lines) only need path + line count in the transcript.\n */\nconst FULL_BODY_LINE_CAP = 40;\n\nfunction newFileDiff(after: string, file: string): string {\n  const lines = splitLines(after);\n  const out = [`--- /dev/null`, `+++ b/${file}`, `@@ -0,0 +1,${lines.length} @@`];\n  if (lines.length > FULL_BODY_LINE_CAP) {\n    out.push(`+… ${lines.length} lines added …`);\n    return out.join('\\n');\n  }\n  for (const l of lines) out.push(`+${l}`);\n  return out.join('\\n');\n}\n\nfunction deletedFileDiff(before: string, file: string): string {\n  const lines = splitLines(before);\n  const n = lines.length;\n  const out = [`--- a/${file}`, `+++ /dev/null`, `@@ -1,${n} +0,0 @@`];\n  // No — we do not need the full body in the panel when a page is deleted.\n  // Undo still keeps FileChange.before; approval is path-only for delete_file.\n  if (n > FULL_BODY_LINE_CAP) {\n    out.push(`-… ${n} lines deleted …`);\n    return out.join('\\n');\n  }\n  for (const l of lines) out.push(`-${l}`);\n  return out.join('\\n');\n}\n\nfunction splitLines(s: string): string[] {\n  if (s === '') return [];\n  const lines = s.split('\\n');\n  // A trailing newline yields a final '' element — drop it so line counts match.\n  if (lines.length && lines[lines.length - 1] === '') lines.pop();\n  return lines;\n}\n\ntype Op = { tag: 'eq' | 'del' | 'add'; line: string };\n\n/**\n * Line diff via LCS (dynamic programming). O(n·m) space is fine for source\n * files; the deterministic backtrace (favouring deletions before additions on\n * ties) keeps output stable.\n */\nfunction diffLines(a: string[], b: string[]): Op[] {\n  const n = a.length;\n  const m = b.length;\n  const dp: number[][] = Array.from({ length: n + 1 }, () => new Array(m + 1).fill(0));\n  for (let i = n - 1; i >= 0; i--) {\n    for (let j = m - 1; j >= 0; j--) {\n      dp[i][j] = a[i] === b[j] ? dp[i + 1][j + 1] + 1 : Math.max(dp[i + 1][j], dp[i][j + 1]);\n    }\n  }\n  const ops: Op[] = [];\n  let i = 0;\n  let j = 0;\n  while (i < n && j < m) {\n    if (a[i] === b[j]) {\n      ops.push({ tag: 'eq', line: a[i] });\n      i++;\n      j++;\n    } else if (dp[i + 1][j] >= dp[i][j + 1]) {\n      ops.push({ tag: 'del', line: a[i] });\n      i++;\n    } else {\n      ops.push({ tag: 'add', line: b[j] });\n      j++;\n    }\n  }\n  while (i < n) ops.push({ tag: 'del', line: a[i++] });\n  while (j < m) ops.push({ tag: 'add', line: b[j++] });\n  return ops;\n}\n\ninterface Hunk {\n  aStart: number;\n  aLen: number;\n  bStart: number;\n  bLen: number;\n  lines: string[];\n}\n\n/** Group the op stream into unified-diff hunks with `context` equal lines around changes. */\nfunction groupHunks(ops: Op[], context: number): Hunk[] {\n  // Index of each op that is a change (del/add).\n  const changeIdx = ops.map((o, i) => (o.tag === 'eq' ? -1 : i)).filter((i) => i >= 0);\n  if (changeIdx.length === 0) return [];\n\n  // Merge change indices into windows that share context.\n  const windows: [number, number][] = [];\n  let start = Math.max(0, changeIdx[0] - context);\n  let end = Math.min(ops.length - 1, changeIdx[0] + context);\n  for (let k = 1; k < changeIdx.length; k++) {\n    const cs = Math.max(0, changeIdx[k] - context);\n    const ce = Math.min(ops.length - 1, changeIdx[k] + context);\n    if (cs <= end + 1) {\n      end = ce;\n    } else {\n      windows.push([start, end]);\n      start = cs;\n      end = ce;\n    }\n  }\n  windows.push([start, end]);\n\n  const hunks: Hunk[] = [];\n  // Running 1-based line numbers into a and b.\n  let aLine = 1;\n  let bLine = 1;\n  let idx = 0;\n  for (const [ws, we] of windows) {\n    // advance line counters up to window start\n    while (idx < ws) {\n      const o = ops[idx];\n      if (o.tag !== 'add') aLine++;\n      if (o.tag !== 'del') bLine++;\n      idx++;\n    }\n    const hunk: Hunk = { aStart: aLine, aLen: 0, bStart: bLine, bLen: 0, lines: [] };\n    for (let k = ws; k <= we; k++) {\n      const o = ops[k];\n      if (o.tag === 'eq') {\n        hunk.lines.push(` ${o.line}`);\n        hunk.aLen++;\n        hunk.bLen++;\n        aLine++;\n        bLine++;\n      } else if (o.tag === 'del') {\n        hunk.lines.push(`-${o.line}`);\n        hunk.aLen++;\n        aLine++;\n      } else {\n        hunk.lines.push(`+${o.line}`);\n        hunk.bLen++;\n        bLine++;\n      }\n      idx = k + 1;\n    }\n    // A hunk that starts at line 1 with zero length should report start 0.\n    if (hunk.aLen === 0) hunk.aStart = Math.max(0, hunk.aStart - 1);\n    if (hunk.bLen === 0) hunk.bStart = Math.max(0, hunk.bStart - 1);\n    hunks.push(hunk);\n  }\n  return hunks;\n}\n\n/**\n * Count +/− lines in a unified diff. Whole-file create/delete summaries\n * (`+… N lines added …` / `-… N lines deleted …`) use the hunk header for the\n * true line count so the rollup stays accurate when bodies are compacted.\n */\nexport function countDiffStats(diff: string): { added: number; removed: number } {\n  if (!diff) return { added: 0, removed: 0 };\n\n  const isWholeDelete = /^\\+\\+\\+ \\/dev\\/null$/m.test(diff);\n  const isWholeCreate = /^--- \\/dev\\/null$/m.test(diff);\n  if (isWholeDelete) {\n    const m = diff.match(/@@ -(\\d+)(?:,(\\d+))? \\+0(?:,0)? @@/);\n    if (m) {\n      const n = m[2] != null ? Number(m[2]) : Number(m[1]) || 0;\n      return { added: 0, removed: Number.isFinite(n) ? n : 0 };\n    }\n  }\n  if (isWholeCreate) {\n    const m = diff.match(/@@ -0(?:,0)? \\+(\\d+)(?:,(\\d+))? @@/);\n    if (m) {\n      const n = m[2] != null ? Number(m[2]) : Number(m[1]) || 0;\n      return { added: Number.isFinite(n) ? n : 0, removed: 0 };\n    }\n  }\n\n  let added = 0;\n  let removed = 0;\n  for (const line of diff.split('\\n')) {\n    if (line.startsWith('+') && !line.startsWith('+++')) added++;\n    else if (line.startsWith('-') && !line.startsWith('---')) removed++;\n  }\n  return { added, removed };\n}\n\n/** A compact one-line changeset summary: `+adds -dels across N file(s)`. */\nexport function summarizeDiffs(diffs: { file: string; diff: string }[]): string {\n  let adds = 0;\n  let dels = 0;\n  let touched = 0;\n  for (const { diff } of diffs) {\n    if (!diff) continue;\n    touched++;\n    const { added, removed } = countDiffStats(diff);\n    adds += added;\n    dels += removed;\n  }\n  return `+${adds} -${dels} across ${touched} file(s)`;\n}\n","/**\n * Model backends for `vg code` (VG-CLI-CODE §5).\n *\n * Every backend implements the same {@link Provider} contract, so the router and\n * session are provider-agnostic. Three families:\n *   - **local HTTP** — Ollama and LM Studio, reached over `fetch` on localhost;\n *     no package, no key, no egress. Selected under `--local`.\n *   - **hosted HTTP** — any OpenAI-compatible endpoint (OpenRouter, LiteLLM,\n *     Together, a self-hosted gateway, …). One shape covers the \"best in breed\n *     router\" story: an ordered model list with automatic fallback lives in the\n *     router, not here. Keys come from the environment only and are never logged.\n *   - **local inference** — a llama.cpp binding loaded on demand via\n *     {@link ensurePackage}; this is the one path that may install a package on\n *     first use, and only with consent. Model weights are never auto-downloaded.\n *\n * A deterministic {@link MockProvider} backs the tests, the offline benchmark,\n * and the `--mock` flag, so the whole loop runs end-to-end with no network.\n */\n\nimport { ensurePackage, ensureUnavailableMessage } from './ensure.js';\nimport type { ChatMessage, ChatOptions, Provider, ProviderResult, ToolCall, ToolSpec } from './types.js';\n\n/* ------------------------------------------------------------------ *\\\n *  Tool-calling wire helpers (shared by the HTTP providers)\n\\* ------------------------------------------------------------------ */\n\n/** Map our ChatMessage union to OpenAI-compatible wire messages (tool calls included). */\nfunction openAiMessages(messages: ChatMessage[]): unknown[] {\n  return messages.map((m) => {\n    if (m.role === 'tool') return { role: 'tool', tool_call_id: m.toolCallId, name: m.name, content: m.content };\n    if (m.role === 'assistant' && m.toolCalls?.length) {\n      return {\n        role: 'assistant',\n        content: m.content || null,\n        tool_calls: m.toolCalls.map((t) => ({ id: t.id, type: 'function', function: { name: t.name, arguments: JSON.stringify(t.arguments) } })),\n      };\n    }\n    // Multimodal user turn → OpenAI content-part array (text + data-URI images).\n    if (m.role === 'user' && m.images?.length) {\n      return {\n        role: 'user',\n        content: [\n          { type: 'text', text: m.content },\n          ...m.images.map((img) => ({\n            type: 'image_url',\n            image_url: { url: `data:${img.mediaType};base64,${img.dataBase64}` },\n          })),\n        ],\n      };\n    }\n    return { role: m.role, content: m.content };\n  });\n}\n\n/** Ollama's chat shape: images ride as a base64 array on the message itself. */\nfunction ollamaMessages(messages: ChatMessage[]): unknown[] {\n  return openAiMessages(messages).map((wire, i) => {\n    const m = messages[i];\n    if (m.role === 'user' && m.images?.length) {\n      return { role: 'user', content: m.content, images: m.images.map((img) => img.dataBase64) };\n    }\n    return wire;\n  });\n}\n\n/** OpenAI-compatible `tools` array from our specs. */\nfunction openAiTools(tools: ToolSpec[] | undefined): unknown[] | undefined {\n  if (!tools?.length) return undefined;\n  return tools.map((t) => ({ type: 'function', function: { name: t.name, description: t.description, parameters: t.parameters } }));\n}\n\n/** Parse OpenAI-shaped tool_calls, tolerating a malformed arguments string. */\nfunction parseToolCalls(raw: unknown, synthesizePrefix = 'call'): ToolCall[] {\n  const calls = raw as { id?: string; function?: { name?: string; arguments?: unknown } }[] | undefined;\n  if (!Array.isArray(calls)) return [];\n  return calls.map((c, i) => ({\n    id: typeof c.id === 'string' && c.id ? c.id : `${synthesizePrefix}_${i}`,\n    name: c.function?.name ?? 'unknown',\n    arguments: coerceArgs(c.function?.arguments),\n  }));\n}\n\nfunction coerceArgs(raw: unknown): Record<string, unknown> {\n  if (raw && typeof raw === 'object') return raw as Record<string, unknown>;\n  if (typeof raw === 'string') {\n    try {\n      const parsed = JSON.parse(raw);\n      return parsed && typeof parsed === 'object' ? (parsed as Record<string, unknown>) : {};\n    } catch {\n      return {};\n    }\n  }\n  return {};\n}\n\n/** Redact anything that looks like a credential before it can reach a log/error. */\nexport function redactSecrets(s: string): string {\n  return s\n    .replace(/\\b(sk|xoxb|ghp|gho|glpat|AKIA)[-_][A-Za-z0-9-_]{6,}/g, '$1-***redacted***')\n    .replace(/Bearer\\s+[A-Za-z0-9._-]{8,}/gi, 'Bearer ***redacted***');\n}\n\n/** Common HTTP-completion error shaping: actionable, internals-free (GUARDRAILS §1.3). */\nfunction httpError(label: string, status: number, hint: string): Error {\n  return new Error(`${label} returned HTTP ${status} — ${hint}`);\n}\n\n/**\n * The server's own account of what went wrong, when it gave one. An\n * OpenAI-compatible error body is `{ error: { message } }` or `{ error: '…' }`;\n * the Vibgrate Relay adds `detail` (the upstream's verbatim reason) and\n * `correlation_id`. Guessing a hint from the status code alone turns an\n * actionable \"insufficient credits\" or \"no endpoints match your data policy\"\n * into \"check the model id\" — so prefer the body whenever it carries text.\n * Total and defensive: any parse failure just yields null and the caller\n * falls back to its hint.\n */\n/**\n * A `detail` is the upstream's verbatim reason, and upstream reasons are JSON\n * envelopes more often than sentences. Rendered as-is one fills the panel with\n * braces and then gets cut mid-token by the 400-char cap\n * (`\"requested_providers\":[\"goo`), burying the sentence that explains the\n * failure. Lift that sentence out, and spell out the provider lists a routing\n * refusal carries. Total — a non-envelope string comes back untouched, so a\n * plain-prose detail is never mangled.\n */\nexport function unwrapNestedErrorJson(text: string): string {\n  const trimmed = (text ?? '').trim();\n  if (!trimmed.startsWith('{')) return trimmed;\n  let parsed: unknown;\n  try {\n    parsed = JSON.parse(trimmed);\n  } catch {\n    return trimmed;\n  }\n  const obj = (parsed ?? {}) as { error?: unknown; message?: unknown };\n  const err = obj.error;\n  const errObj = (typeof err === 'object' && err ? err : {}) as { message?: unknown; metadata?: unknown };\n  const message =\n    typeof err === 'string' ? err : typeof errObj.message === 'string' ? errObj.message : typeof obj.message === 'string' ? obj.message : null;\n  if (!message?.trim()) return trimmed;\n  const metadata = (typeof errObj.metadata === 'object' && errObj.metadata ? errObj.metadata : {}) as {\n    requested_providers?: unknown;\n    available_providers?: unknown;\n  };\n  const names = (value: unknown): string[] =>\n    Array.isArray(value) ? value.filter((v): v is string => typeof v === 'string' && !!v.trim()) : [];\n  const requested = names(metadata.requested_providers);\n  const available = names(metadata.available_providers);\n  const parts = [message.trim()];\n  // OpenRouter's own meaning, which is easy to get backwards: `requested` is\n  // what the routing was RESTRICTED to, `available` is who actually serves the\n  // model. Labelling `available` as \"permitted\" sent debugging the wrong way.\n  if (requested.length) parts.push(`routing was restricted to: ${requested.join(', ')}`);\n  if (available.length) parts.push(`this model is served by: ${available.join(', ')}`);\n  return parts.join(' — ');\n}\n\nexport function relayErrorDetail(body: string): string | null {\n  if (!body) return null;\n  let parsed: unknown;\n  try {\n    parsed = JSON.parse(body);\n  } catch {\n    return nonJsonErrorDetail(body);\n  }\n  const obj = parsed as { error?: unknown; detail?: unknown; message?: unknown; correlation_id?: unknown };\n  const err = obj?.error;\n  const errObj = (typeof err === 'object' && err ? err : {}) as { message?: unknown; detail?: unknown; correlation_id?: unknown };\n  const message =\n    typeof err === 'string'\n      ? err\n      : typeof errObj.message === 'string'\n        ? errObj.message\n        : typeof obj?.message === 'string'\n          ? obj.message\n          : null;\n  const detailValue = typeof obj?.detail === 'string' ? obj.detail : typeof errObj.detail === 'string' ? errObj.detail : null;\n  const detail = detailValue && detailValue.trim() ? unwrapNestedErrorJson(detailValue) : null;\n  const parts = [message, detail].filter((p): p is string => !!p && p.trim().length > 0);\n  if (!parts.length) return null;\n  const correlationId = typeof obj?.correlation_id === 'string' && obj.correlation_id\n    ? obj.correlation_id\n    : typeof errObj.correlation_id === 'string' && errObj.correlation_id\n      ? errObj.correlation_id\n      : null;\n  const id = correlationId ? ` (correlation id ${correlationId})` : '';\n  return `${[...new Set(parts)].join(' — ').slice(0, 400)}${id}`;\n}\n\n/**\n * A non-JSON body — an HTML error page from a CDN or proxy sitting in front of\n * the endpoint, a plain-text proxy notice. A short one is still more\n * informative than nothing; a long one is noise EXCEPT for its `<title>`\n * (\"502 Bad Gateway\", \"Worker threw exception\"), which is the whole story.\n * Without that salvage the caller falls back to a status-code guess and blames\n * the model id for what is really an infrastructure failure.\n */\nfunction nonJsonErrorDetail(body: string): string | null {\n  const text = body.trim();\n  if (!text) return null;\n  if (text.length <= 200) return text;\n  const title = /<title[^>]*>([\\s\\S]*?)<\\/title>/i.exec(text)?.[1]?.replace(/\\s+/g, ' ').trim();\n  if (title) return title.slice(0, 200);\n  // Cloudflare renders its worker/gateway failures as \"Error 1101\"-style codes.\n  const code = /\\bError\\s+\\d{3,4}\\b/.exec(text)?.[0];\n  return code ?? null;\n}\n\n/**\n * What to suggest for a failing status when the server said nothing useful.\n * A gateway status (502/503/504) means the request never reached the model, or\n * never came back from it — the model id is not the suspect there, and saying\n * it is sends people editing a `--model` flag that was correct all along.\n */\nexport function statusHint(status: number, model: string, apiKeyEnv: string | undefined): string {\n  if (status === 401 || status === 403) return `the key in ${apiKeyEnv ?? '(none)'} was rejected — check it has access to \"${model}\"`;\n  if (status === 402) return 'the account behind this endpoint is out of credit — top it up, or switch backend with --provider / --local';\n  if (status === 404) return `this endpoint has no model \"${model}\" — check the id (\\`vg models catalog\\`) and the base URL`;\n  if (status === 408 || status === 504) return 'the request timed out before the model replied — retry, shorten the task, or use --local';\n  if (status === 429) return 'rate limited — wait and retry, or switch backend with --provider / --local';\n  if (status >= 500) return `the endpoint failed to serve the request — this is an upstream/gateway failure, not the model id \"${model}\"; retry, or use --provider / --local if it persists`;\n  return `check the model id \"${model}\" and the endpoint`;\n}\n\n/** Yield newline-delimited lines from a streamed response body. */\nasync function* streamLines(res: Response): AsyncGenerator<string> {\n  const reader = res.body?.getReader();\n  if (!reader) return;\n  const decoder = new TextDecoder();\n  let buf = '';\n  for (;;) {\n    const { done, value } = await reader.read();\n    if (done) break;\n    buf += decoder.decode(value, { stream: true });\n    let idx: number;\n    while ((idx = buf.indexOf('\\n')) >= 0) {\n      const line = buf.slice(0, idx).trim();\n      buf = buf.slice(idx + 1);\n      if (line) yield line;\n    }\n  }\n  if (buf.trim()) yield buf.trim();\n}\n\n/** Accumulate an OpenAI-compatible SSE stream into text + tool calls + usage. */\nexport function accumulateOpenAiDelta(\n  acc: {\n    text: string;\n    tools: Map<number, { id?: string; name?: string; args: string }>;\n    usage: { promptTokens?: number; completionTokens?: number };\n    /** Last non-null `finish_reason` seen — 'length' means the cap cut the reply. */\n    finishReason?: string;\n  },\n  chunk: unknown,\n  onToken?: (t: string) => void,\n): void {\n  const c = chunk as { choices?: { delta?: { content?: string; tool_calls?: { index?: number; id?: string; function?: { name?: string; arguments?: string } }[] }; finish_reason?: string | null }[]; usage?: { prompt_tokens?: number; completion_tokens?: number } };\n  const reason = c.choices?.[0]?.finish_reason;\n  if (typeof reason === 'string' && reason) acc.finishReason = reason;\n  const delta = c.choices?.[0]?.delta;\n  if (delta?.content) {\n    acc.text += delta.content;\n    onToken?.(delta.content);\n  }\n  for (const tc of delta?.tool_calls ?? []) {\n    const idx = tc.index ?? 0;\n    const e = acc.tools.get(idx) ?? { args: '' };\n    if (tc.id) e.id = tc.id;\n    if (tc.function?.name) e.name = tc.function.name;\n    if (tc.function?.arguments) e.args += tc.function.arguments;\n    acc.tools.set(idx, e);\n  }\n  if (c.usage) {\n    acc.usage.promptTokens = c.usage.prompt_tokens;\n    acc.usage.completionTokens = c.usage.completion_tokens;\n  }\n}\n\n/** Turn accumulated OpenAI tool-call fragments into ToolCalls. */\nfunction finalizeTools(tools: Map<number, { id?: string; name?: string; args: string }>): ToolCall[] {\n  return [...tools.entries()]\n    .sort((a, b) => a[0] - b[0])\n    .map(([i, e]) => ({ id: e.id ?? `call_${i}`, name: e.name ?? 'unknown', arguments: coerceArgs(e.args) }));\n}\n\nasync function postJson(url: string, body: unknown, headers: Record<string, string>, timeoutMs: number): Promise<Response> {\n  const controller = new AbortController();\n  const timer = setTimeout(() => controller.abort(), timeoutMs);\n  try {\n    return await fetch(url, { method: 'POST', headers: { 'content-type': 'application/json', ...headers }, body: JSON.stringify(body), signal: controller.signal });\n  } finally {\n    clearTimeout(timer);\n  }\n}\n\n/* ------------------------------------------------------------------ *\\\n *  Deterministic mock (tests / offline / --mock)\n\\* ------------------------------------------------------------------ */\n\n/**\n * A provider that returns a fixed, scripted reply — the deterministic floor that\n * lets the entire `vg code` loop run offline. Used by tests, the benchmark, and\n * the `--mock` flag (which reads the scripted edit blocks from a file).\n */\nexport class MockProvider implements Provider {\n  readonly id = 'mock';\n  readonly label = 'Mock (deterministic)';\n  readonly local = true;\n  constructor(\n    readonly model: string,\n    private readonly reply: string,\n  ) {}\n  async chat(_messages?: ChatMessage[], _opts?: ChatOptions): Promise<ProviderResult> {\n    return { text: this.reply, model: this.model, provider: this.id };\n  }\n}\n\n/* ------------------------------------------------------------------ *\\\n *  Ollama (local, no key)\n\\* ------------------------------------------------------------------ */\n\nexport class OllamaProvider implements Provider {\n  readonly id = 'ollama';\n  readonly label = 'Ollama (local)';\n  readonly local = true;\n  constructor(\n    readonly model: string,\n    private readonly host = process.env.OLLAMA_HOST || 'http://127.0.0.1:11434',\n  ) {}\n  async chat(messages: ChatMessage[], opts: ChatOptions = {}): Promise<ProviderResult> {\n    const streaming = !!(opts.stream && opts.onToken);\n    let res: Response;\n    try {\n      res = await postJson(\n        `${this.host.replace(/\\/$/, '')}/api/chat`,\n        { model: this.model, messages: ollamaMessages(messages), stream: streaming, tools: openAiTools(opts.tools), options: { temperature: opts.temperature ?? 0 } },\n        {},\n        opts.timeoutMs ?? 120_000,\n      );\n    } catch {\n      throw new Error(`couldn't reach Ollama at ${this.host} — is \\`ollama serve\\` running? (start it, or pass --provider to use a different backend)`);\n    }\n    if (!res.ok) throw httpError('Ollama', res.status, res.status === 404 ? `model \"${this.model}\" isn't pulled — run \\`ollama pull ${this.model}\\` or pick another with --model` : 'check `ollama serve` and the model name');\n\n    if (streaming) {\n      let text = '';\n      let toolCallsRaw: unknown;\n      let truncated = false;\n      const usage: { promptTokens?: number; completionTokens?: number } = {};\n      for await (const line of streamLines(res)) {\n        try {\n          const obj = JSON.parse(line) as { message?: { content?: string; tool_calls?: unknown }; prompt_eval_count?: number; eval_count?: number; done_reason?: string };\n          const delta = obj.message?.content;\n          if (delta) {\n            text += delta;\n            opts.onToken?.(delta);\n          }\n          if (obj.message?.tool_calls) toolCallsRaw = obj.message.tool_calls;\n          if (typeof obj.prompt_eval_count === 'number') usage.promptTokens = obj.prompt_eval_count;\n          if (typeof obj.eval_count === 'number') usage.completionTokens = obj.eval_count;\n          // Ollama's spelling of finish_reason: 'length' means num_predict cut it.\n          if (obj.done_reason === 'length') truncated = true;\n        } catch {\n          /* skip a malformed line */\n        }\n      }\n      return { text, model: this.model, provider: this.id, toolCalls: parseToolCalls(toolCallsRaw), usage, truncated };\n    }\n\n    const data = (await res.json()) as { message?: { content?: string; tool_calls?: unknown }; prompt_eval_count?: number; eval_count?: number; done_reason?: string };\n    return {\n      text: data.message?.content ?? '',\n      model: this.model,\n      provider: this.id,\n      toolCalls: parseToolCalls(data.message?.tool_calls),\n      usage: { promptTokens: data.prompt_eval_count, completionTokens: data.eval_count },\n      truncated: data.done_reason === 'length',\n    };\n  }\n}\n\n/* ------------------------------------------------------------------ *\\\n *  OpenAI-compatible (LM Studio, OpenRouter, LiteLLM, …)\n\\* ------------------------------------------------------------------ */\n\nexport interface OpenAiCompatibleConfig {\n  /** Base URL, e.g. `https://openrouter.ai/api/v1` or `http://127.0.0.1:1234/v1`. */\n  baseUrl: string;\n  /** Env var name holding the API key (never the key itself). Absent for local. */\n  apiKeyEnv?: string;\n  /** Whether this endpoint is on-device (LM Studio) vs hosted. */\n  local: boolean;\n  /** Display label. */\n  label: string;\n  id: string;\n}\n\nexport class OpenAiCompatibleProvider implements Provider {\n  readonly id: string;\n  readonly label: string;\n  readonly local: boolean;\n  constructor(\n    readonly model: string,\n    private readonly config: OpenAiCompatibleConfig,\n  ) {\n    this.id = config.id;\n    this.label = config.label;\n    this.local = config.local;\n  }\n  async chat(messages: ChatMessage[], opts: ChatOptions = {}): Promise<ProviderResult> {\n    const headers: Record<string, string> = {};\n    if (this.config.apiKeyEnv) {\n      const key = process.env[this.config.apiKeyEnv];\n      if (!key) {\n        throw new Error(`${this.label} needs an API key in ${this.config.apiKeyEnv} — set it in your environment (never pass keys as flags), or use --local for an on-device backend.`);\n      }\n      headers.authorization = `Bearer ${key}`;\n    }\n    const streaming = !!(opts.stream && opts.onToken);\n    const url = `${this.config.baseUrl.replace(/\\/$/, '')}/chat/completions`;\n    const body = {\n      model: this.model,\n      messages: openAiMessages(messages),\n      tools: openAiTools(opts.tools),\n      temperature: opts.temperature ?? 0,\n      max_tokens: opts.maxTokens,\n      stream: streaming,\n      ...(streaming ? { stream_options: { include_usage: true } } : {}),\n    };\n    let res: Response;\n    try {\n      res = await postJson(url, body, headers, opts.timeoutMs ?? 120_000);\n    } catch {\n      throw new Error(`couldn't reach ${this.label} at ${this.config.baseUrl} — check the endpoint is up (or use --local).`);\n    }\n    if (!res.ok) {\n      const detail = relayErrorDetail(await res.text().catch(() => ''));\n      const hint = detail ?? statusHint(res.status, this.model, this.config.apiKeyEnv);\n      throw httpError(this.label, res.status, hint);\n    }\n\n    if (streaming) {\n      const acc = { text: '', tools: new Map<number, { id?: string; name?: string; args: string }>(), usage: {} as { promptTokens?: number; completionTokens?: number }, finishReason: undefined as string | undefined };\n      for await (const line of streamLines(res)) {\n        if (!line.startsWith('data:')) continue;\n        const payload = line.slice(5).trim();\n        if (payload === '[DONE]') break;\n        try {\n          accumulateOpenAiDelta(acc, JSON.parse(payload), opts.onToken);\n        } catch {\n          /* skip a malformed chunk */\n        }\n      }\n      const tools = finalizeTools(acc.tools);\n      return { text: acc.text, model: this.model, provider: this.id, toolCalls: tools.length ? tools : undefined, usage: acc.usage, truncated: acc.finishReason === 'length' };\n    }\n    const data = (await res.json()) as { choices?: { message?: { content?: string; tool_calls?: unknown }; finish_reason?: string | null }[]; usage?: { prompt_tokens?: number; completion_tokens?: number } };\n    const message = data.choices?.[0]?.message;\n    return {\n      text: message?.content ?? '',\n      model: this.model,\n      provider: this.id,\n      toolCalls: parseToolCalls(message?.tool_calls),\n      usage: { promptTokens: data.usage?.prompt_tokens, completionTokens: data.usage?.completion_tokens },\n      truncated: data.choices?.[0]?.finish_reason === 'length',\n    };\n  }\n}\n\n/* ------------------------------------------------------------------ *\\\n *  Scripted provider (agent-loop tests / offline demos)\n\\* ------------------------------------------------------------------ */\n\n/**\n * Returns a queued sequence of {@link ProviderResult}s — one per turn — so the\n * agentic loop can be driven deterministically offline: script the tool calls\n * the \"model\" makes (read → search → edit → run → finish) and assert what the\n * agent did. Ignores the incoming messages by design.\n */\nexport class ScriptedProvider implements Provider {\n  readonly id = 'scripted';\n  readonly label = 'Scripted (deterministic)';\n  readonly local = true;\n  private turn = 0;\n  constructor(\n    readonly model: string,\n    private readonly steps: Array<{ text?: string; toolCalls?: ToolCall[]; truncated?: boolean }>,\n  ) {}\n  // Match Provider.chat so tests can wrap/spy with the full signature.\n  async chat(_messages?: ChatMessage[], _opts?: ChatOptions): Promise<ProviderResult> {\n    const step = this.steps[Math.min(this.turn, this.steps.length - 1)];\n    this.turn++;\n    return { text: step.text ?? '', model: this.model, provider: this.id, toolCalls: step.toolCalls, truncated: step.truncated };\n  }\n}\n\n/** The catalogue of known OpenAI-compatible endpoints, keyed by short id. */\nexport const OPENAI_COMPATIBLE: Record<string, Omit<OpenAiCompatibleConfig, 'label' | 'id'> & { label: string }> = {\n  /**\n   * Vibgrate Relay — the first-party hosted router. OpenAI-compatible, so it\n   * needs no bespoke client. Reached with a Vibgrate token rather than a\n   * provider key; the base URL is overridable for staging and self-hosting.\n   */\n  'vibgrate-relay': {\n    baseUrl: process.env.VIBGRATE_RELAY_URL || 'https://api.vibgrate.com/relay/v1',\n    apiKeyEnv: 'VIBGRATE_RELAY_TOKEN',\n    local: false,\n    label: 'Vibgrate Relay',\n  },\n  openrouter: { baseUrl: 'https://openrouter.ai/api/v1', apiKeyEnv: 'OPENROUTER_API_KEY', local: false, label: 'OpenRouter' },\n  litellm: { baseUrl: process.env.LITELLM_BASE_URL || 'http://127.0.0.1:4000', apiKeyEnv: 'LITELLM_API_KEY', local: false, label: 'LiteLLM' },\n  openai: { baseUrl: 'https://api.openai.com/v1', apiKeyEnv: 'OPENAI_API_KEY', local: false, label: 'OpenAI' },\n  together: { baseUrl: 'https://api.together.xyz/v1', apiKeyEnv: 'TOGETHER_API_KEY', local: false, label: 'Together' },\n  /**\n   * VS Code language models (Copilot Chat etc.) via the extension's loopback\n   * OpenAI-compatible proxy. Base URL is injected as VSCODE_LM_BASE_URL at spawn.\n   */\n  'vscode-lm': {\n    baseUrl: process.env.VSCODE_LM_BASE_URL || 'http://127.0.0.1:0/v1',\n    local: true,\n    label: 'VS Code Language Model',\n  },\n  lmstudio: { baseUrl: process.env.LMSTUDIO_BASE_URL || 'http://127.0.0.1:1234/v1', local: true, label: 'LM Studio (local)' },\n  /**\n   * Microsoft Foundry Local — OpenAI-compatible local endpoint (Windows NPU/GPU).\n   * Default port matches current Foundry Local docs; override with FOUNDRY_LOCAL_BASE_URL.\n   */\n  'foundry-local': {\n    baseUrl: process.env.FOUNDRY_LOCAL_BASE_URL || 'http://127.0.0.1:5272/v1',\n    local: true,\n    label: 'Foundry Local',\n  },\n};\n\n/* ------------------------------------------------------------------ *\\\n *  Local llama.cpp (installs a package on first use, with consent)\n\\* ------------------------------------------------------------------ */\n\n/**\n * A fully-local inference backend backed by the dual-mode llm-host (ADR-005)\n * and `node-llama-cpp`. Install runtime deps via `vg models install` (or pass\n * consent so ensurePackage can run once). Model *weights* are never fetched\n * automatically: `modelPath` must point at a gguf the user already has.\n */\nexport class LocalLlamaProvider implements Provider {\n  readonly id = 'llama-cpp';\n  /** Surfaced as the Vibgrate model manager (embedded llama.cpp). */\n  readonly label = 'Vibgrate (local)';\n  readonly local = true;\n  /**\n   * The embedded host has no native function-calling API — the router wraps\n   * this provider in the text tool protocol (text-tool-protocol.ts) so the\n   * agent loop still gets structured tool calls.\n   */\n  readonly supportsTools = false;\n  /** Process-wide warm binding + path (best-in-breed: no reload per turn). */\n  private static warmBinding: unknown | null = null;\n  private static warmHost: import('../runtime/llm-host/embedded.js').EmbeddedLlmHost | null = null;\n  private static warmPath: string | null = null;\n\n  constructor(\n    readonly model: string,\n    private readonly modelPath: string,\n    private readonly ensure: typeof ensurePackage = ensurePackage,\n    private readonly consent = false,\n    /** Override isolation (default: env / embedded). */\n    private readonly isolation: 'embedded' | 'process' = 'embedded',\n    private readonly processEndpoint?: string,\n  ) {}\n  async chat(messages: ChatMessage[], opts: ChatOptions = {}): Promise<ProviderResult> {\n    const {\n      createLlmHost,\n      EmbeddedLlmHost,\n      resolveInferenceIsolation,\n      acquireHostSession,\n      generateOnSession,\n      evictIdleSessions,\n    } = await import('../runtime/llm-host/index.js');\n    const isolation = resolveInferenceIsolation(this.isolation);\n    try {\n      const chatMessages = messages.map((m) => ({\n        role: (m.role === 'tool' ? 'user' : m.role) as 'system' | 'user' | 'assistant',\n        content: m.content,\n      }));\n      const genOpts = {\n        temperature: opts.temperature ?? 0,\n        maxTokens: opts.maxTokens,\n        grammar: opts.grammar,\n        requireGrammar: opts.requireGrammar,\n        identifierTrie: opts.identifierTrie,\n        annotateUnknownIdentifiers: !!opts.identifierTrie,\n        draftCandidates: opts.draftCandidates,\n        promptSegments: opts.promptSegments,\n      };\n\n      if (isolation === 'process') {\n        const host = createLlmHost({ isolation: 'process', endpoint: this.processEndpoint });\n        await host.load(this.modelPath);\n        const out = await host.generate(chatMessages, genOpts);\n        return { text: out.text, model: this.model, provider: this.id };\n      }\n\n      // Warm path: reuse binding + session across turns.\n      if (!LocalLlamaProvider.warmBinding) {\n        const res = await this.ensure('node-llama-cpp@^3', { consent: this.consent, onUnavailable: () => {} });\n        if (!res.module) {\n          throw new Error(ensureUnavailableMessage(res.reason ?? 'no-consent', 'node-llama-cpp', res.detail));\n        }\n        LocalLlamaProvider.warmBinding = res.module;\n      }\n      evictIdleSessions(2);\n\n      // Prefer direct session API for metrics-rich generate.\n      const session = await acquireHostSession(LocalLlamaProvider.warmBinding, this.modelPath);\n      const report = await generateOnSession(session, chatMessages, genOpts);\n      // Real-ish usage for the panel meter. Never report draftAcceptedChars as\n      // tokens — that is a char count of a speculative draft, not model usage\n      // (it produced footers like \"56 tokens\" for multi-paragraph answers).\n      const promptTokens = report.kvPlan?.totalTokens;\n      const completionTokens = report.text ? Math.max(1, Math.ceil(report.text.length / 4)) : undefined;\n      return {\n        text: report.text,\n        model: this.model,\n        provider: this.id,\n        usage: {\n          ...(typeof promptTokens === 'number' && promptTokens > 0 ? { promptTokens } : {}),\n          ...(completionTokens != null ? { completionTokens } : {}),\n        },\n      };\n    } catch (e) {\n      // Fall back to EmbeddedLlmHost once if session path fails.\n      try {\n        if (LocalLlamaProvider.warmBinding) {\n          if (\n            !LocalLlamaProvider.warmHost ||\n            LocalLlamaProvider.warmPath !== this.modelPath\n          ) {\n            const host = createLlmHost({\n              isolation: 'embedded',\n              binding: LocalLlamaProvider.warmBinding,\n              preferGrammar: !!opts.grammar,\n            });\n            if (host instanceof EmbeddedLlmHost) {\n              LocalLlamaProvider.warmHost = host;\n              LocalLlamaProvider.warmPath = this.modelPath;\n              await host.load(this.modelPath);\n            }\n          }\n          if (LocalLlamaProvider.warmHost) {\n            const out = await LocalLlamaProvider.warmHost.generate(\n              messages.map((m) => ({\n                role: (m.role === 'tool' ? 'user' : m.role) as 'system' | 'user' | 'assistant',\n                content: m.content,\n              })),\n              {\n                temperature: opts.temperature ?? 0,\n                maxTokens: opts.maxTokens,\n                grammar: opts.grammar,\n                requireGrammar: opts.requireGrammar,\n                identifierTrie: opts.identifierTrie,\n                annotateUnknownIdentifiers: !!opts.identifierTrie,\n                draftCandidates: opts.draftCandidates,\n                promptSegments: opts.promptSegments,\n              },\n            );\n            return { text: out.text, model: this.model, provider: this.id };\n          }\n        }\n      } catch {\n        /* rethrow outer */\n      }\n      throw new Error(`local llama.cpp inference failed for ${this.modelPath} — ${redactSecrets((e as Error).message)}`);\n    }\n  }\n}\n"]}