@thanh01.pmt/domain-kit 0.1.0 → 0.2.1

package/dist/chunk-3VVPSRAM.mjs.map

@@ -1 +0,0 @@
-{"version":3,"sources":["../src/graph/loCodeStandard.ts","../src/graph/loExemplars.ts","../src/graph/depthAudit.ts","../src/graph/hierarchicalLoAuthoring.ts","../src/graph/knowledgeTreeCatalog.ts","../src/graph/conceptStandardizer.ts","../src/graph/knowledgeGraphPipeline.ts","../src/graph/hybridGraphPipeline.ts"],"names":["mkdirSync","writeFileSync","JSON_ONLY","prereqMap"],"mappings":";;;;;;AAiBA,IAAM,YAAA,GAAuC;AAAA,EAC3C,MAAA,EAAQ,IAAA;AAAA,EAAM,KAAA,EAAO,IAAA;AAAA,EAAM,UAAA,EAAY,IAAA;AAAA,EAAM,UAAA,EAAY,IAAA;AAAA,EAAM,IAAA,EAAM,MAAA;AAAA,EACrE,MAAA,EAAQ,IAAA;AAAA,EAAM,EAAA,EAAI,IAAA;AAAA,EAAM,IAAA,EAAM,MAAA;AAAA,EAAQ,MAAA,EAAQ,IAAA;AAAA,EAAM,GAAA,EAAK,KAAA;AAAA,EAAO,IAAA,EAAM,IAAA;AAAA,EACtE,GAAA,EAAK,KAAA;AAAA,EAAO,IAAA,EAAM,IAAA;AAAA,EAAM,GAAA,EAAK,KAAA;AAAA,EAAO,IAAA,EAAM,MAAA;AAAA,EAAQ,GAAA,EAAK;AACzD,CAAA;AAGO,SAAS,WAAW,SAAA,EAA2B;AACpD,EAAA,MAAM,OAAA,GAAA,CAAW,SAAA,IAAa,EAAA,EAAI,IAAA,GAAO,WAAA,EAAY;AACrD,EAAA,KAAA,MAAW,CAAC,GAAA,EAAK,GAAG,KAAK,MAAA,CAAO,OAAA,CAAQ,YAAY,CAAA,EAAG;AACrD,IAAA,IAAI,OAAA,CAAQ,QAAA,CAAS,GAAG,CAAA,EAAG,OAAO,GAAA;AAAA,EACpC;AACA,EAAA,MAAM,QAAQ,OAAA,CAAQ,KAAA,CAAM,UAAU,CAAA,CAAE,CAAC,CAAA,IAAK,EAAA;AAC9C,EAAA,IAAI,CAAC,QAAA,CAAS,IAAA,CAAK,KAAK,GAAG,OAAO,KAAA;AAClC,EAAA,OAAO,KAAA,CAAM,MAAA,IAAU,CAAA,GAAI,KAAA,CAAM,WAAA,EAAY,GAAI,KAAA,CAAM,KAAA,CAAM,CAAA,EAAG,CAAC,CAAA,CAAE,WAAA,EAAY;AACjF;AAIA,IAAM,WAAA,mBAAc,IAAI,GAAA,CAAI,CAAC,OAAO,IAAA,EAAM,KAAA,EAAO,IAAA,EAAM,KAAA,EAAO,IAAA,EAAM,IAAA,EAAM,GAAA,EAAK,IAAA,EAAM,IAAI,CAAC,CAAA;AAGnF,SAAS,oBAAoB,IAAA,EAAsB;AACxD,EAAA,MAAM,KAAA,GAAQ,KACX,OAAA,CAAQ,gBAAA,EAAkB,GAAG,CAAA,CAC7B,IAAA,EAAK,CACL,KAAA,CAAM,KAAK,CAAA,CACX,OAAO,CAAC,CAAA,KAAM,CAAA,CAAE,MAAA,GAAS,CAAA,IAAK,CAAC,YAAY,GAAA,CAAI,CAAA,CAAE,WAAA,EAAa,CAAC,CAAA;AAClE,EAAA,MAAM,IAAA,GAAO,KAAA,CAAM,IAAA,CAAK,GAAG,CAAA,CAAE,WAAA,EAAY,CAAE,OAAA,CAAQ,UAAA,EAAY,EAAE,CAAA,CAAE,OAAA,CAAQ,UAAU,GAAG,CAAA;AACxF,EAAA,MAAM,OAAA,GAAA,CAAW,QAAQ,SAAA,EAAW,KAAA,CAAM,GAAG,EAAE,CAAA,CAAE,OAAA,CAAQ,MAAA,EAAQ,EAAE,CAAA;AACnE,EAAA,OAAO,OAAA;AACT;AAOO,SAAS,mBAAmB,QAAA,EAAuE;AACxG,EAAA,MAAM,IAAA,uBAAW,GAAA,EAAoB;AACrC,EAAA,MAAM,MAA8B,EAAC;AACrC,EAAA,KAAA,MAAW,KAAK,QAAA,EAAU;AACxB,IAAA,MAAM,IAAA,GAAO,mBAAA,CAAoB,CAAA,CAAE,IAAI,CAAA;AACvC,IAAA,MAAM,CAAA,GAAA,CAAK,IAAA,CAAK,GAAA,CAAI,IAAI,KAAK,CAAA,IAAK,CAAA;AAClC,IAAA,IAAA,CAAK,GAAA,CAAI,MAAM,CAAC,CAAA;AAChB,IAAA,GAAA,CAAI,EAAE,EAAE,CAAA,GAAI,MAAM,CAAA,GAAI,IAAA,GAAO,OAAO,GAAA,GAAM,CAAA;AAAA,EAC5C;AACA,EAAA,OAAO,GAAA;AACT;AAIA,IAAM,IAAA,GAAO,CAAC,CAAA,KAAsB,MAAA,CAAO,CAAC,CAAA,CAAE,QAAA,CAAS,GAAG,GAAG,CAAA;AAEtD,SAAS,OAAA,CAAQ,WAAA,EAAqB,GAAA,GAAM,CAAA,EAAW;AAC5D,EAAA,OAAO,MAAA,GAAS,WAAA,GAAc,GAAA,GAAM,IAAA,CAAK,GAAG,CAAA;AAC9C;AAEA,IAAM,aAAA,uBAAoB,GAAA,CAAI;AAAA;AAAA,EAE5B,SAAA;AAAA,EAAW,MAAA;AAAA,EAAQ,IAAA;AAAA,EAAM,MAAA;AAAA;AAAA,EAEzB,GAAA;AAAA,EAAK,IAAA;AAAA,EAAM,KAAA;AAAA,EAAO,IAAA;AAAA,EAAM,IAAA;AAAA,EAAM,KAAA;AAAA,EAAO,IAAA;AAAA,EAAM,IAAA;AAAA,EAAM,IAAA;AAAA,EAAM,KAAA;AAAA,EAAO,IAAA;AAAA,EAAM,MAAA;AAAA,EACpE,IAAA;AAAA,EAAM,KAAA;AAAA,EAAO,MAAA;AAAA,EAAQ,IAAA;AAAA,EAAM,KAAA;AAAA,EAAO,OAAA;AAAA,EAAS,MAAA;AAAA,EAAQ,KAAA;AAAA,EAAO,IAAA;AAAA,EAAM,MAAA;AAAA,EAAQ;AAC1E,CAAC,CAAA;AAGM,SAAS,cAAc,OAAA,EAAyB;AACrD,EAAA,MAAM,IAAA,GAAO,QAAQ,UAAA,CAAW,cAAc,IAAI,OAAA,CAAQ,KAAA,CAAM,cAAA,CAAe,MAAM,CAAA,GAAI,OAAA;AACzF,EAAA,MAAM,KAAA,GAAQ,IAAA,CAAK,OAAA,CAAQ,gBAAA,EAAkB,GAAG,CAAA,CAAE,IAAA,EAAK,CAAE,KAAA,CAAM,KAAK,CAAA,CACjE,GAAA,CAAI,CAAC,CAAA,KAAM,CAAA,CAAE,WAAA,EAAa,CAAA,CAC1B,MAAA,CAAO,CAAC,CAAA,KAAM,CAAA,CAAE,MAAA,GAAS,CAAA,IAAK,CAAC,aAAA,CAAc,GAAA,CAAI,CAAC,CAAC,CAAA;AACtD,EAAA,MAAM,IAAA,uBAAW,GAAA,EAAY;AAC7B,EAAA,MAAM,SAAmB,EAAC;AAC1B,EAAA,KAAA,MAAW,KAAK,KAAA,EAAO;AACrB,IAAA,IAAI,CAAC,IAAA,CAAK,GAAA,CAAI,CAAC,CAAA,EAAG;AAAE,MAAA,IAAA,CAAK,IAAI,CAAC,CAAA;AAAG,MAAA,MAAA,CAAO,KAAK,CAAC,CAAA;AAAA,IAAG;AACjD,IAAA,IAAI,MAAA,CAAO,WAAW,CAAA,EAAG;AAAA,EAC3B;AACA,EAAA,OAAA,CAAQ,MAAA,CAAO,MAAA,GAAS,CAAA,GAAI,MAAA,GAAS,CAAC,OAAO,CAAA,EAAG,IAAA,CAAK,GAAG,CAAA,CAAE,WAAA,EAAY;AACxE;AAEO,SAAS,OAAA,CAAQ,WAAA,EAAqB,MAAA,EAAgB,UAAA,EAA4B;AACvF,EAAA,OAAO,SAAS,WAAA,GAAc,GAAA,GAAM,IAAA,CAAK,MAAM,IAAI,GAAA,GAAM,UAAA;AAC3D;AAEO,SAAS,OAAA,CAAQ,OAAA,EAAiB,WAAA,EAAqB,GAAA,EAAqB;AACjF,EAAA,OAAO,SAAS,OAAA,GAAU,GAAA,GAAM,WAAA,GAAc,GAAA,GAAM,KAAK,GAAG,CAAA;AAC9D;AAIO,IAAM,cAAA,GAAiB;AAGvB,SAAS,kBAAkB,IAAA,EAAsB;AACtD,EAAA,IAAI,IAAA,GAAA,CAAQ,IAAA,IAAQ,EAAA,EAAI,IAAA,EAAK,CAAE,OAAA,CAAQ,wCAAA,EAA0C,EAAE,CAAA,CAAE,OAAA,CAAQ,MAAA,EAAQ,GAAG,CAAA;AACxG,EAAA,IAAI,IAAA,CAAK,MAAA,KAAW,CAAA,EAAG,OAAO,EAAA;AAE9B,EAAA,MAAM,YAAY,IAAA,CAAK,KAAA,CAAM,GAAG,CAAA,CAAE,CAAC,CAAA,IAAK,EAAA;AACxC,EAAA,MAAM,eAAe,gBAAA,CAAiB,IAAA,CAAK,SAAS,CAAA,IAAK,UAAU,MAAA,GAAS,CAAA;AAC5E,EAAA,IAAI,CAAC,YAAA,EAAc,IAAA,GAAO,IAAA,CAAK,MAAA,CAAO,CAAC,CAAA,CAAE,WAAA,EAAY,GAAI,IAAA,CAAK,KAAA,CAAM,CAAC,CAAA;AACrE,EAAA,IAAA,GAAO,IAAA,CAAK,OAAA,CAAQ,SAAA,EAAW,EAAE,CAAA;AACjC,EAAA,OAAO,iBAAiB,IAAA,GAAO,GAAA;AACjC;AAIO,IAAM,eAAA,GAAkB;AACxB,IAAM,WAAA,GAAc;AACpB,IAAM,WAAA,GAAc;AACpB,IAAM,WAAA,GAAc;;;ACxHpB,IAAM,aAAA,GAA0B;AAAA;AAAA,EAErC,iHAAA;AAAA,EACA,8HAAA;AAAA,EACA,sGAAA;AAAA,EACA,oHAAA;AAAA,EACA,gHAAA;AAAA,EACA;AACF,CAAA;AAEO,IAAM,aAAA,GAA0B;AAAA;AAAA,EAErC,8IAAA;AAAA,EACA,6HAAA;AAAA,EACA,2IAAA;AAAA,EACA;AACF,CAAA;AAEO,IAAM,aAAA,GAA0B;AAAA;AAAA,EAErC,sIAAA;AAAA,EACA,2IAAA;AAAA,EACA,+JAAA;AAAA,EACA;AACF,CAAA;;;ACfA,IAAM,eAAA,GAA4B;AAAA,EAChC,SAAA;AAAA,EACA,8BAAA;AAAA;AAAA,EAEA,mCAAA;AAAA;AAAA,EAEA,yCAAA;AAAA,EACA,eAAA;AAAA,EACA,sBAAA;AAAA,EACA,gBAAA;AAAA,EACA,8EAAA;AAAA;AAAA,EAEA,yDAAA;AAAA;AAAA,EAEA,kCAAA;AAAA;AAAA,EAEA;AACF,CAAA;AAGA,IAAM,+BAAe,IAAI,GAAA,CAAI,CAAC,GAAA,EAAK,GAAA,EAAK,GAAG,CAAC,CAAA;AAE5C,SAAS,eAAe,IAAA,EAAwB;AAC9C,EAAA,MAAM,OAAiB,EAAC;AACxB,EAAA,KAAA,MAAW,MAAM,eAAA,EAAiB;AAChC,IAAA,MAAM,KAAA,GAAQ,IAAA,CAAK,KAAA,CAAM,IAAI,MAAA,CAAO,GAAG,MAAA,EAAQ,GAAG,CAAC,CAAA,IAAK,EAAC;AACzD,IAAA,KAAA,MAAW,CAAA,IAAK,KAAA,EAAO,IAAI,CAAC,YAAA,CAAa,GAAA,CAAI,CAAA,CAAE,WAAA,EAAa,CAAA,EAAG,IAAA,CAAK,IAAA,CAAK,CAAC,CAAA;AAAA,EAC5E;AACA,EAAA,OAAO,IAAA;AACT;AAoBO,SAAS,iBACd,QAAA,EAKmB;AACnB,EAAA,OAAO,QAAA,CAAS,GAAA,CAAI,CAAC,CAAA,KAAM;AACzB,IAAA,MAAM,GAAA,GAAA,CAAO,CAAA,CAAE,GAAA,IAAO,EAAA,EAAI,IAAA,EAAK;AAC/B,IAAA,MAAM,GAAA,GAAA,CAAO,CAAA,CAAE,GAAA,IAAO,EAAA,EAAI,IAAA,EAAK;AAC/B,IAAA,MAAM,QAAA,GAAA,CAAY,CAAA,CAAE,GAAA,IAAO,IAAI,GAAA,CAAI,CAAC,CAAA,KAAA,CAAO,CAAA,IAAK,EAAA,EAAI,IAAA,EAAM,CAAA,CAAE,OAAO,OAAO,CAAA;AAC1E,IAAA,MAAM,cAAA,GAAiB,eAAe,GAAG,CAAA;AACzC,IAAA,MAAM,iBAAA,GAAoB,eAAe,MAAA,GAAS,CAAA;AAClD,IAAA,MAAM,UAAA,GAAa,2CAAA;AACnB,IAAA,MAAM,yBAAA,GAA4B,UAAA,CAAW,IAAA,CAAK,GAAG,CAAA;AACrD,IAAA,MAAM,oBAAoB,CAAA,CAAE,QAAA,IAAY,EAAC,EAAG,GAAA,CAAI,CAAC,CAAA,KAAM,MAAA,CAAO,CAAC,CAAA,CAAE,WAAA,EAAa,CAAA,CAAE,MAAA,CAAO,CAAC,CAAA,KAAM,CAAA,CAAE,UAAU,CAAC,CAAA;AAG7G,IAAA,MAAM,aAAa,MAAA,CAAO,CAAA,CAAE,IAAA,IAAQ,EAAE,EAAE,WAAA,EAAY,CAAE,KAAA,CAAM,YAAY,EAAE,MAAA,CAAO,CAAC,CAAA,KAAM,CAAA,CAAE,UAAU,CAAC,CAAA;AACrG,IAAA,MAAM,cAAA,GAAiB,CAAC,CAAA,KAAuB;AAC7C,MAAA,MAAM,KAAA,GAAQ,EAAE,WAAA,EAAY;AAC5B,MAAA,OAAO,iBAAiB,IAAA,CAAK,CAAC,CAAA,KAAM,KAAA,CAAM,SAAS,CAAC,CAAC,CAAA,IAAK,UAAA,CAAW,KAAK,CAAC,CAAA,KAAM,KAAA,CAAM,QAAA,CAAS,CAAC,CAAC,CAAA;AAAA,IACpG,CAAA;AACA,IAAA,MAAM,eAAA,GAAkB,QAAA,CAAS,MAAA,CAAO,CAAC,CAAA,KAAM;AAC7C,MAAA,IAAI,cAAA,CAAe,CAAC,CAAA,CAAE,MAAA,GAAS,GAAG,OAAO,KAAA;AAGzC,MAAA,OAAO,CAAC,eAAe,CAAC,CAAA;AAAA,IAC1B,CAAC,CAAA;AAIC,IAAA,MAAM,eAAA,GAAA,CAAmB,CAAA,CAAE,QAAA,IAAY,EAAC,EAAG,GAAA,CAAI,CAAC,CAAA,KAAM,CAAA,CAAE,WAAA,EAAa,CAAA,CAAE,OAAO,OAAO,CAAA;AACrF,IAAA,MAAM,kBAAA,GAAqB,eAAA,CAAgB,MAAA,GAAS,CAAA,GAChD,QAAA,CAAS,MAAA,CAAO,CAAC,CAAA,KAAM,CAAC,cAAA,CAAe,CAAC,CAAC,IACzC,EAAC;AACL,IAAA,MAAM,WAAA,GAAc,0mBAAA;AACpB,IAAA,MAAM,iBAAA,GAAoB,QAAA,CAAS,MAAA,CAAO,CAAC,MAAM,CAAC,WAAA,CAAY,IAAA,CAAK,CAAC,CAAA,IAAK,CAAC,SAAA,CAAU,IAAA,CAAK,CAAC,CAAC,CAAA;AAC3F,IAAA,MAAM,OAAA,GAAU,CAAC,IAAA,KAAyB;AACxC,MAAA,IAAI,CAAC,MAAM,OAAO,CAAA;AAClB,MAAA,OAAQ,cAAA,CAAe,IAAI,CAAA,CAAE,MAAA,GAAS,IAAA,CAAK,GAAA,CAAI,CAAA,EAAG,IAAA,CAAK,KAAA,CAAM,KAAK,CAAA,CAAE,MAAM,CAAA,GAAK,GAAA;AAAA,IACjF,CAAA;AACA,IAAA,MAAM,IAAA,GAAO,QAAQ,GAAG,CAAA;AACxB,IAAa,QAAQ,GAAG;AACxB,IAAA,MAAM,IAAA,GAAO,QAAA,CAAS,MAAA,GAAS,CAAA,GAAI,IAAA,CAAK,GAAA,CAAI,GAAG,QAAA,CAAS,GAAA,CAAI,OAAO,CAAC,CAAA,GAAI,CAAA;AACxE,IAAA,MAAM,wBAAwB,IAAA,GAAO,IAAA;AAErC,IAAA,MAAM,WACJ,GAAA,CAAI,UAAA,CAAW,cAAc,CAAA,IAC7B,IAAI,UAAA,CAAW,cAAc,CAAA,IAC7B,QAAA,CAAS,MAAM,CAAC,CAAA,KAAM,CAAA,CAAE,UAAA,CAAW,cAAc,CAAC,CAAA;AACpD,IAAA,MAAM,aAAuB,EAAC;AAC9B,IAAA,MAAM,cAAe,CAAA,CAAwB,IAAA;AAC7C,IAAA,IAAI,WAAA,KAAgB,MAAA,IAAa,CAAC,eAAA,CAAgB,IAAA,CAAK,WAAW,CAAA,EAAG,UAAA,CAAW,IAAA,CAAK,gCAAA,GAAmC,WAAW,CAAA;AACnI,IAAA,MAAM,aAAc,CAAA,CAA4B,QAAA;AAChD,IAAA,IAAI,UAAA,KAAe,MAAA,IAAa,UAAA,KAAe,EAAA,IAAM,CAAC,WAAA,CAAY,IAAA,CAAK,UAAU,CAAA,EAAG,UAAA,CAAW,IAAA,CAAK,sBAAA,GAAyB,UAAU,CAAA;AACvI,IAAA,MAAM,aAAc,CAAA,CAA4B,QAAA;AAChD,IAAA,IAAI,UAAA,KAAe,MAAA,IAAa,UAAA,KAAe,EAAA,IAAM,CAAC,WAAA,CAAY,IAAA,CAAK,UAAU,CAAA,EAAG,UAAA,CAAW,IAAA,CAAK,sBAAA,GAAyB,UAAU,CAAA;AACvI,IAAA,MAAM,cAAe,CAAA,CAA+B,SAAA;AACpD,IAAA,IAAI,gBAAgB,MAAA,EAAW;AAC7B,MAAA,IAAI,YAAY,MAAA,KAAW,QAAA,CAAS,MAAA,EAAQ,UAAA,CAAW,KAAK,0BAA0B,CAAA;AACtF,MAAA,KAAA,MAAW,EAAA,IAAM,WAAA,EAAa,IAAI,CAAC,WAAA,CAAY,IAAA,CAAK,EAAE,CAAA,EAAG,UAAA,CAAW,IAAA,CAAK,sBAAA,GAAyB,EAAE,CAAA;AAAA,IACtG;AACA,IAAA,MAAM,OAAA,GAAU,WAAW,MAAA,KAAW,CAAA;AACtC,IAAA,MAAM,MAAA,GACJ,CAAC,iBAAA,IACD,CAAC,6BACD,eAAA,CAAgB,MAAA,KAAW,CAAA,IAC3B,kBAAA,CAAmB,WAAW,CAAA,IAC9B,iBAAA,CAAkB,MAAA,KAAW,CAAA,IAC7B,yBACA,QAAA,IACA,OAAA;AACF,IAAA,OAAO;AAAA,MACL,WAAW,CAAA,CAAE,EAAA;AAAA,MACb,iBAAA;AAAA,MACA,cAAA;AAAA,MACA,yBAAA;AAAA,MACA,kBAAA,EAAoB,gBAAgB,MAAA,KAAW,CAAA;AAAA,MAC/C,eAAA;AAAA,MACA,sBAAA,EAAwB,mBAAmB,MAAA,KAAW,CAAA;AAAA,MACtD,kBAAA;AAAA,MACA,iBAAA,EAAmB,kBAAkB,MAAA,KAAW,CAAA;AAAA,MAChD,iBAAA;AAAA,MACA,qBAAA;AAAA,MACA,QAAA;AAAA,MACA,OAAA;AAAA,MACA,UAAA;AAAA,MACA;AAAA,KACF;AAAA,EACF,CAAC,CAAA;AACH;;;ACtHA,SAAS,OAAA,CAAQ,MAA0B,GAAA,EAAqB;AAC9D,EAAA,MAAM,CAAA,GAAA,CAAK,IAAA,IAAQ,EAAA,EAAI,IAAA,EAAK;AAC5B,EAAA,OAAO,CAAA,CAAE,SAAS,GAAA,GAAM,CAAA,CAAE,MAAM,CAAA,EAAG,GAAG,IAAI,KAAA,GAAQ,CAAA;AACpD;AAEA,eAAe,QAAA,CACb,MAAA,EACA,MAAA,EACA,IAAA,EACkC;AAClC,EAAA,MAAM,CAAA,GAAI,MAAM,MAAA,CAAO,IAAA;AAAA,IACrB,CAAC,EAAE,IAAA,EAAM,QAAA,EAAU,OAAA,EAAS,MAAA,EAAO,EAAG,EAAE,IAAA,EAAM,MAAA,EAAQ,OAAA,EAAS,IAAA,EAAM,CAAA;AAAA,IACrE,EAAE,WAAA,EAAa,GAAA,EAAK,SAAA,EAAW,QAAA,CAAS,QAAQ,GAAA,CAAI,aAAA,IAAiB,OAAA,EAAS,EAAE,CAAA;AAAE,GACpF;AACA,EAAA,OAAO,gBAAA,CAAiB,EAAE,OAAO,CAAA;AACnC;AAKA,IAAM,aAAA,GAAgB,CAAA;AACtB,SAAS,aAAA,CAAiB,OAAY,IAAA,EAAqB;AACzD,EAAA,MAAM,MAAa,EAAC;AACpB,EAAA,KAAA,IAAS,CAAA,GAAI,CAAA,EAAG,CAAA,GAAI,KAAA,CAAM,QAAQ,CAAA,IAAK,IAAA,EAAM,GAAA,CAAI,IAAA,CAAK,KAAA,CAAM,KAAA,CAAM,CAAA,EAAG,CAAA,GAAI,IAAI,CAAC,CAAA;AAC9E,EAAA,OAAO,GAAA;AACT;AAEA,IAAM,SAAA,GAAY,oDAAA;AAElB,eAAsB,+BAAA,CACpB,MAAA,EACA,QAAA,EACA,SAAA,EACA,QAAA,EAC+B;AAC/B,EAAA,MAAM,eAAuC,EAAC;AAC9C,EAAA,MAAM,eAAuC,EAAC;AAC9C,EAAA,MAAM,eAAyC,EAAC;AAEhD,EAAoB,SACjB,GAAA,CAAI,CAAC,MAAM,IAAA,GAAO,CAAA,CAAE,EAAA,GAAK,IAAA,GAAO,CAAA,CAAE,IAAA,IAAQ,EAAE,WAAA,GAAc,UAAA,GAAQ,QAAQ,CAAA,CAAE,WAAA,EAAa,GAAG,CAAA,GAAI,EAAA,CAAG,CAAA,CACnG,IAAA,CAAK,IAAI;AAGZ,EAAA,MAAM,SAAA,GAAY;AAAA,IAChB,iFAAA;AAAA,IACA,EAAA;AAAA,IACA,mGAAA;AAAA,IACA,8FAAA;AAAA,IACA,EAAA;AAAA,IACA,QAAA;AAAA,IACA,qFAAA;AAAA,IACA,sFAAA;AAAA,IACA,sFAAA;AAAA,IACA,uFAAA;AAAA,IACA,0FAAA;AAAA,IACA,sFAAA;AAAA,IACA,mEAAA;AAAA,IACA,4DAAA;AAAA,IACA,6FAAA;AAAA,IACA,qFAAA;AAAA,IACA,sCAAA;AAAA,IACA,EAAA;AAAA,IACA,6CAAA;AAAA,IACA,aAAA,CAAc,IAAI,CAAC,CAAA,KAAM,OAAO,CAAC,CAAA,CAAE,KAAK,IAAI,CAAA;AAAA,IAC5C,EAAA;AAAA,IACA;AAAA,GACF,CAAE,KAAK,IAAI,CAAA;AASX,EAAA,KAAA,MAAW,KAAA,IAAS,aAAA,CAAc,QAAA,EAAU,aAAa,CAAA,EAAG;AAC1D,IAAA,MAAM,SAAA,GAAY,MACf,GAAA,CAAI,CAAC,MAAM,IAAA,GAAO,CAAA,CAAE,EAAA,GAAK,IAAA,GAAO,CAAA,CAAE,IAAA,GAAO,OAAO,CAAA,CAAE,WAAA,GAAc,IAAA,GAAO,OAAA,CAAQ,CAAA,CAAE,WAAA,EAAa,GAAG,CAAA,GAAI,EAAA,CAAG,CAAA,CACxG,IAAA,CAAK,IAAI,CAAA;AACZ,IAAA,MAAM,SAAA,GAAY,gBAAgB,SAAA,GAAY,8DAAA;AAC9C,IAAA,MAAM,MAAA,GAAS,MAAM,QAAA,CAAS,MAAA,EAAQ,WAAW,SAAS,CAAA;AAC1D,IAAA,KAAA,MAAW,CAAA,IAAM,MAAA,CAAO,IAAA,IAAQ,EAAC,EAAoD;AACnF,MAAA,IAAI,CAAA,CAAE,UAAA,IAAc,CAAA,CAAE,GAAA,EAAK,YAAA,CAAa,EAAE,UAAU,CAAA,GAAI,iBAAA,CAAkB,CAAA,CAAE,GAAG,CAAA;AAAA,IACjF;AAAA,EACF;AACA,EAAA,KAAA,MAAW,KAAK,QAAA,EAAU;AACxB,IAAA,IAAI,CAAC,YAAA,CAAa,CAAA,CAAE,EAAE,CAAA,EAAG;AACvB,MAAA,QAAA,CAAS,IAAA,CAAK,gCAAA,GAAmC,CAAA,CAAE,EAAA,GAAK,sCAAiC,CAAA;AACzF,MAAA,YAAA,CAAa,CAAA,CAAE,EAAE,CAAA,GAAI,EAAA;AAAA,IACvB;AAAA,EACF;AAGA,EAAmB,QAAA,CAChB,GAAA,CAAI,CAAC,CAAA,KAAM,IAAA,GAAO,EAAE,EAAA,GAAK,IAAA,GAAO,CAAA,CAAE,IAAA,GAAO,QAAQ,YAAA,CAAa,CAAA,CAAE,EAAE,CAAC,CAAA,CACnE,KAAK,IAAI;AACZ,EAAA,MAAM,SAAA,GAAY;AAAA,IAChB,0FAAA;AAAA,IACA,EAAA;AAAA,IACA,wFAAA;AAAA,IACA,wDAAA;AAAA,IACA,EAAA;AAAA,IACA,QAAA;AAAA,IACA,sFAAA;AAAA,IACA,kDAAA;AAAA,IACA,oFAAA;AAAA,IACA,oFAAA;AAAA,IACA,iEAAA;AAAA,IACA,qFAAA;AAAA,IACA,+BAAA;AAAA,IACA,iEAAA;AAAA,IACA,6FAAA;AAAA,IACA,iDAAA;AAAA,IACA,EAAA;AAAA,IACA,6CAAA;AAAA,IACA,aAAA,CAAc,IAAI,CAAC,CAAA,KAAM,OAAO,CAAC,CAAA,CAAE,KAAK,IAAI,CAAA;AAAA,IAC5C,EAAA;AAAA,IACA;AAAA,GACF,CAAE,KAAK,IAAI,CAAA;AAQX,EAAA,KAAA,MAAW,KAAA,IAAS,aAAA,CAAc,QAAA,EAAU,aAAa,CAAA,EAAG;AAC1D,IAAiB,IAAI,GAAA,CAAI,KAAA,CAAM,IAAI,CAAC,CAAA,KAAM,CAAA,CAAE,EAAE,CAAC;AAC/C,IAAA,MAAM,kBAAkB,KAAA,CACrB,GAAA,CAAI,CAAC,CAAA,KAAM,IAAA,GAAO,EAAE,EAAA,GAAK,IAAA,GAAO,EAAE,IAAA,GAAO,KAAA,IAAS,aAAa,CAAA,CAAE,EAAE,KAAK,WAAA,CAAY,CAAA,CACpF,KAAK,IAAI,CAAA;AACZ,IAAA,MAAM,YAAA,GAAe,qBAAqB,eAAA,GAAkB,8DAAA;AAC5D,IAAA,MAAM,MAAA,GAAS,MAAM,QAAA,CAAS,MAAA,EAAQ,WAAW,YAAY,CAAA;AAC7D,IAAA,KAAA,MAAW,CAAA,IAAM,MAAA,CAAO,IAAA,IAAQ,EAAC,EAAoD;AACnF,MAAA,IAAI,CAAA,CAAE,UAAA,IAAc,CAAA,CAAE,GAAA,EAAK,YAAA,CAAa,EAAE,UAAU,CAAA,GAAI,iBAAA,CAAkB,CAAA,CAAE,GAAG,CAAA;AAAA,IACjF;AAAA,EACF;AACA,EAAA,KAAA,MAAW,KAAK,QAAA,EAAU;AACxB,IAAA,IAAI,CAAC,YAAA,CAAa,CAAA,CAAE,EAAE,CAAA,EAAG;AACvB,MAAA,QAAA,CAAS,IAAA,CAAK,gCAAA,GAAmC,CAAA,CAAE,EAAA,GAAK,sCAAiC,CAAA;AACzF,MAAA,YAAA,CAAa,CAAA,CAAE,EAAE,CAAA,GAAI,EAAA;AAAA,IACvB;AAAA,EACF;AAGA,EAAmB,SAChB,GAAA,CAAI,CAAC,MAAM,IAAA,GAAO,CAAA,CAAE,EAAA,GAAK,IAAA,GAAO,CAAA,CAAE,IAAA,GAAO,YAAY,YAAA,CAAa,CAAA,CAAE,EAAE,CAAA,GAAI,SAAA,GAAY,YAAA,CAAa,EAAE,EAAE,CAAC,CAAA,CACxG,IAAA,CAAK,IAAI;AACZ,EAAA,MAAM,SAAA,GAAY;AAAA,IAChB,qFAAA;AAAA,IACA,EAAA;AAAA,IACA,uFAAA;AAAA,IACA,mEAAA;AAAA,IACA,EAAA;AAAA,IACA,QAAA;AAAA,IACA,mFAAA;AAAA,IACA,wEAAA;AAAA,IACA,uFAAA;AAAA,IACA,gFAAA;AAAA,IACA,sFAAA;AAAA,IACA,wFAAA;AAAA,IACA,wFAAA;AAAA,IACA,qFAAA;AAAA,IACA,yFAAA;AAAA,IACA,0FAAA;AAAA,IACA,uFAAA;AAAA,IACA,sFAAA;AAAA,IACA,2FAAA;AAAA,IACA,oFAAA;AAAA,IACA,oFAAA;AAAA,IACA,wFAAA;AAAA,IACA,yFAAA;AAAA,IACA,4EAAA;AAAA,IACA,6FAAA;AAAA,IACA,0CAAA;AAAA,IACA,EAAA;AAAA,IACA,6CAAA;AAAA,IACA,aAAA,CAAc,IAAI,CAAC,CAAA,KAAM,OAAO,CAAC,CAAA,CAAE,KAAK,IAAI,CAAA;AAAA,IAC5C,EAAA;AAAA,IACA;AAAA,GACF,CAAE,KAAK,IAAI,CAAA;AACX,EAAkB,QAAA,CACf,GAAA,CAAI,CAAC,CAAA,KAAM,IAAA,GAAO,CAAA,CAAE,EAAA,GAAK,IAAA,GAAO,CAAA,CAAE,IAAA,GAAO,KAAA,IAAA,CAAU,CAAA,CAAE,QAAA,IAAY,EAAC,EAAG,KAAA,CAAM,CAAA,EAAG,EAAE,CAAA,CAAE,IAAA,CAAK,IAAI,CAAA,IAAK,iDAAA,GAA+C,SAAA,GAAY,GAAA,CAAI,CAAA,CAC/J,IAAA,CAAK,IAAI;AACV,EAAA,KAAA,MAAW,KAAA,IAAS,aAAA,CAAc,QAAA,EAAU,aAAa,CAAA,EAAG;AAC5D,IAAA,MAAM,OAAA,GAAU,KAAA,CACb,GAAA,CAAI,CAAC,CAAA,KAAM,IAAA,GAAO,CAAA,CAAE,EAAA,GAAK,IAAA,GAAO,CAAA,CAAE,IAAA,GAAO,KAAA,IAAA,CAAU,CAAA,CAAE,QAAA,IAAY,EAAC,EAAG,KAAA,CAAM,CAAA,EAAG,EAAE,CAAA,CAAE,IAAA,CAAK,IAAI,CAAA,IAAK,iDAAA,GAA+C,SAAA,GAAY,GAAA,CAAI,CAAA,CAC/J,IAAA,CAAK,IAAI,CAAA;AACZ,IAAA,MAAM,WAAA,GAAc,KAAA,CACjB,GAAA,CAAI,CAAC,CAAA,KAAM,OAAO,CAAA,CAAE,EAAA,GAAK,IAAA,GAAO,CAAA,CAAE,IAAA,GAAO,SAAA,IAAa,aAAa,CAAA,CAAE,EAAE,CAAA,IAAK,WAAA,CAAA,GAAe,SAAA,IAAa,YAAA,CAAa,CAAA,CAAE,EAAE,CAAA,IAAK,WAAA,CAAY,CAAA,CAC1I,IAAA,CAAK,IAAI,CAAA;AACZ,IAAA,MAAM,YAAA,GAAe;AAAA,MACnB,qBAAA,GAAwB,SAAA;AAAA,MACxB,EAAA;AAAA,MACA,uFAAA;AAAA,MACA,OAAA;AAAA,MACA,EAAA;AAAA,MACA,yBAAA;AAAA,MACA,WAAA;AAAA,MACA,EAAA;AAAA,MACA,cAAA;AAAA,MACA;AAAA,KACF,CAAE,KAAK,IAAI,CAAA;AACX,IAAA,MAAM,MAAA,GAAS,MAAM,QAAA,CAAS,MAAA,EAAQ,WAAW,YAAY,CAAA;AAC7D,IAAA,KAAA,MAAW,CAAA,IAAM,MAAA,CAAO,IAAA,IAAQ,EAAC,EAAsD;AACrF,MAAA,IAAI,CAAA,CAAE,cAAc,KAAA,CAAM,OAAA,CAAQ,EAAE,GAAG,CAAA,eAAgB,CAAA,CAAE,UAAU,IAAI,CAAA,CAAE,GAAA,CAAI,IAAI,CAAC,IAAA,KAAS,kBAAkB,MAAA,CAAO,IAAI,CAAC,CAAC,CAAA;AAAA,IAC5H;AAAA,EACF;AACA,EAAA,KAAA,MAAW,KAAK,QAAA,EAAU;AACxB,IAAA,IAAI,CAAC,YAAA,CAAa,CAAA,CAAE,EAAE,CAAA,IAAK,aAAa,CAAA,CAAE,EAAE,CAAA,CAAE,MAAA,KAAW,CAAA,EAAG;AAC1D,MAAA,QAAA,CAAS,IAAA,CAAK,gCAAA,GAAmC,CAAA,CAAE,EAAA,GAAK,sCAAiC,CAAA;AACzF,MAAA,YAAA,CAAa,CAAA,CAAE,EAAE,CAAA,GAAI,EAAC;AAAA,IACxB;AAAA,EACF;AAGA,EAAmB,QAAA,CAAS,GAAA,CAAI,CAAC,CAAA,KAAM,EAAE,EAAE;AAC3C,EAAA,MAAM,YAAY,MAChB,gBAAA,CAAiB,QAAA,CAAS,GAAA,CAAI,CAAC,CAAA,MAAO;AAAA,IACpC,IAAI,CAAA,CAAE,EAAA;AAAA,IACN,MAAM,CAAA,CAAE,IAAA;AAAA,IACR,QAAA,EAAU,CAAA,CAAE,QAAA,IAAY,EAAC;AAAA,IACzB,GAAA,EAAK,YAAA,CAAa,CAAA,CAAE,EAAE,CAAA;AAAA,IACtB,GAAA,EAAK,YAAA,CAAa,CAAA,CAAE,EAAE,CAAA;AAAA,IACtB,GAAA,EAAK,YAAA,CAAa,CAAA,CAAE,EAAE;AAAA,IACtB,CAAC,CAAA;AACL,EAAA,IAAI,SAAS,SAAA,EAAU;AACvB,EAAA,MAAM,WAAA,GAAc,OAAO,KAAA,KAAoC;AAC7D,IAAA,MAAM,aAAa,MAAA,CAAO,MAAA,CAAO,CAAC,CAAA,KAAM,CAAC,EAAE,MAAM,CAAA;AACjD,IAAA,IAAI,UAAA,CAAW,MAAA,KAAW,CAAA,EAAG,OAAO,KAAA;AACpC,IAAA,IAAI,KAAA,GAAQ,GAAG,QAAA,CAAS,IAAA,CAAK,8BAA8B,KAAA,GAAQ,IAAA,GAAO,UAAA,CAAW,MAAA,GAAS,2BAA2B,CAAA;AACzH,IAAA,MAAM,OAAA,GAAU,UAAA;AAChB,IAAA;AACA,MAAA,QAAA,CAAS,KAAK,eAAA,GAAkB,OAAA,CAAQ,SAAS,GAAA,GAAM,QAAA,CAAS,SAAS,qDAAgD,CAAA;AACzH,MAAA,MAAM,aAAA,GAAgB,OAAA,CAAQ,GAAA,CAAI,CAAC,CAAA,KAAM;AACvC,QAAA,MAAM,CAAA,GAAI,SAAS,IAAA,CAAK,CAAC,MAAM,CAAA,CAAE,EAAA,KAAO,EAAE,SAAS,CAAA;AACnD,QAAA,MAAM,SAAmB,EAAC;AAC1B,QAAA,IAAI,CAAA,CAAE,iBAAA,EAAmB,MAAA,CAAO,IAAA,CAAK,yCAAA,GAA4C,EAAE,cAAA,CAAe,IAAA,CAAK,IAAI,CAAA,GAAI,GAAG,CAAA;AAClH,QAAA,IAAI,CAAA,CAAE,yBAAA,EAA2B,MAAA,CAAO,IAAA,CAAK,sEAAsE,CAAA;AACnH,QAAA,KAAA,MAAW,IAAA,IAAQ,EAAE,eAAA,EAAiB,MAAA,CAAO,KAAK,yBAAA,GAA4B,OAAA,CAAQ,IAAA,EAAM,GAAG,CAAC,CAAA;AAChG,QAAA,KAAA,MAAW,QAAQ,CAAA,CAAE,kBAAA,EAAoB,MAAA,CAAO,IAAA,CAAK,6DAA6D,CAAA,EAAG,QAAA,IAAY,EAAC,EAAG,KAAK,IAAI,CAAA,GAAI,QAAQ,OAAA,CAAQ,IAAA,EAAM,GAAG,CAAC,CAAA;AAC5K,QAAA,KAAA,MAAW,IAAA,IAAQ,EAAE,iBAAA,EAAmB,MAAA,CAAO,KAAK,8BAAA,GAAiC,OAAA,CAAQ,IAAA,EAAM,GAAG,CAAC,CAAA;AACvG,QAAA,IAAI,CAAC,CAAA,CAAE,qBAAA,EAAuB,MAAA,CAAO,KAAK,6EAAwE,CAAA;AAClH,QAAA,OAAO;AAAA,UACL,YAAY,CAAA,CAAE,SAAA;AAAA,UACd,IAAA,EAAM,CAAA,EAAG,IAAA,IAAQ,CAAA,CAAE,SAAA;AAAA,UACnB,QAAA,EAAU,CAAA,EAAG,QAAA,IAAY,EAAC;AAAA,UAC1B,SAAS,EAAE,GAAA,EAAK,YAAA,CAAa,CAAA,CAAE,SAAS,CAAA,EAAG,GAAA,EAAK,YAAA,CAAa,CAAA,CAAE,SAAS,CAAA,EAAG,GAAA,EAAK,YAAA,CAAa,CAAA,CAAE,SAAS,CAAA,EAAE;AAAA,UAC1G;AAAA,SACF;AAAA,MACF,CAAC,CAAA;AACD,MAAA,MAAM,YAAA,GAAe;AAAA,QACnB,wFAAA;AAAA,QACA,0FAAA;AAAA,QACA,WAAA;AAAA,QACA,iFAAA;AAAA,QACA,6FAAA;AAAA,QACA,qFAAqF,SAAA,GAAY,GAAA;AAAA,QACjG,qJAAA;AAAA,QACA,2eAAA;AAAA,QACA,EAAA;AAAA,QACA;AAAA,OACF,CAAE,KAAK,IAAI,CAAA;AACX,MAAA,MAAM,UAAA,GAAa;AAAA,QACjB,mBAAA;AAAA,QACA,IAAA,CAAK,SAAA,CAAU,aAAA,EAAe,IAAA,EAAM,CAAC,CAAA;AAAA,QACrC,EAAA;AAAA,QACA,iFAAA;AAAA,QACA;AAAA,OACF,CAAE,KAAK,IAAI,CAAA;AACX,MAAA,IAAI;AACF,QAAA,MAAM,SAAA,GAAY,MAAM,QAAA,CAAS,MAAA,EAAQ,cAAc,UAAU,CAAA;AACjE,QAAA,KAAA,MAAW,CAAA,IAAM,SAAA,CAAU,OAAA,IAAW,EAAC,EAAkF;AACvH,UAAA,IAAI,CAAC,EAAE,UAAA,EAAY;AACnB,UAAA,IAAI,CAAA,CAAE,KAAK,YAAA,CAAa,CAAA,CAAE,UAAU,CAAA,GAAI,iBAAA,CAAkB,EAAE,GAAG,CAAA;AAC/D,UAAA,IAAI,CAAA,CAAE,KAAK,YAAA,CAAa,CAAA,CAAE,UAAU,CAAA,GAAI,iBAAA,CAAkB,EAAE,GAAG,CAAA;AAC/D,UAAA,IAAI,KAAA,CAAM,QAAQ,CAAA,CAAE,GAAG,KAAK,CAAA,CAAE,GAAA,CAAI,MAAA,GAAS,CAAA,EAAG,YAAA,CAAa,CAAA,CAAE,UAAU,CAAA,GAAI,CAAA,CAAE,IAAI,GAAA,CAAI,CAAC,MAAM,iBAAA,CAAkB,MAAA,CAAO,CAAC,CAAC,CAAC,CAAA;AAAA,QAC1H;AACA,QAAA,MAAA,GAAS,SAAA,EAAU;AAAA,MACrB,SAAS,GAAA,EAAK;AACZ,QAAA,QAAA,CAAS,IAAA,CAAK,iCAAiC,GAAA,YAAe,KAAA,GAAQ,IAAI,OAAA,GAAU,MAAA,CAAO,GAAG,CAAA,CAAE,CAAA;AAAA,MAClG;AAAA,IACA;AACA,IAAA,OAAO,MAAA,CAAO,KAAA,CAAM,CAAC,CAAA,KAAM,EAAE,MAAM,CAAA;AAAA,EACrC,CAAA;AACA,EAAA,KAAA,IAAS,KAAA,GAAQ,CAAA,EAAG,KAAA,IAAS,CAAA,EAAG,KAAA,EAAA,EAAS;AACvC,IAAA,MAAM,OAAA,GAAU,MAAM,WAAA,CAAY,KAAK,CAAA;AACvC,IAAA,IAAI,OAAA,EAAS;AAAA,EACf;AAEA,EAAA,MAAM,eAAe,MAAA,CAAO,MAAA,CAAO,CAAC,CAAA,KAAM,CAAC,EAAE,MAAM,CAAA;AACnD,EAAA,IAAI,YAAA,CAAa,SAAS,CAAA,EAAG;AAE3B,IAAA,IAAI;AACF,MAAA,MAAM,EAAE,WAAAA,UAAAA,EAAW,aAAA,EAAAC,gBAAc,GAAI,MAAM,OAAO,IAAS,CAAA;AAC3D,MAAA,MAAM,WAAW,MAAM,OAAO,IAAS,CAAA,EAAG,QAAO,GAAI,oBAAA;AACrD,MAAAD,UAAAA,CAAU,OAAA,EAAS,EAAE,SAAA,EAAW,MAAM,CAAA;AACtC,MAAAC,cAAAA,CAAc,OAAA,GAAU,wBAAA,EAA0B,IAAA,CAAK,SAAA;AAAA,QACrD,YAAA,CAAa,IAAI,CAAC,CAAA,MAAO,EAAE,KAAA,EAAO,CAAA,EAAG,GAAA,EAAK,YAAA,CAAa,CAAA,CAAE,SAAS,GAAG,GAAA,EAAK,YAAA,CAAa,EAAE,SAAS,CAAA,EAAG,KAAK,YAAA,CAAa,CAAA,CAAE,SAAS,CAAA,EAAE,CAAE,CAAA;AAAA,QAAG,IAAA;AAAA,QAAM;AAAA,OAAE,CAAA;AAAA,IACrJ,CAAA,CAAA,MAAQ;AAAA,IAA4B;AACpC,IAAA,MAAM,MAAA,GAAS,YAAA,CAAa,GAAA,CAAI,CAAC,CAAA,KAAM,CAAA,CAAE,SAAA,GAAY,GAAA,IAAO,CAAA,CAAE,iBAAA,GAAoB,WAAA,GAAc,EAAA,CAAA,IAAO,CAAA,CAAE,yBAAA,GAA4B,WAAA,GAAc,EAAA,CAAA,IAAO,CAAA,CAAE,eAAA,CAAgB,MAAA,GAAS,cAAA,GAAiB,EAAA,CAAA,IAAO,CAAA,CAAE,iBAAA,CAAkB,MAAA,GAAS,gBAAA,GAAmB,EAAA,CAAA,GAAM,GAAG,CAAA,CAAE,KAAK,IAAI,CAAA;AACjR,IAAA,MAAM,IAAI,KAAA;AAAA,MACR,yDAAyD,MAAA,GACzD;AAAA,KACF;AAAA,EACF;AAEA,EAAA,OAAO,EAAE,YAAA,EAAc,YAAA,EAAc,YAAA,EAAc,QAAQ,QAAA,EAAS;AACtE;AC1TA,SAAS,KAAK,CAAA,EAAiC;AAC7C,EAAA,OAAA,CAAQ,CAAA,IAAK,EAAA,EAAI,KAAA,CAAM,GAAG,CAAA,CAAE,GAAA,CAAI,CAAC,CAAA,KAAM,CAAA,CAAE,IAAA,EAAM,CAAA,CAAE,OAAO,OAAO,CAAA;AACjE;AAEO,SAAS,yBAAyB,OAAA,EAA8B;AACrE,EAAA,MAAM,IAAA,GAAO,YAAA,CAAa,OAAA,EAAS,MAAM,CAAA;AACzC,EAAA,MAAM,KAAA,GAAQ,IAAA,CAAK,KAAA,CAAM,IAAI,CAAA,CAAE,MAAA,CAAO,CAAC,CAAA,KAAM,CAAA,CAAE,IAAA,EAAK,CAAE,MAAA,GAAS,CAAC,CAAA;AAChE,EAAA,IAAI,MAAM,MAAA,KAAW,CAAA,QAAS,IAAI,KAAA,CAAM,kCAAkC,OAAO,CAAA;AACjF,EAAA,MAAM,MAAA,GAAS,KAAA,CAAM,CAAC,CAAA,CAAE,KAAA,CAAM,GAAI,CAAA,CAAE,GAAA,CAAI,CAAC,CAAA,KAAM,CAAA,CAAE,IAAA,EAAM,CAAA;AACvD,EAAA,MAAM,GAAA,GAAM,CAAC,IAAA,KAAyB,MAAA,CAAO,QAAQ,IAAI,CAAA;AACzD,EAAA,MAAM,EAAA,GAAK,IAAI,WAAW,CAAA;AAC1B,EAAA,MAAM,EAAA,GAAK,IAAI,MAAM,CAAA;AACrB,EAAA,MAAM,EAAA,GAAK,IAAI,MAAM,CAAA;AACrB,EAAA,MAAM,EAAA,GAAK,IAAI,aAAa,CAAA;AAC5B,EAAA,MAAM,IAAA,GAAO,IAAI,gBAAgB,CAAA;AACjC,EAAA,MAAM,IAAA,GAAO,IAAI,aAAa,CAAA;AAC9B,EAAA,MAAM,IAAA,GAAO,IAAI,4BAA4B,CAAA;AAC7C,EAAA,MAAM,GAAA,GAAM,IAAI,UAAU,CAAA;AAC1B,EAAA,KAAA,MAAW,CAAC,IAAA,EAAM,GAAG,CAAA,IAAK,CAAC,CAAC,WAAA,EAAa,EAAE,CAAA,EAAG,CAAC,QAAQ,EAAE,CAAA,EAAG,CAAC,MAAA,EAAQ,EAAE,CAAC,CAAA,EAAY;AAClF,IAAA,IAAI,MAAM,CAAA,EAAG,MAAM,IAAI,KAAA,CAAM,wCAAwC,IAAI,CAAA;AAAA,EAC3E;AACA,EAAA,MAAM,UAAA,uBAAiB,GAAA,EAAoB;AAC3C,EAAA,MAAM,MAAA,uBAAa,GAAA,EAAuD;AAC1E,EAAA,MAAM,WAA0B,EAAC;AACjC,EAAA,KAAA,MAAW,IAAA,IAAQ,KAAA,CAAM,KAAA,CAAM,CAAC,CAAA,EAAG;AACjC,IAAA,MAAM,CAAA,GAAI,IAAA,CAAK,KAAA,CAAM,GAAI,CAAA;AACzB,IAAA,MAAM,IAAA,GAAA,CAAQ,CAAA,CAAE,EAAE,CAAA,IAAK,IAAI,IAAA,EAAK;AAChC,IAAA,MAAM,IAAA,GAAA,CAAQ,CAAA,CAAE,EAAE,CAAA,IAAK,IAAI,IAAA,EAAK;AAChC,IAAA,MAAM,IAAA,GAAA,CAAQ,CAAA,CAAE,EAAE,CAAA,IAAK,IAAI,IAAA,EAAK;AAChC,IAAA,IAAI,CAAC,IAAA,IAAQ,CAAC,IAAA,EAAM;AACpB,IAAA,IAAI,IAAA,KAAS,UAAA,EAAY,UAAA,CAAW,GAAA,CAAI,MAAM,IAAI,CAAA;AAClD,IAAA,IAAI,IAAA,KAAS,OAAA,EAAS,MAAA,CAAO,GAAA,CAAI,IAAA,EAAM,EAAE,IAAA,EAAM,aAAA,EAAe,IAAA,CAAK,CAAA,CAAE,IAAI,CAAC,GAAG,CAAA;AAC7E,IAAA,IAAI,SAAS,SAAA,EAAW;AACxB,IAAA,MAAM,UAAA,GAAa,IAAA,CAAK,CAAA,CAAE,IAAI,CAAC,CAAA;AAE/B,IAAA,MAAM,aAAA,uBAAoB,GAAA,EAAY;AACtC,IAAA,KAAA,MAAW,CAAA,IAAK,UAAA,EAAY,KAAA,MAAW,EAAA,IAAM,MAAA,CAAO,GAAA,CAAI,CAAC,CAAA,EAAG,aAAA,IAAiB,EAAC,EAAG,aAAA,CAAc,IAAI,EAAE,CAAA;AACrG,IAAA,QAAA,CAAS,IAAA,CAAK;AAAA,MACZ,IAAA;AAAA,MACA,IAAA;AAAA,MACA,WAAA,EAAA,CAAc,CAAA,CAAE,EAAE,CAAA,IAAK,IAAI,IAAA,EAAK;AAAA,MAChC,QAAA,EAAU,IAAA,CAAK,CAAA,CAAE,GAAG,CAAC,CAAA;AAAA,MACrB,UAAA;AAAA,MACA,aAAA,EAAe,CAAC,GAAG,aAAa,CAAA;AAAA,MAChC,iBAAA,EAAmB,IAAA,CAAK,CAAA,CAAE,IAAI,CAAC;AAAA,KAChC,CAAA;AAAA,EACH;AACA,EAAA,IAAI,SAAS,MAAA,KAAW,CAAA,QAAS,IAAI,KAAA,CAAM,6CAA6C,OAAO,CAAA;AAC/F,EAAA,OAAO,EAAE,IAAA,EAAM,OAAA,EAAS,QAAA,EAAU,YAAY,MAAA,EAAO;AACvD;AAEA,SAAS,OAAO,CAAA,EAAwB;AACtC,EAAA,OAAO,IAAI,GAAA;AAAA,IACT,CAAA,CAAE,WAAA,EAAY,CAAE,OAAA,CAAQ,iBAAiB,GAAG,CAAA,CAAE,KAAA,CAAM,KAAK,EAAE,MAAA,CAAO,CAAC,CAAA,KAAM,CAAA,CAAE,UAAU,CAAC;AAAA,GACxF;AACF;AAQO,SAAS,kBACd,OAAA,EACA,kBAAA,EACA,cAAA,EACA,gBAAA,EACA,cAAc,GAAA,EACC;AACf,EAAA,MAAM,GAAA,GAAM,IAAI,GAAA,CAAI,cAAA,CAAe,IAAI,CAAC,CAAA,KAAM,CAAA,CAAE,IAAA,GAAO,WAAA,EAAa,CAAA,CAAE,MAAA,CAAO,OAAO,CAAC,CAAA;AACrF,EAAA,MAAM,IAAA,GAAO,IAAI,GAAA,CAAI,kBAAA,CAAmB,IAAI,CAAC,CAAA,KAAM,CAAA,CAAE,IAAA,GAAO,WAAA,EAAa,CAAA,CAAE,MAAA,CAAO,OAAO,CAAC,CAAA;AAC1F,EAAA,MAAM,KAAA,GAAQ,gBAAA,CAAiB,GAAA,CAAI,CAAC,MAAM,MAAA,CAAO,CAAA,CAAE,IAAA,GAAO,GAAA,GAAM,CAAA,CAAE,QAAA,CAAS,IAAA,CAAK,GAAG,CAAC,CAAC,CAAA;AACrF,EAAA,MAAM,QAAA,uBAAe,GAAA,EAAY;AACjC,EAAA,KAAA,MAAW,KAAK,KAAA,EAAO,KAAA,MAAW,KAAK,CAAA,EAAG,QAAA,CAAS,IAAI,CAAC,CAAA;AACxD,EAAA,MAAM,WAAA,GAAc,CAAC,EAAA,KACnB,EAAA,CAAG,WAAW,IAAA,CAAK,CAAC,MAAM,GAAA,CAAI,GAAA,CAAI,CAAC,CAAC,CAAA,IAAK,GAAG,aAAA,CAAc,IAAA,CAAK,CAAC,CAAA,KAAM,IAAA,CAAK,GAAA,CAAI,CAAC,CAAC,CAAA;AACnF,EAAA,MAAM,YAAA,GAAe,CAAC,EAAA,KAA4B;AAChD,IAAA,MAAM,QAAQ,MAAA,CAAO,EAAA,CAAG,IAAA,GAAO,GAAA,GAAM,GAAG,WAAA,CAAY,KAAA,CAAM,CAAA,EAAG,GAAG,IAAI,GAAA,GAAM,EAAA,CAAG,QAAA,CAAS,IAAA,CAAK,GAAG,CAAC,CAAA;AAC/F,IAAA,IAAI,OAAA,GAAU,CAAA;AACd,IAAA,KAAA,MAAW,KAAK,KAAA,EAAO,IAAI,QAAA,CAAS,GAAA,CAAI,CAAC,CAAA,EAAG,OAAA,EAAA;AAC5C,IAAA,MAAM,QAAA,GAAW,EAAA,CAAG,QAAA,CAAS,MAAA,CAAO,CAAC,CAAA,KAAM;AACzC,MAAA,MAAM,EAAA,GAAK,EAAE,WAAA,EAAY;AACzB,MAAA,OAAO,CAAC,GAAG,QAAQ,CAAA,CAAE,KAAK,CAAC,CAAA,KAAM,CAAA,KAAM,EAAA,IAAO,EAAE,MAAA,IAAU,CAAA,IAAK,EAAA,CAAG,QAAA,CAAS,CAAC,CAAE,CAAA;AAAA,IAChF,CAAC,CAAA,CAAE,MAAA;AACH,IAAA,OAAO,OAAA,GAAU,IAAI,QAAA,GAAW,CAAA;AAAA,EAClC,CAAA;AACA,EAAA,MAAM,IAAA,GAAO,OAAA,CAAQ,QAAA,CAAS,MAAA,CAAO,CAAC,EAAA,KAAO,WAAA,CAAY,EAAE,CAAA,IAAK,YAAA,CAAa,EAAE,CAAA,IAAK,CAAC,CAAA;AACrF,EAAA,OAAO,IAAA,CACJ,GAAA,CAAI,CAAC,EAAA,MAAQ,EAAE,EAAA,EAAI,CAAA,EAAG,YAAA,CAAa,EAAE,CAAA,EAAE,CAAE,CAAA,CACzC,IAAA,CAAK,CAAC,CAAA,EAAG,CAAA,KAAM,CAAA,CAAE,CAAA,GAAI,CAAA,CAAE,CAAC,CAAA,CACxB,KAAA,CAAM,CAAA,EAAG,WAAW,CAAA,CACpB,GAAA,CAAI,CAAC,CAAA,KAAM,EAAE,EAAE,CAAA;AACpB;AAGO,SAAS,gBAAgB,SAAA,EAAkC;AAChE,EAAA,OAAO,SAAA,CACJ,GAAA,CAAI,CAAC,EAAA,KAAO,OAAO,EAAA,CAAG,IAAA,GAAO,KAAA,GAAQ,EAAA,CAAG,IAAA,GAAO,SAAA,GAAY,EAAA,CAAG,QAAA,CAAS,MAAM,CAAA,EAAG,CAAC,CAAA,CAAE,IAAA,CAAK,IAAI,CAAA,IAC1F,EAAA,CAAG,iBAAA,CAAkB,SAAS,cAAA,GAAiB,EAAA,CAAG,iBAAA,CAAkB,IAAA,CAAK,GAAG,CAAA,GAAI,EAAA,CAAG,CAAA,CACrF,KAAK,IAAI,CAAA;AACd;AAGO,SAAS,yBAAyB,OAAA,EAA8B;AACrE,EAAA,MAAM,eAAA,uBAAsB,GAAA,EAAoB;AAChD,EAAA,KAAA,MAAW,EAAA,IAAM,OAAA,CAAQ,QAAA,EAAU,KAAA,MAAW,KAAK,EAAA,CAAG,UAAA,EAAY,eAAA,CAAgB,GAAA,CAAI,IAAI,eAAA,CAAgB,GAAA,CAAI,CAAC,CAAA,IAAK,KAAK,CAAC,CAAA;AAC1H,EAAA,MAAM,KAAA,uBAAY,GAAA,EAAsB;AACxC,EAAA,KAAA,MAAW,CAAC,IAAA,EAAM,IAAI,CAAA,IAAK,QAAQ,MAAA,EAAQ;AACzC,IAAA,KAAA,MAAW,GAAA,IAAO,KAAK,aAAA,EAAe;AACpC,MAAA,MAAM,GAAA,GAAM,KAAA,CAAM,GAAA,CAAI,GAAG,KAAK,EAAC;AAC/B,MAAA,GAAA,CAAI,IAAA,CAAK,IAAA,GAAO,GAAA,GAAM,IAAA,CAAK,IAAA,GAAO,IAAA,IAAQ,eAAA,CAAgB,GAAA,CAAI,IAAI,CAAA,IAAK,CAAA,CAAA,GAAK,YAAY,CAAA;AACxF,MAAA,KAAA,CAAM,GAAA,CAAI,KAAK,GAAG,CAAA;AAAA,IACpB;AAAA,EACF;AACA,EAAA,MAAM,MAAgB,EAAC;AACvB,EAAA,KAAA,MAAW,CAAC,IAAA,EAAM,IAAI,CAAA,IAAK,QAAQ,UAAA,EAAY;AAC7C,IAAA,GAAA,CAAI,IAAA,CAAK,WAAA,GAAc,IAAA,GAAO,UAAA,GAAQ,IAAI,CAAA;AAC1C,IAAA,KAAA,MAAW,CAAA,IAAK,KAAA,CAAM,GAAA,CAAI,IAAI,CAAA,IAAK,EAAC,EAAG,GAAA,CAAI,IAAA,CAAK,aAAA,GAAgB,CAAC,CAAA;AAAA,EACnE;AACA,EAAA,OAAO,GAAA,CAAI,KAAK,IAAI,CAAA;AACtB;ACnGA,IAAMC,UAAAA,GACJ,+DAAA;AAEF,SAAS,eAAe,IAAA,EAAuB;AAC7C,EAAA,MAAM,KAAA,GAAQ,IAAA,CAAK,OAAA,CAAQ,GAAG,CAAA;AAC9B,EAAA,MAAM,GAAA,GAAM,IAAA,CAAK,WAAA,CAAY,GAAG,CAAA;AAChC,EAAA,IAAI,QAAQ,CAAA,IAAK,GAAA,IAAO,OAAO,MAAM,IAAI,MAAM,iDAAiD,CAAA;AAChG,EAAA,OAAO,KAAK,KAAA,CAAM,IAAA,CAAK,MAAM,KAAA,EAAO,GAAA,GAAM,CAAC,CAAC,CAAA;AAC9C;AAOA,eAAsB,oBAAoB,IAAA,EAOP;AACjC,EAAA,MAAM,EAAE,MAAA,EAAQ,OAAA,EAAS,SAAA,GAAY,QAAA,EAAU,eAAc,GAAI,IAAA;AACjE,EAAA,MAAM,GAAA,GAAM,IAAA,CAAK,UAAA,KAAe,MAAM;AAAA,EAAC,CAAA,CAAA;AACvC,EAAA,MAAM,WAAqB,EAAC;AAG5B,EAAA,MAAM,SAAA,GAAY,OAAA,CAAQ,MAAA,CAAO,IAAA,GAAO,CAAA;AACxC,EAAA,MAAM,SAAA,GAAY;AAAA,IAChB,4GAAA;AAAA,IACA,YACI,yJAAA,GACA,wFAAA;AAAA,IACJ,sGAAA;AAAA,IACA,kDAAA;AAAA,IACAA;AAAA,GACF,CAAE,KAAK,IAAI,CAAA;AACX,EAAA,MAAM,OAAA,GAAU;AAAA,IACd,oBAAA;AAAA,IACA,KAAK,QAAA,CAAS,GAAA,CAAI,CAAC,CAAA,KAAM,OAAO,CAAA,CAAE,IAAA,GAAO,IAAA,GAAO,CAAA,CAAE,YAAY,KAAA,CAAM,CAAA,EAAG,GAAG,CAAC,CAAA,CAAE,KAAK,IAAI,CAAA;AAAA,IACtF,EAAA;AAAA,IACA,uBAAA;AAAA,IACA,yBAAyB,OAAO,CAAA;AAAA,IAChC,EAAA;AAAA,IACA,YACI,iDAAA,GACA;AAAA,GACN,CAAE,KAAK,IAAI,CAAA;AACX,EAAA,MAAM,MAAA,GAAS,MAAM,MAAA,CAAO,IAAA;AAAA,IAC1B,CAAC,EAAE,IAAA,EAAM,QAAA,EAAU,OAAA,EAAS,SAAA,EAAU,EAAG,EAAE,IAAA,EAAM,MAAA,EAAQ,OAAA,EAAS,OAAA,EAAS,CAAA;AAAA,IAC3E,EAAE,WAAA,EAAa,CAAA,EAAG,SAAA,EAAW,IAAA;AAAK,GACpC;AACA,EAAA,MAAM,GAAA,GAAM,cAAA,CAAe,MAAA,CAAO,OAAO,CAAA;AAGzC,EAAA,MAAM,MAAA,GAAS,SAAA,GAAA,CAAa,GAAA,CAAI,eAAA,IAAmB,EAAC,EAAG,GAAA,CAAI,MAAM,CAAA,CAAE,MAAA,CAAO,OAAO,CAAA,GAAI,EAAC;AACtF,EAAA,MAAM,OAAA,GAAU,SAAA,GAAY,EAAC,GAAA,CAAK,GAAA,CAAI,mBAAA,IAAuB,EAAC,EAAG,GAAA,CAAI,MAAM,CAAA,CAAE,MAAA,CAAO,OAAO,CAAA;AAC3F,EAAA,GAAA,CAAI,UAAA,EAAY,+BAAA,IAAmC,SAAA,GAAY,QAAA,GAAW,gBAAgB,KAAA,IAAS,SAAA,GAAY,MAAA,CAAO,IAAA,CAAK,GAAG,CAAA,GAAI,OAAA,CAAQ,IAAA,CAAK,GAAG,CAAA,CAAE,CAAA;AAGpJ,EAAA,MAAM,YAAY,iBAAA,CAAkB,OAAA,EAAS,OAAA,EAAS,MAAA,EAAQ,KAAK,QAAQ,CAAA;AAC3E,EAAA,GAAA,CAAI,UAAA,EAAY,6BAA6B,SAAA,CAAU,MAAA,GAAS,MAAM,OAAA,CAAQ,QAAA,CAAS,SAAS,4BAA4B,CAAA;AAC5H,EAAA,IAAI,UAAU,MAAA,KAAW,CAAA,EAAG,MAAM,IAAI,MAAM,+EAA0E,CAAA;AAEtH,EAAA,MAAM,MAAA,GAAS;AAAA,IACb,gFAAA;AAAA,IACA,+CAAA;AAAA,IACA,CAAA,kSAAA,CAAA;AAAA,IACA,sJAAA;AAAA,IACA,6KAAA;AAAA,IACA,4HAAA;AAAA,IACA,CAAA,gXAAA,CAAA;AAAA,IACA,QAAA;AAAA,IACA,uEAAA;AAAA,IACA,4YAAA;AAAA,IACA,wIAAA;AAAA,IACA,6GAAA;AAAA,IACA,+FAAA;AAAA,IACAA;AAAA,GACF,CAAE,KAAK,IAAI,CAAA;AAEX,EAAA,MAAM,IAAA,GAAO;AAAA,IACX,cAAA,GAAiB,SAAA;AAAA,IACjB,EAAA;AAAA,IACA,qCAAA;AAAA,IACA,IAAA,CAAK,SAAA,CAAU,IAAA,CAAK,QAAA,CAAS,GAAA,CAAI,CAAC,CAAA,MAAO,EAAE,EAAA,EAAI,CAAA,CAAE,EAAA,EAAI,IAAA,EAAM,EAAE,IAAA,EAAM,WAAA,EAAa,CAAA,CAAE,WAAA,CAAY,KAAA,CAAM,CAAA,EAAG,GAAG,CAAA,EAAG,UAAU,CAAA,CAAE,QAAA,CAAS,KAAA,CAAM,CAAA,EAAG,EAAE,CAAA,EAAE,CAAE,CAAA,EAAG,MAAM,CAAC,CAAA;AAAA,IAC3J,EAAA;AAAA,IACA,0CAAA,GAA6C,UAAU,MAAA,GAAS,uBAAA;AAAA,IAChE,gBAAgB,SAAS,CAAA;AAAA,IACzB,EAAA;AAAA,IACA,0JAAA;AAAA,IACA;AAAA,GACF,CAAE,KAAK,IAAI,CAAA;AAEX,EAAA,MAAM,GAAA,GAAM,MAAM,MAAA,CAAO,IAAA;AAAA,IACvB,CAAC,EAAE,IAAA,EAAM,QAAA,EAAU,OAAA,EAAS,MAAA,EAAO,EAAG,EAAE,IAAA,EAAM,MAAA,EAAQ,OAAA,EAAS,IAAA,EAAM,CAAA;AAAA,IACrE,EAAE,WAAA,EAAa,CAAA,EAAG,SAAA,EAAW,IAAA;AAAK,GACpC;AACA,EAAA,GAAA,CAAI,UAAA,EAAY,8CAAA,GAAkD,GAAA,CAAyC,QAAA,GAAW,GAAG,CAAA;AAEzH,EAAA,MAAM,MAAA,GAAS,cAAA,CAAe,GAAA,CAAI,OAAO,CAAA;AACzC,EAAA,MAAM,SAAA,GAAY,MAAA,CAAO,SAAA,IAAa,EAAC;AACvC,EAAA,MAAM,IAAA,GAAO,IAAI,GAAA,CAAI,SAAA,CAAU,IAAI,CAAC,CAAA,KAAM,CAAC,MAAA,CAAO,CAAA,CAAE,EAAE,CAAA,EAAG,CAAC,CAAC,CAAC,CAAA;AAE5D,EAAA,MAAM,iBAA4C,EAAC;AACnD,EAAA,MAAM,YAA4C,EAAC;AACnD,EAAA,KAAA,MAAW,CAAA,IAAK,KAAK,QAAA,EAAU;AAC7B,IAAA,MAAM,CAAA,GAAI,IAAA,CAAK,GAAA,CAAI,CAAA,CAAE,EAAE,CAAA;AACvB,IAAA,IAAI,CAAC,CAAA,IAAM,CAAA,CAAE,aAAa,cAAA,IAAkB,CAAA,CAAE,aAAa,cAAA,EAAiB;AAE1E,MAAA,MAAM,IAAI,MAAM,UAAA,GAAa,CAAA,CAAE,KAAK,IAAA,GAAO,CAAA,CAAE,OAAO,sDAAiD,CAAA;AAAA,IACvG;AACA,IAAA,IAAI,CAAA,CAAE,aAAa,cAAA,EAAgB;AACjC,MAAA,MAAM,EAAA,GAAK,QAAQ,QAAA,CAAS,IAAA,CAAK,CAAC,CAAA,KAAM,CAAA,CAAE,IAAA,KAAS,CAAA,CAAE,SAAS,CAAA;AAC9D,MAAA,IAAI,CAAC,EAAA,EAAI,MAAM,IAAI,KAAA,CAAM,UAAA,GAAa,CAAA,CAAE,EAAA,GAAK,qCAAA,GAAwC,CAAA,CAAE,SAAA,GAAY,qBAAgB,CAAA;AAGnH,MAAA,MAAM,MAAA,GAAS,IAAI,GAAA,CAAI,EAAA,CAAG,QAAA,CAAS,GAAA,CAAI,CAAC,CAAA,KAAM,CAAA,CAAE,WAAA,EAAa,CAAC,CAAA;AAC9D,MAAA,MAAM,OAAA,GAAA,CAAW,CAAA,CAAE,gBAAA,IAAoB,IAAI,GAAA,CAAI,CAAC,CAAA,KAAM,MAAA,CAAO,CAAC,CAAC,CAAA,CAAE,MAAA,CAAO,CAAC,CAAA,KAAM;AAC7E,QAAA,IAAI,OAAO,GAAA,CAAI,CAAA,CAAE,WAAA,EAAa,GAAG,OAAO,IAAA;AACxC,QAAA,MAAM,IAAI,KAAA,CAAM,UAAA,GAAa,CAAA,CAAE,EAAA,GAAK,uBAAuB,CAAA,GAAI,wBAAA,GAA2B,EAAA,CAAG,IAAA,GAAO,qBAAgB,CAAA;AAAA,MACtH,CAAC,CAAA;AACD,MAAA,IAAI,GAAG,QAAA,CAAS,MAAA,GAAS,CAAA,IAAK,OAAA,CAAQ,WAAW,CAAA,EAAG;AAClD,QAAA,MAAM,IAAI,MAAM,UAAA,GAAa,CAAA,CAAE,KAAK,mBAAA,GAAsB,EAAA,CAAG,OAAO,8CAAyC,CAAA;AAAA,MAC/G;AACA,MAAA,cAAA,CAAe,IAAA,CAAK,EAAE,GAAG,CAAA,EAAG,EAAA,EAAI,CAAA,CAAE,EAAA,EAAI,SAAA,EAAW,EAAA,CAAG,IAAA,EAAM,gBAAA,EAAkB,OAAA,EAAS,CAAA;AACrF,MAAA,QAAA,CAAS,IAAA,CAAK,aAAa,CAAA,CAAE,EAAA,GAAK,sBAAsB,EAAA,CAAG,IAAA,GAAO,OAAO,EAAA,CAAG,IAAA,GAAO,0BAA0B,OAAA,CAAQ,IAAA,CAAK,IAAI,CAAA,IAAK,CAAA,CAAE,OAAO,UAAA,GAAQ,CAAA,CAAE,OAAO,EAAA,CAAG,CAAA;AAAA,IAClK,CAAA,MAAO;AACL,MAAA,MAAM,IAAA,GAAA,CAAQ,EAAE,aAAA,IAAiB,EAAA,EAAI,aAAY,CAAE,OAAA,CAAQ,eAAe,GAAG,CAAA;AAC7E,MAAA,IAAI,CAAC,mBAAA,CAAoB,IAAA,CAAK,IAAI,CAAA,EAAG;AACnC,QAAA,MAAM,IAAI,MAAM,UAAA,GAAa,CAAA,CAAE,KAAK,0BAAA,GAA6B,CAAA,CAAE,gBAAgB,sBAAiB,CAAA;AAAA,MACtG;AACA,MAAA,cAAA,CAAe,IAAA,CAAK,EAAE,GAAG,CAAA,EAAG,IAAI,CAAA,CAAE,EAAA,EAAI,aAAA,EAAe,IAAA,EAAM,CAAA;AAC3D,MAAA,SAAA,CAAU,IAAA,CAAK;AAAA,QACb,IAAA;AAAA,QACA,MAAM,CAAA,CAAE,IAAA;AAAA,QACR,aAAa,CAAA,CAAE,mBAAA,IAAuB,EAAE,WAAA,CAAY,KAAA,CAAM,GAAG,GAAG,CAAA;AAAA,QAChE,UAAU,CAAA,CAAE,QAAA;AAAA,QACZ,aAAA,EAAe,IAAA;AAAA,QACf,cAAA,EAAgB,EAAA;AAAA,QAChB,WAAA,EAAa,EAAA;AAAA,QACb,4BAA4B,EAAC;AAAA,QAC7B,MAAA,EAAQ,UAAA;AAAA,QACR,mBAAmB,CAAA,CAAE,EAAA;AAAA,QACrB,wBAAwB,CAAA,CAAE,qBAAA,IAAyB,EAAC,EAAG,OAAO,OAAO;AAAA,OACtE,CAAA;AACD,MAAA,QAAA,CAAS,KAAK,UAAA,GAAa,CAAA,CAAE,EAAA,GAAK,oBAAA,GAAuB,QAAQ,CAAA,CAAE,qBAAA,EAAuB,MAAA,GAAS,kBAAA,GAAqB,EAAE,qBAAA,CAAsB,IAAA,CAAK,IAAI,CAAA,GAAI,MAAM,EAAA,CAAG,CAAA;AAAA,IACxK;AAAA,EACF;AAGA,EAAA,MAAM,UAAU,aAAA,IAAiB,IAAA,CAAK,MAAA,EAAO,EAAG,oBAAoB,wBAAwB,CAAA;AAC5F,EAAA,IAAI;AACF,IAAA,SAAA,CAAU,OAAA,CAAQ,KAAA,CAAM,CAAA,EAAG,OAAA,CAAQ,WAAA,CAAY,GAAG,CAAC,CAAA,EAAG,EAAE,SAAA,EAAW,IAAA,EAAM,CAAA;AACzE,IAAA,aAAA,CAAc,OAAA,EAAS,IAAA,CAAK,SAAA,CAAU,EAAE,+BAAc,IAAI,IAAA,EAAK,EAAE,WAAA,EAAY,EAAG,SAAA,EAAU,EAAG,IAAA,EAAM,CAAC,CAAC,CAAA;AACrG,IAAA,GAAA,CAAI,UAAA,EAAY,qBAAA,GAAwB,SAAA,CAAU,MAAA,GAAS,SAAS,OAAO,CAAA;AAAA,EAC7E,SAAS,CAAA,EAAG;AACV,IAAA,QAAA,CAAS,IAAA,CAAK,0CAA0C,CAAA,YAAa,KAAA,GAAQ,EAAE,OAAA,GAAU,MAAA,CAAO,CAAC,CAAA,CAAE,CAAA;AAAA,EACrG;AAEA,EAAA,OAAO,EAAE,SAAA,EAAW,cAAA,EAAgB,SAAA,EAAW,QAAA,EAAU,aAAA,EAAe,SAAA,CAAU,MAAA,EAAQ,WAAA,EAAa,OAAA,CAAQ,QAAA,CAAS,MAAA,EAAO;AACjI;;;ACxKA,SAAS,aAAa,QAAA,EAAiC;AACrD,EAAA,MAAM,SAAqB,EAAC;AAC5B,EAAA,MAAM,OAAA,uBAAc,GAAA,EAAY;AAChC,EAAA,MAAM,OAAA,uBAAc,GAAA,EAAY;AAChC,EAAA,MAAM,OAAiB,EAAC;AAExB,EAAA,SAAS,GAAA,CAAI,WAAmBC,UAAAA,EAAkC;AAChE,IAAA,IAAI,OAAA,CAAQ,GAAA,CAAI,SAAS,CAAA,EAAG;AAE1B,MAAA,MAAM,UAAA,GAAa,IAAA,CAAK,OAAA,CAAQ,SAAS,CAAA;AACzC,MAAA,IAAI,cAAc,CAAA,EAAG;AACnB,QAAA,MAAA,CAAO,IAAA,CAAK,CAAC,GAAG,IAAA,CAAK,MAAM,UAAU,CAAA,EAAG,SAAS,CAAC,CAAA;AAAA,MACpD;AACA,MAAA;AAAA,IACF;AACA,IAAA,IAAI,OAAA,CAAQ,GAAA,CAAI,SAAS,CAAA,EAAG;AAE5B,IAAA,OAAA,CAAQ,IAAI,SAAS,CAAA;AACrB,IAAA,OAAA,CAAQ,IAAI,SAAS,CAAA;AACrB,IAAA,IAAA,CAAK,KAAK,SAAS,CAAA;AAEnB,IAAA,MAAM,OAAA,GAAUA,UAAAA,CAAU,GAAA,CAAI,SAAS,KAAK,EAAC;AAC7C,IAAA,KAAA,MAAW,UAAU,OAAA,EAAS;AAC5B,MAAA,GAAA,CAAI,QAAQA,UAAS,CAAA;AAAA,IACvB;AAEA,IAAA,IAAA,CAAK,GAAA,EAAI;AACT,IAAA,OAAA,CAAQ,OAAO,SAAS,CAAA;AAAA,EAC1B;AAGA,EAAA,MAAM,SAAA,uBAAgB,GAAA,EAAsB;AAC5C,EAAA,KAAA,MAAW,WAAW,QAAA,EAAU;AAC9B,IAAA,SAAA,CAAU,IAAI,OAAA,CAAQ,EAAA,EAAI,OAAA,CAAQ,aAAA,IAAiB,EAAE,CAAA;AAAA,EACvD;AAEA,EAAA,KAAA,MAAW,WAAW,QAAA,EAAU;AAC9B,IAAA,IAAI,CAAC,OAAA,CAAQ,GAAA,CAAI,OAAA,CAAQ,EAAE,CAAA,EAAG;AAC5B,MAAA,GAAA,CAAI,OAAA,CAAQ,IAAI,SAAS,CAAA;AAAA,IAC3B;AAAA,EACF;AAEA,EAAA,OAAO,MAAA;AACT;AAMA,SAAS,WAAA,CAAY,UAAqB,MAAA,EAAwF;AAChI,EAAA,MAAM,UAA+C,EAAC;AACtD,EAAA,MAAM,KAAA,GAAQ,QAAA,CAAS,GAAA,CAAI,CAAA,CAAA,MAAM,EAAE,GAAG,CAAA,EAAG,aAAA,EAAe,CAAC,GAAI,CAAA,CAAE,aAAA,IAAiB,EAAG,GAAE,CAAE,CAAA;AAEvF,EAAA,KAAA,MAAW,SAAS,MAAA,EAAQ;AAG1B,IAAA,IAAI,KAAA,CAAM,UAAU,CAAA,EAAG;AACrB,MAAA,MAAM,OAAA,GAAU,KAAA,CAAM,KAAA,CAAM,MAAA,GAAS,CAAC,CAAA;AACtC,MAAA,MAAM,MAAA,GAAS,KAAA,CAAM,KAAA,CAAM,MAAA,GAAS,CAAC,CAAA;AAErC,MAAA,KAAA,MAAW,WAAW,KAAA,EAAO;AAC3B,QAAA,IAAI,OAAA,CAAQ,OAAO,OAAA,EAAS;AAC1B,UAAA,OAAA,CAAQ,gBAAgB,OAAA,CAAQ,aAAA,CAAc,MAAA,CAAO,CAAA,CAAA,KAAK,MAAM,MAAM,CAAA;AACtE,UAAA,OAAA,CAAQ,KAAK,EAAE,IAAA,EAAM,OAAA,EAAS,EAAA,EAAI,QAAQ,CAAA;AAAA,QAC5C;AAAA,MACF;AAAA,IACF;AAAA,EACF;AAEA,EAAA,OAAO,EAAE,OAAO,OAAA,EAAQ;AAC1B;AAMA,SAAS,gBAAgB,QAAA,EAA+B;AACtD,EAAA,MAAM,QAAA,uBAAe,GAAA,EAAoB;AACzC,EAAA,MAAM,SAAA,uBAAgB,GAAA,EAAsB;AAE5C,EAAA,KAAA,MAAW,WAAW,QAAA,EAAU;AAC9B,IAAA,QAAA,CAAS,GAAA,CAAI,OAAA,CAAQ,EAAA,EAAI,CAAC,CAAA;AAC1B,IAAA,SAAA,CAAU,GAAA,CAAI,OAAA,CAAQ,EAAA,EAAI,EAAE,CAAA;AAAA,EAC9B;AAEA,EAAA,KAAA,MAAW,WAAW,QAAA,EAAU;AAC9B,IAAA,KAAA,MAAW,MAAA,IAAU,OAAA,CAAQ,aAAA,IAAiB,EAAC,EAAG;AAEhD,MAAA,SAAA,CAAU,GAAA,CAAI,MAAM,CAAA,EAAG,IAAA,CAAK,QAAQ,EAAE,CAAA;AACtC,MAAA,QAAA,CAAS,GAAA,CAAI,QAAQ,EAAA,EAAA,CAAK,QAAA,CAAS,IAAI,OAAA,CAAQ,EAAE,CAAA,IAAK,CAAA,IAAK,CAAC,CAAA;AAAA,IAC9D;AAAA,EACF;AAEA,EAAA,MAAM,QAAkB,EAAC;AACzB,EAAA,KAAA,MAAW,CAAC,EAAA,EAAI,MAAM,CAAA,IAAK,QAAA,EAAU;AACnC,IAAA,IAAI,MAAA,KAAW,CAAA,EAAG,KAAA,CAAM,IAAA,CAAK,EAAE,CAAA;AAAA,EACjC;AAEA,EAAA,MAAM,SAAmB,EAAC;AAC1B,EAAA,OAAO,KAAA,CAAM,SAAS,CAAA,EAAG;AACvB,IAAA,MAAM,OAAA,GAAU,MAAM,KAAA,EAAM;AAC5B,IAAA,MAAA,CAAO,KAAK,OAAO,CAAA;AAEnB,IAAA,KAAA,MAAW,YAAY,SAAA,CAAU,GAAA,CAAI,OAAO,CAAA,IAAK,EAAC,EAAG;AACnD,MAAA,MAAM,SAAA,GAAA,CAAa,QAAA,CAAS,GAAA,CAAI,QAAQ,KAAK,CAAA,IAAK,CAAA;AAClD,MAAA,QAAA,CAAS,GAAA,CAAI,UAAU,SAAS,CAAA;AAChC,MAAA,IAAI,SAAA,KAAc,CAAA,EAAG,KAAA,CAAM,IAAA,CAAK,QAAQ,CAAA;AAAA,IAC1C;AAAA,EACF;AAEA,EAAA,IAAI,MAAA,CAAO,MAAA,KAAW,QAAA,CAAS,MAAA,EAAQ;AAErC,IAAA,OAAA,CAAQ,KAAK,CAAA,oCAAA,EAAuC,MAAA,CAAO,MAAM,CAAA,CAAA,EAAI,QAAA,CAAS,MAAM,CAAA,gBAAA,CAAkB,CAAA;AAAA,EACxG;AAEA,EAAA,OAAO,MAAA;AACT;AA2CA,eAAsB,uBACpB,OAAA,EACuC;AACvC,EAAA,MAAM,EAAE,SAAS,WAAA,EAAa,YAAA,EAAc,WAAW,MAAA,EAAQ,SAAA,EAAW,SAAA,EAAW,UAAA,EAAW,GAAI,OAAA;AACpG,EAAA,MAAM,WAAqB,EAAC;AAE5B,EAAA,MAAM,GAAA,GAAM,CAAC,IAAA,EAAc,GAAA,KAAgB;AACzC,IAAA,OAAA,CAAQ,GAAA,CAAI,CAAA,IAAA,EAAO,IAAI,CAAA,EAAA,EAAK,GAAG,CAAA,CAAE,CAAA;AACjC,IAAA,UAAA,GAAa,MAAM,GAAG,CAAA;AAAA,EACxB,CAAA;AAGA,EAAA,GAAA,CAAI,UAAU,sCAAsC,CAAA;AAEpD,EAAA,MAAM,MAAA,GAAS,gBAAgB,SAAS,CAAA;AAGxC,EAAA,MAAM,mBAAmB,QAAA,CAAS,OAAA,CAAQ,GAAA,CAAI,qBAAA,IAAyB,SAAS,EAAE,CAAA;AAClF,EAAA,IAAI,iBAAA,GAAoB,EAAA;AACxB,EAAA,IAAI,YAAA,EAAc;AAChB,IAAA,IAAI,YAAA,CAAa,SAAS,gBAAA,EAAkB;AAC1C,MAAA,iBAAA,GAAoB,YAAA,CAAa,KAAA,CAAM,CAAA,EAAG,gBAAgB,CAAA;AAC1D,MAAA,QAAA,CAAS,KAAK,CAAA,wBAAA,EAA2B,YAAA,CAAa,MAAM,CAAA,IAAA,EAAO,gBAAgB,CAAA,oCAAA,CAAiC,CAAA;AAAA,IACtH,CAAA,MAAO;AACL,MAAA,iBAAA,GAAoB,YAAA;AAAA,IACtB;AAAA,EACF;AAEA,EAAA,MAAM,YAAA,GACJ,ysEAAA;AAgCF,EAAA,MAAM,UAAA,GAAa,YAAY,OAAO;AAAA,EAAK,WAAA,GAAc,CAAA,aAAA,EAAgB,WAAW,CAAA,CAAA,GAAK,EAAE;AAAA,EAAK,iBAAA,GAAoB,CAAA;AAAA,EAAc,iBAAiB,KAAK,EAAE;AAAA,EAAK,SAAA,GAAY,CAAA,YAAA,EAAe,SAAA,CAAU,CAAC,CAAC,IAAI,SAAA,CAAU,CAAC,CAAC,CAAA,CAAA,GAAK,EAAE;AAAA,EAAK,MAAA,GAAS,CAAA,QAAA,EAAW,MAAM,CAAA,CAAA,GAAK,EAAE;;AAAA;AAAA;AAAA;AAAA,WAAA,EAAmD,OAAA,CAAQ,WAAA,EAAY,CAAE,OAAA,CAAQ,MAAA,EAAQ,GAAG,CAAA,CAAE,KAAA,CAAM,CAAA,EAAG,EAAE,CAAC,CAAA;AAAA,aAAA,EAAoB,OAAO,CAAA;AAAA;AAAA,eAAA,EAAiD,UAAU,OAAO,CAAA;AAAA,kBAAA,EAAyB,SAAA,GAAY,CAAA,CAAA,EAAI,SAAA,CAAU,CAAC,CAAC,KAAK,SAAA,CAAU,CAAC,CAAC,CAAA,CAAA,CAAA,GAAM,SAAS;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,CAAA,CAAA;AAE/hB,EAAA,MAAM,MAAA,GAAS,MAAM,WAAA,CAAY,MAAA,EAAQ,cAAc,UAAA,EAAY;AAAA,IACjE,WAAA,EAAa,GAAA;AAAA,IACb,WAAW,QAAA,CAAS,OAAA,CAAQ,GAAA,CAAI,aAAA,IAAiB,SAAS,EAAE;AAAA,GAC7D,CAAA;AAGD,EAAA,GAAA,CAAI,UAAU,4CAA4C,CAAA;AAE1D,EAAA,MAAM,QAAA,GAAY,MAAA,CAAO,QAAA,IAAY,EAAC;AACtC,EAAA,MAAM,UAAA,GAAc,MAAA,CAAO,UAAA,IAAc,EAAC;AAI1C,EAAA;AACE,IAAA,MAAM,IAAA,mBAAO,IAAI,GAAA,CAAI,CAAC,KAAA,EAAO,OAAO,KAAA,EAAO,MAAA,EAAQ,MAAA,EAAQ,MAAA,EAAQ,MAAA,EAAQ,MAAA,EAAQ,QAAQ,OAAA,EAAS,OAAA,EAAS,OAAA,EAAS,MAAA,EAAQ,MAAA,EAAQ,KAAA,EAAO,OAAO,MAAA,EAAQ,SAAA,EAAW,SAAA,EAAW,OAAO,CAAC,CAAA;AAC1L,IAAA,MAAM,UAAA,GAAa,CAAC,IAAA,KAA2B,IAAA,CAC5C,aAAY,CACZ,OAAA,CAAQ,eAAA,EAAiB,GAAG,CAAA,CAC5B,KAAA,CAAM,KAAK,CAAA,CACX,MAAA,CAAO,OAAK,CAAA,CAAE,MAAA,IAAU,KAAK,CAAC,IAAA,CAAK,GAAA,CAAI,CAAC,CAAC,CAAA;AAC5C,IAAA,KAAA,MAAW,KAAK,QAAA,EAAU;AACxB,MAAA,MAAM,QAAA,GAAA,CAAY,CAAA,CAAE,QAAA,IAAY,IAAI,GAAA,CAAI,CAAA,CAAA,KAAK,MAAA,CAAO,CAAC,CAAA,CAAE,IAAA,EAAM,CAAA,CAAE,OAAO,OAAO,CAAA;AAC7E,MAAA,IAAI,QAAA,CAAS,WAAW,CAAA,EAAG;AACzB,QAAA,MAAM,OAAA,GAAU,CAAC,mBAAG,IAAI,IAAI,CAAC,GAAG,UAAA,CAAW,CAAA,CAAE,IAAI,CAAA,EAAG,GAAG,UAAA,CAAW,CAAA,CAAE,eAAe,EAAE,CAAC,CAAC,CAAC,CAAA,CAAE,KAAA,CAAM,CAAA,EAAG,CAAC,CAAA;AACpG,QAAA,IAAI,OAAA,CAAQ,WAAW,CAAA,EAAG;AACxB,UAAA,MAAM,IAAI,MAAM,UAAA,GAAa,CAAA,CAAE,KAAK,IAAA,GAAO,CAAA,CAAE,OAAO,sFAAiF,CAAA;AAAA,QACvI;AACA,QAAA,CAAA,CAAE,QAAA,GAAW,OAAA;AACb,QAAA,QAAA,CAAS,IAAA,CAAK,aAAa,CAAA,CAAE,EAAA,GAAK,mCAAmC,OAAA,CAAQ,IAAA,CAAK,IAAI,CAAA,GAAI,wBAAwB,CAAA;AAAA,MACpH,CAAA,MAAO;AACL,QAAA,CAAA,CAAE,QAAA,GAAW,QAAA;AAAA,MACf;AAAA,IACF;AAAA,EACF;AACA,EAAA,MAAM,UAAU,MAAA,CAAO,aAAA;AACvB,EAAA,IAAI,gBAAoC,OAAA,IAAW,EAAC,EAAG,GAAA,CAAI,CAAC,CAAA,MAAgC;AAAA,IACxF,UAAA,EAAY,MAAA,CAAO,CAAA,CAAE,UAAA,IAAc,EAAE,CAAA;AAAA,IACrC,KAAA,EAAO,MAAA,CAAO,CAAA,CAAE,KAAA,IAAS,CAAC,CAAA;AAAA,IAC1B,UAAA,EAAY,KAAA,CAAM,OAAA,CAAQ,CAAA,CAAE,UAAU,CAAA,GAAI,CAAA,CAAE,UAAA,CAAW,GAAA,CAAI,MAAM,CAAA,GAAI,EAAC;AAAA,IACtE,cAAA,EAAgB,MAAA,CAAO,CAAA,CAAE,cAAA,IAAkB,EAAE;AAAA,GAC/C,CAAE,CAAA;AAGJ,EAAA,MAAM,UAAA,GAAa,IAAI,GAAA,CAAI,QAAA,CAAS,IAAI,CAAA,CAAA,KAAK,CAAA,CAAE,EAAE,CAAC,CAAA;AAClD,EAAA,KAAA,MAAW,WAAW,QAAA,EAAU;AAC9B,IAAA,KAAA,MAAW,MAAA,IAAU,OAAA,CAAQ,aAAA,IAAiB,EAAC,EAAG;AAChD,MAAA,IAAI,CAAC,UAAA,CAAW,GAAA,CAAI,MAAM,CAAA,EAAG;AAC3B,QAAA,QAAA,CAAS,KAAK,CAAA,QAAA,EAAW,OAAA,CAAQ,EAAE,CAAA,sCAAA,EAAyC,MAAM,CAAA,eAAA,CAAY,CAAA;AAC9F,QAAA,OAAA,CAAQ,aAAA,GAAA,CAAiB,QAAQ,aAAA,IAAiB,IAAI,MAAA,CAAO,CAAA,CAAA,KAAK,MAAM,MAAM,CAAA;AAAA,MAChF;AAAA,IACF;AAAA,EACF;AAMA,EAAA,IAAI,QAAQ,iBAAA,EAAmB;AAC7B,IAAA,MAAM,OAAA,GAAU,wBAAA,CAAyB,OAAA,CAAQ,iBAAiB,CAAA;AAClE,IAAA,GAAA,CAAI,UAAA,EAAY,yBAAA,GAA4B,OAAA,CAAQ,QAAA,CAAS,MAAA,GAAS,iBAAA,GAAoB,OAAA,CAAQ,IAAA,CAAK,KAAA,CAAM,GAAG,CAAA,CAAE,GAAA,EAAK,CAAA;AACvH,IAAA,MAAM,GAAA,GAAM,MAAM,mBAAA,CAAoB;AAAA,MACpC,MAAA;AAAA,MACA,QAAA,EAAU,QAAA,CAAS,GAAA,CAAI,CAAC,CAAA,MAAO;AAAA,QAC7B,IAAI,CAAA,CAAE,EAAA;AAAA,QACN,MAAM,CAAA,CAAE,IAAA;AAAA,QACR,WAAA,EAAa,EAAE,WAAA,IAAe,EAAA;AAAA,QAC9B,QAAA,EAAU,CAAA,CAAE,QAAA,IAAY;AAAC,OAC3B,CAAE,CAAA;AAAA,MACF,OAAA;AAAA,MACA,SAAA;AAAA,MACA,eAAe,OAAA,CAAQ,aAAA;AAAA,MACvB,UAAA,EAAY;AAAA,KACb,CAAA;AACD,IAAA,QAAA,CAAS,IAAA,CAAK,GAAG,GAAA,CAAI,QAAQ,CAAA;AAC7B,IAAA,MAAM,SAAA,GAAY,IAAI,GAAA,CAAI,GAAA,CAAI,SAAA,CAAU,GAAA,CAAI,CAAC,CAAA,KAAM,CAAC,CAAA,CAAE,EAAA,EAAI,CAAC,CAAC,CAAC,CAAA;AAC7D,IAAA,KAAA,MAAW,KAAK,QAAA,EAAU;AACxB,MAAA,MAAM,CAAA,GAAI,SAAA,CAAU,GAAA,CAAI,CAAA,CAAE,EAAE,CAAA;AAC5B,MAAA,IAAI,CAAC,GAAG,MAAM,IAAI,MAAM,UAAA,GAAa,CAAA,CAAE,KAAK,sDAAiD,CAAA;AAC7F,MAAA,IAAI,CAAA,CAAE,aAAa,cAAA,EAAgB;AACjC,QAAA,CAAA,CAAE,eAAA,GAAkB,cAAA;AACpB,QAAA,CAAA,CAAE,YAAY,CAAA,CAAE,SAAA;AAChB,QAAA,CAAA,CAAE,OAAO,CAAA,CAAE,SAAA;AACX,QAAA,MAAM,EAAA,GAAK,QAAQ,QAAA,CAAS,IAAA,CAAK,CAAC,CAAA,KAAM,CAAA,CAAE,IAAA,KAAS,CAAA,CAAE,SAAS,CAAA;AAC9D,QAAA,IAAI,EAAA,EAAI;AAGN,UAAA,KAAA,MAAW,CAAA,IAAK,CAAA,CAAE,gBAAA,IAAoB,EAAC,EAAG;AACxC,YAAA,IAAI,CAAA,CAAE,CAAA,CAAE,QAAA,IAAY,IAAI,IAAA,CAAK,CAAC,CAAA,KAAM,CAAA,CAAE,WAAA,EAAY,KAAM,CAAA,CAAE,WAAA,EAAa,CAAA,EAAG;AACxE,cAAA,CAAA,CAAE,WAAW,CAAC,GAAI,EAAE,QAAA,IAAY,IAAK,CAAC,CAAA;AAAA,YACxC;AAAA,UACF;AACA,UAAA,CAAA,CAAE,qBAAqB,EAAA,CAAG,iBAAA;AAAA,QAC5B;AAAA,MACF,CAAA,MAAO;AACL,QAAA,CAAA,CAAE,eAAA,GAAkB,cAAA;AACpB,QAAA,CAAA,CAAE,OAAO,CAAA,CAAE,aAAA;AAAA,MACb;AAAA,IACF;AAGA,IAAA,MAAM,eAAe,IAAI,GAAA,CAAI,SAAS,MAAA,CAAO,CAAC,MAAM,CAAA,CAAE,SAAS,EAAE,GAAA,CAAI,CAAC,MAAM,CAAC,CAAA,CAAE,WAAqB,CAAA,CAAE,EAAE,CAAC,CAAC,CAAA;AAC1G,IAAA,KAAA,MAAW,KAAK,QAAA,EAAU;AACxB,MAAA,KAAA,MAAW,EAAA,IAAM,CAAA,CAAE,kBAAA,IAAsB,EAAC,EAAG;AAC3C,QAAA,MAAM,MAAA,GAAS,YAAA,CAAa,GAAA,CAAI,EAAE,CAAA;AAClC,QAAA,IAAI,MAAA,IAAU,MAAA,KAAW,CAAA,CAAE,EAAA,IAAM,CAAA,CAAE,CAAA,CAAE,aAAA,IAAiB,EAAC,EAAG,QAAA,CAAS,MAAM,CAAA,EAAG;AAC1E,UAAA,CAAA,CAAE,gBAAgB,CAAC,GAAI,EAAE,aAAA,IAAiB,IAAK,MAAM,CAAA;AACrD,UAAA,QAAA,CAAS,IAAA,CAAK,8BAA8B,CAAA,CAAE,EAAA,GAAK,SAAS,EAAA,GAAK,IAAA,GAAO,SAAS,GAAG,CAAA;AAAA,QACtF;AAAA,MACF;AAAA,IACF;AACA,IAAA,GAAA,CAAI,UAAA,EAAY,mBAAmB,GAAA,CAAI,SAAA,CAAU,OAAO,CAAC,CAAA,KAAM,CAAA,CAAE,QAAA,KAAa,cAAc,CAAA,CAAE,SAC1F,kBAAA,GAAqB,GAAA,CAAI,UAAU,MAAA,CAAO,CAAC,MAAM,CAAA,CAAE,QAAA,KAAa,cAAc,CAAA,CAAE,MAAM,CAAA;AAAA,EAC5F;AAGA,EAAA,GAAA,CAAI,UAAU,qCAAqC,CAAA;AAEnD,EAAA,MAAM,MAAA,GAAS,aAAa,QAAQ,CAAA;AACpC,EAAA,IAAI,MAAA,CAAO,SAAS,CAAA,EAAG;AACrB,IAAA,GAAA,CAAI,QAAA,EAAU,CAAA,MAAA,EAAS,MAAA,CAAO,MAAM,CAAA,sDAAA,CAAmD,CAAA;AACvF,IAAA,KAAA,MAAW,SAAS,MAAA,EAAQ;AAC1B,MAAA,QAAA,CAAS,KAAK,CAAA,gBAAA,EAAmB,KAAA,CAAM,IAAA,CAAK,UAAK,CAAC,CAAA,gCAAA,CAA6B,CAAA;AAAA,IACjF;AAEA,IAAA,MAAM,EAAE,KAAA,EAAO,OAAA,EAAQ,GAAI,WAAA,CAAY,UAAU,MAAM,CAAA;AAEvD,IAAA,KAAA,IAAS,CAAA,GAAI,CAAA,EAAG,CAAA,GAAI,QAAA,CAAS,QAAQ,CAAA,EAAA,EAAK;AACxC,MAAA,MAAM,YAAA,GAAe,MAAM,IAAA,CAAK,CAAA,CAAA,KAAK,EAAE,EAAA,KAAO,QAAA,CAAS,CAAC,CAAA,CAAE,EAAE,CAAA;AAC5D,MAAA,IAAI,YAAA,EAAc;AAChB,QAAA,QAAA,CAAS,CAAC,IAAI,EAAE,GAAG,SAAS,CAAC,CAAA,EAAG,aAAA,EAAe,YAAA,CAAa,aAAA,EAAc;AAAA,MAC5E;AAAA,IACF;AAEA,IAAA,KAAA,MAAW,EAAE,IAAA,EAAM,EAAA,EAAG,IAAK,OAAA,EAAS;AAClC,MAAA,QAAA,CAAS,IAAA,CAAK,CAAA,2BAAA,EAA8B,IAAI,CAAA,QAAA,EAAM,EAAE,CAAA,gBAAA,CAAkB,CAAA;AAAA,IAC5E;AAAA,EACF;AAGA,EAAA,GAAA,CAAI,UAAU,iCAAiC,CAAA;AAE/C,EAAA,MAAM,SAAA,GAAY,gBAAgB,QAAQ,CAAA;AAG1C,EAAA,YAAA,GAAe,SAAA,CAAU,GAAA,CAAI,CAAC,EAAA,EAAI,GAAA,KAAQ;AACxC,IAAA,MAAM,UAAU,QAAA,CAAS,IAAA,CAAK,CAAA,CAAA,KAAK,CAAA,CAAE,OAAO,EAAE,CAAA;AAC9C,IAAA,OAAO;AAAA,MACL,UAAA,EAAY,EAAA;AAAA,MACZ,OAAO,GAAA,GAAM,CAAA;AAAA,MACb,UAAA,EAAY,OAAA,EAAS,aAAA,IAAiB,EAAC;AAAA,MACvC,cAAA,EAAgB;AAAA,KAClB;AAAA,EACF,CAAC,CAAA;AAGD,EAAA,GAAA,CAAI,UAAU,sDAAsD,CAAA;AAEpE,EAAA;AACE,IAAA,MAAM,KAAK,MAAM,+BAAA;AAAA,MACf,MAAA;AAAA,MACA,SAAS,GAAA,CAAI,CAAC,CAAA,MAAO,EAAE,IAAI,CAAA,CAAE,EAAA,EAAI,IAAA,EAAM,CAAA,CAAE,MAAM,WAAA,EAAa,CAAA,CAAE,aAAa,QAAA,EAAU,CAAA,CAAE,UAAS,CAAE,CAAA;AAAA,MAClG,cAAc,MAAA,KAAW,UAAA,IAAc,MAAA,KAAW,YAAA,GAAe,WAAY,MAAA,IAAU,SAAA,CAAA;AAAA,MACvF;AAAA,KACF;AACA,IAAA,MAAM,eAAA,GAAkB,kBAAA,CAAmB,QAAA,CAAS,GAAA,CAAI,CAAC,CAAA,MAAO,EAAE,EAAA,EAAI,CAAA,CAAE,EAAA,EAAI,IAAA,EAAM,CAAA,CAAE,IAAA,GAAO,CAAC,CAAA;AAC5F,IAAA,MAAM,OAAA,GAAU,WAAW,SAAA,KAAc,MAAA,KAAW,cAAc,MAAA,KAAW,YAAA,GAAe,QAAA,GAAY,MAAA,IAAU,SAAA,CAAW,CAAA;AAC7H,IAAA,KAAA,MAAW,WAAW,QAAA,EAAU;AAC9B,MAAA,OAAA,CAAQ,MAAM,EAAA,CAAG,YAAA,CAAa,QAAQ,EAAE,CAAA,IAAK,QAAQ,GAAA,IAAO,EAAA;AAC5D,MAAA,OAAA,CAAQ,MAAM,EAAA,CAAG,YAAA,CAAa,QAAQ,EAAE,CAAA,IAAK,QAAQ,GAAA,IAAO,EAAA;AAC5D,MAAA,IAAI,EAAA,CAAG,YAAA,CAAa,OAAA,CAAQ,EAAE,CAAA,IAAK,EAAA,CAAG,YAAA,CAAa,OAAA,CAAQ,EAAE,CAAA,CAAE,MAAA,GAAS,CAAA,EAAG;AACzE,QAAA,OAAA,CAAQ,GAAA,GAAM,EAAA,CAAG,YAAA,CAAa,OAAA,CAAQ,EAAE,CAAA;AAAA,MAC1C;AAIA,MAAA,OAAA,CAAQ,IAAA,GAAO,OAAA,CAAQ,IAAA,IAAQ,eAAA,CAAgB,QAAQ,EAAE,CAAA;AACzD,MAAA,OAAA,CAAQ,WAAW,OAAA,CAAQ,GAAA,GAAM,QAAQ,OAAA,CAAQ,IAAK,IAAI,OAAA,CAAQ,QAAA;AAClE,MAAA,OAAA,CAAQ,QAAA,GAAW,OAAA,CAAQ,GAAA,GAAM,OAAA,CAAQ,OAAA,CAAQ,IAAA,EAAO,CAAA,EAAG,aAAA,CAAc,OAAA,CAAQ,GAAG,CAAC,CAAA,GAAI,OAAA,CAAQ,QAAA;AACjG,MAAA,OAAA,CAAQ,YAAY,OAAA,CAAQ,GAAA,CAAI,SAAS,CAAA,GACrC,OAAA,CAAQ,IAAI,GAAA,CAAI,CAAC,GAAG,CAAA,KAAM,OAAA,CAAQ,SAAS,OAAA,CAAQ,IAAA,EAAO,IAAI,CAAC,CAAC,IAChE,OAAA,CAAQ,SAAA;AAAA,IACd;AACA,IAAA,GAAA,CAAI,UAAU,yBAAA,GAA4B,QAAA,CAAS,MAAA,GAAS,mBAAA,GACzD,GAAG,MAAA,CAAO,MAAA,CAAO,CAAC,CAAA,KAAM,EAAE,MAAM,CAAA,CAAE,SAAU,GAAA,GAAM,QAAA,CAAS,SAAS,SAAS,CAAA;AAAA,EAClF;AAGA,EAAA,KAAA,MAAW,QAAQ,YAAA,EAAc;AAC/B,IAAA,IAAI,CAAC,UAAA,CAAW,GAAA,CAAI,IAAA,CAAK,UAAU,CAAA,EAAG;AACpC,MAAA,QAAA,CAAS,IAAA,CAAK,CAAA,8CAAA,EAAiD,IAAA,CAAK,UAAU,CAAA,CAAE,CAAA;AAAA,IAClF;AAAA,EACF;AAEA,EAAA,GAAA,CAAI,QAAA,EAAU,CAAA,UAAA,EAAa,QAAA,CAAS,MAAM,CAAA,WAAA,EAAc,WAAW,MAAM,CAAA,aAAA,EAAgB,YAAA,CAAa,MAAM,CAAA,oBAAA,CAAsB,CAAA;AAElI,EAAA,OAAO;AAAA,IACL,cAAA,EAAgB;AAAA,MACd,cAAA,EAAgB,CAAA;AAAA,MAChB,IAAA,EAAM,iBAAA;AAAA,MACN,SAAS,MAAA,CAAO,OAAA;AAAA,MAChB,QAAA;AAAA,MACA,UAAA;AAAA,MACA,aAAA,EAAe;AAAA,KACjB;AAAA,IACA;AAAA,GACF;AACF;;;AC9bA,eAAsB,oBACpB,OAAA,EACoC;AACpC,EAAA,MAAM,EAAE,YAAA,EAAc,cAAA,EAAgB,SAAA,EAAW,YAAW,GAAI,OAAA;AAChE,EAAA,MAAM,WAAqB,EAAC;AAE5B,EAAA,MAAM,GAAA,GAAM,CAAC,IAAA,EAAc,GAAA,KAAgB;AACzC,IAAA,OAAA,CAAQ,GAAA,CAAI,MAAA,GAAS,IAAA,GAAO,IAAA,GAAO,GAAG,CAAA;AACtC,IAAA,UAAA,GAAa,MAAM,GAAG,CAAA;AAAA,EACxB,CAAA;AAEA,EAAA,MAAM,QAAA,GAAW,YAAA,CAAa,QAAA,IAAY,EAAC;AAC3C,EAAA,MAAM,QAAA,GAAW,cAAA,CAAe,QAAA,IAAY,EAAC;AAE7C,EAAA,IAAI,QAAA,CAAS,MAAA,KAAW,CAAA,IAAK,QAAA,CAAS,WAAW,CAAA,EAAG;AAClD,IAAA,QAAA,CAAS,KAAK,iCAAiC,CAAA;AAC/C,IAAA,OAAO;AAAA,MACL,WAAA,EAAa;AAAA,QACX,cAAA,EAAgB,CAAA;AAAA,QAChB,IAAA,EAAM,cAAA;AAAA,QACN,aAAA,EAAe,YAAA;AAAA,QACf,eAAA,EAAiB,cAAA;AAAA,QACjB,OAAO,EAAC;AAAA,QACR,QAAQ,EAAC;AAAA,QACT,WAAA,EAAa,EAAA;AAAA,QACb,qBAAA,EAAuB,CAAA;AAAA,QACvB,qBAAA,EAAuB,CAAA;AAAA,QACvB,uBAAA,EAAyB;AAAA,OAC3B;AAAA,MACA;AAAA,KACF;AAAA,EACF;AAEA,EAAA,MAAM,MAAA,GAAS,gBAAgB,SAAS,CAAA;AAExC,EAAA,MAAM,eAAe,QAAA,CAAS,GAAA;AAAA,IAAI,CAAA,CAAA,KAChC,IAAA,GAAO,CAAA,CAAE,EAAA,GAAK,IAAA,GAAO,CAAA,CAAE,IAAA,GAAO,KAAA,IAAS,CAAA,CAAE,WAAA,IAAe,EAAA,CAAA,GACxD,cAAA,GAAA,CAAkB,CAAA,CAAE,KAAA,IAAS,EAAC,EAAG,OAAA,CAAQ,CAAA,CAAA,KAAK,CAAA,CAAE,QAAA,IAAY,EAAE,CAAA,CAAE,KAAA,CAAM,CAAA,EAAG,CAAC,CAAA,CAAE,IAAA,CAAK,IAAI,CAAA,GAAI;AAAA,GAC3F,CAAE,KAAK,IAAI,CAAA;AAEX,EAAA,MAAM,eAAe,QAAA,CAAS,GAAA;AAAA,IAAI,CAAA,CAAA,KAChC,OAAO,CAAA,CAAE,EAAA,GAAK,OAAO,CAAA,CAAE,IAAA,GAAO,UAAA,GAAA,CAAc,CAAA,CAAE,GAAA,IAAO,EAAA,EAAI,MAAM,CAAA,EAAG,GAAG,IACrE,mBAAA,GAAA,CAAuB,CAAA,CAAE,iBAAiB,EAAC,EAAG,IAAA,CAAK,IAAI,CAAA,GAAI;AAAA,GAC7D,CAAE,KAAK,IAAI,CAAA;AAEX,EAAA,MAAM,YAAA,GACJ,6pBAAA;AAaF,EAAA,MAAM,UAAA,GAAa,aAAA,GAAgB,YAAA,GAAe,iBAAA,GAAoB,YAAA,GAAe,gEAAA;AAGrF,EAAA,MAAM,MAAA,GAAS,MAAM,WAAA,CAAY,MAAA,EAAQ,cAAc,UAAA,EAAY;AAAA,IACjE,WAAA,EAAa,GAAA;AAAA,IACb,SAAA,EAAW;AAAA,GACZ,CAAA;AAED,EAAA,MAAM,QAAA,GAAY,MAAA,CAAO,KAAA,IAAS,EAAC;AAEnC,EAAA,MAAM,UAAA,GAAa,IAAI,GAAA,CAAI,QAAA,CAAS,IAAI,CAAA,CAAA,KAAK,CAAA,CAAE,EAAE,CAAC,CAAA;AAClD,EAAA,MAAM,UAAA,GAAa,IAAI,GAAA,CAAI,QAAA,CAAS,IAAI,CAAA,CAAA,KAAK,CAAA,CAAE,EAAE,CAAC,CAAA;AAClD,EAAA,MAAM,aAAmC,EAAC;AAE1C,EAAA,KAAA,MAAW,QAAQ,QAAA,EAAU;AAC3B,IAAA,MAAM,GAAA,GAAM,MAAA,CAAO,IAAA,CAAK,UAAA,IAAc,EAAE,CAAA;AACxC,IAAA,MAAM,GAAA,GAAM,MAAA,CAAO,IAAA,CAAK,UAAA,IAAc,EAAE,CAAA;AACxC,IAAA,IAAI,CAAC,UAAA,CAAW,GAAA,CAAI,GAAG,CAAA,EAAG;AACxB,MAAA,QAAA,CAAS,IAAA,CAAK,0CAA0C,GAAG,CAAA;AAC3D,MAAA;AAAA,IACF;AACA,IAAA,IAAI,CAAC,UAAA,CAAW,GAAA,CAAI,GAAG,CAAA,EAAG;AACxB,MAAA,QAAA,CAAS,IAAA,CAAK,0CAA0C,GAAG,CAAA;AAC3D,MAAA;AAAA,IACF;AACA,IAAA,UAAA,CAAW,IAAA,CAAK;AAAA,MACd,UAAA,EAAY,GAAA;AAAA,MACZ,UAAA,EAAY,GAAA;AAAA,MACZ,YAAA,EAAe,KAAK,YAAA,IAAwE,UAAA;AAAA,MAC5F,KAAA,EAAQ,KAAK,KAAA,IAAmC,KAAA;AAAA,MAChD,WAAA,EAAa,MAAA,CAAO,IAAA,CAAK,WAAA,IAAe,EAAE,CAAA;AAAA,MAC1C,wBAAA,EAA0B,MAAA,CAAO,IAAA,CAAK,wBAAwB,CAAA,IAAK,CAAA;AAAA,MACnE,QAAA,EAAU;AAAA,KACX,CAAA;AAAA,EACH;AAEA,EAAA,GAAA,CAAI,QAAA,EAAU,YAAA,GAAe,UAAA,CAAW,MAAA,GAAS,wBAAwB,CAAA;AAEzE,EAAA,MAAM,MAAA,GAAS,MAAM,eAAA,CAAgB;AAAA,IACnC,QAAA;AAAA,IAAU,QAAA;AAAA,IAAU,KAAA,EAAO,UAAA;AAAA,IAAY,MAAA;AAAA,IAAQ,GAAA;AAAA,IAAK;AAAA,GACrD,CAAA;AACD,EAAA,MAAM,cAAA,uBAAqB,GAAA,EAAoB;AAC/C,EAAA,KAAA,MAAW,MAAM,MAAA,EAAQ;AACvB,IAAA,KAAA,MAAW,OAAO,EAAA,CAAG,WAAA,iBAA4B,GAAA,CAAI,GAAA,EAAK,GAAG,EAAE,CAAA;AAAA,EACjE;AACA,EAAA,KAAA,MAAW,IAAA,IAAQ,YAAY,IAAA,CAAK,QAAA,GAAW,eAAe,GAAA,CAAI,IAAA,CAAK,UAAU,CAAA,IAAK,EAAA;AAEtF,EAAA,GAAA,CAAI,UAAU,uBAAuB,CAAA;AAErC,EAAA,MAAM,mBAAA,GAAsB,QAAA,CAAS,MAAA,CAAO,CAAC,KAAK,CAAA,KAAM;AACtD,IAAA,MAAM,cAAA,GAAA,CAAkB,CAAA,CAAE,KAAA,IAAS,IAAI,MAAA,CAAO,CAAC,CAAA,EAAG,IAAA,KAAS,CAAA,IAAK,IAAA,CAAK,MAAA,EAAQ,iBAAA,IAAqB,KAAK,CAAC,CAAA;AACxG,IAAA,OAAO,GAAA,GAAM,cAAA;AAAA,EACf,GAAG,CAAC,CAAA;AAEJ,EAAA,MAAM,mBAAA,GAAsB,QAAA,CAAS,MAAA,CAAO,CAAC,GAAA,EAAK,MAAM,GAAA,IAAO,CAAA,CAAE,iBAAA,IAAqB,EAAA,CAAA,EAAK,CAAC,CAAA;AAE5F,EAAA,MAAM,sBAAA,uBAA6B,GAAA,EAAoB;AACvD,EAAA,KAAA,MAAW,QAAQ,UAAA,EAAY;AAC7B,IAAA,MAAM,IAAA,GAAO,KAAK,wBAAA,IAA4B,CAAA;AAC9C,IAAA,IAAI,OAAO,CAAA,EAAG;AACZ,MAAA,MAAM,QAAA,GAAW,sBAAA,CAAuB,GAAA,CAAI,IAAA,CAAK,UAAU,CAAA,IAAK,CAAA;AAChE,MAAA,sBAAA,CAAuB,IAAI,IAAA,CAAK,UAAA,EAAY,KAAK,GAAA,CAAI,QAAA,EAAU,IAAI,CAAC,CAAA;AAAA,IACtE;AAAA,EACF;AACA,EAAA,MAAM,kBAAA,GAAqB,KAAA,CAAM,IAAA,CAAK,sBAAA,CAAuB,MAAA,EAAQ,CAAA,CAAE,MAAA,CAAO,CAAC,CAAA,EAAG,CAAA,KAAM,CAAA,GAAI,GAAG,CAAC,CAAA;AAEhG,EAAA,OAAO;AAAA,IACL,WAAA,EAAa;AAAA,MACX,cAAA,EAAgB,CAAA;AAAA,MAChB,IAAA,EAAM,cAAA;AAAA,MACN,aAAA,EAAe,YAAA;AAAA,MACf,eAAA,EAAiB,cAAA;AAAA,MACjB,KAAA,EAAO,UAAA;AAAA,MACP,MAAA;AAAA,MACA,WAAA,EAAa,kCAAkC,MAAA,CAAO,MAAA,GAAS,cAAc,QAAA,CAAS,MAAA,GAAS,aAAA,GAAgB,QAAA,CAAS,MAAA,GAAS,WAAA;AAAA,MACjI,qBAAA,EAAuB,mBAAA;AAAA,MACvB,qBAAA,EAAuB,mBAAA;AAAA,MACvB,yBAAyB,mBAAA,GAAsB;AAAA,KACjD;AAAA,IACA;AAAA,GACF;AACF;AAUA,SAAS,eACP,IAAA,EACA,QAAA,EACA,QAAA,EACA,KAAA,EACA,UACA,GAAA,EACkD;AAClD,EAAA,MAAM,eAAA,GAAkB,IAAI,GAAA,CAAI,QAAA,CAAS,IAAI,CAAA,CAAA,KAAK,CAAA,CAAE,EAAE,CAAC,CAAA;AACvD,EAAA,MAAM,eAAA,GAAkB,IAAI,GAAA,CAAI,QAAA,CAAS,IAAI,CAAA,CAAA,KAAK,CAAA,CAAE,EAAE,CAAC,CAAA;AACvD,EAAA,MAAM,QAAA,uBAAe,GAAA,EAAsB;AAC3C,EAAA,KAAA,MAAW,KAAK,QAAA,EAAU,QAAA,CAAS,GAAA,CAAI,CAAA,CAAE,KAAK,CAAA,CAAE,aAAA,IAAiB,EAAC,EAAG,OAAO,CAAA,CAAA,KAAK,eAAA,CAAgB,GAAA,CAAI,CAAC,CAAC,CAAC,CAAA;AAExG,EAAA,MAAM,SAA6B,EAAC;AACpC,EAAA,MAAM,YAAA,uBAAmB,GAAA,EAAoB;AAC7C,EAAA,MAAM,aAAA,uBAAoB,GAAA,EAAoB;AAC9C,EAAA,MAAM,SAAmB,EAAC;AAE1B,EAAA,IAAA,CAAK,OAAA,CAAQ,CAAC,EAAA,EAAI,GAAA,KAAQ;AACxB,IAAA,MAAM,KAAK,MAAA,CAAO,EAAA,CAAG,EAAA,IAAO,IAAA,IAAQ,MAAM,CAAA,CAAG,CAAA;AAC7C,IAAA,MAAM,QAAQ,GAAA,GAAM,CAAA;AACpB,IAAA,MAAM,IAAA,GAAO,OAAO,EAAA,CAAG,IAAA,IAAS,WAAW,KAAM,CAAA,CAAE,KAAA,CAAM,CAAA,EAAG,EAAE,CAAA;AAC9D,IAAA,MAAM,oBAAoB,MAAA,CAAO,EAAA,CAAG,kBAAA,IAAsB,EAAE,EAAE,IAAA,EAAK;AACnE,IAAA,MAAM,aAAA,GAAgB,KAAA,CAAM,OAAA,CAAQ,EAAA,CAAG,WAAW,CAAA,GAAI,EAAA,CAAG,WAAA,CAAY,GAAA,CAAI,MAAM,CAAA,GAAI,EAAC;AACpF,IAAA,MAAM,SAAA,GAAY,MAAM,OAAA,CAAQ,EAAA,CAAG,UAAU,CAAA,GAAK,EAAA,CAAG,aAAgD,EAAC;AAEtG,IAAA,IAAI,CAAC,iBAAA,EAAmB;AACtB,MAAA,MAAA,CAAO,IAAA,CAAK,QAAA,GAAW,EAAA,GAAK,wFAAwF,CAAA;AAAA,IACtH;AAEA,IAAA,MAAM,qBAA+B,EAAC;AACtC,IAAA,KAAA,MAAW,OAAO,aAAA,EAAe;AAC/B,MAAA,IAAI,CAAC,eAAA,CAAgB,GAAA,CAAI,GAAG,CAAA,EAAG;AAC7B,QAAA,MAAA,CAAO,IAAA,CAAK,QAAA,GAAW,EAAA,GAAK,oBAAA,GAAuB,GAAG,CAAA;AACtD,QAAA;AAAA,MACF;AACA,MAAA,IAAI,YAAA,CAAa,GAAA,CAAI,GAAG,CAAA,EAAG;AACzB,QAAA,MAAA,CAAO,IAAA,CAAK,UAAA,GAAa,GAAA,GAAM,oBAAA,GAAuB,YAAA,CAAa,IAAI,GAAG,CAAA,GAAI,OAAA,GAAU,EAAA,GAAK,kDAAkD,CAAA;AAC/I,QAAA;AAAA,MACF;AACA,MAAA,YAAA,CAAa,GAAA,CAAI,KAAK,EAAE,CAAA;AACxB,MAAA,kBAAA,CAAmB,KAAK,GAAG,CAAA;AAAA,IAC7B;AAEA,IAAA,MAAM,gBAAuC,EAAC;AAC9C,IAAA,KAAA,MAAW,MAAM,SAAA,EAAW;AAC1B,MAAA,MAAM,GAAA,GAAM,MAAA,CAAO,EAAA,CAAG,UAAA,IAAc,EAAE,CAAA;AACtC,MAAA,IAAI,CAAC,eAAA,CAAgB,GAAA,CAAI,GAAG,CAAA,EAAG;AAC7B,QAAA,MAAA,CAAO,IAAA,CAAK,QAAA,GAAW,EAAA,GAAK,+BAAA,GAAkC,GAAG,CAAA;AACjE,QAAA;AAAA,MACF;AACA,MAAA,MAAM,SAAS,MAAA,CAAO,EAAA,CAAG,UAAU,KAAK,CAAA,KAAM,aAAa,UAAA,GAAa,KAAA;AACxE,MAAA,IAAI,WAAW,UAAA,EAAY;AACzB,QAAA,MAAM,KAAA,GAAQ,aAAA,CAAc,GAAA,CAAI,GAAG,CAAA;AACnC,QAAA,IAAI,UAAU,MAAA,EAAW;AACvB,UAAA,MAAA,CAAO,IAAA,CAAK,QAAA,GAAW,EAAA,GAAK,6BAAA,GAAgC,MAAM,oEAAoE,CAAA;AACtI,UAAA;AAAA,QACF;AACA,QAAA,IAAI,SAAS,KAAA,EAAO;AAClB,UAAA,MAAA,CAAO,KAAK,QAAA,GAAW,EAAA,GAAK,6BAAA,GAAgC,GAAA,GAAM,oDAAoD,KAAK,CAAA;AAC3H,UAAA;AAAA,QACF;AAAA,MACF,CAAA,MAAA,IAAW,aAAA,CAAc,GAAA,CAAI,GAAG,CAAA,EAAG;AACjC,QAAA,MAAA,CAAO,IAAA,CAAK,QAAA,GAAW,EAAA,GAAK,kCAAA,GAAqC,GAAA,GAAM,mCAAmC,aAAA,CAAc,GAAA,CAAI,GAAG,CAAA,GAAI,GAAG,CAAA;AACtI,QAAA;AAAA,MACF,CAAA,MAAO;AACL,QAAA,aAAA,CAAc,GAAA,CAAI,KAAK,KAAK,CAAA;AAAA,MAC9B;AACA,MAAA,KAAA,MAAW,OAAO,QAAA,CAAS,GAAA,CAAI,GAAG,CAAA,IAAK,EAAC,EAAG;AACzC,QAAA,IAAI,CAAC,aAAA,CAAc,GAAA,CAAI,GAAG,CAAA,EAAG;AAC3B,UAAA,MAAA,CAAO,KAAK,QAAA,GAAW,EAAA,GAAK,eAAe,GAAA,GAAM,sCAAA,GAAyC,MAAM,kDAAkD,CAAA;AAAA,QACpJ;AAAA,MACF;AACA,MAAA,aAAA,CAAc,IAAA,CAAK,EAAE,UAAA,EAAY,GAAA,EAAK,MAAA,EAAQ,IAAA,EAAM,MAAA,CAAO,EAAA,CAAG,IAAA,IAAQ,EAAE,CAAA,EAAG,CAAA;AAAA,IAC7E;AAEA,IAAA,MAAA,CAAO,IAAA,CAAK;AAAA,MACV,EAAA;AAAA,MAAI,KAAA;AAAA,MAAO,IAAA;AAAA,MACX,kBAAA,EAAoB,iBAAA;AAAA,MACpB,WAAA,EAAa,kBAAA;AAAA,MACb,UAAA,EAAY;AAAA,KACb,CAAA;AAAA,EACH,CAAC,CAAA;AAED,EAAA,MAAM,OAAA,GAAU,QAAA,CAAS,GAAA,CAAI,CAAA,CAAA,KAAK,CAAA,CAAE,EAAE,CAAA,CAAE,MAAA,CAAO,CAAA,GAAA,KAAO,CAAC,YAAA,CAAa,GAAA,CAAI,GAAG,CAAC,CAAA;AAC5E,EAAA,IAAI,OAAA,CAAQ,SAAS,CAAA,EAAG;AACtB,IAAA,MAAA,CAAO,IAAA,CAAK,sCAAA,GAAyC,OAAA,CAAQ,IAAA,CAAK,IAAI,CAAC,CAAA;AAAA,EACzE;AACA,EAAA,MAAM,kBAAA,uBAAyB,GAAA,EAAoB;AACnD,EAAA,MAAM,mBAAA,uBAA0B,GAAA,EAAoB;AACpD,EAAA,KAAA,MAAW,EAAA,IAAM,MAAA,EAAQ,KAAA,MAAW,GAAA,IAAO,EAAA,CAAG,aAAa,mBAAA,CAAoB,GAAA,CAAI,GAAA,EAAK,EAAA,CAAG,KAAK,CAAA;AAChG,EAAA,KAAA,MAAW,KAAK,KAAA,EAAO;AACrB,IAAA,MAAM,EAAA,GAAK,mBAAA,CAAoB,GAAA,CAAI,CAAA,CAAE,UAAU,CAAA;AAC/C,IAAA,IAAI,OAAO,MAAA,EAAW;AACtB,IAAA,MAAM,GAAA,GAAM,kBAAA,CAAmB,GAAA,CAAI,CAAA,CAAE,UAAU,CAAA;AAC/C,IAAA,IAAI,GAAA,KAAQ,UAAa,EAAA,GAAK,GAAA,qBAAwB,GAAA,CAAI,CAAA,CAAE,YAAY,EAAE,CAAA;AAAA,EAC5E;AACA,EAAA,KAAA,MAAW,CAAC,GAAA,EAAK,aAAa,CAAA,IAAK,kBAAA,EAAoB;AACrD,IAAA,MAAM,KAAA,GAAQ,aAAA,CAAc,GAAA,CAAI,GAAG,CAAA;AACnC,IAAA,IAAI,UAAU,MAAA,EAAW;AACvB,MAAA,MAAA,CAAO,IAAA,CAAK,UAAA,GAAa,GAAA,GAAM,0BAAA,GAA6B,gBAAgB,oCAAoC,CAAA;AAAA,IAClH,CAAA,MAAA,IAAW,QAAQ,aAAA,EAAe;AAChC,MAAA,MAAA,CAAO,KAAK,UAAA,GAAa,GAAA,GAAM,0BAA0B,KAAA,GAAQ,+BAAA,GAAkC,gBAAgB,2DAA2D,CAAA;AAAA,IAChL;AAAA,EACF;AAEA,EAAA,OAAO,EAAE,QAAQ,MAAA,EAAO;AAC1B;AAEA,eAAe,gBAAgB,IAAA,EAAwD;AACrF,EAAA,MAAM,EAAE,QAAA,EAAU,QAAA,EAAU,OAAO,MAAA,EAAQ,GAAA,EAAK,UAAS,GAAI,IAAA;AAE7D,EAAA,MAAM,cAAc,QAAA,CAAS,GAAA;AAAA,IAAI,CAAA,CAAA,KAC/B,IAAA,GAAO,CAAA,CAAE,EAAA,GAAK,IAAA,GAAO,CAAA,CAAE,IAAA,GAAO,KAAA,GAAA,CAAS,CAAA,CAAE,WAAA,IAAe,EAAA,EAAI,KAAA,CAAM,GAAG,GAAG;AAAA,GAC1E,CAAE,KAAK,IAAI,CAAA;AAEX,EAAA,MAAM,cAAc,QAAA,CAAS,GAAA;AAAA,IAAI,CAAA,CAAA,KAC/B,IAAA,GAAO,CAAA,CAAE,EAAA,GAAK,OAAO,CAAA,CAAE,IAAA,GAAO,mBAAA,IAAA,CAAwB,CAAA,CAAE,iBAAiB,EAAC,EAAG,IAAA,CAAK,IAAI,KAAK,MAAA,CAAA,GAAU;AAAA,GACvG,CAAE,KAAK,IAAI,CAAA;AAEX,EAAA,MAAM,WAAW,KAAA,CAAM,GAAA;AAAA,IAAI,CAAA,CAAA,KACzB,OAAO,CAAA,CAAE,UAAA,GAAa,SAAS,CAAA,CAAE,UAAA,GAAa,IAAA,GAAO,CAAA,CAAE,KAAA,GAAQ;AAAA,GACjE,CAAE,IAAA,CAAK,IAAI,CAAA,IAAK,QAAA;AAEhB,EAAA,MAAM,YAAA,GACJ,+5CAAA;AAqBF,EAAA,MAAM,iBAAiB,aAAA,GAAgB,WAAA,GAAc,iBAAA,GAAoB,WAAA,GACrE,iCAAiC,QAAA,GAAW,mLAAA;AAKhD,EAAA,MAAM,sBAAA,GAAyB,CAAA;AAC/B,EAAA,IAAI,cAAwB,EAAC;AAC7B,EAAA,IAAI,SAA6B,EAAC;AAClC,EAAA,IAAI,YAA4C,EAAC;AACjD,EAAA,KAAA,IAAS,OAAA,GAAU,CAAA,EAAG,OAAA,IAAW,sBAAA,EAAwB,OAAA,EAAA,EAAW;AAClE,IAAA,MAAM,UAAA,GAAa,OAAA,KAAY,CAAA,GAC3B,cAAA,GACA,iBACE,yEAAA,GACA,WAAA,CAAY,GAAA,CAAI,CAAC,MAAM,IAAA,GAAO,CAAC,CAAA,CAAE,IAAA,CAAK,IAAI,CAAA,GAC1C,2CAAA;AAEN,IAAA,MAAM,MAAA,GAAS,MAAM,WAAA,CAAY,MAAA,EAAQ,cAAc,UAAA,EAAY;AAAA,MACjE,WAAA,EAAa,GAAA;AAAA,MACb,SAAA,EAAW;AAAA,KACZ,CAAA;AAED,IAAA,SAAA,GAAa,MAAA,CAAO,UAAU,EAAC;AAC/B,IAAA,IAAI,SAAA,CAAU,WAAW,CAAA,EAAG;AAC1B,MAAA,IAAI,YAAY,sBAAA,EAAwB;AACtC,QAAA,MAAM,IAAI,MAAM,8DAA8D,CAAA;AAAA,MAChF;AACA,MAAA,WAAA,GAAc,CAAC,sBAAsB,CAAA;AACrC,MAAA;AAAA,IACF;AAEA,IAAA,CAAC,EAAE,MAAA,EAAQ,MAAA,EAAQ,WAAA,EAAY,GAAI,cAAA,CAAe,SAAA,EAAW,QAAA,EAAU,QAAA,EAAU,KAAoB,CAAA;AACrG,IAAA,IAAI,WAAA,CAAY,WAAW,CAAA,EAAG;AAC9B,IAAA,IAAI,UAAU,sBAAA,EAAwB;AACpC,MAAA,GAAA,CAAI,QAAA,EAAU,0BAA0B,WAAA,CAAY,MAAA,GAAS,6BAA6B,OAAA,GAAU,CAAA,CAAA,GAAK,GAAA,GAAM,sBAAA,GAAyB,GAAG,CAAA;AAAA,IAC7I;AAAA,EACF;AACA,EAAA,IAAI,WAAA,CAAY,SAAS,CAAA,EAAG;AAC1B,IAAA,MAAM,IAAI,KAAA;AAAA,MACR,oEAAA,GAAuE,WAAA,CAAY,MAAA,GAAS,eAAA,GAC1F,WAAA,CAAY,GAAA,CAAI,CAAC,CAAA,KAAM,MAAA,GAAS,CAAC,CAAA,CAAE,IAAA,CAAK,IAAI,CAAA,GAC5C;AAAA,KACJ;AAAA,EACF;AAEA,EAAA,IAAI,MAAA,CAAO,MAAA,KAAW,CAAA,IAAK,QAAA,CAAS,SAAS,CAAA,EAAG;AAC9C,IAAA,QAAA,CAAS,IAAA,CAAK,qBAAA,GAAwB,QAAA,CAAS,MAAA,GAAS,yDAAyD,CAAA;AAAA,EACnH;AAEA,EAAA,GAAA,CAAI,QAAA,EAAU,qBAAqB,MAAA,CAAO,MAAA,GAAS,cAC/C,MAAA,CAAO,GAAA,CAAI,CAAA,CAAA,KAAK,CAAA,CAAE,EAAA,GAAK,GAAA,GAAM,EAAE,WAAA,CAAY,MAAA,GAAS,OAAO,CAAA,CAAE,UAAA,CAAW,SAAS,IAAI,CAAA,CAAE,IAAA,CAAK,IAAI,CAAC,CAAA;AACrG,EAAA,OAAO,MAAA;AACT","file":"chunk-3VVPSRAM.mjs","sourcesContent":["/**\n * LO code + statement standard — calibrated against the production\n * learning_objectives table (6,693 live rows) and the knowledge-tree\n * Naming Conventions v2.2 (Appendix C of adaptive-learning-platform.md).\n *\n * Codes (deterministic, never LLM-generated):\n *   concept  CONCEPT_CODE            UPPER_SNAKE_CASE, technology-neutral\n *   ULO      ULO-[CONCEPT]-NN        one primary ULO per concept (NN = 01)\n *   CIO      CIO-[CONCEPT]-NN-[ACTION]  parent = ULO, ACTION = SNAKE verb phrase\n *   SIO      SIO-[TECH]-[CONCEPT]-NN    only tier carrying a tech tag (PY, SW, TS...)\n *\n * Statements: every LO description uses the normalized clause\n *   \"The learner will be able to ...\"  (production Supabase style).\n */\n\n// ─── Technology tag (SIO tier only) ─────────────────────────────────────────\n\nconst TECH_TAG_MAP: Record<string, string> = {\n  python: \"PY\", swift: \"SW\", typescript: \"TS\", javascript: \"JV\", java: \"JAVA\",\n  kotlin: \"KT\", go: \"GO\", rust: \"RUST\", csharp: \"CS\", cpp: \"CPP\", dart: \"DT\",\n  php: \"PHP\", ruby: \"RB\", sql: \"SQL\", html: \"HTML\", css: \"CSS\",\n};\n\n/** Map a tech stack string to the production SIO tech tag (PY, SW, TS...). */\nexport function techTagFor(techStack: string): string {\n  const primary = (techStack || \"\").trim().toLowerCase();\n  for (const [key, tag] of Object.entries(TECH_TAG_MAP)) {\n    if (primary.includes(key)) return tag;\n  }\n  const first = primary.split(/[\\s,+/]+/)[0] ?? \"\";\n  if (!/^[a-z]/.test(first)) return \"GEN\";\n  return first.length <= 4 ? first.toUpperCase() : first.slice(0, 3).toUpperCase();\n}\n\n// ─── Concept code (UPPER_SNAKE_CASE, neutral) ───────────────────────────────\n\nconst SMALL_WORDS = new Set([\"and\", \"or\", \"the\", \"of\", \"for\", \"in\", \"on\", \"a\", \"an\", \"vs\"]);\n\n/** Derive a neutral UPPER_SNAKE_CASE concept code from a human concept name. */\nexport function conceptCodeFromName(name: string): string {\n  const words = name\n    .replace(/[^A-Za-z0-9]+/g, \" \")\n    .trim()\n    .split(/\\s+/)\n    .filter((w) => w.length > 0 && !SMALL_WORDS.has(w.toLowerCase()));\n  const base = words.join(\"_\").toUpperCase().replace(/^_+|_+$/g, \"\").replace(/_{2,}/g, \"_\");\n  const trimmed = (base || \"CONCEPT\").slice(0, 60).replace(/_+$/g, \"\");\n  return trimmed;\n}\n\n/**\n * Assign unique concept codes to every concept (first occurrence keeps the\n * plain code, later collisions get a _2.._N suffix) — mirrors the DB where\n * concept_codes are unique neutral UPPER_SNAKE keys.\n */\nexport function assignConceptCodes(concepts: Array<{ id: string; name: string }>): Record<string, string> {\n  const used = new Map<string, number>();\n  const out: Record<string, string> = {};\n  for (const c of concepts) {\n    const base = conceptCodeFromName(c.name);\n    const n = (used.get(base) ?? 0) + 1;\n    used.set(base, n);\n    out[c.id] = n === 1 ? base : base + \"_\" + n;\n  }\n  return out;\n}\n\n// ─── LO codes ───────────────────────────────────────────────────────────────\n\nconst pad2 = (n: number): string => String(n).padStart(2, \"0\");\n\nexport function uloCode(conceptCode: string, seq = 1): string {\n  return \"ULO-\" + conceptCode + \"-\" + pad2(seq);\n}\n\nconst CIO_STOPWORDS = new Set([\n  // clause boilerplate\n  \"learner\", \"will\", \"be\", \"able\",\n  // generic fillers\n  \"a\", \"an\", \"the\", \"of\", \"to\", \"and\", \"or\", \"in\", \"on\", \"for\", \"by\", \"with\",\n  \"is\", \"are\", \"that\", \"it\", \"its\", \"their\", \"when\", \"how\", \"as\", \"into\", \"from\",\n]);\n\n/** Extract a short SNAKE_CASE action phrase (2-4 content words) for a CIO code. */\nexport function cioActionSlug(cioText: string): string {\n  const body = cioText.startsWith(LEARNER_CLAUSE) ? cioText.slice(LEARNER_CLAUSE.length) : cioText;\n  const words = body.replace(/[^A-Za-z0-9]+/g, \" \").trim().split(/\\s+/)\n    .map((w) => w.toLowerCase())\n    .filter((w) => w.length > 2 && !CIO_STOPWORDS.has(w));\n  const seen = new Set<string>();\n  const picked: string[] = [];\n  for (const w of words) {\n    if (!seen.has(w)) { seen.add(w); picked.push(w); }\n    if (picked.length === 3) break;\n  }\n  return (picked.length > 0 ? picked : [\"apply\"]).join(\"_\").toUpperCase();\n}\n\nexport function cioCode(conceptCode: string, uloSeq: number, actionSlug: string): string {\n  return \"CIO-\" + conceptCode + \"-\" + pad2(uloSeq) + \"-\" + actionSlug;\n}\n\nexport function sioCode(techTag: string, conceptCode: string, seq: number): string {\n  return \"SIO-\" + techTag + \"-\" + conceptCode + \"-\" + pad2(seq);\n}\n\n// ─── Standard statement clause ──────────────────────────────────────────────\n\nexport const LEARNER_CLAUSE = \"The learner will be able to \";\n\n/** Normalize any LO text into the production statement form with the standard clause. */\nexport function standardStatement(text: string): string {\n  let body = (text || \"\").trim().replace(/^the learner (will be able to|can)\\s*/i, \"\").replace(/\\s+/g, \" \");\n  if (body.length === 0) return \"\";\n  // Lowercase a leading word unless it looks like an acronym/proper code (X.Y or ALLCAPS).\n  const firstWord = body.split(\" \")[0] ?? \"\";\n  const looksAcronym = /^[A-Z0-9_.`]+$/.test(firstWord) && firstWord.length > 1;\n  if (!looksAcronym) body = body.charAt(0).toLowerCase() + body.slice(1);\n  body = body.replace(/[.\\s]+$/, \"\");\n  return LEARNER_CLAUSE + body + \".\";\n}\n\n// ─── Regex validators (calibrated to the live DB patterns) ─────────────────\n\nexport const CONCEPT_CODE_RE = /^[A-Z][A-Z0-9_]*$/;\nexport const ULO_CODE_RE = /^ULO-[A-Z][A-Z0-9_]*-\\d{2}$/;\nexport const CIO_CODE_RE = /^CIO-[A-Z][A-Z0-9_]*-\\d{2}-[A-Z][A-Z0-9_]*$/;\nexport const SIO_CODE_RE = /^SIO-[A-Z0-9]+-[A-Z][A-Z0-9_]*-\\d{2}$/;\n","/**\n * Exemplar bank for hierarchical LO authoring.\n * ULO/CIO exemplars ported from knowledge-tree master_learning_objectives.tsv\n * (approved reference bank). SIO exemplars follow the same style as judged-PASS\n * items from real pipeline runs: keyword-bound, completable, context-specific.\n */\n\nexport const ULO_EXEMPLARS: string[] = [\n  // Calibrated against production learning_objectives (UNIVERSAL rows, neutral)\n  \"The learner will be able to recall the key concepts, terminology, and characteristics of layers of abstraction.\",\n  \"The learner will be able to explain how layers of abstraction hide implementation details while exposing essential behavior.\",\n  \"The learner will be able to explain how a program changes state through statements and control flow.\",\n  \"The learner will be able to differentiate local from global scope and describe how return values affect data flow.\",\n  \"The learner will be able to describe the mechanism of a loop, including its condition, step and stopping rule.\",\n  \"The learner will be able to explain why a representation format must balance readability against processing efficiency.\",\n];\n\nexport const CIO_EXEMPLARS: string[] = [\n  // Production CONCEPTUAL_IMPL rows: mechanism behind the clause, Marr 2-Language neutral\n  \"The learner will be able to develop a conceptual model that explains the internal mechanism by which the representation produces its effect.\",\n  \"The learner will be able to compare alternative approaches for the same operation and describe the trade-offs between them.\",\n  \"The learner will be able to decompose the choice of representation into decisive criteria such as cost, fidelity and tolerance to change.\",\n  \"The learner will be able to describe the sequence of steps by which a process transforms its input into its output, including the stopping condition.\",\n];\n\nexport const SIO_EXEMPLARS: string[] = [\n  // Production SPECIFIC_IMPL style: keyword-bound completable tasks, tech-tagged tier\n  \"The learner will be able to use argparse.ArgumentParser with add_subparsers to register add, done and list commands in a Python CLI.\",\n  \"The learner will be able to define a @dataclass with type hints and a __post_init__ method that raises ValueError on invariant violation.\",\n  \"The learner will be able to execute parameterized statements via sqlite3.Connection.execute inside a with conn: transaction to perform CRUD on a tasks table.\",\n  \"The learner will be able to write a pytest test that runs the CLI entry point via subprocess.run and asserts the exit code and printed output.\",\n];\n","/**\n * Deterministic ULO/CIO/SIO Contract Audit.\n *\n * Code-level checks that do NOT trust the LLM: they measure whether generated\n * depth layers satisfy the structural part of the authoring contract.\n * Ported context: knowledge-tree lo_quality/proof_tiers philosophy — generate\n * and verify are separate concerns; verification must be deterministic-first.\n */\nimport { LEARNER_CLAUSE, CONCEPT_CODE_RE, ULO_CODE_RE, CIO_CODE_RE, SIO_CODE_RE } from \"./loCodeStandard.js\";\n\n// --- Deterministic ULO/CIO/SIO Contract Audit ---------------------------------\n// Code-level checks that do NOT trust the LLM: they measure whether generated\n// depth layers satisfy the structural part of the authoring contract. The LLM\n// judge (semantic quality) complements these; it never replaces them.\n\n/** Concrete-technology signals: snake/camel identifiers, file extensions, tech acronyms. */\nconst TECH_SIGNAL_RES: RegExp[] = [\n  /`[^`]+`/,\n  /\\b[a-zA-Z_][A-Za-z0-9_]*\\(\\)/,\n  // call-with-arguments: Status(enum.Enum), field(default_factory=list)\n  /\\b[A-Za-z_][A-Za-z0-9_]*\\([^)]+\\)/,\n  // attribute access glued to a value: enum.Enum, os.path, tasks.json\n  /[A-Za-z0-9_)\\]]\\.[A-Za-z_][A-Za-z0-9_]+/,\n  /[a-z]+_[a-z]+/,\n  /[a-z]+[A-Z][A-Za-z]*/,\n  /\\.[a-z]{2,4}\\b/,\n  /\\b(?:API|SDK|JSON|XML|YAML|HTTP|SQL|UUID|URL|DOM|CLI|TUI|CSV|UTF|CRUD|DSL)\\b/,\n  // Exception/error class names: Exception, ValueError, CustomError\n  /\\b[A-Z][a-zA-Z0-9_]*(?:Error|Exception|Warning|Fault)\\b/,\n  // class declarations or references: class Status, static methods on types\n  /\\bclass\\s+[A-Za-z_][A-Za-z0-9_]*/,\n  // inheritance/derivation mentions: inheriting from Exception, subclass of Base\n  /\\b(?:inherit(?:ing|s)?|subclass(?:ing)?|deriv(?:ing|ed|es)?)\\s+(?:from|of)\\s+[A-Z][A-Za-z0-9_]*/,\n];\n\n/** Single-letter matches to ignore. */\nconst GENERIC_STOP = new Set([\"e\", \"g\", \"i\"]);\n\nfunction techSignalHits(text: string): string[] {\n  const hits: string[] = [];\n  for (const re of TECH_SIGNAL_RES) {\n    const found = text.match(new RegExp(re.source, \"g\")) ?? [];\n    for (const m of found) if (!GENERIC_STOP.has(m.toLowerCase())) hits.push(m);\n  }\n  return hits;\n}\n\nexport interface DepthLayerAudit {\n  conceptId: string;\n  uloHasTechSignals: boolean;\n  uloTechSignals: string[];\n  uloHasImplementationVerbs: boolean;\n  sioAllKeywordBound: boolean;\n  sioUnboundItems: string[];\n  sioConceptKeywordBound: boolean;\n  sioOffConceptItems: string[];\n  sioAllCompletable: boolean;\n  sioNotCompletable: string[];\n  concretenessIncreases: boolean;\n  clauseOk: boolean;\n  codesOk: boolean;\n  codeIssues: string[];\n  passed: boolean;\n}\n\nexport function auditDepthLayers(\n  concepts: Array<{\n    id: string; name?: string; ulo?: string; cio?: string; sio?: string[];\n    code?: string; ulo_code?: string; cio_code?: string; sio_codes?: string[];\n    keywords?: string[];\n  }>,\n): DepthLayerAudit[] {\n  return concepts.map((c) => {\n    const ulo = (c.ulo ?? \"\").trim();\n    const cio = (c.cio ?? \"\").trim();\n    const sioItems = (c.sio ?? []).map((s) => (s ?? \"\").trim()).filter(Boolean);\n    const uloTechSignals = techSignalHits(ulo);\n    const uloHasTechSignals = uloTechSignals.length > 0;\n    const IMPL_VERBS = /\\b(implement|refactor|debug|serialize)\\b/i;\n    const uloHasImplementationVerbs = IMPL_VERBS.test(ulo);\n    const registryKeywords = (c.keywords ?? []).map((k) => String(k).toLowerCase()).filter((k) => k.length >= 3);\n  // Concept identity tokens fall back to the concept NAME when the registry is\n  // narrow: an SIO that names the concept's own subject is on-concept.\n  const nameTokens = String(c.name ?? \"\").toLowerCase().split(/[^a-z0-9]+/).filter((w) => w.length >= 4);\n  const boundToConcept = (s: string): boolean => {\n    const lower = s.toLowerCase();\n    return registryKeywords.some((k) => lower.includes(k)) || nameTokens.some((w) => lower.includes(w));\n  };\n  const sioUnboundItems = sioItems.filter((s) => {\n    if (techSignalHits(s).length > 0) return false;\n    // Bare tool/technology names (pytest, capsys, python -m build) carry no\n    // punctuation signal — the concept keyword registry is the binding source.\n    return !boundToConcept(s);\n  });\n    // Concept-keyword binding: at least one SIO item must reference a keyword\n    // FROM THIS CONCEPT's registry (not just any tech signal). Skipped when the\n    // caller provides no keyword registry.\n    const conceptKeywords = (c.keywords ?? []).map((k) => k.toLowerCase()).filter(Boolean);\n    const sioOffConceptItems = conceptKeywords.length > 0\n      ? sioItems.filter((s) => !boundToConcept(s))\n      : [];\n    const COMPLETABLE = /\\b(build|create|implement|write|configure|add|use|apply|display|store|load|save|handle|parse|validate|test|register|compute|generate|print|format|convert|extend|define|execute|run|read|fetch|wrap|log|call|raise|install|import|export|declare|embed|model|represent|override|customize|enforce|mock|assert|query|index|cache|stream|split|join|strip|encode|decode|traverse|measure|evaluate|benchmark|diagnose|demonstrate|verify|organize|structure|choose|select|compare|distinguish|attach|annotate|expose|accept|manage|group|sort|filter|map|reduce|catch|throw|migrate|inspect|trace|parameterize|construct|design|capture)\\b/i;\n    const sioNotCompletable = sioItems.filter((s) => !COMPLETABLE.test(s) && !/`[^`]+`/.test(s));\n    const density = (text: string): number => {\n      if (!text) return 0;\n      return (techSignalHits(text).length / Math.max(1, text.split(/\\s+/).length)) * 100;\n    };\n    const dUlo = density(ulo);\n    const dCio = density(cio);\n    const dSio = sioItems.length > 0 ? Math.max(...sioItems.map(density)) : 0;\n    const concretenessIncreases = dSio > dUlo;\n    // Naming Conventions v2.2 + production statement clause checks\n    const clauseOk =\n      ulo.startsWith(LEARNER_CLAUSE) &&\n      cio.startsWith(LEARNER_CLAUSE) &&\n      sioItems.every((t) => t.startsWith(LEARNER_CLAUSE));\n    const codeIssues: string[] = [];\n    const conceptCode = (c as { code?: string }).code;\n    if (conceptCode !== undefined && !CONCEPT_CODE_RE.test(conceptCode)) codeIssues.push(\"concept code not UPPER_SNAKE: \" + conceptCode);\n    const uloCodeVal = (c as { ulo_code?: string }).ulo_code;\n    if (uloCodeVal !== undefined && uloCodeVal !== \"\" && !ULO_CODE_RE.test(uloCodeVal)) codeIssues.push(\"ULO code malformed: \" + uloCodeVal);\n    const cioCodeVal = (c as { cio_code?: string }).cio_code;\n    if (cioCodeVal !== undefined && cioCodeVal !== \"\" && !CIO_CODE_RE.test(cioCodeVal)) codeIssues.push(\"CIO code malformed: \" + cioCodeVal);\n    const sioCodeVals = (c as { sio_codes?: string[] }).sio_codes;\n    if (sioCodeVals !== undefined) {\n      if (sioCodeVals.length !== sioItems.length) codeIssues.push(\"SIO codes count mismatch\");\n      for (const sc of sioCodeVals) if (!SIO_CODE_RE.test(sc)) codeIssues.push(\"SIO code malformed: \" + sc);\n    }\n    const codesOk = codeIssues.length === 0;\n    const passed =\n      !uloHasTechSignals &&\n      !uloHasImplementationVerbs &&\n      sioUnboundItems.length === 0 &&\n      sioOffConceptItems.length === 0 &&\n      sioNotCompletable.length === 0 &&\n      concretenessIncreases &&\n      clauseOk &&\n      codesOk;\n    return {\n      conceptId: c.id,\n      uloHasTechSignals,\n      uloTechSignals,\n      uloHasImplementationVerbs,\n      sioAllKeywordBound: sioUnboundItems.length === 0,\n      sioUnboundItems,\n      sioConceptKeywordBound: sioOffConceptItems.length === 0,\n      sioOffConceptItems,\n      sioAllCompletable: sioNotCompletable.length === 0,\n      sioNotCompletable,\n      concretenessIncreases,\n      clauseOk,\n      codesOk,\n      codeIssues,\n      passed,\n    };\n  });\n}","/**\n * Hierarchical LO authoring — ported from knowledge-tree\n * (.agents/skills/learning-objective-generator/llm_generate_hierarchical_lo.py).\n *\n * Original architecture (3 independent phases, each gated before the next):\n *   Phase A: ULOs from concepts — core competency (WHAT + WHY), technology-\n *            agnostic, Cognitive Ceiling + Pragmatic Verb Mapping.\n *   Phase B: CIOs from approved ULOs — mechanism (HOW), Marr 2-Language Test.\n *   Phase C: SIOs from approved CIOs — keyword-bound implementation tasks.\n *\n * Depth policy (user-approved contract, differs from original Bloom ceiling):\n *   - ULO/CIO bind to the CONCEPT nature; ULO typically Remember/Understand.\n *   - SIO binds to KEYWORDS; Apply/Analyze/Create are assessed INDIRECTLY\n *     through completing SIO in concrete context (no fixed Bloom ceiling).\n *\n * Deterministic audit (depthAudit.ts) gates every phase; a failing phase\n * triggers one targeted repair round, then hard-fails (no silent fallback).\n */\nimport { LEARNER_CLAUSE, standardStatement } from \"./loCodeStandard.js\";\nimport { ULO_EXEMPLARS, CIO_EXEMPLARS, SIO_EXEMPLARS } from './loExemplars';\nimport { auditDepthLayers, type DepthLayerAudit } from './depthAudit';\nimport { parseJsonFromLlm, type LlmClient } from '../utils/llmClient';\n\nexport interface HierarchicalLoConceptInput {\n  keywords?: string[];\n  id: string;\n  name: string;\n  description?: string;\n}\n\nexport interface HierarchicalLoResult {\n  uloByConcept: Record<string, string>;\n  cioByConcept: Record<string, string>;\n  sioByConcept: Record<string, string[]>;\n  audits: DepthLayerAudit[];\n  warnings: string[];\n}\n\nfunction excerpt(text: string | undefined, max: number): string {\n  const t = (text || \"\").trim();\n  return t.length > max ? t.slice(0, max) + \"...\" : t;\n}\n\nasync function chatJson(\n  client: LlmClient,\n  system: string,\n  user: string,\n): Promise<Record<string, unknown>> {\n  const r = await client.chat(\n    [{ role: \"system\", content: system }, { role: \"user\", content: user }],\n    { temperature: 0.1, maxTokens: parseInt(process.env.KG_MAX_TOKENS || \"65536\", 10) },\n  );\n  return parseJsonFromLlm(r.content) as Record<string, unknown>;\n}\n\n// Batch size for per-phase LLM calls: large single batches risk output truncation\n// (reasoning tokens count against max_tokens) — 6 concepts per call keeps each\n// response comfortably inside budget.\nconst LO_BATCH_SIZE = 6;\nfunction chunkConcepts<T>(items: T[], size: number): T[][] {\n  const out: T[][] = [];\n  for (let i = 0; i < items.length; i += size) out.push(items.slice(i, i + size));\n  return out;\n}\n\nconst JSON_ONLY = \"Return EXACTLY JSON. No markdown, no explanations.\";\n\nexport async function authorDepthLayersHierarchically(\n  client: LlmClient,\n  concepts: Array<HierarchicalLoConceptInput>,\n  techStack: string,\n  warnings: string[],\n): Promise<HierarchicalLoResult> {\n  const uloByConcept: Record<string, string> = {};\n  const cioByConcept: Record<string, string> = {};\n  const sioByConcept: Record<string, string[]> = {};\n\n  const conceptList = concepts\n    .map((c) => \"- \" + c.id + \": \" + c.name + (c.description ? \" — \" + excerpt(c.description, 160) : \"\"))\n    .join(\"\\n\");\n\n  // ── Phase A: ULO (WHAT + WHY, concept-bound, technology-agnostic) ──\n  const uloSystem = [\n    \"You are a Curriculum Design Expert writing Universal Learning Objectives (ULO).\",\n    \"\",\n    \"ULO = Computational Tier: the CORE COMPETENCY — WHAT the concept is and WHY it exists —\",\n    \"completely independent of any technology, language, framework, library, file format or tool.\",\n    \"\",\n    \"Rules:\",\n    \"1. NEVER mention a concrete technology, API, library, file name or syntax in a ULO.\",\n    \"2. Bind the ULO to the concept intrinsic nature: the problem it solves in principle.\",\n    \"3. Typical assessment level: Remember or Understand. Use pragmatic, measurable verbs\",\n    \"   (Explain, Differentiate, Identify, Describe) instead of Know/Understand/Summarize.\",\n    \"4. Cognitive Ceiling: do NOT force Analyze/Evaluate/Create ULOs — if the concept is\",\n    \"   foundational, its core competency is low-level. Higher levels are exercised later\",\n    \"   INDIRECTLY through implementation work, not in the ULO itself.\",\n    \"5. One ULO per concept; 1-2 sentences covering WHAT + WHY.\",\n    \"6. Statement form (mandatory): every ULO MUST read 'The learner will be able to ...' —\",\n    \"   a lowercase actionable verb follows the clause (explain ..., differentiate ...).\",\n    \"   Do not prefix any other phrasing.\",\n    \"\",\n    \"Approved style exemplars (production bank):\",\n    ULO_EXEMPLARS.map((e) => \"- \" + e).join(\"\\n\"),\n    \"\",\n    JSON_ONLY,\n  ].join(\"\\n\");\n  const uloUser = [\n    \"Concepts:\",\n    conceptList,\n\n    \"\",\n    \"Return JSON:\",\n    '{\"ulos\":[{\"concept_id\":\"C1\",\"ulo\":\"...\"}]}',\n  ].join(\"\\n\");\n  for (const batch of chunkConcepts(concepts, LO_BATCH_SIZE)) {\n    const batchList = batch\n      .map((c) => \"- \" + c.id + \" (\" + c.name + \")\" + (c.description ? \": \" + excerpt(c.description, 160) : \"\"))\n      .join(\"\\n\");\n    const batchUser = \"Concepts:\\n\" + batchList + \"\\n\\nReturn JSON:\\n\" + '{\"ulos\":[{\"concept_id\":\"C1\",\"ulo\":\"...\"}]}';\n    const uloRes = await chatJson(client, uloSystem, batchUser);\n    for (const u of (uloRes.ulos ?? []) as Array<{ concept_id?: string; ulo?: string }>) {\n      if (u.concept_id && u.ulo) uloByConcept[u.concept_id] = standardStatement(u.ulo);\n    }\n  }\n  for (const c of concepts) {\n    if (!uloByConcept[c.id]) {\n      warnings.push(\"Phase A: no ULO generated for \" + c.id + \" — kept empty (audit will fail)\");\n      uloByConcept[c.id] = \"\";\n    }\n  }\n\n  // ── Phase B: CIO (HOW mechanism, concept-bound, Marr 2-Language spirit) ──\n  const uloContext = concepts\n    .map((c) => \"- \" + c.id + \" (\" + c.name + \"): \" + uloByConcept[c.id])\n    .join(\"\\n\");\n  const cioSystem = [\n    \"You are a Curriculum Design Expert writing Concept-level Instructional Objectives (CIO).\",\n    \"\",\n    \"CIO = Algorithmic Tier: the MECHANISM — HOW the concept works, step by step, at a\",\n    \"procedural level. CIOs are derived from approved ULOs.\",\n    \"\",\n    \"Rules:\",\n    \"1. Still technology-agnostic: describe the neutral pattern/approach WITHOUT concrete\",\n    \"   API names, libraries, file formats or syntax.\",\n    \"2. Marr 2-Language Test: the CIO must read as true and implementable regardless of\",\n    \"   whether the learner uses Python, Swift, JavaScript or any other language. If it\",\n    \"   only makes sense in one language, rewrite it more neutrally.\",\n    \"3. More concrete than the ULO: reference stages, conditions, ordering or trade-offs\",\n    \"   of the underlying process.\",\n    \"4. One CIO per concept; 1-3 sentences describing the mechanism.\",\n    \"5. Statement form (mandatory): every CIO MUST read 'The learner will be able to ...' —\",\n    \"   the mechanism is described after the clause.\",\n    \"\",\n    \"Approved style exemplars (production bank):\",\n    CIO_EXEMPLARS.map((e) => \"- \" + e).join(\"\\n\"),\n    \"\",\n    JSON_ONLY,\n  ].join(\"\\n\");\n  const cioUser = [\n    \"Approved ULOs:\",\n    uloContext,\n    \"\",\n    \"Return JSON:\",\n    '{\"cios\":[{\"concept_id\":\"C1\",\"cio\":\"...\"}]}',\n  ].join(\"\\n\");\n  for (const batch of chunkConcepts(concepts, LO_BATCH_SIZE)) {\n    const batchIds = new Set(batch.map((c) => c.id));\n    const batchUloContext = batch\n      .map((c) => \"- \" + c.id + \" (\" + c.name + \"): \" + (uloByConcept[c.id] || \"(missing)\"))\n      .join(\"\\n\");\n    const batchCioUser = \"Approved ULOs:\\n\" + batchUloContext + \"\\n\\nReturn JSON:\\n\" + '{\"cios\":[{\"concept_id\":\"C1\",\"cio\":\"...\"}]}';\n    const cioRes = await chatJson(client, cioSystem, batchCioUser);\n    for (const x of (cioRes.cios ?? []) as Array<{ concept_id?: string; cio?: string }>) {\n      if (x.concept_id && x.cio) cioByConcept[x.concept_id] = standardStatement(x.cio);\n    }\n  }\n  for (const c of concepts) {\n    if (!cioByConcept[c.id]) {\n      warnings.push(\"Phase B: no CIO generated for \" + c.id + \" — kept empty (audit will fail)\");\n      cioByConcept[c.id] = \"\";\n    }\n  }\n\n  // ── Phase C: SIO (keyword-bound implementation tasks) ──\n  const cioContext = concepts\n    .map((c) => \"- \" + c.id + \" (\" + c.name + \"): CIO=\" + cioByConcept[c.id] + \" | ULO=\" + uloByConcept[c.id])\n    .join(\"\\n\");\n  const sioSystem = [\n    \"You are a Curriculum Design Expert writing Specific Instructional Objectives (SIO).\",\n    \"\",\n    \"SIO = Implementation Tier: completable, context-specific implementation tasks derived\",\n    \"from approved CIOs, bound to the TARGET technology of the course.\",\n    \"\",\n    \"Rules:\",\n    \"1. EVERY SIO item MUST name concrete keywords/technologies: a real API, function,\",\n    \"   decorator, module, class, file or command of the target technology.\",\n    \"2. Each item is a completable task: an actionable verb + the concrete construct + the\",\n    \"   context where it is used. Application/Analysis/Creation skills are assessed\",\n    \"   INDIRECTLY through completing these tasks — there is no fixed Bloom ceiling.\",\n    \"   MACHINE CHECK: every item MUST contain at least one ACTION VERB from this whitelist\",\n    \"   (build, create, implement, write, configure, add, use, apply, display, store, load,\",\n    \"   save, handle, parse, validate, test, register, compute, generate, print, format,\",\n    \"   convert, extend, define, execute, run, read, fetch, wrap, log, call, raise, install,\",\n    \"   import, export, declare, embed, model, represent, override, customize, enforce, mock,\",\n    \"   assert, query, index, cache, stream, split, join, strip, encode, decode, traverse,\",\n    \"   measure, evaluate, benchmark, diagnose, demonstrate, verify, organize, structure,\",\n    \"   choose, select, compare, distinguish, attach, annotate, expose, accept, manage, group,\",\n    \"   sort, filter, map, reduce, catch, throw, migrate, inspect, trace, parameterize,\",\n    \"   construct, design, capture) — OR wrap the concrete construct in backticks.\",\n    \"   Items with abstract verbs (understand, learn, know, grasp, appreciate, explore) and\",\n    \"   no backtick construct FAIL the audit. Prefer starting the task phrase with the verb.\",\n    \"3. 2-3 items per concept, each referencing a DIFFERENT concrete construct.\",\n    \"4. Statement form (mandatory): every SIO MUST read 'The learner will be able to ...' —\",\n    \"   the concrete task follows the clause.\",\n    \"\",\n    \"Approved style exemplars (production bank):\",\n    SIO_EXEMPLARS.map((e) => \"- \" + e).join(\"\\n\"),\n    \"\",\n    JSON_ONLY,\n  ].join(\"\\n\");\n  const kwContext = concepts\n    .map((c) => \"- \" + c.id + \" (\" + c.name + \"): \" + ((c.keywords ?? []).slice(0, 10).join(\", \") || \"(none listed — use concrete constructs of \" + techStack + \")\"))\n    .join(\"\\n\");\n    for (const batch of chunkConcepts(concepts, LO_BATCH_SIZE)) {\n    const batchKw = batch\n      .map((c) => \"- \" + c.id + \" (\" + c.name + \"): \" + ((c.keywords ?? []).slice(0, 10).join(\", \") || \"(none listed — use concrete constructs of \" + techStack + \")\"))\n      .join(\"\\n\");\n    const batchCioCtx = batch\n      .map((c) => \"- \" + c.id + \" (\" + c.name + \"): CIO=\" + (cioByConcept[c.id] || \"(missing)\") + \" | ULO=\" + (uloByConcept[c.id] || \"(missing)\"))\n      .join(\"\\n\");\n    const batchSioUser = [\n      \"Target technology: \" + techStack,\n      \"\",\n      \"Concept keywords (each SIO item MUST contain at least one of its concept's keywords):\",\n      batchKw,\n      \"\",\n      \"Approved CIOs and ULOs:\",\n      batchCioCtx,\n      \"\",\n      \"Return JSON:\",\n      '{\"sios\":[{\"concept_id\":\"C1\",\"sio\":[\"...\",\"...\"]}]}',\n    ].join(\"\\n\");\n    const sioRes = await chatJson(client, sioSystem, batchSioUser);\n    for (const x of (sioRes.sios ?? []) as Array<{ concept_id?: string; sio?: string[] }>) {\n      if (x.concept_id && Array.isArray(x.sio)) sioByConcept[x.concept_id] = x.sio.map((item) => standardStatement(String(item)));\n    }\n  }\n  for (const c of concepts) {\n    if (!sioByConcept[c.id] || sioByConcept[c.id].length === 0) {\n      warnings.push(\"Phase C: no SIO generated for \" + c.id + \" — kept empty (audit will fail)\");\n      sioByConcept[c.id] = [];\n    }\n  }\n\n  // ── Deterministic audit + one targeted repair round (fail-closed) ──\n  const conceptIds = concepts.map((c) => c.id);\n  const auditOnce = (): DepthLayerAudit[] =>\n    auditDepthLayers(concepts.map((c) => ({\n      id: c.id,\n      name: c.name,\n      keywords: c.keywords ?? [],\n      ulo: uloByConcept[c.id],\n      cio: cioByConcept[c.id],\n      sio: sioByConcept[c.id],\n    })));\n  let audits = auditOnce();\n  const repairRound = async (round: number): Promise<boolean> => {\n    const failingNow = audits.filter((a) => !a.passed);\n    if (failingNow.length === 0) return false;\n    if (round > 1) warnings.push(\"Depth audit repair round \" + round + \": \" + failingNow.length + \" concept(s) still failing\");\n    const failing = failingNow;\n    {\n    warnings.push(\"Depth audit: \" + failing.length + \"/\" + concepts.length + \" concepts failed first audit — targeted repair\");\n    const repairTargets = failing.map((a) => {\n      const c = concepts.find((x) => x.id === a.conceptId);\n      const issues: string[] = [];\n      if (a.uloHasTechSignals) issues.push(\"ULO names concrete technology (remove: \" + a.uloTechSignals.join(\", \") + \")\");\n      if (a.uloHasImplementationVerbs) issues.push(\"ULO reads as an implementation task (rewrite as WHAT+WHY competency)\");\n      for (const item of a.sioUnboundItems) issues.push(\"SIO not keyword-bound: \" + excerpt(item, 120));\n      for (const item of a.sioOffConceptItems) issues.push(\"SIO does not reference any of this concept's keywords (\" + (c?.keywords ?? []).join(\", \") + \"): \" + excerpt(item, 120));\n      for (const item of a.sioNotCompletable) issues.push(\"SIO not a completable task: \" + excerpt(item, 120));\n      if (!a.concretenessIncreases) issues.push(\"SIO is not more concrete than the ULO — bind it to concrete constructs\");\n      return {\n        concept_id: a.conceptId,\n        name: c?.name ?? a.conceptId,\n        keywords: c?.keywords ?? [],\n        current: { ulo: uloByConcept[a.conceptId], cio: cioByConcept[a.conceptId], sio: sioByConcept[a.conceptId] },\n        issues,\n      };\n    });\n    const repairSystem = [\n      \"You repair depth-layer learning objectives that failed a deterministic contract audit.\",\n      \"For each concept, rewrite ONLY the layers mentioned in issues, keeping the others as-is.\",\n      \"Contract:\",\n      \"- ULO: WHAT+WHY, concept-bound, technology-agnostic, Remember/Understand verbs.\",\n      \"- CIO: HOW mechanism, technology-agnostic, more concrete than ULO, Marr 2-Language neutral.\",\n      \"- SIO: keyword-bound completable implementation tasks naming real constructs of \" + techStack + \".\",\n      \"- BINDING RULE: every SIO item must contain at least one of the concept's listed keywords VERBATIM (copy the exact keyword text into the sentence).\",\n      \"- COMPLETABILITY RULE: every SIO item must contain an actionable verb (build, create, implement, write, configure, parse, validate, handle, store, load, run, read, fetch, display, generate, format, convert, test, debug, trace, measure, design, structure, select, filter, sort, map, reduce, catch, throw, migrate, deploy, query, index, cache, stream, inspect) or wrap a concrete construct in backticks — abstract verbs (understand, learn, know, grasp, explore, appreciate) always fail.\",\n      \"\",\n      JSON_ONLY,\n    ].join(\"\\n\");\n    const repairUser = [\n      \"Failing concepts:\",\n      JSON.stringify(repairTargets, null, 2),\n      \"\",\n      \"Return the FULL repaired set for these concepts in the same 3-layer JSON shape:\",\n      '{\"repairs\":[{\"concept_id\":\"C1\",\"ulo\":\"...\",\"cio\":\"...\",\"sio\":[\"...\"]}]}',\n    ].join(\"\\n\");\n    try {\n      const repairRes = await chatJson(client, repairSystem, repairUser);\n      for (const r of (repairRes.repairs ?? []) as Array<{ concept_id?: string; ulo?: string; cio?: string; sio?: string[] }>) {\n        if (!r.concept_id) continue;\n        if (r.ulo) uloByConcept[r.concept_id] = standardStatement(r.ulo);\n        if (r.cio) cioByConcept[r.concept_id] = standardStatement(r.cio);\n        if (Array.isArray(r.sio) && r.sio.length > 0) sioByConcept[r.concept_id] = r.sio.map((t) => standardStatement(String(t)));\n      }\n      audits = auditOnce();\n    } catch (err) {\n      warnings.push(\"Depth repair round failed: \" + (err instanceof Error ? err.message : String(err)));\n    }\n    }\n    return audits.every((a) => a.passed);\n  };\n  for (let round = 1; round <= 2; round++) {\n    const allPass = await repairRound(round);\n    if (allPass) break;\n  }\n\n  const stillFailing = audits.filter((a) => !a.passed);\n  if (stillFailing.length > 0) {\n    // Deterministic debug dump: inspect what the LLM actually wrote before failing.\n    try {\n      const { mkdirSync, writeFileSync } = await import(\"node:fs\");\n      const dumpDir = (await import('node:os')).tmpdir() + '/domain-kit-debug/';\n      mkdirSync(dumpDir, { recursive: true });\n      writeFileSync(dumpDir + \"depth-audit-debug.json\", JSON.stringify(\n        stillFailing.map((a) => ({ audit: a, ulo: uloByConcept[a.conceptId], cio: cioByConcept[a.conceptId], sio: sioByConcept[a.conceptId] })), null, 2));\n    } catch { /* dump is best-effort */ }\n    const detail = stillFailing.map((a) => a.conceptId + \"[\" + (a.uloHasTechSignals ? \"ulo-tech \" : \"\") + (a.uloHasImplementationVerbs ? \"ulo-impl \" : \"\") + (a.sioUnboundItems.length ? \"sio-unbound \" : \"\") + (a.sioNotCompletable.length ? \"sio-incomplete\" : \"\") + \"]\").join(\", \");\n    throw new Error(\n      \"Depth-layer contract audit failed after repair for: \" + detail +\n      \" — regenerate or fix the prompt contract (fail-closed, no silent fallback)\"\n    );\n  }\n\n  return { uloByConcept, cioByConcept, sioByConcept, audits, warnings };\n}\n","/**\n * knowledgeTreeCatalog.ts — loads the mlo-knowledge-tree TSV (CONCEPT/TOPIC/\n * CATEGORY/SUBJECT/FIELD rows) and exposes the deterministic half of concept\n * standardization:\n *   - full CATEGORY / TOPIC listings for the LLM relevance pre-selection\n *   - topic->category resolution (CONCEPT rows only carry topic codes)\n *   - filtering tree concepts by selected categories/topics (+ a keyword\n *     overlap safety net so strong individual matches are never filtered out)\n *   - prerequisite codes per concept (prerequisite_concept_codes column)\n *\n * No LLM here: this module is pure data shaping.\n */\nimport { readFileSync } from 'node:fs';\n\nexport interface TreeConcept {\n  code: string;\n  name: string;\n  description: string;\n  keywords: string[];\n  topicCodes: string[];\n  categoryCodes: string[];\n  prerequisiteCodes: string[];\n}\n\nexport interface TreeCatalog {\n  path: string;\n  concepts: TreeConcept[];\n  /** category code -> name */\n  categories: Map<string, string>;\n  /** topic code -> { name, categoryCodes } */\n  topics: Map<string, { name: string; categoryCodes: string[] }>;\n}\n\nfunction cell(v: string | undefined): string[] {\n  return (v || '').split(',').map((s) => s.trim()).filter(Boolean);\n}\n\nexport function loadKnowledgeTreeCatalog(tsvPath: string): TreeCatalog {\n  const text = readFileSync(tsvPath, 'utf8');\n  const lines = text.split('\\n').filter((l) => l.trim().length > 0);\n  if (lines.length === 0) throw new Error('Knowledge tree TSV is empty: ' + tsvPath);\n  const header = lines[0].split('\\t').map((h) => h.trim());\n  const col = (name: string): number => header.indexOf(name);\n  const iT = col('item_type');\n  const iC = col('code');\n  const iN = col('name');\n  const iD = col('description');\n  const iCat = col('category_codes');\n  const iTpc = col('topic_codes');\n  const iPre = col('prerequisite_concept_codes');\n  const iKw = col('keywords');\n  for (const [name, idx] of [['item_type', iT], ['code', iC], ['name', iN]] as const) {\n    if (idx < 0) throw new Error('Knowledge tree TSV missing column: ' + name);\n  }\n  const categories = new Map<string, string>();\n  const topics = new Map<string, { name: string; categoryCodes: string[] }>();\n  const concepts: TreeConcept[] = [];\n  for (const line of lines.slice(1)) {\n    const c = line.split('\\t');\n    const type = (c[iT] || '').trim();\n    const code = (c[iC] || '').trim();\n    const name = (c[iN] || '').trim();\n    if (!code || !name) continue;\n    if (type === 'CATEGORY') categories.set(code, name);\n    if (type === 'TOPIC') topics.set(code, { name, categoryCodes: cell(c[iCat]) });\n    if (type !== 'CONCEPT') continue;\n    const topicCodes = cell(c[iTpc]);\n    // CONCEPT rows carry topic codes only — resolve categories via the topic map\n    const categoryCodes = new Set<string>();\n    for (const t of topicCodes) for (const cc of topics.get(t)?.categoryCodes || []) categoryCodes.add(cc);\n    concepts.push({\n      code,\n      name,\n      description: (c[iD] || '').trim(),\n      keywords: cell(c[iKw]),\n      topicCodes,\n      categoryCodes: [...categoryCodes],\n      prerequisiteCodes: cell(c[iPre]),\n    });\n  }\n  if (concepts.length === 0) throw new Error('Knowledge tree TSV has no CONCEPT rows: ' + tsvPath);\n  return { path: tsvPath, concepts, categories, topics };\n}\n\nfunction tokens(s: string): Set<string> {\n  return new Set(\n    s.toLowerCase().replace(/[^a-z0-9\\s-]/g, ' ').split(/\\s+/).filter((w) => w.length >= 4),\n  );\n}\n\n/**\n * Deterministic filter AFTER the LLM picked relevant categories/topics:\n * keep concepts whose topic or category was selected. Concepts with a strong\n * individual keyword overlap are ALWAYS kept (safety net against a missed\n * category). Returns [] only when the selection is empty.\n */\nexport function filterBySelection(\n  catalog: TreeCatalog,\n  selectedCategories: string[],\n  selectedTopics: string[],\n  analysisConcepts: Array<{ name: string; keywords: string[] }>,\n  maxConcepts = 120,\n): TreeConcept[] {\n  const tps = new Set(selectedTopics.map((c) => c.trim().toUpperCase()).filter(Boolean));\n  const cats = new Set(selectedCategories.map((c) => c.trim().toUpperCase()).filter(Boolean));\n  const probe = analysisConcepts.map((c) => tokens(c.name + ' ' + c.keywords.join(' ')));\n  const probeAll = new Set<string>();\n  for (const p of probe) for (const w of p) probeAll.add(w);\n  const inSelection = (tc: TreeConcept): boolean =>\n    tc.topicCodes.some((t) => tps.has(t)) || tc.categoryCodes.some((c) => cats.has(c));\n  const overlapScore = (tc: TreeConcept): number => {\n    const tcTok = tokens(tc.name + ' ' + tc.description.slice(0, 300) + ' ' + tc.keywords.join(' '));\n    let overlap = 0;\n    for (const w of tcTok) if (probeAll.has(w)) overlap++;\n    const kwDirect = tc.keywords.filter((k) => {\n      const kl = k.toLowerCase();\n      return [...probeAll].some((w) => w === kl || (w.length >= 5 && kl.includes(w)));\n    }).length;\n    return overlap * 2 + kwDirect * 3;\n  };\n  const kept = catalog.concepts.filter((tc) => inSelection(tc) || overlapScore(tc) >= 6);\n  return kept\n    .map((tc) => ({ tc, s: overlapScore(tc) }))\n    .sort((a, b) => b.s - a.s)\n    .slice(0, maxConcepts)\n    .map((x) => x.tc);\n}\n\n/** Compact rendering for the standardization prompt. */\nexport function renderShortlist(shortlist: TreeConcept[]): string {\n  return shortlist\n    .map((tc) => '- ' + tc.code + ' | ' + tc.name + ' | kw: ' + tc.keywords.slice(0, 8).join(', ') +\n      (tc.prerequisiteCodes.length ? ' | prereqs: ' + tc.prerequisiteCodes.join(',') : ''))\n    .join('\\n');\n}\n\n/** Category + topic listing for the LLM relevance pre-selection prompt. */\nexport function renderCategoryTopicIndex(catalog: TreeCatalog): string {\n  const topicToConcepts = new Map<string, number>();\n  for (const tc of catalog.concepts) for (const t of tc.topicCodes) topicToConcepts.set(t, (topicToConcepts.get(t) || 0) + 1);\n  const byCat = new Map<string, string[]>();\n  for (const [code, info] of catalog.topics) {\n    for (const cat of info.categoryCodes) {\n      const arr = byCat.get(cat) || [];\n      arr.push(code + ' ' + info.name + ' (' + (topicToConcepts.get(code) || 0) + ' concepts)');\n      byCat.set(cat, arr);\n    }\n  }\n  const out: string[] = [];\n  for (const [code, name] of catalog.categories) {\n    out.push('CATEGORY ' + code + ' — ' + name);\n    for (const t of byCat.get(code) || []) out.push('    TOPIC: ' + t);\n  }\n  return out.join('\\n');\n}\n","/**\n * conceptStandardizer.ts — STEP 2.5 of the concept identification flow:\n *\n *   1. keywords -> escalate -> concepts (upstream STEP_6, unchanged)\n *   2. HERE: LLM-driven standardization against the knowledge-tree catalog\n *      (category pre-filtered), producing:\n *        - standardized concepts: adopt the tree code + tree keywords +\n *          tree prerequisite codes (seed)\n *        - proposed NEW concepts: kept OUT of the standard code namespace,\n *          written to a separate proposals artifact for later merge\n *        - ambiguous matches: treated as proposed_new with possible_tree_matches\n *   3. downstream steps use the standardized/proposed codes (fail-closed)\n *\n * The SEMANTIC decision is the LLM's. Code only validates the contract\n * (fail-closed) and writes artifacts.\n */\nimport { mkdirSync, writeFileSync } from 'node:fs';\nimport { tmpdir } from 'node:os';\nimport { join } from 'node:path';\nimport type { LlmClient } from '../utils/llmClient';\nimport {\n  loadKnowledgeTreeCatalog,\n  filterBySelection,\n  renderShortlist,\n  renderCategoryTopicIndex,\n  type TreeCatalog,\n} from './knowledgeTreeCatalog';\n\nexport interface StandardizeInput {\n  id: string;\n  name: string;\n  description: string;\n  keywords: string[];\n}\n\nexport interface StandardizationDecision {\n  id: string;\n  decision: 'standardized' | 'proposed_new';\n  tree_code?: string;\n  note?: string;\n  proposed_code?: string;\n  proposed_definition?: string;\n  possible_tree_matches?: string[];\n  /** LLM-selected subset of the tree concept's keywords that fit the course tech stack. */\n  adopted_keywords?: string[];\n}\n\nexport interface StandardizationResult {\n  decisions: StandardizationDecision[];\n  proposals: Array<Record<string, unknown>>;\n  warnings: string[];\n  shortlistSize: number;\n  catalogSize: number;\n}\n\nconst JSON_ONLY =\n  'Return ONLY a JSON object, no markdown fences, no commentary.';\n\nfunction parseJsonBlock(text: string): unknown {\n  const start = text.indexOf('{');\n  const end = text.lastIndexOf('}');\n  if (start < 0 || end <= start) throw new Error('LLM standardization response has no JSON object');\n  return JSON.parse(text.slice(start, end + 1));\n}\n\n/**\n * Standardize analysis concepts against the tree.\n * Throws (fail-closed) when the LLM leaves a concept undecided or the tree\n * cannot be loaded.\n */\nexport async function standardizeConcepts(opts: {\n  client: LlmClient;\n  concepts: StandardizeInput[];\n  catalog: TreeCatalog;\n  techStack?: string;\n  proposalsPath?: string;\n  onProgress?: (step: string, message: string) => void;\n}): Promise<StandardizationResult> {\n  const { client, catalog, techStack = 'python', proposalsPath } = opts;\n  const log = opts.onProgress ?? (() => {});\n  const warnings: string[] = [];\n\n  // ── Stage A (LLM): which categories/topics could be relevant? ──\n  const hasTopics = catalog.topics.size > 0;\n  const selSystem = [\n    'You pre-select relevant areas of an institutional knowledge tree before a detailed concept alignment pass.',\n    hasTopics\n      ? 'Given the analysis concepts, pick the TOPICS that could contain matching concepts. Concepts are filed under topics, so topics are the filter dimension.'\n      : 'Given the analysis concepts, pick the CATEGORIES that could contain matching concepts.',\n    '- Be generous: missing a relevant topic corrupts the alignment; an extra topic only costs attention.',\n    '- Only codes that appear in the index are valid.',\n    JSON_ONLY,\n  ].join('\\n');\n  const selUser = [\n    'ANALYSIS CONCEPTS:',\n    opts.concepts.map((c) => '- ' + c.name + ': ' + c.description.slice(0, 160)).join('\\n'),\n    '',\n    'KNOWLEDGE TREE INDEX:',\n    renderCategoryTopicIndex(catalog),\n    '',\n    hasTopics\n      ? 'Return JSON: {\"relevant_topics\":[\"TOPIC_CODE\"]}'\n      : 'Return JSON: {\"relevant_categories\":[\"CATEGORY_CODE\"]}',\n  ].join('\\n');\n  const selRes = await client.chat(\n    [{ role: 'system', content: selSystem }, { role: 'user', content: selUser }],\n    { temperature: 0, maxTokens: 4096 },\n  );\n  const sel = parseJsonBlock(selRes.content) as { relevant_categories?: string[]; relevant_topics?: string[] };\n  // ONE filter dimension: topics when the tree files concepts under topics,\n  // categories only as fallback. Never both mixed.\n  const selTps = hasTopics ? (sel.relevant_topics || []).map(String).filter(Boolean) : [];\n  const selCats = hasTopics ? [] : (sel.relevant_categories || []).map(String).filter(Boolean);\n  log('STEP_2_5', 'LLM relevance pre-selection (' + (hasTopics ? 'topics' : 'categories') + '): ' + (hasTopics ? selTps.join(',') : selCats.join(',')));\n\n  // ── Stage B (deterministic): filter tree concepts by that selection ──\n  const shortlist = filterBySelection(catalog, selCats, selTps, opts.concepts);\n  log('STEP_2_5', 'Filtered tree concepts: ' + shortlist.length + '/' + catalog.concepts.length + ' shortlisted for alignment');\n  if (shortlist.length === 0) throw new Error('Topic/category pre-selection eliminated every tree concept — fail-closed');\n\n  const system = [\n    'You align auto-derived learning concepts with an institutional knowledge tree.',\n    'For EACH input concept decide exactly one of:',\n    '  1. \"standardized\" - the concept teaches the SAME underlying knowledge as one tree concept. Applying a tree concept inside a specific product context (e.g. \"File-based persistence in a CLI app\") is STILL the tree concept if the core knowledge matches. Set tree_code to that concept\\'s code.',\n    '     Adopt the tree\\'s terminology. Only propose new when the tree genuinely has NO concept teaching that knowledge (broader AND narrower both fail).',\n    '  2. \"proposed_new\" - no tree concept covers it at the same granularity. Propose an UPPER_SNAKE_CASE code (descriptive, stable, max 5 words) and a one-sentence definition.',\n    '     If between 1 and 3 tree concepts are CLOSE but not exact, list their codes in possible_tree_matches for human review.',\n    'For a \"standardized\" decision ALSO return \"adopted_keywords\": the subset of that tree concept\\'s keywords (from the shortlist) that make sense for the course TECH STACK. Drop keywords that name tooling from other ecosystems (e.g. JS test runners for a Python course) — keep conceptual keywords even when spelled generically. Maximum 8, ordered most-relevant first.',\n    'Rules:',\n    '- Judge by MEANING (definition + keywords), not by string similarity.',\n    '- COVERAGE RULE: a \"standardized\" match must cover ALL primary dimensions of the input concept — every distinct aspect named in its title or description. A tree concept covering only ONE of several aspects (e.g. \"interpreting error messages\" for a concept about error handling AND user experience) is a PARTIAL match: decide \"proposed_new\" and list that tree code in possible_tree_matches.',\n    '- Context-specific wording does NOT make a new concept: new concept = knowledge absent from the tree, not knowledge applied elsewhere.',\n    '- Every input concept MUST receive exactly one decision. Never merge two input concepts into one tree code.',\n    '- Prefer proposed_new over a wrong standardized match: a false match corrupts the curriculum.',\n    JSON_ONLY,\n  ].join('\\n');\n\n  const user = [\n    'TECH STACK: ' + techStack,\n    '',\n    'ANALYSIS CONCEPTS (to standardize):',\n    JSON.stringify(opts.concepts.map((c) => ({ id: c.id, name: c.name, description: c.description.slice(0, 300), keywords: c.keywords.slice(0, 12) })), null, 1),\n    '',\n    'KNOWLEDGE TREE SHORTLIST (pre-filtered, ' + shortlist.length + ' candidate concepts):',\n    renderShortlist(shortlist),\n    '',\n    'Return JSON: {\"decisions\":[{\"id\":\"<input id>\",\"decision\":\"standardized\",\"tree_code\":\"TREE_CODE\",\"adopted_keywords\":[\"kw1\",\"kw2\"],\"note\":\"one sentence\"},',\n    '  {\"id\":\"<input id>\",\"decision\":\"proposed_new\",\"proposed_code\":\"PROPOSED_CODE\",\"proposed_definition\":\"...\",\"possible_tree_matches\":[\"CODE\"]}]}',\n  ].join('\\n');\n\n  const res = await client.chat(\n    [{ role: 'system', content: system }, { role: 'user', content: user }],\n    { temperature: 0, maxTokens: 8192 },\n  );\n  log('STEP_2_5', 'Standardization response received (provider ' + (res as unknown as { provider?: string }).provider + ')');\n\n  const parsed = parseJsonBlock(res.content) as { decisions?: StandardizationDecision[] };\n  const decisions = parsed.decisions ?? [];\n  const byId = new Map(decisions.map((d) => [String(d.id), d]));\n\n  const finalDecisions: StandardizationDecision[] = [];\n  const proposals: Array<Record<string, unknown>> = [];\n  for (const c of opts.concepts) {\n    const d = byId.get(c.id);\n    if (!d || (d.decision !== 'standardized' && d.decision !== 'proposed_new')) {\n      // fail-closed: undecided concept cannot silently keep a nonstandard code\n      throw new Error('Concept ' + c.id + ' (' + c.name + ') has no standardization decision — fail-closed');\n    }\n    if (d.decision === 'standardized') {\n      const tc = catalog.concepts.find((x) => x.code === d.tree_code);\n      if (!tc) throw new Error('Concept ' + c.id + ' standardized to unknown tree code ' + d.tree_code + ' — fail-closed');\n      // adopted_keywords must come from the tree concept's own keywords — an\n      // invented token would silently corrupt the registry (fail-closed).\n      const treeKw = new Set(tc.keywords.map((k) => k.toLowerCase()));\n      const adopted = (d.adopted_keywords || []).map((k) => String(k)).filter((k) => {\n        if (treeKw.has(k.toLowerCase())) return true;\n        throw new Error('Concept ' + c.id + ' adopted keyword \"' + k + '\" not in tree concept ' + tc.code + ' — fail-closed');\n      });\n      if (tc.keywords.length > 0 && adopted.length === 0) {\n        throw new Error('Concept ' + c.id + ' standardized to ' + tc.code + ' without adopted_keywords — fail-closed');\n      }\n      finalDecisions.push({ ...d, id: c.id, tree_code: tc.code, adopted_keywords: adopted });\n      warnings.push('Concept ' + c.id + ' standardized as ' + tc.code + ' (' + tc.name + '), adopted keywords: ' + adopted.join(', ') + (d.note ? ' — ' + d.note : ''));\n    } else {\n      const code = (d.proposed_code || '').toUpperCase().replace(/[^A-Z0-9_]/g, '_');\n      if (!/^[A-Z][A-Z0-9_]*$/.test(code)) {\n        throw new Error('Concept ' + c.id + ' proposed invalid code \"' + d.proposed_code + '\" — fail-closed');\n      }\n      finalDecisions.push({ ...d, id: c.id, proposed_code: code });\n      proposals.push({\n        code,\n        name: c.name,\n        description: d.proposed_definition || c.description.slice(0, 300),\n        keywords: c.keywords,\n        subject_codes: 'PY',\n        category_codes: '',\n        topic_codes: '',\n        prerequisite_concept_codes: [],\n        status: 'proposed',\n        source_concept_id: c.id,\n        possible_tree_matches: (d.possible_tree_matches || []).filter(Boolean),\n      });\n      warnings.push('Concept ' + c.id + ' proposed as NEW: ' + code + (d.possible_tree_matches?.length ? ' (near matches: ' + d.possible_tree_matches.join(', ') + ')' : ''));\n    }\n  }\n\n  // Persist proposals separately for the later merge (never in the standard namespace)\n  const outPath = proposalsPath || join(tmpdir(), 'domain-kit-debug', 'concept-proposals.json');\n  try {\n    mkdirSync(outPath.slice(0, outPath.lastIndexOf('/')), { recursive: true });\n    writeFileSync(outPath, JSON.stringify({ generated_at: new Date().toISOString(), proposals }, null, 2));\n    log('STEP_2_5', 'Proposals written: ' + proposals.length + ' -> ' + outPath);\n  } catch (e) {\n    warnings.push('Could not write proposals artifact: ' + (e instanceof Error ? e.message : String(e)));\n  }\n\n  return { decisions: finalDecisions, proposals, warnings, shortlistSize: shortlist.length, catalogSize: catalog.concepts.length };\n}\n","/**\n * Knowledge Graph Pipeline — generates knowledge_graph for concept-driven learning.\n *\n * Input: syllabus text, subject description, grade band\n * Output: KnowledgeGraph with concepts, problem_types, prerequisites, learning_path\n *\n * Includes:\n *   - Cycle detection in prerequisite chains\n *   - Topological sort for learning_path\n *   - Multi-language syllabus support\n *   - ULO/CIO/SIO depth control per concept\n */\n\nimport { assignConceptCodes, techTagFor, uloCode, cioCode, sioCode, cioActionSlug } from \"./loCodeStandard.js\";\nimport { createLlmClient, llmChatJson, type LlmClientConfig } from '../utils/llmClient';\nimport type { KnowledgeGraph, Concept, ConceptCategory, LearningPathStep } from '../schemas/knowledgeGraphSchema';\n\nexport interface KnowledgeGraphPipelineOptions {\n  subject: string;\n  description?: string;\n  syllabusText?: string;\n  gradeBand?: [number, number];\n  domain?: string;\n  /** Target technology for SIO keyword binding (e.g. \"python\", \"swift\"); auto-detected fallback applies. */\n  techStack?: string;\n  llmConfig?: LlmClientConfig;\n  onProgress?: (step: string, message: string) => void;\n  /** Path to mlo-knowlege-tree.tsv. When provided, STEP_2_5 standardizes every concept against the tree (fail-closed). */\n  knowledgeTreePath?: string;\n  /** Where to persist proposed-new concepts for the later merge. Default: tmpdir/domain-kit-debug/concept-proposals.json */\n  proposalsPath?: string;\n}\n\nexport interface KnowledgeGraphPipelineResult {\n  knowledgeGraph: KnowledgeGraph;\n  warnings: string[];\n}\nimport { auditDepthLayers } from './depthAudit';\nimport { authorDepthLayersHierarchically } from './hierarchicalLoAuthoring';\nimport { loadKnowledgeTreeCatalog } from './knowledgeTreeCatalog';\nimport { standardizeConcepts } from './conceptStandardizer';\n\n\n// ─── Cycle Detection ──────────────────────────────────────────────────────────\n\n/**\n * Detect cycles in prerequisite graph using DFS.\n * Returns array of cycle paths if found, empty if no cycles.\n */\nfunction detectCycles(concepts: Concept[]): string[][] {\n  const cycles: string[][] = [];\n  const visited = new Set<string>();\n  const inStack = new Set<string>();\n  const path: string[] = [];\n\n  function dfs(conceptId: string, prereqMap: Map<string, string[]>) {\n    if (inStack.has(conceptId)) {\n      // Found a cycle — extract cycle path\n      const cycleStart = path.indexOf(conceptId);\n      if (cycleStart >= 0) {\n        cycles.push([...path.slice(cycleStart), conceptId]);\n      }\n      return;\n    }\n    if (visited.has(conceptId)) return;\n\n    visited.add(conceptId);\n    inStack.add(conceptId);\n    path.push(conceptId);\n\n    const prereqs = prereqMap.get(conceptId) || [];\n    for (const prereq of prereqs) {\n      dfs(prereq, prereqMap);\n    }\n\n    path.pop();\n    inStack.delete(conceptId);\n  }\n\n  // Build reverse map: concept → its prerequisites\n  const prereqMap = new Map<string, string[]>();\n  for (const concept of concepts) {\n    prereqMap.set(concept.id, concept.prerequisites || []);\n  }\n\n  for (const concept of concepts) {\n    if (!visited.has(concept.id)) {\n      dfs(concept.id, prereqMap);\n    }\n  }\n\n  return cycles;\n}\n\n/**\n * Remove cycles by breaking the back-edge with lowest confidence.\n * For simplicity, we break the cycle at the concept that appears LAST in the original list.\n */\nfunction breakCycles(concepts: Concept[], cycles: string[][]): { fixed: Concept[]; removed: Array<{ from: string; to: string }> } {\n  const removed: Array<{ from: string; to: string }> = [];\n  const fixed = concepts.map(c => ({ ...c, prerequisites: [...(c.prerequisites || [])] }));\n\n  for (const cycle of cycles) {\n    // Remove the last edge in the cycle (concept → prerequisite)\n    // The \"last\" concept in the cycle is the one whose prerequisite creates the back-edge\n    if (cycle.length >= 2) {\n      const breaker = cycle[cycle.length - 2]; // The concept that points back\n      const target = cycle[cycle.length - 1];   // The prerequisite that creates cycle\n\n      for (const concept of fixed) {\n        if (concept.id === breaker) {\n          concept.prerequisites = concept.prerequisites.filter(p => p !== target);\n          removed.push({ from: breaker, to: target });\n        }\n      }\n    }\n  }\n\n  return { fixed, removed };\n}\n\n/**\n * Topological sort using Kahn's algorithm.\n * Returns sorted concept IDs, or throws if there's still a cycle.\n */\nfunction topologicalSort(concepts: Concept[]): string[] {\n  const inDegree = new Map<string, number>();\n  const adjacency = new Map<string, string[]>();\n\n  for (const concept of concepts) {\n    inDegree.set(concept.id, 0);\n    adjacency.set(concept.id, []);\n  }\n\n  for (const concept of concepts) {\n    for (const prereq of concept.prerequisites || []) {\n      // prereq → concept (prereq must come before concept)\n      adjacency.get(prereq)?.push(concept.id);\n      inDegree.set(concept.id, (inDegree.get(concept.id) || 0) + 1);\n    }\n  }\n\n  const queue: string[] = [];\n  for (const [id, degree] of inDegree) {\n    if (degree === 0) queue.push(id);\n  }\n\n  const sorted: string[] = [];\n  while (queue.length > 0) {\n    const current = queue.shift()!;\n    sorted.push(current);\n\n    for (const neighbor of adjacency.get(current) || []) {\n      const newDegree = (inDegree.get(neighbor) || 1) - 1;\n      inDegree.set(neighbor, newDegree);\n      if (newDegree === 0) queue.push(neighbor);\n    }\n  }\n\n  if (sorted.length !== concepts.length) {\n    // Still has cycle after breaking — shouldn't happen, but log warning\n    console.warn(`[WARN] Topological sort incomplete: ${sorted.length}/${concepts.length} concepts sorted`);\n  }\n\n  return sorted;\n}\n\n// ─── ULO/CIO/SIO Depth Estimation ────────────────────────────────────────────\n\n/**\n * Estimate ULO/CIO/SIO depth level for a concept based on:\n * - Number of prerequisites (more prereqs = deeper concept)\n * - Bloom level of associated problem types\n * - Position in learning path (earlier = more foundational)\n */\nfunction estimateConceptDepth(\n  concept: Concept,\n  position: number,\n  totalConcepts: number,\n): { suggestedDepth: 'ulo' | 'cio' | 'sio'; rationale: string } {\n  const prereqCount = (concept.prerequisites || []).length;\n  const problemTypes = concept.problem_types || [];\n  const maxBloom = problemTypes.reduce((max, pt) => {\n    const levels = ['Remember', 'Understand', 'Apply', 'Analyze', 'Evaluate', 'Create'];\n    const idx = levels.indexOf(pt.bloom_level || 'Understand');\n    return idx > max ? idx : max;\n  }, 0);\n\n  // Position ratio: 0 = first concept, 1 = last concept\n  const positionRatio = totalConcepts > 1 ? position / (totalConcepts - 1) : 0;\n\n  // Score: higher = deeper\n  const depthScore = (prereqCount * 0.3) + (maxBloom * 0.15) + (positionRatio * 0.3);\n\n  if (depthScore < 0.3) {\n    return { suggestedDepth: 'ulo', rationale: `Low complexity (${prereqCount} prereqs, bloom=${maxBloom}, position=${(positionRatio * 100).toFixed(0)}%)` };\n  } else if (depthScore < 0.6) {\n    return { suggestedDepth: 'cio', rationale: `Medium complexity (${prereqCount} prereqs, bloom=${maxBloom}, position=${(positionRatio * 100).toFixed(0)}%)` };\n  } else {\n    return { suggestedDepth: 'sio', rationale: `High complexity (${prereqCount} prereqs, bloom=${maxBloom}, position=${(positionRatio * 100).toFixed(0)}%)` };\n  }\n}\n\n// ─── Main Pipeline ───────────────────────────────────────────────────────────\n\n/**\n * Generate a KnowledgeGraph from syllabus/description via LLM.\n */\nexport async function generateKnowledgeGraph(\n  options: KnowledgeGraphPipelineOptions,\n): Promise<KnowledgeGraphPipelineResult> {\n  const { subject, description, syllabusText, gradeBand, domain, techStack, llmConfig, onProgress } = options;\n  const warnings: string[] = [];\n\n  const log = (step: string, msg: string) => {\n    console.log(`[KG-${step}] ${msg}`);\n    onProgress?.(step, msg);\n  };\n\n  // ─── Step 1: Decompose subject into concepts ─────────────────────────────\n  log('STEP_1', 'Decomposing subject into concepts...');\n\n  const client = createLlmClient(llmConfig);\n\n  // Truncate syllabus with warning\n  const maxSyllabusChars = parseInt(process.env.KG_MAX_SYLLABUS_CHARS || '16000', 10);\n  let truncatedSyllabus = '';\n  if (syllabusText) {\n    if (syllabusText.length > maxSyllabusChars) {\n      truncatedSyllabus = syllabusText.slice(0, maxSyllabusChars);\n      warnings.push(`Syllabus truncated from ${syllabusText.length} to ${maxSyllabusChars} chars — may miss some concepts`);\n    } else {\n      truncatedSyllabus = syllabusText;\n    }\n  }\n\n  const systemPrompt = (\n    'You are an expert curriculum designer. Decompose the given subject into a structured '\n    + 'knowledge graph with concepts, prerequisites, and problem types.\\n\\n'\n    + 'CRITICAL RULES:\\n'\n    + '1. Each concept MUST have the three depth layers, authored against this CONTRACT:\\n'\n    + '   - ulo (WHAT + WHY): bound to the CONCEPT\\u0027s intrinsic NATURE. It explains what the\\n'\n    + '     concept is and why it exists — the problem it solves in principle. It must be\\n'\n    + '     TECHNOLOGY-AGNOSTIC: never name a concrete library, API, function, file format,\\n'\n    + '     tool or language feature. Typical assessment level: Remember / Understand.\\n'\n    + '   - cio (HOW): the MECHANISM — how the concept works and solves that problem, step\\n'\n    + '     by step. Still bound to the concept\\u0027s nature: more concrete than the ULO, but\\n'\n    + '     NOT tied to one specific technology (no concrete API names). CIO capability is\\n'\n    + '     assessed INDIRECTLY, through completing contextual work, not in isolation.\\n'\n    + '   - sio (IMPLEMENTATION): an array of 2-4 items. EVERY item MUST reference concrete\\n'\n    + '     KEYWORDS/technologies (a real API, function, module, file, or named pattern) and\\n'\n    + '     describe a completable, context-specific implementation task. Application,\\n'\n    + '     Analysis and Creation skills are assessed INDIRECTLY through completing these\\n'\n    + '     items. There is NO fixed Bloom ceiling for a layer — but concreteness MUST\\n'\n    + '     strictly increase: SIO more technology-bound than CIO, CIO more concrete than ULO.\\n'\n    + '   - prerequisites: concept IDs that must be learned first (MUST NOT create cycles)\\n'\n    + '   - problem_types: 2-4 problem types with bloom_level and difficulty. Remember and\\n'\n    + '     Understand problem types test the ULO/CIO directly; Apply-and-above types are\\n'\n    + '     proxies for SIO completion in context.\\n'\n    + '   - techniques: methods, formulas, tools\\n'\n    + '2. Prerequisite chains MUST be acyclic (no concept can depend on itself or create a loop)\\n'\n    + '3. Concepts should be ordered by prerequisite dependency (topological sort)\\n'\n    + '4. Problem types should range from Remember to Apply (not all at same level)\\n'\n    + '5. Group concepts into categories (chapters/sections)\\n'\n    + '6. ALL text in ENGLISH (even if input is Vietnamese)\\n'\n    + '7. NEVER invent concepts not present in the syllabus\\n'\n    + '8. Return JSON matching the KnowledgeGraphSchema'\n  );\n\n  const userPrompt = `Subject: ${subject}\\n${description ? `Description: ${description}` : ''}\\n${truncatedSyllabus ? `Syllabus:\\n${truncatedSyllabus}` : ''}\\n${gradeBand ? `Grade band: ${gradeBand[0]}-${gradeBand[1]}` : ''}\\n${domain ? `Domain: ${domain}` : ''}\\n\\nReturn JSON:\\n{\\n  \"subject\": {\\n    \"id\": \"${subject.toLowerCase().replace(/\\s+/g, '-').slice(0, 30)}\",\\n    \"name\": \"${subject}\",\\n    \"description\": \"...\",\\n    \"domain\": \"${domain || 'other'}\",\\n    \"grade_band\": ${gradeBand ? `[${gradeBand[0]}, ${gradeBand[1]}]` : '[6, 12]'}\\n  },\\n  \"concepts\": [\\n    {\\n      \"id\": \"C1\",\\n      \"name\": \"Concept name\",\\n      \"description\": \"Brief description\",\\n      \"category\": \"category_id\",\\n      \"ulo\": \"WHAT + WHY in technology-agnostic language: what the concept is and the problem it exists to solve. No library/API/tool names.\",\\n      \"cio\": \"HOW the mechanism works, still technology-agnostic but more concrete than the ULO.\",\\n      \"sio\": [\"Concrete task naming a REAL API/function/module/file from the target technology, completable end to end\", \"Another technology-bound task using a different concrete keyword\"],\\n      \"prerequisites\": [],\\n      \"estimated_minutes\": 30,\\n      \"problem_types\": [\\n        {\\n          \"id\": \"PT-C1-01\",\\n          \"name\": \"Problem type name\",\\n          \"description\": \"What this problem type tests\",\\n          \"bloom_level\": \"Remember\",\\n          \"difficulty\": \"easy\",\\n          \"estimated_minutes\": 10\\n        }\\n      ],\\n      \"techniques\": [\"technique 1\", \"technique 2\"],\\n      \"common_mistakes\": [\"mistake 1\"]\\n    }\\n  ],\\n  \"categories\": [\\n    {\\n      \"id\": \"cat1\",\\n      \"name\": \"Category name\",\\n      \"description\": \"Category description\",\\n      \"concept_ids\": [\"C1\", \"C2\"],\\n      \"order\": 1\\n    }\\n  ],\\n  \"learning_path\": [\\n    {\"concept_id\": \"C1\", \"order\": 1, \"depends_on\": []},\\n    {\"concept_id\": \"C2\", \"order\": 2, \"depends_on\": [\"C1\"]}\\n  ]\\n}`;\n\n  const result = await llmChatJson(client, systemPrompt, userPrompt, {\n    temperature: 0.1,\n    maxTokens: parseInt(process.env.KG_MAX_TOKENS || '65536', 10),\n  });\n\n  // ─── Step 2: Validate and clean ──────────────────────────────────────────\n  log('STEP_2', 'Validating and cleaning knowledge graph...');\n\n  const concepts = (result.concepts || []) as Concept[];\n  const categories = (result.categories || []) as ConceptCategory[];\n  // Keyword registry (fail-closed): every concept MUST carry a non-empty\n  // keyword set — it drives the keyword-progression ledger and the SIO binding\n  // audit downstream. LLM output is top-up (description tokens), never empty.\n  {\n    const STOP = new Set(['and', 'the', 'for', 'with', 'from', 'that', 'this', 'into', 'when', 'while', 'using', 'their', 'your', 'each', 'how', 'why', 'what', 'between', 'through', 'about']);\n    const tokensFrom = (text: string): string[] => text\n      .toLowerCase()\n      .replace(/[^a-z0-9\\s-]/g, ' ')\n      .split(/\\s+/)\n      .filter(w => w.length >= 4 && !STOP.has(w));\n    for (const c of concepts) {\n      const existing = (c.keywords || []).map(k => String(k).trim()).filter(Boolean);\n      if (existing.length === 0) {\n        const derived = [...new Set([...tokensFrom(c.name), ...tokensFrom(c.description || '')])].slice(0, 5);\n        if (derived.length === 0) {\n          throw new Error('Concept ' + c.id + ' (' + c.name + ') has no keywords and none could be derived from name/description — fail-closed');\n        }\n        c.keywords = derived;\n        warnings.push('Concept ' + c.id + ': empty keyword set - derived ' + derived.join(', ') + ' from name/description');\n      } else {\n        c.keywords = existing;\n      }\n    }\n  }\n  const rawPath = result.learning_path as Array<Record<string, unknown>> | undefined;\n  let learningPath: LearningPathStep[] = (rawPath || []).map((s: Record<string, unknown>) => ({\n      concept_id: String(s.concept_id || ''),\n      order: Number(s.order || 0),\n      depends_on: Array.isArray(s.depends_on) ? s.depends_on.map(String) : [],\n      milestone_name: String(s.milestone_name || ''),\n    }));\n\n  // Validate prerequisites reference existing concepts\n  const conceptIds = new Set(concepts.map(c => c.id));\n  for (const concept of concepts) {\n    for (const prereq of concept.prerequisites || []) {\n      if (!conceptIds.has(prereq)) {\n        warnings.push(`Concept ${concept.id} references non-existent prerequisite ${prereq} — removed`);\n        concept.prerequisites = (concept.prerequisites || []).filter(p => p !== prereq);\n      }\n    }\n  }\n\n  // ─── Step 2.5: Standardize concepts against the knowledge tree ───────────\n  // keyword -> escalate -> concept (upstream) -> HERE: LLM standardization vs\n  // tree catalog (deterministic category pre-filter) -> downstream steps use\n  // standardized / proposed codes. Fail-closed.\n  if (options.knowledgeTreePath) {\n    const catalog = loadKnowledgeTreeCatalog(options.knowledgeTreePath);\n    log('STEP_2_5', 'Knowledge tree loaded: ' + catalog.concepts.length + ' concepts from ' + catalog.path.split('/').pop());\n    const std = await standardizeConcepts({\n      client,\n      concepts: concepts.map((c) => ({\n        id: c.id,\n        name: c.name,\n        description: c.description || '',\n        keywords: c.keywords || [],\n      })),\n      catalog,\n      techStack,\n      proposalsPath: options.proposalsPath,\n      onProgress: log,\n    });\n    warnings.push(...std.warnings);\n    const codeByStd = new Map(std.decisions.map((d) => [d.id, d]));\n    for (const c of concepts) {\n      const d = codeByStd.get(c.id);\n      if (!d) throw new Error('Concept ' + c.id + ' missing standardization decision — fail-closed');\n      if (d.decision === 'standardized') {\n        c.standardization = 'standardized';\n        c.tree_code = d.tree_code;\n        c.code = d.tree_code;\n        const tc = catalog.concepts.find((x) => x.code === d.tree_code);\n        if (tc) {\n          // Keyword enrichment is LLM-driven: only the keywords the standardizer\n          // ADOPTED for this tech stack join the registry (no code-side blacklist).\n          for (const k of d.adopted_keywords || []) {\n            if (!(c.keywords || []).some((x) => x.toLowerCase() === k.toLowerCase())) {\n              c.keywords = [...(c.keywords || []), k];\n            }\n          }\n          c.tree_prerequisites = tc.prerequisiteCodes;\n        }\n      } else {\n        c.standardization = 'proposed_new';\n        c.code = d.proposed_code;\n      }\n    }\n    // Seed internal prerequisite edges from the tree's prerequisite codes:\n    // only mapped when the referenced tree concept is part of THIS analysis.\n    const idByTreeCode = new Map(concepts.filter((c) => c.tree_code).map((c) => [c.tree_code as string, c.id]));\n    for (const c of concepts) {\n      for (const tp of c.tree_prerequisites || []) {\n        const target = idByTreeCode.get(tp);\n        if (target && target !== c.id && !(c.prerequisites || []).includes(target)) {\n          c.prerequisites = [...(c.prerequisites || []), target];\n          warnings.push('Prereq seeded from tree: ' + c.id + ' <- ' + tp + ' (' + target + ')');\n        }\n      }\n    }\n    log('STEP_2_5', 'Standardized: ' + std.decisions.filter((d) => d.decision === 'standardized').length\n      + ', proposed new: ' + std.decisions.filter((d) => d.decision === 'proposed_new').length);\n  }\n\n  // ─── Step 3: Cycle Detection ─────────────────────────────────────────────\n  log('STEP_3', 'Checking for prerequisite cycles...');\n\n  const cycles = detectCycles(concepts);\n  if (cycles.length > 0) {\n    log('STEP_3', `Found ${cycles.length} cycle(s) in prerequisite chain — breaking cycles`);\n    for (const cycle of cycles) {\n      warnings.push(`Cycle detected: ${cycle.join(' → ')} — breaking at weakest edge`);\n    }\n\n    const { fixed, removed } = breakCycles(concepts, cycles);\n    // Replace concepts with cycle-free versions\n    for (let i = 0; i < concepts.length; i++) {\n      const fixedConcept = fixed.find(f => f.id === concepts[i].id);\n      if (fixedConcept) {\n        concepts[i] = { ...concepts[i], prerequisites: fixedConcept.prerequisites };\n      }\n    }\n\n    for (const { from, to } of removed) {\n      warnings.push(`Removed prerequisite edge: ${from} → ${to} (cycle breaker)`);\n    }\n  }\n\n  // ─── Step 4: Topological Sort ────────────────────────────────────────────\n  log('STEP_4', 'Topological sort of concepts...');\n\n  const sortedIds = topologicalSort(concepts);\n\n  // Rebuild learning_path from topological sort\n  learningPath = sortedIds.map((id, idx) => {\n    const concept = concepts.find(c => c.id === id);\n    return {\n      concept_id: id,\n      order: idx + 1,\n      depends_on: concept?.prerequisites || [],\n      milestone_name: '',\n    };\n  });\n\n  // ─── Step 5: Hierarchical ULO/CIO/SIO authoring (ported from knowledge-tree) ──\n  log('STEP_5', 'Authoring ULO/CIO/SIO depth layers hierarchically...');\n\n  {\n    const lo = await authorDepthLayersHierarchically(\n      client,\n      concepts.map((c) => ({ id: c.id, name: c.name, description: c.description, keywords: c.keywords })),\n      techStack || (domain === 'software' || domain === 'technology' ? 'python' : (domain || 'general')),\n      warnings,\n    );\n    const codeByConceptId = assignConceptCodes(concepts.map((c) => ({ id: c.id, name: c.name })));\n    const techTag = techTagFor(techStack || (domain === 'software' || domain === 'technology' ? 'python' : (domain || 'general')));\n    for (const concept of concepts) {\n      concept.ulo = lo.uloByConcept[concept.id] || concept.ulo || '';\n      concept.cio = lo.cioByConcept[concept.id] || concept.cio || '';\n      if (lo.sioByConcept[concept.id] && lo.sioByConcept[concept.id].length > 0) {\n        concept.sio = lo.sioByConcept[concept.id];\n      }\n      // Production-standard codes + statement clause (deterministic post-pass).\n      // A tree-standardized or proposed code from STEP_2_5 wins — the generated\n      // code only fills concepts the standardizer never saw.\n      concept.code = concept.code || codeByConceptId[concept.id];\n      concept.ulo_code = concept.ulo ? uloCode(concept.code!) : concept.ulo_code;\n      concept.cio_code = concept.cio ? cioCode(concept.code!, 1, cioActionSlug(concept.cio)) : concept.cio_code;\n      concept.sio_codes = concept.sio.length > 0\n        ? concept.sio.map((_, i) => sioCode(techTag, concept.code!, i + 1))\n        : concept.sio_codes;\n    }\n    log('STEP_5', 'Depth layers authored: ' + concepts.length + ' concepts, audit ' +\n      (lo.audits.filter((a) => a.passed).length) + '/' + concepts.length + ' passed');\n  }\n\n  // Validate learning_path references\n  for (const step of learningPath) {\n    if (!conceptIds.has(step.concept_id)) {\n      warnings.push(`Learning path references non-existent concept ${step.concept_id}`);\n    }\n  }\n\n  log('STEP_2', `Validated ${concepts.length} concepts, ${categories.length} categories, ${learningPath.length} learning path steps`);\n\n  return {\n    knowledgeGraph: {\n      schema_version: 1,\n      type: 'knowledge_graph',\n      subject: result.subject as KnowledgeGraph['subject'],\n      concepts,\n      categories,\n      learning_path: learningPath,\n    },\n    warnings,\n  };\n}\n","/**\n * Hybrid Graph Pipeline - generates hybrid_graph combining project + knowledge.\n *\n * STEP_1 generates feature-concept links. STEP_2 decomposes the build into\n * PROGRESSIVE COMPLETION PHASES (cross-feature): each phase describes what the\n * product can demonstrably do once complete, owns every feature built in it\n * (each feature in EXACTLY one phase), and declares which concepts are\n * introduced (new) or revisited at higher depth (advanced) at the phase start.\n * Later phases depend on earlier ones and may only raise the knowledge level -\n * verified against the concept prerequisite graph (fail-closed).\n */\n\nimport { createLlmClient, llmChatJson, type LlmClientConfig } from '../utils/llmClient';\nimport type { ProjectGraph } from '../schemas/projectGraphSchema';\nimport type { KnowledgeGraph } from '../schemas/knowledgeGraphSchema';\nimport type {\n  HybridGraph, ProjectConceptLink, DevelopmentPhase, ConceptIntroduction,\n} from '../schemas/hybridGraphSchema';\n\nexport interface HybridGraphPipelineOptions {\n  projectGraph: ProjectGraph;\n  knowledgeGraph: KnowledgeGraph;\n  llmConfig?: LlmClientConfig;\n  onProgress?: (step: string, message: string) => void;\n}\n\nexport interface HybridGraphPipelineResult {\n  hybridGraph: HybridGraph;\n  warnings: string[];\n}\n\nexport async function generateHybridGraph(\n  options: HybridGraphPipelineOptions,\n): Promise<HybridGraphPipelineResult> {\n  const { projectGraph, knowledgeGraph, llmConfig, onProgress } = options;\n  const warnings: string[] = [];\n\n  const log = (step: string, msg: string) => {\n    console.log('[HG-' + step + '] ' + msg);\n    onProgress?.(step, msg);\n  };\n\n  const features = projectGraph.features || [];\n  const concepts = knowledgeGraph.concepts || [];\n\n  if (features.length === 0 || concepts.length === 0) {\n    warnings.push('No features or concepts to link');\n    return {\n      hybridGraph: {\n        schema_version: 1,\n        type: 'hybrid_graph',\n        project_graph: projectGraph,\n        knowledge_graph: knowledgeGraph,\n        links: [],\n        phases: [],\n        description: '',\n        total_project_minutes: 0,\n        total_concept_minutes: 0,\n        estimated_total_minutes: 0,\n      },\n      warnings,\n    };\n  }\n\n  const client = createLlmClient(llmConfig);\n\n  const featuresList = features.map(f =>\n    '- ' + f.id + ': ' + f.name + ' - ' + (f.description || '') +\n    ' (keywords: ' + (f.steps || []).flatMap(s => s.keywords || []).slice(0, 5).join(', ') + ')',\n  ).join('\\n');\n\n  const conceptsList = concepts.map(c =>\n    '- ' + c.id + ': ' + c.name + ' - ULO: ' + (c.ulo || '').slice(0, 100) +\n    ' (prerequisites: ' + (c.prerequisites || []).join(', ') + ')',\n  ).join('\\n');\n\n  const systemPrompt = (\n    'You are a curriculum architect. Link project features to knowledge concepts.\\n'\n    + 'For each feature, determine which concepts it requires or demonstrates.\\n\\n'\n    + 'RULES:\\n'\n    + '1. Each link must have a relationship type: requires | demonstrates | applies | extends\\n'\n    + '2. depth indicates how deeply the feature needs the concept:\\n'\n    + '   - ulo: feature only needs WHAT+WHY understanding\\n'\n    + '   - cio: feature needs HOW understanding\\n'\n    + '   - sio: feature needs specific implementation knowledge\\n'\n    + '3. estimated_prereq_minutes: how many minutes of concept learning before this feature\\n'\n    + '4. Not every feature needs every concept - only create meaningful links\\n'\n    + '5. Return JSON object with a links array'\n  );\n\n  const userPrompt = 'FEATURES:\\n' + featuresList + '\\n\\nCONCEPTS:\\n' + conceptsList + '\\n\\n'\n    + 'Create links between features and concepts. Return JSON.\\n';\n\n  const result = await llmChatJson(client, systemPrompt, userPrompt, {\n    temperature: 0.1,\n    maxTokens: 16384,\n  });\n\n  const rawLinks = (result.links || []) as Array<Record<string, unknown>>;\n\n  const featureIds = new Set(features.map(f => f.id));\n  const conceptIds = new Set(concepts.map(c => c.id));\n  const validLinks: ProjectConceptLink[] = [];\n\n  for (const link of rawLinks) {\n    const fid = String(link.feature_id || '');\n    const cid = String(link.concept_id || '');\n    if (!featureIds.has(fid)) {\n      warnings.push('Link references non-existent feature ' + fid);\n      continue;\n    }\n    if (!conceptIds.has(cid)) {\n      warnings.push('Link references non-existent concept ' + cid);\n      continue;\n    }\n    validLinks.push({\n      feature_id: fid,\n      concept_id: cid,\n      relationship: (link.relationship as 'requires' | 'demonstrates' | 'applies' | 'extends') || 'requires',\n      depth: (link.depth as 'ulo' | 'cio' | 'sio') || 'cio',\n      description: String(link.description || ''),\n      estimated_prereq_minutes: Number(link.estimated_prereq_minutes) || 0,\n      phase_id: '',\n    });\n  }\n\n  log('STEP_1', 'Generated ' + validLinks.length + ' feature-concept links');\n\n  const phases = await decomposePhases({\n    features, concepts, links: validLinks, client, log, warnings,\n  });\n  const phaseByFeature = new Map<string, string>();\n  for (const ph of phases) {\n    for (const fid of ph.feature_ids) phaseByFeature.set(fid, ph.id);\n  }\n  for (const link of validLinks) link.phase_id = phaseByFeature.get(link.feature_id) || '';\n\n  log('STEP_3', 'Calculating totals...');\n\n  const totalProjectMinutes = features.reduce((sum, f) => {\n    const featureMinutes = (f.steps || []).reduce((s, step) => s + (step.effort?.estimated_minutes || 15), 0);\n    return sum + featureMinutes;\n  }, 0);\n\n  const totalConceptMinutes = concepts.reduce((sum, c) => sum + (c.estimated_minutes || 30), 0);\n\n  const prereqMinutesByConcept = new Map<string, number>();\n  for (const link of validLinks) {\n    const mins = link.estimated_prereq_minutes || 0;\n    if (mins > 0) {\n      const existing = prereqMinutesByConcept.get(link.concept_id) || 0;\n      prereqMinutesByConcept.set(link.concept_id, Math.max(existing, mins));\n    }\n  }\n  const totalPrereqMinutes = Array.from(prereqMinutesByConcept.values()).reduce((a, b) => a + b, 0);\n\n  return {\n    hybridGraph: {\n      schema_version: 1,\n      type: 'hybrid_graph',\n      project_graph: projectGraph,\n      knowledge_graph: knowledgeGraph,\n      links: validLinks,\n      phases,\n      description: 'Progressive completion path: ' + phases.length + ' phases, ' + features.length + ' features, ' + concepts.length + ' concepts',\n      total_project_minutes: totalProjectMinutes,\n      total_concept_minutes: totalConceptMinutes,\n      estimated_total_minutes: totalProjectMinutes + totalPrereqMinutes,\n    },\n    warnings,\n  };\n}\n\ninterface DecomposePhasesArgs {\n  features: ProjectGraph['features'];\n  concepts: KnowledgeGraph['concepts'];\n  links: ProjectConceptLink[];\n  client: ReturnType<typeof createLlmClient>;\n  log: (step: string, msg: string) => void;\n  warnings: string[];\n}\nfunction auditPhasePlan(\n  plan: Array<Record<string, unknown>>,\n  features: Array<{ id: string }>,\n  concepts: Array<{ id: string; prerequisites?: string[] }>,\n  links: Array<{ feature_id: string; concept_id: string }>,\n  warnings: string[],\n  log: (step: string, msg: string) => void,\n): { phases: DevelopmentPhase[]; errors: string[] } {\n  const knownFeatureIds = new Set(features.map(f => f.id));\n  const knownConceptIds = new Set(concepts.map(c => c.id));\n  const prereqOf = new Map<string, string[]>();\n  for (const c of concepts) prereqOf.set(c.id, (c.prerequisites || []).filter(p => knownConceptIds.has(p)));\n\n  const phases: DevelopmentPhase[] = [];\n  const featurePhase = new Map<string, string>();\n  const newIntroPhase = new Map<string, number>();\n  const errors: string[] = [];\n\n  plan.forEach((rp, idx) => {\n    const id = String(rp.id || ('PH' + (idx + 1)));\n    const order = idx + 1;\n    const name = String(rp.name || ('Phase ' + order)).slice(0, 80);\n    const productCompletion = String(rp.product_completion || '').trim();\n    const rawFeatureIds = Array.isArray(rp.feature_ids) ? rp.feature_ids.map(String) : [];\n    const rawIntros = Array.isArray(rp.introduces) ? (rp.introduces as Array<Record<string, unknown>>) : [];\n\n    if (!productCompletion) {\n      errors.push('Phase ' + id + ': product_completion is empty - every phase must describe the product completion level');\n    }\n\n    const featureIdsForPhase: string[] = [];\n    for (const fid of rawFeatureIds) {\n      if (!knownFeatureIds.has(fid)) {\n        errors.push('Phase ' + id + ': unknown feature ' + fid);\n        continue;\n      }\n      if (featurePhase.has(fid)) {\n        errors.push('Feature ' + fid + ' assigned to both ' + featurePhase.get(fid) + ' and ' + id + ' - each feature must belong to exactly one phase');\n        continue;\n      }\n      featurePhase.set(fid, id);\n      featureIdsForPhase.push(fid);\n    }\n\n    const introductions: ConceptIntroduction[] = [];\n    for (const ri of rawIntros) {\n      const cid = String(ri.concept_id || '');\n      if (!knownConceptIds.has(cid)) {\n        errors.push('Phase ' + id + ': introduces unknown concept ' + cid);\n        continue;\n      }\n      const aspect = String(ri.aspect || 'new') === 'advanced' ? 'advanced' : 'new';\n      if (aspect === 'advanced') {\n        const first = newIntroPhase.get(cid);\n        if (first === undefined) {\n          errors.push('Phase ' + id + ': advanced introduction of ' + cid + ' before any new introduction - revisit requires prior introduction');\n          continue;\n        }\n        if (first >= order) {\n          errors.push('Phase ' + id + ': advanced introduction of ' + cid + ' must come after its new introduction in phase ' + first);\n          continue;\n        }\n      } else if (newIntroPhase.has(cid)) {\n        errors.push('Phase ' + id + ': duplicate new introduction of ' + cid + ' (already introduced in phase ' + newIntroPhase.get(cid) + ')');\n        continue;\n      } else {\n        newIntroPhase.set(cid, order);\n      }\n      for (const pre of prereqOf.get(cid) || []) {\n        if (!newIntroPhase.has(pre)) {\n          errors.push('Phase ' + id + ': concept ' + cid + ' introduced before its prerequisite ' + pre + ' is introduced - violates the prerequisite chain');\n        }\n      }\n      introductions.push({ concept_id: cid, aspect, note: String(ri.note || '') });\n    }\n\n    phases.push({\n      id, order, name,\n      product_completion: productCompletion,\n      feature_ids: featureIdsForPhase,\n      introduces: introductions,\n    });\n  });\n\n  const missing = features.map(f => f.id).filter(fid => !featurePhase.has(fid));\n  if (missing.length > 0) {\n    errors.push('Features not assigned to any phase: ' + missing.join(', '));\n  }\n  const firstConsumerPhase = new Map<string, number>();\n  const phaseOrderByFeature = new Map<string, number>();\n  for (const ph of phases) for (const fid of ph.feature_ids) phaseOrderByFeature.set(fid, ph.order);\n  for (const l of links) {\n    const po = phaseOrderByFeature.get(l.feature_id);\n    if (po === undefined) continue;\n    const cur = firstConsumerPhase.get(l.concept_id);\n    if (cur === undefined || po < cur) firstConsumerPhase.set(l.concept_id, po);\n  }\n  for (const [cid, consumerOrder] of firstConsumerPhase) {\n    const intro = newIntroPhase.get(cid);\n    if (intro === undefined) {\n      errors.push('Concept ' + cid + ' is consumed from phase ' + consumerOrder + ' but never introduced in any phase');\n    } else if (intro > consumerOrder) {\n      errors.push('Concept ' + cid + ' introduced in phase ' + intro + ' but first consumed in phase ' + consumerOrder + ' - introduction must come no later than first consumption');\n    }\n  }\n\n  return { phases, errors };\n}\n\nasync function decomposePhases(args: DecomposePhasesArgs): Promise<DevelopmentPhase[]> {\n  const { features, concepts, links, client, log, warnings } = args;\n\n  const featureList = features.map(f =>\n    '- ' + f.id + ': ' + f.name + ' - ' + (f.description || '').slice(0, 120),\n  ).join('\\n');\n\n  const conceptList = concepts.map(c =>\n    '- ' + c.id + ': ' + c.name + ' (prerequisites: ' + ((c.prerequisites || []).join(', ') || 'none') + ')',\n  ).join('\\n');\n\n  const linkList = links.map(l =>\n    '- ' + l.feature_id + ' -> ' + l.concept_id + ' (' + l.depth + ')',\n  ).join('\\n') || '(none)';\n\n  const systemPrompt = (\n    'You decompose a software project build into PROGRESSIVE COMPLETION PHASES for learning purposes.\\n\\n'\n    + 'A phase is NOT a feature and NOT a milestone list: it is a cross-feature slice of the\\n'\n    + 'product whose completion yields a DEMONSTRABLY more complete product. Build up gradually:\\n'\n    + 'the product grows feature by feature across phases, and each phase adds its features to\\n'\n    + 'what previous phases already built.\\n\\n'\n    + 'RULES:\\n'\n    + '1. Every feature must be assigned to EXACTLY ONE phase (no feature reused, none skipped).\\n'\n    + '2. Phases are ordered; later phases depend on earlier ones and yield a more complete product.\\n'\n    + '3. product_completion describes concretely what the product can DO once the phase is done.\\n'\n    + '4. introduces lists which concepts the phase must teach BEFORE its feature work starts:\\n'\n    + '   - aspect new: first time the concept appears in the course\\n'\n    + '   - aspect advanced: a concept introduced in an EARLIER phase, revisited here at a\\n'\n    + '     higher depth (an advanced aspect of the same concept, e.g. validation rules on top\\n'\n    + '     of basic data modeling). Use the note field to say which aspect.\\n'\n    + '5. A concept MUST be introduced (new) no later than the first phase that consumes it.\\n'\n    + '6. A concept must not be introduced before its own prerequisites are introduced.\\n'\n    + '7. Typically 3-6 phases for a small project; keep phases balanced.\\n'\n    + '8. Phase 1 usually covers project setup/foundation features plus the first minimal slice.\\n'\n    + '9. Return JSON only.'\n  );\n\n  const baseUserPrompt = 'FEATURES:\\n' + featureList + '\\n\\nCONCEPTS:\\n' + conceptList\n    + '\\n\\nFEATURE-CONCEPT LINKS:\\n' + linkList + '\\n\\n'\n    + 'Return JSON with a phases array. Each phase: { id: PH1, name, product_completion, feature_ids: [F0, F1], introduces: [{ concept_id: C1, aspect: new or advanced, note }] }.\\n';\n\n  // Repair loop (same fail-closed philosophy as STEP_5 depth authoring): the audit below is\n  // deterministic, so violations are fed back verbatim and the model rewrites the plan.\n  const MAX_DECOMPOSE_ATTEMPTS = 3;\n  let auditErrors: string[] = [];\n  let phases: DevelopmentPhase[] = [];\n  let rawPhases: Array<Record<string, unknown>> = [];\n  for (let attempt = 1; attempt <= MAX_DECOMPOSE_ATTEMPTS; attempt++) {\n    const userPrompt = attempt === 1\n      ? baseUserPrompt\n      : baseUserPrompt\n        + '\\nYOUR PREVIOUS PLAN VIOLATED THESE CONTRACT RULES (fix ALL of them):\\n'\n        + auditErrors.map((e) => '- ' + e).join('\\n')\n        + '\\nReturn a corrected full phases array.\\n';\n\n    const result = await llmChatJson(client, systemPrompt, userPrompt, {\n      temperature: 0.1,\n      maxTokens: 16384,\n    });\n\n    rawPhases = (result.phases || []) as Array<Record<string, unknown>>;\n    if (rawPhases.length === 0) {\n      if (attempt === MAX_DECOMPOSE_ATTEMPTS) {\n        throw new Error('Phase decomposition returned zero phases - fail-closed abort');\n      }\n      auditErrors = ['Returned zero phases'];\n      continue;\n    }\n\n    ({ phases, errors: auditErrors } = auditPhasePlan(rawPhases, features, concepts, links, warnings, log));\n    if (auditErrors.length === 0) break;\n    if (attempt < MAX_DECOMPOSE_ATTEMPTS) {\n      log('STEP_2', 'Contract violations (' + auditErrors.length + ') - repairing (attempt ' + (attempt + 1) + '/' + MAX_DECOMPOSE_ATTEMPTS + ')');\n    }\n  }\n  if (auditErrors.length > 0) {\n    throw new Error(\n      'Phase decomposition violated the progressive-completion contract (' + auditErrors.length + ' issue(s)):\\n'\n      + auditErrors.map((e) => '  - ' + e).join('\\n')\n      + '\\nRe-run the pipeline - a phase model that cannot be trusted is worse than no output.',\n    );\n  }\n\n  if (phases.length === 1 && features.length > 2) {\n    warnings.push('Only one phase for ' + features.length + ' features - progressive decomposition likely too coarse');\n  }\n\n  log('STEP_2', 'Decomposed into ' + phases.length + ' phases: '\n    + phases.map(p => p.id + '(' + p.feature_ids.length + 'F/' + p.introduces.length + 'K)').join(', '));\n  return phases;\n}\n"]}

