@thanh01.pmt/domain-kit 0.1.0

package/dist/pipeline/index.cjs.map

@@ -0,0 +1 @@
+{"version":3,"sources":["../../src/parsers/swift.ts","../../src/parsers/typescript.ts","../../src/parsers/python.ts","../../src/parsers/cpp.ts","../../src/extractors/keywordExtractor.ts","../../src/utils/llmClient.ts","../../src/graph/scaffoldExtractor.ts","../../src/graph/overviewExtractor.ts","../../src/graph/stepExtractor.ts","../../src/graph/graphVerifier.ts","../../src/graph/conceptEscalator.ts","../../src/concepts/conceptResolver.ts","../../src/assembly/roadmapAssembler.ts","../../src/extractors/fileSelector.ts","../../src/utils/fileUtils.ts","../../src/pipeline/projectGraphPipeline.ts"],"names":["IMPORT_RE","TYPE_RE","FUNC_RE","resolve","buildSourceText","execSync","extname","join","readdirSync","readFileSync","relative"],"mappings":";;;;;;;AA0BA,IAAM,SAAA,GAAY,mBAAA;AAClB,IAAM,OAAA,GAAU,4DAAA;AAChB,IAAM,OAAA,GAAU,mDAAA;AAChB,IAAM,UAAA,GAAa,sIAAA;AACnB,IAAM,kBAAA,GAAqB,oJAAA;AAEpB,SAAS,cAAA,CAAe,UAAkB,OAAA,EAAmC;AAClF,EAAA,MAAM,MAAA,GAA2B;AAAA,IAC/B,SAAS,EAAC;AAAA,IACV,OAAO,EAAC;AAAA,IACR,WAAW,EAAC;AAAA,IACZ,mBAAmB,EAAC;AAAA,IACpB,gBAAgB,EAAC;AAAA,IACjB,iBAAiB;AAAC,GACpB;AAGA,EAAA,IAAI,KAAA;AACJ,EAAA,OAAA,CAAQ,KAAA,GAAQ,SAAA,CAAU,IAAA,CAAK,OAAO,OAAO,IAAA,EAAM;AACjD,IAAA,MAAA,CAAO,OAAA,CAAQ,IAAA,CAAK,KAAA,CAAM,CAAC,CAAC,CAAA;AAAA,EAC9B;AAGA,EAAA,MAAM,MAAA,uBAAa,GAAA,EAAY;AAC/B,EAAA,OAAA,CAAQ,KAAA,GAAQ,kBAAA,CAAmB,IAAA,CAAK,OAAO,OAAO,IAAA,EAAM;AAC1D,IAAA,IAAI,CAAC,MAAA,CAAO,GAAA,CAAI,KAAA,CAAM,CAAC,CAAC,CAAA,EAAG;AACzB,MAAA,MAAA,CAAO,GAAA,CAAI,KAAA,CAAM,CAAC,CAAC,CAAA;AACnB,MAAA,MAAA,CAAO,eAAA,CAAgB,IAAA,CAAK,KAAA,CAAM,CAAC,CAAC,CAAA;AAAA,IACtC;AAAA,EACF;AAGA,EAAA,OAAA,CAAQ,KAAA,GAAQ,OAAA,CAAQ,IAAA,CAAK,OAAO,OAAO,IAAA,EAAM;AAC/C,IAAA,MAAM,QAAA,GAAA,CAAY,KAAA,CAAM,CAAC,CAAA,IAAK,IAC3B,KAAA,CAAM,GAAG,CAAA,CACT,GAAA,CAAI,OAAK,CAAA,CAAE,IAAA,EAAM,CAAA,CACjB,OAAO,OAAO,CAAA;AACjB,IAAA,MAAA,CAAO,MAAM,IAAA,CAAK;AAAA,MAChB,IAAA,EAAM,MAAM,CAAC,CAAA;AAAA,MACb,IAAA,EAAM,MAAM,CAAC,CAAA;AAAA,MACb,WAAA,EAAa,QAAA;AAAA,MACb,IAAA,EAAM;AAAA,KACP,CAAA;AAAA,EACH;AAGA,EAAA,OAAA,CAAQ,KAAA,GAAQ,OAAA,CAAQ,IAAA,CAAK,OAAO,OAAO,IAAA,EAAM;AAC/C,IAAA,MAAM,IAAA,GAAO,MAAM,CAAC,CAAA;AACpB,IAAA,IAAI,IAAA,CAAK,UAAA,CAAW,GAAG,CAAA,EAAG;AAC1B,IAAA,MAAA,CAAO,UAAU,IAAA,CAAK;AAAA,MACpB,IAAA;AAAA,MACA,MAAA,EAAA,CAAS,KAAA,CAAM,CAAC,CAAA,IAAK,IAAI,IAAA,EAAK;AAAA,MAC9B,OAAA,EAAA,CAAU,KAAA,CAAM,CAAC,CAAA,IAAK,IAAI,IAAA,EAAK;AAAA,MAC/B,IAAA,EAAM;AAAA,KACP,CAAA;AAAA,EACH;AAGA,EAAA,MAAM,UAAA,uBAAiB,GAAA,EAAY;AACnC,EAAA,OAAA,CAAQ,KAAA,GAAQ,UAAA,CAAW,IAAA,CAAK,OAAO,OAAO,IAAA,EAAM;AAClD,IAAA,UAAA,CAAW,GAAA,CAAI,KAAA,CAAM,CAAC,CAAC,CAAA;AAAA,EACzB;AACA,EAAA,MAAA,CAAO,iBAAA,GAAoB,KAAA,CAAM,IAAA,CAAK,UAAU,CAAA;AAGhD,EAAA,IAAI,QAAQ,QAAA,CAAS,MAAM,KAAK,OAAA,CAAQ,QAAA,CAAS,KAAK,CAAA,EAAG;AACvD,IAAA,MAAA,CAAO,cAAA,CAAe,KAAK,UAAU,CAAA;AAAA,EACvC;AACA,EAAA,IAAI,OAAA,CAAQ,QAAA,CAAS,QAAQ,CAAA,EAAG;AAC9B,IAAA,MAAA,CAAO,cAAA,CAAe,KAAK,QAAQ,CAAA;AAAA,EACrC;AACA,EAAA,IAAI,OAAA,CAAQ,QAAA,CAAS,SAAS,CAAA,EAAG;AAC/B,IAAA,MAAA,CAAO,cAAA,CAAe,KAAK,aAAa,CAAA;AAAA,EAC1C;AACA,EAAA,IAAI,OAAA,CAAQ,QAAA,CAAS,MAAM,CAAA,EAAG;AAC5B,IAAA,MAAA,CAAO,cAAA,CAAe,KAAK,MAAM,CAAA;AAAA,EACnC;AACA,EAAA,IAAI,OAAA,CAAQ,QAAA,CAAS,MAAM,CAAA,EAAG;AAC5B,IAAA,MAAA,CAAO,cAAA,CAAe,KAAK,MAAM,CAAA;AAAA,EACnC;AAEA,EAAA,OAAO,MAAA;AACT;AAEO,SAAS,kBAAkB,OAAA,EAA+C;AAC/E,EAAA,MAAM,MAAA,GAA2B;AAAA,IAC/B,SAAS,EAAC;AAAA,IACV,OAAO,EAAC;AAAA,IACR,WAAW,EAAC;AAAA,IACZ,mBAAmB,EAAC;AAAA,IACpB,gBAAgB,EAAC;AAAA,IACjB,iBAAiB;AAAC,GACpB;AAEA,EAAA,MAAM,YAAA,uBAAmB,GAAA,EAAoB;AAC7C,EAAA,MAAM,aAAA,uBAAoB,GAAA,EAAoB;AAC9C,EAAA,MAAM,WAAA,uBAAkB,GAAA,EAAoB;AAC5C,EAAA,MAAM,YAAA,uBAAmB,GAAA,EAAY;AAErC,EAAA,KAAA,MAAW,KAAK,OAAA,EAAS;AACvB,IAAA,KAAA,MAAW,GAAA,IAAO,EAAE,OAAA,EAAS;AAC3B,MAAA,YAAA,CAAa,IAAI,GAAA,EAAA,CAAM,YAAA,CAAa,IAAI,GAAG,CAAA,IAAK,KAAK,CAAC,CAAA;AAAA,IACxD;AACA,IAAA,MAAA,CAAO,KAAA,CAAM,IAAA,CAAK,GAAG,CAAA,CAAE,KAAK,CAAA;AAC5B,IAAA,MAAA,CAAO,SAAA,CAAU,IAAA,CAAK,GAAG,CAAA,CAAE,SAAS,CAAA;AACpC,IAAA,KAAA,MAAW,CAAA,IAAK,EAAE,iBAAA,EAAmB;AACnC,MAAA,aAAA,CAAc,IAAI,CAAA,EAAA,CAAI,aAAA,CAAc,IAAI,CAAC,CAAA,IAAK,KAAK,CAAC,CAAA;AAAA,IACtD;AACA,IAAA,KAAA,MAAW,CAAA,IAAK,EAAE,cAAA,EAAgB;AAChC,MAAA,WAAA,CAAY,IAAI,CAAA,EAAA,CAAI,WAAA,CAAY,IAAI,CAAC,CAAA,IAAK,KAAK,CAAC,CAAA;AAAA,IAClD;AACA,IAAA,KAAA,MAAW,EAAA,IAAM,EAAE,eAAA,EAAiB;AAClC,MAAA,YAAA,CAAa,IAAI,EAAE,CAAA;AAAA,IACrB;AAAA,EACF;AAGA,EAAA,MAAA,CAAO,OAAA,GAAU,KAAA,CAAM,IAAA,CAAK,YAAA,CAAa,OAAA,EAAS,CAAA,CAC/C,IAAA,CAAK,CAAC,CAAA,EAAG,CAAA,KAAM,CAAA,CAAE,CAAC,CAAA,GAAI,CAAA,CAAE,CAAC,CAAC,CAAA,CAC1B,KAAA,CAAM,CAAA,EAAG,EAAE,CAAA,CACX,GAAA,CAAI,CAAC,CAAC,GAAA,EAAK,KAAK,CAAA,KAAM,GAAG,CAAA;AAG5B,EAAA,MAAA,CAAO,iBAAA,GAAoB,KAAA,CAAM,IAAA,CAAK,aAAA,CAAc,OAAA,EAAS,CAAA,CAC1D,IAAA,CAAK,CAAC,CAAA,EAAG,CAAA,KAAM,CAAA,CAAE,CAAC,CAAA,GAAI,CAAA,CAAE,CAAC,CAAC,CAAA,CAC1B,KAAA,CAAM,CAAA,EAAG,EAAE,CAAA,CACX,GAAA,CAAI,CAAC,CAAC,CAAC,CAAA,KAAM,CAAC,CAAA;AAGjB,EAAA,MAAA,CAAO,cAAA,GAAiB,KAAA,CAAM,IAAA,CAAK,WAAA,CAAY,OAAA,EAAS,CAAA,CACrD,IAAA,CAAK,CAAC,CAAA,EAAG,CAAA,KAAM,CAAA,CAAE,CAAC,CAAA,GAAI,CAAA,CAAE,CAAC,CAAC,CAAA,CAC1B,KAAA,CAAM,CAAA,EAAG,EAAE,CAAA,CACX,GAAA,CAAI,CAAC,CAAC,CAAC,CAAA,KAAM,CAAC,CAAA;AAEjB,EAAA,MAAA,CAAO,eAAA,GAAkB,KAAA,CAAM,IAAA,CAAK,YAAY,EAAE,IAAA,EAAK;AAGvD,EAAA,MAAA,CAAO,KAAA,GAAQ,MAAA,CAAO,KAAA,CAAM,KAAA,CAAM,GAAG,GAAG,CAAA;AACxC,EAAA,MAAA,CAAO,SAAA,GAAY,MAAA,CAAO,SAAA,CAAU,KAAA,CAAM,GAAG,GAAG,CAAA;AAEhD,EAAA,OAAO,MAAA;AACT;;;ACjJA,IAAMA,UAAAA,GAAY,sCAAA;AAClB,IAAMC,QAAAA,GAAU,wCAAA;AAChB,IAAMC,QAAAA,GAAU,mCAAA;AAChB,IAAM,QAAA,GAAW,sDAAA;AAEV,SAAS,WAAA,CAAY,UAAkB,OAAA,EAAgC;AAC5E,EAAA,MAAM,MAAA,GAAwB;AAAA,IAC5B,SAAS,EAAC;AAAA,IACV,OAAO,EAAC;AAAA,IACR,WAAW,EAAC;AAAA,IACZ,gBAAgB;AAAC,GACnB;AAEA,EAAA,IAAI,KAAA;AAGJ,EAAA,OAAA,CAAQ,KAAA,GAAQF,UAAAA,CAAU,IAAA,CAAK,OAAO,OAAO,IAAA,EAAM;AACjD,IAAA,MAAA,CAAO,OAAA,CAAQ,IAAA,CAAK,KAAA,CAAM,CAAC,CAAC,CAAA;AAAA,EAC9B;AAGA,EAAA,OAAA,CAAQ,KAAA,GAAQC,QAAAA,CAAQ,IAAA,CAAK,OAAO,OAAO,IAAA,EAAM;AAC/C,IAAA,MAAA,CAAO,MAAM,IAAA,CAAK;AAAA,MAChB,IAAA,EAAM,MAAM,CAAC,CAAA;AAAA,MACb,IAAA,EAAM,MAAM,CAAC,CAAA;AAAA,MACb,IAAA,EAAM;AAAA,KACP,CAAA;AAAA,EACH;AAGA,EAAA,OAAA,CAAQ,KAAA,GAAQC,QAAAA,CAAQ,IAAA,CAAK,OAAO,OAAO,IAAA,EAAM;AAC/C,IAAA,MAAA,CAAO,UAAU,IAAA,CAAK;AAAA,MACpB,IAAA,EAAM,MAAM,CAAC,CAAA;AAAA,MACb,MAAA,EAAA,CAAS,KAAA,CAAM,CAAC,CAAA,IAAK,IAAI,IAAA,EAAK;AAAA,MAC9B,IAAA,EAAM;AAAA,KACP,CAAA;AAAA,EACH;AAGA,EAAA,OAAA,CAAQ,KAAA,GAAQ,QAAA,CAAS,IAAA,CAAK,OAAO,OAAO,IAAA,EAAM;AAChD,IAAA,MAAA,CAAO,UAAU,IAAA,CAAK;AAAA,MACpB,IAAA,EAAM,MAAM,CAAC,CAAA;AAAA,MACb,MAAA,EAAQ,EAAA;AAAA,MACR,IAAA,EAAM;AAAA,KACP,CAAA;AAAA,EACH;AAGA,EAAA,IAAI,QAAQ,QAAA,CAAS,OAAO,KAAK,OAAA,CAAQ,QAAA,CAAS,MAAM,CAAA,EAAG;AACzD,IAAA,MAAA,CAAO,cAAA,CAAe,KAAK,WAAW,CAAA;AAAA,EACxC;AACA,EAAA,IAAI,OAAA,CAAQ,QAAA,CAAS,SAAS,CAAA,EAAG;AAC/B,IAAA,MAAA,CAAO,cAAA,CAAe,KAAK,SAAS,CAAA;AAAA,EACtC;AACA,EAAA,IAAI,OAAA,CAAQ,QAAA,CAAS,SAAS,CAAA,EAAG;AAC/B,IAAA,MAAA,CAAO,cAAA,CAAe,KAAK,UAAU,CAAA;AAAA,EACvC;AAEA,EAAA,OAAO,MAAA;AACT;AAEO,SAAS,eAAe,OAAA,EAAyC;AACtE,EAAA,MAAM,MAAA,GAAwB;AAAA,IAC5B,SAAS,EAAC;AAAA,IACV,OAAO,EAAC;AAAA,IACR,WAAW,EAAC;AAAA,IACZ,gBAAgB;AAAC,GACnB;AAEA,EAAA,MAAM,YAAA,uBAAmB,GAAA,EAAoB;AAC7C,EAAA,MAAM,WAAA,uBAAkB,GAAA,EAAoB;AAE5C,EAAA,KAAA,MAAW,KAAK,OAAA,EAAS;AACvB,IAAA,KAAA,MAAW,GAAA,IAAO,EAAE,OAAA,EAAS;AAC3B,MAAA,YAAA,CAAa,IAAI,GAAA,EAAA,CAAM,YAAA,CAAa,IAAI,GAAG,CAAA,IAAK,KAAK,CAAC,CAAA;AAAA,IACxD;AACA,IAAA,MAAA,CAAO,KAAA,CAAM,IAAA,CAAK,GAAG,CAAA,CAAE,KAAK,CAAA;AAC5B,IAAA,MAAA,CAAO,SAAA,CAAU,IAAA,CAAK,GAAG,CAAA,CAAE,SAAS,CAAA;AACpC,IAAA,KAAA,MAAW,CAAA,IAAK,EAAE,cAAA,EAAgB;AAChC,MAAA,WAAA,CAAY,IAAI,CAAA,EAAA,CAAI,WAAA,CAAY,IAAI,CAAC,CAAA,IAAK,KAAK,CAAC,CAAA;AAAA,IAClD;AAAA,EACF;AAEA,EAAA,MAAA,CAAO,OAAA,GAAU,KAAA,CAAM,IAAA,CAAK,YAAA,CAAa,OAAA,EAAS,CAAA,CAC/C,IAAA,CAAK,CAAC,CAAA,EAAG,CAAA,KAAM,CAAA,CAAE,CAAC,CAAA,GAAI,CAAA,CAAE,CAAC,CAAC,CAAA,CAC1B,KAAA,CAAM,CAAA,EAAG,EAAE,CAAA,CACX,GAAA,CAAI,CAAC,CAAC,GAAG,CAAA,KAAM,GAAG,CAAA;AAErB,EAAA,MAAA,CAAO,cAAA,GAAiB,KAAA,CAAM,IAAA,CAAK,WAAA,CAAY,OAAA,EAAS,CAAA,CACrD,IAAA,CAAK,CAAC,CAAA,EAAG,CAAA,KAAM,CAAA,CAAE,CAAC,CAAA,GAAI,CAAA,CAAE,CAAC,CAAC,CAAA,CAC1B,KAAA,CAAM,CAAA,EAAG,EAAE,CAAA,CACX,GAAA,CAAI,CAAC,CAAC,CAAC,CAAA,KAAM,CAAC,CAAA;AAEjB,EAAA,MAAA,CAAO,KAAA,GAAQ,MAAA,CAAO,KAAA,CAAM,KAAA,CAAM,GAAG,GAAG,CAAA;AACxC,EAAA,MAAA,CAAO,SAAA,GAAY,MAAA,CAAO,SAAA,CAAU,KAAA,CAAM,GAAG,GAAG,CAAA;AAEhD,EAAA,OAAO,MAAA;AACT;;;AC/FA,IAAMF,UAAAA,GAAY,4BAAA;AAClB,IAAM,QAAA,GAAW,qCAAA;AACjB,IAAME,QAAAA,GAAU,8BAAA;AAChB,IAAM,YAAA,GAAe,uBAAA;AAEd,SAAS,eAAA,CAAgB,UAAkB,OAAA,EAAoC;AACpF,EAAA,MAAM,MAAA,GAA4B;AAAA,IAChC,SAAS,EAAC;AAAA,IACV,OAAO,EAAC;AAAA,IACR,WAAW,EAAC;AAAA,IACZ,YAAY,EAAC;AAAA,IACb,gBAAgB;AAAC,GACnB;AAEA,EAAA,IAAI,KAAA;AAGJ,EAAA,OAAA,CAAQ,KAAA,GAAQF,UAAAA,CAAU,IAAA,CAAK,OAAO,OAAO,IAAA,EAAM;AACjD,IAAA,MAAA,CAAO,OAAA,CAAQ,IAAA,CAAK,KAAA,CAAM,CAAC,CAAC,CAAA;AAAA,EAC9B;AAGA,EAAA,OAAA,CAAQ,KAAA,GAAQ,YAAA,CAAa,IAAA,CAAK,OAAO,OAAO,IAAA,EAAM;AACpD,IAAA,MAAM,aAAA,GAAgB,KAAA,CAAM,CAAC,CAAA,CAAE,IAAA,EAAK,CAAE,KAAA,CAAM,IAAI,CAAA,CAAE,CAAC,CAAA,CAAE,KAAA,CAAM,GAAG,GAAG,CAAA;AACjE,IAAA,IAAI,aAAA,CAAc,SAAS,EAAA,EAAI;AAC7B,MAAA,MAAA,CAAO,UAAA,CAAW,KAAK,aAAa,CAAA;AAAA,IACtC;AAAA,EACF;AAGA,EAAA,OAAA,CAAQ,KAAA,GAAQ,QAAA,CAAS,IAAA,CAAK,OAAO,OAAO,IAAA,EAAM;AAChD,IAAA,MAAM,KAAA,GAAA,CAAS,KAAA,CAAM,CAAC,CAAA,IAAK,IACxB,KAAA,CAAM,GAAG,CAAA,CACT,GAAA,CAAI,OAAK,CAAA,CAAE,IAAA,EAAM,CAAA,CACjB,OAAO,OAAO,CAAA;AACjB,IAAA,MAAA,CAAO,MAAM,IAAA,CAAK;AAAA,MAChB,IAAA,EAAM,OAAA;AAAA,MACN,IAAA,EAAM,MAAM,CAAC,CAAA;AAAA,MACb,KAAA;AAAA,MACA,IAAA,EAAM;AAAA,KACP,CAAA;AAAA,EACH;AAGA,EAAA,OAAA,CAAQ,KAAA,GAAQE,QAAAA,CAAQ,IAAA,CAAK,OAAO,OAAO,IAAA,EAAM;AAC/C,IAAA,MAAM,IAAA,GAAO,MAAM,CAAC,CAAA;AAEpB,IAAA,IAAI,KAAK,UAAA,CAAW,IAAI,KAAK,IAAA,CAAK,QAAA,CAAS,IAAI,CAAA,EAAG;AAClD,IAAA,MAAA,CAAO,UAAU,IAAA,CAAK;AAAA,MACpB,IAAA;AAAA,MACA,MAAA,EAAA,CAAS,KAAA,CAAM,CAAC,CAAA,IAAK,IAAI,IAAA,EAAK;AAAA,MAC9B,IAAA,EAAM;AAAA,KACP,CAAA;AAAA,EACH;AAGA,EAAA,IAAI,OAAA,CAAQ,QAAA,CAAS,MAAM,CAAA,EAAG;AAC5B,IAAA,MAAA,CAAO,cAAA,CAAe,KAAK,YAAY,CAAA;AAAA,EACzC;AACA,EAAA,IAAI,OAAA,CAAQ,QAAA,CAAS,OAAO,CAAA,EAAG;AAC7B,IAAA,MAAA,CAAO,cAAA,CAAe,KAAK,OAAO,CAAA;AAAA,EACpC;AAEA,EAAA,OAAO,MAAA;AACT;AAEO,SAAS,mBAAmB,OAAA,EAAiD;AAClF,EAAA,MAAM,MAAA,GAA4B;AAAA,IAChC,SAAS,EAAC;AAAA,IACV,OAAO,EAAC;AAAA,IACR,WAAW,EAAC;AAAA,IACZ,YAAY,EAAC;AAAA,IACb,gBAAgB;AAAC,GACnB;AAEA,EAAA,MAAM,YAAA,uBAAmB,GAAA,EAAoB;AAC7C,EAAA,MAAM,WAAA,uBAAkB,GAAA,EAAoB;AAE5C,EAAA,KAAA,MAAW,KAAK,OAAA,EAAS;AACvB,IAAA,KAAA,MAAW,GAAA,IAAO,EAAE,OAAA,EAAS;AAC3B,MAAA,YAAA,CAAa,IAAI,GAAA,EAAA,CAAM,YAAA,CAAa,IAAI,GAAG,CAAA,IAAK,KAAK,CAAC,CAAA;AAAA,IACxD;AACA,IAAA,MAAA,CAAO,KAAA,CAAM,IAAA,CAAK,GAAG,CAAA,CAAE,KAAK,CAAA;AAC5B,IAAA,MAAA,CAAO,SAAA,CAAU,IAAA,CAAK,GAAG,CAAA,CAAE,SAAS,CAAA;AACpC,IAAA,MAAA,CAAO,UAAA,CAAW,IAAA,CAAK,GAAG,CAAA,CAAE,UAAU,CAAA;AACtC,IAAA,KAAA,MAAW,CAAA,IAAK,EAAE,cAAA,EAAgB;AAChC,MAAA,WAAA,CAAY,IAAI,CAAA,EAAA,CAAI,WAAA,CAAY,IAAI,CAAC,CAAA,IAAK,KAAK,CAAC,CAAA;AAAA,IAClD;AAAA,EACF;AAEA,EAAA,MAAA,CAAO,OAAA,GAAU,KAAA,CAAM,IAAA,CAAK,YAAA,CAAa,OAAA,EAAS,CAAA,CAC/C,IAAA,CAAK,CAAC,CAAA,EAAG,CAAA,KAAM,CAAA,CAAE,CAAC,CAAA,GAAI,CAAA,CAAE,CAAC,CAAC,CAAA,CAC1B,KAAA,CAAM,CAAA,EAAG,EAAE,CAAA,CACX,GAAA,CAAI,CAAC,CAAC,GAAG,CAAA,KAAM,GAAG,CAAA;AAErB,EAAA,MAAA,CAAO,cAAA,GAAiB,KAAA,CAAM,IAAA,CAAK,WAAA,CAAY,OAAA,EAAS,CAAA,CACrD,IAAA,CAAK,CAAC,CAAA,EAAG,CAAA,KAAM,CAAA,CAAE,CAAC,CAAA,GAAI,CAAA,CAAE,CAAC,CAAC,CAAA,CAC1B,KAAA,CAAM,CAAA,EAAG,EAAE,CAAA,CACX,GAAA,CAAI,CAAC,CAAC,CAAC,CAAA,KAAM,CAAC,CAAA;AAEjB,EAAA,MAAA,CAAO,KAAA,GAAQ,MAAA,CAAO,KAAA,CAAM,KAAA,CAAM,GAAG,GAAG,CAAA;AACxC,EAAA,MAAA,CAAO,SAAA,GAAY,MAAA,CAAO,SAAA,CAAU,KAAA,CAAM,GAAG,GAAG,CAAA;AAChD,EAAA,MAAA,CAAO,UAAA,GAAa,MAAA,CAAO,UAAA,CAAW,KAAA,CAAM,GAAG,EAAE,CAAA;AAEjD,EAAA,OAAO,MAAA;AACT;;;AC5GA,IAAM,UAAA,GAAa,8BAAA;AACnB,IAAMD,QAAAA,GAAU,kCAAA;AAChB,IAAMC,QAAAA,GAAU,sFAAA;AAET,SAAS,YAAA,CAAa,UAAkB,OAAA,EAAiC;AAC9E,EAAA,MAAM,MAAA,GAAyB;AAAA,IAC7B,SAAS,EAAC;AAAA,IACV,OAAO,EAAC;AAAA,IACR,WAAW,EAAC;AAAA,IACZ,gBAAgB;AAAC,GACnB;AAEA,EAAA,IAAI,KAAA;AAGJ,EAAA,OAAA,CAAQ,KAAA,GAAQ,UAAA,CAAW,IAAA,CAAK,OAAO,OAAO,IAAA,EAAM;AAClD,IAAA,MAAA,CAAO,OAAA,CAAQ,IAAA,CAAK,KAAA,CAAM,CAAC,CAAC,CAAA;AAAA,EAC9B;AAGA,EAAA,OAAA,CAAQ,KAAA,GAAQD,QAAAA,CAAQ,IAAA,CAAK,OAAO,OAAO,IAAA,EAAM;AAC/C,IAAA,MAAA,CAAO,MAAM,IAAA,CAAK;AAAA,MAChB,IAAA,EAAM,KAAA;AAAA,MACN,IAAA,EAAM,MAAM,CAAC,CAAA;AAAA,MACb,IAAA,EAAM;AAAA,KACP,CAAA;AAAA,EACH;AAGA,EAAA,OAAA,CAAQ,KAAA,GAAQC,QAAAA,CAAQ,IAAA,CAAK,OAAO,OAAO,IAAA,EAAM;AAC/C,IAAA,MAAA,CAAO,UAAU,IAAA,CAAK;AAAA,MACpB,IAAA,EAAM,MAAM,CAAC,CAAA;AAAA,MACb,IAAA,EAAM;AAAA,KACP,CAAA;AAAA,EACH;AAGA,EAAA,IAAI,6BAAA,CAA8B,IAAA,CAAK,OAAO,CAAA,EAAG;AAC/C,IAAA,MAAA,CAAO,cAAA,CAAe,KAAK,iBAAiB,CAAA;AAAA,EAC9C;AAEA,EAAA,OAAO,MAAA;AACT;AAEO,SAAS,gBAAgB,OAAA,EAA2C;AACzE,EAAA,MAAM,MAAA,GAAyB;AAAA,IAC7B,SAAS,EAAC;AAAA,IACV,OAAO,EAAC;AAAA,IACR,WAAW,EAAC;AAAA,IACZ,gBAAgB;AAAC,GACnB;AAEA,EAAA,MAAM,YAAA,uBAAmB,GAAA,EAAoB;AAE7C,EAAA,KAAA,MAAW,KAAK,OAAA,EAAS;AACvB,IAAA,KAAA,MAAW,GAAA,IAAO,EAAE,OAAA,EAAS;AAC3B,MAAA,YAAA,CAAa,IAAI,GAAA,EAAA,CAAM,YAAA,CAAa,IAAI,GAAG,CAAA,IAAK,KAAK,CAAC,CAAA;AAAA,IACxD;AACA,IAAA,MAAA,CAAO,KAAA,CAAM,IAAA,CAAK,GAAG,CAAA,CAAE,KAAK,CAAA;AAC5B,IAAA,MAAA,CAAO,SAAA,CAAU,IAAA,CAAK,GAAG,CAAA,CAAE,SAAS,CAAA;AACpC,IAAA,MAAA,CAAO,cAAA,CAAe,IAAA,CAAK,GAAG,CAAA,CAAE,cAAc,CAAA;AAAA,EAChD;AAEA,EAAA,MAAA,CAAO,OAAA,GAAU,KAAA,CAAM,IAAA,CAAK,YAAA,CAAa,OAAA,EAAS,CAAA,CAC/C,IAAA,CAAK,CAAC,CAAA,EAAG,CAAA,KAAM,CAAA,CAAE,CAAC,CAAA,GAAI,CAAA,CAAE,CAAC,CAAC,CAAA,CAC1B,KAAA,CAAM,CAAA,EAAG,EAAE,CAAA,CACX,GAAA,CAAI,CAAC,CAAC,GAAG,CAAA,KAAM,GAAG,CAAA;AAGrB,EAAA,MAAA,CAAO,iBAAiB,CAAC,GAAG,IAAI,GAAA,CAAI,MAAA,CAAO,cAAc,CAAC,CAAA;AAE1D,EAAA,OAAO,MAAA;AACT;;;AC7DA,IAAM,cAAA,uBAAqB,GAAA,CAAI;AAAA;AAAA,EAE7B,IAAA;AAAA,EAAM,KAAA;AAAA,EAAO,QAAA;AAAA,EAAU,MAAA;AAAA,EAAQ,IAAA;AAAA,EAAM,MAAA;AAAA,EAAQ,QAAA;AAAA,EAAU,MAAA;AAAA,EAAQ,UAAA;AAAA,EAC/D,SAAA;AAAA,EAAW,aAAA;AAAA,EAAe,MAAA;AAAA,EAAQ,aAAA;AAAA,EAAe,WAAA;AAAA,EAAa,WAAA;AAAA,EAC9D,SAAA;AAAA,EAAW,UAAA;AAAA,EAAY,YAAA;AAAA,EAAc,WAAA;AAAA,EAAa,iBAAA;AAAA,EAAmB,SAAA;AAAA,EACrE,QAAA;AAAA,EAAU,MAAA;AAAA,EAAQ,QAAA;AAAA,EAAU,KAAA;AAAA,EAAO,SAAA;AAAA,EAAW,QAAA;AAAA,EAAU,KAAA;AAAA,EAAO,SAAA;AAAA,EAC/D,QAAA;AAAA,EAAU,UAAA;AAAA,EAAY,QAAA;AAAA,EAAU,MAAA;AAAA,EAAQ,IAAA;AAAA,EAAM,QAAA;AAAA,EAAU,QAAA;AAAA,EAAU,MAAA;AAAA,EAClE,KAAA;AAAA,EAAO,MAAA;AAAA,EAAQ,SAAA;AAAA,EAAW,WAAA;AAAA,EAAa,YAAA;AAAA,EAAc,OAAA;AAAA,EAAS,QAAA;AAAA,EAC9D,WAAA;AAAA,EAAa,UAAA;AAAA,EAAY,SAAA;AAAA,EAAW,YAAA;AAAA,EAAc,UAAA;AAAA,EAAY,QAAA;AAAA,EAC9D,SAAA;AAAA,EAAW,IAAA;AAAA,EAAM,KAAA;AAAA,EAAO,OAAA;AAAA,EAAS,SAAA;AAAA,EAAW,UAAA;AAAA;AAAA,EAE5C,UAAA;AAAA,EAAY,SAAA;AAAA,EAAW,UAAA;AAAA,EAAY,QAAA;AAAA,EAAU,MAAA;AAAA,EAAQ;AACvD,CAAC,CAAA;AAKD,SAAS,iBAAiB,QAAA,EAA0B;AAClD,EAAA,IAAI,CAAC,UAAU,OAAO,KAAA;AACtB,EAAA,MAAM,EAAA,GAAK,SAAS,WAAA,EAAY;AAChC,EAAA,IAAI,GAAG,QAAA,CAAS,MAAM,KAAK,EAAA,CAAG,QAAA,CAAS,MAAM,CAAA,IAAK,EAAA,CAAG,SAAS,IAAI,CAAA,IAAK,GAAG,QAAA,CAAS,MAAM,KAAK,EAAA,CAAG,QAAA,CAAS,IAAI,CAAA,EAAG;AAC/G,IAAA,IAAI,EAAA,CAAG,QAAA,CAAS,MAAM,CAAA,EAAG,OAAO,OAAA;AAChC,IAAA,IAAI,EAAA,CAAG,SAAS,UAAU,CAAA,IAAK,GAAG,QAAA,CAAS,KAAK,GAAG,OAAO,OAAA;AAC1D,IAAA,OAAO,KAAA;AAAA,EACT;AACA,EAAA,OAAO,KAAA;AACT;AAQO,SAAS,eAAA,CACd,aAAA,EACA,aAAA,EACA,OAAA,EACA,OAAA,EACW;AACX,EAAA,MAAM,WAAsB,EAAC;AAG7B,EAAA,MAAM,eAAA,GAAkB,IAAI,GAAA,CAAI,cAAc,CAAA;AAS9C,EAAA,IAAI,aAAa,aAAA,EAAe;AAC9B,IAAA,KAAA,MAAW,GAAA,IAAO,cAAc,OAAA,EAAS;AACvC,MAAA,IAAI,MAAA;AACJ,MAAA,IAAI,KAAA,GAAQ,CAAA;AACZ,MAAA,IAAI,QAAA,GAAW,KAAA;AAEf,MAAA,IAAI,OAAO,QAAQ,QAAA,EAAU;AAC3B,QAAA,MAAA,GAAS,GAAA;AAAA,MACX,WAAW,GAAA,IAAO,OAAO,GAAA,KAAQ,QAAA,IAAY,YAAY,GAAA,EAAK;AAC5D,QAAA,MAAM,MAAA,GAAS,GAAA;AACf,QAAA,MAAA,GAAS,MAAA,CAAO,MAAA;AAChB,QAAA,KAAA,GAAQ,OAAO,KAAA,IAAS,CAAA;AACxB,QAAA,QAAA,GAAW,gBAAA,CAAiB,MAAA,CAAO,IAAA,IAAQ,EAAE,CAAA;AAAA,MAC/C,CAAA,MAAO;AACL,QAAA;AAAA,MACF;AAGA,MAAA,IAAI,eAAA,CAAgB,GAAA,CAAI,MAAA,CAAO,WAAA,EAAa,CAAA,EAAG;AAE/C,MAAA,QAAA,CAAS,IAAA,CAAK;AAAA,QACZ,OAAA,EAAS,MAAA;AAAA,QACT,MAAA,EAAQ,QAAA;AAAA,QACR,QAAA;AAAA,QACA,MAAA,EAAQ,CAAA,GAAA,CAAO,KAAA,GAAQ,CAAA,IAAK,GAAA;AAAA,QAC5B,OAAA,EAAS,YAAY,KAAK,CAAA,MAAA;AAAA,OAC3B,CAAA;AAAA,IACH;AAAA,EACF;AAGA,EAAA,IAAI,WAAW,aAAA,EAAe;AAC5B,IAAA,KAAA,MAAW,QAAA,IAAY,cAAc,KAAA,EAAO;AAC1C,MAAA,MAAM,OAAO,QAAA,CAAS,IAAA;AACtB,MAAA,MAAM,OAAO,QAAA,CAAS,IAAA;AACtB,MAAA,MAAM,QAAA,GAAW,gBAAA,CAAiB,QAAA,CAAS,IAAA,IAAQ,EAAE,CAAA;AAGrD,MAAA,IAAI,CAAC,MAAA,EAAQ,OAAA,EAAS,WAAA,EAAa,YAAA,EAAc,WAAW,SAAS,CAAA,CAAE,QAAA,CAAS,IAAI,CAAA,EAAG;AAEvF,MAAA,QAAA,CAAS,IAAA,CAAK;AAAA,QACZ,OAAA,EAAS,IAAA;AAAA,QACT,MAAA,EAAQ,kBAAA;AAAA,QACR,QAAA;AAAA,QACA,MAAA,EAAQ,GAAA;AAAA,QACR,OAAA,EAAS,GAAG,IAAI,CAAA,YAAA;AAAA,OACjB,CAAA;AAAA,IACH;AAAA,EACF;AAGA,EAAA,IAAI,eAAe,aAAA,EAAe;AAChC,IAAA,KAAA,MAAW,IAAA,IAAQ,cAAc,SAAA,EAAW;AAC1C,MAAA,MAAM,OAAO,IAAA,CAAK,IAAA;AAClB,MAAA,MAAM,QAAA,GAAW,gBAAA,CAAiB,IAAA,CAAK,IAAA,IAAQ,EAAE,CAAA;AAGjD,MAAA,IAAI,CAAC,QAAQ,OAAA,EAAS,WAAA,EAAa,YAAY,CAAA,CAAE,QAAA,CAAS,IAAI,CAAA,EAAG;AAEjE,MAAA,QAAA,CAAS,IAAA,CAAK;AAAA,QACZ,OAAA,EAAS,IAAA;AAAA,QACT,MAAA,EAAQ,oBAAA;AAAA,QACR,QAAA;AAAA,QACA,MAAA,EAAQ,GAAA;AAAA,QACR,OAAA,EAAS;AAAA,OACV,CAAA;AAAA,IACH;AAAA,EACF;AAGA,EAAA,IAAI,gBAAgB,aAAA,IAAiB,KAAA,CAAM,OAAA,CAAQ,aAAA,CAAc,UAAU,CAAA,EAAG;AAC5E,IAAA,KAAA,MAAW,GAAA,IAAO,cAAc,UAAA,EAAY;AAC1C,MAAA,MAAM,aAAA,GAAgB,GAAA,CAAI,IAAA,EAAK,CAAE,KAAA,CAAM,IAAI,CAAA,CAAE,CAAC,CAAA,CAAE,KAAA,CAAM,CAAA,EAAG,GAAG,CAAA;AAC5D,MAAA,IAAI,aAAA,CAAc,SAAS,EAAA,EAAI;AAC7B,QAAA,QAAA,CAAS,IAAA,CAAK;AAAA,UACZ,OAAA,EAAS,aAAA;AAAA,UACT,MAAA,EAAQ,WAAA;AAAA,UACR,QAAA,EAAU,KAAA;AAAA,UACV,MAAA,EAAQ,GAAA;AAAA,UACR,OAAA,EAAS;AAAA,SACV,CAAA;AAAA,MACH;AAAA,IACF;AAAA,EACF;AAGA,EAAA,IAAI,qBAAqB,aAAA,IAAiB,KAAA,CAAM,OAAA,CAAQ,aAAA,CAAc,eAAe,CAAA,EAAG;AACtF,IAAA,KAAA,MAAW,EAAA,IAAM,cAAc,eAAA,EAAiB;AAC9C,MAAA,MAAM,SAAS,OAAO,EAAA,KAAO,QAAA,GAAW,EAAA,GAAM,GAA8B,SAAA,IAAa,EAAA;AACzF,MAAA,IAAI,MAAA,EAAQ;AACV,QAAA,QAAA,CAAS,IAAA,CAAK;AAAA,UACZ,OAAA,EAAS,MAAA;AAAA,UACT,MAAA,EAAQ,iBAAA;AAAA,UACR,QAAA,EAAU,KAAA;AAAA,UACV,MAAA,EAAQ,GAAA;AAAA,UACR,OAAA,EAAS;AAAA,SACV,CAAA;AAAA,MACH;AAAA,IACF;AAAA,EACF;AAGA,EAAA,IAAI,uBAAuB,aAAA,IAAiB,KAAA,CAAM,OAAA,CAAQ,aAAA,CAAc,iBAAiB,CAAA,EAAG;AAC1F,IAAA,KAAA,MAAW,OAAA,IAAW,cAAc,iBAAA,EAAmB;AACrD,MAAA,MAAM,cAAc,OAAO,OAAA,KAAY,QAAA,GAAW,OAAA,GAAW,QAAiC,OAAA,IAAW,EAAA;AACzG,MAAA,IAAI,WAAA,EAAa;AACf,QAAA,QAAA,CAAS,IAAA,CAAK;AAAA,UACZ,OAAA,EAAS,IAAI,WAAW,CAAA,CAAA;AAAA,UACxB,MAAA,EAAQ,kBAAA;AAAA,UACR,QAAA,EAAU,KAAA;AAAA,UACV,MAAA,EAAQ,CAAA;AAAA,UACR,OAAA,EAAS;AAAA,SACV,CAAA;AAAA,MACH;AAAA,IACF;AAAA,EACF;AAGA,EAAA,MAAM,aAAA,GAAgB,gBAAA,IAAoB,aAAA,GACtC,aAAA,CAAc,cAAA,GACd,yBAAA,IAA6B,aAAA,GAC1B,aAAA,CAA0G,uBAAA,IAA2B,EAAC,GACvI,EAAC;AAEP,EAAA,KAAA,MAAW,SAAS,aAAA,EAAe;AACjC,IAAA,IAAI,OAAA;AACJ,IAAA,IAAI,QAAA,GAAW,KAAA;AAEf,IAAA,IAAI,OAAO,UAAU,QAAA,EAAU;AAC7B,MAAA,OAAA,GAAU,KAAA;AAAA,IACZ,WAAW,KAAA,IAAS,OAAO,KAAA,KAAU,QAAA,IAAY,aAAa,KAAA,EAAO;AACnE,MAAA,MAAM,MAAA,GAAS,KAAA;AACf,MAAA,OAAA,GAAU,MAAA,CAAO,OAAA;AACjB,MAAA,QAAA,GAAW,gBAAA,CAAiB,MAAA,CAAO,IAAA,IAAQ,EAAE,CAAA;AAAA,IAC/C,CAAA,MAAO;AACL,MAAA;AAAA,IACF;AAEA,IAAA,QAAA,CAAS,IAAA,CAAK;AAAA,MACZ,OAAA,EAAS,OAAA;AAAA,MACT,MAAA,EAAQ,gBAAA;AAAA,MACR,QAAA;AAAA,MACA,MAAA,EAAQ,GAAA;AAAA,MACR,OAAA,EAAS;AAAA,KACV,CAAA;AAAA,EACH;AAGA,EAAA,MAAM,IAAA,uBAAW,GAAA,EAAY;AAC7B,EAAA,MAAM,iBAA4B,EAAC;AACnC,EAAA,KAAA,MAAW,MAAM,QAAA,EAAU;AACzB,IAAA,MAAM,GAAA,GAAM,EAAA,CAAG,OAAA,CAAQ,WAAA,EAAY;AACnC,IAAA,IAAI,CAAC,IAAA,CAAK,GAAA,CAAI,GAAG,CAAA,EAAG;AAClB,MAAA,IAAA,CAAK,IAAI,GAAG,CAAA;AACZ,MAAA,cAAA,CAAe,KAAK,EAAE,CAAA;AAAA,IACxB;AAAA,EACF;AAEA,EAAA,OAAO,cAAA;AACT;;;AChMO,IAAM,cAAA,GAAN,cAA6B,KAAA,CAAM;AAAA,EACxC,WAAA,CACE,OAAA,EACgB,MAAA,EACA,KAAA,EAChB;AACA,IAAA,KAAA,CAAM,OAAO,CAAA;AAHG,IAAA,IAAA,CAAA,MAAA,GAAA,MAAA;AACA,IAAA,IAAA,CAAA,KAAA,GAAA,KAAA;AAGhB,IAAA,IAAA,CAAK,IAAA,GAAO,gBAAA;AAAA,EACd;AACF,CAAA;AAeO,SAAS,qBAAqB,MAAA,EAA0C;AAC7E,EAAA,MAAM,QAAwB,EAAC;AAC/B,EAAA,MAAM,IAAA,GAAO,CAAC,KAAA,EAAe,OAAA,EAAiB,QAAgB,KAAA,KAAwB;AACpF,IAAA,IAAI,MAAA,IAAU,OAAA,IAAW,KAAA,IAAS,CAAC,MAAM,IAAA,CAAK,CAAC,CAAA,KAAM,CAAA,CAAE,OAAA,KAAY,OAAA,IAAW,CAAA,CAAE,KAAA,KAAU,KAAK,CAAA,EAAG;AAChG,MAAA,KAAA,CAAM,KAAK,EAAE,KAAA,EAAO,OAAA,EAAS,MAAA,EAAQ,OAAO,CAAA;AAAA,IAC9C;AAAA,EACF,CAAA;AAEA,EAAA,IAAI,QAAQ,MAAA,EAAQ;AAClB,IAAA,IAAA,CAAK,QAAA,EAAU,OAAO,OAAA,IAAW,2BAAA,EAA6B,OAAO,MAAA,EAAQ,MAAA,CAAO,SAAS,aAAa,CAAA;AAAA,EAC5G;AAEA,EAAA,IAAA,CAAK,QAAA,EAAU,QAAQ,GAAA,CAAI,YAAA,IAAgB,QAAQ,GAAA,CAAI,eAAA,IAAmB,IAAI,OAAA,CAAQ,GAAA,CAAI,eAAe,OAAA,CAAQ,GAAA,CAAI,kBAAkB,EAAA,EAAI,OAAA,CAAQ,IAAI,SAAA,IAAa,OAAA,CAAQ,GAAA,CAAI,aAAA,IAAiB,EAAE,CAAA;AAEnM,EAAA,IAAA,CAAK,WAAA,EAAa,QAAQ,GAAA,CAAI,kBAAA,IAAsB,QAAQ,GAAA,CAAI,gBAAA,IAAoB,IAAI,OAAA,CAAQ,GAAA,CAAI,qBAAqB,OAAA,CAAQ,GAAA,CAAI,mBAAmB,EAAA,EAAI,OAAA,CAAQ,IAAI,eAAA,IAAmB,OAAA,CAAQ,GAAA,CAAI,gBAAA,IAAoB,EAAE,CAAA;AAE7N,EAAA,IAAA,CAAK,QAAA,EAAU,uCAAuC,OAAA,CAAQ,GAAA,CAAI,kBAAkB,EAAA,EAAI,OAAA,CAAQ,GAAA,CAAI,YAAA,IAAgB,mCAAmC,CAAA;AAEvJ,EAAA,IAAA,CAAK,YAAA,EAAc,gCAAgC,OAAA,CAAQ,GAAA,CAAI,sBAAsB,EAAA,EAAI,OAAA,CAAQ,GAAA,CAAI,gBAAA,IAAoB,mCAAmC,CAAA;AAE5J,EAAA,IAAI,OAAA,CAAQ,IAAI,gBAAA,EAAkB;AAChC,IAAA,MAAM,KAAK,KAAA,CAAM,IAAA,CAAK,CAAC,CAAA,KAAM,CAAA,CAAE,UAAU,YAAY,CAAA;AACrD,IAAA,IAAI,EAAA,EAAI;AACN,MAAA,MAAM,OAAO,KAAA,CAAM,MAAA,CAAO,CAAC,CAAA,KAAM,MAAM,EAAE,CAAA;AACzC,MAAA,OAAO,CAAC,EAAA,EAAI,GAAG,IAAI,CAAA;AAAA,IACrB;AAAA,EACF;AACA,EAAA,OAAO,KAAA;AACT;AAKA,IAAM,uBAAA,GAA0B,IAAA;AAChC,IAAI,aAAA,GAAgB,CAAA;AAEpB,eAAe,UAAA,GAA4B;AACzC,EAAA,MAAM,IAAA,GAAO,aAAA,GAAgB,uBAAA,GAA0B,IAAA,CAAK,GAAA,EAAI;AAChE,EAAA,IAAI,IAAA,GAAO,CAAA,EAAG,MAAM,IAAI,OAAA,CAAQ,CAACC,QAAAA,KAAY,UAAA,CAAWA,QAAAA,EAAS,IAAI,CAAC,CAAA;AACtE,EAAA,aAAA,GAAgB,KAAK,GAAA,EAAI;AAC3B;AAEO,SAAS,gBAAgB,MAAA,EAAqC;AACnE,EAAA,MAAM,KAAA,GAAQ,qBAAqB,MAAM,CAAA;AACzC,EAAA,MAAM,OAAA,GAAU,MAAM,CAAC,CAAA;AACvB,EAAA,IAAI,CAAC,OAAA,EAAS;AACZ,IAAA,MAAM,IAAI,cAAA;AAAA,MACR;AAAA,KACF;AAAA,EACF;AACA,EAAe,OAAA,CAAQ;AACvB,EAAgB,OAAA,CAAQ;AACxB,EAAA,MAAM,QAAQ,OAAA,CAAQ,KAAA;AAEtB,EAAA,eAAe,IAAA,CACb,UACA,OAAA,EACwB;AACxB,IAAA,MAAM,WAAA,GAAc,OAAA,EAAS,WAAA,IAAe,MAAA,EAAQ,WAAA,IAAe,GAAA;AACnE,IAAA,MAAM,SAAA,GAAY,OAAA,EAAS,SAAA,IAAa,MAAA,EAAQ,SAAA,IAAa,SAAS,OAAA,CAAQ,GAAA,CAAI,cAAA,IAAkB,OAAA,EAAS,EAAE,CAAA;AAE/G,IAAA,MAAM,WAAqB,EAAC;AAC5B,IAAA,IAAI,SAAA,GAAmC,IAAA;AACvC,IAAA,MAAM,SAAA,mBAAY,IAAI,GAAA,CAAI,CAAC,GAAA,EAAK,KAAK,GAAA,EAAK,GAAA,EAAK,GAAA,EAAK,GAAG,CAAC,CAAA;AAKxD,IAAA,MAAM,kBAAA,GAAqB,MAAA,CAAO,OAAA,CAAQ,GAAA,CAAI,0BAA0B,GAAO,CAAA;AAC/E,IAAA,MAAM,gBAAA,GAAmB,CAAA;AACzB,IAAA,KAAA,IAAS,KAAA,GAAQ,CAAA,EAAG,KAAA,IAAS,gBAAA,EAAkB,KAAA,EAAA,EAAS;AACtD,MAAA,IAAI,QAAQ,CAAA,EAAG;AAGb,QAAA,QAAA,CAAS,IAAA,CAAK,QAAA,IAAY,KAAA,GAAQ,CAAA,CAAA,GAAK,2DAAsD,CAAA;AAC7F,QAAA,MAAM,IAAI,OAAA,CAAQ,CAACA,aAAY,UAAA,CAAWA,QAAAA,EAAS,GAAM,CAAC,CAAA;AAAA,MAC5D;AACA,MAAA,KAAA,MAAW,YAAY,KAAA,EAAO;AAC9B,QAAA,IAAI;AACF,UAAA,MAAM,OAAA,GAAU;AAAA,YACd,cAAA,EAAgB,kBAAA;AAAA,YAChB,eAAA,EAAiB,CAAA,OAAA,EAAU,QAAA,CAAS,MAAM,CAAA;AAAA,WAC5C;AACA,UAAA,MAAM,OAAA,GAAU;AAAA,YACd,OAAO,QAAA,CAAS,KAAA;AAAA,YAChB,QAAA;AAAA,YACA,WAAA;AAAA,YACA,UAAA,EAAY;AAAA,WACd;AACA,UAAA,MAAM,UAAA,EAAW;AACjB,UAAA,MAAM,UAAU,MAAyB,KAAA,CAAM,CAAA,EAAG,QAAA,CAAS,OAAO,CAAA,iBAAA,CAAA,EAAqB;AAAA,YACrF,MAAA,EAAQ,MAAA;AAAA,YACR,OAAA,EAAS;AAAA,cACP,cAAA,EAAgB,kBAAA;AAAA,cAChB,eAAA,EAAiB,CAAA,OAAA,EAAU,QAAA,CAAS,MAAM,CAAA;AAAA,aAC5C;AAAA,YACA,IAAA,EAAM,KAAK,SAAA,CAAU;AAAA,cACnB,OAAO,QAAA,CAAS,KAAA;AAAA,cAChB,QAAA;AAAA,cACA,WAAA;AAAA,cACA,UAAA,EAAY;AAAA,aACb,CAAA;AAAA,YACD,MAAA,EAAQ,WAAA,CAAY,OAAA,CAAQ,kBAAkB;AAAA,WAC/C,CAAA;AAGD,UAAA,IAAI,QAAA;AACJ,UAAA,IAAI;AACF,YAAA,QAAA,GAAW,MAAM,OAAA,EAAQ;AAAA,UAC3B,SAAS,MAAA,EAAQ;AACf,YAAA,QAAA,CAAS,IAAA,CAAK,CAAA,EAAG,QAAA,CAAS,KAAK,CAAA,iBAAA,EAAoB,MAAA,YAAkB,KAAA,GAAQ,MAAA,CAAO,OAAA,GAAU,MAAA,CAAO,MAAM,CAAC,CAAA,sBAAA,CAAmB,CAAA;AAC/H,YAAA,MAAM,IAAI,OAAA,CAAQ,CAAC,MAAM,UAAA,CAAW,CAAA,EAAG,GAAK,CAAC,CAAA;AAC7C,YAAA,aAAA,GAAgB,KAAK,GAAA,EAAI;AACzB,YAAA,QAAA,GAAW,MAAM,OAAA,EAAQ;AAAA,UAC3B;AACA,UAAA,IAAI,CAAC,SAAS,EAAA,EAAI;AAChB,YAAA,MAAM,OAAO,MAAM,QAAA,CAAS,MAAK,CAAE,KAAA,CAAM,MAAM,EAAE,CAAA;AACjD,YAAA,MAAM,MAAM,IAAI,cAAA;AAAA,cACd,CAAA,CAAA,EAAI,QAAA,CAAS,KAAK,CAAA,iBAAA,EAAoB,SAAS,MAAM,CAAA,CAAA,EAAI,QAAA,CAAS,UAAU,CAAA,QAAA,EAAM,IAAA,CAAK,KAAA,CAAM,CAAA,EAAG,GAAG,CAAC,CAAA,CAAA;AAAA,cACpG,QAAA,CAAS;AAAA,aACX;AACA,YAAA,IAAI,QAAA,CAAS,WAAW,GAAA,EAAK;AAG3B,cAAA,MAAM,aAAA,GAAgB,QAAA,CAAS,OAAA,CAAQ,GAAA,CAAI,aAAa,CAAA;AACxD,cAAA,MAAM,eAAe,IAAA,CAAK,GAAA;AAAA,gBACxB,GAAA;AAAA,gBACA,IAAA,CAAK,GAAA,CAAI,IAAA,EAAA,CAAS,MAAA,CAAO,QAAA,CAAS,MAAA,CAAO,aAAa,CAAC,CAAA,GAAI,MAAA,CAAO,aAAa,CAAA,GAAI,MAAM,GAAK;AAAA,eAChG;AACA,cAAA,QAAA,CAAS,IAAA,CAAK,CAAA,EAAG,QAAA,CAAS,KAAK,CAAA,sCAAA,EAAoC,KAAK,KAAA,CAAM,YAAA,GAAe,GAAI,CAAC,CAAA,CAAA,CAAG,CAAA;AACrG,cAAA,MAAM,IAAI,OAAA,CAAQ,CAACA,aAAY,UAAA,CAAWA,QAAAA,EAAS,YAAY,CAAC,CAAA;AAChE,cAAA,aAAA,GAAgB,KAAK,GAAA,EAAI;AACzB,cAAA,MAAM,QAAQ,MAAM,KAAA,CAAM,CAAA,EAAG,QAAA,CAAS,OAAO,CAAA,iBAAA,CAAA,EAAqB;AAAA,gBAChE,MAAA,EAAQ,MAAA;AAAA,gBACR,OAAA;AAAA,gBACA,IAAA,EAAM,IAAA,CAAK,SAAA,CAAU,OAAO,CAAA;AAAA,gBAC5B,MAAA,EAAQ,WAAA,CAAY,OAAA,CAAQ,kBAAkB;AAAA,eAC/C,CAAA;AACD,cAAA,IAAI,CAAC,KAAA,CAAM,EAAA,EAAI,MAAM,GAAA;AACrB,cAAA,MAAM,SAAA,GAAY,MAAM,KAAA,CAAM,IAAA,EAAK;AAKnC,cAAA,MAAM,gBAAgB,SAAA,CAAU,OAAA,GAAU,CAAC,CAAA,EAAG,SAAS,OAAA,IAAW,EAAA;AAClE,cAAA,IAAI,CAAC,aAAA,CAAc,IAAA,EAAK,EAAG,MAAM,GAAA;AACjC,cAAA,OAAO;AAAA,gBACL,OAAA,EAAS,aAAA;AAAA,gBACT,KAAA,EAAO,SAAA,CAAU,KAAA,IAAS,QAAA,CAAS,KAAA;AAAA,gBACnC,UAAU,QAAA,CAAS,KAAA;AAAA,gBACnB,QAAA,EAAU,SAAS,KAAA,EAAM;AAAA,gBACzB,OAAO,SAAA,CAAU,KAAA;AAAA,gBACjB,YAAA,EAAc,SAAA,CAAU,OAAA,GAAU,CAAC,CAAA,EAAG;AAAA,eACxC;AAAA,YACF;AACA,YAAA,IAAI,SAAA,CAAU,GAAA,CAAI,QAAA,CAAS,MAAM,CAAA,EAAG;AAClC,cAAA,MAAM,IAAI,OAAA,CAAQ,CAAC,MAAM,UAAA,CAAW,CAAA,EAAG,GAAI,CAAC,CAAA;AAC5C,cAAA,MAAM,QAAQ,MAAM,KAAA,CAAM,CAAA,EAAG,QAAA,CAAS,OAAO,CAAA,iBAAA,CAAA,EAAqB;AAAA,gBAChE,MAAA,EAAQ,WAAA,CAAY,OAAA,CAAQ,kBAAkB,CAAA;AAAA,gBAC9C,MAAA,EAAQ,MAAA;AAAA,gBACR,OAAA,EAAS;AAAA,kBACP,cAAA,EAAgB,kBAAA;AAAA,kBAChB,eAAA,EAAiB,CAAA,OAAA,EAAU,QAAA,CAAS,MAAM,CAAA;AAAA,iBAC5C;AAAA,gBACA,IAAA,EAAM,KAAK,SAAA,CAAU;AAAA,kBACnB,OAAO,QAAA,CAAS,KAAA;AAAA,kBAChB,QAAA;AAAA,kBACA,WAAA;AAAA,kBACA,UAAA,EAAY;AAAA,iBACb;AAAA,eACF,CAAA;AACD,cAAA,IAAI,CAAC,KAAA,CAAM,EAAA,EAAI,MAAM,GAAA;AACrB,cAAA,MAAM,SAAA,GAAY,MAAM,KAAA,CAAM,IAAA,EAAK;AAKnC,cAAA,MAAM,eAAe,SAAA,CAAU,OAAA,GAAU,CAAC,CAAA,EAAG,SAAS,OAAA,IAAW,EAAA;AACjE,cAAA,OAAO;AAAA,gBACL,OAAA,EAAS,YAAA;AAAA,gBACT,KAAA,EAAO,SAAA,CAAU,KAAA,IAAS,QAAA,CAAS,KAAA;AAAA,gBACnC,UAAU,QAAA,CAAS,KAAA;AAAA,gBACnB,QAAA,EAAU,SAAS,KAAA,EAAM;AAAA,gBACzB,OAAO,SAAA,CAAU,KAAA;AAAA,gBACjB,YAAA,EAAc,SAAA,CAAU,OAAA,GAAU,CAAC,CAAA,EAAG;AAAA,eACxC;AAAA,YACF;AACA,YAAA,MAAM,GAAA;AAAA,UACR;AACA,UAAA,MAAM,IAAA,GAAO,MAAM,QAAA,CAAS,IAAA,EAAK;AAKjC,UAAA,MAAM,eAAgB,IAAA,CAAyD,KAAA;AAC/E,UAAA,IAAI,YAAA,EAAc;AAGhB,YAAA,MAAM,IAAI,cAAA,CAAe,GAAA,GAAM,QAAA,CAAS,KAAA,GAAQ,mBAAA,IAAuB,YAAA,CAAa,IAAA,IAAQ,EAAA,CAAA,GAAM,IAAA,IAAQ,YAAA,CAAa,OAAA,IAAW,SAAA,CAAU,CAAA;AAAA,UAC9I;AACA,UAAA,MAAM,UAAU,IAAA,CAAK,OAAA,GAAU,CAAC,CAAA,EAAG,SAAS,OAAA,IAAW,EAAA;AACvD,UAAA,IAAI,CAAC,OAAA,CAAQ,IAAA,EAAK,EAAG;AAGnB,YAAA,MAAM,IAAI,cAAA,CAAe,GAAA,GAAM,QAAA,CAAS,QAAQ,6BAA6B,CAAA;AAAA,UAC/E;AACA,UAAA,OAAO;AAAA,YACL,OAAA;AAAA,YACA,KAAA,EAAO,IAAA,CAAK,KAAA,IAAS,QAAA,CAAS,KAAA;AAAA,YAC9B,UAAU,QAAA,CAAS,KAAA;AAAA,YACnB,QAAA,EAAU,SAAS,KAAA,EAAM;AAAA,YACzB,OAAO,IAAA,CAAK,KAAA;AAAA,YACZ,YAAA,EAAc,IAAA,CAAK,OAAA,GAAU,CAAC,CAAA,EAAG;AAAA,WACnC;AAAA,QACF,SAAS,GAAA,EAAK;AACZ,UAAA,MAAM,MAAM,GAAA,YAAe,KAAA,GAAQ,GAAA,CAAI,OAAA,GAAU,OAAO,GAAG,CAAA;AAC3D,UAAA,QAAA,CAAS,KAAK,CAAA,EAAG,QAAA,CAAS,KAAK,CAAA,EAAA,EAAK,GAAG,CAAA,CAAE,CAAA;AACzC,UAAA,SAAA,GAAY,GAAA,YAAe,cAAA,GAAiB,GAAA,GAAM,IAAI,cAAA,CAAe,IAAI,QAAA,CAAS,KAAK,CAAA,EAAA,EAAK,GAAG,CAAA,CAAE,CAAA;AAAA,QAEnG;AAAA,MACF;AACE,MAAA,IAAI,QAAQ,gBAAA,EAAkB;AAC9B,MAAA,MAAM,SAAA,IAAa,IAAI,cAAA,CAAe,yCAAyC,CAAA;AAAA,IACjF;AACA,IAAA,MAAM,SAAA,IAAa,IAAI,cAAA,CAAe,iCAAA,GAAoC,mBAAmB,UAAU,CAAA;AAAA,EACzG;AAEA,EAAA,OAAO,EAAE,MAAM,KAAA,EAAM;AACvB;AAKO,SAAS,iBAAiB,IAAA,EAAuC;AAEtE,EAAA,IAAI,OAAA,GAAU,KAAK,IAAA,EAAK;AACxB,EAAA,IAAI,OAAA,CAAQ,UAAA,CAAW,SAAS,CAAA,EAAG;AACjC,IAAA,OAAA,GAAU,OAAA,CAAQ,MAAM,CAAC,CAAA;AAAA,EAC3B,CAAA,MAAA,IAAW,OAAA,CAAQ,UAAA,CAAW,KAAK,CAAA,EAAG;AACpC,IAAA,OAAA,GAAU,OAAA,CAAQ,MAAM,CAAC,CAAA;AAAA,EAC3B;AACA,EAAA,IAAI,OAAA,CAAQ,QAAA,CAAS,KAAK,CAAA,EAAG;AAC3B,IAAA,OAAA,GAAU,OAAA,CAAQ,KAAA,CAAM,CAAA,EAAG,EAAE,CAAA;AAAA,EAC/B;AACA,EAAA,OAAA,GAAU,QAAQ,IAAA,EAAK;AAEvB,EAAA,IAAI;AACF,IAAA,OAAO,IAAA,CAAK,MAAM,OAAO,CAAA;AAAA,EAC3B,CAAA,CAAA,MAAQ;AAEN,IAAA,MAAM,KAAA,GAAQ,OAAA,CAAQ,OAAA,CAAQ,GAAG,CAAA;AACjC,IAAA,IAAI,SAAS,CAAA,EAAG;AACd,MAAA,IAAI,KAAA,GAAQ,CAAA;AACZ,MAAA,IAAI,QAAA,GAAW,KAAA;AACf,MAAA,IAAI,MAAA,GAAS,KAAA;AACb,MAAA,KAAA,IAAS,CAAA,GAAI,KAAA,EAAO,CAAA,GAAI,OAAA,CAAQ,QAAQ,CAAA,EAAA,EAAK;AAC3C,QAAA,MAAM,EAAA,GAAK,QAAQ,CAAC,CAAA;AACpB,QAAA,IAAI,MAAA,EAAQ;AAAE,UAAA,MAAA,GAAS,KAAA;AAAO,UAAA;AAAA,QAAU;AACxC,QAAA,IAAI,OAAO,IAAA,EAAM;AAAE,UAAA,MAAA,GAAS,IAAA;AAAM,UAAA;AAAA,QAAU;AAC5C,QAAA,IAAI,OAAO,GAAA,EAAK;AAAE,UAAA,QAAA,GAAW,CAAC,QAAA;AAAU,UAAA;AAAA,QAAU;AAClD,QAAA,IAAI,QAAA,EAAU;AACd,QAAA,IAAI,OAAO,GAAA,EAAK,KAAA,EAAA;AAChB,QAAA,IAAI,OAAO,GAAA,EAAK;AACd,UAAA,KAAA,EAAA;AACA,UAAA,IAAI,UAAU,CAAA,EAAG;AACf,YAAA,IAAI;AACF,cAAA,OAAO,KAAK,KAAA,CAAM,OAAA,CAAQ,MAAM,KAAA,EAAO,CAAA,GAAI,CAAC,CAAC,CAAA;AAAA,YAC/C,CAAA,CAAA,MAAQ;AAAA,YAER;AAAA,UACF;AAAA,QACF;AAAA,MACF;AAAA,IACF;AACA,IAAA,MAAM,IAAI,eAAe,CAAA,wCAAA,EAA2C,OAAA,CAAQ,MAAM,CAAA,EAAG,GAAG,CAAC,CAAA,CAAE,CAAA;AAAA,EAC7F;AACF;AAKA,eAAsB,WAAA,CACpB,MAAA,EACA,YAAA,EACA,UAAA,EACA,OAAA,EACkC;AAClC,EAAA,MAAM,MAAA,GAAS,MAAM,MAAA,CAAO,IAAA;AAAA,IAC1B;AAAA,MACE,EAAE,IAAA,EAAM,QAAA,EAAU,OAAA,EAAS,YAAA,EAAa;AAAA,MACxC,EAAE,IAAA,EAAM,MAAA,EAAQ,OAAA,EAAS,UAAA;AAAW,KACtC;AAAA,IACA;AAAA,GACF;AAEA,EAAA,OAAO,gBAAA,CAAiB,OAAO,OAAO,CAAA;AACxC;;;AC5VA,eAAsB,gBAAgB,OAAA,EAA0D;AAC9F,EAAA,MAAM,EAAE,IAAA,EAAM,SAAA,EAAW,QAAA,EAAU,WAAU,GAAI,OAAA;AACjD,EAAA,MAAM,MAAA,GAAS,gBAAgB,SAAS,CAAA;AACxC,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,IAAA,EAAM,SAAA,EAAW,aAAa,eAAA,EAAiB,WAAA,EAAa,WAAU,GAAI,OAAA;AAClF,EAAA,MAAM,MAAA,GAAS,gBAAgB,SAAS,CAAA;AAExC,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,yFAAA,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,SAASC,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,IAAA,EAAM,SAAA,EAAW,aAAa,eAAA,EAAiB,OAAA,EAAS,WAAU,GAAI,OAAA;AAC9E,EAAA,MAAM,MAAA,GAAS,gBAAgB,SAAS,CAAA;AAExC,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,WAAA,EACA,eAAA,EACA,cACA,SAAA,EAC8B;AAC9B,EAAA,MAAM,MAAA,GAAS,gBAAgB,SAAS,CAAA;AAExC,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;;;AC/MO,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;;;AChGA,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,iBAAA,EAAmB,kBAAA,EAAoB,WAAU,GAAI,OAAA;AAE5F,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,gBAAgB,SAAS,CAAA;AACxC,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;AAErB,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;AAAA,MAC7C,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;AAAA,MAC5B;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,cAAA,EAAgB;AAAA,OACjB,CAAA;AAAA,IACH;AAEA,IAAA,eAAA,CAAgB,GAAA,CAAI,KAAK,KAAK,CAAA;AAAA,EAChC;AAEA,EAAA,OAAO,eAAA;AACT;;;ACrMA,IAAM,iBAAA,GAA4C;AAAA,EAChD,SAAA,EAAW,IAAA;AAAA,EACX,kBAAA,EAAoB,IAAA;AAAA,EACpB,MAAA,EAAQ,GAAA;AAAA,EACR,gBAAA,EAAkB,IAAA;AAAA,EAClB,kBAAA,EAAoB,IAAA;AAAA,EACpB,MAAA,EAAQ,GAAA;AAAA,EACR,gBAAA,EAAkB,IAAA;AAAA,EAClB,cAAA,EAAgB,GAAA;AAAA,EAChB,MAAA,EAAQ,GAAA;AAAA,EACR,eAAA,EAAiB;AACnB,CAAA;AAEA,IAAM,iBAAA,GAAoB,IAAA;AAkB1B,SAAS,gBAAA,CACP,KAAA,EACA,KAAA,EACA,WAAA,EACQ;AACR,EAAA,MAAM,UAAA,GAAa,IAAI,GAAA,CAAI,KAAA,CAAM,aAAY,CAAE,KAAA,CAAM,KAAK,CAAC,CAAA;AAG3D,EAAA,IAAI,UAAA,GAAa,EAAA;AACjB,EAAA,IAAI,UAAU,KAAA,EAAO;AAEnB,IAAA,UAAA,GAAa,YAAY,QAAA,IAAY,EAAA;AAAA,EACvC,CAAA,MAAA,IAAW,UAAU,KAAA,EAAO;AAE1B,IAAA,UAAA,GAAa,CAAC,YAAY,WAAA,IAAe,EAAA,EAAI,YAAY,GAAA,IAAO,EAAE,CAAA,CAAE,IAAA,CAAK,GAAG,CAAA;AAAA,EAC9E,CAAA,MAAO;AAEL,IAAA,UAAA,GAAa,CAAC,YAAY,GAAA,IAAO,EAAA,EAAI,YAAY,WAAA,IAAe,EAAE,CAAA,CAAE,IAAA,CAAK,GAAG,CAAA;AAAA,EAC9E;AAEA,EAAA,MAAM,WAAA,GAAc,IAAI,GAAA,CAAI,UAAA,CAAW,aAAY,CAAE,KAAA,CAAM,KAAK,CAAC,CAAA;AACjE,EAAA,IAAI,CAAC,UAAA,CAAW,IAAA,IAAQ,CAAC,WAAA,CAAY,MAAM,OAAO,CAAA;AAElD,EAAA,IAAI,OAAA,GAAU,CAAA;AACd,EAAA,KAAA,MAAW,KAAK,UAAA,EAAY;AAC1B,IAAA,IAAI,WAAA,CAAY,GAAA,CAAI,CAAC,CAAA,EAAG,OAAA,EAAA;AAAA,EAC1B;AACA,EAAA,OAAO,IAAA,CAAK,GAAA,CAAI,OAAA,GAAU,UAAA,CAAW,MAAM,CAAG,CAAA;AAChD;AAGA,SAAS,oBAAoB,IAAA,EAAwB;AACnD,EAAA,MAAM,SAAA,GAAY,KAAK,WAAA,EAAY;AACnC,EAAA,MAAM,aAAA,GAA0C;AAAA,IAC9C,GAAA,EAAK,CAAC,WAAA,EAAa,UAAA,EAAY,eAAe,MAAA,EAAQ,SAAA,EAAW,SAAS,KAAK,CAAA;AAAA,IAC/E,KAAK,CAAC,MAAA,EAAQ,YAAY,SAAA,EAAW,OAAA,EAAS,OAAO,WAAW,CAAA;AAAA,IAChE,KAAK,CAAC,SAAA,EAAW,YAAY,QAAA,EAAU,QAAA,EAAU,OAAO,MAAM,CAAA;AAAA,IAC9D,KAAK,CAAC,MAAA,EAAQ,aAAa,IAAA,EAAM,IAAA,EAAM,eAAe,QAAQ,CAAA;AAAA,IAC9D,KAAK,CAAC,QAAA,EAAU,OAAO,SAAA,EAAW,OAAA,EAAS,UAAU,SAAS,CAAA;AAAA,IAC9D,KAAK,CAAC,KAAA,EAAO,QAAQ,KAAA,EAAO,YAAA,EAAc,SAAS,KAAK;AAAA,GAC1D;AAEA,EAAA,MAAM,UAAoB,EAAC;AAC3B,EAAA,KAAA,MAAW,CAAC,IAAA,EAAM,QAAQ,KAAK,MAAA,CAAO,OAAA,CAAQ,aAAa,CAAA,EAAG;AAC5D,IAAA,IAAI,QAAA,CAAS,IAAA,CAAK,CAAA,EAAA,KAAM,SAAA,CAAU,QAAA,CAAS,EAAE,CAAC,CAAA,EAAG,OAAA,CAAQ,IAAA,CAAK,IAAI,CAAA;AAAA,EACpE;AACA,EAAA,OAAO,OAAA,CAAQ,MAAA,GAAS,CAAA,GAAI,OAAA,GAAU,CAAC,KAAK,CAAA;AAC9C;AAKA,SAAS,qBAAqB,MAAA,EAAuC;AACnE,EAAA,MAAM,UAAA,GAAa,CAAC,WAAA,EAAa,QAAA,EAAU,sBAAsB,iBAAiB,CAAA;AAClF,EAAA,MAAM,UAAA,GAAa,CAAC,kBAAA,EAAoB,oBAAA,EAAsB,QAAQ,CAAA;AAEtE,EAAA,IAAI,UAAA,CAAW,QAAA,CAAS,MAAM,CAAA,EAAG,OAAO,KAAA;AACxC,EAAA,IAAI,UAAA,CAAW,QAAA,CAAS,MAAM,CAAA,EAAG,OAAO,KAAA;AACxC,EAAA,OAAO,KAAA;AACT;AAKA,eAAsB,gBACpB,OAAA,EACgC;AAChC,EAAA,MAAM,EAAE,QAAA,EAAU,IAAA,EAAM,UAAA,EAAY,cAAA,EAAgB,OAAO,CAAA,EAAG,SAAA,GAAY,iBAA6B,CAAA,GAAI,OAAA;AAE3G,EAAuB,oBAAoB,IAAI;AAC/C,EAAA,MAAM,WAA8B,EAAC;AACrC,EAAA,MAAM,WAA8B,EAAC;AACrC,EAAA,MAAM,aAAA,GAAgB,OAAO,IAAA,CAAK,UAAA,IAAc,EAAE,CAAA,CAAE,MAAA,GAAS,CAAA,IAC3D,MAAA,CAAO,MAAA,CAAO,cAAc,EAAE,EAAE,IAAA,CAAK,CAAA,CAAA,KAAK,EAAE,SAAA,IAAa,CAAA,CAAE,SAAA,CAAU,MAAA,GAAS,CAAC,CAAA;AACjF,EAAA,IAAI,WAAA,GAAc,gBAAgB,WAAA,GAAc,iBAAA;AAEhD,EAAA,MAAM,QAAA,GAAW,cAAc,EAAC;AAEhC,EAAA,KAAA,MAAW,UAAU,QAAA,EAAU;AAC7B,IAAA,MAAM,UAAU,MAAA,CAAO,OAAA;AACvB,IAAA,MAAM,SAAS,MAAA,CAAO,MAAA;AAEtB,IAAA,MAAM,QAAQ,cAAA,EAAgB,GAAA,CAAI,OAAO,CAAA,IAAK,qBAAqB,MAAM,CAAA;AAGzE,IAAA,MAAM,SAAyB,EAAC;AAChC,IAAA,KAAA,MAAW,CAAC,IAAA,EAAM,IAAI,KAAK,MAAA,CAAO,OAAA,CAAQ,QAAQ,CAAA,EAAG;AACnD,MAAA,MAAM,eAAA,GAAkB,KAAK,QAAA,IAAY,EAAA;AACzC,MAAA,MAAM,WAAA,GAAc,KAAK,WAAA,IAAe,EAAA;AACxC,MAAA,MAAM,aAAc,IAAA,CAAiC,GAAA;AACrD,MAAA,MAAM,aAAc,IAAA,CAAiC,GAAA;AAGrD,MAAA,MAAM,UAAA,GAAa,gBAAA,CAAiB,OAAA,EAAS,KAAA,EAAO;AAAA,QAClD,QAAA,EAAU,eAAA;AAAA,QACV,WAAA,EAAa,WAAA;AAAA,QACb,GAAA,EAAK,UAAA;AAAA,QACL,GAAA,EAAK;AAAA,OACN,CAAA;AAGD,MAAA,MAAM,UAAA,GAAa,IAAI,GAAA,CAAI,OAAA,CAAQ,aAAY,CAAE,KAAA,CAAM,KAAK,CAAC,CAAA;AAC7D,MAAA,MAAM,QAAA,GAAW,IAAI,GAAA,CAAI;AAAA,QACvB,GAAG,eAAA,CAAgB,WAAA,EAAY,CAAE,MAAM,KAAK,CAAA;AAAA,QAC5C,GAAG,WAAA,CAAY,WAAA,EAAY,CAAE,MAAM,KAAK,CAAA;AAAA,QACxC,IAAI,UAAA,IAAc,EAAA,EAAI,WAAA,EAAY,CAAE,MAAM,KAAK,CAAA;AAAA,QAC/C,IAAI,UAAA,IAAc,EAAA,EAAI,WAAA,EAAY,CAAE,MAAM,KAAK;AAAA,OACjD,CAAE,MAAA,CAAO,OAAO,CAAC,CAAA;AACjB,MAAA,IAAI,YAAA,GAAe,CAAA;AACnB,MAAA,KAAA,MAAW,KAAK,UAAA,EAAY;AAAE,QAAA,IAAI,QAAA,CAAS,GAAA,CAAI,CAAC,CAAA,EAAG,YAAA,EAAA;AAAA,MAAgB;AACnE,MAAA,MAAM,aAAA,GAAgB,UAAA,CAAW,IAAA,GAAO,CAAA,GAAI,IAAA,CAAK,IAAI,YAAA,GAAe,UAAA,CAAW,IAAA,EAAM,CAAG,CAAA,GAAI,CAAA;AAG5F,MAAA,MAAM,YAAY,UAAA,IAAc,aAAA;AAChC,MAAA,MAAM,UAAA,GAAa,YAAY,UAAA,GAAa,aAAA;AAE5C,MAAA,IAAI,aAAa,CAAA,EAAG;AAClB,QAAA,MAAA,CAAO,IAAA,CAAK;AAAA,UACV,IAAA;AAAA,UACA,IAAA,EAAM,KAAK,IAAA,IAAQ,IAAA;AAAA,UACnB,WAAA,EAAa,WAAA;AAAA,UACb,QAAA,EAAU,eAAA;AAAA,UACV,GAAA,EAAK,UAAA;AAAA,UACL,GAAA,EAAK,UAAA;AAAA,UACL,KAAA,EAAO,UAAA;AAAA,UACP,aAAA,EAAe,YAAY,KAAA,GAAQ,KAAA;AAAA,UACnC,MAAA,EAAQ,iBAAiB,IAAA,CAAK,SAAA,IAAa,KAAK,SAAA,CAAU,MAAA,GAAS,IAAI,WAAA,GAAc;AAAA,SACtF,CAAA;AAAA,MACH;AAAA,IACF;AAEA,IAAA,MAAA,CAAO,KAAK,CAAC,CAAA,EAAG,MAAM,CAAA,CAAE,KAAA,GAAQ,EAAE,KAAK,CAAA;AACvC,IAAA,MAAM,UAAA,GAAa,MAAA,CAAO,KAAA,CAAM,CAAA,EAAG,IAAI,CAAA;AAEvC,IAAA,IAAI,UAAA,CAAW,WAAW,CAAA,EAAG;AAC3B,MAAA,QAAA,CAAS,IAAA,CAAK;AAAA,QACZ,OAAA;AAAA,QACA,MAAA;AAAA,QACA,KAAA;AAAA,QACA,MAAA,EAAQ;AAAA,OACT,CAAA;AACD,MAAA;AAAA,IACF;AAEA,IAAA,MAAM,YAAA,GAAe,iBAAA,CAAkB,MAAM,CAAA,IAAK,SAAA;AAClD,IAAA,MAAM,QAAA,GAAW,WAAW,CAAC,CAAA;AAE7B,IAAA,IAAI,QAAA,CAAS,SAAS,YAAA,EAAc;AAClC,MAAA,QAAA,CAAS,IAAA,CAAK;AAAA,QACZ,OAAA;AAAA,QACA,MAAA;AAAA,QACA,KAAA;AAAA,QACA,aAAA,EAAe,UAAA,CAAW,MAAA,CAAO,CAAA,CAAA,KAAK,CAAA,CAAE,KAAA,IAAS,YAAY,CAAA,CAAE,GAAA,CAAI,CAAA,CAAA,KAAK,CAAA,CAAE,IAAI,CAAA;AAAA,QAC9E,OAAA,EAAS;AAAA,OACV,CAAA;AAAA,IACH,CAAA,MAAO;AACL,MAAA,QAAA,CAAS,IAAA,CAAK;AAAA,QACZ,OAAA;AAAA,QACA,MAAA;AAAA,QACA,KAAA;AAAA,QACA,UAAA,EAAY,QAAA;AAAA,QACZ,MAAA,EAAQ,mBAAmB,QAAA,CAAS,KAAA,CAAM,QAAQ,CAAC,CAAC,MAAM,YAAY,CAAA,CAAA;AAAA,OACvE,CAAA;AAAA,IACH;AAAA,EACF;AAEA,EAAA,OAAO;AAAA,IACL,QAAA;AAAA,IACA,QAAA;AAAA,IACA,OAAA,EAAS;AAAA,MACP,gBAAgB,QAAA,CAAS,MAAA;AAAA,MACzB,gBAAgB,QAAA,CAAS,MAAA;AAAA,MACzB,gBAAgB,QAAA,CAAS,MAAA;AAAA,MACzB;AAAA;AACF,GACF;AACF;;;AClNA,SAAS,iBAAA,CACP,YACA,cAAA,EACQ;AACR,EAAA,OAAO,IAAA,CAAK,IAAA,CAAK,UAAA,GAAa,cAAc,CAAA;AAC9C;AAQA,SAAS,0BAAA,CACP,OAAA,EACA,eAAA,EACA,UAAA,EACA,cAAA,EACsB;AACtB,EAAA,MAAM,KAAA,GAAQ,OAAA,CAAQ,KAAA,IAAS,EAAC;AAChC,EAAA,IAAI,KAAA,CAAM,MAAA,KAAW,CAAA,EAAG,OAAO,EAAC;AAEhC,EAAA,MAAM,SAAA,GAAY,QAAQ,EAAA,IAAM,OAAA;AAGhC,EAAA,MAAM,cAAc,KAAA,CAAM,GAAA,CAAI,OAAK,CAAA,CAAE,MAAA,EAAQ,qBAAqB,EAAE,CAAA;AACpE,EAAA,MAAM,eAAA,GAAkB,YAAY,MAAA,CAAO,CAAC,GAAG,CAAA,KAAM,CAAA,GAAI,GAAG,CAAC,CAAA;AAG7D,EAAA,IAAI,iBAAA,CAAkB,eAAA,EAAiB,cAAc,CAAA,IAAK,UAAA,EAAY;AACpE,IAAA,OAAO,CAAC,eAAe,OAAA,EAAS,eAAA,EAAiB,OAAO,WAAA,EAAa,SAAA,EAAW,CAAC,CAAC,CAAA;AAAA,EACpF;AAGA,EAAA,MAAM,aAAmC,EAAC;AAC1C,EAAA,IAAI,eAAuB,EAAC;AAC5B,EAAA,IAAI,iBAA2B,EAAC;AAChC,EAAA,IAAI,cAAA,GAAiB,CAAA;AAErB,EAAA,KAAA,IAAS,CAAA,GAAI,CAAA,EAAG,CAAA,GAAI,KAAA,CAAM,QAAQ,CAAA,EAAA,EAAK;AACrC,IAAA,MAAM,IAAA,GAAO,MAAM,CAAC,CAAA;AACpB,IAAA,MAAM,IAAA,GAAO,YAAY,CAAC,CAAA;AAG1B,IAAA,MAAM,YAAA,GAAe,eAAe,MAAA,CAAO,CAAC,GAAG,CAAA,KAAM,CAAA,GAAI,GAAG,CAAC,CAAA;AAC7D,IAAA,IAAI,iBAAA,CAAkB,eAAe,IAAA,EAAM,cAAc,IAAI,UAAA,IAAc,YAAA,CAAa,SAAS,CAAA,EAAG;AAElG,MAAA,UAAA,CAAW,IAAA,CAAK,cAAA;AAAA,QACd,OAAA;AAAA,QAAS,eAAA;AAAA,QAAiB,YAAA;AAAA,QAAc,cAAA;AAAA,QACxC,SAAA;AAAA,QAAW;AAAA,OACZ,CAAA;AACD,MAAA,cAAA,EAAA;AACA,MAAA,YAAA,GAAe,EAAC;AAChB,MAAA,cAAA,GAAiB,EAAC;AAAA,IACpB;AAEA,IAAA,YAAA,CAAa,KAAK,IAAI,CAAA;AACtB,IAAA,cAAA,CAAe,KAAK,IAAI,CAAA;AAAA,EAC1B;AAGA,EAAA,IAAI,YAAA,CAAa,SAAS,CAAA,EAAG;AAC3B,IAAA,UAAA,CAAW,IAAA,CAAK,cAAA;AAAA,MACd,OAAA;AAAA,MAAS,eAAA;AAAA,MAAiB,YAAA;AAAA,MAAc,cAAA;AAAA,MACxC,SAAA;AAAA,MAAW;AAAA,KACZ,CAAA;AAAA,EACH;AAEA,EAAA,OAAO,UAAA;AACT;AAMA,SAAS,eACP,OAAA,EACA,eAAA,EACA,KAAA,EACA,WAAA,EACA,WACA,cAAA,EACoB;AACpB,EAAA,MAAM,UAAA,GAAa,YAAY,MAAA,CAAO,CAAC,GAAG,CAAA,KAAM,CAAA,GAAI,GAAG,CAAC,CAAA;AACxD,EAAA,MAAM,SAAS,KAAA,CAAM,GAAA,CAAI,CAAA,CAAA,KAAK,CAAA,CAAE,oBAAoB,KAAK,CAAA;AACzD,EAAA,MAAM,eAAA,GAAkB,MAAA,CAAO,QAAA,CAAS,QAAQ,CAAA,GAAI,WAChD,MAAA,CAAO,QAAA,CAAS,KAAK,CAAA,GAAI,KAAA,GACzB,MAAA;AAGJ,EAAA,MAAM,iBAAA,uBAAwB,GAAA,EAAY;AAC1C,EAAA,MAAM,iBAAA,uBAAwB,GAAA,EAAY;AAC1C,EAAA,KAAA,MAAW,QAAQ,KAAA,EAAO;AAExB,IAAA,MAAM,gBAAA,GAAmB,IAAA,CAAK,aAAA,IAAiB,EAAC;AAChD,IAAA,KAAA,MAAW,QAAQ,gBAAA,EAAkB;AACnC,MAAA,iBAAA,CAAkB,IAAI,IAAI,CAAA;AAAA,IAC5B;AAEA,IAAA,MAAM,OAAA,GAAU,CAAC,GAAI,IAAA,CAAK,QAAA,IAAY,EAAC,EAAI,GAAI,IAAA,CAAK,SAAA,IAAa,EAAG,CAAA;AACpE,IAAA,KAAA,MAAW,MAAM,eAAA,EAAiB;AAChC,MAAA,IAAI,OAAA,CAAQ,QAAA,CAAS,EAAA,CAAG,OAAO,CAAA,EAAG;AAChC,QAAA,iBAAA,CAAkB,GAAA,CAAI,GAAG,YAAY,CAAA;AACrC,QAAA,iBAAA,CAAkB,GAAA,CAAI,GAAG,OAAO,CAAA;AAAA,MAClC;AAAA,IACF;AAAA,EACF;AAGA,EAAA,MAAM,cAAc,EAAE,GAAA,EAAK,GAAG,GAAA,EAAK,CAAA,EAAG,KAAK,CAAA,EAAE;AAC7C,EAAA,KAAA,MAAW,MAAM,eAAA,EAAiB;AAChC,IAAA,IAAI,iBAAA,CAAkB,GAAA,CAAI,EAAA,CAAG,OAAO,CAAA,EAAG;AACrC,MAAA,WAAA,CAAY,GAAG,KAAK,CAAA,EAAA;AAAA,IACtB;AAAA,EACF;AACA,EAAA,MAAM,aAAA,GACJ,WAAA,CAAY,GAAA,IAAO,WAAA,CAAY,OAAO,WAAA,CAAY,GAAA,IAAO,WAAA,CAAY,GAAA,GAAM,KAAA,GACzE,WAAA,CAAY,GAAA,IAAO,WAAA,CAAY,MAAM,KAAA,GACrC,KAAA;AAEJ,EAAA,OAAO;AAAA,IACL,IAAI,cAAA,KAAmB,CAAA,GAAI,YAAY,CAAA,EAAG,SAAS,KAAK,cAAc,CAAA,CAAA;AAAA,IACtE,IAAA,EAAM,cAAA,KAAmB,CAAA,GAAK,OAAA,CAAQ,IAAA,IAAQ,SAAA,GAAa,CAAA,EAAG,OAAA,CAAQ,IAAA,IAAQ,SAAS,CAAA,OAAA,EAAU,cAAc,CAAA,CAAA,CAAA;AAAA,IAC/G,WAAA,EAAa,QAAQ,WAAA,IAAe,EAAA;AAAA,IACpC,UAAA,EAAY,SAAA;AAAA,IACZ,YAAA,EAAc,QAAQ,IAAA,IAAQ,EAAA;AAAA,IAC9B,cAAc,CAAC,GAAG,iBAAiB,CAAA,CAAE,KAAK,IAAI,CAAA;AAAA,IAC9C,KAAA,EAAO,aAAA;AAAA,IACP,cAAc,EAAC;AAAA,IACf,cAAc,EAAC;AAAA,IACf,uBAAuB,EAAC;AAAA,IACxB,KAAA;AAAA,IACA,iBAAA,EAAmB,UAAA;AAAA,IACnB,gBAAA,EAAkB,UAAA;AAAA;AAAA,IAClB,gBAAA,EAAkB;AAAA,GACpB;AACF;AAOA,SAAS,gBACP,eAAA,EACuB;AACvB,EAAA,MAAM,GAAA,uBAAU,GAAA,EAAsB;AACtC,EAAA,KAAA,MAAW,QAAA,IAAY,eAAA,CAAgB,MAAA,EAAO,EAAG;AAC/C,IAAA,KAAA,MAAW,KAAK,QAAA,EAAU;AACxB,MAAA,MAAM,WAAW,GAAA,CAAI,GAAA,CAAI,CAAA,CAAE,YAAY,KAAK,EAAC;AAC7C,MAAA,IAAI,CAAC,QAAA,CAAS,QAAA,CAAS,CAAA,CAAE,OAAO,CAAA,EAAG;AACjC,QAAA,QAAA,CAAS,IAAA,CAAK,EAAE,OAAO,CAAA;AACvB,QAAA,GAAA,CAAI,GAAA,CAAI,CAAA,CAAE,YAAA,EAAc,QAAQ,CAAA;AAAA,MAClC;AAAA,IACF;AAAA,EACF;AACA,EAAA,OAAO,GAAA;AACT;AAKA,SAAS,0BAAA,CACP,YACA,UAAA,EACsB;AACtB,EAAA,MAAM,kBAAA,uBAAyB,GAAA,EAAY;AAE3C,EAAA,KAAA,MAAW,aAAa,UAAA,EAAY;AAElC,IAAA,MAAM,KAAA,uBAAY,GAAA,EAAY;AAC9B,IAAA,MAAM,YAAA,GAAe,SAAA,CAAU,YAAA,CAAa,KAAA,CAAM,GAAG,CAAA,CAAE,GAAA,CAAI,CAAC,CAAA,KAAc,CAAA,CAAE,IAAA,EAAM,CAAA,CAAE,OAAO,OAAO,CAAA;AAClG,IAAA,KAAA,MAAW,QAAQ,YAAA,EAAc;AAC/B,MAAA,MAAM,GAAA,GAAM,UAAA,CAAW,GAAA,CAAI,IAAI,KAAK,EAAC;AACrC,MAAA,KAAA,MAAW,EAAA,IAAM,GAAA,EAAK,KAAA,CAAM,GAAA,CAAI,EAAE,CAAA;AAAA,IACpC;AAEA,IAAA,SAAA,CAAU,YAAA,GAAe,KAAA,CAAM,IAAA,CAAK,KAAK,EAAE,IAAA,EAAK;AAGhD,IAAA,MAAM,QAAkB,EAAC;AACzB,IAAA,MAAM,WAAqB,EAAC;AAC5B,IAAA,KAAA,MAAW,EAAA,IAAM,UAAU,YAAA,EAAc;AACvC,MAAA,IAAI,kBAAA,CAAmB,GAAA,CAAI,EAAE,CAAA,EAAG;AAC9B,QAAA,QAAA,CAAS,KAAK,EAAE,CAAA;AAAA,MAClB,CAAA,MAAO;AACL,QAAA,KAAA,CAAM,KAAK,EAAE,CAAA;AACb,QAAA,kBAAA,CAAmB,IAAI,EAAE,CAAA;AAAA,MAC3B;AAAA,IACF;AAEA,IAAA,SAAA,CAAU,YAAA,GAAe,KAAA;AACzB,IAAA,SAAA,CAAU,qBAAA,GAAwB,QAAA;AAAA,EACpC;AAEA,EAAA,OAAO,UAAA;AACT;AAOA,SAAS,eAAA,CACP,YACA,cAAA,EACkB;AAClB,EAAA,MAAM,SAA2B,EAAC;AAClC,EAAA,IAAI,oBAA0C,EAAC;AAC/C,EAAA,IAAI,cAAA,GAAiB,CAAA;AACrB,EAAA,IAAI,QAAA,GAAW,CAAA;AAEf,EAAA,KAAA,MAAW,aAAa,UAAA,EAAY;AAClC,IAAA,MAAM,mBAAmB,SAAA,CAAU,gBAAA;AAGnC,IAAA,IAAI,cAAA,GAAiB,gBAAA,GAAmB,cAAA,IAAkB,iBAAA,CAAkB,SAAS,CAAA,EAAG;AACtF,MAAA,MAAA,CAAO,IAAA,CAAK,UAAA,CAAW,iBAAA,EAAmB,QAAQ,CAAC,CAAA;AACnD,MAAA,QAAA,EAAA;AACA,MAAA,iBAAA,GAAoB,EAAC;AACrB,MAAA,cAAA,GAAiB,CAAA;AAAA,IACnB;AAEA,IAAA,iBAAA,CAAkB,KAAK,SAAS,CAAA;AAChC,IAAA,cAAA,IAAkB,gBAAA;AAAA,EACpB;AAGA,EAAA,IAAI,iBAAA,CAAkB,SAAS,CAAA,EAAG;AAChC,IAAA,MAAA,CAAO,IAAA,CAAK,UAAA,CAAW,iBAAA,EAAmB,QAAQ,CAAC,CAAA;AAAA,EACrD;AAEA,EAAA,OAAO,MAAA;AACT;AAEA,SAAS,UAAA,CAAW,YAAkC,QAAA,EAAkC;AACtF,EAAA,MAAM,YAAA,GAAe,WAAW,MAAA,CAAO,CAAC,KAAK,CAAA,KAAM,GAAA,GAAM,CAAA,CAAE,gBAAA,EAAkB,CAAC,CAAA;AAG9E,EAAA,MAAM,MAAA,GAAS,UAAA,CAAW,GAAA,CAAI,CAAA,CAAA,KAAK,EAAE,KAAK,CAAA;AAC1C,EAAA,MAAM,eAAe,CAAC,GAAG,IAAI,GAAA,CAAI,MAAM,CAAC,CAAA;AACxC,EAAA,MAAM,WAAA,GAAc,aAAa,GAAA,CAAI,CAAA,CAAA,KAAK,EAAE,WAAA,EAAa,CAAA,CAAE,IAAA,CAAK,UAAK,CAAA;AAErE,EAAA,OAAO;AAAA,IACL,QAAA,EAAU,QAAA;AAAA,IACV,UAAA,EAAY,SAAS,QAAQ,CAAA,CAAA;AAAA,IAC7B,UAAA;AAAA,IACA,aAAA,EAAe,YAAA;AAAA,IACf,mBAAA,EAAqB;AAAA,GACvB;AACF;AAOO,SAAS,gBAAgB,OAAA,EAA4C;AAC1E,EAAA,MAAM;AAAA,IACJ,YAAA;AAAA,IACA,eAAA,uBAAsB,GAAA,EAAI;AAAA,IAC1B,cAAA,GAAiB,EAAA;AAAA,IACjB,cAAA,GAAiB,IAAA;AAAA,IACjB,mBAAA,GAAsB;AAAA,GACxB,GAAI,OAAA;AAEJ,EAAA,MAAM,QAAA,GAAW,YAAA,CAAa,QAAA,IAAY,EAAC;AAC3C,EAAA,MAAM,UAAA,GAAa,gBAAgB,eAAe,CAAA;AAGlD,EAAA,MAAM,gBAAsC,EAAC;AAE7C,EAAA,KAAA,MAAW,WAAW,QAAA,EAAU;AAC9B,IAAA,MAAM,GAAA,GAAM,QAAQ,EAAA,IAAM,OAAA;AAC1B,IAAA,MAAM,SAAA,GAAY,eAAA,CAAgB,GAAA,CAAI,GAAG,KAAK,EAAC;AAE/C,IAAA,MAAM,UAAA,GAAa,0BAAA;AAAA,MACjB,OAAA;AAAA,MACA,SAAA;AAAA,MACA,mBAAA;AAAA,MACA;AAAA,KACF;AAEA,IAAA,aAAA,CAAc,IAAA,CAAK,GAAG,UAAU,CAAA;AAAA,EAClC;AAGA,EAAA,KAAA,MAAW,aAAa,aAAA,EAAe;AACrC,IAAA,SAAA,CAAU,gBAAA,GAAmB,iBAAA,CAAkB,SAAA,CAAU,iBAAA,EAAmB,cAAc,CAAA;AAAA,EAC5F;AAGA,EAAA,0BAAA,CAA2B,eAAe,UAAU,CAAA;AAGpD,EAAA,MAAM,MAAA,GAAS,eAAA,CAAgB,aAAA,EAAe,cAAc,CAAA;AAG5D,EAAA,MAAM,qBAAA,GAAwB,cAAc,MAAA,CAAO,CAAC,KAAK,CAAA,KAAM,GAAA,GAAM,CAAA,CAAE,iBAAA,EAAmB,CAAC,CAAA;AAC3F,EAAA,MAAM,oBAAA,GAAuB,cAAc,MAAA,CAAO,CAAC,KAAK,CAAA,KAAM,GAAA,GAAM,CAAA,CAAE,gBAAA,EAAkB,CAAC,CAAA;AAEzF,EAAA,OAAO;AAAA,IACL,SAAS,YAAA,CAAa,OAAA;AAAA,IACtB,SAAS,YAAA,CAAa,OAAA;AAAA,IACtB,MAAA;AAAA,IACA,gBAAA,EAAkB,eAAA;AAAA,IAClB,WAAA,EAAa;AAAA,MACX,eAAA,EAAiB,cAAA;AAAA,MACjB,eAAA,EAAiB,cAAA;AAAA,MACjB,uBAAA,EAAyB,qBAAA;AAAA,MACzB,sBAAA,EAAwB;AAAA;AAC1B,GACF;AACF;;;ACvWA,eAAsB,kBAAA,CACpB,SAAA,EACA,IAAA,EACA,SAAA,EACA,SAAA,EAC8B;AAE9B,EAAA,IAAI,SAAA,CAAU,UAAU,EAAA,EAAI;AAC1B,IAAA,OAAO,EAAE,QAAA,EAAU,SAAA,EAAW,SAAA,EAAW,yBAAA,EAA0B;AAAA,EACrE;AAEA,EAAA,MAAM,MAAA,GAAS,gBAAgB,SAAS,CAAA;AAGxC,EAAA,MAAM,SAAA,GAAY,cAAc,SAAS,CAAA;AAEzC,EAAA,MAAM,YAAA,GACJ,wyBAAA;AAcF,EAAA,MAAM,UAAA,GACJ,iBAAiB,IAAI;AAAA,YAAA,EACJ,SAAS;;AAAA,WAAA,EACV,UAAU,MAAM,CAAA;AAAA,EAAa,SAAS;;AAAA,wDAAA,CAAA;AAIxD,EAAA,IAAI;AACF,IAAA,MAAM,MAAA,GAAS,MAAM,WAAA,CAAY,MAAA,EAAQ,cAAc,UAAA,EAAY;AAAA,MACjE,WAAA,EAAa,GAAA;AAAA,MACb,SAAA,EAAW;AAAA,KACZ,CAAA;AAED,IAAA,MAAM,QAAA,GAAW,MAAM,OAAA,CAAQ,MAAA,CAAO,QAAQ,CAAA,GAAI,MAAA,CAAO,WAAuB,EAAC;AACjF,IAAA,MAAM,SAAA,GAAY,MAAA,CAAO,MAAA,CAAO,SAAA,IAAa,EAAE,CAAA;AAG/C,IAAA,MAAM,OAAA,GAAU,IAAI,GAAA,CAAI,SAAS,CAAA;AACjC,IAAA,MAAM,gBAAgB,QAAA,CAAS,MAAA,CAAO,OAAK,OAAA,CAAQ,GAAA,CAAI,CAAC,CAAC,CAAA;AAEzD,IAAA,IAAI,aAAA,CAAc,WAAW,CAAA,EAAG;AAE9B,MAAA,OAAO,EAAE,QAAA,EAAU,SAAA,EAAW,SAAA,EAAW,sCAAA,EAAuC;AAAA,IAClF;AAEA,IAAA,OAAO,EAAE,QAAA,EAAU,aAAA,EAAe,SAAA,EAAU;AAAA,EAC9C,SAAS,GAAA,EAAK;AACZ,IAAA,OAAA,CAAQ,IAAA,CAAK,CAAA,kCAAA,EAAqC,GAAG,CAAA,kBAAA,CAAoB,CAAA;AACzE,IAAA,OAAO,EAAE,QAAA,EAAU,SAAA,EAAW,SAAA,EAAW,CAAA,YAAA,EAAe,GAAG,CAAA,CAAA,EAAG;AAAA,EAChE;AACF;AAMA,SAAS,cAAc,SAAA,EAA6B;AAClD,EAAA,MAAM,KAAA,uBAAY,GAAA,EAAsB;AAExC,EAAA,KAAA,MAAW,MAAM,SAAA,EAAW;AAC1B,IAAA,MAAM,KAAA,GAAQ,EAAA,CAAG,KAAA,CAAM,GAAG,CAAA;AAC1B,IAAA,MAAM,GAAA,GAAM,KAAA,CAAM,MAAA,GAAS,CAAA,GAAI,KAAA,CAAM,KAAA,CAAM,CAAA,EAAG,EAAE,CAAA,CAAE,IAAA,CAAK,GAAG,CAAA,GAAI,QAAA;AAC9D,IAAA,MAAM,IAAA,GAAO,KAAA,CAAM,KAAA,CAAM,MAAA,GAAS,CAAC,CAAA;AACnC,IAAA,IAAI,CAAC,MAAM,GAAA,CAAI,GAAG,GAAG,KAAA,CAAM,GAAA,CAAI,GAAA,EAAK,EAAE,CAAA;AACtC,IAAA,KAAA,CAAM,GAAA,CAAI,GAAG,CAAA,CAAG,IAAA,CAAK,IAAI,CAAA;AAAA,EAC3B;AAEA,EAAA,MAAM,QAAkB,EAAC;AACzB,EAAA,KAAA,MAAW,CAAC,GAAA,EAAK,KAAK,CAAA,IAAK,KAAA,EAAO;AAChC,IAAA,KAAA,CAAM,IAAA,CAAK,CAAA,EAAG,GAAG,CAAA,CAAA,CAAG,CAAA;AACpB,IAAA,KAAA,MAAW,CAAA,IAAK,KAAA,CAAM,IAAA,EAAK,EAAG;AAC5B,MAAA,KAAA,CAAM,IAAA,CAAK,CAAA,EAAA,EAAK,CAAC,CAAA,CAAE,CAAA;AAAA,IACrB;AAAA,EACF;AAEA,EAAA,OAAO,KAAA,CAAM,KAAK,IAAI,CAAA;AACxB;ACjEO,SAAS,kBAAA,CACd,KACA,OAAA,EAKU;AACV,EAAA,MAAM,WAAA,GAA4C,CAAC,UAAU,KAAA,EAAO,MAAA,EAAQ,KAAA,EAAO,MAAA,EAAQ,KAAA,EAAO,MAAA,EAAQ,MAAA,EAAQ,IAAA,EAAM,MAAM,MAAM,CAAA;AACpI,EAAA,MAAM,QAAA,GAAgC,EAAA;AAGtC,EAAA,MAAM,QAAA,GAAW,aAAA,CAAc,GAAA,EAAK,WAAA,EAAa,QAAQ,CAAA;AACzD,EAAA,IAAI,QAAA,CAAS,MAAA,GAAS,CAAA,EAAG,OAAO,QAAA;AAGhC,EAAA,OAAO,oBAAA,CAAqB,GAAA,EAAK,WAAA,EAAa,QAA2B,CAAA;AAC3E;AAMA,SAAS,aAAA,CAAc,GAAA,EAAa,WAAA,EAAuB,QAAA,EAA4B;AACrF,EAAA,IAAI;AACF,IAAA,MAAM,GAAA,GAAMC,uBAAS,mDAAA,EAAqD;AAAA,MACxE,GAAA,EAAK,GAAA;AAAA,MACL,QAAA,EAAU,OAAA;AAAA,MACV,OAAA,EAAS,GAAA;AAAA,MACT,WAAW,IAAA,GAAO;AAAA,KACnB,CAAA;AACD,IAAA,MAAM,MAAA,GAAS,IAAI,GAAA,CAAI,WAAA,CAAY,IAAI,CAAA,CAAA,KAAK,CAAA,CAAE,WAAA,EAAa,CAAC,CAAA;AAC5D,IAAA,OAAO,GAAA,CACJ,KAAA,CAAM,IAAI,CAAA,CACV,MAAA,CAAO,CAAA,IAAA,KAAQ,IAAA,CAAK,MAAA,GAAS,CAAC,CAAA,CAC9B,MAAA,CAAO,CAAA,IAAA,KAAQ,OAAO,GAAA,CAAIC,YAAA,CAAQ,IAAI,CAAA,CAAE,WAAA,EAAa,CAAC,CAAA,CACtD,KAAA,CAAM,CAAA,EAAG,QAAQ,CAAA,CACjB,GAAA,CAAI,CAAA,GAAA,KAAOC,SAAA,CAAK,GAAA,EAAK,GAAG,CAAC,CAAA;AAAA,EAC9B,CAAA,CAAA,MAAQ;AAEN,IAAA,OAAO,EAAC;AAAA,EACV;AACF;AAKA,SAAS,oBAAA,CACP,GAAA,EACA,WAAA,EACA,QAAA,EACA,QAAA,EACU;AACV,EAAA,MAAM,OAAA,GAAU,IAAI,GAAA,CAAgB;AAAA,IAClC,cAAA;AAAA,IAAgB,QAAA;AAAA,IAAU,MAAA;AAAA,IAAQ,MAAA;AAAA,IAAQ,OAAA;AAAA,IAAS,MAAA;AAAA,IACnD,aAAA;AAAA,IAAe,OAAA;AAAA,IAAS,MAAA;AAAA,IAAQ,OAAA;AAAA,IAAS,SAAA;AAAA,IACzC,MAAA;AAAA,IAAQ,OAAA;AAAA,IAAS,MAAA;AAAA,IAAQ,QAAA;AAAA,IAAU,SAAA;AAAA,IAAW;AAAA,GAC/C,CAAA;AACD,EAAA,MAAM,MAAA,GAAS,IAAI,GAAA,CAAI,WAAA,CAAY,IAAI,CAAA,CAAA,KAAK,CAAA,CAAE,WAAA,EAAa,CAAC,CAAA;AAC5D,EAAA,MAAM,SAAmB,EAAC;AAE1B,EAAA,SAAS,KAAK,UAAA,EAAoB;AAChC,IAAA,IAAI,MAAA,CAAO,UAAU,QAAA,EAAU;AAC/B,IAAA,IAAI,OAAA;AACJ,IAAA,IAAI;AACF,MAAA,OAAA,GAAUC,cAAA,CAAY,UAAA,EAAY,EAAE,aAAA,EAAe,MAAM,CAAA;AAAA,IAC3D,CAAA,CAAA,MAAQ;AACN,MAAA;AAAA,IACF;AACA,IAAA,KAAA,MAAW,SAAS,OAAA,EAAS;AAC3B,MAAA,IAAI,MAAA,CAAO,UAAU,QAAA,EAAU;AAC/B,MAAA,MAAM,QAAA,GAAWD,SAAA,CAAK,UAAA,EAAY,KAAA,CAAM,IAAI,CAAA;AAC5C,MAAA,IAAI,KAAA,CAAM,aAAY,EAAG;AACvB,QAAA,IAAI,CAAC,OAAA,CAAQ,GAAA,CAAI,KAAA,CAAM,IAAI,CAAA,EAAG;AAC5B,UAAA,IAAA,CAAK,QAAQ,CAAA;AAAA,QACf;AAAA,MACF,CAAA,MAAA,IAAW,KAAA,CAAM,MAAA,EAAO,EAAG;AACzB,QAAA,MAAM,GAAA,GAAMD,YAAA,CAAQ,KAAA,CAAM,IAAI,EAAE,WAAA,EAAY;AAC5C,QAAA,IAAI,MAAA,CAAO,GAAA,CAAI,GAAG,CAAA,EAAG;AACnB,UAAA,MAAA,CAAO,KAAK,QAAQ,CAAA;AAAA,QACtB;AAAA,MACF;AAAA,IACF;AAAA,EACF;AAEA,EAAA,IAAA,CAAK,GAAG,CAAA;AACR,EAAA,OAAO,MAAA;AACT;AA6CO,SAAS,2BAAA,CACd,GAAA,EACA,aAAA,EACA,QAAA,GAAmB,GAAA,EACE;AACrB,EAAA,MAAM,QAAA,uBAAe,GAAA,EAAoB;AACzC,EAAA,IAAI,UAAA,GAAa,CAAA;AAEjB,EAAA,KAAA,MAAW,WAAW,aAAA,EAAe;AACnC,IAAA,MAAM,QAAA,GAAWC,SAAA,CAAK,GAAA,EAAK,OAAO,CAAA;AAClC,IAAA,IAAI;AACF,MAAA,MAAM,OAAA,GAAUE,eAAA,CAAa,QAAA,EAAU,OAAO,CAAA;AAC9C,MAAA,IAAI,UAAA,GAAa,OAAA,CAAQ,MAAA,GAAS,QAAA,EAAU;AAC1C,QAAA,MAAM,YAAY,QAAA,GAAW,UAAA;AAC7B,QAAA,IAAI,YAAY,GAAA,EAAK;AACnB,UAAA,QAAA,CAAS,IAAI,OAAA,EAAS,OAAA,CAAQ,KAAA,CAAM,CAAA,EAAG,SAAS,CAAC,CAAA;AACjD,UAAA,UAAA,IAAc,SAAA;AAAA,QAChB;AACA,QAAA;AAAA,MACF;AACA,MAAA,QAAA,CAAS,GAAA,CAAI,SAAS,OAAO,CAAA;AAC7B,MAAA,UAAA,IAAc,OAAA,CAAQ,MAAA;AAAA,IACxB,CAAA,CAAA,MAAQ;AAAA,IAER;AAAA,EACF;AAEA,EAAA,OAAO,QAAA;AACT;AAKO,SAAS,sBAAsB,SAAA,EAA6B;AACjE,EAAA,MAAM,MAAA,uBAAa,GAAA,EAAoB;AACvC,EAAA,KAAA,MAAW,MAAM,SAAA,EAAW;AAC1B,IAAA,MAAM,GAAA,GAAMH,YAAA,CAAQ,EAAE,CAAA,CAAE,WAAA,EAAY;AACpC,IAAA,IAAI,IAAA,GAAO,SAAA;AACX,IAAA,IAAI,GAAA,KAAQ,UAAU,IAAA,GAAO,OAAA;AAAA,SAAA,IACpB,GAAA,KAAQ,KAAA,IAAS,GAAA,KAAQ,MAAA,EAAQ,IAAA,GAAO,YAAA;AAAA,SAAA,IACxC,GAAA,KAAQ,KAAA,IAAS,GAAA,KAAQ,MAAA,EAAQ,IAAA,GAAO,YAAA;AAAA,SAAA,IACxC,GAAA,KAAQ,OAAO,IAAA,GAAO,QAAA;AAAA,SAAA,IACtB,GAAA,KAAQ,UAAU,GAAA,KAAQ,MAAA,IAAU,QAAQ,IAAA,IAAQ,GAAA,KAAQ,MAAM,IAAA,GAAO,KAAA;AAAA,SAAA,IACzE,GAAA,KAAQ,KAAA,IAAS,GAAA,KAAQ,MAAA,EAAQ,IAAA,GAAO,QAAA;AACjD,IAAA,MAAA,CAAO,IAAI,IAAA,EAAA,CAAO,MAAA,CAAO,IAAI,IAAI,CAAA,IAAK,KAAK,CAAC,CAAA;AAAA,EAC9C;AAEA,EAAA,IAAI,QAAA,GAAW,CAAA;AACf,EAAA,IAAI,OAAA,GAAU,SAAA;AACd,EAAA,KAAA,MAAW,CAAC,IAAA,EAAM,KAAK,CAAA,IAAK,MAAA,EAAQ;AAClC,IAAA,IAAI,QAAQ,QAAA,EAAU;AACpB,MAAA,QAAA,GAAW,KAAA;AACX,MAAA,OAAA,GAAU,IAAA;AAAA,IACZ;AAAA,EACF;AACA,EAAA,OAAO,OAAA;AACT;ACzLA,eAAsB,wBACpB,OAAA,EACyB;AACzB,EAAA,MAAM,EAAE,OAAA,EAAS,IAAA,EAAM,WAAW,SAAA,EAAW,UAAA,EAAY,YAAW,GAAI,OAAA;AAExE,EAAA,MAAM,GAAA,GAAM,CAAC,IAAA,EAAc,GAAA,KAAgB;AACzC,IAAA,OAAA,CAAQ,GAAA,CAAI,CAAA,CAAA,EAAI,IAAI,CAAA,EAAA,EAAK,GAAG,CAAA,CAAE,CAAA;AAC9B,IAAA,UAAA,GAAa,MAAM,GAAG,CAAA;AAAA,EACxB,CAAA;AAGA,EAAA,GAAA,CAAI,UAAU,oCAAoC,CAAA;AAElD,EAAA,MAAM,YAAA,GAAe,mBAAmB,OAAO,CAAA;AAC/C,EAAA,MAAM,cAAc,YAAA,CAAa,GAAA,CAAI,QAAMI,aAAAA,CAAS,OAAA,EAAS,EAAE,CAAC,CAAA;AAChE,EAAA,GAAA,CAAI,QAAA,EAAU,CAAA,MAAA,EAAS,WAAA,CAAY,MAAM,CAAA,2BAAA,CAA6B,CAAA;AAGtE,EAAA,GAAA,CAAI,UAAU,uDAAuD,CAAA;AAErE,EAAA,MAAM,EAAE,QAAA,EAAU,aAAA,EAAe,SAAA,KAAc,MAAM,kBAAA;AAAA,IACnD,WAAA;AAAA,IAAa,IAAA;AAAA,IAAM,SAAA;AAAA,IAAW;AAAA,GAChC;AACA,EAAA,GAAA,CAAI,QAAA,EAAU,CAAA,aAAA,EAAgB,aAAA,CAAc,MAAM,CAAA,CAAA,EAAI,WAAA,CAAY,MAAM,CAAA,QAAA,EAAW,SAAA,CAAU,KAAA,CAAM,CAAA,EAAG,GAAG,CAAC,CAAA,CAAE,CAAA;AAG5G,EAAA,GAAA,CAAI,UAAU,uCAAuC,CAAA;AAErD,EAAA,MAAM,eAAA,GAAkB,2BAAA,CAA4B,OAAA,EAAS,aAAa,CAAA;AAC1E,EAAA,MAAM,SAAA,GAAY,aAAA;AAClB,EAAA,MAAM,WAAA,GAAc,sBAAsB,SAAS,CAAA;AACnD,EAAA,GAAA,CAAI,QAAA,EAAU,qBAAqB,WAAW,CAAA,EAAA,EAAK,UAAU,MAAM,CAAA,eAAA,EAAkB,eAAA,CAAgB,IAAI,CAAA,cAAA,CAAgB,CAAA;AAGzH,EAAA,GAAA,CAAI,UAAU,iDAAiD,CAAA;AAE/D,EAAA,MAAM,kBAAmC,EAAC;AAC1C,EAAA,KAAA,MAAW,CAAC,OAAA,EAAS,OAAO,CAAA,IAAK,eAAA,EAAiB;AAChD,IAAA,MAAM,QAAA,GAAW,OAAA;AACjB,IAAA,IAAI,QAAA,CAAS,QAAA,CAAS,QAAQ,CAAA,EAAG;AAC/B,MAAA,eAAA,CAAgB,IAAA,CAAK,cAAA,CAAe,QAAA,EAAU,OAAO,CAAC,CAAA;AAAA,IACxD,WAAW,QAAA,CAAS,QAAA,CAAS,KAAK,CAAA,IAAK,SAAS,QAAA,CAAS,MAAM,CAAA,IAAK,QAAA,CAAS,SAAS,KAAK,CAAA,IAAK,QAAA,CAAS,QAAA,CAAS,MAAM,CAAA,EAAG;AACzH,MAAA,eAAA,CAAgB,IAAA,CAAK,WAAA,CAAY,QAAA,EAAU,OAAO,CAAC,CAAA;AAAA,IACrD,CAAA,MAAA,IAAW,QAAA,CAAS,QAAA,CAAS,KAAK,CAAA,EAAG;AACnC,MAAA,eAAA,CAAgB,IAAA,CAAK,eAAA,CAAgB,QAAA,EAAU,OAAO,CAAC,CAAA;AAAA,IACzD,WAAW,QAAA,CAAS,QAAA,CAAS,MAAM,CAAA,IAAK,SAAS,QAAA,CAAS,MAAM,CAAA,IAAK,QAAA,CAAS,SAAS,IAAI,CAAA,IAAK,QAAA,CAAS,QAAA,CAAS,IAAI,CAAA,EAAG;AACvH,MAAA,eAAA,CAAgB,IAAA,CAAK,YAAA,CAAa,QAAA,EAAU,OAAO,CAAC,CAAA;AAAA,IACtD;AAAA,EACF;AAGA,EAAA,IAAI,aAAA;AACJ,EAAA,IAAI,gBAAgB,OAAA,EAAS;AAC3B,IAAA,aAAA,GAAgB,kBAAkB,eAAA,CAAgB,MAAA,CAAO,CAAC,CAAA,KAA6B,mBAAA,IAAuB,CAAC,CAAC,CAAA;AAAA,EAClH,CAAA,MAAA,IAAW,WAAA,KAAgB,YAAA,IAAgB,WAAA,KAAgB,YAAA,EAAc;AACvE,IAAA,aAAA,GAAgB,cAAA,CAAe,eAAA,CAAgB,MAAA,CAAO,CAAC,MAA0B,EAAE,YAAA,IAAgB,CAAA,CAAA,IAAM,EAAE,mBAAA,IAAuB,CAAA,CAAA,IAAM,EAAE,iBAAA,IAAqB,EAAE,CAAC,CAAA;AAAA,EACpK,CAAA,MAAA,IAAW,gBAAgB,QAAA,EAAU;AACnC,IAAA,aAAA,GAAgB,mBAAmB,eAAA,CAAgB,MAAA,CAAO,CAAC,CAAA,KAA8B,YAAA,IAAgB,CAAC,CAAC,CAAA;AAAA,EAC7G,CAAA,MAAO;AACL,IAAA,aAAA,GAAgB,eAAA,CAAgB,eAAA,CAAgB,MAAA,CAAO,CAAC,CAAA,KAA2B,gBAAA,IAAoB,CAAA,IAAK,EAAE,YAAA,IAAgB,CAAA,CAAA,IAAM,EAAE,mBAAA,IAAuB,EAAE,CAAC,CAAA;AAAA,EAClK;AAGA,EAAA,GAAA,CAAI,UAAU,0CAA0C,CAAA;AAExD,EAAA,MAAM,WAAA,GAAc,gBAAgB,aAAa,CAAA;AACjD,EAAA,GAAA,CAAI,QAAA,EAAU,CAAA,UAAA,EAAa,WAAA,CAAY,MAAM,CAAA,SAAA,CAAW,CAAA;AAGxD,EAAA,GAAA,CAAI,UAAU,2BAA2B,CAAA;AAEzC,EAAA,MAAM,WAAA,GAAc;AAAA,IAClB,QAAA,EAAU,WAAA,CAAY,GAAA,CAAI,CAAA,EAAA,MAAO;AAAA,MAC/B,MAAM,EAAA,CAAG,OAAA;AAAA,MACT,MAAM,EAAA,CAAG,MAAA;AAAA,MACT,YAAA,EAAc;AAAA,KAChB,CAAE;AAAA,GACJ;AAGA,EAAA,GAAA,CAAI,UAAU,6EAA6E,CAAA;AAG3F,EAAA,GAAA,CAAI,aAAa,+CAA+C,CAAA;AAChE,EAAA,MAAM,eAAA,GAAkB,MAAM,eAAA,CAAgB;AAAA,IAC5C,IAAA;AAAA,IACA,SAAA;AAAA,IACA,QAAA,EAAU,SAAA;AAAA,IACV;AAAA,GACD,CAAA;AAGD,EAAA,GAAA,CAAI,aAAa,gDAAgD,CAAA;AACjE,EAAA,MAAM,QAAA,GAAW,MAAM,sBAAA,CAAuB;AAAA,IAC5C,IAAA;AAAA,IACA,SAAA;AAAA,IACA,WAAA;AAAA,IACA,eAAA;AAAA,IACA,WAAA;AAAA,IACA;AAAA,GACD,CAAA;AAGD,EAAA,MAAM,UAAU,QAAA,CAAS,OAAA;AACzB,EAAA,MAAM,OAAA,GAA4D;AAAA,IAChE,EAAA,EAAI,OAAA;AAAA,IACJ,QAAA,EAAU,CAAA;AAAA,IACV,IAAA,EAAM,6DAAA;AAAA,IACN,WAAA,EAAa,2EAAA;AAAA,IACb,OAAO,EAAC;AAAA,IACR,WAAW,EAAC;AAAA,IACZ,UAAU,CAAC,iBAAA,EAAmB,YAAA,EAAc,mBAAA,EAAqB,gBAAgB,KAAK,CAAA;AAAA,IACtF,gBAAA,EAAkB,MAAA;AAAA,IAClB,QAAA,EAAU,KAAA;AAAA,IACV,MAAA,EAAQ,6DAAA;AAAA,IACR,OAAA,EAAS,EAAE,YAAA,EAAc,2BAAA,EAA6B,WAAW,uBAAA,EAAwB;AAAA,IACzF,UAAA,EAAY,CAAC,4BAAA,EAA8B,0BAA0B,CAAA;AAAA,IACrE,iBAAiB,EAAC;AAAA,IAClB,eAAe,EAAC;AAAA,IAChB,MAAA,EAAQ,EAAE,iBAAA,EAAmB,EAAA,EAAI,YAAY,KAAA;AAAM,GACrD;AAGA,EAAA,IAAI,eAA0B,EAAC;AAC/B,EAAA,IAAI,eAAA,EAAiB;AACnB,IAAA,MAAM,aAAA,GAAgB,CAAC,OAAA,EAAS,GAAI,eAAA,CAAgB,KAAA,IAAS,EAAG,CAAA,CAAE,GAAA,CAAI,CAAC,CAAA,EAAG,CAAA,MAAO;AAAA,MAC/E,GAAG,CAAA;AAAA,MACH,EAAA,EAAI,CAAA,IAAA,EAAO,CAAA,GAAI,CAAC,CAAA,CAAA;AAAA,MAChB,UAAU,CAAA,GAAI;AAAA,KAChB,CAAE,CAAA;AACF,IAAA,YAAA,CAAa,IAAA,CAAK;AAAA,MAChB,GAAG,eAAA;AAAA,MACH,EAAA,EAAI,IAAA;AAAA,MACJ,IAAA,EAAM,oBAAA;AAAA,MACN,KAAA,EAAO;AAAA,KACR,CAAA;AAAA,EACH,CAAA,MAAO;AACL,IAAA,YAAA,CAAa,IAAA,CAAK;AAAA,MAChB,EAAA,EAAI,IAAA;AAAA,MACJ,IAAA,EAAM,oBAAA;AAAA,MACN,WAAA,EAAa,gDAAA;AAAA,MACb,KAAA,EAAO,CAAC,OAAO;AAAA,KACL,CAAA;AAAA,EACd;AAGA,EAAA,MAAM,gBAAA,GAAoB,OAAA,EAAS,QAAA,IAAY,EAAC;AAChD,EAAA,YAAA,GAAe,CAAC,GAAG,YAAA,EAAc,GAAG,gBAAgB,CAAA;AAGpD,EAAA,GAAA,CAAI,WAAA,EAAa,CAAA,qBAAA,EAAwB,gBAAA,CAAiB,MAAM,CAAA,YAAA,CAAc,CAAA;AAE9E,EAAA,MAAM,gBAAgB,gBAAA,CAAiB,MAAA,CAAO,CAAA,CAAA,KAAK,CAAA,CAAE,OAAO,IAAI,CAAA;AAChE,EAAA,IAAI,aAAA,CAAc,SAAS,CAAA,EAAG;AAC5B,IAAA,IAAI;AACF,MAAA,MAAM,eAAe,MAAM,0BAAA;AAAA,QACzB,IAAA;AAAA,QAAM,SAAA;AAAA,QAAW,WAAA;AAAA,QAAa,eAAA;AAAA,QAAiB,aAAA;AAAA,QAAe;AAAA,OAChE;AACA,MAAA,KAAA,MAAW,WAAW,aAAA,EAAe;AACnC,QAAA,MAAM,KAAA,GAAQ,YAAA,CAAa,GAAA,CAAI,OAAA,CAAQ,MAAM,EAAE,CAAA;AAC/C,QAAA,IAAI,KAAA,UAAe,KAAA,GAAQ,KAAA;AAAA,MAC7B;AAAA,IACF,SAAS,GAAA,EAAK;AACZ,MAAA,GAAA,CAAI,WAAA,EAAa,CAAA,yBAAA,EAA4B,GAAG,CAAA,iCAAA,CAAmC,CAAA;AACnF,MAAA,KAAA,MAAW,WAAW,aAAA,EAAe;AACnC,QAAA,IAAI;AACF,UAAA,MAAM,KAAA,GAAQ,MAAM,mBAAA,CAAoB;AAAA,YACtC,IAAA;AAAA,YAAM,SAAA;AAAA,YAAW,WAAA;AAAA,YAAa,eAAA;AAAA,YAAiB,OAAA;AAAA,YAAS;AAAA,WACzD,CAAA;AACD,UAAA,OAAA,CAAQ,KAAA,GAAQ,KAAA;AAAA,QAClB,SAAS,CAAA,EAAG;AACV,UAAA,GAAA,CAAI,aAAa,CAAA,WAAA,EAAc,OAAA,CAAQ,EAAE,CAAA,EAAA,EAAK,CAAC,CAAA,CAAE,CAAA;AAAA,QACnD;AAAA,MACF;AAAA,IACF;AAAA,EACF;AAGA,EAAA,MAAM,YAAA,GAA6B;AAAA,IACjC,cAAA,EAAgB,CAAA;AAAA,IAChB,OAAA,EAAS;AAAA,MACP,EAAA,EAAK,QAAA,CAAS,OAAA,EAAqC,IAAA,EAAM,QAAA,EAAS,CAAE,WAAA,EAAY,CAAE,OAAA,CAAQ,MAAA,EAAQ,GAAG,CAAA,IAAK,SAAA;AAAA,MAC1G,IAAA,EAAO,QAAA,CAAS,OAAA,EAAqC,IAAA,EAAM,UAAS,IAAK,SAAA;AAAA,MACzE,OAAA,EAAS,IAAA;AAAA,MACT,OAAA,EAAS,OAAA;AAAA,MACT,YAAA,EAAc,KAAA;AAAA,MACd,QAAA,EAAY,QAAA,CAAS,OAAA,EAAqC,SAAA,IAA0B,CAAC,KAAK,CAAA;AAAA,MAC1F,UAAA,EAAY,UAAU,KAAA,CAAM,GAAG,EAAE,MAAA,CAAO,CAAC,KAAK,CAAA,KAAM;AAClD,QAAA,MAAM,GAAA,GAAM,CAAA,CAAE,IAAA,EAAK,CAAE,WAAA,EAAY;AACjC,QAAA,IAAI,KAAK,GAAA,CAAI,GAAG,IAAI,CAAC,CAAA,CAAE,MAAM,CAAA;AAC7B,QAAA,OAAO,GAAA;AAAA,MACT,CAAA,EAAG,EAA8B,CAAA;AAAA,MACjC,YAAA,EAAe,QAAA,CAAS,YAAA,EAA0C,MAAA,IAAsB;AAAC,KAC3F;AAAA,IACA,OAAA,EAAS;AAAA,MACP,KAAA,EAAQ,OAAA,EAAS,KAAA,IAAwD,EAAC;AAAA,MAC1E,KAAA,EAAQ,OAAA,EAAS,KAAA,IAAoD,EAAC;AAAA,MACtE,QAAA,EAAW,OAAA,EAAS,aAAA,IAA4H,EAAC;AAAA,MACjJ,cAAc,EAAC;AAAA,MACf,kBAAA,EAAqB,OAAA,EAAS,kBAAA,IAAwL,EAAC;AAAA,MACvN,OAAA,EAAS,MAAA,CAAO,OAAA,EAAS,OAAA,IAAW,EAAE,CAAA;AAAA,MACtC,iBAAA,EAAmB,MAAA,CAAO,OAAA,EAAS,iBAAA,IAAqB,EAAE,CAAA;AAAA,MAC1D,aAAA,EAAgB,OAAA,EAAS,aAAA,IAA8B;AAAC,KAC1D;AAAA,IACA,QAAA,EAAU,YAAA;AAAA,IACV,cAAc,EAAC;AAAA,IACf,cAAA,EAAgB;AAAA,MACd,OAAO;AAAC,KACV;AAAA,IACA,cAAc,EAAC;AAAA,IACf,WAAW;AAAC,GACd;AAGA,EAAA,GAAA,CAAI,UAAU,gDAAgD,CAAA;AAE9D,EAAA,MAAM,EAAE,KAAA,EAAO,aAAA,EAAe,cAAA,EAAe,GAAI,mBAAmB,YAAA,EAAc;AAAA,IAEhF,WAAA;AAAA,IACA;AAAA,GACD,CAAA;AACD,EAAA,GAAA,CAAI,QAAA,EAAU,CAAA,uBAAA,EAA0B,cAAA,CAAe,MAAM,CAAA,qBAAA,CAAuB,CAAA;AAGpF,EAAA,GAAA,CAAI,UAAU,4CAA4C,CAAA;AAE1D,EAAA,MAAM,eAAA,GAAkB,MAAM,sBAAA,CAAuB;AAAA,IACnD,YAAA,EAAc,aAAA;AAAA,IACd,eAAA;AAAA,IACA;AAAA,GACD,CAAA;AACD,EAAA,GAAA,CAAI,QAAA,EAAU,CAAA,0BAAA,EAA6B,eAAA,CAAgB,IAAI,CAAA,gBAAA,CAAkB,CAAA;AAGjF,EAAA,KAAA,MAAW,OAAA,IAAW,aAAA,CAAc,QAAA,IAAY,EAAC,EAAG;AAClD,IAAA,MAAM,GAAA,GAAM,QAAQ,EAAA,IAAM,EAAA;AAC1B,IAAA,MAAM,SAAA,GAAY,eAAA,CAAgB,GAAA,CAAI,GAAG,KAAK,EAAC;AAC/C,IAAA,KAAA,MAAW,IAAA,IAAQ,OAAA,CAAQ,KAAA,IAAS,EAAC,EAAG;AACtC,MAAA,MAAM,YAAA,GAAe,SAAA,CAClB,MAAA,CAAO,CAAA,EAAA,KAAM;AAEZ,QAAA,MAAM,OAAA,GAAU,CAAC,GAAI,IAAA,CAAK,QAAA,IAAY,EAAC,EAAI,GAAI,IAAA,CAAK,SAAA,IAAa,EAAG,CAAA;AACpE,QAAA,OAAO,OAAA,CAAQ,IAAA,CAAK,CAAA,CAAA,KAAK,CAAA,KAAM,GAAG,OAAO,CAAA;AAAA,MAC3C,CAAC,CAAA,CACA,GAAA,CAAI,CAAA,EAAA,KAAM,GAAG,YAAY,CAAA;AAE5B,MAAA,MAAM,QAAA,GAAW,IAAA,CAAK,aAAA,IAAiB,EAAC;AACxC,MAAA,IAAA,CAAK,aAAA,GAAgB,CAAC,mBAAG,IAAI,GAAA,CAAI,CAAC,GAAG,QAAA,EAAU,GAAG,YAAY,CAAC,CAAC,CAAA;AAAA,IAClE;AAAA,EACF;AAGA,EAAA,GAAA,CAAI,UAAU,+CAA+C,CAAA;AAG7D,EAAA,MAAM,cAAyB,EAAC;AAChC,EAAA,MAAM,MAAA,uBAAa,GAAA,EAAY;AAC/B,EAAA,KAAA,MAAW,OAAA,IAAW,aAAA,CAAc,QAAA,IAAY,EAAC,EAAG;AAClD,IAAA,KAAA,MAAW,IAAA,IAAQ,OAAA,CAAQ,KAAA,IAAS,EAAC,EAAG;AACtC,MAAA,KAAA,MAAW,EAAA,IAAM,CAAC,GAAI,IAAA,CAAK,QAAA,IAAY,EAAC,EAAI,GAAI,IAAA,CAAK,SAAA,IAAa,EAAG,CAAA,EAAG;AACtE,QAAA,IAAI,CAAC,MAAA,CAAO,GAAA,CAAI,EAAA,CAAG,WAAA,EAAa,CAAA,EAAG;AACjC,UAAA,MAAA,CAAO,GAAA,CAAI,EAAA,CAAG,WAAA,EAAa,CAAA;AAC3B,UAAA,WAAA,CAAY,IAAA,CAAK,EAAE,OAAA,EAAS,EAAA,EAAI,MAAA,EAAQ,UAAA,EAAY,QAAA,EAAU,KAAA,EAAO,MAAA,EAAQ,CAAA,EAAK,OAAA,EAAS,4BAAA,EAA8B,CAAA;AAAA,QAC3H;AAAA,MACF;AAAA,IACF;AAAA,EACF;AAEA,EAAA,MAAM,QAAA,GAAW,IAAI,GAAA,CAAI,WAAA,CAAY,GAAA,CAAI,CAAA,CAAA,KAAK,CAAC,CAAA,CAAE,OAAA,CAAQ,WAAA,EAAY,EAAG,CAAC,CAAC,CAAC,CAAA;AAC3E,EAAA,MAAM,iBAA4B,EAAC;AACnC,EAAA,MAAM,UAAA,uBAAiB,GAAA,EAAY;AACnC,EAAA,KAAA,MAAW,MAAM,CAAC,GAAG,WAAA,EAAa,GAAG,WAAW,CAAA,EAAG;AACjD,IAAA,MAAM,GAAA,GAAM,EAAA,CAAG,OAAA,CAAQ,WAAA,EAAY;AACnC,IAAA,IAAI,CAAC,UAAA,CAAW,GAAA,CAAI,GAAG,CAAA,EAAG;AACxB,MAAA,UAAA,CAAW,IAAI,GAAG,CAAA;AAClB,MAAA,cAAA,CAAe,IAAA,CAAK,QAAA,CAAS,GAAA,CAAI,GAAG,KAAK,EAAE,CAAA;AAAA,IAC7C;AAAA,EACF;AAGA,EAAA,MAAM,cAAA,uBAAqB,GAAA,EAAmC;AAC9D,EAAA,KAAA,MAAW,QAAA,IAAY,eAAA,CAAgB,MAAA,EAAO,EAAG;AAC/C,IAAA,KAAA,MAAW,MAAM,QAAA,EAAU;AACzB,MAAA,IAAI,CAAC,cAAA,CAAe,GAAA,CAAI,EAAA,CAAG,OAAO,CAAA,EAAG;AACnC,QAAA,cAAA,CAAe,GAAA,CAAI,EAAA,CAAG,OAAA,EAAS,EAAA,CAAG,KAAK,CAAA;AAAA,MACzC;AAAA,IACF;AAAA,EACF;AAEA,EAAA,MAAM,gBAAA,GAAmB,MAAM,eAAA,CAAgB;AAAA,IAC7C,QAAA,EAAU,cAAA;AAAA,IACV,IAAA;AAAA,IACA,UAAA;AAAA,IACA,cAEF,CAAC,CAAA;AACD,EAAA,GAAA,CAAI,QAAA,EAAU,CAAA,UAAA,EAAa,gBAAA,CAAiB,OAAA,CAAQ,cAAc,CAAA,YAAA,EAAe,gBAAA,CAAiB,OAAA,CAAQ,cAAc,CAAA,EAAA,EAAK,gBAAA,CAAiB,OAAA,CAAQ,WAAW,CAAA,CAAA,CAAG,CAAA;AAGpK,EAAA,GAAA,CAAI,UAAU,6CAA6C,CAAA;AAE3D,EAAA,MAAM,UAAU,eAAA,CAAgB;AAAA,IAC9B,YAAA,EAAc,aAAA;AAAA,IACd,eAAA;AAAA,IACA,cAAA,EAAgB,EAAA;AAAA,IAChB,cAAA,EAAgB,IAAA;AAAA,IAChB,mBAAA,EAAqB;AAAA,GACtB,CAAA;AACD,EAAA,GAAA,CAAI,UAAU,CAAA,mBAAA,EAAsB,OAAA,CAAQ,OAAO,MAAM,CAAA,SAAA,EAAY,QAAQ,MAAA,CAAO,MAAA,CAAO,CAAC,CAAA,EAAG,MAAM,CAAA,GAAI,CAAA,CAAE,WAAW,MAAA,EAAQ,CAAC,CAAC,CAAA,WAAA,CAAa,CAAA;AAE7I,EAAA,OAAO;AAAA,IACL,YAAA,EAAc,aAAA;AAAA,IACd,gBAAA;AAAA,IACA,OAAA;AAAA,IACA,cAAA;AAAA,IACA,QAAA,EAAU,WAAA;AAAA,IACV;AAAA,GACF;AACF","file":"index.cjs","sourcesContent":["/**\n * Swift AST-level parser — extracts imports, types, functions, property wrappers,\n * error handling patterns, and framework usage from Swift source files.\n *\n * Ported from knowledge-tree/extract_project_keywords.py parse_swift_file()\n */\n\nexport interface SwiftParseResult {\n  imports: string[];\n  types: Array<{\n    kind: string;\n    name: string;\n    conforms_to: string[];\n    file: string;\n  }>;\n  functions: Array<{\n    name: string;\n    params: string;\n    returns: string;\n    file: string;\n  }>;\n  property_wrappers: string[];\n  error_handling: string[];\n  frameworks_used: string[];\n}\n\nconst IMPORT_RE = /^import\\s+(\\w+)/gm;\nconst TYPE_RE = /\\b(class|struct|enum|protocol)\\s+(\\w+)(?:\\s*:\\s*([^{]+))?/g;\nconst FUNC_RE = /\\bfunc\\s+(\\w+)\\s*\\(([^)]*)\\)(?:\\s*->\\s*([^{]+))?/g;\nconst WRAPPER_RE = /@(State|Binding|ObservedObject|StateObject|Published|Environment|EnvironmentObject|AppStorage|SceneStorage|FocusState|Observable)\\b/g;\nconst FRAMEWORK_USAGE_RE = /\\b(URLSession|URLRequest|JSONSerialization|JSONDecoder|JSONEncoder|Task|DispatchQueue|Timer|NotificationCenter|UserDefaults|FileManager|Bundle)\\b/g;\n\nexport function parseSwiftFile(filepath: string, content: string): SwiftParseResult {\n  const result: SwiftParseResult = {\n    imports: [],\n    types: [],\n    functions: [],\n    property_wrappers: [],\n    error_handling: [],\n    frameworks_used: [],\n  };\n\n  // Extract imports\n  let match: RegExpExecArray | null;\n  while ((match = IMPORT_RE.exec(content)) !== null) {\n    result.imports.push(match[1]);\n  }\n\n  // Extract framework usage (types used in body, not declarations)\n  const fwSeen = new Set<string>();\n  while ((match = FRAMEWORK_USAGE_RE.exec(content)) !== null) {\n    if (!fwSeen.has(match[1])) {\n      fwSeen.add(match[1]);\n      result.frameworks_used.push(match[1]);\n    }\n  }\n\n  // Extract type declarations\n  while ((match = TYPE_RE.exec(content)) !== null) {\n    const conforms = (match[3] || '')\n      .split(',')\n      .map(p => p.trim())\n      .filter(Boolean);\n    result.types.push({\n      kind: match[1],\n      name: match[2],\n      conforms_to: conforms,\n      file: filepath,\n    });\n  }\n\n  // Extract function signatures\n  while ((match = FUNC_RE.exec(content)) !== null) {\n    const name = match[1];\n    if (name.startsWith('_')) continue;\n    result.functions.push({\n      name,\n      params: (match[2] || '').trim(),\n      returns: (match[3] || '').trim(),\n      file: filepath,\n    });\n  }\n\n  // Extract property wrappers\n  const wrapperSet = new Set<string>();\n  while ((match = WRAPPER_RE.exec(content)) !== null) {\n    wrapperSet.add(match[1]);\n  }\n  result.property_wrappers = Array.from(wrapperSet);\n\n  // Extract error handling patterns\n  if (content.includes('do {') || content.includes('do{')) {\n    result.error_handling.push('do-catch');\n  }\n  if (content.includes('throws')) {\n    result.error_handling.push('throws');\n  }\n  if (content.includes('Result<')) {\n    result.error_handling.push('Result type');\n  }\n  if (content.includes('try?')) {\n    result.error_handling.push('try?');\n  }\n  if (content.includes('try!')) {\n    result.error_handling.push('try!');\n  }\n\n  return result;\n}\n\nexport function mergeSwiftResults(results: SwiftParseResult[]): SwiftParseResult {\n  const merged: SwiftParseResult = {\n    imports: [],\n    types: [],\n    functions: [],\n    property_wrappers: [],\n    error_handling: [],\n    frameworks_used: [],\n  };\n\n  const importCounts = new Map<string, number>();\n  const wrapperCounts = new Map<string, number>();\n  const errorCounts = new Map<string, number>();\n  const frameworkSet = new Set<string>();\n\n  for (const r of results) {\n    for (const imp of r.imports) {\n      importCounts.set(imp, (importCounts.get(imp) || 0) + 1);\n    }\n    merged.types.push(...r.types);\n    merged.functions.push(...r.functions);\n    for (const w of r.property_wrappers) {\n      wrapperCounts.set(w, (wrapperCounts.get(w) || 0) + 1);\n    }\n    for (const e of r.error_handling) {\n      errorCounts.set(e, (errorCounts.get(e) || 0) + 1);\n    }\n    for (const fw of r.frameworks_used) {\n      frameworkSet.add(fw);\n    }\n  }\n\n  // Sort imports by count descending, top 20\n  merged.imports = Array.from(importCounts.entries())\n    .sort((a, b) => b[1] - a[1])\n    .slice(0, 20)\n    .map(([mod, count]) => mod);\n\n  // Sort wrappers by count, top 10\n  merged.property_wrappers = Array.from(wrapperCounts.entries())\n    .sort((a, b) => b[1] - a[1])\n    .slice(0, 10)\n    .map(([w]) => w);\n\n  // Sort errors by count, top 10\n  merged.error_handling = Array.from(errorCounts.entries())\n    .sort((a, b) => b[1] - a[1])\n    .slice(0, 10)\n    .map(([p]) => p);\n\n  merged.frameworks_used = Array.from(frameworkSet).sort();\n\n  // Limit types and functions\n  merged.types = merged.types.slice(0, 100);\n  merged.functions = merged.functions.slice(0, 100);\n\n  return merged;\n}\n","/**\n * TypeScript/JavaScript AST-level parser — extracts imports, types, functions,\n * and error handling patterns.\n *\n * Ported from knowledge-tree/extract_project_keywords.py parse_ts_file()\n */\n\nexport interface TsParseResult {\n  imports: string[];\n  types: Array<{\n    kind: string;\n    name: string;\n    file: string;\n  }>;\n  functions: Array<{\n    name: string;\n    params: string;\n    file: string;\n  }>;\n  error_handling: string[];\n}\n\nconst IMPORT_RE = /import\\s+.*?from\\s+['\"]([^'\"]+)['\"]/g;\nconst TYPE_RE = /\\b(interface|type|class|enum)\\s+(\\w+)/g;\nconst FUNC_RE = /\\bfunction\\s+(\\w+)\\s*\\(([^)]*)\\)/g;\nconst ARROW_RE = /\\bconst\\s+(\\w+)\\s*=\\s*\\([^)]*\\)\\s*(?::\\s*\\w+)?\\s*=>/g;\n\nexport function parseTsFile(filepath: string, content: string): TsParseResult {\n  const result: TsParseResult = {\n    imports: [],\n    types: [],\n    functions: [],\n    error_handling: [],\n  };\n\n  let match: RegExpExecArray | null;\n\n  // Extract imports\n  while ((match = IMPORT_RE.exec(content)) !== null) {\n    result.imports.push(match[1]);\n  }\n\n  // Extract type/interface/class/enum declarations\n  while ((match = TYPE_RE.exec(content)) !== null) {\n    result.types.push({\n      kind: match[1],\n      name: match[2],\n      file: filepath,\n    });\n  }\n\n  // Extract function declarations\n  while ((match = FUNC_RE.exec(content)) !== null) {\n    result.functions.push({\n      name: match[1],\n      params: (match[2] || '').trim(),\n      file: filepath,\n    });\n  }\n\n  // Extract arrow functions\n  while ((match = ARROW_RE.exec(content)) !== null) {\n    result.functions.push({\n      name: match[1],\n      params: '',\n      file: filepath,\n    });\n  }\n\n  // Extract error handling patterns\n  if (content.includes('try {') || content.includes('try{')) {\n    result.error_handling.push('try-catch');\n  }\n  if (content.includes('Promise')) {\n    result.error_handling.push('Promise');\n  }\n  if (content.includes('.catch(')) {\n    result.error_handling.push('.catch()');\n  }\n\n  return result;\n}\n\nexport function mergeTsResults(results: TsParseResult[]): TsParseResult {\n  const merged: TsParseResult = {\n    imports: [],\n    types: [],\n    functions: [],\n    error_handling: [],\n  };\n\n  const importCounts = new Map<string, number>();\n  const errorCounts = new Map<string, number>();\n\n  for (const r of results) {\n    for (const imp of r.imports) {\n      importCounts.set(imp, (importCounts.get(imp) || 0) + 1);\n    }\n    merged.types.push(...r.types);\n    merged.functions.push(...r.functions);\n    for (const e of r.error_handling) {\n      errorCounts.set(e, (errorCounts.get(e) || 0) + 1);\n    }\n  }\n\n  merged.imports = Array.from(importCounts.entries())\n    .sort((a, b) => b[1] - a[1])\n    .slice(0, 20)\n    .map(([mod]) => mod);\n\n  merged.error_handling = Array.from(errorCounts.entries())\n    .sort((a, b) => b[1] - a[1])\n    .slice(0, 10)\n    .map(([p]) => p);\n\n  merged.types = merged.types.slice(0, 100);\n  merged.functions = merged.functions.slice(0, 100);\n\n  return merged;\n}\n","/**\n * Python AST-level parser — extracts imports, classes, functions, docstrings,\n * and error handling patterns.\n *\n * Ported from knowledge-tree/extract_project_keywords.py parse_python_file()\n */\n\nexport interface PythonParseResult {\n  imports: string[];\n  types: Array<{\n    kind: string;\n    name: string;\n    bases: string[];\n    file: string;\n  }>;\n  functions: Array<{\n    name: string;\n    params: string;\n    file: string;\n  }>;\n  docstrings: string[];\n  error_handling: string[];\n}\n\nconst IMPORT_RE = /^(?:import|from)\\s+(\\w+)/gm;\nconst CLASS_RE = /\\bclass\\s+(\\w+)(?:\\s*\\(([^)]+)\\))?/g;\nconst FUNC_RE = /\\bdef\\s+(\\w+)\\s*\\(([^)]*)\\)/g;\nconst DOCSTRING_RE = /\"\"\"([^\"]{20,300})\"\"\"/g;\n\nexport function parsePythonFile(filepath: string, content: string): PythonParseResult {\n  const result: PythonParseResult = {\n    imports: [],\n    types: [],\n    functions: [],\n    docstrings: [],\n    error_handling: [],\n  };\n\n  let match: RegExpExecArray | null;\n\n  // Extract imports\n  while ((match = IMPORT_RE.exec(content)) !== null) {\n    result.imports.push(match[1]);\n  }\n\n  // Extract docstrings (module, class, function level) — high-signal domain intent\n  while ((match = DOCSTRING_RE.exec(content)) !== null) {\n    const firstSentence = match[1].trim().split('\\n')[0].slice(0, 120);\n    if (firstSentence.length > 15) {\n      result.docstrings.push(firstSentence);\n    }\n  }\n\n  // Extract class declarations\n  while ((match = CLASS_RE.exec(content)) !== null) {\n    const bases = (match[2] || '')\n      .split(',')\n      .map(b => b.trim())\n      .filter(Boolean);\n    result.types.push({\n      kind: 'class',\n      name: match[1],\n      bases,\n      file: filepath,\n    });\n  }\n\n  // Extract function declarations\n  while ((match = FUNC_RE.exec(content)) !== null) {\n    const name = match[1];\n    // Skip dunder methods (__init__, __str__)\n    if (name.startsWith('__') && name.endsWith('__')) continue;\n    result.functions.push({\n      name,\n      params: (match[2] || '').trim(),\n      file: filepath,\n    });\n  }\n\n  // Extract error handling patterns\n  if (content.includes('try:')) {\n    result.error_handling.push('try-except');\n  }\n  if (content.includes('raise')) {\n    result.error_handling.push('raise');\n  }\n\n  return result;\n}\n\nexport function mergePythonResults(results: PythonParseResult[]): PythonParseResult {\n  const merged: PythonParseResult = {\n    imports: [],\n    types: [],\n    functions: [],\n    docstrings: [],\n    error_handling: [],\n  };\n\n  const importCounts = new Map<string, number>();\n  const errorCounts = new Map<string, number>();\n\n  for (const r of results) {\n    for (const imp of r.imports) {\n      importCounts.set(imp, (importCounts.get(imp) || 0) + 1);\n    }\n    merged.types.push(...r.types);\n    merged.functions.push(...r.functions);\n    merged.docstrings.push(...r.docstrings);\n    for (const e of r.error_handling) {\n      errorCounts.set(e, (errorCounts.get(e) || 0) + 1);\n    }\n  }\n\n  merged.imports = Array.from(importCounts.entries())\n    .sort((a, b) => b[1] - a[1])\n    .slice(0, 20)\n    .map(([mod]) => mod);\n\n  merged.error_handling = Array.from(errorCounts.entries())\n    .sort((a, b) => b[1] - a[1])\n    .slice(0, 10)\n    .map(([p]) => p);\n\n  merged.types = merged.types.slice(0, 100);\n  merged.functions = merged.functions.slice(0, 100);\n  merged.docstrings = merged.docstrings.slice(0, 20);\n\n  return merged;\n}\n","/**\n * C++/Arduino AST-level parser — extracts #include, types, functions,\n * and error handling patterns.\n *\n * Ported from knowledge-tree/extract_project_keywords.py parse_cpp_file()\n */\n\nexport interface CppParseResult {\n  imports: string[];\n  types: Array<{\n    kind: string;\n    name: string;\n    file: string;\n  }>;\n  functions: Array<{\n    name: string;\n    file: string;\n  }>;\n  error_handling: string[];\n}\n\nconst INCLUDE_RE = /#include\\s*[<\"]([^>\"]+)[>\"]/g;\nconst TYPE_RE = /\\b(?:class|struct|enum)\\s+(\\w+)/g;\nconst FUNC_RE = /\\b(?:void|int|float|double|char|bool|String|uint8_t|uint16_t|uint32_t)\\s+(\\w+)\\s*\\(/g;\n\nexport function parseCppFile(filepath: string, content: string): CppParseResult {\n  const result: CppParseResult = {\n    imports: [],\n    types: [],\n    functions: [],\n    error_handling: [],\n  };\n\n  let match: RegExpExecArray | null;\n\n  // Extract #include\n  while ((match = INCLUDE_RE.exec(content)) !== null) {\n    result.imports.push(match[1]);\n  }\n\n  // Extract type declarations\n  while ((match = TYPE_RE.exec(content)) !== null) {\n    result.types.push({\n      kind: 'cpp',\n      name: match[1],\n      file: filepath,\n    });\n  }\n\n  // Extract function declarations\n  while ((match = FUNC_RE.exec(content)) !== null) {\n    result.functions.push({\n      name: match[1],\n      file: filepath,\n    });\n  }\n\n  // Extract error handling patterns\n  if (/\\btry\\b|\\bthrow\\b|\\bcatch\\b/.test(content)) {\n    result.error_handling.push('try/throw/catch');\n  }\n\n  return result;\n}\n\nexport function mergeCppResults(results: CppParseResult[]): CppParseResult {\n  const merged: CppParseResult = {\n    imports: [],\n    types: [],\n    functions: [],\n    error_handling: [],\n  };\n\n  const importCounts = new Map<string, number>();\n\n  for (const r of results) {\n    for (const imp of r.imports) {\n      importCounts.set(imp, (importCounts.get(imp) || 0) + 1);\n    }\n    merged.types.push(...r.types);\n    merged.functions.push(...r.functions);\n    merged.error_handling.push(...r.error_handling);\n  }\n\n  merged.imports = Array.from(importCounts.entries())\n    .sort((a, b) => b[1] - a[1])\n    .slice(0, 20)\n    .map(([mod]) => mod);\n\n  // Deduplicate error handling\n  merged.error_handling = [...new Set(merged.error_handling)];\n\n  return merged;\n}\n","/**\n * Keyword extraction logic — combines AST parser results into structured keywords\n * with source, weight, and context metadata.\n *\n * Ported from knowledge-tree/extract_project_keywords.py extract_keywords()\n */\n\nimport type { SwiftParseResult } from '../parsers/swift';\nimport type { TsParseResult } from '../parsers/typescript';\nimport type { PythonParseResult } from '../parsers/python';\nimport type { CppParseResult } from '../parsers/cpp';\n\nexport interface Keyword {\n  keyword: string;\n  source: string;\n  platform: string;\n  weight: number;\n  context: string;\n}\n\nexport type SourceContext = SwiftParseResult | TsParseResult | PythonParseResult | CppParseResult;\n\nexport interface ExtractKeywordsOptions {\n  /** Additional stdlib modules to skip (merged with defaults) */\n  extraStdlibModules?: string[];\n  /** Modules to un-skip even if in stdlib (e.g., 'math' for scientific projects) */\n  unskipModules?: string[];\n}\n\n/**\n * Standard library modules that carry no domain signal — skip as keywords.\n */\nconst STDLIB_MODULES = new Set([\n  // Python\n  'os', 'sys', 'typing', 'json', 're', 'math', 'random', 'time', 'datetime',\n  'pathlib', 'dataclasses', 'enum', 'collections', 'itertools', 'functools',\n  'logging', 'argparse', 'subprocess', 'threading', 'multiprocessing', 'asyncio',\n  'socket', 'http', 'urllib', 'ssl', 'hashlib', 'base64', 'csv', 'sqlite3',\n  'pickle', 'tempfile', 'shutil', 'glob', 'io', 'string', 'struct', 'uuid',\n  'abc', 'copy', 'decimal', 'fractions', 'statistics', 'queue', 'signal',\n  'traceback', 'warnings', 'weakref', 'contextlib', 'unittest', 'pytest',\n  'tkinter', 'tk', 'ttk', 'types', 'inspect', 'platform',\n  // Common third-party generic plumbing\n  'requests', 'urllib3', 'pydantic', 'dotenv', 'yaml', 'tomllib',\n]);\n\n/**\n * Map file path → platform (multi-codebase project: Swift app vs ESP32 firmware).\n */\nfunction platformFromPath(filePath: string): string {\n  if (!filePath) return 'app';\n  const fp = filePath.toLowerCase();\n  if (fp.endsWith('.ino') || fp.endsWith('.cpp') || fp.endsWith('.h') || fp.endsWith('.hpp') || fp.endsWith('.c')) {\n    if (fp.endsWith('.ino')) return 'esp32';\n    if (fp.includes('firmware') || fp.includes('esp')) return 'esp32';\n    return 'app';\n  }\n  return 'app';\n}\n\n/**\n * Extract structured keywords from source context and basic analysis.\n *\n * Multi-target: each keyword is tagged with platform (app/esp32) from its source file,\n * so downstream SIO generation produces correct keywords for each codebase.\n */\nexport function extractKeywords(\n  sourceContext: SourceContext,\n  basicAnalysis?: { config_files?: string[] },\n  repoDir?: string,\n  options?: ExtractKeywordsOptions,\n): Keyword[] {\n  const keywords: Keyword[] = [];\n\n  // Build effective stdlib set with overrides\n  const effectiveStdlib = new Set(STDLIB_MODULES);\n  if (options?.extraStdlibModules) {\n    for (const m of options.extraStdlibModules) effectiveStdlib.add(m.toLowerCase());\n  }\n  if (options?.unskipModules) {\n    for (const m of options.unskipModules) effectiveStdlib.delete(m.toLowerCase());\n  }\n\n  // Source 1: Import statements → framework keywords\n  if ('imports' in sourceContext) {\n    for (const imp of sourceContext.imports) {\n      let module: string;\n      let count = 1;\n      let platform = 'app';\n\n      if (typeof imp === 'string') {\n        module = imp;\n      } else if (imp && typeof imp === 'object' && 'module' in imp) {\n        const impObj = imp as { module: string; count?: number; file?: string };\n        module = impObj.module;\n        count = impObj.count || 1;\n        platform = platformFromPath(impObj.file || '');\n      } else {\n        continue;\n      }\n\n      // Skip standard library / generic plumbing — no domain signal\n      if (effectiveStdlib.has(module.toLowerCase())) continue;\n\n      keywords.push({\n        keyword: module,\n        source: 'import',\n        platform,\n        weight: 1.0 + (count - 1) * 0.1,\n        context: `Imported ${count} times`,\n      });\n    }\n  }\n\n  // Source 2: Type declarations → domain concepts\n  if ('types' in sourceContext) {\n    for (const typeDecl of sourceContext.types) {\n      const name = typeDecl.name;\n      const kind = typeDecl.kind;\n      const platform = platformFromPath(typeDecl.file || '');\n\n      // Skip generic/framework types\n      if (['View', 'Model', 'ViewModel', 'Controller', 'Service', 'Manager'].includes(name)) continue;\n\n      keywords.push({\n        keyword: name,\n        source: 'type_declaration',\n        platform,\n        weight: 1.5,\n        context: `${kind} declaration`,\n      });\n    }\n  }\n\n  // Source 3: Function signatures → business logic\n  if ('functions' in sourceContext) {\n    for (const func of sourceContext.functions) {\n      const name = func.name;\n      const platform = platformFromPath(func.file || '');\n\n      // Skip generic helpers\n      if (['init', 'setup', 'configure', 'initialize'].includes(name)) continue;\n\n      keywords.push({\n        keyword: name,\n        source: 'function_signature',\n        platform,\n        weight: 1.2,\n        context: 'Function signature',\n      });\n    }\n  }\n\n  // Source 3.5: Docstrings → domain intent (high signal) — Python only\n  if ('docstrings' in sourceContext && Array.isArray(sourceContext.docstrings)) {\n    for (const doc of sourceContext.docstrings) {\n      const firstSentence = doc.trim().split('\\n')[0].slice(0, 120);\n      if (firstSentence.length > 15) {\n        keywords.push({\n          keyword: firstSentence,\n          source: 'docstring',\n          platform: 'app',\n          weight: 1.8,\n          context: 'Docstring (domain intent)',\n        });\n      }\n    }\n  }\n\n  // Source 3.6: Framework usage → real practice keywords — Swift only\n  if ('frameworks_used' in sourceContext && Array.isArray(sourceContext.frameworks_used)) {\n    for (const fw of sourceContext.frameworks_used) {\n      const fwName = typeof fw === 'string' ? fw : (fw as { framework?: string }).framework || '';\n      if (fwName) {\n        keywords.push({\n          keyword: fwName,\n          source: 'framework_usage',\n          platform: 'app',\n          weight: 1.4,\n          context: 'Framework usage (real practice)',\n        });\n      }\n    }\n  }\n\n  // Source 4: Property wrappers → state management patterns — Swift only\n  if ('property_wrappers' in sourceContext && Array.isArray(sourceContext.property_wrappers)) {\n    for (const wrapper of sourceContext.property_wrappers) {\n      const wrapperName = typeof wrapper === 'string' ? wrapper : (wrapper as { wrapper?: string }).wrapper || '';\n      if (wrapperName) {\n        keywords.push({\n          keyword: `@${wrapperName}`,\n          source: 'property_wrapper',\n          platform: 'app',\n          weight: 2.0,\n          context: 'Property wrapper',\n        });\n      }\n    }\n  }\n\n  // Source 5: Error handling patterns → reliability concerns\n  const errorPatterns = 'error_handling' in sourceContext\n    ? sourceContext.error_handling\n    : 'error_handling_patterns' in sourceContext\n      ? (sourceContext as { error_handling_patterns?: Array<{ pattern: string; count?: number; file?: string }> }).error_handling_patterns || []\n      : [];\n\n  for (const error of errorPatterns) {\n    let pattern: string;\n    let platform = 'app';\n\n    if (typeof error === 'string') {\n      pattern = error;\n    } else if (error && typeof error === 'object' && 'pattern' in error) {\n      const errObj = error as { pattern: string; file?: string };\n      pattern = errObj.pattern;\n      platform = platformFromPath(errObj.file || '');\n    } else {\n      continue;\n    }\n\n    keywords.push({\n      keyword: pattern,\n      source: 'error_handling',\n      platform,\n      weight: 1.3,\n      context: 'Error handling pattern',\n    });\n  }\n\n  // Deduplicate by keyword (case-insensitive)\n  const seen = new Set<string>();\n  const uniqueKeywords: Keyword[] = [];\n  for (const kw of keywords) {\n    const key = kw.keyword.toLowerCase();\n    if (!seen.has(key)) {\n      seen.add(key);\n      uniqueKeywords.push(kw);\n    }\n  }\n\n  return uniqueKeywords;\n}\n","/**\n * LLM client wrapper — provides a unified interface for LLM calls\n * used by the graph generation pipeline.\n *\n * Supports OpenAI-compatible APIs via environment variables:\n *   LLM_API_KEY, LLM_BASE_URL, LLM_MODEL (or LLM_TIER_FAST / LLM_TIER_STRONG)\n */\n\nexport interface LlmClientConfig {\n  apiKey?: string;\n  baseUrl?: string;\n  model?: string;\n  temperature?: number;\n  maxTokens?: number;\n}\n\n/** One callable provider endpoint in the fallback chain. */\nexport interface ProviderSpec {\n  label: string;\n  baseUrl: string;\n  apiKey: string;\n  model: string;\n}\n\nexport interface LlmClient {\n  chat(messages: LlmChatMessage[], options?: { temperature?: number; maxTokens?: number }): Promise<LlmChatResult>;\n  model: string;\n}\n\nexport interface LlmChatMessage {\n  role: 'system' | 'user' | 'assistant';\n  content: string;\n}\n\nexport interface LlmChatResult {\n  content: string;\n  model: string;\n  /** Provider label that ultimately served the request. */\n  provider?: string;\n  /** What happened per provider when fallback occurred (empty when first try succeeded). */\n  attempts?: string[];\n  /** 'stop' when complete; 'length' means the response was TRUNCATED by max_tokens. */\n  finishReason?: string;\n  usage?: {\n    prompt_tokens: number;\n    completion_tokens: number;\n    total_tokens: number;\n    finishReason?: string;\n};\n}\n\nexport class LlmClientError extends Error {\n  constructor(\n    message: string,\n    public readonly status?: number,\n    public readonly cause?: Error,\n  ) {\n    super(message);\n    this.name = 'LlmClientError';\n  }\n}\n\n/**\n * Create an LLM client from environment variables.\n */\n/**\n * Resolve the provider fallback chain from explicit config and environment.\n * Base order: explicit config > legacy LLM_API_KEY/OPENAI_API_KEY > NVIDIA NIM >\n * OpenRouter > DashScope/Alibaba MaaS. First entry is PRIMARY; the rest are\n * fallbacks tried in order.\n *\n * QUALITY-EVAL MODE: when OPENROUTER_MODEL is set (a paid preset), OpenRouter\n * is promoted to PRIMARY so generation quality is evaluated without free-tier\n * 429/403 noise. NVIDIA/dashscope then act only as safety-net fallbacks.\n */\nexport function resolveProviderChain(config?: LlmClientConfig): ProviderSpec[] {\n  const chain: ProviderSpec[] = [];\n  const push = (label: string, baseUrl: string, apiKey: string, model: string): void => {\n    if (apiKey && baseUrl && model && !chain.some((c) => c.baseUrl === baseUrl && c.model === model)) {\n      chain.push({ label, baseUrl, apiKey, model });\n    }\n  };\n  // Explicit single-provider config keeps its historical meaning.\n  if (config?.apiKey) {\n    push('config', config.baseUrl || 'https://api.openai.com/v1', config.apiKey, config.model || 'gpt-4o-mini');\n  }\n  // Legacy generic env (knowledge-tree compatible: OPENAI_BASE_URL + LLM_MODEL).\n  push('legacy', process.env.LLM_BASE_URL || process.env.OPENAI_BASE_URL || '', process.env.LLM_API_KEY || process.env.OPENAI_API_KEY || '', process.env.LLM_MODEL || process.env.LLM_TIER_FAST || '');\n  // DashScope / Alibaba MaaS (OpenAI-compatible endpoints).\n  push('dashscope', process.env.DASHSCOPE_BASE_URL || process.env.ALIBABA_BASE_URL || '', process.env.DASHSCOPE_API_KEY || process.env.ALIBABA_API_KEY || '', process.env.DASHSCOPE_MODEL || process.env.DEFAULT_AI_MODEL || '');\n  // NVIDIA NIM — hosted provider for generation workloads.\n  push('nvidia', 'https://integrate.api.nvidia.com/v1', process.env.NVIDIA_API_KEY || '', process.env.NVIDIA_MODEL || 'nvidia/nemotron-3-ultra-550b-a55b');\n  // OpenRouter — paid preset primary when OPENROUTER_MODEL pins a model/preset.\n  push('openrouter', 'https://openrouter.ai/api/v1', process.env.OPENROUTER_API_KEY || '', process.env.OPENROUTER_MODEL || 'nvidia/nemotron-3-ultra-550b-a55b');\n  // QUALITY-EVAL MODE: paid OpenRouter preset goes FIRST (no 429 noise).\n  if (process.env.OPENROUTER_MODEL) {\n    const or = chain.find((c) => c.label === 'openrouter');\n    if (or) {\n      const rest = chain.filter((c) => c !== or);\n      return [or, ...rest];\n    }\n  }\n  return chain;\n}\n\n// Free-tier rate limits (NVIDIA NIM, OpenRouter) trip when a pipeline fires\n// many requests in a burst. Global pacing keeps us under the limit; a single\n// isolated call still goes through immediately.\nconst MIN_REQUEST_INTERVAL_MS = 2_500;\nlet lastRequestAt = 0;\n\nasync function pacedDelay(): Promise<void> {\n  const wait = lastRequestAt + MIN_REQUEST_INTERVAL_MS - Date.now();\n  if (wait > 0) await new Promise((resolve) => setTimeout(resolve, wait));\n  lastRequestAt = Date.now();\n}\n\nexport function createLlmClient(config?: LlmClientConfig): LlmClient {\n  const chain = resolveProviderChain(config);\n  const primary = chain[0];\n  if (!primary) {\n    throw new LlmClientError(\n      'No LLM provider configured. Set NVIDIA_API_KEY (primary) and/or OPENROUTER_API_KEY (fallback), or pass llmConfig.',\n    );\n  }\n  const apiKey = primary.apiKey;\n  const baseUrl = primary.baseUrl;\n  const model = primary.model;\n\n  async function chat(\n    messages: LlmChatMessage[],\n    options?: { temperature?: number; maxTokens?: number },\n  ): Promise<LlmChatResult> {\n    const temperature = options?.temperature ?? config?.temperature ?? 0.1;\n    const maxTokens = options?.maxTokens ?? config?.maxTokens ?? parseInt(process.env.LLM_MAX_TOKENS || '65536', 10);\n\n    const attempts: string[] = [];\n    let lastError: LlmClientError | null = null;\n    const TRANSIENT = new Set([408, 429, 500, 502, 503, 504]);\n    // Hard per-request cap so a hanging provider degrades to a transient error\n    // and the chain falls through instead of blocking the pipeline forever.\n    // Reasoning presets (e.g. deepseek-v4-flash) can legitimately think for\n    // minutes on large structured outputs — 5 minutes default, env-overridable.\n    const REQUEST_TIMEOUT_MS = Number(process.env.LLM_REQUEST_TIMEOUT_MS || 300_000);\n    const MAX_CHAIN_ROUNDS = 3;\n    for (let round = 1; round <= MAX_CHAIN_ROUNDS; round++) {\n      if (round > 1) {\n        // Whole chain failed transiently (rate limits / upstream 5xx) — back\n        // off and rewalk the chain from the primary instead of dying.\n        attempts.push('round ' + (round - 1) + ' failed — backing off 20s before rewalking the chain');\n        await new Promise((resolve) => setTimeout(resolve, 20_000));\n      }\n      for (const provider of chain) {\n      try {\n        const headers = {\n          'Content-Type': 'application/json',\n          'Authorization': `Bearer ${provider.apiKey}`,\n        };\n        const payload = {\n          model: provider.model,\n          messages,\n          temperature,\n          max_tokens: maxTokens,\n        };\n        await pacedDelay();\n        const doFetch = (): Promise<Response> => fetch(`${provider.baseUrl}/chat/completions`, {\n          method: 'POST',\n          headers: {\n            'Content-Type': 'application/json',\n            'Authorization': `Bearer ${provider.apiKey}`,\n          },\n          body: JSON.stringify({\n            model: provider.model,\n            messages,\n            temperature,\n            max_tokens: maxTokens,\n          }),\n          signal: AbortSignal.timeout(REQUEST_TIMEOUT_MS),\n        });\n        // Transient network failures (DNS blip, TLS reset, \"fetch failed\") get\n        // one same-provider retry before falling through the chain.\n        let response: Response;\n        try {\n          response = await doFetch();\n        } catch (netErr) {\n          attempts.push(`${provider.label}: network error (${netErr instanceof Error ? netErr.message : String(netErr)}) — retrying once`);\n          await new Promise((r) => setTimeout(r, 5_000));\n          lastRequestAt = Date.now();\n          response = await doFetch();\n        }\n        if (!response.ok) {\n          const body = await response.text().catch(() => '');\n          const err = new LlmClientError(\n            `[${provider.label}] LLM API error: ${response.status} ${response.statusText} — ${body.slice(0, 200)}`,\n            response.status,\n          );\n          if (response.status === 429) {\n            // Rate-limited: honor Retry-After (bounded) and retry once on the\n            // same provider before falling through to the next one.\n            const retryAfterRaw = response.headers.get('retry-after');\n            const retryAfterMs = Math.min(\n              60_000,\n              Math.max(15_000, (Number.isFinite(Number(retryAfterRaw)) ? Number(retryAfterRaw) : 20) * 1_000),\n            );\n            attempts.push(`${provider.label}: 429 rate-limited — backing off ${Math.round(retryAfterMs / 1000)}s`);\n            await new Promise((resolve) => setTimeout(resolve, retryAfterMs));\n            lastRequestAt = Date.now();\n            const retry = await fetch(`${provider.baseUrl}/chat/completions`, {\n              method: 'POST',\n              headers,\n              body: JSON.stringify(payload),\n              signal: AbortSignal.timeout(REQUEST_TIMEOUT_MS),\n            });\n            if (!retry.ok) throw err;\n            const retryData = await retry.json() as {\n              choices?: Array<{ message?: { content?: string }; finish_reason?: string }>;\n              model?: string;\n              usage?: { prompt_tokens: number; completion_tokens: number; total_tokens: number };\n            };\n            const retryContent2 = retryData.choices?.[0]?.message?.content || '';\n            if (!retryContent2.trim()) throw err;\n            return {\n              content: retryContent2,\n              model: retryData.model || provider.model,\n              provider: provider.label,\n              attempts: attempts.slice(),\n              usage: retryData.usage,\n              finishReason: retryData.choices?.[0]?.finish_reason,\n            };\n          }\n          if (TRANSIENT.has(response.status)) {\n            await new Promise((r) => setTimeout(r, 3000));\n            const retry = await fetch(`${provider.baseUrl}/chat/completions`, {\n              signal: AbortSignal.timeout(REQUEST_TIMEOUT_MS),\n              method: 'POST',\n              headers: {\n                'Content-Type': 'application/json',\n                'Authorization': `Bearer ${provider.apiKey}`,\n              },\n              body: JSON.stringify({\n                model: provider.model,\n                messages,\n                temperature,\n                max_tokens: maxTokens,\n              }),\n            });\n            if (!retry.ok) throw err; // still transient-failing — fall through to next provider\n            const retryData = await retry.json() as {\n              choices?: Array<{ message?: { content?: string }; finish_reason?: string }>;\n              model?: string;\n              usage?: { prompt_tokens: number; completion_tokens: number; total_tokens: number };\n            };\n            const retryContent = retryData.choices?.[0]?.message?.content || '';\n            return {\n              content: retryContent,\n              model: retryData.model || provider.model,\n              provider: provider.label,\n              attempts: attempts.slice(),\n              usage: retryData.usage,\n              finishReason: retryData.choices?.[0]?.finish_reason,\n            };\n          }\n          throw err;\n        }\n        const data = await response.json() as {\n          choices?: Array<{ message?: { content?: string }; finish_reason?: string }>;\n          model?: string;\n          usage?: { prompt_tokens: number; completion_tokens: number; total_tokens: number };\n        };\n        const wrappedError = (data as { error?: { message?: string; code?: number } }).error;\n        if (wrappedError) {\n          // OpenRouter proxies some upstream failures as HTTP 200 with an\n          // {\"error\": {...}} body — treat as transient and fall through.\n          throw new LlmClientError('[' + provider.label + '] upstream error ' + (wrappedError.code ?? '') + ': ' + (wrappedError.message ?? 'unknown'));\n        }\n        const content = data.choices?.[0]?.message?.content || '';\n        if (!content.trim()) {\n          // Empty completion (provider outage / content filter) is transient —\n          // fall through to the next provider instead of returning unusable ''.\n          throw new LlmClientError('[' + provider.label + '] empty completion returned');\n        }\n        return {\n          content,\n          model: data.model || provider.model,\n          provider: provider.label,\n          attempts: attempts.slice(),\n          usage: data.usage,\n          finishReason: data.choices?.[0]?.finish_reason,\n        };\n      } catch (err) {\n        const msg = err instanceof Error ? err.message : String(err);\n        attempts.push(`${provider.label}: ${msg}`);\n        lastError = err instanceof LlmClientError ? err : new LlmClientError(`[${provider.label}] ${msg}`);\n        // try next provider\n      }\n    }\n      if (round < MAX_CHAIN_ROUNDS) continue; // rewalk the chain\n      throw lastError ?? new LlmClientError('All LLM providers failed (empty chain).');\n    }\n    throw lastError ?? new LlmClientError('All LLM providers failed after ' + MAX_CHAIN_ROUNDS + ' rounds.');\n  }\n\n  return { chat, model };\n}\n\n/**\n * Parse JSON from LLM response, handling markdown code fences.\n */\nexport function parseJsonFromLlm(text: string): Record<string, unknown> {\n  // Strip markdown code fences if present\n  let cleaned = text.trim();\n  if (cleaned.startsWith('```json')) {\n    cleaned = cleaned.slice(7);\n  } else if (cleaned.startsWith('```')) {\n    cleaned = cleaned.slice(3);\n  }\n  if (cleaned.endsWith('```')) {\n    cleaned = cleaned.slice(0, -3);\n  }\n  cleaned = cleaned.trim();\n\n  try {\n    return JSON.parse(cleaned) as Record<string, unknown>;\n  } catch {\n    // Try to find first complete JSON object using brace-depth tracking\n    const start = cleaned.indexOf('{');\n    if (start >= 0) {\n      let depth = 0;\n      let inString = false;\n      let escape = false;\n      for (let i = start; i < cleaned.length; i++) {\n        const ch = cleaned[i];\n        if (escape) { escape = false; continue; }\n        if (ch === '\\\\') { escape = true; continue; }\n        if (ch === '\"') { inString = !inString; continue; }\n        if (inString) continue;\n        if (ch === '{') depth++;\n        if (ch === '}') {\n          depth--;\n          if (depth === 0) {\n            try {\n              return JSON.parse(cleaned.slice(start, i + 1)) as Record<string, unknown>;\n            } catch {\n              // keep looking\n            }\n          }\n        }\n      }\n    }\n    throw new LlmClientError(`Failed to parse JSON from LLM response: ${cleaned.slice(0, 200)}`);\n  }\n}\n\n/**\n * Call LLM and parse JSON response.\n */\nexport async function llmChatJson(\n  client: ReturnType<typeof createLlmClient>,\n  systemPrompt: string,\n  userPrompt: string,\n  options?: { temperature?: number; maxTokens?: number },\n): Promise<Record<string, unknown>> {\n  const result = await client.chat(\n    [\n      { role: 'system', content: systemPrompt },\n      { role: 'user', content: userPrompt },\n    ],\n    options,\n  );\n\n  return parseJsonFromLlm(result.content);\n}\n","/**\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 } 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}\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 } = options;\n  const client = 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 } 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}\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 } = options;\n  const client = 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 AST 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        '\\nAST Domain Keywords & Patterns (from static analysis — 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 } 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}\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 } = options;\n  const client = 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): Promise<Map<string, Step[]>> {\n  const client = 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 } 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  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}\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 } = 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 = 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\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      } else {\n        const inferred = inferDepthFromContext(kw, fileContentsMap);\n        depth = inferred.depth;\n        depthRationale = inferred.rationale;\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        evidence_files: evidenceFiles,\n      });\n    }\n\n    featureConcepts.set(fid, items);\n  }\n\n  return featureConcepts;\n}\n","/**\n * Concept resolution — maps keywords to Master Tree concepts.\n *\n * Ported from knowledge-tree/resolve_concepts.py\n * Uses ULO/CIO/SIO-aware matching:\n *   - SIO keywords → match against concept.keywords (tech-specific)\n *   - CIO keywords → match against concept.description (mechanism)\n *   - ULO keywords → match against concept.ulo (what/why, tech-independent)\n *\n * Fallback: keyword overlap matching when embeddings unavailable.\n *\n * NOTE: This module requires sentence-transformers Python package for embeddings.\n * In pure TypeScript mode, it falls back to keyword overlap matching.\n */\n\nimport { createLlmClient, llmChatJson, type LlmClientConfig } from '../utils/llmClient';\nimport type { Keyword } from '../extractors/keywordExtractor';\n\nexport interface ResolvedConcept {\n  keyword: string;\n  source: string;\n  depth: 'ulo' | 'cio' | 'sio';\n  concept_codes: string[];\n  matches: ConceptMatch[];\n  override?: boolean;\n  rechecked?: boolean;\n}\n\nexport interface ConceptMatch {\n  code: string;\n  name: string;\n  description: string;\n  keywords: string;\n  ulo?: string;\n  cio?: string;\n  score: number;\n  matched_level: 'ulo' | 'cio' | 'sio';\n  method: 'embedding' | 'keyword_overlap';\n}\n\nexport interface ProposedConcept {\n  keyword: string;\n  source: string;\n  depth: 'ulo' | 'cio' | 'sio';\n  reason: string;\n  best_match?: ConceptMatch;\n}\n\nexport interface ResolveConceptsResult {\n  resolved: ResolvedConcept[];\n  proposed: ProposedConcept[];\n  summary: {\n    total_keywords: number;\n    resolved_count: number;\n    proposed_count: number;\n    search_mode: string;\n  };\n}\n\nexport interface ResolveConceptsOptions {\n  keywords: Keyword[];\n  goal: string;\n  embeddings?: Record<string, { embedding?: number[]; name?: string; description?: string; keywords?: string; ulo?: string; cio?: string }>;\n  /** Pre-computed depth from conceptEscalator — overrides inferDepthFromSource */\n  depthOverrides?: Map<string, 'ulo' | 'cio' | 'sio'>;\n  topK?: number;\n  threshold?: number;\n  llmConfig?: LlmClientConfig;\n}\n\n// Source-based thresholds\nconst SOURCE_THRESHOLDS: Record<string, number> = {\n  docstring: 0.45,\n  readme_description: 0.45,\n  readme: 0.50,\n  type_declaration: 0.55,\n  function_signature: 0.55,\n  import: 0.60,\n  property_wrapper: 0.55,\n  error_handling: 0.60,\n  config: 0.60,\n  framework_usage: 0.45,\n};\n\nconst DEFAULT_THRESHOLD = 0.55;\n\nfunction cosineSimilarity(a: number[], b: number[]): number {\n  if (!a.length || !b.length || a.length !== b.length) return 0;\n  let dot = 0, normA = 0, normB = 0;\n  for (let i = 0; i < a.length; i++) {\n    dot += a[i] * b[i];\n    normA += a[i] * a[i];\n    normB += b[i] * b[i];\n  }\n  if (normA === 0 || normB === 0) return 0;\n  return dot / (Math.sqrt(normA) * Math.sqrt(normB));\n}\n\n/**\n * ULO/CIO/SIO-aware keyword overlap scoring.\n * Matches against different concept fields based on depth level.\n */\nfunction uloCioAwareScore(\n  query: string,\n  depth: 'ulo' | 'cio' | 'sio',\n  conceptData: { keywords?: string; description?: string; ulo?: string; cio?: string },\n): number {\n  const queryTerms = new Set(query.toLowerCase().split(/\\s+/));\n\n  // Choose which fields to match based on depth\n  let targetText = '';\n  if (depth === 'sio') {\n    // SIO: match against keywords (tech-specific terms)\n    targetText = conceptData.keywords || '';\n  } else if (depth === 'cio') {\n    // CIO: match against description + cio (mechanism)\n    targetText = [conceptData.description || '', conceptData.cio || ''].join(' ');\n  } else {\n    // ULO: match against ulo + description (what/why, tech-independent)\n    targetText = [conceptData.ulo || '', conceptData.description || ''].join(' ');\n  }\n\n  const targetTerms = new Set(targetText.toLowerCase().split(/\\s+/));\n  if (!queryTerms.size || !targetTerms.size) return 0;\n\n  let overlap = 0;\n  for (const t of queryTerms) {\n    if (targetTerms.has(t)) overlap++;\n  }\n  return Math.min(overlap / queryTerms.size, 1.0);\n}\n\n\nfunction inferFieldsFromGoal(goal: string): string[] {\n  const goalLower = goal.toLowerCase();\n  const fieldKeywords: Record<string, string[]> = {\n    ASE: ['algorithm', 'software', 'programming', 'code', 'develop', 'build', 'app'],\n    DAI: ['data', 'database', 'storage', 'query', 'sql', 'analytics'],\n    CSN: ['network', 'protocol', 'server', 'client', 'api', 'http'],\n    HCI: ['user', 'interface', 'ui', 'ux', 'interaction', 'design'],\n    MOB: ['mobile', 'ios', 'android', 'swift', 'kotlin', 'flutter'],\n    WEB: ['web', 'html', 'css', 'javascript', 'react', 'vue'],\n  };\n\n  const matched: string[] = [];\n  for (const [code, keywords] of Object.entries(fieldKeywords)) {\n    if (keywords.some(kw => goalLower.includes(kw))) matched.push(code);\n  }\n  return matched.length > 0 ? matched : ['ASE'];\n}\n\n/**\n * Infer depth from keyword source and context.\n */\nfunction inferDepthFromSource(source: string): 'ulo' | 'cio' | 'sio' {\n  const uloSources = ['docstring', 'readme', 'readme_description', 'framework_usage'];\n  const cioSources = ['type_declaration', 'function_signature', 'config'];\n\n  if (uloSources.includes(source)) return 'ulo';\n  if (cioSources.includes(source)) return 'cio';\n  return 'sio';\n}\n\n/**\n * Resolve keywords to concepts using ULO/CIO/SIO-aware matching.\n */\nexport async function resolveConcepts(\n  options: ResolveConceptsOptions,\n): Promise<ResolveConceptsResult> {\n  const { keywords, goal, embeddings, depthOverrides, topK = 3, threshold = DEFAULT_THRESHOLD, llmConfig } = options;\n\n  const relevantFields = inferFieldsFromGoal(goal);\n  const resolved: ResolvedConcept[] = [];\n  const proposed: ProposedConcept[] = [];\n  const hasEmbeddings = Object.keys(embeddings || {}).length > 0 &&\n    Object.values(embeddings || {}).some(d => d.embedding && d.embedding.length > 0);\n  let search_mode = hasEmbeddings ? 'embedding' : 'keyword_overlap';\n\n  const concepts = embeddings || {};\n\n  for (const kwData of keywords) {\n    const keyword = kwData.keyword;\n    const source = kwData.source;\n    // Use escalator's depth override if available, else infer from source\n    const depth = depthOverrides?.get(keyword) || inferDepthFromSource(source);\n\n    // Search concepts via ULO/CIO/SIO-aware matching\n    const scored: ConceptMatch[] = [];\n    for (const [code, data] of Object.entries(concepts)) {\n      const conceptKeywords = data.keywords || '';\n      const conceptDesc = data.description || '';\n      const conceptUlo = (data as Record<string, unknown>).ulo as string | undefined;\n      const conceptCio = (data as Record<string, unknown>).cio as string | undefined;\n\n      // Primary: ULO/CIO-aware score based on depth level\n      const awareScore = uloCioAwareScore(keyword, depth, {\n        keywords: conceptKeywords,\n        description: conceptDesc,\n        ulo: conceptUlo,\n        cio: conceptCio,\n      });\n\n      // Fallback: broad keyword overlap across all fields\n      const queryTerms = new Set(keyword.toLowerCase().split(/\\s+/));\n      const allTerms = new Set([\n        ...conceptKeywords.toLowerCase().split(/\\s+/),\n        ...conceptDesc.toLowerCase().split(/\\s+/),\n        ...(conceptUlo || '').toLowerCase().split(/\\s+/),\n        ...(conceptCio || '').toLowerCase().split(/\\s+/),\n      ].filter(Boolean));\n      let overlapCount = 0;\n      for (const t of queryTerms) { if (allTerms.has(t)) overlapCount++; }\n      const fallbackScore = queryTerms.size > 0 ? Math.min(overlapCount / queryTerms.size, 1.0) : 0;\n\n      // Use the higher score, but track which method won\n      const usedAware = awareScore >= fallbackScore;\n      const finalScore = usedAware ? awareScore : fallbackScore;\n\n      if (finalScore > 0) {\n        scored.push({\n          code,\n          name: data.name || code,\n          description: conceptDesc,\n          keywords: conceptKeywords,\n          ulo: conceptUlo,\n          cio: conceptCio,\n          score: finalScore,\n          matched_level: usedAware ? depth : 'sio',\n          method: hasEmbeddings && data.embedding && data.embedding.length > 0 ? 'embedding' : 'keyword_overlap',\n        });\n      }\n    }\n\n    scored.sort((a, b) => b.score - a.score);\n    const topMatches = scored.slice(0, topK);\n\n    if (topMatches.length === 0) {\n      proposed.push({\n        keyword,\n        source,\n        depth,\n        reason: 'No matches in Master Tree',\n      });\n      continue;\n    }\n\n    const effThreshold = SOURCE_THRESHOLDS[source] || threshold;\n    const topMatch = topMatches[0];\n\n    if (topMatch.score >= effThreshold) {\n      resolved.push({\n        keyword,\n        source,\n        depth,\n        concept_codes: topMatches.filter(m => m.score >= effThreshold).map(m => m.code),\n        matches: topMatches,\n      });\n    } else {\n      proposed.push({\n        keyword,\n        source,\n        depth,\n        best_match: topMatch,\n        reason: `Low confidence (${topMatch.score.toFixed(2)} < ${effThreshold})`,\n      });\n    }\n  }\n\n  return {\n    resolved,\n    proposed,\n    summary: {\n      total_keywords: keywords.length,\n      resolved_count: resolved.length,\n      proposed_count: proposed.length,\n      search_mode,\n    },\n  };\n}\n","/**\n * Roadmap assembly — assembles final roadmap with keyword tracking and time awareness.\n *\n * Ported from knowledge-tree/assemble_roadmap.py\n * Handles: topo sort, phases, keyword-per-milestone tracking.\n *\n * Improvements:\n *   - Time budget per session/lesson\n *   - Overhead factor (setup, transitions, review)\n *   - Smart feature → milestone splitting (respect time constraints)\n *   - Phase grouping based on concept progression\n */\n\nimport type { ProjectGraph, Feature, Step } from '../schemas/projectGraphSchema';\nimport type { ConceptMapping } from '../graph/conceptEscalator';\n\nexport interface AssembledMilestone {\n  id: string;\n  name: string;\n  description: string;\n  feature_id: string;\n  feature_name: string;\n  concept_code: string;\n  depth: 'ulo' | 'cio' | 'sio';\n  all_keywords: string[];\n  new_keywords: string[];\n  prerequisite_keywords: string[];\n  steps: Step[];\n  estimated_minutes: number;\n  adjusted_minutes: number; // with overhead\n  completion_level: string;\n}\n\nexport interface AssembledPhase {\n  phase_id: number;\n  phase_name: string;\n  milestones: AssembledMilestone[];\n  total_minutes: number;\n  concept_progression: string; // e.g., \"ULO → CIO → SIO\"\n}\n\nexport interface AssembledRoadmap {\n  project: ProjectGraph['project'];\n  product: ProjectGraph['product'];\n  phases: AssembledPhase[];\n  feature_concepts: Map<string, ConceptMapping[]>;\n  time_budget: {\n    session_minutes: number;\n    overhead_factor: number;\n    total_estimated_minutes: number;\n    total_adjusted_minutes: number;\n  };\n}\n\nexport interface AssembleOptions {\n  projectGraph: ProjectGraph;\n  featureConcepts?: Map<string, ConceptMapping[]>;\n  sessionMinutes?: number;       // Target minutes per session/lesson (default: 90)\n  overheadFactor?: number;       // Overhead multiplier (default: 1.15 = 15% overhead)\n  maxMilestoneMinutes?: number;  // Max minutes before splitting a milestone (default: 120)\n}\n\n// ─── Overhead Calculation ────────────────────────────────────────────────────\n\n/**\n * Calculate overhead-adjusted minutes for a milestone.\n * Overhead includes: setup time, transitions, review, Q&A.\n */\nfunction calculateOverhead(\n  rawMinutes: number,\n  overheadFactor: number,\n): number {\n  return Math.ceil(rawMinutes * overheadFactor);\n}\n\n// ─── Milestone Splitting ─────────────────────────────────────────────────────\n\n/**\n * Split a feature's steps into multiple milestones if they exceed maxMilestoneMinutes.\n * Splits at natural break points (between steps of different complexity).\n */\nfunction splitFeatureIntoMilestones(\n  feature: Feature,\n  featureConcepts: ConceptMapping[],\n  maxMinutes: number,\n  overheadFactor: number,\n): AssembledMilestone[] {\n  const steps = feature.steps || [];\n  if (steps.length === 0) return [];\n\n  const featureId = feature.id || 'F_UNK';\n\n  // Calculate raw minutes per step\n  const stepMinutes = steps.map(s => s.effort?.estimated_minutes || 15);\n  const totalRawMinutes = stepMinutes.reduce((a, b) => a + b, 0);\n\n  // If within budget, return as single milestone\n  if (calculateOverhead(totalRawMinutes, overheadFactor) <= maxMinutes) {\n    return [buildMilestone(feature, featureConcepts, steps, stepMinutes, featureId, 1)];\n  }\n\n  // Split into multiple milestones\n  const milestones: AssembledMilestone[] = [];\n  let currentSteps: Step[] = [];\n  let currentMinutes: number[] = [];\n  let milestoneIndex = 1;\n\n  for (let i = 0; i < steps.length; i++) {\n    const step = steps[i];\n    const mins = stepMinutes[i];\n\n    // Check if adding this step would exceed budget\n    const currentTotal = currentMinutes.reduce((a, b) => a + b, 0);\n    if (calculateOverhead(currentTotal + mins, overheadFactor) > maxMinutes && currentSteps.length > 0) {\n      // Split here\n      milestones.push(buildMilestone(\n        feature, featureConcepts, currentSteps, currentMinutes,\n        featureId, milestoneIndex,\n      ));\n      milestoneIndex++;\n      currentSteps = [];\n      currentMinutes = [];\n    }\n\n    currentSteps.push(step);\n    currentMinutes.push(mins);\n  }\n\n  // Don't forget the last group\n  if (currentSteps.length > 0) {\n    milestones.push(buildMilestone(\n      feature, featureConcepts, currentSteps, currentMinutes,\n      featureId, milestoneIndex,\n    ));\n  }\n\n  return milestones;\n}\n\n/**\n * Build a single AssembledMilestone from steps.\n * Concept codes are mapped per-step, not per-feature.\n */\nfunction buildMilestone(\n  feature: Feature,\n  featureConcepts: ConceptMapping[],\n  steps: Step[],\n  stepMinutes: number[],\n  featureId: string,\n  milestoneIndex: number,\n): AssembledMilestone {\n  const rawMinutes = stepMinutes.reduce((a, b) => a + b, 0);\n  const levels = steps.map(s => s.completion_level || 'mvp');\n  const completionLevel = levels.includes('extend') ? 'extend'\n    : levels.includes('mvp') ? 'mvp'\n    : 'base';\n\n  // Collect concept codes PER STEP (not per feature)\n  const milestoneConcepts = new Set<string>();\n  const milestoneKeywords = new Set<string>();\n  for (const step of steps) {\n    // Use step-level concept_codes if propagated, else match by keyword\n    const stepConceptCodes = step.concept_codes || [];\n    for (const code of stepConceptCodes) {\n      milestoneConcepts.add(code);\n    }\n    // Also match by keyword presence\n    const stepKws = [...(step.keywords || []), ...(step.api_usage || [])];\n    for (const cm of featureConcepts) {\n      if (stepKws.includes(cm.keyword)) {\n        milestoneConcepts.add(cm.concept_code);\n        milestoneKeywords.add(cm.keyword);\n      }\n    }\n  }\n\n  // Determine dominant depth from step-level concept mappings\n  const depthCounts = { ulo: 0, cio: 0, sio: 0 };\n  for (const cm of featureConcepts) {\n    if (milestoneKeywords.has(cm.keyword)) {\n      depthCounts[cm.depth]++;\n    }\n  }\n  const dominantDepth: 'ulo' | 'cio' | 'sio' =\n    depthCounts.sio >= depthCounts.cio && depthCounts.sio >= depthCounts.ulo ? 'sio'\n    : depthCounts.cio >= depthCounts.ulo ? 'cio'\n    : 'ulo';\n\n  return {\n    id: milestoneIndex === 1 ? featureId : `${featureId}-M${milestoneIndex}`,\n    name: milestoneIndex === 1 ? (feature.name || featureId) : `${feature.name || featureId} (Part ${milestoneIndex})`,\n    description: feature.description || '',\n    feature_id: featureId,\n    feature_name: feature.name || '',\n    concept_code: [...milestoneConcepts].join(', '),\n    depth: dominantDepth,\n    all_keywords: [],\n    new_keywords: [],\n    prerequisite_keywords: [],\n    steps,\n    estimated_minutes: rawMinutes,\n    adjusted_minutes: rawMinutes, // placeholder — assembleRoadmap() applies actual overheadFactor\n    completion_level: completionLevel,\n  };\n}\n\n// ─── Keyword Tracking ────────────────────────────────────────────────────────\n\n/**\n * Build keyword map: concept_code → [keywords]\n */\nfunction buildKeywordMap(\n  featureConcepts: Map<string, ConceptMapping[]>,\n): Map<string, string[]> {\n  const map = new Map<string, string[]>();\n  for (const mappings of featureConcepts.values()) {\n    for (const m of mappings) {\n      const existing = map.get(m.concept_code) || [];\n      if (!existing.includes(m.keyword)) {\n        existing.push(m.keyword);\n        map.set(m.concept_code, existing);\n      }\n    }\n  }\n  return map;\n}\n\n/**\n * Attach keywords to milestones, computing new vs prerequisite.\n */\nfunction attachKeywordsToMilestones(\n  milestones: AssembledMilestone[],\n  keywordMap: Map<string, string[]>,\n): AssembledMilestone[] {\n  const cumulativeKeywords = new Set<string>();\n\n  for (const milestone of milestones) {\n    // Aggregate keywords from concept codes\n    const allKw = new Set<string>();\n    const conceptCodes = milestone.concept_code.split(',').map((c: string) => c.trim()).filter(Boolean);\n    for (const code of conceptCodes) {\n      const kws = keywordMap.get(code) || [];\n      for (const kw of kws) allKw.add(kw);\n    }\n\n    milestone.all_keywords = Array.from(allKw).sort();\n\n    // Compute new vs prerequisite\n    const newKw: string[] = [];\n    const prereqKw: string[] = [];\n    for (const kw of milestone.all_keywords) {\n      if (cumulativeKeywords.has(kw)) {\n        prereqKw.push(kw);\n      } else {\n        newKw.push(kw);\n        cumulativeKeywords.add(kw);\n      }\n    }\n\n    milestone.new_keywords = newKw;\n    milestone.prerequisite_keywords = prereqKw;\n  }\n\n  return milestones;\n}\n\n// ─── Phase Grouping ──────────────────────────────────────────────────────────\n\n/**\n * Group milestones into phases based on time budget and concept progression.\n */\nfunction groupIntoPhases(\n  milestones: AssembledMilestone[],\n  sessionMinutes: number,\n): AssembledPhase[] {\n  const phases: AssembledPhase[] = [];\n  let currentMilestones: AssembledMilestone[] = [];\n  let currentMinutes = 0;\n  let phaseNum = 1;\n\n  for (const milestone of milestones) {\n    const milestoneMinutes = milestone.adjusted_minutes;\n\n    // If adding this milestone would exceed session budget, start new phase\n    if (currentMinutes + milestoneMinutes > sessionMinutes && currentMilestones.length > 0) {\n      phases.push(buildPhase(currentMilestones, phaseNum));\n      phaseNum++;\n      currentMilestones = [];\n      currentMinutes = 0;\n    }\n\n    currentMilestones.push(milestone);\n    currentMinutes += milestoneMinutes;\n  }\n\n  // Don't forget the last phase\n  if (currentMilestones.length > 0) {\n    phases.push(buildPhase(currentMilestones, phaseNum));\n  }\n\n  return phases;\n}\n\nfunction buildPhase(milestones: AssembledMilestone[], phaseNum: number): AssembledPhase {\n  const totalMinutes = milestones.reduce((sum, m) => sum + m.adjusted_minutes, 0);\n\n  // Determine concept progression\n  const depths = milestones.map(m => m.depth);\n  const uniqueDepths = [...new Set(depths)];\n  const progression = uniqueDepths.map(d => d.toUpperCase()).join(' → ');\n\n  return {\n    phase_id: phaseNum,\n    phase_name: `Phase ${phaseNum}`,\n    milestones,\n    total_minutes: totalMinutes,\n    concept_progression: progression,\n  };\n}\n\n// ─── Main Assembly ───────────────────────────────────────────────────────────\n\n/**\n * Assemble project graph into a roadmap with phases and keyword tracking.\n */\nexport function assembleRoadmap(options: AssembleOptions): AssembledRoadmap {\n  const {\n    projectGraph,\n    featureConcepts = new Map(),\n    sessionMinutes = 90,\n    overheadFactor = 1.15,\n    maxMilestoneMinutes = 120,\n  } = options;\n\n  const features = projectGraph.features || [];\n  const keywordMap = buildKeywordMap(featureConcepts);\n\n  // Build milestones from features (with splitting)\n  const allMilestones: AssembledMilestone[] = [];\n\n  for (const feature of features) {\n    const fid = feature.id || 'F_UNK';\n    const fConcepts = featureConcepts.get(fid) || [];\n\n    const milestones = splitFeatureIntoMilestones(\n      feature,\n      fConcepts,\n      maxMilestoneMinutes,\n      overheadFactor,\n    );\n\n    allMilestones.push(...milestones);\n  }\n\n  // Apply overhead factor\n  for (const milestone of allMilestones) {\n    milestone.adjusted_minutes = calculateOverhead(milestone.estimated_minutes, overheadFactor);\n  }\n\n  // Attach keywords (new vs prerequisite)\n  attachKeywordsToMilestones(allMilestones, keywordMap);\n\n  // Group into phases based on session time\n  const phases = groupIntoPhases(allMilestones, sessionMinutes);\n\n  // Calculate totals\n  const totalEstimatedMinutes = allMilestones.reduce((sum, m) => sum + m.estimated_minutes, 0);\n  const totalAdjustedMinutes = allMilestones.reduce((sum, m) => sum + m.adjusted_minutes, 0);\n\n  return {\n    project: projectGraph.project,\n    product: projectGraph.product,\n    phases,\n    feature_concepts: featureConcepts,\n    time_budget: {\n      session_minutes: sessionMinutes,\n      overhead_factor: overheadFactor,\n      total_estimated_minutes: totalEstimatedMinutes,\n      total_adjusted_minutes: totalAdjustedMinutes,\n    },\n  };\n}\n","/**\n * LLM-based File Selector — sends file tree to LLM, asks it to pick\n * which files are most relevant to the project goal.\n *\n * This mirrors knowledge-tree's approach:\n *   1. git_tracker generates project_structure.txt (file tree)\n *   2. Agent/LLM reads tree → selects important files\n *   3. Only selected files are read for analysis\n */\n\nimport { createLlmClient, llmChatJson, type LlmClientConfig } from '../utils/llmClient';\n\nexport interface FileSelectionResult {\n  selected: string[];\n  reasoning: string;\n}\n\n/**\n * Ask LLM to select which files from the file tree are relevant to the goal.\n * Input: file tree (names only, very small) + goal\n * Output: list of file paths to analyze\n */\nexport async function selectFilesWithLlm(\n  filePaths: string[],\n  goal: string,\n  techStack: string,\n  llmConfig?: LlmClientConfig,\n): Promise<FileSelectionResult> {\n  // If very few files, no need to filter\n  if (filePaths.length <= 15) {\n    return { selected: filePaths, reasoning: 'Too few files to filter' };\n  }\n\n  const client = createLlmClient(llmConfig);\n\n  // Build file tree for LLM (just names, grouped by directory)\n  const treeLines = buildFileTree(filePaths);\n\n  const systemPrompt = (\n    'You are a software architect analyzing a project repository.\\n'\n    + 'Given a file tree and a project goal, select which files are MOST IMPORTANT '\n    + 'to read for understanding the project architecture and implementation.\\n\\n'\n    + 'RULES:\\n'\n    + '1. Prioritize source code files (Swift, TS, Python, C++) over config/docs\\n'\n    + '2. Include entry points (App.swift, main.py, index.ts)\\n'\n    + '3. Include core domain files (models, services, views, controllers)\\n'\n    + '4. EXCLUDE test files, mock files, generated files\\n'\n    + '5. EXCLUDE config files (package.json, Podfile, etc.) unless they reveal architecture\\n'\n    + '6. Include files that directly implement the features mentioned in the goal\\n'\n    + '7. Return 20-40 files maximum (fewer is better if the project is small)\\n\\n'\n    + 'Return JSON: {\"selected\": [\"path/to/file1\", \"path/to/file2\"], \"reasoning\": \"brief explanation\"}'\n  );\n\n  const userPrompt = (\n    `Project goal: ${goal}\\n`\n    + `Tech stack: ${techStack}\\n\\n`\n    + `FILE TREE (${filePaths.length} files):\\n${treeLines}\\n\\n`\n    + 'Select the most important files to analyze. Return JSON.'\n  );\n\n  try {\n    const result = await llmChatJson(client, systemPrompt, userPrompt, {\n      temperature: 0.1,\n      maxTokens: 4096,\n    });\n\n    const selected = Array.isArray(result.selected) ? result.selected as string[] : [];\n    const reasoning = String(result.reasoning || '');\n\n    // Validate: only keep files that exist in the original list\n    const pathSet = new Set(filePaths);\n    const validSelected = selected.filter(p => pathSet.has(p));\n\n    if (validSelected.length === 0) {\n      // LLM returned nothing valid — fallback to all files\n      return { selected: filePaths, reasoning: 'LLM selection empty, using all files' };\n    }\n\n    return { selected: validSelected, reasoning };\n  } catch (err) {\n    console.warn(`[WARN] LLM file selection failed (${err}), using all files`);\n    return { selected: filePaths, reasoning: `LLM failed: ${err}` };\n  }\n}\n\n/**\n * Build a compact file tree string for LLM consumption.\n * Groups files by top-level directory, shows only filenames.\n */\nfunction buildFileTree(filePaths: string[]): string {\n  const byDir = new Map<string, string[]>();\n\n  for (const fp of filePaths) {\n    const parts = fp.split('/');\n    const dir = parts.length > 1 ? parts.slice(0, -1).join('/') : '(root)';\n    const file = parts[parts.length - 1];\n    if (!byDir.has(dir)) byDir.set(dir, []);\n    byDir.get(dir)!.push(file);\n  }\n\n  const lines: string[] = [];\n  for (const [dir, files] of byDir) {\n    lines.push(`${dir}/`);\n    for (const f of files.sort()) {\n      lines.push(`  ${f}`);\n    }\n  }\n\n  return lines.join('\\n');\n}\n","/**\n * File I/O utilities for domain-kit pipeline.\n */\n\nimport { readFileSync, writeFileSync, existsSync, mkdirSync, readdirSync, statSync } from 'node:fs';\nimport { join, extname, relative, resolve } from 'node:path';\nimport { execSync } from 'node:child_process';\n\n/**\n * Read JSON file safely, returns null if not found or invalid.\n */\nexport function readJsonFile<T = unknown>(filePath: string): T | null {\n  try {\n    if (!existsSync(filePath)) return null;\n    const content = readFileSync(filePath, 'utf-8');\n    return JSON.parse(content) as T;\n  } catch {\n    return null;\n  }\n}\n\n/**\n * Write JSON file, creating parent directories if needed.\n */\nexport function writeJsonFile(filePath: string, data: unknown): void {\n  mkdirSync(join(filePath, '..'), { recursive: true });\n  writeFileSync(filePath, JSON.stringify(data, null, 2), 'utf-8');\n}\n\n/**\n * Read text file safely, returns null if not found.\n */\nexport function readTextFile(filePath: string): string | null {\n  try {\n    if (!existsSync(filePath)) return null;\n    return readFileSync(filePath, 'utf-8');\n  } catch {\n    return null;\n  }\n}\n\n/**\n * Collect source files from a directory, filtering by allowed extensions.\n */\nexport function collectSourceFiles(\n  dir: string,\n  options?: {\n    allowedExtensions?: string[];\n    skipDirs?: string[];\n    maxFiles?: number;\n  },\n): string[] {\n  const allowedExts = options?.allowedExtensions || ['.swift', '.ts', '.tsx', '.js', '.jsx', '.py', '.ino', '.cpp', '.c', '.h', '.hpp'];\n  const maxFiles = options?.maxFiles || 70;\n\n  // Try git ls-files first — respects .gitignore, handles submodules, symlinks\n  const gitFiles = collectViaGit(dir, allowedExts, maxFiles);\n  if (gitFiles.length > 0) return gitFiles;\n\n  // Fallback: filesystem walk (non-git directories)\n  return collectViaFilesystem(dir, allowedExts, maxFiles, options?.skipDirs);\n}\n\n/**\n * Collect source files using `git ls-files`.\n * Respects .gitignore, handles symlinks, much faster than walk.\n */\nfunction collectViaGit(dir: string, allowedExts: string[], maxFiles: number): string[] {\n  try {\n    const raw = execSync('git ls-files --cached --others --exclude-standard', {\n      cwd: dir,\n      encoding: 'utf-8',\n      timeout: 5000,\n      maxBuffer: 1024 * 1024,\n    });\n    const extSet = new Set(allowedExts.map(e => e.toLowerCase()));\n    return raw\n      .split('\\n')\n      .filter(line => line.length > 0)\n      .filter(line => extSet.has(extname(line).toLowerCase()))\n      .slice(0, maxFiles)\n      .map(rel => join(dir, rel));\n  } catch {\n    // Not a git repo or git not available — fall through to filesystem walk\n    return [];\n  }\n}\n\n/**\n * Collect source files using recursive directory walk (non-git fallback).\n */\nfunction collectViaFilesystem(\n  dir: string,\n  allowedExts: string[],\n  maxFiles: number,\n  skipDirs?: string[],\n): string[] {\n  const skipSet = new Set(skipDirs || [\n    'node_modules', '.build', 'Pods', '.git', '.venv', 'venv',\n    '__pycache__', 'build', 'dist', '.idea', '.vscode',\n    'test', 'tests', 'demo', 'sample', 'example', 'playground',\n  ]);\n  const extSet = new Set(allowedExts.map(e => e.toLowerCase()));\n  const result: string[] = [];\n\n  function walk(currentDir: string) {\n    if (result.length >= maxFiles) return;\n    let entries;\n    try {\n      entries = readdirSync(currentDir, { withFileTypes: true });\n    } catch {\n      return; // permission error\n    }\n    for (const entry of entries) {\n      if (result.length >= maxFiles) return;\n      const fullPath = join(currentDir, entry.name);\n      if (entry.isDirectory()) {\n        if (!skipSet.has(entry.name)) {\n          walk(fullPath);\n        }\n      } else if (entry.isFile()) {\n        const ext = extname(entry.name).toLowerCase();\n        if (extSet.has(ext)) {\n          result.push(fullPath);\n        }\n      }\n    }\n  }\n\n  walk(dir);\n  return result;\n}\n\n/**\n * Collect file contents map (relative path → content).\n */\nexport function collectFileContents(\n  dir: string,\n  options?: {\n    allowedExtensions?: string[];\n    skipDirs?: string[];\n    maxFiles?: number;\n    maxChars?: number;\n  },\n): { paths: string[]; contents: Map<string, string> } {\n  const maxChars = options?.maxChars || 500000;\n  const files = collectSourceFiles(dir, options);\n  const contents = new Map<string, string>();\n  let totalChars = 0;\n\n  for (const filePath of files) {\n    const relPath = relative(dir, filePath);\n    try {\n      const content = readFileSync(filePath, 'utf-8');\n      if (totalChars + content.length > maxChars) {\n        const remaining = maxChars - totalChars;\n        if (remaining > 100) {\n          contents.set(relPath, content.slice(0, remaining));\n          totalChars += remaining;\n        }\n        break;\n      }\n      contents.set(relPath, content);\n      totalChars += content.length;\n    } catch {\n      // Skip unreadable files\n    }\n  }\n\n  return { paths: files.map(f => relative(dir, f)), contents };\n}\n\n/**\n * Read contents of SPECIFIC files (by relative path) — no directory scan.\n * Used for 2-pass approach: scan tree first, then read only selected files.\n */\nexport function collectSpecificFileContents(\n  dir: string,\n  relativePaths: string[],\n  maxChars: number = 500000,\n): Map<string, string> {\n  const contents = new Map<string, string>();\n  let totalChars = 0;\n\n  for (const relPath of relativePaths) {\n    const fullPath = join(dir, relPath);\n    try {\n      const content = readFileSync(fullPath, 'utf-8');\n      if (totalChars + content.length > maxChars) {\n        const remaining = maxChars - totalChars;\n        if (remaining > 100) {\n          contents.set(relPath, content.slice(0, remaining));\n          totalChars += remaining;\n        }\n        break;\n      }\n      contents.set(relPath, content);\n      totalChars += content.length;\n    } catch {\n      // Skip unreadable files\n    }\n  }\n\n  return contents;\n}\n\n/**\n * Detect primary language from file extensions.\n */\nexport function detectPrimaryLanguage(filePaths: string[]): string {\n  const counts = new Map<string, number>();\n  for (const fp of filePaths) {\n    const ext = extname(fp).toLowerCase();\n    let lang = 'unknown';\n    if (ext === '.swift') lang = 'Swift';\n    else if (ext === '.ts' || ext === '.tsx') lang = 'TypeScript';\n    else if (ext === '.js' || ext === '.jsx') lang = 'JavaScript';\n    else if (ext === '.py') lang = 'Python';\n    else if (ext === '.ino' || ext === '.cpp' || ext === '.c' || ext === '.h') lang = 'C++';\n    else if (ext === '.kt' || ext === '.kts') lang = 'Kotlin';\n    counts.set(lang, (counts.get(lang) || 0) + 1);\n  }\n\n  let maxCount = 0;\n  let primary = 'unknown';\n  for (const [lang, count] of counts) {\n    if (count > maxCount) {\n      maxCount = count;\n      primary = lang;\n    }\n  }\n  return primary;\n}\n\n/**\n * Read README.md and extract project description.\n */\nexport function readReadmeDescription(repoDir: string): string | null {\n  const readmePath = join(repoDir, 'README.md');\n  if (!existsSync(readmePath)) return null;\n  try {\n    const content = readFileSync(readmePath, 'utf-8');\n    const lines = content.split('\\n').map(l => l.trim()).filter(Boolean);\n    // Skip patterns: badges, images, table of contents, HTML tags\n    const skipPatterns = [/^\\[!/, /^<img/, /^<a /, /^#+\\s+Table of/i, /^---$/];\n    let foundTitle = false;\n    for (let i = 0; i < lines.length; i++) {\n      const line = lines[i];\n      if (line.startsWith('#') && !line.startsWith('##')) {\n        foundTitle = true;\n        continue;\n      }\n      if (!foundTitle) continue;\n      // Skip empty lines, badges, images, TOC, horizontal rules\n      if (skipPatterns.some(p => p.test(line))) continue;\n      if (line.startsWith('#')) return null; // hit next heading — no description found\n      if (line.startsWith('```')) return null; // code block\n      if (line.startsWith('|')) return null;   // table\n      if (line.length > 15) return line;\n    }\n    return null;\n  } catch {\n    return null;\n  }\n}\n","/**\n * Project Graph Pipeline — full orchestrator.\n *\n * Ported from knowledge-tree/generate_roadmap_v3.py PipelineOrchestrator\n * Coordinates: AST analysis → keyword extraction → LLM graph generation →\n *             verification → concept escalation → concept resolution → assembly.\n */\n\nimport type { ProjectGraph, Feature } from '../schemas/projectGraphSchema';\nimport { parseSwiftFile, mergeSwiftResults, type SwiftParseResult } from '../parsers/swift';\nimport { parseTsFile, mergeTsResults, type TsParseResult } from '../parsers/typescript';\nimport { parsePythonFile, mergePythonResults, type PythonParseResult } from '../parsers/python';\nimport { parseCppFile, mergeCppResults, type CppParseResult } from '../parsers/cpp';\nimport { extractKeywords, type Keyword, type SourceContext } from '../extractors/keywordExtractor';\nimport { extractScaffold } from '../graph/scaffoldExtractor';\nimport { extractProjectOverview } from '../graph/overviewExtractor';\nimport { extractFeatureSteps, extractFeatureStepsBatched } from '../graph/stepExtractor';\nimport { verifyProjectGraph, type Hallucination } from '../graph/graphVerifier';\nimport { escalateAndMapConcepts, type ConceptMapping } from '../graph/conceptEscalator';\nimport { resolveConcepts, type ResolveConceptsResult } from '../concepts/conceptResolver';\nimport { assembleRoadmap, type AssembledRoadmap } from '../assembly/roadmapAssembler';\nimport { selectFilesWithLlm } from '../extractors/fileSelector';\nimport { collectSourceFiles, collectSpecificFileContents, detectPrimaryLanguage, readReadmeDescription } from '../utils/fileUtils';\nimport { relative } from 'node:path';\nimport { createLlmClient, type LlmClientConfig } from '../utils/llmClient';\n\nexport interface PipelineOptions {\n  repoDir: string;\n  goal: string;\n  techStack: string;\n  llmConfig?: LlmClientConfig;\n  embeddings?: Record<string, { embedding?: number[]; name?: string; description?: string; keywords?: string }>;\n  onProgress?: (step: string, message: string) => void;\n}\n\nexport interface PipelineResult {\n  projectGraph: ProjectGraph;\n  resolvedConcepts: ResolveConceptsResult;\n  roadmap: AssembledRoadmap;\n  hallucinations: Hallucination[];\n  keywords: Keyword[];\n  featureConcepts: Map<string, ConceptMapping[]>;\n}\n\n/**\n * Run the full project graph generation pipeline.\n */\nexport async function runProjectGraphPipeline(\n  options: PipelineOptions,\n): Promise<PipelineResult> {\n  const { repoDir, goal, techStack, llmConfig, embeddings, onProgress } = options;\n\n  const log = (step: string, msg: string) => {\n    console.log(`[${step}] ${msg}`);\n    onProgress?.(step, msg);\n  };\n\n  // ─── STEP 1A: File Tree Scan (names only — no content reading) ─────────\n  log('STEP_1', 'Scanning file tree (names only)...');\n\n  const allFilePaths = collectSourceFiles(repoDir);\n  const allRelPaths = allFilePaths.map(fp => relative(repoDir, fp));\n  log('STEP_1', `Found ${allRelPaths.length} source files in repository`);\n\n  // ─── STEP 1B: LLM File Selection (sends tiny file tree to LLM) ────────\n  log('STEP_1', 'Asking LLM to select relevant files from file tree...');\n\n  const { selected: selectedPaths, reasoning } = await selectFilesWithLlm(\n    allRelPaths, goal, techStack, llmConfig,\n  );\n  log('STEP_1', `LLM selected ${selectedPaths.length}/${allRelPaths.length} files: ${reasoning.slice(0, 100)}`);\n\n  // ─── STEP 1C: Read content only for LLM-selected files ─────────────────\n  log('STEP_1', 'Reading content for selected files...');\n\n  const fileContentsMap = collectSpecificFileContents(repoDir, selectedPaths);\n  const filePaths = selectedPaths;\n  const primaryLang = detectPrimaryLanguage(filePaths);\n  log('STEP_1', `Primary language: ${primaryLang}, ${filePaths.length} files loaded (${fileContentsMap.size} with content)`);\n\n  // Parse source files\n  log('STEP_1', 'Parsing source files with AST-level analysis...');\n\n  const allParseResults: SourceContext[] = [];\n  for (const [relPath, content] of fileContentsMap) {\n    const fullPath = relPath;\n    if (fullPath.endsWith('.swift')) {\n      allParseResults.push(parseSwiftFile(fullPath, content));\n    } else if (fullPath.endsWith('.ts') || fullPath.endsWith('.tsx') || fullPath.endsWith('.js') || fullPath.endsWith('.jsx')) {\n      allParseResults.push(parseTsFile(fullPath, content));\n    } else if (fullPath.endsWith('.py')) {\n      allParseResults.push(parsePythonFile(fullPath, content));\n    } else if (fullPath.endsWith('.ino') || fullPath.endsWith('.cpp') || fullPath.endsWith('.c') || fullPath.endsWith('.h')) {\n      allParseResults.push(parseCppFile(fullPath, content));\n    }\n  }\n\n  // Merge parse results by language\n  let mergedContext: SourceContext;\n  if (primaryLang === 'Swift') {\n    mergedContext = mergeSwiftResults(allParseResults.filter((r): r is SwiftParseResult => 'property_wrappers' in r));\n  } else if (primaryLang === 'TypeScript' || primaryLang === 'JavaScript') {\n    mergedContext = mergeTsResults(allParseResults.filter((r): r is TsParseResult => !('docstrings' in r) && !('property_wrappers' in r) && !('frameworks_used' in r)));\n  } else if (primaryLang === 'Python') {\n    mergedContext = mergePythonResults(allParseResults.filter((r): r is PythonParseResult => 'docstrings' in r));\n  } else {\n    mergedContext = mergeCppResults(allParseResults.filter((r): r is CppParseResult => 'error_handling' in r && !('docstrings' in r) && !('property_wrappers' in r)));\n  }\n\n  // ─── STEP 2: Keyword Extraction ──────────────────────────────────────────\n  log('STEP_2', 'Extracting keywords from AST analysis...');\n\n  const astKeywords = extractKeywords(mergedContext);\n  log('STEP_2', `Extracted ${astKeywords.length} keywords`);\n\n  // ─── STEP 3: Build SDK API Index (simplified — use AST keywords as proxy) ──\n  log('STEP_3', 'Building SDK API index...');\n\n  const sdkApiIndex = {\n    sdk_apis: astKeywords.map(kw => ({\n      name: kw.keyword,\n      kind: kw.source,\n      used_in_demo: true,\n    })),\n  };\n\n  // ─── STEP 4: LLM Project Graph Generation ────────────────────────────────\n  log('STEP_4', 'Generating project graph via LLM (C0: Scaffold, C1: Overview, C2: Steps)...');\n\n  // C0: Scaffold (F0) — uses file list (names only, not content)\n  log('STEP_4_C0', 'Extracting FOUNDATION & SETUP feature (F0)...');\n  const scaffoldFeature = await extractScaffold({\n    goal,\n    techStack,\n    fileList: filePaths,\n    llmConfig,\n  });\n\n  // C1: Overview (features meta) — uses already-filtered fileContentsMap\n  log('STEP_4_C1', 'Extracting project overview (features meta)...');\n  const overview = await extractProjectOverview({\n    goal,\n    techStack,\n    sdkApiIndex,\n    fileContentsMap,\n    astKeywords,\n    llmConfig,\n  });\n\n  // Build PBL step (Design Thinking)\n  const product = overview.product as Record<string, unknown> | undefined;\n  const pblStep: Feature['steps'] extends (infer T)[] ? T : never = {\n    id: 'F0-S1',\n    sequence: 1,\n    name: 'Frame the problem & understand user needs (Design Thinking)',\n    description: 'BEFORE CODING — frame the problem and understand what the user needs',\n    files: [],\n    api_usage: [],\n    keywords: ['Design Thinking', 'User Needs', 'Problem Statement', 'User Journey', 'PBL'],\n    completion_level: 'base',\n    platform: 'app',\n    intent: 'Understand user needs and frame problem before writing code',\n    outcome: { user_visible: 'Defined problem statement', technical: 'Problem frame context' },\n    acceptance: ['Problem statement is clear', 'Primary users identified'],\n    requirement_ids: [],\n    concept_codes: [],\n    effort: { estimated_minutes: 15, complexity: 'low' },\n  };\n\n  // Merge scaffold F0 with PBL step\n  let featuresFull: Feature[] = [];\n  if (scaffoldFeature) {\n    const scaffoldSteps = [pblStep, ...(scaffoldFeature.steps || [])].map((s, i) => ({\n      ...s,\n      id: `F0-S${i + 1}`,\n      sequence: i + 1,\n    }));\n    featuresFull.push({\n      ...scaffoldFeature,\n      id: 'F0',\n      name: 'FOUNDATION & SETUP',\n      steps: scaffoldSteps,\n    });\n  } else {\n    featuresFull.push({\n      id: 'F0',\n      name: 'FOUNDATION & SETUP',\n      description: 'Frame the problem, get familiar with the tools',\n      steps: [pblStep],\n    } as Feature);\n  }\n\n  // Add features from overview\n  const overviewFeatures = (product?.features || []) as Feature[];\n  featuresFull = [...featuresFull, ...overviewFeatures];\n\n  // C2: Extract steps per feature\n  log('STEP_4_C2', `Extracting steps for ${overviewFeatures.length} features...`);\n\n  const nonF0Features = overviewFeatures.filter(f => f.id !== 'F0');\n  if (nonF0Features.length > 0) {\n    try {\n      const batchedSteps = await extractFeatureStepsBatched(\n        goal, techStack, sdkApiIndex, fileContentsMap, nonF0Features, llmConfig,\n      );\n      for (const feature of nonF0Features) {\n        const steps = batchedSteps.get(feature.id || '');\n        if (steps) feature.steps = steps;\n      }\n    } catch (err) {\n      log('STEP_4_C2', `Batch extraction failed (${err}), falling back to per-feature...`);\n      for (const feature of nonF0Features) {\n        try {\n          const steps = await extractFeatureSteps({\n            goal, techStack, sdkApiIndex, fileContentsMap, feature, llmConfig,\n          });\n          feature.steps = steps;\n        } catch (e) {\n          log('STEP_4_C2', `Failed for ${feature.id}: ${e}`);\n        }\n      }\n    }\n  }\n\n  // Build project graph\n  const projectGraph: ProjectGraph = {\n    schema_version: 3,\n    project: {\n      id: (overview.project as Record<string, unknown>)?.name?.toString().toLowerCase().replace(/\\s+/g, '-') || 'project',\n      name: (overview.project as Record<string, unknown>)?.name?.toString() || 'Project',\n      purpose: goal,\n      version: '0.1.0',\n      project_type: 'app',\n      platform: ((overview.project as Record<string, unknown>)?.platforms as string[]) || ['ios'],\n      tech_stack: techStack.split(',').reduce((acc, t) => {\n        const key = t.trim().toLowerCase();\n        if (key) acc[key] = [t.trim()];\n        return acc;\n      }, {} as Record<string, string[]>),\n      architecture: (overview.architecture as Record<string, unknown>)?.layers as string[] || [],\n    },\n    product: {\n      goals: (product?.goals as Array<{ id: string; description: string }>) || [],\n      users: (product?.users as Array<{ id: string; goals: string[] }>) || [],\n      journeys: (product?.user_journeys as Array<{ id: string; name: string; requirement_ids: string[]; steps: string[]; feature_ids: string[] }>) || [],\n      requirements: [],\n      development_stages: (product?.development_stages as Array<{ stage: string; product_state: string; need: string[]; learn: string[]; validation: string; cross_feature_value: string; temporary_approach: string }>) || [],\n      purpose: String(product?.purpose || ''),\n      problem_statement: String(product?.problem_statement || ''),\n      primary_users: (product?.primary_users as string[]) || [],\n    },\n    features: featuresFull,\n    capabilities: [],\n    implementation: {\n      tasks: [],\n    },\n    missing_gaps: [],\n    tech_debt: [],\n  };\n\n  // ─── STEP 5: Verification ────────────────────────────────────────────────\n  log('STEP_5', 'Verifying project graph against source code...');\n\n  const { graph: verifiedGraph, hallucinations } = verifyProjectGraph(projectGraph, {\n    repoDir,\n    sdkApiIndex,\n    fileContentsMap,\n  });\n  log('STEP_5', `Verification complete: ${hallucinations.length} hallucinations found`);\n\n  // ─── STEP 6: Concept Escalation ──────────────────────────────────────────\n  log('STEP_6', 'Escalating keywords to neutral concepts...');\n\n  const featureConcepts = await escalateAndMapConcepts({\n    projectGraph: verifiedGraph,\n    fileContentsMap,\n    llmConfig,\n  });\n  log('STEP_6', `Concept mapping complete: ${featureConcepts.size} features mapped`);\n\n  // Propagate concept_codes back into verified graph steps\n  for (const feature of verifiedGraph.features || []) {\n    const fid = feature.id || '';\n    const fConcepts = featureConcepts.get(fid) || [];\n    for (const step of feature.steps || []) {\n      const stepConcepts = fConcepts\n        .filter(cm => {\n          // Match concept to step: check if step contains the keyword\n          const stepKws = [...(step.keywords || []), ...(step.api_usage || [])];\n          return stepKws.some(k => k === cm.keyword);\n        })\n        .map(cm => cm.concept_code);\n      // Merge with any existing concept_codes from LLM\n      const existing = step.concept_codes || [];\n      step.concept_codes = [...new Set([...existing, ...stepConcepts])];\n    }\n  }\n\n  // ─── STEP 7: Concept Resolution ──────────────────────────────────────────\n  log('STEP_7', 'Resolving keywords to Master Tree concepts...');\n\n  // Collect LLM-generated keywords from verified graph (not just AST)\n  const llmKeywords: Keyword[] = [];\n  const seenKw = new Set<string>();\n  for (const feature of verifiedGraph.features || []) {\n    for (const step of feature.steps || []) {\n      for (const kw of [...(step.keywords || []), ...(step.api_usage || [])]) {\n        if (!seenKw.has(kw.toLowerCase())) {\n          seenKw.add(kw.toLowerCase());\n          llmKeywords.push({ keyword: kw, source: 'llm_step', platform: 'app', weight: 1.0, context: 'LLM-generated step keyword' });\n        }\n      }\n    }\n  }\n  // Merge with AST keywords (AST takes precedence for source/weight)\n  const astKwMap = new Map(astKeywords.map(k => [k.keyword.toLowerCase(), k]));\n  const mergedKeywords: Keyword[] = [];\n  const mergedSeen = new Set<string>();\n  for (const kw of [...astKeywords, ...llmKeywords]) {\n    const key = kw.keyword.toLowerCase();\n    if (!mergedSeen.has(key)) {\n      mergedSeen.add(key);\n      mergedKeywords.push(astKwMap.get(key) || kw);\n    }\n  }\n\n  // Build depth overrides from concept escalation\n  const depthOverrides = new Map<string, 'ulo' | 'cio' | 'sio'>();\n  for (const mappings of featureConcepts.values()) {\n    for (const cm of mappings) {\n      if (!depthOverrides.has(cm.keyword)) {\n        depthOverrides.set(cm.keyword, cm.depth);\n      }\n    }\n  }\n\n  const resolvedConcepts = await resolveConcepts({\n    keywords: mergedKeywords,\n    goal,\n    embeddings,\n    depthOverrides,\n    llmConfig,\n  });\n  log('STEP_7', `Resolved: ${resolvedConcepts.summary.resolved_count}, Proposed: ${resolvedConcepts.summary.proposed_count} (${resolvedConcepts.summary.search_mode})`);\n\n  // ─── STEP 8: Assembly ────────────────────────────────────────────────────\n  log('STEP_8', 'Assembling roadmap with keyword tracking...');\n\n  const roadmap = assembleRoadmap({\n    projectGraph: verifiedGraph,\n    featureConcepts,\n    sessionMinutes: 90,\n    overheadFactor: 1.15,\n    maxMilestoneMinutes: 120,\n  });\n  log('STEP_8', `Roadmap assembled: ${roadmap.phases.length} phases, ${roadmap.phases.reduce((s, p) => s + p.milestones.length, 0)} milestones`);\n\n  return {\n    projectGraph: verifiedGraph,\n    resolvedConcepts,\n    roadmap,\n    hallucinations,\n    keywords: astKeywords,\n    featureConcepts,\n  };\n}\n"]}

