@vibgrate/cli 2026.803.1 → 2026.803.4

package/dist/chunk-4ZMJKR74.js.map

@@ -0,0 +1 @@
+{"version":3,"sources":["../src/runtime/vgd/protocol.ts","../src/runtime/active-graph-cache.ts","../src/runtime/vgd/registry.ts","../src/runtime/vgd/host-broker.ts","../src/runtime/vgd/embed-broker.ts","../src/runtime/vgd/server.ts","../src/runtime/branch-graph-session.ts"],"names":["path","dropped","idx","resolve","path2","fs","path3","graph"],"mappings":";;;;;;;;;;;;;;AAOO,IAAM,oBAAA,GAAuB;AA6M7B,SAAS,aAAa,IAAA,EAA8C;AACzE,EAAA,IAAI,GAAA;AACJ,EAAA,IAAI;AACF,IAAA,GAAA,GAAM,IAAA,CAAK,MAAM,IAAI,CAAA;AAAA,EACvB,CAAA,CAAA,MAAQ;AACN,IAAA,OAAO,EAAE,OAAO,cAAA,EAAe;AAAA,EACjC;AACA,EAAA,IAAI,CAAC,OAAO,OAAO,GAAA,KAAQ,UAAU,OAAO,EAAE,OAAO,2BAAA,EAA4B;AACjF,EAAA,MAAM,KAAM,GAAA,CAAyB,EAAA;AACrC,EAAA,IAAI,EAAA,KAAO,MAAA,IAAU,EAAA,KAAO,QAAA,IAAY,EAAA,KAAO,cAAc,EAAA,KAAO,MAAA,EAAQ,OAAO,EAAE,EAAA,EAAG;AACxF,EAAA,IAAI,OAAO,kBAAA,EAAoB;AAC7B,IAAA,MAAM,eAAgB,GAAA,CAAmC,YAAA;AACzD,IAAA,OAAO;AAAA,MACL,EAAA,EAAI,kBAAA;AAAA,MACJ,YAAA,EAAc,OAAO,YAAA,KAAiB,QAAA,IAAY,aAAa,IAAA,EAAK,GAAI,YAAA,CAAa,IAAA,EAAK,GAAI;AAAA,KAChG;AAAA,EACF;AACA,EAAA,IAAI,OAAO,gBAAA,EAAkB;AAC3B,IAAA,MAAM,eAAgB,GAAA,CAAmC,YAAA;AACzD,IAAA,MAAM,SAAU,GAAA,CAA6B,MAAA;AAC7C,IAAA,IAAI,OAAO,YAAA,KAAiB,QAAA,IAAY,CAAC,YAAA,CAAa,MAAK,EAAG,OAAO,EAAE,KAAA,EAAO,sCAAA,EAAuC;AACrH,IAAA,IAAI,OAAO,MAAA,KAAW,QAAA,IAAY,CAAC,MAAA,CAAO,MAAK,EAAG,OAAO,EAAE,KAAA,EAAO,gCAAA,EAAiC;AACnG,IAAA,OAAO,EAAE,EAAA,EAAI,gBAAA,EAAkB,YAAA,EAAc,YAAA,CAAa,MAAK,EAAG,MAAA,EAAQ,MAAA,CAAO,IAAA,EAAK,EAAE;AAAA,EAC1F;AACA,EAAA,IAAI,OAAO,WAAA,EAAa;AACtB,IAAA,MAAM,eAAgB,GAAA,CAAmC,YAAA;AACzD,IAAA,MAAM,SAAU,GAAA,CAA6B,MAAA;AAC7C,IAAA,MAAM,QAAS,GAAA,CAA4B,KAAA;AAC3C,IAAA,IAAI,OAAO,YAAA,KAAiB,QAAA,IAAY,CAAC,YAAA,CAAa,MAAK,EAAG,OAAO,EAAE,KAAA,EAAO,iCAAA,EAAkC;AAChH,IAAA,IAAI,OAAO,MAAA,KAAW,QAAA,IAAY,CAAC,MAAA,CAAO,MAAK,EAAG,OAAO,EAAE,KAAA,EAAO,2BAAA,EAA4B;AAC9F,IAAA,IAAI,CAAC,SAAS,OAAO,KAAA,KAAU,UAAU,OAAO,EAAE,OAAO,iCAAA,EAAkC;AAC3F,IAAA,OAAO,EAAE,EAAA,EAAI,WAAA,EAAa,YAAA,EAAc,YAAA,CAAa,IAAA,EAAK,EAAG,MAAA,EAAQ,MAAA,CAAO,IAAA,EAAK,EAAG,KAAA,EAAM;AAAA,EAC5F;AACA,EAAA,IAAI,OAAO,YAAA,EAAc;AACvB,IAAA,MAAM,OAAQ,GAAA,CAA2B,IAAA;AACzC,IAAA,MAAM,SAAU,GAAA,CAA6B,MAAA;AAC7C,IAAA,MAAM,YAAa,GAAA,CAAgC,SAAA;AACnD,IAAA,IAAI,OAAO,IAAA,KAAS,QAAA,IAAY,CAAC,IAAA,CAAK,MAAK,EAAG,OAAO,EAAE,KAAA,EAAO,sCAAA,EAAuC;AACrG,IAAA,OAAO;AAAA,MACL,EAAA,EAAI,YAAA;AAAA,MACJ,IAAA,EAAM,KAAK,IAAA,EAAK;AAAA,MAChB,MAAA,EAAQ,OAAO,MAAA,KAAW,QAAA,IAAY,OAAO,IAAA,EAAK,GAAI,MAAA,CAAO,IAAA,EAAK,GAAI,MAAA;AAAA,MACtE,SAAA,EAAW,OAAO,SAAA,KAAc,QAAA,IAAY,UAAU,IAAA,EAAK,GAAI,SAAA,CAAU,IAAA,EAAK,GAAI;AAAA,KACpF;AAAA,EACF;AACA,EAAA,IAAI,OAAO,cAAA,EAAgB;AACzB,IAAA,MAAM,eAAgB,GAAA,CAAmC,YAAA;AACzD,IAAA,OAAO;AAAA,MACL,EAAA,EAAI,cAAA;AAAA,MACJ,YAAA,EAAc,OAAO,YAAA,KAAiB,QAAA,IAAY,aAAa,IAAA,EAAK,GAAI,YAAA,CAAa,IAAA,EAAK,GAAI;AAAA,KAChG;AAAA,EACF;AACA,EAAA,IAAI,OAAO,aAAA,EAAe;AACxB,IAAA,MAAM,OAAQ,GAAA,CAA2B,IAAA;AACzC,IAAA,IAAI,OAAO,IAAA,KAAS,QAAA,IAAY,CAAC,IAAA,CAAK,MAAK,EAAG,OAAO,EAAE,KAAA,EAAO,2BAAA,EAA4B;AAG1F,IAAA,OAAO,EAAE,EAAA,EAAI,aAAA,EAAe,IAAA,EAAM,IAAA,CAAK,MAAK,CAAE,KAAA,CAAM,CAAA,EAAG,GAAK,CAAA,EAAE;AAAA,EAChE;AACA,EAAA,IAAI,OAAO,aAAA,EAAe;AACxB,IAAA,MAAM,eAAgB,GAAA,CAAmC,YAAA;AACzD,IAAA,MAAM,SAAU,GAAA,CAA6B,MAAA;AAC7C,IAAA,IAAI,OAAO,YAAA,KAAiB,QAAA,IAAY,CAAC,YAAA,CAAa,MAAK,EAAG,OAAO,EAAE,KAAA,EAAO,mCAAA,EAAoC;AAClH,IAAA,OAAO;AAAA,MACL,EAAA,EAAI,aAAA;AAAA,MACJ,YAAA,EAAc,aAAa,IAAA,EAAK;AAAA,MAChC,MAAA,EAAQ,OAAO,MAAA,KAAW,QAAA,IAAY,OAAO,IAAA,EAAK,GAAI,MAAA,CAAO,IAAA,EAAK,GAAI;AAAA,KACxE;AAAA,EACF;AACA,EAAA,IAAI,OAAO,aAAA,EAAe;AACxB,IAAA,MAAM,eAAgB,GAAA,CAAmC,YAAA;AACzD,IAAA,MAAM,QAAS,GAAA,CAA4B,KAAA;AAC3C,IAAA,MAAM,QAAS,GAAA,CAA4B,KAAA;AAC3C,IAAA,MAAM,SAAU,GAAA,CAA6B,MAAA;AAC7C,IAAA,IAAI,OAAO,YAAA,KAAiB,QAAA,IAAY,CAAC,YAAA,CAAa,MAAK,EAAG,OAAO,EAAE,KAAA,EAAO,mCAAA,EAAoC;AAClH,IAAA,IAAI,OAAO,KAAA,KAAU,QAAA,IAAY,CAAC,KAAA,CAAM,MAAK,EAAG,OAAO,EAAE,KAAA,EAAO,4BAAA,EAA6B;AAC7F,IAAA,OAAO;AAAA,MACL,EAAA,EAAI,aAAA;AAAA,MACJ,YAAA,EAAc,aAAa,IAAA,EAAK;AAAA,MAChC,KAAA,EAAO,MAAM,IAAA,EAAK;AAAA,MAClB,KAAA,EAAO,OAAO,KAAA,KAAU,QAAA,IAAY,KAAA,GAAQ,CAAA,GAAI,IAAA,CAAK,GAAA,CAAI,IAAA,CAAK,KAAA,CAAM,KAAK,CAAA,EAAG,EAAE,CAAA,GAAI,MAAA;AAAA,MAClF,MAAA,EAAQ,OAAO,MAAA,KAAW,QAAA,IAAY,OAAO,IAAA,EAAK,GAAI,MAAA,CAAO,IAAA,EAAK,GAAI;AAAA,KACxE;AAAA,EACF;AACA,EAAA,IAAI,OAAO,WAAA,EAAa;AACtB,IAAA,MAAM,eAAgB,GAAA,CAAmC,YAAA;AACzD,IAAA,MAAM,SAAU,GAAA,CAA6B,MAAA;AAC7C,IAAA,MAAM,QAAS,GAAA,CAA4B,KAAA;AAC3C,IAAA,MAAM,SAAU,GAAA,CAA6B,MAAA;AAC7C,IAAA,IAAI,OAAO,YAAA,KAAiB,QAAA,IAAY,CAAC,YAAA,CAAa,MAAK,EAAG,OAAO,EAAE,KAAA,EAAO,iCAAA,EAAkC;AAChH,IAAA,IAAI,OAAO,MAAA,KAAW,QAAA,IAAY,CAAC,MAAA,CAAO,MAAK,EAAG,OAAO,EAAE,KAAA,EAAO,2BAAA,EAA4B;AAC9F,IAAA,OAAO;AAAA,MACL,EAAA,EAAI,WAAA;AAAA,MACJ,YAAA,EAAc,aAAa,IAAA,EAAK;AAAA,MAChC,MAAA,EAAQ,OAAO,IAAA,EAAK;AAAA,MACpB,KAAA,EAAO,OAAO,KAAA,KAAU,QAAA,IAAY,KAAA,GAAQ,CAAA,GAAI,IAAA,CAAK,GAAA,CAAI,IAAA,CAAK,KAAA,CAAM,KAAK,CAAA,EAAG,EAAE,CAAA,GAAI,MAAA;AAAA,MAClF,MAAA,EAAQ,OAAO,MAAA,KAAW,QAAA,IAAY,OAAO,IAAA,EAAK,GAAI,MAAA,CAAO,IAAA,EAAK,GAAI;AAAA,KACxE;AAAA,EACF;AACA,EAAA,IAAI,OAAO,eAAA,EAAiB;AAC1B,IAAA,MAAM,eAAgB,GAAA,CAAmC,YAAA;AACzD,IAAA,MAAM,SAAU,GAAA,CAA6B,MAAA;AAC7C,IAAA,IAAI,OAAO,YAAA,KAAiB,QAAA,IAAY,CAAC,YAAA,CAAa,MAAK,EAAG,OAAO,EAAE,KAAA,EAAO,qCAAA,EAAsC;AACpH,IAAA,OAAO;AAAA,MACL,EAAA,EAAI,eAAA;AAAA,MACJ,YAAA,EAAc,aAAa,IAAA,EAAK;AAAA,MAChC,MAAA,EAAQ,OAAO,MAAA,KAAW,QAAA,IAAY,OAAO,IAAA,EAAK,GAAI,MAAA,CAAO,IAAA,EAAK,GAAI;AAAA,KACxE;AAAA,EACF;AACA,EAAA,IAAI,EAAA,KAAO,UAAA,IAAc,EAAA,KAAO,YAAA,EAAc;AAC5C,IAAA,MAAM,OAAQ,GAAA,CAA2B,IAAA;AACzC,IAAA,IAAI,OAAO,IAAA,KAAS,QAAA,IAAY,CAAC,IAAA,CAAK,IAAA,EAAK,EAAG,OAAO,EAAE,KAAA,EAAO,CAAA,EAAG,EAAE,CAAA,0BAAA,CAAA,EAA6B;AAChG,IAAA,MAAM,QAAS,GAAA,CAA4B,KAAA;AAC3C,IAAA,MAAM,OAAQ,GAAA,CAA2B,IAAA;AACzC,IAAA,IAAI,OAAO,UAAA,EAAY;AACrB,MAAA,OAAO;AAAA,QACL,EAAA,EAAI,UAAA;AAAA,QACJ,IAAA,EAAM,KAAK,IAAA,EAAK;AAAA,QAChB,KAAA,EAAO,OAAO,KAAA,KAAU,QAAA,GAAW,KAAA,GAAQ,MAAA;AAAA,QAC3C,IAAA,EAAM,IAAA,KAAS,SAAA,IAAa,IAAA,KAAS,WAAW,IAAA,GAAO;AAAA,OACzD;AAAA,IACF;AACA,IAAA,OAAO,EAAE,EAAA,EAAI,YAAA,EAAc,IAAA,EAAM,IAAA,CAAK,MAAK,EAAE;AAAA,EAC/C;AACA,EAAA,IAAI,OAAO,qBAAA,EAAuB;AAChC,IAAA,MAAM,cAAe,GAAA,CAAkC,WAAA;AACvD,IAAA,MAAM,UAAW,GAAA,CAA8B,OAAA;AAC/C,IAAA,IAAI,OAAO,WAAA,KAAgB,QAAA,IAAY,CAAC,WAAA,CAAY,MAAK,EAAG,OAAO,EAAE,KAAA,EAAO,0CAAA,EAA2C;AACvH,IAAA,IAAI,CAAC,KAAA,CAAM,OAAA,CAAQ,OAAO,CAAA,IAAK,OAAA,CAAQ,MAAA,KAAW,CAAA,EAAG,OAAO,EAAE,KAAA,EAAO,wCAAA,EAAyC;AAC9G,IAAA,MAAM,SAA+E,EAAC;AACtF,IAAA,KAAA,MAAW,KAAK,OAAA,EAAS;AACvB,MAAA,IAAI,CAAC,CAAA,IAAK,OAAO,CAAA,KAAM,QAAA,EAAU;AACjC,MAAA,MAAM,OAAQ,CAAA,CAAyB,IAAA;AACvC,MAAA,IAAI,OAAO,IAAA,KAAS,QAAA,IAAY,CAAC,IAAA,CAAK,MAAK,EAAG;AAC9C,MAAA,MAAM,QAAS,CAAA,CAA0B,KAAA;AACzC,MAAA,MAAM,OAAQ,CAAA,CAAyB,IAAA;AACvC,MAAA,MAAA,CAAO,IAAA,CAAK;AAAA,QACV,IAAA,EAAM,KAAK,IAAA,EAAK;AAAA,QAChB,KAAA,EAAO,OAAO,KAAA,KAAU,QAAA,GAAW,KAAA,GAAQ,MAAA;AAAA,QAC3C,IAAA,EAAM,IAAA,KAAS,SAAA,IAAa,IAAA,KAAS,WAAW,IAAA,GAAO;AAAA,OACxD,CAAA;AAAA,IACH;AACA,IAAA,IAAI,CAAC,MAAA,CAAO,MAAA,EAAQ,OAAO,EAAE,OAAO,4DAAA,EAA6D;AACjG,IAAA,OAAO,EAAE,IAAI,qBAAA,EAAuB,WAAA,EAAa,YAAY,IAAA,EAAK,EAAG,SAAS,MAAA,EAAO;AAAA,EACvF;AACA,EAAA,IAAI,EAAA,KAAO,aAAA,EAAe,OAAO,EAAE,IAAI,aAAA,EAAc;AACrD,EAAA,IAAI,OAAO,WAAA,EAAa;AACtB,IAAA,MAAM,YAAa,GAAA,CAAgC,SAAA;AACnD,IAAA,IAAI,OAAO,SAAA,KAAc,QAAA,IAAY,CAAC,SAAA,CAAU,MAAK,EAAG,OAAO,EAAE,KAAA,EAAO,8BAAA,EAA+B;AACvG,IAAA,OAAO,EAAE,EAAA,EAAI,WAAA,EAAa,SAAA,EAAW,SAAA,CAAU,MAAK,EAAE;AAAA,EACxD;AACA,EAAA,IAAI,OAAO,aAAA,EAAe;AACxB,IAAA,MAAM,YAAa,GAAA,CAAgC,SAAA;AACnD,IAAA,OAAO;AAAA,MACL,EAAA,EAAI,aAAA;AAAA,MACJ,SAAA,EAAW,OAAO,SAAA,KAAc,QAAA,IAAY,UAAU,IAAA,EAAK,GAAI,SAAA,CAAU,IAAA,EAAK,GAAI;AAAA,KACpF;AAAA,EACF;AACA,EAAA,IAAI,OAAO,eAAA,EAAiB;AAC1B,IAAA,MAAM,YAAa,GAAA,CAAgC,SAAA;AACnD,IAAA,MAAM,WAAY,GAAA,CAA+B,QAAA;AACjD,IAAA,IAAI,OAAO,SAAA,KAAc,QAAA,IAAY,CAAC,SAAA,CAAU,MAAK,EAAG,OAAO,EAAE,KAAA,EAAO,kCAAA,EAAmC;AAC3G,IAAA,IAAI,CAAC,KAAA,CAAM,OAAA,CAAQ,QAAQ,CAAA,IAAK,QAAA,CAAS,MAAA,KAAW,CAAA,EAAG,OAAO,EAAE,KAAA,EAAO,mCAAA,EAAoC;AAC3G,IAAA,MAAM,SAAmD,EAAC;AAC1D,IAAA,KAAA,MAAW,KAAK,QAAA,EAAU;AACxB,MAAA,IAAI,CAAC,CAAA,IAAK,OAAO,CAAA,KAAM,QAAA,EAAU;AACjC,MAAA,MAAM,OAAQ,CAAA,CAAyB,IAAA;AACvC,MAAA,MAAM,UAAW,CAAA,CAA4B,OAAA;AAC7C,MAAA,IAAI,OAAO,IAAA,KAAS,QAAA,IAAY,OAAO,YAAY,QAAA,EAAU;AAC7D,MAAA,MAAA,CAAO,IAAA,CAAK,EAAE,IAAA,EAAM,OAAA,EAAS,CAAA;AAAA,IAC/B;AACA,IAAA,IAAI,CAAC,MAAA,CAAO,MAAA,EAAQ,OAAO,EAAE,OAAO,kDAAA,EAAmD;AACvF,IAAA,MAAM,UAAW,GAAA,CAA8B,OAAA;AAC/C,IAAA,MAAM,iBAAkB,GAAA,CAAqC,cAAA;AAC7D,IAAA,MAAM,YAAa,GAAA,CAAgC,SAAA;AACnD,IAAA,MAAM,cAAe,GAAA,CAAkC,WAAA;AACvD,IAAA,OAAO;AAAA,MACL,EAAA,EAAI,eAAA;AAAA,MACJ,SAAA,EAAW,UAAU,IAAA,EAAK;AAAA,MAC1B,QAAA,EAAU,MAAA;AAAA,MACV,OAAA,EAAS,OAAO,OAAA,KAAY,QAAA,GAAW,OAAA,GAAU,MAAA;AAAA,MACjD,gBAAgB,cAAA,KAAmB,IAAA;AAAA,MACnC,SAAA,EAAW,OAAO,SAAA,KAAc,QAAA,GAAW,SAAA,GAAY,MAAA;AAAA,MACvD,WAAA,EAAa,OAAO,WAAA,KAAgB,QAAA,GAAW,WAAA,GAAc;AAAA,KAC/D;AAAA,EACF;AACA,EAAA,OAAO,EAAE,KAAA,EAAO,CAAA,YAAA,EAAe,MAAA,CAAO,EAAE,CAAC,CAAA,CAAA,EAAG;AAC9C;;;ACjYO,IAAM,4BAAA,GAA+B,KAAK,EAAA,GAAK;AA8C/C,IAAM,mBAAN,MAAuB;AAAA,EACX,KAAA,uBAAY,GAAA,EAA6B;AAAA;AAAA,EAEzC,UAAA,uBAAiB,GAAA,EAAoB;AAAA,EACrC,aAAA;AAAA,EACA,UAAA;AAAA,EACA,QAAA;AAAA,EACA,GAAA;AAAA,EACA,OAAA;AAAA,EAEjB,WAAA,CAAY,OAAA,GAAmC,EAAC,EAAG;AACjD,IAAA,IAAA,CAAK,UAAU,OAAA,CAAQ,OAAA;AACvB,IAAA,IAAA,CAAK,aAAA,GAAgB,QAAQ,aAAA,IAAiB,4BAAA;AAC9C,IAAA,IAAA,CAAK,UAAA,GAAa,QAAQ,UAAA,IAAc,CAAA;AACxC,IAAA,IAAA,CAAK,QAAA,GAAW,QAAQ,QAAA,IAAY,EAAA;AACpC,IAAA,IAAA,CAAK,GAAA,GAAM,OAAA,CAAQ,GAAA,KAAQ,MAAM,KAAK,GAAA,EAAI,CAAA;AAAA,EAC5C;AAAA,EAEA,IAAA,GAAe;AACb,IAAA,OAAO,KAAK,KAAA,CAAM,IAAA;AAAA,EACpB;AAAA,EAEA,GAAA,CAAI,cAAsB,MAAA,EAA6C;AACrE,IAAA,MAAM,OAAO,IAAA,CAAK,KAAA,CAAM,IAAI,kBAAA,CAAmB,YAAA,EAAc,MAAM,CAAC,CAAA;AACpE,IAAA,IAAI,IAAA,EAAM;AACR,MAAA,IAAA,CAAK,YAAA,GAAe,KAAK,GAAA,EAAI;AAAA,IAC/B;AACA,IAAA,OAAO,IAAA;AAAA,EACT;AAAA;AAAA;AAAA;AAAA;AAAA,EAMA,GAAA,CAAI,YAAA,EAAsB,MAAA,EAAgB,KAAA,EAAiC;AACzE,IAAA,MAAM,GAAA,GAAM,kBAAA,CAAmB,YAAA,EAAc,MAAM,CAAA;AACnD,IAAA,MAAM,CAAA,GAAI,KAAK,GAAA,EAAI;AACnB,IAAA,MAAM,QAAA,GAAW,IAAA,CAAK,KAAA,CAAM,GAAA,CAAI,GAAG,CAAA;AACnC,IAAA,MAAM,IAAA,GAAwB;AAAA,MAC5B,YAAA;AAAA,MACA,MAAA;AAAA,MACA,KAAA;AAAA,MACA,QAAA,EAAU,UAAU,QAAA,IAAY,CAAA;AAAA,MAChC,YAAA,EAAc,CAAA;AAAA,MACd,SAAA,EAAW,KAAA,CAAM,KAAA,EAAO,MAAA,IAAU;AAAA,KACpC;AACA,IAAA,IAAA,CAAK,KAAA,CAAM,GAAA,CAAI,GAAA,EAAK,IAAI,CAAA;AACxB,IAAA,IAAI,CAAC,IAAA,CAAK,UAAA,CAAW,GAAA,CAAI,YAAY,CAAA,EAAG;AACtC,MAAA,IAAA,CAAK,UAAA,CAAW,GAAA,CAAI,YAAA,EAAc,MAAM,CAAA;AAAA,IAC1C;AACA,IAAA,IAAA,CAAK,aAAA,EAAc;AACnB,IAAA,OAAO,IAAA;AAAA,EACT;AAAA;AAAA;AAAA;AAAA;AAAA,EAMA,MAAA,CAAO,cAAsB,MAAA,EAA6C;AACxE,IAAA,IAAA,CAAK,UAAA,CAAW,GAAA,CAAI,YAAA,EAAc,MAAM,CAAA;AACxC,IAAA,OAAO,IAAA,CAAK,GAAA,CAAI,YAAA,EAAc,MAAM,CAAA;AAAA,EACtC;AAAA;AAAA,EAGA,YAAY,YAAA,EAA0C;AACpD,IAAA,OAAO,IAAA,CAAK,UAAA,CAAW,GAAA,CAAI,YAAY,CAAA;AAAA,EACzC;AAAA,EAEA,QAAQ,YAAA,EAAmD;AACzD,IAAA,MAAM,GAAA,GAAM,IAAA,CAAK,UAAA,CAAW,GAAA,CAAI,YAAY,CAAA;AAC5C,IAAA,IAAI,CAAC,KAAK,OAAO,MAAA;AACjB,IAAA,OAAO,IAAA,CAAK,GAAA,CAAI,YAAA,EAAc,GAAG,CAAA;AAAA,EACnC;AAAA;AAAA;AAAA;AAAA;AAAA,EAMA,SAAA,CAAU,GAAA,GAAc,IAAA,CAAK,GAAA,EAAI,EAAa;AAC5C,IAAA,OAAO,IAAA,CAAK,KAAA,CAAM,GAAA,EAAK,KAAK,CAAA;AAAA,EAC9B;AAAA;AAAA,EAGA,aAAA,GAA0B;AACxB,IAAA,OAAO,IAAA,CAAK,KAAA,CAAM,IAAA,CAAK,GAAA,IAAO,IAAI,CAAA;AAAA,EACpC;AAAA,EAEA,KAAK,YAAA,EAAiD;AACpD,IAAA,MAAM,CAAA,GAAI,KAAK,GAAA,EAAI;AACnB,IAAA,MAAM,MAAgC,EAAC;AACvC,IAAA,KAAA,MAAW,IAAA,IAAQ,IAAA,CAAK,KAAA,CAAM,MAAA,EAAO,EAAG;AACtC,MAAA,IAAI,YAAA,IAAgB,IAAA,CAAK,YAAA,KAAiB,YAAA,EAAc;AACxD,MAAA,MAAM,UAAU,IAAA,CAAK,UAAA,CAAW,IAAI,IAAA,CAAK,YAAY,MAAM,IAAA,CAAK,MAAA;AAChE,MAAA,MAAM,MAAA,GAAS,IAAI,IAAA,CAAK,YAAA;AACxB,MAAA,GAAA,CAAI,IAAA,CAAK;AAAA,QACP,cAAc,IAAA,CAAK,YAAA;AAAA,QACnB,QAAQ,IAAA,CAAK,MAAA;AAAA,QACb,UAAU,IAAA,CAAK,QAAA;AAAA,QACf,cAAc,IAAA,CAAK,YAAA;AAAA,QACnB,WAAW,IAAA,CAAK,SAAA;AAAA,QAChB,OAAA;AAAA,QACA,MAAA;AAAA,QACA,SAAA,EAAW,CAAC,OAAA,IAAW,MAAA,IAAU,IAAA,CAAK;AAAA,OACvC,CAAA;AAAA,IACH;AACA,IAAA,OAAO,GAAA,CAAI,IAAA;AAAA,MACT,CAAC,CAAA,EAAG,CAAA,KAAM,CAAA,CAAE,YAAA,CAAa,aAAA,CAAc,CAAA,CAAE,YAAY,CAAA,IAAK,CAAA,CAAE,MAAA,CAAO,aAAA,CAAc,EAAE,MAAM;AAAA,KAC3F;AAAA,EACF;AAAA,EAEA,KAAA,GAAc;AACZ,IAAA,KAAA,MAAW,QAAQ,IAAA,CAAK,KAAA,CAAM,QAAO,EAAG,IAAA,CAAK,YAAY,IAAI,CAAA;AAC7D,IAAA,IAAA,CAAK,MAAM,KAAA,EAAM;AACjB,IAAA,IAAA,CAAK,WAAW,KAAA,EAAM;AAAA,EACxB;AAAA,EAEQ,YAAY,IAAA,EAAsD;AACxE,IAAA,IAAI,CAAC,KAAK,OAAA,EAAS;AACnB,IAAA,IAAI;AACF,MAAA,IAAA,CAAK,OAAA,CAAQ,EAAE,YAAA,EAAc,IAAA,CAAK,cAAc,MAAA,EAAQ,IAAA,CAAK,QAAQ,CAAA;AAAA,IACvE,CAAA,CAAA,MAAQ;AAAA,IAER;AAAA,EACF;AAAA,EAEQ,KAAA,CAAM,KAAa,aAAA,EAAkC;AAC3D,IAAA,MAAM,UAAoB,EAAC;AAE3B,IAAA,MAAM,SAAA,GAAY,CAAC,GAAA,KAAsB;AACvC,MAAA,MAAM,IAAA,GAAO,IAAA,CAAK,KAAA,CAAM,GAAA,CAAI,GAAG,CAAA;AAC/B,MAAA,IAAI,CAAC,IAAA,EAAM;AACX,MAAA,IAAA,CAAK,KAAA,CAAM,OAAO,GAAG,CAAA;AACrB,MAAA,OAAA,CAAQ,KAAK,GAAG,CAAA;AAChB,MAAA,IAAA,CAAK,YAAY,IAAI,CAAA;AAAA,IACvB,CAAA;AAGA,IAAA,MAAM,IAAA,GAAO,IAAA,CAAK,cAAA,CAAe,GAAA,EAAK,KAAK,aAAa,CAAA;AACxD,IAAA,IAAA,CAAK,KAAK,CAAC,CAAA,EAAG,MAAM,CAAA,CAAE,QAAA,GAAW,EAAE,QAAQ,CAAA;AAC3C,IAAA,KAAA,MAAW,QAAQ,IAAA,EAAM;AACvB,MAAA,SAAA,CAAU,kBAAA,CAAmB,IAAA,CAAK,YAAA,EAAc,IAAA,CAAK,MAAM,CAAC,CAAA;AAAA,IAC9D;AAGA,IAAA,IAAI,aAAA,EAAe;AACjB,MAAA,OAAO,IAAA,CAAK,KAAA,CAAM,IAAA,GAAO,IAAA,CAAK,QAAA,EAAU;AACtC,QAAA,MAAM,SAAS,IAAA,CAAK,cAAA;AAAA,UAAe,GAAA;AAAA;AAAA,UAA8B;AAAA,SAAK;AACtE,QAAA,IAAI,CAAC,MAAA,EAAQ;AACb,QAAA,SAAA,CAAU,kBAAA,CAAmB,MAAA,CAAO,YAAA,EAAc,MAAA,CAAO,MAAM,CAAC,CAAA;AAAA,MAClE;AAEA,MAAA,MAAM,MAAA,uBAAa,GAAA,EAA+B;AAClD,MAAA,KAAA,MAAW,CAAA,IAAK,IAAA,CAAK,KAAA,CAAM,MAAA,EAAO,EAAG;AACnC,QAAA,MAAM,OAAO,MAAA,CAAO,GAAA,CAAI,CAAA,CAAE,YAAY,KAAK,EAAC;AAC5C,QAAA,IAAA,CAAK,KAAK,CAAC,CAAA;AACX,QAAA,MAAA,CAAO,GAAA,CAAI,CAAA,CAAE,YAAA,EAAc,IAAI,CAAA;AAAA,MACjC;AACA,MAAA,KAAA,MAAW,CAAC,MAAA,EAAQ,IAAI,CAAA,IAAK,MAAA,EAAQ;AACnC,QAAA,IAAI,IAAA,CAAK,MAAA,IAAU,IAAA,CAAK,UAAA,EAAY;AACpC,QAAA,MAAM,UAAA,GAAa,KAChB,MAAA,CAAO,CAAC,MAAM,IAAA,CAAK,UAAA,CAAW,IAAI,MAAM,CAAA,KAAM,EAAE,MAAM,CAAA,CACtD,KAAK,CAAC,CAAA,EAAG,MAAM,CAAA,CAAE,QAAA,GAAW,EAAE,QAAQ,CAAA;AACzC,QAAA,IAAI,MAAA,GAAS,IAAA,CAAK,MAAA,GAAS,IAAA,CAAK,UAAA;AAChC,QAAA,KAAA,MAAW,KAAK,UAAA,EAAY;AAC1B,UAAA,IAAI,UAAU,CAAA,EAAG;AACjB,UAAA,SAAA,CAAU,kBAAA,CAAmB,CAAA,CAAE,YAAA,EAAc,CAAA,CAAE,MAAM,CAAC,CAAA;AACtD,UAAA,MAAA,EAAA;AAAA,QACF;AAAA,MACF;AAAA,IACF;AAEA,IAAA,OAAO,OAAA;AAAA,EACT;AAAA,EAEQ,cAAA,CAAe,KAAa,SAAA,EAAsC;AACxE,IAAA,MAAM,MAAyB,EAAC;AAChC,IAAA,KAAA,MAAW,IAAA,IAAQ,IAAA,CAAK,KAAA,CAAM,MAAA,EAAO,EAAG;AACtC,MAAA,IAAI,KAAK,UAAA,CAAW,GAAA,CAAI,KAAK,YAAY,CAAA,KAAM,KAAK,MAAA,EAAQ;AAC5D,MAAA,IAAI,MAAM,IAAA,CAAK,YAAA,IAAgB,SAAA,EAAW,GAAA,CAAI,KAAK,IAAI,CAAA;AAAA,IACzD;AACA,IAAA,OAAO,GAAA;AAAA,EACT;AAAA,EAEQ,cAAA,CAAe,KAAa,kBAAA,EAAqD;AACvF,IAAA,IAAI,IAAA,GAA+B,IAAA;AACnC,IAAA,KAAA,MAAW,IAAA,IAAQ,IAAA,CAAK,KAAA,CAAM,MAAA,EAAO,EAAG;AACtC,MAAA,IAAI,KAAK,UAAA,CAAW,GAAA,CAAI,KAAK,YAAY,CAAA,KAAM,KAAK,MAAA,EAAQ;AAC5D,MAAA,IAAI,kBAAA,IAAsB,GAAA,GAAM,IAAA,CAAK,YAAA,GAAe,KAAK,aAAA,EAAe;AACxE,MAAA,IAAI,CAAC,IAAA,IAAQ,IAAA,CAAK,QAAA,GAAW,IAAA,CAAK,UAAU,IAAA,GAAO,IAAA;AAAA,IACrD;AACA,IAAA,OAAO,IAAA;AAAA,EACT;AACF;;;ACvOO,IAAM,oBAAN,MAAwB;AAAA,EACZ,IAAA,uBAAW,GAAA,EAA6B;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAOjD,YAAA;AAAA;AAAA,EAEC,MAAA,GAAS,IAAI,gBAAA,CAAiB;AAAA,IACrC,OAAA,EAAS,CAAC,IAAA,KAAS,IAAA,CAAK,cAAc,YAAA,CAAa,IAAA,CAAK,YAAA,EAAc,IAAA,CAAK,MAAM;AAAA,GAClF,CAAA;AAAA;AAAA,EAGD,gBAAgB,QAAA,EAA+C;AAC7D,IAAA,IAAA,CAAK,YAAA,GAAe,QAAA;AAAA,EACtB;AAAA,EAEA,QAAA,CACE,MACA,GAAA,GAAkB,0BAAU,IAAA,EAAK,EACjC,IAAA,GAAyE,EAAC,EACzD;AACjB,IAAA,MAAM,QAAA,GAAgB,aAAQ,IAAI,CAAA;AAClC,IAAA,MAAM,EAAA,GAAK,qBAAqB,QAAQ,CAAA;AACxC,IAAA,MAAM,GAAA,GAAM,IAAA,CAAK,MAAA,GAAS,EAAE,GAAA,EAAK,IAAA,CAAK,MAAA,EAAQ,IAAA,EAAM,QAAA,EAAkB,GAAI,YAAA,CAAa,QAAQ,CAAA;AAC/F,IAAA,MAAM,SAAA,GACJ,GAAA,CAAI,IAAA,KAAS,MAAA,IAAU,GAAA,CAAI,GAAA,GAAM,qBAAA,CAAsB,QAAA,EAAU,GAAA,CAAI,GAAG,CAAA,GAAI,eAAA,CAAgB,QAAQ,CAAA;AACtG,IAAA,MAAM,MAAA,GAA0B;AAAA,MAC9B,EAAA;AAAA,MACA,IAAA,EAAM,QAAA;AAAA,MACN,SAAA;AAAA,MACA,YAAA,EAAc,GAAA,EAAI,CAAE,WAAA,EAAY;AAAA,MAChC,OAAO,IAAA,CAAK,KAAA;AAAA,MACZ,MAAM,IAAA,CAAK,IAAA;AAAA,MACX,MAAA,EAAQ,IAAI,GAAA,IAAO;AAAA,KACrB;AACA,IAAA,IAAA,CAAK,IAAA,CAAK,GAAA,CAAI,EAAA,EAAI,MAAM,CAAA;AACxB,IAAA,IAAI,IAAI,GAAA,EAAK,IAAA,CAAK,OAAO,MAAA,CAAO,EAAA,EAAI,IAAI,GAAG,CAAA;AAC3C,IAAA,OAAO,MAAA;AAAA,EACT;AAAA;AAAA;AAAA;AAAA;AAAA,EAMA,QAAA,CAAS,YAAA,EAAsB,MAAA,EAAgB,KAAA,EAAsB;AACnE,IAAA,IAAA,CAAK,MAAA,CAAO,GAAA,CAAI,YAAA,EAAc,MAAA,EAAQ,KAAK,CAAA;AAC3C,IAAA,IAAA,CAAK,MAAA,CAAO,MAAA,CAAO,YAAA,EAAc,MAAM,CAAA;AAEvC,IAAA,IAAA,CAAK,YAAA,EAAc,UAAA,CAAW,YAAA,EAAc,MAAA,EAAQ,KAAK,CAAA;AACzD,IAAA,IAAA,CAAK,YAAA,EAAc,aAAA,CAAc,YAAA,EAAc,MAAM,CAAA;AAAA,EACvD;AAAA;AAAA,EAGA,YAAA,CAAa,cAAsB,MAAA,EAAsB;AACvD,IAAA,IAAA,CAAK,MAAA,CAAO,MAAA,CAAO,YAAA,EAAc,MAAM,CAAA;AACvC,IAAA,IAAA,CAAK,YAAA,EAAc,aAAA,CAAc,YAAA,EAAc,MAAM,CAAA;AAAA,EACvD;AAAA;AAAA,EAGA,mBACE,OAAA,EACA,GAAA,GAAkB,sBAAM,IAAI,MAAK,EACd;AACnB,IAAA,OAAO,QAAQ,GAAA,CAAI,CAAC,CAAA,KAAM,IAAA,CAAK,SAAS,CAAA,CAAE,IAAA,EAAM,GAAA,EAAK,EAAE,OAAO,CAAA,CAAE,KAAA,EAAO,MAAM,CAAA,CAAE,IAAA,EAAM,CAAC,CAAA;AAAA,EACxF;AAAA,EAEA,WAAW,IAAA,EAAuB;AAChC,IAAA,MAAM,EAAA,GAAK,oBAAA,CAA0B,IAAA,CAAA,OAAA,CAAQ,IAAI,CAAC,CAAA;AAClD,IAAA,OAAO,IAAA,CAAK,IAAA,CAAK,MAAA,CAAO,EAAE,CAAA;AAAA,EAC5B;AAAA,EAEA,IAAA,GAA0B;AACxB,IAAA,OAAO,CAAC,GAAG,IAAA,CAAK,IAAA,CAAK,MAAA,EAAQ,CAAA,CAAE,IAAA,CAAK,CAAC,CAAA,EAAG,MAAM,CAAA,CAAE,IAAA,CAAK,aAAA,CAAc,CAAA,CAAE,IAAI,CAAC,CAAA;AAAA,EAC5E;AAAA,EAEA,IAAI,IAAA,EAA2C;AAC7C,IAAA,OAAO,KAAK,IAAA,CAAK,GAAA,CAAI,qBAA0B,IAAA,CAAA,OAAA,CAAQ,IAAI,CAAC,CAAC,CAAA;AAAA,EAC/D;AAAA;AAAA,EAGA,QAAQ,YAAA,EAAmD;AACzD,IAAA,OAAO,IAAA,CAAK,IAAA,CAAK,GAAA,CAAI,YAAY,CAAA;AAAA,EACnC;AAAA,EAEA,IAAA,GAAe;AACb,IAAA,OAAO,KAAK,IAAA,CAAK,IAAA;AAAA,EACnB;AAAA;AAAA;AAAA;AAAA;AAAA,EAMA,YAAA,CAAa,cAAsB,MAAA,EAA4D;AAC7F,IAAA,IAAI,MAAA,EAAQ;AACV,MAAA,MAAM,IAAA,GAAO,IAAA,CAAK,MAAA,CAAO,GAAA,CAAI,cAAc,MAAM,CAAA;AACjD,MAAA,IAAI,IAAA,SAAa,EAAE,KAAA,EAAO,KAAK,KAAA,EAAO,MAAA,EAAQ,KAAK,MAAA,EAAO;AAAA,IAC5D;AACA,IAAA,MAAM,OAAA,GAAU,IAAA,CAAK,MAAA,CAAO,OAAA,CAAQ,YAAY,CAAA;AAChD,IAAA,IAAI,OAAA,SAAgB,EAAE,KAAA,EAAO,QAAQ,KAAA,EAAO,MAAA,EAAQ,QAAQ,MAAA,EAAO;AAEnE,IAAA,MAAM,MAAM,IAAA,CAAK,MAAA,CACd,IAAA,CAAK,YAAY,EACjB,KAAA,EAAM,CACN,IAAA,CAAK,CAAC,GAAG,CAAA,KAAM,CAAA,CAAE,WAAW,CAAA,CAAE,QAAQ,EAAE,CAAC,CAAA;AAC5C,IAAA,IAAI,GAAA,EAAK;AACP,MAAA,MAAM,OAAO,IAAA,CAAK,MAAA,CAAO,GAAA,CAAI,YAAA,EAAc,IAAI,MAAM,CAAA;AACrD,MAAA,IAAI,IAAA,SAAa,EAAE,KAAA,EAAO,KAAK,KAAA,EAAO,MAAA,EAAQ,KAAK,MAAA,EAAO;AAAA,IAC5D;AACA,IAAA,OAAO,IAAA;AAAA,EACT;AACF;;;AC9FO,IAAM,gBAAN,MAAoB;AAAA,EACjB,OAAA,GAA0B,IAAA;AAAA,EACjB,MAAA,uBAAa,GAAA,EAAY;AAAA;AAAA,EAEzB,MAAA,uBAAa,GAAA,EAAyB;AAAA,EAEvD,WAAW,GAAA,EAA2B;AACpC,IAAA,IAAA,CAAK,OAAA,GAAU,GAAA;AAAA,EACjB;AAAA,EAEA,UAAA,GAAsB;AACpB,IAAA,OAAO,KAAK,OAAA,IAAW,IAAA;AAAA,EACzB;AAAA,EAEA,MAAA,GAA2B;AACzB,IAAA,MAAM,SAAiC,EAAC;AACxC,IAAA,KAAA,MAAW,CAACA,KAAAA,EAAM,OAAO,CAAA,IAAK,KAAK,MAAA,EAAQ;AACzC,MAAA,MAAA,CAAOA,KAAI,IAAI,OAAA,CAAQ,IAAA;AAAA,IACzB;AACA,IAAA,OAAO;AAAA,MACL,UAAU,mBAAA,EAAoB;AAAA,MAC9B,YAAA,EAAc,CAAC,GAAG,IAAA,CAAK,MAAM,CAAA;AAAA,MAC7B,YAAA,EAAc,KAAK,OAAA,IAAW,IAAA;AAAA,MAC9B,MAAA;AAAA,MACA,UAAU,gBAAA;AAAiB,KAC7B;AAAA,EACF;AAAA;AAAA;AAAA;AAAA;AAAA,EAMA,MAAM,IAAA,CACJ,SAAA,EACA,QAAA,EACyF;AACzF,IAAA,IAAI,CAAC,KAAK,OAAA,EAAS;AACjB,MAAA,OAAO,EAAE,EAAA,EAAI,KAAA,EAAO,KAAA,EAAO,mFAAA,EAA+E;AAAA,IAC5G;AACA,IAAA,IAAI;AACF,MAAA,MAAM,kBAAA,CAAmB,IAAA,CAAK,OAAA,EAAS,SAAS,CAAA;AAChD,MAAA,IAAA,CAAK,MAAA,CAAO,IAAI,SAAS,CAAA;AACzB,MAAA,IAAI,QAAA,EAAU;AACZ,QAAA,IAAI,GAAA,GAAM,IAAA,CAAK,MAAA,CAAO,GAAA,CAAI,SAAS,CAAA;AACnC,QAAA,IAAI,CAAC,GAAA,EAAK;AACR,UAAA,GAAA,uBAAU,GAAA,EAAI;AACd,UAAA,IAAA,CAAK,MAAA,CAAO,GAAA,CAAI,SAAA,EAAW,GAAG,CAAA;AAAA,QAChC;AACA,QAAA,GAAA,CAAI,IAAI,QAAQ,CAAA;AAAA,MAClB;AACA,MAAA,iBAAA,CAAkB,CAAC,CAAA;AACnB,MAAA,OAAO,EAAE,EAAA,EAAI,IAAA,EAAM,SAAA,EAAW,MAAA,EAAQ,IAAA,CAAK,MAAA,CAAO,GAAA,CAAI,SAAS,CAAA,EAAG,IAAA,IAAQ,CAAA,EAAE;AAAA,IAC9E,SAAS,CAAA,EAAG;AACV,MAAA,OAAO,EAAE,EAAA,EAAI,KAAA,EAAO,KAAA,EAAO,CAAA,YAAa,QAAQ,CAAA,CAAE,OAAA,GAAU,MAAA,CAAO,CAAC,CAAA,EAAE;AAAA,IACxE;AAAA,EACF;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAOA,MAAM,MAAA,CACJ,SAAA,EACA,QAAA,EACiE;AACjE,IAAA,IAAI,CAAC,SAAA,EAAW;AACd,MAAA,MAAM,IAAI,mBAAA,EAAoB;AAC9B,MAAA,oBAAA,EAAqB;AACrB,MAAA,IAAA,CAAK,OAAO,KAAA,EAAM;AAClB,MAAA,IAAA,CAAK,OAAO,KAAA,EAAM;AAClB,MAAA,OAAO,EAAE,EAAA,EAAI,IAAA,EAAM,OAAA,EAAS,CAAA,EAAG,iBAAiB,CAAA,EAAE;AAAA,IACpD;AAEA,IAAA,IAAI,QAAA,EAAU;AACZ,MAAA,MAAM,GAAA,GAAM,IAAA,CAAK,MAAA,CAAO,GAAA,CAAI,SAAS,CAAA;AACrC,MAAA,IAAI,GAAA,EAAK;AACP,QAAA,GAAA,CAAI,OAAO,QAAQ,CAAA;AACnB,QAAA,IAAI,IAAI,IAAA,KAAS,CAAA,EAAG,IAAA,CAAK,MAAA,CAAO,OAAO,SAAS,CAAA;AAAA,MAClD;AACA,MAAA,MAAM,YAAY,IAAA,CAAK,MAAA,CAAO,GAAA,CAAI,SAAS,GAAG,IAAA,IAAQ,CAAA;AACtD,MAAA,IAAI,cAAc,CAAA,EAAG;AACnB,QAAA,MAAMC,QAAAA,GAAU,eAAA,CAAgB,SAAS,CAAA,GAAI,CAAA,GAAI,CAAA;AACjD,QAAA,IAAA,CAAK,MAAA,CAAO,OAAO,SAAS,CAAA;AAC5B,QAAA,OAAO,EAAE,EAAA,EAAI,IAAA,EAAM,OAAA,EAASA,QAAAA,EAAS,iBAAiB,CAAA,EAAE;AAAA,MAC1D;AACA,MAAA,OAAO,EAAE,EAAA,EAAI,IAAA,EAAM,OAAA,EAAS,CAAA,EAAG,iBAAiB,SAAA,EAAU;AAAA,IAC5D;AAGA,IAAA,IAAA,CAAK,MAAA,CAAO,OAAO,SAAS,CAAA;AAC5B,IAAA,MAAM,OAAA,GAAU,eAAA,CAAgB,SAAS,CAAA,GAAI,CAAA,GAAI,CAAA;AACjD,IAAA,IAAA,CAAK,MAAA,CAAO,OAAO,SAAS,CAAA;AAC5B,IAAA,OAAO,EAAE,EAAA,EAAI,IAAA,EAAM,OAAA,EAAS,OAAA,EAAS,iBAAiB,CAAA,EAAE;AAAA,EAC1D;AAAA;AAAA,EAGA,WAAW,SAAA,EAA2B;AACpC,IAAA,OAAO,IAAA,CAAK,MAAA,CAAO,GAAA,CAAI,SAAS,GAAG,IAAA,IAAQ,CAAA;AAAA,EAC7C;AAAA,EAEA,MAAM,QAAA,CACJ,SAAA,EACA,QAAA,EACA,IAAA,EACkF;AAClF,IAAA,IAAI,CAAC,KAAK,OAAA,EAAS;AACjB,MAAA,OAAO,EAAE,EAAA,EAAI,KAAA,EAAO,KAAA,EAAO,6BAAA,EAA8B;AAAA,IAC3D;AACA,IAAA,IAAI;AACF,MAAA,MAAM,OAAA,GAAU,MAAM,kBAAA,CAAmB,IAAA,CAAK,SAAS,SAAS,CAAA;AAChE,MAAA,IAAA,CAAK,MAAA,CAAO,IAAI,SAAS,CAAA;AACzB,MAAA,MAAM,MAAA,GAAS,MAAM,iBAAA,CAAkB,OAAA,EAAS,QAAA,EAAU;AAAA,QACxD,SAAS,IAAA,EAAM,OAAA;AAAA,QACf,gBAAgB,IAAA,EAAM,cAAA;AAAA,QACtB,gBAAgB,IAAA,EAAM,cAAA;AAAA,QACtB,4BAA4B,IAAA,EAAM,0BAAA;AAAA,QAClC,iBAAiB,IAAA,EAAM,eAAA;AAAA,QACvB,WAAW,IAAA,EAAM,SAAA;AAAA,QACjB,aAAa,IAAA,EAAM,WAAA;AAAA,QACnB,gBAAgB,IAAA,EAAM;AAAA,OACvB,CAAA;AACD,MAAA,OAAO,EAAE,EAAA,EAAI,IAAA,EAAM,MAAA,EAAO;AAAA,IAC5B,SAAS,CAAA,EAAG;AACV,MAAA,OAAO,EAAE,EAAA,EAAI,KAAA,EAAO,KAAA,EAAO,CAAA,YAAa,QAAQ,CAAA,CAAE,OAAA,GAAU,MAAA,CAAO,CAAC,CAAA,EAAE;AAAA,IACxE;AAAA,EACF;AACF,CAAA;AAGA,IAAI,aAAA,GAAsC,IAAA;AAEnC,SAAS,gBAAA,GAAkC;AAChD,EAAA,IAAI,CAAC,aAAA,EAAe,aAAA,GAAgB,IAAI,aAAA,EAAc;AACtD,EAAA,OAAO,aAAA;AACT;AClFA,SAAS,SAAS,IAAA,EAAyB;AACzC,EAAA,MAAM,KAAA,GAAQ,CAAC,IAAA,CAAK,aAAA,IAAiB,KAAK,IAAA,EAAM,IAAA,CAAK,MAAM,IAAA,CAAK,IAAA,EAAM,KAAK,GAAG,CAAA,CAC3E,OAAO,CAAC,CAAA,KAAmB,OAAO,CAAA,KAAM,QAAA,IAAY,CAAA,CAAE,MAAA,GAAS,CAAC,CAAA;AACnE,EAAA,OAAO,MAAM,IAAA,CAAK,QAAK,CAAA,CAAE,KAAA,CAAM,GAAG,GAAG,CAAA;AACvC;AAEO,IAAM,cAAN,MAAkB;AAAA,EACf,KAAA,GAA6B,IAAA;AAAA,EAC7B,QAAA,GAAW,KAAA;AAAA,EACX,MAAA,GAAS,KAAA;AAAA,EACT,OAAA,GAAU,CAAA;AAAA,EACV,MAAA;AAAA,EACA,KAAA;AAAA,EACA,MAAA,GAAS,CAAA;AAAA,EACT,MAAA,GAAS,EAAA;AAAA,EACA,OAAA,uBAAc,GAAA,EAAqB;AAAA,EACnC,OAAA,uBAAc,GAAA,EAAuB;AAAA;AAAA,EAErC,QAAA,uBAAe,GAAA,EAAY;AAAA;AAAA,EAEpC,UAAA;AAAA,EACA,aAAA;AAAA,EAES,GAAA;AAAA,EACA,WAAA;AAAA,EACA,UAAA;AAAA,EACA,gBAAA;AAAA,EACA,SAAA;AAAA,EACA,GAAA;AAAA,EAEjB,WAAA,CAAY,OAAA,GAA8B,EAAC,EAAG;AAC5C,IAAA,IAAA,CAAK,GAAA,GAAM,OAAA,CAAQ,GAAA,KAAQ,MAAY;AAAA,IAAC,CAAA,CAAA;AACxC,IAAA,IAAA,CAAK,WAAA,GAAc,QAAQ,WAAA,IAAe,kBAAA;AAC1C,IAAA,IAAA,CAAK,UAAA,GAAa,QAAQ,UAAA,IAAc,CAAA;AACxC,IAAA,IAAA,CAAK,gBAAA,GAAmB,QAAQ,gBAAA,IAAoB,IAAA;AACpD,IAAA,IAAA,CAAK,SAAA,GAAY,QAAQ,SAAA,IAAa,GAAA;AACtC,IAAA,IAAA,CAAK,GAAA,GAAM,OAAA,CAAQ,GAAA,KAAQ,MAAc,KAAK,GAAA,EAAI,CAAA;AAAA,EACpD;AAAA,EAEA,MAAA,GAA4B;AAC1B,IAAA,OAAO;AAAA,MACL,MAAA,EAAQ,KAAK,MAAA,GAAS,aAAA,GAAgB,KAAK,KAAA,GAAQ,OAAA,GAAU,IAAA,CAAK,QAAA,GAAW,UAAA,GAAa,SAAA;AAAA,MAC1F,GAAA,EAAK,KAAK,KAAA,EAAO,GAAA;AAAA,MACjB,OAAO,IAAA,CAAK,KAAA;AAAA,MACZ,SAAS,IAAA,CAAK,OAAA;AAAA,MACd,QAAQ,IAAA,CAAK,MAAA;AAAA,MACb,KAAA,EAAO,KAAK,SAAA;AAAU,KACxB;AAAA,EACF;AAAA,EAEA,UAAU,YAAA,EAA2C;AACnD,IAAA,MAAM,MAA0B,EAAC;AACjC,IAAA,KAAA,MAAW,GAAA,IAAO,IAAA,CAAK,OAAA,CAAQ,MAAA,EAAO,EAAG;AACvC,MAAA,IAAI,YAAA,IAAgB,GAAA,CAAI,YAAA,KAAiB,YAAA,EAAc;AACvD,MAAA,GAAA,CAAI,IAAA,CAAK;AAAA,QACP,cAAc,GAAA,CAAI,YAAA;AAAA,QAClB,QAAQ,GAAA,CAAI,MAAA;AAAA,QACZ,OAAO,GAAA,CAAI,KAAA;AAAA,QACX,OAAA,EAAS,IAAI,OAAA,CAAQ,IAAA;AAAA,QACrB,WAAW,GAAA,CAAI,SAAA;AAAA,QACf,SAAS,GAAA,CAAI,OAAA;AAAA,QACb,SAAS,GAAA,CAAI,OAAA;AAAA,QACb,OAAO,GAAA,CAAI;AAAA,OACZ,CAAA;AAAA,IACH;AACA,IAAA,OAAO,IAAI,IAAA,CAAK,CAAC,CAAA,EAAG,CAAA,KAAM,EAAE,YAAA,CAAa,aAAA,CAAc,CAAA,CAAE,YAAY,KAAK,CAAA,CAAE,MAAA,CAAO,aAAA,CAAc,CAAA,CAAE,MAAM,CAAC,CAAA;AAAA,EAC5G;AAAA,EAEA,IAAA,CAAK,cAAsB,MAAA,EAAuC;AAChE,IAAA,OAAO,KAAK,OAAA,CAAQ,GAAA,CAAI,kBAAA,CAAmB,YAAA,EAAc,MAAM,CAAC,CAAA;AAAA,EAClE;AAAA;AAAA,EAGA,WAAA,GAAuB;AACrB,IAAA,OAAO,IAAA,CAAK,MAAA;AAAA,EACd;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAQA,UAAA,CAAW,YAAA,EAAsB,MAAA,EAAgB,KAAA,EAAsB;AACrE,IAAA,MAAM,GAAA,GAAM,kBAAA,CAAmB,YAAA,EAAc,MAAM,CAAA;AACnD,IAAA,MAAM,QAAA,GAAW,IAAA,CAAK,OAAA,CAAQ,GAAA,CAAI,GAAG,CAAA;AACrC,IAAA,MAAM,SAAA,GAAY,KAAA,CAAM,KAAA,EAAO,MAAA,IAAU,CAAA;AACzC,IAAA,IAAI,QAAA,IAAY,QAAA,CAAS,KAAA,KAAU,OAAA,EAAS;AAC1C,MAAA,IAAA,CAAK,GAAA,CAAI,aAAa,YAAY,CAAA,CAAA,EAAI,MAAM,CAAA,uCAAA,EAAqC,QAAA,CAAS,OAAA,CAAQ,IAAI,CAAA,iBAAA,CAAmB,CAAA;AAAA,IAC3H;AACA,IAAA,IAAA,CAAK,OAAA,CAAQ,IAAI,GAAA,EAAK;AAAA,MACpB,YAAA;AAAA,MACA,MAAA;AAAA,MACA,KAAA,EAAO,OAAA;AAAA,MACP,OAAA,sBAAa,GAAA,EAAI;AAAA,MACjB;AAAA,KACD,CAAA;AAAA,EACH;AAAA;AAAA;AAAA;AAAA;AAAA,EAMA,iBAAiB,QAAA,EAA+E;AAC9F,IAAA,IAAA,CAAK,aAAA,GAAgB,QAAA;AAAA,EACvB;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAOA,aAAA,CAAc,cAAsB,MAAA,EAAsB;AACxD,IAAA,MAAM,GAAA,GAAM,kBAAA,CAAmB,YAAA,EAAc,MAAM,CAAA;AACnD,IAAA,IAAI,IAAA,CAAK,eAAe,GAAA,EAAK;AAC3B,MAAA,IAAA,CAAK,UAAA,GAAa,GAAA;AAClB,MAAA,MAAMC,IAAAA,GAAM,IAAA,CAAK,OAAA,CAAQ,GAAA,CAAI,GAAG,CAAA;AAChC,MAAA,IAAA,CAAK,GAAA;AAAA,QACH,CAAA,8BAAA,EAA4B,YAAY,CAAA,CAAA,EAAI,MAAM,eAAYA,IAAAA,GAAM,CAAA,EAAGA,IAAAA,CAAI,KAAK,CAAA,EAAA,EAAKA,IAAAA,CAAI,OAAA,CAAQ,IAAI,cAAc,QAAQ,CAAA;AAAA,OAC7H;AAAA,IACF;AACA,IAAA,IAAI,KAAK,MAAA,EAAQ;AACjB,IAAA,MAAM,GAAA,GAAM,IAAA,CAAK,OAAA,CAAQ,GAAA,CAAI,GAAG,CAAA;AAChC,IAAA,IAAI,KAAK,KAAA,KAAU,OAAA,IAAW,KAAK,QAAA,CAAS,GAAA,CAAI,GAAG,CAAA,EAAG;AACtD,IAAA,MAAM,KAAA,GAAQ,IAAA,CAAK,aAAA,GAAgB,YAAA,EAAc,MAAM,CAAA;AACvD,IAAA,IAAI,CAAC,KAAA,EAAO;AAEZ,IAAA,KAAK,IAAA,CAAK,WAAA,CAAY,YAAA,EAAc,MAAA,EAAQ,KAAK,CAAA;AAAA,EACnD;AAAA;AAAA,EAGA,YAAA,CAAa,cAAsB,MAAA,EAAsB;AACvD,IAAA,MAAM,GAAA,GAAM,kBAAA,CAAmB,YAAA,EAAc,MAAM,CAAA;AACnD,IAAA,MAAM,GAAA,GAAM,IAAA,CAAK,OAAA,CAAQ,GAAA,CAAI,GAAG,CAAA;AAChC,IAAA,IAAI,CAAC,GAAA,EAAK;AACV,IAAA,IAAA,CAAK,OAAA,CAAQ,OAAO,GAAG,CAAA;AACvB,IAAA,IAAA,CAAK,GAAA,CAAI,aAAa,YAAY,CAAA,CAAA,EAAI,MAAM,CAAA,oCAAA,EAAuC,GAAA,CAAI,OAAA,CAAQ,IAAI,CAAA,eAAA,CAAiB,CAAA;AAAA,EACtH;AAAA;AAAA,EAGA,KAAA,GAAc;AACZ,IAAA,IAAA,CAAK,QAAQ,KAAA,EAAM;AACnB,IAAA,IAAA,CAAK,SAAS,KAAA,EAAM;AAAA,EACtB;AAAA;AAAA;AAAA;AAAA;AAAA,EAMA,MAAM,WAAA,CAAY,YAAA,EAAsB,MAAA,EAAgB,KAAA,EAAoC;AAC1F,IAAA,MAAM,GAAA,GAAM,kBAAA,CAAmB,YAAA,EAAc,MAAM,CAAA;AACnD,IAAA,IAAI,GAAA,GAAM,IAAA,CAAK,OAAA,CAAQ,GAAA,CAAI,GAAG,CAAA;AAC9B,IAAA,IAAI,CAAC,GAAA,EAAK;AACR,MAAA,GAAA,GAAM,EAAE,YAAA,EAAc,MAAA,EAAQ,KAAA,EAAO,OAAA,EAAS,OAAA,kBAAS,IAAI,GAAA,EAAI,EAAG,SAAA,EAAW,KAAA,CAAM,KAAA,EAAO,UAAU,CAAA,EAAE;AACtG,MAAA,IAAA,CAAK,OAAA,CAAQ,GAAA,CAAI,GAAA,EAAK,GAAG,CAAA;AAAA,IAC3B;AACA,IAAA,IAAI,GAAA,CAAI,KAAA,KAAU,OAAA,EAAS,OAAO,GAAA;AAClC,IAAA,IAAI,KAAK,MAAA,EAAQ;AACf,MAAA,GAAA,CAAI,KAAA,GAAQ,QAAA;AACZ,MAAA,GAAA,CAAI,KAAA,GAAQ,KAAK,MAAA,IAAU,8BAAA;AAC3B,MAAA,OAAO,GAAA;AAAA,IACT;AACA,IAAA,IAAI,IAAA,CAAK,QAAA,CAAS,GAAA,CAAI,GAAG,GAAG,OAAO,GAAA;AAEnC,IAAA,IAAA,CAAK,QAAA,CAAS,IAAI,GAAG,CAAA;AACrB,IAAA,GAAA,CAAI,KAAA,GAAQ,UAAA;AACZ,IAAA,MAAM,KAAA,GAAA,CAAS,KAAA,CAAM,KAAA,IAAS,EAAC,EAAG,MAAA,CAAO,CAAC,CAAA,KAAM,CAAC,CAAC,CAAA,EAAG,EAAE,CAAA;AACvD,IAAA,MAAM,OAAA,GAAU,KAAK,GAAA,EAAI;AACzB,IAAA,IAAA,CAAK,GAAA,CAAI,gCAAgC,YAAY,CAAA,CAAA,EAAI,MAAM,CAAA,EAAA,EAAK,KAAA,CAAM,MAAM,CAAA,aAAA,CAAU,CAAA;AAE1F,IAAA,IAAI;AACF,MAAA,MAAM,OAAA,uBAAc,GAAA,EAAsB;AAC1C,MAAA,KAAA,IAAS,IAAI,CAAA,EAAG,CAAA,GAAI,MAAM,MAAA,EAAQ,CAAA,IAAK,KAAK,SAAA,EAAW;AACrD,QAAA,MAAM,QAAQ,KAAA,CAAM,KAAA,CAAM,CAAA,EAAG,CAAA,GAAI,KAAK,SAAS,CAAA;AAC/C,QAAA,MAAM,GAAA,GAAM,MAAM,IAAA,CAAK,KAAA,CAAM,KAAA,CAAM,GAAA,CAAI,CAAC,CAAA,KAAM,QAAA,CAAS,CAAC,CAAC,CAAC,CAAA;AAC1D,QAAA,KAAA,CAAM,OAAA,CAAQ,CAAC,CAAA,EAAG,CAAA,KAAM;AACtB,UAAA,MAAM,CAAA,GAAI,IAAI,CAAC,CAAA;AACf,UAAA,IAAI,CAAA,EAAG,OAAA,CAAQ,GAAA,CAAI,CAAA,CAAE,IAAI,CAAC,CAAA;AAAA,QAC5B,CAAC,CAAA;AAGD,QAAA,MAAM,IAAA,GAAO,IAAA,CAAK,OAAA,CAAQ,GAAA,CAAI,GAAG,CAAA;AACjC,QAAA,IAAI,CAAC,IAAA,IAAQ,IAAA,KAAS,GAAA,EAAK;AACzB,UAAA,IAAA,CAAK,GAAA,CAAI,CAAA,0BAAA,EAA6B,YAAY,CAAA,CAAA,EAAI,MAAM,CAAA,4CAAA,CAAyC,CAAA;AACrG,UAAA,OAAO,GAAA;AAAA,QACT;AAAA,MACF;AACA,MAAA,GAAA,CAAI,OAAA,GAAU,OAAA;AACd,MAAA,GAAA,CAAI,YAAY,KAAA,CAAM,MAAA;AACtB,MAAA,GAAA,CAAI,KAAA,GAAQ,OAAA;AACZ,MAAA,GAAA,CAAI,OAAA,GAAU,KAAK,GAAA,EAAI;AACvB,MAAA,GAAA,CAAI,OAAA,GAAU,IAAI,OAAA,GAAU,OAAA;AAC5B,MAAA,GAAA,CAAI,KAAA,GAAQ,KAAA,CAAA;AACZ,MAAA,IAAA,CAAK,GAAA,CAAI,CAAA,0BAAA,EAA6B,YAAY,CAAA,CAAA,EAAI,MAAM,CAAA,QAAA,EAAM,OAAA,CAAQ,IAAI,CAAA,YAAA,EAAe,GAAA,CAAI,OAAO,CAAA,EAAA,CAAI,CAAA;AAAA,IAC9G,SAAS,GAAA,EAAK;AACZ,MAAA,GAAA,CAAI,KAAA,GAAQ,QAAA;AACZ,MAAA,GAAA,CAAI,QAAQ,GAAA,YAAe,KAAA,GAAQ,GAAA,CAAI,OAAA,GAAU,OAAO,GAAG,CAAA;AAC3D,MAAA,IAAA,CAAK,GAAA,CAAI,oCAAoC,YAAY,CAAA,CAAA,EAAI,MAAM,CAAA,QAAA,EAAM,GAAA,CAAI,KAAK,CAAA,8BAAA,CAAgC,CAAA;AAAA,IACpH,CAAA,SAAE;AACA,MAAA,IAAA,CAAK,QAAA,CAAS,OAAO,GAAG,CAAA;AAAA,IAC1B;AACA,IAAA,OAAO,GAAA;AAAA,EACT;AAAA;AAAA,EAGA,MAAM,WAAW,IAAA,EAAwC;AACvD,IAAA,IAAI,IAAA,CAAK,QAAQ,OAAO,IAAA;AACxB,IAAA,IAAI;AACF,MAAA,MAAM,CAAC,MAAM,CAAA,GAAI,MAAM,KAAK,KAAA,CAAM,CAAC,IAAI,CAAA,EAAG,IAAI,CAAA;AAC9C,MAAA,OAAO,MAAA,IAAU,IAAA;AAAA,IACnB,SAAS,GAAA,EAAK;AACZ,MAAA,IAAA,CAAK,GAAA,CAAI,2CAAsC,GAAA,YAAe,KAAA,GAAQ,IAAI,OAAA,GAAU,MAAA,CAAO,GAAG,CAAC,CAAA,eAAA,CAAiB,CAAA;AAChH,MAAA,OAAO,IAAA;AAAA,IACT;AAAA,EACF;AAAA;AAAA,EAGA,IAAA,GAAa;AACX,IAAA,MAAM,QAAQ,IAAA,CAAK,KAAA;AACnB,IAAA,IAAA,CAAK,KAAA,GAAQ,IAAA;AACb,IAAA,IAAA,CAAK,QAAA,GAAW,KAAA;AAChB,IAAA,KAAA,MAAW,GAAG,CAAC,CAAA,IAAK,KAAK,OAAA,EAAS;AAChC,MAAA,YAAA,CAAa,EAAE,KAAK,CAAA;AACpB,MAAA,CAAA,CAAE,MAAA,CAAO,IAAI,KAAA,CAAM,0BAA0B,CAAC,CAAA;AAAA,IAChD;AACA,IAAA,IAAA,CAAK,QAAQ,KAAA,EAAM;AACnB,IAAA,IAAI,KAAA,EAAO;AACT,MAAA,IAAI;AACF,QAAA,KAAA,CAAM,IAAA,EAAK;AAAA,MACb,CAAA,CAAA,MAAQ;AAAA,MAER;AAAA,IACF;AAAA,EACF;AAAA;AAAA,EAIQ,YAAA,GAA6B;AACnC,IAAA,IAAI,IAAA,CAAK,KAAA,EAAO,OAAO,IAAA,CAAK,KAAA;AAC5B,IAAA,IAAA,CAAK,QAAA,GAAW,IAAA;AAChB,IAAA,MAAM,KAAA,GAAQ,KAAK,WAAA,EAAY;AAC/B,IAAA,IAAA,CAAK,KAAA,GAAQ,KAAA;AACb,IAAA,IAAA,CAAK,QAAA,GAAW,KAAA;AAChB,IAAA,IAAA,CAAK,MAAA,GAAS,EAAA;AACd,IAAA,IAAA,CAAK,GAAA,CAAI,CAAA,wCAAA,EAA2C,KAAA,CAAM,GAAA,IAAO,GAAG,CAAA,CAAA,CAAG,CAAA;AAEvE,IAAA,KAAA,CAAM,MAAA,EAAQ,YAAY,MAAM,CAAA;AAChC,IAAA,KAAA,CAAM,MAAA,EAAQ,GAAG,MAAA,EAAQ,CAAC,UAAkB,IAAA,CAAK,MAAA,CAAO,KAAK,CAAC,CAAA;AAG9D,IAAA,KAAA,CAAM,MAAA,EAAQ,YAAY,MAAM,CAAA;AAChC,IAAA,KAAA,CAAM,MAAA,EAAQ,EAAA,CAAG,MAAA,EAAQ,CAAC,KAAA,KAAkB;AAC1C,MAAA,MAAM,IAAA,GAAO,MAAA,CAAO,KAAK,CAAA,CAAE,IAAA,EAAK;AAChC,MAAA,IAAI,IAAA,OAAW,GAAA,CAAI,CAAA,iBAAA,EAAoB,KAAK,KAAA,CAAM,CAAA,EAAG,GAAG,CAAC,CAAA,CAAE,CAAA;AAAA,IAC7D,CAAC,CAAA;AACD,IAAA,KAAA,CAAM,EAAA,CAAG,QAAQ,CAAC,IAAA,EAAM,WAAW,IAAA,CAAK,MAAA,CAAO,IAAA,EAAM,MAAM,CAAC,CAAA;AAC5D,IAAA,KAAA,CAAM,EAAA,CAAG,OAAA,EAAS,CAAC,GAAA,KAAe;AAChC,MAAA,IAAA,CAAK,GAAA,CAAI,CAAA,kDAAA,EAAgD,GAAA,CAAI,OAAO,CAAA,CAAE,CAAA;AACtE,MAAA,IAAA,CAAK,MAAA,CAAO,MAAM,IAAI,CAAA;AAAA,IACxB,CAAC,CAAA;AACD,IAAA,OAAO,KAAA;AAAA,EACT;AAAA,EAEQ,OAAO,KAAA,EAAqB;AAClC,IAAA,IAAA,CAAK,MAAA,IAAU,KAAA;AACf,IAAA,IAAI,EAAA;AACJ,IAAA,OAAA,CAAQ,KAAK,IAAA,CAAK,MAAA,CAAO,OAAA,CAAQ,IAAI,MAAM,CAAA,EAAG;AAC5C,MAAA,MAAM,OAAO,IAAA,CAAK,MAAA,CAAO,MAAM,CAAA,EAAG,EAAE,EAAE,IAAA,EAAK;AAC3C,MAAA,IAAA,CAAK,MAAA,GAAS,IAAA,CAAK,MAAA,CAAO,KAAA,CAAM,KAAK,CAAC,CAAA;AACtC,MAAA,IAAI,CAAC,IAAA,EAAM;AACX,MAAA,IAAI,GAAA;AACJ,MAAA,IAAI;AACF,QAAA,GAAA,GAAM,IAAA,CAAK,MAAM,IAAI,CAAA;AAAA,MACvB,CAAA,CAAA,MAAQ;AACN,QAAA;AAAA,MACF;AACA,MAAA,IAAI,OAAO,GAAA,CAAI,KAAA,KAAU,QAAA,EAAU,IAAA,CAAK,QAAQ,GAAA,CAAI,KAAA;AACpD,MAAA,MAAM,KAAK,GAAA,CAAI,EAAA;AACf,MAAA,IAAI,OAAO,OAAO,QAAA,EAAU;AAC5B,MAAA,MAAM,CAAA,GAAI,IAAA,CAAK,OAAA,CAAQ,GAAA,CAAI,EAAE,CAAA;AAC7B,MAAA,IAAI,CAAC,CAAA,EAAG;AACR,MAAA,IAAA,CAAK,OAAA,CAAQ,OAAO,EAAE,CAAA;AACtB,MAAA,YAAA,CAAa,EAAE,KAAK,CAAA;AACpB,MAAA,IAAI,GAAA,CAAI,EAAA,IAAM,KAAA,CAAM,OAAA,CAAQ,GAAA,CAAI,OAAO,CAAA,EAAG,CAAA,CAAE,OAAA,CAAQ,GAAA,CAAI,OAAO,CAAA;AAAA,aACxD,MAAA,CAAO,IAAI,MAAM,GAAA,CAAI,KAAA,IAAS,sCAAsC,CAAC,CAAA;AAAA,IAC9E;AAAA,EACF;AAAA,EAEQ,MAAA,CAAO,MAAqB,MAAA,EAAqC;AACvE,IAAA,MAAM,UAAA,GAAa,CAAC,CAAC,IAAA,CAAK,KAAA;AAC1B,IAAA,IAAA,CAAK,KAAA,GAAQ,IAAA;AACb,IAAA,IAAI,CAAC,UAAA,EAAY;AAEjB,IAAA,IAAA,CAAK,OAAA,EAAA;AACL,IAAA,MAAM,MAAM,MAAA,GAAS,CAAA,OAAA,EAAU,MAAM,CAAA,CAAA,GAAK,CAAA,KAAA,EAAQ,QAAQ,MAAM,CAAA,CAAA;AAGhE,IAAA,KAAA,MAAW,GAAG,CAAC,CAAA,IAAK,KAAK,OAAA,EAAS;AAChC,MAAA,YAAA,CAAa,EAAE,KAAK,CAAA;AACpB,MAAA,CAAA,CAAE,OAAO,IAAI,KAAA,CAAM,CAAA,yBAAA,EAA4B,GAAG,GAAG,CAAC,CAAA;AAAA,IACxD;AACA,IAAA,IAAA,CAAK,QAAQ,KAAA,EAAM;AAEnB,IAAA,IAAI,IAAA,CAAK,OAAA,IAAW,IAAA,CAAK,UAAA,EAAY;AACnC,MAAA,IAAA,CAAK,MAAA,GAAS,IAAA;AACd,MAAA,IAAA,CAAK,MAAA,GACH,CAAA,6BAAA,EAAgC,GAAG,CAAA,EAAA,EAAK,KAAK,OAAO,CAAA,4MAAA,CAAA;AAGtD,MAAA,IAAA,CAAK,GAAA,CAAI,CAAA,UAAA,EAAa,IAAA,CAAK,MAAM,CAAA,CAAE,CAAA;AACnC,MAAA;AAAA,IACF;AACA,IAAA,IAAA,CAAK,GAAA,CAAI,sCAAsC,GAAG,CAAA,iCAAA,EAA+B,KAAK,OAAO,CAAA,CAAA,EAAI,IAAA,CAAK,UAAU,CAAA,CAAA,CAAG,CAAA;AAAA,EACrH;AAAA,EAEQ,KAAA,CAAM,KAAA,EAAiB,KAAA,GAAQ,KAAA,EAA4B;AACjE,IAAA,IAAI,IAAA,CAAK,MAAA,EAAQ,OAAO,OAAA,CAAQ,MAAA,CAAO,IAAI,KAAA,CAAM,IAAA,CAAK,MAAA,IAAU,8BAA8B,CAAC,CAAA;AAC/F,IAAA,IAAI,CAAC,KAAA,CAAM,MAAA,SAAe,OAAA,CAAQ,OAAA,CAAQ,EAAE,CAAA;AAC5C,IAAA,IAAI,KAAA;AACJ,IAAA,IAAI;AACF,MAAA,KAAA,GAAQ,KAAK,YAAA,EAAa;AAAA,IAC5B,SAAS,GAAA,EAAK;AAIZ,MAAA,MAAM,KAAA,GAAQ,eAAe,KAAA,GAAQ,GAAA,GAAM,IAAI,KAAA,CAAM,MAAA,CAAO,GAAG,CAAC,CAAA;AAChE,MAAA,IAAA,CAAK,OAAA,EAAA;AACL,MAAA,IAAI,IAAA,CAAK,OAAA,IAAW,IAAA,CAAK,UAAA,EAAY;AACnC,QAAA,IAAA,CAAK,MAAA,GAAS,IAAA;AACd,QAAA,IAAA,CAAK,MAAA,GAAS,CAAA,sCAAA,EAAyC,KAAA,CAAM,OAAO,CAAA,+CAAA,CAAA;AACpE,QAAA,IAAA,CAAK,GAAA,CAAI,CAAA,UAAA,EAAa,IAAA,CAAK,MAAM,CAAA,CAAE,CAAA;AAAA,MACrC,CAAA,MAAO;AACL,QAAA,IAAA,CAAK,GAAA,CAAI,CAAA,kDAAA,EAAgD,KAAA,CAAM,OAAO,CAAA,EAAA,EAAK,KAAK,OAAO,CAAA,CAAA,EAAI,IAAA,CAAK,UAAU,CAAA,CAAA,CAAG,CAAA;AAAA,MAC/G;AACA,MAAA,OAAO,OAAA,CAAQ,OAAO,KAAK,CAAA;AAAA,IAC7B;AACA,IAAA,MAAM,KAAK,IAAA,CAAK,MAAA,EAAA;AAChB,IAAA,OAAO,IAAI,OAAA,CAAoB,CAACC,QAAAA,EAAS,MAAA,KAAW;AAClD,MAAA,MAAM,KAAA,GAAQ,WAAW,MAAM;AAC7B,QAAA,IAAA,CAAK,OAAA,CAAQ,OAAO,EAAE,CAAA;AACtB,QAAA,MAAA,CAAO,IAAI,KAAA,CAAM,CAAA,kCAAA,EAAqC,IAAA,CAAK,gBAAgB,IAAI,CAAC,CAAA;AAAA,MAClF,CAAA,EAAG,KAAK,gBAAgB,CAAA;AAExB,MAAC,MAA4C,KAAA,IAAQ;AACrD,MAAA,IAAA,CAAK,OAAA,CAAQ,IAAI,EAAA,EAAI,EAAE,SAAAA,QAAAA,EAAS,MAAA,EAAQ,OAAO,CAAA;AAC/C,MAAA,IAAI;AACF,QAAA,KAAA,CAAM,KAAA,EAAO,KAAA,CAAM,IAAA,CAAK,SAAA,CAAU,EAAE,EAAA,EAAI,EAAA,EAAI,OAAA,EAAS,KAAA,EAAO,KAAA,EAAO,CAAA,GAAI,IAAI,CAAA;AAAA,MAC7E,SAAS,GAAA,EAAK;AACZ,QAAA,IAAA,CAAK,OAAA,CAAQ,OAAO,EAAE,CAAA;AACtB,QAAA,YAAA,CAAa,KAAK,CAAA;AAClB,QAAA,MAAA,CAAO,GAAA,YAAe,QAAQ,GAAA,GAAM,IAAI,MAAM,MAAA,CAAO,GAAG,CAAC,CAAC,CAAA;AAAA,MAC5D;AAAA,IACF,CAAC,CAAA;AAAA,EACH;AAAA;AAAA,EAGA,WAAA,GAAoB;AAClB,IAAA,IAAA,CAAK,OAAA,GAAU,CAAA;AAAA,EACjB;AACF,CAAA;AASA,SAAS,kBAAA,GAAmC;AAC1C,EAAA,MAAM,IAAA,GAAYC,IAAA,CAAA,OAAA,CAAQ,aAAA,CAAc,MAAA,CAAA,IAAA,CAAY,GAAG,CAAC,CAAA;AACxD,EAAA,MAAM,KAAA,GAAaA,IAAA,CAAA,IAAA,CAAK,IAAA,EAAM,sBAAsB,CAAA;AACpD,EAAA,IAAI,CAAIC,GAAA,CAAA,UAAA,CAAW,KAAK,CAAA,EAAG;AACzB,IAAA,MAAM,IAAI,KAAA,CAAM,CAAA,8BAAA,EAAiC,KAAK,CAAA,+BAAA,CAA4B,CAAA;AAAA,EACpF;AACA,EAAA,OAAO,KAAA,CAAM,OAAA,CAAQ,QAAA,EAAU,CAAC,KAAK,CAAA,EAAG;AAAA,IACtC,KAAA,EAAO,CAAC,MAAA,EAAQ,MAAA,EAAQ,MAAM,CAAA;AAAA;AAAA;AAAA,IAG9B,KAAK,EAAE,GAAG,OAAA,CAAQ,GAAA,EAAK,cAAc,EAAA;AAAG,GACzC,CAAA;AACH;;;ACnaA,eAAsB,cAAA,CAAe,OAAA,GAA4B,EAAC,EAAuB;AACvF,EAAA,MAAM,UAAA,GAAa,OAAA,CAAQ,UAAA,IAAc,aAAA,EAAc;AACvD,EAAA,MAAM,OAAA,GAAU,OAAA,CAAQ,OAAA,IAAW,UAAA,EAAW;AAC9C,EAAA,MAAM,QAAA,GAAW,OAAA,CAAQ,QAAA,IAAY,IAAI,iBAAA,EAAkB;AAC3D,EAAA,MAAM,UAAA,GAAa,OAAA,CAAQ,UAAA,IAAc,gBAAA,EAAiB;AAC1D,EAAA,MAAM,GAAA,GAAM,OAAA,CAAQ,GAAA,KAAQ,MAAY;AAAA,EAAC,CAAA,CAAA;AAGzC,EAAA,MAAM,cAAc,OAAA,CAAQ,WAAA,IAAe,IAAI,WAAA,CAAY,EAAE,KAAK,CAAA;AAClE,EAAA,WAAA,CAAY,gBAAA,CAAiB,CAAC,YAAA,EAAc,MAAA,KAAW,QAAA,CAAS,OAAO,GAAA,CAAI,YAAA,EAAc,MAAM,CAAA,EAAG,KAAK,CAAA;AACvG,EAAA,QAAA,CAAS,gBAAgB,WAAW,CAAA;AACpC,EAAA,MAAM,oBAAoB,OAAA,CAAQ,iBAAA;AAClC,EAAA,MAAM,GAAA,GAAM,OAAA,CAAQ,GAAA,KAAQ,0BAAU,IAAA,EAAK,CAAA;AAC3C,EAAA,MAAM,GAAA,GAAM,OAAA,CAAQ,GAAA,IAAO,OAAA,CAAQ,GAAA;AACnC,EAAA,MAAM,SAAA,GAAY,KAAK,GAAA,EAAI;AAG3B,EAAA,IAAI,CAAC,UAAA,CAAW,UAAA,CAAW,aAAa,CAAA,EAAG;AACzC,IAAG,cAAeC,IAAA,CAAA,OAAA,CAAQ,UAAU,GAAG,EAAE,SAAA,EAAW,MAAM,CAAA;AAC1D,IAAA,IAAI;AACF,MAAG,eAAW,UAAU,CAAA;AAAA,IAC1B,CAAA,CAAA,MAAQ;AAAA,IAER;AAAA,EACF,CAAA,MAAO;AACL,IAAG,cAAeA,IAAA,CAAA,OAAA,CAAQ,OAAO,GAAG,EAAE,SAAA,EAAW,MAAM,CAAA;AAAA,EACzD;AAEA,EAAA,MAAM,MAAA,GAAa,GAAA,CAAA,YAAA,CAAa,CAAC,MAAA,KAAW;AAC1C,IAAA,IAAI,MAAA,GAAS,EAAA;AACb,IAAA,MAAA,CAAO,YAAY,MAAM,CAAA;AACzB,IAAA,MAAA,CAAO,EAAA,CAAG,MAAA,EAAQ,CAAC,KAAA,KAAkB;AACnC,MAAA,MAAA,IAAU,KAAA;AACV,MAAA,IAAI,EAAA;AACJ,MAAA,OAAA,CAAQ,EAAA,GAAK,MAAA,CAAO,OAAA,CAAQ,IAAI,MAAM,CAAA,EAAG;AACvC,QAAA,MAAM,OAAO,MAAA,CAAO,KAAA,CAAM,CAAA,EAAG,EAAE,EAAE,IAAA,EAAK;AACtC,QAAA,MAAA,GAAS,MAAA,CAAO,KAAA,CAAM,EAAA,GAAK,CAAC,CAAA;AAC5B,QAAA,IAAI,CAAC,IAAA,EAAM;AACX,QAAA,KAAK,OAAA,CAAQ,OAAA;AAAA,UACX,UAAA,CAAW,IAAA,EAAM,EAAE,QAAA,EAAU,UAAA,EAAY,WAAA,EAAa,GAAA,EAAK,GAAA,EAAK,SAAA,EAAW,UAAA,EAAY,iBAAA,EAAmB,GAAA,EAAK;AAAA,SACjH,CAAE,IAAA;AAAA,UACA,CAAC,QAAA,KAAa;AACZ,YAAA,MAAA,CAAO,KAAA,CAAM,IAAA,CAAK,SAAA,CAAU,QAAQ,IAAI,IAAI,CAAA;AAAA,UAC9C;AAAA,SACF;AAAA,MACF;AAAA,IACF,CAAC,CAAA;AAAA,EACH,CAAC,CAAA;AAED,EAAA,MAAM,IAAI,OAAA,CAAc,CAACH,QAAAA,EAAS,MAAA,KAAW;AAC3C,IAAA,MAAA,CAAO,IAAA,CAAK,SAAS,MAAM,CAAA;AAC3B,IAAA,MAAA,CAAO,MAAA,CAAO,YAAY,MAAM;AAC9B,MAAA,MAAA,CAAO,GAAA,CAAI,SAAS,MAAM,CAAA;AAC1B,MAAAA,QAAAA,EAAQ;AAAA,IACV,CAAC,CAAA;AAAA,EACH,CAAC,CAAA;AAED,EAAA,IAAI;AACF,IAAG,cAAeG,IAAA,CAAA,OAAA,CAAQ,OAAO,GAAG,EAAE,SAAA,EAAW,MAAM,CAAA;AACvD,IAAG,GAAA,CAAA,aAAA,CAAc,OAAA,EAAS,CAAA,EAAG,GAAG;AAAA,CAAA,EAAM,MAAM,CAAA;AAAA,EAC9C,CAAA,CAAA,MAAQ;AAAA,EAER;AAEA,EAAA,OAAO;AAAA,IACL,UAAA;AAAA,IACA,QAAA;AAAA,IACA,SAAA;AAAA,IACA,MAAM,KAAA,GAAQ;AAEZ,MAAA,WAAA,CAAY,IAAA,EAAK;AACjB,MAAA,MAAM,IAAI,QAAc,CAACH,QAAAA,KAAY,OAAO,KAAA,CAAM,MAAMA,QAAAA,EAAS,CAAC,CAAA;AAClE,MAAA,IAAI;AACF,QAAG,eAAW,OAAO,CAAA;AAAA,MACvB,CAAA,CAAA,MAAQ;AAAA,MAER;AACA,MAAA,IAAI,CAAC,UAAA,CAAW,UAAA,CAAW,aAAa,CAAA,EAAG;AACzC,QAAA,IAAI;AACF,UAAG,eAAW,UAAU,CAAA;AAAA,QAC1B,CAAA,CAAA,MAAQ;AAAA,QAER;AAAA,MACF;AAAA,IACF;AAAA,GACF;AACF;AAEA,eAAe,UAAA,CACb,MACA,GAAA,EAWsB;AACtB,EAAA,MAAM,GAAA,GAAM,aAAa,IAAI,CAAA;AAC7B,EAAA,IAAI,OAAA,IAAW,GAAA,EAAK,OAAO,EAAE,EAAA,EAAI,OAAO,KAAA,EAAO,GAAA,CAAI,KAAA,EAAO,IAAA,EAAM,aAAA,EAAc;AAE9E,EAAA,QAAQ,IAAI,EAAA;AAAI,IACd,KAAK,MAAA;AACH,MAAA,OAAO,EAAE,EAAA,EAAI,IAAA,EAAM,IAAA,EAAM,IAAA,EAAM,SAAS,oBAAA,EAAqB;AAAA,IAC/D,KAAK,QAAA;AACH,MAAA,OAAO;AAAA,QACL,EAAA,EAAI,IAAA;AAAA,QACJ,KAAK,GAAA,CAAI,GAAA;AAAA,QACT,QAAA,EAAU,IAAA,CAAK,GAAA,EAAI,GAAI,GAAA,CAAI,SAAA;AAAA,QAC3B,UAAA,EAAY,GAAA,CAAI,QAAA,CAAS,IAAA,EAAK;AAAA,QAC9B,UAAA,EAAY,GAAA,CAAI,QAAA,CAAS,MAAA,CAAO,IAAA,EAAK;AAAA,QACrC,OAAA,EAAS,oBAAA;AAAA,QACT,YAAY,GAAA,CAAI;AAAA,OAClB;AAAA,IACF,KAAK,UAAA,EAAY;AACf,MAAA,IAAI,CAAC,IAAI,iBAAA,EAAmB;AAC1B,QAAA,OAAO;AAAA,UACL,EAAA,EAAI,KAAA;AAAA,UACJ,KAAA,EACE,8HAAA;AAAA,UACF,IAAA,EAAM;AAAA,SACR;AAAA,MACF;AAEA,MAAA,MAAM,OAAO,GAAA,CAAI,iBAAA;AACjB,MAAA,UAAA,CAAW,MAAM,IAAA,EAAK,EAAG,GAAG,CAAA;AAC5B,MAAA,OAAO,EAAE,EAAA,EAAI,IAAA,EAAM,QAAA,EAAU,IAAA,EAAK;AAAA,IACpC;AAAA,IACA,KAAK,cAAA;AACH,MAAA,OAAO,EAAE,EAAA,EAAI,IAAA,EAAM,UAAU,GAAA,CAAI,WAAA,CAAY,QAAO,EAAE;AAAA,IACxD,KAAK,aAAA,EAAe;AAClB,MAAA,MAAM,SAAS,MAAM,GAAA,CAAI,WAAA,CAAY,UAAA,CAAW,IAAI,IAAI,CAAA;AACxD,MAAA,IAAI,CAAC,MAAA,EAAQ;AACX,QAAA,OAAO;AAAA,UACL,EAAA,EAAI,KAAA;AAAA,UACJ,KAAA,EAAO,4CAAA;AAAA,UACP,IAAA,EAAM;AAAA,SACR;AAAA,MACF;AACA,MAAA,OAAO,EAAE,IAAI,IAAA,EAAM,MAAA,EAAQ,OAAO,GAAA,CAAI,WAAA,CAAY,MAAA,EAAO,CAAE,KAAA,EAAM;AAAA,IACnE;AAAA,IACA,KAAK,aAAA,EAAe;AAClB,MAAA,MAAM,MAAA,GAAS,IAAI,MAAA,IAAU,GAAA,CAAI,SAAS,MAAA,CAAO,WAAA,CAAY,IAAI,YAAY,CAAA;AAC7E,MAAA,IAAI,CAAC,QAAQ,OAAO,EAAE,IAAI,KAAA,EAAO,KAAA,EAAO,uCAAA,EAAyC,IAAA,EAAM,SAAA,EAAU;AACjG,MAAA,MAAM,OAAO,GAAA,CAAI,QAAA,CAAS,OAAO,GAAA,CAAI,GAAA,CAAI,cAAc,MAAM,CAAA;AAC7D,MAAA,IAAI,CAAC,IAAA,EAAM;AACT,QAAA,OAAO,EAAE,EAAA,EAAI,KAAA,EAAO,KAAA,EAAO,CAAA,kBAAA,EAAqB,GAAA,CAAI,YAAY,CAAA,CAAA,EAAI,MAAM,CAAA,6BAAA,CAAA,EAA4B,IAAA,EAAM,SAAA,EAAU;AAAA,MACxH;AACA,MAAA,MAAM,GAAA,GAAM,MAAM,GAAA,CAAI,WAAA,CAAY,YAAY,GAAA,CAAI,YAAA,EAAc,MAAA,EAAQ,IAAA,CAAK,KAAK,CAAA;AAClF,MAAA,OAAO;AAAA,QACL,EAAA,EAAI,IAAA;AAAA,QACJ,OAAA,EAAS,IAAA;AAAA,QACT,cAAc,GAAA,CAAI,YAAA;AAAA,QAClB,MAAA;AAAA,QACA,OAAO,GAAA,CAAI,KAAA;AAAA,QACX,OAAA,EAAS,IAAI,OAAA,CAAQ,IAAA;AAAA,QACrB,SAAS,GAAA,CAAI;AAAA,OACf;AAAA,IACF;AAAA,IACA,KAAK,aAAA;AACH,MAAA,OAAO,EAAE,EAAA,EAAI,IAAA,EAAM,MAAM,GAAA,CAAI,UAAA,CAAW,QAAO,EAAE;AAAA,IACnD,KAAK,WAAA,EAAa;AAChB,MAAA,MAAM,IAAI,MAAM,GAAA,CAAI,UAAA,CAAW,IAAA,CAAK,IAAI,SAAS,CAAA;AACjD,MAAA,IAAI,CAAC,CAAA,CAAE,EAAA,EAAI,OAAO,EAAE,EAAA,EAAI,KAAA,EAAO,KAAA,EAAO,CAAA,CAAE,KAAA,EAAO,IAAA,EAAM,YAAA,EAAa;AAClE,MAAA,OAAO,EAAE,EAAA,EAAI,IAAA,EAAM,YAAY,IAAA,EAAM,SAAA,EAAW,EAAE,SAAA,EAAU;AAAA,IAC9D;AAAA,IACA,KAAK,aAAA,EAAe;AAClB,MAAA,MAAM,IAAI,MAAM,GAAA,CAAI,UAAA,CAAW,MAAA,CAAO,IAAI,SAAS,CAAA;AACnD,MAAA,OAAO,EAAE,EAAA,EAAI,IAAA,EAAM,cAAc,IAAA,EAAM,OAAA,EAAS,EAAE,OAAA,EAAQ;AAAA,IAC5D;AAAA,IACA,KAAK,eAAA,EAAiB;AACpB,MAAA,MAAM,CAAA,GAAI,MAAM,GAAA,CAAI,UAAA,CAAW,QAAA;AAAA,QAC7B,GAAA,CAAI,SAAA;AAAA,QACJ,GAAA,CAAI,QAAA,CAAS,GAAA,CAAI,CAAC,CAAA,MAAO;AAAA,UACvB,IAAA,EAAO,EAAE,IAAA,KAAS,QAAA,IAAY,EAAE,IAAA,KAAS,WAAA,GAAc,EAAE,IAAA,GAAO,MAAA;AAAA,UAChE,SAAS,CAAA,CAAE;AAAA,SACb,CAAE,CAAA;AAAA,QACF;AAAA,UACE,SAAS,GAAA,CAAI,OAAA;AAAA,UACb,gBAAgB,GAAA,CAAI,cAAA;AAAA,UACpB,WAAW,GAAA,CAAI,SAAA;AAAA,UACf,aAAa,GAAA,CAAI;AAAA;AACnB,OACF;AACA,MAAA,IAAI,CAAC,CAAA,CAAE,EAAA,EAAI,OAAO,EAAE,EAAA,EAAI,KAAA,EAAO,KAAA,EAAO,CAAA,CAAE,KAAA,EAAO,IAAA,EAAM,YAAA,EAAa;AAClE,MAAA,OAAO;AAAA,QACL,EAAA,EAAI,IAAA;AAAA,QACJ,aAAA,EAAe,IAAA;AAAA,QACf,IAAA,EAAM,EAAE,MAAA,CAAO,IAAA;AAAA,QACf,KAAA,EAAO,EAAE,MAAA,CAAO,KAAA;AAAA,QAChB,WAAA,EAAa,EAAE,MAAA,CAAO,WAAA;AAAA,QACtB,cAAA,EAAgB,EAAE,MAAA,CAAO,cAAA;AAAA,QACzB,kBAAA,EAAoB,EAAE,MAAA,CAAO,kBAAA;AAAA,QAC7B,SAAA,EAAW,EAAE,MAAA,CAAO,SAAA;AAAA,QACpB,kBAAA,EAAoB,EAAE,MAAA,CAAO;AAAA,OAC/B;AAAA,IACF;AAAA,IACA,KAAK,MAAA;AACH,MAAA,OAAO,EAAE,EAAA,EAAI,IAAA,EAAM,YAAY,GAAA,CAAI,QAAA,CAAS,MAAK,EAAE;AAAA,IACrD,KAAK,UAAA,EAAY;AACf,MAAA,MAAM,KAAA,GAAQ,GAAA,CAAI,QAAA,CAAS,IAAA,EAAK;AAChC,MAAA,MAAM,SAAA,GAAY,GAAA,CAAI,QAAA,CAAS,QAAA,CAAS,IAAI,IAAA,EAAM,GAAA,CAAI,GAAA,EAAK,EAAE,OAAO,GAAA,CAAI,KAAA,EAAO,IAAA,EAAM,GAAA,CAAI,MAAM,CAAA;AAG/F,MAAA,IAAI,GAAA,CAAI,QAAA,CAAS,IAAA,EAAK,GAAI,KAAA,EAAO;AAC/B,QAAA,GAAA,CAAI,GAAA,CAAI,CAAA,wBAAA,EAA2B,SAAA,CAAU,EAAE,KAAK,SAAA,CAAU,IAAI,CAAA,EAAG,SAAA,CAAU,SAAS,CAAA,EAAA,EAAK,SAAA,CAAU,MAAM,CAAA,CAAA,GAAK,EAAE,CAAA,CAAA,CAAG,CAAA;AAAA,MACzH;AACA,MAAA,OAAO,EAAE,EAAA,EAAI,IAAA,EAAM,SAAA,EAAU;AAAA,IAC/B;AAAA,IACA,KAAK,YAAA;AACH,MAAA,OAAO,EAAE,IAAI,IAAA,EAAM,OAAA,EAAS,IAAI,QAAA,CAAS,UAAA,CAAW,GAAA,CAAI,IAAI,CAAA,EAAE;AAAA,IAChE,KAAK,qBAAA,EAAuB;AAC1B,MAAA,MAAM,aAAa,GAAA,CAAI,QAAA,CAAS,mBAAmB,GAAA,CAAI,OAAA,EAAS,IAAI,GAAG,CAAA;AACvE,MAAA,OAAO,EAAE,EAAA,EAAI,IAAA,EAAM,UAAA,EAAY,YAAY,IAAA,EAAK;AAAA,IAClD;AAAA,IACA,KAAK,kBAAA,EAAoB;AACvB,MAAA,GAAA,CAAI,QAAA,CAAS,OAAO,SAAA,EAAU;AAC9B,MAAA,OAAO,EAAE,EAAA,EAAI,IAAA,EAAM,KAAA,EAAO,GAAA,CAAI,SAAS,MAAA,CAAO,IAAA,CAAK,GAAA,CAAI,YAAY,CAAA,EAAE;AAAA,IACvE;AAAA,IACA,KAAK,gBAAA,EAAkB;AACrB,MAAA,MAAM,SAAS,GAAA,CAAI,QAAA,CAAS,MAAA,CAAO,WAAA,CAAY,IAAI,YAAY,CAAA;AAC/D,MAAA,IAAI,MAAA,KAAW,IAAI,MAAA,EAAQ;AACzB,QAAA,GAAA,CAAI,GAAA,CAAI,CAAA,gBAAA,EAAmB,GAAA,CAAI,YAAY,CAAA,CAAA,EAAI,UAAU,QAAQ,CAAA,QAAA,EAAM,GAAA,CAAI,MAAM,CAAA,CAAE,CAAA;AAAA,MACrF;AACA,MAAA,GAAA,CAAI,QAAA,CAAS,YAAA,CAAa,GAAA,CAAI,YAAA,EAAc,IAAI,MAAM,CAAA;AACtD,MAAA,OAAO,EAAE,EAAA,EAAI,IAAA,EAAM,QAAA,EAAU,IAAA,EAAM,cAAc,GAAA,CAAI,YAAA,EAAc,MAAA,EAAQ,GAAA,CAAI,MAAA,EAAO;AAAA,IACxF;AAAA,IACA,KAAK,WAAA,EAAa;AAChB,MAAA,IAAI;AAIF,QAAA,MAAM,QAAQ,GAAA,CAAI,KAAA;AAClB,QAAA,GAAA,CAAI,GAAA,CAAI,CAAA,WAAA,EAAc,GAAA,CAAI,YAAY,CAAA,CAAA,EAAI,GAAA,CAAI,MAAM,CAAA,MAAA,EAAM,KAAA,CAAM,KAAA,EAAO,MAAA,IAAU,CAAC,CAAA,MAAA,CAAQ,CAAA;AAC1F,QAAA,GAAA,CAAI,SAAS,QAAA,CAAS,GAAA,CAAI,YAAA,EAAc,GAAA,CAAI,QAAQ,KAAK,CAAA;AACzD,QAAA,OAAO;AAAA,UACL,EAAA,EAAI,IAAA;AAAA,UACJ,MAAA,EAAQ,IAAA;AAAA,UACR,cAAc,GAAA,CAAI,YAAA;AAAA,UAClB,QAAQ,GAAA,CAAI,MAAA;AAAA,UACZ,SAAA,EAAW,KAAA,CAAM,KAAA,EAAO,MAAA,IAAU;AAAA,SACpC;AAAA,MACF,SAAS,CAAA,EAAG;AACV,QAAA,OAAO,EAAE,EAAA,EAAI,KAAA,EAAO,KAAA,EAAO,CAAA,YAAa,QAAQ,CAAA,CAAE,OAAA,GAAU,eAAA,EAAiB,IAAA,EAAM,WAAA,EAAY;AAAA,MACjG;AAAA,IACF;AAAA,IACA,KAAK,YAAA,EAAc;AAKjB,MAAA,MAAM,MAAA,GAAS,GAAA,CAAI,QAAA,CAAS,QAAA,CAAS,GAAA,CAAI,IAAA,EAAM,GAAA,CAAI,GAAA,EAAK,EAAE,MAAA,EAAQ,GAAA,CAAI,MAAA,EAAQ,CAAA;AAC9E,MAAA,MAAM,MAAA,GAAS,GAAA,CAAI,MAAA,IAAU,MAAA,CAAO,MAAA,IAAU,MAAA;AAC9C,MAAA,GAAA,CAAI,GAAA,CAAI,eAAe,MAAA,CAAO,EAAE,IAAI,MAAM,CAAA,MAAA,EAAS,GAAA,CAAI,IAAI,CAAA,CAAE,CAAA;AAC7D,MAAA,MAAM,KAAA,GAAQ,SAAA,CAAU,GAAA,CAAI,IAAA,EAAM,IAAI,SAAS,CAAA;AAC/C,MAAA,IAAI,CAAC,KAAA,EAAO;AACV,QAAA,OAAO;AAAA,UACL,EAAA,EAAI,KAAA;AAAA,UACJ,KAAA,EAAO,CAAA,sBAAA,EAAyB,GAAA,CAAI,IAAI,CAAA,+CAAA,CAAA;AAAA,UACxC,IAAA,EAAM;AAAA,SACR;AAAA,MACF;AACA,MAAA,GAAA,CAAI,QAAA,CAAS,QAAA,CAAS,MAAA,CAAO,EAAA,EAAI,QAAQ,KAAK,CAAA;AAC9C,MAAA,OAAO;AAAA,QACL,EAAA,EAAI,IAAA;AAAA,QACJ,MAAA,EAAQ,IAAA;AAAA,QACR,cAAc,MAAA,CAAO,EAAA;AAAA,QACrB,MAAA;AAAA,QACA,SAAA,EAAW,KAAA,CAAM,KAAA,EAAO,MAAA,IAAU;AAAA,OACpC;AAAA,IACF;AAAA,IACA,KAAK,aAAA,EAAe;AAClB,MAAA,MAAM,WAAW,GAAA,CAAI,QAAA,CAAS,aAAa,GAAA,CAAI,YAAA,EAAc,IAAI,MAAM,CAAA;AACvE,MAAA,IAAI,CAAC,QAAA,EAAU;AACb,QAAA,OAAO,EAAE,EAAA,EAAI,KAAA,EAAO,KAAA,EAAO,6DAAA,EAA0D,MAAM,UAAA,EAAW;AAAA,MACxG;AACA,MAAA,MAAM,MAAA,GAAS,UAAA,CAAW,QAAA,CAAS,KAAA,EAAO,GAAA,CAAI,KAAA,EAAO,EAAE,KAAA,EAAO,GAAA,CAAI,KAAA,IAAS,EAAA,EAAI,MAAA,EAAQ,KAAM,CAAA;AAC7F,MAAA,OAAO;AAAA,QACL,EAAA,EAAI,IAAA;AAAA,QACJ,OAAO,GAAA,CAAI,KAAA;AAAA,QACX,cAAc,GAAA,CAAI,YAAA;AAAA,QAClB,QAAQ,QAAA,CAAS,MAAA;AAAA,QACjB,OAAA,EAAS,MAAA,CAAO,OAAA,CAAQ,KAAA,CAAM,CAAA,EAAG,GAAA,CAAI,KAAA,IAAS,EAAE,CAAA,CAAE,GAAA,CAAI,CAAC,CAAA,MAAO;AAAA,UAC5D,EAAA,EAAI,EAAE,IAAA,CAAK,EAAA;AAAA,UACX,aAAA,EAAe,EAAE,IAAA,CAAK,aAAA;AAAA,UACtB,IAAA,EAAM,EAAE,IAAA,CAAK,IAAA;AAAA,UACb,IAAA,EAAM,EAAE,IAAA,CAAK,IAAA;AAAA,UACb,IAAA,EAAM,CAAA,CAAE,IAAA,CAAK,IAAA,EAAM,KAAA,IAAS,CAAA;AAAA,UAC5B,OAAO,CAAA,CAAE,KAAA;AAAA,UACT,KAAK,CAAA,CAAE;AAAA,SACT,CAAE,CAAA;AAAA,QACF,gBAAgB,MAAA,CAAO;AAAA,OACzB;AAAA,IACF;AAAA,IACA,KAAK,WAAA,EAAa;AAChB,MAAA,MAAM,WAAW,GAAA,CAAI,QAAA,CAAS,aAAa,GAAA,CAAI,YAAA,EAAc,IAAI,MAAM,CAAA;AACvE,MAAA,IAAI,CAAC,QAAA,EAAU;AACb,QAAA,OAAO,EAAE,EAAA,EAAI,KAAA,EAAO,KAAA,EAAO,6DAAA,EAA0D,MAAM,UAAA,EAAW;AAAA,MACxG;AACA,MAAA,MAAM,IAAA,GAAO,aAAA,CAAc,QAAA,CAAS,KAAA,EAAO,IAAI,MAAM,CAAA;AACrD,MAAA,IAAI,CAAC,IAAA,EAAM;AACT,QAAA,OAAO,EAAE,IAAI,KAAA,EAAO,KAAA,EAAO,qBAAqB,GAAA,CAAI,MAAM,CAAA,CAAA,EAAI,IAAA,EAAM,WAAA,EAAY;AAAA,MAClF;AACA,MAAA,MAAM,MAAA,GAAS,QAAA,CAAS,QAAA,CAAS,KAAA,EAAO,IAAA,CAAK,EAAA,EAAI,EAAE,KAAA,EAAO,GAAA,CAAI,KAAA,IAAS,CAAA,EAAG,CAAA;AAC1E,MAAA,OAAO;AAAA,QACL,EAAA,EAAI,IAAA;AAAA,QACJ,cAAc,GAAA,CAAI,YAAA;AAAA,QAClB,QAAQ,QAAA,CAAS,MAAA;AAAA,QACjB,QAAQ,GAAA,CAAI,MAAA;AAAA,QACZ,MAAM,MAAA,CAAO,IAAA;AAAA,QACb,OAAO,MAAA,CAAO,KAAA;AAAA,QACd,QAAA,EAAU,OAAO,QAAA,CAAS,KAAA,CAAM,GAAG,EAAE,CAAA,CAAE,GAAA,CAAI,CAAC,CAAA,MAAO;AAAA,UACjD,IAAI,CAAA,CAAE,EAAA;AAAA,UACN,MAAM,CAAA,CAAE,IAAA;AAAA,UACR,MAAM,CAAA,CAAE,IAAA;AAAA,UACR,MAAM,CAAA,CAAE,IAAA;AAAA,UACR,MAAM,CAAA,CAAE,IAAA;AAAA,UACR,OAAO,CAAA,CAAE,KAAA;AAAA,UACT,YAAY,CAAA,CAAE;AAAA,SAChB,CAAE,CAAA;AAAA,QACF,QAAQ,MAAA,CAAO,MAAA;AAAA,QACf,YAAY,MAAA,CAAO;AAAA,OACrB;AAAA,IACF;AAAA,IACA,KAAK,eAAA,EAAiB;AACpB,MAAA,MAAM,WAAW,GAAA,CAAI,QAAA,CAAS,aAAa,GAAA,CAAI,YAAA,EAAc,IAAI,MAAM,CAAA;AACvE,MAAA,IAAI,CAAC,QAAA,EAAU;AACb,QAAA,OAAO,EAAE,EAAA,EAAI,KAAA,EAAO,KAAA,EAAO,6DAAA,EAA0D,MAAM,UAAA,EAAW;AAAA,MACxG;AACA,MAAA,MAAM,IAAI,QAAA,CAAS,KAAA;AACnB,MAAA,OAAO;AAAA,QACL,EAAA,EAAI,IAAA;AAAA,QACJ,cAAc,GAAA,CAAI,YAAA;AAAA,QAClB,QAAQ,QAAA,CAAS,MAAA;AAAA,QACjB,OAAA,EAAS;AAAA,UACP,SAAA,EAAW,CAAA,CAAE,KAAA,EAAO,MAAA,IAAU,CAAA;AAAA,UAC9B,SAAA,EAAW,CAAA,CAAE,KAAA,EAAO,MAAA,IAAU,CAAA;AAAA,UAC9B,SAAA,EAAW,CAAA,CAAE,IAAA,EAAM,SAAA,IAAa,EAAC;AAAA,UACjC,UAAA,EAAY,CAAA,CAAE,UAAA,EAAY,UAAA,IAAc,IAAA;AAAA,UACxC,IAAA,EAAM,CAAA,CAAE,IAAA,EAAM,IAAA,IAAQ;AAAA;AACxB,OACF;AAAA,IACF;AAAA;AAEJ;AAEA,SAAS,aAAA,CAAc,OAAgB,MAAA,EAAuC;AAE5E,EAAA,IAAI,KAAA,CAAM,KAAA,CAAM,IAAA,CAAK,CAAC,CAAA,KAAM,CAAA,CAAE,EAAA,KAAO,MAAM,CAAA,EAAG,OAAO,EAAE,EAAA,EAAI,MAAA,EAAO;AAClE,EAAA,MAAM,GAAA,GAAM,UAAA,CAAW,KAAA,EAAO,MAAM,CAAA;AACpC,EAAA,IAAI,GAAA,CAAI,MAAM,EAAA,EAAI,OAAO,EAAE,EAAA,EAAI,GAAA,CAAI,KAAK,EAAA,EAAG;AAC3C,EAAA,IAAI,IAAI,UAAA,CAAW,MAAA,KAAW,CAAA,IAAK,GAAA,CAAI,WAAW,CAAC,CAAA,EAAG,EAAA,EAAI,OAAO,EAAE,EAAA,EAAI,GAAA,CAAI,UAAA,CAAW,CAAC,EAAE,EAAA,EAAG;AAC5F,EAAA,MAAM,CAAA,GAAI,OAAO,WAAA,EAAY;AAC7B,EAAA,MAAM,IAAA,GAAO,KAAA,CAAM,KAAA,CAAM,IAAA,CAAK,CAAC,CAAA,KAAM,CAAA,CAAE,aAAA,EAAe,WAAA,OAAkB,CAAA,IAAK,CAAA,CAAE,IAAA,EAAM,WAAA,OAAkB,CAAC,CAAA;AACxG,EAAA,OAAO,IAAA,GAAO,EAAE,EAAA,EAAI,IAAA,CAAK,IAAG,GAAI,IAAA;AAClC;;;ACtXO,IAAM,qBAAN,MAAyB;AAAA,EACrB,IAAA;AAAA,EACA,YAAA;AAAA,EACA,KAAA;AAAA,EACQ,SAAA;AAAA,EACA,SAAA;AAAA,EACA,IAAA;AAAA,EACA,MAAA;AAAA,EACT,OAAA,GAAU,EAAA;AAAA,EAElB,YAAY,OAAA,EAAoC;AAC9C,IAAA,IAAA,CAAK,OAAO,OAAA,CAAQ,IAAA;AACpB,IAAA,IAAA,CAAK,YAAA,GAAe,oBAAA,CAAqB,OAAA,CAAQ,IAAI,CAAA;AACrD,IAAA,IAAA,CAAK,KAAA,GAAQ,OAAA,CAAQ,KAAA,IAAS,IAAI,gBAAA,EAAiB;AACnD,IAAA,IAAA,CAAK,YAAY,OAAA,CAAQ,SAAA;AACzB,IAAA,IAAA,CAAK,SAAA,GAAY,QAAQ,SAAA,IAAa,YAAA;AACtC,IAAA,IAAA,CAAK,IAAA,GAAO,QAAQ,IAAA,IAAQ,SAAA;AAC5B,IAAA,IAAA,CAAK,SAAS,OAAA,CAAQ,MAAA;AAAA,EACxB;AAAA;AAAA;AAAA;AAAA;AAAA,EAMA,aAAA,GAAuC;AACrC,IAAA,IAAA,CAAK,MAAM,SAAA,EAAU;AACrB,IAAA,MAAM,IAAA,GAAO,IAAA,CAAK,MAAA,GAAS,IAAA,CAAK,SAAA,CAAU,IAAA,CAAK,IAAA,EAAM,IAAA,CAAK,MAAM,CAAA,GAAI,IAAA,CAAK,SAAA,CAAU,KAAK,IAAI,CAAA;AAC5F,IAAA,MAAM,MAAA,GAAS,KAAK,GAAA,IAAO,SAAA;AAC3B,IAAA,MAAM,QAAA,GAAW,IAAA,CAAK,OAAA,KAAY,EAAA,IAAM,KAAK,OAAA,KAAY,MAAA;AACzD,IAAA,IAAA,CAAK,OAAA,GAAU,MAAA;AAGf,IAAA,IAAI,KAAK,SAAA,EAAW;AAClB,MAAA,MAAMI,SAAQ,IAAA,CAAK,IAAA,CAAK,IAAA,CAAK,IAAA,EAAM,KAAK,SAAS,CAAA;AACjD,MAAA,IAAIA,MAAAA,EAAO;AACT,QAAA,IAAA,CAAK,KAAA,CAAM,GAAA,CAAI,IAAA,CAAK,YAAA,EAAc,QAAQA,MAAK,CAAA;AAC/C,QAAA,IAAA,CAAK,KAAA,CAAM,MAAA,CAAO,IAAA,CAAK,YAAA,EAAc,MAAM,CAAA;AAAA,MAC7C;AACA,MAAA,OAAO;AAAA,QACL,KAAA,EAAAA,MAAAA;AAAA,QACA,MAAA;AAAA,QACA,MAAM,IAAA,CAAK,IAAA;AAAA,QACX,QAAA;AAAA,QACA,SAAA,EAAW,KAAA;AAAA,QACX,cAAc,IAAA,CAAK;AAAA,OACrB;AAAA,IACF;AAEA,IAAA,MAAM,OAAO,IAAA,CAAK,KAAA,CAAM,GAAA,CAAI,IAAA,CAAK,cAAc,MAAM,CAAA;AACrD,IAAA,IAAI,IAAA,EAAM;AACR,MAAA,IAAA,CAAK,KAAA,CAAM,MAAA,CAAO,IAAA,CAAK,YAAA,EAAc,MAAM,CAAA;AAC3C,MAAA,OAAO;AAAA,QACL,OAAO,IAAA,CAAK,KAAA;AAAA,QACZ,MAAA;AAAA,QACA,MAAM,IAAA,CAAK,IAAA;AAAA,QACX,QAAA;AAAA,QACA,SAAA,EAAW,IAAA;AAAA,QACX,cAAc,IAAA,CAAK;AAAA,OACrB;AAAA,IACF;AAEA,IAAA,MAAM,KAAA,GAAQ,IAAA,CAAK,IAAA,CAAK,IAAA,CAAK,IAAI,CAAA;AACjC,IAAA,IAAI,KAAA,EAAO;AACT,MAAA,IAAA,CAAK,KAAA,CAAM,GAAA,CAAI,IAAA,CAAK,YAAA,EAAc,QAAQ,KAAK,CAAA;AAC/C,MAAA,IAAA,CAAK,KAAA,CAAM,MAAA,CAAO,IAAA,CAAK,YAAA,EAAc,MAAM,CAAA;AAAA,IAC7C;AACA,IAAA,OAAO;AAAA,MACL,KAAA;AAAA,MACA,MAAA;AAAA,MACA,MAAM,IAAA,CAAK,IAAA;AAAA,MACX,QAAA;AAAA,MACA,SAAA,EAAW,KAAA;AAAA,MACX,cAAc,IAAA,CAAK;AAAA,KACrB;AAAA,EACF;AAAA;AAAA,EAGA,SAAA,GAAY;AACV,IAAA,OAAO,IAAA,CAAK,KAAA,CAAM,IAAA,CAAK,IAAA,CAAK,YAAY,CAAA;AAAA,EAC1C;AACF","file":"chunk-4ZMJKR74.js","sourcesContent":["/**\n * Wire protocol for the lightweight Vibgrate daemon (`vgd`) — Fusion Runtime Phase 2 prototype.\n *\n * Line-delimited JSON over a local Unix domain socket (named pipe on Windows).\n * No credentials leave this process; the socket is local-only.\n */\n\nexport const VGD_PROTOCOL_VERSION = 'vgd/0' as const;\n\nexport interface WorkspaceRecord {\n  /** Stable repository id (same as global store key). */\n  id: string;\n  /** Absolute repository root. */\n  root: string;\n  /** Absolute path to the current graph snapshot (may not exist yet). */\n  graphPath: string;\n  /** ISO timestamp when this workspace was last registered / refreshed. */\n  registeredAt: string;\n  /** Optional federation label. */\n  label?: string;\n  /** Optional federation role. */\n  role?: 'primary' | 'member';\n  /** Git branch or detached SHA at registration (multi-branch ActiveGraph). */\n  gitRef?: string;\n}\n\n/** Lightweight ActiveGraph slot summary (no full graph payload). */\nexport interface GraphSlotSummary {\n  repositoryId: string;\n  gitRef: string;\n  loadedAt: number;\n  lastAccessAt: number;\n  nodeCount: number;\n  current: boolean;\n  idleMs: number;\n  evictable: boolean;\n}\n\nexport type VgdRequest =\n  | { op: 'ping' }\n  | { op: 'status' }\n  /** Ask the daemon to exit cleanly (honoured only by a standalone `vg daemon start`). */\n  | { op: 'shutdown' }\n  | { op: 'list' }\n  | { op: 'register'; root: string; label?: string; role?: 'primary' | 'member' }\n  | { op: 'unregister'; root: string }\n  | {\n      op: 'register-federation';\n      primaryRoot: string;\n      members: Array<{ root: string; label?: string; role?: 'primary' | 'member' }>;\n    }\n  | { op: 'list-graph-slots'; repositoryId?: string }\n  | { op: 'select-git-ref'; repositoryId: string; gitRef: string }\n  | { op: 'put-graph'; repositoryId: string; gitRef: string; graph: unknown }\n  /**\n   * Load the workspace's on-disk code map into ActiveGraph inside the daemon\n   * (binary snapshot first, JSON fallback). The fast-path alternative to\n   * shipping the whole graph over the socket with put-graph — use it whenever\n   * the map already exists on disk.\n   */\n  | { op: 'load-graph'; root: string; gitRef?: string; graphPath?: string }\n  /** Lexical/structural query against the ActiveGraph for a repository. */\n  | { op: 'query-graph'; repositoryId: string; query: string; limit?: number; gitRef?: string }\n  /** Blast-radius impact for a symbol id or qualified name. */\n  | { op: 'impact-of'; repositoryId: string; symbol: string; depth?: number; gitRef?: string }\n  /** Compact graph meta for the current (or named) slot — not the full graph. */\n  | { op: 'graph-summary'; repositoryId: string; gitRef?: string }\n  /** Semantic warm (docs/VGD-SEMANTIC-WARM-SPEC.md): worker + per-slot index state. */\n  | { op: 'embed-status'; repositoryId?: string }\n  /** Embed one string in the daemon's warm worker; the caller ranks locally. */\n  | { op: 'embed-query'; text: string }\n  /** Ensure the slot's vector index exists, building it if needed. */\n  | { op: 'embed-index'; repositoryId: string; gitRef?: string }\n  /** Approach B host broker: warm model status inside vgd. */\n  | { op: 'host-status' }\n  | { op: 'host-load'; modelPath: string }\n  | { op: 'host-unload'; modelPath?: string }\n  | {\n      op: 'host-generate';\n      modelPath: string;\n      messages: Array<{ role: string; content: string }>;\n      grammar?: string;\n      requireGrammar?: boolean;\n      maxTokens?: number;\n      temperature?: number;\n    };\n\n/** Semantic warm state: the worker, and one row per resident slot index. */\nexport interface EmbedStatusPayload {\n  worker: 'stopped' | 'starting' | 'ready' | 'unavailable';\n  pid?: number;\n  model?: string;\n  crashes: number;\n  reason?: string;\n  slots: Array<{\n    repositoryId: string;\n    gitRef: string;\n    state: string;\n    vectors: number;\n    nodeCount: number;\n    builtAt?: number;\n    buildMs?: number;\n    error?: string;\n  }>;\n}\n\n/** Compact match row for query-graph (no full node payloads). */\nexport interface VgdQueryMatch {\n  id: string;\n  qualifiedName: string;\n  kind: string;\n  file: string;\n  line: number;\n  score: number;\n  why: string;\n}\n\nexport interface VgdImpactItem {\n  id: string;\n  name: string;\n  kind: string;\n  file: string;\n  line: number;\n  depth: number;\n  confidence: number;\n}\n\nexport type VgdResponse =\n  | { ok: true; pong: true; version: typeof VGD_PROTOCOL_VERSION }\n  | {\n      ok: true;\n      pid: number;\n      uptimeMs: number;\n      workspaces: number;\n      /** Resident multi-branch ActiveGraph slots (Fusion §4.1.1). */\n      graphSlots?: number;\n      version: typeof VGD_PROTOCOL_VERSION;\n      socketPath: string;\n    }\n  | { ok: true; workspaces: WorkspaceRecord[] }\n  | { ok: true; workspace: WorkspaceRecord }\n  | { ok: true; workspaces: WorkspaceRecord[]; federation: true }\n  | { ok: true; removed: boolean }\n  | { ok: true; stopping: true }\n  | { ok: true; slots: GraphSlotSummary[] }\n  | { ok: true; semantic: EmbedStatusPayload }\n  | { ok: true; vector: number[]; model?: string }\n  | {\n      ok: true;\n      indexed: true;\n      repositoryId: string;\n      gitRef: string;\n      state: string;\n      vectors: number;\n      buildMs?: number;\n    }\n  | { ok: true; selected: true; repositoryId: string; gitRef: string }\n  | { ok: true; stored: true; repositoryId: string; gitRef: string; nodeCount: number }\n  | {\n      ok: true;\n      query: string;\n      repositoryId: string;\n      gitRef: string;\n      matches: VgdQueryMatch[];\n      tokensEstimate: number;\n    }\n  | {\n      ok: true;\n      repositoryId: string;\n      gitRef: string;\n      symbol: string;\n      root: { id: string; name: string };\n      depth: number;\n      affected: VgdImpactItem[];\n      direct: number;\n      transitive: number;\n    }\n  | {\n      ok: true;\n      repositoryId: string;\n      gitRef: string;\n      summary: {\n        nodeCount: number;\n        edgeCount: number;\n        languages: string[];\n        corpusHash: string | null;\n        root: string | null;\n      };\n    }\n  | {\n      ok: true;\n      host: {\n        poolSize: number;\n        loadedModels: string[];\n        bindingReady: boolean;\n      };\n    }\n  | { ok: true; hostLoaded: true; modelPath: string }\n  | { ok: true; hostUnloaded: true; cleared: number }\n  | {\n      ok: true;\n      hostGenerated: true;\n      text: string;\n      model: string;\n      constrained: boolean;\n      grammarApplied?: boolean;\n      draftAcceptedChars?: number;\n      latencyMs?: number;\n      unknownIdentifiers?: string[];\n    }\n  | { ok: false; error: string; code?: string };\n\nexport function parseRequest(line: string): VgdRequest | { error: string } {\n  let raw: unknown;\n  try {\n    raw = JSON.parse(line);\n  } catch {\n    return { error: 'invalid JSON' };\n  }\n  if (!raw || typeof raw !== 'object') return { error: 'request must be an object' };\n  const op = (raw as { op?: unknown }).op;\n  if (op === 'ping' || op === 'status' || op === 'shutdown' || op === 'list') return { op };\n  if (op === 'list-graph-slots') {\n    const repositoryId = (raw as { repositoryId?: unknown }).repositoryId;\n    return {\n      op: 'list-graph-slots',\n      repositoryId: typeof repositoryId === 'string' && repositoryId.trim() ? repositoryId.trim() : undefined,\n    };\n  }\n  if (op === 'select-git-ref') {\n    const repositoryId = (raw as { repositoryId?: unknown }).repositoryId;\n    const gitRef = (raw as { gitRef?: unknown }).gitRef;\n    if (typeof repositoryId !== 'string' || !repositoryId.trim()) return { error: 'select-git-ref requires repositoryId' };\n    if (typeof gitRef !== 'string' || !gitRef.trim()) return { error: 'select-git-ref requires gitRef' };\n    return { op: 'select-git-ref', repositoryId: repositoryId.trim(), gitRef: gitRef.trim() };\n  }\n  if (op === 'put-graph') {\n    const repositoryId = (raw as { repositoryId?: unknown }).repositoryId;\n    const gitRef = (raw as { gitRef?: unknown }).gitRef;\n    const graph = (raw as { graph?: unknown }).graph;\n    if (typeof repositoryId !== 'string' || !repositoryId.trim()) return { error: 'put-graph requires repositoryId' };\n    if (typeof gitRef !== 'string' || !gitRef.trim()) return { error: 'put-graph requires gitRef' };\n    if (!graph || typeof graph !== 'object') return { error: 'put-graph requires graph object' };\n    return { op: 'put-graph', repositoryId: repositoryId.trim(), gitRef: gitRef.trim(), graph };\n  }\n  if (op === 'load-graph') {\n    const root = (raw as { root?: unknown }).root;\n    const gitRef = (raw as { gitRef?: unknown }).gitRef;\n    const graphPath = (raw as { graphPath?: unknown }).graphPath;\n    if (typeof root !== 'string' || !root.trim()) return { error: 'load-graph requires a non-empty root' };\n    return {\n      op: 'load-graph',\n      root: root.trim(),\n      gitRef: typeof gitRef === 'string' && gitRef.trim() ? gitRef.trim() : undefined,\n      graphPath: typeof graphPath === 'string' && graphPath.trim() ? graphPath.trim() : undefined,\n    };\n  }\n  if (op === 'embed-status') {\n    const repositoryId = (raw as { repositoryId?: unknown }).repositoryId;\n    return {\n      op: 'embed-status',\n      repositoryId: typeof repositoryId === 'string' && repositoryId.trim() ? repositoryId.trim() : undefined,\n    };\n  }\n  if (op === 'embed-query') {\n    const text = (raw as { text?: unknown }).text;\n    if (typeof text !== 'string' || !text.trim()) return { error: 'embed-query requires text' };\n    // Socket input is untrusted like every other op's; bound it so one caller\n    // cannot make the worker chew on an arbitrarily large string.\n    return { op: 'embed-query', text: text.trim().slice(0, 8_000) };\n  }\n  if (op === 'embed-index') {\n    const repositoryId = (raw as { repositoryId?: unknown }).repositoryId;\n    const gitRef = (raw as { gitRef?: unknown }).gitRef;\n    if (typeof repositoryId !== 'string' || !repositoryId.trim()) return { error: 'embed-index requires repositoryId' };\n    return {\n      op: 'embed-index',\n      repositoryId: repositoryId.trim(),\n      gitRef: typeof gitRef === 'string' && gitRef.trim() ? gitRef.trim() : undefined,\n    };\n  }\n  if (op === 'query-graph') {\n    const repositoryId = (raw as { repositoryId?: unknown }).repositoryId;\n    const query = (raw as { query?: unknown }).query;\n    const limit = (raw as { limit?: unknown }).limit;\n    const gitRef = (raw as { gitRef?: unknown }).gitRef;\n    if (typeof repositoryId !== 'string' || !repositoryId.trim()) return { error: 'query-graph requires repositoryId' };\n    if (typeof query !== 'string' || !query.trim()) return { error: 'query-graph requires query' };\n    return {\n      op: 'query-graph',\n      repositoryId: repositoryId.trim(),\n      query: query.trim(),\n      limit: typeof limit === 'number' && limit > 0 ? Math.min(Math.floor(limit), 50) : undefined,\n      gitRef: typeof gitRef === 'string' && gitRef.trim() ? gitRef.trim() : undefined,\n    };\n  }\n  if (op === 'impact-of') {\n    const repositoryId = (raw as { repositoryId?: unknown }).repositoryId;\n    const symbol = (raw as { symbol?: unknown }).symbol;\n    const depth = (raw as { depth?: unknown }).depth;\n    const gitRef = (raw as { gitRef?: unknown }).gitRef;\n    if (typeof repositoryId !== 'string' || !repositoryId.trim()) return { error: 'impact-of requires repositoryId' };\n    if (typeof symbol !== 'string' || !symbol.trim()) return { error: 'impact-of requires symbol' };\n    return {\n      op: 'impact-of',\n      repositoryId: repositoryId.trim(),\n      symbol: symbol.trim(),\n      depth: typeof depth === 'number' && depth > 0 ? Math.min(Math.floor(depth), 12) : undefined,\n      gitRef: typeof gitRef === 'string' && gitRef.trim() ? gitRef.trim() : undefined,\n    };\n  }\n  if (op === 'graph-summary') {\n    const repositoryId = (raw as { repositoryId?: unknown }).repositoryId;\n    const gitRef = (raw as { gitRef?: unknown }).gitRef;\n    if (typeof repositoryId !== 'string' || !repositoryId.trim()) return { error: 'graph-summary requires repositoryId' };\n    return {\n      op: 'graph-summary',\n      repositoryId: repositoryId.trim(),\n      gitRef: typeof gitRef === 'string' && gitRef.trim() ? gitRef.trim() : undefined,\n    };\n  }\n  if (op === 'register' || op === 'unregister') {\n    const root = (raw as { root?: unknown }).root;\n    if (typeof root !== 'string' || !root.trim()) return { error: `${op} requires a non-empty root` };\n    const label = (raw as { label?: unknown }).label;\n    const role = (raw as { role?: unknown }).role;\n    if (op === 'register') {\n      return {\n        op: 'register',\n        root: root.trim(),\n        label: typeof label === 'string' ? label : undefined,\n        role: role === 'primary' || role === 'member' ? role : undefined,\n      };\n    }\n    return { op: 'unregister', root: root.trim() };\n  }\n  if (op === 'register-federation') {\n    const primaryRoot = (raw as { primaryRoot?: unknown }).primaryRoot;\n    const members = (raw as { members?: unknown }).members;\n    if (typeof primaryRoot !== 'string' || !primaryRoot.trim()) return { error: 'register-federation requires primaryRoot' };\n    if (!Array.isArray(members) || members.length === 0) return { error: 'register-federation requires members[]' };\n    const parsed: Array<{ root: string; label?: string; role?: 'primary' | 'member' }> = [];\n    for (const m of members) {\n      if (!m || typeof m !== 'object') continue;\n      const root = (m as { root?: unknown }).root;\n      if (typeof root !== 'string' || !root.trim()) continue;\n      const label = (m as { label?: unknown }).label;\n      const role = (m as { role?: unknown }).role;\n      parsed.push({\n        root: root.trim(),\n        label: typeof label === 'string' ? label : undefined,\n        role: role === 'primary' || role === 'member' ? role : undefined,\n      });\n    }\n    if (!parsed.length) return { error: 'register-federation members must include at least one root' };\n    return { op: 'register-federation', primaryRoot: primaryRoot.trim(), members: parsed };\n  }\n  if (op === 'host-status') return { op: 'host-status' };\n  if (op === 'host-load') {\n    const modelPath = (raw as { modelPath?: unknown }).modelPath;\n    if (typeof modelPath !== 'string' || !modelPath.trim()) return { error: 'host-load requires modelPath' };\n    return { op: 'host-load', modelPath: modelPath.trim() };\n  }\n  if (op === 'host-unload') {\n    const modelPath = (raw as { modelPath?: unknown }).modelPath;\n    return {\n      op: 'host-unload',\n      modelPath: typeof modelPath === 'string' && modelPath.trim() ? modelPath.trim() : undefined,\n    };\n  }\n  if (op === 'host-generate') {\n    const modelPath = (raw as { modelPath?: unknown }).modelPath;\n    const messages = (raw as { messages?: unknown }).messages;\n    if (typeof modelPath !== 'string' || !modelPath.trim()) return { error: 'host-generate requires modelPath' };\n    if (!Array.isArray(messages) || messages.length === 0) return { error: 'host-generate requires messages[]' };\n    const parsed: Array<{ role: string; content: string }> = [];\n    for (const m of messages) {\n      if (!m || typeof m !== 'object') continue;\n      const role = (m as { role?: unknown }).role;\n      const content = (m as { content?: unknown }).content;\n      if (typeof role !== 'string' || typeof content !== 'string') continue;\n      parsed.push({ role, content });\n    }\n    if (!parsed.length) return { error: 'host-generate messages must include role+content' };\n    const grammar = (raw as { grammar?: unknown }).grammar;\n    const requireGrammar = (raw as { requireGrammar?: unknown }).requireGrammar;\n    const maxTokens = (raw as { maxTokens?: unknown }).maxTokens;\n    const temperature = (raw as { temperature?: unknown }).temperature;\n    return {\n      op: 'host-generate',\n      modelPath: modelPath.trim(),\n      messages: parsed,\n      grammar: typeof grammar === 'string' ? grammar : undefined,\n      requireGrammar: requireGrammar === true,\n      maxTokens: typeof maxTokens === 'number' ? maxTokens : undefined,\n      temperature: typeof temperature === 'number' ? temperature : undefined,\n    };\n  }\n  return { error: `unknown op: ${String(op)}` };\n}\n","/**\n * Multi-branch ActiveGraph cache (Fusion plan §4.1.1).\n *\n * Holds several in-memory graphs for the same repository — one per gitRef\n * (branch or detached SHA). Memory management: after an idle timeout, slots\n * become evictable; among idle slots, LILO (last-in, last-out ≡ FIFO by\n * load order) reclaims the oldest-loaded idle graph first. The currently\n * selected slot for a repository is never evicted.\n */\n\nimport type { VgGraph } from '../schema.js';\nimport { activeGraphSlotKey } from './git-ref.js';\n\n/** Default idle timeout: 20 minutes (within the 15–30 min plan band). */\nexport const DEFAULT_ACTIVE_GRAPH_IDLE_MS = 20 * 60 * 1000;\n\nexport interface ActiveGraphSlot {\n  repositoryId: string;\n  gitRef: string;\n  graph: VgGraph;\n  /** When this slot was first loaded into the cache. */\n  loadedAt: number;\n  /** Last access / select time. */\n  lastAccessAt: number;\n  /** Approximate size hint for diagnostics (node count). */\n  nodeCount: number;\n}\n\nexport interface ActiveGraphCacheOptions {\n  /** Idle duration before a non-selected slot is evictable (default 20 min). */\n  idleTimeoutMs?: number;\n  /** Max resident graphs per repositoryId (default 8). */\n  maxPerRepo?: number;\n  /** Max resident graphs process-wide (default 32). */\n  maxTotal?: number;\n  now?: () => number;\n  /**\n   * Called for every slot leaving the cache, whatever removed it (idle\n   * timeout, overflow, clear). Anything keyed by the same slot — the semantic\n   * index in vgd — hangs off this so it can never outlive the graph it\n   * describes. Must not throw; a listener error is swallowed rather than\n   * corrupting eviction.\n   */\n  onEvict?: (slot: { repositoryId: string; gitRef: string }) => void;\n}\n\nexport interface ActiveGraphSlotSummary {\n  repositoryId: string;\n  gitRef: string;\n  loadedAt: number;\n  lastAccessAt: number;\n  nodeCount: number;\n  current: boolean;\n  idleMs: number;\n  evictable: boolean;\n}\n\n/**\n * In-memory multi-branch graph cache. Pure structure — does not load/save disk.\n */\nexport class ActiveGraphCache {\n  private readonly slots = new Map<string, ActiveGraphSlot>();\n  /** repositoryId → currently selected gitRef */\n  private readonly currentRef = new Map<string, string>();\n  private readonly idleTimeoutMs: number;\n  private readonly maxPerRepo: number;\n  private readonly maxTotal: number;\n  private readonly now: () => number;\n  private readonly onEvict?: (slot: { repositoryId: string; gitRef: string }) => void;\n\n  constructor(options: ActiveGraphCacheOptions = {}) {\n    this.onEvict = options.onEvict;\n    this.idleTimeoutMs = options.idleTimeoutMs ?? DEFAULT_ACTIVE_GRAPH_IDLE_MS;\n    this.maxPerRepo = options.maxPerRepo ?? 8;\n    this.maxTotal = options.maxTotal ?? 32;\n    this.now = options.now ?? (() => Date.now());\n  }\n\n  size(): number {\n    return this.slots.size;\n  }\n\n  get(repositoryId: string, gitRef: string): ActiveGraphSlot | undefined {\n    const slot = this.slots.get(activeGraphSlotKey(repositoryId, gitRef));\n    if (slot) {\n      slot.lastAccessAt = this.now();\n    }\n    return slot;\n  }\n\n  /**\n   * Insert or replace a graph for (repositoryId, gitRef). Touches access time.\n   * Runs eviction if over cap.\n   */\n  put(repositoryId: string, gitRef: string, graph: VgGraph): ActiveGraphSlot {\n    const key = activeGraphSlotKey(repositoryId, gitRef);\n    const t = this.now();\n    const existing = this.slots.get(key);\n    const slot: ActiveGraphSlot = {\n      repositoryId,\n      gitRef,\n      graph,\n      loadedAt: existing?.loadedAt ?? t,\n      lastAccessAt: t,\n      nodeCount: graph.nodes?.length ?? 0,\n    };\n    this.slots.set(key, slot);\n    if (!this.currentRef.has(repositoryId)) {\n      this.currentRef.set(repositoryId, gitRef);\n    }\n    this.evictIfNeeded();\n    return slot;\n  }\n\n  /**\n   * Mark gitRef as the current branch for this repository and touch it.\n   * Returns the slot if present.\n   */\n  select(repositoryId: string, gitRef: string): ActiveGraphSlot | undefined {\n    this.currentRef.set(repositoryId, gitRef);\n    return this.get(repositoryId, gitRef);\n  }\n\n  /** Currently selected gitRef for a repository, if any. */\n  selectedRef(repositoryId: string): string | undefined {\n    return this.currentRef.get(repositoryId);\n  }\n\n  current(repositoryId: string): ActiveGraphSlot | undefined {\n    const ref = this.currentRef.get(repositoryId);\n    if (!ref) return undefined;\n    return this.get(repositoryId, ref);\n  }\n\n  /**\n   * Drop idle slots past the timeout (LILO among idle).\n   * Returns keys of removed slots.\n   */\n  evictIdle(now: number = this.now()): string[] {\n    return this.evict(now, false);\n  }\n\n  /** Force eviction of idle slots when over caps (timeout may be ignored for overflow). */\n  evictIfNeeded(): string[] {\n    return this.evict(this.now(), true);\n  }\n\n  list(repositoryId?: string): ActiveGraphSlotSummary[] {\n    const t = this.now();\n    const out: ActiveGraphSlotSummary[] = [];\n    for (const slot of this.slots.values()) {\n      if (repositoryId && slot.repositoryId !== repositoryId) continue;\n      const current = this.currentRef.get(slot.repositoryId) === slot.gitRef;\n      const idleMs = t - slot.lastAccessAt;\n      out.push({\n        repositoryId: slot.repositoryId,\n        gitRef: slot.gitRef,\n        loadedAt: slot.loadedAt,\n        lastAccessAt: slot.lastAccessAt,\n        nodeCount: slot.nodeCount,\n        current,\n        idleMs,\n        evictable: !current && idleMs >= this.idleTimeoutMs,\n      });\n    }\n    return out.sort(\n      (a, b) => a.repositoryId.localeCompare(b.repositoryId) || a.gitRef.localeCompare(b.gitRef),\n    );\n  }\n\n  clear(): void {\n    for (const slot of this.slots.values()) this.notifyEvict(slot);\n    this.slots.clear();\n    this.currentRef.clear();\n  }\n\n  private notifyEvict(slot: { repositoryId: string; gitRef: string }): void {\n    if (!this.onEvict) return;\n    try {\n      this.onEvict({ repositoryId: slot.repositoryId, gitRef: slot.gitRef });\n    } catch {\n      // A listener problem must never break cache maintenance.\n    }\n  }\n\n  private evict(now: number, forceOverflow: boolean): string[] {\n    const removed: string[] = [];\n\n    const removeKey = (key: string): void => {\n      const slot = this.slots.get(key);\n      if (!slot) return;\n      this.slots.delete(key);\n      removed.push(key);\n      this.notifyEvict(slot);\n    };\n\n    // 1) Idle timeout: LILO among idle (earliest loadedAt first).\n    const idle = this.idleCandidates(now, this.idleTimeoutMs);\n    idle.sort((a, b) => a.loadedAt - b.loadedAt);\n    for (const slot of idle) {\n      removeKey(activeGraphSlotKey(slot.repositoryId, slot.gitRef));\n    }\n\n    // 2) Overflow: if still over maxPerRepo or maxTotal, LILO among any non-current idle-or-all-non-current.\n    if (forceOverflow) {\n      while (this.slots.size > this.maxTotal) {\n        const victim = this.pickLiloVictim(now, /* requireIdleTimeout */ false);\n        if (!victim) break;\n        removeKey(activeGraphSlotKey(victim.repositoryId, victim.gitRef));\n      }\n      // Per-repo caps\n      const byRepo = new Map<string, ActiveGraphSlot[]>();\n      for (const s of this.slots.values()) {\n        const list = byRepo.get(s.repositoryId) ?? [];\n        list.push(s);\n        byRepo.set(s.repositoryId, list);\n      }\n      for (const [repoId, list] of byRepo) {\n        if (list.length <= this.maxPerRepo) continue;\n        const nonCurrent = list\n          .filter((s) => this.currentRef.get(repoId) !== s.gitRef)\n          .sort((a, b) => a.loadedAt - b.loadedAt);\n        let excess = list.length - this.maxPerRepo;\n        for (const s of nonCurrent) {\n          if (excess <= 0) break;\n          removeKey(activeGraphSlotKey(s.repositoryId, s.gitRef));\n          excess--;\n        }\n      }\n    }\n\n    return removed;\n  }\n\n  private idleCandidates(now: number, timeoutMs: number): ActiveGraphSlot[] {\n    const out: ActiveGraphSlot[] = [];\n    for (const slot of this.slots.values()) {\n      if (this.currentRef.get(slot.repositoryId) === slot.gitRef) continue;\n      if (now - slot.lastAccessAt >= timeoutMs) out.push(slot);\n    }\n    return out;\n  }\n\n  private pickLiloVictim(now: number, requireIdleTimeout: boolean): ActiveGraphSlot | null {\n    let best: ActiveGraphSlot | null = null;\n    for (const slot of this.slots.values()) {\n      if (this.currentRef.get(slot.repositoryId) === slot.gitRef) continue;\n      if (requireIdleTimeout && now - slot.lastAccessAt < this.idleTimeoutMs) continue;\n      if (!best || slot.loadedAt < best.loadedAt) best = slot;\n    }\n    return best;\n  }\n}\n","import * as path from 'node:path';\nimport { repositoryIdFromRoot, globalGraphPathForRef, globalGraphPath } from '../paths.js';\nimport { detectGitRef } from '../git-ref.js';\nimport { ActiveGraphCache } from '../active-graph-cache.js';\nimport type { WorkspaceRecord } from './protocol.js';\nimport type { VgGraph } from '../../schema.js';\n\n/** Slot-scoped resource that must track the graph cache exactly. */\nexport interface GraphSlotListener {\n  onGraphPut(repositoryId: string, gitRef: string, graph: VgGraph): void;\n  onGraphSelect(repositoryId: string, gitRef: string): void;\n  onGraphEvict(repositoryId: string, gitRef: string): void;\n}\n\n/**\n * In-memory workspace registry for the vgd prototype.\n *\n * Tracks which repository roots the daemon knows about and where their\n * graphs live. Holds a multi-branch {@link ActiveGraphCache} so several\n * git refs of the same repo can stay warm (Fusion §4.1.1).\n */\nexport class WorkspaceRegistry {\n  private readonly byId = new Map<string, WorkspaceRecord>();\n  /**\n   * Anything keyed by the same (repositoryId, gitRef) slot as the graph — the\n   * semantic index — attaches here. Wiring it through the registry rather than\n   * the cache directly means every put/select/evict passes one funnel, so an\n   * index can never describe a ref its graph no longer holds.\n   */\n  private slotListener?: GraphSlotListener;\n  /** Multi-branch in-memory graphs (shared across registered workspaces). */\n  readonly graphs = new ActiveGraphCache({\n    onEvict: (slot) => this.slotListener?.onGraphEvict(slot.repositoryId, slot.gitRef),\n  });\n\n  /** Attach the semantic index (or any slot-scoped resource) to graph lifecycle. */\n  setSlotListener(listener: GraphSlotListener | undefined): void {\n    this.slotListener = listener;\n  }\n\n  register(\n    root: string,\n    now: () => Date = () => new Date(),\n    meta: { label?: string; role?: 'primary' | 'member'; gitRef?: string } = {},\n  ): WorkspaceRecord {\n    const resolved = path.resolve(root);\n    const id = repositoryIdFromRoot(resolved);\n    const git = meta.gitRef ? { ref: meta.gitRef, kind: 'branch' as const } : detectGitRef(resolved);\n    const graphPath =\n      git.kind !== 'none' && git.ref ? globalGraphPathForRef(resolved, git.ref) : globalGraphPath(resolved);\n    const record: WorkspaceRecord = {\n      id,\n      root: resolved,\n      graphPath,\n      registeredAt: now().toISOString(),\n      label: meta.label,\n      role: meta.role,\n      gitRef: git.ref || undefined,\n    };\n    this.byId.set(id, record);\n    if (git.ref) this.graphs.select(id, git.ref);\n    return record;\n  }\n\n  /**\n   * Activate or insert an in-memory graph for a workspace branch.\n   * Call after load/build; runs LILO idle eviction as needed.\n   */\n  putGraph(repositoryId: string, gitRef: string, graph: VgGraph): void {\n    this.graphs.put(repositoryId, gitRef, graph);\n    this.graphs.select(repositoryId, gitRef);\n    // Invalidate before anyone can query: the old vectors describe the old graph.\n    this.slotListener?.onGraphPut(repositoryId, gitRef, graph);\n    this.slotListener?.onGraphSelect(repositoryId, gitRef);\n  }\n\n  /** Switch the current branch slot for a repository (no load). */\n  selectGitRef(repositoryId: string, gitRef: string): void {\n    this.graphs.select(repositoryId, gitRef);\n    this.slotListener?.onGraphSelect(repositoryId, gitRef);\n  }\n\n  /** Register every member of a federation (primary + members). */\n  registerFederation(\n    members: Array<{ root: string; label?: string; role?: 'primary' | 'member' }>,\n    now: () => Date = () => new Date(),\n  ): WorkspaceRecord[] {\n    return members.map((m) => this.register(m.root, now, { label: m.label, role: m.role }));\n  }\n\n  unregister(root: string): boolean {\n    const id = repositoryIdFromRoot(path.resolve(root));\n    return this.byId.delete(id);\n  }\n\n  list(): WorkspaceRecord[] {\n    return [...this.byId.values()].sort((a, b) => a.root.localeCompare(b.root));\n  }\n\n  get(root: string): WorkspaceRecord | undefined {\n    return this.byId.get(repositoryIdFromRoot(path.resolve(root)));\n  }\n\n  /** Lookup by stable repository id. */\n  getById(repositoryId: string): WorkspaceRecord | undefined {\n    return this.byId.get(repositoryId);\n  }\n\n  size(): number {\n    return this.byId.size;\n  }\n\n  /**\n   * Resolve an ActiveGraph for query/impact: prefer the named gitRef, else the\n   * selected current slot, else any warm slot for the repository.\n   */\n  resolveGraph(repositoryId: string, gitRef?: string): { graph: VgGraph; gitRef: string } | null {\n    if (gitRef) {\n      const slot = this.graphs.get(repositoryId, gitRef);\n      if (slot) return { graph: slot.graph, gitRef: slot.gitRef };\n    }\n    const current = this.graphs.current(repositoryId);\n    if (current) return { graph: current.graph, gitRef: current.gitRef };\n    // Fall back to any warm slot for this repo (deterministic: earliest loaded).\n    const any = this.graphs\n      .list(repositoryId)\n      .slice()\n      .sort((a, b) => a.loadedAt - b.loadedAt)[0];\n    if (any) {\n      const slot = this.graphs.get(repositoryId, any.gitRef);\n      if (slot) return { graph: slot.graph, gitRef: slot.gitRef };\n    }\n    return null;\n  }\n}\n","/**\n * Model host broker inside vgd (Approach B / B4 + P4 multi-client).\n *\n * Long-lived daemon process can keep warm llama.cpp sessions so CLI and IDE\n * clients share one loaded model. Management (which pack/mode) stays in the\n * client/orchestrator; vgd only loads paths the client requests and generates.\n *\n * P4: clients acquire/release leases per model path so unload is refcounted\n * (one IDE + CLI can share a warm model without the first exit killing it).\n *\n * Binding is injected (never static node-llama-cpp import).\n */\n\nimport {\n  acquireHostSession,\n  clearHostSessionPool,\n  dropHostSession,\n  evictIdleSessions,\n  generateOnSession,\n  hostSessionPoolSize,\n  listHostSessions,\n  type HostGenerateReport,\n  type HostSessionInfo,\n} from '../llm-host/session.js';\nimport type { LlmChatMessage, LlmGenerateOptions } from '../llm-host/types.js';\n\nexport interface HostBrokerStatus {\n  poolSize: number;\n  loadedModels: string[];\n  bindingReady: boolean;\n  /** Per-path client lease counts (P4). */\n  leases: Record<string, number>;\n  sessions: HostSessionInfo[];\n}\n\nexport interface HostClientLease {\n  clientId: string;\n  modelPath: string;\n}\n\nexport class VgdHostBroker {\n  private binding: unknown | null = null;\n  private readonly loaded = new Set<string>();\n  /** modelPath → set of client ids holding a lease. */\n  private readonly leases = new Map<string, Set<string>>();\n\n  setBinding(lib: unknown | null): void {\n    this.binding = lib;\n  }\n\n  hasBinding(): boolean {\n    return this.binding != null;\n  }\n\n  status(): HostBrokerStatus {\n    const leases: Record<string, number> = {};\n    for (const [path, clients] of this.leases) {\n      leases[path] = clients.size;\n    }\n    return {\n      poolSize: hostSessionPoolSize(),\n      loadedModels: [...this.loaded],\n      bindingReady: this.binding != null,\n      leases,\n      sessions: listHostSessions(),\n    };\n  }\n\n  /**\n   * Load weights and optionally register a client lease (P4 multi-client).\n   * When clientId is omitted, behaves like a one-shot load (no lease bookkeeping).\n   */\n  async load(\n    modelPath: string,\n    clientId?: string,\n  ): Promise<{ ok: true; modelPath: string; leases: number } | { ok: false; error: string }> {\n    if (!this.binding) {\n      return { ok: false, error: 'host binding not configured — start vgd with llama runtime or attach binding' };\n    }\n    try {\n      await acquireHostSession(this.binding, modelPath);\n      this.loaded.add(modelPath);\n      if (clientId) {\n        let set = this.leases.get(modelPath);\n        if (!set) {\n          set = new Set();\n          this.leases.set(modelPath, set);\n        }\n        set.add(clientId);\n      }\n      evictIdleSessions(4);\n      return { ok: true, modelPath, leases: this.leases.get(modelPath)?.size ?? 0 };\n    } catch (e) {\n      return { ok: false, error: e instanceof Error ? e.message : String(e) };\n    }\n  }\n\n  /**\n   * Release a client lease. When the last lease is released, drop the warm\n   * session for that path. Without clientId, clears all leases for the path\n   * (or entire pool if modelPath omitted).\n   */\n  async unload(\n    modelPath?: string,\n    clientId?: string,\n  ): Promise<{ ok: true; cleared: number; remainingLeases: number }> {\n    if (!modelPath) {\n      const n = hostSessionPoolSize();\n      clearHostSessionPool();\n      this.loaded.clear();\n      this.leases.clear();\n      return { ok: true, cleared: n, remainingLeases: 0 };\n    }\n\n    if (clientId) {\n      const set = this.leases.get(modelPath);\n      if (set) {\n        set.delete(clientId);\n        if (set.size === 0) this.leases.delete(modelPath);\n      }\n      const remaining = this.leases.get(modelPath)?.size ?? 0;\n      if (remaining === 0) {\n        const dropped = dropHostSession(modelPath) ? 1 : 0;\n        this.loaded.delete(modelPath);\n        return { ok: true, cleared: dropped, remainingLeases: 0 };\n      }\n      return { ok: true, cleared: 0, remainingLeases: remaining };\n    }\n\n    // No clientId: force drop path (all leases).\n    this.leases.delete(modelPath);\n    const dropped = dropHostSession(modelPath) ? 1 : 0;\n    this.loaded.delete(modelPath);\n    return { ok: true, cleared: dropped, remainingLeases: 0 };\n  }\n\n  /** How many clients hold a lease on modelPath. */\n  leaseCount(modelPath: string): number {\n    return this.leases.get(modelPath)?.size ?? 0;\n  }\n\n  async generate(\n    modelPath: string,\n    messages: LlmChatMessage[],\n    opts?: LlmGenerateOptions,\n  ): Promise<{ ok: true; result: HostGenerateReport } | { ok: false; error: string }> {\n    if (!this.binding) {\n      return { ok: false, error: 'host binding not configured' };\n    }\n    try {\n      const session = await acquireHostSession(this.binding, modelPath);\n      this.loaded.add(modelPath);\n      const result = await generateOnSession(session, messages, {\n        grammar: opts?.grammar,\n        requireGrammar: opts?.requireGrammar,\n        identifierTrie: opts?.identifierTrie,\n        annotateUnknownIdentifiers: opts?.annotateUnknownIdentifiers,\n        draftCandidates: opts?.draftCandidates,\n        maxTokens: opts?.maxTokens,\n        temperature: opts?.temperature,\n        promptSegments: opts?.promptSegments,\n      });\n      return { ok: true, result };\n    } catch (e) {\n      return { ok: false, error: e instanceof Error ? e.message : String(e) };\n    }\n  }\n}\n\n/** Process-wide broker for the running vgd (tests may replace). */\nlet defaultBroker: VgdHostBroker | null = null;\n\nexport function getVgdHostBroker(): VgdHostBroker {\n  if (!defaultBroker) defaultBroker = new VgdHostBroker();\n  return defaultBroker;\n}\n\nexport function resetVgdHostBroker(): void {\n  defaultBroker = null;\n  clearHostSessionPool();\n}\n","/**\n * Semantic warm inside vgd (docs/VGD-SEMANTIC-WARM-SPEC.md).\n *\n * vgd already keeps the code map warm per repo-and-ref and local LLM weights\n * warm per path. The embedding model and the vector index were the gap: every\n * consumer — `vg lsp`, `vg code`, the CLI — loaded its own copy, so\n * `vg daemon status` could report a warm graph slot while the editor announced\n * \"warming semantic search\" on a fresh process, again.\n *\n * Two invariants shape everything here.\n *\n * **The addon lives in a child.** {@link EmbedBroker} never imports the\n * embedding backend; it talks NDJSON to `embed-worker.ts`. The backend can\n * abort its process (see `engine/embed-health.ts`) and no try/catch survives a\n * signal — so the worst case must be a dead worker vgd can restart, not a dead\n * daemon. A worker that dies repeatedly is given up on, and every caller falls\n * back to lexical exactly as it does when vgd is absent.\n *\n * **The index follows the graph slot.** Vectors are keyed by the same\n * `(repositoryId, gitRef)` slot key the graph uses, and the cache's eviction\n * hook drops them together. A branch switch selects a different index the same\n * moment it selects a different graph; a re-published graph invalidates the\n * vectors for exactly that slot and nothing else. Ranking against vectors that\n * belong to another ref would be a silent correctness bug, so the two are\n * never allowed to drift apart.\n */\nimport { spawn, type ChildProcess } from 'node:child_process';\nimport * as fs from 'node:fs';\nimport { fileURLToPath } from 'node:url';\nimport * as path from 'node:path';\nimport { activeGraphSlotKey } from '../git-ref.js';\nimport type { VgGraph, GraphNode } from '../../schema.js';\n\n/** How a slot's index is doing — surfaced by `embed-status` and the daemon log. */\nexport type SlotIndexState = 'absent' | 'building' | 'ready' | 'stale' | 'failed';\n\nexport interface SlotIndex {\n  repositoryId: string;\n  gitRef: string;\n  state: SlotIndexState;\n  /** nodeId → vector. Empty until the first build completes. */\n  vectors: Map<string, number[]>;\n  nodeCount: number;\n  builtAt?: number;\n  buildMs?: number;\n  error?: string;\n}\n\nexport interface SlotIndexSummary {\n  repositoryId: string;\n  gitRef: string;\n  state: SlotIndexState;\n  vectors: number;\n  nodeCount: number;\n  builtAt?: number;\n  buildMs?: number;\n  error?: string;\n}\n\nexport interface EmbedBrokerStatus {\n  /** Worker process state. */\n  worker: 'stopped' | 'starting' | 'ready' | 'unavailable';\n  pid?: number;\n  model?: string;\n  /** Consecutive worker deaths; at the cap the broker stops restarting. */\n  crashes: number;\n  reason?: string;\n  slots: SlotIndexSummary[];\n}\n\nexport type EmbedBrokerLog = (message: string) => void;\n\nexport interface EmbedBrokerOptions {\n  /** Diagnostic sink — the daemon's log. */\n  log?: EmbedBrokerLog;\n  /** Injected worker spawn (tests). */\n  spawnWorker?: () => ChildProcess;\n  /** Consecutive crashes tolerated before the broker gives up (default 3). */\n  maxCrashes?: number;\n  /** Per-request timeout in ms (default 120s — a cold model load is slow). */\n  requestTimeoutMs?: number;\n  /** Documents per embed request (default 256). */\n  batchSize?: number;\n  now?: () => number;\n}\n\ninterface Pending {\n  resolve: (vectors: number[][]) => void;\n  reject: (err: Error) => void;\n  timer: ReturnType<typeof setTimeout>;\n}\n\n/** The text an embedding represents for a node — mirrors the in-process indexer. */\nfunction nodeText(node: GraphNode): string {\n  const parts = [node.qualifiedName || node.name, node.kind, node.file, node.doc]\n    .filter((p): p is string => typeof p === 'string' && p.length > 0);\n  return parts.join(' · ').slice(0, 512);\n}\n\nexport class EmbedBroker {\n  private child: ChildProcess | null = null;\n  private starting = false;\n  private gaveUp = false;\n  private crashes = 0;\n  private reason: string | undefined;\n  private model: string | undefined;\n  private nextId = 1;\n  private buffer = '';\n  private readonly pending = new Map<number, Pending>();\n  private readonly indexes = new Map<string, SlotIndex>();\n  /** Slot keys with a build in flight, so warms are not duplicated. */\n  private readonly building = new Set<string>();\n  /** The slot most recently made current — logged on change. */\n  private currentKey: string | undefined;\n  private graphProvider?: (repositoryId: string, gitRef: string) => VgGraph | undefined;\n\n  private readonly log: EmbedBrokerLog;\n  private readonly spawnWorker: () => ChildProcess;\n  private readonly maxCrashes: number;\n  private readonly requestTimeoutMs: number;\n  private readonly batchSize: number;\n  private readonly now: () => number;\n\n  constructor(options: EmbedBrokerOptions = {}) {\n    this.log = options.log ?? ((): void => {});\n    this.spawnWorker = options.spawnWorker ?? defaultSpawnWorker;\n    this.maxCrashes = options.maxCrashes ?? 3;\n    this.requestTimeoutMs = options.requestTimeoutMs ?? 120_000;\n    this.batchSize = options.batchSize ?? 256;\n    this.now = options.now ?? ((): number => Date.now());\n  }\n\n  status(): EmbedBrokerStatus {\n    return {\n      worker: this.gaveUp ? 'unavailable' : this.child ? 'ready' : this.starting ? 'starting' : 'stopped',\n      pid: this.child?.pid,\n      model: this.model,\n      crashes: this.crashes,\n      reason: this.reason,\n      slots: this.listSlots(),\n    };\n  }\n\n  listSlots(repositoryId?: string): SlotIndexSummary[] {\n    const out: SlotIndexSummary[] = [];\n    for (const idx of this.indexes.values()) {\n      if (repositoryId && idx.repositoryId !== repositoryId) continue;\n      out.push({\n        repositoryId: idx.repositoryId,\n        gitRef: idx.gitRef,\n        state: idx.state,\n        vectors: idx.vectors.size,\n        nodeCount: idx.nodeCount,\n        builtAt: idx.builtAt,\n        buildMs: idx.buildMs,\n        error: idx.error,\n      });\n    }\n    return out.sort((a, b) => a.repositoryId.localeCompare(b.repositoryId) || a.gitRef.localeCompare(b.gitRef));\n  }\n\n  slot(repositoryId: string, gitRef: string): SlotIndex | undefined {\n    return this.indexes.get(activeGraphSlotKey(repositoryId, gitRef));\n  }\n\n  /** True once the broker has stopped trying — callers should go lexical. */\n  unavailable(): boolean {\n    return this.gaveUp;\n  }\n\n  /**\n   * A graph slot was published or replaced. The vectors for that slot no\n   * longer describe its graph, so they are dropped and a rebuild is queued.\n   * Called from the same funnel that stores the graph, so the two can never\n   * disagree about which ref they belong to.\n   */\n  onGraphPut(repositoryId: string, gitRef: string, graph: VgGraph): void {\n    const key = activeGraphSlotKey(repositoryId, gitRef);\n    const existing = this.indexes.get(key);\n    const nodeCount = graph.nodes?.length ?? 0;\n    if (existing && existing.state === 'ready') {\n      this.log(`semantic: ${repositoryId}@${gitRef} graph republished — index stale (${existing.vectors.size} vectors dropped)`);\n    }\n    this.indexes.set(key, {\n      repositoryId,\n      gitRef,\n      state: 'stale',\n      vectors: new Map(),\n      nodeCount,\n    });\n  }\n\n  /**\n   * Supplies the graph for a slot so a select can warm without the caller\n   * threading it through. Set by the daemon to read its own cache.\n   */\n  setGraphProvider(provider: (repositoryId: string, gitRef: string) => VgGraph | undefined): void {\n    this.graphProvider = provider;\n  }\n\n  /**\n   * A slot became current — a branch switch, a new repo, a fresh publish.\n   * The matching index is swapped in, and warmed in the background if it is\n   * not ready, so the first Ask after a switch is not the one that pays.\n   */\n  onGraphSelect(repositoryId: string, gitRef: string): void {\n    const key = activeGraphSlotKey(repositoryId, gitRef);\n    if (this.currentKey !== key) {\n      this.currentKey = key;\n      const idx = this.indexes.get(key);\n      this.log(\n        `semantic: current slot → ${repositoryId}@${gitRef} · index ${idx ? `${idx.state} (${idx.vectors.size} vectors)` : 'absent'}`,\n      );\n    }\n    if (this.gaveUp) return;\n    const idx = this.indexes.get(key);\n    if (idx?.state === 'ready' || this.building.has(key)) return;\n    const graph = this.graphProvider?.(repositoryId, gitRef);\n    if (!graph) return;\n    // Fire and forget: warming must never block the op that triggered it.\n    void this.ensureIndex(repositoryId, gitRef, graph);\n  }\n\n  /** A graph slot was evicted — its index goes with it, never outliving it. */\n  onGraphEvict(repositoryId: string, gitRef: string): void {\n    const key = activeGraphSlotKey(repositoryId, gitRef);\n    const idx = this.indexes.get(key);\n    if (!idx) return;\n    this.indexes.delete(key);\n    this.log(`semantic: ${repositoryId}@${gitRef} index evicted with its graph slot (${idx.vectors.size} vectors freed)`);\n  }\n\n  /** Drop everything (daemon shutdown / registry clear). */\n  clear(): void {\n    this.indexes.clear();\n    this.building.clear();\n  }\n\n  /**\n   * Ensure the slot has vectors, building them if needed. Resolves when the\n   * index is ready or has definitively failed; never throws.\n   */\n  async ensureIndex(repositoryId: string, gitRef: string, graph: VgGraph): Promise<SlotIndex> {\n    const key = activeGraphSlotKey(repositoryId, gitRef);\n    let idx = this.indexes.get(key);\n    if (!idx) {\n      idx = { repositoryId, gitRef, state: 'stale', vectors: new Map(), nodeCount: graph.nodes?.length ?? 0 };\n      this.indexes.set(key, idx);\n    }\n    if (idx.state === 'ready') return idx;\n    if (this.gaveUp) {\n      idx.state = 'failed';\n      idx.error = this.reason ?? 'embedding worker unavailable';\n      return idx;\n    }\n    if (this.building.has(key)) return idx;\n\n    this.building.add(key);\n    idx.state = 'building';\n    const nodes = (graph.nodes ?? []).filter((n) => !!n?.id);\n    const started = this.now();\n    this.log(`semantic: building index for ${repositoryId}@${gitRef} (${nodes.length} nodes)…`);\n\n    try {\n      const vectors = new Map<string, number[]>();\n      for (let i = 0; i < nodes.length; i += this.batchSize) {\n        const batch = nodes.slice(i, i + this.batchSize);\n        const out = await this.embed(batch.map((n) => nodeText(n)));\n        batch.forEach((n, j) => {\n          const v = out[j];\n          if (v) vectors.set(n.id, v);\n        });\n        // A slot evicted or republished mid-build must not be resurrected with\n        // vectors describing the graph it no longer has.\n        const live = this.indexes.get(key);\n        if (!live || live !== idx) {\n          this.log(`semantic: index build for ${repositoryId}@${gitRef} abandoned — slot changed underneath it`);\n          return idx;\n        }\n      }\n      idx.vectors = vectors;\n      idx.nodeCount = nodes.length;\n      idx.state = 'ready';\n      idx.builtAt = this.now();\n      idx.buildMs = idx.builtAt - started;\n      idx.error = undefined;\n      this.log(`semantic: index ready for ${repositoryId}@${gitRef} — ${vectors.size} vectors in ${idx.buildMs}ms`);\n    } catch (err) {\n      idx.state = 'failed';\n      idx.error = err instanceof Error ? err.message : String(err);\n      this.log(`semantic: index build failed for ${repositoryId}@${gitRef} — ${idx.error}; callers fall back to lexical`);\n    } finally {\n      this.building.delete(key);\n    }\n    return idx;\n  }\n\n  /** Embed one query string. Returns null when semantic is not available. */\n  async embedQuery(text: string): Promise<number[] | null> {\n    if (this.gaveUp) return null;\n    try {\n      const [vector] = await this.embed([text], true);\n      return vector ?? null;\n    } catch (err) {\n      this.log(`semantic: query embedding failed — ${err instanceof Error ? err.message : String(err)}; using lexical`);\n      return null;\n    }\n  }\n\n  /** Stop the worker (daemon shutdown). Safe to call when already stopped. */\n  stop(): void {\n    const child = this.child;\n    this.child = null;\n    this.starting = false;\n    for (const [, p] of this.pending) {\n      clearTimeout(p.timer);\n      p.reject(new Error('embedding worker stopped'));\n    }\n    this.pending.clear();\n    if (child) {\n      try {\n        child.kill();\n      } catch {\n        /* already gone */\n      }\n    }\n  }\n\n  // ── worker plumbing ────────────────────────────────────────────────────\n\n  private ensureWorker(): ChildProcess {\n    if (this.child) return this.child;\n    this.starting = true;\n    const child = this.spawnWorker();\n    this.child = child;\n    this.starting = false;\n    this.buffer = '';\n    this.log(`semantic: embedding worker started (pid ${child.pid ?? '?'})`);\n\n    child.stdout?.setEncoding('utf8');\n    child.stdout?.on('data', (chunk: string) => this.onData(chunk));\n    // The worker's stderr is diagnostic only; surface it so a failing backend\n    // is visible in the daemon log rather than silently swallowed.\n    child.stderr?.setEncoding('utf8');\n    child.stderr?.on('data', (chunk: string) => {\n      const text = String(chunk).trim();\n      if (text) this.log(`semantic worker: ${text.slice(0, 500)}`);\n    });\n    child.on('exit', (code, signal) => this.onExit(code, signal));\n    child.on('error', (err: Error) => {\n      this.log(`semantic: embedding worker could not start — ${err.message}`);\n      this.onExit(null, null);\n    });\n    return child;\n  }\n\n  private onData(chunk: string): void {\n    this.buffer += chunk;\n    let nl: number;\n    while ((nl = this.buffer.indexOf('\\n')) >= 0) {\n      const line = this.buffer.slice(0, nl).trim();\n      this.buffer = this.buffer.slice(nl + 1);\n      if (!line) continue;\n      let res: { id?: number; ok?: boolean; vectors?: number[][]; error?: string; model?: string };\n      try {\n        res = JSON.parse(line) as typeof res;\n      } catch {\n        continue; // a corrupt frame is not fatal to the stream\n      }\n      if (typeof res.model === 'string') this.model = res.model;\n      const id = res.id;\n      if (typeof id !== 'number') continue;\n      const p = this.pending.get(id);\n      if (!p) continue;\n      this.pending.delete(id);\n      clearTimeout(p.timer);\n      if (res.ok && Array.isArray(res.vectors)) p.resolve(res.vectors);\n      else p.reject(new Error(res.error || 'embedding worker returned no vectors'));\n    }\n  }\n\n  private onExit(code: number | null, signal: NodeJS.Signals | null): void {\n    const wasRunning = !!this.child;\n    this.child = null;\n    if (!wasRunning) return;\n\n    this.crashes++;\n    const how = signal ? `signal ${signal}` : `code ${code ?? 'null'}`;\n    // Fail every in-flight request rather than letting callers hang: each one\n    // has a lexical fallback waiting.\n    for (const [, p] of this.pending) {\n      clearTimeout(p.timer);\n      p.reject(new Error(`embedding worker exited (${how})`));\n    }\n    this.pending.clear();\n\n    if (this.crashes >= this.maxCrashes) {\n      this.gaveUp = true;\n      this.reason =\n        `the embedding worker exited (${how}) ${this.crashes} times — semantic search is off for this daemon; ` +\n        `everything falls back to lexical. A native backend that aborts like this is usually a blocked ` +\n        `onnxruntime-node postinstall (see \\`vg embed --where\\`).`;\n      this.log(`semantic: ${this.reason}`);\n      return;\n    }\n    this.log(`semantic: embedding worker exited (${how}) — restarting on next use (${this.crashes}/${this.maxCrashes})`);\n  }\n\n  private embed(texts: string[], query = false): Promise<number[][]> {\n    if (this.gaveUp) return Promise.reject(new Error(this.reason ?? 'embedding worker unavailable'));\n    if (!texts.length) return Promise.resolve([]);\n    let child: ChildProcess;\n    try {\n      child = this.ensureWorker();\n    } catch (err) {\n      // A worker that cannot even be spawned counts against the crash budget,\n      // so a permanently broken install settles into \"lexical\" instead of\n      // retrying (and re-logging) on every request.\n      const error = err instanceof Error ? err : new Error(String(err));\n      this.crashes++;\n      if (this.crashes >= this.maxCrashes) {\n        this.gaveUp = true;\n        this.reason = `the embedding worker could not start (${error.message}) — semantic search is off for this daemon`;\n        this.log(`semantic: ${this.reason}`);\n      } else {\n        this.log(`semantic: embedding worker could not start — ${error.message} (${this.crashes}/${this.maxCrashes})`);\n      }\n      return Promise.reject(error);\n    }\n    const id = this.nextId++;\n    return new Promise<number[][]>((resolve, reject) => {\n      const timer = setTimeout(() => {\n        this.pending.delete(id);\n        reject(new Error(`embedding request timed out after ${this.requestTimeoutMs}ms`));\n      }, this.requestTimeoutMs);\n      // Do not hold the daemon open on this timer.\n      (timer as unknown as { unref?: () => void }).unref?.();\n      this.pending.set(id, { resolve, reject, timer });\n      try {\n        child.stdin?.write(JSON.stringify({ id, op: 'embed', texts, query }) + '\\n');\n      } catch (err) {\n        this.pending.delete(id);\n        clearTimeout(timer);\n        reject(err instanceof Error ? err : new Error(String(err)));\n      }\n    });\n  }\n\n  /** A successful exchange clears the crash streak — used after a good build. */\n  noteHealthy(): void {\n    this.crashes = 0;\n  }\n}\n\n/**\n * Spawn the real worker: the compiled sibling entry (a tsup entry point, like\n * `parse-worker`), run by the same Node binary. Under a TS-only runner the\n * compiled file does not exist — the same situation `engine/pool.ts` handles —\n * so this throws rather than spawning something that cannot start, and the\n * broker reports the failure like any other and callers go lexical.\n */\nfunction defaultSpawnWorker(): ChildProcess {\n  const here = path.dirname(fileURLToPath(import.meta.url));\n  const entry = path.join(here, 'embed-worker-main.js');\n  if (!fs.existsSync(entry)) {\n    throw new Error(`embedding worker not found at ${entry} — semantic runs lexically`);\n  }\n  return spawn(process.execPath, [entry], {\n    stdio: ['pipe', 'pipe', 'pipe'],\n    // Never inherit loader flags or a debugger port: this child exists to be\n    // expendable, and anything that changes how it loads defeats the point.\n    env: { ...process.env, NODE_OPTIONS: '' },\n  });\n}\n","import * as fs from 'node:fs';\nimport * as net from 'node:net';\nimport * as path from 'node:path';\nimport { VGD_PROTOCOL_VERSION, parseRequest, type VgdResponse } from './protocol.js';\nimport { WorkspaceRegistry } from './registry.js';\nimport { vgdPidPath, vgdSocketPath } from './paths.js';\nimport { queryGraph } from '../../engine/query.js';\nimport { loadGraph } from '../../engine/load.js';\nimport { impactOf } from '../../engine/impact.js';\nimport { resolveOne } from '../../engine/lookup.js';\nimport { getVgdHostBroker, type VgdHostBroker } from './host-broker.js';\nimport { EmbedBroker } from './embed-broker.js';\nimport type { VgGraph } from '../../schema.js';\n\nexport interface VgdServerOptions {\n  /** Override socket path (tests). */\n  socketPath?: string;\n  /** Override PID path (tests). */\n  pidPath?: string;\n  registry?: WorkspaceRegistry;\n  now?: () => Date;\n  /** Process id recorded in status / pid file (tests). */\n  pid?: number;\n  /** Inject host broker (tests); default process-wide broker. */\n  hostBroker?: VgdHostBroker;\n  /** Inject the semantic broker (tests); default owns a worker child. */\n  embedBroker?: EmbedBroker;\n  /**\n   * Diagnostic sink. `vg daemon start` points this at stdout so the daemon's\n   * work — graph publishes, branch switches, index builds — is visible while\n   * it happens instead of being inferred after the fact.\n   */\n  log?: (message: string) => void;\n  /**\n   * Invoked (shortly after the reply is written) when a client sends the\n   * `shutdown` op. Only a standalone `vg daemon start` passes this — an\n   * in-process vgd (e.g. inside `vg code`) leaves it unset, and the op is\n   * refused so another process can never take down the owning session.\n   */\n  onShutdownRequest?: () => void;\n}\n\nexport interface VgdServer {\n  readonly socketPath: string;\n  readonly registry: WorkspaceRegistry;\n  /** Wall time when the server started listening. */\n  readonly startedAt: number;\n  close(): Promise<void>;\n}\n\n/**\n * Start a line-delimited JSON daemon on the local vgd socket.\n * Creates the daemon directory; removes a stale Unix socket file if present.\n */\nexport async function startVgdServer(options: VgdServerOptions = {}): Promise<VgdServer> {\n  const socketPath = options.socketPath ?? vgdSocketPath();\n  const pidPath = options.pidPath ?? vgdPidPath();\n  const registry = options.registry ?? new WorkspaceRegistry();\n  const hostBroker = options.hostBroker ?? getVgdHostBroker();\n  const log = options.log ?? ((): void => {});\n  // Semantic warm: the index is slot-scoped like the graph, so it attaches to\n  // the registry's lifecycle rather than being managed alongside it by hand.\n  const embedBroker = options.embedBroker ?? new EmbedBroker({ log });\n  embedBroker.setGraphProvider((repositoryId, gitRef) => registry.graphs.get(repositoryId, gitRef)?.graph);\n  registry.setSlotListener(embedBroker);\n  const onShutdownRequest = options.onShutdownRequest;\n  const now = options.now ?? (() => new Date());\n  const pid = options.pid ?? process.pid;\n  const startedAt = Date.now();\n\n  // Unix sockets need a free path; named pipes on Windows are cleaned by the OS.\n  if (!socketPath.startsWith('\\\\\\\\.\\\\pipe')) {\n    fs.mkdirSync(path.dirname(socketPath), { recursive: true });\n    try {\n      fs.unlinkSync(socketPath);\n    } catch {\n      /* nothing to remove */\n    }\n  } else {\n    fs.mkdirSync(path.dirname(pidPath), { recursive: true });\n  }\n\n  const server = net.createServer((socket) => {\n    let buffer = '';\n    socket.setEncoding('utf8');\n    socket.on('data', (chunk: string) => {\n      buffer += chunk;\n      let nl: number;\n      while ((nl = buffer.indexOf('\\n')) >= 0) {\n        const line = buffer.slice(0, nl).trim();\n        buffer = buffer.slice(nl + 1);\n        if (!line) continue;\n        void Promise.resolve(\n          handleLine(line, { registry, hostBroker, embedBroker, now, pid, startedAt, socketPath, onShutdownRequest, log }),\n        ).then(\n          (response) => {\n            socket.write(JSON.stringify(response) + '\\n');\n          },\n        );\n      }\n    });\n  });\n\n  await new Promise<void>((resolve, reject) => {\n    server.once('error', reject);\n    server.listen(socketPath, () => {\n      server.off('error', reject);\n      resolve();\n    });\n  });\n\n  try {\n    fs.mkdirSync(path.dirname(pidPath), { recursive: true });\n    fs.writeFileSync(pidPath, `${pid}\\n`, 'utf8');\n  } catch {\n    /* pid file is best-effort */\n  }\n\n  return {\n    socketPath,\n    registry,\n    startedAt,\n    async close() {\n      // The worker is a child of this process — never leave it orphaned.\n      embedBroker.stop();\n      await new Promise<void>((resolve) => server.close(() => resolve()));\n      try {\n        fs.unlinkSync(pidPath);\n      } catch {\n        /* gone */\n      }\n      if (!socketPath.startsWith('\\\\\\\\.\\\\pipe')) {\n        try {\n          fs.unlinkSync(socketPath);\n        } catch {\n          /* gone */\n        }\n      }\n    },\n  };\n}\n\nasync function handleLine(\n  line: string,\n  ctx: {\n    registry: WorkspaceRegistry;\n    hostBroker: VgdHostBroker;\n    embedBroker: EmbedBroker;\n    log: (message: string) => void;\n    now: () => Date;\n    pid: number;\n    startedAt: number;\n    socketPath: string;\n    onShutdownRequest?: () => void;\n  },\n): Promise<VgdResponse> {\n  const req = parseRequest(line);\n  if ('error' in req) return { ok: false, error: req.error, code: 'bad_request' };\n\n  switch (req.op) {\n    case 'ping':\n      return { ok: true, pong: true, version: VGD_PROTOCOL_VERSION };\n    case 'status':\n      return {\n        ok: true,\n        pid: ctx.pid,\n        uptimeMs: Date.now() - ctx.startedAt,\n        workspaces: ctx.registry.size(),\n        graphSlots: ctx.registry.graphs.size(),\n        version: VGD_PROTOCOL_VERSION,\n        socketPath: ctx.socketPath,\n      };\n    case 'shutdown': {\n      if (!ctx.onShutdownRequest) {\n        return {\n          ok: false,\n          error:\n            'this vgd is embedded in another process (e.g. vg code) and cannot be stopped remotely — stop the owning process instead',\n          code: 'shutdown_unsupported',\n        };\n      }\n      // Let the reply flush to the client before the listener goes away.\n      const hook = ctx.onShutdownRequest;\n      setTimeout(() => hook(), 150);\n      return { ok: true, stopping: true };\n    }\n    case 'embed-status':\n      return { ok: true, semantic: ctx.embedBroker.status() };\n    case 'embed-query': {\n      const vector = await ctx.embedBroker.embedQuery(req.text);\n      if (!vector) {\n        return {\n          ok: false,\n          error: 'semantic unavailable — rank lexically',\n          code: 'semantic_unavailable',\n        };\n      }\n      return { ok: true, vector, model: ctx.embedBroker.status().model };\n    }\n    case 'embed-index': {\n      const gitRef = req.gitRef ?? ctx.registry.graphs.selectedRef(req.repositoryId);\n      if (!gitRef) return { ok: false, error: 'no current gitRef for this repository', code: 'no_slot' };\n      const slot = ctx.registry.graphs.get(req.repositoryId, gitRef);\n      if (!slot) {\n        return { ok: false, error: `no graph slot for ${req.repositoryId}@${gitRef} — publish the map first`, code: 'no_slot' };\n      }\n      const idx = await ctx.embedBroker.ensureIndex(req.repositoryId, gitRef, slot.graph);\n      return {\n        ok: true,\n        indexed: true,\n        repositoryId: req.repositoryId,\n        gitRef,\n        state: idx.state,\n        vectors: idx.vectors.size,\n        buildMs: idx.buildMs,\n      };\n    }\n    case 'host-status':\n      return { ok: true, host: ctx.hostBroker.status() };\n    case 'host-load': {\n      const r = await ctx.hostBroker.load(req.modelPath);\n      if (!r.ok) return { ok: false, error: r.error, code: 'host_error' };\n      return { ok: true, hostLoaded: true, modelPath: r.modelPath };\n    }\n    case 'host-unload': {\n      const r = await ctx.hostBroker.unload(req.modelPath);\n      return { ok: true, hostUnloaded: true, cleared: r.cleared };\n    }\n    case 'host-generate': {\n      const r = await ctx.hostBroker.generate(\n        req.modelPath,\n        req.messages.map((m) => ({\n          role: (m.role === 'system' || m.role === 'assistant' ? m.role : 'user') as 'system' | 'user' | 'assistant',\n          content: m.content,\n        })),\n        {\n          grammar: req.grammar,\n          requireGrammar: req.requireGrammar,\n          maxTokens: req.maxTokens,\n          temperature: req.temperature,\n        },\n      );\n      if (!r.ok) return { ok: false, error: r.error, code: 'host_error' };\n      return {\n        ok: true,\n        hostGenerated: true,\n        text: r.result.text,\n        model: r.result.model,\n        constrained: r.result.constrained,\n        grammarApplied: r.result.grammarApplied,\n        draftAcceptedChars: r.result.draftAcceptedChars,\n        latencyMs: r.result.latencyMs,\n        unknownIdentifiers: r.result.unknownIdentifiers,\n      };\n    }\n    case 'list':\n      return { ok: true, workspaces: ctx.registry.list() };\n    case 'register': {\n      const known = ctx.registry.size();\n      const workspace = ctx.registry.register(req.root, ctx.now, { label: req.label, role: req.role });\n      // A repo the daemon has not seen before is the interesting case — that is\n      // when a warm daemon still has cold work to do.\n      if (ctx.registry.size() > known) {\n        ctx.log(`register: new workspace ${workspace.id} (${workspace.root}${workspace.gitRef ? ` @${workspace.gitRef}` : ''})`);\n      }\n      return { ok: true, workspace };\n    }\n    case 'unregister':\n      return { ok: true, removed: ctx.registry.unregister(req.root) };\n    case 'register-federation': {\n      const workspaces = ctx.registry.registerFederation(req.members, ctx.now);\n      return { ok: true, workspaces, federation: true };\n    }\n    case 'list-graph-slots': {\n      ctx.registry.graphs.evictIdle();\n      return { ok: true, slots: ctx.registry.graphs.list(req.repositoryId) };\n    }\n    case 'select-git-ref': {\n      const before = ctx.registry.graphs.selectedRef(req.repositoryId);\n      if (before !== req.gitRef) {\n        ctx.log(`select-git-ref: ${req.repositoryId} ${before ?? '(none)'} → ${req.gitRef}`);\n      }\n      ctx.registry.selectGitRef(req.repositoryId, req.gitRef);\n      return { ok: true, selected: true, repositoryId: req.repositoryId, gitRef: req.gitRef };\n    }\n    case 'put-graph': {\n      try {\n        // The wire line was already JSON.parse'd by parseRequest — re-encoding a\n        // large repo's graph (`parseGraph(JSON.stringify(...))`) blocked the\n        // daemon's event loop for seconds, timing out every concurrent client.\n        const graph = req.graph as VgGraph;\n        ctx.log(`put-graph: ${req.repositoryId}@${req.gitRef} · ${graph.nodes?.length ?? 0} nodes`);\n        ctx.registry.putGraph(req.repositoryId, req.gitRef, graph);\n        return {\n          ok: true,\n          stored: true,\n          repositoryId: req.repositoryId,\n          gitRef: req.gitRef,\n          nodeCount: graph.nodes?.length ?? 0,\n        };\n      } catch (e) {\n        return { ok: false, error: e instanceof Error ? e.message : 'invalid graph', code: 'bad_graph' };\n      }\n    }\n    case 'load-graph': {\n      // Load from disk inside the daemon: the snapshot-first loader decodes\n      // the binary sidecar (msgpack) when fresh — no multi-MB JSON line ever\n      // crosses the socket, which is what made put-graph publishes slow on\n      // large repos.\n      const record = ctx.registry.register(req.root, ctx.now, { gitRef: req.gitRef });\n      const gitRef = req.gitRef ?? record.gitRef ?? 'HEAD';\n      ctx.log(`load-graph: ${record.id}@${gitRef} from ${req.root}`);\n      const graph = loadGraph(req.root, req.graphPath);\n      if (!graph) {\n        return {\n          ok: false,\n          error: `no code map found for ${req.root} — run \\`vg build\\` (or bare \\`vg\\`) first`,\n          code: 'no_map',\n        };\n      }\n      ctx.registry.putGraph(record.id, gitRef, graph);\n      return {\n        ok: true,\n        stored: true,\n        repositoryId: record.id,\n        gitRef,\n        nodeCount: graph.nodes?.length ?? 0,\n      };\n    }\n    case 'query-graph': {\n      const resolved = ctx.registry.resolveGraph(req.repositoryId, req.gitRef);\n      if (!resolved) {\n        return { ok: false, error: 'no ActiveGraph loaded for repository — put-graph first', code: 'no_graph' };\n      }\n      const result = queryGraph(resolved.graph, req.query, { limit: req.limit ?? 12, budget: 2000 });\n      return {\n        ok: true,\n        query: req.query,\n        repositoryId: req.repositoryId,\n        gitRef: resolved.gitRef,\n        matches: result.matches.slice(0, req.limit ?? 12).map((m) => ({\n          id: m.node.id,\n          qualifiedName: m.node.qualifiedName,\n          kind: m.node.kind,\n          file: m.node.file,\n          line: m.node.span?.start ?? 0,\n          score: m.score,\n          why: m.why,\n        })),\n        tokensEstimate: result.tokensEstimate,\n      };\n    }\n    case 'impact-of': {\n      const resolved = ctx.registry.resolveGraph(req.repositoryId, req.gitRef);\n      if (!resolved) {\n        return { ok: false, error: 'no ActiveGraph loaded for repository — put-graph first', code: 'no_graph' };\n      }\n      const node = resolveSymbol(resolved.graph, req.symbol);\n      if (!node) {\n        return { ok: false, error: `symbol not found: ${req.symbol}`, code: 'not_found' };\n      }\n      const impact = impactOf(resolved.graph, node.id, { depth: req.depth ?? 4 });\n      return {\n        ok: true,\n        repositoryId: req.repositoryId,\n        gitRef: resolved.gitRef,\n        symbol: req.symbol,\n        root: impact.root,\n        depth: impact.depth,\n        affected: impact.affected.slice(0, 40).map((a) => ({\n          id: a.id,\n          name: a.name,\n          kind: a.kind,\n          file: a.file,\n          line: a.line,\n          depth: a.depth,\n          confidence: a.confidence,\n        })),\n        direct: impact.direct,\n        transitive: impact.transitive,\n      };\n    }\n    case 'graph-summary': {\n      const resolved = ctx.registry.resolveGraph(req.repositoryId, req.gitRef);\n      if (!resolved) {\n        return { ok: false, error: 'no ActiveGraph loaded for repository — put-graph first', code: 'no_graph' };\n      }\n      const g = resolved.graph;\n      return {\n        ok: true,\n        repositoryId: req.repositoryId,\n        gitRef: resolved.gitRef,\n        summary: {\n          nodeCount: g.nodes?.length ?? 0,\n          edgeCount: g.edges?.length ?? 0,\n          languages: g.meta?.languages ?? [],\n          corpusHash: g.provenance?.corpusHash ?? null,\n          root: g.meta?.root ?? null,\n        },\n      };\n    }\n  }\n}\n\nfunction resolveSymbol(graph: VgGraph, symbol: string): { id: string } | null {\n  // Prefer exact id, then qualified-name / short-name lookup.\n  if (graph.nodes.some((n) => n.id === symbol)) return { id: symbol };\n  const hit = resolveOne(graph, symbol);\n  if (hit.node?.id) return { id: hit.node.id };\n  if (hit.candidates.length === 1 && hit.candidates[0]?.id) return { id: hit.candidates[0].id };\n  const q = symbol.toLowerCase();\n  const byQn = graph.nodes.find((n) => n.qualifiedName?.toLowerCase() === q || n.name?.toLowerCase() === q);\n  return byQn ? { id: byQn.id } : null;\n}\n","/**\n * Branch-aware graph loading for a single repository worktree (Fusion §4.1.1).\n *\n * Combines {@link detectGitRef}, disk load via {@link loadGraph}, and an\n * {@link ActiveGraphCache} so checkout A → B → A reuses a warm in-memory map\n * when the branch is still resident (LILO idle eviction applies).\n */\n\nimport { loadGraph } from '../engine/load.js';\nimport { repositoryIdFromRoot } from './paths.js';\nimport { detectGitRef, type GitRunner } from './git-ref.js';\nimport { ActiveGraphCache } from './active-graph-cache.js';\nimport type { VgGraph } from '../schema.js';\n\nexport interface BranchGraphLoadResult {\n  graph: VgGraph | null;\n  gitRef: string;\n  kind: 'branch' | 'detached' | 'none';\n  /** True when the selected ActiveGraph slot changed since the previous ensure. */\n  switched: boolean;\n  /** True when the graph was served from the in-memory cache. */\n  fromCache: boolean;\n  repositoryId: string;\n}\n\nexport interface BranchGraphSessionOptions {\n  root: string;\n  cache?: ActiveGraphCache;\n  /** Optional explicit graph path (CLI `--graph`); bypasses branch keying for disk. */\n  graphPath?: string;\n  detectGit?: typeof detectGitRef;\n  load?: typeof loadGraph;\n  gitRun?: GitRunner;\n}\n\n/**\n * Stateful helper: call {@link ensureCurrent} at session start and before each\n * agent turn so a mid-session `git checkout` picks up the correct map.\n */\nexport class BranchGraphSession {\n  readonly root: string;\n  readonly repositoryId: string;\n  readonly cache: ActiveGraphCache;\n  private readonly graphPath?: string;\n  private readonly detectGit: typeof detectGitRef;\n  private readonly load: typeof loadGraph;\n  private readonly gitRun?: GitRunner;\n  private lastRef = '';\n\n  constructor(options: BranchGraphSessionOptions) {\n    this.root = options.root;\n    this.repositoryId = repositoryIdFromRoot(options.root);\n    this.cache = options.cache ?? new ActiveGraphCache();\n    this.graphPath = options.graphPath;\n    this.detectGit = options.detectGit ?? detectGitRef;\n    this.load = options.load ?? loadGraph;\n    this.gitRun = options.gitRun;\n  }\n\n  /**\n   * Resolve HEAD, activate the matching cache slot (or load from disk), and\n   * run idle eviction. Returns null graph when no map exists for this ref.\n   */\n  ensureCurrent(): BranchGraphLoadResult {\n    this.cache.evictIdle();\n    const info = this.gitRun ? this.detectGit(this.root, this.gitRun) : this.detectGit(this.root);\n    const gitRef = info.ref || 'unknown';\n    const switched = this.lastRef !== '' && this.lastRef !== gitRef;\n    this.lastRef = gitRef;\n\n    // Explicit --graph path: still track ref for cache identity but load that file.\n    if (this.graphPath) {\n      const graph = this.load(this.root, this.graphPath);\n      if (graph) {\n        this.cache.put(this.repositoryId, gitRef, graph);\n        this.cache.select(this.repositoryId, gitRef);\n      }\n      return {\n        graph,\n        gitRef,\n        kind: info.kind,\n        switched,\n        fromCache: false,\n        repositoryId: this.repositoryId,\n      };\n    }\n\n    const warm = this.cache.get(this.repositoryId, gitRef);\n    if (warm) {\n      this.cache.select(this.repositoryId, gitRef);\n      return {\n        graph: warm.graph,\n        gitRef,\n        kind: info.kind,\n        switched,\n        fromCache: true,\n        repositoryId: this.repositoryId,\n      };\n    }\n\n    const graph = this.load(this.root);\n    if (graph) {\n      this.cache.put(this.repositoryId, gitRef, graph);\n      this.cache.select(this.repositoryId, gitRef);\n    }\n    return {\n      graph,\n      gitRef,\n      kind: info.kind,\n      switched,\n      fromCache: false,\n      repositoryId: this.repositoryId,\n    };\n  }\n\n  /** Diagnostics for daemon status / tests. */\n  listSlots() {\n    return this.cache.list(this.repositoryId);\n  }\n}\n"]}

