@tangle-network/agent-eval 0.120.1 → 0.120.2

package/dist/chunk-JM2SKQMS.js.map

@@ -1 +0,0 @@
-{"version":3,"sources":["../src/locked-jsonl-appender.ts","../src/analyst/findings-store.ts","../src/analyst/kinds/skill-usage.ts","../src/run-critic.ts","../src/semantic-concept-judge.ts"],"sourcesContent":["/**\n * LockedJsonlAppender — mutex-serialized JSONL append helper for arbitrary\n * payloads. The reference-replay store does the same thing for typed\n * `ReferenceReplayRun` rows; this is the generic version used by\n * `MutationTelemetry`, `TrialTelemetry`, and any other consumer that wants\n * append-only durable telemetry without rolling its own lock.\n *\n * Locks are per absolute file path (process-local). Cross-process\n * concurrency is NOT addressed — that's an fcntl/flock problem.\n */\n\nimport { appendFileSync, existsSync, mkdirSync } from 'node:fs'\nimport { dirname } from 'node:path'\nimport { Mutex } from './concurrency'\n\nconst mutexes = new Map<string, Mutex>()\n\nfunction getMutex(path: string): Mutex {\n  let m = mutexes.get(path)\n  if (!m) {\n    m = new Mutex()\n    mutexes.set(path, m)\n  }\n  return m\n}\n\nexport class LockedJsonlAppender {\n  private readonly mutex: Mutex\n  constructor(public readonly path: string) {\n    this.mutex = getMutex(path)\n    if (!existsSync(dirname(path))) {\n      mkdirSync(dirname(path), { recursive: true })\n    }\n  }\n\n  async append(entry: unknown): Promise<void> {\n    const line = `${JSON.stringify(entry)}\\n`\n    await this.mutex.runExclusive(() => {\n      appendFileSync(this.path, line)\n    })\n  }\n}\n\n/** Reset all internal mutex state — tests only. */\nexport function resetLockedAppendersForTesting(): void {\n  mutexes.clear()\n}\n","/**\n * FindingsStore — durable persistence for AnalystFinding rows + a diff\n * helper so we can answer \"what changed since the last run?\" without\n * recomputing analysts.\n *\n * On-disk shape is JSONL: one finding per line, append-only, locked via\n * LockedJsonlAppender. Operators get crash-safety (no partial JSON),\n * cheap reads (sequential parse), and trivial backup (rsync the file).\n *\n * Reads are non-locking: a reader sees a consistent snapshot of all\n * fully-written lines and skips an incomplete trailing line if the\n * writer is mid-append. Cross-process locking is intentionally out of\n * scope (see locked-jsonl-appender.ts).\n *\n * The store is run-scoped: callers pass `runId` on append and on load,\n * which keeps multi-run files cleanly partitioned. The `diffFindings`\n * helper compares two run-id sets using stable `finding_id` semantics —\n * the diff is the cross-run signal the regression dashboard renders.\n */\n\nimport { existsSync, readFileSync } from 'node:fs'\n\nimport { LockedJsonlAppender } from '../locked-jsonl-appender'\nimport type { AnalystFinding } from './types'\n\n/**\n * One persisted row. We attach `run_id` on disk so a single file can\n * hold multiple runs and the diff helper can query without re-walking\n * separate files.\n */\nexport interface PersistedFinding extends AnalystFinding {\n  run_id: string\n}\n\nexport class FindingsStore {\n  private readonly appender: LockedJsonlAppender\n\n  constructor(public readonly path: string) {\n    this.appender = new LockedJsonlAppender(path)\n  }\n\n  async append(runId: string, findings: AnalystFinding[]): Promise<void> {\n    for (const f of findings) {\n      const row: PersistedFinding = { ...f, run_id: runId }\n      await this.appender.append(row)\n    }\n  }\n\n  /** Load every persisted finding. Discards malformed trailing lines silently. */\n  loadAll(): PersistedFinding[] {\n    if (!existsSync(this.path)) return []\n    const raw = readFileSync(this.path, 'utf8')\n    if (!raw) return []\n    const out: PersistedFinding[] = []\n    for (const line of raw.split('\\n')) {\n      if (!line) continue\n      try {\n        out.push(JSON.parse(line) as PersistedFinding)\n      } catch {\n        // Skip torn trailing line — the lock guarantees no torn lines\n        // mid-file, only at EOF when a writer is in-flight.\n      }\n    }\n    return out\n  }\n\n  /** Filter to a single run. */\n  loadRun(runId: string): PersistedFinding[] {\n    return this.loadAll().filter((r) => r.run_id === runId)\n  }\n}\n\n// ── Cross-run diff ──────────────────────────────────────────────────\n\nexport interface FindingsDiff {\n  /** New finding ids in `current` that weren't in `previous`. */\n  appeared: PersistedFinding[]\n  /** Finding ids in `previous` that aren't in `current`. */\n  disappeared: PersistedFinding[]\n  /** Same finding id present in both runs and unchanged per the materiality test. */\n  persisted: PersistedFinding[]\n  /**\n   * Same finding id in both runs but at least one non-identity field\n   * shifted per `DiffPolicy.isMaterial`. Reported as [previous, current].\n   */\n  changed: Array<{ previous: PersistedFinding; current: PersistedFinding }>\n}\n\nexport interface DiffPolicy {\n  /**\n   * Predicate that decides whether two findings (same finding_id) count\n   * as a material change. Defaults to {@link defaultIsMaterial}: severity\n   * shift, confidence Δ > 0.05, or evidence count change. Compliance /\n   * perf consumers MAY supply a stricter predicate (e.g. rationale text\n   * diff, metric Δ thresholds).\n   */\n  isMaterial?: (previous: AnalystFinding, current: AnalystFinding) => boolean\n}\n\n/**\n * Default materiality test. Deliberately narrow so LLM-reword churn\n * doesn't flood the diff. Stricter tests are opt-in via DiffPolicy.\n */\nexport function defaultIsMaterial(a: AnalystFinding, b: AnalystFinding): boolean {\n  if (a.severity !== b.severity) return true\n  if (Math.abs((a.confidence ?? 0) - (b.confidence ?? 0)) > 0.05) return true\n  if (a.evidence_refs.length !== b.evidence_refs.length) return true\n  return false\n}\n\n/**\n * Diff two findings sets by stable finding_id. Callers typically load\n * the two run-id slices from the same store and pass them in.\n */\nexport function diffFindings(\n  previous: PersistedFinding[],\n  current: PersistedFinding[],\n  policy: DiffPolicy = {},\n): FindingsDiff {\n  const isMaterial = policy.isMaterial ?? defaultIsMaterial\n  const prevById = new Map(previous.map((f) => [f.finding_id, f]))\n  const curById = new Map(current.map((f) => [f.finding_id, f]))\n\n  const appeared: PersistedFinding[] = []\n  const disappeared: PersistedFinding[] = []\n  const persisted: PersistedFinding[] = []\n  const changed: FindingsDiff['changed'] = []\n\n  for (const [id, cur] of curById) {\n    const prev = prevById.get(id)\n    if (!prev) {\n      appeared.push(cur)\n      continue\n    }\n    if (isMaterial(prev, cur)) {\n      changed.push({ previous: prev, current: cur })\n    } else {\n      persisted.push(cur)\n    }\n  }\n  for (const [id, prev] of prevById) {\n    if (!curById.has(id)) disappeared.push(prev)\n  }\n  return { appeared, disappeared, persisted, changed }\n}\n","/**\n * Skill-usage analyst — a DETERMINISTIC `Analyst` over a Claude/Codex skill\n * library + its trace corpus. Unlike the trace-store kinds (failure-mode,\n * improvement, ...) this kind calls no LLM: it mines real usage and skill\n * structure and emits findings by rule.\n *\n * It exists because the naive \"Skill-tool invocation count\" lies low — it\n * misses orchestrated sub-dispatch (a leaf skill run BY /pursue or /governor\n * logs under the parent), slash-command entry, local-script bypass, and\n * on-disk artifacts. The 2026-05-30 skill audit found 39/53 skills at zero\n * direct invocations, yet only one was a genuine cut: the rest were\n * measurement-invisible or discovery-limited. This analyst encodes that\n * lesson as a multi-signal usage model so a cheap repeatable pass can keep\n * the library honest, and so the expensive audit workflow's verdicts can\n * GEPA-distill it toward agreement (see `gold/skill-verdicts.gold.jsonl`).\n *\n * Report-building (`buildSkillUsageReport`, an fs scan) is separated from\n * finding emission (`SkillUsageAnalyst.analyze`, pure) so the slow scan runs\n * once at the registry boundary and the rule logic stays unit-testable.\n */\n\nimport { type Dirent, existsSync, readdirSync, readFileSync, statSync } from 'node:fs'\nimport { join } from 'node:path'\nimport type { Analyst, AnalystContext, AnalystFinding, AnalystSeverity } from '../types'\nimport { computeFindingId } from '../types'\n\n// ── Input model ──────────────────────────────────────────────────────\n\nexport type SkillKind = 'public' | 'private'\n\n/** One skill's multi-signal usage + structure. All counts are deterministic. */\nexport interface SkillUsageRecord {\n  name: string\n  kind: SkillKind\n  /** Absolute path to the skill's SKILL.md. */\n  path: string\n  lines: number\n  /** `\"skill\":\"<name>\"` Skill-tool invocations across the trace corpus. */\n  directInvocations: number\n  /** `<command-name>/<name>` slash invocations across the trace corpus. */\n  slashInvocations: number\n  /** Sibling skills whose SKILL.md dispatches to this one (`/<name>`). Proxy\n   *  for orchestrated sub-dispatch the per-skill counter cannot see. */\n  inboundRefs: number\n  /** On-disk artifacts attributable to the skill (e.g. `.evolve/<name>/**`). */\n  artifactCount: number\n  /** Tangle-private reference count in the body (leak signal for public skills). */\n  tanglePrivateRefs: number\n  hasReferencesDir: boolean\n  hasEvalsDir: boolean\n  /** Body mentions `skill-runs.jsonl` (visible to /reflect + /governor). */\n  logsRuns: boolean\n  /** Description carries an explicit `Triggers:` clause / trigger phrases. */\n  hasTriggerPhrases: boolean\n}\n\nexport interface SkillUsageReport {\n  generatedFromTraces: number\n  records: SkillUsageRecord[]\n}\n\nexport interface SkillUsageScanConfig {\n  /** Dirs holding `*.jsonl` transcripts (Claude `~/.claude/projects`, Codex sessions). */\n  transcriptDirs: string[]\n  /** Skill roots to scan; each dir directly under `root` with a `SKILL.md` is a skill. */\n  skillRoots: { root: string; kind: SkillKind }[]\n  /** Roots scanned for `<root>/.evolve/<skill>` artifact dirs. */\n  artifactRoots?: string[]\n  /** Token-prefixed mappings: skill name → extra artifact subpaths under an artifactRoot\n   *  (e.g. reflect → `.evolve/reflections`). Catches non-eponymous artifact dirs. */\n  artifactAliases?: Record<string, string[]>\n  /** Cap files read per transcript dir (bounds a huge corpus); 0 = unbounded. */\n  maxTranscriptsPerDir?: number\n}\n\n// ── Deterministic thresholds ─────────────────────────────────────────\n\n/** Anthropic's authoring guidance keeps SKILL.md short; past this with no\n *  `references/` split the body burns context budget every session. */\nconst BLOAT_LINE_THRESHOLD = 300\n\nconst TANGLE_PRIVATE_RE =\n  /\\b(cli-bridge|tangletools|ops-board|drew-gtr-pro|@tangle-network\\/|~\\/company|tangle\\.tools|gtm-agent)\\b|\\bkimi\\b|\\btcloud\\b/gi\nconst TRIGGER_RE = /triggers?\\s*[:-]/i\n\n// ── Report builder (fs scan — slow, runs once at the registry boundary) ──\n\nfunction listSkillDirs(root: string): { name: string; path: string }[] {\n  if (!existsSync(root)) return []\n  const out: { name: string; path: string }[] = []\n  for (const entry of readdirSync(root, { withFileTypes: true })) {\n    if (!entry.isDirectory() && !entry.isSymbolicLink()) continue\n    const skillMd = join(root, entry.name, 'SKILL.md')\n    if (existsSync(skillMd)) out.push({ name: entry.name, path: skillMd })\n  }\n  return out\n}\n\nfunction walkJsonl(dir: string, cap: number): string[] {\n  if (!existsSync(dir)) return []\n  const files: string[] = []\n  const stack = [dir]\n  while (stack.length) {\n    const cur = stack.pop()!\n    let entries: Dirent[]\n    try {\n      entries = readdirSync(cur, { withFileTypes: true })\n    } catch {\n      continue\n    }\n    for (const e of entries) {\n      const full = join(cur, e.name)\n      if (e.isDirectory()) stack.push(full)\n      else if (e.name.endsWith('.jsonl')) {\n        files.push(full)\n        if (cap > 0 && files.length >= cap) return files\n      }\n    }\n  }\n  return files\n}\n\nfunction frontmatterDescription(body: string): string {\n  const fm = /^---\\n([\\s\\S]*?)\\n---/.exec(body)\n  const block = fm?.[1] ?? ''\n  const m = /description:\\s*(.+)/i.exec(block)\n  return m?.[1] ?? ''\n}\n\nfunction countArtifacts(roots: string[], name: string, aliases: string[]): number {\n  let n = 0\n  for (const root of roots) {\n    const candidates = [join(root, '.evolve', name), ...aliases.map((a) => join(root, a))]\n    for (const dir of candidates) {\n      if (!existsSync(dir)) continue\n      try {\n        if (statSync(dir).isDirectory()) n += readdirSync(dir).length\n        else n += 1\n      } catch {\n        /* unreadable — skip */\n      }\n    }\n  }\n  return n\n}\n\n/** Scan the corpus + skill roots into a {@link SkillUsageReport}. Deterministic. */\nexport function buildSkillUsageReport(config: SkillUsageScanConfig): SkillUsageReport {\n  const skills = config.skillRoots.flatMap(({ root, kind }) =>\n    listSkillDirs(root).map((s) => ({ ...s, kind })),\n  )\n  const names = skills.map((s) => s.name)\n\n  // One pass over the corpus accumulating direct + slash counts per skill.\n  const direct = new Map<string, number>(names.map((n) => [n, 0]))\n  const slash = new Map<string, number>(names.map((n) => [n, 0]))\n  const skillRe = /\"skill\"\\s*:\\s*\"([a-z0-9_:-]+)\"/g\n  const cmdRe = /<command-name>\\/?([a-z0-9_:-]+)<\\/command-name>/g\n  let transcripts = 0\n  for (const dir of config.transcriptDirs) {\n    for (const file of walkJsonl(dir, config.maxTranscriptsPerDir ?? 0)) {\n      transcripts += 1\n      let data: string\n      try {\n        data = readFileSync(file, 'utf8')\n      } catch {\n        continue\n      }\n      for (const m of data.matchAll(skillRe)) {\n        const g = m[1]\n        if (!g) continue\n        const n = g.split(':').pop() ?? g\n        const prev = direct.get(n)\n        if (prev !== undefined) direct.set(n, prev + 1)\n      }\n      for (const m of data.matchAll(cmdRe)) {\n        const g = m[1]\n        if (g === undefined) continue\n        const prev = slash.get(g)\n        if (prev !== undefined) slash.set(g, prev + 1)\n      }\n    }\n  }\n\n  // Read each skill body once; compute structure + inbound refs across siblings.\n  const bodies = new Map<string, string>()\n  for (const s of skills) {\n    try {\n      bodies.set(s.name, readFileSync(s.path, 'utf8'))\n    } catch {\n      bodies.set(s.name, '')\n    }\n  }\n  const inbound = new Map<string, number>(names.map((n) => [n, 0]))\n  for (const target of names) {\n    const ref = new RegExp(`/${target}\\\\b|\\\\[\\\\[${target}\\\\]\\\\]`)\n    for (const s of skills) {\n      if (s.name === target) continue\n      if (ref.test(bodies.get(s.name) ?? '')) inbound.set(target, inbound.get(target)! + 1)\n    }\n  }\n\n  const records: SkillUsageRecord[] = skills.map((s) => {\n    const body = bodies.get(s.name) ?? ''\n    const dir = s.path.replace(/\\/SKILL\\.md$/, '')\n    return {\n      name: s.name,\n      kind: s.kind,\n      path: s.path,\n      lines: body ? body.split('\\n').length : 0,\n      directInvocations: direct.get(s.name) ?? 0,\n      slashInvocations: slash.get(s.name) ?? 0,\n      inboundRefs: inbound.get(s.name) ?? 0,\n      artifactCount: countArtifacts(\n        config.artifactRoots ?? [],\n        s.name,\n        config.artifactAliases?.[s.name] ?? [],\n      ),\n      tanglePrivateRefs: (body.match(TANGLE_PRIVATE_RE) ?? []).length,\n      hasReferencesDir: existsSync(join(dir, 'references')),\n      hasEvalsDir: existsSync(join(dir, 'evals')),\n      logsRuns: body.includes('skill-runs.jsonl'),\n      hasTriggerPhrases: TRIGGER_RE.test(frontmatterDescription(body) || body.slice(0, 600)),\n    }\n  })\n  return { generatedFromTraces: transcripts, records }\n}\n\n// ── Finding emission (pure — unit-testable, no LLM, no fs) ────────────\n\nconst ANALYST_ID = 'skill-usage'\n\nfunction finding(\n  area: string,\n  subject: string,\n  claim: string,\n  severity: AnalystSeverity,\n  confidence: number,\n  producedAt: string,\n  recommended: string,\n  evidenceUri: string,\n  rationale?: string,\n): AnalystFinding {\n  return {\n    schema_version: '1.0.0',\n    finding_id: computeFindingId({ analyst_id: ANALYST_ID, area, subject, claim }),\n    analyst_id: ANALYST_ID,\n    produced_at: producedAt,\n    severity,\n    area,\n    claim,\n    rationale,\n    evidence_refs: [{ kind: 'artifact', uri: evidenceUri }],\n    recommended_action: recommended,\n    confidence,\n    subject,\n  }\n}\n\n/** Pure rule pass over a report → findings. Exported for direct/unit use. */\nexport function emitSkillUsageFindings(\n  report: SkillUsageReport,\n  producedAt: string,\n): AnalystFinding[] {\n  const out: AnalystFinding[] = []\n  for (const r of report.records) {\n    const directTotal = r.directInvocations + r.slashInvocations\n    const trueUsage = directTotal + r.inboundRefs + r.artifactCount\n\n    // 1. Dead: no usage signal of ANY kind. The only real deprecation candidate.\n    if (trueUsage === 0) {\n      out.push(\n        finding(\n          'skill-usage',\n          r.name,\n          `Skill '${r.name}' has zero usage across all signals (direct, slash, inbound-refs, artifacts)`,\n          'high',\n          0.6,\n          producedAt,\n          'Confirm the skill covers a real recurring job; if not, deprecate. Zero true usage is the only deterministic deprecation candidate.',\n          r.path,\n          'No Skill-tool call, no slash invocation, no sibling dispatches to it, and no on-disk artifacts.',\n        ),\n      )\n    } else if (directTotal === 0 && r.inboundRefs + r.artifactCount > 0) {\n      // 2. Measurement-invisible: real use via orchestration/artifacts, never invoked directly.\n      out.push(\n        finding(\n          'skill-usage',\n          r.name,\n          `Skill '${r.name}' shows 0 direct invocations but is used via orchestration/artifacts (inbound=${r.inboundRefs}, artifacts=${r.artifactCount})`,\n          'info',\n          0.8,\n          producedAt,\n          'Do NOT treat as unused — usage is real but logged under parent skills or on disk. Strengthen direct-invocation discovery only if direct use is desired.',\n          r.path,\n          'The Skill-tool counter undercounts orchestrated/chained leaf skills.',\n        ),\n      )\n    }\n\n    // 3. Discovery gap: low direct use AND weak trigger surface.\n    if (directTotal <= 2 && !r.hasTriggerPhrases) {\n      out.push(\n        finding(\n          'discoverability',\n          r.name,\n          `Skill '${r.name}' is rarely invoked directly and its description has no explicit trigger phrases`,\n          'medium',\n          0.7,\n          producedAt,\n          'Add a `Triggers:` clause with verbatim user phrases to the frontmatter description so the model auto-invokes it.',\n          r.path,\n        ),\n      )\n    }\n\n    // 4. Public-repo leak.\n    if (r.kind === 'public' && r.tanglePrivateRefs > 0) {\n      out.push(\n        finding(\n          'safety',\n          r.name,\n          `Public skill '${r.name}' carries ${r.tanglePrivateRefs} Tangle-private reference(s)`,\n          'high',\n          0.75,\n          producedAt,\n          'Sanitize incidental internal refs (cli-bridge/kimi/tcloud/~company/private repos) or relocate to a private repo. Verify @tangle-network/* refs are to PUBLISHED packages before treating as a leak.',\n          r.path,\n        ),\n      )\n    }\n\n    // 5. Bloat / no progressive disclosure.\n    if (r.lines > BLOAT_LINE_THRESHOLD && !r.hasReferencesDir) {\n      out.push(\n        finding(\n          'maintainability',\n          r.name,\n          `Skill '${r.name}' is ${r.lines} lines with no references/ split (progressive disclosure)`,\n          'medium',\n          0.8,\n          producedAt,\n          `Split detail into references/ loaded on demand; keep SKILL.md a short overview. ${r.lines} lines load into every session's context budget.`,\n          r.path,\n        ),\n      )\n    }\n\n    // 6. No evals (Anthropic's \">=3 evals before docs\" rule).\n    if (!r.hasEvalsDir) {\n      out.push(\n        finding(\n          'data-quality',\n          r.name,\n          `Skill '${r.name}' ships no evals/`,\n          'low',\n          0.6,\n          producedAt,\n          'Add evals/evals.json with >=3 scenarios proving the skill beats baseline; gives regression coverage.',\n          r.path,\n        ),\n      )\n    }\n\n    // 7. No run logging → invisible to /reflect and /governor.\n    if (!r.logsRuns) {\n      out.push(\n        finding(\n          'observability',\n          r.name,\n          `Skill '${r.name}' never appends to .evolve/skill-runs.jsonl`,\n          'low',\n          0.55,\n          producedAt,\n          'Append one run line to .evolve/skill-runs.jsonl on completion, or declare it a non-logging leaf, so the self-improvement loop can see it ran.',\n          r.path,\n        ),\n      )\n    }\n  }\n  return out\n}\n\n// ── The Analyst ──────────────────────────────────────────────────────\n\nexport class SkillUsageAnalyst implements Analyst<SkillUsageReport> {\n  readonly id = ANALYST_ID\n  readonly description =\n    'Deterministic multi-signal skill-usage analysis: flags dead skills, measurement-invisible (orchestrated) usage, discovery gaps, public-repo leaks, bloat, missing evals, and missing run-logging.'\n  readonly inputKind = 'custom' as const\n  readonly cost = { kind: 'deterministic' as const, est_usd_per_run: 0 }\n  readonly version = '1.0.0'\n\n  async analyze(input: SkillUsageReport, ctx: AnalystContext): Promise<AnalystFinding[]> {\n    const producedAt = ctx.tags?.producedAt ?? new Date().toISOString()\n    ctx.log?.(\n      `skill-usage: ${input.records.length} skills over ${input.generatedFromTraces} transcripts`,\n    )\n    return emitSkillUsageFindings(input, producedAt)\n  }\n}\n\nexport const SKILL_USAGE_ANALYST = new SkillUsageAnalyst()\n","import { NotFoundError } from './errors'\nimport { aggregateRunScore, clamp01, type RunScore, type RunScoreWeights } from './run-score'\nimport type { Artifact, BudgetLedgerEntry, Run, Span, TraceEvent, TraceStore } from './trace'\n\nexport interface RunTrace {\n  run: Run\n  spans: Span[]\n  events: TraceEvent[]\n  artifacts: Artifact[]\n  budget: BudgetLedgerEntry[]\n}\n\nexport interface RunCriticOptions {\n  weights?: Partial<RunScoreWeights>\n  driftPatterns?: RegExp[]\n}\n\nconst DEFAULT_DRIFT_PATTERNS = [\n  /https?:\\/\\//i,\n  /\\btitle:\\s/i,\n  /\\bsummary:\\s/i,\n  /\\burl:\\s/i,\n  /\\bnpm package usage\\b/i,\n  /\\bnews\\b/i,\n]\n\nexport class RunCritic {\n  private readonly weights?: Partial<RunScoreWeights>\n  private readonly driftPatterns: RegExp[]\n\n  constructor(options: RunCriticOptions = {}) {\n    this.weights = options.weights\n    this.driftPatterns = options.driftPatterns ?? DEFAULT_DRIFT_PATTERNS\n  }\n\n  async score(store: TraceStore, runId: string): Promise<RunScore> {\n    const run = await store.getRun(runId)\n    if (!run) throw new NotFoundError(`run ${runId} not found`)\n    const [spans, events, artifacts, budget] = await Promise.all([\n      store.spans({ runId }),\n      store.events({ runId }),\n      store.artifacts(runId),\n      store.budget(runId),\n    ])\n    return this.scoreTrace({ run, spans, events, artifacts, budget })\n  }\n\n  scoreTrace(trace: RunTrace): RunScore {\n    const notes: string[] = []\n    const llmSpans = trace.spans.filter(\n      (s): s is Extract<Span, { kind: 'llm' }> => s.kind === 'llm',\n    )\n    const toolSpans = trace.spans.filter(\n      (s): s is Extract<Span, { kind: 'tool' }> => s.kind === 'tool',\n    )\n    const judgeSpans = trace.spans.filter(\n      (s): s is Extract<Span, { kind: 'judge' }> => s.kind === 'judge',\n    )\n    const sandboxSpans = trace.spans.filter(\n      (s): s is Extract<Span, { kind: 'sandbox' }> => s.kind === 'sandbox',\n    )\n    const finalGateSpans = judgeSpans.filter(\n      (span) => span.dimension === 'final_gate' || span.attributes?.finalGate === true,\n    )\n\n    const success =\n      trace.run.outcome?.pass === true ? 1 : trace.run.status === 'completed' ? 0.5 : 0\n    if (!success) notes.push('run did not complete with pass=true')\n\n    const judgeAverage = judgeSpans.length\n      ? judgeSpans.reduce((sum, span) => sum + normalizeJudgeScore(span.score), 0) /\n        judgeSpans.length\n      : undefined\n    const outcomeScore =\n      typeof trace.run.outcome?.score === 'number'\n        ? clamp01(\n            trace.run.outcome.score > 1 ? trace.run.outcome.score / 100 : trace.run.outcome.score,\n          )\n        : undefined\n    const goalProgress = outcomeScore ?? judgeAverage ?? success\n\n    const successfulTools = toolSpans.filter((span) => span.status !== 'error').length\n    const toolUseQuality = toolSpans.length === 0 ? 0 : successfulTools / toolSpans.length\n    if (toolSpans.length === 0) notes.push('no tool spans recorded')\n\n    const patchEvidence =\n      trace.artifacts.length +\n      toolSpans.filter((span) => /write|edit|patch|apply/i.test(span.toolName)).length\n    const patchQuality = patchEvidence > 0 ? clamp01(patchEvidence / 4) : 0\n    if (!patchQuality) notes.push('no artifact or edit evidence recorded')\n\n    const sandboxTests = sandboxSpans.filter(\n      (span) => typeof span.testsTotal === 'number' && span.testsTotal > 0,\n    )\n    const testReality = sandboxTests.length\n      ? sandboxTests.reduce(\n          (sum, span) => sum + (span.testsPassed ?? 0) / Math.max(1, span.testsTotal ?? 1),\n          0,\n        ) / sandboxTests.length\n      : toolSpans.some((span) =>\n            /\\btest|vitest|pytest|jest|build|tsc\\b/i.test(JSON.stringify(span.args)),\n          )\n        ? 0.4\n        : 0\n    if (!testReality) notes.push('no real test/build evidence recorded')\n\n    const blockerSpans = judgeSpans.filter((span) => isBlockingJudge(span))\n    const finalGateBlockers = finalGateSpans.filter((span) => isBlockingJudge(span))\n    const finalGate = finalGateSpans.length ? (finalGateBlockers.length ? 0 : 1) : success\n    if (finalGateBlockers.length)\n      notes.push(`final gate blocked by ${finalGateBlockers.length} reviewer(s)`)\n    else if (!finalGateSpans.length) notes.push('no final gate judgment recorded')\n\n    const reviewerBlockers = judgeSpans.length ? blockerSpans.length / judgeSpans.length : 0\n    if (reviewerBlockers) notes.push(`detected ${blockerSpans.length} blocking reviewer signal(s)`)\n\n    const positiveGroundingSignals =\n      patchEvidence +\n      sandboxSpans.length +\n      llmSpans.filter((span) => looksRepoGrounded(span.output ?? '')).length\n    const driftSignals =\n      llmSpans.filter((span) => this.isDrift(span.output ?? '')).length +\n      trace.events.filter((event) => this.isDrift(JSON.stringify(event.payload))).length\n    const repoGroundedness =\n      positiveGroundingSignals + driftSignals === 0\n        ? 0\n        : positiveGroundingSignals / (positiveGroundingSignals + driftSignals)\n    const driftPenalty =\n      positiveGroundingSignals + driftSignals === 0\n        ? 0\n        : driftSignals / (positiveGroundingSignals + driftSignals)\n    if (driftSignals > 0) notes.push(`detected ${driftSignals} drift signal(s)`)\n\n    const costUsd = trace.budget.length\n      ? Math.max(\n          ...trace.budget\n            .filter((entry: BudgetLedgerEntry) => entry.dimension === 'usd')\n            .map((entry: BudgetLedgerEntry) => entry.consumed),\n          0,\n        )\n      : llmSpans.reduce((sum, span) => sum + (span.costUsd ?? 0), 0)\n    const wallSeconds =\n      trace.run.endedAt && trace.run.startedAt\n        ? Math.max(0, (trace.run.endedAt - trace.run.startedAt) / 1000)\n        : 0\n\n    return {\n      success,\n      goalProgress,\n      repoGroundedness,\n      driftPenalty,\n      toolUseQuality,\n      patchQuality,\n      testReality,\n      finalGate,\n      reviewerBlockers,\n      costUsd,\n      wallSeconds,\n      notes,\n    }\n  }\n\n  rank(score: RunScore): number {\n    return aggregateRunScore(score, this.weights)\n  }\n\n  private isDrift(text: string): boolean {\n    return this.driftPatterns.some((pattern) => pattern.test(text))\n  }\n}\n\nfunction normalizeJudgeScore(score: number): number {\n  return score > 1 ? clamp01(score / 10) : clamp01(score)\n}\n\nfunction looksRepoGrounded(text: string): boolean {\n  return /(?:src\\/|tests?\\/|package\\.json|tsconfig|\\.ts\\b|\\.tsx\\b|git status|pnpm |npm |vitest|pytest|jest)/i.test(\n    text,\n  )\n}\n\nfunction isBlockingJudge(span: Extract<Span, { kind: 'judge' }>): boolean {\n  return (\n    span.attributes?.blocking === true ||\n    span.attributes?.verdict === 'BLOCKING' ||\n    positiveNumber(span.attributes?.blockingFindings) ||\n    positiveNumber(span.attributes?.highFindings) ||\n    span.score <= 2\n  )\n}\n\nfunction positiveNumber(value: unknown): boolean {\n  return typeof value === 'number' && value > 0\n}\n","/**\n * Semantic concept judge — \"does the built artifact actually implement\n * the features the user asked for?\"\n *\n * Distinct from the domain/code/coherence judges in `judges.ts`:\n *   - those judges score free-form conversational agent outputs along\n *     quality dimensions (accuracy, depth, etc.)\n *   - this judge scores a *built artifact* (served HTML + source files)\n *     against an explicit list of expected concepts, returning per-concept\n *     {present, score 0-10, evidence, severity}.\n *\n * The judge is strict about distinguishing (a) a working implementation\n * from (b) a keyword-present stub. \"// TODO: mint button\" is NOT present.\n * Only real, functional, wired-up code counts.\n *\n * Use via {@link createSemanticConceptJudge} or directly via\n * {@link runSemanticConceptJudge}. Soft-fails (available=false) on LLM\n * or JSON-parse errors so the caller can treat that as \"layer skipped\"\n * rather than \"layer failed\" in a multi-layer pipeline.\n */\n\nimport { CostLedger, type CostLedgerHandle, type CostReceipt } from './cost-ledger'\nimport {\n  callLlmJson,\n  costReceiptFromLlm,\n  costReceiptFromLlmError,\n  type LlmCallRequest,\n  type LlmClientOptions,\n  maximumChargeForLlmRequest,\n} from './llm-client'\nimport type { Severity } from './multi-layer-verifier'\n\n// ─── Types ──────────────────────────────────────────────────────────────\n\n/**\n * Implementation complexity class for weighted scoring.\n *\n * - `render` (default): the concept is a UI surface that displays static\n *   data — render a list, show a counter, lay out a button. Single-file\n *   work, no external integration.\n * - `integrate`: the concept requires wiring a real external system —\n *   wallet connect (wagmi + RainbowKit + chain config), payment provider\n *   (Stripe Elements + intent + webhook), an API client with auth.\n *   Multi-file, library-knowledge, runtime correctness matters.\n * - `compute`: the concept requires algorithmic work — solver, simulator,\n *   constraint propagation, ML inference. Correctness > UI polish.\n *\n * Default weights (when applied via `weightConcepts: 'complexity'`):\n *   render=1.0, integrate=2.0, compute=2.5\n *\n * Cross-vertical scoring without complexity weighting silently inflates\n * the rate of UI-heavy verticals (healthcare, fintech dashboards) vs\n * integration-heavy verticals (DeFi, wallets) — all concepts treated\n * equally even though the agent does 2-3x the work for `integrate`.\n */\nexport type ConceptComplexity = 'render' | 'integrate' | 'compute'\n\nexport interface ConceptSpec {\n  name: string\n  /** Short hints that help the judge; not used for matching. */\n  keywords?: string[]\n  /** Optional explicit weight; default 1.0. Overrides complexity-derived weight. */\n  weight?: number\n  /** Implementation complexity class. Default `render`. */\n  complexity?: ConceptComplexity\n}\n\nexport interface ConceptFinding {\n  concept: string\n  present: boolean\n  /** 0..10. 10 = production-ready; 7 = functional thin; 4 = partial; 0 = absent. */\n  score: number\n  evidence: string\n  severity: Severity\n}\n\nexport interface SemanticConceptJudgeInput {\n  /** Full natural-language prompt the agent was handed. */\n  userRequest: string\n  /** Rendered HTML the preview returns (UI artifacts). Optional. */\n  servedHtml?: string\n  /** Top-level source files from the agent's workdir. */\n  sourceFiles: Array<{ path: string; content: string }>\n  /** The expected concept list. */\n  expectedConcepts: ConceptSpec[]\n  /** Free-form metadata (id, difficulty) to inject into the prompt. */\n  artifactLabel?: string\n  artifactDescription?: string\n}\n\nexport interface SemanticConceptJudgeResult {\n  kind: 'semantic-concept'\n  version: string\n  /** Normalized 0..1 score — mean of per-concept scores / 10. */\n  score: number\n  presentCount: number\n  totalCount: number\n  findings: ConceptFinding[]\n  summary: string\n  durationMs: number\n  costUsd: number | null\n  /** False on LLM/JSON error — treat as \"skipped / unable to judge\" in pipelines. */\n  available: boolean\n  error?: string\n}\n\n/**\n * Score-aggregation strategy. `mean` averages 0-10 scores uniformly.\n * `complexity` applies the default weight table (render=1, integrate=2,\n * compute=2.5) unless a concept has an explicit `weight`. `explicit`\n * honors only `weight` (defaulting to 1 for unspecified).\n */\nexport type ConceptWeightStrategy = 'mean' | 'complexity' | 'explicit'\n\nexport const DEFAULT_COMPLEXITY_WEIGHTS: Record<ConceptComplexity, number> = {\n  render: 1.0,\n  integrate: 2.0,\n  compute: 2.5,\n}\n\nexport interface SemanticConceptJudgeOptions {\n  /** Model id to call. Default 'claude-sonnet-4-6' via agent-eval defaults. */\n  model?: string\n  /** Per-call timeout. Default 300s. */\n  timeoutMs?: number\n  /** Provider-enforced output limit. Default 16000. */\n  maxTokens?: number\n  /** Pipeline budget for the prompt (source blob truncation). Default 45000. */\n  maxSourceChars?: number\n  /** Per-file cap before inclusion. Default 20000. */\n  maxPerFileChars?: number\n  /** HTML cap. Default 30000. */\n  maxHtmlChars?: number\n  /** LlmClient config (baseUrl, apiKey, authHeader, …). */\n  llm?: LlmClientOptions\n  costLedger?: CostLedgerHandle\n  costPhase?: string\n  signal?: AbortSignal\n  /**\n   * Score aggregation strategy. Default `mean` — uniform average across\n   * concepts. Cross-vertical comparisons should use `complexity` to\n   * neutralize the integrate-vs-render asymmetry.\n   */\n  weightConcepts?: ConceptWeightStrategy\n  /** Override the default complexity → weight table. */\n  complexityWeights?: Partial<Record<ConceptComplexity, number>>\n}\n\n// ─── Prompt assembly ────────────────────────────────────────────────────\n\nexport const SEMANTIC_CONCEPT_JUDGE_VERSION = 'semantic-concept-judge-v1-2026-04-24'\n\nconst DEFAULT_MAX_SOURCE = 45_000\nconst DEFAULT_MAX_HTML = 30_000\nconst DEFAULT_MAX_PER_FILE = 20_000\nconst DEFAULT_TIMEOUT = 300_000\nconst DEFAULT_MAX_TOKENS = 16_000\nconst DEFAULT_MODEL = 'claude-sonnet-4-6'\n\nconst SEMANTIC_SCHEMA = {\n  type: 'object',\n  additionalProperties: false,\n  required: ['summary', 'concepts'],\n  properties: {\n    summary: { type: 'string', minLength: 20, maxLength: 600 },\n    concepts: {\n      type: 'array',\n      minItems: 1,\n      items: {\n        type: 'object',\n        additionalProperties: false,\n        required: ['concept', 'present', 'score', 'evidence', 'severity'],\n        properties: {\n          concept: { type: 'string', minLength: 1, maxLength: 120 },\n          present: { type: 'boolean' },\n          score: { type: 'number', minimum: 0, maximum: 10 },\n          evidence: { type: 'string', minLength: 5, maxLength: 400 },\n          severity: { type: 'string', enum: ['critical', 'major', 'minor', 'info'] },\n        },\n      },\n    },\n  },\n}\n\nfunction truncate(body: string, cap: number, label: string): string {\n  if (body.length <= cap) return body\n  return `${body.slice(0, cap)}\\n… [truncated ${body.length - cap} chars of ${label}]`\n}\n\nfunction buildPrompt(\n  input: SemanticConceptJudgeInput,\n  opts: Required<SemanticConceptJudgeOptions>,\n): string {\n  const sourceBlob = input.sourceFiles\n    .filter((f) => f.content.length <= opts.maxPerFileChars)\n    .map((f) => `--- FILE: ${f.path} ---\\n${f.content}`)\n    .join('\\n\\n')\n\n  const html = input.servedHtml ?? ''\n\n  return `You are a strict code-review judge evaluating whether an agent's 0-to-1 build actually implements the features the user asked for.\n\nYou MUST distinguish:\n  (a) WORKING code that implements the concept (rendered UI, wired handler, real API call),\n  (b) KEYWORD-PRESENT stub (comments mentioning the concept, variable names, TODOs),\n  (c) ABSENT (concept nowhere).\n\nA comment like \"// TODO: add mint button\" is NOT present — score 2-3. Only count a concept as present if there is real functional code: a rendered component, a call handler wired to state or a network call, a computed value actually used.\n\nUSER REQUEST (what the agent was asked to build):\n${input.userRequest}\n\n${input.artifactLabel ? `ARTIFACT METADATA:\\n  name: ${input.artifactLabel}\\n  description: ${input.artifactDescription ?? ''}\\n\\n` : ''}EXPECTED CONCEPTS (each must be graded independently):\n${input.expectedConcepts\n  .map(\n    (c, i) =>\n      `  ${i + 1}. \"${c.name}\"${c.keywords?.length ? ` — hints: [${c.keywords.slice(0, 6).join(' | ')}]` : ''}`,\n  )\n  .join('\\n')}\n\n${html ? `SERVED HTML (what the preview returns when hit):\\n${truncate(html, opts.maxHtmlChars, 'HTML')}\\n\\n` : ''}SOURCE FILES (the agent's workdir):\n${truncate(sourceBlob, opts.maxSourceChars, 'source')}\n\nFor EACH concept, return:\n  - concept: the concept name as given (match exactly)\n  - present: boolean — does a working implementation exist?\n  - score: 0-10 — 10 = production-ready; 7 = functional but thin; 4 = partial/stubbed; 2 = keyword-only comment; 0 = absent\n  - evidence: cite \"<file>:<line>\" or \"served-html:<selector>\" pointing at the strongest supporting code. If the concept is absent or stubbed, explain what's missing.\n  - severity:\n      \"info\" when present: true AND score >= 7\n      \"minor\" when present: true AND 4 <= score < 7\n      \"major\" when present: false OR score < 4\n      \"critical\" when the concept is not only absent but a core user flow depends on it\n\nAlso produce a \"summary\" (one sentence, 20-600 chars): overall verdict on whether this is a shippable implementation of the user request vs a keyword-dense placeholder.\n\nBE SKEPTICAL. Keyword matching already passed — your job is to catch what keyword matching misses. If the agent shipped a working build, say so. If it shipped a stub, say so. Don't grade on effort.\n\nReturn STRICT JSON. No prose outside the JSON.`\n}\n\n// ─── Runner ─────────────────────────────────────────────────────────────\n\n/**\n * Run the semantic concept judge. Soft-fails to available=false on\n * LLM/JSON errors — callers in a MultiLayerVerifier pipeline can treat\n * that as \"skip\" rather than \"fail.\"\n */\nexport async function runSemanticConceptJudge(\n  input: SemanticConceptJudgeInput,\n  options: SemanticConceptJudgeOptions = {},\n): Promise<SemanticConceptJudgeResult> {\n  const start = Date.now()\n  const totalCount = input.expectedConcepts.length\n\n  if (totalCount === 0) {\n    return {\n      kind: 'semantic-concept',\n      version: SEMANTIC_CONCEPT_JUDGE_VERSION,\n      score: 0,\n      presentCount: 0,\n      totalCount: 0,\n      findings: [],\n      summary: 'no expected concepts declared',\n      durationMs: 0,\n      costUsd: null,\n      available: false,\n      error: 'no expected concepts declared',\n    }\n  }\n\n  const opts: Required<SemanticConceptJudgeOptions> = {\n    model: options.model ?? DEFAULT_MODEL,\n    timeoutMs: options.timeoutMs ?? DEFAULT_TIMEOUT,\n    maxTokens: options.maxTokens ?? DEFAULT_MAX_TOKENS,\n    maxSourceChars: options.maxSourceChars ?? DEFAULT_MAX_SOURCE,\n    maxPerFileChars: options.maxPerFileChars ?? DEFAULT_MAX_PER_FILE,\n    maxHtmlChars: options.maxHtmlChars ?? DEFAULT_MAX_HTML,\n    llm: options.llm ?? {},\n    costLedger: options.costLedger ?? new CostLedger(),\n    costPhase: options.costPhase ?? 'judge.semantic-concept',\n    signal: options.signal ?? new AbortController().signal,\n    weightConcepts: options.weightConcepts ?? 'mean',\n    complexityWeights: { ...DEFAULT_COMPLEXITY_WEIGHTS, ...(options.complexityWeights ?? {}) },\n  }\n\n  // Build a name → weight map for aggregation. Mean strategy keeps every\n  // weight at 1 (uniform average). Complexity strategy reads the table\n  // and lets an explicit `weight` override. Explicit strategy uses ONLY\n  // the spec's `weight` (defaulting to 1).\n  const weightForConcept = (spec: ConceptSpec): number => {\n    if (opts.weightConcepts === 'mean') return 1\n    if (spec.weight != null) return spec.weight\n    if (opts.weightConcepts === 'complexity') {\n      return opts.complexityWeights[spec.complexity ?? 'render'] ?? 1\n    }\n    return 1\n  }\n  const weightByName = new Map<string, number>(\n    input.expectedConcepts.map((c) => [c.name, weightForConcept(c)]),\n  )\n\n  let receipt: CostReceipt | undefined\n  try {\n    const request = {\n      model: opts.model,\n      messages: [\n        {\n          role: 'system' as const,\n          content:\n            'You are a strict code-review judge. Return strict JSON only. No prose outside the JSON. A keyword in a comment is NOT a working implementation.',\n        },\n        { role: 'user' as const, content: buildPrompt(input, opts) },\n      ],\n      jsonSchema: { name: 'semantic_concept_judge', schema: SEMANTIC_SCHEMA },\n      temperature: 0,\n      maxTokens: opts.maxTokens,\n      timeoutMs: opts.timeoutMs,\n    } satisfies LlmCallRequest\n    const paid = await opts.costLedger.runPaidCall({\n      channel: 'judge',\n      phase: opts.costPhase,\n      actor: 'semantic-concept',\n      model: opts.model,\n      maximumCharge: maximumChargeForLlmRequest(request, opts.llm),\n      signal: opts.signal,\n      execute: (signal, callId) =>\n        callLlmJson<{ summary: string; concepts: ConceptFinding[] }>(request, {\n          ...opts.llm,\n          signal,\n          idempotencyKey: callId,\n        }),\n      receipt: ({ result }) => costReceiptFromLlm(result),\n      receiptFromError: costReceiptFromLlmError,\n    })\n    receipt = paid.receipt\n    if (!paid.succeeded) throw paid.error\n    const { value } = paid.value\n\n    if (!value?.concepts || !Array.isArray(value.concepts)) {\n      throw new Error('judge returned malformed response — expected array under \"concepts\"')\n    }\n\n    const findings: ConceptFinding[] = value.concepts.map((c) => ({\n      concept: String(c.concept),\n      present: Boolean(c.present),\n      score: Math.max(0, Math.min(10, Number(c.score ?? 0))),\n      evidence: String(c.evidence ?? ''),\n      severity: (['critical', 'major', 'minor', 'info'] as const).includes(c.severity)\n        ? c.severity\n        : 'info',\n    }))\n\n    const presentCount = findings.filter((f) => f.present && f.score >= 7).length\n    let weightSum = 0\n    let weightedScoreSum = 0\n    for (const f of findings) {\n      const w = weightByName.get(f.concept) ?? 1\n      weightSum += w\n      weightedScoreSum += w * f.score\n    }\n    const scoreAvg =\n      weightSum > 0\n        ? weightedScoreSum / weightSum\n        : findings.reduce((a, f) => a + f.score, 0) / Math.max(1, findings.length)\n\n    return {\n      kind: 'semantic-concept',\n      version: SEMANTIC_CONCEPT_JUDGE_VERSION,\n      score: Number((scoreAvg / 10).toFixed(3)),\n      presentCount,\n      totalCount,\n      findings,\n      summary: String(value.summary ?? ''),\n      durationMs: Date.now() - start,\n      costUsd: paid.receipt.costUnknown ? null : paid.receipt.costUsd,\n      available: true,\n    }\n  } catch (err) {\n    return {\n      kind: 'semantic-concept',\n      version: SEMANTIC_CONCEPT_JUDGE_VERSION,\n      score: 0,\n      presentCount: 0,\n      totalCount,\n      findings: [],\n      summary: '',\n      durationMs: Date.now() - start,\n      costUsd: receipt && !receipt.costUnknown ? receipt.costUsd : null,\n      available: false,\n      error: err instanceof Error ? err.message : String(err),\n    }\n  }\n}\n\n/**\n * Factory: pin LLM options once, return a closure that accepts inputs.\n * Convenient for pipelines that want to share a single LlmClient config.\n */\nexport function createSemanticConceptJudge(\n  options: SemanticConceptJudgeOptions = {},\n): (input: SemanticConceptJudgeInput) => Promise<SemanticConceptJudgeResult> {\n  return (input) => runSemanticConceptJudge(input, options)\n}\n"],"mappings":";;;;;;;;;;;;;;;;;;;;;;AAWA,SAAS,gBAAgB,YAAY,iBAAiB;AACtD,SAAS,eAAe;AAGxB,IAAM,UAAU,oBAAI,IAAmB;AAEvC,SAAS,SAAS,MAAqB;AACrC,MAAI,IAAI,QAAQ,IAAI,IAAI;AACxB,MAAI,CAAC,GAAG;AACN,QAAI,IAAI,MAAM;AACd,YAAQ,IAAI,MAAM,CAAC;AAAA,EACrB;AACA,SAAO;AACT;AAEO,IAAM,sBAAN,MAA0B;AAAA,EAE/B,YAA4B,MAAc;AAAd;AAC1B,SAAK,QAAQ,SAAS,IAAI;AAC1B,QAAI,CAAC,WAAW,QAAQ,IAAI,CAAC,GAAG;AAC9B,gBAAU,QAAQ,IAAI,GAAG,EAAE,WAAW,KAAK,CAAC;AAAA,IAC9C;AAAA,EACF;AAAA,EAL4B;AAAA,EADX;AAAA,EAQjB,MAAM,OAAO,OAA+B;AAC1C,UAAM,OAAO,GAAG,KAAK,UAAU,KAAK,CAAC;AAAA;AACrC,UAAM,KAAK,MAAM,aAAa,MAAM;AAClC,qBAAe,KAAK,MAAM,IAAI;AAAA,IAChC,CAAC;AAAA,EACH;AACF;;;ACrBA,SAAS,cAAAA,aAAY,oBAAoB;AAclC,IAAM,gBAAN,MAAoB;AAAA,EAGzB,YAA4B,MAAc;AAAd;AAC1B,SAAK,WAAW,IAAI,oBAAoB,IAAI;AAAA,EAC9C;AAAA,EAF4B;AAAA,EAFX;AAAA,EAMjB,MAAM,OAAO,OAAe,UAA2C;AACrE,eAAW,KAAK,UAAU;AACxB,YAAM,MAAwB,EAAE,GAAG,GAAG,QAAQ,MAAM;AACpD,YAAM,KAAK,SAAS,OAAO,GAAG;AAAA,IAChC;AAAA,EACF;AAAA;AAAA,EAGA,UAA8B;AAC5B,QAAI,CAACC,YAAW,KAAK,IAAI,EAAG,QAAO,CAAC;AACpC,UAAM,MAAM,aAAa,KAAK,MAAM,MAAM;AAC1C,QAAI,CAAC,IAAK,QAAO,CAAC;AAClB,UAAM,MAA0B,CAAC;AACjC,eAAW,QAAQ,IAAI,MAAM,IAAI,GAAG;AAClC,UAAI,CAAC,KAAM;AACX,UAAI;AACF,YAAI,KAAK,KAAK,MAAM,IAAI,CAAqB;AAAA,MAC/C,QAAQ;AAAA,MAGR;AAAA,IACF;AACA,WAAO;AAAA,EACT;AAAA;AAAA,EAGA,QAAQ,OAAmC;AACzC,WAAO,KAAK,QAAQ,EAAE,OAAO,CAAC,MAAM,EAAE,WAAW,KAAK;AAAA,EACxD;AACF;AAiCO,SAAS,kBAAkB,GAAmB,GAA4B;AAC/E,MAAI,EAAE,aAAa,EAAE,SAAU,QAAO;AACtC,MAAI,KAAK,KAAK,EAAE,cAAc,MAAM,EAAE,cAAc,EAAE,IAAI,KAAM,QAAO;AACvE,MAAI,EAAE,cAAc,WAAW,EAAE,cAAc,OAAQ,QAAO;AAC9D,SAAO;AACT;AAMO,SAAS,aACd,UACA,SACA,SAAqB,CAAC,GACR;AACd,QAAM,aAAa,OAAO,cAAc;AACxC,QAAM,WAAW,IAAI,IAAI,SAAS,IAAI,CAAC,MAAM,CAAC,EAAE,YAAY,CAAC,CAAC,CAAC;AAC/D,QAAM,UAAU,IAAI,IAAI,QAAQ,IAAI,CAAC,MAAM,CAAC,EAAE,YAAY,CAAC,CAAC,CAAC;AAE7D,QAAM,WAA+B,CAAC;AACtC,QAAM,cAAkC,CAAC;AACzC,QAAM,YAAgC,CAAC;AACvC,QAAM,UAAmC,CAAC;AAE1C,aAAW,CAAC,IAAI,GAAG,KAAK,SAAS;AAC/B,UAAM,OAAO,SAAS,IAAI,EAAE;AAC5B,QAAI,CAAC,MAAM;AACT,eAAS,KAAK,GAAG;AACjB;AAAA,IACF;AACA,QAAI,WAAW,MAAM,GAAG,GAAG;AACzB,cAAQ,KAAK,EAAE,UAAU,MAAM,SAAS,IAAI,CAAC;AAAA,IAC/C,OAAO;AACL,gBAAU,KAAK,GAAG;AAAA,IACpB;AAAA,EACF;AACA,aAAW,CAAC,IAAI,IAAI,KAAK,UAAU;AACjC,QAAI,CAAC,QAAQ,IAAI,EAAE,EAAG,aAAY,KAAK,IAAI;AAAA,EAC7C;AACA,SAAO,EAAE,UAAU,aAAa,WAAW,QAAQ;AACrD;;;AC3HA,SAAsB,cAAAC,aAAY,aAAa,gBAAAC,eAAc,gBAAgB;AAC7E,SAAS,YAAY;AAyDrB,IAAM,uBAAuB;AAE7B,IAAM,oBACJ;AACF,IAAM,aAAa;AAInB,SAAS,cAAc,MAAgD;AACrE,MAAI,CAACC,YAAW,IAAI,EAAG,QAAO,CAAC;AAC/B,QAAM,MAAwC,CAAC;AAC/C,aAAW,SAAS,YAAY,MAAM,EAAE,eAAe,KAAK,CAAC,GAAG;AAC9D,QAAI,CAAC,MAAM,YAAY,KAAK,CAAC,MAAM,eAAe,EAAG;AACrD,UAAM,UAAU,KAAK,MAAM,MAAM,MAAM,UAAU;AACjD,QAAIA,YAAW,OAAO,EAAG,KAAI,KAAK,EAAE,MAAM,MAAM,MAAM,MAAM,QAAQ,CAAC;AAAA,EACvE;AACA,SAAO;AACT;AAEA,SAAS,UAAU,KAAa,KAAuB;AACrD,MAAI,CAACA,YAAW,GAAG,EAAG,QAAO,CAAC;AAC9B,QAAM,QAAkB,CAAC;AACzB,QAAM,QAAQ,CAAC,GAAG;AAClB,SAAO,MAAM,QAAQ;AACnB,UAAM,MAAM,MAAM,IAAI;AACtB,QAAI;AACJ,QAAI;AACF,gBAAU,YAAY,KAAK,EAAE,eAAe,KAAK,CAAC;AAAA,IACpD,QAAQ;AACN;AAAA,IACF;AACA,eAAW,KAAK,SAAS;AACvB,YAAM,OAAO,KAAK,KAAK,EAAE,IAAI;AAC7B,UAAI,EAAE,YAAY,EAAG,OAAM,KAAK,IAAI;AAAA,eAC3B,EAAE,KAAK,SAAS,QAAQ,GAAG;AAClC,cAAM,KAAK,IAAI;AACf,YAAI,MAAM,KAAK,MAAM,UAAU,IAAK,QAAO;AAAA,MAC7C;AAAA,IACF;AAAA,EACF;AACA,SAAO;AACT;AAEA,SAAS,uBAAuB,MAAsB;AACpD,QAAM,KAAK,wBAAwB,KAAK,IAAI;AAC5C,QAAM,QAAQ,KAAK,CAAC,KAAK;AACzB,QAAM,IAAI,uBAAuB,KAAK,KAAK;AAC3C,SAAO,IAAI,CAAC,KAAK;AACnB;AAEA,SAAS,eAAe,OAAiB,MAAc,SAA2B;AAChF,MAAI,IAAI;AACR,aAAW,QAAQ,OAAO;AACxB,UAAM,aAAa,CAAC,KAAK,MAAM,WAAW,IAAI,GAAG,GAAG,QAAQ,IAAI,CAAC,MAAM,KAAK,MAAM,CAAC,CAAC,CAAC;AACrF,eAAW,OAAO,YAAY;AAC5B,UAAI,CAACA,YAAW,GAAG,EAAG;AACtB,UAAI;AACF,YAAI,SAAS,GAAG,EAAE,YAAY,EAAG,MAAK,YAAY,GAAG,EAAE;AAAA,YAClD,MAAK;AAAA,MACZ,QAAQ;AAAA,MAER;AAAA,IACF;AAAA,EACF;AACA,SAAO;AACT;AAGO,SAAS,sBAAsB,QAAgD;AACpF,QAAM,SAAS,OAAO,WAAW;AAAA,IAAQ,CAAC,EAAE,MAAM,KAAK,MACrD,cAAc,IAAI,EAAE,IAAI,CAAC,OAAO,EAAE,GAAG,GAAG,KAAK,EAAE;AAAA,EACjD;AACA,QAAM,QAAQ,OAAO,IAAI,CAAC,MAAM,EAAE,IAAI;AAGtC,QAAM,SAAS,IAAI,IAAoB,MAAM,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC;AAC/D,QAAM,QAAQ,IAAI,IAAoB,MAAM,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC;AAC9D,QAAM,UAAU;AAChB,QAAM,QAAQ;AACd,MAAI,cAAc;AAClB,aAAW,OAAO,OAAO,gBAAgB;AACvC,eAAW,QAAQ,UAAU,KAAK,OAAO,wBAAwB,CAAC,GAAG;AACnE,qBAAe;AACf,UAAI;AACJ,UAAI;AACF,eAAOC,cAAa,MAAM,MAAM;AAAA,MAClC,QAAQ;AACN;AAAA,MACF;AACA,iBAAW,KAAK,KAAK,SAAS,OAAO,GAAG;AACtC,cAAM,IAAI,EAAE,CAAC;AACb,YAAI,CAAC,EAAG;AACR,cAAM,IAAI,EAAE,MAAM,GAAG,EAAE,IAAI,KAAK;AAChC,cAAM,OAAO,OAAO,IAAI,CAAC;AACzB,YAAI,SAAS,OAAW,QAAO,IAAI,GAAG,OAAO,CAAC;AAAA,MAChD;AACA,iBAAW,KAAK,KAAK,SAAS,KAAK,GAAG;AACpC,cAAM,IAAI,EAAE,CAAC;AACb,YAAI,MAAM,OAAW;AACrB,cAAM,OAAO,MAAM,IAAI,CAAC;AACxB,YAAI,SAAS,OAAW,OAAM,IAAI,GAAG,OAAO,CAAC;AAAA,MAC/C;AAAA,IACF;AAAA,EACF;AAGA,QAAM,SAAS,oBAAI,IAAoB;AACvC,aAAW,KAAK,QAAQ;AACtB,QAAI;AACF,aAAO,IAAI,EAAE,MAAMA,cAAa,EAAE,MAAM,MAAM,CAAC;AAAA,IACjD,QAAQ;AACN,aAAO,IAAI,EAAE,MAAM,EAAE;AAAA,IACvB;AAAA,EACF;AACA,QAAM,UAAU,IAAI,IAAoB,MAAM,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC;AAChE,aAAW,UAAU,OAAO;AAC1B,UAAM,MAAM,IAAI,OAAO,IAAI,MAAM,aAAa,MAAM,QAAQ;AAC5D,eAAW,KAAK,QAAQ;AACtB,UAAI,EAAE,SAAS,OAAQ;AACvB,UAAI,IAAI,KAAK,OAAO,IAAI,EAAE,IAAI,KAAK,EAAE,EAAG,SAAQ,IAAI,QAAQ,QAAQ,IAAI,MAAM,IAAK,CAAC;AAAA,IACtF;AAAA,EACF;AAEA,QAAM,UAA8B,OAAO,IAAI,CAAC,MAAM;AACpD,UAAM,OAAO,OAAO,IAAI,EAAE,IAAI,KAAK;AACnC,UAAM,MAAM,EAAE,KAAK,QAAQ,gBAAgB,EAAE;AAC7C,WAAO;AAAA,MACL,MAAM,EAAE;AAAA,MACR,MAAM,EAAE;AAAA,MACR,MAAM,EAAE;AAAA,MACR,OAAO,OAAO,KAAK,MAAM,IAAI,EAAE,SAAS;AAAA,MACxC,mBAAmB,OAAO,IAAI,EAAE,IAAI,KAAK;AAAA,MACzC,kBAAkB,MAAM,IAAI,EAAE,IAAI,KAAK;AAAA,MACvC,aAAa,QAAQ,IAAI,EAAE,IAAI,KAAK;AAAA,MACpC,eAAe;AAAA,QACb,OAAO,iBAAiB,CAAC;AAAA,QACzB,EAAE;AAAA,QACF,OAAO,kBAAkB,EAAE,IAAI,KAAK,CAAC;AAAA,MACvC;AAAA,MACA,oBAAoB,KAAK,MAAM,iBAAiB,KAAK,CAAC,GAAG;AAAA,MACzD,kBAAkBD,YAAW,KAAK,KAAK,YAAY,CAAC;AAAA,MACpD,aAAaA,YAAW,KAAK,KAAK,OAAO,CAAC;AAAA,MAC1C,UAAU,KAAK,SAAS,kBAAkB;AAAA,MAC1C,mBAAmB,WAAW,KAAK,uBAAuB,IAAI,KAAK,KAAK,MAAM,GAAG,GAAG,CAAC;AAAA,IACvF;AAAA,EACF,CAAC;AACD,SAAO,EAAE,qBAAqB,aAAa,QAAQ;AACrD;AAIA,IAAM,aAAa;AAEnB,SAAS,QACP,MACA,SACA,OACA,UACA,YACA,YACA,aACA,aACA,WACgB;AAChB,SAAO;AAAA,IACL,gBAAgB;AAAA,IAChB,YAAY,iBAAiB,EAAE,YAAY,YAAY,MAAM,SAAS,MAAM,CAAC;AAAA,IAC7E,YAAY;AAAA,IACZ,aAAa;AAAA,IACb;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA,eAAe,CAAC,EAAE,MAAM,YAAY,KAAK,YAAY,CAAC;AAAA,IACtD,oBAAoB;AAAA,IACpB;AAAA,IACA;AAAA,EACF;AACF;AAGO,SAAS,uBACd,QACA,YACkB;AAClB,QAAM,MAAwB,CAAC;AAC/B,aAAW,KAAK,OAAO,SAAS;AAC9B,UAAM,cAAc,EAAE,oBAAoB,EAAE;AAC5C,UAAM,YAAY,cAAc,EAAE,cAAc,EAAE;AAGlD,QAAI,cAAc,GAAG;AACnB,UAAI;AAAA,QACF;AAAA,UACE;AAAA,UACA,EAAE;AAAA,UACF,UAAU,EAAE,IAAI;AAAA,UAChB;AAAA,UACA;AAAA,UACA;AAAA,UACA;AAAA,UACA,EAAE;AAAA,UACF;AAAA,QACF;AAAA,MACF;AAAA,IACF,WAAW,gBAAgB,KAAK,EAAE,cAAc,EAAE,gBAAgB,GAAG;AAEnE,UAAI;AAAA,QACF;AAAA,UACE;AAAA,UACA,EAAE;AAAA,UACF,UAAU,EAAE,IAAI,iFAAiF,EAAE,WAAW,eAAe,EAAE,aAAa;AAAA,UAC5I;AAAA,UACA;AAAA,UACA;AAAA,UACA;AAAA,UACA,EAAE;AAAA,UACF;AAAA,QACF;AAAA,MACF;AAAA,IACF;AAGA,QAAI,eAAe,KAAK,CAAC,EAAE,mBAAmB;AAC5C,UAAI;AAAA,QACF;AAAA,UACE;AAAA,UACA,EAAE;AAAA,UACF,UAAU,EAAE,IAAI;AAAA,UAChB;AAAA,UACA;AAAA,UACA;AAAA,UACA;AAAA,UACA,EAAE;AAAA,QACJ;AAAA,MACF;AAAA,IACF;AAGA,QAAI,EAAE,SAAS,YAAY,EAAE,oBAAoB,GAAG;AAClD,UAAI;AAAA,QACF;AAAA,UACE;AAAA,UACA,EAAE;AAAA,UACF,iBAAiB,EAAE,IAAI,aAAa,EAAE,iBAAiB;AAAA,UACvD;AAAA,UACA;AAAA,UACA;AAAA,UACA;AAAA,UACA,EAAE;AAAA,QACJ;AAAA,MACF;AAAA,IACF;AAGA,QAAI,EAAE,QAAQ,wBAAwB,CAAC,EAAE,kBAAkB;AACzD,UAAI;AAAA,QACF;AAAA,UACE;AAAA,UACA,EAAE;AAAA,UACF,UAAU,EAAE,IAAI,QAAQ,EAAE,KAAK;AAAA,UAC/B;AAAA,UACA;AAAA,UACA;AAAA,UACA,mFAAmF,EAAE,KAAK;AAAA,UAC1F,EAAE;AAAA,QACJ;AAAA,MACF;AAAA,IACF;AAGA,QAAI,CAAC,EAAE,aAAa;AAClB,UAAI;AAAA,QACF;AAAA,UACE;AAAA,UACA,EAAE;AAAA,UACF,UAAU,EAAE,IAAI;AAAA,UAChB;AAAA,UACA;AAAA,UACA;AAAA,UACA;AAAA,UACA,EAAE;AAAA,QACJ;AAAA,MACF;AAAA,IACF;AAGA,QAAI,CAAC,EAAE,UAAU;AACf,UAAI;AAAA,QACF;AAAA,UACE;AAAA,UACA,EAAE;AAAA,UACF,UAAU,EAAE,IAAI;AAAA,UAChB;AAAA,UACA;AAAA,UACA;AAAA,UACA;AAAA,UACA,EAAE;AAAA,QACJ;AAAA,MACF;AAAA,IACF;AAAA,EACF;AACA,SAAO;AACT;AAIO,IAAM,oBAAN,MAA6D;AAAA,EACzD,KAAK;AAAA,EACL,cACP;AAAA,EACO,YAAY;AAAA,EACZ,OAAO,EAAE,MAAM,iBAA0B,iBAAiB,EAAE;AAAA,EAC5D,UAAU;AAAA,EAEnB,MAAM,QAAQ,OAAyB,KAAgD;AACrF,UAAM,aAAa,IAAI,MAAM,eAAc,oBAAI,KAAK,GAAE,YAAY;AAClE,QAAI;AAAA,MACF,gBAAgB,MAAM,QAAQ,MAAM,gBAAgB,MAAM,mBAAmB;AAAA,IAC/E;AACA,WAAO,uBAAuB,OAAO,UAAU;AAAA,EACjD;AACF;AAEO,IAAM,sBAAsB,IAAI,kBAAkB;;;AClYzD,IAAM,yBAAyB;AAAA,EAC7B;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AACF;AAEO,IAAM,YAAN,MAAgB;AAAA,EACJ;AAAA,EACA;AAAA,EAEjB,YAAY,UAA4B,CAAC,GAAG;AAC1C,SAAK,UAAU,QAAQ;AACvB,SAAK,gBAAgB,QAAQ,iBAAiB;AAAA,EAChD;AAAA,EAEA,MAAM,MAAM,OAAmB,OAAkC;AAC/D,UAAM,MAAM,MAAM,MAAM,OAAO,KAAK;AACpC,QAAI,CAAC,IAAK,OAAM,IAAI,cAAc,OAAO,KAAK,YAAY;AAC1D,UAAM,CAAC,OAAO,QAAQ,WAAW,MAAM,IAAI,MAAM,QAAQ,IAAI;AAAA,MAC3D,MAAM,MAAM,EAAE,MAAM,CAAC;AAAA,MACrB,MAAM,OAAO,EAAE,MAAM,CAAC;AAAA,MACtB,MAAM,UAAU,KAAK;AAAA,MACrB,MAAM,OAAO,KAAK;AAAA,IACpB,CAAC;AACD,WAAO,KAAK,WAAW,EAAE,KAAK,OAAO,QAAQ,WAAW,OAAO,CAAC;AAAA,EAClE;AAAA,EAEA,WAAW,OAA2B;AACpC,UAAM,QAAkB,CAAC;AACzB,UAAM,WAAW,MAAM,MAAM;AAAA,MAC3B,CAAC,MAA2C,EAAE,SAAS;AAAA,IACzD;AACA,UAAM,YAAY,MAAM,MAAM;AAAA,MAC5B,CAAC,MAA4C,EAAE,SAAS;AAAA,IAC1D;AACA,UAAM,aAAa,MAAM,MAAM;AAAA,MAC7B,CAAC,MAA6C,EAAE,SAAS;AAAA,IAC3D;AACA,UAAM,eAAe,MAAM,MAAM;AAAA,MAC/B,CAAC,MAA+C,EAAE,SAAS;AAAA,IAC7D;AACA,UAAM,iBAAiB,WAAW;AAAA,MAChC,CAAC,SAAS,KAAK,cAAc,gBAAgB,KAAK,YAAY,cAAc;AAAA,IAC9E;AAEA,UAAM,UACJ,MAAM,IAAI,SAAS,SAAS,OAAO,IAAI,MAAM,IAAI,WAAW,cAAc,MAAM;AAClF,QAAI,CAAC,QAAS,OAAM,KAAK,qCAAqC;AAE9D,UAAM,eAAe,WAAW,SAC5B,WAAW,OAAO,CAAC,KAAK,SAAS,MAAM,oBAAoB,KAAK,KAAK,GAAG,CAAC,IACzE,WAAW,SACX;AACJ,UAAM,eACJ,OAAO,MAAM,IAAI,SAAS,UAAU,WAChC;AAAA,MACE,MAAM,IAAI,QAAQ,QAAQ,IAAI,MAAM,IAAI,QAAQ,QAAQ,MAAM,MAAM,IAAI,QAAQ;AAAA,IAClF,IACA;AACN,UAAM,eAAe,gBAAgB,gBAAgB;AAErD,UAAM,kBAAkB,UAAU,OAAO,CAAC,SAAS,KAAK,WAAW,OAAO,EAAE;AAC5E,UAAM,iBAAiB,UAAU,WAAW,IAAI,IAAI,kBAAkB,UAAU;AAChF,QAAI,UAAU,WAAW,EAAG,OAAM,KAAK,wBAAwB;AAE/D,UAAM,gBACJ,MAAM,UAAU,SAChB,UAAU,OAAO,CAAC,SAAS,0BAA0B,KAAK,KAAK,QAAQ,CAAC,EAAE;AAC5E,UAAM,eAAe,gBAAgB,IAAI,QAAQ,gBAAgB,CAAC,IAAI;AACtE,QAAI,CAAC,aAAc,OAAM,KAAK,uCAAuC;AAErE,UAAM,eAAe,aAAa;AAAA,MAChC,CAAC,SAAS,OAAO,KAAK,eAAe,YAAY,KAAK,aAAa;AAAA,IACrE;AACA,UAAM,cAAc,aAAa,SAC7B,aAAa;AAAA,MACX,CAAC,KAAK,SAAS,OAAO,KAAK,eAAe,KAAK,KAAK,IAAI,GAAG,KAAK,cAAc,CAAC;AAAA,MAC/E;AAAA,IACF,IAAI,aAAa,SACjB,UAAU;AAAA,MAAK,CAAC,SACZ,yCAAyC,KAAK,KAAK,UAAU,KAAK,IAAI,CAAC;AAAA,IACzE,IACA,MACA;AACN,QAAI,CAAC,YAAa,OAAM,KAAK,sCAAsC;AAEnE,UAAM,eAAe,WAAW,OAAO,CAAC,SAAS,gBAAgB,IAAI,CAAC;AACtE,UAAM,oBAAoB,eAAe,OAAO,CAAC,SAAS,gBAAgB,IAAI,CAAC;AAC/E,UAAM,YAAY,eAAe,SAAU,kBAAkB,SAAS,IAAI,IAAK;AAC/E,QAAI,kBAAkB;AACpB,YAAM,KAAK,yBAAyB,kBAAkB,MAAM,cAAc;AAAA,aACnE,CAAC,eAAe,OAAQ,OAAM,KAAK,iCAAiC;AAE7E,UAAM,mBAAmB,WAAW,SAAS,aAAa,SAAS,WAAW,SAAS;AACvF,QAAI,iBAAkB,OAAM,KAAK,YAAY,aAAa,MAAM,8BAA8B;AAE9F,UAAM,2BACJ,gBACA,aAAa,SACb,SAAS,OAAO,CAAC,SAAS,kBAAkB,KAAK,UAAU,EAAE,CAAC,EAAE;AAClE,UAAM,eACJ,SAAS,OAAO,CAAC,SAAS,KAAK,QAAQ,KAAK,UAAU,EAAE,CAAC,EAAE,SAC3D,MAAM,OAAO,OAAO,CAAC,UAAU,KAAK,QAAQ,KAAK,UAAU,MAAM,OAAO,CAAC,CAAC,EAAE;AAC9E,UAAM,mBACJ,2BAA2B,iBAAiB,IACxC,IACA,4BAA4B,2BAA2B;AAC7D,UAAM,eACJ,2BAA2B,iBAAiB,IACxC,IACA,gBAAgB,2BAA2B;AACjD,QAAI,eAAe,EAAG,OAAM,KAAK,YAAY,YAAY,kBAAkB;AAE3E,UAAM,UAAU,MAAM,OAAO,SACzB,KAAK;AAAA,MACH,GAAG,MAAM,OACN,OAAO,CAAC,UAA6B,MAAM,cAAc,KAAK,EAC9D,IAAI,CAAC,UAA6B,MAAM,QAAQ;AAAA,MACnD;AAAA,IACF,IACA,SAAS,OAAO,CAAC,KAAK,SAAS,OAAO,KAAK,WAAW,IAAI,CAAC;AAC/D,UAAM,cACJ,MAAM,IAAI,WAAW,MAAM,IAAI,YAC3B,KAAK,IAAI,IAAI,MAAM,IAAI,UAAU,MAAM,IAAI,aAAa,GAAI,IAC5D;AAEN,WAAO;AAAA,MACL;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,IACF;AAAA,EACF;AAAA,EAEA,KAAK,OAAyB;AAC5B,WAAO,kBAAkB,OAAO,KAAK,OAAO;AAAA,EAC9C;AAAA,EAEQ,QAAQ,MAAuB;AACrC,WAAO,KAAK,cAAc,KAAK,CAAC,YAAY,QAAQ,KAAK,IAAI,CAAC;AAAA,EAChE;AACF;AAEA,SAAS,oBAAoB,OAAuB;AAClD,SAAO,QAAQ,IAAI,QAAQ,QAAQ,EAAE,IAAI,QAAQ,KAAK;AACxD;AAEA,SAAS,kBAAkB,MAAuB;AAChD,SAAO,qGAAqG;AAAA,IAC1G;AAAA,EACF;AACF;AAEA,SAAS,gBAAgB,MAAiD;AACxE,SACE,KAAK,YAAY,aAAa,QAC9B,KAAK,YAAY,YAAY,cAC7B,eAAe,KAAK,YAAY,gBAAgB,KAChD,eAAe,KAAK,YAAY,YAAY,KAC5C,KAAK,SAAS;AAElB;AAEA,SAAS,eAAe,OAAyB;AAC/C,SAAO,OAAO,UAAU,YAAY,QAAQ;AAC9C;;;AC/EO,IAAM,6BAAgE;AAAA,EAC3E,QAAQ;AAAA,EACR,WAAW;AAAA,EACX,SAAS;AACX;AAgCO,IAAM,iCAAiC;AAE9C,IAAM,qBAAqB;AAC3B,IAAM,mBAAmB;AACzB,IAAM,uBAAuB;AAC7B,IAAM,kBAAkB;AACxB,IAAM,qBAAqB;AAC3B,IAAM,gBAAgB;AAEtB,IAAM,kBAAkB;AAAA,EACtB,MAAM;AAAA,EACN,sBAAsB;AAAA,EACtB,UAAU,CAAC,WAAW,UAAU;AAAA,EAChC,YAAY;AAAA,IACV,SAAS,EAAE,MAAM,UAAU,WAAW,IAAI,WAAW,IAAI;AAAA,IACzD,UAAU;AAAA,MACR,MAAM;AAAA,MACN,UAAU;AAAA,MACV,OAAO;AAAA,QACL,MAAM;AAAA,QACN,sBAAsB;AAAA,QACtB,UAAU,CAAC,WAAW,WAAW,SAAS,YAAY,UAAU;AAAA,QAChE,YAAY;AAAA,UACV,SAAS,EAAE,MAAM,UAAU,WAAW,GAAG,WAAW,IAAI;AAAA,UACxD,SAAS,EAAE,MAAM,UAAU;AAAA,UAC3B,OAAO,EAAE,MAAM,UAAU,SAAS,GAAG,SAAS,GAAG;AAAA,UACjD,UAAU,EAAE,MAAM,UAAU,WAAW,GAAG,WAAW,IAAI;AAAA,UACzD,UAAU,EAAE,MAAM,UAAU,MAAM,CAAC,YAAY,SAAS,SAAS,MAAM,EAAE;AAAA,QAC3E;AAAA,MACF;AAAA,IACF;AAAA,EACF;AACF;AAEA,SAAS,SAAS,MAAc,KAAa,OAAuB;AAClE,MAAI,KAAK,UAAU,IAAK,QAAO;AAC/B,SAAO,GAAG,KAAK,MAAM,GAAG,GAAG,CAAC;AAAA,oBAAkB,KAAK,SAAS,GAAG,aAAa,KAAK;AACnF;AAEA,SAAS,YACP,OACA,MACQ;AACR,QAAM,aAAa,MAAM,YACtB,OAAO,CAAC,MAAM,EAAE,QAAQ,UAAU,KAAK,eAAe,EACtD,IAAI,CAAC,MAAM,aAAa,EAAE,IAAI;AAAA,EAAS,EAAE,OAAO,EAAE,EAClD,KAAK,MAAM;AAEd,QAAM,OAAO,MAAM,cAAc;AAEjC,SAAO;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAUP,MAAM,WAAW;AAAA;AAAA,EAEjB,MAAM,gBAAgB;AAAA,UAA+B,MAAM,aAAa;AAAA,iBAAoB,MAAM,uBAAuB,EAAE;AAAA;AAAA,IAAS,EAAE;AAAA,EACtI,MAAM,iBACL;AAAA,IACC,CAAC,GAAG,MACF,KAAK,IAAI,CAAC,MAAM,EAAE,IAAI,IAAI,EAAE,UAAU,SAAS,mBAAc,EAAE,SAAS,MAAM,GAAG,CAAC,EAAE,KAAK,KAAK,CAAC,MAAM,EAAE;AAAA,EAC3G,EACC,KAAK,IAAI,CAAC;AAAA;AAAA,EAEX,OAAO;AAAA,EAAqD,SAAS,MAAM,KAAK,cAAc,MAAM,CAAC;AAAA;AAAA,IAAS,EAAE;AAAA,EAChH,SAAS,YAAY,KAAK,gBAAgB,QAAQ,CAAC;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAkBrD;AASA,eAAsB,wBACpB,OACA,UAAuC,CAAC,GACH;AACrC,QAAM,QAAQ,KAAK,IAAI;AACvB,QAAM,aAAa,MAAM,iBAAiB;AAE1C,MAAI,eAAe,GAAG;AACpB,WAAO;AAAA,MACL,MAAM;AAAA,MACN,SAAS;AAAA,MACT,OAAO;AAAA,MACP,cAAc;AAAA,MACd,YAAY;AAAA,MACZ,UAAU,CAAC;AAAA,MACX,SAAS;AAAA,MACT,YAAY;AAAA,MACZ,SAAS;AAAA,MACT,WAAW;AAAA,MACX,OAAO;AAAA,IACT;AAAA,EACF;AAEA,QAAM,OAA8C;AAAA,IAClD,OAAO,QAAQ,SAAS;AAAA,IACxB,WAAW,QAAQ,aAAa;AAAA,IAChC,WAAW,QAAQ,aAAa;AAAA,IAChC,gBAAgB,QAAQ,kBAAkB;AAAA,IAC1C,iBAAiB,QAAQ,mBAAmB;AAAA,IAC5C,cAAc,QAAQ,gBAAgB;AAAA,IACtC,KAAK,QAAQ,OAAO,CAAC;AAAA,IACrB,YAAY,QAAQ,cAAc,IAAI,WAAW;AAAA,IACjD,WAAW,QAAQ,aAAa;AAAA,IAChC,QAAQ,QAAQ,UAAU,IAAI,gBAAgB,EAAE;AAAA,IAChD,gBAAgB,QAAQ,kBAAkB;AAAA,IAC1C,mBAAmB,EAAE,GAAG,4BAA4B,GAAI,QAAQ,qBAAqB,CAAC,EAAG;AAAA,EAC3F;AAMA,QAAM,mBAAmB,CAAC,SAA8B;AACtD,QAAI,KAAK,mBAAmB,OAAQ,QAAO;AAC3C,QAAI,KAAK,UAAU,KAAM,QAAO,KAAK;AACrC,QAAI,KAAK,mBAAmB,cAAc;AACxC,aAAO,KAAK,kBAAkB,KAAK,cAAc,QAAQ,KAAK;AAAA,IAChE;AACA,WAAO;AAAA,EACT;AACA,QAAM,eAAe,IAAI;AAAA,IACvB,MAAM,iBAAiB,IAAI,CAAC,MAAM,CAAC,EAAE,MAAM,iBAAiB,CAAC,CAAC,CAAC;AAAA,EACjE;AAEA,MAAI;AACJ,MAAI;AACF,UAAM,UAAU;AAAA,MACd,OAAO,KAAK;AAAA,MACZ,UAAU;AAAA,QACR;AAAA,UACE,MAAM;AAAA,UACN,SACE;AAAA,QACJ;AAAA,QACA,EAAE,MAAM,QAAiB,SAAS,YAAY,OAAO,IAAI,EAAE;AAAA,MAC7D;AAAA,MACA,YAAY,EAAE,MAAM,0BAA0B,QAAQ,gBAAgB;AAAA,MACtE,aAAa;AAAA,MACb,WAAW,KAAK;AAAA,MAChB,WAAW,KAAK;AAAA,IAClB;AACA,UAAM,OAAO,MAAM,KAAK,WAAW,YAAY;AAAA,MAC7C,SAAS;AAAA,MACT,OAAO,KAAK;AAAA,MACZ,OAAO;AAAA,MACP,OAAO,KAAK;AAAA,MACZ,eAAe,2BAA2B,SAAS,KAAK,GAAG;AAAA,MAC3D,QAAQ,KAAK;AAAA,MACb,SAAS,CAAC,QAAQ,WAChB,YAA6D,SAAS;AAAA,QACpE,GAAG,KAAK;AAAA,QACR;AAAA,QACA,gBAAgB;AAAA,MAClB,CAAC;AAAA,MACH,SAAS,CAAC,EAAE,OAAO,MAAM,mBAAmB,MAAM;AAAA,MAClD,kBAAkB;AAAA,IACpB,CAAC;AACD,cAAU,KAAK;AACf,QAAI,CAAC,KAAK,UAAW,OAAM,KAAK;AAChC,UAAM,EAAE,MAAM,IAAI,KAAK;AAEvB,QAAI,CAAC,OAAO,YAAY,CAAC,MAAM,QAAQ,MAAM,QAAQ,GAAG;AACtD,YAAM,IAAI,MAAM,0EAAqE;AAAA,IACvF;AAEA,UAAM,WAA6B,MAAM,SAAS,IAAI,CAAC,OAAO;AAAA,MAC5D,SAAS,OAAO,EAAE,OAAO;AAAA,MACzB,SAAS,QAAQ,EAAE,OAAO;AAAA,MAC1B,OAAO,KAAK,IAAI,GAAG,KAAK,IAAI,IAAI,OAAO,EAAE,SAAS,CAAC,CAAC,CAAC;AAAA,MACrD,UAAU,OAAO,EAAE,YAAY,EAAE;AAAA,MACjC,UAAW,CAAC,YAAY,SAAS,SAAS,MAAM,EAAY,SAAS,EAAE,QAAQ,IAC3E,EAAE,WACF;AAAA,IACN,EAAE;AAEF,UAAM,eAAe,SAAS,OAAO,CAAC,MAAM,EAAE,WAAW,EAAE,SAAS,CAAC,EAAE;AACvE,QAAI,YAAY;AAChB,QAAI,mBAAmB;AACvB,eAAW,KAAK,UAAU;AACxB,YAAM,IAAI,aAAa,IAAI,EAAE,OAAO,KAAK;AACzC,mBAAa;AACb,0BAAoB,IAAI,EAAE;AAAA,IAC5B;AACA,UAAM,WACJ,YAAY,IACR,mBAAmB,YACnB,SAAS,OAAO,CAAC,GAAG,MAAM,IAAI,EAAE,OAAO,CAAC,IAAI,KAAK,IAAI,GAAG,SAAS,MAAM;AAE7E,WAAO;AAAA,MACL,MAAM;AAAA,MACN,SAAS;AAAA,MACT,OAAO,QAAQ,WAAW,IAAI,QAAQ,CAAC,CAAC;AAAA,MACxC;AAAA,MACA;AAAA,MACA;AAAA,MACA,SAAS,OAAO,MAAM,WAAW,EAAE;AAAA,MACnC,YAAY,KAAK,IAAI,IAAI;AAAA,MACzB,SAAS,KAAK,QAAQ,cAAc,OAAO,KAAK,QAAQ;AAAA,MACxD,WAAW;AAAA,IACb;AAAA,EACF,SAAS,KAAK;AACZ,WAAO;AAAA,MACL,MAAM;AAAA,MACN,SAAS;AAAA,MACT,OAAO;AAAA,MACP,cAAc;AAAA,MACd;AAAA,MACA,UAAU,CAAC;AAAA,MACX,SAAS;AAAA,MACT,YAAY,KAAK,IAAI,IAAI;AAAA,MACzB,SAAS,WAAW,CAAC,QAAQ,cAAc,QAAQ,UAAU;AAAA,MAC7D,WAAW;AAAA,MACX,OAAO,eAAe,QAAQ,IAAI,UAAU,OAAO,GAAG;AAAA,IACxD;AAAA,EACF;AACF;AAMO,SAAS,2BACd,UAAuC,CAAC,GACmC;AAC3E,SAAO,CAAC,UAAU,wBAAwB,OAAO,OAAO;AAC1D;","names":["existsSync","existsSync","existsSync","readFileSync","existsSync","readFileSync"]}