package/dist/chunk-F4RZNBOE.mjs

@@ -1,3 +0,0 @@
-
-//# sourceMappingURL=chunk-F4RZNBOE.mjs.map
-//# sourceMappingURL=chunk-F4RZNBOE.mjs.map

package/dist/chunk-GEUDHZE7.mjs.map

@@ -1 +0,0 @@
-{"version":3,"sources":["../src/extractors/fileSelector.ts","../src/utils/fileUtils.ts","../src/pipeline/projectGraphPipeline.ts"],"names":["relative"],"mappings":";;;;;;;;;;AAsBA,eAAsB,kBAAA,CACpB,SAAA,EACA,IAAA,EACA,SAAA,EACA,SAAA,EAC8B;AAE9B,EAAA,IAAI,SAAA,CAAU,UAAU,EAAA,EAAI;AAC1B,IAAA,OAAO,EAAE,QAAA,EAAU,SAAA,EAAW,SAAA,EAAW,yBAAA,EAA0B;AAAA,EACrE;AAEA,EAAA,MAAM,MAAA,GAAS,gBAAgB,SAAS,CAAA;AAGxC,EAAA,MAAM,SAAA,GAAY,cAAc,SAAS,CAAA;AAEzC,EAAA,MAAM,YAAA,GACJ,wyBAAA;AAcF,EAAA,MAAM,UAAA,GACJ,iBAAiB,IAAI;AAAA,YAAA,EACJ,SAAS;;AAAA,WAAA,EACV,UAAU,MAAM,CAAA;AAAA,EAAa,SAAS;;AAAA,wDAAA,CAAA;AAIxD,EAAA,IAAI;AACF,IAAA,MAAM,MAAA,GAAS,MAAM,WAAA,CAAY,MAAA,EAAQ,cAAc,UAAA,EAAY;AAAA,MACjE,WAAA,EAAa,GAAA;AAAA,MACb,SAAA,EAAW;AAAA,KACZ,CAAA;AAED,IAAA,MAAM,QAAA,GAAW,MAAM,OAAA,CAAQ,MAAA,CAAO,QAAQ,CAAA,GAAI,MAAA,CAAO,WAAuB,EAAC;AACjF,IAAA,MAAM,SAAA,GAAY,MAAA,CAAO,MAAA,CAAO,SAAA,IAAa,EAAE,CAAA;AAG/C,IAAA,MAAM,OAAA,GAAU,IAAI,GAAA,CAAI,SAAS,CAAA;AACjC,IAAA,MAAM,gBAAgB,QAAA,CAAS,MAAA,CAAO,OAAK,OAAA,CAAQ,GAAA,CAAI,CAAC,CAAC,CAAA;AAEzD,IAAA,IAAI,aAAA,CAAc,WAAW,CAAA,EAAG;AAE9B,MAAA,OAAO,EAAE,QAAA,EAAU,SAAA,EAAW,SAAA,EAAW,sCAAA,EAAuC;AAAA,IAClF;AAEA,IAAA,OAAO,EAAE,QAAA,EAAU,aAAA,EAAe,SAAA,EAAU;AAAA,EAC9C,SAAS,GAAA,EAAK;AACZ,IAAA,OAAA,CAAQ,IAAA,CAAK,CAAA,kCAAA,EAAqC,GAAG,CAAA,kBAAA,CAAoB,CAAA;AACzE,IAAA,OAAO,EAAE,QAAA,EAAU,SAAA,EAAW,SAAA,EAAW,CAAA,YAAA,EAAe,GAAG,CAAA,CAAA,EAAG;AAAA,EAChE;AACF;AAMA,SAAS,cAAc,SAAA,EAA6B;AAClD,EAAA,MAAM,KAAA,uBAAY,GAAA,EAAsB;AAExC,EAAA,KAAA,MAAW,MAAM,SAAA,EAAW;AAC1B,IAAA,MAAM,KAAA,GAAQ,EAAA,CAAG,KAAA,CAAM,GAAG,CAAA;AAC1B,IAAA,MAAM,GAAA,GAAM,KAAA,CAAM,MAAA,GAAS,CAAA,GAAI,KAAA,CAAM,KAAA,CAAM,CAAA,EAAG,EAAE,CAAA,CAAE,IAAA,CAAK,GAAG,CAAA,GAAI,QAAA;AAC9D,IAAA,MAAM,IAAA,GAAO,KAAA,CAAM,KAAA,CAAM,MAAA,GAAS,CAAC,CAAA;AACnC,IAAA,IAAI,CAAC,MAAM,GAAA,CAAI,GAAG,GAAG,KAAA,CAAM,GAAA,CAAI,GAAA,EAAK,EAAE,CAAA;AACtC,IAAA,KAAA,CAAM,GAAA,CAAI,GAAG,CAAA,CAAG,IAAA,CAAK,IAAI,CAAA;AAAA,EAC3B;AAEA,EAAA,MAAM,QAAkB,EAAC;AACzB,EAAA,KAAA,MAAW,CAAC,GAAA,EAAK,KAAK,CAAA,IAAK,KAAA,EAAO;AAChC,IAAA,KAAA,CAAM,IAAA,CAAK,CAAA,EAAG,GAAG,CAAA,CAAA,CAAG,CAAA;AACpB,IAAA,KAAA,MAAW,CAAA,IAAK,KAAA,CAAM,IAAA,EAAK,EAAG;AAC5B,MAAA,KAAA,CAAM,IAAA,CAAK,CAAA,EAAA,EAAK,CAAC,CAAA,CAAE,CAAA;AAAA,IACrB;AAAA,EACF;AAEA,EAAA,OAAO,KAAA,CAAM,KAAK,IAAI,CAAA;AACxB;ACjEO,SAAS,kBAAA,CACd,KACA,OAAA,EAKU;AACV,EAAA,MAAM,WAAA,GAA4C,CAAC,UAAU,KAAA,EAAO,MAAA,EAAQ,KAAA,EAAO,MAAA,EAAQ,KAAA,EAAO,MAAA,EAAQ,MAAA,EAAQ,IAAA,EAAM,MAAM,MAAM,CAAA;AACpI,EAAA,MAAM,QAAA,GAAgC,EAAA;AAGtC,EAAA,MAAM,QAAA,GAAW,aAAA,CAAc,GAAA,EAAK,WAAA,EAAa,QAAQ,CAAA;AACzD,EAAA,IAAI,QAAA,CAAS,MAAA,GAAS,CAAA,EAAG,OAAO,QAAA;AAGhC,EAAA,OAAO,oBAAA,CAAqB,GAAA,EAAK,WAAA,EAAa,QAA2B,CAAA;AAC3E;AAMA,SAAS,aAAA,CAAc,GAAA,EAAa,WAAA,EAAuB,QAAA,EAA4B;AACrF,EAAA,IAAI;AACF,IAAA,MAAM,GAAA,GAAM,SAAS,mDAAA,EAAqD;AAAA,MACxE,GAAA,EAAK,GAAA;AAAA,MACL,QAAA,EAAU,OAAA;AAAA,MACV,OAAA,EAAS,GAAA;AAAA,MACT,WAAW,IAAA,GAAO;AAAA,KACnB,CAAA;AACD,IAAA,MAAM,MAAA,GAAS,IAAI,GAAA,CAAI,WAAA,CAAY,IAAI,CAAA,CAAA,KAAK,CAAA,CAAE,WAAA,EAAa,CAAC,CAAA;AAC5D,IAAA,OAAO,GAAA,CACJ,KAAA,CAAM,IAAI,CAAA,CACV,MAAA,CAAO,CAAA,IAAA,KAAQ,IAAA,CAAK,MAAA,GAAS,CAAC,CAAA,CAC9B,MAAA,CAAO,CAAA,IAAA,KAAQ,OAAO,GAAA,CAAI,OAAA,CAAQ,IAAI,CAAA,CAAE,WAAA,EAAa,CAAC,CAAA,CACtD,KAAA,CAAM,CAAA,EAAG,QAAQ,CAAA,CACjB,GAAA,CAAI,CAAA,GAAA,KAAO,IAAA,CAAK,GAAA,EAAK,GAAG,CAAC,CAAA;AAAA,EAC9B,CAAA,CAAA,MAAQ;AAEN,IAAA,OAAO,EAAC;AAAA,EACV;AACF;AAKA,SAAS,oBAAA,CACP,GAAA,EACA,WAAA,EACA,QAAA,EACA,QAAA,EACU;AACV,EAAA,MAAM,OAAA,GAAU,IAAI,GAAA,CAAgB;AAAA,IAClC,cAAA;AAAA,IAAgB,QAAA;AAAA,IAAU,MAAA;AAAA,IAAQ,MAAA;AAAA,IAAQ,OAAA;AAAA,IAAS,MAAA;AAAA,IACnD,aAAA;AAAA,IAAe,OAAA;AAAA,IAAS,MAAA;AAAA,IAAQ,OAAA;AAAA,IAAS,SAAA;AAAA,IACzC,MAAA;AAAA,IAAQ,OAAA;AAAA,IAAS,MAAA;AAAA,IAAQ,QAAA;AAAA,IAAU,SAAA;AAAA,IAAW;AAAA,GAC/C,CAAA;AACD,EAAA,MAAM,MAAA,GAAS,IAAI,GAAA,CAAI,WAAA,CAAY,IAAI,CAAA,CAAA,KAAK,CAAA,CAAE,WAAA,EAAa,CAAC,CAAA;AAC5D,EAAA,MAAM,SAAmB,EAAC;AAE1B,EAAA,SAAS,KAAK,UAAA,EAAoB;AAChC,IAAA,IAAI,MAAA,CAAO,UAAU,QAAA,EAAU;AAC/B,IAAA,IAAI,OAAA;AACJ,IAAA,IAAI;AACF,MAAA,OAAA,GAAU,WAAA,CAAY,UAAA,EAAY,EAAE,aAAA,EAAe,MAAM,CAAA;AAAA,IAC3D,CAAA,CAAA,MAAQ;AACN,MAAA;AAAA,IACF;AACA,IAAA,KAAA,MAAW,SAAS,OAAA,EAAS;AAC3B,MAAA,IAAI,MAAA,CAAO,UAAU,QAAA,EAAU;AAC/B,MAAA,MAAM,QAAA,GAAW,IAAA,CAAK,UAAA,EAAY,KAAA,CAAM,IAAI,CAAA;AAC5C,MAAA,IAAI,KAAA,CAAM,aAAY,EAAG;AACvB,QAAA,IAAI,CAAC,OAAA,CAAQ,GAAA,CAAI,KAAA,CAAM,IAAI,CAAA,EAAG;AAC5B,UAAA,IAAA,CAAK,QAAQ,CAAA;AAAA,QACf;AAAA,MACF,CAAA,MAAA,IAAW,KAAA,CAAM,MAAA,EAAO,EAAG;AACzB,QAAA,MAAM,GAAA,GAAM,OAAA,CAAQ,KAAA,CAAM,IAAI,EAAE,WAAA,EAAY;AAC5C,QAAA,IAAI,MAAA,CAAO,GAAA,CAAI,GAAG,CAAA,EAAG;AACnB,UAAA,MAAA,CAAO,KAAK,QAAQ,CAAA;AAAA,QACtB;AAAA,MACF;AAAA,IACF;AAAA,EACF;AAEA,EAAA,IAAA,CAAK,GAAG,CAAA;AACR,EAAA,OAAO,MAAA;AACT;AA6CO,SAAS,2BAAA,CACd,GAAA,EACA,aAAA,EACA,QAAA,GAAmB,GAAA,EACE;AACrB,EAAA,MAAM,QAAA,uBAAe,GAAA,EAAoB;AACzC,EAAA,IAAI,UAAA,GAAa,CAAA;AAEjB,EAAA,KAAA,MAAW,WAAW,aAAA,EAAe;AACnC,IAAA,MAAM,QAAA,GAAW,IAAA,CAAK,GAAA,EAAK,OAAO,CAAA;AAClC,IAAA,IAAI;AACF,MAAA,MAAM,OAAA,GAAU,YAAA,CAAa,QAAA,EAAU,OAAO,CAAA;AAC9C,MAAA,IAAI,UAAA,GAAa,OAAA,CAAQ,MAAA,GAAS,QAAA,EAAU;AAC1C,QAAA,MAAM,YAAY,QAAA,GAAW,UAAA;AAC7B,QAAA,IAAI,YAAY,GAAA,EAAK;AACnB,UAAA,QAAA,CAAS,IAAI,OAAA,EAAS,OAAA,CAAQ,KAAA,CAAM,CAAA,EAAG,SAAS,CAAC,CAAA;AACjD,UAAA,UAAA,IAAc,SAAA;AAAA,QAChB;AACA,QAAA;AAAA,MACF;AACA,MAAA,QAAA,CAAS,GAAA,CAAI,SAAS,OAAO,CAAA;AAC7B,MAAA,UAAA,IAAc,OAAA,CAAQ,MAAA;AAAA,IACxB,CAAA,CAAA,MAAQ;AAAA,IAER;AAAA,EACF;AAEA,EAAA,OAAO,QAAA;AACT;AAKO,SAAS,sBAAsB,SAAA,EAA6B;AACjE,EAAA,MAAM,MAAA,uBAAa,GAAA,EAAoB;AACvC,EAAA,KAAA,MAAW,MAAM,SAAA,EAAW;AAC1B,IAAA,MAAM,GAAA,GAAM,OAAA,CAAQ,EAAE,CAAA,CAAE,WAAA,EAAY;AACpC,IAAA,IAAI,IAAA,GAAO,SAAA;AACX,IAAA,IAAI,GAAA,KAAQ,UAAU,IAAA,GAAO,OAAA;AAAA,SAAA,IACpB,GAAA,KAAQ,KAAA,IAAS,GAAA,KAAQ,MAAA,EAAQ,IAAA,GAAO,YAAA;AAAA,SAAA,IACxC,GAAA,KAAQ,KAAA,IAAS,GAAA,KAAQ,MAAA,EAAQ,IAAA,GAAO,YAAA;AAAA,SAAA,IACxC,GAAA,KAAQ,OAAO,IAAA,GAAO,QAAA;AAAA,SAAA,IACtB,GAAA,KAAQ,UAAU,GAAA,KAAQ,MAAA,IAAU,QAAQ,IAAA,IAAQ,GAAA,KAAQ,MAAM,IAAA,GAAO,KAAA;AAAA,SAAA,IACzE,GAAA,KAAQ,KAAA,IAAS,GAAA,KAAQ,MAAA,EAAQ,IAAA,GAAO,QAAA;AACjD,IAAA,MAAA,CAAO,IAAI,IAAA,EAAA,CAAO,MAAA,CAAO,IAAI,IAAI,CAAA,IAAK,KAAK,CAAC,CAAA;AAAA,EAC9C;AAEA,EAAA,IAAI,QAAA,GAAW,CAAA;AACf,EAAA,IAAI,OAAA,GAAU,SAAA;AACd,EAAA,KAAA,MAAW,CAAC,IAAA,EAAM,KAAK,CAAA,IAAK,MAAA,EAAQ;AAClC,IAAA,IAAI,QAAQ,QAAA,EAAU;AACpB,MAAA,QAAA,GAAW,KAAA;AACX,MAAA,OAAA,GAAU,IAAA;AAAA,IACZ;AAAA,EACF;AACA,EAAA,OAAO,OAAA;AACT;ACzLA,eAAsB,wBACpB,OAAA,EACyB;AACzB,EAAA,MAAM,EAAE,OAAA,EAAS,IAAA,EAAM,WAAW,SAAA,EAAW,UAAA,EAAY,YAAW,GAAI,OAAA;AAExE,EAAA,MAAM,GAAA,GAAM,CAAC,IAAA,EAAc,GAAA,KAAgB;AACzC,IAAA,OAAA,CAAQ,GAAA,CAAI,CAAA,CAAA,EAAI,IAAI,CAAA,EAAA,EAAK,GAAG,CAAA,CAAE,CAAA;AAC9B,IAAA,UAAA,GAAa,MAAM,GAAG,CAAA;AAAA,EACxB,CAAA;AAGA,EAAA,GAAA,CAAI,UAAU,oCAAoC,CAAA;AAElD,EAAA,MAAM,YAAA,GAAe,mBAAmB,OAAO,CAAA;AAC/C,EAAA,MAAM,cAAc,YAAA,CAAa,GAAA,CAAI,QAAMA,QAAAA,CAAS,OAAA,EAAS,EAAE,CAAC,CAAA;AAChE,EAAA,GAAA,CAAI,QAAA,EAAU,CAAA,MAAA,EAAS,WAAA,CAAY,MAAM,CAAA,2BAAA,CAA6B,CAAA;AAGtE,EAAA,GAAA,CAAI,UAAU,uDAAuD,CAAA;AAErE,EAAA,MAAM,EAAE,QAAA,EAAU,aAAA,EAAe,SAAA,KAAc,MAAM,kBAAA;AAAA,IACnD,WAAA;AAAA,IAAa,IAAA;AAAA,IAAM,SAAA;AAAA,IAAW;AAAA,GAChC;AACA,EAAA,GAAA,CAAI,QAAA,EAAU,CAAA,aAAA,EAAgB,aAAA,CAAc,MAAM,CAAA,CAAA,EAAI,WAAA,CAAY,MAAM,CAAA,QAAA,EAAW,SAAA,CAAU,KAAA,CAAM,CAAA,EAAG,GAAG,CAAC,CAAA,CAAE,CAAA;AAG5G,EAAA,GAAA,CAAI,UAAU,uCAAuC,CAAA;AAErD,EAAA,MAAM,eAAA,GAAkB,2BAAA,CAA4B,OAAA,EAAS,aAAa,CAAA;AAC1E,EAAA,MAAM,SAAA,GAAY,aAAA;AAClB,EAAA,MAAM,WAAA,GAAc,sBAAsB,SAAS,CAAA;AACnD,EAAA,GAAA,CAAI,QAAA,EAAU,qBAAqB,WAAW,CAAA,EAAA,EAAK,UAAU,MAAM,CAAA,eAAA,EAAkB,eAAA,CAAgB,IAAI,CAAA,cAAA,CAAgB,CAAA;AAGzH,EAAA,GAAA,CAAI,UAAU,iDAAiD,CAAA;AAE/D,EAAA,MAAM,kBAAmC,EAAC;AAC1C,EAAA,KAAA,MAAW,CAAC,OAAA,EAAS,OAAO,CAAA,IAAK,eAAA,EAAiB;AAChD,IAAA,MAAM,QAAA,GAAW,OAAA;AACjB,IAAA,IAAI,QAAA,CAAS,QAAA,CAAS,QAAQ,CAAA,EAAG;AAC/B,MAAA,eAAA,CAAgB,IAAA,CAAK,cAAA,CAAe,QAAA,EAAU,OAAO,CAAC,CAAA;AAAA,IACxD,WAAW,QAAA,CAAS,QAAA,CAAS,KAAK,CAAA,IAAK,SAAS,QAAA,CAAS,MAAM,CAAA,IAAK,QAAA,CAAS,SAAS,KAAK,CAAA,IAAK,QAAA,CAAS,QAAA,CAAS,MAAM,CAAA,EAAG;AACzH,MAAA,eAAA,CAAgB,IAAA,CAAK,WAAA,CAAY,QAAA,EAAU,OAAO,CAAC,CAAA;AAAA,IACrD,CAAA,MAAA,IAAW,QAAA,CAAS,QAAA,CAAS,KAAK,CAAA,EAAG;AACnC,MAAA,eAAA,CAAgB,IAAA,CAAK,eAAA,CAAgB,QAAA,EAAU,OAAO,CAAC,CAAA;AAAA,IACzD,WAAW,QAAA,CAAS,QAAA,CAAS,MAAM,CAAA,IAAK,SAAS,QAAA,CAAS,MAAM,CAAA,IAAK,QAAA,CAAS,SAAS,IAAI,CAAA,IAAK,QAAA,CAAS,QAAA,CAAS,IAAI,CAAA,EAAG;AACvH,MAAA,eAAA,CAAgB,IAAA,CAAK,YAAA,CAAa,QAAA,EAAU,OAAO,CAAC,CAAA;AAAA,IACtD;AAAA,EACF;AAGA,EAAA,IAAI,aAAA;AACJ,EAAA,IAAI,gBAAgB,OAAA,EAAS;AAC3B,IAAA,aAAA,GAAgB,kBAAkB,eAAA,CAAgB,MAAA,CAAO,CAAC,CAAA,KAA6B,mBAAA,IAAuB,CAAC,CAAC,CAAA;AAAA,EAClH,CAAA,MAAA,IAAW,WAAA,KAAgB,YAAA,IAAgB,WAAA,KAAgB,YAAA,EAAc;AACvE,IAAA,aAAA,GAAgB,cAAA,CAAe,eAAA,CAAgB,MAAA,CAAO,CAAC,MAA0B,EAAE,YAAA,IAAgB,CAAA,CAAA,IAAM,EAAE,mBAAA,IAAuB,CAAA,CAAA,IAAM,EAAE,iBAAA,IAAqB,EAAE,CAAC,CAAA;AAAA,EACpK,CAAA,MAAA,IAAW,gBAAgB,QAAA,EAAU;AACnC,IAAA,aAAA,GAAgB,mBAAmB,eAAA,CAAgB,MAAA,CAAO,CAAC,CAAA,KAA8B,YAAA,IAAgB,CAAC,CAAC,CAAA;AAAA,EAC7G,CAAA,MAAO;AACL,IAAA,aAAA,GAAgB,eAAA,CAAgB,eAAA,CAAgB,MAAA,CAAO,CAAC,CAAA,KAA2B,gBAAA,IAAoB,CAAA,IAAK,EAAE,YAAA,IAAgB,CAAA,CAAA,IAAM,EAAE,mBAAA,IAAuB,EAAE,CAAC,CAAA;AAAA,EAClK;AAGA,EAAA,GAAA,CAAI,UAAU,0CAA0C,CAAA;AAExD,EAAA,MAAM,WAAA,GAAc,gBAAgB,aAAa,CAAA;AACjD,EAAA,GAAA,CAAI,QAAA,EAAU,CAAA,UAAA,EAAa,WAAA,CAAY,MAAM,CAAA,SAAA,CAAW,CAAA;AAGxD,EAAA,GAAA,CAAI,UAAU,2BAA2B,CAAA;AAEzC,EAAA,MAAM,WAAA,GAAc;AAAA,IAClB,QAAA,EAAU,WAAA,CAAY,GAAA,CAAI,CAAA,EAAA,MAAO;AAAA,MAC/B,MAAM,EAAA,CAAG,OAAA;AAAA,MACT,MAAM,EAAA,CAAG,MAAA;AAAA,MACT,YAAA,EAAc;AAAA,KAChB,CAAE;AAAA,GACJ;AAGA,EAAA,GAAA,CAAI,UAAU,6EAA6E,CAAA;AAG3F,EAAA,GAAA,CAAI,aAAa,+CAA+C,CAAA;AAChE,EAAA,MAAM,eAAA,GAAkB,MAAM,eAAA,CAAgB;AAAA,IAC5C,IAAA;AAAA,IACA,SAAA;AAAA,IACA,QAAA,EAAU,SAAA;AAAA,IACV;AAAA,GACD,CAAA;AAGD,EAAA,GAAA,CAAI,aAAa,gDAAgD,CAAA;AACjE,EAAA,MAAM,QAAA,GAAW,MAAM,sBAAA,CAAuB;AAAA,IAC5C,IAAA;AAAA,IACA,SAAA;AAAA,IACA,WAAA;AAAA,IACA,eAAA;AAAA,IACA,WAAA;AAAA,IACA;AAAA,GACD,CAAA;AAGD,EAAA,MAAM,UAAU,QAAA,CAAS,OAAA;AACzB,EAAA,MAAM,OAAA,GAA4D;AAAA,IAChE,EAAA,EAAI,OAAA;AAAA,IACJ,QAAA,EAAU,CAAA;AAAA,IACV,IAAA,EAAM,6DAAA;AAAA,IACN,WAAA,EAAa,2EAAA;AAAA,IACb,OAAO,EAAC;AAAA,IACR,WAAW,EAAC;AAAA,IACZ,UAAU,CAAC,iBAAA,EAAmB,YAAA,EAAc,mBAAA,EAAqB,gBAAgB,KAAK,CAAA;AAAA,IACtF,gBAAA,EAAkB,MAAA;AAAA,IAClB,QAAA,EAAU,KAAA;AAAA,IACV,MAAA,EAAQ,6DAAA;AAAA,IACR,OAAA,EAAS,EAAE,YAAA,EAAc,2BAAA,EAA6B,WAAW,uBAAA,EAAwB;AAAA,IACzF,UAAA,EAAY,CAAC,4BAAA,EAA8B,0BAA0B,CAAA;AAAA,IACrE,iBAAiB,EAAC;AAAA,IAClB,eAAe,EAAC;AAAA,IAChB,MAAA,EAAQ,EAAE,iBAAA,EAAmB,EAAA,EAAI,YAAY,KAAA;AAAM,GACrD;AAGA,EAAA,IAAI,eAA0B,EAAC;AAC/B,EAAA,IAAI,eAAA,EAAiB;AACnB,IAAA,MAAM,aAAA,GAAgB,CAAC,OAAA,EAAS,GAAI,eAAA,CAAgB,KAAA,IAAS,EAAG,CAAA,CAAE,GAAA,CAAI,CAAC,CAAA,EAAG,CAAA,MAAO;AAAA,MAC/E,GAAG,CAAA;AAAA,MACH,EAAA,EAAI,CAAA,IAAA,EAAO,CAAA,GAAI,CAAC,CAAA,CAAA;AAAA,MAChB,UAAU,CAAA,GAAI;AAAA,KAChB,CAAE,CAAA;AACF,IAAA,YAAA,CAAa,IAAA,CAAK;AAAA,MAChB,GAAG,eAAA;AAAA,MACH,EAAA,EAAI,IAAA;AAAA,MACJ,IAAA,EAAM,oBAAA;AAAA,MACN,KAAA,EAAO;AAAA,KACR,CAAA;AAAA,EACH,CAAA,MAAO;AACL,IAAA,YAAA,CAAa,IAAA,CAAK;AAAA,MAChB,EAAA,EAAI,IAAA;AAAA,MACJ,IAAA,EAAM,oBAAA;AAAA,MACN,WAAA,EAAa,gDAAA;AAAA,MACb,KAAA,EAAO,CAAC,OAAO;AAAA,KACL,CAAA;AAAA,EACd;AAGA,EAAA,MAAM,gBAAA,GAAoB,OAAA,EAAS,QAAA,IAAY,EAAC;AAChD,EAAA,YAAA,GAAe,CAAC,GAAG,YAAA,EAAc,GAAG,gBAAgB,CAAA;AAGpD,EAAA,GAAA,CAAI,WAAA,EAAa,CAAA,qBAAA,EAAwB,gBAAA,CAAiB,MAAM,CAAA,YAAA,CAAc,CAAA;AAE9E,EAAA,MAAM,gBAAgB,gBAAA,CAAiB,MAAA,CAAO,CAAA,CAAA,KAAK,CAAA,CAAE,OAAO,IAAI,CAAA;AAChE,EAAA,IAAI,aAAA,CAAc,SAAS,CAAA,EAAG;AAC5B,IAAA,IAAI;AACF,MAAA,MAAM,eAAe,MAAM,0BAAA;AAAA,QACzB,IAAA;AAAA,QAAM,SAAA;AAAA,QAAW,WAAA;AAAA,QAAa,eAAA;AAAA,QAAiB,aAAA;AAAA,QAAe;AAAA,OAChE;AACA,MAAA,KAAA,MAAW,WAAW,aAAA,EAAe;AACnC,QAAA,MAAM,KAAA,GAAQ,YAAA,CAAa,GAAA,CAAI,OAAA,CAAQ,MAAM,EAAE,CAAA;AAC/C,QAAA,IAAI,KAAA,UAAe,KAAA,GAAQ,KAAA;AAAA,MAC7B;AAAA,IACF,SAAS,GAAA,EAAK;AACZ,MAAA,GAAA,CAAI,WAAA,EAAa,CAAA,yBAAA,EAA4B,GAAG,CAAA,iCAAA,CAAmC,CAAA;AACnF,MAAA,KAAA,MAAW,WAAW,aAAA,EAAe;AACnC,QAAA,IAAI;AACF,UAAA,MAAM,KAAA,GAAQ,MAAM,mBAAA,CAAoB;AAAA,YACtC,IAAA;AAAA,YAAM,SAAA;AAAA,YAAW,WAAA;AAAA,YAAa,eAAA;AAAA,YAAiB,OAAA;AAAA,YAAS;AAAA,WACzD,CAAA;AACD,UAAA,OAAA,CAAQ,KAAA,GAAQ,KAAA;AAAA,QAClB,SAAS,CAAA,EAAG;AACV,UAAA,GAAA,CAAI,aAAa,CAAA,WAAA,EAAc,OAAA,CAAQ,EAAE,CAAA,EAAA,EAAK,CAAC,CAAA,CAAE,CAAA;AAAA,QACnD;AAAA,MACF;AAAA,IACF;AAAA,EACF;AAGA,EAAA,MAAM,YAAA,GAA6B;AAAA,IACjC,cAAA,EAAgB,CAAA;AAAA,IAChB,OAAA,EAAS;AAAA,MACP,EAAA,EAAK,QAAA,CAAS,OAAA,EAAqC,IAAA,EAAM,QAAA,EAAS,CAAE,WAAA,EAAY,CAAE,OAAA,CAAQ,MAAA,EAAQ,GAAG,CAAA,IAAK,SAAA;AAAA,MAC1G,IAAA,EAAO,QAAA,CAAS,OAAA,EAAqC,IAAA,EAAM,UAAS,IAAK,SAAA;AAAA,MACzE,OAAA,EAAS,IAAA;AAAA,MACT,OAAA,EAAS,OAAA;AAAA,MACT,YAAA,EAAc,KAAA;AAAA,MACd,QAAA,EAAY,QAAA,CAAS,OAAA,EAAqC,SAAA,IAA0B,CAAC,KAAK,CAAA;AAAA,MAC1F,UAAA,EAAY,UAAU,KAAA,CAAM,GAAG,EAAE,MAAA,CAAO,CAAC,KAAK,CAAA,KAAM;AAClD,QAAA,MAAM,GAAA,GAAM,CAAA,CAAE,IAAA,EAAK,CAAE,WAAA,EAAY;AACjC,QAAA,IAAI,KAAK,GAAA,CAAI,GAAG,IAAI,CAAC,CAAA,CAAE,MAAM,CAAA;AAC7B,QAAA,OAAO,GAAA;AAAA,MACT,CAAA,EAAG,EAA8B,CAAA;AAAA,MACjC,YAAA,EAAe,QAAA,CAAS,YAAA,EAA0C,MAAA,IAAsB;AAAC,KAC3F;AAAA,IACA,OAAA,EAAS;AAAA,MACP,KAAA,EAAQ,OAAA,EAAS,KAAA,IAAwD,EAAC;AAAA,MAC1E,KAAA,EAAQ,OAAA,EAAS,KAAA,IAAoD,EAAC;AAAA,MACtE,QAAA,EAAW,OAAA,EAAS,aAAA,IAA4H,EAAC;AAAA,MACjJ,cAAc,EAAC;AAAA,MACf,kBAAA,EAAqB,OAAA,EAAS,kBAAA,IAAwL,EAAC;AAAA,MACvN,OAAA,EAAS,MAAA,CAAO,OAAA,EAAS,OAAA,IAAW,EAAE,CAAA;AAAA,MACtC,iBAAA,EAAmB,MAAA,CAAO,OAAA,EAAS,iBAAA,IAAqB,EAAE,CAAA;AAAA,MAC1D,aAAA,EAAgB,OAAA,EAAS,aAAA,IAA8B;AAAC,KAC1D;AAAA,IACA,QAAA,EAAU,YAAA;AAAA,IACV,cAAc,EAAC;AAAA,IACf,cAAA,EAAgB;AAAA,MACd,OAAO;AAAC,KACV;AAAA,IACA,cAAc,EAAC;AAAA,IACf,WAAW;AAAC,GACd;AAGA,EAAA,GAAA,CAAI,UAAU,gDAAgD,CAAA;AAE9D,EAAA,MAAM,EAAE,KAAA,EAAO,aAAA,EAAe,cAAA,EAAe,GAAI,mBAAmB,YAAA,EAAc;AAAA,IAChF,OAAA;AAAA,IACA,WAAA;AAAA,IACA;AAAA,GACD,CAAA;AACD,EAAA,GAAA,CAAI,QAAA,EAAU,CAAA,uBAAA,EAA0B,cAAA,CAAe,MAAM,CAAA,qBAAA,CAAuB,CAAA;AAGpF,EAAA,GAAA,CAAI,UAAU,4CAA4C,CAAA;AAE1D,EAAA,MAAM,eAAA,GAAkB,MAAM,sBAAA,CAAuB;AAAA,IACnD,YAAA,EAAc,aAAA;AAAA,IACd,eAAA;AAAA,IACA;AAAA,GACD,CAAA;AACD,EAAA,GAAA,CAAI,QAAA,EAAU,CAAA,0BAAA,EAA6B,eAAA,CAAgB,IAAI,CAAA,gBAAA,CAAkB,CAAA;AAGjF,EAAA,KAAA,MAAW,OAAA,IAAW,aAAA,CAAc,QAAA,IAAY,EAAC,EAAG;AAClD,IAAA,MAAM,GAAA,GAAM,QAAQ,EAAA,IAAM,EAAA;AAC1B,IAAA,MAAM,SAAA,GAAY,eAAA,CAAgB,GAAA,CAAI,GAAG,KAAK,EAAC;AAC/C,IAAA,KAAA,MAAW,IAAA,IAAQ,OAAA,CAAQ,KAAA,IAAS,EAAC,EAAG;AACtC,MAAA,MAAM,YAAA,GAAe,SAAA,CAClB,MAAA,CAAO,CAAA,EAAA,KAAM;AAEZ,QAAA,MAAM,OAAA,GAAU,CAAC,GAAI,IAAA,CAAK,QAAA,IAAY,EAAC,EAAI,GAAI,IAAA,CAAK,SAAA,IAAa,EAAG,CAAA;AACpE,QAAA,OAAO,OAAA,CAAQ,IAAA,CAAK,CAAA,CAAA,KAAK,CAAA,KAAM,GAAG,OAAO,CAAA;AAAA,MAC3C,CAAC,CAAA,CACA,GAAA,CAAI,CAAA,EAAA,KAAM,GAAG,YAAY,CAAA;AAE5B,MAAA,MAAM,QAAA,GAAW,IAAA,CAAK,aAAA,IAAiB,EAAC;AACxC,MAAA,IAAA,CAAK,aAAA,GAAgB,CAAC,mBAAG,IAAI,GAAA,CAAI,CAAC,GAAG,QAAA,EAAU,GAAG,YAAY,CAAC,CAAC,CAAA;AAAA,IAClE;AAAA,EACF;AAGA,EAAA,GAAA,CAAI,UAAU,+CAA+C,CAAA;AAG7D,EAAA,MAAM,cAAyB,EAAC;AAChC,EAAA,MAAM,MAAA,uBAAa,GAAA,EAAY;AAC/B,EAAA,KAAA,MAAW,OAAA,IAAW,aAAA,CAAc,QAAA,IAAY,EAAC,EAAG;AAClD,IAAA,KAAA,MAAW,IAAA,IAAQ,OAAA,CAAQ,KAAA,IAAS,EAAC,EAAG;AACtC,MAAA,KAAA,MAAW,EAAA,IAAM,CAAC,GAAI,IAAA,CAAK,QAAA,IAAY,EAAC,EAAI,GAAI,IAAA,CAAK,SAAA,IAAa,EAAG,CAAA,EAAG;AACtE,QAAA,IAAI,CAAC,MAAA,CAAO,GAAA,CAAI,EAAA,CAAG,WAAA,EAAa,CAAA,EAAG;AACjC,UAAA,MAAA,CAAO,GAAA,CAAI,EAAA,CAAG,WAAA,EAAa,CAAA;AAC3B,UAAA,WAAA,CAAY,IAAA,CAAK,EAAE,OAAA,EAAS,EAAA,EAAI,MAAA,EAAQ,UAAA,EAAY,QAAA,EAAU,KAAA,EAAO,MAAA,EAAQ,CAAA,EAAK,OAAA,EAAS,4BAAA,EAA8B,CAAA;AAAA,QAC3H;AAAA,MACF;AAAA,IACF;AAAA,EACF;AAEA,EAAA,MAAM,QAAA,GAAW,IAAI,GAAA,CAAI,WAAA,CAAY,GAAA,CAAI,CAAA,CAAA,KAAK,CAAC,CAAA,CAAE,OAAA,CAAQ,WAAA,EAAY,EAAG,CAAC,CAAC,CAAC,CAAA;AAC3E,EAAA,MAAM,iBAA4B,EAAC;AACnC,EAAA,MAAM,UAAA,uBAAiB,GAAA,EAAY;AACnC,EAAA,KAAA,MAAW,MAAM,CAAC,GAAG,WAAA,EAAa,GAAG,WAAW,CAAA,EAAG;AACjD,IAAA,MAAM,GAAA,GAAM,EAAA,CAAG,OAAA,CAAQ,WAAA,EAAY;AACnC,IAAA,IAAI,CAAC,UAAA,CAAW,GAAA,CAAI,GAAG,CAAA,EAAG;AACxB,MAAA,UAAA,CAAW,IAAI,GAAG,CAAA;AAClB,MAAA,cAAA,CAAe,IAAA,CAAK,QAAA,CAAS,GAAA,CAAI,GAAG,KAAK,EAAE,CAAA;AAAA,IAC7C;AAAA,EACF;AAGA,EAAA,MAAM,cAAA,uBAAqB,GAAA,EAAmC;AAC9D,EAAA,KAAA,MAAW,QAAA,IAAY,eAAA,CAAgB,MAAA,EAAO,EAAG;AAC/C,IAAA,KAAA,MAAW,MAAM,QAAA,EAAU;AACzB,MAAA,IAAI,CAAC,cAAA,CAAe,GAAA,CAAI,EAAA,CAAG,OAAO,CAAA,EAAG;AACnC,QAAA,cAAA,CAAe,GAAA,CAAI,EAAA,CAAG,OAAA,EAAS,EAAA,CAAG,KAAK,CAAA;AAAA,MACzC;AAAA,IACF;AAAA,EACF;AAEA,EAAA,MAAM,gBAAA,GAAmB,MAAM,eAAA,CAAgB;AAAA,IAC7C,QAAA,EAAU,cAAA;AAAA,IACV,IAAA;AAAA,IACA,UAAA;AAAA,IACA,cAAA;AAAA,IACA;AAAA,GACD,CAAA;AACD,EAAA,GAAA,CAAI,QAAA,EAAU,CAAA,UAAA,EAAa,gBAAA,CAAiB,OAAA,CAAQ,cAAc,CAAA,YAAA,EAAe,gBAAA,CAAiB,OAAA,CAAQ,cAAc,CAAA,EAAA,EAAK,gBAAA,CAAiB,OAAA,CAAQ,WAAW,CAAA,CAAA,CAAG,CAAA;AAGpK,EAAA,GAAA,CAAI,UAAU,6CAA6C,CAAA;AAE3D,EAAA,MAAM,UAAU,eAAA,CAAgB;AAAA,IAC9B,YAAA,EAAc,aAAA;AAAA,IACd,eAAA;AAAA,IACA,cAAA,EAAgB,EAAA;AAAA,IAChB,cAAA,EAAgB,IAAA;AAAA,IAChB,mBAAA,EAAqB;AAAA,GACtB,CAAA;AACD,EAAA,GAAA,CAAI,UAAU,CAAA,mBAAA,EAAsB,OAAA,CAAQ,OAAO,MAAM,CAAA,SAAA,EAAY,QAAQ,MAAA,CAAO,MAAA,CAAO,CAAC,CAAA,EAAG,MAAM,CAAA,GAAI,CAAA,CAAE,WAAW,MAAA,EAAQ,CAAC,CAAC,CAAA,WAAA,CAAa,CAAA;AAE7I,EAAA,OAAO;AAAA,IACL,YAAA,EAAc,aAAA;AAAA,IACd,gBAAA;AAAA,IACA,OAAA;AAAA,IACA,cAAA;AAAA,IACA,QAAA,EAAU,WAAA;AAAA,IACV;AAAA,GACF;AACF","file":"chunk-GEUDHZE7.mjs","sourcesContent":["/**\n * LLM-based File Selector — sends file tree to LLM, asks it to pick\n * which files are most relevant to the project goal.\n *\n * This mirrors knowledge-tree's approach:\n *   1. git_tracker generates project_structure.txt (file tree)\n *   2. Agent/LLM reads tree → selects important files\n *   3. Only selected files are read for analysis\n */\n\nimport { createLlmClient, llmChatJson, type LlmClientConfig } from '../utils/llmClient';\n\nexport interface FileSelectionResult {\n  selected: string[];\n  reasoning: string;\n}\n\n/**\n * Ask LLM to select which files from the file tree are relevant to the goal.\n * Input: file tree (names only, very small) + goal\n * Output: list of file paths to analyze\n */\nexport async function selectFilesWithLlm(\n  filePaths: string[],\n  goal: string,\n  techStack: string,\n  llmConfig?: LlmClientConfig,\n): Promise<FileSelectionResult> {\n  // If very few files, no need to filter\n  if (filePaths.length <= 15) {\n    return { selected: filePaths, reasoning: 'Too few files to filter' };\n  }\n\n  const client = createLlmClient(llmConfig);\n\n  // Build file tree for LLM (just names, grouped by directory)\n  const treeLines = buildFileTree(filePaths);\n\n  const systemPrompt = (\n    'You are a software architect analyzing a project repository.\\n'\n    + 'Given a file tree and a project goal, select which files are MOST IMPORTANT '\n    + 'to read for understanding the project architecture and implementation.\\n\\n'\n    + 'RULES:\\n'\n    + '1. Prioritize source code files (Swift, TS, Python, C++) over config/docs\\n'\n    + '2. Include entry points (App.swift, main.py, index.ts)\\n'\n    + '3. Include core domain files (models, services, views, controllers)\\n'\n    + '4. EXCLUDE test files, mock files, generated files\\n'\n    + '5. EXCLUDE config files (package.json, Podfile, etc.) unless they reveal architecture\\n'\n    + '6. Include files that directly implement the features mentioned in the goal\\n'\n    + '7. Return 20-40 files maximum (fewer is better if the project is small)\\n\\n'\n    + 'Return JSON: {\"selected\": [\"path/to/file1\", \"path/to/file2\"], \"reasoning\": \"brief explanation\"}'\n  );\n\n  const userPrompt = (\n    `Project goal: ${goal}\\n`\n    + `Tech stack: ${techStack}\\n\\n`\n    + `FILE TREE (${filePaths.length} files):\\n${treeLines}\\n\\n`\n    + 'Select the most important files to analyze. Return JSON.'\n  );\n\n  try {\n    const result = await llmChatJson(client, systemPrompt, userPrompt, {\n      temperature: 0.1,\n      maxTokens: 4096,\n    });\n\n    const selected = Array.isArray(result.selected) ? result.selected as string[] : [];\n    const reasoning = String(result.reasoning || '');\n\n    // Validate: only keep files that exist in the original list\n    const pathSet = new Set(filePaths);\n    const validSelected = selected.filter(p => pathSet.has(p));\n\n    if (validSelected.length === 0) {\n      // LLM returned nothing valid — fallback to all files\n      return { selected: filePaths, reasoning: 'LLM selection empty, using all files' };\n    }\n\n    return { selected: validSelected, reasoning };\n  } catch (err) {\n    console.warn(`[WARN] LLM file selection failed (${err}), using all files`);\n    return { selected: filePaths, reasoning: `LLM failed: ${err}` };\n  }\n}\n\n/**\n * Build a compact file tree string for LLM consumption.\n * Groups files by top-level directory, shows only filenames.\n */\nfunction buildFileTree(filePaths: string[]): string {\n  const byDir = new Map<string, string[]>();\n\n  for (const fp of filePaths) {\n    const parts = fp.split('/');\n    const dir = parts.length > 1 ? parts.slice(0, -1).join('/') : '(root)';\n    const file = parts[parts.length - 1];\n    if (!byDir.has(dir)) byDir.set(dir, []);\n    byDir.get(dir)!.push(file);\n  }\n\n  const lines: string[] = [];\n  for (const [dir, files] of byDir) {\n    lines.push(`${dir}/`);\n    for (const f of files.sort()) {\n      lines.push(`  ${f}`);\n    }\n  }\n\n  return lines.join('\\n');\n}\n","/**\n * File I/O utilities for domain-kit pipeline.\n */\n\nimport { readFileSync, writeFileSync, existsSync, mkdirSync, readdirSync, statSync } from 'node:fs';\nimport { join, extname, relative, resolve } from 'node:path';\nimport { execSync } from 'node:child_process';\n\n/**\n * Read JSON file safely, returns null if not found or invalid.\n */\nexport function readJsonFile<T = unknown>(filePath: string): T | null {\n  try {\n    if (!existsSync(filePath)) return null;\n    const content = readFileSync(filePath, 'utf-8');\n    return JSON.parse(content) as T;\n  } catch {\n    return null;\n  }\n}\n\n/**\n * Write JSON file, creating parent directories if needed.\n */\nexport function writeJsonFile(filePath: string, data: unknown): void {\n  mkdirSync(join(filePath, '..'), { recursive: true });\n  writeFileSync(filePath, JSON.stringify(data, null, 2), 'utf-8');\n}\n\n/**\n * Read text file safely, returns null if not found.\n */\nexport function readTextFile(filePath: string): string | null {\n  try {\n    if (!existsSync(filePath)) return null;\n    return readFileSync(filePath, 'utf-8');\n  } catch {\n    return null;\n  }\n}\n\n/**\n * Collect source files from a directory, filtering by allowed extensions.\n */\nexport function collectSourceFiles(\n  dir: string,\n  options?: {\n    allowedExtensions?: string[];\n    skipDirs?: string[];\n    maxFiles?: number;\n  },\n): string[] {\n  const allowedExts = options?.allowedExtensions || ['.swift', '.ts', '.tsx', '.js', '.jsx', '.py', '.ino', '.cpp', '.c', '.h', '.hpp'];\n  const maxFiles = options?.maxFiles || 70;\n\n  // Try git ls-files first — respects .gitignore, handles submodules, symlinks\n  const gitFiles = collectViaGit(dir, allowedExts, maxFiles);\n  if (gitFiles.length > 0) return gitFiles;\n\n  // Fallback: filesystem walk (non-git directories)\n  return collectViaFilesystem(dir, allowedExts, maxFiles, options?.skipDirs);\n}\n\n/**\n * Collect source files using `git ls-files`.\n * Respects .gitignore, handles symlinks, much faster than walk.\n */\nfunction collectViaGit(dir: string, allowedExts: string[], maxFiles: number): string[] {\n  try {\n    const raw = execSync('git ls-files --cached --others --exclude-standard', {\n      cwd: dir,\n      encoding: 'utf-8',\n      timeout: 5000,\n      maxBuffer: 1024 * 1024,\n    });\n    const extSet = new Set(allowedExts.map(e => e.toLowerCase()));\n    return raw\n      .split('\\n')\n      .filter(line => line.length > 0)\n      .filter(line => extSet.has(extname(line).toLowerCase()))\n      .slice(0, maxFiles)\n      .map(rel => join(dir, rel));\n  } catch {\n    // Not a git repo or git not available — fall through to filesystem walk\n    return [];\n  }\n}\n\n/**\n * Collect source files using recursive directory walk (non-git fallback).\n */\nfunction collectViaFilesystem(\n  dir: string,\n  allowedExts: string[],\n  maxFiles: number,\n  skipDirs?: string[],\n): string[] {\n  const skipSet = new Set(skipDirs || [\n    'node_modules', '.build', 'Pods', '.git', '.venv', 'venv',\n    '__pycache__', 'build', 'dist', '.idea', '.vscode',\n    'test', 'tests', 'demo', 'sample', 'example', 'playground',\n  ]);\n  const extSet = new Set(allowedExts.map(e => e.toLowerCase()));\n  const result: string[] = [];\n\n  function walk(currentDir: string) {\n    if (result.length >= maxFiles) return;\n    let entries;\n    try {\n      entries = readdirSync(currentDir, { withFileTypes: true });\n    } catch {\n      return; // permission error\n    }\n    for (const entry of entries) {\n      if (result.length >= maxFiles) return;\n      const fullPath = join(currentDir, entry.name);\n      if (entry.isDirectory()) {\n        if (!skipSet.has(entry.name)) {\n          walk(fullPath);\n        }\n      } else if (entry.isFile()) {\n        const ext = extname(entry.name).toLowerCase();\n        if (extSet.has(ext)) {\n          result.push(fullPath);\n        }\n      }\n    }\n  }\n\n  walk(dir);\n  return result;\n}\n\n/**\n * Collect file contents map (relative path → content).\n */\nexport function collectFileContents(\n  dir: string,\n  options?: {\n    allowedExtensions?: string[];\n    skipDirs?: string[];\n    maxFiles?: number;\n    maxChars?: number;\n  },\n): { paths: string[]; contents: Map<string, string> } {\n  const maxChars = options?.maxChars || 500000;\n  const files = collectSourceFiles(dir, options);\n  const contents = new Map<string, string>();\n  let totalChars = 0;\n\n  for (const filePath of files) {\n    const relPath = relative(dir, filePath);\n    try {\n      const content = readFileSync(filePath, 'utf-8');\n      if (totalChars + content.length > maxChars) {\n        const remaining = maxChars - totalChars;\n        if (remaining > 100) {\n          contents.set(relPath, content.slice(0, remaining));\n          totalChars += remaining;\n        }\n        break;\n      }\n      contents.set(relPath, content);\n      totalChars += content.length;\n    } catch {\n      // Skip unreadable files\n    }\n  }\n\n  return { paths: files.map(f => relative(dir, f)), contents };\n}\n\n/**\n * Read contents of SPECIFIC files (by relative path) — no directory scan.\n * Used for 2-pass approach: scan tree first, then read only selected files.\n */\nexport function collectSpecificFileContents(\n  dir: string,\n  relativePaths: string[],\n  maxChars: number = 500000,\n): Map<string, string> {\n  const contents = new Map<string, string>();\n  let totalChars = 0;\n\n  for (const relPath of relativePaths) {\n    const fullPath = join(dir, relPath);\n    try {\n      const content = readFileSync(fullPath, 'utf-8');\n      if (totalChars + content.length > maxChars) {\n        const remaining = maxChars - totalChars;\n        if (remaining > 100) {\n          contents.set(relPath, content.slice(0, remaining));\n          totalChars += remaining;\n        }\n        break;\n      }\n      contents.set(relPath, content);\n      totalChars += content.length;\n    } catch {\n      // Skip unreadable files\n    }\n  }\n\n  return contents;\n}\n\n/**\n * Detect primary language from file extensions.\n */\nexport function detectPrimaryLanguage(filePaths: string[]): string {\n  const counts = new Map<string, number>();\n  for (const fp of filePaths) {\n    const ext = extname(fp).toLowerCase();\n    let lang = 'unknown';\n    if (ext === '.swift') lang = 'Swift';\n    else if (ext === '.ts' || ext === '.tsx') lang = 'TypeScript';\n    else if (ext === '.js' || ext === '.jsx') lang = 'JavaScript';\n    else if (ext === '.py') lang = 'Python';\n    else if (ext === '.ino' || ext === '.cpp' || ext === '.c' || ext === '.h') lang = 'C++';\n    else if (ext === '.kt' || ext === '.kts') lang = 'Kotlin';\n    counts.set(lang, (counts.get(lang) || 0) + 1);\n  }\n\n  let maxCount = 0;\n  let primary = 'unknown';\n  for (const [lang, count] of counts) {\n    if (count > maxCount) {\n      maxCount = count;\n      primary = lang;\n    }\n  }\n  return primary;\n}\n\n/**\n * Read README.md and extract project description.\n */\nexport function readReadmeDescription(repoDir: string): string | null {\n  const readmePath = join(repoDir, 'README.md');\n  if (!existsSync(readmePath)) return null;\n  try {\n    const content = readFileSync(readmePath, 'utf-8');\n    const lines = content.split('\\n').map(l => l.trim()).filter(Boolean);\n    // Skip patterns: badges, images, table of contents, HTML tags\n    const skipPatterns = [/^\\[!/, /^<img/, /^<a /, /^#+\\s+Table of/i, /^---$/];\n    let foundTitle = false;\n    for (let i = 0; i < lines.length; i++) {\n      const line = lines[i];\n      if (line.startsWith('#') && !line.startsWith('##')) {\n        foundTitle = true;\n        continue;\n      }\n      if (!foundTitle) continue;\n      // Skip empty lines, badges, images, TOC, horizontal rules\n      if (skipPatterns.some(p => p.test(line))) continue;\n      if (line.startsWith('#')) return null; // hit next heading — no description found\n      if (line.startsWith('```')) return null; // code block\n      if (line.startsWith('|')) return null;   // table\n      if (line.length > 15) return line;\n    }\n    return null;\n  } catch {\n    return null;\n  }\n}\n","/**\n * Project Graph Pipeline — full orchestrator.\n *\n * Ported from knowledge-tree/generate_roadmap_v3.py PipelineOrchestrator\n * Coordinates: AST analysis → keyword extraction → LLM graph generation →\n *             verification → concept escalation → concept resolution → assembly.\n */\n\nimport type { ProjectGraph, Feature } from '../schemas/projectGraphSchema';\nimport { parseSwiftFile, mergeSwiftResults, type SwiftParseResult } from '../parsers/swift';\nimport { parseTsFile, mergeTsResults, type TsParseResult } from '../parsers/typescript';\nimport { parsePythonFile, mergePythonResults, type PythonParseResult } from '../parsers/python';\nimport { parseCppFile, mergeCppResults, type CppParseResult } from '../parsers/cpp';\nimport { extractKeywords, type Keyword, type SourceContext } from '../extractors/keywordExtractor';\nimport { extractScaffold } from '../graph/scaffoldExtractor';\nimport { extractProjectOverview } from '../graph/overviewExtractor';\nimport { extractFeatureSteps, extractFeatureStepsBatched } from '../graph/stepExtractor';\nimport { verifyProjectGraph, type Hallucination } from '../graph/graphVerifier';\nimport { escalateAndMapConcepts, type ConceptMapping } from '../graph/conceptEscalator';\nimport { resolveConcepts, type ResolveConceptsResult } from '../concepts/conceptResolver';\nimport { assembleRoadmap, type AssembledRoadmap } from '../assembly/roadmapAssembler';\nimport { selectFilesWithLlm } from '../extractors/fileSelector';\nimport { collectSourceFiles, collectSpecificFileContents, detectPrimaryLanguage, readReadmeDescription } from '../utils/fileUtils';\nimport { relative } from 'node:path';\nimport { createLlmClient, type LlmClientConfig } from '../utils/llmClient';\n\nexport interface PipelineOptions {\n  repoDir: string;\n  goal: string;\n  techStack: string;\n  llmConfig?: LlmClientConfig;\n  embeddings?: Record<string, { embedding?: number[]; name?: string; description?: string; keywords?: string }>;\n  onProgress?: (step: string, message: string) => void;\n}\n\nexport interface PipelineResult {\n  projectGraph: ProjectGraph;\n  resolvedConcepts: ResolveConceptsResult;\n  roadmap: AssembledRoadmap;\n  hallucinations: Hallucination[];\n  keywords: Keyword[];\n  featureConcepts: Map<string, ConceptMapping[]>;\n}\n\n/**\n * Run the full project graph generation pipeline.\n */\nexport async function runProjectGraphPipeline(\n  options: PipelineOptions,\n): Promise<PipelineResult> {\n  const { repoDir, goal, techStack, llmConfig, embeddings, onProgress } = options;\n\n  const log = (step: string, msg: string) => {\n    console.log(`[${step}] ${msg}`);\n    onProgress?.(step, msg);\n  };\n\n  // ─── STEP 1A: File Tree Scan (names only — no content reading) ─────────\n  log('STEP_1', 'Scanning file tree (names only)...');\n\n  const allFilePaths = collectSourceFiles(repoDir);\n  const allRelPaths = allFilePaths.map(fp => relative(repoDir, fp));\n  log('STEP_1', `Found ${allRelPaths.length} source files in repository`);\n\n  // ─── STEP 1B: LLM File Selection (sends tiny file tree to LLM) ────────\n  log('STEP_1', 'Asking LLM to select relevant files from file tree...');\n\n  const { selected: selectedPaths, reasoning } = await selectFilesWithLlm(\n    allRelPaths, goal, techStack, llmConfig,\n  );\n  log('STEP_1', `LLM selected ${selectedPaths.length}/${allRelPaths.length} files: ${reasoning.slice(0, 100)}`);\n\n  // ─── STEP 1C: Read content only for LLM-selected files ─────────────────\n  log('STEP_1', 'Reading content for selected files...');\n\n  const fileContentsMap = collectSpecificFileContents(repoDir, selectedPaths);\n  const filePaths = selectedPaths;\n  const primaryLang = detectPrimaryLanguage(filePaths);\n  log('STEP_1', `Primary language: ${primaryLang}, ${filePaths.length} files loaded (${fileContentsMap.size} with content)`);\n\n  // Parse source files\n  log('STEP_1', 'Parsing source files with AST-level analysis...');\n\n  const allParseResults: SourceContext[] = [];\n  for (const [relPath, content] of fileContentsMap) {\n    const fullPath = relPath;\n    if (fullPath.endsWith('.swift')) {\n      allParseResults.push(parseSwiftFile(fullPath, content));\n    } else if (fullPath.endsWith('.ts') || fullPath.endsWith('.tsx') || fullPath.endsWith('.js') || fullPath.endsWith('.jsx')) {\n      allParseResults.push(parseTsFile(fullPath, content));\n    } else if (fullPath.endsWith('.py')) {\n      allParseResults.push(parsePythonFile(fullPath, content));\n    } else if (fullPath.endsWith('.ino') || fullPath.endsWith('.cpp') || fullPath.endsWith('.c') || fullPath.endsWith('.h')) {\n      allParseResults.push(parseCppFile(fullPath, content));\n    }\n  }\n\n  // Merge parse results by language\n  let mergedContext: SourceContext;\n  if (primaryLang === 'Swift') {\n    mergedContext = mergeSwiftResults(allParseResults.filter((r): r is SwiftParseResult => 'property_wrappers' in r));\n  } else if (primaryLang === 'TypeScript' || primaryLang === 'JavaScript') {\n    mergedContext = mergeTsResults(allParseResults.filter((r): r is TsParseResult => !('docstrings' in r) && !('property_wrappers' in r) && !('frameworks_used' in r)));\n  } else if (primaryLang === 'Python') {\n    mergedContext = mergePythonResults(allParseResults.filter((r): r is PythonParseResult => 'docstrings' in r));\n  } else {\n    mergedContext = mergeCppResults(allParseResults.filter((r): r is CppParseResult => 'error_handling' in r && !('docstrings' in r) && !('property_wrappers' in r)));\n  }\n\n  // ─── STEP 2: Keyword Extraction ──────────────────────────────────────────\n  log('STEP_2', 'Extracting keywords from AST analysis...');\n\n  const astKeywords = extractKeywords(mergedContext);\n  log('STEP_2', `Extracted ${astKeywords.length} keywords`);\n\n  // ─── STEP 3: Build SDK API Index (simplified — use AST keywords as proxy) ──\n  log('STEP_3', 'Building SDK API index...');\n\n  const sdkApiIndex = {\n    sdk_apis: astKeywords.map(kw => ({\n      name: kw.keyword,\n      kind: kw.source,\n      used_in_demo: true,\n    })),\n  };\n\n  // ─── STEP 4: LLM Project Graph Generation ────────────────────────────────\n  log('STEP_4', 'Generating project graph via LLM (C0: Scaffold, C1: Overview, C2: Steps)...');\n\n  // C0: Scaffold (F0) — uses file list (names only, not content)\n  log('STEP_4_C0', 'Extracting FOUNDATION & SETUP feature (F0)...');\n  const scaffoldFeature = await extractScaffold({\n    goal,\n    techStack,\n    fileList: filePaths,\n    llmConfig,\n  });\n\n  // C1: Overview (features meta) — uses already-filtered fileContentsMap\n  log('STEP_4_C1', 'Extracting project overview (features meta)...');\n  const overview = await extractProjectOverview({\n    goal,\n    techStack,\n    sdkApiIndex,\n    fileContentsMap,\n    astKeywords,\n    llmConfig,\n  });\n\n  // Build PBL step (Design Thinking)\n  const product = overview.product as Record<string, unknown> | undefined;\n  const pblStep: Feature['steps'] extends (infer T)[] ? T : never = {\n    id: 'F0-S1',\n    sequence: 1,\n    name: 'Frame the problem & understand user needs (Design Thinking)',\n    description: 'BEFORE CODING — frame the problem and understand what the user needs',\n    files: [],\n    api_usage: [],\n    keywords: ['Design Thinking', 'User Needs', 'Problem Statement', 'User Journey', 'PBL'],\n    completion_level: 'base',\n    platform: 'app',\n    intent: 'Understand user needs and frame problem before writing code',\n    outcome: { user_visible: 'Defined problem statement', technical: 'Problem frame context' },\n    acceptance: ['Problem statement is clear', 'Primary users identified'],\n    requirement_ids: [],\n    concept_codes: [],\n    effort: { estimated_minutes: 15, complexity: 'low' },\n  };\n\n  // Merge scaffold F0 with PBL step\n  let featuresFull: Feature[] = [];\n  if (scaffoldFeature) {\n    const scaffoldSteps = [pblStep, ...(scaffoldFeature.steps || [])].map((s, i) => ({\n      ...s,\n      id: `F0-S${i + 1}`,\n      sequence: i + 1,\n    }));\n    featuresFull.push({\n      ...scaffoldFeature,\n      id: 'F0',\n      name: 'FOUNDATION & SETUP',\n      steps: scaffoldSteps,\n    });\n  } else {\n    featuresFull.push({\n      id: 'F0',\n      name: 'FOUNDATION & SETUP',\n      description: 'Frame the problem, get familiar with the tools',\n      steps: [pblStep],\n    } as Feature);\n  }\n\n  // Add features from overview\n  const overviewFeatures = (product?.features || []) as Feature[];\n  featuresFull = [...featuresFull, ...overviewFeatures];\n\n  // C2: Extract steps per feature\n  log('STEP_4_C2', `Extracting steps for ${overviewFeatures.length} features...`);\n\n  const nonF0Features = overviewFeatures.filter(f => f.id !== 'F0');\n  if (nonF0Features.length > 0) {\n    try {\n      const batchedSteps = await extractFeatureStepsBatched(\n        goal, techStack, sdkApiIndex, fileContentsMap, nonF0Features, llmConfig,\n      );\n      for (const feature of nonF0Features) {\n        const steps = batchedSteps.get(feature.id || '');\n        if (steps) feature.steps = steps;\n      }\n    } catch (err) {\n      log('STEP_4_C2', `Batch extraction failed (${err}), falling back to per-feature...`);\n      for (const feature of nonF0Features) {\n        try {\n          const steps = await extractFeatureSteps({\n            goal, techStack, sdkApiIndex, fileContentsMap, feature, llmConfig,\n          });\n          feature.steps = steps;\n        } catch (e) {\n          log('STEP_4_C2', `Failed for ${feature.id}: ${e}`);\n        }\n      }\n    }\n  }\n\n  // Build project graph\n  const projectGraph: ProjectGraph = {\n    schema_version: 3,\n    project: {\n      id: (overview.project as Record<string, unknown>)?.name?.toString().toLowerCase().replace(/\\s+/g, '-') || 'project',\n      name: (overview.project as Record<string, unknown>)?.name?.toString() || 'Project',\n      purpose: goal,\n      version: '0.1.0',\n      project_type: 'app',\n      platform: ((overview.project as Record<string, unknown>)?.platforms as string[]) || ['ios'],\n      tech_stack: techStack.split(',').reduce((acc, t) => {\n        const key = t.trim().toLowerCase();\n        if (key) acc[key] = [t.trim()];\n        return acc;\n      }, {} as Record<string, string[]>),\n      architecture: (overview.architecture as Record<string, unknown>)?.layers as string[] || [],\n    },\n    product: {\n      goals: (product?.goals as Array<{ id: string; description: string }>) || [],\n      users: (product?.users as Array<{ id: string; goals: string[] }>) || [],\n      journeys: (product?.user_journeys as Array<{ id: string; name: string; requirement_ids: string[]; steps: string[]; feature_ids: string[] }>) || [],\n      requirements: [],\n      development_stages: (product?.development_stages as Array<{ stage: string; product_state: string; need: string[]; learn: string[]; validation: string; cross_feature_value: string; temporary_approach: string }>) || [],\n      purpose: String(product?.purpose || ''),\n      problem_statement: String(product?.problem_statement || ''),\n      primary_users: (product?.primary_users as string[]) || [],\n    },\n    features: featuresFull,\n    capabilities: [],\n    implementation: {\n      tasks: [],\n    },\n    missing_gaps: [],\n    tech_debt: [],\n  };\n\n  // ─── STEP 5: Verification ────────────────────────────────────────────────\n  log('STEP_5', 'Verifying project graph against source code...');\n\n  const { graph: verifiedGraph, hallucinations } = verifyProjectGraph(projectGraph, {\n    repoDir,\n    sdkApiIndex,\n    fileContentsMap,\n  });\n  log('STEP_5', `Verification complete: ${hallucinations.length} hallucinations found`);\n\n  // ─── STEP 6: Concept Escalation ──────────────────────────────────────────\n  log('STEP_6', 'Escalating keywords to neutral concepts...');\n\n  const featureConcepts = await escalateAndMapConcepts({\n    projectGraph: verifiedGraph,\n    fileContentsMap,\n    llmConfig,\n  });\n  log('STEP_6', `Concept mapping complete: ${featureConcepts.size} features mapped`);\n\n  // Propagate concept_codes back into verified graph steps\n  for (const feature of verifiedGraph.features || []) {\n    const fid = feature.id || '';\n    const fConcepts = featureConcepts.get(fid) || [];\n    for (const step of feature.steps || []) {\n      const stepConcepts = fConcepts\n        .filter(cm => {\n          // Match concept to step: check if step contains the keyword\n          const stepKws = [...(step.keywords || []), ...(step.api_usage || [])];\n          return stepKws.some(k => k === cm.keyword);\n        })\n        .map(cm => cm.concept_code);\n      // Merge with any existing concept_codes from LLM\n      const existing = step.concept_codes || [];\n      step.concept_codes = [...new Set([...existing, ...stepConcepts])];\n    }\n  }\n\n  // ─── STEP 7: Concept Resolution ──────────────────────────────────────────\n  log('STEP_7', 'Resolving keywords to Master Tree concepts...');\n\n  // Collect LLM-generated keywords from verified graph (not just AST)\n  const llmKeywords: Keyword[] = [];\n  const seenKw = new Set<string>();\n  for (const feature of verifiedGraph.features || []) {\n    for (const step of feature.steps || []) {\n      for (const kw of [...(step.keywords || []), ...(step.api_usage || [])]) {\n        if (!seenKw.has(kw.toLowerCase())) {\n          seenKw.add(kw.toLowerCase());\n          llmKeywords.push({ keyword: kw, source: 'llm_step', platform: 'app', weight: 1.0, context: 'LLM-generated step keyword' });\n        }\n      }\n    }\n  }\n  // Merge with AST keywords (AST takes precedence for source/weight)\n  const astKwMap = new Map(astKeywords.map(k => [k.keyword.toLowerCase(), k]));\n  const mergedKeywords: Keyword[] = [];\n  const mergedSeen = new Set<string>();\n  for (const kw of [...astKeywords, ...llmKeywords]) {\n    const key = kw.keyword.toLowerCase();\n    if (!mergedSeen.has(key)) {\n      mergedSeen.add(key);\n      mergedKeywords.push(astKwMap.get(key) || kw);\n    }\n  }\n\n  // Build depth overrides from concept escalation\n  const depthOverrides = new Map<string, 'ulo' | 'cio' | 'sio'>();\n  for (const mappings of featureConcepts.values()) {\n    for (const cm of mappings) {\n      if (!depthOverrides.has(cm.keyword)) {\n        depthOverrides.set(cm.keyword, cm.depth);\n      }\n    }\n  }\n\n  const resolvedConcepts = await resolveConcepts({\n    keywords: mergedKeywords,\n    goal,\n    embeddings,\n    depthOverrides,\n    llmConfig,\n  });\n  log('STEP_7', `Resolved: ${resolvedConcepts.summary.resolved_count}, Proposed: ${resolvedConcepts.summary.proposed_count} (${resolvedConcepts.summary.search_mode})`);\n\n  // ─── STEP 8: Assembly ────────────────────────────────────────────────────\n  log('STEP_8', 'Assembling roadmap with keyword tracking...');\n\n  const roadmap = assembleRoadmap({\n    projectGraph: verifiedGraph,\n    featureConcepts,\n    sessionMinutes: 90,\n    overheadFactor: 1.15,\n    maxMilestoneMinutes: 120,\n  });\n  log('STEP_8', `Roadmap assembled: ${roadmap.phases.length} phases, ${roadmap.phases.reduce((s, p) => s + p.milestones.length, 0)} milestones`);\n\n  return {\n    projectGraph: verifiedGraph,\n    resolvedConcepts,\n    roadmap,\n    hallucinations,\n    keywords: astKeywords,\n    featureConcepts,\n  };\n}\n"]}