package/dist/{chunk-DIU3MXB3.js → chunk-537JBQVB.js}

@@ -1,5 +1,5 @@
-import { loadGraphFileWithSnapshot, resolveGraphPath } from './chunk-N4IDP2M2.js';
-import { cacheDir } from './chunk-AJ2KE3NT.js';
+import { loadGraphFileWithSnapshot, resolveGraphPath } from './chunk-7TOIESUT.js';
+import { cacheDir } from './chunk-RBMKBYGV.js';
 import { __require } from './chunk-Z6ZWNWWR.js';
 import * as fs from 'fs';
 import * as path from 'path';
@@ -199,5 +199,5 @@ function loadGraph(root, graphPath) {
 }
 
 export { SCHEMA_VERSION, loadGraph, loadGraphPreferIndex, writeGraphIndex };
-//# sourceMappingURL=chunk-DIU3MXB3.js.map
-//# sourceMappingURL=chunk-DIU3MXB3.js.map
+//# sourceMappingURL=chunk-537JBQVB.js.map
+//# sourceMappingURL=chunk-537JBQVB.js.map

package/dist/{chunk-DIU3MXB3.js.map → chunk-537JBQVB.js.map}

@@ -1 +1 @@
-{"version":3,"sources":["../src/schema.ts","../src/engine/index-db.ts","../src/engine/load.ts"],"names":[],"mappings":";;;;;;;AASO,IAAM,cAAA,GAAiB;;;AC2BvB,SAAS,YAAY,IAAA,EAAsB;AAChD,EAAA,OAAY,IAAA,CAAA,IAAA,CAAK,QAAA,CAAS,IAAI,CAAA,EAAG,UAAU,CAAA;AAC7C;AAGO,SAAS,eAAA,CAAgB,MAAc,KAAA,EAAkC;AAC9E,EAAA,MAAM,IAAA,GAAO,YAAY,IAAI,CAAA;AAC7B,EAAA,IAAI;AAEF,IAAA,MAAM,EAAE,YAAA,EAAa,GAAI,SAAA,CAAQ,QAAa,CAAA;AAC9C,IAAG,aAAe,IAAA,CAAA,OAAA,CAAQ,IAAI,GAAG,EAAE,SAAA,EAAW,MAAM,CAAA;AACpD,IAAA,MAAM,GAAA,GAAM,CAAA,EAAG,IAAI,CAAA,CAAA,EAAI,QAAQ,GAAG,CAAA,IAAA,CAAA;AAClC,IAAA,IAAI;AACF,MAAA,IAAO,EAAA,CAAA,UAAA,CAAW,GAAG,CAAA,EAAM,cAAW,GAAG,CAAA;AAAA,IAC3C,CAAA,CAAA,MAAQ;AAAA,IAER;AAEA,IAAA,MAAM,EAAA,GAAK,IAAI,YAAA,CAAa,GAAG,CAAA;AAC/B,IAAA,EAAA,CAAG,IAAA,CAAK;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,IAAA,CAwCP,CAAA;AAED,IAAA,MAAM,OAAA,GAAU,EAAA,CAAG,OAAA,CAAQ,4CAA4C,CAAA;AACvE,IAAA,OAAA,CAAQ,GAAA,CAAI,YAAA,EAAc,KAAA,CAAM,UAAA,CAAW,UAAU,CAAA;AACrD,IAAA,OAAA,CAAQ,GAAA,CAAI,eAAA,EAAiB,KAAA,CAAM,aAAa,CAAA;AAChD,IAAA,OAAA,CAAQ,GAAA,CAAI,aAAA,EAAe,KAAA,CAAM,WAAW,CAAA;AAC5C,IAAA,OAAA,CAAQ,IAAI,WAAA,EAAa,MAAA,CAAO,KAAA,CAAM,KAAA,CAAM,MAAM,CAAC,CAAA;AACnD,IAAA,OAAA,CAAQ,IAAI,WAAA,EAAa,MAAA,CAAO,KAAA,CAAM,KAAA,CAAM,MAAM,CAAC,CAAA;AACnD,IAAA,OAAA,CAAQ,GAAA,CAAI,cAAA,EAAgB,KAAA,CAAM,IAAA,CAAK,gBAAgB,MAAM,CAAA;AAC7D,IAAA,OAAA,CAAQ,GAAA,CAAI,gBAAgB,kBAAkB,CAAA;AAE9C,IAAA,OAAA,CAAQ,IAAI,WAAA,EAAa,IAAA,CAAK,SAAA,CAAU,KAAA,CAAM,IAAI,CAAC,CAAA;AACnD,IAAA,OAAA,CAAQ,IAAI,iBAAA,EAAmB,IAAA,CAAK,SAAA,CAAU,KAAA,CAAM,UAAU,CAAC,CAAA;AAC/D,IAAA,IAAI,KAAA,CAAM,OAAO,OAAA,CAAQ,GAAA,CAAI,aAAa,IAAA,CAAK,SAAA,CAAU,KAAA,CAAM,KAAK,CAAC,CAAA;AACrE,IAAA,IAAI,KAAA,CAAM,WAAW,OAAA,CAAQ,GAAA,CAAI,iBAAiB,IAAA,CAAK,SAAA,CAAU,KAAA,CAAM,SAAS,CAAC,CAAA;AACjF,IAAA,IAAI,KAAA,CAAM,WAAW,OAAA,CAAQ,GAAA,CAAI,iBAAiB,IAAA,CAAK,SAAA,CAAU,KAAA,CAAM,SAAS,CAAC,CAAA;AACjF,IAAA,IAAI,KAAA,CAAM,UAAU,OAAA,CAAQ,GAAA,CAAI,gBAAgB,IAAA,CAAK,SAAA,CAAU,KAAA,CAAM,QAAQ,CAAC,CAAA;AAE9E,IAAA,MAAM,UAAU,EAAA,CAAG,OAAA;AAAA,MACjB,CAAA;AAAA,+CAAA;AAAA,KAEF;AACA,IAAA,KAAA,MAAW,CAAA,IAAK,MAAM,KAAA,EAAO;AAC3B,MAAA,OAAA,CAAQ,GAAA;AAAA,QACN,CAAA,CAAE,EAAA;AAAA,QACF,CAAA,CAAE,IAAA;AAAA,QACF,CAAA,CAAE,aAAA;AAAA,QACF,CAAA,CAAE,IAAA;AAAA,QACF,CAAA,CAAE,IAAA;AAAA,QACF,EAAE,IAAA,CAAK,KAAA;AAAA,QACP,CAAA,CAAE,UAAA;AAAA,QACF,CAAA,CAAE,IAAA;AAAA,QACF,CAAA,CAAE,QAAQ,CAAA,GAAI,CAAA;AAAA,QACd,CAAA,CAAE,IAAA;AAAA,QACF,IAAA,CAAK,UAAU,CAAC;AAAA,OAClB;AAAA,IACF;AAEA,IAAA,MAAM,UAAU,EAAA,CAAG,OAAA;AAAA,MACjB,CAAA;AAAA,sCAAA;AAAA,KAEF;AACA,IAAA,KAAA,MAAW,CAAA,IAAK,MAAM,KAAA,EAAO;AAC3B,MAAA,OAAA,CAAQ,GAAA;AAAA,QACN,CAAA,CAAE,EAAA;AAAA,QACF,CAAA,CAAE,IAAA;AAAA,QACF,CAAA,CAAE,GAAA;AAAA,QACF,CAAA,CAAE,GAAA;AAAA,QACF,CAAA,CAAE,UAAA;AAAA,QACF,CAAA,CAAE,UAAA;AAAA,QACF,EAAE,SAAA,IAAa,UAAA;AAAA,QACf,IAAA,CAAK,UAAU,CAAC;AAAA,OAClB;AAAA,IACF;AAEA,IAAA,MAAM,OAAA,GAAU,EAAA,CAAG,OAAA,CAAQ,2CAA2C,CAAA;AACtE,IAAA,KAAA,MAAW,CAAA,IAAK,MAAM,KAAA,EAAO;AAC3B,MAAA,OAAA,CAAQ,IAAI,CAAA,CAAE,EAAA,EAAI,IAAA,CAAK,SAAA,CAAU,CAAC,CAAC,CAAA;AAAA,IACrC;AAEA,IAAA,EAAA,CAAG,KAAA,EAAM;AACT,IAAG,EAAA,CAAA,UAAA,CAAW,KAAK,IAAI,CAAA;AACvB,IAAA,OAAO,EAAE,IAAA,EAAM,IAAA,EAAM,KAAA,EAAO,KAAA,CAAM,KAAA,CAAM,MAAA,EAAQ,KAAA,EAAO,KAAA,CAAM,KAAA,CAAM,MAAA,EAAQ,EAAA,EAAI,IAAA,EAAK;AAAA,EACtF,SAAS,GAAA,EAAK;AACZ,IAAA,OAAO;AAAA,MACL,IAAA,EAAM,IAAA;AAAA,MACN,KAAA,EAAO,CAAA;AAAA,MACP,KAAA,EAAO,CAAA;AAAA,MACP,EAAA,EAAI,KAAA;AAAA,MACJ,QAAS,GAAA,CAAc;AAAA,KACzB;AAAA,EACF;AACF;AAoHO,SAAS,mBAAmB,IAAA,EAA8B;AAC/D,EAAA,MAAM,IAAA,GAAO,YAAY,IAAI,CAAA;AAC7B,EAAA,IAAI,CAAI,EAAA,CAAA,UAAA,CAAW,IAAI,CAAA,EAAG,OAAO,IAAA;AACjC,EAAA,IAAI;AAEF,IAAA,MAAM,EAAE,YAAA,EAAa,GAAI,SAAA,CAAQ,QAAa,CAAA;AAC9C,IAAA,MAAM,KAAK,IAAI,YAAA,CAAa,MAAM,EAAE,QAAA,EAAU,MAAM,CAAA;AACpD,IAAA,MAAM,QAAA,GAAW,EAAA,CAAG,OAAA,CAAQ,6BAA6B,EAAE,GAAA,EAAI;AAI/D,IAAA,MAAM,OAA+B,EAAC;AACtC,IAAA,KAAA,MAAW,KAAK,QAAA,EAAU,IAAA,CAAK,CAAA,CAAE,GAAG,IAAI,CAAA,CAAE,KAAA;AAE1C,IAAA,IAAI,IAAA,CAAK,iBAAiB,kBAAA,IAAsB,CAAC,KAAK,SAAA,IAAa,CAAC,KAAK,eAAA,EAAiB;AACxF,MAAA,EAAA,CAAG,KAAA,EAAM;AACT,MAAA,OAAO,IAAA;AAAA,IACT;AAEA,IAAA,MAAM,QAAA,GAAW,EAAA,CAAG,OAAA,CAAQ,oCAAoC,EAAE,GAAA,EAAI;AAGtE,IAAA,MAAM,QAAA,GAAW,EAAA,CAAG,OAAA,CAAQ,oCAAoC,EAAE,GAAA,EAAI;AAGtE,IAAA,MAAM,QAAA,GAAW,EAAA,CAAG,OAAA,CAAQ,oCAAoC,EAAE,GAAA,EAAI;AAGtE,IAAA,EAAA,CAAG,KAAA,EAAM;AAET,IAAA,MAAM,KAAA,GAAQ,SAAS,GAAA,CAAI,CAAC,MAAM,IAAA,CAAK,KAAA,CAAM,CAAA,CAAE,IAAI,CAAc,CAAA;AACjE,IAAA,MAAM,KAAA,GAAQ,SAAS,GAAA,CAAI,CAAC,MAAM,IAAA,CAAK,KAAA,CAAM,CAAA,CAAE,IAAI,CAAc,CAAA;AACjE,IAAA,MAAM,KAAA,GAAQ,SAAS,GAAA,CAAI,CAAC,MAAM,IAAA,CAAK,KAAA,CAAM,CAAA,CAAE,IAAI,CAAS,CAAA;AAG5D,IAAA,KAAA,CAAM,IAAA,CAAK,CAAC,CAAA,EAAG,CAAA,KAAM,EAAE,EAAA,CAAG,aAAA,CAAc,CAAA,CAAE,EAAE,CAAC,CAAA;AAC7C,IAAA,KAAA,CAAM,IAAA;AAAA,MACJ,CAAC,CAAA,EAAG,CAAA,KACF,EAAE,IAAA,CAAK,aAAA,CAAc,EAAE,IAAI,CAAA,IAAK,EAAE,GAAA,CAAI,aAAA,CAAc,EAAE,GAAG,CAAA,IAAK,EAAE,GAAA,CAAI,aAAA,CAAc,EAAE,GAAG;AAAA,KAC3F;AACA,IAAA,KAAA,CAAM,KAAK,CAAC,CAAA,EAAG,MAAM,CAAA,CAAE,EAAA,GAAK,EAAE,EAAE,CAAA;AAEhC,IAAA,MAAM,KAAA,GAAiB;AAAA,MACrB,aAAA,EAAgB,KAAK,aAAA,IAA2C,cAAA;AAAA,MAChE,aAAa,IAAA,CAAK,WAAA,IAAA,qBAAmB,IAAA,CAAK,CAAC,GAAE,WAAA,EAAY;AAAA,MACzD,UAAA,EAAY,IAAA,CAAK,KAAA,CAAM,IAAA,CAAK,eAAe,CAAA;AAAA,MAC3C,IAAA,EAAM,IAAA,CAAK,KAAA,CAAM,IAAA,CAAK,SAAS,CAAA;AAAA,MAC/B,KAAA;AAAA,MACA,KAAA;AAAA,MACA;AAAA,KACF;AACA,IAAA,IAAI,KAAK,SAAA,EAAW,KAAA,CAAM,QAAQ,IAAA,CAAK,KAAA,CAAM,KAAK,SAAS,CAAA;AAC3D,IAAA,IAAI,KAAK,aAAA,EAAe,KAAA,CAAM,YAAY,IAAA,CAAK,KAAA,CAAM,KAAK,aAAa,CAAA;AACvE,IAAA,IAAI,KAAK,aAAA,EAAe,KAAA,CAAM,YAAY,IAAA,CAAK,KAAA,CAAM,KAAK,aAAa,CAAA;AACvE,IAAA,IAAI,KAAK,YAAA,EAAc,KAAA,CAAM,WAAW,IAAA,CAAK,KAAA,CAAM,KAAK,YAAY,CAAA;AAGpE,IAAA,KAAA,MAAW,KAAK,KAAA,EAAO;AACrB,MAAA,IAAI,CAAC,CAAA,CAAE,UAAA,EAAY,CAAA,CAAE,UAAA,GAAa,WAAA;AAClC,MAAA,IAAI,CAAC,CAAA,CAAE,SAAA,EAAW,CAAA,CAAE,SAAA,GAAY,UAAA;AAAA,IAClC;AACA,IAAA,OAAO,KAAA;AAAA,EACT,CAAA,CAAA,MAAQ;AACN,IAAA,OAAO,IAAA;AAAA,EACT;AACF;AAOO,SAAS,oBAAA,CACd,MACA,aAAA,EACqD;AAIrD,EAAA,MAAM,SAAA,GAA4B,0BAA0B,aAAa,CAAA;AAEzE,EAAA,MAAM,SAAA,GAAY,mBAAmB,IAAI,CAAA;AACzC,EAAA,IAAI,SAAA,EAAW;AACb,IAAA,IAAI,CAAC,SAAA,IAAa,SAAA,CAAU,WAAW,UAAA,KAAe,SAAA,CAAU,WAAW,UAAA,EAAY;AACrF,MAAA,OAAO,EAAE,KAAA,EAAO,SAAA,EAAW,MAAA,EAAQ,OAAA,EAAQ;AAAA,IAC7C;AAAA,EAEF;AACA,EAAA,IAAI,WAAW,OAAO,EAAE,KAAA,EAAO,SAAA,EAAW,QAAQ,MAAA,EAAO;AACzD,EAAA,OAAO,IAAA;AACT;;;ACvWO,SAAS,SAAA,CAAU,MAAc,SAAA,EAAoC;AAC1E,EAAA,MAAM,IAAA,GAAO,gBAAA,CAAiB,IAAA,EAAM,SAAS,CAAA;AAG7C,EAAA,IAAI,CAAC,SAAA,EAAW;AACd,IAAA,MAAM,SAAA,GAAY,oBAAA,CAAqB,IAAA,EAAM,IAAI,CAAA;AACjD,IAAA,IAAI,SAAA,SAAkB,SAAA,CAAU,KAAA;AAAA,EAClC;AACA,EAAA,OAAO,0BAA0B,IAAI,CAAA;AACvC","file":"chunk-DIU3MXB3.js","sourcesContent":["/**\n * The `vg-graph/1.0` on-disk schema.\n *\n * This is vg's own open schema (VG-PACKAGE-AND-SCHEMA.md §4) — informed by good\n * ideas (content-hashed ids, epistemic typing of facts) but standalone and\n * self-contained. Every collection is deterministically serialized\n * (sorted keys, stable element order). These TypeScript shapes are normative.\n */\n\nexport const SCHEMA_VERSION = 'vg-graph/1.0' as const;\n\nexport type ResolverKind = 'scip' | 'stackgraph' | 'tsc' | 'heuristic';\n\n/** Coarse, honest resolution tier for an edge (see engine/epistemic.ts). */\nexport type EpistemicTier = 'observed' | 'name-matched' | 'declared';\n\n/**\n * The toolchain that produced this graph — the reproducibility fingerprint.\n * Everything here deterministically affects graph *content* (parse trees change\n * between grammar releases; resolvers change which edges resolve), so a CI run\n * and a laptop run that disagree can be caught by comparing `fingerprint`.\n * Deliberately excludes the Node/OS version so the graph stays byte-stable\n * across host runtimes; `fingerprint` pins the parse/resolve toolchain only.\n */\nexport interface Toolchain {\n  schema: string; // SCHEMA_VERSION\n  tool: string; // vg calendar version\n  grammars: string; // tree-sitter grammar set version string\n  resolvers: ResolverKind[]; // resolver kinds available, sorted\n  fingerprint: string; // shortId over the fields above — the value `vg attest` signs\n}\n\nexport interface Provenance {\n  tool: 'vg';\n  version: string; // calendar version\n  grammars: Record<string, string>; // lang → grammar version (determinism input)\n  resolver: ResolverKind[];\n  deep: boolean; // did the heavier open passes run\n  semanticModel?: string; // embedding model id+version if --deep semantic links\n  corpusHash: string; // blake3 over the included file set + hashes\n  toolchain?: Toolchain; // reproducibility fingerprint (checked by `vg verify`)\n}\n\n/** Analysis cost tier — auto-selected by node count (or forced). Reported honestly. */\nexport type AnalysisTier = 'full' | 'large' | 'xl';\n\nexport interface GraphMeta {\n  root: string; // relative; portable across machines\n  languages: string[];\n  counts: {\n    nodes: number;\n    edges: number;\n    areas: number;\n    tests: number;\n    untested: number;\n  };\n  cluster: 'leiden' | 'louvain' | 'none';\n  /** Auto-selected (or forced) analysis tier for large maps. */\n  analysisTier?: AnalysisTier;\n  edgeKinds: EdgeKind[];\n}\n\nexport type NodeKind =\n  | 'file'\n  | 'module'\n  | 'package'\n  | 'class'\n  | 'interface'\n  | 'function'\n  | 'method'\n  | 'property'\n  | 'test'\n  | 'route'\n  | 'component'\n  /** Documentation / config text ingested for semantic ask (markdown, txt, env examples). */\n  | 'document'\n  | 'external';\n\nexport interface Span {\n  start: number; // 1-based start line\n  end: number; // 1-based end line\n}\n\nexport interface Centrality {\n  degree: number;\n  pagerank: number;\n  betweenness: number;\n  eigenvector: number;\n}\n\nexport interface GraphNode {\n  id: string; // blake3(canonical(kind, qualifiedName, file, signature))\n  kind: NodeKind;\n  name: string; // short name\n  qualifiedName: string;\n  file: string; // relative path\n  span: Span; // line range (excluded from id hash)\n  lang: string;\n  visibility?: 'public' | 'private' | 'protected' | 'internal';\n  signature?: string;\n  doc?: string; // short leading doc-comment / docstring summary (deterministic; not a full body)\n  importance: number; // 0..1 blended centrality\n  centrality: Centrality;\n  area: number; // area id (the node's community); -1 = unassigned (cluster \"none\")\n  isHub: boolean; // centrality outlier — surfaced by `vg hubs`\n  tested: boolean | null; // null = not analyzable (e.g. external)\n  coverage?: number; // 0..1 line coverage if a coverage report was ingested\n  changeCoupling?: string[]; // node ids that historically change together\n}\n\nexport type EdgeKind =\n  | 'call'\n  | 'import'\n  | 'contains'\n  | 'extends'\n  | 'implements'\n  | 'references'\n  | 'test'\n  | 'coverage';\n\nexport interface GraphEdge {\n  id: string; // blake3(canonical(kind, src, dst))\n  kind: EdgeKind;\n  src: string; // node id\n  dst: string; // node id\n  resolution: ResolverKind; // how the edge was resolved\n  confidence: number; // 0..1 (1.0 for scip/declared; lower for heuristic/dynamic)\n  epistemic?: EpistemicTier; // coarse honesty tier derived from resolution+kind\n  surprise?: number; // 0..1 improbability under the area model (`vg oddities`)\n  count?: number; // call-site multiplicity\n}\n\nexport interface Area {\n  id: number; // stable across runs (remapped to previous committed map)\n  label: string; // most-central member's name (editable via `vg label`)\n  size: number;\n  members: string[]; // node ids, sorted\n  cohesion: number; // 0..1\n  externalEdges: number; // cross-area edge count\n}\n\nexport type FactKind = 'contract' | 'invariant' | 'characterization';\nexport type DerivedBy = 'declared' | 'static';\nexport type FactConfidence = 'Observed' | 'Derived';\n\nexport interface Fact {\n  id: string; // blake3(canonical(kind, subjectIds, predicate))\n  kind: FactKind;\n  subjectIds: string[]; // node ids this fact constrains\n  predicate: unknown; // the constraint\n  derivedBy: DerivedBy;\n  confidence: FactConfidence;\n  evidence: { file: string; span: Span }[];\n}\n\n/**\n * A reference the graph could not resolve — surfaced by `vg unknowns`. Reporting\n * what it *cannot* connect (ranked by blast radius) is the honest inverse of a\n * scanner that hides its unknowns. Only unknowns the precise rungs (tsc/scip)\n * did not supersede are recorded, so a compiler-resolved file never shows here.\n */\nexport interface Unknown {\n  from: string; // node id where the unresolved reference occurs\n  name: string; // the callee/type name that could not be resolved\n  kind: 'call' | 'extends' | 'implements';\n  count: number; // occurrences at this site\n}\n\nexport type GroundingKind = 'should_follow' | 'smells_like' | 'relevant_to';\n\nexport interface GroundingEdge {\n  src: string; // node id\n  packEntryId: string;\n  kind: GroundingKind;\n  confidence: number; // 0..1\n  rationale: 'recommended' | 'conjectured';\n  citation: { title: string; url: string };\n}\n\n/** Precomputed hub blast-radius counts for fast agent answers (optional). */\nexport interface HubBlastSummary {\n  id: string;\n  name: string;\n  kind: string;\n  file: string;\n  importance: number;\n  direct: number;\n  depth2: number;\n  files: number;\n  tested: boolean | null;\n}\n\nexport interface GraphSummaries {\n  hubs: HubBlastSummary[];\n}\n\nexport interface VgGraph {\n  schemaVersion: typeof SCHEMA_VERSION;\n  generatedAt: string; // ISO; the ONLY nondeterministic field (pinned by --generated-at)\n  provenance: Provenance;\n  meta: GraphMeta;\n  nodes: GraphNode[]; // sorted by id\n  edges: GraphEdge[]; // sorted by (kind, src, dst)\n  areas: Area[]; // sorted by id\n  facts?: Fact[]; // open facts (contract/invariant/characterization); sorted by id\n  grounding?: GroundingEdge[]; // free-pack grounding (default on; omit with --no-ground)\n  unknowns?: Unknown[]; // heuristic references left unresolved; sorted by (from, kind, name)\n  /** Build-time hub blast-radius summaries (always on; tiny). */\n  summaries?: GraphSummaries;\n}\n","/**\n * SQLite serve index for large maps (scale past flat-JSON-only serve).\n *\n * The canonical artifact remains `graph.json` (determinism / git). The index\n * at `.vibgrate/cache/graph.db` is a derived, gitignored structure built after\n * every successful build:\n *   - denormalized name/edge columns for O(log n) lookup\n *   - full node/edge/area JSON for reconstructing a `VgGraph` without parsing\n *     the pretty-printed graph.json (faster cold serve on XL maps)\n *\n * Uses Node's built-in `node:sqlite` (Node ≥22) — no native npm dependency.\n */\n\nimport * as fs from 'node:fs';\nimport * as path from 'node:path';\nimport { cacheDir } from './cache.js';\nimport { loadGraphFileWithSnapshot } from './snapshot.js';\nimport type {\n  Area,\n  EpistemicTier,\n  GraphEdge,\n  GraphNode,\n  ResolverKind,\n  VgGraph,\n} from '../schema.js';\nimport { SCHEMA_VERSION } from '../schema.js';\n\nexport interface IndexWriteResult {\n  path: string;\n  nodes: number;\n  edges: number;\n  /** False when node:sqlite is unavailable — callers should not fail the build. */\n  ok: boolean;\n  reason?: string;\n}\n\nexport function indexDbPath(root: string): string {\n  return path.join(cacheDir(root), 'graph.db');\n}\n\n/** Write (replace) the SQLite index from a built graph. Never throws to callers. */\nexport function writeGraphIndex(root: string, graph: VgGraph): IndexWriteResult {\n  const file = indexDbPath(root);\n  try {\n    // eslint-disable-next-line @typescript-eslint/no-require-imports\n    const { DatabaseSync } = require('node:sqlite') as typeof import('node:sqlite');\n    fs.mkdirSync(path.dirname(file), { recursive: true });\n    const tmp = `${file}.${process.pid}.tmp`;\n    try {\n      if (fs.existsSync(tmp)) fs.unlinkSync(tmp);\n    } catch {\n      /* ignore */\n    }\n\n    const db = new DatabaseSync(tmp);\n    db.exec(`\n      PRAGMA journal_mode = OFF;\n      PRAGMA synchronous = OFF;\n      CREATE TABLE meta (\n        key TEXT PRIMARY KEY,\n        value TEXT NOT NULL\n      );\n      CREATE TABLE nodes (\n        id TEXT PRIMARY KEY,\n        name TEXT NOT NULL,\n        qualified_name TEXT NOT NULL,\n        kind TEXT NOT NULL,\n        file TEXT NOT NULL,\n        line INTEGER NOT NULL,\n        importance REAL NOT NULL,\n        area INTEGER NOT NULL,\n        is_hub INTEGER NOT NULL,\n        lang TEXT NOT NULL,\n        json TEXT NOT NULL\n      );\n      CREATE TABLE edges (\n        id TEXT PRIMARY KEY,\n        kind TEXT NOT NULL,\n        src TEXT NOT NULL,\n        dst TEXT NOT NULL,\n        resolution TEXT NOT NULL,\n        confidence REAL NOT NULL,\n        epistemic TEXT NOT NULL,\n        json TEXT NOT NULL\n      );\n      CREATE TABLE areas (\n        id INTEGER PRIMARY KEY,\n        json TEXT NOT NULL\n      );\n      CREATE INDEX idx_nodes_name ON nodes(name);\n      CREATE INDEX idx_nodes_qn ON nodes(qualified_name);\n      CREATE INDEX idx_nodes_file ON nodes(file);\n      CREATE INDEX idx_edges_src ON edges(src);\n      CREATE INDEX idx_edges_dst ON edges(dst);\n      CREATE INDEX idx_edges_kind ON edges(kind);\n    `);\n\n    const insMeta = db.prepare('INSERT INTO meta(key, value) VALUES (?, ?)');\n    insMeta.run('corpusHash', graph.provenance.corpusHash);\n    insMeta.run('schemaVersion', graph.schemaVersion);\n    insMeta.run('generatedAt', graph.generatedAt);\n    insMeta.run('nodeCount', String(graph.nodes.length));\n    insMeta.run('edgeCount', String(graph.edges.length));\n    insMeta.run('analysisTier', graph.meta.analysisTier ?? 'full');\n    insMeta.run('indexVersion', 'vg-graph-index/2');\n    // Full meta + provenance for reconstruct without graph.json parse.\n    insMeta.run('graphMeta', JSON.stringify(graph.meta));\n    insMeta.run('graphProvenance', JSON.stringify(graph.provenance));\n    if (graph.facts) insMeta.run('factsJson', JSON.stringify(graph.facts));\n    if (graph.grounding) insMeta.run('groundingJson', JSON.stringify(graph.grounding));\n    if (graph.summaries) insMeta.run('summariesJson', JSON.stringify(graph.summaries));\n    if (graph.unknowns) insMeta.run('unknownsJson', JSON.stringify(graph.unknowns));\n\n    const insNode = db.prepare(\n      `INSERT INTO nodes(id, name, qualified_name, kind, file, line, importance, area, is_hub, lang, json)\n       VALUES (?, ?, ?, ?, ?, ?, ?, ?, ?, ?, ?)`,\n    );\n    for (const n of graph.nodes) {\n      insNode.run(\n        n.id,\n        n.name,\n        n.qualifiedName,\n        n.kind,\n        n.file,\n        n.span.start,\n        n.importance,\n        n.area,\n        n.isHub ? 1 : 0,\n        n.lang,\n        JSON.stringify(n),\n      );\n    }\n\n    const insEdge = db.prepare(\n      `INSERT INTO edges(id, kind, src, dst, resolution, confidence, epistemic, json)\n       VALUES (?, ?, ?, ?, ?, ?, ?, ?)`,\n    );\n    for (const e of graph.edges) {\n      insEdge.run(\n        e.id,\n        e.kind,\n        e.src,\n        e.dst,\n        e.resolution,\n        e.confidence,\n        e.epistemic ?? 'observed',\n        JSON.stringify(e),\n      );\n    }\n\n    const insArea = db.prepare('INSERT INTO areas(id, json) VALUES (?, ?)');\n    for (const a of graph.areas) {\n      insArea.run(a.id, JSON.stringify(a));\n    }\n\n    db.close();\n    fs.renameSync(tmp, file);\n    return { path: file, nodes: graph.nodes.length, edges: graph.edges.length, ok: true };\n  } catch (err) {\n    return {\n      path: file,\n      nodes: 0,\n      edges: 0,\n      ok: false,\n      reason: (err as Error).message,\n    };\n  }\n}\n\nexport interface NameHit {\n  id: string;\n  name: string;\n  qualifiedName: string;\n  kind: string;\n  file: string;\n  line: number;\n  importance: number;\n}\n\n/** Fast name / prefix lookup against the index. Empty if index missing. */\nexport function lookupNameIndex(root: string, query: string, limit = 20): NameHit[] {\n  const file = indexDbPath(root);\n  if (!fs.existsSync(file) || !query.trim()) return [];\n  try {\n    // eslint-disable-next-line @typescript-eslint/no-require-imports\n    const { DatabaseSync } = require('node:sqlite') as typeof import('node:sqlite');\n    const db = new DatabaseSync(file, { readOnly: true });\n    const q = query.trim();\n    const rows = db\n      .prepare(\n        `SELECT id, name, qualified_name, kind, file, line, importance\n         FROM nodes\n         WHERE name = ? OR qualified_name = ? OR name LIKE ? OR qualified_name LIKE ?\n         ORDER BY\n           CASE WHEN name = ? OR qualified_name = ? THEN 0\n                WHEN name LIKE ? THEN 1\n                ELSE 2 END,\n           importance DESC\n         LIMIT ?`,\n      )\n      .all(q, q, `${q}%`, `%${q}%`, q, q, `${q}%`, limit) as Record<string, unknown>[];\n    db.close();\n    return rows.map((r) => ({\n      id: String(r.id),\n      name: String(r.name),\n      qualifiedName: String(r.qualified_name),\n      kind: String(r.kind),\n      file: String(r.file),\n      line: Number(r.line),\n      importance: Number(r.importance),\n    }));\n  } catch {\n    return [];\n  }\n}\n\n/** Neighbor edges for a node id (src or dst). Empty if index missing. */\nexport function lookupNeighbors(\n  root: string,\n  nodeId: string,\n  direction: 'out' | 'in' | 'both' = 'both',\n  limit = 50,\n): GraphEdge[] {\n  const file = indexDbPath(root);\n  if (!fs.existsSync(file) || !nodeId) return [];\n  try {\n    // eslint-disable-next-line @typescript-eslint/no-require-imports\n    const { DatabaseSync } = require('node:sqlite') as typeof import('node:sqlite');\n    const db = new DatabaseSync(file, { readOnly: true });\n    let rows: Record<string, unknown>[] = [];\n    if (direction === 'out' || direction === 'both') {\n      rows = rows.concat(\n        db\n          .prepare(`SELECT json FROM edges WHERE src = ? LIMIT ?`)\n          .all(nodeId, limit) as Record<string, unknown>[],\n      );\n    }\n    if (direction === 'in' || direction === 'both') {\n      rows = rows.concat(\n        db\n          .prepare(`SELECT json FROM edges WHERE dst = ? LIMIT ?`)\n          .all(nodeId, limit) as Record<string, unknown>[],\n      );\n    }\n    db.close();\n    const byId = new Map<string, GraphEdge>();\n    for (const r of rows) {\n      try {\n        const e = JSON.parse(String(r.json)) as GraphEdge;\n        byId.set(e.id, e);\n      } catch {\n        /* skip bad row */\n      }\n    }\n    return [...byId.values()];\n  } catch {\n    return [];\n  }\n}\n\n/** Read index meta (corpusHash etc.) or null if missing. */\nexport function readIndexMeta(root: string): Record<string, string> | null {\n  const file = indexDbPath(root);\n  if (!fs.existsSync(file)) return null;\n  try {\n    // eslint-disable-next-line @typescript-eslint/no-require-imports\n    const { DatabaseSync } = require('node:sqlite') as typeof import('node:sqlite');\n    const db = new DatabaseSync(file, { readOnly: true });\n    const rows = db.prepare('SELECT key, value FROM meta').all() as { key: string; value: string }[];\n    db.close();\n    const out: Record<string, string> = {};\n    for (const r of rows) out[r.key] = r.value;\n    return out;\n  } catch {\n    return null;\n  }\n}\n\n/**\n * Reconstruct a full `VgGraph` from the SQLite index (indexVersion ≥ 2).\n * Returns null if the index is missing, stale schema, or incomplete.\n * Prefer this over JSON.parse of pretty graph.json for cold serve on large maps.\n */\nexport function loadGraphFromIndex(root: string): VgGraph | null {\n  const file = indexDbPath(root);\n  if (!fs.existsSync(file)) return null;\n  try {\n    // eslint-disable-next-line @typescript-eslint/no-require-imports\n    const { DatabaseSync } = require('node:sqlite') as typeof import('node:sqlite');\n    const db = new DatabaseSync(file, { readOnly: true });\n    const metaRows = db.prepare('SELECT key, value FROM meta').all() as {\n      key: string;\n      value: string;\n    }[];\n    const meta: Record<string, string> = {};\n    for (const r of metaRows) meta[r.key] = r.value;\n\n    if (meta.indexVersion !== 'vg-graph-index/2' || !meta.graphMeta || !meta.graphProvenance) {\n      db.close();\n      return null;\n    }\n\n    const nodeRows = db.prepare('SELECT json FROM nodes ORDER BY id').all() as {\n      json: string;\n    }[];\n    const edgeRows = db.prepare('SELECT json FROM edges ORDER BY id').all() as {\n      json: string;\n    }[];\n    const areaRows = db.prepare('SELECT json FROM areas ORDER BY id').all() as {\n      json: string;\n    }[];\n    db.close();\n\n    const nodes = nodeRows.map((r) => JSON.parse(r.json) as GraphNode);\n    const edges = edgeRows.map((r) => JSON.parse(r.json) as GraphEdge);\n    const areas = areaRows.map((r) => JSON.parse(r.json) as Area);\n\n    // Stable sorts match serialize contract (ids already ordered by SQL, re-sort for safety).\n    nodes.sort((a, b) => a.id.localeCompare(b.id));\n    edges.sort(\n      (a, b) =>\n        a.kind.localeCompare(b.kind) || a.src.localeCompare(b.src) || a.dst.localeCompare(b.dst),\n    );\n    areas.sort((a, b) => a.id - b.id);\n\n    const graph: VgGraph = {\n      schemaVersion: (meta.schemaVersion as typeof SCHEMA_VERSION) || SCHEMA_VERSION,\n      generatedAt: meta.generatedAt ?? new Date(0).toISOString(),\n      provenance: JSON.parse(meta.graphProvenance),\n      meta: JSON.parse(meta.graphMeta),\n      nodes,\n      edges,\n      areas,\n    };\n    if (meta.factsJson) graph.facts = JSON.parse(meta.factsJson);\n    if (meta.groundingJson) graph.grounding = JSON.parse(meta.groundingJson);\n    if (meta.summariesJson) graph.summaries = JSON.parse(meta.summariesJson);\n    if (meta.unknownsJson) graph.unknowns = JSON.parse(meta.unknownsJson);\n\n    // Lightweight integrity: edge resolution types stay valid.\n    for (const e of edges) {\n      if (!e.resolution) e.resolution = 'heuristic' as ResolverKind;\n      if (!e.epistemic) e.epistemic = 'observed' as EpistemicTier;\n    }\n    return graph;\n  } catch {\n    return null;\n  }\n}\n\n/**\n * Load the graph preferring the SQLite index when its corpusHash matches the\n * committed graph.json provenance (or when only the index exists). Falls back\n * to graph.json. Returns null if neither is usable.\n */\nexport function loadGraphPreferIndex(\n  root: string,\n  graphJsonPath: string,\n): { graph: VgGraph; source: 'index' | 'json' } | null {\n  // Snapshot-first: skips the large-string JSON.parse when a fresh binary\n  // snapshot exists (sidecar or store-mode standalone), and self-heals the\n  // sidecar when not (see engine/snapshot.ts).\n  const jsonGraph: VgGraph | null = loadGraphFileWithSnapshot(graphJsonPath);\n\n  const fromIndex = loadGraphFromIndex(root);\n  if (fromIndex) {\n    if (!jsonGraph || fromIndex.provenance.corpusHash === jsonGraph.provenance.corpusHash) {\n      return { graph: fromIndex, source: 'index' };\n    }\n    // Index stale vs graph.json — prefer canonical JSON and let next build refresh.\n  }\n  if (jsonGraph) return { graph: jsonGraph, source: 'json' };\n  return null;\n}\n","import * as fs from 'node:fs';\nimport { resolveGraphPath } from './artifacts.js';\nimport { loadGraphFileWithSnapshot } from './snapshot.js';\nimport { loadGraphPreferIndex } from './index-db.js';\nimport type { VgGraph } from '../schema.js';\n\n/**\n * Load the code map for a repository.\n *\n * When `graphPath` is omitted, prefers an existing global-store snapshot, then\n * the legacy `.vibgrate/graph.json`, matching {@link resolveGraphPath}.\n * Prefers the SQLite index when its corpusHash matches the committed map\n * (faster cold serve on large repos). Returns null if none exists.\n */\nexport function loadGraph(root: string, graphPath?: string): VgGraph | null {\n  const file = resolveGraphPath(root, graphPath);\n  // Index is always rooted at the project root; only use it when loading the\n  // default map for that root (not an arbitrary --graph path).\n  if (!graphPath) {\n    const preferred = loadGraphPreferIndex(root, file);\n    if (preferred) return preferred.graph;\n  }\n  return loadGraphFileWithSnapshot(file);\n}\n"]}
+{"version":3,"sources":["../src/schema.ts","../src/engine/index-db.ts","../src/engine/load.ts"],"names":[],"mappings":";;;;;;;AASO,IAAM,cAAA,GAAiB;;;AC2BvB,SAAS,YAAY,IAAA,EAAsB;AAChD,EAAA,OAAY,IAAA,CAAA,IAAA,CAAK,QAAA,CAAS,IAAI,CAAA,EAAG,UAAU,CAAA;AAC7C;AAGO,SAAS,eAAA,CAAgB,MAAc,KAAA,EAAkC;AAC9E,EAAA,MAAM,IAAA,GAAO,YAAY,IAAI,CAAA;AAC7B,EAAA,IAAI;AAEF,IAAA,MAAM,EAAE,YAAA,EAAa,GAAI,SAAA,CAAQ,QAAa,CAAA;AAC9C,IAAG,aAAe,IAAA,CAAA,OAAA,CAAQ,IAAI,GAAG,EAAE,SAAA,EAAW,MAAM,CAAA;AACpD,IAAA,MAAM,GAAA,GAAM,CAAA,EAAG,IAAI,CAAA,CAAA,EAAI,QAAQ,GAAG,CAAA,IAAA,CAAA;AAClC,IAAA,IAAI;AACF,MAAA,IAAO,EAAA,CAAA,UAAA,CAAW,GAAG,CAAA,EAAM,cAAW,GAAG,CAAA;AAAA,IAC3C,CAAA,CAAA,MAAQ;AAAA,IAER;AAEA,IAAA,MAAM,EAAA,GAAK,IAAI,YAAA,CAAa,GAAG,CAAA;AAC/B,IAAA,EAAA,CAAG,IAAA,CAAK;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,IAAA,CAwCP,CAAA;AAED,IAAA,MAAM,OAAA,GAAU,EAAA,CAAG,OAAA,CAAQ,4CAA4C,CAAA;AACvE,IAAA,OAAA,CAAQ,GAAA,CAAI,YAAA,EAAc,KAAA,CAAM,UAAA,CAAW,UAAU,CAAA;AACrD,IAAA,OAAA,CAAQ,GAAA,CAAI,eAAA,EAAiB,KAAA,CAAM,aAAa,CAAA;AAChD,IAAA,OAAA,CAAQ,GAAA,CAAI,aAAA,EAAe,KAAA,CAAM,WAAW,CAAA;AAC5C,IAAA,OAAA,CAAQ,IAAI,WAAA,EAAa,MAAA,CAAO,KAAA,CAAM,KAAA,CAAM,MAAM,CAAC,CAAA;AACnD,IAAA,OAAA,CAAQ,IAAI,WAAA,EAAa,MAAA,CAAO,KAAA,CAAM,KAAA,CAAM,MAAM,CAAC,CAAA;AACnD,IAAA,OAAA,CAAQ,GAAA,CAAI,cAAA,EAAgB,KAAA,CAAM,IAAA,CAAK,gBAAgB,MAAM,CAAA;AAC7D,IAAA,OAAA,CAAQ,GAAA,CAAI,gBAAgB,kBAAkB,CAAA;AAE9C,IAAA,OAAA,CAAQ,IAAI,WAAA,EAAa,IAAA,CAAK,SAAA,CAAU,KAAA,CAAM,IAAI,CAAC,CAAA;AACnD,IAAA,OAAA,CAAQ,IAAI,iBAAA,EAAmB,IAAA,CAAK,SAAA,CAAU,KAAA,CAAM,UAAU,CAAC,CAAA;AAC/D,IAAA,IAAI,KAAA,CAAM,OAAO,OAAA,CAAQ,GAAA,CAAI,aAAa,IAAA,CAAK,SAAA,CAAU,KAAA,CAAM,KAAK,CAAC,CAAA;AACrE,IAAA,IAAI,KAAA,CAAM,WAAW,OAAA,CAAQ,GAAA,CAAI,iBAAiB,IAAA,CAAK,SAAA,CAAU,KAAA,CAAM,SAAS,CAAC,CAAA;AACjF,IAAA,IAAI,KAAA,CAAM,WAAW,OAAA,CAAQ,GAAA,CAAI,iBAAiB,IAAA,CAAK,SAAA,CAAU,KAAA,CAAM,SAAS,CAAC,CAAA;AACjF,IAAA,IAAI,KAAA,CAAM,UAAU,OAAA,CAAQ,GAAA,CAAI,gBAAgB,IAAA,CAAK,SAAA,CAAU,KAAA,CAAM,QAAQ,CAAC,CAAA;AAE9E,IAAA,MAAM,UAAU,EAAA,CAAG,OAAA;AAAA,MACjB,CAAA;AAAA,+CAAA;AAAA,KAEF;AACA,IAAA,KAAA,MAAW,CAAA,IAAK,MAAM,KAAA,EAAO;AAC3B,MAAA,OAAA,CAAQ,GAAA;AAAA,QACN,CAAA,CAAE,EAAA;AAAA,QACF,CAAA,CAAE,IAAA;AAAA,QACF,CAAA,CAAE,aAAA;AAAA,QACF,CAAA,CAAE,IAAA;AAAA,QACF,CAAA,CAAE,IAAA;AAAA,QACF,EAAE,IAAA,CAAK,KAAA;AAAA,QACP,CAAA,CAAE,UAAA;AAAA,QACF,CAAA,CAAE,IAAA;AAAA,QACF,CAAA,CAAE,QAAQ,CAAA,GAAI,CAAA;AAAA,QACd,CAAA,CAAE,IAAA;AAAA,QACF,IAAA,CAAK,UAAU,CAAC;AAAA,OAClB;AAAA,IACF;AAEA,IAAA,MAAM,UAAU,EAAA,CAAG,OAAA;AAAA,MACjB,CAAA;AAAA,sCAAA;AAAA,KAEF;AACA,IAAA,KAAA,MAAW,CAAA,IAAK,MAAM,KAAA,EAAO;AAC3B,MAAA,OAAA,CAAQ,GAAA;AAAA,QACN,CAAA,CAAE,EAAA;AAAA,QACF,CAAA,CAAE,IAAA;AAAA,QACF,CAAA,CAAE,GAAA;AAAA,QACF,CAAA,CAAE,GAAA;AAAA,QACF,CAAA,CAAE,UAAA;AAAA,QACF,CAAA,CAAE,UAAA;AAAA,QACF,EAAE,SAAA,IAAa,UAAA;AAAA,QACf,IAAA,CAAK,UAAU,CAAC;AAAA,OAClB;AAAA,IACF;AAEA,IAAA,MAAM,OAAA,GAAU,EAAA,CAAG,OAAA,CAAQ,2CAA2C,CAAA;AACtE,IAAA,KAAA,MAAW,CAAA,IAAK,MAAM,KAAA,EAAO;AAC3B,MAAA,OAAA,CAAQ,IAAI,CAAA,CAAE,EAAA,EAAI,IAAA,CAAK,SAAA,CAAU,CAAC,CAAC,CAAA;AAAA,IACrC;AAEA,IAAA,EAAA,CAAG,KAAA,EAAM;AACT,IAAG,EAAA,CAAA,UAAA,CAAW,KAAK,IAAI,CAAA;AACvB,IAAA,OAAO,EAAE,IAAA,EAAM,IAAA,EAAM,KAAA,EAAO,KAAA,CAAM,KAAA,CAAM,MAAA,EAAQ,KAAA,EAAO,KAAA,CAAM,KAAA,CAAM,MAAA,EAAQ,EAAA,EAAI,IAAA,EAAK;AAAA,EACtF,SAAS,GAAA,EAAK;AACZ,IAAA,OAAO;AAAA,MACL,IAAA,EAAM,IAAA;AAAA,MACN,KAAA,EAAO,CAAA;AAAA,MACP,KAAA,EAAO,CAAA;AAAA,MACP,EAAA,EAAI,KAAA;AAAA,MACJ,QAAS,GAAA,CAAc;AAAA,KACzB;AAAA,EACF;AACF;AAoHO,SAAS,mBAAmB,IAAA,EAA8B;AAC/D,EAAA,MAAM,IAAA,GAAO,YAAY,IAAI,CAAA;AAC7B,EAAA,IAAI,CAAI,EAAA,CAAA,UAAA,CAAW,IAAI,CAAA,EAAG,OAAO,IAAA;AACjC,EAAA,IAAI;AAEF,IAAA,MAAM,EAAE,YAAA,EAAa,GAAI,SAAA,CAAQ,QAAa,CAAA;AAC9C,IAAA,MAAM,KAAK,IAAI,YAAA,CAAa,MAAM,EAAE,QAAA,EAAU,MAAM,CAAA;AACpD,IAAA,MAAM,QAAA,GAAW,EAAA,CAAG,OAAA,CAAQ,6BAA6B,EAAE,GAAA,EAAI;AAI/D,IAAA,MAAM,OAA+B,EAAC;AACtC,IAAA,KAAA,MAAW,KAAK,QAAA,EAAU,IAAA,CAAK,CAAA,CAAE,GAAG,IAAI,CAAA,CAAE,KAAA;AAE1C,IAAA,IAAI,IAAA,CAAK,iBAAiB,kBAAA,IAAsB,CAAC,KAAK,SAAA,IAAa,CAAC,KAAK,eAAA,EAAiB;AACxF,MAAA,EAAA,CAAG,KAAA,EAAM;AACT,MAAA,OAAO,IAAA;AAAA,IACT;AAEA,IAAA,MAAM,QAAA,GAAW,EAAA,CAAG,OAAA,CAAQ,oCAAoC,EAAE,GAAA,EAAI;AAGtE,IAAA,MAAM,QAAA,GAAW,EAAA,CAAG,OAAA,CAAQ,oCAAoC,EAAE,GAAA,EAAI;AAGtE,IAAA,MAAM,QAAA,GAAW,EAAA,CAAG,OAAA,CAAQ,oCAAoC,EAAE,GAAA,EAAI;AAGtE,IAAA,EAAA,CAAG,KAAA,EAAM;AAET,IAAA,MAAM,KAAA,GAAQ,SAAS,GAAA,CAAI,CAAC,MAAM,IAAA,CAAK,KAAA,CAAM,CAAA,CAAE,IAAI,CAAc,CAAA;AACjE,IAAA,MAAM,KAAA,GAAQ,SAAS,GAAA,CAAI,CAAC,MAAM,IAAA,CAAK,KAAA,CAAM,CAAA,CAAE,IAAI,CAAc,CAAA;AACjE,IAAA,MAAM,KAAA,GAAQ,SAAS,GAAA,CAAI,CAAC,MAAM,IAAA,CAAK,KAAA,CAAM,CAAA,CAAE,IAAI,CAAS,CAAA;AAG5D,IAAA,KAAA,CAAM,IAAA,CAAK,CAAC,CAAA,EAAG,CAAA,KAAM,EAAE,EAAA,CAAG,aAAA,CAAc,CAAA,CAAE,EAAE,CAAC,CAAA;AAC7C,IAAA,KAAA,CAAM,IAAA;AAAA,MACJ,CAAC,CAAA,EAAG,CAAA,KACF,EAAE,IAAA,CAAK,aAAA,CAAc,EAAE,IAAI,CAAA,IAAK,EAAE,GAAA,CAAI,aAAA,CAAc,EAAE,GAAG,CAAA,IAAK,EAAE,GAAA,CAAI,aAAA,CAAc,EAAE,GAAG;AAAA,KAC3F;AACA,IAAA,KAAA,CAAM,KAAK,CAAC,CAAA,EAAG,MAAM,CAAA,CAAE,EAAA,GAAK,EAAE,EAAE,CAAA;AAEhC,IAAA,MAAM,KAAA,GAAiB;AAAA,MACrB,aAAA,EAAgB,KAAK,aAAA,IAA2C,cAAA;AAAA,MAChE,aAAa,IAAA,CAAK,WAAA,IAAA,qBAAmB,IAAA,CAAK,CAAC,GAAE,WAAA,EAAY;AAAA,MACzD,UAAA,EAAY,IAAA,CAAK,KAAA,CAAM,IAAA,CAAK,eAAe,CAAA;AAAA,MAC3C,IAAA,EAAM,IAAA,CAAK,KAAA,CAAM,IAAA,CAAK,SAAS,CAAA;AAAA,MAC/B,KAAA;AAAA,MACA,KAAA;AAAA,MACA;AAAA,KACF;AACA,IAAA,IAAI,KAAK,SAAA,EAAW,KAAA,CAAM,QAAQ,IAAA,CAAK,KAAA,CAAM,KAAK,SAAS,CAAA;AAC3D,IAAA,IAAI,KAAK,aAAA,EAAe,KAAA,CAAM,YAAY,IAAA,CAAK,KAAA,CAAM,KAAK,aAAa,CAAA;AACvE,IAAA,IAAI,KAAK,aAAA,EAAe,KAAA,CAAM,YAAY,IAAA,CAAK,KAAA,CAAM,KAAK,aAAa,CAAA;AACvE,IAAA,IAAI,KAAK,YAAA,EAAc,KAAA,CAAM,WAAW,IAAA,CAAK,KAAA,CAAM,KAAK,YAAY,CAAA;AAGpE,IAAA,KAAA,MAAW,KAAK,KAAA,EAAO;AACrB,MAAA,IAAI,CAAC,CAAA,CAAE,UAAA,EAAY,CAAA,CAAE,UAAA,GAAa,WAAA;AAClC,MAAA,IAAI,CAAC,CAAA,CAAE,SAAA,EAAW,CAAA,CAAE,SAAA,GAAY,UAAA;AAAA,IAClC;AACA,IAAA,OAAO,KAAA;AAAA,EACT,CAAA,CAAA,MAAQ;AACN,IAAA,OAAO,IAAA;AAAA,EACT;AACF;AAOO,SAAS,oBAAA,CACd,MACA,aAAA,EACqD;AAIrD,EAAA,MAAM,SAAA,GAA4B,0BAA0B,aAAa,CAAA;AAEzE,EAAA,MAAM,SAAA,GAAY,mBAAmB,IAAI,CAAA;AACzC,EAAA,IAAI,SAAA,EAAW;AACb,IAAA,IAAI,CAAC,SAAA,IAAa,SAAA,CAAU,WAAW,UAAA,KAAe,SAAA,CAAU,WAAW,UAAA,EAAY;AACrF,MAAA,OAAO,EAAE,KAAA,EAAO,SAAA,EAAW,MAAA,EAAQ,OAAA,EAAQ;AAAA,IAC7C;AAAA,EAEF;AACA,EAAA,IAAI,WAAW,OAAO,EAAE,KAAA,EAAO,SAAA,EAAW,QAAQ,MAAA,EAAO;AACzD,EAAA,OAAO,IAAA;AACT;;;ACvWO,SAAS,SAAA,CAAU,MAAc,SAAA,EAAoC;AAC1E,EAAA,MAAM,IAAA,GAAO,gBAAA,CAAiB,IAAA,EAAM,SAAS,CAAA;AAG7C,EAAA,IAAI,CAAC,SAAA,EAAW;AACd,IAAA,MAAM,SAAA,GAAY,oBAAA,CAAqB,IAAA,EAAM,IAAI,CAAA;AACjD,IAAA,IAAI,SAAA,SAAkB,SAAA,CAAU,KAAA;AAAA,EAClC;AACA,EAAA,OAAO,0BAA0B,IAAI,CAAA;AACvC","file":"chunk-537JBQVB.js","sourcesContent":["/**\n * The `vg-graph/1.0` on-disk schema.\n *\n * This is vg's own open schema (VG-PACKAGE-AND-SCHEMA.md §4) — informed by good\n * ideas (content-hashed ids, epistemic typing of facts) but standalone and\n * self-contained. Every collection is deterministically serialized\n * (sorted keys, stable element order). These TypeScript shapes are normative.\n */\n\nexport const SCHEMA_VERSION = 'vg-graph/1.0' as const;\n\nexport type ResolverKind = 'scip' | 'stackgraph' | 'tsc' | 'heuristic';\n\n/** Coarse, honest resolution tier for an edge (see engine/epistemic.ts). */\nexport type EpistemicTier = 'observed' | 'name-matched' | 'declared';\n\n/**\n * The toolchain that produced this graph — the reproducibility fingerprint.\n * Everything here deterministically affects graph *content* (parse trees change\n * between grammar releases; resolvers change which edges resolve), so a CI run\n * and a laptop run that disagree can be caught by comparing `fingerprint`.\n * Deliberately excludes the Node/OS version so the graph stays byte-stable\n * across host runtimes; `fingerprint` pins the parse/resolve toolchain only.\n */\nexport interface Toolchain {\n  schema: string; // SCHEMA_VERSION\n  tool: string; // vg calendar version\n  grammars: string; // tree-sitter grammar set version string\n  resolvers: ResolverKind[]; // resolver kinds available, sorted\n  fingerprint: string; // shortId over the fields above — the value `vg attest` signs\n}\n\nexport interface Provenance {\n  tool: 'vg';\n  version: string; // calendar version\n  grammars: Record<string, string>; // lang → grammar version (determinism input)\n  resolver: ResolverKind[];\n  deep: boolean; // did the heavier open passes run\n  semanticModel?: string; // embedding model id+version if --deep semantic links\n  corpusHash: string; // blake3 over the included file set + hashes\n  toolchain?: Toolchain; // reproducibility fingerprint (checked by `vg verify`)\n}\n\n/** Analysis cost tier — auto-selected by node count (or forced). Reported honestly. */\nexport type AnalysisTier = 'full' | 'large' | 'xl';\n\nexport interface GraphMeta {\n  root: string; // relative; portable across machines\n  languages: string[];\n  counts: {\n    nodes: number;\n    edges: number;\n    areas: number;\n    tests: number;\n    untested: number;\n  };\n  cluster: 'leiden' | 'louvain' | 'none';\n  /** Auto-selected (or forced) analysis tier for large maps. */\n  analysisTier?: AnalysisTier;\n  edgeKinds: EdgeKind[];\n}\n\nexport type NodeKind =\n  | 'file'\n  | 'module'\n  | 'package'\n  | 'class'\n  | 'interface'\n  | 'function'\n  | 'method'\n  | 'property'\n  | 'test'\n  | 'route'\n  | 'component'\n  /** Documentation / config text ingested for semantic ask (markdown, txt, env examples). */\n  | 'document'\n  | 'external';\n\nexport interface Span {\n  start: number; // 1-based start line\n  end: number; // 1-based end line\n}\n\nexport interface Centrality {\n  degree: number;\n  pagerank: number;\n  betweenness: number;\n  eigenvector: number;\n}\n\nexport interface GraphNode {\n  id: string; // blake3(canonical(kind, qualifiedName, file, signature))\n  kind: NodeKind;\n  name: string; // short name\n  qualifiedName: string;\n  file: string; // relative path\n  span: Span; // line range (excluded from id hash)\n  lang: string;\n  visibility?: 'public' | 'private' | 'protected' | 'internal';\n  signature?: string;\n  doc?: string; // short leading doc-comment / docstring summary (deterministic; not a full body)\n  importance: number; // 0..1 blended centrality\n  centrality: Centrality;\n  area: number; // area id (the node's community); -1 = unassigned (cluster \"none\")\n  isHub: boolean; // centrality outlier — surfaced by `vg hubs`\n  tested: boolean | null; // null = not analyzable (e.g. external)\n  coverage?: number; // 0..1 line coverage if a coverage report was ingested\n  changeCoupling?: string[]; // node ids that historically change together\n}\n\nexport type EdgeKind =\n  | 'call'\n  | 'import'\n  | 'contains'\n  | 'extends'\n  | 'implements'\n  | 'references'\n  | 'test'\n  | 'coverage';\n\nexport interface GraphEdge {\n  id: string; // blake3(canonical(kind, src, dst))\n  kind: EdgeKind;\n  src: string; // node id\n  dst: string; // node id\n  resolution: ResolverKind; // how the edge was resolved\n  confidence: number; // 0..1 (1.0 for scip/declared; lower for heuristic/dynamic)\n  epistemic?: EpistemicTier; // coarse honesty tier derived from resolution+kind\n  surprise?: number; // 0..1 improbability under the area model (`vg oddities`)\n  count?: number; // call-site multiplicity\n}\n\nexport interface Area {\n  id: number; // stable across runs (remapped to previous committed map)\n  label: string; // most-central member's name (editable via `vg label`)\n  size: number;\n  members: string[]; // node ids, sorted\n  cohesion: number; // 0..1\n  externalEdges: number; // cross-area edge count\n}\n\nexport type FactKind = 'contract' | 'invariant' | 'characterization';\nexport type DerivedBy = 'declared' | 'static';\nexport type FactConfidence = 'Observed' | 'Derived';\n\nexport interface Fact {\n  id: string; // blake3(canonical(kind, subjectIds, predicate))\n  kind: FactKind;\n  subjectIds: string[]; // node ids this fact constrains\n  predicate: unknown; // the constraint\n  derivedBy: DerivedBy;\n  confidence: FactConfidence;\n  evidence: { file: string; span: Span }[];\n}\n\n/**\n * A reference the graph could not resolve — surfaced by `vg unknowns`. Reporting\n * what it *cannot* connect (ranked by blast radius) is the honest inverse of a\n * scanner that hides its unknowns. Only unknowns the precise rungs (tsc/scip)\n * did not supersede are recorded, so a compiler-resolved file never shows here.\n */\nexport interface Unknown {\n  from: string; // node id where the unresolved reference occurs\n  name: string; // the callee/type name that could not be resolved\n  kind: 'call' | 'extends' | 'implements';\n  count: number; // occurrences at this site\n}\n\nexport type GroundingKind = 'should_follow' | 'smells_like' | 'relevant_to';\n\nexport interface GroundingEdge {\n  src: string; // node id\n  packEntryId: string;\n  kind: GroundingKind;\n  confidence: number; // 0..1\n  rationale: 'recommended' | 'conjectured';\n  citation: { title: string; url: string };\n}\n\n/** Precomputed hub blast-radius counts for fast agent answers (optional). */\nexport interface HubBlastSummary {\n  id: string;\n  name: string;\n  kind: string;\n  file: string;\n  importance: number;\n  direct: number;\n  depth2: number;\n  files: number;\n  tested: boolean | null;\n}\n\nexport interface GraphSummaries {\n  hubs: HubBlastSummary[];\n}\n\nexport interface VgGraph {\n  schemaVersion: typeof SCHEMA_VERSION;\n  generatedAt: string; // ISO; the ONLY nondeterministic field (pinned by --generated-at)\n  provenance: Provenance;\n  meta: GraphMeta;\n  nodes: GraphNode[]; // sorted by id\n  edges: GraphEdge[]; // sorted by (kind, src, dst)\n  areas: Area[]; // sorted by id\n  facts?: Fact[]; // open facts (contract/invariant/characterization); sorted by id\n  grounding?: GroundingEdge[]; // free-pack grounding (default on; omit with --no-ground)\n  unknowns?: Unknown[]; // heuristic references left unresolved; sorted by (from, kind, name)\n  /** Build-time hub blast-radius summaries (always on; tiny). */\n  summaries?: GraphSummaries;\n}\n","/**\n * SQLite serve index for large maps (scale past flat-JSON-only serve).\n *\n * The canonical artifact remains `graph.json` (determinism / git). The index\n * at `.vibgrate/cache/graph.db` is a derived, gitignored structure built after\n * every successful build:\n *   - denormalized name/edge columns for O(log n) lookup\n *   - full node/edge/area JSON for reconstructing a `VgGraph` without parsing\n *     the pretty-printed graph.json (faster cold serve on XL maps)\n *\n * Uses Node's built-in `node:sqlite` (Node ≥22) — no native npm dependency.\n */\n\nimport * as fs from 'node:fs';\nimport * as path from 'node:path';\nimport { cacheDir } from './cache.js';\nimport { loadGraphFileWithSnapshot } from './snapshot.js';\nimport type {\n  Area,\n  EpistemicTier,\n  GraphEdge,\n  GraphNode,\n  ResolverKind,\n  VgGraph,\n} from '../schema.js';\nimport { SCHEMA_VERSION } from '../schema.js';\n\nexport interface IndexWriteResult {\n  path: string;\n  nodes: number;\n  edges: number;\n  /** False when node:sqlite is unavailable — callers should not fail the build. */\n  ok: boolean;\n  reason?: string;\n}\n\nexport function indexDbPath(root: string): string {\n  return path.join(cacheDir(root), 'graph.db');\n}\n\n/** Write (replace) the SQLite index from a built graph. Never throws to callers. */\nexport function writeGraphIndex(root: string, graph: VgGraph): IndexWriteResult {\n  const file = indexDbPath(root);\n  try {\n    // eslint-disable-next-line @typescript-eslint/no-require-imports\n    const { DatabaseSync } = require('node:sqlite') as typeof import('node:sqlite');\n    fs.mkdirSync(path.dirname(file), { recursive: true });\n    const tmp = `${file}.${process.pid}.tmp`;\n    try {\n      if (fs.existsSync(tmp)) fs.unlinkSync(tmp);\n    } catch {\n      /* ignore */\n    }\n\n    const db = new DatabaseSync(tmp);\n    db.exec(`\n      PRAGMA journal_mode = OFF;\n      PRAGMA synchronous = OFF;\n      CREATE TABLE meta (\n        key TEXT PRIMARY KEY,\n        value TEXT NOT NULL\n      );\n      CREATE TABLE nodes (\n        id TEXT PRIMARY KEY,\n        name TEXT NOT NULL,\n        qualified_name TEXT NOT NULL,\n        kind TEXT NOT NULL,\n        file TEXT NOT NULL,\n        line INTEGER NOT NULL,\n        importance REAL NOT NULL,\n        area INTEGER NOT NULL,\n        is_hub INTEGER NOT NULL,\n        lang TEXT NOT NULL,\n        json TEXT NOT NULL\n      );\n      CREATE TABLE edges (\n        id TEXT PRIMARY KEY,\n        kind TEXT NOT NULL,\n        src TEXT NOT NULL,\n        dst TEXT NOT NULL,\n        resolution TEXT NOT NULL,\n        confidence REAL NOT NULL,\n        epistemic TEXT NOT NULL,\n        json TEXT NOT NULL\n      );\n      CREATE TABLE areas (\n        id INTEGER PRIMARY KEY,\n        json TEXT NOT NULL\n      );\n      CREATE INDEX idx_nodes_name ON nodes(name);\n      CREATE INDEX idx_nodes_qn ON nodes(qualified_name);\n      CREATE INDEX idx_nodes_file ON nodes(file);\n      CREATE INDEX idx_edges_src ON edges(src);\n      CREATE INDEX idx_edges_dst ON edges(dst);\n      CREATE INDEX idx_edges_kind ON edges(kind);\n    `);\n\n    const insMeta = db.prepare('INSERT INTO meta(key, value) VALUES (?, ?)');\n    insMeta.run('corpusHash', graph.provenance.corpusHash);\n    insMeta.run('schemaVersion', graph.schemaVersion);\n    insMeta.run('generatedAt', graph.generatedAt);\n    insMeta.run('nodeCount', String(graph.nodes.length));\n    insMeta.run('edgeCount', String(graph.edges.length));\n    insMeta.run('analysisTier', graph.meta.analysisTier ?? 'full');\n    insMeta.run('indexVersion', 'vg-graph-index/2');\n    // Full meta + provenance for reconstruct without graph.json parse.\n    insMeta.run('graphMeta', JSON.stringify(graph.meta));\n    insMeta.run('graphProvenance', JSON.stringify(graph.provenance));\n    if (graph.facts) insMeta.run('factsJson', JSON.stringify(graph.facts));\n    if (graph.grounding) insMeta.run('groundingJson', JSON.stringify(graph.grounding));\n    if (graph.summaries) insMeta.run('summariesJson', JSON.stringify(graph.summaries));\n    if (graph.unknowns) insMeta.run('unknownsJson', JSON.stringify(graph.unknowns));\n\n    const insNode = db.prepare(\n      `INSERT INTO nodes(id, name, qualified_name, kind, file, line, importance, area, is_hub, lang, json)\n       VALUES (?, ?, ?, ?, ?, ?, ?, ?, ?, ?, ?)`,\n    );\n    for (const n of graph.nodes) {\n      insNode.run(\n        n.id,\n        n.name,\n        n.qualifiedName,\n        n.kind,\n        n.file,\n        n.span.start,\n        n.importance,\n        n.area,\n        n.isHub ? 1 : 0,\n        n.lang,\n        JSON.stringify(n),\n      );\n    }\n\n    const insEdge = db.prepare(\n      `INSERT INTO edges(id, kind, src, dst, resolution, confidence, epistemic, json)\n       VALUES (?, ?, ?, ?, ?, ?, ?, ?)`,\n    );\n    for (const e of graph.edges) {\n      insEdge.run(\n        e.id,\n        e.kind,\n        e.src,\n        e.dst,\n        e.resolution,\n        e.confidence,\n        e.epistemic ?? 'observed',\n        JSON.stringify(e),\n      );\n    }\n\n    const insArea = db.prepare('INSERT INTO areas(id, json) VALUES (?, ?)');\n    for (const a of graph.areas) {\n      insArea.run(a.id, JSON.stringify(a));\n    }\n\n    db.close();\n    fs.renameSync(tmp, file);\n    return { path: file, nodes: graph.nodes.length, edges: graph.edges.length, ok: true };\n  } catch (err) {\n    return {\n      path: file,\n      nodes: 0,\n      edges: 0,\n      ok: false,\n      reason: (err as Error).message,\n    };\n  }\n}\n\nexport interface NameHit {\n  id: string;\n  name: string;\n  qualifiedName: string;\n  kind: string;\n  file: string;\n  line: number;\n  importance: number;\n}\n\n/** Fast name / prefix lookup against the index. Empty if index missing. */\nexport function lookupNameIndex(root: string, query: string, limit = 20): NameHit[] {\n  const file = indexDbPath(root);\n  if (!fs.existsSync(file) || !query.trim()) return [];\n  try {\n    // eslint-disable-next-line @typescript-eslint/no-require-imports\n    const { DatabaseSync } = require('node:sqlite') as typeof import('node:sqlite');\n    const db = new DatabaseSync(file, { readOnly: true });\n    const q = query.trim();\n    const rows = db\n      .prepare(\n        `SELECT id, name, qualified_name, kind, file, line, importance\n         FROM nodes\n         WHERE name = ? OR qualified_name = ? OR name LIKE ? OR qualified_name LIKE ?\n         ORDER BY\n           CASE WHEN name = ? OR qualified_name = ? THEN 0\n                WHEN name LIKE ? THEN 1\n                ELSE 2 END,\n           importance DESC\n         LIMIT ?`,\n      )\n      .all(q, q, `${q}%`, `%${q}%`, q, q, `${q}%`, limit) as Record<string, unknown>[];\n    db.close();\n    return rows.map((r) => ({\n      id: String(r.id),\n      name: String(r.name),\n      qualifiedName: String(r.qualified_name),\n      kind: String(r.kind),\n      file: String(r.file),\n      line: Number(r.line),\n      importance: Number(r.importance),\n    }));\n  } catch {\n    return [];\n  }\n}\n\n/** Neighbor edges for a node id (src or dst). Empty if index missing. */\nexport function lookupNeighbors(\n  root: string,\n  nodeId: string,\n  direction: 'out' | 'in' | 'both' = 'both',\n  limit = 50,\n): GraphEdge[] {\n  const file = indexDbPath(root);\n  if (!fs.existsSync(file) || !nodeId) return [];\n  try {\n    // eslint-disable-next-line @typescript-eslint/no-require-imports\n    const { DatabaseSync } = require('node:sqlite') as typeof import('node:sqlite');\n    const db = new DatabaseSync(file, { readOnly: true });\n    let rows: Record<string, unknown>[] = [];\n    if (direction === 'out' || direction === 'both') {\n      rows = rows.concat(\n        db\n          .prepare(`SELECT json FROM edges WHERE src = ? LIMIT ?`)\n          .all(nodeId, limit) as Record<string, unknown>[],\n      );\n    }\n    if (direction === 'in' || direction === 'both') {\n      rows = rows.concat(\n        db\n          .prepare(`SELECT json FROM edges WHERE dst = ? LIMIT ?`)\n          .all(nodeId, limit) as Record<string, unknown>[],\n      );\n    }\n    db.close();\n    const byId = new Map<string, GraphEdge>();\n    for (const r of rows) {\n      try {\n        const e = JSON.parse(String(r.json)) as GraphEdge;\n        byId.set(e.id, e);\n      } catch {\n        /* skip bad row */\n      }\n    }\n    return [...byId.values()];\n  } catch {\n    return [];\n  }\n}\n\n/** Read index meta (corpusHash etc.) or null if missing. */\nexport function readIndexMeta(root: string): Record<string, string> | null {\n  const file = indexDbPath(root);\n  if (!fs.existsSync(file)) return null;\n  try {\n    // eslint-disable-next-line @typescript-eslint/no-require-imports\n    const { DatabaseSync } = require('node:sqlite') as typeof import('node:sqlite');\n    const db = new DatabaseSync(file, { readOnly: true });\n    const rows = db.prepare('SELECT key, value FROM meta').all() as { key: string; value: string }[];\n    db.close();\n    const out: Record<string, string> = {};\n    for (const r of rows) out[r.key] = r.value;\n    return out;\n  } catch {\n    return null;\n  }\n}\n\n/**\n * Reconstruct a full `VgGraph` from the SQLite index (indexVersion ≥ 2).\n * Returns null if the index is missing, stale schema, or incomplete.\n * Prefer this over JSON.parse of pretty graph.json for cold serve on large maps.\n */\nexport function loadGraphFromIndex(root: string): VgGraph | null {\n  const file = indexDbPath(root);\n  if (!fs.existsSync(file)) return null;\n  try {\n    // eslint-disable-next-line @typescript-eslint/no-require-imports\n    const { DatabaseSync } = require('node:sqlite') as typeof import('node:sqlite');\n    const db = new DatabaseSync(file, { readOnly: true });\n    const metaRows = db.prepare('SELECT key, value FROM meta').all() as {\n      key: string;\n      value: string;\n    }[];\n    const meta: Record<string, string> = {};\n    for (const r of metaRows) meta[r.key] = r.value;\n\n    if (meta.indexVersion !== 'vg-graph-index/2' || !meta.graphMeta || !meta.graphProvenance) {\n      db.close();\n      return null;\n    }\n\n    const nodeRows = db.prepare('SELECT json FROM nodes ORDER BY id').all() as {\n      json: string;\n    }[];\n    const edgeRows = db.prepare('SELECT json FROM edges ORDER BY id').all() as {\n      json: string;\n    }[];\n    const areaRows = db.prepare('SELECT json FROM areas ORDER BY id').all() as {\n      json: string;\n    }[];\n    db.close();\n\n    const nodes = nodeRows.map((r) => JSON.parse(r.json) as GraphNode);\n    const edges = edgeRows.map((r) => JSON.parse(r.json) as GraphEdge);\n    const areas = areaRows.map((r) => JSON.parse(r.json) as Area);\n\n    // Stable sorts match serialize contract (ids already ordered by SQL, re-sort for safety).\n    nodes.sort((a, b) => a.id.localeCompare(b.id));\n    edges.sort(\n      (a, b) =>\n        a.kind.localeCompare(b.kind) || a.src.localeCompare(b.src) || a.dst.localeCompare(b.dst),\n    );\n    areas.sort((a, b) => a.id - b.id);\n\n    const graph: VgGraph = {\n      schemaVersion: (meta.schemaVersion as typeof SCHEMA_VERSION) || SCHEMA_VERSION,\n      generatedAt: meta.generatedAt ?? new Date(0).toISOString(),\n      provenance: JSON.parse(meta.graphProvenance),\n      meta: JSON.parse(meta.graphMeta),\n      nodes,\n      edges,\n      areas,\n    };\n    if (meta.factsJson) graph.facts = JSON.parse(meta.factsJson);\n    if (meta.groundingJson) graph.grounding = JSON.parse(meta.groundingJson);\n    if (meta.summariesJson) graph.summaries = JSON.parse(meta.summariesJson);\n    if (meta.unknownsJson) graph.unknowns = JSON.parse(meta.unknownsJson);\n\n    // Lightweight integrity: edge resolution types stay valid.\n    for (const e of edges) {\n      if (!e.resolution) e.resolution = 'heuristic' as ResolverKind;\n      if (!e.epistemic) e.epistemic = 'observed' as EpistemicTier;\n    }\n    return graph;\n  } catch {\n    return null;\n  }\n}\n\n/**\n * Load the graph preferring the SQLite index when its corpusHash matches the\n * committed graph.json provenance (or when only the index exists). Falls back\n * to graph.json. Returns null if neither is usable.\n */\nexport function loadGraphPreferIndex(\n  root: string,\n  graphJsonPath: string,\n): { graph: VgGraph; source: 'index' | 'json' } | null {\n  // Snapshot-first: skips the large-string JSON.parse when a fresh binary\n  // snapshot exists (sidecar or store-mode standalone), and self-heals the\n  // sidecar when not (see engine/snapshot.ts).\n  const jsonGraph: VgGraph | null = loadGraphFileWithSnapshot(graphJsonPath);\n\n  const fromIndex = loadGraphFromIndex(root);\n  if (fromIndex) {\n    if (!jsonGraph || fromIndex.provenance.corpusHash === jsonGraph.provenance.corpusHash) {\n      return { graph: fromIndex, source: 'index' };\n    }\n    // Index stale vs graph.json — prefer canonical JSON and let next build refresh.\n  }\n  if (jsonGraph) return { graph: jsonGraph, source: 'json' };\n  return null;\n}\n","import * as fs from 'node:fs';\nimport { resolveGraphPath } from './artifacts.js';\nimport { loadGraphFileWithSnapshot } from './snapshot.js';\nimport { loadGraphPreferIndex } from './index-db.js';\nimport type { VgGraph } from '../schema.js';\n\n/**\n * Load the code map for a repository.\n *\n * When `graphPath` is omitted, prefers an existing global-store snapshot, then\n * the legacy `.vibgrate/graph.json`, matching {@link resolveGraphPath}.\n * Prefers the SQLite index when its corpusHash matches the committed map\n * (faster cold serve on large repos). Returns null if none exists.\n */\nexport function loadGraph(root: string, graphPath?: string): VgGraph | null {\n  const file = resolveGraphPath(root, graphPath);\n  // Index is always rooted at the project root; only use it when loading the\n  // default map for that root (not an arbitrary --graph path).\n  if (!graphPath) {\n    const preferred = loadGraphPreferIndex(root, file);\n    if (preferred) return preferred.graph;\n  }\n  return loadGraphFileWithSnapshot(file);\n}\n"]}

