@vibgrate/cli 2026.817.1 → 2026.817.2

package/dist/chunk-M7IO3DXH.js.map

@@ -0,0 +1 @@
+{"version":3,"sources":["../src/engine/refresh-scheduler.ts","../src/engine/watch-filter.ts","../src/mcp/server.ts","../src/engine/export.ts"],"names":["path2"],"mappings":";;;;;;;;;;;;;;AAkCO,IAAM,iBAAA,GAAoB,GAAA;AAE1B,IAAM,qBAAA,GAAwB,GAAA;AAE9B,IAAM,iBAAA,GAAoB,EAAA;AAM1B,IAAM,iBAAA,GAAoB,GAAA;AAE1B,IAAM,mBAAA,GAAsB,GAAA;AA2B5B,IAAM,mBAAN,MAAuB;AAAA,EAQ5B,YAA6B,IAAA,EAA+B;AAA/B,IAAA,IAAA,CAAA,IAAA,GAAA,IAAA;AAC3B,IAAA,IAAA,CAAK,WAAA,GAAc,KAAK,WAAA,IAAe,cAAA;AAAA,EACzC;AAAA,EAF6B,IAAA;AAAA,EAPrB,WAAA,GAAc,CAAA;AAAA,EACd,WAAA,GAAc,CAAA;AAAA,EACd,QAAA,GAAiC,IAAA;AAAA;AAAA,EAEjC,eAAA,GAAkB,iBAAA;AAAA,EACT,WAAA;AAAA;AAAA,EAOjB,IAAI,eAAA,GAA0B;AAC5B,IAAA,OAAO,IAAA,CAAK,IAAA,CAAK,eAAA,IAAmB,IAAA,CAAK,eAAA;AAAA,EAC3C;AAAA;AAAA,EAGA,IAAI,IAAA,GAAgB;AAClB,IAAA,OAAO,KAAK,QAAA,KAAa,IAAA;AAAA,EAC3B;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EASA,GAAA,GAAY;AACV,IAAA,IAAA,CAAK,WAAA,GAAc,CAAA;AACnB,IAAA,IAAA,CAAK,WAAA,GAAc,CAAA;AAAA,EACrB;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAOA,MAAM,YAAA,GAA8B;AAClC,IAAA,MAAM,GAAA,GAAM,KAAK,GAAA,EAAI;AACrB,IAAA,IAAI,CAAC,KAAK,QAAA,EAAU;AAClB,MAAA,IAAI,MAAM,IAAA,CAAK,WAAA,IAAe,MAAM,IAAA,CAAK,WAAA,GAAc,KAAK,eAAA,EAAiB;AAC7E,MAAA,IAAA,CAAK,WAAA,GAAc,GAAA;AACnB,MAAA,MAAM,SAAA,GACJ,OAAO,IAAA,CAAK,IAAA,CAAK,SAAA,KAAc,UAAA,GAAa,IAAA,CAAK,IAAA,CAAK,SAAA,EAAU,GAAI,IAAA,CAAK,IAAA,CAAK,SAAA;AAChF,MAAA,IAAA,CAAK,WAAW,IAAA,CAAK,WAAA,CAAY,IAAA,CAAK,IAAA,CAAK,MAAM,EAAE,SAAA,EAAW,MAAA,EAAQ,IAAA,CAAK,KAAK,MAAA,EAAQ,CAAA,CACrF,IAAA,CAAK,CAAC,OAAA,KAAY;AACjB,QAAA,IAAI,QAAQ,MAAA,KAAW,OAAA,OAAc,WAAA,GAAc,IAAA,CAAK,KAAI,GAAI,mBAAA;AAChE,QAAA,IAAA,CAAK,IAAA,CAAK,SAAS,GAAG,CAAA;AACtB,QAAA,IAAA,CAAK,IAAA,CAAK,SAAA,GAAY,OAAA,EAAS,GAAG,CAAA;AAAA,MACpC,CAAC,CAAA,CACA,KAAA,CAAM,MAAM;AACX,QAAA,IAAA,CAAK,WAAA,GAAc,IAAA,CAAK,GAAA,EAAI,GAAI,mBAAA;AAChC,QAAA,IAAA,CAAK,IAAA,CAAK,MAAM,GAAG,CAAA;AACnB,QAAA,IAAA,CAAK,IAAA,CAAK,SAAA,GAAY,IAAA,EAAM,GAAG,CAAA;AAAA,MACjC,CAAC,CAAA,CACA,OAAA,CAAQ,MAAM;AACb,QAAA,IAAA,CAAK,QAAA,GAAW,IAAA;AAAA,MAClB,CAAC,CAAA;AAAA,IACL;AACA,IAAA,MAAM,OAAA,CAAQ,IAAA,CAAK,CAAC,IAAA,CAAK,QAAA,EAAU,KAAA,CAAM,IAAA,CAAK,IAAA,CAAK,eAAA,IAAmB,iBAAiB,CAAC,CAAC,CAAA;AAAA,EAC3F;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAQQ,IAAA,CAAK,SAAgC,SAAA,EAAyB;AACpE,IAAA,MAAM,OAAA,GAAU,IAAA,CAAK,GAAA,EAAI,GAAI,SAAA;AAC7B,IAAA,MAAM,IAAA,GACJ,OAAA,EAAS,MAAA,KAAW,WAAA,IAAe,OAAO,OAAA,CAAQ,EAAA,KAAO,QAAA,GACrD,IAAA,CAAK,GAAA,CAAI,OAAA,CAAQ,EAAA,EAAI,OAAO,CAAA,GAC5B,OAAA;AACN,IAAA,IAAA,CAAK,kBAAkB,IAAA,CAAK,GAAA;AAAA,MAC1B,qBAAA;AAAA,MACA,IAAA,CAAK,GAAA,CAAI,iBAAA,EAAmB,IAAA,GAAO,iBAAiB;AAAA,KACtD;AAAA,EACF;AACF;AAEA,SAAS,MAAM,EAAA,EAA2B;AACxC,EAAA,OAAO,IAAI,OAAA,CAAQ,CAAC,OAAA,KAAY;AAC9B,IAAA,MAAM,KAAA,GAAQ,UAAA,CAAW,OAAA,EAAS,EAAE,CAAA;AACpC,IAAA,KAAA,CAAM,KAAA,IAAQ;AAAA,EAChB,CAAC,CAAA;AACH;ACxJO,IAAM,gBAAA,uBAAuB,GAAA,CAAI;AAAA,EACtC,MAAA;AAAA,EACA,cAAA;AAAA,EACA,WAAA;AAAA,EACA,MAAA;AAAA,EACA,OAAA;AAAA,EACA,KAAA;AAAA,EACA,UAAA;AAAA,EACA,OAAA;AAAA,EACA,QAAA;AAAA,EACA,aAAA;AAAA,EACA,OAAA;AAAA,EACA;AACF,CAAC,CAAA;AAGM,SAAS,iBAAiB,QAAA,EAA2B;AAC1D,EAAA,IAAI,QAAA,CAAS,KAAA,CAAW,IAAA,CAAA,GAAG,CAAA,CAAE,IAAA,CAAK,CAAC,CAAA,KAAM,gBAAA,CAAiB,GAAA,CAAI,CAAC,CAAC,CAAA,EAAG,OAAO,KAAA;AAC1E,EAAA,IAAI,QAAA,CAAS,QAAA,CAAS,CAAA,EAAQ,IAAA,CAAA,GAAG,CAAA,SAAA,EAAiB,IAAA,CAAA,GAAG,CAAA,CAAE,CAAA,IAAK,QAAA,CAAS,UAAA,CAAW,WAAW,CAAA,EAAG,OAAO,KAAA;AACrG,EAAA,OAAO,IAAA;AACT;;;ACwBA,IAAM,iBAAA,GAAoB,GAAA;AA2DnB,IAAM,cAAN,MAAkB;AAAA,EAkBvB,YACW,SAAA,EACQ,OAAA,GAAU,KAAA,EAEV,MAAA,GAA4B,EAAC,EAC9C;AAJS,IAAA,IAAA,CAAA,SAAA,GAAA,SAAA;AACQ,IAAA,IAAA,CAAA,OAAA,GAAA,OAAA;AAEA,IAAA,IAAA,CAAA,MAAA,GAAA,MAAA;AAIjB,IAAA,IAAA,CAAK,OAAO,MAAA,CAAO,IAAA,IAAaA,IAAA,CAAA,OAAA,CAAaA,IAAA,CAAA,OAAA,CAAQ,SAAS,CAAC,CAAA;AAC/D,IAAA,IAAA,CAAK,SAAA,GAAY,IAAI,gBAAA,CAAiB;AAAA,MACpC,MAAM,IAAA,CAAK,IAAA;AAAA,MACX,SAAA;AAAA,MACA,iBAAiB,MAAA,CAAO,eAAA;AAAA,MACxB,iBAAiB,MAAA,CAAO,eAAA;AAAA,MACxB,aAAa,MAAA,CAAO,WAAA;AAAA,MACpB,WAAW,CAAC,OAAA,EAAS,cAAc,IAAA,CAAK,gBAAA,CAAiB,SAAS,SAAS;AAAA,KAC5E,CAAA;AAAA,EACH;AAAA,EAhBW,SAAA;AAAA,EACQ,OAAA;AAAA,EAEA,MAAA;AAAA,EArBX,aAAA,GAAgB,EAAA;AAAA,EAChB,MAAA,GAAyB,IAAA;AAAA;AAAA,EAExB,IAAA;AAAA;AAAA,EAEQ,SAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAQA,cAAA,uBAAqB,GAAA,EAAoB;AAAA,EAClD,OAAA,GAA+B,IAAA;AAAA,EAC/B,UAAA,GAAmD,IAAA;AAAA;AAAA,EAsB3D,MAAM,GAAA,GAAwB;AAC5B,IAAA,IAAI,IAAA,CAAK,OAAA,EAAS,MAAM,IAAA,CAAK,YAAA,EAAa;AAG1C,IAAA,MAAM,IAAA,GAAO,WAAA,CAAY,IAAA,CAAK,SAAS,CAAA;AACvC,IAAA,IAAI,KAAK,OAAA,KAAY,IAAA,CAAK,aAAA,IAAiB,CAAC,KAAK,MAAA,EAAQ;AAEvD,MAAA,MAAM,SAAA,GAAY,oBAAA,CAAqB,IAAA,CAAK,IAAA,EAAM,KAAK,SAAS,CAAA;AAChE,MAAA,IAAA,CAAK,MAAA,GAAS,YACV,SAAA,CAAU,KAAA,GACV,WAAc,EAAA,CAAA,YAAA,CAAa,IAAA,CAAK,SAAA,EAAW,MAAM,CAAC,CAAA;AACtD,MAAA,IAAA,CAAK,gBAAgB,IAAA,CAAK,OAAA;AAAA,IAC5B;AACA,IAAA,OAAO,IAAA,CAAK,MAAA;AAAA,EACd;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAOQ,YAAA,GAA8B;AACpC,IAAA,OAAO,IAAA,CAAK,UAAU,YAAA,EAAa;AAAA,EACrC;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAQQ,gBAAA,CAAiB,SAAgC,SAAA,EAAyB;AAChF,IAAA,IAAI,OAAA,EAAS,MAAA,KAAW,OAAA,IAAW,OAAA,EAAS,WAAW,WAAA,EAAa;AACpE,IAAA,KAAA,MAAW,CAAC,IAAA,EAAM,MAAM,CAAA,IAAK,KAAK,cAAA,EAAgB;AAChD,MAAA,IAAI,MAAA,IAAU,SAAA,EAAW,IAAA,CAAK,cAAA,CAAe,OAAO,IAAI,CAAA;AAAA,IAC1D;AAAA,EACF;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAQA,kBAAkB,QAAA,EAAwB;AACxC,IAAA,IAAA,CAAK,cAAA,CAAe,GAAA,CAAI,QAAA,EAAU,IAAA,CAAK,KAAK,CAAA;AAC5C,IAAA,IAAA,CAAK,UAAU,GAAA,EAAI;AACnB,IAAA,IAAI,CAAC,KAAK,OAAA,EAAS;AACnB,IAAA,IAAI,IAAA,CAAK,UAAA,EAAY,YAAA,CAAa,IAAA,CAAK,UAAU,CAAA;AACjD,IAAA,IAAA,CAAK,UAAA,GAAa,WAAW,MAAM;AACjC,MAAA,IAAA,CAAK,UAAA,GAAa,IAAA;AAClB,MAAA,KAAK,KAAK,YAAA,EAAa;AAAA,IACzB,GAAG,iBAAiB,CAAA;AACpB,IAAA,IAAA,CAAK,WAAW,KAAA,IAAQ;AAAA,EAC1B;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EASA,aAAA,GAAyB;AACvB,IAAA,IAAI,IAAA,CAAK,SAAS,OAAO,IAAA;AACzB,IAAA,IAAI;AACF,MAAA,IAAA,CAAK,OAAA,GAAa,EAAA,CAAA,KAAA,CAAM,IAAA,CAAK,IAAA,EAAM,EAAE,WAAW,IAAA,EAAK,EAAG,CAAC,MAAA,EAAQ,QAAA,KAAa;AAC5E,QAAA,IAAI,CAAC,QAAA,EAAU;AACf,QAAA,IAAI,CAAC,gBAAA,CAAiB,QAAQ,CAAA,EAAG;AACjC,QAAA,IAAA,CAAK,kBAAkB,QAAQ,CAAA;AAAA,MACjC,CAAC,CAAA;AACD,MAAA,IAAA,CAAK,QAAQ,KAAA,IAAQ;AACrB,MAAA,OAAO,IAAA;AAAA,IACT,CAAA,CAAA,MAAQ;AACN,MAAA,IAAA,CAAK,OAAA,GAAU,IAAA;AACf,MAAA,OAAO,KAAA;AAAA,IACT;AAAA,EACF;AAAA,EAEA,YAAA,GAAqB;AACnB,IAAA,IAAA,CAAK,SAAS,KAAA,EAAM;AACpB,IAAA,IAAA,CAAK,OAAA,GAAU,IAAA;AACf,IAAA,IAAI,IAAA,CAAK,UAAA,EAAY,YAAA,CAAa,IAAA,CAAK,UAAU,CAAA;AACjD,IAAA,IAAA,CAAK,UAAA,GAAa,IAAA;AAAA,EACpB;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAOA,aAAA,GAA+B;AAC7B,IAAA,MAAM,CAAA,GAAI,KAAK,cAAA,CAAe,IAAA;AAC9B,IAAA,IAAI,CAAA,KAAM,GAAG,OAAO,IAAA;AACpB,IAAA,MAAM,KAAA,GAAQ,CAAC,GAAG,IAAA,CAAK,cAAA,CAAe,IAAA,EAAM,CAAA,CAAE,IAAA,EAAK,CAAE,KAAA,CAAM,CAAA,EAAG,CAAC,CAAA;AAC/D,IAAA,MAAM,IAAA,GAAO,IAAI,KAAA,CAAM,MAAA,GAAS,MAAM,CAAA,GAAI,KAAA,CAAM,MAAM,CAAA,KAAA,CAAA,GAAU,EAAA;AAChE,IAAA,OAAO,CAAA,eAAA,EAAkB,CAAC,CAAA,yCAAA,EAA4C,KAAA,CAAM,KAAK,IAAI,CAAC,GAAG,IAAI,CAAA,gEAAA,CAAA;AAAA,EAC/F;AACF;AAEO,SAAS,YAAA,CAAa,MAAA,EAAqB,IAAA,GAAqB,EAAC,EAAW;AACjF,EAAA,MAAM,EAAE,OAAA,GAAU,KAAA,EAAO,UAAA,GAAa,KAAA,EAAO,QAAQ,KAAA,EAAO,KAAA,GAAQ,KAAA,EAAO,KAAA,EAAM,GAAI,IAAA;AAGrF,EAAA,MAAM,SAAS,OAAA,IAAW,UAAA;AAE1B,EAAA,MAAM,IAAA,GAAO,IAAA,CAAK,IAAA,IAAQ,MAAA,CAAO,IAAA;AAMjC,EAAA,MAAM,IAAA,uBAAW,GAAA,EAAY;AAC7B,EAAA,MAAM,SAAS,IAAI,MAAA;AAAA,IACjB,EAAE,IAAA,EAAM,IAAA,EAAM,OAAA,EAAS,OAAA,EAAQ;AAAA,IAC/B;AAAA,MACE,YAAA,EAAc,EAAE,KAAA,EAAO,EAAC,EAAE;AAAA;AAAA;AAAA;AAAA,MAI1B,YAAA,EACE;AAAA;AAoBJ,GACF;AAEA,EAAA,MAAA,CAAO,iBAAA,CAAkB,wBAAwB,YAAY;AAC3D,IAAA,MAAM,SAAS,IAAI,GAAA,CAAI,eAAA,CAAgB,IAAA,CAAK,WAAW,CAAC,CAAA;AAIxD,IAAA,IAAI,MAAA,GAAS,EAAA;AACb,IAAA,IAAI;AACF,MAAA,MAAM,KAAA,GAAQ,MAAM,MAAA,CAAO,GAAA,EAAI;AAC/B,MAAA,MAAA,GAAS,YAAA,CAAa,IAAI,GAAA,CAAI,KAAA,CAAM,KAAA,CAAM,GAAA,CAAI,CAAC,CAAA,KAAM,CAAA,CAAE,IAAI,CAAC,CAAA,CAAE,IAAI,CAAA;AAAA,IACpE,CAAA,CAAA,MAAQ;AAAA,IAER;AACA,IAAA,OAAO;AAAA,MACL,KAAA,EAAO,KAAA,CAAM,MAAA,CAAO,CAAC,CAAA,KAAM,MAAA,CAAO,GAAA,CAAI,CAAA,CAAE,IAAI,CAAC,CAAA,CAAE,GAAA,CAAI,CAAC,CAAA,MAAO;AAAA,QACzD,MAAM,CAAA,CAAE,IAAA;AAAA,QACR,WAAA,EAAa,CAAA,CAAE,IAAA,KAAS,QAAA,IAAY,MAAA,GAAS,CAAA,EAAG,CAAA,CAAE,WAAW,CAAA,EAAG,MAAM,CAAA,CAAA,GAAK,CAAA,CAAE,WAAA;AAAA,QAC7E,aAAa,CAAA,CAAE,WAAA;AAAA,QACf,WAAA,EAAa,EAAE,YAAA,EAAc,IAAA,EAAM,eAAe,KAAA;AAAM,OAC1D,CAAE;AAAA,KACJ;AAAA,EACF,CAAC,CAAA;AAED,EAAA,MAAA,CAAO,iBAAA,CAAkB,qBAAA,EAAuB,OAAO,OAAA,KAAY;AACjE,IAAA,MAAM,IAAA,GAAO,MAAM,IAAA,CAAK,CAAC,MAAM,CAAA,CAAE,IAAA,KAAS,OAAA,CAAQ,MAAA,CAAO,IAAI,CAAA;AAC7D,IAAA,IAAI,CAAC,IAAA,EAAM;AACT,MAAA,OAAO,WAAA,CAAY,CAAA,cAAA,EAAiB,OAAA,CAAQ,MAAA,CAAO,IAAI,CAAA,CAAA,CAAG,CAAA;AAAA,IAC5D;AACA,IAAA,IAAI,KAAA;AACJ,IAAA,IAAI;AACF,MAAA,KAAA,GAAQ,MAAM,OAAO,GAAA,EAAI;AAAA,IAC3B,CAAA,CAAA,MAAQ;AACN,MAAA,OAAO,WAAA;AAAA,QACL;AAAA,OACF;AAAA,IACF;AACA,IAAA,MAAM,SAAA,GAAY,KAAK,GAAA,EAAI;AAC3B,IAAA,IAAI;AACF,MAAA,MAAM,IAAA,GAAQ,OAAA,CAAQ,MAAA,CAAO,SAAA,IAAa,EAAC;AAC3C,MAAA,MAAM,MAAA,GAAS,MAAM,IAAA,CAAK,OAAA,CAAQ,OAAO,IAAA,EAAM,EAAE,IAAA,EAAM,KAAA,EAAO,KAAA,EAAO,IAAA,EAAM,SAAA,EAAW,MAAA,CAAO,WAAW,CAAA;AACxG,MAAA,MAAM,EAAA,GAAK,IAAA,CAAK,GAAA,EAAI,GAAI,SAAA;AAGxB,MAAA,KAAA,EAAO,MAAA,CAAO,EAAE,GAAG,WAAA,CAAY,KAAK,IAAA,EAAM,MAAM,CAAA,EAAG,MAAA,EAAQ,eAAe,YAAA,CAAa,MAAM,CAAC,CAAA,EAAG,IAAI,CAAA;AAKrG,MAAA,IAAI,MAAA,cAAoB,IAAA,EAAM,IAAA,CAAK,MAAM,MAAA,EAAQ,YAAA,CAAa,MAAM,CAAA,EAAG,EAAE,CAAA;AAEzE,MAAA,MAAM,QAAA,GAAW,iBAAiB,MAAM,CAAA;AAKxC,MAAA,MAAM,SAAA,GAAY,OAAO,aAAA,EAAc;AACvC,MAAA,IAAI,WAAW,QAAA,CAAS,OAAA,GAAU,CAAC,GAAI,SAAS,OAAA,IAAW,EAAC,EAAI,EAAE,MAAM,MAAA,EAAQ,IAAA,EAAM,CAAA,CAAA,EAAI,SAAS,KAAK,CAAA;AACxG,MAAA,OAAO,QAAA;AAAA,IACT,SAAS,GAAA,EAAK;AAGZ,MAAA,KAAA,EAAO,MAAA,CAAO;AAAA,QACZ,MAAM,IAAA,CAAK,IAAA;AAAA,QACX,MAAA,EAAQ,cAAA,CAAe,YAAA,CAAa,MAAM,CAAC,CAAA;AAAA,QAC3C,OAAA,EAAS,MAAA;AAAA,QACT,EAAA,EAAI,IAAA,CAAK,GAAA,EAAI,GAAI,SAAA;AAAA,QACjB,QAAA,EAAU,CAAA;AAAA,QACV,cAAA,EAAgB;AAAA,OACjB,CAAA;AACD,MAAA,OAAO,YAAY,CAAA,MAAA,EAAS,IAAA,CAAK,IAAI,CAAA,UAAA,EAAc,GAAA,CAAc,OAAO,CAAA,CAAE,CAAA;AAAA,IAC5E;AAAA,EACF,CAAC,CAAA;AAED,EAAA,OAAO,MAAA;AACT;AAEA,eAAsB,UAAA,CAAW,SAAA,EAAmB,IAAA,GAAqB,EAAC,EAAkB;AAC1F,EAAA,MAAM,MAAA,GAAS,IAAI,WAAA,CAAY,SAAA,EAAW,IAAA,CAAK,OAAA,KAAY,KAAA,EAAO,EAAE,IAAA,EAAM,IAAA,CAAK,IAAA,EAAM,CAAA;AACrF,EAAA,IAAI,KAAK,OAAA,KAAY,KAAA,IAAS,KAAK,KAAA,KAAU,KAAA,SAAc,aAAA,EAAc;AACzE,EAAA,MAAM,MAAA,GAAS,YAAA,CAAa,MAAA,EAAQ,IAAI,CAAA;AAIxC,EAAA,wBAAA,CAAyB,KAAK,KAAK,CAAA;AACnC,EAAA,MAAM,MAAA,CAAO,OAAA,CAAQ,IAAI,oBAAA,EAAsB,CAAA;AACjD;AAeO,SAAS,WAAA,CAAY,IAAA,EAAc,IAAA,EAAc,MAAA,EAAiB,QAAiB,EAAA,EAAmB;AAC3G,EAAA,YAAA;AAAA,IACE,IAAA;AAAA,IACA,EAAE,GAAG,WAAA,CAAY,MAAM,MAAM,CAAA,EAAG,QAAQ,KAAA,EAAO,MAAA,EAAQ,eAAe,MAAM,CAAA,EAAG,GAAI,EAAA,KAAO,MAAA,GAAY,EAAE,EAAA,EAAG,GAAI,EAAC,EAAG;AAAA,IACnH,KAAK,GAAA;AAAI,GACX;AACF;AAOA,SAAS,WAAA,CAAY,MAAc,MAAA,EAA+F;AAChI,EAAA,MAAM,OAAA,GAAU,gBAAgB,MAAM,CAAA;AACtC,EAAA,IAAI,QAAA,GAAW,CAAA;AACf,EAAA,IAAI,cAAA,GAAiB,CAAA;AACrB,EAAA,IAAI,cAAc,GAAA,CAAI,IAAI,KAAK,MAAA,IAAU,OAAO,WAAW,QAAA,EAAU;AACnE,IAAA,QAAA,GAAW,WAAA,CAAY,YAAA,CAAa,gBAAA,CAAiB,MAAM,CAAC,CAAC,CAAA;AAK7D,IAAA,cAAA,GAAiB,eAAA,CAAgB,MAAM,CAAA,CAAE,IAAA,GAAO,eAAA;AAAA,EAClD;AACA,EAAA,OAAO,EAAE,IAAA,EAAM,OAAA,EAAS,QAAA,EAAU,cAAA,EAAe;AACnD;AAQA,SAAS,aAAa,MAAA,EAAoC;AACxD,EAAA,IAAI;AACF,IAAA,MAAM,IAAA,GAAQ,OAAsE,gBAAA,IAAmB;AACvG,IAAA,OAAO,OAAO,IAAA,EAAM,IAAA,KAAS,QAAA,GAAW,KAAK,IAAA,GAAO,KAAA,CAAA;AAAA,EACtD,CAAA,CAAA,MAAQ;AACN,IAAA,OAAO,MAAA;AAAA,EACT;AACF;AAUA,SAAS,gBAAgB,MAAA,EAA0B;AACjD,EAAA,IAAI,KAAA,CAAM,QAAQ,MAAM,CAAA,SAAU,MAAA,CAAO,MAAA,KAAW,IAAI,MAAA,GAAS,UAAA;AACjE,EAAA,IAAI,CAAC,MAAA,IAAU,OAAO,MAAA,KAAW,UAAU,OAAO,MAAA;AAClD,EAAA,MAAM,CAAA,GAAI,MAAA;AACV,EAAA,IAAI,OAAO,CAAA,CAAE,KAAA,KAAU,QAAA,IAAY,CAAA,CAAE,OAAO,OAAO,MAAA;AACnD,EAAA,IAAI,CAAA,CAAE,SAAA,KAAc,KAAA,EAAO,OAAO,MAAA;AAClC,EAAA,IAAI,KAAA,CAAM,QAAQ,CAAA,CAAE,OAAO,KAAK,CAAA,CAAE,OAAA,CAAQ,MAAA,KAAW,CAAA,EAAG,OAAO,MAAA;AAC/D,EAAA,OAAO,SAAA,CAAU,CAAC,CAAA,GAAI,SAAA,GAAY,UAAA;AACpC;AAGA,SAAS,UAAU,CAAA,EAAqC;AACtD,EAAA,IAAI,CAAA,CAAE,aAAA,KAAkB,IAAA,EAAM,OAAO,IAAA;AACrC,EAAA,IAAI,EAAE,UAAA,IAAc,OAAO,CAAA,CAAE,UAAA,KAAe,UAAU,OAAO,IAAA;AAG7D,EAAA,KAAA,MAAW,CAAC,GAAA,EAAK,KAAK,KAAK,MAAA,CAAO,OAAA,CAAQ,CAAC,CAAA,EAAG;AAC5C,IAAA,IAAI,OAAO,KAAA,KAAU,QAAA,IAAY,CAAC,GAAA,CAAI,QAAA,CAAS,OAAO,CAAA,EAAG;AACzD,IAAA,MAAM,OAAO,GAAA,CAAI,KAAA,CAAM,CAAA,EAAG,CAAC,QAAQ,MAAM,CAAA;AACzC,IAAA,MAAM,KAAA,GAAQ,KAAA,CAAM,OAAA,CAAQ,CAAA,CAAE,IAAI,CAAC,CAAA,GAAK,CAAA,CAAE,IAAI,CAAA,CAAgB,MAAA,GAAS,CAAA;AACvE,IAAA,IAAI,KAAA,GAAQ,OAAO,OAAO,IAAA;AAAA,EAC5B;AACA,EAAA,OAAO,KAAA;AACT;AAGA,SAAS,aAAa,QAAA,EAAkC;AACtD,EAAA,MAAM,KAAA,GAAQ,SAAS,OAAA,EAAS,IAAA,CAAK,CAAC,CAAA,KAAM,CAAA,CAAE,SAAS,MAAM,CAAA;AAC7D,EAAA,OAAO,KAAA,IAAS,UAAU,KAAA,IAAS,OAAO,MAAM,IAAA,KAAS,QAAA,GAAW,MAAM,IAAA,GAAO,EAAA;AACnF;AAGA,SAAS,gBAAgB,MAAA,EAA8B;AACrD,EAAA,MAAM,CAAA,GAAI,MAAA;AACV,EAAA,MAAM,KAAA,uBAAY,GAAA,EAAY;AAC9B,EAAA,IAAI,OAAO,EAAE,IAAA,KAAS,QAAA,IAAY,EAAE,IAAA,EAAM,KAAA,CAAM,GAAA,CAAI,CAAA,CAAE,IAAI,CAAA;AAC1D,EAAA,KAAA,MAAW,CAAA,IAAK,OAAA,CAAQ,CAAA,CAAE,OAAO,CAAA,EAAG;AAClC,IAAA,MAAM,IAAK,CAAA,CAAyB,IAAA;AACpC,IAAA,IAAI,OAAO,CAAA,KAAM,QAAA,IAAY,CAAA,EAAG,KAAA,CAAM,IAAI,CAAC,CAAA;AAAA,EAC7C;AAGA,EAAA,KAAA,MAAW,IAAA,IAAQ,CAAC,GAAG,OAAA,CAAQ,CAAA,CAAE,KAAK,CAAA,EAAG,GAAG,OAAA,CAAQ,CAAA,CAAE,QAAQ,CAAC,CAAA,EAAG;AAChE,IAAA,IAAI,OAAO,SAAS,QAAA,EAAU;AAC9B,IAAA,MAAM,CAAA,GAAI,IAAA,CAAK,OAAA,CAAQ,GAAG,CAAA;AAC1B,IAAA,IAAI,CAAA,GAAI,GAAG,KAAA,CAAM,GAAA,CAAI,KAAK,KAAA,CAAM,CAAA,EAAG,CAAC,CAAC,CAAA;AAAA,EACvC;AACA,EAAA,OAAO,KAAA;AACT;AAEA,SAAS,QAAQ,CAAA,EAAuB;AACtC,EAAA,OAAO,KAAA,CAAM,OAAA,CAAQ,CAAC,CAAA,GAAI,IAAI,EAAC;AACjC;AAEA,SAAS,YAAY,OAAA,EAAiB;AACpC,EAAA,OAAO,EAAE,OAAA,EAAS,CAAC,EAAE,IAAA,EAAM,MAAA,EAAQ,IAAA,EAAM,OAAA,EAAS,CAAA,EAAG,OAAA,EAAS,IAAA,EAAK;AACrE;;;AC5eO,IAAM,kBAAA,GAAqB,GAAA;AAqB3B,SAAS,aAAa,GAAA,EAAkC;AAC7D,EAAA,QAAQ,GAAA,CAAI,aAAY;AAAG,IACzB,KAAK,OAAA;AACH,MAAA,OAAO,MAAA;AAAA,IACT,KAAK,SAAA;AACH,MAAA,OAAO,QAAA;AAAA,IACT,KAAK,UAAA;AACH,MAAA,OAAO,SAAA;AAAA,IACT,KAAK,MAAA;AAAA,IACL,KAAK,KAAA;AACH,MAAA,OAAO,KAAA;AAAA,IACT,KAAK,SAAA;AACH,MAAA,OAAO,QAAA;AAAA,IACT,KAAK,MAAA;AACH,MAAA,OAAO,KAAA;AAAA,IACT,KAAK,KAAA;AACH,MAAA,OAAO,IAAA;AAAA,IACT,KAAK,OAAA;AACH,MAAA,OAAO,MAAA;AAAA,IACT;AACE,MAAA,OAAO,IAAA;AAAA;AAEb;AAaO,SAAS,WAAA,CAAY,QAAsB,GAAA,EAA4B;AAC5E,EAAA,MAAM,QAAQ,GAAA,CAAI,IAAA,GAAO,mBAAmB,GAAA,CAAI,KAAK,IAAI,GAAA,CAAI,KAAA;AAC7D,EAAA,MAAM,OAAA,GACJ,GAAA,CAAI,OAAA,KAAY,IAAA,IACf,GAAA,CAAI,OAAA,KAAY,KAAA,IAAS,MAAA,KAAW,MAAA,IAAU,KAAA,CAAM,IAAA,CAAK,MAAA,CAAO,KAAA,GAAQ,kBAAA;AAE3E,EAAA,QAAQ,MAAA;AAAQ,IACd,KAAK,MAAA;AACH,MAAA,OAAO,cAAA,CAAe,KAAA,EAAO,EAAE,OAAA,EAAS,CAAA;AAAA,IAC1C,KAAK,IAAA;AACH,MAAA,OAAO,aAAa,KAAK,CAAA;AAAA,IAC3B,KAAK,MAAA;AACH,MAAA,OAAO,WAAW,KAAK,CAAA;AAAA,IACzB,KAAK,QAAA;AACH,MAAA,OAAO,OAAO,KAAK,CAAA;AAAA,IACrB,KAAK,SAAA;AACH,MAAA,OAAO,QAAQ,KAAK,CAAA;AAAA,IACtB,KAAK,KAAA;AACH,MAAA,OAAO,IAAI,KAAK,CAAA;AAAA,IAClB,KAAK,QAAA;AACH,MAAA,OAAO,OAAO,KAAK,CAAA;AAAA,IACrB,KAAK,KAAA;AACH,MAAA,OAAO,GAAA,CAAI,EAAE,GAAG,GAAA,EAAK,OAAO,CAAA;AAAA,IAC9B,KAAK,WAAA;AACH,MAAA,OAAO,SAAA,CAAU,EAAE,GAAG,GAAA,EAAK,OAAO,CAAA;AAAA,IACpC,KAAK,MAAA;AACH,MAAA,OAAO,IAAA,CAAK,EAAE,GAAG,GAAA,EAAK,OAAO,CAAA;AAAA;AAEnC;AAEA,SAAS,OAAO,KAAA,EAAwB;AAEtC,EAAA,MAAM,IAAA,GAAO,MAAM,KAAA,IAAS,KAAA,CAAM,MAAM,MAAA,GAAS,KAAA,CAAM,QAAQ,KAAA,CAAM,KAAA;AACrE,EAAA,OAAO,IAAA,CAAK,GAAA,CAAI,CAAC,CAAA,KAAM,IAAA,CAAK,SAAA,CAAU,CAAC,CAAC,CAAA,CAAE,IAAA,CAAK,IAAI,CAAA,GAAI,IAAA;AACzD;AAEA,SAAS,IAAI,CAAA,EAAmB;AAC9B,EAAA,OAAO,CAAA,CAAE,OAAA,CAAQ,IAAA,EAAM,OAAO,EAAE,OAAA,CAAQ,IAAA,EAAM,MAAM,CAAA,CAAE,QAAQ,IAAA,EAAM,MAAM,CAAA,CAAE,OAAA,CAAQ,MAAM,QAAQ,CAAA;AACpG;AAEA,SAAS,QAAQ,KAAA,EAAwB;AACvC,EAAA,MAAM,QAAkB,EAAC;AACzB,EAAA,KAAA,CAAM,KAAK,wCAAwC,CAAA;AACnD,EAAA,KAAA,CAAM,KAAK,yDAAyD,CAAA;AACpE,EAAA,KAAA,CAAM,KAAK,mEAAmE,CAAA;AAC9E,EAAA,KAAA,CAAM,KAAK,mEAAmE,CAAA;AAC9E,EAAA,KAAA,CAAM,KAAK,mEAAmE,CAAA;AAC9E,EAAA,KAAA,CAAM,KAAK,oEAAoE,CAAA;AAC/E,EAAA,KAAA,CAAM,KAAK,kCAAkC,CAAA;AAC7C,EAAA,KAAA,MAAW,CAAA,IAAK,MAAM,KAAA,EAAO;AAC3B,IAAA,KAAA,CAAM,IAAA,CAAK,iBAAiB,GAAA,CAAI,CAAA,CAAE,EAAE,CAAC,CAAA,mBAAA,EAAsB,IAAI,CAAA,CAAE,aAAa,CAAC,CAAA,wBAAA,EAA2B,GAAA,CAAI,EAAE,IAAI,CAAC,2BAA2B,GAAA,CAAI,CAAA,CAAE,IAAI,CAAC,CAAA,cAAA,CAAgB,CAAA;AAAA,EAC7K;AACA,EAAA,KAAA,MAAW,CAAA,IAAK,MAAM,KAAA,EAAO;AAC3B,IAAA,KAAA,CAAM,KAAK,CAAA,kBAAA,EAAqB,GAAA,CAAI,CAAA,CAAE,GAAG,CAAC,CAAA,UAAA,EAAa,GAAA,CAAI,CAAA,CAAE,GAAG,CAAC,CAAA,oBAAA,EAAuB,GAAA,CAAI,CAAA,CAAE,IAAI,CAAC,CAAA,cAAA,CAAgB,CAAA;AAAA,EACrH;AACA,EAAA,KAAA,CAAM,KAAK,YAAY,CAAA;AACvB,EAAA,KAAA,CAAM,KAAK,YAAY,CAAA;AACvB,EAAA,OAAO,KAAA,CAAM,IAAA,CAAK,IAAI,CAAA,GAAI,IAAA;AAC5B;AAEA,SAAS,IAAI,KAAA,EAAwB;AACnC,EAAA,MAAM,KAAA,GAAkB,CAAC,cAAc,CAAA;AACvC,EAAA,KAAA,MAAW,CAAA,IAAK,KAAA,CAAM,KAAA,EAAO,KAAA,CAAM,IAAA,CAAK,CAAA,GAAA,EAAM,CAAA,CAAE,EAAE,CAAA,UAAA,EAAa,MAAA,CAAO,CAAA,CAAE,aAAa,CAAC,CAAA,GAAA,CAAK,CAAA;AAC3F,EAAA,KAAA,MAAW,CAAA,IAAK,KAAA,CAAM,KAAA,EAAO,KAAA,CAAM,KAAK,CAAA,GAAA,EAAM,CAAA,CAAE,GAAG,CAAA,MAAA,EAAS,CAAA,CAAE,GAAG,CAAA,UAAA,EAAa,CAAA,CAAE,IAAI,CAAA,GAAA,CAAK,CAAA;AACzF,EAAA,KAAA,CAAM,KAAK,GAAG,CAAA;AACd,EAAA,OAAO,KAAA,CAAM,IAAA,CAAK,IAAI,CAAA,GAAI,IAAA;AAC5B;AACA,SAAS,OAAO,CAAA,EAAmB;AACjC,EAAA,OAAO,CAAA,CAAE,OAAA,CAAQ,IAAA,EAAM,KAAK,CAAA;AAC9B;AAEA,SAAS,OAAO,KAAA,EAAwB;AACtC,EAAA,MAAM,QAAkB,EAAC;AACzB,EAAA,KAAA,MAAW,CAAA,IAAK,MAAM,KAAA,EAAO;AAC3B,IAAA,KAAA,CAAM,IAAA;AAAA,MACJ,cAAc,WAAA,CAAY,CAAA,CAAE,IAAI,CAAC,CAAA,OAAA,EAAU,EAAE,CAAA,CAAE,EAAE,CAAC,CAAA,OAAA,EAAU,CAAA,CAAE,EAAE,aAAa,CAAC,UAAU,CAAA,CAAE,CAAA,CAAE,IAAI,CAAC,CAAA,GAAA;AAAA,KACnG;AAAA,EACF;AACA,EAAA,KAAA,MAAW,CAAA,IAAK,MAAM,KAAA,EAAO;AAC3B,IAAA,KAAA,CAAM,IAAA;AAAA,MACJ,CAAA,aAAA,EAAgB,CAAA,CAAE,CAAA,CAAE,GAAG,CAAC,CAAA,UAAA,EAAa,CAAA,CAAE,CAAA,CAAE,GAAG,CAAC,CAAA,kBAAA,EAAqB,WAAA,CAAY,CAAA,CAAE,IAAI,CAAC,CAAA,SAAA;AAAA,KACvF;AAAA,EACF;AACA,EAAA,OAAO,KAAA,CAAM,IAAA,CAAK,IAAI,CAAA,GAAI,IAAA;AAC5B;AACA,SAAS,YAAY,CAAA,EAAmB;AACtC,EAAA,OAAO,CAAA,CAAE,OAAA,CAAQ,gBAAA,EAAkB,GAAG,CAAA;AACxC;AACA,SAAS,EAAE,CAAA,EAAmB;AAC5B,EAAA,OAAO,IAAA,CAAK,UAAU,CAAC,CAAA;AACzB;AAaA,SAAS,IAAI,GAAA,EAA4B;AACvC,EAAA,MAAM,QAAQ,GAAA,CAAI,KAAA;AAClB,EAAA,MAAM,QAAkB,EAAC;AACzB,EAAA,KAAA,CAAM,KAAK,QAAQ,CAAA;AAGnB,EAAA,KAAA,CAAM,KAAK,qEAAqE,CAAA;AAChF,EAAA,MAAM,IAAA,GAAkC;AAAA,IACtC,CAAC,eAAA,EAAiB,KAAA,CAAM,aAAa,CAAA;AAAA,IACrC,CAAC,aAAA,EAAe,GAAA,CAAI,WAAW,CAAA;AAAA,IAC/B,CAAC,YAAA,EAAc,KAAA,CAAM,UAAA,CAAW,UAAU,CAAA;AAAA,IAC1C,CAAC,MAAA,EAAQ,KAAA,CAAM,UAAA,CAAW,IAAI,CAAA;AAAA,IAC9B,CAAC,aAAA,EAAe,KAAA,CAAM,UAAA,CAAW,OAAO,CAAA;AAAA,IACxC,CAAC,UAAA,EAAY,KAAA,CAAM,WAAW,QAAA,CAAS,IAAA,CAAK,GAAG,CAAC,CAAA;AAAA,IAChD,CAAC,aAAA,EAAe,KAAA,CAAM,UAAA,CAAW,SAAA,EAAW,eAAe,IAAI;AAAA,GACjE;AACA,EAAA,KAAA,MAAW,CAAC,CAAA,EAAG,CAAC,CAAA,IAAK,MAAM,KAAA,CAAM,IAAA,CAAK,CAAA,yBAAA,EAA4B,MAAA,CAAO,CAAC,CAAC,CAAA,EAAA,EAAK,MAAA,CAAO,CAAC,CAAC,CAAA,EAAA,CAAI,CAAA;AAG7F,EAAA,KAAA,CAAM,IAAA;AAAA,IACJ;AAAA,GACF;AACA,EAAA,KAAA,MAAW,CAAA,IAAK,MAAM,KAAA,EAAO;AAC3B,IAAA,KAAA,CAAM,IAAA;AAAA,MACJ,6BAA6B,MAAA,CAAO,CAAA,CAAE,EAAE,CAAC,KAAK,MAAA,CAAO,CAAA,CAAE,IAAI,CAAC,KAAK,MAAA,CAAO,CAAA,CAAE,IAAI,CAAC,KAAK,MAAA,CAAO,CAAA,CAAE,aAAa,CAAC,KAAK,MAAA,CAAO,CAAA,CAAE,IAAI,CAAC,KAAK,MAAA,CAAO,CAAA,CAAE,IAAA,CAAK,KAAK,CAAC,CAAA,EAAA,EAAK,MAAA,CAAO,CAAA,CAAE,IAAA,CAAK,GAAG,CAAC,CAAA,EAAA,EAAK,MAAA,CAAO,CAAA,CAAE,IAAI,CAAC,CAAA,EAAA,EAAK,MAAA,CAAO,CAAA,CAAE,UAAU,CAAC,CAAA,EAAA,EAAK,MAAA,CAAO,CAAA,CAAE,SAAS,CAAC,CAAA,EAAA,EAAK,MAAA,CAAO,CAAA,CAAE,UAAU,CAAC,CAAA,EAAA,EAAK,MAAA,CAAO,CAAA,CAAE,IAAI,CAAC,CAAA,EAAA,EAAK,OAAA,CAAQ,CAAA,CAAE,KAAK,CAAC,CAAA,EAAA,EAAK,OAAA,CAAQ,CAAA,CAAE,MAAM,CAAC,CAAA,EAAA,EAAK,MAAA,CAAO,CAAA,CAAE,QAAQ,CAAC,CAAA,EAAA;AAAA,KAClW;AAAA,EACF;AAGA,EAAA,KAAA,CAAM,IAAA;AAAA,IACJ;AAAA,GACF;AACA,EAAA,KAAA,MAAW,CAAA,IAAK,MAAM,KAAA,EAAO;AAC3B,IAAA,KAAA,CAAM,IAAA;AAAA,MACJ,CAAA,0BAAA,EAA6B,OAAO,CAAA,CAAE,EAAE,CAAC,CAAA,EAAA,EAAK,MAAA,CAAO,EAAE,IAAI,CAAC,KAAK,MAAA,CAAO,CAAA,CAAE,GAAG,CAAC,CAAA,EAAA,EAAK,OAAO,CAAA,CAAE,GAAG,CAAC,CAAA,EAAA,EAAK,MAAA,CAAO,EAAE,UAAU,CAAC,KAAK,MAAA,CAAO,CAAA,CAAE,UAAU,CAAC,CAAA,EAAA,EAAK,OAAO,CAAA,CAAE,SAAS,CAAC,CAAA,EAAA,EAAK,MAAA,CAAO,EAAE,QAAQ,CAAC,KAAK,MAAA,CAAO,CAAA,CAAE,KAAK,CAAC,CAAA,EAAA;AAAA,KACvN;AAAA,EACF;AAGA,EAAA,KAAA,CAAM,KAAK,6HAA6H,CAAA;AACxI,EAAA,KAAA,CAAM,KAAK,0EAA0E,CAAA;AACrF,EAAA,KAAA,MAAW,CAAA,IAAK,MAAM,KAAA,EAAO;AAC3B,IAAA,KAAA,CAAM,IAAA,CAAK,CAAA,0BAAA,EAA6B,MAAA,CAAO,CAAA,CAAE,EAAE,CAAC,CAAA,EAAA,EAAK,MAAA,CAAO,CAAA,CAAE,KAAK,CAAC,CAAA,EAAA,EAAK,MAAA,CAAO,EAAE,IAAI,CAAC,CAAA,EAAA,EAAK,MAAA,CAAO,CAAA,CAAE,QAAQ,CAAC,CAAA,EAAA,EAAK,MAAA,CAAO,CAAA,CAAE,aAAa,CAAC,CAAA,EAAA,CAAI,CAAA;AAClJ,IAAA,KAAA,MAAW,CAAA,IAAK,CAAA,CAAE,OAAA,EAAS,KAAA,CAAM,KAAK,CAAA,iCAAA,EAAoC,MAAA,CAAO,CAAA,CAAE,EAAE,CAAC,CAAA,EAAA,EAAK,MAAA,CAAO,CAAC,CAAC,CAAA,EAAA,CAAI,CAAA;AAAA,EAC1G;AAGA,EAAA,IAAI,KAAA,CAAM,KAAA,IAAS,KAAA,CAAM,KAAA,CAAM,MAAA,EAAQ;AACrC,IAAA,KAAA,CAAM,KAAK,2HAA2H,CAAA;AACtI,IAAA,KAAA,CAAM,KAAK,wEAAwE,CAAA;AACnF,IAAA,KAAA,CAAM,KAAK,2GAA2G,CAAA;AACtH,IAAA,KAAA,MAAW,CAAA,IAAK,MAAM,KAAA,EAAO;AAC3B,MAAA,KAAA,CAAM,IAAA,CAAK,CAAA,0BAAA,EAA6B,MAAA,CAAO,CAAA,CAAE,EAAE,CAAC,CAAA,EAAA,EAAK,MAAA,CAAO,CAAA,CAAE,IAAI,CAAC,CAAA,EAAA,EAAK,MAAA,CAAO,IAAA,CAAK,SAAA,CAAU,CAAA,CAAE,SAAS,CAAC,CAAC,CAAA,EAAA,EAAK,MAAA,CAAO,CAAA,CAAE,SAAS,CAAC,CAAA,EAAA,EAAK,MAAA,CAAO,CAAA,CAAE,UAAU,CAAC,CAAA,EAAA,CAAI,CAAA;AACpK,MAAA,KAAA,MAAW,CAAA,IAAK,CAAA,CAAE,UAAA,EAAY,KAAA,CAAM,KAAK,CAAA,kCAAA,EAAqC,MAAA,CAAO,CAAA,CAAE,EAAE,CAAC,CAAA,EAAA,EAAK,MAAA,CAAO,CAAC,CAAC,CAAA,EAAA,CAAI,CAAA;AAC5G,MAAA,KAAA,MAAW,EAAA,IAAM,CAAA,CAAE,QAAA,EAAU,KAAA,CAAM,IAAA,CAAK,CAAA,kCAAA,EAAqC,MAAA,CAAO,CAAA,CAAE,EAAE,CAAC,CAAA,EAAA,EAAK,MAAA,CAAO,EAAA,CAAG,IAAI,CAAC,CAAA,EAAA,EAAK,MAAA,CAAO,EAAA,CAAG,IAAA,CAAK,KAAK,CAAC,CAAA,EAAA,EAAK,MAAA,CAAO,EAAA,CAAG,IAAA,CAAK,GAAG,CAAC,CAAA,EAAA,CAAI,CAAA;AAAA,IACrK;AAAA,EACF;AAEA,EAAA,KAAA,CAAM,KAAK,SAAS,CAAA;AACpB,EAAA,OAAO,KAAA,CAAM,IAAA,CAAK,IAAI,CAAA,GAAI,IAAA;AAC5B;AAGA,SAAS,OAAO,CAAA,EAAsC;AACpD,EAAA,IAAI,CAAA,IAAK,MAAM,OAAO,MAAA;AACtB,EAAA,OAAO,CAAA,CAAA,EAAI,CAAA,CAAE,OAAA,CAAQ,IAAA,EAAM,IAAI,CAAC,CAAA,CAAA,CAAA;AAClC;AAEA,SAAS,OAAO,CAAA,EAAsC;AACpD,EAAA,OAAO,CAAA,IAAK,QAAQ,CAAC,MAAA,CAAO,SAAS,CAAC,CAAA,GAAI,MAAA,GAAS,MAAA,CAAO,CAAC,CAAA;AAC7D;AAEA,SAAS,QAAQ,CAAA,EAAuC;AACtD,EAAA,OAAO,CAAA,IAAK,IAAA,GAAO,MAAA,GAAS,CAAA,GAAI,GAAA,GAAM,GAAA;AACxC;AAEA,SAAS,UAAU,GAAA,EAA4B;AAI7C,EAAA,MAAM,aAAwB,EAAC;AAC/B,EAAA,KAAA,MAAW,CAAA,IAAK,GAAA,CAAI,IAAA,IAAQ,EAAC,EAAG;AAC9B,IAAA,UAAA,CAAW,IAAA,CAAK;AAAA,MACd,IAAA,EAAM,SAAA;AAAA,MACN,MAAM,CAAA,CAAE,IAAA;AAAA,MACR,OAAA,EAAS,CAAA,CAAE,SAAA,IAAa,CAAA,CAAE,QAAA;AAAA,MAC1B,IAAA,EAAM,CAAA,CAAE,SAAA,KAAc,KAAA,GAAQ,CAAA,QAAA,EAAW,CAAA,CAAE,IAAI,CAAA,CAAA,EAAI,CAAA,CAAE,SAAA,IAAa,EAAE,CAAA,CAAA,GAAK;AAAA,KAC1E,CAAA;AAAA,EACH;AACA,EAAA,KAAA,MAAW,CAAA,IAAK,GAAA,CAAI,MAAA,IAAU,EAAC,EAAG;AAChC,IAAA,UAAA,CAAW,KAAK,EAAE,IAAA,EAAM,wBAAA,EAA0B,IAAA,EAAM,EAAE,IAAA,EAAM,UAAA,EAAY,CAAC,EAAE,MAAM,YAAA,EAAc,KAAA,EAAO,EAAE,OAAA,EAAS,GAAG,CAAA;AAAA,EAC1H;AACA,EAAA,MAAM,GAAA,GAAM;AAAA,IACV,SAAA,EAAW,WAAA;AAAA,IACX,WAAA,EAAa,KAAA;AAAA,IACb,UAAU,EAAE,SAAA,EAAW,GAAA,CAAI,WAAA,EAAa,OAAO,CAAC,EAAE,IAAA,EAAM,IAAA,EAAM,SAAS,GAAA,CAAI,KAAA,CAAM,UAAA,CAAW,OAAA,EAAS,CAAA,EAAE;AAAA,IACvG;AAAA,GACF;AACA,EAAA,OAAO,IAAA,CAAK,SAAA,CAAU,GAAA,EAAK,IAAA,EAAM,CAAC,CAAA,GAAI,IAAA;AACxC;AAEA,SAAS,KAAK,GAAA,EAA4B;AACxC,EAAA,MAAM,YAAY,GAAA,CAAI,IAAA,IAAQ,EAAC,EAAG,GAAA,CAAI,CAAC,CAAA,MAAO;AAAA,IAC5C,MAAA,EAAQ,CAAA,gBAAA,EAAmB,WAAA,CAAY,CAAA,CAAE,IAAI,CAAC,CAAA,CAAA;AAAA,IAC9C,MAAM,CAAA,CAAE,IAAA;AAAA,IACR,WAAA,EAAa,CAAA,CAAE,SAAA,IAAa,CAAA,CAAE,QAAA;AAAA,IAC9B,gBAAA,EAAkB;AAAA,GACpB,CAAE,CAAA;AACF,EAAA,MAAM,GAAA,GAAM;AAAA,IACV,WAAA,EAAa,UAAA;AAAA,IACb,WAAA,EAAa,SAAA;AAAA,IACb,MAAA,EAAQ,kBAAA;AAAA,IACR,IAAA,EAAM,SAAA;AAAA,IACN,YAAA,EAAc,EAAE,OAAA,EAAS,GAAA,CAAI,WAAA,EAAa,QAAA,EAAU,CAAC,CAAA,SAAA,EAAY,GAAA,CAAI,KAAA,CAAM,UAAA,CAAW,OAAO,EAAE,CAAA,EAAE;AAAA,IACjG;AAAA,GACF;AACA,EAAA,OAAO,IAAA,CAAK,SAAA,CAAU,GAAA,EAAK,IAAA,EAAM,CAAC,CAAA,GAAI,IAAA;AACxC","file":"chunk-M7IO3DXH.js","sourcesContent":["import { refreshIfStale, type RefreshOutcome } from './refresh.js';\n\n/**\n * Debounced, single-flight, budget-capped auto-refresh.\n *\n * `refreshIfStale` is expensive and **synchronous in its hot half**: the\n * freshness probe walks the whole corpus (`discover` + `discoverDocs`) and\n * `statSync`s every file before anything can drift-check, and a real drift then\n * runs a full incremental `buildGraph`. On a 22k-file repo that is seconds for a\n * clean tree and over a minute for a dirty one.\n *\n * No interactive surface may pay that inline. This scheduler is the shared\n * discipline that keeps it off the request path, and it exists as one module\n * precisely because the previous per-server copies diverged: `vg serve` (MCP)\n * grew the guard while `vg lsp` kept a bare `await refreshIfStale(...)`, which\n * made a single editor Ask block for ~90s on a large workspace.\n *\n * Four properties, all load-bearing:\n * - **Single-flight** — concurrent callers share one refresh, never stack.\n * - **Debounced** — at most one probe per `probeIntervalMs`.\n * - **Self-tuning** — the interval grows with the *measured* cost of the last\n *   refresh, so probe/rebuild work stays under ~1/`PROBE_DUTY_FACTOR` of wall\n *   time however big the repo is.\n * - **Budget-capped** — a caller waits `refreshBudgetMs` at most, then proceeds\n *   with the map it already has. A warm probe lands inside the budget; a\n *   rebuild never does, and shouldn't.\n *\n * Answering from a map that is one edit stale is always better than making the\n * user wait: the rebuild lands for the next call.\n */\n\nexport type RefreshImpl = typeof refreshIfStale;\n\n/** Min gap between freshness probes — bounds stat-walk cost under bursty calls. */\nexport const PROBE_INTERVAL_MS = 2000;\n/** Ceiling for the self-tuned probe interval on very large repos. */\nexport const MAX_PROBE_INTERVAL_MS = 30_000;\n/** Probe/rebuild may consume at most ~1/PROBE_DUTY_FACTOR of wall-time (20 → ≤5%). */\nexport const PROBE_DUTY_FACTOR = 20;\n/**\n * How long a caller waits for an in-flight refresh before answering from the\n * current map. Deliberately small: warm lookups are sub-10ms, so a multi-second\n * budget turns every call during a large-repo rebuild into a multi-second stall.\n */\nexport const REFRESH_BUDGET_MS = 100;\n/** After a refresh failure (e.g. read-only checkout), don't retry for this long. */\nexport const FAILURE_COOLDOWN_MS = 60_000;\n\nexport interface RefreshSchedulerOptions {\n  /** Workspace root for freshness probes and rebuilds. */\n  root: string;\n  /**\n   * The already-resolved map path, or a getter for it. Passing it through spares\n   * `refreshIfStale` a `defaultGraphPath` re-resolution (which consults git).\n   */\n  graphPath?: string | (() => string | undefined);\n  /** Min gap between probes. `0` probes every call (tests). */\n  probeIntervalMs?: number;\n  /** Max wait before a caller gives up and uses the current map. */\n  refreshBudgetMs?: number;\n  /** Tests only: inject a slow/fake refresh to assert the micro-budget. */\n  refreshImpl?: RefreshImpl;\n  /** Force single-threaded parsing on a rebuild (constrained hosts / tests). */\n  inline?: boolean;\n  /**\n   * Called when a refresh settles, with the outcome (`null` if it threw) and the\n   * ms timestamp the refresh started at. Lets an owner react — invalidate a\n   * cached graph, clear a pending-change set — without re-implementing any of\n   * the scheduling above.\n   */\n  onSettled?: (outcome: RefreshOutcome | null, startedAt: number) => void;\n}\n\nexport class RefreshScheduler {\n  private lastProbeAt = 0;\n  private failedUntil = 0;\n  private inflight: Promise<void> | null = null;\n  /** Self-tuned: grows with measured probe/rebuild cost so huge repos aren't penalized. */\n  private tunedIntervalMs = PROBE_INTERVAL_MS;\n  private readonly refreshImpl: RefreshImpl;\n\n  constructor(private readonly opts: RefreshSchedulerOptions) {\n    this.refreshImpl = opts.refreshImpl ?? refreshIfStale;\n  }\n\n  /** The interval currently in force — diagnostics and tests. */\n  get probeIntervalMs(): number {\n    return this.opts.probeIntervalMs ?? this.tunedIntervalMs;\n  }\n\n  /** Is a refresh running right now? Lets a caller report \"refreshing\" state. */\n  get busy(): boolean {\n    return this.inflight !== null;\n  }\n\n  /**\n   * Re-arm the next probe regardless of the debounce interval — for a watcher\n   * event or an explicit user action, where waiting out the interval would feel\n   * broken. Clears the failure cooldown too: a real event is evidence the tree\n   * moved, not a poll, and the condition that failed may be exactly what\n   * changed. Does not itself start a refresh; the next `maybeRefresh` does.\n   */\n  arm(): void {\n    this.lastProbeAt = 0;\n    this.failedUntil = 0;\n  }\n\n  /**\n   * Probe/rebuild if due, and wait at most the budget for it. Never throws —\n   * a refresh problem must degrade to \"answer from the current map\", not break\n   * the caller.\n   */\n  async maybeRefresh(): Promise<void> {\n    const now = Date.now();\n    if (!this.inflight) {\n      if (now < this.failedUntil || now - this.lastProbeAt < this.probeIntervalMs) return;\n      this.lastProbeAt = now;\n      const graphPath =\n        typeof this.opts.graphPath === 'function' ? this.opts.graphPath() : this.opts.graphPath;\n      this.inflight = this.refreshImpl(this.opts.root, { graphPath, inline: this.opts.inline })\n        .then((outcome) => {\n          if (outcome.status === 'error') this.failedUntil = Date.now() + FAILURE_COOLDOWN_MS;\n          this.tune(outcome, now);\n          this.opts.onSettled?.(outcome, now);\n        })\n        .catch(() => {\n          this.failedUntil = Date.now() + FAILURE_COOLDOWN_MS;\n          this.tune(null, now);\n          this.opts.onSettled?.(null, now);\n        })\n        .finally(() => {\n          this.inflight = null;\n        });\n    }\n    await Promise.race([this.inflight, sleep(this.opts.refreshBudgetMs ?? REFRESH_BUDGET_MS)]);\n  }\n\n  /**\n   * Back off proportionally to what the refresh actually cost — including a\n   * multi-second rebuild. Tuning off probe-only outcomes alone would re-arm\n   * after the floor and make every sequential call pay the budget again for the\n   * whole duration of a large rebuild.\n   */\n  private tune(outcome: RefreshOutcome | null, startedAt: number): void {\n    const elapsed = Date.now() - startedAt;\n    const cost =\n      outcome?.status === 'refreshed' && typeof outcome.ms === 'number'\n        ? Math.max(outcome.ms, elapsed)\n        : elapsed;\n    this.tunedIntervalMs = Math.min(\n      MAX_PROBE_INTERVAL_MS,\n      Math.max(PROBE_INTERVAL_MS, cost * PROBE_DUTY_FACTOR),\n    );\n  }\n}\n\nfunction sleep(ms: number): Promise<void> {\n  return new Promise((resolve) => {\n    const timer = setTimeout(resolve, ms);\n    timer.unref?.();\n  });\n}\n","import * as path from 'node:path';\n\n/**\n * Shared change-event filter for the two file watchers (`vg watch` and the\n * serve-loop watcher in mcp/server.ts): which filesystem events are real\n * source changes, and which are dependency/artifact/VCS noise that must never\n * trigger a rebuild — including vg's own artifacts, or every build would\n * re-trigger itself.\n */\nexport const WATCH_SKIP_NAMES = new Set([\n  '.git',\n  'node_modules',\n  '.vibgrate',\n  'dist',\n  'build',\n  'out',\n  'coverage',\n  '.next',\n  'target',\n  '__pycache__',\n  '.venv',\n  'venv',\n]);\n\n/** True when a watch event's filename is a change worth rebuilding for. */\nexport function isRelevantChange(filename: string): boolean {\n  if (filename.split(path.sep).some((p) => WATCH_SKIP_NAMES.has(p))) return false;\n  if (filename.includes(`${path.sep}.vibgrate${path.sep}`) || filename.startsWith('.vibgrate')) return false;\n  return true;\n}\n","import * as fs from 'node:fs';\nimport * as path from 'node:path';\nimport { Server } from '@modelcontextprotocol/sdk/server/index.js';\nimport { StdioServerTransport } from '@modelcontextprotocol/sdk/server/stdio.js';\nimport { ListToolsRequestSchema, CallToolRequestSchema } from '@modelcontextprotocol/sdk/types.js';\nimport type { CallToolResult } from '@modelcontextprotocol/sdk/types.js';\nimport { parseGraph } from '../engine/serialize.js';\nimport { mapFileStat } from '../engine/snapshot.js';\nimport { loadGraphPreferIndex } from '../engine/index-db.js';\nimport type { RefreshOutcome, refreshIfStale } from '../engine/refresh.js';\nimport { RefreshScheduler, REFRESH_BUDGET_MS as SCHEDULER_BUDGET_MS } from '../engine/refresh-scheduler.js';\nimport { TOOLS, budgetSuffix, listedToolNames, warmEmbedderInBackground, type ToolSurface } from './tools.js';\nimport { isRelevantChange } from '../engine/watch-filter.js';\nimport { renderToolResult } from './response.js';\nimport { recordSaving, sanitizeClient, PER_FILE_TOKENS, SAVINGS_TOOLS, type Outcome } from '../engine/savings.js';\nimport type { SessionStats } from './serve-stats.js';\nimport { countTokens } from '../engine/tokens.js';\nimport { VERSION } from '../version.js';\nimport type { VgGraph } from '../schema.js';\n\n/**\n * The local `vg serve` MCP server. Self-contained and offline. Freshness is\n * two-layered, with no filesystem watcher (freshness only matters at the\n * moment of a query, so we check on read instead of watching):\n *\n * 1. **Hot reload** — `graph.json` is re-read whenever its mtime changes, so a\n *    rebuild from ANY source (a foreground `vg`, another serve process, CI)\n *    is picked up on the next tool call.\n * 2. **Auto-refresh** (default on) — each tool call runs a debounced, stat-only\n *    freshness probe against the last build's snapshot; if the working tree\n *    drifted, an incremental rebuild runs in-process (cross-process locked,\n *    single-flight). The call waits only a **micro-budget** so a warm probe can\n *    land without stalling MCP tools — otherwise it answers from the current\n *    map while the rebuild finishes for a later call (hot-reload picks it up).\n *\n * Every tool remains read-only and auto-approvable; the refresh only rewrites\n * vg's own artifacts under `.vibgrate/`, never user code.\n */\n\n/**\n * How long a tool call waits for an in-flight refresh before answering from\n * the current map. Kept deliberately small: MCP tool latency is sub-10ms on\n * warm maps, and a multi-second budget (the previous 5s ceiling matched\n * `git rev-parse`'s spawn timeout) turned every sequential tool call during a\n * large-repo rebuild into a multi-second stall — measured as TypeScript p50\n * ~5.2s on the release benchmark for the `vg-cli-public` corpus entry.\n * Warm probes still finish inside this window; heavy rebuilds never should.\n *\n * Re-exported from the shared scheduler, which owns this and the probe-interval\n * tuning for every surface (`vg serve` and `vg lsp` alike).\n */\nexport const REFRESH_BUDGET_MS = SCHEDULER_BUDGET_MS;\n/** Settle time between a watcher event and the background refresh it triggers. */\nconst WATCH_DEBOUNCE_MS = 400;\n\nexport type RefreshImpl = typeof refreshIfStale;\n\nexport interface GraphSourceTuning {\n  probeIntervalMs?: number;\n  refreshBudgetMs?: number;\n  /**\n   * Workspace root for freshness probes. Prefer passing this explicitly —\n   * deriving it from `graphPath` via `dirname` twice only works for the legacy\n   * `root/.vibgrate/graph.json` layout, not the global branch-keyed store.\n   */\n  root?: string;\n  /** Tests only: inject a slow/fake refresh to assert the micro-budget. */\n  refreshImpl?: RefreshImpl;\n}\n\nexport interface ServeOptions {\n  /** Record local, counts-only usage savings (opt-in). */\n  savings?: boolean;\n  /**\n   * Periodically upload the counts-only ledger to Vibgrate (opt-in; off by\n   * default). Implies recording. The upload itself is driven by the serve\n   * command (see commands/serve.ts + engine/stats-share.ts); here it just also\n   * turns recording on so there's something to send.\n   */\n  shareStats?: boolean;\n  /** Air-gapped mode (no model downloads). */\n  local?: boolean;\n  /** Collapse repeat heavy relation lists within a session (opt-in). */\n  dedup?: boolean;\n  /** Auto-refresh the map when the working tree drifts (default true). */\n  refresh?: boolean;\n  /**\n   * Event-driven refresh: recursive fs.watch on the workspace so a save\n   * rebuilds in ~400 ms instead of waiting out the freshness poll (default\n   * true when refresh is on; `--no-watch` opts out). Where recursive watch is\n   * unavailable the poll silently remains the only mechanism.\n   */\n  watch?: boolean;\n  /**\n   * Workspace root (project directory). When set, freshness probes and tools\n   * use this instead of inferring root from the graph path.\n   */\n  root?: string;\n  /**\n   * In-memory session stats behind the live `vg serve` status display. Always\n   * safe to pass: nothing recorded here is persisted or uploaded — it dies with\n   * the process (the opt-in ledger above is a separate concern).\n   */\n  stats?: SessionStats;\n  /**\n   * Listing surface (`--surface hot` / `--tools a,b`). Filters ONLY what\n   * `tools/list` advertises; every tool stays callable so behaviour is\n   * byte-identical across surfaces. See `listedToolNames` in ./tools.ts.\n   */\n  toolSurface?: ToolSurface;\n}\n\nexport class GraphSource {\n  private cachedMtimeMs = -1;\n  private cached: VgGraph | null = null;\n  /** Project root used for freshness probes and rebuilds. */\n  readonly root: string;\n  /** Debounce, single-flight, self-tuning and budget cap — shared with `vg lsp`. */\n  private readonly refresher: RefreshScheduler;\n  /**\n   * Files seen changing since the last COMMITTED refresh (watcher events,\n   * filename → last-seen ms). Entries are cleared only after a refresh that\n   * started at-or-after their last event completes with 'fresh'/'refreshed' —\n   * a change landing mid-refresh stays pending, so the staleness signal can\n   * be a false positive but never a false negative.\n   */\n  private readonly pendingChanges = new Map<string, number>();\n  private watcher: fs.FSWatcher | null = null;\n  private watchTimer: ReturnType<typeof setTimeout> | null = null;\n\n  constructor(\n    readonly graphPath: string,\n    private readonly refresh = false,\n    /** Timing / root overrides (production passes `root`; tests may pass more). */\n    private readonly tuning: GraphSourceTuning = {},\n  ) {\n    // Prefer an explicit root. Fallback assumes legacy `root/.vibgrate/graph.json`\n    // (dirname twice); wrong for the global store — callers should pass `root`.\n    this.root = tuning.root ?? path.dirname(path.dirname(graphPath));\n    this.refresher = new RefreshScheduler({\n      root: this.root,\n      graphPath,\n      probeIntervalMs: tuning.probeIntervalMs,\n      refreshBudgetMs: tuning.refreshBudgetMs,\n      refreshImpl: tuning.refreshImpl,\n      onSettled: (outcome, startedAt) => this.onRefreshSettled(outcome, startedAt),\n    });\n  }\n\n  /** Current graph: auto-refreshed if the tree drifted, reloaded if the file changed. */\n  async get(): Promise<VgGraph> {\n    if (this.refresh) await this.maybeRefresh();\n    // JSON when present, else the standalone snapshot (global-store mode);\n    // throws if neither exists → surfaced as tool error.\n    const stat = mapFileStat(this.graphPath);\n    if (stat.mtimeMs !== this.cachedMtimeMs || !this.cached) {\n      // Prefer SQLite reconstruct when corpusHash matches (scale past JSON parse).\n      const preferred = loadGraphPreferIndex(this.root, this.graphPath);\n      this.cached = preferred\n        ? preferred.graph\n        : parseGraph(fs.readFileSync(this.graphPath, 'utf8'));\n      this.cachedMtimeMs = stat.mtimeMs;\n    }\n    return this.cached;\n  }\n\n  /**\n   * Debounced, single-flight refresh — the shared scheduler does the work (see\n   * engine/refresh-scheduler.ts). Never throws: a refresh problem must degrade\n   * to \"answer from the current map\", not break the tool call.\n   */\n  private maybeRefresh(): Promise<void> {\n    return this.refresher.maybeRefresh();\n  }\n\n  /**\n   * A COMMITTED outcome (map verified fresh, or rebuilt) clears the pending\n   * set — but only entries whose last event predates the refresh start.\n   * 'locked'/'error'/'no-snapshot' clear nothing: the map may still be behind\n   * those changes.\n   */\n  private onRefreshSettled(outcome: RefreshOutcome | null, startedAt: number): void {\n    if (outcome?.status !== 'fresh' && outcome?.status !== 'refreshed') return;\n    for (const [file, seenAt] of this.pendingChanges) {\n      if (seenAt <= startedAt) this.pendingChanges.delete(file);\n    }\n  }\n\n  /**\n   * Record a source change (watcher event, or a test). Arms the next probe to\n   * run immediately (bypassing the self-tuned interval — a real event is not a\n   * poll) and schedules a debounced background refresh so the rebuild happens\n   * BETWEEN tool calls instead of on the next call's 100 ms budget.\n   */\n  notePendingChange(filename: string): void {\n    this.pendingChanges.set(filename, Date.now());\n    this.refresher.arm();\n    if (!this.refresh) return;\n    if (this.watchTimer) clearTimeout(this.watchTimer);\n    this.watchTimer = setTimeout(() => {\n      this.watchTimer = null;\n      void this.maybeRefresh();\n    }, WATCH_DEBOUNCE_MS);\n    this.watchTimer.unref?.();\n  }\n\n  /**\n   * Event-driven freshness (the serve-loop watcher): a recursive `fs.watch`\n   * on the workspace feeds `notePendingChange`, so a save triggers a rebuild\n   * in ~WATCH_DEBOUNCE_MS instead of waiting out the 2–30 s poll. The poll\n   * stays armed as the fallback — on filesystems where recursive watch fails\n   * (some containers/NFS) this returns false and behaviour is unchanged.\n   */\n  startWatching(): boolean {\n    if (this.watcher) return true;\n    try {\n      this.watcher = fs.watch(this.root, { recursive: true }, (_event, filename) => {\n        if (!filename) return;\n        if (!isRelevantChange(filename)) return;\n        this.notePendingChange(filename);\n      });\n      this.watcher.unref?.();\n      return true;\n    } catch {\n      this.watcher = null;\n      return false;\n    }\n  }\n\n  stopWatching(): void {\n    this.watcher?.close();\n    this.watcher = null;\n    if (this.watchTimer) clearTimeout(this.watchTimer);\n    this.watchTimer = null;\n  }\n\n  /**\n   * In-band staleness signal for tool responses: what has changed since the\n   * last committed refresh. Null when the map is current (the common case —\n   * responses carry zero overhead then).\n   */\n  stalenessNote(): string | null {\n    const n = this.pendingChanges.size;\n    if (n === 0) return null;\n    const names = [...this.pendingChanges.keys()].sort().slice(0, 3);\n    const more = n > names.length ? `, +${n - names.length} more` : '';\n    return `map freshness: ${n} file(s) changed since the last rebuild (${names.join(', ')}${more}) — auto-refresh pending; symbol locations may have shifted`;\n  }\n}\n\nexport function createServer(source: GraphSource, opts: ServeOptions = {}): Server {\n  const { savings = false, shareStats = false, local = false, dedup = false, stats } = opts;\n  // Recording feeds both the local `vg savings` report and the opt-in upload, so\n  // enabling either turns it on. Absent both, `vg serve` records nothing.\n  const record = savings || shareStats;\n  // Prefer GraphSource's explicit root (set by serve from the project cwd).\n  const root = opts.root ?? source.root;\n  // Per-session memory of node ids whose full detail was already returned — the\n  // basis for opt-in cross-call dedup (`--dedup`). Scoped to this server\n  // instance so it never leaks across sessions. Node ids are content-addressed\n  // (blake3 of content), so an edited node gets a new id and is never falsely\n  // treated as already-seen — dedup is stale-safe by construction.\n  const seen = new Set<string>();\n  const server = new Server(\n    { name: 'vg', version: VERSION },\n    {\n      capabilities: { tools: {} },\n      // Routing guidance once at the server level (hosts that surface\n      // `instructions` get it at zero per-step schema cost): the flashlight\n      // vs the map.\n      instructions:\n        'vg is a code map. Use search_symbols to find a known name or literal string fast — ' +\n        'a multi-word/quoted phrase runs a complete literal sweep and reports totalTextMatches, ' +\n        'so reach for it instead of grep even for plain-string \"find every occurrence\" lookups. ' +\n        'Use orient/query_graph for meaning: symptoms, relationships, and what-breaks-if. ' +\n        'Responses are concise by default; pass response_format:\"detailed\" only when a node proves load-bearing. ' +\n        // Stop-discipline: the failure mode on a focused task is over-navigation\n        // — one more query, one more get_node — which re-bills the whole context\n        // every step. One good navigation call usually locates the code.\n        'Navigate as little as possible: one good search/query usually locates the code. ' +\n        'As soon as you have the file and line, read that file and make the edit — ' +\n        'do not call further graph tools unless the edit fails or the match was wrong. ' +\n        // Library docs: position against web search (version-correct beats\n        // SEO results), and give a stopping rule so a thin doc doesn't turn\n        // into an open-ended search loop.\n        'For how-do-I-use-this-library questions call resolve_library once, then library_docs ' +\n        'with the returned targetId and a focused query: the docs are official and matched to ' +\n        'the version THIS project has installed (drift-annotated) — prefer them over web search ' +\n        'or training-data recall when they conflict. Skip them for language built-ins or APIs ' +\n        'already shown in context. If two library_docs calls have not surfaced the section you ' +\n        'need, read the package source under node_modules instead of searching again.',\n    },\n  );\n\n  server.setRequestHandler(ListToolsRequestSchema, async () => {\n    const listed = new Set(listedToolNames(opts.toolSurface));\n    // Repo-size call budget on orient's listed description: the stop-discipline\n    // where the model decides, priced once per list, not per step. Best-effort —\n    // when no map is loadable yet the description ships without the line.\n    let budget = '';\n    try {\n      const graph = await source.get();\n      budget = budgetSuffix(new Set(graph.nodes.map((n) => n.file)).size);\n    } catch {\n      /* no map yet — plain description */\n    }\n    return {\n      tools: TOOLS.filter((t) => listed.has(t.name)).map((t) => ({\n        name: t.name,\n        description: t.name === 'orient' && budget ? `${t.description}${budget}` : t.description,\n        inputSchema: t.inputSchema,\n        annotations: { readOnlyHint: true, openWorldHint: false },\n      })),\n    };\n  });\n\n  server.setRequestHandler(CallToolRequestSchema, async (request) => {\n    const tool = TOOLS.find((t) => t.name === request.params.name);\n    if (!tool) {\n      return errorResult(`unknown tool \"${request.params.name}\"`);\n    }\n    let graph: VgGraph;\n    try {\n      graph = await source.get();\n    } catch {\n      return errorResult(\n        'no code map found. Run `vg` in the project to build .vibgrate/graph.json, then retry.',\n      );\n    }\n    const startedAt = Date.now();\n    try {\n      const args = (request.params.arguments ?? {}) as Record<string, unknown>;\n      const result = await tool.handler(graph, args, { root, local, dedup, seen, graphPath: source.graphPath });\n      const ms = Date.now() - startedAt;\n      // Live, in-memory session stats for the serve status display — always on\n      // when a serve process passed them (nothing leaves the process).\n      stats?.record({ ...measureCall(tool.name, result), client: sanitizeClient(detectClient(server)), ms });\n      // Opt-in, counts-only usage ledger: one entry per navigation call, with its\n      // outcome, the grep-baseline token counts, and — so `vg savings` can show\n      // the command-vs-MCP split and which AI is calling — the source (`mcp`) and\n      // the client detected from the initialize handshake.\n      if (record) recordUsage(root, tool.name, result, detectClient(server), ms);\n      // Compact → clamp to the token ceiling → compact-serialise. See ./response.ts.\n      const rendered = renderToolResult(result);\n      // In-band staleness (serve-loop watcher): when the working tree has\n      // drifted past the served map, say so ON the response — the agent is the\n      // one acting on possibly-moved symbols, and stderr never reaches it.\n      // Zero overhead when the map is current (the overwhelmingly common case).\n      const staleness = source.stalenessNote();\n      if (staleness) rendered.content = [...(rendered.content ?? []), { type: 'text', text: `[${staleness}]` }];\n      return rendered;\n    } catch (err) {\n      // A failed call still counts in the live display — as a miss, so the\n      // operator sees trouble instead of a silently frozen dashboard.\n      stats?.record({\n        tool: tool.name,\n        client: sanitizeClient(detectClient(server)),\n        outcome: 'miss',\n        ms: Date.now() - startedAt,\n        vgTokens: 0,\n        baselineTokens: 0,\n      });\n      return errorResult(`tool \"${tool.name}\" failed: ${(err as Error).message}`);\n    }\n  });\n\n  return server;\n}\n\nexport async function serveStdio(graphPath: string, opts: ServeOptions = {}): Promise<void> {\n  const source = new GraphSource(graphPath, opts.refresh !== false, { root: opts.root });\n  if (opts.refresh !== false && opts.watch !== false) source.startWatching();\n  const server = createServer(source, opts);\n  // Start the semantic-model warm-up as soon as the server boots, so the first\n  // orient/query_graph doesn't pay a cold download. Non-blocking: navigation\n  // answers lexically until the model is ready, then upgrades to semantic.\n  warmEmbedderInBackground(opts.local);\n  await server.connect(new StdioServerTransport());\n}\n\n\n/**\n * Append a counts-only usage entry for a navigation call: which tool, how it\n * resolved (complete/partial/miss), and — for the grep-baseline tools — the\n * tokens vg spent vs the grep/read baseline it replaced.\n *\n * `vgTokens` is the size of the payload vg ACTUALLY returned — the rendered text\n * block the model receives and re-pays on every subsequent turn — measured with\n * the same token counter the budget uses. It is deliberately NOT read from a\n * `tokensEstimate` field: only query_graph's rarely-used *detailed* mode ever\n * set that (get_node never did), so the old code recorded nothing under normal\n * concise usage and `vg savings` always reported \"recording is off\".\n */\nexport function recordUsage(root: string, tool: string, result: unknown, client?: string, ms?: number): void {\n  recordSaving(\n    root,\n    { ...measureCall(tool, result), source: 'mcp', client: sanitizeClient(client), ...(ms !== undefined ? { ms } : {}) },\n    Date.now(),\n  );\n}\n\n/**\n * Measure one tool call for the ledger and the live session stats: its outcome\n * plus — for the grep-baseline tools only — the context tokens vg returned and\n * the baseline they replaced (other tools report zeros, meaning \"no baseline\").\n */\nfunction measureCall(tool: string, result: unknown): { tool: string; outcome: Outcome; vgTokens: number; baselineTokens: number } {\n  const outcome = classifyOutcome(result);\n  let vgTokens = 0;\n  let baselineTokens = 0;\n  if (SAVINGS_TOOLS.has(tool) && result && typeof result === 'object') {\n    vgTokens = countTokens(renderedText(renderToolResult(result)));\n    // Grep/read baseline: ~PER_FILE_TOKENS per distinct file the answer points\n    // at — the files a grep/read agent would have had to open to learn the same\n    // thing. query_graph surfaces them as `matches[].file`; get_node as its own\n    // `file` plus the files of the callers/callees it returned in one call.\n    baselineTokens = referencedFiles(result).size * PER_FILE_TOKENS;\n  }\n  return { tool, outcome, vgTokens, baselineTokens };\n}\n\n/**\n * The coarse client label from the MCP `initialize` handshake, if the host sent\n * `clientInfo`. Read defensively — `getClientVersion()` exists on the SDK Server\n * once initialized, but we never want telemetry bookkeeping to throw. Returns\n * undefined when unknown (then sanitized to `'unknown'`).\n */\nfunction detectClient(server: Server): string | undefined {\n  try {\n    const info = (server as { getClientVersion?: () => { name?: string } | undefined }).getClientVersion?.();\n    return typeof info?.name === 'string' ? info.name : undefined;\n  } catch {\n    return undefined;\n  }\n}\n\n/**\n * Bucket a tool result into complete / partial / miss. A `miss` is an answer\n * that found nothing (no match, not-found, not-connected, or an empty listing);\n * a `partial` found results but capped or paginated some of them; everything\n * else is `complete`. Note that a legitimately empty `affected`/`covers` (e.g.\n * \"nothing depends on this\") is a successful answer, not a miss — only the\n * primary discovery signals below mark a miss.\n */\nfunction classifyOutcome(result: unknown): Outcome {\n  if (Array.isArray(result)) return result.length === 0 ? 'miss' : 'complete';\n  if (!result || typeof result !== 'object') return 'miss';\n  const r = result as Record<string, unknown>;\n  if (typeof r.error === 'string' && r.error) return 'miss'; // not_found / ambiguous / unresolved\n  if (r.connected === false) return 'miss'; // find_path\n  if (Array.isArray(r.matches) && r.matches.length === 0) return 'miss'; // query_graph / search_symbols\n  return isPartial(r) ? 'partial' : 'complete';\n}\n\n/** True when a hit left results on the table: paginated, or a capped relation list. */\nfunction isPartial(r: Record<string, unknown>): boolean {\n  if (r.moreAvailable === true) return true;\n  if (r._truncated && typeof r._truncated === 'object') return true;\n  // A `<name>Total` greater than the length of its sibling `<name>` array means\n  // the array was capped (e.g. get_node's callsTotal vs the shown calls).\n  for (const [key, value] of Object.entries(r)) {\n    if (typeof value !== 'number' || !key.endsWith('Total')) continue;\n    const base = key.slice(0, -'Total'.length);\n    const shown = Array.isArray(r[base]) ? (r[base] as unknown[]).length : 0;\n    if (value > shown) return true;\n  }\n  return false;\n}\n\n/** The text block of a rendered tool result — what the model is billed for. */\nfunction renderedText(rendered: CallToolResult): string {\n  const block = rendered.content?.find((b) => b.type === 'text');\n  return block && 'text' in block && typeof block.text === 'string' ? block.text : '';\n}\n\n/** Distinct files a navigation result points at (its grep/read baseline set). */\nfunction referencedFiles(result: unknown): Set<string> {\n  const r = result as { file?: unknown; matches?: unknown; calls?: unknown; calledBy?: unknown };\n  const files = new Set<string>();\n  if (typeof r.file === 'string' && r.file) files.add(r.file);\n  for (const m of asArray(r.matches)) {\n    const f = (m as { file?: unknown }).file;\n    if (typeof f === 'string' && f) files.add(f);\n  }\n  // get_node's calls/calledBy are qualified names of the form `path:symbol`; the\n  // path prefix is the file a grep/read agent would open to inspect that edge.\n  for (const name of [...asArray(r.calls), ...asArray(r.calledBy)]) {\n    if (typeof name !== 'string') continue;\n    const i = name.indexOf(':');\n    if (i > 0) files.add(name.slice(0, i));\n  }\n  return files;\n}\n\nfunction asArray(v: unknown): unknown[] {\n  return Array.isArray(v) ? v : [];\n}\n\nfunction errorResult(message: string) {\n  return { content: [{ type: 'text', text: message }], isError: true };\n}\n","import { serializeGraph, slimGraphForExport } from './serialize.js';\nimport { renderReport } from './report.js';\nimport { renderHtml } from './html.js';\nimport type { DepRecord } from './drift.js';\nimport type { LocalModel } from './models.js';\nimport type { VgGraph } from '../schema.js';\n\n/** Above this node count, JSON export defaults to compact (no pretty-print). */\nexport const COMPACT_JSON_NODES = 5_000;\n\n/**\n * Deterministic exporters (VG-CLI-SPEC §4.2). One `vg export <file>` verb, format\n * inferred from the extension. Live graph-DB push is deliberately out (a file\n * import covers the same need offline). CycloneDX/SPDX power the SBOM/AI-BOM seam\n * (VG-LOCAL-MODELS §9.4).\n */\n\nexport type ExportFormat =\n  | 'json'\n  | 'ndjson'\n  | 'graphml'\n  | 'dot'\n  | 'cypher'\n  | 'sql'\n  | 'md'\n  | 'html'\n  | 'cyclonedx'\n  | 'spdx';\n\nexport function formatForExt(ext: string): ExportFormat | null {\n  switch (ext.toLowerCase()) {\n    case '.json':\n      return 'json';\n    case '.ndjson':\n      return 'ndjson';\n    case '.graphml':\n      return 'graphml';\n    case '.dot':\n    case '.gv':\n      return 'dot';\n    case '.cypher':\n      return 'cypher';\n    case '.sql':\n      return 'sql';\n    case '.md':\n      return 'md';\n    case '.html':\n      return 'html';\n    default:\n      return null;\n  }\n}\n\nexport interface ExportContext {\n  graph: VgGraph;\n  deps?: DepRecord[];\n  models?: LocalModel[];\n  generatedAt: string;\n  /** Force compact JSON (no indent). Default: auto when nodes > COMPACT_JSON_NODES. */\n  compact?: boolean;\n  /** Drop area members + grounding for smaller artifacts. */\n  slim?: boolean;\n}\n\nexport function exportGraph(format: ExportFormat, ctx: ExportContext): string {\n  const graph = ctx.slim ? slimGraphForExport(ctx.graph) : ctx.graph;\n  const compact =\n    ctx.compact === true ||\n    (ctx.compact !== false && format === 'json' && graph.meta.counts.nodes > COMPACT_JSON_NODES);\n\n  switch (format) {\n    case 'json':\n      return serializeGraph(graph, { compact });\n    case 'md':\n      return renderReport(graph);\n    case 'html':\n      return renderHtml(graph);\n    case 'ndjson':\n      return ndjson(graph);\n    case 'graphml':\n      return graphml(graph);\n    case 'dot':\n      return dot(graph);\n    case 'cypher':\n      return cypher(graph);\n    case 'sql':\n      return sql({ ...ctx, graph });\n    case 'cyclonedx':\n      return cyclonedx({ ...ctx, graph });\n    case 'spdx':\n      return spdx({ ...ctx, graph });\n  }\n}\n\nfunction ndjson(graph: VgGraph): string {\n  // Facts stream if present, else the node stream — one JSON object per line.\n  const rows = graph.facts && graph.facts.length ? graph.facts : graph.nodes;\n  return rows.map((r) => JSON.stringify(r)).join('\\n') + '\\n';\n}\n\nfunction esc(s: string): string {\n  return s.replace(/&/g, '&amp;').replace(/</g, '&lt;').replace(/>/g, '&gt;').replace(/\"/g, '&quot;');\n}\n\nfunction graphml(graph: VgGraph): string {\n  const lines: string[] = [];\n  lines.push('<?xml version=\"1.0\" encoding=\"UTF-8\"?>');\n  lines.push('<graphml xmlns=\"http://graphml.graphdrawing.org/xmlns\">');\n  lines.push('  <key id=\"name\" for=\"node\" attr.name=\"name\" attr.type=\"string\"/>');\n  lines.push('  <key id=\"kind\" for=\"node\" attr.name=\"kind\" attr.type=\"string\"/>');\n  lines.push('  <key id=\"file\" for=\"node\" attr.name=\"file\" attr.type=\"string\"/>');\n  lines.push('  <key id=\"ekind\" for=\"edge\" attr.name=\"kind\" attr.type=\"string\"/>');\n  lines.push('  <graph edgedefault=\"directed\">');\n  for (const n of graph.nodes) {\n    lines.push(`    <node id=\"${esc(n.id)}\"><data key=\"name\">${esc(n.qualifiedName)}</data><data key=\"kind\">${esc(n.kind)}</data><data key=\"file\">${esc(n.file)}</data></node>`);\n  }\n  for (const e of graph.edges) {\n    lines.push(`    <edge source=\"${esc(e.src)}\" target=\"${esc(e.dst)}\"><data key=\"ekind\">${esc(e.kind)}</data></edge>`);\n  }\n  lines.push('  </graph>');\n  lines.push('</graphml>');\n  return lines.join('\\n') + '\\n';\n}\n\nfunction dot(graph: VgGraph): string {\n  const lines: string[] = ['digraph vg {'];\n  for (const n of graph.nodes) lines.push(`  \"${n.id}\" [label=\"${dotEsc(n.qualifiedName)}\"];`);\n  for (const e of graph.edges) lines.push(`  \"${e.src}\" -> \"${e.dst}\" [label=\"${e.kind}\"];`);\n  lines.push('}');\n  return lines.join('\\n') + '\\n';\n}\nfunction dotEsc(s: string): string {\n  return s.replace(/\"/g, '\\\\\"');\n}\n\nfunction cypher(graph: VgGraph): string {\n  const lines: string[] = [];\n  for (const n of graph.nodes) {\n    lines.push(\n      `CREATE (:\\`${cypherLabel(n.kind)}\\` {id:${q(n.id)}, name:${q(n.qualifiedName)}, file:${q(n.file)}});`,\n    );\n  }\n  for (const e of graph.edges) {\n    lines.push(\n      `MATCH (a {id:${q(e.src)}}),(b {id:${q(e.dst)}}) CREATE (a)-[:\\`${cypherLabel(e.kind)}\\`]->(b);`,\n    );\n  }\n  return lines.join('\\n') + '\\n';\n}\nfunction cypherLabel(s: string): string {\n  return s.replace(/[^A-Za-z0-9_]/g, '_');\n}\nfunction q(s: string): string {\n  return JSON.stringify(s);\n}\n\n/**\n * Portable SQL fact-DB (VG-CLI-SPEC §4.2, agent-consumption). Emits deterministic\n * DDL + INSERT text — NOT a native driver — that loads identically into BOTH\n * sqlite3 and duckdb (`sqlite3 map.db < map.sql` / `duckdb map.db < map.sql`).\n * Text keeps the CLI dependency-free, offline, and byte-diffable; an identical\n * graph yields identical bytes. An agent can then run e.g.\n *   SELECT src, dst FROM edges WHERE epistemic = 'observed' AND confidence >= 0.9;\n * Determinism: single transaction, `CREATE TABLE IF NOT EXISTS`, rows emitted in\n * the graph's own (already-sorted) array order, single quotes doubled, NULL for\n * absent optionals, booleans as 0/1, and no timestamp but the graph's generatedAt.\n */\nfunction sql(ctx: ExportContext): string {\n  const graph = ctx.graph;\n  const lines: string[] = [];\n  lines.push('BEGIN;');\n\n  // meta — provenance / toolchain fingerprint (key/value; agent can read the corpus hash).\n  lines.push('CREATE TABLE IF NOT EXISTS meta (key TEXT PRIMARY KEY, value TEXT);');\n  const meta: [string, string | null][] = [\n    ['schemaVersion', graph.schemaVersion],\n    ['generatedAt', ctx.generatedAt],\n    ['corpusHash', graph.provenance.corpusHash],\n    ['tool', graph.provenance.tool],\n    ['toolVersion', graph.provenance.version],\n    ['resolver', graph.provenance.resolver.join(',')],\n    ['fingerprint', graph.provenance.toolchain?.fingerprint ?? null],\n  ];\n  for (const [k, v] of meta) lines.push(`INSERT INTO meta VALUES (${sqlStr(k)}, ${sqlStr(v)});`);\n\n  // nodes\n  lines.push(\n    'CREATE TABLE IF NOT EXISTS nodes (id TEXT PRIMARY KEY, kind TEXT, name TEXT, qualified_name TEXT, file TEXT, span_start INTEGER, span_end INTEGER, lang TEXT, visibility TEXT, signature TEXT, importance REAL, area INTEGER, is_hub INTEGER, tested INTEGER, coverage REAL);',\n  );\n  for (const n of graph.nodes) {\n    lines.push(\n      `INSERT INTO nodes VALUES (${sqlStr(n.id)}, ${sqlStr(n.kind)}, ${sqlStr(n.name)}, ${sqlStr(n.qualifiedName)}, ${sqlStr(n.file)}, ${sqlNum(n.span.start)}, ${sqlNum(n.span.end)}, ${sqlStr(n.lang)}, ${sqlStr(n.visibility)}, ${sqlStr(n.signature)}, ${sqlNum(n.importance)}, ${sqlNum(n.area)}, ${sqlBool(n.isHub)}, ${sqlBool(n.tested)}, ${sqlNum(n.coverage)});`,\n    );\n  }\n\n  // edges — the epistemic column is the point: SELECT ... WHERE epistemic='observed'.\n  lines.push(\n    'CREATE TABLE IF NOT EXISTS edges (id TEXT PRIMARY KEY, kind TEXT, src TEXT, dst TEXT, resolution TEXT, confidence REAL, epistemic TEXT, surprise REAL, \"count\" INTEGER);',\n  );\n  for (const e of graph.edges) {\n    lines.push(\n      `INSERT INTO edges VALUES (${sqlStr(e.id)}, ${sqlStr(e.kind)}, ${sqlStr(e.src)}, ${sqlStr(e.dst)}, ${sqlStr(e.resolution)}, ${sqlNum(e.confidence)}, ${sqlStr(e.epistemic)}, ${sqlNum(e.surprise)}, ${sqlNum(e.count)});`,\n    );\n  }\n\n  // areas (+ members)\n  lines.push('CREATE TABLE IF NOT EXISTS areas (id INTEGER PRIMARY KEY, label TEXT, size INTEGER, cohesion REAL, external_edges INTEGER);');\n  lines.push('CREATE TABLE IF NOT EXISTS area_members (area_id INTEGER, node_id TEXT);');\n  for (const a of graph.areas) {\n    lines.push(`INSERT INTO areas VALUES (${sqlNum(a.id)}, ${sqlStr(a.label)}, ${sqlNum(a.size)}, ${sqlNum(a.cohesion)}, ${sqlNum(a.externalEdges)});`);\n    for (const m of a.members) lines.push(`INSERT INTO area_members VALUES (${sqlNum(a.id)}, ${sqlStr(m)});`);\n  }\n\n  // facts (+ subjects, evidence) when the graph carried them.\n  if (graph.facts && graph.facts.length) {\n    lines.push('CREATE TABLE IF NOT EXISTS facts (id TEXT PRIMARY KEY, kind TEXT, predicate_json TEXT, derived_by TEXT, confidence TEXT);');\n    lines.push('CREATE TABLE IF NOT EXISTS fact_subjects (fact_id TEXT, node_id TEXT);');\n    lines.push('CREATE TABLE IF NOT EXISTS fact_evidence (fact_id TEXT, file TEXT, span_start INTEGER, span_end INTEGER);');\n    for (const f of graph.facts) {\n      lines.push(`INSERT INTO facts VALUES (${sqlStr(f.id)}, ${sqlStr(f.kind)}, ${sqlStr(JSON.stringify(f.predicate))}, ${sqlStr(f.derivedBy)}, ${sqlStr(f.confidence)});`);\n      for (const s of f.subjectIds) lines.push(`INSERT INTO fact_subjects VALUES (${sqlStr(f.id)}, ${sqlStr(s)});`);\n      for (const ev of f.evidence) lines.push(`INSERT INTO fact_evidence VALUES (${sqlStr(f.id)}, ${sqlStr(ev.file)}, ${sqlNum(ev.span.start)}, ${sqlNum(ev.span.end)});`);\n    }\n  }\n\n  lines.push('COMMIT;');\n  return lines.join('\\n') + '\\n';\n}\n\n/** SQL string literal (single quotes doubled) or NULL for absent values. */\nfunction sqlStr(v: string | null | undefined): string {\n  if (v == null) return 'NULL';\n  return `'${v.replace(/'/g, \"''\")}'`;\n}\n/** Numeric literal or NULL for absent values. */\nfunction sqlNum(v: number | null | undefined): string {\n  return v == null || !Number.isFinite(v) ? 'NULL' : String(v);\n}\n/** Boolean as 0/1, NULL when unknown (e.g. an unanalyzable node's `tested`). */\nfunction sqlBool(v: boolean | null | undefined): string {\n  return v == null ? 'NULL' : v ? '1' : '0';\n}\n\nfunction cyclonedx(ctx: ExportContext): string {\n  // CycloneDX 1.6 JSON — dependencies as library components + local models as\n  // machine-learning-model components (AI-BOM). Deterministic ordering; no\n  // timestamps beyond the pinned generatedAt.\n  const components: unknown[] = [];\n  for (const d of ctx.deps ?? []) {\n    components.push({\n      type: 'library',\n      name: d.name,\n      version: d.installed ?? d.declared,\n      purl: d.ecosystem === 'npm' ? `pkg:npm/${d.name}@${d.installed ?? ''}` : undefined,\n    });\n  }\n  for (const m of ctx.models ?? []) {\n    components.push({ type: 'machine-learning-model', name: m.name, properties: [{ name: 'vg:runtime', value: m.runtime }] });\n  }\n  const bom = {\n    bomFormat: 'CycloneDX',\n    specVersion: '1.6',\n    metadata: { timestamp: ctx.generatedAt, tools: [{ name: 'vg', version: ctx.graph.provenance.version }] },\n    components,\n  };\n  return JSON.stringify(bom, null, 2) + '\\n';\n}\n\nfunction spdx(ctx: ExportContext): string {\n  const packages = (ctx.deps ?? []).map((d) => ({\n    SPDXID: `SPDXRef-Package-${cypherLabel(d.name)}`,\n    name: d.name,\n    versionInfo: d.installed ?? d.declared,\n    downloadLocation: 'NOASSERTION',\n  }));\n  const doc = {\n    spdxVersion: 'SPDX-2.3',\n    dataLicense: 'CC0-1.0',\n    SPDXID: 'SPDXRef-DOCUMENT',\n    name: 'vg-sbom',\n    creationInfo: { created: ctx.generatedAt, creators: [`Tool: vg-${ctx.graph.provenance.version}`] },\n    packages,\n  };\n  return JSON.stringify(doc, null, 2) + '\\n';\n}\n"]}

