@thanh01.pmt/domain-kit 0.1.0 → 0.2.0

package/dist/{chunk-GEUDHZE7.mjs → chunk-KPZKPNOJ.mjs}

@@ -1,6 +1,9 @@
+import { emitCurriculumFeed } from './chunk-RAR5MUUK.mjs';
 import { parseSwiftFile, parseTsFile, parsePythonFile, parseCppFile, mergeSwiftResults, mergeTsResults, mergePythonResults, mergeCppResults } from './chunk-DRVOV5ZD.mjs';
 import { extractKeywords } from './chunk-XMHKWHVK.mjs';
-import { extractScaffold, extractProjectOverview, extractFeatureStepsBatched, extractFeatureSteps, verifyProjectGraph, escalateAndMapConcepts, createLlmClient, llmChatJson } from './chunk-MOKNFLUD.mjs';
+import { detectDomainProfile } from './chunk-BL5NBKPH.mjs';
+import { extractScaffold, extractProjectOverview, extractFeatureStepsBatched, extractFeatureSteps, verifyProjectGraph, escalateAndMapConcepts, generateKnowledgeGraph, generateHybridGraph, createLlmClient, llmChatJson } from './chunk-JE57VFWX.mjs';
+import { parseSyllabus } from './chunk-T4Y2DE2W.mjs';
 import { resolveConcepts } from './chunk-KNDBODUQ.mjs';
 import { assembleRoadmap } from './chunk-ONQHJ4OH.mjs';
 import { readFileSync, readdirSync } from 'fs';
@@ -441,6 +444,172 @@ async function runProjectGraphPipeline(options) {
   };
 }
 
-export { runProjectGraphPipeline };
-//# sourceMappingURL=chunk-GEUDHZE7.mjs.map
-//# sourceMappingURL=chunk-GEUDHZE7.mjs.map
+// src/pipeline/knowledgeGraphPipeline.ts
+async function runKnowledgeGraphPipeline(options) {
+  const warnings = [];
+  let parsedSyllabus = options.parsedSyllabus;
+  if (!parsedSyllabus && options.syllabusText) {
+    parsedSyllabus = parseSyllabus(options.syllabusText);
+  }
+  const effectiveSubject = options.subject || parsedSyllabus?.subject.title || "Untitled Subject";
+  const effectiveDomain = options.domain || parsedSyllabus?.subject.domain || "other";
+  const effectiveGradeBand = options.gradeBand || parsedSyllabus?.subject.gradeBand;
+  const effectiveDesc = options.description || parsedSyllabus?.subject.description;
+  const result = await generateKnowledgeGraph({
+    ...options,
+    subject: effectiveSubject,
+    domain: effectiveDomain,
+    gradeBand: effectiveGradeBand,
+    description: effectiveDesc,
+    parsedSyllabus
+  });
+  warnings.push(...result.warnings);
+  const curriculumFeed = emitCurriculumFeed(result.knowledgeGraph, {
+    warnings
+  });
+  return {
+    knowledgeGraph: result.knowledgeGraph,
+    parsedSyllabus,
+    curriculumFeed,
+    verificationReport: result.verificationReport,
+    warnings
+  };
+}
+
+// src/pipeline/hybridGraphPipeline.ts
+async function runHybridGraphPipeline(options) {
+  const warnings = [];
+  const result = await generateHybridGraph(options);
+  warnings.push(...result.warnings);
+  const curriculumFeed = emitCurriculumFeed(result.hybridGraph, {
+    warnings
+  });
+  return {
+    hybridGraph: result.hybridGraph,
+    curriculumFeed,
+    warnings
+  };
+}
+
+// src/pipeline/domainRouter.ts
+async function runDomainPipeline(options) {
+  const warnings = [];
+  const log = (step, msg) => {
+    console.log(`[ROUTER-${step}] ${msg}`);
+    options.onProgress?.(step, msg);
+  };
+  log("LAYER_1", "Detecting domain profile...");
+  const domainProfile = detectDomainProfile(options);
+  const effectiveMode = options.forcedLearningMode || domainProfile.learningMode;
+  log("LAYER_2", `Routing to pipeline for learning mode: ${effectiveMode} (graphType: ${domainProfile.graphType})`);
+  if (effectiveMode === "concept") {
+    log("LAYER_3", "Executing Knowledge Graph Pipeline (Concept-driven)...");
+    const knowledgeResult = await runKnowledgeGraphPipeline({
+      subject: options.subject || domainProfile.detectedSubject || options.goal || options.description || "General Subject",
+      description: options.description,
+      syllabusText: options.syllabusText,
+      parsedSyllabus: options.parsedSyllabus,
+      gradeBand: options.gradeBand,
+      domain: domainProfile.domainCategory,
+      techStack: options.techStack || domainProfile.detectedTechStack?.[0],
+      llmConfig: options.llmConfig,
+      onProgress: options.onProgress,
+      knowledgeTreePath: options.knowledgeTreePath,
+      proposalsPath: options.proposalsPath
+    });
+    warnings.push(...knowledgeResult.warnings);
+    return {
+      domainProfile,
+      graphType: "knowledge_graph",
+      curriculumFeed: knowledgeResult.curriculumFeed,
+      knowledgeResult,
+      warnings
+    };
+  }
+  if (effectiveMode === "hybrid") {
+    log("LAYER_3", "Executing Hybrid Graph Pipeline...");
+    if (options.repoDir) {
+      const projectResult2 = await runProjectGraphPipeline({
+        repoDir: options.repoDir,
+        goal: options.goal || "Build complete project",
+        techStack: options.techStack || "typescript",
+        llmConfig: options.llmConfig,
+        embeddings: options.embeddings,
+        onProgress: options.onProgress
+      });
+      const knowledgeResult = await runKnowledgeGraphPipeline({
+        subject: options.subject || domainProfile.detectedSubject || options.goal || "Subject Theory",
+        description: options.description,
+        syllabusText: options.syllabusText,
+        parsedSyllabus: options.parsedSyllabus,
+        domain: domainProfile.domainCategory,
+        techStack: options.techStack,
+        llmConfig: options.llmConfig,
+        onProgress: options.onProgress
+      });
+      const hybridResult = await runHybridGraphPipeline({
+        projectGraph: projectResult2.projectGraph,
+        knowledgeGraph: knowledgeResult.knowledgeGraph,
+        llmConfig: options.llmConfig,
+        onProgress: options.onProgress
+      });
+      warnings.push(...hybridResult.warnings);
+      return {
+        domainProfile,
+        graphType: "hybrid_graph",
+        curriculumFeed: hybridResult.curriculumFeed,
+        projectResult: projectResult2,
+        knowledgeResult,
+        hybridResult,
+        warnings
+      };
+    } else {
+      warnings.push("Hybrid learning mode requested but repoDir was not provided \u2014 falling back to concept-driven knowledge graph pipeline");
+      const knowledgeResult = await runKnowledgeGraphPipeline({
+        subject: options.subject || domainProfile.detectedSubject || options.goal || "Subject Theory",
+        description: options.description,
+        syllabusText: options.syllabusText,
+        parsedSyllabus: options.parsedSyllabus,
+        domain: domainProfile.domainCategory,
+        techStack: options.techStack,
+        llmConfig: options.llmConfig,
+        onProgress: options.onProgress
+      });
+      warnings.push(...knowledgeResult.warnings);
+      return {
+        domainProfile,
+        graphType: "knowledge_graph",
+        curriculumFeed: knowledgeResult.curriculumFeed,
+        knowledgeResult,
+        warnings
+      };
+    }
+  }
+  log("LAYER_3", "Executing Project Graph Pipeline (Product-driven)...");
+  if (!options.repoDir) {
+    throw new Error("repoDir is required for product-driven project graph pipeline");
+  }
+  const projectResult = await runProjectGraphPipeline({
+    repoDir: options.repoDir,
+    goal: options.goal || "Build complete project",
+    techStack: options.techStack || domainProfile.detectedTechStack?.[0] || "typescript",
+    llmConfig: options.llmConfig,
+    embeddings: options.embeddings,
+    onProgress: options.onProgress
+  });
+  const { emitCurriculumFeed: emitCurriculumFeed2 } = await import('./curriculumFeedEmitter-UG664SWY.mjs');
+  const curriculumFeed = emitCurriculumFeed2(projectResult.projectGraph, {
+    warnings
+  });
+  return {
+    domainProfile,
+    graphType: "project_graph",
+    curriculumFeed,
+    projectResult,
+    warnings
+  };
+}
+
+export { runDomainPipeline, runHybridGraphPipeline, runKnowledgeGraphPipeline, runProjectGraphPipeline };
+//# sourceMappingURL=chunk-KPZKPNOJ.mjs.map
+//# sourceMappingURL=chunk-KPZKPNOJ.mjs.map

package/dist/chunk-KPZKPNOJ.mjs.map

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

package/dist/chunk-R57WTNXW.mjs

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

package/dist/chunk-R57WTNXW.mjs.map

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

package/dist/{chunk-3H2HX7PR.mjs → chunk-RAR5MUUK.mjs}

@@ -44,10 +44,32 @@ function feedNodeFromStep(step, featureId) {
     introduce_aspect: null
   };
 }
