@vibgrate/cli 2026.727.1 → 2026.727.2

package/dist/chunk-3V24O47U.js.map

@@ -0,0 +1 @@
+{"version":3,"sources":["../src/runtime/model-orchestrator.ts"],"names":[],"mappings":";;;;;;AA6BO,IAAM,iCAAA,GAAoC;AAoKjD,IAAM,YAAA,GAAe,WAAA;AASd,IAAM,eAAA,GAAmC;AAAA,EAC9C;AAAA,IACE,MAAA,EAAQ,SAAS,YAAY,CAAA,CAAA;AAAA,IAC7B,IAAA,EAAM,OAAA;AAAA,IACN,WAAA,EAAa,OAAA;AAAA,IACb,OAAA,EAAS,mEAAA;AAAA,IACT,OAAA,EAAS;AAAA,MACP,OAAA,EAAS,WAAA;AAAA,MACT,UAAA,EAAY,8BAAA;AAAA,MACZ,KAAA,EAAO,QAAA;AAAA,MACP,OAAA,EAAS,YAAA;AAAA,MACT,YAAA,EAAc,kBAAA,CAAmB,kBAAkB,CAAA,CAAE;AAAA,KACvD;AAAA,IACA,QAAA,EAAU;AAAA,MACR;AAAA,QACE,OAAA,EAAS,QAAA;AAAA,QACT,UAAA,EAAY,kBAAA;AAAA,QACZ,KAAA,EAAO,QAAA;AAAA,QACP,OAAA,EAAS,YAAA;AAAA,QACT,YAAA,EAAc,kBAAA,CAAmB,kBAAkB,CAAA,CAAE;AAAA,OACvD;AAAA,MACA;AAAA,QACE,OAAA,EAAS,QAAA;AAAA,QACT,UAAA,EAAY,oBAAA;AAAA,QACZ,KAAA,EAAO,QAAA;AAAA,QACP,OAAA,EAAS,YAAA;AAAA,QACT,YAAA,EAAc,kBAAA,CAAmB,oBAAoB,CAAA,CAAE;AAAA;AACzD,KACF;AAAA,IACA,QAAA,EAAU;AAAA,MACR,WAAA,EAAa,SAAA;AAAA,MACb,UAAA,EAAY,eAAA;AAAA,MACZ,mBAAA,EAAqB,GAAA;AAAA,MACrB,eAAA,EAAiB,CAAA;AAAA,MACjB,gBAAA,EAAkB,CAAA;AAAA,MAClB,iBAAA,EAAmB,IAAA;AAAA,MACnB,mBAAA,EAAqB,IAAA;AAAA,MACrB,kBAAA,EAAoB,WAAA;AAAA,MACpB,kBAAA,EAAoB,UAAA;AAAA,MACpB,eAAA,EAAiB,eAAA;AAAA,MACjB,YAAA,EAAc;AAAA,KAChB;AAAA,IACA,WAAW,EAAE,QAAA,EAAU,GAAG,uBAAA,EAAyB,CAAA,GAAI,OAAO,IAAA,EAAK;AAAA,IACnE,UAAA,EAAY;AAAA,MACV,KAAA,EAAO;AAAA;AACT,GACF;AAAA,EACA;AAAA,IACE,MAAA,EAAQ,QAAQ,YAAY,CAAA,CAAA;AAAA,IAC5B,IAAA,EAAM,MAAA;AAAA,IACN,WAAA,EAAa,MAAA;AAAA,IACb,OAAA,EAAS,qDAAA;AAAA,IACT,OAAA,EAAS;AAAA,MACP,OAAA,EAAS,WAAA;AAAA,MACT,UAAA,EAAY,8BAAA;AAAA,MACZ,KAAA,EAAO,QAAA;AAAA,MACP,OAAA,EAAS,YAAA;AAAA,MACT,YAAA,EAAc,kBAAA,CAAmB,kBAAkB,CAAA,CAAE;AAAA,KACvD;AAAA,IACA,QAAA,EAAU;AAAA,MACR;AAAA,QACE,OAAA,EAAS,QAAA;AAAA,QACT,UAAA,EAAY,kBAAA;AAAA,QACZ,KAAA,EAAO,QAAA;AAAA,QACP,OAAA,EAAS,YAAA;AAAA,QACT,YAAA,EAAc,kBAAA,CAAmB,kBAAkB,CAAA,CAAE;AAAA,OACvD;AAAA,MACA;AAAA,QACE,OAAA,EAAS,QAAA;AAAA,QACT,UAAA,EAAY,kBAAA;AAAA,QACZ,KAAA,EAAO,QAAA;AAAA,QACP,OAAA,EAAS,YAAA;AAAA,QACT,YAAA,EAAc,kBAAA,CAAmB,kBAAkB,CAAA,CAAE;AAAA;AACvD,KACF;AAAA,IACA,QAAA,EAAU;AAAA,MACR,WAAA,EAAa,QAAA;AAAA,MACb,UAAA,EAAY,MAAA;AAAA,MACZ,mBAAA,EAAqB,IAAA;AAAA,MACrB,eAAA,EAAiB,CAAA;AAAA,MACjB,gBAAA,EAAkB,CAAA;AAAA,MAClB,iBAAA,EAAmB,IAAA;AAAA,MACnB,mBAAA,EAAqB,KAAA;AAAA,MACrB,kBAAA,EAAoB,WAAA;AAAA,MACpB,kBAAA,EAAoB,UAAA;AAAA,MACpB,eAAA,EAAiB,eAAA;AAAA,MACjB,YAAA,EAAc;AAAA,KAChB;AAAA,IACA,SAAA,EAAW,EAAE,QAAA,EAAU,CAAA,EAAG,WAAW,CAAA,EAAG,uBAAA,EAAyB,CAAA,GAAI,IAAA,GAAO,IAAA,EAAK;AAAA,IACjF,UAAA,EAAY;AAAA,MACV,KAAA,EAAO;AAAA;AACT,GACF;AAAA,EACA;AAAA,IACE,MAAA,EAAQ,SAAS,YAAY,CAAA,CAAA;AAAA,IAC7B,IAAA,EAAM,OAAA;AAAA,IACN,WAAA,EAAa,OAAA;AAAA,IACb,OAAA,EAAS,gEAAA;AAAA,IACT,OAAA,EAAS;AAAA,MACP,OAAA,EAAS,QAAA;AAAA,MACT,UAAA,EAAY,mBAAA;AAAA,MACZ,KAAA,EAAO,QAAA;AAAA,MACP,OAAA,EAAS,YAAA;AAAA,MACT,YAAA,EAAc,kBAAA,CAAmB,mBAAmB,CAAA,CAAE;AAAA,KACxD;AAAA,IACA,QAAA,EAAU;AAAA,MACR;AAAA,QACE,OAAA,EAAS,QAAA;AAAA,QACT,UAAA,EAAY,kBAAA;AAAA,QACZ,KAAA,EAAO,QAAA;AAAA,QACP,OAAA,EAAS,YAAA;AAAA,QACT,YAAA,EAAc,kBAAA,CAAmB,kBAAkB,CAAA,CAAE;AAAA;AACvD,KACF;AAAA,IACA,QAAA,EAAU;AAAA,MACR,WAAA,EAAa,QAAA;AAAA,MACb,UAAA,EAAY,eAAA;AAAA,MACZ,mBAAA,EAAqB,GAAA;AAAA,MACrB,eAAA,EAAiB,CAAA;AAAA,MACjB,gBAAA,EAAkB,CAAA;AAAA,MAClB,iBAAA,EAAmB,GAAA;AAAA,MACnB,mBAAA,EAAqB,KAAA;AAAA,MACrB,kBAAA,EAAoB,QAAA;AAAA,MACpB,eAAA,EAAiB,eAAA;AAAA,MACjB,YAAA,EAAc;AAAA,KAChB;AAAA,IACA,SAAA,EAAW,EAAE,QAAA,EAAU,EAAA,EAAI,WAAW,EAAA,EAAI,uBAAA,EAAyB,CAAA,GAAI,IAAA,GAAO,IAAA,EAAK;AAAA,IACnF,UAAA,EAAY,EAAE,KAAA,EAAO,qFAAA;AAAiF;AAE1G;AAEA,IAAM,MAAM,IAAA,IAAQ,CAAA;AAWpB,IAAM,gBAAA,GAAmB;AAAA,EACvB,UAAU,GAAA,GAAM,GAAA;AAAA,EAChB,SAAS,CAAA,GAAI,GAAA;AAAA,EACb,YAAY,GAAA,GAAM,GAAA;AAAA,EAClB,YAAY,IAAA,GAAO,GAAA;AAAA,EACnB,mBAAmB,CAAA,GAAI;AACzB,CAAA;AAGA,IAAM,sBAAA,GAAyB,IAAA;AAIxB,SAAS,WAAA,CAAY,IAAA,EAAiB,KAAA,GAAyB,eAAA,EAAuC;AAC3G,EAAA,OAAO,MAAM,IAAA,CAAK,CAAC,MAAM,CAAA,CAAE,IAAA,KAAS,IAAI,CAAA,IAAK,IAAA;AAC/C;AAEO,SAAS,QAAA,CAAS,MAAA,EAAgB,KAAA,GAAyB,eAAA,EAAuC;AACvG,EAAA,OAAO,MAAM,IAAA,CAAK,CAAC,MAAM,CAAA,CAAE,MAAA,KAAW,MAAM,CAAA,IAAK,IAAA;AACnD;AAEO,SAAS,SAAA,GAAyB;AACvC,EAAA,OAAO,CAAC,OAAA,EAAS,MAAA,EAAQ,OAAO,CAAA;AAClC;AAUO,SAAS,QAAQ,KAAA,EAA4B;AAClD,EAAA,MAAM,IAAI,EAAE,GAAG,gBAAA,EAAkB,GAAG,MAAM,QAAA,EAAS;AACnD,EAAA,MAAM,OAAO,KAAA,CAAM,IAAA;AACnB,EAAA,MAAM,YAAA,GACJ,KAAK,OAAA,CAAQ,YAAA,IACb,mBAAmB,IAAA,CAAK,OAAA,CAAQ,UAAU,CAAA,CAAE,KAAA;AAC9C,EAAA,MAAM,SAAA,GAAY,KAAA,CAAM,mBAAA,IAAuB,IAAA,CAAK,SAAS,mBAAA,GAAsB,CAAA;AACnF,EAAA,MAAM,OAAA,GAAU,IAAA,CAAK,SAAA,CAAU,uBAAA,IAA2B,IAAI,IAAA,GAAO,IAAA;AACrE,EAAA,MAAM,OAAA,GAAU,IAAA,CAAK,KAAA,CAAO,SAAA,GAAY,MAAQ,OAAO,CAAA;AACvD,EAAA,MAAM,UAAA,GAAa,YAAA;AACnB,EAAA,MAAM,YAAY,UAAA,GAAa,OAAA;AAE/B,EAAA,MAAM,OAAA,GACJ,OAAO,KAAA,CAAM,MAAA,CAAO,mBAAmB,QAAA,IAAY,KAAA,CAAM,OAAO,cAAA,GAAiB,CAAA;AACnF,EAAA,MAAM,UAAU,OAAA,GACX,KAAA,CAAM,OAAO,aAAA,IAAiB,CAAA,GAC/B,MAAM,MAAA,CAAO,YAAA;AACjB,EAAA,MAAM,WAAA,GAAc,KAAA,CAAM,MAAA,CAAO,MAAA,CAAO,MAAA,CAAO,CAAC,CAAA,EAAG,CAAA,KAAM,CAAA,GAAI,CAAA,CAAE,KAAA,EAAO,CAAC,CAAA;AAEvE,EAAA,MAAM,WAAW,OAAA,GAAU,WAAA;AAE3B,EAAA,MAAM,SAAA,GAAA,CACH,KAAA,CAAM,IAAA,EAAM,cAAA,IAAkB,KAAK,GAAA,GAChC,GAAA,GAAM,GAAA,GAAA,CACL,KAAA,CAAM,IAAA,EAAM,SAAA,IAAa,CAAA,IAAK,GAAA,GAC7B,OAAO,GAAA,GACP,CAAA;AACR,EAAA,MAAM,UAAA,GAAa,EAAE,UAAA,GAAa,SAAA;AAKlC,EAAA,MAAM,QAAA,GAAW,OAAA,GACb,CAAA,CAAE,iBAAA,GACF,UAAA,GACA,CAAA,CAAE,UAAA,GACF,CAAA,CAAE,iBAAA,GACF,sBAAA,IAA0B,CAAA,CAAE,QAAA,GAAW,CAAA,CAAE,OAAA,CAAA;AAC7C,EAAA,MAAM,iBAAA,GAAoB,IAAA,CAAK,GAAA,CAAI,CAAA,EAAG,WAAW,QAAQ,CAAA;AAEzD,EAAA,MAAM,cAAA,GAAiB,iBAAA;AACvB,EAAA,MAAM,UAAoB,EAAC;AAC3B,EAAA,MAAM,WAAW,cAAA,GAAiB,SAAA;AAClC,EAAA,MAAM,KAAA,GAAQ,SAAA,GAAY,CAAA,GAAI,cAAA,GAAiB,SAAA,GAAY,CAAA;AAE3D,EAAA,IAAI,KAAA;AACJ,EAAA,IAAI,0BAAA;AAEJ,EAAA,IAAI,cAAA,GAAiB,YAAY,IAAA,EAAM;AACrC,IAAA,KAAA,GAAQ,cAAA;AACR,IAAA,OAAA,CAAQ,IAAA;AAAA,MACN,UAAU,KAAA,CAAM,SAAS,CAAC,CAAA,WAAA,EAAc,KAAA,CAAM,cAAc,CAAC,CAAA,uBAAA;AAAA,KAC/D;AAAA,EACF,CAAA,MAAA,IAAW,KAAA,GAAQ,GAAA,IAAO,QAAA,GAAW,MAAM,GAAA,EAAK;AAC9C,IAAA,KAAA,GAAQ,OAAA;AACR,IAAA,0BAAA,GAA6B,IAAA,CAAK,GAAA;AAAA,MAChC,IAAA;AAAA,MACA,IAAA,CAAK,KAAA,CAAM,IAAA,CAAK,QAAA,CAAS,sBAAsB,IAAI;AAAA,KACrD;AACA,IAAA,OAAA,CAAQ,KAAK,+DAA0D,CAAA;AAAA,EACzE,CAAA,MAAA,IAAW,KAAA,IAAS,GAAA,IAAO,QAAA,IAAY,IAAI,GAAA,EAAK;AAC9C,IAAA,KAAA,GAAQ,OAAA;AACR,IAAA,OAAA,CAAQ,KAAK,oCAAoC,CAAA;AAAA,EACnD,CAAA,MAAO;AACL,IAAA,KAAA,GAAQ,aAAA;AACR,IAAA,OAAA,CAAQ,KAAK,gCAAgC,CAAA;AAAA,EAC/C;AAGA,EAAA,IACE,IAAA,CAAK,IAAA,KAAS,OAAA,KAAA,CACZ,KAAA,CAAM,MAAM,SAAA,IAAa,CAAA,IAAK,GAAA,IAAA,CAAW,KAAA,CAAM,IAAA,EAAM,cAAA,IAAkB,CAAA,IAAK,GAAA,CAAA,IAC9E,UAAU,aAAA,EACV;AACA,IAAA,OAAA,CAAQ,KAAK,iEAA4D,CAAA;AAAA,EAC3E;AAGA,EAAA,IAAI,KAAA,GAAQ,IAAA,CAAK,GAAA,CAAI,CAAA,EAAG,IAAA,CAAK,GAAA,CAAI,GAAA,EAAK,IAAA,CAAK,KAAA,CAAM,KAAA,GAAQ,EAAE,CAAC,CAAC,CAAA;AAC7D,EAAA,IAAI,UAAU,cAAA,EAAgB,KAAA,GAAQ,IAAA,CAAK,GAAA,CAAI,OAAO,EAAE,CAAA;AACxD,EAAA,IAAI,KAAA,KAAU,OAAA,EAAS,KAAA,GAAQ,IAAA,CAAK,GAAA,CAAI,KAAK,GAAA,CAAI,KAAA,EAAO,EAAE,CAAA,EAAG,EAAE,CAAA;AAC/D,EAAA,IAAI,KAAA,KAAU,aAAA,EAAe,KAAA,GAAQ,IAAA,CAAK,GAAA,CAAI,KAAK,GAAA,CAAI,KAAA,EAAO,EAAE,CAAA,EAAG,EAAE,CAAA;AACrE,EAAA,IAAI,UAAU,OAAA,EAAS,KAAA,GAAQ,IAAA,CAAK,GAAA,CAAI,OAAO,EAAE,CAAA;AAEjD,EAAA,OAAO;AAAA,IACL,KAAA;AAAA,IACA,KAAA;AAAA,IACA,SAAA;AAAA,IACA,cAAA;AAAA,IACA,SAAA,EAAW;AAAA,MACT,UAAA;AAAA,MACA,OAAA;AAAA;AAAA,MAEA,QAAA,EAAU,OAAA,GAAU,CAAA,GAAI,sBAAA,GAAyB,CAAA,CAAE,QAAA;AAAA,MACnD,OAAA,EAAS,OAAA,GAAU,CAAA,GAAI,sBAAA,GAAyB,CAAA,CAAE,OAAA;AAAA,MAClD,UAAA,EAAY,UAAU,CAAA,GAAI,UAAA;AAAA,MAC1B,UAAA,EAAY,OAAA,GAAU,CAAA,GAAI,CAAA,CAAE,UAAA;AAAA,MAC5B,sBAAA,EAAwB;AAAA,KAC1B;AAAA,IACA,0BAAA;AAAA,IACA;AAAA,GACF;AACF;AAEA,SAAS,MAAM,KAAA,EAAuB;AACpC,EAAA,OAAO,CAAA,EAAA,CAAI,KAAA,GAAQ,GAAA,EAAK,OAAA,CAAQ,CAAC,CAAC,CAAA,IAAA,CAAA;AACpC;AAmBA,SAAS,aAAA,CAAc,IAAA,EAAqB,UAAA,EAA4B,GAAA,EAAuC;AAC7G,EAAA,MAAM,MAAA,GACJ,IAAI,KAAA,KAAU,OAAA,IAAW,IAAI,0BAAA,GACzB,GAAA,CAAI,0BAAA,GACJ,IAAA,CAAK,QAAA,CAAS,mBAAA;AACpB,EAAA,OAAO;AAAA,IACL,aAAA,EAAe,sCAAA;AAAA,IACf,IAAI,UAAA,CAAW,UAAA;AAAA,IACf,aAAa,CAAA,EAAG,IAAA,CAAK,WAAW,CAAA,MAAA,EAAM,WAAW,UAAU,CAAA,CAAA;AAAA,IAC3D,MAAM,IAAA,CAAK,IAAA;AAAA,IACX,OAAA,EACE,UAAA,CAAW,OAAA,KAAY,QAAA,GACnB,QAAA,GACA,UAAA,CAAW,OAAA,KAAY,WAAA,GACrB,WAAA,GACA,UAAA,CAAW,OAAA,KAAY,WAAA,GACrB,mBAAA,GACA,OAAA;AAAA,IACV,WAAA,EAAa,KAAK,QAAA,CAAS,WAAA;AAAA,IAC3B,UAAA,EAAY,KAAK,QAAA,CAAS,UAAA;AAAA,IAC1B,mBAAA,EAAqB,MAAA;AAAA,IACrB,gBAAA,EAAkB,KAAK,QAAA,CAAS,gBAAA;AAAA,IAChC,eAAA,EAAiB,KAAK,QAAA,CAAS,eAAA;AAAA,IAC/B,WAAA,EAAa,CAAA;AAAA,IACb,mBAAA,EAAqB,IAAA,CAAK,QAAA,CAAS,mBAAA,IAAuB,KAAA;AAAA,IAC1D,eAAA,EAAiB,KAAK,QAAA,CAAS,eAAA;AAAA,IAC/B,SAAA,EAAW;AAAA,MACT,QAAA,EAAU,KAAK,SAAA,CAAU,QAAA;AAAA,MACzB,SAAA,EAAW,KAAK,SAAA,CAAU,SAAA;AAAA,MAC1B,OAAO,UAAA,CAAW;AAAA,KACpB;AAAA,IACA,YAAA,EAAc,KAAK,QAAA,CAAS,YAAA;AAAA,IAC5B,kBAAA,EAAoB,IAAA,CAAK,QAAA,CAAS,kBAAA,IAAsB;AAAA,GAC1D;AACF;AAEA,SAAS,UAAA,CACP,IAAA,EACA,OAAA,EACA,MAAA,EACA,MACA,SAAA,EACgD;AAChD,EAAA,MAAM,KAAA,GAAuB,EAAE,GAAG,IAAA,EAAM,SAAS,OAAA,EAAQ;AACzD,EAAA,OAAO,EAAE,GAAA,EAAK,OAAA,CAAQ,EAAE,MAAA,EAAQ,IAAA,EAAM,KAAA,EAAO,IAAgB,CAAC,CAAA,EAAG,UAAA,EAAY,OAAA,EAAQ;AACvF;AAOO,SAAS,YAAY,IAAA,EAAwC;AAClE,EAAA,MAAM,KAAA,GAAQ,KAAK,KAAA,IAAS,eAAA;AAC5B,EAAA,MAAM,WAAA,GAAc,KAAK,WAAA,IAAe,MAAA;AACxC,EAAA,IAAI,IAAA,GAAkB,KAAK,IAAA,IAAQ,WAAA;AACnC,EAAA,IAAI,SAAA,GAAuC,IAAA,CAAK,IAAA,GAAO,UAAA,GAAa,SAAA;AAEpE,EAAA,IAAI,CAAC,IAAA,CAAK,IAAA,IAAQ,IAAA,CAAK,YAAY,KAAA,EAAO;AACxC,IAAA,IAAA,GAAO,aAAA,CAAc,IAAA,CAAK,MAAA,EAAQ,IAAA,CAAK,MAAM,KAAK,CAAA;AAClD,IAAA,SAAA,GAAY,UAAA;AAAA,EACd;AAEA,EAAA,IAAI,IAAA,GAAO,WAAA,CAAY,IAAA,EAAM,KAAK,CAAA;AAClC,EAAA,IAAI,CAAC,IAAA,EAAM;AACT,IAAA,IAAA,GAAO,WAAA,CAAY,QAAQ,KAAK,CAAA;AAChC,IAAA,IAAA,GAAO,MAAA;AACP,IAAA,SAAA,GAAY,SAAA;AAAA,EACd;AAEA,EAAA,IAAI,IAAA,CAAK,GAAA,IAAO,IAAA,CAAK,GAAA,CAAI,SAAS,IAAA,EAAM;AACtC,IAAA,MAAM,MAAA,GAAS,QAAA,CAAS,IAAA,CAAK,GAAA,CAAI,QAAQ,KAAK,CAAA;AAC9C,IAAA,IAAI,MAAA,IAAU,MAAA,CAAO,IAAA,KAAS,IAAA,EAAM;AAClC,MAAA,IAAA,GAAO,MAAA;AACP,MAAA,SAAA,GAAY,QAAA;AAAA,IACd;AAAA,EACF;AAEA,EAAA,MAAM,UAAA,GAAa,CAAC,IAAA,CAAK,OAAA,EAAS,GAAI,IAAA,CAAK,QAAA,IAAY,EAAG,CAAA;AAC1D,EAAA,IAAI,IAAA,GAA8D,IAAA;AAElE,EAAA,KAAA,MAAW,KAAK,UAAA,EAAY;AAC1B,IAAA,MAAM,KAAA,GAAQ,WAAW,IAAA,EAAM,CAAA,EAAG,KAAK,MAAA,EAAQ,IAAA,CAAK,IAAA,EAAM,IAAA,CAAK,SAAS,CAAA;AACxE,IAAA,IAAI,CAAC,IAAA,IAAQ,OAAA,CAAQ,KAAA,CAAM,GAAG,IAAI,OAAA,CAAQ,IAAA,CAAK,GAAG,CAAA,EAAG,IAAA,GAAO,KAAA;AAC5D,IAAA,IAAI,MAAM,GAAA,CAAI,KAAA,KAAU,WAAW,KAAA,CAAM,GAAA,CAAI,UAAU,aAAA,EAAe;AACpE,MAAA,IAAA,GAAO,KAAA;AACP,MAAA;AAAA,IACF;AAAA,EACF;AAEA,EAAA,MAAM,MAAA,GAAS,IAAA,IAAQ,UAAA,CAAW,IAAA,EAAM,IAAA,CAAK,OAAA,EAAS,IAAA,CAAK,MAAA,EAAQ,IAAA,CAAK,IAAA,EAAM,IAAA,CAAK,SAAS,CAAA;AAC5F,EAAA,MAAM,UAAU,aAAA,CAAc,IAAA,EAAM,MAAA,CAAO,UAAA,EAAY,OAAO,GAAG,CAAA;AAEjE,EAAA,OAAO;AAAA,IACL,aAAA,EAAe,iCAAA;AAAA,IACf,IAAA;AAAA,IACA,IAAA;AAAA,IACA,YAAY,MAAA,CAAO,UAAA;AAAA,IACnB,KAAK,MAAA,CAAO,GAAA;AAAA,IACZ,OAAA;AAAA,IACA,QAAQ,SAAA,KAAc,QAAA;AAAA,IACtB;AAAA,GACF;AACF;AAEA,SAAS,QAAQ,CAAA,EAAsB;AACrC,EAAA,MAAM,KAAA,GAAkC;AAAA,IACtC,KAAA,EAAO,CAAA;AAAA,IACP,WAAA,EAAa,CAAA;AAAA,IACb,KAAA,EAAO,CAAA;AAAA,IACP,YAAA,EAAc;AAAA,GAChB;AACA,EAAA,OAAO,KAAA,CAAM,CAAA,CAAE,KAAK,CAAA,GAAI,MAAO,CAAA,CAAE,KAAA;AACnC;AAMO,SAAS,aAAA,CACd,MAAA,EACA,IAAA,EACA,KAAA,GAAyB,eAAA,EACd;AACX,EAAA,MAAM,KAAA,GAAqB,CAAC,OAAA,EAAS,MAAA,EAAQ,OAAO,CAAA;AACpD,EAAA,IAAI,SAAA,GAA8B,IAAA;AAClC,EAAA,KAAA,MAAW,QAAQ,KAAA,EAAO;AACxB,IAAA,MAAM,IAAA,GAAO,WAAA,CAAY,IAAA,EAAM,KAAK,CAAA;AACpC,IAAA,IAAI,CAAC,IAAA,EAAM;AACX,IAAA,MAAM,WAAW,WAAA,CAAY;AAAA,MAC3B,IAAA;AAAA,MACA,OAAA,EAAS,KAAA;AAAA,MACT,MAAA;AAAA,MACA,IAAA;AAAA,MACA;AAAA,KACD,CAAA;AACD,IAAA,IAAI,SAAS,GAAA,CAAI,KAAA,KAAU,WAAW,QAAA,CAAS,GAAA,CAAI,UAAU,aAAA,EAAe;AAE1E,MAAA,IAAI,SAAS,OAAA,EAAS;AACpB,QAAA,MAAM,IAAA,GAAO,WAAA,CAAY,EAAE,IAAA,EAAM,MAAA,EAAQ,SAAS,KAAA,EAAO,MAAA,EAAQ,IAAA,EAAM,KAAA,EAAO,CAAA;AAC9E,QAAA,IAAI,KAAK,GAAA,CAAI,KAAA,KAAU,WAAW,IAAA,CAAK,GAAA,CAAI,UAAU,aAAA,EAAe;AAClE,UAAA,MAAM,KAAA,GAAQ,MAAM,SAAA,IAAa,CAAA;AACjC,UAAA,IAAI,KAAA,GAAQ,KAAM,OAAO,MAAA;AAAA,QAC3B;AACA,QAAA,OAAO,OAAA;AAAA,MACT;AACA,MAAA,OAAO,IAAA;AAAA,IACT;AACA,IAAA,IAAI,SAAS,GAAA,CAAI,KAAA,KAAU,OAAA,IAAW,CAAC,WAAW,SAAA,GAAY,IAAA;AAAA,EAChE;AACA,EAAA,OAAO,SAAA,IAAa,OAAA;AACtB;AAGO,SAAS,wBAAwB,IAAA,EASjB;AACrB,EAAA,MAAM,KAAA,GAAQ,KAAK,KAAA,IAAS,eAAA;AAC5B,EAAA,MAAM,SAAA,GAAY,IAAI,GAAA,CAAA,CAAK,IAAA,CAAK,cAAA,IAAkB,EAAC,EAAG,GAAA,CAAI,CAAC,CAAA,KAAM,CAAA,CAAE,WAAA,EAAa,CAAC,CAAA;AACjF,EAAA,MAAM,cAAc,aAAA,CAAc,IAAA,CAAK,MAAA,EAAQ,IAAA,CAAK,MAAM,KAAK,CAAA;AAC/D,EAAA,MAAM,MAAA,GAAS,CAAC,IAAA,KAAgE;AAC9E,IAAA,MAAM,OAAA,GAAU,IAAA,CAAK,IAAA,GAAO,IAAI,CAAA;AAChC,IAAA,IAAI,OAAA,EAAS,OAAO,EAAE,IAAA,EAAM,QAAQ,OAAA,EAAQ;AAC5C,IAAA,IAAI,IAAA,CAAK,GAAA,EAAK,IAAA,KAAS,IAAA,SAAa,IAAA,CAAK,GAAA;AACzC,IAAA,OAAO,IAAA;AAAA,EACT,CAAA;AACA,EAAA,MAAM,KAAA,GAAQ,SAAA,EAAU,CAAE,GAAA,CAAI,CAAC,IAAA,KAAS;AACtC,IAAA,MAAM,WAAW,WAAA,CAAY;AAAA,MAC3B,IAAA;AAAA,MACA,OAAA,EAAS,KAAA;AAAA,MACT,QAAQ,IAAA,CAAK,MAAA;AAAA,MACb,MAAM,IAAA,CAAK,IAAA;AAAA,MACX,GAAA,EAAK,OAAO,IAAI,CAAA;AAAA,MAChB;AAAA,KACD,CAAA;AACD,IAAA,MAAM,EAAA,GAAK,QAAA,CAAS,UAAA,CAAW,UAAA,CAAW,WAAA,EAAY;AACtD,IAAA,MAAM,eACJ,SAAA,CAAU,GAAA,CAAI,EAAE,CAAA,IAChB,CAAC,GAAG,SAAS,CAAA,CAAE,KAAK,CAAC,CAAA,KAAM,EAAE,QAAA,CAAS,EAAE,KAAK,EAAA,CAAG,QAAA,CAAS,CAAC,CAAC,CAAA;AAC7D,IAAA,OAAO;AAAA,MACL,IAAA;AAAA,MACA,MAAA,EAAQ,SAAS,IAAA,CAAK,MAAA;AAAA,MACtB,WAAA,EAAa,SAAS,IAAA,CAAK,WAAA;AAAA,MAC3B,OAAA,EAAS,SAAS,IAAA,CAAK,OAAA;AAAA,MACvB,iBAAA,EAAmB,SAAS,UAAA,CAAW,UAAA;AAAA,MACvC,OAAA,EAAS,SAAS,UAAA,CAAW,OAAA;AAAA,MAC7B,GAAA,EAAK,SAAS,GAAA,CAAI,KAAA;AAAA,MAClB,QAAA,EAAU,SAAS,GAAA,CAAI,KAAA;AAAA,MACvB,SAAA,EAAW,SAAS,GAAA,CAAI,SAAA;AAAA,MACxB,cAAA,EAAgB,SAAS,GAAA,CAAI,cAAA;AAAA,MAC7B,SAAA,EAAW,YAAA;AAAA,MACX,QAAQ,QAAA,CAAS;AAAA,KACnB;AAAA,EACF,CAAC,CAAA;AAED,EAAA,MAAM,cAAc,WAAA,CAAY;AAAA,IAC9B,IAAA,EAAM,WAAA;AAAA,IACN,OAAA,EAAS,KAAA;AAAA,IACT,QAAQ,IAAA,CAAK,MAAA;AAAA,IACb,MAAM,IAAA,CAAK,IAAA;AAAA,IACX,GAAA,EAAK,OAAO,WAAW,CAAA;AAAA,IACvB;AAAA,GACD,CAAA;AAED,EAAA,OAAO;AAAA,IACL,aAAA,EAAe,iCAAA;AAAA,IACf,WAAA,EAAa,KAAK,WAAA,IAAe,MAAA;AAAA,IACjC,GAAA,EAAK,OAAO,WAAW,CAAA;AAAA,IACvB,KAAA;AAAA,IACA,WAAA;AAAA,IACA,MAAA,EAAQ;AAAA,MACN,aAAA,EAAe,KAAK,MAAA,CAAO,aAAA;AAAA,MAC3B,YAAA,EAAc,KAAK,MAAA,CAAO,YAAA;AAAA,MAC1B,GAAI,OAAO,IAAA,CAAK,MAAA,CAAO,cAAA,KAAmB,QAAA,GACtC,EAAE,cAAA,EAAgB,IAAA,CAAK,MAAA,CAAO,cAAA,EAAe,GAC7C,EAAC;AAAA,MACL,GAAI,OAAO,IAAA,CAAK,MAAA,CAAO,aAAA,KAAkB,QAAA,GACrC,EAAE,aAAA,EAAe,IAAA,CAAK,MAAA,CAAO,aAAA,EAAc,GAC3C,EAAC;AAAA,MACL,MAAA,EAAQ,IAAA,CAAK,MAAA,CAAO,MAAA,CAAO,IAAI,CAAC,CAAA,MAAO,EAAE,IAAA,EAAM,CAAA,CAAE,IAAA,EAAM,KAAA,EAAO,CAAA,CAAE,OAAM,CAAE;AAAA,KAC1E;AAAA,IACA,eAAA,EAAiB,YAAY,GAAA,CAAI;AAAA,GACnC;AACF;AAaO,SAAS,sBACd,GAAA,GAAyB,OAAA,CAAQ,KACjC,QAAA,GAA4B,OAAA,CAAQ,UACpC,IAAA,EACQ;AACR,EAAA,OAAY,UAAK,eAAA,CAAgB,GAAA,EAAK,UAAU,IAAI,CAAA,EAAG,sBAAsB,YAAY,CAAA;AAC3F;AAEO,SAAS,sBACd,GAAA,GAAyB,OAAA,CAAQ,KACjC,QAAA,GAA4B,OAAA,CAAQ,UACpC,IAAA,EACsB;AACtB,EAAA,MAAM,CAAA,GAAI,qBAAA,CAAsB,GAAA,EAAK,QAAA,EAAU,IAAI,CAAA;AACnD,EAAA,IAAI;AACF,IAAA,MAAM,MAAM,IAAA,CAAK,KAAA,CAAS,EAAA,CAAA,YAAA,CAAa,CAAA,EAAG,MAAM,CAAC,CAAA;AACjD,IAAA,OAAO;AAAA,MACL,aAAA,EAAe,0BAAA;AAAA,MACf,IAAA,EAAM,IAAI,IAAA,IAAQ,OAAO,IAAI,IAAA,KAAS,QAAA,GAAW,GAAA,CAAI,IAAA,GAAO,EAAC;AAAA,MAC7D,WAAA,EACE,GAAA,CAAI,WAAA,KAAgB,OAAA,IAAW,GAAA,CAAI,WAAA,KAAgB,MAAA,IAAU,GAAA,CAAI,WAAA,KAAgB,OAAA,GAC7E,GAAA,CAAI,WAAA,GACJ,KAAA,CAAA;AAAA,MACN,SAAA,EAAW,OAAO,GAAA,CAAI,SAAA,KAAc,QAAA,GAAW,GAAA,CAAI,SAAA,GAAA,iBAAY,IAAI,IAAA,CAAK,CAAC,CAAA,EAAE,WAAA;AAAY,KACzF;AAAA,EACF,CAAA,CAAA,MAAQ;AACN,IAAA,OAAO;AAAA,MACL,aAAA,EAAe,0BAAA;AAAA,MACf,MAAM,EAAC;AAAA,MACP,SAAA,EAAA,iBAAW,IAAI,IAAA,CAAK,CAAC,GAAE,WAAA;AAAY,KACrC;AAAA,EACF;AACF;AAEO,SAAS,sBAAA,CACd,OACA,GAAA,GAAyB,OAAA,CAAQ,KACjC,QAAA,GAA4B,OAAA,CAAQ,UACpC,IAAA,EACQ;AACR,EAAA,MAAM,CAAA,GAAI,qBAAA,CAAsB,GAAA,EAAK,QAAA,EAAU,IAAI,CAAA;AACnD,EAAG,aAAe,IAAA,CAAA,OAAA,CAAQ,CAAC,GAAG,EAAE,SAAA,EAAW,MAAM,CAAA;AACjD,EAAA,MAAM,IAAA,GAA6B;AAAA,IACjC,GAAG,KAAA;AAAA,IACH,aAAA,EAAe,0BAAA;AAAA,IACf,SAAA,EAAA,iBAAW,IAAI,IAAA,EAAK,EAAE,WAAA;AAAY,GACpC;AACA,EAAG,EAAA,CAAA,aAAA,CAAc,GAAG,IAAA,CAAK,SAAA,CAAU,MAAM,IAAA,EAAM,CAAC,CAAA,GAAI,IAAA,EAAM,MAAM,CAAA;AAChE,EAAA,OAAO,CAAA;AACT;AAEO,SAAS,OAAA,CACd,IAAA,EACA,MAAA,EACA,GAAA,EACA,UACA,IAAA,EACsB;AACtB,EAAA,MAAM,KAAA,GAAQ,qBAAA,CAAsB,GAAA,EAAK,QAAA,EAAU,IAAI,CAAA;AACvD,EAAA,IAAI,CAAC,QAAA,CAAS,MAAM,CAAA,EAAG;AACrB,IAAA,MAAM,IAAI,KAAA,CAAM,CAAA,iBAAA,EAAoB,MAAM,CAAA,CAAE,CAAA;AAAA,EAC9C;AACA,EAAA,KAAA,CAAM,IAAA,CAAK,IAAI,CAAA,GAAI,MAAA;AACnB,EAAA,sBAAA,CAAuB,KAAA,EAAO,GAAA,EAAK,QAAA,EAAU,IAAI,CAAA;AACjD,EAAA,OAAO,KAAA;AACT;AAEO,SAAS,SAAA,CACd,IAAA,EACA,GAAA,EACA,QAAA,EACA,IAAA,EACsB;AACtB,EAAA,MAAM,KAAA,GAAQ,qBAAA,CAAsB,GAAA,EAAK,QAAA,EAAU,IAAI,CAAA;AACvD,EAAA,OAAO,KAAA,CAAM,KAAK,IAAI,CAAA;AACtB,EAAA,sBAAA,CAAuB,KAAA,EAAO,GAAA,EAAK,QAAA,EAAU,IAAI,CAAA;AACjD,EAAA,OAAO,KAAA;AACT;AAEO,SAAS,cAAA,CACd,IAAA,EACA,GAAA,EACA,QAAA,EACA,IAAA,EACsB;AACtB,EAAA,MAAM,KAAA,GAAQ,qBAAA,CAAsB,GAAA,EAAK,QAAA,EAAU,IAAI,CAAA;AACvD,EAAA,KAAA,CAAM,WAAA,GAAc,IAAA;AACpB,EAAA,sBAAA,CAAuB,KAAA,EAAO,GAAA,EAAK,QAAA,EAAU,IAAI,CAAA;AACjD,EAAA,OAAO,KAAA;AACT;AAGO,SAAS,SAAA,CACd,IAAA,EACA,KAAA,GAA8B,qBAAA,EAAsB,EACR;AAC5C,EAAA,MAAM,MAAA,GAAS,KAAA,CAAM,IAAA,CAAK,IAAI,CAAA;AAC9B,EAAA,OAAO,MAAA,GAAS,EAAE,IAAA,EAAM,MAAA,EAAO,GAAI,IAAA;AACrC;AAGO,SAAS,mBAAmB,OAAA,EAA4C;AAC7E,EAAA,QAAQ,OAAA;AAAS,IACf,KAAK,QAAA;AACH,MAAA,OAAO,QAAA;AAAA,IACT,KAAK,WAAA;AACH,MAAA,OAAO,WAAA;AAAA,IACT,KAAK,WAAA;AACH,MAAA,OAAO,UAAA;AAAA,IACT;AACE,MAAA,OAAO,QAAA;AAAA;AAEb;AAGO,SAAS,UAAU,GAAA,EAAkD;AAC1E,EAAA,IAAI,CAAC,KAAK,OAAO,IAAA;AACjB,EAAA,MAAM,CAAA,GAAI,GAAA,CAAI,IAAA,EAAK,CAAE,WAAA,EAAY;AACjC,EAAA,IAAI,MAAM,OAAA,IAAW,CAAA,KAAM,MAAA,IAAU,CAAA,KAAM,SAAS,OAAO,CAAA;AAC3D,EAAA,OAAO,IAAA;AACT","file":"chunk-3V24O47U.js","sourcesContent":["/**\n * Vibgrate Model Orchestrator — Code Modes (Spark / Flow / Forge).\n *\n * Product stance (PRD): users and agents select outcome-oriented **Code Modes**,\n * never GGUF names by default. This module:\n *  1. Declares versioned **qualified packs** (contract + primary/fallback weights)\n *  2. Runs a **fit** algorithm (available memory now × reserves × repo signals)\n *  3. Resolves mode → pack → concrete model / backend\n *  4. Supports pin/unpin for reproducibility\n *\n * Pure resolve + fit helpers have no I/O. Registry pin state uses the global\n * Vibgrate data dir (never in-repo). Pull/ensure is a separate CLI concern that\n * calls into `vg models pull` after resolve.\n *\n * schemaVersion: model-orchestrator/0\n */\n\nimport * as fs from 'node:fs';\nimport * as path from 'node:path';\nimport { estimateModelBytes, type SystemMemory } from '../code/capability.js';\nimport {\n  MODEL_EXECUTION_PROFILE_SCHEMA_VERSION,\n  type ModelExecutionProfile,\n  type ModelMode,\n  type ToolCallingMode,\n  type EditFormatPreference,\n} from './model-execution-profile.js';\nimport { vibgrateDataDir } from './paths.js';\n\nexport const MODEL_ORCHESTRATOR_SCHEMA_VERSION = 'model-orchestrator/0' as const;\n\n/** UX fit vocabulary (stricter than “weights fit”). */\nexport type FitLabel = 'flies' | 'comfortable' | 'tight' | 'will_not_fit';\n\nexport type TaskClass = 'spark_task' | 'flow_task' | 'forge_task' | 'explicit_mode';\n\nexport interface PackWeightsRef {\n  /** Backend that can load these weights. */\n  backend: 'ollama' | 'llama.cpp' | 'lm-studio' | 'foundry-local' | 'other';\n  /** Concrete model id / slug (e.g. qwen2.5-coder:3b). */\n  weightsRef: string;\n  quant?: string;\n  /** SPDX / short license note for first-download surface. */\n  license?: string;\n  /** Approx weights size in bytes (for fit when not discoverable). */\n  weightsBytes?: number;\n  /**\n   * Optional HTTPS GGUF URL for the first-party weight store (must pass host\n   * allowlist). When set, `vg models install` can download without Ollama.\n   */\n  downloadUrl?: string;\n  /** Optional content hash for downloaded GGUF. */\n  sha256?: string;\n}\n\nexport interface PackContract {\n  toolCalling: ToolCallingMode;\n  editFormat: EditFormatPreference;\n  capsuleBudgetTokens: number;\n  maxRepairRounds: number;\n  maxParallelEdits: number;\n  /** Minimum qualification score (0–1) this pack was gated on. */\n  minEffectiveScore?: number;\n  constrainedDecoding?: boolean;\n  kvCacheStrategy?: ModelExecutionProfile['kvCacheStrategy'];\n  securityTier?: ModelExecutionProfile['securityTier'];\n  /**\n   * Preferred inference path when available (ADR-005). Weights may still be\n   * pulled via Ollama; embedded llama.cpp is preferred for sampler/grammar.\n   */\n  preferredInference?: 'ollama' | 'llama.cpp';\n  /** Process isolation for preferredInference llama.cpp (default embedded). */\n  inferenceIsolation?: ModelExecutionProfile['inferenceIsolation'];\n}\n\nexport interface QualifiedPack {\n  /** e.g. flow@2026.07.1 */\n  packId: string;\n  mode: ModelMode;\n  displayName: string;\n  /** User-facing promise (one line). */\n  promise: string;\n  primary: PackWeightsRef;\n  fallback?: PackWeightsRef[];\n  contract: PackContract;\n  resources: {\n    minRamGb: number;\n    minVramGb?: number;\n    /** Estimated KV cache bytes per 1k context tokens. */\n    estimatedKvPer1kContext?: number;\n  };\n  provenance?: {\n    evalRunIds?: string[];\n    notes?: string;\n  };\n}\n\nexport interface RepoSignals {\n  /** Approximate source file count (0 = unknown). */\n  fileCount?: number;\n  /** Graph node count when a map is warm (0 = unknown). */\n  graphNodeCount?: number;\n  /** Dominant languages (optional). */\n  languages?: string[];\n}\n\nexport interface FitInput {\n  system: SystemMemory;\n  pack: QualifiedPack;\n  repo?: RepoSignals;\n  taskClass?: TaskClass;\n  /**\n   * Static reserves (bytes) for IDE / OS / graph / tests.\n   * Defaults applied when omitted.\n   */\n  reserves?: {\n    ideBytes?: number;\n    osBytes?: number;\n    graphBytes?: number;\n    testsBytes?: number;\n    safetyMarginBytes?: number;\n  };\n  /** Context budget used to estimate KV (tokens). Defaults from pack contract. */\n  contextBudgetTokens?: number;\n}\n\nexport interface FitResult {\n  label: FitLabel;\n  /** 0–100; higher is more headroom. */\n  score: number;\n  needBytes: number;\n  availableBytes: number;\n  /** Breakdown for “memory pie” UX. */\n  breakdown: {\n    modelBytes: number;\n    kvBytes: number;\n    ideBytes: number;\n    osBytes: number;\n    graphBytes: number;\n    testsBytes: number;\n    freeAfterReservesBytes: number;\n  };\n  /** When tight: suggested reduced capsule budget. */\n  reducedCapsuleBudgetTokens?: number;\n  reasons: string[];\n}\n\nexport interface ResolvedMode {\n  schemaVersion: typeof MODEL_ORCHESTRATOR_SCHEMA_VERSION;\n  mode: ModelMode;\n  pack: QualifiedPack;\n  /** Concrete weights chosen (primary or fallback after fit). */\n  underlying: PackWeightsRef;\n  fit: FitResult;\n  profile: ModelExecutionProfile;\n  /** True when pack id was pinned by the user. */\n  pinned: boolean;\n  /** How the mode was chosen. */\n  selection: 'explicit' | 'default' | 'auto_fit' | 'pinned';\n}\n\nexport interface OrchestratorStatus {\n  schemaVersion: typeof MODEL_ORCHESTRATOR_SCHEMA_VERSION;\n  defaultMode: ModelMode;\n  pin?: { mode: ModelMode; packId: string } | null;\n  modes: Array<{\n    mode: ModelMode;\n    packId: string;\n    displayName: string;\n    promise: string;\n    underlyingModelId: string;\n    backend: string;\n    fit: FitLabel;\n    fitScore: number;\n    needBytes: number;\n    availableBytes: number;\n    installed: boolean;\n    pinned: boolean;\n  }>;\n  recommended: ModelMode;\n  system: {\n    totalRamBytes: number;\n    freeRamBytes: number;\n    vramTotalBytes?: number;\n    vramFreeBytes?: number;\n    loaded: Array<{ name: string; bytes: number }>;\n  };\n  memoryBreakdown?: FitResult['breakdown'];\n}\n\n// ── Curated packs (versioned; weights may change under the same mode contract) ─\n\n/** Pack channel — bump when contracts or weight refs change under stable mode names. */\nconst PACK_CHANNEL = '2026.07.3';\n\n/**\n * Current qualified packs — one primary per mode.\n *\n * Approach B default: Spark/Flow **primary** is first-party GGUF (llama.cpp)\n * for install + inference when fit allows. Ollama remains an explicit fallback\n * adapter, not the default path.\n */\nexport const QUALIFIED_PACKS: QualifiedPack[] = [\n  {\n    packId: `spark@${PACK_CHANNEL}`,\n    mode: 'spark',\n    displayName: 'Spark',\n    promise: 'Fastest capable local coding — simple edits, minimal memory.',\n    primary: {\n      backend: 'llama.cpp',\n      weightsRef: 'qwen2.5-coder-3b-q4_k_m.gguf',\n      quant: 'q4_k_m',\n      license: 'Apache-2.0',\n      weightsBytes: estimateModelBytes('qwen2.5-coder:3b').bytes,\n    },\n    fallback: [\n      {\n        backend: 'ollama',\n        weightsRef: 'qwen2.5-coder:3b',\n        quant: 'q4_k_m',\n        license: 'Apache-2.0',\n        weightsBytes: estimateModelBytes('qwen2.5-coder:3b').bytes,\n      },\n      {\n        backend: 'ollama',\n        weightsRef: 'qwen2.5-coder:1.5b',\n        quant: 'q4_k_m',\n        license: 'Apache-2.0',\n        weightsBytes: estimateModelBytes('qwen2.5-coder:1.5b').bytes,\n      },\n    ],\n    contract: {\n      toolCalling: 'grammar',\n      editFormat: 'patch_ir_json',\n      capsuleBudgetTokens: 2000,\n      maxRepairRounds: 2,\n      maxParallelEdits: 2,\n      minEffectiveScore: 0.55,\n      constrainedDecoding: true,\n      preferredInference: 'llama.cpp',\n      inferenceIsolation: 'embedded',\n      kvCacheStrategy: 'stable_prefix',\n      securityTier: 'L1',\n    },\n    resources: { minRamGb: 4, estimatedKvPer1kContext: 2 * 1024 * 1024 },\n    provenance: {\n      notes: 'Spark@2026.07.3 — Approach B default: GGUF primary, PatchIR grammar fail-closed, Ollama fallback',\n    },\n  },\n  {\n    packId: `flow@${PACK_CHANNEL}`,\n    mode: 'flow',\n    displayName: 'Flow',\n    promise: 'Best everyday graph-guided coding for this machine.',\n    primary: {\n      backend: 'llama.cpp',\n      weightsRef: 'qwen2.5-coder-7b-q4_k_m.gguf',\n      quant: 'q4_k_m',\n      license: 'Apache-2.0',\n      weightsBytes: estimateModelBytes('qwen2.5-coder:7b').bytes,\n    },\n    fallback: [\n      {\n        backend: 'ollama',\n        weightsRef: 'qwen2.5-coder:7b',\n        quant: 'q4_k_m',\n        license: 'Apache-2.0',\n        weightsBytes: estimateModelBytes('qwen2.5-coder:7b').bytes,\n      },\n      {\n        backend: 'ollama',\n        weightsRef: 'qwen2.5-coder:3b',\n        quant: 'q4_k_m',\n        license: 'Apache-2.0',\n        weightsBytes: estimateModelBytes('qwen2.5-coder:3b').bytes,\n      },\n    ],\n    contract: {\n      toolCalling: 'native',\n      editFormat: 'auto',\n      capsuleBudgetTokens: 3500,\n      maxRepairRounds: 2,\n      maxParallelEdits: 4,\n      minEffectiveScore: 0.65,\n      constrainedDecoding: false,\n      preferredInference: 'llama.cpp',\n      inferenceIsolation: 'embedded',\n      kvCacheStrategy: 'stable_prefix',\n      securityTier: 'L1',\n    },\n    resources: { minRamGb: 8, minVramGb: 6, estimatedKvPer1kContext: 4 * 1024 * 1024 },\n    provenance: {\n      notes: 'Flow@2026.07.3 — Approach B default GGUF when fit allows; Ollama fallback for machines without store',\n    },\n  },\n  {\n    packId: `forge@${PACK_CHANNEL}`,\n    mode: 'forge',\n    displayName: 'Forge',\n    promise: 'Strongest deep work that safely fits (migrations, multi-file).',\n    primary: {\n      backend: 'ollama',\n      weightsRef: 'qwen2.5-coder:14b',\n      quant: 'q4_k_m',\n      license: 'Apache-2.0',\n      weightsBytes: estimateModelBytes('qwen2.5-coder:14b').bytes,\n    },\n    fallback: [\n      {\n        backend: 'ollama',\n        weightsRef: 'qwen2.5-coder:7b',\n        quant: 'q4_k_m',\n        license: 'Apache-2.0',\n        weightsBytes: estimateModelBytes('qwen2.5-coder:7b').bytes,\n      },\n    ],\n    contract: {\n      toolCalling: 'native',\n      editFormat: 'patch_ir_json',\n      capsuleBudgetTokens: 6000,\n      maxRepairRounds: 3,\n      maxParallelEdits: 6,\n      minEffectiveScore: 0.7,\n      constrainedDecoding: false,\n      preferredInference: 'ollama',\n      kvCacheStrategy: 'stable_prefix',\n      securityTier: 'L1',\n    },\n    resources: { minRamGb: 16, minVramGb: 12, estimatedKvPer1kContext: 8 * 1024 * 1024 },\n    provenance: { notes: 'Forge@2026.07.2 — deep work; PatchIR-oriented edits without forced grammar yet' },\n  },\n];\n\nconst GiB = 1024 ** 3;\n\n/**\n * Static reserves applied on top of *available* RAM.\n *\n * Important: `freeRamBytes` is already residual after currently-running\n * processes (IDE, OS, browsers, …). Subtracting a full IDE/OS footprint again\n * double-counts and falsely zeros fit on healthy machines. Keep growth\n * headroom for graph/tests (often not yet resident) + safety, and a modest\n * fraction of IDE/OS for workspace growth under load.\n */\nconst DEFAULT_RESERVES = {\n  ideBytes: 1.5 * GiB,\n  osBytes: 2 * GiB,\n  graphBytes: 0.5 * GiB,\n  testsBytes: 0.25 * GiB,\n  safetyMarginBytes: 1 * GiB,\n};\n\n/** Fraction of IDE+OS reserves kept as growth headroom on the free-RAM path. */\nconst IDE_OS_GROWTH_FRACTION = 0.25;\n\n// ── Pack lookup ───────────────────────────────────────────────────────────────\n\nexport function packForMode(mode: ModelMode, packs: QualifiedPack[] = QUALIFIED_PACKS): QualifiedPack | null {\n  return packs.find((p) => p.mode === mode) ?? null;\n}\n\nexport function packById(packId: string, packs: QualifiedPack[] = QUALIFIED_PACKS): QualifiedPack | null {\n  return packs.find((p) => p.packId === packId) ?? null;\n}\n\nexport function listModes(): ModelMode[] {\n  return ['spark', 'flow', 'forge'];\n}\n\n// ── Fit algorithm ─────────────────────────────────────────────────────────────\n\n/**\n * Fit decision: available memory *now* after IDE/OS/graph/tests reserves and\n * safety margin — not only “weights fit in total RAM”.\n *\n * Target: < 100 ms once system snapshot is warm (pure arithmetic).\n */\nexport function fitPack(input: FitInput): FitResult {\n  const r = { ...DEFAULT_RESERVES, ...input.reserves };\n  const pack = input.pack;\n  const weightsBytes =\n    pack.primary.weightsBytes ??\n    estimateModelBytes(pack.primary.weightsRef).bytes;\n  const ctxTokens = input.contextBudgetTokens ?? pack.contract.capsuleBudgetTokens * 2;\n  const kvPer1k = pack.resources.estimatedKvPer1kContext ?? 2 * 1024 * 1024;\n  const kvBytes = Math.round((ctxTokens / 1000) * kvPer1k);\n  const modelBytes = weightsBytes;\n  const needBytes = modelBytes + kvBytes;\n\n  const useVram =\n    typeof input.system.vramTotalBytes === 'number' && input.system.vramTotalBytes > 0;\n  const freeNow = useVram\n    ? (input.system.vramFreeBytes ?? 0)\n    : input.system.freeRamBytes;\n  const loadedBytes = input.system.loaded.reduce((n, m) => n + m.bytes, 0);\n  // Prefer free-after-unload for fit of *next* load when something is resident.\n  const freePool = freeNow + loadedBytes;\n\n  const graphBump =\n    (input.repo?.graphNodeCount ?? 0) > 50_000\n      ? 0.5 * GiB\n      : (input.repo?.fileCount ?? 0) > 5_000\n        ? 0.25 * GiB\n        : 0;\n  const graphBytes = r.graphBytes + graphBump;\n\n  // On discrete VRAM, only model+KV compete for VRAM — host reserves stay on RAM.\n  // On unified / CPU path: free/available RAM already excludes current IDE/OS\n  // usage, so only charge growth (graph/tests/safety + modest IDE/OS headroom).\n  const reserved = useVram\n    ? r.safetyMarginBytes\n    : graphBytes +\n      r.testsBytes +\n      r.safetyMarginBytes +\n      IDE_OS_GROWTH_FRACTION * (r.ideBytes + r.osBytes);\n  const freeAfterReserves = Math.max(0, freePool - reserved);\n\n  const availableBytes = freeAfterReserves;\n  const reasons: string[] = [];\n  const headroom = availableBytes - needBytes;\n  const ratio = needBytes > 0 ? availableBytes / needBytes : 0;\n\n  let label: FitLabel;\n  let reducedCapsuleBudgetTokens: number | undefined;\n\n  if (availableBytes < needBytes * 0.85) {\n    label = 'will_not_fit';\n    reasons.push(\n      `needs ~${fmtGb(needBytes)} but only ~${fmtGb(availableBytes)} is free after reserves`,\n    );\n  } else if (ratio < 1.1 || headroom < 0.5 * GiB) {\n    label = 'tight';\n    reducedCapsuleBudgetTokens = Math.max(\n      1200,\n      Math.floor(pack.contract.capsuleBudgetTokens * 0.65),\n    );\n    reasons.push('tight fit — capsule budget will be reduced automatically');\n  } else if (ratio >= 1.6 && headroom >= 2 * GiB) {\n    label = 'flies';\n    reasons.push('comfortable headroom for this mode');\n  } else {\n    label = 'comfortable';\n    reasons.push('within policy for this machine');\n  }\n\n  // Large monorepo + forge → soft-downgrade score (does not force will_not_fit).\n  if (\n    pack.mode === 'forge' &&\n    ((input.repo?.fileCount ?? 0) > 10_000 || (input.repo?.graphNodeCount ?? 0) > 100_000) &&\n    label === 'comfortable'\n  ) {\n    reasons.push('large repository — prefer moderated capsule + graph paging');\n  }\n\n  // Score: map ratio into 0–100 with floors for labels.\n  let score = Math.max(0, Math.min(100, Math.round(ratio * 50)));\n  if (label === 'will_not_fit') score = Math.min(score, 20);\n  if (label === 'tight') score = Math.min(Math.max(score, 25), 45);\n  if (label === 'comfortable') score = Math.min(Math.max(score, 50), 75);\n  if (label === 'flies') score = Math.max(score, 80);\n\n  return {\n    label,\n    score,\n    needBytes,\n    availableBytes,\n    breakdown: {\n      modelBytes,\n      kvBytes,\n      // Report the charged growth headroom (not the full static IDE/OS footprint).\n      ideBytes: useVram ? 0 : IDE_OS_GROWTH_FRACTION * r.ideBytes,\n      osBytes: useVram ? 0 : IDE_OS_GROWTH_FRACTION * r.osBytes,\n      graphBytes: useVram ? 0 : graphBytes,\n      testsBytes: useVram ? 0 : r.testsBytes,\n      freeAfterReservesBytes: freeAfterReserves,\n    },\n    reducedCapsuleBudgetTokens,\n    reasons,\n  };\n}\n\nfunction fmtGb(bytes: number): string {\n  return `${(bytes / GiB).toFixed(1)} GiB`;\n}\n\n// ── Resolve mode → pack → underlying ──────────────────────────────────────────\n\nexport interface ResolveModeOptions {\n  mode?: ModelMode;\n  /** Prefer auto-fit when no mode set (default true for first-run wizard). */\n  autoFit?: boolean;\n  system: SystemMemory;\n  repo?: RepoSignals;\n  taskClass?: TaskClass;\n  /** Installed model names (ollama/lmstudio) for installed: true. */\n  installedNames?: string[];\n  /** Pin map mode → packId. */\n  pin?: { mode: ModelMode; packId: string } | null;\n  packs?: QualifiedPack[];\n  defaultMode?: ModelMode;\n}\n\nfunction packToProfile(pack: QualifiedPack, underlying: PackWeightsRef, fit: FitResult): ModelExecutionProfile {\n  const budget =\n    fit.label === 'tight' && fit.reducedCapsuleBudgetTokens\n      ? fit.reducedCapsuleBudgetTokens\n      : pack.contract.capsuleBudgetTokens;\n  return {\n    schemaVersion: MODEL_EXECUTION_PROFILE_SCHEMA_VERSION,\n    id: underlying.weightsRef,\n    displayName: `${pack.displayName} · ${underlying.weightsRef}`,\n    mode: pack.mode,\n    backend:\n      underlying.backend === 'ollama'\n        ? 'ollama'\n        : underlying.backend === 'llama.cpp'\n          ? 'llama.cpp'\n          : underlying.backend === 'lm-studio'\n            ? 'openai-compatible'\n            : 'other',\n    toolCalling: pack.contract.toolCalling,\n    editFormat: pack.contract.editFormat,\n    capsuleBudgetTokens: budget,\n    maxParallelEdits: pack.contract.maxParallelEdits,\n    maxRepairRounds: pack.contract.maxRepairRounds,\n    temperature: 0,\n    constrainedDecoding: pack.contract.constrainedDecoding ?? false,\n    kvCacheStrategy: pack.contract.kvCacheStrategy,\n    resources: {\n      minRamGb: pack.resources.minRamGb,\n      minVramGb: pack.resources.minVramGb,\n      quant: underlying.quant,\n    },\n    securityTier: pack.contract.securityTier,\n    inferenceIsolation: pack.contract.inferenceIsolation ?? 'embedded',\n  };\n}\n\nfunction tryWeights(\n  pack: QualifiedPack,\n  weights: PackWeightsRef,\n  system: SystemMemory,\n  repo?: RepoSignals,\n  taskClass?: TaskClass,\n): { fit: FitResult; underlying: PackWeightsRef } {\n  const trial: QualifiedPack = { ...pack, primary: weights };\n  return { fit: fitPack({ system, pack: trial, repo, taskClass }), underlying: weights };\n}\n\n/**\n * Resolve a Code Mode to a pack, concrete weights, fit label, and MEP.\n * Refuses primary load when fit is will_not_fit and tries fallbacks; if all\n * fail, returns the best effort with label will_not_fit (caller must not load).\n */\nexport function resolveMode(opts: ResolveModeOptions): ResolvedMode {\n  const packs = opts.packs ?? QUALIFIED_PACKS;\n  const defaultMode = opts.defaultMode ?? 'flow';\n  let mode: ModelMode = opts.mode ?? defaultMode;\n  let selection: ResolvedMode['selection'] = opts.mode ? 'explicit' : 'default';\n\n  if (!opts.mode && opts.autoFit !== false) {\n    mode = recommendMode(opts.system, opts.repo, packs);\n    selection = 'auto_fit';\n  }\n\n  let pack = packForMode(mode, packs);\n  if (!pack) {\n    pack = packForMode('flow', packs)!;\n    mode = 'flow';\n    selection = 'default';\n  }\n\n  if (opts.pin && opts.pin.mode === mode) {\n    const pinned = packById(opts.pin.packId, packs);\n    if (pinned && pinned.mode === mode) {\n      pack = pinned;\n      selection = 'pinned';\n    }\n  }\n\n  const candidates = [pack.primary, ...(pack.fallback ?? [])];\n  let best: { fit: FitResult; underlying: PackWeightsRef } | null = null;\n\n  for (const w of candidates) {\n    const trial = tryWeights(pack, w, opts.system, opts.repo, opts.taskClass);\n    if (!best || fitRank(trial.fit) > fitRank(best.fit)) best = trial;\n    if (trial.fit.label === 'flies' || trial.fit.label === 'comfortable') {\n      best = trial;\n      break;\n    }\n  }\n\n  const chosen = best ?? tryWeights(pack, pack.primary, opts.system, opts.repo, opts.taskClass);\n  const profile = packToProfile(pack, chosen.underlying, chosen.fit);\n\n  return {\n    schemaVersion: MODEL_ORCHESTRATOR_SCHEMA_VERSION,\n    mode,\n    pack,\n    underlying: chosen.underlying,\n    fit: chosen.fit,\n    profile,\n    pinned: selection === 'pinned',\n    selection,\n  };\n}\n\nfunction fitRank(f: FitResult): number {\n  const order: Record<FitLabel, number> = {\n    flies: 4,\n    comfortable: 3,\n    tight: 2,\n    will_not_fit: 1,\n  };\n  return order[f.label] * 1000 + f.score;\n}\n\n/**\n * Pick the strongest mode that still fits at least “comfortable” (or tight\n * for spark). Prefer Flow when both Flow and Forge are comfortable.\n */\nexport function recommendMode(\n  system: SystemMemory,\n  repo?: RepoSignals,\n  packs: QualifiedPack[] = QUALIFIED_PACKS,\n): ModelMode {\n  const order: ModelMode[] = ['forge', 'flow', 'spark'];\n  let bestTight: ModelMode | null = null;\n  for (const mode of order) {\n    const pack = packForMode(mode, packs);\n    if (!pack) continue;\n    const resolved = resolveMode({\n      mode,\n      autoFit: false,\n      system,\n      repo,\n      packs,\n    });\n    if (resolved.fit.label === 'flies' || resolved.fit.label === 'comfortable') {\n      // Prefer Flow as daily default when Forge also fits, unless repo is tiny.\n      if (mode === 'forge') {\n        const flow = resolveMode({ mode: 'flow', autoFit: false, system, repo, packs });\n        if (flow.fit.label === 'flies' || flow.fit.label === 'comfortable') {\n          const files = repo?.fileCount ?? 0;\n          if (files < 2000) return 'flow';\n        }\n        return 'forge';\n      }\n      return mode;\n    }\n    if (resolved.fit.label === 'tight' && !bestTight) bestTight = mode;\n  }\n  return bestTight ?? 'spark';\n}\n\n/** Build orchestrator status for `vg models status` / host UIs. */\nexport function buildOrchestratorStatus(opts: {\n  system: SystemMemory;\n  repo?: RepoSignals;\n  installedNames?: string[];\n  /** Single pin (legacy) or full pin map. */\n  pin?: { mode: ModelMode; packId: string } | null;\n  pins?: Partial<Record<ModelMode, string>>;\n  defaultMode?: ModelMode;\n  packs?: QualifiedPack[];\n}): OrchestratorStatus {\n  const packs = opts.packs ?? QUALIFIED_PACKS;\n  const installed = new Set((opts.installedNames ?? []).map((n) => n.toLowerCase()));\n  const recommended = recommendMode(opts.system, opts.repo, packs);\n  const pinFor = (mode: ModelMode): { mode: ModelMode; packId: string } | null => {\n    const fromMap = opts.pins?.[mode];\n    if (fromMap) return { mode, packId: fromMap };\n    if (opts.pin?.mode === mode) return opts.pin;\n    return null;\n  };\n  const modes = listModes().map((mode) => {\n    const resolved = resolveMode({\n      mode,\n      autoFit: false,\n      system: opts.system,\n      repo: opts.repo,\n      pin: pinFor(mode),\n      packs,\n    });\n    const id = resolved.underlying.weightsRef.toLowerCase();\n    const installedHit =\n      installed.has(id) ||\n      [...installed].some((n) => n.includes(id) || id.includes(n));\n    return {\n      mode,\n      packId: resolved.pack.packId,\n      displayName: resolved.pack.displayName,\n      promise: resolved.pack.promise,\n      underlyingModelId: resolved.underlying.weightsRef,\n      backend: resolved.underlying.backend,\n      fit: resolved.fit.label,\n      fitScore: resolved.fit.score,\n      needBytes: resolved.fit.needBytes,\n      availableBytes: resolved.fit.availableBytes,\n      installed: installedHit,\n      pinned: resolved.pinned,\n    };\n  });\n\n  const recResolved = resolveMode({\n    mode: recommended,\n    autoFit: false,\n    system: opts.system,\n    repo: opts.repo,\n    pin: pinFor(recommended),\n    packs,\n  });\n\n  return {\n    schemaVersion: MODEL_ORCHESTRATOR_SCHEMA_VERSION,\n    defaultMode: opts.defaultMode ?? 'flow',\n    pin: pinFor(recommended),\n    modes,\n    recommended,\n    system: {\n      totalRamBytes: opts.system.totalRamBytes,\n      freeRamBytes: opts.system.freeRamBytes,\n      ...(typeof opts.system.vramTotalBytes === 'number'\n        ? { vramTotalBytes: opts.system.vramTotalBytes }\n        : {}),\n      ...(typeof opts.system.vramFreeBytes === 'number'\n        ? { vramFreeBytes: opts.system.vramFreeBytes }\n        : {}),\n      loaded: opts.system.loaded.map((l) => ({ name: l.name, bytes: l.bytes })),\n    },\n    memoryBreakdown: recResolved.fit.breakdown,\n  };\n}\n\n// ── Pin registry (global storage, not in-repo) ────────────────────────────────\n\nexport interface OrchestratorPinState {\n  schemaVersion: 'model-orchestrator-pin/0';\n  /** mode → packId */\n  pins: Partial<Record<ModelMode, string>>;\n  /** Workspace / global default mode preference. */\n  defaultMode?: ModelMode;\n  updatedAt: string;\n}\n\nexport function orchestratorStatePath(\n  env: NodeJS.ProcessEnv = process.env,\n  platform: NodeJS.Platform = process.platform,\n  home?: string,\n): string {\n  return path.join(vibgrateDataDir(env, platform, home), 'model-orchestrator', 'state.json');\n}\n\nexport function readOrchestratorState(\n  env: NodeJS.ProcessEnv = process.env,\n  platform: NodeJS.Platform = process.platform,\n  home?: string,\n): OrchestratorPinState {\n  const p = orchestratorStatePath(env, platform, home);\n  try {\n    const raw = JSON.parse(fs.readFileSync(p, 'utf8')) as Partial<OrchestratorPinState>;\n    return {\n      schemaVersion: 'model-orchestrator-pin/0',\n      pins: raw.pins && typeof raw.pins === 'object' ? raw.pins : {},\n      defaultMode:\n        raw.defaultMode === 'spark' || raw.defaultMode === 'flow' || raw.defaultMode === 'forge'\n          ? raw.defaultMode\n          : undefined,\n      updatedAt: typeof raw.updatedAt === 'string' ? raw.updatedAt : new Date(0).toISOString(),\n    };\n  } catch {\n    return {\n      schemaVersion: 'model-orchestrator-pin/0',\n      pins: {},\n      updatedAt: new Date(0).toISOString(),\n    };\n  }\n}\n\nexport function writeOrchestratorState(\n  state: OrchestratorPinState,\n  env: NodeJS.ProcessEnv = process.env,\n  platform: NodeJS.Platform = process.platform,\n  home?: string,\n): string {\n  const p = orchestratorStatePath(env, platform, home);\n  fs.mkdirSync(path.dirname(p), { recursive: true });\n  const next: OrchestratorPinState = {\n    ...state,\n    schemaVersion: 'model-orchestrator-pin/0',\n    updatedAt: new Date().toISOString(),\n  };\n  fs.writeFileSync(p, JSON.stringify(next, null, 2) + '\\n', 'utf8');\n  return p;\n}\n\nexport function pinPack(\n  mode: ModelMode,\n  packId: string,\n  env?: NodeJS.ProcessEnv,\n  platform?: NodeJS.Platform,\n  home?: string,\n): OrchestratorPinState {\n  const state = readOrchestratorState(env, platform, home);\n  if (!packById(packId)) {\n    throw new Error(`unknown pack id: ${packId}`);\n  }\n  state.pins[mode] = packId;\n  writeOrchestratorState(state, env, platform, home);\n  return state;\n}\n\nexport function unpinPack(\n  mode: ModelMode,\n  env?: NodeJS.ProcessEnv,\n  platform?: NodeJS.Platform,\n  home?: string,\n): OrchestratorPinState {\n  const state = readOrchestratorState(env, platform, home);\n  delete state.pins[mode];\n  writeOrchestratorState(state, env, platform, home);\n  return state;\n}\n\nexport function setDefaultMode(\n  mode: ModelMode,\n  env?: NodeJS.ProcessEnv,\n  platform?: NodeJS.Platform,\n  home?: string,\n): OrchestratorPinState {\n  const state = readOrchestratorState(env, platform, home);\n  state.defaultMode = mode;\n  writeOrchestratorState(state, env, platform, home);\n  return state;\n}\n\n/** Active pin for a mode, if any. */\nexport function activePin(\n  mode: ModelMode,\n  state: OrchestratorPinState = readOrchestratorState(),\n): { mode: ModelMode; packId: string } | null {\n  const packId = state.pins[mode];\n  return packId ? { mode, packId } : null;\n}\n\n/** Map backend hint to vg code --provider id. */\nexport function providerForBackend(backend: PackWeightsRef['backend']): string {\n  switch (backend) {\n    case 'ollama':\n      return 'ollama';\n    case 'llama.cpp':\n      return 'llama-cpp';\n    case 'lm-studio':\n      return 'lmstudio';\n    default:\n      return 'ollama';\n  }\n}\n\n/** Parse mode from user string; null if invalid. */\nexport function parseMode(raw: string | undefined | null): ModelMode | null {\n  if (!raw) return null;\n  const m = raw.trim().toLowerCase();\n  if (m === 'spark' || m === 'flow' || m === 'forge') return m;\n  return null;\n}\n"]}