package/dist/pipeline/index.d.cts

@@ -0,0 +1,45 @@
+import { u as ProjectGraph } from '../projectGraphSchema-DnD7orZV.cjs';
+import { K as Keyword } from '../keywordExtractor-zPAz2isq.cjs';
+import { H as Hallucination } from '../graphVerifier-QjgDAJce.cjs';
+import { C as ConceptMapping } from '../conceptEscalator-ltRLtPhf.cjs';
+import { ResolveConceptsResult } from '../concepts/index.cjs';
+import { AssembledRoadmap } from '../assembly/index.cjs';
+import { L as LlmClientConfig } from '../llmClient-ysPhLjcH.cjs';
+import 'zod';
+import '../parsers/index.cjs';
+
+/**
+ * Project Graph Pipeline — full orchestrator.
+ *
+ * Ported from knowledge-tree/generate_roadmap_v3.py PipelineOrchestrator
+ * Coordinates: AST analysis → keyword extraction → LLM graph generation →
+ *             verification → concept escalation → concept resolution → assembly.
+ */
+
+interface PipelineOptions {
+    repoDir: string;
+    goal: string;
+    techStack: string;
+    llmConfig?: LlmClientConfig;
+    embeddings?: Record<string, {
+        embedding?: number[];
+        name?: string;
+        description?: string;
+        keywords?: string;
+    }>;
+    onProgress?: (step: string, message: string) => void;
+}
+interface PipelineResult {
+    projectGraph: ProjectGraph;
+    resolvedConcepts: ResolveConceptsResult;
+    roadmap: AssembledRoadmap;
+    hallucinations: Hallucination[];
+    keywords: Keyword[];
+    featureConcepts: Map<string, ConceptMapping[]>;
+}
+/**
+ * Run the full project graph generation pipeline.
+ */
+declare function runProjectGraphPipeline(options: PipelineOptions): Promise<PipelineResult>;
+
+export { type PipelineOptions, type PipelineResult, runProjectGraphPipeline };