+function deriveConceptDepthHint(concept) {
+  const explicit = str(concept.depth_hint);
+  if (explicit === "ulo" || explicit === "cio" || explicit === "sio") return explicit;
+  const sio = arr(concept.sio);
+  const prereqs = strs(concept.prerequisites);
+  const pts = arr(concept.problem_types);
+  const hasHighBloom = pts.some((p) => {
+    const b = str(p.bloom_level);
+    return b === "Apply" || b === "Analyze" || b === "Evaluate" || b === "Create";
+  });
+  if (sio.length >= 2 || hasHighBloom) return "sio";
+  if (str(concept.cio) || prereqs.length >= 1) return "cio";
+  return "ulo";
+}
 function feedNodeFromConcept(concept) {
   const id = str(concept.id);
   const pts = arr(concept.problem_types).map((p) => str(p.bloom_level, "Understand")).filter((b) => b in BLOOM_RANK).sort((a, b) => BLOOM_RANK[a] - BLOOM_RANK[b]);
   const topBloom = pts[pts.length - 1] ?? "Understand";
+  const rawRefs = arr(concept.references);
+  const references = rawRefs.length > 0 ? rawRefs.map((r) => ({ file: str(r.file, "syllabus.md"), evidence: str(r.evidence, str(concept.name)) })).filter((r) => r.file) : [{ file: "syllabus.md", evidence: str(concept.category ? `Topic under category ${str(concept.category)}` : str(concept.name), id) }];
+  const problemScaffolds = arr(concept.problem_types).map((pt) => ({
+    item: str(pt.name, "Problem type"),
+    reason: str(pt.description, "Formative practice check"),
+    minutes_saved: num(pt.estimated_minutes, 10),
+    suggest: "provide_partial"
+  }));
   return {
     id,
     kind: "concept",
@@ -56,10 +78,13 @@ function feedNodeFromConcept(concept) {
     keywords: { all: strs(concept.keywords), new: [], prerequisite: [] },
     estimated_minutes: Math.max(0, Math.round(num(concept.estimated_minutes, 30))),
     bloom_hint: topBloom,
-    depth_hint: null,
+    depth_hint: deriveConceptDepthHint(concept),
     completion_level: "standard",
-    scaffolding: { scaffold_candidates: [], core_value_minutes: 0 },
-    references: [],
+    scaffolding: {
+      scaffold_candidates: problemScaffolds,
+      core_value_minutes: Math.max(0, Math.round(num(concept.estimated_minutes, 30)))
+    },
+    references,
     feature_id: null,
     concept_ref: id,
     phase_id: "",
@@ -265,16 +290,41 @@ function emitFromKnowledge(kg, opts) {
   const nodes = [];
   const edges = [];
   const groupings = [];
+  const conceptIds = new Set(arr(kg.concepts).map((c) => str(c.id)));
   for (const c of arr(kg.concepts)) {
     const node = feedNodeFromConcept(c);
     nodes.push(node);
-    for (const p of strs(c.prerequisites)) edges.push({ from: p, to: node.id, kind: "knowledge", reason: "concept prerequisite" });
+    for (const p of strs(c.prerequisites)) {
+      if (p !== node.id && conceptIds.has(p)) {
+        edges.push({
+          from: p,
+          to: node.id,
+          kind: "knowledge",
+          reason: `concept prerequisite: ${p} must be understood before ${node.id}`
+        });
+      }
+    }
+  }
+  if (arr(kg.learning_path).length > 0) {
+    const orderMap = /* @__PURE__ */ new Map();
+    arr(kg.learning_path).forEach((s, idx) => {
+      const cid = str(s.concept_id);
+      if (cid) orderMap.set(cid, num(s.order, idx + 1));
+    });
+    nodes.sort((a, b) => (orderMap.get(a.id) ?? 999) - (orderMap.get(b.id) ?? 999));
   }
   let ci = 0;
   for (const cat of arr(kg.categories)) {
     ci += 1;
     const ids = strs(cat.concept_ids).filter((id) => nodes.some((n) => n.id === id));
-    if (ids.length > 0) groupings.push({ id: str(cat.id, "cat" + ci), name: str(cat.name, "Category " + ci), node_ids: ids, rationale: str(cat.description, "") });
+    if (ids.length > 0) {
+      groupings.push({
+        id: str(cat.id, "cat" + ci),
+        name: str(cat.name, "Category " + ci),
+        node_ids: ids,
+        rationale: str(cat.description, "")
+      });
+    }
   }
   newKeywordsInOrder(nodes);
   return validateCurriculumFeed({
@@ -320,5 +370,5 @@ function emitCurriculumFeed(graph, opts = {}) {
 }
 
 export { emitCurriculumFeed };
-//# sourceMappingURL=chunk-3H2HX7PR.mjs.map
-//# sourceMappingURL=chunk-3H2HX7PR.mjs.map
+//# sourceMappingURL=chunk-RAR5MUUK.mjs.map
+//# sourceMappingURL=chunk-RAR5MUUK.mjs.map

package/dist/chunk-RAR5MUUK.mjs.map

@@ -0,0 +1 @@
+{"version":3,"sources":["../src/feed/curriculumFeedEmitter.ts"],"names":[],"mappings":";;;AAsBA,IAAM,UAAA,GAAqC,EAAE,QAAA,EAAU,CAAA,EAAG,UAAA,EAAY,CAAA,EAAG,KAAA,EAAO,CAAA,EAAG,OAAA,EAAS,CAAA,EAAG,QAAA,EAAU,CAAA,EAAG,QAAQ,CAAA,EAAE;AACtH,IAAM,IAAA,GAAO,CAAC,CAAA,KAAsB,MAAA,CAAO,CAAC,CAAA,CAAE,QAAA,CAAS,GAAG,GAAG,CAAA;AAG7D,IAAM,GAAA,GAAM,CAAC,CAAA,KAAuB,KAAA,CAAM,QAAQ,CAAC,CAAA,GAAK,IAAc,EAAC;AACvE,IAAM,GAAA,GAAM,CAAC,CAAA,EAAY,CAAA,GAAI,OAAgB,OAAO,CAAA,KAAM,WAAW,CAAA,GAAI,CAAA;AACzE,IAAM,GAAA,GAAM,CAAC,CAAA,EAAY,CAAA,KAAuB,OAAO,CAAA,KAAM,QAAA,IAAY,MAAA,CAAO,QAAA,CAAS,CAAC,CAAA,GAAI,CAAA,GAAI,CAAA;AAClG,IAAM,IAAA,GAAO,CAAC,CAAA,KAA0B,KAAA,CAAM,QAAQ,CAAC,CAAA,GAAI,CAAA,CAAE,MAAA,CAAO,CAAC,CAAA,KAAmB,OAAO,CAAA,KAAM,QAAQ,IAAI,EAAC;AAElH,SAAS,YAAY,IAAA,EAAmB;AACtC,EAAA,MAAM,MAAA,GAAU,IAAA,CAAK,MAAA,IAAU,EAAC;AAChC,EAAA,OAAO,IAAA,CAAK,GAAA,CAAI,CAAA,EAAG,IAAA,CAAK,MAAM,GAAA,CAAI,MAAA,CAAO,iBAAA,EAAmB,GAAA,CAAI,IAAA,CAAK,iBAAA,EAAmB,EAAE,CAAC,CAAC,CAAC,CAAA;AAC/F;AAEA,SAAS,mBAAmB,KAAA,EAAyB;AAEnD,EAAA,MAAM,IAAA,uBAAW,GAAA,EAAY;AAC7B,EAAA,KAAA,MAAW,KAAK,KAAA,EAAO;AACrB,IAAA,MAAM,GAAA,GAAM,EAAE,QAAA,CAAS,GAAA;AACvB,IAAA,CAAA,CAAE,QAAA,CAAS,MAAM,EAAC;AAClB,IAAA,CAAA,CAAE,QAAA,CAAS,eAAe,EAAC;AAC3B,IAAA,KAAA,MAAW,KAAK,GAAA,EAAK;AACnB,MAAA,IAAI,IAAA,CAAK,IAAI,CAAC,CAAA,IAAK,QAAA,CAAS,YAAA,CAAa,KAAK,CAAC,CAAA;AAAA,WAC1C,CAAA,CAAE,QAAA,CAAS,GAAA,CAAI,IAAA,CAAK,CAAC,CAAA;AAC1B,MAAA,IAAA,CAAK,IAAI,CAAC,CAAA;AAAA,IACZ;AAAA,EACF;AACF;AAEA,SAAS,gBAAA,CAAiB,MAAW,SAAA,EAA6B;AAChE,EAAA,MAAM,EAAA,GAAK,GAAA,CAAI,IAAA,CAAK,EAAE,CAAA;AACtB,EAAA,OAAO;AAAA,IACL,EAAA;AAAA,IACA,IAAA,EAAM,cAAA;AAAA,IACN,IAAA,EAAM,GAAA,CAAI,IAAA,CAAK,IAAA,EAAM,EAAE,CAAA;AAAA,IACvB,aAAA,EAAe,IAAA,CAAK,IAAA,CAAK,aAAa,CAAA;AAAA,IACtC,QAAA,EAAU,EAAE,GAAA,EAAK,IAAA,CAAK,IAAA,CAAK,QAAQ,CAAA,EAAG,GAAA,EAAK,EAAC,EAAG,YAAA,EAAc,EAAC,EAAE;AAAA,IAChE,iBAAA,EAAmB,YAAY,IAAI,CAAA;AAAA,IACnC,UAAA,EAAY,OAAA;AAAA,IACZ,UAAA,EAAY,IAAA;AAAA,IACZ,gBAAA,EAAkB,UAAA;AAAA,IAClB,WAAA,EAAa,EAAE,mBAAA,EAAqB,IAAI,kBAAA,EAAoB,WAAA,CAAY,IAAI,CAAA,EAAE;AAAA,IAC9E,UAAA,EAAY,IAAI,IAAA,CAAK,KAAK,EAAE,GAAA,CAAI,CAAC,OAAO,EAAE,IAAA,EAAM,IAAI,CAAC,CAAA,EAAG,UAAU,WAAA,EAAY,CAAE,EAAE,MAAA,CAAO,CAAC,CAAA,KAAM,CAAA,CAAE,IAAI,CAAA;AAAA,IACtG,UAAA,EAAY,SAAA;AAAA,IACZ,WAAA,EAAa,IAAA;AAAA,IACb,QAAA,EAAU,EAAA;AAAA,IACV,gBAAA,EAAkB;AAAA,GACpB;AACF;AAEA,SAAS,uBAAuB,OAAA,EAAsC;AACpE,EAAA,MAAM,QAAA,GAAW,GAAA,CAAI,OAAA,CAAQ,UAAU,CAAA;AACvC,EAAA,IAAI,aAAa,KAAA,IAAS,QAAA,KAAa,KAAA,IAAS,QAAA,KAAa,OAAO,OAAO,QAAA;AAE3E,EAAA,MAAM,GAAA,GAAM,GAAA,CAAI,OAAA,CAAQ,GAAG,CAAA;AAC3B,EAAA,MAAM,OAAA,GAAU,IAAA,CAAK,OAAA,CAAQ,aAAa,CAAA;AAC1C,EAAA,MAAM,GAAA,GAAM,GAAA,CAAI,OAAA,CAAQ,aAAa,CAAA;AACrC,EAAA,MAAM,YAAA,GAAe,GAAA,CAAI,IAAA,CAAK,CAAC,CAAA,KAAM;AACnC,IAAA,MAAM,CAAA,GAAI,GAAA,CAAI,CAAA,CAAE,WAAW,CAAA;AAC3B,IAAA,OAAO,MAAM,OAAA,IAAW,CAAA,KAAM,SAAA,IAAa,CAAA,KAAM,cAAc,CAAA,KAAM,QAAA;AAAA,EACvE,CAAC,CAAA;AAED,EAAA,IAAI,GAAA,CAAI,MAAA,IAAU,CAAA,IAAK,YAAA,EAAc,OAAO,KAAA;AAC5C,EAAA,IAAI,IAAI,OAAA,CAAQ,GAAG,KAAK,OAAA,CAAQ,MAAA,IAAU,GAAG,OAAO,KAAA;AACpD,EAAA,OAAO,KAAA;AACT;AAEA,SAAS,oBAAoB,OAAA,EAAwB;AACnD,EAAA,MAAM,EAAA,GAAK,GAAA,CAAI,OAAA,CAAQ,EAAE,CAAA;AACzB,EAAA,MAAM,GAAA,GAAM,GAAA,CAAI,OAAA,CAAQ,aAAa,CAAA,CAClC,GAAA,CAAI,CAAC,CAAA,KAAM,GAAA,CAAI,CAAA,CAAE,WAAA,EAAa,YAAY,CAAC,CAAA,CAC3C,MAAA,CAAO,CAAC,CAAA,KAAM,CAAA,IAAK,UAAU,CAAA,CAC7B,IAAA,CAAK,CAAC,CAAA,EAAG,CAAA,KAAM,UAAA,CAAW,CAAC,CAAA,GAAI,UAAA,CAAW,CAAC,CAAC,CAAA;AAC/C,EAAA,MAAM,QAAA,GAAW,GAAA,CAAI,GAAA,CAAI,MAAA,GAAS,CAAC,CAAA,IAAK,YAAA;AAExC,EAAA,MAAM,OAAA,GAAU,GAAA,CAAI,OAAA,CAAQ,UAAU,CAAA;AACtC,EAAA,MAAM,UAAA,GAAa,OAAA,CAAQ,MAAA,GAAS,CAAA,GAChC,OAAA,CAAQ,IAAI,CAAC,CAAA,MAAO,EAAE,IAAA,EAAM,GAAA,CAAI,CAAA,CAAE,MAAM,aAAa,CAAA,EAAG,QAAA,EAAU,GAAA,CAAI,CAAA,CAAE,QAAA,EAAU,IAAI,OAAA,CAAQ,IAAI,CAAC,CAAA,EAAE,CAAE,CAAA,CAAE,OAAO,CAAC,CAAA,KAAM,CAAA,CAAE,IAAI,CAAA,GAC7H,CAAC,EAAE,IAAA,EAAM,aAAA,EAAe,QAAA,EAAU,GAAA,CAAI,OAAA,CAAQ,QAAA,GAAW,wBAAwB,GAAA,CAAI,OAAA,CAAQ,QAAQ,CAAC,CAAA,CAAA,GAAK,GAAA,CAAI,QAAQ,IAAI,CAAA,EAAG,EAAE,CAAA,EAAG,CAAA;AAEvI,EAAA,MAAM,mBAAmB,GAAA,CAAI,OAAA,CAAQ,aAAa,CAAA,CAAE,GAAA,CAAI,CAAC,EAAA,MAAQ;AAAA,IAC/D,IAAA,EAAM,GAAA,CAAI,EAAA,CAAG,IAAA,EAAM,cAAc,CAAA;AAAA,IACjC,MAAA,EAAQ,GAAA,CAAI,EAAA,CAAG,WAAA,EAAa,0BAA0B,CAAA;AAAA,IACtD,aAAA,EAAe,GAAA,CAAI,EAAA,CAAG,iBAAA,EAAmB,EAAE,CAAA;AAAA,IAC3C,OAAA,EAAS;AAAA,GACX,CAAE,CAAA;AAEF,EAAA,OAAO;AAAA,IACL,EAAA;AAAA,IACA,IAAA,EAAM,SAAA;AAAA,IACN,IAAA,EAAM,GAAA,CAAI,OAAA,CAAQ,IAAA,EAAM,EAAE,CAAA;AAAA,IAC1B,aAAA,EAAe,CAAC,GAAA,CAAI,OAAA,CAAQ,IAAI,CAAA,IAAK,EAAE,CAAA,CAAE,MAAA,CAAO,OAAO,CAAA;AAAA,IACvD,QAAA,EAAU,EAAE,GAAA,EAAK,IAAA,CAAK,OAAA,CAAQ,QAAQ,CAAA,EAAG,GAAA,EAAK,EAAC,EAAG,YAAA,EAAc,EAAC,EAAE;AAAA,IACnE,iBAAA,EAAmB,IAAA,CAAK,GAAA,CAAI,CAAA,EAAG,IAAA,CAAK,KAAA,CAAM,GAAA,CAAI,OAAA,CAAQ,iBAAA,EAAmB,EAAE,CAAC,CAAC,CAAA;AAAA,IAC7E,UAAA,EAAY,QAAA;AAAA,IACZ,UAAA,EAAY,uBAAuB,OAAO,CAAA;AAAA,IAC1C,gBAAA,EAAkB,UAAA;AAAA,IAClB,WAAA,EAAa;AAAA,MACX,mBAAA,EAAqB,gBAAA;AAAA,MACrB,kBAAA,EAAoB,IAAA,CAAK,GAAA,CAAI,CAAA,EAAG,IAAA,CAAK,KAAA,CAAM,GAAA,CAAI,OAAA,CAAQ,iBAAA,EAAmB,EAAE,CAAC,CAAC;AAAA,KAChF;AAAA,IACA,UAAA;AAAA,IACA,UAAA,EAAY,IAAA;AAAA,IACZ,WAAA,EAAa,EAAA;AAAA,IACb,QAAA,EAAU,EAAA;AAAA,IACV,gBAAA,EAAkB;AAAA,GACpB;AACF;AAEA,SAAS,eAAA,CACP,CAAA,EAAQ,GAAA,EAAa,KAAA,EAAmB,OAAmB,SAAA,EACjD;AACV,EAAA,MAAM,KAAA,GAAQ,GAAA,CAAI,CAAA,CAAE,KAAK,CAAA;AACzB,EAAA,MAAM,UAAoB,EAAC;AAC3B,EAAA,IAAI,IAAA,GAAO,EAAA;AACX,EAAA,KAAA,IAAS,CAAA,GAAI,CAAA,EAAG,CAAA,GAAI,KAAA,CAAM,QAAQ,CAAA,EAAA,EAAK;AACrC,IAAA,MAAM,QAAA,GAAW,gBAAA,CAAiB,KAAA,CAAM,CAAC,GAAG,GAAG,CAAA;AAC/C,IAAA,IAAI,CAAC,SAAS,EAAA,EAAI;AAClB,IAAA,OAAA,CAAQ,IAAA,CAAK,SAAS,EAAE,CAAA;AACxB,IAAA,KAAA,CAAM,KAAK,QAAQ,CAAA;AACnB,IAAA,IAAI,IAAA,EAAM,KAAA,CAAM,IAAA,CAAK,EAAE,IAAA,EAAM,IAAA,EAAM,EAAA,EAAI,QAAA,CAAS,EAAA,EAAI,IAAA,EAAM,MAAA,EAAQ,MAAA,EAAQ,uBAAuB,CAAA;AACjG,IAAA,IAAA,GAAO,QAAA,CAAS,EAAA;AAAA,EAClB;AACA,EAAA,KAAA,MAAW,GAAA,IAAO,IAAA,CAAK,CAAA,CAAE,UAAU,CAAA,EAAG;AACpC,IAAA,MAAM,WAAW,KAAA,CAAM,IAAA,CAAK,CAAC,CAAA,KAAM,CAAA,CAAE,eAAe,GAAG,CAAA;AACvD,IAAA,IAAI,YAAY,OAAA,CAAQ,CAAC,GAAG,KAAA,CAAM,IAAA,CAAK,EAAE,IAAA,EAAM,QAAA,CAAS,IAAI,EAAA,EAAI,OAAA,CAAQ,CAAC,CAAA,EAAG,IAAA,EAAM,QAAQ,MAAA,EAAQ,qBAAA,GAAwB,KAAK,CAAA;AAAA,EACjI;AACA,EAAA,IAAI,OAAA,CAAQ,SAAS,CAAA,EAAG,SAAA,CAAU,KAAK,EAAE,EAAA,EAAI,IAAA,GAAO,GAAA,EAAK,IAAA,EAAM,GAAA,CAAI,EAAE,IAAA,EAAM,GAAG,CAAA,EAAG,QAAA,EAAU,OAAA,EAAS,SAAA,EAAW,IAAI,CAAA,CAAE,WAAA,EAAa,EAAE,CAAA,EAAG,CAAA;AACvI,EAAA,OAAO,OAAA;AACT;AAoBA,SAAS,cAAA,CAAe,QAAa,IAAA,EAAuC;AAC1E,EAAA,MAAM,QAAoB,EAAC;AAC3B,EAAA,MAAM,QAAoB,EAAC;AAC3B,EAAA,MAAM,YAA4B,EAAC;AACnC,EAAA,MAAM,EAAA,GAAM,MAAA,CAAO,aAAA,IAAiB,EAAC;AACrC,EAAA,MAAM,EAAA,GAAM,MAAA,CAAO,eAAA,IAAmB,EAAC;AACvC,EAAA,MAAM,SAAA,GAAY,GAAA,CAAI,MAAA,CAAO,MAAM,CAAA,CAAE,MAAA,CAAO,CAAC,CAAA,KAAM,GAAA,CAAI,CAAA,CAAE,EAAE,CAAC,CAAA;AAE5D,EAAA,MAAM,QAAA,GAAW,GAAA,CAAI,EAAA,CAAG,QAAQ,CAAA;AAChC,EAAA,MAAM,WAAA,GAAc,GAAA,CAAI,EAAA,CAAG,QAAQ,CAAA;AACnC,EAAA,MAAM,WAAA,GAAc,IAAI,GAAA,CAAI,WAAA,CAAY,IAAI,CAAC,CAAA,KAAM,CAAC,GAAA,CAAI,CAAA,CAAE,EAAE,CAAA,EAAG,CAAC,CAAC,CAAC,CAAA;AAGlE,EAAA,IAAI,SAAA,CAAU,WAAW,CAAA,EAAG;AAC1B,IAAA,KAAA,MAAW,KAAK,WAAA,EAAa;AAC3B,MAAA,MAAM,IAAA,GAAO,oBAAoB,CAAC,CAAA;AAClC,MAAA,KAAA,CAAM,KAAK,IAAI,CAAA;AACf,MAAA,KAAA,MAAW,KAAK,IAAA,CAAK,CAAA,CAAE,aAAa,CAAA,QAAS,IAAA,CAAK,EAAE,IAAA,EAAM,CAAA,EAAG,IAAI,IAAA,CAAK,EAAA,EAAI,MAAM,WAAA,EAAa,MAAA,EAAQ,wBAAwB,CAAA;AAAA,IAC/H;AACA,IAAA,QAAA,CAAS,QAAQ,CAAC,CAAA,EAAG,OAAO,eAAA,CAAgB,CAAA,EAAG,IAAI,CAAA,CAAE,EAAA,EAAI,GAAA,GAAM,IAAA,CAAK,KAAK,CAAC,CAAC,GAAG,KAAA,EAAO,KAAA,EAAO,SAAS,CAAC,CAAA;AACtG,IAAA,wBAAA,CAAyB,MAAA,EAAQ,KAAA,EAAO,KAAW,CAAA;AACnD,IAAA,kBAAA,CAAmB,KAAK,CAAA;AACxB,IAAA,OAAO,sBAAA,CAAuB;AAAA,MAC5B,cAAA,EAAgB,CAAA;AAAA,MAChB,MAAA,EAAQ,EAAE,UAAA,EAAY,cAAA,EAAgB,QAAA,EAAU,IAAA,CAAK,QAAA,IAAY,EAAC,EAAG,mBAAA,EAAqB,IAAA,CAAK,kBAAA,IAAsB,CAAA,EAAE;AAAA,MACvH,cAAA,EAAgB,KAAA;AAAA,MAChB,gBAAA,EAAkB,KAAA;AAAA,MAClB,mBAAA,EAAqB,SAAA;AAAA,MACrB,QAAQ;AAAC,KACV,CAAA;AAAA,EACH;AAGA,EAAA,MAAM,YAAA,uBAAmB,GAAA,EAAoB;AAC7C,EAAA,QAAA,CAAS,QAAQ,CAAC,CAAA,EAAG,EAAA,KAAO,YAAA,CAAa,IAAI,GAAA,CAAI,CAAA,CAAE,EAAA,EAAI,GAAA,GAAM,KAAK,EAAA,GAAK,CAAC,CAAC,CAAA,EAAG,EAAE,CAAC,CAAA;AAC/E,EAAA,MAAM,gBAAA,uBAAuB,GAAA,EAAsB;AACnD,EAAA,KAAA,MAAW,KAAK,QAAA,EAAU;AACxB,IAAA,MAAM,GAAA,GAAM,GAAA,CAAI,CAAA,CAAE,EAAE,CAAA;AACpB,IAAA,gBAAA,CAAiB,IAAI,GAAA,EAAK,GAAA,CAAI,CAAA,CAAE,KAAK,EAAE,GAAA,CAAI,CAAC,CAAA,KAAM,GAAA,CAAI,EAAE,EAAE,CAAC,CAAA,CAAE,MAAA,CAAO,OAAO,CAAC,CAAA;AAAA,EAC9E;AAEA,EAAA,MAAM,UAA0B,EAAC;AACjC,EAAA,MAAM,eAAA,uBAAsB,GAAA,EAAY;AACxC,EAAA,MAAM,QAAA,GAAW,GAAA,CAAI,MAAA,CAAO,KAAK,CAAA;AAEjC,EAAA,KAAA,MAAW,MAAM,SAAA,EAAW;AAC1B,IAAA,MAAM,GAAA,GAAM,GAAA,CAAI,EAAA,CAAG,EAAE,CAAA;AACrB,IAAA,MAAM,QAAQ,GAAA,CAAI,EAAA,CAAG,KAAA,EAAO,OAAA,CAAQ,SAAS,CAAC,CAAA;AAC9C,IAAA,MAAM,eAAyB,EAAC;AAChC,IAAA,MAAM,MAAA,GAAS,GAAA,CAAI,EAAA,CAAG,UAAU,CAAA;AAEhC,IAAA,MAAM,IAAA,GAAO,MAAA,CAAO,MAAA,CAAO,CAAC,CAAA,KAAM,IAAI,CAAA,CAAE,MAAA,EAAQ,KAAK,CAAA,KAAM,KAAK,CAAA;AAChE,IAAA,MAAM,QAAA,GAAW,OAAO,MAAA,CAAO,CAAC,MAAM,GAAA,CAAI,CAAA,CAAE,MAAM,CAAA,KAAM,UAAU,CAAA;AAClE,IAAA,KAAA,MAAW,SAAS,CAAC,GAAG,IAAA,EAAM,GAAG,QAAQ,CAAA,EAAG;AAC1C,MAAA,MAAM,GAAA,GAAM,GAAA,CAAI,KAAA,CAAM,UAAU,CAAA;AAChC,MAAA,MAAM,CAAA,GAAI,WAAA,CAAY,GAAA,CAAI,GAAG,CAAA;AAC7B,MAAA,IAAI,CAAC,CAAA,EAAG;AACN,QAAA,MAAM,IAAI,KAAA,CAAM,QAAA,GAAW,GAAA,GAAM,8BAAA,GAAiC,MAAM,gBAAgB,CAAA;AAAA,MAC1F;AACA,MAAA,IAAI,GAAA,CAAI,KAAA,CAAM,MAAA,EAAQ,KAAK,CAAA,KAAM,cAAc,CAAC,eAAA,CAAgB,GAAA,CAAI,GAAG,CAAA,EAAG;AACxE,QAAA,MAAM,IAAI,KAAA,CAAM,QAAA,GAAW,GAAA,GAAM,6BAAA,GAAgC,MAAM,uCAAuC,CAAA;AAAA,MAChH;AACA,MAAA,IAAI,CAAC,eAAA,CAAgB,GAAA,CAAI,GAAG,CAAA,EAAG;AAC7B,QAAA,MAAM,IAAA,GAAO,oBAAoB,CAAC,CAAA;AAClC,QAAA,IAAA,CAAK,QAAA,GAAW,GAAA;AAChB,QAAA,IAAA,CAAK,gBAAA,GAAmB,KAAA;AACxB,QAAA,KAAA,CAAM,KAAK,IAAI,CAAA;AACf,QAAA,KAAA,MAAW,CAAA,IAAK,IAAA,CAAK,CAAA,CAAE,aAAa,CAAA,EAAG;AACrC,UAAA,IAAI,CAAC,eAAA,CAAgB,GAAA,CAAI,CAAC,CAAA,EAAG;AAC3B,YAAA,MAAM,IAAI,MAAM,UAAA,GAAa,GAAA,GAAM,aAAa,GAAA,GAAM,qBAAA,GAAwB,IAAI,2DAA2D,CAAA;AAAA,UAC/I;AACA,UAAA,KAAA,CAAM,IAAA,CAAK,EAAE,IAAA,EAAM,CAAA,EAAG,EAAA,EAAI,KAAK,IAAA,EAAM,WAAA,EAAa,MAAA,EAAQ,sBAAA,EAAwB,CAAA;AAAA,QACpF;AACA,QAAA,eAAA,CAAgB,IAAI,GAAG,CAAA;AACvB,QAAA,YAAA,CAAa,KAAK,GAAG,CAAA;AAAA,MACvB,CAAA,MAAO;AAIL,QAAA,MAAM,SAAA,GAAY,GAAA,GAAM,OAAA,GAAU,IAAA,CAAK,KAAK,CAAA;AAC5C,QAAA,MAAM,IAAA,GAAO,oBAAoB,CAAC,CAAA;AAClC,QAAA,IAAA,CAAK,EAAA,GAAK,SAAA;AACV,QAAA,IAAA,CAAK,IAAA,GAAO,GAAA,CAAI,CAAA,CAAE,IAAA,EAAM,GAAG,CAAA,GAAI,aAAA;AAC/B,QAAA,IAAA,CAAK,QAAA,GAAW,GAAA;AAChB,QAAA,IAAA,CAAK,gBAAA,GAAmB,UAAA;AACxB,QAAA,IAAA,CAAK,iBAAA,GAAoB,KAAK,GAAA,CAAI,EAAA,EAAI,KAAK,KAAA,CAAM,IAAA,CAAK,iBAAA,GAAoB,GAAG,CAAC,CAAA;AAC9E,QAAA,IAAA,CAAK,gBAAgB,CAAC,GAAA,CAAI,CAAA,CAAE,IAAI,KAAK,GAAG,CAAA;AACxC,QAAA,KAAA,CAAM,IAAA,CAAK,EAAE,IAAA,EAAM,GAAA,EAAK,EAAA,EAAI,SAAA,EAAW,IAAA,EAAM,WAAA,EAAa,MAAA,EAAQ,sBAAA,GAAyB,GAAA,GAAM,YAAA,GAAe,KAAK,CAAA;AACrH,QAAA,KAAA,CAAM,KAAK,IAAI,CAAA;AACf,QAAA,YAAA,CAAa,KAAK,SAAS,CAAA;AAAA,MAC7B;AAAA,IACF;AACA,IAAA,MAAM,UAAA,GAAa,IAAA,CAAK,EAAA,CAAG,WAAW,CAAA,CACnC,OAAO,CAAC,GAAA,KAAQ,YAAA,CAAa,GAAA,CAAI,GAAG,CAAC,EACrC,IAAA,CAAK,CAAC,CAAA,EAAG,CAAA,KAAM,YAAA,CAAa,GAAA,CAAI,CAAC,CAAA,GAAK,YAAA,CAAa,GAAA,CAAI,CAAC,CAAE,CAAA;AAC7D,IAAA,OAAA,CAAQ,KAAK,EAAE,EAAA,EAAI,KAAK,KAAA,EAAO,IAAA,EAAM,IAAI,EAAA,CAAG,IAAA,EAAM,GAAG,CAAA,EAAG,mBAAmB,GAAA,CAAI,EAAA,CAAG,kBAAkB,CAAA,EAAG,YAAA,EAAc,YAAY,CAAA;AAAA,EACnI;AAGA,EAAA,KAAA,MAAW,KAAK,QAAA,EAAU;AACxB,IAAA,MAAM,GAAA,GAAM,GAAA,CAAI,CAAA,CAAE,UAAU,CAAA;AAC5B,IAAA,IAAI,GAAA,IAAO,YAAY,GAAA,CAAI,GAAG,KAAK,CAAC,eAAA,CAAgB,GAAA,CAAI,GAAG,CAAA,EAAG;AAC5D,MAAA,MAAM,IAAI,KAAA,CAAM,UAAA,GAAa,GAAA,GAAM,uEAAuE,CAAA;AAAA,IAC5G;AAAA,EACF;AAEA,EAAA,MAAM,YAAA,GAAe,IAAI,GAAA,CAAI,OAAA,CAAQ,QAAQ,CAAC,CAAA,KAAM,CAAA,CAAE,UAAU,CAAC,CAAA;AACjE,EAAA,MAAM,kBAAkB,QAAA,CAAS,GAAA,CAAI,CAAC,CAAA,KAAM,GAAA,CAAI,EAAE,EAAE,CAAC,CAAA,CAAE,MAAA,CAAO,CAAC,GAAA,KAAQ,GAAA,IAAO,CAAC,YAAA,CAAa,GAAA,CAAI,GAAG,CAAC,CAAA;AACpG,EAAA,IAAI,eAAA,CAAgB,SAAS,CAAA,EAAG;AAC9B,IAAA,MAAM,IAAI,KAAA,CAAM,qCAAA,GAAwC,gBAAgB,IAAA,CAAK,IAAI,IAAI,gBAAgB,CAAA;AAAA,EACvG;AAGA,EAAA,MAAM,eAA2B,EAAC;AAClC,EAAA,KAAA,MAAW,OAAO,OAAA,EAAS;AACzB,IAAA,MAAM,GAAA,GAAgB,CAAC,GAAG,GAAA,CAAI,YAAY,CAAA;AAC1C,IAAA,KAAA,MAAW,GAAA,IAAO,IAAI,UAAA,EAAY;AAChC,MAAA,MAAM,CAAA,GAAI,SAAS,IAAA,CAAK,CAAC,MAAM,GAAA,CAAI,CAAA,CAAE,EAAE,CAAA,KAAM,GAAG,CAAA;AAChD,MAAA,MAAM,UAAU,eAAA,CAAgB,CAAA,EAAG,GAAA,EAAK,KAAA,EAAO,OAAO,SAAS,CAAA;AAC/D,MAAA,KAAA,MAAW,OAAO,OAAA,EAAS;AACzB,QAAA,MAAM,OAAO,KAAA,CAAM,IAAA,CAAK,CAAC,CAAA,KAAM,CAAA,CAAE,OAAO,GAAG,CAAA;AAC3C,QAAA,IAAA,CAAK,WAAW,GAAA,CAAI,EAAA;AAAA,MACtB;AACA,MAAA,GAAA,CAAI,IAAA,CAAK,GAAG,OAAO,CAAA;AAAA,IACrB;AACA,IAAA,YAAA,CAAa,KAAK,GAAG,CAAA;AAAA,EACvB;AAIA,EAAA,MAAM,QAAA,GAAW,IAAI,GAAA,CAAI,KAAA,CAAM,GAAA,CAAI,CAAC,CAAA,KAAM,CAAA,CAAE,IAAA,GAAO,GAAA,GAAM,CAAA,CAAE,EAAE,CAAC,CAAA;AAC9D,EAAA,MAAM,QAAA,GAAW,CAAC,IAAA,EAAc,EAAA,EAAY,MAAA,KAAmB;AAC7D,IAAA,MAAM,GAAA,GAAM,OAAO,GAAA,GAAM,EAAA;AACzB,IAAA,IAAI,QAAA,CAAS,GAAA,CAAI,GAAG,CAAA,EAAG;AACvB,IAAA,QAAA,CAAS,IAAI,GAAG,CAAA;AAChB,IAAA,KAAA,CAAM,KAAK,EAAE,IAAA,EAAM,IAAI,IAAA,EAAM,WAAA,EAAa,QAAQ,CAAA;AAAA,EACpD,CAAA;AACA,EAAA,KAAA,MAAW,KAAK,QAAA,EAAU;AACxB,IAAA,MAAM,GAAA,GAAM,GAAA,CAAI,CAAA,CAAE,UAAU,CAAA;AAC5B,IAAA,MAAM,GAAA,GAAM,GAAA,CAAI,CAAA,CAAE,UAAU,CAAA;AAC5B,IAAA,IAAI,CAAC,WAAA,CAAY,GAAA,CAAI,GAAG,CAAA,EAAG;AAC3B,IAAA,MAAM,aAAa,gBAAA,CAAiB,GAAA,CAAI,GAAG,CAAA,IAAK,IAAI,CAAC,CAAA;AACrD,IAAA,IAAI,CAAC,SAAA,EAAW;AAChB,IAAA,MAAM,KAAA,GAAQ,GAAA,CAAI,CAAA,CAAE,KAAA,EAAO,KAAK,CAAA;AAChC,IAAA,QAAA,CAAS,GAAA,EAAK,WAAW,GAAA,CAAI,CAAA,CAAE,cAAc,aAAa,CAAA,GAAI,IAAA,GAAO,KAAA,GAAQ,GAAG,CAAA;AAIhF,IAAA,KAAA,MAAW,KAAK,KAAA,EAAO;AACrB,MAAA,IAAI,CAAA,CAAE,IAAA,KAAS,SAAA,IAAa,CAAA,CAAE,gBAAgB,GAAA,IAAO,CAAA,CAAE,gBAAA,KAAqB,UAAA,IAAc,CAAA,CAAE,QAAA,KAAa,GAAA,CAAI,CAAA,CAAE,QAAQ,CAAA,EAAG;AACxH,QAAA,QAAA,CAAS,CAAA,CAAE,EAAA,EAAI,SAAA,EAAW,wBAAA,GAA2B,QAAQ,GAAG,CAAA;AAAA,MAClE;AAAA,IACF;AAAA,EACF;AAEA,EAAA,kBAAA,CAAmB,KAAK,CAAA;AAQxB,EAAA,MAAM,SAAA,GAAY,IAAI,GAAA,CAAI,KAAA,CAAM,GAAA,CAAI,CAAC,CAAA,EAAG,CAAA,KAAM,CAAC,CAAA,CAAE,EAAA,EAAI,CAAC,CAAC,CAAC,CAAA;AACxD,EAAA,MAAM,UAAA,uBAAiB,GAAA,EAAoB;AAC3C,EAAA,KAAA,MAAW,CAAA,IAAK,OAAO,KAAA,MAAW,CAAA,IAAK,EAAE,QAAA,EAAU,GAAA,IAAO,EAAC,EAAG;AAC5D,IAAA,MAAM,GAAA,GAAM,EAAE,WAAA,EAAY;AAC1B,IAAA,IAAI,CAAC,WAAW,GAAA,CAAI,GAAG,GAAG,UAAA,CAAW,GAAA,CAAI,GAAA,EAAK,CAAA,CAAE,EAAE,CAAA;AAAA,EACpD;AACA,EAAA,KAAA,MAAW,KAAK,KAAA,EAAO;AACrB,IAAA,KAAA,MAAW,CAAA,IAAK,CAAA,CAAE,QAAA,EAAU,YAAA,IAAgB,EAAC,EAAG;AAC9C,MAAA,MAAM,GAAA,GAAM,UAAA,CAAW,GAAA,CAAI,CAAA,CAAE,aAAa,CAAA;AAC1C,MAAA,IAAI,CAAC,GAAA,IAAO,GAAA,KAAQ,CAAA,CAAE,EAAA,EAAI;AAC1B,MAAA,IAAI,SAAA,CAAU,GAAA,CAAI,GAAG,CAAA,GAAK,UAAU,GAAA,CAAI,CAAA,CAAE,EAAE,CAAA,WAAa,GAAA,EAAK,CAAA,CAAE,EAAA,EAAI,wBAAA,GAA2B,IAAI,GAAG,CAAA;AAAA,IACxG;AAAA,EACF;AAEA,EAAA,MAAM,MAAA,GAAS,OAAA,CAAQ,GAAA,CAAI,CAAC,KAAK,CAAA,MAAO;AAAA,IACtC,IAAI,GAAA,CAAI,EAAA;AAAA,IACR,OAAO,GAAA,CAAI,KAAA;AAAA,IACX,MAAM,GAAA,CAAI,IAAA;AAAA,IACV,kBAAA,EAAoB,GAAA,CAAI,iBAAA,IAAqB,QAAA,IAAY,IAAI,CAAA,CAAA,GAAK,cAAA;AAAA,IAClE,QAAA,EAAU,aAAa,CAAC;AAAA,GAC1B,CAAE,CAAA;AAEF,EAAA,OAAO,sBAAA,CAAuB;AAAA,IAC5B,cAAA,EAAgB,CAAA;AAAA,IAChB,MAAA,EAAQ,EAAE,UAAA,EAAY,cAAA,EAAgB,QAAA,EAAU,IAAA,CAAK,QAAA,IAAY,EAAC,EAAG,mBAAA,EAAqB,IAAA,CAAK,kBAAA,IAAsB,CAAA,EAAE;AAAA,IACvH,cAAA,EAAgB,KAAA;AAAA,IAChB,gBAAA,EAAkB,KAAA;AAAA,IAClB,mBAAA,EAAqB,SAAA;AAAA,IACrB;AAAA,GACD,CAAA;AACH;AAGA,SAAS,wBAAA,CAAyB,MAAA,EAAa,KAAA,EAAmB,KAAA,EAAmB,YAAA,EAA6B;AAChH,EAAA,MAAM,aAAa,IAAI,GAAA,CAAI,MAAM,MAAA,CAAO,CAAC,MAAM,CAAA,CAAE,IAAA,KAAS,SAAS,CAAA,CAAE,IAAI,CAAC,CAAA,KAAM,EAAE,WAAA,IAAe,CAAA,CAAE,EAAE,CAAC,CAAA;AACtG,EAAA,KAAA,MAAW,CAAA,IAAK,GAAA,CAAI,MAAA,CAAO,KAAK,CAAA,EAAG;AACjC,IAAA,MAAM,SAAA,GAAY,GAAA,CAAI,CAAA,CAAE,UAAU,CAAA;AAClC,IAAA,MAAM,SAAA,GAAY,GAAA,CAAI,CAAA,CAAE,UAAU,CAAA;AAClC,IAAA,IAAI,CAAC,UAAA,CAAW,GAAA,CAAI,SAAS,CAAA,EAAG;AAChC,IAAA,MAAM,KAAA,GAAQ,GAAA,CAAI,CAAA,CAAE,KAAA,EAAO,KAAK,CAAA;AAChC,IAAA,MAAM,YAAY,KAAA,CAAM,IAAA,CAAK,CAAC,CAAA,KAAM,CAAA,CAAE,eAAe,SAAS,CAAA;AAC9D,IAAA,IAAI,SAAA,EAAW;AACb,MAAA,KAAA,CAAM,KAAK,EAAE,IAAA,EAAM,WAAW,EAAA,EAAI,SAAA,CAAU,IAAI,IAAA,EAAM,WAAA,EAAa,MAAA,EAAQ,GAAA,CAAI,EAAE,YAAA,EAAc,aAAa,IAAI,IAAA,GAAO,KAAA,GAAQ,KAAK,CAAA;AACpI,MAAA,IAAoB,CAAC,SAAA,CAAU,UAAA,EAAY;AACzC,QAAA,SAAA,CAAU,UAAA,GAAc,CAAC,KAAA,EAAO,KAAA,EAAO,KAAK,CAAA,CAAY,QAAA,CAAS,KAAc,CAAA,GAAK,KAAA,GAAmC,KAAA;AAAA,MACzH;AAAA,IACF;AAAA,EACF;AACF;AAEA,SAAS,iBAAA,CAAkB,IAAS,IAAA,EAAuC;AACzE,EAAA,MAAM,QAAoB,EAAC;AAC3B,EAAA,MAAM,QAAoB,EAAC;AAC3B,EAAA,MAAM,YAA4B,EAAC;AACnC,EAAA,MAAM,UAAA,GAAa,IAAI,GAAA,CAAI,GAAA,CAAI,GAAG,QAAQ,CAAA,CAAE,GAAA,CAAI,CAAC,CAAA,KAAM,GAAA,CAAI,CAAA,CAAE,EAAE,CAAC,CAAC,CAAA;AACjE,EAAA,KAAA,MAAW,CAAA,IAAK,GAAA,CAAI,EAAA,CAAG,QAAQ,CAAA,EAAG;AAChC,IAAA,MAAM,IAAA,GAAO,oBAAoB,CAAC,CAAA;AAClC,IAAA,KAAA,CAAM,KAAK,IAAI,CAAA;AACf,IAAA,KAAA,MAAW,CAAA,IAAK,IAAA,CAAK,CAAA,CAAE,aAAa,CAAA,EAAG;AACrC,MAAA,IAAI,MAAM,IAAA,CAAK,EAAA,IAAM,UAAA,CAAW,GAAA,CAAI,CAAC,CAAA,EAAG;AACtC,QAAA,KAAA,CAAM,IAAA,CAAK;AAAA,UACT,IAAA,EAAM,CAAA;AAAA,UACN,IAAI,IAAA,CAAK,EAAA;AAAA,UACT,IAAA,EAAM,WAAA;AAAA,UACN,MAAA,EAAQ,CAAA,sBAAA,EAAyB,CAAC,CAAA,2BAAA,EAA8B,KAAK,EAAE,CAAA;AAAA,SACxE,CAAA;AAAA,MACH;AAAA,IACF;AAAA,EACF;AAGA,EAAA,IAAI,GAAA,CAAI,EAAA,CAAG,aAAa,CAAA,CAAE,SAAS,CAAA,EAAG;AACpC,IAAA,MAAM,QAAA,uBAAe,GAAA,EAAoB;AACzC,IAAA,GAAA,CAAI,GAAG,aAAa,CAAA,CAAE,OAAA,CAAQ,CAAC,GAAG,GAAA,KAAQ;AACxC,MAAA,MAAM,GAAA,GAAM,GAAA,CAAI,CAAA,CAAE,UAAU,CAAA;AAC5B,MAAA,IAAI,GAAA,WAAc,GAAA,CAAI,GAAA,EAAK,IAAI,CAAA,CAAE,KAAA,EAAO,GAAA,GAAM,CAAC,CAAC,CAAA;AAAA,IAClD,CAAC,CAAA;AACD,IAAA,KAAA,CAAM,IAAA,CAAK,CAAC,CAAA,EAAG,CAAA,KAAA,CAAO,SAAS,GAAA,CAAI,CAAA,CAAE,EAAE,CAAA,IAAK,QAAQ,QAAA,CAAS,GAAA,CAAI,CAAA,CAAE,EAAE,KAAK,GAAA,CAAI,CAAA;AAAA,EAChF;AAEA,EAAA,IAAI,EAAA,GAAK,CAAA;AACT,EAAA,KAAA,MAAW,GAAA,IAAO,GAAA,CAAI,EAAA,CAAG,UAAU,CAAA,EAAG;AACpC,IAAA,EAAA,IAAM,CAAA;AACN,IAAA,MAAM,GAAA,GAAM,IAAA,CAAK,GAAA,CAAI,WAAW,EAAE,MAAA,CAAO,CAAC,EAAA,KAAO,KAAA,CAAM,KAAK,CAAC,CAAA,KAAM,CAAA,CAAE,EAAA,KAAO,EAAE,CAAC,CAAA;AAC/E,IAAA,IAAI,GAAA,CAAI,SAAS,CAAA,EAAG;AAClB,MAAA,SAAA,CAAU,IAAA,CAAK;AAAA,QACb,EAAA,EAAI,GAAA,CAAI,GAAA,CAAI,EAAA,EAAI,QAAQ,EAAE,CAAA;AAAA,QAC1B,IAAA,EAAM,GAAA,CAAI,GAAA,CAAI,IAAA,EAAM,cAAc,EAAE,CAAA;AAAA,QACpC,QAAA,EAAU,GAAA;AAAA,QACV,SAAA,EAAW,GAAA,CAAI,GAAA,CAAI,WAAA,EAAa,EAAE;AAAA,OACnC,CAAA;AAAA,IACH;AAAA,EACF;AACA,EAAA,kBAAA,CAAmB,KAAK,CAAA;AACxB,EAAA,OAAO,sBAAA,CAAuB;AAAA,IAC5B,cAAA,EAAgB,CAAA;AAAA,IAChB,MAAA,EAAQ,EAAE,UAAA,EAAY,iBAAA,EAAmB,QAAA,EAAU,IAAA,CAAK,QAAA,IAAY,EAAC,EAAG,mBAAA,EAAqB,IAAA,CAAK,kBAAA,IAAsB,CAAA,EAAE;AAAA,IAC1H,cAAA,EAAgB,KAAA;AAAA,IAChB,gBAAA,EAAkB,KAAA;AAAA,IAClB,mBAAA,EAAqB,SAAA;AAAA,IACrB,QAAQ;AAAC,GACV,CAAA;AACH;AAEA,SAAS,eAAA,CAAgB,IAAS,IAAA,EAAuC;AACvE,EAAA,MAAM,QAAoB,EAAC;AAC3B,EAAA,MAAM,QAAoB,EAAC;AAC3B,EAAA,MAAM,YAA4B,EAAC;AACnC,EAAA,GAAA,CAAI,EAAA,CAAG,QAAQ,CAAA,CAAE,OAAA,CAAQ,CAAC,CAAA,EAAG,EAAA,KAAO,gBAAgB,CAAA,EAAG,GAAA,CAAI,EAAE,EAAA,EAAI,GAAA,GAAM,KAAK,EAAA,GAAK,CAAC,CAAC,CAAA,EAAG,KAAA,EAAO,KAAA,EAAO,SAAS,CAAC,CAAA;AAC9G,EAAA,IAAI,KAAA,CAAM,WAAW,CAAA,IAAK,GAAA,CAAI,GAAG,QAAQ,CAAA,CAAE,SAAS,CAAA,EAAG;AACrD,IAAA,MAAM,QAAA,GAAW,GAAA,CAAK,EAAA,CAAG,cAAA,IAAkB,EAAU,CAAA,CAAE,MAAA,GAAS,CAAA,IAAK,GAAA,CAAK,EAAA,CAAG,cAAA,EAAoC,KAAK,EAAE,MAAA,GAAS,CAAA;AACjI,IAAA,MAAM,IAAI,KAAA;AAAA,MACR,oBAAA,GAAuB,IAAI,EAAA,CAAG,QAAQ,EAAE,MAAA,GAAS,qFAAA,IAChD,WACG,oLAAA,GACA,mGAAA;AAAA,KACN;AAAA,EACF;AACA,EAAA,kBAAA,CAAmB,KAAK,CAAA;AACxB,EAAA,OAAO,sBAAA,CAAuB;AAAA,IAC5B,cAAA,EAAgB,CAAA;AAAA,IAChB,MAAA,EAAQ,EAAE,UAAA,EAAY,eAAA,EAAiB,QAAA,EAAU,IAAA,CAAK,QAAA,IAAY,EAAC,EAAG,mBAAA,EAAqB,IAAA,CAAK,kBAAA,IAAsB,CAAA,EAAE;AAAA,IACxH,cAAA,EAAgB,KAAA;AAAA,IAChB,gBAAA,EAAkB,KAAA;AAAA,IAClB,mBAAA,EAAqB,SAAA;AAAA,IACrB,QAAQ;AAAC,GACV,CAAA;AACH;AAGO,SAAS,kBAAA,CACd,KAAA,EACA,IAAA,GAAwB,EAAC,EACT;AAChB,EAAA,MAAM,CAAA,GAAI,KAAA;AACV,EAAA,IAAI,GAAA,CAAI,CAAA,CAAE,cAAc,CAAA,CAAE,SAAS,CAAA,EAAG;AACpC,IAAA,OAAO,uBAAuB,CAAC,CAAA;AAAA,EACjC;AACA,EAAA,IAAI,CAAA,CAAE,aAAA,IAAiB,CAAA,CAAE,eAAA,IAAmB,IAAI,CAAA,CAAE,KAAK,CAAA,CAAE,MAAA,GAAS,KAAK,GAAA,CAAI,CAAA,CAAE,MAAM,CAAA,CAAE,SAAS,CAAA,EAAG;AAC/F,IAAA,OAAO,cAAA,CAAe,GAAG,IAAI,CAAA;AAAA,EAC/B;AACA,EAAA,IAAI,GAAA,CAAI,CAAA,CAAE,QAAQ,CAAA,CAAE,SAAS,CAAA,IAAK,GAAA,CAAI,CAAA,CAAE,IAAI,CAAA,KAAM,iBAAA,EAAmB,OAAO,iBAAA,CAAkB,GAAG,IAAI,CAAA;AACrG,EAAA,OAAO,eAAA,CAAgB,GAAG,IAAI,CAAA;AAChC","file":"chunk-RAR5MUUK.mjs","sourcesContent":["import {\n  validateCurriculumFeed, type CurriculumFeed, type FeedNode, type FeedEdge, type FeedGrouping,\n} from '../schemas/curriculumFeedSchema';\n\n/**\n * CurriculumFeed emitter - pure transformation from a VERIFIED domain graph\n * to the planner-ready feed. No LLM calls: hints derive from existing\n * annotations only. Validates its own output (fail-closed).\n *\n * Phase-driven emission (hybrid graphs with development phases): the teaching\n * sequence IS the phase sequence. Concepts are emitted at the phase that\n * introduces them (aspect new) or revisits them at higher depth (aspect\n * advanced) - never as a trailing knowledge appendix. Concept minutes stay\n * UNMERGED: no prerequisite-minute inflation (the planner schedules the\n * revisit, not the total).\n */\n\nexport interface EmitFeedOptions {\n  hallucinationCount?: number;\n  warnings?: string[];\n}\n\nconst BLOOM_RANK: Record<string, number> = { Remember: 0, Understand: 1, Apply: 2, Analyze: 3, Evaluate: 4, Create: 5 };\nconst pad2 = (n: number): string => String(n).padStart(2, '0');\n\ntype Rec = Record<string, unknown>;\nconst arr = (v: unknown): Rec[] => (Array.isArray(v) ? (v as Rec[]) : []);\nconst str = (v: unknown, d = ''): string => (typeof v === 'string' ? v : d);\nconst num = (v: unknown, d: number): number => (typeof v === 'number' && Number.isFinite(v) ? v : d);\nconst strs = (v: unknown): string[] => (Array.isArray(v) ? v.filter((x): x is string => typeof x === 'string') : []);\n\nfunction stepMinutes(step: Rec): number {\n  const effort = (step.effort ?? {}) as Rec;\n  return Math.max(0, Math.round(num(effort.estimated_minutes, num(step.estimated_minutes, 45))));\n}\n\nfunction newKeywordsInOrder(nodes: FeedNode[]): void {\n  // First appearance in emission order becomes 'new'; everything seen before is 'prerequisite'.\n  const seen = new Set<string>();\n  for (const n of nodes) {\n    const all = n.keywords.all;\n    n.keywords.new = [];\n    n.keywords.prerequisite = [];\n    for (const k of all) {\n      if (seen.has(k)) n.keywords.prerequisite.push(k);\n      else n.keywords.new.push(k);\n      seen.add(k);\n    }\n  }\n}\n\nfunction feedNodeFromStep(step: Rec, featureId: string): FeedNode {\n  const id = str(step.id);\n  return {\n    id,\n    kind: 'product_step',\n    name: str(step.name, id),\n    concept_codes: strs(step.concept_codes),\n    keywords: { all: strs(step.keywords), new: [], prerequisite: [] },\n    estimated_minutes: stepMinutes(step),\n    bloom_hint: 'Apply',\n    depth_hint: null,\n    completion_level: 'standard',\n    scaffolding: { scaffold_candidates: [], core_value_minutes: stepMinutes(step) },\n    references: arr(step.files).map((f) => ({ file: str(f), evidence: 'step file' })).filter((f) => f.file),\n    feature_id: featureId,\n    concept_ref: null,\n    phase_id: '',\n    introduce_aspect: null,\n  };\n}\n\nfunction deriveConceptDepthHint(concept: Rec): FeedNode['depth_hint'] {\n  const explicit = str(concept.depth_hint);\n  if (explicit === 'ulo' || explicit === 'cio' || explicit === 'sio') return explicit;\n\n  const sio = arr(concept.sio);\n  const prereqs = strs(concept.prerequisites);\n  const pts = arr(concept.problem_types);\n  const hasHighBloom = pts.some((p) => {\n    const b = str(p.bloom_level);\n    return b === 'Apply' || b === 'Analyze' || b === 'Evaluate' || b === 'Create';\n  });\n\n  if (sio.length >= 2 || hasHighBloom) return 'sio';\n  if (str(concept.cio) || prereqs.length >= 1) return 'cio';\n  return 'ulo';\n}\n\nfunction feedNodeFromConcept(concept: Rec): FeedNode {\n  const id = str(concept.id);\n  const pts = arr(concept.problem_types)\n    .map((p) => str(p.bloom_level, 'Understand'))\n    .filter((b) => b in BLOOM_RANK)\n    .sort((a, b) => BLOOM_RANK[a] - BLOOM_RANK[b]);\n  const topBloom = pts[pts.length - 1] ?? 'Understand';\n\n  const rawRefs = arr(concept.references);\n  const references = rawRefs.length > 0\n    ? rawRefs.map((r) => ({ file: str(r.file, 'syllabus.md'), evidence: str(r.evidence, str(concept.name)) })).filter((r) => r.file)\n    : [{ file: 'syllabus.md', evidence: str(concept.category ? `Topic under category ${str(concept.category)}` : str(concept.name), id) }];\n\n  const problemScaffolds = arr(concept.problem_types).map((pt) => ({\n    item: str(pt.name, 'Problem type'),\n    reason: str(pt.description, 'Formative practice check'),\n    minutes_saved: num(pt.estimated_minutes, 10),\n    suggest: 'provide_partial' as const,\n  }));\n\n  return {\n    id,\n    kind: 'concept',\n    name: str(concept.name, id),\n    concept_codes: [str(concept.code) || id].filter(Boolean),\n    keywords: { all: strs(concept.keywords), new: [], prerequisite: [] },\n    estimated_minutes: Math.max(0, Math.round(num(concept.estimated_minutes, 30))),\n    bloom_hint: topBloom as FeedNode['bloom_hint'],\n    depth_hint: deriveConceptDepthHint(concept),\n    completion_level: 'standard',\n    scaffolding: {\n      scaffold_candidates: problemScaffolds,\n      core_value_minutes: Math.max(0, Math.round(num(concept.estimated_minutes, 30))),\n    },\n    references,\n    feature_id: null,\n    concept_ref: id,\n    phase_id: '',\n    introduce_aspect: null,\n  };\n}\n\nfunction addFeatureGroup(\n  f: Rec, fid: string, nodes: FeedNode[], edges: FeedEdge[], groupings: FeedGrouping[],\n): string[] {\n  const steps = arr(f.steps);\n  const stepIds: string[] = [];\n  let prev = '';\n  for (let i = 0; i < steps.length; i++) {\n    const stepNode = feedNodeFromStep(steps[i], fid);\n    if (!stepNode.id) continue;\n    stepIds.push(stepNode.id);\n    nodes.push(stepNode);\n    if (prev) edges.push({ from: prev, to: stepNode.id, kind: 'task', reason: 'feature build order' });\n    prev = stepNode.id;\n  }\n  for (const dep of strs(f.depends_on)) {\n    const depFirst = nodes.find((n) => n.feature_id === dep);\n    if (depFirst && stepIds[0]) edges.push({ from: depFirst.id, to: stepIds[0], kind: 'task', reason: 'feature depends_on ' + dep });\n  }\n  if (stepIds.length > 0) groupings.push({ id: 'G-' + fid, name: str(f.name, fid), node_ids: stepIds, rationale: str(f.description, '') });\n  return stepIds;\n}\n\ninterface EmitPhaseCtx {\n  id: string;\n  order: number;\n  name: string;\n  productCompletion: string;\n  conceptOrder: string[]; // concept node ids in teaching order (new first, then advanced)\n  featureIds: string[];\n}\n\n/**\n * Phase-driven hybrid emission:\n *  - emit concepts per phase (aspect new first, then advanced) BEFORE the\n *    phase's features; knowledge edges concept -> first step of consumer\n *    features carry the JIT relation\n *  - feature order inside a phase follows the project graph order\n *  - phases and their node_ids go into feed.phases (teaching sequence)\n *  - concept minutes stay UNMERGED (no prereq-minute accumulation)\n */\nfunction emitFromHybrid(hybrid: Rec, opts: EmitFeedOptions): CurriculumFeed {\n  const nodes: FeedNode[] = [];\n  const edges: FeedEdge[] = [];\n  const groupings: FeedGrouping[] = [];\n  const pg = (hybrid.project_graph ?? {}) as Rec;\n  const kg = (hybrid.knowledge_graph ?? {}) as Rec;\n  const rawPhases = arr(hybrid.phases).filter((p) => str(p.id));\n\n  const features = arr(pg.features);\n  const conceptRecs = arr(kg.concepts);\n  const conceptById = new Map(conceptRecs.map((c) => [str(c.id), c]));\n\n  // --- no phases -> legacy path (concepts first, then features) -----------\n  if (rawPhases.length === 0) {\n    for (const c of conceptRecs) {\n      const node = feedNodeFromConcept(c);\n      nodes.push(node);\n      for (const p of strs(c.prerequisites)) edges.push({ from: p, to: node.id, kind: 'knowledge', reason: 'concept prerequisite' });\n    }\n    features.forEach((f, fi) => addFeatureGroup(f, str(f.id, 'F' + pad2(fi + 1)), nodes, edges, groupings));\n    linkHybridKnowledgeEdges(hybrid, nodes, edges, true);\n    newKeywordsInOrder(nodes);\n    return validateCurriculumFeed({\n      schema_version: 2,\n      source: { graph_type: 'hybrid_graph', warnings: opts.warnings ?? [], hallucination_count: opts.hallucinationCount ?? 0 },\n      learning_nodes: nodes,\n      dependency_edges: edges,\n      suggested_groupings: groupings,\n      phases: [],\n    });\n  }\n\n  // --- phase-driven emission ----------------------------------------------\n  const featureOrder = new Map<string, number>();\n  features.forEach((f, fi) => featureOrder.set(str(f.id, 'F' + pad2(fi + 1)), fi));\n  const stepIdsByFeature = new Map<string, string[]>();\n  for (const f of features) {\n    const fid = str(f.id);\n    stepIdsByFeature.set(fid, arr(f.steps).map((s) => str(s.id)).filter(Boolean));\n  }\n\n  const emitCtx: EmitPhaseCtx[] = [];\n  const emittedConcepts = new Set<string>();\n  const linkList = arr(hybrid.links);\n\n  for (const rp of rawPhases) {\n    const pid = str(rp.id);\n    const order = num(rp.order, emitCtx.length + 1);\n    const conceptOrder: string[] = [];\n    const intros = arr(rp.introduces);\n    // new introductions first, then advanced revisits (teaching order)\n    const news = intros.filter((i) => str(i.aspect, 'new') === 'new');\n    const advanced = intros.filter((i) => str(i.aspect) === 'advanced');\n    for (const intro of [...news, ...advanced]) {\n      const cid = str(intro.concept_id);\n      const c = conceptById.get(cid);\n      if (!c) {\n        throw new Error('Phase ' + pid + ' introduces unknown concept ' + cid + ' - fail-closed');\n      }\n      if (str(intro.aspect, 'new') === 'advanced' && !emittedConcepts.has(cid)) {\n        throw new Error('Phase ' + pid + ' advanced-revisits concept ' + cid + ' that was never emitted - fail-closed');\n      }\n      if (!emittedConcepts.has(cid)) {\n        const node = feedNodeFromConcept(c);\n        node.phase_id = pid;\n        node.introduce_aspect = 'new';\n        nodes.push(node);\n        for (const p of strs(c.prerequisites)) {\n          if (!emittedConcepts.has(p)) {\n            throw new Error('Concept ' + cid + ' (phase ' + pid + ') has prerequisite ' + p + ' that is not introduced in an earlier phase - fail-closed');\n          }\n          edges.push({ from: p, to: cid, kind: 'knowledge', reason: 'concept prerequisite' });\n        }\n        emittedConcepts.add(cid);\n        conceptOrder.push(cid);\n      } else {\n        // advanced revisit: re-emit as a NEW node with a revisit id so the\n        // planner can schedule the higher-depth pass without double-counting\n        // the first introduction\n        const revisitId = cid + '__ADV' + pad2(order);\n        const node = feedNodeFromConcept(c);\n        node.id = revisitId;\n        node.name = str(c.name, cid) + ' (advanced)';\n        node.phase_id = pid;\n        node.introduce_aspect = 'advanced';\n        node.estimated_minutes = Math.max(15, Math.round(node.estimated_minutes * 0.5));\n        node.concept_codes = [str(c.code) || cid];\n        edges.push({ from: cid, to: revisitId, kind: 'knowledge', reason: 'advanced revisit of ' + cid + ' at phase ' + pid });\n        nodes.push(node);\n        conceptOrder.push(revisitId);\n      }\n    }\n    const featureIds = strs(rp.feature_ids)\n      .filter((fid) => featureOrder.has(fid))\n      .sort((a, b) => featureOrder.get(a)! - featureOrder.get(b)!);\n    emitCtx.push({ id: pid, order, name: str(rp.name, pid), productCompletion: str(rp.product_completion), conceptOrder, featureIds });\n  }\n\n  // Fail-closed: every concept consumed by a link must be emitted somewhere\n  for (const l of linkList) {\n    const cid = str(l.concept_id);\n    if (cid && conceptById.has(cid) && !emittedConcepts.has(cid)) {\n      throw new Error('Concept ' + cid + ' is consumed by links but never introduced in any phase - fail-closed');\n    }\n  }\n  // Fail-closed: every feature must sit in exactly one emitted phase\n  const seenFeatures = new Set(emitCtx.flatMap((e) => e.featureIds));\n  const missingFeatures = features.map((f) => str(f.id)).filter((fid) => fid && !seenFeatures.has(fid));\n  if (missingFeatures.length > 0) {\n    throw new Error('Features not covered by any phase: ' + missingFeatures.join(', ') + ' - fail-closed');\n  }\n\n  // Emit feature steps phase by phase (teaching sequence)\n  const phaseNodeIds: string[][] = [];\n  for (const ctx of emitCtx) {\n    const ids: string[] = [...ctx.conceptOrder];\n    for (const fid of ctx.featureIds) {\n      const f = features.find((x) => str(x.id) === fid)!;\n      const stepIds = addFeatureGroup(f, fid, nodes, edges, groupings);\n      for (const sid of stepIds) {\n        const node = nodes.find((n) => n.id === sid)!;\n        node.phase_id = ctx.id;\n      }\n      ids.push(...stepIds);\n    }\n    phaseNodeIds.push(ids);\n  }\n\n  // Knowledge edges: concept -> first step of each consumer feature (JIT).\n  // Deduped by (from,to): several links may target the same feature.\n  const edgeSeen = new Set(edges.map((e) => e.from + '>' + e.to));\n  const pushEdge = (from: string, to: string, reason: string) => {\n    const key = from + '>' + to;\n    if (edgeSeen.has(key)) return;\n    edgeSeen.add(key);\n    edges.push({ from, to, kind: 'knowledge', reason });\n  };\n  for (const l of linkList) {\n    const cid = str(l.concept_id);\n    const fid = str(l.feature_id);\n    if (!conceptById.has(cid)) continue;\n    const firstStep = (stepIdsByFeature.get(fid) || [])[0];\n    if (!firstStep) continue;\n    const depth = str(l.depth, 'cio');\n    pushEdge(cid, firstStep, str(l.relationship, 'hybrid link') + ' [' + depth + ']');\n    // Advanced revisits feed only features of the revisit's OWN phase: a PH2\n    // revisit must never become a prerequisite of a PH1 feature (teaching\n    // order is phase-ordered).\n    for (const n of nodes) {\n      if (n.kind === 'concept' && n.concept_ref === cid && n.introduce_aspect === 'advanced' && n.phase_id === str(l.phase_id)) {\n        pushEdge(n.id, firstStep, 'advanced application [' + depth + ']');\n      }\n    }\n  }\n\n  newKeywordsInOrder(nodes);\n\n  // Deterministic keyword-prerequisite materialization: when a node declares a\n  // keyword as PREREQUISITE, some other node must INTRODUCE it (new) EARLIER in\n  // feed order. Missing edge = planner can schedule the consumer first while the\n  // audit flags ordering it cannot fix. Edge kind 'keyword' — the planner\n  // honors it for topological order; 'mastered_before_course' entries are exempt\n  // (entry-level keywords need no introducer).\n  const feedOrder = new Map(nodes.map((n, i) => [n.id, i]));\n  const introducer = new Map<string, string>();\n  for (const n of nodes) for (const k of n.keywords?.new ?? []) {\n    const key = k.toLowerCase();\n    if (!introducer.has(key)) introducer.set(key, n.id);\n  }\n  for (const n of nodes) {\n    for (const k of n.keywords?.prerequisite ?? []) {\n      const src = introducer.get(k.toLowerCase());\n      if (!src || src === n.id) continue;\n      if (feedOrder.get(src)! < feedOrder.get(n.id)!) pushEdge(src, n.id, 'keyword prerequisite [' + k + ']');\n    }\n  }\n\n  const phases = emitCtx.map((ctx, i) => ({\n    id: ctx.id,\n    order: ctx.order,\n    name: ctx.name,\n    product_completion: ctx.productCompletion || 'Phase ' + (i + 1) + ' deliverable',\n    node_ids: phaseNodeIds[i],\n  }));\n\n  return validateCurriculumFeed({\n    schema_version: 2,\n    source: { graph_type: 'hybrid_graph', warnings: opts.warnings ?? [], hallucination_count: opts.hallucinationCount ?? 0 },\n    learning_nodes: nodes,\n    dependency_edges: edges,\n    suggested_groupings: groupings,\n    phases,\n  });\n}\n\n/** Legacy helper: knowledge edges from hybrid links (used by the no-phase path). */\nfunction linkHybridKnowledgeEdges(hybrid: Rec, nodes: FeedNode[], edges: FeedEdge[], setStepHints: boolean): void {\n  const conceptIds = new Set(nodes.filter((n) => n.kind === 'concept').map((n) => n.concept_ref || n.id));\n  for (const l of arr(hybrid.links)) {\n    const conceptId = str(l.concept_id);\n    const featureId = str(l.feature_id);\n    if (!conceptIds.has(conceptId)) continue;\n    const depth = str(l.depth, 'cio');\n    const firstStep = nodes.find((n) => n.feature_id === featureId);\n    if (firstStep) {\n      edges.push({ from: conceptId, to: firstStep.id, kind: 'knowledge', reason: str(l.relationship, 'hybrid link') + ' [' + depth + ']' });\n      if (setStepHints && !firstStep.depth_hint) {\n        firstStep.depth_hint = (['ulo', 'cio', 'sio'] as const).includes(depth as 'ulo') ? (depth as FeedNode['depth_hint']) : 'cio';\n      }\n    }\n  }\n}\n\nfunction emitFromKnowledge(kg: Rec, opts: EmitFeedOptions): CurriculumFeed {\n  const nodes: FeedNode[] = [];\n  const edges: FeedEdge[] = [];\n  const groupings: FeedGrouping[] = [];\n  const conceptIds = new Set(arr(kg.concepts).map((c) => str(c.id)));\n  for (const c of arr(kg.concepts)) {\n    const node = feedNodeFromConcept(c);\n    nodes.push(node);\n    for (const p of strs(c.prerequisites)) {\n      if (p !== node.id && conceptIds.has(p)) {\n        edges.push({\n          from: p,\n          to: node.id,\n          kind: 'knowledge',\n          reason: `concept prerequisite: ${p} must be understood before ${node.id}`,\n        });\n      }\n    }\n  }\n\n  // Sort nodes by learning_path order if present\n  if (arr(kg.learning_path).length > 0) {\n    const orderMap = new Map<string, number>();\n    arr(kg.learning_path).forEach((s, idx) => {\n      const cid = str(s.concept_id);\n      if (cid) orderMap.set(cid, num(s.order, idx + 1));\n    });\n    nodes.sort((a, b) => (orderMap.get(a.id) ?? 999) - (orderMap.get(b.id) ?? 999));\n  }\n\n  let ci = 0;\n  for (const cat of arr(kg.categories)) {\n    ci += 1;\n    const ids = strs(cat.concept_ids).filter((id) => nodes.some((n) => n.id === id));\n    if (ids.length > 0) {\n      groupings.push({\n        id: str(cat.id, 'cat' + ci),\n        name: str(cat.name, 'Category ' + ci),\n        node_ids: ids,\n        rationale: str(cat.description, ''),\n      });\n    }\n  }\n  newKeywordsInOrder(nodes);\n  return validateCurriculumFeed({\n    schema_version: 2,\n    source: { graph_type: 'knowledge_graph', warnings: opts.warnings ?? [], hallucination_count: opts.hallucinationCount ?? 0 },\n    learning_nodes: nodes,\n    dependency_edges: edges,\n    suggested_groupings: groupings,\n    phases: [],\n  });\n}\n\nfunction emitFromProject(pg: Rec, opts: EmitFeedOptions): CurriculumFeed {\n  const nodes: FeedNode[] = [];\n  const edges: FeedEdge[] = [];\n  const groupings: FeedGrouping[] = [];\n  arr(pg.features).forEach((f, fi) => addFeatureGroup(f, str(f.id, 'F' + pad2(fi + 1)), nodes, edges, groupings));\n  if (nodes.length === 0 && arr(pg.features).length > 0) {\n    const hasTasks = arr((pg.implementation ?? {}) as Rec).length > 0 || arr((pg.implementation as Rec | undefined)?.tasks).length > 0;\n    throw new Error(\n      'Project graph has ' + arr(pg.features).length + ' features but NO features[].steps - the curriculum feed cannot emit planning nodes.' +\n      (hasTasks\n        ? ' This looks like a legacy knowledge-tree graph (implementation.tasks). Regenerate it with the domain-kit v3 pipeline (runProjectGraphPipeline / hybridGraphPipeline), then re-run.'\n        : ' Every feature must carry at least one step with id/name/keywords/effort for curriculum planning.'),\n    );\n  }\n  newKeywordsInOrder(nodes);\n  return validateCurriculumFeed({\n    schema_version: 2,\n    source: { graph_type: 'project_graph', warnings: opts.warnings ?? [], hallucination_count: opts.hallucinationCount ?? 0 },\n    learning_nodes: nodes,\n    dependency_edges: edges,\n    suggested_groupings: groupings,\n    phases: [],\n  });\n}\n\n/** Emit a CurriculumFeed from whichever graph shape is provided (already verified upstream). */\nexport function emitCurriculumFeed(\n  graph: unknown,\n  opts: EmitFeedOptions = {},\n): CurriculumFeed {\n  const g = graph as Rec;\n  if (arr(g.learning_nodes).length > 0) {\n    return validateCurriculumFeed(g); // already a feed - pass-through validation\n  }\n  if (g.project_graph || g.knowledge_graph || arr(g.links).length > 0 || arr(g.phases).length > 0) {\n    return emitFromHybrid(g, opts);\n  }\n  if (arr(g.concepts).length > 0 || str(g.type) === 'knowledge_graph') return emitFromKnowledge(g, opts);\n  return emitFromProject(g, opts);\n}\n"]}