@thanh01.pmt/domain-kit 0.6.0 → 0.6.2

package/dist/chunk-GVBDM746.mjs.map

@@ -0,0 +1 @@
+{"version":3,"sources":["../src/graph/scaffoldExtractor.ts","../src/graph/overviewExtractor.ts","../src/graph/stepExtractor.ts","../src/graph/graphVerifier.ts","../src/graph/conceptEscalator.ts","../src/graph/loCodeStandard.ts","../src/graph/knowledgeGraphVerifier.ts","../src/graph/depthAudit.ts","../src/graph/loExemplars.ts","../src/graph/hierarchicalLoAuthoring.ts","../src/graph/knowledgeTreeCatalog.ts","../src/graph/conceptStandardizer.ts","../src/graph/knowledgeGraphPipeline.ts","../src/graph/hybridGraphPipeline.ts"],"names":["buildSourceText","mkdirSync","writeFileSync","JSON_ONLY"],"mappings":";;;;;;;;;AA0BA,eAAsB,gBAAgB,OAAA,EAA0D;AAC9F,EAAA,MAAM,EAAE,IAAA,EAAM,SAAA,EAAW,QAAA,EAAU,SAAA,EAAW,cAAa,GAAI,OAAA;AAC/D,EAAA,MAAM,MAAA,GAAS,YAAA,IAAgB,eAAA,CAAgB,SAAS,CAAA;AACxD,EAAA,MAAM,cAAc,QAAA,CAAS,MAAA,GAAS,IAAI,QAAA,CAAS,IAAA,CAAK,IAAI,CAAA,GAAI,SAAA;AAEhE,EAAA,MAAM,YAAA,GACJ,4iDAAA;AAsBF,EAAA,MAAM,UAAA,GACJ,aAAa,IAAI;AAAA,YAAA,EACA,SAAS;;AAAA;AAAA,EAErB,WAAW;;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;AA4BlB,EAAA,IAAI;AACF,IAAA,MAAM,MAAA,GAAS,MAAM,WAAA,CAAY,MAAA,EAAQ,cAAc,UAAA,EAAY;AAAA,MACjE,WAAA,EAAa,GAAA;AAAA,MACb,WAAW,QAAA,CAAS,OAAA,CAAQ,GAAA,CAAI,gBAAA,IAAoB,SAAS,EAAE;AAAA,KAChE,CAAA;AAED,IAAA,MAAM,OAAO,MAAA,CAAO,OAAA;AACpB,IAAA,IAAI,CAAC,IAAA,IAAQ,CAAC,KAAA,CAAM,OAAA,CAAQ,IAAA,CAAK,KAAK,CAAA,IAAK,IAAA,CAAK,KAAA,CAAM,MAAA,KAAW,CAAA,EAAG;AAClE,MAAA,OAAA,CAAQ,KAAK,0DAAqD,CAAA;AAClE,MAAA,OAAO,IAAA;AAAA,IACT;AAGA,IAAA,MAAM,QAAS,IAAA,CAAK,KAAA,CAAoC,GAAA,CAAI,CAAC,GAAG,CAAA,MAAO;AAAA,MACrE,EAAA,EAAI,CAAA,IAAA,EAAO,CAAA,GAAI,CAAC,CAAA,CAAA;AAAA,MAChB,UAAU,CAAA,GAAI,CAAA;AAAA,MACd,MAAM,MAAA,CAAO,CAAA,CAAE,QAAQ,CAAA,KAAA,EAAQ,CAAA,GAAI,CAAC,CAAA,CAAE,CAAA;AAAA,MACtC,WAAA,EAAa,MAAA,CAAO,CAAA,CAAE,WAAA,IAAe,EAAE,CAAA;AAAA,MACvC,KAAA,EAAO,MAAM,OAAA,CAAQ,CAAA,CAAE,KAAK,CAAA,GAAI,CAAA,CAAE,QAAQ,EAAC;AAAA,MAC3C,SAAA,EAAW,MAAM,OAAA,CAAQ,CAAA,CAAE,SAAS,CAAA,GAAI,CAAA,CAAE,YAAY,EAAC;AAAA,MACvD,QAAA,EAAU,MAAM,OAAA,CAAQ,CAAA,CAAE,QAAQ,CAAA,GAAI,CAAA,CAAE,WAAW,EAAC;AAAA,MACpD,gBAAA,EAAkB,MAAA;AAAA,MAClB,QAAA,EAAU,MAAA,CAAO,CAAA,CAAE,QAAA,IAAY,KAAK,CAAA;AAAA,MACpC,MAAA,EAAQ,MAAA,CAAO,CAAA,CAAE,MAAA,IAAU,EAAE,CAAA;AAAA,MAC7B,OAAA,EAAS,EAAE,OAAA,IAAW,OAAO,EAAE,OAAA,KAAY,QAAA,GAAW,EAAE,OAAA,GAA2D,KAAA,CAAA;AAAA,MACnH,UAAA,EAAY,MAAM,OAAA,CAAQ,CAAA,CAAE,UAAU,CAAA,GAAI,CAAA,CAAE,aAAa,EAAC;AAAA,MAC1D,MAAA,EAAQ,EAAE,MAAA,IAAU,OAAO,EAAE,MAAA,KAAW,QAAA,GAAW,EAAE,MAAA,GAAmF,KAAA,CAAA;AAAA,MACxI,iBAAiB,EAAC;AAAA,MAClB,eAAe;AAAC,KAClB,CAAE,CAAA;AAEF,IAAA,OAAO;AAAA,MACL,EAAA,EAAI,IAAA;AAAA,MACJ,IAAA,EAAM,MAAA,CAAO,IAAA,CAAK,IAAA,IAAQ,oBAAoB,CAAA;AAAA,MAC9C,WAAA,EAAa,MAAA,CAAO,IAAA,CAAK,WAAA,IAAe,EAAE,CAAA;AAAA,MAC1C,QAAA,EAAU,MAAA,CAAO,IAAA,CAAK,QAAA,IAAY,KAAK,CAAA;AAAA,MACvC;AAAA,KACF;AAAA,EACF,SAAS,GAAA,EAAK;AACZ,IAAA,OAAA,CAAQ,KAAA,CAAM,CAAA,gCAAA,EAAmC,GAAG,CAAA,CAAE,CAAA;AACtD,IAAA,OAAO,IAAA;AAAA,EACT;AACF;;;AC1GA,SAAS,gBAAgB,eAAA,EAA8C;AACrE,EAAA,MAAM,SAAmB,EAAC;AAC1B,EAAA,KAAA,MAAW,CAAC,OAAA,EAAS,OAAO,CAAA,IAAK,eAAA,EAAiB;AAChD,IAAA,MAAA,CAAO,IAAA,CAAK,aAAa,OAAO;AAAA,EAAK,OAAO,CAAA,CAAE,CAAA;AAAA,EAChD;AACA,EAAA,OAAO,MAAA,CAAO,KAAK,MAAM,CAAA;AAC3B;AAMA,eAAsB,uBAAuB,OAAA,EAAmE;AAC9G,EAAA,MAAM,EAAE,MAAM,SAAA,EAAW,WAAA,EAAa,iBAAiB,WAAA,EAAa,SAAA,EAAW,cAAa,GAAI,OAAA;AAChG,EAAA,MAAM,MAAA,GAAS,YAAA,IAAgB,eAAA,CAAgB,SAAS,CAAA;AAExD,EAAA,MAAM,WAAA,GAAc,WAAA,CAAY,QAAA,CAC7B,MAAA,CAAO,SAAO,GAAA,CAAI,YAAY,CAAA,CAC9B,GAAA,CAAI,SAAO,GAAA,CAAI,IAAI,CAAA,CACnB,KAAA,CAAM,GAAG,GAAI,CAAA;AAEhB,EAAA,MAAM,WAAA,GAAc,gBAAgB,eAAe,CAAA;AAGnD,EAAA,IAAI,cAAA,GAAiB,EAAA;AACrB,EAAA,IAAI,WAAA,IAAe,WAAA,CAAY,MAAA,GAAS,CAAA,EAAG;AACzC,IAAA,MAAM,OAAA,GAAU,WAAA,CAAY,KAAA,CAAM,CAAA,EAAG,EAAE,CAAA,CAAE,GAAA;AAAA,MAAI,QAC3C,CAAA,EAAA,EAAK,EAAA,CAAG,OAAO,CAAA,OAAA,EAAU,GAAG,MAAM,CAAA,CAAA;AAAA,KACpC;AACA,IAAA,IAAI,OAAA,CAAQ,SAAS,CAAA,EAAG;AACtB,MAAA,cAAA,GACE,6FAAA,GACE,OAAA,CAAQ,IAAA,CAAK,IAAI,CAAA,GACjB,IAAA;AAAA,IAEN;AAAA,EACF;AAEA,EAAA,MAAM,YAAA,GACJ,05BAAA;AAcF,EAAA,MAAM,UAAA,GAAa,aAAa,IAAI;AAAA,YAAA,EACxB,SAAS;AAAA,EACrB,cAAc;AAAA;AAAA,EAEd,IAAA,CAAK,SAAA,CAAU,WAAA,EAAa,IAAA,EAAM,CAAC,CAAC;;AAAA;AAAA,EAGpC,WAAW;;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;AA6BX,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,gBAAA,IAAoB,SAAS,EAAE;AAAA,GAChE,CAAA;AAGD,EAAA,MAAM,OAAO,MAAA,CAAO,OAAA;AACpB,EAAA,IAAI,QAAQ,CAAC,KAAA,CAAM,OAAA,CAAQ,IAAA,CAAK,kBAAkB,CAAA,EAAG;AACnD,IAAA,IAAA,CAAK,qBAAqB,EAAC;AAAA,EAC7B;AAEA,EAAA,OAAO,MAAA;AACT;;;ACpGA,SAASA,iBAAgB,eAAA,EAA8C;AACrE,EAAA,MAAM,SAAmB,EAAC;AAC1B,EAAA,KAAA,MAAW,CAAC,OAAA,EAAS,OAAO,CAAA,IAAK,eAAA,EAAiB;AAChD,IAAA,MAAA,CAAO,IAAA,CAAK,aAAa,OAAO;AAAA,EAAK,OAAO,CAAA,CAAE,CAAA;AAAA,EAChD;AACA,EAAA,OAAO,MAAA,CAAO,KAAK,MAAM,CAAA;AAC3B;AAKA,eAAsB,oBAAoB,OAAA,EAA+C;AACvF,EAAA,MAAM,EAAE,MAAM,SAAA,EAAW,WAAA,EAAa,iBAAiB,OAAA,EAAS,SAAA,EAAW,cAAa,GAAI,OAAA;AAC5F,EAAA,MAAM,MAAA,GAAS,YAAA,IAAgB,eAAA,CAAgB,SAAS,CAAA;AAExD,EAAA,MAAM,WAAA,GAAc,WAAA,CAAY,QAAA,CAC7B,MAAA,CAAO,SAAO,GAAA,CAAI,YAAY,CAAA,CAC9B,GAAA,CAAI,SAAO,GAAA,CAAI,IAAI,CAAA,CACnB,KAAA,CAAM,GAAG,GAAI,CAAA;AAEhB,EAAA,MAAM,WAAA,GAAcA,iBAAgB,eAAe,CAAA;AACnD,EAAA,MAAM,GAAA,GAAM,QAAQ,EAAA,IAAM,OAAA;AAC1B,EAAA,MAAM,KAAA,GAAQ,QAAQ,IAAA,IAAQ,GAAA;AAC9B,EAAA,MAAM,KAAA,GAAQ,QAAQ,WAAA,IAAe,EAAA;AAErC,EAAA,MAAM,YAAA,GACJ,izBAAA;AAgBF,EAAA,MAAM,UAAA,GAAa,aAAa,IAAI;AAAA,YAAA,EACxB,SAAS;;AAAA,kBAAA,EAEH,GAAG,WAAM,KAAK;AAAA,qBAAA,EACX,KAAK;;AAAA;AAAA,EAG1B,IAAA,CAAK,SAAA,CAAU,WAAW,CAAC;;AAAA;AAAA,EAG3B,WAAW;;AAAA;AAAA;AAAA;AAAA;AAAA,aAAA,EAME,GAAG,CAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,CAAA,CAAA;AAgBhB,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,gBAAA,IAAoB,SAAS,EAAE;AAAA,GAChE,CAAA;AAED,EAAA,MAAM,QAAA,GAAY,MAAA,CAAO,KAAA,IAAS,EAAC;AAEnC,EAAA,MAAM,YAAA,GAAe,QAAA,CAAS,MAAA,GAAS,CAAA,GAAI,SAAS,KAAA,CAAM,CAAA,EAAG,CAAC,CAAA,GAAI,SAAS,MAAA,GAAS,CAAA,IAAK,QAAA,CAAS,MAAA,GAAS,IAAI,QAAA,GAAW,QAAA;AAC1H,EAAA,IAAI,QAAA,CAAS,SAAS,CAAA,EAAG;AACvB,IAAA,OAAA,CAAQ,KAAK,CAAA,oBAAA,EAAuB,QAAA,CAAS,MAAM,CAAA,WAAA,EAAc,GAAG,CAAA,cAAA,CAAgB,CAAA;AAAA,EACtF,CAAA,MAAA,IAAW,QAAA,CAAS,MAAA,KAAW,CAAA,EAAG;AAChC,IAAA,OAAA,CAAQ,IAAA,CAAK,CAAA,gCAAA,EAAmC,GAAG,CAAA,CAAE,CAAA;AAAA,EACvD;AACA,EAAA,OAAO,YAAA,CAAa,GAAA,CAAI,CAAC,CAAA,EAAG,CAAA,MAAO;AAAA,IACjC,EAAA,EAAI,CAAA,EAAG,GAAG,CAAA,EAAA,EAAK,IAAI,CAAC,CAAA,CAAA;AAAA,IACpB,UAAU,CAAA,GAAI,CAAA;AAAA,IACd,MAAM,MAAA,CAAO,CAAA,CAAE,QAAQ,CAAA,KAAA,EAAQ,CAAA,GAAI,CAAC,CAAA,CAAE,CAAA;AAAA,IACtC,WAAA,EAAa,MAAA,CAAO,CAAA,CAAE,WAAA,IAAe,EAAE,CAAA;AAAA,IACvC,KAAA,EAAO,MAAM,OAAA,CAAQ,CAAA,CAAE,KAAK,CAAA,GAAI,CAAA,CAAE,QAAoB,EAAC;AAAA,IACvD,SAAA,EAAW,MAAM,OAAA,CAAQ,CAAA,CAAE,SAAS,CAAA,GAAI,CAAA,CAAE,YAAwB,EAAC;AAAA,IACnE,QAAA,EAAU,MAAM,OAAA,CAAQ,CAAA,CAAE,QAAQ,CAAA,GAAI,CAAA,CAAE,WAAuB,EAAC;AAAA,IAChE,gBAAA,EAAmB,MAAA,CAAO,CAAA,CAAE,gBAAA,IAAoB,KAAK,CAAA;AAAA,IACrD,UAAU,MAAA,CAAO,CAAA,CAAE,QAAA,IAAY,OAAA,CAAQ,YAAY,KAAK,CAAA;AAAA,IACxD,MAAA,EAAQ,MAAA,CAAO,CAAA,CAAE,MAAA,IAAU,EAAE,CAAA;AAAA,IAC7B,SAAS,CAAA,CAAE,OAAA;AAAA,IACX,UAAA,EAAY,MAAM,OAAA,CAAQ,CAAA,CAAE,UAAU,CAAA,GAAI,CAAA,CAAE,aAAyB,EAAC;AAAA,IACtE,QAAQ,CAAA,CAAE,MAAA;AAAA,IACV,iBAAiB,EAAC;AAAA,IAClB,eAAe;AAAC,GAClB,CAAE,CAAA;AACJ;AAKA,eAAsB,2BACpB,IAAA,EACA,SAAA,EACA,aACA,eAAA,EACA,YAAA,EACA,WACA,YAAA,EAC8B;AAC9B,EAAA,MAAM,MAAA,GAAS,YAAA,IAAgB,eAAA,CAAgB,SAAS,CAAA;AAExD,EAAA,MAAM,WAAA,GAAc,WAAA,CAAY,QAAA,CAC7B,MAAA,CAAO,SAAO,GAAA,CAAI,YAAY,CAAA,CAC9B,GAAA,CAAI,SAAO,GAAA,CAAI,IAAI,CAAA,CACnB,KAAA,CAAM,GAAG,GAAI,CAAA;AAEhB,EAAA,MAAM,UAAA,GAAaA,iBAAgB,eAAe,CAAA;AAElD,EAAA,MAAM,kBAAkB,YAAA,CAAa,GAAA;AAAA,IAAI,CAAA,CAAA,KACvC,CAAA,EAAA,EAAK,CAAA,CAAE,EAAA,IAAM,IAAI,CAAA,EAAA,EAAK,CAAA,CAAE,IAAA,IAAQ,EAAE,CAAA,QAAA,EAAM,CAAA,CAAE,WAAA,IAAe,EAAE,CAAA;AAAA,GAC7D,CAAE,KAAK,IAAI,CAAA;AAEX,EAAA,MAAM,YAAA,GACJ,4cAAA;AAUF,EAAA,MAAM,UAAA,GAAa,aAAa,IAAI;AAAA,YAAA,EACxB,SAAS;;AAAA;AAAA,EAGrB,IAAA,CAAK,SAAA,CAAU,WAAW,CAAC;;AAAA;AAAA,EAG3B,UAAU;;AAAA;AAAA,EAGV,eAAe;;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;AA6Bf,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,gBAAA,IAAoB,SAAS,EAAE;AAAA,GAChE,CAAA;AAED,EAAA,MAAM,YAAY,MAAA,CAAO,KAAA;AACzB,EAAA,MAAM,MAAA,uBAAa,GAAA,EAAoB;AAEvC,EAAA,IAAI,SAAA,IAAa,OAAO,SAAA,KAAc,QAAA,EAAU;AAC9C,IAAA,KAAA,MAAW,CAAC,GAAA,EAAK,QAAQ,KAAK,MAAA,CAAO,OAAA,CAAQ,SAAS,CAAA,EAAG;AACvD,MAAA,IAAI,CAAC,KAAA,CAAM,OAAA,CAAQ,QAAQ,CAAA,EAAG;AAC9B,MAAA,MAAM,WAAW,YAAA,CAAa,IAAA,CAAK,CAAA,CAAA,KAAK,CAAA,CAAE,OAAO,GAAG,CAAA;AACpD,MAAA,MAAM,KAAA,GAAQ,QAAA,CAAS,GAAA,CAAI,CAAC,GAAG,CAAA,MAAO;AAAA,QACpC,EAAA,EAAI,CAAA,EAAG,GAAG,CAAA,EAAA,EAAK,IAAI,CAAC,CAAA,CAAA;AAAA,QACpB,UAAU,CAAA,GAAI,CAAA;AAAA,QACd,MAAM,MAAA,CAAO,CAAA,CAAE,QAAQ,CAAA,KAAA,EAAQ,CAAA,GAAI,CAAC,CAAA,CAAE,CAAA;AAAA,QACtC,WAAA,EAAa,MAAA,CAAO,CAAA,CAAE,WAAA,IAAe,EAAE,CAAA;AAAA,QACvC,KAAA,EAAO,MAAM,OAAA,CAAQ,CAAA,CAAE,KAAK,CAAA,GAAI,CAAA,CAAE,QAAoB,EAAC;AAAA,QACvD,SAAA,EAAW,MAAM,OAAA,CAAQ,CAAA,CAAE,SAAS,CAAA,GAAI,CAAA,CAAE,YAAwB,EAAC;AAAA,QACnE,QAAA,EAAU,MAAM,OAAA,CAAQ,CAAA,CAAE,QAAQ,CAAA,GAAI,CAAA,CAAE,WAAuB,EAAC;AAAA,QAChE,gBAAA,EAAmB,MAAA,CAAO,CAAA,CAAE,gBAAA,IAAoB,KAAK,CAAA;AAAA,QACrD,UAAU,MAAA,CAAO,CAAA,CAAE,QAAA,IAAY,QAAA,EAAU,YAAY,KAAK,CAAA;AAAA,QAC1D,MAAA,EAAQ,MAAA,CAAO,CAAA,CAAE,MAAA,IAAU,EAAE,CAAA;AAAA,QAC7B,SAAS,CAAA,CAAE,OAAA;AAAA,QACX,UAAA,EAAY,MAAM,OAAA,CAAQ,CAAA,CAAE,UAAU,CAAA,GAAI,CAAA,CAAE,aAAyB,EAAC;AAAA,QACtE,QAAQ,CAAA,CAAE,MAAA;AAAA,QACd,iBAAiB,EAAC;AAAA,QAClB,eAAe;AAAC,OACd,CAAE,CAAA;AACF,MAAA,MAAA,CAAO,GAAA,CAAI,KAAK,KAAK,CAAA;AAAA,IACvB;AAAA,EACF;AAEA,EAAA,OAAO,MAAA;AACT;;;ACnNO,SAAS,kBAAA,CACd,cACA,OAAA,EAC0D;AAC1D,EAAA,MAAM,EAAE,WAAA,EAAa,eAAA,EAAgB,GAAI,OAAA;AACzC,EAAA,MAAM,WAAA,GAAc,IAAI,GAAA,CAAI,WAAA,CAAY,SAAS,GAAA,CAAI,CAAA,GAAA,KAAO,GAAA,CAAI,IAAI,CAAC,CAAA;AACrE,EAAA,MAAM,iBAAkC,EAAC;AAEzC,EAAA,MAAM,QAAA,GAAW,YAAA,CAAa,QAAA,IAAY,EAAC;AAE3C,EAAA,KAAA,MAAW,WAAW,QAAA,EAAU;AAC9B,IAAA,MAAM,GAAA,GAAM,QAAQ,EAAA,IAAM,OAAA;AAC1B,IAAA,MAAM,eAAe,GAAA,KAAQ,IAAA;AAE7B,IAAA,KAAA,MAAW,IAAA,IAAQ,OAAA,CAAQ,KAAA,IAAS,EAAC,EAAG;AACtC,MAAA,MAAM,GAAA,GAAM,IAAA,CAAK,EAAA,IAAM,CAAA,EAAG,GAAG,CAAA,KAAA,CAAA;AAG7B,MAAA,MAAM,aAAuB,EAAC;AAC9B,MAAA,KAAA,MAAW,CAAA,IAAK,IAAA,CAAK,KAAA,IAAS,EAAC,EAAG;AAChC,QAAA,IAAI,eAAA,CAAgB,GAAA,CAAI,CAAC,CAAA,EAAG;AAC1B,UAAA,UAAA,CAAW,KAAK,CAAC,CAAA;AAAA,QACnB,CAAA,MAAO;AACL,UAAA,cAAA,CAAe,IAAA,CAAK;AAAA,YAClB,IAAA,EAAM,MAAA;AAAA,YACN,IAAA,EAAM,CAAA;AAAA,YACN,UAAA,EAAY,GAAA;AAAA,YACZ,OAAA,EAAS,GAAA;AAAA,YACT,MAAA,EAAQ,SAAS,CAAC,CAAA,yBAAA;AAAA,WACnB,CAAA;AAAA,QACH;AAAA,MACF;AACA,MAAA,IAAA,CAAK,KAAA,GAAQ,UAAA;AAGb,MAAA,MAAM,YAAsB,EAAC;AAC7B,MAAA,KAAA,MAAW,GAAA,IAAO,IAAA,CAAK,SAAA,IAAa,EAAC,EAAG;AACtC,QAAA,IAAI,YAAY,IAAA,KAAS,CAAA,IAAK,WAAA,CAAY,GAAA,CAAI,GAAG,CAAA,EAAG;AAClD,UAAA,SAAA,CAAU,KAAK,GAAG,CAAA;AAAA,QACpB,CAAA,MAAO;AACL,UAAA,cAAA,CAAe,IAAA,CAAK;AAAA,YAClB,IAAA,EAAM,KAAA;AAAA,YACN,IAAA,EAAM,GAAA;AAAA,YACN,UAAA,EAAY,GAAA;AAAA,YACZ,OAAA,EAAS,GAAA;AAAA,YACT,MAAA,EAAQ,QAAQ,GAAG,CAAA,4BAAA;AAAA,WACpB,CAAA;AAAA,QACH;AAAA,MACF;AACA,MAAA,IAAA,CAAK,SAAA,GAAY,SAAA;AAGjB,MAAA,IAAI,YAAA,EAAc;AAElB,MAAA,MAAM,WAAqB,EAAC;AAC5B,MAAA,KAAA,MAAW,EAAA,IAAM,IAAA,CAAK,QAAA,IAAY,EAAC,EAAG;AACpC,QAAA,MAAM,KAAA,GAAQ,GAAG,WAAA,EAAY;AAG7B,QAAA,MAAM,YAAA,GAAe,CAAC,KAAA,CAAM,QAAA,CAAS,GAAG,CAAA;AACxC,QAAA,IAAI,KAAA,GAAQ,KAAA;AAEZ,QAAA,KAAA,MAAW,KAAK,UAAA,EAAY;AAC1B,UAAA,MAAM,WAAW,eAAA,CAAgB,GAAA,CAAI,CAAC,CAAA,IAAK,IAAI,WAAA,EAAY;AAC3D,UAAA,IAAI,YAAA,EAAc;AAChB,YAAA,KAAA,GAAQ,IAAI,MAAA,CAAO,CAAA,GAAA,EAAM,KAAA,CAAM,OAAA,CAAQ,qBAAA,EAAuB,MAAM,CAAC,CAAA,GAAA,CAAK,CAAA,CAAE,IAAA,CAAK,OAAO,CAAA;AAAA,UAC1F,CAAA,MAAO;AACL,YAAA,KAAA,GAAQ,OAAA,CAAQ,SAAS,KAAK,CAAA;AAAA,UAChC;AACA,UAAA,IAAI,KAAA,EAAO;AAAA,QACb;AAEA,QAAA,IAAI,CAAC,KAAA,EAAO;AACV,UAAA,KAAA,MAAW,OAAA,IAAW,eAAA,CAAgB,MAAA,EAAO,EAAG;AAC9C,YAAA,MAAM,EAAA,GAAK,QAAQ,WAAA,EAAY;AAC/B,YAAA,IAAI,YAAA,EAAc;AAChB,cAAA,KAAA,GAAQ,IAAI,MAAA,CAAO,CAAA,GAAA,EAAM,KAAA,CAAM,OAAA,CAAQ,qBAAA,EAAuB,MAAM,CAAC,CAAA,GAAA,CAAK,CAAA,CAAE,IAAA,CAAK,EAAE,CAAA;AAAA,YACrF,CAAA,MAAO;AACL,cAAA,KAAA,GAAQ,EAAA,CAAG,SAAS,KAAK,CAAA;AAAA,YAC3B;AACA,YAAA,IAAI,KAAA,EAAO;AAAA,UACb;AAAA,QACF;AAEA,QAAA,IAAI,KAAA,EAAO;AACT,UAAA,QAAA,CAAS,KAAK,EAAE,CAAA;AAAA,QAClB,CAAA,MAAO;AACL,UAAA,cAAA,CAAe,IAAA,CAAK;AAAA,YAClB,IAAA,EAAM,SAAA;AAAA,YACN,IAAA,EAAM,EAAA;AAAA,YACN,UAAA,EAAY,GAAA;AAAA,YACZ,OAAA,EAAS,GAAA;AAAA,YACT,MAAA,EAAQ,YAAY,EAAE,CAAA,2BAAA;AAAA,WACvB,CAAA;AAAA,QACH;AAAA,MACF;AACA,MAAA,IAAA,CAAK,QAAA,GAAW,QAAA;AAAA,IAClB;AAAA,EACF;AAEA,EAAA,OAAO,EAAE,KAAA,EAAO,YAAA,EAAc,cAAA,EAAe;AAC/C;;;ACvFA,SAAS,aAAa,IAAA,EAAsB;AAC1C,EAAA,IAAI,CAAA,GAAI,IAAA,CAAK,OAAA,CAAQ,SAAA,EAAW,EAAE,CAAA;AAClC,EAAA,CAAA,GAAI,CAAA,CAAE,OAAA,CAAQ,oBAAA,EAAsB,OAAO,CAAA;AAC3C,EAAA,CAAA,GAAI,CAAA,CAAE,OAAA,CAAQ,SAAA,EAAW,GAAG,CAAA;AAC5B,EAAA,MAAM,MAAM,CAAA,CAAE,WAAA,EAAY,CAAE,OAAA,CAAQ,YAAY,EAAE,CAAA;AAClD,EAAA,OAAO,GAAA,IAAO,SAAA;AAChB;AAEA,SAAS,mBAAA,CAAoB,IAAA,EAAc,eAAA,EAAsC,WAAA,GAAc,CAAA,EAAa;AAC1G,EAAA,MAAM,WAAqB,EAAC;AAC5B,EAAA,MAAM,OAAA,GAAU,KAAK,WAAA,EAAY;AACjC,EAAA,KAAA,MAAW,CAAC,OAAA,EAAS,OAAO,CAAA,IAAK,eAAA,EAAiB;AAChD,IAAA,MAAM,KAAA,GAAQ,OAAA,CAAQ,KAAA,CAAM,IAAI,CAAA;AAChC,IAAA,KAAA,IAAS,GAAA,GAAM,CAAA,EAAG,GAAA,GAAM,KAAA,CAAM,QAAQ,GAAA,EAAA,EAAO;AAC3C,MAAA,IAAI,MAAM,GAAG,CAAA,CAAE,aAAY,CAAE,QAAA,CAAS,OAAO,CAAA,EAAG;AAC9C,QAAA,MAAM,KAAA,GAAQ,IAAA,CAAK,GAAA,CAAI,CAAA,EAAG,MAAM,CAAC,CAAA;AACjC,QAAA,MAAM,MAAM,IAAA,CAAK,GAAA,CAAI,KAAA,CAAM,MAAA,EAAQ,MAAM,CAAC,CAAA;AAC1C,QAAA,IAAI,UAAU,KAAA,CAAM,KAAA,CAAM,KAAA,EAAO,GAAG,EAAE,GAAA,CAAI,CAAA,CAAA,KAAK,CAAA,CAAE,IAAA,EAAM,CAAA,CAAE,MAAA,CAAO,OAAO,CAAA,CAAE,KAAK,GAAG,CAAA;AACjF,QAAA,IAAI,OAAA,CAAQ,SAAS,GAAA,EAAK,OAAA,GAAU,QAAQ,KAAA,CAAM,CAAA,EAAG,GAAG,CAAA,GAAI,KAAA;AAC5D,QAAA,IAAI,SAAS,QAAA,CAAS,IAAA,CAAK,IAAI,OAAO,CAAA,GAAA,EAAM,OAAO,CAAA,CAAE,CAAA;AACrD,QAAA,IAAI,QAAA,CAAS,UAAU,WAAA,EAAa;AAAA,MACtC;AAAA,IACF;AACA,IAAA,IAAI,QAAA,CAAS,UAAU,WAAA,EAAa;AAAA,EACtC;AACA,EAAA,OAAO,QAAA;AACT;AAKA,SAAS,qBAAA,CACP,SACA,eAAA,EACqD;AACrD,EAAA,MAAM,EAAA,GAAK,QAAQ,WAAA,EAAY;AAG/B,EAAA,MAAM,WAAA,GAAc;AAAA,IAClB,IAAA;AAAA;AAAA,IACA,WAAA;AAAA;AAAA,IACA,OAAA;AAAA;AAAA,IACA,aAAA;AAAA;AAAA,IACA,QAAA;AAAA;AAAA,IACA,UAAA;AAAA;AAAA,IACA;AAAA,GACF;AAEA,EAAA,IAAI,YAAY,IAAA,CAAK,CAAA,CAAA,KAAK,EAAE,IAAA,CAAK,OAAO,CAAC,CAAA,EAAG;AAC1C,IAAA,OAAO,EAAE,KAAA,EAAO,KAAA,EAAO,SAAA,EAAW,CAAA,SAAA,EAAY,OAAO,CAAA,kCAAA,CAAA,EAAqC;AAAA,EAC5F;AAGA,EAAA,MAAM,WAAA,GAAc;AAAA,IAClB,UAAA;AAAA,IAAY,WAAA;AAAA,IAAa,eAAA;AAAA,IAAiB,YAAA;AAAA,IAC1C,WAAA;AAAA,IAAa,YAAA;AAAA,IAAc,UAAA;AAAA,IAAY,WAAA;AAAA,IACvC,qBAAA;AAAA,IAAuB,cAAA;AAAA,IAAgB,UAAA;AAAA,IACvC,OAAA;AAAA,IAAS,MAAA;AAAA,IAAQ,OAAA;AAAA,IAAS,QAAA;AAAA,IAC1B,iBAAA;AAAA,IAAmB,gBAAA;AAAA,IACnB,cAAA;AAAA,IAAgB,UAAA;AAAA,IAAY;AAAA,GAC9B;AAEA,EAAA,IAAI,YAAY,IAAA,CAAK,CAAA,CAAA,KAAK,EAAE,IAAA,CAAK,OAAO,CAAC,CAAA,EAAG;AAC1C,IAAA,OAAO,EAAE,KAAA,EAAO,KAAA,EAAO,SAAA,EAAW,CAAA,SAAA,EAAY,OAAO,CAAA,gCAAA,CAAA,EAAmC;AAAA,EAC1F;AAGA,EAAA,MAAM,WAAA,GAAc;AAAA,IAClB,oBAAA;AAAA,IAAsB,eAAA;AAAA,IAAiB,sBAAA;AAAA,IACvC,aAAA;AAAA,IAAe,QAAA;AAAA,IAAU,WAAA;AAAA,IAAa,eAAA;AAAA,IACtC,WAAA;AAAA,IAAa,gBAAA;AAAA,IAAkB;AAAA,GACjC;AAEA,EAAA,IAAI,YAAY,IAAA,CAAK,CAAA,CAAA,KAAK,EAAE,IAAA,CAAK,OAAO,CAAC,CAAA,EAAG;AAC1C,IAAA,OAAO,EAAE,KAAA,EAAO,KAAA,EAAO,SAAA,EAAW,CAAA,SAAA,EAAY,OAAO,CAAA,wCAAA,CAAA,EAA2C;AAAA,EAClG;AAGA,EAAA,KAAA,MAAW,OAAA,IAAW,eAAA,CAAgB,MAAA,EAAO,EAAG;AAC9C,IAAA,MAAM,KAAA,GAAQ,OAAA,CAAQ,KAAA,CAAM,IAAI,CAAA;AAChC,IAAA,KAAA,MAAW,QAAQ,KAAA,EAAO;AACxB,MAAA,IAAI,IAAA,CAAK,WAAA,EAAY,CAAE,QAAA,CAAS,EAAE,CAAA,EAAG;AACnC,QAAA,IAAI,sCAAA,CAAuC,IAAA,CAAK,IAAA,CAAK,IAAA,EAAM,CAAA,EAAG;AAC5D,UAAA,OAAO,EAAE,KAAA,EAAO,KAAA,EAAO,SAAA,EAAW,CAAA,SAAA,EAAY,OAAO,CAAA,2BAAA,CAAA,EAA8B;AAAA,QACrF;AACA,QAAA,IAAI,qBAAA,CAAsB,IAAA,CAAK,IAAA,CAAK,IAAA,EAAM,CAAA,EAAG;AAC3C,UAAA,OAAO,EAAE,KAAA,EAAO,KAAA,EAAO,SAAA,EAAW,CAAA,SAAA,EAAY,OAAO,CAAA,sBAAA,CAAA,EAAyB;AAAA,QAChF;AAEA,QAAA,OAAO,EAAE,KAAA,EAAO,KAAA,EAAO,SAAA,EAAW,CAAA,SAAA,EAAY,OAAO,CAAA,6BAAA,CAAA,EAAgC;AAAA,MACvF;AAAA,IACF;AAAA,EACF;AAEA,EAAA,OAAO,EAAE,KAAA,EAAO,KAAA,EAAO,SAAA,EAAW,CAAA,mBAAA,EAAsB,OAAO,CAAA,+BAAA,CAAA,EAAkC;AACnG;AAKA,eAAsB,uBACpB,OAAA,EACwC;AACxC,EAAA,MAAM,EAAE,YAAA,EAAc,eAAA,EAAiB,mBAAmB,kBAAA,EAAoB,SAAA,EAAW,cAAa,GAAI,OAAA;AAE1G,EAAA,MAAM,QAAA,GAAW,YAAA,CAAa,QAAA,IAAY,EAAC;AAG3C,EAAA,MAAM,QAAA,uBAAe,GAAA,EAAY;AACjC,EAAA,KAAA,MAAW,WAAW,QAAA,EAAU;AAC9B,IAAA,KAAA,MAAW,IAAA,IAAQ,OAAA,CAAQ,KAAA,IAAS,EAAC,EAAG;AACtC,MAAA,KAAA,MAAW,OAAO,IAAA,CAAK,SAAA,IAAa,EAAC,EAAG,QAAA,CAAS,IAAI,GAAG,CAAA;AACxD,MAAA,KAAA,MAAW,MAAM,IAAA,CAAK,QAAA,IAAY,EAAC,EAAG,QAAA,CAAS,IAAI,EAAE,CAAA;AAAA,IACvD;AAAA,EACF;AAEA,EAAA,IAAI,QAAA,CAAS,IAAA,KAAS,CAAA,EAAG,2BAAW,GAAA,EAAI;AAExC,EAAA,MAAM,QAAA,GAAW,KAAA,CAAM,IAAA,CAAK,QAAQ,EAAE,IAAA,EAAK;AAC3C,EAAA,IAAI,aAA+F,EAAC;AAEpG,EAAA,IAAI,kBAAA,EAAoB;AACtB,IAAA,UAAA,GAAa,kBAAA;AAAA,EACf,CAAA,MAAO;AACL,IAAA,IAAI;AACF,MAAA,MAAM,MAAA,GAAS,YAAA,IAAgB,eAAA,CAAgB,SAAS,CAAA;AACxD,MAAA,MAAM,WAAA,GAAA,CAAe,qBAAqB,EAAC,EAAG,MAAK,CAAE,IAAA,CAAK,IAAI,CAAA,IAAK,SAAA;AAEnE,MAAA,MAAM,WAAA,GAAc,QAAA,CAAS,GAAA,CAAI,CAAA,IAAA,KAAQ;AACvC,QAAA,MAAM,QAAA,GAAW,mBAAA,CAAoB,IAAA,EAAM,eAAe,CAAA;AAC1D,QAAA,OAAO,QAAA,CAAS,MAAA,GAAS,CAAA,GACrB,CAAA,EAAA,EAAK,IAAI,CAAA,iBAAA,EAAoB,QAAA,CAAS,CAAC,CAAC,CAAA,CAAA,CAAA,GACxC,CAAA,EAAA,EAAK,IAAI,CAAA,CAAA;AAAA,MACf,CAAC,CAAA;AAED,MAAA,MAAM,YAAA,GACJ,CAAA;AAAA;AAAA;;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;;AAAA;AAAA;AAAA;AAAA,iBAAA,EAasB,WAAA,CAAY,KAAA,CAAM,CAAA,EAAG,IAAK,CAAC;AAAA;AAAA,+GAAA,CAAA;AAKnD,MAAA,MAAM,UAAA,GACJ,2IAAA,GAEE,WAAA,CAAY,IAAA,CAAK,IAAI,CAAA,GACrB,qHAAA;AAGJ,MAAA,MAAM,MAAA,GAAS,MAAM,WAAA,CAAY,MAAA,EAAQ,cAAc,UAAA,EAAY;AAAA,QACjE,WAAA,EAAa,GAAA;AAAA,QACb,SAAA,EAAW;AAAA,OACZ,CAAA;AAED,MAAA,UAAA,GAAc,MAAA,CAAO,WAAW,EAAC;AAAA,IACnC,SAAS,GAAA,EAAK;AACZ,MAAA,OAAA,CAAQ,IAAA,CAAK,CAAA,sCAAA,EAAyC,GAAG,CAAA,iCAAA,CAAmC,CAAA;AAAA,IAC9F;AAAA,EACF;AAGA,EAAA,MAAM,eAAA,uBAAsB,GAAA,EAA8B;AAE1D,EAAA,KAAA,MAAW,WAAW,QAAA,EAAU;AAC9B,IAAA,MAAM,GAAA,GAAM,QAAQ,EAAA,IAAM,OAAA;AAC1B,IAAA,MAAM,YAAA,uBAAmB,GAAA,EAAY;AACrC,IAAA,KAAA,MAAW,IAAA,IAAQ,OAAA,CAAQ,KAAA,IAAS,EAAC,EAAG;AACtC,MAAA,KAAA,MAAW,KAAK,IAAA,CAAK,KAAA,IAAS,EAAC,EAAG,YAAA,CAAa,IAAI,CAAC,CAAA;AAAA,IACtD;AAEA,IAAA,MAAM,MAAA,GAAS;AAAA,MACb,GAAI,OAAA,CAAQ,SAAA,IAAa,EAAC;AAAA,MAC1B,IAAI,OAAA,CAAQ,KAAA,IAAS,EAAC,EAAG,OAAA,CAAQ,OAAK,CAAC,GAAI,CAAA,CAAE,SAAA,IAAa,EAAC,EAAI,GAAI,EAAE,QAAA,IAAY,EAAG,CAAC;AAAA,KACvF;AAEA,IAAA,MAAM,QAA0B,EAAC;AACjC,IAAA,MAAM,IAAA,uBAAW,GAAA,EAAY;AAE7B,IAAA,KAAA,MAAW,MAAM,MAAA,EAAQ;AACvB,MAAA,MAAM,IAAA,GAAO,UAAA,CAAW,EAAE,CAAA,IAAK,EAAC;AAChC,MAAA,MAAM,KAAA,GAAQ,IAAA,CAAK,YAAA,IAAgB,YAAA,CAAa,EAAE,CAAA;AAClD,MAAA,MAAM,KAAA,GAAQ,KAAK,YAAA,IAAgB,EAAA;AAGnC,MAAA,IAAI,KAAA,GAA+B,KAAA;AACnC,MAAA,IAAI,cAAA,GAAiB,cAAA;AACrB,MAAA,IAAI,WAAA,GAA8C,UAAA;AAElD,MAAA,IAAI,IAAA,CAAK,KAAA,IAAS,CAAC,KAAA,EAAO,KAAA,EAAO,KAAK,CAAA,CAAE,QAAA,CAAS,IAAA,CAAK,KAAK,CAAA,EAAG;AAC5D,QAAA,KAAA,GAAQ,IAAA,CAAK,KAAA;AACb,QAAA,cAAA,GAAiB,qBAAqB,KAAK,CAAA,CAAA;AAC3C,QAAA,WAAA,GAAc,KAAA;AAAA,MAChB,CAAA,MAAO;AACL,QAAA,MAAM,QAAA,GAAW,qBAAA,CAAsB,EAAA,EAAI,eAAe,CAAA;AAC1D,QAAA,KAAA,GAAQ,QAAA,CAAS,KAAA;AACjB,QAAA,cAAA,GAAiB,QAAA,CAAS,SAAA;AAC1B,QAAA,WAAA,GAAc,WAAA;AAAA,MAChB;AAGA,MAAA,MAAM,KAAA,GAAQ,CAAA,EAAG,KAAK,CAAA,EAAA,EAAK,EAAE,CAAA,CAAA;AAC7B,MAAA,IAAI,IAAA,CAAK,GAAA,CAAI,KAAK,CAAA,EAAG;AACrB,MAAA,IAAA,CAAK,IAAI,KAAK,CAAA;AAGd,MAAA,MAAM,gBAA0B,EAAC;AACjC,MAAA,KAAA,MAAW,KAAK,YAAA,EAAc;AAC5B,QAAA,MAAM,OAAA,GAAU,eAAA,CAAgB,GAAA,CAAI,CAAC,CAAA,IAAK,EAAA;AAC1C,QAAA,IAAI,QAAQ,WAAA,EAAY,CAAE,SAAS,EAAA,CAAG,WAAA,EAAa,CAAA,EAAG;AACpD,UAAA,aAAA,CAAc,KAAK,CAAC,CAAA;AAAA,QACtB;AAAA,MACF;AAEA,MAAA,KAAA,CAAM,IAAA,CAAK;AAAA,QACT,YAAA,EAAc,KAAA;AAAA,QACd,YAAA,EAAc,KAAA;AAAA,QACd,OAAA,EAAS,EAAA;AAAA,QACT,KAAA;AAAA,QACA,eAAA,EAAiB,cAAA;AAAA,QACjB,YAAA,EAAc,WAAA;AAAA,QACd,cAAA,EAAgB;AAAA,OACjB,CAAA;AAAA,IACH;AAEA,IAAA,eAAA,CAAgB,GAAA,CAAI,KAAK,KAAK,CAAA;AAAA,EAChC;AAEA,EAAA,OAAO,eAAA;AACT;;;ACxQA,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;;;ACxGpB,SAAS,yBAAyB,QAAA,EAAiC;AACxE,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,MAAM,SAAA,uBAAgB,GAAA,EAAsB;AAC5C,EAAA,KAAA,MAAW,KAAK,QAAA,EAAU;AACxB,IAAA,SAAA,CAAU,IAAI,CAAA,CAAE,EAAA,EAAI,CAAA,CAAE,aAAA,IAAiB,EAAE,CAAA;AAAA,EAC3C;AAEA,EAAA,SAAS,IAAI,SAAA,EAAmB;AAC9B,IAAA,IAAI,OAAA,CAAQ,GAAA,CAAI,SAAS,CAAA,EAAG;AAC1B,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,KAAA,MAAW,UAAU,SAAA,CAAU,GAAA,CAAI,SAAS,CAAA,IAAK,EAAC,EAAG;AACnD,MAAA,GAAA,CAAI,MAAM,CAAA;AAAA,IACZ;AAEA,IAAA,IAAA,CAAK,GAAA,EAAI;AACT,IAAA,OAAA,CAAQ,OAAO,SAAS,CAAA;AAAA,EAC1B;AAEA,EAAA,KAAA,MAAW,KAAK,QAAA,EAAU;AACxB,IAAA,IAAI,CAAC,OAAA,CAAQ,GAAA,CAAI,CAAA,CAAE,EAAE,CAAA,EAAG;AACtB,MAAA,GAAA,CAAI,EAAE,EAAE,CAAA;AAAA,IACV;AAAA,EACF;AAEA,EAAA,OAAO,MAAA;AACT;AAKO,SAAS,uBAAA,CACd,UACA,MAAA,EACoE;AACpE,EAAA,MAAM,UAA+C,EAAC;AACtD,EAAA,MAAM,QAAQ,QAAA,CAAS,GAAA,CAAI,CAAC,CAAA,MAAO,EAAE,GAAG,CAAA,EAAG,aAAA,EAAe,CAAC,GAAI,CAAA,CAAE,aAAA,IAAiB,EAAG,GAAE,CAAE,CAAA;AAEzF,EAAA,KAAA,MAAW,SAAS,MAAA,EAAQ;AAC1B,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,EAAA,KAAO,OAAA,IAAW,MAAA,EAAQ;AACpC,UAAA,OAAA,CAAQ,gBAAgB,OAAA,CAAQ,aAAA,CAAc,OAAO,CAAC,CAAA,KAAM,MAAM,MAAM,CAAA;AACxE,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;AAMO,SAAS,qBAAA,CACd,UACA,QAAA,EAC4F;AAC5F,EAAA,IAAI,CAAC,QAAA,IAAY,QAAA,CAAS,SAAA,CAAU,WAAW,CAAA,EAAG;AAChD,IAAA,OAAO,EAAE,eAAe,CAAA,EAAK,WAAA,EAAa,GAAG,aAAA,EAAe,CAAA,EAAG,SAAA,EAAW,EAAC,EAAE;AAAA,EAC/E;AAEA,EAAA,MAAM,SAAS,QAAA,CAAS,SAAA;AACxB,EAAA,MAAM,UAAA,uBAAiB,GAAA,EAAY;AAEnC,EAAA,KAAA,MAAW,SAAS,MAAA,EAAQ;AAC1B,IAAA,MAAM,aAAA,uBAAoB,GAAA,CAAI;AAAA,MAC5B,GAAG,KAAA,CAAM,KAAA,CAAM,WAAA,EAAY,CAAE,MAAM,KAAK,CAAA;AAAA,MACxC,GAAA,CAAI,KAAA,CAAM,QAAA,IAAY,EAAC,EAAG,IAAI,CAAC,CAAA,KAAM,CAAA,CAAE,WAAA,EAAa;AAAA,KACrD,CAAA;AAGD,IAAA,KAAA,MAAW,WAAW,QAAA,EAAU;AAC9B,MAAc,OAAA,CAAQ,IAAA,CAAK,WAAA;AAC3B,MAAM,CAAS,OAAA,CAAQ,WAAA,IAAe,EAAA,EAAI,WAAA;AAC1C,MAAM,CAAa,OAAA,CAAQ,QAAA,IAAY,EAAC,EAAG,IAAI,CAAC,CAAA,KAAM,CAAA,CAAE,WAAA,EAAa;AAGrE,MAAA,IAAI,QAAQ,EAAA,CAAG,WAAA,OAAkB,KAAA,CAAM,EAAA,CAAG,aAAY,EAAG;AACvD,QAAA,UAAA,CAAW,GAAA,CAAI,MAAM,EAAE,CAAA;AACvB,QAAA;AAAA,MACF;AAEA,MAAA,MAAM,IAAA,GAAQ,OAAA,CAAgB,UAAA,IAAc,EAAC;AAC7C,MAAA,MAAM,cAAc,IAAA,CAAK,IAAA;AAAA,QACvB,CAAC,CAAA,KAAW,CAAA,CAAE,EAAA,KAAO,MAAM,EAAA,IAAO,CAAA,CAAE,KAAA,IAAS,CAAA,CAAE,KAAA,CAAM,WAAA,EAAY,KAAM,KAAA,CAAM,MAAM,WAAA;AAAY,OACjG;AACA,MAAA,IAAI,WAAA,EAAa;AACf,QAAA,UAAA,CAAW,GAAA,CAAI,MAAM,EAAE,CAAA;AACvB,QAAA;AAAA,MACF;AAEA,MAAA,MAAM,eAAA,GAAA,CAAmB,OAAA,CAAQ,QAAA,IAAY,EAAC,EAAG,IAAI,CAAC,CAAA,KAAM,CAAA,CAAE,WAAA,EAAa,CAAA;AAC3E,MAAA,MAAM,UAAA,GAAa,eAAA,CAAgB,IAAA,CAAK,CAAC,CAAA,KAAM,aAAA,CAAc,GAAA,CAAI,CAAC,CAAC,CAAA,IACjE,OAAA,CAAQ,IAAA,CAAK,WAAA,EAAY,CAAE,QAAA,CAAS,KAAA,CAAM,KAAA,CAAM,WAAA,EAAa,CAAA,IAC7D,KAAA,CAAM,KAAA,CAAM,WAAA,EAAY,CAAE,QAAA,CAAS,OAAA,CAAQ,IAAA,CAAK,WAAA,EAAa,CAAA;AAE/D,MAAA,IAAI,UAAA,EAAY;AACd,QAAA,UAAA,CAAW,GAAA,CAAI,MAAM,EAAE,CAAA;AACvB,QAAA;AAAA,MACF;AAAA,IACF;AAAA,EACF;AAEA,EAAA,MAAM,cAAc,MAAA,CAAO,MAAA;AAC3B,EAAA,MAAM,gBAAgB,UAAA,CAAW,IAAA;AACjC,EAAA,MAAM,aAAA,GAAgB,WAAA,GAAc,CAAA,GAAI,aAAA,GAAgB,WAAA,GAAc,CAAA;AACtE,EAAA,MAAM,SAAA,GAAY,OAAO,MAAA,CAAO,CAAC,MAAM,CAAC,UAAA,CAAW,IAAI,CAAA,CAAE,EAAE,CAAC,CAAA,CAAE,GAAA,CAAI,CAAC,CAAA,KAAM,CAAA,EAAG,EAAE,EAAE,CAAA,EAAA,EAAK,CAAA,CAAE,KAAK,CAAA,CAAE,CAAA;AAE9F,EAAA,OAAO,EAAE,aAAA,EAAe,WAAA,EAAa,aAAA,EAAe,SAAA,EAAU;AAChE;AAKO,SAAS,oBAAA,CACd,IACA,iBAAA,EAC6E;AAC7E,EAAA,MAAM,QAAA,GAAW,iBAAA,IAAqB,gBAAA,IAAoB,iBAAA,GACtD,kBAAkB,cAAA,GACjB,iBAAA;AAEL,EAAA,MAAM,WAAqB,EAAC;AAC5B,EAAA,IAAI,WAAW,CAAC,GAAI,EAAA,CAAG,QAAA,IAAY,EAAG,CAAA;AACtC,EAAA,MAAM,UAAA,GAAa,IAAI,GAAA,CAAI,QAAA,CAAS,IAAI,CAAC,CAAA,KAAM,CAAA,CAAE,EAAE,CAAC,CAAA;AAGpD,EAAA,KAAA,MAAW,KAAK,QAAA,EAAU;AACxB,IAAA,IAAA,CAAK,EAAE,aAAA,IAAiB,IAAI,QAAA,CAAS,CAAA,CAAE,EAAE,CAAA,EAAG;AAC1C,MAAA,CAAA,CAAE,aAAA,GAAA,CAAiB,CAAA,CAAE,aAAA,IAAiB,EAAC,EAAG,OAAO,CAAC,CAAA,KAAM,CAAA,KAAM,CAAA,CAAE,EAAE,CAAA;AAClE,MAAA,QAAA,CAAS,IAAA,CAAK,CAAA,6BAAA,EAAgC,CAAA,CAAE,EAAE,CAAA,CAAE,CAAA;AAAA,IACtD;AAAA,EACF;AAGA,EAAA,MAAM,wBAA+E,EAAC;AACtF,EAAA,KAAA,MAAW,KAAK,QAAA,EAAU;AACxB,IAAA,MAAM,eAAyB,EAAC;AAChC,IAAA,KAAA,MAAW,CAAA,IAAK,CAAA,CAAE,aAAA,IAAiB,EAAC,EAAG;AACrC,MAAA,IAAI,CAAC,UAAA,CAAW,GAAA,CAAI,CAAC,CAAA,EAAG;AACtB,QAAA,qBAAA,CAAsB,KAAK,EAAE,SAAA,EAAW,EAAE,EAAA,EAAI,eAAA,EAAiB,GAAG,CAAA;AAClE,QAAA,QAAA,CAAS,KAAK,CAAA,+BAAA,EAAkC,CAAA,CAAE,EAAE,CAAA,IAAA,EAAO,CAAC,CAAA,CAAE,CAAA;AAAA,MAChE,CAAA,MAAO;AACL,QAAA,YAAA,CAAa,KAAK,CAAC,CAAA;AAAA,MACrB;AAAA,IACF;AACA,IAAA,CAAA,CAAE,aAAA,GAAgB,YAAA;AAAA,EACpB;AAGA,EAAA,MAAM,aAAA,GAAgB,yBAAyB,QAAQ,CAAA;AACvD,EAAA,IAAI,eAAoD,EAAC;AACzD,EAAA,IAAI,aAAA,CAAc,SAAS,CAAA,EAAG;AAC5B,IAAA,MAAM,MAAA,GAAS,uBAAA,CAAwB,QAAA,EAAU,aAAa,CAAA;AAC9D,IAAA,QAAA,GAAW,MAAA,CAAO,KAAA;AAClB,IAAA,YAAA,GAAe,MAAA,CAAO,OAAA;AACtB,IAAA,KAAA,MAAW,KAAK,YAAA,EAAc;AAC5B,MAAA,QAAA,CAAS,KAAK,CAAA,2BAAA,EAA8B,CAAA,CAAE,IAAI,CAAA,IAAA,EAAO,CAAA,CAAE,EAAE,CAAA,CAAE,CAAA;AAAA,IACjE;AAAA,EACF;AAGA,EAAA,MAAM,QAAA,GAAW,qBAAA,CAAsB,QAAA,EAAU,QAAQ,CAAA;AACzD,EAAA,IAAI,QAAA,CAAS,gBAAgB,CAAA,EAAK;AAChC,IAAA,QAAA,CAAS,IAAA,CAAK,sBAAsB,QAAA,CAAS,aAAA,GAAgB,KAAK,OAAA,CAAQ,CAAC,CAAC,CAAA,GAAA,EAAM,QAAA,CAAS,aAAa,CAAA,CAAA,EAAI,QAAA,CAAS,WAAW,CAAA,qBAAA,EAAwB,QAAA,CAAS,UAAU,IAAA,CAAK,IAAI,CAAC,CAAA,CAAE,CAAA;AAAA,EACzL;AAGA,EAAA,KAAA,MAAW,KAAK,QAAA,EAAU;AACxB,IAAA,IAAI,CAAC,EAAE,GAAA,EAAK,QAAA,CAAS,KAAK,CAAA,QAAA,EAAW,CAAA,CAAE,EAAE,CAAA,yBAAA,CAA2B,CAAA;AACpE,IAAA,IAAI,CAAC,EAAE,GAAA,EAAK,QAAA,CAAS,KAAK,CAAA,QAAA,EAAW,CAAA,CAAE,EAAE,CAAA,4BAAA,CAA8B,CAAA;AACvE,IAAA,IAAI,CAAC,CAAA,CAAE,GAAA,IAAO,CAAA,CAAE,GAAA,CAAI,MAAA,KAAW,CAAA,EAAG,QAAA,CAAS,IAAA,CAAK,CAAA,QAAA,EAAW,CAAA,CAAE,EAAE,CAAA,iCAAA,CAAmC,CAAA;AAAA,EACpG;AAEA,EAAA,MAAM,KAAA,GAAQ,cAAc,MAAA,KAAW,CAAA,IAAK,sBAAsB,MAAA,KAAW,CAAA,IAAK,SAAS,aAAA,IAAiB,GAAA;AAE5G,EAAA,MAAM,aAAA,GAAgC;AAAA,IACpC,GAAG,EAAA;AAAA,IACH;AAAA,GACF;AAEA,EAAA,MAAM,MAAA,GAA2C;AAAA,IAC/C,KAAA;AAAA,IACA,MAAA,EAAQ,aAAA;AAAA,IACR,YAAA;AAAA,IACA,qBAAA;AAAA,IACA,eAAe,QAAA,CAAS,aAAA;AAAA,IACxB,qBAAqB,QAAA,CAAS,WAAA;AAAA,IAC9B,uBAAuB,QAAA,CAAS,aAAA;AAAA,IAChC,iBAAiB,QAAA,CAAS,SAAA;AAAA,IAC1B;AAAA,GACF;AAEA,EAAA,OAAO,EAAE,eAAe,MAAA,EAAO;AACjC;;;AC5NA,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;AA8BO,IAAM,iBAAA,GAA8B;AAAA,EACzC,OAAA;AAAA,EAAS,QAAA;AAAA,EAAU,WAAA;AAAA,EAAa,OAAA;AAAA,EAAS,WAAA;AAAA,EAAa,KAAA;AAAA,EAAO,KAAA;AAAA,EAAO,OAAA;AAAA,EACpE,SAAA;AAAA,EAAW,OAAA;AAAA,EAAS,MAAA;AAAA,EAAQ,MAAA;AAAA,EAAQ,QAAA;AAAA,EAAU,OAAA;AAAA,EAAS,UAAA;AAAA,EAAY,MAAA;AAAA,EACnE,UAAA;AAAA,EAAY,SAAA;AAAA,EAAW,UAAA;AAAA,EAAY,OAAA;AAAA,EAAS,QAAA;AAAA,EAAU,SAAA;AAAA,EAAW,QAAA;AAAA,EACjE,QAAA;AAAA,EAAU,SAAA;AAAA,EAAW,KAAA;AAAA,EAAO,MAAA;AAAA,EAAQ,OAAA;AAAA,EAAS,MAAA;AAAA,EAAQ,KAAA;AAAA,EAAO,MAAA;AAAA,EAAQ,OAAA;AAAA,EACpE,SAAA;AAAA,EAAW,QAAA;AAAA,EAAU,QAAA;AAAA,EAAU,SAAA;AAAA,EAAW,OAAA;AAAA,EAAS,OAAA;AAAA,EAAS,WAAA;AAAA,EAC5D,UAAA;AAAA,EAAY,WAAA;AAAA,EAAa,SAAA;AAAA,EAAW,MAAA;AAAA,EAAQ,QAAA;AAAA,EAAU,OAAA;AAAA,EAAS,OAAA;AAAA,EAC/D,OAAA;AAAA,EAAS,QAAA;AAAA,EAAU,OAAA;AAAA,EAAS,MAAA;AAAA,EAAQ,OAAA;AAAA,EAAS,QAAA;AAAA,EAAU,QAAA;AAAA,EAAU,UAAA;AAAA,EACjE,SAAA;AAAA,EAAW,UAAA;AAAA,EAAY,WAAA;AAAA,EAAa,UAAA;AAAA,EAAY,aAAA;AAAA,EAAe,QAAA;AAAA,EAC/D,UAAA;AAAA,EAAY,WAAA;AAAA,EAAa,QAAA;AAAA,EAAU,QAAA;AAAA,EAAU,SAAA;AAAA,EAAW,aAAA;AAAA,EACxD,QAAA;AAAA,EAAU,UAAA;AAAA,EAAY,QAAA;AAAA,EAAU,QAAA;AAAA,EAAU,QAAA;AAAA,EAAU,OAAA;AAAA,EAAS,MAAA;AAAA,EAC7D,QAAA;AAAA,EAAU,KAAA;AAAA,EAAO,QAAA;AAAA,EAAU,OAAA;AAAA,EAAS,OAAA;AAAA,EAAS,SAAA;AAAA,EAAW,SAAA;AAAA,EAAW,OAAA;AAAA,EACnE,cAAA;AAAA,EAAgB,WAAA;AAAA,EAAa,QAAA;AAAA,EAAU,SAAA;AAAA;AAAA;AAAA,EAGvC,QAAA;AAAA,EAAU,QAAA;AAAA,EAAU,SAAA;AAAA,EAAW,MAAA;AAAA,EAAQ,QAAA;AAAA,EAAU,SAAA;AAAA,EAAW,QAAA;AAAA,EAC5D,WAAA;AAAA,EAAa,SAAA;AAAA,EAAW,SAAA;AAAA,EAAW,SAAA;AAAA,EAAW,SAAA;AAAA,EAAW,SAAA;AAAA,EAAW;AACtE,CAAA;AAEO,SAAS,gBAAA,CACd,UAKA,SAAA,EACmB;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,IAAI,MAAA,CAAO,QAAA,GAAW,kBAAkB,IAAA,CAAK,GAAG,CAAA,GAAI,MAAA,EAAQ,GAAG,CAAA;AACnF,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;AAAY,IAAA,OAAO;AAAA,MACnB,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,MAAA;AAAA,MACA;AAAA,KACF;AAAA,EACF,CAAC,CAAA;AACH;;;ACpLO,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;;;ACSA,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,EACA,SAAA,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,EAAA;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,SAAA,EAAW,mBAAA,CAAoB,SAAA,EAAW,MAAA,CAAO,KAAA,EAAO,EAAE,eAAA,EAAiB,IAAA,EAAM,CAAC,CAAA;AACnI,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,YAAA,EAAc,mBAAA,CAAoB,SAAA,EAAW,MAAA,CAAO,KAAA,EAAO,EAAE,eAAA,EAAiB,IAAA,EAAM,CAAC,CAAA;AACtI,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,MAAA,GAAS,iBAAA,CAAkB,IAAA,CAAK,IAAI,CAAA,GAAI,uDAAA;AAAA,IACxC,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,YAAA,EAAc,mBAAA,CAAoB,SAAA,EAAW,MAAA,CAAO,KAAA,EAAO,EAAE,eAAA,EAAiB,IAAA,EAAM,CAAC,CAAA;AACtI,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,yEAAA,GAA4E,CAAC,OAAA,EAAS,QAAA,EAAU,QAAA,EAAU,QAAA,EAAU,SAAA,EAAW,MAAA,EAAQ,QAAA,EAAU,KAAK,CAAA,CAAE,IAAA,CAAK,IAAI,CAAA,GAAI,iLAAA;AAAA,QACrK,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,WAAAC,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,MAAA,EAAQ,UAAU,aAAA,EAAe,MAAA,CAAO,CAAC,CAAA,EAAG,SAAA,EAAU;AAC3G;ACpTA,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,eAAA,CAAgB,CAAC,CAAA,CAAE,OAAA,CAAQ,iBAAiB,GAAG,CAAA,CAAE,KAAA,CAAM,KAAK,EAAE,MAAA,CAAO,CAAC,CAAA,KAAM,CAAA,CAAE,UAAU,CAAC;AAAA,GAC3F;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;ACpGA,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,mWAAA,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,UAAA,GAAA,CAAc,CAAA,CAAE,gBAAA,IAAoB,EAAC,EAAG,GAAA,CAAI,CAAC,CAAA,KAAM,MAAA,CAAO,CAAC,CAAC,CAAA,CAAE,OAAO,OAAO,CAAA;AAClF,MAAA,IAAI,OAAA;AACJ,MAAA,IAAI,EAAA,CAAG,QAAA,CAAS,MAAA,KAAW,CAAA,EAAG;AAO5B,QAAA,OAAA,GAAU,WAAW,MAAA,CAAO,CAAC,CAAA,KAAA,CAAO,CAAA,CAAE,YAAY,EAAC,EAAG,IAAA,CAAK,CAAC,OAAO,EAAA,CAAG,WAAA,OAAkB,CAAA,CAAE,WAAA,EAAa,CAAC,CAAA;AACxG,QAAA,IAAI,OAAA,CAAQ,MAAA,KAAW,CAAA,EAAG,OAAA,GAAA,CAAW,CAAA,CAAE,YAAY,EAAC,EAAG,KAAA,CAAM,CAAA,EAAG,CAAC,CAAA;AACjE,QAAA,QAAA,CAAS,IAAA,CAAK,UAAA,GAAa,CAAA,CAAE,EAAA,GAAK,iBAAA,GAAoB,GAAG,IAAA,GAAO,0CAAA,GAAwC,OAAA,CAAQ,MAAA,GAAS,uCAAuC,CAAA;AAAA,MAClK,CAAA,MAAO;AAQL,QAAA,MAAM,IAAA,GAAO,CAAC,CAAA,KAAsB,CAAA,CAAE,WAAA,EAAY,CAAE,OAAA,CAAQ,MAAA,EAAQ,GAAG,CAAA,CAAE,OAAA,CAAQ,IAAA,EAAM,EAAE,CAAA;AACzF,QAAA,MAAM,UAAA,GAAa,IAAI,GAAA,CAAI,CAAC,GAAG,MAAM,CAAA,CAAE,GAAA,CAAI,IAAI,CAAC,CAAA;AAChD,QAAA,MAAM,UAAoB,EAAC;AAC3B,QAAA,OAAA,GAAU,UAAA,CAAW,MAAA,CAAO,CAAC,CAAA,KAAM;AACjC,UAAA,IAAI,MAAA,CAAO,GAAA,CAAI,CAAA,CAAE,WAAA,EAAa,CAAA,IAAK,UAAA,CAAW,GAAA,CAAI,IAAA,CAAK,CAAC,CAAC,CAAA,EAAG,OAAO,IAAA;AACnE,UAAA,OAAA,CAAQ,KAAK,CAAC,CAAA;AACd,UAAA,OAAO,KAAA;AAAA,QACT,CAAC,CAAA;AACD,QAAA,IAAI,OAAA,CAAQ,SAAS,CAAA,EAAG;AACtB,UAAA,QAAA,CAAS,IAAA,CAAK,UAAA,GAAa,CAAA,CAAE,EAAA,GAAK,eAAe,OAAA,CAAQ,MAAA,GAAS,0CAAA,GAA6C,EAAA,CAAG,IAAA,GAAO,aAAA,GAAgB,OAAA,CAAQ,IAAA,CAAK,IAAI,CAAC,CAAA;AAAA,QAC7J;AAAA,MACF;AACA,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;;;AC7LO,IAAM,uBAAA,GAA0B,EAAA;AAChC,IAAM,uBAAA,GAA0B,EAAA;AAChC,IAAM,uBAAA,GAA0B,EAAA;AAEhC,IAAM,0BAAA,GAA6B,GAAA;AAYnC,SAAS,uBAAA,CACd,QAAA,EACA,gBAAA,EACA,WAAA,EACA,YAAA,EACQ;AACR,EAAA,MAAM,KAAA,GAAQ,CAAC,KAAA,EAAe,GAAA,KAAwB,IAAA,CAAK,GAAA,CAAI,CAAA,EAAG,IAAA,CAAK,GAAA,CAAI,CAAA,EAAG,KAAK,CAAA,GAAI,GAAG,CAAA;AAC1F,EAAA,MAAM,QACJ,GAAA,GAAO,KAAA,CAAM,UAAU,CAAC,CAAA,GACxB,OAAO,KAAA,CAAM,gBAAA,EAAkB,CAAC,CAAA,GAChC,MAAO,KAAA,CAAM,WAAA,EAAa,CAAC,CAAA,GAC3B,IAAA,IAAQ,eAAe,CAAA,GAAI,CAAA,CAAA;AAC7B,EAAA,OAAO,IAAA,CAAK,KAAA,CAAM,uBAAA,GAA0B,KAAA,IAAS,0BAA0B,uBAAA,CAAwB,CAAA;AACzG;AASA,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,IAAI,iBAAiB,OAAA,CAAQ,cAAA;AAC7B,EAAA,IAAI,CAAC,kBAAkB,YAAA,EAAc;AACnC,IAAA,cAAA,GAAiB,cAAc,YAAY,CAAA;AAC3C,IAAA,GAAA,CAAI,QAAA,EAAU,oBAAoB,cAAA,CAAe,KAAA,CAAM,MAAM,CAAA,QAAA,EAAW,cAAA,CAAe,SAAA,CAAU,MAAM,CAAA,OAAA,CAAS,CAAA;AAAA,EAClH;AAEA,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,qBAAA,GAAwB,cAAA,IAAkB,cAAA,CAAe,SAAA,CAAU,SAAS,CAAA,GAC9E;AAAA;AAAA,CAAA,GACE,cAAA,CAAe,SAAA,CAAU,GAAA,CAAI,CAAC,CAAA,KAAM,MAAM,CAAA,CAAE,SAAS,CAAA,EAAA,EAAK,CAAA,CAAE,EAAE,CAAA,EAAA,EAAK,EAAE,KAAK,CAAA,YAAA,EAAe,CAAA,CAAE,QAAA,CAAS,IAAA,CAAK,IAAI,CAAC,CAAA,CAAA,CAAG,CAAA,CAAE,IAAA,CAAK,IAAI,CAAA,GAAI,IAAA,GAClI,EAAA;AAEJ,EAAA,MAAM,YAAA,GACJ,CAAA;;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,gDAAA,CAAA;AAsCF,EAAA,MAAM,UAAA,GAAa,YAAY,OAAO;AAAA,EAAK,WAAA,GAAc,CAAA,aAAA,EAAgB,WAAW,CAAA,CAAA,GAAK,EAAE;AAAA,EAAK,qBAAqB,GAAG,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;AAAA,CAAA,CAAA;AAEvjB,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;AAG1C,EAAA,KAAA,MAAW,KAAK,QAAA,EAAU;AACxB,IAAA,IAAA,CAAK,CAAA,CAAE,WAAA,IAAe,EAAA,EAAI,MAAA,GAAS,EAAA,EAAI;AACrC,MAAA,QAAA,CAAS,IAAA,CAAK,aAAa,CAAA,CAAE,EAAA,GAAK,+BAA+B,CAAA,CAAE,WAAA,IAAe,EAAA,EAAI,MAAA,GAAS,kDAA6C,CAAA;AAAA,IAC9I;AAAA,EACF;AAKA,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,eAAA,CAAgB,IAAI,CAAA,CAChE,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,4DAA4D,CAAA;AAAA,MACxJ,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,MAAM,mBAAA,uBAA0B,GAAA,EAAY;AAC5C,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,CAAA,MAAA,IAAW,CAAC,MAAA,EAAQ;AAClB,UAAA,mBAAA,CAAoB,IAAI,EAAE,CAAA;AAAA,QAC5B;AAAA,MACF;AAAA,IACF;AACA,IAAA,IAAI,mBAAA,CAAoB,OAAO,CAAA,EAAG;AAChC,MAAA,MAAM,KAAA,GAAQ,CAAC,GAAG,mBAAmB,CAAA,CAAE,MAAM,CAAA,EAAG,EAAE,CAAA,CAAE,IAAA,CAAK,IAAI,CAAA;AAC7D,MAAA,QAAA,CAAS,IAAA,CAAK,sDAAA,GAAyD,mBAAA,CAAoB,IAAA,GAAO,WAAA,GAAc,SAAS,mBAAA,CAAoB,IAAA,GAAO,EAAA,GAAK,OAAA,GAAU,EAAA,CAAG,CAAA;AAAA,IACxK;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,CAAA,MAAO;AACL,IAAA,QAAA,CAAS,KAAK,kHAA6G,CAAA;AAAA,EAC7H;AAGA,EAAA,GAAA,CAAI,UAAU,qCAAqC,CAAA;AAEnD,EAAA,MAAM,MAAA,GAAS,yBAAyB,QAAQ,CAAA;AAChD,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,+EAAA,CAA4E,CAAA;AAAA,IAChI;AAEA,IAAA,MAAM,EAAE,KAAA,EAAO,OAAA,EAAQ,GAAI,uBAAA,CAAwB,UAAU,MAAM,CAAA;AAEnE,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;AAKA,EAAA;AACE,IAAA,KAAA,MAAW,WAAW,QAAA,EAAU;AAC9B,MAAA,MAAM,WAAW,OAAA,CAAQ,GAAA,IAAO,EAAC,EAAG,KAAK,GAAG,CAAA;AAC5C,MAAA,MAAM,aAAuB,EAAC;AAC9B,MAAA,IAAI,CAAA;AAGJ,MAAA,MAAM,WAAA,GAAc,YAAA;AACpB,MAAA,OAAA,CAAQ,CAAA,GAAI,WAAA,CAAY,IAAA,CAAK,OAAO,OAAO,IAAA,EAAM;AAC/C,QAAA,IAAI,CAAA,CAAE,CAAC,CAAA,CAAE,MAAA,IAAU,KAAK,CAAA,CAAE,CAAC,CAAA,CAAE,MAAA,IAAU,EAAA,EAAI,UAAA,CAAW,IAAA,CAAK,CAAA,CAAE,CAAC,CAAC,CAAA;AAAA,MACjE;AAEA,MAAA,MAAM,YAAA,GAAe,4BAAA;AACrB,MAAA,OAAA,CAAQ,CAAA,GAAI,YAAA,CAAa,IAAA,CAAK,OAAO,CAAA,MAAO,MAAM,UAAA,CAAW,IAAA,CAAK,CAAA,CAAE,CAAC,CAAC,CAAA;AAEtE,MAAA,MAAM,KAAA,GAAQ,eAAA;AACd,MAAA,OAAA,CAAQ,CAAA,GAAI,KAAA,CAAM,IAAA,CAAK,OAAO,OAAO,IAAA,EAAM,UAAA,CAAW,IAAA,CAAK,CAAA,CAAE,CAAC,CAAA,CAAE,OAAA,CAAQ,GAAA,EAAK,EAAE,CAAC,CAAA;AAEhF,MAAA,MAAM,UAAA,GAAa,4BAAA;AACnB,MAAA,OAAA,CAAQ,CAAA,GAAI,UAAA,CAAW,IAAA,CAAK,OAAO,CAAA,MAAO,MAAM,UAAA,CAAW,IAAA,CAAK,CAAA,CAAE,CAAC,CAAC,CAAA;AAEpE,MAAA,MAAM,OAAA,GAAU,2BAAA;AAChB,MAAA,OAAA,CAAQ,CAAA,GAAI,OAAA,CAAQ,IAAA,CAAK,OAAO,CAAA,MAAO,MAAM,UAAA,CAAW,IAAA,CAAK,CAAA,CAAE,CAAC,CAAC,CAAA;AAEjE,MAAA,MAAM,QAAA,GAAW,IAAI,GAAA,CAAA,CAAK,OAAA,CAAQ,QAAA,IAAY,EAAC,EAAG,GAAA,CAAI,CAAC,CAAA,KAAM,CAAA,CAAE,WAAA,EAAa,CAAC,CAAA;AAC7E,MAAA,MAAM,SAAA,GAAY,CAAC,GAAG,IAAI,IAAI,UAAU,CAAC,EACtC,MAAA,CAAO,CAAC,MAAM,CAAC,QAAA,CAAS,IAAI,CAAA,CAAE,WAAA,EAAa,CAAC,CAAA,CAC5C,KAAA,CAAM,CAAA,EAAG,CAAC,CAAA;AACb,MAAA,IAAI,SAAA,CAAU,SAAS,CAAA,EAAG;AACxB,QAAA,OAAA,CAAQ,QAAA,GAAW,CAAC,GAAI,OAAA,CAAQ,YAAY,EAAC,EAAI,GAAG,SAAS,CAAA;AAC7D,QAAA,QAAA,CAAS,KAAK,UAAA,GAAa,OAAA,CAAQ,KAAK,2BAAA,GAA8B,SAAA,CAAU,SAAS,qBAAqB,CAAA;AAAA,MAChH;AAAA,IACF;AACA,IAAA,GAAA,CAAI,WAAW,iCAAiC,CAAA;AAAA,EAClD;AAGA,EAAA;AACE,IAAA,KAAA,MAAW,WAAW,QAAA,EAAU;AAC9B,MAAA,MAAM,QAAA,GAAA,CAAY,OAAA,CAAQ,GAAA,IAAO,EAAC,EAAG,MAAA;AACrC,MAAA,MAAM,OAAA,GAAA,CAAW,OAAA,CAAQ,aAAA,IAAiB,EAAC,EAAG,MAAA;AAC9C,MAAA,MAAM,WAAA,GAAA,CAAe,OAAA,CAAQ,aAAA,IAAiB,EAAC,EAAG,MAAA;AAClD,MAAA,MAAM,YAAA,GAAA,CAAgB,OAAA,CAAQ,aAAA,IAAiB,EAAC,EAAG,IAAA;AAAA,QAAK,CAAC,EAAA,KACvD,CAAC,SAAA,EAAW,UAAA,EAAY,QAAQ,CAAA,CAAE,QAAA,CAAS,EAAA,CAAG,WAAA,IAAe,EAAE;AAAA,OACjE;AAEA,MAAA,MAAM,UAAA,GAAa,uBAAA,CAAwB,QAAA,EAAU,OAAA,EAAS,aAAa,YAAY,CAAA;AACvF,MAAA,MAAM,WAAA,GAAc,QAAQ,iBAAA,IAAqB,uBAAA;AAMjD,MAAA,IAAI,KAAK,GAAA,CAAI,UAAA,GAAa,WAAW,CAAA,GAAI,cAAc,0BAAA,EAA4B;AACjF,QAAA,OAAA,CAAQ,iBAAA,GAAoB,UAAA;AAC5B,QAAA,QAAA,CAAS,IAAA,CAAK,aAAa,OAAA,CAAQ,EAAA,GAAK,0BAA0B,WAAA,GAAc,WAAA,GAAS,aAAa,GAAG,CAAA;AAAA,MAC3G;AAAA,IACF;AACA,IAAA,GAAA,CAAI,WAAW,6BAA6B,CAAA;AAAA,EAC9C;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,MAAM,QAAA,GAA2B;AAAA,IAC/B,cAAA,EAAgB,CAAA;AAAA,IAChB,IAAA,EAAM,iBAAA;AAAA,IACN,SAAS,MAAA,CAAO,OAAA;AAAA,IAChB,QAAA;AAAA,IACA,UAAA;AAAA,IACA,aAAA,EAAe;AAAA,GACjB;AAGA,EAAA,GAAA,CAAI,UAAU,kEAAkE,CAAA;AAChF,EAAA,MAAM,EAAE,aAAA,EAAe,MAAA,EAAO,GAAI,oBAAA,CAAqB,UAAU,cAAc,CAAA;AAC/E,EAAA,QAAA,CAAS,IAAA,CAAK,GAAG,MAAA,CAAO,QAAQ,CAAA;AAEhC,EAAA,OAAO;AAAA,IACL,cAAA,EAAgB,aAAA;AAAA,IAChB,QAAA;AAAA,IACA,kBAAA,EAAoB,MAAA;AAAA,IACpB,YAAY,MAAA,CAAO;AAAA,GACrB;AACF;;;ACvgBA,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,qBAAA,EAAuB;AAAA,OACzB;AAAA,MACA,QAAA;AAAA,MACA,YAAY;AAAC,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;AAAA;AAAA;AAAA;AAAA,MAKvB,uBAAuB,mBAAA,GAAsB;AAAA,KAC/C;AAAA,IACA,QAAA;AAAA,IACA,YAAY,MAAA,CAAO;AAAA,GACrB;AACF;AAUO,SAAS,eACd,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,YAAA,uBAAmB,GAAA,EAAY;AACrC,EAAA,MAAM,YAAA,uBAAmB,GAAA,EAAoB;AAC7C,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,SAAA,GAAY,MAAA,CAAO,EAAA,CAAG,MAAA,IAAU,KAAK,CAAA;AAC3C,MAAA,MAAM,MAAA,GAAwC,SAAA,KAAc,UAAA,IAAc,SAAA,KAAc,YAAY,SAAA,GAAY,KAAA;AAChH,MAAA,IAAI,WAAW,SAAA,EAAW;AAGxB,QAAA,IAAI,aAAA,CAAc,GAAA,CAAI,GAAG,CAAA,EAAG;AAC1B,UAAA,MAAA,CAAO,IAAA,CAAK,QAAA,GAAW,EAAA,GAAK,eAAA,GAAkB,GAAA,GAAM,0CAA0C,aAAA,CAAc,GAAA,CAAI,GAAG,CAAA,GAAI,0CAA0C,CAAA;AACjK,UAAA;AAAA,QACF;AACA,QAAA,IAAI,YAAA,CAAa,GAAA,CAAI,GAAG,CAAA,EAAG;AACzB,UAAA,MAAA,CAAO,IAAA,CAAK,QAAA,GAAW,EAAA,GAAK,yBAAA,GAA4B,GAAG,CAAA;AAC3D,UAAA;AAAA,QACF;AACA,QAAA,YAAA,CAAa,IAAI,GAAG,CAAA;AACpB,QAAA,YAAA,CAAa,GAAA,CAAI,KAAK,KAAK,CAAA;AAC3B,QAAA,aAAA,CAAc,IAAA,CAAK,EAAE,UAAA,EAAY,GAAA,EAAK,MAAA,EAAQ,IAAA,EAAM,MAAA,CAAO,EAAA,CAAG,IAAA,IAAQ,EAAE,CAAA,EAAG,CAAA;AAC3E,QAAA;AAAA,MACF;AACA,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,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;AASA,IAAA,KAAA,MAAW,SAAS,aAAA,EAAe;AACjC,MAAA,MAAM,MAAM,KAAA,CAAM,UAAA;AAClB,MAAA,IAAI,KAAA,CAAM,WAAW,UAAA,EAAY;AACjC,MAAA,MAAM,UAAA,GAAa,aAAA,CAAc,GAAA,CAAI,GAAG,CAAA;AACxC,MAAA,IAAI,UAAA,KAAe,MAAA,IAAa,UAAA,KAAe,KAAA,EAAO;AACtD,MAAA,KAAA,MAAW,OAAO,QAAA,CAAS,GAAA,CAAI,GAAG,CAAA,IAAK,EAAC,EAAG;AAIzC,QAAA,MAAM,YAAA,GAAe,YAAA,CAAa,GAAA,CAAI,GAAG,CAAA;AACzC,QAAA,MAAM,UAAU,aAAA,CAAc,GAAA,CAAI,GAAG,CAAA,IAAM,YAAA,KAAiB,UAAa,YAAA,GAAe,KAAA;AACxF,QAAA,IAAI,CAAC,OAAA,EAAS;AACZ,UAAA,MAAA,CAAO,KAAK,QAAA,GAAW,EAAA,GAAK,eAAe,GAAA,GAAM,sCAAA,GAAyC,MAAM,qFAAqF,CAAA;AAAA,QACvL;AAAA,MACF;AAAA,IACF;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,MAAM,IAAA,GAAO,YAAA,CAAa,GAAA,CAAI,GAAG,CAAA;AACjC,IAAA,IAAI,KAAA,KAAU,MAAA,IAAa,IAAA,KAAS,MAAA,EAAW;AAC7C,MAAA,MAAA,CAAO,IAAA,CAAK,UAAA,GAAa,GAAA,GAAM,0BAAA,GAA6B,gBAAgB,oCAAoC,CAAA;AAAA,IAClH,CAAA,MAAA,IAAW,UAAU,MAAA,IAAa,KAAA,GAAQ,kBAAkB,IAAA,KAAS,MAAA,IAAa,OAAO,aAAA,CAAA,EAAgB;AACvG,MAAA,MAAA,CAAO,KAAK,UAAA,GAAa,GAAA,GAAM,0BAA0B,KAAA,GAAQ,+BAAA,GAAkC,gBAAgB,oGAAoG,CAAA;AAAA,IACzN;AAAA,EACF;AACA,EAAA,KAAA,MAAW,CAAC,GAAA,EAAK,MAAM,CAAA,IAAK,YAAA,EAAc;AACxC,IAAA,MAAM,MAAA,GAAS,aAAA,CAAc,GAAA,CAAI,GAAG,CAAA;AACpC,IAAA,IAAI,MAAA,KAAW,MAAA,IAAa,MAAA,IAAU,MAAA,EAAQ;AAC5C,MAAA,MAAA,CAAO,KAAK,UAAA,GAAa,GAAA,GAAM,yBAAyB,MAAA,GAAS,iCAAA,GAAoC,SAAS,iDAAiD,CAAA;AAAA,IACjK;AACA,IAAA,IAAI,WAAW,MAAA,EAAW;AAIxB,MAAA,MAAA,CAAO,IAAA,CAAK,UAAA,GAAa,GAAA,GAAM,yBAAA,GAA4B,SAAS,6FAA6F,CAAA;AAAA,IACnK;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,+4DAAA;AA2BF,EAAA,MAAM,mBAAA,GAAsB,SAAS,MAAA,CAAO,CAAC,GAAG,CAAA,KAC9C,CAAA,GAAA,CAAK,CAAA,CAAE,KAAA,IAAS,EAAC,EAAG,OAAO,CAAC,EAAA,EAAI,OAAO,EAAA,IAAM,EAAA,CAAG,QAAQ,iBAAA,IAAqB,EAAA,CAAA,EAAK,CAAC,CAAA,EAAG,CAAC,CAAA;AACzF,EAAA,MAAM,mBAAA,GAAsB,QAAA,CAAS,MAAA,CAAO,CAAC,CAAA,EAAG,MAAM,CAAA,IAAK,CAAA,CAAE,iBAAA,IAAqB,EAAA,CAAA,EAAK,CAAC,CAAA;AACxF,EAAA,MAAM,eAAe,mBAAA,GAAsB,mBAAA;AAC3C,EAAA,MAAM,gBAAA,GAAmB,KAAK,GAAA,CAAI,CAAA,EAAG,KAAK,KAAA,CAAM,YAAA,GAAe,GAAG,CAAC,CAAA;AAEnE,EAAA,MAAM,cAAA,GAAiB,aAAA,GAAgB,WAAA,GAAc,iBAAA,GAAoB,cACrE,8BAAA,GAAiC,QAAA,GAAW,sBAAA,GACvB,YAAA,GAAe,KAAA,GAAQ,mBAAA,GAAsB,eAAA,GAAkB,mBAAA,GAAsB,2BAC5F,gBAAA,GAAmB,wMAAA;AAKrC,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-GVBDM746.mjs","sourcesContent":["/**\n * STEP C0: Extract FOUNDATION & SETUP feature (F0) via LLM.\n *\n * Ported from knowledge-tree/llm_project_graph.py extract_scaffold_llm()\n * The F0 feature covers MUST-KNOW steps before the first feature:\n * tools, project creation, minimal programming knowledge, repo map, dev loop.\n */\n\nimport { createLlmClient, llmChatJson, type LlmClientConfig, type LlmClient } from '../utils/llmClient';\nimport type { Feature } from '../schemas/projectGraphSchema';\n\nexport interface ExtractScaffoldOptions {\n  goal: string;\n  techStack: string;\n  fileList: string[];\n  llmConfig?: LlmClientConfig;\n  /** Pre-built client from the calling pipeline — reused so every step of one run\n   *  lands in ONE callLog and the feed can report real provenance. */\n  sharedClient?: LlmClient;\n}\n\n/**\n * Extract the FOUNDATION & SETUP feature (F0) via LLM.\n * Returns a Feature with steps covering tool setup, project creation,\n * minimal programming knowledge, repo map, and dev loop.\n */\nexport async function extractScaffold(options: ExtractScaffoldOptions): Promise<Feature | null> {\n  const { goal, techStack, fileList, llmConfig, sharedClient } = options;\n  const client = sharedClient ?? createLlmClient(llmConfig);\n  const fileListStr = fileList.length > 0 ? fileList.join('\\n') : '(empty)';\n\n  const systemPrompt = (\n    'You are a programming pedagogy expert. For ONE concrete project, extract the '\n    + \"'FOUNDATION & SETUP' feature (id F0) — the COMPLETE set of 'MUST-KNOW' steps \"\n    + 'the learner needs before studying the first feature. Break it into concrete ACTION '\n    + 'steps (5-8 steps), each with completion_level=\\'base\\'. Include:\\n'\n    + '1. Tools required for this tech stack (IDE, simulator/emulator, terminal, git, '\n    + 'package manager) + basic operations (open project, build, run, debug, commit).\\n'\n    + '2. Create the initial project: from a template OR clone/open the base-project (the provided repo).\\n'\n    + '3. MINIMAL programming knowledge of the language (variables, types, functions, if/for, view declaration) '\n    + '+ build one small demo (e.g. a single-screen Hello World app) BEFORE touching the real project.\\n'\n    + '4. Repo map of the actual project: folder structure, entry point, how to build/run, main architecture '\n    + '(MVVM/Flux...), important packages/modules.\\n'\n    + '5. Development loop (build->run->see result->debug), how to read/fix basic compile errors, '\n    + 'minimal git workflow (clone/branch/commit/push).\\n'\n    + 'keywords[]: real tool/language terms (e.g. \\'Xcode\\', \\'Simulator\\', \\'Git\\', \\'Swift\\', '\n    + '\\'@main\\', \\'MVVM\\'). files[]: leave [] or use real paths if the step touches specific files. '\n    + 'description: ONE concise sentence, MAX 140 characters. '\n    + 'intent: WHY this step matters. outcome: {user_visible: string, technical: string}. '\n    + 'acceptance[]: 2 verifiable criteria. effort: {estimated_minutes: number, complexity: low|medium|high}. '\n    + 'NEVER invent. ALL text must be in ENGLISH (technical terms stay as-is). '\n    + 'Return JSON containing only feature F0.'\n  );\n\n  const userPrompt = (\n    `App goal: ${goal}\\n`\n    + `Tech stack: ${techStack}\\n\\n`\n    + 'PROJECT FILE LIST (base-project):\\n'\n    + `${fileListStr}\\n\\n`\n    + 'Return JSON:\\n'\n    + '{\\n'\n    + '  \"feature\": {\\n'\n    + '    \"id\": \"F0\",\\n'\n    + '    \"name\": \"FOUNDATION & SETUP\",\\n'\n    + '    \"description\": \"Get familiar with the tools, create/clone the project, learn minimal knowledge and the repo map\",\\n'\n    + '    \"platform\": \"app\",\\n'\n    + '    \"steps\": [\\n'\n    + '      {\\n'\n    + '        \"id\": \"F0-S1\",\\n'\n    + '        \"sequence\": 1,\\n'\n    + '        \"name\": \"Action step name\",\\n'\n    + '        \"description\": \"Detailed description of the concrete actions\",\\n'\n    + '        \"files\": [],\\n'\n    + '        \"api_usage\": [],\\n'\n    + '        \"keywords\": [\"Xcode\", \"Terminal\"],\\n'\n    + '        \"completion_level\": \"base\",\\n'\n    + '        \"intent\": \"Learn how to setup the IDE and run a minimal Swift app\",\\n'\n    + '        \"outcome\": {\"user_visible\": \"App builds and runs\", \"technical\": \"Toolchain verified\"},\\n'\n    + '        \"acceptance\": [\"Xcode builds without errors\", \"Simulator launches successfully\"],\\n'\n    + '        \"effort\": {\"estimated_minutes\": 20, \"complexity\": \"low\"}\\n'\n    + '      }\\n'\n    + '    ]\\n'\n    + '  }\\n'\n    + '}\\n'\n  );\n\n  try {\n    const result = await llmChatJson(client, systemPrompt, userPrompt, {\n      temperature: 0.1,\n      maxTokens: parseInt(process.env.PG_C0_MAX_TOKENS || '16384', 10),\n    });\n\n    const feat = result.feature as Record<string, unknown> | undefined;\n    if (!feat || !Array.isArray(feat.steps) || feat.steps.length === 0) {\n      console.warn('[WARN] Scaffold LLM returned no steps — skipping F0');\n      return null;\n    }\n\n    // Normalize step IDs and ensure required fields\n    const steps = (feat.steps as Record<string, unknown>[]).map((s, i) => ({\n      id: `F0-S${i + 1}`,\n      sequence: i + 1,\n      name: String(s.name || `Step ${i + 1}`),\n      description: String(s.description || ''),\n      files: Array.isArray(s.files) ? s.files : [],\n      api_usage: Array.isArray(s.api_usage) ? s.api_usage : [],\n      keywords: Array.isArray(s.keywords) ? s.keywords : [],\n      completion_level: 'base' as const,\n      platform: String(s.platform || 'app'),\n      intent: String(s.intent || ''),\n      outcome: s.outcome && typeof s.outcome === 'object' ? s.outcome as { user_visible?: string; technical?: string } : undefined,\n      acceptance: Array.isArray(s.acceptance) ? s.acceptance : [],\n      effort: s.effort && typeof s.effort === 'object' ? s.effort as { estimated_minutes?: number; complexity?: 'low' | 'medium' | 'high' } : undefined,\n      requirement_ids: [] as string[],\n      concept_codes: [] as string[],\n    }));\n\n    return {\n      id: 'F0',\n      name: String(feat.name || 'FOUNDATION & SETUP'),\n      description: String(feat.description || ''),\n      platform: String(feat.platform || 'app'),\n      steps,\n    } as Feature;\n  } catch (err) {\n    console.error(`[ERROR] extractScaffold failed: ${err}`);\n    return null;\n  }\n}\n","/**\n * STEP C1: Extract PROJECT OVERVIEW via LLM (features meta — NO steps).\n *\n * Ported from knowledge-tree/llm_project_graph.py extract_project_overview_llm()\n * Output: project, product, features[], user_journeys, architecture, decomposition.\n */\n\nimport { createLlmClient, llmChatJson, type LlmClientConfig, type LlmClient } from '../utils/llmClient';\nimport type { Keyword } from '../extractors/keywordExtractor';\n\nexport interface ExtractOverviewOptions {\n  goal: string;\n  techStack: string;\n  sdkApiIndex: { sdk_apis: Array<{ name: string; kind: string; used_in_demo: boolean }> };\n  fileContentsMap: Map<string, string>;\n  astKeywords?: Keyword[];\n  llmConfig?: LlmClientConfig;\n  /** Pre-built client from the calling pipeline — reused so every step of one run\n   *  lands in ONE callLog and the feed can report real provenance. */\n  sharedClient?: LlmClient;\n}\n\nfunction buildSourceText(fileContentsMap: Map<string, string>): string {\n  const blocks: string[] = [];\n  for (const [relPath, content] of fileContentsMap) {\n    blocks.push(`### FILE: ${relPath}\\n${content}`);\n  }\n  return blocks.join('\\n\\n');\n}\n\n/**\n * Extract project overview (features meta) via LLM.\n * Does NOT include steps — those are extracted per-feature in STEP C2.\n */\nexport async function extractProjectOverview(options: ExtractOverviewOptions): Promise<Record<string, unknown>> {\n  const { goal, techStack, sdkApiIndex, fileContentsMap, astKeywords, llmConfig, sharedClient } = options;\n  const client = sharedClient ?? createLlmClient(llmConfig);\n\n  const usedSdkApis = sdkApiIndex.sdk_apis\n    .filter(api => api.used_in_demo)\n    .map(api => api.name)\n    .slice(0, 2000);\n\n  const allFilesStr = buildSourceText(fileContentsMap);\n\n  // Build static-scan keywords anchor\n  let keywordsAnchor = '';\n  if (astKeywords && astKeywords.length > 0) {\n    const kwItems = astKeywords.slice(0, 30).map(kw =>\n      `- ${kw.keyword} (from ${kw.source})`,\n    );\n    if (kwItems.length > 0) {\n      keywordsAnchor = (\n        '\\nDomain Keywords & Patterns (from regex-based static scan — use as context anchor):\\n'\n        + kwItems.join('\\n')\n        + '\\n'\n      );\n    }\n  }\n\n  const systemPrompt = (\n    'You are a software architect. The app the user will build IS EXACTLY the provided files '\n    + '(not an SDK/lib). Analyze them and return a PROJECT OVERVIEW — meta only, '\n    + 'DO NOT list steps (steps are handled in a later step). '\n    + 'NEVER invent files/APIs. NEVER reference internal SDK/lib unless it appears in the given files.\\n'\n    + 'END-USER VIEW (M1/Design Thinking): product.purpose must describe the USER PROBLEM '\n    + '(what the user does with the app, which need it solves). NEVER describe repo/artifacts.\\n'\n    + 'DEVELOPMENT STAGES: Include 4-6 development stages in product.development_stages. '\n    + 'Each stage must have: stage (name), need (list of feature needs), learn (concepts learned), '\n    + 'product_state (what works), temporary_approach, and validation.\\n'\n    + 'MISSING GAPS: Identify 0-5 missing_gaps (features/functionality that should exist but don\\'t).\\n'\n    + 'TECH DEBT: Identify 0-5 tech_debt issues (code quality problems).\\n'\n    + 'ALL text must be in ENGLISH.'\n  );\n\n  const userPrompt = `App goal: ${goal}\nTech stack: ${techStack}\n${keywordsAnchor}\nFiltered SDK API list (used_in_demo):\n${JSON.stringify(usedSdkApis, null, 0)}\n\nSource code of the files:\n${allFilesStr}\n\nReturn JSON per the schema:\n{\n  \"schema_version\": 2,\n  \"project\": {\"name\": \"...\", \"project_type\": \"app\", \"platforms\": [\"ios\"]},\n  \"product\": {\n    \"purpose\": \"END-USER problem being solved\",\n    \"problem_statement\": \"Core user problem\",\n    \"primary_users\": [\"who the main users are\"],\n    \"development_stages\": [\n      {\n        \"stage\": \"Stage 1: Foundation & Setup\",\n        \"need\": [\"Core app shell\"],\n        \"learn\": [\"App lifecycle, basic UI\"],\n        \"product_state\": \"App launches with static mock data\",\n        \"temporary_approach\": \"Hardcoded array\",\n        \"validation\": \"Main screen loads\"\n      }\n    ],\n    \"features\": [\n      {\"id\": \"F1\", \"name\": \"Feature name\", \"description\": \"Feature description\", \"platform\": \"ios\"}\n    ],\n    \"user_journeys\": [{\"name\": \"...\", \"feature_ids\": [\"F1\"]}]\n  },\n  \"architecture\": {\"layers\": [], \"services\": [], \"state_management\": \"...\"},\n  \"decomposition\": {\"milestones\": [{\"id\": \"M1\", \"phase\": \"MVP\", \"name\": \"...\", \"goal\": \"...\", \"feature_ids\": [\"F1\"]}]}\n}`;\n\n  const result = await llmChatJson(client, systemPrompt, userPrompt, {\n    temperature: 0.1,\n    maxTokens: parseInt(process.env.PG_C1_MAX_TOKENS || '32768', 10),\n  });\n\n  // Ensure development_stages exists\n  const prod = result.product as Record<string, unknown> | undefined;\n  if (prod && !Array.isArray(prod.development_stages)) {\n    prod.development_stages = [];\n  }\n\n  return result;\n}\n","/**\n * STEP C2: Extract feature STEPS via LLM.\n *\n * Ported from knowledge-tree/llm_project_graph.py\n *   - extract_feature_steps_llm() — single feature\n *   - extract_feature_steps_batched() — batch of features\n */\n\nimport { createLlmClient, llmChatJson, type LlmClientConfig, type LlmClient } from '../utils/llmClient';\nimport type { Feature, Step } from '../schemas/projectGraphSchema';\n\nexport interface ExtractStepsOptions {\n  goal: string;\n  techStack: string;\n  sdkApiIndex: { sdk_apis: Array<{ name: string; kind: string; used_in_demo: boolean }> };\n  fileContentsMap: Map<string, string>;\n  feature: Feature;\n  llmConfig?: LlmClientConfig;\n  /** Pre-built client from the calling pipeline — reused so every step of one run\n   *  lands in ONE callLog and the feed can report real provenance. */\n  sharedClient?: LlmClient;\n}\n\nfunction buildSourceText(fileContentsMap: Map<string, string>): string {\n  const blocks: string[] = [];\n  for (const [relPath, content] of fileContentsMap) {\n    blocks.push(`### FILE: ${relPath}\\n${content}`);\n  }\n  return blocks.join('\\n\\n');\n}\n\n/**\n * Extract steps for a SINGLE feature via LLM.\n */\nexport async function extractFeatureSteps(options: ExtractStepsOptions): Promise<Step[]> {\n  const { goal, techStack, sdkApiIndex, fileContentsMap, feature, llmConfig, sharedClient } = options;\n  const client = sharedClient ?? createLlmClient(llmConfig);\n\n  const usedSdkApis = sdkApiIndex.sdk_apis\n    .filter(api => api.used_in_demo)\n    .map(api => api.name)\n    .slice(0, 2000);\n\n  const allFilesStr = buildSourceText(fileContentsMap);\n  const fid = feature.id || 'F_UNK';\n  const fname = feature.name || fid;\n  const fdesc = feature.description || '';\n\n  const systemPrompt = (\n    'You are a software architect. Split ONE feature into ACTION steps '\n    + '(implementation steps) the learner must code sequentially. Each step must carry '\n    + 'files[] (CORRECT paths in the source), api_usage[] (only from the provided SDK API index), '\n    + 'keywords[] (real terms/language features in the files), '\n    + 'and completion_level ∈ {base, mvp, extend, polish}.\\n'\n    + '  - base = foundation/setup\\n'\n    + '  - mvp = make the app minimally WORKING for this feature\\n'\n    + '  - extend = make it real/richer\\n'\n    + '  - polish = robustness (error handling, tests, validation)\\n'\n    + 'Include metadata: intent, outcome ({user_visible, technical}), '\n    + 'acceptance[] (2 verifiable criteria), effort ({estimated_minutes, complexity}).\\n'\n    + 'description: ONE concise sentence, MAX 140 characters. '\n    + 'NEVER invent files/APIs. Return ONLY the steps array. '\n    + 'ALL text must be in ENGLISH.'\n  );\n\n  const userPrompt = `App goal: ${goal}\nTech stack: ${techStack}\n\nFEATURE TO SPLIT: ${fid} — ${fname}\nFeature description: ${fdesc}\n\nSDK API list (used_in_demo):\n${JSON.stringify(usedSdkApis)}\n\nSource code:\n${allFilesStr}\n\nSplit this feature into 2-6 action steps. Return JSON:\n{\n  \"steps\": [\n    {\n      \"id\": \"${fid}-S1\",\n      \"sequence\": 1,\n      \"name\": \"Action step name\",\n      \"description\": \"One concise sentence (max 140 chars)\",\n      \"files\": [\"path/to/file.swift\"],\n      \"api_usage\": [\"ChatClient\"],\n      \"keywords\": [\"@State\", \"NavigationStack\"],\n      \"completion_level\": \"mvp\",\n      \"intent\": \"Create reactive state container\",\n      \"outcome\": {\"user_visible\": \"Chat view updates\", \"technical\": \"ChatViewModel conforms to ObservableObject\"},\n      \"acceptance\": [\"ViewModel publishes messages\", \"UI re-renders on state mutation\"],\n      \"effort\": {\"estimated_minutes\": 30, \"complexity\": \"medium\"}\n    }\n  ]\n}`;\n\n  const result = await llmChatJson(client, systemPrompt, userPrompt, {\n    temperature: 0.1,\n    maxTokens: parseInt(process.env.PG_C2_MAX_TOKENS || '32768', 10),\n  });\n\n  const rawSteps = (result.steps || []) as Record<string, unknown>[];\n  // Clamp to 2-6 steps per prompt contract\n  const clampedSteps = rawSteps.length > 6 ? rawSteps.slice(0, 6) : rawSteps.length < 2 && rawSteps.length > 0 ? rawSteps : rawSteps;\n  if (rawSteps.length > 6) {\n    console.warn(`[WARN] LLM returned ${rawSteps.length} steps for ${fid}, clamped to 6`);\n  } else if (rawSteps.length === 0) {\n    console.warn(`[WARN] LLM returned 0 steps for ${fid}`);\n  }\n  return clampedSteps.map((s, i) => ({\n    id: `${fid}-S${i + 1}`,\n    sequence: i + 1,\n    name: String(s.name || `Step ${i + 1}`),\n    description: String(s.description || ''),\n    files: Array.isArray(s.files) ? s.files as string[] : [],\n    api_usage: Array.isArray(s.api_usage) ? s.api_usage as string[] : [],\n    keywords: Array.isArray(s.keywords) ? s.keywords as string[] : [],\n    completion_level: (String(s.completion_level || 'mvp') as 'base' | 'mvp' | 'extend' | 'polish'),\n    platform: String(s.platform || feature.platform || 'app'),\n    intent: String(s.intent || ''),\n    outcome: s.outcome as Step['outcome'],\n    acceptance: Array.isArray(s.acceptance) ? s.acceptance as string[] : [],\n    effort: s.effort as Step['effort'],\n    requirement_ids: [],\n    concept_codes: [],\n  }));\n}\n\n/**\n * Extract steps for MULTIPLE features in a single LLM call.\n */\nexport async function extractFeatureStepsBatched(\n  goal: string,\n  techStack: string,\n  sdkApiIndex: { sdk_apis: Array<{ name: string; kind: string; used_in_demo: boolean }> },\n  fileContentsMap: Map<string, string>,\n  featuresMeta: Feature[],\n  llmConfig?: LlmClientConfig,\n  sharedClient?: LlmClient,\n): Promise<Map<string, Step[]>> {\n  const client = sharedClient ?? createLlmClient(llmConfig);\n\n  const usedSdkApis = sdkApiIndex.sdk_apis\n    .filter(api => api.used_in_demo)\n    .map(api => api.name)\n    .slice(0, 2000);\n\n  const sourceText = buildSourceText(fileContentsMap);\n\n  const featuresListing = featuresMeta.map(f =>\n    `- ${f.id || 'F?'}: ${f.name || ''} — ${f.description || ''}`,\n  ).join('\\n');\n\n  const systemPrompt = (\n    'You are a software architect. Split MULTIPLE features into ACTION steps. '\n    + 'Each step must carry files[], api_usage[], keywords[], and '\n    + 'completion_level ∈ {base, mvp, extend, polish}. '\n    + 'Include metadata: intent, outcome ({user_visible, technical}), '\n    + 'acceptance[] (2 verifiable criteria), effort ({estimated_minutes, complexity}). '\n    + 'description: ONE concise sentence, MAX 140 characters. '\n    + 'NEVER invent files/APIs. Return ONLY the JSON. '\n    + 'ALL text must be in ENGLISH.'\n  );\n\n  const userPrompt = `App goal: ${goal}\nTech stack: ${techStack}\n\nSDK API list (used_in_demo):\n${JSON.stringify(usedSdkApis)}\n\nSource code:\n${sourceText}\n\nFEATURES to split into steps:\n${featuresListing}\n\nFor EACH feature above, produce 4-6 action steps. Each step must include:\nid, sequence, name, description, files, api_usage, keywords, completion_level, platform,\nintent, outcome ({user_visible, technical}), acceptance[] (2 criteria), effort ({estimated_minutes, complexity}).\n\nReturn JSON with a \"steps\" dict keyed by feature_id:\n{\n  \"steps\": {\n    \"<feature_id>\": [\n      {\n        \"id\": \"<feature_id>-S1\",\n        \"sequence\": 1,\n        \"name\": \"Step name\",\n        \"description\": \"Concise sentence (max 140 chars)\",\n        \"files\": [\"path/to/file\"],\n        \"api_usage\": [\"APIName\"],\n        \"keywords\": [\"keyword\"],\n        \"completion_level\": \"mvp\",\n        \"platform\": \"app\",\n        \"intent\": \"Step intent\",\n        \"outcome\": {\"user_visible\": \"User visible result\", \"technical\": \"Technical result\"},\n        \"acceptance\": [\"Criterion 1\", \"Criterion 2\"],\n        \"effort\": {\"estimated_minutes\": 30, \"complexity\": \"medium\"}\n      }\n    ]\n  }\n}`;\n\n  const result = await llmChatJson(client, systemPrompt, userPrompt, {\n    temperature: 0.1,\n    maxTokens: parseInt(process.env.PG_C2_MAX_TOKENS || '32768', 10),\n  });\n\n  const stepsDict = result.steps as Record<string, Record<string, unknown>[]> | undefined;\n  const output = new Map<string, Step[]>();\n\n  if (stepsDict && typeof stepsDict === 'object') {\n    for (const [fid, rawSteps] of Object.entries(stepsDict)) {\n      if (!Array.isArray(rawSteps)) continue;\n      const featMeta = featuresMeta.find(f => f.id === fid);\n      const steps = rawSteps.map((s, i) => ({\n        id: `${fid}-S${i + 1}`,\n        sequence: i + 1,\n        name: String(s.name || `Step ${i + 1}`),\n        description: String(s.description || ''),\n        files: Array.isArray(s.files) ? s.files as string[] : [],\n        api_usage: Array.isArray(s.api_usage) ? s.api_usage as string[] : [],\n        keywords: Array.isArray(s.keywords) ? s.keywords as string[] : [],\n        completion_level: (String(s.completion_level || 'mvp') as 'base' | 'mvp' | 'extend' | 'polish'),\n        platform: String(s.platform || featMeta?.platform || 'app'),\n        intent: String(s.intent || ''),\n        outcome: s.outcome as Step['outcome'],\n        acceptance: Array.isArray(s.acceptance) ? s.acceptance as string[] : [],\n        effort: s.effort as Step['effort'],\n    requirement_ids: [],\n    concept_codes: [],\n      }));\n      output.set(fid, steps);\n    }\n  }\n\n  return output;\n}\n","/**\n * STEP D: Ground-truth verification of project graph against code and SDK API index.\n *\n * Ported from knowledge-tree/llm_project_graph.py verify_project_graph()\n * Removes invalid files, APIs, keywords and logs hallucinations.\n */\n\nimport type { ProjectGraph, Feature, Step } from '../schemas/projectGraphSchema';\n\nexport interface Hallucination {\n  type: string;\n  item: string;\n  feature_id: string;\n  step_id: string;\n  reason: string;\n}\n\nexport interface VerifyOptions {\n  repoDir: string;\n  sdkApiIndex: { sdk_apis: Array<{ name: string; kind: string; used_in_demo: boolean }> };\n  fileContentsMap: Map<string, string>;\n}\n\n/**\n * Verify project graph against actual code. Remove hallucinated files, APIs, keywords.\n * F0 (foundation) keywords are kept as-is since they are pedagogical terms.\n */\nexport function verifyProjectGraph(\n  projectGraph: ProjectGraph,\n  options: VerifyOptions,\n): { graph: ProjectGraph; hallucinations: Hallucination[] } {\n  const { sdkApiIndex, fileContentsMap } = options;\n  const sdkApiNames = new Set(sdkApiIndex.sdk_apis.map(api => api.name));\n  const hallucinations: Hallucination[] = [];\n\n  const features = projectGraph.features || [];\n\n  for (const feature of features) {\n    const fid = feature.id || 'F_UNK';\n    const isFoundation = fid === 'F0';\n\n    for (const step of feature.steps || []) {\n      const sid = step.id || `${fid}-SUNK`;\n\n      // Verify files[]\n      const validFiles: string[] = [];\n      for (const f of step.files || []) {\n        if (fileContentsMap.has(f)) {\n          validFiles.push(f);\n        } else {\n          hallucinations.push({\n            type: 'file',\n            item: f,\n            feature_id: fid,\n            step_id: sid,\n            reason: `File '${f}' not found in repository`,\n          });\n        }\n      }\n      step.files = validFiles;\n\n      // Verify api_usage[]\n      const validApis: string[] = [];\n      for (const api of step.api_usage || []) {\n        if (sdkApiNames.size === 0 || sdkApiNames.has(api)) {\n          validApis.push(api);\n        } else {\n          hallucinations.push({\n            type: 'api',\n            item: api,\n            feature_id: fid,\n            step_id: sid,\n            reason: `API '${api}' not found in SDK API index`,\n          });\n        }\n      }\n      step.api_usage = validApis;\n\n      // Verify keywords[] — skip for F0 (foundation keywords are pedagogical)\n      if (isFoundation) continue;\n\n      const validKws: string[] = [];\n      for (const kw of step.keywords || []) {\n        const kwLow = kw.toLowerCase();\n        // Single-word keywords: use word boundary match to avoid\n        // false positives (\"app\" should NOT match \"mapping\" or \"happen\")\n        const isSingleWord = !kwLow.includes(' ');\n        let found = false;\n        // Check in step's files\n        for (const f of validFiles) {\n          const content = (fileContentsMap.get(f) || '').toLowerCase();\n          if (isSingleWord) {\n            found = new RegExp(`\\\\b${kwLow.replace(/[.*+?^${}()|[\\]\\\\]/g, '\\\\$&')}\\\\b`).test(content);\n          } else {\n            found = content.includes(kwLow);\n          }\n          if (found) break;\n        }\n        // Check in any file\n        if (!found) {\n          for (const content of fileContentsMap.values()) {\n            const lc = content.toLowerCase();\n            if (isSingleWord) {\n              found = new RegExp(`\\\\b${kwLow.replace(/[.*+?^${}()|[\\]\\\\]/g, '\\\\$&')}\\\\b`).test(lc);\n            } else {\n              found = lc.includes(kwLow);\n            }\n            if (found) break;\n          }\n        }\n\n        if (found) {\n          validKws.push(kw);\n        } else {\n          hallucinations.push({\n            type: 'keyword',\n            item: kw,\n            feature_id: fid,\n            step_id: sid,\n            reason: `Keyword '${kw}' not found in target files`,\n          });\n        }\n      }\n      step.keywords = validKws;\n    }\n  }\n\n  return { graph: projectGraph, hallucinations };\n}\n","/**\n * STEP E: Escalate keywords/api_usage to neutral concepts + ULO/CIO/SIO depth + evidence files join.\n *\n * Ported from knowledge-tree/llm_project_graph.py escalate_and_map_concepts()\n * Maps concrete keywords to technology-neutral concept codes WITH depth levels.\n *\n * ULO/CIO/SIO model:\n *   - ULO: WHAT + WHY — concept is introduced (what it is, why it exists)\n *   - CIO: HOW — mechanism is explained (how it works)\n *   - SIO: IMPLEMENTATION — concrete tech-specific usage (syntax, API)\n */\n\nimport { createLlmClient, llmChatJson, type LlmClientConfig, type LlmClient } from '../utils/llmClient';\nimport type { ProjectGraph, Feature } from '../schemas/projectGraphSchema';\n\nexport interface ConceptMapping {\n  concept_code: string;\n  concept_name: string;\n  keyword: string;\n  depth: 'ulo' | 'cio' | 'sio';\n  depth_rationale: string;\n  /**\n   * Who decided `depth`. The regex fallback (comment → ulo, import → sio) has no\n   * pedagogical basis — without this marker a degraded run is indistinguishable\n   * from a considered one, because both write the same field.\n   */\n  depth_source: 'llm' | 'heuristic' | 'override';\n  evidence_files: string[];\n}\n\nexport interface EscalateOptions {\n  projectGraph: ProjectGraph;\n  fileContentsMap: Map<string, string>;\n  availableConcepts?: string[];\n  conceptMapOverride?: Record<string, { concept_code: string; concept_name: string; depth?: string }>;\n  llmConfig?: LlmClientConfig;\n  /** Pre-built client from the calling pipeline — reused so every step of one run\n   *  lands in ONE callLog and the feed can report real provenance. */\n  sharedClient?: LlmClient;\n}\n\nfunction toUpperSnake(term: string): string {\n  let s = term.replace(/^[^\\w]+/, '');\n  s = s.replace(/([a-z0-9])([A-Z])/g, '$1_$2');\n  s = s.replace(/[^\\w]+/g, '_');\n  const res = s.toUpperCase().replace(/^_+|_+$/g, '');\n  return res || 'CONCEPT';\n}\n\nfunction extractTermSnippets(term: string, fileContentsMap: Map<string, string>, maxSnippets = 1): string[] {\n  const snippets: string[] = [];\n  const termLow = term.toLowerCase();\n  for (const [relPath, content] of fileContentsMap) {\n    const lines = content.split('\\n');\n    for (let idx = 0; idx < lines.length; idx++) {\n      if (lines[idx].toLowerCase().includes(termLow)) {\n        const start = Math.max(0, idx - 1);\n        const end = Math.min(lines.length, idx + 2);\n        let snippet = lines.slice(start, end).map(l => l.trim()).filter(Boolean).join(' ');\n        if (snippet.length > 120) snippet = snippet.slice(0, 120) + '...';\n        if (snippet) snippets.push(`[${relPath}]: ${snippet}`);\n        if (snippets.length >= maxSnippets) break;\n      }\n    }\n    if (snippets.length >= maxSnippets) break;\n  }\n  return snippets;\n}\n\n/**\n * Determine ULO/CIO/SIO depth based on keyword usage context.\n */\nfunction inferDepthFromContext(\n  keyword: string,\n  fileContentsMap: Map<string, string>,\n): { depth: 'ulo' | 'cio' | 'sio'; rationale: string } {\n  const kw = keyword.toLowerCase();\n\n  // SIO: specific implementation keywords (API names, decorators, syntax)\n  const sioPatterns = [\n    /^@/,              // SwiftUI decorators: @State, @Binding\n    /^import\\s/,       // Import statements\n    /\\(\\)$/,           // Function calls\n    /\\.prototype/,     // Prototype methods\n    /^new\\s/,          // Constructor calls\n    /^async\\s/,        // Async keywords\n    /^await\\s/,\n  ];\n\n  if (sioPatterns.some(p => p.test(keyword))) {\n    return { depth: 'sio', rationale: `Keyword '${keyword}' is a specific API/syntax pattern` };\n  }\n\n  // CIO: mechanism-level keywords (patterns, protocols, design patterns)\n  const cioPatterns = [\n    /pattern/i, /protocol/i, /architecture/i, /lifecycle/i,\n    /observer/i, /singleton/i, /factory/i, /delegate/i,\n    /state\\s*management/i, /data\\s*flow/i, /binding/i,\n    /mvvm/i, /mvc/i, /flux/i, /redux/i,\n    /authentication/i, /authorization/i,\n    /persistence/i, /caching/i, /serialization/i,\n  ];\n\n  if (cioPatterns.some(p => p.test(keyword))) {\n    return { depth: 'cio', rationale: `Keyword '${keyword}' represents a mechanism/pattern` };\n  }\n\n  // ULO: general concept keywords (what/why level)\n  const uloPatterns = [\n    /design\\s*thinking/i, /user\\s*needs/i, /problem\\s*statement/i,\n    /foundation/i, /setup/i, /overview/i, /introduction/i,\n    /scaffold/i, /hello\\s*world/i, /getting\\s*started/i,\n  ];\n\n  if (uloPatterns.some(p => p.test(keyword))) {\n    return { depth: 'ulo', rationale: `Keyword '${keyword}' is a foundational/introductory concept` };\n  }\n\n  // Default: check evidence in code — if it appears in import/declaration → SIO, in comment → ULO\n  for (const content of fileContentsMap.values()) {\n    const lines = content.split('\\n');\n    for (const line of lines) {\n      if (line.toLowerCase().includes(kw)) {\n        if (/^(import|from|require|use |#include)/.test(line.trim())) {\n          return { depth: 'sio', rationale: `Keyword '${keyword}' found in import statement` };\n        }\n        if (/^\\/\\/|^\\/\\*|^#|^-->/.test(line.trim())) {\n          return { depth: 'ulo', rationale: `Keyword '${keyword}' found in comment/doc` };\n        }\n        // Found in code body → likely SIO\n        return { depth: 'sio', rationale: `Keyword '${keyword}' used in implementation code` };\n      }\n    }\n  }\n\n  return { depth: 'sio', rationale: `Default: treating '${keyword}' as SIO (implementation-level)` };\n}\n\n/**\n * Escalate keywords/api_usage to neutral concepts with ULO/CIO/SIO depth and join evidence files.\n */\nexport async function escalateAndMapConcepts(\n  options: EscalateOptions,\n): Promise<Map<string, ConceptMapping[]>> {\n  const { projectGraph, fileContentsMap, availableConcepts, conceptMapOverride, llmConfig, sharedClient } = options;\n\n  const features = projectGraph.features || [];\n\n  // Collect all terms from all features\n  const allTerms = new Set<string>();\n  for (const feature of features) {\n    for (const step of feature.steps || []) {\n      for (const api of step.api_usage || []) allTerms.add(api);\n      for (const kw of step.keywords || []) allTerms.add(kw);\n    }\n  }\n\n  if (allTerms.size === 0) return new Map();\n\n  const termList = Array.from(allTerms).sort();\n  let llmResults: Record<string, { concept_code?: string; concept_name?: string; depth?: string }> = {};\n\n  if (conceptMapOverride) {\n    llmResults = conceptMapOverride;\n  } else {\n    try {\n      const client = sharedClient ?? createLlmClient(llmConfig);\n      const conceptBank = (availableConcepts || []).sort().join(', ') || '(empty)';\n\n      const termEntries = termList.map(term => {\n        const snippets = extractTermSnippets(term, fileContentsMap);\n        return snippets.length > 0\n          ? `- ${term} (Usage context: ${snippets[0]})`\n          : `- ${term}`;\n      });\n\n      const systemPrompt = (\n        'You are a knowledge classification expert. For each concrete keyword/API, determine:\\n'\n        + '1. The neutral concept it belongs to (UPPER_SNAKE_CASE)\\n'\n        + '2. The depth level: ulo | cio | sio\\n\\n'\n        + 'DEPTH DEFINITIONS:\\n'\n        + '- ulo (WHAT + WHY): The keyword introduces a concept — \"what is it, why does it exist\"\\n'\n        + '  Example: In a scaffold step, \"@State is SwiftUI\\'s way of managing local view state\"\\n'\n        + '- cio (HOW): The keyword demonstrates a mechanism — \"how it works\"\\n'\n        + '  Example: \"@State triggers view re-render when value changes — mechanism is value-type observation\"\\n'\n        + '- sio (IMPLEMENTATION): The keyword is a concrete API/syntax used in code\\n'\n        + '  Example: \"Using @State var isActive: Bool = false in ContentView\"\\n\\n'\n        + 'RULES:\\n'\n        + '1. PREFER an EXISTING concept from the CONCEPT_BANK below if the keyword is a manifestation of that concept.\\n'\n        + '2. ONLY create a NEW concept (UPPER_SNAKE_CASE, NOT ending in _CONCEPT, NOT containing a specific technology name) when NO concept in the bank covers it.\\n'\n        + `3. CONCEPT_BANK: ${conceptBank.slice(0, 12000)}\\n`\n        + '4. Depth is per-keyword-in-context, NOT per-concept. The same concept can have ULO at one step and SIO at another.\\n'\n        + 'Return JSON: {\"results\": {\"<keyword>\": {\"concept_code\": \"...\", \"concept_name\": \"...\", \"depth\": \"ulo|cio|sio\"}}}'\n      );\n\n      const userPrompt = (\n        'Classify the following keyword/API list into neutral concepts WITH depth levels.\\n'\n        + 'Code usage context is provided to disambiguate depth:\\n'\n        + termEntries.join('\\n')\n        + '\\n\\nReturn JSON: {\"results\": {\"<keyword>\": {\"concept_code\": \"...\", \"concept_name\": \"...\", \"depth\": \"ulo|cio|sio\"}}}'\n      );\n\n      const result = await llmChatJson(client, systemPrompt, userPrompt, {\n        temperature: 0.1,\n        maxTokens: 16384,\n      });\n\n      llmResults = (result.results || {}) as Record<string, { concept_code?: string; concept_name?: string; depth?: string }>;\n    } catch (err) {\n      console.warn(`[WARN] Concept escalation LLM failed (${err}), using fallback depth inference`);\n    }\n  }\n\n  // Join results into feature_concepts\n  const featureConcepts = new Map<string, ConceptMapping[]>();\n\n  for (const feature of features) {\n    const fid = feature.id || 'F_UNK';\n    const featureFiles = new Set<string>();\n    for (const step of feature.steps || []) {\n      for (const f of step.files || []) featureFiles.add(f);\n    }\n\n    const fTerms = [\n      ...(feature.api_usage || []),\n      ...(feature.steps || []).flatMap(s => [...(s.api_usage || []), ...(s.keywords || [])]),\n    ];\n\n    const items: ConceptMapping[] = [];\n    const seen = new Set<string>();\n\n    for (const kw of fTerms) {\n      const info = llmResults[kw] || {};\n      const cCode = info.concept_code || toUpperSnake(kw);\n      const cName = info.concept_name || kw;\n\n      // Determine depth: LLM result > fallback inference\n      let depth: 'ulo' | 'cio' | 'sio' = 'sio';\n      let depthRationale = 'Default: SIO';\n      let depthSource: ConceptMapping['depth_source'] = 'override';\n\n      if (info.depth && ['ulo', 'cio', 'sio'].includes(info.depth)) {\n        depth = info.depth as 'ulo' | 'cio' | 'sio';\n        depthRationale = `LLM classified as ${depth}`;\n        depthSource = 'llm';\n      } else {\n        const inferred = inferDepthFromContext(kw, fileContentsMap);\n        depth = inferred.depth;\n        depthRationale = inferred.rationale;\n        depthSource = 'heuristic';\n      }\n\n      // Allow multiple keywords per concept — don't dedup by concept_code\n      const kwKey = `${cCode}::${kw}`;\n      if (seen.has(kwKey)) continue;\n      seen.add(kwKey);\n\n      // Evidence: files that actually contain this term\n      const evidenceFiles: string[] = [];\n      for (const f of featureFiles) {\n        const content = fileContentsMap.get(f) || '';\n        if (content.toLowerCase().includes(kw.toLowerCase())) {\n          evidenceFiles.push(f);\n        }\n      }\n\n      items.push({\n        concept_code: cCode,\n        concept_name: cName,\n        keyword: kw,\n        depth,\n        depth_rationale: depthRationale,\n        depth_source: depthSource,\n        evidence_files: evidenceFiles,\n      });\n    }\n\n    featureConcepts.set(fid, items);\n  }\n\n  return featureConcepts;\n}\n","/**\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 * Knowledge Graph Verifier — validates referential integrity, prerequisite DAG\n * acyclicity, and reverse syllabus coverage for concept-driven graphs.\n */\n\nimport type { KnowledgeGraph, Concept } from '../schemas/knowledgeGraphSchema';\nimport type { ParsedSyllabus } from '../parsers/syllabusParser';\n\nexport interface KnowledgeGraphVerificationReport {\n  valid: boolean;\n  cycles: string[][];\n  removedEdges: Array<{ from: string; to: string }>;\n  danglingPrerequisites: Array<{ conceptId: string; missingPrereqId: string }>;\n  coverageRatio: number;\n  totalSyllabusTopics: number;\n  coveredSyllabusTopics: number;\n  uncoveredTopics: string[];\n  warnings: string[];\n}\n\n/**\n * Detect cycles in prerequisite graph using DFS.\n */\nexport function detectPrerequisiteCycles(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  const prereqMap = new Map<string, string[]>();\n  for (const c of concepts) {\n    prereqMap.set(c.id, c.prerequisites || []);\n  }\n\n  function dfs(conceptId: string) {\n    if (inStack.has(conceptId)) {\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    for (const prereq of prereqMap.get(conceptId) || []) {\n      dfs(prereq);\n    }\n\n    path.pop();\n    inStack.delete(conceptId);\n  }\n\n  for (const c of concepts) {\n    if (!visited.has(c.id)) {\n      dfs(c.id);\n    }\n  }\n\n  return cycles;\n}\n\n/**\n * Break cycles by removing back-edges.\n */\nexport function breakPrerequisiteCycles(\n  concepts: Concept[],\n  cycles: string[][],\n): { 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    if (cycle.length >= 2) {\n      const breaker = cycle[cycle.length - 2];\n      const target = cycle[cycle.length - 1];\n\n      for (const concept of fixed) {\n        if (concept.id === breaker && target) {\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 * Audit reverse coverage: verify that every topic in ParsedSyllabus is mapped\n * to at least one concept in KnowledgeGraph.\n */\nexport function auditSyllabusCoverage(\n  concepts: Concept[],\n  syllabus?: ParsedSyllabus,\n): { coverageRatio: number; totalTopics: number; coveredTopics: number; uncovered: string[] } {\n  if (!syllabus || syllabus.allTopics.length === 0) {\n    return { coverageRatio: 1.0, totalTopics: 0, coveredTopics: 0, uncovered: [] };\n  }\n\n  const topics = syllabus.allTopics;\n  const coveredSet = new Set<string>();\n\n  for (const topic of topics) {\n    const topicKeywords = new Set([\n      ...topic.title.toLowerCase().split(/\\s+/),\n      ...(topic.keywords || []).map((k) => k.toLowerCase()),\n    ]);\n\n    // Check if any concept references this topic title or shares keywords\n    for (const concept of concepts) {\n      const cName = concept.name.toLowerCase();\n      const cDesc = (concept.description || '').toLowerCase();\n      const cKeywords = (concept.keywords || []).map((k) => k.toLowerCase());\n\n      // Direct ID match\n      if (concept.id.toLowerCase() === topic.id.toLowerCase()) {\n        coveredSet.add(topic.id);\n        break;\n      }\n\n      const refs = (concept as any).references || [];\n      const hasTopicRef = refs.some(\n        (r: any) => r.id === topic.id || (r.title && r.title.toLowerCase() === topic.title.toLowerCase())\n      );\n      if (hasTopicRef) {\n        coveredSet.add(topic.id);\n        break;\n      }\n\n      const conceptKeywords = (concept.keywords || []).map((k) => k.toLowerCase());\n      const hasOverlap = conceptKeywords.some((k) => topicKeywords.has(k)) ||\n        concept.name.toLowerCase().includes(topic.title.toLowerCase()) ||\n        topic.title.toLowerCase().includes(concept.name.toLowerCase());\n\n      if (hasOverlap) {\n        coveredSet.add(topic.id);\n        break;\n      }\n    }\n  }\n\n  const totalTopics = topics.length;\n  const coveredTopics = coveredSet.size;\n  const coverageRatio = totalTopics > 0 ? coveredTopics / totalTopics : 1.0;\n  const uncovered = topics.filter((t) => !coveredSet.has(t.id)).map((t) => `${t.id}: ${t.title}`);\n\n  return { coverageRatio, totalTopics, coveredTopics, uncovered };\n}\n\n/**\n * Full knowledge graph verifier function.\n */\nexport function verifyKnowledgeGraph(\n  kg: KnowledgeGraph,\n  syllabusOrOptions?: ParsedSyllabus | { parsedSyllabus?: ParsedSyllabus },\n): { verifiedGraph: KnowledgeGraph; report: KnowledgeGraphVerificationReport } {\n  const syllabus = syllabusOrOptions && 'parsedSyllabus' in syllabusOrOptions\n    ? syllabusOrOptions.parsedSyllabus\n    : (syllabusOrOptions as ParsedSyllabus | undefined);\n\n  const warnings: string[] = [];\n  let concepts = [...(kg.concepts || [])];\n  const conceptIds = new Set(concepts.map((c) => c.id));\n\n  // 1. Remove self-loops\n  for (const c of concepts) {\n    if ((c.prerequisites || []).includes(c.id)) {\n      c.prerequisites = (c.prerequisites || []).filter((p) => p !== c.id);\n      warnings.push(`Self-loop removed on concept ${c.id}`);\n    }\n  }\n\n  // 2. Dangling prerequisite check\n  const danglingPrerequisites: Array<{ conceptId: string; missingPrereqId: string }> = [];\n  for (const c of concepts) {\n    const validPrereqs: string[] = [];\n    for (const p of c.prerequisites || []) {\n      if (!conceptIds.has(p)) {\n        danglingPrerequisites.push({ conceptId: c.id, missingPrereqId: p });\n        warnings.push(`Dangling prerequisite removed: ${c.id} -> ${p}`);\n      } else {\n        validPrereqs.push(p);\n      }\n    }\n    c.prerequisites = validPrereqs;\n  }\n\n  // 3. Cycle detection & breaking\n  const initialCycles = detectPrerequisiteCycles(concepts);\n  let removedEdges: Array<{ from: string; to: string }> = [];\n  if (initialCycles.length > 0) {\n    const broken = breakPrerequisiteCycles(concepts, initialCycles);\n    concepts = broken.fixed;\n    removedEdges = broken.removed;\n    for (const r of removedEdges) {\n      warnings.push(`Cycle broken: removed edge ${r.from} -> ${r.to}`);\n    }\n  }\n\n  // 4. Reverse coverage audit against syllabus\n  const coverage = auditSyllabusCoverage(concepts, syllabus);\n  if (coverage.coverageRatio < 1.0) {\n    warnings.push(`Syllabus coverage ${(coverage.coverageRatio * 100).toFixed(1)}% (${coverage.coveredTopics}/${coverage.totalTopics} topics). Uncovered: ${coverage.uncovered.join(', ')}`);\n  }\n\n  // 5. Concept layer checks\n  for (const c of concepts) {\n    if (!c.ulo) warnings.push(`Concept ${c.id} missing ULO (WHAT + WHY)`);\n    if (!c.cio) warnings.push(`Concept ${c.id} missing CIO (HOW mechanism)`);\n    if (!c.sio || c.sio.length === 0) warnings.push(`Concept ${c.id} missing SIO implementation items`);\n  }\n\n  const valid = initialCycles.length === 0 && danglingPrerequisites.length === 0 && coverage.coverageRatio >= 0.8;\n\n  const verifiedGraph: KnowledgeGraph = {\n    ...kg,\n    concepts,\n  };\n\n  const report: KnowledgeGraphVerificationReport = {\n    valid,\n    cycles: initialCycles,\n    removedEdges,\n    danglingPrerequisites,\n    coverageRatio: coverage.coverageRatio,\n    totalSyllabusTopics: coverage.totalTopics,\n    coveredSyllabusTopics: coverage.coveredTopics,\n    uncoveredTopics: coverage.uncovered,\n    warnings,\n  };\n\n  return { verifiedGraph, report };\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\";\nimport { transportResultFrom, type LlmTransportResult } from \"../utils/llmTransportResult.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  /** Which LLM transport produced the layers under audit (for provenance). */\n  transport?: LlmTransportResult;\n}\n\n/**\n * Shared completable-verb registry — the SINGLE source of truth for both the\n * SIO authoring prompt (hierarchicalLoAuthoring MACHINE CHECK) and this audit's\n * COMPLETABLE regex. Drift between prompt and audit previously produced\n * deterministic false-negatives: production SIOs using perfectly completable\n * verbs that both lists omitted (update/inject/compose/pass/modify) failed the\n * audit and killed the whole pipeline fail-closed.\n */\nexport const COMPLETABLE_VERBS: string[] = [\n  \"build\", \"create\", \"implement\", \"write\", \"configure\", \"add\", \"use\", \"apply\",\n  \"display\", \"store\", \"load\", \"save\", \"handle\", \"parse\", \"validate\", \"test\",\n  \"register\", \"compute\", \"generate\", \"print\", \"format\", \"convert\", \"extend\",\n  \"define\", \"execute\", \"run\", \"read\", \"fetch\", \"wrap\", \"log\", \"call\", \"raise\",\n  \"install\", \"import\", \"export\", \"declare\", \"embed\", \"model\", \"represent\",\n  \"override\", \"customize\", \"enforce\", \"mock\", \"assert\", \"query\", \"index\",\n  \"cache\", \"stream\", \"split\", \"join\", \"strip\", \"encode\", \"decode\", \"traverse\",\n  \"measure\", \"evaluate\", \"benchmark\", \"diagnose\", \"demonstrate\", \"verify\",\n  \"organize\", \"structure\", \"choose\", \"select\", \"compare\", \"distinguish\",\n  \"attach\", \"annotate\", \"expose\", \"accept\", \"manage\", \"group\", \"sort\",\n  \"filter\", \"map\", \"reduce\", \"catch\", \"throw\", \"migrate\", \"inspect\", \"trace\",\n  \"parameterize\", \"construct\", \"design\", \"capture\",\n  // Completable implementation verbs present in production SIO output but\n  // missing from the original registry (2026-10-07 smoke test, swift kg):\n  \"update\", \"inject\", \"compose\", \"pass\", \"modify\", \"connect\", \"remove\",\n  \"transform\", \"trigger\", \"refresh\", \"persist\", \"observe\", \"arrange\", \"derive\",\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  transport?: LlmTransportResult,\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 = new RegExp(\"\\\\b(?:\" + COMPLETABLE_VERBS.join(\"|\") + \")\\\\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;    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      transport,\n    };\n  });\n}\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 * 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, COMPLETABLE_VERBS, type DepthLayerAudit } from './depthAudit';\nimport { parseJsonFromLlm, type LlmClient, type LlmTransportResult, transportResultFrom } 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  /** Transport provenance attached to the last layer-generation call. */\n  lastTransport?: LlmTransportResult;\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  transport?: LlmTransportResult,\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 = 10;\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, transportResultFrom('9router', client.model, { framingStripped: true }));\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, transportResultFrom('9router', client.model, { framingStripped: true }));\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    \"   (\" + COMPLETABLE_VERBS.join(\", \") + \") — 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, transportResultFrom('9router', client.model, { framingStripped: true }));\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\", \"update\", \"inject\", \"compose\", \"pass\", \"modify\", \"use\"].join(\", \") + \" ...full registry in the SIO authoring step) 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, lastTransport: audits[0]?.transport };\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';\nimport { stripDiacritics } from '../utils/diacritics';\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    stripDiacritics(s).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\": copy VERBATIM from that tree concept\\'s keyword list in the shortlist (exact tokens, do not re-spell, singularize or translate). Pick the subset that makes sense for the course TECH STACK; if none fit, return an EMPTY array — never invent a keyword. 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 rawAdopted = (d.adopted_keywords || []).map((k) => String(k)).filter(Boolean);\n      let adopted: string[];\n      if (tc.keywords.length === 0) {\n        // R13: some tree concepts ship NO keyword column at all (observed:\n        // UI_LAYOUT_MODIFIERS in mlo-knowlege-tree.tsv) — the \"adopted ⊆ tree\n        // keywords\" contract is unsatisfiable there and the old guard killed\n        // the whole run. With an empty registry there is nothing to corrupt:\n        // adopt the ANALYSIS concept's own keywords (derived from the course\n        // input in the decompose step), loudly, instead of throwing.\n        adopted = rawAdopted.filter((k) => (c.keywords ?? []).some((ck) => ck.toLowerCase() === k.toLowerCase()));\n        if (adopted.length === 0) adopted = (c.keywords ?? []).slice(0, 8);\n        warnings.push('Concept ' + c.id + ': tree concept ' + tc.code + ' has no keyword registry — adopted ' + adopted.length + ' keyword(s) from the analysis concept');\n      } else {\n        // Membership test with deterministic morphology normalization: LLMs\n        // re-spell tree keywords (\"interfaces\" → \"interface\"). Normalizing the\n        // trailing plural on BOTH sides can only create matches, never lose\n        // them, so registry purity holds. Non-member tokens are DROPPED with a\n        // loud warning instead of killing the run — the registry stays pure\n        // (only verified tree keywords are adopted); an empty result still\n        // trips the missing-adopted_keywords fail-closed below.\n        const norm = (k: string): string => k.toLowerCase().replace(/ies$/, 'y').replace(/s$/, '');\n        const treeKwNorm = new Set([...treeKw].map(norm));\n        const dropped: string[] = [];\n        adopted = rawAdopted.filter((k) => {\n          if (treeKw.has(k.toLowerCase()) || treeKwNorm.has(norm(k))) return true;\n          dropped.push(k);\n          return false;\n        });\n        if (dropped.length > 0) {\n          warnings.push('Concept ' + c.id + ': dropped ' + dropped.length + ' adopted keyword(s) not in tree concept ' + tc.code + ' registry: ' + dropped.join(', '));\n        }\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, type LlmCallRecord } from '../utils/llmClient';\nimport { stripDiacritics } from '../utils/diacritics';\nimport type { KnowledgeGraph, Concept, ConceptCategory, LearningPathStep } from '../schemas/knowledgeGraphSchema';\nimport { parseSyllabus, type ParsedSyllabus } from '../parsers/syllabusParser';\nimport {\n  verifyKnowledgeGraph,\n  detectPrerequisiteCycles,\n  breakPrerequisiteCycles,\n  type KnowledgeGraphVerificationReport,\n} from './knowledgeGraphVerifier';\n\nexport interface KnowledgeGraphPipelineOptions {\n  subject: string;\n  description?: string;\n  syllabusText?: string;\n  parsedSyllabus?: ParsedSyllabus;\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  verificationReport?: KnowledgeGraphVerificationReport;\n  /** Which providers served this graph, and whether any call fell over. */\n  provenance: LlmCallRecord[];\n}\nimport { auditDepthLayers } from './depthAudit';\nimport { authorDepthLayersHierarchically } from './hierarchicalLoAuthoring';\nimport { loadKnowledgeTreeCatalog } from './knowledgeTreeCatalog';\nimport { standardizeConcepts } from './conceptStandardizer';\n\n\n// ─── Minute calibration bounds (STEP_5c) ─────────────────────────────────────\nexport const MIN_CALIBRATION_MINUTES = 15;\nexport const MAX_CALIBRATION_MINUTES = 60;\nexport const DEFAULT_CONCEPT_MINUTES = 30;\n/** Fraction of disagreement that makes the calibrated value win over the LLM's. */\nexport const MIN_CALIBRATION_DIVERGENCE = 0.5;\n\n/**\n * Deterministic minute estimate from the concept's OWN signals.\n *\n * Each signal is normalised against its realistic cap before weighting, and the\n * weights sum to 1. The previous form summed raw counts (0.2·sio + 0.15·pt + 0.15·\n * prereq + 0.2·bloom = 0.7 max) inside a Math.min(1, …) clamp, so any ordinary\n * concept saturated at the 60-minute ceiling — measured: 53 of 54 realistic\n * parameter combinations returned exactly 60. The ladder was a two-state switch,\n * not a 15→60 range.\n */\nexport function calibrateConceptMinutes(\n  sioCount: number,\n  problemTypeCount: number,\n  prereqCount: number,\n  hasHighBloom: boolean,\n): number {\n  const ratio = (value: number, cap: number): number => Math.min(1, Math.max(0, value) / cap);\n  const score =\n    0.30 * ratio(sioCount, 4) +\n    0.25 * ratio(problemTypeCount, 4) +\n    0.20 * ratio(prereqCount, 4) +\n    0.25 * (hasHighBloom ? 1 : 0);\n  return Math.round(MIN_CALIBRATION_MINUTES + score * (MAX_CALIBRATION_MINUTES - MIN_CALIBRATION_MINUTES));\n}\n\n// ─── Topological Sort ────────────────────────────────────────────────────────\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  let parsedSyllabus = options.parsedSyllabus;\n  if (!parsedSyllabus && syllabusText) {\n    parsedSyllabus = parseSyllabus(syllabusText);\n    log('STEP_1', `Parsed syllabus: ${parsedSyllabus.units.length} units, ${parsedSyllabus.allTopics.length} topics`);\n  }\n\n  const client = createLlmClient(llmConfig);\n\n  // Truncate syllabus with warning\n  const maxSyllabusChars = parseInt(process.env.KG_MAX_SYLLABUS_CHARS || '32000', 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 structuredTopicsGuide = parsedSyllabus && parsedSyllabus.allTopics.length > 0\n    ? `\\nSTRUCTURED SYLLABUS TOPICS (Every topic MUST map to at least one concept to ensure 100% syllabus coverage):\\n`\n      + parsedSyllabus.allTopics.map((t) => `- [${t.unitTitle}] ${t.id}: ${t.title} (Keywords: ${t.keywords.join(', ')})`).join('\\n') + '\\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. KEYWORDS: Each concept MUST include 5-10 domain-specific keywords that:\\n'\n    + '   - Are concrete terms a student encounters when studying THIS concept\\n'\n    + '   - Include at least 2 technology-specific terms (APIs, functions, types, tools)\\n'\n    + '   - Are DISTINCT from keywords of other concepts (minimal overlap)\\n'\n    + '   - NEVER generic English words (e.g. \"view\", \"data\", \"code\" are TOO generic)\\n'\n    + '   - Example for \"SwiftUI Layout\": [\"VStack\", \"HStack\", \"ZStack\", \".padding()\", \".frame()\", \"alignment\", \"Spacer\", \"LazyVGrid\"]\\n'\n    + '9. Return JSON matching the KnowledgeGraphSchema'\n  );\n\n  const userPrompt = `Subject: ${subject}\\n${description ? `Description: ${description}` : ''}\\n${structuredTopicsGuide}${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\": \"2-3 sentence description: what this concept covers, why a learner encounters it, and what mastering it enables. Must be specific enough that a student reading only this description understands the concept's scope.\",\\n      \"category\": \"category_id\",\\n      \"keywords\": [\"specific_term_1\", \"concrete_api_2\", \"method_call_3\", \"tool_or_type_4\", \"syntax_keyword_5\", \"concept_term_6\"],\\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\n  // Step 5.2: Description length check\n  for (const c of concepts) {\n    if ((c.description || '').length < 50) {\n      warnings.push('Concept ' + c.id + ': description too short (' + (c.description || '').length + ' chars) — may produce shallow KX narratives');\n    }\n  }\n\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[] => stripDiacritics(text)\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, 8);\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 (WARNING: LLM returned no keywords)');\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    const unmappedTreePrereqs = new Set<string>();\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        } else if (!target) {\n          unmappedTreePrereqs.add(tp);\n        }\n      }\n    }\n    if (unmappedTreePrereqs.size > 0) {\n      const shown = [...unmappedTreePrereqs].slice(0, 10).join(', ');\n      warnings.push('Tree prereqs outside THIS analysis (no edge seeded, ' + unmappedTreePrereqs.size + ' codes): ' + shown + (unmappedTreePrereqs.size > 10 ? ', ...' : ''));\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  } else {\n    warnings.push('No knowledgeTreePath provided — concepts are NOT standardized against the knowledge tree (all proposed_new)');\n  }\n\n  // ─── Step 3: Cycle Detection ─────────────────────────────────────────────\n  log('STEP_3', 'Checking for prerequisite cycles...');\n\n  const cycles = detectPrerequisiteCycles(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(' → ')} — removing the closing back-edge (last DFS edge; pedagogically arbitrary)`);\n    }\n\n    const { fixed, removed } = breakPrerequisiteCycles(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  // ─── Step 5b: Enrich keyword registry from SIO items (D1) ─────────────────\n  // SIO text contains concrete tech identifiers (APIs, functions, modules)\n  // that are the most DISTINCTIVE keywords per concept.\n  {\n    for (const concept of concepts) {\n      const sioText = (concept.sio || []).join(' ');\n      const techTokens: string[] = [];\n      let m: RegExpExecArray | null;\n\n      // Extract backtick-wrapped tokens\n      const techTokenRe = /`([^`]+)`/g;\n      while ((m = techTokenRe.exec(sioText)) !== null) {\n        if (m[1].length >= 3 && m[1].length <= 40) techTokens.push(m[1]);\n      }\n      // Extract annotations (e.g. @State, @Binding)\n      const annotationRe = /(?:^|[\\s(])(@[A-Za-z]\\w*)/g;\n      while ((m = annotationRe.exec(sioText)) !== null) techTokens.push(m[1]);\n      // Extract dotted method calls (e.g. networkManager.fetchUserData)\n      const dotRe = /\\b\\w+\\.\\w+\\(/g;\n      while ((m = dotRe.exec(sioText)) !== null) techTokens.push(m[0].replace('(', ''));\n      // Extract method/modifier calls (e.g. .sheet, .padding, .frame)\n      const modifierRe = /(?:^|[\\s(])(\\.[a-z]\\w*)\\b/g;\n      while ((m = modifierRe.exec(sioText)) !== null) techTokens.push(m[1]);\n      // Extract camelCase identifiers\n      const camelRe = /\\b[a-z]+[A-Z][A-Za-z]+\\b/g;\n      while ((m = camelRe.exec(sioText)) !== null) techTokens.push(m[0]);\n      // Merge unique SIO tokens into existing keywords (preserve existing order)\n      const existing = new Set((concept.keywords || []).map((k) => k.toLowerCase()));\n      const newTokens = [...new Set(techTokens)]\n        .filter((t) => !existing.has(t.toLowerCase()))\n        .slice(0, 8); // cap at 8 SIO-derived tokens\n      if (newTokens.length > 0) {\n        concept.keywords = [...(concept.keywords || []), ...newTokens];\n        warnings.push('Concept ' + concept.id + ': enriched keywords with ' + newTokens.length + ' SIO-derived tokens');\n      }\n    }\n    log('STEP_5b', 'SIO-keyword enrichment complete');\n  }\n\n  // ─── Step 5c: Calibrate estimated_minutes based on complexity signals (D2) ─\n  {\n    for (const concept of concepts) {\n      const sioCount = (concept.sio || []).length;\n      const ptCount = (concept.problem_types || []).length;\n      const prereqCount = (concept.prerequisites || []).length;\n      const hasHighBloom = (concept.problem_types || []).some((pt) =>\n        ['Analyze', 'Evaluate', 'Create'].includes(pt.bloom_level || ''),\n      );\n\n      const calibrated = calibrateConceptMinutes(sioCount, ptCount, prereqCount, hasHighBloom);\n      const llmEstimate = concept.estimated_minutes || DEFAULT_CONCEPT_MINUTES;\n\n      // Override only when calibration and the LLM disagree materially. The old\n      // `llmEstimate === 30` test could not tell \"the LLM copied the template's 30\"\n      // from \"the LLM deliberately estimated 30\", so it silently clobbered valid\n      // estimates; the divergence rule alone states the same intent honestly.\n      if (Math.abs(calibrated - llmEstimate) / llmEstimate > MIN_CALIBRATION_DIVERGENCE) {\n        concept.estimated_minutes = calibrated;\n        warnings.push('Concept ' + concept.id + ': minutes calibrated ' + llmEstimate + 'm → ' + calibrated + 'm');\n      }\n    }\n    log('STEP_5c', 'Minute calibration complete');\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  const rawGraph: 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\n  // ─── Step 6: Verify Knowledge Graph referential integrity and reverse coverage ──\n  log('STEP_6', 'Running Knowledge Graph verification & reverse coverage audit...');\n  const { verifiedGraph, report } = verifyKnowledgeGraph(rawGraph, parsedSyllabus);\n  warnings.push(...report.warnings);\n\n  return {\n    knowledgeGraph: verifiedGraph,\n    warnings,\n    verificationReport: report,\n    provenance: client.callLog,\n  };\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, type LlmCallRecord } 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  /** Which providers served this graph, and whether any call fell over. */\n  provenance: LlmCallRecord[];\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        linked_prereq_minutes: 0,\n      },\n      warnings,\n      provenance: [],\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      // HG-1 (2026-10-05): renamed from estimated_total_minutes. It counts only\n      // concepts that HAVE a feature link (max per concept, not summed), so it\n      // is NOT the course total — see HybridGraphSchema.linked_prereq_minutes.\n      // The phase planner below commits to totalProjectMinutes + totalConceptMinutes.\n      linked_prereq_minutes: totalProjectMinutes + totalPrereqMinutes,\n    },\n    warnings,\n    provenance: client.callLog,\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}\nexport function 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 previewsSeen = new Set<string>();\n  const previewPhase = 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 rawAspect = String(ri.aspect || 'new');\n      const aspect: ConceptIntroduction['aspect'] = rawAspect === 'advanced' || rawAspect === 'preview' ? rawAspect : 'new';\n      if (aspect === 'preview') {\n        // Preview = light ULO awareness pass BEFORE the anchor teach. The\n        // anchor 'new' still owns the full introduction (priming, 2026-09-17).\n        if (newIntroPhase.has(cid)) {\n          errors.push('Phase ' + id + ': preview of ' + cid + ' after its new introduction in phase ' + newIntroPhase.get(cid) + ' - preview must precede the anchor teach');\n          continue;\n        }\n        if (previewsSeen.has(cid)) {\n          errors.push('Phase ' + id + ': duplicate preview of ' + cid);\n          continue;\n        }\n        previewsSeen.add(cid);\n        previewPhase.set(cid, order);\n        introductions.push({ concept_id: cid, aspect, note: String(ri.note || '') });\n        continue;\n      }\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      introductions.push({ concept_id: cid, aspect, note: String(ri.note || '') });\n    }\n\n    // Prerequisite check runs AFTER the whole phase is registered, so it is\n    // order-insensitive WITHIN a phase. Teaching C2 and its prerequisite C1 in\n    // the same phase is legitimate — the planner orders them inside the phase —\n    // but the previous per-intro check reported it as a violation whenever the\n    // dependent concept happened to appear first in the JSON array. Since the\n    // violation text is fed back verbatim for repair, a false positive burned\n    // all three attempts and then threw away a valid plan.\n    for (const intro of introductions) {\n      const cid = intro.concept_id;\n      if (intro.aspect === 'advanced') continue;\n      const introOrder = newIntroPhase.get(cid);\n      if (introOrder === undefined || introOrder !== order) continue; // introduced in an earlier phase\n      for (const pre of prereqOf.get(cid) || []) {\n        // A preview in an EARLIER phase satisfies the dependency — that is what\n        // preview is for. A preview in the SAME phase does not: within a phase the\n        // teaching order is new → advanced → preview.\n        const previewOrder = previewPhase.get(pre);\n        const covered = newIntroPhase.has(pre) || (previewOrder !== undefined && previewOrder < order);\n        if (!covered) {\n          errors.push('Phase ' + id + ': concept ' + cid + ' introduced before its prerequisite ' + pre + ' is introduced (or previewed in an earlier phase) - violates the prerequisite chain');\n        }\n      }\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    const prev = previewPhase.get(cid);\n    if (intro === undefined && prev === undefined) {\n      errors.push('Concept ' + cid + ' is consumed from phase ' + consumerOrder + ' but never introduced in any phase');\n    } else if (intro !== undefined && intro > consumerOrder && (prev === undefined || prev > consumerOrder)) {\n      errors.push('Concept ' + cid + ' introduced in phase ' + intro + ' but first consumed in phase ' + consumerOrder + ' - introduction must come no later than first consumption (or a preview must cover the dependency)');\n    }\n  }\n  for (const [cid, pOrder] of previewPhase) {\n    const anchor = newIntroPhase.get(cid);\n    if (anchor !== undefined && anchor <= pOrder) {\n      errors.push('Concept ' + cid + ' previewed in phase ' + pOrder + ' but fully introduced in phase ' + anchor + ' - preview must precede the anchor introduction');\n    }\n    if (anchor === undefined) {\n      // The emitter hard-fails on this (\"never fully introduced in any phase\").\n      // Catching it here gives the repair loop something concrete to fix instead\n      // of letting the plan sail through the audit and die three layers later.\n      errors.push('Concept ' + cid + ' is previewed in phase ' + pOrder + ' but never fully introduced (aspect new) in any phase - a preview must have an anchor teach');\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    + '   - aspect preview: a light awareness pass (\\\"know it exists\\\", ULO depth only, ~5 min)\\n'\n    + '     placed in an EARLIER phase when its feature work needs the vocabulary before the\\n'\n    + '     full teach. The anchor phase still owns the full new introduction.\\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. MINUTE BALANCE: Each phase should contain approximately 120-240 total minutes of\\n'\n    + '   concept + feature work (about 3-5 sessions of 90 minutes each). If a phase\\n'\n    + '   would contain < 60 minutes (too thin) or > 400 minutes (too heavy), rebalance.\\n'\n    + '9. Phase 1 usually covers project setup/foundation features plus the first minimal slice.\\n'\n    + '10. Return JSON only.'\n  );\n\n  const totalFeatureMinutes = features.reduce((s, f) =>\n    s + (f.steps || []).reduce((ss, st) => ss + (st.effort?.estimated_minutes || 15), 0), 0);\n  const totalConceptMinutes = concepts.reduce((s, c) => s + (c.estimated_minutes || 30), 0);\n  const totalMinutes = totalFeatureMinutes + totalConceptMinutes;\n  const targetPhaseCount = Math.max(3, Math.round(totalMinutes / 180));\n\n  const baseUserPrompt = 'FEATURES:\\n' + featureList + '\\n\\nCONCEPTS:\\n' + conceptList\n    + '\\n\\nFEATURE-CONCEPT LINKS:\\n' + linkList + '\\n\\n'\n    + 'TOTAL MINUTES: ~' + totalMinutes + 'm (' + totalFeatureMinutes + 'm features + ' + totalConceptMinutes + 'm concepts)\\n'\n    + 'TARGET: ~' + targetPhaseCount + ' phases of ~180m each\\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"]}