graphifyy 0.3.17 → 0.3.28

package/dist/index.cjs.map

@@ -1 +1 @@
-{"version":3,"sources":["../src/validate.ts","../src/build.ts","../src/collections.ts","../src/cluster.ts","../src/analyze.ts","../src/report.ts","../src/security.ts","../src/export.ts","../src/cache.ts","../src/extract.ts","../src/index.ts","../src/types.ts","../src/wiki.ts","../src/detect.ts","../src/benchmark.ts","../src/ingest.ts","../src/serve.ts","../src/watch.ts"],"sourcesContent":["/**\n * Validate extraction JSON against the graphify schema before graph assembly.\n */\n\nexport const VALID_FILE_TYPES = new Set([\"code\", \"document\", \"paper\", \"image\", \"rationale\"]);\nexport const VALID_CONFIDENCES = new Set([\"EXTRACTED\", \"INFERRED\", \"AMBIGUOUS\"]);\nexport const REQUIRED_NODE_FIELDS = [\"id\", \"label\", \"file_type\", \"source_file\"] as const;\nexport const REQUIRED_EDGE_FIELDS = [\"source\", \"target\", \"relation\", \"confidence\", \"source_file\"] as const;\n\n/**\n * Validate an extraction JSON dict against the graphify schema.\n * Returns a list of error strings - empty list means valid.\n */\nexport function validateExtraction(data: unknown): string[] {\n  if (typeof data !== \"object\" || data === null || Array.isArray(data)) {\n    return [\"Extraction must be a JSON object\"];\n  }\n\n  const d = data as Record<string, unknown>;\n  const errors: string[] = [];\n\n  // Nodes\n  if (!(\"nodes\" in d)) {\n    errors.push(\"Missing required key 'nodes'\");\n  } else if (!Array.isArray(d.nodes)) {\n    errors.push(\"'nodes' must be a list\");\n  } else {\n    for (let i = 0; i < d.nodes.length; i++) {\n      const node = d.nodes[i] as Record<string, unknown>;\n      if (typeof node !== \"object\" || node === null || Array.isArray(node)) {\n        errors.push(`Node ${i} must be an object`);\n        continue;\n      }\n      for (const field of REQUIRED_NODE_FIELDS) {\n        if (!(field in node)) {\n          errors.push(\n            `Node ${i} (id=${JSON.stringify(node.id ?? \"?\")}) missing required field '${field}'`,\n          );\n        }\n      }\n      if (\"file_type\" in node && !VALID_FILE_TYPES.has(node.file_type as string)) {\n        errors.push(\n          `Node ${i} (id=${JSON.stringify(node.id ?? \"?\")}) has invalid file_type ` +\n            `'${node.file_type}' - must be one of ${JSON.stringify([...VALID_FILE_TYPES].sort())}`,\n        );\n      }\n    }\n  }\n\n  // Edges\n  if (!(\"edges\" in d)) {\n    errors.push(\"Missing required key 'edges'\");\n  } else if (!Array.isArray(d.edges)) {\n    errors.push(\"'edges' must be a list\");\n  } else {\n    const nodeIds = new Set<string>();\n    if (Array.isArray(d.nodes)) {\n      for (const n of d.nodes) {\n        if (typeof n === \"object\" && n !== null && \"id\" in n) {\n          nodeIds.add((n as Record<string, unknown>).id as string);\n        }\n      }\n    }\n\n    for (let i = 0; i < d.edges.length; i++) {\n      const edge = d.edges[i] as Record<string, unknown>;\n      if (typeof edge !== \"object\" || edge === null || Array.isArray(edge)) {\n        errors.push(`Edge ${i} must be an object`);\n        continue;\n      }\n      for (const field of REQUIRED_EDGE_FIELDS) {\n        if (!(field in edge)) {\n          errors.push(`Edge ${i} missing required field '${field}'`);\n        }\n      }\n      if (\"confidence\" in edge && !VALID_CONFIDENCES.has(edge.confidence as string)) {\n        errors.push(\n          `Edge ${i} has invalid confidence '${edge.confidence}' ` +\n            `- must be one of ${JSON.stringify([...VALID_CONFIDENCES].sort())}`,\n        );\n      }\n      if (\"source\" in edge && nodeIds.size > 0 && !nodeIds.has(edge.source as string)) {\n        errors.push(`Edge ${i} source '${edge.source}' does not match any node id`);\n      }\n      if (\"target\" in edge && nodeIds.size > 0 && !nodeIds.has(edge.target as string)) {\n        errors.push(`Edge ${i} target '${edge.target}' does not match any node id`);\n      }\n    }\n  }\n\n  return errors;\n}\n\n/** Raise an error with all validation errors if extraction is invalid. */\nexport function assertValid(data: unknown): void {\n  const errors = validateExtraction(data);\n  if (errors.length > 0) {\n    const msg =\n      `Extraction JSON has ${errors.length} error(s):\\n` +\n      errors.map((e) => `  • ${e}`).join(\"\\n\");\n    throw new Error(msg);\n  }\n}\n","/**\n * Assemble node+edge dicts into a graphology Graph, preserving edge direction.\n *\n * Node deduplication — three layers:\n *\n * 1. Within a file (AST): each extractor tracks a `seenIds` set.\n * 2. Between files (build): graphology mergeNode is idempotent — last write wins.\n * 3. Semantic merge (skill): before calling build(), the skill merges results\n *    using an explicit `seen` set keyed on node.id.\n */\nimport Graph from \"graphology\";\nimport type { Extraction } from \"./types.js\";\nimport { validateExtraction } from \"./validate.js\";\n\nexport function buildFromJson(extraction: Extraction): Graph {\n  const errors = validateExtraction(extraction);\n  // Dangling edges (stdlib/external imports) are expected - only warn about real schema errors.\n  const realErrors = errors.filter((e) => !e.includes(\"does not match any node id\"));\n  if (realErrors.length > 0) {\n    console.error(\n      `[graphify] Extraction warning (${realErrors.length} issues): ${realErrors[0]}`,\n    );\n  }\n\n  const G = new Graph({ type: \"undirected\", multi: false });\n\n  for (const node of extraction.nodes ?? []) {\n    const { id, ...attrs } = node;\n    G.mergeNode(id, attrs);\n  }\n\n  const nodeSet = new Set(G.nodes());\n\n  for (const edge of extraction.edges ?? []) {\n    const { source, target, ...attrs } = edge;\n    if (!nodeSet.has(source) || !nodeSet.has(target)) continue;\n    // Preserve original edge direction\n    attrs._src = source;\n    attrs._tgt = target;\n    // graphology mergeEdge prevents duplicates on same src/tgt pair\n    try {\n      G.mergeEdge(source, target, attrs);\n    } catch {\n      // ignore if edge already exists with different key\n    }\n  }\n\n  const hyperedges = extraction.hyperedges ?? [];\n  if (hyperedges.length > 0) {\n    G.setAttribute(\"hyperedges\", hyperedges);\n  }\n\n  return G;\n}\n\n/**\n * Merge multiple extraction results into one graph.\n * Extractions are merged in order — last attributes win for duplicate node IDs.\n */\nexport function build(extractions: Extraction[]): Graph {\n  const combined: Extraction = {\n    nodes: [],\n    edges: [],\n    hyperedges: [],\n    input_tokens: 0,\n    output_tokens: 0,\n  };\n  for (const ext of extractions) {\n    combined.nodes.push(...(ext.nodes ?? []));\n    combined.edges.push(...(ext.edges ?? []));\n    (combined.hyperedges ??= []).push(...(ext.hyperedges ?? []));\n    combined.input_tokens += ext.input_tokens ?? 0;\n    combined.output_tokens += ext.output_tokens ?? 0;\n  }\n  return buildFromJson(combined);\n}\n","export type NumericMapLike<T> = Map<number, T> | Record<number | string, T>;\nexport type StringMapLike<T> = Map<string, T> | Record<string, T>;\n\nexport function toNumericMap<T>(\n  value: NumericMapLike<T> | null | undefined,\n): Map<number, T> {\n  if (value instanceof Map) return value;\n\n  const map = new Map<number, T>();\n  if (!value) return map;\n\n  for (const [key, entry] of Object.entries(value)) {\n    const numericKey = Number(key);\n    if (Number.isFinite(numericKey)) {\n      map.set(numericKey, entry as T);\n    }\n  }\n\n  return map;\n}\n\nexport function toStringMap<T>(\n  value: StringMapLike<T> | null | undefined,\n): Map<string, T> {\n  if (value instanceof Map) return value;\n\n  const map = new Map<string, T>();\n  if (!value) return map;\n\n  for (const [key, entry] of Object.entries(value)) {\n    map.set(key, entry as T);\n  }\n\n  return map;\n}\n","/**\n * Community detection on graphology graphs.\n * Uses Louvain (graphology-communities-louvain).\n * Splits oversized communities. Returns cohesion scores.\n */\nimport Graph from \"graphology\";\nimport louvain from \"graphology-communities-louvain\";\nimport { type NumericMapLike, toNumericMap } from \"./collections.js\";\n\nconst MAX_COMMUNITY_FRACTION = 0.25;\nconst MIN_SPLIT_SIZE = 10;\n\nfunction partition(G: Graph): Map<string, number> {\n  // louvain assigns community attribute to each node, returns mapping\n  const result = louvain(G);\n  const map = new Map<string, number>();\n  for (const [node, cid] of Object.entries(result)) {\n    map.set(node, cid as number);\n  }\n  return map;\n}\n\nfunction splitCommunity(G: Graph, nodes: string[]): string[][] {\n  const subgraph = G.copy();\n  // Remove nodes not in this community\n  const nodeSet = new Set(nodes);\n  subgraph.forEachNode((n) => {\n    if (!nodeSet.has(n)) subgraph.dropNode(n);\n  });\n\n  if (subgraph.size === 0) {\n    return nodes.map((n) => [n]);\n  }\n\n  try {\n    const subPartition = partition(subgraph);\n    const subCommunities = new Map<number, string[]>();\n    for (const [node, cid] of subPartition) {\n      if (!subCommunities.has(cid)) subCommunities.set(cid, []);\n      subCommunities.get(cid)!.push(node);\n    }\n    if (subCommunities.size <= 1) {\n      return [[...nodes].sort()];\n    }\n    return [...subCommunities.values()].map((v) => [...v].sort());\n  } catch {\n    return [[...nodes].sort()];\n  }\n}\n\nexport function cluster(G: Graph): Map<number, string[]> {\n  if (G.order === 0) return new Map();\n\n  if (G.size === 0) {\n    const result = new Map<number, string[]>();\n    const sorted = [...G.nodes()].sort();\n    sorted.forEach((n, i) => result.set(i, [n]));\n    return result;\n  }\n\n  // Handle isolates separately\n  const isolates: string[] = [];\n  const connectedNodes: string[] = [];\n  G.forEachNode((n) => {\n    if (G.degree(n) === 0) {\n      isolates.push(n);\n    } else {\n      connectedNodes.push(n);\n    }\n  });\n\n  const raw = new Map<number, string[]>();\n\n  if (connectedNodes.length > 0) {\n    // Build subgraph of connected nodes\n    const connected = G.copy();\n    for (const iso of isolates) {\n      connected.dropNode(iso);\n    }\n    const partitionMap = partition(connected);\n    for (const [node, cid] of partitionMap) {\n      if (!raw.has(cid)) raw.set(cid, []);\n      raw.get(cid)!.push(node);\n    }\n  }\n\n  // Each isolate becomes its own single-node community\n  let nextCid = Math.max(-1, ...raw.keys()) + 1;\n  for (const node of isolates) {\n    raw.set(nextCid, [node]);\n    nextCid++;\n  }\n\n  // Split oversized communities\n  const maxSize = Math.max(MIN_SPLIT_SIZE, Math.floor(G.order * MAX_COMMUNITY_FRACTION));\n  const finalCommunities: string[][] = [];\n  for (const nodes of raw.values()) {\n    if (nodes.length > maxSize) {\n      finalCommunities.push(...splitCommunity(G, nodes));\n    } else {\n      finalCommunities.push(nodes);\n    }\n  }\n\n  // Re-index by size descending for deterministic ordering\n  finalCommunities.sort((a, b) => b.length - a.length);\n  const result = new Map<number, string[]>();\n  finalCommunities.forEach((nodes, i) => {\n    result.set(i, [...nodes].sort());\n  });\n  return result;\n}\n\n/** Ratio of actual intra-community edges to maximum possible. */\nexport function cohesionScore(G: Graph, communityNodes: string[]): number {\n  const n = communityNodes.length;\n  if (n <= 1) return 1.0;\n  const nodeSet = new Set(communityNodes);\n  let actual = 0;\n  G.forEachEdge((edge, attrs, source, target) => {\n    if (nodeSet.has(source) && nodeSet.has(target)) {\n      actual++;\n    }\n  });\n  const possible = (n * (n - 1)) / 2;\n  return possible > 0 ? Math.round((actual / possible) * 100) / 100 : 0.0;\n}\n\nexport function scoreAll(\n  G: Graph,\n  communities: NumericMapLike<string[]>,\n): Map<number, number> {\n  const communityMap = toNumericMap(communities);\n  const result = new Map<number, number>();\n  for (const [cid, nodes] of communityMap) {\n    result.set(cid, cohesionScore(G, nodes));\n  }\n  return result;\n}\n","/**\n * Graph analysis: god nodes (most connected), surprising connections (cross-community),\n * suggested questions, graph diff.\n */\nimport Graph from \"graphology\";\nimport betweennessCentrality from \"graphology-metrics/centrality/betweenness.js\";\nimport type { GodNodeEntry, SurpriseEntry, SuggestedQuestion, GraphDiffResult } from \"./types.js\";\nimport { type NumericMapLike, toNumericMap } from \"./collections.js\";\nimport { cohesionScore } from \"./cluster.js\";\n\ntype GraphInstance = InstanceType<typeof Graph>;\n\nfunction nodeCommunityMap(communities: NumericMapLike<string[]>): Map<string, number> {\n  const communityMap = toNumericMap(communities);\n  const result = new Map<string, number>();\n  for (const [cid, nodes] of communityMap) {\n    for (const n of nodes) result.set(n, cid);\n  }\n  return result;\n}\n\nexport function isFileNode(G: Graph, nodeId: string): boolean {\n  const attrs = G.getNodeAttributes(nodeId);\n  const label = (attrs.label as string) ?? \"\";\n  if (!label) return false;\n\n  const sourceFile = (attrs.source_file as string) ?? \"\";\n  if (sourceFile) {\n    const fileName = sourceFile.split(\"/\").pop() ?? \"\";\n    if (label === fileName) return true;\n  }\n\n  if (label.startsWith(\".\") && label.endsWith(\"()\")) return true;\n  if (label.endsWith(\"()\") && G.degree(nodeId) <= 1) return true;\n  return false;\n}\n\nexport function isConceptNode(G: Graph, nodeId: string): boolean {\n  const data = G.getNodeAttributes(nodeId);\n  const source = (data.source_file as string) ?? \"\";\n  if (!source) return true;\n  const lastPart = source.split(\"/\").pop() ?? \"\";\n  if (!lastPart.includes(\".\")) return true;\n  return false;\n}\n\nconst CODE_EXTENSIONS = new Set([\n  \"py\", \"ts\", \"tsx\", \"js\", \"go\", \"rs\", \"java\", \"rb\", \"cpp\", \"c\", \"h\", \"cs\", \"kt\", \"scala\", \"php\",\n]);\nconst DOC_EXTENSIONS = new Set([\"md\", \"txt\", \"rst\"]);\nconst PAPER_EXTENSIONS = new Set([\"pdf\"]);\nconst IMAGE_EXTENSIONS = new Set([\"png\", \"jpg\", \"jpeg\", \"webp\", \"gif\", \"svg\"]);\n\nfunction fileCategory(path: string): string {\n  const ext = path.includes(\".\") ? path.split(\".\").pop()?.toLowerCase() ?? \"\" : \"\";\n  if (CODE_EXTENSIONS.has(ext)) return \"code\";\n  if (PAPER_EXTENSIONS.has(ext)) return \"paper\";\n  if (IMAGE_EXTENSIONS.has(ext)) return \"image\";\n  return \"doc\";\n}\n\nfunction topLevelDir(path: string): string {\n  return path.includes(\"/\") ? path.split(\"/\")[0]! : path;\n}\n\nfunction surpriseScore(\n  G: Graph,\n  u: string,\n  v: string,\n  data: Record<string, unknown>,\n  nodeCommunity: Map<string, number>,\n  uSource: string,\n  vSource: string,\n): [number, string[]] {\n  let score = 0;\n  const reasons: string[] = [];\n\n  const conf = (data.confidence as string) ?? \"EXTRACTED\";\n  const confBonus: Record<string, number> = { AMBIGUOUS: 3, INFERRED: 2, EXTRACTED: 1 };\n  score += confBonus[conf] ?? 1;\n  if (conf === \"AMBIGUOUS\" || conf === \"INFERRED\") {\n    reasons.push(`${conf.toLowerCase()} connection - not explicitly stated in source`);\n  }\n\n  const catU = fileCategory(uSource);\n  const catV = fileCategory(vSource);\n  if (catU !== catV) {\n    score += 2;\n    reasons.push(`crosses file types (${catU} ↔ ${catV})`);\n  }\n\n  if (topLevelDir(uSource) !== topLevelDir(vSource)) {\n    score += 2;\n    reasons.push(\"connects across different repos/directories\");\n  }\n\n  const cidU = nodeCommunity.get(u);\n  const cidV = nodeCommunity.get(v);\n  if (cidU !== undefined && cidV !== undefined && cidU !== cidV) {\n    score += 1;\n    reasons.push(\"bridges separate communities\");\n  }\n\n  if (data.relation === \"semantically_similar_to\") {\n    score = Math.floor(score * 1.5);\n    reasons.push(\"semantically similar concepts with no structural link\");\n  }\n\n  const degU = G.degree(u);\n  const degV = G.degree(v);\n  if (Math.min(degU, degV) <= 2 && Math.max(degU, degV) >= 5) {\n    score += 1;\n    const peripheral = degU <= 2 ? (G.getNodeAttribute(u, \"label\") as string) : (G.getNodeAttribute(v, \"label\") as string);\n    const hub = degU <= 2 ? (G.getNodeAttribute(v, \"label\") as string) : (G.getNodeAttribute(u, \"label\") as string);\n    reasons.push(`peripheral node \\`${peripheral}\\` unexpectedly reaches hub \\`${hub}\\``);\n  }\n\n  return [score, reasons];\n}\n\nexport function godNodes(G: Graph, topN: number = 10): GodNodeEntry[] {\n  const degree: [string, number][] = [];\n  G.forEachNode((n) => degree.push([n, G.degree(n)]));\n  degree.sort((a, b) => b[1] - a[1]);\n\n  const result: GodNodeEntry[] = [];\n  for (const [nodeId, deg] of degree) {\n    if (isFileNode(G, nodeId) || isConceptNode(G, nodeId)) continue;\n    result.push({\n      id: nodeId,\n      label: (G.getNodeAttribute(nodeId, \"label\") as string) ?? nodeId,\n      edges: deg,\n    });\n    if (result.length >= topN) break;\n  }\n  return result;\n}\n\nexport function surprisingConnections(\n  G: Graph,\n  communities?: NumericMapLike<string[]>,\n  topN: number = 5,\n): SurpriseEntry[] {\n  const comms = toNumericMap(communities);\n  const sourceFiles = new Set<string>();\n  G.forEachNode((_, data) => {\n    const sf = (data.source_file as string) ?? \"\";\n    if (sf) sourceFiles.add(sf);\n  });\n  const isMultiSource = sourceFiles.size > 1;\n\n  if (isMultiSource) {\n    return crossFileSurprises(G, comms, topN);\n  }\n  return crossCommunitySurprises(G, comms, topN);\n}\n\nfunction crossFileSurprises(G: Graph, communities: Map<number, string[]>, topN: number): SurpriseEntry[] {\n  const nodeCommunity = nodeCommunityMap(communities);\n  const candidates: (SurpriseEntry & { _score: number })[] = [];\n\n  G.forEachEdge((edge, data, source, target) => {\n    const relation = (data.relation as string) ?? \"\";\n    if ([\"imports\", \"imports_from\", \"contains\", \"method\"].includes(relation)) return;\n    if (isConceptNode(G, source) || isConceptNode(G, target)) return;\n    if (isFileNode(G, source) || isFileNode(G, target)) return;\n\n    const uSource = (G.getNodeAttribute(source, \"source_file\") as string) ?? \"\";\n    const vSource = (G.getNodeAttribute(target, \"source_file\") as string) ?? \"\";\n    if (!uSource || !vSource || uSource === vSource) return;\n\n    const [score, reasons] = surpriseScore(G, source, target, data, nodeCommunity, uSource, vSource);\n    const srcId = (data._src as string) ?? source;\n    const tgtId = (data._tgt as string) ?? target;\n\n    candidates.push({\n      _score: score,\n      source: (G.getNodeAttribute(srcId, \"label\") as string) ?? srcId,\n      target: (G.getNodeAttribute(tgtId, \"label\") as string) ?? tgtId,\n      source_files: [\n        (G.getNodeAttribute(srcId, \"source_file\") as string) ?? \"\",\n        (G.getNodeAttribute(tgtId, \"source_file\") as string) ?? \"\",\n      ],\n      confidence: (data.confidence as SurpriseEntry[\"confidence\"]) ?? \"EXTRACTED\",\n      relation,\n      why: reasons.length > 0 ? reasons.join(\"; \") : \"cross-file semantic connection\",\n    });\n  });\n\n  candidates.sort((a, b) => b._score - a._score);\n  const result = candidates.slice(0, topN).map(({ _score, ...rest }) => rest);\n\n  if (result.length > 0) return result;\n  return crossCommunitySurprises(G, communities, topN);\n}\n\nfunction crossCommunitySurprises(\n  G: Graph,\n  communities: Map<number, string[]>,\n  topN: number,\n): SurpriseEntry[] {\n  if (communities.size === 0) {\n    if (G.size === 0) return [];\n    // Use edge betweenness centrality approximation\n    return edgeBetweennessSurprises(G, topN);\n  }\n\n  const nodeCommunity = nodeCommunityMap(communities);\n  const surprises: (SurpriseEntry & { _pair: string })[] = [];\n\n  G.forEachEdge((edge, data, u, v) => {\n    const cidU = nodeCommunity.get(u);\n    const cidV = nodeCommunity.get(v);\n    if (cidU === undefined || cidV === undefined || cidU === cidV) return;\n    if (isFileNode(G, u) || isFileNode(G, v)) return;\n    const relation = (data.relation as string) ?? \"\";\n    if ([\"imports\", \"imports_from\", \"contains\", \"method\"].includes(relation)) return;\n\n    const srcId = (data._src as string) ?? u;\n    const tgtId = (data._tgt as string) ?? v;\n\n    surprises.push({\n      source: (G.getNodeAttribute(srcId, \"label\") as string) ?? srcId,\n      target: (G.getNodeAttribute(tgtId, \"label\") as string) ?? tgtId,\n      source_files: [\n        (G.getNodeAttribute(srcId, \"source_file\") as string) ?? \"\",\n        (G.getNodeAttribute(tgtId, \"source_file\") as string) ?? \"\",\n      ],\n      confidence: (data.confidence as SurpriseEntry[\"confidence\"]) ?? \"EXTRACTED\",\n      relation,\n      note: `Bridges community ${cidU} → community ${cidV}`,\n      _pair: [Math.min(cidU, cidV), Math.max(cidU, cidV)].join(\",\"),\n    });\n  });\n\n  const order: Record<string, number> = { AMBIGUOUS: 0, INFERRED: 1, EXTRACTED: 2 };\n  surprises.sort((a, b) => (order[a.confidence] ?? 3) - (order[b.confidence] ?? 3));\n\n  const seenPairs = new Set<string>();\n  const deduped: SurpriseEntry[] = [];\n  for (const s of surprises) {\n    const pair = s._pair;\n    if (!seenPairs.has(pair)) {\n      seenPairs.add(pair);\n      const { _pair, ...rest } = s;\n      deduped.push(rest);\n    }\n  }\n  return deduped.slice(0, topN);\n}\n\nfunction edgeBetweennessSurprises(G: Graph, topN: number): SurpriseEntry[] {\n  // Approximate edge betweenness via node betweenness\n  const bc = betweennessCentrality(G);\n  const edgeScores: [string, string, number, Record<string, unknown>][] = [];\n\n  G.forEachEdge((edge, data, u, v) => {\n    const score = (bc[u] ?? 0) + (bc[v] ?? 0);\n    edgeScores.push([u, v, score, data]);\n  });\n\n  edgeScores.sort((a, b) => b[2] - a[2]);\n\n  return edgeScores.slice(0, topN).map(([u, v, score, data]) => ({\n    source: (G.getNodeAttribute(u, \"label\") as string) ?? u,\n    target: (G.getNodeAttribute(v, \"label\") as string) ?? v,\n    source_files: [\n      (G.getNodeAttribute(u, \"source_file\") as string) ?? \"\",\n      (G.getNodeAttribute(v, \"source_file\") as string) ?? \"\",\n    ],\n    confidence: (data.confidence as SurpriseEntry[\"confidence\"]) ?? \"EXTRACTED\",\n    relation: (data.relation as string) ?? \"\",\n    note: `Bridges graph structure (betweenness=${score.toFixed(3)})`,\n  }));\n}\n\nexport function suggestQuestions(\n  G: Graph,\n  communities: NumericMapLike<string[]>,\n  communityLabels: NumericMapLike<string>,\n  topN: number = 7,\n): SuggestedQuestion[] {\n  const communityMap = toNumericMap(communities);\n  const labelMap = toNumericMap(communityLabels);\n  const questions: SuggestedQuestion[] = [];\n  const nodeCommunity = nodeCommunityMap(communityMap);\n\n  // 1. AMBIGUOUS edges\n  G.forEachEdge((edge, data, u, v) => {\n    if (data.confidence === \"AMBIGUOUS\") {\n      const ul = (G.getNodeAttribute(u, \"label\") as string) ?? u;\n      const vl = (G.getNodeAttribute(v, \"label\") as string) ?? v;\n      const relation = (data.relation as string) ?? \"related to\";\n      questions.push({\n        type: \"ambiguous_edge\",\n        question: `What is the exact relationship between \\`${ul}\\` and \\`${vl}\\`?`,\n        why: `Edge tagged AMBIGUOUS (relation: ${relation}) - confidence is low.`,\n      });\n    }\n  });\n\n  // 2. Bridge nodes (high betweenness)\n  if (G.size > 0) {\n    const bc = betweennessCentrality(G);\n    const bridges: [string, number][] = Object.entries(bc)\n      .filter(([n, s]) => !isFileNode(G, n) && !isConceptNode(G, n) && (s as number) > 0)\n      .sort((a, b) => (b[1] as number) - (a[1] as number))\n      .slice(0, 3) as [string, number][];\n\n    for (const [nodeId, score] of bridges) {\n      const label = (G.getNodeAttribute(nodeId, \"label\") as string) ?? nodeId;\n      const cid = nodeCommunity.get(nodeId);\n      const commLabel = cid !== undefined ? (labelMap.get(cid) ?? `Community ${cid}`) : \"unknown\";\n      const neighborComms = new Set<number>();\n      G.forEachNeighbor(nodeId, (n) => {\n        const nc = nodeCommunity.get(n);\n        if (nc !== undefined && nc !== cid) neighborComms.add(nc);\n      });\n      if (neighborComms.size > 0) {\n        const otherLabels = [...neighborComms].map((c) => labelMap.get(c) ?? `Community ${c}`);\n        questions.push({\n          type: \"bridge_node\",\n          question: `Why does \\`${label}\\` connect \\`${commLabel}\\` to ${otherLabels.map((l) => `\\`${l}\\``).join(\", \")}?`,\n          why: `High betweenness centrality (${score.toFixed(3)}) - this node is a cross-community bridge.`,\n        });\n      }\n    }\n  }\n\n  // 3. God nodes with many INFERRED edges\n  const degree: [string, number][] = [];\n  G.forEachNode((n) => degree.push([n, G.degree(n)]));\n  degree.sort((a, b) => b[1] - a[1]);\n  const topNodes = degree.filter(([n]) => !isFileNode(G, n)).slice(0, 5);\n\n  for (const [nodeId] of topNodes) {\n    const inferred: string[] = [];\n    G.forEachEdge(nodeId, (edge, data, source, target) => {\n      if (data.confidence === \"INFERRED\") {\n        const srcId = (data._src as string) ?? source;\n        const tgtId = (data._tgt as string) ?? target;\n        const otherId = srcId === nodeId ? tgtId : srcId;\n        inferred.push((G.getNodeAttribute(otherId, \"label\") as string) ?? otherId);\n      }\n    });\n    if (inferred.length >= 2) {\n      const label = (G.getNodeAttribute(nodeId, \"label\") as string) ?? nodeId;\n      questions.push({\n        type: \"verify_inferred\",\n        question: `Are the ${inferred.length} inferred relationships involving \\`${label}\\` (e.g. with \\`${inferred[0]}\\` and \\`${inferred[1]}\\`) actually correct?`,\n        why: `\\`${label}\\` has ${inferred.length} INFERRED edges - model-reasoned connections that need verification.`,\n      });\n    }\n  }\n\n  // 4. Isolated nodes\n  const isolated: string[] = [];\n  G.forEachNode((n) => {\n    if (G.degree(n) <= 1 && !isFileNode(G, n) && !isConceptNode(G, n)) {\n      isolated.push(n);\n    }\n  });\n  if (isolated.length > 0) {\n    const labels = isolated.slice(0, 3).map((n) => (G.getNodeAttribute(n, \"label\") as string) ?? n);\n    questions.push({\n      type: \"isolated_nodes\",\n      question: `What connects ${labels.map((l) => `\\`${l}\\``).join(\", \")} to the rest of the system?`,\n      why: `${isolated.length} weakly-connected nodes found - possible documentation gaps or missing edges.`,\n    });\n  }\n\n  // 5. Low-cohesion communities\n  for (const [cid, nodes] of communityMap) {\n    const score = cohesionScore(G, nodes);\n    if (score < 0.15 && nodes.length >= 5) {\n      const label = labelMap.get(cid) ?? `Community ${cid}`;\n      questions.push({\n        type: \"low_cohesion\",\n        question: `Should \\`${label}\\` be split into smaller, more focused modules?`,\n        why: `Cohesion score ${score} - nodes in this community are weakly interconnected.`,\n      });\n    }\n  }\n\n  if (questions.length === 0) {\n    return [{\n      type: \"no_signal\",\n      question: null,\n      why:\n        \"Not enough signal to generate questions. \" +\n        \"This usually means the corpus has no AMBIGUOUS edges, no bridge nodes, \" +\n        \"no INFERRED relationships, and all communities are tightly cohesive. \" +\n        \"Add more files or run with --mode deep to extract richer edges.\",\n    }];\n  }\n\n  return questions.slice(0, topN);\n}\n\nexport function graphDiff(GOld: Graph, GNew: Graph): GraphDiffResult {\n  const oldNodes = new Set(GOld.nodes());\n  const newNodes = new Set(GNew.nodes());\n\n  const addedNodeIds = [...newNodes].filter((n) => !oldNodes.has(n));\n  const removedNodeIds = [...oldNodes].filter((n) => !newNodes.has(n));\n\n  const newNodesList = addedNodeIds.map((n) => ({\n    id: n,\n    label: (GNew.getNodeAttribute(n, \"label\") as string) ?? n,\n  }));\n  const removedNodesList = removedNodeIds.map((n) => ({\n    id: n,\n    label: (GOld.getNodeAttribute(n, \"label\") as string) ?? n,\n  }));\n\n  function edgeKey(u: string, v: string, relation: string): string {\n    return `${[u, v].sort().join(\",\")}:${relation}`;\n  }\n\n  const oldEdgeKeys = new Set<string>();\n  GOld.forEachEdge((edge, data, u, v) => {\n    oldEdgeKeys.add(edgeKey(u, v, (data.relation as string) ?? \"\"));\n  });\n  const newEdgeKeys = new Set<string>();\n  GNew.forEachEdge((edge, data, u, v) => {\n    newEdgeKeys.add(edgeKey(u, v, (data.relation as string) ?? \"\"));\n  });\n\n  const addedEdgeKeys = new Set([...newEdgeKeys].filter((k) => !oldEdgeKeys.has(k)));\n  const removedEdgeKeys = new Set([...oldEdgeKeys].filter((k) => !newEdgeKeys.has(k)));\n\n  const newEdgesList: GraphDiffResult[\"new_edges\"] = [];\n  GNew.forEachEdge((edge, data, u, v) => {\n    if (addedEdgeKeys.has(edgeKey(u, v, (data.relation as string) ?? \"\"))) {\n      newEdgesList.push({\n        source: u, target: v,\n        relation: (data.relation as string) ?? \"\",\n        confidence: (data.confidence as string) ?? \"\",\n      });\n    }\n  });\n\n  const removedEdgesList: GraphDiffResult[\"removed_edges\"] = [];\n  GOld.forEachEdge((edge, data, u, v) => {\n    if (removedEdgeKeys.has(edgeKey(u, v, (data.relation as string) ?? \"\"))) {\n      removedEdgesList.push({\n        source: u, target: v,\n        relation: (data.relation as string) ?? \"\",\n        confidence: (data.confidence as string) ?? \"\",\n      });\n    }\n  });\n\n  const parts: string[] = [];\n  if (newNodesList.length > 0) parts.push(`${newNodesList.length} new node${newNodesList.length !== 1 ? \"s\" : \"\"}`);\n  if (newEdgesList.length > 0) parts.push(`${newEdgesList.length} new edge${newEdgesList.length !== 1 ? \"s\" : \"\"}`);\n  if (removedNodesList.length > 0) parts.push(`${removedNodesList.length} node${removedNodesList.length !== 1 ? \"s\" : \"\"} removed`);\n  if (removedEdgesList.length > 0) parts.push(`${removedEdgesList.length} edge${removedEdgesList.length !== 1 ? \"s\" : \"\"} removed`);\n\n  return {\n    new_nodes: newNodesList,\n    removed_nodes: removedNodesList,\n    new_edges: newEdgesList,\n    removed_edges: removedEdgesList,\n    summary: parts.length > 0 ? parts.join(\", \") : \"no changes\",\n  };\n}\n","/**\n * Generate GRAPH_REPORT.md - the human-readable audit trail.\n */\nimport Graph from \"graphology\";\nimport type { GodNodeEntry, SurpriseEntry, SuggestedQuestion, DetectionResult } from \"./types.js\";\nimport { type NumericMapLike, toNumericMap } from \"./collections.js\";\nimport { isFileNode, isConceptNode } from \"./analyze.js\";\n\nexport function generate(\n  G: Graph,\n  communities: NumericMapLike<string[]>,\n  cohesionScores: NumericMapLike<number>,\n  communityLabels: NumericMapLike<string>,\n  godNodeList: GodNodeEntry[],\n  surpriseList: SurpriseEntry[],\n  detectionResult: DetectionResult,\n  tokenCost: { input: number; output: number },\n  root: string,\n  suggestedQuestions?:\n    | SuggestedQuestion[]\n    | { suggestedQuestions?: SuggestedQuestion[] | null }\n    | null,\n): string {\n  const communityMap = toNumericMap(communities);\n  const cohesionMap = toNumericMap(cohesionScores);\n  const labelMap = toNumericMap(communityLabels);\n  const suggestedQuestionList = Array.isArray(suggestedQuestions)\n    ? suggestedQuestions\n    : (suggestedQuestions?.suggestedQuestions ?? null);\n  const today = new Date().toISOString().slice(0, 10);\n\n  const confidences: string[] = [];\n  G.forEachEdge((_, data) => {\n    confidences.push((data.confidence as string) ?? \"EXTRACTED\");\n  });\n  const total = confidences.length || 1;\n  const extPct = Math.round((confidences.filter((c) => c === \"EXTRACTED\").length / total) * 100);\n  const infPct = Math.round((confidences.filter((c) => c === \"INFERRED\").length / total) * 100);\n  const ambPct = Math.round((confidences.filter((c) => c === \"AMBIGUOUS\").length / total) * 100);\n\n  const infEdges: { score: number }[] = [];\n  G.forEachEdge((_, data) => {\n    if (data.confidence === \"INFERRED\") {\n      infEdges.push({ score: (data.confidence_score as number) ?? 0.5 });\n    }\n  });\n  const infAvg = infEdges.length > 0\n    ? Math.round((infEdges.reduce((s, e) => s + e.score, 0) / infEdges.length) * 100) / 100\n    : null;\n\n  const lines: string[] = [\n    `# Graph Report - ${root}  (${today})`,\n    \"\",\n    \"## Corpus Check\",\n  ];\n\n  if (detectionResult.warning) {\n    lines.push(`- ${detectionResult.warning}`);\n  } else {\n    lines.push(\n      `- ${detectionResult.total_files} files · ~${detectionResult.total_words.toLocaleString()} words`,\n      \"- Verdict: corpus is large enough that graph structure adds value.\",\n    );\n  }\n\n  lines.push(\n    \"\",\n    \"## Summary\",\n    `- ${G.order} nodes · ${G.size} edges · ${communityMap.size} communities detected`,\n    `- Extraction: ${extPct}% EXTRACTED · ${infPct}% INFERRED · ${ambPct}% AMBIGUOUS` +\n      (infAvg !== null ? ` · INFERRED: ${infEdges.length} edges (avg confidence: ${infAvg})` : \"\"),\n    `- Token cost: ${tokenCost.input.toLocaleString()} input · ${tokenCost.output.toLocaleString()} output`,\n    \"\",\n    \"## God Nodes (most connected - your core abstractions)\",\n  );\n\n  godNodeList.forEach((node, i) => {\n    lines.push(`${i + 1}. \\`${node.label}\\` - ${node.edges} edges`);\n  });\n\n  lines.push(\"\", \"## Surprising Connections (you probably didn't know these)\");\n  if (surpriseList.length > 0) {\n    for (const s of surpriseList) {\n      const relation = s.relation ?? \"related_to\";\n      const note = s.note ?? \"\";\n      const files = s.source_files ?? [\"\", \"\"];\n      const conf = s.confidence ?? \"EXTRACTED\";\n      const cscore = s.confidence_score;\n      const confTag = conf === \"INFERRED\" && cscore != null ? `INFERRED ${cscore.toFixed(2)}` : conf;\n      const semTag = relation === \"semantically_similar_to\" ? \" [semantically similar]\" : \"\";\n      lines.push(\n        `- \\`${s.source}\\` --${relation}--> \\`${s.target}\\`  [${confTag}]${semTag}`,\n        `  ${files[0]} → ${files[1]}${note ? `  _${note}_` : \"\"}`,\n      );\n    }\n  } else {\n    lines.push(\"- None detected - all connections are within the same source files.\");\n  }\n\n  const hyperedges = (G.getAttribute(\"hyperedges\") as Array<Record<string, unknown>>) ?? [];\n  if (hyperedges.length > 0) {\n    lines.push(\"\", \"## Hyperedges (group relationships)\");\n    for (const h of hyperedges) {\n      const nodeLabels = ((h.nodes as string[]) ?? []).join(\", \");\n      const conf = (h.confidence as string) ?? \"INFERRED\";\n      const cscore = h.confidence_score as number | undefined;\n      const confTag = cscore != null ? `${conf} ${cscore.toFixed(2)}` : conf;\n      lines.push(`- **${h.label ?? h.id ?? \"\"}** — ${nodeLabels} [${confTag}]`);\n    }\n  }\n\n  lines.push(\"\", \"## Communities\");\n  for (const [cid, nodes] of communityMap) {\n    const label = labelMap.get(cid) ?? `Community ${cid}`;\n    const score = cohesionMap.get(cid) ?? 0.0;\n    const realNodes = nodes.filter((n) => !isFileNode(G, n));\n    const display = realNodes.slice(0, 8).map((n) => (G.getNodeAttribute(n, \"label\") as string) ?? n);\n    const suffix = realNodes.length > 8 ? ` (+${realNodes.length - 8} more)` : \"\";\n    lines.push(\n      \"\",\n      `### Community ${cid} - \"${label}\"`,\n      `Cohesion: ${score}`,\n      `Nodes (${realNodes.length}): ${display.join(\", \")}${suffix}`,\n    );\n  }\n\n  const ambiguous: [string, string, Record<string, unknown>][] = [];\n  G.forEachEdge((_, data, u, v) => {\n    if (data.confidence === \"AMBIGUOUS\") ambiguous.push([u, v, data]);\n  });\n  if (ambiguous.length > 0) {\n    lines.push(\"\", \"## Ambiguous Edges - Review These\");\n    for (const [u, v, d] of ambiguous) {\n      const ul = (G.getNodeAttribute(u, \"label\") as string) ?? u;\n      const vl = (G.getNodeAttribute(v, \"label\") as string) ?? v;\n      lines.push(\n        `- \\`${ul}\\` → \\`${vl}\\`  [AMBIGUOUS]`,\n        `  ${d.source_file ?? \"\"} · relation: ${d.relation ?? \"unknown\"}`,\n      );\n    }\n  }\n\n  // Gaps section\n  const isolated = G.nodes().filter(\n    (n) => G.degree(n) <= 1 && !isFileNode(G, n) && !isConceptNode(G, n),\n  );\n  const thinCommunities = new Map<number, string[]>();\n  for (const [cid, nodes] of communityMap) {\n    if (nodes.length < 3) thinCommunities.set(cid, nodes);\n  }\n  const gapCount = isolated.length + thinCommunities.size;\n\n  if (gapCount > 0 || ambPct > 20) {\n    lines.push(\"\", \"## Knowledge Gaps\");\n    if (isolated.length > 0) {\n      const isolatedLabels = isolated.slice(0, 5).map((n) => (G.getNodeAttribute(n, \"label\") as string) ?? n);\n      const suffix = isolated.length > 5 ? ` (+${isolated.length - 5} more)` : \"\";\n      lines.push(\n        `- **${isolated.length} isolated node(s):** ${isolatedLabels.map((l) => `\\`${l}\\``).join(\", \")}${suffix}`,\n        \"  These have ≤1 connection - possible missing edges or undocumented components.\",\n      );\n    }\n    if (thinCommunities.size > 0) {\n      for (const [cid, nodes] of thinCommunities) {\n        const label = labelMap.get(cid) ?? `Community ${cid}`;\n        const nodeLabels = nodes.map((n) => (G.getNodeAttribute(n, \"label\") as string) ?? n);\n        lines.push(\n          `- **Thin community \\`${label}\\`** (${nodes.length} nodes): ${nodeLabels.map((l) => `\\`${l}\\``).join(\", \")}`,\n          \"  Too small to be a meaningful cluster - may be noise or needs more connections extracted.\",\n        );\n      }\n    }\n    if (ambPct > 20) {\n      lines.push(`- **High ambiguity: ${ambPct}% of edges are AMBIGUOUS.** Review the Ambiguous Edges section above.`);\n    }\n  }\n\n  if (suggestedQuestionList && suggestedQuestionList.length > 0) {\n    lines.push(\"\", \"## Suggested Questions\");\n    const noSignal = suggestedQuestionList.length === 1 && suggestedQuestionList[0]!.type === \"no_signal\";\n    if (noSignal) {\n      lines.push(`_${suggestedQuestionList[0]!.why}_`);\n    } else {\n      lines.push(\"_Questions this graph is uniquely positioned to answer:_\", \"\");\n      for (const q of suggestedQuestionList) {\n        if (q.question) {\n          lines.push(`- **${q.question}**`, `  _${q.why}_`);\n        }\n      }\n    }\n  }\n\n  return lines.join(\"\\n\");\n}\n","/**\n * Security helpers - URL validation, safe fetch, path guards, label sanitization.\n */\nimport { resolve as pathResolve } from \"node:path\";\nimport { existsSync } from \"node:fs\";\nimport { URL } from \"node:url\";\nimport * as dns from \"node:dns/promises\";\nimport * as net from \"node:net\";\n\nconst ALLOWED_SCHEMES = new Set([\"http:\", \"https:\"]);\nconst MAX_FETCH_BYTES = 52_428_800; // 50 MB\nconst MAX_TEXT_BYTES = 10_485_760; // 10 MB\nconst BLOCKED_HOSTS = new Set([\"metadata.google.internal\", \"metadata.google.com\"]);\n\n// ---------------------------------------------------------------------------\n// URL validation\n// ---------------------------------------------------------------------------\n\n/**\n * Raise if url is not http/https, or targets a private/internal IP.\n * Blocks file://, ftp://, data:, and any other SSRF-prone scheme.\n */\nexport async function validateUrl(url: string): Promise<string> {\n  let parsed: URL;\n  try {\n    parsed = new URL(url);\n  } catch {\n    throw new Error(`Invalid URL: ${url}`);\n  }\n\n  if (!ALLOWED_SCHEMES.has(parsed.protocol)) {\n    throw new Error(\n      `Blocked URL scheme '${parsed.protocol}' - only http and https are allowed. Got: ${url}`,\n    );\n  }\n\n  const hostname = parsed.hostname;\n  if (hostname) {\n    if (BLOCKED_HOSTS.has(hostname.toLowerCase())) {\n      throw new Error(`Blocked cloud metadata endpoint '${hostname}'. Got: ${url}`);\n    }\n\n    // Resolve hostname and block private/reserved IP ranges\n    try {\n      const addrs = await dns.resolve4(hostname).catch(() => [] as string[]);\n      const addrs6 = await dns.resolve6(hostname).catch(() => [] as string[]);\n      for (const addr of [...addrs, ...addrs6]) {\n        if (isPrivateIp(addr)) {\n          throw new Error(\n            `Blocked private/internal IP ${addr} (resolved from '${hostname}'). Got: ${url}`,\n          );\n        }\n      }\n    } catch (e) {\n      if (e instanceof Error && e.message.startsWith(\"Blocked\")) throw e;\n      // DNS failure will surface later during fetch\n    }\n  }\n\n  return url;\n}\n\n/** Synchronous URL validation (scheme + hostname only, no DNS). */\nexport function validateUrlSync(url: string): string {\n  let parsed: URL;\n  try {\n    parsed = new URL(url);\n  } catch {\n    throw new Error(`Invalid URL: ${url}`);\n  }\n\n  if (!ALLOWED_SCHEMES.has(parsed.protocol)) {\n    throw new Error(\n      `Blocked URL scheme '${parsed.protocol}' - only http and https are allowed. Got: ${url}`,\n    );\n  }\n\n  if (parsed.hostname && BLOCKED_HOSTS.has(parsed.hostname.toLowerCase())) {\n    throw new Error(`Blocked cloud metadata endpoint '${parsed.hostname}'. Got: ${url}`);\n  }\n\n  return url;\n}\n\nfunction isPrivateIp(addr: string): boolean {\n  if (net.isIPv4(addr)) {\n    const parts = addr.split(\".\").map(Number);\n    const [a, b] = parts as [number, number, ...number[]];\n    // 127.x.x.x, 10.x.x.x, 172.16-31.x.x, 192.168.x.x, 169.254.x.x, 0.x.x.x\n    if (a === 127) return true;\n    if (a === 10) return true;\n    if (a === 172 && b !== undefined && b >= 16 && b <= 31) return true;\n    if (a === 192 && b === 168) return true;\n    if (a === 169 && b === 254) return true;\n    if (a === 0) return true;\n    return false;\n  }\n  if (net.isIPv6(addr)) {\n    const lower = addr.toLowerCase();\n    if (lower === \"::1\" || lower.startsWith(\"fe80:\") || lower.startsWith(\"fc\") || lower.startsWith(\"fd\")) {\n      return true;\n    }\n  }\n  return false;\n}\n\n// ---------------------------------------------------------------------------\n// Safe fetch\n// ---------------------------------------------------------------------------\n\n/**\n * Fetch url and return raw bytes (Buffer).\n * Validates URL, caps response body, follows redirects with re-validation.\n */\nexport async function safeFetch(\n  url: string,\n  maxBytes: number = MAX_FETCH_BYTES,\n  timeout: number = 30_000,\n): Promise<Buffer> {\n  await validateUrl(url);\n\n  const controller = new AbortController();\n  const timer = setTimeout(() => controller.abort(), timeout);\n\n  try {\n    const resp = await fetch(url, {\n      signal: controller.signal,\n      headers: { \"User-Agent\": \"Mozilla/5.0 graphify/1.0\" },\n      redirect: \"follow\",\n    });\n\n    if (!resp.ok) {\n      throw new Error(`HTTP ${resp.status} fetching ${url}`);\n    }\n\n    // Validate final URL after redirects\n    if (resp.url !== url) {\n      await validateUrl(resp.url);\n    }\n\n    const reader = resp.body?.getReader();\n    if (!reader) throw new Error(\"No response body\");\n\n    const chunks: Uint8Array[] = [];\n    let total = 0;\n\n    while (true) {\n      const { done, value } = await reader.read();\n      if (done) break;\n      total += value.length;\n      if (total > maxBytes) {\n        reader.cancel();\n        throw new Error(\n          `Response from ${url} exceeds size limit (${Math.floor(maxBytes / 1_048_576)} MB). Aborting download.`,\n        );\n      }\n      chunks.push(value);\n    }\n\n    return Buffer.concat(chunks);\n  } finally {\n    clearTimeout(timer);\n  }\n}\n\n/** Fetch url and return decoded text (UTF-8). */\nexport async function safeFetchText(\n  url: string,\n  maxBytes: number = MAX_TEXT_BYTES,\n  timeout: number = 15_000,\n): Promise<string> {\n  const raw = await safeFetch(url, maxBytes, timeout);\n  return raw.toString(\"utf-8\");\n}\n\n// ---------------------------------------------------------------------------\n// Path validation\n// ---------------------------------------------------------------------------\n\n/**\n * Resolve path and verify it stays inside base (defaults to graphify-out/).\n * Requires the base directory to exist.\n */\nexport function validateGraphPath(filePath: string, base?: string): string {\n  const resolvedBase = pathResolve(base ?? \"graphify-out\");\n\n  if (!existsSync(resolvedBase)) {\n    throw new Error(\n      `Graph base directory does not exist: ${resolvedBase}. Run the graphify skill first to build the graph (for Codex: $graphify .).`,\n    );\n  }\n\n  const resolved = pathResolve(filePath);\n\n  if (!resolved.startsWith(resolvedBase + \"/\") && resolved !== resolvedBase) {\n    throw new Error(\n      `Path '${filePath}' escapes the allowed directory ${resolvedBase}. Only paths inside graphify-out/ are permitted.`,\n    );\n  }\n\n  if (!existsSync(resolved)) {\n    throw new Error(`Graph file not found: ${resolved}`);\n  }\n\n  return resolved;\n}\n\n// ---------------------------------------------------------------------------\n// Label sanitization\n// ---------------------------------------------------------------------------\n\nconst CONTROL_CHAR_RE = /[\\x00-\\x1f\\x7f]/g;\nconst MAX_LABEL_LEN = 256;\n\n/** Strip control characters and cap length. Safe for JSON embedding. */\nexport function sanitizeLabel(text: string): string {\n  let cleaned = text.replace(CONTROL_CHAR_RE, \"\");\n  if (cleaned.length > MAX_LABEL_LEN) {\n    cleaned = cleaned.slice(0, MAX_LABEL_LEN);\n  }\n  return cleaned;\n}\n\n/** Escape text for safe HTML embedding. */\nexport function escapeHtml(text: string): string {\n  return text\n    .replace(/&/g, \"&amp;\")\n    .replace(/</g, \"&lt;\")\n    .replace(/>/g, \"&gt;\")\n    .replace(/\"/g, \"&quot;\")\n    .replace(/'/g, \"&#39;\");\n}\n","/**\n * Export graph to HTML, JSON, SVG, GraphML, Obsidian Canvas, and Neo4j Cypher.\n */\nimport { writeFileSync } from \"node:fs\";\nimport Graph from \"graphology\";\nimport { sanitizeLabel, escapeHtml } from \"./security.js\";\nimport type { Hyperedge } from \"./types.js\";\nimport {\n  type NumericMapLike,\n  type StringMapLike,\n  toNumericMap,\n  toStringMap,\n} from \"./collections.js\";\n\n// ---------------------------------------------------------------------------\n// Constants\n// ---------------------------------------------------------------------------\n\nconst COMMUNITY_COLORS = [\n  \"#4E79A7\", \"#F28E2B\", \"#E15759\", \"#76B7B2\", \"#59A14F\",\n  \"#EDC948\", \"#B07AA1\", \"#FF9DA7\", \"#9C755F\", \"#BAB0AC\",\n];\n\nconst MAX_NODES_FOR_VIZ = 5_000;\n\nconst CONFIDENCE_SCORE_DEFAULTS: Record<string, number> = {\n  EXTRACTED: 1.0,\n  INFERRED: 0.5,\n  AMBIGUOUS: 0.2,\n};\n\n// ---------------------------------------------------------------------------\n// Helpers\n// ---------------------------------------------------------------------------\n\ntype CommunityLabelsInput = NumericMapLike<string>;\ntype CommunityLabelOptions = { communityLabels?: CommunityLabelsInput };\ntype SvgOptions = CommunityLabelOptions & { figsize?: [number, number] };\ntype CanvasOptions = CommunityLabelOptions & { nodeFilenames?: StringMapLike<string> };\ntype Neo4jPushOptions = {\n  uri: string;\n  user: string;\n  password: string;\n  communities?: NumericMapLike<string[]>;\n};\n\nfunction nodeCommunityMap(communities: NumericMapLike<string[]>): Map<string, number> {\n  const communityMap = toNumericMap(communities);\n  const result = new Map<string, number>();\n  for (const [cid, nodes] of communityMap) {\n    for (const n of nodes) result.set(n, cid);\n  }\n  return result;\n}\n\nfunction cypherEscape(s: string): string {\n  return s.replace(/\\\\/g, \"\\\\\\\\\").replace(/'/g, \"\\\\'\");\n}\n\nfunction isCommunityLabelOptions(\n  value: CommunityLabelsInput | CommunityLabelOptions,\n): value is CommunityLabelOptions {\n  return !(value instanceof Map) && Object.prototype.hasOwnProperty.call(value, \"communityLabels\");\n}\n\nfunction isCanvasOptions(\n  value: CommunityLabelsInput | CanvasOptions,\n): value is CanvasOptions {\n  return !(value instanceof Map) && (\n    Object.prototype.hasOwnProperty.call(value, \"communityLabels\") ||\n    Object.prototype.hasOwnProperty.call(value, \"nodeFilenames\")\n  );\n}\n\nfunction isSvgOptions(\n  value: CommunityLabelsInput | SvgOptions,\n): value is SvgOptions {\n  return !(value instanceof Map) && (\n    Object.prototype.hasOwnProperty.call(value, \"communityLabels\") ||\n    Object.prototype.hasOwnProperty.call(value, \"figsize\")\n  );\n}\n\nfunction normalizeCommunityLabels(\n  labelsOrOptions?: CommunityLabelsInput | CommunityLabelOptions,\n): Map<number, string> | undefined {\n  if (!labelsOrOptions) return undefined;\n  if (!isCommunityLabelOptions(labelsOrOptions)) {\n    return toNumericMap(labelsOrOptions as CommunityLabelsInput);\n  }\n  return toNumericMap(labelsOrOptions.communityLabels);\n}\n\n// ---------------------------------------------------------------------------\n// toJson\n// ---------------------------------------------------------------------------\n\nexport function toJson(\n  G: Graph,\n  communities: NumericMapLike<string[]>,\n  outputPath: string,\n): void {\n  const nodeComm = nodeCommunityMap(communities);\n\n  const nodes: Record<string, unknown>[] = [];\n  G.forEachNode((nodeId, attrs) => {\n    nodes.push({\n      id: nodeId,\n      ...attrs,\n      community: nodeComm.get(nodeId) ?? null,\n    });\n  });\n\n  const links: Record<string, unknown>[] = [];\n  G.forEachEdge((_edge, data, source, target) => {\n    const link: Record<string, unknown> = {\n      source,\n      target,\n      ...data,\n    };\n    if (link.confidence_score === undefined) {\n      const conf = (data.confidence as string) ?? \"EXTRACTED\";\n      link.confidence_score = CONFIDENCE_SCORE_DEFAULTS[conf] ?? 1.0;\n    }\n    links.push(link);\n  });\n\n  const hyperedges = (G.getAttribute(\"hyperedges\") as Hyperedge[] | undefined) ?? [];\n\n  const output = {\n    directed: false,\n    multigraph: false,\n    graph: {},\n    nodes,\n    links,\n    hyperedges,\n  };\n\n  writeFileSync(outputPath, JSON.stringify(output, null, 2), \"utf-8\");\n}\n\n// ---------------------------------------------------------------------------\n// toCypher\n// ---------------------------------------------------------------------------\n\nexport function toCypher(G: Graph, outputPath: string): void {\n  const lines: string[] = [\"// Neo4j Cypher import - generated by the graphify skill\", \"\"];\n\n  G.forEachNode((nodeId, data) => {\n    const label = cypherEscape((data.label as string) ?? nodeId);\n    const nodeIdEsc = cypherEscape(nodeId);\n    const rawFt = ((data.file_type as string) ?? \"unknown\")\n      .charAt(0).toUpperCase() + ((data.file_type as string) ?? \"unknown\").slice(1);\n    const cleaned = rawFt.replace(/[^A-Za-z0-9_]/g, \"\");\n    const ftype = cleaned && /^[A-Za-z]/.test(cleaned) ? cleaned : \"Entity\";\n    lines.push(`MERGE (n:${ftype} {id: '${nodeIdEsc}', label: '${label}'});`);\n  });\n\n  lines.push(\"\");\n\n  G.forEachEdge((_edge, data, u, v) => {\n    const rel = ((data.relation as string) ?? \"RELATES_TO\")\n      .toUpperCase()\n      .replace(/[^A-Za-z0-9_]/g, \"_\");\n    const conf = cypherEscape((data.confidence as string) ?? \"EXTRACTED\");\n    const uEsc = cypherEscape(u);\n    const vEsc = cypherEscape(v);\n    lines.push(\n      `MATCH (a {id: '${uEsc}'}), (b {id: '${vEsc}'}) ` +\n      `MERGE (a)-[:${rel} {confidence: '${conf}'}]->(b);`,\n    );\n  });\n\n  writeFileSync(outputPath, lines.join(\"\\n\"), \"utf-8\");\n}\n\nfunction neo4jLabel(label: string): string {\n  const sanitized = label.replace(/[^A-Za-z0-9_]/g, \"\");\n  return sanitized || \"Entity\";\n}\n\nfunction neo4jRelation(relation: string): string {\n  const sanitized = relation\n    .toUpperCase()\n    .replace(/[\\s-]+/g, \"_\")\n    .replace(/[^A-Z0-9_]/g, \"_\");\n  return sanitized || \"RELATED_TO\";\n}\n\nfunction scalarProps(data: Record<string, unknown>): Record<string, string | number | boolean> {\n  const props: Record<string, string | number | boolean> = {};\n  for (const [key, value] of Object.entries(data)) {\n    if (\n      typeof value === \"string\" ||\n      typeof value === \"number\" ||\n      typeof value === \"boolean\"\n    ) {\n      props[key] = value;\n    }\n  }\n  return props;\n}\n\nexport async function pushToNeo4j(\n  G: Graph,\n  optionsOrUri: Neo4jPushOptions | string,\n  user?: string,\n  password?: string,\n  communities?: NumericMapLike<string[]>,\n): Promise<{ nodes: number; edges: number }> {\n  const options = typeof optionsOrUri === \"string\"\n    ? {\n      uri: optionsOrUri,\n      user: user ?? \"neo4j\",\n      password: password ?? \"\",\n      communities,\n    }\n    : optionsOrUri;\n\n  let neo4jMod: Record<string, any>;\n  try {\n    neo4jMod = await import(\"neo4j-driver\");\n  } catch {\n    throw new Error(\"neo4j-driver not installed. Run: npm install neo4j-driver\");\n  }\n\n  const neo4j = neo4jMod.default ?? neo4jMod;\n  const driver = neo4j.driver(\n    options.uri,\n    neo4j.auth.basic(options.user, options.password),\n  );\n  const communityMap = nodeCommunityMap(options.communities ?? new Map<number, string[]>());\n\n  let nodes = 0;\n  let edges = 0;\n  const session = driver.session();\n\n  try {\n    for (const nodeId of G.nodes()) {\n      const attrs = G.getNodeAttributes(nodeId) as Record<string, unknown>;\n      const props = scalarProps(attrs);\n      props.id = nodeId;\n\n      const communityId = communityMap.get(nodeId);\n      if (communityId !== undefined) {\n        props.community = communityId;\n      }\n\n      const fileType = neo4jLabel(\n        (((attrs.file_type as string) ?? \"Entity\").charAt(0).toUpperCase()) +\n        (((attrs.file_type as string) ?? \"Entity\").slice(1)),\n      );\n\n      await session.run(\n        `MERGE (n:${fileType} {id: $id}) SET n += $props`,\n        { id: nodeId, props },\n      );\n      nodes++;\n    }\n\n    for (const edgeKey of G.edges()) {\n      const source = G.source(edgeKey);\n      const target = G.target(edgeKey);\n      const attrs = G.getEdgeAttributes(edgeKey) as Record<string, unknown>;\n      const relation = neo4jRelation((attrs.relation as string) ?? \"RELATED_TO\");\n      const props = scalarProps(attrs);\n\n      await session.run(\n        `MATCH (a {id: $source}), (b {id: $target}) ` +\n        `MERGE (a)-[r:${relation}]->(b) SET r += $props`,\n        { source, target, props },\n      );\n      edges++;\n    }\n  } finally {\n    await session.close();\n    await driver.close();\n  }\n\n  return { nodes, edges };\n}\n\n// ---------------------------------------------------------------------------\n// toHtml - full interactive vis.js visualization\n// ---------------------------------------------------------------------------\n\nfunction htmlStyles(): string {\n  return `<style>\n  * { box-sizing: border-box; margin: 0; padding: 0; }\n  body { background: #0f0f1a; color: #e0e0e0; font-family: -apple-system, BlinkMacSystemFont, \"Segoe UI\", sans-serif; display: flex; height: 100vh; overflow: hidden; }\n  #graph { flex: 1; }\n  #sidebar { width: 280px; background: #1a1a2e; border-left: 1px solid #2a2a4e; display: flex; flex-direction: column; overflow: hidden; }\n  #search-wrap { padding: 12px; border-bottom: 1px solid #2a2a4e; }\n  #search { width: 100%; background: #0f0f1a; border: 1px solid #3a3a5e; color: #e0e0e0; padding: 7px 10px; border-radius: 6px; font-size: 13px; outline: none; }\n  #search:focus { border-color: #4E79A7; }\n  #search-results { max-height: 140px; overflow-y: auto; padding: 4px 12px; border-bottom: 1px solid #2a2a4e; display: none; }\n  .search-item { padding: 4px 6px; cursor: pointer; border-radius: 4px; font-size: 12px; white-space: nowrap; overflow: hidden; text-overflow: ellipsis; }\n  .search-item:hover { background: #2a2a4e; }\n  #info-panel { padding: 14px; border-bottom: 1px solid #2a2a4e; min-height: 140px; }\n  #info-panel h3 { font-size: 13px; color: #aaa; margin-bottom: 8px; text-transform: uppercase; letter-spacing: 0.05em; }\n  #info-content { font-size: 13px; color: #ccc; line-height: 1.6; }\n  #info-content .field { margin-bottom: 5px; }\n  #info-content .field b { color: #e0e0e0; }\n  #info-content .empty { color: #555; font-style: italic; }\n  .neighbor-link { display: block; padding: 2px 6px; margin: 2px 0; border-radius: 3px; cursor: pointer; font-size: 12px; white-space: nowrap; overflow: hidden; text-overflow: ellipsis; border-left: 3px solid #333; }\n  .neighbor-link:hover { background: #2a2a4e; }\n  #neighbors-list { max-height: 160px; overflow-y: auto; margin-top: 4px; }\n  #legend-wrap { flex: 1; overflow-y: auto; padding: 12px; }\n  #legend-wrap h3 { font-size: 13px; color: #aaa; margin-bottom: 10px; text-transform: uppercase; letter-spacing: 0.05em; }\n  .legend-item { display: flex; align-items: center; gap: 8px; padding: 4px 0; cursor: pointer; border-radius: 4px; font-size: 12px; }\n  .legend-item:hover { background: #2a2a4e; padding-left: 4px; }\n  .legend-item.dimmed { opacity: 0.35; }\n  .legend-dot { width: 12px; height: 12px; border-radius: 50%; flex-shrink: 0; }\n  .legend-label { flex: 1; overflow: hidden; text-overflow: ellipsis; white-space: nowrap; }\n  .legend-count { color: #666; font-size: 11px; }\n  #stats { padding: 10px 14px; border-top: 1px solid #2a2a4e; font-size: 11px; color: #555; }\n</style>`;\n}\n\nfunction hyperedgeScript(hyperedgesJson: string): string {\n  return `<script>\n// Render hyperedges as shaded regions\nconst hyperedges = ${hyperedgesJson};\nfunction drawHyperedges() {\n    const canvas = network.canvas.frame.canvas;\n    const ctx = canvas.getContext('2d');\n    hyperedges.forEach(h => {\n        const positions = h.nodes\n            .map(nid => network.getPositions([nid])[nid])\n            .filter(p => p !== undefined);\n        if (positions.length < 2) return;\n        // Draw convex hull as filled polygon\n        ctx.save();\n        ctx.globalAlpha = 0.12;\n        ctx.fillStyle = '#6366f1';\n        ctx.strokeStyle = '#6366f1';\n        ctx.lineWidth = 2;\n        ctx.beginPath();\n        const scale = network.getScale();\n        const offset = network.getViewPosition();\n        const toCanvas = (p) => ({\n            x: (p.x - offset.x) * scale + canvas.width / 2,\n            y: (p.y - offset.y) * scale + canvas.height / 2\n        });\n        const pts = positions.map(toCanvas);\n        // Expand hull slightly\n        const cx = pts.reduce((s, p) => s + p.x, 0) / pts.length;\n        const cy = pts.reduce((s, p) => s + p.y, 0) / pts.length;\n        const expanded = pts.map(p => ({\n            x: cx + (p.x - cx) * 1.15,\n            y: cy + (p.y - cy) * 1.15\n        }));\n        ctx.moveTo(expanded[0].x, expanded[0].y);\n        expanded.slice(1).forEach(p => ctx.lineTo(p.x, p.y));\n        ctx.closePath();\n        ctx.fill();\n        ctx.globalAlpha = 0.4;\n        ctx.stroke();\n        // Label\n        ctx.globalAlpha = 0.8;\n        ctx.fillStyle = '#4f46e5';\n        ctx.font = 'bold 11px sans-serif';\n        ctx.textAlign = 'center';\n        ctx.fillText(h.label, cx, cy - 5);\n        ctx.restore();\n    });\n}\nnetwork.on('afterDrawing', drawHyperedges);\n</script>`;\n}\n\nfunction htmlScript(nodesJson: string, edgesJson: string, legendJson: string): string {\n  return `<script>\nconst RAW_NODES = ${nodesJson};\nconst RAW_EDGES = ${edgesJson};\nconst LEGEND = ${legendJson};\n\n// Build vis datasets\nconst nodesDS = new vis.DataSet(RAW_NODES.map(n => ({\n  id: n.id, label: n.label, color: n.color, size: n.size,\n  font: n.font, title: n.title,\n  _community: n.community, _community_name: n.community_name,\n  _source_file: n.source_file, _file_type: n.file_type, _degree: n.degree,\n})));\n\nconst edgesDS = new vis.DataSet(RAW_EDGES.map((e, i) => ({\n  id: i, from: e.from, to: e.to,\n  label: '',\n  title: e.title,\n  dashes: e.dashes,\n  width: e.width,\n  color: e.color,\n  arrows: { to: { enabled: true, scaleFactor: 0.5 } },\n})));\n\nconst container = document.getElementById('graph');\nconst network = new vis.Network(container, { nodes: nodesDS, edges: edgesDS }, {\n  physics: {\n    enabled: true,\n    solver: 'forceAtlas2Based',\n    forceAtlas2Based: {\n      gravitationalConstant: -60,\n      centralGravity: 0.005,\n      springLength: 120,\n      springConstant: 0.08,\n      damping: 0.4,\n      avoidOverlap: 0.8,\n    },\n    stabilization: { iterations: 200, fit: true },\n  },\n  interaction: {\n    hover: true,\n    tooltipDelay: 100,\n    hideEdgesOnDrag: true,\n    navigationButtons: false,\n    keyboard: false,\n  },\n  nodes: { shape: 'dot', borderWidth: 1.5 },\n  edges: { smooth: { type: 'continuous', roundness: 0.2 }, selectionWidth: 3 },\n});\n\nnetwork.once('stabilizationIterationsDone', () => {\n  network.setOptions({ physics: { enabled: false } });\n});\n\nfunction showInfo(nodeId) {\n  const n = nodesDS.get(nodeId);\n  if (!n) return;\n  const neighborIds = network.getConnectedNodes(nodeId);\n  const neighborItems = neighborIds.map(nid => {\n    const nb = nodesDS.get(nid);\n    const color = nb ? nb.color.background : '#555';\n    return \\`<span class=\"neighbor-link\" style=\"border-left-color:\\${color}\" onclick=\"focusNode('\\${nid}')\">\\${nb ? nb.label : nid}</span>\\`;\n  }).join('');\n  document.getElementById('info-content').innerHTML = \\`\n    <div class=\"field\"><b>\\${n.label}</b></div>\n    <div class=\"field\">Type: \\${n._file_type || 'unknown'}</div>\n    <div class=\"field\">Community: \\${n._community_name}</div>\n    <div class=\"field\">Source: \\${n._source_file || '-'}</div>\n    <div class=\"field\">Degree: \\${n._degree}</div>\n    \\${neighborIds.length ? \\`<div class=\"field\" style=\"margin-top:8px;color:#aaa;font-size:11px\">Neighbors (\\${neighborIds.length})</div><div id=\"neighbors-list\">\\${neighborItems}</div>\\` : ''}\n  \\`;\n}\n\nfunction focusNode(nodeId) {\n  network.focus(nodeId, { scale: 1.4, animation: true });\n  network.selectNodes([nodeId]);\n  showInfo(nodeId);\n}\n\nnetwork.on('click', params => {\n  if (params.nodes.length > 0) showInfo(params.nodes[0]);\n  else document.getElementById('info-content').innerHTML = '<span class=\"empty\">Click a node to inspect it</span>';\n});\n\nconst searchInput = document.getElementById('search');\nconst searchResults = document.getElementById('search-results');\nsearchInput.addEventListener('input', () => {\n  const q = searchInput.value.toLowerCase().trim();\n  searchResults.innerHTML = '';\n  if (!q) { searchResults.style.display = 'none'; return; }\n  const matches = RAW_NODES.filter(n => n.label.toLowerCase().includes(q)).slice(0, 20);\n  if (!matches.length) { searchResults.style.display = 'none'; return; }\n  searchResults.style.display = 'block';\n  matches.forEach(n => {\n    const el = document.createElement('div');\n    el.className = 'search-item';\n    el.textContent = n.label;\n    el.style.borderLeft = \\`3px solid \\${n.color.background}\\`;\n    el.style.paddingLeft = '8px';\n    el.onclick = () => {\n      network.focus(n.id, { scale: 1.5, animation: true });\n      network.selectNodes([n.id]);\n      showInfo(n.id);\n      searchResults.style.display = 'none';\n      searchInput.value = '';\n    };\n    searchResults.appendChild(el);\n  });\n});\ndocument.addEventListener('click', e => {\n  if (!searchResults.contains(e.target) && e.target !== searchInput)\n    searchResults.style.display = 'none';\n});\n\nconst hiddenCommunities = new Set();\nconst legendEl = document.getElementById('legend');\nLEGEND.forEach(c => {\n  const item = document.createElement('div');\n  item.className = 'legend-item';\n  item.innerHTML = \\`<div class=\"legend-dot\" style=\"background:\\${c.color}\"></div>\n    <span class=\"legend-label\">\\${c.label}</span>\n    <span class=\"legend-count\">\\${c.count}</span>\\`;\n  item.onclick = () => {\n    if (hiddenCommunities.has(c.cid)) {\n      hiddenCommunities.delete(c.cid);\n      item.classList.remove('dimmed');\n    } else {\n      hiddenCommunities.add(c.cid);\n      item.classList.add('dimmed');\n    }\n    const updates = RAW_NODES\n      .filter(n => n.community === c.cid)\n      .map(n => ({ id: n.id, hidden: hiddenCommunities.has(c.cid) }));\n    nodesDS.update(updates);\n  };\n  legendEl.appendChild(item);\n});\n</script>`;\n}\n\nexport function toHtml(\n  G: Graph,\n  communities: NumericMapLike<string[]>,\n  outputPath: string,\n  communityLabelsOrOptions?: CommunityLabelsInput | CommunityLabelOptions,\n): void {\n  const communityMap = toNumericMap(communities);\n  const communityLabels = normalizeCommunityLabels(communityLabelsOrOptions);\n  if (G.order > MAX_NODES_FOR_VIZ) {\n    throw new Error(\n      `Graph has ${G.order} nodes - too large for HTML viz. ` +\n      `Use --no-viz or reduce input size.`,\n    );\n  }\n\n  const nodeComm = nodeCommunityMap(communityMap);\n  const degree = new Map<string, number>();\n  G.forEachNode((n) => degree.set(n, G.degree(n)));\n  const maxDeg = Math.max(1, ...degree.values());\n\n  // Build nodes list for vis.js\n  interface VisNode {\n    id: string;\n    label: string;\n    color: { background: string; border: string; highlight: { background: string; border: string } };\n    size: number;\n    font: { size: number; color: string };\n    title: string;\n    community: number;\n    community_name: string;\n    source_file: string;\n    file_type: string;\n    degree: number;\n  }\n  const visNodes: VisNode[] = [];\n  G.forEachNode((nodeId, data) => {\n    const cid = nodeComm.get(nodeId) ?? 0;\n    const color = COMMUNITY_COLORS[cid % COMMUNITY_COLORS.length]!;\n    const label = sanitizeLabel((data.label as string) ?? nodeId);\n    const deg = degree.get(nodeId) ?? 1;\n    const size = 10 + 30 * (deg / maxDeg);\n    const fontSize = deg >= maxDeg * 0.15 ? 12 : 0;\n    visNodes.push({\n      id: nodeId,\n      label,\n      color: {\n        background: color,\n        border: color,\n        highlight: { background: \"#ffffff\", border: color },\n      },\n      size: Math.round(size * 10) / 10,\n      font: { size: fontSize, color: \"#ffffff\" },\n      title: label,\n      community: cid,\n      community_name: sanitizeLabel(communityLabels?.get(cid) ?? `Community ${cid}`),\n      source_file: sanitizeLabel((data.source_file as string) ?? \"\"),\n      file_type: (data.file_type as string) ?? \"\",\n      degree: deg,\n    });\n  });\n\n  // Build edges list\n  interface VisEdge {\n    from: string;\n    to: string;\n    label: string;\n    title: string;\n    dashes: boolean;\n    width: number;\n    color: { opacity: number };\n    confidence: string;\n  }\n  const visEdges: VisEdge[] = [];\n  G.forEachEdge((_edge, data, u, v) => {\n    const confidence = (data.confidence as string) ?? \"EXTRACTED\";\n    const relation = (data.relation as string) ?? \"\";\n    visEdges.push({\n      from: u,\n      to: v,\n      label: relation,\n      title: `${relation} [${confidence}]`,\n      dashes: confidence !== \"EXTRACTED\",\n      width: confidence === \"EXTRACTED\" ? 2 : 1,\n      color: { opacity: confidence === \"EXTRACTED\" ? 0.7 : 0.35 },\n      confidence,\n    });\n  });\n\n  // Build community legend data\n  interface LegendEntry {\n    cid: number;\n    color: string;\n    label: string;\n    count: number;\n  }\n  const legendData: LegendEntry[] = [];\n  const labelKeys = communityLabels ? [...communityLabels.keys()].sort((a, b) => a - b) : [];\n  for (const cid of labelKeys) {\n    const color = COMMUNITY_COLORS[cid % COMMUNITY_COLORS.length]!;\n    const lbl = escapeHtml(sanitizeLabel(communityLabels?.get(cid) ?? `Community ${cid}`));\n    const n = communityMap.get(cid)?.length ?? 0;\n    legendData.push({ cid, color, label: lbl, count: n });\n  }\n\n  const nodesJson = JSON.stringify(visNodes);\n  const edgesJson = JSON.stringify(visEdges);\n  const legendJson = JSON.stringify(legendData);\n  const rawHyperedges = (G.getAttribute(\"hyperedges\") as Hyperedge[] | undefined) ?? [];\n  const hyperedgesJson = JSON.stringify(rawHyperedges);\n  const title = escapeHtml(sanitizeLabel(outputPath));\n  const stats =\n    `${G.order} nodes &middot; ${G.size} edges &middot; ${communityMap.size} communities`;\n\n  const html = `<!DOCTYPE html>\n<html lang=\"en\">\n<head>\n<meta charset=\"UTF-8\">\n<title>graphify - ${title}</title>\n<script src=\"https://unpkg.com/vis-network/standalone/umd/vis-network.min.js\"></script>\n${htmlStyles()}\n</head>\n<body>\n<div id=\"graph\"></div>\n<div id=\"sidebar\">\n  <div id=\"search-wrap\">\n    <input id=\"search\" type=\"text\" placeholder=\"Search nodes...\" autocomplete=\"off\">\n    <div id=\"search-results\"></div>\n  </div>\n  <div id=\"info-panel\">\n    <h3>Node Info</h3>\n    <div id=\"info-content\"><span class=\"empty\">Click a node to inspect it</span></div>\n  </div>\n  <div id=\"legend-wrap\">\n    <h3>Communities</h3>\n    <div id=\"legend\"></div>\n  </div>\n  <div id=\"stats\">${stats}</div>\n</div>\n${htmlScript(nodesJson, edgesJson, legendJson)}\n${hyperedgeScript(hyperedgesJson)}\n</body>\n</html>`;\n\n  writeFileSync(outputPath, html, \"utf-8\");\n}\n\n// ---------------------------------------------------------------------------\n// toGraphml\n// ---------------------------------------------------------------------------\n\nexport function toGraphml(\n  G: Graph,\n  communities: NumericMapLike<string[]>,\n  outputPath: string,\n): void {\n  const nodeComm = nodeCommunityMap(communities);\n\n  const xmlEsc = (s: string): string =>\n    s\n      .replace(/&/g, \"&amp;\")\n      .replace(/</g, \"&lt;\")\n      .replace(/>/g, \"&gt;\")\n      .replace(/\"/g, \"&quot;\")\n      .replace(/'/g, \"&apos;\");\n\n  const lines: string[] = [];\n  lines.push('<?xml version=\"1.0\" encoding=\"UTF-8\"?>');\n  lines.push(\n    '<graphml xmlns=\"http://graphml.graphstruct.org/graphml\"' +\n    ' xmlns:xsi=\"http://www.w3.org/2001/XMLSchema-instance\"' +\n    ' xsi:schemaLocation=\"http://graphml.graphstruct.org/graphml' +\n    ' http://graphml.graphstruct.org/graphml/1.0/graphml.xsd\">',\n  );\n\n  // Declare attribute keys\n  lines.push('  <key id=\"label\" for=\"node\" attr.name=\"label\" attr.type=\"string\"/>');\n  lines.push('  <key id=\"file_type\" for=\"node\" attr.name=\"file_type\" attr.type=\"string\"/>');\n  lines.push('  <key id=\"source_file\" for=\"node\" attr.name=\"source_file\" attr.type=\"string\"/>');\n  lines.push('  <key id=\"community\" for=\"node\" attr.name=\"community\" attr.type=\"int\"/>');\n  lines.push('  <key id=\"relation\" for=\"edge\" attr.name=\"relation\" attr.type=\"string\"/>');\n  lines.push('  <key id=\"confidence\" for=\"edge\" attr.name=\"confidence\" attr.type=\"string\"/>');\n\n  lines.push('  <graph id=\"G\" edgedefault=\"undirected\">');\n\n  G.forEachNode((nodeId, data) => {\n    lines.push(`    <node id=\"${xmlEsc(nodeId)}\">`);\n    lines.push(`      <data key=\"label\">${xmlEsc((data.label as string) ?? nodeId)}</data>`);\n    lines.push(`      <data key=\"file_type\">${xmlEsc((data.file_type as string) ?? \"\")}</data>`);\n    lines.push(`      <data key=\"source_file\">${xmlEsc((data.source_file as string) ?? \"\")}</data>`);\n    lines.push(`      <data key=\"community\">${nodeComm.get(nodeId) ?? -1}</data>`);\n    lines.push(\"    </node>\");\n  });\n\n  G.forEachEdge((_edge, data, source, target) => {\n    lines.push(`    <edge source=\"${xmlEsc(source)}\" target=\"${xmlEsc(target)}\">`);\n    lines.push(`      <data key=\"relation\">${xmlEsc((data.relation as string) ?? \"\")}</data>`);\n    lines.push(`      <data key=\"confidence\">${xmlEsc((data.confidence as string) ?? \"EXTRACTED\")}</data>`);\n    lines.push(\"    </edge>\");\n  });\n\n  lines.push(\"  </graph>\");\n  lines.push(\"</graphml>\");\n\n  writeFileSync(outputPath, lines.join(\"\\n\"), \"utf-8\");\n}\n\n// ---------------------------------------------------------------------------\n// toSvg - simple circle-layout SVG\n// ---------------------------------------------------------------------------\n\nexport function toSvg(\n  G: Graph,\n  communities: NumericMapLike<string[]>,\n  outputPath: string,\n  communityLabelsOrOptions?: CommunityLabelsInput | SvgOptions,\n  figsize: [number, number] = [20, 14],\n): void {\n  const communityMap = toNumericMap(communities);\n  const options = communityLabelsOrOptions && isSvgOptions(communityLabelsOrOptions)\n    ? communityLabelsOrOptions\n    : undefined;\n  const communityLabels = normalizeCommunityLabels(communityLabelsOrOptions);\n  const nodeComm = nodeCommunityMap(communityMap);\n  const figureSize = options?.figsize ?? figsize;\n  const [widthIn, heightIn] = figureSize;\n  const width = widthIn * 60;\n  const height = heightIn * 60;\n  const cx = width / 2;\n  const cy = height / 2;\n  const radius = Math.min(cx, cy) * 0.8;\n\n  const nodeList = G.nodes();\n  const n = nodeList.length;\n\n  // Compute positions using a simple circle layout\n  const pos = new Map<string, [number, number]>();\n  for (let i = 0; i < n; i++) {\n    const angle = (2 * Math.PI * i) / Math.max(n, 1);\n    pos.set(nodeList[i]!, [\n      cx + radius * Math.cos(angle),\n      cy + radius * Math.sin(angle),\n    ]);\n  }\n\n  const degree = new Map<string, number>();\n  G.forEachNode((node) => degree.set(node, G.degree(node)));\n  const maxDeg = Math.max(1, ...degree.values());\n\n  const xmlEsc = (s: string): string =>\n    s\n      .replace(/&/g, \"&amp;\")\n      .replace(/</g, \"&lt;\")\n      .replace(/>/g, \"&gt;\")\n      .replace(/\"/g, \"&quot;\");\n\n  const svgParts: string[] = [];\n  svgParts.push(\n    `<svg xmlns=\"http://www.w3.org/2000/svg\" viewBox=\"0 0 ${width} ${height}\" ` +\n    `width=\"${width}\" height=\"${height}\" style=\"background:#1a1a2e\">`,\n  );\n\n  // Draw edges\n  G.forEachEdge((_edge, data, u, v) => {\n    const [x1, y1] = pos.get(u) ?? [0, 0];\n    const [x2, y2] = pos.get(v) ?? [0, 0];\n    const conf = (data.confidence as string) ?? \"EXTRACTED\";\n    const dasharray = conf === \"EXTRACTED\" ? \"\" : ' stroke-dasharray=\"4,4\"';\n    const opacity = conf === \"EXTRACTED\" ? 0.6 : 0.3;\n    svgParts.push(\n      `  <line x1=\"${x1}\" y1=\"${y1}\" x2=\"${x2}\" y2=\"${y2}\" ` +\n      `stroke=\"#aaaaaa\" stroke-width=\"0.8\" opacity=\"${opacity}\"${dasharray}/>`,\n    );\n  });\n\n  // Draw nodes\n  for (const nodeId of nodeList) {\n    const [x, y] = pos.get(nodeId) ?? [0, 0];\n    const cid = nodeComm.get(nodeId) ?? 0;\n    const color = COMMUNITY_COLORS[cid % COMMUNITY_COLORS.length]!;\n    const deg = degree.get(nodeId) ?? 1;\n    const r = 4 + 12 * (deg / maxDeg);\n    svgParts.push(\n      `  <circle cx=\"${x}\" cy=\"${y}\" r=\"${r}\" fill=\"${color}\" opacity=\"0.9\"/>`,\n    );\n    const label = (G.getNodeAttribute(nodeId, \"label\") as string) ?? nodeId;\n    svgParts.push(\n      `  <text x=\"${x}\" y=\"${y + r + 10}\" text-anchor=\"middle\" ` +\n      `fill=\"white\" font-size=\"7\" font-family=\"sans-serif\">${xmlEsc(label)}</text>`,\n    );\n  }\n\n  // Legend\n  if (communityLabels) {\n    const sortedKeys = [...communityLabels.keys()].sort((a, b) => a - b);\n    let ly = 20;\n    for (const cid of sortedKeys) {\n      const color = COMMUNITY_COLORS[cid % COMMUNITY_COLORS.length]!;\n      const label = communityLabels.get(cid) ?? `Community ${cid}`;\n      const count = communityMap.get(cid)?.length ?? 0;\n      svgParts.push(\n        `  <circle cx=\"20\" cy=\"${ly}\" r=\"5\" fill=\"${color}\"/>`,\n      );\n      svgParts.push(\n        `  <text x=\"30\" y=\"${ly + 4}\" fill=\"white\" font-size=\"8\" ` +\n        `font-family=\"sans-serif\">${xmlEsc(label)} (${count})</text>`,\n      );\n      ly += 18;\n    }\n  }\n\n  svgParts.push(\"</svg>\");\n  writeFileSync(outputPath, svgParts.join(\"\\n\"), \"utf-8\");\n}\n\n// ---------------------------------------------------------------------------\n// toCanvas - Obsidian .canvas JSON\n// ---------------------------------------------------------------------------\n\nexport function toCanvas(\n  G: Graph,\n  communities: NumericMapLike<string[]>,\n  outputPath: string,\n  communityLabelsOrOptions?: CommunityLabelsInput | CanvasOptions,\n  nodeFilenames?: StringMapLike<string>,\n): void {\n  const communityMap = toNumericMap(communities);\n  const options = communityLabelsOrOptions && isCanvasOptions(communityLabelsOrOptions)\n    ? communityLabelsOrOptions\n    : undefined;\n  const communityLabels = normalizeCommunityLabels(communityLabelsOrOptions);\n  const providedNodeFilenames = options?.nodeFilenames ?? nodeFilenames;\n  const CANVAS_COLORS = [\"1\", \"2\", \"3\", \"4\", \"5\", \"6\"];\n\n  function safeName(label: string): string {\n    return label.replace(/[\\\\/*?:\"<>|#^[\\]]/g, \"\").trim() || \"unnamed\";\n  }\n\n  // Build nodeFilenames if not provided\n  let filenameMap: Map<string, string>;\n  if (!providedNodeFilenames) {\n    filenameMap = new Map<string, string>();\n    const seenNames = new Map<string, number>();\n    G.forEachNode((nodeId, data) => {\n      const base = safeName((data.label as string) ?? nodeId);\n      const count = seenNames.get(base);\n      if (count !== undefined) {\n        const next = count + 1;\n        seenNames.set(base, next);\n        filenameMap.set(nodeId, `${base}_${next}`);\n      } else {\n        seenNames.set(base, 0);\n        filenameMap.set(nodeId, base);\n      }\n    });\n  } else {\n    filenameMap = toStringMap(providedNodeFilenames);\n  }\n\n  const numCommunities = communityMap.size;\n  const cols = numCommunities > 0 ? Math.ceil(Math.sqrt(numCommunities)) : 1;\n  const rows = numCommunities > 0 ? Math.ceil(numCommunities / cols) : 1;\n\n  const canvasNodes: Record<string, unknown>[] = [];\n  const canvasEdges: Record<string, unknown>[] = [];\n\n  const sortedCids = [...communityMap.keys()].sort((a, b) => a - b);\n\n  // Precompute group sizes\n  const groupSizes = new Map<number, [number, number]>();\n  for (const cid of sortedCids) {\n    const members = communityMap.get(cid) ?? [];\n    const memberCount = members.length;\n    const w = Math.max(600, memberCount > 0 ? 220 * Math.ceil(Math.sqrt(memberCount)) : 600);\n    const h = Math.max(400, memberCount > 0 ? 100 * Math.ceil(memberCount / 3) + 120 : 400);\n    groupSizes.set(cid, [w, h]);\n  }\n\n  // Compute column widths and row heights\n  const gap = 80;\n  const colWidths: number[] = [];\n  for (let colIdx = 0; colIdx < cols; colIdx++) {\n    let maxW = 0;\n    for (let rowIdx = 0; rowIdx < rows; rowIdx++) {\n      const linear = rowIdx * cols + colIdx;\n      if (linear < sortedCids.length) {\n        const cid = sortedCids[linear]!;\n        const [w] = groupSizes.get(cid) ?? [600, 400];\n        maxW = Math.max(maxW, w);\n      }\n    }\n    colWidths.push(maxW);\n  }\n\n  const rowHeights: number[] = [];\n  for (let rowIdx = 0; rowIdx < rows; rowIdx++) {\n    let maxH = 0;\n    for (let colIdx = 0; colIdx < cols; colIdx++) {\n      const linear = rowIdx * cols + colIdx;\n      if (linear < sortedCids.length) {\n        const cid = sortedCids[linear]!;\n        const [, h] = groupSizes.get(cid) ?? [600, 400];\n        maxH = Math.max(maxH, h);\n      }\n    }\n    rowHeights.push(maxH);\n  }\n\n  // Map from cid -> layout\n  const groupLayout = new Map<number, [number, number, number, number]>();\n  for (let idx = 0; idx < sortedCids.length; idx++) {\n    const cid = sortedCids[idx]!;\n    const colIdx = idx % cols;\n    const rowIdx = Math.floor(idx / cols);\n    const gx = colWidths.slice(0, colIdx).reduce((a, b) => a + b, 0) + colIdx * gap;\n    const gy = rowHeights.slice(0, rowIdx).reduce((a, b) => a + b, 0) + rowIdx * gap;\n    const [gw, gh] = groupSizes.get(cid) ?? [600, 400];\n    groupLayout.set(cid, [gx, gy, gw, gh]);\n  }\n\n  // Collect all node IDs in canvas\n  const allCanvasNodeIds = new Set<string>();\n  for (const members of communityMap.values()) {\n    for (const m of members) allCanvasNodeIds.add(m);\n  }\n\n  // Generate group and node canvas entries\n  for (let idx = 0; idx < sortedCids.length; idx++) {\n    const cid = sortedCids[idx]!;\n    const members = communityMap.get(cid) ?? [];\n    const communityName = communityLabels?.get(cid) ?? `Community ${cid}`;\n    const [gx, gy, gw, gh] = groupLayout.get(cid) ?? [0, 0, 600, 400];\n    const canvasColor = CANVAS_COLORS[idx % CANVAS_COLORS.length]!;\n\n    // Group node\n    canvasNodes.push({\n      id: `g${cid}`,\n      type: \"group\",\n      label: communityName,\n      x: gx,\n      y: gy,\n      width: gw,\n      height: gh,\n      color: canvasColor,\n    });\n\n    // Node cards inside the group\n    const sortedMembers = [...members].sort((a, b) => {\n      const la = (G.getNodeAttribute(a, \"label\") as string) ?? a;\n      const lb = (G.getNodeAttribute(b, \"label\") as string) ?? b;\n      return la.localeCompare(lb);\n    });\n    for (let mIdx = 0; mIdx < sortedMembers.length; mIdx++) {\n      const nodeId = sortedMembers[mIdx]!;\n      const col = mIdx % 3;\n      const row = Math.floor(mIdx / 3);\n      const nx = gx + 20 + col * (180 + 20);\n      const ny = gy + 80 + row * (60 + 20);\n      const fname =\n        filenameMap.get(nodeId) ??\n        safeName((G.getNodeAttribute(nodeId, \"label\") as string) ?? nodeId);\n      canvasNodes.push({\n        id: `n_${nodeId}`,\n        type: \"file\",\n        file: `graphify/obsidian/${fname}.md`,\n        x: nx,\n        y: ny,\n        width: 180,\n        height: 60,\n      });\n    }\n  }\n\n  // Generate edges - only between nodes both in canvas, cap at 200 highest-weight\n  const allEdgesWeighted: [number, string, string, string][] = [];\n  G.forEachEdge((_edge, edata, u, v) => {\n    if (allCanvasNodeIds.has(u) && allCanvasNodeIds.has(v)) {\n      const weight = (edata.weight as number) ?? 1.0;\n      const relation = (edata.relation as string) ?? \"\";\n      const conf = (edata.confidence as string) ?? \"EXTRACTED\";\n      const label = relation ? `${relation} [${conf}]` : `[${conf}]`;\n      allEdgesWeighted.push([weight, u, v, label]);\n    }\n  });\n\n  allEdgesWeighted.sort((a, b) => b[0] - a[0]);\n  for (const [, u, v, label] of allEdgesWeighted.slice(0, 200)) {\n    canvasEdges.push({\n      id: `e_${u}_${v}`,\n      fromNode: `n_${u}`,\n      toNode: `n_${v}`,\n      label,\n    });\n  }\n\n  const canvasData = { nodes: canvasNodes, edges: canvasEdges };\n  writeFileSync(outputPath, JSON.stringify(canvasData, null, 2), \"utf-8\");\n}\n","/**\n * Per-file extraction cache - skip unchanged files on re-run.\n */\nimport { createHash } from \"node:crypto\";\nimport { readFileSync, writeFileSync, mkdirSync, readdirSync, unlinkSync, renameSync, existsSync } from \"node:fs\";\nimport { join, resolve } from \"node:path\";\n\n/** SHA256 of file contents + resolved path. Prevents cache collisions on identical content. */\nexport function fileHash(filePath: string): string {\n  const content = readFileSync(filePath);\n  const resolved = resolve(filePath);\n  const h = createHash(\"sha256\");\n  h.update(content);\n  h.update(\"\\0\");\n  h.update(resolved);\n  return h.digest(\"hex\");\n}\n\n/** Returns graphify-out/cache/ path - creates it if needed. */\nexport function cacheDir(root: string = \".\"): string {\n  const d = join(root, \"graphify-out\", \"cache\");\n  mkdirSync(d, { recursive: true });\n  return d;\n}\n\n/**\n * Return cached extraction for this file if hash matches, else null.\n */\nexport function loadCached(filePath: string, root: string = \".\"): Record<string, unknown> | null {\n  let h: string;\n  try {\n    h = fileHash(filePath);\n  } catch {\n    return null;\n  }\n  const entry = join(cacheDir(root), `${h}.json`);\n  if (!existsSync(entry)) return null;\n  try {\n    return JSON.parse(readFileSync(entry, \"utf-8\")) as Record<string, unknown>;\n  } catch {\n    return null;\n  }\n}\n\n/** Save extraction result for this file. */\nexport function saveCached(filePath: string, result: Record<string, unknown>, root: string = \".\"): void {\n  const h = fileHash(filePath);\n  const entry = join(cacheDir(root), `${h}.json`);\n  const tmp = entry + \".tmp\";\n  try {\n    writeFileSync(tmp, JSON.stringify(result));\n    renameSync(tmp, entry);\n  } catch {\n    try { unlinkSync(tmp); } catch { /* ignore */ }\n    throw new Error(`Failed to save cache for ${filePath}`);\n  }\n}\n\n/** Return set of file hashes that have a valid cache entry. */\nexport function cachedFiles(root: string = \".\"): Set<string> {\n  const d = cacheDir(root);\n  const result = new Set<string>();\n  try {\n    for (const f of readdirSync(d)) {\n      if (f.endsWith(\".json\")) {\n        result.add(f.replace(\".json\", \"\"));\n      }\n    }\n  } catch { /* ignore */ }\n  return result;\n}\n\n/** Delete all graphify-out/cache/*.json files. */\nexport function clearCache(root: string = \".\"): void {\n  const d = cacheDir(root);\n  try {\n    for (const f of readdirSync(d)) {\n      if (f.endsWith(\".json\")) {\n        unlinkSync(join(d, f));\n      }\n    }\n  } catch { /* ignore */ }\n}\n\ninterface ExtractionPart {\n  nodes: Array<Record<string, unknown>>;\n  edges: Array<Record<string, unknown>>;\n  hyperedges: Array<Record<string, unknown>>;\n}\n\n/**\n * Check semantic extraction cache for a list of file paths.\n * Returns [cachedNodes, cachedEdges, cachedHyperedges, uncachedFiles].\n */\nexport function checkSemanticCache(\n  files: string[],\n  root: string = \".\",\n): [Array<Record<string, unknown>>, Array<Record<string, unknown>>, Array<Record<string, unknown>>, string[]] {\n  const cachedNodes: Array<Record<string, unknown>> = [];\n  const cachedEdges: Array<Record<string, unknown>> = [];\n  const cachedHyperedges: Array<Record<string, unknown>> = [];\n  const uncached: string[] = [];\n\n  for (const fpath of files) {\n    const result = loadCached(fpath, root);\n    if (result !== null) {\n      const r = result as unknown as ExtractionPart;\n      cachedNodes.push(...(r.nodes ?? []));\n      cachedEdges.push(...(r.edges ?? []));\n      cachedHyperedges.push(...(r.hyperedges ?? []));\n    } else {\n      uncached.push(fpath);\n    }\n  }\n\n  return [cachedNodes, cachedEdges, cachedHyperedges, uncached];\n}\n\n/**\n * Save semantic extraction results to cache, keyed by source_file.\n * Returns the number of files cached.\n */\nexport function saveSemanticCache(\n  nodes: Array<Record<string, unknown>>,\n  edges: Array<Record<string, unknown>>,\n  hyperedges: Array<Record<string, unknown>> | null = null,\n  root: string = \".\",\n): number {\n  const byFile = new Map<string, ExtractionPart>();\n\n  for (const n of nodes) {\n    const src = (n.source_file as string) ?? \"\";\n    if (!src) continue;\n    if (!byFile.has(src)) byFile.set(src, { nodes: [], edges: [], hyperedges: [] });\n    byFile.get(src)!.nodes.push(n);\n  }\n  for (const e of edges) {\n    const src = (e.source_file as string) ?? \"\";\n    if (!src) continue;\n    if (!byFile.has(src)) byFile.set(src, { nodes: [], edges: [], hyperedges: [] });\n    byFile.get(src)!.edges.push(e);\n  }\n  for (const h of hyperedges ?? []) {\n    const src = (h.source_file as string) ?? \"\";\n    if (!src) continue;\n    if (!byFile.has(src)) byFile.set(src, { nodes: [], edges: [], hyperedges: [] });\n    byFile.get(src)!.hyperedges.push(h);\n  }\n\n  let saved = 0;\n  for (const [fpath, result] of byFile) {\n    const p = resolve(root, fpath);\n    if (existsSync(p)) {\n      saveCached(p, result as unknown as Record<string, unknown>, root);\n      saved++;\n    }\n  }\n  return saved;\n}\n","/**\n * Deterministic structural extraction from source code using tree-sitter.\n * Outputs nodes + edges dicts.\n *\n * TypeScript port of graphify/extract.py — uses web-tree-sitter (WASM) instead\n * of Python's native tree-sitter bindings.\n */\n\nimport { readFileSync, readdirSync, lstatSync, realpathSync, existsSync } from \"node:fs\";\nimport { resolve, basename, extname, dirname, join, sep } from \"node:path\";\nimport { createRequire } from \"node:module\";\nimport type { GraphNode, GraphEdge, Extraction } from \"./types.js\";\nimport { loadCached, saveCached } from \"./cache.js\";\n\n// ---------------------------------------------------------------------------\n// web-tree-sitter types  (re-exported from the package)\n// ---------------------------------------------------------------------------\nimport * as TreeSitter from \"web-tree-sitter\";\ntype SyntaxNode = TreeSitter.Node;\ntype Tree = TreeSitter.Tree;\n\nconst Parser = (\n  (TreeSitter as unknown as { Parser?: typeof TreeSitter.Parser }).Parser ??\n  (TreeSitter as unknown as { default?: typeof TreeSitter.Parser }).default\n)!;\n\n// ---------------------------------------------------------------------------\n// Helpers\n// ---------------------------------------------------------------------------\n\nlet _parserInitialized = false;\n\nfunction getModuleRequire(): NodeJS.Require {\n  try {\n    return createRequire(import.meta.url);\n  } catch {\n    return require;\n  }\n}\n\nconst moduleRequire = getModuleRequire();\n\nasync function ensureParserInit(): Promise<void> {\n  if (!_parserInitialized) {\n    await Parser.init();\n    _parserInitialized = true;\n  }\n}\n\nfunction parseText(parser: InstanceType<typeof Parser>, source: string): Tree {\n  const tree = parser.parse(source);\n  if (!tree) {\n    throw new Error(\"Parser returned null\");\n  }\n  return tree;\n}\n\n/** Try to locate a WASM grammar file. Returns the resolved path or null. */\nfunction resolveGrammarWasm(langName: string): string | null {\n  const packageName = new Map<string, string>([\n    [\"c_sharp\", \"c-sharp\"],\n  ]).get(langName) ?? langName;\n  // Try common npm package conventions\n  const candidates = [\n    `tree-sitter-${packageName}/tree-sitter-${langName}.wasm`,\n    `tree-sitter-${packageName}/tree-sitter-${packageName}.wasm`,\n    `tree-sitter-${packageName}/tree_sitter_${langName}.wasm`,\n    `tree-sitter-${packageName}/tree_sitter_${packageName.replace(/-/g, \"_\")}.wasm`,\n    `tree-sitter-${packageName}/${langName}.wasm`,\n    `tree-sitter-${packageName}/${packageName}.wasm`,\n  ];\n  for (const candidate of candidates) {\n    try {\n      const resolved = moduleRequire.resolve(candidate);\n      if (existsSync(resolved)) return resolved;\n    } catch {\n      /* not found via require.resolve — skip */\n    }\n  }\n  // Also try a path relative to node_modules\n  const nmDir = join(process.cwd(), \"node_modules\");\n  for (const candidate of candidates) {\n    const p = join(nmDir, candidate);\n    if (existsSync(p)) return p;\n  }\n  return null;\n}\n\n/**\n * Cache of loaded Parser.Language instances keyed by language name.\n * Avoids re-reading WASM files on every file extraction.\n */\nconst _languageCache = new Map<string, TreeSitter.Language>();\n\nasync function loadLanguage(langName: string): Promise<TreeSitter.Language | null> {\n  if (_languageCache.has(langName)) return _languageCache.get(langName)!;\n  const wasmPath = resolveGrammarWasm(langName);\n  if (!wasmPath) return null;\n  try {\n    const lang = await TreeSitter.Language.load(wasmPath);\n    _languageCache.set(langName, lang);\n    return lang;\n  } catch {\n    return null;\n  }\n}\n\n/** Build a stable node ID from one or more name parts. */\nfunction _makeId(...parts: string[]): string {\n  const combined = parts\n    .filter(Boolean)\n    .map((p) => p.replace(/^[_.]+|[_.]+$/g, \"\"))\n    .join(\"_\");\n  const cleaned = combined.replace(/[^a-zA-Z0-9]+/g, \"_\");\n  return cleaned.replace(/^_+|_+$/g, \"\").toLowerCase();\n}\n\nfunction _readText(node: SyntaxNode, source: string): string {\n  return source.slice(node.startIndex, node.endIndex);\n}\n\n// ---------------------------------------------------------------------------\n// LanguageConfig interface + generic helpers\n// ---------------------------------------------------------------------------\n\ntype ImportHandler = (\n  node: SyntaxNode,\n  source: string,\n  fileNid: string,\n  stem: string,\n  edges: GraphEdge[],\n  strPath: string,\n) => void;\n\ntype ResolveFunctionNameFn = (node: SyntaxNode, source: string) => string | null;\n\ntype ExtraWalkFn = (\n  node: SyntaxNode,\n  source: string,\n  fileNid: string,\n  stem: string,\n  strPath: string,\n  nodes: GraphNode[],\n  edges: GraphEdge[],\n  seenIds: Set<string>,\n  functionBodies: Array<[string, SyntaxNode]>,\n  parentClassNid: string | null,\n  addNodeFn: (nid: string, label: string, line: number) => void,\n  addEdgeFn: (src: string, tgt: string, relation: string, line: number) => void,\n  walkFn?: (node: SyntaxNode, parentClassNid: string | null) => void,\n) => boolean;\n\ninterface LanguageConfig {\n  tsGrammarName: string; // e.g. \"python\"\n  tsModule: string; // original Python module name — used for language-specific branches\n\n  classTypes: Set<string>;\n  functionTypes: Set<string>;\n  importTypes: Set<string>;\n  callTypes: Set<string>;\n\n  nameField: string;\n  nameFallbackChildTypes: string[];\n\n  bodyField: string;\n  bodyFallbackChildTypes: string[];\n\n  callFunctionField: string;\n  callAccessorNodeTypes: Set<string>;\n  callAccessorField: string;\n\n  functionBoundaryTypes: Set<string>;\n\n  importHandler: ImportHandler | null;\n  resolveFunctionNameFn: ResolveFunctionNameFn | null;\n\n  functionLabelParens: boolean;\n\n  extraWalkFn: ExtraWalkFn | null;\n}\n\nfunction defaultConfig(overrides: Partial<LanguageConfig> & Pick<LanguageConfig, \"tsGrammarName\" | \"tsModule\">): LanguageConfig {\n  return {\n    classTypes: new Set(),\n    functionTypes: new Set(),\n    importTypes: new Set(),\n    callTypes: new Set(),\n    nameField: \"name\",\n    nameFallbackChildTypes: [],\n    bodyField: \"body\",\n    bodyFallbackChildTypes: [],\n    callFunctionField: \"function\",\n    callAccessorNodeTypes: new Set(),\n    callAccessorField: \"attribute\",\n    functionBoundaryTypes: new Set(),\n    importHandler: null,\n    resolveFunctionNameFn: null,\n    functionLabelParens: true,\n    extraWalkFn: null,\n    ...overrides,\n  };\n}\n\n// ---------------------------------------------------------------------------\n// Generic helpers for name / body resolution\n// ---------------------------------------------------------------------------\n\nfunction _resolveName(node: SyntaxNode, source: string, config: LanguageConfig): string | null {\n  if (config.resolveFunctionNameFn !== null) {\n    return null; // caller handles this separately\n  }\n  const n = node.childForFieldName(config.nameField);\n  if (n) return _readText(n, source);\n  for (const child of node.children) {\n    if (config.nameFallbackChildTypes.includes(child.type)) {\n      return _readText(child, source);\n    }\n  }\n  return null;\n}\n\nfunction _findBody(node: SyntaxNode, config: LanguageConfig): SyntaxNode | null {\n  const b = node.childForFieldName(config.bodyField);\n  if (b) return b;\n  for (const child of node.children) {\n    if (config.bodyFallbackChildTypes.includes(child.type)) {\n      return child;\n    }\n  }\n  return null;\n}\n\n// ---------------------------------------------------------------------------\n// Import handlers\n// ---------------------------------------------------------------------------\n\nfunction _importPython(\n  node: SyntaxNode, source: string, fileNid: string, _stem: string,\n  edges: GraphEdge[], strPath: string,\n): void {\n  const t = node.type;\n  if (t === \"import_statement\") {\n    for (const child of node.children) {\n      if (child.type === \"dotted_name\" || child.type === \"aliased_import\") {\n        const raw = _readText(child, source);\n        const moduleName = raw.split(\" as \")[0]!.trim().replace(/^\\.+/, \"\");\n        const tgtNid = _makeId(moduleName);\n        edges.push({\n          source: fileNid, target: tgtNid, relation: \"imports\",\n          confidence: \"EXTRACTED\", source_file: strPath,\n          source_location: `L${node.startPosition.row + 1}`, weight: 1.0,\n        });\n      }\n    }\n  } else if (t === \"import_from_statement\") {\n    const moduleNode = node.childForFieldName(\"module_name\");\n    if (moduleNode) {\n      const raw = _readText(moduleNode, source).replace(/^\\.+/, \"\");\n      const tgtNid = _makeId(raw);\n      edges.push({\n        source: fileNid, target: tgtNid, relation: \"imports_from\",\n        confidence: \"EXTRACTED\", source_file: strPath,\n        source_location: `L${node.startPosition.row + 1}`, weight: 1.0,\n      });\n    }\n  }\n}\n\nfunction _importJs(\n  node: SyntaxNode, source: string, fileNid: string, _stem: string,\n  edges: GraphEdge[], strPath: string,\n): void {\n  for (const child of node.children) {\n    if (child.type === \"string\") {\n      const raw = _readText(child, source).replace(/^['\"`\\s]+|['\"`\\s]+$/g, \"\");\n      const moduleName = raw.replace(/^\\.\\/|^\\.\\.\\//, \"\").split(\"/\").pop() ?? \"\";\n      if (moduleName) {\n        const tgtNid = _makeId(moduleName);\n        edges.push({\n          source: fileNid, target: tgtNid, relation: \"imports_from\",\n          confidence: \"EXTRACTED\", source_file: strPath,\n          source_location: `L${node.startPosition.row + 1}`, weight: 1.0,\n        });\n      }\n      break;\n    }\n  }\n}\n\nfunction _importJava(\n  node: SyntaxNode, source: string, fileNid: string, _stem: string,\n  edges: GraphEdge[], strPath: string,\n): void {\n  function walkScoped(n: SyntaxNode): string {\n    const parts: string[] = [];\n    let cur: SyntaxNode | null = n;\n    while (cur) {\n      if (cur.type === \"scoped_identifier\") {\n        const nameNode = cur.childForFieldName(\"name\");\n        if (nameNode) parts.push(_readText(nameNode, source));\n        cur = cur.childForFieldName(\"scope\");\n      } else if (cur.type === \"identifier\") {\n        parts.push(_readText(cur, source));\n        break;\n      } else {\n        break;\n      }\n    }\n    parts.reverse();\n    return parts.join(\".\");\n  }\n\n  for (const child of node.children) {\n    if (child.type === \"scoped_identifier\" || child.type === \"identifier\") {\n      const pathStr = walkScoped(child);\n      const pathParts = pathStr.split(\".\");\n      let moduleName = pathParts[pathParts.length - 1]!.replace(/\\*/g, \"\").replace(/\\.+$/, \"\").trim();\n      if (!moduleName && pathParts.length > 1) {\n        moduleName = pathParts[pathParts.length - 2]!;\n      }\n      if (!moduleName) moduleName = pathStr;\n      if (moduleName) {\n        const tgtNid = _makeId(moduleName);\n        edges.push({\n          source: fileNid, target: tgtNid, relation: \"imports\",\n          confidence: \"EXTRACTED\", source_file: strPath,\n          source_location: `L${node.startPosition.row + 1}`, weight: 1.0,\n        });\n      }\n      break;\n    }\n  }\n}\n\nfunction _importC(\n  node: SyntaxNode, source: string, fileNid: string, _stem: string,\n  edges: GraphEdge[], strPath: string,\n): void {\n  for (const child of node.children) {\n    if ([\"string_literal\", \"system_lib_string\", \"string\"].includes(child.type)) {\n      const raw = _readText(child, source).replace(/^[\"<>\\s]+|[\"<>\\s]+$/g, \"\");\n      const moduleName = raw.split(\"/\").pop()!.split(\".\")[0]!;\n      if (moduleName) {\n        const tgtNid = _makeId(moduleName);\n        edges.push({\n          source: fileNid, target: tgtNid, relation: \"imports\",\n          confidence: \"EXTRACTED\", source_file: strPath,\n          source_location: `L${node.startPosition.row + 1}`, weight: 1.0,\n        });\n      }\n      break;\n    }\n  }\n}\n\nfunction _importCsharp(\n  node: SyntaxNode, source: string, fileNid: string, _stem: string,\n  edges: GraphEdge[], strPath: string,\n): void {\n  for (const child of node.children) {\n    if ([\"qualified_name\", \"identifier\", \"name_equals\"].includes(child.type)) {\n      const raw = _readText(child, source);\n      const moduleName = raw.split(\".\").pop()!.trim();\n      if (moduleName) {\n        const tgtNid = _makeId(moduleName);\n        edges.push({\n          source: fileNid, target: tgtNid, relation: \"imports\",\n          confidence: \"EXTRACTED\", source_file: strPath,\n          source_location: `L${node.startPosition.row + 1}`, weight: 1.0,\n        });\n      }\n      break;\n    }\n  }\n}\n\nfunction _importKotlin(\n  node: SyntaxNode, source: string, fileNid: string, _stem: string,\n  edges: GraphEdge[], strPath: string,\n): void {\n  const pathNode = node.childForFieldName(\"path\");\n  if (pathNode) {\n    const raw = _readText(pathNode, source);\n    const moduleName = raw.split(\".\").pop()!.trim();\n    if (moduleName) {\n      const tgtNid = _makeId(moduleName);\n      edges.push({\n        source: fileNid, target: tgtNid, relation: \"imports\",\n        confidence: \"EXTRACTED\", source_file: strPath,\n        source_location: `L${node.startPosition.row + 1}`, weight: 1.0,\n      });\n    }\n    return;\n  }\n  // Fallback: find identifier child\n  for (const child of node.children) {\n    if (child.type === \"identifier\") {\n      const raw = _readText(child, source);\n      const tgtNid = _makeId(raw);\n      edges.push({\n        source: fileNid, target: tgtNid, relation: \"imports\",\n        confidence: \"EXTRACTED\", source_file: strPath,\n        source_location: `L${node.startPosition.row + 1}`, weight: 1.0,\n      });\n      break;\n    }\n  }\n}\n\nfunction _importScala(\n  node: SyntaxNode, source: string, fileNid: string, _stem: string,\n  edges: GraphEdge[], strPath: string,\n): void {\n  for (const child of node.children) {\n    if (child.type === \"stable_id\" || child.type === \"identifier\") {\n      const raw = _readText(child, source);\n      const moduleName = raw.split(\".\").pop()!.replace(/[{}\\s]/g, \"\").trim();\n      if (moduleName && moduleName !== \"_\") {\n        const tgtNid = _makeId(moduleName);\n        edges.push({\n          source: fileNid, target: tgtNid, relation: \"imports\",\n          confidence: \"EXTRACTED\", source_file: strPath,\n          source_location: `L${node.startPosition.row + 1}`, weight: 1.0,\n        });\n      }\n      break;\n    }\n  }\n}\n\nfunction _importPhp(\n  node: SyntaxNode, source: string, fileNid: string, _stem: string,\n  edges: GraphEdge[], strPath: string,\n): void {\n  for (const child of node.children) {\n    if ([\"qualified_name\", \"name\", \"identifier\"].includes(child.type)) {\n      const raw = _readText(child, source);\n      const moduleName = raw.split(\"\\\\\").pop()!.trim();\n      if (moduleName) {\n        const tgtNid = _makeId(moduleName);\n        edges.push({\n          source: fileNid, target: tgtNid, relation: \"imports\",\n          confidence: \"EXTRACTED\", source_file: strPath,\n          source_location: `L${node.startPosition.row + 1}`, weight: 1.0,\n        });\n      }\n      break;\n    }\n  }\n}\n\nfunction _importLua(\n  node: SyntaxNode, source: string, fileNid: string, _stem: string,\n  edges: GraphEdge[], strPath: string,\n): void {\n  const text = _readText(node, source);\n  const m = text.match(/require\\s*[('\"]?\\s*['\"]?([^'\")\\s]+)/);\n  if (m) {\n    const moduleName = m[1]!.split(\".\").pop()!;\n    if (moduleName) {\n      edges.push({\n        source: fileNid, target: moduleName, relation: \"imports\",\n        confidence: \"EXTRACTED\", source_file: strPath,\n        source_location: String(node.startPosition.row + 1), weight: 1.0,\n      });\n    }\n  }\n}\n\nfunction _importSwift(\n  node: SyntaxNode, source: string, fileNid: string, _stem: string,\n  edges: GraphEdge[], strPath: string,\n): void {\n  for (const child of node.children) {\n    if (child.type === \"identifier\") {\n      const raw = _readText(child, source);\n      const tgtNid = _makeId(raw);\n      edges.push({\n        source: fileNid, target: tgtNid, relation: \"imports\",\n        confidence: \"EXTRACTED\", source_file: strPath,\n        source_location: `L${node.startPosition.row + 1}`, weight: 1.0,\n      });\n      break;\n    }\n  }\n}\n\n// ---------------------------------------------------------------------------\n// C/C++ function name helpers\n// ---------------------------------------------------------------------------\n\nfunction _getCFuncName(node: SyntaxNode, source: string): string | null {\n  if (node.type === \"identifier\") return _readText(node, source);\n  const decl = node.childForFieldName(\"declarator\");\n  if (decl) return _getCFuncName(decl, source);\n  for (const child of node.children) {\n    if (child.type === \"identifier\") return _readText(child, source);\n  }\n  return null;\n}\n\nfunction _getCppFuncName(node: SyntaxNode, source: string): string | null {\n  if (node.type === \"identifier\") return _readText(node, source);\n  if (node.type === \"qualified_identifier\") {\n    const nameNode = node.childForFieldName(\"name\");\n    if (nameNode) return _readText(nameNode, source);\n  }\n  const decl = node.childForFieldName(\"declarator\");\n  if (decl) return _getCppFuncName(decl, source);\n  for (const child of node.children) {\n    if (child.type === \"identifier\") return _readText(child, source);\n  }\n  return null;\n}\n\n// ---------------------------------------------------------------------------\n// JS/TS extra walk for arrow functions\n// ---------------------------------------------------------------------------\n\nfunction _jsExtraWalk(\n  node: SyntaxNode, source: string, fileNid: string, stem: string, _strPath: string,\n  _nodes: GraphNode[], _edges: GraphEdge[], _seenIds: Set<string>,\n  functionBodies: Array<[string, SyntaxNode]>,\n  _parentClassNid: string | null,\n  addNodeFn: (nid: string, label: string, line: number) => void,\n  addEdgeFn: (src: string, tgt: string, relation: string, line: number) => void,\n): boolean {\n  if (node.type === \"lexical_declaration\") {\n    for (const child of node.children) {\n      if (child.type === \"variable_declarator\") {\n        const value = child.childForFieldName(\"value\");\n        if (value && value.type === \"arrow_function\") {\n          const nameNode = child.childForFieldName(\"name\");\n          if (nameNode) {\n            const funcName = _readText(nameNode, source);\n            const line = child.startPosition.row + 1;\n            const funcNid = _makeId(stem, funcName);\n            addNodeFn(funcNid, `${funcName}()`, line);\n            addEdgeFn(fileNid, funcNid, \"contains\", line);\n            const body = value.childForFieldName(\"body\");\n            if (body) {\n              functionBodies.push([funcNid, body]);\n            }\n          }\n        }\n      }\n    }\n    return true;\n  }\n  return false;\n}\n\n// ---------------------------------------------------------------------------\n// C# extra walk for namespace declarations\n// ---------------------------------------------------------------------------\n\nfunction _csharpExtraWalk(\n  node: SyntaxNode, source: string, fileNid: string, stem: string, _strPath: string,\n  _nodes: GraphNode[], _edges: GraphEdge[], _seenIds: Set<string>,\n  _functionBodies: Array<[string, SyntaxNode]>,\n  parentClassNid: string | null,\n  addNodeFn: (nid: string, label: string, line: number) => void,\n  addEdgeFn: (src: string, tgt: string, relation: string, line: number) => void,\n  walkFn?: (node: SyntaxNode, parentClassNid: string | null) => void,\n): boolean {\n  if (node.type === \"namespace_declaration\") {\n    const nameNode = node.childForFieldName(\"name\");\n    if (nameNode) {\n      const nsName = _readText(nameNode, source);\n      const nsNid = _makeId(stem, nsName);\n      const line = node.startPosition.row + 1;\n      addNodeFn(nsNid, nsName, line);\n      addEdgeFn(fileNid, nsNid, \"contains\", line);\n    }\n    const body = node.childForFieldName(\"body\");\n    if (body && walkFn) {\n      for (const child of body.children) {\n        walkFn(child, parentClassNid);\n      }\n    }\n    return true;\n  }\n  return false;\n}\n\n// ---------------------------------------------------------------------------\n// Swift extra walk for enum cases\n// ---------------------------------------------------------------------------\n\nfunction _swiftExtraWalk(\n  node: SyntaxNode, source: string, _fileNid: string, _stem: string, _strPath: string,\n  _nodes: GraphNode[], _edges: GraphEdge[], _seenIds: Set<string>,\n  _functionBodies: Array<[string, SyntaxNode]>,\n  parentClassNid: string | null,\n  addNodeFn: (nid: string, label: string, line: number) => void,\n  addEdgeFn: (src: string, tgt: string, relation: string, line: number) => void,\n): boolean {\n  if (node.type === \"enum_entry\" && parentClassNid) {\n    for (const child of node.children) {\n      if (child.type === \"simple_identifier\") {\n        const caseName = _readText(child, source);\n        const caseNid = _makeId(parentClassNid, caseName);\n        const line = node.startPosition.row + 1;\n        addNodeFn(caseNid, caseName, line);\n        addEdgeFn(parentClassNid, caseNid, \"case_of\", line);\n      }\n    }\n    return true;\n  }\n  return false;\n}\n\n// ---------------------------------------------------------------------------\n// Language configs\n// ---------------------------------------------------------------------------\n\nconst _PYTHON_CONFIG: LanguageConfig = defaultConfig({\n  tsGrammarName: \"python\",\n  tsModule: \"tree_sitter_python\",\n  classTypes: new Set([\"class_definition\"]),\n  functionTypes: new Set([\"function_definition\"]),\n  importTypes: new Set([\"import_statement\", \"import_from_statement\"]),\n  callTypes: new Set([\"call\"]),\n  callFunctionField: \"function\",\n  callAccessorNodeTypes: new Set([\"attribute\"]),\n  callAccessorField: \"attribute\",\n  functionBoundaryTypes: new Set([\"function_definition\"]),\n  importHandler: _importPython,\n});\n\nconst _JS_CONFIG: LanguageConfig = defaultConfig({\n  tsGrammarName: \"javascript\",\n  tsModule: \"tree_sitter_javascript\",\n  classTypes: new Set([\"class_declaration\"]),\n  functionTypes: new Set([\"function_declaration\", \"method_definition\"]),\n  importTypes: new Set([\"import_statement\"]),\n  callTypes: new Set([\"call_expression\"]),\n  callFunctionField: \"function\",\n  callAccessorNodeTypes: new Set([\"member_expression\"]),\n  callAccessorField: \"property\",\n  functionBoundaryTypes: new Set([\"function_declaration\", \"arrow_function\", \"method_definition\"]),\n  importHandler: _importJs,\n});\n\nconst _TS_CONFIG: LanguageConfig = defaultConfig({\n  tsGrammarName: \"typescript\",\n  tsModule: \"tree_sitter_typescript\",\n  classTypes: new Set([\"class_declaration\"]),\n  functionTypes: new Set([\"function_declaration\", \"method_definition\"]),\n  importTypes: new Set([\"import_statement\"]),\n  callTypes: new Set([\"call_expression\"]),\n  callFunctionField: \"function\",\n  callAccessorNodeTypes: new Set([\"member_expression\"]),\n  callAccessorField: \"property\",\n  functionBoundaryTypes: new Set([\"function_declaration\", \"arrow_function\", \"method_definition\"]),\n  importHandler: _importJs,\n});\n\nconst _JAVA_CONFIG: LanguageConfig = defaultConfig({\n  tsGrammarName: \"java\",\n  tsModule: \"tree_sitter_java\",\n  classTypes: new Set([\"class_declaration\", \"interface_declaration\"]),\n  functionTypes: new Set([\"method_declaration\", \"constructor_declaration\"]),\n  importTypes: new Set([\"import_declaration\"]),\n  callTypes: new Set([\"method_invocation\"]),\n  callFunctionField: \"name\",\n  callAccessorNodeTypes: new Set(),\n  functionBoundaryTypes: new Set([\"method_declaration\", \"constructor_declaration\"]),\n  importHandler: _importJava,\n});\n\nconst _C_CONFIG: LanguageConfig = defaultConfig({\n  tsGrammarName: \"c\",\n  tsModule: \"tree_sitter_c\",\n  classTypes: new Set(),\n  functionTypes: new Set([\"function_definition\"]),\n  importTypes: new Set([\"preproc_include\"]),\n  callTypes: new Set([\"call_expression\"]),\n  callFunctionField: \"function\",\n  callAccessorNodeTypes: new Set([\"field_expression\"]),\n  callAccessorField: \"field\",\n  functionBoundaryTypes: new Set([\"function_definition\"]),\n  importHandler: _importC,\n  resolveFunctionNameFn: _getCFuncName,\n});\n\nconst _CPP_CONFIG: LanguageConfig = defaultConfig({\n  tsGrammarName: \"cpp\",\n  tsModule: \"tree_sitter_cpp\",\n  classTypes: new Set([\"class_specifier\"]),\n  functionTypes: new Set([\"function_definition\"]),\n  importTypes: new Set([\"preproc_include\"]),\n  callTypes: new Set([\"call_expression\"]),\n  callFunctionField: \"function\",\n  callAccessorNodeTypes: new Set([\"field_expression\", \"qualified_identifier\"]),\n  callAccessorField: \"field\",\n  functionBoundaryTypes: new Set([\"function_definition\"]),\n  importHandler: _importC,\n  resolveFunctionNameFn: _getCppFuncName,\n});\n\nconst _RUBY_CONFIG: LanguageConfig = defaultConfig({\n  tsGrammarName: \"ruby\",\n  tsModule: \"tree_sitter_ruby\",\n  classTypes: new Set([\"class\"]),\n  functionTypes: new Set([\"method\", \"singleton_method\"]),\n  importTypes: new Set(),\n  callTypes: new Set([\"call\"]),\n  callFunctionField: \"method\",\n  callAccessorNodeTypes: new Set(),\n  nameFallbackChildTypes: [\"constant\", \"scope_resolution\", \"identifier\"],\n  bodyFallbackChildTypes: [\"body_statement\"],\n  functionBoundaryTypes: new Set([\"method\", \"singleton_method\"]),\n});\n\nconst _CSHARP_CONFIG: LanguageConfig = defaultConfig({\n  tsGrammarName: \"c_sharp\",\n  tsModule: \"tree_sitter_c_sharp\",\n  classTypes: new Set([\"class_declaration\", \"interface_declaration\"]),\n  functionTypes: new Set([\"method_declaration\"]),\n  importTypes: new Set([\"using_directive\"]),\n  callTypes: new Set([\"invocation_expression\"]),\n  callFunctionField: \"function\",\n  callAccessorNodeTypes: new Set([\"member_access_expression\"]),\n  callAccessorField: \"name\",\n  bodyFallbackChildTypes: [\"declaration_list\"],\n  functionBoundaryTypes: new Set([\"method_declaration\"]),\n  importHandler: _importCsharp,\n});\n\nconst _KOTLIN_CONFIG: LanguageConfig = defaultConfig({\n  tsGrammarName: \"kotlin\",\n  tsModule: \"tree_sitter_kotlin\",\n  classTypes: new Set([\"class_declaration\", \"object_declaration\"]),\n  functionTypes: new Set([\"function_declaration\"]),\n  importTypes: new Set([\"import_header\"]),\n  callTypes: new Set([\"call_expression\"]),\n  callFunctionField: \"\",\n  callAccessorNodeTypes: new Set([\"navigation_expression\"]),\n  callAccessorField: \"\",\n  nameFallbackChildTypes: [\"simple_identifier\"],\n  bodyFallbackChildTypes: [\"function_body\", \"class_body\"],\n  functionBoundaryTypes: new Set([\"function_declaration\"]),\n  importHandler: _importKotlin,\n});\n\nconst _SCALA_CONFIG: LanguageConfig = defaultConfig({\n  tsGrammarName: \"scala\",\n  tsModule: \"tree_sitter_scala\",\n  classTypes: new Set([\"class_definition\", \"object_definition\"]),\n  functionTypes: new Set([\"function_definition\"]),\n  importTypes: new Set([\"import_declaration\"]),\n  callTypes: new Set([\"call_expression\"]),\n  callFunctionField: \"\",\n  callAccessorNodeTypes: new Set([\"field_expression\"]),\n  callAccessorField: \"field\",\n  nameFallbackChildTypes: [\"identifier\"],\n  bodyFallbackChildTypes: [\"template_body\"],\n  functionBoundaryTypes: new Set([\"function_definition\"]),\n  importHandler: _importScala,\n});\n\nconst _PHP_CONFIG: LanguageConfig = defaultConfig({\n  tsGrammarName: \"php\",\n  tsModule: \"tree_sitter_php\",\n  classTypes: new Set([\"class_declaration\"]),\n  functionTypes: new Set([\"function_definition\", \"method_declaration\"]),\n  importTypes: new Set([\"namespace_use_clause\"]),\n  callTypes: new Set([\"function_call_expression\", \"member_call_expression\"]),\n  callFunctionField: \"function\",\n  callAccessorNodeTypes: new Set([\"member_call_expression\"]),\n  callAccessorField: \"name\",\n  nameFallbackChildTypes: [\"name\"],\n  bodyFallbackChildTypes: [\"declaration_list\", \"compound_statement\"],\n  functionBoundaryTypes: new Set([\"function_definition\", \"method_declaration\"]),\n  importHandler: _importPhp,\n});\n\nconst _LUA_CONFIG: LanguageConfig = defaultConfig({\n  tsGrammarName: \"lua\",\n  tsModule: \"tree_sitter_lua\",\n  classTypes: new Set(),\n  functionTypes: new Set([\"function_declaration\"]),\n  importTypes: new Set([\"variable_declaration\"]),\n  callTypes: new Set([\"function_call\"]),\n  callFunctionField: \"name\",\n  callAccessorNodeTypes: new Set([\"method_index_expression\"]),\n  callAccessorField: \"name\",\n  nameFallbackChildTypes: [\"identifier\", \"method_index_expression\"],\n  bodyFallbackChildTypes: [\"block\"],\n  functionBoundaryTypes: new Set([\"function_declaration\"]),\n  importHandler: _importLua,\n});\n\nconst _SWIFT_CONFIG: LanguageConfig = defaultConfig({\n  tsGrammarName: \"swift\",\n  tsModule: \"tree_sitter_swift\",\n  classTypes: new Set([\"class_declaration\", \"protocol_declaration\"]),\n  functionTypes: new Set([\"function_declaration\", \"init_declaration\", \"deinit_declaration\", \"subscript_declaration\"]),\n  importTypes: new Set([\"import_declaration\"]),\n  callTypes: new Set([\"call_expression\"]),\n  callFunctionField: \"\",\n  callAccessorNodeTypes: new Set([\"navigation_expression\"]),\n  callAccessorField: \"\",\n  nameFallbackChildTypes: [\"simple_identifier\", \"type_identifier\", \"user_type\"],\n  bodyFallbackChildTypes: [\"class_body\", \"protocol_body\", \"function_body\", \"enum_class_body\"],\n  functionBoundaryTypes: new Set([\"function_declaration\", \"init_declaration\", \"deinit_declaration\", \"subscript_declaration\"]),\n  importHandler: _importSwift,\n});\n\n// ---------------------------------------------------------------------------\n// Generic extractor\n// ---------------------------------------------------------------------------\n\nexport interface ExtractionResult {\n  nodes: GraphNode[];\n  edges: GraphEdge[];\n  error?: string;\n}\n\nasync function _extractGeneric(filePath: string, config: LanguageConfig): Promise<ExtractionResult> {\n  await ensureParserInit();\n  const lang = await loadLanguage(config.tsGrammarName);\n  if (!lang) {\n    return { nodes: [], edges: [], error: `Grammar not found for ${config.tsGrammarName}` };\n  }\n\n  let source: string;\n  let tree: Tree;\n  try {\n    const parser = new Parser();\n    parser.setLanguage(lang);\n    source = readFileSync(filePath, \"utf-8\");\n    tree = parseText(parser, source);\n  } catch (e: unknown) {\n    return { nodes: [], edges: [], error: String(e) };\n  }\n\n  const root = tree.rootNode;\n  const stem = basename(filePath, extname(filePath));\n  const strPath = filePath;\n  const nodes: GraphNode[] = [];\n  const edges: GraphEdge[] = [];\n  const seenIds = new Set<string>();\n  const functionBodies: Array<[string, SyntaxNode]> = [];\n\n  function addNode(nid: string, label: string, line: number): void {\n    if (!seenIds.has(nid)) {\n      seenIds.add(nid);\n      nodes.push({\n        id: nid, label, file_type: \"code\",\n        source_file: strPath, source_location: `L${line}`,\n      });\n    }\n  }\n\n  function addEdge(\n    src: string, tgt: string, relation: string, line: number,\n    confidence: \"EXTRACTED\" | \"INFERRED\" = \"EXTRACTED\", weight: number = 1.0,\n  ): void {\n    edges.push({\n      source: src, target: tgt, relation,\n      confidence, source_file: strPath,\n      source_location: `L${line}`, weight,\n    });\n  }\n\n  const fileNid = _makeId(stem);\n  addNode(fileNid, basename(filePath), 1);\n\n  function walk(node: SyntaxNode, parentClassNid: string | null = null): void {\n    const t = node.type;\n\n    // Import types\n    if (config.importTypes.has(t)) {\n      if (config.importHandler) {\n        config.importHandler(node, source, fileNid, stem, edges, strPath);\n      }\n      return;\n    }\n\n    // Class types\n    if (config.classTypes.has(t)) {\n      let nameNode = node.childForFieldName(config.nameField);\n      if (!nameNode) {\n        for (const child of node.children) {\n          if (config.nameFallbackChildTypes.includes(child.type)) {\n            nameNode = child;\n            break;\n          }\n        }\n      }\n      if (!nameNode) return;\n      const className = _readText(nameNode, source);\n      const classNid = _makeId(stem, className);\n      const line = node.startPosition.row + 1;\n      addNode(classNid, className, line);\n      addEdge(fileNid, classNid, \"contains\", line);\n\n      // Python-specific: inheritance\n      if (config.tsModule === \"tree_sitter_python\") {\n        const args = node.childForFieldName(\"superclasses\");\n        if (args) {\n          for (const arg of args.children) {\n            if (arg.type === \"identifier\") {\n              const base = _readText(arg, source);\n              let baseNid = _makeId(stem, base);\n              if (!seenIds.has(baseNid)) {\n                baseNid = _makeId(base);\n                if (!seenIds.has(baseNid)) {\n                  nodes.push({\n                    id: baseNid, label: base, file_type: \"code\",\n                    source_file: \"\", source_location: \"\",\n                  });\n                  seenIds.add(baseNid);\n                }\n              }\n              addEdge(classNid, baseNid, \"inherits\", line);\n            }\n          }\n        }\n      }\n\n      // Swift-specific: conformance / inheritance\n      if (config.tsModule === \"tree_sitter_swift\") {\n        for (const child of node.children) {\n          if (child.type === \"inheritance_specifier\") {\n            for (const sub of child.children) {\n              if (sub.type === \"user_type\" || sub.type === \"type_identifier\") {\n                const base = _readText(sub, source);\n                let baseNid = _makeId(stem, base);\n                if (!seenIds.has(baseNid)) {\n                  baseNid = _makeId(base);\n                  if (!seenIds.has(baseNid)) {\n                    nodes.push({\n                      id: baseNid, label: base, file_type: \"code\",\n                      source_file: \"\", source_location: \"\",\n                    });\n                    seenIds.add(baseNid);\n                  }\n                }\n                addEdge(classNid, baseNid, \"inherits\", line);\n              }\n            }\n          }\n        }\n      }\n\n      // C#-specific: inheritance / interface implementation via base_list\n      if (config.tsModule === \"tree_sitter_c_sharp\") {\n        for (const child of node.children) {\n          if (child.type === \"base_list\") {\n            for (const sub of child.children) {\n              if (sub.type === \"identifier\" || sub.type === \"generic_name\") {\n                let base: string;\n                if (sub.type === \"generic_name\") {\n                  const nameChild = sub.childForFieldName(\"name\");\n                  base = nameChild ? _readText(nameChild, source) : _readText(sub.children[0]!, source);\n                } else {\n                  base = _readText(sub, source);\n                }\n                let baseNid = _makeId(stem, base);\n                if (!seenIds.has(baseNid)) {\n                  baseNid = _makeId(base);\n                  if (!seenIds.has(baseNid)) {\n                    nodes.push({\n                      id: baseNid, label: base, file_type: \"code\",\n                      source_file: \"\", source_location: \"\",\n                    });\n                    seenIds.add(baseNid);\n                  }\n                }\n                addEdge(classNid, baseNid, \"inherits\", line);\n              }\n            }\n          }\n        }\n      }\n\n      // Find body and recurse\n      const body = _findBody(node, config);\n      if (body) {\n        for (const child of body.children) {\n          walk(child, classNid);\n        }\n      }\n      return;\n    }\n\n    // Function types\n    if (config.functionTypes.has(t)) {\n      let funcName: string | null = null;\n\n      // Swift deinit/subscript have no name field\n      if (t === \"deinit_declaration\") {\n        funcName = \"deinit\";\n      } else if (t === \"subscript_declaration\") {\n        funcName = \"subscript\";\n      } else if (config.resolveFunctionNameFn !== null) {\n        // C/C++ style: use declarator\n        const declarator = node.childForFieldName(\"declarator\");\n        if (declarator) {\n          funcName = config.resolveFunctionNameFn(declarator, source);\n        }\n      } else {\n        let nameNode = node.childForFieldName(config.nameField);\n        if (!nameNode) {\n          for (const child of node.children) {\n            if (config.nameFallbackChildTypes.includes(child.type)) {\n              nameNode = child;\n              break;\n            }\n          }\n        }\n        funcName = nameNode ? _readText(nameNode, source) : null;\n      }\n\n      if (!funcName) return;\n\n      const line = node.startPosition.row + 1;\n      let funcNid: string;\n      if (parentClassNid) {\n        funcNid = _makeId(parentClassNid, funcName);\n        addNode(funcNid, `.${funcName}()`, line);\n        addEdge(parentClassNid, funcNid, \"method\", line);\n      } else {\n        funcNid = _makeId(stem, funcName);\n        addNode(funcNid, `${funcName}()`, line);\n        addEdge(fileNid, funcNid, \"contains\", line);\n      }\n\n      const body = _findBody(node, config);\n      if (body) {\n        functionBodies.push([funcNid, body]);\n      }\n      return;\n    }\n\n    // JS/TS arrow functions\n    if (config.tsModule === \"tree_sitter_javascript\" || config.tsModule === \"tree_sitter_typescript\") {\n      if (_jsExtraWalk(node, source, fileNid, stem, strPath,\n        nodes, edges, seenIds, functionBodies,\n        parentClassNid, addNode, addEdge)) {\n        return;\n      }\n    }\n\n    // C# namespaces\n    if (config.tsModule === \"tree_sitter_c_sharp\") {\n      if (_csharpExtraWalk(node, source, fileNid, stem, strPath,\n        nodes, edges, seenIds, functionBodies,\n        parentClassNid, addNode, addEdge, walk)) {\n        return;\n      }\n    }\n\n    // Swift enum cases\n    if (config.tsModule === \"tree_sitter_swift\") {\n      if (_swiftExtraWalk(node, source, fileNid, stem, strPath,\n        nodes, edges, seenIds, functionBodies,\n        parentClassNid, addNode, addEdge)) {\n        return;\n      }\n    }\n\n    // Default: recurse\n    for (const child of node.children) {\n      walk(child, null);\n    }\n  }\n\n  walk(root);\n\n  // -- Call-graph pass --\n  const labelToNid = new Map<string, string>();\n  for (const n of nodes) {\n    const raw = n.label;\n    const normalised = raw.replace(/\\(?\\)$/g, \"\").replace(/^\\./, \"\");\n    labelToNid.set(normalised.toLowerCase(), n.id);\n  }\n\n  const seenCallPairs = new Set<string>();\n\n  function walkCalls(node: SyntaxNode, callerNid: string): void {\n    if (config.functionBoundaryTypes.has(node.type)) return;\n\n    if (config.callTypes.has(node.type)) {\n      let calleeName: string | null = null;\n\n      // Special handling per language\n      if (config.tsModule === \"tree_sitter_swift\") {\n        const first = node.children[0] ?? null;\n        if (first) {\n          if (first.type === \"simple_identifier\") {\n            calleeName = _readText(first, source);\n          } else if (first.type === \"navigation_expression\") {\n            for (const child of first.children) {\n              if (child.type === \"navigation_suffix\") {\n                for (const sc of child.children) {\n                  if (sc.type === \"simple_identifier\") {\n                    calleeName = _readText(sc, source);\n                  }\n                }\n              }\n            }\n          }\n        }\n      } else if (config.tsModule === \"tree_sitter_kotlin\") {\n        const first = node.children[0] ?? null;\n        if (first) {\n          if (first.type === \"simple_identifier\") {\n            calleeName = _readText(first, source);\n          } else if (first.type === \"navigation_expression\") {\n            for (let i = first.children.length - 1; i >= 0; i--) {\n              if (first.children[i]!.type === \"simple_identifier\") {\n                calleeName = _readText(first.children[i]!, source);\n                break;\n              }\n            }\n          }\n        }\n      } else if (config.tsModule === \"tree_sitter_scala\") {\n        const first = node.children[0] ?? null;\n        if (first) {\n          if (first.type === \"identifier\") {\n            calleeName = _readText(first, source);\n          } else if (first.type === \"field_expression\") {\n            const field = first.childForFieldName(\"field\");\n            if (field) {\n              calleeName = _readText(field, source);\n            } else {\n              for (let i = first.children.length - 1; i >= 0; i--) {\n                if (first.children[i]!.type === \"identifier\") {\n                  calleeName = _readText(first.children[i]!, source);\n                  break;\n                }\n              }\n            }\n          }\n        }\n      } else if (config.tsModule === \"tree_sitter_c_sharp\" && node.type === \"invocation_expression\") {\n        const nameNode = node.childForFieldName(\"name\");\n        if (nameNode) {\n          calleeName = _readText(nameNode, source);\n        } else {\n          for (const child of node.children) {\n            if (child.isNamed) {\n              const raw = _readText(child, source);\n              if (raw.includes(\".\")) {\n                calleeName = raw.split(\".\").pop()!;\n              } else {\n                calleeName = raw;\n              }\n              break;\n            }\n          }\n        }\n      } else if (config.tsModule === \"tree_sitter_php\") {\n        if (node.type === \"function_call_expression\") {\n          const funcNode = node.childForFieldName(\"function\");\n          if (funcNode) calleeName = _readText(funcNode, source);\n        } else {\n          const nameNode = node.childForFieldName(\"name\");\n          if (nameNode) calleeName = _readText(nameNode, source);\n        }\n      } else if (config.tsModule === \"tree_sitter_cpp\") {\n        const funcNode = config.callFunctionField ? node.childForFieldName(config.callFunctionField) : null;\n        if (funcNode) {\n          if (funcNode.type === \"identifier\") {\n            calleeName = _readText(funcNode, source);\n          } else if (funcNode.type === \"field_expression\" || funcNode.type === \"qualified_identifier\") {\n            const name = funcNode.childForFieldName(\"field\") ?? funcNode.childForFieldName(\"name\");\n            if (name) calleeName = _readText(name, source);\n          }\n        }\n      } else {\n        // Generic: get callee from callFunctionField\n        const funcNode = config.callFunctionField ? node.childForFieldName(config.callFunctionField) : null;\n        if (funcNode) {\n          if (funcNode.type === \"identifier\") {\n            calleeName = _readText(funcNode, source);\n          } else if (config.callAccessorNodeTypes.has(funcNode.type)) {\n            if (config.callAccessorField) {\n              const attr = funcNode.childForFieldName(config.callAccessorField);\n              if (attr) calleeName = _readText(attr, source);\n            }\n          } else {\n            // Try reading the node directly (e.g. Java name field is the callee)\n            calleeName = _readText(funcNode, source);\n          }\n        }\n      }\n\n      if (calleeName) {\n        const tgtNid = labelToNid.get(calleeName.toLowerCase());\n        if (tgtNid && tgtNid !== callerNid) {\n          const pair = `${callerNid}|${tgtNid}`;\n          if (!seenCallPairs.has(pair)) {\n            seenCallPairs.add(pair);\n            const line = node.startPosition.row + 1;\n            edges.push({\n              source: callerNid, target: tgtNid, relation: \"calls\",\n              confidence: \"INFERRED\", source_file: strPath,\n              source_location: `L${line}`, weight: 0.8,\n            });\n          }\n        }\n      }\n    }\n\n    for (const child of node.children) {\n      walkCalls(child, callerNid);\n    }\n  }\n\n  for (const [callerNid, bodyNode] of functionBodies) {\n    walkCalls(bodyNode, callerNid);\n  }\n\n  // -- Clean edges --\n  const validIds = seenIds;\n  const cleanEdges = edges.filter((edge) => {\n    const src = edge.source;\n    const tgt = edge.target;\n    return validIds.has(src) && (validIds.has(tgt) || edge.relation === \"imports\" || edge.relation === \"imports_from\");\n  });\n\n  return { nodes, edges: cleanEdges };\n}\n\n// ---------------------------------------------------------------------------\n// Python rationale extraction\n// ---------------------------------------------------------------------------\n\nconst _RATIONALE_PREFIXES = [\n  \"# NOTE:\", \"# IMPORTANT:\", \"# HACK:\", \"# WHY:\",\n  \"# RATIONALE:\", \"# TODO:\", \"# FIXME:\",\n];\n\nasync function _extractPythonRationale(filePath: string, result: ExtractionResult): Promise<void> {\n  await ensureParserInit();\n  const lang = await loadLanguage(\"python\");\n  if (!lang) return;\n\n  let source: string;\n  let root: SyntaxNode;\n  try {\n    const parser = new Parser();\n    parser.setLanguage(lang);\n    source = readFileSync(filePath, \"utf-8\");\n    const tree = parseText(parser, source);\n    root = tree.rootNode;\n  } catch {\n    return;\n  }\n\n  const stem = basename(filePath, extname(filePath));\n  const strPath = filePath;\n  const { nodes, edges } = result;\n  const seenIds = new Set(nodes.map((n) => n.id));\n  const fileNid = _makeId(stem);\n\n  function getDocstring(bodyNode: SyntaxNode | null): [string, number] | null {\n    if (!bodyNode) return null;\n    for (const child of bodyNode.children) {\n      if (child.type === \"expression_statement\") {\n        for (const sub of child.children) {\n          if (sub.type === \"string\" || sub.type === \"concatenated_string\") {\n            let text = source.slice(sub.startIndex, sub.endIndex);\n            text = text.replace(/^[\"']+|[\"']+$/g, \"\").replace(/^\"\"\"+|\"\"\"+$/g, \"\").replace(/^'''+|'''+$/g, \"\").trim();\n            if (text.length > 20) {\n              return [text, child.startPosition.row + 1];\n            }\n          }\n        }\n      }\n      break;\n    }\n    return null;\n  }\n\n  function addRationale(text: string, line: number, parentNid: string): void {\n    const label = text.slice(0, 80).replace(/\\n/g, \" \").trim();\n    const rid = _makeId(stem, \"rationale\", String(line));\n    if (!seenIds.has(rid)) {\n      seenIds.add(rid);\n      nodes.push({\n        id: rid, label, file_type: \"rationale\" as GraphNode[\"file_type\"],\n        source_file: strPath, source_location: `L${line}`,\n      });\n    }\n    edges.push({\n      source: rid, target: parentNid, relation: \"rationale_for\",\n      confidence: \"EXTRACTED\", source_file: strPath,\n      source_location: `L${line}`, weight: 1.0,\n    });\n  }\n\n  // Module-level docstring\n  const ds = getDocstring(root);\n  if (ds) addRationale(ds[0], ds[1], fileNid);\n\n  // Class and function docstrings\n  function walkDocstrings(node: SyntaxNode, parentNid: string): void {\n    const t = node.type;\n    if (t === \"class_definition\") {\n      const nameNode = node.childForFieldName(\"name\");\n      const body = node.childForFieldName(\"body\");\n      if (nameNode && body) {\n        const className = source.slice(nameNode.startIndex, nameNode.endIndex);\n        const nid = _makeId(stem, className);\n        const classDs = getDocstring(body);\n        if (classDs) addRationale(classDs[0], classDs[1], nid);\n        for (const child of body.children) {\n          walkDocstrings(child, nid);\n        }\n      }\n      return;\n    }\n    if (t === \"function_definition\") {\n      const nameNode = node.childForFieldName(\"name\");\n      const body = node.childForFieldName(\"body\");\n      if (nameNode && body) {\n        const funcName = source.slice(nameNode.startIndex, nameNode.endIndex);\n        const nid = parentNid !== fileNid ? _makeId(parentNid, funcName) : _makeId(stem, funcName);\n        const funcDs = getDocstring(body);\n        if (funcDs) addRationale(funcDs[0], funcDs[1], nid);\n      }\n      return;\n    }\n    for (const child of node.children) {\n      walkDocstrings(child, parentNid);\n    }\n  }\n\n  walkDocstrings(root, fileNid);\n\n  // Rationale comments\n  const lines = source.split(\"\\n\");\n  for (let lineno = 0; lineno < lines.length; lineno++) {\n    const stripped = lines[lineno]!.trim();\n    if (_RATIONALE_PREFIXES.some((p) => stripped.startsWith(p))) {\n      addRationale(stripped, lineno + 1, fileNid);\n    }\n  }\n}\n\n// ---------------------------------------------------------------------------\n// Public API: per-language extractors\n// ---------------------------------------------------------------------------\n\nexport async function extractPython(filePath: string): Promise<ExtractionResult> {\n  const result = await _extractGeneric(filePath, _PYTHON_CONFIG);\n  if (!result.error) {\n    await _extractPythonRationale(filePath, result);\n  }\n  return result;\n}\n\nexport async function extractJs(filePath: string): Promise<ExtractionResult> {\n  const ext = extname(filePath);\n  const config = (ext === \".ts\" || ext === \".tsx\") ? _TS_CONFIG : _JS_CONFIG;\n  return _extractGeneric(filePath, config);\n}\n\nexport async function extractJava(filePath: string): Promise<ExtractionResult> {\n  return _extractGeneric(filePath, _JAVA_CONFIG);\n}\n\nexport async function extractC(filePath: string): Promise<ExtractionResult> {\n  return _extractGeneric(filePath, _C_CONFIG);\n}\n\nexport async function extractCpp(filePath: string): Promise<ExtractionResult> {\n  return _extractGeneric(filePath, _CPP_CONFIG);\n}\n\nexport async function extractRuby(filePath: string): Promise<ExtractionResult> {\n  return _extractGeneric(filePath, _RUBY_CONFIG);\n}\n\nexport async function extractCsharp(filePath: string): Promise<ExtractionResult> {\n  return _extractGeneric(filePath, _CSHARP_CONFIG);\n}\n\nexport async function extractKotlin(filePath: string): Promise<ExtractionResult> {\n  return _extractGeneric(filePath, _KOTLIN_CONFIG);\n}\n\nexport async function extractScala(filePath: string): Promise<ExtractionResult> {\n  return _extractGeneric(filePath, _SCALA_CONFIG);\n}\n\nexport async function extractPhp(filePath: string): Promise<ExtractionResult> {\n  return _extractGeneric(filePath, _PHP_CONFIG);\n}\n\nexport async function extractLua(filePath: string): Promise<ExtractionResult> {\n  return _extractGeneric(filePath, _LUA_CONFIG);\n}\n\nexport async function extractSwift(filePath: string): Promise<ExtractionResult> {\n  return _extractGeneric(filePath, _SWIFT_CONFIG);\n}\n\n// ---------------------------------------------------------------------------\n// Julia extractor (custom walk)\n// ---------------------------------------------------------------------------\n\nexport async function extractJulia(filePath: string): Promise<ExtractionResult> {\n  await ensureParserInit();\n  const lang = await loadLanguage(\"julia\");\n  if (!lang) {\n    return { nodes: [], edges: [], error: \"tree-sitter-julia not available\" };\n  }\n\n  let source: string;\n  let tree: Tree;\n  try {\n    const parser = new Parser();\n    parser.setLanguage(lang);\n    source = readFileSync(filePath, \"utf-8\");\n    tree = parseText(parser, source);\n  } catch (e: unknown) {\n    return { nodes: [], edges: [], error: String(e) };\n  }\n\n  const root = tree.rootNode;\n  const stem = basename(filePath, extname(filePath));\n  const strPath = filePath;\n  const nodes: GraphNode[] = [];\n  const edges: GraphEdge[] = [];\n  const seenIds = new Set<string>();\n  const functionBodies: Array<[string, SyntaxNode]> = [];\n\n  function addNode(nid: string, label: string, line: number): void {\n    if (!seenIds.has(nid)) {\n      seenIds.add(nid);\n      nodes.push({ id: nid, label, file_type: \"code\", source_file: strPath, source_location: `L${line}` });\n    }\n  }\n\n  function addEdge(\n    src: string, tgt: string, relation: string, line: number,\n    confidence: \"EXTRACTED\" | \"INFERRED\" = \"EXTRACTED\", weight: number = 1.0,\n  ): void {\n    edges.push({ source: src, target: tgt, relation, confidence, source_file: strPath, source_location: `L${line}`, weight });\n  }\n\n  const fileNid = _makeId(stem);\n  addNode(fileNid, basename(filePath), 1);\n\n  function funcNameFromSignature(sigNode: SyntaxNode): string | null {\n    for (const child of sigNode.children) {\n      if (child.type === \"call_expression\") {\n        const callee = child.children[0] ?? null;\n        if (callee && callee.type === \"identifier\") {\n          return _readText(callee, source);\n        }\n      }\n    }\n    return null;\n  }\n\n  function walkCalls(bodyNode: SyntaxNode, funcNid: string): void {\n    if (!bodyNode) return;\n    const t = bodyNode.type;\n    if (t === \"function_definition\" || t === \"short_function_definition\") return;\n    if (t === \"call_expression\" && bodyNode.children.length > 0) {\n      const callee = bodyNode.children[0]!;\n      if (callee.type === \"identifier\") {\n        const calleeName = _readText(callee, source);\n        const targetNid = _makeId(stem, calleeName);\n        addEdge(funcNid, targetNid, \"calls\", bodyNode.startPosition.row + 1, \"EXTRACTED\");\n      } else if (callee.type === \"field_expression\" && callee.children.length >= 3) {\n        const methodNode = callee.children[callee.children.length - 1]!;\n        const methodName = _readText(methodNode, source);\n        const targetNid = _makeId(stem, methodName);\n        addEdge(funcNid, targetNid, \"calls\", bodyNode.startPosition.row + 1, \"EXTRACTED\");\n      }\n    }\n    for (const child of bodyNode.children) {\n      walkCalls(child, funcNid);\n    }\n  }\n\n  function walk(node: SyntaxNode, scopeNid: string): void {\n    const t = node.type;\n\n    // Module\n    if (t === \"module_definition\") {\n      const nameNode = node.children.find((c) => c.type === \"identifier\") ?? null;\n      if (nameNode) {\n        const modName = _readText(nameNode, source);\n        const modNid = _makeId(stem, modName);\n        const line = node.startPosition.row + 1;\n        addNode(modNid, modName, line);\n        addEdge(fileNid, modNid, \"defines\", line);\n        for (const child of node.children) {\n          walk(child, modNid);\n        }\n      }\n      return;\n    }\n\n    // Struct\n    if (t === \"struct_definition\") {\n      const typeHead = node.children.find((c) => c.type === \"type_head\") ?? null;\n      if (typeHead) {\n        const binExpr = typeHead.children.find((c) => c.type === \"binary_expression\") ?? null;\n        if (binExpr) {\n          const identifiers = binExpr.children.filter((c) => c.type === \"identifier\");\n          if (identifiers.length > 0) {\n            const structName = _readText(identifiers[0]!, source);\n            const structNid = _makeId(stem, structName);\n            const line = node.startPosition.row + 1;\n            addNode(structNid, structName, line);\n            addEdge(scopeNid, structNid, \"defines\", line);\n            if (identifiers.length >= 2) {\n              const superName = _readText(identifiers[identifiers.length - 1]!, source);\n              addEdge(structNid, _makeId(stem, superName), \"inherits\", line, \"EXTRACTED\");\n            }\n          }\n        } else {\n          const nameNode = typeHead.children.find((c) => c.type === \"identifier\") ?? null;\n          if (nameNode) {\n            const structName = _readText(nameNode, source);\n            const structNid = _makeId(stem, structName);\n            const line = node.startPosition.row + 1;\n            addNode(structNid, structName, line);\n            addEdge(scopeNid, structNid, \"defines\", line);\n          }\n        }\n      }\n      return;\n    }\n\n    // Abstract type\n    if (t === \"abstract_definition\") {\n      const typeHead = node.children.find((c) => c.type === \"type_head\") ?? null;\n      if (typeHead) {\n        const nameNode = typeHead.children.find((c) => c.type === \"identifier\") ?? null;\n        if (nameNode) {\n          const absName = _readText(nameNode, source);\n          const absNid = _makeId(stem, absName);\n          const line = node.startPosition.row + 1;\n          addNode(absNid, absName, line);\n          addEdge(scopeNid, absNid, \"defines\", line);\n        }\n      }\n      return;\n    }\n\n    // Function: function foo(...) ... end\n    if (t === \"function_definition\") {\n      const sigNode = node.children.find((c) => c.type === \"signature\") ?? null;\n      if (sigNode) {\n        const funcName = funcNameFromSignature(sigNode);\n        if (funcName) {\n          const funcNid = _makeId(stem, funcName);\n          const line = node.startPosition.row + 1;\n          addNode(funcNid, `${funcName}()`, line);\n          addEdge(scopeNid, funcNid, \"defines\", line);\n          functionBodies.push([funcNid, node]);\n        }\n      }\n      return;\n    }\n\n    // Short function: foo(x) = expr\n    if (t === \"assignment\") {\n      const lhs = node.children[0] ?? null;\n      if (lhs && lhs.type === \"call_expression\" && lhs.children.length > 0) {\n        const callee = lhs.children[0]!;\n        if (callee.type === \"identifier\") {\n          const funcName = _readText(callee, source);\n          const funcNid = _makeId(stem, funcName);\n          const line = node.startPosition.row + 1;\n          addNode(funcNid, `${funcName}()`, line);\n          addEdge(scopeNid, funcNid, \"defines\", line);\n          const rhs = node.children.length >= 3 ? node.children[node.children.length - 1]! : null;\n          if (rhs) {\n            functionBodies.push([funcNid, rhs]);\n          }\n        }\n      }\n      return;\n    }\n\n    // Using / Import\n    if (t === \"using_statement\" || t === \"import_statement\") {\n      const line = node.startPosition.row + 1;\n      for (const child of node.children) {\n        if (child.type === \"identifier\") {\n          const modName = _readText(child, source);\n          const impNid = _makeId(modName);\n          addNode(impNid, modName, line);\n          addEdge(scopeNid, impNid, \"imports\", line);\n        } else if (child.type === \"selected_import\") {\n          const identifiers = child.children.filter((c) => c.type === \"identifier\");\n          if (identifiers.length > 0) {\n            const pkgName = _readText(identifiers[0]!, source);\n            const pkgNid = _makeId(pkgName);\n            addNode(pkgNid, pkgName, line);\n            addEdge(scopeNid, pkgNid, \"imports\", line);\n          }\n        }\n      }\n      return;\n    }\n\n    for (const child of node.children) {\n      walk(child, scopeNid);\n    }\n  }\n\n  walk(root, fileNid);\n\n  for (const [funcNid, bodyNode] of functionBodies) {\n    if (bodyNode.type === \"function_definition\") {\n      for (const child of bodyNode.children) {\n        if (child.type !== \"signature\") {\n          walkCalls(child, funcNid);\n        }\n      }\n    } else {\n      walkCalls(bodyNode, funcNid);\n    }\n  }\n\n  return { nodes, edges };\n}\n\n// ---------------------------------------------------------------------------\n// Go extractor (custom walk)\n// ---------------------------------------------------------------------------\n\nexport async function extractGo(filePath: string): Promise<ExtractionResult> {\n  await ensureParserInit();\n  const lang = await loadLanguage(\"go\");\n  if (!lang) {\n    return { nodes: [], edges: [], error: \"tree-sitter-go not available\" };\n  }\n\n  let source: string;\n  let tree: Tree;\n  try {\n    const parser = new Parser();\n    parser.setLanguage(lang);\n    source = readFileSync(filePath, \"utf-8\");\n    tree = parseText(parser, source);\n  } catch (e: unknown) {\n    return { nodes: [], edges: [], error: String(e) };\n  }\n\n  const root = tree.rootNode;\n  const stem = basename(filePath, extname(filePath));\n  const pkgScope = dirname(filePath).split(sep).pop() || stem;\n  const strPath = filePath;\n  const nodes: GraphNode[] = [];\n  const edges: GraphEdge[] = [];\n  const seenIds = new Set<string>();\n  const functionBodies: Array<[string, SyntaxNode]> = [];\n\n  function addNode(nid: string, label: string, line: number): void {\n    if (!seenIds.has(nid)) {\n      seenIds.add(nid);\n      nodes.push({ id: nid, label, file_type: \"code\", source_file: strPath, source_location: `L${line}` });\n    }\n  }\n\n  function addEdge(\n    src: string, tgt: string, relation: string, line: number,\n    confidence: \"EXTRACTED\" | \"INFERRED\" = \"EXTRACTED\", weight: number = 1.0,\n  ): void {\n    edges.push({ source: src, target: tgt, relation, confidence, source_file: strPath, source_location: `L${line}`, weight });\n  }\n\n  const fileNid = _makeId(stem);\n  addNode(fileNid, basename(filePath), 1);\n\n  function walk(node: SyntaxNode): void {\n    const t = node.type;\n\n    if (t === \"function_declaration\") {\n      const nameNode = node.childForFieldName(\"name\");\n      if (nameNode) {\n        const funcName = _readText(nameNode, source);\n        const line = node.startPosition.row + 1;\n        const funcNid = _makeId(stem, funcName);\n        addNode(funcNid, `${funcName}()`, line);\n        addEdge(fileNid, funcNid, \"contains\", line);\n        const body = node.childForFieldName(\"body\");\n        if (body) functionBodies.push([funcNid, body]);\n      }\n      return;\n    }\n\n    if (t === \"method_declaration\") {\n      const receiver = node.childForFieldName(\"receiver\");\n      let receiverType: string | null = null;\n      if (receiver) {\n        for (const param of receiver.children) {\n          if (param.type === \"parameter_declaration\") {\n            const typeNode = param.childForFieldName(\"type\");\n            if (typeNode) {\n              receiverType = _readText(typeNode, source).replace(/^\\*/, \"\").trim();\n            }\n            break;\n          }\n        }\n      }\n      const nameNode = node.childForFieldName(\"name\");\n      if (nameNode) {\n        const methodName = _readText(nameNode, source);\n        const line = node.startPosition.row + 1;\n        let methodNid: string;\n        if (receiverType) {\n          const parentNid = _makeId(pkgScope, receiverType);\n          addNode(parentNid, receiverType, line);\n          methodNid = _makeId(parentNid, methodName);\n          addNode(methodNid, `.${methodName}()`, line);\n          addEdge(parentNid, methodNid, \"method\", line);\n        } else {\n          methodNid = _makeId(stem, methodName);\n          addNode(methodNid, `${methodName}()`, line);\n          addEdge(fileNid, methodNid, \"contains\", line);\n        }\n        const body = node.childForFieldName(\"body\");\n        if (body) functionBodies.push([methodNid, body]);\n      }\n      return;\n    }\n\n    if (t === \"type_declaration\") {\n      for (const child of node.children) {\n        if (child.type === \"type_spec\") {\n          const nameNode = child.childForFieldName(\"name\");\n          if (nameNode) {\n            const typeName = _readText(nameNode, source);\n            const line = child.startPosition.row + 1;\n            const typeNid = _makeId(pkgScope, typeName);\n            addNode(typeNid, typeName, line);\n            addEdge(fileNid, typeNid, \"contains\", line);\n          }\n        }\n      }\n      return;\n    }\n\n    if (t === \"import_declaration\") {\n      for (const child of node.children) {\n        if (child.type === \"import_spec_list\") {\n          for (const spec of child.children) {\n            if (spec.type === \"import_spec\") {\n              const pathNode = spec.childForFieldName(\"path\");\n              if (pathNode) {\n                const raw = _readText(pathNode, source).replace(/^\"|\"$/g, \"\");\n                const moduleName = raw.split(\"/\").pop()!;\n                const tgtNid = _makeId(moduleName);\n                addEdge(fileNid, tgtNid, \"imports_from\", spec.startPosition.row + 1);\n              }\n            }\n          }\n        } else if (child.type === \"import_spec\") {\n          const pathNode = child.childForFieldName(\"path\");\n          if (pathNode) {\n            const raw = _readText(pathNode, source).replace(/^\"|\"$/g, \"\");\n            const moduleName = raw.split(\"/\").pop()!;\n            const tgtNid = _makeId(moduleName);\n            addEdge(fileNid, tgtNid, \"imports_from\", child.startPosition.row + 1);\n          }\n        }\n      }\n      return;\n    }\n\n    for (const child of node.children) {\n      walk(child);\n    }\n  }\n\n  walk(root);\n\n  // Call-graph pass\n  const labelToNid = new Map<string, string>();\n  for (const n of nodes) {\n    const normalised = n.label.replace(/\\(?\\)$/g, \"\").replace(/^\\./, \"\");\n    labelToNid.set(normalised.toLowerCase(), n.id);\n  }\n\n  const seenCallPairs = new Set<string>();\n\n  function walkCalls(node: SyntaxNode, callerNid: string): void {\n    if (node.type === \"function_declaration\" || node.type === \"method_declaration\") return;\n    if (node.type === \"call_expression\") {\n      const funcNode = node.childForFieldName(\"function\");\n      let calleeName: string | null = null;\n      if (funcNode) {\n        if (funcNode.type === \"identifier\") {\n          calleeName = _readText(funcNode, source);\n        } else if (funcNode.type === \"selector_expression\") {\n          const field = funcNode.childForFieldName(\"field\");\n          if (field) calleeName = _readText(field, source);\n        }\n      }\n      if (calleeName) {\n        const tgtNid = labelToNid.get(calleeName.toLowerCase());\n        if (tgtNid && tgtNid !== callerNid) {\n          const pair = `${callerNid}|${tgtNid}`;\n          if (!seenCallPairs.has(pair)) {\n            seenCallPairs.add(pair);\n            const line = node.startPosition.row + 1;\n            edges.push({\n              source: callerNid, target: tgtNid, relation: \"calls\",\n              confidence: \"INFERRED\", source_file: strPath,\n              source_location: `L${line}`, weight: 0.8,\n            });\n          }\n        }\n      }\n    }\n    for (const child of node.children) {\n      walkCalls(child, callerNid);\n    }\n  }\n\n  for (const [callerNid, bodyNode] of functionBodies) {\n    walkCalls(bodyNode, callerNid);\n  }\n\n  const cleanEdges = edges.filter((e) =>\n    seenIds.has(e.source) && (seenIds.has(e.target) || e.relation === \"imports\" || e.relation === \"imports_from\"),\n  );\n\n  return { nodes, edges: cleanEdges };\n}\n\n// ---------------------------------------------------------------------------\n// Rust extractor (custom walk)\n// ---------------------------------------------------------------------------\n\nexport async function extractRust(filePath: string): Promise<ExtractionResult> {\n  await ensureParserInit();\n  const lang = await loadLanguage(\"rust\");\n  if (!lang) {\n    return { nodes: [], edges: [], error: \"tree-sitter-rust not available\" };\n  }\n\n  let source: string;\n  let tree: Tree;\n  try {\n    const parser = new Parser();\n    parser.setLanguage(lang);\n    source = readFileSync(filePath, \"utf-8\");\n    tree = parseText(parser, source);\n  } catch (e: unknown) {\n    return { nodes: [], edges: [], error: String(e) };\n  }\n\n  const root = tree.rootNode;\n  const stem = basename(filePath, extname(filePath));\n  const strPath = filePath;\n  const nodes: GraphNode[] = [];\n  const edges: GraphEdge[] = [];\n  const seenIds = new Set<string>();\n  const functionBodies: Array<[string, SyntaxNode]> = [];\n\n  function addNode(nid: string, label: string, line: number): void {\n    if (!seenIds.has(nid)) {\n      seenIds.add(nid);\n      nodes.push({ id: nid, label, file_type: \"code\", source_file: strPath, source_location: `L${line}` });\n    }\n  }\n\n  function addEdge(\n    src: string, tgt: string, relation: string, line: number,\n    confidence: \"EXTRACTED\" | \"INFERRED\" = \"EXTRACTED\", weight: number = 1.0,\n  ): void {\n    edges.push({ source: src, target: tgt, relation, confidence, source_file: strPath, source_location: `L${line}`, weight });\n  }\n\n  const fileNid = _makeId(stem);\n  addNode(fileNid, basename(filePath), 1);\n\n  function walk(node: SyntaxNode, parentImplNid: string | null = null): void {\n    const t = node.type;\n\n    if (t === \"function_item\") {\n      const nameNode = node.childForFieldName(\"name\");\n      if (nameNode) {\n        const funcName = _readText(nameNode, source);\n        const line = node.startPosition.row + 1;\n        let funcNid: string;\n        if (parentImplNid) {\n          funcNid = _makeId(parentImplNid, funcName);\n          addNode(funcNid, `.${funcName}()`, line);\n          addEdge(parentImplNid, funcNid, \"method\", line);\n        } else {\n          funcNid = _makeId(stem, funcName);\n          addNode(funcNid, `${funcName}()`, line);\n          addEdge(fileNid, funcNid, \"contains\", line);\n        }\n        const body = node.childForFieldName(\"body\");\n        if (body) functionBodies.push([funcNid, body]);\n      }\n      return;\n    }\n\n    if (t === \"struct_item\" || t === \"enum_item\" || t === \"trait_item\") {\n      const nameNode = node.childForFieldName(\"name\");\n      if (nameNode) {\n        const itemName = _readText(nameNode, source);\n        const line = node.startPosition.row + 1;\n        const itemNid = _makeId(stem, itemName);\n        addNode(itemNid, itemName, line);\n        addEdge(fileNid, itemNid, \"contains\", line);\n      }\n      return;\n    }\n\n    if (t === \"impl_item\") {\n      const typeNode = node.childForFieldName(\"type\");\n      let implNid: string | null = null;\n      if (typeNode) {\n        const typeName = _readText(typeNode, source).trim();\n        implNid = _makeId(stem, typeName);\n        addNode(implNid, typeName, node.startPosition.row + 1);\n      }\n      const body = node.childForFieldName(\"body\");\n      if (body) {\n        for (const child of body.children) {\n          walk(child, implNid);\n        }\n      }\n      return;\n    }\n\n    if (t === \"use_declaration\") {\n      const arg = node.childForFieldName(\"argument\");\n      if (arg) {\n        const raw = _readText(arg, source);\n        const clean = raw.split(\"{\")[0]!.replace(/:+$/, \"\").replace(/\\*$/, \"\").replace(/:+$/, \"\");\n        const moduleName = clean.split(\"::\").pop()!.trim();\n        if (moduleName) {\n          const tgtNid = _makeId(moduleName);\n          addEdge(fileNid, tgtNid, \"imports_from\", node.startPosition.row + 1);\n        }\n      }\n      return;\n    }\n\n    for (const child of node.children) {\n      walk(child, null);\n    }\n  }\n\n  walk(root);\n\n  // Call-graph pass\n  const labelToNid = new Map<string, string>();\n  for (const n of nodes) {\n    const normalised = n.label.replace(/\\(?\\)$/g, \"\").replace(/^\\./, \"\");\n    labelToNid.set(normalised.toLowerCase(), n.id);\n  }\n\n  const seenCallPairs = new Set<string>();\n\n  function walkCalls(node: SyntaxNode, callerNid: string): void {\n    if (node.type === \"function_item\") return;\n    if (node.type === \"call_expression\") {\n      const funcNode = node.childForFieldName(\"function\");\n      let calleeName: string | null = null;\n      if (funcNode) {\n        if (funcNode.type === \"identifier\") {\n          calleeName = _readText(funcNode, source);\n        } else if (funcNode.type === \"field_expression\") {\n          const field = funcNode.childForFieldName(\"field\");\n          if (field) calleeName = _readText(field, source);\n        } else if (funcNode.type === \"scoped_identifier\") {\n          const name = funcNode.childForFieldName(\"name\");\n          if (name) calleeName = _readText(name, source);\n        }\n      }\n      if (calleeName) {\n        const tgtNid = labelToNid.get(calleeName.toLowerCase());\n        if (tgtNid && tgtNid !== callerNid) {\n          const pair = `${callerNid}|${tgtNid}`;\n          if (!seenCallPairs.has(pair)) {\n            seenCallPairs.add(pair);\n            const line = node.startPosition.row + 1;\n            edges.push({\n              source: callerNid, target: tgtNid, relation: \"calls\",\n              confidence: \"INFERRED\", source_file: strPath,\n              source_location: `L${line}`, weight: 0.8,\n            });\n          }\n        }\n      }\n    }\n    for (const child of node.children) {\n      walkCalls(child, callerNid);\n    }\n  }\n\n  for (const [callerNid, bodyNode] of functionBodies) {\n    walkCalls(bodyNode, callerNid);\n  }\n\n  const cleanEdges = edges.filter((e) =>\n    seenIds.has(e.source) && (seenIds.has(e.target) || e.relation === \"imports\" || e.relation === \"imports_from\"),\n  );\n\n  return { nodes, edges: cleanEdges };\n}\n\n// ---------------------------------------------------------------------------\n// Zig extractor (custom walk)\n// ---------------------------------------------------------------------------\n\nexport async function extractZig(filePath: string): Promise<ExtractionResult> {\n  await ensureParserInit();\n  const lang = await loadLanguage(\"zig\");\n  if (!lang) {\n    return { nodes: [], edges: [], error: \"tree-sitter-zig not available\" };\n  }\n\n  let source: string;\n  let tree: Tree;\n  try {\n    const parser = new Parser();\n    parser.setLanguage(lang);\n    source = readFileSync(filePath, \"utf-8\");\n    tree = parseText(parser, source);\n  } catch (e: unknown) {\n    return { nodes: [], edges: [], error: String(e) };\n  }\n\n  const root = tree.rootNode;\n  const stem = basename(filePath, extname(filePath));\n  const strPath = filePath;\n  const nodes: GraphNode[] = [];\n  const edges: GraphEdge[] = [];\n  const seenIds = new Set<string>();\n  const functionBodies: Array<[string, SyntaxNode]> = [];\n\n  function addNode(nid: string, label: string, line: number): void {\n    if (!seenIds.has(nid)) {\n      seenIds.add(nid);\n      nodes.push({ id: nid, label, file_type: \"code\", source_file: strPath, source_location: `L${line}` });\n    }\n  }\n\n  function addEdge(\n    src: string, tgt: string, relation: string, line: number,\n    confidence: \"EXTRACTED\" | \"INFERRED\" = \"EXTRACTED\", weight: number = 1.0,\n  ): void {\n    edges.push({ source: src, target: tgt, relation, confidence, source_file: strPath, source_location: `L${line}`, weight });\n  }\n\n  const fileNid = _makeId(stem);\n  addNode(fileNid, basename(filePath), 1);\n\n  function extractImport(node: SyntaxNode): void {\n    for (const child of node.children) {\n      if (child.type === \"builtin_function\") {\n        let bi: string | null = null;\n        let args: SyntaxNode | null = null;\n        for (const c of child.children) {\n          if (c.type === \"builtin_identifier\") bi = _readText(c, source);\n          else if (c.type === \"arguments\") args = c;\n        }\n        if ((bi === \"@import\" || bi === \"@cImport\") && args) {\n          for (const arg of args.children) {\n            if (arg.type === \"string_literal\" || arg.type === \"string\") {\n              const raw = _readText(arg, source).replace(/^\"|\"$/g, \"\");\n              const moduleName = raw.split(\"/\").pop()!.split(\".\")[0]!;\n              if (moduleName) {\n                const tgtNid = _makeId(moduleName);\n                addEdge(fileNid, tgtNid, \"imports_from\", node.startPosition.row + 1);\n              }\n              return;\n            }\n          }\n        }\n      } else if (child.type === \"field_expression\") {\n        extractImport(child);\n        return;\n      }\n    }\n  }\n\n  function walk(node: SyntaxNode, parentStructNid: string | null = null): void {\n    const t = node.type;\n\n    if (t === \"function_declaration\") {\n      const nameNode = node.childForFieldName(\"name\");\n      if (nameNode) {\n        const funcName = _readText(nameNode, source);\n        const line = node.startPosition.row + 1;\n        let funcNid: string;\n        if (parentStructNid) {\n          funcNid = _makeId(parentStructNid, funcName);\n          addNode(funcNid, `.${funcName}()`, line);\n          addEdge(parentStructNid, funcNid, \"method\", line);\n        } else {\n          funcNid = _makeId(stem, funcName);\n          addNode(funcNid, `${funcName}()`, line);\n          addEdge(fileNid, funcNid, \"contains\", line);\n        }\n        const body = node.childForFieldName(\"body\");\n        if (body) functionBodies.push([funcNid, body]);\n      }\n      return;\n    }\n\n    if (t === \"variable_declaration\") {\n      let nameNode: SyntaxNode | null = null;\n      let valueNode: SyntaxNode | null = null;\n      for (const child of node.children) {\n        if (child.type === \"identifier\") {\n          nameNode = child;\n        } else if ([\"struct_declaration\", \"enum_declaration\", \"union_declaration\", \"builtin_function\", \"field_expression\"].includes(child.type)) {\n          valueNode = child;\n        }\n      }\n\n      if (valueNode && valueNode.type === \"struct_declaration\") {\n        if (nameNode) {\n          const structName = _readText(nameNode, source);\n          const line = node.startPosition.row + 1;\n          const structNid = _makeId(stem, structName);\n          addNode(structNid, structName, line);\n          addEdge(fileNid, structNid, \"contains\", line);\n          for (const child of valueNode.children) {\n            walk(child, structNid);\n          }\n        }\n        return;\n      }\n\n      if (valueNode && (valueNode.type === \"enum_declaration\" || valueNode.type === \"union_declaration\")) {\n        if (nameNode) {\n          const typeName = _readText(nameNode, source);\n          const line = node.startPosition.row + 1;\n          const typeNid = _makeId(stem, typeName);\n          addNode(typeNid, typeName, line);\n          addEdge(fileNid, typeNid, \"contains\", line);\n        }\n        return;\n      }\n\n      if (valueNode && (valueNode.type === \"builtin_function\" || valueNode.type === \"field_expression\")) {\n        extractImport(node);\n      }\n      return;\n    }\n\n    for (const child of node.children) {\n      walk(child, parentStructNid);\n    }\n  }\n\n  walk(root);\n\n  // Call-graph pass\n  const seenCallPairs = new Set<string>();\n\n  function walkCalls(node: SyntaxNode, callerNid: string): void {\n    if (node.type === \"function_declaration\") return;\n    if (node.type === \"call_expression\") {\n      const fn = node.childForFieldName(\"function\");\n      if (fn) {\n        const callee = _readText(fn, source).split(\".\").pop()!;\n        const tgtNid = nodes.find(\n          (n) => n.label === `${callee}()` || n.label === `.${callee}()`,\n        )?.id ?? null;\n        if (tgtNid && tgtNid !== callerNid) {\n          const pair = `${callerNid}|${tgtNid}`;\n          if (!seenCallPairs.has(pair)) {\n            seenCallPairs.add(pair);\n            addEdge(callerNid, tgtNid, \"calls\", node.startPosition.row + 1, \"INFERRED\", 0.8);\n          }\n        }\n      }\n    }\n    for (const child of node.children) {\n      walkCalls(child, callerNid);\n    }\n  }\n\n  for (const [callerNid, bodyNode] of functionBodies) {\n    walkCalls(bodyNode, callerNid);\n  }\n\n  const cleanEdges = edges.filter((e) =>\n    seenIds.has(e.source) && (seenIds.has(e.target) || e.relation === \"imports_from\"),\n  );\n\n  return { nodes, edges: cleanEdges };\n}\n\n// ---------------------------------------------------------------------------\n// PowerShell extractor (custom walk)\n// ---------------------------------------------------------------------------\n\nexport async function extractPowershell(filePath: string): Promise<ExtractionResult> {\n  await ensureParserInit();\n  const lang = await loadLanguage(\"powershell\");\n  if (!lang) {\n    return { nodes: [], edges: [], error: \"tree-sitter-powershell not available\" };\n  }\n\n  let source: string;\n  let tree: Tree;\n  try {\n    const parser = new Parser();\n    parser.setLanguage(lang);\n    source = readFileSync(filePath, \"utf-8\");\n    tree = parseText(parser, source);\n  } catch (e: unknown) {\n    return { nodes: [], edges: [], error: String(e) };\n  }\n\n  const root = tree.rootNode;\n  const stem = basename(filePath, extname(filePath));\n  const strPath = filePath;\n  const nodes: GraphNode[] = [];\n  const edges: GraphEdge[] = [];\n  const seenIds = new Set<string>();\n  const functionBodies: Array<[string, SyntaxNode]> = [];\n\n  function addNode(nid: string, label: string, line: number): void {\n    if (!seenIds.has(nid)) {\n      seenIds.add(nid);\n      nodes.push({ id: nid, label, file_type: \"code\", source_file: strPath, source_location: `L${line}` });\n    }\n  }\n\n  function addEdge(\n    src: string, tgt: string, relation: string, line: number,\n    confidence: \"EXTRACTED\" | \"INFERRED\" = \"EXTRACTED\", weight: number = 1.0,\n  ): void {\n    edges.push({ source: src, target: tgt, relation, confidence, source_file: strPath, source_location: `L${line}`, weight });\n  }\n\n  const fileNid = _makeId(stem);\n  addNode(fileNid, basename(filePath), 1);\n\n  const _PS_SKIP = new Set([\n    \"using\", \"return\", \"if\", \"else\", \"elseif\", \"foreach\", \"for\",\n    \"while\", \"do\", \"switch\", \"try\", \"catch\", \"finally\", \"throw\",\n    \"break\", \"continue\", \"exit\", \"param\", \"begin\", \"process\", \"end\",\n  ]);\n\n  function findScriptBlockBody(node: SyntaxNode): SyntaxNode | null {\n    for (const child of node.children) {\n      if (child.type === \"script_block\") {\n        for (const sc of child.children) {\n          if (sc.type === \"script_block_body\") return sc;\n        }\n        return child;\n      }\n    }\n    return null;\n  }\n\n  function walk(node: SyntaxNode, parentClassNid: string | null = null): void {\n    const t = node.type;\n\n    if (t === \"function_statement\") {\n      const nameNode = node.children.find((c) => c.type === \"function_name\") ?? null;\n      if (nameNode) {\n        const funcName = _readText(nameNode, source);\n        const line = node.startPosition.row + 1;\n        const funcNid = _makeId(stem, funcName);\n        addNode(funcNid, `${funcName}()`, line);\n        addEdge(fileNid, funcNid, \"contains\", line);\n        const body = findScriptBlockBody(node);\n        if (body) functionBodies.push([funcNid, body]);\n      }\n      return;\n    }\n\n    if (t === \"class_statement\") {\n      const nameNode = node.children.find((c) => c.type === \"simple_name\") ?? null;\n      if (nameNode) {\n        const className = _readText(nameNode, source);\n        const line = node.startPosition.row + 1;\n        const classNid = _makeId(stem, className);\n        addNode(classNid, className, line);\n        addEdge(fileNid, classNid, \"contains\", line);\n        for (const child of node.children) {\n          walk(child, classNid);\n        }\n      }\n      return;\n    }\n\n    if (t === \"class_method_definition\") {\n      const nameNode = node.children.find((c) => c.type === \"simple_name\") ?? null;\n      if (nameNode) {\n        const methodName = _readText(nameNode, source);\n        const line = node.startPosition.row + 1;\n        let methodNid: string;\n        if (parentClassNid) {\n          methodNid = _makeId(parentClassNid, methodName);\n          addNode(methodNid, `.${methodName}()`, line);\n          addEdge(parentClassNid, methodNid, \"method\", line);\n        } else {\n          methodNid = _makeId(stem, methodName);\n          addNode(methodNid, `${methodName}()`, line);\n          addEdge(fileNid, methodNid, \"contains\", line);\n        }\n        const body = findScriptBlockBody(node);\n        if (body) functionBodies.push([methodNid, body]);\n      }\n      return;\n    }\n\n    if (t === \"command\") {\n      const cmdNameNode = node.children.find((c) => c.type === \"command_name\") ?? null;\n      if (cmdNameNode) {\n        const cmdText = _readText(cmdNameNode, source).toLowerCase();\n        if (cmdText === \"using\") {\n          const tokens: string[] = [];\n          for (const child of node.children) {\n            if (child.type === \"command_elements\") {\n              for (const el of child.children) {\n                if (el.type === \"generic_token\") {\n                  tokens.push(_readText(el, source));\n                }\n              }\n            }\n          }\n          const moduleTokens = tokens.filter(\n            (tk) => ![\"namespace\", \"module\", \"assembly\"].includes(tk.toLowerCase()),\n          );\n          if (moduleTokens.length > 0) {\n            const moduleName = moduleTokens[moduleTokens.length - 1]!.split(\".\").pop()!;\n            addEdge(fileNid, _makeId(moduleName), \"imports_from\", node.startPosition.row + 1);\n          }\n        }\n      }\n      return;\n    }\n\n    for (const child of node.children) {\n      walk(child, parentClassNid);\n    }\n  }\n\n  walk(root);\n\n  // Call-graph pass\n  const labelToNid = new Map<string, string>();\n  for (const n of nodes) {\n    const normalised = n.label.replace(/\\(?\\)$/g, \"\").replace(/^\\./, \"\");\n    labelToNid.set(normalised.toLowerCase(), n.id);\n  }\n\n  const seenCallPairs = new Set<string>();\n\n  function walkCalls(node: SyntaxNode, callerNid: string): void {\n    if (node.type === \"function_statement\" || node.type === \"class_statement\") return;\n    if (node.type === \"command\") {\n      const cmdNameNode = node.children.find((c) => c.type === \"command_name\") ?? null;\n      if (cmdNameNode) {\n        const cmdText = _readText(cmdNameNode, source);\n        if (!_PS_SKIP.has(cmdText.toLowerCase())) {\n          const tgtNid = labelToNid.get(cmdText.toLowerCase());\n          if (tgtNid && tgtNid !== callerNid) {\n            const pair = `${callerNid}|${tgtNid}`;\n            if (!seenCallPairs.has(pair)) {\n              seenCallPairs.add(pair);\n              addEdge(callerNid, tgtNid, \"calls\", node.startPosition.row + 1, \"INFERRED\", 0.8);\n            }\n          }\n        }\n      }\n    }\n    for (const child of node.children) {\n      walkCalls(child, callerNid);\n    }\n  }\n\n  for (const [callerNid, bodyNode] of functionBodies) {\n    walkCalls(bodyNode, callerNid);\n  }\n\n  const cleanEdges = edges.filter((e) =>\n    seenIds.has(e.source) && (seenIds.has(e.target) || e.relation === \"imports_from\"),\n  );\n\n  return { nodes, edges: cleanEdges };\n}\n\n// ---------------------------------------------------------------------------\n// Objective-C extractor (custom walk)\n// ---------------------------------------------------------------------------\n\nexport async function extractObjc(filePath: string): Promise<ExtractionResult> {\n  await ensureParserInit();\n  const lang = await loadLanguage(\"objc\");\n  if (!lang) {\n    return { nodes: [], edges: [], error: \"tree-sitter-objc not available\" };\n  }\n\n  let source: string;\n  let tree: Tree;\n  try {\n    const parser = new Parser();\n    parser.setLanguage(lang);\n    source = readFileSync(filePath, \"utf-8\");\n    tree = parseText(parser, source);\n  } catch (e: unknown) {\n    return { nodes: [], edges: [], error: String(e) };\n  }\n\n  const root = tree.rootNode;\n  const stem = basename(filePath, extname(filePath));\n  const strPath = filePath;\n  const nodes: GraphNode[] = [];\n  const edges: GraphEdge[] = [];\n  const seenIds = new Set<string>();\n  const methodBodies: Array<[string, SyntaxNode]> = [];\n\n  function addNode(nid: string, label: string, line: number): void {\n    if (!seenIds.has(nid)) {\n      seenIds.add(nid);\n      nodes.push({ id: nid, label, file_type: \"code\", source_file: strPath, source_location: `L${line}` });\n    }\n  }\n\n  function addEdge(\n    src: string, tgt: string, relation: string, line: number,\n    confidence: \"EXTRACTED\" | \"INFERRED\" = \"EXTRACTED\", weight: number = 1.0,\n  ): void {\n    edges.push({ source: src, target: tgt, relation, confidence, source_file: strPath, source_location: `L${line}`, weight });\n  }\n\n  const fileNid = _makeId(stem);\n  addNode(fileNid, basename(filePath), 1);\n\n  function _read(node: SyntaxNode): string {\n    return source.slice(node.startIndex, node.endIndex);\n  }\n\n  function walk(node: SyntaxNode, parentNid: string | null = null): void {\n    const t = node.type;\n    const line = node.startPosition.row + 1;\n\n    if (t === \"preproc_include\") {\n      for (const child of node.children) {\n        if (child.type === \"system_lib_string\") {\n          const raw = _read(child).replace(/^[<>]+|[<>]+$/g, \"\");\n          const module = raw.split(\"/\").pop()!.replace(\".h\", \"\");\n          if (module) {\n            const tgtNid = _makeId(module);\n            addEdge(fileNid, tgtNid, \"imports\", line);\n          }\n        } else if (child.type === \"string_literal\") {\n          for (const sub of child.children) {\n            if (sub.type === \"string_content\") {\n              const raw = _read(sub);\n              const module = raw.split(\"/\").pop()!.replace(\".h\", \"\");\n              if (module) {\n                const tgtNid = _makeId(module);\n                addEdge(fileNid, tgtNid, \"imports\", line);\n              }\n            }\n          }\n        }\n      }\n      return;\n    }\n\n    if (t === \"class_interface\") {\n      const identifiers = node.children.filter((c) => c.type === \"identifier\");\n      if (identifiers.length === 0) {\n        for (const child of node.children) walk(child, parentNid);\n        return;\n      }\n      const name = _read(identifiers[0]!);\n      const clsNid = _makeId(stem, name);\n      addNode(clsNid, name, line);\n      addEdge(fileNid, clsNid, \"contains\", line);\n      // superclass is second identifier after ':'\n      let colonSeen = false;\n      for (const child of node.children) {\n        if (child.type === \":\") {\n          colonSeen = true;\n        } else if (colonSeen && child.type === \"identifier\") {\n          const superNid = _makeId(_read(child));\n          addEdge(clsNid, superNid, \"inherits\", line);\n          colonSeen = false;\n        } else if (child.type === \"parameterized_arguments\") {\n          for (const sub of child.children) {\n            if (sub.type === \"type_name\") {\n              for (const s of sub.children) {\n                if (s.type === \"type_identifier\") {\n                  const protoNid = _makeId(_read(s));\n                  addEdge(clsNid, protoNid, \"imports\", line);\n                }\n              }\n            }\n          }\n        } else if (child.type === \"method_declaration\") {\n          walk(child, clsNid);\n        }\n      }\n      return;\n    }\n\n    if (t === \"class_implementation\") {\n      let name: string | null = null;\n      for (const child of node.children) {\n        if (child.type === \"identifier\") { name = _read(child); break; }\n      }\n      if (!name) {\n        for (const child of node.children) walk(child, parentNid);\n        return;\n      }\n      const implNid = _makeId(stem, name);\n      if (!seenIds.has(implNid)) {\n        addNode(implNid, name, line);\n        addEdge(fileNid, implNid, \"contains\", line);\n      }\n      for (const child of node.children) {\n        if (child.type === \"implementation_definition\") {\n          for (const sub of child.children) walk(sub, implNid);\n        }\n      }\n      return;\n    }\n\n    if (t === \"protocol_declaration\") {\n      let name: string | null = null;\n      for (const child of node.children) {\n        if (child.type === \"identifier\") { name = _read(child); break; }\n      }\n      if (name) {\n        const protoNid = _makeId(stem, name);\n        addNode(protoNid, `<${name}>`, line);\n        addEdge(fileNid, protoNid, \"contains\", line);\n        for (const child of node.children) walk(child, protoNid);\n      }\n      return;\n    }\n\n    if (t === \"method_declaration\" || t === \"method_definition\") {\n      const container = parentNid || fileNid;\n      const parts: string[] = [];\n      for (const child of node.children) {\n        if (child.type === \"identifier\") {\n          parts.push(_read(child));\n        }\n      }\n      const methodName = parts.join(\"\") || null;\n      if (methodName) {\n        const methodNid = _makeId(container, methodName);\n        addNode(methodNid, `-${methodName}`, line);\n        addEdge(container, methodNid, \"method\", line);\n        if (t === \"method_definition\") {\n          methodBodies.push([methodNid, node]);\n        }\n      }\n      return;\n    }\n\n    for (const child of node.children) {\n      walk(child, parentNid);\n    }\n  }\n\n  walk(root);\n\n  // Second pass: resolve calls inside method bodies\n  const allMethodNids = new Set(nodes.filter((n) => n.id !== fileNid).map((n) => n.id));\n  const seenCalls = new Set<string>();\n\n  for (const [callerNid, bodyNode] of methodBodies) {\n    function objcWalkCalls(n: SyntaxNode): void {\n      if (n.type === \"message_expression\") {\n        for (const child of n.children) {\n          if (child.type === \"selector\" || child.type === \"keyword_argument_list\") {\n            const sel: string[] = [];\n            if (child.type === \"selector\") {\n              sel.push(_read(child));\n            } else {\n              for (const sub of child.children) {\n                if (sub.type === \"keyword_argument\") {\n                  for (const s of sub.children) {\n                    if (s.type === \"selector\") sel.push(_read(s));\n                  }\n                }\n              }\n            }\n            const methodName = sel.join(\"\");\n            for (const candidate of allMethodNids) {\n              if (candidate.endsWith(_makeId(\"\", methodName).replace(/^_/, \"\"))) {\n                const pair = `${callerNid}|${candidate}`;\n                if (!seenCalls.has(pair) && callerNid !== candidate) {\n                  seenCalls.add(pair);\n                  addEdge(callerNid, candidate, \"calls\", bodyNode.startPosition.row + 1, \"INFERRED\", 0.8);\n                }\n              }\n            }\n          }\n        }\n      }\n      for (const child of n.children) {\n        objcWalkCalls(child);\n      }\n    }\n    objcWalkCalls(bodyNode);\n  }\n\n  return { nodes, edges, error: undefined };\n}\n\n// ---------------------------------------------------------------------------\n// Elixir extractor (custom walk)\n// ---------------------------------------------------------------------------\n\nexport async function extractElixir(filePath: string): Promise<ExtractionResult> {\n  await ensureParserInit();\n  const lang = await loadLanguage(\"elixir\");\n  if (!lang) {\n    return { nodes: [], edges: [], error: \"tree-sitter-elixir not available\" };\n  }\n\n  let source: string;\n  let tree: Tree;\n  try {\n    const parser = new Parser();\n    parser.setLanguage(lang);\n    source = readFileSync(filePath, \"utf-8\");\n    tree = parseText(parser, source);\n  } catch (e: unknown) {\n    return { nodes: [], edges: [], error: String(e) };\n  }\n\n  const root = tree.rootNode;\n  const stem = basename(filePath, extname(filePath));\n  const strPath = filePath;\n  const nodes: GraphNode[] = [];\n  const edges: GraphEdge[] = [];\n  const seenIds = new Set<string>();\n  const functionBodies: Array<[string, SyntaxNode]> = [];\n\n  function addNode(nid: string, label: string, line: number): void {\n    if (!seenIds.has(nid)) {\n      seenIds.add(nid);\n      nodes.push({ id: nid, label, file_type: \"code\", source_file: strPath, source_location: `L${line}` });\n    }\n  }\n\n  function addEdge(\n    src: string, tgt: string, relation: string, line: number,\n    confidence: \"EXTRACTED\" | \"INFERRED\" = \"EXTRACTED\", weight: number = 1.0,\n  ): void {\n    edges.push({ source: src, target: tgt, relation, confidence, source_file: strPath, source_location: `L${line}`, weight });\n  }\n\n  const fileNid = _makeId(stem);\n  addNode(fileNid, basename(filePath), 1);\n\n  const _IMPORT_KEYWORDS = new Set([\"alias\", \"import\", \"require\", \"use\"]);\n\n  function getAliasText(node: SyntaxNode): string | null {\n    for (const child of node.children) {\n      if (child.type === \"alias\") {\n        return source.slice(child.startIndex, child.endIndex);\n      }\n    }\n    return null;\n  }\n\n  function walk(node: SyntaxNode, parentModuleNid: string | null = null): void {\n    if (node.type !== \"call\") {\n      for (const child of node.children) walk(child, parentModuleNid);\n      return;\n    }\n\n    let identifierNode: SyntaxNode | null = null;\n    let argumentsNode: SyntaxNode | null = null;\n    let doBlockNode: SyntaxNode | null = null;\n    for (const child of node.children) {\n      if (child.type === \"identifier\") identifierNode = child;\n      else if (child.type === \"arguments\") argumentsNode = child;\n      else if (child.type === \"do_block\") doBlockNode = child;\n    }\n\n    if (!identifierNode) {\n      for (const child of node.children) walk(child, parentModuleNid);\n      return;\n    }\n\n    const keyword = source.slice(identifierNode.startIndex, identifierNode.endIndex);\n    const line = node.startPosition.row + 1;\n\n    if (keyword === \"defmodule\") {\n      const moduleName = argumentsNode ? getAliasText(argumentsNode) : null;\n      if (!moduleName) return;\n      const moduleNid = _makeId(stem, moduleName);\n      addNode(moduleNid, moduleName, line);\n      addEdge(fileNid, moduleNid, \"contains\", line);\n      if (doBlockNode) {\n        for (const child of doBlockNode.children) walk(child, moduleNid);\n      }\n      return;\n    }\n\n    if (keyword === \"def\" || keyword === \"defp\") {\n      let funcName: string | null = null;\n      if (argumentsNode) {\n        for (const child of argumentsNode.children) {\n          if (child.type === \"call\") {\n            for (const sub of child.children) {\n              if (sub.type === \"identifier\") {\n                funcName = source.slice(sub.startIndex, sub.endIndex);\n                break;\n              }\n            }\n          } else if (child.type === \"identifier\") {\n            funcName = source.slice(child.startIndex, child.endIndex);\n            break;\n          }\n        }\n      }\n      if (!funcName) return;\n      const container = parentModuleNid || fileNid;\n      const funcNid = _makeId(container, funcName);\n      addNode(funcNid, `${funcName}()`, line);\n      if (parentModuleNid) {\n        addEdge(parentModuleNid, funcNid, \"method\", line);\n      } else {\n        addEdge(fileNid, funcNid, \"contains\", line);\n      }\n      if (doBlockNode) {\n        functionBodies.push([funcNid, doBlockNode]);\n      }\n      return;\n    }\n\n    if (_IMPORT_KEYWORDS.has(keyword) && argumentsNode) {\n      const moduleName = getAliasText(argumentsNode);\n      if (moduleName) {\n        const tgtNid = _makeId(moduleName);\n        addEdge(fileNid, tgtNid, \"imports\", line);\n      }\n      return;\n    }\n\n    for (const child of node.children) walk(child, parentModuleNid);\n  }\n\n  walk(root);\n\n  // Call-graph pass\n  const labelToNid = new Map<string, string>();\n  for (const n of nodes) {\n    const normalised = n.label.replace(/\\(?\\)$/g, \"\").replace(/^\\./, \"\");\n    labelToNid.set(normalised.toLowerCase(), n.id);\n  }\n\n  const seenCallPairs = new Set<string>();\n  const _SKIP_KEYWORDS = new Set([\n    \"def\", \"defp\", \"defmodule\", \"defmacro\", \"defmacrop\",\n    \"defstruct\", \"defprotocol\", \"defimpl\", \"defguard\",\n    \"alias\", \"import\", \"require\", \"use\",\n    \"if\", \"unless\", \"case\", \"cond\", \"with\", \"for\",\n  ]);\n\n  function walkCalls(node: SyntaxNode, callerNid: string): void {\n    if (node.type !== \"call\") {\n      for (const child of node.children) walkCalls(child, callerNid);\n      return;\n    }\n    for (const child of node.children) {\n      if (child.type === \"identifier\") {\n        const kw = source.slice(child.startIndex, child.endIndex);\n        if (_SKIP_KEYWORDS.has(kw)) {\n          for (const c of node.children) walkCalls(c, callerNid);\n          return;\n        }\n        break;\n      }\n    }\n    let calleeName: string | null = null;\n    for (const child of node.children) {\n      if (child.type === \"dot\") {\n        const dotText = source.slice(child.startIndex, child.endIndex);\n        const parts = dotText.replace(/\\.$/, \"\").split(\".\");\n        if (parts.length > 0) calleeName = parts[parts.length - 1]!;\n        break;\n      }\n      if (child.type === \"identifier\") {\n        calleeName = source.slice(child.startIndex, child.endIndex);\n        break;\n      }\n    }\n    if (calleeName) {\n      const tgtNid = labelToNid.get(calleeName.toLowerCase());\n      if (tgtNid && tgtNid !== callerNid) {\n        const pair = `${callerNid}|${tgtNid}`;\n        if (!seenCallPairs.has(pair)) {\n          seenCallPairs.add(pair);\n          addEdge(callerNid, tgtNid, \"calls\", node.startPosition.row + 1, \"INFERRED\", 0.8);\n        }\n      }\n    }\n    for (const child of node.children) {\n      walkCalls(child, callerNid);\n    }\n  }\n\n  for (const [callerNid, body] of functionBodies) {\n    walkCalls(body, callerNid);\n  }\n\n  const cleanEdges = edges.filter((e) =>\n    seenIds.has(e.source) && (seenIds.has(e.target) || e.relation === \"imports\"),\n  );\n\n  return { nodes, edges: cleanEdges, error: undefined };\n}\n\n// ---------------------------------------------------------------------------\n// Cross-file import resolution (Python only)\n// ---------------------------------------------------------------------------\n\nasync function _resolveCrossFileImports(\n  perFile: ExtractionResult[],\n  paths: string[],\n): Promise<GraphEdge[]> {\n  await ensureParserInit();\n  const lang = await loadLanguage(\"python\");\n  if (!lang) return [];\n\n  const parser = new Parser();\n  parser.setLanguage(lang);\n\n  // Pass 1: name -> node_id across all files\n  const stemToEntities = new Map<string, Map<string, string>>();\n  for (const fileResult of perFile) {\n    for (const node of fileResult.nodes ?? []) {\n      const src = node.source_file ?? \"\";\n      if (!src) continue;\n      const fileStem = basename(src, extname(src));\n      const label = node.label ?? \"\";\n      const nid = node.id ?? \"\";\n      if (label && !label.endsWith(\")\") && !label.endsWith(\".py\") && !label.startsWith(\"_\")) {\n        if (!stemToEntities.has(fileStem)) stemToEntities.set(fileStem, new Map());\n        stemToEntities.get(fileStem)!.set(label, nid);\n      }\n    }\n  }\n\n  // Pass 2\n  const newEdges: GraphEdge[] = [];\n  const stemToPath = new Map<string, string>();\n  for (const p of paths) {\n    stemToPath.set(basename(p, extname(p)), p);\n  }\n\n  for (let idx = 0; idx < perFile.length; idx++) {\n    const fileResult = perFile[idx]!;\n    const filePath = paths[idx]!;\n    const fileStem = basename(filePath, extname(filePath));\n    const strPath = filePath;\n\n    const localClasses = fileResult.nodes\n      .filter((n) =>\n        n.source_file === strPath &&\n        !n.label.endsWith(\")\") &&\n        !n.label.endsWith(\".py\") &&\n        n.id !== _makeId(fileStem),\n      )\n      .map((n) => n.id);\n\n    if (localClasses.length === 0) continue;\n\n    let source: string;\n    let tree: Tree;\n    try {\n      source = readFileSync(filePath, \"utf-8\");\n      tree = parseText(parser, source);\n    } catch {\n      continue;\n    }\n\n    function walkImports(node: SyntaxNode): void {\n      if (node.type === \"import_from_statement\") {\n        let targetStem: string | null = null;\n        for (const child of node.children) {\n          if (child.type === \"relative_import\") {\n            for (const sub of child.children) {\n              if (sub.type === \"dotted_name\") {\n                const raw = source.slice(sub.startIndex, sub.endIndex);\n                targetStem = raw.split(\".\").pop()!;\n                break;\n              }\n            }\n            break;\n          }\n          if (child.type === \"dotted_name\" && targetStem === null) {\n            const raw = source.slice(child.startIndex, child.endIndex);\n            targetStem = raw.split(\".\").pop()!;\n          }\n        }\n\n        if (!targetStem || !stemToEntities.has(targetStem)) return;\n\n        const importedNames: string[] = [];\n        let pastImportKw = false;\n        for (const child of node.children) {\n          if (child.type === \"import\") {\n            pastImportKw = true;\n            continue;\n          }\n          if (!pastImportKw) continue;\n          if (child.type === \"dotted_name\") {\n            importedNames.push(source.slice(child.startIndex, child.endIndex));\n          } else if (child.type === \"aliased_import\") {\n            const nameNode = child.childForFieldName(\"name\");\n            if (nameNode) {\n              importedNames.push(source.slice(nameNode.startIndex, nameNode.endIndex));\n            }\n          }\n        }\n\n        const line = node.startPosition.row + 1;\n        for (const name of importedNames) {\n          const tgtNid = stemToEntities.get(targetStem)?.get(name);\n          if (tgtNid) {\n            for (const srcClassNid of localClasses) {\n              newEdges.push({\n                source: srcClassNid, target: tgtNid, relation: \"uses\",\n                confidence: \"INFERRED\", source_file: strPath,\n                source_location: `L${line}`, weight: 0.8,\n              });\n            }\n          }\n        }\n      }\n      for (const child of node.children) {\n        walkImports(child);\n      }\n    }\n\n    walkImports(tree.rootNode);\n  }\n\n  return newEdges;\n}\n\n// ---------------------------------------------------------------------------\n// Main extract() and collectFiles()\n// ---------------------------------------------------------------------------\n\ntype ExtractorFn = (filePath: string) => Promise<ExtractionResult>;\n\nconst _DISPATCH: Record<string, ExtractorFn> = {\n  \".py\": extractPython,\n  \".js\": extractJs,\n  \".jsx\": extractJs,\n  \".ts\": extractJs,\n  \".tsx\": extractJs,\n  \".go\": extractGo,\n  \".rs\": extractRust,\n  \".java\": extractJava,\n  \".c\": extractC,\n  \".h\": extractC,\n  \".cpp\": extractCpp,\n  \".cc\": extractCpp,\n  \".cxx\": extractCpp,\n  \".hpp\": extractCpp,\n  \".rb\": extractRuby,\n  \".cs\": extractCsharp,\n  \".kt\": extractKotlin,\n  \".kts\": extractKotlin,\n  \".scala\": extractScala,\n  \".php\": extractPhp,\n  \".swift\": extractSwift,\n  \".lua\": extractLua,\n  \".toc\": extractLua,\n  \".zig\": extractZig,\n  \".ps1\": extractPowershell,\n  \".ex\": extractElixir,\n  \".exs\": extractElixir,\n  \".m\": extractObjc,\n  \".mm\": extractObjc,\n  \".jl\": extractJulia,\n};\n\n/**\n * Extract AST nodes and edges from a list of code files.\n *\n * Two-pass process:\n * 1. Per-file structural extraction (classes, functions, imports)\n * 2. Cross-file import resolution: turns file-level imports into\n *    class-level INFERRED edges (DigestAuth --uses--> Response)\n */\nexport interface ExtractionDiagnostic {\n  filePath: string;\n  error: string;\n}\n\nexport interface ExtractWithDiagnosticsResult {\n  extraction: Extraction;\n  diagnostics: ExtractionDiagnostic[];\n}\n\nexport async function extractWithDiagnostics(paths: string[]): Promise<ExtractWithDiagnosticsResult> {\n  const perFile: ExtractionResult[] = [];\n  const diagnostics: ExtractionDiagnostic[] = [];\n\n  // Infer a common root for cache keys\n  let root = \".\";\n  try {\n    if (paths.length === 0) {\n      root = \".\";\n    } else if (paths.length === 1) {\n      root = dirname(paths[0]!);\n    } else {\n      // Find common prefix directory\n      const parts = paths.map((p) => p.split(sep));\n      const minLen = Math.min(...parts.map((p) => p.length));\n      let commonLen = 0;\n      for (let i = 0; i < minLen; i++) {\n        const uniqueAtLevel = new Set(parts.map((p) => p[i]));\n        if (uniqueAtLevel.size === 1) commonLen++;\n        else break;\n      }\n      root = commonLen > 0 ? parts[0]!.slice(0, commonLen).join(sep) : \".\";\n    }\n  } catch {\n    root = \".\";\n  }\n\n  const total = paths.length;\n  const _PROGRESS_INTERVAL = 100;\n\n  for (let i = 0; i < paths.length; i++) {\n    if (total >= _PROGRESS_INTERVAL && i % _PROGRESS_INTERVAL === 0 && i > 0) {\n      process.stderr.write(`  AST extraction: ${i}/${total} files (${Math.floor(i * 100 / total)}%)\\n`);\n    }\n    const filePath = paths[i]!;\n    const ext = extname(filePath);\n    const extractor = _DISPATCH[ext];\n    if (!extractor) continue;\n\n    const cached = loadCached(filePath, root);\n    if (cached !== null) {\n      perFile.push(cached as unknown as ExtractionResult);\n      continue;\n    }\n\n    const result = await extractor(filePath);\n    if (!result.error) {\n      saveCached(filePath, result as unknown as Record<string, unknown>, root);\n    } else {\n      diagnostics.push({ filePath, error: result.error });\n    }\n    perFile.push(result);\n  }\n\n  if (total >= _PROGRESS_INTERVAL) {\n    process.stderr.write(`  AST extraction: ${total}/${total} files (100%)\\n`);\n  }\n\n  const allNodes: GraphNode[] = [];\n  const allEdges: GraphEdge[] = [];\n  for (const result of perFile) {\n    allNodes.push(...(result.nodes ?? []));\n    allEdges.push(...(result.edges ?? []));\n  }\n\n  // Add cross-file class-level edges (Python only)\n  const pyPaths = paths.filter((p) => extname(p) === \".py\");\n  if (pyPaths.length > 0) {\n    const pyResults = perFile.filter((_r, i) => extname(paths[i]!) === \".py\");\n    try {\n      const crossFileEdges = await _resolveCrossFileImports(pyResults, pyPaths);\n      allEdges.push(...crossFileEdges);\n    } catch {\n      // Cross-file import resolution failed, skipping\n    }\n  }\n\n  return {\n    extraction: {\n      nodes: allNodes,\n      edges: allEdges,\n      input_tokens: 0,\n      output_tokens: 0,\n    },\n    diagnostics,\n  };\n}\n\nexport async function extract(paths: string[]): Promise<Extraction> {\n  const { extraction } = await extractWithDiagnostics(paths);\n  return extraction;\n}\n\n// ---------------------------------------------------------------------------\n// collectFiles\n// ---------------------------------------------------------------------------\n\nconst _EXTENSIONS = new Set([\n  \".py\", \".js\", \".ts\", \".tsx\", \".go\", \".rs\",\n  \".java\", \".c\", \".h\", \".cpp\", \".cc\", \".cxx\", \".hpp\",\n  \".rb\", \".cs\", \".kt\", \".kts\", \".scala\", \".php\", \".swift\",\n  \".lua\", \".toc\", \".zig\", \".ps1\",\n  \".m\", \".mm\",\n  \".jl\", \".jsx\", \".ex\", \".exs\",\n]);\n\n/**\n * Walk a directory (or return a single file) and collect code files by\n * supported extension.\n */\nexport function collectFiles(target: string, options?: { followSymlinks?: boolean }): string[] {\n  const followSymlinks = options?.followSymlinks ?? false;\n  const resolved = resolve(target);\n\n  try {\n    const stat = lstatSync(resolved);\n    if (stat.isFile()) return [resolved];\n  } catch {\n    return [];\n  }\n\n  const results: string[] = [];\n\n  function walkDir(dir: string, visited: Set<string>): void {\n    let entries: string[];\n    try {\n      entries = readdirSync(dir);\n    } catch {\n      return;\n    }\n\n    for (const entry of entries) {\n      if (entry.startsWith(\".\")) continue;\n      const fullPath = join(dir, entry);\n\n      let stat;\n      try {\n        stat = lstatSync(fullPath);\n      } catch {\n        continue;\n      }\n\n      if (stat.isSymbolicLink() && !followSymlinks) continue;\n\n      if (stat.isDirectory() || (stat.isSymbolicLink() && followSymlinks)) {\n        // Cycle detection for symlinks\n        if (stat.isSymbolicLink()) {\n          try {\n            const real = realpathSync(fullPath);\n            if (visited.has(real)) continue;\n            visited.add(real);\n            const parentReal = realpathSync(dirname(fullPath));\n            if (parentReal === real || parentReal.startsWith(real + sep)) continue;\n          } catch {\n            continue;\n          }\n        }\n\n        // Skip hidden directories\n        const pathParts = fullPath.split(sep);\n        if (pathParts.some((part) => part.startsWith(\".\"))) continue;\n\n        walkDir(fullPath, visited);\n      } else if (stat.isFile()) {\n        const ext = extname(entry);\n        if (_EXTENSIONS.has(ext)) {\n          results.push(fullPath);\n        }\n      }\n    }\n  }\n\n  walkDir(resolved, new Set<string>());\n  return results.sort();\n}\n","/**\n * graphify - extract · build · cluster · analyze · report.\n */\n\nexport { type GraphNode, type GraphEdge, type Extraction, type Hyperedge, type DetectionResult, FileType } from \"./types.js\";\nexport { validateExtraction, assertValid } from \"./validate.js\";\nexport { buildFromJson, build } from \"./build.js\";\nexport { cluster, cohesionScore, scoreAll } from \"./cluster.js\";\nexport { godNodes, surprisingConnections, suggestQuestions, graphDiff } from \"./analyze.js\";\nexport { generate as generateReport } from \"./report.js\";\nexport { toJson, toHtml, toSvg, toGraphml, toCypher, toCanvas, pushToNeo4j } from \"./export.js\";\nexport { toWiki } from \"./wiki.js\";\nexport { detect, classifyFile, detectIncremental, saveManifest } from \"./detect.js\";\nexport { extract, collectFiles } from \"./extract.js\";\nexport { fileHash, loadCached, saveCached, checkSemanticCache, saveSemanticCache } from \"./cache.js\";\nexport { validateUrl, safeFetch, safeFetchText, validateGraphPath, sanitizeLabel } from \"./security.js\";\nexport { runBenchmark, printBenchmark } from \"./benchmark.js\";\nexport { ingest, saveQueryResult } from \"./ingest.js\";\nexport { serve } from \"./serve.js\";\nexport { watch, rebuildCode } from \"./watch.js\";\n","/** File type classification for corpus files. */\nexport enum FileType {\n  CODE = \"code\",\n  DOCUMENT = \"document\",\n  PAPER = \"paper\",\n  IMAGE = \"image\",\n}\n\n/** Confidence level for extracted relationships. */\nexport type Confidence = \"EXTRACTED\" | \"INFERRED\" | \"AMBIGUOUS\";\n\n/** A node in the knowledge graph. */\nexport interface GraphNode {\n  id: string;\n  label: string;\n  file_type: \"code\" | \"document\" | \"paper\" | \"image\" | \"rationale\";\n  source_file: string;\n  source_location?: string;\n  confidence?: Confidence;\n  community?: number;\n  [key: string]: unknown;\n}\n\n/** An edge in the knowledge graph. */\nexport interface GraphEdge {\n  source: string;\n  target: string;\n  relation: string;\n  confidence: Confidence;\n  source_file: string;\n  source_location?: string;\n  confidence_score?: number;\n  weight?: number;\n  /** Original source direction (preserved for display). */\n  _src?: string;\n  /** Original target direction (preserved for display). */\n  _tgt?: string;\n  [key: string]: unknown;\n}\n\n/** A hyperedge grouping multiple nodes. */\nexport interface Hyperedge {\n  id: string;\n  label: string;\n  nodes: string[];\n  relation: string;\n  confidence: Confidence;\n  source_file: string;\n  confidence_score?: number;\n  [key: string]: unknown;\n}\n\n/** Output of an extraction pass. */\nexport interface Extraction {\n  nodes: GraphNode[];\n  edges: GraphEdge[];\n  hyperedges?: Hyperedge[];\n  input_tokens: number;\n  output_tokens: number;\n}\n\n/** Output of the detect() function. */\nexport interface DetectionResult {\n  files: Record<string, string[]>;\n  total_files: number;\n  total_words: number;\n  needs_graph: boolean;\n  warning: string | null;\n  skipped_sensitive: string[];\n  graphifyignore_patterns: number;\n  /** Present in incremental mode. */\n  incremental?: boolean;\n  new_files?: Record<string, string[]>;\n  unchanged_files?: Record<string, string[]>;\n  new_total?: number;\n  deleted_files?: string[];\n}\n\n/** A god node (most connected entity). */\nexport interface GodNodeEntry {\n  id: string;\n  label: string;\n  edges: number;\n}\n\n/** A surprising connection. */\nexport interface SurpriseEntry {\n  source: string;\n  target: string;\n  source_files: [string, string];\n  confidence: Confidence;\n  relation: string;\n  note?: string;\n  why?: string;\n  confidence_score?: number;\n}\n\n/** A suggested question. */\nexport interface SuggestedQuestion {\n  type: string;\n  question: string | null;\n  why: string;\n}\n\n/** Benchmark result. */\nexport interface BenchmarkResult {\n  corpus_tokens?: number;\n  corpus_words?: number;\n  nodes?: number;\n  edges?: number;\n  avg_query_tokens?: number;\n  reduction_ratio?: number;\n  per_question?: Array<{ question: string; query_tokens: number; reduction: number }>;\n  error?: string;\n}\n\n/** Graph diff between two snapshots. */\nexport interface GraphDiffResult {\n  new_nodes: Array<{ id: string; label: string }>;\n  removed_nodes: Array<{ id: string; label: string }>;\n  new_edges: Array<{ source: string; target: string; relation: string; confidence: string }>;\n  removed_edges: Array<{ source: string; target: string; relation: string; confidence: string }>;\n  summary: string;\n}\n\n/** Platform configuration for skill installation. */\nexport interface PlatformConfig {\n  skill_file: string;\n  skill_dst: string;\n  claude_md: boolean;\n}\n","/**\n * Wiki export - Wikipedia-style markdown articles from the knowledge graph.\n * Generates an agent-crawlable wiki: index.md + one article per community + god node articles.\n */\nimport { mkdirSync, writeFileSync } from \"node:fs\";\nimport { join } from \"node:path\";\nimport Graph from \"graphology\";\nimport type { GodNodeEntry } from \"./types.js\";\nimport { type NumericMapLike, toNumericMap } from \"./collections.js\";\n\nfunction safeFilename(name: string): string {\n  return name.replace(/\\//g, \"-\").replace(/ /g, \"_\").replace(/:/g, \"-\");\n}\n\nfunction crossCommunityLinks(\n  G: Graph,\n  nodes: string[],\n  ownCid: number,\n  labels: NumericMapLike<string>,\n): [string, number][] {\n  const labelMap = toNumericMap(labels);\n  const counts = new Map<string, number>();\n  for (const nid of nodes) {\n    G.forEachNeighbor(nid, (neighbor) => {\n      const ncid = G.getNodeAttribute(neighbor, \"community\") as number | undefined;\n      if (ncid !== undefined && ncid !== ownCid) {\n        const label = labelMap.get(ncid) ?? `Community ${ncid}`;\n        counts.set(label, (counts.get(label) ?? 0) + 1);\n      }\n    });\n  }\n  return [...counts.entries()].sort((a, b) => b[1] - a[1]);\n}\n\nfunction communityArticle(\n  G: Graph,\n  cid: number,\n  nodes: string[],\n  label: string,\n  labels: Map<number, string>,\n  cohesion: number | undefined,\n): string {\n  const topNodes = [...nodes].sort((a, b) => G.degree(b) - G.degree(a)).slice(0, 25);\n  const cross = crossCommunityLinks(G, nodes, cid, labels);\n\n  const confCounts: Record<string, number> = { EXTRACTED: 0, INFERRED: 0, AMBIGUOUS: 0 };\n  for (const nid of nodes) {\n    G.forEachEdge(nid, (_, data) => {\n      const conf = (data.confidence as string) ?? \"EXTRACTED\";\n      confCounts[conf] = (confCounts[conf] ?? 0) + 1;\n    });\n  }\n  const totalEdges = Object.values(confCounts).reduce((s, n) => s + n, 0) || 1;\n\n  const sources = [...new Set(nodes.map((n) => (G.getNodeAttribute(n, \"source_file\") as string) ?? \"\").filter(Boolean))].sort();\n\n  const lines: string[] = [];\n  lines.push(`# ${label}`, \"\");\n\n  const metaParts = [`${nodes.length} nodes`];\n  if (cohesion !== undefined) metaParts.push(`cohesion ${cohesion.toFixed(2)}`);\n  lines.push(`> ${metaParts.join(\" · \")}`, \"\");\n\n  lines.push(\"## Key Concepts\", \"\");\n  for (const nid of topNodes) {\n    const d = G.getNodeAttributes(nid);\n    const nodeLabel = (d.label as string) ?? nid;\n    const src = (d.source_file as string) ?? \"\";\n    const degree = G.degree(nid);\n    const srcStr = src ? ` — \\`${src}\\`` : \"\";\n    lines.push(`- **${nodeLabel}** (${degree} connections)${srcStr}`);\n  }\n  const remaining = nodes.length - topNodes.length;\n  if (remaining > 0) lines.push(`- *... and ${remaining} more nodes in this community*`);\n  lines.push(\"\");\n\n  lines.push(\"## Relationships\", \"\");\n  if (cross.length > 0) {\n    for (const [otherLabel, count] of cross.slice(0, 12)) {\n      lines.push(`- [[${otherLabel}]] (${count} shared connections)`);\n    }\n  } else {\n    lines.push(\"- No strong cross-community connections detected\");\n  }\n  lines.push(\"\");\n\n  if (sources.length > 0) {\n    lines.push(\"## Source Files\", \"\");\n    for (const src of sources.slice(0, 20)) {\n      lines.push(`- \\`${src}\\``);\n    }\n    lines.push(\"\");\n  }\n\n  lines.push(\"## Audit Trail\", \"\");\n  for (const conf of [\"EXTRACTED\", \"INFERRED\", \"AMBIGUOUS\"]) {\n    const n = confCounts[conf] ?? 0;\n    const pct = Math.round((n / totalEdges) * 100);\n    lines.push(`- ${conf}: ${n} (${pct}%)`);\n  }\n  lines.push(\"\");\n\n  lines.push(\"---\", \"\", \"*Part of the graphify knowledge wiki. See [[index]] to navigate.*\");\n  return lines.join(\"\\n\");\n}\n\nfunction godNodeArticle(G: Graph, nid: string, labels: Map<number, string>): string {\n  const d = G.getNodeAttributes(nid);\n  const nodeLabel = (d.label as string) ?? nid;\n  const src = (d.source_file as string) ?? \"\";\n  const cid = d.community as number | undefined;\n  const communityName = cid !== undefined ? (labels.get(cid) ?? `Community ${cid}`) : undefined;\n\n  const lines: string[] = [];\n  lines.push(`# ${nodeLabel}`, \"\");\n  lines.push(`> God node · ${G.degree(nid)} connections · \\`${src}\\``, \"\");\n\n  if (communityName) {\n    lines.push(`**Community:** [[${communityName}]]`, \"\");\n  }\n\n  const byRelation = new Map<string, string[]>();\n  const neighbors = [...G.neighbors(nid)].sort((a, b) => G.degree(b) - G.degree(a));\n  for (const neighbor of neighbors) {\n    const ed = G.getEdgeAttributes(G.edge(nid, neighbor)!);\n    const rel = (ed.relation as string) ?? \"related\";\n    const neighborLabel = (G.getNodeAttribute(neighbor, \"label\") as string) ?? neighbor;\n    const conf = (ed.confidence as string) ?? \"\";\n    const confStr = conf ? ` \\`${conf}\\`` : \"\";\n    if (!byRelation.has(rel)) byRelation.set(rel, []);\n    byRelation.get(rel)!.push(`[[${neighborLabel}]]${confStr}`);\n  }\n\n  lines.push(\"## Connections by Relation\", \"\");\n  for (const [rel, targets] of [...byRelation.entries()].sort()) {\n    lines.push(`### ${rel}`);\n    for (const t of targets.slice(0, 20)) {\n      lines.push(`- ${t}`);\n    }\n    lines.push(\"\");\n  }\n\n  lines.push(\"---\", \"\", \"*Part of the graphify knowledge wiki. See [[index]] to navigate.*\");\n  return lines.join(\"\\n\");\n}\n\nfunction indexMd(\n  communities: Map<number, string[]>,\n  labels: Map<number, string>,\n  godNodesData: GodNodeEntry[],\n  totalNodes: number,\n  totalEdges: number,\n): string {\n  const lines: string[] = [\n    \"# Knowledge Graph Index\",\n    \"\",\n    \"> Auto-generated by graphify. Start here — read community articles for context, then drill into god nodes for detail.\",\n    \"\",\n    `**${totalNodes} nodes · ${totalEdges} edges · ${communities.size} communities**`,\n    \"\",\n    \"---\",\n    \"\",\n    \"## Communities\",\n    \"(sorted by size, largest first)\",\n    \"\",\n  ];\n\n  const sorted = [...communities.entries()].sort((a, b) => b[1].length - a[1].length);\n  for (const [cid, nodes] of sorted) {\n    const label = labels.get(cid) ?? `Community ${cid}`;\n    lines.push(`- [[${label}]] — ${nodes.length} nodes`);\n  }\n  lines.push(\"\");\n\n  if (godNodesData.length > 0) {\n    lines.push(\"## God Nodes\", \"(most connected concepts — the load-bearing abstractions)\", \"\");\n    for (const node of godNodesData) {\n      lines.push(`- [[${node.label}]] — ${node.edges} connections`);\n    }\n    lines.push(\"\");\n  }\n\n  lines.push(\n    \"---\",\n    \"\",\n    \"*Generated by [graphify](https://github.com/safishamsi/graphify)*\",\n  );\n  return lines.join(\"\\n\");\n}\n\nexport function toWiki(\n  G: Graph,\n  communities: NumericMapLike<string[]>,\n  outputDir: string,\n  options?: {\n    communityLabels?: NumericMapLike<string>;\n    cohesion?: NumericMapLike<number>;\n    godNodesData?: GodNodeEntry[];\n  },\n): number {\n  const communityMap = toNumericMap(communities);\n  mkdirSync(outputDir, { recursive: true });\n\n  const labels = options?.communityLabels\n    ? toNumericMap(options.communityLabels)\n    : new Map([...communityMap.keys()].map((cid) => [cid, `Community ${cid}`]));\n  const cohesion = toNumericMap(options?.cohesion);\n  const godNodesData = options?.godNodesData ?? [];\n\n  let count = 0;\n\n  // Community articles\n  for (const [cid, nodes] of communityMap) {\n    const label = labels.get(cid) ?? `Community ${cid}`;\n    const article = communityArticle(G, cid, nodes, label, labels, cohesion.get(cid));\n    writeFileSync(join(outputDir, `${safeFilename(label)}.md`), article);\n    count++;\n  }\n\n  // God node articles\n  for (const nodeData of godNodesData) {\n    const nid = nodeData.id;\n    if (nid && G.hasNode(nid)) {\n      const article = godNodeArticle(G, nid, labels);\n      writeFileSync(join(outputDir, `${safeFilename(nodeData.label)}.md`), article);\n      count++;\n    }\n  }\n\n  // Index\n  writeFileSync(\n    join(outputDir, \"index.md\"),\n    indexMd(communityMap, labels, godNodesData, G.order, G.size),\n  );\n\n  return count;\n}\n","/**\n * File discovery, type classification, and corpus health checks.\n */\nimport {\n  readdirSync, readFileSync, writeFileSync, statSync, existsSync, mkdirSync, lstatSync,\n} from \"node:fs\";\nimport { join, resolve, extname, basename, relative, sep } from \"node:path\";\nimport { createHash } from \"node:crypto\";\nimport { FileType } from \"./types.js\";\nimport type { DetectionResult } from \"./types.js\";\n\nconst MANIFEST_PATH = \"graphify-out/manifest.json\";\n\nexport const CODE_EXTENSIONS = new Set([\n  \".py\", \".ts\", \".js\", \".jsx\", \".tsx\", \".go\", \".rs\", \".java\", \".cpp\", \".cc\", \".cxx\",\n  \".c\", \".h\", \".hpp\", \".rb\", \".swift\", \".kt\", \".kts\", \".cs\", \".scala\", \".php\",\n  \".lua\", \".toc\", \".zig\", \".ps1\", \".ex\", \".exs\", \".m\", \".mm\", \".jl\",\n]);\n\nexport const DOC_EXTENSIONS = new Set([\".md\", \".txt\", \".rst\"]);\nexport const PAPER_EXTENSIONS = new Set([\".pdf\"]);\nexport const IMAGE_EXTENSIONS = new Set([\".png\", \".jpg\", \".jpeg\", \".gif\", \".webp\", \".svg\"]);\nexport const OFFICE_EXTENSIONS = new Set([\".docx\", \".xlsx\"]);\n\nconst CORPUS_WARN_THRESHOLD = 50_000;\nconst CORPUS_UPPER_THRESHOLD = 500_000;\nconst FILE_COUNT_UPPER = 200;\n\n// Sensitive file patterns\nconst SENSITIVE_PATTERNS = [\n  /(^|[\\\\/])\\.(env|envrc)(\\.|$)/i,\n  /\\.(pem|key|p12|pfx|cert|crt|der|p8)$/i,\n  /(credential|secret|passwd|password|token|private_key)/i,\n  /(id_rsa|id_dsa|id_ecdsa|id_ed25519)(\\.pub)?$/,\n  /(\\.netrc|\\.pgpass|\\.htpasswd)$/i,\n  /(aws_credentials|gcloud_credentials|service.account)/i,\n];\n\n// Academic paper signals\nconst PAPER_SIGNALS = [\n  /\\barxiv\\b/i, /\\bdoi\\s*:/i, /\\babstract\\b/i, /\\bproceedings\\b/i,\n  /\\bjournal\\b/i, /\\bpreprint\\b/i, /\\\\cite\\{/, /\\[\\d+\\]/, /\\[\\n\\d+\\n\\]/,\n  /eq\\.\\s*\\d+|equation\\s+\\d+/i, /\\d{4}\\.\\d{4,5}/, /\\bwe propose\\b/i, /\\bliterature\\b/i,\n];\nconst PAPER_SIGNAL_THRESHOLD = 3;\n\nfunction isSensitive(filePath: string): boolean {\n  const name = basename(filePath);\n  return SENSITIVE_PATTERNS.some((p) => p.test(name) || p.test(filePath));\n}\n\nfunction looksLikePaper(filePath: string): boolean {\n  try {\n    const text = readFileSync(filePath, \"utf-8\").slice(0, 3000);\n    const hits = PAPER_SIGNALS.filter((p) => p.test(text)).length;\n    return hits >= PAPER_SIGNAL_THRESHOLD;\n  } catch {\n    return false;\n  }\n}\n\nconst ASSET_DIR_MARKERS = new Set([\".imageset\", \".xcassets\", \".appiconset\", \".colorset\", \".launchimage\"]);\n\nexport function classifyFile(filePath: string): FileType | null {\n  const ext = extname(filePath).toLowerCase();\n  if (CODE_EXTENSIONS.has(ext)) return FileType.CODE;\n  if (PAPER_EXTENSIONS.has(ext)) {\n    // PDFs inside Xcode asset catalogs are vector icons, not papers\n    const parts = filePath.split(sep);\n    if (parts.some((p) => [...ASSET_DIR_MARKERS].some((m) => p.endsWith(m)))) return null;\n    return FileType.PAPER;\n  }\n  if (IMAGE_EXTENSIONS.has(ext)) return FileType.IMAGE;\n  if (DOC_EXTENSIONS.has(ext)) {\n    if (looksLikePaper(filePath)) return FileType.PAPER;\n    return FileType.DOCUMENT;\n  }\n  if (OFFICE_EXTENSIONS.has(ext)) return FileType.DOCUMENT;\n  return null;\n}\n\n/** Extract plain text from a PDF file using pdf-parse. */\nexport async function extractPdfText(filePath: string): Promise<string> {\n  try {\n    const pdfParse = (await import(\"pdf-parse\")).default;\n    const buf = readFileSync(filePath);\n    const data = await pdfParse(buf);\n    return data.text;\n  } catch {\n    return \"\";\n  }\n}\n\n/** Convert a .docx file to markdown text using mammoth. */\nexport async function docxToMarkdown(filePath: string): Promise<string> {\n  try {\n    const mammoth = await import(\"mammoth\");\n    const result = await mammoth.convertToHtml({ path: filePath });\n    // mammoth produces HTML; strip tags for a simple text fallback\n    return result.value.replace(/<[^>]+>/g, \" \").replace(/\\s+/g, \" \").trim();\n  } catch {\n    return \"\";\n  }\n}\n\n/** Convert an .xlsx file to markdown text using exceljs. */\nexport async function xlsxToMarkdown(filePath: string): Promise<string> {\n  try {\n    const ExcelJS = await import(\"exceljs\");\n    const wb = new ExcelJS.Workbook();\n    await wb.xlsx.readFile(filePath);\n    const sections: string[] = [];\n    wb.eachSheet((ws) => {\n      const rows: string[][] = [];\n      ws.eachRow((row) => {\n        const cells = (row.values as unknown[]).slice(1).map((v) => (v != null ? String(v) : \"\"));\n        rows.push(cells);\n      });\n      if (rows.length === 0) return;\n      sections.push(`## Sheet: ${ws.name}`);\n      const header = \"| \" + rows[0]!.join(\" | \") + \" |\";\n      const sep = \"| \" + rows[0]!.map(() => \"---\").join(\" | \") + \" |\";\n      sections.push(header, sep);\n      for (const row of rows.slice(1)) {\n        sections.push(\"| \" + row.join(\" | \") + \" |\");\n      }\n    });\n    return sections.join(\"\\n\");\n  } catch {\n    return \"\";\n  }\n}\n\n/** Convert .docx/.xlsx to a markdown sidecar file. */\nexport async function convertOfficeFile(filePath: string, outDir: string): Promise<string | null> {\n  const ext = extname(filePath).toLowerCase();\n  let text: string;\n  if (ext === \".docx\") {\n    text = await docxToMarkdown(filePath);\n  } else if (ext === \".xlsx\") {\n    text = await xlsxToMarkdown(filePath);\n  } else {\n    return null;\n  }\n\n  if (!text.trim()) return null;\n\n  mkdirSync(outDir, { recursive: true });\n  const nameHash = createHash(\"sha256\").update(resolve(filePath)).digest(\"hex\").slice(0, 8);\n  const stem = basename(filePath, extname(filePath));\n  const outPath = join(outDir, `${stem}_${nameHash}.md`);\n  writeFileSync(outPath, `<!-- converted from ${basename(filePath)} -->\\n\\n${text}`, \"utf-8\");\n  return outPath;\n}\n\nfunction countWords(filePath: string): number {\n  try {\n    const text = readFileSync(filePath, \"utf-8\");\n    return text.split(/\\s+/).filter(Boolean).length;\n  } catch {\n    return 0;\n  }\n}\n\n// Directory names to always skip\nconst SKIP_DIRS = new Set([\n  \"venv\", \".venv\", \"env\", \".env\", \"node_modules\", \"__pycache__\", \".git\",\n  \"dist\", \"build\", \"target\", \"out\", \"site-packages\", \"lib64\",\n  \".pytest_cache\", \".mypy_cache\", \".ruff_cache\", \".tox\", \".eggs\",\n]);\n\nfunction isNoiseDir(part: string): boolean {\n  if (SKIP_DIRS.has(part)) return true;\n  if (part.endsWith(\"_venv\") || part.endsWith(\"_env\")) return true;\n  if (part.endsWith(\".egg-info\")) return true;\n  return false;\n}\n\nfunction loadGraphifyignore(root: string): string[] {\n  const ignoreFile = join(root, \".graphifyignore\");\n  if (!existsSync(ignoreFile)) return [];\n  const patterns: string[] = [];\n  for (let line of readFileSync(ignoreFile, \"utf-8\").split(\"\\n\")) {\n    line = line.trim();\n    if (line && !line.startsWith(\"#\")) {\n      patterns.push(line);\n    }\n  }\n  return patterns;\n}\n\nfunction matchGlob(text: string, pattern: string): boolean {\n  // Simple glob matching (*, ?)\n  const regex = pattern\n    .replace(/[.+^${}()|[\\]\\\\]/g, \"\\\\$&\")\n    .replace(/\\*/g, \".*\")\n    .replace(/\\?/g, \".\");\n  return new RegExp(`^${regex}$`).test(text);\n}\n\nfunction isIgnored(filePath: string, root: string, patterns: string[]): boolean {\n  if (patterns.length === 0) return false;\n  let rel: string;\n  try {\n    rel = relative(root, filePath).replace(/\\\\/g, \"/\");\n  } catch {\n    return false;\n  }\n  const parts = rel.split(\"/\");\n  for (const pattern of patterns) {\n    const p = pattern.replace(/^\\/+|\\/+$/g, \"\");\n    if (!p) continue;\n    if (matchGlob(rel, p)) return true;\n    if (matchGlob(basename(filePath), p)) return true;\n    for (let i = 0; i < parts.length; i++) {\n      if (matchGlob(parts[i]!, p)) return true;\n      if (matchGlob(parts.slice(0, i + 1).join(\"/\"), p)) return true;\n    }\n  }\n  return false;\n}\n\nfunction walkDir(\n  dir: string,\n  root: string,\n  ignorePatterns: string[],\n  followSymlinks: boolean,\n  skipPrune: boolean,\n): string[] {\n  const result: string[] = [];\n  let entries: string[];\n  try {\n    entries = readdirSync(dir);\n  } catch {\n    return result;\n  }\n\n  for (const entry of entries) {\n    const full = join(dir, entry);\n    let stat;\n    try {\n      stat = followSymlinks ? statSync(full) : lstatSync(full);\n    } catch {\n      continue;\n    }\n\n    if (stat.isDirectory()) {\n      if (!skipPrune) {\n        if (entry.startsWith(\".\")) continue;\n        if (isNoiseDir(entry)) continue;\n        if (isIgnored(full, root, ignorePatterns)) continue;\n      }\n      result.push(...walkDir(full, root, ignorePatterns, followSymlinks, skipPrune));\n    } else if (stat.isFile()) {\n      result.push(full);\n    }\n  }\n\n  return result;\n}\n\nexport function detect(root: string, options?: { followSymlinks?: boolean }): DetectionResult {\n  const followSymlinks = options?.followSymlinks ?? false;\n  const rootResolved = resolve(root);\n  const ignorePatterns = loadGraphifyignore(rootResolved);\n  const convertedDir = join(rootResolved, \"graphify-out\", \"converted\");\n  const memoryDir = join(rootResolved, \"graphify-out\", \"memory\");\n\n  const files: Record<string, string[]> = {\n    code: [], document: [], paper: [], image: [],\n  };\n  let totalWords = 0;\n  const skippedSensitive: string[] = [];\n\n  // Walk main tree\n  const allFiles = walkDir(rootResolved, rootResolved, ignorePatterns, followSymlinks, false);\n\n  // Also walk memory dir if it exists\n  if (existsSync(memoryDir)) {\n    allFiles.push(...walkDir(memoryDir, rootResolved, ignorePatterns, followSymlinks, true));\n  }\n\n  const seen = new Set<string>();\n\n  for (const p of allFiles) {\n    if (seen.has(p)) continue;\n    seen.add(p);\n\n    const inMemory = existsSync(memoryDir) && p.startsWith(memoryDir);\n    if (!inMemory) {\n      if (basename(p).startsWith(\".\")) continue;\n      if (p.startsWith(convertedDir)) continue;\n    }\n    if (isIgnored(p, rootResolved, ignorePatterns)) continue;\n    if (isSensitive(p)) {\n      skippedSensitive.push(p);\n      continue;\n    }\n\n    const ftype = classifyFile(p);\n    if (!ftype) continue;\n\n    // Office files: convert to markdown sidecar\n    if (OFFICE_EXTENSIONS.has(extname(p).toLowerCase())) {\n      // Note: office conversion is async but detect is sync.\n      // We skip office files in sync detect; they're handled in the async pipeline.\n      skippedSensitive.push(p + \" [office conversion requires async - use pipeline]\");\n      continue;\n    }\n\n    files[ftype]!.push(p);\n    totalWords += countWords(p);\n  }\n\n  const totalFiles = Object.values(files).reduce((s, v) => s + v.length, 0);\n  const needsGraph = totalWords >= CORPUS_WARN_THRESHOLD;\n\n  let warning: string | null = null;\n  if (!needsGraph) {\n    warning = `Corpus is ~${totalWords.toLocaleString()} words - fits in a single context window. You may not need a graph.`;\n  } else if (totalWords >= CORPUS_UPPER_THRESHOLD || totalFiles >= FILE_COUNT_UPPER) {\n    warning =\n      `Large corpus: ${totalFiles} files · ~${totalWords.toLocaleString()} words. ` +\n      `Semantic extraction will be expensive (many Claude tokens). ` +\n      `Consider running on a subfolder, or use --no-semantic to run AST-only.`;\n  }\n\n  return {\n    files,\n    total_files: totalFiles,\n    total_words: totalWords,\n    needs_graph: needsGraph,\n    warning,\n    skipped_sensitive: skippedSensitive,\n    graphifyignore_patterns: ignorePatterns.length,\n  };\n}\n\nexport function loadManifest(manifestPath: string = MANIFEST_PATH): Record<string, number> {\n  try {\n    return JSON.parse(readFileSync(manifestPath, \"utf-8\")) as Record<string, number>;\n  } catch {\n    return {};\n  }\n}\n\nexport function saveManifest(files: Record<string, string[]>, manifestPath: string = MANIFEST_PATH): void {\n  const manifest: Record<string, number> = {};\n  for (const fileList of Object.values(files)) {\n    for (const f of fileList) {\n      try {\n        manifest[f] = statSync(f).mtimeMs;\n      } catch { /* deleted between detect and save */ }\n    }\n  }\n  const dir = join(manifestPath, \"..\");\n  mkdirSync(dir, { recursive: true });\n  writeFileSync(manifestPath, JSON.stringify(manifest, null, 2));\n}\n\nexport function detectIncremental(root: string, manifestPath: string = MANIFEST_PATH): DetectionResult {\n  const full = detect(root);\n  const manifest = loadManifest(manifestPath);\n\n  if (Object.keys(manifest).length === 0) {\n    return {\n      ...full,\n      incremental: true,\n      new_files: full.files,\n      unchanged_files: Object.fromEntries(Object.keys(full.files).map((k) => [k, []])),\n      new_total: full.total_files,\n    };\n  }\n\n  const newFiles: Record<string, string[]> = {};\n  const unchangedFiles: Record<string, string[]> = {};\n  for (const k of Object.keys(full.files)) {\n    newFiles[k] = [];\n    unchangedFiles[k] = [];\n  }\n\n  for (const [ftype, fileList] of Object.entries(full.files)) {\n    for (const f of fileList) {\n      const storedMtime = manifest[f];\n      let currentMtime = 0;\n      try { currentMtime = statSync(f).mtimeMs; } catch { /* ignore */ }\n      if (storedMtime === undefined || currentMtime > storedMtime) {\n        newFiles[ftype]!.push(f);\n      } else {\n        unchangedFiles[ftype]!.push(f);\n      }\n    }\n  }\n\n  const currentFiles = new Set(Object.values(full.files).flat());\n  const deletedFiles = Object.keys(manifest).filter((f) => !currentFiles.has(f));\n  const newTotal = Object.values(newFiles).reduce((s, v) => s + v.length, 0);\n\n  return {\n    ...full,\n    incremental: true,\n    new_files: newFiles,\n    unchanged_files: unchangedFiles,\n    new_total: newTotal,\n    deleted_files: deletedFiles,\n  };\n}\n","/**\n * Token-reduction benchmark - measures how much context graphify saves vs naive full-corpus approach.\n */\nimport { readFileSync, existsSync } from \"node:fs\";\nimport Graph from \"graphology\";\nimport type { BenchmarkResult } from \"./types.js\";\n\nconst CHARS_PER_TOKEN = 4;\n\nfunction estimateTokens(text: string): number {\n  return Math.max(1, Math.floor(text.length / CHARS_PER_TOKEN));\n}\n\nfunction querySubgraphTokens(G: Graph, question: string, depth: number = 3): number {\n  const terms = question.toLowerCase().split(/\\s+/).filter((t) => t.length > 2);\n  const scored: [number, string][] = [];\n  G.forEachNode((nid, data) => {\n    const label = ((data.label as string) ?? \"\").toLowerCase();\n    const score = terms.filter((t) => label.includes(t)).length;\n    if (score > 0) scored.push([score, nid]);\n  });\n  scored.sort((a, b) => b[0] - a[0]);\n  const startNodes = scored.slice(0, 3).map(([, nid]) => nid);\n  if (startNodes.length === 0) return 0;\n\n  const visited = new Set(startNodes);\n  let frontier = new Set(startNodes);\n  const edgesSeen: [string, string][] = [];\n\n  for (let d = 0; d < depth; d++) {\n    const nextFrontier = new Set<string>();\n    for (const n of frontier) {\n      G.forEachNeighbor(n, (neighbor) => {\n        if (!visited.has(neighbor)) {\n          nextFrontier.add(neighbor);\n          edgesSeen.push([n, neighbor]);\n        }\n      });\n    }\n    for (const n of nextFrontier) visited.add(n);\n    frontier = nextFrontier;\n  }\n\n  const lines: string[] = [];\n  for (const nid of visited) {\n    const d = G.getNodeAttributes(nid);\n    lines.push(`NODE ${d.label ?? nid} src=${d.source_file ?? \"\"} loc=${d.source_location ?? \"\"}`);\n  }\n  for (const [u, v] of edgesSeen) {\n    if (visited.has(u) && visited.has(v)) {\n      const edge = G.edge(u, v);\n      if (edge) {\n        const d = G.getEdgeAttributes(edge);\n        lines.push(`EDGE ${G.getNodeAttribute(u, \"label\") ?? u} --${d.relation ?? \"\"}--> ${G.getNodeAttribute(v, \"label\") ?? v}`);\n      }\n    }\n  }\n\n  return estimateTokens(lines.join(\"\\n\"));\n}\n\nconst SAMPLE_QUESTIONS = [\n  \"how does authentication work\",\n  \"what is the main entry point\",\n  \"how are errors handled\",\n  \"what connects the data layer to the api\",\n  \"what are the core abstractions\",\n];\n\ninterface BenchmarkOptions {\n  corpusWords?: number;\n  questions?: string[];\n}\n\nfunction loadGraph(graphPath: string): Graph {\n  const raw = JSON.parse(readFileSync(graphPath, \"utf-8\"));\n  const G = new Graph({ type: \"undirected\" });\n  for (const node of raw.nodes ?? []) {\n    const { id, ...attrs } = node;\n    G.mergeNode(id, attrs);\n  }\n  for (const link of raw.links ?? []) {\n    const { source, target, ...attrs } = link;\n    if (G.hasNode(source) && G.hasNode(target)) {\n      try { G.mergeEdge(source, target, attrs); } catch { /* ignore */ }\n    }\n  }\n  return G;\n}\n\nexport function runBenchmark(\n  graphPath: string = \"graphify-out/graph.json\",\n  corpusWordsOrOptions?: number | BenchmarkOptions,\n  questions?: string[],\n): BenchmarkResult {\n  const options = typeof corpusWordsOrOptions === \"number\"\n    ? { corpusWords: corpusWordsOrOptions, questions }\n    : (corpusWordsOrOptions ?? {});\n\n  if (!existsSync(graphPath)) {\n    return { error: `Graph file not found: ${graphPath}. Build the graph first.` };\n  }\n\n  const G = loadGraph(graphPath);\n\n  const corpusWords = options.corpusWords ?? (G.order * 50);\n\n  if (corpusWords === undefined) {\n    return { error: \"Could not determine corpus size.\" };\n  }\n\n  const corpusTokens = Math.floor((corpusWords * 100) / 75);\n  const qs = options.questions ?? SAMPLE_QUESTIONS;\n  const perQuestion: Array<{ question: string; query_tokens: number; reduction: number }> = [];\n\n  for (const q of qs) {\n    const qt = querySubgraphTokens(G, q);\n    if (qt > 0) {\n      perQuestion.push({\n        question: q,\n        query_tokens: qt,\n        reduction: Math.round((corpusTokens / qt) * 10) / 10,\n      });\n    }\n  }\n\n  if (perQuestion.length === 0) {\n    return { error: \"No matching nodes found for sample questions. Build the graph first.\" };\n  }\n\n  const avgQueryTokens = Math.floor(\n    perQuestion.reduce((s, p) => s + p.query_tokens, 0) / perQuestion.length,\n  );\n  const reductionRatio = avgQueryTokens > 0 ? Math.round((corpusTokens / avgQueryTokens) * 10) / 10 : 0;\n\n  return {\n    corpus_tokens: corpusTokens,\n    corpus_words: corpusWords,\n    nodes: G.order,\n    edges: G.size,\n    avg_query_tokens: avgQueryTokens,\n    reduction_ratio: reductionRatio,\n    per_question: perQuestion,\n  };\n}\n\nexport function printBenchmark(result: BenchmarkResult): void {\n  if (result.error) {\n    console.log(`Benchmark error: ${result.error}`);\n    return;\n  }\n\n  console.log(`\\ngraphify token reduction benchmark`);\n  console.log(\"─\".repeat(50));\n  console.log(`  Corpus:          ${result.corpus_words!.toLocaleString()} words → ~${result.corpus_tokens!.toLocaleString()} tokens (naive)`);\n  console.log(`  Graph:           ${result.nodes!.toLocaleString()} nodes, ${result.edges!.toLocaleString()} edges`);\n  console.log(`  Avg query cost:  ~${result.avg_query_tokens!.toLocaleString()} tokens`);\n  console.log(`  Reduction:       ${result.reduction_ratio}x fewer tokens per query`);\n  console.log(`\\n  Per question:`);\n  for (const p of result.per_question!) {\n    console.log(`    [${p.reduction}x] ${p.question.slice(0, 55)}`);\n  }\n  console.log();\n}\n","/**\n * URL ingestion - fetch URLs (tweet/arxiv/pdf/web/image) and save as annotated markdown.\n *\n * Uses Node.js global fetch, turndown for HTML-to-markdown conversion, and\n * security helpers for safe fetching and URL validation.\n */\nimport { existsSync, mkdirSync, writeFileSync } from \"node:fs\";\nimport { resolve as pathResolve, basename, extname } from \"node:path\";\nimport { safeFetch, safeFetchText, validateUrl } from \"./security.js\";\n\n// ---------------------------------------------------------------------------\n// Helpers\n// ---------------------------------------------------------------------------\n\nfunction yamlStr(s: string): string {\n  return s\n    .replace(/\\\\/g, \"\\\\\\\\\")\n    .replace(/\"/g, '\\\\\"')\n    .replace(/\\n/g, \" \")\n    .replace(/\\r/g, \" \");\n}\n\nfunction safeFilename(url: string, suffix: string): string {\n  let parsed: URL;\n  try {\n    parsed = new URL(url);\n  } catch {\n    return `unknown${suffix}`;\n  }\n  let name = parsed.hostname + parsed.pathname;\n  name = name.replace(/[^\\w\\-]/g, \"_\").replace(/^_+|_+$/g, \"\");\n  name = name.replace(/_+/g, \"_\").slice(0, 80);\n  return name + suffix;\n}\n\nfunction detectUrlType(url: string): string {\n  const lower = url.toLowerCase();\n  if (lower.includes(\"twitter.com\") || lower.includes(\"x.com\")) return \"tweet\";\n  if (lower.includes(\"arxiv.org\")) return \"arxiv\";\n  if (lower.includes(\"github.com\")) return \"github\";\n  if (lower.includes(\"youtube.com\") || lower.includes(\"youtu.be\"))\n    return \"youtube\";\n  try {\n    const parsed = new URL(url);\n    const path = parsed.pathname.toLowerCase();\n    if (path.endsWith(\".pdf\")) return \"pdf\";\n    if (\n      [\".png\", \".jpg\", \".jpeg\", \".webp\", \".gif\"].some((ext) =>\n        path.endsWith(ext),\n      )\n    )\n      return \"image\";\n  } catch {\n    // fall through\n  }\n  return \"webpage\";\n}\n\nasync function htmlToMarkdown(html: string, _url: string): Promise<string> {\n  try {\n    const TurndownService = (await import(\"turndown\")).default;\n    const td = new TurndownService({\n      headingStyle: \"atx\",\n      codeBlockStyle: \"fenced\",\n    });\n    return td.turndown(html);\n  } catch {\n    // Fallback: strip tags\n    let text = html.replace(/<script[^>]*>.*?<\\/script>/gis, \"\");\n    text = text.replace(/<style[^>]*>.*?<\\/style>/gis, \"\");\n    text = text.replace(/<[^>]+>/g, \" \");\n    text = text.replace(/\\s+/g, \" \").trim();\n    return text.slice(0, 8000);\n  }\n}\n\n// ---------------------------------------------------------------------------\n// URL type handlers\n// ---------------------------------------------------------------------------\n\nasync function fetchTweet(\n  url: string,\n  author: string | null,\n  contributor: string | null,\n): Promise<[string, string]> {\n  const oembedUrl = url.replace(\"x.com\", \"twitter.com\");\n  const oembedApi = `https://publish.twitter.com/oembed?url=${encodeURIComponent(oembedUrl)}&omit_script=true`;\n\n  let tweetText: string;\n  let tweetAuthor: string;\n  try {\n    const data = JSON.parse(await safeFetchText(oembedApi)) as Record<\n      string,\n      unknown\n    >;\n    tweetText = ((data.html as string) ?? \"\")\n      .replace(/<[^>]+>/g, \"\")\n      .trim();\n    tweetAuthor = (data.author_name as string) ?? \"unknown\";\n  } catch {\n    tweetText = `Tweet at ${url} (could not fetch content)`;\n    tweetAuthor = \"unknown\";\n  }\n\n  const now = new Date().toISOString();\n  const content = `---\nsource_url: ${url}\ntype: tweet\nauthor: ${tweetAuthor}\ncaptured_at: ${now}\ncontributor: ${contributor ?? author ?? \"unknown\"}\n---\n\n# Tweet by @${tweetAuthor}\n\n${tweetText}\n\nSource: ${url}\n`;\n  const filename = safeFilename(url, \".md\");\n  return [content, filename];\n}\n\nasync function fetchWebpage(\n  url: string,\n  author: string | null,\n  contributor: string | null,\n): Promise<[string, string]> {\n  const html = await safeFetchText(url);\n\n  const titleMatch = html.match(/<title[^>]*>(.*?)<\\/title>/is);\n  const title = titleMatch\n    ? titleMatch[1]!.replace(/\\s+/g, \" \").trim()\n    : url;\n\n  const markdown = await htmlToMarkdown(html, url);\n  const now = new Date().toISOString();\n  const content = `---\nsource_url: ${url}\ntype: webpage\ntitle: \"${yamlStr(title)}\"\ncaptured_at: ${now}\ncontributor: ${contributor ?? author ?? \"unknown\"}\n---\n\n# ${title}\n\nSource: ${url}\n\n---\n\n${markdown.slice(0, 12000)}\n`;\n  const filename = safeFilename(url, \".md\");\n  return [content, filename];\n}\n\nasync function fetchArxiv(\n  url: string,\n  author: string | null,\n  contributor: string | null,\n): Promise<[string, string]> {\n  const arxivMatch = url.match(/(\\d{4}\\.\\d{4,5})/);\n  if (!arxivMatch) {\n    return fetchWebpage(url, author, contributor);\n  }\n\n  const arxivId = arxivMatch[1]!;\n  let title = arxivId;\n  let abstract = \"\";\n  let paperAuthors = \"\";\n\n  const apiUrl = `https://export.arxiv.org/abs/${arxivId}`;\n  try {\n    const html = await safeFetchText(apiUrl);\n    const abstractMatch = html.match(\n      /class=\"abstract[^\"]*\"[^>]*>(.*?)<\\/blockquote>/is,\n    );\n    if (abstractMatch) {\n      abstract = abstractMatch[1]!.replace(/<[^>]+>/g, \"\").trim();\n    }\n    const titleMatch = html.match(\n      /class=\"title[^\"]*\"[^>]*>(.*?)<\\/h1>/is,\n    );\n    if (titleMatch) {\n      title = titleMatch[1]!.replace(/<[^>]+>/g, \" \").trim();\n    }\n    const authorsMatch = html.match(\n      /class=\"authors\"[^>]*>(.*?)<\\/div>/is,\n    );\n    if (authorsMatch) {\n      paperAuthors = authorsMatch[1]!.replace(/<[^>]+>/g, \"\").trim();\n    }\n  } catch {\n    // Use defaults set above\n  }\n\n  const now = new Date().toISOString();\n  const content = `---\nsource_url: ${url}\narxiv_id: ${arxivId}\ntype: paper\ntitle: \"${title}\"\npaper_authors: \"${paperAuthors}\"\ncaptured_at: ${now}\ncontributor: ${contributor ?? author ?? \"unknown\"}\n---\n\n# ${title}\n\n**Authors:** ${paperAuthors}\n**arXiv:** ${arxivId}\n\n## Abstract\n\n${abstract}\n\nSource: ${url}\n`;\n  const filename = `arxiv_${arxivId.replace(\".\", \"_\")}.md`;\n  return [content, filename];\n}\n\nasync function downloadBinary(\n  url: string,\n  suffix: string,\n  targetDir: string,\n): Promise<string> {\n  const filename = safeFilename(url, suffix);\n  const outPath = pathResolve(targetDir, filename);\n  const data = await safeFetch(url);\n  writeFileSync(outPath, data);\n  return outPath;\n}\n\ninterface IngestOptions {\n  author?: string | null;\n  contributor?: string | null;\n}\n\nfunction normalizeIngestOptions(\n  authorOrOptions: string | IngestOptions | null | undefined,\n  contributor: string | null | undefined,\n): { author: string | null; contributor: string | null } {\n  if (typeof authorOrOptions === \"string\" || authorOrOptions == null) {\n    return {\n      author: authorOrOptions ?? null,\n      contributor: contributor ?? null,\n    };\n  }\n\n  return {\n    author: authorOrOptions.author ?? null,\n    contributor: authorOrOptions.contributor ?? null,\n  };\n}\n\n// ---------------------------------------------------------------------------\n// Main ingest function\n// ---------------------------------------------------------------------------\n\nexport async function ingest(\n  url: string,\n  targetDir: string,\n  authorOrOptions: string | IngestOptions | null = null,\n  contributor: string | null = null,\n): Promise<string> {\n  mkdirSync(targetDir, { recursive: true });\n  const urlType = detectUrlType(url);\n  const { author, contributor: normalizedContributor } = normalizeIngestOptions(\n    authorOrOptions,\n    contributor,\n  );\n\n  await validateUrl(url);\n\n  let content: string;\n  let filename: string;\n\n  if (urlType === \"pdf\") {\n    const out = await downloadBinary(url, \".pdf\", targetDir);\n    console.log(`Downloaded PDF: ${basename(out)}`);\n    return out;\n  }\n\n  if (urlType === \"image\") {\n    let parsed: URL;\n    try {\n      parsed = new URL(url);\n    } catch {\n      throw new Error(`Invalid URL: ${url}`);\n    }\n    const suffix = extname(parsed.pathname) || \".jpg\";\n    const out = await downloadBinary(url, suffix, targetDir);\n    console.log(`Downloaded image: ${basename(out)}`);\n    return out;\n  }\n\n  if (urlType === \"tweet\") {\n    [content, filename] = await fetchTweet(url, author, normalizedContributor);\n  } else if (urlType === \"arxiv\") {\n    [content, filename] = await fetchArxiv(url, author, normalizedContributor);\n  } else {\n    [content, filename] = await fetchWebpage(url, author, normalizedContributor);\n  }\n\n  let outPath = pathResolve(targetDir, filename);\n  let counter = 1;\n  while (existsSync(outPath)) {\n    const stem = filename.replace(/\\.md$/, \"\");\n    outPath = pathResolve(targetDir, `${stem}_${counter}.md`);\n    counter++;\n  }\n\n  writeFileSync(outPath, content, \"utf-8\");\n  console.log(`Saved ${urlType}: ${basename(outPath)}`);\n  return outPath;\n}\n\n// ---------------------------------------------------------------------------\n// Save query result (memory loop)\n// ---------------------------------------------------------------------------\n\nexport function saveQueryResult(\n  questionOrOptions:\n    | string\n    | {\n      question: string;\n      answer: string;\n      memoryDir: string;\n      queryType?: string;\n      sourceNodes?: string[] | null;\n    },\n  answer?: string,\n  memoryDir?: string,\n  queryType: string = \"query\",\n  sourceNodes: string[] | null = null,\n): string {\n  const payload = typeof questionOrOptions === \"string\"\n    ? {\n      question: questionOrOptions,\n      answer: answer ?? \"\",\n      memoryDir: memoryDir ?? \"\",\n      queryType,\n      sourceNodes,\n    }\n    : {\n      question: questionOrOptions.question,\n      answer: questionOrOptions.answer,\n      memoryDir: questionOrOptions.memoryDir,\n      queryType: questionOrOptions.queryType ?? \"query\",\n      sourceNodes: questionOrOptions.sourceNodes ?? null,\n    };\n\n  if (!payload.question) throw new Error(\"saveQueryResult requires a question\");\n  if (!payload.memoryDir) throw new Error(\"saveQueryResult requires a memoryDir\");\n\n  const effectiveAnswer = payload.answer ?? \"\";\n  mkdirSync(payload.memoryDir, { recursive: true });\n\n  const now = new Date();\n  const slug = payload.question\n    .toLowerCase()\n    .replace(/[^\\w]/g, \"_\")\n    .slice(0, 50)\n    .replace(/_+$/, \"\");\n  const ts = now\n    .toISOString()\n    .replace(/[-:]/g, \"\")\n    .replace(\"T\", \"_\")\n    .slice(0, 15);\n  const filename = `query_${ts}_${slug}.md`;\n\n  const frontmatterLines = [\n    \"---\",\n    `type: \"${payload.queryType}\"`,\n    `date: \"${now.toISOString()}\"`,\n    `question: \"${yamlStr(payload.question)}\"`,\n    'contributor: \"graphify\"',\n  ];\n  if (payload.sourceNodes && payload.sourceNodes.length > 0) {\n    const nodesStr = payload.sourceNodes\n      .slice(0, 10)\n      .map((n) => `\"${n}\"`)\n      .join(\", \");\n    frontmatterLines.push(`source_nodes: [${nodesStr}]`);\n  }\n  frontmatterLines.push(\"---\");\n\n  const bodyLines = [\n    \"\",\n    `# Q: ${payload.question}`,\n    \"\",\n    \"## Answer\",\n    \"\",\n    effectiveAnswer,\n  ];\n  if (payload.sourceNodes && payload.sourceNodes.length > 0) {\n    bodyLines.push(\"\", \"## Source Nodes\", \"\");\n    for (const n of payload.sourceNodes) {\n      bodyLines.push(`- ${n}`);\n    }\n  }\n\n  const content = [...frontmatterLines, ...bodyLines].join(\"\\n\");\n  const outPath = pathResolve(payload.memoryDir, filename);\n  writeFileSync(outPath, content, \"utf-8\");\n  return outPath;\n}\n\n// ---------------------------------------------------------------------------\n// CLI entry point\n// ---------------------------------------------------------------------------\n\nconst isDirectExecution = typeof process !== \"undefined\" &&\n  typeof process.argv[1] === \"string\" &&\n  /^ingest\\.(?:js|mjs|cjs|ts)$/.test(basename(process.argv[1]));\n\nif (isDirectExecution) {\n  const url = process.argv[2];\n  const targetDir = process.argv[3] ?? \"./raw\";\n  const author = process.argv[4] ?? null;\n  if (!url) {\n    console.error(\"Usage: ingest <url> [target_dir] [author]\");\n    process.exit(1);\n  }\n  ingest(url, targetDir, author)\n    .then((out) => console.log(`Ready for graphify: ${out}`))\n    .catch((err) => {\n      console.error(err);\n      process.exit(1);\n    });\n}\n","/**\n * MCP stdio server - exposes graph query tools to Claude and other agents.\n *\n * Uses @modelcontextprotocol/sdk for the server and graphology for the graph.\n */\nimport { readFileSync } from \"node:fs\";\nimport Graph from \"graphology\";\nimport { bidirectional } from \"graphology-shortest-path/unweighted.js\";\nimport { basename } from \"node:path\";\nimport { validateGraphPath, sanitizeLabel } from \"./security.js\";\nimport { godNodes as computeGodNodes } from \"./analyze.js\";\nimport type { Transport } from \"@modelcontextprotocol/sdk/shared/transport.js\";\n\n// ---------------------------------------------------------------------------\n// Graph loading\n// ---------------------------------------------------------------------------\n\nfunction loadGraph(graphPath: string): Graph {\n  let safePath: string;\n  try {\n    safePath = validateGraphPath(graphPath);\n  } catch (err) {\n    console.error(`error: ${err instanceof Error ? err.message : err}`);\n    process.exit(1);\n  }\n\n  let data: Record<string, unknown>;\n  try {\n    data = JSON.parse(readFileSync(safePath, \"utf-8\")) as Record<string, unknown>;\n  } catch (err) {\n    console.error(\n      `error: graph.json is corrupted (${err instanceof Error ? err.message : err}). Re-run the graphify skill to rebuild it (for Codex: $graphify .).`,\n    );\n    process.exit(1);\n  }\n\n  const G = new Graph({ type: \"undirected\", multi: false });\n\n  // Reconstruct from node-link format\n  const nodes = (data.nodes ?? []) as Array<Record<string, unknown>>;\n  for (const node of nodes) {\n    const { id, ...attrs } = node;\n    G.mergeNode(id as string, attrs);\n  }\n\n  const links = (data.links ?? data.edges ?? []) as Array<Record<string, unknown>>;\n  for (const link of links) {\n    const { source, target, ...attrs } = link;\n    try {\n      G.mergeEdge(source as string, target as string, attrs);\n    } catch {\n      // ignore duplicate edges or missing nodes\n    }\n  }\n\n  return G;\n}\n\n// ---------------------------------------------------------------------------\n// Helpers\n// ---------------------------------------------------------------------------\n\nfunction communitiesFromGraph(G: Graph): Map<number, string[]> {\n  const communities = new Map<number, string[]>();\n  G.forEachNode((nodeId, data) => {\n    const cid = data.community as number | undefined;\n    if (cid !== undefined && cid !== null) {\n      if (!communities.has(cid)) communities.set(cid, []);\n      communities.get(cid)!.push(nodeId);\n    }\n  });\n  return communities;\n}\n\nfunction scoreNodes(G: Graph, terms: string[]): Array<[number, string]> {\n  const scored: Array<[number, string]> = [];\n  G.forEachNode((nid, data) => {\n    const label = ((data.label as string) ?? \"\").toLowerCase();\n    const source = ((data.source_file as string) ?? \"\").toLowerCase();\n    const score =\n      terms.reduce((s, t) => s + (label.includes(t) ? 1 : 0), 0) +\n      terms.reduce((s, t) => s + (source.includes(t) ? 0.5 : 0), 0);\n    if (score > 0) scored.push([score, nid]);\n  });\n  scored.sort((a, b) => b[0] - a[0]);\n  return scored;\n}\n\nfunction bfs(\n  G: Graph,\n  startNodes: string[],\n  depth: number,\n): { visited: Set<string>; edges: Array<[string, string]> } {\n  const visited = new Set<string>(startNodes);\n  let frontier = new Set<string>(startNodes);\n  const edges: Array<[string, string]> = [];\n  for (let i = 0; i < depth; i++) {\n    const nextFrontier = new Set<string>();\n    for (const n of frontier) {\n      G.forEachNeighbor(n, (neighbor) => {\n        if (!visited.has(neighbor)) {\n          nextFrontier.add(neighbor);\n          edges.push([n, neighbor]);\n        }\n      });\n    }\n    for (const n of nextFrontier) visited.add(n);\n    frontier = nextFrontier;\n  }\n  return { visited, edges };\n}\n\nfunction dfs(\n  G: Graph,\n  startNodes: string[],\n  depth: number,\n): { visited: Set<string>; edges: Array<[string, string]> } {\n  const visited = new Set<string>();\n  const edges: Array<[string, string]> = [];\n  const stack: Array<[string, number]> = [...startNodes].reverse().map((n) => [n, 0]);\n  while (stack.length > 0) {\n    const [node, d] = stack.pop()!;\n    if (visited.has(node) || d > depth) continue;\n    visited.add(node);\n    G.forEachNeighbor(node, (neighbor) => {\n      if (!visited.has(neighbor)) {\n        stack.push([neighbor, d + 1]);\n        edges.push([node, neighbor]);\n      }\n    });\n  }\n  return { visited, edges };\n}\n\nfunction subgraphToText(\n  G: Graph,\n  nodes: Set<string>,\n  edges: Array<[string, string]>,\n  tokenBudget: number = 2000,\n): string {\n  const charBudget = tokenBudget * 3;\n  const lines: string[] = [];\n\n  const sorted = [...nodes].sort((a, b) => G.degree(b) - G.degree(a));\n  for (const nid of sorted) {\n    const d = G.getNodeAttributes(nid);\n    lines.push(\n      `NODE ${sanitizeLabel((d.label as string) ?? nid)} [src=${d.source_file ?? \"\"} loc=${d.source_location ?? \"\"} community=${d.community ?? \"\"}]`,\n    );\n  }\n  for (const [u, v] of edges) {\n    if (nodes.has(u) && nodes.has(v)) {\n      const edgeKey = G.edge(u, v);\n      if (!edgeKey) continue;\n      const d = G.getEdgeAttributes(edgeKey);\n      lines.push(\n        `EDGE ${sanitizeLabel((G.getNodeAttribute(u, \"label\") as string) ?? u)} --${d.relation ?? \"\"} [${d.confidence ?? \"\"}]--> ${sanitizeLabel((G.getNodeAttribute(v, \"label\") as string) ?? v)}`,\n      );\n    }\n  }\n  let output = lines.join(\"\\n\");\n  if (output.length > charBudget) {\n    output = output.slice(0, charBudget) + `\\n... (truncated to ~${tokenBudget} token budget)`;\n  }\n  return output;\n}\n\nfunction findNode(G: Graph, label: string): string[] {\n  const term = label.toLowerCase();\n  const result: string[] = [];\n  G.forEachNode((nid, d) => {\n    if (\n      ((d.label as string) ?? \"\").toLowerCase().includes(term) ||\n      nid.toLowerCase() === term\n    ) {\n      result.push(nid);\n    }\n  });\n  return result;\n}\n\n// ---------------------------------------------------------------------------\n// Tool handlers\n// ---------------------------------------------------------------------------\n\nfunction toolQueryGraph(G: Graph, args: Record<string, unknown>): string {\n  const question = args.question as string;\n  const mode = (args.mode as string) ?? \"bfs\";\n  const depth = Math.min(Number(args.depth ?? 3), 6);\n  const budget = Number(args.token_budget ?? 2000);\n  const terms = question\n    .split(/\\s+/)\n    .filter((t) => t.length > 2)\n    .map((t) => t.toLowerCase());\n\n  const scored = scoreNodes(G, terms);\n  const startNodes = scored.slice(0, 3).map(([, nid]) => nid);\n  if (startNodes.length === 0) return \"No matching nodes found.\";\n\n  const { visited, edges } =\n    mode === \"dfs\" ? dfs(G, startNodes, depth) : bfs(G, startNodes, depth);\n\n  const startLabels = startNodes.map(\n    (n) => (G.getNodeAttribute(n, \"label\") as string) ?? n,\n  );\n  const header = `Traversal: ${mode.toUpperCase()} depth=${depth} | Start: [${startLabels.join(\", \")}] | ${visited.size} nodes found\\n\\n`;\n  return header + subgraphToText(G, visited, edges, budget);\n}\n\nfunction toolGetNode(G: Graph, args: Record<string, unknown>): string {\n  const label = (args.label as string).toLowerCase();\n  const matches: Array<[string, Record<string, unknown>]> = [];\n  G.forEachNode((nid, d) => {\n    if (\n      ((d.label as string) ?? \"\").toLowerCase().includes(label) ||\n      nid.toLowerCase() === label\n    ) {\n      matches.push([nid, d]);\n    }\n  });\n  if (matches.length === 0) return `No node matching '${label}' found.`;\n  const [nid, d] = matches[0]!;\n  return [\n    `Node: ${d.label ?? nid}`,\n    `  ID: ${nid}`,\n    `  Source: ${d.source_file ?? \"\"} ${d.source_location ?? \"\"}`,\n    `  Type: ${d.file_type ?? \"\"}`,\n    `  Community: ${d.community ?? \"\"}`,\n    `  Degree: ${G.degree(nid)}`,\n  ].join(\"\\n\");\n}\n\nfunction toolGetNeighbors(G: Graph, args: Record<string, unknown>): string {\n  const label = (args.label as string).toLowerCase();\n  const relFilter = ((args.relation_filter as string) ?? \"\").toLowerCase();\n  const matches = findNode(G, label);\n  if (matches.length === 0) return `No node matching '${label}' found.`;\n  const nid = matches[0]!;\n  const lines = [`Neighbors of ${(G.getNodeAttribute(nid, \"label\") as string) ?? nid}:`];\n  G.forEachNeighbor(nid, (neighbor) => {\n    const edgeKey = G.edge(nid, neighbor);\n    if (!edgeKey) return;\n    const d = G.getEdgeAttributes(edgeKey);\n    const rel = (d.relation as string) ?? \"\";\n    if (relFilter && !rel.toLowerCase().includes(relFilter)) return;\n    lines.push(\n      `  --> ${(G.getNodeAttribute(neighbor, \"label\") as string) ?? neighbor} [${rel}] [${d.confidence ?? \"\"}]`,\n    );\n  });\n  return lines.join(\"\\n\");\n}\n\nfunction toolGetCommunity(\n  communities: Map<number, string[]>,\n  G: Graph,\n  args: Record<string, unknown>,\n): string {\n  const cid = Number(args.community_id);\n  const nodes = communities.get(cid);\n  if (!nodes || nodes.length === 0) return `Community ${cid} not found.`;\n  const lines = [`Community ${cid} (${nodes.length} nodes):`];\n  for (const n of nodes) {\n    const d = G.getNodeAttributes(n);\n    lines.push(`  ${d.label ?? n} [${d.source_file ?? \"\"}]`);\n  }\n  return lines.join(\"\\n\");\n}\n\nfunction toolGodNodes(G: Graph, args: Record<string, unknown>): string {\n  const topN = Number(args.top_n ?? 10);\n  const nodes = computeGodNodes(G, topN);\n  const lines = [\"God nodes (most connected):\"];\n  nodes.forEach((n, i) => {\n    lines.push(`  ${i + 1}. ${n.label} - ${n.edges} edges`);\n  });\n  return lines.join(\"\\n\");\n}\n\nfunction toolGraphStats(\n  G: Graph,\n  communities: Map<number, string[]>,\n): string {\n  const confs: string[] = [];\n  G.forEachEdge((_, data) => {\n    confs.push((data.confidence as string) ?? \"EXTRACTED\");\n  });\n  const total = confs.length || 1;\n  return [\n    `Nodes: ${G.order}`,\n    `Edges: ${G.size}`,\n    `Communities: ${communities.size}`,\n    `EXTRACTED: ${Math.round((confs.filter((c) => c === \"EXTRACTED\").length / total) * 100)}%`,\n    `INFERRED: ${Math.round((confs.filter((c) => c === \"INFERRED\").length / total) * 100)}%`,\n    `AMBIGUOUS: ${Math.round((confs.filter((c) => c === \"AMBIGUOUS\").length / total) * 100)}%`,\n  ].join(\"\\n\");\n}\n\nfunction toolShortestPath(G: Graph, args: Record<string, unknown>): string {\n  const srcTerms = (args.source as string)\n    .split(/\\s+/)\n    .map((t) => t.toLowerCase());\n  const tgtTerms = (args.target as string)\n    .split(/\\s+/)\n    .map((t) => t.toLowerCase());\n  const srcScored = scoreNodes(G, srcTerms);\n  const tgtScored = scoreNodes(G, tgtTerms);\n\n  if (srcScored.length === 0)\n    return `No node matching source '${args.source}' found.`;\n  if (tgtScored.length === 0)\n    return `No node matching target '${args.target}' found.`;\n\n  const srcNid = srcScored[0]![1];\n  const tgtNid = tgtScored[0]![1];\n  const maxHops = Number(args.max_hops ?? 8);\n\n  const pathNodes = bidirectional(G, srcNid, tgtNid);\n  if (!pathNodes) {\n    return `No path found between '${(G.getNodeAttribute(srcNid, \"label\") as string) ?? srcNid}' and '${(G.getNodeAttribute(tgtNid, \"label\") as string) ?? tgtNid}'.`;\n  }\n\n  const hops = pathNodes.length - 1;\n  if (hops > maxHops) return `Path exceeds max_hops=${maxHops} (${hops} hops found).`;\n\n  const segments: string[] = [];\n  for (let i = 0; i < pathNodes.length - 1; i++) {\n    const u = pathNodes[i]!;\n    const v = pathNodes[i + 1]!;\n    const edgeKey = G.edge(u, v);\n    const edata = edgeKey ? G.getEdgeAttributes(edgeKey) : {};\n    const rel = (edata.relation as string) ?? \"\";\n    const conf = (edata.confidence as string) ?? \"\";\n    const confStr = conf ? ` [${conf}]` : \"\";\n    if (i === 0) {\n      segments.push((G.getNodeAttribute(u, \"label\") as string) ?? u);\n    }\n    segments.push(\n      `--${rel}${confStr}--> ${(G.getNodeAttribute(v, \"label\") as string) ?? v}`,\n    );\n  }\n  return `Shortest path (${hops} hops):\\n  ${segments.join(\" \")}`;\n}\n\n// ---------------------------------------------------------------------------\n// Server\n// ---------------------------------------------------------------------------\n\nexport async function serve(\n  graphPath: string = \"graphify-out/graph.json\",\n  transport?: Transport,\n): Promise<void> {\n  let Server: typeof import(\"@modelcontextprotocol/sdk/server/index.js\").Server;\n  let StdioServerTransport: typeof import(\"@modelcontextprotocol/sdk/server/stdio.js\").StdioServerTransport;\n  let ListToolsRequestSchema: typeof import(\"@modelcontextprotocol/sdk/types.js\").ListToolsRequestSchema;\n  let CallToolRequestSchema: typeof import(\"@modelcontextprotocol/sdk/types.js\").CallToolRequestSchema;\n\n  try {\n    const serverMod = await import(\"@modelcontextprotocol/sdk/server/index.js\");\n    const stdioMod = await import(\"@modelcontextprotocol/sdk/server/stdio.js\");\n    const typesMod = await import(\"@modelcontextprotocol/sdk/types.js\");\n    Server = serverMod.Server;\n    StdioServerTransport = stdioMod.StdioServerTransport;\n    ListToolsRequestSchema = typesMod.ListToolsRequestSchema;\n    CallToolRequestSchema = typesMod.CallToolRequestSchema;\n  } catch {\n    throw new Error(\n      \"@modelcontextprotocol/sdk not installed. Run: npm install @modelcontextprotocol/sdk\",\n    );\n  }\n\n  const G = loadGraph(graphPath);\n  const communities = communitiesFromGraph(G);\n\n  const server = new Server(\n    { name: \"graphify\", version: \"0.3.17\" },\n    { capabilities: { tools: {} } },\n  );\n\n  server.setRequestHandler(ListToolsRequestSchema, async () => ({\n    tools: [\n      {\n        name: \"query_graph\",\n        description:\n          \"Search the knowledge graph using BFS or DFS. Returns relevant nodes and edges as text context.\",\n        inputSchema: {\n          type: \"object\" as const,\n          properties: {\n            question: {\n              type: \"string\",\n              description: \"Natural language question or keyword search\",\n            },\n            mode: {\n              type: \"string\",\n              enum: [\"bfs\", \"dfs\"],\n              default: \"bfs\",\n              description: \"bfs=broad context, dfs=trace a specific path\",\n            },\n            depth: {\n              type: \"integer\",\n              default: 3,\n              description: \"Traversal depth (1-6)\",\n            },\n            token_budget: {\n              type: \"integer\",\n              default: 2000,\n              description: \"Max output tokens\",\n            },\n          },\n          required: [\"question\"],\n        },\n      },\n      {\n        name: \"get_node\",\n        description: \"Get full details for a specific node by label or ID.\",\n        inputSchema: {\n          type: \"object\" as const,\n          properties: {\n            label: {\n              type: \"string\",\n              description: \"Node label or ID to look up\",\n            },\n          },\n          required: [\"label\"],\n        },\n      },\n      {\n        name: \"get_neighbors\",\n        description:\n          \"Get all direct neighbors of a node with edge details.\",\n        inputSchema: {\n          type: \"object\" as const,\n          properties: {\n            label: { type: \"string\" },\n            relation_filter: {\n              type: \"string\",\n              description: \"Optional: filter by relation type\",\n            },\n          },\n          required: [\"label\"],\n        },\n      },\n      {\n        name: \"get_community\",\n        description: \"Get all nodes in a community by community ID.\",\n        inputSchema: {\n          type: \"object\" as const,\n          properties: {\n            community_id: {\n              type: \"integer\",\n              description: \"Community ID (0-indexed by size)\",\n            },\n          },\n          required: [\"community_id\"],\n        },\n      },\n      {\n        name: \"god_nodes\",\n        description:\n          \"Return the most connected nodes - the core abstractions of the knowledge graph.\",\n        inputSchema: {\n          type: \"object\" as const,\n          properties: {\n            top_n: { type: \"integer\", default: 10 },\n          },\n        },\n      },\n      {\n        name: \"graph_stats\",\n        description:\n          \"Return summary statistics: node count, edge count, communities, confidence breakdown.\",\n        inputSchema: { type: \"object\" as const, properties: {} },\n      },\n      {\n        name: \"shortest_path\",\n        description:\n          \"Find the shortest path between two concepts in the knowledge graph.\",\n        inputSchema: {\n          type: \"object\" as const,\n          properties: {\n            source: {\n              type: \"string\",\n              description: \"Source concept label or keyword\",\n            },\n            target: {\n              type: \"string\",\n              description: \"Target concept label or keyword\",\n            },\n            max_hops: {\n              type: \"integer\",\n              default: 8,\n              description: \"Maximum hops to consider\",\n            },\n          },\n          required: [\"source\", \"target\"],\n        },\n      },\n    ],\n  }));\n\n  const handlers: Record<\n    string,\n    (args: Record<string, unknown>) => string\n  > = {\n    query_graph: (a) => toolQueryGraph(G, a),\n    get_node: (a) => toolGetNode(G, a),\n    get_neighbors: (a) => toolGetNeighbors(G, a),\n    get_community: (a) => toolGetCommunity(communities, G, a),\n    god_nodes: (a) => toolGodNodes(G, a),\n    graph_stats: () => toolGraphStats(G, communities),\n    shortest_path: (a) => toolShortestPath(G, a),\n  };\n\n  server.setRequestHandler(CallToolRequestSchema, async (request) => {\n    const { name, arguments: args } = request.params;\n    const handler = handlers[name];\n    if (!handler) {\n      return { content: [{ type: \"text\" as const, text: `Unknown tool: ${name}` }] };\n    }\n    const text = handler((args ?? {}) as Record<string, unknown>);\n    return { content: [{ type: \"text\" as const, text }] };\n  });\n\n  const serverTransport = transport ?? new StdioServerTransport();\n  let keepAlive: NodeJS.Timeout | undefined;\n  if (!transport) {\n    keepAlive = setInterval(() => undefined, 60_000);\n    process.stdin?.resume();\n  }\n\n  const closed = new Promise<void>((resolve) => {\n    const previousOnClose = server.onclose;\n    server.onclose = () => {\n      if (keepAlive) {\n        clearInterval(keepAlive);\n      }\n      previousOnClose?.();\n      resolve();\n    };\n  });\n\n  await server.connect(serverTransport);\n  if (transport) {\n    await closed;\n  }\n}\n\n// ---------------------------------------------------------------------------\n// CLI entry point\n// ---------------------------------------------------------------------------\n\nconst isDirectExecution = typeof process !== \"undefined\" &&\n  typeof process.argv[1] === \"string\" &&\n  /^serve\\.(?:js|mjs|cjs|ts)$/.test(basename(process.argv[1]));\n\nif (isDirectExecution) {\n  const graphPath = process.argv[2] ?? \"graphify-out/graph.json\";\n  serve(graphPath).catch((err) => {\n    console.error(err);\n    process.exit(1);\n  });\n}\n","/**\n * File watcher - monitor a folder and auto-trigger graph rebuild when files change.\n *\n * Uses chokidar instead of Python watchdog.\n * Code-only changes rebuild graph automatically (no LLM needed).\n * Doc/paper/image changes write a flag and notify the user.\n */\nimport { existsSync, mkdirSync, writeFileSync, unlinkSync } from \"node:fs\";\nimport { resolve as pathResolve, extname, basename } from \"node:path\";\n\nconst WATCHED_EXTENSIONS = new Set([\n  \".py\", \".ts\", \".js\", \".go\", \".rs\", \".java\", \".cpp\", \".c\", \".rb\", \".swift\", \".kt\",\n  \".cs\", \".scala\", \".php\", \".cc\", \".cxx\", \".hpp\", \".h\", \".kts\",\n  \".md\", \".txt\", \".rst\", \".pdf\",\n  \".png\", \".jpg\", \".jpeg\", \".webp\", \".gif\", \".svg\",\n]);\n\nconst CODE_EXTENSIONS = new Set([\n  \".py\", \".ts\", \".js\", \".go\", \".rs\", \".java\", \".cpp\", \".c\", \".rb\", \".swift\", \".kt\",\n  \".cs\", \".scala\", \".php\", \".cc\", \".cxx\", \".hpp\", \".h\", \".kts\",\n]);\n\n// ---------------------------------------------------------------------------\n// Rebuild pipeline (code-only, no LLM)\n// ---------------------------------------------------------------------------\n\nexport async function rebuildCode(\n  watchPath: string,\n  followSymlinks: boolean = false,\n): Promise<boolean> {\n  try {\n    // Dynamic imports - these modules are in the same package\n    const { collectFiles, extractWithDiagnostics } = await import(\"./extract.js\");\n    const { buildFromJson } = await import(\"./build.js\");\n    const { cluster, scoreAll } = await import(\"./cluster.js\");\n    const { godNodes, surprisingConnections, suggestQuestions } = await import(\"./analyze.js\");\n    const { generate } = await import(\"./report.js\");\n    const { toJson } = await import(\"./export.js\");\n\n    let codeFiles = await collectFiles(watchPath, { followSymlinks });\n    codeFiles = codeFiles.filter(\n      (f: string) =>\n        !f.includes(\"graphify-out\") &&\n        !f.includes(\"__pycache__\") &&\n        !f.includes(\"node_modules\"),\n    );\n\n    if (codeFiles.length === 0) {\n      console.log(\"[graphify watch] No code files found - nothing to rebuild.\");\n      return false;\n    }\n\n    const { extraction: result, diagnostics } = await extractWithDiagnostics(codeFiles);\n    if (diagnostics.length > 0) {\n      console.log(\n        `[graphify watch] AST extraction failed for ${diagnostics.length} file(s): ` +\n        `${diagnostics.slice(0, 3).map((d) => `${d.filePath}: ${d.error}`).join(\" | \")}`,\n      );\n    }\n    if (result.nodes.length === 0) {\n      console.log(\"[graphify watch] Rebuild failed: AST extraction produced no graph nodes.\");\n      return false;\n    }\n\n    const detection = {\n      files: {\n        code: codeFiles,\n        document: [] as string[],\n        paper: [] as string[],\n        image: [] as string[],\n      },\n      total_files: codeFiles.length,\n      total_words: 0,\n      needs_graph: true,\n      warning: null,\n      skipped_sensitive: [] as string[],\n      graphifyignore_patterns: 0,\n    };\n\n    const G = buildFromJson(result);\n    const communities = cluster(G);\n    const cohesion = scoreAll(G, communities);\n    const gods = godNodes(G);\n    const surprises = surprisingConnections(G, communities);\n    const labels = new Map<number, string>();\n    for (const cid of communities.keys()) {\n      labels.set(cid, `Community ${cid}`);\n    }\n    const questions = suggestQuestions(G, communities, labels);\n\n    const outDir = pathResolve(watchPath, \"graphify-out\");\n    mkdirSync(outDir, { recursive: true });\n\n    const report = generate(\n      G,\n      communities,\n      cohesion,\n      labels,\n      gods,\n      surprises,\n      detection,\n      { input: 0, output: 0 },\n      watchPath,\n      questions,\n    );\n    writeFileSync(pathResolve(outDir, \"GRAPH_REPORT.md\"), report, \"utf-8\");\n    toJson(G, communities, pathResolve(outDir, \"graph.json\"));\n\n    // Clear stale needs_update flag if present\n    const flagPath = pathResolve(outDir, \"needs_update\");\n    if (existsSync(flagPath)) {\n      unlinkSync(flagPath);\n    }\n\n    console.log(\n      `[graphify watch] Rebuilt: ${G.order} nodes, ${G.size} edges, ${communities.size} communities`,\n    );\n    console.log(\n      `[graphify watch] graph.json and GRAPH_REPORT.md updated in ${outDir}`,\n    );\n    return true;\n  } catch (err) {\n    console.log(\n      `[graphify watch] Rebuild failed: ${err instanceof Error ? err.message : err}`,\n    );\n    return false;\n  }\n}\n\n// ---------------------------------------------------------------------------\n// Notification fallback (non-code changes)\n// ---------------------------------------------------------------------------\n\nfunction notifyOnly(watchPath: string): void {\n  const outDir = pathResolve(watchPath, \"graphify-out\");\n  mkdirSync(outDir, { recursive: true });\n  const flagPath = pathResolve(outDir, \"needs_update\");\n  writeFileSync(flagPath, \"1\", \"utf-8\");\n  console.log(`\\n[graphify watch] New or changed files detected in ${watchPath}`);\n  console.log(\n    \"[graphify watch] Non-code files changed - semantic re-extraction requires LLM.\",\n  );\n  console.log(\n    \"[graphify watch] Run the graphify skill with `--update` to refresh semantic data (for Codex: `$graphify . --update`).\",\n  );\n  console.log(`[graphify watch] Flag written to ${flagPath}`);\n}\n\nfunction hasNonCode(changedPaths: string[]): boolean {\n  return changedPaths.some((p) => !CODE_EXTENSIONS.has(extname(p).toLowerCase()));\n}\n\n// ---------------------------------------------------------------------------\n// Main watcher\n// ---------------------------------------------------------------------------\n\nexport async function watch(\n  watchPath: string,\n  debounce: number = 3.0,\n): Promise<void> {\n  let chokidar: typeof import(\"chokidar\");\n  try {\n    chokidar = await import(\"chokidar\");\n  } catch {\n    throw new Error(\"chokidar not installed. Run: npm install chokidar\");\n  }\n\n  const resolvedPath = pathResolve(watchPath);\n  let lastTrigger = 0;\n  let pending = false;\n  const changed = new Set<string>();\n\n  const watcher = chokidar.watch(resolvedPath, {\n    persistent: true,\n    ignoreInitial: true,\n    followSymlinks: false,\n    ignored: [\n      /node_modules/,\n      /\\.git/,\n      /graphify-out/,\n    ],\n  });\n\n  watcher.on(\"all\", (_event: string, filePath: string) => {\n    const ext = extname(filePath).toLowerCase();\n    if (!WATCHED_EXTENSIONS.has(ext)) return;\n\n    // Skip hidden directories\n    const parts = filePath.split(\"/\");\n    if (parts.some((part) => part.startsWith(\".\") && part !== \".\")) return;\n\n    lastTrigger = Date.now();\n    pending = true;\n    changed.add(filePath);\n  });\n\n  console.log(\n    `[graphify watch] Watching ${resolvedPath} - press Ctrl+C to stop`,\n  );\n  console.log(\n    \"[graphify watch] Code changes rebuild graph automatically. Doc/image changes require a graphify skill `--update` run.\",\n  );\n  console.log(`[graphify watch] Debounce: ${debounce}s`);\n\n  const debounceMs = debounce * 1000;\n\n  const poll = setInterval(async () => {\n    if (pending && Date.now() - lastTrigger >= debounceMs) {\n      pending = false;\n      const batch = [...changed];\n      changed.clear();\n      console.log(`\\n[graphify watch] ${batch.length} file(s) changed`);\n      if (hasNonCode(batch)) {\n        notifyOnly(watchPath);\n      } else {\n        await rebuildCode(watchPath);\n      }\n    }\n  }, 500);\n\n  // Graceful shutdown\n  const cleanup = () => {\n    console.log(\"\\n[graphify watch] Stopped.\");\n    clearInterval(poll);\n    watcher.close();\n    process.exit(0);\n  };\n\n  process.on(\"SIGINT\", cleanup);\n  process.on(\"SIGTERM\", cleanup);\n}\n\n// ---------------------------------------------------------------------------\n// CLI entry point\n// ---------------------------------------------------------------------------\n\nconst isDirectExecution = typeof process !== \"undefined\" &&\n  typeof process.argv[1] === \"string\" &&\n  /^watch\\.(?:js|mjs|cjs|ts)$/.test(basename(process.argv[1]));\n\nif (isDirectExecution) {\n  const watchPath = process.argv[2] ?? \".\";\n  const debounce = process.argv[3] ? parseFloat(process.argv[3]) : 3.0;\n  watch(watchPath, debounce).catch((err) => {\n    console.error(err);\n    process.exit(1);\n  });\n}\n"],"mappings":";;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AAaO,SAAS,mBAAmB,MAAyB;AAC1D,MAAI,OAAO,SAAS,YAAY,SAAS,QAAQ,MAAM,QAAQ,IAAI,GAAG;AACpE,WAAO,CAAC,kCAAkC;AAAA,EAC5C;AAEA,QAAM,IAAI;AACV,QAAM,SAAmB,CAAC;AAG1B,MAAI,EAAE,WAAW,IAAI;AACnB,WAAO,KAAK,8BAA8B;AAAA,EAC5C,WAAW,CAAC,MAAM,QAAQ,EAAE,KAAK,GAAG;AAClC,WAAO,KAAK,wBAAwB;AAAA,EACtC,OAAO;AACL,aAAS,IAAI,GAAG,IAAI,EAAE,MAAM,QAAQ,KAAK;AACvC,YAAM,OAAO,EAAE,MAAM,CAAC;AACtB,UAAI,OAAO,SAAS,YAAY,SAAS,QAAQ,MAAM,QAAQ,IAAI,GAAG;AACpE,eAAO,KAAK,QAAQ,CAAC,oBAAoB;AACzC;AAAA,MACF;AACA,iBAAW,SAAS,sBAAsB;AACxC,YAAI,EAAE,SAAS,OAAO;AACpB,iBAAO;AAAA,YACL,QAAQ,CAAC,QAAQ,KAAK,UAAU,KAAK,MAAM,GAAG,CAAC,6BAA6B,KAAK;AAAA,UACnF;AAAA,QACF;AAAA,MACF;AACA,UAAI,eAAe,QAAQ,CAAC,iBAAiB,IAAI,KAAK,SAAmB,GAAG;AAC1E,eAAO;AAAA,UACL,QAAQ,CAAC,QAAQ,KAAK,UAAU,KAAK,MAAM,GAAG,CAAC,4BACzC,KAAK,SAAS,sBAAsB,KAAK,UAAU,CAAC,GAAG,gBAAgB,EAAE,KAAK,CAAC,CAAC;AAAA,QACxF;AAAA,MACF;AAAA,IACF;AAAA,EACF;AAGA,MAAI,EAAE,WAAW,IAAI;AACnB,WAAO,KAAK,8BAA8B;AAAA,EAC5C,WAAW,CAAC,MAAM,QAAQ,EAAE,KAAK,GAAG;AAClC,WAAO,KAAK,wBAAwB;AAAA,EACtC,OAAO;AACL,UAAM,UAAU,oBAAI,IAAY;AAChC,QAAI,MAAM,QAAQ,EAAE,KAAK,GAAG;AAC1B,iBAAW,KAAK,EAAE,OAAO;AACvB,YAAI,OAAO,MAAM,YAAY,MAAM,QAAQ,QAAQ,GAAG;AACpD,kBAAQ,IAAK,EAA8B,EAAY;AAAA,QACzD;AAAA,MACF;AAAA,IACF;AAEA,aAAS,IAAI,GAAG,IAAI,EAAE,MAAM,QAAQ,KAAK;AACvC,YAAM,OAAO,EAAE,MAAM,CAAC;AACtB,UAAI,OAAO,SAAS,YAAY,SAAS,QAAQ,MAAM,QAAQ,IAAI,GAAG;AACpE,eAAO,KAAK,QAAQ,CAAC,oBAAoB;AACzC;AAAA,MACF;AACA,iBAAW,SAAS,sBAAsB;AACxC,YAAI,EAAE,SAAS,OAAO;AACpB,iBAAO,KAAK,QAAQ,CAAC,4BAA4B,KAAK,GAAG;AAAA,QAC3D;AAAA,MACF;AACA,UAAI,gBAAgB,QAAQ,CAAC,kBAAkB,IAAI,KAAK,UAAoB,GAAG;AAC7E,eAAO;AAAA,UACL,QAAQ,CAAC,4BAA4B,KAAK,UAAU,sBAC9B,KAAK,UAAU,CAAC,GAAG,iBAAiB,EAAE,KAAK,CAAC,CAAC;AAAA,QACrE;AAAA,MACF;AACA,UAAI,YAAY,QAAQ,QAAQ,OAAO,KAAK,CAAC,QAAQ,IAAI,KAAK,MAAgB,GAAG;AAC/E,eAAO,KAAK,QAAQ,CAAC,YAAY,KAAK,MAAM,8BAA8B;AAAA,MAC5E;AACA,UAAI,YAAY,QAAQ,QAAQ,OAAO,KAAK,CAAC,QAAQ,IAAI,KAAK,MAAgB,GAAG;AAC/E,eAAO,KAAK,QAAQ,CAAC,YAAY,KAAK,MAAM,8BAA8B;AAAA,MAC5E;AAAA,IACF;AAAA,EACF;AAEA,SAAO;AACT;AAGO,SAAS,YAAY,MAAqB;AAC/C,QAAM,SAAS,mBAAmB,IAAI;AACtC,MAAI,OAAO,SAAS,GAAG;AACrB,UAAM,MACJ,uBAAuB,OAAO,MAAM;AAAA,IACpC,OAAO,IAAI,CAAC,MAAM,YAAO,CAAC,EAAE,EAAE,KAAK,IAAI;AACzC,UAAM,IAAI,MAAM,GAAG;AAAA,EACrB;AACF;AAtGA,IAIa,kBACA,mBACA,sBACA;AAPb;AAAA;AAIO,IAAM,mBAAmB,oBAAI,IAAI,CAAC,QAAQ,YAAY,SAAS,SAAS,WAAW,CAAC;AACpF,IAAM,oBAAoB,oBAAI,IAAI,CAAC,aAAa,YAAY,WAAW,CAAC;AACxE,IAAM,uBAAuB,CAAC,MAAM,SAAS,aAAa,aAAa;AACvE,IAAM,uBAAuB,CAAC,UAAU,UAAU,YAAY,cAAc,aAAa;AAAA;AAAA;;;ACPhG;AAAA;AAAA;AAAA;AAAA;AAcO,SAAS,cAAc,YAA+B;AAC3D,QAAM,SAAS,mBAAmB,UAAU;AAE5C,QAAM,aAAa,OAAO,OAAO,CAAC,MAAM,CAAC,EAAE,SAAS,4BAA4B,CAAC;AACjF,MAAI,WAAW,SAAS,GAAG;AACzB,YAAQ;AAAA,MACN,kCAAkC,WAAW,MAAM,aAAa,WAAW,CAAC,CAAC;AAAA,IAC/E;AAAA,EACF;AAEA,QAAM,IAAI,IAAI,kBAAAA,QAAM,EAAE,MAAM,cAAc,OAAO,MAAM,CAAC;AAExD,aAAW,QAAQ,WAAW,SAAS,CAAC,GAAG;AACzC,UAAM,EAAE,IAAI,GAAG,MAAM,IAAI;AACzB,MAAE,UAAU,IAAI,KAAK;AAAA,EACvB;AAEA,QAAM,UAAU,IAAI,IAAI,EAAE,MAAM,CAAC;AAEjC,aAAW,QAAQ,WAAW,SAAS,CAAC,GAAG;AACzC,UAAM,EAAE,QAAQ,QAAQ,GAAG,MAAM,IAAI;AACrC,QAAI,CAAC,QAAQ,IAAI,MAAM,KAAK,CAAC,QAAQ,IAAI,MAAM,EAAG;AAElD,UAAM,OAAO;AACb,UAAM,OAAO;AAEb,QAAI;AACF,QAAE,UAAU,QAAQ,QAAQ,KAAK;AAAA,IACnC,QAAQ;AAAA,IAER;AAAA,EACF;AAEA,QAAM,aAAa,WAAW,cAAc,CAAC;AAC7C,MAAI,WAAW,SAAS,GAAG;AACzB,MAAE,aAAa,cAAc,UAAU;AAAA,EACzC;AAEA,SAAO;AACT;AAMO,SAAS,MAAM,aAAkC;AACtD,QAAM,WAAuB;AAAA,IAC3B,OAAO,CAAC;AAAA,IACR,OAAO,CAAC;AAAA,IACR,YAAY,CAAC;AAAA,IACb,cAAc;AAAA,IACd,eAAe;AAAA,EACjB;AACA,aAAW,OAAO,aAAa;AAC7B,aAAS,MAAM,KAAK,GAAI,IAAI,SAAS,CAAC,CAAE;AACxC,aAAS,MAAM,KAAK,GAAI,IAAI,SAAS,CAAC,CAAE;AACxC,KAAC,SAAS,eAAe,CAAC,GAAG,KAAK,GAAI,IAAI,cAAc,CAAC,CAAE;AAC3D,aAAS,gBAAgB,IAAI,gBAAgB;AAC7C,aAAS,iBAAiB,IAAI,iBAAiB;AAAA,EACjD;AACA,SAAO,cAAc,QAAQ;AAC/B;AA3EA,IAUA;AAVA;AAAA;AAUA,wBAAkB;AAElB;AAAA;AAAA;;;ACTO,SAAS,aACd,OACgB;AAChB,MAAI,iBAAiB,IAAK,QAAO;AAEjC,QAAM,MAAM,oBAAI,IAAe;AAC/B,MAAI,CAAC,MAAO,QAAO;AAEnB,aAAW,CAAC,KAAK,KAAK,KAAK,OAAO,QAAQ,KAAK,GAAG;AAChD,UAAM,aAAa,OAAO,GAAG;AAC7B,QAAI,OAAO,SAAS,UAAU,GAAG;AAC/B,UAAI,IAAI,YAAY,KAAU;AAAA,IAChC;AAAA,EACF;AAEA,SAAO;AACT;AAEO,SAAS,YACd,OACgB;AAChB,MAAI,iBAAiB,IAAK,QAAO;AAEjC,QAAM,MAAM,oBAAI,IAAe;AAC/B,MAAI,CAAC,MAAO,QAAO;AAEnB,aAAW,CAAC,KAAK,KAAK,KAAK,OAAO,QAAQ,KAAK,GAAG;AAChD,QAAI,IAAI,KAAK,KAAU;AAAA,EACzB;AAEA,SAAO;AACT;AAlCA;AAAA;AAAA;AAAA;;;ACAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAYA,SAAS,UAAU,GAA+B;AAEhD,QAAM,aAAS,sCAAAC,SAAQ,CAAC;AACxB,QAAM,MAAM,oBAAI,IAAoB;AACpC,aAAW,CAAC,MAAM,GAAG,KAAK,OAAO,QAAQ,MAAM,GAAG;AAChD,QAAI,IAAI,MAAM,GAAa;AAAA,EAC7B;AACA,SAAO;AACT;AAEA,SAAS,eAAe,GAAU,OAA6B;AAC7D,QAAM,WAAW,EAAE,KAAK;AAExB,QAAM,UAAU,IAAI,IAAI,KAAK;AAC7B,WAAS,YAAY,CAAC,MAAM;AAC1B,QAAI,CAAC,QAAQ,IAAI,CAAC,EAAG,UAAS,SAAS,CAAC;AAAA,EAC1C,CAAC;AAED,MAAI,SAAS,SAAS,GAAG;AACvB,WAAO,MAAM,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC;AAAA,EAC7B;AAEA,MAAI;AACF,UAAM,eAAe,UAAU,QAAQ;AACvC,UAAM,iBAAiB,oBAAI,IAAsB;AACjD,eAAW,CAAC,MAAM,GAAG,KAAK,cAAc;AACtC,UAAI,CAAC,eAAe,IAAI,GAAG,EAAG,gBAAe,IAAI,KAAK,CAAC,CAAC;AACxD,qBAAe,IAAI,GAAG,EAAG,KAAK,IAAI;AAAA,IACpC;AACA,QAAI,eAAe,QAAQ,GAAG;AAC5B,aAAO,CAAC,CAAC,GAAG,KAAK,EAAE,KAAK,CAAC;AAAA,IAC3B;AACA,WAAO,CAAC,GAAG,eAAe,OAAO,CAAC,EAAE,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,EAAE,KAAK,CAAC;AAAA,EAC9D,QAAQ;AACN,WAAO,CAAC,CAAC,GAAG,KAAK,EAAE,KAAK,CAAC;AAAA,EAC3B;AACF;AAEO,SAAS,QAAQ,GAAiC;AACvD,MAAI,EAAE,UAAU,EAAG,QAAO,oBAAI,IAAI;AAElC,MAAI,EAAE,SAAS,GAAG;AAChB,UAAMC,UAAS,oBAAI,IAAsB;AACzC,UAAM,SAAS,CAAC,GAAG,EAAE,MAAM,CAAC,EAAE,KAAK;AACnC,WAAO,QAAQ,CAAC,GAAG,MAAMA,QAAO,IAAI,GAAG,CAAC,CAAC,CAAC,CAAC;AAC3C,WAAOA;AAAA,EACT;AAGA,QAAM,WAAqB,CAAC;AAC5B,QAAM,iBAA2B,CAAC;AAClC,IAAE,YAAY,CAAC,MAAM;AACnB,QAAI,EAAE,OAAO,CAAC,MAAM,GAAG;AACrB,eAAS,KAAK,CAAC;AAAA,IACjB,OAAO;AACL,qBAAe,KAAK,CAAC;AAAA,IACvB;AAAA,EACF,CAAC;AAED,QAAM,MAAM,oBAAI,IAAsB;AAEtC,MAAI,eAAe,SAAS,GAAG;AAE7B,UAAM,YAAY,EAAE,KAAK;AACzB,eAAW,OAAO,UAAU;AAC1B,gBAAU,SAAS,GAAG;AAAA,IACxB;AACA,UAAM,eAAe,UAAU,SAAS;AACxC,eAAW,CAAC,MAAM,GAAG,KAAK,cAAc;AACtC,UAAI,CAAC,IAAI,IAAI,GAAG,EAAG,KAAI,IAAI,KAAK,CAAC,CAAC;AAClC,UAAI,IAAI,GAAG,EAAG,KAAK,IAAI;AAAA,IACzB;AAAA,EACF;AAGA,MAAI,UAAU,KAAK,IAAI,IAAI,GAAG,IAAI,KAAK,CAAC,IAAI;AAC5C,aAAW,QAAQ,UAAU;AAC3B,QAAI,IAAI,SAAS,CAAC,IAAI,CAAC;AACvB;AAAA,EACF;AAGA,QAAM,UAAU,KAAK,IAAI,gBAAgB,KAAK,MAAM,EAAE,QAAQ,sBAAsB,CAAC;AACrF,QAAM,mBAA+B,CAAC;AACtC,aAAW,SAAS,IAAI,OAAO,GAAG;AAChC,QAAI,MAAM,SAAS,SAAS;AAC1B,uBAAiB,KAAK,GAAG,eAAe,GAAG,KAAK,CAAC;AAAA,IACnD,OAAO;AACL,uBAAiB,KAAK,KAAK;AAAA,IAC7B;AAAA,EACF;AAGA,mBAAiB,KAAK,CAAC,GAAG,MAAM,EAAE,SAAS,EAAE,MAAM;AACnD,QAAM,SAAS,oBAAI,IAAsB;AACzC,mBAAiB,QAAQ,CAAC,OAAO,MAAM;AACrC,WAAO,IAAI,GAAG,CAAC,GAAG,KAAK,EAAE,KAAK,CAAC;AAAA,EACjC,CAAC;AACD,SAAO;AACT;AAGO,SAAS,cAAc,GAAU,gBAAkC;AACxE,QAAM,IAAI,eAAe;AACzB,MAAI,KAAK,EAAG,QAAO;AACnB,QAAM,UAAU,IAAI,IAAI,cAAc;AACtC,MAAI,SAAS;AACb,IAAE,YAAY,CAAC,MAAM,OAAO,QAAQ,WAAW;AAC7C,QAAI,QAAQ,IAAI,MAAM,KAAK,QAAQ,IAAI,MAAM,GAAG;AAC9C;AAAA,IACF;AAAA,EACF,CAAC;AACD,QAAM,WAAY,KAAK,IAAI,KAAM;AACjC,SAAO,WAAW,IAAI,KAAK,MAAO,SAAS,WAAY,GAAG,IAAI,MAAM;AACtE;AAEO,SAAS,SACd,GACA,aACqB;AACrB,QAAM,eAAe,aAAa,WAAW;AAC7C,QAAM,SAAS,oBAAI,IAAoB;AACvC,aAAW,CAAC,KAAK,KAAK,KAAK,cAAc;AACvC,WAAO,IAAI,KAAK,cAAc,GAAG,KAAK,CAAC;AAAA,EACzC;AACA,SAAO;AACT;AA1IA,IAMA,uCAGM,wBACA;AAVN;AAAA;AAMA,4CAAoB;AACpB;AAEA,IAAM,yBAAyB;AAC/B,IAAM,iBAAiB;AAAA;AAAA;;;ACVvB;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAYA,SAAS,iBAAiB,aAA4D;AACpF,QAAM,eAAe,aAAa,WAAW;AAC7C,QAAM,SAAS,oBAAI,IAAoB;AACvC,aAAW,CAAC,KAAK,KAAK,KAAK,cAAc;AACvC,eAAW,KAAK,MAAO,QAAO,IAAI,GAAG,GAAG;AAAA,EAC1C;AACA,SAAO;AACT;AAEO,SAAS,WAAW,GAAU,QAAyB;AAC5D,QAAM,QAAQ,EAAE,kBAAkB,MAAM;AACxC,QAAM,QAAS,MAAM,SAAoB;AACzC,MAAI,CAAC,MAAO,QAAO;AAEnB,QAAM,aAAc,MAAM,eAA0B;AACpD,MAAI,YAAY;AACd,UAAM,WAAW,WAAW,MAAM,GAAG,EAAE,IAAI,KAAK;AAChD,QAAI,UAAU,SAAU,QAAO;AAAA,EACjC;AAEA,MAAI,MAAM,WAAW,GAAG,KAAK,MAAM,SAAS,IAAI,EAAG,QAAO;AAC1D,MAAI,MAAM,SAAS,IAAI,KAAK,EAAE,OAAO,MAAM,KAAK,EAAG,QAAO;AAC1D,SAAO;AACT;AAEO,SAAS,cAAc,GAAU,QAAyB;AAC/D,QAAM,OAAO,EAAE,kBAAkB,MAAM;AACvC,QAAM,SAAU,KAAK,eAA0B;AAC/C,MAAI,CAAC,OAAQ,QAAO;AACpB,QAAM,WAAW,OAAO,MAAM,GAAG,EAAE,IAAI,KAAK;AAC5C,MAAI,CAAC,SAAS,SAAS,GAAG,EAAG,QAAO;AACpC,SAAO;AACT;AASA,SAAS,aAAa,MAAsB;AAC1C,QAAM,MAAM,KAAK,SAAS,GAAG,IAAI,KAAK,MAAM,GAAG,EAAE,IAAI,GAAG,YAAY,KAAK,KAAK;AAC9E,MAAI,gBAAgB,IAAI,GAAG,EAAG,QAAO;AACrC,MAAI,iBAAiB,IAAI,GAAG,EAAG,QAAO;AACtC,MAAI,iBAAiB,IAAI,GAAG,EAAG,QAAO;AACtC,SAAO;AACT;AAEA,SAAS,YAAY,MAAsB;AACzC,SAAO,KAAK,SAAS,GAAG,IAAI,KAAK,MAAM,GAAG,EAAE,CAAC,IAAK;AACpD;AAEA,SAAS,cACP,GACA,GACA,GACA,MACA,eACA,SACA,SACoB;AACpB,MAAI,QAAQ;AACZ,QAAM,UAAoB,CAAC;AAE3B,QAAM,OAAQ,KAAK,cAAyB;AAC5C,QAAM,YAAoC,EAAE,WAAW,GAAG,UAAU,GAAG,WAAW,EAAE;AACpF,WAAS,UAAU,IAAI,KAAK;AAC5B,MAAI,SAAS,eAAe,SAAS,YAAY;AAC/C,YAAQ,KAAK,GAAG,KAAK,YAAY,CAAC,+CAA+C;AAAA,EACnF;AAEA,QAAM,OAAO,aAAa,OAAO;AACjC,QAAM,OAAO,aAAa,OAAO;AACjC,MAAI,SAAS,MAAM;AACjB,aAAS;AACT,YAAQ,KAAK,uBAAuB,IAAI,WAAM,IAAI,GAAG;AAAA,EACvD;AAEA,MAAI,YAAY,OAAO,MAAM,YAAY,OAAO,GAAG;AACjD,aAAS;AACT,YAAQ,KAAK,6CAA6C;AAAA,EAC5D;AAEA,QAAM,OAAO,cAAc,IAAI,CAAC;AAChC,QAAM,OAAO,cAAc,IAAI,CAAC;AAChC,MAAI,SAAS,UAAa,SAAS,UAAa,SAAS,MAAM;AAC7D,aAAS;AACT,YAAQ,KAAK,8BAA8B;AAAA,EAC7C;AAEA,MAAI,KAAK,aAAa,2BAA2B;AAC/C,YAAQ,KAAK,MAAM,QAAQ,GAAG;AAC9B,YAAQ,KAAK,uDAAuD;AAAA,EACtE;AAEA,QAAM,OAAO,EAAE,OAAO,CAAC;AACvB,QAAM,OAAO,EAAE,OAAO,CAAC;AACvB,MAAI,KAAK,IAAI,MAAM,IAAI,KAAK,KAAK,KAAK,IAAI,MAAM,IAAI,KAAK,GAAG;AAC1D,aAAS;AACT,UAAM,aAAa,QAAQ,IAAK,EAAE,iBAAiB,GAAG,OAAO,IAAgB,EAAE,iBAAiB,GAAG,OAAO;AAC1G,UAAM,MAAM,QAAQ,IAAK,EAAE,iBAAiB,GAAG,OAAO,IAAgB,EAAE,iBAAiB,GAAG,OAAO;AACnG,YAAQ,KAAK,qBAAqB,UAAU,iCAAiC,GAAG,IAAI;AAAA,EACtF;AAEA,SAAO,CAAC,OAAO,OAAO;AACxB;AAEO,SAAS,SAAS,GAAU,OAAe,IAAoB;AACpE,QAAM,SAA6B,CAAC;AACpC,IAAE,YAAY,CAAC,MAAM,OAAO,KAAK,CAAC,GAAG,EAAE,OAAO,CAAC,CAAC,CAAC,CAAC;AAClD,SAAO,KAAK,CAAC,GAAG,MAAM,EAAE,CAAC,IAAI,EAAE,CAAC,CAAC;AAEjC,QAAM,SAAyB,CAAC;AAChC,aAAW,CAAC,QAAQ,GAAG,KAAK,QAAQ;AAClC,QAAI,WAAW,GAAG,MAAM,KAAK,cAAc,GAAG,MAAM,EAAG;AACvD,WAAO,KAAK;AAAA,MACV,IAAI;AAAA,MACJ,OAAQ,EAAE,iBAAiB,QAAQ,OAAO,KAAgB;AAAA,MAC1D,OAAO;AAAA,IACT,CAAC;AACD,QAAI,OAAO,UAAU,KAAM;AAAA,EAC7B;AACA,SAAO;AACT;AAEO,SAAS,sBACd,GACA,aACA,OAAe,GACE;AACjB,QAAM,QAAQ,aAAa,WAAW;AACtC,QAAM,cAAc,oBAAI,IAAY;AACpC,IAAE,YAAY,CAAC,GAAG,SAAS;AACzB,UAAM,KAAM,KAAK,eAA0B;AAC3C,QAAI,GAAI,aAAY,IAAI,EAAE;AAAA,EAC5B,CAAC;AACD,QAAM,gBAAgB,YAAY,OAAO;AAEzC,MAAI,eAAe;AACjB,WAAO,mBAAmB,GAAG,OAAO,IAAI;AAAA,EAC1C;AACA,SAAO,wBAAwB,GAAG,OAAO,IAAI;AAC/C;AAEA,SAAS,mBAAmB,GAAU,aAAoC,MAA+B;AACvG,QAAM,gBAAgB,iBAAiB,WAAW;AAClD,QAAM,aAAqD,CAAC;AAE5D,IAAE,YAAY,CAAC,MAAM,MAAM,QAAQ,WAAW;AAC5C,UAAM,WAAY,KAAK,YAAuB;AAC9C,QAAI,CAAC,WAAW,gBAAgB,YAAY,QAAQ,EAAE,SAAS,QAAQ,EAAG;AAC1E,QAAI,cAAc,GAAG,MAAM,KAAK,cAAc,GAAG,MAAM,EAAG;AAC1D,QAAI,WAAW,GAAG,MAAM,KAAK,WAAW,GAAG,MAAM,EAAG;AAEpD,UAAM,UAAW,EAAE,iBAAiB,QAAQ,aAAa,KAAgB;AACzE,UAAM,UAAW,EAAE,iBAAiB,QAAQ,aAAa,KAAgB;AACzE,QAAI,CAAC,WAAW,CAAC,WAAW,YAAY,QAAS;AAEjD,UAAM,CAAC,OAAO,OAAO,IAAI,cAAc,GAAG,QAAQ,QAAQ,MAAM,eAAe,SAAS,OAAO;AAC/F,UAAM,QAAS,KAAK,QAAmB;AACvC,UAAM,QAAS,KAAK,QAAmB;AAEvC,eAAW,KAAK;AAAA,MACd,QAAQ;AAAA,MACR,QAAS,EAAE,iBAAiB,OAAO,OAAO,KAAgB;AAAA,MAC1D,QAAS,EAAE,iBAAiB,OAAO,OAAO,KAAgB;AAAA,MAC1D,cAAc;AAAA,QACX,EAAE,iBAAiB,OAAO,aAAa,KAAgB;AAAA,QACvD,EAAE,iBAAiB,OAAO,aAAa,KAAgB;AAAA,MAC1D;AAAA,MACA,YAAa,KAAK,cAA8C;AAAA,MAChE;AAAA,MACA,KAAK,QAAQ,SAAS,IAAI,QAAQ,KAAK,IAAI,IAAI;AAAA,IACjD,CAAC;AAAA,EACH,CAAC;AAED,aAAW,KAAK,CAAC,GAAG,MAAM,EAAE,SAAS,EAAE,MAAM;AAC7C,QAAM,SAAS,WAAW,MAAM,GAAG,IAAI,EAAE,IAAI,CAAC,EAAE,QAAQ,GAAG,KAAK,MAAM,IAAI;AAE1E,MAAI,OAAO,SAAS,EAAG,QAAO;AAC9B,SAAO,wBAAwB,GAAG,aAAa,IAAI;AACrD;AAEA,SAAS,wBACP,GACA,aACA,MACiB;AACjB,MAAI,YAAY,SAAS,GAAG;AAC1B,QAAI,EAAE,SAAS,EAAG,QAAO,CAAC;AAE1B,WAAO,yBAAyB,GAAG,IAAI;AAAA,EACzC;AAEA,QAAM,gBAAgB,iBAAiB,WAAW;AAClD,QAAM,YAAmD,CAAC;AAE1D,IAAE,YAAY,CAAC,MAAM,MAAM,GAAG,MAAM;AAClC,UAAM,OAAO,cAAc,IAAI,CAAC;AAChC,UAAM,OAAO,cAAc,IAAI,CAAC;AAChC,QAAI,SAAS,UAAa,SAAS,UAAa,SAAS,KAAM;AAC/D,QAAI,WAAW,GAAG,CAAC,KAAK,WAAW,GAAG,CAAC,EAAG;AAC1C,UAAM,WAAY,KAAK,YAAuB;AAC9C,QAAI,CAAC,WAAW,gBAAgB,YAAY,QAAQ,EAAE,SAAS,QAAQ,EAAG;AAE1E,UAAM,QAAS,KAAK,QAAmB;AACvC,UAAM,QAAS,KAAK,QAAmB;AAEvC,cAAU,KAAK;AAAA,MACb,QAAS,EAAE,iBAAiB,OAAO,OAAO,KAAgB;AAAA,MAC1D,QAAS,EAAE,iBAAiB,OAAO,OAAO,KAAgB;AAAA,MAC1D,cAAc;AAAA,QACX,EAAE,iBAAiB,OAAO,aAAa,KAAgB;AAAA,QACvD,EAAE,iBAAiB,OAAO,aAAa,KAAgB;AAAA,MAC1D;AAAA,MACA,YAAa,KAAK,cAA8C;AAAA,MAChE;AAAA,MACA,MAAM,qBAAqB,IAAI,qBAAgB,IAAI;AAAA,MACnD,OAAO,CAAC,KAAK,IAAI,MAAM,IAAI,GAAG,KAAK,IAAI,MAAM,IAAI,CAAC,EAAE,KAAK,GAAG;AAAA,IAC9D,CAAC;AAAA,EACH,CAAC;AAED,QAAM,QAAgC,EAAE,WAAW,GAAG,UAAU,GAAG,WAAW,EAAE;AAChF,YAAU,KAAK,CAAC,GAAG,OAAO,MAAM,EAAE,UAAU,KAAK,MAAM,MAAM,EAAE,UAAU,KAAK,EAAE;AAEhF,QAAM,YAAY,oBAAI,IAAY;AAClC,QAAM,UAA2B,CAAC;AAClC,aAAW,KAAK,WAAW;AACzB,UAAM,OAAO,EAAE;AACf,QAAI,CAAC,UAAU,IAAI,IAAI,GAAG;AACxB,gBAAU,IAAI,IAAI;AAClB,YAAM,EAAE,OAAO,GAAG,KAAK,IAAI;AAC3B,cAAQ,KAAK,IAAI;AAAA,IACnB;AAAA,EACF;AACA,SAAO,QAAQ,MAAM,GAAG,IAAI;AAC9B;AAEA,SAAS,yBAAyB,GAAU,MAA+B;AAEzE,QAAM,SAAK,mBAAAC,SAAsB,CAAC;AAClC,QAAM,aAAkE,CAAC;AAEzE,IAAE,YAAY,CAAC,MAAM,MAAM,GAAG,MAAM;AAClC,UAAM,SAAS,GAAG,CAAC,KAAK,MAAM,GAAG,CAAC,KAAK;AACvC,eAAW,KAAK,CAAC,GAAG,GAAG,OAAO,IAAI,CAAC;AAAA,EACrC,CAAC;AAED,aAAW,KAAK,CAAC,GAAG,MAAM,EAAE,CAAC,IAAI,EAAE,CAAC,CAAC;AAErC,SAAO,WAAW,MAAM,GAAG,IAAI,EAAE,IAAI,CAAC,CAAC,GAAG,GAAG,OAAO,IAAI,OAAO;AAAA,IAC7D,QAAS,EAAE,iBAAiB,GAAG,OAAO,KAAgB;AAAA,IACtD,QAAS,EAAE,iBAAiB,GAAG,OAAO,KAAgB;AAAA,IACtD,cAAc;AAAA,MACX,EAAE,iBAAiB,GAAG,aAAa,KAAgB;AAAA,MACnD,EAAE,iBAAiB,GAAG,aAAa,KAAgB;AAAA,IACtD;AAAA,IACA,YAAa,KAAK,cAA8C;AAAA,IAChE,UAAW,KAAK,YAAuB;AAAA,IACvC,MAAM,wCAAwC,MAAM,QAAQ,CAAC,CAAC;AAAA,EAChE,EAAE;AACJ;AAEO,SAAS,iBACd,GACA,aACA,iBACA,OAAe,GACM;AACrB,QAAM,eAAe,aAAa,WAAW;AAC7C,QAAM,WAAW,aAAa,eAAe;AAC7C,QAAM,YAAiC,CAAC;AACxC,QAAM,gBAAgB,iBAAiB,YAAY;AAGnD,IAAE,YAAY,CAAC,MAAM,MAAM,GAAG,MAAM;AAClC,QAAI,KAAK,eAAe,aAAa;AACnC,YAAM,KAAM,EAAE,iBAAiB,GAAG,OAAO,KAAgB;AACzD,YAAM,KAAM,EAAE,iBAAiB,GAAG,OAAO,KAAgB;AACzD,YAAM,WAAY,KAAK,YAAuB;AAC9C,gBAAU,KAAK;AAAA,QACb,MAAM;AAAA,QACN,UAAU,4CAA4C,EAAE,YAAY,EAAE;AAAA,QACtE,KAAK,oCAAoC,QAAQ;AAAA,MACnD,CAAC;AAAA,IACH;AAAA,EACF,CAAC;AAGD,MAAI,EAAE,OAAO,GAAG;AACd,UAAM,SAAK,mBAAAA,SAAsB,CAAC;AAClC,UAAM,UAA8B,OAAO,QAAQ,EAAE,EAClD,OAAO,CAAC,CAAC,GAAG,CAAC,MAAM,CAAC,WAAW,GAAG,CAAC,KAAK,CAAC,cAAc,GAAG,CAAC,KAAM,IAAe,CAAC,EACjF,KAAK,CAAC,GAAG,MAAO,EAAE,CAAC,IAAgB,EAAE,CAAC,CAAY,EAClD,MAAM,GAAG,CAAC;AAEb,eAAW,CAAC,QAAQ,KAAK,KAAK,SAAS;AACrC,YAAM,QAAS,EAAE,iBAAiB,QAAQ,OAAO,KAAgB;AACjE,YAAM,MAAM,cAAc,IAAI,MAAM;AACpC,YAAM,YAAY,QAAQ,SAAa,SAAS,IAAI,GAAG,KAAK,aAAa,GAAG,KAAM;AAClF,YAAM,gBAAgB,oBAAI,IAAY;AACtC,QAAE,gBAAgB,QAAQ,CAAC,MAAM;AAC/B,cAAM,KAAK,cAAc,IAAI,CAAC;AAC9B,YAAI,OAAO,UAAa,OAAO,IAAK,eAAc,IAAI,EAAE;AAAA,MAC1D,CAAC;AACD,UAAI,cAAc,OAAO,GAAG;AAC1B,cAAM,cAAc,CAAC,GAAG,aAAa,EAAE,IAAI,CAAC,MAAM,SAAS,IAAI,CAAC,KAAK,aAAa,CAAC,EAAE;AACrF,kBAAU,KAAK;AAAA,UACb,MAAM;AAAA,UACN,UAAU,cAAc,KAAK,gBAAgB,SAAS,SAAS,YAAY,IAAI,CAAC,MAAM,KAAK,CAAC,IAAI,EAAE,KAAK,IAAI,CAAC;AAAA,UAC5G,KAAK,gCAAgC,MAAM,QAAQ,CAAC,CAAC;AAAA,QACvD,CAAC;AAAA,MACH;AAAA,IACF;AAAA,EACF;AAGA,QAAM,SAA6B,CAAC;AACpC,IAAE,YAAY,CAAC,MAAM,OAAO,KAAK,CAAC,GAAG,EAAE,OAAO,CAAC,CAAC,CAAC,CAAC;AAClD,SAAO,KAAK,CAAC,GAAG,MAAM,EAAE,CAAC,IAAI,EAAE,CAAC,CAAC;AACjC,QAAM,WAAW,OAAO,OAAO,CAAC,CAAC,CAAC,MAAM,CAAC,WAAW,GAAG,CAAC,CAAC,EAAE,MAAM,GAAG,CAAC;AAErE,aAAW,CAAC,MAAM,KAAK,UAAU;AAC/B,UAAM,WAAqB,CAAC;AAC5B,MAAE,YAAY,QAAQ,CAAC,MAAM,MAAM,QAAQ,WAAW;AACpD,UAAI,KAAK,eAAe,YAAY;AAClC,cAAM,QAAS,KAAK,QAAmB;AACvC,cAAM,QAAS,KAAK,QAAmB;AACvC,cAAM,UAAU,UAAU,SAAS,QAAQ;AAC3C,iBAAS,KAAM,EAAE,iBAAiB,SAAS,OAAO,KAAgB,OAAO;AAAA,MAC3E;AAAA,IACF,CAAC;AACD,QAAI,SAAS,UAAU,GAAG;AACxB,YAAM,QAAS,EAAE,iBAAiB,QAAQ,OAAO,KAAgB;AACjE,gBAAU,KAAK;AAAA,QACb,MAAM;AAAA,QACN,UAAU,WAAW,SAAS,MAAM,uCAAuC,KAAK,mBAAmB,SAAS,CAAC,CAAC,YAAY,SAAS,CAAC,CAAC;AAAA,QACrI,KAAK,KAAK,KAAK,UAAU,SAAS,MAAM;AAAA,MAC1C,CAAC;AAAA,IACH;AAAA,EACF;AAGA,QAAM,WAAqB,CAAC;AAC5B,IAAE,YAAY,CAAC,MAAM;AACnB,QAAI,EAAE,OAAO,CAAC,KAAK,KAAK,CAAC,WAAW,GAAG,CAAC,KAAK,CAAC,cAAc,GAAG,CAAC,GAAG;AACjE,eAAS,KAAK,CAAC;AAAA,IACjB;AAAA,EACF,CAAC;AACD,MAAI,SAAS,SAAS,GAAG;AACvB,UAAM,SAAS,SAAS,MAAM,GAAG,CAAC,EAAE,IAAI,CAAC,MAAO,EAAE,iBAAiB,GAAG,OAAO,KAAgB,CAAC;AAC9F,cAAU,KAAK;AAAA,MACb,MAAM;AAAA,MACN,UAAU,iBAAiB,OAAO,IAAI,CAAC,MAAM,KAAK,CAAC,IAAI,EAAE,KAAK,IAAI,CAAC;AAAA,MACnE,KAAK,GAAG,SAAS,MAAM;AAAA,IACzB,CAAC;AAAA,EACH;AAGA,aAAW,CAAC,KAAK,KAAK,KAAK,cAAc;AACvC,UAAM,QAAQ,cAAc,GAAG,KAAK;AACpC,QAAI,QAAQ,QAAQ,MAAM,UAAU,GAAG;AACrC,YAAM,QAAQ,SAAS,IAAI,GAAG,KAAK,aAAa,GAAG;AACnD,gBAAU,KAAK;AAAA,QACb,MAAM;AAAA,QACN,UAAU,YAAY,KAAK;AAAA,QAC3B,KAAK,kBAAkB,KAAK;AAAA,MAC9B,CAAC;AAAA,IACH;AAAA,EACF;AAEA,MAAI,UAAU,WAAW,GAAG;AAC1B,WAAO,CAAC;AAAA,MACN,MAAM;AAAA,MACN,UAAU;AAAA,MACV,KACE;AAAA,IAIJ,CAAC;AAAA,EACH;AAEA,SAAO,UAAU,MAAM,GAAG,IAAI;AAChC;AAEO,SAAS,UAAU,MAAa,MAA8B;AACnE,QAAM,WAAW,IAAI,IAAI,KAAK,MAAM,CAAC;AACrC,QAAM,WAAW,IAAI,IAAI,KAAK,MAAM,CAAC;AAErC,QAAM,eAAe,CAAC,GAAG,QAAQ,EAAE,OAAO,CAAC,MAAM,CAAC,SAAS,IAAI,CAAC,CAAC;AACjE,QAAM,iBAAiB,CAAC,GAAG,QAAQ,EAAE,OAAO,CAAC,MAAM,CAAC,SAAS,IAAI,CAAC,CAAC;AAEnE,QAAM,eAAe,aAAa,IAAI,CAAC,OAAO;AAAA,IAC5C,IAAI;AAAA,IACJ,OAAQ,KAAK,iBAAiB,GAAG,OAAO,KAAgB;AAAA,EAC1D,EAAE;AACF,QAAM,mBAAmB,eAAe,IAAI,CAAC,OAAO;AAAA,IAClD,IAAI;AAAA,IACJ,OAAQ,KAAK,iBAAiB,GAAG,OAAO,KAAgB;AAAA,EAC1D,EAAE;AAEF,WAAS,QAAQ,GAAW,GAAW,UAA0B;AAC/D,WAAO,GAAG,CAAC,GAAG,CAAC,EAAE,KAAK,EAAE,KAAK,GAAG,CAAC,IAAI,QAAQ;AAAA,EAC/C;AAEA,QAAM,cAAc,oBAAI,IAAY;AACpC,OAAK,YAAY,CAAC,MAAM,MAAM,GAAG,MAAM;AACrC,gBAAY,IAAI,QAAQ,GAAG,GAAI,KAAK,YAAuB,EAAE,CAAC;AAAA,EAChE,CAAC;AACD,QAAM,cAAc,oBAAI,IAAY;AACpC,OAAK,YAAY,CAAC,MAAM,MAAM,GAAG,MAAM;AACrC,gBAAY,IAAI,QAAQ,GAAG,GAAI,KAAK,YAAuB,EAAE,CAAC;AAAA,EAChE,CAAC;AAED,QAAM,gBAAgB,IAAI,IAAI,CAAC,GAAG,WAAW,EAAE,OAAO,CAAC,MAAM,CAAC,YAAY,IAAI,CAAC,CAAC,CAAC;AACjF,QAAM,kBAAkB,IAAI,IAAI,CAAC,GAAG,WAAW,EAAE,OAAO,CAAC,MAAM,CAAC,YAAY,IAAI,CAAC,CAAC,CAAC;AAEnF,QAAM,eAA6C,CAAC;AACpD,OAAK,YAAY,CAAC,MAAM,MAAM,GAAG,MAAM;AACrC,QAAI,cAAc,IAAI,QAAQ,GAAG,GAAI,KAAK,YAAuB,EAAE,CAAC,GAAG;AACrE,mBAAa,KAAK;AAAA,QAChB,QAAQ;AAAA,QAAG,QAAQ;AAAA,QACnB,UAAW,KAAK,YAAuB;AAAA,QACvC,YAAa,KAAK,cAAyB;AAAA,MAC7C,CAAC;AAAA,IACH;AAAA,EACF,CAAC;AAED,QAAM,mBAAqD,CAAC;AAC5D,OAAK,YAAY,CAAC,MAAM,MAAM,GAAG,MAAM;AACrC,QAAI,gBAAgB,IAAI,QAAQ,GAAG,GAAI,KAAK,YAAuB,EAAE,CAAC,GAAG;AACvE,uBAAiB,KAAK;AAAA,QACpB,QAAQ;AAAA,QAAG,QAAQ;AAAA,QACnB,UAAW,KAAK,YAAuB;AAAA,QACvC,YAAa,KAAK,cAAyB;AAAA,MAC7C,CAAC;AAAA,IACH;AAAA,EACF,CAAC;AAED,QAAM,QAAkB,CAAC;AACzB,MAAI,aAAa,SAAS,EAAG,OAAM,KAAK,GAAG,aAAa,MAAM,YAAY,aAAa,WAAW,IAAI,MAAM,EAAE,EAAE;AAChH,MAAI,aAAa,SAAS,EAAG,OAAM,KAAK,GAAG,aAAa,MAAM,YAAY,aAAa,WAAW,IAAI,MAAM,EAAE,EAAE;AAChH,MAAI,iBAAiB,SAAS,EAAG,OAAM,KAAK,GAAG,iBAAiB,MAAM,QAAQ,iBAAiB,WAAW,IAAI,MAAM,EAAE,UAAU;AAChI,MAAI,iBAAiB,SAAS,EAAG,OAAM,KAAK,GAAG,iBAAiB,MAAM,QAAQ,iBAAiB,WAAW,IAAI,MAAM,EAAE,UAAU;AAEhI,SAAO;AAAA,IACL,WAAW;AAAA,IACX,eAAe;AAAA,IACf,WAAW;AAAA,IACX,eAAe;AAAA,IACf,SAAS,MAAM,SAAS,IAAI,MAAM,KAAK,IAAI,IAAI;AAAA,EACjD;AACF;AAldA,IAKA,oBAyCM,iBAIA,kBACA;AAnDN;AAAA;AAKA,yBAAkC;AAElC;AACA;AAsCA,IAAM,kBAAkB,oBAAI,IAAI;AAAA,MAC9B;AAAA,MAAM;AAAA,MAAM;AAAA,MAAO;AAAA,MAAM;AAAA,MAAM;AAAA,MAAM;AAAA,MAAQ;AAAA,MAAM;AAAA,MAAO;AAAA,MAAK;AAAA,MAAK;AAAA,MAAM;AAAA,MAAM;AAAA,MAAS;AAAA,IAC3F,CAAC;AAED,IAAM,mBAAmB,oBAAI,IAAI,CAAC,KAAK,CAAC;AACxC,IAAM,mBAAmB,oBAAI,IAAI,CAAC,OAAO,OAAO,QAAQ,QAAQ,OAAO,KAAK,CAAC;AAAA;AAAA;;;ACnD7E;AAAA;AAAA;AAAA;AAQO,SAAS,SACd,GACA,aACA,gBACA,iBACA,aACA,cACA,iBACA,WACA,MACA,oBAIQ;AACR,QAAM,eAAe,aAAa,WAAW;AAC7C,QAAM,cAAc,aAAa,cAAc;AAC/C,QAAM,WAAW,aAAa,eAAe;AAC7C,QAAM,wBAAwB,MAAM,QAAQ,kBAAkB,IAC1D,qBACC,oBAAoB,sBAAsB;AAC/C,QAAM,SAAQ,oBAAI,KAAK,GAAE,YAAY,EAAE,MAAM,GAAG,EAAE;AAElD,QAAM,cAAwB,CAAC;AAC/B,IAAE,YAAY,CAAC,GAAG,SAAS;AACzB,gBAAY,KAAM,KAAK,cAAyB,WAAW;AAAA,EAC7D,CAAC;AACD,QAAM,QAAQ,YAAY,UAAU;AACpC,QAAM,SAAS,KAAK,MAAO,YAAY,OAAO,CAAC,MAAM,MAAM,WAAW,EAAE,SAAS,QAAS,GAAG;AAC7F,QAAM,SAAS,KAAK,MAAO,YAAY,OAAO,CAAC,MAAM,MAAM,UAAU,EAAE,SAAS,QAAS,GAAG;AAC5F,QAAM,SAAS,KAAK,MAAO,YAAY,OAAO,CAAC,MAAM,MAAM,WAAW,EAAE,SAAS,QAAS,GAAG;AAE7F,QAAM,WAAgC,CAAC;AACvC,IAAE,YAAY,CAAC,GAAG,SAAS;AACzB,QAAI,KAAK,eAAe,YAAY;AAClC,eAAS,KAAK,EAAE,OAAQ,KAAK,oBAA+B,IAAI,CAAC;AAAA,IACnE;AAAA,EACF,CAAC;AACD,QAAM,SAAS,SAAS,SAAS,IAC7B,KAAK,MAAO,SAAS,OAAO,CAAC,GAAG,MAAM,IAAI,EAAE,OAAO,CAAC,IAAI,SAAS,SAAU,GAAG,IAAI,MAClF;AAEJ,QAAM,QAAkB;AAAA,IACtB,oBAAoB,IAAI,MAAM,KAAK;AAAA,IACnC;AAAA,IACA;AAAA,EACF;AAEA,MAAI,gBAAgB,SAAS;AAC3B,UAAM,KAAK,KAAK,gBAAgB,OAAO,EAAE;AAAA,EAC3C,OAAO;AACL,UAAM;AAAA,MACJ,KAAK,gBAAgB,WAAW,gBAAa,gBAAgB,YAAY,eAAe,CAAC;AAAA,MACzF;AAAA,IACF;AAAA,EACF;AAEA,QAAM;AAAA,IACJ;AAAA,IACA;AAAA,IACA,KAAK,EAAE,KAAK,eAAY,EAAE,IAAI,eAAY,aAAa,IAAI;AAAA,IAC3D,iBAAiB,MAAM,oBAAiB,MAAM,mBAAgB,MAAM,iBACjE,WAAW,OAAO,mBAAgB,SAAS,MAAM,2BAA2B,MAAM,MAAM;AAAA,IAC3F,iBAAiB,UAAU,MAAM,eAAe,CAAC,eAAY,UAAU,OAAO,eAAe,CAAC;AAAA,IAC9F;AAAA,IACA;AAAA,EACF;AAEA,cAAY,QAAQ,CAAC,MAAM,MAAM;AAC/B,UAAM,KAAK,GAAG,IAAI,CAAC,OAAO,KAAK,KAAK,QAAQ,KAAK,KAAK,QAAQ;AAAA,EAChE,CAAC;AAED,QAAM,KAAK,IAAI,4DAA4D;AAC3E,MAAI,aAAa,SAAS,GAAG;AAC3B,eAAW,KAAK,cAAc;AAC5B,YAAM,WAAW,EAAE,YAAY;AAC/B,YAAM,OAAO,EAAE,QAAQ;AACvB,YAAM,QAAQ,EAAE,gBAAgB,CAAC,IAAI,EAAE;AACvC,YAAM,OAAO,EAAE,cAAc;AAC7B,YAAM,SAAS,EAAE;AACjB,YAAM,UAAU,SAAS,cAAc,UAAU,OAAO,YAAY,OAAO,QAAQ,CAAC,CAAC,KAAK;AAC1F,YAAM,SAAS,aAAa,4BAA4B,4BAA4B;AACpF,YAAM;AAAA,QACJ,OAAO,EAAE,MAAM,QAAQ,QAAQ,SAAS,EAAE,MAAM,QAAQ,OAAO,IAAI,MAAM;AAAA,QACzE,KAAK,MAAM,CAAC,CAAC,WAAM,MAAM,CAAC,CAAC,GAAG,OAAO,MAAM,IAAI,MAAM,EAAE;AAAA,MACzD;AAAA,IACF;AAAA,EACF,OAAO;AACL,UAAM,KAAK,qEAAqE;AAAA,EAClF;AAEA,QAAM,aAAc,EAAE,aAAa,YAAY,KAAwC,CAAC;AACxF,MAAI,WAAW,SAAS,GAAG;AACzB,UAAM,KAAK,IAAI,qCAAqC;AACpD,eAAW,KAAK,YAAY;AAC1B,YAAM,cAAe,EAAE,SAAsB,CAAC,GAAG,KAAK,IAAI;AAC1D,YAAM,OAAQ,EAAE,cAAyB;AACzC,YAAM,SAAS,EAAE;AACjB,YAAM,UAAU,UAAU,OAAO,GAAG,IAAI,IAAI,OAAO,QAAQ,CAAC,CAAC,KAAK;AAClE,YAAM,KAAK,OAAO,EAAE,SAAS,EAAE,MAAM,EAAE,aAAQ,UAAU,KAAK,OAAO,GAAG;AAAA,IAC1E;AAAA,EACF;AAEA,QAAM,KAAK,IAAI,gBAAgB;AAC/B,aAAW,CAAC,KAAK,KAAK,KAAK,cAAc;AACvC,UAAM,QAAQ,SAAS,IAAI,GAAG,KAAK,aAAa,GAAG;AACnD,UAAM,QAAQ,YAAY,IAAI,GAAG,KAAK;AACtC,UAAM,YAAY,MAAM,OAAO,CAAC,MAAM,CAAC,WAAW,GAAG,CAAC,CAAC;AACvD,UAAM,UAAU,UAAU,MAAM,GAAG,CAAC,EAAE,IAAI,CAAC,MAAO,EAAE,iBAAiB,GAAG,OAAO,KAAgB,CAAC;AAChG,UAAM,SAAS,UAAU,SAAS,IAAI,MAAM,UAAU,SAAS,CAAC,WAAW;AAC3E,UAAM;AAAA,MACJ;AAAA,MACA,iBAAiB,GAAG,OAAO,KAAK;AAAA,MAChC,aAAa,KAAK;AAAA,MAClB,UAAU,UAAU,MAAM,MAAM,QAAQ,KAAK,IAAI,CAAC,GAAG,MAAM;AAAA,IAC7D;AAAA,EACF;AAEA,QAAM,YAAyD,CAAC;AAChE,IAAE,YAAY,CAAC,GAAG,MAAM,GAAG,MAAM;AAC/B,QAAI,KAAK,eAAe,YAAa,WAAU,KAAK,CAAC,GAAG,GAAG,IAAI,CAAC;AAAA,EAClE,CAAC;AACD,MAAI,UAAU,SAAS,GAAG;AACxB,UAAM,KAAK,IAAI,mCAAmC;AAClD,eAAW,CAAC,GAAG,GAAG,CAAC,KAAK,WAAW;AACjC,YAAM,KAAM,EAAE,iBAAiB,GAAG,OAAO,KAAgB;AACzD,YAAM,KAAM,EAAE,iBAAiB,GAAG,OAAO,KAAgB;AACzD,YAAM;AAAA,QACJ,OAAO,EAAE,eAAU,EAAE;AAAA,QACrB,KAAK,EAAE,eAAe,EAAE,mBAAgB,EAAE,YAAY,SAAS;AAAA,MACjE;AAAA,IACF;AAAA,EACF;AAGA,QAAM,WAAW,EAAE,MAAM,EAAE;AAAA,IACzB,CAAC,MAAM,EAAE,OAAO,CAAC,KAAK,KAAK,CAAC,WAAW,GAAG,CAAC,KAAK,CAAC,cAAc,GAAG,CAAC;AAAA,EACrE;AACA,QAAM,kBAAkB,oBAAI,IAAsB;AAClD,aAAW,CAAC,KAAK,KAAK,KAAK,cAAc;AACvC,QAAI,MAAM,SAAS,EAAG,iBAAgB,IAAI,KAAK,KAAK;AAAA,EACtD;AACA,QAAM,WAAW,SAAS,SAAS,gBAAgB;AAEnD,MAAI,WAAW,KAAK,SAAS,IAAI;AAC/B,UAAM,KAAK,IAAI,mBAAmB;AAClC,QAAI,SAAS,SAAS,GAAG;AACvB,YAAM,iBAAiB,SAAS,MAAM,GAAG,CAAC,EAAE,IAAI,CAAC,MAAO,EAAE,iBAAiB,GAAG,OAAO,KAAgB,CAAC;AACtG,YAAM,SAAS,SAAS,SAAS,IAAI,MAAM,SAAS,SAAS,CAAC,WAAW;AACzE,YAAM;AAAA,QACJ,OAAO,SAAS,MAAM,wBAAwB,eAAe,IAAI,CAAC,MAAM,KAAK,CAAC,IAAI,EAAE,KAAK,IAAI,CAAC,GAAG,MAAM;AAAA,QACvG;AAAA,MACF;AAAA,IACF;AACA,QAAI,gBAAgB,OAAO,GAAG;AAC5B,iBAAW,CAAC,KAAK,KAAK,KAAK,iBAAiB;AAC1C,cAAM,QAAQ,SAAS,IAAI,GAAG,KAAK,aAAa,GAAG;AACnD,cAAM,aAAa,MAAM,IAAI,CAAC,MAAO,EAAE,iBAAiB,GAAG,OAAO,KAAgB,CAAC;AACnF,cAAM;AAAA,UACJ,wBAAwB,KAAK,SAAS,MAAM,MAAM,YAAY,WAAW,IAAI,CAAC,MAAM,KAAK,CAAC,IAAI,EAAE,KAAK,IAAI,CAAC;AAAA,UAC1G;AAAA,QACF;AAAA,MACF;AAAA,IACF;AACA,QAAI,SAAS,IAAI;AACf,YAAM,KAAK,uBAAuB,MAAM,uEAAuE;AAAA,IACjH;AAAA,EACF;AAEA,MAAI,yBAAyB,sBAAsB,SAAS,GAAG;AAC7D,UAAM,KAAK,IAAI,wBAAwB;AACvC,UAAM,WAAW,sBAAsB,WAAW,KAAK,sBAAsB,CAAC,EAAG,SAAS;AAC1F,QAAI,UAAU;AACZ,YAAM,KAAK,IAAI,sBAAsB,CAAC,EAAG,GAAG,GAAG;AAAA,IACjD,OAAO;AACL,YAAM,KAAK,4DAA4D,EAAE;AACzE,iBAAW,KAAK,uBAAuB;AACrC,YAAI,EAAE,UAAU;AACd,gBAAM,KAAK,OAAO,EAAE,QAAQ,MAAM,MAAM,EAAE,GAAG,GAAG;AAAA,QAClD;AAAA,MACF;AAAA,IACF;AAAA,EACF;AAEA,SAAO,MAAM,KAAK,IAAI;AACxB;AAjMA;AAAA;AAKA;AACA;AAAA;AAAA;;;ACgBA,eAAsB,YAAY,KAA8B;AAC9D,MAAI;AACJ,MAAI;AACF,aAAS,IAAI,oBAAI,GAAG;AAAA,EACtB,QAAQ;AACN,UAAM,IAAI,MAAM,gBAAgB,GAAG,EAAE;AAAA,EACvC;AAEA,MAAI,CAAC,gBAAgB,IAAI,OAAO,QAAQ,GAAG;AACzC,UAAM,IAAI;AAAA,MACR,uBAAuB,OAAO,QAAQ,6CAA6C,GAAG;AAAA,IACxF;AAAA,EACF;AAEA,QAAM,WAAW,OAAO;AACxB,MAAI,UAAU;AACZ,QAAI,cAAc,IAAI,SAAS,YAAY,CAAC,GAAG;AAC7C,YAAM,IAAI,MAAM,oCAAoC,QAAQ,WAAW,GAAG,EAAE;AAAA,IAC9E;AAGA,QAAI;AACF,YAAM,QAAQ,MAAU,aAAS,QAAQ,EAAE,MAAM,MAAM,CAAC,CAAa;AACrE,YAAM,SAAS,MAAU,aAAS,QAAQ,EAAE,MAAM,MAAM,CAAC,CAAa;AACtE,iBAAW,QAAQ,CAAC,GAAG,OAAO,GAAG,MAAM,GAAG;AACxC,YAAI,YAAY,IAAI,GAAG;AACrB,gBAAM,IAAI;AAAA,YACR,+BAA+B,IAAI,oBAAoB,QAAQ,YAAY,GAAG;AAAA,UAChF;AAAA,QACF;AAAA,MACF;AAAA,IACF,SAAS,GAAG;AACV,UAAI,aAAa,SAAS,EAAE,QAAQ,WAAW,SAAS,EAAG,OAAM;AAAA,IAEnE;AAAA,EACF;AAEA,SAAO;AACT;AAwBA,SAAS,YAAY,MAAuB;AAC1C,MAAQ,WAAO,IAAI,GAAG;AACpB,UAAM,QAAQ,KAAK,MAAM,GAAG,EAAE,IAAI,MAAM;AACxC,UAAM,CAAC,GAAG,CAAC,IAAI;AAEf,QAAI,MAAM,IAAK,QAAO;AACtB,QAAI,MAAM,GAAI,QAAO;AACrB,QAAI,MAAM,OAAO,MAAM,UAAa,KAAK,MAAM,KAAK,GAAI,QAAO;AAC/D,QAAI,MAAM,OAAO,MAAM,IAAK,QAAO;AACnC,QAAI,MAAM,OAAO,MAAM,IAAK,QAAO;AACnC,QAAI,MAAM,EAAG,QAAO;AACpB,WAAO;AAAA,EACT;AACA,MAAQ,WAAO,IAAI,GAAG;AACpB,UAAM,QAAQ,KAAK,YAAY;AAC/B,QAAI,UAAU,SAAS,MAAM,WAAW,OAAO,KAAK,MAAM,WAAW,IAAI,KAAK,MAAM,WAAW,IAAI,GAAG;AACpG,aAAO;AAAA,IACT;AAAA,EACF;AACA,SAAO;AACT;AAUA,eAAsB,UACpB,KACA,WAAmB,iBACnB,UAAkB,KACD;AACjB,QAAM,YAAY,GAAG;AAErB,QAAM,aAAa,IAAI,gBAAgB;AACvC,QAAM,QAAQ,WAAW,MAAM,WAAW,MAAM,GAAG,OAAO;AAE1D,MAAI;AACF,UAAM,OAAO,MAAM,MAAM,KAAK;AAAA,MAC5B,QAAQ,WAAW;AAAA,MACnB,SAAS,EAAE,cAAc,2BAA2B;AAAA,MACpD,UAAU;AAAA,IACZ,CAAC;AAED,QAAI,CAAC,KAAK,IAAI;AACZ,YAAM,IAAI,MAAM,QAAQ,KAAK,MAAM,aAAa,GAAG,EAAE;AAAA,IACvD;AAGA,QAAI,KAAK,QAAQ,KAAK;AACpB,YAAM,YAAY,KAAK,GAAG;AAAA,IAC5B;AAEA,UAAM,SAAS,KAAK,MAAM,UAAU;AACpC,QAAI,CAAC,OAAQ,OAAM,IAAI,MAAM,kBAAkB;AAE/C,UAAM,SAAuB,CAAC;AAC9B,QAAI,QAAQ;AAEZ,WAAO,MAAM;AACX,YAAM,EAAE,MAAM,MAAM,IAAI,MAAM,OAAO,KAAK;AAC1C,UAAI,KAAM;AACV,eAAS,MAAM;AACf,UAAI,QAAQ,UAAU;AACpB,eAAO,OAAO;AACd,cAAM,IAAI;AAAA,UACR,iBAAiB,GAAG,wBAAwB,KAAK,MAAM,WAAW,OAAS,CAAC;AAAA,QAC9E;AAAA,MACF;AACA,aAAO,KAAK,KAAK;AAAA,IACnB;AAEA,WAAO,OAAO,OAAO,MAAM;AAAA,EAC7B,UAAE;AACA,iBAAa,KAAK;AAAA,EACpB;AACF;AAGA,eAAsB,cACpB,KACA,WAAmB,gBACnB,UAAkB,MACD;AACjB,QAAM,MAAM,MAAM,UAAU,KAAK,UAAU,OAAO;AAClD,SAAO,IAAI,SAAS,OAAO;AAC7B;AAUO,SAAS,kBAAkB,UAAkB,MAAuB;AACzE,QAAM,mBAAe,iBAAAC,SAAY,QAAQ,cAAc;AAEvD,MAAI,KAAC,2BAAW,YAAY,GAAG;AAC7B,UAAM,IAAI;AAAA,MACR,wCAAwC,YAAY;AAAA,IACtD;AAAA,EACF;AAEA,QAAM,eAAW,iBAAAA,SAAY,QAAQ;AAErC,MAAI,CAAC,SAAS,WAAW,eAAe,GAAG,KAAK,aAAa,cAAc;AACzE,UAAM,IAAI;AAAA,MACR,SAAS,QAAQ,mCAAmC,YAAY;AAAA,IAClE;AAAA,EACF;AAEA,MAAI,KAAC,2BAAW,QAAQ,GAAG;AACzB,UAAM,IAAI,MAAM,yBAAyB,QAAQ,EAAE;AAAA,EACrD;AAEA,SAAO;AACT;AAUO,SAAS,cAAc,MAAsB;AAClD,MAAI,UAAU,KAAK,QAAQ,iBAAiB,EAAE;AAC9C,MAAI,QAAQ,SAAS,eAAe;AAClC,cAAU,QAAQ,MAAM,GAAG,aAAa;AAAA,EAC1C;AACA,SAAO;AACT;AAGO,SAAS,WAAW,MAAsB;AAC/C,SAAO,KACJ,QAAQ,MAAM,OAAO,EACrB,QAAQ,MAAM,MAAM,EACpB,QAAQ,MAAM,MAAM,EACpB,QAAQ,MAAM,QAAQ,EACtB,QAAQ,MAAM,OAAO;AAC1B;AAvOA,IAGA,kBACA,gBACA,iBACA,KACA,KAEM,iBACA,iBACA,gBACA,eAuMA,iBACA;AApNN;AAAA;AAGA,uBAAuC;AACvC,qBAA2B;AAC3B,sBAAoB;AACpB,UAAqB;AACrB,UAAqB;AAErB,IAAM,kBAAkB,oBAAI,IAAI,CAAC,SAAS,QAAQ,CAAC;AACnD,IAAM,kBAAkB;AACxB,IAAM,iBAAiB;AACvB,IAAM,gBAAgB,oBAAI,IAAI,CAAC,4BAA4B,qBAAqB,CAAC;AAuMjF,IAAM,kBAAkB;AACxB,IAAM,gBAAgB;AAAA;AAAA;;;ACpNtB;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AA8CA,SAASC,kBAAiB,aAA4D;AACpF,QAAM,eAAe,aAAa,WAAW;AAC7C,QAAM,SAAS,oBAAI,IAAoB;AACvC,aAAW,CAAC,KAAK,KAAK,KAAK,cAAc;AACvC,eAAW,KAAK,MAAO,QAAO,IAAI,GAAG,GAAG;AAAA,EAC1C;AACA,SAAO;AACT;AAEA,SAAS,aAAa,GAAmB;AACvC,SAAO,EAAE,QAAQ,OAAO,MAAM,EAAE,QAAQ,MAAM,KAAK;AACrD;AAEA,SAAS,wBACP,OACgC;AAChC,SAAO,EAAE,iBAAiB,QAAQ,OAAO,UAAU,eAAe,KAAK,OAAO,iBAAiB;AACjG;AAEA,SAAS,gBACP,OACwB;AACxB,SAAO,EAAE,iBAAiB,SACxB,OAAO,UAAU,eAAe,KAAK,OAAO,iBAAiB,KAC7D,OAAO,UAAU,eAAe,KAAK,OAAO,eAAe;AAE/D;AAEA,SAAS,aACP,OACqB;AACrB,SAAO,EAAE,iBAAiB,SACxB,OAAO,UAAU,eAAe,KAAK,OAAO,iBAAiB,KAC7D,OAAO,UAAU,eAAe,KAAK,OAAO,SAAS;AAEzD;AAEA,SAAS,yBACP,iBACiC;AACjC,MAAI,CAAC,gBAAiB,QAAO;AAC7B,MAAI,CAAC,wBAAwB,eAAe,GAAG;AAC7C,WAAO,aAAa,eAAuC;AAAA,EAC7D;AACA,SAAO,aAAa,gBAAgB,eAAe;AACrD;AAMO,SAAS,OACd,GACA,aACA,YACM;AACN,QAAM,WAAWA,kBAAiB,WAAW;AAE7C,QAAM,QAAmC,CAAC;AAC1C,IAAE,YAAY,CAAC,QAAQ,UAAU;AAC/B,UAAM,KAAK;AAAA,MACT,IAAI;AAAA,MACJ,GAAG;AAAA,MACH,WAAW,SAAS,IAAI,MAAM,KAAK;AAAA,IACrC,CAAC;AAAA,EACH,CAAC;AAED,QAAM,QAAmC,CAAC;AAC1C,IAAE,YAAY,CAAC,OAAO,MAAM,QAAQ,WAAW;AAC7C,UAAM,OAAgC;AAAA,MACpC;AAAA,MACA;AAAA,MACA,GAAG;AAAA,IACL;AACA,QAAI,KAAK,qBAAqB,QAAW;AACvC,YAAM,OAAQ,KAAK,cAAyB;AAC5C,WAAK,mBAAmB,0BAA0B,IAAI,KAAK;AAAA,IAC7D;AACA,UAAM,KAAK,IAAI;AAAA,EACjB,CAAC;AAED,QAAM,aAAc,EAAE,aAAa,YAAY,KAAiC,CAAC;AAEjF,QAAM,SAAS;AAAA,IACb,UAAU;AAAA,IACV,YAAY;AAAA,IACZ,OAAO,CAAC;AAAA,IACR;AAAA,IACA;AAAA,IACA;AAAA,EACF;AAEA,qCAAc,YAAY,KAAK,UAAU,QAAQ,MAAM,CAAC,GAAG,OAAO;AACpE;AAMO,SAAS,SAAS,GAAU,YAA0B;AAC3D,QAAM,QAAkB,CAAC,4DAA4D,EAAE;AAEvF,IAAE,YAAY,CAAC,QAAQ,SAAS;AAC9B,UAAM,QAAQ,aAAc,KAAK,SAAoB,MAAM;AAC3D,UAAM,YAAY,aAAa,MAAM;AACrC,UAAM,SAAU,KAAK,aAAwB,WAC1C,OAAO,CAAC,EAAE,YAAY,KAAM,KAAK,aAAwB,WAAW,MAAM,CAAC;AAC9E,UAAM,UAAU,MAAM,QAAQ,kBAAkB,EAAE;AAClD,UAAM,QAAQ,WAAW,YAAY,KAAK,OAAO,IAAI,UAAU;AAC/D,UAAM,KAAK,YAAY,KAAK,UAAU,SAAS,cAAc,KAAK,MAAM;AAAA,EAC1E,CAAC;AAED,QAAM,KAAK,EAAE;AAEb,IAAE,YAAY,CAAC,OAAO,MAAM,GAAG,MAAM;AACnC,UAAM,OAAQ,KAAK,YAAuB,cACvC,YAAY,EACZ,QAAQ,kBAAkB,GAAG;AAChC,UAAM,OAAO,aAAc,KAAK,cAAyB,WAAW;AACpE,UAAM,OAAO,aAAa,CAAC;AAC3B,UAAM,OAAO,aAAa,CAAC;AAC3B,UAAM;AAAA,MACJ,kBAAkB,IAAI,iBAAiB,IAAI,mBAC5B,GAAG,kBAAkB,IAAI;AAAA,IAC1C;AAAA,EACF,CAAC;AAED,qCAAc,YAAY,MAAM,KAAK,IAAI,GAAG,OAAO;AACrD;AAEA,SAAS,WAAW,OAAuB;AACzC,QAAM,YAAY,MAAM,QAAQ,kBAAkB,EAAE;AACpD,SAAO,aAAa;AACtB;AAEA,SAAS,cAAc,UAA0B;AAC/C,QAAM,YAAY,SACf,YAAY,EACZ,QAAQ,WAAW,GAAG,EACtB,QAAQ,eAAe,GAAG;AAC7B,SAAO,aAAa;AACtB;AAEA,SAAS,YAAY,MAA0E;AAC7F,QAAM,QAAmD,CAAC;AAC1D,aAAW,CAAC,KAAK,KAAK,KAAK,OAAO,QAAQ,IAAI,GAAG;AAC/C,QACE,OAAO,UAAU,YACjB,OAAO,UAAU,YACjB,OAAO,UAAU,WACjB;AACA,YAAM,GAAG,IAAI;AAAA,IACf;AAAA,EACF;AACA,SAAO;AACT;AAEA,eAAsB,YACpB,GACA,cACA,MACA,UACA,aAC2C;AAC3C,QAAM,UAAU,OAAO,iBAAiB,WACpC;AAAA,IACA,KAAK;AAAA,IACL,MAAM,QAAQ;AAAA,IACd,UAAU,YAAY;AAAA,IACtB;AAAA,EACF,IACE;AAEJ,MAAI;AACJ,MAAI;AACF,eAAW,MAAM,OAAO,cAAc;AAAA,EACxC,QAAQ;AACN,UAAM,IAAI,MAAM,2DAA2D;AAAA,EAC7E;AAEA,QAAM,QAAQ,SAAS,WAAW;AAClC,QAAM,SAAS,MAAM;AAAA,IACnB,QAAQ;AAAA,IACR,MAAM,KAAK,MAAM,QAAQ,MAAM,QAAQ,QAAQ;AAAA,EACjD;AACA,QAAM,eAAeA,kBAAiB,QAAQ,eAAe,oBAAI,IAAsB,CAAC;AAExF,MAAI,QAAQ;AACZ,MAAI,QAAQ;AACZ,QAAM,UAAU,OAAO,QAAQ;AAE/B,MAAI;AACF,eAAW,UAAU,EAAE,MAAM,GAAG;AAC9B,YAAM,QAAQ,EAAE,kBAAkB,MAAM;AACxC,YAAM,QAAQ,YAAY,KAAK;AAC/B,YAAM,KAAK;AAEX,YAAM,cAAc,aAAa,IAAI,MAAM;AAC3C,UAAI,gBAAgB,QAAW;AAC7B,cAAM,YAAY;AAAA,MACpB;AAEA,YAAM,WAAW;AAAA,SACZ,MAAM,aAAwB,UAAU,OAAO,CAAC,EAAE,YAAY,KAC9D,MAAM,aAAwB,UAAU,MAAM,CAAC;AAAA,MACpD;AAEA,YAAM,QAAQ;AAAA,QACZ,YAAY,QAAQ;AAAA,QACpB,EAAE,IAAI,QAAQ,MAAM;AAAA,MACtB;AACA;AAAA,IACF;AAEA,eAAW,WAAW,EAAE,MAAM,GAAG;AAC/B,YAAM,SAAS,EAAE,OAAO,OAAO;AAC/B,YAAM,SAAS,EAAE,OAAO,OAAO;AAC/B,YAAM,QAAQ,EAAE,kBAAkB,OAAO;AACzC,YAAM,WAAW,cAAe,MAAM,YAAuB,YAAY;AACzE,YAAM,QAAQ,YAAY,KAAK;AAE/B,YAAM,QAAQ;AAAA,QACZ,2DACgB,QAAQ;AAAA,QACxB,EAAE,QAAQ,QAAQ,MAAM;AAAA,MAC1B;AACA;AAAA,IACF;AAAA,EACF,UAAE;AACA,UAAM,QAAQ,MAAM;AACpB,UAAM,OAAO,MAAM;AAAA,EACrB;AAEA,SAAO,EAAE,OAAO,MAAM;AACxB;AAMA,SAAS,aAAqB;AAC5B,SAAO;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AA8BT;AAEA,SAAS,gBAAgB,gBAAgC;AACvD,SAAO;AAAA;AAAA,qBAEY,cAAc;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AA+CnC;AAEA,SAAS,WAAW,WAAmB,WAAmB,YAA4B;AACpF,SAAO;AAAA,oBACW,SAAS;AAAA,oBACT,SAAS;AAAA,iBACZ,UAAU;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAsI3B;AAEO,SAAS,OACd,GACA,aACA,YACA,0BACM;AACN,QAAM,eAAe,aAAa,WAAW;AAC7C,QAAM,kBAAkB,yBAAyB,wBAAwB;AACzE,MAAI,EAAE,QAAQ,mBAAmB;AAC/B,UAAM,IAAI;AAAA,MACR,aAAa,EAAE,KAAK;AAAA,IAEtB;AAAA,EACF;AAEA,QAAM,WAAWA,kBAAiB,YAAY;AAC9C,QAAM,SAAS,oBAAI,IAAoB;AACvC,IAAE,YAAY,CAAC,MAAM,OAAO,IAAI,GAAG,EAAE,OAAO,CAAC,CAAC,CAAC;AAC/C,QAAM,SAAS,KAAK,IAAI,GAAG,GAAG,OAAO,OAAO,CAAC;AAgB7C,QAAM,WAAsB,CAAC;AAC7B,IAAE,YAAY,CAAC,QAAQ,SAAS;AAC9B,UAAM,MAAM,SAAS,IAAI,MAAM,KAAK;AACpC,UAAM,QAAQ,iBAAiB,MAAM,iBAAiB,MAAM;AAC5D,UAAM,QAAQ,cAAe,KAAK,SAAoB,MAAM;AAC5D,UAAM,MAAM,OAAO,IAAI,MAAM,KAAK;AAClC,UAAM,OAAO,KAAK,MAAM,MAAM;AAC9B,UAAM,WAAW,OAAO,SAAS,OAAO,KAAK;AAC7C,aAAS,KAAK;AAAA,MACZ,IAAI;AAAA,MACJ;AAAA,MACA,OAAO;AAAA,QACL,YAAY;AAAA,QACZ,QAAQ;AAAA,QACR,WAAW,EAAE,YAAY,WAAW,QAAQ,MAAM;AAAA,MACpD;AAAA,MACA,MAAM,KAAK,MAAM,OAAO,EAAE,IAAI;AAAA,MAC9B,MAAM,EAAE,MAAM,UAAU,OAAO,UAAU;AAAA,MACzC,OAAO;AAAA,MACP,WAAW;AAAA,MACX,gBAAgB,cAAc,iBAAiB,IAAI,GAAG,KAAK,aAAa,GAAG,EAAE;AAAA,MAC7E,aAAa,cAAe,KAAK,eAA0B,EAAE;AAAA,MAC7D,WAAY,KAAK,aAAwB;AAAA,MACzC,QAAQ;AAAA,IACV,CAAC;AAAA,EACH,CAAC;AAaD,QAAM,WAAsB,CAAC;AAC7B,IAAE,YAAY,CAAC,OAAO,MAAM,GAAG,MAAM;AACnC,UAAM,aAAc,KAAK,cAAyB;AAClD,UAAM,WAAY,KAAK,YAAuB;AAC9C,aAAS,KAAK;AAAA,MACZ,MAAM;AAAA,MACN,IAAI;AAAA,MACJ,OAAO;AAAA,MACP,OAAO,GAAG,QAAQ,KAAK,UAAU;AAAA,MACjC,QAAQ,eAAe;AAAA,MACvB,OAAO,eAAe,cAAc,IAAI;AAAA,MACxC,OAAO,EAAE,SAAS,eAAe,cAAc,MAAM,KAAK;AAAA,MAC1D;AAAA,IACF,CAAC;AAAA,EACH,CAAC;AASD,QAAM,aAA4B,CAAC;AACnC,QAAM,YAAY,kBAAkB,CAAC,GAAG,gBAAgB,KAAK,CAAC,EAAE,KAAK,CAAC,GAAG,MAAM,IAAI,CAAC,IAAI,CAAC;AACzF,aAAW,OAAO,WAAW;AAC3B,UAAM,QAAQ,iBAAiB,MAAM,iBAAiB,MAAM;AAC5D,UAAM,MAAM,WAAW,cAAc,iBAAiB,IAAI,GAAG,KAAK,aAAa,GAAG,EAAE,CAAC;AACrF,UAAM,IAAI,aAAa,IAAI,GAAG,GAAG,UAAU;AAC3C,eAAW,KAAK,EAAE,KAAK,OAAO,OAAO,KAAK,OAAO,EAAE,CAAC;AAAA,EACtD;AAEA,QAAM,YAAY,KAAK,UAAU,QAAQ;AACzC,QAAM,YAAY,KAAK,UAAU,QAAQ;AACzC,QAAM,aAAa,KAAK,UAAU,UAAU;AAC5C,QAAM,gBAAiB,EAAE,aAAa,YAAY,KAAiC,CAAC;AACpF,QAAM,iBAAiB,KAAK,UAAU,aAAa;AACnD,QAAM,QAAQ,WAAW,cAAc,UAAU,CAAC;AAClD,QAAM,QACJ,GAAG,EAAE,KAAK,mBAAmB,EAAE,IAAI,mBAAmB,aAAa,IAAI;AAEzE,QAAM,OAAO;AAAA;AAAA;AAAA;AAAA,oBAIK,KAAK;AAAA;AAAA,EAEvB,WAAW,CAAC;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,oBAiBM,KAAK;AAAA;AAAA,EAEvB,WAAW,WAAW,WAAW,UAAU,CAAC;AAAA,EAC5C,gBAAgB,cAAc,CAAC;AAAA;AAAA;AAI/B,qCAAc,YAAY,MAAM,OAAO;AACzC;AAMO,SAAS,UACd,GACA,aACA,YACM;AACN,QAAM,WAAWA,kBAAiB,WAAW;AAE7C,QAAM,SAAS,CAAC,MACd,EACG,QAAQ,MAAM,OAAO,EACrB,QAAQ,MAAM,MAAM,EACpB,QAAQ,MAAM,MAAM,EACpB,QAAQ,MAAM,QAAQ,EACtB,QAAQ,MAAM,QAAQ;AAE3B,QAAM,QAAkB,CAAC;AACzB,QAAM,KAAK,wCAAwC;AACnD,QAAM;AAAA,IACJ;AAAA,EAIF;AAGA,QAAM,KAAK,qEAAqE;AAChF,QAAM,KAAK,6EAA6E;AACxF,QAAM,KAAK,iFAAiF;AAC5F,QAAM,KAAK,0EAA0E;AACrF,QAAM,KAAK,2EAA2E;AACtF,QAAM,KAAK,+EAA+E;AAE1F,QAAM,KAAK,2CAA2C;AAEtD,IAAE,YAAY,CAAC,QAAQ,SAAS;AAC9B,UAAM,KAAK,iBAAiB,OAAO,MAAM,CAAC,IAAI;AAC9C,UAAM,KAAK,2BAA2B,OAAQ,KAAK,SAAoB,MAAM,CAAC,SAAS;AACvF,UAAM,KAAK,+BAA+B,OAAQ,KAAK,aAAwB,EAAE,CAAC,SAAS;AAC3F,UAAM,KAAK,iCAAiC,OAAQ,KAAK,eAA0B,EAAE,CAAC,SAAS;AAC/F,UAAM,KAAK,+BAA+B,SAAS,IAAI,MAAM,KAAK,EAAE,SAAS;AAC7E,UAAM,KAAK,aAAa;AAAA,EAC1B,CAAC;AAED,IAAE,YAAY,CAAC,OAAO,MAAM,QAAQ,WAAW;AAC7C,UAAM,KAAK,qBAAqB,OAAO,MAAM,CAAC,aAAa,OAAO,MAAM,CAAC,IAAI;AAC7E,UAAM,KAAK,8BAA8B,OAAQ,KAAK,YAAuB,EAAE,CAAC,SAAS;AACzF,UAAM,KAAK,gCAAgC,OAAQ,KAAK,cAAyB,WAAW,CAAC,SAAS;AACtG,UAAM,KAAK,aAAa;AAAA,EAC1B,CAAC;AAED,QAAM,KAAK,YAAY;AACvB,QAAM,KAAK,YAAY;AAEvB,qCAAc,YAAY,MAAM,KAAK,IAAI,GAAG,OAAO;AACrD;AAMO,SAAS,MACd,GACA,aACA,YACA,0BACA,UAA4B,CAAC,IAAI,EAAE,GAC7B;AACN,QAAM,eAAe,aAAa,WAAW;AAC7C,QAAM,UAAU,4BAA4B,aAAa,wBAAwB,IAC7E,2BACA;AACJ,QAAM,kBAAkB,yBAAyB,wBAAwB;AACzE,QAAM,WAAWA,kBAAiB,YAAY;AAC9C,QAAM,aAAa,SAAS,WAAW;AACvC,QAAM,CAAC,SAAS,QAAQ,IAAI;AAC5B,QAAM,QAAQ,UAAU;AACxB,QAAM,SAAS,WAAW;AAC1B,QAAM,KAAK,QAAQ;AACnB,QAAM,KAAK,SAAS;AACpB,QAAM,SAAS,KAAK,IAAI,IAAI,EAAE,IAAI;AAElC,QAAM,WAAW,EAAE,MAAM;AACzB,QAAM,IAAI,SAAS;AAGnB,QAAM,MAAM,oBAAI,IAA8B;AAC9C,WAAS,IAAI,GAAG,IAAI,GAAG,KAAK;AAC1B,UAAM,QAAS,IAAI,KAAK,KAAK,IAAK,KAAK,IAAI,GAAG,CAAC;AAC/C,QAAI,IAAI,SAAS,CAAC,GAAI;AAAA,MACpB,KAAK,SAAS,KAAK,IAAI,KAAK;AAAA,MAC5B,KAAK,SAAS,KAAK,IAAI,KAAK;AAAA,IAC9B,CAAC;AAAA,EACH;AAEA,QAAM,SAAS,oBAAI,IAAoB;AACvC,IAAE,YAAY,CAAC,SAAS,OAAO,IAAI,MAAM,EAAE,OAAO,IAAI,CAAC,CAAC;AACxD,QAAM,SAAS,KAAK,IAAI,GAAG,GAAG,OAAO,OAAO,CAAC;AAE7C,QAAM,SAAS,CAAC,MACd,EACG,QAAQ,MAAM,OAAO,EACrB,QAAQ,MAAM,MAAM,EACpB,QAAQ,MAAM,MAAM,EACpB,QAAQ,MAAM,QAAQ;AAE3B,QAAM,WAAqB,CAAC;AAC5B,WAAS;AAAA,IACP,wDAAwD,KAAK,IAAI,MAAM,YAC7D,KAAK,aAAa,MAAM;AAAA,EACpC;AAGA,IAAE,YAAY,CAAC,OAAO,MAAM,GAAG,MAAM;AACnC,UAAM,CAAC,IAAI,EAAE,IAAI,IAAI,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC;AACpC,UAAM,CAAC,IAAI,EAAE,IAAI,IAAI,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC;AACpC,UAAM,OAAQ,KAAK,cAAyB;AAC5C,UAAM,YAAY,SAAS,cAAc,KAAK;AAC9C,UAAM,UAAU,SAAS,cAAc,MAAM;AAC7C,aAAS;AAAA,MACP,eAAe,EAAE,SAAS,EAAE,SAAS,EAAE,SAAS,EAAE,kDACF,OAAO,IAAI,SAAS;AAAA,IACtE;AAAA,EACF,CAAC;AAGD,aAAW,UAAU,UAAU;AAC7B,UAAM,CAAC,GAAG,CAAC,IAAI,IAAI,IAAI,MAAM,KAAK,CAAC,GAAG,CAAC;AACvC,UAAM,MAAM,SAAS,IAAI,MAAM,KAAK;AACpC,UAAM,QAAQ,iBAAiB,MAAM,iBAAiB,MAAM;AAC5D,UAAM,MAAM,OAAO,IAAI,MAAM,KAAK;AAClC,UAAM,IAAI,IAAI,MAAM,MAAM;AAC1B,aAAS;AAAA,MACP,iBAAiB,CAAC,SAAS,CAAC,QAAQ,CAAC,WAAW,KAAK;AAAA,IACvD;AACA,UAAM,QAAS,EAAE,iBAAiB,QAAQ,OAAO,KAAgB;AACjE,aAAS;AAAA,MACP,cAAc,CAAC,QAAQ,IAAI,IAAI,EAAE,8EACsB,OAAO,KAAK,CAAC;AAAA,IACtE;AAAA,EACF;AAGA,MAAI,iBAAiB;AACnB,UAAM,aAAa,CAAC,GAAG,gBAAgB,KAAK,CAAC,EAAE,KAAK,CAAC,GAAG,MAAM,IAAI,CAAC;AACnE,QAAI,KAAK;AACT,eAAW,OAAO,YAAY;AAC5B,YAAM,QAAQ,iBAAiB,MAAM,iBAAiB,MAAM;AAC5D,YAAM,QAAQ,gBAAgB,IAAI,GAAG,KAAK,aAAa,GAAG;AAC1D,YAAM,QAAQ,aAAa,IAAI,GAAG,GAAG,UAAU;AAC/C,eAAS;AAAA,QACP,yBAAyB,EAAE,iBAAiB,KAAK;AAAA,MACnD;AACA,eAAS;AAAA,QACP,qBAAqB,KAAK,CAAC,yDACC,OAAO,KAAK,CAAC,KAAK,KAAK;AAAA,MACrD;AACA,YAAM;AAAA,IACR;AAAA,EACF;AAEA,WAAS,KAAK,QAAQ;AACtB,qCAAc,YAAY,SAAS,KAAK,IAAI,GAAG,OAAO;AACxD;AAMO,SAAS,SACd,GACA,aACA,YACA,0BACA,eACM;AACN,QAAM,eAAe,aAAa,WAAW;AAC7C,QAAM,UAAU,4BAA4B,gBAAgB,wBAAwB,IAChF,2BACA;AACJ,QAAM,kBAAkB,yBAAyB,wBAAwB;AACzE,QAAM,wBAAwB,SAAS,iBAAiB;AACxD,QAAM,gBAAgB,CAAC,KAAK,KAAK,KAAK,KAAK,KAAK,GAAG;AAEnD,WAAS,SAAS,OAAuB;AACvC,WAAO,MAAM,QAAQ,sBAAsB,EAAE,EAAE,KAAK,KAAK;AAAA,EAC3D;AAGA,MAAI;AACJ,MAAI,CAAC,uBAAuB;AAC1B,kBAAc,oBAAI,IAAoB;AACtC,UAAM,YAAY,oBAAI,IAAoB;AAC1C,MAAE,YAAY,CAAC,QAAQ,SAAS;AAC9B,YAAM,OAAO,SAAU,KAAK,SAAoB,MAAM;AACtD,YAAM,QAAQ,UAAU,IAAI,IAAI;AAChC,UAAI,UAAU,QAAW;AACvB,cAAM,OAAO,QAAQ;AACrB,kBAAU,IAAI,MAAM,IAAI;AACxB,oBAAY,IAAI,QAAQ,GAAG,IAAI,IAAI,IAAI,EAAE;AAAA,MAC3C,OAAO;AACL,kBAAU,IAAI,MAAM,CAAC;AACrB,oBAAY,IAAI,QAAQ,IAAI;AAAA,MAC9B;AAAA,IACF,CAAC;AAAA,EACH,OAAO;AACL,kBAAc,YAAY,qBAAqB;AAAA,EACjD;AAEA,QAAM,iBAAiB,aAAa;AACpC,QAAM,OAAO,iBAAiB,IAAI,KAAK,KAAK,KAAK,KAAK,cAAc,CAAC,IAAI;AACzE,QAAM,OAAO,iBAAiB,IAAI,KAAK,KAAK,iBAAiB,IAAI,IAAI;AAErE,QAAM,cAAyC,CAAC;AAChD,QAAM,cAAyC,CAAC;AAEhD,QAAM,aAAa,CAAC,GAAG,aAAa,KAAK,CAAC,EAAE,KAAK,CAAC,GAAG,MAAM,IAAI,CAAC;AAGhE,QAAM,aAAa,oBAAI,IAA8B;AACrD,aAAW,OAAO,YAAY;AAC5B,UAAM,UAAU,aAAa,IAAI,GAAG,KAAK,CAAC;AAC1C,UAAM,cAAc,QAAQ;AAC5B,UAAM,IAAI,KAAK,IAAI,KAAK,cAAc,IAAI,MAAM,KAAK,KAAK,KAAK,KAAK,WAAW,CAAC,IAAI,GAAG;AACvF,UAAM,IAAI,KAAK,IAAI,KAAK,cAAc,IAAI,MAAM,KAAK,KAAK,cAAc,CAAC,IAAI,MAAM,GAAG;AACtF,eAAW,IAAI,KAAK,CAAC,GAAG,CAAC,CAAC;AAAA,EAC5B;AAGA,QAAM,MAAM;AACZ,QAAM,YAAsB,CAAC;AAC7B,WAAS,SAAS,GAAG,SAAS,MAAM,UAAU;AAC5C,QAAI,OAAO;AACX,aAAS,SAAS,GAAG,SAAS,MAAM,UAAU;AAC5C,YAAM,SAAS,SAAS,OAAO;AAC/B,UAAI,SAAS,WAAW,QAAQ;AAC9B,cAAM,MAAM,WAAW,MAAM;AAC7B,cAAM,CAAC,CAAC,IAAI,WAAW,IAAI,GAAG,KAAK,CAAC,KAAK,GAAG;AAC5C,eAAO,KAAK,IAAI,MAAM,CAAC;AAAA,MACzB;AAAA,IACF;AACA,cAAU,KAAK,IAAI;AAAA,EACrB;AAEA,QAAM,aAAuB,CAAC;AAC9B,WAAS,SAAS,GAAG,SAAS,MAAM,UAAU;AAC5C,QAAI,OAAO;AACX,aAAS,SAAS,GAAG,SAAS,MAAM,UAAU;AAC5C,YAAM,SAAS,SAAS,OAAO;AAC/B,UAAI,SAAS,WAAW,QAAQ;AAC9B,cAAM,MAAM,WAAW,MAAM;AAC7B,cAAM,CAAC,EAAE,CAAC,IAAI,WAAW,IAAI,GAAG,KAAK,CAAC,KAAK,GAAG;AAC9C,eAAO,KAAK,IAAI,MAAM,CAAC;AAAA,MACzB;AAAA,IACF;AACA,eAAW,KAAK,IAAI;AAAA,EACtB;AAGA,QAAM,cAAc,oBAAI,IAA8C;AACtE,WAAS,MAAM,GAAG,MAAM,WAAW,QAAQ,OAAO;AAChD,UAAM,MAAM,WAAW,GAAG;AAC1B,UAAM,SAAS,MAAM;AACrB,UAAM,SAAS,KAAK,MAAM,MAAM,IAAI;AACpC,UAAM,KAAK,UAAU,MAAM,GAAG,MAAM,EAAE,OAAO,CAAC,GAAG,MAAM,IAAI,GAAG,CAAC,IAAI,SAAS;AAC5E,UAAM,KAAK,WAAW,MAAM,GAAG,MAAM,EAAE,OAAO,CAAC,GAAG,MAAM,IAAI,GAAG,CAAC,IAAI,SAAS;AAC7E,UAAM,CAAC,IAAI,EAAE,IAAI,WAAW,IAAI,GAAG,KAAK,CAAC,KAAK,GAAG;AACjD,gBAAY,IAAI,KAAK,CAAC,IAAI,IAAI,IAAI,EAAE,CAAC;AAAA,EACvC;AAGA,QAAM,mBAAmB,oBAAI,IAAY;AACzC,aAAW,WAAW,aAAa,OAAO,GAAG;AAC3C,eAAW,KAAK,QAAS,kBAAiB,IAAI,CAAC;AAAA,EACjD;AAGA,WAAS,MAAM,GAAG,MAAM,WAAW,QAAQ,OAAO;AAChD,UAAM,MAAM,WAAW,GAAG;AAC1B,UAAM,UAAU,aAAa,IAAI,GAAG,KAAK,CAAC;AAC1C,UAAM,gBAAgB,iBAAiB,IAAI,GAAG,KAAK,aAAa,GAAG;AACnE,UAAM,CAAC,IAAI,IAAI,IAAI,EAAE,IAAI,YAAY,IAAI,GAAG,KAAK,CAAC,GAAG,GAAG,KAAK,GAAG;AAChE,UAAM,cAAc,cAAc,MAAM,cAAc,MAAM;AAG5D,gBAAY,KAAK;AAAA,MACf,IAAI,IAAI,GAAG;AAAA,MACX,MAAM;AAAA,MACN,OAAO;AAAA,MACP,GAAG;AAAA,MACH,GAAG;AAAA,MACH,OAAO;AAAA,MACP,QAAQ;AAAA,MACR,OAAO;AAAA,IACT,CAAC;AAGD,UAAM,gBAAgB,CAAC,GAAG,OAAO,EAAE,KAAK,CAAC,GAAG,MAAM;AAChD,YAAM,KAAM,EAAE,iBAAiB,GAAG,OAAO,KAAgB;AACzD,YAAM,KAAM,EAAE,iBAAiB,GAAG,OAAO,KAAgB;AACzD,aAAO,GAAG,cAAc,EAAE;AAAA,IAC5B,CAAC;AACD,aAAS,OAAO,GAAG,OAAO,cAAc,QAAQ,QAAQ;AACtD,YAAM,SAAS,cAAc,IAAI;AACjC,YAAM,MAAM,OAAO;AACnB,YAAM,MAAM,KAAK,MAAM,OAAO,CAAC;AAC/B,YAAM,KAAK,KAAK,KAAK,OAAO,MAAM;AAClC,YAAM,KAAK,KAAK,KAAK,OAAO,KAAK;AACjC,YAAM,QACJ,YAAY,IAAI,MAAM,KACtB,SAAU,EAAE,iBAAiB,QAAQ,OAAO,KAAgB,MAAM;AACpE,kBAAY,KAAK;AAAA,QACf,IAAI,KAAK,MAAM;AAAA,QACf,MAAM;AAAA,QACN,MAAM,qBAAqB,KAAK;AAAA,QAChC,GAAG;AAAA,QACH,GAAG;AAAA,QACH,OAAO;AAAA,QACP,QAAQ;AAAA,MACV,CAAC;AAAA,IACH;AAAA,EACF;AAGA,QAAM,mBAAuD,CAAC;AAC9D,IAAE,YAAY,CAAC,OAAO,OAAO,GAAG,MAAM;AACpC,QAAI,iBAAiB,IAAI,CAAC,KAAK,iBAAiB,IAAI,CAAC,GAAG;AACtD,YAAM,SAAU,MAAM,UAAqB;AAC3C,YAAM,WAAY,MAAM,YAAuB;AAC/C,YAAM,OAAQ,MAAM,cAAyB;AAC7C,YAAM,QAAQ,WAAW,GAAG,QAAQ,KAAK,IAAI,MAAM,IAAI,IAAI;AAC3D,uBAAiB,KAAK,CAAC,QAAQ,GAAG,GAAG,KAAK,CAAC;AAAA,IAC7C;AAAA,EACF,CAAC;AAED,mBAAiB,KAAK,CAAC,GAAG,MAAM,EAAE,CAAC,IAAI,EAAE,CAAC,CAAC;AAC3C,aAAW,CAAC,EAAE,GAAG,GAAG,KAAK,KAAK,iBAAiB,MAAM,GAAG,GAAG,GAAG;AAC5D,gBAAY,KAAK;AAAA,MACf,IAAI,KAAK,CAAC,IAAI,CAAC;AAAA,MACf,UAAU,KAAK,CAAC;AAAA,MAChB,QAAQ,KAAK,CAAC;AAAA,MACd;AAAA,IACF,CAAC;AAAA,EACH;AAEA,QAAM,aAAa,EAAE,OAAO,aAAa,OAAO,YAAY;AAC5D,qCAAc,YAAY,KAAK,UAAU,YAAY,MAAM,CAAC,GAAG,OAAO;AACxE;AA/+BA,IAGAC,iBAeM,kBAKA,mBAEA;AAzBN;AAAA;AAGA,IAAAA,kBAA8B;AAE9B;AAEA;AAWA,IAAM,mBAAmB;AAAA,MACvB;AAAA,MAAW;AAAA,MAAW;AAAA,MAAW;AAAA,MAAW;AAAA,MAC5C;AAAA,MAAW;AAAA,MAAW;AAAA,MAAW;AAAA,MAAW;AAAA,IAC9C;AAEA,IAAM,oBAAoB;AAE1B,IAAM,4BAAoD;AAAA,MACxD,WAAW;AAAA,MACX,UAAU;AAAA,MACV,WAAW;AAAA,IACb;AAAA;AAAA;;;ACrBO,SAAS,SAAS,UAA0B;AACjD,QAAM,cAAU,8BAAa,QAAQ;AACrC,QAAM,eAAW,2BAAQ,QAAQ;AACjC,QAAM,QAAI,gCAAW,QAAQ;AAC7B,IAAE,OAAO,OAAO;AAChB,IAAE,OAAO,IAAI;AACb,IAAE,OAAO,QAAQ;AACjB,SAAO,EAAE,OAAO,KAAK;AACvB;AAGO,SAAS,SAAS,OAAe,KAAa;AACnD,QAAM,QAAI,wBAAK,MAAM,gBAAgB,OAAO;AAC5C,iCAAU,GAAG,EAAE,WAAW,KAAK,CAAC;AAChC,SAAO;AACT;AAKO,SAAS,WAAW,UAAkB,OAAe,KAAqC;AAC/F,MAAI;AACJ,MAAI;AACF,QAAI,SAAS,QAAQ;AAAA,EACvB,QAAQ;AACN,WAAO;AAAA,EACT;AACA,QAAM,YAAQ,wBAAK,SAAS,IAAI,GAAG,GAAG,CAAC,OAAO;AAC9C,MAAI,KAAC,4BAAW,KAAK,EAAG,QAAO;AAC/B,MAAI;AACF,WAAO,KAAK,UAAM,8BAAa,OAAO,OAAO,CAAC;AAAA,EAChD,QAAQ;AACN,WAAO;AAAA,EACT;AACF;AAGO,SAAS,WAAW,UAAkB,QAAiC,OAAe,KAAW;AACtG,QAAM,IAAI,SAAS,QAAQ;AAC3B,QAAM,YAAQ,wBAAK,SAAS,IAAI,GAAG,GAAG,CAAC,OAAO;AAC9C,QAAM,MAAM,QAAQ;AACpB,MAAI;AACF,uCAAc,KAAK,KAAK,UAAU,MAAM,CAAC;AACzC,oCAAW,KAAK,KAAK;AAAA,EACvB,QAAQ;AACN,QAAI;AAAE,sCAAW,GAAG;AAAA,IAAG,QAAQ;AAAA,IAAe;AAC9C,UAAM,IAAI,MAAM,4BAA4B,QAAQ,EAAE;AAAA,EACxD;AACF;AAsCO,SAAS,mBACd,OACA,OAAe,KAC6F;AAC5G,QAAM,cAA8C,CAAC;AACrD,QAAM,cAA8C,CAAC;AACrD,QAAM,mBAAmD,CAAC;AAC1D,QAAM,WAAqB,CAAC;AAE5B,aAAW,SAAS,OAAO;AACzB,UAAM,SAAS,WAAW,OAAO,IAAI;AACrC,QAAI,WAAW,MAAM;AACnB,YAAM,IAAI;AACV,kBAAY,KAAK,GAAI,EAAE,SAAS,CAAC,CAAE;AACnC,kBAAY,KAAK,GAAI,EAAE,SAAS,CAAC,CAAE;AACnC,uBAAiB,KAAK,GAAI,EAAE,cAAc,CAAC,CAAE;AAAA,IAC/C,OAAO;AACL,eAAS,KAAK,KAAK;AAAA,IACrB;AAAA,EACF;AAEA,SAAO,CAAC,aAAa,aAAa,kBAAkB,QAAQ;AAC9D;AAMO,SAAS,kBACd,OACA,OACA,aAAoD,MACpD,OAAe,KACP;AACR,QAAM,SAAS,oBAAI,IAA4B;AAE/C,aAAW,KAAK,OAAO;AACrB,UAAM,MAAO,EAAE,eAA0B;AACzC,QAAI,CAAC,IAAK;AACV,QAAI,CAAC,OAAO,IAAI,GAAG,EAAG,QAAO,IAAI,KAAK,EAAE,OAAO,CAAC,GAAG,OAAO,CAAC,GAAG,YAAY,CAAC,EAAE,CAAC;AAC9E,WAAO,IAAI,GAAG,EAAG,MAAM,KAAK,CAAC;AAAA,EAC/B;AACA,aAAW,KAAK,OAAO;AACrB,UAAM,MAAO,EAAE,eAA0B;AACzC,QAAI,CAAC,IAAK;AACV,QAAI,CAAC,OAAO,IAAI,GAAG,EAAG,QAAO,IAAI,KAAK,EAAE,OAAO,CAAC,GAAG,OAAO,CAAC,GAAG,YAAY,CAAC,EAAE,CAAC;AAC9E,WAAO,IAAI,GAAG,EAAG,MAAM,KAAK,CAAC;AAAA,EAC/B;AACA,aAAW,KAAK,cAAc,CAAC,GAAG;AAChC,UAAM,MAAO,EAAE,eAA0B;AACzC,QAAI,CAAC,IAAK;AACV,QAAI,CAAC,OAAO,IAAI,GAAG,EAAG,QAAO,IAAI,KAAK,EAAE,OAAO,CAAC,GAAG,OAAO,CAAC,GAAG,YAAY,CAAC,EAAE,CAAC;AAC9E,WAAO,IAAI,GAAG,EAAG,WAAW,KAAK,CAAC;AAAA,EACpC;AAEA,MAAI,QAAQ;AACZ,aAAW,CAAC,OAAO,MAAM,KAAK,QAAQ;AACpC,UAAM,QAAI,2BAAQ,MAAM,KAAK;AAC7B,YAAI,4BAAW,CAAC,GAAG;AACjB,iBAAW,GAAG,QAA8C,IAAI;AAChE;AAAA,IACF;AAAA,EACF;AACA,SAAO;AACT;AA9JA,IAGAC,qBACAC,iBACAC;AALA;AAAA;AAGA,IAAAF,sBAA2B;AAC3B,IAAAC,kBAAwG;AACxG,IAAAC,oBAA8B;AAAA;AAAA;;;ACL9B;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAgCA,SAAS,mBAAmC;AAC1C,MAAI;AACF,eAAO,kCAAc,YAAY,GAAG;AAAA,EACtC,QAAQ;AACN,WAAO;AAAA,EACT;AACF;AAIA,eAAe,mBAAkC;AAC/C,MAAI,CAAC,oBAAoB;AACvB,UAAMC,QAAO,KAAK;AAClB,yBAAqB;AAAA,EACvB;AACF;AAEA,SAAS,UAAU,QAAqC,QAAsB;AAC5E,QAAM,OAAO,OAAO,MAAM,MAAM;AAChC,MAAI,CAAC,MAAM;AACT,UAAM,IAAI,MAAM,sBAAsB;AAAA,EACxC;AACA,SAAO;AACT;AAGA,SAAS,mBAAmB,UAAiC;AAC3D,QAAM,eAAc,oBAAI,IAAoB;AAAA,IAC1C,CAAC,WAAW,SAAS;AAAA,EACvB,CAAC,GAAE,IAAI,QAAQ,KAAK;AAEpB,QAAM,aAAa;AAAA,IACjB,eAAe,WAAW,gBAAgB,QAAQ;AAAA,IAClD,eAAe,WAAW,gBAAgB,WAAW;AAAA,IACrD,eAAe,WAAW,gBAAgB,QAAQ;AAAA,IAClD,eAAe,WAAW,gBAAgB,YAAY,QAAQ,MAAM,GAAG,CAAC;AAAA,IACxE,eAAe,WAAW,IAAI,QAAQ;AAAA,IACtC,eAAe,WAAW,IAAI,WAAW;AAAA,EAC3C;AACA,aAAW,aAAa,YAAY;AAClC,QAAI;AACF,YAAM,WAAW,cAAc,QAAQ,SAAS;AAChD,cAAI,4BAAW,QAAQ,EAAG,QAAO;AAAA,IACnC,QAAQ;AAAA,IAER;AAAA,EACF;AAEA,QAAM,YAAQ,wBAAK,QAAQ,IAAI,GAAG,cAAc;AAChD,aAAW,aAAa,YAAY;AAClC,UAAM,QAAI,wBAAK,OAAO,SAAS;AAC/B,YAAI,4BAAW,CAAC,EAAG,QAAO;AAAA,EAC5B;AACA,SAAO;AACT;AAQA,eAAe,aAAa,UAAuD;AACjF,MAAI,eAAe,IAAI,QAAQ,EAAG,QAAO,eAAe,IAAI,QAAQ;AACpE,QAAM,WAAW,mBAAmB,QAAQ;AAC5C,MAAI,CAAC,SAAU,QAAO;AACtB,MAAI;AACF,UAAM,OAAO,MAAiB,oBAAS,KAAK,QAAQ;AACpD,mBAAe,IAAI,UAAU,IAAI;AACjC,WAAO;AAAA,EACT,QAAQ;AACN,WAAO;AAAA,EACT;AACF;AAGA,SAAS,WAAW,OAAyB;AAC3C,QAAM,WAAW,MACd,OAAO,OAAO,EACd,IAAI,CAAC,MAAM,EAAE,QAAQ,kBAAkB,EAAE,CAAC,EAC1C,KAAK,GAAG;AACX,QAAM,UAAU,SAAS,QAAQ,kBAAkB,GAAG;AACtD,SAAO,QAAQ,QAAQ,YAAY,EAAE,EAAE,YAAY;AACrD;AAEA,SAAS,UAAU,MAAkB,QAAwB;AAC3D,SAAO,OAAO,MAAM,KAAK,YAAY,KAAK,QAAQ;AACpD;AA8DA,SAAS,cAAc,WAAyG;AAC9H,SAAO;AAAA,IACL,YAAY,oBAAI,IAAI;AAAA,IACpB,eAAe,oBAAI,IAAI;AAAA,IACvB,aAAa,oBAAI,IAAI;AAAA,IACrB,WAAW,oBAAI,IAAI;AAAA,IACnB,WAAW;AAAA,IACX,wBAAwB,CAAC;AAAA,IACzB,WAAW;AAAA,IACX,wBAAwB,CAAC;AAAA,IACzB,mBAAmB;AAAA,IACnB,uBAAuB,oBAAI,IAAI;AAAA,IAC/B,mBAAmB;AAAA,IACnB,uBAAuB,oBAAI,IAAI;AAAA,IAC/B,eAAe;AAAA,IACf,uBAAuB;AAAA,IACvB,qBAAqB;AAAA,IACrB,aAAa;AAAA,IACb,GAAG;AAAA,EACL;AACF;AAoBA,SAAS,UAAU,MAAkB,QAA2C;AAC9E,QAAM,IAAI,KAAK,kBAAkB,OAAO,SAAS;AACjD,MAAI,EAAG,QAAO;AACd,aAAW,SAAS,KAAK,UAAU;AACjC,QAAI,OAAO,uBAAuB,SAAS,MAAM,IAAI,GAAG;AACtD,aAAO;AAAA,IACT;AAAA,EACF;AACA,SAAO;AACT;AAMA,SAAS,cACP,MAAkB,QAAgB,SAAiB,OACnD,OAAoB,SACd;AACN,QAAM,IAAI,KAAK;AACf,MAAI,MAAM,oBAAoB;AAC5B,eAAW,SAAS,KAAK,UAAU;AACjC,UAAI,MAAM,SAAS,iBAAiB,MAAM,SAAS,kBAAkB;AACnE,cAAM,MAAM,UAAU,OAAO,MAAM;AACnC,cAAM,aAAa,IAAI,MAAM,MAAM,EAAE,CAAC,EAAG,KAAK,EAAE,QAAQ,QAAQ,EAAE;AAClE,cAAM,SAAS,QAAQ,UAAU;AACjC,cAAM,KAAK;AAAA,UACT,QAAQ;AAAA,UAAS,QAAQ;AAAA,UAAQ,UAAU;AAAA,UAC3C,YAAY;AAAA,UAAa,aAAa;AAAA,UACtC,iBAAiB,IAAI,KAAK,cAAc,MAAM,CAAC;AAAA,UAAI,QAAQ;AAAA,QAC7D,CAAC;AAAA,MACH;AAAA,IACF;AAAA,EACF,WAAW,MAAM,yBAAyB;AACxC,UAAM,aAAa,KAAK,kBAAkB,aAAa;AACvD,QAAI,YAAY;AACd,YAAM,MAAM,UAAU,YAAY,MAAM,EAAE,QAAQ,QAAQ,EAAE;AAC5D,YAAM,SAAS,QAAQ,GAAG;AAC1B,YAAM,KAAK;AAAA,QACT,QAAQ;AAAA,QAAS,QAAQ;AAAA,QAAQ,UAAU;AAAA,QAC3C,YAAY;AAAA,QAAa,aAAa;AAAA,QACtC,iBAAiB,IAAI,KAAK,cAAc,MAAM,CAAC;AAAA,QAAI,QAAQ;AAAA,MAC7D,CAAC;AAAA,IACH;AAAA,EACF;AACF;AAEA,SAAS,UACP,MAAkB,QAAgB,SAAiB,OACnD,OAAoB,SACd;AACN,aAAW,SAAS,KAAK,UAAU;AACjC,QAAI,MAAM,SAAS,UAAU;AAC3B,YAAM,MAAM,UAAU,OAAO,MAAM,EAAE,QAAQ,wBAAwB,EAAE;AACvE,YAAM,aAAa,IAAI,QAAQ,iBAAiB,EAAE,EAAE,MAAM,GAAG,EAAE,IAAI,KAAK;AACxE,UAAI,YAAY;AACd,cAAM,SAAS,QAAQ,UAAU;AACjC,cAAM,KAAK;AAAA,UACT,QAAQ;AAAA,UAAS,QAAQ;AAAA,UAAQ,UAAU;AAAA,UAC3C,YAAY;AAAA,UAAa,aAAa;AAAA,UACtC,iBAAiB,IAAI,KAAK,cAAc,MAAM,CAAC;AAAA,UAAI,QAAQ;AAAA,QAC7D,CAAC;AAAA,MACH;AACA;AAAA,IACF;AAAA,EACF;AACF;AAEA,SAAS,YACP,MAAkB,QAAgB,SAAiB,OACnD,OAAoB,SACd;AACN,WAAS,WAAW,GAAuB;AACzC,UAAM,QAAkB,CAAC;AACzB,QAAI,MAAyB;AAC7B,WAAO,KAAK;AACV,UAAI,IAAI,SAAS,qBAAqB;AACpC,cAAM,WAAW,IAAI,kBAAkB,MAAM;AAC7C,YAAI,SAAU,OAAM,KAAK,UAAU,UAAU,MAAM,CAAC;AACpD,cAAM,IAAI,kBAAkB,OAAO;AAAA,MACrC,WAAW,IAAI,SAAS,cAAc;AACpC,cAAM,KAAK,UAAU,KAAK,MAAM,CAAC;AACjC;AAAA,MACF,OAAO;AACL;AAAA,MACF;AAAA,IACF;AACA,UAAM,QAAQ;AACd,WAAO,MAAM,KAAK,GAAG;AAAA,EACvB;AAEA,aAAW,SAAS,KAAK,UAAU;AACjC,QAAI,MAAM,SAAS,uBAAuB,MAAM,SAAS,cAAc;AACrE,YAAM,UAAU,WAAW,KAAK;AAChC,YAAM,YAAY,QAAQ,MAAM,GAAG;AACnC,UAAI,aAAa,UAAU,UAAU,SAAS,CAAC,EAAG,QAAQ,OAAO,EAAE,EAAE,QAAQ,QAAQ,EAAE,EAAE,KAAK;AAC9F,UAAI,CAAC,cAAc,UAAU,SAAS,GAAG;AACvC,qBAAa,UAAU,UAAU,SAAS,CAAC;AAAA,MAC7C;AACA,UAAI,CAAC,WAAY,cAAa;AAC9B,UAAI,YAAY;AACd,cAAM,SAAS,QAAQ,UAAU;AACjC,cAAM,KAAK;AAAA,UACT,QAAQ;AAAA,UAAS,QAAQ;AAAA,UAAQ,UAAU;AAAA,UAC3C,YAAY;AAAA,UAAa,aAAa;AAAA,UACtC,iBAAiB,IAAI,KAAK,cAAc,MAAM,CAAC;AAAA,UAAI,QAAQ;AAAA,QAC7D,CAAC;AAAA,MACH;AACA;AAAA,IACF;AAAA,EACF;AACF;AAEA,SAAS,SACP,MAAkB,QAAgB,SAAiB,OACnD,OAAoB,SACd;AACN,aAAW,SAAS,KAAK,UAAU;AACjC,QAAI,CAAC,kBAAkB,qBAAqB,QAAQ,EAAE,SAAS,MAAM,IAAI,GAAG;AAC1E,YAAM,MAAM,UAAU,OAAO,MAAM,EAAE,QAAQ,wBAAwB,EAAE;AACvE,YAAM,aAAa,IAAI,MAAM,GAAG,EAAE,IAAI,EAAG,MAAM,GAAG,EAAE,CAAC;AACrD,UAAI,YAAY;AACd,cAAM,SAAS,QAAQ,UAAU;AACjC,cAAM,KAAK;AAAA,UACT,QAAQ;AAAA,UAAS,QAAQ;AAAA,UAAQ,UAAU;AAAA,UAC3C,YAAY;AAAA,UAAa,aAAa;AAAA,UACtC,iBAAiB,IAAI,KAAK,cAAc,MAAM,CAAC;AAAA,UAAI,QAAQ;AAAA,QAC7D,CAAC;AAAA,MACH;AACA;AAAA,IACF;AAAA,EACF;AACF;AAEA,SAAS,cACP,MAAkB,QAAgB,SAAiB,OACnD,OAAoB,SACd;AACN,aAAW,SAAS,KAAK,UAAU;AACjC,QAAI,CAAC,kBAAkB,cAAc,aAAa,EAAE,SAAS,MAAM,IAAI,GAAG;AACxE,YAAM,MAAM,UAAU,OAAO,MAAM;AACnC,YAAM,aAAa,IAAI,MAAM,GAAG,EAAE,IAAI,EAAG,KAAK;AAC9C,UAAI,YAAY;AACd,cAAM,SAAS,QAAQ,UAAU;AACjC,cAAM,KAAK;AAAA,UACT,QAAQ;AAAA,UAAS,QAAQ;AAAA,UAAQ,UAAU;AAAA,UAC3C,YAAY;AAAA,UAAa,aAAa;AAAA,UACtC,iBAAiB,IAAI,KAAK,cAAc,MAAM,CAAC;AAAA,UAAI,QAAQ;AAAA,QAC7D,CAAC;AAAA,MACH;AACA;AAAA,IACF;AAAA,EACF;AACF;AAEA,SAAS,cACP,MAAkB,QAAgB,SAAiB,OACnD,OAAoB,SACd;AACN,QAAM,WAAW,KAAK,kBAAkB,MAAM;AAC9C,MAAI,UAAU;AACZ,UAAM,MAAM,UAAU,UAAU,MAAM;AACtC,UAAM,aAAa,IAAI,MAAM,GAAG,EAAE,IAAI,EAAG,KAAK;AAC9C,QAAI,YAAY;AACd,YAAM,SAAS,QAAQ,UAAU;AACjC,YAAM,KAAK;AAAA,QACT,QAAQ;AAAA,QAAS,QAAQ;AAAA,QAAQ,UAAU;AAAA,QAC3C,YAAY;AAAA,QAAa,aAAa;AAAA,QACtC,iBAAiB,IAAI,KAAK,cAAc,MAAM,CAAC;AAAA,QAAI,QAAQ;AAAA,MAC7D,CAAC;AAAA,IACH;AACA;AAAA,EACF;AAEA,aAAW,SAAS,KAAK,UAAU;AACjC,QAAI,MAAM,SAAS,cAAc;AAC/B,YAAM,MAAM,UAAU,OAAO,MAAM;AACnC,YAAM,SAAS,QAAQ,GAAG;AAC1B,YAAM,KAAK;AAAA,QACT,QAAQ;AAAA,QAAS,QAAQ;AAAA,QAAQ,UAAU;AAAA,QAC3C,YAAY;AAAA,QAAa,aAAa;AAAA,QACtC,iBAAiB,IAAI,KAAK,cAAc,MAAM,CAAC;AAAA,QAAI,QAAQ;AAAA,MAC7D,CAAC;AACD;AAAA,IACF;AAAA,EACF;AACF;AAEA,SAAS,aACP,MAAkB,QAAgB,SAAiB,OACnD,OAAoB,SACd;AACN,aAAW,SAAS,KAAK,UAAU;AACjC,QAAI,MAAM,SAAS,eAAe,MAAM,SAAS,cAAc;AAC7D,YAAM,MAAM,UAAU,OAAO,MAAM;AACnC,YAAM,aAAa,IAAI,MAAM,GAAG,EAAE,IAAI,EAAG,QAAQ,WAAW,EAAE,EAAE,KAAK;AACrE,UAAI,cAAc,eAAe,KAAK;AACpC,cAAM,SAAS,QAAQ,UAAU;AACjC,cAAM,KAAK;AAAA,UACT,QAAQ;AAAA,UAAS,QAAQ;AAAA,UAAQ,UAAU;AAAA,UAC3C,YAAY;AAAA,UAAa,aAAa;AAAA,UACtC,iBAAiB,IAAI,KAAK,cAAc,MAAM,CAAC;AAAA,UAAI,QAAQ;AAAA,QAC7D,CAAC;AAAA,MACH;AACA;AAAA,IACF;AAAA,EACF;AACF;AAEA,SAAS,WACP,MAAkB,QAAgB,SAAiB,OACnD,OAAoB,SACd;AACN,aAAW,SAAS,KAAK,UAAU;AACjC,QAAI,CAAC,kBAAkB,QAAQ,YAAY,EAAE,SAAS,MAAM,IAAI,GAAG;AACjE,YAAM,MAAM,UAAU,OAAO,MAAM;AACnC,YAAM,aAAa,IAAI,MAAM,IAAI,EAAE,IAAI,EAAG,KAAK;AAC/C,UAAI,YAAY;AACd,cAAM,SAAS,QAAQ,UAAU;AACjC,cAAM,KAAK;AAAA,UACT,QAAQ;AAAA,UAAS,QAAQ;AAAA,UAAQ,UAAU;AAAA,UAC3C,YAAY;AAAA,UAAa,aAAa;AAAA,UACtC,iBAAiB,IAAI,KAAK,cAAc,MAAM,CAAC;AAAA,UAAI,QAAQ;AAAA,QAC7D,CAAC;AAAA,MACH;AACA;AAAA,IACF;AAAA,EACF;AACF;AAEA,SAAS,WACP,MAAkB,QAAgB,SAAiB,OACnD,OAAoB,SACd;AACN,QAAM,OAAO,UAAU,MAAM,MAAM;AACnC,QAAM,IAAI,KAAK,MAAM,qCAAqC;AAC1D,MAAI,GAAG;AACL,UAAM,aAAa,EAAE,CAAC,EAAG,MAAM,GAAG,EAAE,IAAI;AACxC,QAAI,YAAY;AACd,YAAM,KAAK;AAAA,QACT,QAAQ;AAAA,QAAS,QAAQ;AAAA,QAAY,UAAU;AAAA,QAC/C,YAAY;AAAA,QAAa,aAAa;AAAA,QACtC,iBAAiB,OAAO,KAAK,cAAc,MAAM,CAAC;AAAA,QAAG,QAAQ;AAAA,MAC/D,CAAC;AAAA,IACH;AAAA,EACF;AACF;AAEA,SAAS,aACP,MAAkB,QAAgB,SAAiB,OACnD,OAAoB,SACd;AACN,aAAW,SAAS,KAAK,UAAU;AACjC,QAAI,MAAM,SAAS,cAAc;AAC/B,YAAM,MAAM,UAAU,OAAO,MAAM;AACnC,YAAM,SAAS,QAAQ,GAAG;AAC1B,YAAM,KAAK;AAAA,QACT,QAAQ;AAAA,QAAS,QAAQ;AAAA,QAAQ,UAAU;AAAA,QAC3C,YAAY;AAAA,QAAa,aAAa;AAAA,QACtC,iBAAiB,IAAI,KAAK,cAAc,MAAM,CAAC;AAAA,QAAI,QAAQ;AAAA,MAC7D,CAAC;AACD;AAAA,IACF;AAAA,EACF;AACF;AAMA,SAAS,cAAc,MAAkB,QAA+B;AACtE,MAAI,KAAK,SAAS,aAAc,QAAO,UAAU,MAAM,MAAM;AAC7D,QAAM,OAAO,KAAK,kBAAkB,YAAY;AAChD,MAAI,KAAM,QAAO,cAAc,MAAM,MAAM;AAC3C,aAAW,SAAS,KAAK,UAAU;AACjC,QAAI,MAAM,SAAS,aAAc,QAAO,UAAU,OAAO,MAAM;AAAA,EACjE;AACA,SAAO;AACT;AAEA,SAAS,gBAAgB,MAAkB,QAA+B;AACxE,MAAI,KAAK,SAAS,aAAc,QAAO,UAAU,MAAM,MAAM;AAC7D,MAAI,KAAK,SAAS,wBAAwB;AACxC,UAAM,WAAW,KAAK,kBAAkB,MAAM;AAC9C,QAAI,SAAU,QAAO,UAAU,UAAU,MAAM;AAAA,EACjD;AACA,QAAM,OAAO,KAAK,kBAAkB,YAAY;AAChD,MAAI,KAAM,QAAO,gBAAgB,MAAM,MAAM;AAC7C,aAAW,SAAS,KAAK,UAAU;AACjC,QAAI,MAAM,SAAS,aAAc,QAAO,UAAU,OAAO,MAAM;AAAA,EACjE;AACA,SAAO;AACT;AAMA,SAAS,aACP,MAAkB,QAAgB,SAAiB,MAAc,UACjE,QAAqB,QAAqB,UAC1C,gBACA,iBACA,WACA,WACS;AACT,MAAI,KAAK,SAAS,uBAAuB;AACvC,eAAW,SAAS,KAAK,UAAU;AACjC,UAAI,MAAM,SAAS,uBAAuB;AACxC,cAAM,QAAQ,MAAM,kBAAkB,OAAO;AAC7C,YAAI,SAAS,MAAM,SAAS,kBAAkB;AAC5C,gBAAM,WAAW,MAAM,kBAAkB,MAAM;AAC/C,cAAI,UAAU;AACZ,kBAAM,WAAW,UAAU,UAAU,MAAM;AAC3C,kBAAM,OAAO,MAAM,cAAc,MAAM;AACvC,kBAAM,UAAU,QAAQ,MAAM,QAAQ;AACtC,sBAAU,SAAS,GAAG,QAAQ,MAAM,IAAI;AACxC,sBAAU,SAAS,SAAS,YAAY,IAAI;AAC5C,kBAAM,OAAO,MAAM,kBAAkB,MAAM;AAC3C,gBAAI,MAAM;AACR,6BAAe,KAAK,CAAC,SAAS,IAAI,CAAC;AAAA,YACrC;AAAA,UACF;AAAA,QACF;AAAA,MACF;AAAA,IACF;AACA,WAAO;AAAA,EACT;AACA,SAAO;AACT;AAMA,SAAS,iBACP,MAAkB,QAAgB,SAAiB,MAAc,UACjE,QAAqB,QAAqB,UAC1C,iBACA,gBACA,WACA,WACA,QACS;AACT,MAAI,KAAK,SAAS,yBAAyB;AACzC,UAAM,WAAW,KAAK,kBAAkB,MAAM;AAC9C,QAAI,UAAU;AACZ,YAAM,SAAS,UAAU,UAAU,MAAM;AACzC,YAAM,QAAQ,QAAQ,MAAM,MAAM;AAClC,YAAM,OAAO,KAAK,cAAc,MAAM;AACtC,gBAAU,OAAO,QAAQ,IAAI;AAC7B,gBAAU,SAAS,OAAO,YAAY,IAAI;AAAA,IAC5C;AACA,UAAM,OAAO,KAAK,kBAAkB,MAAM;AAC1C,QAAI,QAAQ,QAAQ;AAClB,iBAAW,SAAS,KAAK,UAAU;AACjC,eAAO,OAAO,cAAc;AAAA,MAC9B;AAAA,IACF;AACA,WAAO;AAAA,EACT;AACA,SAAO;AACT;AAMA,SAAS,gBACP,MAAkB,QAAgB,UAAkB,OAAe,UACnE,QAAqB,QAAqB,UAC1C,iBACA,gBACA,WACA,WACS;AACT,MAAI,KAAK,SAAS,gBAAgB,gBAAgB;AAChD,eAAW,SAAS,KAAK,UAAU;AACjC,UAAI,MAAM,SAAS,qBAAqB;AACtC,cAAM,WAAW,UAAU,OAAO,MAAM;AACxC,cAAM,UAAU,QAAQ,gBAAgB,QAAQ;AAChD,cAAM,OAAO,KAAK,cAAc,MAAM;AACtC,kBAAU,SAAS,UAAU,IAAI;AACjC,kBAAU,gBAAgB,SAAS,WAAW,IAAI;AAAA,MACpD;AAAA,IACF;AACA,WAAO;AAAA,EACT;AACA,SAAO;AACT;AAkNA,eAAe,gBAAgB,UAAkB,QAAmD;AAClG,QAAM,iBAAiB;AACvB,QAAM,OAAO,MAAM,aAAa,OAAO,aAAa;AACpD,MAAI,CAAC,MAAM;AACT,WAAO,EAAE,OAAO,CAAC,GAAG,OAAO,CAAC,GAAG,OAAO,yBAAyB,OAAO,aAAa,GAAG;AAAA,EACxF;AAEA,MAAI;AACJ,MAAI;AACJ,MAAI;AACF,UAAM,SAAS,IAAIA,QAAO;AAC1B,WAAO,YAAY,IAAI;AACvB,iBAAS,8BAAa,UAAU,OAAO;AACvC,WAAO,UAAU,QAAQ,MAAM;AAAA,EACjC,SAAS,GAAY;AACnB,WAAO,EAAE,OAAO,CAAC,GAAG,OAAO,CAAC,GAAG,OAAO,OAAO,CAAC,EAAE;AAAA,EAClD;AAEA,QAAM,OAAO,KAAK;AAClB,QAAM,WAAO,4BAAS,cAAU,2BAAQ,QAAQ,CAAC;AACjD,QAAM,UAAU;AAChB,QAAM,QAAqB,CAAC;AAC5B,QAAM,QAAqB,CAAC;AAC5B,QAAM,UAAU,oBAAI,IAAY;AAChC,QAAM,iBAA8C,CAAC;AAErD,WAAS,QAAQ,KAAa,OAAe,MAAoB;AAC/D,QAAI,CAAC,QAAQ,IAAI,GAAG,GAAG;AACrB,cAAQ,IAAI,GAAG;AACf,YAAM,KAAK;AAAA,QACT,IAAI;AAAA,QAAK;AAAA,QAAO,WAAW;AAAA,QAC3B,aAAa;AAAA,QAAS,iBAAiB,IAAI,IAAI;AAAA,MACjD,CAAC;AAAA,IACH;AAAA,EACF;AAEA,WAAS,QACP,KAAa,KAAa,UAAkB,MAC5C,aAAuC,aAAa,SAAiB,GAC/D;AACN,UAAM,KAAK;AAAA,MACT,QAAQ;AAAA,MAAK,QAAQ;AAAA,MAAK;AAAA,MAC1B;AAAA,MAAY,aAAa;AAAA,MACzB,iBAAiB,IAAI,IAAI;AAAA,MAAI;AAAA,IAC/B,CAAC;AAAA,EACH;AAEA,QAAM,UAAU,QAAQ,IAAI;AAC5B,UAAQ,aAAS,4BAAS,QAAQ,GAAG,CAAC;AAEtC,WAAS,KAAK,MAAkB,iBAAgC,MAAY;AAC1E,UAAM,IAAI,KAAK;AAGf,QAAI,OAAO,YAAY,IAAI,CAAC,GAAG;AAC7B,UAAI,OAAO,eAAe;AACxB,eAAO,cAAc,MAAM,QAAQ,SAAS,MAAM,OAAO,OAAO;AAAA,MAClE;AACA;AAAA,IACF;AAGA,QAAI,OAAO,WAAW,IAAI,CAAC,GAAG;AAC5B,UAAI,WAAW,KAAK,kBAAkB,OAAO,SAAS;AACtD,UAAI,CAAC,UAAU;AACb,mBAAW,SAAS,KAAK,UAAU;AACjC,cAAI,OAAO,uBAAuB,SAAS,MAAM,IAAI,GAAG;AACtD,uBAAW;AACX;AAAA,UACF;AAAA,QACF;AAAA,MACF;AACA,UAAI,CAAC,SAAU;AACf,YAAM,YAAY,UAAU,UAAU,MAAM;AAC5C,YAAM,WAAW,QAAQ,MAAM,SAAS;AACxC,YAAM,OAAO,KAAK,cAAc,MAAM;AACtC,cAAQ,UAAU,WAAW,IAAI;AACjC,cAAQ,SAAS,UAAU,YAAY,IAAI;AAG3C,UAAI,OAAO,aAAa,sBAAsB;AAC5C,cAAM,OAAO,KAAK,kBAAkB,cAAc;AAClD,YAAI,MAAM;AACR,qBAAW,OAAO,KAAK,UAAU;AAC/B,gBAAI,IAAI,SAAS,cAAc;AAC7B,oBAAM,OAAO,UAAU,KAAK,MAAM;AAClC,kBAAI,UAAU,QAAQ,MAAM,IAAI;AAChC,kBAAI,CAAC,QAAQ,IAAI,OAAO,GAAG;AACzB,0BAAU,QAAQ,IAAI;AACtB,oBAAI,CAAC,QAAQ,IAAI,OAAO,GAAG;AACzB,wBAAM,KAAK;AAAA,oBACT,IAAI;AAAA,oBAAS,OAAO;AAAA,oBAAM,WAAW;AAAA,oBACrC,aAAa;AAAA,oBAAI,iBAAiB;AAAA,kBACpC,CAAC;AACD,0BAAQ,IAAI,OAAO;AAAA,gBACrB;AAAA,cACF;AACA,sBAAQ,UAAU,SAAS,YAAY,IAAI;AAAA,YAC7C;AAAA,UACF;AAAA,QACF;AAAA,MACF;AAGA,UAAI,OAAO,aAAa,qBAAqB;AAC3C,mBAAW,SAAS,KAAK,UAAU;AACjC,cAAI,MAAM,SAAS,yBAAyB;AAC1C,uBAAW,OAAO,MAAM,UAAU;AAChC,kBAAI,IAAI,SAAS,eAAe,IAAI,SAAS,mBAAmB;AAC9D,sBAAM,OAAO,UAAU,KAAK,MAAM;AAClC,oBAAI,UAAU,QAAQ,MAAM,IAAI;AAChC,oBAAI,CAAC,QAAQ,IAAI,OAAO,GAAG;AACzB,4BAAU,QAAQ,IAAI;AACtB,sBAAI,CAAC,QAAQ,IAAI,OAAO,GAAG;AACzB,0BAAM,KAAK;AAAA,sBACT,IAAI;AAAA,sBAAS,OAAO;AAAA,sBAAM,WAAW;AAAA,sBACrC,aAAa;AAAA,sBAAI,iBAAiB;AAAA,oBACpC,CAAC;AACD,4BAAQ,IAAI,OAAO;AAAA,kBACrB;AAAA,gBACF;AACA,wBAAQ,UAAU,SAAS,YAAY,IAAI;AAAA,cAC7C;AAAA,YACF;AAAA,UACF;AAAA,QACF;AAAA,MACF;AAGA,UAAI,OAAO,aAAa,uBAAuB;AAC7C,mBAAW,SAAS,KAAK,UAAU;AACjC,cAAI,MAAM,SAAS,aAAa;AAC9B,uBAAW,OAAO,MAAM,UAAU;AAChC,kBAAI,IAAI,SAAS,gBAAgB,IAAI,SAAS,gBAAgB;AAC5D,oBAAI;AACJ,oBAAI,IAAI,SAAS,gBAAgB;AAC/B,wBAAM,YAAY,IAAI,kBAAkB,MAAM;AAC9C,yBAAO,YAAY,UAAU,WAAW,MAAM,IAAI,UAAU,IAAI,SAAS,CAAC,GAAI,MAAM;AAAA,gBACtF,OAAO;AACL,yBAAO,UAAU,KAAK,MAAM;AAAA,gBAC9B;AACA,oBAAI,UAAU,QAAQ,MAAM,IAAI;AAChC,oBAAI,CAAC,QAAQ,IAAI,OAAO,GAAG;AACzB,4BAAU,QAAQ,IAAI;AACtB,sBAAI,CAAC,QAAQ,IAAI,OAAO,GAAG;AACzB,0BAAM,KAAK;AAAA,sBACT,IAAI;AAAA,sBAAS,OAAO;AAAA,sBAAM,WAAW;AAAA,sBACrC,aAAa;AAAA,sBAAI,iBAAiB;AAAA,oBACpC,CAAC;AACD,4BAAQ,IAAI,OAAO;AAAA,kBACrB;AAAA,gBACF;AACA,wBAAQ,UAAU,SAAS,YAAY,IAAI;AAAA,cAC7C;AAAA,YACF;AAAA,UACF;AAAA,QACF;AAAA,MACF;AAGA,YAAM,OAAO,UAAU,MAAM,MAAM;AACnC,UAAI,MAAM;AACR,mBAAW,SAAS,KAAK,UAAU;AACjC,eAAK,OAAO,QAAQ;AAAA,QACtB;AAAA,MACF;AACA;AAAA,IACF;AAGA,QAAI,OAAO,cAAc,IAAI,CAAC,GAAG;AAC/B,UAAI,WAA0B;AAG9B,UAAI,MAAM,sBAAsB;AAC9B,mBAAW;AAAA,MACb,WAAW,MAAM,yBAAyB;AACxC,mBAAW;AAAA,MACb,WAAW,OAAO,0BAA0B,MAAM;AAEhD,cAAM,aAAa,KAAK,kBAAkB,YAAY;AACtD,YAAI,YAAY;AACd,qBAAW,OAAO,sBAAsB,YAAY,MAAM;AAAA,QAC5D;AAAA,MACF,OAAO;AACL,YAAI,WAAW,KAAK,kBAAkB,OAAO,SAAS;AACtD,YAAI,CAAC,UAAU;AACb,qBAAW,SAAS,KAAK,UAAU;AACjC,gBAAI,OAAO,uBAAuB,SAAS,MAAM,IAAI,GAAG;AACtD,yBAAW;AACX;AAAA,YACF;AAAA,UACF;AAAA,QACF;AACA,mBAAW,WAAW,UAAU,UAAU,MAAM,IAAI;AAAA,MACtD;AAEA,UAAI,CAAC,SAAU;AAEf,YAAM,OAAO,KAAK,cAAc,MAAM;AACtC,UAAI;AACJ,UAAI,gBAAgB;AAClB,kBAAU,QAAQ,gBAAgB,QAAQ;AAC1C,gBAAQ,SAAS,IAAI,QAAQ,MAAM,IAAI;AACvC,gBAAQ,gBAAgB,SAAS,UAAU,IAAI;AAAA,MACjD,OAAO;AACL,kBAAU,QAAQ,MAAM,QAAQ;AAChC,gBAAQ,SAAS,GAAG,QAAQ,MAAM,IAAI;AACtC,gBAAQ,SAAS,SAAS,YAAY,IAAI;AAAA,MAC5C;AAEA,YAAM,OAAO,UAAU,MAAM,MAAM;AACnC,UAAI,MAAM;AACR,uBAAe,KAAK,CAAC,SAAS,IAAI,CAAC;AAAA,MACrC;AACA;AAAA,IACF;AAGA,QAAI,OAAO,aAAa,4BAA4B,OAAO,aAAa,0BAA0B;AAChG,UAAI;AAAA,QAAa;AAAA,QAAM;AAAA,QAAQ;AAAA,QAAS;AAAA,QAAM;AAAA,QAC5C;AAAA,QAAO;AAAA,QAAO;AAAA,QAAS;AAAA,QACvB;AAAA,QAAgB;AAAA,QAAS;AAAA,MAAO,GAAG;AACnC;AAAA,MACF;AAAA,IACF;AAGA,QAAI,OAAO,aAAa,uBAAuB;AAC7C,UAAI;AAAA,QAAiB;AAAA,QAAM;AAAA,QAAQ;AAAA,QAAS;AAAA,QAAM;AAAA,QAChD;AAAA,QAAO;AAAA,QAAO;AAAA,QAAS;AAAA,QACvB;AAAA,QAAgB;AAAA,QAAS;AAAA,QAAS;AAAA,MAAI,GAAG;AACzC;AAAA,MACF;AAAA,IACF;AAGA,QAAI,OAAO,aAAa,qBAAqB;AAC3C,UAAI;AAAA,QAAgB;AAAA,QAAM;AAAA,QAAQ;AAAA,QAAS;AAAA,QAAM;AAAA,QAC/C;AAAA,QAAO;AAAA,QAAO;AAAA,QAAS;AAAA,QACvB;AAAA,QAAgB;AAAA,QAAS;AAAA,MAAO,GAAG;AACnC;AAAA,MACF;AAAA,IACF;AAGA,eAAW,SAAS,KAAK,UAAU;AACjC,WAAK,OAAO,IAAI;AAAA,IAClB;AAAA,EACF;AAEA,OAAK,IAAI;AAGT,QAAM,aAAa,oBAAI,IAAoB;AAC3C,aAAW,KAAK,OAAO;AACrB,UAAM,MAAM,EAAE;AACd,UAAM,aAAa,IAAI,QAAQ,WAAW,EAAE,EAAE,QAAQ,OAAO,EAAE;AAC/D,eAAW,IAAI,WAAW,YAAY,GAAG,EAAE,EAAE;AAAA,EAC/C;AAEA,QAAM,gBAAgB,oBAAI,IAAY;AAEtC,WAAS,UAAU,MAAkB,WAAyB;AAC5D,QAAI,OAAO,sBAAsB,IAAI,KAAK,IAAI,EAAG;AAEjD,QAAI,OAAO,UAAU,IAAI,KAAK,IAAI,GAAG;AACnC,UAAI,aAA4B;AAGhC,UAAI,OAAO,aAAa,qBAAqB;AAC3C,cAAM,QAAQ,KAAK,SAAS,CAAC,KAAK;AAClC,YAAI,OAAO;AACT,cAAI,MAAM,SAAS,qBAAqB;AACtC,yBAAa,UAAU,OAAO,MAAM;AAAA,UACtC,WAAW,MAAM,SAAS,yBAAyB;AACjD,uBAAW,SAAS,MAAM,UAAU;AAClC,kBAAI,MAAM,SAAS,qBAAqB;AACtC,2BAAW,MAAM,MAAM,UAAU;AAC/B,sBAAI,GAAG,SAAS,qBAAqB;AACnC,iCAAa,UAAU,IAAI,MAAM;AAAA,kBACnC;AAAA,gBACF;AAAA,cACF;AAAA,YACF;AAAA,UACF;AAAA,QACF;AAAA,MACF,WAAW,OAAO,aAAa,sBAAsB;AACnD,cAAM,QAAQ,KAAK,SAAS,CAAC,KAAK;AAClC,YAAI,OAAO;AACT,cAAI,MAAM,SAAS,qBAAqB;AACtC,yBAAa,UAAU,OAAO,MAAM;AAAA,UACtC,WAAW,MAAM,SAAS,yBAAyB;AACjD,qBAAS,IAAI,MAAM,SAAS,SAAS,GAAG,KAAK,GAAG,KAAK;AACnD,kBAAI,MAAM,SAAS,CAAC,EAAG,SAAS,qBAAqB;AACnD,6BAAa,UAAU,MAAM,SAAS,CAAC,GAAI,MAAM;AACjD;AAAA,cACF;AAAA,YACF;AAAA,UACF;AAAA,QACF;AAAA,MACF,WAAW,OAAO,aAAa,qBAAqB;AAClD,cAAM,QAAQ,KAAK,SAAS,CAAC,KAAK;AAClC,YAAI,OAAO;AACT,cAAI,MAAM,SAAS,cAAc;AAC/B,yBAAa,UAAU,OAAO,MAAM;AAAA,UACtC,WAAW,MAAM,SAAS,oBAAoB;AAC5C,kBAAM,QAAQ,MAAM,kBAAkB,OAAO;AAC7C,gBAAI,OAAO;AACT,2BAAa,UAAU,OAAO,MAAM;AAAA,YACtC,OAAO;AACL,uBAAS,IAAI,MAAM,SAAS,SAAS,GAAG,KAAK,GAAG,KAAK;AACnD,oBAAI,MAAM,SAAS,CAAC,EAAG,SAAS,cAAc;AAC5C,+BAAa,UAAU,MAAM,SAAS,CAAC,GAAI,MAAM;AACjD;AAAA,gBACF;AAAA,cACF;AAAA,YACF;AAAA,UACF;AAAA,QACF;AAAA,MACF,WAAW,OAAO,aAAa,yBAAyB,KAAK,SAAS,yBAAyB;AAC7F,cAAM,WAAW,KAAK,kBAAkB,MAAM;AAC9C,YAAI,UAAU;AACZ,uBAAa,UAAU,UAAU,MAAM;AAAA,QACzC,OAAO;AACL,qBAAW,SAAS,KAAK,UAAU;AACjC,gBAAI,MAAM,SAAS;AACjB,oBAAM,MAAM,UAAU,OAAO,MAAM;AACnC,kBAAI,IAAI,SAAS,GAAG,GAAG;AACrB,6BAAa,IAAI,MAAM,GAAG,EAAE,IAAI;AAAA,cAClC,OAAO;AACL,6BAAa;AAAA,cACf;AACA;AAAA,YACF;AAAA,UACF;AAAA,QACF;AAAA,MACF,WAAW,OAAO,aAAa,mBAAmB;AAChD,YAAI,KAAK,SAAS,4BAA4B;AAC5C,gBAAM,WAAW,KAAK,kBAAkB,UAAU;AAClD,cAAI,SAAU,cAAa,UAAU,UAAU,MAAM;AAAA,QACvD,OAAO;AACL,gBAAM,WAAW,KAAK,kBAAkB,MAAM;AAC9C,cAAI,SAAU,cAAa,UAAU,UAAU,MAAM;AAAA,QACvD;AAAA,MACF,WAAW,OAAO,aAAa,mBAAmB;AAChD,cAAM,WAAW,OAAO,oBAAoB,KAAK,kBAAkB,OAAO,iBAAiB,IAAI;AAC/F,YAAI,UAAU;AACZ,cAAI,SAAS,SAAS,cAAc;AAClC,yBAAa,UAAU,UAAU,MAAM;AAAA,UACzC,WAAW,SAAS,SAAS,sBAAsB,SAAS,SAAS,wBAAwB;AAC3F,kBAAM,OAAO,SAAS,kBAAkB,OAAO,KAAK,SAAS,kBAAkB,MAAM;AACrF,gBAAI,KAAM,cAAa,UAAU,MAAM,MAAM;AAAA,UAC/C;AAAA,QACF;AAAA,MACF,OAAO;AAEL,cAAM,WAAW,OAAO,oBAAoB,KAAK,kBAAkB,OAAO,iBAAiB,IAAI;AAC/F,YAAI,UAAU;AACZ,cAAI,SAAS,SAAS,cAAc;AAClC,yBAAa,UAAU,UAAU,MAAM;AAAA,UACzC,WAAW,OAAO,sBAAsB,IAAI,SAAS,IAAI,GAAG;AAC1D,gBAAI,OAAO,mBAAmB;AAC5B,oBAAM,OAAO,SAAS,kBAAkB,OAAO,iBAAiB;AAChE,kBAAI,KAAM,cAAa,UAAU,MAAM,MAAM;AAAA,YAC/C;AAAA,UACF,OAAO;AAEL,yBAAa,UAAU,UAAU,MAAM;AAAA,UACzC;AAAA,QACF;AAAA,MACF;AAEA,UAAI,YAAY;AACd,cAAM,SAAS,WAAW,IAAI,WAAW,YAAY,CAAC;AACtD,YAAI,UAAU,WAAW,WAAW;AAClC,gBAAM,OAAO,GAAG,SAAS,IAAI,MAAM;AACnC,cAAI,CAAC,cAAc,IAAI,IAAI,GAAG;AAC5B,0BAAc,IAAI,IAAI;AACtB,kBAAM,OAAO,KAAK,cAAc,MAAM;AACtC,kBAAM,KAAK;AAAA,cACT,QAAQ;AAAA,cAAW,QAAQ;AAAA,cAAQ,UAAU;AAAA,cAC7C,YAAY;AAAA,cAAY,aAAa;AAAA,cACrC,iBAAiB,IAAI,IAAI;AAAA,cAAI,QAAQ;AAAA,YACvC,CAAC;AAAA,UACH;AAAA,QACF;AAAA,MACF;AAAA,IACF;AAEA,eAAW,SAAS,KAAK,UAAU;AACjC,gBAAU,OAAO,SAAS;AAAA,IAC5B;AAAA,EACF;AAEA,aAAW,CAAC,WAAW,QAAQ,KAAK,gBAAgB;AAClD,cAAU,UAAU,SAAS;AAAA,EAC/B;AAGA,QAAM,WAAW;AACjB,QAAM,aAAa,MAAM,OAAO,CAAC,SAAS;AACxC,UAAM,MAAM,KAAK;AACjB,UAAM,MAAM,KAAK;AACjB,WAAO,SAAS,IAAI,GAAG,MAAM,SAAS,IAAI,GAAG,KAAK,KAAK,aAAa,aAAa,KAAK,aAAa;AAAA,EACrG,CAAC;AAED,SAAO,EAAE,OAAO,OAAO,WAAW;AACpC;AAWA,eAAe,wBAAwB,UAAkB,QAAyC;AAChG,QAAM,iBAAiB;AACvB,QAAM,OAAO,MAAM,aAAa,QAAQ;AACxC,MAAI,CAAC,KAAM;AAEX,MAAI;AACJ,MAAI;AACJ,MAAI;AACF,UAAM,SAAS,IAAIA,QAAO;AAC1B,WAAO,YAAY,IAAI;AACvB,iBAAS,8BAAa,UAAU,OAAO;AACvC,UAAM,OAAO,UAAU,QAAQ,MAAM;AACrC,WAAO,KAAK;AAAA,EACd,QAAQ;AACN;AAAA,EACF;AAEA,QAAM,WAAO,4BAAS,cAAU,2BAAQ,QAAQ,CAAC;AACjD,QAAM,UAAU;AAChB,QAAM,EAAE,OAAO,MAAM,IAAI;AACzB,QAAM,UAAU,IAAI,IAAI,MAAM,IAAI,CAAC,MAAM,EAAE,EAAE,CAAC;AAC9C,QAAM,UAAU,QAAQ,IAAI;AAE5B,WAAS,aAAa,UAAsD;AAC1E,QAAI,CAAC,SAAU,QAAO;AACtB,eAAW,SAAS,SAAS,UAAU;AACrC,UAAI,MAAM,SAAS,wBAAwB;AACzC,mBAAW,OAAO,MAAM,UAAU;AAChC,cAAI,IAAI,SAAS,YAAY,IAAI,SAAS,uBAAuB;AAC/D,gBAAI,OAAO,OAAO,MAAM,IAAI,YAAY,IAAI,QAAQ;AACpD,mBAAO,KAAK,QAAQ,kBAAkB,EAAE,EAAE,QAAQ,gBAAgB,EAAE,EAAE,QAAQ,gBAAgB,EAAE,EAAE,KAAK;AACvG,gBAAI,KAAK,SAAS,IAAI;AACpB,qBAAO,CAAC,MAAM,MAAM,cAAc,MAAM,CAAC;AAAA,YAC3C;AAAA,UACF;AAAA,QACF;AAAA,MACF;AACA;AAAA,IACF;AACA,WAAO;AAAA,EACT;AAEA,WAAS,aAAa,MAAc,MAAc,WAAyB;AACzE,UAAM,QAAQ,KAAK,MAAM,GAAG,EAAE,EAAE,QAAQ,OAAO,GAAG,EAAE,KAAK;AACzD,UAAM,MAAM,QAAQ,MAAM,aAAa,OAAO,IAAI,CAAC;AACnD,QAAI,CAAC,QAAQ,IAAI,GAAG,GAAG;AACrB,cAAQ,IAAI,GAAG;AACf,YAAM,KAAK;AAAA,QACT,IAAI;AAAA,QAAK;AAAA,QAAO,WAAW;AAAA,QAC3B,aAAa;AAAA,QAAS,iBAAiB,IAAI,IAAI;AAAA,MACjD,CAAC;AAAA,IACH;AACA,UAAM,KAAK;AAAA,MACT,QAAQ;AAAA,MAAK,QAAQ;AAAA,MAAW,UAAU;AAAA,MAC1C,YAAY;AAAA,MAAa,aAAa;AAAA,MACtC,iBAAiB,IAAI,IAAI;AAAA,MAAI,QAAQ;AAAA,IACvC,CAAC;AAAA,EACH;AAGA,QAAM,KAAK,aAAa,IAAI;AAC5B,MAAI,GAAI,cAAa,GAAG,CAAC,GAAG,GAAG,CAAC,GAAG,OAAO;AAG1C,WAAS,eAAe,MAAkB,WAAyB;AACjE,UAAM,IAAI,KAAK;AACf,QAAI,MAAM,oBAAoB;AAC5B,YAAM,WAAW,KAAK,kBAAkB,MAAM;AAC9C,YAAM,OAAO,KAAK,kBAAkB,MAAM;AAC1C,UAAI,YAAY,MAAM;AACpB,cAAM,YAAY,OAAO,MAAM,SAAS,YAAY,SAAS,QAAQ;AACrE,cAAM,MAAM,QAAQ,MAAM,SAAS;AACnC,cAAM,UAAU,aAAa,IAAI;AACjC,YAAI,QAAS,cAAa,QAAQ,CAAC,GAAG,QAAQ,CAAC,GAAG,GAAG;AACrD,mBAAW,SAAS,KAAK,UAAU;AACjC,yBAAe,OAAO,GAAG;AAAA,QAC3B;AAAA,MACF;AACA;AAAA,IACF;AACA,QAAI,MAAM,uBAAuB;AAC/B,YAAM,WAAW,KAAK,kBAAkB,MAAM;AAC9C,YAAM,OAAO,KAAK,kBAAkB,MAAM;AAC1C,UAAI,YAAY,MAAM;AACpB,cAAM,WAAW,OAAO,MAAM,SAAS,YAAY,SAAS,QAAQ;AACpE,cAAM,MAAM,cAAc,UAAU,QAAQ,WAAW,QAAQ,IAAI,QAAQ,MAAM,QAAQ;AACzF,cAAM,SAAS,aAAa,IAAI;AAChC,YAAI,OAAQ,cAAa,OAAO,CAAC,GAAG,OAAO,CAAC,GAAG,GAAG;AAAA,MACpD;AACA;AAAA,IACF;AACA,eAAW,SAAS,KAAK,UAAU;AACjC,qBAAe,OAAO,SAAS;AAAA,IACjC;AAAA,EACF;AAEA,iBAAe,MAAM,OAAO;AAG5B,QAAM,QAAQ,OAAO,MAAM,IAAI;AAC/B,WAAS,SAAS,GAAG,SAAS,MAAM,QAAQ,UAAU;AACpD,UAAM,WAAW,MAAM,MAAM,EAAG,KAAK;AACrC,QAAI,oBAAoB,KAAK,CAAC,MAAM,SAAS,WAAW,CAAC,CAAC,GAAG;AAC3D,mBAAa,UAAU,SAAS,GAAG,OAAO;AAAA,IAC5C;AAAA,EACF;AACF;AAMA,eAAsB,cAAc,UAA6C;AAC/E,QAAM,SAAS,MAAM,gBAAgB,UAAU,cAAc;AAC7D,MAAI,CAAC,OAAO,OAAO;AACjB,UAAM,wBAAwB,UAAU,MAAM;AAAA,EAChD;AACA,SAAO;AACT;AAEA,eAAsB,UAAU,UAA6C;AAC3E,QAAM,UAAM,2BAAQ,QAAQ;AAC5B,QAAM,SAAU,QAAQ,SAAS,QAAQ,SAAU,aAAa;AAChE,SAAO,gBAAgB,UAAU,MAAM;AACzC;AAEA,eAAsB,YAAY,UAA6C;AAC7E,SAAO,gBAAgB,UAAU,YAAY;AAC/C;AAEA,eAAsB,SAAS,UAA6C;AAC1E,SAAO,gBAAgB,UAAU,SAAS;AAC5C;AAEA,eAAsB,WAAW,UAA6C;AAC5E,SAAO,gBAAgB,UAAU,WAAW;AAC9C;AAEA,eAAsB,YAAY,UAA6C;AAC7E,SAAO,gBAAgB,UAAU,YAAY;AAC/C;AAEA,eAAsB,cAAc,UAA6C;AAC/E,SAAO,gBAAgB,UAAU,cAAc;AACjD;AAEA,eAAsB,cAAc,UAA6C;AAC/E,SAAO,gBAAgB,UAAU,cAAc;AACjD;AAEA,eAAsB,aAAa,UAA6C;AAC9E,SAAO,gBAAgB,UAAU,aAAa;AAChD;AAEA,eAAsB,WAAW,UAA6C;AAC5E,SAAO,gBAAgB,UAAU,WAAW;AAC9C;AAEA,eAAsB,WAAW,UAA6C;AAC5E,SAAO,gBAAgB,UAAU,WAAW;AAC9C;AAEA,eAAsB,aAAa,UAA6C;AAC9E,SAAO,gBAAgB,UAAU,aAAa;AAChD;AAMA,eAAsB,aAAa,UAA6C;AAC9E,QAAM,iBAAiB;AACvB,QAAM,OAAO,MAAM,aAAa,OAAO;AACvC,MAAI,CAAC,MAAM;AACT,WAAO,EAAE,OAAO,CAAC,GAAG,OAAO,CAAC,GAAG,OAAO,kCAAkC;AAAA,EAC1E;AAEA,MAAI;AACJ,MAAI;AACJ,MAAI;AACF,UAAM,SAAS,IAAIA,QAAO;AAC1B,WAAO,YAAY,IAAI;AACvB,iBAAS,8BAAa,UAAU,OAAO;AACvC,WAAO,UAAU,QAAQ,MAAM;AAAA,EACjC,SAAS,GAAY;AACnB,WAAO,EAAE,OAAO,CAAC,GAAG,OAAO,CAAC,GAAG,OAAO,OAAO,CAAC,EAAE;AAAA,EAClD;AAEA,QAAM,OAAO,KAAK;AAClB,QAAM,WAAO,4BAAS,cAAU,2BAAQ,QAAQ,CAAC;AACjD,QAAM,UAAU;AAChB,QAAM,QAAqB,CAAC;AAC5B,QAAM,QAAqB,CAAC;AAC5B,QAAM,UAAU,oBAAI,IAAY;AAChC,QAAM,iBAA8C,CAAC;AAErD,WAAS,QAAQ,KAAa,OAAe,MAAoB;AAC/D,QAAI,CAAC,QAAQ,IAAI,GAAG,GAAG;AACrB,cAAQ,IAAI,GAAG;AACf,YAAM,KAAK,EAAE,IAAI,KAAK,OAAO,WAAW,QAAQ,aAAa,SAAS,iBAAiB,IAAI,IAAI,GAAG,CAAC;AAAA,IACrG;AAAA,EACF;AAEA,WAAS,QACP,KAAa,KAAa,UAAkB,MAC5C,aAAuC,aAAa,SAAiB,GAC/D;AACN,UAAM,KAAK,EAAE,QAAQ,KAAK,QAAQ,KAAK,UAAU,YAAY,aAAa,SAAS,iBAAiB,IAAI,IAAI,IAAI,OAAO,CAAC;AAAA,EAC1H;AAEA,QAAM,UAAU,QAAQ,IAAI;AAC5B,UAAQ,aAAS,4BAAS,QAAQ,GAAG,CAAC;AAEtC,WAAS,sBAAsB,SAAoC;AACjE,eAAW,SAAS,QAAQ,UAAU;AACpC,UAAI,MAAM,SAAS,mBAAmB;AACpC,cAAM,SAAS,MAAM,SAAS,CAAC,KAAK;AACpC,YAAI,UAAU,OAAO,SAAS,cAAc;AAC1C,iBAAO,UAAU,QAAQ,MAAM;AAAA,QACjC;AAAA,MACF;AAAA,IACF;AACA,WAAO;AAAA,EACT;AAEA,WAAS,UAAU,UAAsB,SAAuB;AAC9D,QAAI,CAAC,SAAU;AACf,UAAM,IAAI,SAAS;AACnB,QAAI,MAAM,yBAAyB,MAAM,4BAA6B;AACtE,QAAI,MAAM,qBAAqB,SAAS,SAAS,SAAS,GAAG;AAC3D,YAAM,SAAS,SAAS,SAAS,CAAC;AAClC,UAAI,OAAO,SAAS,cAAc;AAChC,cAAM,aAAa,UAAU,QAAQ,MAAM;AAC3C,cAAM,YAAY,QAAQ,MAAM,UAAU;AAC1C,gBAAQ,SAAS,WAAW,SAAS,SAAS,cAAc,MAAM,GAAG,WAAW;AAAA,MAClF,WAAW,OAAO,SAAS,sBAAsB,OAAO,SAAS,UAAU,GAAG;AAC5E,cAAM,aAAa,OAAO,SAAS,OAAO,SAAS,SAAS,CAAC;AAC7D,cAAM,aAAa,UAAU,YAAY,MAAM;AAC/C,cAAM,YAAY,QAAQ,MAAM,UAAU;AAC1C,gBAAQ,SAAS,WAAW,SAAS,SAAS,cAAc,MAAM,GAAG,WAAW;AAAA,MAClF;AAAA,IACF;AACA,eAAW,SAAS,SAAS,UAAU;AACrC,gBAAU,OAAO,OAAO;AAAA,IAC1B;AAAA,EACF;AAEA,WAAS,KAAK,MAAkB,UAAwB;AACtD,UAAM,IAAI,KAAK;AAGf,QAAI,MAAM,qBAAqB;AAC7B,YAAM,WAAW,KAAK,SAAS,KAAK,CAAC,MAAM,EAAE,SAAS,YAAY,KAAK;AACvE,UAAI,UAAU;AACZ,cAAM,UAAU,UAAU,UAAU,MAAM;AAC1C,cAAM,SAAS,QAAQ,MAAM,OAAO;AACpC,cAAM,OAAO,KAAK,cAAc,MAAM;AACtC,gBAAQ,QAAQ,SAAS,IAAI;AAC7B,gBAAQ,SAAS,QAAQ,WAAW,IAAI;AACxC,mBAAW,SAAS,KAAK,UAAU;AACjC,eAAK,OAAO,MAAM;AAAA,QACpB;AAAA,MACF;AACA;AAAA,IACF;AAGA,QAAI,MAAM,qBAAqB;AAC7B,YAAM,WAAW,KAAK,SAAS,KAAK,CAAC,MAAM,EAAE,SAAS,WAAW,KAAK;AACtE,UAAI,UAAU;AACZ,cAAM,UAAU,SAAS,SAAS,KAAK,CAAC,MAAM,EAAE,SAAS,mBAAmB,KAAK;AACjF,YAAI,SAAS;AACX,gBAAM,cAAc,QAAQ,SAAS,OAAO,CAAC,MAAM,EAAE,SAAS,YAAY;AAC1E,cAAI,YAAY,SAAS,GAAG;AAC1B,kBAAM,aAAa,UAAU,YAAY,CAAC,GAAI,MAAM;AACpD,kBAAM,YAAY,QAAQ,MAAM,UAAU;AAC1C,kBAAM,OAAO,KAAK,cAAc,MAAM;AACtC,oBAAQ,WAAW,YAAY,IAAI;AACnC,oBAAQ,UAAU,WAAW,WAAW,IAAI;AAC5C,gBAAI,YAAY,UAAU,GAAG;AAC3B,oBAAM,YAAY,UAAU,YAAY,YAAY,SAAS,CAAC,GAAI,MAAM;AACxE,sBAAQ,WAAW,QAAQ,MAAM,SAAS,GAAG,YAAY,MAAM,WAAW;AAAA,YAC5E;AAAA,UACF;AAAA,QACF,OAAO;AACL,gBAAM,WAAW,SAAS,SAAS,KAAK,CAAC,MAAM,EAAE,SAAS,YAAY,KAAK;AAC3E,cAAI,UAAU;AACZ,kBAAM,aAAa,UAAU,UAAU,MAAM;AAC7C,kBAAM,YAAY,QAAQ,MAAM,UAAU;AAC1C,kBAAM,OAAO,KAAK,cAAc,MAAM;AACtC,oBAAQ,WAAW,YAAY,IAAI;AACnC,oBAAQ,UAAU,WAAW,WAAW,IAAI;AAAA,UAC9C;AAAA,QACF;AAAA,MACF;AACA;AAAA,IACF;AAGA,QAAI,MAAM,uBAAuB;AAC/B,YAAM,WAAW,KAAK,SAAS,KAAK,CAAC,MAAM,EAAE,SAAS,WAAW,KAAK;AACtE,UAAI,UAAU;AACZ,cAAM,WAAW,SAAS,SAAS,KAAK,CAAC,MAAM,EAAE,SAAS,YAAY,KAAK;AAC3E,YAAI,UAAU;AACZ,gBAAM,UAAU,UAAU,UAAU,MAAM;AAC1C,gBAAM,SAAS,QAAQ,MAAM,OAAO;AACpC,gBAAM,OAAO,KAAK,cAAc,MAAM;AACtC,kBAAQ,QAAQ,SAAS,IAAI;AAC7B,kBAAQ,UAAU,QAAQ,WAAW,IAAI;AAAA,QAC3C;AAAA,MACF;AACA;AAAA,IACF;AAGA,QAAI,MAAM,uBAAuB;AAC/B,YAAM,UAAU,KAAK,SAAS,KAAK,CAAC,MAAM,EAAE,SAAS,WAAW,KAAK;AACrE,UAAI,SAAS;AACX,cAAM,WAAW,sBAAsB,OAAO;AAC9C,YAAI,UAAU;AACZ,gBAAM,UAAU,QAAQ,MAAM,QAAQ;AACtC,gBAAM,OAAO,KAAK,cAAc,MAAM;AACtC,kBAAQ,SAAS,GAAG,QAAQ,MAAM,IAAI;AACtC,kBAAQ,UAAU,SAAS,WAAW,IAAI;AAC1C,yBAAe,KAAK,CAAC,SAAS,IAAI,CAAC;AAAA,QACrC;AAAA,MACF;AACA;AAAA,IACF;AAGA,QAAI,MAAM,cAAc;AACtB,YAAM,MAAM,KAAK,SAAS,CAAC,KAAK;AAChC,UAAI,OAAO,IAAI,SAAS,qBAAqB,IAAI,SAAS,SAAS,GAAG;AACpE,cAAM,SAAS,IAAI,SAAS,CAAC;AAC7B,YAAI,OAAO,SAAS,cAAc;AAChC,gBAAM,WAAW,UAAU,QAAQ,MAAM;AACzC,gBAAM,UAAU,QAAQ,MAAM,QAAQ;AACtC,gBAAM,OAAO,KAAK,cAAc,MAAM;AACtC,kBAAQ,SAAS,GAAG,QAAQ,MAAM,IAAI;AACtC,kBAAQ,UAAU,SAAS,WAAW,IAAI;AAC1C,gBAAM,MAAM,KAAK,SAAS,UAAU,IAAI,KAAK,SAAS,KAAK,SAAS,SAAS,CAAC,IAAK;AACnF,cAAI,KAAK;AACP,2BAAe,KAAK,CAAC,SAAS,GAAG,CAAC;AAAA,UACpC;AAAA,QACF;AAAA,MACF;AACA;AAAA,IACF;AAGA,QAAI,MAAM,qBAAqB,MAAM,oBAAoB;AACvD,YAAM,OAAO,KAAK,cAAc,MAAM;AACtC,iBAAW,SAAS,KAAK,UAAU;AACjC,YAAI,MAAM,SAAS,cAAc;AAC/B,gBAAM,UAAU,UAAU,OAAO,MAAM;AACvC,gBAAM,SAAS,QAAQ,OAAO;AAC9B,kBAAQ,QAAQ,SAAS,IAAI;AAC7B,kBAAQ,UAAU,QAAQ,WAAW,IAAI;AAAA,QAC3C,WAAW,MAAM,SAAS,mBAAmB;AAC3C,gBAAM,cAAc,MAAM,SAAS,OAAO,CAAC,MAAM,EAAE,SAAS,YAAY;AACxE,cAAI,YAAY,SAAS,GAAG;AAC1B,kBAAM,UAAU,UAAU,YAAY,CAAC,GAAI,MAAM;AACjD,kBAAM,SAAS,QAAQ,OAAO;AAC9B,oBAAQ,QAAQ,SAAS,IAAI;AAC7B,oBAAQ,UAAU,QAAQ,WAAW,IAAI;AAAA,UAC3C;AAAA,QACF;AAAA,MACF;AACA;AAAA,IACF;AAEA,eAAW,SAAS,KAAK,UAAU;AACjC,WAAK,OAAO,QAAQ;AAAA,IACtB;AAAA,EACF;AAEA,OAAK,MAAM,OAAO;AAElB,aAAW,CAAC,SAAS,QAAQ,KAAK,gBAAgB;AAChD,QAAI,SAAS,SAAS,uBAAuB;AAC3C,iBAAW,SAAS,SAAS,UAAU;AACrC,YAAI,MAAM,SAAS,aAAa;AAC9B,oBAAU,OAAO,OAAO;AAAA,QAC1B;AAAA,MACF;AAAA,IACF,OAAO;AACL,gBAAU,UAAU,OAAO;AAAA,IAC7B;AAAA,EACF;AAEA,SAAO,EAAE,OAAO,MAAM;AACxB;AAMA,eAAsB,UAAU,UAA6C;AAC3E,QAAM,iBAAiB;AACvB,QAAM,OAAO,MAAM,aAAa,IAAI;AACpC,MAAI,CAAC,MAAM;AACT,WAAO,EAAE,OAAO,CAAC,GAAG,OAAO,CAAC,GAAG,OAAO,+BAA+B;AAAA,EACvE;AAEA,MAAI;AACJ,MAAI;AACJ,MAAI;AACF,UAAM,SAAS,IAAIA,QAAO;AAC1B,WAAO,YAAY,IAAI;AACvB,iBAAS,8BAAa,UAAU,OAAO;AACvC,WAAO,UAAU,QAAQ,MAAM;AAAA,EACjC,SAAS,GAAY;AACnB,WAAO,EAAE,OAAO,CAAC,GAAG,OAAO,CAAC,GAAG,OAAO,OAAO,CAAC,EAAE;AAAA,EAClD;AAEA,QAAM,OAAO,KAAK;AAClB,QAAM,WAAO,4BAAS,cAAU,2BAAQ,QAAQ,CAAC;AACjD,QAAM,eAAW,2BAAQ,QAAQ,EAAE,MAAM,qBAAG,EAAE,IAAI,KAAK;AACvD,QAAM,UAAU;AAChB,QAAM,QAAqB,CAAC;AAC5B,QAAM,QAAqB,CAAC;AAC5B,QAAM,UAAU,oBAAI,IAAY;AAChC,QAAM,iBAA8C,CAAC;AAErD,WAAS,QAAQ,KAAa,OAAe,MAAoB;AAC/D,QAAI,CAAC,QAAQ,IAAI,GAAG,GAAG;AACrB,cAAQ,IAAI,GAAG;AACf,YAAM,KAAK,EAAE,IAAI,KAAK,OAAO,WAAW,QAAQ,aAAa,SAAS,iBAAiB,IAAI,IAAI,GAAG,CAAC;AAAA,IACrG;AAAA,EACF;AAEA,WAAS,QACP,KAAa,KAAa,UAAkB,MAC5C,aAAuC,aAAa,SAAiB,GAC/D;AACN,UAAM,KAAK,EAAE,QAAQ,KAAK,QAAQ,KAAK,UAAU,YAAY,aAAa,SAAS,iBAAiB,IAAI,IAAI,IAAI,OAAO,CAAC;AAAA,EAC1H;AAEA,QAAM,UAAU,QAAQ,IAAI;AAC5B,UAAQ,aAAS,4BAAS,QAAQ,GAAG,CAAC;AAEtC,WAAS,KAAK,MAAwB;AACpC,UAAM,IAAI,KAAK;AAEf,QAAI,MAAM,wBAAwB;AAChC,YAAM,WAAW,KAAK,kBAAkB,MAAM;AAC9C,UAAI,UAAU;AACZ,cAAM,WAAW,UAAU,UAAU,MAAM;AAC3C,cAAM,OAAO,KAAK,cAAc,MAAM;AACtC,cAAM,UAAU,QAAQ,MAAM,QAAQ;AACtC,gBAAQ,SAAS,GAAG,QAAQ,MAAM,IAAI;AACtC,gBAAQ,SAAS,SAAS,YAAY,IAAI;AAC1C,cAAM,OAAO,KAAK,kBAAkB,MAAM;AAC1C,YAAI,KAAM,gBAAe,KAAK,CAAC,SAAS,IAAI,CAAC;AAAA,MAC/C;AACA;AAAA,IACF;AAEA,QAAI,MAAM,sBAAsB;AAC9B,YAAM,WAAW,KAAK,kBAAkB,UAAU;AAClD,UAAI,eAA8B;AAClC,UAAI,UAAU;AACZ,mBAAW,SAAS,SAAS,UAAU;AACrC,cAAI,MAAM,SAAS,yBAAyB;AAC1C,kBAAM,WAAW,MAAM,kBAAkB,MAAM;AAC/C,gBAAI,UAAU;AACZ,6BAAe,UAAU,UAAU,MAAM,EAAE,QAAQ,OAAO,EAAE,EAAE,KAAK;AAAA,YACrE;AACA;AAAA,UACF;AAAA,QACF;AAAA,MACF;AACA,YAAM,WAAW,KAAK,kBAAkB,MAAM;AAC9C,UAAI,UAAU;AACZ,cAAM,aAAa,UAAU,UAAU,MAAM;AAC7C,cAAM,OAAO,KAAK,cAAc,MAAM;AACtC,YAAI;AACJ,YAAI,cAAc;AAChB,gBAAM,YAAY,QAAQ,UAAU,YAAY;AAChD,kBAAQ,WAAW,cAAc,IAAI;AACrC,sBAAY,QAAQ,WAAW,UAAU;AACzC,kBAAQ,WAAW,IAAI,UAAU,MAAM,IAAI;AAC3C,kBAAQ,WAAW,WAAW,UAAU,IAAI;AAAA,QAC9C,OAAO;AACL,sBAAY,QAAQ,MAAM,UAAU;AACpC,kBAAQ,WAAW,GAAG,UAAU,MAAM,IAAI;AAC1C,kBAAQ,SAAS,WAAW,YAAY,IAAI;AAAA,QAC9C;AACA,cAAM,OAAO,KAAK,kBAAkB,MAAM;AAC1C,YAAI,KAAM,gBAAe,KAAK,CAAC,WAAW,IAAI,CAAC;AAAA,MACjD;AACA;AAAA,IACF;AAEA,QAAI,MAAM,oBAAoB;AAC5B,iBAAW,SAAS,KAAK,UAAU;AACjC,YAAI,MAAM,SAAS,aAAa;AAC9B,gBAAM,WAAW,MAAM,kBAAkB,MAAM;AAC/C,cAAI,UAAU;AACZ,kBAAM,WAAW,UAAU,UAAU,MAAM;AAC3C,kBAAM,OAAO,MAAM,cAAc,MAAM;AACvC,kBAAM,UAAU,QAAQ,UAAU,QAAQ;AAC1C,oBAAQ,SAAS,UAAU,IAAI;AAC/B,oBAAQ,SAAS,SAAS,YAAY,IAAI;AAAA,UAC5C;AAAA,QACF;AAAA,MACF;AACA;AAAA,IACF;AAEA,QAAI,MAAM,sBAAsB;AAC9B,iBAAW,SAAS,KAAK,UAAU;AACjC,YAAI,MAAM,SAAS,oBAAoB;AACrC,qBAAW,QAAQ,MAAM,UAAU;AACjC,gBAAI,KAAK,SAAS,eAAe;AAC/B,oBAAM,WAAW,KAAK,kBAAkB,MAAM;AAC9C,kBAAI,UAAU;AACZ,sBAAM,MAAM,UAAU,UAAU,MAAM,EAAE,QAAQ,UAAU,EAAE;AAC5D,sBAAM,aAAa,IAAI,MAAM,GAAG,EAAE,IAAI;AACtC,sBAAM,SAAS,QAAQ,UAAU;AACjC,wBAAQ,SAAS,QAAQ,gBAAgB,KAAK,cAAc,MAAM,CAAC;AAAA,cACrE;AAAA,YACF;AAAA,UACF;AAAA,QACF,WAAW,MAAM,SAAS,eAAe;AACvC,gBAAM,WAAW,MAAM,kBAAkB,MAAM;AAC/C,cAAI,UAAU;AACZ,kBAAM,MAAM,UAAU,UAAU,MAAM,EAAE,QAAQ,UAAU,EAAE;AAC5D,kBAAM,aAAa,IAAI,MAAM,GAAG,EAAE,IAAI;AACtC,kBAAM,SAAS,QAAQ,UAAU;AACjC,oBAAQ,SAAS,QAAQ,gBAAgB,MAAM,cAAc,MAAM,CAAC;AAAA,UACtE;AAAA,QACF;AAAA,MACF;AACA;AAAA,IACF;AAEA,eAAW,SAAS,KAAK,UAAU;AACjC,WAAK,KAAK;AAAA,IACZ;AAAA,EACF;AAEA,OAAK,IAAI;AAGT,QAAM,aAAa,oBAAI,IAAoB;AAC3C,aAAW,KAAK,OAAO;AACrB,UAAM,aAAa,EAAE,MAAM,QAAQ,WAAW,EAAE,EAAE,QAAQ,OAAO,EAAE;AACnE,eAAW,IAAI,WAAW,YAAY,GAAG,EAAE,EAAE;AAAA,EAC/C;AAEA,QAAM,gBAAgB,oBAAI,IAAY;AAEtC,WAAS,UAAU,MAAkB,WAAyB;AAC5D,QAAI,KAAK,SAAS,0BAA0B,KAAK,SAAS,qBAAsB;AAChF,QAAI,KAAK,SAAS,mBAAmB;AACnC,YAAM,WAAW,KAAK,kBAAkB,UAAU;AAClD,UAAI,aAA4B;AAChC,UAAI,UAAU;AACZ,YAAI,SAAS,SAAS,cAAc;AAClC,uBAAa,UAAU,UAAU,MAAM;AAAA,QACzC,WAAW,SAAS,SAAS,uBAAuB;AAClD,gBAAM,QAAQ,SAAS,kBAAkB,OAAO;AAChD,cAAI,MAAO,cAAa,UAAU,OAAO,MAAM;AAAA,QACjD;AAAA,MACF;AACA,UAAI,YAAY;AACd,cAAM,SAAS,WAAW,IAAI,WAAW,YAAY,CAAC;AACtD,YAAI,UAAU,WAAW,WAAW;AAClC,gBAAM,OAAO,GAAG,SAAS,IAAI,MAAM;AACnC,cAAI,CAAC,cAAc,IAAI,IAAI,GAAG;AAC5B,0BAAc,IAAI,IAAI;AACtB,kBAAM,OAAO,KAAK,cAAc,MAAM;AACtC,kBAAM,KAAK;AAAA,cACT,QAAQ;AAAA,cAAW,QAAQ;AAAA,cAAQ,UAAU;AAAA,cAC7C,YAAY;AAAA,cAAY,aAAa;AAAA,cACrC,iBAAiB,IAAI,IAAI;AAAA,cAAI,QAAQ;AAAA,YACvC,CAAC;AAAA,UACH;AAAA,QACF;AAAA,MACF;AAAA,IACF;AACA,eAAW,SAAS,KAAK,UAAU;AACjC,gBAAU,OAAO,SAAS;AAAA,IAC5B;AAAA,EACF;AAEA,aAAW,CAAC,WAAW,QAAQ,KAAK,gBAAgB;AAClD,cAAU,UAAU,SAAS;AAAA,EAC/B;AAEA,QAAM,aAAa,MAAM;AAAA,IAAO,CAAC,MAC/B,QAAQ,IAAI,EAAE,MAAM,MAAM,QAAQ,IAAI,EAAE,MAAM,KAAK,EAAE,aAAa,aAAa,EAAE,aAAa;AAAA,EAChG;AAEA,SAAO,EAAE,OAAO,OAAO,WAAW;AACpC;AAMA,eAAsB,YAAY,UAA6C;AAC7E,QAAM,iBAAiB;AACvB,QAAM,OAAO,MAAM,aAAa,MAAM;AACtC,MAAI,CAAC,MAAM;AACT,WAAO,EAAE,OAAO,CAAC,GAAG,OAAO,CAAC,GAAG,OAAO,iCAAiC;AAAA,EACzE;AAEA,MAAI;AACJ,MAAI;AACJ,MAAI;AACF,UAAM,SAAS,IAAIA,QAAO;AAC1B,WAAO,YAAY,IAAI;AACvB,iBAAS,8BAAa,UAAU,OAAO;AACvC,WAAO,UAAU,QAAQ,MAAM;AAAA,EACjC,SAAS,GAAY;AACnB,WAAO,EAAE,OAAO,CAAC,GAAG,OAAO,CAAC,GAAG,OAAO,OAAO,CAAC,EAAE;AAAA,EAClD;AAEA,QAAM,OAAO,KAAK;AAClB,QAAM,WAAO,4BAAS,cAAU,2BAAQ,QAAQ,CAAC;AACjD,QAAM,UAAU;AAChB,QAAM,QAAqB,CAAC;AAC5B,QAAM,QAAqB,CAAC;AAC5B,QAAM,UAAU,oBAAI,IAAY;AAChC,QAAM,iBAA8C,CAAC;AAErD,WAAS,QAAQ,KAAa,OAAe,MAAoB;AAC/D,QAAI,CAAC,QAAQ,IAAI,GAAG,GAAG;AACrB,cAAQ,IAAI,GAAG;AACf,YAAM,KAAK,EAAE,IAAI,KAAK,OAAO,WAAW,QAAQ,aAAa,SAAS,iBAAiB,IAAI,IAAI,GAAG,CAAC;AAAA,IACrG;AAAA,EACF;AAEA,WAAS,QACP,KAAa,KAAa,UAAkB,MAC5C,aAAuC,aAAa,SAAiB,GAC/D;AACN,UAAM,KAAK,EAAE,QAAQ,KAAK,QAAQ,KAAK,UAAU,YAAY,aAAa,SAAS,iBAAiB,IAAI,IAAI,IAAI,OAAO,CAAC;AAAA,EAC1H;AAEA,QAAM,UAAU,QAAQ,IAAI;AAC5B,UAAQ,aAAS,4BAAS,QAAQ,GAAG,CAAC;AAEtC,WAAS,KAAK,MAAkB,gBAA+B,MAAY;AACzE,UAAM,IAAI,KAAK;AAEf,QAAI,MAAM,iBAAiB;AACzB,YAAM,WAAW,KAAK,kBAAkB,MAAM;AAC9C,UAAI,UAAU;AACZ,cAAM,WAAW,UAAU,UAAU,MAAM;AAC3C,cAAM,OAAO,KAAK,cAAc,MAAM;AACtC,YAAI;AACJ,YAAI,eAAe;AACjB,oBAAU,QAAQ,eAAe,QAAQ;AACzC,kBAAQ,SAAS,IAAI,QAAQ,MAAM,IAAI;AACvC,kBAAQ,eAAe,SAAS,UAAU,IAAI;AAAA,QAChD,OAAO;AACL,oBAAU,QAAQ,MAAM,QAAQ;AAChC,kBAAQ,SAAS,GAAG,QAAQ,MAAM,IAAI;AACtC,kBAAQ,SAAS,SAAS,YAAY,IAAI;AAAA,QAC5C;AACA,cAAM,OAAO,KAAK,kBAAkB,MAAM;AAC1C,YAAI,KAAM,gBAAe,KAAK,CAAC,SAAS,IAAI,CAAC;AAAA,MAC/C;AACA;AAAA,IACF;AAEA,QAAI,MAAM,iBAAiB,MAAM,eAAe,MAAM,cAAc;AAClE,YAAM,WAAW,KAAK,kBAAkB,MAAM;AAC9C,UAAI,UAAU;AACZ,cAAM,WAAW,UAAU,UAAU,MAAM;AAC3C,cAAM,OAAO,KAAK,cAAc,MAAM;AACtC,cAAM,UAAU,QAAQ,MAAM,QAAQ;AACtC,gBAAQ,SAAS,UAAU,IAAI;AAC/B,gBAAQ,SAAS,SAAS,YAAY,IAAI;AAAA,MAC5C;AACA;AAAA,IACF;AAEA,QAAI,MAAM,aAAa;AACrB,YAAM,WAAW,KAAK,kBAAkB,MAAM;AAC9C,UAAI,UAAyB;AAC7B,UAAI,UAAU;AACZ,cAAM,WAAW,UAAU,UAAU,MAAM,EAAE,KAAK;AAClD,kBAAU,QAAQ,MAAM,QAAQ;AAChC,gBAAQ,SAAS,UAAU,KAAK,cAAc,MAAM,CAAC;AAAA,MACvD;AACA,YAAM,OAAO,KAAK,kBAAkB,MAAM;AAC1C,UAAI,MAAM;AACR,mBAAW,SAAS,KAAK,UAAU;AACjC,eAAK,OAAO,OAAO;AAAA,QACrB;AAAA,MACF;AACA;AAAA,IACF;AAEA,QAAI,MAAM,mBAAmB;AAC3B,YAAM,MAAM,KAAK,kBAAkB,UAAU;AAC7C,UAAI,KAAK;AACP,cAAM,MAAM,UAAU,KAAK,MAAM;AACjC,cAAM,QAAQ,IAAI,MAAM,GAAG,EAAE,CAAC,EAAG,QAAQ,OAAO,EAAE,EAAE,QAAQ,OAAO,EAAE,EAAE,QAAQ,OAAO,EAAE;AACxF,cAAM,aAAa,MAAM,MAAM,IAAI,EAAE,IAAI,EAAG,KAAK;AACjD,YAAI,YAAY;AACd,gBAAM,SAAS,QAAQ,UAAU;AACjC,kBAAQ,SAAS,QAAQ,gBAAgB,KAAK,cAAc,MAAM,CAAC;AAAA,QACrE;AAAA,MACF;AACA;AAAA,IACF;AAEA,eAAW,SAAS,KAAK,UAAU;AACjC,WAAK,OAAO,IAAI;AAAA,IAClB;AAAA,EACF;AAEA,OAAK,IAAI;AAGT,QAAM,aAAa,oBAAI,IAAoB;AAC3C,aAAW,KAAK,OAAO;AACrB,UAAM,aAAa,EAAE,MAAM,QAAQ,WAAW,EAAE,EAAE,QAAQ,OAAO,EAAE;AACnE,eAAW,IAAI,WAAW,YAAY,GAAG,EAAE,EAAE;AAAA,EAC/C;AAEA,QAAM,gBAAgB,oBAAI,IAAY;AAEtC,WAAS,UAAU,MAAkB,WAAyB;AAC5D,QAAI,KAAK,SAAS,gBAAiB;AACnC,QAAI,KAAK,SAAS,mBAAmB;AACnC,YAAM,WAAW,KAAK,kBAAkB,UAAU;AAClD,UAAI,aAA4B;AAChC,UAAI,UAAU;AACZ,YAAI,SAAS,SAAS,cAAc;AAClC,uBAAa,UAAU,UAAU,MAAM;AAAA,QACzC,WAAW,SAAS,SAAS,oBAAoB;AAC/C,gBAAM,QAAQ,SAAS,kBAAkB,OAAO;AAChD,cAAI,MAAO,cAAa,UAAU,OAAO,MAAM;AAAA,QACjD,WAAW,SAAS,SAAS,qBAAqB;AAChD,gBAAM,OAAO,SAAS,kBAAkB,MAAM;AAC9C,cAAI,KAAM,cAAa,UAAU,MAAM,MAAM;AAAA,QAC/C;AAAA,MACF;AACA,UAAI,YAAY;AACd,cAAM,SAAS,WAAW,IAAI,WAAW,YAAY,CAAC;AACtD,YAAI,UAAU,WAAW,WAAW;AAClC,gBAAM,OAAO,GAAG,SAAS,IAAI,MAAM;AACnC,cAAI,CAAC,cAAc,IAAI,IAAI,GAAG;AAC5B,0BAAc,IAAI,IAAI;AACtB,kBAAM,OAAO,KAAK,cAAc,MAAM;AACtC,kBAAM,KAAK;AAAA,cACT,QAAQ;AAAA,cAAW,QAAQ;AAAA,cAAQ,UAAU;AAAA,cAC7C,YAAY;AAAA,cAAY,aAAa;AAAA,cACrC,iBAAiB,IAAI,IAAI;AAAA,cAAI,QAAQ;AAAA,YACvC,CAAC;AAAA,UACH;AAAA,QACF;AAAA,MACF;AAAA,IACF;AACA,eAAW,SAAS,KAAK,UAAU;AACjC,gBAAU,OAAO,SAAS;AAAA,IAC5B;AAAA,EACF;AAEA,aAAW,CAAC,WAAW,QAAQ,KAAK,gBAAgB;AAClD,cAAU,UAAU,SAAS;AAAA,EAC/B;AAEA,QAAM,aAAa,MAAM;AAAA,IAAO,CAAC,MAC/B,QAAQ,IAAI,EAAE,MAAM,MAAM,QAAQ,IAAI,EAAE,MAAM,KAAK,EAAE,aAAa,aAAa,EAAE,aAAa;AAAA,EAChG;AAEA,SAAO,EAAE,OAAO,OAAO,WAAW;AACpC;AAMA,eAAsB,WAAW,UAA6C;AAC5E,QAAM,iBAAiB;AACvB,QAAM,OAAO,MAAM,aAAa,KAAK;AACrC,MAAI,CAAC,MAAM;AACT,WAAO,EAAE,OAAO,CAAC,GAAG,OAAO,CAAC,GAAG,OAAO,gCAAgC;AAAA,EACxE;AAEA,MAAI;AACJ,MAAI;AACJ,MAAI;AACF,UAAM,SAAS,IAAIA,QAAO;AAC1B,WAAO,YAAY,IAAI;AACvB,iBAAS,8BAAa,UAAU,OAAO;AACvC,WAAO,UAAU,QAAQ,MAAM;AAAA,EACjC,SAAS,GAAY;AACnB,WAAO,EAAE,OAAO,CAAC,GAAG,OAAO,CAAC,GAAG,OAAO,OAAO,CAAC,EAAE;AAAA,EAClD;AAEA,QAAM,OAAO,KAAK;AAClB,QAAM,WAAO,4BAAS,cAAU,2BAAQ,QAAQ,CAAC;AACjD,QAAM,UAAU;AAChB,QAAM,QAAqB,CAAC;AAC5B,QAAM,QAAqB,CAAC;AAC5B,QAAM,UAAU,oBAAI,IAAY;AAChC,QAAM,iBAA8C,CAAC;AAErD,WAAS,QAAQ,KAAa,OAAe,MAAoB;AAC/D,QAAI,CAAC,QAAQ,IAAI,GAAG,GAAG;AACrB,cAAQ,IAAI,GAAG;AACf,YAAM,KAAK,EAAE,IAAI,KAAK,OAAO,WAAW,QAAQ,aAAa,SAAS,iBAAiB,IAAI,IAAI,GAAG,CAAC;AAAA,IACrG;AAAA,EACF;AAEA,WAAS,QACP,KAAa,KAAa,UAAkB,MAC5C,aAAuC,aAAa,SAAiB,GAC/D;AACN,UAAM,KAAK,EAAE,QAAQ,KAAK,QAAQ,KAAK,UAAU,YAAY,aAAa,SAAS,iBAAiB,IAAI,IAAI,IAAI,OAAO,CAAC;AAAA,EAC1H;AAEA,QAAM,UAAU,QAAQ,IAAI;AAC5B,UAAQ,aAAS,4BAAS,QAAQ,GAAG,CAAC;AAEtC,WAAS,cAAc,MAAwB;AAC7C,eAAW,SAAS,KAAK,UAAU;AACjC,UAAI,MAAM,SAAS,oBAAoB;AACrC,YAAI,KAAoB;AACxB,YAAI,OAA0B;AAC9B,mBAAW,KAAK,MAAM,UAAU;AAC9B,cAAI,EAAE,SAAS,qBAAsB,MAAK,UAAU,GAAG,MAAM;AAAA,mBACpD,EAAE,SAAS,YAAa,QAAO;AAAA,QAC1C;AACA,aAAK,OAAO,aAAa,OAAO,eAAe,MAAM;AACnD,qBAAW,OAAO,KAAK,UAAU;AAC/B,gBAAI,IAAI,SAAS,oBAAoB,IAAI,SAAS,UAAU;AAC1D,oBAAM,MAAM,UAAU,KAAK,MAAM,EAAE,QAAQ,UAAU,EAAE;AACvD,oBAAM,aAAa,IAAI,MAAM,GAAG,EAAE,IAAI,EAAG,MAAM,GAAG,EAAE,CAAC;AACrD,kBAAI,YAAY;AACd,sBAAM,SAAS,QAAQ,UAAU;AACjC,wBAAQ,SAAS,QAAQ,gBAAgB,KAAK,cAAc,MAAM,CAAC;AAAA,cACrE;AACA;AAAA,YACF;AAAA,UACF;AAAA,QACF;AAAA,MACF,WAAW,MAAM,SAAS,oBAAoB;AAC5C,sBAAc,KAAK;AACnB;AAAA,MACF;AAAA,IACF;AAAA,EACF;AAEA,WAAS,KAAK,MAAkB,kBAAiC,MAAY;AAC3E,UAAM,IAAI,KAAK;AAEf,QAAI,MAAM,wBAAwB;AAChC,YAAM,WAAW,KAAK,kBAAkB,MAAM;AAC9C,UAAI,UAAU;AACZ,cAAM,WAAW,UAAU,UAAU,MAAM;AAC3C,cAAM,OAAO,KAAK,cAAc,MAAM;AACtC,YAAI;AACJ,YAAI,iBAAiB;AACnB,oBAAU,QAAQ,iBAAiB,QAAQ;AAC3C,kBAAQ,SAAS,IAAI,QAAQ,MAAM,IAAI;AACvC,kBAAQ,iBAAiB,SAAS,UAAU,IAAI;AAAA,QAClD,OAAO;AACL,oBAAU,QAAQ,MAAM,QAAQ;AAChC,kBAAQ,SAAS,GAAG,QAAQ,MAAM,IAAI;AACtC,kBAAQ,SAAS,SAAS,YAAY,IAAI;AAAA,QAC5C;AACA,cAAM,OAAO,KAAK,kBAAkB,MAAM;AAC1C,YAAI,KAAM,gBAAe,KAAK,CAAC,SAAS,IAAI,CAAC;AAAA,MAC/C;AACA;AAAA,IACF;AAEA,QAAI,MAAM,wBAAwB;AAChC,UAAI,WAA8B;AAClC,UAAI,YAA+B;AACnC,iBAAW,SAAS,KAAK,UAAU;AACjC,YAAI,MAAM,SAAS,cAAc;AAC/B,qBAAW;AAAA,QACb,WAAW,CAAC,sBAAsB,oBAAoB,qBAAqB,oBAAoB,kBAAkB,EAAE,SAAS,MAAM,IAAI,GAAG;AACvI,sBAAY;AAAA,QACd;AAAA,MACF;AAEA,UAAI,aAAa,UAAU,SAAS,sBAAsB;AACxD,YAAI,UAAU;AACZ,gBAAM,aAAa,UAAU,UAAU,MAAM;AAC7C,gBAAM,OAAO,KAAK,cAAc,MAAM;AACtC,gBAAM,YAAY,QAAQ,MAAM,UAAU;AAC1C,kBAAQ,WAAW,YAAY,IAAI;AACnC,kBAAQ,SAAS,WAAW,YAAY,IAAI;AAC5C,qBAAW,SAAS,UAAU,UAAU;AACtC,iBAAK,OAAO,SAAS;AAAA,UACvB;AAAA,QACF;AACA;AAAA,MACF;AAEA,UAAI,cAAc,UAAU,SAAS,sBAAsB,UAAU,SAAS,sBAAsB;AAClG,YAAI,UAAU;AACZ,gBAAM,WAAW,UAAU,UAAU,MAAM;AAC3C,gBAAM,OAAO,KAAK,cAAc,MAAM;AACtC,gBAAM,UAAU,QAAQ,MAAM,QAAQ;AACtC,kBAAQ,SAAS,UAAU,IAAI;AAC/B,kBAAQ,SAAS,SAAS,YAAY,IAAI;AAAA,QAC5C;AACA;AAAA,MACF;AAEA,UAAI,cAAc,UAAU,SAAS,sBAAsB,UAAU,SAAS,qBAAqB;AACjG,sBAAc,IAAI;AAAA,MACpB;AACA;AAAA,IACF;AAEA,eAAW,SAAS,KAAK,UAAU;AACjC,WAAK,OAAO,eAAe;AAAA,IAC7B;AAAA,EACF;AAEA,OAAK,IAAI;AAGT,QAAM,gBAAgB,oBAAI,IAAY;AAEtC,WAAS,UAAU,MAAkB,WAAyB;AAC5D,QAAI,KAAK,SAAS,uBAAwB;AAC1C,QAAI,KAAK,SAAS,mBAAmB;AACnC,YAAM,KAAK,KAAK,kBAAkB,UAAU;AAC5C,UAAI,IAAI;AACN,cAAM,SAAS,UAAU,IAAI,MAAM,EAAE,MAAM,GAAG,EAAE,IAAI;AACpD,cAAM,SAAS,MAAM;AAAA,UACnB,CAAC,MAAM,EAAE,UAAU,GAAG,MAAM,QAAQ,EAAE,UAAU,IAAI,MAAM;AAAA,QAC5D,GAAG,MAAM;AACT,YAAI,UAAU,WAAW,WAAW;AAClC,gBAAM,OAAO,GAAG,SAAS,IAAI,MAAM;AACnC,cAAI,CAAC,cAAc,IAAI,IAAI,GAAG;AAC5B,0BAAc,IAAI,IAAI;AACtB,oBAAQ,WAAW,QAAQ,SAAS,KAAK,cAAc,MAAM,GAAG,YAAY,GAAG;AAAA,UACjF;AAAA,QACF;AAAA,MACF;AAAA,IACF;AACA,eAAW,SAAS,KAAK,UAAU;AACjC,gBAAU,OAAO,SAAS;AAAA,IAC5B;AAAA,EACF;AAEA,aAAW,CAAC,WAAW,QAAQ,KAAK,gBAAgB;AAClD,cAAU,UAAU,SAAS;AAAA,EAC/B;AAEA,QAAM,aAAa,MAAM;AAAA,IAAO,CAAC,MAC/B,QAAQ,IAAI,EAAE,MAAM,MAAM,QAAQ,IAAI,EAAE,MAAM,KAAK,EAAE,aAAa;AAAA,EACpE;AAEA,SAAO,EAAE,OAAO,OAAO,WAAW;AACpC;AAMA,eAAsB,kBAAkB,UAA6C;AACnF,QAAM,iBAAiB;AACvB,QAAM,OAAO,MAAM,aAAa,YAAY;AAC5C,MAAI,CAAC,MAAM;AACT,WAAO,EAAE,OAAO,CAAC,GAAG,OAAO,CAAC,GAAG,OAAO,uCAAuC;AAAA,EAC/E;AAEA,MAAI;AACJ,MAAI;AACJ,MAAI;AACF,UAAM,SAAS,IAAIA,QAAO;AAC1B,WAAO,YAAY,IAAI;AACvB,iBAAS,8BAAa,UAAU,OAAO;AACvC,WAAO,UAAU,QAAQ,MAAM;AAAA,EACjC,SAAS,GAAY;AACnB,WAAO,EAAE,OAAO,CAAC,GAAG,OAAO,CAAC,GAAG,OAAO,OAAO,CAAC,EAAE;AAAA,EAClD;AAEA,QAAM,OAAO,KAAK;AAClB,QAAM,WAAO,4BAAS,cAAU,2BAAQ,QAAQ,CAAC;AACjD,QAAM,UAAU;AAChB,QAAM,QAAqB,CAAC;AAC5B,QAAM,QAAqB,CAAC;AAC5B,QAAM,UAAU,oBAAI,IAAY;AAChC,QAAM,iBAA8C,CAAC;AAErD,WAAS,QAAQ,KAAa,OAAe,MAAoB;AAC/D,QAAI,CAAC,QAAQ,IAAI,GAAG,GAAG;AACrB,cAAQ,IAAI,GAAG;AACf,YAAM,KAAK,EAAE,IAAI,KAAK,OAAO,WAAW,QAAQ,aAAa,SAAS,iBAAiB,IAAI,IAAI,GAAG,CAAC;AAAA,IACrG;AAAA,EACF;AAEA,WAAS,QACP,KAAa,KAAa,UAAkB,MAC5C,aAAuC,aAAa,SAAiB,GAC/D;AACN,UAAM,KAAK,EAAE,QAAQ,KAAK,QAAQ,KAAK,UAAU,YAAY,aAAa,SAAS,iBAAiB,IAAI,IAAI,IAAI,OAAO,CAAC;AAAA,EAC1H;AAEA,QAAM,UAAU,QAAQ,IAAI;AAC5B,UAAQ,aAAS,4BAAS,QAAQ,GAAG,CAAC;AAEtC,QAAM,WAAW,oBAAI,IAAI;AAAA,IACvB;AAAA,IAAS;AAAA,IAAU;AAAA,IAAM;AAAA,IAAQ;AAAA,IAAU;AAAA,IAAW;AAAA,IACtD;AAAA,IAAS;AAAA,IAAM;AAAA,IAAU;AAAA,IAAO;AAAA,IAAS;AAAA,IAAW;AAAA,IACpD;AAAA,IAAS;AAAA,IAAY;AAAA,IAAQ;AAAA,IAAS;AAAA,IAAS;AAAA,IAAW;AAAA,EAC5D,CAAC;AAED,WAAS,oBAAoB,MAAqC;AAChE,eAAW,SAAS,KAAK,UAAU;AACjC,UAAI,MAAM,SAAS,gBAAgB;AACjC,mBAAW,MAAM,MAAM,UAAU;AAC/B,cAAI,GAAG,SAAS,oBAAqB,QAAO;AAAA,QAC9C;AACA,eAAO;AAAA,MACT;AAAA,IACF;AACA,WAAO;AAAA,EACT;AAEA,WAAS,KAAK,MAAkB,iBAAgC,MAAY;AAC1E,UAAM,IAAI,KAAK;AAEf,QAAI,MAAM,sBAAsB;AAC9B,YAAM,WAAW,KAAK,SAAS,KAAK,CAAC,MAAM,EAAE,SAAS,eAAe,KAAK;AAC1E,UAAI,UAAU;AACZ,cAAM,WAAW,UAAU,UAAU,MAAM;AAC3C,cAAM,OAAO,KAAK,cAAc,MAAM;AACtC,cAAM,UAAU,QAAQ,MAAM,QAAQ;AACtC,gBAAQ,SAAS,GAAG,QAAQ,MAAM,IAAI;AACtC,gBAAQ,SAAS,SAAS,YAAY,IAAI;AAC1C,cAAM,OAAO,oBAAoB,IAAI;AACrC,YAAI,KAAM,gBAAe,KAAK,CAAC,SAAS,IAAI,CAAC;AAAA,MAC/C;AACA;AAAA,IACF;AAEA,QAAI,MAAM,mBAAmB;AAC3B,YAAM,WAAW,KAAK,SAAS,KAAK,CAAC,MAAM,EAAE,SAAS,aAAa,KAAK;AACxE,UAAI,UAAU;AACZ,cAAM,YAAY,UAAU,UAAU,MAAM;AAC5C,cAAM,OAAO,KAAK,cAAc,MAAM;AACtC,cAAM,WAAW,QAAQ,MAAM,SAAS;AACxC,gBAAQ,UAAU,WAAW,IAAI;AACjC,gBAAQ,SAAS,UAAU,YAAY,IAAI;AAC3C,mBAAW,SAAS,KAAK,UAAU;AACjC,eAAK,OAAO,QAAQ;AAAA,QACtB;AAAA,MACF;AACA;AAAA,IACF;AAEA,QAAI,MAAM,2BAA2B;AACnC,YAAM,WAAW,KAAK,SAAS,KAAK,CAAC,MAAM,EAAE,SAAS,aAAa,KAAK;AACxE,UAAI,UAAU;AACZ,cAAM,aAAa,UAAU,UAAU,MAAM;AAC7C,cAAM,OAAO,KAAK,cAAc,MAAM;AACtC,YAAI;AACJ,YAAI,gBAAgB;AAClB,sBAAY,QAAQ,gBAAgB,UAAU;AAC9C,kBAAQ,WAAW,IAAI,UAAU,MAAM,IAAI;AAC3C,kBAAQ,gBAAgB,WAAW,UAAU,IAAI;AAAA,QACnD,OAAO;AACL,sBAAY,QAAQ,MAAM,UAAU;AACpC,kBAAQ,WAAW,GAAG,UAAU,MAAM,IAAI;AAC1C,kBAAQ,SAAS,WAAW,YAAY,IAAI;AAAA,QAC9C;AACA,cAAM,OAAO,oBAAoB,IAAI;AACrC,YAAI,KAAM,gBAAe,KAAK,CAAC,WAAW,IAAI,CAAC;AAAA,MACjD;AACA;AAAA,IACF;AAEA,QAAI,MAAM,WAAW;AACnB,YAAM,cAAc,KAAK,SAAS,KAAK,CAAC,MAAM,EAAE,SAAS,cAAc,KAAK;AAC5E,UAAI,aAAa;AACf,cAAM,UAAU,UAAU,aAAa,MAAM,EAAE,YAAY;AAC3D,YAAI,YAAY,SAAS;AACvB,gBAAM,SAAmB,CAAC;AAC1B,qBAAW,SAAS,KAAK,UAAU;AACjC,gBAAI,MAAM,SAAS,oBAAoB;AACrC,yBAAW,MAAM,MAAM,UAAU;AAC/B,oBAAI,GAAG,SAAS,iBAAiB;AAC/B,yBAAO,KAAK,UAAU,IAAI,MAAM,CAAC;AAAA,gBACnC;AAAA,cACF;AAAA,YACF;AAAA,UACF;AACA,gBAAM,eAAe,OAAO;AAAA,YAC1B,CAAC,OAAO,CAAC,CAAC,aAAa,UAAU,UAAU,EAAE,SAAS,GAAG,YAAY,CAAC;AAAA,UACxE;AACA,cAAI,aAAa,SAAS,GAAG;AAC3B,kBAAM,aAAa,aAAa,aAAa,SAAS,CAAC,EAAG,MAAM,GAAG,EAAE,IAAI;AACzE,oBAAQ,SAAS,QAAQ,UAAU,GAAG,gBAAgB,KAAK,cAAc,MAAM,CAAC;AAAA,UAClF;AAAA,QACF;AAAA,MACF;AACA;AAAA,IACF;AAEA,eAAW,SAAS,KAAK,UAAU;AACjC,WAAK,OAAO,cAAc;AAAA,IAC5B;AAAA,EACF;AAEA,OAAK,IAAI;AAGT,QAAM,aAAa,oBAAI,IAAoB;AAC3C,aAAW,KAAK,OAAO;AACrB,UAAM,aAAa,EAAE,MAAM,QAAQ,WAAW,EAAE,EAAE,QAAQ,OAAO,EAAE;AACnE,eAAW,IAAI,WAAW,YAAY,GAAG,EAAE,EAAE;AAAA,EAC/C;AAEA,QAAM,gBAAgB,oBAAI,IAAY;AAEtC,WAAS,UAAU,MAAkB,WAAyB;AAC5D,QAAI,KAAK,SAAS,wBAAwB,KAAK,SAAS,kBAAmB;AAC3E,QAAI,KAAK,SAAS,WAAW;AAC3B,YAAM,cAAc,KAAK,SAAS,KAAK,CAAC,MAAM,EAAE,SAAS,cAAc,KAAK;AAC5E,UAAI,aAAa;AACf,cAAM,UAAU,UAAU,aAAa,MAAM;AAC7C,YAAI,CAAC,SAAS,IAAI,QAAQ,YAAY,CAAC,GAAG;AACxC,gBAAM,SAAS,WAAW,IAAI,QAAQ,YAAY,CAAC;AACnD,cAAI,UAAU,WAAW,WAAW;AAClC,kBAAM,OAAO,GAAG,SAAS,IAAI,MAAM;AACnC,gBAAI,CAAC,cAAc,IAAI,IAAI,GAAG;AAC5B,4BAAc,IAAI,IAAI;AACtB,sBAAQ,WAAW,QAAQ,SAAS,KAAK,cAAc,MAAM,GAAG,YAAY,GAAG;AAAA,YACjF;AAAA,UACF;AAAA,QACF;AAAA,MACF;AAAA,IACF;AACA,eAAW,SAAS,KAAK,UAAU;AACjC,gBAAU,OAAO,SAAS;AAAA,IAC5B;AAAA,EACF;AAEA,aAAW,CAAC,WAAW,QAAQ,KAAK,gBAAgB;AAClD,cAAU,UAAU,SAAS;AAAA,EAC/B;AAEA,QAAM,aAAa,MAAM;AAAA,IAAO,CAAC,MAC/B,QAAQ,IAAI,EAAE,MAAM,MAAM,QAAQ,IAAI,EAAE,MAAM,KAAK,EAAE,aAAa;AAAA,EACpE;AAEA,SAAO,EAAE,OAAO,OAAO,WAAW;AACpC;AAMA,eAAsB,YAAY,UAA6C;AAC7E,QAAM,iBAAiB;AACvB,QAAM,OAAO,MAAM,aAAa,MAAM;AACtC,MAAI,CAAC,MAAM;AACT,WAAO,EAAE,OAAO,CAAC,GAAG,OAAO,CAAC,GAAG,OAAO,iCAAiC;AAAA,EACzE;AAEA,MAAI;AACJ,MAAI;AACJ,MAAI;AACF,UAAM,SAAS,IAAIA,QAAO;AAC1B,WAAO,YAAY,IAAI;AACvB,iBAAS,8BAAa,UAAU,OAAO;AACvC,WAAO,UAAU,QAAQ,MAAM;AAAA,EACjC,SAAS,GAAY;AACnB,WAAO,EAAE,OAAO,CAAC,GAAG,OAAO,CAAC,GAAG,OAAO,OAAO,CAAC,EAAE;AAAA,EAClD;AAEA,QAAM,OAAO,KAAK;AAClB,QAAM,WAAO,4BAAS,cAAU,2BAAQ,QAAQ,CAAC;AACjD,QAAM,UAAU;AAChB,QAAM,QAAqB,CAAC;AAC5B,QAAM,QAAqB,CAAC;AAC5B,QAAM,UAAU,oBAAI,IAAY;AAChC,QAAM,eAA4C,CAAC;AAEnD,WAAS,QAAQ,KAAa,OAAe,MAAoB;AAC/D,QAAI,CAAC,QAAQ,IAAI,GAAG,GAAG;AACrB,cAAQ,IAAI,GAAG;AACf,YAAM,KAAK,EAAE,IAAI,KAAK,OAAO,WAAW,QAAQ,aAAa,SAAS,iBAAiB,IAAI,IAAI,GAAG,CAAC;AAAA,IACrG;AAAA,EACF;AAEA,WAAS,QACP,KAAa,KAAa,UAAkB,MAC5C,aAAuC,aAAa,SAAiB,GAC/D;AACN,UAAM,KAAK,EAAE,QAAQ,KAAK,QAAQ,KAAK,UAAU,YAAY,aAAa,SAAS,iBAAiB,IAAI,IAAI,IAAI,OAAO,CAAC;AAAA,EAC1H;AAEA,QAAM,UAAU,QAAQ,IAAI;AAC5B,UAAQ,aAAS,4BAAS,QAAQ,GAAG,CAAC;AAEtC,WAAS,MAAM,MAA0B;AACvC,WAAO,OAAO,MAAM,KAAK,YAAY,KAAK,QAAQ;AAAA,EACpD;AAEA,WAAS,KAAK,MAAkB,YAA2B,MAAY;AACrE,UAAM,IAAI,KAAK;AACf,UAAM,OAAO,KAAK,cAAc,MAAM;AAEtC,QAAI,MAAM,mBAAmB;AAC3B,iBAAW,SAAS,KAAK,UAAU;AACjC,YAAI,MAAM,SAAS,qBAAqB;AACtC,gBAAM,MAAM,MAAM,KAAK,EAAE,QAAQ,kBAAkB,EAAE;AACrD,gBAAMC,UAAS,IAAI,MAAM,GAAG,EAAE,IAAI,EAAG,QAAQ,MAAM,EAAE;AACrD,cAAIA,SAAQ;AACV,kBAAM,SAAS,QAAQA,OAAM;AAC7B,oBAAQ,SAAS,QAAQ,WAAW,IAAI;AAAA,UAC1C;AAAA,QACF,WAAW,MAAM,SAAS,kBAAkB;AAC1C,qBAAW,OAAO,MAAM,UAAU;AAChC,gBAAI,IAAI,SAAS,kBAAkB;AACjC,oBAAM,MAAM,MAAM,GAAG;AACrB,oBAAMA,UAAS,IAAI,MAAM,GAAG,EAAE,IAAI,EAAG,QAAQ,MAAM,EAAE;AACrD,kBAAIA,SAAQ;AACV,sBAAM,SAAS,QAAQA,OAAM;AAC7B,wBAAQ,SAAS,QAAQ,WAAW,IAAI;AAAA,cAC1C;AAAA,YACF;AAAA,UACF;AAAA,QACF;AAAA,MACF;AACA;AAAA,IACF;AAEA,QAAI,MAAM,mBAAmB;AAC3B,YAAM,cAAc,KAAK,SAAS,OAAO,CAAC,MAAM,EAAE,SAAS,YAAY;AACvE,UAAI,YAAY,WAAW,GAAG;AAC5B,mBAAW,SAAS,KAAK,SAAU,MAAK,OAAO,SAAS;AACxD;AAAA,MACF;AACA,YAAM,OAAO,MAAM,YAAY,CAAC,CAAE;AAClC,YAAM,SAAS,QAAQ,MAAM,IAAI;AACjC,cAAQ,QAAQ,MAAM,IAAI;AAC1B,cAAQ,SAAS,QAAQ,YAAY,IAAI;AAEzC,UAAI,YAAY;AAChB,iBAAW,SAAS,KAAK,UAAU;AACjC,YAAI,MAAM,SAAS,KAAK;AACtB,sBAAY;AAAA,QACd,WAAW,aAAa,MAAM,SAAS,cAAc;AACnD,gBAAM,WAAW,QAAQ,MAAM,KAAK,CAAC;AACrC,kBAAQ,QAAQ,UAAU,YAAY,IAAI;AAC1C,sBAAY;AAAA,QACd,WAAW,MAAM,SAAS,2BAA2B;AACnD,qBAAW,OAAO,MAAM,UAAU;AAChC,gBAAI,IAAI,SAAS,aAAa;AAC5B,yBAAW,KAAK,IAAI,UAAU;AAC5B,oBAAI,EAAE,SAAS,mBAAmB;AAChC,wBAAM,WAAW,QAAQ,MAAM,CAAC,CAAC;AACjC,0BAAQ,QAAQ,UAAU,WAAW,IAAI;AAAA,gBAC3C;AAAA,cACF;AAAA,YACF;AAAA,UACF;AAAA,QACF,WAAW,MAAM,SAAS,sBAAsB;AAC9C,eAAK,OAAO,MAAM;AAAA,QACpB;AAAA,MACF;AACA;AAAA,IACF;AAEA,QAAI,MAAM,wBAAwB;AAChC,UAAI,OAAsB;AAC1B,iBAAW,SAAS,KAAK,UAAU;AACjC,YAAI,MAAM,SAAS,cAAc;AAAE,iBAAO,MAAM,KAAK;AAAG;AAAA,QAAO;AAAA,MACjE;AACA,UAAI,CAAC,MAAM;AACT,mBAAW,SAAS,KAAK,SAAU,MAAK,OAAO,SAAS;AACxD;AAAA,MACF;AACA,YAAM,UAAU,QAAQ,MAAM,IAAI;AAClC,UAAI,CAAC,QAAQ,IAAI,OAAO,GAAG;AACzB,gBAAQ,SAAS,MAAM,IAAI;AAC3B,gBAAQ,SAAS,SAAS,YAAY,IAAI;AAAA,MAC5C;AACA,iBAAW,SAAS,KAAK,UAAU;AACjC,YAAI,MAAM,SAAS,6BAA6B;AAC9C,qBAAW,OAAO,MAAM,SAAU,MAAK,KAAK,OAAO;AAAA,QACrD;AAAA,MACF;AACA;AAAA,IACF;AAEA,QAAI,MAAM,wBAAwB;AAChC,UAAI,OAAsB;AAC1B,iBAAW,SAAS,KAAK,UAAU;AACjC,YAAI,MAAM,SAAS,cAAc;AAAE,iBAAO,MAAM,KAAK;AAAG;AAAA,QAAO;AAAA,MACjE;AACA,UAAI,MAAM;AACR,cAAM,WAAW,QAAQ,MAAM,IAAI;AACnC,gBAAQ,UAAU,IAAI,IAAI,KAAK,IAAI;AACnC,gBAAQ,SAAS,UAAU,YAAY,IAAI;AAC3C,mBAAW,SAAS,KAAK,SAAU,MAAK,OAAO,QAAQ;AAAA,MACzD;AACA;AAAA,IACF;AAEA,QAAI,MAAM,wBAAwB,MAAM,qBAAqB;AAC3D,YAAM,YAAY,aAAa;AAC/B,YAAM,QAAkB,CAAC;AACzB,iBAAW,SAAS,KAAK,UAAU;AACjC,YAAI,MAAM,SAAS,cAAc;AAC/B,gBAAM,KAAK,MAAM,KAAK,CAAC;AAAA,QACzB;AAAA,MACF;AACA,YAAM,aAAa,MAAM,KAAK,EAAE,KAAK;AACrC,UAAI,YAAY;AACd,cAAM,YAAY,QAAQ,WAAW,UAAU;AAC/C,gBAAQ,WAAW,IAAI,UAAU,IAAI,IAAI;AACzC,gBAAQ,WAAW,WAAW,UAAU,IAAI;AAC5C,YAAI,MAAM,qBAAqB;AAC7B,uBAAa,KAAK,CAAC,WAAW,IAAI,CAAC;AAAA,QACrC;AAAA,MACF;AACA;AAAA,IACF;AAEA,eAAW,SAAS,KAAK,UAAU;AACjC,WAAK,OAAO,SAAS;AAAA,IACvB;AAAA,EACF;AAEA,OAAK,IAAI;AAGT,QAAM,gBAAgB,IAAI,IAAI,MAAM,OAAO,CAAC,MAAM,EAAE,OAAO,OAAO,EAAE,IAAI,CAAC,MAAM,EAAE,EAAE,CAAC;AACpF,QAAM,YAAY,oBAAI,IAAY;AAElC,aAAW,CAAC,WAAW,QAAQ,KAAK,cAAc;AAChD,QAAS,gBAAT,SAAuB,GAAqB;AAC1C,UAAI,EAAE,SAAS,sBAAsB;AACnC,mBAAW,SAAS,EAAE,UAAU;AAC9B,cAAI,MAAM,SAAS,cAAc,MAAM,SAAS,yBAAyB;AACvE,kBAAM,MAAgB,CAAC;AACvB,gBAAI,MAAM,SAAS,YAAY;AAC7B,kBAAI,KAAK,MAAM,KAAK,CAAC;AAAA,YACvB,OAAO;AACL,yBAAW,OAAO,MAAM,UAAU;AAChC,oBAAI,IAAI,SAAS,oBAAoB;AACnC,6BAAW,KAAK,IAAI,UAAU;AAC5B,wBAAI,EAAE,SAAS,WAAY,KAAI,KAAK,MAAM,CAAC,CAAC;AAAA,kBAC9C;AAAA,gBACF;AAAA,cACF;AAAA,YACF;AACA,kBAAM,aAAa,IAAI,KAAK,EAAE;AAC9B,uBAAW,aAAa,eAAe;AACrC,kBAAI,UAAU,SAAS,QAAQ,IAAI,UAAU,EAAE,QAAQ,MAAM,EAAE,CAAC,GAAG;AACjE,sBAAM,OAAO,GAAG,SAAS,IAAI,SAAS;AACtC,oBAAI,CAAC,UAAU,IAAI,IAAI,KAAK,cAAc,WAAW;AACnD,4BAAU,IAAI,IAAI;AAClB,0BAAQ,WAAW,WAAW,SAAS,SAAS,cAAc,MAAM,GAAG,YAAY,GAAG;AAAA,gBACxF;AAAA,cACF;AAAA,YACF;AAAA,UACF;AAAA,QACF;AAAA,MACF;AACA,iBAAW,SAAS,EAAE,UAAU;AAC9B,sBAAc,KAAK;AAAA,MACrB;AAAA,IACF;AACA,kBAAc,QAAQ;AAAA,EACxB;AAEA,SAAO,EAAE,OAAO,OAAO,OAAO,OAAU;AAC1C;AAMA,eAAsB,cAAc,UAA6C;AAC/E,QAAM,iBAAiB;AACvB,QAAM,OAAO,MAAM,aAAa,QAAQ;AACxC,MAAI,CAAC,MAAM;AACT,WAAO,EAAE,OAAO,CAAC,GAAG,OAAO,CAAC,GAAG,OAAO,mCAAmC;AAAA,EAC3E;AAEA,MAAI;AACJ,MAAI;AACJ,MAAI;AACF,UAAM,SAAS,IAAID,QAAO;AAC1B,WAAO,YAAY,IAAI;AACvB,iBAAS,8BAAa,UAAU,OAAO;AACvC,WAAO,UAAU,QAAQ,MAAM;AAAA,EACjC,SAAS,GAAY;AACnB,WAAO,EAAE,OAAO,CAAC,GAAG,OAAO,CAAC,GAAG,OAAO,OAAO,CAAC,EAAE;AAAA,EAClD;AAEA,QAAM,OAAO,KAAK;AAClB,QAAM,WAAO,4BAAS,cAAU,2BAAQ,QAAQ,CAAC;AACjD,QAAM,UAAU;AAChB,QAAM,QAAqB,CAAC;AAC5B,QAAM,QAAqB,CAAC;AAC5B,QAAM,UAAU,oBAAI,IAAY;AAChC,QAAM,iBAA8C,CAAC;AAErD,WAAS,QAAQ,KAAa,OAAe,MAAoB;AAC/D,QAAI,CAAC,QAAQ,IAAI,GAAG,GAAG;AACrB,cAAQ,IAAI,GAAG;AACf,YAAM,KAAK,EAAE,IAAI,KAAK,OAAO,WAAW,QAAQ,aAAa,SAAS,iBAAiB,IAAI,IAAI,GAAG,CAAC;AAAA,IACrG;AAAA,EACF;AAEA,WAAS,QACP,KAAa,KAAa,UAAkB,MAC5C,aAAuC,aAAa,SAAiB,GAC/D;AACN,UAAM,KAAK,EAAE,QAAQ,KAAK,QAAQ,KAAK,UAAU,YAAY,aAAa,SAAS,iBAAiB,IAAI,IAAI,IAAI,OAAO,CAAC;AAAA,EAC1H;AAEA,QAAM,UAAU,QAAQ,IAAI;AAC5B,UAAQ,aAAS,4BAAS,QAAQ,GAAG,CAAC;AAEtC,QAAM,mBAAmB,oBAAI,IAAI,CAAC,SAAS,UAAU,WAAW,KAAK,CAAC;AAEtE,WAAS,aAAa,MAAiC;AACrD,eAAW,SAAS,KAAK,UAAU;AACjC,UAAI,MAAM,SAAS,SAAS;AAC1B,eAAO,OAAO,MAAM,MAAM,YAAY,MAAM,QAAQ;AAAA,MACtD;AAAA,IACF;AACA,WAAO;AAAA,EACT;AAEA,WAAS,KAAK,MAAkB,kBAAiC,MAAY;AAC3E,QAAI,KAAK,SAAS,QAAQ;AACxB,iBAAW,SAAS,KAAK,SAAU,MAAK,OAAO,eAAe;AAC9D;AAAA,IACF;AAEA,QAAI,iBAAoC;AACxC,QAAI,gBAAmC;AACvC,QAAI,cAAiC;AACrC,eAAW,SAAS,KAAK,UAAU;AACjC,UAAI,MAAM,SAAS,aAAc,kBAAiB;AAAA,eACzC,MAAM,SAAS,YAAa,iBAAgB;AAAA,eAC5C,MAAM,SAAS,WAAY,eAAc;AAAA,IACpD;AAEA,QAAI,CAAC,gBAAgB;AACnB,iBAAW,SAAS,KAAK,SAAU,MAAK,OAAO,eAAe;AAC9D;AAAA,IACF;AAEA,UAAM,UAAU,OAAO,MAAM,eAAe,YAAY,eAAe,QAAQ;AAC/E,UAAM,OAAO,KAAK,cAAc,MAAM;AAEtC,QAAI,YAAY,aAAa;AAC3B,YAAM,aAAa,gBAAgB,aAAa,aAAa,IAAI;AACjE,UAAI,CAAC,WAAY;AACjB,YAAM,YAAY,QAAQ,MAAM,UAAU;AAC1C,cAAQ,WAAW,YAAY,IAAI;AACnC,cAAQ,SAAS,WAAW,YAAY,IAAI;AAC5C,UAAI,aAAa;AACf,mBAAW,SAAS,YAAY,SAAU,MAAK,OAAO,SAAS;AAAA,MACjE;AACA;AAAA,IACF;AAEA,QAAI,YAAY,SAAS,YAAY,QAAQ;AAC3C,UAAI,WAA0B;AAC9B,UAAI,eAAe;AACjB,mBAAW,SAAS,cAAc,UAAU;AAC1C,cAAI,MAAM,SAAS,QAAQ;AACzB,uBAAW,OAAO,MAAM,UAAU;AAChC,kBAAI,IAAI,SAAS,cAAc;AAC7B,2BAAW,OAAO,MAAM,IAAI,YAAY,IAAI,QAAQ;AACpD;AAAA,cACF;AAAA,YACF;AAAA,UACF,WAAW,MAAM,SAAS,cAAc;AACtC,uBAAW,OAAO,MAAM,MAAM,YAAY,MAAM,QAAQ;AACxD;AAAA,UACF;AAAA,QACF;AAAA,MACF;AACA,UAAI,CAAC,SAAU;AACf,YAAM,YAAY,mBAAmB;AACrC,YAAM,UAAU,QAAQ,WAAW,QAAQ;AAC3C,cAAQ,SAAS,GAAG,QAAQ,MAAM,IAAI;AACtC,UAAI,iBAAiB;AACnB,gBAAQ,iBAAiB,SAAS,UAAU,IAAI;AAAA,MAClD,OAAO;AACL,gBAAQ,SAAS,SAAS,YAAY,IAAI;AAAA,MAC5C;AACA,UAAI,aAAa;AACf,uBAAe,KAAK,CAAC,SAAS,WAAW,CAAC;AAAA,MAC5C;AACA;AAAA,IACF;AAEA,QAAI,iBAAiB,IAAI,OAAO,KAAK,eAAe;AAClD,YAAM,aAAa,aAAa,aAAa;AAC7C,UAAI,YAAY;AACd,cAAM,SAAS,QAAQ,UAAU;AACjC,gBAAQ,SAAS,QAAQ,WAAW,IAAI;AAAA,MAC1C;AACA;AAAA,IACF;AAEA,eAAW,SAAS,KAAK,SAAU,MAAK,OAAO,eAAe;AAAA,EAChE;AAEA,OAAK,IAAI;AAGT,QAAM,aAAa,oBAAI,IAAoB;AAC3C,aAAW,KAAK,OAAO;AACrB,UAAM,aAAa,EAAE,MAAM,QAAQ,WAAW,EAAE,EAAE,QAAQ,OAAO,EAAE;AACnE,eAAW,IAAI,WAAW,YAAY,GAAG,EAAE,EAAE;AAAA,EAC/C;AAEA,QAAM,gBAAgB,oBAAI,IAAY;AACtC,QAAM,iBAAiB,oBAAI,IAAI;AAAA,IAC7B;AAAA,IAAO;AAAA,IAAQ;AAAA,IAAa;AAAA,IAAY;AAAA,IACxC;AAAA,IAAa;AAAA,IAAe;AAAA,IAAW;AAAA,IACvC;AAAA,IAAS;AAAA,IAAU;AAAA,IAAW;AAAA,IAC9B;AAAA,IAAM;AAAA,IAAU;AAAA,IAAQ;AAAA,IAAQ;AAAA,IAAQ;AAAA,EAC1C,CAAC;AAED,WAAS,UAAU,MAAkB,WAAyB;AAC5D,QAAI,KAAK,SAAS,QAAQ;AACxB,iBAAW,SAAS,KAAK,SAAU,WAAU,OAAO,SAAS;AAC7D;AAAA,IACF;AACA,eAAW,SAAS,KAAK,UAAU;AACjC,UAAI,MAAM,SAAS,cAAc;AAC/B,cAAM,KAAK,OAAO,MAAM,MAAM,YAAY,MAAM,QAAQ;AACxD,YAAI,eAAe,IAAI,EAAE,GAAG;AAC1B,qBAAW,KAAK,KAAK,SAAU,WAAU,GAAG,SAAS;AACrD;AAAA,QACF;AACA;AAAA,MACF;AAAA,IACF;AACA,QAAI,aAA4B;AAChC,eAAW,SAAS,KAAK,UAAU;AACjC,UAAI,MAAM,SAAS,OAAO;AACxB,cAAM,UAAU,OAAO,MAAM,MAAM,YAAY,MAAM,QAAQ;AAC7D,cAAM,QAAQ,QAAQ,QAAQ,OAAO,EAAE,EAAE,MAAM,GAAG;AAClD,YAAI,MAAM,SAAS,EAAG,cAAa,MAAM,MAAM,SAAS,CAAC;AACzD;AAAA,MACF;AACA,UAAI,MAAM,SAAS,cAAc;AAC/B,qBAAa,OAAO,MAAM,MAAM,YAAY,MAAM,QAAQ;AAC1D;AAAA,MACF;AAAA,IACF;AACA,QAAI,YAAY;AACd,YAAM,SAAS,WAAW,IAAI,WAAW,YAAY,CAAC;AACtD,UAAI,UAAU,WAAW,WAAW;AAClC,cAAM,OAAO,GAAG,SAAS,IAAI,MAAM;AACnC,YAAI,CAAC,cAAc,IAAI,IAAI,GAAG;AAC5B,wBAAc,IAAI,IAAI;AACtB,kBAAQ,WAAW,QAAQ,SAAS,KAAK,cAAc,MAAM,GAAG,YAAY,GAAG;AAAA,QACjF;AAAA,MACF;AAAA,IACF;AACA,eAAW,SAAS,KAAK,UAAU;AACjC,gBAAU,OAAO,SAAS;AAAA,IAC5B;AAAA,EACF;AAEA,aAAW,CAAC,WAAW,IAAI,KAAK,gBAAgB;AAC9C,cAAU,MAAM,SAAS;AAAA,EAC3B;AAEA,QAAM,aAAa,MAAM;AAAA,IAAO,CAAC,MAC/B,QAAQ,IAAI,EAAE,MAAM,MAAM,QAAQ,IAAI,EAAE,MAAM,KAAK,EAAE,aAAa;AAAA,EACpE;AAEA,SAAO,EAAE,OAAO,OAAO,YAAY,OAAO,OAAU;AACtD;AAMA,eAAe,yBACb,SACA,OACsB;AACtB,QAAM,iBAAiB;AACvB,QAAM,OAAO,MAAM,aAAa,QAAQ;AACxC,MAAI,CAAC,KAAM,QAAO,CAAC;AAEnB,QAAM,SAAS,IAAIA,QAAO;AAC1B,SAAO,YAAY,IAAI;AAGvB,QAAM,iBAAiB,oBAAI,IAAiC;AAC5D,aAAW,cAAc,SAAS;AAChC,eAAW,QAAQ,WAAW,SAAS,CAAC,GAAG;AACzC,YAAM,MAAM,KAAK,eAAe;AAChC,UAAI,CAAC,IAAK;AACV,YAAM,eAAW,4BAAS,SAAK,2BAAQ,GAAG,CAAC;AAC3C,YAAM,QAAQ,KAAK,SAAS;AAC5B,YAAM,MAAM,KAAK,MAAM;AACvB,UAAI,SAAS,CAAC,MAAM,SAAS,GAAG,KAAK,CAAC,MAAM,SAAS,KAAK,KAAK,CAAC,MAAM,WAAW,GAAG,GAAG;AACrF,YAAI,CAAC,eAAe,IAAI,QAAQ,EAAG,gBAAe,IAAI,UAAU,oBAAI,IAAI,CAAC;AACzE,uBAAe,IAAI,QAAQ,EAAG,IAAI,OAAO,GAAG;AAAA,MAC9C;AAAA,IACF;AAAA,EACF;AAGA,QAAM,WAAwB,CAAC;AAC/B,QAAM,aAAa,oBAAI,IAAoB;AAC3C,aAAW,KAAK,OAAO;AACrB,eAAW,QAAI,4BAAS,OAAG,2BAAQ,CAAC,CAAC,GAAG,CAAC;AAAA,EAC3C;AAEA,WAAS,MAAM,GAAG,MAAM,QAAQ,QAAQ,OAAO;AA0B7C,QAAS,cAAT,SAAqB,MAAwB;AAC3C,UAAI,KAAK,SAAS,yBAAyB;AACzC,YAAI,aAA4B;AAChC,mBAAW,SAAS,KAAK,UAAU;AACjC,cAAI,MAAM,SAAS,mBAAmB;AACpC,uBAAW,OAAO,MAAM,UAAU;AAChC,kBAAI,IAAI,SAAS,eAAe;AAC9B,sBAAM,MAAM,OAAO,MAAM,IAAI,YAAY,IAAI,QAAQ;AACrD,6BAAa,IAAI,MAAM,GAAG,EAAE,IAAI;AAChC;AAAA,cACF;AAAA,YACF;AACA;AAAA,UACF;AACA,cAAI,MAAM,SAAS,iBAAiB,eAAe,MAAM;AACvD,kBAAM,MAAM,OAAO,MAAM,MAAM,YAAY,MAAM,QAAQ;AACzD,yBAAa,IAAI,MAAM,GAAG,EAAE,IAAI;AAAA,UAClC;AAAA,QACF;AAEA,YAAI,CAAC,cAAc,CAAC,eAAe,IAAI,UAAU,EAAG;AAEpD,cAAM,gBAA0B,CAAC;AACjC,YAAI,eAAe;AACnB,mBAAW,SAAS,KAAK,UAAU;AACjC,cAAI,MAAM,SAAS,UAAU;AAC3B,2BAAe;AACf;AAAA,UACF;AACA,cAAI,CAAC,aAAc;AACnB,cAAI,MAAM,SAAS,eAAe;AAChC,0BAAc,KAAK,OAAO,MAAM,MAAM,YAAY,MAAM,QAAQ,CAAC;AAAA,UACnE,WAAW,MAAM,SAAS,kBAAkB;AAC1C,kBAAM,WAAW,MAAM,kBAAkB,MAAM;AAC/C,gBAAI,UAAU;AACZ,4BAAc,KAAK,OAAO,MAAM,SAAS,YAAY,SAAS,QAAQ,CAAC;AAAA,YACzE;AAAA,UACF;AAAA,QACF;AAEA,cAAM,OAAO,KAAK,cAAc,MAAM;AACtC,mBAAW,QAAQ,eAAe;AAChC,gBAAM,SAAS,eAAe,IAAI,UAAU,GAAG,IAAI,IAAI;AACvD,cAAI,QAAQ;AACV,uBAAW,eAAe,cAAc;AACtC,uBAAS,KAAK;AAAA,gBACZ,QAAQ;AAAA,gBAAa,QAAQ;AAAA,gBAAQ,UAAU;AAAA,gBAC/C,YAAY;AAAA,gBAAY,aAAa;AAAA,gBACrC,iBAAiB,IAAI,IAAI;AAAA,gBAAI,QAAQ;AAAA,cACvC,CAAC;AAAA,YACH;AAAA,UACF;AAAA,QACF;AAAA,MACF;AACA,iBAAW,SAAS,KAAK,UAAU;AACjC,oBAAY,KAAK;AAAA,MACnB;AAAA,IACF;AAlFA,UAAM,aAAa,QAAQ,GAAG;AAC9B,UAAM,WAAW,MAAM,GAAG;AAC1B,UAAM,eAAW,4BAAS,cAAU,2BAAQ,QAAQ,CAAC;AACrD,UAAM,UAAU;AAEhB,UAAM,eAAe,WAAW,MAC7B;AAAA,MAAO,CAAC,MACP,EAAE,gBAAgB,WAClB,CAAC,EAAE,MAAM,SAAS,GAAG,KACrB,CAAC,EAAE,MAAM,SAAS,KAAK,KACvB,EAAE,OAAO,QAAQ,QAAQ;AAAA,IAC3B,EACC,IAAI,CAAC,MAAM,EAAE,EAAE;AAElB,QAAI,aAAa,WAAW,EAAG;AAE/B,QAAI;AACJ,QAAI;AACJ,QAAI;AACF,mBAAS,8BAAa,UAAU,OAAO;AACvC,aAAO,UAAU,QAAQ,MAAM;AAAA,IACjC,QAAQ;AACN;AAAA,IACF;AA6DA,gBAAY,KAAK,QAAQ;AAAA,EAC3B;AAEA,SAAO;AACT;AA2DA,eAAsB,uBAAuB,OAAwD;AACnG,QAAM,UAA8B,CAAC;AACrC,QAAM,cAAsC,CAAC;AAG7C,MAAI,OAAO;AACX,MAAI;AACF,QAAI,MAAM,WAAW,GAAG;AACtB,aAAO;AAAA,IACT,WAAW,MAAM,WAAW,GAAG;AAC7B,iBAAO,2BAAQ,MAAM,CAAC,CAAE;AAAA,IAC1B,OAAO;AAEL,YAAM,QAAQ,MAAM,IAAI,CAAC,MAAM,EAAE,MAAM,qBAAG,CAAC;AAC3C,YAAM,SAAS,KAAK,IAAI,GAAG,MAAM,IAAI,CAAC,MAAM,EAAE,MAAM,CAAC;AACrD,UAAI,YAAY;AAChB,eAAS,IAAI,GAAG,IAAI,QAAQ,KAAK;AAC/B,cAAM,gBAAgB,IAAI,IAAI,MAAM,IAAI,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC;AACpD,YAAI,cAAc,SAAS,EAAG;AAAA,YACzB;AAAA,MACP;AACA,aAAO,YAAY,IAAI,MAAM,CAAC,EAAG,MAAM,GAAG,SAAS,EAAE,KAAK,qBAAG,IAAI;AAAA,IACnE;AAAA,EACF,QAAQ;AACN,WAAO;AAAA,EACT;AAEA,QAAM,QAAQ,MAAM;AACpB,QAAM,qBAAqB;AAE3B,WAAS,IAAI,GAAG,IAAI,MAAM,QAAQ,KAAK;AACrC,QAAI,SAAS,sBAAsB,IAAI,uBAAuB,KAAK,IAAI,GAAG;AACxE,cAAQ,OAAO,MAAM,qBAAqB,CAAC,IAAI,KAAK,WAAW,KAAK,MAAM,IAAI,MAAM,KAAK,CAAC;AAAA,CAAM;AAAA,IAClG;AACA,UAAM,WAAW,MAAM,CAAC;AACxB,UAAM,UAAM,2BAAQ,QAAQ;AAC5B,UAAM,YAAY,UAAU,GAAG;AAC/B,QAAI,CAAC,UAAW;AAEhB,UAAM,SAAS,WAAW,UAAU,IAAI;AACxC,QAAI,WAAW,MAAM;AACnB,cAAQ,KAAK,MAAqC;AAClD;AAAA,IACF;AAEA,UAAM,SAAS,MAAM,UAAU,QAAQ;AACvC,QAAI,CAAC,OAAO,OAAO;AACjB,iBAAW,UAAU,QAA8C,IAAI;AAAA,IACzE,OAAO;AACL,kBAAY,KAAK,EAAE,UAAU,OAAO,OAAO,MAAM,CAAC;AAAA,IACpD;AACA,YAAQ,KAAK,MAAM;AAAA,EACrB;AAEA,MAAI,SAAS,oBAAoB;AAC/B,YAAQ,OAAO,MAAM,qBAAqB,KAAK,IAAI,KAAK;AAAA,CAAiB;AAAA,EAC3E;AAEA,QAAM,WAAwB,CAAC;AAC/B,QAAM,WAAwB,CAAC;AAC/B,aAAW,UAAU,SAAS;AAC5B,aAAS,KAAK,GAAI,OAAO,SAAS,CAAC,CAAE;AACrC,aAAS,KAAK,GAAI,OAAO,SAAS,CAAC,CAAE;AAAA,EACvC;AAGA,QAAM,UAAU,MAAM,OAAO,CAAC,UAAM,2BAAQ,CAAC,MAAM,KAAK;AACxD,MAAI,QAAQ,SAAS,GAAG;AACtB,UAAM,YAAY,QAAQ,OAAO,CAAC,IAAI,UAAM,2BAAQ,MAAM,CAAC,CAAE,MAAM,KAAK;AACxE,QAAI;AACF,YAAM,iBAAiB,MAAM,yBAAyB,WAAW,OAAO;AACxE,eAAS,KAAK,GAAG,cAAc;AAAA,IACjC,QAAQ;AAAA,IAER;AAAA,EACF;AAEA,SAAO;AAAA,IACL,YAAY;AAAA,MACV,OAAO;AAAA,MACP,OAAO;AAAA,MACP,cAAc;AAAA,MACd,eAAe;AAAA,IACjB;AAAA,IACA;AAAA,EACF;AACF;AAEA,eAAsB,QAAQ,OAAsC;AAClE,QAAM,EAAE,WAAW,IAAI,MAAM,uBAAuB,KAAK;AACzD,SAAO;AACT;AAmBO,SAAS,aAAa,QAAgB,SAAkD;AAC7F,QAAM,iBAAiB,SAAS,kBAAkB;AAClD,QAAM,eAAW,2BAAQ,MAAM;AAE/B,MAAI;AACF,UAAM,WAAO,2BAAU,QAAQ;AAC/B,QAAI,KAAK,OAAO,EAAG,QAAO,CAAC,QAAQ;AAAA,EACrC,QAAQ;AACN,WAAO,CAAC;AAAA,EACV;AAEA,QAAM,UAAoB,CAAC;AAE3B,WAASE,SAAQ,KAAa,SAA4B;AACxD,QAAI;AACJ,QAAI;AACF,oBAAU,6BAAY,GAAG;AAAA,IAC3B,QAAQ;AACN;AAAA,IACF;AAEA,eAAW,SAAS,SAAS;AAC3B,UAAI,MAAM,WAAW,GAAG,EAAG;AAC3B,YAAM,eAAW,wBAAK,KAAK,KAAK;AAEhC,UAAI;AACJ,UAAI;AACF,mBAAO,2BAAU,QAAQ;AAAA,MAC3B,QAAQ;AACN;AAAA,MACF;AAEA,UAAI,KAAK,eAAe,KAAK,CAAC,eAAgB;AAE9C,UAAI,KAAK,YAAY,KAAM,KAAK,eAAe,KAAK,gBAAiB;AAEnE,YAAI,KAAK,eAAe,GAAG;AACzB,cAAI;AACF,kBAAM,WAAO,8BAAa,QAAQ;AAClC,gBAAI,QAAQ,IAAI,IAAI,EAAG;AACvB,oBAAQ,IAAI,IAAI;AAChB,kBAAM,iBAAa,kCAAa,2BAAQ,QAAQ,CAAC;AACjD,gBAAI,eAAe,QAAQ,WAAW,WAAW,OAAO,qBAAG,EAAG;AAAA,UAChE,QAAQ;AACN;AAAA,UACF;AAAA,QACF;AAGA,cAAM,YAAY,SAAS,MAAM,qBAAG;AACpC,YAAI,UAAU,KAAK,CAAC,SAAS,KAAK,WAAW,GAAG,CAAC,EAAG;AAEpD,QAAAA,SAAQ,UAAU,OAAO;AAAA,MAC3B,WAAW,KAAK,OAAO,GAAG;AACxB,cAAM,UAAM,2BAAQ,KAAK;AACzB,YAAI,YAAY,IAAI,GAAG,GAAG;AACxB,kBAAQ,KAAK,QAAQ;AAAA,QACvB;AAAA,MACF;AAAA,IACF;AAAA,EACF;AAEA,EAAAA,SAAQ,UAAU,oBAAI,IAAY,CAAC;AACnC,SAAO,QAAQ,KAAK;AACtB;AArnGA,IAQAC,iBACAC,mBACA,oBAOA,YAjBA,aAqBMJ,SASF,oBAUE,eAoDA,gBA4gBA,gBAcA,YAcA,YAcA,cAaA,WAeA,aAeA,cAcA,gBAeA,gBAgBA,eAgBA,aAgBA,aAgBA,eAwbA,qBAksDA,WAoJA;AAxiGN;AAAA;AAQA,IAAAG,kBAA+E;AAC/E,IAAAC,oBAA+D;AAC/D,yBAA8B;AAE9B;AAKA,iBAA4B;AAjB5B;AAqBA,IAAMJ,UAC6D,qBACC;AAOpE,IAAI,qBAAqB;AAUzB,IAAM,gBAAgB,iBAAiB;AAoDvC,IAAM,iBAAiB,oBAAI,IAAiC;AA4gB5D,IAAM,iBAAiC,cAAc;AAAA,MACnD,eAAe;AAAA,MACf,UAAU;AAAA,MACV,YAAY,oBAAI,IAAI,CAAC,kBAAkB,CAAC;AAAA,MACxC,eAAe,oBAAI,IAAI,CAAC,qBAAqB,CAAC;AAAA,MAC9C,aAAa,oBAAI,IAAI,CAAC,oBAAoB,uBAAuB,CAAC;AAAA,MAClE,WAAW,oBAAI,IAAI,CAAC,MAAM,CAAC;AAAA,MAC3B,mBAAmB;AAAA,MACnB,uBAAuB,oBAAI,IAAI,CAAC,WAAW,CAAC;AAAA,MAC5C,mBAAmB;AAAA,MACnB,uBAAuB,oBAAI,IAAI,CAAC,qBAAqB,CAAC;AAAA,MACtD,eAAe;AAAA,IACjB,CAAC;AAED,IAAM,aAA6B,cAAc;AAAA,MAC/C,eAAe;AAAA,MACf,UAAU;AAAA,MACV,YAAY,oBAAI,IAAI,CAAC,mBAAmB,CAAC;AAAA,MACzC,eAAe,oBAAI,IAAI,CAAC,wBAAwB,mBAAmB,CAAC;AAAA,MACpE,aAAa,oBAAI,IAAI,CAAC,kBAAkB,CAAC;AAAA,MACzC,WAAW,oBAAI,IAAI,CAAC,iBAAiB,CAAC;AAAA,MACtC,mBAAmB;AAAA,MACnB,uBAAuB,oBAAI,IAAI,CAAC,mBAAmB,CAAC;AAAA,MACpD,mBAAmB;AAAA,MACnB,uBAAuB,oBAAI,IAAI,CAAC,wBAAwB,kBAAkB,mBAAmB,CAAC;AAAA,MAC9F,eAAe;AAAA,IACjB,CAAC;AAED,IAAM,aAA6B,cAAc;AAAA,MAC/C,eAAe;AAAA,MACf,UAAU;AAAA,MACV,YAAY,oBAAI,IAAI,CAAC,mBAAmB,CAAC;AAAA,MACzC,eAAe,oBAAI,IAAI,CAAC,wBAAwB,mBAAmB,CAAC;AAAA,MACpE,aAAa,oBAAI,IAAI,CAAC,kBAAkB,CAAC;AAAA,MACzC,WAAW,oBAAI,IAAI,CAAC,iBAAiB,CAAC;AAAA,MACtC,mBAAmB;AAAA,MACnB,uBAAuB,oBAAI,IAAI,CAAC,mBAAmB,CAAC;AAAA,MACpD,mBAAmB;AAAA,MACnB,uBAAuB,oBAAI,IAAI,CAAC,wBAAwB,kBAAkB,mBAAmB,CAAC;AAAA,MAC9F,eAAe;AAAA,IACjB,CAAC;AAED,IAAM,eAA+B,cAAc;AAAA,MACjD,eAAe;AAAA,MACf,UAAU;AAAA,MACV,YAAY,oBAAI,IAAI,CAAC,qBAAqB,uBAAuB,CAAC;AAAA,MAClE,eAAe,oBAAI,IAAI,CAAC,sBAAsB,yBAAyB,CAAC;AAAA,MACxE,aAAa,oBAAI,IAAI,CAAC,oBAAoB,CAAC;AAAA,MAC3C,WAAW,oBAAI,IAAI,CAAC,mBAAmB,CAAC;AAAA,MACxC,mBAAmB;AAAA,MACnB,uBAAuB,oBAAI,IAAI;AAAA,MAC/B,uBAAuB,oBAAI,IAAI,CAAC,sBAAsB,yBAAyB,CAAC;AAAA,MAChF,eAAe;AAAA,IACjB,CAAC;AAED,IAAM,YAA4B,cAAc;AAAA,MAC9C,eAAe;AAAA,MACf,UAAU;AAAA,MACV,YAAY,oBAAI,IAAI;AAAA,MACpB,eAAe,oBAAI,IAAI,CAAC,qBAAqB,CAAC;AAAA,MAC9C,aAAa,oBAAI,IAAI,CAAC,iBAAiB,CAAC;AAAA,MACxC,WAAW,oBAAI,IAAI,CAAC,iBAAiB,CAAC;AAAA,MACtC,mBAAmB;AAAA,MACnB,uBAAuB,oBAAI,IAAI,CAAC,kBAAkB,CAAC;AAAA,MACnD,mBAAmB;AAAA,MACnB,uBAAuB,oBAAI,IAAI,CAAC,qBAAqB,CAAC;AAAA,MACtD,eAAe;AAAA,MACf,uBAAuB;AAAA,IACzB,CAAC;AAED,IAAM,cAA8B,cAAc;AAAA,MAChD,eAAe;AAAA,MACf,UAAU;AAAA,MACV,YAAY,oBAAI,IAAI,CAAC,iBAAiB,CAAC;AAAA,MACvC,eAAe,oBAAI,IAAI,CAAC,qBAAqB,CAAC;AAAA,MAC9C,aAAa,oBAAI,IAAI,CAAC,iBAAiB,CAAC;AAAA,MACxC,WAAW,oBAAI,IAAI,CAAC,iBAAiB,CAAC;AAAA,MACtC,mBAAmB;AAAA,MACnB,uBAAuB,oBAAI,IAAI,CAAC,oBAAoB,sBAAsB,CAAC;AAAA,MAC3E,mBAAmB;AAAA,MACnB,uBAAuB,oBAAI,IAAI,CAAC,qBAAqB,CAAC;AAAA,MACtD,eAAe;AAAA,MACf,uBAAuB;AAAA,IACzB,CAAC;AAED,IAAM,eAA+B,cAAc;AAAA,MACjD,eAAe;AAAA,MACf,UAAU;AAAA,MACV,YAAY,oBAAI,IAAI,CAAC,OAAO,CAAC;AAAA,MAC7B,eAAe,oBAAI,IAAI,CAAC,UAAU,kBAAkB,CAAC;AAAA,MACrD,aAAa,oBAAI,IAAI;AAAA,MACrB,WAAW,oBAAI,IAAI,CAAC,MAAM,CAAC;AAAA,MAC3B,mBAAmB;AAAA,MACnB,uBAAuB,oBAAI,IAAI;AAAA,MAC/B,wBAAwB,CAAC,YAAY,oBAAoB,YAAY;AAAA,MACrE,wBAAwB,CAAC,gBAAgB;AAAA,MACzC,uBAAuB,oBAAI,IAAI,CAAC,UAAU,kBAAkB,CAAC;AAAA,IAC/D,CAAC;AAED,IAAM,iBAAiC,cAAc;AAAA,MACnD,eAAe;AAAA,MACf,UAAU;AAAA,MACV,YAAY,oBAAI,IAAI,CAAC,qBAAqB,uBAAuB,CAAC;AAAA,MAClE,eAAe,oBAAI,IAAI,CAAC,oBAAoB,CAAC;AAAA,MAC7C,aAAa,oBAAI,IAAI,CAAC,iBAAiB,CAAC;AAAA,MACxC,WAAW,oBAAI,IAAI,CAAC,uBAAuB,CAAC;AAAA,MAC5C,mBAAmB;AAAA,MACnB,uBAAuB,oBAAI,IAAI,CAAC,0BAA0B,CAAC;AAAA,MAC3D,mBAAmB;AAAA,MACnB,wBAAwB,CAAC,kBAAkB;AAAA,MAC3C,uBAAuB,oBAAI,IAAI,CAAC,oBAAoB,CAAC;AAAA,MACrD,eAAe;AAAA,IACjB,CAAC;AAED,IAAM,iBAAiC,cAAc;AAAA,MACnD,eAAe;AAAA,MACf,UAAU;AAAA,MACV,YAAY,oBAAI,IAAI,CAAC,qBAAqB,oBAAoB,CAAC;AAAA,MAC/D,eAAe,oBAAI,IAAI,CAAC,sBAAsB,CAAC;AAAA,MAC/C,aAAa,oBAAI,IAAI,CAAC,eAAe,CAAC;AAAA,MACtC,WAAW,oBAAI,IAAI,CAAC,iBAAiB,CAAC;AAAA,MACtC,mBAAmB;AAAA,MACnB,uBAAuB,oBAAI,IAAI,CAAC,uBAAuB,CAAC;AAAA,MACxD,mBAAmB;AAAA,MACnB,wBAAwB,CAAC,mBAAmB;AAAA,MAC5C,wBAAwB,CAAC,iBAAiB,YAAY;AAAA,MACtD,uBAAuB,oBAAI,IAAI,CAAC,sBAAsB,CAAC;AAAA,MACvD,eAAe;AAAA,IACjB,CAAC;AAED,IAAM,gBAAgC,cAAc;AAAA,MAClD,eAAe;AAAA,MACf,UAAU;AAAA,MACV,YAAY,oBAAI,IAAI,CAAC,oBAAoB,mBAAmB,CAAC;AAAA,MAC7D,eAAe,oBAAI,IAAI,CAAC,qBAAqB,CAAC;AAAA,MAC9C,aAAa,oBAAI,IAAI,CAAC,oBAAoB,CAAC;AAAA,MAC3C,WAAW,oBAAI,IAAI,CAAC,iBAAiB,CAAC;AAAA,MACtC,mBAAmB;AAAA,MACnB,uBAAuB,oBAAI,IAAI,CAAC,kBAAkB,CAAC;AAAA,MACnD,mBAAmB;AAAA,MACnB,wBAAwB,CAAC,YAAY;AAAA,MACrC,wBAAwB,CAAC,eAAe;AAAA,MACxC,uBAAuB,oBAAI,IAAI,CAAC,qBAAqB,CAAC;AAAA,MACtD,eAAe;AAAA,IACjB,CAAC;AAED,IAAM,cAA8B,cAAc;AAAA,MAChD,eAAe;AAAA,MACf,UAAU;AAAA,MACV,YAAY,oBAAI,IAAI,CAAC,mBAAmB,CAAC;AAAA,MACzC,eAAe,oBAAI,IAAI,CAAC,uBAAuB,oBAAoB,CAAC;AAAA,MACpE,aAAa,oBAAI,IAAI,CAAC,sBAAsB,CAAC;AAAA,MAC7C,WAAW,oBAAI,IAAI,CAAC,4BAA4B,wBAAwB,CAAC;AAAA,MACzE,mBAAmB;AAAA,MACnB,uBAAuB,oBAAI,IAAI,CAAC,wBAAwB,CAAC;AAAA,MACzD,mBAAmB;AAAA,MACnB,wBAAwB,CAAC,MAAM;AAAA,MAC/B,wBAAwB,CAAC,oBAAoB,oBAAoB;AAAA,MACjE,uBAAuB,oBAAI,IAAI,CAAC,uBAAuB,oBAAoB,CAAC;AAAA,MAC5E,eAAe;AAAA,IACjB,CAAC;AAED,IAAM,cAA8B,cAAc;AAAA,MAChD,eAAe;AAAA,MACf,UAAU;AAAA,MACV,YAAY,oBAAI,IAAI;AAAA,MACpB,eAAe,oBAAI,IAAI,CAAC,sBAAsB,CAAC;AAAA,MAC/C,aAAa,oBAAI,IAAI,CAAC,sBAAsB,CAAC;AAAA,MAC7C,WAAW,oBAAI,IAAI,CAAC,eAAe,CAAC;AAAA,MACpC,mBAAmB;AAAA,MACnB,uBAAuB,oBAAI,IAAI,CAAC,yBAAyB,CAAC;AAAA,MAC1D,mBAAmB;AAAA,MACnB,wBAAwB,CAAC,cAAc,yBAAyB;AAAA,MAChE,wBAAwB,CAAC,OAAO;AAAA,MAChC,uBAAuB,oBAAI,IAAI,CAAC,sBAAsB,CAAC;AAAA,MACvD,eAAe;AAAA,IACjB,CAAC;AAED,IAAM,gBAAgC,cAAc;AAAA,MAClD,eAAe;AAAA,MACf,UAAU;AAAA,MACV,YAAY,oBAAI,IAAI,CAAC,qBAAqB,sBAAsB,CAAC;AAAA,MACjE,eAAe,oBAAI,IAAI,CAAC,wBAAwB,oBAAoB,sBAAsB,uBAAuB,CAAC;AAAA,MAClH,aAAa,oBAAI,IAAI,CAAC,oBAAoB,CAAC;AAAA,MAC3C,WAAW,oBAAI,IAAI,CAAC,iBAAiB,CAAC;AAAA,MACtC,mBAAmB;AAAA,MACnB,uBAAuB,oBAAI,IAAI,CAAC,uBAAuB,CAAC;AAAA,MACxD,mBAAmB;AAAA,MACnB,wBAAwB,CAAC,qBAAqB,mBAAmB,WAAW;AAAA,MAC5E,wBAAwB,CAAC,cAAc,iBAAiB,iBAAiB,iBAAiB;AAAA,MAC1F,uBAAuB,oBAAI,IAAI,CAAC,wBAAwB,oBAAoB,sBAAsB,uBAAuB,CAAC;AAAA,MAC1H,eAAe;AAAA,IACjB,CAAC;AA0aD,IAAM,sBAAsB;AAAA,MAC1B;AAAA,MAAW;AAAA,MAAgB;AAAA,MAAW;AAAA,MACtC;AAAA,MAAgB;AAAA,MAAW;AAAA,IAC7B;AA+rDA,IAAM,YAAyC;AAAA,MAC7C,OAAO;AAAA,MACP,OAAO;AAAA,MACP,QAAQ;AAAA,MACR,OAAO;AAAA,MACP,QAAQ;AAAA,MACR,OAAO;AAAA,MACP,OAAO;AAAA,MACP,SAAS;AAAA,MACT,MAAM;AAAA,MACN,MAAM;AAAA,MACN,QAAQ;AAAA,MACR,OAAO;AAAA,MACP,QAAQ;AAAA,MACR,QAAQ;AAAA,MACR,OAAO;AAAA,MACP,OAAO;AAAA,MACP,OAAO;AAAA,MACP,QAAQ;AAAA,MACR,UAAU;AAAA,MACV,QAAQ;AAAA,MACR,UAAU;AAAA,MACV,QAAQ;AAAA,MACR,QAAQ;AAAA,MACR,QAAQ;AAAA,MACR,QAAQ;AAAA,MACR,OAAO;AAAA,MACP,QAAQ;AAAA,MACR,MAAM;AAAA,MACN,OAAO;AAAA,MACP,OAAO;AAAA,IACT;AAqHA,IAAM,cAAc,oBAAI,IAAI;AAAA,MAC1B;AAAA,MAAO;AAAA,MAAO;AAAA,MAAO;AAAA,MAAQ;AAAA,MAAO;AAAA,MACpC;AAAA,MAAS;AAAA,MAAM;AAAA,MAAM;AAAA,MAAQ;AAAA,MAAO;AAAA,MAAQ;AAAA,MAC5C;AAAA,MAAO;AAAA,MAAO;AAAA,MAAO;AAAA,MAAQ;AAAA,MAAU;AAAA,MAAQ;AAAA,MAC/C;AAAA,MAAQ;AAAA,MAAQ;AAAA,MAAQ;AAAA,MACxB;AAAA,MAAM;AAAA,MACN;AAAA,MAAO;AAAA,MAAQ;AAAA,MAAO;AAAA,IACxB,CAAC;AAAA;AAAA;;;AC/iGD;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;;;ACCO,IAAK,WAAL,kBAAKK,cAAL;AACL,EAAAA,UAAA,UAAO;AACP,EAAAA,UAAA,cAAW;AACX,EAAAA,UAAA,WAAQ;AACR,EAAAA,UAAA,WAAQ;AAJE,SAAAA;AAAA,GAAA;;;ADIZ;AACA;AACA;AACA;AACA;AACA;;;AENA,IAAAC,kBAAyC;AACzC,IAAAC,oBAAqB;AAGrB;AAEA,SAAS,aAAa,MAAsB;AAC1C,SAAO,KAAK,QAAQ,OAAO,GAAG,EAAE,QAAQ,MAAM,GAAG,EAAE,QAAQ,MAAM,GAAG;AACtE;AAEA,SAAS,oBACP,GACA,OACA,QACA,QACoB;AACpB,QAAM,WAAW,aAAa,MAAM;AACpC,QAAM,SAAS,oBAAI,IAAoB;AACvC,aAAW,OAAO,OAAO;AACvB,MAAE,gBAAgB,KAAK,CAAC,aAAa;AACnC,YAAM,OAAO,EAAE,iBAAiB,UAAU,WAAW;AACrD,UAAI,SAAS,UAAa,SAAS,QAAQ;AACzC,cAAM,QAAQ,SAAS,IAAI,IAAI,KAAK,aAAa,IAAI;AACrD,eAAO,IAAI,QAAQ,OAAO,IAAI,KAAK,KAAK,KAAK,CAAC;AAAA,MAChD;AAAA,IACF,CAAC;AAAA,EACH;AACA,SAAO,CAAC,GAAG,OAAO,QAAQ,CAAC,EAAE,KAAK,CAAC,GAAG,MAAM,EAAE,CAAC,IAAI,EAAE,CAAC,CAAC;AACzD;AAEA,SAAS,iBACP,GACA,KACA,OACA,OACA,QACA,UACQ;AACR,QAAM,WAAW,CAAC,GAAG,KAAK,EAAE,KAAK,CAAC,GAAG,MAAM,EAAE,OAAO,CAAC,IAAI,EAAE,OAAO,CAAC,CAAC,EAAE,MAAM,GAAG,EAAE;AACjF,QAAM,QAAQ,oBAAoB,GAAG,OAAO,KAAK,MAAM;AAEvD,QAAM,aAAqC,EAAE,WAAW,GAAG,UAAU,GAAG,WAAW,EAAE;AACrF,aAAW,OAAO,OAAO;AACvB,MAAE,YAAY,KAAK,CAAC,GAAG,SAAS;AAC9B,YAAM,OAAQ,KAAK,cAAyB;AAC5C,iBAAW,IAAI,KAAK,WAAW,IAAI,KAAK,KAAK;AAAA,IAC/C,CAAC;AAAA,EACH;AACA,QAAM,aAAa,OAAO,OAAO,UAAU,EAAE,OAAO,CAAC,GAAG,MAAM,IAAI,GAAG,CAAC,KAAK;AAE3E,QAAM,UAAU,CAAC,GAAG,IAAI,IAAI,MAAM,IAAI,CAAC,MAAO,EAAE,iBAAiB,GAAG,aAAa,KAAgB,EAAE,EAAE,OAAO,OAAO,CAAC,CAAC,EAAE,KAAK;AAE5H,QAAM,QAAkB,CAAC;AACzB,QAAM,KAAK,KAAK,KAAK,IAAI,EAAE;AAE3B,QAAM,YAAY,CAAC,GAAG,MAAM,MAAM,QAAQ;AAC1C,MAAI,aAAa,OAAW,WAAU,KAAK,YAAY,SAAS,QAAQ,CAAC,CAAC,EAAE;AAC5E,QAAM,KAAK,KAAK,UAAU,KAAK,QAAK,CAAC,IAAI,EAAE;AAE3C,QAAM,KAAK,mBAAmB,EAAE;AAChC,aAAW,OAAO,UAAU;AAC1B,UAAM,IAAI,EAAE,kBAAkB,GAAG;AACjC,UAAM,YAAa,EAAE,SAAoB;AACzC,UAAM,MAAO,EAAE,eAA0B;AACzC,UAAM,SAAS,EAAE,OAAO,GAAG;AAC3B,UAAM,SAAS,MAAM,aAAQ,GAAG,OAAO;AACvC,UAAM,KAAK,OAAO,SAAS,OAAO,MAAM,gBAAgB,MAAM,EAAE;AAAA,EAClE;AACA,QAAM,YAAY,MAAM,SAAS,SAAS;AAC1C,MAAI,YAAY,EAAG,OAAM,KAAK,cAAc,SAAS,gCAAgC;AACrF,QAAM,KAAK,EAAE;AAEb,QAAM,KAAK,oBAAoB,EAAE;AACjC,MAAI,MAAM,SAAS,GAAG;AACpB,eAAW,CAAC,YAAY,KAAK,KAAK,MAAM,MAAM,GAAG,EAAE,GAAG;AACpD,YAAM,KAAK,OAAO,UAAU,OAAO,KAAK,sBAAsB;AAAA,IAChE;AAAA,EACF,OAAO;AACL,UAAM,KAAK,kDAAkD;AAAA,EAC/D;AACA,QAAM,KAAK,EAAE;AAEb,MAAI,QAAQ,SAAS,GAAG;AACtB,UAAM,KAAK,mBAAmB,EAAE;AAChC,eAAW,OAAO,QAAQ,MAAM,GAAG,EAAE,GAAG;AACtC,YAAM,KAAK,OAAO,GAAG,IAAI;AAAA,IAC3B;AACA,UAAM,KAAK,EAAE;AAAA,EACf;AAEA,QAAM,KAAK,kBAAkB,EAAE;AAC/B,aAAW,QAAQ,CAAC,aAAa,YAAY,WAAW,GAAG;AACzD,UAAM,IAAI,WAAW,IAAI,KAAK;AAC9B,UAAM,MAAM,KAAK,MAAO,IAAI,aAAc,GAAG;AAC7C,UAAM,KAAK,KAAK,IAAI,KAAK,CAAC,KAAK,GAAG,IAAI;AAAA,EACxC;AACA,QAAM,KAAK,EAAE;AAEb,QAAM,KAAK,OAAO,IAAI,mEAAmE;AACzF,SAAO,MAAM,KAAK,IAAI;AACxB;AAEA,SAAS,eAAe,GAAU,KAAa,QAAqC;AAClF,QAAM,IAAI,EAAE,kBAAkB,GAAG;AACjC,QAAM,YAAa,EAAE,SAAoB;AACzC,QAAM,MAAO,EAAE,eAA0B;AACzC,QAAM,MAAM,EAAE;AACd,QAAM,gBAAgB,QAAQ,SAAa,OAAO,IAAI,GAAG,KAAK,aAAa,GAAG,KAAM;AAEpF,QAAM,QAAkB,CAAC;AACzB,QAAM,KAAK,KAAK,SAAS,IAAI,EAAE;AAC/B,QAAM,KAAK,mBAAgB,EAAE,OAAO,GAAG,CAAC,uBAAoB,GAAG,MAAM,EAAE;AAEvE,MAAI,eAAe;AACjB,UAAM,KAAK,oBAAoB,aAAa,MAAM,EAAE;AAAA,EACtD;AAEA,QAAM,aAAa,oBAAI,IAAsB;AAC7C,QAAM,YAAY,CAAC,GAAG,EAAE,UAAU,GAAG,CAAC,EAAE,KAAK,CAAC,GAAG,MAAM,EAAE,OAAO,CAAC,IAAI,EAAE,OAAO,CAAC,CAAC;AAChF,aAAW,YAAY,WAAW;AAChC,UAAM,KAAK,EAAE,kBAAkB,EAAE,KAAK,KAAK,QAAQ,CAAE;AACrD,UAAM,MAAO,GAAG,YAAuB;AACvC,UAAM,gBAAiB,EAAE,iBAAiB,UAAU,OAAO,KAAgB;AAC3E,UAAM,OAAQ,GAAG,cAAyB;AAC1C,UAAM,UAAU,OAAO,MAAM,IAAI,OAAO;AACxC,QAAI,CAAC,WAAW,IAAI,GAAG,EAAG,YAAW,IAAI,KAAK,CAAC,CAAC;AAChD,eAAW,IAAI,GAAG,EAAG,KAAK,KAAK,aAAa,KAAK,OAAO,EAAE;AAAA,EAC5D;AAEA,QAAM,KAAK,8BAA8B,EAAE;AAC3C,aAAW,CAAC,KAAK,OAAO,KAAK,CAAC,GAAG,WAAW,QAAQ,CAAC,EAAE,KAAK,GAAG;AAC7D,UAAM,KAAK,OAAO,GAAG,EAAE;AACvB,eAAW,KAAK,QAAQ,MAAM,GAAG,EAAE,GAAG;AACpC,YAAM,KAAK,KAAK,CAAC,EAAE;AAAA,IACrB;AACA,UAAM,KAAK,EAAE;AAAA,EACf;AAEA,QAAM,KAAK,OAAO,IAAI,mEAAmE;AACzF,SAAO,MAAM,KAAK,IAAI;AACxB;AAEA,SAAS,QACP,aACA,QACA,cACA,YACA,YACQ;AACR,QAAM,QAAkB;AAAA,IACtB;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA,KAAK,UAAU,eAAY,UAAU,eAAY,YAAY,IAAI;AAAA,IACjE;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,EACF;AAEA,QAAM,SAAS,CAAC,GAAG,YAAY,QAAQ,CAAC,EAAE,KAAK,CAAC,GAAG,MAAM,EAAE,CAAC,EAAE,SAAS,EAAE,CAAC,EAAE,MAAM;AAClF,aAAW,CAAC,KAAK,KAAK,KAAK,QAAQ;AACjC,UAAM,QAAQ,OAAO,IAAI,GAAG,KAAK,aAAa,GAAG;AACjD,UAAM,KAAK,OAAO,KAAK,aAAQ,MAAM,MAAM,QAAQ;AAAA,EACrD;AACA,QAAM,KAAK,EAAE;AAEb,MAAI,aAAa,SAAS,GAAG;AAC3B,UAAM,KAAK,gBAAgB,kEAA6D,EAAE;AAC1F,eAAW,QAAQ,cAAc;AAC/B,YAAM,KAAK,OAAO,KAAK,KAAK,aAAQ,KAAK,KAAK,cAAc;AAAA,IAC9D;AACA,UAAM,KAAK,EAAE;AAAA,EACf;AAEA,QAAM;AAAA,IACJ;AAAA,IACA;AAAA,IACA;AAAA,EACF;AACA,SAAO,MAAM,KAAK,IAAI;AACxB;AAEO,SAAS,OACd,GACA,aACA,WACA,SAKQ;AACR,QAAM,eAAe,aAAa,WAAW;AAC7C,iCAAU,WAAW,EAAE,WAAW,KAAK,CAAC;AAExC,QAAM,SAAS,SAAS,kBACpB,aAAa,QAAQ,eAAe,IACpC,IAAI,IAAI,CAAC,GAAG,aAAa,KAAK,CAAC,EAAE,IAAI,CAAC,QAAQ,CAAC,KAAK,aAAa,GAAG,EAAE,CAAC,CAAC;AAC5E,QAAM,WAAW,aAAa,SAAS,QAAQ;AAC/C,QAAM,eAAe,SAAS,gBAAgB,CAAC;AAE/C,MAAI,QAAQ;AAGZ,aAAW,CAAC,KAAK,KAAK,KAAK,cAAc;AACvC,UAAM,QAAQ,OAAO,IAAI,GAAG,KAAK,aAAa,GAAG;AACjD,UAAM,UAAU,iBAAiB,GAAG,KAAK,OAAO,OAAO,QAAQ,SAAS,IAAI,GAAG,CAAC;AAChF,2CAAc,wBAAK,WAAW,GAAG,aAAa,KAAK,CAAC,KAAK,GAAG,OAAO;AACnE;AAAA,EACF;AAGA,aAAW,YAAY,cAAc;AACnC,UAAM,MAAM,SAAS;AACrB,QAAI,OAAO,EAAE,QAAQ,GAAG,GAAG;AACzB,YAAM,UAAU,eAAe,GAAG,KAAK,MAAM;AAC7C,6CAAc,wBAAK,WAAW,GAAG,aAAa,SAAS,KAAK,CAAC,KAAK,GAAG,OAAO;AAC5E;AAAA,IACF;AAAA,EACF;AAGA;AAAA,QACE,wBAAK,WAAW,UAAU;AAAA,IAC1B,QAAQ,cAAc,QAAQ,cAAc,EAAE,OAAO,EAAE,IAAI;AAAA,EAC7D;AAEA,SAAO;AACT;;;ACzOA,IAAAC,kBAEO;AACP,IAAAC,oBAAgE;AAChE,yBAA2B;AAI3B,IAAM,gBAAgB;AAEf,IAAMC,mBAAkB,oBAAI,IAAI;AAAA,EACrC;AAAA,EAAO;AAAA,EAAO;AAAA,EAAO;AAAA,EAAQ;AAAA,EAAQ;AAAA,EAAO;AAAA,EAAO;AAAA,EAAS;AAAA,EAAQ;AAAA,EAAO;AAAA,EAC3E;AAAA,EAAM;AAAA,EAAM;AAAA,EAAQ;AAAA,EAAO;AAAA,EAAU;AAAA,EAAO;AAAA,EAAQ;AAAA,EAAO;AAAA,EAAU;AAAA,EACrE;AAAA,EAAQ;AAAA,EAAQ;AAAA,EAAQ;AAAA,EAAQ;AAAA,EAAO;AAAA,EAAQ;AAAA,EAAM;AAAA,EAAO;AAC9D,CAAC;AAEM,IAAM,iBAAiB,oBAAI,IAAI,CAAC,OAAO,QAAQ,MAAM,CAAC;AACtD,IAAMC,oBAAmB,oBAAI,IAAI,CAAC,MAAM,CAAC;AACzC,IAAMC,oBAAmB,oBAAI,IAAI,CAAC,QAAQ,QAAQ,SAAS,QAAQ,SAAS,MAAM,CAAC;AACnF,IAAM,oBAAoB,oBAAI,IAAI,CAAC,SAAS,OAAO,CAAC;AAE3D,IAAM,wBAAwB;AAC9B,IAAM,yBAAyB;AAC/B,IAAM,mBAAmB;AAGzB,IAAM,qBAAqB;AAAA,EACzB;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AACF;AAGA,IAAM,gBAAgB;AAAA,EACpB;AAAA,EAAc;AAAA,EAAc;AAAA,EAAiB;AAAA,EAC7C;AAAA,EAAgB;AAAA,EAAiB;AAAA,EAAY;AAAA,EAAW;AAAA,EACxD;AAAA,EAA8B;AAAA,EAAkB;AAAA,EAAmB;AACrE;AACA,IAAM,yBAAyB;AAE/B,SAAS,YAAY,UAA2B;AAC9C,QAAM,WAAO,4BAAS,QAAQ;AAC9B,SAAO,mBAAmB,KAAK,CAAC,MAAM,EAAE,KAAK,IAAI,KAAK,EAAE,KAAK,QAAQ,CAAC;AACxE;AAEA,SAAS,eAAe,UAA2B;AACjD,MAAI;AACF,UAAM,WAAO,8BAAa,UAAU,OAAO,EAAE,MAAM,GAAG,GAAI;AAC1D,UAAM,OAAO,cAAc,OAAO,CAAC,MAAM,EAAE,KAAK,IAAI,CAAC,EAAE;AACvD,WAAO,QAAQ;AAAA,EACjB,QAAQ;AACN,WAAO;AAAA,EACT;AACF;AAEA,IAAM,oBAAoB,oBAAI,IAAI,CAAC,aAAa,aAAa,eAAe,aAAa,cAAc,CAAC;AAEjG,SAAS,aAAa,UAAmC;AAC9D,QAAM,UAAM,2BAAQ,QAAQ,EAAE,YAAY;AAC1C,MAAIF,iBAAgB,IAAI,GAAG,EAAG;AAC9B,MAAIC,kBAAiB,IAAI,GAAG,GAAG;AAE7B,UAAM,QAAQ,SAAS,MAAM,qBAAG;AAChC,QAAI,MAAM,KAAK,CAAC,MAAM,CAAC,GAAG,iBAAiB,EAAE,KAAK,CAAC,MAAM,EAAE,SAAS,CAAC,CAAC,CAAC,EAAG,QAAO;AACjF;AAAA,EACF;AACA,MAAIC,kBAAiB,IAAI,GAAG,EAAG;AAC/B,MAAI,eAAe,IAAI,GAAG,GAAG;AAC3B,QAAI,eAAe,QAAQ,EAAG;AAC9B;AAAA,EACF;AACA,MAAI,kBAAkB,IAAI,GAAG,EAAG;AAChC,SAAO;AACT;AA4EA,SAAS,WAAW,UAA0B;AAC5C,MAAI;AACF,UAAM,WAAO,8BAAa,UAAU,OAAO;AAC3C,WAAO,KAAK,MAAM,KAAK,EAAE,OAAO,OAAO,EAAE;AAAA,EAC3C,QAAQ;AACN,WAAO;AAAA,EACT;AACF;AAGA,IAAM,YAAY,oBAAI,IAAI;AAAA,EACxB;AAAA,EAAQ;AAAA,EAAS;AAAA,EAAO;AAAA,EAAQ;AAAA,EAAgB;AAAA,EAAe;AAAA,EAC/D;AAAA,EAAQ;AAAA,EAAS;AAAA,EAAU;AAAA,EAAO;AAAA,EAAiB;AAAA,EACnD;AAAA,EAAiB;AAAA,EAAe;AAAA,EAAe;AAAA,EAAQ;AACzD,CAAC;AAED,SAAS,WAAW,MAAuB;AACzC,MAAI,UAAU,IAAI,IAAI,EAAG,QAAO;AAChC,MAAI,KAAK,SAAS,OAAO,KAAK,KAAK,SAAS,MAAM,EAAG,QAAO;AAC5D,MAAI,KAAK,SAAS,WAAW,EAAG,QAAO;AACvC,SAAO;AACT;AAEA,SAAS,mBAAmB,MAAwB;AAClD,QAAM,iBAAa,wBAAK,MAAM,iBAAiB;AAC/C,MAAI,KAAC,4BAAW,UAAU,EAAG,QAAO,CAAC;AACrC,QAAM,WAAqB,CAAC;AAC5B,WAAS,YAAQ,8BAAa,YAAY,OAAO,EAAE,MAAM,IAAI,GAAG;AAC9D,WAAO,KAAK,KAAK;AACjB,QAAI,QAAQ,CAAC,KAAK,WAAW,GAAG,GAAG;AACjC,eAAS,KAAK,IAAI;AAAA,IACpB;AAAA,EACF;AACA,SAAO;AACT;AAEA,SAAS,UAAU,MAAc,SAA0B;AAEzD,QAAM,QAAQ,QACX,QAAQ,qBAAqB,MAAM,EACnC,QAAQ,OAAO,IAAI,EACnB,QAAQ,OAAO,GAAG;AACrB,SAAO,IAAI,OAAO,IAAI,KAAK,GAAG,EAAE,KAAK,IAAI;AAC3C;AAEA,SAAS,UAAU,UAAkB,MAAc,UAA6B;AAC9E,MAAI,SAAS,WAAW,EAAG,QAAO;AAClC,MAAI;AACJ,MAAI;AACF,cAAM,4BAAS,MAAM,QAAQ,EAAE,QAAQ,OAAO,GAAG;AAAA,EACnD,QAAQ;AACN,WAAO;AAAA,EACT;AACA,QAAM,QAAQ,IAAI,MAAM,GAAG;AAC3B,aAAW,WAAW,UAAU;AAC9B,UAAM,IAAI,QAAQ,QAAQ,cAAc,EAAE;AAC1C,QAAI,CAAC,EAAG;AACR,QAAI,UAAU,KAAK,CAAC,EAAG,QAAO;AAC9B,QAAI,cAAU,4BAAS,QAAQ,GAAG,CAAC,EAAG,QAAO;AAC7C,aAAS,IAAI,GAAG,IAAI,MAAM,QAAQ,KAAK;AACrC,UAAI,UAAU,MAAM,CAAC,GAAI,CAAC,EAAG,QAAO;AACpC,UAAI,UAAU,MAAM,MAAM,GAAG,IAAI,CAAC,EAAE,KAAK,GAAG,GAAG,CAAC,EAAG,QAAO;AAAA,IAC5D;AAAA,EACF;AACA,SAAO;AACT;AAEA,SAAS,QACP,KACA,MACA,gBACA,gBACA,WACU;AACV,QAAM,SAAmB,CAAC;AAC1B,MAAI;AACJ,MAAI;AACF,kBAAU,6BAAY,GAAG;AAAA,EAC3B,QAAQ;AACN,WAAO;AAAA,EACT;AAEA,aAAW,SAAS,SAAS;AAC3B,UAAM,WAAO,wBAAK,KAAK,KAAK;AAC5B,QAAI;AACJ,QAAI;AACF,aAAO,qBAAiB,0BAAS,IAAI,QAAI,2BAAU,IAAI;AAAA,IACzD,QAAQ;AACN;AAAA,IACF;AAEA,QAAI,KAAK,YAAY,GAAG;AACtB,UAAI,CAAC,WAAW;AACd,YAAI,MAAM,WAAW,GAAG,EAAG;AAC3B,YAAI,WAAW,KAAK,EAAG;AACvB,YAAI,UAAU,MAAM,MAAM,cAAc,EAAG;AAAA,MAC7C;AACA,aAAO,KAAK,GAAG,QAAQ,MAAM,MAAM,gBAAgB,gBAAgB,SAAS,CAAC;AAAA,IAC/E,WAAW,KAAK,OAAO,GAAG;AACxB,aAAO,KAAK,IAAI;AAAA,IAClB;AAAA,EACF;AAEA,SAAO;AACT;AAEO,SAAS,OAAO,MAAc,SAAyD;AAC5F,QAAM,iBAAiB,SAAS,kBAAkB;AAClD,QAAM,mBAAe,2BAAQ,IAAI;AACjC,QAAM,iBAAiB,mBAAmB,YAAY;AACtD,QAAM,mBAAe,wBAAK,cAAc,gBAAgB,WAAW;AACnE,QAAM,gBAAY,wBAAK,cAAc,gBAAgB,QAAQ;AAE7D,QAAM,QAAkC;AAAA,IACtC,MAAM,CAAC;AAAA,IAAG,UAAU,CAAC;AAAA,IAAG,OAAO,CAAC;AAAA,IAAG,OAAO,CAAC;AAAA,EAC7C;AACA,MAAI,aAAa;AACjB,QAAM,mBAA6B,CAAC;AAGpC,QAAM,WAAW,QAAQ,cAAc,cAAc,gBAAgB,gBAAgB,KAAK;AAG1F,UAAI,4BAAW,SAAS,GAAG;AACzB,aAAS,KAAK,GAAG,QAAQ,WAAW,cAAc,gBAAgB,gBAAgB,IAAI,CAAC;AAAA,EACzF;AAEA,QAAM,OAAO,oBAAI,IAAY;AAE7B,aAAW,KAAK,UAAU;AACxB,QAAI,KAAK,IAAI,CAAC,EAAG;AACjB,SAAK,IAAI,CAAC;AAEV,UAAM,eAAW,4BAAW,SAAS,KAAK,EAAE,WAAW,SAAS;AAChE,QAAI,CAAC,UAAU;AACb,cAAI,4BAAS,CAAC,EAAE,WAAW,GAAG,EAAG;AACjC,UAAI,EAAE,WAAW,YAAY,EAAG;AAAA,IAClC;AACA,QAAI,UAAU,GAAG,cAAc,cAAc,EAAG;AAChD,QAAI,YAAY,CAAC,GAAG;AAClB,uBAAiB,KAAK,CAAC;AACvB;AAAA,IACF;AAEA,UAAM,QAAQ,aAAa,CAAC;AAC5B,QAAI,CAAC,MAAO;AAGZ,QAAI,kBAAkB,QAAI,2BAAQ,CAAC,EAAE,YAAY,CAAC,GAAG;AAGnD,uBAAiB,KAAK,IAAI,oDAAoD;AAC9E;AAAA,IACF;AAEA,UAAM,KAAK,EAAG,KAAK,CAAC;AACpB,kBAAc,WAAW,CAAC;AAAA,EAC5B;AAEA,QAAM,aAAa,OAAO,OAAO,KAAK,EAAE,OAAO,CAAC,GAAG,MAAM,IAAI,EAAE,QAAQ,CAAC;AACxE,QAAM,aAAa,cAAc;AAEjC,MAAI,UAAyB;AAC7B,MAAI,CAAC,YAAY;AACf,cAAU,cAAc,WAAW,eAAe,CAAC;AAAA,EACrD,WAAW,cAAc,0BAA0B,cAAc,kBAAkB;AACjF,cACE,iBAAiB,UAAU,gBAAa,WAAW,eAAe,CAAC;AAAA,EAGvE;AAEA,SAAO;AAAA,IACL;AAAA,IACA,aAAa;AAAA,IACb,aAAa;AAAA,IACb,aAAa;AAAA,IACb;AAAA,IACA,mBAAmB;AAAA,IACnB,yBAAyB,eAAe;AAAA,EAC1C;AACF;AAEO,SAAS,aAAa,eAAuB,eAAuC;AACzF,MAAI;AACF,WAAO,KAAK,UAAM,8BAAa,cAAc,OAAO,CAAC;AAAA,EACvD,QAAQ;AACN,WAAO,CAAC;AAAA,EACV;AACF;AAEO,SAAS,aAAa,OAAiC,eAAuB,eAAqB;AACxG,QAAM,WAAmC,CAAC;AAC1C,aAAW,YAAY,OAAO,OAAO,KAAK,GAAG;AAC3C,eAAW,KAAK,UAAU;AACxB,UAAI;AACF,iBAAS,CAAC,QAAI,0BAAS,CAAC,EAAE;AAAA,MAC5B,QAAQ;AAAA,MAAwC;AAAA,IAClD;AAAA,EACF;AACA,QAAM,UAAM,wBAAK,cAAc,IAAI;AACnC,iCAAU,KAAK,EAAE,WAAW,KAAK,CAAC;AAClC,qCAAc,cAAc,KAAK,UAAU,UAAU,MAAM,CAAC,CAAC;AAC/D;AAEO,SAAS,kBAAkB,MAAc,eAAuB,eAAgC;AACrG,QAAM,OAAO,OAAO,IAAI;AACxB,QAAM,WAAW,aAAa,YAAY;AAE1C,MAAI,OAAO,KAAK,QAAQ,EAAE,WAAW,GAAG;AACtC,WAAO;AAAA,MACL,GAAG;AAAA,MACH,aAAa;AAAA,MACb,WAAW,KAAK;AAAA,MAChB,iBAAiB,OAAO,YAAY,OAAO,KAAK,KAAK,KAAK,EAAE,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;AAAA,MAC/E,WAAW,KAAK;AAAA,IAClB;AAAA,EACF;AAEA,QAAM,WAAqC,CAAC;AAC5C,QAAM,iBAA2C,CAAC;AAClD,aAAW,KAAK,OAAO,KAAK,KAAK,KAAK,GAAG;AACvC,aAAS,CAAC,IAAI,CAAC;AACf,mBAAe,CAAC,IAAI,CAAC;AAAA,EACvB;AAEA,aAAW,CAAC,OAAO,QAAQ,KAAK,OAAO,QAAQ,KAAK,KAAK,GAAG;AAC1D,eAAW,KAAK,UAAU;AACxB,YAAM,cAAc,SAAS,CAAC;AAC9B,UAAI,eAAe;AACnB,UAAI;AAAE,2BAAe,0BAAS,CAAC,EAAE;AAAA,MAAS,QAAQ;AAAA,MAAe;AACjE,UAAI,gBAAgB,UAAa,eAAe,aAAa;AAC3D,iBAAS,KAAK,EAAG,KAAK,CAAC;AAAA,MACzB,OAAO;AACL,uBAAe,KAAK,EAAG,KAAK,CAAC;AAAA,MAC/B;AAAA,IACF;AAAA,EACF;AAEA,QAAM,eAAe,IAAI,IAAI,OAAO,OAAO,KAAK,KAAK,EAAE,KAAK,CAAC;AAC7D,QAAM,eAAe,OAAO,KAAK,QAAQ,EAAE,OAAO,CAAC,MAAM,CAAC,aAAa,IAAI,CAAC,CAAC;AAC7E,QAAM,WAAW,OAAO,OAAO,QAAQ,EAAE,OAAO,CAAC,GAAG,MAAM,IAAI,EAAE,QAAQ,CAAC;AAEzE,SAAO;AAAA,IACL,GAAG;AAAA,IACH,aAAa;AAAA,IACb,WAAW;AAAA,IACX,iBAAiB;AAAA,IACjB,WAAW;AAAA,IACX,eAAe;AAAA,EACjB;AACF;;;AHzYA;AACA;AACA;;;AIZA,IAAAC,kBAAyC;AACzC,IAAAC,qBAAkB;AAGlB,IAAM,kBAAkB;AAExB,SAAS,eAAe,MAAsB;AAC5C,SAAO,KAAK,IAAI,GAAG,KAAK,MAAM,KAAK,SAAS,eAAe,CAAC;AAC9D;AAEA,SAAS,oBAAoB,GAAU,UAAkB,QAAgB,GAAW;AAClF,QAAM,QAAQ,SAAS,YAAY,EAAE,MAAM,KAAK,EAAE,OAAO,CAAC,MAAM,EAAE,SAAS,CAAC;AAC5E,QAAM,SAA6B,CAAC;AACpC,IAAE,YAAY,CAAC,KAAK,SAAS;AAC3B,UAAM,SAAU,KAAK,SAAoB,IAAI,YAAY;AACzD,UAAM,QAAQ,MAAM,OAAO,CAAC,MAAM,MAAM,SAAS,CAAC,CAAC,EAAE;AACrD,QAAI,QAAQ,EAAG,QAAO,KAAK,CAAC,OAAO,GAAG,CAAC;AAAA,EACzC,CAAC;AACD,SAAO,KAAK,CAAC,GAAG,MAAM,EAAE,CAAC,IAAI,EAAE,CAAC,CAAC;AACjC,QAAM,aAAa,OAAO,MAAM,GAAG,CAAC,EAAE,IAAI,CAAC,CAAC,EAAE,GAAG,MAAM,GAAG;AAC1D,MAAI,WAAW,WAAW,EAAG,QAAO;AAEpC,QAAM,UAAU,IAAI,IAAI,UAAU;AAClC,MAAI,WAAW,IAAI,IAAI,UAAU;AACjC,QAAM,YAAgC,CAAC;AAEvC,WAAS,IAAI,GAAG,IAAI,OAAO,KAAK;AAC9B,UAAM,eAAe,oBAAI,IAAY;AACrC,eAAW,KAAK,UAAU;AACxB,QAAE,gBAAgB,GAAG,CAAC,aAAa;AACjC,YAAI,CAAC,QAAQ,IAAI,QAAQ,GAAG;AAC1B,uBAAa,IAAI,QAAQ;AACzB,oBAAU,KAAK,CAAC,GAAG,QAAQ,CAAC;AAAA,QAC9B;AAAA,MACF,CAAC;AAAA,IACH;AACA,eAAW,KAAK,aAAc,SAAQ,IAAI,CAAC;AAC3C,eAAW;AAAA,EACb;AAEA,QAAM,QAAkB,CAAC;AACzB,aAAW,OAAO,SAAS;AACzB,UAAM,IAAI,EAAE,kBAAkB,GAAG;AACjC,UAAM,KAAK,QAAQ,EAAE,SAAS,GAAG,QAAQ,EAAE,eAAe,EAAE,QAAQ,EAAE,mBAAmB,EAAE,EAAE;AAAA,EAC/F;AACA,aAAW,CAAC,GAAG,CAAC,KAAK,WAAW;AAC9B,QAAI,QAAQ,IAAI,CAAC,KAAK,QAAQ,IAAI,CAAC,GAAG;AACpC,YAAM,OAAO,EAAE,KAAK,GAAG,CAAC;AACxB,UAAI,MAAM;AACR,cAAM,IAAI,EAAE,kBAAkB,IAAI;AAClC,cAAM,KAAK,QAAQ,EAAE,iBAAiB,GAAG,OAAO,KAAK,CAAC,MAAM,EAAE,YAAY,EAAE,OAAO,EAAE,iBAAiB,GAAG,OAAO,KAAK,CAAC,EAAE;AAAA,MAC1H;AAAA,IACF;AAAA,EACF;AAEA,SAAO,eAAe,MAAM,KAAK,IAAI,CAAC;AACxC;AAEA,IAAM,mBAAmB;AAAA,EACvB;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AACF;AAOA,SAAS,UAAU,WAA0B;AAC3C,QAAM,MAAM,KAAK,UAAM,8BAAa,WAAW,OAAO,CAAC;AACvD,QAAM,IAAI,IAAI,mBAAAC,QAAM,EAAE,MAAM,aAAa,CAAC;AAC1C,aAAW,QAAQ,IAAI,SAAS,CAAC,GAAG;AAClC,UAAM,EAAE,IAAI,GAAG,MAAM,IAAI;AACzB,MAAE,UAAU,IAAI,KAAK;AAAA,EACvB;AACA,aAAW,QAAQ,IAAI,SAAS,CAAC,GAAG;AAClC,UAAM,EAAE,QAAQ,QAAQ,GAAG,MAAM,IAAI;AACrC,QAAI,EAAE,QAAQ,MAAM,KAAK,EAAE,QAAQ,MAAM,GAAG;AAC1C,UAAI;AAAE,UAAE,UAAU,QAAQ,QAAQ,KAAK;AAAA,MAAG,QAAQ;AAAA,MAAe;AAAA,IACnE;AAAA,EACF;AACA,SAAO;AACT;AAEO,SAAS,aACd,YAAoB,2BACpB,sBACA,WACiB;AACjB,QAAM,UAAU,OAAO,yBAAyB,WAC5C,EAAE,aAAa,sBAAsB,UAAU,IAC9C,wBAAwB,CAAC;AAE9B,MAAI,KAAC,4BAAW,SAAS,GAAG;AAC1B,WAAO,EAAE,OAAO,yBAAyB,SAAS,2BAA2B;AAAA,EAC/E;AAEA,QAAM,IAAI,UAAU,SAAS;AAE7B,QAAM,cAAc,QAAQ,eAAgB,EAAE,QAAQ;AAEtD,MAAI,gBAAgB,QAAW;AAC7B,WAAO,EAAE,OAAO,mCAAmC;AAAA,EACrD;AAEA,QAAM,eAAe,KAAK,MAAO,cAAc,MAAO,EAAE;AACxD,QAAM,KAAK,QAAQ,aAAa;AAChC,QAAM,cAAoF,CAAC;AAE3F,aAAW,KAAK,IAAI;AAClB,UAAM,KAAK,oBAAoB,GAAG,CAAC;AACnC,QAAI,KAAK,GAAG;AACV,kBAAY,KAAK;AAAA,QACf,UAAU;AAAA,QACV,cAAc;AAAA,QACd,WAAW,KAAK,MAAO,eAAe,KAAM,EAAE,IAAI;AAAA,MACpD,CAAC;AAAA,IACH;AAAA,EACF;AAEA,MAAI,YAAY,WAAW,GAAG;AAC5B,WAAO,EAAE,OAAO,uEAAuE;AAAA,EACzF;AAEA,QAAM,iBAAiB,KAAK;AAAA,IAC1B,YAAY,OAAO,CAAC,GAAG,MAAM,IAAI,EAAE,cAAc,CAAC,IAAI,YAAY;AAAA,EACpE;AACA,QAAM,iBAAiB,iBAAiB,IAAI,KAAK,MAAO,eAAe,iBAAkB,EAAE,IAAI,KAAK;AAEpG,SAAO;AAAA,IACL,eAAe;AAAA,IACf,cAAc;AAAA,IACd,OAAO,EAAE;AAAA,IACT,OAAO,EAAE;AAAA,IACT,kBAAkB;AAAA,IAClB,iBAAiB;AAAA,IACjB,cAAc;AAAA,EAChB;AACF;AAEO,SAAS,eAAe,QAA+B;AAC5D,MAAI,OAAO,OAAO;AAChB,YAAQ,IAAI,oBAAoB,OAAO,KAAK,EAAE;AAC9C;AAAA,EACF;AAEA,UAAQ,IAAI;AAAA,mCAAsC;AAClD,UAAQ,IAAI,SAAI,OAAO,EAAE,CAAC;AAC1B,UAAQ,IAAI,sBAAsB,OAAO,aAAc,eAAe,CAAC,kBAAa,OAAO,cAAe,eAAe,CAAC,iBAAiB;AAC3I,UAAQ,IAAI,sBAAsB,OAAO,MAAO,eAAe,CAAC,WAAW,OAAO,MAAO,eAAe,CAAC,QAAQ;AACjH,UAAQ,IAAI,uBAAuB,OAAO,iBAAkB,eAAe,CAAC,SAAS;AACrF,UAAQ,IAAI,sBAAsB,OAAO,eAAe,0BAA0B;AAClF,UAAQ,IAAI;AAAA,gBAAmB;AAC/B,aAAW,KAAK,OAAO,cAAe;AACpC,YAAQ,IAAI,QAAQ,EAAE,SAAS,MAAM,EAAE,SAAS,MAAM,GAAG,EAAE,CAAC,EAAE;AAAA,EAChE;AACA,UAAQ,IAAI;AACd;;;AC7JA,IAAAC,kBAAqD;AACrD,IAAAC,oBAA0D;AAC1D;AAMA,SAAS,QAAQ,GAAmB;AAClC,SAAO,EACJ,QAAQ,OAAO,MAAM,EACrB,QAAQ,MAAM,KAAK,EACnB,QAAQ,OAAO,GAAG,EAClB,QAAQ,OAAO,GAAG;AACvB;AAEA,SAASC,cAAa,KAAa,QAAwB;AACzD,MAAI;AACJ,MAAI;AACF,aAAS,IAAI,IAAI,GAAG;AAAA,EACtB,QAAQ;AACN,WAAO,UAAU,MAAM;AAAA,EACzB;AACA,MAAI,OAAO,OAAO,WAAW,OAAO;AACpC,SAAO,KAAK,QAAQ,YAAY,GAAG,EAAE,QAAQ,YAAY,EAAE;AAC3D,SAAO,KAAK,QAAQ,OAAO,GAAG,EAAE,MAAM,GAAG,EAAE;AAC3C,SAAO,OAAO;AAChB;AAEA,SAAS,cAAc,KAAqB;AAC1C,QAAM,QAAQ,IAAI,YAAY;AAC9B,MAAI,MAAM,SAAS,aAAa,KAAK,MAAM,SAAS,OAAO,EAAG,QAAO;AACrE,MAAI,MAAM,SAAS,WAAW,EAAG,QAAO;AACxC,MAAI,MAAM,SAAS,YAAY,EAAG,QAAO;AACzC,MAAI,MAAM,SAAS,aAAa,KAAK,MAAM,SAAS,UAAU;AAC5D,WAAO;AACT,MAAI;AACF,UAAM,SAAS,IAAI,IAAI,GAAG;AAC1B,UAAM,OAAO,OAAO,SAAS,YAAY;AACzC,QAAI,KAAK,SAAS,MAAM,EAAG,QAAO;AAClC,QACE,CAAC,QAAQ,QAAQ,SAAS,SAAS,MAAM,EAAE;AAAA,MAAK,CAAC,QAC/C,KAAK,SAAS,GAAG;AAAA,IACnB;AAEA,aAAO;AAAA,EACX,QAAQ;AAAA,EAER;AACA,SAAO;AACT;AAEA,eAAe,eAAe,MAAc,MAA+B;AACzE,MAAI;AACF,UAAM,mBAAmB,MAAM,OAAO,UAAU,GAAG;AACnD,UAAM,KAAK,IAAI,gBAAgB;AAAA,MAC7B,cAAc;AAAA,MACd,gBAAgB;AAAA,IAClB,CAAC;AACD,WAAO,GAAG,SAAS,IAAI;AAAA,EACzB,QAAQ;AAEN,QAAI,OAAO,KAAK,QAAQ,iCAAiC,EAAE;AAC3D,WAAO,KAAK,QAAQ,+BAA+B,EAAE;AACrD,WAAO,KAAK,QAAQ,YAAY,GAAG;AACnC,WAAO,KAAK,QAAQ,QAAQ,GAAG,EAAE,KAAK;AACtC,WAAO,KAAK,MAAM,GAAG,GAAI;AAAA,EAC3B;AACF;AAMA,eAAe,WACb,KACA,QACA,aAC2B;AAC3B,QAAM,YAAY,IAAI,QAAQ,SAAS,aAAa;AACpD,QAAM,YAAY,0CAA0C,mBAAmB,SAAS,CAAC;AAEzF,MAAI;AACJ,MAAI;AACJ,MAAI;AACF,UAAM,OAAO,KAAK,MAAM,MAAM,cAAc,SAAS,CAAC;AAItD,iBAAc,KAAK,QAAmB,IACnC,QAAQ,YAAY,EAAE,EACtB,KAAK;AACR,kBAAe,KAAK,eAA0B;AAAA,EAChD,QAAQ;AACN,gBAAY,YAAY,GAAG;AAC3B,kBAAc;AAAA,EAChB;AAEA,QAAM,OAAM,oBAAI,KAAK,GAAE,YAAY;AACnC,QAAM,UAAU;AAAA,cACJ,GAAG;AAAA;AAAA,UAEP,WAAW;AAAA,eACN,GAAG;AAAA,eACH,eAAe,UAAU,SAAS;AAAA;AAAA;AAAA,cAGnC,WAAW;AAAA;AAAA,EAEvB,SAAS;AAAA;AAAA,UAED,GAAG;AAAA;AAEX,QAAM,WAAWA,cAAa,KAAK,KAAK;AACxC,SAAO,CAAC,SAAS,QAAQ;AAC3B;AAEA,eAAe,aACb,KACA,QACA,aAC2B;AAC3B,QAAM,OAAO,MAAM,cAAc,GAAG;AAEpC,QAAM,aAAa,KAAK,MAAM,8BAA8B;AAC5D,QAAM,QAAQ,aACV,WAAW,CAAC,EAAG,QAAQ,QAAQ,GAAG,EAAE,KAAK,IACzC;AAEJ,QAAM,WAAW,MAAM,eAAe,MAAM,GAAG;AAC/C,QAAM,OAAM,oBAAI,KAAK,GAAE,YAAY;AACnC,QAAM,UAAU;AAAA,cACJ,GAAG;AAAA;AAAA,UAEP,QAAQ,KAAK,CAAC;AAAA,eACT,GAAG;AAAA,eACH,eAAe,UAAU,SAAS;AAAA;AAAA;AAAA,IAG7C,KAAK;AAAA;AAAA,UAEC,GAAG;AAAA;AAAA;AAAA;AAAA,EAIX,SAAS,MAAM,GAAG,IAAK,CAAC;AAAA;AAExB,QAAM,WAAWA,cAAa,KAAK,KAAK;AACxC,SAAO,CAAC,SAAS,QAAQ;AAC3B;AAEA,eAAe,WACb,KACA,QACA,aAC2B;AAC3B,QAAM,aAAa,IAAI,MAAM,kBAAkB;AAC/C,MAAI,CAAC,YAAY;AACf,WAAO,aAAa,KAAK,QAAQ,WAAW;AAAA,EAC9C;AAEA,QAAM,UAAU,WAAW,CAAC;AAC5B,MAAI,QAAQ;AACZ,MAAI,WAAW;AACf,MAAI,eAAe;AAEnB,QAAM,SAAS,gCAAgC,OAAO;AACtD,MAAI;AACF,UAAM,OAAO,MAAM,cAAc,MAAM;AACvC,UAAM,gBAAgB,KAAK;AAAA,MACzB;AAAA,IACF;AACA,QAAI,eAAe;AACjB,iBAAW,cAAc,CAAC,EAAG,QAAQ,YAAY,EAAE,EAAE,KAAK;AAAA,IAC5D;AACA,UAAM,aAAa,KAAK;AAAA,MACtB;AAAA,IACF;AACA,QAAI,YAAY;AACd,cAAQ,WAAW,CAAC,EAAG,QAAQ,YAAY,GAAG,EAAE,KAAK;AAAA,IACvD;AACA,UAAM,eAAe,KAAK;AAAA,MACxB;AAAA,IACF;AACA,QAAI,cAAc;AAChB,qBAAe,aAAa,CAAC,EAAG,QAAQ,YAAY,EAAE,EAAE,KAAK;AAAA,IAC/D;AAAA,EACF,QAAQ;AAAA,EAER;AAEA,QAAM,OAAM,oBAAI,KAAK,GAAE,YAAY;AACnC,QAAM,UAAU;AAAA,cACJ,GAAG;AAAA,YACL,OAAO;AAAA;AAAA,UAET,KAAK;AAAA,kBACG,YAAY;AAAA,eACf,GAAG;AAAA,eACH,eAAe,UAAU,SAAS;AAAA;AAAA;AAAA,IAG7C,KAAK;AAAA;AAAA,eAEM,YAAY;AAAA,aACd,OAAO;AAAA;AAAA;AAAA;AAAA,EAIlB,QAAQ;AAAA;AAAA,UAEA,GAAG;AAAA;AAEX,QAAM,WAAW,SAAS,QAAQ,QAAQ,KAAK,GAAG,CAAC;AACnD,SAAO,CAAC,SAAS,QAAQ;AAC3B;AAEA,eAAe,eACb,KACA,QACA,WACiB;AACjB,QAAM,WAAWA,cAAa,KAAK,MAAM;AACzC,QAAM,cAAU,kBAAAC,SAAY,WAAW,QAAQ;AAC/C,QAAM,OAAO,MAAM,UAAU,GAAG;AAChC,qCAAc,SAAS,IAAI;AAC3B,SAAO;AACT;AAOA,SAAS,uBACP,iBACA,aACuD;AACvD,MAAI,OAAO,oBAAoB,YAAY,mBAAmB,MAAM;AAClE,WAAO;AAAA,MACL,QAAQ,mBAAmB;AAAA,MAC3B,aAAa,eAAe;AAAA,IAC9B;AAAA,EACF;AAEA,SAAO;AAAA,IACL,QAAQ,gBAAgB,UAAU;AAAA,IAClC,aAAa,gBAAgB,eAAe;AAAA,EAC9C;AACF;AAMA,eAAsB,OACpB,KACA,WACA,kBAAiD,MACjD,cAA6B,MACZ;AACjB,iCAAU,WAAW,EAAE,WAAW,KAAK,CAAC;AACxC,QAAM,UAAU,cAAc,GAAG;AACjC,QAAM,EAAE,QAAQ,aAAa,sBAAsB,IAAI;AAAA,IACrD;AAAA,IACA;AAAA,EACF;AAEA,QAAM,YAAY,GAAG;AAErB,MAAI;AACJ,MAAI;AAEJ,MAAI,YAAY,OAAO;AACrB,UAAM,MAAM,MAAM,eAAe,KAAK,QAAQ,SAAS;AACvD,YAAQ,IAAI,uBAAmB,4BAAS,GAAG,CAAC,EAAE;AAC9C,WAAO;AAAA,EACT;AAEA,MAAI,YAAY,SAAS;AACvB,QAAI;AACJ,QAAI;AACF,eAAS,IAAI,IAAI,GAAG;AAAA,IACtB,QAAQ;AACN,YAAM,IAAI,MAAM,gBAAgB,GAAG,EAAE;AAAA,IACvC;AACA,UAAM,aAAS,2BAAQ,OAAO,QAAQ,KAAK;AAC3C,UAAM,MAAM,MAAM,eAAe,KAAK,QAAQ,SAAS;AACvD,YAAQ,IAAI,yBAAqB,4BAAS,GAAG,CAAC,EAAE;AAChD,WAAO;AAAA,EACT;AAEA,MAAI,YAAY,SAAS;AACvB,KAAC,SAAS,QAAQ,IAAI,MAAM,WAAW,KAAK,QAAQ,qBAAqB;AAAA,EAC3E,WAAW,YAAY,SAAS;AAC9B,KAAC,SAAS,QAAQ,IAAI,MAAM,WAAW,KAAK,QAAQ,qBAAqB;AAAA,EAC3E,OAAO;AACL,KAAC,SAAS,QAAQ,IAAI,MAAM,aAAa,KAAK,QAAQ,qBAAqB;AAAA,EAC7E;AAEA,MAAI,cAAU,kBAAAA,SAAY,WAAW,QAAQ;AAC7C,MAAI,UAAU;AACd,aAAO,4BAAW,OAAO,GAAG;AAC1B,UAAM,OAAO,SAAS,QAAQ,SAAS,EAAE;AACzC,kBAAU,kBAAAA,SAAY,WAAW,GAAG,IAAI,IAAI,OAAO,KAAK;AACxD;AAAA,EACF;AAEA,qCAAc,SAAS,SAAS,OAAO;AACvC,UAAQ,IAAI,SAAS,OAAO,SAAK,4BAAS,OAAO,CAAC,EAAE;AACpD,SAAO;AACT;AAMO,SAAS,gBACd,mBASA,QACA,WACA,YAAoB,SACpB,cAA+B,MACvB;AACR,QAAM,UAAU,OAAO,sBAAsB,WACzC;AAAA,IACA,UAAU;AAAA,IACV,QAAQ,UAAU;AAAA,IAClB,WAAW,aAAa;AAAA,IACxB;AAAA,IACA;AAAA,EACF,IACE;AAAA,IACA,UAAU,kBAAkB;AAAA,IAC5B,QAAQ,kBAAkB;AAAA,IAC1B,WAAW,kBAAkB;AAAA,IAC7B,WAAW,kBAAkB,aAAa;AAAA,IAC1C,aAAa,kBAAkB,eAAe;AAAA,EAChD;AAEF,MAAI,CAAC,QAAQ,SAAU,OAAM,IAAI,MAAM,qCAAqC;AAC5E,MAAI,CAAC,QAAQ,UAAW,OAAM,IAAI,MAAM,sCAAsC;AAE9E,QAAM,kBAAkB,QAAQ,UAAU;AAC1C,iCAAU,QAAQ,WAAW,EAAE,WAAW,KAAK,CAAC;AAEhD,QAAM,MAAM,oBAAI,KAAK;AACrB,QAAM,OAAO,QAAQ,SAClB,YAAY,EACZ,QAAQ,UAAU,GAAG,EACrB,MAAM,GAAG,EAAE,EACX,QAAQ,OAAO,EAAE;AACpB,QAAM,KAAK,IACR,YAAY,EACZ,QAAQ,SAAS,EAAE,EACnB,QAAQ,KAAK,GAAG,EAChB,MAAM,GAAG,EAAE;AACd,QAAM,WAAW,SAAS,EAAE,IAAI,IAAI;AAEpC,QAAM,mBAAmB;AAAA,IACvB;AAAA,IACA,UAAU,QAAQ,SAAS;AAAA,IAC3B,UAAU,IAAI,YAAY,CAAC;AAAA,IAC3B,cAAc,QAAQ,QAAQ,QAAQ,CAAC;AAAA,IACvC;AAAA,EACF;AACA,MAAI,QAAQ,eAAe,QAAQ,YAAY,SAAS,GAAG;AACzD,UAAM,WAAW,QAAQ,YACtB,MAAM,GAAG,EAAE,EACX,IAAI,CAAC,MAAM,IAAI,CAAC,GAAG,EACnB,KAAK,IAAI;AACZ,qBAAiB,KAAK,kBAAkB,QAAQ,GAAG;AAAA,EACrD;AACA,mBAAiB,KAAK,KAAK;AAE3B,QAAM,YAAY;AAAA,IAChB;AAAA,IACA,QAAQ,QAAQ,QAAQ;AAAA,IACxB;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,EACF;AACA,MAAI,QAAQ,eAAe,QAAQ,YAAY,SAAS,GAAG;AACzD,cAAU,KAAK,IAAI,mBAAmB,EAAE;AACxC,eAAW,KAAK,QAAQ,aAAa;AACnC,gBAAU,KAAK,KAAK,CAAC,EAAE;AAAA,IACzB;AAAA,EACF;AAEA,QAAM,UAAU,CAAC,GAAG,kBAAkB,GAAG,SAAS,EAAE,KAAK,IAAI;AAC7D,QAAM,cAAU,kBAAAA,SAAY,QAAQ,WAAW,QAAQ;AACvD,qCAAc,SAAS,SAAS,OAAO;AACvC,SAAO;AACT;AAMA,IAAM,oBAAoB,OAAO,YAAY,eAC3C,OAAO,QAAQ,KAAK,CAAC,MAAM,YAC3B,8BAA8B,SAAK,4BAAS,QAAQ,KAAK,CAAC,CAAC,CAAC;AAE9D,IAAI,mBAAmB;AACrB,QAAM,MAAM,QAAQ,KAAK,CAAC;AAC1B,QAAM,YAAY,QAAQ,KAAK,CAAC,KAAK;AACrC,QAAM,SAAS,QAAQ,KAAK,CAAC,KAAK;AAClC,MAAI,CAAC,KAAK;AACR,YAAQ,MAAM,2CAA2C;AACzD,YAAQ,KAAK,CAAC;AAAA,EAChB;AACA,SAAO,KAAK,WAAW,MAAM,EAC1B,KAAK,CAAC,QAAQ,QAAQ,IAAI,uBAAuB,GAAG,EAAE,CAAC,EACvD,MAAM,CAAC,QAAQ;AACd,YAAQ,MAAM,GAAG;AACjB,YAAQ,KAAK,CAAC;AAAA,EAChB,CAAC;AACL;;;AC3aA,IAAAC,kBAA6B;AAC7B,IAAAC,qBAAkB;AAClB,wBAA8B;AAC9B,IAAAC,oBAAyB;AACzB;AACA;AAOA,SAASC,WAAU,WAA0B;AAC3C,MAAI;AACJ,MAAI;AACF,eAAW,kBAAkB,SAAS;AAAA,EACxC,SAAS,KAAK;AACZ,YAAQ,MAAM,UAAU,eAAe,QAAQ,IAAI,UAAU,GAAG,EAAE;AAClE,YAAQ,KAAK,CAAC;AAAA,EAChB;AAEA,MAAI;AACJ,MAAI;AACF,WAAO,KAAK,UAAM,8BAAa,UAAU,OAAO,CAAC;AAAA,EACnD,SAAS,KAAK;AACZ,YAAQ;AAAA,MACN,mCAAmC,eAAe,QAAQ,IAAI,UAAU,GAAG;AAAA,IAC7E;AACA,YAAQ,KAAK,CAAC;AAAA,EAChB;AAEA,QAAM,IAAI,IAAI,mBAAAC,QAAM,EAAE,MAAM,cAAc,OAAO,MAAM,CAAC;AAGxD,QAAM,QAAS,KAAK,SAAS,CAAC;AAC9B,aAAW,QAAQ,OAAO;AACxB,UAAM,EAAE,IAAI,GAAG,MAAM,IAAI;AACzB,MAAE,UAAU,IAAc,KAAK;AAAA,EACjC;AAEA,QAAM,QAAS,KAAK,SAAS,KAAK,SAAS,CAAC;AAC5C,aAAW,QAAQ,OAAO;AACxB,UAAM,EAAE,QAAQ,QAAQ,GAAG,MAAM,IAAI;AACrC,QAAI;AACF,QAAE,UAAU,QAAkB,QAAkB,KAAK;AAAA,IACvD,QAAQ;AAAA,IAER;AAAA,EACF;AAEA,SAAO;AACT;AAMA,SAAS,qBAAqB,GAAiC;AAC7D,QAAM,cAAc,oBAAI,IAAsB;AAC9C,IAAE,YAAY,CAAC,QAAQ,SAAS;AAC9B,UAAM,MAAM,KAAK;AACjB,QAAI,QAAQ,UAAa,QAAQ,MAAM;AACrC,UAAI,CAAC,YAAY,IAAI,GAAG,EAAG,aAAY,IAAI,KAAK,CAAC,CAAC;AAClD,kBAAY,IAAI,GAAG,EAAG,KAAK,MAAM;AAAA,IACnC;AAAA,EACF,CAAC;AACD,SAAO;AACT;AAEA,SAAS,WAAW,GAAU,OAA0C;AACtE,QAAM,SAAkC,CAAC;AACzC,IAAE,YAAY,CAAC,KAAK,SAAS;AAC3B,UAAM,SAAU,KAAK,SAAoB,IAAI,YAAY;AACzD,UAAM,UAAW,KAAK,eAA0B,IAAI,YAAY;AAChE,UAAM,QACJ,MAAM,OAAO,CAAC,GAAG,MAAM,KAAK,MAAM,SAAS,CAAC,IAAI,IAAI,IAAI,CAAC,IACzD,MAAM,OAAO,CAAC,GAAG,MAAM,KAAK,OAAO,SAAS,CAAC,IAAI,MAAM,IAAI,CAAC;AAC9D,QAAI,QAAQ,EAAG,QAAO,KAAK,CAAC,OAAO,GAAG,CAAC;AAAA,EACzC,CAAC;AACD,SAAO,KAAK,CAAC,GAAG,MAAM,EAAE,CAAC,IAAI,EAAE,CAAC,CAAC;AACjC,SAAO;AACT;AAEA,SAAS,IACP,GACA,YACA,OAC0D;AAC1D,QAAM,UAAU,IAAI,IAAY,UAAU;AAC1C,MAAI,WAAW,IAAI,IAAY,UAAU;AACzC,QAAM,QAAiC,CAAC;AACxC,WAAS,IAAI,GAAG,IAAI,OAAO,KAAK;AAC9B,UAAM,eAAe,oBAAI,IAAY;AACrC,eAAW,KAAK,UAAU;AACxB,QAAE,gBAAgB,GAAG,CAAC,aAAa;AACjC,YAAI,CAAC,QAAQ,IAAI,QAAQ,GAAG;AAC1B,uBAAa,IAAI,QAAQ;AACzB,gBAAM,KAAK,CAAC,GAAG,QAAQ,CAAC;AAAA,QAC1B;AAAA,MACF,CAAC;AAAA,IACH;AACA,eAAW,KAAK,aAAc,SAAQ,IAAI,CAAC;AAC3C,eAAW;AAAA,EACb;AACA,SAAO,EAAE,SAAS,MAAM;AAC1B;AAEA,SAAS,IACP,GACA,YACA,OAC0D;AAC1D,QAAM,UAAU,oBAAI,IAAY;AAChC,QAAM,QAAiC,CAAC;AACxC,QAAM,QAAiC,CAAC,GAAG,UAAU,EAAE,QAAQ,EAAE,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC;AAClF,SAAO,MAAM,SAAS,GAAG;AACvB,UAAM,CAAC,MAAM,CAAC,IAAI,MAAM,IAAI;AAC5B,QAAI,QAAQ,IAAI,IAAI,KAAK,IAAI,MAAO;AACpC,YAAQ,IAAI,IAAI;AAChB,MAAE,gBAAgB,MAAM,CAAC,aAAa;AACpC,UAAI,CAAC,QAAQ,IAAI,QAAQ,GAAG;AAC1B,cAAM,KAAK,CAAC,UAAU,IAAI,CAAC,CAAC;AAC5B,cAAM,KAAK,CAAC,MAAM,QAAQ,CAAC;AAAA,MAC7B;AAAA,IACF,CAAC;AAAA,EACH;AACA,SAAO,EAAE,SAAS,MAAM;AAC1B;AAEA,SAAS,eACP,GACA,OACA,OACA,cAAsB,KACd;AACR,QAAM,aAAa,cAAc;AACjC,QAAM,QAAkB,CAAC;AAEzB,QAAM,SAAS,CAAC,GAAG,KAAK,EAAE,KAAK,CAAC,GAAG,MAAM,EAAE,OAAO,CAAC,IAAI,EAAE,OAAO,CAAC,CAAC;AAClE,aAAW,OAAO,QAAQ;AACxB,UAAM,IAAI,EAAE,kBAAkB,GAAG;AACjC,UAAM;AAAA,MACJ,QAAQ,cAAe,EAAE,SAAoB,GAAG,CAAC,SAAS,EAAE,eAAe,EAAE,QAAQ,EAAE,mBAAmB,EAAE,cAAc,EAAE,aAAa,EAAE;AAAA,IAC7I;AAAA,EACF;AACA,aAAW,CAAC,GAAG,CAAC,KAAK,OAAO;AAC1B,QAAI,MAAM,IAAI,CAAC,KAAK,MAAM,IAAI,CAAC,GAAG;AAChC,YAAM,UAAU,EAAE,KAAK,GAAG,CAAC;AAC3B,UAAI,CAAC,QAAS;AACd,YAAM,IAAI,EAAE,kBAAkB,OAAO;AACrC,YAAM;AAAA,QACJ,QAAQ,cAAe,EAAE,iBAAiB,GAAG,OAAO,KAAgB,CAAC,CAAC,MAAM,EAAE,YAAY,EAAE,KAAK,EAAE,cAAc,EAAE,QAAQ,cAAe,EAAE,iBAAiB,GAAG,OAAO,KAAgB,CAAC,CAAC;AAAA,MAC3L;AAAA,IACF;AAAA,EACF;AACA,MAAI,SAAS,MAAM,KAAK,IAAI;AAC5B,MAAI,OAAO,SAAS,YAAY;AAC9B,aAAS,OAAO,MAAM,GAAG,UAAU,IAAI;AAAA,qBAAwB,WAAW;AAAA,EAC5E;AACA,SAAO;AACT;AAEA,SAAS,SAAS,GAAU,OAAyB;AACnD,QAAM,OAAO,MAAM,YAAY;AAC/B,QAAM,SAAmB,CAAC;AAC1B,IAAE,YAAY,CAAC,KAAK,MAAM;AACxB,SACI,EAAE,SAAoB,IAAI,YAAY,EAAE,SAAS,IAAI,KACvD,IAAI,YAAY,MAAM,MACtB;AACA,aAAO,KAAK,GAAG;AAAA,IACjB;AAAA,EACF,CAAC;AACD,SAAO;AACT;AAMA,SAAS,eAAe,GAAU,MAAuC;AACvE,QAAM,WAAW,KAAK;AACtB,QAAM,OAAQ,KAAK,QAAmB;AACtC,QAAM,QAAQ,KAAK,IAAI,OAAO,KAAK,SAAS,CAAC,GAAG,CAAC;AACjD,QAAM,SAAS,OAAO,KAAK,gBAAgB,GAAI;AAC/C,QAAM,QAAQ,SACX,MAAM,KAAK,EACX,OAAO,CAAC,MAAM,EAAE,SAAS,CAAC,EAC1B,IAAI,CAAC,MAAM,EAAE,YAAY,CAAC;AAE7B,QAAM,SAAS,WAAW,GAAG,KAAK;AAClC,QAAM,aAAa,OAAO,MAAM,GAAG,CAAC,EAAE,IAAI,CAAC,CAAC,EAAE,GAAG,MAAM,GAAG;AAC1D,MAAI,WAAW,WAAW,EAAG,QAAO;AAEpC,QAAM,EAAE,SAAS,MAAM,IACrB,SAAS,QAAQ,IAAI,GAAG,YAAY,KAAK,IAAI,IAAI,GAAG,YAAY,KAAK;AAEvE,QAAM,cAAc,WAAW;AAAA,IAC7B,CAAC,MAAO,EAAE,iBAAiB,GAAG,OAAO,KAAgB;AAAA,EACvD;AACA,QAAM,SAAS,cAAc,KAAK,YAAY,CAAC,UAAU,KAAK,cAAc,YAAY,KAAK,IAAI,CAAC,OAAO,QAAQ,IAAI;AAAA;AAAA;AACrH,SAAO,SAAS,eAAe,GAAG,SAAS,OAAO,MAAM;AAC1D;AAEA,SAAS,YAAY,GAAU,MAAuC;AACpE,QAAM,QAAS,KAAK,MAAiB,YAAY;AACjD,QAAM,UAAoD,CAAC;AAC3D,IAAE,YAAY,CAACC,MAAKC,OAAM;AACxB,SACIA,GAAE,SAAoB,IAAI,YAAY,EAAE,SAAS,KAAK,KACxDD,KAAI,YAAY,MAAM,OACtB;AACA,cAAQ,KAAK,CAACA,MAAKC,EAAC,CAAC;AAAA,IACvB;AAAA,EACF,CAAC;AACD,MAAI,QAAQ,WAAW,EAAG,QAAO,qBAAqB,KAAK;AAC3D,QAAM,CAAC,KAAK,CAAC,IAAI,QAAQ,CAAC;AAC1B,SAAO;AAAA,IACL,SAAS,EAAE,SAAS,GAAG;AAAA,IACvB,SAAS,GAAG;AAAA,IACZ,aAAa,EAAE,eAAe,EAAE,IAAI,EAAE,mBAAmB,EAAE;AAAA,IAC3D,WAAW,EAAE,aAAa,EAAE;AAAA,IAC5B,gBAAgB,EAAE,aAAa,EAAE;AAAA,IACjC,aAAa,EAAE,OAAO,GAAG,CAAC;AAAA,EAC5B,EAAE,KAAK,IAAI;AACb;AAEA,SAAS,iBAAiB,GAAU,MAAuC;AACzE,QAAM,QAAS,KAAK,MAAiB,YAAY;AACjD,QAAM,aAAc,KAAK,mBAA8B,IAAI,YAAY;AACvE,QAAM,UAAU,SAAS,GAAG,KAAK;AACjC,MAAI,QAAQ,WAAW,EAAG,QAAO,qBAAqB,KAAK;AAC3D,QAAM,MAAM,QAAQ,CAAC;AACrB,QAAM,QAAQ,CAAC,gBAAiB,EAAE,iBAAiB,KAAK,OAAO,KAAgB,GAAG,GAAG;AACrF,IAAE,gBAAgB,KAAK,CAAC,aAAa;AACnC,UAAM,UAAU,EAAE,KAAK,KAAK,QAAQ;AACpC,QAAI,CAAC,QAAS;AACd,UAAM,IAAI,EAAE,kBAAkB,OAAO;AACrC,UAAM,MAAO,EAAE,YAAuB;AACtC,QAAI,aAAa,CAAC,IAAI,YAAY,EAAE,SAAS,SAAS,EAAG;AACzD,UAAM;AAAA,MACJ,SAAU,EAAE,iBAAiB,UAAU,OAAO,KAAgB,QAAQ,KAAK,GAAG,MAAM,EAAE,cAAc,EAAE;AAAA,IACxG;AAAA,EACF,CAAC;AACD,SAAO,MAAM,KAAK,IAAI;AACxB;AAEA,SAAS,iBACP,aACA,GACA,MACQ;AACR,QAAM,MAAM,OAAO,KAAK,YAAY;AACpC,QAAM,QAAQ,YAAY,IAAI,GAAG;AACjC,MAAI,CAAC,SAAS,MAAM,WAAW,EAAG,QAAO,aAAa,GAAG;AACzD,QAAM,QAAQ,CAAC,aAAa,GAAG,KAAK,MAAM,MAAM,UAAU;AAC1D,aAAW,KAAK,OAAO;AACrB,UAAM,IAAI,EAAE,kBAAkB,CAAC;AAC/B,UAAM,KAAK,KAAK,EAAE,SAAS,CAAC,KAAK,EAAE,eAAe,EAAE,GAAG;AAAA,EACzD;AACA,SAAO,MAAM,KAAK,IAAI;AACxB;AAEA,SAAS,aAAa,GAAU,MAAuC;AACrE,QAAM,OAAO,OAAO,KAAK,SAAS,EAAE;AACpC,QAAM,QAAQ,SAAgB,GAAG,IAAI;AACrC,QAAM,QAAQ,CAAC,6BAA6B;AAC5C,QAAM,QAAQ,CAAC,GAAG,MAAM;AACtB,UAAM,KAAK,KAAK,IAAI,CAAC,KAAK,EAAE,KAAK,MAAM,EAAE,KAAK,QAAQ;AAAA,EACxD,CAAC;AACD,SAAO,MAAM,KAAK,IAAI;AACxB;AAEA,SAAS,eACP,GACA,aACQ;AACR,QAAM,QAAkB,CAAC;AACzB,IAAE,YAAY,CAAC,GAAG,SAAS;AACzB,UAAM,KAAM,KAAK,cAAyB,WAAW;AAAA,EACvD,CAAC;AACD,QAAM,QAAQ,MAAM,UAAU;AAC9B,SAAO;AAAA,IACL,UAAU,EAAE,KAAK;AAAA,IACjB,UAAU,EAAE,IAAI;AAAA,IAChB,gBAAgB,YAAY,IAAI;AAAA,IAChC,cAAc,KAAK,MAAO,MAAM,OAAO,CAAC,MAAM,MAAM,WAAW,EAAE,SAAS,QAAS,GAAG,CAAC;AAAA,IACvF,aAAa,KAAK,MAAO,MAAM,OAAO,CAAC,MAAM,MAAM,UAAU,EAAE,SAAS,QAAS,GAAG,CAAC;AAAA,IACrF,cAAc,KAAK,MAAO,MAAM,OAAO,CAAC,MAAM,MAAM,WAAW,EAAE,SAAS,QAAS,GAAG,CAAC;AAAA,EACzF,EAAE,KAAK,IAAI;AACb;AAEA,SAAS,iBAAiB,GAAU,MAAuC;AACzE,QAAM,WAAY,KAAK,OACpB,MAAM,KAAK,EACX,IAAI,CAAC,MAAM,EAAE,YAAY,CAAC;AAC7B,QAAM,WAAY,KAAK,OACpB,MAAM,KAAK,EACX,IAAI,CAAC,MAAM,EAAE,YAAY,CAAC;AAC7B,QAAM,YAAY,WAAW,GAAG,QAAQ;AACxC,QAAM,YAAY,WAAW,GAAG,QAAQ;AAExC,MAAI,UAAU,WAAW;AACvB,WAAO,4BAA4B,KAAK,MAAM;AAChD,MAAI,UAAU,WAAW;AACvB,WAAO,4BAA4B,KAAK,MAAM;AAEhD,QAAM,SAAS,UAAU,CAAC,EAAG,CAAC;AAC9B,QAAM,SAAS,UAAU,CAAC,EAAG,CAAC;AAC9B,QAAM,UAAU,OAAO,KAAK,YAAY,CAAC;AAEzC,QAAM,gBAAY,iCAAc,GAAG,QAAQ,MAAM;AACjD,MAAI,CAAC,WAAW;AACd,WAAO,0BAA2B,EAAE,iBAAiB,QAAQ,OAAO,KAAgB,MAAM,UAAW,EAAE,iBAAiB,QAAQ,OAAO,KAAgB,MAAM;AAAA,EAC/J;AAEA,QAAM,OAAO,UAAU,SAAS;AAChC,MAAI,OAAO,QAAS,QAAO,yBAAyB,OAAO,KAAK,IAAI;AAEpE,QAAM,WAAqB,CAAC;AAC5B,WAAS,IAAI,GAAG,IAAI,UAAU,SAAS,GAAG,KAAK;AAC7C,UAAM,IAAI,UAAU,CAAC;AACrB,UAAM,IAAI,UAAU,IAAI,CAAC;AACzB,UAAM,UAAU,EAAE,KAAK,GAAG,CAAC;AAC3B,UAAM,QAAQ,UAAU,EAAE,kBAAkB,OAAO,IAAI,CAAC;AACxD,UAAM,MAAO,MAAM,YAAuB;AAC1C,UAAM,OAAQ,MAAM,cAAyB;AAC7C,UAAM,UAAU,OAAO,KAAK,IAAI,MAAM;AACtC,QAAI,MAAM,GAAG;AACX,eAAS,KAAM,EAAE,iBAAiB,GAAG,OAAO,KAAgB,CAAC;AAAA,IAC/D;AACA,aAAS;AAAA,MACP,KAAK,GAAG,GAAG,OAAO,OAAQ,EAAE,iBAAiB,GAAG,OAAO,KAAgB,CAAC;AAAA,IAC1E;AAAA,EACF;AACA,SAAO,kBAAkB,IAAI;AAAA,IAAc,SAAS,KAAK,GAAG,CAAC;AAC/D;AAMA,eAAsB,MACpB,YAAoB,2BACpB,WACe;AACf,MAAI;AACJ,MAAI;AACJ,MAAI;AACJ,MAAI;AAEJ,MAAI;AACF,UAAM,YAAY,MAAM,OAAO,2CAA2C;AAC1E,UAAM,WAAW,MAAM,OAAO,2CAA2C;AACzE,UAAM,WAAW,MAAM,OAAO,oCAAoC;AAClE,aAAS,UAAU;AACnB,2BAAuB,SAAS;AAChC,6BAAyB,SAAS;AAClC,4BAAwB,SAAS;AAAA,EACnC,QAAQ;AACN,UAAM,IAAI;AAAA,MACR;AAAA,IACF;AAAA,EACF;AAEA,QAAM,IAAIH,WAAU,SAAS;AAC7B,QAAM,cAAc,qBAAqB,CAAC;AAE1C,QAAM,SAAS,IAAI;AAAA,IACjB,EAAE,MAAM,YAAY,SAAS,SAAS;AAAA,IACtC,EAAE,cAAc,EAAE,OAAO,CAAC,EAAE,EAAE;AAAA,EAChC;AAEA,SAAO,kBAAkB,wBAAwB,aAAa;AAAA,IAC5D,OAAO;AAAA,MACL;AAAA,QACE,MAAM;AAAA,QACN,aACE;AAAA,QACF,aAAa;AAAA,UACX,MAAM;AAAA,UACN,YAAY;AAAA,YACV,UAAU;AAAA,cACR,MAAM;AAAA,cACN,aAAa;AAAA,YACf;AAAA,YACA,MAAM;AAAA,cACJ,MAAM;AAAA,cACN,MAAM,CAAC,OAAO,KAAK;AAAA,cACnB,SAAS;AAAA,cACT,aAAa;AAAA,YACf;AAAA,YACA,OAAO;AAAA,cACL,MAAM;AAAA,cACN,SAAS;AAAA,cACT,aAAa;AAAA,YACf;AAAA,YACA,cAAc;AAAA,cACZ,MAAM;AAAA,cACN,SAAS;AAAA,cACT,aAAa;AAAA,YACf;AAAA,UACF;AAAA,UACA,UAAU,CAAC,UAAU;AAAA,QACvB;AAAA,MACF;AAAA,MACA;AAAA,QACE,MAAM;AAAA,QACN,aAAa;AAAA,QACb,aAAa;AAAA,UACX,MAAM;AAAA,UACN,YAAY;AAAA,YACV,OAAO;AAAA,cACL,MAAM;AAAA,cACN,aAAa;AAAA,YACf;AAAA,UACF;AAAA,UACA,UAAU,CAAC,OAAO;AAAA,QACpB;AAAA,MACF;AAAA,MACA;AAAA,QACE,MAAM;AAAA,QACN,aACE;AAAA,QACF,aAAa;AAAA,UACX,MAAM;AAAA,UACN,YAAY;AAAA,YACV,OAAO,EAAE,MAAM,SAAS;AAAA,YACxB,iBAAiB;AAAA,cACf,MAAM;AAAA,cACN,aAAa;AAAA,YACf;AAAA,UACF;AAAA,UACA,UAAU,CAAC,OAAO;AAAA,QACpB;AAAA,MACF;AAAA,MACA;AAAA,QACE,MAAM;AAAA,QACN,aAAa;AAAA,QACb,aAAa;AAAA,UACX,MAAM;AAAA,UACN,YAAY;AAAA,YACV,cAAc;AAAA,cACZ,MAAM;AAAA,cACN,aAAa;AAAA,YACf;AAAA,UACF;AAAA,UACA,UAAU,CAAC,cAAc;AAAA,QAC3B;AAAA,MACF;AAAA,MACA;AAAA,QACE,MAAM;AAAA,QACN,aACE;AAAA,QACF,aAAa;AAAA,UACX,MAAM;AAAA,UACN,YAAY;AAAA,YACV,OAAO,EAAE,MAAM,WAAW,SAAS,GAAG;AAAA,UACxC;AAAA,QACF;AAAA,MACF;AAAA,MACA;AAAA,QACE,MAAM;AAAA,QACN,aACE;AAAA,QACF,aAAa,EAAE,MAAM,UAAmB,YAAY,CAAC,EAAE;AAAA,MACzD;AAAA,MACA;AAAA,QACE,MAAM;AAAA,QACN,aACE;AAAA,QACF,aAAa;AAAA,UACX,MAAM;AAAA,UACN,YAAY;AAAA,YACV,QAAQ;AAAA,cACN,MAAM;AAAA,cACN,aAAa;AAAA,YACf;AAAA,YACA,QAAQ;AAAA,cACN,MAAM;AAAA,cACN,aAAa;AAAA,YACf;AAAA,YACA,UAAU;AAAA,cACR,MAAM;AAAA,cACN,SAAS;AAAA,cACT,aAAa;AAAA,YACf;AAAA,UACF;AAAA,UACA,UAAU,CAAC,UAAU,QAAQ;AAAA,QAC/B;AAAA,MACF;AAAA,IACF;AAAA,EACF,EAAE;AAEF,QAAM,WAGF;AAAA,IACF,aAAa,CAAC,MAAM,eAAe,GAAG,CAAC;AAAA,IACvC,UAAU,CAAC,MAAM,YAAY,GAAG,CAAC;AAAA,IACjC,eAAe,CAAC,MAAM,iBAAiB,GAAG,CAAC;AAAA,IAC3C,eAAe,CAAC,MAAM,iBAAiB,aAAa,GAAG,CAAC;AAAA,IACxD,WAAW,CAAC,MAAM,aAAa,GAAG,CAAC;AAAA,IACnC,aAAa,MAAM,eAAe,GAAG,WAAW;AAAA,IAChD,eAAe,CAAC,MAAM,iBAAiB,GAAG,CAAC;AAAA,EAC7C;AAEA,SAAO,kBAAkB,uBAAuB,OAAO,YAAY;AACjE,UAAM,EAAE,MAAM,WAAW,KAAK,IAAI,QAAQ;AAC1C,UAAM,UAAU,SAAS,IAAI;AAC7B,QAAI,CAAC,SAAS;AACZ,aAAO,EAAE,SAAS,CAAC,EAAE,MAAM,QAAiB,MAAM,iBAAiB,IAAI,GAAG,CAAC,EAAE;AAAA,IAC/E;AACA,UAAM,OAAO,QAAS,QAAQ,CAAC,CAA6B;AAC5D,WAAO,EAAE,SAAS,CAAC,EAAE,MAAM,QAAiB,KAAK,CAAC,EAAE;AAAA,EACtD,CAAC;AAED,QAAM,kBAAkB,aAAa,IAAI,qBAAqB;AAC9D,MAAI;AACJ,MAAI,CAAC,WAAW;AACd,gBAAY,YAAY,MAAM,QAAW,GAAM;AAC/C,YAAQ,OAAO,OAAO;AAAA,EACxB;AAEA,QAAM,SAAS,IAAI,QAAc,CAACI,aAAY;AAC5C,UAAM,kBAAkB,OAAO;AAC/B,WAAO,UAAU,MAAM;AACrB,UAAI,WAAW;AACb,sBAAc,SAAS;AAAA,MACzB;AACA,wBAAkB;AAClB,MAAAA,SAAQ;AAAA,IACV;AAAA,EACF,CAAC;AAED,QAAM,OAAO,QAAQ,eAAe;AACpC,MAAI,WAAW;AACb,UAAM;AAAA,EACR;AACF;AAMA,IAAMC,qBAAoB,OAAO,YAAY,eAC3C,OAAO,QAAQ,KAAK,CAAC,MAAM,YAC3B,6BAA6B,SAAK,4BAAS,QAAQ,KAAK,CAAC,CAAC,CAAC;AAE7D,IAAIA,oBAAmB;AACrB,QAAM,YAAY,QAAQ,KAAK,CAAC,KAAK;AACrC,QAAM,SAAS,EAAE,MAAM,CAAC,QAAQ;AAC9B,YAAQ,MAAM,GAAG;AACjB,YAAQ,KAAK,CAAC;AAAA,EAChB,CAAC;AACH;;;ACziBA,IAAAC,mBAAiE;AACjE,IAAAC,oBAA0D;AAE1D,IAAM,qBAAqB,oBAAI,IAAI;AAAA,EACjC;AAAA,EAAO;AAAA,EAAO;AAAA,EAAO;AAAA,EAAO;AAAA,EAAO;AAAA,EAAS;AAAA,EAAQ;AAAA,EAAM;AAAA,EAAO;AAAA,EAAU;AAAA,EAC3E;AAAA,EAAO;AAAA,EAAU;AAAA,EAAQ;AAAA,EAAO;AAAA,EAAQ;AAAA,EAAQ;AAAA,EAAM;AAAA,EACtD;AAAA,EAAO;AAAA,EAAQ;AAAA,EAAQ;AAAA,EACvB;AAAA,EAAQ;AAAA,EAAQ;AAAA,EAAS;AAAA,EAAS;AAAA,EAAQ;AAC5C,CAAC;AAED,IAAMC,mBAAkB,oBAAI,IAAI;AAAA,EAC9B;AAAA,EAAO;AAAA,EAAO;AAAA,EAAO;AAAA,EAAO;AAAA,EAAO;AAAA,EAAS;AAAA,EAAQ;AAAA,EAAM;AAAA,EAAO;AAAA,EAAU;AAAA,EAC3E;AAAA,EAAO;AAAA,EAAU;AAAA,EAAQ;AAAA,EAAO;AAAA,EAAQ;AAAA,EAAQ;AAAA,EAAM;AACxD,CAAC;AAMD,eAAsB,YACpB,WACA,iBAA0B,OACR;AAClB,MAAI;AAEF,UAAM,EAAE,cAAAC,eAAc,wBAAAC,wBAAuB,IAAI,MAAM;AACvD,UAAM,EAAE,eAAAC,eAAc,IAAI,MAAM;AAChC,UAAM,EAAE,SAAAC,UAAS,UAAAC,UAAS,IAAI,MAAM;AACpC,UAAM,EAAE,UAAAC,WAAU,uBAAAC,wBAAuB,kBAAAC,kBAAiB,IAAI,MAAM;AACpE,UAAM,EAAE,UAAAC,UAAS,IAAI,MAAM;AAC3B,UAAM,EAAE,QAAAC,QAAO,IAAI,MAAM;AAEzB,QAAI,YAAY,MAAMT,cAAa,WAAW,EAAE,eAAe,CAAC;AAChE,gBAAY,UAAU;AAAA,MACpB,CAAC,MACC,CAAC,EAAE,SAAS,cAAc,KAC1B,CAAC,EAAE,SAAS,aAAa,KACzB,CAAC,EAAE,SAAS,cAAc;AAAA,IAC9B;AAEA,QAAI,UAAU,WAAW,GAAG;AAC1B,cAAQ,IAAI,4DAA4D;AACxE,aAAO;AAAA,IACT;AAEA,UAAM,EAAE,YAAY,QAAQ,YAAY,IAAI,MAAMC,wBAAuB,SAAS;AAClF,QAAI,YAAY,SAAS,GAAG;AAC1B,cAAQ;AAAA,QACN,8CAA8C,YAAY,MAAM,aAC7D,YAAY,MAAM,GAAG,CAAC,EAAE,IAAI,CAAC,MAAM,GAAG,EAAE,QAAQ,KAAK,EAAE,KAAK,EAAE,EAAE,KAAK,KAAK,CAAC;AAAA,MAChF;AAAA,IACF;AACA,QAAI,OAAO,MAAM,WAAW,GAAG;AAC7B,cAAQ,IAAI,0EAA0E;AACtF,aAAO;AAAA,IACT;AAEA,UAAM,YAAY;AAAA,MAChB,OAAO;AAAA,QACL,MAAM;AAAA,QACN,UAAU,CAAC;AAAA,QACX,OAAO,CAAC;AAAA,QACR,OAAO,CAAC;AAAA,MACV;AAAA,MACA,aAAa,UAAU;AAAA,MACvB,aAAa;AAAA,MACb,aAAa;AAAA,MACb,SAAS;AAAA,MACT,mBAAmB,CAAC;AAAA,MACpB,yBAAyB;AAAA,IAC3B;AAEA,UAAM,IAAIC,eAAc,MAAM;AAC9B,UAAM,cAAcC,SAAQ,CAAC;AAC7B,UAAM,WAAWC,UAAS,GAAG,WAAW;AACxC,UAAM,OAAOC,UAAS,CAAC;AACvB,UAAM,YAAYC,uBAAsB,GAAG,WAAW;AACtD,UAAM,SAAS,oBAAI,IAAoB;AACvC,eAAW,OAAO,YAAY,KAAK,GAAG;AACpC,aAAO,IAAI,KAAK,aAAa,GAAG,EAAE;AAAA,IACpC;AACA,UAAM,YAAYC,kBAAiB,GAAG,aAAa,MAAM;AAEzD,UAAM,aAAS,kBAAAG,SAAY,WAAW,cAAc;AACpD,oCAAU,QAAQ,EAAE,WAAW,KAAK,CAAC;AAErC,UAAM,SAASF;AAAA,MACb;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA,EAAE,OAAO,GAAG,QAAQ,EAAE;AAAA,MACtB;AAAA,MACA;AAAA,IACF;AACA,4CAAc,kBAAAE,SAAY,QAAQ,iBAAiB,GAAG,QAAQ,OAAO;AACrE,IAAAD,QAAO,GAAG,iBAAa,kBAAAC,SAAY,QAAQ,YAAY,CAAC;AAGxD,UAAM,eAAW,kBAAAA,SAAY,QAAQ,cAAc;AACnD,YAAI,6BAAW,QAAQ,GAAG;AACxB,uCAAW,QAAQ;AAAA,IACrB;AAEA,YAAQ;AAAA,MACN,6BAA6B,EAAE,KAAK,WAAW,EAAE,IAAI,WAAW,YAAY,IAAI;AAAA,IAClF;AACA,YAAQ;AAAA,MACN,8DAA8D,MAAM;AAAA,IACtE;AACA,WAAO;AAAA,EACT,SAAS,KAAK;AACZ,YAAQ;AAAA,MACN,oCAAoC,eAAe,QAAQ,IAAI,UAAU,GAAG;AAAA,IAC9E;AACA,WAAO;AAAA,EACT;AACF;AAMA,SAAS,WAAW,WAAyB;AAC3C,QAAM,aAAS,kBAAAA,SAAY,WAAW,cAAc;AACpD,kCAAU,QAAQ,EAAE,WAAW,KAAK,CAAC;AACrC,QAAM,eAAW,kBAAAA,SAAY,QAAQ,cAAc;AACnD,sCAAc,UAAU,KAAK,OAAO;AACpC,UAAQ,IAAI;AAAA,oDAAuD,SAAS,EAAE;AAC9E,UAAQ;AAAA,IACN;AAAA,EACF;AACA,UAAQ;AAAA,IACN;AAAA,EACF;AACA,UAAQ,IAAI,oCAAoC,QAAQ,EAAE;AAC5D;AAEA,SAAS,WAAW,cAAiC;AACnD,SAAO,aAAa,KAAK,CAAC,MAAM,CAACX,iBAAgB,QAAI,2BAAQ,CAAC,EAAE,YAAY,CAAC,CAAC;AAChF;AAMA,eAAsB,MACpB,WACA,WAAmB,GACJ;AACf,MAAI;AACJ,MAAI;AACF,eAAW,MAAM,OAAO,UAAU;AAAA,EACpC,QAAQ;AACN,UAAM,IAAI,MAAM,mDAAmD;AAAA,EACrE;AAEA,QAAM,mBAAe,kBAAAW,SAAY,SAAS;AAC1C,MAAI,cAAc;AAClB,MAAI,UAAU;AACd,QAAM,UAAU,oBAAI,IAAY;AAEhC,QAAM,UAAU,SAAS,MAAM,cAAc;AAAA,IAC3C,YAAY;AAAA,IACZ,eAAe;AAAA,IACf,gBAAgB;AAAA,IAChB,SAAS;AAAA,MACP;AAAA,MACA;AAAA,MACA;AAAA,IACF;AAAA,EACF,CAAC;AAED,UAAQ,GAAG,OAAO,CAAC,QAAgB,aAAqB;AACtD,UAAM,UAAM,2BAAQ,QAAQ,EAAE,YAAY;AAC1C,QAAI,CAAC,mBAAmB,IAAI,GAAG,EAAG;AAGlC,UAAM,QAAQ,SAAS,MAAM,GAAG;AAChC,QAAI,MAAM,KAAK,CAAC,SAAS,KAAK,WAAW,GAAG,KAAK,SAAS,GAAG,EAAG;AAEhE,kBAAc,KAAK,IAAI;AACvB,cAAU;AACV,YAAQ,IAAI,QAAQ;AAAA,EACtB,CAAC;AAED,UAAQ;AAAA,IACN,6BAA6B,YAAY;AAAA,EAC3C;AACA,UAAQ;AAAA,IACN;AAAA,EACF;AACA,UAAQ,IAAI,8BAA8B,QAAQ,GAAG;AAErD,QAAM,aAAa,WAAW;AAE9B,QAAM,OAAO,YAAY,YAAY;AACnC,QAAI,WAAW,KAAK,IAAI,IAAI,eAAe,YAAY;AACrD,gBAAU;AACV,YAAM,QAAQ,CAAC,GAAG,OAAO;AACzB,cAAQ,MAAM;AACd,cAAQ,IAAI;AAAA,mBAAsB,MAAM,MAAM,kBAAkB;AAChE,UAAI,WAAW,KAAK,GAAG;AACrB,mBAAW,SAAS;AAAA,MACtB,OAAO;AACL,cAAM,YAAY,SAAS;AAAA,MAC7B;AAAA,IACF;AAAA,EACF,GAAG,GAAG;AAGN,QAAM,UAAU,MAAM;AACpB,YAAQ,IAAI,6BAA6B;AACzC,kBAAc,IAAI;AAClB,YAAQ,MAAM;AACd,YAAQ,KAAK,CAAC;AAAA,EAChB;AAEA,UAAQ,GAAG,UAAU,OAAO;AAC5B,UAAQ,GAAG,WAAW,OAAO;AAC/B;AAMA,IAAMC,qBAAoB,OAAO,YAAY,eAC3C,OAAO,QAAQ,KAAK,CAAC,MAAM,YAC3B,6BAA6B,SAAK,4BAAS,QAAQ,KAAK,CAAC,CAAC,CAAC;AAE7D,IAAIA,oBAAmB;AACrB,QAAM,YAAY,QAAQ,KAAK,CAAC,KAAK;AACrC,QAAM,WAAW,QAAQ,KAAK,CAAC,IAAI,WAAW,QAAQ,KAAK,CAAC,CAAC,IAAI;AACjE,QAAM,WAAW,QAAQ,EAAE,MAAM,CAAC,QAAQ;AACxC,YAAQ,MAAM,GAAG;AACjB,YAAQ,KAAK,CAAC;AAAA,EAChB,CAAC;AACH;","names":["Graph","louvain","result","betweennessCentrality","pathResolve","nodeCommunityMap","import_node_fs","import_node_crypto","import_node_fs","import_node_path","Parser","module","walkDir","import_node_fs","import_node_path","FileType","import_node_fs","import_node_path","import_node_fs","import_node_path","CODE_EXTENSIONS","PAPER_EXTENSIONS","IMAGE_EXTENSIONS","import_node_fs","import_graphology","Graph","import_node_fs","import_node_path","safeFilename","pathResolve","import_node_fs","import_graphology","import_node_path","loadGraph","Graph","nid","d","resolve","isDirectExecution","import_node_fs","import_node_path","CODE_EXTENSIONS","collectFiles","extractWithDiagnostics","buildFromJson","cluster","scoreAll","godNodes","surprisingConnections","suggestQuestions","generate","toJson","pathResolve","isDirectExecution"]}
+{"version":3,"sources":["../src/types.ts","../src/validate.ts","../src/graph.ts","../src/build.ts","../src/collections.ts","../src/cluster.ts","../src/detect.ts","../src/analyze.ts","../src/report.ts","../src/security.ts","../src/export.ts","../src/cache.ts","../src/extract.ts","../src/index.ts","../src/wiki.ts","../src/benchmark.ts","../src/ingest.ts","../src/transcribe.ts","../src/serve.ts","../src/watch.ts"],"sourcesContent":["/** File type classification for corpus files. */\nexport enum FileType {\n  CODE = \"code\",\n  DOCUMENT = \"document\",\n  PAPER = \"paper\",\n  IMAGE = \"image\",\n  VIDEO = \"video\",\n}\n\n/** Confidence level for extracted relationships. */\nexport type Confidence = \"EXTRACTED\" | \"INFERRED\" | \"AMBIGUOUS\";\n\n/** A node in the knowledge graph. */\nexport interface GraphNode {\n  id: string;\n  label: string;\n  file_type: \"code\" | \"document\" | \"paper\" | \"image\" | \"rationale\";\n  source_file: string;\n  source_location?: string;\n  confidence?: Confidence;\n  community?: number;\n  [key: string]: unknown;\n}\n\n/** An edge in the knowledge graph. */\nexport interface GraphEdge {\n  source: string;\n  target: string;\n  relation: string;\n  confidence: Confidence;\n  source_file: string;\n  source_location?: string;\n  confidence_score?: number;\n  weight?: number;\n  /** Original source direction (preserved for display). */\n  _src?: string;\n  /** Original target direction (preserved for display). */\n  _tgt?: string;\n  [key: string]: unknown;\n}\n\n/** A hyperedge grouping multiple nodes. */\nexport interface Hyperedge {\n  id: string;\n  label: string;\n  nodes: string[];\n  relation: string;\n  confidence: Confidence;\n  source_file: string;\n  confidence_score?: number;\n  [key: string]: unknown;\n}\n\n/** Output of an extraction pass. */\nexport interface Extraction {\n  nodes: GraphNode[];\n  edges: GraphEdge[];\n  hyperedges?: Hyperedge[];\n  input_tokens: number;\n  output_tokens: number;\n}\n\n/** Output of the detect() function. */\nexport interface DetectionResult {\n  files: Record<string, string[]>;\n  total_files: number;\n  total_words: number;\n  needs_graph: boolean;\n  warning: string | null;\n  skipped_sensitive: string[];\n  graphifyignore_patterns: number;\n  /** Present in incremental mode. */\n  incremental?: boolean;\n  new_files?: Record<string, string[]>;\n  unchanged_files?: Record<string, string[]>;\n  new_total?: number;\n  deleted_files?: string[];\n}\n\n/** A god node (most connected entity). */\nexport interface GodNodeEntry {\n  id: string;\n  label: string;\n  edges: number;\n}\n\n/** A surprising connection. */\nexport interface SurpriseEntry {\n  source: string;\n  target: string;\n  source_files: [string, string];\n  confidence: Confidence;\n  relation: string;\n  note?: string;\n  why?: string;\n  confidence_score?: number;\n}\n\n/** A suggested question. */\nexport interface SuggestedQuestion {\n  type: string;\n  question: string | null;\n  why: string;\n}\n\n/** Benchmark result. */\nexport interface BenchmarkResult {\n  corpus_tokens?: number;\n  corpus_words?: number;\n  nodes?: number;\n  edges?: number;\n  avg_query_tokens?: number;\n  reduction_ratio?: number;\n  per_question?: Array<{ question: string; query_tokens: number; reduction: number }>;\n  error?: string;\n}\n\n/** Graph diff between two snapshots. */\nexport interface GraphDiffResult {\n  new_nodes: Array<{ id: string; label: string }>;\n  removed_nodes: Array<{ id: string; label: string }>;\n  new_edges: Array<{ source: string; target: string; relation: string; confidence: string }>;\n  removed_edges: Array<{ source: string; target: string; relation: string; confidence: string }>;\n  summary: string;\n}\n\n/** Platform configuration for skill installation. */\nexport interface PlatformConfig {\n  skill_file: string;\n  skill_dst: string;\n  claude_md: boolean;\n}\n","/**\n * Validate extraction JSON against the graphify schema before graph assembly.\n */\n\nexport const VALID_FILE_TYPES = new Set([\"code\", \"document\", \"paper\", \"image\", \"rationale\"]);\nexport const VALID_CONFIDENCES = new Set([\"EXTRACTED\", \"INFERRED\", \"AMBIGUOUS\"]);\nexport const REQUIRED_NODE_FIELDS = [\"id\", \"label\", \"file_type\", \"source_file\"] as const;\nexport const REQUIRED_EDGE_FIELDS = [\"source\", \"target\", \"relation\", \"confidence\", \"source_file\"] as const;\n\n/**\n * Validate an extraction JSON dict against the graphify schema.\n * Returns a list of error strings - empty list means valid.\n */\nexport function validateExtraction(data: unknown): string[] {\n  if (typeof data !== \"object\" || data === null || Array.isArray(data)) {\n    return [\"Extraction must be a JSON object\"];\n  }\n\n  const d = data as Record<string, unknown>;\n  const errors: string[] = [];\n\n  // Nodes\n  if (!(\"nodes\" in d)) {\n    errors.push(\"Missing required key 'nodes'\");\n  } else if (!Array.isArray(d.nodes)) {\n    errors.push(\"'nodes' must be a list\");\n  } else {\n    for (let i = 0; i < d.nodes.length; i++) {\n      const node = d.nodes[i] as Record<string, unknown>;\n      if (typeof node !== \"object\" || node === null || Array.isArray(node)) {\n        errors.push(`Node ${i} must be an object`);\n        continue;\n      }\n      for (const field of REQUIRED_NODE_FIELDS) {\n        if (!(field in node)) {\n          errors.push(\n            `Node ${i} (id=${JSON.stringify(node.id ?? \"?\")}) missing required field '${field}'`,\n          );\n        }\n      }\n      if (\"file_type\" in node && !VALID_FILE_TYPES.has(node.file_type as string)) {\n        errors.push(\n          `Node ${i} (id=${JSON.stringify(node.id ?? \"?\")}) has invalid file_type ` +\n            `'${node.file_type}' - must be one of ${JSON.stringify([...VALID_FILE_TYPES].sort())}`,\n        );\n      }\n    }\n  }\n\n  // Edges\n  if (!(\"edges\" in d)) {\n    errors.push(\"Missing required key 'edges'\");\n  } else if (!Array.isArray(d.edges)) {\n    errors.push(\"'edges' must be a list\");\n  } else {\n    const nodeIds = new Set<string>();\n    if (Array.isArray(d.nodes)) {\n      for (const n of d.nodes) {\n        if (typeof n === \"object\" && n !== null && \"id\" in n) {\n          nodeIds.add((n as Record<string, unknown>).id as string);\n        }\n      }\n    }\n\n    for (let i = 0; i < d.edges.length; i++) {\n      const edge = d.edges[i] as Record<string, unknown>;\n      if (typeof edge !== \"object\" || edge === null || Array.isArray(edge)) {\n        errors.push(`Edge ${i} must be an object`);\n        continue;\n      }\n      for (const field of REQUIRED_EDGE_FIELDS) {\n        if (!(field in edge)) {\n          errors.push(`Edge ${i} missing required field '${field}'`);\n        }\n      }\n      if (\"confidence\" in edge && !VALID_CONFIDENCES.has(edge.confidence as string)) {\n        errors.push(\n          `Edge ${i} has invalid confidence '${edge.confidence}' ` +\n            `- must be one of ${JSON.stringify([...VALID_CONFIDENCES].sort())}`,\n        );\n      }\n      if (\"source\" in edge && nodeIds.size > 0 && !nodeIds.has(edge.source as string)) {\n        errors.push(`Edge ${i} source '${edge.source}' does not match any node id`);\n      }\n      if (\"target\" in edge && nodeIds.size > 0 && !nodeIds.has(edge.target as string)) {\n        errors.push(`Edge ${i} target '${edge.target}' does not match any node id`);\n      }\n    }\n  }\n\n  return errors;\n}\n\n/** Raise an error with all validation errors if extraction is invalid. */\nexport function assertValid(data: unknown): void {\n  const errors = validateExtraction(data);\n  if (errors.length > 0) {\n    const msg =\n      `Extraction JSON has ${errors.length} error(s):\\n` +\n      errors.map((e) => `  • ${e}`).join(\"\\n\");\n    throw new Error(msg);\n  }\n}\n","import Graph from \"graphology\";\n\nexport interface SerializedGraphData {\n  directed?: boolean;\n  multigraph?: boolean;\n  graph?: Record<string, unknown>;\n  nodes?: Array<Record<string, unknown> & { id: string }>;\n  links?: Array<Record<string, unknown> & { source: string; target: string }>;\n  edges?: Array<Record<string, unknown> & { source: string; target: string }>;\n  hyperedges?: Array<Record<string, unknown>>;\n}\n\nexport function createGraph(directed: boolean = false): Graph {\n  return new Graph({ type: directed ? \"directed\" : \"undirected\", multi: false });\n}\n\nexport function isDirectedGraph(G: Graph): boolean {\n  return G.type === \"directed\";\n}\n\nexport function loadGraphFromData(raw: SerializedGraphData): Graph {\n  const G = createGraph(raw.directed === true);\n\n  for (const [key, value] of Object.entries(raw.graph ?? {})) {\n    G.setAttribute(key, value);\n  }\n\n  for (const node of raw.nodes ?? []) {\n    const { id, ...attrs } = node;\n    G.mergeNode(id, attrs);\n  }\n\n  for (const link of raw.links ?? raw.edges ?? []) {\n    const { source, target, ...attrs } = link;\n    if (!G.hasNode(source) || !G.hasNode(target)) continue;\n    try {\n      G.mergeEdge(source, target, attrs);\n    } catch {\n      /* ignore duplicate merge failures */\n    }\n  }\n\n  if (raw.hyperedges && raw.hyperedges.length > 0) {\n    G.setAttribute(\"hyperedges\", raw.hyperedges);\n  }\n\n  return G;\n}\n\nexport function toUndirectedGraph(G: Graph): Graph {\n  if (!isDirectedGraph(G)) return G.copy();\n\n  const copy = createGraph(false);\n\n  for (const [key, value] of Object.entries(G.getAttributes())) {\n    copy.setAttribute(key, value);\n  }\n\n  G.forEachNode((nodeId, attrs) => {\n    copy.mergeNode(nodeId, attrs);\n  });\n\n  G.forEachEdge((_edge, attrs, source, target) => {\n    if (!copy.hasNode(source) || !copy.hasNode(target)) return;\n    try {\n      copy.mergeEdge(source, target, attrs);\n    } catch {\n      /* ignore duplicate merge failures */\n    }\n  });\n\n  return copy;\n}\n\nexport function forEachTraversalNeighbor(\n  G: Graph,\n  node: string,\n  callback: (neighbor: string) => void,\n): void {\n  if (isDirectedGraph(G)) {\n    G.forEachOutboundNeighbor(node, callback);\n    return;\n  }\n  G.forEachNeighbor(node, callback);\n}\n\nexport function traversalNeighbors(G: Graph, node: string): string[] {\n  const neighbors: string[] = [];\n  forEachTraversalNeighbor(G, node, (neighbor) => {\n    neighbors.push(neighbor);\n  });\n  return neighbors;\n}\n","/**\n * Assemble node+edge dicts into a graphology Graph, preserving edge direction.\n *\n * Node deduplication — three layers:\n *\n * 1. Within a file (AST): each extractor tracks a `seenIds` set.\n * 2. Between files (build): graphology mergeNode is idempotent — last write wins.\n * 3. Semantic merge (skill): before calling build(), the skill merges results\n *    using an explicit `seen` set keyed on node.id.\n */\nimport Graph from \"graphology\";\nimport type { Extraction } from \"./types.js\";\nimport { createGraph } from \"./graph.js\";\nimport { validateExtraction } from \"./validate.js\";\n\nexport interface BuildOptions {\n  directed?: boolean;\n}\n\nexport function buildFromJson(extraction: Extraction, options?: BuildOptions): Graph {\n  const errors = validateExtraction(extraction);\n  // Dangling edges (stdlib/external imports) are expected - only warn about real schema errors.\n  const realErrors = errors.filter((e) => !e.includes(\"does not match any node id\"));\n  if (realErrors.length > 0) {\n    console.error(\n      `[graphify] Extraction warning (${realErrors.length} issues): ${realErrors[0]}`,\n    );\n  }\n\n  const G = createGraph(options?.directed === true);\n\n  for (const node of extraction.nodes ?? []) {\n    const { id, ...attrs } = node;\n    G.mergeNode(id, attrs);\n  }\n\n  const nodeSet = new Set(G.nodes());\n\n  for (const edge of extraction.edges ?? []) {\n    const { source, target, ...attrs } = edge;\n    if (!nodeSet.has(source) || !nodeSet.has(target)) continue;\n    // Preserve original edge direction\n    attrs._src = source;\n    attrs._tgt = target;\n    // graphology mergeEdge prevents duplicates on same src/tgt pair\n    try {\n      G.mergeEdge(source, target, attrs);\n    } catch {\n      // ignore if edge already exists with different key\n    }\n  }\n\n  const hyperedges = extraction.hyperedges ?? [];\n  if (hyperedges.length > 0) {\n    G.setAttribute(\"hyperedges\", hyperedges);\n  }\n\n  return G;\n}\n\n/**\n * Merge multiple extraction results into one graph.\n * Extractions are merged in order — last attributes win for duplicate node IDs.\n */\nexport function build(extractions: Extraction[], options?: BuildOptions): Graph {\n  const combined: Extraction = {\n    nodes: [],\n    edges: [],\n    hyperedges: [],\n    input_tokens: 0,\n    output_tokens: 0,\n  };\n  for (const ext of extractions) {\n    combined.nodes.push(...(ext.nodes ?? []));\n    combined.edges.push(...(ext.edges ?? []));\n    (combined.hyperedges ??= []).push(...(ext.hyperedges ?? []));\n    combined.input_tokens += ext.input_tokens ?? 0;\n    combined.output_tokens += ext.output_tokens ?? 0;\n  }\n  return buildFromJson(combined, options);\n}\n","export type NumericMapLike<T> = Map<number, T> | Record<number | string, T>;\nexport type StringMapLike<T> = Map<string, T> | Record<string, T>;\n\nexport function toNumericMap<T>(\n  value: NumericMapLike<T> | null | undefined,\n): Map<number, T> {\n  if (value instanceof Map) return value;\n\n  const map = new Map<number, T>();\n  if (!value) return map;\n\n  for (const [key, entry] of Object.entries(value)) {\n    const numericKey = Number(key);\n    if (Number.isFinite(numericKey)) {\n      map.set(numericKey, entry as T);\n    }\n  }\n\n  return map;\n}\n\nexport function toStringMap<T>(\n  value: StringMapLike<T> | null | undefined,\n): Map<string, T> {\n  if (value instanceof Map) return value;\n\n  const map = new Map<string, T>();\n  if (!value) return map;\n\n  for (const [key, entry] of Object.entries(value)) {\n    map.set(key, entry as T);\n  }\n\n  return map;\n}\n","/**\n * Community detection on graphology graphs.\n * Uses Louvain (graphology-communities-louvain).\n * Splits oversized communities. Returns cohesion scores.\n */\nimport Graph from \"graphology\";\nimport louvain from \"graphology-communities-louvain\";\nimport { type NumericMapLike, toNumericMap } from \"./collections.js\";\nimport { toUndirectedGraph } from \"./graph.js\";\n\nconst MAX_COMMUNITY_FRACTION = 0.25;\nconst MIN_SPLIT_SIZE = 10;\n\nfunction partition(G: Graph): Map<string, number> {\n  // louvain assigns community attribute to each node, returns mapping\n  const result = louvain(G.type === \"directed\" ? toUndirectedGraph(G) : G);\n  const map = new Map<string, number>();\n  for (const [node, cid] of Object.entries(result)) {\n    map.set(node, cid as number);\n  }\n  return map;\n}\n\nfunction splitCommunity(G: Graph, nodes: string[]): string[][] {\n  const subgraph = G.copy();\n  // Remove nodes not in this community\n  const nodeSet = new Set(nodes);\n  subgraph.forEachNode((n) => {\n    if (!nodeSet.has(n)) subgraph.dropNode(n);\n  });\n\n  if (subgraph.size === 0) {\n    return nodes.map((n) => [n]);\n  }\n\n  try {\n    const subPartition = partition(subgraph);\n    const subCommunities = new Map<number, string[]>();\n    for (const [node, cid] of subPartition) {\n      if (!subCommunities.has(cid)) subCommunities.set(cid, []);\n      subCommunities.get(cid)!.push(node);\n    }\n    if (subCommunities.size <= 1) {\n      return [[...nodes].sort()];\n    }\n    return [...subCommunities.values()].map((v) => [...v].sort());\n  } catch {\n    return [[...nodes].sort()];\n  }\n}\n\nexport function cluster(G: Graph): Map<number, string[]> {\n  if (G.order === 0) return new Map();\n\n  if (G.size === 0) {\n    const result = new Map<number, string[]>();\n    const sorted = [...G.nodes()].sort();\n    sorted.forEach((n, i) => result.set(i, [n]));\n    return result;\n  }\n\n  // Handle isolates separately\n  const isolates: string[] = [];\n  const connectedNodes: string[] = [];\n  G.forEachNode((n) => {\n    if (G.degree(n) === 0) {\n      isolates.push(n);\n    } else {\n      connectedNodes.push(n);\n    }\n  });\n\n  const raw = new Map<number, string[]>();\n\n  if (connectedNodes.length > 0) {\n    // Build subgraph of connected nodes\n    const connected = G.copy();\n    for (const iso of isolates) {\n      connected.dropNode(iso);\n    }\n    const partitionMap = partition(connected);\n    for (const [node, cid] of partitionMap) {\n      if (!raw.has(cid)) raw.set(cid, []);\n      raw.get(cid)!.push(node);\n    }\n  }\n\n  // Each isolate becomes its own single-node community\n  let nextCid = Math.max(-1, ...raw.keys()) + 1;\n  for (const node of isolates) {\n    raw.set(nextCid, [node]);\n    nextCid++;\n  }\n\n  // Split oversized communities\n  const maxSize = Math.max(MIN_SPLIT_SIZE, Math.floor(G.order * MAX_COMMUNITY_FRACTION));\n  const finalCommunities: string[][] = [];\n  for (const nodes of raw.values()) {\n    if (nodes.length > maxSize) {\n      finalCommunities.push(...splitCommunity(G, nodes));\n    } else {\n      finalCommunities.push(nodes);\n    }\n  }\n\n  // Re-index by size descending for deterministic ordering\n  finalCommunities.sort((a, b) => b.length - a.length);\n  const result = new Map<number, string[]>();\n  finalCommunities.forEach((nodes, i) => {\n    result.set(i, [...nodes].sort());\n  });\n  return result;\n}\n\n/** Ratio of actual intra-community edges to maximum possible. */\nexport function cohesionScore(G: Graph, communityNodes: string[]): number {\n  const n = communityNodes.length;\n  if (n <= 1) return 1.0;\n  const nodeSet = new Set(communityNodes);\n  let actual = 0;\n  G.forEachEdge((edge, attrs, source, target) => {\n    if (nodeSet.has(source) && nodeSet.has(target)) {\n      actual++;\n    }\n  });\n  const possible = (n * (n - 1)) / 2;\n  return possible > 0 ? Math.round((actual / possible) * 100) / 100 : 0.0;\n}\n\nexport function scoreAll(\n  G: Graph,\n  communities: NumericMapLike<string[]>,\n): Map<number, number> {\n  const communityMap = toNumericMap(communities);\n  const result = new Map<number, number>();\n  for (const [cid, nodes] of communityMap) {\n    result.set(cid, cohesionScore(G, nodes));\n  }\n  return result;\n}\n","/**\n * File discovery, type classification, and corpus health checks.\n */\nimport {\n  readdirSync, readFileSync, writeFileSync, statSync, existsSync, mkdirSync, lstatSync,\n} from \"node:fs\";\nimport { join, resolve, extname, basename, relative, sep, dirname } from \"node:path\";\nimport { createHash } from \"node:crypto\";\nimport { FileType } from \"./types.js\";\nimport type { DetectionResult } from \"./types.js\";\n\nconst MANIFEST_PATH = \"graphify-out/manifest.json\";\n\nexport const CODE_EXTENSIONS = new Set([\n  \".py\", \".ts\", \".js\", \".jsx\", \".tsx\", \".go\", \".rs\", \".java\", \".cpp\", \".cc\", \".cxx\",\n  \".c\", \".h\", \".hpp\", \".rb\", \".swift\", \".kt\", \".kts\", \".cs\", \".scala\", \".php\",\n  \".lua\", \".toc\", \".zig\", \".ps1\", \".ex\", \".exs\", \".m\", \".mm\", \".jl\",\n]);\n\nexport const DOC_EXTENSIONS = new Set([\".md\", \".txt\", \".rst\"]);\nexport const PAPER_EXTENSIONS = new Set([\".pdf\"]);\nexport const IMAGE_EXTENSIONS = new Set([\".png\", \".jpg\", \".jpeg\", \".gif\", \".webp\", \".svg\"]);\nexport const OFFICE_EXTENSIONS = new Set([\".docx\", \".xlsx\"]);\nexport const VIDEO_EXTENSIONS = new Set([\n  \".mp4\", \".mov\", \".webm\", \".mkv\", \".avi\", \".m4v\", \".mp3\", \".wav\", \".m4a\", \".ogg\",\n]);\n\nconst CORPUS_WARN_THRESHOLD = 50_000;\nconst CORPUS_UPPER_THRESHOLD = 500_000;\nconst FILE_COUNT_UPPER = 200;\n\n// Sensitive file patterns\nconst SENSITIVE_PATTERNS = [\n  /(^|[\\\\/])\\.(env|envrc)(\\.|$)/i,\n  /\\.(pem|key|p12|pfx|cert|crt|der|p8)$/i,\n  /(credential|secret|passwd|password|token|private_key)/i,\n  /(id_rsa|id_dsa|id_ecdsa|id_ed25519)(\\.pub)?$/,\n  /(\\.netrc|\\.pgpass|\\.htpasswd)$/i,\n  /(aws_credentials|gcloud_credentials|service.account)/i,\n];\n\n// Academic paper signals\nconst PAPER_SIGNALS = [\n  /\\barxiv\\b/i, /\\bdoi\\s*:/i, /\\babstract\\b/i, /\\bproceedings\\b/i,\n  /\\bjournal\\b/i, /\\bpreprint\\b/i, /\\\\cite\\{/, /\\[\\d+\\]/, /\\[\\n\\d+\\n\\]/,\n  /eq\\.\\s*\\d+|equation\\s+\\d+/i, /\\d{4}\\.\\d{4,5}/, /\\bwe propose\\b/i, /\\bliterature\\b/i,\n];\nconst PAPER_SIGNAL_THRESHOLD = 3;\n\nfunction isSensitive(filePath: string): boolean {\n  const name = basename(filePath);\n  return SENSITIVE_PATTERNS.some((p) => p.test(name) || p.test(filePath));\n}\n\nfunction looksLikePaper(filePath: string): boolean {\n  try {\n    const text = readFileSync(filePath, \"utf-8\").slice(0, 3000);\n    const hits = PAPER_SIGNALS.filter((p) => p.test(text)).length;\n    return hits >= PAPER_SIGNAL_THRESHOLD;\n  } catch {\n    return false;\n  }\n}\n\nconst ASSET_DIR_MARKERS = new Set([\".imageset\", \".xcassets\", \".appiconset\", \".colorset\", \".launchimage\"]);\n\nexport function classifyFile(filePath: string): FileType | null {\n  const ext = extname(filePath).toLowerCase();\n  if (CODE_EXTENSIONS.has(ext)) return FileType.CODE;\n  if (PAPER_EXTENSIONS.has(ext)) {\n    // PDFs inside Xcode asset catalogs are vector icons, not papers\n    const parts = filePath.split(sep);\n    if (parts.some((p) => [...ASSET_DIR_MARKERS].some((m) => p.endsWith(m)))) return null;\n    return FileType.PAPER;\n  }\n  if (IMAGE_EXTENSIONS.has(ext)) return FileType.IMAGE;\n  if (VIDEO_EXTENSIONS.has(ext)) return FileType.VIDEO;\n  if (DOC_EXTENSIONS.has(ext)) {\n    if (looksLikePaper(filePath)) return FileType.PAPER;\n    return FileType.DOCUMENT;\n  }\n  if (OFFICE_EXTENSIONS.has(ext)) return FileType.DOCUMENT;\n  return null;\n}\n\n/** Extract plain text from a PDF file using pdf-parse. */\nexport async function extractPdfText(filePath: string): Promise<string> {\n  try {\n    const pdfParse = (await import(\"pdf-parse\")).default;\n    const buf = readFileSync(filePath);\n    const data = await pdfParse(buf);\n    return data.text;\n  } catch {\n    return \"\";\n  }\n}\n\n/** Convert a .docx file to markdown text using mammoth. */\nexport async function docxToMarkdown(filePath: string): Promise<string> {\n  try {\n    const mammoth = await import(\"mammoth\");\n    const result = await mammoth.convertToHtml({ path: filePath });\n    // mammoth produces HTML; strip tags for a simple text fallback\n    return result.value.replace(/<[^>]+>/g, \" \").replace(/\\s+/g, \" \").trim();\n  } catch {\n    return \"\";\n  }\n}\n\n/** Convert an .xlsx file to markdown text using exceljs. */\nexport async function xlsxToMarkdown(filePath: string): Promise<string> {\n  try {\n    const ExcelJS = await import(\"exceljs\");\n    const wb = new ExcelJS.Workbook();\n    await wb.xlsx.readFile(filePath);\n    const sections: string[] = [];\n    wb.eachSheet((ws) => {\n      const rows: string[][] = [];\n      ws.eachRow((row) => {\n        const cells = (row.values as unknown[]).slice(1).map((v) => (v != null ? String(v) : \"\"));\n        rows.push(cells);\n      });\n      if (rows.length === 0) return;\n      sections.push(`## Sheet: ${ws.name}`);\n      const header = \"| \" + rows[0]!.join(\" | \") + \" |\";\n      const sep = \"| \" + rows[0]!.map(() => \"---\").join(\" | \") + \" |\";\n      sections.push(header, sep);\n      for (const row of rows.slice(1)) {\n        sections.push(\"| \" + row.join(\" | \") + \" |\");\n      }\n    });\n    return sections.join(\"\\n\");\n  } catch {\n    return \"\";\n  }\n}\n\n/** Convert .docx/.xlsx to a markdown sidecar file. */\nexport async function convertOfficeFile(filePath: string, outDir: string): Promise<string | null> {\n  const ext = extname(filePath).toLowerCase();\n  let text: string;\n  if (ext === \".docx\") {\n    text = await docxToMarkdown(filePath);\n  } else if (ext === \".xlsx\") {\n    text = await xlsxToMarkdown(filePath);\n  } else {\n    return null;\n  }\n\n  if (!text.trim()) return null;\n\n  mkdirSync(outDir, { recursive: true });\n  const nameHash = createHash(\"sha256\").update(resolve(filePath)).digest(\"hex\").slice(0, 8);\n  const stem = basename(filePath, extname(filePath));\n  const outPath = join(outDir, `${stem}_${nameHash}.md`);\n  writeFileSync(outPath, `<!-- converted from ${basename(filePath)} -->\\n\\n${text}`, \"utf-8\");\n  return outPath;\n}\n\nfunction countWords(filePath: string): number {\n  try {\n    const text = readFileSync(filePath, \"utf-8\");\n    return text.split(/\\s+/).filter(Boolean).length;\n  } catch {\n    return 0;\n  }\n}\n\n// Directory names to always skip\nconst SKIP_DIRS = new Set([\n  \"venv\", \".venv\", \"env\", \".env\", \"node_modules\", \"__pycache__\", \".git\",\n  \"dist\", \"build\", \"target\", \"out\", \"site-packages\", \"lib64\",\n  \".pytest_cache\", \".mypy_cache\", \".ruff_cache\", \".tox\", \".eggs\",\n]);\n\nfunction isNoiseDir(part: string): boolean {\n  if (SKIP_DIRS.has(part)) return true;\n  if (part.endsWith(\"_venv\") || part.endsWith(\"_env\")) return true;\n  if (part.endsWith(\".egg-info\")) return true;\n  return false;\n}\n\nfunction loadGraphifyignore(root: string): string[] {\n  const patterns: string[] = [];\n  let current = resolve(root);\n\n  while (true) {\n    const ignoreFile = join(current, \".graphifyignore\");\n    if (existsSync(ignoreFile)) {\n      for (let line of readFileSync(ignoreFile, \"utf-8\").split(\"\\n\")) {\n        line = line.trim();\n        if (line && !line.startsWith(\"#\")) {\n          patterns.push(line);\n        }\n      }\n    }\n\n    if (existsSync(join(current, \".git\"))) {\n      break;\n    }\n\n    const parent = dirname(current);\n    if (parent === current) {\n      break;\n    }\n    current = parent;\n  }\n  return patterns;\n}\n\nfunction matchGlob(text: string, pattern: string): boolean {\n  // Simple glob matching (*, ?)\n  const regex = pattern\n    .replace(/[.+^${}()|[\\]\\\\]/g, \"\\\\$&\")\n    .replace(/\\*/g, \".*\")\n    .replace(/\\?/g, \".\");\n  return new RegExp(`^${regex}$`).test(text);\n}\n\nfunction isIgnored(filePath: string, root: string, patterns: string[]): boolean {\n  if (patterns.length === 0) return false;\n  let rel: string;\n  try {\n    rel = relative(root, filePath).replace(/\\\\/g, \"/\");\n  } catch {\n    return false;\n  }\n  const parts = rel.split(\"/\");\n  for (const pattern of patterns) {\n    const p = pattern.replace(/^\\/+|\\/+$/g, \"\");\n    if (!p) continue;\n    if (matchGlob(rel, p)) return true;\n    if (matchGlob(basename(filePath), p)) return true;\n    for (let i = 0; i < parts.length; i++) {\n      if (matchGlob(parts[i]!, p)) return true;\n      if (matchGlob(parts.slice(0, i + 1).join(\"/\"), p)) return true;\n    }\n  }\n  return false;\n}\n\nfunction walkDir(\n  dir: string,\n  root: string,\n  ignorePatterns: string[],\n  followSymlinks: boolean,\n  skipPrune: boolean,\n): string[] {\n  const result: string[] = [];\n  let entries: string[];\n  try {\n    entries = readdirSync(dir);\n  } catch {\n    return result;\n  }\n\n  for (const entry of entries) {\n    const full = join(dir, entry);\n    let stat;\n    try {\n      stat = followSymlinks ? statSync(full) : lstatSync(full);\n    } catch {\n      continue;\n    }\n\n    if (stat.isDirectory()) {\n      if (!skipPrune) {\n        if (entry.startsWith(\".\")) continue;\n        if (isNoiseDir(entry)) continue;\n        if (isIgnored(full, root, ignorePatterns)) continue;\n      }\n      result.push(...walkDir(full, root, ignorePatterns, followSymlinks, skipPrune));\n    } else if (stat.isFile()) {\n      result.push(full);\n    }\n  }\n\n  return result;\n}\n\nexport function detect(root: string, options?: { followSymlinks?: boolean }): DetectionResult {\n  const followSymlinks = options?.followSymlinks ?? false;\n  const rootResolved = resolve(root);\n  const ignorePatterns = loadGraphifyignore(rootResolved);\n  const convertedDir = join(rootResolved, \"graphify-out\", \"converted\");\n  const memoryDir = join(rootResolved, \"graphify-out\", \"memory\");\n\n  const files: Record<string, string[]> = {\n    code: [], document: [], paper: [], image: [], video: [],\n  };\n  let totalWords = 0;\n  const skippedSensitive: string[] = [];\n\n  // Walk main tree\n  const allFiles = walkDir(rootResolved, rootResolved, ignorePatterns, followSymlinks, false);\n\n  // Also walk memory dir if it exists\n  if (existsSync(memoryDir)) {\n    allFiles.push(...walkDir(memoryDir, rootResolved, ignorePatterns, followSymlinks, true));\n  }\n\n  const seen = new Set<string>();\n\n  for (const p of allFiles) {\n    if (seen.has(p)) continue;\n    seen.add(p);\n\n    const inMemory = existsSync(memoryDir) && p.startsWith(memoryDir);\n    if (!inMemory) {\n      if (basename(p).startsWith(\".\")) continue;\n      if (p.startsWith(convertedDir)) continue;\n    }\n    if (isIgnored(p, rootResolved, ignorePatterns)) continue;\n    if (isSensitive(p)) {\n      skippedSensitive.push(p);\n      continue;\n    }\n\n    const ftype = classifyFile(p);\n    if (!ftype) continue;\n\n    // Office files: convert to markdown sidecar\n    if (OFFICE_EXTENSIONS.has(extname(p).toLowerCase())) {\n      // Note: office conversion is async but detect is sync.\n      // We skip office files in sync detect; they're handled in the async pipeline.\n      skippedSensitive.push(p + \" [office conversion requires async - use pipeline]\");\n      continue;\n    }\n\n    files[ftype]!.push(p);\n    if (ftype !== FileType.VIDEO) {\n      totalWords += countWords(p);\n    }\n  }\n\n  const totalFiles = Object.values(files).reduce((s, v) => s + v.length, 0);\n  const needsGraph = totalWords >= CORPUS_WARN_THRESHOLD;\n\n  let warning: string | null = null;\n  if (!needsGraph) {\n    warning = `Corpus is ~${totalWords.toLocaleString()} words - fits in a single context window. You may not need a graph.`;\n  } else if (totalWords >= CORPUS_UPPER_THRESHOLD || totalFiles >= FILE_COUNT_UPPER) {\n    warning =\n      `Large corpus: ${totalFiles} files · ~${totalWords.toLocaleString()} words. ` +\n      `Semantic extraction will be expensive (many Claude tokens). ` +\n      `Consider running on a subfolder, or use --no-semantic to run AST-only.`;\n  }\n\n  return {\n    files,\n    total_files: totalFiles,\n    total_words: totalWords,\n    needs_graph: needsGraph,\n    warning,\n    skipped_sensitive: skippedSensitive,\n    graphifyignore_patterns: ignorePatterns.length,\n  };\n}\n\nexport function loadManifest(manifestPath: string = MANIFEST_PATH): Record<string, number> {\n  try {\n    return JSON.parse(readFileSync(manifestPath, \"utf-8\")) as Record<string, number>;\n  } catch {\n    return {};\n  }\n}\n\nexport function saveManifest(files: Record<string, string[]>, manifestPath: string = MANIFEST_PATH): void {\n  const manifest: Record<string, number> = {};\n  for (const fileList of Object.values(files)) {\n    for (const f of fileList) {\n      try {\n        manifest[f] = statSync(f).mtimeMs;\n      } catch { /* deleted between detect and save */ }\n    }\n  }\n  const dir = join(manifestPath, \"..\");\n  mkdirSync(dir, { recursive: true });\n  writeFileSync(manifestPath, JSON.stringify(manifest, null, 2));\n}\n\nexport function detectIncremental(root: string, manifestPath: string = MANIFEST_PATH): DetectionResult {\n  const full = detect(root);\n  const manifest = loadManifest(manifestPath);\n\n  if (Object.keys(manifest).length === 0) {\n    return {\n      ...full,\n      incremental: true,\n      new_files: full.files,\n      unchanged_files: Object.fromEntries(Object.keys(full.files).map((k) => [k, []])),\n      new_total: full.total_files,\n    };\n  }\n\n  const newFiles: Record<string, string[]> = {};\n  const unchangedFiles: Record<string, string[]> = {};\n  for (const k of Object.keys(full.files)) {\n    newFiles[k] = [];\n    unchangedFiles[k] = [];\n  }\n\n  for (const [ftype, fileList] of Object.entries(full.files)) {\n    for (const f of fileList) {\n      const storedMtime = manifest[f];\n      let currentMtime = 0;\n      try { currentMtime = statSync(f).mtimeMs; } catch { /* ignore */ }\n      if (storedMtime === undefined || currentMtime > storedMtime) {\n        newFiles[ftype]!.push(f);\n      } else {\n        unchangedFiles[ftype]!.push(f);\n      }\n    }\n  }\n\n  const currentFiles = new Set(Object.values(full.files).flat());\n  const deletedFiles = Object.keys(manifest).filter((f) => !currentFiles.has(f));\n  const newTotal = Object.values(newFiles).reduce((s, v) => s + v.length, 0);\n\n  return {\n    ...full,\n    incremental: true,\n    new_files: newFiles,\n    unchanged_files: unchangedFiles,\n    new_total: newTotal,\n    deleted_files: deletedFiles,\n  };\n}\n","/**\n * Graph analysis: god nodes (most connected), surprising connections (cross-community),\n * suggested questions, graph diff.\n */\nimport Graph from \"graphology\";\nimport betweennessCentrality from \"graphology-metrics/centrality/betweenness.js\";\nimport type { GodNodeEntry, SurpriseEntry, SuggestedQuestion, GraphDiffResult } from \"./types.js\";\nimport { type NumericMapLike, toNumericMap } from \"./collections.js\";\nimport { cohesionScore } from \"./cluster.js\";\nimport { traversalNeighbors } from \"./graph.js\";\nimport {\n  CODE_EXTENSIONS,\n  DOC_EXTENSIONS,\n  PAPER_EXTENSIONS,\n  IMAGE_EXTENSIONS,\n} from \"./detect.js\";\n\ntype GraphInstance = InstanceType<typeof Graph>;\n\nfunction nodeCommunityMap(communities: NumericMapLike<string[]>): Map<string, number> {\n  const communityMap = toNumericMap(communities);\n  const result = new Map<string, number>();\n  for (const [cid, nodes] of communityMap) {\n    for (const n of nodes) result.set(n, cid);\n  }\n  return result;\n}\n\nexport function isFileNode(G: Graph, nodeId: string): boolean {\n  const attrs = G.getNodeAttributes(nodeId);\n  const label = (attrs.label as string) ?? \"\";\n  if (!label) return false;\n\n  const sourceFile = (attrs.source_file as string) ?? \"\";\n  if (sourceFile) {\n    const fileName = sourceFile.split(\"/\").pop() ?? \"\";\n    if (label === fileName) return true;\n  }\n\n  if (label.startsWith(\".\") && label.endsWith(\"()\")) return true;\n  if (label.endsWith(\"()\") && G.degree(nodeId) <= 1) return true;\n  return false;\n}\n\nexport function isConceptNode(G: Graph, nodeId: string): boolean {\n  const data = G.getNodeAttributes(nodeId);\n  const source = (data.source_file as string) ?? \"\";\n  if (!source) return true;\n  const lastPart = source.split(\"/\").pop() ?? \"\";\n  if (!lastPart.includes(\".\")) return true;\n  return false;\n}\n\nfunction fileCategory(path: string): string {\n  const ext = path.includes(\".\")\n    ? `.${path.split(\".\").pop()?.toLowerCase() ?? \"\"}`\n    : \"\";\n  if (CODE_EXTENSIONS.has(ext)) return \"code\";\n  if (PAPER_EXTENSIONS.has(ext)) return \"paper\";\n  if (IMAGE_EXTENSIONS.has(ext)) return \"image\";\n  if (DOC_EXTENSIONS.has(ext)) return \"doc\";\n  return \"doc\";\n}\n\nfunction topLevelDir(path: string): string {\n  return path.includes(\"/\") ? path.split(\"/\")[0]! : path;\n}\n\nfunction surpriseScore(\n  G: Graph,\n  u: string,\n  v: string,\n  data: Record<string, unknown>,\n  nodeCommunity: Map<string, number>,\n  uSource: string,\n  vSource: string,\n): [number, string[]] {\n  let score = 0;\n  const reasons: string[] = [];\n\n  const conf = (data.confidence as string) ?? \"EXTRACTED\";\n  const confBonus: Record<string, number> = { AMBIGUOUS: 3, INFERRED: 2, EXTRACTED: 1 };\n  score += confBonus[conf] ?? 1;\n  if (conf === \"AMBIGUOUS\" || conf === \"INFERRED\") {\n    reasons.push(`${conf.toLowerCase()} connection - not explicitly stated in source`);\n  }\n\n  const catU = fileCategory(uSource);\n  const catV = fileCategory(vSource);\n  if (catU !== catV) {\n    score += 2;\n    reasons.push(`crosses file types (${catU} ↔ ${catV})`);\n  }\n\n  if (topLevelDir(uSource) !== topLevelDir(vSource)) {\n    score += 2;\n    reasons.push(\"connects across different repos/directories\");\n  }\n\n  const cidU = nodeCommunity.get(u);\n  const cidV = nodeCommunity.get(v);\n  if (cidU !== undefined && cidV !== undefined && cidU !== cidV) {\n    score += 1;\n    reasons.push(\"bridges separate communities\");\n  }\n\n  if (data.relation === \"semantically_similar_to\") {\n    score = Math.floor(score * 1.5);\n    reasons.push(\"semantically similar concepts with no structural link\");\n  }\n\n  const degU = G.degree(u);\n  const degV = G.degree(v);\n  if (Math.min(degU, degV) <= 2 && Math.max(degU, degV) >= 5) {\n    score += 1;\n    const peripheral = degU <= 2 ? (G.getNodeAttribute(u, \"label\") as string) : (G.getNodeAttribute(v, \"label\") as string);\n    const hub = degU <= 2 ? (G.getNodeAttribute(v, \"label\") as string) : (G.getNodeAttribute(u, \"label\") as string);\n    reasons.push(`peripheral node \\`${peripheral}\\` unexpectedly reaches hub \\`${hub}\\``);\n  }\n\n  return [score, reasons];\n}\n\nexport function godNodes(G: Graph, topN: number = 10): GodNodeEntry[] {\n  const degree: [string, number][] = [];\n  G.forEachNode((n) => degree.push([n, G.degree(n)]));\n  degree.sort((a, b) => b[1] - a[1]);\n\n  const result: GodNodeEntry[] = [];\n  for (const [nodeId, deg] of degree) {\n    if (isFileNode(G, nodeId) || isConceptNode(G, nodeId)) continue;\n    result.push({\n      id: nodeId,\n      label: (G.getNodeAttribute(nodeId, \"label\") as string) ?? nodeId,\n      edges: deg,\n    });\n    if (result.length >= topN) break;\n  }\n  return result;\n}\n\nexport function surprisingConnections(\n  G: Graph,\n  communities?: NumericMapLike<string[]>,\n  topN: number = 5,\n): SurpriseEntry[] {\n  const comms = toNumericMap(communities);\n  const sourceFiles = new Set<string>();\n  G.forEachNode((_, data) => {\n    const sf = (data.source_file as string) ?? \"\";\n    if (sf) sourceFiles.add(sf);\n  });\n  const isMultiSource = sourceFiles.size > 1;\n\n  if (isMultiSource) {\n    return crossFileSurprises(G, comms, topN);\n  }\n  return crossCommunitySurprises(G, comms, topN);\n}\n\nfunction crossFileSurprises(G: Graph, communities: Map<number, string[]>, topN: number): SurpriseEntry[] {\n  const nodeCommunity = nodeCommunityMap(communities);\n  const candidates: (SurpriseEntry & { _score: number })[] = [];\n\n  G.forEachEdge((edge, data, source, target) => {\n    const relation = (data.relation as string) ?? \"\";\n    if ([\"imports\", \"imports_from\", \"contains\", \"method\"].includes(relation)) return;\n    if (isConceptNode(G, source) || isConceptNode(G, target)) return;\n    if (isFileNode(G, source) || isFileNode(G, target)) return;\n\n    const uSource = (G.getNodeAttribute(source, \"source_file\") as string) ?? \"\";\n    const vSource = (G.getNodeAttribute(target, \"source_file\") as string) ?? \"\";\n    if (!uSource || !vSource || uSource === vSource) return;\n\n    const [score, reasons] = surpriseScore(G, source, target, data, nodeCommunity, uSource, vSource);\n    const srcId = (data._src as string) ?? source;\n    const tgtId = (data._tgt as string) ?? target;\n\n    candidates.push({\n      _score: score,\n      source: (G.getNodeAttribute(srcId, \"label\") as string) ?? srcId,\n      target: (G.getNodeAttribute(tgtId, \"label\") as string) ?? tgtId,\n      source_files: [\n        (G.getNodeAttribute(srcId, \"source_file\") as string) ?? \"\",\n        (G.getNodeAttribute(tgtId, \"source_file\") as string) ?? \"\",\n      ],\n      confidence: (data.confidence as SurpriseEntry[\"confidence\"]) ?? \"EXTRACTED\",\n      relation,\n      why: reasons.length > 0 ? reasons.join(\"; \") : \"cross-file semantic connection\",\n    });\n  });\n\n  candidates.sort((a, b) => b._score - a._score);\n  const result = candidates.slice(0, topN).map(({ _score, ...rest }) => rest);\n\n  if (result.length > 0) return result;\n  return crossCommunitySurprises(G, communities, topN);\n}\n\nfunction crossCommunitySurprises(\n  G: Graph,\n  communities: Map<number, string[]>,\n  topN: number,\n): SurpriseEntry[] {\n  if (communities.size === 0) {\n    if (G.size === 0) return [];\n    // Use edge betweenness centrality approximation\n    return edgeBetweennessSurprises(G, topN);\n  }\n\n  const nodeCommunity = nodeCommunityMap(communities);\n  const surprises: (SurpriseEntry & { _pair: string })[] = [];\n\n  G.forEachEdge((edge, data, u, v) => {\n    const cidU = nodeCommunity.get(u);\n    const cidV = nodeCommunity.get(v);\n    if (cidU === undefined || cidV === undefined || cidU === cidV) return;\n    if (isFileNode(G, u) || isFileNode(G, v)) return;\n    const relation = (data.relation as string) ?? \"\";\n    if ([\"imports\", \"imports_from\", \"contains\", \"method\"].includes(relation)) return;\n\n    const srcId = (data._src as string) ?? u;\n    const tgtId = (data._tgt as string) ?? v;\n\n    surprises.push({\n      source: (G.getNodeAttribute(srcId, \"label\") as string) ?? srcId,\n      target: (G.getNodeAttribute(tgtId, \"label\") as string) ?? tgtId,\n      source_files: [\n        (G.getNodeAttribute(srcId, \"source_file\") as string) ?? \"\",\n        (G.getNodeAttribute(tgtId, \"source_file\") as string) ?? \"\",\n      ],\n      confidence: (data.confidence as SurpriseEntry[\"confidence\"]) ?? \"EXTRACTED\",\n      relation,\n      note: `Bridges community ${cidU} → community ${cidV}`,\n      _pair: [Math.min(cidU, cidV), Math.max(cidU, cidV)].join(\",\"),\n    });\n  });\n\n  const order: Record<string, number> = { AMBIGUOUS: 0, INFERRED: 1, EXTRACTED: 2 };\n  surprises.sort((a, b) => (order[a.confidence] ?? 3) - (order[b.confidence] ?? 3));\n\n  const seenPairs = new Set<string>();\n  const deduped: SurpriseEntry[] = [];\n  for (const s of surprises) {\n    const pair = s._pair;\n    if (!seenPairs.has(pair)) {\n      seenPairs.add(pair);\n      const { _pair, ...rest } = s;\n      deduped.push(rest);\n    }\n  }\n  return deduped.slice(0, topN);\n}\n\nfunction edgeBetweennessSurprises(G: Graph, topN: number): SurpriseEntry[] {\n  // Approximate edge betweenness via node betweenness\n  const bc = betweennessCentrality(G);\n  const edgeScores: [string, string, number, Record<string, unknown>][] = [];\n\n  G.forEachEdge((edge, data, u, v) => {\n    const score = (bc[u] ?? 0) + (bc[v] ?? 0);\n    edgeScores.push([u, v, score, data]);\n  });\n\n  edgeScores.sort((a, b) => b[2] - a[2]);\n\n  return edgeScores.slice(0, topN).map(([u, v, score, data]) => ({\n    source: (G.getNodeAttribute(u, \"label\") as string) ?? u,\n    target: (G.getNodeAttribute(v, \"label\") as string) ?? v,\n    source_files: [\n      (G.getNodeAttribute(u, \"source_file\") as string) ?? \"\",\n      (G.getNodeAttribute(v, \"source_file\") as string) ?? \"\",\n    ],\n    confidence: (data.confidence as SurpriseEntry[\"confidence\"]) ?? \"EXTRACTED\",\n    relation: (data.relation as string) ?? \"\",\n    note: `Bridges graph structure (betweenness=${score.toFixed(3)})`,\n  }));\n}\n\nexport function suggestQuestions(\n  G: Graph,\n  communities: NumericMapLike<string[]>,\n  communityLabels: NumericMapLike<string>,\n  topN: number = 7,\n): SuggestedQuestion[] {\n  const communityMap = toNumericMap(communities);\n  const labelMap = toNumericMap(communityLabels);\n  const questions: SuggestedQuestion[] = [];\n  const nodeCommunity = nodeCommunityMap(communityMap);\n\n  // 1. AMBIGUOUS edges\n  G.forEachEdge((edge, data, u, v) => {\n    if (data.confidence === \"AMBIGUOUS\") {\n      const ul = (G.getNodeAttribute(u, \"label\") as string) ?? u;\n      const vl = (G.getNodeAttribute(v, \"label\") as string) ?? v;\n      const relation = (data.relation as string) ?? \"related to\";\n      questions.push({\n        type: \"ambiguous_edge\",\n        question: `What is the exact relationship between \\`${ul}\\` and \\`${vl}\\`?`,\n        why: `Edge tagged AMBIGUOUS (relation: ${relation}) - confidence is low.`,\n      });\n    }\n  });\n\n  // 2. Bridge nodes (high betweenness)\n  if (G.size > 0) {\n    const bc = betweennessCentrality(G);\n    const bridges: [string, number][] = Object.entries(bc)\n      .filter(([n, s]) => !isFileNode(G, n) && !isConceptNode(G, n) && (s as number) > 0)\n      .sort((a, b) => (b[1] as number) - (a[1] as number))\n      .slice(0, 3) as [string, number][];\n\n    for (const [nodeId, score] of bridges) {\n      const label = (G.getNodeAttribute(nodeId, \"label\") as string) ?? nodeId;\n      const cid = nodeCommunity.get(nodeId);\n      const commLabel = cid !== undefined ? (labelMap.get(cid) ?? `Community ${cid}`) : \"unknown\";\n      const neighborComms = new Set<number>();\n      for (const n of traversalNeighbors(G, nodeId)) {\n        const nc = nodeCommunity.get(n);\n        if (nc !== undefined && nc !== cid) neighborComms.add(nc);\n      }\n      if (neighborComms.size > 0) {\n        const otherLabels = [...neighborComms].map((c) => labelMap.get(c) ?? `Community ${c}`);\n        questions.push({\n          type: \"bridge_node\",\n          question: `Why does \\`${label}\\` connect \\`${commLabel}\\` to ${otherLabels.map((l) => `\\`${l}\\``).join(\", \")}?`,\n          why: `High betweenness centrality (${score.toFixed(3)}) - this node is a cross-community bridge.`,\n        });\n      }\n    }\n  }\n\n  // 3. God nodes with many INFERRED edges\n  const degree: [string, number][] = [];\n  G.forEachNode((n) => degree.push([n, G.degree(n)]));\n  degree.sort((a, b) => b[1] - a[1]);\n  const topNodes = degree.filter(([n]) => !isFileNode(G, n)).slice(0, 5);\n\n  for (const [nodeId] of topNodes) {\n    const inferred: string[] = [];\n    G.forEachEdge(nodeId, (edge, data, source, target) => {\n      if (data.confidence === \"INFERRED\") {\n        const srcId = (data._src as string) ?? source;\n        const tgtId = (data._tgt as string) ?? target;\n        const otherId = srcId === nodeId ? tgtId : srcId;\n        inferred.push((G.getNodeAttribute(otherId, \"label\") as string) ?? otherId);\n      }\n    });\n    if (inferred.length >= 2) {\n      const label = (G.getNodeAttribute(nodeId, \"label\") as string) ?? nodeId;\n      questions.push({\n        type: \"verify_inferred\",\n        question: `Are the ${inferred.length} inferred relationships involving \\`${label}\\` (e.g. with \\`${inferred[0]}\\` and \\`${inferred[1]}\\`) actually correct?`,\n        why: `\\`${label}\\` has ${inferred.length} INFERRED edges - model-reasoned connections that need verification.`,\n      });\n    }\n  }\n\n  // 4. Isolated nodes\n  const isolated: string[] = [];\n  G.forEachNode((n) => {\n    if (G.degree(n) <= 1 && !isFileNode(G, n) && !isConceptNode(G, n)) {\n      isolated.push(n);\n    }\n  });\n  if (isolated.length > 0) {\n    const labels = isolated.slice(0, 3).map((n) => (G.getNodeAttribute(n, \"label\") as string) ?? n);\n    questions.push({\n      type: \"isolated_nodes\",\n      question: `What connects ${labels.map((l) => `\\`${l}\\``).join(\", \")} to the rest of the system?`,\n      why: `${isolated.length} weakly-connected nodes found - possible documentation gaps or missing edges.`,\n    });\n  }\n\n  // 5. Low-cohesion communities\n  for (const [cid, nodes] of communityMap) {\n    const score = cohesionScore(G, nodes);\n    if (score < 0.15 && nodes.length >= 5) {\n      const label = labelMap.get(cid) ?? `Community ${cid}`;\n      questions.push({\n        type: \"low_cohesion\",\n        question: `Should \\`${label}\\` be split into smaller, more focused modules?`,\n        why: `Cohesion score ${score} - nodes in this community are weakly interconnected.`,\n      });\n    }\n  }\n\n  if (questions.length === 0) {\n    return [{\n      type: \"no_signal\",\n      question: null,\n      why:\n        \"Not enough signal to generate questions. \" +\n        \"This usually means the corpus has no AMBIGUOUS edges, no bridge nodes, \" +\n        \"no INFERRED relationships, and all communities are tightly cohesive. \" +\n        \"Add more files or run with --mode deep to extract richer edges.\",\n    }];\n  }\n\n  return questions.slice(0, topN);\n}\n\nexport function graphDiff(GOld: Graph, GNew: Graph): GraphDiffResult {\n  const oldNodes = new Set(GOld.nodes());\n  const newNodes = new Set(GNew.nodes());\n\n  const addedNodeIds = [...newNodes].filter((n) => !oldNodes.has(n));\n  const removedNodeIds = [...oldNodes].filter((n) => !newNodes.has(n));\n\n  const newNodesList = addedNodeIds.map((n) => ({\n    id: n,\n    label: (GNew.getNodeAttribute(n, \"label\") as string) ?? n,\n  }));\n  const removedNodesList = removedNodeIds.map((n) => ({\n    id: n,\n    label: (GOld.getNodeAttribute(n, \"label\") as string) ?? n,\n  }));\n\n  function edgeKey(u: string, v: string, relation: string): string {\n    return `${[u, v].sort().join(\",\")}:${relation}`;\n  }\n\n  const oldEdgeKeys = new Set<string>();\n  GOld.forEachEdge((edge, data, u, v) => {\n    oldEdgeKeys.add(edgeKey(u, v, (data.relation as string) ?? \"\"));\n  });\n  const newEdgeKeys = new Set<string>();\n  GNew.forEachEdge((edge, data, u, v) => {\n    newEdgeKeys.add(edgeKey(u, v, (data.relation as string) ?? \"\"));\n  });\n\n  const addedEdgeKeys = new Set([...newEdgeKeys].filter((k) => !oldEdgeKeys.has(k)));\n  const removedEdgeKeys = new Set([...oldEdgeKeys].filter((k) => !newEdgeKeys.has(k)));\n\n  const newEdgesList: GraphDiffResult[\"new_edges\"] = [];\n  GNew.forEachEdge((edge, data, u, v) => {\n    if (addedEdgeKeys.has(edgeKey(u, v, (data.relation as string) ?? \"\"))) {\n      newEdgesList.push({\n        source: u, target: v,\n        relation: (data.relation as string) ?? \"\",\n        confidence: (data.confidence as string) ?? \"\",\n      });\n    }\n  });\n\n  const removedEdgesList: GraphDiffResult[\"removed_edges\"] = [];\n  GOld.forEachEdge((edge, data, u, v) => {\n    if (removedEdgeKeys.has(edgeKey(u, v, (data.relation as string) ?? \"\"))) {\n      removedEdgesList.push({\n        source: u, target: v,\n        relation: (data.relation as string) ?? \"\",\n        confidence: (data.confidence as string) ?? \"\",\n      });\n    }\n  });\n\n  const parts: string[] = [];\n  if (newNodesList.length > 0) parts.push(`${newNodesList.length} new node${newNodesList.length !== 1 ? \"s\" : \"\"}`);\n  if (newEdgesList.length > 0) parts.push(`${newEdgesList.length} new edge${newEdgesList.length !== 1 ? \"s\" : \"\"}`);\n  if (removedNodesList.length > 0) parts.push(`${removedNodesList.length} node${removedNodesList.length !== 1 ? \"s\" : \"\"} removed`);\n  if (removedEdgesList.length > 0) parts.push(`${removedEdgesList.length} edge${removedEdgesList.length !== 1 ? \"s\" : \"\"} removed`);\n\n  return {\n    new_nodes: newNodesList,\n    removed_nodes: removedNodesList,\n    new_edges: newEdgesList,\n    removed_edges: removedEdgesList,\n    summary: parts.length > 0 ? parts.join(\", \") : \"no changes\",\n  };\n}\n","/**\n * Generate GRAPH_REPORT.md - the human-readable audit trail.\n */\nimport Graph from \"graphology\";\nimport type { GodNodeEntry, SurpriseEntry, SuggestedQuestion, DetectionResult } from \"./types.js\";\nimport { type NumericMapLike, toNumericMap } from \"./collections.js\";\nimport { isFileNode, isConceptNode } from \"./analyze.js\";\n\nexport function generate(\n  G: Graph,\n  communities: NumericMapLike<string[]>,\n  cohesionScores: NumericMapLike<number>,\n  communityLabels: NumericMapLike<string>,\n  godNodeList: GodNodeEntry[],\n  surpriseList: SurpriseEntry[],\n  detectionResult: DetectionResult,\n  tokenCost: { input: number; output: number },\n  root: string,\n  suggestedQuestions?:\n    | SuggestedQuestion[]\n    | { suggestedQuestions?: SuggestedQuestion[] | null }\n    | null,\n): string {\n  const communityMap = toNumericMap(communities);\n  const cohesionMap = toNumericMap(cohesionScores);\n  const labelMap = toNumericMap(communityLabels);\n  const suggestedQuestionList = Array.isArray(suggestedQuestions)\n    ? suggestedQuestions\n    : (suggestedQuestions?.suggestedQuestions ?? null);\n  const today = new Date().toISOString().slice(0, 10);\n\n  const confidences: string[] = [];\n  G.forEachEdge((_, data) => {\n    confidences.push((data.confidence as string) ?? \"EXTRACTED\");\n  });\n  const total = confidences.length || 1;\n  const extPct = Math.round((confidences.filter((c) => c === \"EXTRACTED\").length / total) * 100);\n  const infPct = Math.round((confidences.filter((c) => c === \"INFERRED\").length / total) * 100);\n  const ambPct = Math.round((confidences.filter((c) => c === \"AMBIGUOUS\").length / total) * 100);\n\n  const infEdges: { score: number }[] = [];\n  G.forEachEdge((_, data) => {\n    if (data.confidence === \"INFERRED\") {\n      infEdges.push({ score: (data.confidence_score as number) ?? 0.5 });\n    }\n  });\n  const infAvg = infEdges.length > 0\n    ? Math.round((infEdges.reduce((s, e) => s + e.score, 0) / infEdges.length) * 100) / 100\n    : null;\n\n  const lines: string[] = [\n    `# Graph Report - ${root}  (${today})`,\n    \"\",\n    \"## Corpus Check\",\n  ];\n\n  if (detectionResult.warning) {\n    lines.push(`- ${detectionResult.warning}`);\n  } else {\n    lines.push(\n      `- ${detectionResult.total_files} files · ~${detectionResult.total_words.toLocaleString()} words`,\n      \"- Verdict: corpus is large enough that graph structure adds value.\",\n    );\n  }\n\n  lines.push(\n    \"\",\n    \"## Summary\",\n    `- ${G.order} nodes · ${G.size} edges · ${communityMap.size} communities detected`,\n    `- Extraction: ${extPct}% EXTRACTED · ${infPct}% INFERRED · ${ambPct}% AMBIGUOUS` +\n      (infAvg !== null ? ` · INFERRED: ${infEdges.length} edges (avg confidence: ${infAvg})` : \"\"),\n    `- Token cost: ${tokenCost.input.toLocaleString()} input · ${tokenCost.output.toLocaleString()} output`,\n    \"\",\n    \"## God Nodes (most connected - your core abstractions)\",\n  );\n\n  godNodeList.forEach((node, i) => {\n    lines.push(`${i + 1}. \\`${node.label}\\` - ${node.edges} edges`);\n  });\n\n  lines.push(\"\", \"## Surprising Connections (you probably didn't know these)\");\n  if (surpriseList.length > 0) {\n    for (const s of surpriseList) {\n      const relation = s.relation ?? \"related_to\";\n      const note = s.note ?? \"\";\n      const files = s.source_files ?? [\"\", \"\"];\n      const conf = s.confidence ?? \"EXTRACTED\";\n      const cscore = s.confidence_score;\n      const confTag = conf === \"INFERRED\" && cscore != null ? `INFERRED ${cscore.toFixed(2)}` : conf;\n      const semTag = relation === \"semantically_similar_to\" ? \" [semantically similar]\" : \"\";\n      lines.push(\n        `- \\`${s.source}\\` --${relation}--> \\`${s.target}\\`  [${confTag}]${semTag}`,\n        `  ${files[0]} → ${files[1]}${note ? `  _${note}_` : \"\"}`,\n      );\n    }\n  } else {\n    lines.push(\"- None detected - all connections are within the same source files.\");\n  }\n\n  const hyperedges = (G.getAttribute(\"hyperedges\") as Array<Record<string, unknown>>) ?? [];\n  if (hyperedges.length > 0) {\n    lines.push(\"\", \"## Hyperedges (group relationships)\");\n    for (const h of hyperedges) {\n      const nodeLabels = ((h.nodes as string[]) ?? []).join(\", \");\n      const conf = (h.confidence as string) ?? \"INFERRED\";\n      const cscore = h.confidence_score as number | undefined;\n      const confTag = cscore != null ? `${conf} ${cscore.toFixed(2)}` : conf;\n      lines.push(`- **${h.label ?? h.id ?? \"\"}** — ${nodeLabels} [${confTag}]`);\n    }\n  }\n\n  lines.push(\"\", \"## Communities\");\n  for (const [cid, nodes] of communityMap) {\n    const label = labelMap.get(cid) ?? `Community ${cid}`;\n    const score = cohesionMap.get(cid) ?? 0.0;\n    const realNodes = nodes.filter((n) => !isFileNode(G, n));\n    const display = realNodes.slice(0, 8).map((n) => (G.getNodeAttribute(n, \"label\") as string) ?? n);\n    const suffix = realNodes.length > 8 ? ` (+${realNodes.length - 8} more)` : \"\";\n    lines.push(\n      \"\",\n      `### Community ${cid} - \"${label}\"`,\n      `Cohesion: ${score}`,\n      `Nodes (${realNodes.length}): ${display.join(\", \")}${suffix}`,\n    );\n  }\n\n  const ambiguous: [string, string, Record<string, unknown>][] = [];\n  G.forEachEdge((_, data, u, v) => {\n    if (data.confidence === \"AMBIGUOUS\") ambiguous.push([u, v, data]);\n  });\n  if (ambiguous.length > 0) {\n    lines.push(\"\", \"## Ambiguous Edges - Review These\");\n    for (const [u, v, d] of ambiguous) {\n      const ul = (G.getNodeAttribute(u, \"label\") as string) ?? u;\n      const vl = (G.getNodeAttribute(v, \"label\") as string) ?? v;\n      lines.push(\n        `- \\`${ul}\\` → \\`${vl}\\`  [AMBIGUOUS]`,\n        `  ${d.source_file ?? \"\"} · relation: ${d.relation ?? \"unknown\"}`,\n      );\n    }\n  }\n\n  // Gaps section\n  const isolated = G.nodes().filter(\n    (n) => G.degree(n) <= 1 && !isFileNode(G, n) && !isConceptNode(G, n),\n  );\n  const thinCommunities = new Map<number, string[]>();\n  for (const [cid, nodes] of communityMap) {\n    if (nodes.length < 3) thinCommunities.set(cid, nodes);\n  }\n  const gapCount = isolated.length + thinCommunities.size;\n\n  if (gapCount > 0 || ambPct > 20) {\n    lines.push(\"\", \"## Knowledge Gaps\");\n    if (isolated.length > 0) {\n      const isolatedLabels = isolated.slice(0, 5).map((n) => (G.getNodeAttribute(n, \"label\") as string) ?? n);\n      const suffix = isolated.length > 5 ? ` (+${isolated.length - 5} more)` : \"\";\n      lines.push(\n        `- **${isolated.length} isolated node(s):** ${isolatedLabels.map((l) => `\\`${l}\\``).join(\", \")}${suffix}`,\n        \"  These have ≤1 connection - possible missing edges or undocumented components.\",\n      );\n    }\n    if (thinCommunities.size > 0) {\n      for (const [cid, nodes] of thinCommunities) {\n        const label = labelMap.get(cid) ?? `Community ${cid}`;\n        const nodeLabels = nodes.map((n) => (G.getNodeAttribute(n, \"label\") as string) ?? n);\n        lines.push(\n          `- **Thin community \\`${label}\\`** (${nodes.length} nodes): ${nodeLabels.map((l) => `\\`${l}\\``).join(\", \")}`,\n          \"  Too small to be a meaningful cluster - may be noise or needs more connections extracted.\",\n        );\n      }\n    }\n    if (ambPct > 20) {\n      lines.push(`- **High ambiguity: ${ambPct}% of edges are AMBIGUOUS.** Review the Ambiguous Edges section above.`);\n    }\n  }\n\n  if (suggestedQuestionList && suggestedQuestionList.length > 0) {\n    lines.push(\"\", \"## Suggested Questions\");\n    const noSignal = suggestedQuestionList.length === 1 && suggestedQuestionList[0]!.type === \"no_signal\";\n    if (noSignal) {\n      lines.push(`_${suggestedQuestionList[0]!.why}_`);\n    } else {\n      lines.push(\"_Questions this graph is uniquely positioned to answer:_\", \"\");\n      for (const q of suggestedQuestionList) {\n        if (q.question) {\n          lines.push(`- **${q.question}**`, `  _${q.why}_`);\n        }\n      }\n    }\n  }\n\n  return lines.join(\"\\n\");\n}\n","/**\n * Security helpers - URL validation, safe fetch, path guards, label sanitization.\n */\nimport { resolve as pathResolve } from \"node:path\";\nimport { existsSync } from \"node:fs\";\nimport { URL } from \"node:url\";\nimport * as dns from \"node:dns/promises\";\nimport * as net from \"node:net\";\n\nconst ALLOWED_SCHEMES = new Set([\"http:\", \"https:\"]);\nconst MAX_FETCH_BYTES = 52_428_800; // 50 MB\nconst MAX_TEXT_BYTES = 10_485_760; // 10 MB\nconst BLOCKED_HOSTS = new Set([\"metadata.google.internal\", \"metadata.google.com\"]);\n\n// ---------------------------------------------------------------------------\n// URL validation\n// ---------------------------------------------------------------------------\n\n/**\n * Raise if url is not http/https, or targets a private/internal IP.\n * Blocks file://, ftp://, data:, and any other SSRF-prone scheme.\n */\nexport async function validateUrl(url: string): Promise<string> {\n  let parsed: URL;\n  try {\n    parsed = new URL(url);\n  } catch {\n    throw new Error(`Invalid URL: ${url}`);\n  }\n\n  if (!ALLOWED_SCHEMES.has(parsed.protocol)) {\n    throw new Error(\n      `Blocked URL scheme '${parsed.protocol}' - only http and https are allowed. Got: ${url}`,\n    );\n  }\n\n  const hostname = parsed.hostname;\n  if (hostname) {\n    if (BLOCKED_HOSTS.has(hostname.toLowerCase())) {\n      throw new Error(`Blocked cloud metadata endpoint '${hostname}'. Got: ${url}`);\n    }\n\n    // Resolve hostname and block private/reserved IP ranges\n    try {\n      const addrs = await dns.resolve4(hostname).catch(() => [] as string[]);\n      const addrs6 = await dns.resolve6(hostname).catch(() => [] as string[]);\n      for (const addr of [...addrs, ...addrs6]) {\n        if (isPrivateIp(addr)) {\n          throw new Error(\n            `Blocked private/internal IP ${addr} (resolved from '${hostname}'). Got: ${url}`,\n          );\n        }\n      }\n    } catch (e) {\n      if (e instanceof Error && e.message.startsWith(\"Blocked\")) throw e;\n      // DNS failure will surface later during fetch\n    }\n  }\n\n  return url;\n}\n\n/** Synchronous URL validation (scheme + hostname only, no DNS). */\nexport function validateUrlSync(url: string): string {\n  let parsed: URL;\n  try {\n    parsed = new URL(url);\n  } catch {\n    throw new Error(`Invalid URL: ${url}`);\n  }\n\n  if (!ALLOWED_SCHEMES.has(parsed.protocol)) {\n    throw new Error(\n      `Blocked URL scheme '${parsed.protocol}' - only http and https are allowed. Got: ${url}`,\n    );\n  }\n\n  if (parsed.hostname && BLOCKED_HOSTS.has(parsed.hostname.toLowerCase())) {\n    throw new Error(`Blocked cloud metadata endpoint '${parsed.hostname}'. Got: ${url}`);\n  }\n\n  return url;\n}\n\nfunction isPrivateIp(addr: string): boolean {\n  if (net.isIPv4(addr)) {\n    const parts = addr.split(\".\").map(Number);\n    const [a, b] = parts as [number, number, ...number[]];\n    // 127.x.x.x, 10.x.x.x, 172.16-31.x.x, 192.168.x.x, 169.254.x.x, 0.x.x.x\n    if (a === 127) return true;\n    if (a === 10) return true;\n    if (a === 172 && b !== undefined && b >= 16 && b <= 31) return true;\n    if (a === 192 && b === 168) return true;\n    if (a === 169 && b === 254) return true;\n    if (a === 0) return true;\n    return false;\n  }\n  if (net.isIPv6(addr)) {\n    const lower = addr.toLowerCase();\n    if (lower === \"::1\" || lower.startsWith(\"fe80:\") || lower.startsWith(\"fc\") || lower.startsWith(\"fd\")) {\n      return true;\n    }\n  }\n  return false;\n}\n\n// ---------------------------------------------------------------------------\n// Safe fetch\n// ---------------------------------------------------------------------------\n\n/**\n * Fetch url and return raw bytes (Buffer).\n * Validates URL, caps response body, follows redirects with re-validation.\n */\nexport async function safeFetch(\n  url: string,\n  maxBytes: number = MAX_FETCH_BYTES,\n  timeout: number = 30_000,\n): Promise<Buffer> {\n  await validateUrl(url);\n\n  const controller = new AbortController();\n  const timer = setTimeout(() => controller.abort(), timeout);\n\n  try {\n    const resp = await fetch(url, {\n      signal: controller.signal,\n      headers: { \"User-Agent\": \"Mozilla/5.0 graphify/1.0\" },\n      redirect: \"follow\",\n    });\n\n    if (!resp.ok) {\n      throw new Error(`HTTP ${resp.status} fetching ${url}`);\n    }\n\n    // Validate final URL after redirects\n    if (resp.url !== url) {\n      await validateUrl(resp.url);\n    }\n\n    const reader = resp.body?.getReader();\n    if (!reader) throw new Error(\"No response body\");\n\n    const chunks: Uint8Array[] = [];\n    let total = 0;\n\n    while (true) {\n      const { done, value } = await reader.read();\n      if (done) break;\n      total += value.length;\n      if (total > maxBytes) {\n        reader.cancel();\n        throw new Error(\n          `Response from ${url} exceeds size limit (${Math.floor(maxBytes / 1_048_576)} MB). Aborting download.`,\n        );\n      }\n      chunks.push(value);\n    }\n\n    return Buffer.concat(chunks);\n  } finally {\n    clearTimeout(timer);\n  }\n}\n\n/** Fetch url and return decoded text (UTF-8). */\nexport async function safeFetchText(\n  url: string,\n  maxBytes: number = MAX_TEXT_BYTES,\n  timeout: number = 15_000,\n): Promise<string> {\n  const raw = await safeFetch(url, maxBytes, timeout);\n  return raw.toString(\"utf-8\");\n}\n\n// ---------------------------------------------------------------------------\n// Path validation\n// ---------------------------------------------------------------------------\n\n/**\n * Resolve path and verify it stays inside base (defaults to graphify-out/).\n * Requires the base directory to exist.\n */\nexport function validateGraphPath(filePath: string, base?: string): string {\n  const resolvedBase = pathResolve(base ?? \"graphify-out\");\n\n  if (!existsSync(resolvedBase)) {\n    throw new Error(\n      `Graph base directory does not exist: ${resolvedBase}. Run the graphify skill first to build the graph (for Codex: $graphify .).`,\n    );\n  }\n\n  const resolved = pathResolve(filePath);\n\n  if (!resolved.startsWith(resolvedBase + \"/\") && resolved !== resolvedBase) {\n    throw new Error(\n      `Path '${filePath}' escapes the allowed directory ${resolvedBase}. Only paths inside graphify-out/ are permitted.`,\n    );\n  }\n\n  if (!existsSync(resolved)) {\n    throw new Error(`Graph file not found: ${resolved}`);\n  }\n\n  return resolved;\n}\n\n// ---------------------------------------------------------------------------\n// Label sanitization\n// ---------------------------------------------------------------------------\n\nconst CONTROL_CHAR_RE = /[\\x00-\\x1f\\x7f]/g;\nconst MAX_LABEL_LEN = 256;\n\n/** Strip control characters and cap length. Safe for JSON embedding. */\nexport function sanitizeLabel(text: string): string {\n  let cleaned = text.replace(CONTROL_CHAR_RE, \"\");\n  if (cleaned.length > MAX_LABEL_LEN) {\n    cleaned = cleaned.slice(0, MAX_LABEL_LEN);\n  }\n  return cleaned;\n}\n\n/** Escape text for safe HTML embedding. */\nexport function escapeHtml(text: string): string {\n  return text\n    .replace(/&/g, \"&amp;\")\n    .replace(/</g, \"&lt;\")\n    .replace(/>/g, \"&gt;\")\n    .replace(/\"/g, \"&quot;\")\n    .replace(/'/g, \"&#39;\");\n}\n","/**\n * Export graph to HTML, JSON, SVG, GraphML, Obsidian Canvas, and Neo4j Cypher.\n */\nimport { writeFileSync } from \"node:fs\";\nimport Graph from \"graphology\";\nimport { sanitizeLabel, escapeHtml } from \"./security.js\";\nimport { isDirectedGraph } from \"./graph.js\";\nimport type { Hyperedge } from \"./types.js\";\nimport {\n  type NumericMapLike,\n  type StringMapLike,\n  toNumericMap,\n  toStringMap,\n} from \"./collections.js\";\n\n// ---------------------------------------------------------------------------\n// Constants\n// ---------------------------------------------------------------------------\n\nconst COMMUNITY_COLORS = [\n  \"#4E79A7\", \"#F28E2B\", \"#E15759\", \"#76B7B2\", \"#59A14F\",\n  \"#EDC948\", \"#B07AA1\", \"#FF9DA7\", \"#9C755F\", \"#BAB0AC\",\n];\n\nconst MAX_NODES_FOR_VIZ = 5_000;\n\nconst CONFIDENCE_SCORE_DEFAULTS: Record<string, number> = {\n  EXTRACTED: 1.0,\n  INFERRED: 0.5,\n  AMBIGUOUS: 0.2,\n};\n\n// ---------------------------------------------------------------------------\n// Helpers\n// ---------------------------------------------------------------------------\n\ntype CommunityLabelsInput = NumericMapLike<string>;\ntype CommunityLabelOptions = { communityLabels?: CommunityLabelsInput };\ntype JsonOptions = CommunityLabelOptions;\ntype SvgOptions = CommunityLabelOptions & { figsize?: [number, number] };\ntype CanvasOptions = CommunityLabelOptions & { nodeFilenames?: StringMapLike<string> };\ntype Neo4jPushOptions = {\n  uri: string;\n  user: string;\n  password: string;\n  communities?: NumericMapLike<string[]>;\n};\n\nfunction nodeCommunityMap(communities: NumericMapLike<string[]>): Map<string, number> {\n  const communityMap = toNumericMap(communities);\n  const result = new Map<string, number>();\n  for (const [cid, nodes] of communityMap) {\n    for (const n of nodes) result.set(n, cid);\n  }\n  return result;\n}\n\nfunction cypherEscape(s: string): string {\n  return s.replace(/\\\\/g, \"\\\\\\\\\").replace(/'/g, \"\\\\'\");\n}\n\nfunction isCommunityLabelOptions(\n  value: CommunityLabelsInput | CommunityLabelOptions,\n): value is CommunityLabelOptions {\n  return !(value instanceof Map) && Object.prototype.hasOwnProperty.call(value, \"communityLabels\");\n}\n\nfunction isCanvasOptions(\n  value: CommunityLabelsInput | CanvasOptions,\n): value is CanvasOptions {\n  return !(value instanceof Map) && (\n    Object.prototype.hasOwnProperty.call(value, \"communityLabels\") ||\n    Object.prototype.hasOwnProperty.call(value, \"nodeFilenames\")\n  );\n}\n\nfunction isSvgOptions(\n  value: CommunityLabelsInput | SvgOptions,\n): value is SvgOptions {\n  return !(value instanceof Map) && (\n    Object.prototype.hasOwnProperty.call(value, \"communityLabels\") ||\n    Object.prototype.hasOwnProperty.call(value, \"figsize\")\n  );\n}\n\nfunction normalizeCommunityLabels(\n  labelsOrOptions?: CommunityLabelsInput | CommunityLabelOptions,\n): Map<number, string> | undefined {\n  if (!labelsOrOptions) return undefined;\n  if (!isCommunityLabelOptions(labelsOrOptions)) {\n    return toNumericMap(labelsOrOptions as CommunityLabelsInput);\n  }\n  return toNumericMap(labelsOrOptions.communityLabels);\n}\n\n// ---------------------------------------------------------------------------\n// toJson\n// ---------------------------------------------------------------------------\n\nexport function toJson(\n  G: Graph,\n  communities: NumericMapLike<string[]>,\n  outputPath: string,\n  communityLabelsOrOptions?: CommunityLabelsInput | JsonOptions,\n): void {\n  const nodeComm = nodeCommunityMap(communities);\n  const communityLabels = normalizeCommunityLabels(communityLabelsOrOptions);\n\n  const nodes: Record<string, unknown>[] = [];\n  G.forEachNode((nodeId, attrs) => {\n    const communityId = nodeComm.get(nodeId) ?? null;\n    nodes.push({\n      id: nodeId,\n      ...attrs,\n      community: communityId,\n      community_name:\n        communityId !== null\n          ? sanitizeLabel(communityLabels?.get(communityId) ?? `Community ${communityId}`)\n          : null,\n    });\n  });\n\n  const links: Record<string, unknown>[] = [];\n  G.forEachEdge((_edge, data, source, target) => {\n    const link: Record<string, unknown> = {\n      source,\n      target,\n      ...data,\n    };\n    if (link.confidence_score === undefined) {\n      const conf = (data.confidence as string) ?? \"EXTRACTED\";\n      link.confidence_score = CONFIDENCE_SCORE_DEFAULTS[conf] ?? 1.0;\n    }\n    links.push(link);\n  });\n\n  const hyperedges = (G.getAttribute(\"hyperedges\") as Hyperedge[] | undefined) ?? [];\n  const communityLabelsObject = communityLabels\n    ? Object.fromEntries(\n        [...communityLabels.entries()]\n          .sort((a, b) => a[0] - b[0])\n          .map(([cid, label]) => [String(cid), sanitizeLabel(label)]),\n      )\n    : {};\n\n  const output = {\n    directed: isDirectedGraph(G),\n    multigraph: false,\n    graph: {\n      community_labels: communityLabelsObject,\n    },\n    nodes,\n    links,\n    hyperedges,\n  };\n\n  writeFileSync(outputPath, JSON.stringify(output, null, 2), \"utf-8\");\n}\n\n// ---------------------------------------------------------------------------\n// toCypher\n// ---------------------------------------------------------------------------\n\nexport function toCypher(G: Graph, outputPath: string): void {\n  const lines: string[] = [\"// Neo4j Cypher import - generated by the graphify skill\", \"\"];\n\n  G.forEachNode((nodeId, data) => {\n    const label = cypherEscape((data.label as string) ?? nodeId);\n    const nodeIdEsc = cypherEscape(nodeId);\n    const rawFt = ((data.file_type as string) ?? \"unknown\")\n      .charAt(0).toUpperCase() + ((data.file_type as string) ?? \"unknown\").slice(1);\n    const cleaned = rawFt.replace(/[^A-Za-z0-9_]/g, \"\");\n    const ftype = cleaned && /^[A-Za-z]/.test(cleaned) ? cleaned : \"Entity\";\n    lines.push(`MERGE (n:${ftype} {id: '${nodeIdEsc}', label: '${label}'});`);\n  });\n\n  lines.push(\"\");\n\n  G.forEachEdge((_edge, data, u, v) => {\n    const rel = ((data.relation as string) ?? \"RELATES_TO\")\n      .toUpperCase()\n      .replace(/[^A-Za-z0-9_]/g, \"_\");\n    const conf = cypherEscape((data.confidence as string) ?? \"EXTRACTED\");\n    const uEsc = cypherEscape(u);\n    const vEsc = cypherEscape(v);\n    lines.push(\n      `MATCH (a {id: '${uEsc}'}), (b {id: '${vEsc}'}) ` +\n      `MERGE (a)-[:${rel} {confidence: '${conf}'}]->(b);`,\n    );\n  });\n\n  writeFileSync(outputPath, lines.join(\"\\n\"), \"utf-8\");\n}\n\nfunction neo4jLabel(label: string): string {\n  const sanitized = label.replace(/[^A-Za-z0-9_]/g, \"\");\n  return sanitized || \"Entity\";\n}\n\nfunction neo4jRelation(relation: string): string {\n  const sanitized = relation\n    .toUpperCase()\n    .replace(/[\\s-]+/g, \"_\")\n    .replace(/[^A-Z0-9_]/g, \"_\");\n  return sanitized || \"RELATED_TO\";\n}\n\nfunction scalarProps(data: Record<string, unknown>): Record<string, string | number | boolean> {\n  const props: Record<string, string | number | boolean> = {};\n  for (const [key, value] of Object.entries(data)) {\n    if (\n      typeof value === \"string\" ||\n      typeof value === \"number\" ||\n      typeof value === \"boolean\"\n    ) {\n      props[key] = value;\n    }\n  }\n  return props;\n}\n\nexport async function pushToNeo4j(\n  G: Graph,\n  optionsOrUri: Neo4jPushOptions | string,\n  user?: string,\n  password?: string,\n  communities?: NumericMapLike<string[]>,\n): Promise<{ nodes: number; edges: number }> {\n  const options = typeof optionsOrUri === \"string\"\n    ? {\n      uri: optionsOrUri,\n      user: user ?? \"neo4j\",\n      password: password ?? \"\",\n      communities,\n    }\n    : optionsOrUri;\n\n  let neo4jMod: Record<string, any>;\n  try {\n    neo4jMod = await import(\"neo4j-driver\");\n  } catch {\n    throw new Error(\"neo4j-driver not installed. Run: npm install neo4j-driver\");\n  }\n\n  const neo4j = neo4jMod.default ?? neo4jMod;\n  const driver = neo4j.driver(\n    options.uri,\n    neo4j.auth.basic(options.user, options.password),\n  );\n  const communityMap = nodeCommunityMap(options.communities ?? new Map<number, string[]>());\n\n  let nodes = 0;\n  let edges = 0;\n  const session = driver.session();\n\n  try {\n    for (const nodeId of G.nodes()) {\n      const attrs = G.getNodeAttributes(nodeId) as Record<string, unknown>;\n      const props = scalarProps(attrs);\n      props.id = nodeId;\n\n      const communityId = communityMap.get(nodeId);\n      if (communityId !== undefined) {\n        props.community = communityId;\n      }\n\n      const fileType = neo4jLabel(\n        (((attrs.file_type as string) ?? \"Entity\").charAt(0).toUpperCase()) +\n        (((attrs.file_type as string) ?? \"Entity\").slice(1)),\n      );\n\n      await session.run(\n        `MERGE (n:${fileType} {id: $id}) SET n += $props`,\n        { id: nodeId, props },\n      );\n      nodes++;\n    }\n\n    for (const edgeKey of G.edges()) {\n      const source = G.source(edgeKey);\n      const target = G.target(edgeKey);\n      const attrs = G.getEdgeAttributes(edgeKey) as Record<string, unknown>;\n      const relation = neo4jRelation((attrs.relation as string) ?? \"RELATED_TO\");\n      const props = scalarProps(attrs);\n\n      await session.run(\n        `MATCH (a {id: $source}), (b {id: $target}) ` +\n        `MERGE (a)-[r:${relation}]->(b) SET r += $props`,\n        { source, target, props },\n      );\n      edges++;\n    }\n  } finally {\n    await session.close();\n    await driver.close();\n  }\n\n  return { nodes, edges };\n}\n\n// ---------------------------------------------------------------------------\n// toHtml - full interactive vis.js visualization\n// ---------------------------------------------------------------------------\n\nfunction htmlStyles(): string {\n  return `<style>\n  * { box-sizing: border-box; margin: 0; padding: 0; }\n  body { background: #0f0f1a; color: #e0e0e0; font-family: -apple-system, BlinkMacSystemFont, \"Segoe UI\", sans-serif; display: flex; height: 100vh; overflow: hidden; }\n  #graph { flex: 1; }\n  #sidebar { width: 280px; background: #1a1a2e; border-left: 1px solid #2a2a4e; display: flex; flex-direction: column; overflow: hidden; }\n  #search-wrap { padding: 12px; border-bottom: 1px solid #2a2a4e; }\n  #search { width: 100%; background: #0f0f1a; border: 1px solid #3a3a5e; color: #e0e0e0; padding: 7px 10px; border-radius: 6px; font-size: 13px; outline: none; }\n  #search:focus { border-color: #4E79A7; }\n  #search-results { max-height: 140px; overflow-y: auto; padding: 4px 12px; border-bottom: 1px solid #2a2a4e; display: none; }\n  .search-item { padding: 4px 6px; cursor: pointer; border-radius: 4px; font-size: 12px; white-space: nowrap; overflow: hidden; text-overflow: ellipsis; }\n  .search-item:hover { background: #2a2a4e; }\n  #info-panel { padding: 14px; border-bottom: 1px solid #2a2a4e; min-height: 140px; }\n  #info-panel h3 { font-size: 13px; color: #aaa; margin-bottom: 8px; text-transform: uppercase; letter-spacing: 0.05em; }\n  #info-content { font-size: 13px; color: #ccc; line-height: 1.6; }\n  #info-content .field { margin-bottom: 5px; }\n  #info-content .field b { color: #e0e0e0; }\n  #info-content .empty { color: #555; font-style: italic; }\n  .neighbor-link { display: block; padding: 2px 6px; margin: 2px 0; border-radius: 3px; cursor: pointer; font-size: 12px; white-space: nowrap; overflow: hidden; text-overflow: ellipsis; border-left: 3px solid #333; }\n  .neighbor-link:hover { background: #2a2a4e; }\n  #neighbors-list { max-height: 160px; overflow-y: auto; margin-top: 4px; }\n  #legend-wrap { flex: 1; overflow-y: auto; padding: 12px; }\n  #legend-wrap h3 { font-size: 13px; color: #aaa; margin-bottom: 10px; text-transform: uppercase; letter-spacing: 0.05em; }\n  .legend-item { display: flex; align-items: center; gap: 8px; padding: 4px 0; cursor: pointer; border-radius: 4px; font-size: 12px; }\n  .legend-item:hover { background: #2a2a4e; padding-left: 4px; }\n  .legend-item.dimmed { opacity: 0.35; }\n  .legend-dot { width: 12px; height: 12px; border-radius: 50%; flex-shrink: 0; }\n  .legend-label { flex: 1; overflow: hidden; text-overflow: ellipsis; white-space: nowrap; }\n  .legend-count { color: #666; font-size: 11px; }\n  #stats { padding: 10px 14px; border-top: 1px solid #2a2a4e; font-size: 11px; color: #555; }\n</style>`;\n}\n\nfunction hyperedgeScript(hyperedgesJson: string): string {\n  return `<script>\n// Render hyperedges as shaded regions\nconst hyperedges = ${hyperedgesJson};\nfunction drawHyperedges() {\n    const canvas = network.canvas.frame.canvas;\n    const ctx = canvas.getContext('2d');\n    hyperedges.forEach(h => {\n        const positions = h.nodes\n            .map(nid => network.getPositions([nid])[nid])\n            .filter(p => p !== undefined);\n        if (positions.length < 2) return;\n        // Draw convex hull as filled polygon\n        ctx.save();\n        ctx.globalAlpha = 0.12;\n        ctx.fillStyle = '#6366f1';\n        ctx.strokeStyle = '#6366f1';\n        ctx.lineWidth = 2;\n        ctx.beginPath();\n        const scale = network.getScale();\n        const offset = network.getViewPosition();\n        const toCanvas = (p) => ({\n            x: (p.x - offset.x) * scale + canvas.width / 2,\n            y: (p.y - offset.y) * scale + canvas.height / 2\n        });\n        const pts = positions.map(toCanvas);\n        // Expand hull slightly\n        const cx = pts.reduce((s, p) => s + p.x, 0) / pts.length;\n        const cy = pts.reduce((s, p) => s + p.y, 0) / pts.length;\n        const expanded = pts.map(p => ({\n            x: cx + (p.x - cx) * 1.15,\n            y: cy + (p.y - cy) * 1.15\n        }));\n        ctx.moveTo(expanded[0].x, expanded[0].y);\n        expanded.slice(1).forEach(p => ctx.lineTo(p.x, p.y));\n        ctx.closePath();\n        ctx.fill();\n        ctx.globalAlpha = 0.4;\n        ctx.stroke();\n        // Label\n        ctx.globalAlpha = 0.8;\n        ctx.fillStyle = '#4f46e5';\n        ctx.font = 'bold 11px sans-serif';\n        ctx.textAlign = 'center';\n        ctx.fillText(h.label, cx, cy - 5);\n        ctx.restore();\n    });\n}\nnetwork.on('afterDrawing', drawHyperedges);\n</script>`;\n}\n\nfunction htmlScript(nodesJson: string, edgesJson: string, legendJson: string): string {\n  return `<script>\nconst RAW_NODES = ${nodesJson};\nconst RAW_EDGES = ${edgesJson};\nconst LEGEND = ${legendJson};\n\n// Build vis datasets\nconst nodesDS = new vis.DataSet(RAW_NODES.map(n => ({\n  id: n.id, label: n.label, color: n.color, size: n.size,\n  font: n.font, title: n.title,\n  _community: n.community, _community_name: n.community_name,\n  _source_file: n.source_file, _file_type: n.file_type, _degree: n.degree,\n})));\n\nconst edgesDS = new vis.DataSet(RAW_EDGES.map((e, i) => ({\n  id: i, from: e.from, to: e.to,\n  label: '',\n  title: e.title,\n  dashes: e.dashes,\n  width: e.width,\n  color: e.color,\n  arrows: { to: { enabled: true, scaleFactor: 0.5 } },\n})));\n\nconst container = document.getElementById('graph');\nconst network = new vis.Network(container, { nodes: nodesDS, edges: edgesDS }, {\n  physics: {\n    enabled: true,\n    solver: 'forceAtlas2Based',\n    forceAtlas2Based: {\n      gravitationalConstant: -60,\n      centralGravity: 0.005,\n      springLength: 120,\n      springConstant: 0.08,\n      damping: 0.4,\n      avoidOverlap: 0.8,\n    },\n    stabilization: { iterations: 200, fit: true },\n  },\n  interaction: {\n    hover: true,\n    tooltipDelay: 100,\n    hideEdgesOnDrag: true,\n    navigationButtons: false,\n    keyboard: false,\n  },\n  nodes: { shape: 'dot', borderWidth: 1.5 },\n  edges: { smooth: { type: 'continuous', roundness: 0.2 }, selectionWidth: 3 },\n});\n\nnetwork.once('stabilizationIterationsDone', () => {\n  network.setOptions({ physics: { enabled: false } });\n});\n\nfunction showInfo(nodeId) {\n  const n = nodesDS.get(nodeId);\n  if (!n) return;\n  const neighborIds = network.getConnectedNodes(nodeId);\n  const neighborItems = neighborIds.map(nid => {\n    const nb = nodesDS.get(nid);\n    const color = nb ? nb.color.background : '#555';\n    return \\`<span class=\"neighbor-link\" style=\"border-left-color:\\${color}\" onclick=\"focusNode('\\${nid}')\">\\${nb ? nb.label : nid}</span>\\`;\n  }).join('');\n  document.getElementById('info-content').innerHTML = \\`\n    <div class=\"field\"><b>\\${n.label}</b></div>\n    <div class=\"field\">Type: \\${n._file_type || 'unknown'}</div>\n    <div class=\"field\">Community: \\${n._community_name}</div>\n    <div class=\"field\">Source: \\${n._source_file || '-'}</div>\n    <div class=\"field\">Degree: \\${n._degree}</div>\n    \\${neighborIds.length ? \\`<div class=\"field\" style=\"margin-top:8px;color:#aaa;font-size:11px\">Neighbors (\\${neighborIds.length})</div><div id=\"neighbors-list\">\\${neighborItems}</div>\\` : ''}\n  \\`;\n}\n\nfunction focusNode(nodeId) {\n  network.focus(nodeId, { scale: 1.4, animation: true });\n  network.selectNodes([nodeId]);\n  showInfo(nodeId);\n}\n\nlet hoveredNodeId = null;\nnetwork.on('hoverNode', params => {\n  hoveredNodeId = params.node;\n  container.style.cursor = 'pointer';\n});\nnetwork.on('blurNode', () => {\n  hoveredNodeId = null;\n  container.style.cursor = 'default';\n});\ncontainer.addEventListener('click', () => {\n  if (hoveredNodeId !== null) {\n    showInfo(hoveredNodeId);\n    network.selectNodes([hoveredNodeId]);\n  }\n});\nnetwork.on('click', params => {\n  if (params.nodes.length > 0) showInfo(params.nodes[0]);\n  else if (hoveredNodeId === null) document.getElementById('info-content').innerHTML = '<span class=\"empty\">Click a node to inspect it</span>';\n});\n\nconst searchInput = document.getElementById('search');\nconst searchResults = document.getElementById('search-results');\nsearchInput.addEventListener('input', () => {\n  const q = searchInput.value.toLowerCase().trim();\n  searchResults.innerHTML = '';\n  if (!q) { searchResults.style.display = 'none'; return; }\n  const matches = RAW_NODES.filter(n => n.label.toLowerCase().includes(q)).slice(0, 20);\n  if (!matches.length) { searchResults.style.display = 'none'; return; }\n  searchResults.style.display = 'block';\n  matches.forEach(n => {\n    const el = document.createElement('div');\n    el.className = 'search-item';\n    el.textContent = n.label;\n    el.style.borderLeft = \\`3px solid \\${n.color.background}\\`;\n    el.style.paddingLeft = '8px';\n    el.onclick = () => {\n      network.focus(n.id, { scale: 1.5, animation: true });\n      network.selectNodes([n.id]);\n      showInfo(n.id);\n      searchResults.style.display = 'none';\n      searchInput.value = '';\n    };\n    searchResults.appendChild(el);\n  });\n});\ndocument.addEventListener('click', e => {\n  if (!searchResults.contains(e.target) && e.target !== searchInput)\n    searchResults.style.display = 'none';\n});\n\nconst hiddenCommunities = new Set();\nconst legendEl = document.getElementById('legend');\nLEGEND.forEach(c => {\n  const item = document.createElement('div');\n  item.className = 'legend-item';\n  item.innerHTML = \\`<div class=\"legend-dot\" style=\"background:\\${c.color}\"></div>\n    <span class=\"legend-label\">\\${c.label}</span>\n    <span class=\"legend-count\">\\${c.count}</span>\\`;\n  item.onclick = () => {\n    if (hiddenCommunities.has(c.cid)) {\n      hiddenCommunities.delete(c.cid);\n      item.classList.remove('dimmed');\n    } else {\n      hiddenCommunities.add(c.cid);\n      item.classList.add('dimmed');\n    }\n    const updates = RAW_NODES\n      .filter(n => n.community === c.cid)\n      .map(n => ({ id: n.id, hidden: hiddenCommunities.has(c.cid) }));\n    nodesDS.update(updates);\n  };\n  legendEl.appendChild(item);\n});\n</script>`;\n}\n\nexport function toHtml(\n  G: Graph,\n  communities: NumericMapLike<string[]>,\n  outputPath: string,\n  communityLabelsOrOptions?: CommunityLabelsInput | CommunityLabelOptions,\n): void {\n  const communityMap = toNumericMap(communities);\n  const communityLabels = normalizeCommunityLabels(communityLabelsOrOptions);\n  if (G.order > MAX_NODES_FOR_VIZ) {\n    throw new Error(\n      `Graph has ${G.order} nodes - too large for HTML viz. ` +\n      `Use --no-viz or reduce input size.`,\n    );\n  }\n\n  const nodeComm = nodeCommunityMap(communityMap);\n  const degree = new Map<string, number>();\n  G.forEachNode((n) => degree.set(n, G.degree(n)));\n  const maxDeg = Math.max(1, ...degree.values());\n\n  // Build nodes list for vis.js\n  interface VisNode {\n    id: string;\n    label: string;\n    color: { background: string; border: string; highlight: { background: string; border: string } };\n    size: number;\n    font: { size: number; color: string };\n    title: string;\n    community: number;\n    community_name: string;\n    source_file: string;\n    file_type: string;\n    degree: number;\n  }\n  const visNodes: VisNode[] = [];\n  G.forEachNode((nodeId, data) => {\n    const cid = nodeComm.get(nodeId) ?? 0;\n    const color = COMMUNITY_COLORS[cid % COMMUNITY_COLORS.length]!;\n    const label = sanitizeLabel((data.label as string) ?? nodeId);\n    const deg = degree.get(nodeId) ?? 1;\n    const size = 10 + 30 * (deg / maxDeg);\n    const fontSize = deg >= maxDeg * 0.15 ? 12 : 0;\n    visNodes.push({\n      id: nodeId,\n      label,\n      color: {\n        background: color,\n        border: color,\n        highlight: { background: \"#ffffff\", border: color },\n      },\n      size: Math.round(size * 10) / 10,\n      font: { size: fontSize, color: \"#ffffff\" },\n      title: label,\n      community: cid,\n      community_name: sanitizeLabel(communityLabels?.get(cid) ?? `Community ${cid}`),\n      source_file: sanitizeLabel((data.source_file as string) ?? \"\"),\n      file_type: (data.file_type as string) ?? \"\",\n      degree: deg,\n    });\n  });\n\n  // Build edges list\n  interface VisEdge {\n    from: string;\n    to: string;\n    label: string;\n    title: string;\n    dashes: boolean;\n    width: number;\n    color: { opacity: number };\n    confidence: string;\n  }\n  const visEdges: VisEdge[] = [];\n  G.forEachEdge((_edge, data, u, v) => {\n    const confidence = (data.confidence as string) ?? \"EXTRACTED\";\n    const relation = (data.relation as string) ?? \"\";\n    visEdges.push({\n      from: u,\n      to: v,\n      label: relation,\n      title: `${relation} [${confidence}]`,\n      dashes: confidence !== \"EXTRACTED\",\n      width: confidence === \"EXTRACTED\" ? 2 : 1,\n      color: { opacity: confidence === \"EXTRACTED\" ? 0.7 : 0.35 },\n      confidence,\n    });\n  });\n\n  // Build community legend data\n  interface LegendEntry {\n    cid: number;\n    color: string;\n    label: string;\n    count: number;\n  }\n  const legendData: LegendEntry[] = [];\n  const labelKeys = communityLabels ? [...communityLabels.keys()].sort((a, b) => a - b) : [];\n  for (const cid of labelKeys) {\n    const color = COMMUNITY_COLORS[cid % COMMUNITY_COLORS.length]!;\n    const lbl = escapeHtml(sanitizeLabel(communityLabels?.get(cid) ?? `Community ${cid}`));\n    const n = communityMap.get(cid)?.length ?? 0;\n    legendData.push({ cid, color, label: lbl, count: n });\n  }\n\n  const nodesJson = JSON.stringify(visNodes);\n  const edgesJson = JSON.stringify(visEdges);\n  const legendJson = JSON.stringify(legendData);\n  const rawHyperedges = (G.getAttribute(\"hyperedges\") as Hyperedge[] | undefined) ?? [];\n  const hyperedgesJson = JSON.stringify(rawHyperedges);\n  const title = escapeHtml(sanitizeLabel(outputPath));\n  const stats =\n    `${G.order} nodes &middot; ${G.size} edges &middot; ${communityMap.size} communities`;\n\n  const html = `<!DOCTYPE html>\n<html lang=\"en\">\n<head>\n<meta charset=\"UTF-8\">\n<title>graphify - ${title}</title>\n<script src=\"https://unpkg.com/vis-network/standalone/umd/vis-network.min.js\"></script>\n${htmlStyles()}\n</head>\n<body>\n<div id=\"graph\"></div>\n<div id=\"sidebar\">\n  <div id=\"search-wrap\">\n    <input id=\"search\" type=\"text\" placeholder=\"Search nodes...\" autocomplete=\"off\">\n    <div id=\"search-results\"></div>\n  </div>\n  <div id=\"info-panel\">\n    <h3>Node Info</h3>\n    <div id=\"info-content\"><span class=\"empty\">Click a node to inspect it</span></div>\n  </div>\n  <div id=\"legend-wrap\">\n    <h3>Communities</h3>\n    <div id=\"legend\"></div>\n  </div>\n  <div id=\"stats\">${stats}</div>\n</div>\n${htmlScript(nodesJson, edgesJson, legendJson)}\n${hyperedgeScript(hyperedgesJson)}\n</body>\n</html>`;\n\n  writeFileSync(outputPath, html, \"utf-8\");\n}\n\n// ---------------------------------------------------------------------------\n// toGraphml\n// ---------------------------------------------------------------------------\n\nexport function toGraphml(\n  G: Graph,\n  communities: NumericMapLike<string[]>,\n  outputPath: string,\n): void {\n  const nodeComm = nodeCommunityMap(communities);\n\n  const xmlEsc = (s: string): string =>\n    s\n      .replace(/&/g, \"&amp;\")\n      .replace(/</g, \"&lt;\")\n      .replace(/>/g, \"&gt;\")\n      .replace(/\"/g, \"&quot;\")\n      .replace(/'/g, \"&apos;\");\n\n  const lines: string[] = [];\n  lines.push('<?xml version=\"1.0\" encoding=\"UTF-8\"?>');\n  lines.push(\n    '<graphml xmlns=\"http://graphml.graphstruct.org/graphml\"' +\n    ' xmlns:xsi=\"http://www.w3.org/2001/XMLSchema-instance\"' +\n    ' xsi:schemaLocation=\"http://graphml.graphstruct.org/graphml' +\n    ' http://graphml.graphstruct.org/graphml/1.0/graphml.xsd\">',\n  );\n\n  // Declare attribute keys\n  lines.push('  <key id=\"label\" for=\"node\" attr.name=\"label\" attr.type=\"string\"/>');\n  lines.push('  <key id=\"file_type\" for=\"node\" attr.name=\"file_type\" attr.type=\"string\"/>');\n  lines.push('  <key id=\"source_file\" for=\"node\" attr.name=\"source_file\" attr.type=\"string\"/>');\n  lines.push('  <key id=\"community\" for=\"node\" attr.name=\"community\" attr.type=\"int\"/>');\n  lines.push('  <key id=\"relation\" for=\"edge\" attr.name=\"relation\" attr.type=\"string\"/>');\n  lines.push('  <key id=\"confidence\" for=\"edge\" attr.name=\"confidence\" attr.type=\"string\"/>');\n\n  lines.push(`  <graph id=\"G\" edgedefault=\"${isDirectedGraph(G) ? \"directed\" : \"undirected\"}\">`);\n\n  G.forEachNode((nodeId, data) => {\n    lines.push(`    <node id=\"${xmlEsc(nodeId)}\">`);\n    lines.push(`      <data key=\"label\">${xmlEsc((data.label as string) ?? nodeId)}</data>`);\n    lines.push(`      <data key=\"file_type\">${xmlEsc((data.file_type as string) ?? \"\")}</data>`);\n    lines.push(`      <data key=\"source_file\">${xmlEsc((data.source_file as string) ?? \"\")}</data>`);\n    lines.push(`      <data key=\"community\">${nodeComm.get(nodeId) ?? -1}</data>`);\n    lines.push(\"    </node>\");\n  });\n\n  G.forEachEdge((_edge, data, source, target) => {\n    lines.push(`    <edge source=\"${xmlEsc(source)}\" target=\"${xmlEsc(target)}\">`);\n    lines.push(`      <data key=\"relation\">${xmlEsc((data.relation as string) ?? \"\")}</data>`);\n    lines.push(`      <data key=\"confidence\">${xmlEsc((data.confidence as string) ?? \"EXTRACTED\")}</data>`);\n    lines.push(\"    </edge>\");\n  });\n\n  lines.push(\"  </graph>\");\n  lines.push(\"</graphml>\");\n\n  writeFileSync(outputPath, lines.join(\"\\n\"), \"utf-8\");\n}\n\n// ---------------------------------------------------------------------------\n// toSvg - simple circle-layout SVG\n// ---------------------------------------------------------------------------\n\nexport function toSvg(\n  G: Graph,\n  communities: NumericMapLike<string[]>,\n  outputPath: string,\n  communityLabelsOrOptions?: CommunityLabelsInput | SvgOptions,\n  figsize: [number, number] = [20, 14],\n): void {\n  const communityMap = toNumericMap(communities);\n  const options = communityLabelsOrOptions && isSvgOptions(communityLabelsOrOptions)\n    ? communityLabelsOrOptions\n    : undefined;\n  const communityLabels = normalizeCommunityLabels(communityLabelsOrOptions);\n  const nodeComm = nodeCommunityMap(communityMap);\n  const figureSize = options?.figsize ?? figsize;\n  const [widthIn, heightIn] = figureSize;\n  const width = widthIn * 60;\n  const height = heightIn * 60;\n  const cx = width / 2;\n  const cy = height / 2;\n  const radius = Math.min(cx, cy) * 0.8;\n\n  const nodeList = G.nodes();\n  const n = nodeList.length;\n\n  // Compute positions using a simple circle layout\n  const pos = new Map<string, [number, number]>();\n  for (let i = 0; i < n; i++) {\n    const angle = (2 * Math.PI * i) / Math.max(n, 1);\n    pos.set(nodeList[i]!, [\n      cx + radius * Math.cos(angle),\n      cy + radius * Math.sin(angle),\n    ]);\n  }\n\n  const degree = new Map<string, number>();\n  G.forEachNode((node) => degree.set(node, G.degree(node)));\n  const maxDeg = Math.max(1, ...degree.values());\n\n  const xmlEsc = (s: string): string =>\n    s\n      .replace(/&/g, \"&amp;\")\n      .replace(/</g, \"&lt;\")\n      .replace(/>/g, \"&gt;\")\n      .replace(/\"/g, \"&quot;\");\n\n  const svgParts: string[] = [];\n  svgParts.push(\n    `<svg xmlns=\"http://www.w3.org/2000/svg\" viewBox=\"0 0 ${width} ${height}\" ` +\n    `width=\"${width}\" height=\"${height}\" style=\"background:#1a1a2e\">`,\n  );\n\n  // Draw edges\n  G.forEachEdge((_edge, data, u, v) => {\n    const [x1, y1] = pos.get(u) ?? [0, 0];\n    const [x2, y2] = pos.get(v) ?? [0, 0];\n    const conf = (data.confidence as string) ?? \"EXTRACTED\";\n    const dasharray = conf === \"EXTRACTED\" ? \"\" : ' stroke-dasharray=\"4,4\"';\n    const opacity = conf === \"EXTRACTED\" ? 0.6 : 0.3;\n    svgParts.push(\n      `  <line x1=\"${x1}\" y1=\"${y1}\" x2=\"${x2}\" y2=\"${y2}\" ` +\n      `stroke=\"#aaaaaa\" stroke-width=\"0.8\" opacity=\"${opacity}\"${dasharray}/>`,\n    );\n  });\n\n  // Draw nodes\n  for (const nodeId of nodeList) {\n    const [x, y] = pos.get(nodeId) ?? [0, 0];\n    const cid = nodeComm.get(nodeId) ?? 0;\n    const color = COMMUNITY_COLORS[cid % COMMUNITY_COLORS.length]!;\n    const deg = degree.get(nodeId) ?? 1;\n    const r = 4 + 12 * (deg / maxDeg);\n    svgParts.push(\n      `  <circle cx=\"${x}\" cy=\"${y}\" r=\"${r}\" fill=\"${color}\" opacity=\"0.9\"/>`,\n    );\n    const label = (G.getNodeAttribute(nodeId, \"label\") as string) ?? nodeId;\n    svgParts.push(\n      `  <text x=\"${x}\" y=\"${y + r + 10}\" text-anchor=\"middle\" ` +\n      `fill=\"white\" font-size=\"7\" font-family=\"sans-serif\">${xmlEsc(label)}</text>`,\n    );\n  }\n\n  // Legend\n  if (communityLabels) {\n    const sortedKeys = [...communityLabels.keys()].sort((a, b) => a - b);\n    let ly = 20;\n    for (const cid of sortedKeys) {\n      const color = COMMUNITY_COLORS[cid % COMMUNITY_COLORS.length]!;\n      const label = communityLabels.get(cid) ?? `Community ${cid}`;\n      const count = communityMap.get(cid)?.length ?? 0;\n      svgParts.push(\n        `  <circle cx=\"20\" cy=\"${ly}\" r=\"5\" fill=\"${color}\"/>`,\n      );\n      svgParts.push(\n        `  <text x=\"30\" y=\"${ly + 4}\" fill=\"white\" font-size=\"8\" ` +\n        `font-family=\"sans-serif\">${xmlEsc(label)} (${count})</text>`,\n      );\n      ly += 18;\n    }\n  }\n\n  svgParts.push(\"</svg>\");\n  writeFileSync(outputPath, svgParts.join(\"\\n\"), \"utf-8\");\n}\n\n// ---------------------------------------------------------------------------\n// toCanvas - Obsidian .canvas JSON\n// ---------------------------------------------------------------------------\n\nexport function toCanvas(\n  G: Graph,\n  communities: NumericMapLike<string[]>,\n  outputPath: string,\n  communityLabelsOrOptions?: CommunityLabelsInput | CanvasOptions,\n  nodeFilenames?: StringMapLike<string>,\n): void {\n  const communityMap = toNumericMap(communities);\n  const options = communityLabelsOrOptions && isCanvasOptions(communityLabelsOrOptions)\n    ? communityLabelsOrOptions\n    : undefined;\n  const communityLabels = normalizeCommunityLabels(communityLabelsOrOptions);\n  const providedNodeFilenames = options?.nodeFilenames ?? nodeFilenames;\n  const CANVAS_COLORS = [\"1\", \"2\", \"3\", \"4\", \"5\", \"6\"];\n\n  function safeName(label: string): string {\n    return label\n      .replace(/\\r\\n/g, \" \")\n      .replace(/\\r/g, \" \")\n      .replace(/\\n/g, \" \")\n      .replace(/[\\\\/*?:\"<>|#^[\\]]/g, \"\")\n      .trim() || \"unnamed\";\n  }\n\n  // Build nodeFilenames if not provided\n  let filenameMap: Map<string, string>;\n  if (!providedNodeFilenames) {\n    filenameMap = new Map<string, string>();\n    const seenNames = new Map<string, number>();\n    G.forEachNode((nodeId, data) => {\n      const base = safeName((data.label as string) ?? nodeId);\n      const count = seenNames.get(base);\n      if (count !== undefined) {\n        const next = count + 1;\n        seenNames.set(base, next);\n        filenameMap.set(nodeId, `${base}_${next}`);\n      } else {\n        seenNames.set(base, 0);\n        filenameMap.set(nodeId, base);\n      }\n    });\n  } else {\n    filenameMap = toStringMap(providedNodeFilenames);\n  }\n\n  const numCommunities = communityMap.size;\n  const cols = numCommunities > 0 ? Math.ceil(Math.sqrt(numCommunities)) : 1;\n  const rows = numCommunities > 0 ? Math.ceil(numCommunities / cols) : 1;\n\n  const canvasNodes: Record<string, unknown>[] = [];\n  const canvasEdges: Record<string, unknown>[] = [];\n\n  const sortedCids = [...communityMap.keys()].sort((a, b) => a - b);\n\n  // Precompute group sizes\n  const groupSizes = new Map<number, [number, number]>();\n  for (const cid of sortedCids) {\n    const members = communityMap.get(cid) ?? [];\n    const memberCount = members.length;\n    const w = Math.max(600, memberCount > 0 ? 220 * Math.ceil(Math.sqrt(memberCount)) : 600);\n    const h = Math.max(400, memberCount > 0 ? 100 * Math.ceil(memberCount / 3) + 120 : 400);\n    groupSizes.set(cid, [w, h]);\n  }\n\n  // Compute column widths and row heights\n  const gap = 80;\n  const colWidths: number[] = [];\n  for (let colIdx = 0; colIdx < cols; colIdx++) {\n    let maxW = 0;\n    for (let rowIdx = 0; rowIdx < rows; rowIdx++) {\n      const linear = rowIdx * cols + colIdx;\n      if (linear < sortedCids.length) {\n        const cid = sortedCids[linear]!;\n        const [w] = groupSizes.get(cid) ?? [600, 400];\n        maxW = Math.max(maxW, w);\n      }\n    }\n    colWidths.push(maxW);\n  }\n\n  const rowHeights: number[] = [];\n  for (let rowIdx = 0; rowIdx < rows; rowIdx++) {\n    let maxH = 0;\n    for (let colIdx = 0; colIdx < cols; colIdx++) {\n      const linear = rowIdx * cols + colIdx;\n      if (linear < sortedCids.length) {\n        const cid = sortedCids[linear]!;\n        const [, h] = groupSizes.get(cid) ?? [600, 400];\n        maxH = Math.max(maxH, h);\n      }\n    }\n    rowHeights.push(maxH);\n  }\n\n  // Map from cid -> layout\n  const groupLayout = new Map<number, [number, number, number, number]>();\n  for (let idx = 0; idx < sortedCids.length; idx++) {\n    const cid = sortedCids[idx]!;\n    const colIdx = idx % cols;\n    const rowIdx = Math.floor(idx / cols);\n    const gx = colWidths.slice(0, colIdx).reduce((a, b) => a + b, 0) + colIdx * gap;\n    const gy = rowHeights.slice(0, rowIdx).reduce((a, b) => a + b, 0) + rowIdx * gap;\n    const [gw, gh] = groupSizes.get(cid) ?? [600, 400];\n    groupLayout.set(cid, [gx, gy, gw, gh]);\n  }\n\n  // Collect all node IDs in canvas\n  const allCanvasNodeIds = new Set<string>();\n  for (const members of communityMap.values()) {\n    for (const m of members) allCanvasNodeIds.add(m);\n  }\n\n  // Generate group and node canvas entries\n  for (let idx = 0; idx < sortedCids.length; idx++) {\n    const cid = sortedCids[idx]!;\n    const members = communityMap.get(cid) ?? [];\n    const communityName = communityLabels?.get(cid) ?? `Community ${cid}`;\n    const [gx, gy, gw, gh] = groupLayout.get(cid) ?? [0, 0, 600, 400];\n    const canvasColor = CANVAS_COLORS[idx % CANVAS_COLORS.length]!;\n\n    // Group node\n    canvasNodes.push({\n      id: `g${cid}`,\n      type: \"group\",\n      label: communityName,\n      x: gx,\n      y: gy,\n      width: gw,\n      height: gh,\n      color: canvasColor,\n    });\n\n    // Node cards inside the group\n    const sortedMembers = [...members].sort((a, b) => {\n      const la = (G.getNodeAttribute(a, \"label\") as string) ?? a;\n      const lb = (G.getNodeAttribute(b, \"label\") as string) ?? b;\n      return la.localeCompare(lb);\n    });\n    for (let mIdx = 0; mIdx < sortedMembers.length; mIdx++) {\n      const nodeId = sortedMembers[mIdx]!;\n      const col = mIdx % 3;\n      const row = Math.floor(mIdx / 3);\n      const nx = gx + 20 + col * (180 + 20);\n      const ny = gy + 80 + row * (60 + 20);\n      const fname =\n        filenameMap.get(nodeId) ??\n        safeName((G.getNodeAttribute(nodeId, \"label\") as string) ?? nodeId);\n      canvasNodes.push({\n        id: `n_${nodeId}`,\n        type: \"file\",\n        file: `graphify/obsidian/${fname}.md`,\n        x: nx,\n        y: ny,\n        width: 180,\n        height: 60,\n      });\n    }\n  }\n\n  // Generate edges - only between nodes both in canvas, cap at 200 highest-weight\n  const allEdgesWeighted: [number, string, string, string][] = [];\n  G.forEachEdge((_edge, edata, u, v) => {\n    if (allCanvasNodeIds.has(u) && allCanvasNodeIds.has(v)) {\n      const weight = (edata.weight as number) ?? 1.0;\n      const relation = (edata.relation as string) ?? \"\";\n      const conf = (edata.confidence as string) ?? \"EXTRACTED\";\n      const label = relation ? `${relation} [${conf}]` : `[${conf}]`;\n      allEdgesWeighted.push([weight, u, v, label]);\n    }\n  });\n\n  allEdgesWeighted.sort((a, b) => b[0] - a[0]);\n  for (const [, u, v, label] of allEdgesWeighted.slice(0, 200)) {\n    canvasEdges.push({\n      id: `e_${u}_${v}`,\n      fromNode: `n_${u}`,\n      toNode: `n_${v}`,\n      label,\n    });\n  }\n\n  const canvasData = { nodes: canvasNodes, edges: canvasEdges };\n  writeFileSync(outputPath, JSON.stringify(canvasData, null, 2), \"utf-8\");\n}\n","/**\n * Per-file extraction cache - skip unchanged files on re-run.\n */\nimport { createHash } from \"node:crypto\";\nimport { readFileSync, writeFileSync, mkdirSync, readdirSync, unlinkSync, renameSync, existsSync } from \"node:fs\";\nimport { extname, join, resolve } from \"node:path\";\n\nfunction bodyContent(content: Buffer): Buffer {\n  const text = content.toString(\"utf-8\");\n  if (!text.startsWith(\"---\")) {\n    return content;\n  }\n  const end = text.indexOf(\"\\n---\", 3);\n  if (end === -1) {\n    return content;\n  }\n  return Buffer.from(text.slice(end + 4), \"utf-8\");\n}\n\n/**\n * SHA256 of file contents + resolved path. Prevents cache collisions on identical content.\n *\n * For Markdown files, YAML frontmatter is stripped before hashing so metadata-only\n * changes do not invalidate semantic extraction cache entries.\n */\nexport function fileHash(filePath: string): string {\n  const raw = readFileSync(filePath);\n  const content = extname(filePath).toLowerCase() === \".md\" ? bodyContent(raw) : raw;\n  const resolved = resolve(filePath);\n  const h = createHash(\"sha256\");\n  h.update(content);\n  h.update(\"\\0\");\n  h.update(resolved);\n  return h.digest(\"hex\");\n}\n\n/** Returns graphify-out/cache/ path - creates it if needed. */\nexport function cacheDir(root: string = \".\"): string {\n  const d = join(root, \"graphify-out\", \"cache\");\n  mkdirSync(d, { recursive: true });\n  return d;\n}\n\n/**\n * Return cached extraction for this file if hash matches, else null.\n */\nexport function loadCached(filePath: string, root: string = \".\"): Record<string, unknown> | null {\n  let h: string;\n  try {\n    h = fileHash(filePath);\n  } catch {\n    return null;\n  }\n  const entry = join(cacheDir(root), `${h}.json`);\n  if (!existsSync(entry)) return null;\n  try {\n    return JSON.parse(readFileSync(entry, \"utf-8\")) as Record<string, unknown>;\n  } catch {\n    return null;\n  }\n}\n\n/** Save extraction result for this file. */\nexport function saveCached(filePath: string, result: Record<string, unknown>, root: string = \".\"): void {\n  const h = fileHash(filePath);\n  const entry = join(cacheDir(root), `${h}.json`);\n  const tmp = entry + \".tmp\";\n  try {\n    writeFileSync(tmp, JSON.stringify(result));\n    renameSync(tmp, entry);\n  } catch {\n    try { unlinkSync(tmp); } catch { /* ignore */ }\n    throw new Error(`Failed to save cache for ${filePath}`);\n  }\n}\n\n/** Return set of file hashes that have a valid cache entry. */\nexport function cachedFiles(root: string = \".\"): Set<string> {\n  const d = cacheDir(root);\n  const result = new Set<string>();\n  try {\n    for (const f of readdirSync(d)) {\n      if (f.endsWith(\".json\")) {\n        result.add(f.replace(\".json\", \"\"));\n      }\n    }\n  } catch { /* ignore */ }\n  return result;\n}\n\n/** Delete all graphify-out/cache/*.json files. */\nexport function clearCache(root: string = \".\"): void {\n  const d = cacheDir(root);\n  try {\n    for (const f of readdirSync(d)) {\n      if (f.endsWith(\".json\")) {\n        unlinkSync(join(d, f));\n      }\n    }\n  } catch { /* ignore */ }\n}\n\ninterface ExtractionPart {\n  nodes: Array<Record<string, unknown>>;\n  edges: Array<Record<string, unknown>>;\n  hyperedges: Array<Record<string, unknown>>;\n}\n\n/**\n * Check semantic extraction cache for a list of file paths.\n * Returns [cachedNodes, cachedEdges, cachedHyperedges, uncachedFiles].\n */\nexport function checkSemanticCache(\n  files: string[],\n  root: string = \".\",\n): [Array<Record<string, unknown>>, Array<Record<string, unknown>>, Array<Record<string, unknown>>, string[]] {\n  const cachedNodes: Array<Record<string, unknown>> = [];\n  const cachedEdges: Array<Record<string, unknown>> = [];\n  const cachedHyperedges: Array<Record<string, unknown>> = [];\n  const uncached: string[] = [];\n\n  for (const fpath of files) {\n    const result = loadCached(fpath, root);\n    if (result !== null) {\n      const r = result as unknown as ExtractionPart;\n      cachedNodes.push(...(r.nodes ?? []));\n      cachedEdges.push(...(r.edges ?? []));\n      cachedHyperedges.push(...(r.hyperedges ?? []));\n    } else {\n      uncached.push(fpath);\n    }\n  }\n\n  return [cachedNodes, cachedEdges, cachedHyperedges, uncached];\n}\n\n/**\n * Save semantic extraction results to cache, keyed by source_file.\n * Returns the number of files cached.\n */\nexport function saveSemanticCache(\n  nodes: Array<Record<string, unknown>>,\n  edges: Array<Record<string, unknown>>,\n  hyperedges: Array<Record<string, unknown>> | null = null,\n  root: string = \".\",\n): number {\n  const byFile = new Map<string, ExtractionPart>();\n\n  for (const n of nodes) {\n    const src = (n.source_file as string) ?? \"\";\n    if (!src) continue;\n    if (!byFile.has(src)) byFile.set(src, { nodes: [], edges: [], hyperedges: [] });\n    byFile.get(src)!.nodes.push(n);\n  }\n  for (const e of edges) {\n    const src = (e.source_file as string) ?? \"\";\n    if (!src) continue;\n    if (!byFile.has(src)) byFile.set(src, { nodes: [], edges: [], hyperedges: [] });\n    byFile.get(src)!.edges.push(e);\n  }\n  for (const h of hyperedges ?? []) {\n    const src = (h.source_file as string) ?? \"\";\n    if (!src) continue;\n    if (!byFile.has(src)) byFile.set(src, { nodes: [], edges: [], hyperedges: [] });\n    byFile.get(src)!.hyperedges.push(h);\n  }\n\n  let saved = 0;\n  for (const [fpath, result] of byFile) {\n    const p = resolve(root, fpath);\n    if (existsSync(p)) {\n      saveCached(p, result as unknown as Record<string, unknown>, root);\n      saved++;\n    }\n  }\n  return saved;\n}\n","/**\n * Deterministic structural extraction from source code using tree-sitter.\n * Outputs nodes + edges dicts.\n *\n * TypeScript port of graphify/extract.py — uses web-tree-sitter (WASM) instead\n * of Python's native tree-sitter bindings.\n */\n\nimport { readFileSync, readdirSync, lstatSync, realpathSync, existsSync } from \"node:fs\";\nimport { resolve, basename, extname, dirname, join, sep } from \"node:path\";\nimport { createRequire } from \"node:module\";\nimport type { GraphNode, GraphEdge, Extraction } from \"./types.js\";\nimport { loadCached, saveCached } from \"./cache.js\";\n\n// ---------------------------------------------------------------------------\n// web-tree-sitter types  (re-exported from the package)\n// ---------------------------------------------------------------------------\nimport * as TreeSitter from \"web-tree-sitter\";\ntype SyntaxNode = TreeSitter.Node;\ntype Tree = TreeSitter.Tree;\n\nconst Parser = (\n  (TreeSitter as unknown as { Parser?: typeof TreeSitter.Parser }).Parser ??\n  (TreeSitter as unknown as { default?: typeof TreeSitter.Parser }).default\n)!;\n\n// ---------------------------------------------------------------------------\n// Helpers\n// ---------------------------------------------------------------------------\n\nlet _parserInitialized = false;\n\nfunction getModuleRequire(): NodeJS.Require {\n  try {\n    return createRequire(import.meta.url);\n  } catch {\n    return require;\n  }\n}\n\nconst moduleRequire = getModuleRequire();\n\nasync function ensureParserInit(): Promise<void> {\n  if (!_parserInitialized) {\n    await Parser.init();\n    _parserInitialized = true;\n  }\n}\n\nfunction parseText(parser: InstanceType<typeof Parser>, source: string): Tree {\n  const tree = parser.parse(source);\n  if (!tree) {\n    throw new Error(\"Parser returned null\");\n  }\n  return tree;\n}\n\n/** Try to locate a WASM grammar file. Returns the resolved path or null. */\nfunction resolveGrammarWasm(langName: string): string | null {\n  const packageName = new Map<string, string>([\n    [\"c_sharp\", \"c-sharp\"],\n  ]).get(langName) ?? langName;\n  // Try common npm package conventions\n  const candidates = [\n    `tree-sitter-${packageName}/tree-sitter-${langName}.wasm`,\n    `tree-sitter-${packageName}/tree-sitter-${packageName}.wasm`,\n    `tree-sitter-${packageName}/tree_sitter_${langName}.wasm`,\n    `tree-sitter-${packageName}/tree_sitter_${packageName.replace(/-/g, \"_\")}.wasm`,\n    `tree-sitter-${packageName}/${langName}.wasm`,\n    `tree-sitter-${packageName}/${packageName}.wasm`,\n  ];\n  for (const candidate of candidates) {\n    try {\n      const resolved = moduleRequire.resolve(candidate);\n      if (existsSync(resolved)) return resolved;\n    } catch {\n      /* not found via require.resolve — skip */\n    }\n  }\n  // Also try a path relative to node_modules\n  const nmDir = join(process.cwd(), \"node_modules\");\n  for (const candidate of candidates) {\n    const p = join(nmDir, candidate);\n    if (existsSync(p)) return p;\n  }\n  return null;\n}\n\n/**\n * Cache of loaded Parser.Language instances keyed by language name.\n * Avoids re-reading WASM files on every file extraction.\n */\nconst _languageCache = new Map<string, TreeSitter.Language>();\n\nasync function loadLanguage(langName: string): Promise<TreeSitter.Language | null> {\n  if (_languageCache.has(langName)) return _languageCache.get(langName)!;\n  const wasmPath = resolveGrammarWasm(langName);\n  if (!wasmPath) return null;\n  try {\n    const lang = await TreeSitter.Language.load(wasmPath);\n    _languageCache.set(langName, lang);\n    return lang;\n  } catch {\n    return null;\n  }\n}\n\n/** Build a stable node ID from one or more name parts. */\nfunction _makeId(...parts: string[]): string {\n  const combined = parts\n    .filter(Boolean)\n    .map((p) => p.replace(/^[_.]+|[_.]+$/g, \"\"))\n    .join(\"_\");\n  const cleaned = combined.replace(/[^a-zA-Z0-9]+/g, \"_\");\n  return cleaned.replace(/^_+|_+$/g, \"\").toLowerCase();\n}\n\nfunction _readText(node: SyntaxNode, source: string): string {\n  return source.slice(node.startIndex, node.endIndex);\n}\n\n// ---------------------------------------------------------------------------\n// LanguageConfig interface + generic helpers\n// ---------------------------------------------------------------------------\n\ntype ImportHandler = (\n  node: SyntaxNode,\n  source: string,\n  fileNid: string,\n  stem: string,\n  edges: GraphEdge[],\n  strPath: string,\n) => void;\n\ntype ResolveFunctionNameFn = (node: SyntaxNode, source: string) => string | null;\n\ntype ExtraWalkFn = (\n  node: SyntaxNode,\n  source: string,\n  fileNid: string,\n  stem: string,\n  strPath: string,\n  nodes: GraphNode[],\n  edges: GraphEdge[],\n  seenIds: Set<string>,\n  functionBodies: Array<[string, SyntaxNode]>,\n  parentClassNid: string | null,\n  addNodeFn: (nid: string, label: string, line: number) => void,\n  addEdgeFn: (src: string, tgt: string, relation: string, line: number) => void,\n  walkFn?: (node: SyntaxNode, parentClassNid: string | null) => void,\n) => boolean;\n\ninterface LanguageConfig {\n  tsGrammarName: string; // e.g. \"python\"\n  tsModule: string; // original Python module name — used for language-specific branches\n\n  classTypes: Set<string>;\n  functionTypes: Set<string>;\n  importTypes: Set<string>;\n  callTypes: Set<string>;\n\n  nameField: string;\n  nameFallbackChildTypes: string[];\n\n  bodyField: string;\n  bodyFallbackChildTypes: string[];\n\n  callFunctionField: string;\n  callAccessorNodeTypes: Set<string>;\n  callAccessorField: string;\n\n  functionBoundaryTypes: Set<string>;\n\n  importHandler: ImportHandler | null;\n  resolveFunctionNameFn: ResolveFunctionNameFn | null;\n\n  functionLabelParens: boolean;\n\n  extraWalkFn: ExtraWalkFn | null;\n}\n\nfunction defaultConfig(overrides: Partial<LanguageConfig> & Pick<LanguageConfig, \"tsGrammarName\" | \"tsModule\">): LanguageConfig {\n  return {\n    classTypes: new Set(),\n    functionTypes: new Set(),\n    importTypes: new Set(),\n    callTypes: new Set(),\n    nameField: \"name\",\n    nameFallbackChildTypes: [],\n    bodyField: \"body\",\n    bodyFallbackChildTypes: [],\n    callFunctionField: \"function\",\n    callAccessorNodeTypes: new Set(),\n    callAccessorField: \"attribute\",\n    functionBoundaryTypes: new Set(),\n    importHandler: null,\n    resolveFunctionNameFn: null,\n    functionLabelParens: true,\n    extraWalkFn: null,\n    ...overrides,\n  };\n}\n\n// ---------------------------------------------------------------------------\n// Generic helpers for name / body resolution\n// ---------------------------------------------------------------------------\n\nfunction _resolveName(node: SyntaxNode, source: string, config: LanguageConfig): string | null {\n  if (config.resolveFunctionNameFn !== null) {\n    return null; // caller handles this separately\n  }\n  const n = node.childForFieldName(config.nameField);\n  if (n) return _readText(n, source);\n  for (const child of node.children) {\n    if (config.nameFallbackChildTypes.includes(child.type)) {\n      return _readText(child, source);\n    }\n  }\n  return null;\n}\n\nfunction _findBody(node: SyntaxNode, config: LanguageConfig): SyntaxNode | null {\n  const b = node.childForFieldName(config.bodyField);\n  if (b) return b;\n  for (const child of node.children) {\n    if (config.bodyFallbackChildTypes.includes(child.type)) {\n      return child;\n    }\n  }\n  return null;\n}\n\n// ---------------------------------------------------------------------------\n// Import handlers\n// ---------------------------------------------------------------------------\n\nfunction _importPython(\n  node: SyntaxNode, source: string, fileNid: string, _stem: string,\n  edges: GraphEdge[], strPath: string,\n): void {\n  const t = node.type;\n  if (t === \"import_statement\") {\n    for (const child of node.children) {\n      if (child.type === \"dotted_name\" || child.type === \"aliased_import\") {\n        const raw = _readText(child, source);\n        const moduleName = raw.split(\" as \")[0]!.trim().replace(/^\\.+/, \"\");\n        const tgtNid = _makeId(moduleName);\n        edges.push({\n          source: fileNid, target: tgtNid, relation: \"imports\",\n          confidence: \"EXTRACTED\", source_file: strPath,\n          source_location: `L${node.startPosition.row + 1}`, weight: 1.0,\n        });\n      }\n    }\n  } else if (t === \"import_from_statement\") {\n    const moduleNode = node.childForFieldName(\"module_name\");\n    if (moduleNode) {\n      const raw = _readText(moduleNode, source).replace(/^\\.+/, \"\");\n      const tgtNid = _makeId(raw);\n      edges.push({\n        source: fileNid, target: tgtNid, relation: \"imports_from\",\n        confidence: \"EXTRACTED\", source_file: strPath,\n        source_location: `L${node.startPosition.row + 1}`, weight: 1.0,\n      });\n    }\n  }\n}\n\nfunction _importJs(\n  node: SyntaxNode, source: string, fileNid: string, _stem: string,\n  edges: GraphEdge[], strPath: string,\n): void {\n  for (const child of node.children) {\n    if (child.type === \"string\") {\n      const raw = _readText(child, source).replace(/^['\"`\\s]+|['\"`\\s]+$/g, \"\");\n      const moduleName = raw.replace(/^\\.\\/|^\\.\\.\\//, \"\").split(\"/\").pop() ?? \"\";\n      if (moduleName) {\n        const tgtNid = _makeId(moduleName);\n        edges.push({\n          source: fileNid, target: tgtNid, relation: \"imports_from\",\n          confidence: \"EXTRACTED\", source_file: strPath,\n          source_location: `L${node.startPosition.row + 1}`, weight: 1.0,\n        });\n      }\n      break;\n    }\n  }\n}\n\nfunction _importJava(\n  node: SyntaxNode, source: string, fileNid: string, _stem: string,\n  edges: GraphEdge[], strPath: string,\n): void {\n  function walkScoped(n: SyntaxNode): string {\n    const parts: string[] = [];\n    let cur: SyntaxNode | null = n;\n    while (cur) {\n      if (cur.type === \"scoped_identifier\") {\n        const nameNode = cur.childForFieldName(\"name\");\n        if (nameNode) parts.push(_readText(nameNode, source));\n        cur = cur.childForFieldName(\"scope\");\n      } else if (cur.type === \"identifier\") {\n        parts.push(_readText(cur, source));\n        break;\n      } else {\n        break;\n      }\n    }\n    parts.reverse();\n    return parts.join(\".\");\n  }\n\n  for (const child of node.children) {\n    if (child.type === \"scoped_identifier\" || child.type === \"identifier\") {\n      const pathStr = walkScoped(child);\n      const pathParts = pathStr.split(\".\");\n      let moduleName = pathParts[pathParts.length - 1]!.replace(/\\*/g, \"\").replace(/\\.+$/, \"\").trim();\n      if (!moduleName && pathParts.length > 1) {\n        moduleName = pathParts[pathParts.length - 2]!;\n      }\n      if (!moduleName) moduleName = pathStr;\n      if (moduleName) {\n        const tgtNid = _makeId(moduleName);\n        edges.push({\n          source: fileNid, target: tgtNid, relation: \"imports\",\n          confidence: \"EXTRACTED\", source_file: strPath,\n          source_location: `L${node.startPosition.row + 1}`, weight: 1.0,\n        });\n      }\n      break;\n    }\n  }\n}\n\nfunction _importC(\n  node: SyntaxNode, source: string, fileNid: string, _stem: string,\n  edges: GraphEdge[], strPath: string,\n): void {\n  for (const child of node.children) {\n    if ([\"string_literal\", \"system_lib_string\", \"string\"].includes(child.type)) {\n      const raw = _readText(child, source).replace(/^[\"<>\\s]+|[\"<>\\s]+$/g, \"\");\n      const moduleName = raw.split(\"/\").pop()!.split(\".\")[0]!;\n      if (moduleName) {\n        const tgtNid = _makeId(moduleName);\n        edges.push({\n          source: fileNid, target: tgtNid, relation: \"imports\",\n          confidence: \"EXTRACTED\", source_file: strPath,\n          source_location: `L${node.startPosition.row + 1}`, weight: 1.0,\n        });\n      }\n      break;\n    }\n  }\n}\n\nfunction _importCsharp(\n  node: SyntaxNode, source: string, fileNid: string, _stem: string,\n  edges: GraphEdge[], strPath: string,\n): void {\n  for (const child of node.children) {\n    if ([\"qualified_name\", \"identifier\", \"name_equals\"].includes(child.type)) {\n      const raw = _readText(child, source);\n      const moduleName = raw.split(\".\").pop()!.trim();\n      if (moduleName) {\n        const tgtNid = _makeId(moduleName);\n        edges.push({\n          source: fileNid, target: tgtNid, relation: \"imports\",\n          confidence: \"EXTRACTED\", source_file: strPath,\n          source_location: `L${node.startPosition.row + 1}`, weight: 1.0,\n        });\n      }\n      break;\n    }\n  }\n}\n\nfunction _importKotlin(\n  node: SyntaxNode, source: string, fileNid: string, _stem: string,\n  edges: GraphEdge[], strPath: string,\n): void {\n  const pathNode = node.childForFieldName(\"path\");\n  if (pathNode) {\n    const raw = _readText(pathNode, source);\n    const moduleName = raw.split(\".\").pop()!.trim();\n    if (moduleName) {\n      const tgtNid = _makeId(moduleName);\n      edges.push({\n        source: fileNid, target: tgtNid, relation: \"imports\",\n        confidence: \"EXTRACTED\", source_file: strPath,\n        source_location: `L${node.startPosition.row + 1}`, weight: 1.0,\n      });\n    }\n    return;\n  }\n  // Fallback: find identifier child\n  for (const child of node.children) {\n    if (child.type === \"identifier\") {\n      const raw = _readText(child, source);\n      const tgtNid = _makeId(raw);\n      edges.push({\n        source: fileNid, target: tgtNid, relation: \"imports\",\n        confidence: \"EXTRACTED\", source_file: strPath,\n        source_location: `L${node.startPosition.row + 1}`, weight: 1.0,\n      });\n      break;\n    }\n  }\n}\n\nfunction _importScala(\n  node: SyntaxNode, source: string, fileNid: string, _stem: string,\n  edges: GraphEdge[], strPath: string,\n): void {\n  for (const child of node.children) {\n    if (child.type === \"stable_id\" || child.type === \"identifier\") {\n      const raw = _readText(child, source);\n      const moduleName = raw.split(\".\").pop()!.replace(/[{}\\s]/g, \"\").trim();\n      if (moduleName && moduleName !== \"_\") {\n        const tgtNid = _makeId(moduleName);\n        edges.push({\n          source: fileNid, target: tgtNid, relation: \"imports\",\n          confidence: \"EXTRACTED\", source_file: strPath,\n          source_location: `L${node.startPosition.row + 1}`, weight: 1.0,\n        });\n      }\n      break;\n    }\n  }\n}\n\nfunction _importPhp(\n  node: SyntaxNode, source: string, fileNid: string, _stem: string,\n  edges: GraphEdge[], strPath: string,\n): void {\n  for (const child of node.children) {\n    if ([\"qualified_name\", \"name\", \"identifier\"].includes(child.type)) {\n      const raw = _readText(child, source);\n      const moduleName = raw.split(\"\\\\\").pop()!.trim();\n      if (moduleName) {\n        const tgtNid = _makeId(moduleName);\n        edges.push({\n          source: fileNid, target: tgtNid, relation: \"imports\",\n          confidence: \"EXTRACTED\", source_file: strPath,\n          source_location: `L${node.startPosition.row + 1}`, weight: 1.0,\n        });\n      }\n      break;\n    }\n  }\n}\n\nfunction _importLua(\n  node: SyntaxNode, source: string, fileNid: string, _stem: string,\n  edges: GraphEdge[], strPath: string,\n): void {\n  const text = _readText(node, source);\n  const m = text.match(/require\\s*[('\"]?\\s*['\"]?([^'\")\\s]+)/);\n  if (m) {\n    const moduleName = m[1]!.split(\".\").pop()!;\n    if (moduleName) {\n      edges.push({\n        source: fileNid, target: moduleName, relation: \"imports\",\n        confidence: \"EXTRACTED\", source_file: strPath,\n        source_location: String(node.startPosition.row + 1), weight: 1.0,\n      });\n    }\n  }\n}\n\nfunction _importSwift(\n  node: SyntaxNode, source: string, fileNid: string, _stem: string,\n  edges: GraphEdge[], strPath: string,\n): void {\n  for (const child of node.children) {\n    if (child.type === \"identifier\") {\n      const raw = _readText(child, source);\n      const tgtNid = _makeId(raw);\n      edges.push({\n        source: fileNid, target: tgtNid, relation: \"imports\",\n        confidence: \"EXTRACTED\", source_file: strPath,\n        source_location: `L${node.startPosition.row + 1}`, weight: 1.0,\n      });\n      break;\n    }\n  }\n}\n\n// ---------------------------------------------------------------------------\n// C/C++ function name helpers\n// ---------------------------------------------------------------------------\n\nfunction _getCFuncName(node: SyntaxNode, source: string): string | null {\n  if (node.type === \"identifier\") return _readText(node, source);\n  const decl = node.childForFieldName(\"declarator\");\n  if (decl) return _getCFuncName(decl, source);\n  for (const child of node.children) {\n    if (child.type === \"identifier\") return _readText(child, source);\n  }\n  return null;\n}\n\nfunction _getCppFuncName(node: SyntaxNode, source: string): string | null {\n  if (node.type === \"identifier\") return _readText(node, source);\n  if (node.type === \"qualified_identifier\") {\n    const nameNode = node.childForFieldName(\"name\");\n    if (nameNode) return _readText(nameNode, source);\n  }\n  const decl = node.childForFieldName(\"declarator\");\n  if (decl) return _getCppFuncName(decl, source);\n  for (const child of node.children) {\n    if (child.type === \"identifier\") return _readText(child, source);\n  }\n  return null;\n}\n\n// ---------------------------------------------------------------------------\n// JS/TS extra walk for arrow functions\n// ---------------------------------------------------------------------------\n\nfunction _jsExtraWalk(\n  node: SyntaxNode, source: string, fileNid: string, stem: string, _strPath: string,\n  _nodes: GraphNode[], _edges: GraphEdge[], _seenIds: Set<string>,\n  functionBodies: Array<[string, SyntaxNode]>,\n  _parentClassNid: string | null,\n  addNodeFn: (nid: string, label: string, line: number) => void,\n  addEdgeFn: (src: string, tgt: string, relation: string, line: number) => void,\n): boolean {\n  if (node.type === \"lexical_declaration\") {\n    for (const child of node.children) {\n      if (child.type === \"variable_declarator\") {\n        const value = child.childForFieldName(\"value\");\n        if (value && value.type === \"arrow_function\") {\n          const nameNode = child.childForFieldName(\"name\");\n          if (nameNode) {\n            const funcName = _readText(nameNode, source);\n            const line = child.startPosition.row + 1;\n            const funcNid = _makeId(stem, funcName);\n            addNodeFn(funcNid, `${funcName}()`, line);\n            addEdgeFn(fileNid, funcNid, \"contains\", line);\n            const body = value.childForFieldName(\"body\");\n            if (body) {\n              functionBodies.push([funcNid, body]);\n            }\n          }\n        }\n      }\n    }\n    return true;\n  }\n  return false;\n}\n\n// ---------------------------------------------------------------------------\n// C# extra walk for namespace declarations\n// ---------------------------------------------------------------------------\n\nfunction _csharpExtraWalk(\n  node: SyntaxNode, source: string, fileNid: string, stem: string, _strPath: string,\n  _nodes: GraphNode[], _edges: GraphEdge[], _seenIds: Set<string>,\n  _functionBodies: Array<[string, SyntaxNode]>,\n  parentClassNid: string | null,\n  addNodeFn: (nid: string, label: string, line: number) => void,\n  addEdgeFn: (src: string, tgt: string, relation: string, line: number) => void,\n  walkFn?: (node: SyntaxNode, parentClassNid: string | null) => void,\n): boolean {\n  if (node.type === \"namespace_declaration\") {\n    const nameNode = node.childForFieldName(\"name\");\n    if (nameNode) {\n      const nsName = _readText(nameNode, source);\n      const nsNid = _makeId(stem, nsName);\n      const line = node.startPosition.row + 1;\n      addNodeFn(nsNid, nsName, line);\n      addEdgeFn(fileNid, nsNid, \"contains\", line);\n    }\n    const body = node.childForFieldName(\"body\");\n    if (body && walkFn) {\n      for (const child of body.children) {\n        walkFn(child, parentClassNid);\n      }\n    }\n    return true;\n  }\n  return false;\n}\n\n// ---------------------------------------------------------------------------\n// Swift extra walk for enum cases\n// ---------------------------------------------------------------------------\n\nfunction _swiftExtraWalk(\n  node: SyntaxNode, source: string, _fileNid: string, _stem: string, _strPath: string,\n  _nodes: GraphNode[], _edges: GraphEdge[], _seenIds: Set<string>,\n  _functionBodies: Array<[string, SyntaxNode]>,\n  parentClassNid: string | null,\n  addNodeFn: (nid: string, label: string, line: number) => void,\n  addEdgeFn: (src: string, tgt: string, relation: string, line: number) => void,\n): boolean {\n  if (node.type === \"enum_entry\" && parentClassNid) {\n    for (const child of node.children) {\n      if (child.type === \"simple_identifier\") {\n        const caseName = _readText(child, source);\n        const caseNid = _makeId(parentClassNid, caseName);\n        const line = node.startPosition.row + 1;\n        addNodeFn(caseNid, caseName, line);\n        addEdgeFn(parentClassNid, caseNid, \"case_of\", line);\n      }\n    }\n    return true;\n  }\n  return false;\n}\n\n// ---------------------------------------------------------------------------\n// Language configs\n// ---------------------------------------------------------------------------\n\nconst _PYTHON_CONFIG: LanguageConfig = defaultConfig({\n  tsGrammarName: \"python\",\n  tsModule: \"tree_sitter_python\",\n  classTypes: new Set([\"class_definition\"]),\n  functionTypes: new Set([\"function_definition\"]),\n  importTypes: new Set([\"import_statement\", \"import_from_statement\"]),\n  callTypes: new Set([\"call\"]),\n  callFunctionField: \"function\",\n  callAccessorNodeTypes: new Set([\"attribute\"]),\n  callAccessorField: \"attribute\",\n  functionBoundaryTypes: new Set([\"function_definition\"]),\n  importHandler: _importPython,\n});\n\nconst _JS_CONFIG: LanguageConfig = defaultConfig({\n  tsGrammarName: \"javascript\",\n  tsModule: \"tree_sitter_javascript\",\n  classTypes: new Set([\"class_declaration\"]),\n  functionTypes: new Set([\"function_declaration\", \"method_definition\"]),\n  importTypes: new Set([\"import_statement\"]),\n  callTypes: new Set([\"call_expression\"]),\n  callFunctionField: \"function\",\n  callAccessorNodeTypes: new Set([\"member_expression\"]),\n  callAccessorField: \"property\",\n  functionBoundaryTypes: new Set([\"function_declaration\", \"arrow_function\", \"method_definition\"]),\n  importHandler: _importJs,\n});\n\nconst _TS_CONFIG: LanguageConfig = defaultConfig({\n  tsGrammarName: \"typescript\",\n  tsModule: \"tree_sitter_typescript\",\n  classTypes: new Set([\"class_declaration\"]),\n  functionTypes: new Set([\"function_declaration\", \"method_definition\"]),\n  importTypes: new Set([\"import_statement\"]),\n  callTypes: new Set([\"call_expression\"]),\n  callFunctionField: \"function\",\n  callAccessorNodeTypes: new Set([\"member_expression\"]),\n  callAccessorField: \"property\",\n  functionBoundaryTypes: new Set([\"function_declaration\", \"arrow_function\", \"method_definition\"]),\n  importHandler: _importJs,\n});\n\nconst _JAVA_CONFIG: LanguageConfig = defaultConfig({\n  tsGrammarName: \"java\",\n  tsModule: \"tree_sitter_java\",\n  classTypes: new Set([\"class_declaration\", \"interface_declaration\"]),\n  functionTypes: new Set([\"method_declaration\", \"constructor_declaration\"]),\n  importTypes: new Set([\"import_declaration\"]),\n  callTypes: new Set([\"method_invocation\"]),\n  callFunctionField: \"name\",\n  callAccessorNodeTypes: new Set(),\n  functionBoundaryTypes: new Set([\"method_declaration\", \"constructor_declaration\"]),\n  importHandler: _importJava,\n});\n\nconst _C_CONFIG: LanguageConfig = defaultConfig({\n  tsGrammarName: \"c\",\n  tsModule: \"tree_sitter_c\",\n  classTypes: new Set(),\n  functionTypes: new Set([\"function_definition\"]),\n  importTypes: new Set([\"preproc_include\"]),\n  callTypes: new Set([\"call_expression\"]),\n  callFunctionField: \"function\",\n  callAccessorNodeTypes: new Set([\"field_expression\"]),\n  callAccessorField: \"field\",\n  functionBoundaryTypes: new Set([\"function_definition\"]),\n  importHandler: _importC,\n  resolveFunctionNameFn: _getCFuncName,\n});\n\nconst _CPP_CONFIG: LanguageConfig = defaultConfig({\n  tsGrammarName: \"cpp\",\n  tsModule: \"tree_sitter_cpp\",\n  classTypes: new Set([\"class_specifier\"]),\n  functionTypes: new Set([\"function_definition\"]),\n  importTypes: new Set([\"preproc_include\"]),\n  callTypes: new Set([\"call_expression\"]),\n  callFunctionField: \"function\",\n  callAccessorNodeTypes: new Set([\"field_expression\", \"qualified_identifier\"]),\n  callAccessorField: \"field\",\n  functionBoundaryTypes: new Set([\"function_definition\"]),\n  importHandler: _importC,\n  resolveFunctionNameFn: _getCppFuncName,\n});\n\nconst _RUBY_CONFIG: LanguageConfig = defaultConfig({\n  tsGrammarName: \"ruby\",\n  tsModule: \"tree_sitter_ruby\",\n  classTypes: new Set([\"class\"]),\n  functionTypes: new Set([\"method\", \"singleton_method\"]),\n  importTypes: new Set(),\n  callTypes: new Set([\"call\"]),\n  callFunctionField: \"method\",\n  callAccessorNodeTypes: new Set(),\n  nameFallbackChildTypes: [\"constant\", \"scope_resolution\", \"identifier\"],\n  bodyFallbackChildTypes: [\"body_statement\"],\n  functionBoundaryTypes: new Set([\"method\", \"singleton_method\"]),\n});\n\nconst _CSHARP_CONFIG: LanguageConfig = defaultConfig({\n  tsGrammarName: \"c_sharp\",\n  tsModule: \"tree_sitter_c_sharp\",\n  classTypes: new Set([\"class_declaration\", \"interface_declaration\"]),\n  functionTypes: new Set([\"method_declaration\"]),\n  importTypes: new Set([\"using_directive\"]),\n  callTypes: new Set([\"invocation_expression\"]),\n  callFunctionField: \"function\",\n  callAccessorNodeTypes: new Set([\"member_access_expression\"]),\n  callAccessorField: \"name\",\n  bodyFallbackChildTypes: [\"declaration_list\"],\n  functionBoundaryTypes: new Set([\"method_declaration\"]),\n  importHandler: _importCsharp,\n});\n\nconst _KOTLIN_CONFIG: LanguageConfig = defaultConfig({\n  tsGrammarName: \"kotlin\",\n  tsModule: \"tree_sitter_kotlin\",\n  classTypes: new Set([\"class_declaration\", \"object_declaration\"]),\n  functionTypes: new Set([\"function_declaration\"]),\n  importTypes: new Set([\"import_header\"]),\n  callTypes: new Set([\"call_expression\"]),\n  callFunctionField: \"\",\n  callAccessorNodeTypes: new Set([\"navigation_expression\"]),\n  callAccessorField: \"\",\n  nameFallbackChildTypes: [\"simple_identifier\"],\n  bodyFallbackChildTypes: [\"function_body\", \"class_body\"],\n  functionBoundaryTypes: new Set([\"function_declaration\"]),\n  importHandler: _importKotlin,\n});\n\nconst _SCALA_CONFIG: LanguageConfig = defaultConfig({\n  tsGrammarName: \"scala\",\n  tsModule: \"tree_sitter_scala\",\n  classTypes: new Set([\"class_definition\", \"object_definition\"]),\n  functionTypes: new Set([\"function_definition\"]),\n  importTypes: new Set([\"import_declaration\"]),\n  callTypes: new Set([\"call_expression\"]),\n  callFunctionField: \"\",\n  callAccessorNodeTypes: new Set([\"field_expression\"]),\n  callAccessorField: \"field\",\n  nameFallbackChildTypes: [\"identifier\"],\n  bodyFallbackChildTypes: [\"template_body\"],\n  functionBoundaryTypes: new Set([\"function_definition\"]),\n  importHandler: _importScala,\n});\n\nconst _PHP_CONFIG: LanguageConfig = defaultConfig({\n  tsGrammarName: \"php\",\n  tsModule: \"tree_sitter_php\",\n  classTypes: new Set([\"class_declaration\"]),\n  functionTypes: new Set([\"function_definition\", \"method_declaration\"]),\n  importTypes: new Set([\"namespace_use_clause\"]),\n  callTypes: new Set([\"function_call_expression\", \"member_call_expression\"]),\n  callFunctionField: \"function\",\n  callAccessorNodeTypes: new Set([\"member_call_expression\"]),\n  callAccessorField: \"name\",\n  nameFallbackChildTypes: [\"name\"],\n  bodyFallbackChildTypes: [\"declaration_list\", \"compound_statement\"],\n  functionBoundaryTypes: new Set([\"function_definition\", \"method_declaration\"]),\n  importHandler: _importPhp,\n});\n\nconst _LUA_CONFIG: LanguageConfig = defaultConfig({\n  tsGrammarName: \"lua\",\n  tsModule: \"tree_sitter_lua\",\n  classTypes: new Set(),\n  functionTypes: new Set([\"function_declaration\"]),\n  importTypes: new Set([\"variable_declaration\"]),\n  callTypes: new Set([\"function_call\"]),\n  callFunctionField: \"name\",\n  callAccessorNodeTypes: new Set([\"method_index_expression\"]),\n  callAccessorField: \"name\",\n  nameFallbackChildTypes: [\"identifier\", \"method_index_expression\"],\n  bodyFallbackChildTypes: [\"block\"],\n  functionBoundaryTypes: new Set([\"function_declaration\"]),\n  importHandler: _importLua,\n});\n\nconst _SWIFT_CONFIG: LanguageConfig = defaultConfig({\n  tsGrammarName: \"swift\",\n  tsModule: \"tree_sitter_swift\",\n  classTypes: new Set([\"class_declaration\", \"protocol_declaration\"]),\n  functionTypes: new Set([\"function_declaration\", \"init_declaration\", \"deinit_declaration\", \"subscript_declaration\"]),\n  importTypes: new Set([\"import_declaration\"]),\n  callTypes: new Set([\"call_expression\"]),\n  callFunctionField: \"\",\n  callAccessorNodeTypes: new Set([\"navigation_expression\"]),\n  callAccessorField: \"\",\n  nameFallbackChildTypes: [\"simple_identifier\", \"type_identifier\", \"user_type\"],\n  bodyFallbackChildTypes: [\"class_body\", \"protocol_body\", \"function_body\", \"enum_class_body\"],\n  functionBoundaryTypes: new Set([\"function_declaration\", \"init_declaration\", \"deinit_declaration\", \"subscript_declaration\"]),\n  importHandler: _importSwift,\n});\n\n// ---------------------------------------------------------------------------\n// Generic extractor\n// ---------------------------------------------------------------------------\n\nexport interface ExtractionResult {\n  nodes: GraphNode[];\n  edges: GraphEdge[];\n  error?: string;\n}\n\nasync function _extractGeneric(filePath: string, config: LanguageConfig): Promise<ExtractionResult> {\n  await ensureParserInit();\n  const lang = await loadLanguage(config.tsGrammarName);\n  if (!lang) {\n    return { nodes: [], edges: [], error: `Grammar not found for ${config.tsGrammarName}` };\n  }\n\n  let source: string;\n  let tree: Tree;\n  try {\n    const parser = new Parser();\n    parser.setLanguage(lang);\n    source = readFileSync(filePath, \"utf-8\");\n    tree = parseText(parser, source);\n  } catch (e: unknown) {\n    return { nodes: [], edges: [], error: String(e) };\n  }\n\n  const root = tree.rootNode;\n  const stem = basename(filePath, extname(filePath));\n  const strPath = filePath;\n  const nodes: GraphNode[] = [];\n  const edges: GraphEdge[] = [];\n  const seenIds = new Set<string>();\n  const functionBodies: Array<[string, SyntaxNode]> = [];\n\n  function addNode(nid: string, label: string, line: number): void {\n    if (!seenIds.has(nid)) {\n      seenIds.add(nid);\n      nodes.push({\n        id: nid, label, file_type: \"code\",\n        source_file: strPath, source_location: `L${line}`,\n      });\n    }\n  }\n\n  function addEdge(\n    src: string, tgt: string, relation: string, line: number,\n    confidence: \"EXTRACTED\" | \"INFERRED\" = \"EXTRACTED\", weight: number = 1.0,\n  ): void {\n    edges.push({\n      source: src, target: tgt, relation,\n      confidence, source_file: strPath,\n      source_location: `L${line}`, weight,\n    });\n  }\n\n  const fileNid = _makeId(stem);\n  addNode(fileNid, basename(filePath), 1);\n\n  function walk(node: SyntaxNode, parentClassNid: string | null = null): void {\n    const t = node.type;\n\n    // Import types\n    if (config.importTypes.has(t)) {\n      if (config.importHandler) {\n        config.importHandler(node, source, fileNid, stem, edges, strPath);\n      }\n      return;\n    }\n\n    // Class types\n    if (config.classTypes.has(t)) {\n      let nameNode = node.childForFieldName(config.nameField);\n      if (!nameNode) {\n        for (const child of node.children) {\n          if (config.nameFallbackChildTypes.includes(child.type)) {\n            nameNode = child;\n            break;\n          }\n        }\n      }\n      if (!nameNode) return;\n      const className = _readText(nameNode, source);\n      const classNid = _makeId(stem, className);\n      const line = node.startPosition.row + 1;\n      addNode(classNid, className, line);\n      addEdge(fileNid, classNid, \"contains\", line);\n\n      // Python-specific: inheritance\n      if (config.tsModule === \"tree_sitter_python\") {\n        const args = node.childForFieldName(\"superclasses\");\n        if (args) {\n          for (const arg of args.children) {\n            if (arg.type === \"identifier\") {\n              const base = _readText(arg, source);\n              let baseNid = _makeId(stem, base);\n              if (!seenIds.has(baseNid)) {\n                baseNid = _makeId(base);\n                if (!seenIds.has(baseNid)) {\n                  nodes.push({\n                    id: baseNid, label: base, file_type: \"code\",\n                    source_file: \"\", source_location: \"\",\n                  });\n                  seenIds.add(baseNid);\n                }\n              }\n              addEdge(classNid, baseNid, \"inherits\", line);\n            }\n          }\n        }\n      }\n\n      // Swift-specific: conformance / inheritance\n      if (config.tsModule === \"tree_sitter_swift\") {\n        for (const child of node.children) {\n          if (child.type === \"inheritance_specifier\") {\n            for (const sub of child.children) {\n              if (sub.type === \"user_type\" || sub.type === \"type_identifier\") {\n                const base = _readText(sub, source);\n                let baseNid = _makeId(stem, base);\n                if (!seenIds.has(baseNid)) {\n                  baseNid = _makeId(base);\n                  if (!seenIds.has(baseNid)) {\n                    nodes.push({\n                      id: baseNid, label: base, file_type: \"code\",\n                      source_file: \"\", source_location: \"\",\n                    });\n                    seenIds.add(baseNid);\n                  }\n                }\n                addEdge(classNid, baseNid, \"inherits\", line);\n              }\n            }\n          }\n        }\n      }\n\n      // C#-specific: inheritance / interface implementation via base_list\n      if (config.tsModule === \"tree_sitter_c_sharp\") {\n        for (const child of node.children) {\n          if (child.type === \"base_list\") {\n            for (const sub of child.children) {\n              if (sub.type === \"identifier\" || sub.type === \"generic_name\") {\n                let base: string;\n                if (sub.type === \"generic_name\") {\n                  const nameChild = sub.childForFieldName(\"name\");\n                  base = nameChild ? _readText(nameChild, source) : _readText(sub.children[0]!, source);\n                } else {\n                  base = _readText(sub, source);\n                }\n                let baseNid = _makeId(stem, base);\n                if (!seenIds.has(baseNid)) {\n                  baseNid = _makeId(base);\n                  if (!seenIds.has(baseNid)) {\n                    nodes.push({\n                      id: baseNid, label: base, file_type: \"code\",\n                      source_file: \"\", source_location: \"\",\n                    });\n                    seenIds.add(baseNid);\n                  }\n                }\n                addEdge(classNid, baseNid, \"inherits\", line);\n              }\n            }\n          }\n        }\n      }\n\n      // Find body and recurse\n      const body = _findBody(node, config);\n      if (body) {\n        for (const child of body.children) {\n          walk(child, classNid);\n        }\n      }\n      return;\n    }\n\n    // Function types\n    if (config.functionTypes.has(t)) {\n      let funcName: string | null = null;\n\n      // Swift deinit/subscript have no name field\n      if (t === \"deinit_declaration\") {\n        funcName = \"deinit\";\n      } else if (t === \"subscript_declaration\") {\n        funcName = \"subscript\";\n      } else if (config.resolveFunctionNameFn !== null) {\n        // C/C++ style: use declarator\n        const declarator = node.childForFieldName(\"declarator\");\n        if (declarator) {\n          funcName = config.resolveFunctionNameFn(declarator, source);\n        }\n      } else {\n        let nameNode = node.childForFieldName(config.nameField);\n        if (!nameNode) {\n          for (const child of node.children) {\n            if (config.nameFallbackChildTypes.includes(child.type)) {\n              nameNode = child;\n              break;\n            }\n          }\n        }\n        funcName = nameNode ? _readText(nameNode, source) : null;\n      }\n\n      if (!funcName) return;\n\n      const line = node.startPosition.row + 1;\n      let funcNid: string;\n      if (parentClassNid) {\n        funcNid = _makeId(parentClassNid, funcName);\n        addNode(funcNid, `.${funcName}()`, line);\n        addEdge(parentClassNid, funcNid, \"method\", line);\n      } else {\n        funcNid = _makeId(stem, funcName);\n        addNode(funcNid, `${funcName}()`, line);\n        addEdge(fileNid, funcNid, \"contains\", line);\n      }\n\n      const body = _findBody(node, config);\n      if (body) {\n        functionBodies.push([funcNid, body]);\n      }\n      return;\n    }\n\n    // JS/TS arrow functions\n    if (config.tsModule === \"tree_sitter_javascript\" || config.tsModule === \"tree_sitter_typescript\") {\n      if (_jsExtraWalk(node, source, fileNid, stem, strPath,\n        nodes, edges, seenIds, functionBodies,\n        parentClassNid, addNode, addEdge)) {\n        return;\n      }\n    }\n\n    // C# namespaces\n    if (config.tsModule === \"tree_sitter_c_sharp\") {\n      if (_csharpExtraWalk(node, source, fileNid, stem, strPath,\n        nodes, edges, seenIds, functionBodies,\n        parentClassNid, addNode, addEdge, walk)) {\n        return;\n      }\n    }\n\n    // Swift enum cases\n    if (config.tsModule === \"tree_sitter_swift\") {\n      if (_swiftExtraWalk(node, source, fileNid, stem, strPath,\n        nodes, edges, seenIds, functionBodies,\n        parentClassNid, addNode, addEdge)) {\n        return;\n      }\n    }\n\n    // Default: recurse\n    for (const child of node.children) {\n      walk(child, null);\n    }\n  }\n\n  walk(root);\n\n  // -- Call-graph pass --\n  const labelToNid = new Map<string, string>();\n  for (const n of nodes) {\n    const raw = n.label;\n    const normalised = raw.replace(/\\(?\\)$/g, \"\").replace(/^\\./, \"\");\n    labelToNid.set(normalised.toLowerCase(), n.id);\n  }\n\n  const seenCallPairs = new Set<string>();\n\n  function walkCalls(node: SyntaxNode, callerNid: string): void {\n    if (config.functionBoundaryTypes.has(node.type)) return;\n\n    if (config.callTypes.has(node.type)) {\n      let calleeName: string | null = null;\n\n      // Special handling per language\n      if (config.tsModule === \"tree_sitter_swift\") {\n        const first = node.children[0] ?? null;\n        if (first) {\n          if (first.type === \"simple_identifier\") {\n            calleeName = _readText(first, source);\n          } else if (first.type === \"navigation_expression\") {\n            for (const child of first.children) {\n              if (child.type === \"navigation_suffix\") {\n                for (const sc of child.children) {\n                  if (sc.type === \"simple_identifier\") {\n                    calleeName = _readText(sc, source);\n                  }\n                }\n              }\n            }\n          }\n        }\n      } else if (config.tsModule === \"tree_sitter_kotlin\") {\n        const first = node.children[0] ?? null;\n        if (first) {\n          if (first.type === \"simple_identifier\") {\n            calleeName = _readText(first, source);\n          } else if (first.type === \"navigation_expression\") {\n            for (let i = first.children.length - 1; i >= 0; i--) {\n              if (first.children[i]!.type === \"simple_identifier\") {\n                calleeName = _readText(first.children[i]!, source);\n                break;\n              }\n            }\n          }\n        }\n      } else if (config.tsModule === \"tree_sitter_scala\") {\n        const first = node.children[0] ?? null;\n        if (first) {\n          if (first.type === \"identifier\") {\n            calleeName = _readText(first, source);\n          } else if (first.type === \"field_expression\") {\n            const field = first.childForFieldName(\"field\");\n            if (field) {\n              calleeName = _readText(field, source);\n            } else {\n              for (let i = first.children.length - 1; i >= 0; i--) {\n                if (first.children[i]!.type === \"identifier\") {\n                  calleeName = _readText(first.children[i]!, source);\n                  break;\n                }\n              }\n            }\n          }\n        }\n      } else if (config.tsModule === \"tree_sitter_c_sharp\" && node.type === \"invocation_expression\") {\n        const nameNode = node.childForFieldName(\"name\");\n        if (nameNode) {\n          calleeName = _readText(nameNode, source);\n        } else {\n          for (const child of node.children) {\n            if (child.isNamed) {\n              const raw = _readText(child, source);\n              if (raw.includes(\".\")) {\n                calleeName = raw.split(\".\").pop()!;\n              } else {\n                calleeName = raw;\n              }\n              break;\n            }\n          }\n        }\n      } else if (config.tsModule === \"tree_sitter_php\") {\n        if (node.type === \"function_call_expression\") {\n          const funcNode = node.childForFieldName(\"function\");\n          if (funcNode) calleeName = _readText(funcNode, source);\n        } else {\n          const nameNode = node.childForFieldName(\"name\");\n          if (nameNode) calleeName = _readText(nameNode, source);\n        }\n      } else if (config.tsModule === \"tree_sitter_cpp\") {\n        const funcNode = config.callFunctionField ? node.childForFieldName(config.callFunctionField) : null;\n        if (funcNode) {\n          if (funcNode.type === \"identifier\") {\n            calleeName = _readText(funcNode, source);\n          } else if (funcNode.type === \"field_expression\" || funcNode.type === \"qualified_identifier\") {\n            const name = funcNode.childForFieldName(\"field\") ?? funcNode.childForFieldName(\"name\");\n            if (name) calleeName = _readText(name, source);\n          }\n        }\n      } else {\n        // Generic: get callee from callFunctionField\n        const funcNode = config.callFunctionField ? node.childForFieldName(config.callFunctionField) : null;\n        if (funcNode) {\n          if (funcNode.type === \"identifier\") {\n            calleeName = _readText(funcNode, source);\n          } else if (config.callAccessorNodeTypes.has(funcNode.type)) {\n            if (config.callAccessorField) {\n              const attr = funcNode.childForFieldName(config.callAccessorField);\n              if (attr) calleeName = _readText(attr, source);\n            }\n          } else {\n            // Try reading the node directly (e.g. Java name field is the callee)\n            calleeName = _readText(funcNode, source);\n          }\n        }\n      }\n\n      if (calleeName) {\n        const tgtNid = labelToNid.get(calleeName.toLowerCase());\n        if (tgtNid && tgtNid !== callerNid) {\n          const pair = `${callerNid}|${tgtNid}`;\n          if (!seenCallPairs.has(pair)) {\n            seenCallPairs.add(pair);\n            const line = node.startPosition.row + 1;\n            edges.push({\n              source: callerNid, target: tgtNid, relation: \"calls\",\n              confidence: \"EXTRACTED\", source_file: strPath,\n              source_location: `L${line}`, weight: 1.0,\n            });\n          }\n        }\n      }\n    }\n\n    for (const child of node.children) {\n      walkCalls(child, callerNid);\n    }\n  }\n\n  for (const [callerNid, bodyNode] of functionBodies) {\n    walkCalls(bodyNode, callerNid);\n  }\n\n  // -- Clean edges --\n  const validIds = seenIds;\n  const cleanEdges = edges.filter((edge) => {\n    const src = edge.source;\n    const tgt = edge.target;\n    return validIds.has(src) && (validIds.has(tgt) || edge.relation === \"imports\" || edge.relation === \"imports_from\");\n  });\n\n  return { nodes, edges: cleanEdges };\n}\n\n// ---------------------------------------------------------------------------\n// Python rationale extraction\n// ---------------------------------------------------------------------------\n\nconst _RATIONALE_PREFIXES = [\n  \"# NOTE:\", \"# IMPORTANT:\", \"# HACK:\", \"# WHY:\",\n  \"# RATIONALE:\", \"# TODO:\", \"# FIXME:\",\n];\n\nasync function _extractPythonRationale(filePath: string, result: ExtractionResult): Promise<void> {\n  await ensureParserInit();\n  const lang = await loadLanguage(\"python\");\n  if (!lang) return;\n\n  let source: string;\n  let root: SyntaxNode;\n  try {\n    const parser = new Parser();\n    parser.setLanguage(lang);\n    source = readFileSync(filePath, \"utf-8\");\n    const tree = parseText(parser, source);\n    root = tree.rootNode;\n  } catch {\n    return;\n  }\n\n  const stem = basename(filePath, extname(filePath));\n  const strPath = filePath;\n  const { nodes, edges } = result;\n  const seenIds = new Set(nodes.map((n) => n.id));\n  const fileNid = _makeId(stem);\n\n  function getDocstring(bodyNode: SyntaxNode | null): [string, number] | null {\n    if (!bodyNode) return null;\n    for (const child of bodyNode.children) {\n      if (child.type === \"expression_statement\") {\n        for (const sub of child.children) {\n          if (sub.type === \"string\" || sub.type === \"concatenated_string\") {\n            let text = source.slice(sub.startIndex, sub.endIndex);\n            text = text.replace(/^[\"']+|[\"']+$/g, \"\").replace(/^\"\"\"+|\"\"\"+$/g, \"\").replace(/^'''+|'''+$/g, \"\").trim();\n            if (text.length > 20) {\n              return [text, child.startPosition.row + 1];\n            }\n          }\n        }\n      }\n      break;\n    }\n    return null;\n  }\n\n  function addRationale(text: string, line: number, parentNid: string): void {\n    const label = text.slice(0, 80).replace(/\\n/g, \" \").trim();\n    const rid = _makeId(stem, \"rationale\", String(line));\n    if (!seenIds.has(rid)) {\n      seenIds.add(rid);\n      nodes.push({\n        id: rid, label, file_type: \"rationale\" as GraphNode[\"file_type\"],\n        source_file: strPath, source_location: `L${line}`,\n      });\n    }\n    edges.push({\n      source: rid, target: parentNid, relation: \"rationale_for\",\n      confidence: \"EXTRACTED\", source_file: strPath,\n      source_location: `L${line}`, weight: 1.0,\n    });\n  }\n\n  // Module-level docstring\n  const ds = getDocstring(root);\n  if (ds) addRationale(ds[0], ds[1], fileNid);\n\n  // Class and function docstrings\n  function walkDocstrings(node: SyntaxNode, parentNid: string): void {\n    const t = node.type;\n    if (t === \"class_definition\") {\n      const nameNode = node.childForFieldName(\"name\");\n      const body = node.childForFieldName(\"body\");\n      if (nameNode && body) {\n        const className = source.slice(nameNode.startIndex, nameNode.endIndex);\n        const nid = _makeId(stem, className);\n        const classDs = getDocstring(body);\n        if (classDs) addRationale(classDs[0], classDs[1], nid);\n        for (const child of body.children) {\n          walkDocstrings(child, nid);\n        }\n      }\n      return;\n    }\n    if (t === \"function_definition\") {\n      const nameNode = node.childForFieldName(\"name\");\n      const body = node.childForFieldName(\"body\");\n      if (nameNode && body) {\n        const funcName = source.slice(nameNode.startIndex, nameNode.endIndex);\n        const nid = parentNid !== fileNid ? _makeId(parentNid, funcName) : _makeId(stem, funcName);\n        const funcDs = getDocstring(body);\n        if (funcDs) addRationale(funcDs[0], funcDs[1], nid);\n      }\n      return;\n    }\n    for (const child of node.children) {\n      walkDocstrings(child, parentNid);\n    }\n  }\n\n  walkDocstrings(root, fileNid);\n\n  // Rationale comments\n  const lines = source.split(\"\\n\");\n  for (let lineno = 0; lineno < lines.length; lineno++) {\n    const stripped = lines[lineno]!.trim();\n    if (_RATIONALE_PREFIXES.some((p) => stripped.startsWith(p))) {\n      addRationale(stripped, lineno + 1, fileNid);\n    }\n  }\n}\n\n// ---------------------------------------------------------------------------\n// Public API: per-language extractors\n// ---------------------------------------------------------------------------\n\nexport async function extractPython(filePath: string): Promise<ExtractionResult> {\n  const result = await _extractGeneric(filePath, _PYTHON_CONFIG);\n  if (!result.error) {\n    await _extractPythonRationale(filePath, result);\n  }\n  return result;\n}\n\nexport async function extractJs(filePath: string): Promise<ExtractionResult> {\n  const ext = extname(filePath);\n  const config = (ext === \".ts\" || ext === \".tsx\") ? _TS_CONFIG : _JS_CONFIG;\n  return _extractGeneric(filePath, config);\n}\n\nexport async function extractJava(filePath: string): Promise<ExtractionResult> {\n  return _extractGeneric(filePath, _JAVA_CONFIG);\n}\n\nexport async function extractC(filePath: string): Promise<ExtractionResult> {\n  return _extractGeneric(filePath, _C_CONFIG);\n}\n\nexport async function extractCpp(filePath: string): Promise<ExtractionResult> {\n  return _extractGeneric(filePath, _CPP_CONFIG);\n}\n\nexport async function extractRuby(filePath: string): Promise<ExtractionResult> {\n  return _extractGeneric(filePath, _RUBY_CONFIG);\n}\n\nexport async function extractCsharp(filePath: string): Promise<ExtractionResult> {\n  return _extractGeneric(filePath, _CSHARP_CONFIG);\n}\n\nexport async function extractKotlin(filePath: string): Promise<ExtractionResult> {\n  return _extractGeneric(filePath, _KOTLIN_CONFIG);\n}\n\nexport async function extractScala(filePath: string): Promise<ExtractionResult> {\n  return _extractGeneric(filePath, _SCALA_CONFIG);\n}\n\nexport async function extractPhp(filePath: string): Promise<ExtractionResult> {\n  return _extractGeneric(filePath, _PHP_CONFIG);\n}\n\nexport async function extractLua(filePath: string): Promise<ExtractionResult> {\n  return _extractGeneric(filePath, _LUA_CONFIG);\n}\n\nexport async function extractSwift(filePath: string): Promise<ExtractionResult> {\n  return _extractGeneric(filePath, _SWIFT_CONFIG);\n}\n\n// ---------------------------------------------------------------------------\n// Julia extractor (custom walk)\n// ---------------------------------------------------------------------------\n\nexport async function extractJulia(filePath: string): Promise<ExtractionResult> {\n  await ensureParserInit();\n  const lang = await loadLanguage(\"julia\");\n  if (!lang) {\n    return { nodes: [], edges: [], error: \"tree-sitter-julia not available\" };\n  }\n\n  let source: string;\n  let tree: Tree;\n  try {\n    const parser = new Parser();\n    parser.setLanguage(lang);\n    source = readFileSync(filePath, \"utf-8\");\n    tree = parseText(parser, source);\n  } catch (e: unknown) {\n    return { nodes: [], edges: [], error: String(e) };\n  }\n\n  const root = tree.rootNode;\n  const stem = basename(filePath, extname(filePath));\n  const strPath = filePath;\n  const nodes: GraphNode[] = [];\n  const edges: GraphEdge[] = [];\n  const seenIds = new Set<string>();\n  const functionBodies: Array<[string, SyntaxNode]> = [];\n\n  function addNode(nid: string, label: string, line: number): void {\n    if (!seenIds.has(nid)) {\n      seenIds.add(nid);\n      nodes.push({ id: nid, label, file_type: \"code\", source_file: strPath, source_location: `L${line}` });\n    }\n  }\n\n  function addEdge(\n    src: string, tgt: string, relation: string, line: number,\n    confidence: \"EXTRACTED\" | \"INFERRED\" = \"EXTRACTED\", weight: number = 1.0,\n  ): void {\n    edges.push({ source: src, target: tgt, relation, confidence, source_file: strPath, source_location: `L${line}`, weight });\n  }\n\n  const fileNid = _makeId(stem);\n  addNode(fileNid, basename(filePath), 1);\n\n  function funcNameFromSignature(sigNode: SyntaxNode): string | null {\n    for (const child of sigNode.children) {\n      if (child.type === \"call_expression\") {\n        const callee = child.children[0] ?? null;\n        if (callee && callee.type === \"identifier\") {\n          return _readText(callee, source);\n        }\n      }\n    }\n    return null;\n  }\n\n  function walkCalls(bodyNode: SyntaxNode, funcNid: string): void {\n    if (!bodyNode) return;\n    const t = bodyNode.type;\n    if (t === \"function_definition\" || t === \"short_function_definition\") return;\n    if (t === \"call_expression\" && bodyNode.children.length > 0) {\n      const callee = bodyNode.children[0]!;\n      if (callee.type === \"identifier\") {\n        const calleeName = _readText(callee, source);\n        const targetNid = _makeId(stem, calleeName);\n        addEdge(funcNid, targetNid, \"calls\", bodyNode.startPosition.row + 1, \"EXTRACTED\");\n      } else if (callee.type === \"field_expression\" && callee.children.length >= 3) {\n        const methodNode = callee.children[callee.children.length - 1]!;\n        const methodName = _readText(methodNode, source);\n        const targetNid = _makeId(stem, methodName);\n        addEdge(funcNid, targetNid, \"calls\", bodyNode.startPosition.row + 1, \"EXTRACTED\");\n      }\n    }\n    for (const child of bodyNode.children) {\n      walkCalls(child, funcNid);\n    }\n  }\n\n  function walk(node: SyntaxNode, scopeNid: string): void {\n    const t = node.type;\n\n    // Module\n    if (t === \"module_definition\") {\n      const nameNode = node.children.find((c) => c.type === \"identifier\") ?? null;\n      if (nameNode) {\n        const modName = _readText(nameNode, source);\n        const modNid = _makeId(stem, modName);\n        const line = node.startPosition.row + 1;\n        addNode(modNid, modName, line);\n        addEdge(fileNid, modNid, \"defines\", line);\n        for (const child of node.children) {\n          walk(child, modNid);\n        }\n      }\n      return;\n    }\n\n    // Struct\n    if (t === \"struct_definition\") {\n      const typeHead = node.children.find((c) => c.type === \"type_head\") ?? null;\n      if (typeHead) {\n        const binExpr = typeHead.children.find((c) => c.type === \"binary_expression\") ?? null;\n        if (binExpr) {\n          const identifiers = binExpr.children.filter((c) => c.type === \"identifier\");\n          if (identifiers.length > 0) {\n            const structName = _readText(identifiers[0]!, source);\n            const structNid = _makeId(stem, structName);\n            const line = node.startPosition.row + 1;\n            addNode(structNid, structName, line);\n            addEdge(scopeNid, structNid, \"defines\", line);\n            if (identifiers.length >= 2) {\n              const superName = _readText(identifiers[identifiers.length - 1]!, source);\n              addEdge(structNid, _makeId(stem, superName), \"inherits\", line, \"EXTRACTED\");\n            }\n          }\n        } else {\n          const nameNode = typeHead.children.find((c) => c.type === \"identifier\") ?? null;\n          if (nameNode) {\n            const structName = _readText(nameNode, source);\n            const structNid = _makeId(stem, structName);\n            const line = node.startPosition.row + 1;\n            addNode(structNid, structName, line);\n            addEdge(scopeNid, structNid, \"defines\", line);\n          }\n        }\n      }\n      return;\n    }\n\n    // Abstract type\n    if (t === \"abstract_definition\") {\n      const typeHead = node.children.find((c) => c.type === \"type_head\") ?? null;\n      if (typeHead) {\n        const nameNode = typeHead.children.find((c) => c.type === \"identifier\") ?? null;\n        if (nameNode) {\n          const absName = _readText(nameNode, source);\n          const absNid = _makeId(stem, absName);\n          const line = node.startPosition.row + 1;\n          addNode(absNid, absName, line);\n          addEdge(scopeNid, absNid, \"defines\", line);\n        }\n      }\n      return;\n    }\n\n    // Function: function foo(...) ... end\n    if (t === \"function_definition\") {\n      const sigNode = node.children.find((c) => c.type === \"signature\") ?? null;\n      if (sigNode) {\n        const funcName = funcNameFromSignature(sigNode);\n        if (funcName) {\n          const funcNid = _makeId(stem, funcName);\n          const line = node.startPosition.row + 1;\n          addNode(funcNid, `${funcName}()`, line);\n          addEdge(scopeNid, funcNid, \"defines\", line);\n          functionBodies.push([funcNid, node]);\n        }\n      }\n      return;\n    }\n\n    // Short function: foo(x) = expr\n    if (t === \"assignment\") {\n      const lhs = node.children[0] ?? null;\n      if (lhs && lhs.type === \"call_expression\" && lhs.children.length > 0) {\n        const callee = lhs.children[0]!;\n        if (callee.type === \"identifier\") {\n          const funcName = _readText(callee, source);\n          const funcNid = _makeId(stem, funcName);\n          const line = node.startPosition.row + 1;\n          addNode(funcNid, `${funcName}()`, line);\n          addEdge(scopeNid, funcNid, \"defines\", line);\n          const rhs = node.children.length >= 3 ? node.children[node.children.length - 1]! : null;\n          if (rhs) {\n            functionBodies.push([funcNid, rhs]);\n          }\n        }\n      }\n      return;\n    }\n\n    // Using / Import\n    if (t === \"using_statement\" || t === \"import_statement\") {\n      const line = node.startPosition.row + 1;\n      for (const child of node.children) {\n        if (child.type === \"identifier\") {\n          const modName = _readText(child, source);\n          const impNid = _makeId(modName);\n          addNode(impNid, modName, line);\n          addEdge(scopeNid, impNid, \"imports\", line);\n        } else if (child.type === \"selected_import\") {\n          const identifiers = child.children.filter((c) => c.type === \"identifier\");\n          if (identifiers.length > 0) {\n            const pkgName = _readText(identifiers[0]!, source);\n            const pkgNid = _makeId(pkgName);\n            addNode(pkgNid, pkgName, line);\n            addEdge(scopeNid, pkgNid, \"imports\", line);\n          }\n        }\n      }\n      return;\n    }\n\n    for (const child of node.children) {\n      walk(child, scopeNid);\n    }\n  }\n\n  walk(root, fileNid);\n\n  for (const [funcNid, bodyNode] of functionBodies) {\n    if (bodyNode.type === \"function_definition\") {\n      for (const child of bodyNode.children) {\n        if (child.type !== \"signature\") {\n          walkCalls(child, funcNid);\n        }\n      }\n    } else {\n      walkCalls(bodyNode, funcNid);\n    }\n  }\n\n  return { nodes, edges };\n}\n\n// ---------------------------------------------------------------------------\n// Go extractor (custom walk)\n// ---------------------------------------------------------------------------\n\nexport async function extractGo(filePath: string): Promise<ExtractionResult> {\n  await ensureParserInit();\n  const lang = await loadLanguage(\"go\");\n  if (!lang) {\n    return { nodes: [], edges: [], error: \"tree-sitter-go not available\" };\n  }\n\n  let source: string;\n  let tree: Tree;\n  try {\n    const parser = new Parser();\n    parser.setLanguage(lang);\n    source = readFileSync(filePath, \"utf-8\");\n    tree = parseText(parser, source);\n  } catch (e: unknown) {\n    return { nodes: [], edges: [], error: String(e) };\n  }\n\n  const root = tree.rootNode;\n  const stem = basename(filePath, extname(filePath));\n  const pkgScope = dirname(filePath).split(sep).pop() || stem;\n  const strPath = filePath;\n  const nodes: GraphNode[] = [];\n  const edges: GraphEdge[] = [];\n  const seenIds = new Set<string>();\n  const functionBodies: Array<[string, SyntaxNode]> = [];\n\n  function addNode(nid: string, label: string, line: number): void {\n    if (!seenIds.has(nid)) {\n      seenIds.add(nid);\n      nodes.push({ id: nid, label, file_type: \"code\", source_file: strPath, source_location: `L${line}` });\n    }\n  }\n\n  function addEdge(\n    src: string, tgt: string, relation: string, line: number,\n    confidence: \"EXTRACTED\" | \"INFERRED\" = \"EXTRACTED\", weight: number = 1.0,\n  ): void {\n    edges.push({ source: src, target: tgt, relation, confidence, source_file: strPath, source_location: `L${line}`, weight });\n  }\n\n  const fileNid = _makeId(stem);\n  addNode(fileNid, basename(filePath), 1);\n\n  function walk(node: SyntaxNode): void {\n    const t = node.type;\n\n    if (t === \"function_declaration\") {\n      const nameNode = node.childForFieldName(\"name\");\n      if (nameNode) {\n        const funcName = _readText(nameNode, source);\n        const line = node.startPosition.row + 1;\n        const funcNid = _makeId(stem, funcName);\n        addNode(funcNid, `${funcName}()`, line);\n        addEdge(fileNid, funcNid, \"contains\", line);\n        const body = node.childForFieldName(\"body\");\n        if (body) functionBodies.push([funcNid, body]);\n      }\n      return;\n    }\n\n    if (t === \"method_declaration\") {\n      const receiver = node.childForFieldName(\"receiver\");\n      let receiverType: string | null = null;\n      if (receiver) {\n        for (const param of receiver.children) {\n          if (param.type === \"parameter_declaration\") {\n            const typeNode = param.childForFieldName(\"type\");\n            if (typeNode) {\n              receiverType = _readText(typeNode, source).replace(/^\\*/, \"\").trim();\n            }\n            break;\n          }\n        }\n      }\n      const nameNode = node.childForFieldName(\"name\");\n      if (nameNode) {\n        const methodName = _readText(nameNode, source);\n        const line = node.startPosition.row + 1;\n        let methodNid: string;\n        if (receiverType) {\n          const parentNid = _makeId(pkgScope, receiverType);\n          addNode(parentNid, receiverType, line);\n          methodNid = _makeId(parentNid, methodName);\n          addNode(methodNid, `.${methodName}()`, line);\n          addEdge(parentNid, methodNid, \"method\", line);\n        } else {\n          methodNid = _makeId(stem, methodName);\n          addNode(methodNid, `${methodName}()`, line);\n          addEdge(fileNid, methodNid, \"contains\", line);\n        }\n        const body = node.childForFieldName(\"body\");\n        if (body) functionBodies.push([methodNid, body]);\n      }\n      return;\n    }\n\n    if (t === \"type_declaration\") {\n      for (const child of node.children) {\n        if (child.type === \"type_spec\") {\n          const nameNode = child.childForFieldName(\"name\");\n          if (nameNode) {\n            const typeName = _readText(nameNode, source);\n            const line = child.startPosition.row + 1;\n            const typeNid = _makeId(pkgScope, typeName);\n            addNode(typeNid, typeName, line);\n            addEdge(fileNid, typeNid, \"contains\", line);\n          }\n        }\n      }\n      return;\n    }\n\n    if (t === \"import_declaration\") {\n      for (const child of node.children) {\n        if (child.type === \"import_spec_list\") {\n          for (const spec of child.children) {\n            if (spec.type === \"import_spec\") {\n              const pathNode = spec.childForFieldName(\"path\");\n              if (pathNode) {\n                const raw = _readText(pathNode, source).replace(/^\"|\"$/g, \"\");\n                const moduleName = raw.split(\"/\").pop()!;\n                const tgtNid = _makeId(moduleName);\n                addEdge(fileNid, tgtNid, \"imports_from\", spec.startPosition.row + 1);\n              }\n            }\n          }\n        } else if (child.type === \"import_spec\") {\n          const pathNode = child.childForFieldName(\"path\");\n          if (pathNode) {\n            const raw = _readText(pathNode, source).replace(/^\"|\"$/g, \"\");\n            const moduleName = raw.split(\"/\").pop()!;\n            const tgtNid = _makeId(moduleName);\n            addEdge(fileNid, tgtNid, \"imports_from\", child.startPosition.row + 1);\n          }\n        }\n      }\n      return;\n    }\n\n    for (const child of node.children) {\n      walk(child);\n    }\n  }\n\n  walk(root);\n\n  // Call-graph pass\n  const labelToNid = new Map<string, string>();\n  for (const n of nodes) {\n    const normalised = n.label.replace(/\\(?\\)$/g, \"\").replace(/^\\./, \"\");\n    labelToNid.set(normalised.toLowerCase(), n.id);\n  }\n\n  const seenCallPairs = new Set<string>();\n\n  function walkCalls(node: SyntaxNode, callerNid: string): void {\n    if (node.type === \"function_declaration\" || node.type === \"method_declaration\") return;\n    if (node.type === \"call_expression\") {\n      const funcNode = node.childForFieldName(\"function\");\n      let calleeName: string | null = null;\n      if (funcNode) {\n        if (funcNode.type === \"identifier\") {\n          calleeName = _readText(funcNode, source);\n        } else if (funcNode.type === \"selector_expression\") {\n          const field = funcNode.childForFieldName(\"field\");\n          if (field) calleeName = _readText(field, source);\n        }\n      }\n      if (calleeName) {\n        const tgtNid = labelToNid.get(calleeName.toLowerCase());\n        if (tgtNid && tgtNid !== callerNid) {\n          const pair = `${callerNid}|${tgtNid}`;\n          if (!seenCallPairs.has(pair)) {\n            seenCallPairs.add(pair);\n            const line = node.startPosition.row + 1;\n            edges.push({\n              source: callerNid, target: tgtNid, relation: \"calls\",\n              confidence: \"EXTRACTED\", source_file: strPath,\n              source_location: `L${line}`, weight: 1.0,\n            });\n          }\n        }\n      }\n    }\n    for (const child of node.children) {\n      walkCalls(child, callerNid);\n    }\n  }\n\n  for (const [callerNid, bodyNode] of functionBodies) {\n    walkCalls(bodyNode, callerNid);\n  }\n\n  const cleanEdges = edges.filter((e) =>\n    seenIds.has(e.source) && (seenIds.has(e.target) || e.relation === \"imports\" || e.relation === \"imports_from\"),\n  );\n\n  return { nodes, edges: cleanEdges };\n}\n\n// ---------------------------------------------------------------------------\n// Rust extractor (custom walk)\n// ---------------------------------------------------------------------------\n\nexport async function extractRust(filePath: string): Promise<ExtractionResult> {\n  await ensureParserInit();\n  const lang = await loadLanguage(\"rust\");\n  if (!lang) {\n    return { nodes: [], edges: [], error: \"tree-sitter-rust not available\" };\n  }\n\n  let source: string;\n  let tree: Tree;\n  try {\n    const parser = new Parser();\n    parser.setLanguage(lang);\n    source = readFileSync(filePath, \"utf-8\");\n    tree = parseText(parser, source);\n  } catch (e: unknown) {\n    return { nodes: [], edges: [], error: String(e) };\n  }\n\n  const root = tree.rootNode;\n  const stem = basename(filePath, extname(filePath));\n  const strPath = filePath;\n  const nodes: GraphNode[] = [];\n  const edges: GraphEdge[] = [];\n  const seenIds = new Set<string>();\n  const functionBodies: Array<[string, SyntaxNode]> = [];\n\n  function addNode(nid: string, label: string, line: number): void {\n    if (!seenIds.has(nid)) {\n      seenIds.add(nid);\n      nodes.push({ id: nid, label, file_type: \"code\", source_file: strPath, source_location: `L${line}` });\n    }\n  }\n\n  function addEdge(\n    src: string, tgt: string, relation: string, line: number,\n    confidence: \"EXTRACTED\" | \"INFERRED\" = \"EXTRACTED\", weight: number = 1.0,\n  ): void {\n    edges.push({ source: src, target: tgt, relation, confidence, source_file: strPath, source_location: `L${line}`, weight });\n  }\n\n  const fileNid = _makeId(stem);\n  addNode(fileNid, basename(filePath), 1);\n\n  function walk(node: SyntaxNode, parentImplNid: string | null = null): void {\n    const t = node.type;\n\n    if (t === \"function_item\") {\n      const nameNode = node.childForFieldName(\"name\");\n      if (nameNode) {\n        const funcName = _readText(nameNode, source);\n        const line = node.startPosition.row + 1;\n        let funcNid: string;\n        if (parentImplNid) {\n          funcNid = _makeId(parentImplNid, funcName);\n          addNode(funcNid, `.${funcName}()`, line);\n          addEdge(parentImplNid, funcNid, \"method\", line);\n        } else {\n          funcNid = _makeId(stem, funcName);\n          addNode(funcNid, `${funcName}()`, line);\n          addEdge(fileNid, funcNid, \"contains\", line);\n        }\n        const body = node.childForFieldName(\"body\");\n        if (body) functionBodies.push([funcNid, body]);\n      }\n      return;\n    }\n\n    if (t === \"struct_item\" || t === \"enum_item\" || t === \"trait_item\") {\n      const nameNode = node.childForFieldName(\"name\");\n      if (nameNode) {\n        const itemName = _readText(nameNode, source);\n        const line = node.startPosition.row + 1;\n        const itemNid = _makeId(stem, itemName);\n        addNode(itemNid, itemName, line);\n        addEdge(fileNid, itemNid, \"contains\", line);\n      }\n      return;\n    }\n\n    if (t === \"impl_item\") {\n      const typeNode = node.childForFieldName(\"type\");\n      let implNid: string | null = null;\n      if (typeNode) {\n        const typeName = _readText(typeNode, source).trim();\n        implNid = _makeId(stem, typeName);\n        addNode(implNid, typeName, node.startPosition.row + 1);\n      }\n      const body = node.childForFieldName(\"body\");\n      if (body) {\n        for (const child of body.children) {\n          walk(child, implNid);\n        }\n      }\n      return;\n    }\n\n    if (t === \"use_declaration\") {\n      const arg = node.childForFieldName(\"argument\");\n      if (arg) {\n        const raw = _readText(arg, source);\n        const clean = raw.split(\"{\")[0]!.replace(/:+$/, \"\").replace(/\\*$/, \"\").replace(/:+$/, \"\");\n        const moduleName = clean.split(\"::\").pop()!.trim();\n        if (moduleName) {\n          const tgtNid = _makeId(moduleName);\n          addEdge(fileNid, tgtNid, \"imports_from\", node.startPosition.row + 1);\n        }\n      }\n      return;\n    }\n\n    for (const child of node.children) {\n      walk(child, null);\n    }\n  }\n\n  walk(root);\n\n  // Call-graph pass\n  const labelToNid = new Map<string, string>();\n  for (const n of nodes) {\n    const normalised = n.label.replace(/\\(?\\)$/g, \"\").replace(/^\\./, \"\");\n    labelToNid.set(normalised.toLowerCase(), n.id);\n  }\n\n  const seenCallPairs = new Set<string>();\n\n  function walkCalls(node: SyntaxNode, callerNid: string): void {\n    if (node.type === \"function_item\") return;\n    if (node.type === \"call_expression\") {\n      const funcNode = node.childForFieldName(\"function\");\n      let calleeName: string | null = null;\n      if (funcNode) {\n        if (funcNode.type === \"identifier\") {\n          calleeName = _readText(funcNode, source);\n        } else if (funcNode.type === \"field_expression\") {\n          const field = funcNode.childForFieldName(\"field\");\n          if (field) calleeName = _readText(field, source);\n        } else if (funcNode.type === \"scoped_identifier\") {\n          const name = funcNode.childForFieldName(\"name\");\n          if (name) calleeName = _readText(name, source);\n        }\n      }\n      if (calleeName) {\n        const tgtNid = labelToNid.get(calleeName.toLowerCase());\n        if (tgtNid && tgtNid !== callerNid) {\n          const pair = `${callerNid}|${tgtNid}`;\n          if (!seenCallPairs.has(pair)) {\n            seenCallPairs.add(pair);\n            const line = node.startPosition.row + 1;\n            edges.push({\n              source: callerNid, target: tgtNid, relation: \"calls\",\n              confidence: \"EXTRACTED\", source_file: strPath,\n              source_location: `L${line}`, weight: 1.0,\n            });\n          }\n        }\n      }\n    }\n    for (const child of node.children) {\n      walkCalls(child, callerNid);\n    }\n  }\n\n  for (const [callerNid, bodyNode] of functionBodies) {\n    walkCalls(bodyNode, callerNid);\n  }\n\n  const cleanEdges = edges.filter((e) =>\n    seenIds.has(e.source) && (seenIds.has(e.target) || e.relation === \"imports\" || e.relation === \"imports_from\"),\n  );\n\n  return { nodes, edges: cleanEdges };\n}\n\n// ---------------------------------------------------------------------------\n// Zig extractor (custom walk)\n// ---------------------------------------------------------------------------\n\nexport async function extractZig(filePath: string): Promise<ExtractionResult> {\n  await ensureParserInit();\n  const lang = await loadLanguage(\"zig\");\n  if (!lang) {\n    return { nodes: [], edges: [], error: \"tree-sitter-zig not available\" };\n  }\n\n  let source: string;\n  let tree: Tree;\n  try {\n    const parser = new Parser();\n    parser.setLanguage(lang);\n    source = readFileSync(filePath, \"utf-8\");\n    tree = parseText(parser, source);\n  } catch (e: unknown) {\n    return { nodes: [], edges: [], error: String(e) };\n  }\n\n  const root = tree.rootNode;\n  const stem = basename(filePath, extname(filePath));\n  const strPath = filePath;\n  const nodes: GraphNode[] = [];\n  const edges: GraphEdge[] = [];\n  const seenIds = new Set<string>();\n  const functionBodies: Array<[string, SyntaxNode]> = [];\n\n  function addNode(nid: string, label: string, line: number): void {\n    if (!seenIds.has(nid)) {\n      seenIds.add(nid);\n      nodes.push({ id: nid, label, file_type: \"code\", source_file: strPath, source_location: `L${line}` });\n    }\n  }\n\n  function addEdge(\n    src: string, tgt: string, relation: string, line: number,\n    confidence: \"EXTRACTED\" | \"INFERRED\" = \"EXTRACTED\", weight: number = 1.0,\n  ): void {\n    edges.push({ source: src, target: tgt, relation, confidence, source_file: strPath, source_location: `L${line}`, weight });\n  }\n\n  const fileNid = _makeId(stem);\n  addNode(fileNid, basename(filePath), 1);\n\n  function extractImport(node: SyntaxNode): void {\n    for (const child of node.children) {\n      if (child.type === \"builtin_function\") {\n        let bi: string | null = null;\n        let args: SyntaxNode | null = null;\n        for (const c of child.children) {\n          if (c.type === \"builtin_identifier\") bi = _readText(c, source);\n          else if (c.type === \"arguments\") args = c;\n        }\n        if ((bi === \"@import\" || bi === \"@cImport\") && args) {\n          for (const arg of args.children) {\n            if (arg.type === \"string_literal\" || arg.type === \"string\") {\n              const raw = _readText(arg, source).replace(/^\"|\"$/g, \"\");\n              const moduleName = raw.split(\"/\").pop()!.split(\".\")[0]!;\n              if (moduleName) {\n                const tgtNid = _makeId(moduleName);\n                addEdge(fileNid, tgtNid, \"imports_from\", node.startPosition.row + 1);\n              }\n              return;\n            }\n          }\n        }\n      } else if (child.type === \"field_expression\") {\n        extractImport(child);\n        return;\n      }\n    }\n  }\n\n  function walk(node: SyntaxNode, parentStructNid: string | null = null): void {\n    const t = node.type;\n\n    if (t === \"function_declaration\") {\n      const nameNode = node.childForFieldName(\"name\");\n      if (nameNode) {\n        const funcName = _readText(nameNode, source);\n        const line = node.startPosition.row + 1;\n        let funcNid: string;\n        if (parentStructNid) {\n          funcNid = _makeId(parentStructNid, funcName);\n          addNode(funcNid, `.${funcName}()`, line);\n          addEdge(parentStructNid, funcNid, \"method\", line);\n        } else {\n          funcNid = _makeId(stem, funcName);\n          addNode(funcNid, `${funcName}()`, line);\n          addEdge(fileNid, funcNid, \"contains\", line);\n        }\n        const body = node.childForFieldName(\"body\");\n        if (body) functionBodies.push([funcNid, body]);\n      }\n      return;\n    }\n\n    if (t === \"variable_declaration\") {\n      let nameNode: SyntaxNode | null = null;\n      let valueNode: SyntaxNode | null = null;\n      for (const child of node.children) {\n        if (child.type === \"identifier\") {\n          nameNode = child;\n        } else if ([\"struct_declaration\", \"enum_declaration\", \"union_declaration\", \"builtin_function\", \"field_expression\"].includes(child.type)) {\n          valueNode = child;\n        }\n      }\n\n      if (valueNode && valueNode.type === \"struct_declaration\") {\n        if (nameNode) {\n          const structName = _readText(nameNode, source);\n          const line = node.startPosition.row + 1;\n          const structNid = _makeId(stem, structName);\n          addNode(structNid, structName, line);\n          addEdge(fileNid, structNid, \"contains\", line);\n          for (const child of valueNode.children) {\n            walk(child, structNid);\n          }\n        }\n        return;\n      }\n\n      if (valueNode && (valueNode.type === \"enum_declaration\" || valueNode.type === \"union_declaration\")) {\n        if (nameNode) {\n          const typeName = _readText(nameNode, source);\n          const line = node.startPosition.row + 1;\n          const typeNid = _makeId(stem, typeName);\n          addNode(typeNid, typeName, line);\n          addEdge(fileNid, typeNid, \"contains\", line);\n        }\n        return;\n      }\n\n      if (valueNode && (valueNode.type === \"builtin_function\" || valueNode.type === \"field_expression\")) {\n        extractImport(node);\n      }\n      return;\n    }\n\n    for (const child of node.children) {\n      walk(child, parentStructNid);\n    }\n  }\n\n  walk(root);\n\n  // Call-graph pass\n  const seenCallPairs = new Set<string>();\n\n  function walkCalls(node: SyntaxNode, callerNid: string): void {\n    if (node.type === \"function_declaration\") return;\n    if (node.type === \"call_expression\") {\n      const fn = node.childForFieldName(\"function\");\n      if (fn) {\n        const callee = _readText(fn, source).split(\".\").pop()!;\n        const tgtNid = nodes.find(\n          (n) => n.label === `${callee}()` || n.label === `.${callee}()`,\n        )?.id ?? null;\n        if (tgtNid && tgtNid !== callerNid) {\n          const pair = `${callerNid}|${tgtNid}`;\n          if (!seenCallPairs.has(pair)) {\n            seenCallPairs.add(pair);\n            addEdge(callerNid, tgtNid, \"calls\", node.startPosition.row + 1, \"EXTRACTED\", 1.0);\n          }\n        }\n      }\n    }\n    for (const child of node.children) {\n      walkCalls(child, callerNid);\n    }\n  }\n\n  for (const [callerNid, bodyNode] of functionBodies) {\n    walkCalls(bodyNode, callerNid);\n  }\n\n  const cleanEdges = edges.filter((e) =>\n    seenIds.has(e.source) && (seenIds.has(e.target) || e.relation === \"imports_from\"),\n  );\n\n  return { nodes, edges: cleanEdges };\n}\n\n// ---------------------------------------------------------------------------\n// PowerShell extractor (custom walk)\n// ---------------------------------------------------------------------------\n\nexport async function extractPowershell(filePath: string): Promise<ExtractionResult> {\n  await ensureParserInit();\n  const lang = await loadLanguage(\"powershell\");\n  if (!lang) {\n    return { nodes: [], edges: [], error: \"tree-sitter-powershell not available\" };\n  }\n\n  let source: string;\n  let tree: Tree;\n  try {\n    const parser = new Parser();\n    parser.setLanguage(lang);\n    source = readFileSync(filePath, \"utf-8\");\n    tree = parseText(parser, source);\n  } catch (e: unknown) {\n    return { nodes: [], edges: [], error: String(e) };\n  }\n\n  const root = tree.rootNode;\n  const stem = basename(filePath, extname(filePath));\n  const strPath = filePath;\n  const nodes: GraphNode[] = [];\n  const edges: GraphEdge[] = [];\n  const seenIds = new Set<string>();\n  const functionBodies: Array<[string, SyntaxNode]> = [];\n\n  function addNode(nid: string, label: string, line: number): void {\n    if (!seenIds.has(nid)) {\n      seenIds.add(nid);\n      nodes.push({ id: nid, label, file_type: \"code\", source_file: strPath, source_location: `L${line}` });\n    }\n  }\n\n  function addEdge(\n    src: string, tgt: string, relation: string, line: number,\n    confidence: \"EXTRACTED\" | \"INFERRED\" = \"EXTRACTED\", weight: number = 1.0,\n  ): void {\n    edges.push({ source: src, target: tgt, relation, confidence, source_file: strPath, source_location: `L${line}`, weight });\n  }\n\n  const fileNid = _makeId(stem);\n  addNode(fileNid, basename(filePath), 1);\n\n  const _PS_SKIP = new Set([\n    \"using\", \"return\", \"if\", \"else\", \"elseif\", \"foreach\", \"for\",\n    \"while\", \"do\", \"switch\", \"try\", \"catch\", \"finally\", \"throw\",\n    \"break\", \"continue\", \"exit\", \"param\", \"begin\", \"process\", \"end\",\n  ]);\n\n  function findScriptBlockBody(node: SyntaxNode): SyntaxNode | null {\n    for (const child of node.children) {\n      if (child.type === \"script_block\") {\n        for (const sc of child.children) {\n          if (sc.type === \"script_block_body\") return sc;\n        }\n        return child;\n      }\n    }\n    return null;\n  }\n\n  function walk(node: SyntaxNode, parentClassNid: string | null = null): void {\n    const t = node.type;\n\n    if (t === \"function_statement\") {\n      const nameNode = node.children.find((c) => c.type === \"function_name\") ?? null;\n      if (nameNode) {\n        const funcName = _readText(nameNode, source);\n        const line = node.startPosition.row + 1;\n        const funcNid = _makeId(stem, funcName);\n        addNode(funcNid, `${funcName}()`, line);\n        addEdge(fileNid, funcNid, \"contains\", line);\n        const body = findScriptBlockBody(node);\n        if (body) functionBodies.push([funcNid, body]);\n      }\n      return;\n    }\n\n    if (t === \"class_statement\") {\n      const nameNode = node.children.find((c) => c.type === \"simple_name\") ?? null;\n      if (nameNode) {\n        const className = _readText(nameNode, source);\n        const line = node.startPosition.row + 1;\n        const classNid = _makeId(stem, className);\n        addNode(classNid, className, line);\n        addEdge(fileNid, classNid, \"contains\", line);\n        for (const child of node.children) {\n          walk(child, classNid);\n        }\n      }\n      return;\n    }\n\n    if (t === \"class_method_definition\") {\n      const nameNode = node.children.find((c) => c.type === \"simple_name\") ?? null;\n      if (nameNode) {\n        const methodName = _readText(nameNode, source);\n        const line = node.startPosition.row + 1;\n        let methodNid: string;\n        if (parentClassNid) {\n          methodNid = _makeId(parentClassNid, methodName);\n          addNode(methodNid, `.${methodName}()`, line);\n          addEdge(parentClassNid, methodNid, \"method\", line);\n        } else {\n          methodNid = _makeId(stem, methodName);\n          addNode(methodNid, `${methodName}()`, line);\n          addEdge(fileNid, methodNid, \"contains\", line);\n        }\n        const body = findScriptBlockBody(node);\n        if (body) functionBodies.push([methodNid, body]);\n      }\n      return;\n    }\n\n    if (t === \"command\") {\n      const cmdNameNode = node.children.find((c) => c.type === \"command_name\") ?? null;\n      if (cmdNameNode) {\n        const cmdText = _readText(cmdNameNode, source).toLowerCase();\n        if (cmdText === \"using\") {\n          const tokens: string[] = [];\n          for (const child of node.children) {\n            if (child.type === \"command_elements\") {\n              for (const el of child.children) {\n                if (el.type === \"generic_token\") {\n                  tokens.push(_readText(el, source));\n                }\n              }\n            }\n          }\n          const moduleTokens = tokens.filter(\n            (tk) => ![\"namespace\", \"module\", \"assembly\"].includes(tk.toLowerCase()),\n          );\n          if (moduleTokens.length > 0) {\n            const moduleName = moduleTokens[moduleTokens.length - 1]!.split(\".\").pop()!;\n            addEdge(fileNid, _makeId(moduleName), \"imports_from\", node.startPosition.row + 1);\n          }\n        }\n      }\n      return;\n    }\n\n    for (const child of node.children) {\n      walk(child, parentClassNid);\n    }\n  }\n\n  walk(root);\n\n  // Call-graph pass\n  const labelToNid = new Map<string, string>();\n  for (const n of nodes) {\n    const normalised = n.label.replace(/\\(?\\)$/g, \"\").replace(/^\\./, \"\");\n    labelToNid.set(normalised.toLowerCase(), n.id);\n  }\n\n  const seenCallPairs = new Set<string>();\n\n  function walkCalls(node: SyntaxNode, callerNid: string): void {\n    if (node.type === \"function_statement\" || node.type === \"class_statement\") return;\n    if (node.type === \"command\") {\n      const cmdNameNode = node.children.find((c) => c.type === \"command_name\") ?? null;\n      if (cmdNameNode) {\n        const cmdText = _readText(cmdNameNode, source);\n        if (!_PS_SKIP.has(cmdText.toLowerCase())) {\n          const tgtNid = labelToNid.get(cmdText.toLowerCase());\n          if (tgtNid && tgtNid !== callerNid) {\n            const pair = `${callerNid}|${tgtNid}`;\n            if (!seenCallPairs.has(pair)) {\n              seenCallPairs.add(pair);\n              addEdge(callerNid, tgtNid, \"calls\", node.startPosition.row + 1, \"EXTRACTED\", 1.0);\n            }\n          }\n        }\n      }\n    }\n    for (const child of node.children) {\n      walkCalls(child, callerNid);\n    }\n  }\n\n  for (const [callerNid, bodyNode] of functionBodies) {\n    walkCalls(bodyNode, callerNid);\n  }\n\n  const cleanEdges = edges.filter((e) =>\n    seenIds.has(e.source) && (seenIds.has(e.target) || e.relation === \"imports_from\"),\n  );\n\n  return { nodes, edges: cleanEdges };\n}\n\n// ---------------------------------------------------------------------------\n// Objective-C extractor (custom walk)\n// ---------------------------------------------------------------------------\n\nexport async function extractObjc(filePath: string): Promise<ExtractionResult> {\n  await ensureParserInit();\n  const lang = await loadLanguage(\"objc\");\n  if (!lang) {\n    return { nodes: [], edges: [], error: \"tree-sitter-objc not available\" };\n  }\n\n  let source: string;\n  let tree: Tree;\n  try {\n    const parser = new Parser();\n    parser.setLanguage(lang);\n    source = readFileSync(filePath, \"utf-8\");\n    tree = parseText(parser, source);\n  } catch (e: unknown) {\n    return { nodes: [], edges: [], error: String(e) };\n  }\n\n  const root = tree.rootNode;\n  const stem = basename(filePath, extname(filePath));\n  const strPath = filePath;\n  const nodes: GraphNode[] = [];\n  const edges: GraphEdge[] = [];\n  const seenIds = new Set<string>();\n  const methodBodies: Array<[string, SyntaxNode]> = [];\n\n  function addNode(nid: string, label: string, line: number): void {\n    if (!seenIds.has(nid)) {\n      seenIds.add(nid);\n      nodes.push({ id: nid, label, file_type: \"code\", source_file: strPath, source_location: `L${line}` });\n    }\n  }\n\n  function addEdge(\n    src: string, tgt: string, relation: string, line: number,\n    confidence: \"EXTRACTED\" | \"INFERRED\" = \"EXTRACTED\", weight: number = 1.0,\n  ): void {\n    edges.push({ source: src, target: tgt, relation, confidence, source_file: strPath, source_location: `L${line}`, weight });\n  }\n\n  const fileNid = _makeId(stem);\n  addNode(fileNid, basename(filePath), 1);\n\n  function _read(node: SyntaxNode): string {\n    return source.slice(node.startIndex, node.endIndex);\n  }\n\n  function walk(node: SyntaxNode, parentNid: string | null = null): void {\n    const t = node.type;\n    const line = node.startPosition.row + 1;\n\n    if (t === \"preproc_include\") {\n      for (const child of node.children) {\n        if (child.type === \"system_lib_string\") {\n          const raw = _read(child).replace(/^[<>]+|[<>]+$/g, \"\");\n          const module = raw.split(\"/\").pop()!.replace(\".h\", \"\");\n          if (module) {\n            const tgtNid = _makeId(module);\n            addEdge(fileNid, tgtNid, \"imports\", line);\n          }\n        } else if (child.type === \"string_literal\") {\n          for (const sub of child.children) {\n            if (sub.type === \"string_content\") {\n              const raw = _read(sub);\n              const module = raw.split(\"/\").pop()!.replace(\".h\", \"\");\n              if (module) {\n                const tgtNid = _makeId(module);\n                addEdge(fileNid, tgtNid, \"imports\", line);\n              }\n            }\n          }\n        }\n      }\n      return;\n    }\n\n    if (t === \"class_interface\") {\n      const identifiers = node.children.filter((c) => c.type === \"identifier\");\n      if (identifiers.length === 0) {\n        for (const child of node.children) walk(child, parentNid);\n        return;\n      }\n      const name = _read(identifiers[0]!);\n      const clsNid = _makeId(stem, name);\n      addNode(clsNid, name, line);\n      addEdge(fileNid, clsNid, \"contains\", line);\n      // superclass is second identifier after ':'\n      let colonSeen = false;\n      for (const child of node.children) {\n        if (child.type === \":\") {\n          colonSeen = true;\n        } else if (colonSeen && child.type === \"identifier\") {\n          const superNid = _makeId(_read(child));\n          addEdge(clsNid, superNid, \"inherits\", line);\n          colonSeen = false;\n        } else if (child.type === \"parameterized_arguments\") {\n          for (const sub of child.children) {\n            if (sub.type === \"type_name\") {\n              for (const s of sub.children) {\n                if (s.type === \"type_identifier\") {\n                  const protoNid = _makeId(_read(s));\n                  addEdge(clsNid, protoNid, \"imports\", line);\n                }\n              }\n            }\n          }\n        } else if (child.type === \"method_declaration\") {\n          walk(child, clsNid);\n        }\n      }\n      return;\n    }\n\n    if (t === \"class_implementation\") {\n      let name: string | null = null;\n      for (const child of node.children) {\n        if (child.type === \"identifier\") { name = _read(child); break; }\n      }\n      if (!name) {\n        for (const child of node.children) walk(child, parentNid);\n        return;\n      }\n      const implNid = _makeId(stem, name);\n      if (!seenIds.has(implNid)) {\n        addNode(implNid, name, line);\n        addEdge(fileNid, implNid, \"contains\", line);\n      }\n      for (const child of node.children) {\n        if (child.type === \"implementation_definition\") {\n          for (const sub of child.children) walk(sub, implNid);\n        }\n      }\n      return;\n    }\n\n    if (t === \"protocol_declaration\") {\n      let name: string | null = null;\n      for (const child of node.children) {\n        if (child.type === \"identifier\") { name = _read(child); break; }\n      }\n      if (name) {\n        const protoNid = _makeId(stem, name);\n        addNode(protoNid, `<${name}>`, line);\n        addEdge(fileNid, protoNid, \"contains\", line);\n        for (const child of node.children) walk(child, protoNid);\n      }\n      return;\n    }\n\n    if (t === \"method_declaration\" || t === \"method_definition\") {\n      const container = parentNid || fileNid;\n      const parts: string[] = [];\n      for (const child of node.children) {\n        if (child.type === \"identifier\") {\n          parts.push(_read(child));\n        }\n      }\n      const methodName = parts.join(\"\") || null;\n      if (methodName) {\n        const methodNid = _makeId(container, methodName);\n        addNode(methodNid, `-${methodName}`, line);\n        addEdge(container, methodNid, \"method\", line);\n        if (t === \"method_definition\") {\n          methodBodies.push([methodNid, node]);\n        }\n      }\n      return;\n    }\n\n    for (const child of node.children) {\n      walk(child, parentNid);\n    }\n  }\n\n  walk(root);\n\n  // Second pass: resolve calls inside method bodies\n  const allMethodNids = new Set(nodes.filter((n) => n.id !== fileNid).map((n) => n.id));\n  const seenCalls = new Set<string>();\n\n  for (const [callerNid, bodyNode] of methodBodies) {\n    function objcWalkCalls(n: SyntaxNode): void {\n      if (n.type === \"message_expression\") {\n        for (const child of n.children) {\n          if (child.type === \"selector\" || child.type === \"keyword_argument_list\") {\n            const sel: string[] = [];\n            if (child.type === \"selector\") {\n              sel.push(_read(child));\n            } else {\n              for (const sub of child.children) {\n                if (sub.type === \"keyword_argument\") {\n                  for (const s of sub.children) {\n                    if (s.type === \"selector\") sel.push(_read(s));\n                  }\n                }\n              }\n            }\n            const methodName = sel.join(\"\");\n            for (const candidate of allMethodNids) {\n              if (candidate.endsWith(_makeId(\"\", methodName).replace(/^_/, \"\"))) {\n                const pair = `${callerNid}|${candidate}`;\n                if (!seenCalls.has(pair) && callerNid !== candidate) {\n                  seenCalls.add(pair);\n                  addEdge(callerNid, candidate, \"calls\", bodyNode.startPosition.row + 1, \"EXTRACTED\", 1.0);\n                }\n              }\n            }\n          }\n        }\n      }\n      for (const child of n.children) {\n        objcWalkCalls(child);\n      }\n    }\n    objcWalkCalls(bodyNode);\n  }\n\n  return { nodes, edges, error: undefined };\n}\n\n// ---------------------------------------------------------------------------\n// Elixir extractor (custom walk)\n// ---------------------------------------------------------------------------\n\nexport async function extractElixir(filePath: string): Promise<ExtractionResult> {\n  await ensureParserInit();\n  const lang = await loadLanguage(\"elixir\");\n  if (!lang) {\n    return { nodes: [], edges: [], error: \"tree-sitter-elixir not available\" };\n  }\n\n  let source: string;\n  let tree: Tree;\n  try {\n    const parser = new Parser();\n    parser.setLanguage(lang);\n    source = readFileSync(filePath, \"utf-8\");\n    tree = parseText(parser, source);\n  } catch (e: unknown) {\n    return { nodes: [], edges: [], error: String(e) };\n  }\n\n  const root = tree.rootNode;\n  const stem = basename(filePath, extname(filePath));\n  const strPath = filePath;\n  const nodes: GraphNode[] = [];\n  const edges: GraphEdge[] = [];\n  const seenIds = new Set<string>();\n  const functionBodies: Array<[string, SyntaxNode]> = [];\n\n  function addNode(nid: string, label: string, line: number): void {\n    if (!seenIds.has(nid)) {\n      seenIds.add(nid);\n      nodes.push({ id: nid, label, file_type: \"code\", source_file: strPath, source_location: `L${line}` });\n    }\n  }\n\n  function addEdge(\n    src: string, tgt: string, relation: string, line: number,\n    confidence: \"EXTRACTED\" | \"INFERRED\" = \"EXTRACTED\", weight: number = 1.0,\n  ): void {\n    edges.push({ source: src, target: tgt, relation, confidence, source_file: strPath, source_location: `L${line}`, weight });\n  }\n\n  const fileNid = _makeId(stem);\n  addNode(fileNid, basename(filePath), 1);\n\n  const _IMPORT_KEYWORDS = new Set([\"alias\", \"import\", \"require\", \"use\"]);\n\n  function getAliasText(node: SyntaxNode): string | null {\n    for (const child of node.children) {\n      if (child.type === \"alias\") {\n        return source.slice(child.startIndex, child.endIndex);\n      }\n    }\n    return null;\n  }\n\n  function walk(node: SyntaxNode, parentModuleNid: string | null = null): void {\n    if (node.type !== \"call\") {\n      for (const child of node.children) walk(child, parentModuleNid);\n      return;\n    }\n\n    let identifierNode: SyntaxNode | null = null;\n    let argumentsNode: SyntaxNode | null = null;\n    let doBlockNode: SyntaxNode | null = null;\n    for (const child of node.children) {\n      if (child.type === \"identifier\") identifierNode = child;\n      else if (child.type === \"arguments\") argumentsNode = child;\n      else if (child.type === \"do_block\") doBlockNode = child;\n    }\n\n    if (!identifierNode) {\n      for (const child of node.children) walk(child, parentModuleNid);\n      return;\n    }\n\n    const keyword = source.slice(identifierNode.startIndex, identifierNode.endIndex);\n    const line = node.startPosition.row + 1;\n\n    if (keyword === \"defmodule\") {\n      const moduleName = argumentsNode ? getAliasText(argumentsNode) : null;\n      if (!moduleName) return;\n      const moduleNid = _makeId(stem, moduleName);\n      addNode(moduleNid, moduleName, line);\n      addEdge(fileNid, moduleNid, \"contains\", line);\n      if (doBlockNode) {\n        for (const child of doBlockNode.children) walk(child, moduleNid);\n      }\n      return;\n    }\n\n    if (keyword === \"def\" || keyword === \"defp\") {\n      let funcName: string | null = null;\n      if (argumentsNode) {\n        for (const child of argumentsNode.children) {\n          if (child.type === \"call\") {\n            for (const sub of child.children) {\n              if (sub.type === \"identifier\") {\n                funcName = source.slice(sub.startIndex, sub.endIndex);\n                break;\n              }\n            }\n          } else if (child.type === \"identifier\") {\n            funcName = source.slice(child.startIndex, child.endIndex);\n            break;\n          }\n        }\n      }\n      if (!funcName) return;\n      const container = parentModuleNid || fileNid;\n      const funcNid = _makeId(container, funcName);\n      addNode(funcNid, `${funcName}()`, line);\n      if (parentModuleNid) {\n        addEdge(parentModuleNid, funcNid, \"method\", line);\n      } else {\n        addEdge(fileNid, funcNid, \"contains\", line);\n      }\n      if (doBlockNode) {\n        functionBodies.push([funcNid, doBlockNode]);\n      }\n      return;\n    }\n\n    if (_IMPORT_KEYWORDS.has(keyword) && argumentsNode) {\n      const moduleName = getAliasText(argumentsNode);\n      if (moduleName) {\n        const tgtNid = _makeId(moduleName);\n        addEdge(fileNid, tgtNid, \"imports\", line);\n      }\n      return;\n    }\n\n    for (const child of node.children) walk(child, parentModuleNid);\n  }\n\n  walk(root);\n\n  // Call-graph pass\n  const labelToNid = new Map<string, string>();\n  for (const n of nodes) {\n    const normalised = n.label.replace(/\\(?\\)$/g, \"\").replace(/^\\./, \"\");\n    labelToNid.set(normalised.toLowerCase(), n.id);\n  }\n\n  const seenCallPairs = new Set<string>();\n  const _SKIP_KEYWORDS = new Set([\n    \"def\", \"defp\", \"defmodule\", \"defmacro\", \"defmacrop\",\n    \"defstruct\", \"defprotocol\", \"defimpl\", \"defguard\",\n    \"alias\", \"import\", \"require\", \"use\",\n    \"if\", \"unless\", \"case\", \"cond\", \"with\", \"for\",\n  ]);\n\n  function walkCalls(node: SyntaxNode, callerNid: string): void {\n    if (node.type !== \"call\") {\n      for (const child of node.children) walkCalls(child, callerNid);\n      return;\n    }\n    for (const child of node.children) {\n      if (child.type === \"identifier\") {\n        const kw = source.slice(child.startIndex, child.endIndex);\n        if (_SKIP_KEYWORDS.has(kw)) {\n          for (const c of node.children) walkCalls(c, callerNid);\n          return;\n        }\n        break;\n      }\n    }\n    let calleeName: string | null = null;\n    for (const child of node.children) {\n      if (child.type === \"dot\") {\n        const dotText = source.slice(child.startIndex, child.endIndex);\n        const parts = dotText.replace(/\\.$/, \"\").split(\".\");\n        if (parts.length > 0) calleeName = parts[parts.length - 1]!;\n        break;\n      }\n      if (child.type === \"identifier\") {\n        calleeName = source.slice(child.startIndex, child.endIndex);\n        break;\n      }\n    }\n    if (calleeName) {\n      const tgtNid = labelToNid.get(calleeName.toLowerCase());\n      if (tgtNid && tgtNid !== callerNid) {\n        const pair = `${callerNid}|${tgtNid}`;\n        if (!seenCallPairs.has(pair)) {\n          seenCallPairs.add(pair);\n          addEdge(callerNid, tgtNid, \"calls\", node.startPosition.row + 1, \"EXTRACTED\", 1.0);\n        }\n      }\n    }\n    for (const child of node.children) {\n      walkCalls(child, callerNid);\n    }\n  }\n\n  for (const [callerNid, body] of functionBodies) {\n    walkCalls(body, callerNid);\n  }\n\n  const cleanEdges = edges.filter((e) =>\n    seenIds.has(e.source) && (seenIds.has(e.target) || e.relation === \"imports\"),\n  );\n\n  return { nodes, edges: cleanEdges, error: undefined };\n}\n\n// ---------------------------------------------------------------------------\n// Cross-file import resolution (Python only)\n// ---------------------------------------------------------------------------\n\nasync function _resolveCrossFileImports(\n  perFile: ExtractionResult[],\n  paths: string[],\n): Promise<GraphEdge[]> {\n  await ensureParserInit();\n  const lang = await loadLanguage(\"python\");\n  if (!lang) return [];\n\n  const parser = new Parser();\n  parser.setLanguage(lang);\n\n  // Pass 1: name -> node_id across all files\n  const stemToEntities = new Map<string, Map<string, string>>();\n  for (const fileResult of perFile) {\n    for (const node of fileResult.nodes ?? []) {\n      const src = node.source_file ?? \"\";\n      if (!src) continue;\n      const fileStem = basename(src, extname(src));\n      const label = node.label ?? \"\";\n      const nid = node.id ?? \"\";\n      if (label && !label.endsWith(\")\") && !label.endsWith(\".py\") && !label.startsWith(\"_\")) {\n        if (!stemToEntities.has(fileStem)) stemToEntities.set(fileStem, new Map());\n        stemToEntities.get(fileStem)!.set(label, nid);\n      }\n    }\n  }\n\n  // Pass 2\n  const newEdges: GraphEdge[] = [];\n  const stemToPath = new Map<string, string>();\n  for (const p of paths) {\n    stemToPath.set(basename(p, extname(p)), p);\n  }\n\n  for (let idx = 0; idx < perFile.length; idx++) {\n    const fileResult = perFile[idx]!;\n    const filePath = paths[idx]!;\n    const fileStem = basename(filePath, extname(filePath));\n    const strPath = filePath;\n\n    const localClasses = fileResult.nodes\n      .filter((n) =>\n        n.source_file === strPath &&\n        !n.label.endsWith(\")\") &&\n        !n.label.endsWith(\".py\") &&\n        n.id !== _makeId(fileStem),\n      )\n      .map((n) => n.id);\n\n    if (localClasses.length === 0) continue;\n\n    let source: string;\n    let tree: Tree;\n    try {\n      source = readFileSync(filePath, \"utf-8\");\n      tree = parseText(parser, source);\n    } catch {\n      continue;\n    }\n\n    function walkImports(node: SyntaxNode): void {\n      if (node.type === \"import_from_statement\") {\n        let targetStem: string | null = null;\n        for (const child of node.children) {\n          if (child.type === \"relative_import\") {\n            for (const sub of child.children) {\n              if (sub.type === \"dotted_name\") {\n                const raw = source.slice(sub.startIndex, sub.endIndex);\n                targetStem = raw.split(\".\").pop()!;\n                break;\n              }\n            }\n            break;\n          }\n          if (child.type === \"dotted_name\" && targetStem === null) {\n            const raw = source.slice(child.startIndex, child.endIndex);\n            targetStem = raw.split(\".\").pop()!;\n          }\n        }\n\n        if (!targetStem || !stemToEntities.has(targetStem)) return;\n\n        const importedNames: string[] = [];\n        let pastImportKw = false;\n        for (const child of node.children) {\n          if (child.type === \"import\") {\n            pastImportKw = true;\n            continue;\n          }\n          if (!pastImportKw) continue;\n          if (child.type === \"dotted_name\") {\n            importedNames.push(source.slice(child.startIndex, child.endIndex));\n          } else if (child.type === \"aliased_import\") {\n            const nameNode = child.childForFieldName(\"name\");\n            if (nameNode) {\n              importedNames.push(source.slice(nameNode.startIndex, nameNode.endIndex));\n            }\n          }\n        }\n\n        const line = node.startPosition.row + 1;\n        for (const name of importedNames) {\n          const tgtNid = stemToEntities.get(targetStem)?.get(name);\n          if (tgtNid) {\n            for (const srcClassNid of localClasses) {\n              newEdges.push({\n                source: srcClassNid, target: tgtNid, relation: \"uses\",\n                confidence: \"INFERRED\", source_file: strPath,\n                source_location: `L${line}`, weight: 0.8,\n              });\n            }\n          }\n        }\n      }\n      for (const child of node.children) {\n        walkImports(child);\n      }\n    }\n\n    walkImports(tree.rootNode);\n  }\n\n  return newEdges;\n}\n\n// ---------------------------------------------------------------------------\n// Main extract() and collectFiles()\n// ---------------------------------------------------------------------------\n\ntype ExtractorFn = (filePath: string) => Promise<ExtractionResult>;\n\nconst _DISPATCH: Record<string, ExtractorFn> = {\n  \".py\": extractPython,\n  \".js\": extractJs,\n  \".jsx\": extractJs,\n  \".ts\": extractJs,\n  \".tsx\": extractJs,\n  \".go\": extractGo,\n  \".rs\": extractRust,\n  \".java\": extractJava,\n  \".c\": extractC,\n  \".h\": extractC,\n  \".cpp\": extractCpp,\n  \".cc\": extractCpp,\n  \".cxx\": extractCpp,\n  \".hpp\": extractCpp,\n  \".rb\": extractRuby,\n  \".cs\": extractCsharp,\n  \".kt\": extractKotlin,\n  \".kts\": extractKotlin,\n  \".scala\": extractScala,\n  \".php\": extractPhp,\n  \".swift\": extractSwift,\n  \".lua\": extractLua,\n  \".toc\": extractLua,\n  \".zig\": extractZig,\n  \".ps1\": extractPowershell,\n  \".ex\": extractElixir,\n  \".exs\": extractElixir,\n  \".m\": extractObjc,\n  \".mm\": extractObjc,\n  \".jl\": extractJulia,\n};\n\n/**\n * Extract AST nodes and edges from a list of code files.\n *\n * Two-pass process:\n * 1. Per-file structural extraction (classes, functions, imports)\n * 2. Cross-file import resolution: turns file-level imports into\n *    class-level INFERRED edges (DigestAuth --uses--> Response)\n */\nexport interface ExtractionDiagnostic {\n  filePath: string;\n  error: string;\n}\n\nexport interface ExtractWithDiagnosticsResult {\n  extraction: Extraction;\n  diagnostics: ExtractionDiagnostic[];\n}\n\nexport async function extractWithDiagnostics(paths: string[]): Promise<ExtractWithDiagnosticsResult> {\n  const perFile: ExtractionResult[] = [];\n  const diagnostics: ExtractionDiagnostic[] = [];\n\n  // Infer a common root for cache keys\n  let root = \".\";\n  try {\n    if (paths.length === 0) {\n      root = \".\";\n    } else if (paths.length === 1) {\n      root = dirname(paths[0]!);\n    } else {\n      // Find common prefix directory\n      const parts = paths.map((p) => p.split(sep));\n      const minLen = Math.min(...parts.map((p) => p.length));\n      let commonLen = 0;\n      for (let i = 0; i < minLen; i++) {\n        const uniqueAtLevel = new Set(parts.map((p) => p[i]));\n        if (uniqueAtLevel.size === 1) commonLen++;\n        else break;\n      }\n      root = commonLen > 0 ? parts[0]!.slice(0, commonLen).join(sep) : \".\";\n    }\n  } catch {\n    root = \".\";\n  }\n\n  const total = paths.length;\n  const _PROGRESS_INTERVAL = 100;\n\n  for (let i = 0; i < paths.length; i++) {\n    if (total >= _PROGRESS_INTERVAL && i % _PROGRESS_INTERVAL === 0 && i > 0) {\n      process.stderr.write(`  AST extraction: ${i}/${total} files (${Math.floor(i * 100 / total)}%)\\n`);\n    }\n    const filePath = paths[i]!;\n    const ext = extname(filePath);\n    const extractor = _DISPATCH[ext];\n    if (!extractor) continue;\n\n    const cached = loadCached(filePath, root);\n    if (cached !== null) {\n      perFile.push(cached as unknown as ExtractionResult);\n      continue;\n    }\n\n    const result = await extractor(filePath);\n    if (!result.error) {\n      saveCached(filePath, result as unknown as Record<string, unknown>, root);\n    } else {\n      diagnostics.push({ filePath, error: result.error });\n    }\n    perFile.push(result);\n  }\n\n  if (total >= _PROGRESS_INTERVAL) {\n    process.stderr.write(`  AST extraction: ${total}/${total} files (100%)\\n`);\n  }\n\n  const allNodes: GraphNode[] = [];\n  const allEdges: GraphEdge[] = [];\n  for (const result of perFile) {\n    allNodes.push(...(result.nodes ?? []));\n    allEdges.push(...(result.edges ?? []));\n  }\n\n  // Add cross-file class-level edges (Python only)\n  const pyPaths = paths.filter((p) => extname(p) === \".py\");\n  if (pyPaths.length > 0) {\n    const pyResults = perFile.filter((_r, i) => extname(paths[i]!) === \".py\");\n    try {\n      const crossFileEdges = await _resolveCrossFileImports(pyResults, pyPaths);\n      allEdges.push(...crossFileEdges);\n    } catch {\n      // Cross-file import resolution failed, skipping\n    }\n  }\n\n  return {\n    extraction: {\n      nodes: allNodes,\n      edges: allEdges,\n      input_tokens: 0,\n      output_tokens: 0,\n    },\n    diagnostics,\n  };\n}\n\nexport async function extract(paths: string[]): Promise<Extraction> {\n  const { extraction } = await extractWithDiagnostics(paths);\n  return extraction;\n}\n\n// ---------------------------------------------------------------------------\n// collectFiles\n// ---------------------------------------------------------------------------\n\nconst _EXTENSIONS = new Set([\n  \".py\", \".js\", \".ts\", \".tsx\", \".go\", \".rs\",\n  \".java\", \".c\", \".h\", \".cpp\", \".cc\", \".cxx\", \".hpp\",\n  \".rb\", \".cs\", \".kt\", \".kts\", \".scala\", \".php\", \".swift\",\n  \".lua\", \".toc\", \".zig\", \".ps1\",\n  \".m\", \".mm\",\n  \".jl\", \".jsx\", \".ex\", \".exs\",\n]);\n\n/**\n * Walk a directory (or return a single file) and collect code files by\n * supported extension.\n */\nexport function collectFiles(target: string, options?: { followSymlinks?: boolean }): string[] {\n  const followSymlinks = options?.followSymlinks ?? false;\n  const resolved = resolve(target);\n\n  try {\n    const stat = lstatSync(resolved);\n    if (stat.isFile()) return [resolved];\n  } catch {\n    return [];\n  }\n\n  const results: string[] = [];\n\n  function walkDir(dir: string, visited: Set<string>): void {\n    let entries: string[];\n    try {\n      entries = readdirSync(dir);\n    } catch {\n      return;\n    }\n\n    for (const entry of entries) {\n      if (entry.startsWith(\".\")) continue;\n      const fullPath = join(dir, entry);\n\n      let stat;\n      try {\n        stat = lstatSync(fullPath);\n      } catch {\n        continue;\n      }\n\n      if (stat.isSymbolicLink() && !followSymlinks) continue;\n\n      if (stat.isDirectory() || (stat.isSymbolicLink() && followSymlinks)) {\n        // Cycle detection for symlinks\n        if (stat.isSymbolicLink()) {\n          try {\n            const real = realpathSync(fullPath);\n            if (visited.has(real)) continue;\n            visited.add(real);\n            const parentReal = realpathSync(dirname(fullPath));\n            if (parentReal === real || parentReal.startsWith(real + sep)) continue;\n          } catch {\n            continue;\n          }\n        }\n\n        // Skip hidden directories\n        const pathParts = fullPath.split(sep);\n        if (pathParts.some((part) => part.startsWith(\".\"))) continue;\n\n        walkDir(fullPath, visited);\n      } else if (stat.isFile()) {\n        const ext = extname(entry);\n        if (_EXTENSIONS.has(ext)) {\n          results.push(fullPath);\n        }\n      }\n    }\n  }\n\n  walkDir(resolved, new Set<string>());\n  return results.sort();\n}\n","/**\n * graphify - extract · build · cluster · analyze · report.\n */\n\nexport { type GraphNode, type GraphEdge, type Extraction, type Hyperedge, type DetectionResult, FileType } from \"./types.js\";\nexport { validateExtraction, assertValid } from \"./validate.js\";\nexport { buildFromJson, build } from \"./build.js\";\nexport { cluster, cohesionScore, scoreAll } from \"./cluster.js\";\nexport { godNodes, surprisingConnections, suggestQuestions, graphDiff } from \"./analyze.js\";\nexport { generate as generateReport } from \"./report.js\";\nexport { toJson, toHtml, toSvg, toGraphml, toCypher, toCanvas, pushToNeo4j } from \"./export.js\";\nexport { toWiki } from \"./wiki.js\";\nexport { detect, classifyFile, detectIncremental, saveManifest } from \"./detect.js\";\nexport { extract, collectFiles } from \"./extract.js\";\nexport { fileHash, loadCached, saveCached, checkSemanticCache, saveSemanticCache } from \"./cache.js\";\nexport { validateUrl, safeFetch, safeFetchText, validateGraphPath, sanitizeLabel } from \"./security.js\";\nexport { runBenchmark, printBenchmark } from \"./benchmark.js\";\nexport { ingest, saveQueryResult } from \"./ingest.js\";\nexport { downloadAudio, buildWhisperPrompt, transcribe, transcribeAll, augmentDetectionWithTranscripts } from \"./transcribe.js\";\nexport { serve } from \"./serve.js\";\nexport { watch, rebuildCode } from \"./watch.js\";\n","/**\n * Wiki export - Wikipedia-style markdown articles from the knowledge graph.\n * Generates an agent-crawlable wiki: index.md + one article per community + god node articles.\n */\nimport { mkdirSync, writeFileSync } from \"node:fs\";\nimport { join } from \"node:path\";\nimport Graph from \"graphology\";\nimport type { GodNodeEntry } from \"./types.js\";\nimport { type NumericMapLike, toNumericMap } from \"./collections.js\";\nimport { traversalNeighbors } from \"./graph.js\";\n\nfunction safeFilename(name: string): string {\n  return name\n    .replace(/\\r\\n/g, \" \")\n    .replace(/\\r/g, \" \")\n    .replace(/\\n/g, \" \")\n    .replace(/\\//g, \"-\")\n    .replace(/ /g, \"_\")\n    .replace(/:/g, \"-\");\n}\n\nfunction crossCommunityLinks(\n  G: Graph,\n  nodes: string[],\n  ownCid: number,\n  labels: NumericMapLike<string>,\n): [string, number][] {\n  const labelMap = toNumericMap(labels);\n  const counts = new Map<string, number>();\n  for (const nid of nodes) {\n    for (const neighbor of traversalNeighbors(G, nid)) {\n      const ncid = G.getNodeAttribute(neighbor, \"community\") as number | undefined;\n      if (ncid !== undefined && ncid !== ownCid) {\n        const label = labelMap.get(ncid) ?? `Community ${ncid}`;\n        counts.set(label, (counts.get(label) ?? 0) + 1);\n      }\n    }\n  }\n  return [...counts.entries()].sort((a, b) => b[1] - a[1]);\n}\n\nfunction communityArticle(\n  G: Graph,\n  cid: number,\n  nodes: string[],\n  label: string,\n  labels: Map<number, string>,\n  cohesion: number | undefined,\n): string {\n  const topNodes = [...nodes].sort((a, b) => G.degree(b) - G.degree(a)).slice(0, 25);\n  const cross = crossCommunityLinks(G, nodes, cid, labels);\n\n  const confCounts: Record<string, number> = { EXTRACTED: 0, INFERRED: 0, AMBIGUOUS: 0 };\n  for (const nid of nodes) {\n    G.forEachEdge(nid, (_, data) => {\n      const conf = (data.confidence as string) ?? \"EXTRACTED\";\n      confCounts[conf] = (confCounts[conf] ?? 0) + 1;\n    });\n  }\n  const totalEdges = Object.values(confCounts).reduce((s, n) => s + n, 0) || 1;\n\n  const sources = [...new Set(nodes.map((n) => (G.getNodeAttribute(n, \"source_file\") as string) ?? \"\").filter(Boolean))].sort();\n\n  const lines: string[] = [];\n  lines.push(`# ${label}`, \"\");\n\n  const metaParts = [`${nodes.length} nodes`];\n  if (cohesion !== undefined) metaParts.push(`cohesion ${cohesion.toFixed(2)}`);\n  lines.push(`> ${metaParts.join(\" · \")}`, \"\");\n\n  lines.push(\"## Key Concepts\", \"\");\n  for (const nid of topNodes) {\n    const d = G.getNodeAttributes(nid);\n    const nodeLabel = (d.label as string) ?? nid;\n    const src = (d.source_file as string) ?? \"\";\n    const degree = G.degree(nid);\n    const srcStr = src ? ` — \\`${src}\\`` : \"\";\n    lines.push(`- **${nodeLabel}** (${degree} connections)${srcStr}`);\n  }\n  const remaining = nodes.length - topNodes.length;\n  if (remaining > 0) lines.push(`- *... and ${remaining} more nodes in this community*`);\n  lines.push(\"\");\n\n  lines.push(\"## Relationships\", \"\");\n  if (cross.length > 0) {\n    for (const [otherLabel, count] of cross.slice(0, 12)) {\n      lines.push(`- [[${otherLabel}]] (${count} shared connections)`);\n    }\n  } else {\n    lines.push(\"- No strong cross-community connections detected\");\n  }\n  lines.push(\"\");\n\n  if (sources.length > 0) {\n    lines.push(\"## Source Files\", \"\");\n    for (const src of sources.slice(0, 20)) {\n      lines.push(`- \\`${src}\\``);\n    }\n    lines.push(\"\");\n  }\n\n  lines.push(\"## Audit Trail\", \"\");\n  for (const conf of [\"EXTRACTED\", \"INFERRED\", \"AMBIGUOUS\"]) {\n    const n = confCounts[conf] ?? 0;\n    const pct = Math.round((n / totalEdges) * 100);\n    lines.push(`- ${conf}: ${n} (${pct}%)`);\n  }\n  lines.push(\"\");\n\n  lines.push(\"---\", \"\", \"*Part of the graphify knowledge wiki. See [[index]] to navigate.*\");\n  return lines.join(\"\\n\");\n}\n\nfunction godNodeArticle(G: Graph, nid: string, labels: Map<number, string>): string {\n  const d = G.getNodeAttributes(nid);\n  const nodeLabel = (d.label as string) ?? nid;\n  const src = (d.source_file as string) ?? \"\";\n  const cid = d.community as number | undefined;\n  const communityName = cid !== undefined ? (labels.get(cid) ?? `Community ${cid}`) : undefined;\n\n  const lines: string[] = [];\n  lines.push(`# ${nodeLabel}`, \"\");\n  lines.push(`> God node · ${G.degree(nid)} connections · \\`${src}\\``, \"\");\n\n  if (communityName) {\n    lines.push(`**Community:** [[${communityName}]]`, \"\");\n  }\n\n  const byRelation = new Map<string, string[]>();\n  const neighbors = traversalNeighbors(G, nid).sort((a, b) => G.degree(b) - G.degree(a));\n  for (const neighbor of neighbors) {\n    const ed = G.getEdgeAttributes(G.edge(nid, neighbor)!);\n    const rel = (ed.relation as string) ?? \"related\";\n    const neighborLabel = (G.getNodeAttribute(neighbor, \"label\") as string) ?? neighbor;\n    const conf = (ed.confidence as string) ?? \"\";\n    const confStr = conf ? ` \\`${conf}\\`` : \"\";\n    if (!byRelation.has(rel)) byRelation.set(rel, []);\n    byRelation.get(rel)!.push(`[[${neighborLabel}]]${confStr}`);\n  }\n\n  lines.push(\"## Connections by Relation\", \"\");\n  for (const [rel, targets] of [...byRelation.entries()].sort()) {\n    lines.push(`### ${rel}`);\n    for (const t of targets.slice(0, 20)) {\n      lines.push(`- ${t}`);\n    }\n    lines.push(\"\");\n  }\n\n  lines.push(\"---\", \"\", \"*Part of the graphify knowledge wiki. See [[index]] to navigate.*\");\n  return lines.join(\"\\n\");\n}\n\nfunction indexMd(\n  communities: Map<number, string[]>,\n  labels: Map<number, string>,\n  godNodesData: GodNodeEntry[],\n  totalNodes: number,\n  totalEdges: number,\n): string {\n  const lines: string[] = [\n    \"# Knowledge Graph Index\",\n    \"\",\n    \"> Auto-generated by graphify. Start here — read community articles for context, then drill into god nodes for detail.\",\n    \"\",\n    `**${totalNodes} nodes · ${totalEdges} edges · ${communities.size} communities**`,\n    \"\",\n    \"---\",\n    \"\",\n    \"## Communities\",\n    \"(sorted by size, largest first)\",\n    \"\",\n  ];\n\n  const sorted = [...communities.entries()].sort((a, b) => b[1].length - a[1].length);\n  for (const [cid, nodes] of sorted) {\n    const label = labels.get(cid) ?? `Community ${cid}`;\n    lines.push(`- [[${label}]] — ${nodes.length} nodes`);\n  }\n  lines.push(\"\");\n\n  if (godNodesData.length > 0) {\n    lines.push(\"## God Nodes\", \"(most connected concepts — the load-bearing abstractions)\", \"\");\n    for (const node of godNodesData) {\n      lines.push(`- [[${node.label}]] — ${node.edges} connections`);\n    }\n    lines.push(\"\");\n  }\n\n  lines.push(\n    \"---\",\n    \"\",\n    \"*Generated by [graphify](https://github.com/safishamsi/graphify)*\",\n  );\n  return lines.join(\"\\n\");\n}\n\nexport function toWiki(\n  G: Graph,\n  communities: NumericMapLike<string[]>,\n  outputDir: string,\n  options?: {\n    communityLabels?: NumericMapLike<string>;\n    cohesion?: NumericMapLike<number>;\n    godNodesData?: GodNodeEntry[];\n  },\n): number {\n  const communityMap = toNumericMap(communities);\n  mkdirSync(outputDir, { recursive: true });\n\n  const labels = options?.communityLabels\n    ? toNumericMap(options.communityLabels)\n    : new Map([...communityMap.keys()].map((cid) => [cid, `Community ${cid}`]));\n  const cohesion = toNumericMap(options?.cohesion);\n  const godNodesData = options?.godNodesData ?? [];\n\n  let count = 0;\n\n  // Community articles\n  for (const [cid, nodes] of communityMap) {\n    const label = labels.get(cid) ?? `Community ${cid}`;\n    const article = communityArticle(G, cid, nodes, label, labels, cohesion.get(cid));\n    writeFileSync(join(outputDir, `${safeFilename(label)}.md`), article);\n    count++;\n  }\n\n  // God node articles\n  for (const nodeData of godNodesData) {\n    const nid = nodeData.id;\n    if (nid && G.hasNode(nid)) {\n      const article = godNodeArticle(G, nid, labels);\n      writeFileSync(join(outputDir, `${safeFilename(nodeData.label)}.md`), article);\n      count++;\n    }\n  }\n\n  // Index\n  writeFileSync(\n    join(outputDir, \"index.md\"),\n    indexMd(communityMap, labels, godNodesData, G.order, G.size),\n  );\n\n  return count;\n}\n","/**\n * Token-reduction benchmark - measures how much context graphify saves vs naive full-corpus approach.\n */\nimport { readFileSync, existsSync } from \"node:fs\";\nimport Graph from \"graphology\";\nimport { forEachTraversalNeighbor, loadGraphFromData, type SerializedGraphData } from \"./graph.js\";\nimport type { BenchmarkResult } from \"./types.js\";\n\nconst CHARS_PER_TOKEN = 4;\n\nfunction estimateTokens(text: string): number {\n  return Math.max(1, Math.floor(text.length / CHARS_PER_TOKEN));\n}\n\nfunction querySubgraphTokens(G: Graph, question: string, depth: number = 3): number {\n  const terms = question.toLowerCase().split(/\\s+/).filter((t) => t.length > 2);\n  const scored: [number, string][] = [];\n  G.forEachNode((nid, data) => {\n    const label = ((data.label as string) ?? \"\").toLowerCase();\n    const score = terms.filter((t) => label.includes(t)).length;\n    if (score > 0) scored.push([score, nid]);\n  });\n  scored.sort((a, b) => b[0] - a[0]);\n  const startNodes = scored.slice(0, 3).map(([, nid]) => nid);\n  if (startNodes.length === 0) return 0;\n\n  const visited = new Set(startNodes);\n  let frontier = new Set(startNodes);\n  const edgesSeen: [string, string][] = [];\n\n  for (let d = 0; d < depth; d++) {\n    const nextFrontier = new Set<string>();\n    for (const n of frontier) {\n      forEachTraversalNeighbor(G, n, (neighbor) => {\n        if (!visited.has(neighbor)) {\n          nextFrontier.add(neighbor);\n          edgesSeen.push([n, neighbor]);\n        }\n      });\n    }\n    for (const n of nextFrontier) visited.add(n);\n    frontier = nextFrontier;\n  }\n\n  const lines: string[] = [];\n  for (const nid of visited) {\n    const d = G.getNodeAttributes(nid);\n    lines.push(`NODE ${d.label ?? nid} src=${d.source_file ?? \"\"} loc=${d.source_location ?? \"\"}`);\n  }\n  for (const [u, v] of edgesSeen) {\n    if (visited.has(u) && visited.has(v)) {\n      const edge = G.edge(u, v);\n      if (edge) {\n        const d = G.getEdgeAttributes(edge);\n        lines.push(`EDGE ${G.getNodeAttribute(u, \"label\") ?? u} --${d.relation ?? \"\"}--> ${G.getNodeAttribute(v, \"label\") ?? v}`);\n      }\n    }\n  }\n\n  return estimateTokens(lines.join(\"\\n\"));\n}\n\nconst SAMPLE_QUESTIONS = [\n  \"how does authentication work\",\n  \"what is the main entry point\",\n  \"how are errors handled\",\n  \"what connects the data layer to the api\",\n  \"what are the core abstractions\",\n];\n\ninterface BenchmarkOptions {\n  corpusWords?: number;\n  questions?: string[];\n}\n\nfunction loadGraph(graphPath: string): Graph {\n  const raw = JSON.parse(readFileSync(graphPath, \"utf-8\")) as SerializedGraphData;\n  return loadGraphFromData(raw);\n}\n\nexport function runBenchmark(\n  graphPath: string = \"graphify-out/graph.json\",\n  corpusWordsOrOptions?: number | BenchmarkOptions,\n  questions?: string[],\n): BenchmarkResult {\n  const options = typeof corpusWordsOrOptions === \"number\"\n    ? { corpusWords: corpusWordsOrOptions, questions }\n    : (corpusWordsOrOptions ?? {});\n\n  if (!existsSync(graphPath)) {\n    return { error: `Graph file not found: ${graphPath}. Build the graph first.` };\n  }\n\n  const G = loadGraph(graphPath);\n\n  const corpusWords = options.corpusWords ?? (G.order * 50);\n\n  if (corpusWords === undefined) {\n    return { error: \"Could not determine corpus size.\" };\n  }\n\n  const corpusTokens = Math.floor((corpusWords * 100) / 75);\n  const qs = options.questions ?? SAMPLE_QUESTIONS;\n  const perQuestion: Array<{ question: string; query_tokens: number; reduction: number }> = [];\n\n  for (const q of qs) {\n    const qt = querySubgraphTokens(G, q);\n    if (qt > 0) {\n      perQuestion.push({\n        question: q,\n        query_tokens: qt,\n        reduction: Math.round((corpusTokens / qt) * 10) / 10,\n      });\n    }\n  }\n\n  if (perQuestion.length === 0) {\n    return { error: \"No matching nodes found for sample questions. Build the graph first.\" };\n  }\n\n  const avgQueryTokens = Math.floor(\n    perQuestion.reduce((s, p) => s + p.query_tokens, 0) / perQuestion.length,\n  );\n  const reductionRatio = avgQueryTokens > 0 ? Math.round((corpusTokens / avgQueryTokens) * 10) / 10 : 0;\n\n  return {\n    corpus_tokens: corpusTokens,\n    corpus_words: corpusWords,\n    nodes: G.order,\n    edges: G.size,\n    avg_query_tokens: avgQueryTokens,\n    reduction_ratio: reductionRatio,\n    per_question: perQuestion,\n  };\n}\n\nexport function printBenchmark(result: BenchmarkResult): void {\n  if (result.error) {\n    console.log(`Benchmark error: ${result.error}`);\n    return;\n  }\n\n  console.log(`\\ngraphify token reduction benchmark`);\n  console.log(\"─\".repeat(50));\n  console.log(`  Corpus:          ${result.corpus_words!.toLocaleString()} words → ~${result.corpus_tokens!.toLocaleString()} tokens (naive)`);\n  console.log(`  Graph:           ${result.nodes!.toLocaleString()} nodes, ${result.edges!.toLocaleString()} edges`);\n  console.log(`  Avg query cost:  ~${result.avg_query_tokens!.toLocaleString()} tokens`);\n  console.log(`  Reduction:       ${result.reduction_ratio}x fewer tokens per query`);\n  console.log(`\\n  Per question:`);\n  for (const p of result.per_question!) {\n    console.log(`    [${p.reduction}x] ${p.question.slice(0, 55)}`);\n  }\n  console.log();\n}\n","/**\n * URL ingestion - fetch URLs (tweet/arxiv/pdf/web/image/youtube) and save as annotated markdown or audio.\n *\n * Uses Node.js global fetch, turndown for HTML-to-markdown conversion, and\n * security helpers for safe fetching and URL validation.\n */\nimport { existsSync, mkdirSync, writeFileSync } from \"node:fs\";\nimport { resolve as pathResolve, basename, extname } from \"node:path\";\nimport { safeFetch, safeFetchText, validateUrl } from \"./security.js\";\nimport { downloadAudio } from \"./transcribe.js\";\n\n// ---------------------------------------------------------------------------\n// Helpers\n// ---------------------------------------------------------------------------\n\nfunction yamlStr(s: string): string {\n  return s\n    .replace(/\\\\/g, \"\\\\\\\\\")\n    .replace(/\"/g, '\\\\\"')\n    .replace(/\\n/g, \" \")\n    .replace(/\\r/g, \" \");\n}\n\nfunction safeFilename(url: string, suffix: string): string {\n  let parsed: URL;\n  try {\n    parsed = new URL(url);\n  } catch {\n    return `unknown${suffix}`;\n  }\n  let name = parsed.hostname + parsed.pathname;\n  name = name.replace(/[^\\w\\-]/g, \"_\").replace(/^_+|_+$/g, \"\");\n  name = name.replace(/_+/g, \"_\").slice(0, 80);\n  return name + suffix;\n}\n\nfunction detectUrlType(url: string): string {\n  const lower = url.toLowerCase();\n  if (lower.includes(\"twitter.com\") || lower.includes(\"x.com\")) return \"tweet\";\n  if (lower.includes(\"arxiv.org\")) return \"arxiv\";\n  if (lower.includes(\"github.com\")) return \"github\";\n  if (lower.includes(\"youtube.com\") || lower.includes(\"youtu.be\"))\n    return \"youtube\";\n  try {\n    const parsed = new URL(url);\n    const path = parsed.pathname.toLowerCase();\n    if (path.endsWith(\".pdf\")) return \"pdf\";\n    if (\n      [\".png\", \".jpg\", \".jpeg\", \".webp\", \".gif\"].some((ext) =>\n        path.endsWith(ext),\n      )\n    )\n      return \"image\";\n  } catch {\n    // fall through\n  }\n  return \"webpage\";\n}\n\nasync function htmlToMarkdown(html: string, _url: string): Promise<string> {\n  try {\n    const TurndownService = (await import(\"turndown\")).default;\n    const td = new TurndownService({\n      headingStyle: \"atx\",\n      codeBlockStyle: \"fenced\",\n    });\n    return td.turndown(html);\n  } catch {\n    // Fallback: strip tags\n    let text = html.replace(/<script[^>]*>.*?<\\/script>/gis, \"\");\n    text = text.replace(/<style[^>]*>.*?<\\/style>/gis, \"\");\n    text = text.replace(/<[^>]+>/g, \" \");\n    text = text.replace(/\\s+/g, \" \").trim();\n    return text.slice(0, 8000);\n  }\n}\n\n// ---------------------------------------------------------------------------\n// URL type handlers\n// ---------------------------------------------------------------------------\n\nasync function fetchTweet(\n  url: string,\n  author: string | null,\n  contributor: string | null,\n): Promise<[string, string]> {\n  const oembedUrl = url.replace(\"x.com\", \"twitter.com\");\n  const oembedApi = `https://publish.twitter.com/oembed?url=${encodeURIComponent(oembedUrl)}&omit_script=true`;\n\n  let tweetText: string;\n  let tweetAuthor: string;\n  try {\n    const data = JSON.parse(await safeFetchText(oembedApi)) as Record<\n      string,\n      unknown\n    >;\n    tweetText = ((data.html as string) ?? \"\")\n      .replace(/<[^>]+>/g, \"\")\n      .trim();\n    tweetAuthor = (data.author_name as string) ?? \"unknown\";\n  } catch {\n    tweetText = `Tweet at ${url} (could not fetch content)`;\n    tweetAuthor = \"unknown\";\n  }\n\n  const now = new Date().toISOString();\n  const content = `---\nsource_url: ${url}\ntype: tweet\nauthor: ${tweetAuthor}\ncaptured_at: ${now}\ncontributor: ${contributor ?? author ?? \"unknown\"}\n---\n\n# Tweet by @${tweetAuthor}\n\n${tweetText}\n\nSource: ${url}\n`;\n  const filename = safeFilename(url, \".md\");\n  return [content, filename];\n}\n\nasync function fetchWebpage(\n  url: string,\n  author: string | null,\n  contributor: string | null,\n): Promise<[string, string]> {\n  const html = await safeFetchText(url);\n\n  const titleMatch = html.match(/<title[^>]*>(.*?)<\\/title>/is);\n  const title = titleMatch\n    ? titleMatch[1]!.replace(/\\s+/g, \" \").trim()\n    : url;\n\n  const markdown = await htmlToMarkdown(html, url);\n  const now = new Date().toISOString();\n  const content = `---\nsource_url: ${url}\ntype: webpage\ntitle: \"${yamlStr(title)}\"\ncaptured_at: ${now}\ncontributor: ${contributor ?? author ?? \"unknown\"}\n---\n\n# ${title}\n\nSource: ${url}\n\n---\n\n${markdown.slice(0, 12000)}\n`;\n  const filename = safeFilename(url, \".md\");\n  return [content, filename];\n}\n\nasync function fetchArxiv(\n  url: string,\n  author: string | null,\n  contributor: string | null,\n): Promise<[string, string]> {\n  const arxivMatch = url.match(/(\\d{4}\\.\\d{4,5})/);\n  if (!arxivMatch) {\n    return fetchWebpage(url, author, contributor);\n  }\n\n  const arxivId = arxivMatch[1]!;\n  let title = arxivId;\n  let abstract = \"\";\n  let paperAuthors = \"\";\n\n  const apiUrl = `https://export.arxiv.org/abs/${arxivId}`;\n  try {\n    const html = await safeFetchText(apiUrl);\n    const abstractMatch = html.match(\n      /class=\"abstract[^\"]*\"[^>]*>(.*?)<\\/blockquote>/is,\n    );\n    if (abstractMatch) {\n      abstract = abstractMatch[1]!.replace(/<[^>]+>/g, \"\").trim();\n    }\n    const titleMatch = html.match(\n      /class=\"title[^\"]*\"[^>]*>(.*?)<\\/h1>/is,\n    );\n    if (titleMatch) {\n      title = titleMatch[1]!.replace(/<[^>]+>/g, \" \").trim();\n    }\n    const authorsMatch = html.match(\n      /class=\"authors\"[^>]*>(.*?)<\\/div>/is,\n    );\n    if (authorsMatch) {\n      paperAuthors = authorsMatch[1]!.replace(/<[^>]+>/g, \"\").trim();\n    }\n  } catch {\n    // Use defaults set above\n  }\n\n  const now = new Date().toISOString();\n  const content = `---\nsource_url: ${url}\narxiv_id: ${arxivId}\ntype: paper\ntitle: \"${title}\"\npaper_authors: \"${paperAuthors}\"\ncaptured_at: ${now}\ncontributor: ${contributor ?? author ?? \"unknown\"}\n---\n\n# ${title}\n\n**Authors:** ${paperAuthors}\n**arXiv:** ${arxivId}\n\n## Abstract\n\n${abstract}\n\nSource: ${url}\n`;\n  const filename = `arxiv_${arxivId.replace(\".\", \"_\")}.md`;\n  return [content, filename];\n}\n\nasync function downloadBinary(\n  url: string,\n  suffix: string,\n  targetDir: string,\n): Promise<string> {\n  const filename = safeFilename(url, suffix);\n  const outPath = pathResolve(targetDir, filename);\n  const data = await safeFetch(url);\n  writeFileSync(outPath, data);\n  return outPath;\n}\n\ninterface IngestOptions {\n  author?: string | null;\n  contributor?: string | null;\n}\n\nfunction normalizeIngestOptions(\n  authorOrOptions: string | IngestOptions | null | undefined,\n  contributor: string | null | undefined,\n): { author: string | null; contributor: string | null } {\n  if (typeof authorOrOptions === \"string\" || authorOrOptions == null) {\n    return {\n      author: authorOrOptions ?? null,\n      contributor: contributor ?? null,\n    };\n  }\n\n  return {\n    author: authorOrOptions.author ?? null,\n    contributor: authorOrOptions.contributor ?? null,\n  };\n}\n\n// ---------------------------------------------------------------------------\n// Main ingest function\n// ---------------------------------------------------------------------------\n\nexport async function ingest(\n  url: string,\n  targetDir: string,\n  authorOrOptions: string | IngestOptions | null = null,\n  contributor: string | null = null,\n): Promise<string> {\n  mkdirSync(targetDir, { recursive: true });\n  const urlType = detectUrlType(url);\n  const { author, contributor: normalizedContributor } = normalizeIngestOptions(\n    authorOrOptions,\n    contributor,\n  );\n\n  await validateUrl(url);\n\n  let content: string;\n  let filename: string;\n\n  if (urlType === \"pdf\") {\n    const out = await downloadBinary(url, \".pdf\", targetDir);\n    console.log(`Downloaded PDF: ${basename(out)}`);\n    return out;\n  }\n\n  if (urlType === \"image\") {\n    let parsed: URL;\n    try {\n      parsed = new URL(url);\n    } catch {\n      throw new Error(`Invalid URL: ${url}`);\n    }\n    const suffix = extname(parsed.pathname) || \".jpg\";\n    const out = await downloadBinary(url, suffix, targetDir);\n    console.log(`Downloaded image: ${basename(out)}`);\n    return out;\n  }\n\n  if (urlType === \"youtube\") {\n    const out = downloadAudio(url, targetDir);\n    console.log(`Downloaded audio: ${basename(out)}`);\n    return out;\n  }\n\n  if (urlType === \"tweet\") {\n    [content, filename] = await fetchTweet(url, author, normalizedContributor);\n  } else if (urlType === \"arxiv\") {\n    [content, filename] = await fetchArxiv(url, author, normalizedContributor);\n  } else {\n    [content, filename] = await fetchWebpage(url, author, normalizedContributor);\n  }\n\n  let outPath = pathResolve(targetDir, filename);\n  let counter = 1;\n  while (existsSync(outPath)) {\n    const stem = filename.replace(/\\.md$/, \"\");\n    outPath = pathResolve(targetDir, `${stem}_${counter}.md`);\n    counter++;\n  }\n\n  writeFileSync(outPath, content, \"utf-8\");\n  console.log(`Saved ${urlType}: ${basename(outPath)}`);\n  return outPath;\n}\n\n// ---------------------------------------------------------------------------\n// Save query result (memory loop)\n// ---------------------------------------------------------------------------\n\nexport function saveQueryResult(\n  questionOrOptions:\n    | string\n    | {\n      question: string;\n      answer: string;\n      memoryDir: string;\n      queryType?: string;\n      sourceNodes?: string[] | null;\n    },\n  answer?: string,\n  memoryDir?: string,\n  queryType: string = \"query\",\n  sourceNodes: string[] | null = null,\n): string {\n  const payload = typeof questionOrOptions === \"string\"\n    ? {\n      question: questionOrOptions,\n      answer: answer ?? \"\",\n      memoryDir: memoryDir ?? \"\",\n      queryType,\n      sourceNodes,\n    }\n    : {\n      question: questionOrOptions.question,\n      answer: questionOrOptions.answer,\n      memoryDir: questionOrOptions.memoryDir,\n      queryType: questionOrOptions.queryType ?? \"query\",\n      sourceNodes: questionOrOptions.sourceNodes ?? null,\n    };\n\n  if (!payload.question) throw new Error(\"saveQueryResult requires a question\");\n  if (!payload.memoryDir) throw new Error(\"saveQueryResult requires a memoryDir\");\n\n  const effectiveAnswer = payload.answer ?? \"\";\n  mkdirSync(payload.memoryDir, { recursive: true });\n\n  const now = new Date();\n  const slug = payload.question\n    .toLowerCase()\n    .replace(/[^\\w]/g, \"_\")\n    .slice(0, 50)\n    .replace(/_+$/, \"\");\n  const ts = now\n    .toISOString()\n    .replace(/[-:]/g, \"\")\n    .replace(\"T\", \"_\")\n    .slice(0, 15);\n  const filename = `query_${ts}_${slug}.md`;\n\n  const frontmatterLines = [\n    \"---\",\n    `type: \"${payload.queryType}\"`,\n    `date: \"${now.toISOString()}\"`,\n    `question: \"${yamlStr(payload.question)}\"`,\n    'contributor: \"graphify\"',\n  ];\n  if (payload.sourceNodes && payload.sourceNodes.length > 0) {\n    const nodesStr = payload.sourceNodes\n      .slice(0, 10)\n      .map((n) => `\"${n}\"`)\n      .join(\", \");\n    frontmatterLines.push(`source_nodes: [${nodesStr}]`);\n  }\n  frontmatterLines.push(\"---\");\n\n  const bodyLines = [\n    \"\",\n    `# Q: ${payload.question}`,\n    \"\",\n    \"## Answer\",\n    \"\",\n    effectiveAnswer,\n  ];\n  if (payload.sourceNodes && payload.sourceNodes.length > 0) {\n    bodyLines.push(\"\", \"## Source Nodes\", \"\");\n    for (const n of payload.sourceNodes) {\n      bodyLines.push(`- ${n}`);\n    }\n  }\n\n  const content = [...frontmatterLines, ...bodyLines].join(\"\\n\");\n  const outPath = pathResolve(payload.memoryDir, filename);\n  writeFileSync(outPath, content, \"utf-8\");\n  return outPath;\n}\n\n// ---------------------------------------------------------------------------\n// CLI entry point\n// ---------------------------------------------------------------------------\n\nconst isDirectExecution = typeof process !== \"undefined\" &&\n  typeof process.argv[1] === \"string\" &&\n  /^ingest\\.(?:js|mjs|cjs|ts)$/.test(basename(process.argv[1]));\n\nif (isDirectExecution) {\n  const url = process.argv[2];\n  const targetDir = process.argv[3] ?? \"./raw\";\n  const author = process.argv[4] ?? null;\n  if (!url) {\n    console.error(\"Usage: ingest <url> [target_dir] [author]\");\n    process.exit(1);\n  }\n  ingest(url, targetDir, author)\n    .then((out) => console.log(`Ready for graphify: ${out}`))\n    .catch((err) => {\n      console.error(err);\n      process.exit(1);\n    });\n}\n","import * as childProcess from \"node:child_process\";\nimport { createHash } from \"node:crypto\";\nimport {\n  cpSync,\n  createWriteStream,\n  existsSync,\n  mkdirSync,\n  mkdtempSync,\n  readdirSync,\n  renameSync,\n  rmSync,\n  writeFileSync,\n} from \"node:fs\";\nimport { homedir, platform, tmpdir } from \"node:os\";\nimport { basename, dirname, extname, join, resolve } from \"node:path\";\nimport { Readable } from \"node:stream\";\nimport { pipeline } from \"node:stream/promises\";\nimport type { DetectionResult } from \"./types.js\";\n\nconst URL_PREFIXES = [\"http://\", \"https://\", \"www.\"];\nconst CACHED_AUDIO_EXTENSIONS = [\".m4a\", \".opus\", \".mp3\", \".ogg\", \".wav\", \".webm\"];\nconst DEFAULT_MODEL = \"base\";\nconst TRANSCRIPTS_DIR = \"graphify-out/transcripts\";\nconst FALLBACK_PROMPT = \"Use proper punctuation and paragraph breaks.\";\nconst SHERPA_RELEASE_BASE =\n  \"https://github.com/k2-fsa/sherpa-onnx/releases/download/asr-models\";\nconst AUDIO_SAMPLE_RATE = 16000;\nconst SUPPORTED_MODELS = new Set([\n  \"tiny\",\n  \"tiny.en\",\n  \"base\",\n  \"base.en\",\n  \"small\",\n  \"small.en\",\n  \"medium\",\n  \"medium.en\",\n  \"large-v1\",\n  \"large-v2\",\n  \"large-v3\",\n  \"turbo\",\n  \"distil-small.en\",\n  \"distil-medium.en\",\n  \"distil-large-v2\",\n  \"distil-large-v3\",\n  \"distil-large-v3.5\",\n]);\n\nconst MODEL_ALIASES: Record<string, string> = {\n  large: \"large-v3\",\n};\n\ninterface SherpaWave {\n  samples: Float32Array;\n  sampleRate: number;\n}\n\ninterface SherpaResult {\n  text?: string;\n}\n\ninterface SherpaStream {\n  acceptWaveform(input: SherpaWave): void;\n  setOption?(key: string, value: string): void;\n}\n\ninterface SherpaRecognizer {\n  createStream(): SherpaStream;\n  decodeAsync(stream: SherpaStream): Promise<SherpaResult>;\n}\n\ninterface SherpaModule {\n  OfflineRecognizer: {\n    createAsync(config: unknown): Promise<SherpaRecognizer>;\n  };\n  readWave(path: string): SherpaWave;\n}\n\ninterface WhisperArtifacts {\n  requestedModel: string;\n  resolvedModel: string;\n  modelDir: string;\n  encoderPath: string;\n  decoderPath: string;\n  tokensPath: string;\n}\n\nconst recognizerCache = new Map<string, Promise<SherpaRecognizer>>();\nlet sherpaModulePromise: Promise<SherpaModule> | null = null;\n\nfunction runCommand(\n  command: string,\n  args: string[],\n  options?: Omit<childProcess.SpawnSyncOptionsWithStringEncoding, \"encoding\">,\n): childProcess.SpawnSyncReturns<string> {\n  const result = childProcess.spawnSync(command, args, {\n    encoding: \"utf-8\",\n    ...options,\n  });\n  if (result.error) {\n    throw result.error;\n  }\n  if (result.status !== 0) {\n    throw new Error(result.stderr?.trim() || result.stdout?.trim() || `${command} failed`);\n  }\n  return result;\n}\n\nfunction defaultWhisperCacheDir(): string {\n  if (process.env.GRAPHIFY_WHISPER_CACHE_DIR) {\n    return resolve(process.env.GRAPHIFY_WHISPER_CACHE_DIR);\n  }\n  if (platform() === \"win32\") {\n    return join(\n      process.env.LOCALAPPDATA ?? join(homedir(), \"AppData\", \"Local\"),\n      \"graphify\",\n      \"whisper\",\n    );\n  }\n  return join(process.env.XDG_CACHE_HOME ?? join(homedir(), \".cache\"), \"graphify\", \"whisper\");\n}\n\nfunction ffmpegBinary(): string {\n  return process.env.GRAPHIFY_FFMPEG_BIN ?? \"ffmpeg\";\n}\n\nfunction tarBinary(): string {\n  return process.env.GRAPHIFY_TAR_BIN ?? \"tar\";\n}\n\nfunction resolveRequestedModel(modelName?: string): { requested: string; resolved: string } {\n  const requested = modelName ?? process.env.GRAPHIFY_WHISPER_MODEL ?? DEFAULT_MODEL;\n  const resolved = MODEL_ALIASES[requested] ?? requested;\n  if (!SUPPORTED_MODELS.has(resolved)) {\n    throw new Error(\n      `Unsupported GRAPHIFY_WHISPER_MODEL \"${requested}\". ` +\n      `Supported local TS models: ${[...SUPPORTED_MODELS].sort().join(\", \")}`,\n    );\n  }\n  return { requested, resolved };\n}\n\nfunction walkFiles(dir: string): string[] {\n  if (!existsSync(dir)) return [];\n  const files: string[] = [];\n  for (const entry of readdirSync(dir, { withFileTypes: true })) {\n    const fullPath = join(dir, entry.name);\n    if (entry.isDirectory()) {\n      files.push(...walkFiles(fullPath));\n    } else {\n      files.push(fullPath);\n    }\n  }\n  return files;\n}\n\nfunction findArtifactsIn(dir: string): Omit<WhisperArtifacts, \"requestedModel\" | \"resolvedModel\"> | null {\n  const files = walkFiles(dir);\n  const encoderPath =\n    files.find((path) => path.endsWith(\"-encoder.int8.onnx\"))\n    ?? files.find((path) => path.endsWith(\"-encoder.onnx\"));\n  const decoderPath =\n    files.find((path) => path.endsWith(\"-decoder.int8.onnx\"))\n    ?? files.find((path) => path.endsWith(\"-decoder.onnx\"));\n  const tokensPath = files.find((path) => path.endsWith(\"-tokens.txt\"));\n  if (!encoderPath || !decoderPath || !tokensPath) {\n    return null;\n  }\n  return {\n    modelDir: dir,\n    encoderPath,\n    decoderPath,\n    tokensPath,\n  };\n}\n\nfunction normalizeModelError(detail: string): string {\n  if (detail.includes(\"404\")) {\n    return `${detail}. The local sherpa-onnx release asset was not found for this Whisper model name.`;\n  }\n  return detail;\n}\n\nasync function writeResponseToFile(response: Response, destination: string): Promise<void> {\n  if (!response.ok || !response.body) {\n    throw new Error(`HTTP ${response.status} while downloading ${response.url}`);\n  }\n  await pipeline(Readable.fromWeb(response.body as globalThis.ReadableStream<Uint8Array>), createWriteStream(destination));\n}\n\nasync function ensureWhisperArtifacts(modelName?: string): Promise<WhisperArtifacts> {\n  const { requested, resolved } = resolveRequestedModel(modelName);\n  const cacheRoot = defaultWhisperCacheDir();\n  mkdirSync(cacheRoot, { recursive: true });\n\n  const modelDir = join(cacheRoot, `sherpa-onnx-whisper-${resolved}`);\n  const cached = findArtifactsIn(modelDir);\n  if (cached) {\n    return { requestedModel: requested, resolvedModel: resolved, ...cached };\n  }\n\n  const tempDir = mkdtempSync(join(tmpdir(), \"graphify-whisper-model-\"));\n  const extractDir = join(tempDir, \"extract\");\n  const archiveName = `sherpa-onnx-whisper-${resolved}.tar.bz2`;\n  const archivePath = join(tempDir, archiveName);\n  mkdirSync(extractDir, { recursive: true });\n\n  try {\n    const url = `${SHERPA_RELEASE_BASE}/${archiveName}`;\n    console.log(`  downloading whisper model: ${resolved}`);\n    const response = await fetch(url);\n    await writeResponseToFile(response, archivePath);\n\n    runCommand(tarBinary(), [\"-xjf\", archivePath, \"-C\", extractDir]);\n\n    const extractedRoot = walkFiles(extractDir)\n      .map((path) => dirname(path))\n      .find((path) => findArtifactsIn(path) !== null);\n    const sourceDir =\n      extractedRoot\n      ?? readdirSync(extractDir, { withFileTypes: true })\n        .filter((entry) => entry.isDirectory())\n        .map((entry) => join(extractDir, entry.name))\n        .find((path) => findArtifactsIn(path) !== null);\n\n    if (!sourceDir) {\n      throw new Error(`Downloaded archive for ${resolved} but could not locate Whisper model files`);\n    }\n\n    if (existsSync(modelDir)) {\n      rmSync(modelDir, { recursive: true, force: true });\n    }\n    try {\n      renameSync(sourceDir, modelDir);\n    } catch {\n      cpSync(sourceDir, modelDir, { recursive: true });\n    }\n\n    const artifacts = findArtifactsIn(modelDir);\n    if (!artifacts) {\n      throw new Error(`Model cache for ${resolved} is incomplete after extraction`);\n    }\n\n    return { requestedModel: requested, resolvedModel: resolved, ...artifacts };\n  } catch (error) {\n    const detail = error instanceof Error ? error.message : String(error);\n    throw new Error(normalizeModelError(detail));\n  } finally {\n    rmSync(tempDir, { recursive: true, force: true });\n  }\n}\n\nasync function loadSherpaModule(): Promise<SherpaModule> {\n  if (!sherpaModulePromise) {\n    sherpaModulePromise = import(\"sherpa-onnx-node\")\n      .then((imported) => (\n        Reflect.has(imported, \"default\")\n          ? Reflect.get(imported, \"default\")\n          : imported\n      ) as SherpaModule)\n      .catch((error) => {\n        sherpaModulePromise = null;\n        const detail = error instanceof Error ? error.message : String(error);\n        throw new Error(\n          \"Video transcription requires the optional dependency sherpa-onnx-node. \" +\n          `Install it locally, then retry. ${detail}`,\n        );\n      });\n  }\n  return sherpaModulePromise;\n}\n\nasync function getRecognizer(\n  modelName?: string,\n  sherpa?: SherpaModule,\n): Promise<{ recognizer: SherpaRecognizer; artifacts: WhisperArtifacts }> {\n  const artifacts = await ensureWhisperArtifacts(modelName);\n  const cacheKey = artifacts.modelDir;\n  const existing = recognizerCache.get(cacheKey);\n  if (existing) {\n    return { recognizer: await existing, artifacts };\n  }\n\n  const createRecognizer = (async () => {\n    const runtime = sherpa ?? (await loadSherpaModule());\n    return runtime.OfflineRecognizer.createAsync({\n      featConfig: {\n        sampleRate: AUDIO_SAMPLE_RATE,\n        featureDim: 80,\n      },\n      modelConfig: {\n        whisper: {\n          encoder: artifacts.encoderPath,\n          decoder: artifacts.decoderPath,\n          task: \"transcribe\",\n        },\n        tokens: artifacts.tokensPath,\n        numThreads: 1,\n        provider: \"cpu\",\n        debug: 0,\n      },\n    });\n  })();\n\n  recognizerCache.set(\n    cacheKey,\n    createRecognizer.catch((error) => {\n      recognizerCache.delete(cacheKey);\n      throw error;\n    }),\n  );\n\n  return { recognizer: await recognizerCache.get(cacheKey)!, artifacts };\n}\n\nfunction normalizeToWave(audioPath: string, workingDir: string): string {\n  const wavPath = join(workingDir, `${basename(audioPath, extname(audioPath))}.wav`);\n  try {\n    runCommand(ffmpegBinary(), [\n      \"-y\",\n      \"-i\",\n      audioPath,\n      \"-vn\",\n      \"-ac\",\n      \"1\",\n      \"-ar\",\n      String(AUDIO_SAMPLE_RATE),\n      \"-c:a\",\n      \"pcm_s16le\",\n      wavPath,\n    ]);\n  } catch (error) {\n    const detail = error instanceof Error ? error.message : String(error);\n    throw new Error(\n      \"Video transcription requires ffmpeg in PATH. \" +\n      `Install ffmpeg locally, then retry. ${detail}`,\n    );\n  }\n  return wavPath;\n}\n\nfunction extractTranscriptText(result: SherpaResult): string {\n  return String(result.text ?? \"\").trim();\n}\n\nexport function isUrl(pathLike: string): boolean {\n  return URL_PREFIXES.some((prefix) => pathLike.startsWith(prefix));\n}\n\nexport function downloadAudio(url: string, outputDir: string): string {\n  mkdirSync(outputDir, { recursive: true });\n\n  const urlHash = createHash(\"sha1\").update(url).digest(\"hex\").slice(0, 12);\n  for (const ext of CACHED_AUDIO_EXTENSIONS) {\n    const candidate = join(outputDir, `yt_${urlHash}${ext}`);\n    if (existsSync(candidate)) {\n      console.log(`  cached audio: ${basename(candidate)}`);\n      return candidate;\n    }\n  }\n\n  const outTemplate = join(outputDir, `yt_${urlHash}.%(ext)s`);\n  try {\n    console.log(`  downloading audio: ${url.slice(0, 80)} ...`);\n    runCommand(\"yt-dlp\", [\n      \"-f\",\n      \"bestaudio[ext=m4a]/bestaudio/best\",\n      \"-o\",\n      outTemplate,\n      \"--quiet\",\n      \"--no-warnings\",\n      \"--no-playlist\",\n      url,\n    ]);\n  } catch (error) {\n    const detail = error instanceof Error ? error.message : String(error);\n    throw new Error(\n      `YouTube/URL download requires yt-dlp. Install yt-dlp to enable video ingestion. ${detail}`,\n    );\n  }\n\n  for (const entry of readdirSync(outputDir)) {\n    if (entry.startsWith(`yt_${urlHash}.`)) {\n      return join(outputDir, entry);\n    }\n  }\n\n  throw new Error(`yt-dlp finished without producing an audio file for ${url}`);\n}\n\nexport function buildWhisperPrompt(\n  godNodes: Array<{ label?: string | null }>,\n): string {\n  const override = process.env.GRAPHIFY_WHISPER_PROMPT;\n  if (override) return override;\n\n  const labels = godNodes\n    .map((node) => node.label ?? \"\")\n    .filter((label): label is string => Boolean(label))\n    .slice(0, 5);\n  if (labels.length === 0) {\n    return FALLBACK_PROMPT;\n  }\n  return `Technical discussion about ${labels.join(\", \")}. ${FALLBACK_PROMPT}`;\n}\n\nexport async function transcribe(\n  videoPath: string,\n  outputDir: string = TRANSCRIPTS_DIR,\n  initialPrompt?: string,\n  force: boolean = false,\n): Promise<string> {\n  const outDir = resolve(outputDir);\n  mkdirSync(outDir, { recursive: true });\n\n  const audioPath = isUrl(videoPath)\n    ? downloadAudio(videoPath, join(outDir, \"downloads\"))\n    : resolve(videoPath);\n  const transcriptPath = join(outDir, `${basename(audioPath, extname(audioPath))}.txt`);\n\n  if (existsSync(transcriptPath) && !force) {\n    return transcriptPath;\n  }\n\n  const prompt = initialPrompt ?? process.env.GRAPHIFY_WHISPER_PROMPT ?? FALLBACK_PROMPT;\n  const requestedModel = process.env.GRAPHIFY_WHISPER_MODEL ?? DEFAULT_MODEL;\n  const tempDir = mkdtempSync(join(tmpdir(), \"graphify-transcribe-\"));\n\n  try {\n    console.log(`  transcribing ${basename(audioPath)} (model=${requestedModel}) ...`);\n    const wavPath = normalizeToWave(audioPath, tempDir);\n    const sherpa = await loadSherpaModule();\n    const { recognizer, artifacts } = await getRecognizer(requestedModel, sherpa);\n    const wave = sherpa.readWave(wavPath);\n    const stream = recognizer.createStream();\n    if (prompt && typeof stream.setOption === \"function\") {\n      try {\n        stream.setOption(\"prompt\", prompt);\n      } catch {\n        /* ignored: sherpa-onnx does not guarantee prompt support across builds */\n      }\n    }\n    stream.acceptWaveform({ samples: wave.samples, sampleRate: wave.sampleRate });\n    const result = await recognizer.decodeAsync(stream);\n    const transcript = extractTranscriptText(result);\n    writeFileSync(transcriptPath, transcript, \"utf-8\");\n    if (artifacts.requestedModel !== artifacts.resolvedModel) {\n      console.log(`  model alias: ${artifacts.requestedModel} -> ${artifacts.resolvedModel}`);\n    }\n  } catch (error) {\n    if (error instanceof Error && error.message.startsWith(\"Unsupported GRAPHIFY_WHISPER_MODEL\")) {\n      throw error;\n    }\n    const detail = error instanceof Error ? error.message : String(error);\n    throw new Error(\n      \"Video transcription requires the local TypeScript toolchain: sherpa-onnx-node + ffmpeg. \" +\n      `Retry after installing them. ${detail}`,\n    );\n  } finally {\n    rmSync(tempDir, { recursive: true, force: true });\n  }\n\n  return transcriptPath;\n}\n\nexport async function transcribeAll(\n  videoFiles: string[],\n  outputDir?: string,\n  initialPrompt?: string,\n  force: boolean = false,\n): Promise<string[]> {\n  if (videoFiles.length === 0) {\n    return [];\n  }\n\n  const transcriptPaths: string[] = [];\n  for (const videoFile of videoFiles) {\n    try {\n      transcriptPaths.push(await transcribe(videoFile, outputDir, initialPrompt, force));\n    } catch (error) {\n      const detail = error instanceof Error ? error.message : String(error);\n      console.log(`  warning: could not transcribe ${videoFile}: ${detail}`);\n    }\n  }\n  return transcriptPaths;\n}\n\nfunction cloneDetection(detection: DetectionResult): DetectionResult {\n  return JSON.parse(JSON.stringify(detection)) as DetectionResult;\n}\n\nexport async function augmentDetectionWithTranscripts(\n  detection: DetectionResult,\n  options?: {\n    outputDir?: string;\n    initialPrompt?: string;\n    godNodes?: Array<{ label?: string | null }>;\n    incremental?: boolean;\n    whisperModel?: string;\n  },\n): Promise<{ detection: DetectionResult; transcriptPaths: string[]; prompt: string }> {\n  const nextDetection = cloneDetection(detection);\n  const source = options?.incremental && nextDetection.new_files ? nextDetection.new_files : nextDetection.files;\n  const videoFiles = [...(source.video ?? [])];\n  const prompt = options?.initialPrompt ?? buildWhisperPrompt(options?.godNodes ?? []);\n\n  if (videoFiles.length === 0) {\n    return { detection: nextDetection, transcriptPaths: [], prompt };\n  }\n\n  const previousModel = process.env.GRAPHIFY_WHISPER_MODEL;\n  if (options?.whisperModel) {\n    process.env.GRAPHIFY_WHISPER_MODEL = options.whisperModel;\n  }\n\n  try {\n    const transcriptPaths = await transcribeAll(\n      videoFiles,\n      options?.outputDir,\n      prompt,\n      options?.incremental === true,\n    );\n    const existingDocuments = source.document ?? [];\n    source.document = [...existingDocuments, ...transcriptPaths];\n    return { detection: nextDetection, transcriptPaths, prompt };\n  } finally {\n    if (options?.whisperModel) {\n      if (previousModel === undefined) {\n        delete process.env.GRAPHIFY_WHISPER_MODEL;\n      } else {\n        process.env.GRAPHIFY_WHISPER_MODEL = previousModel;\n      }\n    }\n  }\n}\n","/**\n * MCP stdio server - exposes graph query tools to Claude and other agents.\n *\n * Uses @modelcontextprotocol/sdk for the server and graphology for the graph.\n */\nimport { readFileSync } from \"node:fs\";\nimport Graph from \"graphology\";\nimport { bidirectional } from \"graphology-shortest-path/unweighted.js\";\nimport { basename, dirname, resolve } from \"node:path\";\nimport {\n  forEachTraversalNeighbor,\n  loadGraphFromData,\n  type SerializedGraphData,\n} from \"./graph.js\";\nimport { validateGraphPath, sanitizeLabel } from \"./security.js\";\nimport { godNodes as computeGodNodes } from \"./analyze.js\";\nimport type { Transport } from \"@modelcontextprotocol/sdk/shared/transport.js\";\n\n// ---------------------------------------------------------------------------\n// Graph loading\n// ---------------------------------------------------------------------------\n\nfunction loadGraph(graphPath: string): Graph {\n  let safePath: string;\n  try {\n    safePath = validateGraphPath(graphPath, dirname(resolve(graphPath)));\n  } catch (err) {\n    console.error(`error: ${err instanceof Error ? err.message : err}`);\n    process.exit(1);\n  }\n\n  let data: SerializedGraphData;\n  try {\n    data = JSON.parse(readFileSync(safePath, \"utf-8\")) as SerializedGraphData;\n  } catch (err) {\n    console.error(\n      `error: graph.json is corrupted (${err instanceof Error ? err.message : err}). Re-run the graphify skill to rebuild it (for Codex: $graphify .).`,\n    );\n    process.exit(1);\n  }\n\n  return loadGraphFromData(data);\n}\n\n// ---------------------------------------------------------------------------\n// Helpers\n// ---------------------------------------------------------------------------\n\nfunction communitiesFromGraph(G: Graph): Map<number, string[]> {\n  const communities = new Map<number, string[]>();\n  G.forEachNode((nodeId, data) => {\n    const cid = data.community as number | undefined;\n    if (cid !== undefined && cid !== null) {\n      if (!communities.has(cid)) communities.set(cid, []);\n      communities.get(cid)!.push(nodeId);\n    }\n  });\n  return communities;\n}\n\nfunction communityName(G: Graph, cid: number | string | null | undefined): string | null {\n  if (cid === undefined || cid === null) return null;\n  const labels = G.getAttribute(\"community_labels\") as Record<string, unknown> | undefined;\n  const fromGraph = labels?.[String(cid)];\n  if (typeof fromGraph === \"string\" && fromGraph.length > 0) {\n    return sanitizeLabel(fromGraph);\n  }\n  return null;\n}\n\nfunction scoreNodes(G: Graph, terms: string[]): Array<[number, string]> {\n  const scored: Array<[number, string]> = [];\n  G.forEachNode((nid, data) => {\n    const label = ((data.label as string) ?? \"\").toLowerCase();\n    const source = ((data.source_file as string) ?? \"\").toLowerCase();\n    const score =\n      terms.reduce((s, t) => s + (label.includes(t) ? 1 : 0), 0) +\n      terms.reduce((s, t) => s + (source.includes(t) ? 0.5 : 0), 0);\n    if (score > 0) scored.push([score, nid]);\n  });\n  scored.sort((a, b) => b[0] - a[0]);\n  return scored;\n}\n\nfunction bfs(\n  G: Graph,\n  startNodes: string[],\n  depth: number,\n): { visited: Set<string>; edges: Array<[string, string]> } {\n  const visited = new Set<string>(startNodes);\n  let frontier = new Set<string>(startNodes);\n  const edges: Array<[string, string]> = [];\n  for (let i = 0; i < depth; i++) {\n    const nextFrontier = new Set<string>();\n    for (const n of frontier) {\n      forEachTraversalNeighbor(G, n, (neighbor) => {\n        if (!visited.has(neighbor)) {\n          nextFrontier.add(neighbor);\n          edges.push([n, neighbor]);\n        }\n      });\n    }\n    for (const n of nextFrontier) visited.add(n);\n    frontier = nextFrontier;\n  }\n  return { visited, edges };\n}\n\nfunction dfs(\n  G: Graph,\n  startNodes: string[],\n  depth: number,\n): { visited: Set<string>; edges: Array<[string, string]> } {\n  const visited = new Set<string>();\n  const edges: Array<[string, string]> = [];\n  const stack: Array<[string, number]> = [...startNodes].reverse().map((n) => [n, 0]);\n  while (stack.length > 0) {\n    const [node, d] = stack.pop()!;\n    if (visited.has(node) || d > depth) continue;\n    visited.add(node);\n    forEachTraversalNeighbor(G, node, (neighbor) => {\n      if (!visited.has(neighbor)) {\n        stack.push([neighbor, d + 1]);\n        edges.push([node, neighbor]);\n      }\n    });\n  }\n  return { visited, edges };\n}\n\nfunction subgraphToText(\n  G: Graph,\n  nodes: Set<string>,\n  edges: Array<[string, string]>,\n  tokenBudget: number = 2000,\n): string {\n  const charBudget = tokenBudget * 3;\n  const lines: string[] = [];\n\n  const sorted = [...nodes].sort((a, b) => G.degree(b) - G.degree(a));\n  for (const nid of sorted) {\n    const d = G.getNodeAttributes(nid);\n    lines.push(\n      `NODE ${sanitizeLabel((d.label as string) ?? nid)} [src=${d.source_file ?? \"\"} loc=${d.source_location ?? \"\"} community=${d.community ?? \"\"}]`,\n    );\n  }\n  for (const [u, v] of edges) {\n    if (nodes.has(u) && nodes.has(v)) {\n      const edgeKey = G.edge(u, v);\n      if (!edgeKey) continue;\n      const d = G.getEdgeAttributes(edgeKey);\n      lines.push(\n        `EDGE ${sanitizeLabel((G.getNodeAttribute(u, \"label\") as string) ?? u)} --${d.relation ?? \"\"} [${d.confidence ?? \"\"}]--> ${sanitizeLabel((G.getNodeAttribute(v, \"label\") as string) ?? v)}`,\n      );\n    }\n  }\n  let output = lines.join(\"\\n\");\n  if (output.length > charBudget) {\n    output = output.slice(0, charBudget) + `\\n... (truncated to ~${tokenBudget} token budget)`;\n  }\n  return output;\n}\n\nfunction findNode(G: Graph, label: string): string[] {\n  const term = label.toLowerCase();\n  const result: string[] = [];\n  G.forEachNode((nid, d) => {\n    if (\n      ((d.label as string) ?? \"\").toLowerCase().includes(term) ||\n      nid.toLowerCase() === term\n    ) {\n      result.push(nid);\n    }\n  });\n  return result;\n}\n\n// ---------------------------------------------------------------------------\n// Tool handlers\n// ---------------------------------------------------------------------------\n\nfunction toolQueryGraph(G: Graph, args: Record<string, unknown>): string {\n  const question = args.question as string;\n  const mode = (args.mode as string) ?? \"bfs\";\n  const depth = Math.min(Number(args.depth ?? 3), 6);\n  const budget = Number(args.token_budget ?? 2000);\n  const terms = question\n    .split(/\\s+/)\n    .filter((t) => t.length > 2)\n    .map((t) => t.toLowerCase());\n\n  const scored = scoreNodes(G, terms);\n  const startNodes = scored.slice(0, 3).map(([, nid]) => nid);\n  if (startNodes.length === 0) return \"No matching nodes found.\";\n\n  const { visited, edges } =\n    mode === \"dfs\" ? dfs(G, startNodes, depth) : bfs(G, startNodes, depth);\n\n  const startLabels = startNodes.map(\n    (n) => (G.getNodeAttribute(n, \"label\") as string) ?? n,\n  );\n  const header = `Traversal: ${mode.toUpperCase()} depth=${depth} | Start: [${startLabels.join(\", \")}] | ${visited.size} nodes found\\n\\n`;\n  return header + subgraphToText(G, visited, edges, budget);\n}\n\nfunction toolGetNode(G: Graph, args: Record<string, unknown>): string {\n  const label = (args.label as string).toLowerCase();\n  const matches: Array<[string, Record<string, unknown>]> = [];\n  G.forEachNode((nid, d) => {\n    if (\n      ((d.label as string) ?? \"\").toLowerCase().includes(label) ||\n      nid.toLowerCase() === label\n    ) {\n      matches.push([nid, d]);\n    }\n  });\n  if (matches.length === 0) return `No node matching '${label}' found.`;\n  const [nid, d] = matches[0]!;\n  return [\n    `Node: ${d.label ?? nid}`,\n    `  ID: ${nid}`,\n    `  Source: ${d.source_file ?? \"\"} ${d.source_location ?? \"\"}`,\n    `  Type: ${d.file_type ?? \"\"}`,\n    `  Community: ${\n      d.community_name\n        ? `${d.community ?? \"\"} (${d.community_name as string})`\n        : (communityName(G, d.community as number | undefined) ?? String(d.community ?? \"\"))\n    }`,\n    `  Degree: ${G.degree(nid)}`,\n  ].join(\"\\n\");\n}\n\nfunction toolGetNeighbors(G: Graph, args: Record<string, unknown>): string {\n  const label = (args.label as string).toLowerCase();\n  const relFilter = ((args.relation_filter as string) ?? \"\").toLowerCase();\n  const matches = findNode(G, label);\n  if (matches.length === 0) return `No node matching '${label}' found.`;\n  const nid = matches[0]!;\n  const lines = [`Neighbors of ${(G.getNodeAttribute(nid, \"label\") as string) ?? nid}:`];\n  forEachTraversalNeighbor(G, nid, (neighbor) => {\n    const edgeKey = G.edge(nid, neighbor);\n    if (!edgeKey) return;\n    const d = G.getEdgeAttributes(edgeKey);\n    const rel = (d.relation as string) ?? \"\";\n    if (relFilter && !rel.toLowerCase().includes(relFilter)) return;\n    lines.push(\n      `  --> ${(G.getNodeAttribute(neighbor, \"label\") as string) ?? neighbor} [${rel}] [${d.confidence ?? \"\"}]`,\n    );\n  });\n  return lines.join(\"\\n\");\n}\n\nfunction toolGetCommunity(\n  communities: Map<number, string[]>,\n  G: Graph,\n  args: Record<string, unknown>,\n): string {\n  const cid = Number(args.community_id);\n  const nodes = communities.get(cid);\n  if (!nodes || nodes.length === 0) return `Community ${cid} not found.`;\n  const label = communityName(G, cid);\n  const lines = [label\n    ? `Community ${cid} - ${label} (${nodes.length} nodes):`\n    : `Community ${cid} (${nodes.length} nodes):`];\n  for (const n of nodes) {\n    const d = G.getNodeAttributes(n);\n    lines.push(`  ${d.label ?? n} [${d.source_file ?? \"\"}]`);\n  }\n  return lines.join(\"\\n\");\n}\n\nfunction toolGodNodes(G: Graph, args: Record<string, unknown>): string {\n  const topN = Number(args.top_n ?? 10);\n  const nodes = computeGodNodes(G, topN);\n  const lines = [\"God nodes (most connected):\"];\n  nodes.forEach((n, i) => {\n    lines.push(`  ${i + 1}. ${n.label} - ${n.edges} edges`);\n  });\n  return lines.join(\"\\n\");\n}\n\nfunction toolGraphStats(\n  G: Graph,\n  communities: Map<number, string[]>,\n): string {\n  const confs: string[] = [];\n  G.forEachEdge((_, data) => {\n    confs.push((data.confidence as string) ?? \"EXTRACTED\");\n  });\n  const total = confs.length || 1;\n  return [\n    `Nodes: ${G.order}`,\n    `Edges: ${G.size}`,\n    `Communities: ${communities.size}`,\n    `EXTRACTED: ${Math.round((confs.filter((c) => c === \"EXTRACTED\").length / total) * 100)}%`,\n    `INFERRED: ${Math.round((confs.filter((c) => c === \"INFERRED\").length / total) * 100)}%`,\n    `AMBIGUOUS: ${Math.round((confs.filter((c) => c === \"AMBIGUOUS\").length / total) * 100)}%`,\n  ].join(\"\\n\");\n}\n\nfunction toolShortestPath(G: Graph, args: Record<string, unknown>): string {\n  const srcTerms = (args.source as string)\n    .split(/\\s+/)\n    .map((t) => t.toLowerCase());\n  const tgtTerms = (args.target as string)\n    .split(/\\s+/)\n    .map((t) => t.toLowerCase());\n  const srcScored = scoreNodes(G, srcTerms);\n  const tgtScored = scoreNodes(G, tgtTerms);\n\n  if (srcScored.length === 0)\n    return `No node matching source '${args.source}' found.`;\n  if (tgtScored.length === 0)\n    return `No node matching target '${args.target}' found.`;\n\n  const srcNid = srcScored[0]![1];\n  const tgtNid = tgtScored[0]![1];\n  const maxHops = Number(args.max_hops ?? 8);\n\n  const pathNodes = bidirectional(G, srcNid, tgtNid);\n  if (!pathNodes) {\n    return `No path found between '${(G.getNodeAttribute(srcNid, \"label\") as string) ?? srcNid}' and '${(G.getNodeAttribute(tgtNid, \"label\") as string) ?? tgtNid}'.`;\n  }\n\n  const hops = pathNodes.length - 1;\n  if (hops > maxHops) return `Path exceeds max_hops=${maxHops} (${hops} hops found).`;\n\n  const segments: string[] = [];\n  for (let i = 0; i < pathNodes.length - 1; i++) {\n    const u = pathNodes[i]!;\n    const v = pathNodes[i + 1]!;\n    const edgeKey = G.edge(u, v);\n    const edata = edgeKey ? G.getEdgeAttributes(edgeKey) : {};\n    const rel = (edata.relation as string) ?? \"\";\n    const conf = (edata.confidence as string) ?? \"\";\n    const confStr = conf ? ` [${conf}]` : \"\";\n    if (i === 0) {\n      segments.push((G.getNodeAttribute(u, \"label\") as string) ?? u);\n    }\n    segments.push(\n      `--${rel}${confStr}--> ${(G.getNodeAttribute(v, \"label\") as string) ?? v}`,\n    );\n  }\n  return `Shortest path (${hops} hops):\\n  ${segments.join(\" \")}`;\n}\n\n// ---------------------------------------------------------------------------\n// Server\n// ---------------------------------------------------------------------------\n\nexport async function serve(\n  graphPath: string = \"graphify-out/graph.json\",\n  transport?: Transport,\n): Promise<void> {\n  let Server: typeof import(\"@modelcontextprotocol/sdk/server/index.js\").Server;\n  let StdioServerTransport: typeof import(\"@modelcontextprotocol/sdk/server/stdio.js\").StdioServerTransport;\n  let ListToolsRequestSchema: typeof import(\"@modelcontextprotocol/sdk/types.js\").ListToolsRequestSchema;\n  let CallToolRequestSchema: typeof import(\"@modelcontextprotocol/sdk/types.js\").CallToolRequestSchema;\n\n  try {\n    const serverMod = await import(\"@modelcontextprotocol/sdk/server/index.js\");\n    const stdioMod = await import(\"@modelcontextprotocol/sdk/server/stdio.js\");\n    const typesMod = await import(\"@modelcontextprotocol/sdk/types.js\");\n    Server = serverMod.Server;\n    StdioServerTransport = stdioMod.StdioServerTransport;\n    ListToolsRequestSchema = typesMod.ListToolsRequestSchema;\n    CallToolRequestSchema = typesMod.CallToolRequestSchema;\n  } catch {\n    throw new Error(\n      \"@modelcontextprotocol/sdk not installed. Run: npm install @modelcontextprotocol/sdk\",\n    );\n  }\n\n  const G = loadGraph(graphPath);\n  const communities = communitiesFromGraph(G);\n\n  const server = new Server(\n    { name: \"graphify\", version: \"0.3.17\" },\n    { capabilities: { tools: {} } },\n  );\n\n  server.setRequestHandler(ListToolsRequestSchema, async () => ({\n    tools: [\n      {\n        name: \"query_graph\",\n        description:\n          \"Search the knowledge graph using BFS or DFS. Returns relevant nodes and edges as text context.\",\n        inputSchema: {\n          type: \"object\" as const,\n          properties: {\n            question: {\n              type: \"string\",\n              description: \"Natural language question or keyword search\",\n            },\n            mode: {\n              type: \"string\",\n              enum: [\"bfs\", \"dfs\"],\n              default: \"bfs\",\n              description: \"bfs=broad context, dfs=trace a specific path\",\n            },\n            depth: {\n              type: \"integer\",\n              default: 3,\n              description: \"Traversal depth (1-6)\",\n            },\n            token_budget: {\n              type: \"integer\",\n              default: 2000,\n              description: \"Max output tokens\",\n            },\n          },\n          required: [\"question\"],\n        },\n      },\n      {\n        name: \"get_node\",\n        description: \"Get full details for a specific node by label or ID.\",\n        inputSchema: {\n          type: \"object\" as const,\n          properties: {\n            label: {\n              type: \"string\",\n              description: \"Node label or ID to look up\",\n            },\n          },\n          required: [\"label\"],\n        },\n      },\n      {\n        name: \"get_neighbors\",\n        description:\n          \"Get all direct neighbors of a node with edge details.\",\n        inputSchema: {\n          type: \"object\" as const,\n          properties: {\n            label: { type: \"string\" },\n            relation_filter: {\n              type: \"string\",\n              description: \"Optional: filter by relation type\",\n            },\n          },\n          required: [\"label\"],\n        },\n      },\n      {\n        name: \"get_community\",\n        description: \"Get all nodes in a community by community ID.\",\n        inputSchema: {\n          type: \"object\" as const,\n          properties: {\n            community_id: {\n              type: \"integer\",\n              description: \"Community ID (0-indexed by size)\",\n            },\n          },\n          required: [\"community_id\"],\n        },\n      },\n      {\n        name: \"god_nodes\",\n        description:\n          \"Return the most connected nodes - the core abstractions of the knowledge graph.\",\n        inputSchema: {\n          type: \"object\" as const,\n          properties: {\n            top_n: { type: \"integer\", default: 10 },\n          },\n        },\n      },\n      {\n        name: \"graph_stats\",\n        description:\n          \"Return summary statistics: node count, edge count, communities, confidence breakdown.\",\n        inputSchema: { type: \"object\" as const, properties: {} },\n      },\n      {\n        name: \"shortest_path\",\n        description:\n          \"Find the shortest path between two concepts in the knowledge graph.\",\n        inputSchema: {\n          type: \"object\" as const,\n          properties: {\n            source: {\n              type: \"string\",\n              description: \"Source concept label or keyword\",\n            },\n            target: {\n              type: \"string\",\n              description: \"Target concept label or keyword\",\n            },\n            max_hops: {\n              type: \"integer\",\n              default: 8,\n              description: \"Maximum hops to consider\",\n            },\n          },\n          required: [\"source\", \"target\"],\n        },\n      },\n    ],\n  }));\n\n  const handlers: Record<\n    string,\n    (args: Record<string, unknown>) => string\n  > = {\n    query_graph: (a) => toolQueryGraph(G, a),\n    get_node: (a) => toolGetNode(G, a),\n    get_neighbors: (a) => toolGetNeighbors(G, a),\n    get_community: (a) => toolGetCommunity(communities, G, a),\n    god_nodes: (a) => toolGodNodes(G, a),\n    graph_stats: () => toolGraphStats(G, communities),\n    shortest_path: (a) => toolShortestPath(G, a),\n  };\n\n  server.setRequestHandler(CallToolRequestSchema, async (request) => {\n    const { name, arguments: args } = request.params;\n    const handler = handlers[name];\n    if (!handler) {\n      return { content: [{ type: \"text\" as const, text: `Unknown tool: ${name}` }] };\n    }\n    try {\n      const text = handler((args ?? {}) as Record<string, unknown>);\n      return { content: [{ type: \"text\" as const, text }] };\n    } catch (err) {\n      const message = err instanceof Error ? err.message : String(err);\n      return { content: [{ type: \"text\" as const, text: `Error executing ${name}: ${message}` }] };\n    }\n  });\n\n  const serverTransport = transport ?? new StdioServerTransport();\n  let keepAlive: NodeJS.Timeout | undefined;\n  if (!transport) {\n    keepAlive = setInterval(() => undefined, 60_000);\n    process.stdin?.resume();\n  }\n\n  const closed = new Promise<void>((resolve) => {\n    const previousOnClose = server.onclose;\n    server.onclose = () => {\n      if (keepAlive) {\n        clearInterval(keepAlive);\n      }\n      previousOnClose?.();\n      resolve();\n    };\n  });\n\n  await server.connect(serverTransport);\n  if (transport) {\n    await closed;\n  }\n}\n\n// ---------------------------------------------------------------------------\n// CLI entry point\n// ---------------------------------------------------------------------------\n\nconst isDirectExecution = typeof process !== \"undefined\" &&\n  typeof process.argv[1] === \"string\" &&\n  /^serve\\.(?:js|mjs|cjs|ts)$/.test(basename(process.argv[1]));\n\nif (isDirectExecution) {\n  const graphPath = process.argv[2] ?? \"graphify-out/graph.json\";\n  serve(graphPath).catch((err) => {\n    console.error(err);\n    process.exit(1);\n  });\n}\n","/**\n * File watcher - monitor a folder and auto-trigger graph rebuild when files change.\n *\n * Uses chokidar instead of Python watchdog.\n * Code-only changes rebuild graph automatically (no LLM needed).\n * Doc/paper/image changes write a flag and notify the user.\n */\nimport { existsSync, mkdirSync, writeFileSync, unlinkSync } from \"node:fs\";\nimport { resolve as pathResolve, extname, basename } from \"node:path\";\nimport {\n  CODE_EXTENSIONS,\n  DOC_EXTENSIONS,\n  PAPER_EXTENSIONS,\n  IMAGE_EXTENSIONS,\n} from \"./detect.js\";\n\nconst WATCHED_EXTENSIONS = new Set([\n  ...CODE_EXTENSIONS,\n  ...DOC_EXTENSIONS,\n  ...PAPER_EXTENSIONS,\n  ...IMAGE_EXTENSIONS,\n]);\n\n// ---------------------------------------------------------------------------\n// Rebuild pipeline (code-only, no LLM)\n// ---------------------------------------------------------------------------\n\nexport async function rebuildCode(\n  watchPath: string,\n  followSymlinks: boolean = false,\n): Promise<boolean> {\n  try {\n    // Dynamic imports - these modules are in the same package\n    const { collectFiles, extractWithDiagnostics } = await import(\"./extract.js\");\n    const { buildFromJson } = await import(\"./build.js\");\n    const { cluster, scoreAll } = await import(\"./cluster.js\");\n    const { godNodes, surprisingConnections, suggestQuestions } = await import(\"./analyze.js\");\n    const { generate } = await import(\"./report.js\");\n    const { toJson } = await import(\"./export.js\");\n\n    let codeFiles = await collectFiles(watchPath, { followSymlinks });\n    codeFiles = codeFiles.filter(\n      (f: string) =>\n        !f.includes(\"graphify-out\") &&\n        !f.includes(\"__pycache__\") &&\n        !f.includes(\"node_modules\"),\n    );\n\n    if (codeFiles.length === 0) {\n      console.log(\"[graphify watch] No code files found - nothing to rebuild.\");\n      return false;\n    }\n\n    const { extraction: result, diagnostics } = await extractWithDiagnostics(codeFiles);\n    if (diagnostics.length > 0) {\n      console.log(\n        `[graphify watch] AST extraction failed for ${diagnostics.length} file(s): ` +\n        `${diagnostics.slice(0, 3).map((d) => `${d.filePath}: ${d.error}`).join(\" | \")}`,\n      );\n    }\n    if (result.nodes.length === 0) {\n      console.log(\"[graphify watch] Rebuild failed: AST extraction produced no graph nodes.\");\n      return false;\n    }\n\n    const detection = {\n      files: {\n        code: codeFiles,\n        document: [] as string[],\n        paper: [] as string[],\n        image: [] as string[],\n      },\n      total_files: codeFiles.length,\n      total_words: 0,\n      needs_graph: true,\n      warning: null,\n      skipped_sensitive: [] as string[],\n      graphifyignore_patterns: 0,\n    };\n\n    const G = buildFromJson(result);\n    const communities = cluster(G);\n    const cohesion = scoreAll(G, communities);\n    const gods = godNodes(G);\n    const surprises = surprisingConnections(G, communities);\n    const labels = new Map<number, string>();\n    for (const cid of communities.keys()) {\n      labels.set(cid, `Community ${cid}`);\n    }\n    const questions = suggestQuestions(G, communities, labels);\n\n    const outDir = pathResolve(watchPath, \"graphify-out\");\n    mkdirSync(outDir, { recursive: true });\n\n    const report = generate(\n      G,\n      communities,\n      cohesion,\n      labels,\n      gods,\n      surprises,\n      detection,\n      { input: 0, output: 0 },\n      watchPath,\n      questions,\n    );\n    writeFileSync(pathResolve(outDir, \"GRAPH_REPORT.md\"), report, \"utf-8\");\n    toJson(G, communities, pathResolve(outDir, \"graph.json\"), { communityLabels: labels });\n\n    // Clear stale needs_update flag if present\n    const flagPath = pathResolve(outDir, \"needs_update\");\n    if (existsSync(flagPath)) {\n      unlinkSync(flagPath);\n    }\n\n    console.log(\n      `[graphify watch] Rebuilt: ${G.order} nodes, ${G.size} edges, ${communities.size} communities`,\n    );\n    console.log(\n      `[graphify watch] graph.json and GRAPH_REPORT.md updated in ${outDir}`,\n    );\n    return true;\n  } catch (err) {\n    console.log(\n      `[graphify watch] Rebuild failed: ${err instanceof Error ? err.message : err}`,\n    );\n    return false;\n  }\n}\n\n// ---------------------------------------------------------------------------\n// Notification fallback (non-code changes)\n// ---------------------------------------------------------------------------\n\nfunction notifyOnly(watchPath: string): void {\n  const outDir = pathResolve(watchPath, \"graphify-out\");\n  mkdirSync(outDir, { recursive: true });\n  const flagPath = pathResolve(outDir, \"needs_update\");\n  writeFileSync(flagPath, \"1\", \"utf-8\");\n  console.log(`\\n[graphify watch] New or changed files detected in ${watchPath}`);\n  console.log(\n    \"[graphify watch] Non-code files changed - semantic re-extraction requires LLM.\",\n  );\n  console.log(\n    \"[graphify watch] Run the graphify skill with `--update` to refresh semantic data (for Codex: `$graphify . --update`).\",\n  );\n  console.log(`[graphify watch] Flag written to ${flagPath}`);\n}\n\nfunction hasNonCode(changedPaths: string[]): boolean {\n  return changedPaths.some((p) => !CODE_EXTENSIONS.has(extname(p).toLowerCase()));\n}\n\n// ---------------------------------------------------------------------------\n// Main watcher\n// ---------------------------------------------------------------------------\n\nexport async function watch(\n  watchPath: string,\n  debounce: number = 3.0,\n): Promise<void> {\n  let chokidar: typeof import(\"chokidar\");\n  try {\n    chokidar = await import(\"chokidar\");\n  } catch {\n    throw new Error(\"chokidar not installed. Run: npm install chokidar\");\n  }\n\n  const resolvedPath = pathResolve(watchPath);\n  let lastTrigger = 0;\n  let pending = false;\n  const changed = new Set<string>();\n\n  const watcher = chokidar.watch(resolvedPath, {\n    persistent: true,\n    ignoreInitial: true,\n    followSymlinks: false,\n    ignored: [\n      /node_modules/,\n      /\\.git/,\n      /graphify-out/,\n    ],\n  });\n\n  watcher.on(\"all\", (_event: string, filePath: string) => {\n    const ext = extname(filePath).toLowerCase();\n    if (!WATCHED_EXTENSIONS.has(ext)) return;\n\n    // Skip hidden directories\n    const parts = filePath.split(\"/\");\n    if (parts.some((part) => part.startsWith(\".\") && part !== \".\")) return;\n\n    lastTrigger = Date.now();\n    pending = true;\n    changed.add(filePath);\n  });\n\n  console.log(\n    `[graphify watch] Watching ${resolvedPath} - press Ctrl+C to stop`,\n  );\n  console.log(\n    \"[graphify watch] Code changes rebuild graph automatically. Doc/image changes require a graphify skill `--update` run.\",\n  );\n  console.log(`[graphify watch] Debounce: ${debounce}s`);\n\n  const debounceMs = debounce * 1000;\n\n  const poll = setInterval(async () => {\n    if (pending && Date.now() - lastTrigger >= debounceMs) {\n      pending = false;\n      const batch = [...changed];\n      changed.clear();\n      console.log(`\\n[graphify watch] ${batch.length} file(s) changed`);\n      if (hasNonCode(batch)) {\n        notifyOnly(watchPath);\n      } else {\n        await rebuildCode(watchPath);\n      }\n    }\n  }, 500);\n\n  // Graceful shutdown\n  const cleanup = () => {\n    console.log(\"\\n[graphify watch] Stopped.\");\n    clearInterval(poll);\n    watcher.close();\n    process.exit(0);\n  };\n\n  process.on(\"SIGINT\", cleanup);\n  process.on(\"SIGTERM\", cleanup);\n}\n\n// ---------------------------------------------------------------------------\n// CLI entry point\n// ---------------------------------------------------------------------------\n\nconst isDirectExecution = typeof process !== \"undefined\" &&\n  typeof process.argv[1] === \"string\" &&\n  /^watch\\.(?:js|mjs|cjs|ts)$/.test(basename(process.argv[1]));\n\nif (isDirectExecution) {\n  const watchPath = process.argv[2] ?? \".\";\n  const debounce = process.argv[3] ? parseFloat(process.argv[3]) : 3.0;\n  watch(watchPath, debounce).catch((err) => {\n    console.error(err);\n    process.exit(1);\n  });\n}\n"],"mappings":";;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AAAA,IACY;AADZ;AAAA;AACO,IAAK,WAAL,kBAAKA,cAAL;AACL,MAAAA,UAAA,UAAO;AACP,MAAAA,UAAA,cAAW;AACX,MAAAA,UAAA,WAAQ;AACR,MAAAA,UAAA,WAAQ;AACR,MAAAA,UAAA,WAAQ;AALE,aAAAA;AAAA,OAAA;AAAA;AAAA;;;ACYL,SAAS,mBAAmB,MAAyB;AAC1D,MAAI,OAAO,SAAS,YAAY,SAAS,QAAQ,MAAM,QAAQ,IAAI,GAAG;AACpE,WAAO,CAAC,kCAAkC;AAAA,EAC5C;AAEA,QAAM,IAAI;AACV,QAAM,SAAmB,CAAC;AAG1B,MAAI,EAAE,WAAW,IAAI;AACnB,WAAO,KAAK,8BAA8B;AAAA,EAC5C,WAAW,CAAC,MAAM,QAAQ,EAAE,KAAK,GAAG;AAClC,WAAO,KAAK,wBAAwB;AAAA,EACtC,OAAO;AACL,aAAS,IAAI,GAAG,IAAI,EAAE,MAAM,QAAQ,KAAK;AACvC,YAAM,OAAO,EAAE,MAAM,CAAC;AACtB,UAAI,OAAO,SAAS,YAAY,SAAS,QAAQ,MAAM,QAAQ,IAAI,GAAG;AACpE,eAAO,KAAK,QAAQ,CAAC,oBAAoB;AACzC;AAAA,MACF;AACA,iBAAW,SAAS,sBAAsB;AACxC,YAAI,EAAE,SAAS,OAAO;AACpB,iBAAO;AAAA,YACL,QAAQ,CAAC,QAAQ,KAAK,UAAU,KAAK,MAAM,GAAG,CAAC,6BAA6B,KAAK;AAAA,UACnF;AAAA,QACF;AAAA,MACF;AACA,UAAI,eAAe,QAAQ,CAAC,iBAAiB,IAAI,KAAK,SAAmB,GAAG;AAC1E,eAAO;AAAA,UACL,QAAQ,CAAC,QAAQ,KAAK,UAAU,KAAK,MAAM,GAAG,CAAC,4BACzC,KAAK,SAAS,sBAAsB,KAAK,UAAU,CAAC,GAAG,gBAAgB,EAAE,KAAK,CAAC,CAAC;AAAA,QACxF;AAAA,MACF;AAAA,IACF;AAAA,EACF;AAGA,MAAI,EAAE,WAAW,IAAI;AACnB,WAAO,KAAK,8BAA8B;AAAA,EAC5C,WAAW,CAAC,MAAM,QAAQ,EAAE,KAAK,GAAG;AAClC,WAAO,KAAK,wBAAwB;AAAA,EACtC,OAAO;AACL,UAAM,UAAU,oBAAI,IAAY;AAChC,QAAI,MAAM,QAAQ,EAAE,KAAK,GAAG;AAC1B,iBAAW,KAAK,EAAE,OAAO;AACvB,YAAI,OAAO,MAAM,YAAY,MAAM,QAAQ,QAAQ,GAAG;AACpD,kBAAQ,IAAK,EAA8B,EAAY;AAAA,QACzD;AAAA,MACF;AAAA,IACF;AAEA,aAAS,IAAI,GAAG,IAAI,EAAE,MAAM,QAAQ,KAAK;AACvC,YAAM,OAAO,EAAE,MAAM,CAAC;AACtB,UAAI,OAAO,SAAS,YAAY,SAAS,QAAQ,MAAM,QAAQ,IAAI,GAAG;AACpE,eAAO,KAAK,QAAQ,CAAC,oBAAoB;AACzC;AAAA,MACF;AACA,iBAAW,SAAS,sBAAsB;AACxC,YAAI,EAAE,SAAS,OAAO;AACpB,iBAAO,KAAK,QAAQ,CAAC,4BAA4B,KAAK,GAAG;AAAA,QAC3D;AAAA,MACF;AACA,UAAI,gBAAgB,QAAQ,CAAC,kBAAkB,IAAI,KAAK,UAAoB,GAAG;AAC7E,eAAO;AAAA,UACL,QAAQ,CAAC,4BAA4B,KAAK,UAAU,sBAC9B,KAAK,UAAU,CAAC,GAAG,iBAAiB,EAAE,KAAK,CAAC,CAAC;AAAA,QACrE;AAAA,MACF;AACA,UAAI,YAAY,QAAQ,QAAQ,OAAO,KAAK,CAAC,QAAQ,IAAI,KAAK,MAAgB,GAAG;AAC/E,eAAO,KAAK,QAAQ,CAAC,YAAY,KAAK,MAAM,8BAA8B;AAAA,MAC5E;AACA,UAAI,YAAY,QAAQ,QAAQ,OAAO,KAAK,CAAC,QAAQ,IAAI,KAAK,MAAgB,GAAG;AAC/E,eAAO,KAAK,QAAQ,CAAC,YAAY,KAAK,MAAM,8BAA8B;AAAA,MAC5E;AAAA,IACF;AAAA,EACF;AAEA,SAAO;AACT;AAGO,SAAS,YAAY,MAAqB;AAC/C,QAAM,SAAS,mBAAmB,IAAI;AACtC,MAAI,OAAO,SAAS,GAAG;AACrB,UAAM,MACJ,uBAAuB,OAAO,MAAM;AAAA,IACpC,OAAO,IAAI,CAAC,MAAM,YAAO,CAAC,EAAE,EAAE,KAAK,IAAI;AACzC,UAAM,IAAI,MAAM,GAAG;AAAA,EACrB;AACF;AAtGA,IAIa,kBACA,mBACA,sBACA;AAPb;AAAA;AAIO,IAAM,mBAAmB,oBAAI,IAAI,CAAC,QAAQ,YAAY,SAAS,SAAS,WAAW,CAAC;AACpF,IAAM,oBAAoB,oBAAI,IAAI,CAAC,aAAa,YAAY,WAAW,CAAC;AACxE,IAAM,uBAAuB,CAAC,MAAM,SAAS,aAAa,aAAa;AACvE,IAAM,uBAAuB,CAAC,UAAU,UAAU,YAAY,cAAc,aAAa;AAAA;AAAA;;;ACKzF,SAAS,YAAY,WAAoB,OAAc;AAC5D,SAAO,IAAI,kBAAAC,QAAM,EAAE,MAAM,WAAW,aAAa,cAAc,OAAO,MAAM,CAAC;AAC/E;AAEO,SAAS,gBAAgB,GAAmB;AACjD,SAAO,EAAE,SAAS;AACpB;AAEO,SAAS,kBAAkB,KAAiC;AACjE,QAAM,IAAI,YAAY,IAAI,aAAa,IAAI;AAE3C,aAAW,CAAC,KAAK,KAAK,KAAK,OAAO,QAAQ,IAAI,SAAS,CAAC,CAAC,GAAG;AAC1D,MAAE,aAAa,KAAK,KAAK;AAAA,EAC3B;AAEA,aAAW,QAAQ,IAAI,SAAS,CAAC,GAAG;AAClC,UAAM,EAAE,IAAI,GAAG,MAAM,IAAI;AACzB,MAAE,UAAU,IAAI,KAAK;AAAA,EACvB;AAEA,aAAW,QAAQ,IAAI,SAAS,IAAI,SAAS,CAAC,GAAG;AAC/C,UAAM,EAAE,QAAQ,QAAQ,GAAG,MAAM,IAAI;AACrC,QAAI,CAAC,EAAE,QAAQ,MAAM,KAAK,CAAC,EAAE,QAAQ,MAAM,EAAG;AAC9C,QAAI;AACF,QAAE,UAAU,QAAQ,QAAQ,KAAK;AAAA,IACnC,QAAQ;AAAA,IAER;AAAA,EACF;AAEA,MAAI,IAAI,cAAc,IAAI,WAAW,SAAS,GAAG;AAC/C,MAAE,aAAa,cAAc,IAAI,UAAU;AAAA,EAC7C;AAEA,SAAO;AACT;AAEO,SAAS,kBAAkB,GAAiB;AACjD,MAAI,CAAC,gBAAgB,CAAC,EAAG,QAAO,EAAE,KAAK;AAEvC,QAAM,OAAO,YAAY,KAAK;AAE9B,aAAW,CAAC,KAAK,KAAK,KAAK,OAAO,QAAQ,EAAE,cAAc,CAAC,GAAG;AAC5D,SAAK,aAAa,KAAK,KAAK;AAAA,EAC9B;AAEA,IAAE,YAAY,CAAC,QAAQ,UAAU;AAC/B,SAAK,UAAU,QAAQ,KAAK;AAAA,EAC9B,CAAC;AAED,IAAE,YAAY,CAAC,OAAO,OAAO,QAAQ,WAAW;AAC9C,QAAI,CAAC,KAAK,QAAQ,MAAM,KAAK,CAAC,KAAK,QAAQ,MAAM,EAAG;AACpD,QAAI;AACF,WAAK,UAAU,QAAQ,QAAQ,KAAK;AAAA,IACtC,QAAQ;AAAA,IAER;AAAA,EACF,CAAC;AAED,SAAO;AACT;AAEO,SAAS,yBACd,GACA,MACA,UACM;AACN,MAAI,gBAAgB,CAAC,GAAG;AACtB,MAAE,wBAAwB,MAAM,QAAQ;AACxC;AAAA,EACF;AACA,IAAE,gBAAgB,MAAM,QAAQ;AAClC;AAEO,SAAS,mBAAmB,GAAU,MAAwB;AACnE,QAAM,YAAsB,CAAC;AAC7B,2BAAyB,GAAG,MAAM,CAAC,aAAa;AAC9C,cAAU,KAAK,QAAQ;AAAA,EACzB,CAAC;AACD,SAAO;AACT;AA5FA;AAAA;AAAA;AAAA,wBAAkB;AAAA;AAAA;;;ACAlB;AAAA;AAAA;AAAA;AAAA;AAmBO,SAAS,cAAc,YAAwB,SAA+B;AACnF,QAAM,SAAS,mBAAmB,UAAU;AAE5C,QAAM,aAAa,OAAO,OAAO,CAAC,MAAM,CAAC,EAAE,SAAS,4BAA4B,CAAC;AACjF,MAAI,WAAW,SAAS,GAAG;AACzB,YAAQ;AAAA,MACN,kCAAkC,WAAW,MAAM,aAAa,WAAW,CAAC,CAAC;AAAA,IAC/E;AAAA,EACF;AAEA,QAAM,IAAI,YAAY,SAAS,aAAa,IAAI;AAEhD,aAAW,QAAQ,WAAW,SAAS,CAAC,GAAG;AACzC,UAAM,EAAE,IAAI,GAAG,MAAM,IAAI;AACzB,MAAE,UAAU,IAAI,KAAK;AAAA,EACvB;AAEA,QAAM,UAAU,IAAI,IAAI,EAAE,MAAM,CAAC;AAEjC,aAAW,QAAQ,WAAW,SAAS,CAAC,GAAG;AACzC,UAAM,EAAE,QAAQ,QAAQ,GAAG,MAAM,IAAI;AACrC,QAAI,CAAC,QAAQ,IAAI,MAAM,KAAK,CAAC,QAAQ,IAAI,MAAM,EAAG;AAElD,UAAM,OAAO;AACb,UAAM,OAAO;AAEb,QAAI;AACF,QAAE,UAAU,QAAQ,QAAQ,KAAK;AAAA,IACnC,QAAQ;AAAA,IAER;AAAA,EACF;AAEA,QAAM,aAAa,WAAW,cAAc,CAAC;AAC7C,MAAI,WAAW,SAAS,GAAG;AACzB,MAAE,aAAa,cAAc,UAAU;AAAA,EACzC;AAEA,SAAO;AACT;AAMO,SAAS,MAAM,aAA2B,SAA+B;AAC9E,QAAM,WAAuB;AAAA,IAC3B,OAAO,CAAC;AAAA,IACR,OAAO,CAAC;AAAA,IACR,YAAY,CAAC;AAAA,IACb,cAAc;AAAA,IACd,eAAe;AAAA,EACjB;AACA,aAAW,OAAO,aAAa;AAC7B,aAAS,MAAM,KAAK,GAAI,IAAI,SAAS,CAAC,CAAE;AACxC,aAAS,MAAM,KAAK,GAAI,IAAI,SAAS,CAAC,CAAE;AACxC,KAAC,SAAS,eAAe,CAAC,GAAG,KAAK,GAAI,IAAI,cAAc,CAAC,CAAE;AAC3D,aAAS,gBAAgB,IAAI,gBAAgB;AAC7C,aAAS,iBAAiB,IAAI,iBAAiB;AAAA,EACjD;AACA,SAAO,cAAc,UAAU,OAAO;AACxC;AAhFA;AAAA;AAYA;AACA;AAAA;AAAA;;;ACVO,SAAS,aACd,OACgB;AAChB,MAAI,iBAAiB,IAAK,QAAO;AAEjC,QAAM,MAAM,oBAAI,IAAe;AAC/B,MAAI,CAAC,MAAO,QAAO;AAEnB,aAAW,CAAC,KAAK,KAAK,KAAK,OAAO,QAAQ,KAAK,GAAG;AAChD,UAAM,aAAa,OAAO,GAAG;AAC7B,QAAI,OAAO,SAAS,UAAU,GAAG;AAC/B,UAAI,IAAI,YAAY,KAAU;AAAA,IAChC;AAAA,EACF;AAEA,SAAO;AACT;AAEO,SAAS,YACd,OACgB;AAChB,MAAI,iBAAiB,IAAK,QAAO;AAEjC,QAAM,MAAM,oBAAI,IAAe;AAC/B,MAAI,CAAC,MAAO,QAAO;AAEnB,aAAW,CAAC,KAAK,KAAK,KAAK,OAAO,QAAQ,KAAK,GAAG;AAChD,QAAI,IAAI,KAAK,KAAU;AAAA,EACzB;AAEA,SAAO;AACT;AAlCA;AAAA;AAAA;AAAA;;;ACAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAaA,SAAS,UAAU,GAA+B;AAEhD,QAAM,aAAS,sCAAAC,SAAQ,EAAE,SAAS,aAAa,kBAAkB,CAAC,IAAI,CAAC;AACvE,QAAM,MAAM,oBAAI,IAAoB;AACpC,aAAW,CAAC,MAAM,GAAG,KAAK,OAAO,QAAQ,MAAM,GAAG;AAChD,QAAI,IAAI,MAAM,GAAa;AAAA,EAC7B;AACA,SAAO;AACT;AAEA,SAAS,eAAe,GAAU,OAA6B;AAC7D,QAAM,WAAW,EAAE,KAAK;AAExB,QAAM,UAAU,IAAI,IAAI,KAAK;AAC7B,WAAS,YAAY,CAAC,MAAM;AAC1B,QAAI,CAAC,QAAQ,IAAI,CAAC,EAAG,UAAS,SAAS,CAAC;AAAA,EAC1C,CAAC;AAED,MAAI,SAAS,SAAS,GAAG;AACvB,WAAO,MAAM,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC;AAAA,EAC7B;AAEA,MAAI;AACF,UAAM,eAAe,UAAU,QAAQ;AACvC,UAAM,iBAAiB,oBAAI,IAAsB;AACjD,eAAW,CAAC,MAAM,GAAG,KAAK,cAAc;AACtC,UAAI,CAAC,eAAe,IAAI,GAAG,EAAG,gBAAe,IAAI,KAAK,CAAC,CAAC;AACxD,qBAAe,IAAI,GAAG,EAAG,KAAK,IAAI;AAAA,IACpC;AACA,QAAI,eAAe,QAAQ,GAAG;AAC5B,aAAO,CAAC,CAAC,GAAG,KAAK,EAAE,KAAK,CAAC;AAAA,IAC3B;AACA,WAAO,CAAC,GAAG,eAAe,OAAO,CAAC,EAAE,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,EAAE,KAAK,CAAC;AAAA,EAC9D,QAAQ;AACN,WAAO,CAAC,CAAC,GAAG,KAAK,EAAE,KAAK,CAAC;AAAA,EAC3B;AACF;AAEO,SAAS,QAAQ,GAAiC;AACvD,MAAI,EAAE,UAAU,EAAG,QAAO,oBAAI,IAAI;AAElC,MAAI,EAAE,SAAS,GAAG;AAChB,UAAMC,UAAS,oBAAI,IAAsB;AACzC,UAAM,SAAS,CAAC,GAAG,EAAE,MAAM,CAAC,EAAE,KAAK;AACnC,WAAO,QAAQ,CAAC,GAAG,MAAMA,QAAO,IAAI,GAAG,CAAC,CAAC,CAAC,CAAC;AAC3C,WAAOA;AAAA,EACT;AAGA,QAAM,WAAqB,CAAC;AAC5B,QAAM,iBAA2B,CAAC;AAClC,IAAE,YAAY,CAAC,MAAM;AACnB,QAAI,EAAE,OAAO,CAAC,MAAM,GAAG;AACrB,eAAS,KAAK,CAAC;AAAA,IACjB,OAAO;AACL,qBAAe,KAAK,CAAC;AAAA,IACvB;AAAA,EACF,CAAC;AAED,QAAM,MAAM,oBAAI,IAAsB;AAEtC,MAAI,eAAe,SAAS,GAAG;AAE7B,UAAM,YAAY,EAAE,KAAK;AACzB,eAAW,OAAO,UAAU;AAC1B,gBAAU,SAAS,GAAG;AAAA,IACxB;AACA,UAAM,eAAe,UAAU,SAAS;AACxC,eAAW,CAAC,MAAM,GAAG,KAAK,cAAc;AACtC,UAAI,CAAC,IAAI,IAAI,GAAG,EAAG,KAAI,IAAI,KAAK,CAAC,CAAC;AAClC,UAAI,IAAI,GAAG,EAAG,KAAK,IAAI;AAAA,IACzB;AAAA,EACF;AAGA,MAAI,UAAU,KAAK,IAAI,IAAI,GAAG,IAAI,KAAK,CAAC,IAAI;AAC5C,aAAW,QAAQ,UAAU;AAC3B,QAAI,IAAI,SAAS,CAAC,IAAI,CAAC;AACvB;AAAA,EACF;AAGA,QAAM,UAAU,KAAK,IAAI,gBAAgB,KAAK,MAAM,EAAE,QAAQ,sBAAsB,CAAC;AACrF,QAAM,mBAA+B,CAAC;AACtC,aAAW,SAAS,IAAI,OAAO,GAAG;AAChC,QAAI,MAAM,SAAS,SAAS;AAC1B,uBAAiB,KAAK,GAAG,eAAe,GAAG,KAAK,CAAC;AAAA,IACnD,OAAO;AACL,uBAAiB,KAAK,KAAK;AAAA,IAC7B;AAAA,EACF;AAGA,mBAAiB,KAAK,CAAC,GAAG,MAAM,EAAE,SAAS,EAAE,MAAM;AACnD,QAAM,SAAS,oBAAI,IAAsB;AACzC,mBAAiB,QAAQ,CAAC,OAAO,MAAM;AACrC,WAAO,IAAI,GAAG,CAAC,GAAG,KAAK,EAAE,KAAK,CAAC;AAAA,EACjC,CAAC;AACD,SAAO;AACT;AAGO,SAAS,cAAc,GAAU,gBAAkC;AACxE,QAAM,IAAI,eAAe;AACzB,MAAI,KAAK,EAAG,QAAO;AACnB,QAAM,UAAU,IAAI,IAAI,cAAc;AACtC,MAAI,SAAS;AACb,IAAE,YAAY,CAAC,MAAM,OAAO,QAAQ,WAAW;AAC7C,QAAI,QAAQ,IAAI,MAAM,KAAK,QAAQ,IAAI,MAAM,GAAG;AAC9C;AAAA,IACF;AAAA,EACF,CAAC;AACD,QAAM,WAAY,KAAK,IAAI,KAAM;AACjC,SAAO,WAAW,IAAI,KAAK,MAAO,SAAS,WAAY,GAAG,IAAI,MAAM;AACtE;AAEO,SAAS,SACd,GACA,aACqB;AACrB,QAAM,eAAe,aAAa,WAAW;AAC7C,QAAM,SAAS,oBAAI,IAAoB;AACvC,aAAW,CAAC,KAAK,KAAK,KAAK,cAAc;AACvC,WAAO,IAAI,KAAK,cAAc,GAAG,KAAK,CAAC;AAAA,EACzC;AACA,SAAO;AACT;AA3IA,IAMA,uCAIM,wBACA;AAXN;AAAA;AAMA,4CAAoB;AACpB;AACA;AAEA,IAAM,yBAAyB;AAC/B,IAAM,iBAAiB;AAAA;AAAA;;;ACsCvB,SAAS,YAAY,UAA2B;AAC9C,QAAM,WAAO,2BAAS,QAAQ;AAC9B,SAAO,mBAAmB,KAAK,CAAC,MAAM,EAAE,KAAK,IAAI,KAAK,EAAE,KAAK,QAAQ,CAAC;AACxE;AAEA,SAAS,eAAe,UAA2B;AACjD,MAAI;AACF,UAAM,WAAO,6BAAa,UAAU,OAAO,EAAE,MAAM,GAAG,GAAI;AAC1D,UAAM,OAAO,cAAc,OAAO,CAAC,MAAM,EAAE,KAAK,IAAI,CAAC,EAAE;AACvD,WAAO,QAAQ;AAAA,EACjB,QAAQ;AACN,WAAO;AAAA,EACT;AACF;AAIO,SAAS,aAAa,UAAmC;AAC9D,QAAM,UAAM,0BAAQ,QAAQ,EAAE,YAAY;AAC1C,MAAI,gBAAgB,IAAI,GAAG,EAAG;AAC9B,MAAI,iBAAiB,IAAI,GAAG,GAAG;AAE7B,UAAM,QAAQ,SAAS,MAAM,oBAAG;AAChC,QAAI,MAAM,KAAK,CAAC,MAAM,CAAC,GAAG,iBAAiB,EAAE,KAAK,CAAC,MAAM,EAAE,SAAS,CAAC,CAAC,CAAC,EAAG,QAAO;AACjF;AAAA,EACF;AACA,MAAI,iBAAiB,IAAI,GAAG,EAAG;AAC/B,MAAI,iBAAiB,IAAI,GAAG,EAAG;AAC/B,MAAI,eAAe,IAAI,GAAG,GAAG;AAC3B,QAAI,eAAe,QAAQ,EAAG;AAC9B;AAAA,EACF;AACA,MAAI,kBAAkB,IAAI,GAAG,EAAG;AAChC,SAAO;AACT;AA4EA,SAAS,WAAW,UAA0B;AAC5C,MAAI;AACF,UAAM,WAAO,6BAAa,UAAU,OAAO;AAC3C,WAAO,KAAK,MAAM,KAAK,EAAE,OAAO,OAAO,EAAE;AAAA,EAC3C,QAAQ;AACN,WAAO;AAAA,EACT;AACF;AASA,SAAS,WAAW,MAAuB;AACzC,MAAI,UAAU,IAAI,IAAI,EAAG,QAAO;AAChC,MAAI,KAAK,SAAS,OAAO,KAAK,KAAK,SAAS,MAAM,EAAG,QAAO;AAC5D,MAAI,KAAK,SAAS,WAAW,EAAG,QAAO;AACvC,SAAO;AACT;AAEA,SAAS,mBAAmB,MAAwB;AAClD,QAAM,WAAqB,CAAC;AAC5B,MAAI,cAAU,0BAAQ,IAAI;AAE1B,SAAO,MAAM;AACX,UAAM,iBAAa,uBAAK,SAAS,iBAAiB;AAClD,YAAI,2BAAW,UAAU,GAAG;AAC1B,eAAS,YAAQ,6BAAa,YAAY,OAAO,EAAE,MAAM,IAAI,GAAG;AAC9D,eAAO,KAAK,KAAK;AACjB,YAAI,QAAQ,CAAC,KAAK,WAAW,GAAG,GAAG;AACjC,mBAAS,KAAK,IAAI;AAAA,QACpB;AAAA,MACF;AAAA,IACF;AAEA,YAAI,+BAAW,uBAAK,SAAS,MAAM,CAAC,GAAG;AACrC;AAAA,IACF;AAEA,UAAM,aAAS,0BAAQ,OAAO;AAC9B,QAAI,WAAW,SAAS;AACtB;AAAA,IACF;AACA,cAAU;AAAA,EACZ;AACA,SAAO;AACT;AAEA,SAAS,UAAU,MAAc,SAA0B;AAEzD,QAAM,QAAQ,QACX,QAAQ,qBAAqB,MAAM,EACnC,QAAQ,OAAO,IAAI,EACnB,QAAQ,OAAO,GAAG;AACrB,SAAO,IAAI,OAAO,IAAI,KAAK,GAAG,EAAE,KAAK,IAAI;AAC3C;AAEA,SAAS,UAAU,UAAkB,MAAc,UAA6B;AAC9E,MAAI,SAAS,WAAW,EAAG,QAAO;AAClC,MAAI;AACJ,MAAI;AACF,cAAM,2BAAS,MAAM,QAAQ,EAAE,QAAQ,OAAO,GAAG;AAAA,EACnD,QAAQ;AACN,WAAO;AAAA,EACT;AACA,QAAM,QAAQ,IAAI,MAAM,GAAG;AAC3B,aAAW,WAAW,UAAU;AAC9B,UAAM,IAAI,QAAQ,QAAQ,cAAc,EAAE;AAC1C,QAAI,CAAC,EAAG;AACR,QAAI,UAAU,KAAK,CAAC,EAAG,QAAO;AAC9B,QAAI,cAAU,2BAAS,QAAQ,GAAG,CAAC,EAAG,QAAO;AAC7C,aAAS,IAAI,GAAG,IAAI,MAAM,QAAQ,KAAK;AACrC,UAAI,UAAU,MAAM,CAAC,GAAI,CAAC,EAAG,QAAO;AACpC,UAAI,UAAU,MAAM,MAAM,GAAG,IAAI,CAAC,EAAE,KAAK,GAAG,GAAG,CAAC,EAAG,QAAO;AAAA,IAC5D;AAAA,EACF;AACA,SAAO;AACT;AAEA,SAAS,QACP,KACA,MACA,gBACA,gBACA,WACU;AACV,QAAM,SAAmB,CAAC;AAC1B,MAAI;AACJ,MAAI;AACF,kBAAU,4BAAY,GAAG;AAAA,EAC3B,QAAQ;AACN,WAAO;AAAA,EACT;AAEA,aAAW,SAAS,SAAS;AAC3B,UAAM,WAAO,uBAAK,KAAK,KAAK;AAC5B,QAAI;AACJ,QAAI;AACF,aAAO,qBAAiB,yBAAS,IAAI,QAAI,0BAAU,IAAI;AAAA,IACzD,QAAQ;AACN;AAAA,IACF;AAEA,QAAI,KAAK,YAAY,GAAG;AACtB,UAAI,CAAC,WAAW;AACd,YAAI,MAAM,WAAW,GAAG,EAAG;AAC3B,YAAI,WAAW,KAAK,EAAG;AACvB,YAAI,UAAU,MAAM,MAAM,cAAc,EAAG;AAAA,MAC7C;AACA,aAAO,KAAK,GAAG,QAAQ,MAAM,MAAM,gBAAgB,gBAAgB,SAAS,CAAC;AAAA,IAC/E,WAAW,KAAK,OAAO,GAAG;AACxB,aAAO,KAAK,IAAI;AAAA,IAClB;AAAA,EACF;AAEA,SAAO;AACT;AAEO,SAAS,OAAO,MAAc,SAAyD;AAC5F,QAAM,iBAAiB,SAAS,kBAAkB;AAClD,QAAM,mBAAe,0BAAQ,IAAI;AACjC,QAAM,iBAAiB,mBAAmB,YAAY;AACtD,QAAM,mBAAe,uBAAK,cAAc,gBAAgB,WAAW;AACnE,QAAM,gBAAY,uBAAK,cAAc,gBAAgB,QAAQ;AAE7D,QAAM,QAAkC;AAAA,IACtC,MAAM,CAAC;AAAA,IAAG,UAAU,CAAC;AAAA,IAAG,OAAO,CAAC;AAAA,IAAG,OAAO,CAAC;AAAA,IAAG,OAAO,CAAC;AAAA,EACxD;AACA,MAAI,aAAa;AACjB,QAAM,mBAA6B,CAAC;AAGpC,QAAM,WAAW,QAAQ,cAAc,cAAc,gBAAgB,gBAAgB,KAAK;AAG1F,UAAI,2BAAW,SAAS,GAAG;AACzB,aAAS,KAAK,GAAG,QAAQ,WAAW,cAAc,gBAAgB,gBAAgB,IAAI,CAAC;AAAA,EACzF;AAEA,QAAM,OAAO,oBAAI,IAAY;AAE7B,aAAW,KAAK,UAAU;AACxB,QAAI,KAAK,IAAI,CAAC,EAAG;AACjB,SAAK,IAAI,CAAC;AAEV,UAAM,eAAW,2BAAW,SAAS,KAAK,EAAE,WAAW,SAAS;AAChE,QAAI,CAAC,UAAU;AACb,cAAI,2BAAS,CAAC,EAAE,WAAW,GAAG,EAAG;AACjC,UAAI,EAAE,WAAW,YAAY,EAAG;AAAA,IAClC;AACA,QAAI,UAAU,GAAG,cAAc,cAAc,EAAG;AAChD,QAAI,YAAY,CAAC,GAAG;AAClB,uBAAiB,KAAK,CAAC;AACvB;AAAA,IACF;AAEA,UAAM,QAAQ,aAAa,CAAC;AAC5B,QAAI,CAAC,MAAO;AAGZ,QAAI,kBAAkB,QAAI,0BAAQ,CAAC,EAAE,YAAY,CAAC,GAAG;AAGnD,uBAAiB,KAAK,IAAI,oDAAoD;AAC9E;AAAA,IACF;AAEA,UAAM,KAAK,EAAG,KAAK,CAAC;AACpB,QAAI,+BAA0B;AAC5B,oBAAc,WAAW,CAAC;AAAA,IAC5B;AAAA,EACF;AAEA,QAAM,aAAa,OAAO,OAAO,KAAK,EAAE,OAAO,CAAC,GAAG,MAAM,IAAI,EAAE,QAAQ,CAAC;AACxE,QAAM,aAAa,cAAc;AAEjC,MAAI,UAAyB;AAC7B,MAAI,CAAC,YAAY;AACf,cAAU,cAAc,WAAW,eAAe,CAAC;AAAA,EACrD,WAAW,cAAc,0BAA0B,cAAc,kBAAkB;AACjF,cACE,iBAAiB,UAAU,gBAAa,WAAW,eAAe,CAAC;AAAA,EAGvE;AAEA,SAAO;AAAA,IACL;AAAA,IACA,aAAa;AAAA,IACb,aAAa;AAAA,IACb,aAAa;AAAA,IACb;AAAA,IACA,mBAAmB;AAAA,IACnB,yBAAyB,eAAe;AAAA,EAC1C;AACF;AAEO,SAAS,aAAa,eAAuB,eAAuC;AACzF,MAAI;AACF,WAAO,KAAK,UAAM,6BAAa,cAAc,OAAO,CAAC;AAAA,EACvD,QAAQ;AACN,WAAO,CAAC;AAAA,EACV;AACF;AAEO,SAAS,aAAa,OAAiC,eAAuB,eAAqB;AACxG,QAAM,WAAmC,CAAC;AAC1C,aAAW,YAAY,OAAO,OAAO,KAAK,GAAG;AAC3C,eAAW,KAAK,UAAU;AACxB,UAAI;AACF,iBAAS,CAAC,QAAI,yBAAS,CAAC,EAAE;AAAA,MAC5B,QAAQ;AAAA,MAAwC;AAAA,IAClD;AAAA,EACF;AACA,QAAM,UAAM,uBAAK,cAAc,IAAI;AACnC,gCAAU,KAAK,EAAE,WAAW,KAAK,CAAC;AAClC,oCAAc,cAAc,KAAK,UAAU,UAAU,MAAM,CAAC,CAAC;AAC/D;AAEO,SAAS,kBAAkB,MAAc,eAAuB,eAAgC;AACrG,QAAM,OAAO,OAAO,IAAI;AACxB,QAAM,WAAW,aAAa,YAAY;AAE1C,MAAI,OAAO,KAAK,QAAQ,EAAE,WAAW,GAAG;AACtC,WAAO;AAAA,MACL,GAAG;AAAA,MACH,aAAa;AAAA,MACb,WAAW,KAAK;AAAA,MAChB,iBAAiB,OAAO,YAAY,OAAO,KAAK,KAAK,KAAK,EAAE,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;AAAA,MAC/E,WAAW,KAAK;AAAA,IAClB;AAAA,EACF;AAEA,QAAM,WAAqC,CAAC;AAC5C,QAAM,iBAA2C,CAAC;AAClD,aAAW,KAAK,OAAO,KAAK,KAAK,KAAK,GAAG;AACvC,aAAS,CAAC,IAAI,CAAC;AACf,mBAAe,CAAC,IAAI,CAAC;AAAA,EACvB;AAEA,aAAW,CAAC,OAAO,QAAQ,KAAK,OAAO,QAAQ,KAAK,KAAK,GAAG;AAC1D,eAAW,KAAK,UAAU;AACxB,YAAM,cAAc,SAAS,CAAC;AAC9B,UAAI,eAAe;AACnB,UAAI;AAAE,2BAAe,yBAAS,CAAC,EAAE;AAAA,MAAS,QAAQ;AAAA,MAAe;AACjE,UAAI,gBAAgB,UAAa,eAAe,aAAa;AAC3D,iBAAS,KAAK,EAAG,KAAK,CAAC;AAAA,MACzB,OAAO;AACL,uBAAe,KAAK,EAAG,KAAK,CAAC;AAAA,MAC/B;AAAA,IACF;AAAA,EACF;AAEA,QAAM,eAAe,IAAI,IAAI,OAAO,OAAO,KAAK,KAAK,EAAE,KAAK,CAAC;AAC7D,QAAM,eAAe,OAAO,KAAK,QAAQ,EAAE,OAAO,CAAC,MAAM,CAAC,aAAa,IAAI,CAAC,CAAC;AAC7E,QAAM,WAAW,OAAO,OAAO,QAAQ,EAAE,OAAO,CAAC,GAAG,MAAM,IAAI,EAAE,QAAQ,CAAC;AAEzE,SAAO;AAAA,IACL,GAAG;AAAA,IACH,aAAa;AAAA,IACb,WAAW;AAAA,IACX,iBAAiB;AAAA,IACjB,WAAW;AAAA,IACX,eAAe;AAAA,EACjB;AACF;AA3aA,IAGA,gBAGA,kBACA,oBAIM,eAEO,iBAMA,gBACA,kBACA,kBACA,mBACA,kBAIP,uBACA,wBACA,kBAGA,oBAUA,eAKA,wBAiBA,mBAyGA;AAzKN;AAAA;AAGA,qBAEO;AACP,uBAAyE;AACzE,yBAA2B;AAC3B;AAGA,IAAM,gBAAgB;AAEf,IAAM,kBAAkB,oBAAI,IAAI;AAAA,MACrC;AAAA,MAAO;AAAA,MAAO;AAAA,MAAO;AAAA,MAAQ;AAAA,MAAQ;AAAA,MAAO;AAAA,MAAO;AAAA,MAAS;AAAA,MAAQ;AAAA,MAAO;AAAA,MAC3E;AAAA,MAAM;AAAA,MAAM;AAAA,MAAQ;AAAA,MAAO;AAAA,MAAU;AAAA,MAAO;AAAA,MAAQ;AAAA,MAAO;AAAA,MAAU;AAAA,MACrE;AAAA,MAAQ;AAAA,MAAQ;AAAA,MAAQ;AAAA,MAAQ;AAAA,MAAO;AAAA,MAAQ;AAAA,MAAM;AAAA,MAAO;AAAA,IAC9D,CAAC;AAEM,IAAM,iBAAiB,oBAAI,IAAI,CAAC,OAAO,QAAQ,MAAM,CAAC;AACtD,IAAM,mBAAmB,oBAAI,IAAI,CAAC,MAAM,CAAC;AACzC,IAAM,mBAAmB,oBAAI,IAAI,CAAC,QAAQ,QAAQ,SAAS,QAAQ,SAAS,MAAM,CAAC;AACnF,IAAM,oBAAoB,oBAAI,IAAI,CAAC,SAAS,OAAO,CAAC;AACpD,IAAM,mBAAmB,oBAAI,IAAI;AAAA,MACtC;AAAA,MAAQ;AAAA,MAAQ;AAAA,MAAS;AAAA,MAAQ;AAAA,MAAQ;AAAA,MAAQ;AAAA,MAAQ;AAAA,MAAQ;AAAA,MAAQ;AAAA,IAC3E,CAAC;AAED,IAAM,wBAAwB;AAC9B,IAAM,yBAAyB;AAC/B,IAAM,mBAAmB;AAGzB,IAAM,qBAAqB;AAAA,MACzB;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,IACF;AAGA,IAAM,gBAAgB;AAAA,MACpB;AAAA,MAAc;AAAA,MAAc;AAAA,MAAiB;AAAA,MAC7C;AAAA,MAAgB;AAAA,MAAiB;AAAA,MAAY;AAAA,MAAW;AAAA,MACxD;AAAA,MAA8B;AAAA,MAAkB;AAAA,MAAmB;AAAA,IACrE;AACA,IAAM,yBAAyB;AAiB/B,IAAM,oBAAoB,oBAAI,IAAI,CAAC,aAAa,aAAa,eAAe,aAAa,cAAc,CAAC;AAyGxG,IAAM,YAAY,oBAAI,IAAI;AAAA,MACxB;AAAA,MAAQ;AAAA,MAAS;AAAA,MAAO;AAAA,MAAQ;AAAA,MAAgB;AAAA,MAAe;AAAA,MAC/D;AAAA,MAAQ;AAAA,MAAS;AAAA,MAAU;AAAA,MAAO;AAAA,MAAiB;AAAA,MACnD;AAAA,MAAiB;AAAA,MAAe;AAAA,MAAe;AAAA,MAAQ;AAAA,IACzD,CAAC;AAAA;AAAA;;;AC7KD;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAmBA,SAAS,iBAAiB,aAA4D;AACpF,QAAM,eAAe,aAAa,WAAW;AAC7C,QAAM,SAAS,oBAAI,IAAoB;AACvC,aAAW,CAAC,KAAK,KAAK,KAAK,cAAc;AACvC,eAAW,KAAK,MAAO,QAAO,IAAI,GAAG,GAAG;AAAA,EAC1C;AACA,SAAO;AACT;AAEO,SAAS,WAAW,GAAU,QAAyB;AAC5D,QAAM,QAAQ,EAAE,kBAAkB,MAAM;AACxC,QAAM,QAAS,MAAM,SAAoB;AACzC,MAAI,CAAC,MAAO,QAAO;AAEnB,QAAM,aAAc,MAAM,eAA0B;AACpD,MAAI,YAAY;AACd,UAAM,WAAW,WAAW,MAAM,GAAG,EAAE,IAAI,KAAK;AAChD,QAAI,UAAU,SAAU,QAAO;AAAA,EACjC;AAEA,MAAI,MAAM,WAAW,GAAG,KAAK,MAAM,SAAS,IAAI,EAAG,QAAO;AAC1D,MAAI,MAAM,SAAS,IAAI,KAAK,EAAE,OAAO,MAAM,KAAK,EAAG,QAAO;AAC1D,SAAO;AACT;AAEO,SAAS,cAAc,GAAU,QAAyB;AAC/D,QAAM,OAAO,EAAE,kBAAkB,MAAM;AACvC,QAAM,SAAU,KAAK,eAA0B;AAC/C,MAAI,CAAC,OAAQ,QAAO;AACpB,QAAM,WAAW,OAAO,MAAM,GAAG,EAAE,IAAI,KAAK;AAC5C,MAAI,CAAC,SAAS,SAAS,GAAG,EAAG,QAAO;AACpC,SAAO;AACT;AAEA,SAAS,aAAa,MAAsB;AAC1C,QAAM,MAAM,KAAK,SAAS,GAAG,IACzB,IAAI,KAAK,MAAM,GAAG,EAAE,IAAI,GAAG,YAAY,KAAK,EAAE,KAC9C;AACJ,MAAI,gBAAgB,IAAI,GAAG,EAAG,QAAO;AACrC,MAAI,iBAAiB,IAAI,GAAG,EAAG,QAAO;AACtC,MAAI,iBAAiB,IAAI,GAAG,EAAG,QAAO;AACtC,MAAI,eAAe,IAAI,GAAG,EAAG,QAAO;AACpC,SAAO;AACT;AAEA,SAAS,YAAY,MAAsB;AACzC,SAAO,KAAK,SAAS,GAAG,IAAI,KAAK,MAAM,GAAG,EAAE,CAAC,IAAK;AACpD;AAEA,SAAS,cACP,GACA,GACA,GACA,MACA,eACA,SACA,SACoB;AACpB,MAAI,QAAQ;AACZ,QAAM,UAAoB,CAAC;AAE3B,QAAM,OAAQ,KAAK,cAAyB;AAC5C,QAAM,YAAoC,EAAE,WAAW,GAAG,UAAU,GAAG,WAAW,EAAE;AACpF,WAAS,UAAU,IAAI,KAAK;AAC5B,MAAI,SAAS,eAAe,SAAS,YAAY;AAC/C,YAAQ,KAAK,GAAG,KAAK,YAAY,CAAC,+CAA+C;AAAA,EACnF;AAEA,QAAM,OAAO,aAAa,OAAO;AACjC,QAAM,OAAO,aAAa,OAAO;AACjC,MAAI,SAAS,MAAM;AACjB,aAAS;AACT,YAAQ,KAAK,uBAAuB,IAAI,WAAM,IAAI,GAAG;AAAA,EACvD;AAEA,MAAI,YAAY,OAAO,MAAM,YAAY,OAAO,GAAG;AACjD,aAAS;AACT,YAAQ,KAAK,6CAA6C;AAAA,EAC5D;AAEA,QAAM,OAAO,cAAc,IAAI,CAAC;AAChC,QAAM,OAAO,cAAc,IAAI,CAAC;AAChC,MAAI,SAAS,UAAa,SAAS,UAAa,SAAS,MAAM;AAC7D,aAAS;AACT,YAAQ,KAAK,8BAA8B;AAAA,EAC7C;AAEA,MAAI,KAAK,aAAa,2BAA2B;AAC/C,YAAQ,KAAK,MAAM,QAAQ,GAAG;AAC9B,YAAQ,KAAK,uDAAuD;AAAA,EACtE;AAEA,QAAM,OAAO,EAAE,OAAO,CAAC;AACvB,QAAM,OAAO,EAAE,OAAO,CAAC;AACvB,MAAI,KAAK,IAAI,MAAM,IAAI,KAAK,KAAK,KAAK,IAAI,MAAM,IAAI,KAAK,GAAG;AAC1D,aAAS;AACT,UAAM,aAAa,QAAQ,IAAK,EAAE,iBAAiB,GAAG,OAAO,IAAgB,EAAE,iBAAiB,GAAG,OAAO;AAC1G,UAAM,MAAM,QAAQ,IAAK,EAAE,iBAAiB,GAAG,OAAO,IAAgB,EAAE,iBAAiB,GAAG,OAAO;AACnG,YAAQ,KAAK,qBAAqB,UAAU,iCAAiC,GAAG,IAAI;AAAA,EACtF;AAEA,SAAO,CAAC,OAAO,OAAO;AACxB;AAEO,SAAS,SAAS,GAAU,OAAe,IAAoB;AACpE,QAAM,SAA6B,CAAC;AACpC,IAAE,YAAY,CAAC,MAAM,OAAO,KAAK,CAAC,GAAG,EAAE,OAAO,CAAC,CAAC,CAAC,CAAC;AAClD,SAAO,KAAK,CAAC,GAAG,MAAM,EAAE,CAAC,IAAI,EAAE,CAAC,CAAC;AAEjC,QAAM,SAAyB,CAAC;AAChC,aAAW,CAAC,QAAQ,GAAG,KAAK,QAAQ;AAClC,QAAI,WAAW,GAAG,MAAM,KAAK,cAAc,GAAG,MAAM,EAAG;AACvD,WAAO,KAAK;AAAA,MACV,IAAI;AAAA,MACJ,OAAQ,EAAE,iBAAiB,QAAQ,OAAO,KAAgB;AAAA,MAC1D,OAAO;AAAA,IACT,CAAC;AACD,QAAI,OAAO,UAAU,KAAM;AAAA,EAC7B;AACA,SAAO;AACT;AAEO,SAAS,sBACd,GACA,aACA,OAAe,GACE;AACjB,QAAM,QAAQ,aAAa,WAAW;AACtC,QAAM,cAAc,oBAAI,IAAY;AACpC,IAAE,YAAY,CAAC,GAAG,SAAS;AACzB,UAAM,KAAM,KAAK,eAA0B;AAC3C,QAAI,GAAI,aAAY,IAAI,EAAE;AAAA,EAC5B,CAAC;AACD,QAAM,gBAAgB,YAAY,OAAO;AAEzC,MAAI,eAAe;AACjB,WAAO,mBAAmB,GAAG,OAAO,IAAI;AAAA,EAC1C;AACA,SAAO,wBAAwB,GAAG,OAAO,IAAI;AAC/C;AAEA,SAAS,mBAAmB,GAAU,aAAoC,MAA+B;AACvG,QAAM,gBAAgB,iBAAiB,WAAW;AAClD,QAAM,aAAqD,CAAC;AAE5D,IAAE,YAAY,CAAC,MAAM,MAAM,QAAQ,WAAW;AAC5C,UAAM,WAAY,KAAK,YAAuB;AAC9C,QAAI,CAAC,WAAW,gBAAgB,YAAY,QAAQ,EAAE,SAAS,QAAQ,EAAG;AAC1E,QAAI,cAAc,GAAG,MAAM,KAAK,cAAc,GAAG,MAAM,EAAG;AAC1D,QAAI,WAAW,GAAG,MAAM,KAAK,WAAW,GAAG,MAAM,EAAG;AAEpD,UAAM,UAAW,EAAE,iBAAiB,QAAQ,aAAa,KAAgB;AACzE,UAAM,UAAW,EAAE,iBAAiB,QAAQ,aAAa,KAAgB;AACzE,QAAI,CAAC,WAAW,CAAC,WAAW,YAAY,QAAS;AAEjD,UAAM,CAAC,OAAO,OAAO,IAAI,cAAc,GAAG,QAAQ,QAAQ,MAAM,eAAe,SAAS,OAAO;AAC/F,UAAM,QAAS,KAAK,QAAmB;AACvC,UAAM,QAAS,KAAK,QAAmB;AAEvC,eAAW,KAAK;AAAA,MACd,QAAQ;AAAA,MACR,QAAS,EAAE,iBAAiB,OAAO,OAAO,KAAgB;AAAA,MAC1D,QAAS,EAAE,iBAAiB,OAAO,OAAO,KAAgB;AAAA,MAC1D,cAAc;AAAA,QACX,EAAE,iBAAiB,OAAO,aAAa,KAAgB;AAAA,QACvD,EAAE,iBAAiB,OAAO,aAAa,KAAgB;AAAA,MAC1D;AAAA,MACA,YAAa,KAAK,cAA8C;AAAA,MAChE;AAAA,MACA,KAAK,QAAQ,SAAS,IAAI,QAAQ,KAAK,IAAI,IAAI;AAAA,IACjD,CAAC;AAAA,EACH,CAAC;AAED,aAAW,KAAK,CAAC,GAAG,MAAM,EAAE,SAAS,EAAE,MAAM;AAC7C,QAAM,SAAS,WAAW,MAAM,GAAG,IAAI,EAAE,IAAI,CAAC,EAAE,QAAQ,GAAG,KAAK,MAAM,IAAI;AAE1E,MAAI,OAAO,SAAS,EAAG,QAAO;AAC9B,SAAO,wBAAwB,GAAG,aAAa,IAAI;AACrD;AAEA,SAAS,wBACP,GACA,aACA,MACiB;AACjB,MAAI,YAAY,SAAS,GAAG;AAC1B,QAAI,EAAE,SAAS,EAAG,QAAO,CAAC;AAE1B,WAAO,yBAAyB,GAAG,IAAI;AAAA,EACzC;AAEA,QAAM,gBAAgB,iBAAiB,WAAW;AAClD,QAAM,YAAmD,CAAC;AAE1D,IAAE,YAAY,CAAC,MAAM,MAAM,GAAG,MAAM;AAClC,UAAM,OAAO,cAAc,IAAI,CAAC;AAChC,UAAM,OAAO,cAAc,IAAI,CAAC;AAChC,QAAI,SAAS,UAAa,SAAS,UAAa,SAAS,KAAM;AAC/D,QAAI,WAAW,GAAG,CAAC,KAAK,WAAW,GAAG,CAAC,EAAG;AAC1C,UAAM,WAAY,KAAK,YAAuB;AAC9C,QAAI,CAAC,WAAW,gBAAgB,YAAY,QAAQ,EAAE,SAAS,QAAQ,EAAG;AAE1E,UAAM,QAAS,KAAK,QAAmB;AACvC,UAAM,QAAS,KAAK,QAAmB;AAEvC,cAAU,KAAK;AAAA,MACb,QAAS,EAAE,iBAAiB,OAAO,OAAO,KAAgB;AAAA,MAC1D,QAAS,EAAE,iBAAiB,OAAO,OAAO,KAAgB;AAAA,MAC1D,cAAc;AAAA,QACX,EAAE,iBAAiB,OAAO,aAAa,KAAgB;AAAA,QACvD,EAAE,iBAAiB,OAAO,aAAa,KAAgB;AAAA,MAC1D;AAAA,MACA,YAAa,KAAK,cAA8C;AAAA,MAChE;AAAA,MACA,MAAM,qBAAqB,IAAI,qBAAgB,IAAI;AAAA,MACnD,OAAO,CAAC,KAAK,IAAI,MAAM,IAAI,GAAG,KAAK,IAAI,MAAM,IAAI,CAAC,EAAE,KAAK,GAAG;AAAA,IAC9D,CAAC;AAAA,EACH,CAAC;AAED,QAAM,QAAgC,EAAE,WAAW,GAAG,UAAU,GAAG,WAAW,EAAE;AAChF,YAAU,KAAK,CAAC,GAAG,OAAO,MAAM,EAAE,UAAU,KAAK,MAAM,MAAM,EAAE,UAAU,KAAK,EAAE;AAEhF,QAAM,YAAY,oBAAI,IAAY;AAClC,QAAM,UAA2B,CAAC;AAClC,aAAW,KAAK,WAAW;AACzB,UAAM,OAAO,EAAE;AACf,QAAI,CAAC,UAAU,IAAI,IAAI,GAAG;AACxB,gBAAU,IAAI,IAAI;AAClB,YAAM,EAAE,OAAO,GAAG,KAAK,IAAI;AAC3B,cAAQ,KAAK,IAAI;AAAA,IACnB;AAAA,EACF;AACA,SAAO,QAAQ,MAAM,GAAG,IAAI;AAC9B;AAEA,SAAS,yBAAyB,GAAU,MAA+B;AAEzE,QAAM,SAAK,mBAAAC,SAAsB,CAAC;AAClC,QAAM,aAAkE,CAAC;AAEzE,IAAE,YAAY,CAAC,MAAM,MAAM,GAAG,MAAM;AAClC,UAAM,SAAS,GAAG,CAAC,KAAK,MAAM,GAAG,CAAC,KAAK;AACvC,eAAW,KAAK,CAAC,GAAG,GAAG,OAAO,IAAI,CAAC;AAAA,EACrC,CAAC;AAED,aAAW,KAAK,CAAC,GAAG,MAAM,EAAE,CAAC,IAAI,EAAE,CAAC,CAAC;AAErC,SAAO,WAAW,MAAM,GAAG,IAAI,EAAE,IAAI,CAAC,CAAC,GAAG,GAAG,OAAO,IAAI,OAAO;AAAA,IAC7D,QAAS,EAAE,iBAAiB,GAAG,OAAO,KAAgB;AAAA,IACtD,QAAS,EAAE,iBAAiB,GAAG,OAAO,KAAgB;AAAA,IACtD,cAAc;AAAA,MACX,EAAE,iBAAiB,GAAG,aAAa,KAAgB;AAAA,MACnD,EAAE,iBAAiB,GAAG,aAAa,KAAgB;AAAA,IACtD;AAAA,IACA,YAAa,KAAK,cAA8C;AAAA,IAChE,UAAW,KAAK,YAAuB;AAAA,IACvC,MAAM,wCAAwC,MAAM,QAAQ,CAAC,CAAC;AAAA,EAChE,EAAE;AACJ;AAEO,SAAS,iBACd,GACA,aACA,iBACA,OAAe,GACM;AACrB,QAAM,eAAe,aAAa,WAAW;AAC7C,QAAM,WAAW,aAAa,eAAe;AAC7C,QAAM,YAAiC,CAAC;AACxC,QAAM,gBAAgB,iBAAiB,YAAY;AAGnD,IAAE,YAAY,CAAC,MAAM,MAAM,GAAG,MAAM;AAClC,QAAI,KAAK,eAAe,aAAa;AACnC,YAAM,KAAM,EAAE,iBAAiB,GAAG,OAAO,KAAgB;AACzD,YAAM,KAAM,EAAE,iBAAiB,GAAG,OAAO,KAAgB;AACzD,YAAM,WAAY,KAAK,YAAuB;AAC9C,gBAAU,KAAK;AAAA,QACb,MAAM;AAAA,QACN,UAAU,4CAA4C,EAAE,YAAY,EAAE;AAAA,QACtE,KAAK,oCAAoC,QAAQ;AAAA,MACnD,CAAC;AAAA,IACH;AAAA,EACF,CAAC;AAGD,MAAI,EAAE,OAAO,GAAG;AACd,UAAM,SAAK,mBAAAA,SAAsB,CAAC;AAClC,UAAM,UAA8B,OAAO,QAAQ,EAAE,EAClD,OAAO,CAAC,CAAC,GAAG,CAAC,MAAM,CAAC,WAAW,GAAG,CAAC,KAAK,CAAC,cAAc,GAAG,CAAC,KAAM,IAAe,CAAC,EACjF,KAAK,CAAC,GAAG,MAAO,EAAE,CAAC,IAAgB,EAAE,CAAC,CAAY,EAClD,MAAM,GAAG,CAAC;AAEb,eAAW,CAAC,QAAQ,KAAK,KAAK,SAAS;AACrC,YAAM,QAAS,EAAE,iBAAiB,QAAQ,OAAO,KAAgB;AACjE,YAAM,MAAM,cAAc,IAAI,MAAM;AACpC,YAAM,YAAY,QAAQ,SAAa,SAAS,IAAI,GAAG,KAAK,aAAa,GAAG,KAAM;AAClF,YAAM,gBAAgB,oBAAI,IAAY;AACtC,iBAAW,KAAK,mBAAmB,GAAG,MAAM,GAAG;AAC7C,cAAM,KAAK,cAAc,IAAI,CAAC;AAC9B,YAAI,OAAO,UAAa,OAAO,IAAK,eAAc,IAAI,EAAE;AAAA,MAC1D;AACA,UAAI,cAAc,OAAO,GAAG;AAC1B,cAAM,cAAc,CAAC,GAAG,aAAa,EAAE,IAAI,CAAC,MAAM,SAAS,IAAI,CAAC,KAAK,aAAa,CAAC,EAAE;AACrF,kBAAU,KAAK;AAAA,UACb,MAAM;AAAA,UACN,UAAU,cAAc,KAAK,gBAAgB,SAAS,SAAS,YAAY,IAAI,CAAC,MAAM,KAAK,CAAC,IAAI,EAAE,KAAK,IAAI,CAAC;AAAA,UAC5G,KAAK,gCAAgC,MAAM,QAAQ,CAAC,CAAC;AAAA,QACvD,CAAC;AAAA,MACH;AAAA,IACF;AAAA,EACF;AAGA,QAAM,SAA6B,CAAC;AACpC,IAAE,YAAY,CAAC,MAAM,OAAO,KAAK,CAAC,GAAG,EAAE,OAAO,CAAC,CAAC,CAAC,CAAC;AAClD,SAAO,KAAK,CAAC,GAAG,MAAM,EAAE,CAAC,IAAI,EAAE,CAAC,CAAC;AACjC,QAAM,WAAW,OAAO,OAAO,CAAC,CAAC,CAAC,MAAM,CAAC,WAAW,GAAG,CAAC,CAAC,EAAE,MAAM,GAAG,CAAC;AAErE,aAAW,CAAC,MAAM,KAAK,UAAU;AAC/B,UAAM,WAAqB,CAAC;AAC5B,MAAE,YAAY,QAAQ,CAAC,MAAM,MAAM,QAAQ,WAAW;AACpD,UAAI,KAAK,eAAe,YAAY;AAClC,cAAM,QAAS,KAAK,QAAmB;AACvC,cAAM,QAAS,KAAK,QAAmB;AACvC,cAAM,UAAU,UAAU,SAAS,QAAQ;AAC3C,iBAAS,KAAM,EAAE,iBAAiB,SAAS,OAAO,KAAgB,OAAO;AAAA,MAC3E;AAAA,IACF,CAAC;AACD,QAAI,SAAS,UAAU,GAAG;AACxB,YAAM,QAAS,EAAE,iBAAiB,QAAQ,OAAO,KAAgB;AACjE,gBAAU,KAAK;AAAA,QACb,MAAM;AAAA,QACN,UAAU,WAAW,SAAS,MAAM,uCAAuC,KAAK,mBAAmB,SAAS,CAAC,CAAC,YAAY,SAAS,CAAC,CAAC;AAAA,QACrI,KAAK,KAAK,KAAK,UAAU,SAAS,MAAM;AAAA,MAC1C,CAAC;AAAA,IACH;AAAA,EACF;AAGA,QAAM,WAAqB,CAAC;AAC5B,IAAE,YAAY,CAAC,MAAM;AACnB,QAAI,EAAE,OAAO,CAAC,KAAK,KAAK,CAAC,WAAW,GAAG,CAAC,KAAK,CAAC,cAAc,GAAG,CAAC,GAAG;AACjE,eAAS,KAAK,CAAC;AAAA,IACjB;AAAA,EACF,CAAC;AACD,MAAI,SAAS,SAAS,GAAG;AACvB,UAAM,SAAS,SAAS,MAAM,GAAG,CAAC,EAAE,IAAI,CAAC,MAAO,EAAE,iBAAiB,GAAG,OAAO,KAAgB,CAAC;AAC9F,cAAU,KAAK;AAAA,MACb,MAAM;AAAA,MACN,UAAU,iBAAiB,OAAO,IAAI,CAAC,MAAM,KAAK,CAAC,IAAI,EAAE,KAAK,IAAI,CAAC;AAAA,MACnE,KAAK,GAAG,SAAS,MAAM;AAAA,IACzB,CAAC;AAAA,EACH;AAGA,aAAW,CAAC,KAAK,KAAK,KAAK,cAAc;AACvC,UAAM,QAAQ,cAAc,GAAG,KAAK;AACpC,QAAI,QAAQ,QAAQ,MAAM,UAAU,GAAG;AACrC,YAAM,QAAQ,SAAS,IAAI,GAAG,KAAK,aAAa,GAAG;AACnD,gBAAU,KAAK;AAAA,QACb,MAAM;AAAA,QACN,UAAU,YAAY,KAAK;AAAA,QAC3B,KAAK,kBAAkB,KAAK;AAAA,MAC9B,CAAC;AAAA,IACH;AAAA,EACF;AAEA,MAAI,UAAU,WAAW,GAAG;AAC1B,WAAO,CAAC;AAAA,MACN,MAAM;AAAA,MACN,UAAU;AAAA,MACV,KACE;AAAA,IAIJ,CAAC;AAAA,EACH;AAEA,SAAO,UAAU,MAAM,GAAG,IAAI;AAChC;AAEO,SAAS,UAAU,MAAa,MAA8B;AACnE,QAAM,WAAW,IAAI,IAAI,KAAK,MAAM,CAAC;AACrC,QAAM,WAAW,IAAI,IAAI,KAAK,MAAM,CAAC;AAErC,QAAM,eAAe,CAAC,GAAG,QAAQ,EAAE,OAAO,CAAC,MAAM,CAAC,SAAS,IAAI,CAAC,CAAC;AACjE,QAAM,iBAAiB,CAAC,GAAG,QAAQ,EAAE,OAAO,CAAC,MAAM,CAAC,SAAS,IAAI,CAAC,CAAC;AAEnE,QAAM,eAAe,aAAa,IAAI,CAAC,OAAO;AAAA,IAC5C,IAAI;AAAA,IACJ,OAAQ,KAAK,iBAAiB,GAAG,OAAO,KAAgB;AAAA,EAC1D,EAAE;AACF,QAAM,mBAAmB,eAAe,IAAI,CAAC,OAAO;AAAA,IAClD,IAAI;AAAA,IACJ,OAAQ,KAAK,iBAAiB,GAAG,OAAO,KAAgB;AAAA,EAC1D,EAAE;AAEF,WAAS,QAAQ,GAAW,GAAW,UAA0B;AAC/D,WAAO,GAAG,CAAC,GAAG,CAAC,EAAE,KAAK,EAAE,KAAK,GAAG,CAAC,IAAI,QAAQ;AAAA,EAC/C;AAEA,QAAM,cAAc,oBAAI,IAAY;AACpC,OAAK,YAAY,CAAC,MAAM,MAAM,GAAG,MAAM;AACrC,gBAAY,IAAI,QAAQ,GAAG,GAAI,KAAK,YAAuB,EAAE,CAAC;AAAA,EAChE,CAAC;AACD,QAAM,cAAc,oBAAI,IAAY;AACpC,OAAK,YAAY,CAAC,MAAM,MAAM,GAAG,MAAM;AACrC,gBAAY,IAAI,QAAQ,GAAG,GAAI,KAAK,YAAuB,EAAE,CAAC;AAAA,EAChE,CAAC;AAED,QAAM,gBAAgB,IAAI,IAAI,CAAC,GAAG,WAAW,EAAE,OAAO,CAAC,MAAM,CAAC,YAAY,IAAI,CAAC,CAAC,CAAC;AACjF,QAAM,kBAAkB,IAAI,IAAI,CAAC,GAAG,WAAW,EAAE,OAAO,CAAC,MAAM,CAAC,YAAY,IAAI,CAAC,CAAC,CAAC;AAEnF,QAAM,eAA6C,CAAC;AACpD,OAAK,YAAY,CAAC,MAAM,MAAM,GAAG,MAAM;AACrC,QAAI,cAAc,IAAI,QAAQ,GAAG,GAAI,KAAK,YAAuB,EAAE,CAAC,GAAG;AACrE,mBAAa,KAAK;AAAA,QAChB,QAAQ;AAAA,QAAG,QAAQ;AAAA,QACnB,UAAW,KAAK,YAAuB;AAAA,QACvC,YAAa,KAAK,cAAyB;AAAA,MAC7C,CAAC;AAAA,IACH;AAAA,EACF,CAAC;AAED,QAAM,mBAAqD,CAAC;AAC5D,OAAK,YAAY,CAAC,MAAM,MAAM,GAAG,MAAM;AACrC,QAAI,gBAAgB,IAAI,QAAQ,GAAG,GAAI,KAAK,YAAuB,EAAE,CAAC,GAAG;AACvE,uBAAiB,KAAK;AAAA,QACpB,QAAQ;AAAA,QAAG,QAAQ;AAAA,QACnB,UAAW,KAAK,YAAuB;AAAA,QACvC,YAAa,KAAK,cAAyB;AAAA,MAC7C,CAAC;AAAA,IACH;AAAA,EACF,CAAC;AAED,QAAM,QAAkB,CAAC;AACzB,MAAI,aAAa,SAAS,EAAG,OAAM,KAAK,GAAG,aAAa,MAAM,YAAY,aAAa,WAAW,IAAI,MAAM,EAAE,EAAE;AAChH,MAAI,aAAa,SAAS,EAAG,OAAM,KAAK,GAAG,aAAa,MAAM,YAAY,aAAa,WAAW,IAAI,MAAM,EAAE,EAAE;AAChH,MAAI,iBAAiB,SAAS,EAAG,OAAM,KAAK,GAAG,iBAAiB,MAAM,QAAQ,iBAAiB,WAAW,IAAI,MAAM,EAAE,UAAU;AAChI,MAAI,iBAAiB,SAAS,EAAG,OAAM,KAAK,GAAG,iBAAiB,MAAM,QAAQ,iBAAiB,WAAW,IAAI,MAAM,EAAE,UAAU;AAEhI,SAAO;AAAA,IACL,WAAW;AAAA,IACX,eAAe;AAAA,IACf,WAAW;AAAA,IACX,eAAe;AAAA,IACf,SAAS,MAAM,SAAS,IAAI,MAAM,KAAK,IAAI,IAAI;AAAA,EACjD;AACF;AArdA,IAKA;AALA;AAAA;AAKA,yBAAkC;AAElC;AACA;AACA;AACA;AAAA;AAAA;;;ACVA;AAAA;AAAA;AAAA;AAQO,SAAS,SACd,GACA,aACA,gBACA,iBACA,aACA,cACA,iBACA,WACA,MACA,oBAIQ;AACR,QAAM,eAAe,aAAa,WAAW;AAC7C,QAAM,cAAc,aAAa,cAAc;AAC/C,QAAM,WAAW,aAAa,eAAe;AAC7C,QAAM,wBAAwB,MAAM,QAAQ,kBAAkB,IAC1D,qBACC,oBAAoB,sBAAsB;AAC/C,QAAM,SAAQ,oBAAI,KAAK,GAAE,YAAY,EAAE,MAAM,GAAG,EAAE;AAElD,QAAM,cAAwB,CAAC;AAC/B,IAAE,YAAY,CAAC,GAAG,SAAS;AACzB,gBAAY,KAAM,KAAK,cAAyB,WAAW;AAAA,EAC7D,CAAC;AACD,QAAM,QAAQ,YAAY,UAAU;AACpC,QAAM,SAAS,KAAK,MAAO,YAAY,OAAO,CAAC,MAAM,MAAM,WAAW,EAAE,SAAS,QAAS,GAAG;AAC7F,QAAM,SAAS,KAAK,MAAO,YAAY,OAAO,CAAC,MAAM,MAAM,UAAU,EAAE,SAAS,QAAS,GAAG;AAC5F,QAAM,SAAS,KAAK,MAAO,YAAY,OAAO,CAAC,MAAM,MAAM,WAAW,EAAE,SAAS,QAAS,GAAG;AAE7F,QAAM,WAAgC,CAAC;AACvC,IAAE,YAAY,CAAC,GAAG,SAAS;AACzB,QAAI,KAAK,eAAe,YAAY;AAClC,eAAS,KAAK,EAAE,OAAQ,KAAK,oBAA+B,IAAI,CAAC;AAAA,IACnE;AAAA,EACF,CAAC;AACD,QAAM,SAAS,SAAS,SAAS,IAC7B,KAAK,MAAO,SAAS,OAAO,CAAC,GAAG,MAAM,IAAI,EAAE,OAAO,CAAC,IAAI,SAAS,SAAU,GAAG,IAAI,MAClF;AAEJ,QAAM,QAAkB;AAAA,IACtB,oBAAoB,IAAI,MAAM,KAAK;AAAA,IACnC;AAAA,IACA;AAAA,EACF;AAEA,MAAI,gBAAgB,SAAS;AAC3B,UAAM,KAAK,KAAK,gBAAgB,OAAO,EAAE;AAAA,EAC3C,OAAO;AACL,UAAM;AAAA,MACJ,KAAK,gBAAgB,WAAW,gBAAa,gBAAgB,YAAY,eAAe,CAAC;AAAA,MACzF;AAAA,IACF;AAAA,EACF;AAEA,QAAM;AAAA,IACJ;AAAA,IACA;AAAA,IACA,KAAK,EAAE,KAAK,eAAY,EAAE,IAAI,eAAY,aAAa,IAAI;AAAA,IAC3D,iBAAiB,MAAM,oBAAiB,MAAM,mBAAgB,MAAM,iBACjE,WAAW,OAAO,mBAAgB,SAAS,MAAM,2BAA2B,MAAM,MAAM;AAAA,IAC3F,iBAAiB,UAAU,MAAM,eAAe,CAAC,eAAY,UAAU,OAAO,eAAe,CAAC;AAAA,IAC9F;AAAA,IACA;AAAA,EACF;AAEA,cAAY,QAAQ,CAAC,MAAM,MAAM;AAC/B,UAAM,KAAK,GAAG,IAAI,CAAC,OAAO,KAAK,KAAK,QAAQ,KAAK,KAAK,QAAQ;AAAA,EAChE,CAAC;AAED,QAAM,KAAK,IAAI,4DAA4D;AAC3E,MAAI,aAAa,SAAS,GAAG;AAC3B,eAAW,KAAK,cAAc;AAC5B,YAAM,WAAW,EAAE,YAAY;AAC/B,YAAM,OAAO,EAAE,QAAQ;AACvB,YAAM,QAAQ,EAAE,gBAAgB,CAAC,IAAI,EAAE;AACvC,YAAM,OAAO,EAAE,cAAc;AAC7B,YAAM,SAAS,EAAE;AACjB,YAAM,UAAU,SAAS,cAAc,UAAU,OAAO,YAAY,OAAO,QAAQ,CAAC,CAAC,KAAK;AAC1F,YAAM,SAAS,aAAa,4BAA4B,4BAA4B;AACpF,YAAM;AAAA,QACJ,OAAO,EAAE,MAAM,QAAQ,QAAQ,SAAS,EAAE,MAAM,QAAQ,OAAO,IAAI,MAAM;AAAA,QACzE,KAAK,MAAM,CAAC,CAAC,WAAM,MAAM,CAAC,CAAC,GAAG,OAAO,MAAM,IAAI,MAAM,EAAE;AAAA,MACzD;AAAA,IACF;AAAA,EACF,OAAO;AACL,UAAM,KAAK,qEAAqE;AAAA,EAClF;AAEA,QAAM,aAAc,EAAE,aAAa,YAAY,KAAwC,CAAC;AACxF,MAAI,WAAW,SAAS,GAAG;AACzB,UAAM,KAAK,IAAI,qCAAqC;AACpD,eAAW,KAAK,YAAY;AAC1B,YAAM,cAAe,EAAE,SAAsB,CAAC,GAAG,KAAK,IAAI;AAC1D,YAAM,OAAQ,EAAE,cAAyB;AACzC,YAAM,SAAS,EAAE;AACjB,YAAM,UAAU,UAAU,OAAO,GAAG,IAAI,IAAI,OAAO,QAAQ,CAAC,CAAC,KAAK;AAClE,YAAM,KAAK,OAAO,EAAE,SAAS,EAAE,MAAM,EAAE,aAAQ,UAAU,KAAK,OAAO,GAAG;AAAA,IAC1E;AAAA,EACF;AAEA,QAAM,KAAK,IAAI,gBAAgB;AAC/B,aAAW,CAAC,KAAK,KAAK,KAAK,cAAc;AACvC,UAAM,QAAQ,SAAS,IAAI,GAAG,KAAK,aAAa,GAAG;AACnD,UAAM,QAAQ,YAAY,IAAI,GAAG,KAAK;AACtC,UAAM,YAAY,MAAM,OAAO,CAAC,MAAM,CAAC,WAAW,GAAG,CAAC,CAAC;AACvD,UAAM,UAAU,UAAU,MAAM,GAAG,CAAC,EAAE,IAAI,CAAC,MAAO,EAAE,iBAAiB,GAAG,OAAO,KAAgB,CAAC;AAChG,UAAM,SAAS,UAAU,SAAS,IAAI,MAAM,UAAU,SAAS,CAAC,WAAW;AAC3E,UAAM;AAAA,MACJ;AAAA,MACA,iBAAiB,GAAG,OAAO,KAAK;AAAA,MAChC,aAAa,KAAK;AAAA,MAClB,UAAU,UAAU,MAAM,MAAM,QAAQ,KAAK,IAAI,CAAC,GAAG,MAAM;AAAA,IAC7D;AAAA,EACF;AAEA,QAAM,YAAyD,CAAC;AAChE,IAAE,YAAY,CAAC,GAAG,MAAM,GAAG,MAAM;AAC/B,QAAI,KAAK,eAAe,YAAa,WAAU,KAAK,CAAC,GAAG,GAAG,IAAI,CAAC;AAAA,EAClE,CAAC;AACD,MAAI,UAAU,SAAS,GAAG;AACxB,UAAM,KAAK,IAAI,mCAAmC;AAClD,eAAW,CAAC,GAAG,GAAG,CAAC,KAAK,WAAW;AACjC,YAAM,KAAM,EAAE,iBAAiB,GAAG,OAAO,KAAgB;AACzD,YAAM,KAAM,EAAE,iBAAiB,GAAG,OAAO,KAAgB;AACzD,YAAM;AAAA,QACJ,OAAO,EAAE,eAAU,EAAE;AAAA,QACrB,KAAK,EAAE,eAAe,EAAE,mBAAgB,EAAE,YAAY,SAAS;AAAA,MACjE;AAAA,IACF;AAAA,EACF;AAGA,QAAM,WAAW,EAAE,MAAM,EAAE;AAAA,IACzB,CAAC,MAAM,EAAE,OAAO,CAAC,KAAK,KAAK,CAAC,WAAW,GAAG,CAAC,KAAK,CAAC,cAAc,GAAG,CAAC;AAAA,EACrE;AACA,QAAM,kBAAkB,oBAAI,IAAsB;AAClD,aAAW,CAAC,KAAK,KAAK,KAAK,cAAc;AACvC,QAAI,MAAM,SAAS,EAAG,iBAAgB,IAAI,KAAK,KAAK;AAAA,EACtD;AACA,QAAM,WAAW,SAAS,SAAS,gBAAgB;AAEnD,MAAI,WAAW,KAAK,SAAS,IAAI;AAC/B,UAAM,KAAK,IAAI,mBAAmB;AAClC,QAAI,SAAS,SAAS,GAAG;AACvB,YAAM,iBAAiB,SAAS,MAAM,GAAG,CAAC,EAAE,IAAI,CAAC,MAAO,EAAE,iBAAiB,GAAG,OAAO,KAAgB,CAAC;AACtG,YAAM,SAAS,SAAS,SAAS,IAAI,MAAM,SAAS,SAAS,CAAC,WAAW;AACzE,YAAM;AAAA,QACJ,OAAO,SAAS,MAAM,wBAAwB,eAAe,IAAI,CAAC,MAAM,KAAK,CAAC,IAAI,EAAE,KAAK,IAAI,CAAC,GAAG,MAAM;AAAA,QACvG;AAAA,MACF;AAAA,IACF;AACA,QAAI,gBAAgB,OAAO,GAAG;AAC5B,iBAAW,CAAC,KAAK,KAAK,KAAK,iBAAiB;AAC1C,cAAM,QAAQ,SAAS,IAAI,GAAG,KAAK,aAAa,GAAG;AACnD,cAAM,aAAa,MAAM,IAAI,CAAC,MAAO,EAAE,iBAAiB,GAAG,OAAO,KAAgB,CAAC;AACnF,cAAM;AAAA,UACJ,wBAAwB,KAAK,SAAS,MAAM,MAAM,YAAY,WAAW,IAAI,CAAC,MAAM,KAAK,CAAC,IAAI,EAAE,KAAK,IAAI,CAAC;AAAA,UAC1G;AAAA,QACF;AAAA,MACF;AAAA,IACF;AACA,QAAI,SAAS,IAAI;AACf,YAAM,KAAK,uBAAuB,MAAM,uEAAuE;AAAA,IACjH;AAAA,EACF;AAEA,MAAI,yBAAyB,sBAAsB,SAAS,GAAG;AAC7D,UAAM,KAAK,IAAI,wBAAwB;AACvC,UAAM,WAAW,sBAAsB,WAAW,KAAK,sBAAsB,CAAC,EAAG,SAAS;AAC1F,QAAI,UAAU;AACZ,YAAM,KAAK,IAAI,sBAAsB,CAAC,EAAG,GAAG,GAAG;AAAA,IACjD,OAAO;AACL,YAAM,KAAK,4DAA4D,EAAE;AACzE,iBAAW,KAAK,uBAAuB;AACrC,YAAI,EAAE,UAAU;AACd,gBAAM,KAAK,OAAO,EAAE,QAAQ,MAAM,MAAM,EAAE,GAAG,GAAG;AAAA,QAClD;AAAA,MACF;AAAA,IACF;AAAA,EACF;AAEA,SAAO,MAAM,KAAK,IAAI;AACxB;AAjMA;AAAA;AAKA;AACA;AAAA;AAAA;;;ACgBA,eAAsB,YAAY,KAA8B;AAC9D,MAAI;AACJ,MAAI;AACF,aAAS,IAAI,oBAAI,GAAG;AAAA,EACtB,QAAQ;AACN,UAAM,IAAI,MAAM,gBAAgB,GAAG,EAAE;AAAA,EACvC;AAEA,MAAI,CAAC,gBAAgB,IAAI,OAAO,QAAQ,GAAG;AACzC,UAAM,IAAI;AAAA,MACR,uBAAuB,OAAO,QAAQ,6CAA6C,GAAG;AAAA,IACxF;AAAA,EACF;AAEA,QAAM,WAAW,OAAO;AACxB,MAAI,UAAU;AACZ,QAAI,cAAc,IAAI,SAAS,YAAY,CAAC,GAAG;AAC7C,YAAM,IAAI,MAAM,oCAAoC,QAAQ,WAAW,GAAG,EAAE;AAAA,IAC9E;AAGA,QAAI;AACF,YAAM,QAAQ,MAAU,aAAS,QAAQ,EAAE,MAAM,MAAM,CAAC,CAAa;AACrE,YAAM,SAAS,MAAU,aAAS,QAAQ,EAAE,MAAM,MAAM,CAAC,CAAa;AACtE,iBAAW,QAAQ,CAAC,GAAG,OAAO,GAAG,MAAM,GAAG;AACxC,YAAI,YAAY,IAAI,GAAG;AACrB,gBAAM,IAAI;AAAA,YACR,+BAA+B,IAAI,oBAAoB,QAAQ,YAAY,GAAG;AAAA,UAChF;AAAA,QACF;AAAA,MACF;AAAA,IACF,SAAS,GAAG;AACV,UAAI,aAAa,SAAS,EAAE,QAAQ,WAAW,SAAS,EAAG,OAAM;AAAA,IAEnE;AAAA,EACF;AAEA,SAAO;AACT;AAwBA,SAAS,YAAY,MAAuB;AAC1C,MAAQ,WAAO,IAAI,GAAG;AACpB,UAAM,QAAQ,KAAK,MAAM,GAAG,EAAE,IAAI,MAAM;AACxC,UAAM,CAAC,GAAG,CAAC,IAAI;AAEf,QAAI,MAAM,IAAK,QAAO;AACtB,QAAI,MAAM,GAAI,QAAO;AACrB,QAAI,MAAM,OAAO,MAAM,UAAa,KAAK,MAAM,KAAK,GAAI,QAAO;AAC/D,QAAI,MAAM,OAAO,MAAM,IAAK,QAAO;AACnC,QAAI,MAAM,OAAO,MAAM,IAAK,QAAO;AACnC,QAAI,MAAM,EAAG,QAAO;AACpB,WAAO;AAAA,EACT;AACA,MAAQ,WAAO,IAAI,GAAG;AACpB,UAAM,QAAQ,KAAK,YAAY;AAC/B,QAAI,UAAU,SAAS,MAAM,WAAW,OAAO,KAAK,MAAM,WAAW,IAAI,KAAK,MAAM,WAAW,IAAI,GAAG;AACpG,aAAO;AAAA,IACT;AAAA,EACF;AACA,SAAO;AACT;AAUA,eAAsB,UACpB,KACA,WAAmB,iBACnB,UAAkB,KACD;AACjB,QAAM,YAAY,GAAG;AAErB,QAAM,aAAa,IAAI,gBAAgB;AACvC,QAAM,QAAQ,WAAW,MAAM,WAAW,MAAM,GAAG,OAAO;AAE1D,MAAI;AACF,UAAM,OAAO,MAAM,MAAM,KAAK;AAAA,MAC5B,QAAQ,WAAW;AAAA,MACnB,SAAS,EAAE,cAAc,2BAA2B;AAAA,MACpD,UAAU;AAAA,IACZ,CAAC;AAED,QAAI,CAAC,KAAK,IAAI;AACZ,YAAM,IAAI,MAAM,QAAQ,KAAK,MAAM,aAAa,GAAG,EAAE;AAAA,IACvD;AAGA,QAAI,KAAK,QAAQ,KAAK;AACpB,YAAM,YAAY,KAAK,GAAG;AAAA,IAC5B;AAEA,UAAM,SAAS,KAAK,MAAM,UAAU;AACpC,QAAI,CAAC,OAAQ,OAAM,IAAI,MAAM,kBAAkB;AAE/C,UAAM,SAAuB,CAAC;AAC9B,QAAI,QAAQ;AAEZ,WAAO,MAAM;AACX,YAAM,EAAE,MAAM,MAAM,IAAI,MAAM,OAAO,KAAK;AAC1C,UAAI,KAAM;AACV,eAAS,MAAM;AACf,UAAI,QAAQ,UAAU;AACpB,eAAO,OAAO;AACd,cAAM,IAAI;AAAA,UACR,iBAAiB,GAAG,wBAAwB,KAAK,MAAM,WAAW,OAAS,CAAC;AAAA,QAC9E;AAAA,MACF;AACA,aAAO,KAAK,KAAK;AAAA,IACnB;AAEA,WAAO,OAAO,OAAO,MAAM;AAAA,EAC7B,UAAE;AACA,iBAAa,KAAK;AAAA,EACpB;AACF;AAGA,eAAsB,cACpB,KACA,WAAmB,gBACnB,UAAkB,MACD;AACjB,QAAM,MAAM,MAAM,UAAU,KAAK,UAAU,OAAO;AAClD,SAAO,IAAI,SAAS,OAAO;AAC7B;AAUO,SAAS,kBAAkB,UAAkB,MAAuB;AACzE,QAAM,mBAAe,kBAAAC,SAAY,QAAQ,cAAc;AAEvD,MAAI,KAAC,4BAAW,YAAY,GAAG;AAC7B,UAAM,IAAI;AAAA,MACR,wCAAwC,YAAY;AAAA,IACtD;AAAA,EACF;AAEA,QAAM,eAAW,kBAAAA,SAAY,QAAQ;AAErC,MAAI,CAAC,SAAS,WAAW,eAAe,GAAG,KAAK,aAAa,cAAc;AACzE,UAAM,IAAI;AAAA,MACR,SAAS,QAAQ,mCAAmC,YAAY;AAAA,IAClE;AAAA,EACF;AAEA,MAAI,KAAC,4BAAW,QAAQ,GAAG;AACzB,UAAM,IAAI,MAAM,yBAAyB,QAAQ,EAAE;AAAA,EACrD;AAEA,SAAO;AACT;AAUO,SAAS,cAAc,MAAsB;AAClD,MAAI,UAAU,KAAK,QAAQ,iBAAiB,EAAE;AAC9C,MAAI,QAAQ,SAAS,eAAe;AAClC,cAAU,QAAQ,MAAM,GAAG,aAAa;AAAA,EAC1C;AACA,SAAO;AACT;AAGO,SAAS,WAAW,MAAsB;AAC/C,SAAO,KACJ,QAAQ,MAAM,OAAO,EACrB,QAAQ,MAAM,MAAM,EACpB,QAAQ,MAAM,MAAM,EACpB,QAAQ,MAAM,QAAQ,EACtB,QAAQ,MAAM,OAAO;AAC1B;AAvOA,IAGAC,mBACAC,iBACA,iBACA,KACA,KAEM,iBACA,iBACA,gBACA,eAuMA,iBACA;AApNN;AAAA;AAGA,IAAAD,oBAAuC;AACvC,IAAAC,kBAA2B;AAC3B,sBAAoB;AACpB,UAAqB;AACrB,UAAqB;AAErB,IAAM,kBAAkB,oBAAI,IAAI,CAAC,SAAS,QAAQ,CAAC;AACnD,IAAM,kBAAkB;AACxB,IAAM,iBAAiB;AACvB,IAAM,gBAAgB,oBAAI,IAAI,CAAC,4BAA4B,qBAAqB,CAAC;AAuMjF,IAAM,kBAAkB;AACxB,IAAM,gBAAgB;AAAA;AAAA;;;ACpNtB;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAgDA,SAASC,kBAAiB,aAA4D;AACpF,QAAM,eAAe,aAAa,WAAW;AAC7C,QAAM,SAAS,oBAAI,IAAoB;AACvC,aAAW,CAAC,KAAK,KAAK,KAAK,cAAc;AACvC,eAAW,KAAK,MAAO,QAAO,IAAI,GAAG,GAAG;AAAA,EAC1C;AACA,SAAO;AACT;AAEA,SAAS,aAAa,GAAmB;AACvC,SAAO,EAAE,QAAQ,OAAO,MAAM,EAAE,QAAQ,MAAM,KAAK;AACrD;AAEA,SAAS,wBACP,OACgC;AAChC,SAAO,EAAE,iBAAiB,QAAQ,OAAO,UAAU,eAAe,KAAK,OAAO,iBAAiB;AACjG;AAEA,SAAS,gBACP,OACwB;AACxB,SAAO,EAAE,iBAAiB,SACxB,OAAO,UAAU,eAAe,KAAK,OAAO,iBAAiB,KAC7D,OAAO,UAAU,eAAe,KAAK,OAAO,eAAe;AAE/D;AAEA,SAAS,aACP,OACqB;AACrB,SAAO,EAAE,iBAAiB,SACxB,OAAO,UAAU,eAAe,KAAK,OAAO,iBAAiB,KAC7D,OAAO,UAAU,eAAe,KAAK,OAAO,SAAS;AAEzD;AAEA,SAAS,yBACP,iBACiC;AACjC,MAAI,CAAC,gBAAiB,QAAO;AAC7B,MAAI,CAAC,wBAAwB,eAAe,GAAG;AAC7C,WAAO,aAAa,eAAuC;AAAA,EAC7D;AACA,SAAO,aAAa,gBAAgB,eAAe;AACrD;AAMO,SAAS,OACd,GACA,aACA,YACA,0BACM;AACN,QAAM,WAAWA,kBAAiB,WAAW;AAC7C,QAAM,kBAAkB,yBAAyB,wBAAwB;AAEzE,QAAM,QAAmC,CAAC;AAC1C,IAAE,YAAY,CAAC,QAAQ,UAAU;AAC/B,UAAM,cAAc,SAAS,IAAI,MAAM,KAAK;AAC5C,UAAM,KAAK;AAAA,MACT,IAAI;AAAA,MACJ,GAAG;AAAA,MACH,WAAW;AAAA,MACX,gBACE,gBAAgB,OACZ,cAAc,iBAAiB,IAAI,WAAW,KAAK,aAAa,WAAW,EAAE,IAC7E;AAAA,IACR,CAAC;AAAA,EACH,CAAC;AAED,QAAM,QAAmC,CAAC;AAC1C,IAAE,YAAY,CAAC,OAAO,MAAM,QAAQ,WAAW;AAC7C,UAAM,OAAgC;AAAA,MACpC;AAAA,MACA;AAAA,MACA,GAAG;AAAA,IACL;AACA,QAAI,KAAK,qBAAqB,QAAW;AACvC,YAAM,OAAQ,KAAK,cAAyB;AAC5C,WAAK,mBAAmB,0BAA0B,IAAI,KAAK;AAAA,IAC7D;AACA,UAAM,KAAK,IAAI;AAAA,EACjB,CAAC;AAED,QAAM,aAAc,EAAE,aAAa,YAAY,KAAiC,CAAC;AACjF,QAAM,wBAAwB,kBAC1B,OAAO;AAAA,IACL,CAAC,GAAG,gBAAgB,QAAQ,CAAC,EAC1B,KAAK,CAAC,GAAG,MAAM,EAAE,CAAC,IAAI,EAAE,CAAC,CAAC,EAC1B,IAAI,CAAC,CAAC,KAAK,KAAK,MAAM,CAAC,OAAO,GAAG,GAAG,cAAc,KAAK,CAAC,CAAC;AAAA,EAC9D,IACA,CAAC;AAEL,QAAM,SAAS;AAAA,IACb,UAAU,gBAAgB,CAAC;AAAA,IAC3B,YAAY;AAAA,IACZ,OAAO;AAAA,MACL,kBAAkB;AAAA,IACpB;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,EACF;AAEA,qCAAc,YAAY,KAAK,UAAU,QAAQ,MAAM,CAAC,GAAG,OAAO;AACpE;AAMO,SAAS,SAAS,GAAU,YAA0B;AAC3D,QAAM,QAAkB,CAAC,4DAA4D,EAAE;AAEvF,IAAE,YAAY,CAAC,QAAQ,SAAS;AAC9B,UAAM,QAAQ,aAAc,KAAK,SAAoB,MAAM;AAC3D,UAAM,YAAY,aAAa,MAAM;AACrC,UAAM,SAAU,KAAK,aAAwB,WAC1C,OAAO,CAAC,EAAE,YAAY,KAAM,KAAK,aAAwB,WAAW,MAAM,CAAC;AAC9E,UAAM,UAAU,MAAM,QAAQ,kBAAkB,EAAE;AAClD,UAAM,QAAQ,WAAW,YAAY,KAAK,OAAO,IAAI,UAAU;AAC/D,UAAM,KAAK,YAAY,KAAK,UAAU,SAAS,cAAc,KAAK,MAAM;AAAA,EAC1E,CAAC;AAED,QAAM,KAAK,EAAE;AAEb,IAAE,YAAY,CAAC,OAAO,MAAM,GAAG,MAAM;AACnC,UAAM,OAAQ,KAAK,YAAuB,cACvC,YAAY,EACZ,QAAQ,kBAAkB,GAAG;AAChC,UAAM,OAAO,aAAc,KAAK,cAAyB,WAAW;AACpE,UAAM,OAAO,aAAa,CAAC;AAC3B,UAAM,OAAO,aAAa,CAAC;AAC3B,UAAM;AAAA,MACJ,kBAAkB,IAAI,iBAAiB,IAAI,mBAC5B,GAAG,kBAAkB,IAAI;AAAA,IAC1C;AAAA,EACF,CAAC;AAED,qCAAc,YAAY,MAAM,KAAK,IAAI,GAAG,OAAO;AACrD;AAEA,SAAS,WAAW,OAAuB;AACzC,QAAM,YAAY,MAAM,QAAQ,kBAAkB,EAAE;AACpD,SAAO,aAAa;AACtB;AAEA,SAAS,cAAc,UAA0B;AAC/C,QAAM,YAAY,SACf,YAAY,EACZ,QAAQ,WAAW,GAAG,EACtB,QAAQ,eAAe,GAAG;AAC7B,SAAO,aAAa;AACtB;AAEA,SAAS,YAAY,MAA0E;AAC7F,QAAM,QAAmD,CAAC;AAC1D,aAAW,CAAC,KAAK,KAAK,KAAK,OAAO,QAAQ,IAAI,GAAG;AAC/C,QACE,OAAO,UAAU,YACjB,OAAO,UAAU,YACjB,OAAO,UAAU,WACjB;AACA,YAAM,GAAG,IAAI;AAAA,IACf;AAAA,EACF;AACA,SAAO;AACT;AAEA,eAAsB,YACpB,GACA,cACA,MACA,UACA,aAC2C;AAC3C,QAAM,UAAU,OAAO,iBAAiB,WACpC;AAAA,IACA,KAAK;AAAA,IACL,MAAM,QAAQ;AAAA,IACd,UAAU,YAAY;AAAA,IACtB;AAAA,EACF,IACE;AAEJ,MAAI;AACJ,MAAI;AACF,eAAW,MAAM,OAAO,cAAc;AAAA,EACxC,QAAQ;AACN,UAAM,IAAI,MAAM,2DAA2D;AAAA,EAC7E;AAEA,QAAM,QAAQ,SAAS,WAAW;AAClC,QAAM,SAAS,MAAM;AAAA,IACnB,QAAQ;AAAA,IACR,MAAM,KAAK,MAAM,QAAQ,MAAM,QAAQ,QAAQ;AAAA,EACjD;AACA,QAAM,eAAeA,kBAAiB,QAAQ,eAAe,oBAAI,IAAsB,CAAC;AAExF,MAAI,QAAQ;AACZ,MAAI,QAAQ;AACZ,QAAM,UAAU,OAAO,QAAQ;AAE/B,MAAI;AACF,eAAW,UAAU,EAAE,MAAM,GAAG;AAC9B,YAAM,QAAQ,EAAE,kBAAkB,MAAM;AACxC,YAAM,QAAQ,YAAY,KAAK;AAC/B,YAAM,KAAK;AAEX,YAAM,cAAc,aAAa,IAAI,MAAM;AAC3C,UAAI,gBAAgB,QAAW;AAC7B,cAAM,YAAY;AAAA,MACpB;AAEA,YAAM,WAAW;AAAA,SACZ,MAAM,aAAwB,UAAU,OAAO,CAAC,EAAE,YAAY,KAC9D,MAAM,aAAwB,UAAU,MAAM,CAAC;AAAA,MACpD;AAEA,YAAM,QAAQ;AAAA,QACZ,YAAY,QAAQ;AAAA,QACpB,EAAE,IAAI,QAAQ,MAAM;AAAA,MACtB;AACA;AAAA,IACF;AAEA,eAAW,WAAW,EAAE,MAAM,GAAG;AAC/B,YAAM,SAAS,EAAE,OAAO,OAAO;AAC/B,YAAM,SAAS,EAAE,OAAO,OAAO;AAC/B,YAAM,QAAQ,EAAE,kBAAkB,OAAO;AACzC,YAAM,WAAW,cAAe,MAAM,YAAuB,YAAY;AACzE,YAAM,QAAQ,YAAY,KAAK;AAE/B,YAAM,QAAQ;AAAA,QACZ,2DACgB,QAAQ;AAAA,QACxB,EAAE,QAAQ,QAAQ,MAAM;AAAA,MAC1B;AACA;AAAA,IACF;AAAA,EACF,UAAE;AACA,UAAM,QAAQ,MAAM;AACpB,UAAM,OAAO,MAAM;AAAA,EACrB;AAEA,SAAO,EAAE,OAAO,MAAM;AACxB;AAMA,SAAS,aAAqB;AAC5B,SAAO;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AA8BT;AAEA,SAAS,gBAAgB,gBAAgC;AACvD,SAAO;AAAA;AAAA,qBAEY,cAAc;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AA+CnC;AAEA,SAAS,WAAW,WAAmB,WAAmB,YAA4B;AACpF,SAAO;AAAA,oBACW,SAAS;AAAA,oBACT,SAAS;AAAA,iBACZ,UAAU;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAqJ3B;AAEO,SAAS,OACd,GACA,aACA,YACA,0BACM;AACN,QAAM,eAAe,aAAa,WAAW;AAC7C,QAAM,kBAAkB,yBAAyB,wBAAwB;AACzE,MAAI,EAAE,QAAQ,mBAAmB;AAC/B,UAAM,IAAI;AAAA,MACR,aAAa,EAAE,KAAK;AAAA,IAEtB;AAAA,EACF;AAEA,QAAM,WAAWA,kBAAiB,YAAY;AAC9C,QAAM,SAAS,oBAAI,IAAoB;AACvC,IAAE,YAAY,CAAC,MAAM,OAAO,IAAI,GAAG,EAAE,OAAO,CAAC,CAAC,CAAC;AAC/C,QAAM,SAAS,KAAK,IAAI,GAAG,GAAG,OAAO,OAAO,CAAC;AAgB7C,QAAM,WAAsB,CAAC;AAC7B,IAAE,YAAY,CAAC,QAAQ,SAAS;AAC9B,UAAM,MAAM,SAAS,IAAI,MAAM,KAAK;AACpC,UAAM,QAAQ,iBAAiB,MAAM,iBAAiB,MAAM;AAC5D,UAAM,QAAQ,cAAe,KAAK,SAAoB,MAAM;AAC5D,UAAM,MAAM,OAAO,IAAI,MAAM,KAAK;AAClC,UAAM,OAAO,KAAK,MAAM,MAAM;AAC9B,UAAM,WAAW,OAAO,SAAS,OAAO,KAAK;AAC7C,aAAS,KAAK;AAAA,MACZ,IAAI;AAAA,MACJ;AAAA,MACA,OAAO;AAAA,QACL,YAAY;AAAA,QACZ,QAAQ;AAAA,QACR,WAAW,EAAE,YAAY,WAAW,QAAQ,MAAM;AAAA,MACpD;AAAA,MACA,MAAM,KAAK,MAAM,OAAO,EAAE,IAAI;AAAA,MAC9B,MAAM,EAAE,MAAM,UAAU,OAAO,UAAU;AAAA,MACzC,OAAO;AAAA,MACP,WAAW;AAAA,MACX,gBAAgB,cAAc,iBAAiB,IAAI,GAAG,KAAK,aAAa,GAAG,EAAE;AAAA,MAC7E,aAAa,cAAe,KAAK,eAA0B,EAAE;AAAA,MAC7D,WAAY,KAAK,aAAwB;AAAA,MACzC,QAAQ;AAAA,IACV,CAAC;AAAA,EACH,CAAC;AAaD,QAAM,WAAsB,CAAC;AAC7B,IAAE,YAAY,CAAC,OAAO,MAAM,GAAG,MAAM;AACnC,UAAM,aAAc,KAAK,cAAyB;AAClD,UAAM,WAAY,KAAK,YAAuB;AAC9C,aAAS,KAAK;AAAA,MACZ,MAAM;AAAA,MACN,IAAI;AAAA,MACJ,OAAO;AAAA,MACP,OAAO,GAAG,QAAQ,KAAK,UAAU;AAAA,MACjC,QAAQ,eAAe;AAAA,MACvB,OAAO,eAAe,cAAc,IAAI;AAAA,MACxC,OAAO,EAAE,SAAS,eAAe,cAAc,MAAM,KAAK;AAAA,MAC1D;AAAA,IACF,CAAC;AAAA,EACH,CAAC;AASD,QAAM,aAA4B,CAAC;AACnC,QAAM,YAAY,kBAAkB,CAAC,GAAG,gBAAgB,KAAK,CAAC,EAAE,KAAK,CAAC,GAAG,MAAM,IAAI,CAAC,IAAI,CAAC;AACzF,aAAW,OAAO,WAAW;AAC3B,UAAM,QAAQ,iBAAiB,MAAM,iBAAiB,MAAM;AAC5D,UAAM,MAAM,WAAW,cAAc,iBAAiB,IAAI,GAAG,KAAK,aAAa,GAAG,EAAE,CAAC;AACrF,UAAM,IAAI,aAAa,IAAI,GAAG,GAAG,UAAU;AAC3C,eAAW,KAAK,EAAE,KAAK,OAAO,OAAO,KAAK,OAAO,EAAE,CAAC;AAAA,EACtD;AAEA,QAAM,YAAY,KAAK,UAAU,QAAQ;AACzC,QAAM,YAAY,KAAK,UAAU,QAAQ;AACzC,QAAM,aAAa,KAAK,UAAU,UAAU;AAC5C,QAAM,gBAAiB,EAAE,aAAa,YAAY,KAAiC,CAAC;AACpF,QAAM,iBAAiB,KAAK,UAAU,aAAa;AACnD,QAAM,QAAQ,WAAW,cAAc,UAAU,CAAC;AAClD,QAAM,QACJ,GAAG,EAAE,KAAK,mBAAmB,EAAE,IAAI,mBAAmB,aAAa,IAAI;AAEzE,QAAM,OAAO;AAAA;AAAA;AAAA;AAAA,oBAIK,KAAK;AAAA;AAAA,EAEvB,WAAW,CAAC;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,oBAiBM,KAAK;AAAA;AAAA,EAEvB,WAAW,WAAW,WAAW,UAAU,CAAC;AAAA,EAC5C,gBAAgB,cAAc,CAAC;AAAA;AAAA;AAI/B,qCAAc,YAAY,MAAM,OAAO;AACzC;AAMO,SAAS,UACd,GACA,aACA,YACM;AACN,QAAM,WAAWA,kBAAiB,WAAW;AAE7C,QAAM,SAAS,CAAC,MACd,EACG,QAAQ,MAAM,OAAO,EACrB,QAAQ,MAAM,MAAM,EACpB,QAAQ,MAAM,MAAM,EACpB,QAAQ,MAAM,QAAQ,EACtB,QAAQ,MAAM,QAAQ;AAE3B,QAAM,QAAkB,CAAC;AACzB,QAAM,KAAK,wCAAwC;AACnD,QAAM;AAAA,IACJ;AAAA,EAIF;AAGA,QAAM,KAAK,qEAAqE;AAChF,QAAM,KAAK,6EAA6E;AACxF,QAAM,KAAK,iFAAiF;AAC5F,QAAM,KAAK,0EAA0E;AACrF,QAAM,KAAK,2EAA2E;AACtF,QAAM,KAAK,+EAA+E;AAE1F,QAAM,KAAK,gCAAgC,gBAAgB,CAAC,IAAI,aAAa,YAAY,IAAI;AAE7F,IAAE,YAAY,CAAC,QAAQ,SAAS;AAC9B,UAAM,KAAK,iBAAiB,OAAO,MAAM,CAAC,IAAI;AAC9C,UAAM,KAAK,2BAA2B,OAAQ,KAAK,SAAoB,MAAM,CAAC,SAAS;AACvF,UAAM,KAAK,+BAA+B,OAAQ,KAAK,aAAwB,EAAE,CAAC,SAAS;AAC3F,UAAM,KAAK,iCAAiC,OAAQ,KAAK,eAA0B,EAAE,CAAC,SAAS;AAC/F,UAAM,KAAK,+BAA+B,SAAS,IAAI,MAAM,KAAK,EAAE,SAAS;AAC7E,UAAM,KAAK,aAAa;AAAA,EAC1B,CAAC;AAED,IAAE,YAAY,CAAC,OAAO,MAAM,QAAQ,WAAW;AAC7C,UAAM,KAAK,qBAAqB,OAAO,MAAM,CAAC,aAAa,OAAO,MAAM,CAAC,IAAI;AAC7E,UAAM,KAAK,8BAA8B,OAAQ,KAAK,YAAuB,EAAE,CAAC,SAAS;AACzF,UAAM,KAAK,gCAAgC,OAAQ,KAAK,cAAyB,WAAW,CAAC,SAAS;AACtG,UAAM,KAAK,aAAa;AAAA,EAC1B,CAAC;AAED,QAAM,KAAK,YAAY;AACvB,QAAM,KAAK,YAAY;AAEvB,qCAAc,YAAY,MAAM,KAAK,IAAI,GAAG,OAAO;AACrD;AAMO,SAAS,MACd,GACA,aACA,YACA,0BACA,UAA4B,CAAC,IAAI,EAAE,GAC7B;AACN,QAAM,eAAe,aAAa,WAAW;AAC7C,QAAM,UAAU,4BAA4B,aAAa,wBAAwB,IAC7E,2BACA;AACJ,QAAM,kBAAkB,yBAAyB,wBAAwB;AACzE,QAAM,WAAWA,kBAAiB,YAAY;AAC9C,QAAM,aAAa,SAAS,WAAW;AACvC,QAAM,CAAC,SAAS,QAAQ,IAAI;AAC5B,QAAM,QAAQ,UAAU;AACxB,QAAM,SAAS,WAAW;AAC1B,QAAM,KAAK,QAAQ;AACnB,QAAM,KAAK,SAAS;AACpB,QAAM,SAAS,KAAK,IAAI,IAAI,EAAE,IAAI;AAElC,QAAM,WAAW,EAAE,MAAM;AACzB,QAAM,IAAI,SAAS;AAGnB,QAAM,MAAM,oBAAI,IAA8B;AAC9C,WAAS,IAAI,GAAG,IAAI,GAAG,KAAK;AAC1B,UAAM,QAAS,IAAI,KAAK,KAAK,IAAK,KAAK,IAAI,GAAG,CAAC;AAC/C,QAAI,IAAI,SAAS,CAAC,GAAI;AAAA,MACpB,KAAK,SAAS,KAAK,IAAI,KAAK;AAAA,MAC5B,KAAK,SAAS,KAAK,IAAI,KAAK;AAAA,IAC9B,CAAC;AAAA,EACH;AAEA,QAAM,SAAS,oBAAI,IAAoB;AACvC,IAAE,YAAY,CAAC,SAAS,OAAO,IAAI,MAAM,EAAE,OAAO,IAAI,CAAC,CAAC;AACxD,QAAM,SAAS,KAAK,IAAI,GAAG,GAAG,OAAO,OAAO,CAAC;AAE7C,QAAM,SAAS,CAAC,MACd,EACG,QAAQ,MAAM,OAAO,EACrB,QAAQ,MAAM,MAAM,EACpB,QAAQ,MAAM,MAAM,EACpB,QAAQ,MAAM,QAAQ;AAE3B,QAAM,WAAqB,CAAC;AAC5B,WAAS;AAAA,IACP,wDAAwD,KAAK,IAAI,MAAM,YAC7D,KAAK,aAAa,MAAM;AAAA,EACpC;AAGA,IAAE,YAAY,CAAC,OAAO,MAAM,GAAG,MAAM;AACnC,UAAM,CAAC,IAAI,EAAE,IAAI,IAAI,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC;AACpC,UAAM,CAAC,IAAI,EAAE,IAAI,IAAI,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC;AACpC,UAAM,OAAQ,KAAK,cAAyB;AAC5C,UAAM,YAAY,SAAS,cAAc,KAAK;AAC9C,UAAM,UAAU,SAAS,cAAc,MAAM;AAC7C,aAAS;AAAA,MACP,eAAe,EAAE,SAAS,EAAE,SAAS,EAAE,SAAS,EAAE,kDACF,OAAO,IAAI,SAAS;AAAA,IACtE;AAAA,EACF,CAAC;AAGD,aAAW,UAAU,UAAU;AAC7B,UAAM,CAAC,GAAG,CAAC,IAAI,IAAI,IAAI,MAAM,KAAK,CAAC,GAAG,CAAC;AACvC,UAAM,MAAM,SAAS,IAAI,MAAM,KAAK;AACpC,UAAM,QAAQ,iBAAiB,MAAM,iBAAiB,MAAM;AAC5D,UAAM,MAAM,OAAO,IAAI,MAAM,KAAK;AAClC,UAAM,IAAI,IAAI,MAAM,MAAM;AAC1B,aAAS;AAAA,MACP,iBAAiB,CAAC,SAAS,CAAC,QAAQ,CAAC,WAAW,KAAK;AAAA,IACvD;AACA,UAAM,QAAS,EAAE,iBAAiB,QAAQ,OAAO,KAAgB;AACjE,aAAS;AAAA,MACP,cAAc,CAAC,QAAQ,IAAI,IAAI,EAAE,8EACsB,OAAO,KAAK,CAAC;AAAA,IACtE;AAAA,EACF;AAGA,MAAI,iBAAiB;AACnB,UAAM,aAAa,CAAC,GAAG,gBAAgB,KAAK,CAAC,EAAE,KAAK,CAAC,GAAG,MAAM,IAAI,CAAC;AACnE,QAAI,KAAK;AACT,eAAW,OAAO,YAAY;AAC5B,YAAM,QAAQ,iBAAiB,MAAM,iBAAiB,MAAM;AAC5D,YAAM,QAAQ,gBAAgB,IAAI,GAAG,KAAK,aAAa,GAAG;AAC1D,YAAM,QAAQ,aAAa,IAAI,GAAG,GAAG,UAAU;AAC/C,eAAS;AAAA,QACP,yBAAyB,EAAE,iBAAiB,KAAK;AAAA,MACnD;AACA,eAAS;AAAA,QACP,qBAAqB,KAAK,CAAC,yDACC,OAAO,KAAK,CAAC,KAAK,KAAK;AAAA,MACrD;AACA,YAAM;AAAA,IACR;AAAA,EACF;AAEA,WAAS,KAAK,QAAQ;AACtB,qCAAc,YAAY,SAAS,KAAK,IAAI,GAAG,OAAO;AACxD;AAMO,SAAS,SACd,GACA,aACA,YACA,0BACA,eACM;AACN,QAAM,eAAe,aAAa,WAAW;AAC7C,QAAM,UAAU,4BAA4B,gBAAgB,wBAAwB,IAChF,2BACA;AACJ,QAAM,kBAAkB,yBAAyB,wBAAwB;AACzE,QAAM,wBAAwB,SAAS,iBAAiB;AACxD,QAAM,gBAAgB,CAAC,KAAK,KAAK,KAAK,KAAK,KAAK,GAAG;AAEnD,WAAS,SAAS,OAAuB;AACvC,WAAO,MACJ,QAAQ,SAAS,GAAG,EACpB,QAAQ,OAAO,GAAG,EAClB,QAAQ,OAAO,GAAG,EAClB,QAAQ,sBAAsB,EAAE,EAChC,KAAK,KAAK;AAAA,EACf;AAGA,MAAI;AACJ,MAAI,CAAC,uBAAuB;AAC1B,kBAAc,oBAAI,IAAoB;AACtC,UAAM,YAAY,oBAAI,IAAoB;AAC1C,MAAE,YAAY,CAAC,QAAQ,SAAS;AAC9B,YAAM,OAAO,SAAU,KAAK,SAAoB,MAAM;AACtD,YAAM,QAAQ,UAAU,IAAI,IAAI;AAChC,UAAI,UAAU,QAAW;AACvB,cAAM,OAAO,QAAQ;AACrB,kBAAU,IAAI,MAAM,IAAI;AACxB,oBAAY,IAAI,QAAQ,GAAG,IAAI,IAAI,IAAI,EAAE;AAAA,MAC3C,OAAO;AACL,kBAAU,IAAI,MAAM,CAAC;AACrB,oBAAY,IAAI,QAAQ,IAAI;AAAA,MAC9B;AAAA,IACF,CAAC;AAAA,EACH,OAAO;AACL,kBAAc,YAAY,qBAAqB;AAAA,EACjD;AAEA,QAAM,iBAAiB,aAAa;AACpC,QAAM,OAAO,iBAAiB,IAAI,KAAK,KAAK,KAAK,KAAK,cAAc,CAAC,IAAI;AACzE,QAAM,OAAO,iBAAiB,IAAI,KAAK,KAAK,iBAAiB,IAAI,IAAI;AAErE,QAAM,cAAyC,CAAC;AAChD,QAAM,cAAyC,CAAC;AAEhD,QAAM,aAAa,CAAC,GAAG,aAAa,KAAK,CAAC,EAAE,KAAK,CAAC,GAAG,MAAM,IAAI,CAAC;AAGhE,QAAM,aAAa,oBAAI,IAA8B;AACrD,aAAW,OAAO,YAAY;AAC5B,UAAM,UAAU,aAAa,IAAI,GAAG,KAAK,CAAC;AAC1C,UAAM,cAAc,QAAQ;AAC5B,UAAM,IAAI,KAAK,IAAI,KAAK,cAAc,IAAI,MAAM,KAAK,KAAK,KAAK,KAAK,WAAW,CAAC,IAAI,GAAG;AACvF,UAAM,IAAI,KAAK,IAAI,KAAK,cAAc,IAAI,MAAM,KAAK,KAAK,cAAc,CAAC,IAAI,MAAM,GAAG;AACtF,eAAW,IAAI,KAAK,CAAC,GAAG,CAAC,CAAC;AAAA,EAC5B;AAGA,QAAM,MAAM;AACZ,QAAM,YAAsB,CAAC;AAC7B,WAAS,SAAS,GAAG,SAAS,MAAM,UAAU;AAC5C,QAAI,OAAO;AACX,aAAS,SAAS,GAAG,SAAS,MAAM,UAAU;AAC5C,YAAM,SAAS,SAAS,OAAO;AAC/B,UAAI,SAAS,WAAW,QAAQ;AAC9B,cAAM,MAAM,WAAW,MAAM;AAC7B,cAAM,CAAC,CAAC,IAAI,WAAW,IAAI,GAAG,KAAK,CAAC,KAAK,GAAG;AAC5C,eAAO,KAAK,IAAI,MAAM,CAAC;AAAA,MACzB;AAAA,IACF;AACA,cAAU,KAAK,IAAI;AAAA,EACrB;AAEA,QAAM,aAAuB,CAAC;AAC9B,WAAS,SAAS,GAAG,SAAS,MAAM,UAAU;AAC5C,QAAI,OAAO;AACX,aAAS,SAAS,GAAG,SAAS,MAAM,UAAU;AAC5C,YAAM,SAAS,SAAS,OAAO;AAC/B,UAAI,SAAS,WAAW,QAAQ;AAC9B,cAAM,MAAM,WAAW,MAAM;AAC7B,cAAM,CAAC,EAAE,CAAC,IAAI,WAAW,IAAI,GAAG,KAAK,CAAC,KAAK,GAAG;AAC9C,eAAO,KAAK,IAAI,MAAM,CAAC;AAAA,MACzB;AAAA,IACF;AACA,eAAW,KAAK,IAAI;AAAA,EACtB;AAGA,QAAM,cAAc,oBAAI,IAA8C;AACtE,WAAS,MAAM,GAAG,MAAM,WAAW,QAAQ,OAAO;AAChD,UAAM,MAAM,WAAW,GAAG;AAC1B,UAAM,SAAS,MAAM;AACrB,UAAM,SAAS,KAAK,MAAM,MAAM,IAAI;AACpC,UAAM,KAAK,UAAU,MAAM,GAAG,MAAM,EAAE,OAAO,CAAC,GAAG,MAAM,IAAI,GAAG,CAAC,IAAI,SAAS;AAC5E,UAAM,KAAK,WAAW,MAAM,GAAG,MAAM,EAAE,OAAO,CAAC,GAAG,MAAM,IAAI,GAAG,CAAC,IAAI,SAAS;AAC7E,UAAM,CAAC,IAAI,EAAE,IAAI,WAAW,IAAI,GAAG,KAAK,CAAC,KAAK,GAAG;AACjD,gBAAY,IAAI,KAAK,CAAC,IAAI,IAAI,IAAI,EAAE,CAAC;AAAA,EACvC;AAGA,QAAM,mBAAmB,oBAAI,IAAY;AACzC,aAAW,WAAW,aAAa,OAAO,GAAG;AAC3C,eAAW,KAAK,QAAS,kBAAiB,IAAI,CAAC;AAAA,EACjD;AAGA,WAAS,MAAM,GAAG,MAAM,WAAW,QAAQ,OAAO;AAChD,UAAM,MAAM,WAAW,GAAG;AAC1B,UAAM,UAAU,aAAa,IAAI,GAAG,KAAK,CAAC;AAC1C,UAAMC,iBAAgB,iBAAiB,IAAI,GAAG,KAAK,aAAa,GAAG;AACnE,UAAM,CAAC,IAAI,IAAI,IAAI,EAAE,IAAI,YAAY,IAAI,GAAG,KAAK,CAAC,GAAG,GAAG,KAAK,GAAG;AAChE,UAAM,cAAc,cAAc,MAAM,cAAc,MAAM;AAG5D,gBAAY,KAAK;AAAA,MACf,IAAI,IAAI,GAAG;AAAA,MACX,MAAM;AAAA,MACN,OAAOA;AAAA,MACP,GAAG;AAAA,MACH,GAAG;AAAA,MACH,OAAO;AAAA,MACP,QAAQ;AAAA,MACR,OAAO;AAAA,IACT,CAAC;AAGD,UAAM,gBAAgB,CAAC,GAAG,OAAO,EAAE,KAAK,CAAC,GAAG,MAAM;AAChD,YAAM,KAAM,EAAE,iBAAiB,GAAG,OAAO,KAAgB;AACzD,YAAM,KAAM,EAAE,iBAAiB,GAAG,OAAO,KAAgB;AACzD,aAAO,GAAG,cAAc,EAAE;AAAA,IAC5B,CAAC;AACD,aAAS,OAAO,GAAG,OAAO,cAAc,QAAQ,QAAQ;AACtD,YAAM,SAAS,cAAc,IAAI;AACjC,YAAM,MAAM,OAAO;AACnB,YAAM,MAAM,KAAK,MAAM,OAAO,CAAC;AAC/B,YAAM,KAAK,KAAK,KAAK,OAAO,MAAM;AAClC,YAAM,KAAK,KAAK,KAAK,OAAO,KAAK;AACjC,YAAM,QACJ,YAAY,IAAI,MAAM,KACtB,SAAU,EAAE,iBAAiB,QAAQ,OAAO,KAAgB,MAAM;AACpE,kBAAY,KAAK;AAAA,QACf,IAAI,KAAK,MAAM;AAAA,QACf,MAAM;AAAA,QACN,MAAM,qBAAqB,KAAK;AAAA,QAChC,GAAG;AAAA,QACH,GAAG;AAAA,QACH,OAAO;AAAA,QACP,QAAQ;AAAA,MACV,CAAC;AAAA,IACH;AAAA,EACF;AAGA,QAAM,mBAAuD,CAAC;AAC9D,IAAE,YAAY,CAAC,OAAO,OAAO,GAAG,MAAM;AACpC,QAAI,iBAAiB,IAAI,CAAC,KAAK,iBAAiB,IAAI,CAAC,GAAG;AACtD,YAAM,SAAU,MAAM,UAAqB;AAC3C,YAAM,WAAY,MAAM,YAAuB;AAC/C,YAAM,OAAQ,MAAM,cAAyB;AAC7C,YAAM,QAAQ,WAAW,GAAG,QAAQ,KAAK,IAAI,MAAM,IAAI,IAAI;AAC3D,uBAAiB,KAAK,CAAC,QAAQ,GAAG,GAAG,KAAK,CAAC;AAAA,IAC7C;AAAA,EACF,CAAC;AAED,mBAAiB,KAAK,CAAC,GAAG,MAAM,EAAE,CAAC,IAAI,EAAE,CAAC,CAAC;AAC3C,aAAW,CAAC,EAAE,GAAG,GAAG,KAAK,KAAK,iBAAiB,MAAM,GAAG,GAAG,GAAG;AAC5D,gBAAY,KAAK;AAAA,MACf,IAAI,KAAK,CAAC,IAAI,CAAC;AAAA,MACf,UAAU,KAAK,CAAC;AAAA,MAChB,QAAQ,KAAK,CAAC;AAAA,MACd;AAAA,IACF,CAAC;AAAA,EACH;AAEA,QAAM,aAAa,EAAE,OAAO,aAAa,OAAO,YAAY;AAC5D,qCAAc,YAAY,KAAK,UAAU,YAAY,MAAM,CAAC,GAAG,OAAO;AACxE;AArhCA,IAGAC,iBAgBM,kBAKA,mBAEA;AA1BN;AAAA;AAGA,IAAAA,kBAA8B;AAE9B;AACA;AAEA;AAWA,IAAM,mBAAmB;AAAA,MACvB;AAAA,MAAW;AAAA,MAAW;AAAA,MAAW;AAAA,MAAW;AAAA,MAC5C;AAAA,MAAW;AAAA,MAAW;AAAA,MAAW;AAAA,MAAW;AAAA,IAC9C;AAEA,IAAM,oBAAoB;AAE1B,IAAM,4BAAoD;AAAA,MACxD,WAAW;AAAA,MACX,UAAU;AAAA,MACV,WAAW;AAAA,IACb;AAAA;AAAA;;;ACvBA,SAAS,YAAY,SAAyB;AAC5C,QAAM,OAAO,QAAQ,SAAS,OAAO;AACrC,MAAI,CAAC,KAAK,WAAW,KAAK,GAAG;AAC3B,WAAO;AAAA,EACT;AACA,QAAM,MAAM,KAAK,QAAQ,SAAS,CAAC;AACnC,MAAI,QAAQ,IAAI;AACd,WAAO;AAAA,EACT;AACA,SAAO,OAAO,KAAK,KAAK,MAAM,MAAM,CAAC,GAAG,OAAO;AACjD;AAQO,SAAS,SAAS,UAA0B;AACjD,QAAM,UAAM,8BAAa,QAAQ;AACjC,QAAM,cAAU,2BAAQ,QAAQ,EAAE,YAAY,MAAM,QAAQ,YAAY,GAAG,IAAI;AAC/E,QAAM,eAAW,2BAAQ,QAAQ;AACjC,QAAM,QAAI,gCAAW,QAAQ;AAC7B,IAAE,OAAO,OAAO;AAChB,IAAE,OAAO,IAAI;AACb,IAAE,OAAO,QAAQ;AACjB,SAAO,EAAE,OAAO,KAAK;AACvB;AAGO,SAAS,SAAS,OAAe,KAAa;AACnD,QAAM,QAAI,wBAAK,MAAM,gBAAgB,OAAO;AAC5C,iCAAU,GAAG,EAAE,WAAW,KAAK,CAAC;AAChC,SAAO;AACT;AAKO,SAAS,WAAW,UAAkB,OAAe,KAAqC;AAC/F,MAAI;AACJ,MAAI;AACF,QAAI,SAAS,QAAQ;AAAA,EACvB,QAAQ;AACN,WAAO;AAAA,EACT;AACA,QAAM,YAAQ,wBAAK,SAAS,IAAI,GAAG,GAAG,CAAC,OAAO;AAC9C,MAAI,KAAC,4BAAW,KAAK,EAAG,QAAO;AAC/B,MAAI;AACF,WAAO,KAAK,UAAM,8BAAa,OAAO,OAAO,CAAC;AAAA,EAChD,QAAQ;AACN,WAAO;AAAA,EACT;AACF;AAGO,SAAS,WAAW,UAAkB,QAAiC,OAAe,KAAW;AACtG,QAAM,IAAI,SAAS,QAAQ;AAC3B,QAAM,YAAQ,wBAAK,SAAS,IAAI,GAAG,GAAG,CAAC,OAAO;AAC9C,QAAM,MAAM,QAAQ;AACpB,MAAI;AACF,uCAAc,KAAK,KAAK,UAAU,MAAM,CAAC;AACzC,oCAAW,KAAK,KAAK;AAAA,EACvB,QAAQ;AACN,QAAI;AAAE,sCAAW,GAAG;AAAA,IAAG,QAAQ;AAAA,IAAe;AAC9C,UAAM,IAAI,MAAM,4BAA4B,QAAQ,EAAE;AAAA,EACxD;AACF;AAsCO,SAAS,mBACd,OACA,OAAe,KAC6F;AAC5G,QAAM,cAA8C,CAAC;AACrD,QAAM,cAA8C,CAAC;AACrD,QAAM,mBAAmD,CAAC;AAC1D,QAAM,WAAqB,CAAC;AAE5B,aAAW,SAAS,OAAO;AACzB,UAAM,SAAS,WAAW,OAAO,IAAI;AACrC,QAAI,WAAW,MAAM;AACnB,YAAM,IAAI;AACV,kBAAY,KAAK,GAAI,EAAE,SAAS,CAAC,CAAE;AACnC,kBAAY,KAAK,GAAI,EAAE,SAAS,CAAC,CAAE;AACnC,uBAAiB,KAAK,GAAI,EAAE,cAAc,CAAC,CAAE;AAAA,IAC/C,OAAO;AACL,eAAS,KAAK,KAAK;AAAA,IACrB;AAAA,EACF;AAEA,SAAO,CAAC,aAAa,aAAa,kBAAkB,QAAQ;AAC9D;AAMO,SAAS,kBACd,OACA,OACA,aAAoD,MACpD,OAAe,KACP;AACR,QAAM,SAAS,oBAAI,IAA4B;AAE/C,aAAW,KAAK,OAAO;AACrB,UAAM,MAAO,EAAE,eAA0B;AACzC,QAAI,CAAC,IAAK;AACV,QAAI,CAAC,OAAO,IAAI,GAAG,EAAG,QAAO,IAAI,KAAK,EAAE,OAAO,CAAC,GAAG,OAAO,CAAC,GAAG,YAAY,CAAC,EAAE,CAAC;AAC9E,WAAO,IAAI,GAAG,EAAG,MAAM,KAAK,CAAC;AAAA,EAC/B;AACA,aAAW,KAAK,OAAO;AACrB,UAAM,MAAO,EAAE,eAA0B;AACzC,QAAI,CAAC,IAAK;AACV,QAAI,CAAC,OAAO,IAAI,GAAG,EAAG,QAAO,IAAI,KAAK,EAAE,OAAO,CAAC,GAAG,OAAO,CAAC,GAAG,YAAY,CAAC,EAAE,CAAC;AAC9E,WAAO,IAAI,GAAG,EAAG,MAAM,KAAK,CAAC;AAAA,EAC/B;AACA,aAAW,KAAK,cAAc,CAAC,GAAG;AAChC,UAAM,MAAO,EAAE,eAA0B;AACzC,QAAI,CAAC,IAAK;AACV,QAAI,CAAC,OAAO,IAAI,GAAG,EAAG,QAAO,IAAI,KAAK,EAAE,OAAO,CAAC,GAAG,OAAO,CAAC,GAAG,YAAY,CAAC,EAAE,CAAC;AAC9E,WAAO,IAAI,GAAG,EAAG,WAAW,KAAK,CAAC;AAAA,EACpC;AAEA,MAAI,QAAQ;AACZ,aAAW,CAAC,OAAO,MAAM,KAAK,QAAQ;AACpC,UAAM,QAAI,2BAAQ,MAAM,KAAK;AAC7B,YAAI,4BAAW,CAAC,GAAG;AACjB,iBAAW,GAAG,QAA8C,IAAI;AAChE;AAAA,IACF;AAAA,EACF;AACA,SAAO;AACT;AAhLA,IAGAC,qBACAC,iBACAC;AALA;AAAA;AAGA,IAAAF,sBAA2B;AAC3B,IAAAC,kBAAwG;AACxG,IAAAC,oBAAuC;AAAA;AAAA;;;ACLvC;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAgCA,SAAS,mBAAmC;AAC1C,MAAI;AACF,eAAO,kCAAc,YAAY,GAAG;AAAA,EACtC,QAAQ;AACN,WAAO;AAAA,EACT;AACF;AAIA,eAAe,mBAAkC;AAC/C,MAAI,CAAC,oBAAoB;AACvB,UAAMC,QAAO,KAAK;AAClB,yBAAqB;AAAA,EACvB;AACF;AAEA,SAAS,UAAU,QAAqC,QAAsB;AAC5E,QAAM,OAAO,OAAO,MAAM,MAAM;AAChC,MAAI,CAAC,MAAM;AACT,UAAM,IAAI,MAAM,sBAAsB;AAAA,EACxC;AACA,SAAO;AACT;AAGA,SAAS,mBAAmB,UAAiC;AAC3D,QAAM,eAAc,oBAAI,IAAoB;AAAA,IAC1C,CAAC,WAAW,SAAS;AAAA,EACvB,CAAC,GAAE,IAAI,QAAQ,KAAK;AAEpB,QAAM,aAAa;AAAA,IACjB,eAAe,WAAW,gBAAgB,QAAQ;AAAA,IAClD,eAAe,WAAW,gBAAgB,WAAW;AAAA,IACrD,eAAe,WAAW,gBAAgB,QAAQ;AAAA,IAClD,eAAe,WAAW,gBAAgB,YAAY,QAAQ,MAAM,GAAG,CAAC;AAAA,IACxE,eAAe,WAAW,IAAI,QAAQ;AAAA,IACtC,eAAe,WAAW,IAAI,WAAW;AAAA,EAC3C;AACA,aAAW,aAAa,YAAY;AAClC,QAAI;AACF,YAAM,WAAW,cAAc,QAAQ,SAAS;AAChD,cAAI,4BAAW,QAAQ,EAAG,QAAO;AAAA,IACnC,QAAQ;AAAA,IAER;AAAA,EACF;AAEA,QAAM,YAAQ,wBAAK,QAAQ,IAAI,GAAG,cAAc;AAChD,aAAW,aAAa,YAAY;AAClC,UAAM,QAAI,wBAAK,OAAO,SAAS;AAC/B,YAAI,4BAAW,CAAC,EAAG,QAAO;AAAA,EAC5B;AACA,SAAO;AACT;AAQA,eAAe,aAAa,UAAuD;AACjF,MAAI,eAAe,IAAI,QAAQ,EAAG,QAAO,eAAe,IAAI,QAAQ;AACpE,QAAM,WAAW,mBAAmB,QAAQ;AAC5C,MAAI,CAAC,SAAU,QAAO;AACtB,MAAI;AACF,UAAM,OAAO,MAAiB,oBAAS,KAAK,QAAQ;AACpD,mBAAe,IAAI,UAAU,IAAI;AACjC,WAAO;AAAA,EACT,QAAQ;AACN,WAAO;AAAA,EACT;AACF;AAGA,SAAS,WAAW,OAAyB;AAC3C,QAAM,WAAW,MACd,OAAO,OAAO,EACd,IAAI,CAAC,MAAM,EAAE,QAAQ,kBAAkB,EAAE,CAAC,EAC1C,KAAK,GAAG;AACX,QAAM,UAAU,SAAS,QAAQ,kBAAkB,GAAG;AACtD,SAAO,QAAQ,QAAQ,YAAY,EAAE,EAAE,YAAY;AACrD;AAEA,SAAS,UAAU,MAAkB,QAAwB;AAC3D,SAAO,OAAO,MAAM,KAAK,YAAY,KAAK,QAAQ;AACpD;AA8DA,SAAS,cAAc,WAAyG;AAC9H,SAAO;AAAA,IACL,YAAY,oBAAI,IAAI;AAAA,IACpB,eAAe,oBAAI,IAAI;AAAA,IACvB,aAAa,oBAAI,IAAI;AAAA,IACrB,WAAW,oBAAI,IAAI;AAAA,IACnB,WAAW;AAAA,IACX,wBAAwB,CAAC;AAAA,IACzB,WAAW;AAAA,IACX,wBAAwB,CAAC;AAAA,IACzB,mBAAmB;AAAA,IACnB,uBAAuB,oBAAI,IAAI;AAAA,IAC/B,mBAAmB;AAAA,IACnB,uBAAuB,oBAAI,IAAI;AAAA,IAC/B,eAAe;AAAA,IACf,uBAAuB;AAAA,IACvB,qBAAqB;AAAA,IACrB,aAAa;AAAA,IACb,GAAG;AAAA,EACL;AACF;AAoBA,SAAS,UAAU,MAAkB,QAA2C;AAC9E,QAAM,IAAI,KAAK,kBAAkB,OAAO,SAAS;AACjD,MAAI,EAAG,QAAO;AACd,aAAW,SAAS,KAAK,UAAU;AACjC,QAAI,OAAO,uBAAuB,SAAS,MAAM,IAAI,GAAG;AACtD,aAAO;AAAA,IACT;AAAA,EACF;AACA,SAAO;AACT;AAMA,SAAS,cACP,MAAkB,QAAgB,SAAiB,OACnD,OAAoB,SACd;AACN,QAAM,IAAI,KAAK;AACf,MAAI,MAAM,oBAAoB;AAC5B,eAAW,SAAS,KAAK,UAAU;AACjC,UAAI,MAAM,SAAS,iBAAiB,MAAM,SAAS,kBAAkB;AACnE,cAAM,MAAM,UAAU,OAAO,MAAM;AACnC,cAAM,aAAa,IAAI,MAAM,MAAM,EAAE,CAAC,EAAG,KAAK,EAAE,QAAQ,QAAQ,EAAE;AAClE,cAAM,SAAS,QAAQ,UAAU;AACjC,cAAM,KAAK;AAAA,UACT,QAAQ;AAAA,UAAS,QAAQ;AAAA,UAAQ,UAAU;AAAA,UAC3C,YAAY;AAAA,UAAa,aAAa;AAAA,UACtC,iBAAiB,IAAI,KAAK,cAAc,MAAM,CAAC;AAAA,UAAI,QAAQ;AAAA,QAC7D,CAAC;AAAA,MACH;AAAA,IACF;AAAA,EACF,WAAW,MAAM,yBAAyB;AACxC,UAAM,aAAa,KAAK,kBAAkB,aAAa;AACvD,QAAI,YAAY;AACd,YAAM,MAAM,UAAU,YAAY,MAAM,EAAE,QAAQ,QAAQ,EAAE;AAC5D,YAAM,SAAS,QAAQ,GAAG;AAC1B,YAAM,KAAK;AAAA,QACT,QAAQ;AAAA,QAAS,QAAQ;AAAA,QAAQ,UAAU;AAAA,QAC3C,YAAY;AAAA,QAAa,aAAa;AAAA,QACtC,iBAAiB,IAAI,KAAK,cAAc,MAAM,CAAC;AAAA,QAAI,QAAQ;AAAA,MAC7D,CAAC;AAAA,IACH;AAAA,EACF;AACF;AAEA,SAAS,UACP,MAAkB,QAAgB,SAAiB,OACnD,OAAoB,SACd;AACN,aAAW,SAAS,KAAK,UAAU;AACjC,QAAI,MAAM,SAAS,UAAU;AAC3B,YAAM,MAAM,UAAU,OAAO,MAAM,EAAE,QAAQ,wBAAwB,EAAE;AACvE,YAAM,aAAa,IAAI,QAAQ,iBAAiB,EAAE,EAAE,MAAM,GAAG,EAAE,IAAI,KAAK;AACxE,UAAI,YAAY;AACd,cAAM,SAAS,QAAQ,UAAU;AACjC,cAAM,KAAK;AAAA,UACT,QAAQ;AAAA,UAAS,QAAQ;AAAA,UAAQ,UAAU;AAAA,UAC3C,YAAY;AAAA,UAAa,aAAa;AAAA,UACtC,iBAAiB,IAAI,KAAK,cAAc,MAAM,CAAC;AAAA,UAAI,QAAQ;AAAA,QAC7D,CAAC;AAAA,MACH;AACA;AAAA,IACF;AAAA,EACF;AACF;AAEA,SAAS,YACP,MAAkB,QAAgB,SAAiB,OACnD,OAAoB,SACd;AACN,WAAS,WAAW,GAAuB;AACzC,UAAM,QAAkB,CAAC;AACzB,QAAI,MAAyB;AAC7B,WAAO,KAAK;AACV,UAAI,IAAI,SAAS,qBAAqB;AACpC,cAAM,WAAW,IAAI,kBAAkB,MAAM;AAC7C,YAAI,SAAU,OAAM,KAAK,UAAU,UAAU,MAAM,CAAC;AACpD,cAAM,IAAI,kBAAkB,OAAO;AAAA,MACrC,WAAW,IAAI,SAAS,cAAc;AACpC,cAAM,KAAK,UAAU,KAAK,MAAM,CAAC;AACjC;AAAA,MACF,OAAO;AACL;AAAA,MACF;AAAA,IACF;AACA,UAAM,QAAQ;AACd,WAAO,MAAM,KAAK,GAAG;AAAA,EACvB;AAEA,aAAW,SAAS,KAAK,UAAU;AACjC,QAAI,MAAM,SAAS,uBAAuB,MAAM,SAAS,cAAc;AACrE,YAAM,UAAU,WAAW,KAAK;AAChC,YAAM,YAAY,QAAQ,MAAM,GAAG;AACnC,UAAI,aAAa,UAAU,UAAU,SAAS,CAAC,EAAG,QAAQ,OAAO,EAAE,EAAE,QAAQ,QAAQ,EAAE,EAAE,KAAK;AAC9F,UAAI,CAAC,cAAc,UAAU,SAAS,GAAG;AACvC,qBAAa,UAAU,UAAU,SAAS,CAAC;AAAA,MAC7C;AACA,UAAI,CAAC,WAAY,cAAa;AAC9B,UAAI,YAAY;AACd,cAAM,SAAS,QAAQ,UAAU;AACjC,cAAM,KAAK;AAAA,UACT,QAAQ;AAAA,UAAS,QAAQ;AAAA,UAAQ,UAAU;AAAA,UAC3C,YAAY;AAAA,UAAa,aAAa;AAAA,UACtC,iBAAiB,IAAI,KAAK,cAAc,MAAM,CAAC;AAAA,UAAI,QAAQ;AAAA,QAC7D,CAAC;AAAA,MACH;AACA;AAAA,IACF;AAAA,EACF;AACF;AAEA,SAAS,SACP,MAAkB,QAAgB,SAAiB,OACnD,OAAoB,SACd;AACN,aAAW,SAAS,KAAK,UAAU;AACjC,QAAI,CAAC,kBAAkB,qBAAqB,QAAQ,EAAE,SAAS,MAAM,IAAI,GAAG;AAC1E,YAAM,MAAM,UAAU,OAAO,MAAM,EAAE,QAAQ,wBAAwB,EAAE;AACvE,YAAM,aAAa,IAAI,MAAM,GAAG,EAAE,IAAI,EAAG,MAAM,GAAG,EAAE,CAAC;AACrD,UAAI,YAAY;AACd,cAAM,SAAS,QAAQ,UAAU;AACjC,cAAM,KAAK;AAAA,UACT,QAAQ;AAAA,UAAS,QAAQ;AAAA,UAAQ,UAAU;AAAA,UAC3C,YAAY;AAAA,UAAa,aAAa;AAAA,UACtC,iBAAiB,IAAI,KAAK,cAAc,MAAM,CAAC;AAAA,UAAI,QAAQ;AAAA,QAC7D,CAAC;AAAA,MACH;AACA;AAAA,IACF;AAAA,EACF;AACF;AAEA,SAAS,cACP,MAAkB,QAAgB,SAAiB,OACnD,OAAoB,SACd;AACN,aAAW,SAAS,KAAK,UAAU;AACjC,QAAI,CAAC,kBAAkB,cAAc,aAAa,EAAE,SAAS,MAAM,IAAI,GAAG;AACxE,YAAM,MAAM,UAAU,OAAO,MAAM;AACnC,YAAM,aAAa,IAAI,MAAM,GAAG,EAAE,IAAI,EAAG,KAAK;AAC9C,UAAI,YAAY;AACd,cAAM,SAAS,QAAQ,UAAU;AACjC,cAAM,KAAK;AAAA,UACT,QAAQ;AAAA,UAAS,QAAQ;AAAA,UAAQ,UAAU;AAAA,UAC3C,YAAY;AAAA,UAAa,aAAa;AAAA,UACtC,iBAAiB,IAAI,KAAK,cAAc,MAAM,CAAC;AAAA,UAAI,QAAQ;AAAA,QAC7D,CAAC;AAAA,MACH;AACA;AAAA,IACF;AAAA,EACF;AACF;AAEA,SAAS,cACP,MAAkB,QAAgB,SAAiB,OACnD,OAAoB,SACd;AACN,QAAM,WAAW,KAAK,kBAAkB,MAAM;AAC9C,MAAI,UAAU;AACZ,UAAM,MAAM,UAAU,UAAU,MAAM;AACtC,UAAM,aAAa,IAAI,MAAM,GAAG,EAAE,IAAI,EAAG,KAAK;AAC9C,QAAI,YAAY;AACd,YAAM,SAAS,QAAQ,UAAU;AACjC,YAAM,KAAK;AAAA,QACT,QAAQ;AAAA,QAAS,QAAQ;AAAA,QAAQ,UAAU;AAAA,QAC3C,YAAY;AAAA,QAAa,aAAa;AAAA,QACtC,iBAAiB,IAAI,KAAK,cAAc,MAAM,CAAC;AAAA,QAAI,QAAQ;AAAA,MAC7D,CAAC;AAAA,IACH;AACA;AAAA,EACF;AAEA,aAAW,SAAS,KAAK,UAAU;AACjC,QAAI,MAAM,SAAS,cAAc;AAC/B,YAAM,MAAM,UAAU,OAAO,MAAM;AACnC,YAAM,SAAS,QAAQ,GAAG;AAC1B,YAAM,KAAK;AAAA,QACT,QAAQ;AAAA,QAAS,QAAQ;AAAA,QAAQ,UAAU;AAAA,QAC3C,YAAY;AAAA,QAAa,aAAa;AAAA,QACtC,iBAAiB,IAAI,KAAK,cAAc,MAAM,CAAC;AAAA,QAAI,QAAQ;AAAA,MAC7D,CAAC;AACD;AAAA,IACF;AAAA,EACF;AACF;AAEA,SAAS,aACP,MAAkB,QAAgB,SAAiB,OACnD,OAAoB,SACd;AACN,aAAW,SAAS,KAAK,UAAU;AACjC,QAAI,MAAM,SAAS,eAAe,MAAM,SAAS,cAAc;AAC7D,YAAM,MAAM,UAAU,OAAO,MAAM;AACnC,YAAM,aAAa,IAAI,MAAM,GAAG,EAAE,IAAI,EAAG,QAAQ,WAAW,EAAE,EAAE,KAAK;AACrE,UAAI,cAAc,eAAe,KAAK;AACpC,cAAM,SAAS,QAAQ,UAAU;AACjC,cAAM,KAAK;AAAA,UACT,QAAQ;AAAA,UAAS,QAAQ;AAAA,UAAQ,UAAU;AAAA,UAC3C,YAAY;AAAA,UAAa,aAAa;AAAA,UACtC,iBAAiB,IAAI,KAAK,cAAc,MAAM,CAAC;AAAA,UAAI,QAAQ;AAAA,QAC7D,CAAC;AAAA,MACH;AACA;AAAA,IACF;AAAA,EACF;AACF;AAEA,SAAS,WACP,MAAkB,QAAgB,SAAiB,OACnD,OAAoB,SACd;AACN,aAAW,SAAS,KAAK,UAAU;AACjC,QAAI,CAAC,kBAAkB,QAAQ,YAAY,EAAE,SAAS,MAAM,IAAI,GAAG;AACjE,YAAM,MAAM,UAAU,OAAO,MAAM;AACnC,YAAM,aAAa,IAAI,MAAM,IAAI,EAAE,IAAI,EAAG,KAAK;AAC/C,UAAI,YAAY;AACd,cAAM,SAAS,QAAQ,UAAU;AACjC,cAAM,KAAK;AAAA,UACT,QAAQ;AAAA,UAAS,QAAQ;AAAA,UAAQ,UAAU;AAAA,UAC3C,YAAY;AAAA,UAAa,aAAa;AAAA,UACtC,iBAAiB,IAAI,KAAK,cAAc,MAAM,CAAC;AAAA,UAAI,QAAQ;AAAA,QAC7D,CAAC;AAAA,MACH;AACA;AAAA,IACF;AAAA,EACF;AACF;AAEA,SAAS,WACP,MAAkB,QAAgB,SAAiB,OACnD,OAAoB,SACd;AACN,QAAM,OAAO,UAAU,MAAM,MAAM;AACnC,QAAM,IAAI,KAAK,MAAM,qCAAqC;AAC1D,MAAI,GAAG;AACL,UAAM,aAAa,EAAE,CAAC,EAAG,MAAM,GAAG,EAAE,IAAI;AACxC,QAAI,YAAY;AACd,YAAM,KAAK;AAAA,QACT,QAAQ;AAAA,QAAS,QAAQ;AAAA,QAAY,UAAU;AAAA,QAC/C,YAAY;AAAA,QAAa,aAAa;AAAA,QACtC,iBAAiB,OAAO,KAAK,cAAc,MAAM,CAAC;AAAA,QAAG,QAAQ;AAAA,MAC/D,CAAC;AAAA,IACH;AAAA,EACF;AACF;AAEA,SAAS,aACP,MAAkB,QAAgB,SAAiB,OACnD,OAAoB,SACd;AACN,aAAW,SAAS,KAAK,UAAU;AACjC,QAAI,MAAM,SAAS,cAAc;AAC/B,YAAM,MAAM,UAAU,OAAO,MAAM;AACnC,YAAM,SAAS,QAAQ,GAAG;AAC1B,YAAM,KAAK;AAAA,QACT,QAAQ;AAAA,QAAS,QAAQ;AAAA,QAAQ,UAAU;AAAA,QAC3C,YAAY;AAAA,QAAa,aAAa;AAAA,QACtC,iBAAiB,IAAI,KAAK,cAAc,MAAM,CAAC;AAAA,QAAI,QAAQ;AAAA,MAC7D,CAAC;AACD;AAAA,IACF;AAAA,EACF;AACF;AAMA,SAAS,cAAc,MAAkB,QAA+B;AACtE,MAAI,KAAK,SAAS,aAAc,QAAO,UAAU,MAAM,MAAM;AAC7D,QAAM,OAAO,KAAK,kBAAkB,YAAY;AAChD,MAAI,KAAM,QAAO,cAAc,MAAM,MAAM;AAC3C,aAAW,SAAS,KAAK,UAAU;AACjC,QAAI,MAAM,SAAS,aAAc,QAAO,UAAU,OAAO,MAAM;AAAA,EACjE;AACA,SAAO;AACT;AAEA,SAAS,gBAAgB,MAAkB,QAA+B;AACxE,MAAI,KAAK,SAAS,aAAc,QAAO,UAAU,MAAM,MAAM;AAC7D,MAAI,KAAK,SAAS,wBAAwB;AACxC,UAAM,WAAW,KAAK,kBAAkB,MAAM;AAC9C,QAAI,SAAU,QAAO,UAAU,UAAU,MAAM;AAAA,EACjD;AACA,QAAM,OAAO,KAAK,kBAAkB,YAAY;AAChD,MAAI,KAAM,QAAO,gBAAgB,MAAM,MAAM;AAC7C,aAAW,SAAS,KAAK,UAAU;AACjC,QAAI,MAAM,SAAS,aAAc,QAAO,UAAU,OAAO,MAAM;AAAA,EACjE;AACA,SAAO;AACT;AAMA,SAAS,aACP,MAAkB,QAAgB,SAAiB,MAAc,UACjE,QAAqB,QAAqB,UAC1C,gBACA,iBACA,WACA,WACS;AACT,MAAI,KAAK,SAAS,uBAAuB;AACvC,eAAW,SAAS,KAAK,UAAU;AACjC,UAAI,MAAM,SAAS,uBAAuB;AACxC,cAAM,QAAQ,MAAM,kBAAkB,OAAO;AAC7C,YAAI,SAAS,MAAM,SAAS,kBAAkB;AAC5C,gBAAM,WAAW,MAAM,kBAAkB,MAAM;AAC/C,cAAI,UAAU;AACZ,kBAAM,WAAW,UAAU,UAAU,MAAM;AAC3C,kBAAM,OAAO,MAAM,cAAc,MAAM;AACvC,kBAAM,UAAU,QAAQ,MAAM,QAAQ;AACtC,sBAAU,SAAS,GAAG,QAAQ,MAAM,IAAI;AACxC,sBAAU,SAAS,SAAS,YAAY,IAAI;AAC5C,kBAAM,OAAO,MAAM,kBAAkB,MAAM;AAC3C,gBAAI,MAAM;AACR,6BAAe,KAAK,CAAC,SAAS,IAAI,CAAC;AAAA,YACrC;AAAA,UACF;AAAA,QACF;AAAA,MACF;AAAA,IACF;AACA,WAAO;AAAA,EACT;AACA,SAAO;AACT;AAMA,SAAS,iBACP,MAAkB,QAAgB,SAAiB,MAAc,UACjE,QAAqB,QAAqB,UAC1C,iBACA,gBACA,WACA,WACA,QACS;AACT,MAAI,KAAK,SAAS,yBAAyB;AACzC,UAAM,WAAW,KAAK,kBAAkB,MAAM;AAC9C,QAAI,UAAU;AACZ,YAAM,SAAS,UAAU,UAAU,MAAM;AACzC,YAAM,QAAQ,QAAQ,MAAM,MAAM;AAClC,YAAM,OAAO,KAAK,cAAc,MAAM;AACtC,gBAAU,OAAO,QAAQ,IAAI;AAC7B,gBAAU,SAAS,OAAO,YAAY,IAAI;AAAA,IAC5C;AACA,UAAM,OAAO,KAAK,kBAAkB,MAAM;AAC1C,QAAI,QAAQ,QAAQ;AAClB,iBAAW,SAAS,KAAK,UAAU;AACjC,eAAO,OAAO,cAAc;AAAA,MAC9B;AAAA,IACF;AACA,WAAO;AAAA,EACT;AACA,SAAO;AACT;AAMA,SAAS,gBACP,MAAkB,QAAgB,UAAkB,OAAe,UACnE,QAAqB,QAAqB,UAC1C,iBACA,gBACA,WACA,WACS;AACT,MAAI,KAAK,SAAS,gBAAgB,gBAAgB;AAChD,eAAW,SAAS,KAAK,UAAU;AACjC,UAAI,MAAM,SAAS,qBAAqB;AACtC,cAAM,WAAW,UAAU,OAAO,MAAM;AACxC,cAAM,UAAU,QAAQ,gBAAgB,QAAQ;AAChD,cAAM,OAAO,KAAK,cAAc,MAAM;AACtC,kBAAU,SAAS,UAAU,IAAI;AACjC,kBAAU,gBAAgB,SAAS,WAAW,IAAI;AAAA,MACpD;AAAA,IACF;AACA,WAAO;AAAA,EACT;AACA,SAAO;AACT;AAkNA,eAAe,gBAAgB,UAAkB,QAAmD;AAClG,QAAM,iBAAiB;AACvB,QAAM,OAAO,MAAM,aAAa,OAAO,aAAa;AACpD,MAAI,CAAC,MAAM;AACT,WAAO,EAAE,OAAO,CAAC,GAAG,OAAO,CAAC,GAAG,OAAO,yBAAyB,OAAO,aAAa,GAAG;AAAA,EACxF;AAEA,MAAI;AACJ,MAAI;AACJ,MAAI;AACF,UAAM,SAAS,IAAIA,QAAO;AAC1B,WAAO,YAAY,IAAI;AACvB,iBAAS,8BAAa,UAAU,OAAO;AACvC,WAAO,UAAU,QAAQ,MAAM;AAAA,EACjC,SAAS,GAAY;AACnB,WAAO,EAAE,OAAO,CAAC,GAAG,OAAO,CAAC,GAAG,OAAO,OAAO,CAAC,EAAE;AAAA,EAClD;AAEA,QAAM,OAAO,KAAK;AAClB,QAAM,WAAO,4BAAS,cAAU,2BAAQ,QAAQ,CAAC;AACjD,QAAM,UAAU;AAChB,QAAM,QAAqB,CAAC;AAC5B,QAAM,QAAqB,CAAC;AAC5B,QAAM,UAAU,oBAAI,IAAY;AAChC,QAAM,iBAA8C,CAAC;AAErD,WAAS,QAAQ,KAAa,OAAe,MAAoB;AAC/D,QAAI,CAAC,QAAQ,IAAI,GAAG,GAAG;AACrB,cAAQ,IAAI,GAAG;AACf,YAAM,KAAK;AAAA,QACT,IAAI;AAAA,QAAK;AAAA,QAAO,WAAW;AAAA,QAC3B,aAAa;AAAA,QAAS,iBAAiB,IAAI,IAAI;AAAA,MACjD,CAAC;AAAA,IACH;AAAA,EACF;AAEA,WAAS,QACP,KAAa,KAAa,UAAkB,MAC5C,aAAuC,aAAa,SAAiB,GAC/D;AACN,UAAM,KAAK;AAAA,MACT,QAAQ;AAAA,MAAK,QAAQ;AAAA,MAAK;AAAA,MAC1B;AAAA,MAAY,aAAa;AAAA,MACzB,iBAAiB,IAAI,IAAI;AAAA,MAAI;AAAA,IAC/B,CAAC;AAAA,EACH;AAEA,QAAM,UAAU,QAAQ,IAAI;AAC5B,UAAQ,aAAS,4BAAS,QAAQ,GAAG,CAAC;AAEtC,WAAS,KAAK,MAAkB,iBAAgC,MAAY;AAC1E,UAAM,IAAI,KAAK;AAGf,QAAI,OAAO,YAAY,IAAI,CAAC,GAAG;AAC7B,UAAI,OAAO,eAAe;AACxB,eAAO,cAAc,MAAM,QAAQ,SAAS,MAAM,OAAO,OAAO;AAAA,MAClE;AACA;AAAA,IACF;AAGA,QAAI,OAAO,WAAW,IAAI,CAAC,GAAG;AAC5B,UAAI,WAAW,KAAK,kBAAkB,OAAO,SAAS;AACtD,UAAI,CAAC,UAAU;AACb,mBAAW,SAAS,KAAK,UAAU;AACjC,cAAI,OAAO,uBAAuB,SAAS,MAAM,IAAI,GAAG;AACtD,uBAAW;AACX;AAAA,UACF;AAAA,QACF;AAAA,MACF;AACA,UAAI,CAAC,SAAU;AACf,YAAM,YAAY,UAAU,UAAU,MAAM;AAC5C,YAAM,WAAW,QAAQ,MAAM,SAAS;AACxC,YAAM,OAAO,KAAK,cAAc,MAAM;AACtC,cAAQ,UAAU,WAAW,IAAI;AACjC,cAAQ,SAAS,UAAU,YAAY,IAAI;AAG3C,UAAI,OAAO,aAAa,sBAAsB;AAC5C,cAAM,OAAO,KAAK,kBAAkB,cAAc;AAClD,YAAI,MAAM;AACR,qBAAW,OAAO,KAAK,UAAU;AAC/B,gBAAI,IAAI,SAAS,cAAc;AAC7B,oBAAM,OAAO,UAAU,KAAK,MAAM;AAClC,kBAAI,UAAU,QAAQ,MAAM,IAAI;AAChC,kBAAI,CAAC,QAAQ,IAAI,OAAO,GAAG;AACzB,0BAAU,QAAQ,IAAI;AACtB,oBAAI,CAAC,QAAQ,IAAI,OAAO,GAAG;AACzB,wBAAM,KAAK;AAAA,oBACT,IAAI;AAAA,oBAAS,OAAO;AAAA,oBAAM,WAAW;AAAA,oBACrC,aAAa;AAAA,oBAAI,iBAAiB;AAAA,kBACpC,CAAC;AACD,0BAAQ,IAAI,OAAO;AAAA,gBACrB;AAAA,cACF;AACA,sBAAQ,UAAU,SAAS,YAAY,IAAI;AAAA,YAC7C;AAAA,UACF;AAAA,QACF;AAAA,MACF;AAGA,UAAI,OAAO,aAAa,qBAAqB;AAC3C,mBAAW,SAAS,KAAK,UAAU;AACjC,cAAI,MAAM,SAAS,yBAAyB;AAC1C,uBAAW,OAAO,MAAM,UAAU;AAChC,kBAAI,IAAI,SAAS,eAAe,IAAI,SAAS,mBAAmB;AAC9D,sBAAM,OAAO,UAAU,KAAK,MAAM;AAClC,oBAAI,UAAU,QAAQ,MAAM,IAAI;AAChC,oBAAI,CAAC,QAAQ,IAAI,OAAO,GAAG;AACzB,4BAAU,QAAQ,IAAI;AACtB,sBAAI,CAAC,QAAQ,IAAI,OAAO,GAAG;AACzB,0BAAM,KAAK;AAAA,sBACT,IAAI;AAAA,sBAAS,OAAO;AAAA,sBAAM,WAAW;AAAA,sBACrC,aAAa;AAAA,sBAAI,iBAAiB;AAAA,oBACpC,CAAC;AACD,4BAAQ,IAAI,OAAO;AAAA,kBACrB;AAAA,gBACF;AACA,wBAAQ,UAAU,SAAS,YAAY,IAAI;AAAA,cAC7C;AAAA,YACF;AAAA,UACF;AAAA,QACF;AAAA,MACF;AAGA,UAAI,OAAO,aAAa,uBAAuB;AAC7C,mBAAW,SAAS,KAAK,UAAU;AACjC,cAAI,MAAM,SAAS,aAAa;AAC9B,uBAAW,OAAO,MAAM,UAAU;AAChC,kBAAI,IAAI,SAAS,gBAAgB,IAAI,SAAS,gBAAgB;AAC5D,oBAAI;AACJ,oBAAI,IAAI,SAAS,gBAAgB;AAC/B,wBAAM,YAAY,IAAI,kBAAkB,MAAM;AAC9C,yBAAO,YAAY,UAAU,WAAW,MAAM,IAAI,UAAU,IAAI,SAAS,CAAC,GAAI,MAAM;AAAA,gBACtF,OAAO;AACL,yBAAO,UAAU,KAAK,MAAM;AAAA,gBAC9B;AACA,oBAAI,UAAU,QAAQ,MAAM,IAAI;AAChC,oBAAI,CAAC,QAAQ,IAAI,OAAO,GAAG;AACzB,4BAAU,QAAQ,IAAI;AACtB,sBAAI,CAAC,QAAQ,IAAI,OAAO,GAAG;AACzB,0BAAM,KAAK;AAAA,sBACT,IAAI;AAAA,sBAAS,OAAO;AAAA,sBAAM,WAAW;AAAA,sBACrC,aAAa;AAAA,sBAAI,iBAAiB;AAAA,oBACpC,CAAC;AACD,4BAAQ,IAAI,OAAO;AAAA,kBACrB;AAAA,gBACF;AACA,wBAAQ,UAAU,SAAS,YAAY,IAAI;AAAA,cAC7C;AAAA,YACF;AAAA,UACF;AAAA,QACF;AAAA,MACF;AAGA,YAAM,OAAO,UAAU,MAAM,MAAM;AACnC,UAAI,MAAM;AACR,mBAAW,SAAS,KAAK,UAAU;AACjC,eAAK,OAAO,QAAQ;AAAA,QACtB;AAAA,MACF;AACA;AAAA,IACF;AAGA,QAAI,OAAO,cAAc,IAAI,CAAC,GAAG;AAC/B,UAAI,WAA0B;AAG9B,UAAI,MAAM,sBAAsB;AAC9B,mBAAW;AAAA,MACb,WAAW,MAAM,yBAAyB;AACxC,mBAAW;AAAA,MACb,WAAW,OAAO,0BAA0B,MAAM;AAEhD,cAAM,aAAa,KAAK,kBAAkB,YAAY;AACtD,YAAI,YAAY;AACd,qBAAW,OAAO,sBAAsB,YAAY,MAAM;AAAA,QAC5D;AAAA,MACF,OAAO;AACL,YAAI,WAAW,KAAK,kBAAkB,OAAO,SAAS;AACtD,YAAI,CAAC,UAAU;AACb,qBAAW,SAAS,KAAK,UAAU;AACjC,gBAAI,OAAO,uBAAuB,SAAS,MAAM,IAAI,GAAG;AACtD,yBAAW;AACX;AAAA,YACF;AAAA,UACF;AAAA,QACF;AACA,mBAAW,WAAW,UAAU,UAAU,MAAM,IAAI;AAAA,MACtD;AAEA,UAAI,CAAC,SAAU;AAEf,YAAM,OAAO,KAAK,cAAc,MAAM;AACtC,UAAI;AACJ,UAAI,gBAAgB;AAClB,kBAAU,QAAQ,gBAAgB,QAAQ;AAC1C,gBAAQ,SAAS,IAAI,QAAQ,MAAM,IAAI;AACvC,gBAAQ,gBAAgB,SAAS,UAAU,IAAI;AAAA,MACjD,OAAO;AACL,kBAAU,QAAQ,MAAM,QAAQ;AAChC,gBAAQ,SAAS,GAAG,QAAQ,MAAM,IAAI;AACtC,gBAAQ,SAAS,SAAS,YAAY,IAAI;AAAA,MAC5C;AAEA,YAAM,OAAO,UAAU,MAAM,MAAM;AACnC,UAAI,MAAM;AACR,uBAAe,KAAK,CAAC,SAAS,IAAI,CAAC;AAAA,MACrC;AACA;AAAA,IACF;AAGA,QAAI,OAAO,aAAa,4BAA4B,OAAO,aAAa,0BAA0B;AAChG,UAAI;AAAA,QAAa;AAAA,QAAM;AAAA,QAAQ;AAAA,QAAS;AAAA,QAAM;AAAA,QAC5C;AAAA,QAAO;AAAA,QAAO;AAAA,QAAS;AAAA,QACvB;AAAA,QAAgB;AAAA,QAAS;AAAA,MAAO,GAAG;AACnC;AAAA,MACF;AAAA,IACF;AAGA,QAAI,OAAO,aAAa,uBAAuB;AAC7C,UAAI;AAAA,QAAiB;AAAA,QAAM;AAAA,QAAQ;AAAA,QAAS;AAAA,QAAM;AAAA,QAChD;AAAA,QAAO;AAAA,QAAO;AAAA,QAAS;AAAA,QACvB;AAAA,QAAgB;AAAA,QAAS;AAAA,QAAS;AAAA,MAAI,GAAG;AACzC;AAAA,MACF;AAAA,IACF;AAGA,QAAI,OAAO,aAAa,qBAAqB;AAC3C,UAAI;AAAA,QAAgB;AAAA,QAAM;AAAA,QAAQ;AAAA,QAAS;AAAA,QAAM;AAAA,QAC/C;AAAA,QAAO;AAAA,QAAO;AAAA,QAAS;AAAA,QACvB;AAAA,QAAgB;AAAA,QAAS;AAAA,MAAO,GAAG;AACnC;AAAA,MACF;AAAA,IACF;AAGA,eAAW,SAAS,KAAK,UAAU;AACjC,WAAK,OAAO,IAAI;AAAA,IAClB;AAAA,EACF;AAEA,OAAK,IAAI;AAGT,QAAM,aAAa,oBAAI,IAAoB;AAC3C,aAAW,KAAK,OAAO;AACrB,UAAM,MAAM,EAAE;AACd,UAAM,aAAa,IAAI,QAAQ,WAAW,EAAE,EAAE,QAAQ,OAAO,EAAE;AAC/D,eAAW,IAAI,WAAW,YAAY,GAAG,EAAE,EAAE;AAAA,EAC/C;AAEA,QAAM,gBAAgB,oBAAI,IAAY;AAEtC,WAAS,UAAU,MAAkB,WAAyB;AAC5D,QAAI,OAAO,sBAAsB,IAAI,KAAK,IAAI,EAAG;AAEjD,QAAI,OAAO,UAAU,IAAI,KAAK,IAAI,GAAG;AACnC,UAAI,aAA4B;AAGhC,UAAI,OAAO,aAAa,qBAAqB;AAC3C,cAAM,QAAQ,KAAK,SAAS,CAAC,KAAK;AAClC,YAAI,OAAO;AACT,cAAI,MAAM,SAAS,qBAAqB;AACtC,yBAAa,UAAU,OAAO,MAAM;AAAA,UACtC,WAAW,MAAM,SAAS,yBAAyB;AACjD,uBAAW,SAAS,MAAM,UAAU;AAClC,kBAAI,MAAM,SAAS,qBAAqB;AACtC,2BAAW,MAAM,MAAM,UAAU;AAC/B,sBAAI,GAAG,SAAS,qBAAqB;AACnC,iCAAa,UAAU,IAAI,MAAM;AAAA,kBACnC;AAAA,gBACF;AAAA,cACF;AAAA,YACF;AAAA,UACF;AAAA,QACF;AAAA,MACF,WAAW,OAAO,aAAa,sBAAsB;AACnD,cAAM,QAAQ,KAAK,SAAS,CAAC,KAAK;AAClC,YAAI,OAAO;AACT,cAAI,MAAM,SAAS,qBAAqB;AACtC,yBAAa,UAAU,OAAO,MAAM;AAAA,UACtC,WAAW,MAAM,SAAS,yBAAyB;AACjD,qBAAS,IAAI,MAAM,SAAS,SAAS,GAAG,KAAK,GAAG,KAAK;AACnD,kBAAI,MAAM,SAAS,CAAC,EAAG,SAAS,qBAAqB;AACnD,6BAAa,UAAU,MAAM,SAAS,CAAC,GAAI,MAAM;AACjD;AAAA,cACF;AAAA,YACF;AAAA,UACF;AAAA,QACF;AAAA,MACF,WAAW,OAAO,aAAa,qBAAqB;AAClD,cAAM,QAAQ,KAAK,SAAS,CAAC,KAAK;AAClC,YAAI,OAAO;AACT,cAAI,MAAM,SAAS,cAAc;AAC/B,yBAAa,UAAU,OAAO,MAAM;AAAA,UACtC,WAAW,MAAM,SAAS,oBAAoB;AAC5C,kBAAM,QAAQ,MAAM,kBAAkB,OAAO;AAC7C,gBAAI,OAAO;AACT,2BAAa,UAAU,OAAO,MAAM;AAAA,YACtC,OAAO;AACL,uBAAS,IAAI,MAAM,SAAS,SAAS,GAAG,KAAK,GAAG,KAAK;AACnD,oBAAI,MAAM,SAAS,CAAC,EAAG,SAAS,cAAc;AAC5C,+BAAa,UAAU,MAAM,SAAS,CAAC,GAAI,MAAM;AACjD;AAAA,gBACF;AAAA,cACF;AAAA,YACF;AAAA,UACF;AAAA,QACF;AAAA,MACF,WAAW,OAAO,aAAa,yBAAyB,KAAK,SAAS,yBAAyB;AAC7F,cAAM,WAAW,KAAK,kBAAkB,MAAM;AAC9C,YAAI,UAAU;AACZ,uBAAa,UAAU,UAAU,MAAM;AAAA,QACzC,OAAO;AACL,qBAAW,SAAS,KAAK,UAAU;AACjC,gBAAI,MAAM,SAAS;AACjB,oBAAM,MAAM,UAAU,OAAO,MAAM;AACnC,kBAAI,IAAI,SAAS,GAAG,GAAG;AACrB,6BAAa,IAAI,MAAM,GAAG,EAAE,IAAI;AAAA,cAClC,OAAO;AACL,6BAAa;AAAA,cACf;AACA;AAAA,YACF;AAAA,UACF;AAAA,QACF;AAAA,MACF,WAAW,OAAO,aAAa,mBAAmB;AAChD,YAAI,KAAK,SAAS,4BAA4B;AAC5C,gBAAM,WAAW,KAAK,kBAAkB,UAAU;AAClD,cAAI,SAAU,cAAa,UAAU,UAAU,MAAM;AAAA,QACvD,OAAO;AACL,gBAAM,WAAW,KAAK,kBAAkB,MAAM;AAC9C,cAAI,SAAU,cAAa,UAAU,UAAU,MAAM;AAAA,QACvD;AAAA,MACF,WAAW,OAAO,aAAa,mBAAmB;AAChD,cAAM,WAAW,OAAO,oBAAoB,KAAK,kBAAkB,OAAO,iBAAiB,IAAI;AAC/F,YAAI,UAAU;AACZ,cAAI,SAAS,SAAS,cAAc;AAClC,yBAAa,UAAU,UAAU,MAAM;AAAA,UACzC,WAAW,SAAS,SAAS,sBAAsB,SAAS,SAAS,wBAAwB;AAC3F,kBAAM,OAAO,SAAS,kBAAkB,OAAO,KAAK,SAAS,kBAAkB,MAAM;AACrF,gBAAI,KAAM,cAAa,UAAU,MAAM,MAAM;AAAA,UAC/C;AAAA,QACF;AAAA,MACF,OAAO;AAEL,cAAM,WAAW,OAAO,oBAAoB,KAAK,kBAAkB,OAAO,iBAAiB,IAAI;AAC/F,YAAI,UAAU;AACZ,cAAI,SAAS,SAAS,cAAc;AAClC,yBAAa,UAAU,UAAU,MAAM;AAAA,UACzC,WAAW,OAAO,sBAAsB,IAAI,SAAS,IAAI,GAAG;AAC1D,gBAAI,OAAO,mBAAmB;AAC5B,oBAAM,OAAO,SAAS,kBAAkB,OAAO,iBAAiB;AAChE,kBAAI,KAAM,cAAa,UAAU,MAAM,MAAM;AAAA,YAC/C;AAAA,UACF,OAAO;AAEL,yBAAa,UAAU,UAAU,MAAM;AAAA,UACzC;AAAA,QACF;AAAA,MACF;AAEA,UAAI,YAAY;AACd,cAAM,SAAS,WAAW,IAAI,WAAW,YAAY,CAAC;AACtD,YAAI,UAAU,WAAW,WAAW;AAClC,gBAAM,OAAO,GAAG,SAAS,IAAI,MAAM;AACnC,cAAI,CAAC,cAAc,IAAI,IAAI,GAAG;AAC5B,0BAAc,IAAI,IAAI;AACtB,kBAAM,OAAO,KAAK,cAAc,MAAM;AACtC,kBAAM,KAAK;AAAA,cACT,QAAQ;AAAA,cAAW,QAAQ;AAAA,cAAQ,UAAU;AAAA,cAC7C,YAAY;AAAA,cAAa,aAAa;AAAA,cACtC,iBAAiB,IAAI,IAAI;AAAA,cAAI,QAAQ;AAAA,YACvC,CAAC;AAAA,UACH;AAAA,QACF;AAAA,MACF;AAAA,IACF;AAEA,eAAW,SAAS,KAAK,UAAU;AACjC,gBAAU,OAAO,SAAS;AAAA,IAC5B;AAAA,EACF;AAEA,aAAW,CAAC,WAAW,QAAQ,KAAK,gBAAgB;AAClD,cAAU,UAAU,SAAS;AAAA,EAC/B;AAGA,QAAM,WAAW;AACjB,QAAM,aAAa,MAAM,OAAO,CAAC,SAAS;AACxC,UAAM,MAAM,KAAK;AACjB,UAAM,MAAM,KAAK;AACjB,WAAO,SAAS,IAAI,GAAG,MAAM,SAAS,IAAI,GAAG,KAAK,KAAK,aAAa,aAAa,KAAK,aAAa;AAAA,EACrG,CAAC;AAED,SAAO,EAAE,OAAO,OAAO,WAAW;AACpC;AAWA,eAAe,wBAAwB,UAAkB,QAAyC;AAChG,QAAM,iBAAiB;AACvB,QAAM,OAAO,MAAM,aAAa,QAAQ;AACxC,MAAI,CAAC,KAAM;AAEX,MAAI;AACJ,MAAI;AACJ,MAAI;AACF,UAAM,SAAS,IAAIA,QAAO;AAC1B,WAAO,YAAY,IAAI;AACvB,iBAAS,8BAAa,UAAU,OAAO;AACvC,UAAM,OAAO,UAAU,QAAQ,MAAM;AACrC,WAAO,KAAK;AAAA,EACd,QAAQ;AACN;AAAA,EACF;AAEA,QAAM,WAAO,4BAAS,cAAU,2BAAQ,QAAQ,CAAC;AACjD,QAAM,UAAU;AAChB,QAAM,EAAE,OAAO,MAAM,IAAI;AACzB,QAAM,UAAU,IAAI,IAAI,MAAM,IAAI,CAAC,MAAM,EAAE,EAAE,CAAC;AAC9C,QAAM,UAAU,QAAQ,IAAI;AAE5B,WAAS,aAAa,UAAsD;AAC1E,QAAI,CAAC,SAAU,QAAO;AACtB,eAAW,SAAS,SAAS,UAAU;AACrC,UAAI,MAAM,SAAS,wBAAwB;AACzC,mBAAW,OAAO,MAAM,UAAU;AAChC,cAAI,IAAI,SAAS,YAAY,IAAI,SAAS,uBAAuB;AAC/D,gBAAI,OAAO,OAAO,MAAM,IAAI,YAAY,IAAI,QAAQ;AACpD,mBAAO,KAAK,QAAQ,kBAAkB,EAAE,EAAE,QAAQ,gBAAgB,EAAE,EAAE,QAAQ,gBAAgB,EAAE,EAAE,KAAK;AACvG,gBAAI,KAAK,SAAS,IAAI;AACpB,qBAAO,CAAC,MAAM,MAAM,cAAc,MAAM,CAAC;AAAA,YAC3C;AAAA,UACF;AAAA,QACF;AAAA,MACF;AACA;AAAA,IACF;AACA,WAAO;AAAA,EACT;AAEA,WAAS,aAAa,MAAc,MAAc,WAAyB;AACzE,UAAM,QAAQ,KAAK,MAAM,GAAG,EAAE,EAAE,QAAQ,OAAO,GAAG,EAAE,KAAK;AACzD,UAAM,MAAM,QAAQ,MAAM,aAAa,OAAO,IAAI,CAAC;AACnD,QAAI,CAAC,QAAQ,IAAI,GAAG,GAAG;AACrB,cAAQ,IAAI,GAAG;AACf,YAAM,KAAK;AAAA,QACT,IAAI;AAAA,QAAK;AAAA,QAAO,WAAW;AAAA,QAC3B,aAAa;AAAA,QAAS,iBAAiB,IAAI,IAAI;AAAA,MACjD,CAAC;AAAA,IACH;AACA,UAAM,KAAK;AAAA,MACT,QAAQ;AAAA,MAAK,QAAQ;AAAA,MAAW,UAAU;AAAA,MAC1C,YAAY;AAAA,MAAa,aAAa;AAAA,MACtC,iBAAiB,IAAI,IAAI;AAAA,MAAI,QAAQ;AAAA,IACvC,CAAC;AAAA,EACH;AAGA,QAAM,KAAK,aAAa,IAAI;AAC5B,MAAI,GAAI,cAAa,GAAG,CAAC,GAAG,GAAG,CAAC,GAAG,OAAO;AAG1C,WAAS,eAAe,MAAkB,WAAyB;AACjE,UAAM,IAAI,KAAK;AACf,QAAI,MAAM,oBAAoB;AAC5B,YAAM,WAAW,KAAK,kBAAkB,MAAM;AAC9C,YAAM,OAAO,KAAK,kBAAkB,MAAM;AAC1C,UAAI,YAAY,MAAM;AACpB,cAAM,YAAY,OAAO,MAAM,SAAS,YAAY,SAAS,QAAQ;AACrE,cAAM,MAAM,QAAQ,MAAM,SAAS;AACnC,cAAM,UAAU,aAAa,IAAI;AACjC,YAAI,QAAS,cAAa,QAAQ,CAAC,GAAG,QAAQ,CAAC,GAAG,GAAG;AACrD,mBAAW,SAAS,KAAK,UAAU;AACjC,yBAAe,OAAO,GAAG;AAAA,QAC3B;AAAA,MACF;AACA;AAAA,IACF;AACA,QAAI,MAAM,uBAAuB;AAC/B,YAAM,WAAW,KAAK,kBAAkB,MAAM;AAC9C,YAAM,OAAO,KAAK,kBAAkB,MAAM;AAC1C,UAAI,YAAY,MAAM;AACpB,cAAM,WAAW,OAAO,MAAM,SAAS,YAAY,SAAS,QAAQ;AACpE,cAAM,MAAM,cAAc,UAAU,QAAQ,WAAW,QAAQ,IAAI,QAAQ,MAAM,QAAQ;AACzF,cAAM,SAAS,aAAa,IAAI;AAChC,YAAI,OAAQ,cAAa,OAAO,CAAC,GAAG,OAAO,CAAC,GAAG,GAAG;AAAA,MACpD;AACA;AAAA,IACF;AACA,eAAW,SAAS,KAAK,UAAU;AACjC,qBAAe,OAAO,SAAS;AAAA,IACjC;AAAA,EACF;AAEA,iBAAe,MAAM,OAAO;AAG5B,QAAM,QAAQ,OAAO,MAAM,IAAI;AAC/B,WAAS,SAAS,GAAG,SAAS,MAAM,QAAQ,UAAU;AACpD,UAAM,WAAW,MAAM,MAAM,EAAG,KAAK;AACrC,QAAI,oBAAoB,KAAK,CAAC,MAAM,SAAS,WAAW,CAAC,CAAC,GAAG;AAC3D,mBAAa,UAAU,SAAS,GAAG,OAAO;AAAA,IAC5C;AAAA,EACF;AACF;AAMA,eAAsB,cAAc,UAA6C;AAC/E,QAAM,SAAS,MAAM,gBAAgB,UAAU,cAAc;AAC7D,MAAI,CAAC,OAAO,OAAO;AACjB,UAAM,wBAAwB,UAAU,MAAM;AAAA,EAChD;AACA,SAAO;AACT;AAEA,eAAsB,UAAU,UAA6C;AAC3E,QAAM,UAAM,2BAAQ,QAAQ;AAC5B,QAAM,SAAU,QAAQ,SAAS,QAAQ,SAAU,aAAa;AAChE,SAAO,gBAAgB,UAAU,MAAM;AACzC;AAEA,eAAsB,YAAY,UAA6C;AAC7E,SAAO,gBAAgB,UAAU,YAAY;AAC/C;AAEA,eAAsB,SAAS,UAA6C;AAC1E,SAAO,gBAAgB,UAAU,SAAS;AAC5C;AAEA,eAAsB,WAAW,UAA6C;AAC5E,SAAO,gBAAgB,UAAU,WAAW;AAC9C;AAEA,eAAsB,YAAY,UAA6C;AAC7E,SAAO,gBAAgB,UAAU,YAAY;AAC/C;AAEA,eAAsB,cAAc,UAA6C;AAC/E,SAAO,gBAAgB,UAAU,cAAc;AACjD;AAEA,eAAsB,cAAc,UAA6C;AAC/E,SAAO,gBAAgB,UAAU,cAAc;AACjD;AAEA,eAAsB,aAAa,UAA6C;AAC9E,SAAO,gBAAgB,UAAU,aAAa;AAChD;AAEA,eAAsB,WAAW,UAA6C;AAC5E,SAAO,gBAAgB,UAAU,WAAW;AAC9C;AAEA,eAAsB,WAAW,UAA6C;AAC5E,SAAO,gBAAgB,UAAU,WAAW;AAC9C;AAEA,eAAsB,aAAa,UAA6C;AAC9E,SAAO,gBAAgB,UAAU,aAAa;AAChD;AAMA,eAAsB,aAAa,UAA6C;AAC9E,QAAM,iBAAiB;AACvB,QAAM,OAAO,MAAM,aAAa,OAAO;AACvC,MAAI,CAAC,MAAM;AACT,WAAO,EAAE,OAAO,CAAC,GAAG,OAAO,CAAC,GAAG,OAAO,kCAAkC;AAAA,EAC1E;AAEA,MAAI;AACJ,MAAI;AACJ,MAAI;AACF,UAAM,SAAS,IAAIA,QAAO;AAC1B,WAAO,YAAY,IAAI;AACvB,iBAAS,8BAAa,UAAU,OAAO;AACvC,WAAO,UAAU,QAAQ,MAAM;AAAA,EACjC,SAAS,GAAY;AACnB,WAAO,EAAE,OAAO,CAAC,GAAG,OAAO,CAAC,GAAG,OAAO,OAAO,CAAC,EAAE;AAAA,EAClD;AAEA,QAAM,OAAO,KAAK;AAClB,QAAM,WAAO,4BAAS,cAAU,2BAAQ,QAAQ,CAAC;AACjD,QAAM,UAAU;AAChB,QAAM,QAAqB,CAAC;AAC5B,QAAM,QAAqB,CAAC;AAC5B,QAAM,UAAU,oBAAI,IAAY;AAChC,QAAM,iBAA8C,CAAC;AAErD,WAAS,QAAQ,KAAa,OAAe,MAAoB;AAC/D,QAAI,CAAC,QAAQ,IAAI,GAAG,GAAG;AACrB,cAAQ,IAAI,GAAG;AACf,YAAM,KAAK,EAAE,IAAI,KAAK,OAAO,WAAW,QAAQ,aAAa,SAAS,iBAAiB,IAAI,IAAI,GAAG,CAAC;AAAA,IACrG;AAAA,EACF;AAEA,WAAS,QACP,KAAa,KAAa,UAAkB,MAC5C,aAAuC,aAAa,SAAiB,GAC/D;AACN,UAAM,KAAK,EAAE,QAAQ,KAAK,QAAQ,KAAK,UAAU,YAAY,aAAa,SAAS,iBAAiB,IAAI,IAAI,IAAI,OAAO,CAAC;AAAA,EAC1H;AAEA,QAAM,UAAU,QAAQ,IAAI;AAC5B,UAAQ,aAAS,4BAAS,QAAQ,GAAG,CAAC;AAEtC,WAAS,sBAAsB,SAAoC;AACjE,eAAW,SAAS,QAAQ,UAAU;AACpC,UAAI,MAAM,SAAS,mBAAmB;AACpC,cAAM,SAAS,MAAM,SAAS,CAAC,KAAK;AACpC,YAAI,UAAU,OAAO,SAAS,cAAc;AAC1C,iBAAO,UAAU,QAAQ,MAAM;AAAA,QACjC;AAAA,MACF;AAAA,IACF;AACA,WAAO;AAAA,EACT;AAEA,WAAS,UAAU,UAAsB,SAAuB;AAC9D,QAAI,CAAC,SAAU;AACf,UAAM,IAAI,SAAS;AACnB,QAAI,MAAM,yBAAyB,MAAM,4BAA6B;AACtE,QAAI,MAAM,qBAAqB,SAAS,SAAS,SAAS,GAAG;AAC3D,YAAM,SAAS,SAAS,SAAS,CAAC;AAClC,UAAI,OAAO,SAAS,cAAc;AAChC,cAAM,aAAa,UAAU,QAAQ,MAAM;AAC3C,cAAM,YAAY,QAAQ,MAAM,UAAU;AAC1C,gBAAQ,SAAS,WAAW,SAAS,SAAS,cAAc,MAAM,GAAG,WAAW;AAAA,MAClF,WAAW,OAAO,SAAS,sBAAsB,OAAO,SAAS,UAAU,GAAG;AAC5E,cAAM,aAAa,OAAO,SAAS,OAAO,SAAS,SAAS,CAAC;AAC7D,cAAM,aAAa,UAAU,YAAY,MAAM;AAC/C,cAAM,YAAY,QAAQ,MAAM,UAAU;AAC1C,gBAAQ,SAAS,WAAW,SAAS,SAAS,cAAc,MAAM,GAAG,WAAW;AAAA,MAClF;AAAA,IACF;AACA,eAAW,SAAS,SAAS,UAAU;AACrC,gBAAU,OAAO,OAAO;AAAA,IAC1B;AAAA,EACF;AAEA,WAAS,KAAK,MAAkB,UAAwB;AACtD,UAAM,IAAI,KAAK;AAGf,QAAI,MAAM,qBAAqB;AAC7B,YAAM,WAAW,KAAK,SAAS,KAAK,CAAC,MAAM,EAAE,SAAS,YAAY,KAAK;AACvE,UAAI,UAAU;AACZ,cAAM,UAAU,UAAU,UAAU,MAAM;AAC1C,cAAM,SAAS,QAAQ,MAAM,OAAO;AACpC,cAAM,OAAO,KAAK,cAAc,MAAM;AACtC,gBAAQ,QAAQ,SAAS,IAAI;AAC7B,gBAAQ,SAAS,QAAQ,WAAW,IAAI;AACxC,mBAAW,SAAS,KAAK,UAAU;AACjC,eAAK,OAAO,MAAM;AAAA,QACpB;AAAA,MACF;AACA;AAAA,IACF;AAGA,QAAI,MAAM,qBAAqB;AAC7B,YAAM,WAAW,KAAK,SAAS,KAAK,CAAC,MAAM,EAAE,SAAS,WAAW,KAAK;AACtE,UAAI,UAAU;AACZ,cAAM,UAAU,SAAS,SAAS,KAAK,CAAC,MAAM,EAAE,SAAS,mBAAmB,KAAK;AACjF,YAAI,SAAS;AACX,gBAAM,cAAc,QAAQ,SAAS,OAAO,CAAC,MAAM,EAAE,SAAS,YAAY;AAC1E,cAAI,YAAY,SAAS,GAAG;AAC1B,kBAAM,aAAa,UAAU,YAAY,CAAC,GAAI,MAAM;AACpD,kBAAM,YAAY,QAAQ,MAAM,UAAU;AAC1C,kBAAM,OAAO,KAAK,cAAc,MAAM;AACtC,oBAAQ,WAAW,YAAY,IAAI;AACnC,oBAAQ,UAAU,WAAW,WAAW,IAAI;AAC5C,gBAAI,YAAY,UAAU,GAAG;AAC3B,oBAAM,YAAY,UAAU,YAAY,YAAY,SAAS,CAAC,GAAI,MAAM;AACxE,sBAAQ,WAAW,QAAQ,MAAM,SAAS,GAAG,YAAY,MAAM,WAAW;AAAA,YAC5E;AAAA,UACF;AAAA,QACF,OAAO;AACL,gBAAM,WAAW,SAAS,SAAS,KAAK,CAAC,MAAM,EAAE,SAAS,YAAY,KAAK;AAC3E,cAAI,UAAU;AACZ,kBAAM,aAAa,UAAU,UAAU,MAAM;AAC7C,kBAAM,YAAY,QAAQ,MAAM,UAAU;AAC1C,kBAAM,OAAO,KAAK,cAAc,MAAM;AACtC,oBAAQ,WAAW,YAAY,IAAI;AACnC,oBAAQ,UAAU,WAAW,WAAW,IAAI;AAAA,UAC9C;AAAA,QACF;AAAA,MACF;AACA;AAAA,IACF;AAGA,QAAI,MAAM,uBAAuB;AAC/B,YAAM,WAAW,KAAK,SAAS,KAAK,CAAC,MAAM,EAAE,SAAS,WAAW,KAAK;AACtE,UAAI,UAAU;AACZ,cAAM,WAAW,SAAS,SAAS,KAAK,CAAC,MAAM,EAAE,SAAS,YAAY,KAAK;AAC3E,YAAI,UAAU;AACZ,gBAAM,UAAU,UAAU,UAAU,MAAM;AAC1C,gBAAM,SAAS,QAAQ,MAAM,OAAO;AACpC,gBAAM,OAAO,KAAK,cAAc,MAAM;AACtC,kBAAQ,QAAQ,SAAS,IAAI;AAC7B,kBAAQ,UAAU,QAAQ,WAAW,IAAI;AAAA,QAC3C;AAAA,MACF;AACA;AAAA,IACF;AAGA,QAAI,MAAM,uBAAuB;AAC/B,YAAM,UAAU,KAAK,SAAS,KAAK,CAAC,MAAM,EAAE,SAAS,WAAW,KAAK;AACrE,UAAI,SAAS;AACX,cAAM,WAAW,sBAAsB,OAAO;AAC9C,YAAI,UAAU;AACZ,gBAAM,UAAU,QAAQ,MAAM,QAAQ;AACtC,gBAAM,OAAO,KAAK,cAAc,MAAM;AACtC,kBAAQ,SAAS,GAAG,QAAQ,MAAM,IAAI;AACtC,kBAAQ,UAAU,SAAS,WAAW,IAAI;AAC1C,yBAAe,KAAK,CAAC,SAAS,IAAI,CAAC;AAAA,QACrC;AAAA,MACF;AACA;AAAA,IACF;AAGA,QAAI,MAAM,cAAc;AACtB,YAAM,MAAM,KAAK,SAAS,CAAC,KAAK;AAChC,UAAI,OAAO,IAAI,SAAS,qBAAqB,IAAI,SAAS,SAAS,GAAG;AACpE,cAAM,SAAS,IAAI,SAAS,CAAC;AAC7B,YAAI,OAAO,SAAS,cAAc;AAChC,gBAAM,WAAW,UAAU,QAAQ,MAAM;AACzC,gBAAM,UAAU,QAAQ,MAAM,QAAQ;AACtC,gBAAM,OAAO,KAAK,cAAc,MAAM;AACtC,kBAAQ,SAAS,GAAG,QAAQ,MAAM,IAAI;AACtC,kBAAQ,UAAU,SAAS,WAAW,IAAI;AAC1C,gBAAM,MAAM,KAAK,SAAS,UAAU,IAAI,KAAK,SAAS,KAAK,SAAS,SAAS,CAAC,IAAK;AACnF,cAAI,KAAK;AACP,2BAAe,KAAK,CAAC,SAAS,GAAG,CAAC;AAAA,UACpC;AAAA,QACF;AAAA,MACF;AACA;AAAA,IACF;AAGA,QAAI,MAAM,qBAAqB,MAAM,oBAAoB;AACvD,YAAM,OAAO,KAAK,cAAc,MAAM;AACtC,iBAAW,SAAS,KAAK,UAAU;AACjC,YAAI,MAAM,SAAS,cAAc;AAC/B,gBAAM,UAAU,UAAU,OAAO,MAAM;AACvC,gBAAM,SAAS,QAAQ,OAAO;AAC9B,kBAAQ,QAAQ,SAAS,IAAI;AAC7B,kBAAQ,UAAU,QAAQ,WAAW,IAAI;AAAA,QAC3C,WAAW,MAAM,SAAS,mBAAmB;AAC3C,gBAAM,cAAc,MAAM,SAAS,OAAO,CAAC,MAAM,EAAE,SAAS,YAAY;AACxE,cAAI,YAAY,SAAS,GAAG;AAC1B,kBAAM,UAAU,UAAU,YAAY,CAAC,GAAI,MAAM;AACjD,kBAAM,SAAS,QAAQ,OAAO;AAC9B,oBAAQ,QAAQ,SAAS,IAAI;AAC7B,oBAAQ,UAAU,QAAQ,WAAW,IAAI;AAAA,UAC3C;AAAA,QACF;AAAA,MACF;AACA;AAAA,IACF;AAEA,eAAW,SAAS,KAAK,UAAU;AACjC,WAAK,OAAO,QAAQ;AAAA,IACtB;AAAA,EACF;AAEA,OAAK,MAAM,OAAO;AAElB,aAAW,CAAC,SAAS,QAAQ,KAAK,gBAAgB;AAChD,QAAI,SAAS,SAAS,uBAAuB;AAC3C,iBAAW,SAAS,SAAS,UAAU;AACrC,YAAI,MAAM,SAAS,aAAa;AAC9B,oBAAU,OAAO,OAAO;AAAA,QAC1B;AAAA,MACF;AAAA,IACF,OAAO;AACL,gBAAU,UAAU,OAAO;AAAA,IAC7B;AAAA,EACF;AAEA,SAAO,EAAE,OAAO,MAAM;AACxB;AAMA,eAAsB,UAAU,UAA6C;AAC3E,QAAM,iBAAiB;AACvB,QAAM,OAAO,MAAM,aAAa,IAAI;AACpC,MAAI,CAAC,MAAM;AACT,WAAO,EAAE,OAAO,CAAC,GAAG,OAAO,CAAC,GAAG,OAAO,+BAA+B;AAAA,EACvE;AAEA,MAAI;AACJ,MAAI;AACJ,MAAI;AACF,UAAM,SAAS,IAAIA,QAAO;AAC1B,WAAO,YAAY,IAAI;AACvB,iBAAS,8BAAa,UAAU,OAAO;AACvC,WAAO,UAAU,QAAQ,MAAM;AAAA,EACjC,SAAS,GAAY;AACnB,WAAO,EAAE,OAAO,CAAC,GAAG,OAAO,CAAC,GAAG,OAAO,OAAO,CAAC,EAAE;AAAA,EAClD;AAEA,QAAM,OAAO,KAAK;AAClB,QAAM,WAAO,4BAAS,cAAU,2BAAQ,QAAQ,CAAC;AACjD,QAAM,eAAW,2BAAQ,QAAQ,EAAE,MAAM,qBAAG,EAAE,IAAI,KAAK;AACvD,QAAM,UAAU;AAChB,QAAM,QAAqB,CAAC;AAC5B,QAAM,QAAqB,CAAC;AAC5B,QAAM,UAAU,oBAAI,IAAY;AAChC,QAAM,iBAA8C,CAAC;AAErD,WAAS,QAAQ,KAAa,OAAe,MAAoB;AAC/D,QAAI,CAAC,QAAQ,IAAI,GAAG,GAAG;AACrB,cAAQ,IAAI,GAAG;AACf,YAAM,KAAK,EAAE,IAAI,KAAK,OAAO,WAAW,QAAQ,aAAa,SAAS,iBAAiB,IAAI,IAAI,GAAG,CAAC;AAAA,IACrG;AAAA,EACF;AAEA,WAAS,QACP,KAAa,KAAa,UAAkB,MAC5C,aAAuC,aAAa,SAAiB,GAC/D;AACN,UAAM,KAAK,EAAE,QAAQ,KAAK,QAAQ,KAAK,UAAU,YAAY,aAAa,SAAS,iBAAiB,IAAI,IAAI,IAAI,OAAO,CAAC;AAAA,EAC1H;AAEA,QAAM,UAAU,QAAQ,IAAI;AAC5B,UAAQ,aAAS,4BAAS,QAAQ,GAAG,CAAC;AAEtC,WAAS,KAAK,MAAwB;AACpC,UAAM,IAAI,KAAK;AAEf,QAAI,MAAM,wBAAwB;AAChC,YAAM,WAAW,KAAK,kBAAkB,MAAM;AAC9C,UAAI,UAAU;AACZ,cAAM,WAAW,UAAU,UAAU,MAAM;AAC3C,cAAM,OAAO,KAAK,cAAc,MAAM;AACtC,cAAM,UAAU,QAAQ,MAAM,QAAQ;AACtC,gBAAQ,SAAS,GAAG,QAAQ,MAAM,IAAI;AACtC,gBAAQ,SAAS,SAAS,YAAY,IAAI;AAC1C,cAAM,OAAO,KAAK,kBAAkB,MAAM;AAC1C,YAAI,KAAM,gBAAe,KAAK,CAAC,SAAS,IAAI,CAAC;AAAA,MAC/C;AACA;AAAA,IACF;AAEA,QAAI,MAAM,sBAAsB;AAC9B,YAAM,WAAW,KAAK,kBAAkB,UAAU;AAClD,UAAI,eAA8B;AAClC,UAAI,UAAU;AACZ,mBAAW,SAAS,SAAS,UAAU;AACrC,cAAI,MAAM,SAAS,yBAAyB;AAC1C,kBAAM,WAAW,MAAM,kBAAkB,MAAM;AAC/C,gBAAI,UAAU;AACZ,6BAAe,UAAU,UAAU,MAAM,EAAE,QAAQ,OAAO,EAAE,EAAE,KAAK;AAAA,YACrE;AACA;AAAA,UACF;AAAA,QACF;AAAA,MACF;AACA,YAAM,WAAW,KAAK,kBAAkB,MAAM;AAC9C,UAAI,UAAU;AACZ,cAAM,aAAa,UAAU,UAAU,MAAM;AAC7C,cAAM,OAAO,KAAK,cAAc,MAAM;AACtC,YAAI;AACJ,YAAI,cAAc;AAChB,gBAAM,YAAY,QAAQ,UAAU,YAAY;AAChD,kBAAQ,WAAW,cAAc,IAAI;AACrC,sBAAY,QAAQ,WAAW,UAAU;AACzC,kBAAQ,WAAW,IAAI,UAAU,MAAM,IAAI;AAC3C,kBAAQ,WAAW,WAAW,UAAU,IAAI;AAAA,QAC9C,OAAO;AACL,sBAAY,QAAQ,MAAM,UAAU;AACpC,kBAAQ,WAAW,GAAG,UAAU,MAAM,IAAI;AAC1C,kBAAQ,SAAS,WAAW,YAAY,IAAI;AAAA,QAC9C;AACA,cAAM,OAAO,KAAK,kBAAkB,MAAM;AAC1C,YAAI,KAAM,gBAAe,KAAK,CAAC,WAAW,IAAI,CAAC;AAAA,MACjD;AACA;AAAA,IACF;AAEA,QAAI,MAAM,oBAAoB;AAC5B,iBAAW,SAAS,KAAK,UAAU;AACjC,YAAI,MAAM,SAAS,aAAa;AAC9B,gBAAM,WAAW,MAAM,kBAAkB,MAAM;AAC/C,cAAI,UAAU;AACZ,kBAAM,WAAW,UAAU,UAAU,MAAM;AAC3C,kBAAM,OAAO,MAAM,cAAc,MAAM;AACvC,kBAAM,UAAU,QAAQ,UAAU,QAAQ;AAC1C,oBAAQ,SAAS,UAAU,IAAI;AAC/B,oBAAQ,SAAS,SAAS,YAAY,IAAI;AAAA,UAC5C;AAAA,QACF;AAAA,MACF;AACA;AAAA,IACF;AAEA,QAAI,MAAM,sBAAsB;AAC9B,iBAAW,SAAS,KAAK,UAAU;AACjC,YAAI,MAAM,SAAS,oBAAoB;AACrC,qBAAW,QAAQ,MAAM,UAAU;AACjC,gBAAI,KAAK,SAAS,eAAe;AAC/B,oBAAM,WAAW,KAAK,kBAAkB,MAAM;AAC9C,kBAAI,UAAU;AACZ,sBAAM,MAAM,UAAU,UAAU,MAAM,EAAE,QAAQ,UAAU,EAAE;AAC5D,sBAAM,aAAa,IAAI,MAAM,GAAG,EAAE,IAAI;AACtC,sBAAM,SAAS,QAAQ,UAAU;AACjC,wBAAQ,SAAS,QAAQ,gBAAgB,KAAK,cAAc,MAAM,CAAC;AAAA,cACrE;AAAA,YACF;AAAA,UACF;AAAA,QACF,WAAW,MAAM,SAAS,eAAe;AACvC,gBAAM,WAAW,MAAM,kBAAkB,MAAM;AAC/C,cAAI,UAAU;AACZ,kBAAM,MAAM,UAAU,UAAU,MAAM,EAAE,QAAQ,UAAU,EAAE;AAC5D,kBAAM,aAAa,IAAI,MAAM,GAAG,EAAE,IAAI;AACtC,kBAAM,SAAS,QAAQ,UAAU;AACjC,oBAAQ,SAAS,QAAQ,gBAAgB,MAAM,cAAc,MAAM,CAAC;AAAA,UACtE;AAAA,QACF;AAAA,MACF;AACA;AAAA,IACF;AAEA,eAAW,SAAS,KAAK,UAAU;AACjC,WAAK,KAAK;AAAA,IACZ;AAAA,EACF;AAEA,OAAK,IAAI;AAGT,QAAM,aAAa,oBAAI,IAAoB;AAC3C,aAAW,KAAK,OAAO;AACrB,UAAM,aAAa,EAAE,MAAM,QAAQ,WAAW,EAAE,EAAE,QAAQ,OAAO,EAAE;AACnE,eAAW,IAAI,WAAW,YAAY,GAAG,EAAE,EAAE;AAAA,EAC/C;AAEA,QAAM,gBAAgB,oBAAI,IAAY;AAEtC,WAAS,UAAU,MAAkB,WAAyB;AAC5D,QAAI,KAAK,SAAS,0BAA0B,KAAK,SAAS,qBAAsB;AAChF,QAAI,KAAK,SAAS,mBAAmB;AACnC,YAAM,WAAW,KAAK,kBAAkB,UAAU;AAClD,UAAI,aAA4B;AAChC,UAAI,UAAU;AACZ,YAAI,SAAS,SAAS,cAAc;AAClC,uBAAa,UAAU,UAAU,MAAM;AAAA,QACzC,WAAW,SAAS,SAAS,uBAAuB;AAClD,gBAAM,QAAQ,SAAS,kBAAkB,OAAO;AAChD,cAAI,MAAO,cAAa,UAAU,OAAO,MAAM;AAAA,QACjD;AAAA,MACF;AACA,UAAI,YAAY;AACd,cAAM,SAAS,WAAW,IAAI,WAAW,YAAY,CAAC;AACtD,YAAI,UAAU,WAAW,WAAW;AAClC,gBAAM,OAAO,GAAG,SAAS,IAAI,MAAM;AACnC,cAAI,CAAC,cAAc,IAAI,IAAI,GAAG;AAC5B,0BAAc,IAAI,IAAI;AACtB,kBAAM,OAAO,KAAK,cAAc,MAAM;AACtC,kBAAM,KAAK;AAAA,cACT,QAAQ;AAAA,cAAW,QAAQ;AAAA,cAAQ,UAAU;AAAA,cAC7C,YAAY;AAAA,cAAa,aAAa;AAAA,cACtC,iBAAiB,IAAI,IAAI;AAAA,cAAI,QAAQ;AAAA,YACvC,CAAC;AAAA,UACH;AAAA,QACF;AAAA,MACF;AAAA,IACF;AACA,eAAW,SAAS,KAAK,UAAU;AACjC,gBAAU,OAAO,SAAS;AAAA,IAC5B;AAAA,EACF;AAEA,aAAW,CAAC,WAAW,QAAQ,KAAK,gBAAgB;AAClD,cAAU,UAAU,SAAS;AAAA,EAC/B;AAEA,QAAM,aAAa,MAAM;AAAA,IAAO,CAAC,MAC/B,QAAQ,IAAI,EAAE,MAAM,MAAM,QAAQ,IAAI,EAAE,MAAM,KAAK,EAAE,aAAa,aAAa,EAAE,aAAa;AAAA,EAChG;AAEA,SAAO,EAAE,OAAO,OAAO,WAAW;AACpC;AAMA,eAAsB,YAAY,UAA6C;AAC7E,QAAM,iBAAiB;AACvB,QAAM,OAAO,MAAM,aAAa,MAAM;AACtC,MAAI,CAAC,MAAM;AACT,WAAO,EAAE,OAAO,CAAC,GAAG,OAAO,CAAC,GAAG,OAAO,iCAAiC;AAAA,EACzE;AAEA,MAAI;AACJ,MAAI;AACJ,MAAI;AACF,UAAM,SAAS,IAAIA,QAAO;AAC1B,WAAO,YAAY,IAAI;AACvB,iBAAS,8BAAa,UAAU,OAAO;AACvC,WAAO,UAAU,QAAQ,MAAM;AAAA,EACjC,SAAS,GAAY;AACnB,WAAO,EAAE,OAAO,CAAC,GAAG,OAAO,CAAC,GAAG,OAAO,OAAO,CAAC,EAAE;AAAA,EAClD;AAEA,QAAM,OAAO,KAAK;AAClB,QAAM,WAAO,4BAAS,cAAU,2BAAQ,QAAQ,CAAC;AACjD,QAAM,UAAU;AAChB,QAAM,QAAqB,CAAC;AAC5B,QAAM,QAAqB,CAAC;AAC5B,QAAM,UAAU,oBAAI,IAAY;AAChC,QAAM,iBAA8C,CAAC;AAErD,WAAS,QAAQ,KAAa,OAAe,MAAoB;AAC/D,QAAI,CAAC,QAAQ,IAAI,GAAG,GAAG;AACrB,cAAQ,IAAI,GAAG;AACf,YAAM,KAAK,EAAE,IAAI,KAAK,OAAO,WAAW,QAAQ,aAAa,SAAS,iBAAiB,IAAI,IAAI,GAAG,CAAC;AAAA,IACrG;AAAA,EACF;AAEA,WAAS,QACP,KAAa,KAAa,UAAkB,MAC5C,aAAuC,aAAa,SAAiB,GAC/D;AACN,UAAM,KAAK,EAAE,QAAQ,KAAK,QAAQ,KAAK,UAAU,YAAY,aAAa,SAAS,iBAAiB,IAAI,IAAI,IAAI,OAAO,CAAC;AAAA,EAC1H;AAEA,QAAM,UAAU,QAAQ,IAAI;AAC5B,UAAQ,aAAS,4BAAS,QAAQ,GAAG,CAAC;AAEtC,WAAS,KAAK,MAAkB,gBAA+B,MAAY;AACzE,UAAM,IAAI,KAAK;AAEf,QAAI,MAAM,iBAAiB;AACzB,YAAM,WAAW,KAAK,kBAAkB,MAAM;AAC9C,UAAI,UAAU;AACZ,cAAM,WAAW,UAAU,UAAU,MAAM;AAC3C,cAAM,OAAO,KAAK,cAAc,MAAM;AACtC,YAAI;AACJ,YAAI,eAAe;AACjB,oBAAU,QAAQ,eAAe,QAAQ;AACzC,kBAAQ,SAAS,IAAI,QAAQ,MAAM,IAAI;AACvC,kBAAQ,eAAe,SAAS,UAAU,IAAI;AAAA,QAChD,OAAO;AACL,oBAAU,QAAQ,MAAM,QAAQ;AAChC,kBAAQ,SAAS,GAAG,QAAQ,MAAM,IAAI;AACtC,kBAAQ,SAAS,SAAS,YAAY,IAAI;AAAA,QAC5C;AACA,cAAM,OAAO,KAAK,kBAAkB,MAAM;AAC1C,YAAI,KAAM,gBAAe,KAAK,CAAC,SAAS,IAAI,CAAC;AAAA,MAC/C;AACA;AAAA,IACF;AAEA,QAAI,MAAM,iBAAiB,MAAM,eAAe,MAAM,cAAc;AAClE,YAAM,WAAW,KAAK,kBAAkB,MAAM;AAC9C,UAAI,UAAU;AACZ,cAAM,WAAW,UAAU,UAAU,MAAM;AAC3C,cAAM,OAAO,KAAK,cAAc,MAAM;AACtC,cAAM,UAAU,QAAQ,MAAM,QAAQ;AACtC,gBAAQ,SAAS,UAAU,IAAI;AAC/B,gBAAQ,SAAS,SAAS,YAAY,IAAI;AAAA,MAC5C;AACA;AAAA,IACF;AAEA,QAAI,MAAM,aAAa;AACrB,YAAM,WAAW,KAAK,kBAAkB,MAAM;AAC9C,UAAI,UAAyB;AAC7B,UAAI,UAAU;AACZ,cAAM,WAAW,UAAU,UAAU,MAAM,EAAE,KAAK;AAClD,kBAAU,QAAQ,MAAM,QAAQ;AAChC,gBAAQ,SAAS,UAAU,KAAK,cAAc,MAAM,CAAC;AAAA,MACvD;AACA,YAAM,OAAO,KAAK,kBAAkB,MAAM;AAC1C,UAAI,MAAM;AACR,mBAAW,SAAS,KAAK,UAAU;AACjC,eAAK,OAAO,OAAO;AAAA,QACrB;AAAA,MACF;AACA;AAAA,IACF;AAEA,QAAI,MAAM,mBAAmB;AAC3B,YAAM,MAAM,KAAK,kBAAkB,UAAU;AAC7C,UAAI,KAAK;AACP,cAAM,MAAM,UAAU,KAAK,MAAM;AACjC,cAAM,QAAQ,IAAI,MAAM,GAAG,EAAE,CAAC,EAAG,QAAQ,OAAO,EAAE,EAAE,QAAQ,OAAO,EAAE,EAAE,QAAQ,OAAO,EAAE;AACxF,cAAM,aAAa,MAAM,MAAM,IAAI,EAAE,IAAI,EAAG,KAAK;AACjD,YAAI,YAAY;AACd,gBAAM,SAAS,QAAQ,UAAU;AACjC,kBAAQ,SAAS,QAAQ,gBAAgB,KAAK,cAAc,MAAM,CAAC;AAAA,QACrE;AAAA,MACF;AACA;AAAA,IACF;AAEA,eAAW,SAAS,KAAK,UAAU;AACjC,WAAK,OAAO,IAAI;AAAA,IAClB;AAAA,EACF;AAEA,OAAK,IAAI;AAGT,QAAM,aAAa,oBAAI,IAAoB;AAC3C,aAAW,KAAK,OAAO;AACrB,UAAM,aAAa,EAAE,MAAM,QAAQ,WAAW,EAAE,EAAE,QAAQ,OAAO,EAAE;AACnE,eAAW,IAAI,WAAW,YAAY,GAAG,EAAE,EAAE;AAAA,EAC/C;AAEA,QAAM,gBAAgB,oBAAI,IAAY;AAEtC,WAAS,UAAU,MAAkB,WAAyB;AAC5D,QAAI,KAAK,SAAS,gBAAiB;AACnC,QAAI,KAAK,SAAS,mBAAmB;AACnC,YAAM,WAAW,KAAK,kBAAkB,UAAU;AAClD,UAAI,aAA4B;AAChC,UAAI,UAAU;AACZ,YAAI,SAAS,SAAS,cAAc;AAClC,uBAAa,UAAU,UAAU,MAAM;AAAA,QACzC,WAAW,SAAS,SAAS,oBAAoB;AAC/C,gBAAM,QAAQ,SAAS,kBAAkB,OAAO;AAChD,cAAI,MAAO,cAAa,UAAU,OAAO,MAAM;AAAA,QACjD,WAAW,SAAS,SAAS,qBAAqB;AAChD,gBAAM,OAAO,SAAS,kBAAkB,MAAM;AAC9C,cAAI,KAAM,cAAa,UAAU,MAAM,MAAM;AAAA,QAC/C;AAAA,MACF;AACA,UAAI,YAAY;AACd,cAAM,SAAS,WAAW,IAAI,WAAW,YAAY,CAAC;AACtD,YAAI,UAAU,WAAW,WAAW;AAClC,gBAAM,OAAO,GAAG,SAAS,IAAI,MAAM;AACnC,cAAI,CAAC,cAAc,IAAI,IAAI,GAAG;AAC5B,0BAAc,IAAI,IAAI;AACtB,kBAAM,OAAO,KAAK,cAAc,MAAM;AACtC,kBAAM,KAAK;AAAA,cACT,QAAQ;AAAA,cAAW,QAAQ;AAAA,cAAQ,UAAU;AAAA,cAC7C,YAAY;AAAA,cAAa,aAAa;AAAA,cACtC,iBAAiB,IAAI,IAAI;AAAA,cAAI,QAAQ;AAAA,YACvC,CAAC;AAAA,UACH;AAAA,QACF;AAAA,MACF;AAAA,IACF;AACA,eAAW,SAAS,KAAK,UAAU;AACjC,gBAAU,OAAO,SAAS;AAAA,IAC5B;AAAA,EACF;AAEA,aAAW,CAAC,WAAW,QAAQ,KAAK,gBAAgB;AAClD,cAAU,UAAU,SAAS;AAAA,EAC/B;AAEA,QAAM,aAAa,MAAM;AAAA,IAAO,CAAC,MAC/B,QAAQ,IAAI,EAAE,MAAM,MAAM,QAAQ,IAAI,EAAE,MAAM,KAAK,EAAE,aAAa,aAAa,EAAE,aAAa;AAAA,EAChG;AAEA,SAAO,EAAE,OAAO,OAAO,WAAW;AACpC;AAMA,eAAsB,WAAW,UAA6C;AAC5E,QAAM,iBAAiB;AACvB,QAAM,OAAO,MAAM,aAAa,KAAK;AACrC,MAAI,CAAC,MAAM;AACT,WAAO,EAAE,OAAO,CAAC,GAAG,OAAO,CAAC,GAAG,OAAO,gCAAgC;AAAA,EACxE;AAEA,MAAI;AACJ,MAAI;AACJ,MAAI;AACF,UAAM,SAAS,IAAIA,QAAO;AAC1B,WAAO,YAAY,IAAI;AACvB,iBAAS,8BAAa,UAAU,OAAO;AACvC,WAAO,UAAU,QAAQ,MAAM;AAAA,EACjC,SAAS,GAAY;AACnB,WAAO,EAAE,OAAO,CAAC,GAAG,OAAO,CAAC,GAAG,OAAO,OAAO,CAAC,EAAE;AAAA,EAClD;AAEA,QAAM,OAAO,KAAK;AAClB,QAAM,WAAO,4BAAS,cAAU,2BAAQ,QAAQ,CAAC;AACjD,QAAM,UAAU;AAChB,QAAM,QAAqB,CAAC;AAC5B,QAAM,QAAqB,CAAC;AAC5B,QAAM,UAAU,oBAAI,IAAY;AAChC,QAAM,iBAA8C,CAAC;AAErD,WAAS,QAAQ,KAAa,OAAe,MAAoB;AAC/D,QAAI,CAAC,QAAQ,IAAI,GAAG,GAAG;AACrB,cAAQ,IAAI,GAAG;AACf,YAAM,KAAK,EAAE,IAAI,KAAK,OAAO,WAAW,QAAQ,aAAa,SAAS,iBAAiB,IAAI,IAAI,GAAG,CAAC;AAAA,IACrG;AAAA,EACF;AAEA,WAAS,QACP,KAAa,KAAa,UAAkB,MAC5C,aAAuC,aAAa,SAAiB,GAC/D;AACN,UAAM,KAAK,EAAE,QAAQ,KAAK,QAAQ,KAAK,UAAU,YAAY,aAAa,SAAS,iBAAiB,IAAI,IAAI,IAAI,OAAO,CAAC;AAAA,EAC1H;AAEA,QAAM,UAAU,QAAQ,IAAI;AAC5B,UAAQ,aAAS,4BAAS,QAAQ,GAAG,CAAC;AAEtC,WAAS,cAAc,MAAwB;AAC7C,eAAW,SAAS,KAAK,UAAU;AACjC,UAAI,MAAM,SAAS,oBAAoB;AACrC,YAAI,KAAoB;AACxB,YAAI,OAA0B;AAC9B,mBAAW,KAAK,MAAM,UAAU;AAC9B,cAAI,EAAE,SAAS,qBAAsB,MAAK,UAAU,GAAG,MAAM;AAAA,mBACpD,EAAE,SAAS,YAAa,QAAO;AAAA,QAC1C;AACA,aAAK,OAAO,aAAa,OAAO,eAAe,MAAM;AACnD,qBAAW,OAAO,KAAK,UAAU;AAC/B,gBAAI,IAAI,SAAS,oBAAoB,IAAI,SAAS,UAAU;AAC1D,oBAAM,MAAM,UAAU,KAAK,MAAM,EAAE,QAAQ,UAAU,EAAE;AACvD,oBAAM,aAAa,IAAI,MAAM,GAAG,EAAE,IAAI,EAAG,MAAM,GAAG,EAAE,CAAC;AACrD,kBAAI,YAAY;AACd,sBAAM,SAAS,QAAQ,UAAU;AACjC,wBAAQ,SAAS,QAAQ,gBAAgB,KAAK,cAAc,MAAM,CAAC;AAAA,cACrE;AACA;AAAA,YACF;AAAA,UACF;AAAA,QACF;AAAA,MACF,WAAW,MAAM,SAAS,oBAAoB;AAC5C,sBAAc,KAAK;AACnB;AAAA,MACF;AAAA,IACF;AAAA,EACF;AAEA,WAAS,KAAK,MAAkB,kBAAiC,MAAY;AAC3E,UAAM,IAAI,KAAK;AAEf,QAAI,MAAM,wBAAwB;AAChC,YAAM,WAAW,KAAK,kBAAkB,MAAM;AAC9C,UAAI,UAAU;AACZ,cAAM,WAAW,UAAU,UAAU,MAAM;AAC3C,cAAM,OAAO,KAAK,cAAc,MAAM;AACtC,YAAI;AACJ,YAAI,iBAAiB;AACnB,oBAAU,QAAQ,iBAAiB,QAAQ;AAC3C,kBAAQ,SAAS,IAAI,QAAQ,MAAM,IAAI;AACvC,kBAAQ,iBAAiB,SAAS,UAAU,IAAI;AAAA,QAClD,OAAO;AACL,oBAAU,QAAQ,MAAM,QAAQ;AAChC,kBAAQ,SAAS,GAAG,QAAQ,MAAM,IAAI;AACtC,kBAAQ,SAAS,SAAS,YAAY,IAAI;AAAA,QAC5C;AACA,cAAM,OAAO,KAAK,kBAAkB,MAAM;AAC1C,YAAI,KAAM,gBAAe,KAAK,CAAC,SAAS,IAAI,CAAC;AAAA,MAC/C;AACA;AAAA,IACF;AAEA,QAAI,MAAM,wBAAwB;AAChC,UAAI,WAA8B;AAClC,UAAI,YAA+B;AACnC,iBAAW,SAAS,KAAK,UAAU;AACjC,YAAI,MAAM,SAAS,cAAc;AAC/B,qBAAW;AAAA,QACb,WAAW,CAAC,sBAAsB,oBAAoB,qBAAqB,oBAAoB,kBAAkB,EAAE,SAAS,MAAM,IAAI,GAAG;AACvI,sBAAY;AAAA,QACd;AAAA,MACF;AAEA,UAAI,aAAa,UAAU,SAAS,sBAAsB;AACxD,YAAI,UAAU;AACZ,gBAAM,aAAa,UAAU,UAAU,MAAM;AAC7C,gBAAM,OAAO,KAAK,cAAc,MAAM;AACtC,gBAAM,YAAY,QAAQ,MAAM,UAAU;AAC1C,kBAAQ,WAAW,YAAY,IAAI;AACnC,kBAAQ,SAAS,WAAW,YAAY,IAAI;AAC5C,qBAAW,SAAS,UAAU,UAAU;AACtC,iBAAK,OAAO,SAAS;AAAA,UACvB;AAAA,QACF;AACA;AAAA,MACF;AAEA,UAAI,cAAc,UAAU,SAAS,sBAAsB,UAAU,SAAS,sBAAsB;AAClG,YAAI,UAAU;AACZ,gBAAM,WAAW,UAAU,UAAU,MAAM;AAC3C,gBAAM,OAAO,KAAK,cAAc,MAAM;AACtC,gBAAM,UAAU,QAAQ,MAAM,QAAQ;AACtC,kBAAQ,SAAS,UAAU,IAAI;AAC/B,kBAAQ,SAAS,SAAS,YAAY,IAAI;AAAA,QAC5C;AACA;AAAA,MACF;AAEA,UAAI,cAAc,UAAU,SAAS,sBAAsB,UAAU,SAAS,qBAAqB;AACjG,sBAAc,IAAI;AAAA,MACpB;AACA;AAAA,IACF;AAEA,eAAW,SAAS,KAAK,UAAU;AACjC,WAAK,OAAO,eAAe;AAAA,IAC7B;AAAA,EACF;AAEA,OAAK,IAAI;AAGT,QAAM,gBAAgB,oBAAI,IAAY;AAEtC,WAAS,UAAU,MAAkB,WAAyB;AAC5D,QAAI,KAAK,SAAS,uBAAwB;AAC1C,QAAI,KAAK,SAAS,mBAAmB;AACnC,YAAM,KAAK,KAAK,kBAAkB,UAAU;AAC5C,UAAI,IAAI;AACN,cAAM,SAAS,UAAU,IAAI,MAAM,EAAE,MAAM,GAAG,EAAE,IAAI;AACpD,cAAM,SAAS,MAAM;AAAA,UACnB,CAAC,MAAM,EAAE,UAAU,GAAG,MAAM,QAAQ,EAAE,UAAU,IAAI,MAAM;AAAA,QAC5D,GAAG,MAAM;AACT,YAAI,UAAU,WAAW,WAAW;AAClC,gBAAM,OAAO,GAAG,SAAS,IAAI,MAAM;AACnC,cAAI,CAAC,cAAc,IAAI,IAAI,GAAG;AAC5B,0BAAc,IAAI,IAAI;AACtB,oBAAQ,WAAW,QAAQ,SAAS,KAAK,cAAc,MAAM,GAAG,aAAa,CAAG;AAAA,UAClF;AAAA,QACF;AAAA,MACF;AAAA,IACF;AACA,eAAW,SAAS,KAAK,UAAU;AACjC,gBAAU,OAAO,SAAS;AAAA,IAC5B;AAAA,EACF;AAEA,aAAW,CAAC,WAAW,QAAQ,KAAK,gBAAgB;AAClD,cAAU,UAAU,SAAS;AAAA,EAC/B;AAEA,QAAM,aAAa,MAAM;AAAA,IAAO,CAAC,MAC/B,QAAQ,IAAI,EAAE,MAAM,MAAM,QAAQ,IAAI,EAAE,MAAM,KAAK,EAAE,aAAa;AAAA,EACpE;AAEA,SAAO,EAAE,OAAO,OAAO,WAAW;AACpC;AAMA,eAAsB,kBAAkB,UAA6C;AACnF,QAAM,iBAAiB;AACvB,QAAM,OAAO,MAAM,aAAa,YAAY;AAC5C,MAAI,CAAC,MAAM;AACT,WAAO,EAAE,OAAO,CAAC,GAAG,OAAO,CAAC,GAAG,OAAO,uCAAuC;AAAA,EAC/E;AAEA,MAAI;AACJ,MAAI;AACJ,MAAI;AACF,UAAM,SAAS,IAAIA,QAAO;AAC1B,WAAO,YAAY,IAAI;AACvB,iBAAS,8BAAa,UAAU,OAAO;AACvC,WAAO,UAAU,QAAQ,MAAM;AAAA,EACjC,SAAS,GAAY;AACnB,WAAO,EAAE,OAAO,CAAC,GAAG,OAAO,CAAC,GAAG,OAAO,OAAO,CAAC,EAAE;AAAA,EAClD;AAEA,QAAM,OAAO,KAAK;AAClB,QAAM,WAAO,4BAAS,cAAU,2BAAQ,QAAQ,CAAC;AACjD,QAAM,UAAU;AAChB,QAAM,QAAqB,CAAC;AAC5B,QAAM,QAAqB,CAAC;AAC5B,QAAM,UAAU,oBAAI,IAAY;AAChC,QAAM,iBAA8C,CAAC;AAErD,WAAS,QAAQ,KAAa,OAAe,MAAoB;AAC/D,QAAI,CAAC,QAAQ,IAAI,GAAG,GAAG;AACrB,cAAQ,IAAI,GAAG;AACf,YAAM,KAAK,EAAE,IAAI,KAAK,OAAO,WAAW,QAAQ,aAAa,SAAS,iBAAiB,IAAI,IAAI,GAAG,CAAC;AAAA,IACrG;AAAA,EACF;AAEA,WAAS,QACP,KAAa,KAAa,UAAkB,MAC5C,aAAuC,aAAa,SAAiB,GAC/D;AACN,UAAM,KAAK,EAAE,QAAQ,KAAK,QAAQ,KAAK,UAAU,YAAY,aAAa,SAAS,iBAAiB,IAAI,IAAI,IAAI,OAAO,CAAC;AAAA,EAC1H;AAEA,QAAM,UAAU,QAAQ,IAAI;AAC5B,UAAQ,aAAS,4BAAS,QAAQ,GAAG,CAAC;AAEtC,QAAM,WAAW,oBAAI,IAAI;AAAA,IACvB;AAAA,IAAS;AAAA,IAAU;AAAA,IAAM;AAAA,IAAQ;AAAA,IAAU;AAAA,IAAW;AAAA,IACtD;AAAA,IAAS;AAAA,IAAM;AAAA,IAAU;AAAA,IAAO;AAAA,IAAS;AAAA,IAAW;AAAA,IACpD;AAAA,IAAS;AAAA,IAAY;AAAA,IAAQ;AAAA,IAAS;AAAA,IAAS;AAAA,IAAW;AAAA,EAC5D,CAAC;AAED,WAAS,oBAAoB,MAAqC;AAChE,eAAW,SAAS,KAAK,UAAU;AACjC,UAAI,MAAM,SAAS,gBAAgB;AACjC,mBAAW,MAAM,MAAM,UAAU;AAC/B,cAAI,GAAG,SAAS,oBAAqB,QAAO;AAAA,QAC9C;AACA,eAAO;AAAA,MACT;AAAA,IACF;AACA,WAAO;AAAA,EACT;AAEA,WAAS,KAAK,MAAkB,iBAAgC,MAAY;AAC1E,UAAM,IAAI,KAAK;AAEf,QAAI,MAAM,sBAAsB;AAC9B,YAAM,WAAW,KAAK,SAAS,KAAK,CAAC,MAAM,EAAE,SAAS,eAAe,KAAK;AAC1E,UAAI,UAAU;AACZ,cAAM,WAAW,UAAU,UAAU,MAAM;AAC3C,cAAM,OAAO,KAAK,cAAc,MAAM;AACtC,cAAM,UAAU,QAAQ,MAAM,QAAQ;AACtC,gBAAQ,SAAS,GAAG,QAAQ,MAAM,IAAI;AACtC,gBAAQ,SAAS,SAAS,YAAY,IAAI;AAC1C,cAAM,OAAO,oBAAoB,IAAI;AACrC,YAAI,KAAM,gBAAe,KAAK,CAAC,SAAS,IAAI,CAAC;AAAA,MAC/C;AACA;AAAA,IACF;AAEA,QAAI,MAAM,mBAAmB;AAC3B,YAAM,WAAW,KAAK,SAAS,KAAK,CAAC,MAAM,EAAE,SAAS,aAAa,KAAK;AACxE,UAAI,UAAU;AACZ,cAAM,YAAY,UAAU,UAAU,MAAM;AAC5C,cAAM,OAAO,KAAK,cAAc,MAAM;AACtC,cAAM,WAAW,QAAQ,MAAM,SAAS;AACxC,gBAAQ,UAAU,WAAW,IAAI;AACjC,gBAAQ,SAAS,UAAU,YAAY,IAAI;AAC3C,mBAAW,SAAS,KAAK,UAAU;AACjC,eAAK,OAAO,QAAQ;AAAA,QACtB;AAAA,MACF;AACA;AAAA,IACF;AAEA,QAAI,MAAM,2BAA2B;AACnC,YAAM,WAAW,KAAK,SAAS,KAAK,CAAC,MAAM,EAAE,SAAS,aAAa,KAAK;AACxE,UAAI,UAAU;AACZ,cAAM,aAAa,UAAU,UAAU,MAAM;AAC7C,cAAM,OAAO,KAAK,cAAc,MAAM;AACtC,YAAI;AACJ,YAAI,gBAAgB;AAClB,sBAAY,QAAQ,gBAAgB,UAAU;AAC9C,kBAAQ,WAAW,IAAI,UAAU,MAAM,IAAI;AAC3C,kBAAQ,gBAAgB,WAAW,UAAU,IAAI;AAAA,QACnD,OAAO;AACL,sBAAY,QAAQ,MAAM,UAAU;AACpC,kBAAQ,WAAW,GAAG,UAAU,MAAM,IAAI;AAC1C,kBAAQ,SAAS,WAAW,YAAY,IAAI;AAAA,QAC9C;AACA,cAAM,OAAO,oBAAoB,IAAI;AACrC,YAAI,KAAM,gBAAe,KAAK,CAAC,WAAW,IAAI,CAAC;AAAA,MACjD;AACA;AAAA,IACF;AAEA,QAAI,MAAM,WAAW;AACnB,YAAM,cAAc,KAAK,SAAS,KAAK,CAAC,MAAM,EAAE,SAAS,cAAc,KAAK;AAC5E,UAAI,aAAa;AACf,cAAM,UAAU,UAAU,aAAa,MAAM,EAAE,YAAY;AAC3D,YAAI,YAAY,SAAS;AACvB,gBAAM,SAAmB,CAAC;AAC1B,qBAAW,SAAS,KAAK,UAAU;AACjC,gBAAI,MAAM,SAAS,oBAAoB;AACrC,yBAAW,MAAM,MAAM,UAAU;AAC/B,oBAAI,GAAG,SAAS,iBAAiB;AAC/B,yBAAO,KAAK,UAAU,IAAI,MAAM,CAAC;AAAA,gBACnC;AAAA,cACF;AAAA,YACF;AAAA,UACF;AACA,gBAAM,eAAe,OAAO;AAAA,YAC1B,CAAC,OAAO,CAAC,CAAC,aAAa,UAAU,UAAU,EAAE,SAAS,GAAG,YAAY,CAAC;AAAA,UACxE;AACA,cAAI,aAAa,SAAS,GAAG;AAC3B,kBAAM,aAAa,aAAa,aAAa,SAAS,CAAC,EAAG,MAAM,GAAG,EAAE,IAAI;AACzE,oBAAQ,SAAS,QAAQ,UAAU,GAAG,gBAAgB,KAAK,cAAc,MAAM,CAAC;AAAA,UAClF;AAAA,QACF;AAAA,MACF;AACA;AAAA,IACF;AAEA,eAAW,SAAS,KAAK,UAAU;AACjC,WAAK,OAAO,cAAc;AAAA,IAC5B;AAAA,EACF;AAEA,OAAK,IAAI;AAGT,QAAM,aAAa,oBAAI,IAAoB;AAC3C,aAAW,KAAK,OAAO;AACrB,UAAM,aAAa,EAAE,MAAM,QAAQ,WAAW,EAAE,EAAE,QAAQ,OAAO,EAAE;AACnE,eAAW,IAAI,WAAW,YAAY,GAAG,EAAE,EAAE;AAAA,EAC/C;AAEA,QAAM,gBAAgB,oBAAI,IAAY;AAEtC,WAAS,UAAU,MAAkB,WAAyB;AAC5D,QAAI,KAAK,SAAS,wBAAwB,KAAK,SAAS,kBAAmB;AAC3E,QAAI,KAAK,SAAS,WAAW;AAC3B,YAAM,cAAc,KAAK,SAAS,KAAK,CAAC,MAAM,EAAE,SAAS,cAAc,KAAK;AAC5E,UAAI,aAAa;AACf,cAAM,UAAU,UAAU,aAAa,MAAM;AAC7C,YAAI,CAAC,SAAS,IAAI,QAAQ,YAAY,CAAC,GAAG;AACxC,gBAAM,SAAS,WAAW,IAAI,QAAQ,YAAY,CAAC;AACnD,cAAI,UAAU,WAAW,WAAW;AAClC,kBAAM,OAAO,GAAG,SAAS,IAAI,MAAM;AACnC,gBAAI,CAAC,cAAc,IAAI,IAAI,GAAG;AAC5B,4BAAc,IAAI,IAAI;AACtB,sBAAQ,WAAW,QAAQ,SAAS,KAAK,cAAc,MAAM,GAAG,aAAa,CAAG;AAAA,YAClF;AAAA,UACF;AAAA,QACF;AAAA,MACF;AAAA,IACF;AACA,eAAW,SAAS,KAAK,UAAU;AACjC,gBAAU,OAAO,SAAS;AAAA,IAC5B;AAAA,EACF;AAEA,aAAW,CAAC,WAAW,QAAQ,KAAK,gBAAgB;AAClD,cAAU,UAAU,SAAS;AAAA,EAC/B;AAEA,QAAM,aAAa,MAAM;AAAA,IAAO,CAAC,MAC/B,QAAQ,IAAI,EAAE,MAAM,MAAM,QAAQ,IAAI,EAAE,MAAM,KAAK,EAAE,aAAa;AAAA,EACpE;AAEA,SAAO,EAAE,OAAO,OAAO,WAAW;AACpC;AAMA,eAAsB,YAAY,UAA6C;AAC7E,QAAM,iBAAiB;AACvB,QAAM,OAAO,MAAM,aAAa,MAAM;AACtC,MAAI,CAAC,MAAM;AACT,WAAO,EAAE,OAAO,CAAC,GAAG,OAAO,CAAC,GAAG,OAAO,iCAAiC;AAAA,EACzE;AAEA,MAAI;AACJ,MAAI;AACJ,MAAI;AACF,UAAM,SAAS,IAAIA,QAAO;AAC1B,WAAO,YAAY,IAAI;AACvB,iBAAS,8BAAa,UAAU,OAAO;AACvC,WAAO,UAAU,QAAQ,MAAM;AAAA,EACjC,SAAS,GAAY;AACnB,WAAO,EAAE,OAAO,CAAC,GAAG,OAAO,CAAC,GAAG,OAAO,OAAO,CAAC,EAAE;AAAA,EAClD;AAEA,QAAM,OAAO,KAAK;AAClB,QAAM,WAAO,4BAAS,cAAU,2BAAQ,QAAQ,CAAC;AACjD,QAAM,UAAU;AAChB,QAAM,QAAqB,CAAC;AAC5B,QAAM,QAAqB,CAAC;AAC5B,QAAM,UAAU,oBAAI,IAAY;AAChC,QAAM,eAA4C,CAAC;AAEnD,WAAS,QAAQ,KAAa,OAAe,MAAoB;AAC/D,QAAI,CAAC,QAAQ,IAAI,GAAG,GAAG;AACrB,cAAQ,IAAI,GAAG;AACf,YAAM,KAAK,EAAE,IAAI,KAAK,OAAO,WAAW,QAAQ,aAAa,SAAS,iBAAiB,IAAI,IAAI,GAAG,CAAC;AAAA,IACrG;AAAA,EACF;AAEA,WAAS,QACP,KAAa,KAAa,UAAkB,MAC5C,aAAuC,aAAa,SAAiB,GAC/D;AACN,UAAM,KAAK,EAAE,QAAQ,KAAK,QAAQ,KAAK,UAAU,YAAY,aAAa,SAAS,iBAAiB,IAAI,IAAI,IAAI,OAAO,CAAC;AAAA,EAC1H;AAEA,QAAM,UAAU,QAAQ,IAAI;AAC5B,UAAQ,aAAS,4BAAS,QAAQ,GAAG,CAAC;AAEtC,WAAS,MAAM,MAA0B;AACvC,WAAO,OAAO,MAAM,KAAK,YAAY,KAAK,QAAQ;AAAA,EACpD;AAEA,WAAS,KAAK,MAAkB,YAA2B,MAAY;AACrE,UAAM,IAAI,KAAK;AACf,UAAM,OAAO,KAAK,cAAc,MAAM;AAEtC,QAAI,MAAM,mBAAmB;AAC3B,iBAAW,SAAS,KAAK,UAAU;AACjC,YAAI,MAAM,SAAS,qBAAqB;AACtC,gBAAM,MAAM,MAAM,KAAK,EAAE,QAAQ,kBAAkB,EAAE;AACrD,gBAAMC,UAAS,IAAI,MAAM,GAAG,EAAE,IAAI,EAAG,QAAQ,MAAM,EAAE;AACrD,cAAIA,SAAQ;AACV,kBAAM,SAAS,QAAQA,OAAM;AAC7B,oBAAQ,SAAS,QAAQ,WAAW,IAAI;AAAA,UAC1C;AAAA,QACF,WAAW,MAAM,SAAS,kBAAkB;AAC1C,qBAAW,OAAO,MAAM,UAAU;AAChC,gBAAI,IAAI,SAAS,kBAAkB;AACjC,oBAAM,MAAM,MAAM,GAAG;AACrB,oBAAMA,UAAS,IAAI,MAAM,GAAG,EAAE,IAAI,EAAG,QAAQ,MAAM,EAAE;AACrD,kBAAIA,SAAQ;AACV,sBAAM,SAAS,QAAQA,OAAM;AAC7B,wBAAQ,SAAS,QAAQ,WAAW,IAAI;AAAA,cAC1C;AAAA,YACF;AAAA,UACF;AAAA,QACF;AAAA,MACF;AACA;AAAA,IACF;AAEA,QAAI,MAAM,mBAAmB;AAC3B,YAAM,cAAc,KAAK,SAAS,OAAO,CAAC,MAAM,EAAE,SAAS,YAAY;AACvE,UAAI,YAAY,WAAW,GAAG;AAC5B,mBAAW,SAAS,KAAK,SAAU,MAAK,OAAO,SAAS;AACxD;AAAA,MACF;AACA,YAAM,OAAO,MAAM,YAAY,CAAC,CAAE;AAClC,YAAM,SAAS,QAAQ,MAAM,IAAI;AACjC,cAAQ,QAAQ,MAAM,IAAI;AAC1B,cAAQ,SAAS,QAAQ,YAAY,IAAI;AAEzC,UAAI,YAAY;AAChB,iBAAW,SAAS,KAAK,UAAU;AACjC,YAAI,MAAM,SAAS,KAAK;AACtB,sBAAY;AAAA,QACd,WAAW,aAAa,MAAM,SAAS,cAAc;AACnD,gBAAM,WAAW,QAAQ,MAAM,KAAK,CAAC;AACrC,kBAAQ,QAAQ,UAAU,YAAY,IAAI;AAC1C,sBAAY;AAAA,QACd,WAAW,MAAM,SAAS,2BAA2B;AACnD,qBAAW,OAAO,MAAM,UAAU;AAChC,gBAAI,IAAI,SAAS,aAAa;AAC5B,yBAAW,KAAK,IAAI,UAAU;AAC5B,oBAAI,EAAE,SAAS,mBAAmB;AAChC,wBAAM,WAAW,QAAQ,MAAM,CAAC,CAAC;AACjC,0BAAQ,QAAQ,UAAU,WAAW,IAAI;AAAA,gBAC3C;AAAA,cACF;AAAA,YACF;AAAA,UACF;AAAA,QACF,WAAW,MAAM,SAAS,sBAAsB;AAC9C,eAAK,OAAO,MAAM;AAAA,QACpB;AAAA,MACF;AACA;AAAA,IACF;AAEA,QAAI,MAAM,wBAAwB;AAChC,UAAI,OAAsB;AAC1B,iBAAW,SAAS,KAAK,UAAU;AACjC,YAAI,MAAM,SAAS,cAAc;AAAE,iBAAO,MAAM,KAAK;AAAG;AAAA,QAAO;AAAA,MACjE;AACA,UAAI,CAAC,MAAM;AACT,mBAAW,SAAS,KAAK,SAAU,MAAK,OAAO,SAAS;AACxD;AAAA,MACF;AACA,YAAM,UAAU,QAAQ,MAAM,IAAI;AAClC,UAAI,CAAC,QAAQ,IAAI,OAAO,GAAG;AACzB,gBAAQ,SAAS,MAAM,IAAI;AAC3B,gBAAQ,SAAS,SAAS,YAAY,IAAI;AAAA,MAC5C;AACA,iBAAW,SAAS,KAAK,UAAU;AACjC,YAAI,MAAM,SAAS,6BAA6B;AAC9C,qBAAW,OAAO,MAAM,SAAU,MAAK,KAAK,OAAO;AAAA,QACrD;AAAA,MACF;AACA;AAAA,IACF;AAEA,QAAI,MAAM,wBAAwB;AAChC,UAAI,OAAsB;AAC1B,iBAAW,SAAS,KAAK,UAAU;AACjC,YAAI,MAAM,SAAS,cAAc;AAAE,iBAAO,MAAM,KAAK;AAAG;AAAA,QAAO;AAAA,MACjE;AACA,UAAI,MAAM;AACR,cAAM,WAAW,QAAQ,MAAM,IAAI;AACnC,gBAAQ,UAAU,IAAI,IAAI,KAAK,IAAI;AACnC,gBAAQ,SAAS,UAAU,YAAY,IAAI;AAC3C,mBAAW,SAAS,KAAK,SAAU,MAAK,OAAO,QAAQ;AAAA,MACzD;AACA;AAAA,IACF;AAEA,QAAI,MAAM,wBAAwB,MAAM,qBAAqB;AAC3D,YAAM,YAAY,aAAa;AAC/B,YAAM,QAAkB,CAAC;AACzB,iBAAW,SAAS,KAAK,UAAU;AACjC,YAAI,MAAM,SAAS,cAAc;AAC/B,gBAAM,KAAK,MAAM,KAAK,CAAC;AAAA,QACzB;AAAA,MACF;AACA,YAAM,aAAa,MAAM,KAAK,EAAE,KAAK;AACrC,UAAI,YAAY;AACd,cAAM,YAAY,QAAQ,WAAW,UAAU;AAC/C,gBAAQ,WAAW,IAAI,UAAU,IAAI,IAAI;AACzC,gBAAQ,WAAW,WAAW,UAAU,IAAI;AAC5C,YAAI,MAAM,qBAAqB;AAC7B,uBAAa,KAAK,CAAC,WAAW,IAAI,CAAC;AAAA,QACrC;AAAA,MACF;AACA;AAAA,IACF;AAEA,eAAW,SAAS,KAAK,UAAU;AACjC,WAAK,OAAO,SAAS;AAAA,IACvB;AAAA,EACF;AAEA,OAAK,IAAI;AAGT,QAAM,gBAAgB,IAAI,IAAI,MAAM,OAAO,CAAC,MAAM,EAAE,OAAO,OAAO,EAAE,IAAI,CAAC,MAAM,EAAE,EAAE,CAAC;AACpF,QAAM,YAAY,oBAAI,IAAY;AAElC,aAAW,CAAC,WAAW,QAAQ,KAAK,cAAc;AAChD,QAAS,gBAAT,SAAuB,GAAqB;AAC1C,UAAI,EAAE,SAAS,sBAAsB;AACnC,mBAAW,SAAS,EAAE,UAAU;AAC9B,cAAI,MAAM,SAAS,cAAc,MAAM,SAAS,yBAAyB;AACvE,kBAAM,MAAgB,CAAC;AACvB,gBAAI,MAAM,SAAS,YAAY;AAC7B,kBAAI,KAAK,MAAM,KAAK,CAAC;AAAA,YACvB,OAAO;AACL,yBAAW,OAAO,MAAM,UAAU;AAChC,oBAAI,IAAI,SAAS,oBAAoB;AACnC,6BAAW,KAAK,IAAI,UAAU;AAC5B,wBAAI,EAAE,SAAS,WAAY,KAAI,KAAK,MAAM,CAAC,CAAC;AAAA,kBAC9C;AAAA,gBACF;AAAA,cACF;AAAA,YACF;AACA,kBAAM,aAAa,IAAI,KAAK,EAAE;AAC9B,uBAAW,aAAa,eAAe;AACrC,kBAAI,UAAU,SAAS,QAAQ,IAAI,UAAU,EAAE,QAAQ,MAAM,EAAE,CAAC,GAAG;AACjE,sBAAM,OAAO,GAAG,SAAS,IAAI,SAAS;AACtC,oBAAI,CAAC,UAAU,IAAI,IAAI,KAAK,cAAc,WAAW;AACnD,4BAAU,IAAI,IAAI;AAClB,0BAAQ,WAAW,WAAW,SAAS,SAAS,cAAc,MAAM,GAAG,aAAa,CAAG;AAAA,gBACzF;AAAA,cACF;AAAA,YACF;AAAA,UACF;AAAA,QACF;AAAA,MACF;AACA,iBAAW,SAAS,EAAE,UAAU;AAC9B,sBAAc,KAAK;AAAA,MACrB;AAAA,IACF;AACA,kBAAc,QAAQ;AAAA,EACxB;AAEA,SAAO,EAAE,OAAO,OAAO,OAAO,OAAU;AAC1C;AAMA,eAAsB,cAAc,UAA6C;AAC/E,QAAM,iBAAiB;AACvB,QAAM,OAAO,MAAM,aAAa,QAAQ;AACxC,MAAI,CAAC,MAAM;AACT,WAAO,EAAE,OAAO,CAAC,GAAG,OAAO,CAAC,GAAG,OAAO,mCAAmC;AAAA,EAC3E;AAEA,MAAI;AACJ,MAAI;AACJ,MAAI;AACF,UAAM,SAAS,IAAID,QAAO;AAC1B,WAAO,YAAY,IAAI;AACvB,iBAAS,8BAAa,UAAU,OAAO;AACvC,WAAO,UAAU,QAAQ,MAAM;AAAA,EACjC,SAAS,GAAY;AACnB,WAAO,EAAE,OAAO,CAAC,GAAG,OAAO,CAAC,GAAG,OAAO,OAAO,CAAC,EAAE;AAAA,EAClD;AAEA,QAAM,OAAO,KAAK;AAClB,QAAM,WAAO,4BAAS,cAAU,2BAAQ,QAAQ,CAAC;AACjD,QAAM,UAAU;AAChB,QAAM,QAAqB,CAAC;AAC5B,QAAM,QAAqB,CAAC;AAC5B,QAAM,UAAU,oBAAI,IAAY;AAChC,QAAM,iBAA8C,CAAC;AAErD,WAAS,QAAQ,KAAa,OAAe,MAAoB;AAC/D,QAAI,CAAC,QAAQ,IAAI,GAAG,GAAG;AACrB,cAAQ,IAAI,GAAG;AACf,YAAM,KAAK,EAAE,IAAI,KAAK,OAAO,WAAW,QAAQ,aAAa,SAAS,iBAAiB,IAAI,IAAI,GAAG,CAAC;AAAA,IACrG;AAAA,EACF;AAEA,WAAS,QACP,KAAa,KAAa,UAAkB,MAC5C,aAAuC,aAAa,SAAiB,GAC/D;AACN,UAAM,KAAK,EAAE,QAAQ,KAAK,QAAQ,KAAK,UAAU,YAAY,aAAa,SAAS,iBAAiB,IAAI,IAAI,IAAI,OAAO,CAAC;AAAA,EAC1H;AAEA,QAAM,UAAU,QAAQ,IAAI;AAC5B,UAAQ,aAAS,4BAAS,QAAQ,GAAG,CAAC;AAEtC,QAAM,mBAAmB,oBAAI,IAAI,CAAC,SAAS,UAAU,WAAW,KAAK,CAAC;AAEtE,WAAS,aAAa,MAAiC;AACrD,eAAW,SAAS,KAAK,UAAU;AACjC,UAAI,MAAM,SAAS,SAAS;AAC1B,eAAO,OAAO,MAAM,MAAM,YAAY,MAAM,QAAQ;AAAA,MACtD;AAAA,IACF;AACA,WAAO;AAAA,EACT;AAEA,WAAS,KAAK,MAAkB,kBAAiC,MAAY;AAC3E,QAAI,KAAK,SAAS,QAAQ;AACxB,iBAAW,SAAS,KAAK,SAAU,MAAK,OAAO,eAAe;AAC9D;AAAA,IACF;AAEA,QAAI,iBAAoC;AACxC,QAAI,gBAAmC;AACvC,QAAI,cAAiC;AACrC,eAAW,SAAS,KAAK,UAAU;AACjC,UAAI,MAAM,SAAS,aAAc,kBAAiB;AAAA,eACzC,MAAM,SAAS,YAAa,iBAAgB;AAAA,eAC5C,MAAM,SAAS,WAAY,eAAc;AAAA,IACpD;AAEA,QAAI,CAAC,gBAAgB;AACnB,iBAAW,SAAS,KAAK,SAAU,MAAK,OAAO,eAAe;AAC9D;AAAA,IACF;AAEA,UAAM,UAAU,OAAO,MAAM,eAAe,YAAY,eAAe,QAAQ;AAC/E,UAAM,OAAO,KAAK,cAAc,MAAM;AAEtC,QAAI,YAAY,aAAa;AAC3B,YAAM,aAAa,gBAAgB,aAAa,aAAa,IAAI;AACjE,UAAI,CAAC,WAAY;AACjB,YAAM,YAAY,QAAQ,MAAM,UAAU;AAC1C,cAAQ,WAAW,YAAY,IAAI;AACnC,cAAQ,SAAS,WAAW,YAAY,IAAI;AAC5C,UAAI,aAAa;AACf,mBAAW,SAAS,YAAY,SAAU,MAAK,OAAO,SAAS;AAAA,MACjE;AACA;AAAA,IACF;AAEA,QAAI,YAAY,SAAS,YAAY,QAAQ;AAC3C,UAAI,WAA0B;AAC9B,UAAI,eAAe;AACjB,mBAAW,SAAS,cAAc,UAAU;AAC1C,cAAI,MAAM,SAAS,QAAQ;AACzB,uBAAW,OAAO,MAAM,UAAU;AAChC,kBAAI,IAAI,SAAS,cAAc;AAC7B,2BAAW,OAAO,MAAM,IAAI,YAAY,IAAI,QAAQ;AACpD;AAAA,cACF;AAAA,YACF;AAAA,UACF,WAAW,MAAM,SAAS,cAAc;AACtC,uBAAW,OAAO,MAAM,MAAM,YAAY,MAAM,QAAQ;AACxD;AAAA,UACF;AAAA,QACF;AAAA,MACF;AACA,UAAI,CAAC,SAAU;AACf,YAAM,YAAY,mBAAmB;AACrC,YAAM,UAAU,QAAQ,WAAW,QAAQ;AAC3C,cAAQ,SAAS,GAAG,QAAQ,MAAM,IAAI;AACtC,UAAI,iBAAiB;AACnB,gBAAQ,iBAAiB,SAAS,UAAU,IAAI;AAAA,MAClD,OAAO;AACL,gBAAQ,SAAS,SAAS,YAAY,IAAI;AAAA,MAC5C;AACA,UAAI,aAAa;AACf,uBAAe,KAAK,CAAC,SAAS,WAAW,CAAC;AAAA,MAC5C;AACA;AAAA,IACF;AAEA,QAAI,iBAAiB,IAAI,OAAO,KAAK,eAAe;AAClD,YAAM,aAAa,aAAa,aAAa;AAC7C,UAAI,YAAY;AACd,cAAM,SAAS,QAAQ,UAAU;AACjC,gBAAQ,SAAS,QAAQ,WAAW,IAAI;AAAA,MAC1C;AACA;AAAA,IACF;AAEA,eAAW,SAAS,KAAK,SAAU,MAAK,OAAO,eAAe;AAAA,EAChE;AAEA,OAAK,IAAI;AAGT,QAAM,aAAa,oBAAI,IAAoB;AAC3C,aAAW,KAAK,OAAO;AACrB,UAAM,aAAa,EAAE,MAAM,QAAQ,WAAW,EAAE,EAAE,QAAQ,OAAO,EAAE;AACnE,eAAW,IAAI,WAAW,YAAY,GAAG,EAAE,EAAE;AAAA,EAC/C;AAEA,QAAM,gBAAgB,oBAAI,IAAY;AACtC,QAAM,iBAAiB,oBAAI,IAAI;AAAA,IAC7B;AAAA,IAAO;AAAA,IAAQ;AAAA,IAAa;AAAA,IAAY;AAAA,IACxC;AAAA,IAAa;AAAA,IAAe;AAAA,IAAW;AAAA,IACvC;AAAA,IAAS;AAAA,IAAU;AAAA,IAAW;AAAA,IAC9B;AAAA,IAAM;AAAA,IAAU;AAAA,IAAQ;AAAA,IAAQ;AAAA,IAAQ;AAAA,EAC1C,CAAC;AAED,WAAS,UAAU,MAAkB,WAAyB;AAC5D,QAAI,KAAK,SAAS,QAAQ;AACxB,iBAAW,SAAS,KAAK,SAAU,WAAU,OAAO,SAAS;AAC7D;AAAA,IACF;AACA,eAAW,SAAS,KAAK,UAAU;AACjC,UAAI,MAAM,SAAS,cAAc;AAC/B,cAAM,KAAK,OAAO,MAAM,MAAM,YAAY,MAAM,QAAQ;AACxD,YAAI,eAAe,IAAI,EAAE,GAAG;AAC1B,qBAAW,KAAK,KAAK,SAAU,WAAU,GAAG,SAAS;AACrD;AAAA,QACF;AACA;AAAA,MACF;AAAA,IACF;AACA,QAAI,aAA4B;AAChC,eAAW,SAAS,KAAK,UAAU;AACjC,UAAI,MAAM,SAAS,OAAO;AACxB,cAAM,UAAU,OAAO,MAAM,MAAM,YAAY,MAAM,QAAQ;AAC7D,cAAM,QAAQ,QAAQ,QAAQ,OAAO,EAAE,EAAE,MAAM,GAAG;AAClD,YAAI,MAAM,SAAS,EAAG,cAAa,MAAM,MAAM,SAAS,CAAC;AACzD;AAAA,MACF;AACA,UAAI,MAAM,SAAS,cAAc;AAC/B,qBAAa,OAAO,MAAM,MAAM,YAAY,MAAM,QAAQ;AAC1D;AAAA,MACF;AAAA,IACF;AACA,QAAI,YAAY;AACd,YAAM,SAAS,WAAW,IAAI,WAAW,YAAY,CAAC;AACtD,UAAI,UAAU,WAAW,WAAW;AAClC,cAAM,OAAO,GAAG,SAAS,IAAI,MAAM;AACnC,YAAI,CAAC,cAAc,IAAI,IAAI,GAAG;AAC5B,wBAAc,IAAI,IAAI;AACtB,kBAAQ,WAAW,QAAQ,SAAS,KAAK,cAAc,MAAM,GAAG,aAAa,CAAG;AAAA,QAClF;AAAA,MACF;AAAA,IACF;AACA,eAAW,SAAS,KAAK,UAAU;AACjC,gBAAU,OAAO,SAAS;AAAA,IAC5B;AAAA,EACF;AAEA,aAAW,CAAC,WAAW,IAAI,KAAK,gBAAgB;AAC9C,cAAU,MAAM,SAAS;AAAA,EAC3B;AAEA,QAAM,aAAa,MAAM;AAAA,IAAO,CAAC,MAC/B,QAAQ,IAAI,EAAE,MAAM,MAAM,QAAQ,IAAI,EAAE,MAAM,KAAK,EAAE,aAAa;AAAA,EACpE;AAEA,SAAO,EAAE,OAAO,OAAO,YAAY,OAAO,OAAU;AACtD;AAMA,eAAe,yBACb,SACA,OACsB;AACtB,QAAM,iBAAiB;AACvB,QAAM,OAAO,MAAM,aAAa,QAAQ;AACxC,MAAI,CAAC,KAAM,QAAO,CAAC;AAEnB,QAAM,SAAS,IAAIA,QAAO;AAC1B,SAAO,YAAY,IAAI;AAGvB,QAAM,iBAAiB,oBAAI,IAAiC;AAC5D,aAAW,cAAc,SAAS;AAChC,eAAW,QAAQ,WAAW,SAAS,CAAC,GAAG;AACzC,YAAM,MAAM,KAAK,eAAe;AAChC,UAAI,CAAC,IAAK;AACV,YAAM,eAAW,4BAAS,SAAK,2BAAQ,GAAG,CAAC;AAC3C,YAAM,QAAQ,KAAK,SAAS;AAC5B,YAAM,MAAM,KAAK,MAAM;AACvB,UAAI,SAAS,CAAC,MAAM,SAAS,GAAG,KAAK,CAAC,MAAM,SAAS,KAAK,KAAK,CAAC,MAAM,WAAW,GAAG,GAAG;AACrF,YAAI,CAAC,eAAe,IAAI,QAAQ,EAAG,gBAAe,IAAI,UAAU,oBAAI,IAAI,CAAC;AACzE,uBAAe,IAAI,QAAQ,EAAG,IAAI,OAAO,GAAG;AAAA,MAC9C;AAAA,IACF;AAAA,EACF;AAGA,QAAM,WAAwB,CAAC;AAC/B,QAAM,aAAa,oBAAI,IAAoB;AAC3C,aAAW,KAAK,OAAO;AACrB,eAAW,QAAI,4BAAS,OAAG,2BAAQ,CAAC,CAAC,GAAG,CAAC;AAAA,EAC3C;AAEA,WAAS,MAAM,GAAG,MAAM,QAAQ,QAAQ,OAAO;AA0B7C,QAAS,cAAT,SAAqB,MAAwB;AAC3C,UAAI,KAAK,SAAS,yBAAyB;AACzC,YAAI,aAA4B;AAChC,mBAAW,SAAS,KAAK,UAAU;AACjC,cAAI,MAAM,SAAS,mBAAmB;AACpC,uBAAW,OAAO,MAAM,UAAU;AAChC,kBAAI,IAAI,SAAS,eAAe;AAC9B,sBAAM,MAAM,OAAO,MAAM,IAAI,YAAY,IAAI,QAAQ;AACrD,6BAAa,IAAI,MAAM,GAAG,EAAE,IAAI;AAChC;AAAA,cACF;AAAA,YACF;AACA;AAAA,UACF;AACA,cAAI,MAAM,SAAS,iBAAiB,eAAe,MAAM;AACvD,kBAAM,MAAM,OAAO,MAAM,MAAM,YAAY,MAAM,QAAQ;AACzD,yBAAa,IAAI,MAAM,GAAG,EAAE,IAAI;AAAA,UAClC;AAAA,QACF;AAEA,YAAI,CAAC,cAAc,CAAC,eAAe,IAAI,UAAU,EAAG;AAEpD,cAAM,gBAA0B,CAAC;AACjC,YAAI,eAAe;AACnB,mBAAW,SAAS,KAAK,UAAU;AACjC,cAAI,MAAM,SAAS,UAAU;AAC3B,2BAAe;AACf;AAAA,UACF;AACA,cAAI,CAAC,aAAc;AACnB,cAAI,MAAM,SAAS,eAAe;AAChC,0BAAc,KAAK,OAAO,MAAM,MAAM,YAAY,MAAM,QAAQ,CAAC;AAAA,UACnE,WAAW,MAAM,SAAS,kBAAkB;AAC1C,kBAAM,WAAW,MAAM,kBAAkB,MAAM;AAC/C,gBAAI,UAAU;AACZ,4BAAc,KAAK,OAAO,MAAM,SAAS,YAAY,SAAS,QAAQ,CAAC;AAAA,YACzE;AAAA,UACF;AAAA,QACF;AAEA,cAAM,OAAO,KAAK,cAAc,MAAM;AACtC,mBAAW,QAAQ,eAAe;AAChC,gBAAM,SAAS,eAAe,IAAI,UAAU,GAAG,IAAI,IAAI;AACvD,cAAI,QAAQ;AACV,uBAAW,eAAe,cAAc;AACtC,uBAAS,KAAK;AAAA,gBACZ,QAAQ;AAAA,gBAAa,QAAQ;AAAA,gBAAQ,UAAU;AAAA,gBAC/C,YAAY;AAAA,gBAAY,aAAa;AAAA,gBACrC,iBAAiB,IAAI,IAAI;AAAA,gBAAI,QAAQ;AAAA,cACvC,CAAC;AAAA,YACH;AAAA,UACF;AAAA,QACF;AAAA,MACF;AACA,iBAAW,SAAS,KAAK,UAAU;AACjC,oBAAY,KAAK;AAAA,MACnB;AAAA,IACF;AAlFA,UAAM,aAAa,QAAQ,GAAG;AAC9B,UAAM,WAAW,MAAM,GAAG;AAC1B,UAAM,eAAW,4BAAS,cAAU,2BAAQ,QAAQ,CAAC;AACrD,UAAM,UAAU;AAEhB,UAAM,eAAe,WAAW,MAC7B;AAAA,MAAO,CAAC,MACP,EAAE,gBAAgB,WAClB,CAAC,EAAE,MAAM,SAAS,GAAG,KACrB,CAAC,EAAE,MAAM,SAAS,KAAK,KACvB,EAAE,OAAO,QAAQ,QAAQ;AAAA,IAC3B,EACC,IAAI,CAAC,MAAM,EAAE,EAAE;AAElB,QAAI,aAAa,WAAW,EAAG;AAE/B,QAAI;AACJ,QAAI;AACJ,QAAI;AACF,mBAAS,8BAAa,UAAU,OAAO;AACvC,aAAO,UAAU,QAAQ,MAAM;AAAA,IACjC,QAAQ;AACN;AAAA,IACF;AA6DA,gBAAY,KAAK,QAAQ;AAAA,EAC3B;AAEA,SAAO;AACT;AA2DA,eAAsB,uBAAuB,OAAwD;AACnG,QAAM,UAA8B,CAAC;AACrC,QAAM,cAAsC,CAAC;AAG7C,MAAI,OAAO;AACX,MAAI;AACF,QAAI,MAAM,WAAW,GAAG;AACtB,aAAO;AAAA,IACT,WAAW,MAAM,WAAW,GAAG;AAC7B,iBAAO,2BAAQ,MAAM,CAAC,CAAE;AAAA,IAC1B,OAAO;AAEL,YAAM,QAAQ,MAAM,IAAI,CAAC,MAAM,EAAE,MAAM,qBAAG,CAAC;AAC3C,YAAM,SAAS,KAAK,IAAI,GAAG,MAAM,IAAI,CAAC,MAAM,EAAE,MAAM,CAAC;AACrD,UAAI,YAAY;AAChB,eAAS,IAAI,GAAG,IAAI,QAAQ,KAAK;AAC/B,cAAM,gBAAgB,IAAI,IAAI,MAAM,IAAI,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC;AACpD,YAAI,cAAc,SAAS,EAAG;AAAA,YACzB;AAAA,MACP;AACA,aAAO,YAAY,IAAI,MAAM,CAAC,EAAG,MAAM,GAAG,SAAS,EAAE,KAAK,qBAAG,IAAI;AAAA,IACnE;AAAA,EACF,QAAQ;AACN,WAAO;AAAA,EACT;AAEA,QAAM,QAAQ,MAAM;AACpB,QAAM,qBAAqB;AAE3B,WAAS,IAAI,GAAG,IAAI,MAAM,QAAQ,KAAK;AACrC,QAAI,SAAS,sBAAsB,IAAI,uBAAuB,KAAK,IAAI,GAAG;AACxE,cAAQ,OAAO,MAAM,qBAAqB,CAAC,IAAI,KAAK,WAAW,KAAK,MAAM,IAAI,MAAM,KAAK,CAAC;AAAA,CAAM;AAAA,IAClG;AACA,UAAM,WAAW,MAAM,CAAC;AACxB,UAAM,UAAM,2BAAQ,QAAQ;AAC5B,UAAM,YAAY,UAAU,GAAG;AAC/B,QAAI,CAAC,UAAW;AAEhB,UAAM,SAAS,WAAW,UAAU,IAAI;AACxC,QAAI,WAAW,MAAM;AACnB,cAAQ,KAAK,MAAqC;AAClD;AAAA,IACF;AAEA,UAAM,SAAS,MAAM,UAAU,QAAQ;AACvC,QAAI,CAAC,OAAO,OAAO;AACjB,iBAAW,UAAU,QAA8C,IAAI;AAAA,IACzE,OAAO;AACL,kBAAY,KAAK,EAAE,UAAU,OAAO,OAAO,MAAM,CAAC;AAAA,IACpD;AACA,YAAQ,KAAK,MAAM;AAAA,EACrB;AAEA,MAAI,SAAS,oBAAoB;AAC/B,YAAQ,OAAO,MAAM,qBAAqB,KAAK,IAAI,KAAK;AAAA,CAAiB;AAAA,EAC3E;AAEA,QAAM,WAAwB,CAAC;AAC/B,QAAM,WAAwB,CAAC;AAC/B,aAAW,UAAU,SAAS;AAC5B,aAAS,KAAK,GAAI,OAAO,SAAS,CAAC,CAAE;AACrC,aAAS,KAAK,GAAI,OAAO,SAAS,CAAC,CAAE;AAAA,EACvC;AAGA,QAAM,UAAU,MAAM,OAAO,CAAC,UAAM,2BAAQ,CAAC,MAAM,KAAK;AACxD,MAAI,QAAQ,SAAS,GAAG;AACtB,UAAM,YAAY,QAAQ,OAAO,CAAC,IAAI,UAAM,2BAAQ,MAAM,CAAC,CAAE,MAAM,KAAK;AACxE,QAAI;AACF,YAAM,iBAAiB,MAAM,yBAAyB,WAAW,OAAO;AACxE,eAAS,KAAK,GAAG,cAAc;AAAA,IACjC,QAAQ;AAAA,IAER;AAAA,EACF;AAEA,SAAO;AAAA,IACL,YAAY;AAAA,MACV,OAAO;AAAA,MACP,OAAO;AAAA,MACP,cAAc;AAAA,MACd,eAAe;AAAA,IACjB;AAAA,IACA;AAAA,EACF;AACF;AAEA,eAAsB,QAAQ,OAAsC;AAClE,QAAM,EAAE,WAAW,IAAI,MAAM,uBAAuB,KAAK;AACzD,SAAO;AACT;AAmBO,SAAS,aAAa,QAAgB,SAAkD;AAC7F,QAAM,iBAAiB,SAAS,kBAAkB;AAClD,QAAM,eAAW,2BAAQ,MAAM;AAE/B,MAAI;AACF,UAAM,WAAO,2BAAU,QAAQ;AAC/B,QAAI,KAAK,OAAO,EAAG,QAAO,CAAC,QAAQ;AAAA,EACrC,QAAQ;AACN,WAAO,CAAC;AAAA,EACV;AAEA,QAAM,UAAoB,CAAC;AAE3B,WAASE,SAAQ,KAAa,SAA4B;AACxD,QAAI;AACJ,QAAI;AACF,oBAAU,6BAAY,GAAG;AAAA,IAC3B,QAAQ;AACN;AAAA,IACF;AAEA,eAAW,SAAS,SAAS;AAC3B,UAAI,MAAM,WAAW,GAAG,EAAG;AAC3B,YAAM,eAAW,wBAAK,KAAK,KAAK;AAEhC,UAAI;AACJ,UAAI;AACF,mBAAO,2BAAU,QAAQ;AAAA,MAC3B,QAAQ;AACN;AAAA,MACF;AAEA,UAAI,KAAK,eAAe,KAAK,CAAC,eAAgB;AAE9C,UAAI,KAAK,YAAY,KAAM,KAAK,eAAe,KAAK,gBAAiB;AAEnE,YAAI,KAAK,eAAe,GAAG;AACzB,cAAI;AACF,kBAAM,WAAO,8BAAa,QAAQ;AAClC,gBAAI,QAAQ,IAAI,IAAI,EAAG;AACvB,oBAAQ,IAAI,IAAI;AAChB,kBAAM,iBAAa,kCAAa,2BAAQ,QAAQ,CAAC;AACjD,gBAAI,eAAe,QAAQ,WAAW,WAAW,OAAO,qBAAG,EAAG;AAAA,UAChE,QAAQ;AACN;AAAA,UACF;AAAA,QACF;AAGA,cAAM,YAAY,SAAS,MAAM,qBAAG;AACpC,YAAI,UAAU,KAAK,CAAC,SAAS,KAAK,WAAW,GAAG,CAAC,EAAG;AAEpD,QAAAA,SAAQ,UAAU,OAAO;AAAA,MAC3B,WAAW,KAAK,OAAO,GAAG;AACxB,cAAM,UAAM,2BAAQ,KAAK;AACzB,YAAI,YAAY,IAAI,GAAG,GAAG;AACxB,kBAAQ,KAAK,QAAQ;AAAA,QACvB;AAAA,MACF;AAAA,IACF;AAAA,EACF;AAEA,EAAAA,SAAQ,UAAU,oBAAI,IAAY,CAAC;AACnC,SAAO,QAAQ,KAAK;AACtB;AArnGA,IAQAC,iBACAC,mBACA,oBAOA,YAjBA,aAqBMJ,SASF,oBAUE,eAoDA,gBA4gBA,gBAcA,YAcA,YAcA,cAaA,WAeA,aAeA,cAcA,gBAeA,gBAgBA,eAgBA,aAgBA,aAgBA,eAwbA,qBAksDA,WAoJA;AAxiGN;AAAA;AAQA,IAAAG,kBAA+E;AAC/E,IAAAC,oBAA+D;AAC/D,yBAA8B;AAE9B;AAKA,iBAA4B;AAjB5B;AAqBA,IAAMJ,UAC6D,qBACC;AAOpE,IAAI,qBAAqB;AAUzB,IAAM,gBAAgB,iBAAiB;AAoDvC,IAAM,iBAAiB,oBAAI,IAAiC;AA4gB5D,IAAM,iBAAiC,cAAc;AAAA,MACnD,eAAe;AAAA,MACf,UAAU;AAAA,MACV,YAAY,oBAAI,IAAI,CAAC,kBAAkB,CAAC;AAAA,MACxC,eAAe,oBAAI,IAAI,CAAC,qBAAqB,CAAC;AAAA,MAC9C,aAAa,oBAAI,IAAI,CAAC,oBAAoB,uBAAuB,CAAC;AAAA,MAClE,WAAW,oBAAI,IAAI,CAAC,MAAM,CAAC;AAAA,MAC3B,mBAAmB;AAAA,MACnB,uBAAuB,oBAAI,IAAI,CAAC,WAAW,CAAC;AAAA,MAC5C,mBAAmB;AAAA,MACnB,uBAAuB,oBAAI,IAAI,CAAC,qBAAqB,CAAC;AAAA,MACtD,eAAe;AAAA,IACjB,CAAC;AAED,IAAM,aAA6B,cAAc;AAAA,MAC/C,eAAe;AAAA,MACf,UAAU;AAAA,MACV,YAAY,oBAAI,IAAI,CAAC,mBAAmB,CAAC;AAAA,MACzC,eAAe,oBAAI,IAAI,CAAC,wBAAwB,mBAAmB,CAAC;AAAA,MACpE,aAAa,oBAAI,IAAI,CAAC,kBAAkB,CAAC;AAAA,MACzC,WAAW,oBAAI,IAAI,CAAC,iBAAiB,CAAC;AAAA,MACtC,mBAAmB;AAAA,MACnB,uBAAuB,oBAAI,IAAI,CAAC,mBAAmB,CAAC;AAAA,MACpD,mBAAmB;AAAA,MACnB,uBAAuB,oBAAI,IAAI,CAAC,wBAAwB,kBAAkB,mBAAmB,CAAC;AAAA,MAC9F,eAAe;AAAA,IACjB,CAAC;AAED,IAAM,aAA6B,cAAc;AAAA,MAC/C,eAAe;AAAA,MACf,UAAU;AAAA,MACV,YAAY,oBAAI,IAAI,CAAC,mBAAmB,CAAC;AAAA,MACzC,eAAe,oBAAI,IAAI,CAAC,wBAAwB,mBAAmB,CAAC;AAAA,MACpE,aAAa,oBAAI,IAAI,CAAC,kBAAkB,CAAC;AAAA,MACzC,WAAW,oBAAI,IAAI,CAAC,iBAAiB,CAAC;AAAA,MACtC,mBAAmB;AAAA,MACnB,uBAAuB,oBAAI,IAAI,CAAC,mBAAmB,CAAC;AAAA,MACpD,mBAAmB;AAAA,MACnB,uBAAuB,oBAAI,IAAI,CAAC,wBAAwB,kBAAkB,mBAAmB,CAAC;AAAA,MAC9F,eAAe;AAAA,IACjB,CAAC;AAED,IAAM,eAA+B,cAAc;AAAA,MACjD,eAAe;AAAA,MACf,UAAU;AAAA,MACV,YAAY,oBAAI,IAAI,CAAC,qBAAqB,uBAAuB,CAAC;AAAA,MAClE,eAAe,oBAAI,IAAI,CAAC,sBAAsB,yBAAyB,CAAC;AAAA,MACxE,aAAa,oBAAI,IAAI,CAAC,oBAAoB,CAAC;AAAA,MAC3C,WAAW,oBAAI,IAAI,CAAC,mBAAmB,CAAC;AAAA,MACxC,mBAAmB;AAAA,MACnB,uBAAuB,oBAAI,IAAI;AAAA,MAC/B,uBAAuB,oBAAI,IAAI,CAAC,sBAAsB,yBAAyB,CAAC;AAAA,MAChF,eAAe;AAAA,IACjB,CAAC;AAED,IAAM,YAA4B,cAAc;AAAA,MAC9C,eAAe;AAAA,MACf,UAAU;AAAA,MACV,YAAY,oBAAI,IAAI;AAAA,MACpB,eAAe,oBAAI,IAAI,CAAC,qBAAqB,CAAC;AAAA,MAC9C,aAAa,oBAAI,IAAI,CAAC,iBAAiB,CAAC;AAAA,MACxC,WAAW,oBAAI,IAAI,CAAC,iBAAiB,CAAC;AAAA,MACtC,mBAAmB;AAAA,MACnB,uBAAuB,oBAAI,IAAI,CAAC,kBAAkB,CAAC;AAAA,MACnD,mBAAmB;AAAA,MACnB,uBAAuB,oBAAI,IAAI,CAAC,qBAAqB,CAAC;AAAA,MACtD,eAAe;AAAA,MACf,uBAAuB;AAAA,IACzB,CAAC;AAED,IAAM,cAA8B,cAAc;AAAA,MAChD,eAAe;AAAA,MACf,UAAU;AAAA,MACV,YAAY,oBAAI,IAAI,CAAC,iBAAiB,CAAC;AAAA,MACvC,eAAe,oBAAI,IAAI,CAAC,qBAAqB,CAAC;AAAA,MAC9C,aAAa,oBAAI,IAAI,CAAC,iBAAiB,CAAC;AAAA,MACxC,WAAW,oBAAI,IAAI,CAAC,iBAAiB,CAAC;AAAA,MACtC,mBAAmB;AAAA,MACnB,uBAAuB,oBAAI,IAAI,CAAC,oBAAoB,sBAAsB,CAAC;AAAA,MAC3E,mBAAmB;AAAA,MACnB,uBAAuB,oBAAI,IAAI,CAAC,qBAAqB,CAAC;AAAA,MACtD,eAAe;AAAA,MACf,uBAAuB;AAAA,IACzB,CAAC;AAED,IAAM,eAA+B,cAAc;AAAA,MACjD,eAAe;AAAA,MACf,UAAU;AAAA,MACV,YAAY,oBAAI,IAAI,CAAC,OAAO,CAAC;AAAA,MAC7B,eAAe,oBAAI,IAAI,CAAC,UAAU,kBAAkB,CAAC;AAAA,MACrD,aAAa,oBAAI,IAAI;AAAA,MACrB,WAAW,oBAAI,IAAI,CAAC,MAAM,CAAC;AAAA,MAC3B,mBAAmB;AAAA,MACnB,uBAAuB,oBAAI,IAAI;AAAA,MAC/B,wBAAwB,CAAC,YAAY,oBAAoB,YAAY;AAAA,MACrE,wBAAwB,CAAC,gBAAgB;AAAA,MACzC,uBAAuB,oBAAI,IAAI,CAAC,UAAU,kBAAkB,CAAC;AAAA,IAC/D,CAAC;AAED,IAAM,iBAAiC,cAAc;AAAA,MACnD,eAAe;AAAA,MACf,UAAU;AAAA,MACV,YAAY,oBAAI,IAAI,CAAC,qBAAqB,uBAAuB,CAAC;AAAA,MAClE,eAAe,oBAAI,IAAI,CAAC,oBAAoB,CAAC;AAAA,MAC7C,aAAa,oBAAI,IAAI,CAAC,iBAAiB,CAAC;AAAA,MACxC,WAAW,oBAAI,IAAI,CAAC,uBAAuB,CAAC;AAAA,MAC5C,mBAAmB;AAAA,MACnB,uBAAuB,oBAAI,IAAI,CAAC,0BAA0B,CAAC;AAAA,MAC3D,mBAAmB;AAAA,MACnB,wBAAwB,CAAC,kBAAkB;AAAA,MAC3C,uBAAuB,oBAAI,IAAI,CAAC,oBAAoB,CAAC;AAAA,MACrD,eAAe;AAAA,IACjB,CAAC;AAED,IAAM,iBAAiC,cAAc;AAAA,MACnD,eAAe;AAAA,MACf,UAAU;AAAA,MACV,YAAY,oBAAI,IAAI,CAAC,qBAAqB,oBAAoB,CAAC;AAAA,MAC/D,eAAe,oBAAI,IAAI,CAAC,sBAAsB,CAAC;AAAA,MAC/C,aAAa,oBAAI,IAAI,CAAC,eAAe,CAAC;AAAA,MACtC,WAAW,oBAAI,IAAI,CAAC,iBAAiB,CAAC;AAAA,MACtC,mBAAmB;AAAA,MACnB,uBAAuB,oBAAI,IAAI,CAAC,uBAAuB,CAAC;AAAA,MACxD,mBAAmB;AAAA,MACnB,wBAAwB,CAAC,mBAAmB;AAAA,MAC5C,wBAAwB,CAAC,iBAAiB,YAAY;AAAA,MACtD,uBAAuB,oBAAI,IAAI,CAAC,sBAAsB,CAAC;AAAA,MACvD,eAAe;AAAA,IACjB,CAAC;AAED,IAAM,gBAAgC,cAAc;AAAA,MAClD,eAAe;AAAA,MACf,UAAU;AAAA,MACV,YAAY,oBAAI,IAAI,CAAC,oBAAoB,mBAAmB,CAAC;AAAA,MAC7D,eAAe,oBAAI,IAAI,CAAC,qBAAqB,CAAC;AAAA,MAC9C,aAAa,oBAAI,IAAI,CAAC,oBAAoB,CAAC;AAAA,MAC3C,WAAW,oBAAI,IAAI,CAAC,iBAAiB,CAAC;AAAA,MACtC,mBAAmB;AAAA,MACnB,uBAAuB,oBAAI,IAAI,CAAC,kBAAkB,CAAC;AAAA,MACnD,mBAAmB;AAAA,MACnB,wBAAwB,CAAC,YAAY;AAAA,MACrC,wBAAwB,CAAC,eAAe;AAAA,MACxC,uBAAuB,oBAAI,IAAI,CAAC,qBAAqB,CAAC;AAAA,MACtD,eAAe;AAAA,IACjB,CAAC;AAED,IAAM,cAA8B,cAAc;AAAA,MAChD,eAAe;AAAA,MACf,UAAU;AAAA,MACV,YAAY,oBAAI,IAAI,CAAC,mBAAmB,CAAC;AAAA,MACzC,eAAe,oBAAI,IAAI,CAAC,uBAAuB,oBAAoB,CAAC;AAAA,MACpE,aAAa,oBAAI,IAAI,CAAC,sBAAsB,CAAC;AAAA,MAC7C,WAAW,oBAAI,IAAI,CAAC,4BAA4B,wBAAwB,CAAC;AAAA,MACzE,mBAAmB;AAAA,MACnB,uBAAuB,oBAAI,IAAI,CAAC,wBAAwB,CAAC;AAAA,MACzD,mBAAmB;AAAA,MACnB,wBAAwB,CAAC,MAAM;AAAA,MAC/B,wBAAwB,CAAC,oBAAoB,oBAAoB;AAAA,MACjE,uBAAuB,oBAAI,IAAI,CAAC,uBAAuB,oBAAoB,CAAC;AAAA,MAC5E,eAAe;AAAA,IACjB,CAAC;AAED,IAAM,cAA8B,cAAc;AAAA,MAChD,eAAe;AAAA,MACf,UAAU;AAAA,MACV,YAAY,oBAAI,IAAI;AAAA,MACpB,eAAe,oBAAI,IAAI,CAAC,sBAAsB,CAAC;AAAA,MAC/C,aAAa,oBAAI,IAAI,CAAC,sBAAsB,CAAC;AAAA,MAC7C,WAAW,oBAAI,IAAI,CAAC,eAAe,CAAC;AAAA,MACpC,mBAAmB;AAAA,MACnB,uBAAuB,oBAAI,IAAI,CAAC,yBAAyB,CAAC;AAAA,MAC1D,mBAAmB;AAAA,MACnB,wBAAwB,CAAC,cAAc,yBAAyB;AAAA,MAChE,wBAAwB,CAAC,OAAO;AAAA,MAChC,uBAAuB,oBAAI,IAAI,CAAC,sBAAsB,CAAC;AAAA,MACvD,eAAe;AAAA,IACjB,CAAC;AAED,IAAM,gBAAgC,cAAc;AAAA,MAClD,eAAe;AAAA,MACf,UAAU;AAAA,MACV,YAAY,oBAAI,IAAI,CAAC,qBAAqB,sBAAsB,CAAC;AAAA,MACjE,eAAe,oBAAI,IAAI,CAAC,wBAAwB,oBAAoB,sBAAsB,uBAAuB,CAAC;AAAA,MAClH,aAAa,oBAAI,IAAI,CAAC,oBAAoB,CAAC;AAAA,MAC3C,WAAW,oBAAI,IAAI,CAAC,iBAAiB,CAAC;AAAA,MACtC,mBAAmB;AAAA,MACnB,uBAAuB,oBAAI,IAAI,CAAC,uBAAuB,CAAC;AAAA,MACxD,mBAAmB;AAAA,MACnB,wBAAwB,CAAC,qBAAqB,mBAAmB,WAAW;AAAA,MAC5E,wBAAwB,CAAC,cAAc,iBAAiB,iBAAiB,iBAAiB;AAAA,MAC1F,uBAAuB,oBAAI,IAAI,CAAC,wBAAwB,oBAAoB,sBAAsB,uBAAuB,CAAC;AAAA,MAC1H,eAAe;AAAA,IACjB,CAAC;AA0aD,IAAM,sBAAsB;AAAA,MAC1B;AAAA,MAAW;AAAA,MAAgB;AAAA,MAAW;AAAA,MACtC;AAAA,MAAgB;AAAA,MAAW;AAAA,IAC7B;AA+rDA,IAAM,YAAyC;AAAA,MAC7C,OAAO;AAAA,MACP,OAAO;AAAA,MACP,QAAQ;AAAA,MACR,OAAO;AAAA,MACP,QAAQ;AAAA,MACR,OAAO;AAAA,MACP,OAAO;AAAA,MACP,SAAS;AAAA,MACT,MAAM;AAAA,MACN,MAAM;AAAA,MACN,QAAQ;AAAA,MACR,OAAO;AAAA,MACP,QAAQ;AAAA,MACR,QAAQ;AAAA,MACR,OAAO;AAAA,MACP,OAAO;AAAA,MACP,OAAO;AAAA,MACP,QAAQ;AAAA,MACR,UAAU;AAAA,MACV,QAAQ;AAAA,MACR,UAAU;AAAA,MACV,QAAQ;AAAA,MACR,QAAQ;AAAA,MACR,QAAQ;AAAA,MACR,QAAQ;AAAA,MACR,OAAO;AAAA,MACP,QAAQ;AAAA,MACR,MAAM;AAAA,MACN,OAAO;AAAA,MACP,OAAO;AAAA,IACT;AAqHA,IAAM,cAAc,oBAAI,IAAI;AAAA,MAC1B;AAAA,MAAO;AAAA,MAAO;AAAA,MAAO;AAAA,MAAQ;AAAA,MAAO;AAAA,MACpC;AAAA,MAAS;AAAA,MAAM;AAAA,MAAM;AAAA,MAAQ;AAAA,MAAO;AAAA,MAAQ;AAAA,MAC5C;AAAA,MAAO;AAAA,MAAO;AAAA,MAAO;AAAA,MAAQ;AAAA,MAAU;AAAA,MAAQ;AAAA,MAC/C;AAAA,MAAQ;AAAA,MAAQ;AAAA,MAAQ;AAAA,MACxB;AAAA,MAAM;AAAA,MACN;AAAA,MAAO;AAAA,MAAQ;AAAA,MAAO;AAAA,IACxB,CAAC;AAAA;AAAA;;;AC/iGD;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAIA;AACA;AACA;AACA;AACA;AACA;AACA;;;ACNA,IAAAK,kBAAyC;AACzC,IAAAC,oBAAqB;AAGrB;AACA;AAEA,SAAS,aAAa,MAAsB;AAC1C,SAAO,KACJ,QAAQ,SAAS,GAAG,EACpB,QAAQ,OAAO,GAAG,EAClB,QAAQ,OAAO,GAAG,EAClB,QAAQ,OAAO,GAAG,EAClB,QAAQ,MAAM,GAAG,EACjB,QAAQ,MAAM,GAAG;AACtB;AAEA,SAAS,oBACP,GACA,OACA,QACA,QACoB;AACpB,QAAM,WAAW,aAAa,MAAM;AACpC,QAAM,SAAS,oBAAI,IAAoB;AACvC,aAAW,OAAO,OAAO;AACvB,eAAW,YAAY,mBAAmB,GAAG,GAAG,GAAG;AACjD,YAAM,OAAO,EAAE,iBAAiB,UAAU,WAAW;AACrD,UAAI,SAAS,UAAa,SAAS,QAAQ;AACzC,cAAM,QAAQ,SAAS,IAAI,IAAI,KAAK,aAAa,IAAI;AACrD,eAAO,IAAI,QAAQ,OAAO,IAAI,KAAK,KAAK,KAAK,CAAC;AAAA,MAChD;AAAA,IACF;AAAA,EACF;AACA,SAAO,CAAC,GAAG,OAAO,QAAQ,CAAC,EAAE,KAAK,CAAC,GAAG,MAAM,EAAE,CAAC,IAAI,EAAE,CAAC,CAAC;AACzD;AAEA,SAAS,iBACP,GACA,KACA,OACA,OACA,QACA,UACQ;AACR,QAAM,WAAW,CAAC,GAAG,KAAK,EAAE,KAAK,CAAC,GAAG,MAAM,EAAE,OAAO,CAAC,IAAI,EAAE,OAAO,CAAC,CAAC,EAAE,MAAM,GAAG,EAAE;AACjF,QAAM,QAAQ,oBAAoB,GAAG,OAAO,KAAK,MAAM;AAEvD,QAAM,aAAqC,EAAE,WAAW,GAAG,UAAU,GAAG,WAAW,EAAE;AACrF,aAAW,OAAO,OAAO;AACvB,MAAE,YAAY,KAAK,CAAC,GAAG,SAAS;AAC9B,YAAM,OAAQ,KAAK,cAAyB;AAC5C,iBAAW,IAAI,KAAK,WAAW,IAAI,KAAK,KAAK;AAAA,IAC/C,CAAC;AAAA,EACH;AACA,QAAM,aAAa,OAAO,OAAO,UAAU,EAAE,OAAO,CAAC,GAAG,MAAM,IAAI,GAAG,CAAC,KAAK;AAE3E,QAAM,UAAU,CAAC,GAAG,IAAI,IAAI,MAAM,IAAI,CAAC,MAAO,EAAE,iBAAiB,GAAG,aAAa,KAAgB,EAAE,EAAE,OAAO,OAAO,CAAC,CAAC,EAAE,KAAK;AAE5H,QAAM,QAAkB,CAAC;AACzB,QAAM,KAAK,KAAK,KAAK,IAAI,EAAE;AAE3B,QAAM,YAAY,CAAC,GAAG,MAAM,MAAM,QAAQ;AAC1C,MAAI,aAAa,OAAW,WAAU,KAAK,YAAY,SAAS,QAAQ,CAAC,CAAC,EAAE;AAC5E,QAAM,KAAK,KAAK,UAAU,KAAK,QAAK,CAAC,IAAI,EAAE;AAE3C,QAAM,KAAK,mBAAmB,EAAE;AAChC,aAAW,OAAO,UAAU;AAC1B,UAAM,IAAI,EAAE,kBAAkB,GAAG;AACjC,UAAM,YAAa,EAAE,SAAoB;AACzC,UAAM,MAAO,EAAE,eAA0B;AACzC,UAAM,SAAS,EAAE,OAAO,GAAG;AAC3B,UAAM,SAAS,MAAM,aAAQ,GAAG,OAAO;AACvC,UAAM,KAAK,OAAO,SAAS,OAAO,MAAM,gBAAgB,MAAM,EAAE;AAAA,EAClE;AACA,QAAM,YAAY,MAAM,SAAS,SAAS;AAC1C,MAAI,YAAY,EAAG,OAAM,KAAK,cAAc,SAAS,gCAAgC;AACrF,QAAM,KAAK,EAAE;AAEb,QAAM,KAAK,oBAAoB,EAAE;AACjC,MAAI,MAAM,SAAS,GAAG;AACpB,eAAW,CAAC,YAAY,KAAK,KAAK,MAAM,MAAM,GAAG,EAAE,GAAG;AACpD,YAAM,KAAK,OAAO,UAAU,OAAO,KAAK,sBAAsB;AAAA,IAChE;AAAA,EACF,OAAO;AACL,UAAM,KAAK,kDAAkD;AAAA,EAC/D;AACA,QAAM,KAAK,EAAE;AAEb,MAAI,QAAQ,SAAS,GAAG;AACtB,UAAM,KAAK,mBAAmB,EAAE;AAChC,eAAW,OAAO,QAAQ,MAAM,GAAG,EAAE,GAAG;AACtC,YAAM,KAAK,OAAO,GAAG,IAAI;AAAA,IAC3B;AACA,UAAM,KAAK,EAAE;AAAA,EACf;AAEA,QAAM,KAAK,kBAAkB,EAAE;AAC/B,aAAW,QAAQ,CAAC,aAAa,YAAY,WAAW,GAAG;AACzD,UAAM,IAAI,WAAW,IAAI,KAAK;AAC9B,UAAM,MAAM,KAAK,MAAO,IAAI,aAAc,GAAG;AAC7C,UAAM,KAAK,KAAK,IAAI,KAAK,CAAC,KAAK,GAAG,IAAI;AAAA,EACxC;AACA,QAAM,KAAK,EAAE;AAEb,QAAM,KAAK,OAAO,IAAI,mEAAmE;AACzF,SAAO,MAAM,KAAK,IAAI;AACxB;AAEA,SAAS,eAAe,GAAU,KAAa,QAAqC;AAClF,QAAM,IAAI,EAAE,kBAAkB,GAAG;AACjC,QAAM,YAAa,EAAE,SAAoB;AACzC,QAAM,MAAO,EAAE,eAA0B;AACzC,QAAM,MAAM,EAAE;AACd,QAAMC,iBAAgB,QAAQ,SAAa,OAAO,IAAI,GAAG,KAAK,aAAa,GAAG,KAAM;AAEpF,QAAM,QAAkB,CAAC;AACzB,QAAM,KAAK,KAAK,SAAS,IAAI,EAAE;AAC/B,QAAM,KAAK,mBAAgB,EAAE,OAAO,GAAG,CAAC,uBAAoB,GAAG,MAAM,EAAE;AAEvE,MAAIA,gBAAe;AACjB,UAAM,KAAK,oBAAoBA,cAAa,MAAM,EAAE;AAAA,EACtD;AAEA,QAAM,aAAa,oBAAI,IAAsB;AAC7C,QAAM,YAAY,mBAAmB,GAAG,GAAG,EAAE,KAAK,CAAC,GAAG,MAAM,EAAE,OAAO,CAAC,IAAI,EAAE,OAAO,CAAC,CAAC;AACrF,aAAW,YAAY,WAAW;AAChC,UAAM,KAAK,EAAE,kBAAkB,EAAE,KAAK,KAAK,QAAQ,CAAE;AACrD,UAAM,MAAO,GAAG,YAAuB;AACvC,UAAM,gBAAiB,EAAE,iBAAiB,UAAU,OAAO,KAAgB;AAC3E,UAAM,OAAQ,GAAG,cAAyB;AAC1C,UAAM,UAAU,OAAO,MAAM,IAAI,OAAO;AACxC,QAAI,CAAC,WAAW,IAAI,GAAG,EAAG,YAAW,IAAI,KAAK,CAAC,CAAC;AAChD,eAAW,IAAI,GAAG,EAAG,KAAK,KAAK,aAAa,KAAK,OAAO,EAAE;AAAA,EAC5D;AAEA,QAAM,KAAK,8BAA8B,EAAE;AAC3C,aAAW,CAAC,KAAK,OAAO,KAAK,CAAC,GAAG,WAAW,QAAQ,CAAC,EAAE,KAAK,GAAG;AAC7D,UAAM,KAAK,OAAO,GAAG,EAAE;AACvB,eAAW,KAAK,QAAQ,MAAM,GAAG,EAAE,GAAG;AACpC,YAAM,KAAK,KAAK,CAAC,EAAE;AAAA,IACrB;AACA,UAAM,KAAK,EAAE;AAAA,EACf;AAEA,QAAM,KAAK,OAAO,IAAI,mEAAmE;AACzF,SAAO,MAAM,KAAK,IAAI;AACxB;AAEA,SAAS,QACP,aACA,QACA,cACA,YACA,YACQ;AACR,QAAM,QAAkB;AAAA,IACtB;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA,KAAK,UAAU,eAAY,UAAU,eAAY,YAAY,IAAI;AAAA,IACjE;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,EACF;AAEA,QAAM,SAAS,CAAC,GAAG,YAAY,QAAQ,CAAC,EAAE,KAAK,CAAC,GAAG,MAAM,EAAE,CAAC,EAAE,SAAS,EAAE,CAAC,EAAE,MAAM;AAClF,aAAW,CAAC,KAAK,KAAK,KAAK,QAAQ;AACjC,UAAM,QAAQ,OAAO,IAAI,GAAG,KAAK,aAAa,GAAG;AACjD,UAAM,KAAK,OAAO,KAAK,aAAQ,MAAM,MAAM,QAAQ;AAAA,EACrD;AACA,QAAM,KAAK,EAAE;AAEb,MAAI,aAAa,SAAS,GAAG;AAC3B,UAAM,KAAK,gBAAgB,kEAA6D,EAAE;AAC1F,eAAW,QAAQ,cAAc;AAC/B,YAAM,KAAK,OAAO,KAAK,KAAK,aAAQ,KAAK,KAAK,cAAc;AAAA,IAC9D;AACA,UAAM,KAAK,EAAE;AAAA,EACf;AAEA,QAAM;AAAA,IACJ;AAAA,IACA;AAAA,IACA;AAAA,EACF;AACA,SAAO,MAAM,KAAK,IAAI;AACxB;AAEO,SAAS,OACd,GACA,aACA,WACA,SAKQ;AACR,QAAM,eAAe,aAAa,WAAW;AAC7C,iCAAU,WAAW,EAAE,WAAW,KAAK,CAAC;AAExC,QAAM,SAAS,SAAS,kBACpB,aAAa,QAAQ,eAAe,IACpC,IAAI,IAAI,CAAC,GAAG,aAAa,KAAK,CAAC,EAAE,IAAI,CAAC,QAAQ,CAAC,KAAK,aAAa,GAAG,EAAE,CAAC,CAAC;AAC5E,QAAM,WAAW,aAAa,SAAS,QAAQ;AAC/C,QAAM,eAAe,SAAS,gBAAgB,CAAC;AAE/C,MAAI,QAAQ;AAGZ,aAAW,CAAC,KAAK,KAAK,KAAK,cAAc;AACvC,UAAM,QAAQ,OAAO,IAAI,GAAG,KAAK,aAAa,GAAG;AACjD,UAAM,UAAU,iBAAiB,GAAG,KAAK,OAAO,OAAO,QAAQ,SAAS,IAAI,GAAG,CAAC;AAChF,2CAAc,wBAAK,WAAW,GAAG,aAAa,KAAK,CAAC,KAAK,GAAG,OAAO;AACnE;AAAA,EACF;AAGA,aAAW,YAAY,cAAc;AACnC,UAAM,MAAM,SAAS;AACrB,QAAI,OAAO,EAAE,QAAQ,GAAG,GAAG;AACzB,YAAM,UAAU,eAAe,GAAG,KAAK,MAAM;AAC7C,6CAAc,wBAAK,WAAW,GAAG,aAAa,SAAS,KAAK,CAAC,KAAK,GAAG,OAAO;AAC5E;AAAA,IACF;AAAA,EACF;AAGA;AAAA,QACE,wBAAK,WAAW,UAAU;AAAA,IAC1B,QAAQ,cAAc,QAAQ,cAAc,EAAE,OAAO,EAAE,IAAI;AAAA,EAC7D;AAEA,SAAO;AACT;;;ADvOA;AACA;AACA;AACA;;;AEZA,IAAAC,kBAAyC;AAEzC;AAGA,IAAM,kBAAkB;AAExB,SAAS,eAAe,MAAsB;AAC5C,SAAO,KAAK,IAAI,GAAG,KAAK,MAAM,KAAK,SAAS,eAAe,CAAC;AAC9D;AAEA,SAAS,oBAAoB,GAAU,UAAkB,QAAgB,GAAW;AAClF,QAAM,QAAQ,SAAS,YAAY,EAAE,MAAM,KAAK,EAAE,OAAO,CAAC,MAAM,EAAE,SAAS,CAAC;AAC5E,QAAM,SAA6B,CAAC;AACpC,IAAE,YAAY,CAAC,KAAK,SAAS;AAC3B,UAAM,SAAU,KAAK,SAAoB,IAAI,YAAY;AACzD,UAAM,QAAQ,MAAM,OAAO,CAAC,MAAM,MAAM,SAAS,CAAC,CAAC,EAAE;AACrD,QAAI,QAAQ,EAAG,QAAO,KAAK,CAAC,OAAO,GAAG,CAAC;AAAA,EACzC,CAAC;AACD,SAAO,KAAK,CAAC,GAAG,MAAM,EAAE,CAAC,IAAI,EAAE,CAAC,CAAC;AACjC,QAAM,aAAa,OAAO,MAAM,GAAG,CAAC,EAAE,IAAI,CAAC,CAAC,EAAE,GAAG,MAAM,GAAG;AAC1D,MAAI,WAAW,WAAW,EAAG,QAAO;AAEpC,QAAM,UAAU,IAAI,IAAI,UAAU;AAClC,MAAI,WAAW,IAAI,IAAI,UAAU;AACjC,QAAM,YAAgC,CAAC;AAEvC,WAAS,IAAI,GAAG,IAAI,OAAO,KAAK;AAC9B,UAAM,eAAe,oBAAI,IAAY;AACrC,eAAW,KAAK,UAAU;AACxB,+BAAyB,GAAG,GAAG,CAAC,aAAa;AAC3C,YAAI,CAAC,QAAQ,IAAI,QAAQ,GAAG;AAC1B,uBAAa,IAAI,QAAQ;AACzB,oBAAU,KAAK,CAAC,GAAG,QAAQ,CAAC;AAAA,QAC9B;AAAA,MACF,CAAC;AAAA,IACH;AACA,eAAW,KAAK,aAAc,SAAQ,IAAI,CAAC;AAC3C,eAAW;AAAA,EACb;AAEA,QAAM,QAAkB,CAAC;AACzB,aAAW,OAAO,SAAS;AACzB,UAAM,IAAI,EAAE,kBAAkB,GAAG;AACjC,UAAM,KAAK,QAAQ,EAAE,SAAS,GAAG,QAAQ,EAAE,eAAe,EAAE,QAAQ,EAAE,mBAAmB,EAAE,EAAE;AAAA,EAC/F;AACA,aAAW,CAAC,GAAG,CAAC,KAAK,WAAW;AAC9B,QAAI,QAAQ,IAAI,CAAC,KAAK,QAAQ,IAAI,CAAC,GAAG;AACpC,YAAM,OAAO,EAAE,KAAK,GAAG,CAAC;AACxB,UAAI,MAAM;AACR,cAAM,IAAI,EAAE,kBAAkB,IAAI;AAClC,cAAM,KAAK,QAAQ,EAAE,iBAAiB,GAAG,OAAO,KAAK,CAAC,MAAM,EAAE,YAAY,EAAE,OAAO,EAAE,iBAAiB,GAAG,OAAO,KAAK,CAAC,EAAE;AAAA,MAC1H;AAAA,IACF;AAAA,EACF;AAEA,SAAO,eAAe,MAAM,KAAK,IAAI,CAAC;AACxC;AAEA,IAAM,mBAAmB;AAAA,EACvB;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AACF;AAOA,SAAS,UAAU,WAA0B;AAC3C,QAAM,MAAM,KAAK,UAAM,8BAAa,WAAW,OAAO,CAAC;AACvD,SAAO,kBAAkB,GAAG;AAC9B;AAEO,SAAS,aACd,YAAoB,2BACpB,sBACA,WACiB;AACjB,QAAM,UAAU,OAAO,yBAAyB,WAC5C,EAAE,aAAa,sBAAsB,UAAU,IAC9C,wBAAwB,CAAC;AAE9B,MAAI,KAAC,4BAAW,SAAS,GAAG;AAC1B,WAAO,EAAE,OAAO,yBAAyB,SAAS,2BAA2B;AAAA,EAC/E;AAEA,QAAM,IAAI,UAAU,SAAS;AAE7B,QAAM,cAAc,QAAQ,eAAgB,EAAE,QAAQ;AAEtD,MAAI,gBAAgB,QAAW;AAC7B,WAAO,EAAE,OAAO,mCAAmC;AAAA,EACrD;AAEA,QAAM,eAAe,KAAK,MAAO,cAAc,MAAO,EAAE;AACxD,QAAM,KAAK,QAAQ,aAAa;AAChC,QAAM,cAAoF,CAAC;AAE3F,aAAW,KAAK,IAAI;AAClB,UAAM,KAAK,oBAAoB,GAAG,CAAC;AACnC,QAAI,KAAK,GAAG;AACV,kBAAY,KAAK;AAAA,QACf,UAAU;AAAA,QACV,cAAc;AAAA,QACd,WAAW,KAAK,MAAO,eAAe,KAAM,EAAE,IAAI;AAAA,MACpD,CAAC;AAAA,IACH;AAAA,EACF;AAEA,MAAI,YAAY,WAAW,GAAG;AAC5B,WAAO,EAAE,OAAO,uEAAuE;AAAA,EACzF;AAEA,QAAM,iBAAiB,KAAK;AAAA,IAC1B,YAAY,OAAO,CAAC,GAAG,MAAM,IAAI,EAAE,cAAc,CAAC,IAAI,YAAY;AAAA,EACpE;AACA,QAAM,iBAAiB,iBAAiB,IAAI,KAAK,MAAO,eAAe,iBAAkB,EAAE,IAAI,KAAK;AAEpG,SAAO;AAAA,IACL,eAAe;AAAA,IACf,cAAc;AAAA,IACd,OAAO,EAAE;AAAA,IACT,OAAO,EAAE;AAAA,IACT,kBAAkB;AAAA,IAClB,iBAAiB;AAAA,IACjB,cAAc;AAAA,EAChB;AACF;AAEO,SAAS,eAAe,QAA+B;AAC5D,MAAI,OAAO,OAAO;AAChB,YAAQ,IAAI,oBAAoB,OAAO,KAAK,EAAE;AAC9C;AAAA,EACF;AAEA,UAAQ,IAAI;AAAA,mCAAsC;AAClD,UAAQ,IAAI,SAAI,OAAO,EAAE,CAAC;AAC1B,UAAQ,IAAI,sBAAsB,OAAO,aAAc,eAAe,CAAC,kBAAa,OAAO,cAAe,eAAe,CAAC,iBAAiB;AAC3I,UAAQ,IAAI,sBAAsB,OAAO,MAAO,eAAe,CAAC,WAAW,OAAO,MAAO,eAAe,CAAC,QAAQ;AACjH,UAAQ,IAAI,uBAAuB,OAAO,iBAAkB,eAAe,CAAC,SAAS;AACrF,UAAQ,IAAI,sBAAsB,OAAO,eAAe,0BAA0B;AAClF,UAAQ,IAAI;AAAA,gBAAmB;AAC/B,aAAW,KAAK,OAAO,cAAe;AACpC,YAAQ,IAAI,QAAQ,EAAE,SAAS,MAAM,EAAE,SAAS,MAAM,GAAG,EAAE,CAAC,EAAE;AAAA,EAChE;AACA,UAAQ,IAAI;AACd;;;ACnJA,IAAAC,kBAAqD;AACrD,IAAAC,oBAA0D;AAC1D;;;ACRA,mBAA8B;AAC9B,IAAAC,sBAA2B;AAC3B,IAAAC,kBAUO;AACP,qBAA0C;AAC1C,IAAAC,oBAA0D;AAC1D,yBAAyB;AACzB,sBAAyB;AAGzB,IAAM,eAAe,CAAC,WAAW,YAAY,MAAM;AACnD,IAAM,0BAA0B,CAAC,QAAQ,SAAS,QAAQ,QAAQ,QAAQ,OAAO;AACjF,IAAM,gBAAgB;AACtB,IAAM,kBAAkB;AACxB,IAAM,kBAAkB;AACxB,IAAM,sBACJ;AACF,IAAM,oBAAoB;AAC1B,IAAM,mBAAmB,oBAAI,IAAI;AAAA,EAC/B;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AACF,CAAC;AAED,IAAM,gBAAwC;AAAA,EAC5C,OAAO;AACT;AAqCA,IAAM,kBAAkB,oBAAI,IAAuC;AACnE,IAAI,sBAAoD;AAExD,SAAS,WACP,SACA,MACA,SACuC;AACvC,QAAM,SAAsB,uBAAU,SAAS,MAAM;AAAA,IACnD,UAAU;AAAA,IACV,GAAG;AAAA,EACL,CAAC;AACD,MAAI,OAAO,OAAO;AAChB,UAAM,OAAO;AAAA,EACf;AACA,MAAI,OAAO,WAAW,GAAG;AACvB,UAAM,IAAI,MAAM,OAAO,QAAQ,KAAK,KAAK,OAAO,QAAQ,KAAK,KAAK,GAAG,OAAO,SAAS;AAAA,EACvF;AACA,SAAO;AACT;AAEA,SAAS,yBAAiC;AACxC,MAAI,QAAQ,IAAI,4BAA4B;AAC1C,eAAO,2BAAQ,QAAQ,IAAI,0BAA0B;AAAA,EACvD;AACA,UAAI,yBAAS,MAAM,SAAS;AAC1B,eAAO;AAAA,MACL,QAAQ,IAAI,oBAAgB,4BAAK,wBAAQ,GAAG,WAAW,OAAO;AAAA,MAC9D;AAAA,MACA;AAAA,IACF;AAAA,EACF;AACA,aAAO,wBAAK,QAAQ,IAAI,sBAAkB,4BAAK,wBAAQ,GAAG,QAAQ,GAAG,YAAY,SAAS;AAC5F;AAEA,SAAS,eAAuB;AAC9B,SAAO,QAAQ,IAAI,uBAAuB;AAC5C;AAEA,SAAS,YAAoB;AAC3B,SAAO,QAAQ,IAAI,oBAAoB;AACzC;AAEA,SAAS,sBAAsB,WAA6D;AAC1F,QAAM,YAAY,aAAa,QAAQ,IAAI,0BAA0B;AACrE,QAAM,WAAW,cAAc,SAAS,KAAK;AAC7C,MAAI,CAAC,iBAAiB,IAAI,QAAQ,GAAG;AACnC,UAAM,IAAI;AAAA,MACR,uCAAuC,SAAS,iCAClB,CAAC,GAAG,gBAAgB,EAAE,KAAK,EAAE,KAAK,IAAI,CAAC;AAAA,IACvE;AAAA,EACF;AACA,SAAO,EAAE,WAAW,SAAS;AAC/B;AAEA,SAAS,UAAU,KAAuB;AACxC,MAAI,KAAC,4BAAW,GAAG,EAAG,QAAO,CAAC;AAC9B,QAAM,QAAkB,CAAC;AACzB,aAAW,aAAS,6BAAY,KAAK,EAAE,eAAe,KAAK,CAAC,GAAG;AAC7D,UAAM,eAAW,wBAAK,KAAK,MAAM,IAAI;AACrC,QAAI,MAAM,YAAY,GAAG;AACvB,YAAM,KAAK,GAAG,UAAU,QAAQ,CAAC;AAAA,IACnC,OAAO;AACL,YAAM,KAAK,QAAQ;AAAA,IACrB;AAAA,EACF;AACA,SAAO;AACT;AAEA,SAAS,gBAAgB,KAAgF;AACvG,QAAM,QAAQ,UAAU,GAAG;AAC3B,QAAM,cACJ,MAAM,KAAK,CAAC,SAAS,KAAK,SAAS,oBAAoB,CAAC,KACrD,MAAM,KAAK,CAAC,SAAS,KAAK,SAAS,eAAe,CAAC;AACxD,QAAM,cACJ,MAAM,KAAK,CAAC,SAAS,KAAK,SAAS,oBAAoB,CAAC,KACrD,MAAM,KAAK,CAAC,SAAS,KAAK,SAAS,eAAe,CAAC;AACxD,QAAM,aAAa,MAAM,KAAK,CAAC,SAAS,KAAK,SAAS,aAAa,CAAC;AACpE,MAAI,CAAC,eAAe,CAAC,eAAe,CAAC,YAAY;AAC/C,WAAO;AAAA,EACT;AACA,SAAO;AAAA,IACL,UAAU;AAAA,IACV;AAAA,IACA;AAAA,IACA;AAAA,EACF;AACF;AAEA,SAAS,oBAAoB,QAAwB;AACnD,MAAI,OAAO,SAAS,KAAK,GAAG;AAC1B,WAAO,GAAG,MAAM;AAAA,EAClB;AACA,SAAO;AACT;AAEA,eAAe,oBAAoB,UAAoB,aAAoC;AACzF,MAAI,CAAC,SAAS,MAAM,CAAC,SAAS,MAAM;AAClC,UAAM,IAAI,MAAM,QAAQ,SAAS,MAAM,sBAAsB,SAAS,GAAG,EAAE;AAAA,EAC7E;AACA,YAAM,0BAAS,4BAAS,QAAQ,SAAS,IAA6C,OAAG,mCAAkB,WAAW,CAAC;AACzH;AAEA,eAAe,uBAAuB,WAA+C;AACnF,QAAM,EAAE,WAAW,SAAS,IAAI,sBAAsB,SAAS;AAC/D,QAAM,YAAY,uBAAuB;AACzC,iCAAU,WAAW,EAAE,WAAW,KAAK,CAAC;AAExC,QAAM,eAAW,wBAAK,WAAW,uBAAuB,QAAQ,EAAE;AAClE,QAAM,SAAS,gBAAgB,QAAQ;AACvC,MAAI,QAAQ;AACV,WAAO,EAAE,gBAAgB,WAAW,eAAe,UAAU,GAAG,OAAO;AAAA,EACzE;AAEA,QAAM,cAAU,iCAAY,4BAAK,uBAAO,GAAG,yBAAyB,CAAC;AACrE,QAAM,iBAAa,wBAAK,SAAS,SAAS;AAC1C,QAAM,cAAc,uBAAuB,QAAQ;AACnD,QAAM,kBAAc,wBAAK,SAAS,WAAW;AAC7C,iCAAU,YAAY,EAAE,WAAW,KAAK,CAAC;AAEzC,MAAI;AACF,UAAM,MAAM,GAAG,mBAAmB,IAAI,WAAW;AACjD,YAAQ,IAAI,gCAAgC,QAAQ,EAAE;AACtD,UAAM,WAAW,MAAM,MAAM,GAAG;AAChC,UAAM,oBAAoB,UAAU,WAAW;AAE/C,eAAW,UAAU,GAAG,CAAC,QAAQ,aAAa,MAAM,UAAU,CAAC;AAE/D,UAAM,gBAAgB,UAAU,UAAU,EACvC,IAAI,CAAC,aAAS,2BAAQ,IAAI,CAAC,EAC3B,KAAK,CAAC,SAAS,gBAAgB,IAAI,MAAM,IAAI;AAChD,UAAM,YACJ,qBACG,6BAAY,YAAY,EAAE,eAAe,KAAK,CAAC,EAC/C,OAAO,CAAC,UAAU,MAAM,YAAY,CAAC,EACrC,IAAI,CAAC,cAAU,wBAAK,YAAY,MAAM,IAAI,CAAC,EAC3C,KAAK,CAAC,SAAS,gBAAgB,IAAI,MAAM,IAAI;AAElD,QAAI,CAAC,WAAW;AACd,YAAM,IAAI,MAAM,0BAA0B,QAAQ,2CAA2C;AAAA,IAC/F;AAEA,YAAI,4BAAW,QAAQ,GAAG;AACxB,kCAAO,UAAU,EAAE,WAAW,MAAM,OAAO,KAAK,CAAC;AAAA,IACnD;AACA,QAAI;AACF,sCAAW,WAAW,QAAQ;AAAA,IAChC,QAAQ;AACN,kCAAO,WAAW,UAAU,EAAE,WAAW,KAAK,CAAC;AAAA,IACjD;AAEA,UAAM,YAAY,gBAAgB,QAAQ;AAC1C,QAAI,CAAC,WAAW;AACd,YAAM,IAAI,MAAM,mBAAmB,QAAQ,iCAAiC;AAAA,IAC9E;AAEA,WAAO,EAAE,gBAAgB,WAAW,eAAe,UAAU,GAAG,UAAU;AAAA,EAC5E,SAAS,OAAO;AACd,UAAM,SAAS,iBAAiB,QAAQ,MAAM,UAAU,OAAO,KAAK;AACpE,UAAM,IAAI,MAAM,oBAAoB,MAAM,CAAC;AAAA,EAC7C,UAAE;AACA,gCAAO,SAAS,EAAE,WAAW,MAAM,OAAO,KAAK,CAAC;AAAA,EAClD;AACF;AAEA,eAAe,mBAA0C;AACvD,MAAI,CAAC,qBAAqB;AACxB,0BAAsB,OAAO,kBAAkB,EAC5C,KAAK,CAAC,aACL,QAAQ,IAAI,UAAU,SAAS,IAC3B,QAAQ,IAAI,UAAU,SAAS,IAC/B,QACW,EAChB,MAAM,CAAC,UAAU;AAChB,4BAAsB;AACtB,YAAM,SAAS,iBAAiB,QAAQ,MAAM,UAAU,OAAO,KAAK;AACpE,YAAM,IAAI;AAAA,QACR,0GACmC,MAAM;AAAA,MAC3C;AAAA,IACF,CAAC;AAAA,EACL;AACA,SAAO;AACT;AAEA,eAAe,cACb,WACA,QACwE;AACxE,QAAM,YAAY,MAAM,uBAAuB,SAAS;AACxD,QAAM,WAAW,UAAU;AAC3B,QAAM,WAAW,gBAAgB,IAAI,QAAQ;AAC7C,MAAI,UAAU;AACZ,WAAO,EAAE,YAAY,MAAM,UAAU,UAAU;AAAA,EACjD;AAEA,QAAM,oBAAoB,YAAY;AACpC,UAAM,UAAU,UAAW,MAAM,iBAAiB;AAClD,WAAO,QAAQ,kBAAkB,YAAY;AAAA,MAC3C,YAAY;AAAA,QACV,YAAY;AAAA,QACZ,YAAY;AAAA,MACd;AAAA,MACA,aAAa;AAAA,QACX,SAAS;AAAA,UACP,SAAS,UAAU;AAAA,UACnB,SAAS,UAAU;AAAA,UACnB,MAAM;AAAA,QACR;AAAA,QACA,QAAQ,UAAU;AAAA,QAClB,YAAY;AAAA,QACZ,UAAU;AAAA,QACV,OAAO;AAAA,MACT;AAAA,IACF,CAAC;AAAA,EACH,GAAG;AAEH,kBAAgB;AAAA,IACd;AAAA,IACA,iBAAiB,MAAM,CAAC,UAAU;AAChC,sBAAgB,OAAO,QAAQ;AAC/B,YAAM;AAAA,IACR,CAAC;AAAA,EACH;AAEA,SAAO,EAAE,YAAY,MAAM,gBAAgB,IAAI,QAAQ,GAAI,UAAU;AACvE;AAEA,SAAS,gBAAgB,WAAmB,YAA4B;AACtE,QAAM,cAAU,wBAAK,YAAY,OAAG,4BAAS,eAAW,2BAAQ,SAAS,CAAC,CAAC,MAAM;AACjF,MAAI;AACF,eAAW,aAAa,GAAG;AAAA,MACzB;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA,OAAO,iBAAiB;AAAA,MACxB;AAAA,MACA;AAAA,MACA;AAAA,IACF,CAAC;AAAA,EACH,SAAS,OAAO;AACd,UAAM,SAAS,iBAAiB,QAAQ,MAAM,UAAU,OAAO,KAAK;AACpE,UAAM,IAAI;AAAA,MACR,oFACuC,MAAM;AAAA,IAC/C;AAAA,EACF;AACA,SAAO;AACT;AAEA,SAAS,sBAAsB,QAA8B;AAC3D,SAAO,OAAO,OAAO,QAAQ,EAAE,EAAE,KAAK;AACxC;AAEO,SAAS,MAAM,UAA2B;AAC/C,SAAO,aAAa,KAAK,CAAC,WAAW,SAAS,WAAW,MAAM,CAAC;AAClE;AAEO,SAAS,cAAc,KAAa,WAA2B;AACpE,iCAAU,WAAW,EAAE,WAAW,KAAK,CAAC;AAExC,QAAM,cAAU,gCAAW,MAAM,EAAE,OAAO,GAAG,EAAE,OAAO,KAAK,EAAE,MAAM,GAAG,EAAE;AACxE,aAAW,OAAO,yBAAyB;AACzC,UAAM,gBAAY,wBAAK,WAAW,MAAM,OAAO,GAAG,GAAG,EAAE;AACvD,YAAI,4BAAW,SAAS,GAAG;AACzB,cAAQ,IAAI,uBAAmB,4BAAS,SAAS,CAAC,EAAE;AACpD,aAAO;AAAA,IACT;AAAA,EACF;AAEA,QAAM,kBAAc,wBAAK,WAAW,MAAM,OAAO,UAAU;AAC3D,MAAI;AACF,YAAQ,IAAI,wBAAwB,IAAI,MAAM,GAAG,EAAE,CAAC,MAAM;AAC1D,eAAW,UAAU;AAAA,MACnB;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,IACF,CAAC;AAAA,EACH,SAAS,OAAO;AACd,UAAM,SAAS,iBAAiB,QAAQ,MAAM,UAAU,OAAO,KAAK;AACpE,UAAM,IAAI;AAAA,MACR,mFAAmF,MAAM;AAAA,IAC3F;AAAA,EACF;AAEA,aAAW,aAAS,6BAAY,SAAS,GAAG;AAC1C,QAAI,MAAM,WAAW,MAAM,OAAO,GAAG,GAAG;AACtC,iBAAO,wBAAK,WAAW,KAAK;AAAA,IAC9B;AAAA,EACF;AAEA,QAAM,IAAI,MAAM,uDAAuD,GAAG,EAAE;AAC9E;AAEO,SAAS,mBACdC,WACQ;AACR,QAAM,WAAW,QAAQ,IAAI;AAC7B,MAAI,SAAU,QAAO;AAErB,QAAM,SAASA,UACZ,IAAI,CAAC,SAAS,KAAK,SAAS,EAAE,EAC9B,OAAO,CAAC,UAA2B,QAAQ,KAAK,CAAC,EACjD,MAAM,GAAG,CAAC;AACb,MAAI,OAAO,WAAW,GAAG;AACvB,WAAO;AAAA,EACT;AACA,SAAO,8BAA8B,OAAO,KAAK,IAAI,CAAC,KAAK,eAAe;AAC5E;AAEA,eAAsB,WACpB,WACA,YAAoB,iBACpB,eACA,QAAiB,OACA;AACjB,QAAM,aAAS,2BAAQ,SAAS;AAChC,iCAAU,QAAQ,EAAE,WAAW,KAAK,CAAC;AAErC,QAAM,YAAY,MAAM,SAAS,IAC7B,cAAc,eAAW,wBAAK,QAAQ,WAAW,CAAC,QAClD,2BAAQ,SAAS;AACrB,QAAM,qBAAiB,wBAAK,QAAQ,OAAG,4BAAS,eAAW,2BAAQ,SAAS,CAAC,CAAC,MAAM;AAEpF,UAAI,4BAAW,cAAc,KAAK,CAAC,OAAO;AACxC,WAAO;AAAA,EACT;AAEA,QAAM,SAAS,iBAAiB,QAAQ,IAAI,2BAA2B;AACvE,QAAM,iBAAiB,QAAQ,IAAI,0BAA0B;AAC7D,QAAM,cAAU,iCAAY,4BAAK,uBAAO,GAAG,sBAAsB,CAAC;AAElE,MAAI;AACF,YAAQ,IAAI,sBAAkB,4BAAS,SAAS,CAAC,WAAW,cAAc,OAAO;AACjF,UAAM,UAAU,gBAAgB,WAAW,OAAO;AAClD,UAAM,SAAS,MAAM,iBAAiB;AACtC,UAAM,EAAE,YAAY,UAAU,IAAI,MAAM,cAAc,gBAAgB,MAAM;AAC5E,UAAM,OAAO,OAAO,SAAS,OAAO;AACpC,UAAM,SAAS,WAAW,aAAa;AACvC,QAAI,UAAU,OAAO,OAAO,cAAc,YAAY;AACpD,UAAI;AACF,eAAO,UAAU,UAAU,MAAM;AAAA,MACnC,QAAQ;AAAA,MAER;AAAA,IACF;AACA,WAAO,eAAe,EAAE,SAAS,KAAK,SAAS,YAAY,KAAK,WAAW,CAAC;AAC5E,UAAM,SAAS,MAAM,WAAW,YAAY,MAAM;AAClD,UAAM,aAAa,sBAAsB,MAAM;AAC/C,uCAAc,gBAAgB,YAAY,OAAO;AACjD,QAAI,UAAU,mBAAmB,UAAU,eAAe;AACxD,cAAQ,IAAI,kBAAkB,UAAU,cAAc,OAAO,UAAU,aAAa,EAAE;AAAA,IACxF;AAAA,EACF,SAAS,OAAO;AACd,QAAI,iBAAiB,SAAS,MAAM,QAAQ,WAAW,oCAAoC,GAAG;AAC5F,YAAM;AAAA,IACR;AACA,UAAM,SAAS,iBAAiB,QAAQ,MAAM,UAAU,OAAO,KAAK;AACpE,UAAM,IAAI;AAAA,MACR,wHACgC,MAAM;AAAA,IACxC;AAAA,EACF,UAAE;AACA,gCAAO,SAAS,EAAE,WAAW,MAAM,OAAO,KAAK,CAAC;AAAA,EAClD;AAEA,SAAO;AACT;AAEA,eAAsB,cACpB,YACA,WACA,eACA,QAAiB,OACE;AACnB,MAAI,WAAW,WAAW,GAAG;AAC3B,WAAO,CAAC;AAAA,EACV;AAEA,QAAM,kBAA4B,CAAC;AACnC,aAAW,aAAa,YAAY;AAClC,QAAI;AACF,sBAAgB,KAAK,MAAM,WAAW,WAAW,WAAW,eAAe,KAAK,CAAC;AAAA,IACnF,SAAS,OAAO;AACd,YAAM,SAAS,iBAAiB,QAAQ,MAAM,UAAU,OAAO,KAAK;AACpE,cAAQ,IAAI,mCAAmC,SAAS,KAAK,MAAM,EAAE;AAAA,IACvE;AAAA,EACF;AACA,SAAO;AACT;AAEA,SAAS,eAAe,WAA6C;AACnE,SAAO,KAAK,MAAM,KAAK,UAAU,SAAS,CAAC;AAC7C;AAEA,eAAsB,gCACpB,WACA,SAOoF;AACpF,QAAM,gBAAgB,eAAe,SAAS;AAC9C,QAAM,SAAS,SAAS,eAAe,cAAc,YAAY,cAAc,YAAY,cAAc;AACzG,QAAM,aAAa,CAAC,GAAI,OAAO,SAAS,CAAC,CAAE;AAC3C,QAAM,SAAS,SAAS,iBAAiB,mBAAmB,SAAS,YAAY,CAAC,CAAC;AAEnF,MAAI,WAAW,WAAW,GAAG;AAC3B,WAAO,EAAE,WAAW,eAAe,iBAAiB,CAAC,GAAG,OAAO;AAAA,EACjE;AAEA,QAAM,gBAAgB,QAAQ,IAAI;AAClC,MAAI,SAAS,cAAc;AACzB,YAAQ,IAAI,yBAAyB,QAAQ;AAAA,EAC/C;AAEA,MAAI;AACF,UAAM,kBAAkB,MAAM;AAAA,MAC5B;AAAA,MACA,SAAS;AAAA,MACT;AAAA,MACA,SAAS,gBAAgB;AAAA,IAC3B;AACA,UAAM,oBAAoB,OAAO,YAAY,CAAC;AAC9C,WAAO,WAAW,CAAC,GAAG,mBAAmB,GAAG,eAAe;AAC3D,WAAO,EAAE,WAAW,eAAe,iBAAiB,OAAO;AAAA,EAC7D,UAAE;AACA,QAAI,SAAS,cAAc;AACzB,UAAI,kBAAkB,QAAW;AAC/B,eAAO,QAAQ,IAAI;AAAA,MACrB,OAAO;AACL,gBAAQ,IAAI,yBAAyB;AAAA,MACvC;AAAA,IACF;AAAA,EACF;AACF;;;ADtgBA,SAAS,QAAQ,GAAmB;AAClC,SAAO,EACJ,QAAQ,OAAO,MAAM,EACrB,QAAQ,MAAM,KAAK,EACnB,QAAQ,OAAO,GAAG,EAClB,QAAQ,OAAO,GAAG;AACvB;AAEA,SAASC,cAAa,KAAa,QAAwB;AACzD,MAAI;AACJ,MAAI;AACF,aAAS,IAAI,IAAI,GAAG;AAAA,EACtB,QAAQ;AACN,WAAO,UAAU,MAAM;AAAA,EACzB;AACA,MAAI,OAAO,OAAO,WAAW,OAAO;AACpC,SAAO,KAAK,QAAQ,YAAY,GAAG,EAAE,QAAQ,YAAY,EAAE;AAC3D,SAAO,KAAK,QAAQ,OAAO,GAAG,EAAE,MAAM,GAAG,EAAE;AAC3C,SAAO,OAAO;AAChB;AAEA,SAAS,cAAc,KAAqB;AAC1C,QAAM,QAAQ,IAAI,YAAY;AAC9B,MAAI,MAAM,SAAS,aAAa,KAAK,MAAM,SAAS,OAAO,EAAG,QAAO;AACrE,MAAI,MAAM,SAAS,WAAW,EAAG,QAAO;AACxC,MAAI,MAAM,SAAS,YAAY,EAAG,QAAO;AACzC,MAAI,MAAM,SAAS,aAAa,KAAK,MAAM,SAAS,UAAU;AAC5D,WAAO;AACT,MAAI;AACF,UAAM,SAAS,IAAI,IAAI,GAAG;AAC1B,UAAM,OAAO,OAAO,SAAS,YAAY;AACzC,QAAI,KAAK,SAAS,MAAM,EAAG,QAAO;AAClC,QACE,CAAC,QAAQ,QAAQ,SAAS,SAAS,MAAM,EAAE;AAAA,MAAK,CAAC,QAC/C,KAAK,SAAS,GAAG;AAAA,IACnB;AAEA,aAAO;AAAA,EACX,QAAQ;AAAA,EAER;AACA,SAAO;AACT;AAEA,eAAe,eAAe,MAAc,MAA+B;AACzE,MAAI;AACF,UAAM,mBAAmB,MAAM,OAAO,UAAU,GAAG;AACnD,UAAM,KAAK,IAAI,gBAAgB;AAAA,MAC7B,cAAc;AAAA,MACd,gBAAgB;AAAA,IAClB,CAAC;AACD,WAAO,GAAG,SAAS,IAAI;AAAA,EACzB,QAAQ;AAEN,QAAI,OAAO,KAAK,QAAQ,iCAAiC,EAAE;AAC3D,WAAO,KAAK,QAAQ,+BAA+B,EAAE;AACrD,WAAO,KAAK,QAAQ,YAAY,GAAG;AACnC,WAAO,KAAK,QAAQ,QAAQ,GAAG,EAAE,KAAK;AACtC,WAAO,KAAK,MAAM,GAAG,GAAI;AAAA,EAC3B;AACF;AAMA,eAAe,WACb,KACA,QACA,aAC2B;AAC3B,QAAM,YAAY,IAAI,QAAQ,SAAS,aAAa;AACpD,QAAM,YAAY,0CAA0C,mBAAmB,SAAS,CAAC;AAEzF,MAAI;AACJ,MAAI;AACJ,MAAI;AACF,UAAM,OAAO,KAAK,MAAM,MAAM,cAAc,SAAS,CAAC;AAItD,iBAAc,KAAK,QAAmB,IACnC,QAAQ,YAAY,EAAE,EACtB,KAAK;AACR,kBAAe,KAAK,eAA0B;AAAA,EAChD,QAAQ;AACN,gBAAY,YAAY,GAAG;AAC3B,kBAAc;AAAA,EAChB;AAEA,QAAM,OAAM,oBAAI,KAAK,GAAE,YAAY;AACnC,QAAM,UAAU;AAAA,cACJ,GAAG;AAAA;AAAA,UAEP,WAAW;AAAA,eACN,GAAG;AAAA,eACH,eAAe,UAAU,SAAS;AAAA;AAAA;AAAA,cAGnC,WAAW;AAAA;AAAA,EAEvB,SAAS;AAAA;AAAA,UAED,GAAG;AAAA;AAEX,QAAM,WAAWA,cAAa,KAAK,KAAK;AACxC,SAAO,CAAC,SAAS,QAAQ;AAC3B;AAEA,eAAe,aACb,KACA,QACA,aAC2B;AAC3B,QAAM,OAAO,MAAM,cAAc,GAAG;AAEpC,QAAM,aAAa,KAAK,MAAM,8BAA8B;AAC5D,QAAM,QAAQ,aACV,WAAW,CAAC,EAAG,QAAQ,QAAQ,GAAG,EAAE,KAAK,IACzC;AAEJ,QAAM,WAAW,MAAM,eAAe,MAAM,GAAG;AAC/C,QAAM,OAAM,oBAAI,KAAK,GAAE,YAAY;AACnC,QAAM,UAAU;AAAA,cACJ,GAAG;AAAA;AAAA,UAEP,QAAQ,KAAK,CAAC;AAAA,eACT,GAAG;AAAA,eACH,eAAe,UAAU,SAAS;AAAA;AAAA;AAAA,IAG7C,KAAK;AAAA;AAAA,UAEC,GAAG;AAAA;AAAA;AAAA;AAAA,EAIX,SAAS,MAAM,GAAG,IAAK,CAAC;AAAA;AAExB,QAAM,WAAWA,cAAa,KAAK,KAAK;AACxC,SAAO,CAAC,SAAS,QAAQ;AAC3B;AAEA,eAAe,WACb,KACA,QACA,aAC2B;AAC3B,QAAM,aAAa,IAAI,MAAM,kBAAkB;AAC/C,MAAI,CAAC,YAAY;AACf,WAAO,aAAa,KAAK,QAAQ,WAAW;AAAA,EAC9C;AAEA,QAAM,UAAU,WAAW,CAAC;AAC5B,MAAI,QAAQ;AACZ,MAAI,WAAW;AACf,MAAI,eAAe;AAEnB,QAAM,SAAS,gCAAgC,OAAO;AACtD,MAAI;AACF,UAAM,OAAO,MAAM,cAAc,MAAM;AACvC,UAAM,gBAAgB,KAAK;AAAA,MACzB;AAAA,IACF;AACA,QAAI,eAAe;AACjB,iBAAW,cAAc,CAAC,EAAG,QAAQ,YAAY,EAAE,EAAE,KAAK;AAAA,IAC5D;AACA,UAAM,aAAa,KAAK;AAAA,MACtB;AAAA,IACF;AACA,QAAI,YAAY;AACd,cAAQ,WAAW,CAAC,EAAG,QAAQ,YAAY,GAAG,EAAE,KAAK;AAAA,IACvD;AACA,UAAM,eAAe,KAAK;AAAA,MACxB;AAAA,IACF;AACA,QAAI,cAAc;AAChB,qBAAe,aAAa,CAAC,EAAG,QAAQ,YAAY,EAAE,EAAE,KAAK;AAAA,IAC/D;AAAA,EACF,QAAQ;AAAA,EAER;AAEA,QAAM,OAAM,oBAAI,KAAK,GAAE,YAAY;AACnC,QAAM,UAAU;AAAA,cACJ,GAAG;AAAA,YACL,OAAO;AAAA;AAAA,UAET,KAAK;AAAA,kBACG,YAAY;AAAA,eACf,GAAG;AAAA,eACH,eAAe,UAAU,SAAS;AAAA;AAAA;AAAA,IAG7C,KAAK;AAAA;AAAA,eAEM,YAAY;AAAA,aACd,OAAO;AAAA;AAAA;AAAA;AAAA,EAIlB,QAAQ;AAAA;AAAA,UAEA,GAAG;AAAA;AAEX,QAAM,WAAW,SAAS,QAAQ,QAAQ,KAAK,GAAG,CAAC;AACnD,SAAO,CAAC,SAAS,QAAQ;AAC3B;AAEA,eAAe,eACb,KACA,QACA,WACiB;AACjB,QAAM,WAAWA,cAAa,KAAK,MAAM;AACzC,QAAM,cAAU,kBAAAC,SAAY,WAAW,QAAQ;AAC/C,QAAM,OAAO,MAAM,UAAU,GAAG;AAChC,qCAAc,SAAS,IAAI;AAC3B,SAAO;AACT;AAOA,SAAS,uBACP,iBACA,aACuD;AACvD,MAAI,OAAO,oBAAoB,YAAY,mBAAmB,MAAM;AAClE,WAAO;AAAA,MACL,QAAQ,mBAAmB;AAAA,MAC3B,aAAa,eAAe;AAAA,IAC9B;AAAA,EACF;AAEA,SAAO;AAAA,IACL,QAAQ,gBAAgB,UAAU;AAAA,IAClC,aAAa,gBAAgB,eAAe;AAAA,EAC9C;AACF;AAMA,eAAsB,OACpB,KACA,WACA,kBAAiD,MACjD,cAA6B,MACZ;AACjB,iCAAU,WAAW,EAAE,WAAW,KAAK,CAAC;AACxC,QAAM,UAAU,cAAc,GAAG;AACjC,QAAM,EAAE,QAAQ,aAAa,sBAAsB,IAAI;AAAA,IACrD;AAAA,IACA;AAAA,EACF;AAEA,QAAM,YAAY,GAAG;AAErB,MAAI;AACJ,MAAI;AAEJ,MAAI,YAAY,OAAO;AACrB,UAAM,MAAM,MAAM,eAAe,KAAK,QAAQ,SAAS;AACvD,YAAQ,IAAI,uBAAmB,4BAAS,GAAG,CAAC,EAAE;AAC9C,WAAO;AAAA,EACT;AAEA,MAAI,YAAY,SAAS;AACvB,QAAI;AACJ,QAAI;AACF,eAAS,IAAI,IAAI,GAAG;AAAA,IACtB,QAAQ;AACN,YAAM,IAAI,MAAM,gBAAgB,GAAG,EAAE;AAAA,IACvC;AACA,UAAM,aAAS,2BAAQ,OAAO,QAAQ,KAAK;AAC3C,UAAM,MAAM,MAAM,eAAe,KAAK,QAAQ,SAAS;AACvD,YAAQ,IAAI,yBAAqB,4BAAS,GAAG,CAAC,EAAE;AAChD,WAAO;AAAA,EACT;AAEA,MAAI,YAAY,WAAW;AACzB,UAAM,MAAM,cAAc,KAAK,SAAS;AACxC,YAAQ,IAAI,yBAAqB,4BAAS,GAAG,CAAC,EAAE;AAChD,WAAO;AAAA,EACT;AAEA,MAAI,YAAY,SAAS;AACvB,KAAC,SAAS,QAAQ,IAAI,MAAM,WAAW,KAAK,QAAQ,qBAAqB;AAAA,EAC3E,WAAW,YAAY,SAAS;AAC9B,KAAC,SAAS,QAAQ,IAAI,MAAM,WAAW,KAAK,QAAQ,qBAAqB;AAAA,EAC3E,OAAO;AACL,KAAC,SAAS,QAAQ,IAAI,MAAM,aAAa,KAAK,QAAQ,qBAAqB;AAAA,EAC7E;AAEA,MAAI,cAAU,kBAAAA,SAAY,WAAW,QAAQ;AAC7C,MAAI,UAAU;AACd,aAAO,4BAAW,OAAO,GAAG;AAC1B,UAAM,OAAO,SAAS,QAAQ,SAAS,EAAE;AACzC,kBAAU,kBAAAA,SAAY,WAAW,GAAG,IAAI,IAAI,OAAO,KAAK;AACxD;AAAA,EACF;AAEA,qCAAc,SAAS,SAAS,OAAO;AACvC,UAAQ,IAAI,SAAS,OAAO,SAAK,4BAAS,OAAO,CAAC,EAAE;AACpD,SAAO;AACT;AAMO,SAAS,gBACd,mBASA,QACA,WACA,YAAoB,SACpB,cAA+B,MACvB;AACR,QAAM,UAAU,OAAO,sBAAsB,WACzC;AAAA,IACA,UAAU;AAAA,IACV,QAAQ,UAAU;AAAA,IAClB,WAAW,aAAa;AAAA,IACxB;AAAA,IACA;AAAA,EACF,IACE;AAAA,IACA,UAAU,kBAAkB;AAAA,IAC5B,QAAQ,kBAAkB;AAAA,IAC1B,WAAW,kBAAkB;AAAA,IAC7B,WAAW,kBAAkB,aAAa;AAAA,IAC1C,aAAa,kBAAkB,eAAe;AAAA,EAChD;AAEF,MAAI,CAAC,QAAQ,SAAU,OAAM,IAAI,MAAM,qCAAqC;AAC5E,MAAI,CAAC,QAAQ,UAAW,OAAM,IAAI,MAAM,sCAAsC;AAE9E,QAAM,kBAAkB,QAAQ,UAAU;AAC1C,iCAAU,QAAQ,WAAW,EAAE,WAAW,KAAK,CAAC;AAEhD,QAAM,MAAM,oBAAI,KAAK;AACrB,QAAM,OAAO,QAAQ,SAClB,YAAY,EACZ,QAAQ,UAAU,GAAG,EACrB,MAAM,GAAG,EAAE,EACX,QAAQ,OAAO,EAAE;AACpB,QAAM,KAAK,IACR,YAAY,EACZ,QAAQ,SAAS,EAAE,EACnB,QAAQ,KAAK,GAAG,EAChB,MAAM,GAAG,EAAE;AACd,QAAM,WAAW,SAAS,EAAE,IAAI,IAAI;AAEpC,QAAM,mBAAmB;AAAA,IACvB;AAAA,IACA,UAAU,QAAQ,SAAS;AAAA,IAC3B,UAAU,IAAI,YAAY,CAAC;AAAA,IAC3B,cAAc,QAAQ,QAAQ,QAAQ,CAAC;AAAA,IACvC;AAAA,EACF;AACA,MAAI,QAAQ,eAAe,QAAQ,YAAY,SAAS,GAAG;AACzD,UAAM,WAAW,QAAQ,YACtB,MAAM,GAAG,EAAE,EACX,IAAI,CAAC,MAAM,IAAI,CAAC,GAAG,EACnB,KAAK,IAAI;AACZ,qBAAiB,KAAK,kBAAkB,QAAQ,GAAG;AAAA,EACrD;AACA,mBAAiB,KAAK,KAAK;AAE3B,QAAM,YAAY;AAAA,IAChB;AAAA,IACA,QAAQ,QAAQ,QAAQ;AAAA,IACxB;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,EACF;AACA,MAAI,QAAQ,eAAe,QAAQ,YAAY,SAAS,GAAG;AACzD,cAAU,KAAK,IAAI,mBAAmB,EAAE;AACxC,eAAW,KAAK,QAAQ,aAAa;AACnC,gBAAU,KAAK,KAAK,CAAC,EAAE;AAAA,IACzB;AAAA,EACF;AAEA,QAAM,UAAU,CAAC,GAAG,kBAAkB,GAAG,SAAS,EAAE,KAAK,IAAI;AAC7D,QAAM,cAAU,kBAAAA,SAAY,QAAQ,WAAW,QAAQ;AACvD,qCAAc,SAAS,SAAS,OAAO;AACvC,SAAO;AACT;AAMA,IAAM,oBAAoB,OAAO,YAAY,eAC3C,OAAO,QAAQ,KAAK,CAAC,MAAM,YAC3B,8BAA8B,SAAK,4BAAS,QAAQ,KAAK,CAAC,CAAC,CAAC;AAE9D,IAAI,mBAAmB;AACrB,QAAM,MAAM,QAAQ,KAAK,CAAC;AAC1B,QAAM,YAAY,QAAQ,KAAK,CAAC,KAAK;AACrC,QAAM,SAAS,QAAQ,KAAK,CAAC,KAAK;AAClC,MAAI,CAAC,KAAK;AACR,YAAQ,MAAM,2CAA2C;AACzD,YAAQ,KAAK,CAAC;AAAA,EAChB;AACA,SAAO,KAAK,WAAW,MAAM,EAC1B,KAAK,CAAC,QAAQ,QAAQ,IAAI,uBAAuB,GAAG,EAAE,CAAC,EACvD,MAAM,CAAC,QAAQ;AACd,YAAQ,MAAM,GAAG;AACjB,YAAQ,KAAK,CAAC;AAAA,EAChB,CAAC;AACL;;;AElbA,IAAAC,mBAA6B;AAE7B,wBAA8B;AAC9B,IAAAC,oBAA2C;AAC3C;AAKA;AACA;AAOA,SAASC,WAAU,WAA0B;AAC3C,MAAI;AACJ,MAAI;AACF,eAAW,kBAAkB,eAAW,+BAAQ,2BAAQ,SAAS,CAAC,CAAC;AAAA,EACrE,SAAS,KAAK;AACZ,YAAQ,MAAM,UAAU,eAAe,QAAQ,IAAI,UAAU,GAAG,EAAE;AAClE,YAAQ,KAAK,CAAC;AAAA,EAChB;AAEA,MAAI;AACJ,MAAI;AACF,WAAO,KAAK,UAAM,+BAAa,UAAU,OAAO,CAAC;AAAA,EACnD,SAAS,KAAK;AACZ,YAAQ;AAAA,MACN,mCAAmC,eAAe,QAAQ,IAAI,UAAU,GAAG;AAAA,IAC7E;AACA,YAAQ,KAAK,CAAC;AAAA,EAChB;AAEA,SAAO,kBAAkB,IAAI;AAC/B;AAMA,SAAS,qBAAqB,GAAiC;AAC7D,QAAM,cAAc,oBAAI,IAAsB;AAC9C,IAAE,YAAY,CAAC,QAAQ,SAAS;AAC9B,UAAM,MAAM,KAAK;AACjB,QAAI,QAAQ,UAAa,QAAQ,MAAM;AACrC,UAAI,CAAC,YAAY,IAAI,GAAG,EAAG,aAAY,IAAI,KAAK,CAAC,CAAC;AAClD,kBAAY,IAAI,GAAG,EAAG,KAAK,MAAM;AAAA,IACnC;AAAA,EACF,CAAC;AACD,SAAO;AACT;AAEA,SAAS,cAAc,GAAU,KAAwD;AACvF,MAAI,QAAQ,UAAa,QAAQ,KAAM,QAAO;AAC9C,QAAM,SAAS,EAAE,aAAa,kBAAkB;AAChD,QAAM,YAAY,SAAS,OAAO,GAAG,CAAC;AACtC,MAAI,OAAO,cAAc,YAAY,UAAU,SAAS,GAAG;AACzD,WAAO,cAAc,SAAS;AAAA,EAChC;AACA,SAAO;AACT;AAEA,SAAS,WAAW,GAAU,OAA0C;AACtE,QAAM,SAAkC,CAAC;AACzC,IAAE,YAAY,CAAC,KAAK,SAAS;AAC3B,UAAM,SAAU,KAAK,SAAoB,IAAI,YAAY;AACzD,UAAM,UAAW,KAAK,eAA0B,IAAI,YAAY;AAChE,UAAM,QACJ,MAAM,OAAO,CAAC,GAAG,MAAM,KAAK,MAAM,SAAS,CAAC,IAAI,IAAI,IAAI,CAAC,IACzD,MAAM,OAAO,CAAC,GAAG,MAAM,KAAK,OAAO,SAAS,CAAC,IAAI,MAAM,IAAI,CAAC;AAC9D,QAAI,QAAQ,EAAG,QAAO,KAAK,CAAC,OAAO,GAAG,CAAC;AAAA,EACzC,CAAC;AACD,SAAO,KAAK,CAAC,GAAG,MAAM,EAAE,CAAC,IAAI,EAAE,CAAC,CAAC;AACjC,SAAO;AACT;AAEA,SAAS,IACP,GACA,YACA,OAC0D;AAC1D,QAAM,UAAU,IAAI,IAAY,UAAU;AAC1C,MAAI,WAAW,IAAI,IAAY,UAAU;AACzC,QAAM,QAAiC,CAAC;AACxC,WAAS,IAAI,GAAG,IAAI,OAAO,KAAK;AAC9B,UAAM,eAAe,oBAAI,IAAY;AACrC,eAAW,KAAK,UAAU;AACxB,+BAAyB,GAAG,GAAG,CAAC,aAAa;AAC3C,YAAI,CAAC,QAAQ,IAAI,QAAQ,GAAG;AAC1B,uBAAa,IAAI,QAAQ;AACzB,gBAAM,KAAK,CAAC,GAAG,QAAQ,CAAC;AAAA,QAC1B;AAAA,MACF,CAAC;AAAA,IACH;AACA,eAAW,KAAK,aAAc,SAAQ,IAAI,CAAC;AAC3C,eAAW;AAAA,EACb;AACA,SAAO,EAAE,SAAS,MAAM;AAC1B;AAEA,SAAS,IACP,GACA,YACA,OAC0D;AAC1D,QAAM,UAAU,oBAAI,IAAY;AAChC,QAAM,QAAiC,CAAC;AACxC,QAAM,QAAiC,CAAC,GAAG,UAAU,EAAE,QAAQ,EAAE,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC;AAClF,SAAO,MAAM,SAAS,GAAG;AACvB,UAAM,CAAC,MAAM,CAAC,IAAI,MAAM,IAAI;AAC5B,QAAI,QAAQ,IAAI,IAAI,KAAK,IAAI,MAAO;AACpC,YAAQ,IAAI,IAAI;AAChB,6BAAyB,GAAG,MAAM,CAAC,aAAa;AAC9C,UAAI,CAAC,QAAQ,IAAI,QAAQ,GAAG;AAC1B,cAAM,KAAK,CAAC,UAAU,IAAI,CAAC,CAAC;AAC5B,cAAM,KAAK,CAAC,MAAM,QAAQ,CAAC;AAAA,MAC7B;AAAA,IACF,CAAC;AAAA,EACH;AACA,SAAO,EAAE,SAAS,MAAM;AAC1B;AAEA,SAAS,eACP,GACA,OACA,OACA,cAAsB,KACd;AACR,QAAM,aAAa,cAAc;AACjC,QAAM,QAAkB,CAAC;AAEzB,QAAM,SAAS,CAAC,GAAG,KAAK,EAAE,KAAK,CAAC,GAAG,MAAM,EAAE,OAAO,CAAC,IAAI,EAAE,OAAO,CAAC,CAAC;AAClE,aAAW,OAAO,QAAQ;AACxB,UAAM,IAAI,EAAE,kBAAkB,GAAG;AACjC,UAAM;AAAA,MACJ,QAAQ,cAAe,EAAE,SAAoB,GAAG,CAAC,SAAS,EAAE,eAAe,EAAE,QAAQ,EAAE,mBAAmB,EAAE,cAAc,EAAE,aAAa,EAAE;AAAA,IAC7I;AAAA,EACF;AACA,aAAW,CAAC,GAAG,CAAC,KAAK,OAAO;AAC1B,QAAI,MAAM,IAAI,CAAC,KAAK,MAAM,IAAI,CAAC,GAAG;AAChC,YAAM,UAAU,EAAE,KAAK,GAAG,CAAC;AAC3B,UAAI,CAAC,QAAS;AACd,YAAM,IAAI,EAAE,kBAAkB,OAAO;AACrC,YAAM;AAAA,QACJ,QAAQ,cAAe,EAAE,iBAAiB,GAAG,OAAO,KAAgB,CAAC,CAAC,MAAM,EAAE,YAAY,EAAE,KAAK,EAAE,cAAc,EAAE,QAAQ,cAAe,EAAE,iBAAiB,GAAG,OAAO,KAAgB,CAAC,CAAC;AAAA,MAC3L;AAAA,IACF;AAAA,EACF;AACA,MAAI,SAAS,MAAM,KAAK,IAAI;AAC5B,MAAI,OAAO,SAAS,YAAY;AAC9B,aAAS,OAAO,MAAM,GAAG,UAAU,IAAI;AAAA,qBAAwB,WAAW;AAAA,EAC5E;AACA,SAAO;AACT;AAEA,SAAS,SAAS,GAAU,OAAyB;AACnD,QAAM,OAAO,MAAM,YAAY;AAC/B,QAAM,SAAmB,CAAC;AAC1B,IAAE,YAAY,CAAC,KAAK,MAAM;AACxB,SACI,EAAE,SAAoB,IAAI,YAAY,EAAE,SAAS,IAAI,KACvD,IAAI,YAAY,MAAM,MACtB;AACA,aAAO,KAAK,GAAG;AAAA,IACjB;AAAA,EACF,CAAC;AACD,SAAO;AACT;AAMA,SAAS,eAAe,GAAU,MAAuC;AACvE,QAAM,WAAW,KAAK;AACtB,QAAM,OAAQ,KAAK,QAAmB;AACtC,QAAM,QAAQ,KAAK,IAAI,OAAO,KAAK,SAAS,CAAC,GAAG,CAAC;AACjD,QAAM,SAAS,OAAO,KAAK,gBAAgB,GAAI;AAC/C,QAAM,QAAQ,SACX,MAAM,KAAK,EACX,OAAO,CAAC,MAAM,EAAE,SAAS,CAAC,EAC1B,IAAI,CAAC,MAAM,EAAE,YAAY,CAAC;AAE7B,QAAM,SAAS,WAAW,GAAG,KAAK;AAClC,QAAM,aAAa,OAAO,MAAM,GAAG,CAAC,EAAE,IAAI,CAAC,CAAC,EAAE,GAAG,MAAM,GAAG;AAC1D,MAAI,WAAW,WAAW,EAAG,QAAO;AAEpC,QAAM,EAAE,SAAS,MAAM,IACrB,SAAS,QAAQ,IAAI,GAAG,YAAY,KAAK,IAAI,IAAI,GAAG,YAAY,KAAK;AAEvE,QAAM,cAAc,WAAW;AAAA,IAC7B,CAAC,MAAO,EAAE,iBAAiB,GAAG,OAAO,KAAgB;AAAA,EACvD;AACA,QAAM,SAAS,cAAc,KAAK,YAAY,CAAC,UAAU,KAAK,cAAc,YAAY,KAAK,IAAI,CAAC,OAAO,QAAQ,IAAI;AAAA;AAAA;AACrH,SAAO,SAAS,eAAe,GAAG,SAAS,OAAO,MAAM;AAC1D;AAEA,SAAS,YAAY,GAAU,MAAuC;AACpE,QAAM,QAAS,KAAK,MAAiB,YAAY;AACjD,QAAM,UAAoD,CAAC;AAC3D,IAAE,YAAY,CAACC,MAAKC,OAAM;AACxB,SACIA,GAAE,SAAoB,IAAI,YAAY,EAAE,SAAS,KAAK,KACxDD,KAAI,YAAY,MAAM,OACtB;AACA,cAAQ,KAAK,CAACA,MAAKC,EAAC,CAAC;AAAA,IACvB;AAAA,EACF,CAAC;AACD,MAAI,QAAQ,WAAW,EAAG,QAAO,qBAAqB,KAAK;AAC3D,QAAM,CAAC,KAAK,CAAC,IAAI,QAAQ,CAAC;AAC1B,SAAO;AAAA,IACL,SAAS,EAAE,SAAS,GAAG;AAAA,IACvB,SAAS,GAAG;AAAA,IACZ,aAAa,EAAE,eAAe,EAAE,IAAI,EAAE,mBAAmB,EAAE;AAAA,IAC3D,WAAW,EAAE,aAAa,EAAE;AAAA,IAC5B,gBACE,EAAE,iBACE,GAAG,EAAE,aAAa,EAAE,KAAK,EAAE,cAAwB,MAClD,cAAc,GAAG,EAAE,SAA+B,KAAK,OAAO,EAAE,aAAa,EAAE,CACtF;AAAA,IACA,aAAa,EAAE,OAAO,GAAG,CAAC;AAAA,EAC5B,EAAE,KAAK,IAAI;AACb;AAEA,SAAS,iBAAiB,GAAU,MAAuC;AACzE,QAAM,QAAS,KAAK,MAAiB,YAAY;AACjD,QAAM,aAAc,KAAK,mBAA8B,IAAI,YAAY;AACvE,QAAM,UAAU,SAAS,GAAG,KAAK;AACjC,MAAI,QAAQ,WAAW,EAAG,QAAO,qBAAqB,KAAK;AAC3D,QAAM,MAAM,QAAQ,CAAC;AACrB,QAAM,QAAQ,CAAC,gBAAiB,EAAE,iBAAiB,KAAK,OAAO,KAAgB,GAAG,GAAG;AACrF,2BAAyB,GAAG,KAAK,CAAC,aAAa;AAC7C,UAAM,UAAU,EAAE,KAAK,KAAK,QAAQ;AACpC,QAAI,CAAC,QAAS;AACd,UAAM,IAAI,EAAE,kBAAkB,OAAO;AACrC,UAAM,MAAO,EAAE,YAAuB;AACtC,QAAI,aAAa,CAAC,IAAI,YAAY,EAAE,SAAS,SAAS,EAAG;AACzD,UAAM;AAAA,MACJ,SAAU,EAAE,iBAAiB,UAAU,OAAO,KAAgB,QAAQ,KAAK,GAAG,MAAM,EAAE,cAAc,EAAE;AAAA,IACxG;AAAA,EACF,CAAC;AACD,SAAO,MAAM,KAAK,IAAI;AACxB;AAEA,SAAS,iBACP,aACA,GACA,MACQ;AACR,QAAM,MAAM,OAAO,KAAK,YAAY;AACpC,QAAM,QAAQ,YAAY,IAAI,GAAG;AACjC,MAAI,CAAC,SAAS,MAAM,WAAW,EAAG,QAAO,aAAa,GAAG;AACzD,QAAM,QAAQ,cAAc,GAAG,GAAG;AAClC,QAAM,QAAQ,CAAC,QACX,aAAa,GAAG,MAAM,KAAK,KAAK,MAAM,MAAM,aAC5C,aAAa,GAAG,KAAK,MAAM,MAAM,UAAU;AAC/C,aAAW,KAAK,OAAO;AACrB,UAAM,IAAI,EAAE,kBAAkB,CAAC;AAC/B,UAAM,KAAK,KAAK,EAAE,SAAS,CAAC,KAAK,EAAE,eAAe,EAAE,GAAG;AAAA,EACzD;AACA,SAAO,MAAM,KAAK,IAAI;AACxB;AAEA,SAAS,aAAa,GAAU,MAAuC;AACrE,QAAM,OAAO,OAAO,KAAK,SAAS,EAAE;AACpC,QAAM,QAAQ,SAAgB,GAAG,IAAI;AACrC,QAAM,QAAQ,CAAC,6BAA6B;AAC5C,QAAM,QAAQ,CAAC,GAAG,MAAM;AACtB,UAAM,KAAK,KAAK,IAAI,CAAC,KAAK,EAAE,KAAK,MAAM,EAAE,KAAK,QAAQ;AAAA,EACxD,CAAC;AACD,SAAO,MAAM,KAAK,IAAI;AACxB;AAEA,SAAS,eACP,GACA,aACQ;AACR,QAAM,QAAkB,CAAC;AACzB,IAAE,YAAY,CAAC,GAAG,SAAS;AACzB,UAAM,KAAM,KAAK,cAAyB,WAAW;AAAA,EACvD,CAAC;AACD,QAAM,QAAQ,MAAM,UAAU;AAC9B,SAAO;AAAA,IACL,UAAU,EAAE,KAAK;AAAA,IACjB,UAAU,EAAE,IAAI;AAAA,IAChB,gBAAgB,YAAY,IAAI;AAAA,IAChC,cAAc,KAAK,MAAO,MAAM,OAAO,CAAC,MAAM,MAAM,WAAW,EAAE,SAAS,QAAS,GAAG,CAAC;AAAA,IACvF,aAAa,KAAK,MAAO,MAAM,OAAO,CAAC,MAAM,MAAM,UAAU,EAAE,SAAS,QAAS,GAAG,CAAC;AAAA,IACrF,cAAc,KAAK,MAAO,MAAM,OAAO,CAAC,MAAM,MAAM,WAAW,EAAE,SAAS,QAAS,GAAG,CAAC;AAAA,EACzF,EAAE,KAAK,IAAI;AACb;AAEA,SAAS,iBAAiB,GAAU,MAAuC;AACzE,QAAM,WAAY,KAAK,OACpB,MAAM,KAAK,EACX,IAAI,CAAC,MAAM,EAAE,YAAY,CAAC;AAC7B,QAAM,WAAY,KAAK,OACpB,MAAM,KAAK,EACX,IAAI,CAAC,MAAM,EAAE,YAAY,CAAC;AAC7B,QAAM,YAAY,WAAW,GAAG,QAAQ;AACxC,QAAM,YAAY,WAAW,GAAG,QAAQ;AAExC,MAAI,UAAU,WAAW;AACvB,WAAO,4BAA4B,KAAK,MAAM;AAChD,MAAI,UAAU,WAAW;AACvB,WAAO,4BAA4B,KAAK,MAAM;AAEhD,QAAM,SAAS,UAAU,CAAC,EAAG,CAAC;AAC9B,QAAM,SAAS,UAAU,CAAC,EAAG,CAAC;AAC9B,QAAM,UAAU,OAAO,KAAK,YAAY,CAAC;AAEzC,QAAM,gBAAY,iCAAc,GAAG,QAAQ,MAAM;AACjD,MAAI,CAAC,WAAW;AACd,WAAO,0BAA2B,EAAE,iBAAiB,QAAQ,OAAO,KAAgB,MAAM,UAAW,EAAE,iBAAiB,QAAQ,OAAO,KAAgB,MAAM;AAAA,EAC/J;AAEA,QAAM,OAAO,UAAU,SAAS;AAChC,MAAI,OAAO,QAAS,QAAO,yBAAyB,OAAO,KAAK,IAAI;AAEpE,QAAM,WAAqB,CAAC;AAC5B,WAAS,IAAI,GAAG,IAAI,UAAU,SAAS,GAAG,KAAK;AAC7C,UAAM,IAAI,UAAU,CAAC;AACrB,UAAM,IAAI,UAAU,IAAI,CAAC;AACzB,UAAM,UAAU,EAAE,KAAK,GAAG,CAAC;AAC3B,UAAM,QAAQ,UAAU,EAAE,kBAAkB,OAAO,IAAI,CAAC;AACxD,UAAM,MAAO,MAAM,YAAuB;AAC1C,UAAM,OAAQ,MAAM,cAAyB;AAC7C,UAAM,UAAU,OAAO,KAAK,IAAI,MAAM;AACtC,QAAI,MAAM,GAAG;AACX,eAAS,KAAM,EAAE,iBAAiB,GAAG,OAAO,KAAgB,CAAC;AAAA,IAC/D;AACA,aAAS;AAAA,MACP,KAAK,GAAG,GAAG,OAAO,OAAQ,EAAE,iBAAiB,GAAG,OAAO,KAAgB,CAAC;AAAA,IAC1E;AAAA,EACF;AACA,SAAO,kBAAkB,IAAI;AAAA,IAAc,SAAS,KAAK,GAAG,CAAC;AAC/D;AAMA,eAAsB,MACpB,YAAoB,2BACpB,WACe;AACf,MAAI;AACJ,MAAI;AACJ,MAAI;AACJ,MAAI;AAEJ,MAAI;AACF,UAAM,YAAY,MAAM,OAAO,2CAA2C;AAC1E,UAAM,WAAW,MAAM,OAAO,2CAA2C;AACzE,UAAM,WAAW,MAAM,OAAO,oCAAoC;AAClE,aAAS,UAAU;AACnB,2BAAuB,SAAS;AAChC,6BAAyB,SAAS;AAClC,4BAAwB,SAAS;AAAA,EACnC,QAAQ;AACN,UAAM,IAAI;AAAA,MACR;AAAA,IACF;AAAA,EACF;AAEA,QAAM,IAAIF,WAAU,SAAS;AAC7B,QAAM,cAAc,qBAAqB,CAAC;AAE1C,QAAM,SAAS,IAAI;AAAA,IACjB,EAAE,MAAM,YAAY,SAAS,SAAS;AAAA,IACtC,EAAE,cAAc,EAAE,OAAO,CAAC,EAAE,EAAE;AAAA,EAChC;AAEA,SAAO,kBAAkB,wBAAwB,aAAa;AAAA,IAC5D,OAAO;AAAA,MACL;AAAA,QACE,MAAM;AAAA,QACN,aACE;AAAA,QACF,aAAa;AAAA,UACX,MAAM;AAAA,UACN,YAAY;AAAA,YACV,UAAU;AAAA,cACR,MAAM;AAAA,cACN,aAAa;AAAA,YACf;AAAA,YACA,MAAM;AAAA,cACJ,MAAM;AAAA,cACN,MAAM,CAAC,OAAO,KAAK;AAAA,cACnB,SAAS;AAAA,cACT,aAAa;AAAA,YACf;AAAA,YACA,OAAO;AAAA,cACL,MAAM;AAAA,cACN,SAAS;AAAA,cACT,aAAa;AAAA,YACf;AAAA,YACA,cAAc;AAAA,cACZ,MAAM;AAAA,cACN,SAAS;AAAA,cACT,aAAa;AAAA,YACf;AAAA,UACF;AAAA,UACA,UAAU,CAAC,UAAU;AAAA,QACvB;AAAA,MACF;AAAA,MACA;AAAA,QACE,MAAM;AAAA,QACN,aAAa;AAAA,QACb,aAAa;AAAA,UACX,MAAM;AAAA,UACN,YAAY;AAAA,YACV,OAAO;AAAA,cACL,MAAM;AAAA,cACN,aAAa;AAAA,YACf;AAAA,UACF;AAAA,UACA,UAAU,CAAC,OAAO;AAAA,QACpB;AAAA,MACF;AAAA,MACA;AAAA,QACE,MAAM;AAAA,QACN,aACE;AAAA,QACF,aAAa;AAAA,UACX,MAAM;AAAA,UACN,YAAY;AAAA,YACV,OAAO,EAAE,MAAM,SAAS;AAAA,YACxB,iBAAiB;AAAA,cACf,MAAM;AAAA,cACN,aAAa;AAAA,YACf;AAAA,UACF;AAAA,UACA,UAAU,CAAC,OAAO;AAAA,QACpB;AAAA,MACF;AAAA,MACA;AAAA,QACE,MAAM;AAAA,QACN,aAAa;AAAA,QACb,aAAa;AAAA,UACX,MAAM;AAAA,UACN,YAAY;AAAA,YACV,cAAc;AAAA,cACZ,MAAM;AAAA,cACN,aAAa;AAAA,YACf;AAAA,UACF;AAAA,UACA,UAAU,CAAC,cAAc;AAAA,QAC3B;AAAA,MACF;AAAA,MACA;AAAA,QACE,MAAM;AAAA,QACN,aACE;AAAA,QACF,aAAa;AAAA,UACX,MAAM;AAAA,UACN,YAAY;AAAA,YACV,OAAO,EAAE,MAAM,WAAW,SAAS,GAAG;AAAA,UACxC;AAAA,QACF;AAAA,MACF;AAAA,MACA;AAAA,QACE,MAAM;AAAA,QACN,aACE;AAAA,QACF,aAAa,EAAE,MAAM,UAAmB,YAAY,CAAC,EAAE;AAAA,MACzD;AAAA,MACA;AAAA,QACE,MAAM;AAAA,QACN,aACE;AAAA,QACF,aAAa;AAAA,UACX,MAAM;AAAA,UACN,YAAY;AAAA,YACV,QAAQ;AAAA,cACN,MAAM;AAAA,cACN,aAAa;AAAA,YACf;AAAA,YACA,QAAQ;AAAA,cACN,MAAM;AAAA,cACN,aAAa;AAAA,YACf;AAAA,YACA,UAAU;AAAA,cACR,MAAM;AAAA,cACN,SAAS;AAAA,cACT,aAAa;AAAA,YACf;AAAA,UACF;AAAA,UACA,UAAU,CAAC,UAAU,QAAQ;AAAA,QAC/B;AAAA,MACF;AAAA,IACF;AAAA,EACF,EAAE;AAEF,QAAM,WAGF;AAAA,IACF,aAAa,CAAC,MAAM,eAAe,GAAG,CAAC;AAAA,IACvC,UAAU,CAAC,MAAM,YAAY,GAAG,CAAC;AAAA,IACjC,eAAe,CAAC,MAAM,iBAAiB,GAAG,CAAC;AAAA,IAC3C,eAAe,CAAC,MAAM,iBAAiB,aAAa,GAAG,CAAC;AAAA,IACxD,WAAW,CAAC,MAAM,aAAa,GAAG,CAAC;AAAA,IACnC,aAAa,MAAM,eAAe,GAAG,WAAW;AAAA,IAChD,eAAe,CAAC,MAAM,iBAAiB,GAAG,CAAC;AAAA,EAC7C;AAEA,SAAO,kBAAkB,uBAAuB,OAAO,YAAY;AACjE,UAAM,EAAE,MAAM,WAAW,KAAK,IAAI,QAAQ;AAC1C,UAAM,UAAU,SAAS,IAAI;AAC7B,QAAI,CAAC,SAAS;AACZ,aAAO,EAAE,SAAS,CAAC,EAAE,MAAM,QAAiB,MAAM,iBAAiB,IAAI,GAAG,CAAC,EAAE;AAAA,IAC/E;AACA,QAAI;AACF,YAAM,OAAO,QAAS,QAAQ,CAAC,CAA6B;AAC5D,aAAO,EAAE,SAAS,CAAC,EAAE,MAAM,QAAiB,KAAK,CAAC,EAAE;AAAA,IACtD,SAAS,KAAK;AACZ,YAAM,UAAU,eAAe,QAAQ,IAAI,UAAU,OAAO,GAAG;AAC/D,aAAO,EAAE,SAAS,CAAC,EAAE,MAAM,QAAiB,MAAM,mBAAmB,IAAI,KAAK,OAAO,GAAG,CAAC,EAAE;AAAA,IAC7F;AAAA,EACF,CAAC;AAED,QAAM,kBAAkB,aAAa,IAAI,qBAAqB;AAC9D,MAAI;AACJ,MAAI,CAAC,WAAW;AACd,gBAAY,YAAY,MAAM,QAAW,GAAM;AAC/C,YAAQ,OAAO,OAAO;AAAA,EACxB;AAEA,QAAM,SAAS,IAAI,QAAc,CAACG,aAAY;AAC5C,UAAM,kBAAkB,OAAO;AAC/B,WAAO,UAAU,MAAM;AACrB,UAAI,WAAW;AACb,sBAAc,SAAS;AAAA,MACzB;AACA,wBAAkB;AAClB,MAAAA,SAAQ;AAAA,IACV;AAAA,EACF,CAAC;AAED,QAAM,OAAO,QAAQ,eAAe;AACpC,MAAI,WAAW;AACb,UAAM;AAAA,EACR;AACF;AAMA,IAAMC,qBAAoB,OAAO,YAAY,eAC3C,OAAO,QAAQ,KAAK,CAAC,MAAM,YAC3B,6BAA6B,SAAK,4BAAS,QAAQ,KAAK,CAAC,CAAC,CAAC;AAE7D,IAAIA,oBAAmB;AACrB,QAAM,YAAY,QAAQ,KAAK,CAAC,KAAK;AACrC,QAAM,SAAS,EAAE,MAAM,CAAC,QAAQ;AAC9B,YAAQ,MAAM,GAAG;AACjB,YAAQ,KAAK,CAAC;AAAA,EAChB,CAAC;AACH;;;ACjjBA,IAAAC,mBAAiE;AACjE,IAAAC,oBAA0D;AAC1D;AAOA,IAAM,qBAAqB,oBAAI,IAAI;AAAA,EACjC,GAAG;AAAA,EACH,GAAG;AAAA,EACH,GAAG;AAAA,EACH,GAAG;AACL,CAAC;AAMD,eAAsB,YACpB,WACA,iBAA0B,OACR;AAClB,MAAI;AAEF,UAAM,EAAE,cAAAC,eAAc,wBAAAC,wBAAuB,IAAI,MAAM;AACvD,UAAM,EAAE,eAAAC,eAAc,IAAI,MAAM;AAChC,UAAM,EAAE,SAAAC,UAAS,UAAAC,UAAS,IAAI,MAAM;AACpC,UAAM,EAAE,UAAAC,WAAU,uBAAAC,wBAAuB,kBAAAC,kBAAiB,IAAI,MAAM;AACpE,UAAM,EAAE,UAAAC,UAAS,IAAI,MAAM;AAC3B,UAAM,EAAE,QAAAC,QAAO,IAAI,MAAM;AAEzB,QAAI,YAAY,MAAMT,cAAa,WAAW,EAAE,eAAe,CAAC;AAChE,gBAAY,UAAU;AAAA,MACpB,CAAC,MACC,CAAC,EAAE,SAAS,cAAc,KAC1B,CAAC,EAAE,SAAS,aAAa,KACzB,CAAC,EAAE,SAAS,cAAc;AAAA,IAC9B;AAEA,QAAI,UAAU,WAAW,GAAG;AAC1B,cAAQ,IAAI,4DAA4D;AACxE,aAAO;AAAA,IACT;AAEA,UAAM,EAAE,YAAY,QAAQ,YAAY,IAAI,MAAMC,wBAAuB,SAAS;AAClF,QAAI,YAAY,SAAS,GAAG;AAC1B,cAAQ;AAAA,QACN,8CAA8C,YAAY,MAAM,aAC7D,YAAY,MAAM,GAAG,CAAC,EAAE,IAAI,CAAC,MAAM,GAAG,EAAE,QAAQ,KAAK,EAAE,KAAK,EAAE,EAAE,KAAK,KAAK,CAAC;AAAA,MAChF;AAAA,IACF;AACA,QAAI,OAAO,MAAM,WAAW,GAAG;AAC7B,cAAQ,IAAI,0EAA0E;AACtF,aAAO;AAAA,IACT;AAEA,UAAM,YAAY;AAAA,MAChB,OAAO;AAAA,QACL,MAAM;AAAA,QACN,UAAU,CAAC;AAAA,QACX,OAAO,CAAC;AAAA,QACR,OAAO,CAAC;AAAA,MACV;AAAA,MACA,aAAa,UAAU;AAAA,MACvB,aAAa;AAAA,MACb,aAAa;AAAA,MACb,SAAS;AAAA,MACT,mBAAmB,CAAC;AAAA,MACpB,yBAAyB;AAAA,IAC3B;AAEA,UAAM,IAAIC,eAAc,MAAM;AAC9B,UAAM,cAAcC,SAAQ,CAAC;AAC7B,UAAM,WAAWC,UAAS,GAAG,WAAW;AACxC,UAAM,OAAOC,UAAS,CAAC;AACvB,UAAM,YAAYC,uBAAsB,GAAG,WAAW;AACtD,UAAM,SAAS,oBAAI,IAAoB;AACvC,eAAW,OAAO,YAAY,KAAK,GAAG;AACpC,aAAO,IAAI,KAAK,aAAa,GAAG,EAAE;AAAA,IACpC;AACA,UAAM,YAAYC,kBAAiB,GAAG,aAAa,MAAM;AAEzD,UAAM,aAAS,kBAAAG,SAAY,WAAW,cAAc;AACpD,oCAAU,QAAQ,EAAE,WAAW,KAAK,CAAC;AAErC,UAAM,SAASF;AAAA,MACb;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA,EAAE,OAAO,GAAG,QAAQ,EAAE;AAAA,MACtB;AAAA,MACA;AAAA,IACF;AACA,4CAAc,kBAAAE,SAAY,QAAQ,iBAAiB,GAAG,QAAQ,OAAO;AACrE,IAAAD,QAAO,GAAG,iBAAa,kBAAAC,SAAY,QAAQ,YAAY,GAAG,EAAE,iBAAiB,OAAO,CAAC;AAGrF,UAAM,eAAW,kBAAAA,SAAY,QAAQ,cAAc;AACnD,YAAI,6BAAW,QAAQ,GAAG;AACxB,uCAAW,QAAQ;AAAA,IACrB;AAEA,YAAQ;AAAA,MACN,6BAA6B,EAAE,KAAK,WAAW,EAAE,IAAI,WAAW,YAAY,IAAI;AAAA,IAClF;AACA,YAAQ;AAAA,MACN,8DAA8D,MAAM;AAAA,IACtE;AACA,WAAO;AAAA,EACT,SAAS,KAAK;AACZ,YAAQ;AAAA,MACN,oCAAoC,eAAe,QAAQ,IAAI,UAAU,GAAG;AAAA,IAC9E;AACA,WAAO;AAAA,EACT;AACF;AAMA,SAAS,WAAW,WAAyB;AAC3C,QAAM,aAAS,kBAAAA,SAAY,WAAW,cAAc;AACpD,kCAAU,QAAQ,EAAE,WAAW,KAAK,CAAC;AACrC,QAAM,eAAW,kBAAAA,SAAY,QAAQ,cAAc;AACnD,sCAAc,UAAU,KAAK,OAAO;AACpC,UAAQ,IAAI;AAAA,oDAAuD,SAAS,EAAE;AAC9E,UAAQ;AAAA,IACN;AAAA,EACF;AACA,UAAQ;AAAA,IACN;AAAA,EACF;AACA,UAAQ,IAAI,oCAAoC,QAAQ,EAAE;AAC5D;AAEA,SAAS,WAAW,cAAiC;AACnD,SAAO,aAAa,KAAK,CAAC,MAAM,CAAC,gBAAgB,QAAI,2BAAQ,CAAC,EAAE,YAAY,CAAC,CAAC;AAChF;AAMA,eAAsB,MACpB,WACA,WAAmB,GACJ;AACf,MAAI;AACJ,MAAI;AACF,eAAW,MAAM,OAAO,UAAU;AAAA,EACpC,QAAQ;AACN,UAAM,IAAI,MAAM,mDAAmD;AAAA,EACrE;AAEA,QAAM,mBAAe,kBAAAA,SAAY,SAAS;AAC1C,MAAI,cAAc;AAClB,MAAI,UAAU;AACd,QAAM,UAAU,oBAAI,IAAY;AAEhC,QAAM,UAAU,SAAS,MAAM,cAAc;AAAA,IAC3C,YAAY;AAAA,IACZ,eAAe;AAAA,IACf,gBAAgB;AAAA,IAChB,SAAS;AAAA,MACP;AAAA,MACA;AAAA,MACA;AAAA,IACF;AAAA,EACF,CAAC;AAED,UAAQ,GAAG,OAAO,CAAC,QAAgB,aAAqB;AACtD,UAAM,UAAM,2BAAQ,QAAQ,EAAE,YAAY;AAC1C,QAAI,CAAC,mBAAmB,IAAI,GAAG,EAAG;AAGlC,UAAM,QAAQ,SAAS,MAAM,GAAG;AAChC,QAAI,MAAM,KAAK,CAAC,SAAS,KAAK,WAAW,GAAG,KAAK,SAAS,GAAG,EAAG;AAEhE,kBAAc,KAAK,IAAI;AACvB,cAAU;AACV,YAAQ,IAAI,QAAQ;AAAA,EACtB,CAAC;AAED,UAAQ;AAAA,IACN,6BAA6B,YAAY;AAAA,EAC3C;AACA,UAAQ;AAAA,IACN;AAAA,EACF;AACA,UAAQ,IAAI,8BAA8B,QAAQ,GAAG;AAErD,QAAM,aAAa,WAAW;AAE9B,QAAM,OAAO,YAAY,YAAY;AACnC,QAAI,WAAW,KAAK,IAAI,IAAI,eAAe,YAAY;AACrD,gBAAU;AACV,YAAM,QAAQ,CAAC,GAAG,OAAO;AACzB,cAAQ,MAAM;AACd,cAAQ,IAAI;AAAA,mBAAsB,MAAM,MAAM,kBAAkB;AAChE,UAAI,WAAW,KAAK,GAAG;AACrB,mBAAW,SAAS;AAAA,MACtB,OAAO;AACL,cAAM,YAAY,SAAS;AAAA,MAC7B;AAAA,IACF;AAAA,EACF,GAAG,GAAG;AAGN,QAAM,UAAU,MAAM;AACpB,YAAQ,IAAI,6BAA6B;AACzC,kBAAc,IAAI;AAClB,YAAQ,MAAM;AACd,YAAQ,KAAK,CAAC;AAAA,EAChB;AAEA,UAAQ,GAAG,UAAU,OAAO;AAC5B,UAAQ,GAAG,WAAW,OAAO;AAC/B;AAMA,IAAMC,qBAAoB,OAAO,YAAY,eAC3C,OAAO,QAAQ,KAAK,CAAC,MAAM,YAC3B,6BAA6B,SAAK,4BAAS,QAAQ,KAAK,CAAC,CAAC,CAAC;AAE7D,IAAIA,oBAAmB;AACrB,QAAM,YAAY,QAAQ,KAAK,CAAC,KAAK;AACrC,QAAM,WAAW,QAAQ,KAAK,CAAC,IAAI,WAAW,QAAQ,KAAK,CAAC,CAAC,IAAI;AACjE,QAAM,WAAW,QAAQ,EAAE,MAAM,CAAC,QAAQ;AACxC,YAAQ,MAAM,GAAG;AACjB,YAAQ,KAAK,CAAC;AAAA,EAChB,CAAC;AACH;","names":["FileType","Graph","louvain","result","betweennessCentrality","pathResolve","import_node_path","import_node_fs","nodeCommunityMap","communityName","import_node_fs","import_node_crypto","import_node_fs","import_node_path","Parser","module","walkDir","import_node_fs","import_node_path","import_node_fs","import_node_path","communityName","import_node_fs","import_node_fs","import_node_path","import_node_crypto","import_node_fs","import_node_path","godNodes","safeFilename","pathResolve","import_node_fs","import_node_path","loadGraph","nid","d","resolve","isDirectExecution","import_node_fs","import_node_path","collectFiles","extractWithDiagnostics","buildFromJson","cluster","scoreAll","godNodes","surprisingConnections","suggestQuestions","generate","toJson","pathResolve","isDirectExecution"]}