package/dist/{chunk-4HFSUIIN.js → chunk-5TS7N7J2.js}

@@ -1,8 +1,8 @@
+import { lookupModelCapabilities } from './chunk-7BU7CWXC.js';
 import { resolveGgufPath } from './chunk-7AVYKZEM.js';
 import { managerFromProviderId, formatManagerBadgeLine } from './chunk-WHJMS7XC.js';
-import { lookupModelCapabilities } from './chunk-536J6HUR.js';
-import { MockProvider, LocalLlamaProvider, OPENAI_COMPATIBLE, OllamaProvider, OpenAiCompatibleProvider } from './chunk-SJFBXCII.js';
-import { CliError, ExitCode } from './chunk-FKFRASAB.js';
+import { MockProvider, LocalLlamaProvider, OPENAI_COMPATIBLE, OllamaProvider, OpenAiCompatibleProvider } from './chunk-QUI3E3TQ.js';
+import { CliError, ExitCode } from './chunk-23UPIFRU.js';
 import { discoverModels } from './chunk-CQDUBAQY.js';
 import * as fs from 'fs';
 import * as os from 'os';
@@ -148,6 +148,49 @@ function titleCase(id) {
 // src/code/text-tool-protocol.ts
 var TAG_RE = /<tool_call>\s*([\s\S]*?)\s*<\/tool_call>/g;
 var FENCE_RE = /```(?:tool_call|tool|json)?\s*\n?([\s\S]*?)```/g;
+var CALL_SYNTAX_RE = /^([A-Za-z_][\w]*)\s*\(([\s\S]*)\)\s*;?$/;
+function toCallSyntaxToolCall(blob, index, tools) {
+  if (!tools.length) return null;
+  const m = CALL_SYNTAX_RE.exec(blob.trim());
+  if (!m) return null;
+  const [, name, rawArgs] = m;
+  const spec = tools.find((t) => t.name === name);
+  if (!spec) return null;
+  const args = rawArgs.trim();
+  if (!args) return { id: `text_${index}`, name, arguments: {} };
+  if (args.startsWith("{")) {
+    try {
+      const parsed = JSON.parse(args);
+      if (parsed && typeof parsed === "object" && !Array.isArray(parsed)) {
+        return { id: `text_${index}`, name, arguments: parsed };
+      }
+    } catch {
+      return null;
+    }
+    return null;
+  }
+  const required = Array.isArray(spec.parameters?.required) ? spec.parameters.required : [];
+  if (required.length !== 1) return null;
+  const literal = parseStringLiteral(args);
+  if (literal === null) return null;
+  return { id: `text_${index}`, name, arguments: { [required[0]]: literal } };
+}
+function parseStringLiteral(src) {
+  const s = src.trim();
+  if (s.length < 2) return null;
+  const quote = s[0];
+  if (quote !== '"' && quote !== "'" && quote !== "`" || s[s.length - 1] !== quote) return null;
+  const inner = s.slice(1, -1);
+  if (new RegExp(`(?<!\\\\)${quote === "`" ? "`" : quote}`).test(inner)) return null;
+  if (quote === '"') {
+    try {
+      return JSON.parse(s);
+    } catch {
+      return null;
+    }
+  }
+  return inner.replace(/\\n/g, "\n").replace(/\\t/g, "	").replace(new RegExp(`\\\\${quote}`, "g"), quote);
+}
 function toToolCall(blob, index) {
   let parsed;
   try {
@@ -163,7 +206,7 @@ function toToolCall(blob, index) {
     arguments: args && typeof args === "object" && !Array.isArray(args) ? args : {}
   };
 }
-function parseTextToolCalls(text) {
+function parseTextToolCalls(text, tools = []) {
   const calls = [];
   let cleaned = text ?? "";
   cleaned = cleaned.replace(TAG_RE, (whole, body) => {
@@ -174,7 +217,8 @@ function parseTextToolCalls(text) {
   });
   if (calls.length === 0) {
     cleaned = cleaned.replace(FENCE_RE, (whole, body) => {
-      const call = toToolCall(body.trim(), calls.length);
+      const blob = body.trim();
+      const call = toToolCall(blob, calls.length) ?? toCallSyntaxToolCall(blob, calls.length, tools);
       if (!call) return whole;
       calls.push(call);
       return "";
@@ -188,6 +232,12 @@ function parseTextToolCalls(text) {
         calls.push(call);
         cleaned = "";
       }
+    } else {
+      const call = toCallSyntaxToolCall(t, 0, tools);
+      if (call) {
+        calls.push(call);
+        cleaned = "";
+      }
     }
   }
   return { calls, text: cleaned.trim() };
@@ -233,7 +283,7 @@ function withToolCallFallback(provider, caps) {
       if (native || !opts.tools?.length) {
         const result2 = await provider.chat(messages, opts);
         if ((!result2.toolCalls || result2.toolCalls.length === 0) && result2.text) {
-          const rescued = parseTextToolCalls(result2.text);
+          const rescued = parseTextToolCalls(result2.text, opts.tools ?? []);
           if (rescued.calls.length) return { ...result2, text: rescued.text, toolCalls: rescued.calls };
         }
         return result2;
@@ -247,7 +297,7 @@ function withToolCallFallback(provider, caps) {
         withProtocol.unshift({ role: "system", content: instruction });
       }
       const result = await provider.chat(withProtocol, { ...opts, tools: void 0 });
-      const parsed = parseTextToolCalls(result.text ?? "");
+      const parsed = parseTextToolCalls(result.text ?? "", opts.tools);
       if (parsed.calls.length) return { ...result, text: parsed.text, toolCalls: parsed.calls };
       return result;
     }
@@ -433,5 +483,5 @@ function basename(p) {
 }
 
 export { fetchCatalog, resolveProviders, topProviders };
-//# sourceMappingURL=chunk-4HFSUIIN.js.map
-//# sourceMappingURL=chunk-4HFSUIIN.js.map
+//# sourceMappingURL=chunk-5TS7N7J2.js.map
+//# sourceMappingURL=chunk-5TS7N7J2.js.map