package/dist/pipeline/index.d.ts

@@ -0,0 +1,45 @@
+import { u as ProjectGraph } from '../projectGraphSchema-DnD7orZV.js';
+import { K as Keyword } from '../keywordExtractor-CKaXqSku.js';
+import { H as Hallucination } from '../graphVerifier-DsTP9uAN.js';
+import { C as ConceptMapping } from '../conceptEscalator-YfMKIKCZ.js';
+import { ResolveConceptsResult } from '../concepts/index.js';
+import { AssembledRoadmap } from '../assembly/index.js';
+import { L as LlmClientConfig } from '../llmClient-ysPhLjcH.js';
+import 'zod';
+import '../parsers/index.js';
+
+/**
+ * Project Graph Pipeline — full orchestrator.
+ *
+ * Ported from knowledge-tree/generate_roadmap_v3.py PipelineOrchestrator
+ * Coordinates: AST analysis → keyword extraction → LLM graph generation →
+ *             verification → concept escalation → concept resolution → assembly.
+ */
+
+interface PipelineOptions {
+    repoDir: string;
+    goal: string;
+    techStack: string;
+    llmConfig?: LlmClientConfig;
+    embeddings?: Record<string, {
+        embedding?: number[];
+        name?: string;
+        description?: string;
+        keywords?: string;
+    }>;
+    onProgress?: (step: string, message: string) => void;
+}
+interface PipelineResult {
+    projectGraph: ProjectGraph;
+    resolvedConcepts: ResolveConceptsResult;
+    roadmap: AssembledRoadmap;
+    hallucinations: Hallucination[];
+    keywords: Keyword[];
+    featureConcepts: Map<string, ConceptMapping[]>;
+}
+/**
+ * Run the full project graph generation pipeline.
+ */
+declare function runProjectGraphPipeline(options: PipelineOptions): Promise<PipelineResult>;
+
+export { type PipelineOptions, type PipelineResult, runProjectGraphPipeline };

package/dist/pipeline/index.mjs

@@ -0,0 +1,8 @@
+export { runProjectGraphPipeline } from '../chunk-GEUDHZE7.mjs';
+import '../chunk-DRVOV5ZD.mjs';
+import '../chunk-XMHKWHVK.mjs';
+import '../chunk-MOKNFLUD.mjs';
+import '../chunk-KNDBODUQ.mjs';
+import '../chunk-ONQHJ4OH.mjs';
+//# sourceMappingURL=index.mjs.map
+//# sourceMappingURL=index.mjs.map

package/dist/pipeline/index.mjs.map

@@ -0,0 +1 @@
+{"version":3,"sources":[],"names":[],"mappings":"","file":"index.mjs"}