package/dist/{chunk-QPXVTQ7O.js → chunk-MVPRPSXU.js}

@@ -1,8 +1,8 @@
-import { stableStringify } from './chunk-ENFSSUNK.js';
+import { stableStringify } from './chunk-O3LABX6I.js';
 import * as fs from 'fs';
 import * as path from 'path';
 
-var CACHE_VERSION = "vg-parse-cache/4";
+var CACHE_VERSION = "vg-parse-cache/5";
 function cacheDir(root) {
   return path.join(root, ".vibgrate", "cache");
 }
@@ -52,6 +52,9 @@ function loadCache(root, opts) {
         if (!currentRels.has(rel)) delete data.entries[rel];
       }
     },
+    allParses() {
+      return Object.keys(data.entries).sort((a, b) => a.localeCompare(b)).map((rel) => data.entries[rel].parse);
+    },
     save() {
       fs.mkdirSync(cacheDir(root), { recursive: true });
       fs.writeFileSync(file, stableStringify(data, 0));
@@ -60,5 +63,5 @@ function loadCache(root, opts) {
 }
 
 export { cacheDir, loadCache };
-//# sourceMappingURL=chunk-QPXVTQ7O.js.map
-//# sourceMappingURL=chunk-QPXVTQ7O.js.map
+//# sourceMappingURL=chunk-MVPRPSXU.js.map
+//# sourceMappingURL=chunk-MVPRPSXU.js.map

package/dist/chunk-MVPRPSXU.js.map

@@ -0,0 +1 @@
+{"version":3,"sources":["../src/engine/cache.ts"],"names":[],"mappings":";;;;AAoBA,IAAM,aAAA,GAAgB,kBAAA;AA4Bf,SAAS,SAAS,IAAA,EAAsB;AAC7C,EAAA,OAAY,IAAA,CAAA,IAAA,CAAK,IAAA,EAAM,WAAA,EAAa,OAAO,CAAA;AAC7C;AAEA,SAAS,UAAU,IAAA,EAAsB;AACvC,EAAA,OAAY,IAAA,CAAA,IAAA,CAAK,QAAA,CAAS,IAAI,CAAA,EAAG,kBAAkB,CAAA;AACrD;AAEO,SAAS,SAAA,CACd,MACA,IAAA,EACY;AACZ,EAAA,MAAM,IAAA,GAAO,UAAU,IAAI,CAAA;AAC3B,EAAA,IAAI,IAAA,GAAkB;AAAA,IACpB,OAAA,EAAS,aAAA;AAAA,IACT,aAAa,IAAA,CAAK,WAAA;AAAA,IAClB,UAAU,IAAA,CAAK,QAAA;AAAA,IACf,SAAS;AAAC,GACZ;AAEA,EAAA,IAAI,CAAC,IAAA,CAAK,QAAA,IAAe,EAAA,CAAA,UAAA,CAAW,IAAI,CAAA,EAAG;AACzC,IAAA,IAAI;AACF,MAAA,MAAM,SAAS,IAAA,CAAK,KAAA,CAAS,EAAA,CAAA,YAAA,CAAa,IAAA,EAAM,MAAM,CAAC,CAAA;AAEvD,MAAA,IAAA,CACG,MAAA,CAAO,OAAA,KAAY,aAAA,IAAiB,MAAA,CAAO,YAAY,kBAAA,KACxD,MAAA,CAAO,WAAA,KAAgB,IAAA,CAAK,eAC5B,MAAA,CAAO,QAAA,KAAa,IAAA,CAAK,QAAA,IACzB,OAAO,OAAA,EACP;AACA,QAAA,IAAA,GAAO,EAAE,GAAG,MAAA,EAAQ,OAAA,EAAS,aAAA,EAAc;AAAA,MAC7C;AAAA,IACF,CAAA,CAAA,MAAQ;AAAA,IAER;AAAA,EACF;AAEA,EAAA,OAAO;AAAA,IACL,GAAA,CAAI,KAAK,IAAA,EAAM;AACb,MAAA,MAAM,KAAA,GAAQ,IAAA,CAAK,OAAA,CAAQ,GAAG,CAAA;AAC9B,MAAA,OAAO,KAAA,IAAS,KAAA,CAAM,IAAA,KAAS,IAAA,GAAO,MAAM,KAAA,GAAQ,MAAA;AAAA,IACtD,CAAA;AAAA,IACA,SAAA,CAAU,GAAA,EAAK,OAAA,EAAS,IAAA,EAAM;AAC5B,MAAA,MAAM,KAAA,GAAQ,IAAA,CAAK,OAAA,CAAQ,GAAG,CAAA;AAC9B,MAAA,IAAI,CAAC,OAAO,OAAO,MAAA;AACnB,MAAA,IAAI,MAAM,OAAA,KAAY,OAAA,IAAW,MAAM,IAAA,KAAS,IAAA,IAAQ,MAAM,KAAA,EAAO;AACnE,QAAA,OAAO,EAAE,KAAA,EAAO,KAAA,CAAM,KAAA,EAAO,IAAA,EAAM,MAAM,IAAA,EAAK;AAAA,MAChD;AACA,MAAA,OAAO,MAAA;AAAA,IACT,CAAA;AAAA,IACA,GAAA,CAAI,GAAA,EAAK,KAAA,EAAO,IAAA,EAAM;AACpB,MAAA,IAAA,CAAK,OAAA,CAAQ,GAAG,CAAA,GAAI;AAAA,QAClB,MAAM,KAAA,CAAM,IAAA;AAAA,QACZ,KAAA;AAAA,QACA,SAAS,IAAA,EAAM,OAAA;AAAA,QACf,MAAM,IAAA,EAAM;AAAA,OACd;AAAA,IACF,CAAA;AAAA,IACA,MAAM,WAAA,EAAa;AACjB,MAAA,KAAA,MAAW,GAAA,IAAO,MAAA,CAAO,IAAA,CAAK,IAAA,CAAK,OAAO,CAAA,EAAG;AAC3C,QAAA,IAAI,CAAC,YAAY,GAAA,CAAI,GAAG,GAAG,OAAO,IAAA,CAAK,QAAQ,GAAG,CAAA;AAAA,MACpD;AAAA,IACF,CAAA;AAAA,IACA,SAAA,GAAY;AACV,MAAA,OAAO,MAAA,CAAO,KAAK,IAAA,CAAK,OAAO,EAC5B,IAAA,CAAK,CAAC,GAAG,CAAA,KAAM,CAAA,CAAE,cAAc,CAAC,CAAC,EACjC,GAAA,CAAI,CAAC,QAAQ,IAAA,CAAK,OAAA,CAAQ,GAAG,CAAA,CAAG,KAAK,CAAA;AAAA,IAC1C,CAAA;AAAA,IACA,IAAA,GAAO;AACL,MAAG,aAAU,QAAA,CAAS,IAAI,GAAG,EAAE,SAAA,EAAW,MAAM,CAAA;AAChD,MAAG,EAAA,CAAA,aAAA,CAAc,IAAA,EAAM,eAAA,CAAgB,IAAA,EAAM,CAAC,CAAC,CAAA;AAAA,IACjD;AAAA,GACF;AACF","file":"chunk-MVPRPSXU.js","sourcesContent":["import * as fs from 'node:fs';\nimport * as path from 'node:path';\nimport { stableStringify } from './serialize.js';\nimport type { FileParse } from './types.js';\n\n/**\n * Incremental parse cache. Maps a file's content hash to its parsed\n * symbol/edge tables, so a rebuild re-parses only files whose content actually\n * changed (VG-DEVELOPMENT-PLAN Phase 0.4). Lives under `.vibgrate/cache/` and is\n * gitignored — never part of the committed artifact.\n *\n * The cache is a pure performance optimisation: a reused FileParse is identical\n * to a freshly-parsed one (parsing is pure over content), so the graph is\n * byte-identical whether or not the cache was warm. CI-enforced by the\n * mutation-corpus identity gate (incremental-identity.test.ts): warm\n * incremental rebuild ≡ cold full rebuild, byte for byte, across\n * edit/add/delete/rename/touch mutations and the production refresh path.\n */\n\n// Bumped to /4: optional mtime+size fingerprint for stat-skip fast path.\nconst CACHE_VERSION = 'vg-parse-cache/5';\n\ninterface CacheEntry {\n  hash: string;\n  mtimeMs?: number;\n  size?: number;\n  parse: FileParse;\n}\n\ninterface CacheFile {\n  version: string;\n  toolVersion: string;\n  grammars: string;\n  entries: Record<string, CacheEntry>;\n}\n\nexport interface ParseCache {\n  get(rel: string, hash: string): FileParse | undefined;\n  /** Fast path: mtime+size match → reuse parse without re-reading bytes. */\n  getByStat(rel: string, mtimeMs: number, size: number): { parse: FileParse; hash: string } | undefined;\n  set(rel: string, parse: FileParse, stat?: { mtimeMs: number; size: number }): void;\n  /** Drop entries for files no longer present. */\n  prune(currentRels: Set<string>): void;\n  /** Every cached parse, sorted by rel — used to recover architecture roles. */\n  allParses(): FileParse[];\n  save(): void;\n}\n\nexport function cacheDir(root: string): string {\n  return path.join(root, '.vibgrate', 'cache');\n}\n\nfunction cachePath(root: string): string {\n  return path.join(cacheDir(root), 'parse-cache.json');\n}\n\nexport function loadCache(\n  root: string,\n  opts: { toolVersion: string; grammars: string; disabled?: boolean },\n): ParseCache {\n  const file = cachePath(root);\n  let data: CacheFile = {\n    version: CACHE_VERSION,\n    toolVersion: opts.toolVersion,\n    grammars: opts.grammars,\n    entries: {},\n  };\n\n  if (!opts.disabled && fs.existsSync(file)) {\n    try {\n      const loaded = JSON.parse(fs.readFileSync(file, 'utf8')) as CacheFile;\n      // Accept v3 → v4 (stat fields optional).\n      if (\n        (loaded.version === CACHE_VERSION || loaded.version === 'vg-parse-cache/3') &&\n        loaded.toolVersion === opts.toolVersion &&\n        loaded.grammars === opts.grammars &&\n        loaded.entries\n      ) {\n        data = { ...loaded, version: CACHE_VERSION };\n      }\n    } catch {\n      /* corrupt cache — start fresh */\n    }\n  }\n\n  return {\n    get(rel, hash) {\n      const entry = data.entries[rel];\n      return entry && entry.hash === hash ? entry.parse : undefined;\n    },\n    getByStat(rel, mtimeMs, size) {\n      const entry = data.entries[rel];\n      if (!entry) return undefined;\n      if (entry.mtimeMs === mtimeMs && entry.size === size && entry.parse) {\n        return { parse: entry.parse, hash: entry.hash };\n      }\n      return undefined;\n    },\n    set(rel, parse, stat) {\n      data.entries[rel] = {\n        hash: parse.hash,\n        parse,\n        mtimeMs: stat?.mtimeMs,\n        size: stat?.size,\n      };\n    },\n    prune(currentRels) {\n      for (const rel of Object.keys(data.entries)) {\n        if (!currentRels.has(rel)) delete data.entries[rel];\n      }\n    },\n    allParses() {\n      return Object.keys(data.entries)\n        .sort((a, b) => a.localeCompare(b))\n        .map((rel) => data.entries[rel]!.parse);\n    },\n    save() {\n      fs.mkdirSync(cacheDir(root), { recursive: true });\n      fs.writeFileSync(file, stableStringify(data, 0));\n    },\n  };\n}\n"]}

package/dist/{chunk-DT4KIVRI.js → chunk-NG4KIJW6.js}

@@ -480,6 +480,38 @@ var FileCache = class _FileCache {
     this.walkCache.set(rootDir, promise);
     return promise;
   }
+  /**
+   * Entries under `absDir`, reusing an already-cached ancestor walk when one
+   * exists. Per-project scanners must call this instead of `walkDir(projectDir)`
+   * so a large monorepo is not re-walked once per package.
+   *
+   * `relPath` is rebased to `absDir` so callers see the same shape as a
+   * fresh `walkDir` of that directory.
+   */
+  async walkDirUnder(absDir) {
+    const resolved = path2.resolve(absDir);
+    let exact;
+    let bestAncestor;
+    for (const [key, promise] of this.walkCache) {
+      const cachedRoot = path2.resolve(key);
+      if (cachedRoot === resolved) {
+        exact = promise;
+        break;
+      }
+      const rel = path2.relative(cachedRoot, resolved);
+      if (!rel || rel.startsWith("..") || path2.isAbsolute(rel)) continue;
+      if (!bestAncestor || cachedRoot.length > path2.resolve(bestAncestor.root).length) {
+        bestAncestor = { root: key, promise };
+      }
+    }
+    if (exact) return exact;
+    if (bestAncestor) {
+      const entries = await bestAncestor.promise;
+      const prefix = resolved.endsWith(path2.sep) ? resolved : resolved + path2.sep;
+      return entries.filter((e) => e.absPath === resolved || e.absPath.startsWith(prefix)).map((e) => ({ ...e, relPath: path2.relative(resolved, e.absPath) }));
+    }
+    return this.walkDir(resolved);
+  }
   /** Return tree summary from the cached walk, if available. */
   getWalkSummary(rootDir) {
     return this.walkSummary.get(rootDir);
@@ -952,5 +984,5 @@ async function writeTextFile(filePath, content) {
 }
 
 export { FileCache, SKIP_DIRS, SOURCE_EXCLUDE_FILES, Semaphore, bytesInDir, countFilesInDir, ensureDir, findCsprojFiles, findFiles, findPackageJsonFiles, findSolutionFiles, isSkippedDirName, normalizeGlobForRipgrep, parseExcludePatterns, pathExists, quickTreeCount, readJsonFile, readTextFile, stripBom, writeJsonFile, writeTextFile };
-//# sourceMappingURL=chunk-DT4KIVRI.js.map
-//# sourceMappingURL=chunk-DT4KIVRI.js.map
+//# sourceMappingURL=chunk-NG4KIJW6.js.map
+//# sourceMappingURL=chunk-NG4KIJW6.js.map

package/dist/chunk-NG4KIJW6.js.map

@@ -0,0 +1 @@
+{"version":3,"sources":["../src/core-open/utils/semaphore.ts","../src/core-open/utils/glob.ts","../src/core-open/utils/fs.ts"],"names":["resolve","path","stat"],"mappings":";;;;;;;;;;AAIO,IAAM,YAAN,MAAgB;AAAA,EACb,SAAA;AAAA,EACA,QAA2B,EAAC;AAAA,EAEpC,YAAY,GAAA,EAAa;AACvB,IAAA,IAAA,CAAK,SAAA,GAAY,GAAA;AAAA,EACnB;AAAA,EAEA,MAAM,IAAO,EAAA,EAAkC;AAC7C,IAAA,MAAM,KAAK,OAAA,EAAQ;AACnB,IAAA,IAAI;AACF,MAAA,OAAO,MAAM,EAAA,EAAG;AAAA,IAClB,CAAA,SAAE;AACA,MAAA,IAAA,CAAK,OAAA,EAAQ;AAAA,IACf;AAAA,EACF;AAAA,EAEQ,OAAA,GAAyB;AAC/B,IAAA,IAAI,IAAA,CAAK,YAAY,CAAA,EAAG;AACtB,MAAA,IAAA,CAAK,SAAA,EAAA;AACL,MAAA,OAAO,QAAQ,OAAA,EAAQ;AAAA,IACzB;AACA,IAAA,OAAO,IAAI,QAAQ,CAACA,QAAAA,KAAY,KAAK,KAAA,CAAM,IAAA,CAAKA,QAAO,CAAC,CAAA;AAAA,EAC1D;AAAA,EAEQ,OAAA,GAAU;AAChB,IAAA,MAAM,IAAA,GAAO,IAAA,CAAK,KAAA,CAAM,KAAA,EAAM;AAC9B,IAAA,IAAI,MAAM,IAAA,EAAK;AAAA,SACV,IAAA,CAAK,SAAA,EAAA;AAAA,EACZ;AACF;ACCO,SAAS,qBAAqB,KAAA,EAAgD;AACnF,EAAA,IAAI,KAAA,KAAU,MAAA,EAAW,OAAO,EAAC;AACjC,EAAA,MAAM,MAAM,KAAA,CAAM,OAAA,CAAQ,KAAK,CAAA,GAAI,KAAA,GAAQ,CAAC,KAAK,CAAA;AACjD,EAAA,MAAM,MAAgB,EAAC;AACvB,EAAA,KAAA,MAAW,SAAS,GAAA,EAAK;AACvB,IAAA,KAAA,MAAW,IAAA,IAAQ,KAAA,CAAM,KAAA,CAAM,MAAM,CAAA,EAAG;AACtC,MAAA,MAAM,OAAA,GAAU,KAAK,IAAA,EAAK;AAC1B,MAAA,IAAI,OAAA,EAAS,GAAA,CAAI,IAAA,CAAK,OAAO,CAAA;AAAA,IAC/B;AAAA,EACF;AACA,EAAA,OAAO,CAAC,GAAG,IAAI,GAAA,CAAI,GAAG,CAAC,CAAA;AACzB;AAEO,SAAS,aAAa,QAAA,EAA2D;AACtF,EAAA,IAAI,QAAA,CAAS,MAAA,KAAW,CAAA,EAAG,OAAO,IAAA;AAElC,EAAA,MAAM,QAAA,GAAW,SAAS,GAAA,CAAI,CAAC,MAAM,UAAA,CAAW,SAAA,CAAU,CAAC,CAAC,CAAC,CAAA;AAE7D,EAAA,OAAO,CAAC,OAAA,KAAoB;AAC1B,IAAA,MAAM,IAAA,GAAO,UAAU,OAAO,CAAA;AAC9B,IAAA,OAAO,SAAS,IAAA,CAAK,CAAC,CAAA,KAAM,CAAA,CAAE,IAAI,CAAC,CAAA;AAAA,EACrC,CAAA;AACF;AAEA,SAAS,UAAU,CAAA,EAAmB;AAEpC,EAAA,OAAO,CAAA,CAAE,MAAWC,KAAA,CAAA,GAAG,CAAA,CAAE,KAAK,GAAG,CAAA,CAAE,OAAA,CAAQ,MAAA,EAAQ,EAAE,CAAA;AACvD;AAEA,SAAS,WAAW,OAAA,EAAyC;AAG3D,EAAA,IAAI,CAAC,QAAQ,QAAA,CAAS,GAAG,KAAK,CAAC,YAAA,CAAa,OAAO,CAAA,EAAG;AACpD,IAAA,MAAM,SAAS,OAAA,GAAU,GAAA;AACzB,IAAA,OAAO,CAAC,CAAA,KAAM,CAAA,KAAM,OAAA,IAAW,CAAA,CAAE,WAAW,MAAM,CAAA;AAAA,EACpD;AAEA,EAAA,MAAM,EAAA,GAAK,YAAY,OAAO,CAAA;AAC9B,EAAA,OAAO,CAAC,CAAA,KAAM,EAAA,CAAG,IAAA,CAAK,CAAC,CAAA;AACzB;AAEA,SAAS,aAAa,CAAA,EAAoB;AACxC,EAAA,OAAO,WAAA,CAAY,KAAK,CAAC,CAAA;AAC3B;AAEA,SAAS,YAAY,OAAA,EAAyB;AAC5C,EAAA,IAAI,CAAA,GAAI,CAAA;AACR,EAAA,IAAI,EAAA,GAAK,GAAA;AACT,EAAA,MAAM,MAAM,OAAA,CAAQ,MAAA;AAEpB,EAAA,OAAO,IAAI,GAAA,EAAK;AACd,IAAA,MAAM,EAAA,GAAK,QAAQ,CAAC,CAAA;AAEpB,IAAA,IAAI,OAAO,GAAA,EAAK;AACd,MAAA,IAAI,OAAA,CAAQ,CAAA,GAAI,CAAC,CAAA,KAAM,GAAA,EAAK;AAE1B,QAAA,CAAA,IAAK,CAAA;AACL,QAAA,IAAI,OAAA,CAAQ,CAAC,CAAA,KAAM,GAAA,EAAK;AAEtB,UAAA,CAAA,EAAA;AACA,UAAA,EAAA,IAAM,UAAA;AAAA,QACR,CAAA,MAAO;AAEL,UAAA,EAAA,IAAM,IAAA;AAAA,QACR;AAAA,MACF,CAAA,MAAO;AAEL,QAAA,CAAA,EAAA;AACA,QAAA,EAAA,IAAM,OAAA;AAAA,MACR;AAAA,IACF,CAAA,MAAA,IAAW,OAAO,GAAA,EAAK;AACrB,MAAA,CAAA,EAAA;AACA,MAAA,EAAA,IAAM,MAAA;AAAA,IACR,CAAA,MAAA,IAAW,OAAO,GAAA,EAAK;AAErB,MAAA,MAAM,KAAA,GAAQ,CAAA;AACd,MAAA,CAAA,EAAA;AACA,MAAA,OAAO,CAAA,GAAI,GAAA,IAAO,OAAA,CAAQ,CAAC,MAAM,GAAA,EAAK,CAAA,EAAA;AACtC,MAAA,CAAA,EAAA;AACA,MAAA,EAAA,IAAM,OAAA,CAAQ,KAAA,CAAM,KAAA,EAAO,CAAC,CAAA;AAAA,IAC9B,CAAA,MAAA,IAAW,OAAO,GAAA,EAAK;AAErB,MAAA,CAAA,EAAA;AACA,MAAA,MAAM,eAAyB,EAAC;AAChC,MAAA,IAAI,OAAA,GAAU,EAAA;AACd,MAAA,OAAO,CAAA,GAAI,GAAA,IAAO,OAAA,CAAQ,CAAC,MAAM,GAAA,EAAK;AACpC,QAAA,IAAI,OAAA,CAAQ,CAAC,CAAA,KAAM,GAAA,EAAK;AACtB,UAAA,YAAA,CAAa,KAAK,OAAO,CAAA;AACzB,UAAA,OAAA,GAAU,EAAA;AAAA,QACZ,CAAA,MAAO;AACL,UAAA,OAAA,IAAW,QAAQ,CAAC,CAAA;AAAA,QACtB;AACA,QAAA,CAAA,EAAA;AAAA,MACF;AACA,MAAA,YAAA,CAAa,KAAK,OAAO,CAAA;AACzB,MAAA,CAAA,EAAA;AACA,MAAA,EAAA,IAAM,QAAQ,YAAA,CAAa,GAAA,CAAI,WAAW,CAAA,CAAE,IAAA,CAAK,GAAG,CAAA,GAAI,GAAA;AAAA,IAC1D,CAAA,MAAO;AACL,MAAA,EAAA,IAAM,YAAY,EAAE,CAAA;AACpB,MAAA,CAAA,EAAA;AAAA,IACF;AAAA,EACF;AAEA,EAAA,EAAA,IAAM,GAAA;AACN,EAAA,OAAO,IAAI,OAAO,EAAE,CAAA;AACtB;AAEA,SAAS,YAAY,CAAA,EAAmB;AACtC,EAAA,OAAO,CAAA,CAAE,OAAA,CAAQ,qBAAA,EAAuB,MAAM,CAAA;AAChD;;;AClIA,IAAM,aAAA,GAAgB,UAAU,QAAQ,CAAA;AAoBxC,eAAe,qBAAA,CAAsB,KAAa,MAAA,EAAqD;AACrG,EAAA,IAAI;AACF,IAAA,MAAM,MAAM,MAAS,EAAA,CAAA,QAAA,CAAc,WAAK,GAAA,EAAK,YAAY,GAAG,MAAM,CAAA;AAClE,IAAA,OAAO,CAAC,GAAG,MAAA,EAAQ,EAAE,GAAA,EAAK,EAAA,EAAI,MAAA,EAAO,CAAE,GAAA,CAAI,GAAG,CAAA,EAAG,CAAA;AAAA,EACnD,CAAA,CAAA,MAAQ;AACN,IAAA,OAAO,MAAA;AAAA,EACT;AACF;AAQA,SAAS,YAAA,CAAa,MAAA,EAA0B,OAAA,EAAiB,KAAA,EAAyB;AACxF,EAAA,IAAI,MAAA,CAAO,MAAA,KAAW,CAAA,EAAG,OAAO,KAAA;AAChC,EAAA,IAAI,OAAA,GAAU,KAAA;AACd,EAAA,KAAA,MAAW,EAAE,GAAA,EAAK,EAAA,EAAG,IAAK,MAAA,EAAQ;AAChC,IAAA,MAAM,GAAA,GAAW,KAAA,CAAA,QAAA,CAAS,GAAA,EAAK,OAAO,CAAA;AACtC,IAAA,IAAI,CAAC,GAAA,IAAO,GAAA,CAAI,UAAA,CAAW,IAAI,CAAA,EAAG;AAClC,IAAA,MAAM,WAAW,GAAA,CAAI,KAAA,CAAW,KAAA,CAAA,GAAG,CAAA,CAAE,KAAK,GAAG,CAAA;AAC7C,IAAA,MAAM,QAAA,GAAW,KAAA,GAAQ,CAAA,EAAG,QAAQ,CAAA,CAAA,CAAA,GAAM,QAAA;AAC1C,IAAA,MAAM,MAAA,GAAS,EAAA,CAAG,IAAA,CAAK,QAAQ,CAAA;AAC/B,IAAA,IAAI,MAAA,CAAO,SAAS,OAAA,GAAU,IAAA;AAAA,SAAA,IACrB,MAAA,CAAO,WAAW,OAAA,GAAU,KAAA;AAAA,EACvC;AACA,EAAA,OAAO,OAAA;AACT;AAoBO,IAAM,SAAA,uBAAgB,GAAA,CAAI;AAAA;AAAA,EAE/B,MAAA;AAAA,EAAQ,MAAA;AAAA,EAAQ,KAAA;AAAA,EAChB,OAAA;AAAA,EAAS,SAAA;AAAA,EAAW,KAAA;AAAA;AAAA,EAEpB,SAAA;AAAA,EACA,WAAA;AAAA,EAAa,WAAA;AAAA,EAAa,QAAA;AAAA,EAAU,QAAA;AAAA;AAAA,EAGpC,cAAA;AAAA;AAAA,EACA,kBAAA;AAAA;AAAA,EACA,eAAA;AAAA;AAAA,EACA,aAAA;AAAA;AAAA,EACA,aAAA;AAAA;AAAA,EACA,OAAA;AAAA;AAAA;AAAA,EAGA,OAAA;AAAA,EAAS,OAAA;AAAA,EAAS,SAAA;AAAA,EAAW,aAAA;AAAA,EAAe,QAAA;AAAA,EAC5C,SAAA;AAAA,EAAW,UAAA;AAAA,EAAY,UAAA;AAAA,EAAY,eAAA;AAAA,EAAiB,aAAA;AAAA,EACpD,kBAAA;AAAA;AAAA,EAGA,MAAA;AAAA,EAAQ,OAAA;AAAA,EAAS,KAAA;AAAA,EAAO,UAAA;AAAA;AAAA,EAGxB,QAAA;AAAA;AAAA,EACA,MAAA;AAAA;AAAA,EACA,UAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAKA,OAAA;AAAA,EAAS,MAAA;AAAA,EAAQ,YAAA;AAAA,EAAc,MAAA;AAAA,EAAQ,MAAA;AAAA,EACvC,aAAA;AAAA,EAAe,aAAA;AAAA,EAAe,eAAA;AAAA,EAAiB,aAAA;AAAA,EAC/C,OAAA;AAAA,EAAS,oBAAA;AAAA;AAAA,EAGT,SAAA;AAAA;AAAA;AAAA,EAGA,QAAA;AAAA;AAAA,EAGA,SAAA;AAAA,EAAW,KAAA;AAAA,EAAO,KAAA;AAAA,EAAO,aAAA;AAAA;AAAA,EAGzB,QAAA;AAAA,EAAU,UAAA;AAAA,EAAY,aAAA;AAAA;AAAA,EAGtB,YAAA;AAAA;AAAA,EAGA,QAAA;AAAA,EAAU,MAAA;AAAA;AAAA,EAGV,eAAA;AAAA,EAAiB,aAAA;AAAA;AAAA,EAGjB,YAAA;AAAA,EAAc,aAAA;AAAA,EAAe,SAAA;AAAA,EAAW;AAC1C,CAAC;AAQM,SAAS,iBAAiB,IAAA,EAAuB;AACtD,EAAA,IAAI,CAAC,MAAM,OAAO,KAAA;AAClB,EAAA,IAAI,SAAA,CAAU,GAAA,CAAI,IAAI,CAAA,EAAG,OAAO,IAAA;AAChC,EAAA,IAAI,IAAA,CAAK,WAAW,OAAO,CAAA,IAAK,KAAK,UAAA,CAAW,OAAO,GAAG,OAAO,IAAA;AACjE,EAAA,IAAI,IAAA,KAAS,iBAAiB,OAAO,IAAA;AACrC,EAAA,OAAO,KAAA;AACT;AAGA,IAAM,eAAA,uBAAsB,GAAA,CAAI;AAAA;AAAA,EAE9B,OAAA;AAAA,EAAS,QAAA;AAAA,EAAU,MAAA;AAAA,EAAQ,MAAA;AAAA,EAAQ,MAAA;AAAA;AAAA,EAEnC,MAAA;AAAA,EAAQ,MAAA;AAAA,EAAQ,OAAA;AAAA,EAAS,MAAA;AAAA,EAAQ,MAAA;AAAA,EAAQ,MAAA;AAAA,EAAQ,OAAA;AAAA,EAAS,MAAA;AAAA,EAAQ,OAAA;AAAA,EAAS,OAAA;AAAA,EAAS,MAAA;AAAA,EACpF,OAAA;AAAA,EAAS,OAAA;AAAA,EAAS,OAAA;AAAA,EAAS,MAAA;AAAA,EAAQ,KAAA;AAAA,EAAO,MAAA;AAAA,EAAQ,MAAA;AAAA,EAAQ,MAAA;AAAA,EAAQ,MAAA;AAAA,EAAQ,MAAA;AAAA;AAAA,EAE1E,MAAA;AAAA,EAAQ,OAAA;AAAA,EAAS,MAAA;AAAA,EAAQ,MAAA;AAAA,EAAQ,MAAA;AAAA,EAAQ,MAAA;AAAA,EAAQ,MAAA;AAAA,EAAQ,MAAA;AAAA,EAAQ,MAAA;AAAA,EAAQ,OAAA;AAAA,EAAS,MAAA;AAAA,EAAQ,MAAA;AAAA;AAAA,EAE1F,MAAA;AAAA,EAAQ,MAAA;AAAA,EAAQ,MAAA;AAAA,EAAQ,OAAA;AAAA,EAAS,MAAA;AAAA,EAAQ,MAAA;AAAA,EAAQ,MAAA;AAAA,EAAQ,OAAA;AAAA,EAAS,OAAA;AAAA,EAAS,MAAA;AAAA,EAAQ,OAAA;AAAA;AAAA,EAEnF,MAAA;AAAA,EAAQ,MAAA;AAAA,EAAQ,KAAA;AAAA,EAAO,MAAA;AAAA,EAAQ,KAAA;AAAA,EAAO,MAAA;AAAA;AAAA,EAEtC,MAAA;AAAA,EAAQ,MAAA;AAAA,EAAQ,KAAA;AAAA,EAAO,QAAA;AAAA,EAAU,IAAA;AAAA,EAAM,IAAA;AAAA,EAAM,QAAA;AAAA,EAAU,MAAA;AAAA,EAAQ,MAAA;AAAA;AAAA,EAE/D;AACF,CAAC,CAAA;AAID,IAAM,eAAA,mBAAkB,IAAI,GAAA,CAAY,EAAE,CAAA;AAgBnC,IAAM,oBAAA,uBAA2B,GAAA,CAAI;AAAA;AAAA,EAE1C,mBAAA;AAAA,EAAqB,qBAAA;AAAA,EAAuB,WAAA;AAAA,EAC5C,gBAAA;AAAA,EAAkB,WAAA;AAAA,EAAa,UAAA;AAAA,EAAY,WAAA;AAAA,EAC3C,UAAA;AAAA,EAAY,gBAAA;AAAA;AAAA;AAAA,EAEZ,aAAA;AAAA,EAAe,cAAA;AAAA,EAAgB,UAAA;AAAA,EAAY,SAAA;AAAA,EAC3C,aAAA;AAAA;AAAA,EACA,gBAAA;AAAA;AAAA,EAEA,cAAA;AAAA;AAAA,EAEA,eAAA;AAAA;AAAA,EAEA,YAAA;AAAA;AAAA,EAEA,QAAA;AAAA,EAAU,aAAA;AAAA,EAAe,YAAA;AAAA,EAAc,YAAA;AAAA;AAAA,EAEvC,oBAAA;AAAA;AAAA,EAEA,iBAAA;AAAA;AAAA,EAEA,kBAAA;AAAA;AAAA,EAEA,cAAA;AAAA;AAAA,EAEA,UAAA;AAAA;AAAA,EAEA,sBAAA;AAAA,EAAwB,iBAAA;AAAA;AAAA,EAExB,eAAA;AAAA;AAAA,EAEA,WAAA;AAAA;AAAA,EAEA,mBAAA;AAAA;AAAA,EAEA,cAAA;AAAA,EAAgB,mBAAA;AAAA;AAAA,EAEhB,qBAAA;AAAA;AAAA,EAEA,YAAA;AAAA;AAAA,EAEA,YAAA;AAAA;AAAA,EAEA,mBAAA;AAAA;AAAA,EAEA;AACF,CAAC;AA0BD,IAAM,oBAAA,GAAuB,OAAA;AAgBtB,IAAM,SAAA,GAAN,MAAM,UAAA,CAAU;AAAA;AAAA,EAEb,SAAA,uBAAgB,GAAA,EAAiC;AAAA;AAAA,EAEjD,SAAA,uBAAgB,GAAA,EAA6B;AAAA;AAAA,EAE7C,SAAA,uBAAgB,GAAA,EAA8B;AAAA;AAAA,EAE9C,WAAA,uBAAkB,GAAA,EAA8B;AAAA;AAAA,EAEhD,gBAAA,GAA0D,IAAA;AAAA;AAAA,EAE1D,cAAwB,EAAC;AAAA;AAAA,EAEzB,qBAA+B,EAAC;AAAA;AAAA,EAEhC,YAAA,GAAe,CAAA;AAAA;AAAA,EAEf,mBAAA,GAAsB,IAAA;AAAA;AAAA,EAEtB,iBAAA,GAAoB,KAAA;AAAA;AAAA,EAEpB,QAAA,GAA0B,IAAA;AAAA;AAAA,EAE1B,WAAA,uBAAkB,GAAA,EAAuB;AAAA;AAAA,EAEzC,aAAA,uBAAoB,GAAA,EAAmC;AAAA;AAAA,EAEvD,SAAA,uBAAgB,GAAA,EAA6B;AAAA;AAAA,EAE7C,OAAA,GAAU,IAAI,SAAA,CAAU,EAAE,CAAA;AAAA;AAAA,EAGlC,mBAAmB,QAAA,EAA0B;AAC3C,IAAA,IAAA,CAAK,gBAAA,GAAmB,aAAa,QAAQ,CAAA;AAAA,EAC/C;AAAA;AAAA,EAGA,eAAe,KAAA,EAAqB;AAClC,IAAA,IAAA,CAAK,YAAA,GAAe,KAAA;AAAA,EACtB;AAAA;AAAA;AAAA,EAIA,sBAAsB,EAAA,EAAkB;AACtC,IAAA,IAAA,CAAK,mBAAA,GAAsB,EAAA;AAAA,EAC7B;AAAA;AAAA,EAGA,IAAI,kBAAA,GAA6B;AAC/B,IAAA,OAAO,IAAA,CAAK,mBAAA;AAAA,EACd;AAAA;AAAA,EAGA,aAAa,OAAA,EAAuB;AAClC,IAAA,IAAA,CAAK,WAAA,CAAY,KAAK,OAAO,CAAA;AAAA,EAC/B;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAOA,qBAAA,GAAiC;AAC/B,IAAA,IAAI,IAAA,CAAK,mBAAmB,OAAO,KAAA;AACnC,IAAA,IAAA,CAAK,iBAAA,GAAoB,IAAA;AACzB,IAAA,OAAO,IAAA;AAAA,EACT;AAAA;AAAA,EAGA,IAAI,UAAA,GAAgC;AAClC,IAAA,OAAO,IAAA,CAAK,WAAA;AAAA,EACd;AAAA;AAAA,EAGA,IAAI,SAAA,GAA+B;AACjC,IAAA,OAAO,IAAA,CAAK,WAAA;AAAA,EACd;AAAA;AAAA,EAGA,IAAI,iBAAA,GAAuC;AACzC,IAAA,OAAO,IAAA,CAAK,kBAAA;AAAA,EACd;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAYA,OAAA,CAAQ,SAAiB,UAAA,EAAqF;AAC5G,IAAA,IAAA,CAAK,QAAA,GAAW,OAAA;AAChB,IAAA,MAAM,MAAA,GAAS,IAAA,CAAK,SAAA,CAAU,GAAA,CAAI,OAAO,CAAA;AACzC,IAAA,IAAI,QAAQ,OAAO,MAAA;AAEnB,IAAA,MAAM,OAAA,GAAU,IAAA,CAAK,OAAA,CAAQ,OAAA,EAAS,UAAU,CAAA;AAChD,IAAA,IAAA,CAAK,SAAA,CAAU,GAAA,CAAI,OAAA,EAAS,OAAO,CAAA;AACnC,IAAA,OAAO,OAAA;AAAA,EACT;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAUA,MAAM,aAAa,MAAA,EAAqC;AACtD,IAAA,MAAM,QAAA,GAAgB,cAAQ,MAAM,CAAA;AAEpC,IAAA,IAAI,KAAA;AACJ,IAAA,IAAI,YAAA;AACJ,IAAA,KAAA,MAAW,CAAC,GAAA,EAAK,OAAO,CAAA,IAAK,KAAK,SAAA,EAAW;AAC3C,MAAA,MAAM,UAAA,GAAkB,cAAQ,GAAG,CAAA;AACnC,MAAA,IAAI,eAAe,QAAA,EAAU;AAC3B,QAAA,KAAA,GAAQ,OAAA;AACR,QAAA;AAAA,MACF;AACA,MAAA,MAAM,GAAA,GAAW,KAAA,CAAA,QAAA,CAAS,UAAA,EAAY,QAAQ,CAAA;AAC9C,MAAA,IAAI,CAAC,OAAO,GAAA,CAAI,UAAA,CAAW,IAAI,CAAA,IAAU,KAAA,CAAA,UAAA,CAAW,GAAG,CAAA,EAAG;AAC1D,MAAA,IAAI,CAAC,gBAAgB,UAAA,CAAW,MAAA,GAAc,cAAQ,YAAA,CAAa,IAAI,EAAE,MAAA,EAAQ;AAC/E,QAAA,YAAA,GAAe,EAAE,IAAA,EAAM,GAAA,EAAK,OAAA,EAAQ;AAAA,MACtC;AAAA,IACF;AACA,IAAA,IAAI,OAAO,OAAO,KAAA;AAElB,IAAA,IAAI,YAAA,EAAc;AAChB,MAAA,MAAM,OAAA,GAAU,MAAM,YAAA,CAAa,OAAA;AACnC,MAAA,MAAM,SAAS,QAAA,CAAS,QAAA,CAAc,KAAA,CAAA,GAAG,CAAA,GAAI,WAAW,QAAA,GAAgB,KAAA,CAAA,GAAA;AACxE,MAAA,OAAO,OAAA,CACJ,MAAA,CAAO,CAAC,CAAA,KAAM,CAAA,CAAE,YAAY,QAAA,IAAY,CAAA,CAAE,OAAA,CAAQ,UAAA,CAAW,MAAM,CAAC,EACpE,GAAA,CAAI,CAAC,CAAA,MAAO,EAAE,GAAG,CAAA,EAAG,OAAA,EAAc,KAAA,CAAA,QAAA,CAAS,QAAA,EAAU,CAAA,CAAE,OAAO,CAAA,EAAE,CAAE,CAAA;AAAA,IACvE;AAEA,IAAA,OAAO,IAAA,CAAK,QAAQ,QAAQ,CAAA;AAAA,EAC9B;AAAA;AAAA,EAGA,eAAe,OAAA,EAAwC;AACrD,IAAA,OAAO,IAAA,CAAK,WAAA,CAAY,GAAA,CAAI,OAAO,CAAA;AAAA,EACrC;AAAA;AAAA,EAGA,OAAwB,UAAA,GAAa,eAAA;AAAA,EAErC,MAAc,OAAA,CAAQ,OAAA,EAAiB,UAAA,EAAqF;AAC1H,IAAA,MAAM,UAAsB,EAAC;AAC7B,IAAA,MAAM,KAAA,GAAQ,OAAU,EAAA,CAAA,oBAAA,KAAyB,UAAA,GAAgB,yBAAqB,GAAO,EAAA,CAAA,IAAA,GAAO,MAAA,IAAU,CAAA;AAC9G,IAAA,MAAM,kBAAA,GAAqB,KAAK,GAAA,CAAI,CAAA,EAAG,KAAK,GAAA,CAAI,EAAA,EAAI,KAAA,GAAQ,CAAC,CAAC,CAAA;AAC9D,IAAA,IAAI,UAAA,GAAa,CAAA;AACjB,IAAA,IAAI,YAAA,GAAe,CAAA;AACnB,IAAA,MAAM,eAAA,GAAkB,EAAA;AAKxB,IAAA,MAAM,GAAA,GAAM,IAAI,SAAA,CAAU,kBAAkB,CAAA;AAC5C,IAAA,MAAM,mBAAmB,IAAA,CAAK,mBAAA;AAE9B,IAAA,MAAM,YAAY,UAAA,CAAU,UAAA;AAC5B,IAAA,MAAM,aAAa,IAAA,CAAK,gBAAA;AACxB,IAAA,MAAM,YAAY,IAAA,CAAK,WAAA;AAEvB,IAAA,eAAe,IAAA,CAAK,KAAa,eAAA,EAAmC;AAClE,MAAA,MAAM,MAAA,GAAc,KAAA,CAAA,QAAA,CAAS,OAAA,EAAS,GAAG,CAAA;AAIzC,MAAA,IAAI,UAAA,EAAY;AACd,QAAA,UAAA,CAAW,UAAA,EAAY,UAAU,GAAG,CAAA;AAAA,MACtC;AAKA,MAAA,MAAM,MAAA,GAAS,MAAM,qBAAA,CAAsB,GAAA,EAAK,eAAe,CAAA;AAI/D,MAAA,IAAI,OAAA;AACJ,MAAA,IAAI;AACF,QAAA,OAAA,GAAU,MAAM,GAAA,CAAI,GAAA,CAAI,YAAY;AAClC,UAAA,MAAM,cAAiB,EAAA,CAAA,OAAA,CAAQ,GAAA,EAAK,EAAE,aAAA,EAAe,MAAM,CAAA;AAC3D,UAAA,IAAI,UAAA;AACJ,UAAA,MAAM,MAAA,GAAS,MAAM,OAAA,CAAQ,IAAA,CAAK;AAAA,YAChC,WAAA,CAAY,KAAK,CAAC,CAAA,MAAO,EAAE,EAAA,EAAI,IAAA,EAAe,OAAA,EAAS,CAAA,EAAE,CAAE,CAAA;AAAA,YAC3D,IAAI,OAAA,CAAuB,CAACD,QAAAA,KAAY;AACtC,cAAA,UAAA,GAAa,UAAA,CAAW,MAAMA,QAAAA,CAAQ,EAAE,IAAI,KAAA,EAAO,GAAG,gBAAgB,CAAA;AACtE,cAAA,UAAA,CAAW,KAAA,EAAM;AAAA,YACnB,CAAC;AAAA,WACF,CAAA;AACD,UAAA,YAAA,CAAa,UAAW,CAAA;AACxB,UAAA,IAAI,CAAC,OAAO,EAAA,EAAI;AAEd,YAAA,SAAA,CAAU,IAAA,CAAK,UAAU,GAAG,CAAA;AAC5B,YAAA,OAAO,IAAA;AAAA,UACT;AACA,UAAA,OAAO,MAAA,CAAO,OAAA;AAAA,QAChB,CAAC,CAAA;AAAA,MACH,CAAA,CAAA,MAAQ;AACN,QAAA;AAAA,MACF;AACA,MAAA,IAAI,CAAC,OAAA,EAAS;AAEd,MAAA,MAAM,WAA4B,EAAC;AACnC,MAAA,KAAA,MAAW,KAAK,OAAA,EAAS;AACvB,QAAA,MAAM,OAAA,GAAe,KAAA,CAAA,IAAA,CAAK,GAAA,EAAK,CAAA,CAAE,IAAI,CAAA;AACrC,QAAA,MAAM,OAAA,GAAe,KAAA,CAAA,QAAA,CAAS,OAAA,EAAS,OAAO,CAAA;AAG9C,QAAA,IAAI,UAAA,IAAc,UAAA,CAAW,OAAO,CAAA,EAAG;AAEvC,QAAA,IAAI,CAAA,CAAE,aAAY,EAAG;AACnB,UAAA,IAAI,gBAAA,CAAiB,EAAE,IAAI,CAAA,IAAK,UAAU,GAAA,CAAI,CAAA,CAAE,IAAI,CAAA,EAAG;AAKvD,UAAA,IAAI,YAAA,CAAa,MAAA,EAAQ,OAAA,EAAS,IAAI,CAAA,EAAG;AACzC,UAAA,OAAA,CAAQ,IAAA,CAAK,EAAE,OAAA,EAAS,OAAA,EAAS,IAAA,EAAM,CAAA,CAAE,IAAA,EAAM,MAAA,EAAQ,KAAA,EAAO,WAAA,EAAa,IAAA,EAAM,CAAA;AAGjF,UAAA,QAAA,CAAS,IAAA,CAAK,IAAA,CAAK,OAAA,EAAS,MAAM,CAAC,CAAA;AAAA,QACrC,CAAA,MAAA,IAAW,CAAA,CAAE,MAAA,EAAO,EAAG;AAErB,UAAA,MAAM,GAAA,GAAW,KAAA,CAAA,OAAA,CAAQ,CAAA,CAAE,IAAI,EAAE,WAAA,EAAY;AAC7C,UAAA,IAAI,eAAA,CAAgB,GAAA,CAAI,GAAG,CAAA,EAAG;AAC9B,UAAA,IAAI,YAAA,CAAa,MAAA,EAAQ,OAAA,EAAS,KAAK,CAAA,EAAG;AAC1C,UAAA,OAAA,CAAQ,IAAA,CAAK,EAAE,OAAA,EAAS,OAAA,EAAS,IAAA,EAAM,CAAA,CAAE,IAAA,EAAM,MAAA,EAAQ,IAAA,EAAM,WAAA,EAAa,KAAA,EAAO,CAAA;AACjF,UAAA,UAAA,EAAA;AACA,UAAA,IAAI,UAAA,IAAc,UAAA,GAAa,YAAA,IAAgB,eAAA,EAAiB;AAC9D,YAAA,YAAA,GAAe,UAAA;AACf,YAAA,UAAA,CAAW,YAAY,OAAO,CAAA;AAAA,UAChC;AAAA,QACF;AAAA,MACF;AACA,MAAA,MAAM,OAAA,CAAQ,IAAI,QAAQ,CAAA;AAAA,IAC5B;AAEA,IAAA,MAAM,IAAA,CAAK,OAAA,EAAS,EAAE,CAAA;AAEtB,IAAA,IAAI,SAAA,GAAY,CAAA;AAChB,IAAA,MAAM,aAAA,uBAAoB,GAAA,EAAsB;AAChD,IAAA,KAAA,MAAW,SAAS,OAAA,EAAS;AAC3B,MAAA,IAAI,MAAM,WAAA,EAAa,SAAA,EAAA;AACvB,MAAA,IAAI,CAAC,MAAM,MAAA,EAAQ;AACnB,MAAA,MAAM,MAAA,GAAS,aAAA,CAAc,GAAA,CAAI,KAAA,CAAM,IAAI,CAAA;AAC3C,MAAA,IAAI,MAAA,EAAQ;AACV,QAAA,MAAA,CAAO,IAAA,CAAK,MAAM,OAAO,CAAA;AAAA,MAC3B,CAAA,MAAO;AACL,QAAA,aAAA,CAAc,IAAI,KAAA,CAAM,IAAA,EAAM,CAAC,KAAA,CAAM,OAAO,CAAC,CAAA;AAAA,MAC/C;AAAA,IACF;AACA,IAAA,IAAA,CAAK,YAAY,GAAA,CAAI,OAAA,EAAS,EAAE,UAAA,EAAY,UAAA,EAAY,WAAW,CAAA;AACnE,IAAA,IAAA,CAAK,aAAA,CAAc,GAAA,CAAI,OAAA,EAAS,aAAa,CAAA;AAG7C,IAAA,IAAI,UAAA,IAAc,eAAe,YAAA,EAAc;AAC7C,MAAA,UAAA,CAAW,YAAY,EAAE,CAAA;AAAA,IAC3B;AACA,IAAA,OAAO,OAAA;AAAA,EACT;AAAA;AAAA;AAAA;AAAA;AAAA,EAMA,MAAM,SAAA,CAAU,OAAA,EAAiB,SAAA,EAAyD;AACxF,IAAA,MAAM,OAAA,GAAU,MAAM,IAAA,CAAK,OAAA,CAAQ,OAAO,CAAA;AAC1C,IAAA,OAAO,OAAA,CAAQ,MAAA,CAAO,CAAC,CAAA,KAAM,EAAE,MAAA,IAAU,SAAA,CAAU,CAAA,CAAE,IAAI,CAAC,CAAA,CAAE,GAAA,CAAI,CAAC,CAAA,KAAM,EAAE,OAAO,CAAA;AAAA,EAClF;AAAA,EAEA,MAAM,qBAAqB,OAAA,EAAoC;AAC7D,IAAA,MAAM,IAAA,CAAK,QAAQ,OAAO,CAAA;AAC1B,IAAA,OAAO,IAAA,CAAK,cAAc,GAAA,CAAI,OAAO,GAAG,GAAA,CAAI,cAAc,KAAK,EAAC;AAAA,EAClE;AAAA,EAEA,MAAM,gBAAgB,OAAA,EAAoC;AACxD,IAAA,MAAM,OAAA,GAAU,MAAM,IAAA,CAAK,OAAA,CAAQ,OAAO,CAAA;AAC1C,IAAA,OAAO,QAAQ,MAAA,CAAO,CAAC,CAAA,KAAM,CAAA,CAAE,UAAU,CAAA,CAAE,IAAA,CAAK,QAAA,CAAS,SAAS,CAAC,CAAA,CAAE,GAAA,CAAI,CAAC,CAAA,KAAM,EAAE,OAAO,CAAA;AAAA,EAC3F;AAAA,EAEA,MAAM,kBAAkB,OAAA,EAAoC;AAC1D,IAAA,MAAM,OAAA,GAAU,MAAM,IAAA,CAAK,OAAA,CAAQ,OAAO,CAAA;AAC1C,IAAA,OAAO,QAAQ,MAAA,CAAO,CAAC,CAAA,KAAM,CAAA,CAAE,UAAU,CAAA,CAAE,IAAA,CAAK,QAAA,CAAS,MAAM,CAAC,CAAA,CAAE,GAAA,CAAI,CAAC,CAAA,KAAM,EAAE,OAAO,CAAA;AAAA,EACxF;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EASA,MAAM,eAAA,CAAgB,OAAA,EAAiB,GAAA,EAA8B;AACnE,IAAA,MAAM,OAAA,GAAU,IAAA,CAAK,SAAA,CAAU,GAAA,CAAI,OAAO,CAAA;AAC1C,IAAA,IAAI,CAAC,OAAA,EAAS;AAEZ,MAAA,OAAO,gBAAgB,GAAG,CAAA;AAAA,IAC5B;AACA,IAAA,MAAM,WAAW,MAAM,OAAA;AACvB,IAAA,MAAM,SAAS,GAAA,CAAI,QAAA,CAAc,KAAA,CAAA,GAAG,CAAA,GAAI,MAAM,GAAA,GAAW,KAAA,CAAA,GAAA;AACzD,IAAA,IAAI,KAAA,GAAQ,CAAA;AACZ,IAAA,KAAA,MAAW,KAAK,QAAA,EAAU;AACxB,MAAA,IAAI,CAAC,EAAE,MAAA,EAAQ;AAEf,MAAA,IAAI,EAAE,OAAA,KAAY,GAAA,IAAO,EAAE,OAAA,CAAQ,UAAA,CAAW,MAAM,CAAA,EAAG;AACrD,QAAA,KAAA,EAAA;AAAA,MACF;AAAA,IACF;AACA,IAAA,OAAO,KAAA;AAAA,EACT;AAAA;AAAA,EAGQ,SAAS,OAAA,EAAkC;AACjD,IAAA,MAAM,MAAA,GAAS,IAAA,CAAK,SAAA,CAAU,GAAA,CAAI,OAAO,CAAA;AACzC,IAAA,IAAI,QAAQ,OAAO,MAAA;AACnB,IAAA,MAAM,OAAA,GAAU,IAAA,CAAK,OAAA,CAAQ,GAAA,CAAI,YAAY;AAC3C,MAAA,IAAI;AACF,QAAA,MAAME,KAAAA,GAAO,MAAS,EAAA,CAAA,IAAA,CAAK,OAAO,CAAA;AAClC,QAAA,OAAOA,KAAAA,CAAK,IAAA;AAAA,MACd,CAAA,CAAA,MAAQ;AACN,QAAA,OAAO,CAAA;AAAA,MACT;AAAA,IACF,CAAC,CAAA;AACD,IAAA,IAAA,CAAK,SAAA,CAAU,GAAA,CAAI,OAAA,EAAS,OAAO,CAAA;AACnC,IAAA,OAAO,OAAA;AAAA,EACT;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAQA,MAAM,UAAA,CAAW,OAAA,EAAiB,GAAA,EAA8B;AAC9D,IAAA,MAAM,OAAA,GAAU,IAAA,CAAK,SAAA,CAAU,GAAA,CAAI,OAAO,CAAA;AAC1C,IAAA,IAAI,CAAC,OAAA,EAAS;AAEZ,MAAA,OAAO,WAAW,GAAG,CAAA;AAAA,IACvB;AACA,IAAA,MAAM,WAAW,MAAM,OAAA;AACvB,IAAA,MAAM,SAAS,GAAA,CAAI,QAAA,CAAc,KAAA,CAAA,GAAG,CAAA,GAAI,MAAM,GAAA,GAAW,KAAA,CAAA,GAAA;AACzD,IAAA,MAAM,KAAA,GAAQ,MAAM,OAAA,CAAQ,GAAA;AAAA,MAC1B,QAAA,CACG,OAAO,CAAC,CAAA,KAAM,EAAE,MAAA,KAAW,CAAA,CAAE,OAAA,KAAY,GAAA,IAAO,CAAA,CAAE,OAAA,CAAQ,WAAW,MAAM,CAAA,CAAE,EAC7E,GAAA,CAAI,CAAC,MAAM,IAAA,CAAK,QAAA,CAAS,CAAA,CAAE,OAAO,CAAC;AAAA,KACxC;AACA,IAAA,OAAO,MAAM,MAAA,CAAO,CAAC,OAAO,IAAA,KAAS,KAAA,GAAQ,MAAM,CAAC,CAAA;AAAA,EACtD;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAWA,MAAM,kBAAA,CAAmB,OAAA,EAAiB,GAAA,EAAgE;AACxG,IAAA,MAAM,OAAA,GAAU,IAAA,CAAK,SAAA,CAAU,GAAA,CAAI,OAAO,CAAA;AAC1C,IAAA,IAAI,CAAC,OAAA,EAAS;AAEZ,MAAA,MAAM,CAAC,SAAA,EAAW,SAAS,CAAA,GAAI,MAAM,OAAA,CAAQ,GAAA,CAAI,CAAC,eAAA,CAAgB,GAAG,CAAA,EAAG,UAAA,CAAW,GAAG,CAAC,CAAC,CAAA;AACxF,MAAA,OAAO,EAAE,WAAW,SAAA,EAAU;AAAA,IAChC;AACA,IAAA,MAAM,WAAW,MAAM,OAAA;AACvB,IAAA,MAAM,SAAS,GAAA,CAAI,QAAA,CAAc,KAAA,CAAA,GAAG,CAAA,GAAI,MAAM,GAAA,GAAW,KAAA,CAAA,GAAA;AACzD,IAAA,MAAM,cAAc,QAAA,CAAS,MAAA;AAAA,MAC3B,CAAC,CAAA,KACC,CAAA,CAAE,WACD,CAAA,CAAE,OAAA,KAAY,OAAO,CAAA,CAAE,OAAA,CAAQ,UAAA,CAAW,MAAM,MACjD,CAAC,oBAAA,CAAqB,IAAI,CAAA,CAAE,IAAA,CAAK,aAAa;AAAA,KAClD;AACA,IAAA,MAAM,KAAA,GAAQ,MAAM,OAAA,CAAQ,GAAA,CAAI,WAAA,CAAY,GAAA,CAAI,CAAC,CAAA,KAAM,IAAA,CAAK,QAAA,CAAS,CAAA,CAAE,OAAO,CAAC,CAAC,CAAA;AAChF,IAAA,OAAO;AAAA,MACL,WAAW,WAAA,CAAY,MAAA;AAAA,MACvB,SAAA,EAAW,MAAM,MAAA,CAAO,CAAC,OAAO,IAAA,KAAS,KAAA,GAAQ,MAAM,CAAC;AAAA,KAC1D;AAAA,EACF;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAYA,aAAa,QAAA,EAAmC;AAC9C,IAAA,MAAM,GAAA,GAAW,cAAQ,QAAQ,CAAA;AACjC,IAAA,MAAM,MAAA,GAAS,IAAA,CAAK,SAAA,CAAU,GAAA,CAAI,GAAG,CAAA;AACrC,IAAA,IAAI,QAAQ,OAAO,MAAA;AAEnB,IAAA,MAAM,UAAU,IAAA,CAAK,YAAA;AACrB,IAAA,MAAM,eAAe,IAAA,CAAK,kBAAA;AAC1B,IAAA,MAAM,UAAU,IAAA,CAAK,QAAA;AAGrB,IAAA,MAAM,WAAW,YAAY;AAE3B,MAAA,IAAI,UAAU,CAAA,EAAG;AACf,QAAA,IAAI;AACF,UAAA,MAAMA,KAAAA,GAAO,MAAS,EAAA,CAAA,IAAA,CAAK,GAAG,CAAA;AAC9B,UAAA,IAAIA,KAAAA,CAAK,OAAO,OAAA,EAAS;AACvB,YAAA,MAAM,GAAA,GAAM,OAAA,GAAe,KAAA,CAAA,QAAA,CAAS,OAAA,EAAS,GAAG,CAAA,GAAI,GAAA;AACpD,YAAA,YAAA,CAAa,KAAK,GAAG,CAAA;AACrB,YAAA,IAAA,CAAK,SAAA,CAAU,OAAO,GAAG,CAAA;AACzB,YAAA,OAAO,EAAA;AAAA,UACT;AAAA,QACF,CAAA,CAAA,MAAQ;AAAA,QAER;AAAA,MACF;AAEA,MAAA,MAAM,OAAA,GAAU,MAAS,EAAA,CAAA,QAAA,CAAS,GAAA,EAAK,MAAM,CAAA;AAC7C,MAAA,IAAI,OAAA,CAAQ,SAAS,oBAAA,EAAsB;AAEzC,QAAA,IAAA,CAAK,SAAA,CAAU,OAAO,GAAG,CAAA;AAAA,MAC3B;AACA,MAAA,OAAO,OAAA;AAAA,IACT,CAAA,GAAG;AAIH,IAAA,IAAA,CAAK,SAAA,CAAU,GAAA,CAAI,GAAA,EAAK,OAAO,CAAA;AAC/B,IAAA,OAAO,OAAA;AAAA,EACT;AAAA;AAAA;AAAA;AAAA;AAAA,EAMA,aAAgB,QAAA,EAA8B;AAC5C,IAAA,MAAM,GAAA,GAAW,cAAQ,QAAQ,CAAA;AACjC,IAAA,MAAM,MAAA,GAAS,IAAA,CAAK,SAAA,CAAU,GAAA,CAAI,GAAG,CAAA;AACrC,IAAA,IAAI,QAAQ,OAAO,MAAA;AAEnB,IAAA,MAAM,UAAU,IAAA,CAAK,YAAA,CAAa,GAAG,CAAA,CAAE,IAAA,CAAK,CAAC,GAAA,KAAQ;AAEnD,MAAA,IAAA,CAAK,SAAA,CAAU,OAAO,GAAG,CAAA;AACzB,MAAA,OAAO,IAAA,CAAK,KAAA,CAAM,QAAA,CAAS,GAAG,CAAC,CAAA;AAAA,IACjC,CAAC,CAAA;AACD,IAAA,IAAA,CAAK,SAAA,CAAU,GAAA,CAAI,GAAA,EAAK,OAAO,CAAA;AAC/B,IAAA,OAAO,OAAA;AAAA,EACT;AAAA;AAAA,EAIA,WAAW,CAAA,EAA6B;AACtC,IAAA,MAAM,GAAA,GAAW,cAAQ,CAAC,CAAA;AAC1B,IAAA,MAAM,MAAA,GAAS,IAAA,CAAK,WAAA,CAAY,GAAA,CAAI,GAAG,CAAA;AACvC,IAAA,IAAI,QAAQ,OAAO,MAAA;AACnB,IAAA,MAAM,OAAA,GAAa,UAAO,GAAG,CAAA,CAAE,KAAK,MAAM,IAAA,EAAM,MAAM,KAAK,CAAA;AAC3D,IAAA,IAAA,CAAK,WAAA,CAAY,GAAA,CAAI,GAAA,EAAK,OAAO,CAAA;AACjC,IAAA,OAAO,OAAA;AAAA,EACT;AAAA;AAAA;AAAA,EAKA,KAAA,GAAc;AACZ,IAAA,IAAA,CAAK,UAAU,KAAA,EAAM;AACrB,IAAA,IAAA,CAAK,YAAY,KAAA,EAAM;AACvB,IAAA,IAAA,CAAK,cAAc,KAAA,EAAM;AACzB,IAAA,IAAA,CAAK,UAAU,KAAA,EAAM;AACrB,IAAA,IAAA,CAAK,UAAU,KAAA,EAAM;AACrB,IAAA,IAAA,CAAK,YAAY,KAAA,EAAM;AACvB,IAAA,IAAA,CAAK,UAAU,KAAA,EAAM;AAAA,EACvB;AAAA;AAAA,EAGA,IAAI,aAAA,GAAwB;AAAE,IAAA,OAAO,KAAK,SAAA,CAAU,IAAA;AAAA,EAAM;AAAA;AAAA,EAE1D,IAAI,aAAA,GAAwB;AAAE,IAAA,OAAO,KAAK,SAAA,CAAU,IAAA;AAAA,EAAM;AAC5D;AAkBA,eAAsB,cAAA,CAAe,SAAiB,eAAA,EAAgD;AACpG,EAAA,MAAM,MAAA,GAAS,MAAM,yBAAA,CAA0B,OAAA,EAAS,eAAe,CAAA;AACvE,EAAA,IAAI,QAAQ,OAAO,MAAA;AAEnB,EAAA,IAAI,UAAA,GAAa,CAAA;AACjB,EAAA,IAAI,SAAA,GAAY,CAAA;AAChB,EAAA,MAAM,KAAA,GAAQ,OAAU,EAAA,CAAA,oBAAA,KAAyB,UAAA,GAAgB,yBAAqB,GAAO,EAAA,CAAA,IAAA,GAAO,MAAA,IAAU,CAAA;AAC9G,EAAA,MAAM,aAAA,GAAgB,KAAK,GAAA,CAAI,CAAA,EAAG,KAAK,GAAA,CAAI,GAAA,EAAK,KAAA,GAAQ,CAAC,CAAC,CAAA;AAC1D,EAAA,MAAM,GAAA,GAAM,IAAI,SAAA,CAAU,aAAa,CAAA;AACvC,EAAA,MAAM,SAAA,GAAY,eAAA;AAClB,EAAA,MAAM,UAAA,GAAa,eAAA,GAAkB,YAAA,CAAa,eAAe,CAAA,GAAI,IAAA;AAErE,EAAA,eAAe,KAAA,CAAM,KAAa,eAAA,EAAmC;AACnE,IAAA,IAAI,OAAA;AACJ,IAAA,IAAI;AACF,MAAA,OAAA,GAAU,MAAM,GAAA,CAAI,GAAA,CAAI,MAAS,EAAA,CAAA,OAAA,CAAQ,KAAK,EAAE,aAAA,EAAe,IAAA,EAAM,CAAC,CAAA;AAAA,IACxE,CAAA,CAAA,MAAQ;AACN,MAAA;AAAA,IACF;AACA,IAAA,MAAM,MAAA,GAAS,MAAM,qBAAA,CAAsB,GAAA,EAAK,eAAe,CAAA;AAC/D,IAAA,MAAM,OAAwB,EAAC;AAC/B,IAAA,KAAA,MAAW,KAAK,OAAA,EAAS;AACvB,MAAA,MAAM,OAAA,GAAe,KAAA,CAAA,IAAA,CAAK,GAAA,EAAK,CAAA,CAAE,IAAI,CAAA;AACrC,MAAA,MAAM,OAAA,GAAe,KAAA,CAAA,QAAA,CAAS,OAAA,EAAS,OAAO,CAAA;AAC9C,MAAA,IAAI,UAAA,IAAc,UAAA,CAAW,OAAO,CAAA,EAAG;AAEvC,MAAA,IAAI,CAAA,CAAE,aAAY,EAAG;AACnB,QAAA,IAAI,gBAAA,CAAiB,EAAE,IAAI,CAAA,IAAK,UAAU,GAAA,CAAI,CAAA,CAAE,IAAI,CAAA,EAAG;AACvD,QAAA,IAAI,YAAA,CAAa,MAAA,EAAQ,OAAA,EAAS,IAAI,CAAA,EAAG;AACzC,QAAA,SAAA,EAAA;AACA,QAAA,IAAA,CAAK,IAAA,CAAK,KAAA,CAAM,OAAA,EAAS,MAAM,CAAC,CAAA;AAAA,MAClC,CAAA,MAAA,IAAW,CAAA,CAAE,MAAA,EAAO,EAAG;AACrB,QAAA,MAAM,GAAA,GAAW,KAAA,CAAA,OAAA,CAAQ,CAAA,CAAE,IAAI,EAAE,WAAA,EAAY;AAC7C,QAAA,IAAI,eAAA,CAAgB,GAAA,CAAI,GAAG,CAAA,EAAG;AAC9B,QAAA,IAAI,YAAA,CAAa,MAAA,EAAQ,OAAA,EAAS,KAAK,CAAA,EAAG;AAC1C,QAAA,UAAA,EAAA;AAAA,MACF;AAAA,IACF;AACA,IAAA,MAAM,OAAA,CAAQ,IAAI,IAAI,CAAA;AAAA,EACxB;AAEA,EAAA,MAAM,KAAA,CAAM,OAAA,EAAS,EAAE,CAAA;AACvB,EAAA,OAAO,EAAE,YAAY,SAAA,EAAU;AACjC;AAIO,SAAS,wBAAwB,OAAA,EAAyB;AAC/D,EAAA,OAAO,OAAA,CAAQ,OAAA,CAAQ,KAAA,EAAO,GAAG,CAAA;AACnC;AAEA,eAAe,yBAAA,CAA0B,SAAiB,eAAA,EAAuD;AAQ/G,EAAA,MAAM,IAAA,GAAO,CAAC,SAAA,EAAW,UAAA,EAAY,QAAQ,CAAA;AAE7C,EAAA,KAAA,MAAW,OAAO,SAAA,EAAW;AAC3B,IAAA,IAAA,CAAK,IAAA,CAAK,IAAA,EAAM,CAAA,IAAA,EAAO,GAAG,CAAA,GAAA,CAAK,CAAA;AAAA,EACjC;AACA,EAAA,KAAA,MAAW,OAAO,eAAA,EAAiB;AACjC,IAAA,IAAA,CAAK,IAAA,CAAK,IAAA,EAAM,CAAA,IAAA,EAAO,GAAG,CAAA,GAAA,CAAK,CAAA;AAAA,EACjC;AACA,EAAA,KAAA,MAAW,OAAO,eAAA,EAAiB;AACjC,IAAA,IAAA,CAAK,IAAA,CAAK,IAAA,EAAM,CAAA,KAAA,EAAQ,GAAG,CAAA,CAAE,CAAA;AAAA,EAC/B;AACA,EAAA,KAAA,MAAW,OAAA,IAAY,eAAA,IAAmB,EAAC,EAAI;AAC7C,IAAA,MAAM,OAAA,GAAU,QAAQ,IAAA,EAAK;AAC7B,IAAA,IAAI,CAAC,OAAA,EAAS;AACd,IAAA,IAAA,CAAK,KAAK,IAAA,EAAM,CAAA,CAAA,EAAI,uBAAA,CAAwB,OAAO,CAAC,CAAA,CAAE,CAAA;AAAA,EACxD;AAEA,EAAA,IAAI;AACF,IAAA,MAAM,EAAE,MAAA,EAAO,GAAI,MAAM,aAAA,CAAc,MAAM,IAAA,EAAM,EAAE,GAAA,EAAK,OAAA,EAAS,WAAW,EAAA,GAAK,IAAA,GAAO,IAAA,EAAM,QAAA,EAAU,QAAQ,CAAA;AAClH,IAAA,IAAI,CAAC,MAAA,EAAQ,OAAO,EAAE,UAAA,EAAY,CAAA,EAAG,WAAW,CAAA,EAAE;AAElD,IAAA,MAAM,QAAQ,MAAA,CAAO,KAAA,CAAM,IAAI,CAAA,CAAE,OAAO,OAAO,CAAA;AAC/C,IAAA,MAAM,IAAA,uBAAW,GAAA,EAAY;AAC7B,IAAA,KAAA,MAAW,QAAQ,KAAA,EAAO;AACxB,MAAA,MAAM,GAAA,GAAW,cAAQ,IAAI,CAAA;AAC7B,MAAA,IAAI,GAAA,IAAO,GAAA,KAAQ,GAAA,EAAK,IAAA,CAAK,IAAI,GAAG,CAAA;AAAA,IACtC;AAEA,IAAA,OAAO,EAAE,UAAA,EAAY,KAAA,CAAM,MAAA,EAAQ,SAAA,EAAW,KAAK,IAAA,EAAK;AAAA,EAC1D,CAAA,CAAA,MAAQ;AACN,IAAA,OAAO,IAAA;AAAA,EACT;AACF;AAMA,eAAsB,eAAA,CAAgB,GAAA,EAAa,SAAA,GAAY,IAAA,EAAuB;AACpF,EAAA,IAAI,KAAA,GAAQ,CAAA;AACZ,EAAA,MAAM,SAAA,uBAAgB,GAAA,CAAI,CAAC,OAAO,KAAA,EAAO,OAAA,EAAS,SAAA,EAAW,aAAa,CAAC,CAAA;AAE3E,EAAA,eAAe,KAAK,UAAA,EAAmC;AACrD,IAAA,IAAI,OAAA;AACJ,IAAA,IAAI;AACF,MAAA,OAAA,GAAU,MAAS,EAAA,CAAA,OAAA,CAAQ,UAAA,EAAY,EAAE,aAAA,EAAe,MAAM,CAAA;AAAA,IAChE,CAAA,CAAA,MAAQ;AACN,MAAA;AAAA,IACF;AACA,IAAA,MAAM,OAAwB,EAAC;AAC/B,IAAA,KAAA,MAAW,KAAK,OAAA,EAAS;AACvB,MAAA,IAAI,CAAA,CAAE,aAAY,EAAG;AACnB,QAAA,IAAI,CAAC,SAAA,EAAW;AAChB,QAAA,IAAI,gBAAA,CAAiB,EAAE,IAAI,CAAA,IAAK,UAAU,GAAA,CAAI,CAAA,CAAE,IAAI,CAAA,EAAG;AACvD,QAAA,IAAA,CAAK,KAAK,IAAA,CAAU,KAAA,CAAA,IAAA,CAAK,YAAY,CAAA,CAAE,IAAI,CAAC,CAAC,CAAA;AAAA,MAC/C,CAAA,MAAA,IAAW,CAAA,CAAE,MAAA,EAAO,EAAG;AACrB,QAAA,MAAM,GAAA,GAAW,KAAA,CAAA,OAAA,CAAQ,CAAA,CAAE,IAAI,EAAE,WAAA,EAAY;AAC7C,QAAA,IAAI,CAAC,eAAA,CAAgB,GAAA,CAAI,GAAG,CAAA,EAAG,KAAA,EAAA;AAAA,MACjC;AAAA,IACF;AACA,IAAA,MAAM,OAAA,CAAQ,IAAI,IAAI,CAAA;AAAA,EACxB;AAEA,EAAA,MAAM,KAAK,GAAG,CAAA;AACd,EAAA,OAAO,KAAA;AACT;AAOA,eAAsB,UAAA,CAAW,GAAA,EAAa,SAAA,GAAY,IAAA,EAAuB;AAC/E,EAAA,IAAI,KAAA,GAAQ,CAAA;AACZ,EAAA,MAAM,SAAA,uBAAgB,GAAA,CAAI,CAAC,OAAO,KAAA,EAAO,OAAA,EAAS,SAAA,EAAW,aAAa,CAAC,CAAA;AAE3E,EAAA,eAAe,KAAK,UAAA,EAAmC;AACrD,IAAA,IAAI,OAAA;AACJ,IAAA,IAAI;AACF,MAAA,OAAA,GAAU,MAAS,EAAA,CAAA,OAAA,CAAQ,UAAA,EAAY,EAAE,aAAA,EAAe,MAAM,CAAA;AAAA,IAChE,CAAA,CAAA,MAAQ;AACN,MAAA;AAAA,IACF;AACA,IAAA,MAAM,OAAwB,EAAC;AAC/B,IAAA,KAAA,MAAW,KAAK,OAAA,EAAS;AACvB,MAAA,IAAI,CAAA,CAAE,aAAY,EAAG;AACnB,QAAA,IAAI,CAAC,SAAA,EAAW;AAChB,QAAA,IAAI,gBAAA,CAAiB,EAAE,IAAI,CAAA,IAAK,UAAU,GAAA,CAAI,CAAA,CAAE,IAAI,CAAA,EAAG;AACvD,QAAA,IAAA,CAAK,KAAK,IAAA,CAAU,KAAA,CAAA,IAAA,CAAK,YAAY,CAAA,CAAE,IAAI,CAAC,CAAC,CAAA;AAAA,MAC/C,CAAA,MAAA,IAAW,CAAA,CAAE,MAAA,EAAO,EAAG;AACrB,QAAA,MAAM,GAAA,GAAW,KAAA,CAAA,OAAA,CAAQ,CAAA,CAAE,IAAI,EAAE,WAAA,EAAY;AAC7C,QAAA,IAAI,eAAA,CAAgB,GAAA,CAAI,GAAG,CAAA,EAAG;AAC9B,QAAA,IAAI;AACF,UAAA,MAAMA,QAAO,MAAS,EAAA,CAAA,IAAA,CAAU,WAAK,UAAA,EAAY,CAAA,CAAE,IAAI,CAAC,CAAA;AACxD,UAAA,KAAA,IAASA,KAAAA,CAAK,IAAA;AAAA,QAChB,CAAA,CAAA,MAAQ;AAAA,QAER;AAAA,MACF;AAAA,IACF;AACA,IAAA,MAAM,OAAA,CAAQ,IAAI,IAAI,CAAA;AAAA,EACxB;AAEA,EAAA,MAAM,KAAK,GAAG,CAAA;AACd,EAAA,OAAO,KAAA;AACT;AAGA,eAAsB,SAAA,CACpB,SACA,SAAA,EACmB;AACnB,EAAA,MAAM,UAAoB,EAAC;AAC3B,EAAA,MAAM,KAAA,GAAQ,OAAU,EAAA,CAAA,oBAAA,KAAyB,UAAA,GAAgB,yBAAqB,GAAO,EAAA,CAAA,IAAA,GAAO,MAAA,IAAU,CAAA;AAC9G,EAAA,MAAM,kBAAA,GAAqB,KAAK,GAAA,CAAI,CAAA,EAAG,KAAK,GAAA,CAAI,EAAA,EAAI,KAAA,GAAQ,CAAC,CAAC,CAAA;AAC9D,EAAA,MAAM,gBAAA,GAAmB,IAAI,SAAA,CAAU,kBAAkB,CAAA;AAEzD,EAAA,eAAe,KAAK,GAAA,EAAa;AAC/B,IAAA,IAAI,OAAA;AACJ,IAAA,IAAI;AACF,MAAA,OAAA,GAAU,MAAM,gBAAA,CAAiB,GAAA,CAAI,MAAS,EAAA,CAAA,OAAA,CAAQ,KAAK,EAAE,aAAA,EAAe,IAAA,EAAM,CAAC,CAAA;AAAA,IACrF,CAAA,CAAA,MAAQ;AACN,MAAA;AAAA,IACF;AAEA,IAAA,MAAM,oBAAqC,EAAC;AAE5C,IAAA,KAAA,MAAW,KAAK,OAAA,EAAS;AACvB,MAAA,IAAI,CAAA,CAAE,aAAY,EAAG;AACnB,QAAA,IAAI,gBAAA,CAAiB,CAAA,CAAE,IAAI,CAAA,EAAG;AAC9B,QAAA,iBAAA,CAAkB,KAAK,IAAA,CAAU,KAAA,CAAA,IAAA,CAAK,KAAK,CAAA,CAAE,IAAI,CAAC,CAAC,CAAA;AAAA,MACrD,WAAW,CAAA,CAAE,MAAA,MAAY,SAAA,CAAU,CAAA,CAAE,IAAI,CAAA,EAAG;AAC1C,QAAA,MAAM,GAAA,GAAW,KAAA,CAAA,OAAA,CAAQ,CAAA,CAAE,IAAI,EAAE,WAAA,EAAY;AAC7C,QAAA,IAAI,CAAC,eAAA,CAAgB,GAAA,CAAI,GAAG,CAAA,EAAG,OAAA,CAAQ,IAAA,CAAU,KAAA,CAAA,IAAA,CAAK,GAAA,EAAK,CAAA,CAAE,IAAI,CAAC,CAAA;AAAA,MACpE;AAAA,IACF;AAEA,IAAA,MAAM,OAAA,CAAQ,IAAI,iBAAiB,CAAA;AAAA,EACrC;AAEA,EAAA,MAAM,KAAK,OAAO,CAAA;AAClB,EAAA,OAAO,OAAA;AACT;AAEA,eAAsB,qBAAqB,OAAA,EAAoC;AAC7E,EAAA,OAAO,SAAA,CAAU,OAAA,EAAS,CAAC,IAAA,KAAS,SAAS,cAAc,CAAA;AAC7D;AAEA,eAAsB,kBAAkB,OAAA,EAAoC;AAC1E,EAAA,OAAO,UAAU,OAAA,EAAS,CAAC,SAAS,IAAA,CAAK,QAAA,CAAS,MAAM,CAAC,CAAA;AAC3D;AAEA,eAAsB,gBAAgB,OAAA,EAAoC;AACxE,EAAA,OAAO,UAAU,OAAA,EAAS,CAAC,SAAS,IAAA,CAAK,QAAA,CAAS,SAAS,CAAC,CAAA;AAC9D;AAOO,SAAS,SAAS,IAAA,EAAsB;AAC7C,EAAA,OAAO,IAAA,CAAK,WAAW,CAAC,CAAA,KAAM,QAAS,IAAA,CAAK,KAAA,CAAM,CAAC,CAAA,GAAI,IAAA;AACzD;AAEA,eAAsB,aAAgB,QAAA,EAA8B;AAClE,EAAA,MAAM,GAAA,GAAM,MAAS,EAAA,CAAA,QAAA,CAAS,QAAA,EAAU,MAAM,CAAA;AAC9C,EAAA,OAAO,IAAA,CAAK,KAAA,CAAM,QAAA,CAAS,GAAG,CAAC,CAAA;AACjC;AAEA,eAAsB,aAAa,QAAA,EAAmC;AACpE,EAAA,OAAU,EAAA,CAAA,QAAA,CAAS,UAAU,MAAM,CAAA;AACrC;AAEA,eAAsB,WAAW,CAAA,EAA6B;AAC5D,EAAA,IAAI;AACF,IAAA,MAAS,UAAO,CAAC,CAAA;AACjB,IAAA,OAAO,IAAA;AAAA,EACT,CAAA,CAAA,MAAQ;AACN,IAAA,OAAO,KAAA;AAAA,EACT;AACF;AAEA,eAAsB,UAAU,GAAA,EAA4B;AAC1D,EAAA,MAAS,EAAA,CAAA,KAAA,CAAM,GAAA,EAAK,EAAE,SAAA,EAAW,MAAM,CAAA;AACzC;AAEA,eAAsB,aAAA,CAAc,UAAkB,IAAA,EAA8B;AAClF,EAAA,MAAM,SAAA,CAAe,KAAA,CAAA,OAAA,CAAQ,QAAQ,CAAC,CAAA;AACtC,EAAA,MAAS,EAAA,CAAA,SAAA,CAAU,UAAU,IAAA,CAAK,SAAA,CAAU,MAAM,IAAA,EAAM,CAAC,CAAA,GAAI,IAAA,EAAM,MAAM,CAAA;AAC3E;AAEA,eAAsB,aAAA,CAAc,UAAkB,OAAA,EAAgC;AACpF,EAAA,MAAM,SAAA,CAAe,KAAA,CAAA,OAAA,CAAQ,QAAQ,CAAC,CAAA;AACtC,EAAA,MAAS,EAAA,CAAA,SAAA,CAAU,QAAA,EAAU,OAAA,EAAS,MAAM,CAAA;AAC9C","file":"chunk-NG4KIJW6.js","sourcesContent":["// VENDORED from @vibgrate/core-open (packages/vibgrate-core-open) by\n// scripts/vendor-core-open.mjs. Do not edit here — change the source package\n// and re-run the vendor script. Apache-2.0.\n/** Simple concurrency limiter */\nexport class Semaphore {\n  private available: number;\n  private queue: Array<() => void> = [];\n\n  constructor(max: number) {\n    this.available = max;\n  }\n\n  async run<T>(fn: () => Promise<T>): Promise<T> {\n    await this.acquire();\n    try {\n      return await fn();\n    } finally {\n      this.release();\n    }\n  }\n\n  private acquire(): Promise<void> {\n    if (this.available > 0) {\n      this.available--;\n      return Promise.resolve();\n    }\n    return new Promise((resolve) => this.queue.push(resolve));\n  }\n\n  private release() {\n    const next = this.queue.shift();\n    if (next) next();\n    else this.available++;\n  }\n}\n","// VENDORED from @vibgrate/core-open (packages/vibgrate-core-open) by\n// scripts/vendor-core-open.mjs. Do not edit here — change the source package\n// and re-run the vendor script. Apache-2.0.\nimport * as path from 'node:path';\n\n/**\n * Lightweight glob matcher — zero external dependencies.\n *\n * Supports the patterns most commonly used in vibgrate config `exclude`:\n *   - `*`        matches any sequence of non-separator chars\n *   - `**`       matches any sequence of chars including separators (recursive)\n *   - `?`        matches exactly one non-separator char\n *   - `{a,b}`    alternation\n *   - `[abc]`    character class\n *   - Literal folder names like `legacy` match as a prefix (`legacy/**`)\n *\n * Paths are normalised to forward-slash before matching so patterns\n * work identically on Windows and Unix.\n */\n\n/**\n * Compile an array of glob patterns into a single predicate function\n * that tests a **relative** path (forward-slash separated).\n *\n * Returns `null` if the pattern list is empty (nothing excluded).\n */\n/**\n * Split one or more raw exclude inputs into individual glob patterns.\n *\n * Each input may contain multiple patterns separated by commas or\n * semicolons, e.g. `\"legacy/**, vendor/**; dist\"`.  Surrounding\n * whitespace is trimmed and empty entries are dropped.  Pass an array\n * (e.g. a repeated `--exclude` flag) and every element is expanded and\n * flattened into a single de-duplicated list.\n */\nexport function parseExcludePatterns(input: string | string[] | undefined): string[] {\n  if (input === undefined) return [];\n  const raw = Array.isArray(input) ? input : [input];\n  const out: string[] = [];\n  for (const entry of raw) {\n    for (const part of entry.split(/[,;]/)) {\n      const trimmed = part.trim();\n      if (trimmed) out.push(trimmed);\n    }\n  }\n  return [...new Set(out)];\n}\n\nexport function compileGlobs(patterns: string[]): ((relPath: string) => boolean) | null {\n  if (patterns.length === 0) return null;\n\n  const matchers = patterns.map((p) => compileOne(normalise(p)));\n\n  return (relPath: string) => {\n    const norm = normalise(relPath);\n    return matchers.some((m) => m(norm));\n  };\n}\n\nfunction normalise(p: string): string {\n  // Always use forward-slash for matching\n  return p.split(path.sep).join('/').replace(/\\/+$/, '');\n}\n\nfunction compileOne(pattern: string): (p: string) => boolean {\n  // If the pattern has no glob metacharacters and no path separator,\n  // treat it as a directory name prefix match (e.g. \"legacy\" → \"legacy/**\")\n  if (!pattern.includes('/') && !hasGlobChars(pattern)) {\n    const prefix = pattern + '/';\n    return (p) => p === pattern || p.startsWith(prefix);\n  }\n\n  const re = globToRegex(pattern);\n  return (p) => re.test(p);\n}\n\nfunction hasGlobChars(s: string): boolean {\n  return /[*?[\\]{}]/.test(s);\n}\n\nfunction globToRegex(pattern: string): RegExp {\n  let i = 0;\n  let re = '^';\n  const len = pattern.length;\n\n  while (i < len) {\n    const ch = pattern[i]!;\n\n    if (ch === '*') {\n      if (pattern[i + 1] === '*') {\n        // **  — match everything (including separators)\n        i += 2;\n        if (pattern[i] === '/') {\n          // **/  — matches zero or more path segments followed by /\n          i++;\n          re += '(?:.+/)?';\n        } else {\n          // ** at end of pattern — matches everything remaining\n          re += '.*';\n        }\n      } else {\n        // * — match non-separator chars\n        i++;\n        re += '[^/]*';\n      }\n    } else if (ch === '?') {\n      i++;\n      re += '[^/]';\n    } else if (ch === '[') {\n      // Character class — pass through until ]\n      const start = i;\n      i++; // skip [\n      while (i < len && pattern[i] !== ']') i++;\n      i++; // skip ]\n      re += pattern.slice(start, i);\n    } else if (ch === '{') {\n      // Alternation {a,b,c}\n      i++; // skip {\n      const alternatives: string[] = [];\n      let current = '';\n      while (i < len && pattern[i] !== '}') {\n        if (pattern[i] === ',') {\n          alternatives.push(current);\n          current = '';\n        } else {\n          current += pattern[i];\n        }\n        i++;\n      }\n      alternatives.push(current);\n      i++; // skip }\n      re += '(?:' + alternatives.map(escapeRegex).join('|') + ')';\n    } else {\n      re += escapeRegex(ch);\n      i++;\n    }\n  }\n\n  re += '$';\n  return new RegExp(re);\n}\n\nfunction escapeRegex(s: string): string {\n  return s.replace(/[.*+?^${}()|[\\]\\\\]/g, '\\\\$&');\n}\n","// VENDORED from @vibgrate/core-open (packages/vibgrate-core-open) by\n// scripts/vendor-core-open.mjs. Do not edit here — change the source package\n// and re-run the vendor script. Apache-2.0.\nimport { execFile } from 'node:child_process';\nimport * as fs from 'node:fs/promises';\nimport * as os from 'node:os';\nimport * as path from 'node:path';\nimport { promisify } from 'node:util';\nimport type { Dirent } from 'node:fs';\nimport ignore, { type Ignore } from 'ignore';\nimport { Semaphore } from './semaphore.js';\nimport { compileGlobs } from './glob.js';\n\n\nconst execFileAsync = promisify(execFile);\n\n/**\n * One `.gitignore`'s compiled matcher, scoped to the directory it lives in.\n * `.gitignore` patterns are relative to their own directory (not the walk\n * root), so each level is tested independently against a path relative to\n * `dir`, and results are combined root-to-leaf so a deeper `.gitignore` can\n * re-include (negate) something an ancestor ignored — the same precedence\n * git itself uses.\n */\ninterface GitignoreLevel {\n  dir: string;\n  ig: Ignore;\n}\n\n/**\n * Load `dir/.gitignore` if present and return a new level list with it\n * appended. Returns `levels` unchanged (no allocation) when the directory has\n * no `.gitignore`, which is the common case.\n */\nasync function extendGitignoreLevels(dir: string, levels: GitignoreLevel[]): Promise<GitignoreLevel[]> {\n  try {\n    const txt = await fs.readFile(path.join(dir, '.gitignore'), 'utf8');\n    return [...levels, { dir, ig: ignore().add(txt) }];\n  } catch {\n    return levels;\n  }\n}\n\n/**\n * Test whether `absPath` is ignored by any `.gitignore` level collected while\n * walking down from the repo root. Walks levels in root-to-leaf order so a\n * later (deeper) match — ignore or negated un-ignore — wins, matching git's\n * own precedence rules.\n */\nfunction isGitignored(levels: GitignoreLevel[], absPath: string, isDir: boolean): boolean {\n  if (levels.length === 0) return false;\n  let ignored = false;\n  for (const { dir, ig } of levels) {\n    const rel = path.relative(dir, absPath);\n    if (!rel || rel.startsWith('..')) continue;\n    const relPosix = rel.split(path.sep).join('/');\n    const testPath = isDir ? `${relPosix}/` : relPosix;\n    const result = ig.test(testPath);\n    if (result.ignored) ignored = true;\n    else if (result.unignored) ignored = false;\n  }\n  return ignored;\n}\n\n/**\n * Directories pruned entirely from the walk — third-party dependency trees,\n * build/output directories, and VCS/IDE metadata. Skipping them keeps their\n * contents out of BOTH project discovery (no phantom projects) AND the billing\n * source-size signals. Matched by exact directory name at any depth.\n *\n * Correctness is load-bearing for pricing: a *missing* entry lets vendored\n * third-party code inflate the project count and size (over-billing — e.g. a\n * React Native app's `Pods/` minting hundreds of phantom C/Obj-C projects),\n * while a *wrong* entry silently drops real source (under-billing). Every name\n * here must be one that is effectively never hand-written source in its\n * ecosystem. Keep in sync with `docs/DEPENDENCY-EXCLUSIONS.md`.\n *\n * Exported so other walkers (e.g. the graph engine's discovery, which keeps\n * its own self-contained copy) can assert in tests that they cover at least\n * this set — the scanner and the graph must never disagree on what is a\n * dependency/build tree.\n */\nexport const SKIP_DIRS = new Set([\n  // ── Version control, IDE & tool metadata (never billable source) ──\n  '.git', '.svn', '.hg',\n  '.idea', '.vscode', '.vs',\n  // Claude Code agent state / worktrees (full monorepo copies under .claude/worktrees/)\n  '.claude',\n  '.vibgrate', '.wrangler', '.turbo', '.cache',\n\n  // ── JavaScript / Node — installed dependency trees ──\n  'node_modules',       // npm / pnpm / yarn classic\n  'bower_components',   // Bower (legacy)\n  'jspm_packages',      // jspm (legacy)\n  'web_modules',        // Snowpack (legacy)\n  '.pnpm-store',        // pnpm content-addressable store\n  '.yarn',              // Yarn Berry cache / unplugged / releases\n\n  // ── JS/TS meta-framework & bundler build output ──\n  '.next', '.nuxt', '.output', '.svelte-kit', '.astro',\n  '.vercel', '.netlify', '.angular', '.parcel-cache', '.docusaurus',\n  'storybook-static',\n\n  // ── Generic build / dist / coverage output ──\n  'dist', 'build', 'out', 'coverage',\n\n  // ── Vendored third-party source trees ──\n  'vendor',             // Go vendor/, PHP Composer, Rails vendor/bundle\n  'Pods',               // CocoaPods (iOS/macOS)\n  'Carthage',           // Carthage (iOS/macOS)\n\n  // ── Python — virtualenvs & tool caches ──\n  // Exact names only; custom-named envs (`.venv-foo`) and `site-packages`\n  // are handled by {@link isSkippedDirName}.\n  '.venv', 'venv', 'virtualenv', '.tox', '.nox',\n  '__pycache__', '.mypy_cache', '.pytest_cache', '.ruff_cache',\n  '.eggs', '.ipynb_checkpoints',\n\n  // ── Ruby ──\n  '.bundle',            // bundler config / vendored gems\n\n  // ── Rust / Maven / sbt / Clojure — all build into target/ ──\n  'target',\n\n  // ── JVM (Gradle / Maven) & .NET build output ──\n  '.gradle', 'bin', 'obj', 'TestResults',\n\n  // ── Swift / Xcode ──\n  '.build', '.swiftpm', 'DerivedData',\n\n  // ── Dart / Flutter ──\n  '.dart_tool',\n\n  // ── Elixir / Erlang ──\n  '_build', 'deps',\n\n  // ── Haskell (Cabal / Stack) ──\n  'dist-newstyle', '.stack-work',\n\n  // ── Infrastructure-as-code build/state ──\n  '.terraform', '.serverless', 'cdk.out', '.aws-sam',\n]);\n\n/**\n * True when a directory basename must be pruned from discovery / billing walks.\n * Covers exact {@link SKIP_DIRS} names plus custom virtualenv names\n * (`.venv-contextbench`, `venv-tools`, …) and Python install trees\n * (`site-packages`) that otherwise mint phantom nested projects.\n */\nexport function isSkippedDirName(name: string): boolean {\n  if (!name) return false;\n  if (SKIP_DIRS.has(name)) return true;\n  if (name.startsWith('.venv') || name.startsWith('venv-')) return true;\n  if (name === 'site-packages') return true;\n  return false;\n}\n\n/** File extensions skipped during the walk — binary/font/media that no scanner needs to read */\nconst SKIP_EXTENSIONS = new Set([\n  // Fonts\n  '.woff', '.woff2', '.ttf', '.otf', '.eot',\n  // Images & vector\n  '.png', '.jpg', '.jpeg', '.gif', '.ico', '.bmp', '.tiff', '.tif', '.webp', '.avif', '.svg',\n  '.heic', '.heif', '.jfif', '.psd', '.ai', '.eps', '.raw', '.cr2', '.nef', '.dng',\n  // Video\n  '.mp4', '.webm', '.avi', '.mov', '.mkv', '.wmv', '.flv', '.m4v', '.mpg', '.mpeg', '.3gp', '.ogv',\n  // Audio\n  '.mp3', '.wav', '.ogg', '.flac', '.aac', '.wma', '.m4a', '.opus', '.aiff', '.mid', '.midi',\n  // Archives\n  '.zip', '.tar', '.gz', '.bz2', '.7z', '.rar',\n  // Compiled / binary\n  '.exe', '.dll', '.so', '.dylib', '.o', '.a', '.class', '.pyc', '.pdb',\n  // Source maps & lockfiles (large, not useful for drift analysis)\n  '.map',\n]);\n\n// Folded into SKIP_DIRS above (single source of truth). Kept as an empty set\n// so the existing walk/ripgrep call sites that OR-check it stay valid.\nconst EXTRA_SKIP_DIRS = new Set<string>([]);\n\n/**\n * Lockfiles and generated dependency manifests excluded from the billing\n * source-size metrics. They are not hand-written source, and a single one\n * (e.g. a pnpm-lock.yaml) can exceed 1 MB on its own, which would otherwise\n * inflate a genuinely tiny project past the micro/small size thresholds.\n *\n * Unlike {@link SKIP_DIRS}, these files legitimately sit at a project root\n * (next to the manifest that declares the project), so they are filtered\n * per-file rather than by pruning a directory. Manifests that *define* a\n * project (package.json, go.mod, Cargo.toml, *.csproj, …) are deliberately NOT\n * here — they are the source of truth for project discovery. Compared\n * case-insensitively against the basename, so every entry must be lowercase.\n * Keep in sync with `docs/DEPENDENCY-EXCLUSIONS.md`.\n */\nexport const SOURCE_EXCLUDE_FILES = new Set([\n  // JavaScript / Node\n  'package-lock.json', 'npm-shrinkwrap.json', 'yarn.lock',\n  'pnpm-lock.yaml', 'bun.lockb', 'bun.lock', 'deno.lock',\n  '.pnp.cjs', '.pnp.data.json',            // Yarn PnP (generated, can be large)\n  // Python\n  'poetry.lock', 'pipfile.lock', 'pdm.lock', 'uv.lock',\n  'pylock.toml',                           // PEP 751 standard lock\n  'conda-lock.yml',\n  // Ruby\n  'gemfile.lock',\n  // PHP\n  'composer.lock',\n  // Rust\n  'cargo.lock',\n  // Go\n  'go.sum', 'go.work.sum', 'gopkg.lock', 'glide.lock',\n  // .NET\n  'packages.lock.json',\n  // Java / JVM (Gradle)\n  'gradle.lockfile',\n  // Swift / Xcode\n  'package.resolved',\n  // Dart / Flutter\n  'pubspec.lock',\n  // Elixir\n  'mix.lock',\n  // Haskell (Cabal / Stack)\n  'cabal.project.freeze', 'stack.yaml.lock',\n  // Julia\n  'manifest.toml',\n  // R\n  'renv.lock',\n  // Perl (Carton)\n  'cpanfile.snapshot',\n  // CocoaPods / Carthage\n  'podfile.lock', 'cartfile.resolved',\n  // Terraform / IaC\n  '.terraform.lock.hcl',\n  // Helm\n  'chart.lock',\n  // C / C++ (Conan)\n  'conan.lock',\n  // Bazel\n  'module.bazel.lock',\n  // Nix\n  'flake.lock',\n]);\n\n// ── Directory entry gathered in a single walk ──\n\nexport interface DirEntry {\n  /** Absolute path */\n  absPath: string;\n  /** Path relative to the walk root */\n  relPath: string;\n  /** Filename (basename) */\n  name: string;\n  /** Whether this is a regular file */\n  isFile: boolean;\n  /** Whether this is a directory */\n  isDirectory: boolean;\n}\n\n// ── FileCache: walk once, read once ──\n\n/**\n * Maximum file size (in bytes) that will be held in the text cache.\n * Files larger than this are read from disk but NOT stored — this prevents\n * lockfiles (pnpm-lock.yaml, package-lock.json, etc.) from consuming\n * 50-200 MB of heap.  Small config files like package.json (~1-5 KB each)\n * are cached normally.\n */\nconst TEXT_CACHE_MAX_BYTES = 1_048_576; // 1 MB\n\n/**\n * Shared cache that ensures the filesystem is walked at most once per root dir\n * and every small file is read at most once across all scanners.\n *\n * Memory-conscious design:\n * - Walk results are stored once; consumers filter in-memory.\n * - File content is only cached when ≤ TEXT_CACHE_MAX_BYTES (1 MB).\n *   Large files (lockfiles) pass straight through without caching.\n * - readJsonFile evicts the raw-text entry after parsing so we never\n *   hold *both* the string and the parsed object for the same file.\n * - No stat caching — only file-hotspots uses stat and there's no\n *   cross-scanner reuse to justify holding thousands of Stats objects.\n * - Call `clear()` after the scan to release all remaining references.\n */\nexport class FileCache {\n  /** Directory walk results keyed by rootDir */\n  private walkCache = new Map<string, Promise<DirEntry[]>>();\n  /** File content keyed by absolute path (only files ≤ TEXT_CACHE_MAX_BYTES) */\n  private textCache = new Map<string, Promise<string>>();\n  /** Parsed JSON keyed by absolute path */\n  private jsonCache = new Map<string, Promise<unknown>>();\n  /** pathExists keyed by absolute path */\n  private existsCache = new Map<string, Promise<boolean>>();\n  /** User-configured exclude predicate (compiled from glob patterns) */\n  private excludePredicate: ((relPath: string) => boolean) | null = null;\n  /** Directories that were auto-skipped because they were stuck */\n  private _stuckPaths: string[] = [];\n  /** Files skipped because they exceed maxFileSizeToScan */\n  private _skippedLargeFiles: string[] = [];\n  /** Maximum file size (bytes) we will read. 0 = unlimited. */\n  private _maxFileSize = 0;\n  /** Per-project / per-directory scan timeout in ms. */\n  private _projectScanTimeout = 180_000;\n  /** Whether we have already shown the \"increase projectScanTimeout\" hint */\n  private _timeoutHintShown = false;\n  /** Root dir for relative-path computation (set by the first walkDir call) */\n  private _rootDir: string | null = null;\n  /** Cached tree summary captured during the shared walk */\n  private walkSummary = new Map<string, TreeCount>();\n  /** Fast lookup for exact filename (e.g. package.json) */\n  private fileNameIndex = new Map<string, Map<string, string[]>>();\n  /** Per-file byte size keyed by absolute path (memoised so nested projects don't re-stat) */\n  private sizeCache = new Map<string, Promise<number>>();\n  /** Concurrency limiter for size stats */\n  private sizeSem = new Semaphore(64);\n\n  /** Set exclude patterns from config (call once before the walk) */\n  setExcludePatterns(patterns: string[]): void {\n    this.excludePredicate = compileGlobs(patterns);\n  }\n\n  /** Set the maximum file size in bytes that readTextFile / readJsonFile will process */\n  setMaxFileSize(bytes: number): void {\n    this._maxFileSize = bytes;\n  }\n\n  /** Set the per-project scan timeout (milliseconds). Scanners use this\n   *  instead of a hard-coded constant so the user can override it via config. */\n  setProjectScanTimeout(ms: number): void {\n    this._projectScanTimeout = ms;\n  }\n\n  /** Current per-project scan timeout in milliseconds */\n  get projectScanTimeout(): number {\n    return this._projectScanTimeout;\n  }\n\n  /** Record a path that timed out or was stuck during scanning */\n  addStuckPath(relPath: string): void {\n    this._stuckPaths.push(relPath);\n  }\n\n  /**\n   * Returns true the first time it is called, false thereafter.\n   * Used by scanners to print the \"increase projectScanTimeout\" hint\n   * only once per scan run.\n   */\n  shouldShowTimeoutHint(): boolean {\n    if (this._timeoutHintShown) return false;\n    this._timeoutHintShown = true;\n    return true;\n  }\n\n  /** Get all paths that were auto-skipped due to being stuck (dirs + scanner files) */\n  get stuckPaths(): readonly string[] {\n    return this._stuckPaths;\n  }\n\n  /** @deprecated Use stuckPaths instead */\n  get stuckDirs(): readonly string[] {\n    return this._stuckPaths;\n  }\n\n  /** Get files that were skipped because they exceeded maxFileSizeToScan */\n  get skippedLargeFiles(): readonly string[] {\n    return this._skippedLargeFiles;\n  }\n\n  // ── Directory walking ──\n\n  /**\n   * Walk the directory tree from `rootDir` once, skipping SKIP_DIRS plus\n   * common framework output dirs (.nuxt, .output, .svelte-kit).\n   *\n   * The result is memoised so every scanner filters the same array.\n   * Consumers that need additional filtering (e.g. SOURCE_EXTENSIONS,\n   * SKIP_EXTENSIONS) do so on the returned entries — no separate walk.\n   */\n  walkDir(rootDir: string, onProgress?: (filesFound: number, currentPath: string) => void): Promise<DirEntry[]> {\n    this._rootDir = rootDir;\n    const cached = this.walkCache.get(rootDir);\n    if (cached) return cached;\n\n    const promise = this._doWalk(rootDir, onProgress);\n    this.walkCache.set(rootDir, promise);\n    return promise;\n  }\n\n  /**\n   * Entries under `absDir`, reusing an already-cached ancestor walk when one\n   * exists. Per-project scanners must call this instead of `walkDir(projectDir)`\n   * so a large monorepo is not re-walked once per package.\n   *\n   * `relPath` is rebased to `absDir` so callers see the same shape as a\n   * fresh `walkDir` of that directory.\n   */\n  async walkDirUnder(absDir: string): Promise<DirEntry[]> {\n    const resolved = path.resolve(absDir);\n\n    let exact: Promise<DirEntry[]> | undefined;\n    let bestAncestor: { root: string; promise: Promise<DirEntry[]> } | undefined;\n    for (const [key, promise] of this.walkCache) {\n      const cachedRoot = path.resolve(key);\n      if (cachedRoot === resolved) {\n        exact = promise;\n        break;\n      }\n      const rel = path.relative(cachedRoot, resolved);\n      if (!rel || rel.startsWith('..') || path.isAbsolute(rel)) continue;\n      if (!bestAncestor || cachedRoot.length > path.resolve(bestAncestor.root).length) {\n        bestAncestor = { root: key, promise };\n      }\n    }\n    if (exact) return exact;\n\n    if (bestAncestor) {\n      const entries = await bestAncestor.promise;\n      const prefix = resolved.endsWith(path.sep) ? resolved : resolved + path.sep;\n      return entries\n        .filter((e) => e.absPath === resolved || e.absPath.startsWith(prefix))\n        .map((e) => ({ ...e, relPath: path.relative(resolved, e.absPath) }));\n    }\n\n    return this.walkDir(resolved);\n  }\n\n  /** Return tree summary from the cached walk, if available. */\n  getWalkSummary(rootDir: string): TreeCount | undefined {\n    return this.walkSummary.get(rootDir);\n  }\n\n  /** Additional dirs skipped only by the cached walk (framework outputs) */\n  private static readonly EXTRA_SKIP = EXTRA_SKIP_DIRS;\n\n  private async _doWalk(rootDir: string, onProgress?: (filesFound: number, currentPath: string) => void): Promise<DirEntry[]> {\n    const results: DirEntry[] = [];\n    const cores = typeof os.availableParallelism === 'function' ? os.availableParallelism() : os.cpus().length || 4;\n    const maxConcurrentReads = Math.max(8, Math.min(64, cores * 4));\n    let foundCount = 0;\n    let lastReported = 0;\n    const REPORT_INTERVAL = 50; // report every N files\n    // Semaphore limits concurrent readdir I/O only — NOT the entire\n    // recursive walk.  Previously sem.run wrapped the whole walk(),\n    // so parent directories held a slot while awaiting children,\n    // starving deep trees into near-serial execution.\n    const sem = new Semaphore(maxConcurrentReads);\n    const STUCK_TIMEOUT_MS = this._projectScanTimeout;\n\n    const extraSkip = FileCache.EXTRA_SKIP;\n    const isExcluded = this.excludePredicate;\n    const stuckDirs = this._stuckPaths;\n\n    async function walk(dir: string, gitignoreLevels: GitignoreLevel[]) {\n      const relDir = path.relative(rootDir, dir);\n\n      // Report the directory we are ABOUT to read so the UI shows\n      // where we are if this readdir gets stuck.\n      if (onProgress) {\n        onProgress(foundCount, relDir || '.');\n      }\n\n      // Extend the .gitignore chain with this directory's own file (if any)\n      // BEFORE reading entries, so its rules apply to its own children —\n      // matching git's precedence (deepest applicable .gitignore wins).\n      const levels = await extendGitignoreLevels(dir, gitignoreLevels);\n\n      // Acquire the semaphore ONLY for the readdir I/O, then release\n      // immediately so parent dirs don't hold slots while awaiting children.\n      let entries: Dirent[] | null;\n      try {\n        entries = await sem.run(async () => {\n          const readPromise = fs.readdir(dir, { withFileTypes: true });\n          let stuckTimer: ReturnType<typeof setTimeout>;\n          const result = await Promise.race([\n            readPromise.then((e) => ({ ok: true as const, entries: e })),\n            new Promise<{ ok: false }>((resolve) => {\n              stuckTimer = setTimeout(() => resolve({ ok: false }), STUCK_TIMEOUT_MS);\n              stuckTimer.unref();\n            }),\n          ]);\n          clearTimeout(stuckTimer!);\n          if (!result.ok) {\n            // Directory read timed out — record and skip\n            stuckDirs.push(relDir || dir);\n            return null;\n          }\n          return result.entries;\n        });\n      } catch {\n        return;\n      }\n      if (!entries) return;\n\n      const subWalks: Promise<void>[] = [];\n      for (const e of entries) {\n        const absPath = path.join(dir, e.name);\n        const relPath = path.relative(rootDir, absPath);\n\n        // Check user-configured excludes\n        if (isExcluded && isExcluded(relPath)) continue;\n\n        if (e.isDirectory()) {\n          if (isSkippedDirName(e.name) || extraSkip.has(e.name)) continue;\n          // Respect .gitignore (root + any nested ones seen so far) so\n          // repo-specific, non-canonically-named build/dependency/cache dirs\n          // (e.g. a custom-named virtualenv) don't get walked just because\n          // they aren't on the hardcoded SKIP_DIRS list.\n          if (isGitignored(levels, absPath, true)) continue;\n          results.push({ absPath, relPath, name: e.name, isFile: false, isDirectory: true });\n          // Launch sub-walk WITHOUT wrapping in sem.run — child walks\n          // acquire the semaphore independently for their own readdir.\n          subWalks.push(walk(absPath, levels));\n        } else if (e.isFile()) {\n          // Skip binary/font/media files that no scanner needs\n          const ext = path.extname(e.name).toLowerCase();\n          if (SKIP_EXTENSIONS.has(ext)) continue;\n          if (isGitignored(levels, absPath, false)) continue;\n          results.push({ absPath, relPath, name: e.name, isFile: true, isDirectory: false });\n          foundCount++;\n          if (onProgress && foundCount - lastReported >= REPORT_INTERVAL) {\n            lastReported = foundCount;\n            onProgress(foundCount, relPath);\n          }\n        }\n      }\n      await Promise.all(subWalks);\n    }\n\n    await walk(rootDir, []);\n\n    let totalDirs = 0;\n    const rootNameIndex = new Map<string, string[]>();\n    for (const entry of results) {\n      if (entry.isDirectory) totalDirs++;\n      if (!entry.isFile) continue;\n      const bucket = rootNameIndex.get(entry.name);\n      if (bucket) {\n        bucket.push(entry.absPath);\n      } else {\n        rootNameIndex.set(entry.name, [entry.absPath]);\n      }\n    }\n    this.walkSummary.set(rootDir, { totalFiles: foundCount, totalDirs });\n    this.fileNameIndex.set(rootDir, rootNameIndex);\n\n    // Final progress report\n    if (onProgress && foundCount !== lastReported) {\n      onProgress(foundCount, '');\n    }\n    return results;\n  }\n\n  /**\n   * Find files matching a predicate from the cached walk.\n   * Returns absolute paths (same contract as the standalone `findFiles`).\n   */\n  async findFiles(rootDir: string, predicate: (name: string) => boolean): Promise<string[]> {\n    const entries = await this.walkDir(rootDir);\n    return entries.filter((e) => e.isFile && predicate(e.name)).map((e) => e.absPath);\n  }\n\n  async findPackageJsonFiles(rootDir: string): Promise<string[]> {\n    await this.walkDir(rootDir);\n    return this.fileNameIndex.get(rootDir)?.get('package.json') ?? [];\n  }\n\n  async findCsprojFiles(rootDir: string): Promise<string[]> {\n    const entries = await this.walkDir(rootDir);\n    return entries.filter((e) => e.isFile && e.name.endsWith('.csproj')).map((e) => e.absPath);\n  }\n\n  async findSolutionFiles(rootDir: string): Promise<string[]> {\n    const entries = await this.walkDir(rootDir);\n    return entries.filter((e) => e.isFile && e.name.endsWith('.sln')).map((e) => e.absPath);\n  }\n\n  /**\n   * Count files under a given directory using the cached walk data.\n   * Avoids a redundant recursive readdir that can be slow on large\n   * project trees (the main cause of per-project timeout hits).\n   * Falls back to the standalone `countFilesInDir` if the walk hasn't\n   * been populated yet.\n   */\n  async countFilesUnder(rootDir: string, dir: string): Promise<number> {\n    const entries = this.walkCache.get(rootDir);\n    if (!entries) {\n      // Walk not done yet — fall back to standalone count\n      return countFilesInDir(dir);\n    }\n    const resolved = await entries;\n    const prefix = dir.endsWith(path.sep) ? dir : dir + path.sep;\n    let count = 0;\n    for (const e of resolved) {\n      if (!e.isFile) continue;\n      // File is directly in `dir` or in a subdirectory of `dir`\n      if (e.absPath === dir || e.absPath.startsWith(prefix)) {\n        count++;\n      }\n    }\n    return count;\n  }\n\n  /** Stat a single file's byte size, memoised and concurrency-limited. */\n  private statSize(absPath: string): Promise<number> {\n    const cached = this.sizeCache.get(absPath);\n    if (cached) return cached;\n    const promise = this.sizeSem.run(async () => {\n      try {\n        const stat = await fs.stat(absPath);\n        return stat.size;\n      } catch {\n        return 0;\n      }\n    });\n    this.sizeCache.set(absPath, promise);\n    return promise;\n  }\n\n  /**\n   * Sum the byte size of every file under `dir` using the cached walk.\n   * Mirrors {@link countFilesUnder}; per-file stats are memoised so nested\n   * project trees are never stat-ed twice. Falls back to a standalone walk\n   * when the cache has not been populated yet.\n   */\n  async bytesUnder(rootDir: string, dir: string): Promise<number> {\n    const entries = this.walkCache.get(rootDir);\n    if (!entries) {\n      // Walk not done yet — fall back to a standalone size walk\n      return bytesInDir(dir);\n    }\n    const resolved = await entries;\n    const prefix = dir.endsWith(path.sep) ? dir : dir + path.sep;\n    const sizes = await Promise.all(\n      resolved\n        .filter((e) => e.isFile && (e.absPath === dir || e.absPath.startsWith(prefix)))\n        .map((e) => this.statSize(e.absPath)),\n    );\n    return sizes.reduce((total, size) => total + size, 0);\n  }\n\n  /**\n   * Source-only file count and byte size under `dir`, used for billing\n   * classification. Identical to {@link countFilesUnder} / {@link bytesUnder}\n   * but additionally excludes lockfiles and generated dependency manifests\n   * (see {@link SOURCE_EXCLUDE_FILES}); vendored and build-output directories\n   * are already excluded by the shared walk. Walks the cached entries once so\n   * the count and size stay consistent. Falls back to the standalone walks\n   * when the cache has not been populated yet.\n   */\n  async sourceMetricsUnder(rootDir: string, dir: string): Promise<{ fileCount: number; sizeBytes: number }> {\n    const entries = this.walkCache.get(rootDir);\n    if (!entries) {\n      // Walk not done yet — fall back to standalone walks.\n      const [fileCount, sizeBytes] = await Promise.all([countFilesInDir(dir), bytesInDir(dir)]);\n      return { fileCount, sizeBytes };\n    }\n    const resolved = await entries;\n    const prefix = dir.endsWith(path.sep) ? dir : dir + path.sep;\n    const sourceFiles = resolved.filter(\n      (e) =>\n        e.isFile &&\n        (e.absPath === dir || e.absPath.startsWith(prefix)) &&\n        !SOURCE_EXCLUDE_FILES.has(e.name.toLowerCase()),\n    );\n    const sizes = await Promise.all(sourceFiles.map((e) => this.statSize(e.absPath)));\n    return {\n      fileCount: sourceFiles.length,\n      sizeBytes: sizes.reduce((total, size) => total + size, 0),\n    };\n  }\n\n  // ── File content reading ──\n\n  /**\n   * Read a text file. Files ≤ 1 MB are cached so subsequent calls from\n   * different scanners return the same string. Files > 1 MB (lockfiles,\n   * large generated files) are read directly and never retained.\n   *\n   * If maxFileSizeToScan is set and the file exceeds it, the file is\n   * recorded as skipped and an empty string is returned.\n   */\n  readTextFile(filePath: string): Promise<string> {\n    const abs = path.resolve(filePath);\n    const cached = this.textCache.get(abs);\n    if (cached) return cached;\n\n    const maxSize = this._maxFileSize;\n    const skippedLarge = this._skippedLargeFiles;\n    const rootDir = this._rootDir;\n\n    // Read file, then decide whether to cache based on size\n    const promise = (async () => {\n      // Check file size before reading when a limit is configured\n      if (maxSize > 0) {\n        try {\n          const stat = await fs.stat(abs);\n          if (stat.size > maxSize) {\n            const rel = rootDir ? path.relative(rootDir, abs) : abs;\n            skippedLarge.push(rel);\n            this.textCache.delete(abs);\n            return '';\n          }\n        } catch {\n          // If stat fails, fall through and let readFile handle it\n        }\n      }\n\n      const content = await fs.readFile(abs, 'utf8');\n      if (content.length > TEXT_CACHE_MAX_BYTES) {\n        // Too large for cache — evict so we don't hold it\n        this.textCache.delete(abs);\n      }\n      return content;\n    })();\n\n    // Temporarily store the promise so concurrent callers during the same\n    // tick await the same read (avoids double-reads even for large files).\n    this.textCache.set(abs, promise);\n    return promise;\n  }\n\n  /**\n   * Read and parse a JSON file. The parsed object is cached; the raw\n   * text is evicted immediately so we never hold both representations.\n   */\n  readJsonFile<T>(filePath: string): Promise<T> {\n    const abs = path.resolve(filePath);\n    const cached = this.jsonCache.get(abs);\n    if (cached) return cached as Promise<T>;\n\n    const promise = this.readTextFile(abs).then((txt) => {\n      // Evict raw text — we now have the parsed object\n      this.textCache.delete(abs);\n      return JSON.parse(stripBom(txt)) as T;\n    });\n    this.jsonCache.set(abs, promise);\n    return promise;\n  }\n\n  // ── Existence checks ──\n\n  pathExists(p: string): Promise<boolean> {\n    const abs = path.resolve(p);\n    const cached = this.existsCache.get(abs);\n    if (cached) return cached;\n    const promise = fs.access(abs).then(() => true, () => false);\n    this.existsCache.set(abs, promise);\n    return promise;\n  }\n\n  // ── Lifecycle ──\n\n  /** Release all cached data. Call after the scan completes. */\n  clear(): void {\n    this.walkCache.clear();\n    this.walkSummary.clear();\n    this.fileNameIndex.clear();\n    this.textCache.clear();\n    this.jsonCache.clear();\n    this.existsCache.clear();\n    this.sizeCache.clear();\n  }\n\n  /** Number of file content entries currently held */\n  get textCacheSize(): number { return this.textCache.size; }\n  /** Number of parsed JSON entries currently held */\n  get jsonCacheSize(): number { return this.jsonCache.size; }\n}\n\n// ── Quick tree count (fast pre-scan) ──\n\nexport interface TreeCount {\n  /** Total files discovered (excluding skipped dirs) */\n  totalFiles: number;\n  /** Total subdirectories discovered (excluding skipped dirs) */\n  totalDirs: number;\n}\n\n/**\n * Fast, lightweight traversal that only *counts* files and directories\n * without storing entries.  Used before the main scan so the progress\n * bar can show an accurate percentage.\n *\n * Respects the same SKIP_DIRS as the full walk.\n */\nexport async function quickTreeCount(rootDir: string, excludePatterns?: string[]): Promise<TreeCount> {\n  const native = await quickTreeCountWithRipgrep(rootDir, excludePatterns);\n  if (native) return native;\n\n  let totalFiles = 0;\n  let totalDirs = 0;\n  const cores = typeof os.availableParallelism === 'function' ? os.availableParallelism() : os.cpus().length || 4;\n  const maxConcurrent = Math.max(8, Math.min(128, cores * 8));\n  const sem = new Semaphore(maxConcurrent);\n  const extraSkip = EXTRA_SKIP_DIRS;\n  const isExcluded = excludePatterns ? compileGlobs(excludePatterns) : null;\n\n  async function count(dir: string, gitignoreLevels: GitignoreLevel[]) {\n    let entries: Dirent[];\n    try {\n      entries = await sem.run(() => fs.readdir(dir, { withFileTypes: true }));\n    } catch {\n      return;\n    }\n    const levels = await extendGitignoreLevels(dir, gitignoreLevels);\n    const subs: Promise<void>[] = [];\n    for (const e of entries) {\n      const absPath = path.join(dir, e.name);\n      const relPath = path.relative(rootDir, absPath);\n      if (isExcluded && isExcluded(relPath)) continue;\n\n      if (e.isDirectory()) {\n        if (isSkippedDirName(e.name) || extraSkip.has(e.name)) continue;\n        if (isGitignored(levels, absPath, true)) continue;\n        totalDirs++;\n        subs.push(count(absPath, levels));\n      } else if (e.isFile()) {\n        const ext = path.extname(e.name).toLowerCase();\n        if (SKIP_EXTENSIONS.has(ext)) continue;\n        if (isGitignored(levels, absPath, false)) continue;\n        totalFiles++;\n      }\n    }\n    await Promise.all(subs);\n  }\n\n  await count(rootDir, []);\n  return { totalFiles, totalDirs };\n}\n\n\n\nexport function normalizeGlobForRipgrep(pattern: string): string {\n  return pattern.replace(/\\\\/g, '/');\n}\n\nasync function quickTreeCountWithRipgrep(rootDir: string, excludePatterns?: string[]): Promise<TreeCount | null> {\n  // `--hidden` includes dotfiles/dot-dirs (ripgrep skips them by default);\n  // deliberately NOT passing `--no-ignore` here so ripgrep applies its own\n  // (correct, battle-tested) .gitignore handling — root, nested, and global\n  // excludes — the same way `git status` would. This must stay in sync with\n  // the manual .gitignore handling in the JS walk fallback (`_doWalk`,\n  // `quickTreeCount`'s `count()`) below, which exists only for machines\n  // without `rg` on PATH.\n  const args = ['--files', '--hidden', '--null'];\n\n  for (const dir of SKIP_DIRS) {\n    args.push('-g', `!**/${dir}/**`);\n  }\n  for (const dir of EXTRA_SKIP_DIRS) {\n    args.push('-g', `!**/${dir}/**`);\n  }\n  for (const ext of SKIP_EXTENSIONS) {\n    args.push('-g', `!**/*${ext}`);\n  }\n  for (const pattern of (excludePatterns ?? [])) {\n    const trimmed = pattern.trim();\n    if (!trimmed) continue;\n    args.push('-g', `!${normalizeGlobForRipgrep(trimmed)}`);\n  }\n\n  try {\n    const { stdout } = await execFileAsync('rg', args, { cwd: rootDir, maxBuffer: 64 * 1024 * 1024, encoding: 'utf8' });\n    if (!stdout) return { totalFiles: 0, totalDirs: 0 };\n\n    const files = stdout.split('\\0').filter(Boolean);\n    const dirs = new Set<string>();\n    for (const file of files) {\n      const dir = path.dirname(file);\n      if (dir && dir !== '.') dirs.add(dir);\n    }\n\n    return { totalFiles: files.length, totalDirs: dirs.size };\n  } catch {\n    return null;\n  }\n}\n\n/**\n * Count the number of source files in a directory (non-recursive by default).\n * For project-level file counting, skips binary/media files.\n */\nexport async function countFilesInDir(dir: string, recursive = true): Promise<number> {\n  let count = 0;\n  const extraSkip = new Set(['obj', 'bin', 'Debug', 'Release', 'TestResults']);\n\n  async function walk(currentDir: string): Promise<void> {\n    let entries: Dirent[];\n    try {\n      entries = await fs.readdir(currentDir, { withFileTypes: true });\n    } catch {\n      return;\n    }\n    const subs: Promise<void>[] = [];\n    for (const e of entries) {\n      if (e.isDirectory()) {\n        if (!recursive) continue;\n        if (isSkippedDirName(e.name) || extraSkip.has(e.name)) continue;\n        subs.push(walk(path.join(currentDir, e.name)));\n      } else if (e.isFile()) {\n        const ext = path.extname(e.name).toLowerCase();\n        if (!SKIP_EXTENSIONS.has(ext)) count++;\n      }\n    }\n    await Promise.all(subs);\n  }\n\n  await walk(dir);\n  return count;\n}\n\n/**\n * Sum the byte size of all source files in a directory (recursive),\n * skipping common build/output dirs and binary/media files. Standalone\n * fallback for {@link FileCache.bytesUnder} when the cached walk is cold.\n */\nexport async function bytesInDir(dir: string, recursive = true): Promise<number> {\n  let bytes = 0;\n  const extraSkip = new Set(['obj', 'bin', 'Debug', 'Release', 'TestResults']);\n\n  async function walk(currentDir: string): Promise<void> {\n    let entries: Dirent[];\n    try {\n      entries = await fs.readdir(currentDir, { withFileTypes: true });\n    } catch {\n      return;\n    }\n    const subs: Promise<void>[] = [];\n    for (const e of entries) {\n      if (e.isDirectory()) {\n        if (!recursive) continue;\n        if (isSkippedDirName(e.name) || extraSkip.has(e.name)) continue;\n        subs.push(walk(path.join(currentDir, e.name)));\n      } else if (e.isFile()) {\n        const ext = path.extname(e.name).toLowerCase();\n        if (SKIP_EXTENSIONS.has(ext)) continue;\n        try {\n          const stat = await fs.stat(path.join(currentDir, e.name));\n          bytes += stat.size;\n        } catch {\n          // ignore unreadable files\n        }\n      }\n    }\n    await Promise.all(subs);\n  }\n\n  await walk(dir);\n  return bytes;\n}\n\n/** Recursively find files matching a predicate, skipping common build/output dirs */\nexport async function findFiles(\n  rootDir: string,\n  predicate: (name: string) => boolean,\n): Promise<string[]> {\n  const results: string[] = [];\n  const cores = typeof os.availableParallelism === 'function' ? os.availableParallelism() : os.cpus().length || 4;\n  const maxConcurrentReads = Math.max(8, Math.min(64, cores * 4));\n  const readDirSemaphore = new Semaphore(maxConcurrentReads);\n\n  async function walk(dir: string) {\n    let entries: Dirent[];\n    try {\n      entries = await readDirSemaphore.run(() => fs.readdir(dir, { withFileTypes: true }));\n    } catch {\n      return;\n    }\n\n    const subDirectoryWalks: Promise<void>[] = [];\n\n    for (const e of entries) {\n      if (e.isDirectory()) {\n        if (isSkippedDirName(e.name)) continue;\n        subDirectoryWalks.push(walk(path.join(dir, e.name)));\n      } else if (e.isFile() && predicate(e.name)) {\n        const ext = path.extname(e.name).toLowerCase();\n        if (!SKIP_EXTENSIONS.has(ext)) results.push(path.join(dir, e.name));\n      }\n    }\n\n    await Promise.all(subDirectoryWalks);\n  }\n\n  await walk(rootDir);\n  return results;\n}\n\nexport async function findPackageJsonFiles(rootDir: string): Promise<string[]> {\n  return findFiles(rootDir, (name) => name === 'package.json');\n}\n\nexport async function findSolutionFiles(rootDir: string): Promise<string[]> {\n  return findFiles(rootDir, (name) => name.endsWith('.sln'));\n}\n\nexport async function findCsprojFiles(rootDir: string): Promise<string[]> {\n  return findFiles(rootDir, (name) => name.endsWith('.csproj'));\n}\n\n/**\n * Strip a UTF-8 byte-order mark — editors on Windows commonly save\n * manifests with a BOM, and JSON.parse rejects it, which silently\n * dropped the project from scan results.\n */\nexport function stripBom(text: string): string {\n  return text.charCodeAt(0) === 0xfeff ? text.slice(1) : text;\n}\n\nexport async function readJsonFile<T>(filePath: string): Promise<T> {\n  const txt = await fs.readFile(filePath, 'utf8');\n  return JSON.parse(stripBom(txt)) as T;\n}\n\nexport async function readTextFile(filePath: string): Promise<string> {\n  return fs.readFile(filePath, 'utf8');\n}\n\nexport async function pathExists(p: string): Promise<boolean> {\n  try {\n    await fs.access(p);\n    return true;\n  } catch {\n    return false;\n  }\n}\n\nexport async function ensureDir(dir: string): Promise<void> {\n  await fs.mkdir(dir, { recursive: true });\n}\n\nexport async function writeJsonFile(filePath: string, data: unknown): Promise<void> {\n  await ensureDir(path.dirname(filePath));\n  await fs.writeFile(filePath, JSON.stringify(data, null, 2) + '\\n', 'utf8');\n}\n\nexport async function writeTextFile(filePath: string, content: string): Promise<void> {\n  await ensureDir(path.dirname(filePath));\n  await fs.writeFile(filePath, content, 'utf8');\n}\n"]}

package/dist/{chunk-K267DHCF.js → chunk-O2DL2Q55.js}

@@ -1,7 +1,7 @@
-import { probeFreshness, hasDrift, buildGraph, writeSnapshot } from './chunk-RJCRWQNS.js';
-import { acquireLock, releaseLock } from './chunk-2GSMCOIC.js';
-import { cacheDir } from './chunk-QPXVTQ7O.js';
-import { vibgrateDir, writeArtifacts } from './chunk-ENFSSUNK.js';
+import { probeFreshness, hasDrift, buildGraph, writeSnapshot } from './chunk-E2FAQREZ.js';
+import { acquireLock, releaseLock } from './chunk-AXZZ5CCG.js';
+import { vibgrateDir, writeArtifacts } from './chunk-WVMOGIPC.js';
+import { cacheDir } from './chunk-MVPRPSXU.js';
 import * as fs from 'fs';
 import * as path from 'path';
 
@@ -61,5 +61,5 @@ async function refreshIfStale(root, opts = {}) {
 }
 
 export { refreshIfStale };
-//# sourceMappingURL=chunk-K267DHCF.js.map
-//# sourceMappingURL=chunk-K267DHCF.js.map
+//# sourceMappingURL=chunk-O2DL2Q55.js.map
+//# sourceMappingURL=chunk-O2DL2Q55.js.map

package/dist/{chunk-K267DHCF.js.map → chunk-O2DL2Q55.js.map}

@@ -1 +1 @@
-{"version":3,"sources":["../src/engine/refresh.ts"],"names":[],"mappings":";;;;;;;AAsDA,IAAM,qBAAA,GAAwB,KAAK,EAAA,GAAK,GAAA;AAExC,SAAS,gBAAgB,IAAA,EAAsB;AAC7C,EAAA,OAAY,IAAA,CAAA,IAAA,CAAK,QAAA,CAAS,IAAI,CAAA,EAAG,cAAc,CAAA;AACjD;AAMA,eAAsB,cAAA,CAAe,IAAA,EAAc,IAAA,GAAuB,EAAC,EAA4B;AACrG,EAAA,MAAM,KAAA,GAAQ,eAAe,IAAI,CAAA;AACjC,EAAA,IAAI,CAAC,KAAA,EAAO,OAAO,EAAE,QAAQ,aAAA,EAAc;AAC3C,EAAA,IAAI,CAAC,SAAS,KAAA,CAAM,KAAK,GAAG,OAAO,EAAE,QAAQ,OAAA,EAAQ;AAErD,EAAA,MAAM,IAAA,GAAO,gBAAgB,IAAI,CAAA;AACjC,EAAA,IAAI,CAAC,YAAY,IAAA,EAAM,qBAAqB,GAAG,OAAO,EAAE,QAAQ,QAAA,EAAS;AAEzE,EAAA,MAAM,KAAA,GAAQ,OAAA,CAAQ,MAAA,CAAO,MAAA,EAAO;AACpC,EAAA,IAAI;AACF,IAAA,MAAM,EAAE,OAAM,GAAI,KAAA;AAClB,IAAA,MAAM,MAAA,GAAS,MAAM,UAAA,CAAW;AAAA,MAC9B,IAAA;AAAA,MACA,MAAM,KAAA,CAAM,IAAA;AAAA,MACZ,SAAS,KAAA,CAAM,OAAA;AAAA,MACf,OAAO,KAAA,CAAM,KAAA;AAAA,MACb,MAAM,KAAA,CAAM,IAAA;AAAA,MACZ,UAAU,KAAA,CAAM,QAAA;AAAA,MAChB,MAAM,KAAA,CAAM,IAAA;AAAA,MACZ,QAAQ,KAAA,CAAM,MAAA;AAAA,MACd,OAAO,KAAA,CAAM,KAAA;AAAA,MACb,SAAS,KAAA,CAAM,OAAA;AAAA,MACf,aAAa,KAAA,CAAM,WAAA;AAAA,MACnB,QAAQ,IAAA,CAAK,MAAA;AAAA,MACb,MAAM,IAAA,CAAK;AAAA,KACZ,CAAA;AAED,IAAA,MAAM,KAAA,GAAQ,MAAA,CAAO,KAAA,CAAM,UAAA,CAAW,eAAe,KAAA,CAAM,UAAA;AAC3D,IAAA,IAAI,KAAA,EAAO;AACT,MAAA,MAAM,GAAA,GAAM,YAAY,IAAI,CAAA;AAC5B,MAAA,cAAA,CAAe,OAAO,KAAA,EAAO;AAAA,QAC3B,IAAA;AAAA,QACA,WAAW,IAAA,CAAK,SAAA;AAAA,QAChB,MAAA,EAAW,EAAA,CAAA,UAAA,CAAgB,IAAA,CAAA,IAAA,CAAK,GAAA,EAAK,iBAAiB,CAAC,CAAA;AAAA,QACvD,IAAA,EAAS,EAAA,CAAA,UAAA,CAAgB,IAAA,CAAA,IAAA,CAAK,GAAA,EAAK,YAAY,CAAC;AAAA,OACjD,CAAA;AAAA,IACH;AACA,IAAA,aAAA,CAAc,MAAM,MAAA,CAAO,KAAA,CAAM,WAAW,UAAA,EAAY,MAAA,CAAO,WAAW,KAAK,CAAA;AAE/E,IAAA,MAAM,KAAK,MAAA,CAAA,CAAQ,OAAA,CAAQ,OAAO,MAAA,EAAO,GAAI,SAAS,QAAQ,CAAA;AAC9D,IAAA,OAAO;AAAA,MACL,MAAA,EAAQ,WAAA;AAAA,MACR,OAAO,KAAA,CAAM,KAAA;AAAA,MACb,EAAA;AAAA,MACA,UAAU,MAAA,CAAO,QAAA;AAAA,MACjB,YAAY,MAAA,CAAO,UAAA;AAAA,MACnB;AAAA,KACF;AAAA,EACF,SAAS,GAAA,EAAK;AACZ,IAAA,OAAO,EAAE,MAAA,EAAQ,OAAA,EAAS,OAAA,EAAU,IAAc,OAAA,EAAQ;AAAA,EAC5D,CAAA,SAAE;AACA,IAAA,WAAA,CAAY,IAAI,CAAA;AAAA,EAClB;AACF","file":"chunk-K267DHCF.js","sourcesContent":["import * as fs from 'node:fs';\nimport * as path from 'node:path';\nimport { buildGraph } from './build.js';\nimport { probeFreshness, writeSnapshot, hasDrift, type Drift } from './freshness.js';\nimport { writeArtifacts, vibgrateDir } from './artifacts.js';\nimport { acquireLock, releaseLock } from './lock.js';\nimport { cacheDir } from './cache.js';\nimport type { ClusterMode } from './analyze.js';\n\n/**\n * Auto-refresh: bring the code map back in sync with the working tree when the\n * freshness probe says it drifted. The rebuild is the ordinary incremental\n * `buildGraph` (warm parse cache → only changed files re-parse), replaying the\n * scope recorded at the last explicit build, guarded by a cross-process lock\n * so a serving MCP process and a foreground command never write at once.\n *\n * Two properties keep this safe to run implicitly:\n * - **No git churn**: if the rebuilt corpusHash equals the snapshot's (e.g. a\n *   drift that reverted itself), `graph.json` is left untouched — the artifact\n *   stays byte-identical.\n * - **No surprise artifacts**: `GRAPH_REPORT.md`/`graph.html` are rewritten\n *   only if they already exist; a refresh never adds files a user's explicit\n *   build chose not to produce.\n */\n\nexport interface RefreshOptions {\n  /** Force single-threaded parsing (tests / constrained hosts). */\n  inline?: boolean;\n  /** Worker count for the parse pool. */\n  jobs?: number;\n  /**\n   * The map path already resolved by the caller (e.g. `vg serve`'s startup\n   * resolution). Passed straight through to `writeArtifacts` so a refresh\n   * never re-resolves it: `defaultGraphPath` shells out to `git rev-parse`\n   * (Fusion §4.1.1 branch keying), and re-running that on every drift-driven\n   * refresh put a synchronous git spawn back on the hot tool-call path this\n   * function exists to keep off of. Omit only when no caller-known path\n   * exists (falls back to a fresh `defaultGraphPath` resolution).\n   */\n  graphPath?: string;\n}\n\nexport type RefreshOutcome =\n  /** Map already matches the working tree. */\n  | { status: 'fresh' }\n  /** No freshness snapshot — no build ever ran here, so scope is unknown. */\n  | { status: 'no-snapshot' }\n  /** Another vg process is rebuilding right now; its write will land shortly. */\n  | { status: 'locked' }\n  /** Rebuilt. `wrote` is false when the corpus turned out unchanged. */\n  | { status: 'refreshed'; drift: Drift; ms: number; reparsed: number; totalFiles: number; wrote: boolean }\n  | { status: 'error'; message: string };\n\n/** A refresh stuck longer than this is presumed crashed and its lock reclaimed. */\nconst REFRESH_LOCK_STALE_MS = 10 * 60 * 1000;\n\nfunction refreshLockPath(root: string): string {\n  return path.join(cacheDir(root), 'refresh.lock');\n}\n\n/**\n * Probe, and rebuild incrementally if the tree drifted from the map.\n * Silent (no output) — callers own the messaging for their surface.\n */\nexport async function refreshIfStale(root: string, opts: RefreshOptions = {}): Promise<RefreshOutcome> {\n  const probe = probeFreshness(root);\n  if (!probe) return { status: 'no-snapshot' };\n  if (!hasDrift(probe.drift)) return { status: 'fresh' };\n\n  const lock = refreshLockPath(root);\n  if (!acquireLock(lock, REFRESH_LOCK_STALE_MS)) return { status: 'locked' };\n\n  const start = process.hrtime.bigint();\n  try {\n    const { scope } = probe;\n    const result = await buildGraph({\n      root,\n      only: scope.only,\n      exclude: scope.exclude,\n      paths: scope.paths,\n      deep: scope.deep,\n      noGround: scope.noGround,\n      scip: scope.scip,\n      noScip: scope.noScip,\n      noTsc: scope.noTsc,\n      cluster: scope.cluster as ClusterMode | undefined,\n      grammarsDir: scope.grammarsDir,\n      inline: opts.inline,\n      jobs: opts.jobs,\n    });\n\n    const wrote = result.graph.provenance.corpusHash !== probe.corpusHash;\n    if (wrote) {\n      const dir = vibgrateDir(root);\n      writeArtifacts(result.graph, {\n        root,\n        graphPath: opts.graphPath,\n        report: fs.existsSync(path.join(dir, 'GRAPH_REPORT.md')),\n        html: fs.existsSync(path.join(dir, 'graph.html')),\n      });\n    }\n    writeSnapshot(root, result.graph.provenance.corpusHash, result.fileStats, scope);\n\n    const ms = Number((process.hrtime.bigint() - start) / 1000000n);\n    return {\n      status: 'refreshed',\n      drift: probe.drift,\n      ms,\n      reparsed: result.reparsed,\n      totalFiles: result.totalFiles,\n      wrote,\n    };\n  } catch (err) {\n    return { status: 'error', message: (err as Error).message };\n  } finally {\n    releaseLock(lock);\n  }\n}\n"]}
+{"version":3,"sources":["../src/engine/refresh.ts"],"names":[],"mappings":";;;;;;;AAsDA,IAAM,qBAAA,GAAwB,KAAK,EAAA,GAAK,GAAA;AAExC,SAAS,gBAAgB,IAAA,EAAsB;AAC7C,EAAA,OAAY,IAAA,CAAA,IAAA,CAAK,QAAA,CAAS,IAAI,CAAA,EAAG,cAAc,CAAA;AACjD;AAMA,eAAsB,cAAA,CAAe,IAAA,EAAc,IAAA,GAAuB,EAAC,EAA4B;AACrG,EAAA,MAAM,KAAA,GAAQ,eAAe,IAAI,CAAA;AACjC,EAAA,IAAI,CAAC,KAAA,EAAO,OAAO,EAAE,QAAQ,aAAA,EAAc;AAC3C,EAAA,IAAI,CAAC,SAAS,KAAA,CAAM,KAAK,GAAG,OAAO,EAAE,QAAQ,OAAA,EAAQ;AAErD,EAAA,MAAM,IAAA,GAAO,gBAAgB,IAAI,CAAA;AACjC,EAAA,IAAI,CAAC,YAAY,IAAA,EAAM,qBAAqB,GAAG,OAAO,EAAE,QAAQ,QAAA,EAAS;AAEzE,EAAA,MAAM,KAAA,GAAQ,OAAA,CAAQ,MAAA,CAAO,MAAA,EAAO;AACpC,EAAA,IAAI;AACF,IAAA,MAAM,EAAE,OAAM,GAAI,KAAA;AAClB,IAAA,MAAM,MAAA,GAAS,MAAM,UAAA,CAAW;AAAA,MAC9B,IAAA;AAAA,MACA,MAAM,KAAA,CAAM,IAAA;AAAA,MACZ,SAAS,KAAA,CAAM,OAAA;AAAA,MACf,OAAO,KAAA,CAAM,KAAA;AAAA,MACb,MAAM,KAAA,CAAM,IAAA;AAAA,MACZ,UAAU,KAAA,CAAM,QAAA;AAAA,MAChB,MAAM,KAAA,CAAM,IAAA;AAAA,MACZ,QAAQ,KAAA,CAAM,MAAA;AAAA,MACd,OAAO,KAAA,CAAM,KAAA;AAAA,MACb,SAAS,KAAA,CAAM,OAAA;AAAA,MACf,aAAa,KAAA,CAAM,WAAA;AAAA,MACnB,QAAQ,IAAA,CAAK,MAAA;AAAA,MACb,MAAM,IAAA,CAAK;AAAA,KACZ,CAAA;AAED,IAAA,MAAM,KAAA,GAAQ,MAAA,CAAO,KAAA,CAAM,UAAA,CAAW,eAAe,KAAA,CAAM,UAAA;AAC3D,IAAA,IAAI,KAAA,EAAO;AACT,MAAA,MAAM,GAAA,GAAM,YAAY,IAAI,CAAA;AAC5B,MAAA,cAAA,CAAe,OAAO,KAAA,EAAO;AAAA,QAC3B,IAAA;AAAA,QACA,WAAW,IAAA,CAAK,SAAA;AAAA,QAChB,MAAA,EAAW,EAAA,CAAA,UAAA,CAAgB,IAAA,CAAA,IAAA,CAAK,GAAA,EAAK,iBAAiB,CAAC,CAAA;AAAA,QACvD,IAAA,EAAS,EAAA,CAAA,UAAA,CAAgB,IAAA,CAAA,IAAA,CAAK,GAAA,EAAK,YAAY,CAAC;AAAA,OACjD,CAAA;AAAA,IACH;AACA,IAAA,aAAA,CAAc,MAAM,MAAA,CAAO,KAAA,CAAM,WAAW,UAAA,EAAY,MAAA,CAAO,WAAW,KAAK,CAAA;AAE/E,IAAA,MAAM,KAAK,MAAA,CAAA,CAAQ,OAAA,CAAQ,OAAO,MAAA,EAAO,GAAI,SAAS,QAAQ,CAAA;AAC9D,IAAA,OAAO;AAAA,MACL,MAAA,EAAQ,WAAA;AAAA,MACR,OAAO,KAAA,CAAM,KAAA;AAAA,MACb,EAAA;AAAA,MACA,UAAU,MAAA,CAAO,QAAA;AAAA,MACjB,YAAY,MAAA,CAAO,UAAA;AAAA,MACnB;AAAA,KACF;AAAA,EACF,SAAS,GAAA,EAAK;AACZ,IAAA,OAAO,EAAE,MAAA,EAAQ,OAAA,EAAS,OAAA,EAAU,IAAc,OAAA,EAAQ;AAAA,EAC5D,CAAA,SAAE;AACA,IAAA,WAAA,CAAY,IAAI,CAAA;AAAA,EAClB;AACF","file":"chunk-O2DL2Q55.js","sourcesContent":["import * as fs from 'node:fs';\nimport * as path from 'node:path';\nimport { buildGraph } from './build.js';\nimport { probeFreshness, writeSnapshot, hasDrift, type Drift } from './freshness.js';\nimport { writeArtifacts, vibgrateDir } from './artifacts.js';\nimport { acquireLock, releaseLock } from './lock.js';\nimport { cacheDir } from './cache.js';\nimport type { ClusterMode } from './analyze.js';\n\n/**\n * Auto-refresh: bring the code map back in sync with the working tree when the\n * freshness probe says it drifted. The rebuild is the ordinary incremental\n * `buildGraph` (warm parse cache → only changed files re-parse), replaying the\n * scope recorded at the last explicit build, guarded by a cross-process lock\n * so a serving MCP process and a foreground command never write at once.\n *\n * Two properties keep this safe to run implicitly:\n * - **No git churn**: if the rebuilt corpusHash equals the snapshot's (e.g. a\n *   drift that reverted itself), `graph.json` is left untouched — the artifact\n *   stays byte-identical.\n * - **No surprise artifacts**: `GRAPH_REPORT.md`/`graph.html` are rewritten\n *   only if they already exist; a refresh never adds files a user's explicit\n *   build chose not to produce.\n */\n\nexport interface RefreshOptions {\n  /** Force single-threaded parsing (tests / constrained hosts). */\n  inline?: boolean;\n  /** Worker count for the parse pool. */\n  jobs?: number;\n  /**\n   * The map path already resolved by the caller (e.g. `vg serve`'s startup\n   * resolution). Passed straight through to `writeArtifacts` so a refresh\n   * never re-resolves it: `defaultGraphPath` shells out to `git rev-parse`\n   * (Fusion §4.1.1 branch keying), and re-running that on every drift-driven\n   * refresh put a synchronous git spawn back on the hot tool-call path this\n   * function exists to keep off of. Omit only when no caller-known path\n   * exists (falls back to a fresh `defaultGraphPath` resolution).\n   */\n  graphPath?: string;\n}\n\nexport type RefreshOutcome =\n  /** Map already matches the working tree. */\n  | { status: 'fresh' }\n  /** No freshness snapshot — no build ever ran here, so scope is unknown. */\n  | { status: 'no-snapshot' }\n  /** Another vg process is rebuilding right now; its write will land shortly. */\n  | { status: 'locked' }\n  /** Rebuilt. `wrote` is false when the corpus turned out unchanged. */\n  | { status: 'refreshed'; drift: Drift; ms: number; reparsed: number; totalFiles: number; wrote: boolean }\n  | { status: 'error'; message: string };\n\n/** A refresh stuck longer than this is presumed crashed and its lock reclaimed. */\nconst REFRESH_LOCK_STALE_MS = 10 * 60 * 1000;\n\nfunction refreshLockPath(root: string): string {\n  return path.join(cacheDir(root), 'refresh.lock');\n}\n\n/**\n * Probe, and rebuild incrementally if the tree drifted from the map.\n * Silent (no output) — callers own the messaging for their surface.\n */\nexport async function refreshIfStale(root: string, opts: RefreshOptions = {}): Promise<RefreshOutcome> {\n  const probe = probeFreshness(root);\n  if (!probe) return { status: 'no-snapshot' };\n  if (!hasDrift(probe.drift)) return { status: 'fresh' };\n\n  const lock = refreshLockPath(root);\n  if (!acquireLock(lock, REFRESH_LOCK_STALE_MS)) return { status: 'locked' };\n\n  const start = process.hrtime.bigint();\n  try {\n    const { scope } = probe;\n    const result = await buildGraph({\n      root,\n      only: scope.only,\n      exclude: scope.exclude,\n      paths: scope.paths,\n      deep: scope.deep,\n      noGround: scope.noGround,\n      scip: scope.scip,\n      noScip: scope.noScip,\n      noTsc: scope.noTsc,\n      cluster: scope.cluster as ClusterMode | undefined,\n      grammarsDir: scope.grammarsDir,\n      inline: opts.inline,\n      jobs: opts.jobs,\n    });\n\n    const wrote = result.graph.provenance.corpusHash !== probe.corpusHash;\n    if (wrote) {\n      const dir = vibgrateDir(root);\n      writeArtifacts(result.graph, {\n        root,\n        graphPath: opts.graphPath,\n        report: fs.existsSync(path.join(dir, 'GRAPH_REPORT.md')),\n        html: fs.existsSync(path.join(dir, 'graph.html')),\n      });\n    }\n    writeSnapshot(root, result.graph.provenance.corpusHash, result.fileStats, scope);\n\n    const ms = Number((process.hrtime.bigint() - start) / 1000000n);\n    return {\n      status: 'refreshed',\n      drift: probe.drift,\n      ms,\n      reparsed: result.reparsed,\n      totalFiles: result.totalFiles,\n      wrote,\n    };\n  } catch (err) {\n    return { status: 'error', message: (err as Error).message };\n  } finally {\n    releaseLock(lock);\n  }\n}\n"]}

package/dist/chunk-O3LABX6I.js

@@ -0,0 +1,43 @@
+// src/engine/serialize.ts
+function serializeGraph(graph, opts) {
+  const indent = opts?.compact ? 0 : 2;
+  return `${stableStringify(graph, indent)}
+`;
+}
+function slimGraphForExport(graph) {
+  return {
+    ...graph,
+    areas: graph.areas.map((a) => ({
+      ...a,
+      members: []
+      // member id lists dominate XL exports; area id still on nodes
+    })),
+    grounding: void 0,
+    facts: graph.facts
+    // Keep summaries/unknowns — small and useful to agents.
+  };
+}
+function stableStringify(value, indent = 2) {
+  return JSON.stringify(sortKeys(value), null, indent);
+}
+function sortKeys(value) {
+  if (Array.isArray(value)) return value.map(sortKeys);
+  if (value && typeof value === "object") {
+    const input = value;
+    const out = {};
+    for (const key of Object.keys(input).sort()) {
+      const v = input[key];
+      if (v === void 0) continue;
+      out[key] = sortKeys(v);
+    }
+    return out;
+  }
+  return value;
+}
+function parseGraph(json) {
+  return JSON.parse(json);
+}
+
+export { parseGraph, serializeGraph, slimGraphForExport, stableStringify };
+//# sourceMappingURL=chunk-O3LABX6I.js.map
+//# sourceMappingURL=chunk-O3LABX6I.js.map

package/dist/chunk-O3LABX6I.js.map

@@ -0,0 +1 @@
+{"version":3,"sources":["../src/engine/serialize.ts"],"names":[],"mappings":";AAWO,SAAS,cAAA,CAAe,OAAgB,IAAA,EAAsC;AAEnF,EAAA,MAAM,MAAA,GAAS,IAAA,EAAM,OAAA,GAAU,CAAA,GAAI,CAAA;AACnC,EAAA,OAAO,CAAA,EAAG,eAAA,CAAgB,KAAA,EAAO,MAAM,CAAC;AAAA,CAAA;AAC1C;AAMO,SAAS,mBAAmB,KAAA,EAAyB;AAC1D,EAAA,OAAO;AAAA,IACL,GAAG,KAAA;AAAA,IACH,KAAA,EAAO,KAAA,CAAM,KAAA,CAAM,GAAA,CAAI,CAAC,CAAA,MAAO;AAAA,MAC7B,GAAG,CAAA;AAAA,MACH,SAAS;AAAC;AAAA,KACZ,CAAE,CAAA;AAAA,IACF,SAAA,EAAW,MAAA;AAAA,IACX,OAAO,KAAA,CAAM;AAAA;AAAA,GAEf;AACF;AAEO,SAAS,eAAA,CAAgB,KAAA,EAAgB,MAAA,GAAS,CAAA,EAAW;AAClE,EAAA,OAAO,KAAK,SAAA,CAAU,QAAA,CAAS,KAAK,CAAA,EAAG,MAAM,MAAM,CAAA;AACrD;AAEA,SAAS,SAAS,KAAA,EAAyB;AACzC,EAAA,IAAI,MAAM,OAAA,CAAQ,KAAK,GAAG,OAAO,KAAA,CAAM,IAAI,QAAQ,CAAA;AACnD,EAAA,IAAI,KAAA,IAAS,OAAO,KAAA,KAAU,QAAA,EAAU;AACtC,IAAA,MAAM,KAAA,GAAQ,KAAA;AACd,IAAA,MAAM,MAA+B,EAAC;AACtC,IAAA,KAAA,MAAW,OAAO,MAAA,CAAO,IAAA,CAAK,KAAK,CAAA,CAAE,MAAK,EAAG;AAC3C,MAAA,MAAM,CAAA,GAAI,MAAM,GAAG,CAAA;AACnB,MAAA,IAAI,MAAM,MAAA,EAAW;AACrB,MAAA,GAAA,CAAI,GAAG,CAAA,GAAI,QAAA,CAAS,CAAC,CAAA;AAAA,IACvB;AACA,IAAA,OAAO,GAAA;AAAA,EACT;AACA,EAAA,OAAO,KAAA;AACT;AAEO,SAAS,WAAW,IAAA,EAAuB;AAChD,EAAA,OAAO,IAAA,CAAK,MAAM,IAAI,CAAA;AACxB","file":"chunk-O3LABX6I.js","sourcesContent":["import type { VgGraph } from '../schema.js';\n\n/**\n * Deterministic serialization of `graph.json`.\n *\n * Object keys are sorted recursively and arrays are emitted in the (already\n * stable) order the engine produced them, so two runs over identical content\n * yield byte-identical output — the determinism contract (VG-CLI-SPEC §1.3).\n * Pretty-printed (2-space) and newline-terminated so the committed artifact is\n * human-diffable and plays well with the union merge driver.\n */\nexport function serializeGraph(graph: VgGraph, opts?: { compact?: boolean }): string {\n  // Compact (no pretty-print) for large maps / CI artifacts — still deterministic.\n  const indent = opts?.compact ? 0 : 2;\n  return `${stableStringify(graph, indent)}\\n`;\n}\n\n/**\n * Drop heavy optional fields for export/sharing when size matters.\n * Does not mutate the input graph.\n */\nexport function slimGraphForExport(graph: VgGraph): VgGraph {\n  return {\n    ...graph,\n    areas: graph.areas.map((a) => ({\n      ...a,\n      members: [], // member id lists dominate XL exports; area id still on nodes\n    })),\n    grounding: undefined,\n    facts: graph.facts,\n    // Keep summaries/unknowns — small and useful to agents.\n  };\n}\n\nexport function stableStringify(value: unknown, indent = 2): string {\n  return JSON.stringify(sortKeys(value), null, indent);\n}\n\nfunction sortKeys(value: unknown): unknown {\n  if (Array.isArray(value)) return value.map(sortKeys);\n  if (value && typeof value === 'object') {\n    const input = value as Record<string, unknown>;\n    const out: Record<string, unknown> = {};\n    for (const key of Object.keys(input).sort()) {\n      const v = input[key];\n      if (v === undefined) continue; // omit undefined for stable output\n      out[key] = sortKeys(v);\n    }\n    return out;\n  }\n  return value;\n}\n\nexport function parseGraph(json: string): VgGraph {\n  return JSON.parse(json) as VgGraph;\n}\n"]}

package/dist/chunk-PRG2ULPK.js

@@ -0,0 +1,6 @@
+// src/version.ts
+var VERSION = "2026.817.2";
+
+export { VERSION };
+//# sourceMappingURL=chunk-PRG2ULPK.js.map
+//# sourceMappingURL=chunk-PRG2ULPK.js.map

package/dist/{chunk-PV76EO4G.js.map → chunk-PRG2ULPK.js.map}

@@ -1 +1 @@
-{"version":3,"sources":["../src/version.ts"],"names":[],"mappings":";AACO,IAAM,OAAA,GAAU","file":"chunk-PV76EO4G.js","sourcesContent":["// Calendar version (YYYY.DDD.PATCH), shared scheme with @vibgrate/cli.\nexport const VERSION = '2026.817.1';\n"]}
+{"version":3,"sources":["../src/version.ts"],"names":[],"mappings":";AACO,IAAM,OAAA,GAAU","file":"chunk-PRG2ULPK.js","sourcesContent":["// Calendar version (YYYY.DDD.PATCH), shared scheme with @vibgrate/cli.\nexport const VERSION = '2026.817.2';\n"]}

package/dist/{chunk-ZSECAGSU.js → chunk-Q3M6K3HY.js}

@@ -1,4 +1,4 @@
-import { ensureVibgrateGitignore } from './chunk-ENFSSUNK.js';
+import { ensureVibgrateGitignore } from './chunk-WVMOGIPC.js';
 import fs from 'fs';
 import path from 'path';
 
@@ -170,5 +170,5 @@ function findMatchingRule(action, rules) {
 }
 
 export { addApprovalRule, approvalsPath, findMatchingRule, globMatch, loadApprovalRules, normalizeCommandPrefix, removeApprovalRule, ruleForAction, ruleKey, ruleLabel, saveApprovalRules };
-//# sourceMappingURL=chunk-ZSECAGSU.js.map
-//# sourceMappingURL=chunk-ZSECAGSU.js.map
+//# sourceMappingURL=chunk-Q3M6K3HY.js.map
+//# sourceMappingURL=chunk-Q3M6K3HY.js.map