package/dist/{chunk-6IOQJGFT.js → chunk-6ABXHZRN.js}

@@ -1,54 +1,11 @@
-import { stableStringify } from './chunk-5Q54GEHM.js';
+import { cacheDir } from './chunk-K3MZIVZW.js';
 import { hashString } from './chunk-JFGYT6BI.js';
-import * as fs3 from 'fs';
+import * as fs2 from 'fs';
 import { createRequire } from 'module';
 import * as os from 'os';
-import * as path3 from 'path';
+import * as path2 from 'path';
 import { pathToFileURL } from 'url';
 
-var CACHE_VERSION = "vg-parse-cache/3";
-function cacheDir(root) {
-  return path3.join(root, ".vibgrate", "cache");
-}
-function cachePath(root) {
-  return path3.join(cacheDir(root), "parse-cache.json");
-}
-function loadCache(root, opts) {
-  const file = cachePath(root);
-  let data = {
-    version: CACHE_VERSION,
-    toolVersion: opts.toolVersion,
-    grammars: opts.grammars,
-    entries: {}
-  };
-  if (!opts.disabled && fs3.existsSync(file)) {
-    try {
-      const loaded = JSON.parse(fs3.readFileSync(file, "utf8"));
-      if (loaded.version === CACHE_VERSION && loaded.toolVersion === opts.toolVersion && loaded.grammars === opts.grammars && loaded.entries) {
-        data = loaded;
-      }
-    } catch {
-    }
-  }
-  return {
-    get(rel, hash) {
-      const entry = data.entries[rel];
-      return entry && entry.hash === hash ? entry.parse : void 0;
-    },
-    set(rel, parse) {
-      data.entries[rel] = { hash: parse.hash, parse };
-    },
-    prune(currentRels) {
-      for (const rel of Object.keys(data.entries)) {
-        if (!currentRels.has(rel)) delete data.entries[rel];
-      }
-    },
-    save() {
-      fs3.mkdirSync(cacheDir(root), { recursive: true });
-      fs3.writeFileSync(file, stableStringify(data, 0));
-    }
-  };
-}
 var DEFAULT_LOCK_STALE_MS = 15 * 60 * 1e3;
 function isProcessAlive(pid) {
   try {
@@ -60,7 +17,7 @@ function isProcessAlive(pid) {
 }
 function lockIsStale(file, staleMs) {
   try {
-    const { pid, at } = JSON.parse(fs3.readFileSync(file, "utf8"));
+    const { pid, at } = JSON.parse(fs2.readFileSync(file, "utf8"));
     if (typeof at === "number" && Date.now() - at > staleMs) return true;
     if (typeof pid === "number" && !isProcessAlive(pid)) return true;
     return false;
@@ -71,10 +28,10 @@ function lockIsStale(file, staleMs) {
 function acquireLock(file, staleMs = DEFAULT_LOCK_STALE_MS) {
   const write = () => {
     try {
-      fs3.mkdirSync(path3.dirname(file), { recursive: true });
-      const fd = fs3.openSync(file, "wx");
-      fs3.writeFileSync(fd, JSON.stringify({ pid: process.pid, at: Date.now() }));
-      fs3.closeSync(fd);
+      fs2.mkdirSync(path2.dirname(file), { recursive: true });
+      const fd = fs2.openSync(file, "wx");
+      fs2.writeFileSync(fd, JSON.stringify({ pid: process.pid, at: Date.now() }));
+      fs2.closeSync(fd);
       return true;
     } catch {
       return false;
@@ -83,7 +40,7 @@ function acquireLock(file, staleMs = DEFAULT_LOCK_STALE_MS) {
   if (write()) return true;
   if (lockIsStale(file, staleMs)) {
     try {
-      fs3.rmSync(file, { force: true });
+      fs2.rmSync(file, { force: true });
     } catch {
     }
     return write();
@@ -92,7 +49,7 @@ function acquireLock(file, staleMs = DEFAULT_LOCK_STALE_MS) {
 }
 function releaseLock(file) {
   try {
-    fs3.rmSync(file, { force: true });
+    fs2.rmSync(file, { force: true });
   } catch {
   }
 }
@@ -102,14 +59,14 @@ function resolveEmbedModel(model) {
   return model ?? "bge-small-en-v1.5";
 }
 function modelCacheDir() {
-  const base = process.env.XDG_CACHE_HOME || path3.join(os.homedir(), ".cache");
-  return path3.join(base, "vibgrate", "models");
+  const base = process.env.XDG_CACHE_HOME || path2.join(os.homedir(), ".cache");
+  return path2.join(base, "vibgrate", "models");
 }
 function modelReadyMarker(modelId) {
-  return path3.join(modelCacheDir(), `.ready-${safe(modelId)}`);
+  return path2.join(modelCacheDir(), `.ready-${safe(modelId)}`);
 }
 function isModelReady(modelId = resolveEmbedModel()) {
-  return fs3.existsSync(modelReadyMarker(modelId));
+  return fs2.existsSync(modelReadyMarker(modelId));
 }
 function unavailableMessage(reason) {
   switch (reason) {
@@ -126,13 +83,13 @@ function unavailableMessage(reason) {
 }
 function modelCacheInfo(modelId = resolveEmbedModel()) {
   const dir = modelCacheDir();
-  return { dir, present: isModelReady(modelId) || fs3.existsSync(dir), bytes: dirSize(dir) };
+  return { dir, present: isModelReady(modelId) || fs2.existsSync(dir), bytes: dirSize(dir) };
 }
 function clearModelCache() {
   const dir = modelCacheDir();
   const bytes = dirSize(dir);
   try {
-    fs3.rmSync(dir, { recursive: true, force: true });
+    fs2.rmSync(dir, { recursive: true, force: true });
   } catch {
   }
   return bytes;
@@ -141,16 +98,16 @@ function dirSize(dir) {
   let total = 0;
   let entries;
   try {
-    entries = fs3.readdirSync(dir, { withFileTypes: true });
+    entries = fs2.readdirSync(dir, { withFileTypes: true });
   } catch {
     return 0;
   }
   for (const e of entries) {
-    const p = path3.join(dir, e.name);
+    const p = path2.join(dir, e.name);
     if (e.isDirectory()) total += dirSize(p);
     else {
       try {
-        total += fs3.statSync(p).size;
+        total += fs2.statSync(p).size;
       } catch {
       }
     }
@@ -162,7 +119,7 @@ function isPermissionError(e) {
   return code === "EACCES" || code === "EPERM" || code === "EROFS";
 }
 function embeddingsCached(root, modelId) {
-  return fs3.existsSync(path3.join(cacheDir(root), `embeddings-${safe(modelId)}.json`));
+  return fs2.existsSync(path2.join(cacheDir(root), `embeddings-${safe(modelId)}.json`));
 }
 async function loadEmbedder(options = {}) {
   if (options.local) return null;
@@ -176,7 +133,7 @@ async function loadEmbedder(options = {}) {
   if (!mod?.FlagEmbedding) return fail("not-installed");
   const cache = modelCacheDir();
   try {
-    fs3.mkdirSync(cache, { recursive: true });
+    fs2.mkdirSync(cache, { recursive: true });
   } catch (e) {
     return fail(isPermissionError(e) ? "no-permission" : "init-failed");
   }
@@ -191,7 +148,7 @@ async function loadEmbedder(options = {}) {
       "embedding model init timed out"
     );
     try {
-      fs3.writeFileSync(modelReadyMarker(modelId), (/* @__PURE__ */ new Date(0)).toISOString());
+      fs2.writeFileSync(modelReadyMarker(modelId), (/* @__PURE__ */ new Date(0)).toISOString());
     } catch {
     }
     return {
@@ -216,7 +173,7 @@ async function importEmbedBackend() {
   const hostDir = process.env.VIBGRATE_EMBEDDER_PATH;
   if (hostDir) {
     try {
-      const req = createRequire(path3.join(hostDir, "package.json"));
+      const req = createRequire(path2.join(hostDir, "package.json"));
       const mod = await import(pathToFileURL(req.resolve("fastembed")).href);
       const resolved = mod?.FlagEmbedding ? mod : mod?.default;
       if (resolved?.FlagEmbedding) return resolved;
@@ -327,7 +284,7 @@ function cosine(a, b) {
 var EMBED_CHUNK = 256;
 var CACHE_WRITE_INTERVAL_MS = 1500;
 function vectorCachePath(root, modelId) {
-  return path3.join(cacheDir(root), `embeddings-${safe(modelId)}.json`);
+  return path2.join(cacheDir(root), `embeddings-${safe(modelId)}.json`);
 }
 function countPending(graph, root, modelId) {
   const entries = readCacheEntries(vectorCachePath(root, modelId), modelId);
@@ -342,9 +299,9 @@ function countPending(graph, root, modelId) {
   return pending;
 }
 function readCacheEntries(file, modelId) {
-  if (!fs3.existsSync(file)) return {};
+  if (!fs2.existsSync(file)) return {};
   try {
-    const loaded = JSON.parse(fs3.readFileSync(file, "utf8"));
+    const loaded = JSON.parse(fs2.readFileSync(file, "utf8"));
     if (loaded.model === modelId && loaded.entries) return loaded.entries;
   } catch {
   }
@@ -353,9 +310,9 @@ function readCacheEntries(file, modelId) {
 async function getNodeEmbeddings(graph, embedder, root, onProgress) {
   const file = vectorCachePath(root, embedder.id);
   let cache = { model: embedder.id, entries: {} };
-  if (fs3.existsSync(file)) {
+  if (fs2.existsSync(file)) {
     try {
-      const loaded = JSON.parse(fs3.readFileSync(file, "utf8"));
+      const loaded = JSON.parse(fs2.readFileSync(file, "utf8"));
       if (loaded.model === embedder.id && loaded.entries) cache = loaded;
     } catch {
     }
@@ -373,10 +330,10 @@ async function getNodeEmbeddings(graph, embedder, root, onProgress) {
   }
   const persist = () => {
     try {
-      fs3.mkdirSync(cacheDir(root), { recursive: true });
+      fs2.mkdirSync(cacheDir(root), { recursive: true });
       const tmp = `${file}.tmp.${process.pid}`;
-      fs3.writeFileSync(tmp, JSON.stringify(cache));
-      fs3.renameSync(tmp, file);
+      fs2.writeFileSync(tmp, JSON.stringify(cache));
+      fs2.renameSync(tmp, file);
     } catch {
     }
   };
@@ -758,6 +715,6 @@ function round2(x) {
   return Math.round(x * 1e6) / 1e6;
 }
 
-export { GraphIndex, acquireLock, cacheDir, clearModelCache, cosine, countPending, embeddingsCached, getNodeEmbeddings, identifierParts, impactOf, indexFor, isModelReady, loadCache, loadEmbedder, modelCacheInfo, nodeEmbedText, queryGraph, queryGraphSemantic, releaseLock, resolveEmbedModel, unavailableMessage, withTimeout };
-//# sourceMappingURL=chunk-6IOQJGFT.js.map
-//# sourceMappingURL=chunk-6IOQJGFT.js.map
+export { GraphIndex, acquireLock, clearModelCache, cosine, countPending, embeddingsCached, getNodeEmbeddings, identifierParts, impactOf, indexFor, isModelReady, loadEmbedder, modelCacheInfo, nodeEmbedText, queryGraph, queryGraphSemantic, releaseLock, resolveEmbedModel, unavailableMessage, withTimeout };
+//# sourceMappingURL=chunk-6ABXHZRN.js.map
+//# sourceMappingURL=chunk-6ABXHZRN.js.map

package/dist/chunk-6ABXHZRN.js.map

@@ -0,0 +1 @@
+{"version":3,"sources":["../src/engine/lock.ts","../src/engine/embeddings.ts","../src/engine/relations.ts","../src/engine/query.ts","../src/engine/impact.ts"],"names":["fs","path","text","round"],"mappings":";;;;;;;;AAWO,IAAM,qBAAA,GAAwB,KAAK,EAAA,GAAK,GAAA;AAE/C,SAAS,eAAe,GAAA,EAAsB;AAC5C,EAAA,IAAI;AACF,IAAA,OAAA,CAAQ,IAAA,CAAK,KAAK,CAAC,CAAA;AACnB,IAAA,OAAO,IAAA;AAAA,EACT,SAAS,CAAA,EAAG;AACV,IAAA,OAAQ,EAA4B,IAAA,KAAS,OAAA;AAAA,EAC/C;AACF;AAEA,SAAS,WAAA,CAAY,MAAc,OAAA,EAA0B;AAC3D,EAAA,IAAI;AACF,IAAA,MAAM,EAAE,KAAK,EAAA,EAAG,GAAI,KAAK,KAAA,CAASA,GAAA,CAAA,YAAA,CAAa,IAAA,EAAM,MAAM,CAAC,CAAA;AAC5D,IAAA,IAAI,OAAO,OAAO,QAAA,IAAY,IAAA,CAAK,KAAI,GAAI,EAAA,GAAK,SAAS,OAAO,IAAA;AAChE,IAAA,IAAI,OAAO,GAAA,KAAQ,QAAA,IAAY,CAAC,cAAA,CAAe,GAAG,GAAG,OAAO,IAAA;AAC5D,IAAA,OAAO,KAAA;AAAA,EACT,CAAA,CAAA,MAAQ;AACN,IAAA,OAAO,IAAA;AAAA,EACT;AACF;AAGO,SAAS,WAAA,CAAY,IAAA,EAAc,OAAA,GAAU,qBAAA,EAAgC;AAClF,EAAA,MAAM,QAAQ,MAAe;AAC3B,IAAA,IAAI;AACF,MAAGA,cAAeC,KAAA,CAAA,OAAA,CAAQ,IAAI,GAAG,EAAE,SAAA,EAAW,MAAM,CAAA;AACpD,MAAA,MAAM,EAAA,GAAQD,GAAA,CAAA,QAAA,CAAS,IAAA,EAAM,IAAI,CAAA;AACjC,MAAGA,GAAA,CAAA,aAAA,CAAc,EAAA,EAAI,IAAA,CAAK,SAAA,CAAU,EAAE,GAAA,EAAK,OAAA,CAAQ,GAAA,EAAK,EAAA,EAAI,IAAA,CAAK,GAAA,EAAI,EAAG,CAAC,CAAA;AACzE,MAAGA,cAAU,EAAE,CAAA;AACf,MAAA,OAAO,IAAA;AAAA,IACT,CAAA,CAAA,MAAQ;AACN,MAAA,OAAO,KAAA;AAAA,IACT;AAAA,EACF,CAAA;AACA,EAAA,IAAI,KAAA,IAAS,OAAO,IAAA;AACpB,EAAA,IAAI,WAAA,CAAY,IAAA,EAAM,OAAO,CAAA,EAAG;AAC9B,IAAA,IAAI;AACF,MAAGA,GAAA,CAAA,MAAA,CAAO,IAAA,EAAM,EAAE,KAAA,EAAO,MAAM,CAAA;AAAA,IACjC,CAAA,CAAA,MAAQ;AAAA,IAER;AACA,IAAA,OAAO,KAAA,EAAM;AAAA,EACf;AACA,EAAA,OAAO,KAAA;AACT;AAEO,SAAS,YAAY,IAAA,EAAoB;AAC9C,EAAA,IAAI;AACF,IAAGA,GAAA,CAAA,MAAA,CAAO,IAAA,EAAM,EAAE,KAAA,EAAO,MAAM,CAAA;AAAA,EACjC,CAAA,CAAA,MAAQ;AAAA,EAER;AACF;;;ACnBO,SAAS,kBAAkB,KAAA,EAAwB;AACxD,EAAA,OAAO,KAAA,IAAS,mBAAA;AAClB;AAUO,SAAS,aAAA,GAAwB;AACtC,EAAA,MAAM,OAAO,OAAA,CAAQ,GAAA,CAAI,kBAAuB,KAAA,CAAA,IAAA,CAAQ,EAAA,CAAA,OAAA,IAAW,QAAQ,CAAA;AAC3E,EAAA,OAAY,KAAA,CAAA,IAAA,CAAK,IAAA,EAAM,UAAA,EAAY,QAAQ,CAAA;AAC7C;AAGA,SAAS,iBAAiB,OAAA,EAAyB;AACjD,EAAA,OAAY,WAAK,aAAA,EAAc,EAAG,UAAU,IAAA,CAAK,OAAO,CAAC,CAAA,CAAE,CAAA;AAC7D;AAOO,SAAS,YAAA,CAAa,OAAA,GAAU,iBAAA,EAAkB,EAAY;AACnE,EAAA,OAAU,GAAA,CAAA,UAAA,CAAW,gBAAA,CAAiB,OAAO,CAAC,CAAA;AAChD;AAOO,SAAS,mBAAmB,MAAA,EAAkC;AACnE,EAAA,QAAQ,MAAA;AAAQ,IACd,KAAK,eAAA;AACH,MAAA,OAAO,CAAA,kDAAA,EAAqD,eAAe,CAAA,gNAAA,CAAA;AAAA,IAC7E,KAAK,iBAAA;AACH,MAAA,OAAO,CAAA,0LAAA,CAAA;AAAA,IACT,KAAK,eAAA;AACH,MAAA,OAAO,CAAA,oFAAA,CAAA;AAAA,IACT,KAAK,aAAA;AAAA,IACL;AACE,MAAA,OAAO,CAAA,kEAAA,CAAA;AAAA;AAEb;AASO,SAAS,cAAA,CAAe,OAAA,GAAU,iBAAA,EAAkB,EAAmB;AAC5E,EAAA,MAAM,MAAM,aAAA,EAAc;AAC1B,EAAA,OAAO,EAAE,GAAA,EAAK,OAAA,EAAS,YAAA,CAAa,OAAO,CAAA,IAAQ,GAAA,CAAA,UAAA,CAAW,GAAG,CAAA,EAAG,KAAA,EAAO,OAAA,CAAQ,GAAG,CAAA,EAAE;AAC1F;AAGO,SAAS,eAAA,GAA0B;AACxC,EAAA,MAAM,MAAM,aAAA,EAAc;AAC1B,EAAA,MAAM,KAAA,GAAQ,QAAQ,GAAG,CAAA;AACzB,EAAA,IAAI;AACF,IAAG,WAAO,GAAA,EAAK,EAAE,WAAW,IAAA,EAAM,KAAA,EAAO,MAAM,CAAA;AAAA,EACjD,CAAA,CAAA,MAAQ;AAAA,EAER;AACA,EAAA,OAAO,KAAA;AACT;AAEA,SAAS,QAAQ,GAAA,EAAqB;AACpC,EAAA,IAAI,KAAA,GAAQ,CAAA;AACZ,EAAA,IAAI,OAAA;AACJ,EAAA,IAAI;AACF,IAAA,OAAA,GAAa,GAAA,CAAA,WAAA,CAAY,GAAA,EAAK,EAAE,aAAA,EAAe,MAAM,CAAA;AAAA,EACvD,CAAA,CAAA,MAAQ;AACN,IAAA,OAAO,CAAA;AAAA,EACT;AACA,EAAA,KAAA,MAAW,KAAK,OAAA,EAAS;AACvB,IAAA,MAAM,CAAA,GAAS,KAAA,CAAA,IAAA,CAAK,GAAA,EAAK,CAAA,CAAE,IAAI,CAAA;AAC/B,IAAA,IAAI,CAAA,CAAE,WAAA,EAAY,EAAG,KAAA,IAAS,QAAQ,CAAC,CAAA;AAAA,SAClC;AACH,MAAA,IAAI;AACF,QAAA,KAAA,IAAY,GAAA,CAAA,QAAA,CAAS,CAAC,CAAA,CAAE,IAAA;AAAA,MAC1B,CAAA,CAAA,MAAQ;AAAA,MAER;AAAA,IACF;AAAA,EACF;AACA,EAAA,OAAO,KAAA;AACT;AAEA,SAAS,kBAAkB,CAAA,EAAqB;AAC9C,EAAA,MAAM,OAAQ,CAAA,EAAyC,IAAA;AACvD,EAAA,OAAO,IAAA,KAAS,QAAA,IAAY,IAAA,KAAS,OAAA,IAAW,IAAA,KAAS,OAAA;AAC3D;AAOO,SAAS,gBAAA,CAAiB,MAAc,OAAA,EAA0B;AACvE,EAAA,OAAU,GAAA,CAAA,UAAA,CAAgB,KAAA,CAAA,IAAA,CAAK,QAAA,CAAS,IAAI,CAAA,EAAG,cAAc,IAAA,CAAK,OAAO,CAAC,CAAA,KAAA,CAAO,CAAC,CAAA;AACpF;AAOA,eAAsB,YAAA,CAAa,OAAA,GAA+B,EAAC,EAA6B;AAG9F,EAAA,IAAI,OAAA,CAAQ,OAAO,OAAO,IAAA;AAC1B,EAAA,MAAM,OAAA,GAAU,iBAAA,CAAkB,OAAA,CAAQ,KAAK,CAAA;AAE/C,EAAA,IAAI,QAAQ,UAAA,IAAc,CAAC,YAAA,CAAa,OAAO,GAAG,OAAO,IAAA;AACzD,EAAA,MAAM,IAAA,GAAO,CAAC,MAAA,KAAmC;AAC/C,IAAA,OAAA,CAAQ,gBAAgB,MAAM,CAAA;AAC9B,IAAA,OAAO,IAAA;AAAA,EACT,CAAA;AAIA,EAAA,MAAM,GAAA,GAAW,MAAM,kBAAA,EAAmB;AAC1C,EAAA,IAAI,CAAC,GAAA,EAAK,aAAA,EAAe,OAAO,KAAK,eAAe,CAAA;AAEpD,EAAA,MAAM,QAAQ,aAAA,EAAc;AAC5B,EAAA,IAAI;AACF,IAAG,GAAA,CAAA,SAAA,CAAU,KAAA,EAAO,EAAE,SAAA,EAAW,MAAM,CAAA;AAAA,EACzC,SAAS,CAAA,EAAG;AACV,IAAA,OAAO,IAAA,CAAK,iBAAA,CAAkB,CAAC,CAAA,GAAI,kBAAkB,aAAa,CAAA;AAAA,EACpE;AAEA,EAAA,IAAI;AAMF,IAAA,MAAM,QAAa,MAAM,WAAA;AAAA,MACvB,GAAA,CAAI,cAAc,IAAA,CAAK;AAAA,QACrB,KAAA,EAAO,QAAA,CAAS,GAAA,EAAK,OAAO,CAAA;AAAA,QAC5B,QAAA,EAAU,KAAA;AAAA,QACV,oBAAA,EAAsB,QAAQ,oBAAA,IAAwB;AAAA,OACvD,CAAA;AAAA,MACD,kBAAA,EAAmB;AAAA,MACnB;AAAA,KACF;AAEA,IAAA,IAAI;AACF,MAAG,GAAA,CAAA,aAAA,CAAc,iBAAiB,OAAO,CAAA,EAAA,qBAAO,IAAA,CAAK,CAAC,CAAA,EAAE,WAAA,EAAa,CAAA;AAAA,IACvE,CAAA,CAAA,MAAQ;AAAA,IAER;AACA,IAAA,OAAO;AAAA,MACL,EAAA,EAAI,OAAA;AAAA,MACJ,MAAM,MAAM,KAAA,EAAO;AACjB,QAAA,MAAM,MAAkB,EAAC;AACzB,QAAA,WAAA,MAAiB,KAAA,IAAS,KAAA,CAAM,KAAA,CAAM,KAAA,EAAO,EAAE,CAAA,EAAG;AAChD,UAAA,KAAA,MAAW,KAAK,KAAA,EAAO,GAAA,CAAI,KAAK,KAAA,CAAM,IAAA,CAAK,CAAsB,CAAC,CAAA;AAAA,QACpE;AACA,QAAA,OAAO,GAAA;AAAA,MACT,CAAA;AAAA,MACA,MAAM,WAAW,IAAA,EAAM;AACrB,QAAA,MAAM,CAAA,GAAI,MAAM,KAAA,CAAM,UAAA,CAAW,IAAI,CAAA;AACrC,QAAA,OAAO,KAAA,CAAM,KAAK,CAAsB,CAAA;AAAA,MAC1C;AAAA,KACF;AAAA,EACF,SAAS,CAAA,EAAG;AACV,IAAA,OAAO,IAAA,CAAK,iBAAA,CAAkB,CAAC,CAAA,GAAI,kBAAkB,iBAAiB,CAAA;AAAA,EACxE;AACF;AAWA,eAAe,kBAAA,GAAmC;AAChD,EAAA,MAAM,OAAA,GAAU,QAAQ,GAAA,CAAI,sBAAA;AAC5B,EAAA,IAAI,OAAA,EAAS;AACX,IAAA,IAAI;AACF,MAAA,MAAM,GAAA,GAAM,aAAA,CAAmB,KAAA,CAAA,IAAA,CAAK,OAAA,EAAS,cAAc,CAAC,CAAA;AAC5D,MAAA,MAAM,GAAA,GAAW,MAAM,OAAO,aAAA,CAAc,IAAI,OAAA,CAAQ,WAAW,CAAC,CAAA,CAAE,IAAA,CAAA;AAEtE,MAAA,MAAM,QAAA,GAAW,GAAA,EAAK,aAAA,GAAgB,GAAA,GAAM,GAAA,EAAK,OAAA;AACjD,MAAA,IAAI,QAAA,EAAU,eAAe,OAAO,QAAA;AAAA,IACtC,CAAA,CAAA,MAAQ;AAAA,IAER;AAAA,EACF;AACA,EAAA,OAAO,MAAM,OAAO,WAAqB,CAAA,CAAE,KAAA,CAAM,MAAM,IAAI,CAAA;AAC7D;AAGA,SAAS,kBAAA,GAA6B;AACpC,EAAA,MAAM,CAAA,GAAI,MAAA,CAAO,OAAA,CAAQ,GAAA,CAAI,mBAAmB,CAAA;AAChD,EAAA,OAAO,OAAO,QAAA,CAAS,CAAC,CAAA,IAAK,CAAA,GAAI,IAAI,CAAA,GAAI,GAAA;AAC3C;AAGA,eAAsB,WAAA,CAAe,OAAA,EAAqB,EAAA,EAAY,OAAA,EAA6B;AACjG,EAAA,IAAI,KAAA;AACJ,EAAA,IAAI;AACF,IAAA,OAAO,MAAM,QAAQ,IAAA,CAAK;AAAA,MACxB,OAAA;AAAA,MACA,IAAI,OAAA,CAAe,CAAC,CAAA,EAAG,MAAA,KAAW;AAChC,QAAA,KAAA,GAAQ,UAAA,CAAW,MAAM,MAAA,CAAO,IAAI,MAAM,OAAO,CAAC,GAAG,EAAE,CAAA;AACvD,QAAA,KAAA,CAAM,KAAA,IAAQ;AAAA,MAChB,CAAC;AAAA,KACF,CAAA;AAAA,EACH,CAAA,SAAE;AACA,IAAA,YAAA,CAAa,KAAK,CAAA;AAAA,EACpB;AACF;AAEA,SAAS,QAAA,CAAS,KAAU,EAAA,EAAqB;AAC/C,EAAA,MAAM,CAAA,GAAI,GAAA,CAAI,cAAA,IAAkB,EAAC;AACjC,EAAA,IAAI,YAAA,CAAa,KAAK,EAAE,CAAA,SAAU,CAAA,CAAE,aAAA,IAAiB,EAAE,UAAA,IAAc,EAAA;AACrE,EAAA,IAAI,YAAY,IAAA,CAAK,EAAE,CAAA,EAAG,OAAO,EAAE,YAAA,IAAgB,EAAA;AACnD,EAAA,IAAI,cAAc,IAAA,CAAK,EAAE,CAAA,EAAG,OAAO,EAAE,aAAA,IAAiB,EAAA;AACtD,EAAA,OAAO,EAAA;AACT;AAGA,IAAM,UAAA,uBAAiB,GAAA,CAAI;AAAA,EACzB,KAAA;AAAA,EAAO,KAAA;AAAA,EAAO,MAAA;AAAA,EAAQ,KAAA;AAAA,EAAO,MAAA;AAAA,EAAQ,MAAA;AAAA,EAAQ,OAAA;AAAA,EAAS,KAAA;AAAA,EAAO,OAAA;AAAA,EAAS,MAAA;AAAA,EACtE,UAAA;AAAA,EAAY,KAAA;AAAA,EAAO,MAAA;AAAA,EAAQ,OAAA;AAAA,EAAS,WAAA;AAAA,EAAa,MAAA;AAAA,EAAQ,cAAA;AAAA,EAAgB,UAAA;AAAA,EACzE,KAAA;AAAA,EAAO,SAAA;AAAA,EAAW,MAAA;AAAA,EAAQ,MAAA;AAAA,EAAQ,KAAA;AAAA,EAAO,KAAA;AAAA,EAAO;AAClD,CAAC,CAAA;AAGD,SAAS,YAAY,IAAA,EAAsB;AACzC,EAAA,MAAM,KAAA,GAAQ,IAAA,CAAK,KAAA,CAAM,GAAG,CAAA;AAC5B,EAAA,MAAM,QAAQ,KAAA,CAAM,GAAA,MAAS,EAAA,EAAI,OAAA,CAAQ,YAAY,EAAE,CAAA;AACvD,EAAA,MAAM,IAAA,GAAO,KAAA,CAAM,MAAA,CAAO,CAAC,CAAA,KAAM,CAAA,IAAK,CAAC,UAAA,CAAW,GAAA,CAAI,CAAA,CAAE,WAAA,EAAa,CAAC,CAAA;AACtE,EAAA,OAAO,CAAC,GAAG,IAAA,CAAK,KAAA,CAAM,EAAE,CAAA,EAAG,IAAI,CAAA,CAAE,MAAA,CAAO,OAAO,CAAA,CAAE,IAAA,CAAK,GAAG,CAAA;AAC3D;AAYO,SAAS,aAAA,CAAc,MAAiB,SAAA,EAA4B;AACzE,EAAA,IAAI,IAAA,CAAK,SAAS,UAAA,EAAY;AAC5B,IAAA,MAAM,YAAY,IAAA,CAAK,SAAA,IAAa,UAAA,EAAY,OAAA,CAAQ,cAAc,EAAE,CAAA;AAExE,IAAA,MAAM,aAAA,GAAwC;AAAA,MAC5C,QAAA,EAAU,4DAAA;AAAA,MACV,MAAA,EAAQ,0CAAA;AAAA,MACR,OAAA,EAAS,uDAAA;AAAA,MACT,EAAA,EAAI,2EAAA;AAAA,MACJ,cAAA,EAAgB,+DAAA;AAAA,MAChB,cAAA,EAAgB,uDAAA;AAAA,MAChB,aAAA,EAAe,iDAAA;AAAA,MACf,SAAA,EAAW,2CAAA;AAAA,MACX,KAAA,EAAO,uEAAA;AAAA,MACP,aAAA,EAAe,sDAAA;AAAA,MACf,QAAA,EAAU;AAAA,KACZ;AACA,IAAA,MAAM,IAAA,GAAO,aAAA,CAAc,QAAQ,CAAA,IAAK,QAAA;AACxC,IAAA,OAAO;AAAA,MACL,IAAA,CAAK,aAAA;AAAA,MACL,UAAA;AAAA,MACA,QAAA;AAAA,MACA,IAAA;AAAA,MACA,WAAA,CAAY,KAAK,IAAI,CAAA;AAAA,MAAA,CACpB,IAAA,CAAK,GAAA,IAAO,EAAA,EAAI,KAAA,CAAM,GAAG,GAAI;AAAA,KAChC,CACG,MAAA,CAAO,OAAO,CAAA,CACd,KAAK,IAAI,CAAA;AAAA,EACd;AACA,EAAA,OAAO,CAAC,KAAK,aAAA,EAAe,IAAA,CAAK,MAAM,IAAA,CAAK,SAAA,IAAa,EAAA,EAAI,IAAA,CAAK,GAAA,IAAO,EAAA,EAAI,YAAY,IAAA,CAAK,IAAI,GAAG,SAAA,IAAa,EAAE,EACjH,MAAA,CAAO,OAAO,CAAA,CACd,IAAA,CAAK,GAAG,CAAA;AACb;AAEO,SAAS,MAAA,CAAO,GAAa,CAAA,EAAqB;AACvD,EAAA,IAAI,GAAA,GAAM,CAAA;AACV,EAAA,IAAI,EAAA,GAAK,CAAA;AACT,EAAA,IAAI,EAAA,GAAK,CAAA;AACT,EAAA,MAAM,IAAI,IAAA,CAAK,GAAA,CAAI,CAAA,CAAE,MAAA,EAAQ,EAAE,MAAM,CAAA;AACrC,EAAA,KAAA,IAAS,CAAA,GAAI,CAAA,EAAG,CAAA,GAAI,CAAA,EAAG,CAAA,EAAA,EAAK;AAC1B,IAAA,GAAA,IAAO,CAAA,CAAE,CAAC,CAAA,GAAI,CAAA,CAAE,CAAC,CAAA;AACjB,IAAA,EAAA,IAAM,CAAA,CAAE,CAAC,CAAA,GAAI,CAAA,CAAE,CAAC,CAAA;AAChB,IAAA,EAAA,IAAM,CAAA,CAAE,CAAC,CAAA,GAAI,CAAA,CAAE,CAAC,CAAA;AAAA,EAClB;AACA,EAAA,IAAI,EAAA,KAAO,CAAA,IAAK,EAAA,KAAO,CAAA,EAAG,OAAO,CAAA;AACjC,EAAA,OAAO,OAAO,IAAA,CAAK,IAAA,CAAK,EAAE,CAAA,GAAI,IAAA,CAAK,KAAK,EAAE,CAAA,CAAA;AAC5C;AAWA,IAAM,WAAA,GAAc,GAAA;AAEpB,IAAM,uBAAA,GAA0B,IAAA;AAEhC,SAAS,eAAA,CAAgB,MAAc,OAAA,EAAyB;AAC9D,EAAA,OAAY,KAAA,CAAA,IAAA,CAAK,SAAS,IAAI,CAAA,EAAG,cAAc,IAAA,CAAK,OAAO,CAAC,CAAA,KAAA,CAAO,CAAA;AACrE;AAOO,SAAS,YAAA,CAAa,KAAA,EAAgB,IAAA,EAAc,OAAA,EAAyB;AAClF,EAAA,MAAM,UAAU,gBAAA,CAAiB,eAAA,CAAgB,IAAA,EAAM,OAAO,GAAG,OAAO,CAAA;AACxE,EAAA,MAAM,SAAA,GAAY,IAAI,GAAA,CAAI,KAAA,CAAM,MAAM,GAAA,CAAI,CAAC,CAAA,KAAM,CAAC,CAAA,CAAE,EAAA,EAAI,CAAA,CAAE,KAAK,CAAU,CAAC,CAAA;AAC1E,EAAA,IAAI,OAAA,GAAU,CAAA;AACd,EAAA,KAAA,MAAW,CAAA,IAAK,MAAM,KAAA,EAAO;AAE3B,IAAA,IAAI,CAAA,CAAE,IAAA,KAAS,MAAA,IAAU,CAAA,CAAE,SAAS,UAAA,EAAY;AAChD,IAAA,MAAM,CAAA,GAAI,WAAW,aAAA,CAAc,CAAA,EAAG,UAAU,GAAA,CAAI,CAAA,CAAE,IAAI,CAAC,CAAC,CAAA;AAC5D,IAAA,MAAM,MAAA,GAAS,OAAA,CAAQ,CAAA,CAAE,EAAE,CAAA;AAC3B,IAAA,IAAI,CAAC,MAAA,IAAU,MAAA,CAAO,IAAA,KAAS,CAAA,EAAG,OAAA,EAAA;AAAA,EACpC;AACA,EAAA,OAAO,OAAA;AACT;AAEA,SAAS,gBAAA,CAAiB,MAAc,OAAA,EAAwC;AAC9E,EAAA,IAAI,CAAI,GAAA,CAAA,UAAA,CAAW,IAAI,CAAA,SAAU,EAAC;AAClC,EAAA,IAAI;AACF,IAAA,MAAM,SAAS,IAAA,CAAK,KAAA,CAAS,GAAA,CAAA,YAAA,CAAa,IAAA,EAAM,MAAM,CAAC,CAAA;AACvD,IAAA,IAAI,OAAO,KAAA,KAAU,OAAA,IAAW,MAAA,CAAO,OAAA,SAAgB,MAAA,CAAO,OAAA;AAAA,EAChE,CAAA,CAAA,MAAQ;AAAA,EAER;AACA,EAAA,OAAO,EAAC;AACV;AAYA,eAAsB,iBAAA,CACpB,KAAA,EACA,QAAA,EACA,IAAA,EACA,UAAA,EACgC;AAChC,EAAA,MAAM,IAAA,GAAO,eAAA,CAAgB,IAAA,EAAM,QAAA,CAAS,EAAE,CAAA;AAC9C,EAAA,IAAI,QAAoB,EAAE,KAAA,EAAO,SAAS,EAAA,EAAI,OAAA,EAAS,EAAC,EAAE;AAC1D,EAAA,IAAO,GAAA,CAAA,UAAA,CAAW,IAAI,CAAA,EAAG;AACvB,IAAA,IAAI;AACF,MAAA,MAAM,SAAS,IAAA,CAAK,KAAA,CAAS,GAAA,CAAA,YAAA,CAAa,IAAA,EAAM,MAAM,CAAC,CAAA;AACvD,MAAA,IAAI,OAAO,KAAA,KAAU,QAAA,CAAS,EAAA,IAAM,MAAA,CAAO,SAAS,KAAA,GAAQ,MAAA;AAAA,IAC9D,CAAA,CAAA,MAAQ;AAAA,IAER;AAAA,EACF;AAEA,EAAA,MAAM,SAAA,GAAY,IAAI,GAAA,CAAI,KAAA,CAAM,MAAM,GAAA,CAAI,CAAC,CAAA,KAAM,CAAC,CAAA,CAAE,EAAA,EAAI,CAAA,CAAE,KAAK,CAAU,CAAC,CAAA;AAE1E,EAAA,MAAM,OAAA,GAAU,KAAA,CAAM,KAAA,CAAM,MAAA,CAAO,CAAC,CAAA,KAAM,CAAA,CAAE,IAAA,KAAS,MAAA,IAAU,CAAA,CAAE,IAAA,KAAS,UAAU,CAAA;AACpF,EAAA,MAAM,UAAwD,EAAC;AAC/D,EAAA,MAAM,OAAA,uBAAc,GAAA,EAAsB;AAC1C,EAAA,KAAA,MAAW,KAAK,OAAA,EAAS;AACvB,IAAA,MAAM,OAAO,aAAA,CAAc,CAAA,EAAG,UAAU,GAAA,CAAI,CAAA,CAAE,IAAI,CAAC,CAAA;AACnD,IAAA,MAAM,CAAA,GAAI,WAAW,IAAI,CAAA;AACzB,IAAA,MAAM,MAAA,GAAS,KAAA,CAAM,OAAA,CAAQ,CAAA,CAAE,EAAE,CAAA;AACjC,IAAA,IAAI,MAAA,IAAU,OAAO,IAAA,KAAS,CAAA,UAAW,GAAA,CAAI,CAAA,CAAE,EAAA,EAAI,MAAA,CAAO,GAAG,CAAA;AAAA,SACxD,OAAA,CAAQ,KAAK,EAAE,EAAA,EAAI,EAAE,EAAA,EAAI,IAAA,EAAM,IAAA,EAAM,CAAA,EAAG,CAAA;AAAA,EAC/C;AAGA,EAAA,MAAM,UAAU,MAAY;AAC1B,IAAA,IAAI;AACF,MAAG,cAAU,QAAA,CAAS,IAAI,GAAG,EAAE,SAAA,EAAW,MAAM,CAAA;AAChD,MAAA,MAAM,GAAA,GAAM,CAAA,EAAG,IAAI,CAAA,KAAA,EAAQ,QAAQ,GAAG,CAAA,CAAA;AACtC,MAAG,GAAA,CAAA,aAAA,CAAc,GAAA,EAAK,IAAA,CAAK,SAAA,CAAU,KAAK,CAAC,CAAA;AAC3C,MAAG,GAAA,CAAA,UAAA,CAAW,KAAK,IAAI,CAAA;AAAA,IACzB,CAAA,CAAA,MAAQ;AAAA,IAER;AAAA,EACF,CAAA;AAEA,EAAA,IAAI,QAAQ,MAAA,EAAQ;AAIlB,IAAA,MAAM,IAAA,GAAO,GAAG,IAAI,CAAA,KAAA,CAAA;AACpB,IAAA,IAAI,CAAC,WAAA,CAAY,IAAI,CAAA,EAAG,OAAO,OAAA;AAC/B,IAAA,IAAI;AACF,MAAA,UAAA,GAAa,CAAA,EAAG,QAAQ,MAAM,CAAA;AAC9B,MAAA,IAAI,SAAA,GAAY,KAAK,GAAA,EAAI;AACzB,MAAA,KAAA,IAAS,IAAI,CAAA,EAAG,CAAA,GAAI,OAAA,CAAQ,MAAA,EAAQ,KAAK,WAAA,EAAa;AACpD,QAAA,MAAM,KAAA,GAAQ,OAAA,CAAQ,KAAA,CAAM,CAAA,EAAG,IAAI,WAAW,CAAA;AAC9C,QAAA,MAAM,IAAA,GAAO,MAAM,QAAA,CAAS,KAAA,CAAM,KAAA,CAAM,IAAI,CAAC,CAAA,KAAM,CAAA,CAAE,IAAI,CAAC,CAAA;AAC1D,QAAA,KAAA,CAAM,OAAA,CAAQ,CAAC,CAAA,EAAG,CAAA,KAAM;AACtB,UAAA,MAAM,GAAA,GAAM,IAAA,CAAK,CAAC,CAAA,IAAK,EAAC;AACxB,UAAA,OAAA,CAAQ,GAAA,CAAI,CAAA,CAAE,EAAA,EAAI,GAAG,CAAA;AACrB,UAAA,KAAA,CAAM,OAAA,CAAQ,EAAE,EAAE,CAAA,GAAI,EAAE,IAAA,EAAM,CAAA,CAAE,MAAM,GAAA,EAAI;AAAA,QAC5C,CAAC,CAAA;AACD,QAAA,UAAA,GAAa,IAAA,CAAK,IAAI,CAAA,GAAI,WAAA,EAAa,QAAQ,MAAM,CAAA,EAAG,QAAQ,MAAM,CAAA;AAEtE,QAAA,IAAI,IAAA,CAAK,GAAA,EAAI,GAAI,SAAA,IAAa,uBAAA,EAAyB;AACrD,UAAA,OAAA,EAAQ;AACR,UAAA,SAAA,GAAY,KAAK,GAAA,EAAI;AAAA,QACvB;AAAA,MACF;AAEA,MAAA,MAAM,IAAA,GAAO,IAAI,GAAA,CAAI,OAAA,CAAQ,IAAI,CAAC,CAAA,KAAM,CAAA,CAAE,EAAE,CAAC,CAAA;AAC7C,MAAA,KAAA,MAAW,EAAA,IAAM,MAAA,CAAO,IAAA,CAAK,KAAA,CAAM,OAAO,CAAA,EAAG,IAAI,CAAC,IAAA,CAAK,IAAI,EAAE,CAAA,EAAG,OAAO,KAAA,CAAM,QAAQ,EAAE,CAAA;AACvF,MAAA,OAAA,EAAQ;AAAA,IACV,CAAA,SAAE;AACA,MAAA,WAAA,CAAY,IAAI,CAAA;AAAA,IAClB;AAAA,EACF;AAEA,EAAA,OAAO,OAAA;AACT;AAEA,SAAS,KAAK,EAAA,EAAoB;AAChC,EAAA,OAAO,EAAA,CAAG,OAAA,CAAQ,gBAAA,EAAkB,GAAG,CAAA;AACzC;;;ACteO,IAAM,aAAN,MAAiB;AAAA,EAKtB,YAAqB,KAAA,EAAgB;AAAhB,IAAA,IAAA,CAAA,KAAA,GAAA,KAAA;AACnB,IAAA,KAAA,MAAW,CAAA,IAAK,MAAM,KAAA,EAAO,IAAA,CAAK,SAAS,GAAA,CAAI,CAAA,CAAE,IAAI,CAAC,CAAA;AACtD,IAAA,KAAA,MAAW,CAAA,IAAK,MAAM,KAAA,EAAO;AAC3B,MAAA,IAAA,CAAK,IAAA,CAAK,OAAA,EAAS,CAAA,CAAE,GAAA,EAAK,CAAC,CAAA;AAC3B,MAAA,IAAA,CAAK,IAAA,CAAK,MAAA,EAAQ,CAAA,CAAE,GAAA,EAAK,CAAC,CAAA;AAAA,IAC5B;AAAA,EACF;AAAA,EANqB,KAAA;AAAA,EAJZ,QAAA,uBAAe,GAAA,EAAuB;AAAA,EACvC,OAAA,uBAAc,GAAA,EAAyB;AAAA,EACvC,MAAA,uBAAa,GAAA,EAAyB;AAAA,EAU9C,GAAA,CAAI,IAAY,IAAA,EAA8B;AAC5C,IAAA,MAAM,MAAM,IAAA,CAAK,OAAA,CAAQ,GAAA,CAAI,EAAE,KAAK,EAAC;AACrC,IAAA,OAAO,IAAA,GAAO,IAAI,MAAA,CAAO,CAAC,MAAM,CAAA,CAAE,IAAA,KAAS,IAAI,CAAA,GAAI,GAAA;AAAA,EACrD;AAAA,EAEA,EAAA,CAAG,IAAY,IAAA,EAA8B;AAC3C,IAAA,MAAM,MAAM,IAAA,CAAK,MAAA,CAAO,GAAA,CAAI,EAAE,KAAK,EAAC;AACpC,IAAA,OAAO,IAAA,GAAO,IAAI,MAAA,CAAO,CAAC,MAAM,CAAA,CAAE,IAAA,KAAS,IAAI,CAAA,GAAI,GAAA;AAAA,EACrD;AAAA,EAEA,KAAK,EAAA,EAAmC;AACtC,IAAA,OAAO,IAAA,CAAK,QAAA,CAAS,GAAA,CAAI,EAAE,CAAA;AAAA,EAC7B;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EASA,QAAQ,EAAA,EAAoD;AAC1D,IAAA,OAAO,IAAA,CAAK,eAAe,IAAA,CAAK,GAAA,CAAI,EAAE,CAAA,CAAE,MAAA,CAAO,WAAW,CAAA,EAAG,KAAK,CAAA;AAAA,EACpE;AAAA;AAAA,EAGA,QAAQ,EAAA,EAAoD;AAC1D,IAAA,OAAO,IAAA,CAAK,eAAe,IAAA,CAAK,EAAA,CAAG,EAAE,CAAA,CAAE,MAAA,CAAO,WAAW,CAAA,EAAG,KAAK,CAAA;AAAA,EACnE;AAAA,EAEQ,cAAA,CAAe,OAAoB,GAAA,EAAoB;AAC7D,IAAA,MAAM,MAA8C,EAAC;AACrD,IAAA,KAAA,MAAW,KAAK,KAAA,EAAO;AACrB,MAAA,MAAM,OAAO,IAAA,CAAK,QAAA,CAAS,GAAA,CAAI,CAAA,CAAE,GAAG,CAAC,CAAA;AACrC,MAAA,IAAI,MAAM,GAAA,CAAI,IAAA,CAAK,EAAE,IAAA,EAAM,CAAA,EAAG,MAAM,CAAA;AAAA,IACtC;AACA,IAAA,OAAO,GAAA;AAAA,EACT;AACF;AAEA,IAAM,8BAAqC,IAAI,GAAA,CAAI,CAAC,MAAA,EAAQ,YAAY,CAAC,CAAA;AACzE,SAAS,YAAY,CAAA,EAAuB;AAC1C,EAAA,OAAO,WAAA,CAAY,GAAA,CAAI,CAAA,CAAE,IAAI,CAAA;AAC/B;AAEA,SAAS,IAAA,CAAK,GAAA,EAA+B,GAAA,EAAa,KAAA,EAAwB;AAChF,EAAA,MAAM,IAAA,GAAO,GAAA,CAAI,GAAA,CAAI,GAAG,CAAA;AACxB,EAAA,IAAI,IAAA,EAAM,IAAA,CAAK,IAAA,CAAK,KAAK,CAAA;AAAA,OACpB,GAAA,CAAI,GAAA,CAAI,GAAA,EAAK,CAAC,KAAK,CAAC,CAAA;AAC3B;AAoBA,IAAM,WAAA,uBAAkB,OAAA,EAA6B;AAE9C,SAAS,SAAS,KAAA,EAA4B;AACnD,EAAA,IAAI,GAAA,GAAM,WAAA,CAAY,GAAA,CAAI,KAAK,CAAA;AAC/B,EAAA,IAAI,CAAC,GAAA,EAAK;AACR,IAAA,GAAA,GAAM,IAAI,WAAW,KAAK,CAAA;AAC1B,IAAA,WAAA,CAAY,GAAA,CAAI,OAAO,GAAG,CAAA;AAAA,EAC5B;AACA,EAAA,OAAO,GAAA;AACT;;;AC7DA,IAAM,SAAA,uBAAgB,GAAA,CAAI;AAAA,EACxB,KAAA;AAAA,EAAO,GAAA;AAAA,EAAK,IAAA;AAAA,EAAM,IAAA;AAAA,EAAM,KAAA;AAAA,EAAO,KAAA;AAAA,EAAO,MAAA;AAAA,EAAQ,IAAA;AAAA,EAAM,IAAA;AAAA,EAAM,IAAA;AAAA,EAAM,IAAA;AAAA,EAAM,IAAA;AAAA,EAAM,KAAA;AAAA,EAAO,KAAA;AAAA,EAAO,IAAA;AAAA,EAC1F,OAAA;AAAA,EAAS,MAAA;AAAA,EAAQ,OAAA;AAAA,EAAS,KAAA;AAAA,EAAO,IAAA;AAAA,EAAM,MAAA;AAAA,EAAQ,KAAA;AAAA,EAAO,GAAA;AAAA,EAAK,IAAA;AAAA,EAAM,IAAA;AAAA,EAAM,MAAA;AAAA,EAAQ,MAAA;AAAA,EAAQ,MAAA;AAAA,EACvF,MAAA;AAAA,EAAQ,KAAA;AAAA,EAAO,KAAA;AAAA,EAAO,KAAA;AAAA,EAAO,QAAA;AAAA,EAAU,IAAA;AAAA,EAAM,KAAA;AAAA,EAAO,KAAA;AAAA,EAAO,MAAA;AAAA,EAAQ,MAAA;AAAA,EAAQ,IAAA;AAAA,EAAM,IAAA;AAAA,EAAM,IAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAQvF,MAAA;AAAA,EAAQ,MAAA;AAAA,EAAQ,aAAA;AAAA,EAAe,MAAA;AAAA,EAAQ,QAAA;AAAA,EAAU,IAAA;AAAA,EACjD,gBAAA;AAAA,EAAkB,SAAA;AAAA,EAAW,OAAA;AAAA,EAAS,UAAA;AAAA,EAAY,UAAA;AAAA,EAAY;AAChE,CAAC,CAAA;AAEM,SAAS,UAAA,CAAW,KAAA,EAAgB,QAAA,EAAkB,OAAA,GAAwB,EAAC,EAAgB;AACpG,EAAA,MAAM,MAAA,GAAS,QAAQ,MAAA,IAAU,GAAA;AACjC,EAAA,MAAM,KAAA,GAAQ,QAAQ,KAAA,IAAS,EAAA;AAC/B,EAAA,MAAM,KAAA,GAAQ,SAAS,QAAQ,CAAA;AAC/B,EAAA,MAAM,QAAA,GAAW,WAAA,CAAY,KAAA,EAAO,KAAK,CAAA;AACzC,EAAA,MAAM,KAAA,GAAQ,SAAS,KAAK,CAAA;AAE5B,EAAA,MAAM,SAAuB,EAAC;AAC9B,EAAA,KAAA,MAAW,IAAA,IAAQ,MAAM,KAAA,EAAO;AAC9B,IAAA,IAAI,IAAA,CAAK,IAAA,KAAS,MAAA,IAAU,IAAA,CAAK,SAAS,UAAA,EAAY;AACtD,IAAA,MAAM,EAAE,KAAA,EAAO,GAAA,KAAQ,SAAA,CAAU,IAAA,EAAM,OAAO,QAAQ,CAAA;AACtD,IAAA,IAAI,KAAA,GAAQ,CAAA,EAAG,MAAA,CAAO,IAAA,CAAK,EAAE,IAAA,EAAM,KAAA,EAAO,KAAA,CAAM,KAAA,IAAS,IAAI,iBAAA,GAAoB,IAAA,CAAK,UAAA,CAAW,CAAA,EAAG,KAAK,CAAA;AAAA,EAC3G;AACA,EAAA,MAAA,CAAO,IAAA,CAAK,CAAC,CAAA,EAAG,CAAA,KAAM,EAAE,KAAA,GAAQ,CAAA,CAAE,KAAA,IAAS,CAAA,CAAE,KAAK,aAAA,CAAc,aAAA,CAAc,CAAA,CAAE,IAAA,CAAK,aAAa,CAAC,CAAA;AAEnG,EAAA,MAAM,KAAA,GAAQ,MAAA,CAAO,KAAA,CAAM,CAAA,EAAG,KAAK,CAAA;AACnC,EAAA,MAAM,EAAE,SAAS,cAAA,EAAe,GAAI,aAAa,KAAA,EAAO,KAAA,EAAO,QAAA,EAAU,KAAA,EAAO,MAAM,CAAA;AAEtF,EAAA,OAAO,EAAE,QAAA,EAAU,OAAA,EAAS,KAAA,EAAO,SAAS,cAAA,EAAe;AAC7D;AAeA,eAAsB,kBAAA,CACpB,KAAA,EACA,QAAA,EACA,OAAA,EACsB;AACtB,EAAA,MAAM,MAAA,GAAS,QAAQ,MAAA,IAAU,GAAA;AACjC,EAAA,MAAM,KAAA,GAAQ,QAAQ,KAAA,IAAS,EAAA;AAC/B,EAAA,MAAM,KAAA,GAAQ,SAAS,QAAQ,CAAA;AAC/B,EAAA,MAAM,QAAA,GAAW,WAAA,CAAY,KAAA,EAAO,KAAK,CAAA;AACzC,EAAA,MAAM,KAAA,GAAQ,SAAS,KAAK,CAAA;AAC5B,EAAA,MAAM,QAAA,GAAW,MAAM,OAAA,CAAQ,QAAA,CAAS,WAAW,QAAQ,CAAA;AAG3D,EAAA,MAAM,MAAA,uBAAa,GAAA,EAAoB;AACvC,EAAA,IAAI,MAAA,GAAS,CAAA;AACb,EAAA,MAAM,OAAA,uBAAc,GAAA,EAAoB;AACxC,EAAA,KAAA,MAAW,IAAA,IAAQ,MAAM,KAAA,EAAO;AAC9B,IAAA,IAAI,IAAA,CAAK,IAAA,KAAS,MAAA,IAAU,IAAA,CAAK,SAAS,UAAA,EAAY;AACtD,IAAA,MAAM,EAAE,KAAA,EAAO,GAAA,KAAQ,SAAA,CAAU,IAAA,EAAM,OAAO,QAAQ,CAAA;AACtD,IAAA,MAAA,CAAO,GAAA,CAAI,IAAA,CAAK,EAAA,EAAI,KAAK,CAAA;AACzB,IAAA,OAAA,CAAQ,GAAA,CAAI,IAAA,CAAK,EAAA,EAAI,GAAG,CAAA;AACxB,IAAA,IAAI,KAAA,GAAQ,QAAQ,MAAA,GAAS,KAAA;AAAA,EAC/B;AAEA,EAAA,MAAM,SAAuB,EAAC;AAC9B,EAAA,KAAA,MAAW,IAAA,IAAQ,MAAM,KAAA,EAAO;AAC9B,IAAA,IAAI,IAAA,CAAK,IAAA,KAAS,MAAA,IAAU,IAAA,CAAK,SAAS,UAAA,EAAY;AACtD,IAAA,MAAM,OAAA,GAAU,SAAS,CAAA,GAAA,CAAK,MAAA,CAAO,IAAI,IAAA,CAAK,EAAE,CAAA,IAAK,CAAA,IAAK,MAAA,GAAS,CAAA;AACnE,IAAA,MAAM,GAAA,GAAM,OAAA,CAAQ,WAAA,CAAY,GAAA,CAAI,KAAK,EAAE,CAAA;AAC3C,IAAA,MAAM,GAAA,GAAM,MAAM,IAAA,CAAK,GAAA,CAAI,GAAG,MAAA,CAAO,QAAA,EAAU,GAAG,CAAC,CAAA,GAAI,CAAA;AACvD,IAAA,MAAM,MAAA,GAAS,GAAA,GAAM,OAAA,GAAU,GAAA,GAAM,GAAA;AACrC,IAAA,IAAI,UAAU,CAAA,EAAG;AACjB,IAAA,MAAM,MAAA,GAAS,OAAA,CAAQ,GAAA,CAAI,IAAA,CAAK,EAAE,CAAA;AAClC,IAAA,MAAM,GAAA,GAAM,WAAW,GAAA,GAAM,GAAA,GAAM,mBAAmB,GAAA,CAAI,OAAA,CAAQ,CAAC,CAAC,CAAA,CAAA,CAAA,GAAM,YAAA,CAAA;AAC1E,IAAA,MAAA,CAAO,IAAA,CAAK,EAAE,IAAA,EAAM,KAAA,EAAO,KAAA,CAAM,MAAA,IAAU,CAAA,GAAI,iBAAA,GAAoB,IAAA,CAAK,UAAA,CAAW,CAAA,EAAG,GAAA,EAAK,CAAA;AAAA,EAC7F;AACA,EAAA,MAAA,CAAO,IAAA,CAAK,CAAC,CAAA,EAAG,CAAA,KAAM,EAAE,KAAA,GAAQ,CAAA,CAAE,KAAA,IAAS,CAAA,CAAE,KAAK,aAAA,CAAc,aAAA,CAAc,CAAA,CAAE,IAAA,CAAK,aAAa,CAAC,CAAA;AAEnG,EAAA,MAAM,KAAA,GAAQ,MAAA,CAAO,KAAA,CAAM,CAAA,EAAG,KAAK,CAAA;AACnC,EAAA,MAAM,EAAE,SAAS,cAAA,EAAe,GAAI,aAAa,KAAA,EAAO,KAAA,EAAO,QAAA,EAAU,KAAA,EAAO,MAAM,CAAA;AACtF,EAAA,OAAO,EAAE,QAAA,EAAU,OAAA,EAAS,KAAA,EAAO,SAAS,cAAA,EAAe;AAC7D;AAaA,SAAS,SAAS,CAAA,EAAqB;AACrC,EAAA,OAAO;AAAA,IACL,GAAG,IAAI,GAAA;AAAA,MACL,EACG,WAAA,EAAY,CACZ,KAAA,CAAM,iBAAiB,EACvB,MAAA,CAAO,CAAC,CAAA,KAAM,CAAA,CAAE,UAAU,CAAA,IAAK,CAAC,SAAA,CAAU,GAAA,CAAI,CAAC,CAAC;AAAA;AACrD,GACF;AACF;AAEA,SAAS,SAAA,CAAU,IAAA,EAAiB,KAAA,EAAiB,QAAA,GAAkC,MAAM,CAAA,EAAmC;AAC9H,EAAA,IAAI,KAAA,GAAQ,CAAA;AACZ,EAAA,MAAM,OAAiB,EAAC;AACxB,EAAA,MAAM,IAAA,GAAO,IAAA,CAAK,IAAA,CAAK,WAAA,EAAY;AACnC,EAAA,MAAM,EAAA,GAAK,IAAA,CAAK,aAAA,CAAc,WAAA,EAAY;AAC1C,EAAA,MAAM,IAAA,GAAO,IAAA,CAAK,IAAA,CAAK,WAAA,EAAY;AAGnC,EAAA,MAAM,SAAA,GAAY,eAAA,CAAgB,IAAA,CAAK,IAAI,CAAA;AAC3C,EAAA,KAAA,MAAW,KAAK,KAAA,EAAO;AAOrB,IAAA,MAAM,CAAA,GAAI,SAAS,CAAC,CAAA;AACpB,IAAA,IAAI,SAAS,CAAA,EAAG;AACd,MAAA,KAAA,IAAS,EAAA,GAAK,CAAA;AACd,MAAA,IAAA,CAAK,KAAK,CAAC,CAAA;AAAA,IACb,CAAA,MAAA,IAAW,SAAA,CAAU,GAAA,CAAI,CAAC,CAAA,EAAG;AAC3B,MAAA,KAAA,IAAS,CAAA,GAAI,CAAA;AACb,MAAA,IAAA,CAAK,KAAK,CAAC,CAAA;AAAA,IACb,CAAA,MAAA,IAAW,IAAA,CAAK,QAAA,CAAS,CAAC,CAAA,EAAG;AAC3B,MAAA,KAAA,IAAS,CAAA,GAAI,CAAA;AACb,MAAA,IAAA,CAAK,KAAK,CAAC,CAAA;AAAA,IACb,CAAA,MAAA,IAAW,EAAA,CAAG,QAAA,CAAS,CAAC,CAAA,EAAG;AACzB,MAAA,KAAA,IAAS,CAAA,GAAI,CAAA;AACb,MAAA,IAAA,CAAK,KAAK,CAAC,CAAA;AAAA,IACb,CAAA,MAAA,IAAW,cAAA,CAAe,CAAA,EAAG,SAAS,CAAA,EAAG;AAIvC,MAAA,KAAA,IAAS,CAAA,GAAI,CAAA;AACb,MAAA,IAAA,CAAK,IAAA,CAAK,CAAA,CAAA,EAAI,CAAC,CAAA,CAAE,CAAA;AAAA,IACnB,CAAA,MAAA,IAAW,IAAA,CAAK,QAAA,CAAS,CAAC,CAAA,EAAG;AAC3B,MAAA,KAAA,IAAS,CAAA,GAAI,CAAA;AACb,MAAA,IAAA,CAAK,KAAK,CAAC,CAAA;AAAA,IACb;AAAA,EACF;AACA,EAAA,OAAO,EAAE,KAAA,EAAO,GAAA,EAAK,IAAA,CAAK,MAAA,GAAS,CAAA,SAAA,EAAY,IAAA,CAAK,IAAA,CAAK,IAAI,CAAC,CAAA,CAAA,GAAK,EAAA,EAAG;AACxE;AAQA,IAAM,iBAAA,GAAoB,GAAA;AAU1B,SAAS,WAAA,CAAY,OAAgB,KAAA,EAAwC;AAC3E,EAAA,IAAI,KAAA,CAAM,MAAA,KAAW,CAAA,EAAG,OAAO,MAAM,CAAA;AACrC,EAAA,MAAM,EAAA,uBAAS,GAAA,EAAoB;AACnC,EAAA,IAAI,CAAA,GAAI,CAAA;AACR,EAAA,KAAA,MAAW,IAAA,IAAQ,MAAM,KAAA,EAAO;AAC9B,IAAA,IAAI,IAAA,CAAK,IAAA,KAAS,MAAA,IAAU,IAAA,CAAK,SAAS,UAAA,EAAY;AACtD,IAAA,CAAA,EAAA;AACA,IAAA,MAAM,IAAA,GAAO,IAAA,CAAK,IAAA,CAAK,WAAA,EAAY;AACnC,IAAA,MAAM,KAAA,GAAQ,eAAA,CAAgB,IAAA,CAAK,IAAI,CAAA;AACvC,IAAA,KAAA,MAAW,KAAK,KAAA,EAAO;AACrB,MAAA,IAAI,MAAM,GAAA,CAAI,CAAC,CAAA,IAAK,IAAA,CAAK,SAAS,CAAC,CAAA,EAAG,EAAA,CAAG,GAAA,CAAI,IAAI,EAAA,CAAG,GAAA,CAAI,CAAC,CAAA,IAAK,KAAK,CAAC,CAAA;AAAA,IACtE;AAAA,EACF;AACA,EAAA,MAAM,CAAA,uBAAQ,GAAA,EAAoB;AAClC,EAAA,KAAA,MAAW,KAAK,KAAA,EAAO;AACrB,IAAA,MAAM,GAAA,GAAM,IAAA,CAAK,GAAA,CAAA,CAAK,CAAA,GAAI,CAAA,KAAA,CAAO,EAAA,CAAG,GAAA,CAAI,CAAC,CAAA,IAAK,CAAA,IAAK,CAAA,CAAE,CAAA,GAAI,CAAA;AAGzD,IAAA,CAAA,CAAE,GAAA,CAAI,CAAA,EAAG,IAAA,CAAK,GAAA,CAAI,GAAA,EAAK,KAAK,GAAA,CAAI,CAAA,EAAG,GAAG,CAAC,CAAC,CAAA;AAAA,EAC1C;AACA,EAAA,OAAO,CAAC,CAAA,KAAc,CAAA,CAAE,GAAA,CAAI,CAAC,CAAA,IAAK,CAAA;AACpC;AAWO,SAAS,gBAAgB,IAAA,EAA2B;AACzD,EAAA,OAAO,IAAI,GAAA;AAAA,IACT,IAAA,CACG,KAAA,CAAM,iEAAiE,CAAA,CACvE,MAAA,CAAO,OAAO,CAAA,CACd,GAAA,CAAI,CAAC,CAAA,KAAM,CAAA,CAAE,WAAA,EAAa;AAAA,GAC/B;AACF;AAGA,SAAS,cAAA,CAAe,MAAc,KAAA,EAA6B;AACjE,EAAA,KAAA,MAAW,QAAQ,KAAA,EAAO;AACxB,IAAA,MAAM,MAAA,GAAS,eAAA,CAAgB,IAAA,EAAM,IAAI,CAAA;AACzC,IAAA,IAAI,MAAA,IAAU,CAAA,IAAK,MAAA,IAAU,GAAA,GAAM,IAAA,CAAK,GAAA,CAAI,IAAA,CAAK,MAAA,EAAQ,IAAA,CAAK,MAAM,CAAA,EAAG,OAAO,IAAA;AAAA,EAChF;AACA,EAAA,OAAO,KAAA;AACT;AAEA,SAAS,eAAA,CAAgB,GAAW,CAAA,EAAmB;AACrD,EAAA,MAAM,IAAI,IAAA,CAAK,GAAA,CAAI,CAAA,CAAE,MAAA,EAAQ,EAAE,MAAM,CAAA;AACrC,EAAA,IAAI,CAAA,GAAI,CAAA;AACR,EAAA,OAAO,IAAI,CAAA,IAAK,CAAA,CAAE,CAAC,CAAA,KAAM,CAAA,CAAE,CAAC,CAAA,EAAG,CAAA,EAAA;AAC/B,EAAA,OAAO,CAAA;AACT;AAEA,SAAS,YAAA,CACP,KAAA,EACA,KAAA,EACA,QAAA,EACA,OACA,MAAA,EAC6C;AAC7C,EAAA,MAAM,QAAkB,EAAC;AACzB,EAAA,KAAA,CAAM,IAAA,CAAK,CAAA,eAAA,EAAkB,QAAQ,CAAA,CAAE,CAAA;AACvC,EAAA,KAAA,CAAM,KAAK,EAAE,CAAA;AACb,EAAA,IAAI,KAAA,CAAM,WAAW,CAAA,EAAG;AACtB,IAAA,KAAA,CAAM,KAAK,wGAAwG,CAAA;AACnH,IAAA,MAAME,KAAAA,GAAO,KAAA,CAAM,IAAA,CAAK,IAAI,CAAA;AAC5B,IAAA,OAAO,EAAE,OAAA,EAASA,KAAAA,EAAM,cAAA,EAAgB,cAAA,CAAeA,KAAI,CAAA,EAAE;AAAA,EAC/D;AAEA,EAAA,KAAA,MAAW,EAAE,IAAA,EAAM,GAAA,EAAI,IAAK,KAAA,EAAO;AACjC,IAAA,MAAM,QAAkB,EAAC;AACzB,IAAA,KAAA,CAAM,IAAA,CAAK,CAAA,GAAA,EAAM,IAAA,CAAK,aAAa,MAAM,IAAA,CAAK,IAAI,CAAA,EAAA,EAAK,IAAA,CAAK,IAAI,CAAA,CAAA,EAAI,IAAA,CAAK,IAAA,CAAK,KAAK,CAAA,CAAA,CAAG,CAAA;AACtF,IAAA,IAAI,KAAK,SAAA,EAAW,KAAA,CAAM,KAAK,GAAA,GAAM,IAAA,CAAK,YAAY,GAAG,CAAA;AACzD,IAAA,MAAM,OAAA,GAAU,KAAA,CAAM,OAAA,CAAQ,IAAA,CAAK,EAAE,CAAA,CAAE,GAAA,CAAI,CAAC,CAAA,KAAM,CAAA,CAAE,IAAA,CAAK,aAAa,CAAA;AACtE,IAAA,MAAM,OAAA,GAAU,KAAA,CAAM,OAAA,CAAQ,IAAA,CAAK,EAAE,CAAA,CAAE,GAAA,CAAI,CAAC,CAAA,KAAM,CAAA,CAAE,IAAA,CAAK,aAAa,CAAA;AACtE,IAAA,IAAI,OAAA,CAAQ,MAAA,EAAQ,KAAA,CAAM,IAAA,CAAK,UAAU,MAAA,CAAO,OAAO,CAAA,CAAE,KAAA,CAAM,GAAG,CAAC,CAAA,CAAE,IAAA,CAAK,IAAI,CAAC,CAAA,CAAE,CAAA;AACjF,IAAA,IAAI,OAAA,CAAQ,MAAA,EAAQ,KAAA,CAAM,IAAA,CAAK,cAAc,MAAA,CAAO,OAAO,CAAA,CAAE,KAAA,CAAM,GAAG,CAAC,CAAA,CAAE,IAAA,CAAK,IAAI,CAAC,CAAA,CAAE,CAAA;AACrF,IAAA,KAAA,CAAM,KAAK,CAAA,WAAA,EAAc,IAAA,CAAK,UAAA,CAAW,OAAA,CAAQ,CAAC,CAAC,CAAA,YAAA,EAAY,IAAA,CAAK,IAAI,GAAG,IAAA,CAAK,KAAA,GAAQ,cAAW,EAAE,CAAA,MAAA,EAAM,GAAG,CAAA,CAAE,CAAA;AAChH,IAAA,KAAA,CAAM,KAAK,EAAE,CAAA;AAEb,IAAA,MAAM,YAAY,KAAA,CAAM,MAAA,CAAO,KAAK,CAAA,CAAE,KAAK,IAAI,CAAA;AAC/C,IAAA,IAAI,eAAe,SAAS,CAAA,GAAI,MAAA,IAAU,KAAA,CAAM,SAAS,CAAA,EAAG;AAC5D,IAAA,KAAA,CAAM,IAAA,CAAK,GAAG,KAAK,CAAA;AAAA,EACrB;AAEA,EAAA,MAAM,IAAA,GAAO,KAAA,CAAM,IAAA,CAAK,IAAI,CAAA;AAC5B,EAAA,OAAO,EAAE,OAAA,EAAS,IAAA,EAAM,cAAA,EAAgB,cAAA,CAAe,IAAI,CAAA,EAAE;AAC/D;AAEA,SAAS,OAAO,EAAA,EAAwB;AACtC,EAAA,OAAO,CAAC,GAAG,IAAI,GAAA,CAAI,EAAE,CAAC,CAAA;AACxB;AAEA,SAAS,eAAe,IAAA,EAAsB;AAE5C,EAAA,OAAO,IAAA,CAAK,IAAA,CAAK,IAAA,CAAK,MAAA,GAAS,CAAC,CAAA;AAClC;AAEA,SAAS,MAAM,CAAA,EAAmB;AAChC,EAAA,OAAO,IAAA,CAAK,KAAA,CAAM,CAAA,GAAI,GAAG,CAAA,GAAI,GAAA;AAC/B;;;ACxSA,IAAM,YAAA,uBAAmB,GAAA,CAAc,CAAC,QAAQ,QAAA,EAAU,SAAA,EAAW,YAAA,EAAc,YAAY,CAAC,CAAA;AAsBzF,SAAS,QAAA,CAAS,KAAA,EAAgB,MAAA,EAAgB,IAAA,GAA2B,EAAC,EAAiB;AACpG,EAAA,MAAM,WAAW,IAAA,CAAK,GAAA,CAAI,CAAA,EAAG,IAAA,CAAK,SAAS,CAAC,CAAA;AAC5C,EAAA,MAAM,KAAA,GAAQ,SAAS,KAAK,CAAA;AAC5B,EAAA,MAAM,IAAA,GAAO,KAAA,CAAM,IAAA,CAAK,MAAM,CAAA;AAE9B,EAAA,MAAM,QAAA,uBAAe,GAAA,EAAwB;AAC7C,EAAA,IAAI,iBAAA,GAAoB,CAAA;AAGxB,EAAA,IAAI,WAA2C,CAAC,EAAE,IAAI,MAAA,EAAQ,IAAA,EAAM,GAAG,CAAA;AACvE,EAAA,KAAA,IAAS,KAAA,GAAQ,CAAA,EAAG,KAAA,IAAS,QAAA,EAAU,KAAA,EAAA,EAAS;AAC9C,IAAA,MAAM,eAA+C,EAAC;AACtD,IAAA,KAAA,MAAW,EAAE,EAAA,EAAI,IAAA,EAAK,IAAK,QAAA,EAAU;AACnC,MAAA,KAAA,MAAW,CAAA,IAAK,KAAA,CAAM,EAAA,CAAG,EAAE,CAAA,EAAG;AAC5B,QAAA,IAAI,CAAC,YAAA,CAAa,GAAA,CAAI,CAAA,CAAE,IAAI,CAAA,EAAG;AAC/B,QAAA,iBAAA,GAAoB,IAAA,CAAK,GAAA,CAAI,iBAAA,EAAmB,CAAA,CAAE,UAAU,CAAA;AAC5D,QAAA,MAAM,cAAc,CAAA,CAAE,GAAA;AACtB,QAAA,IAAI,WAAA,KAAgB,MAAA,IAAU,QAAA,CAAS,GAAA,CAAI,WAAW,CAAA,EAAG;AACzD,QAAA,MAAM,IAAA,GAAO,KAAA,CAAM,IAAA,CAAK,WAAW,CAAA;AACnC,QAAA,IAAI,CAAC,IAAA,EAAM;AACX,QAAA,MAAM,KAAA,GAAQC,MAAAA,CAAM,IAAA,GAAO,CAAA,CAAE,aAAa,GAAG,CAAA;AAC7C,QAAA,QAAA,CAAS,IAAI,WAAA,EAAa;AAAA,UACxB,IAAI,IAAA,CAAK,EAAA;AAAA,UACT,MAAM,IAAA,CAAK,aAAA;AAAA,UACX,MAAM,IAAA,CAAK,IAAA;AAAA,UACX,MAAM,IAAA,CAAK,IAAA;AAAA,UACX,IAAA,EAAM,KAAK,IAAA,CAAK,KAAA;AAAA,UAChB,KAAA;AAAA,UACA,UAAA,EAAY;AAAA,SACb,CAAA;AACD,QAAA,YAAA,CAAa,KAAK,EAAE,EAAA,EAAI,WAAA,EAAa,IAAA,EAAM,OAAO,CAAA;AAAA,MACpD;AAAA,IACF;AACA,IAAA,QAAA,GAAW,YAAA;AACX,IAAA,IAAI,QAAA,CAAS,WAAW,CAAA,EAAG;AAAA,EAC7B;AAEA,EAAA,MAAM,QAAQ,CAAC,GAAG,QAAA,CAAS,MAAA,EAAQ,CAAA,CAAE,IAAA;AAAA,IACnC,CAAC,CAAA,EAAG,CAAA,KAAM,CAAA,CAAE,QAAQ,CAAA,CAAE,KAAA,IAAS,CAAA,CAAE,UAAA,GAAa,EAAE,UAAA,IAAc,CAAA,CAAE,IAAA,CAAK,aAAA,CAAc,EAAE,IAAI;AAAA,GAC3F;AAEA,EAAA,OAAO;AAAA,IACL,MAAM,EAAE,EAAA,EAAI,QAAQ,IAAA,EAAM,IAAA,EAAM,iBAAiB,MAAA,EAAO;AAAA,IACxD,KAAA,EAAO,QAAA;AAAA,IACP,QAAA,EAAU,KAAA;AAAA,IACV,MAAA,EAAQ,MAAM,MAAA,CAAO,CAAC,MAAM,CAAA,CAAE,KAAA,KAAU,CAAC,CAAA,CAAE,MAAA;AAAA,IAC3C,UAAA,EAAY,MAAM,MAAA,CAAO,CAAC,MAAM,CAAA,CAAE,KAAA,GAAQ,CAAC,CAAA,CAAE,MAAA;AAAA,IAC7C,iBAAA,EAAmBA,OAAM,iBAAiB;AAAA,GAC5C;AACF;AAEA,SAASA,OAAM,CAAA,EAAmB;AAChC,EAAA,OAAO,IAAA,CAAK,KAAA,CAAM,CAAA,GAAI,GAAG,CAAA,GAAI,GAAA;AAC/B","file":"chunk-6ABXHZRN.js","sourcesContent":["import * as fs from 'node:fs';\nimport * as path from 'node:path';\n\n/**\n * Cross-process single-writer lock (O_EXCL create), shared by the embedding\n * cache writer and the auto-refresh rebuild so two vg processes never write\n * the same repo-local artifact at once. A lock whose owning process is dead,\n * or that is older than `staleMs`, is presumed abandoned and reclaimed.\n */\n\n/** A lock older than this is presumed dead (crashed process). */\nexport const DEFAULT_LOCK_STALE_MS = 15 * 60 * 1000;\n\nfunction isProcessAlive(pid: number): boolean {\n  try {\n    process.kill(pid, 0);\n    return true;\n  } catch (e) {\n    return (e as NodeJS.ErrnoException).code === 'EPERM'; // exists, just not ours to signal\n  }\n}\n\nfunction lockIsStale(file: string, staleMs: number): boolean {\n  try {\n    const { pid, at } = JSON.parse(fs.readFileSync(file, 'utf8')) as { pid?: number; at?: number };\n    if (typeof at === 'number' && Date.now() - at > staleMs) return true;\n    if (typeof pid === 'number' && !isProcessAlive(pid)) return true;\n    return false;\n  } catch {\n    return true; // unreadable/corrupt → reclaim it\n  }\n}\n\n/** Take the lock (O_EXCL), reclaiming a stale/dead one. Returns success. */\nexport function acquireLock(file: string, staleMs = DEFAULT_LOCK_STALE_MS): boolean {\n  const write = (): boolean => {\n    try {\n      fs.mkdirSync(path.dirname(file), { recursive: true });\n      const fd = fs.openSync(file, 'wx');\n      fs.writeFileSync(fd, JSON.stringify({ pid: process.pid, at: Date.now() }));\n      fs.closeSync(fd);\n      return true;\n    } catch {\n      return false;\n    }\n  };\n  if (write()) return true;\n  if (lockIsStale(file, staleMs)) {\n    try {\n      fs.rmSync(file, { force: true });\n    } catch {\n      /* another process may have reclaimed it */\n    }\n    return write();\n  }\n  return false;\n}\n\nexport function releaseLock(file: string): void {\n  try {\n    fs.rmSync(file, { force: true });\n  } catch {\n    /* best-effort */\n  }\n}\n","import * as fs from 'node:fs';\nimport { createRequire } from 'node:module';\nimport * as os from 'node:os';\nimport * as path from 'node:path';\nimport { pathToFileURL } from 'node:url';\nimport { hashString } from './hash.js';\nimport { cacheDir } from './cache.js';\nimport { acquireLock, releaseLock } from './lock.js';\nimport type { GraphNode, VgGraph } from '../schema.js';\n\n/**\n * Local-embedding semantic search for `vg ask --semantic`/`--deep` (no API key).\n *\n * The embedding backend is an OPTIONAL, lazily-loaded dependency (`fastembed`,\n * Apache-2.0, local ONNX) so the core install stays lean and `ask` never breaks:\n * if the backend or model isn't available it degrades to (prefix-fuzzy) lexical\n * search with a clear note. Embeddings are query-time + cached under\n * `.vibgrate/cache/` (keyed by node-text hash); they are NEVER written into the\n * committed `graph.json`, so the artifact stays byte-deterministic.\n *\n * `--local` disables the model download (semantic is skipped unless already\n * cached via an injected backend), keeping the air-gapped guarantee.\n */\n\nexport interface Embedder {\n  /** Stable model id (recorded with cached vectors so a model change invalidates them). */\n  id: string;\n  /** Embed documents → unit-or-raw vectors (cosine handles normalization). */\n  embed(texts: string[]): Promise<number[][]>;\n  /** Embed a single query string. */\n  embedQuery(text: string): Promise<number[]>;\n}\n\n/** Why semantic fell back to lexical — for calm, specific messaging. */\nexport type EmbedUnavailable = 'not-installed' | 'no-permission' | 'download-failed' | 'init-failed';\n\nexport interface LoadEmbedderOptions {\n  local?: boolean; // --local: do not download a model\n  model?: string; // override the embedding model id\n  noDownload?: boolean; // only load if the model is already cached (never fetch)\n  showDownloadProgress?: boolean; // let fastembed print its one-time download progress\n  onUnavailable?: (reason: EmbedUnavailable) => void; // called (not thrown) when it can't load\n}\n\n/** The embedding model id in effect (explicit override → default). */\nexport function resolveEmbedModel(model?: string): string {\n  return model ?? 'bge-small-en-v1.5';\n}\n\n/**\n * The **central, per-user** model cache — downloaded once per machine and shared\n * across every repo/folder (devs have many repos; the ~tens-of-MB model should\n * not re-download per project). Uses the XDG standard:\n * `$XDG_CACHE_HOME/vibgrate/models` (or `~/.cache/vibgrate/models`); relocate via\n * the standard `XDG_CACHE_HOME`. NB: fastembed's own default is the relative\n * `./local_cache`, i.e. per-CWD — which we override.\n */\nexport function modelCacheDir(): string {\n  const base = process.env.XDG_CACHE_HOME || path.join(os.homedir(), '.cache');\n  return path.join(base, 'vibgrate', 'models');\n}\n\n/** A machine-global marker written once the model has loaded successfully. */\nfunction modelReadyMarker(modelId: string): string {\n  return path.join(modelCacheDir(), `.ready-${safe(modelId)}`);\n}\n\n/**\n * Whether the embedding model is already present on this machine (loaded at least\n * once), so it can be used with **no network**. Lets the background warm-up\n * trigger only when it won't surprise-download.\n */\nexport function isModelReady(modelId = resolveEmbedModel()): boolean {\n  return fs.existsSync(modelReadyMarker(modelId));\n}\n\n/**\n * A calm, specific, actionable one-liner for why semantic isn't available right\n * now — built to reassure (lexical still works) and inform, never to alarm. No\n * stack traces, no scary words; always names the off switch and the fix.\n */\nexport function unavailableMessage(reason: EmbedUnavailable): string {\n  switch (reason) {\n    case 'no-permission':\n      return `semantic search couldn't write its model cache at ${modelCacheDir()} — using fast lexical search instead. Relocate it with the standard XDG_CACHE_HOME, or run with --local to stay lexical quietly. (No admin/sudo is ever needed — the cache lives in your home folder.)`;\n    case 'download-failed':\n      return `the semantic model isn't downloaded yet and couldn't be fetched (offline?) — using fast lexical search. It'll try again next time; run with --local to keep lexical without retrying.`;\n    case 'not-installed':\n      return `the optional semantic backend isn't available here — using fast lexical search.`;\n    case 'init-failed':\n    default:\n      return `the semantic model couldn't load — using fast lexical search.`;\n  }\n}\n\nexport interface ModelCacheInfo {\n  dir: string;\n  present: boolean;\n  bytes: number;\n}\n\n/** Where the shared model lives, whether it's present, and how big it is. */\nexport function modelCacheInfo(modelId = resolveEmbedModel()): ModelCacheInfo {\n  const dir = modelCacheDir();\n  return { dir, present: isModelReady(modelId) || fs.existsSync(dir), bytes: dirSize(dir) };\n}\n\n/** Remove the shared, re-downloadable model from the central cache. Returns bytes freed. */\nexport function clearModelCache(): number {\n  const dir = modelCacheDir();\n  const bytes = dirSize(dir);\n  try {\n    fs.rmSync(dir, { recursive: true, force: true });\n  } catch {\n    /* best-effort */\n  }\n  return bytes;\n}\n\nfunction dirSize(dir: string): number {\n  let total = 0;\n  let entries: fs.Dirent[];\n  try {\n    entries = fs.readdirSync(dir, { withFileTypes: true });\n  } catch {\n    return 0;\n  }\n  for (const e of entries) {\n    const p = path.join(dir, e.name);\n    if (e.isDirectory()) total += dirSize(p);\n    else {\n      try {\n        total += fs.statSync(p).size;\n      } catch {\n        /* skip unreadable */\n      }\n    }\n  }\n  return total;\n}\n\nfunction isPermissionError(e: unknown): boolean {\n  const code = (e as NodeJS.ErrnoException | undefined)?.code;\n  return code === 'EACCES' || code === 'EPERM' || code === 'EROFS';\n}\n\n/**\n * Whether this repo already has a cached vector set for `modelId` — i.e. semantic\n * search has run here before, so the next run is fast (no first-use download/embed).\n * Lets `ask` show the one-time setup note only when it's actually warranted.\n */\nexport function embeddingsCached(root: string, modelId: string): boolean {\n  return fs.existsSync(path.join(cacheDir(root), `embeddings-${safe(modelId)}.json`));\n}\n\n/**\n * Try to load the optional local embedding backend. Returns null (→ caller falls\n * back to lexical) when running `--local`, when the dependency isn't installed,\n * or when the model can't initialize.\n */\nexport async function loadEmbedder(options: LoadEmbedderOptions = {}): Promise<Embedder | null> {\n  // `--local` forces the deterministic lexical floor with no model load/download\n  // (air-gapped guarantee; also how tests stay offline).\n  if (options.local) return null;\n  const modelId = resolveEmbedModel(options.model);\n  // noDownload (used by the background warm-up): never fetch — bail if not cached.\n  if (options.noDownload && !isModelReady(modelId)) return null;\n  const fail = (reason: EmbedUnavailable): null => {\n    options.onUnavailable?.(reason);\n    return null;\n  };\n\n  // Lazy, optional dependency (native ONNX): loaded only for `vg ask`/`embed`,\n  // never by build/verify, so the graph artifact stays deterministic.\n  const mod: any = await importEmbedBackend();\n  if (!mod?.FlagEmbedding) return fail('not-installed');\n\n  const cache = modelCacheDir(); // central, shared across all repos\n  try {\n    fs.mkdirSync(cache, { recursive: true });\n  } catch (e) {\n    return fail(isPermissionError(e) ? 'no-permission' : 'init-failed');\n  }\n\n  try {\n    // First use fetches the model. A refused connection fails fast, but a\n    // black-holing proxy (common on corporate networks) would hang the first\n    // `vg ask` / MCP query_graph forever — bound the wait and fall back to\n    // lexical instead. Cached loads are local disk and get the same generous\n    // ceiling without ever hitting it.\n    const model: any = await withTimeout(\n      mod.FlagEmbedding.init({\n        model: mapModel(mod, modelId),\n        cacheDir: cache,\n        showDownloadProgress: options.showDownloadProgress ?? false,\n      }) as Promise<unknown>,\n      embedInitTimeoutMs(),\n      'embedding model init timed out',\n    );\n    // Record machine-global readiness so future builds can warm up offline.\n    try {\n      fs.writeFileSync(modelReadyMarker(modelId), new Date(0).toISOString());\n    } catch {\n      /* marker is best-effort */\n    }\n    return {\n      id: modelId,\n      async embed(texts) {\n        const out: number[][] = [];\n        for await (const batch of model.embed(texts, 64)) {\n          for (const v of batch) out.push(Array.from(v as ArrayLike<number>));\n        }\n        return out;\n      },\n      async embedQuery(text) {\n        const v = await model.queryEmbed(text);\n        return Array.from(v as ArrayLike<number>);\n      },\n    };\n  } catch (e) {\n    return fail(isPermissionError(e) ? 'no-permission' : 'download-failed');\n  }\n}\n\n/**\n * Import the optional native backend. A host can supply it out-of-tree via\n * `VIBGRATE_EMBEDDER_PATH` — a directory whose `node_modules` contains\n * `fastembed`. Editor integrations use this when their bundled engine ships\n * without the native optional dependency (the VS Code extension installs it\n * into its own storage on consent); the host dir wins over this package's own\n * dependency tree so the copy the user consented to is the one that loads.\n * Any resolution failure falls through — never throws.\n */\nasync function importEmbedBackend(): Promise<any> {\n  const hostDir = process.env.VIBGRATE_EMBEDDER_PATH;\n  if (hostDir) {\n    try {\n      const req = createRequire(path.join(hostDir, 'package.json'));\n      const mod: any = await import(pathToFileURL(req.resolve('fastembed')).href);\n      // A CJS entry imported over ESM may nest its exports under `default`.\n      const resolved = mod?.FlagEmbedding ? mod : mod?.default;\n      if (resolved?.FlagEmbedding) return resolved;\n    } catch {\n      /* fall through to normal resolution */\n    }\n  }\n  return await import('fastembed' as string).catch(() => null);\n}\n\n/** Ceiling for the one-time model fetch/init; override via VG_EMBED_TIMEOUT_MS. */\nfunction embedInitTimeoutMs(): number {\n  const n = Number(process.env.VG_EMBED_TIMEOUT_MS);\n  return Number.isFinite(n) && n > 0 ? n : 60_000;\n}\n\n/** Reject `promise` if it hasn't settled within `ms` (the work itself is not cancelled). */\nexport async function withTimeout<T>(promise: Promise<T>, ms: number, message: string): Promise<T> {\n  let timer: ReturnType<typeof setTimeout> | undefined;\n  try {\n    return await Promise.race([\n      promise,\n      new Promise<never>((_, reject) => {\n        timer = setTimeout(() => reject(new Error(message)), ms);\n        timer.unref?.();\n      }),\n    ]);\n  } finally {\n    clearTimeout(timer);\n  }\n}\n\nfunction mapModel(mod: any, id: string): unknown {\n  const m = mod.EmbeddingModel ?? {};\n  if (/bge-small/i.test(id)) return m.BGESmallENV15 ?? m.BGESmallEN ?? id;\n  if (/bge-base/i.test(id)) return m.BGEBaseENV15 ?? id;\n  if (/all-minilm/i.test(id)) return m.AllMiniLML6V2 ?? id;\n  return id;\n}\n\n/** Path segments that carry no semantic signal — dropped from embed context. */\nconst PATH_NOISE = new Set([\n  'src', 'app', 'apps', 'lib', 'libs', 'dist', 'build', 'out', 'index', 'main',\n  'packages', 'pkg', 'test', 'tests', '__tests__', 'spec', 'node_modules', 'internal',\n  'com', 'example', 'demo', 'java', 'net', 'org', 'www',\n]);\n\n/** Meaningful path context for a node: a couple of parent dirs + the filename stem. */\nfunction pathContext(file: string): string {\n  const parts = file.split('/');\n  const stem = (parts.pop() ?? '').replace(/\\.[^.]+$/, '');\n  const dirs = parts.filter((p) => p && !PATH_NOISE.has(p.toLowerCase()));\n  return [...dirs.slice(-2), stem].filter(Boolean).join(' ');\n}\n\n/**\n * The text we embed for a node. Alongside identity + signature we add the\n * strongest available signal — the node's **doc-comment / docstring** summary —\n * plus lightweight context already on the graph (file-path words, area label), so\n * a tersely-named symbol (`Table`, `NotificationJob`) a concept query can reach.\n *\n * `document` nodes (markdown, manifests, Docker, CI, OpenAPI, …) put the\n * scrubbed body in `doc` — that body is the primary embed signal so `vg ask`\n * can answer project-context questions, not only code symbols.\n */\nexport function nodeEmbedText(node: GraphNode, areaLabel?: string): string {\n  if (node.kind === 'document') {\n    const category = (node.signature ?? 'document').replace(/^document:/, '');\n    // Category keywords help ops/config queries land on the right file type.\n    const categoryHints: Record<string, string> = {\n      manifest: 'package dependencies scripts install dependencies versions',\n      docker: 'dockerfile container image build runtime',\n      compose: 'docker-compose services containers networking volumes',\n      ci: 'continuous integration github actions workflow pipeline test build deploy',\n      'build-config': 'typescript tsconfig bundler vite webpack eslint prettier test',\n      'api-contract': 'openapi swagger graphql protobuf api schema endpoints',\n      'task-runner': 'makefile justfile tasks build test run commands',\n      workspace: 'monorepo workspace packages pnpm turbo nx',\n      infra: 'deploy infrastructure kubernetes kubernetes terraform helm kubernetes',\n      'env-example': 'environment variables configuration secrets template',\n      markdown: 'documentation readme guide',\n    };\n    const hint = categoryHints[category] ?? category;\n    return [\n      node.qualifiedName,\n      'document',\n      category,\n      hint,\n      pathContext(node.file),\n      (node.doc ?? '').slice(0, 5000),\n    ]\n      .filter(Boolean)\n      .join('\\n');\n  }\n  return [node.qualifiedName, node.kind, node.signature ?? '', node.doc ?? '', pathContext(node.file), areaLabel ?? '']\n    .filter(Boolean)\n    .join(' ');\n}\n\nexport function cosine(a: number[], b: number[]): number {\n  let dot = 0;\n  let na = 0;\n  let nb = 0;\n  const n = Math.min(a.length, b.length);\n  for (let i = 0; i < n; i++) {\n    dot += a[i] * b[i];\n    na += a[i] * a[i];\n    nb += b[i] * b[i];\n  }\n  if (na === 0 || nb === 0) return 0;\n  return dot / (Math.sqrt(na) * Math.sqrt(nb));\n}\n\ninterface EmbedCache {\n  model: string;\n  entries: Record<string, { hash: string; vec: number[] }>;\n}\n\n/** Reports embedding progress: how many of `total` nodes are done so far. */\nexport type EmbedProgress = (done: number, total: number) => void;\n\n/** Nodes embedded per chunk — bounds memory and gives progress granularity. */\nconst EMBED_CHUNK = 256;\n/** Min gap between incremental cache writes (ms) — caps IO on big repos. */\nconst CACHE_WRITE_INTERVAL_MS = 1500;\n\nfunction vectorCachePath(root: string, modelId: string): string {\n  return path.join(cacheDir(root), `embeddings-${safe(modelId)}.json`);\n}\n\n/**\n * How many searchable nodes still need embedding for `modelId` — cheap (hashes\n * the embed-text, reads only the cache; never loads the model). Lets the embed\n * command / background warm-up exit instantly when nothing changed.\n */\nexport function countPending(graph: VgGraph, root: string, modelId: string): number {\n  const entries = readCacheEntries(vectorCachePath(root, modelId), modelId);\n  const areaLabel = new Map(graph.areas.map((a) => [a.id, a.label] as const));\n  let pending = 0;\n  for (const n of graph.nodes) {\n    // file/external stay out of the index; document (docs/env examples) are in.\n    if (n.kind === 'file' || n.kind === 'external') continue;\n    const h = hashString(nodeEmbedText(n, areaLabel.get(n.area)));\n    const cached = entries[n.id];\n    if (!cached || cached.hash !== h) pending++;\n  }\n  return pending;\n}\n\nfunction readCacheEntries(file: string, modelId: string): EmbedCache['entries'] {\n  if (!fs.existsSync(file)) return {};\n  try {\n    const loaded = JSON.parse(fs.readFileSync(file, 'utf8')) as EmbedCache;\n    if (loaded.model === modelId && loaded.entries) return loaded.entries;\n  } catch {\n    /* treat as empty */\n  }\n  return {};\n}\n\n// Single-writer lock (shared helper — see ./lock.ts) so a foreground `ask`\n// and a background `embed` never both embed the same repo at once (which\n// would race on the cache file).\n\n/**\n * Node embeddings for the searchable (non-file/external) nodes, cache-backed:\n * only nodes whose embed-text changed are re-embedded. The first run embeds in\n * chunks, **persists the cache incrementally** (so an interrupted/timed-out run\n * resumes instead of wasting the work), and reports progress via `onProgress`.\n */\nexport async function getNodeEmbeddings(\n  graph: VgGraph,\n  embedder: Embedder,\n  root: string,\n  onProgress?: EmbedProgress,\n): Promise<Map<string, number[]>> {\n  const file = vectorCachePath(root, embedder.id);\n  let cache: EmbedCache = { model: embedder.id, entries: {} };\n  if (fs.existsSync(file)) {\n    try {\n      const loaded = JSON.parse(fs.readFileSync(file, 'utf8')) as EmbedCache;\n      if (loaded.model === embedder.id && loaded.entries) cache = loaded;\n    } catch {\n      /* rebuild */\n    }\n  }\n\n  const areaLabel = new Map(graph.areas.map((a) => [a.id, a.label] as const));\n  // Include document nodes (markdown/txt/env examples) so ask can retrieve docs.\n  const targets = graph.nodes.filter((n) => n.kind !== 'file' && n.kind !== 'external');\n  const toEmbed: { id: string; text: string; hash: string }[] = [];\n  const vectors = new Map<string, number[]>();\n  for (const n of targets) {\n    const text = nodeEmbedText(n, areaLabel.get(n.area));\n    const h = hashString(text);\n    const cached = cache.entries[n.id];\n    if (cached && cached.hash === h) vectors.set(n.id, cached.vec);\n    else toEmbed.push({ id: n.id, text, hash: h });\n  }\n\n  // Atomic write (temp + rename) so a reader never sees a half-written cache.\n  const persist = (): void => {\n    try {\n      fs.mkdirSync(cacheDir(root), { recursive: true });\n      const tmp = `${file}.tmp.${process.pid}`;\n      fs.writeFileSync(tmp, JSON.stringify(cache));\n      fs.renameSync(tmp, file);\n    } catch {\n      /* cache write best-effort */\n    }\n  };\n\n  if (toEmbed.length) {\n    // Single-writer: if another process (e.g. a background warm-up) is already\n    // embedding this repo, don't double-work or race the cache — return what's\n    // cached so far (lexical floor still applies). It will be complete next run.\n    const lock = `${file}.lock`;\n    if (!acquireLock(lock)) return vectors;\n    try {\n      onProgress?.(0, toEmbed.length);\n      let lastWrite = Date.now();\n      for (let i = 0; i < toEmbed.length; i += EMBED_CHUNK) {\n        const slice = toEmbed.slice(i, i + EMBED_CHUNK);\n        const vecs = await embedder.embed(slice.map((t) => t.text));\n        slice.forEach((t, j) => {\n          const vec = vecs[j] ?? [];\n          vectors.set(t.id, vec);\n          cache.entries[t.id] = { hash: t.hash, vec };\n        });\n        onProgress?.(Math.min(i + EMBED_CHUNK, toEmbed.length), toEmbed.length);\n        // Persist periodically so a crash/timeout resumes from here next run.\n        if (Date.now() - lastWrite >= CACHE_WRITE_INTERVAL_MS) {\n          persist();\n          lastWrite = Date.now();\n        }\n      }\n      // prune entries for nodes no longer present, then a final authoritative write\n      const live = new Set(targets.map((n) => n.id));\n      for (const id of Object.keys(cache.entries)) if (!live.has(id)) delete cache.entries[id];\n      persist();\n    } finally {\n      releaseLock(lock);\n    }\n  }\n\n  return vectors;\n}\n\nfunction safe(id: string): string {\n  return id.replace(/[^a-z0-9.-]+/gi, '_');\n}\n","import type { EdgeKind, GraphEdge, GraphNode, VgGraph } from '../schema.js';\n\n/** Indexes over a graph for O(1) neighbor lookups (built once per command). */\nexport class GraphIndex {\n  readonly nodeById = new Map<string, GraphNode>();\n  private outById = new Map<string, GraphEdge[]>();\n  private inById = new Map<string, GraphEdge[]>();\n\n  constructor(readonly graph: VgGraph) {\n    for (const n of graph.nodes) this.nodeById.set(n.id, n);\n    for (const e of graph.edges) {\n      push(this.outById, e.src, e);\n      push(this.inById, e.dst, e);\n    }\n  }\n\n  out(id: string, kind?: EdgeKind): GraphEdge[] {\n    const all = this.outById.get(id) ?? [];\n    return kind ? all.filter((e) => e.kind === kind) : all;\n  }\n\n  in(id: string, kind?: EdgeKind): GraphEdge[] {\n    const all = this.inById.get(id) ?? [];\n    return kind ? all.filter((e) => e.kind === kind) : all;\n  }\n\n  node(id: string): GraphNode | undefined {\n    return this.nodeById.get(id);\n  }\n\n  /**\n   * Resolved nodes called by `id` — invocations (`call`) plus structural\n   * dependency references (`references`, e.g. a constructor-injected field's\n   * type), since both represent real usage a caller/impact question cares\n   * about. `references` is otherwise only emitted by the precise SCIP/tsc\n   * rungs and (for Java DI wiring) the heuristic rung — never a guess.\n   */\n  callees(id: string): { edge: GraphEdge; node: GraphNode }[] {\n    return this.resolveTargets(this.out(id).filter(isUsageEdge), 'dst');\n  }\n\n  /** Resolved nodes that call or structurally reference `id`. */\n  callers(id: string): { edge: GraphEdge; node: GraphNode }[] {\n    return this.resolveTargets(this.in(id).filter(isUsageEdge), 'src');\n  }\n\n  private resolveTargets(edges: GraphEdge[], end: 'src' | 'dst') {\n    const out: { edge: GraphEdge; node: GraphNode }[] = [];\n    for (const e of edges) {\n      const node = this.nodeById.get(e[end]);\n      if (node) out.push({ edge: e, node });\n    }\n    return out;\n  }\n}\n\nconst USAGE_KINDS: ReadonlySet<EdgeKind> = new Set(['call', 'references']);\nfunction isUsageEdge(e: GraphEdge): boolean {\n  return USAGE_KINDS.has(e.kind);\n}\n\nfunction push(map: Map<string, GraphEdge[]>, key: string, value: GraphEdge): void {\n  const list = map.get(key);\n  if (list) list.push(value);\n  else map.set(key, [value]);\n}\n\n/**\n * Memoized `GraphIndex`, keyed on the graph object's identity.\n *\n * The index (node-by-id + in/out adjacency) is a pure function of the graph's\n * content, and every read path rebuilds it from scratch — an O(nodes + edges)\n * pass that, on a large map, costs hundreds of milliseconds *per query*. Under\n * `vg serve` the same parsed graph object is reused across many tool calls\n * (`GraphSource` caches it by file mtime and only replaces the reference when\n * `graph.json` actually changes), so rebuilding the index on every call is pure\n * waste. Keying a `WeakMap` on that object identity builds the index once and\n * reuses it until the file is rebuilt — at which point `GraphSource` hands back a\n * *new* object, this map misses, and the stale index is collected with the old\n * graph. Correct and stale-safe by construction: a different graph is a\n * different object, so there is no cross-graph reuse and nothing to invalidate.\n *\n * `GraphIndex` is read-only (no method mutates its maps), so sharing one\n * instance across callers is safe.\n */\nconst INDEX_CACHE = new WeakMap<VgGraph, GraphIndex>();\n\nexport function indexFor(graph: VgGraph): GraphIndex {\n  let idx = INDEX_CACHE.get(graph);\n  if (!idx) {\n    idx = new GraphIndex(graph);\n    INDEX_CACHE.set(graph, idx);\n  }\n  return idx;\n}\n","import { indexFor, type GraphIndex } from './relations.js';\nimport { cosine, type Embedder } from './embeddings.js';\nimport type { GraphNode, VgGraph } from '../schema.js';\n\n/**\n * Deterministic retrieval for `vg ask` (VG-CLI-SPEC §3.2).\n *\n * Builds a structured, fact-annotated, budget-bounded context block for a\n * question — designed to drop straight into an assistant's context. The default\n * is deterministic lexical+structural retrieval (identifier/term matching with\n * morphological prefix-fuzzing, ranked by importance). `--semantic`/`--deep` adds\n * a hybrid local-embedding pass (`queryGraphSemantic`) that surfaces conceptually\n * related code even when no word is shared — still no API key.\n */\n\nexport interface QueryOptions {\n  budget?: number; // approx token budget for the context block (default 2000)\n  limit?: number; // max seed matches to expand (default 12)\n}\n\nexport interface QueryMatch {\n  node: GraphNode;\n  score: number;\n  why: string;\n}\n\nexport interface QueryResult {\n  question: string;\n  matches: QueryMatch[];\n  context: string;\n  tokensEstimate: number;\n}\n\nconst STOPWORDS = new Set([\n  'the', 'a', 'an', 'is', 'are', 'was', 'were', 'be', 'to', 'of', 'in', 'on', 'for', 'and', 'or',\n  'where', 'what', 'which', 'how', 'do', 'does', 'did', 'i', 'we', 'it', 'this', 'that', 'with',\n  'when', 'who', 'why', 'can', 'should', 'my', 'our', 'you', 'your', 'from', 'by', 'at', 'as',\n  // Discovery-question scaffolding: words a caller uses to FRAME the ask\n  // (\"find the code responsible for X\", \"I need to modify X, where do I\n  // start?\", \"explain how X works in this codebase\") rather than to name the\n  // target. Left in, these compete on equal footing with the real identifier\n  // terms and can outrank it outright — e.g. \"find the code responsible for\n  // deleteAsync\" let \"find\" alone drag in every FindByIdAsync/FindAll method\n  // in the repo, none of them the target (VG-LOCATE-FAILURE-ANALYSIS.md).\n  'find', 'code', 'responsible', 'need', 'modify', 'me',\n  'implementation', 'explain', 'works', 'codebase', 'contains', 'file',\n]);\n\nexport function queryGraph(graph: VgGraph, question: string, options: QueryOptions = {}): QueryResult {\n  const budget = options.budget ?? 2000;\n  const limit = options.limit ?? 12;\n  const terms = tokenize(question);\n  const weightOf = termWeights(graph, terms);\n  const index = indexFor(graph);\n\n  const scored: QueryMatch[] = [];\n  for (const node of graph.nodes) {\n    if (node.kind === 'file' || node.kind === 'external') continue;\n    const { score, why } = scoreNode(node, terms, weightOf);\n    if (score > 0) scored.push({ node, score: round(score * (1 + IMPORTANCE_WEIGHT * node.importance)), why });\n  }\n  scored.sort((a, b) => b.score - a.score || a.node.qualifiedName.localeCompare(b.node.qualifiedName));\n\n  const seeds = scored.slice(0, limit);\n  const { context, tokensEstimate } = buildContext(graph, index, question, seeds, budget);\n\n  return { question, matches: seeds, context, tokensEstimate };\n}\n\nexport interface SemanticQueryOptions extends QueryOptions {\n  embedder: Embedder;\n  /** Precomputed node vectors (from getNodeEmbeddings); falls back to lexical for nodes without one. */\n  nodeVectors: Map<string, number[]>;\n}\n\n/**\n * Hybrid lexical + local-embedding retrieval. Blends the normalized lexical score\n * with cosine similarity to the query embedding (50/50), so a question like\n * \"where do we handle auth failures?\" can surface `verify_token` even with no\n * shared identifier. Deterministic given the same model + cached vectors;\n * embeddings live only in the cache, never in `graph.json`.\n */\nexport async function queryGraphSemantic(\n  graph: VgGraph,\n  question: string,\n  options: SemanticQueryOptions,\n): Promise<QueryResult> {\n  const budget = options.budget ?? 2000;\n  const limit = options.limit ?? 12;\n  const terms = tokenize(question);\n  const weightOf = termWeights(graph, terms);\n  const index = indexFor(graph);\n  const queryVec = await options.embedder.embedQuery(question);\n\n  // Raw lexical scores (pre-importance) for normalization.\n  const lexRaw = new Map<string, number>();\n  let lexMax = 0;\n  const whyById = new Map<string, string>();\n  for (const node of graph.nodes) {\n    if (node.kind === 'file' || node.kind === 'external') continue;\n    const { score, why } = scoreNode(node, terms, weightOf);\n    lexRaw.set(node.id, score);\n    whyById.set(node.id, why);\n    if (score > lexMax) lexMax = score;\n  }\n\n  const scored: QueryMatch[] = [];\n  for (const node of graph.nodes) {\n    if (node.kind === 'file' || node.kind === 'external') continue;\n    const lexNorm = lexMax > 0 ? (lexRaw.get(node.id) ?? 0) / lexMax : 0;\n    const vec = options.nodeVectors.get(node.id);\n    const sem = vec ? Math.max(0, cosine(queryVec, vec)) : 0;\n    const hybrid = 0.5 * lexNorm + 0.5 * sem;\n    if (hybrid <= 0) continue;\n    const lexWhy = whyById.get(node.id);\n    const why = lexWhy || (sem > 0.3 ? `semantic match (${sem.toFixed(2)})` : 'weak match');\n    scored.push({ node, score: round(hybrid * (1 + IMPORTANCE_WEIGHT * node.importance)), why });\n  }\n  scored.sort((a, b) => b.score - a.score || a.node.qualifiedName.localeCompare(b.node.qualifiedName));\n\n  const seeds = scored.slice(0, limit);\n  const { context, tokensEstimate } = buildContext(graph, index, question, seeds, budget);\n  return { question, matches: seeds, context, tokensEstimate };\n}\n\n/**\n * Split on anything that isn't a Unicode letter/number (`\\p{L}\\p{N}`, not the\n * ASCII-only `[a-z0-9]`) so identifiers in non-Latin scripts (Japanese,\n * Cyrillic, ...) survive tokenization instead of vanishing entirely — the\n * ASCII-only split treated every character of e.g. `名前` as a separator,\n * producing zero terms and a guaranteed empty result for any question about\n * it (VG-LOCATE-FAILURE-ANALYSIS.md). Length floor is 1, not 2: a single\n * non-stopword letter/digit is still the whole identifier when that's genuinely\n * the symbol's name (adversarial fixtures deliberately use bare `f`/`x`/`h`\n * names to stress this) — STOPWORDS already screens out short function words.\n */\nfunction tokenize(q: string): string[] {\n  return [\n    ...new Set(\n      q\n        .toLowerCase()\n        .split(/[^\\p{L}\\p{N}]+/u)\n        .filter((t) => t.length >= 1 && !STOPWORDS.has(t)),\n    ),\n  ];\n}\n\nfunction scoreNode(node: GraphNode, terms: string[], weightOf: (t: string) => number = () => 1): { score: number; why: string } {\n  let score = 0;\n  const hits: string[] = [];\n  const name = node.name.toLowerCase();\n  const qn = node.qualifiedName.toLowerCase();\n  const file = node.file.toLowerCase();\n  // Split the ORIGINAL name on camelCase / snake_case, then lowercase the parts\n  // (splitting must see the capitals, so it happens before lowercasing).\n  const nameParts = identifierParts(node.name);\n  for (const t of terms) {\n    // Each term's contribution is weighted by its specificity (IDF over symbol\n    // names): a match on a distinctive term (\"toComparable\", \"layoutFor\") counts\n    // for more than a match on a term shared by hundreds of symbols (\"code\",\n    // \"get\", \"run\"). Without this, an incidental exact-name hit on a common word\n    // in a natural-language question outranked the conceptually-correct symbol,\n    // and importance weighting amplified the wrong hit (VG-NAVIGATION trace).\n    const w = weightOf(t);\n    if (name === t) {\n      score += 10 * w;\n      hits.push(t);\n    } else if (nameParts.has(t)) {\n      score += 6 * w;\n      hits.push(t);\n    } else if (name.includes(t)) {\n      score += 4 * w;\n      hits.push(t);\n    } else if (qn.includes(t)) {\n      score += 3 * w;\n      hits.push(t);\n    } else if (fuzzyPartMatch(t, nameParts)) {\n      // Morphological / subword match: \"authentication\" ↔ \"authenticate\"\n      // (shared prefix), so lexical ask survives word-form differences without\n      // a model. The semantic path handles non-shared-root synonyms.\n      score += 2 * w;\n      hits.push(`~${t}`);\n    } else if (file.includes(t)) {\n      score += 1 * w;\n      hits.push(t);\n    }\n  }\n  return { score, why: hits.length ? `matched: ${hits.join(', ')}` : '' };\n}\n\n/**\n * Importance is a mild tiebreaker, not a doubling. The old `1 + importance`\n * let a hub (importance→1) double its score and outrank a stronger textual\n * match on the actual target; at 0.4 a top hub adds at most 40%, enough to\n * break genuine ties without overriding term evidence.\n */\nconst IMPORTANCE_WEIGHT = 0.4;\n\n/**\n * Per-term specificity weights (IDF) for one question, computed over the graph's\n * symbol-name vocabulary: `ln((N+1)/(df+1)) + 1`, clamped to a sane band. A term\n * that appears in one symbol name is highly discriminating; one that appears in\n * hundreds (\"get\", \"code\", \"run\", \"handler\") is near-noise. Clamped so a term\n * matching nothing (huge idf, but it scores 0 anyway) or everything can't\n * distort the scale. Cost is one O(nodes) pass, dwarfed by the scoring loop.\n */\nfunction termWeights(graph: VgGraph, terms: string[]): (t: string) => number {\n  if (terms.length === 0) return () => 1;\n  const df = new Map<string, number>();\n  let n = 0;\n  for (const node of graph.nodes) {\n    if (node.kind === 'file' || node.kind === 'external') continue;\n    n++;\n    const name = node.name.toLowerCase();\n    const parts = identifierParts(node.name);\n    for (const t of terms) {\n      if (parts.has(t) || name.includes(t)) df.set(t, (df.get(t) ?? 0) + 1);\n    }\n  }\n  const w = new Map<string, number>();\n  for (const t of terms) {\n    const idf = Math.log((n + 1) / ((df.get(t) ?? 0) + 1)) + 1;\n    // Ceiling of 8 (vs a natural df≈40 idf ≈ 5.4) keeps genuinely rare terms\n    // dominant while a term matching nothing/only a file path can't distort.\n    w.set(t, Math.max(0.5, Math.min(8, idf)));\n  }\n  return (t: string) => w.get(t) ?? 1;\n}\n\n/**\n * camelCase / snake_case / kebab split of an identifier → lowercased parts.\n * The separator alternative is Unicode-letter-aware (`\\p{L}\\p{N}`, not\n * ASCII-only `a-zA-Z0-9`) so non-Latin identifiers split on punctuation\n * without losing every character to it; the camelCase boundary lookaround\n * stays ASCII-only since upper/lowercase casing is itself an ASCII-script\n * concept — scripts without case simply never trigger it and fall through to\n * the separator split.\n */\nexport function identifierParts(name: string): Set<string> {\n  return new Set(\n    name\n      .split(/[^\\p{L}\\p{N}]+|(?<=[a-z0-9])(?=[A-Z])|(?<=[A-Z])(?=[A-Z][a-z])/u)\n      .filter(Boolean)\n      .map((s) => s.toLowerCase()),\n  );\n}\n\n/** A term fuzzily matches a part if they share a long-enough prefix (same root). */\nfunction fuzzyPartMatch(term: string, parts: Set<string>): boolean {\n  for (const part of parts) {\n    const shared = sharedPrefixLen(term, part);\n    if (shared >= 5 && shared >= 0.6 * Math.min(term.length, part.length)) return true;\n  }\n  return false;\n}\n\nfunction sharedPrefixLen(a: string, b: string): number {\n  const n = Math.min(a.length, b.length);\n  let i = 0;\n  while (i < n && a[i] === b[i]) i++;\n  return i;\n}\n\nfunction buildContext(\n  graph: VgGraph,\n  index: GraphIndex,\n  question: string,\n  seeds: QueryMatch[],\n  budget: number,\n): { context: string; tokensEstimate: number } {\n  const lines: string[] = [];\n  lines.push(`# Context for: ${question}`);\n  lines.push('');\n  if (seeds.length === 0) {\n    lines.push('_No matching symbols found in the map. Try different terms, or `vg hubs` for the most important code._');\n    const text = lines.join('\\n');\n    return { context: text, tokensEstimate: estimateTokens(text) };\n  }\n\n  for (const { node, why } of seeds) {\n    const block: string[] = [];\n    block.push(`## ${node.qualifiedName}  (${node.kind}, ${node.file}:${node.span.start})`);\n    if (node.signature) block.push('`' + node.signature + '`');\n    const callees = index.callees(node.id).map((x) => x.node.qualifiedName);\n    const callers = index.callers(node.id).map((x) => x.node.qualifiedName);\n    if (callees.length) block.push(`calls: ${unique(callees).slice(0, 8).join(', ')}`);\n    if (callers.length) block.push(`called by: ${unique(callers).slice(0, 8).join(', ')}`);\n    block.push(`importance ${node.importance.toFixed(3)} · area #${node.area}${node.isHub ? ' · hub' : ''} · ${why}`);\n    block.push('');\n\n    const candidate = lines.concat(block).join('\\n');\n    if (estimateTokens(candidate) > budget && lines.length > 2) break;\n    lines.push(...block);\n  }\n\n  const text = lines.join('\\n');\n  return { context: text, tokensEstimate: estimateTokens(text) };\n}\n\nfunction unique(xs: string[]): string[] {\n  return [...new Set(xs)];\n}\n\nfunction estimateTokens(text: string): number {\n  // ~4 chars per token, the standard rough estimate.\n  return Math.ceil(text.length / 4);\n}\n\nfunction round(x: number): number {\n  return Math.round(x * 1e6) / 1e6;\n}\n","import { indexFor } from './relations.js';\nimport type { EdgeKind, VgGraph } from '../schema.js';\n\n/**\n * Deterministic reverse-reachability impact analysis (VG-CLI-SPEC §3.5).\n *\n * \"What breaks if `<node>` changes\" = everything that (transitively) depends on\n * it: its callers, importers, and subtypes. We BFS *backwards* along dependency\n * edges, bounded by depth, with a confidence that decays with distance (direct =\n * high; transitive lower; ambiguous/dynamic edges already carry lower edge\n * confidence which we fold in). Test-impact selection (`--tests`) lands in\n * Phase 2; this is the structural blast radius.\n */\n\nconst DEPEND_EDGES = new Set<EdgeKind>(['call', 'import', 'extends', 'implements', 'references']);\n\nexport interface ImpactItem {\n  id: string;\n  name: string;\n  kind: string;\n  file: string;\n  line: number;\n  depth: number;\n  confidence: number;\n}\n\nexport interface ImpactResult {\n  root: { id: string; name: string };\n  depth: number;\n  affected: ImpactItem[];\n  direct: number;\n  transitive: number;\n  /** Lowest edge confidence encountered (e.g. a dynamic-dispatch edge). */\n  minEdgeConfidence: number;\n}\n\nexport function impactOf(graph: VgGraph, rootId: string, opts: { depth?: number } = {}): ImpactResult {\n  const maxDepth = Math.max(1, opts.depth ?? 4);\n  const index = indexFor(graph);\n  const root = index.node(rootId);\n\n  const affected = new Map<string, ImpactItem>();\n  let minEdgeConfidence = 1;\n\n  // BFS over incoming dependency edges (dependents of the frontier).\n  let frontier: { id: string; conf: number }[] = [{ id: rootId, conf: 1 }];\n  for (let depth = 1; depth <= maxDepth; depth++) {\n    const nextFrontier: { id: string; conf: number }[] = [];\n    for (const { id, conf } of frontier) {\n      for (const e of index.in(id)) {\n        if (!DEPEND_EDGES.has(e.kind)) continue;\n        minEdgeConfidence = Math.min(minEdgeConfidence, e.confidence);\n        const dependentId = e.src;\n        if (dependentId === rootId || affected.has(dependentId)) continue;\n        const node = index.node(dependentId);\n        if (!node) continue;\n        const conf2 = round(conf * e.confidence * 0.9); // decay with distance\n        affected.set(dependentId, {\n          id: node.id,\n          name: node.qualifiedName,\n          kind: node.kind,\n          file: node.file,\n          line: node.span.start,\n          depth,\n          confidence: conf2,\n        });\n        nextFrontier.push({ id: dependentId, conf: conf2 });\n      }\n    }\n    frontier = nextFrontier;\n    if (frontier.length === 0) break;\n  }\n\n  const items = [...affected.values()].sort(\n    (a, b) => a.depth - b.depth || b.confidence - a.confidence || a.name.localeCompare(b.name),\n  );\n\n  return {\n    root: { id: rootId, name: root?.qualifiedName ?? rootId },\n    depth: maxDepth,\n    affected: items,\n    direct: items.filter((i) => i.depth === 1).length,\n    transitive: items.filter((i) => i.depth > 1).length,\n    minEdgeConfidence: round(minEdgeConfidence),\n  };\n}\n\nfunction round(x: number): number {\n  return Math.round(x * 1e6) / 1e6;\n}\n"]}

package/dist/{chunk-4CQ3MGNN.js → chunk-6AYDFFP5.js}

@@ -1,6 +1,6 @@
 import { vgdRequest } from './chunk-PMYWZRRS.js';
 import { resolveOne } from './chunk-J7LKEB2R.js';
-import { impactOf, queryGraph } from './chunk-6IOQJGFT.js';
+import { impactOf, queryGraph } from './chunk-6ABXHZRN.js';
 
 // src/code/graph-backend.ts
 function localGraphBackend(graph) {
@@ -132,5 +132,5 @@ function resolveSymbolId(graph, symbol) {
 }
 
 export { localGraphBackend, resolveGraphBackend, vgdGraphBackend };
-//# sourceMappingURL=chunk-4CQ3MGNN.js.map
-//# sourceMappingURL=chunk-4CQ3MGNN.js.map
+//# sourceMappingURL=chunk-6AYDFFP5.js.map
+//# sourceMappingURL=chunk-6AYDFFP5.js.map

package/dist/{chunk-4CQ3MGNN.js.map → chunk-6AYDFFP5.js.map}

@@ -1 +1 @@
-{"version":3,"sources":["../src/code/graph-backend.ts"],"names":[],"mappings":";;;;;AA2DO,SAAS,kBAAkB,KAAA,EAA8B;AAC9D,EAAA,OAAO;AAAA,IACL,MAAA,EAAQ,OAAA;AAAA,IACR,MAAM,MAAA,CAAO,KAAA,EAAO,IAAA,EAAM;AACxB,MAAA,MAAM,GAAA,GAAM,UAAA,CAAW,KAAA,EAAO,KAAA,EAAO,EAAE,MAAA,EAAQ,IAAA,EAAM,KAAA,EAAO,IAAA,EAAM,KAAA,IAAS,EAAA,EAAI,CAAA;AAC/E,MAAA,OAAO;AAAA,QACL,MAAA,EAAQ,OAAA;AAAA,QACR,OAAA,EAAS,GAAA,CAAI,OAAA,CAAQ,GAAA,CAAI,CAAC,CAAA,MAAO;AAAA,UAC/B,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,GAAA;AAAA,UACP,SAAA,EAAW,CAAA,CAAE,IAAA,CAAK,SAAA,IAAa;AAAA,SACjC,CAAE;AAAA,OACJ;AAAA,IACF,CAAA;AAAA,IACA,MAAM,MAAA,CAAO,MAAA,EAAQ,IAAA,EAAM;AACzB,MAAA,MAAM,IAAA,GAAO,eAAA,CAAgB,KAAA,EAAO,MAAM,CAAA;AAC1C,MAAA,IAAI,CAAC,MAAM,OAAO,IAAA;AAClB,MAAA,MAAM,GAAA,GAAM,SAAS,KAAA,EAAO,IAAA,EAAM,EAAE,KAAA,EAAO,IAAA,EAAM,KAAA,IAAS,CAAA,EAAG,CAAA;AAC7D,MAAA,OAAO;AAAA,QACL,MAAA,EAAQ,OAAA;AAAA,QACR,MAAM,GAAA,CAAI,IAAA;AAAA,QACV,OAAO,GAAA,CAAI,KAAA;AAAA,QACX,QAAA,EAAU,GAAA,CAAI,QAAA,CAAS,GAAA,CAAI,CAAC,CAAA,MAAO;AAAA,UACjC,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,GAAA,CAAI,MAAA;AAAA,QACZ,YAAY,GAAA,CAAI;AAAA,OAClB;AAAA,IACF;AAAA,GACF;AACF;AAeO,SAAS,gBAAgB,OAAA,EAA+C;AAC7E,EAAA,MAAM,KAAA,GAAQ,iBAAA,CAAkB,OAAA,CAAQ,QAAQ,CAAA;AAChD,EAAA,MAAM,OAAA,GAAU,QAAQ,OAAA,KAAY,CAAC,KAAK,IAAA,KAAS,UAAA,CAAW,KAAK,IAAI,CAAA,CAAA;AACvE,EAAA,MAAM,UAAA,GAA+B,EAAE,UAAA,EAAY,OAAA,CAAQ,UAAA,EAAW;AAEtE,EAAA,OAAO;AAAA,IACL,MAAA,EAAQ,KAAA;AAAA,IACR,MAAM,MAAA,CAAO,KAAA,EAAO,IAAA,EAAM;AACxB,MAAA,IAAI;AACF,QAAA,MAAM,MAAO,MAAM,OAAA;AAAA,UACjB;AAAA,YACE,EAAA,EAAI,aAAA;AAAA,YACJ,cAAc,OAAA,CAAQ,YAAA;AAAA,YACtB,KAAA;AAAA,YACA,KAAA,EAAO,MAAM,KAAA,IAAS,EAAA;AAAA,YACtB,QAAQ,OAAA,CAAQ;AAAA,WAClB;AAAA,UACA;AAAA,SACF;AAYA,QAAA,IAAI,KAAK,EAAA,IAAM,KAAA,CAAM,OAAA,CAAQ,GAAA,CAAI,OAAO,CAAA,EAAG;AACzC,UAAA,OAAO;AAAA,YACL,MAAA,EAAQ,KAAA;AAAA,YACR,OAAA,EAAS,GAAA,CAAI,OAAA,CAAQ,GAAA,CAAI,CAAC,CAAA,MAAO;AAAA,cAC/B,IAAI,CAAA,CAAE,EAAA;AAAA,cACN,eAAe,CAAA,CAAE,aAAA;AAAA,cACjB,MAAM,CAAA,CAAE,IAAA;AAAA,cACR,MAAM,CAAA,CAAE,IAAA;AAAA,cACR,MAAM,CAAA,CAAE,IAAA;AAAA,cACR,OAAO,CAAA,CAAE,KAAA;AAAA,cACT,KAAK,CAAA,CAAE,GAAA;AAAA,cACP,SAAA,EAAW;AAAA,aACb,CAAE;AAAA,WACJ;AAAA,QACF;AAAA,MACF,CAAA,CAAA,MAAQ;AAAA,MAER;AACA,MAAA,OAAO,KAAA,CAAM,MAAA,CAAO,KAAA,EAAO,IAAI,CAAA;AAAA,IACjC,CAAA;AAAA,IACA,MAAM,MAAA,CAAO,MAAA,EAAQ,IAAA,EAAM;AACzB,MAAA,IAAI;AACF,QAAA,MAAM,MAAO,MAAM,OAAA;AAAA,UACjB;AAAA,YACE,EAAA,EAAI,WAAA;AAAA,YACJ,cAAc,OAAA,CAAQ,YAAA;AAAA,YACtB,MAAA;AAAA,YACA,KAAA,EAAO,MAAM,KAAA,IAAS,CAAA;AAAA,YACtB,QAAQ,OAAA,CAAQ;AAAA,WAClB;AAAA,UACA;AAAA,SACF;AAQA,QAAA,IAAI,GAAA,EAAK,MAAM,GAAA,CAAI,IAAA,IAAQ,MAAM,OAAA,CAAQ,GAAA,CAAI,QAAQ,CAAA,EAAG;AACtD,UAAA,OAAO;AAAA,YACL,MAAA,EAAQ,KAAA;AAAA,YACR,MAAM,GAAA,CAAI,IAAA;AAAA,YACV,KAAA,EAAO,GAAA,CAAI,KAAA,IAAS,IAAA,EAAM,KAAA,IAAS,CAAA;AAAA,YACnC,UAAU,GAAA,CAAI,QAAA;AAAA,YACd,MAAA,EAAQ,IAAI,MAAA,IAAU,CAAA;AAAA,YACtB,UAAA,EAAY,IAAI,UAAA,IAAc;AAAA,WAChC;AAAA,QACF;AAAA,MACF,CAAA,CAAA,MAAQ;AAAA,MAER;AACA,MAAA,OAAO,KAAA,CAAM,MAAA,CAAO,MAAA,EAAQ,IAAI,CAAA;AAAA,IAClC;AAAA,GACF;AACF;AAKO,SAAS,oBAAoB,KAAA,EAKnB;AACf,EAAA,IAAI,KAAA,CAAM,YAAA,IAAgB,KAAA,CAAM,UAAA,EAAY;AAC1C,IAAA,OAAO,eAAA,CAAgB;AAAA,MACrB,cAAc,KAAA,CAAM,YAAA;AAAA,MACpB,MAAA,EAAQ,MAAM,MAAA,IAAU,MAAA;AAAA,MACxB,YAAY,KAAA,CAAM,UAAA;AAAA,MAClB,UAAU,KAAA,CAAM;AAAA,KACjB,CAAA;AAAA,EACH;AACA,EAAA,OAAO,iBAAA,CAAkB,MAAM,KAAK,CAAA;AACtC;AAEA,SAAS,eAAA,CAAgB,OAAgB,MAAA,EAA+B;AACtE,EAAA,IAAI,KAAA,CAAM,MAAM,IAAA,CAAK,CAAC,MAAM,CAAA,CAAE,EAAA,KAAO,MAAM,CAAA,EAAG,OAAO,MAAA;AACrD,EAAA,MAAM,GAAA,GAAM,UAAA,CAAW,KAAA,EAAO,MAAM,CAAA;AACpC,EAAA,IAAI,GAAA,CAAI,IAAA,EAAM,EAAA,EAAI,OAAO,IAAI,IAAA,CAAK,EAAA;AAClC,EAAA,IAAI,GAAA,CAAI,UAAA,CAAW,MAAA,KAAW,CAAA,IAAK,GAAA,CAAI,UAAA,CAAW,CAAC,CAAA,EAAG,EAAA,EAAI,OAAO,GAAA,CAAI,UAAA,CAAW,CAAC,CAAA,CAAE,EAAA;AACnF,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,MAAM,EAAA,IAAM,IAAA;AACrB","file":"chunk-4CQ3MGNN.js","sourcesContent":["/**\n * Graph query backend for the agent tool layer (Fusion Runtime).\n *\n * Tools prefer a warm ActiveGraph in vgd when a daemon session is attached;\n * otherwise they fall back to the in-process {@link VgGraph}. Failures never\n * surface to the model as transport errors — they degrade to local query.\n */\n\nimport { queryGraph } from '../engine/query.js';\nimport { impactOf } from '../engine/impact.js';\nimport { resolveOne } from '../engine/lookup.js';\nimport { vgdRequest, type VgdClientOptions } from '../runtime/vgd/client.js';\nimport type { VgdRequest } from '../runtime/vgd/protocol.js';\nimport type { VgGraph } from '../schema.js';\n\nexport type GraphBackendSource = 'local' | 'vgd';\n\nexport interface GraphSearchHit {\n  id: string;\n  qualifiedName: string;\n  kind: string;\n  file: string;\n  line: number;\n  score: number;\n  why: string;\n  signature?: string | null;\n}\n\nexport interface GraphImpactHit {\n  id: string;\n  name: string;\n  kind: string;\n  file: string;\n  line: number;\n  depth: number;\n  confidence: number;\n}\n\nexport interface GraphImpactResult {\n  root: { id: string; name: string };\n  depth: number;\n  affected: GraphImpactHit[];\n  direct: number;\n  transitive: number;\n  source: GraphBackendSource;\n}\n\nexport interface GraphSearchResult {\n  matches: GraphSearchHit[];\n  source: GraphBackendSource;\n}\n\nexport interface GraphBackend {\n  readonly source: GraphBackendSource;\n  search(query: string, opts?: { limit?: number }): Promise<GraphSearchResult>;\n  impact(symbol: string, opts?: { depth?: number }): Promise<GraphImpactResult | null>;\n}\n\n/** Pure in-process backend over a loaded graph. */\nexport function localGraphBackend(graph: VgGraph): GraphBackend {\n  return {\n    source: 'local',\n    async search(query, opts) {\n      const res = queryGraph(graph, query, { budget: 1500, limit: opts?.limit ?? 10 });\n      return {\n        source: 'local',\n        matches: res.matches.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          signature: m.node.signature ?? null,\n        })),\n      };\n    },\n    async impact(symbol, opts) {\n      const node = resolveSymbolId(graph, symbol);\n      if (!node) return null;\n      const imp = impactOf(graph, node, { depth: opts?.depth ?? 4 });\n      return {\n        source: 'local',\n        root: imp.root,\n        depth: imp.depth,\n        affected: imp.affected.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: imp.direct,\n        transitive: imp.transitive,\n      };\n    },\n  };\n}\n\nexport interface VgdGraphBackendOptions {\n  repositoryId: string;\n  gitRef?: string;\n  socketPath?: string;\n  /** Always required for fall back when vgd has no slot or is down. */\n  fallback: VgGraph;\n  request?: (req: VgdRequest, opts?: VgdClientOptions) => Promise<unknown>;\n}\n\n/**\n * Prefer vgd query/impact; on any failure or empty daemon state, use local.\n * The returned `source` reflects which path answered.\n */\nexport function vgdGraphBackend(options: VgdGraphBackendOptions): GraphBackend {\n  const local = localGraphBackend(options.fallback);\n  const request = options.request ?? ((req, opts) => vgdRequest(req, opts));\n  const clientOpts: VgdClientOptions = { socketPath: options.socketPath };\n\n  return {\n    source: 'vgd',\n    async search(query, opts) {\n      try {\n        const res = (await request(\n          {\n            op: 'query-graph',\n            repositoryId: options.repositoryId,\n            query,\n            limit: opts?.limit ?? 10,\n            gitRef: options.gitRef,\n          },\n          clientOpts,\n        )) as {\n          ok?: boolean;\n          matches?: Array<{\n            id: string;\n            qualifiedName: string;\n            kind: string;\n            file: string;\n            line: number;\n            score: number;\n            why: string;\n          }>;\n        };\n        if (res?.ok && Array.isArray(res.matches)) {\n          return {\n            source: 'vgd',\n            matches: res.matches.map((m) => ({\n              id: m.id,\n              qualifiedName: m.qualifiedName,\n              kind: m.kind,\n              file: m.file,\n              line: m.line,\n              score: m.score,\n              why: m.why,\n              signature: null,\n            })),\n          };\n        }\n      } catch {\n        /* fall through */\n      }\n      return local.search(query, opts);\n    },\n    async impact(symbol, opts) {\n      try {\n        const res = (await request(\n          {\n            op: 'impact-of',\n            repositoryId: options.repositoryId,\n            symbol,\n            depth: opts?.depth ?? 4,\n            gitRef: options.gitRef,\n          },\n          clientOpts,\n        )) as {\n          ok?: boolean;\n          root?: { id: string; name: string };\n          depth?: number;\n          affected?: GraphImpactHit[];\n          direct?: number;\n          transitive?: number;\n        };\n        if (res?.ok && res.root && Array.isArray(res.affected)) {\n          return {\n            source: 'vgd',\n            root: res.root,\n            depth: res.depth ?? opts?.depth ?? 4,\n            affected: res.affected,\n            direct: res.direct ?? 0,\n            transitive: res.transitive ?? 0,\n          };\n        }\n      } catch {\n        /* fall through */\n      }\n      return local.impact(symbol, opts);\n    },\n  };\n}\n\n/**\n * Pick a backend: vgd when repositoryId + socket are known, else local.\n */\nexport function resolveGraphBackend(input: {\n  graph: VgGraph;\n  repositoryId?: string | null;\n  gitRef?: string | null;\n  socketPath?: string | null;\n}): GraphBackend {\n  if (input.repositoryId && input.socketPath) {\n    return vgdGraphBackend({\n      repositoryId: input.repositoryId,\n      gitRef: input.gitRef ?? undefined,\n      socketPath: input.socketPath,\n      fallback: input.graph,\n    });\n  }\n  return localGraphBackend(input.graph);\n}\n\nfunction resolveSymbolId(graph: VgGraph, symbol: string): string | null {\n  if (graph.nodes.some((n) => n.id === symbol)) return symbol;\n  const hit = resolveOne(graph, symbol);\n  if (hit.node?.id) return hit.node.id;\n  if (hit.candidates.length === 1 && hit.candidates[0]?.id) return 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 ?? null;\n}\n"]}
+{"version":3,"sources":["../src/code/graph-backend.ts"],"names":[],"mappings":";;;;;AA2DO,SAAS,kBAAkB,KAAA,EAA8B;AAC9D,EAAA,OAAO;AAAA,IACL,MAAA,EAAQ,OAAA;AAAA,IACR,MAAM,MAAA,CAAO,KAAA,EAAO,IAAA,EAAM;AACxB,MAAA,MAAM,GAAA,GAAM,UAAA,CAAW,KAAA,EAAO,KAAA,EAAO,EAAE,MAAA,EAAQ,IAAA,EAAM,KAAA,EAAO,IAAA,EAAM,KAAA,IAAS,EAAA,EAAI,CAAA;AAC/E,MAAA,OAAO;AAAA,QACL,MAAA,EAAQ,OAAA;AAAA,QACR,OAAA,EAAS,GAAA,CAAI,OAAA,CAAQ,GAAA,CAAI,CAAC,CAAA,MAAO;AAAA,UAC/B,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,GAAA;AAAA,UACP,SAAA,EAAW,CAAA,CAAE,IAAA,CAAK,SAAA,IAAa;AAAA,SACjC,CAAE;AAAA,OACJ;AAAA,IACF,CAAA;AAAA,IACA,MAAM,MAAA,CAAO,MAAA,EAAQ,IAAA,EAAM;AACzB,MAAA,MAAM,IAAA,GAAO,eAAA,CAAgB,KAAA,EAAO,MAAM,CAAA;AAC1C,MAAA,IAAI,CAAC,MAAM,OAAO,IAAA;AAClB,MAAA,MAAM,GAAA,GAAM,SAAS,KAAA,EAAO,IAAA,EAAM,EAAE,KAAA,EAAO,IAAA,EAAM,KAAA,IAAS,CAAA,EAAG,CAAA;AAC7D,MAAA,OAAO;AAAA,QACL,MAAA,EAAQ,OAAA;AAAA,QACR,MAAM,GAAA,CAAI,IAAA;AAAA,QACV,OAAO,GAAA,CAAI,KAAA;AAAA,QACX,QAAA,EAAU,GAAA,CAAI,QAAA,CAAS,GAAA,CAAI,CAAC,CAAA,MAAO;AAAA,UACjC,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,GAAA,CAAI,MAAA;AAAA,QACZ,YAAY,GAAA,CAAI;AAAA,OAClB;AAAA,IACF;AAAA,GACF;AACF;AAeO,SAAS,gBAAgB,OAAA,EAA+C;AAC7E,EAAA,MAAM,KAAA,GAAQ,iBAAA,CAAkB,OAAA,CAAQ,QAAQ,CAAA;AAChD,EAAA,MAAM,OAAA,GAAU,QAAQ,OAAA,KAAY,CAAC,KAAK,IAAA,KAAS,UAAA,CAAW,KAAK,IAAI,CAAA,CAAA;AACvE,EAAA,MAAM,UAAA,GAA+B,EAAE,UAAA,EAAY,OAAA,CAAQ,UAAA,EAAW;AAEtE,EAAA,OAAO;AAAA,IACL,MAAA,EAAQ,KAAA;AAAA,IACR,MAAM,MAAA,CAAO,KAAA,EAAO,IAAA,EAAM;AACxB,MAAA,IAAI;AACF,QAAA,MAAM,MAAO,MAAM,OAAA;AAAA,UACjB;AAAA,YACE,EAAA,EAAI,aAAA;AAAA,YACJ,cAAc,OAAA,CAAQ,YAAA;AAAA,YACtB,KAAA;AAAA,YACA,KAAA,EAAO,MAAM,KAAA,IAAS,EAAA;AAAA,YACtB,QAAQ,OAAA,CAAQ;AAAA,WAClB;AAAA,UACA;AAAA,SACF;AAYA,QAAA,IAAI,KAAK,EAAA,IAAM,KAAA,CAAM,OAAA,CAAQ,GAAA,CAAI,OAAO,CAAA,EAAG;AACzC,UAAA,OAAO;AAAA,YACL,MAAA,EAAQ,KAAA;AAAA,YACR,OAAA,EAAS,GAAA,CAAI,OAAA,CAAQ,GAAA,CAAI,CAAC,CAAA,MAAO;AAAA,cAC/B,IAAI,CAAA,CAAE,EAAA;AAAA,cACN,eAAe,CAAA,CAAE,aAAA;AAAA,cACjB,MAAM,CAAA,CAAE,IAAA;AAAA,cACR,MAAM,CAAA,CAAE,IAAA;AAAA,cACR,MAAM,CAAA,CAAE,IAAA;AAAA,cACR,OAAO,CAAA,CAAE,KAAA;AAAA,cACT,KAAK,CAAA,CAAE,GAAA;AAAA,cACP,SAAA,EAAW;AAAA,aACb,CAAE;AAAA,WACJ;AAAA,QACF;AAAA,MACF,CAAA,CAAA,MAAQ;AAAA,MAER;AACA,MAAA,OAAO,KAAA,CAAM,MAAA,CAAO,KAAA,EAAO,IAAI,CAAA;AAAA,IACjC,CAAA;AAAA,IACA,MAAM,MAAA,CAAO,MAAA,EAAQ,IAAA,EAAM;AACzB,MAAA,IAAI;AACF,QAAA,MAAM,MAAO,MAAM,OAAA;AAAA,UACjB;AAAA,YACE,EAAA,EAAI,WAAA;AAAA,YACJ,cAAc,OAAA,CAAQ,YAAA;AAAA,YACtB,MAAA;AAAA,YACA,KAAA,EAAO,MAAM,KAAA,IAAS,CAAA;AAAA,YACtB,QAAQ,OAAA,CAAQ;AAAA,WAClB;AAAA,UACA;AAAA,SACF;AAQA,QAAA,IAAI,GAAA,EAAK,MAAM,GAAA,CAAI,IAAA,IAAQ,MAAM,OAAA,CAAQ,GAAA,CAAI,QAAQ,CAAA,EAAG;AACtD,UAAA,OAAO;AAAA,YACL,MAAA,EAAQ,KAAA;AAAA,YACR,MAAM,GAAA,CAAI,IAAA;AAAA,YACV,KAAA,EAAO,GAAA,CAAI,KAAA,IAAS,IAAA,EAAM,KAAA,IAAS,CAAA;AAAA,YACnC,UAAU,GAAA,CAAI,QAAA;AAAA,YACd,MAAA,EAAQ,IAAI,MAAA,IAAU,CAAA;AAAA,YACtB,UAAA,EAAY,IAAI,UAAA,IAAc;AAAA,WAChC;AAAA,QACF;AAAA,MACF,CAAA,CAAA,MAAQ;AAAA,MAER;AACA,MAAA,OAAO,KAAA,CAAM,MAAA,CAAO,MAAA,EAAQ,IAAI,CAAA;AAAA,IAClC;AAAA,GACF;AACF;AAKO,SAAS,oBAAoB,KAAA,EAKnB;AACf,EAAA,IAAI,KAAA,CAAM,YAAA,IAAgB,KAAA,CAAM,UAAA,EAAY;AAC1C,IAAA,OAAO,eAAA,CAAgB;AAAA,MACrB,cAAc,KAAA,CAAM,YAAA;AAAA,MACpB,MAAA,EAAQ,MAAM,MAAA,IAAU,MAAA;AAAA,MACxB,YAAY,KAAA,CAAM,UAAA;AAAA,MAClB,UAAU,KAAA,CAAM;AAAA,KACjB,CAAA;AAAA,EACH;AACA,EAAA,OAAO,iBAAA,CAAkB,MAAM,KAAK,CAAA;AACtC;AAEA,SAAS,eAAA,CAAgB,OAAgB,MAAA,EAA+B;AACtE,EAAA,IAAI,KAAA,CAAM,MAAM,IAAA,CAAK,CAAC,MAAM,CAAA,CAAE,EAAA,KAAO,MAAM,CAAA,EAAG,OAAO,MAAA;AACrD,EAAA,MAAM,GAAA,GAAM,UAAA,CAAW,KAAA,EAAO,MAAM,CAAA;AACpC,EAAA,IAAI,GAAA,CAAI,IAAA,EAAM,EAAA,EAAI,OAAO,IAAI,IAAA,CAAK,EAAA;AAClC,EAAA,IAAI,GAAA,CAAI,UAAA,CAAW,MAAA,KAAW,CAAA,IAAK,GAAA,CAAI,UAAA,CAAW,CAAC,CAAA,EAAG,EAAA,EAAI,OAAO,GAAA,CAAI,UAAA,CAAW,CAAC,CAAA,CAAE,EAAA;AACnF,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,MAAM,EAAA,IAAM,IAAA;AACrB","file":"chunk-6AYDFFP5.js","sourcesContent":["/**\n * Graph query backend for the agent tool layer (Fusion Runtime).\n *\n * Tools prefer a warm ActiveGraph in vgd when a daemon session is attached;\n * otherwise they fall back to the in-process {@link VgGraph}. Failures never\n * surface to the model as transport errors — they degrade to local query.\n */\n\nimport { queryGraph } from '../engine/query.js';\nimport { impactOf } from '../engine/impact.js';\nimport { resolveOne } from '../engine/lookup.js';\nimport { vgdRequest, type VgdClientOptions } from '../runtime/vgd/client.js';\nimport type { VgdRequest } from '../runtime/vgd/protocol.js';\nimport type { VgGraph } from '../schema.js';\n\nexport type GraphBackendSource = 'local' | 'vgd';\n\nexport interface GraphSearchHit {\n  id: string;\n  qualifiedName: string;\n  kind: string;\n  file: string;\n  line: number;\n  score: number;\n  why: string;\n  signature?: string | null;\n}\n\nexport interface GraphImpactHit {\n  id: string;\n  name: string;\n  kind: string;\n  file: string;\n  line: number;\n  depth: number;\n  confidence: number;\n}\n\nexport interface GraphImpactResult {\n  root: { id: string; name: string };\n  depth: number;\n  affected: GraphImpactHit[];\n  direct: number;\n  transitive: number;\n  source: GraphBackendSource;\n}\n\nexport interface GraphSearchResult {\n  matches: GraphSearchHit[];\n  source: GraphBackendSource;\n}\n\nexport interface GraphBackend {\n  readonly source: GraphBackendSource;\n  search(query: string, opts?: { limit?: number }): Promise<GraphSearchResult>;\n  impact(symbol: string, opts?: { depth?: number }): Promise<GraphImpactResult | null>;\n}\n\n/** Pure in-process backend over a loaded graph. */\nexport function localGraphBackend(graph: VgGraph): GraphBackend {\n  return {\n    source: 'local',\n    async search(query, opts) {\n      const res = queryGraph(graph, query, { budget: 1500, limit: opts?.limit ?? 10 });\n      return {\n        source: 'local',\n        matches: res.matches.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          signature: m.node.signature ?? null,\n        })),\n      };\n    },\n    async impact(symbol, opts) {\n      const node = resolveSymbolId(graph, symbol);\n      if (!node) return null;\n      const imp = impactOf(graph, node, { depth: opts?.depth ?? 4 });\n      return {\n        source: 'local',\n        root: imp.root,\n        depth: imp.depth,\n        affected: imp.affected.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: imp.direct,\n        transitive: imp.transitive,\n      };\n    },\n  };\n}\n\nexport interface VgdGraphBackendOptions {\n  repositoryId: string;\n  gitRef?: string;\n  socketPath?: string;\n  /** Always required for fall back when vgd has no slot or is down. */\n  fallback: VgGraph;\n  request?: (req: VgdRequest, opts?: VgdClientOptions) => Promise<unknown>;\n}\n\n/**\n * Prefer vgd query/impact; on any failure or empty daemon state, use local.\n * The returned `source` reflects which path answered.\n */\nexport function vgdGraphBackend(options: VgdGraphBackendOptions): GraphBackend {\n  const local = localGraphBackend(options.fallback);\n  const request = options.request ?? ((req, opts) => vgdRequest(req, opts));\n  const clientOpts: VgdClientOptions = { socketPath: options.socketPath };\n\n  return {\n    source: 'vgd',\n    async search(query, opts) {\n      try {\n        const res = (await request(\n          {\n            op: 'query-graph',\n            repositoryId: options.repositoryId,\n            query,\n            limit: opts?.limit ?? 10,\n            gitRef: options.gitRef,\n          },\n          clientOpts,\n        )) as {\n          ok?: boolean;\n          matches?: Array<{\n            id: string;\n            qualifiedName: string;\n            kind: string;\n            file: string;\n            line: number;\n            score: number;\n            why: string;\n          }>;\n        };\n        if (res?.ok && Array.isArray(res.matches)) {\n          return {\n            source: 'vgd',\n            matches: res.matches.map((m) => ({\n              id: m.id,\n              qualifiedName: m.qualifiedName,\n              kind: m.kind,\n              file: m.file,\n              line: m.line,\n              score: m.score,\n              why: m.why,\n              signature: null,\n            })),\n          };\n        }\n      } catch {\n        /* fall through */\n      }\n      return local.search(query, opts);\n    },\n    async impact(symbol, opts) {\n      try {\n        const res = (await request(\n          {\n            op: 'impact-of',\n            repositoryId: options.repositoryId,\n            symbol,\n            depth: opts?.depth ?? 4,\n            gitRef: options.gitRef,\n          },\n          clientOpts,\n        )) as {\n          ok?: boolean;\n          root?: { id: string; name: string };\n          depth?: number;\n          affected?: GraphImpactHit[];\n          direct?: number;\n          transitive?: number;\n        };\n        if (res?.ok && res.root && Array.isArray(res.affected)) {\n          return {\n            source: 'vgd',\n            root: res.root,\n            depth: res.depth ?? opts?.depth ?? 4,\n            affected: res.affected,\n            direct: res.direct ?? 0,\n            transitive: res.transitive ?? 0,\n          };\n        }\n      } catch {\n        /* fall through */\n      }\n      return local.impact(symbol, opts);\n    },\n  };\n}\n\n/**\n * Pick a backend: vgd when repositoryId + socket are known, else local.\n */\nexport function resolveGraphBackend(input: {\n  graph: VgGraph;\n  repositoryId?: string | null;\n  gitRef?: string | null;\n  socketPath?: string | null;\n}): GraphBackend {\n  if (input.repositoryId && input.socketPath) {\n    return vgdGraphBackend({\n      repositoryId: input.repositoryId,\n      gitRef: input.gitRef ?? undefined,\n      socketPath: input.socketPath,\n      fallback: input.graph,\n    });\n  }\n  return localGraphBackend(input.graph);\n}\n\nfunction resolveSymbolId(graph: VgGraph, symbol: string): string | null {\n  if (graph.nodes.some((n) => n.id === symbol)) return symbol;\n  const hit = resolveOne(graph, symbol);\n  if (hit.node?.id) return hit.node.id;\n  if (hit.candidates.length === 1 && hit.candidates[0]?.id) return 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 ?? null;\n}\n"]}