@remnic/core 9.63.8 → 9.63.10

package/dist/chunk-UHGBNIOS.js.map

@@ -1 +0,0 @@
-{"version":3,"sources":["../src/topics.ts"],"sourcesContent":["/**\n * Topic Extraction (Phase 4B)\n *\n * Extract key topics from all memories using TF-IDF weighting.\n * Runs as a batch process during consolidation.\n */\n\nimport type { MemoryFile, TopicScore } from \"./types.js\";\n\n/** Stop words to exclude from topic extraction */\nconst STOP_WORDS = new Set([\n  \"a\", \"an\", \"the\", \"is\", \"are\", \"was\", \"were\", \"be\", \"been\", \"being\",\n  \"have\", \"has\", \"had\", \"do\", \"does\", \"did\", \"will\", \"would\", \"could\",\n  \"should\", \"may\", \"might\", \"must\", \"shall\", \"can\", \"need\", \"to\", \"of\",\n  \"in\", \"for\", \"on\", \"with\", \"at\", \"by\", \"from\", \"as\", \"into\", \"through\",\n  \"during\", \"before\", \"after\", \"above\", \"below\", \"between\", \"this\", \"that\",\n  \"these\", \"those\", \"i\", \"me\", \"my\", \"we\", \"our\", \"you\", \"your\", \"he\",\n  \"she\", \"it\", \"they\", \"them\", \"their\", \"what\", \"which\", \"who\", \"how\",\n  \"when\", \"where\", \"why\", \"and\", \"but\", \"or\", \"if\", \"because\", \"so\",\n  \"just\", \"about\", \"like\", \"also\", \"very\", \"really\", \"here\", \"there\",\n  \"now\", \"then\", \"only\", \"even\", \"still\", \"already\", \"always\", \"never\",\n  \"often\", \"sometimes\", \"usually\", \"well\", \"much\", \"more\", \"most\", \"some\",\n  \"any\", \"all\", \"each\", \"every\", \"both\", \"few\", \"many\", \"other\", \"same\",\n  \"such\", \"own\", \"than\", \"too\", \"very\", \"just\", \"over\", \"under\", \"again\",\n  \"further\", \"once\", \"here\", \"there\", \"when\", \"where\", \"why\", \"how\",\n  \"user\", \"agent\", \"memory\", \"fact\", \"preference\", \"using\", \"used\", \"use\",\n]);\n\n/**\n * Extract terms from content.\n * Returns normalized lowercase terms >= 3 chars.\n */\nfunction extractTerms(content: string): string[] {\n  return content\n    .toLowerCase()\n    .replace(/[^a-z0-9\\s-]/g, \" \")\n    .split(/\\s+/)\n    .filter((w) => w.length >= 3 && !STOP_WORDS.has(w));\n}\n\n/**\n * Calculate TF-IDF scores for terms across all memories.\n *\n * TF (term frequency) = count of term in document / total terms in document\n * IDF (inverse document frequency) = log(total documents / documents containing term)\n * TF-IDF = TF * IDF\n *\n * Terms with high TF-IDF are frequent in specific memories but rare overall.\n */\nexport function extractTopics(\n  memories: MemoryFile[],\n  topN: number = 50,\n): TopicScore[] {\n  if (memories.length === 0) return [];\n\n  // Count term frequency per document and document frequency\n  const docFreq = new Map<string, number>(); // term -> number of documents containing it\n  const termFreqPerDoc: Map<string, number>[] = []; // per-doc term frequencies\n\n  for (const memory of memories) {\n    const terms = extractTerms(memory.content);\n    const termFreq = new Map<string, number>();\n\n    for (const term of terms) {\n      termFreq.set(term, (termFreq.get(term) ?? 0) + 1);\n    }\n\n    // Track which terms appear in this document\n    for (const term of termFreq.keys()) {\n      docFreq.set(term, (docFreq.get(term) ?? 0) + 1);\n    }\n\n    termFreqPerDoc.push(termFreq);\n  }\n\n  const totalDocs = memories.length;\n\n  // Calculate TF-IDF for each term\n  const tfidfScores = new Map<string, { score: number; count: number }>();\n\n  for (let i = 0; i < memories.length; i++) {\n    const termFreq = termFreqPerDoc[i];\n    const totalTerms = [...termFreq.values()].reduce((a, b) => a + b, 0);\n\n    for (const [term, count] of termFreq) {\n      const tf = count / totalTerms;\n      const df = docFreq.get(term) ?? 1;\n      const idf = Math.log(totalDocs / df);\n      const tfidf = tf * idf;\n\n      const existing = tfidfScores.get(term);\n      if (existing) {\n        existing.score += tfidf;\n        existing.count += count;\n      } else {\n        tfidfScores.set(term, { score: tfidf, count });\n      }\n    }\n  }\n\n  // Convert to array and sort by score\n  const topics: TopicScore[] = [...tfidfScores.entries()]\n    .map(([term, { score, count }]) => ({ term, score, count }))\n    .sort((a, b) => b.score - a.score)\n    .slice(0, topN);\n\n  return topics;\n}\n\n/**\n * Compare two topic lists to find trending changes.\n * Returns topics that are new or significantly increased.\n */\nexport function findTrendingTopics(\n  currentTopics: TopicScore[],\n  previousTopics: TopicScore[],\n  threshold: number = 0.5,\n): { rising: TopicScore[]; falling: TopicScore[] } {\n  const prevMap = new Map(previousTopics.map((t) => [t.term, t.score]));\n  const currMap = new Map(currentTopics.map((t) => [t.term, t.score]));\n\n  const rising: TopicScore[] = [];\n  const falling: TopicScore[] = [];\n\n  for (const topic of currentTopics) {\n    const prevScore = prevMap.get(topic.term) ?? 0;\n    const change = topic.score - prevScore;\n\n    if (change > threshold) {\n      rising.push({ ...topic, score: change });\n    }\n  }\n\n  for (const topic of previousTopics) {\n    const currScore = currMap.get(topic.term) ?? 0;\n    const change = topic.score - currScore;\n\n    if (change > threshold && currScore < topic.score * 0.5) {\n      falling.push({ ...topic, score: change });\n    }\n  }\n\n  return {\n    rising: rising.sort((a, b) => b.score - a.score).slice(0, 10),\n    falling: falling.sort((a, b) => b.score - a.score).slice(0, 10),\n  };\n}\n"],"mappings":";AAUA,IAAM,aAAa,oBAAI,IAAI;AAAA,EACzB;AAAA,EAAK;AAAA,EAAM;AAAA,EAAO;AAAA,EAAM;AAAA,EAAO;AAAA,EAAO;AAAA,EAAQ;AAAA,EAAM;AAAA,EAAQ;AAAA,EAC5D;AAAA,EAAQ;AAAA,EAAO;AAAA,EAAO;AAAA,EAAM;AAAA,EAAQ;AAAA,EAAO;AAAA,EAAQ;AAAA,EAAS;AAAA,EAC5D;AAAA,EAAU;AAAA,EAAO;AAAA,EAAS;AAAA,EAAQ;AAAA,EAAS;AAAA,EAAO;AAAA,EAAQ;AAAA,EAAM;AAAA,EAChE;AAAA,EAAM;AAAA,EAAO;AAAA,EAAM;AAAA,EAAQ;AAAA,EAAM;AAAA,EAAM;AAAA,EAAQ;AAAA,EAAM;AAAA,EAAQ;AAAA,EAC7D;AAAA,EAAU;AAAA,EAAU;AAAA,EAAS;AAAA,EAAS;AAAA,EAAS;AAAA,EAAW;AAAA,EAAQ;AAAA,EAClE;AAAA,EAAS;AAAA,EAAS;AAAA,EAAK;AAAA,EAAM;AAAA,EAAM;AAAA,EAAM;AAAA,EAAO;AAAA,EAAO;AAAA,EAAQ;AAAA,EAC/D;AAAA,EAAO;AAAA,EAAM;AAAA,EAAQ;AAAA,EAAQ;AAAA,EAAS;AAAA,EAAQ;AAAA,EAAS;AAAA,EAAO;AAAA,EAC9D;AAAA,EAAQ;AAAA,EAAS;AAAA,EAAO;AAAA,EAAO;AAAA,EAAO;AAAA,EAAM;AAAA,EAAM;AAAA,EAAW;AAAA,EAC7D;AAAA,EAAQ;AAAA,EAAS;AAAA,EAAQ;AAAA,EAAQ;AAAA,EAAQ;AAAA,EAAU;AAAA,EAAQ;AAAA,EAC3D;AAAA,EAAO;AAAA,EAAQ;AAAA,EAAQ;AAAA,EAAQ;AAAA,EAAS;AAAA,EAAW;AAAA,EAAU;AAAA,EAC7D;AAAA,EAAS;AAAA,EAAa;AAAA,EAAW;AAAA,EAAQ;AAAA,EAAQ;AAAA,EAAQ;AAAA,EAAQ;AAAA,EACjE;AAAA,EAAO;AAAA,EAAO;AAAA,EAAQ;AAAA,EAAS;AAAA,EAAQ;AAAA,EAAO;AAAA,EAAQ;AAAA,EAAS;AAAA,EAC/D;AAAA,EAAQ;AAAA,EAAO;AAAA,EAAQ;AAAA,EAAO;AAAA,EAAQ;AAAA,EAAQ;AAAA,EAAQ;AAAA,EAAS;AAAA,EAC/D;AAAA,EAAW;AAAA,EAAQ;AAAA,EAAQ;AAAA,EAAS;AAAA,EAAQ;AAAA,EAAS;AAAA,EAAO;AAAA,EAC5D;AAAA,EAAQ;AAAA,EAAS;AAAA,EAAU;AAAA,EAAQ;AAAA,EAAc;AAAA,EAAS;AAAA,EAAQ;AACpE,CAAC;AAMD,SAAS,aAAa,SAA2B;AAC/C,SAAO,QACJ,YAAY,EACZ,QAAQ,iBAAiB,GAAG,EAC5B,MAAM,KAAK,EACX,OAAO,CAAC,MAAM,EAAE,UAAU,KAAK,CAAC,WAAW,IAAI,CAAC,CAAC;AACtD;AAWO,SAAS,cACd,UACA,OAAe,IACD;AACd,MAAI,SAAS,WAAW,EAAG,QAAO,CAAC;AAGnC,QAAM,UAAU,oBAAI,IAAoB;AACxC,QAAM,iBAAwC,CAAC;AAE/C,aAAW,UAAU,UAAU;AAC7B,UAAM,QAAQ,aAAa,OAAO,OAAO;AACzC,UAAM,WAAW,oBAAI,IAAoB;AAEzC,eAAW,QAAQ,OAAO;AACxB,eAAS,IAAI,OAAO,SAAS,IAAI,IAAI,KAAK,KAAK,CAAC;AAAA,IAClD;AAGA,eAAW,QAAQ,SAAS,KAAK,GAAG;AAClC,cAAQ,IAAI,OAAO,QAAQ,IAAI,IAAI,KAAK,KAAK,CAAC;AAAA,IAChD;AAEA,mBAAe,KAAK,QAAQ;AAAA,EAC9B;AAEA,QAAM,YAAY,SAAS;AAG3B,QAAM,cAAc,oBAAI,IAA8C;AAEtE,WAAS,IAAI,GAAG,IAAI,SAAS,QAAQ,KAAK;AACxC,UAAM,WAAW,eAAe,CAAC;AACjC,UAAM,aAAa,CAAC,GAAG,SAAS,OAAO,CAAC,EAAE,OAAO,CAAC,GAAG,MAAM,IAAI,GAAG,CAAC;AAEnE,eAAW,CAAC,MAAM,KAAK,KAAK,UAAU;AACpC,YAAM,KAAK,QAAQ;AACnB,YAAM,KAAK,QAAQ,IAAI,IAAI,KAAK;AAChC,YAAM,MAAM,KAAK,IAAI,YAAY,EAAE;AACnC,YAAM,QAAQ,KAAK;AAEnB,YAAM,WAAW,YAAY,IAAI,IAAI;AACrC,UAAI,UAAU;AACZ,iBAAS,SAAS;AAClB,iBAAS,SAAS;AAAA,MACpB,OAAO;AACL,oBAAY,IAAI,MAAM,EAAE,OAAO,OAAO,MAAM,CAAC;AAAA,MAC/C;AAAA,IACF;AAAA,EACF;AAGA,QAAM,SAAuB,CAAC,GAAG,YAAY,QAAQ,CAAC,EACnD,IAAI,CAAC,CAAC,MAAM,EAAE,OAAO,MAAM,CAAC,OAAO,EAAE,MAAM,OAAO,MAAM,EAAE,EAC1D,KAAK,CAAC,GAAG,MAAM,EAAE,QAAQ,EAAE,KAAK,EAChC,MAAM,GAAG,IAAI;AAEhB,SAAO;AACT;AAMO,SAAS,mBACd,eACA,gBACA,YAAoB,KAC6B;AACjD,QAAM,UAAU,IAAI,IAAI,eAAe,IAAI,CAAC,MAAM,CAAC,EAAE,MAAM,EAAE,KAAK,CAAC,CAAC;AACpE,QAAM,UAAU,IAAI,IAAI,cAAc,IAAI,CAAC,MAAM,CAAC,EAAE,MAAM,EAAE,KAAK,CAAC,CAAC;AAEnE,QAAM,SAAuB,CAAC;AAC9B,QAAM,UAAwB,CAAC;AAE/B,aAAW,SAAS,eAAe;AACjC,UAAM,YAAY,QAAQ,IAAI,MAAM,IAAI,KAAK;AAC7C,UAAM,SAAS,MAAM,QAAQ;AAE7B,QAAI,SAAS,WAAW;AACtB,aAAO,KAAK,EAAE,GAAG,OAAO,OAAO,OAAO,CAAC;AAAA,IACzC;AAAA,EACF;AAEA,aAAW,SAAS,gBAAgB;AAClC,UAAM,YAAY,QAAQ,IAAI,MAAM,IAAI,KAAK;AAC7C,UAAM,SAAS,MAAM,QAAQ;AAE7B,QAAI,SAAS,aAAa,YAAY,MAAM,QAAQ,KAAK;AACvD,cAAQ,KAAK,EAAE,GAAG,OAAO,OAAO,OAAO,CAAC;AAAA,IAC1C;AAAA,EACF;AAEA,SAAO;AAAA,IACL,QAAQ,OAAO,KAAK,CAAC,GAAG,MAAM,EAAE,QAAQ,EAAE,KAAK,EAAE,MAAM,GAAG,EAAE;AAAA,IAC5D,SAAS,QAAQ,KAAK,CAAC,GAAG,MAAM,EAAE,QAAQ,EAAE,KAAK,EAAE,MAAM,GAAG,EAAE;AAAA,EAChE;AACF;","names":[]}

package/dist/chunk-ULZFZL7K.js.map

@@ -1 +0,0 @@
-{"version":3,"sources":["../src/entity-retrieval.ts"],"sourcesContent":["import { resolveNamespaceCapabilities } from \"./capabilities.js\";\nimport { renderAuthorityBoundContent } from \"./recall-context-composition.js\";\nimport { createHash } from \"node:crypto\";\nimport { sanitizeMemoryContent } from \"./sanitize.js\";\nimport { mkdir, readFile, writeFile } from \"node:fs/promises\";\nimport path from \"node:path\";\nimport { collectNativeKnowledgeChunks, type NativeKnowledgeChunk } from \"./native-knowledge.js\";\nimport { compareEntityTimestamps, normalizeEntityName, type StorageManager } from \"./storage.js\";\nimport { normalizeEntityText, resolveRequestedEntitySectionKeys } from \"./entity-schema.js\";\nimport type { EntityStructuredSection, MemoryFile, PluginConfig, TranscriptEntry } from \"./types.js\";\nimport { truncateGraphemeSafe } from \"./whitespace.js\";\nimport { containsPhrase } from \"./entity-retrieval-boundaries.js\";\nimport { buildOriginStructuredSections, sanitizeOriginatedFacts, type EntityOriginStructuredSection } from \"./entity-origin-fields.js\";\nimport {\n  checkEntityRecallAbort,\n  entityRecallSectionAbsent,\n  yieldEntityRecallScan,\n  yieldEntityRecallScanEvery,\n} from \"./entity-recall-cancellation.js\";\nconst ENTITY_INDEX_VERSION = 3;\nconst RECENT_TRANSCRIPT_LOOKBACK_HOURS = 24;\nconst INSTRUCTION_LIKE_RE = /\\b(always|never|must|should|remember to|do not|don't|process|workflow|template|checklist|instruction)\\b/i;\nconst METADATA_WRAPPER_RE = /^(source|context|metadata|notes?):/i;\nconst ENTITY_PRONOUN_RE = /\\b(he|him|his|she|her|they|them|their|it|its)\\b/i;\nconst BELIEF_LEDGER_SECTION_KEY = \"belief_ledger\";\nconst BELIEF_LEDGER_FACT_RE = /^claim=([^;]+);\\s*status=([^;]+);\\s*updatedAt=([^;]+);\\s*(.+)$/;\ntype EntityQueryMode = \"direct\" | \"timeline\" | \"follow_up\";\ntype EntityMentionIndexEntry = {\n  canonicalId: string;\n  name: string;\n  type: string;\n  summary?: string;\n  aliases: string[];\n  facts: string[];\n  timelineFacts: string[];\n  timelineFactOrigins?: Array<string | undefined>;\n  structuredSections: EntityOriginStructuredSection[];\n  timeline: Array<{\n    timestamp: string;\n    text: string;\n    source?: string;\n    sessionKey?: string;\n    principal?: string;\n    origin?: string;\n  }>;\n  relationships: Array<{ target: string; label: string }>;\n  activity: Array<{ date: string; note: string }>;\n  factCount: number;\n  memorySnippets: string[]; memorySnippetOrigins?: Array<string | undefined>;\n  nativeChunks: Array<{\n    chunkId: string;\n    title: string;\n    sourceKind: NativeKnowledgeChunk[\"sourceKind\"];\n    sourcePath: string;\n    snippet: string;\n    derivedDate?: string;\n  }>;\n};\ntype EntityMentionIndex = {\n  version: number;\n  updatedAt: string;\n  entityStatusVersion?: number;\n  entities: EntityMentionIndexEntry[];\n};\ntype EntityCandidate = {\n  entry: EntityMentionIndexEntry;\n  alias: string;\n  score: number;\n  source: \"query\" | \"recent_turn\";\n};\ntype EntityHintSnippet = {\n  text: string;\n  score: number;\n  kind: \"summary\" | \"fact\" | \"section\" | \"relationship\" | \"activity\" | \"memory\" | \"native\"; origin?: string;\n};\nexport interface BuildEntityRecallSectionOptions {\n  config: PluginConfig;\n  storage: StorageManager;\n  namespaceStorage?: (namespace: string) => Promise<StorageManager>;\n  query: string;\n  recallNamespaces?: string[];\n  recentTurns: number;\n  maxHints: number;\n  maxSupportingFacts: number;\n  maxRelatedEntities: number;\n  maxChars: number;\n  transcriptEntries: TranscriptEntry[];\n  originAuthorityEnabled?: boolean; untrustedOrigins?: readonly string[];\n  /**\n   * Cancels the build at its next checkpoint (issue #2291).  Entity recall reads\n   * every entity and memory file across the recalled namespaces, which is\n   * minutes of work on a large or slow store; without this the scan kept running\n   * after the recall that asked for it had been abandoned.\n   */\n  abortSignal?: AbortSignal;\n}\nfunction tokenize(value: string): string[] {\n  return normalizeEntityText(value).split(/\\s+/).filter((token) => token.length >= 2);\n}\nfunction uniqueStrings(values: string[]): string[] {\n  return [...new Set(values.map((value) => value.trim()).filter((value) => value.length > 0))];\n}\nfunction compactLine(value: string, maxLength: number = 220): string {\n  const normalized = value.replace(/\\s+/g, \" \").trim();\n  if (normalized.length <= maxLength) return normalized;\n  return `${truncateGraphemeSafe(normalized, maxLength - 1).trimEnd()}…`;\n}\nfunction dedupeHintSnippetsByText(snippets: EntityHintSnippet[]): EntityHintSnippet[] {\n  const deduped = new Map<string, EntityHintSnippet>();\n  for (const snippet of snippets) {\n    const key = normalizeEntityText(snippet.text);\n    const existing = deduped.get(key);\n    if (!existing) {\n      deduped.set(key, snippet);\n      continue;\n    }\n    if (existing.origin !== snippet.origin) {\n      existing.origin = undefined;\n    }\n  }\n  return [...deduped.values()];\n}\nfunction isBeliefLedgerSection(section: Pick<EntityStructuredSection, \"key\">): boolean {\n  return normalizeEntityText(section.key).replace(/\\s+/g, \"_\") === BELIEF_LEDGER_SECTION_KEY;\n}\nfunction beliefLedgerFactKeys(sections: EntityStructuredSection[]): Set<string> {\n  const keys = new Set<string>();\n  for (const section of sections) {\n    if (!isBeliefLedgerSection(section)) continue;\n    for (const fact of section.facts) {\n      keys.add(normalizeEntityText(fact));\n    }\n  }\n  return keys;\n}\ntype RecalledEntityFact = { text: string; sourceIndex: number };\nfunction recallFactsForStructuredSection(section: EntityStructuredSection): RecalledEntityFact[] {\n  if (!isBeliefLedgerSection(section)) {\n    return section.facts.map((text, sourceIndex) => ({ text, sourceIndex }));\n  }\n  return currentActiveBeliefLedgerFactTexts(section.facts);\n}\nfunction currentActiveBeliefLedgerFactTexts(facts: string[]): RecalledEntityFact[] {\n  const byClaim = new Map<string, { status: string; updatedAtMs: number; texts: RecalledEntityFact[] }>();\n  for (const [sourceIndex, fact] of facts.entries()) {\n    const match = BELIEF_LEDGER_FACT_RE.exec(fact.trim());\n    if (!match) continue;\n    const [, claimId, status, updatedAt, text] = match;\n    const updatedAtMs = Date.parse(updatedAt);\n    if (!claimId?.trim() || !status?.trim() || !Number.isFinite(updatedAtMs) || !text?.trim()) continue;\n    const normalizedStatus = status.trim().toLowerCase();\n    const normalizedClaimId = claimId.trim();\n    const current = byClaim.get(normalizedClaimId);\n    const inactiveTieWins =\n      current &&\n      updatedAtMs === current.updatedAtMs &&\n      current.status === \"active\" &&\n      normalizedStatus !== \"active\";\n    if (!current || updatedAtMs > current.updatedAtMs || inactiveTieWins) {\n      byClaim.set(normalizedClaimId, { status: normalizedStatus, updatedAtMs, texts: [{ text: text.trim(), sourceIndex }] });\n      continue;\n    }\n    if (updatedAtMs === current.updatedAtMs && current.status === normalizedStatus) {\n      current.texts.push({ text: text.trim(), sourceIndex });\n    }\n  }\n  return [...byClaim.values()].flatMap((current) => current.status === \"active\" ? current.texts : []);\n}\nfunction relationLine(entry: EntityMentionIndexEntry, relationship: { target: string; label: string }): string {\n  const normalizedLabel = relationship.label.replace(/\\s+/g, \" \").trim();\n  if (normalizedLabel.length === 0) return `${entry.name} is connected to ${relationship.target}`;\n  return `${entry.name} ${normalizedLabel} ${relationship.target}`;\n}\nfunction detectEntityQueryMode(query: string): EntityQueryMode | null {\n  const normalized = normalizeEntityText(query);\n  if (!normalized) return null;\n  if (\n    /^(what about|and what about|how about|what happened (with|to) (he|him|his|she|her|they|them|their|it|its)|did (he|she|they|it)|is (he|she|they|it)|was (he|she|they|it))\\b/.test(normalized)\n  ) {\n    return \"follow_up\";\n  }\n  if (\n    /^(who is|who s|what do we know about|what does|tell me about|what can you tell me about|what s new with|what happened with|what happened to|status of|where is|how is)\\b/.test(normalized)\n  ) {\n    if (/^what does\\b/.test(normalized)) {\n      if (/^what does (?:this|that|it|the|a|an|my|our|your|their)\\b/.test(normalized)) {\n        return null;\n      }\n      if (\n        /^what does [a-z0-9-]+ (?:error|warning|exception|failure|stack|trace|code|message|log)\\b/.test(normalized)\n        && /\\b(mean|means|indicate|indicates|imply|implies)\\b/.test(normalized)\n      ) {\n        return null;\n      }\n    }\n    return /what happened|what s new|status of|how is|where is/.test(normalized) ? \"timeline\" : \"direct\";\n  }\n  if (ENTITY_PRONOUN_RE.test(normalized) && normalized.split(/\\s+/).length <= 8) {\n    return \"follow_up\";\n  }\n  return null;\n}\nfunction scoreAliasMatch(query: string, alias: string): number {\n  const normalizedQuery = normalizeEntityText(query);\n  const normalizedAlias = normalizeEntityText(alias);\n  if (!normalizedAlias) return 0;\n  if (normalizedQuery === normalizedAlias) return 10;\n  if (containsPhrase(normalizedQuery, normalizedAlias)) return 8 + Math.min(normalizedAlias.split(/\\s+/).length, 3);\n  const queryTokens = new Set(tokenize(normalizedQuery));\n  const aliasTokens = tokenize(normalizedAlias);\n  if (aliasTokens.length === 0) return 0;\n  const overlap = aliasTokens.filter((token) => queryTokens.has(token)).length;\n  if (overlap === 0) return 0;\n  // Cross-entity contamination guard (#682 PR 2/3 R-2). For multi-token\n  // aliases, partial-token overlap that hits ONLY shared common tokens\n  // (like \"person\" in \"Person-A1\" / \"Person-B1\") would surface every\n  // similarly-prefixed entity for a query that named only one. Require\n  // that the overlap include at least one DISTINCTIVE alias token —\n  // i.e. a token that does not also appear in any other entity's\n  // alias-token vocabulary. Since this function is pure / per-pair, we\n  // approximate \"distinctive\" by requiring the overlap to include at\n  // least one token that is not a substring-of common identifier\n  // affixes. The aliasTokens with length > 1 must contribute at least\n  // one non-affix overlap. \"Alice Example\" ([\"alice\", \"example\"])\n  // matched by query \"Tell me about Alice\" → overlap = 1 on \"alice\",\n  // and \"alice\" is not an affix → score = 1. \"Person-A1\" tokens\n  // [\"person\", \"a1\"] matched by query \"Who is Person-B1?\" → overlap =\n  // 1 on \"person\", and \"person\" IS an affix → score = 0.\n  if (aliasTokens.length > 1) {\n    const nonAffixOverlap = aliasTokens.filter(\n      (token) => queryTokens.has(token) && !isAliasAffixToken(token),\n    ).length;\n    if (nonAffixOverlap === 0) return 0;\n  }\n  return overlap;\n}\n/**\n * Tokens that look like type prefixes / generic role identifiers and\n * therefore should not, on their own, count as evidence that a\n * multi-token alias matches a query (#682 PR 2/3 R-2).\n *\n * Kept as a small explicit list rather than a regex so additions are\n * deliberate. The list mirrors the entity types listed in\n * `entity-schema.ts` plus the most common generic role identifiers\n * that frequently appear as the leading token of a display name.\n */\nconst ALIAS_AFFIX_TOKENS = new Set<string>([\n  \"person\", \"people\", \"user\", \"users\", \"team\", \"teams\",\n  \"project\", \"projects\", \"topic\", \"topics\",\n  \"org\", \"orgs\", \"organization\", \"organizations\", \"company\", \"companies\",\n  \"place\", \"places\", \"tool\", \"tools\", \"service\", \"services\",\n  \"system\", \"systems\", \"agent\", \"agents\", \"bot\", \"bots\",\n]);\nfunction isAliasAffixToken(token: string): boolean {\n  return ALIAS_AFFIX_TOKENS.has(token);\n}\nfunction isLikelyInstructionLike(value: string): boolean {\n  return INSTRUCTION_LIKE_RE.test(value) || METADATA_WRAPPER_RE.test(value);\n}\nfunction sanitizeEntityFact(fact: string): string {\n  const sanitized = sanitizeMemoryContent(fact);\n  const clean = sanitized.text.trim();\n  if (!clean) return \"\";\n  if (INSTRUCTION_LIKE_RE.test(clean) && clean.length > 100) return \"\";\n  return clean;\n}\nfunction scoreHintSnippet(snippet: EntityHintSnippet, queryTokens: string[]): EntityHintSnippet | null {\n  const normalized = normalizeEntityText(snippet.text);\n  if (!normalized) return null;\n  const scored = { ...snippet };\n  if (isLikelyInstructionLike(scored.text) && scored.kind !== \"summary\") {\n    scored.score -= 3;\n  }\n  const overlap = queryTokens.filter((token) => normalized.includes(token)).length;\n  scored.score += overlap * 2;\n  if (METADATA_WRAPPER_RE.test(scored.text)) scored.score -= 2;\n  if (scored.text.length <= 160) scored.score += 1;\n  return scored.score > 0 ? scored : null;\n}\nfunction sortTimelineEntriesDesc(\n  left: EntityMentionIndexEntry[\"timeline\"][number],\n  right: EntityMentionIndexEntry[\"timeline\"][number],\n): number {\n  const timestampOrder = compareEntityTimestamps(right.timestamp, left.timestamp);\n  if (timestampOrder !== 0) {\n    return timestampOrder;\n  }\n  return right.text.localeCompare(left.text);\n}\nfunction jaccardSimilarity(a: string, b: string): number {\n  const aTokens = new Set(tokenize(a));\n  const bTokens = new Set(tokenize(b));\n  if (aTokens.size === 0 || bTokens.size === 0) return 0;\n  let intersection = 0;\n  for (const token of aTokens) {\n    if (bTokens.has(token)) intersection += 1;\n  }\n  const union = new Set([...aTokens, ...bTokens]).size;\n  return union === 0 ? 0 : intersection / union;\n}\nfunction buildAliasIndex(entries: EntityMentionIndexEntry[]): Map<string, EntityMentionIndexEntry[]> {\n  const index = new Map<string, EntityMentionIndexEntry[]>();\n  for (const entry of entries) {\n    const aliases = uniqueStrings([entry.name, ...entry.aliases]).map(normalizeEntityText).filter(Boolean);\n    for (const alias of aliases) {\n      const existing = index.get(alias) ?? [];\n      existing.push(entry);\n      index.set(alias, existing);\n    }\n  }\n  return index;\n}\nasync function readNativeChunks(\n  config: PluginConfig,\n  recallNamespaces?: string[],\n): Promise<NativeKnowledgeChunk[]> {\n  if (!config.nativeKnowledge?.enabled) return [];\n  return collectNativeKnowledgeChunks({\n    workspaceDir: config.workspaceDir,\n    memoryDir: config.memoryDir,\n    config: config.nativeKnowledge,\n    recallNamespaces: resolveNamespaceCapabilities(config).namespaces ? recallNamespaces : undefined,\n    defaultNamespace: config.defaultNamespace,\n  }).catch(() => []);\n}\nasync function resolveEntityIndexStorages(\n  storage: StorageManager,\n  config: PluginConfig,\n  recallNamespaces?: string[],\n  namespaceStorage?: (namespace: string) => Promise<StorageManager>,\n): Promise<StorageManager[]> {\n  if (\n    !resolveNamespaceCapabilities(config).namespaces ||\n    !namespaceStorage ||\n    !recallNamespaces ||\n    recallNamespaces.length === 0\n  ) {\n    return [storage];\n  }\n  const storages: StorageManager[] = [];\n  const seenDirs = new Set<string>();\n  for (const namespace of uniqueStrings(recallNamespaces)) {\n    try {\n      const scopedStorage = await namespaceStorage(namespace);\n      const storageDir = path.resolve(scopedStorage.dir);\n      if (seenDirs.has(storageDir)) continue;\n      seenDirs.add(storageDir);\n      storages.push(scopedStorage);\n    } catch {\n      continue;\n    }\n  }\n  return storages.length > 0 ? storages : [storage];\n}\nfunction entityIndexStatePath(storage: StorageManager): string {\n  return path.join(storage.dir, \"state\", \"entity-mention-index.json\");\n}\n\nasync function readEntityIndexState(storage: StorageManager): Promise<EntityMentionIndex | null> {\n  const raw = await readFile(entityIndexStatePath(storage), \"utf-8\").catch(() => \"\");\n  if (!raw) return null;\n  try {\n    const parsed = JSON.parse(raw) as Partial<EntityMentionIndex>;\n    if (parsed.version !== ENTITY_INDEX_VERSION || !Array.isArray(parsed.entities)) return null;\n    return parsed as EntityMentionIndex;\n  } catch {\n    return null;\n  }\n}\nasync function readCurrentPersistedEntityIndex(\n  storage: StorageManager,\n  config: PluginConfig,\n  recallNamespaces?: string[],\n  namespaceStorage?: (namespace: string) => Promise<StorageManager>,\n): Promise<EntityMentionIndex | null> {\n  if (\n    resolveNamespaceCapabilities(config).namespaces &&\n    namespaceStorage &&\n    recallNamespaces &&\n    recallNamespaces.length > 0\n  ) {\n    return null;\n  }\n  const index = await readEntityIndexState(storage);\n  if (!index || index.entityStatusVersion !== storage.getMemoryStatusVersion()) {\n    return null;\n  }\n  return index;\n}\nconst namespaceEntityIndexCache = new Map<string, EntityMentionIndex>();\nconst MAX_NAMESPACE_ENTITY_INDEX_CACHE_ENTRIES = 32;\n\nfunction nativeEntityIndexRevision(chunks: NativeKnowledgeChunk[]): string {\n  const projection = chunks.map((chunk) => [\n    chunk.chunkId,\n    chunk.sourcePath,\n    chunk.title,\n    chunk.sourceKind,\n    uniqueStrings(chunk.aliases ?? []),\n    compactLine(chunk.content, 180),\n    chunk.derivedDate ?? null,\n  ]);\n  return createHash(\"sha256\").update(JSON.stringify(projection)).digest(\"hex\");\n}\nfunction namespaceEntityIndexCacheKey(\n  storages: StorageManager[],\n  recallNamespaces: string[],\n  nativeRevision: string,\n): string {\n  const namespaceKey = uniqueStrings(recallNamespaces).join(\"\\u001f\");\n  const storageKey = storages\n    .map((scopedStorage) => {\n      const aliases = Object.entries(scopedStorage.entityAliases)\n        .sort(([left], [right]) => left.localeCompare(right));\n      return (\n        `${path.resolve(scopedStorage.dir)}@${scopedStorage.getMemoryStatusVersion()}` +\n        `:${scopedStorage.getMemoryCorpusVersion()}:${scopedStorage.getEntityMutationVersion()}` +\n        `:${scopedStorage.hotCacheKeyId()}:${JSON.stringify(aliases)}`\n      );\n    })\n    .join(\"\\u001f\");\n  return `${namespaceKey}\\u001e${storageKey}\\u001e${nativeRevision}`;\n}\nfunction rememberNamespaceEntityIndex(key: string, index: EntityMentionIndex): void {\n  if (namespaceEntityIndexCache.size >= MAX_NAMESPACE_ENTITY_INDEX_CACHE_ENTRIES) {\n    const oldestKey = namespaceEntityIndexCache.keys().next().value;\n    if (typeof oldestKey === \"string\") namespaceEntityIndexCache.delete(oldestKey);\n  }\n  namespaceEntityIndexCache.set(key, index);\n}\n\nasync function writeEntityIndexState(storage: StorageManager, index: EntityMentionIndex): Promise<void> {\n  const statePath = entityIndexStatePath(storage);\n  await mkdir(path.dirname(statePath), { recursive: true });\n  const nextContent = JSON.stringify(index, null, 2) + \"\\n\";\n  const currentContent = await readFile(statePath, \"utf-8\").catch(() => \"\");\n  if (currentContent === nextContent) return;\n  await writeFile(statePath, nextContent, \"utf-8\");\n}\n\nfunction nativePseudoCanonicalId(chunk: NativeKnowledgeChunk): string {\n  return `native:${createHash(\"sha256\").update(chunk.sourcePath).digest(\"hex\").slice(0, 12)}`;\n}\n\nfunction createPseudoNativeEntry(chunk: NativeKnowledgeChunk): EntityMentionIndexEntry {\n  const canonicalId = nativePseudoCanonicalId(chunk);\n  return {\n    canonicalId,\n    name: chunk.title,\n    type: chunk.sourceKind,\n    aliases: uniqueStrings(chunk.aliases ?? []),\n    facts: [],\n    structuredSections: [],\n    timelineFacts: [],\n    timeline: [],\n    relationships: [],\n    activity: [],\n    factCount: 0,\n    memorySnippets: [],\n    nativeChunks: [\n      {\n        chunkId: chunk.chunkId,\n        title: chunk.title,\n        sourceKind: chunk.sourceKind,\n        sourcePath: chunk.sourcePath,\n        snippet: compactLine(chunk.content, 180),\n        derivedDate: chunk.derivedDate,\n      },\n    ],\n  };\n}\n\nfunction mergeNativeChunk(entry: EntityMentionIndexEntry, chunk: NativeKnowledgeChunk): void {\n  const existing = entry.nativeChunks.find((item) => item.chunkId === chunk.chunkId);\n  if (existing) return;\n  entry.nativeChunks.push({\n    chunkId: chunk.chunkId,\n    title: chunk.title,\n    sourceKind: chunk.sourceKind,\n    sourcePath: chunk.sourcePath,\n    snippet: compactLine(chunk.content, 180),\n    derivedDate: chunk.derivedDate,\n  });\n  entry.aliases = uniqueStrings([...entry.aliases, ...(chunk.aliases ?? [])]);\n}\n\nfunction hasFreshNativeExplicitMention(\n  index: EntityMentionIndex,\n  nativeChunks: NativeKnowledgeChunk[],\n  query: string,\n): boolean {\n  if (nativeChunks.length === 0) return false;\n  const nativeCanonicalIds = new Set(nativeChunks.map(nativePseudoCanonicalId));\n  const freshNativeIndex: EntityMentionIndex = {\n    ...index,\n    entities: [\n      ...index.entities.filter((entry) => !nativeCanonicalIds.has(entry.canonicalId)),\n      ...nativeChunks.map(createPseudoNativeEntry),\n    ],\n  };\n  return resolveLanguageIndependentExplicitCandidates(freshNativeIndex, query).length > 0;\n}\n\nasync function buildEntityMentionIndex(\n  storage: StorageManager,\n  config: PluginConfig,\n  recallNamespaces?: string[],\n  namespaceStorage?: (namespace: string) => Promise<StorageManager>,\n  nativeChunksOverride?: NativeKnowledgeChunk[],\n  resolvedStorages?: StorageManager[],\n  abortSignal?: AbortSignal,\n): Promise<EntityMentionIndex> {\n  checkEntityRecallAbort(abortSignal);\n  const storages = resolvedStorages ?? await resolveEntityIndexStorages(\n    storage,\n    config,\n    recallNamespaces,\n    namespaceStorage,\n  );\n  const shouldPersistIndex =\n    storages.length === 1 && path.resolve(storages[0]!.dir) === path.resolve(storage.dir);\n  const entityStatusVersionBefore = shouldPersistIndex ? storage.getMemoryStatusVersion() : undefined;\n  const [previousIndex, entityFileSets, memorySets, nativeChunks] = await Promise.all([\n    shouldPersistIndex ? readEntityIndexState(storage) : Promise.resolve(null),\n    Promise.all(storages.map((scopedStorage) => scopedStorage.readAllEntityFiles({ abortSignal }))),\n    Promise.all(storages.map((scopedStorage) => scopedStorage.readAllMemories({ abortSignal }))),\n    nativeChunksOverride ? Promise.resolve(nativeChunksOverride) : readNativeChunks(config, recallNamespaces),\n  ]);\n  // The bulk reads now stop at their own scan boundaries (issue #2307); this\n  // checkpoint still guards the (larger) indexing pass over their results.\n  checkEntityRecallAbort(abortSignal);\n  // Pair each entity with the storage that owns it (#1534): canonical ids must\n  // reflect that store's aliases and historical migration mappings, never another\n  // namespace's.\n  const entityRecords = entityFileSets.flatMap((set, index) =>\n    set.map((entity) => ({ entity, storage: storages[index]! })),\n  );\n  const memories = memorySets.flat();\n\n  // The two passes over the corpus below never await real I/O, so without an\n  // explicit yield they hold the event loop and no recall section deadline can\n  // fire during them (issue #2291).\n  let scanned = 0;\n  const entities = new Map<string, EntityMentionIndexEntry>();\n  for (const { entity, storage: entityStorage } of entityRecords) {\n    scanned += 1;\n    await yieldEntityRecallScanEvery(scanned, abortSignal);\n    const canonicalId =\n      typeof entityStorage.normalizeEntityName === \"function\"\n        ? entityStorage.normalizeEntityName(entity.name, entity.type)\n        : normalizeEntityName(entity.name, entity.type, entityStorage.entityAliases);\n    const rawStructuredSections = entity.structuredSections ?? [];\n    const rawBeliefLedgerFactKeys = beliefLedgerFactKeys(rawStructuredSections);\n    const sanitizedFacts = entity.facts\n      .map((fact) => sanitizeEntityFact(fact))\n      .filter(Boolean)\n      .filter((fact) => !rawBeliefLedgerFactKeys.has(normalizeEntityText(fact)))\n      .map((fact) => compactLine(fact, 180));\n    const { facts: timelineFacts, origins: timelineFactOrigins } = sanitizeOriginatedFacts(\n      entity.timeline,\n      sanitizeEntityFact,\n      compactLine,\n      true,\n    );\n    const structuredSections = buildOriginStructuredSections(\n      rawStructuredSections,\n      recallFactsForStructuredSection,\n      sanitizeEntityFact,\n      compactLine,\n    );\n    entities.set(canonicalId, {\n      canonicalId,\n      name: entity.name,\n      type: entity.type,\n      aliases: uniqueStrings(entity.aliases),\n      summary: entity.synthesis?.trim() || entity.summary?.trim() || undefined,\n      facts: sanitizedFacts,\n      timelineFacts,\n      ...(timelineFactOrigins.some((origin) => origin !== undefined) ? { timelineFactOrigins } : {}),\n      structuredSections,\n      timeline: entity.timeline.map((entry) => ({ ...entry })),\n      relationships: entity.relationships.map((relationship) => ({ ...relationship })),\n      activity: entity.activity.map((activity) => ({ ...activity })),\n      factCount: sanitizedFacts.length,\n      memorySnippets: [],\n      nativeChunks: [],\n    });\n  }\n\n  scanned = 0;\n  for (const memory of memories) {\n    scanned += 1;\n    await yieldEntityRecallScanEvery(scanned, abortSignal);\n    const entry = typeof memory.frontmatter.entityRef === \"string\" ? entities.get(memory.frontmatter.entityRef) : undefined;\n    if (!entry) continue;\n    const snippet = await readMemorySnippet(memory);\n    if (entry.memorySnippets.includes(snippet)) continue;\n    entry.memorySnippets.push(snippet);\n    entry.memorySnippetOrigins = [...(entry.memorySnippetOrigins ?? []), memory.frontmatter.origin];\n  }\n  // Each remaining phase is another synchronous pass over the whole index\n  // (alias map, native-chunk merge, sort, two full serializations). Yield between\n  // them so a section deadline can fire between passes instead of only after all\n  // of them (issue #2291).\n  await yieldEntityRecallScan(abortSignal);\n  const aliasIndex = buildAliasIndex([...entities.values()]);\n  for (const chunk of nativeChunks) {\n    const existingPseudo = entities.get(nativePseudoCanonicalId(chunk));\n    if (existingPseudo) {\n      mergeNativeChunk(existingPseudo, chunk);\n      continue;\n    }\n    const candidateAliases = uniqueStrings([chunk.title, ...(chunk.aliases ?? [])]).map(normalizeEntityText).filter(Boolean);\n    let matched = false;\n    for (const alias of candidateAliases) {\n      for (const entry of aliasIndex.get(alias) ?? []) {\n        mergeNativeChunk(entry, chunk);\n        matched = true;\n      }\n    }\n    if (matched) continue;\n    const pseudoEntry = createPseudoNativeEntry(chunk);\n    entities.set(pseudoEntry.canonicalId, pseudoEntry);\n  }\n\n  await yieldEntityRecallScan(abortSignal);\n  const sortedEntities = [...entities.values()].sort((left, right) => left.name.localeCompare(right.name));\n  await yieldEntityRecallScan(abortSignal);\n  const previousEntities = previousIndex ? JSON.stringify(previousIndex.entities) : \"\";\n  await yieldEntityRecallScan(abortSignal);\n  const nextEntities = JSON.stringify(sortedEntities);\n  const entityStatusVersionAfter = shouldPersistIndex ? storage.getMemoryStatusVersion() : undefined;\n  const canPersistIndex = shouldPersistIndex && entityStatusVersionBefore === entityStatusVersionAfter;\n  const index: EntityMentionIndex = {\n    version: ENTITY_INDEX_VERSION,\n    updatedAt:\n      previousIndex && previousEntities === nextEntities\n        ? previousIndex.updatedAt\n        : new Date().toISOString(),\n    entityStatusVersion: canPersistIndex ? entityStatusVersionAfter : undefined,\n    entities: sortedEntities,\n  };\n  if (canPersistIndex) {\n    // A build the caller has abandoned must not leave a persisted index behind:\n    // the write is I/O the timed-out recall no longer needs, and the next recall\n    // is already competing for the same disk.\n    checkEntityRecallAbort(abortSignal);\n    await writeEntityIndexState(storage, index);\n  }\n  return index;\n}\n\nfunction resolveExplicitCandidates(\n  index: EntityMentionIndex,\n  query: string,\n): EntityCandidate[] {\n  const candidates: EntityCandidate[] = [];\n  for (const entry of index.entities) {\n    const aliases = uniqueStrings([entry.name, ...entry.aliases]);\n    let bestAlias = \"\";\n    let bestScore = 0;\n    for (const alias of aliases) {\n      const score = scoreAliasMatch(query, alias);\n      if (score > bestScore) {\n        bestAlias = alias;\n        bestScore = score;\n      }\n    }\n    if (bestScore <= 0) continue;\n    candidates.push({ entry, alias: bestAlias, score: bestScore, source: \"query\" });\n  }\n  return candidates.sort((left, right) => right.score - left.score);\n}\n\nconst EXPLICIT_ENTITY_MENTION_SCORE = 9;\n\nconst IMPLICIT_ENTITY_STOP_WORDS = new Set([\n  \"a\",\n  \"an\",\n  \"and\",\n  \"are\",\n  \"as\",\n  \"at\",\n  \"be\",\n  \"by\",\n  \"can\",\n  \"do\",\n  \"for\",\n  \"from\",\n  \"has\",\n  \"how\",\n  \"i\",\n  \"if\",\n  \"in\",\n  \"is\",\n  \"it\",\n  \"me\",\n  \"my\",\n  \"of\",\n  \"on\",\n  \"or\",\n  \"the\",\n  \"to\",\n  \"was\",\n  \"what\",\n  \"when\",\n  \"where\",\n  \"who\",\n  \"why\",\n  \"with\",\n  \"you\",\n  \"your\",\n]);\n\nfunction isDistinctiveImplicitAlias(normalizedAlias: string): boolean {\n  const tokens = normalizedAlias.split(/\\s+/).filter(Boolean);\n  if (tokens.length > 1 && tokens.every((token) => IMPLICIT_ENTITY_STOP_WORDS.has(token))) return false;\n  if (tokens.length !== 1) return true;\n  const token = tokens[0]!;\n  return Array.from(token).length > 1 && !IMPLICIT_ENTITY_STOP_WORDS.has(token);\n}\n\nfunction isShortLatinAlias(alias: string): boolean {\n  return /^[A-Za-z]{2,3}$/.test(alias.trim());\n}\n\nfunction hasStrongShortLatinAliasMention(query: string, alias: string): boolean {\n  const normalizedAlias = alias.trim();\n  const titleCaseAlias = `${normalizedAlias[0]!.toUpperCase()}${normalizedAlias.slice(1).toLowerCase()}`;\n  const forms = new Set([normalizedAlias, normalizedAlias.toUpperCase(), titleCaseAlias]);\n  return [...forms].some((form) => {\n    if (form === form.toLowerCase()) return false;\n    const escaped = form.replace(/[.*+?^${}()|[\\]\\\\]/g, \"\\\\$&\");\n    return new RegExp(`(?:^|[^A-Za-z0-9])${escaped}(?:$|[^A-Za-z0-9])`).test(query);\n  });\n}\n\nfunction resolveLanguageIndependentExplicitCandidates(\n  index: EntityMentionIndex,\n  query: string,\n): EntityCandidate[] {\n  const canonicalIdsByAlias = new Map<string, Set<string>>();\n  for (const entry of index.entities) {\n    for (const alias of uniqueStrings([entry.name, ...entry.aliases])) {\n      const normalizedAlias = normalizeEntityText(alias);\n      if (!normalizedAlias) continue;\n      const canonicalIds = canonicalIdsByAlias.get(normalizedAlias) ?? new Set<string>();\n      canonicalIds.add(entry.canonicalId);\n      canonicalIdsByAlias.set(normalizedAlias, canonicalIds);\n    }\n  }\n\n  const candidates: EntityCandidate[] = [];\n  for (const entry of index.entities) {\n    let bestAlias = \"\";\n    let bestScore = 0;\n    for (const alias of uniqueStrings([entry.name, ...entry.aliases])) {\n      const normalizedAlias = normalizeEntityText(alias);\n      const score = scoreAliasMatch(query, alias);\n      if (\n        !normalizedAlias ||\n        !isDistinctiveImplicitAlias(normalizedAlias) ||\n        (isShortLatinAlias(alias) && !hasStrongShortLatinAliasMention(query, alias)) ||\n        canonicalIdsByAlias.get(normalizedAlias)?.size !== 1 ||\n        score < EXPLICIT_ENTITY_MENTION_SCORE ||\n        score <= bestScore\n      ) {\n        continue;\n      }\n      bestAlias = alias;\n      bestScore = score;\n    }\n    if (bestAlias) {\n      candidates.push({ entry, alias: bestAlias, score: bestScore, source: \"query\" });\n    }\n  }\n\n  return candidates.sort(\n    (left, right) => right.score - left.score || left.entry.name.localeCompare(right.entry.name),\n  );\n}\n\nfunction resolveRecentTurnCandidates(\n  index: EntityMentionIndex,\n  transcriptEntries: TranscriptEntry[],\n  recentTurns: number,\n): EntityCandidate[] {\n  if (recentTurns <= 0 || transcriptEntries.length === 0) return [];\n  const recentEntries = transcriptEntries.slice(-recentTurns);\n  const candidates = new Map<string, EntityCandidate>();\n  for (let indexOffset = recentEntries.length - 1; indexOffset >= 0; indexOffset -= 1) {\n    const turn = recentEntries[indexOffset];\n    const recencyBoost = recentEntries.length - indexOffset;\n    const roleWeight = turn.role === \"user\" ? 2 : turn.role === \"assistant\" ? -1 : 0;\n    for (const entry of index.entities) {\n      const aliases = uniqueStrings([entry.name, ...entry.aliases]);\n      for (const alias of aliases) {\n        const score = scoreAliasMatch(turn.content, alias);\n        if (score <= 0) continue;\n        const current = candidates.get(entry.canonicalId);\n        const weightedScore = score + Math.max(0, 6 - recencyBoost) + roleWeight;\n        if (!current || weightedScore > current.score) {\n          candidates.set(entry.canonicalId, {\n            entry,\n            alias,\n            score: weightedScore,\n            source: \"recent_turn\",\n          });\n        }\n      }\n    }\n  }\n  return [...candidates.values()].sort((left, right) => right.score - left.score);\n}\n\nasync function readMemorySnippet(memory: MemoryFile): Promise<string> {\n  const content = memory.content.replace(/\\s+/g, \" \").trim();\n  return compactLine(content, 180);\n}\n\nasync function buildHintSnippets(\n  entry: EntityMentionIndexEntry,\n  queryTokens: string[],\n  mode: EntityQueryMode,\n  maxSupportingFacts: number,\n  requestedSectionKeys: Set<string>,\n): Promise<EntityHintSnippet[]> {\n  const snippets: EntityHintSnippet[] = [];\n  const aliasTokens = new Set(tokenize(uniqueStrings([entry.name, ...entry.aliases]).join(\" \")));\n  if (entry.summary) {\n    snippets.push({ text: compactLine(entry.summary, 180), score: 10, kind: \"summary\" });\n  }\n  if (requestedSectionKeys.size > 0) {\n    for (const section of entry.structuredSections) {\n      if (!requestedSectionKeys.has(normalizeEntityText(section.key).replace(/\\s+/g, \"_\"))) continue;\n      for (const [index, fact] of section.facts.entries()) {\n        snippets.push({\n          text: fact,\n          score: mode === \"direct\" ? 8 : 9,\n          kind: \"section\",\n          origin: section.factOrigins?.[index],\n        });\n      }\n    }\n  } else {\n    for (const [index, fact] of entry.timelineFacts.entries()) {\n      snippets.push({\n        text: fact,\n        score: mode === \"direct\" ? 6 : 7,\n        kind: \"fact\",\n        origin: entry.timelineFactOrigins?.[index],\n      });\n    }\n    for (const section of entry.structuredSections) {\n      for (const [index, fact] of section.facts.entries()) {\n        const normalizedFact = normalizeEntityText(fact);\n        const hasNonAliasQueryOverlap = queryTokens.some((token) =>\n          !aliasTokens.has(token) && normalizedFact.includes(token)\n        );\n        if (entry.timelineFacts.length > 0 && !hasNonAliasQueryOverlap) {\n          continue;\n        }\n        snippets.push({\n          text: fact,\n          score: mode === \"direct\" ? 6 : 7,\n          kind: \"fact\",\n          origin: section.factOrigins?.[index],\n        });\n      }\n    }\n    if (entry.timelineFacts.length === 0 && entry.structuredSections.length === 0) {\n      for (const fact of entry.facts) {\n        if (!fact.trim()) continue;\n        snippets.push({ text: fact, score: mode === \"direct\" ? 6 : 7, kind: \"fact\" });\n      }\n    }\n  }\n\n  if (requestedSectionKeys.size === 0) {\n    for (const relationship of entry.relationships) {\n      snippets.push({\n        text: compactLine(relationLine(entry, relationship), 180),\n        score: mode === \"direct\" && entry.type.toLowerCase() === \"person\" ? 6 : 4,\n        kind: \"relationship\",\n      });\n    }\n\n    for (const activity of entry.activity) {\n      snippets.push({\n        text: compactLine(`${activity.date}: ${activity.note}`, 180),\n        score: 4,\n        kind: \"activity\",\n      });\n    }\n\n    for (const [index, memorySnippet] of entry.memorySnippets.slice(0, Math.min(maxSupportingFacts, 4)).entries()) {\n      snippets.push({ text: memorySnippet, score: 5, kind: \"memory\", origin: entry.memorySnippetOrigins?.[index] });\n    }\n\n    for (const chunk of entry.nativeChunks) {\n      snippets.push({\n        text: compactLine(chunk.snippet, 180),\n        score: 3,\n        kind: \"native\",\n      });\n    }\n  }\n\n  const deduped = new Map<string, EntityHintSnippet>();\n  for (const snippet of snippets) {\n    const scored = scoreHintSnippet(snippet, queryTokens);\n    if (!scored) continue;\n    const normalized = normalizeEntityText(scored.text);\n    const existing = deduped.get(normalized);\n    if (!existing) {\n      deduped.set(normalized, scored);\n    } else if (existing.origin !== scored.origin) {\n      deduped.set(normalized, { ...(scored.score > existing.score ? scored : existing), origin: undefined });\n    } else if (scored.score > existing.score) {\n      deduped.set(normalized, scored);\n    }\n  }\n\n  return [...deduped.values()]\n    .filter((snippet) => snippet.score > 0)\n    .sort((left, right) => right.score - left.score)\n    .slice(0, maxSupportingFacts);\n}\n\nfunction summarizeUncertainty(snippets: EntityHintSnippet[]): string | null {\n  const direct = snippets.filter((snippet) =>\n    snippet.kind === \"summary\"\n    || snippet.kind === \"fact\"\n    || snippet.kind === \"section\"\n    || snippet.kind === \"memory\"\n  );\n  if (direct.length < 2) return null;\n  for (let index = 0; index < direct.length; index += 1) {\n    for (let compare = index + 1; compare < direct.length; compare += 1) {\n      if (jaccardSimilarity(direct[index].text, direct[compare].text) < 0.2) {\n        return \"Evidence is mixed across stored facts; treat the hints below as partial and verify before answering definitively.\";\n      }\n    }\n  }\n  return null;\n}\n\nfunction formatEntityHintSection(\n  candidates: Array<{\n    candidate: EntityCandidate;\n    snippets: EntityHintSnippet[];\n    uncertainty: string | null;\n  }>,\n  queryTokens: string[],\n  mode: EntityQueryMode,\n  maxRelatedEntities: number,\n  maxChars: number,\n  originAuthorityEnabled: boolean, untrustedOrigins: readonly string[],\n): string | null {\n  if (candidates.length === 0) return null;\n  const lines: string[] = [\"## entity_answer_hints\", \"\"];\n  // #1955 review: non-native snippet kinds may embed extraction-written content\n  // without per-field origin — fence as unknown (least privilege; plumbing #2397).\n  const renderSnippet = (snippet: EntityHintSnippet): string => snippet.kind !== \"native\"\n    ? renderAuthorityBoundContent(snippet.text, snippet.origin, { enabled: originAuthorityEnabled, untrustedOrigins }) : snippet.text;\n  // (see comment above)\n  // #1955 review: inline fields (names/types/aliases/targets) cannot carry the\n  // multi-line block fence without collapsing the hint list structure —\n  // per-field origin plumbing is tracked in #2397.\n  for (const { candidate, snippets, uncertainty } of candidates) {\n    const hasSummary = Boolean(candidate.entry.summary?.trim());\n    const preferredTopSnippets = hasSummary\n      ? snippets.filter((snippet) => snippet.kind !== \"fact\")\n      : snippets;\n    let topSnippets = (\n      preferredTopSnippets.length > 0 ? preferredTopSnippets : snippets\n    ).slice(0, 3);\n    const buildTimelineSnippets = (seedExcludedTexts: Set<string>): EntityHintSnippet[] => {\n      const explicitTimelinePool = dedupeHintSnippetsByText(\n        (candidate.entry.timeline ?? [])\n          .slice()\n          .sort(sortTimelineEntriesDesc)\n          .map((entry) => {\n            const text = sanitizeEntityFact(entry.text);\n            return text\n              ? scoreHintSnippet({\n                text: compactLine(text, 180),\n                score: 7,\n                kind: \"activity\" as const,\n                origin: entry.origin,\n              }, queryTokens)\n              : null;\n          })\n          .filter((snippet): snippet is EntityHintSnippet => snippet !== null)\n          .filter((snippet) => !seedExcludedTexts.has(normalizeEntityText(snippet.text))),\n      ).slice(0, 2);\n      const activityTimelinePool = dedupeHintSnippetsByText(\n        snippets\n          .filter((snippet) => (\n            snippet.kind === \"activity\" || snippet.kind === \"memory\"\n          ) && !seedExcludedTexts.has(normalizeEntityText(snippet.text))),\n      ).slice(0, 2);\n      return explicitTimelinePool.length > 0\n        ? explicitTimelinePool\n        : activityTimelinePool.length > 0\n          ? activityTimelinePool\n          : dedupeHintSnippetsByText(\n            snippets\n              .filter((snippet) => (\n                snippet.kind === \"fact\" || snippet.kind === \"summary\"\n              ) && !seedExcludedTexts.has(normalizeEntityText(snippet.text))),\n          ).slice(0, 2);\n    };\n    const baseTopSnippetTexts = new Set(topSnippets.map((snippet) => normalizeEntityText(snippet.text)));\n    const timelinePool = mode !== \"direct\" ? buildTimelineSnippets(baseTopSnippetTexts) : [];\n    if (mode !== \"direct\" && hasSummary && topSnippets.length < 2) {\n      if (timelinePool.length > 0) {\n        topSnippets = [...topSnippets, timelinePool[0]!].slice(0, 3);\n      }\n    }\n    const topSnippetTexts = new Set(topSnippets.map((snippet) => normalizeEntityText(snippet.text)));\n    lines.push(`- target: ${candidate.entry.name} (${candidate.entry.type})`);\n    lines.push(`- resolution: ${candidate.source === \"recent_turn\" ? \"carried forward from recent turns via alias\" : \"matched alias\"} \"${candidate.alias}\"${candidate.source === \"recent_turn\" ? \"\" : \" in the query\"}`);\n    if (uncertainty) lines.push(`- uncertainty: ${uncertainty}`);\n    if (topSnippets.length > 0) {\n      lines.push(\"- likely answer:\");\n      for (const snippet of topSnippets) {\n        lines.push(`  - ${renderSnippet(snippet)}`);\n      }\n    }\n    if (mode !== \"direct\") {\n      const fallbackTimeline = timelinePool.filter(\n        (snippet) => !topSnippetTexts.has(normalizeEntityText(snippet.text)),\n      );\n      if (fallbackTimeline.length > 0) {\n        lines.push(\"- recent timeline:\");\n        for (const snippet of fallbackTimeline) {\n          lines.push(`  - ${renderSnippet(snippet)}`);\n        }\n      }\n    }\n    const related = candidate.entry.relationships.slice(0, maxRelatedEntities).map((relationship) => relationship.target);\n    if (related.length > 0) {\n      lines.push(`- related entities: ${related.join(\", \")}`);\n    }\n    lines.push(`- support counts: facts=${candidate.entry.factCount}, memories=${candidate.entry.memorySnippets.length}, native=${candidate.entry.nativeChunks.length}`);\n    lines.push(\"\");\n  }\n\n  let result = lines.join(\"\\n\");\n  if (result.length > maxChars) {\n    result = `${truncateGraphemeSafe(result, Math.max(0, maxChars - 15)).trimEnd()}\\n\\n...(trimmed)\\n`;\n  }\n  return result.trim().length > 0 ? result.trimEnd() : null;\n}\n\nexport async function buildEntityRecallSection(options: BuildEntityRecallSectionOptions): Promise<string | null> {\n  // Checkpoints sit at the real I/O boundaries below (persisted-index read,\n  // native-chunk read, storage resolution, index build).  The per-candidate\n  // formatting that follows never awaits real I/O, so a deadline that fires\n  // during a scan is observed here (issue #2291).\n  checkEntityRecallAbort(options.abortSignal);\n  const prefixedMode = detectEntityQueryMode(options.query);\n  const persistedIndex = prefixedMode\n    ? null\n    : await readCurrentPersistedEntityIndex(\n      options.storage,\n      options.config,\n      options.recallNamespaces,\n      options.namespaceStorage,\n    );\n  checkEntityRecallAbort(options.abortSignal);\n  let nativeChunks: NativeKnowledgeChunk[] | undefined;\n  if (\n    !prefixedMode &&\n    persistedIndex &&\n    resolveLanguageIndependentExplicitCandidates(persistedIndex, options.query).length === 0\n  ) {\n    nativeChunks = await readNativeChunks(options.config, options.recallNamespaces);\n    if (!hasFreshNativeExplicitMention(persistedIndex, nativeChunks, options.query)) {\n      return entityRecallSectionAbsent(options.abortSignal);\n    }\n  }\n  const namespaceScoped =\n    resolveNamespaceCapabilities(options.config).namespaces &&\n    options.namespaceStorage !== undefined &&\n    (options.recallNamespaces?.length ?? 0) > 0;\n  if (namespaceScoped) {\n    nativeChunks = await readNativeChunks(options.config, options.recallNamespaces);\n  }\n  const resolvedStorages = namespaceScoped\n    ? await resolveEntityIndexStorages(\n      options.storage,\n      options.config,\n      options.recallNamespaces,\n      options.namespaceStorage,\n    )\n    : undefined;\n  const namespaceCacheKey =\n    resolvedStorages && options.recallNamespaces && nativeChunks\n      ? namespaceEntityIndexCacheKey(\n        resolvedStorages,\n        options.recallNamespaces,\n        nativeEntityIndexRevision(nativeChunks),\n      )\n      : undefined;\n  let index: EntityMentionIndex | undefined = namespaceCacheKey\n    ? namespaceEntityIndexCache.get(namespaceCacheKey)\n    : undefined;\n  checkEntityRecallAbort(options.abortSignal);\n  if (!index) {\n    index = await buildEntityMentionIndex(\n      options.storage,\n      options.config,\n      options.recallNamespaces,\n      options.namespaceStorage,\n      nativeChunks,\n      resolvedStorages,\n      options.abortSignal,\n    );\n    if (namespaceCacheKey) rememberNamespaceEntityIndex(namespaceCacheKey, index);\n  }\n  // Candidate resolution is another synchronous pass over every entity and alias,\n  // reached even on a cache hit that did no I/O at all — so yield here too, or a\n  // cached corpus could still hold the loop past the section budget (issue #2291).\n  await yieldEntityRecallScan(options.abortSignal);\n  const explicitCandidates = resolveExplicitCandidates(index, options.query);\n  await yieldEntityRecallScan(options.abortSignal);\n  const queryCandidates = prefixedMode\n    ? explicitCandidates\n    : resolveLanguageIndependentExplicitCandidates(index, options.query);\n  const mode = prefixedMode ?? (queryCandidates.length > 0 ? \"direct\" : null);\n  if (!mode) return entityRecallSectionAbsent(options.abortSignal);\n\n  const candidates = queryCandidates.length > 0\n    ? queryCandidates\n    : resolveRecentTurnCandidates(index, options.transcriptEntries, options.recentTurns);\n\n  if (candidates.length === 0) return entityRecallSectionAbsent(options.abortSignal);\n\n  const queryTokens = tokenize(options.query);\n  const candidateLimit = queryCandidates.length === 0 && mode === \"follow_up\"\n    ? 1\n    : options.maxHints;\n  const rankedCandidates = candidates.slice(0, candidateLimit);\n  const enriched = await Promise.all(\n    rankedCandidates.map(async (candidate) => {\n      const requestedSectionKeys = new Set(\n        resolveRequestedEntitySectionKeys(\n          options.query,\n          candidate.entry.type,\n          candidate.entry.structuredSections,\n          options.config.entitySchemas,\n        ),\n      );\n      const snippets = await buildHintSnippets(\n        candidate.entry,\n        queryTokens,\n        mode,\n        options.maxSupportingFacts,\n        requestedSectionKeys,\n      );\n      return {\n        candidate,\n        snippets,\n        uncertainty: summarizeUncertainty(snippets),\n      };\n    }),\n  );\n\n  const section = formatEntityHintSection(\n    enriched,\n    queryTokens,\n    mode,\n    options.maxRelatedEntities,\n    options.maxChars,\n    options.originAuthorityEnabled === true,\n    options.untrustedOrigins ?? [],\n  );\n  // `entityRecallSectionAbsent` so a cancelled build is not recorded as a\n  // successful section that simply found no entities.\n  if (!section) return entityRecallSectionAbsent(options.abortSignal);\n  return section;\n}\n\nexport async function readRecentEntityTranscriptEntries(\n  transcriptEntriesPromise: Promise<TranscriptEntry[]>,\n  recentTurns: number,\n): Promise<TranscriptEntry[]> {\n  if (recentTurns <= 0) return [];\n  const transcriptEntries = await transcriptEntriesPromise.catch(() => []);\n  if (transcriptEntries.length === 0) return [];\n  return transcriptEntries.slice(-Math.max(1, recentTurns * 2));\n}\n\nexport const entityIndexVersion = ENTITY_INDEX_VERSION;\nexport const entityRecentTranscriptLookbackHours = RECENT_TRANSCRIPT_LOOKBACK_HOURS;\n"],"mappings":";;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AAEA,SAAS,kBAAkB;AAE3B,SAAS,OAAO,UAAU,iBAAiB;AAC3C,OAAO,UAAU;AAcjB,IAAM,uBAAuB;AAC7B,IAAM,mCAAmC;AACzC,IAAM,sBAAsB;AAC5B,IAAM,sBAAsB;AAC5B,IAAM,oBAAoB;AAC1B,IAAM,4BAA4B;AAClC,IAAM,wBAAwB;AAuE9B,SAAS,SAAS,OAAyB;AACzC,SAAO,oBAAoB,KAAK,EAAE,MAAM,KAAK,EAAE,OAAO,CAAC,UAAU,MAAM,UAAU,CAAC;AACpF;AACA,SAAS,cAAc,QAA4B;AACjD,SAAO,CAAC,GAAG,IAAI,IAAI,OAAO,IAAI,CAAC,UAAU,MAAM,KAAK,CAAC,EAAE,OAAO,CAAC,UAAU,MAAM,SAAS,CAAC,CAAC,CAAC;AAC7F;AACA,SAAS,YAAY,OAAe,YAAoB,KAAa;AACnE,QAAM,aAAa,MAAM,QAAQ,QAAQ,GAAG,EAAE,KAAK;AACnD,MAAI,WAAW,UAAU,UAAW,QAAO;AAC3C,SAAO,GAAG,qBAAqB,YAAY,YAAY,CAAC,EAAE,QAAQ,CAAC;AACrE;AACA,SAAS,yBAAyB,UAAoD;AACpF,QAAM,UAAU,oBAAI,IAA+B;AACnD,aAAW,WAAW,UAAU;AAC9B,UAAM,MAAM,oBAAoB,QAAQ,IAAI;AAC5C,UAAM,WAAW,QAAQ,IAAI,GAAG;AAChC,QAAI,CAAC,UAAU;AACb,cAAQ,IAAI,KAAK,OAAO;AACxB;AAAA,IACF;AACA,QAAI,SAAS,WAAW,QAAQ,QAAQ;AACtC,eAAS,SAAS;AAAA,IACpB;AAAA,EACF;AACA,SAAO,CAAC,GAAG,QAAQ,OAAO,CAAC;AAC7B;AACA,SAAS,sBAAsB,SAAwD;AACrF,SAAO,oBAAoB,QAAQ,GAAG,EAAE,QAAQ,QAAQ,GAAG,MAAM;AACnE;AACA,SAAS,qBAAqB,UAAkD;AAC9E,QAAM,OAAO,oBAAI,IAAY;AAC7B,aAAW,WAAW,UAAU;AAC9B,QAAI,CAAC,sBAAsB,OAAO,EAAG;AACrC,eAAW,QAAQ,QAAQ,OAAO;AAChC,WAAK,IAAI,oBAAoB,IAAI,CAAC;AAAA,IACpC;AAAA,EACF;AACA,SAAO;AACT;AAEA,SAAS,gCAAgC,SAAwD;AAC/F,MAAI,CAAC,sBAAsB,OAAO,GAAG;AACnC,WAAO,QAAQ,MAAM,IAAI,CAAC,MAAM,iBAAiB,EAAE,MAAM,YAAY,EAAE;AAAA,EACzE;AACA,SAAO,mCAAmC,QAAQ,KAAK;AACzD;AACA,SAAS,mCAAmC,OAAuC;AACjF,QAAM,UAAU,oBAAI,IAAkF;AACtG,aAAW,CAAC,aAAa,IAAI,KAAK,MAAM,QAAQ,GAAG;AACjD,UAAM,QAAQ,sBAAsB,KAAK,KAAK,KAAK,CAAC;AACpD,QAAI,CAAC,MAAO;AACZ,UAAM,CAAC,EAAE,SAAS,QAAQ,WAAW,IAAI,IAAI;AAC7C,UAAM,cAAc,KAAK,MAAM,SAAS;AACxC,QAAI,CAAC,SAAS,KAAK,KAAK,CAAC,QAAQ,KAAK,KAAK,CAAC,OAAO,SAAS,WAAW,KAAK,CAAC,MAAM,KAAK,EAAG;AAC3F,UAAM,mBAAmB,OAAO,KAAK,EAAE,YAAY;AACnD,UAAM,oBAAoB,QAAQ,KAAK;AACvC,UAAM,UAAU,QAAQ,IAAI,iBAAiB;AAC7C,UAAM,kBACJ,WACA,gBAAgB,QAAQ,eACxB,QAAQ,WAAW,YACnB,qBAAqB;AACvB,QAAI,CAAC,WAAW,cAAc,QAAQ,eAAe,iBAAiB;AACpE,cAAQ,IAAI,mBAAmB,EAAE,QAAQ,kBAAkB,aAAa,OAAO,CAAC,EAAE,MAAM,KAAK,KAAK,GAAG,YAAY,CAAC,EAAE,CAAC;AACrH;AAAA,IACF;AACA,QAAI,gBAAgB,QAAQ,eAAe,QAAQ,WAAW,kBAAkB;AAC9E,cAAQ,MAAM,KAAK,EAAE,MAAM,KAAK,KAAK,GAAG,YAAY,CAAC;AAAA,IACvD;AAAA,EACF;AACA,SAAO,CAAC,GAAG,QAAQ,OAAO,CAAC,EAAE,QAAQ,CAAC,YAAY,QAAQ,WAAW,WAAW,QAAQ,QAAQ,CAAC,CAAC;AACpG;AACA,SAAS,aAAa,OAAgC,cAAyD;AAC7G,QAAM,kBAAkB,aAAa,MAAM,QAAQ,QAAQ,GAAG,EAAE,KAAK;AACrE,MAAI,gBAAgB,WAAW,EAAG,QAAO,GAAG,MAAM,IAAI,oBAAoB,aAAa,MAAM;AAC7F,SAAO,GAAG,MAAM,IAAI,IAAI,eAAe,IAAI,aAAa,MAAM;AAChE;AACA,SAAS,sBAAsB,OAAuC;AACpE,QAAM,aAAa,oBAAoB,KAAK;AAC5C,MAAI,CAAC,WAAY,QAAO;AACxB,MACE,6KAA6K,KAAK,UAAU,GAC5L;AACA,WAAO;AAAA,EACT;AACA,MACE,2KAA2K,KAAK,UAAU,GAC1L;AACA,QAAI,eAAe,KAAK,UAAU,GAAG;AACnC,UAAI,2DAA2D,KAAK,UAAU,GAAG;AAC/E,eAAO;AAAA,MACT;AACA,UACE,2FAA2F,KAAK,UAAU,KACvG,oDAAoD,KAAK,UAAU,GACtE;AACA,eAAO;AAAA,MACT;AAAA,IACF;AACA,WAAO,qDAAqD,KAAK,UAAU,IAAI,aAAa;AAAA,EAC9F;AACA,MAAI,kBAAkB,KAAK,UAAU,KAAK,WAAW,MAAM,KAAK,EAAE,UAAU,GAAG;AAC7E,WAAO;AAAA,EACT;AACA,SAAO;AACT;AACA,SAAS,gBAAgB,OAAe,OAAuB;AAC7D,QAAM,kBAAkB,oBAAoB,KAAK;AACjD,QAAM,kBAAkB,oBAAoB,KAAK;AACjD,MAAI,CAAC,gBAAiB,QAAO;AAC7B,MAAI,oBAAoB,gBAAiB,QAAO;AAChD,MAAI,eAAe,iBAAiB,eAAe,EAAG,QAAO,IAAI,KAAK,IAAI,gBAAgB,MAAM,KAAK,EAAE,QAAQ,CAAC;AAChH,QAAM,cAAc,IAAI,IAAI,SAAS,eAAe,CAAC;AACrD,QAAM,cAAc,SAAS,eAAe;AAC5C,MAAI,YAAY,WAAW,EAAG,QAAO;AACrC,QAAM,UAAU,YAAY,OAAO,CAAC,UAAU,YAAY,IAAI,KAAK,CAAC,EAAE;AACtE,MAAI,YAAY,EAAG,QAAO;AAgB1B,MAAI,YAAY,SAAS,GAAG;AAC1B,UAAM,kBAAkB,YAAY;AAAA,MAClC,CAAC,UAAU,YAAY,IAAI,KAAK,KAAK,CAAC,kBAAkB,KAAK;AAAA,IAC/D,EAAE;AACF,QAAI,oBAAoB,EAAG,QAAO;AAAA,EACpC;AACA,SAAO;AACT;AAWA,IAAM,qBAAqB,oBAAI,IAAY;AAAA,EACzC;AAAA,EAAU;AAAA,EAAU;AAAA,EAAQ;AAAA,EAAS;AAAA,EAAQ;AAAA,EAC7C;AAAA,EAAW;AAAA,EAAY;AAAA,EAAS;AAAA,EAChC;AAAA,EAAO;AAAA,EAAQ;AAAA,EAAgB;AAAA,EAAiB;AAAA,EAAW;AAAA,EAC3D;AAAA,EAAS;AAAA,EAAU;AAAA,EAAQ;AAAA,EAAS;AAAA,EAAW;AAAA,EAC/C;AAAA,EAAU;AAAA,EAAW;AAAA,EAAS;AAAA,EAAU;AAAA,EAAO;AACjD,CAAC;AACD,SAAS,kBAAkB,OAAwB;AACjD,SAAO,mBAAmB,IAAI,KAAK;AACrC;AACA,SAAS,wBAAwB,OAAwB;AACvD,SAAO,oBAAoB,KAAK,KAAK,KAAK,oBAAoB,KAAK,KAAK;AAC1E;AACA,SAAS,mBAAmB,MAAsB;AAChD,QAAM,YAAY,sBAAsB,IAAI;AAC5C,QAAM,QAAQ,UAAU,KAAK,KAAK;AAClC,MAAI,CAAC,MAAO,QAAO;AACnB,MAAI,oBAAoB,KAAK,KAAK,KAAK,MAAM,SAAS,IAAK,QAAO;AAClE,SAAO;AACT;AACA,SAAS,iBAAiB,SAA4B,aAAiD;AACrG,QAAM,aAAa,oBAAoB,QAAQ,IAAI;AACnD,MAAI,CAAC,WAAY,QAAO;AACxB,QAAM,SAAS,EAAE,GAAG,QAAQ;AAC5B,MAAI,wBAAwB,OAAO,IAAI,KAAK,OAAO,SAAS,WAAW;AACrE,WAAO,SAAS;AAAA,EAClB;AACA,QAAM,UAAU,YAAY,OAAO,CAAC,UAAU,WAAW,SAAS,KAAK,CAAC,EAAE;AAC1E,SAAO,SAAS,UAAU;AAC1B,MAAI,oBAAoB,KAAK,OAAO,IAAI,EAAG,QAAO,SAAS;AAC3D,MAAI,OAAO,KAAK,UAAU,IAAK,QAAO,SAAS;AAC/C,SAAO,OAAO,QAAQ,IAAI,SAAS;AACrC;AACA,SAAS,wBACP,MACA,OACQ;AACR,QAAM,iBAAiB,wBAAwB,MAAM,WAAW,KAAK,SAAS;AAC9E,MAAI,mBAAmB,GAAG;AACxB,WAAO;AAAA,EACT;AACA,SAAO,MAAM,KAAK,cAAc,KAAK,IAAI;AAC3C;AACA,SAAS,kBAAkB,GAAW,GAAmB;AACvD,QAAM,UAAU,IAAI,IAAI,SAAS,CAAC,CAAC;AACnC,QAAM,UAAU,IAAI,IAAI,SAAS,CAAC,CAAC;AACnC,MAAI,QAAQ,SAAS,KAAK,QAAQ,SAAS,EAAG,QAAO;AACrD,MAAI,eAAe;AACnB,aAAW,SAAS,SAAS;AAC3B,QAAI,QAAQ,IAAI,KAAK,EAAG,iBAAgB;AAAA,EAC1C;AACA,QAAM,SAAQ,oBAAI,IAAI,CAAC,GAAG,SAAS,GAAG,OAAO,CAAC,GAAE;AAChD,SAAO,UAAU,IAAI,IAAI,eAAe;AAC1C;AACA,SAAS,gBAAgB,SAA4E;AACnG,QAAM,QAAQ,oBAAI,IAAuC;AACzD,aAAW,SAAS,SAAS;AAC3B,UAAM,UAAU,cAAc,CAAC,MAAM,MAAM,GAAG,MAAM,OAAO,CAAC,EAAE,IAAI,mBAAmB,EAAE,OAAO,OAAO;AACrG,eAAW,SAAS,SAAS;AAC3B,YAAM,WAAW,MAAM,IAAI,KAAK,KAAK,CAAC;AACtC,eAAS,KAAK,KAAK;AACnB,YAAM,IAAI,OAAO,QAAQ;AAAA,IAC3B;AAAA,EACF;AACA,SAAO;AACT;AACA,eAAe,iBACb,QACA,kBACiC;AACjC,MAAI,CAAC,OAAO,iBAAiB,QAAS,QAAO,CAAC;AAC9C,SAAO,6BAA6B;AAAA,IAClC,cAAc,OAAO;AAAA,IACrB,WAAW,OAAO;AAAA,IAClB,QAAQ,OAAO;AAAA,IACf,kBAAkB,6BAA6B,MAAM,EAAE,aAAa,mBAAmB;AAAA,IACvF,kBAAkB,OAAO;AAAA,EAC3B,CAAC,EAAE,MAAM,MAAM,CAAC,CAAC;AACnB;AACA,eAAe,2BACb,SACA,QACA,kBACA,kBAC2B;AAC3B,MACE,CAAC,6BAA6B,MAAM,EAAE,cACtC,CAAC,oBACD,CAAC,oBACD,iBAAiB,WAAW,GAC5B;AACA,WAAO,CAAC,OAAO;AAAA,EACjB;AACA,QAAM,WAA6B,CAAC;AACpC,QAAM,WAAW,oBAAI,IAAY;AACjC,aAAW,aAAa,cAAc,gBAAgB,GAAG;AACvD,QAAI;AACF,YAAM,gBAAgB,MAAM,iBAAiB,SAAS;AACtD,YAAM,aAAa,KAAK,QAAQ,cAAc,GAAG;AACjD,UAAI,SAAS,IAAI,UAAU,EAAG;AAC9B,eAAS,IAAI,UAAU;AACvB,eAAS,KAAK,aAAa;AAAA,IAC7B,QAAQ;AACN;AAAA,IACF;AAAA,EACF;AACA,SAAO,SAAS,SAAS,IAAI,WAAW,CAAC,OAAO;AAClD;AACA,SAAS,qBAAqB,SAAiC;AAC7D,SAAO,KAAK,KAAK,QAAQ,KAAK,SAAS,2BAA2B;AACpE;AAEA,eAAe,qBAAqB,SAA6D;AAC/F,QAAM,MAAM,MAAM,SAAS,qBAAqB,OAAO,GAAG,OAAO,EAAE,MAAM,MAAM,EAAE;AACjF,MAAI,CAAC,IAAK,QAAO;AACjB,MAAI;AACF,UAAM,SAAS,KAAK,MAAM,GAAG;AAC7B,QAAI,OAAO,YAAY,wBAAwB,CAAC,MAAM,QAAQ,OAAO,QAAQ,EAAG,QAAO;AACvF,WAAO;AAAA,EACT,QAAQ;AACN,WAAO;AAAA,EACT;AACF;AACA,eAAe,gCACb,SACA,QACA,kBACA,kBACoC;AACpC,MACE,6BAA6B,MAAM,EAAE,cACrC,oBACA,oBACA,iBAAiB,SAAS,GAC1B;AACA,WAAO;AAAA,EACT;AACA,QAAM,QAAQ,MAAM,qBAAqB,OAAO;AAChD,MAAI,CAAC,SAAS,MAAM,wBAAwB,QAAQ,uBAAuB,GAAG;AAC5E,WAAO;AAAA,EACT;AACA,SAAO;AACT;AACA,IAAM,4BAA4B,oBAAI,IAAgC;AACtE,IAAM,2CAA2C;AAEjD,SAAS,0BAA0B,QAAwC;AACzE,QAAM,aAAa,OAAO,IAAI,CAAC,UAAU;AAAA,IACvC,MAAM;AAAA,IACN,MAAM;AAAA,IACN,MAAM;AAAA,IACN,MAAM;AAAA,IACN,cAAc,MAAM,WAAW,CAAC,CAAC;AAAA,IACjC,YAAY,MAAM,SAAS,GAAG;AAAA,IAC9B,MAAM,eAAe;AAAA,EACvB,CAAC;AACD,SAAO,WAAW,QAAQ,EAAE,OAAO,KAAK,UAAU,UAAU,CAAC,EAAE,OAAO,KAAK;AAC7E;AACA,SAAS,6BACP,UACA,kBACA,gBACQ;AACR,QAAM,eAAe,cAAc,gBAAgB,EAAE,KAAK,GAAQ;AAClE,QAAM,aAAa,SAChB,IAAI,CAAC,kBAAkB;AACtB,UAAM,UAAU,OAAO,QAAQ,cAAc,aAAa,EACvD,KAAK,CAAC,CAAC,IAAI,GAAG,CAAC,KAAK,MAAM,KAAK,cAAc,KAAK,CAAC;AACtD,WACE,GAAG,KAAK,QAAQ,cAAc,GAAG,CAAC,IAAI,cAAc,uBAAuB,CAAC,IACxE,cAAc,uBAAuB,CAAC,IAAI,cAAc,yBAAyB,CAAC,IAClF,cAAc,cAAc,CAAC,IAAI,KAAK,UAAU,OAAO,CAAC;AAAA,EAEhE,CAAC,EACA,KAAK,GAAQ;AAChB,SAAO,GAAG,YAAY,IAAS,UAAU,IAAS,cAAc;AAClE;AACA,SAAS,6BAA6B,KAAa,OAAiC;AAClF,MAAI,0BAA0B,QAAQ,0CAA0C;AAC9E,UAAM,YAAY,0BAA0B,KAAK,EAAE,KAAK,EAAE;AAC1D,QAAI,OAAO,cAAc,SAAU,2BAA0B,OAAO,SAAS;AAAA,EAC/E;AACA,4BAA0B,IAAI,KAAK,KAAK;AAC1C;AAEA,eAAe,sBAAsB,SAAyB,OAA0C;AACtG,QAAM,YAAY,qBAAqB,OAAO;AAC9C,QAAM,MAAM,KAAK,QAAQ,SAAS,GAAG,EAAE,WAAW,KAAK,CAAC;AACxD,QAAM,cAAc,KAAK,UAAU,OAAO,MAAM,CAAC,IAAI;AACrD,QAAM,iBAAiB,MAAM,SAAS,WAAW,OAAO,EAAE,MAAM,MAAM,EAAE;AACxE,MAAI,mBAAmB,YAAa;AACpC,QAAM,UAAU,WAAW,aAAa,OAAO;AACjD;AAEA,SAAS,wBAAwB,OAAqC;AACpE,SAAO,UAAU,WAAW,QAAQ,EAAE,OAAO,MAAM,UAAU,EAAE,OAAO,KAAK,EAAE,MAAM,GAAG,EAAE,CAAC;AAC3F;AAEA,SAAS,wBAAwB,OAAsD;AACrF,QAAM,cAAc,wBAAwB,KAAK;AACjD,SAAO;AAAA,IACL;AAAA,IACA,MAAM,MAAM;AAAA,IACZ,MAAM,MAAM;AAAA,IACZ,SAAS,cAAc,MAAM,WAAW,CAAC,CAAC;AAAA,IAC1C,OAAO,CAAC;AAAA,IACR,oBAAoB,CAAC;AAAA,IACrB,eAAe,CAAC;AAAA,IAChB,UAAU,CAAC;AAAA,IACX,eAAe,CAAC;AAAA,IAChB,UAAU,CAAC;AAAA,IACX,WAAW;AAAA,IACX,gBAAgB,CAAC;AAAA,IACjB,cAAc;AAAA,MACZ;AAAA,QACE,SAAS,MAAM;AAAA,QACf,OAAO,MAAM;AAAA,QACb,YAAY,MAAM;AAAA,QAClB,YAAY,MAAM;AAAA,QAClB,SAAS,YAAY,MAAM,SAAS,GAAG;AAAA,QACvC,aAAa,MAAM;AAAA,MACrB;AAAA,IACF;AAAA,EACF;AACF;AAEA,SAAS,iBAAiB,OAAgC,OAAmC;AAC3F,QAAM,WAAW,MAAM,aAAa,KAAK,CAAC,SAAS,KAAK,YAAY,MAAM,OAAO;AACjF,MAAI,SAAU;AACd,QAAM,aAAa,KAAK;AAAA,IACtB,SAAS,MAAM;AAAA,IACf,OAAO,MAAM;AAAA,IACb,YAAY,MAAM;AAAA,IAClB,YAAY,MAAM;AAAA,IAClB,SAAS,YAAY,MAAM,SAAS,GAAG;AAAA,IACvC,aAAa,MAAM;AAAA,EACrB,CAAC;AACD,QAAM,UAAU,cAAc,CAAC,GAAG,MAAM,SAAS,GAAI,MAAM,WAAW,CAAC,CAAE,CAAC;AAC5E;AAEA,SAAS,8BACP,OACA,cACA,OACS;AACT,MAAI,aAAa,WAAW,EAAG,QAAO;AACtC,QAAM,qBAAqB,IAAI,IAAI,aAAa,IAAI,uBAAuB,CAAC;AAC5E,QAAM,mBAAuC;AAAA,IAC3C,GAAG;AAAA,IACH,UAAU;AAAA,MACR,GAAG,MAAM,SAAS,OAAO,CAAC,UAAU,CAAC,mBAAmB,IAAI,MAAM,WAAW,CAAC;AAAA,MAC9E,GAAG,aAAa,IAAI,uBAAuB;AAAA,IAC7C;AAAA,EACF;AACA,SAAO,6CAA6C,kBAAkB,KAAK,EAAE,SAAS;AACxF;AAEA,eAAe,wBACb,SACA,QACA,kBACA,kBACA,sBACA,kBACA,aAC6B;AAC7B,yBAAuB,WAAW;AAClC,QAAM,WAAW,oBAAoB,MAAM;AAAA,IACzC;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,EACF;AACA,QAAM,qBACJ,SAAS,WAAW,KAAK,KAAK,QAAQ,SAAS,CAAC,EAAG,GAAG,MAAM,KAAK,QAAQ,QAAQ,GAAG;AACtF,QAAM,4BAA4B,qBAAqB,QAAQ,uBAAuB,IAAI;AAC1F,QAAM,CAAC,eAAe,gBAAgB,YAAY,YAAY,IAAI,MAAM,QAAQ,IAAI;AAAA,IAClF,qBAAqB,qBAAqB,OAAO,IAAI,QAAQ,QAAQ,IAAI;AAAA,IACzE,QAAQ,IAAI,SAAS,IAAI,CAAC,kBAAkB,cAAc,mBAAmB,EAAE,YAAY,CAAC,CAAC,CAAC;AAAA,IAC9F,QAAQ,IAAI,SAAS,IAAI,CAAC,kBAAkB,cAAc,gBAAgB,EAAE,YAAY,CAAC,CAAC,CAAC;AAAA,IAC3F,uBAAuB,QAAQ,QAAQ,oBAAoB,IAAI,iBAAiB,QAAQ,gBAAgB;AAAA,EAC1G,CAAC;AAGD,yBAAuB,WAAW;AAIlC,QAAM,gBAAgB,eAAe;AAAA,IAAQ,CAAC,KAAKA,WACjD,IAAI,IAAI,CAAC,YAAY,EAAE,QAAQ,SAAS,SAASA,MAAK,EAAG,EAAE;AAAA,EAC7D;AACA,QAAM,WAAW,WAAW,KAAK;AAKjC,MAAI,UAAU;AACd,QAAM,WAAW,oBAAI,IAAqC;AAC1D,aAAW,EAAE,QAAQ,SAAS,cAAc,KAAK,eAAe;AAC9D,eAAW;AACX,UAAM,2BAA2B,SAAS,WAAW;AACrD,UAAM,cACJ,OAAO,cAAc,wBAAwB,aACzC,cAAc,oBAAoB,OAAO,MAAM,OAAO,IAAI,IAC1D,oBAAoB,OAAO,MAAM,OAAO,MAAM,cAAc,aAAa;AAC/E,UAAM,wBAAwB,OAAO,sBAAsB,CAAC;AAC5D,UAAM,0BAA0B,qBAAqB,qBAAqB;AAC1E,UAAM,iBAAiB,OAAO,MAC3B,IAAI,CAAC,SAAS,mBAAmB,IAAI,CAAC,EACtC,OAAO,OAAO,EACd,OAAO,CAAC,SAAS,CAAC,wBAAwB,IAAI,oBAAoB,IAAI,CAAC,CAAC,EACxE,IAAI,CAAC,SAAS,YAAY,MAAM,GAAG,CAAC;AACvC,UAAM,EAAE,OAAO,eAAe,SAAS,oBAAoB,IAAI;AAAA,MAC7D,OAAO;AAAA,MACP;AAAA,MACA;AAAA,MACA;AAAA,IACF;AACA,UAAM,qBAAqB;AAAA,MACzB;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,IACF;AACA,aAAS,IAAI,aAAa;AAAA,MACxB;AAAA,MACA,MAAM,OAAO;AAAA,MACb,MAAM,OAAO;AAAA,MACb,SAAS,cAAc,OAAO,OAAO;AAAA,MACrC,SAAS,OAAO,WAAW,KAAK,KAAK,OAAO,SAAS,KAAK,KAAK;AAAA,MAC/D,OAAO;AAAA,MACP;AAAA,MACA,GAAI,oBAAoB,KAAK,CAAC,WAAW,WAAW,MAAS,IAAI,EAAE,oBAAoB,IAAI,CAAC;AAAA,MAC5F;AAAA,MACA,UAAU,OAAO,SAAS,IAAI,CAAC,WAAW,EAAE,GAAG,MAAM,EAAE;AAAA,MACvD,eAAe,OAAO,cAAc,IAAI,CAAC,kBAAkB,EAAE,GAAG,aAAa,EAAE;AAAA,MAC/E,UAAU,OAAO,SAAS,IAAI,CAAC,cAAc,EAAE,GAAG,SAAS,EAAE;AAAA,MAC7D,WAAW,eAAe;AAAA,MAC1B,gBAAgB,CAAC;AAAA,MACjB,cAAc,CAAC;AAAA,IACjB,CAAC;AAAA,EACH;AAEA,YAAU;AACV,aAAW,UAAU,UAAU;AAC7B,eAAW;AACX,UAAM,2BAA2B,SAAS,WAAW;AACrD,UAAM,QAAQ,OAAO,OAAO,YAAY,cAAc,WAAW,SAAS,IAAI,OAAO,YAAY,SAAS,IAAI;AAC9G,QAAI,CAAC,MAAO;AACZ,UAAM,UAAU,MAAM,kBAAkB,MAAM;AAC9C,QAAI,MAAM,eAAe,SAAS,OAAO,EAAG;AAC5C,UAAM,eAAe,KAAK,OAAO;AACjC,UAAM,uBAAuB,CAAC,GAAI,MAAM,wBAAwB,CAAC,GAAI,OAAO,YAAY,MAAM;AAAA,EAChG;AAKA,QAAM,sBAAsB,WAAW;AACvC,QAAM,aAAa,gBAAgB,CAAC,GAAG,SAAS,OAAO,CAAC,CAAC;AACzD,aAAW,SAAS,cAAc;AAChC,UAAM,iBAAiB,SAAS,IAAI,wBAAwB,KAAK,CAAC;AAClE,QAAI,gBAAgB;AAClB,uBAAiB,gBAAgB,KAAK;AACtC;AAAA,IACF;AACA,UAAM,mBAAmB,cAAc,CAAC,MAAM,OAAO,GAAI,MAAM,WAAW,CAAC,CAAE,CAAC,EAAE,IAAI,mBAAmB,EAAE,OAAO,OAAO;AACvH,QAAI,UAAU;AACd,eAAW,SAAS,kBAAkB;AACpC,iBAAW,SAAS,WAAW,IAAI,KAAK,KAAK,CAAC,GAAG;AAC/C,yBAAiB,OAAO,KAAK;AAC7B,kBAAU;AAAA,MACZ;AAAA,IACF;AACA,QAAI,QAAS;AACb,UAAM,cAAc,wBAAwB,KAAK;AACjD,aAAS,IAAI,YAAY,aAAa,WAAW;AAAA,EACnD;AAEA,QAAM,sBAAsB,WAAW;AACvC,QAAM,iBAAiB,CAAC,GAAG,SAAS,OAAO,CAAC,EAAE,KAAK,CAAC,MAAM,UAAU,KAAK,KAAK,cAAc,MAAM,IAAI,CAAC;AACvG,QAAM,sBAAsB,WAAW;AACvC,QAAM,mBAAmB,gBAAgB,KAAK,UAAU,cAAc,QAAQ,IAAI;AAClF,QAAM,sBAAsB,WAAW;AACvC,QAAM,eAAe,KAAK,UAAU,cAAc;AAClD,QAAM,2BAA2B,qBAAqB,QAAQ,uBAAuB,IAAI;AACzF,QAAM,kBAAkB,sBAAsB,8BAA8B;AAC5E,QAAM,QAA4B;AAAA,IAChC,SAAS;AAAA,IACT,WACE,iBAAiB,qBAAqB,eAClC,cAAc,aACd,oBAAI,KAAK,GAAE,YAAY;AAAA,IAC7B,qBAAqB,kBAAkB,2BAA2B;AAAA,IAClE,UAAU;AAAA,EACZ;AACA,MAAI,iBAAiB;AAInB,2BAAuB,WAAW;AAClC,UAAM,sBAAsB,SAAS,KAAK;AAAA,EAC5C;AACA,SAAO;AACT;AAEA,SAAS,0BACP,OACA,OACmB;AACnB,QAAM,aAAgC,CAAC;AACvC,aAAW,SAAS,MAAM,UAAU;AAClC,UAAM,UAAU,cAAc,CAAC,MAAM,MAAM,GAAG,MAAM,OAAO,CAAC;AAC5D,QAAI,YAAY;AAChB,QAAI,YAAY;AAChB,eAAW,SAAS,SAAS;AAC3B,YAAM,QAAQ,gBAAgB,OAAO,KAAK;AAC1C,UAAI,QAAQ,WAAW;AACrB,oBAAY;AACZ,oBAAY;AAAA,MACd;AAAA,IACF;AACA,QAAI,aAAa,EAAG;AACpB,eAAW,KAAK,EAAE,OAAO,OAAO,WAAW,OAAO,WAAW,QAAQ,QAAQ,CAAC;AAAA,EAChF;AACA,SAAO,WAAW,KAAK,CAAC,MAAM,UAAU,MAAM,QAAQ,KAAK,KAAK;AAClE;AAEA,IAAM,gCAAgC;AAEtC,IAAM,6BAA6B,oBAAI,IAAI;AAAA,EACzC;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;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;AAAA,EACA;AAAA,EACA;AACF,CAAC;AAED,SAAS,2BAA2B,iBAAkC;AACpE,QAAM,SAAS,gBAAgB,MAAM,KAAK,EAAE,OAAO,OAAO;AAC1D,MAAI,OAAO,SAAS,KAAK,OAAO,MAAM,CAACC,WAAU,2BAA2B,IAAIA,MAAK,CAAC,EAAG,QAAO;AAChG,MAAI,OAAO,WAAW,EAAG,QAAO;AAChC,QAAM,QAAQ,OAAO,CAAC;AACtB,SAAO,MAAM,KAAK,KAAK,EAAE,SAAS,KAAK,CAAC,2BAA2B,IAAI,KAAK;AAC9E;AAEA,SAAS,kBAAkB,OAAwB;AACjD,SAAO,kBAAkB,KAAK,MAAM,KAAK,CAAC;AAC5C;AAEA,SAAS,gCAAgC,OAAe,OAAwB;AAC9E,QAAM,kBAAkB,MAAM,KAAK;AACnC,QAAM,iBAAiB,GAAG,gBAAgB,CAAC,EAAG,YAAY,CAAC,GAAG,gBAAgB,MAAM,CAAC,EAAE,YAAY,CAAC;AACpG,QAAM,QAAQ,oBAAI,IAAI,CAAC,iBAAiB,gBAAgB,YAAY,GAAG,cAAc,CAAC;AACtF,SAAO,CAAC,GAAG,KAAK,EAAE,KAAK,CAAC,SAAS;AAC/B,QAAI,SAAS,KAAK,YAAY,EAAG,QAAO;AACxC,UAAM,UAAU,KAAK,QAAQ,uBAAuB,MAAM;AAC1D,WAAO,IAAI,OAAO,qBAAqB,OAAO,oBAAoB,EAAE,KAAK,KAAK;AAAA,EAChF,CAAC;AACH;AAEA,SAAS,6CACP,OACA,OACmB;AACnB,QAAM,sBAAsB,oBAAI,IAAyB;AACzD,aAAW,SAAS,MAAM,UAAU;AAClC,eAAW,SAAS,cAAc,CAAC,MAAM,MAAM,GAAG,MAAM,OAAO,CAAC,GAAG;AACjE,YAAM,kBAAkB,oBAAoB,KAAK;AACjD,UAAI,CAAC,gBAAiB;AACtB,YAAM,eAAe,oBAAoB,IAAI,eAAe,KAAK,oBAAI,IAAY;AACjF,mBAAa,IAAI,MAAM,WAAW;AAClC,0BAAoB,IAAI,iBAAiB,YAAY;AAAA,IACvD;AAAA,EACF;AAEA,QAAM,aAAgC,CAAC;AACvC,aAAW,SAAS,MAAM,UAAU;AAClC,QAAI,YAAY;AAChB,QAAI,YAAY;AAChB,eAAW,SAAS,cAAc,CAAC,MAAM,MAAM,GAAG,MAAM,OAAO,CAAC,GAAG;AACjE,YAAM,kBAAkB,oBAAoB,KAAK;AACjD,YAAM,QAAQ,gBAAgB,OAAO,KAAK;AAC1C,UACE,CAAC,mBACD,CAAC,2BAA2B,eAAe,KAC1C,kBAAkB,KAAK,KAAK,CAAC,gCAAgC,OAAO,KAAK,KAC1E,oBAAoB,IAAI,eAAe,GAAG,SAAS,KACnD,QAAQ,iCACR,SAAS,WACT;AACA;AAAA,MACF;AACA,kBAAY;AACZ,kBAAY;AAAA,IACd;AACA,QAAI,WAAW;AACb,iBAAW,KAAK,EAAE,OAAO,OAAO,WAAW,OAAO,WAAW,QAAQ,QAAQ,CAAC;AAAA,IAChF;AAAA,EACF;AAEA,SAAO,WAAW;AAAA,IAChB,CAAC,MAAM,UAAU,MAAM,QAAQ,KAAK,SAAS,KAAK,MAAM,KAAK,cAAc,MAAM,MAAM,IAAI;AAAA,EAC7F;AACF;AAEA,SAAS,4BACP,OACA,mBACA,aACmB;AACnB,MAAI,eAAe,KAAK,kBAAkB,WAAW,EAAG,QAAO,CAAC;AAChE,QAAM,gBAAgB,kBAAkB,MAAM,CAAC,WAAW;AAC1D,QAAM,aAAa,oBAAI,IAA6B;AACpD,WAAS,cAAc,cAAc,SAAS,GAAG,eAAe,GAAG,eAAe,GAAG;AACnF,UAAM,OAAO,cAAc,WAAW;AACtC,UAAM,eAAe,cAAc,SAAS;AAC5C,UAAM,aAAa,KAAK,SAAS,SAAS,IAAI,KAAK,SAAS,cAAc,KAAK;AAC/E,eAAW,SAAS,MAAM,UAAU;AAClC,YAAM,UAAU,cAAc,CAAC,MAAM,MAAM,GAAG,MAAM,OAAO,CAAC;AAC5D,iBAAW,SAAS,SAAS;AAC3B,cAAM,QAAQ,gBAAgB,KAAK,SAAS,KAAK;AACjD,YAAI,SAAS,EAAG;AAChB,cAAM,UAAU,WAAW,IAAI,MAAM,WAAW;AAChD,cAAM,gBAAgB,QAAQ,KAAK,IAAI,GAAG,IAAI,YAAY,IAAI;AAC9D,YAAI,CAAC,WAAW,gBAAgB,QAAQ,OAAO;AAC7C,qBAAW,IAAI,MAAM,aAAa;AAAA,YAChC;AAAA,YACA;AAAA,YACA,OAAO;AAAA,YACP,QAAQ;AAAA,UACV,CAAC;AAAA,QACH;AAAA,MACF;AAAA,IACF;AAAA,EACF;AACA,SAAO,CAAC,GAAG,WAAW,OAAO,CAAC,EAAE,KAAK,CAAC,MAAM,UAAU,MAAM,QAAQ,KAAK,KAAK;AAChF;AAEA,eAAe,kBAAkB,QAAqC;AACpE,QAAM,UAAU,OAAO,QAAQ,QAAQ,QAAQ,GAAG,EAAE,KAAK;AACzD,SAAO,YAAY,SAAS,GAAG;AACjC;AAEA,eAAe,kBACb,OACA,aACA,MACA,oBACA,sBAC8B;AAC9B,QAAM,WAAgC,CAAC;AACvC,QAAM,cAAc,IAAI,IAAI,SAAS,cAAc,CAAC,MAAM,MAAM,GAAG,MAAM,OAAO,CAAC,EAAE,KAAK,GAAG,CAAC,CAAC;AAC7F,MAAI,MAAM,SAAS;AACjB,aAAS,KAAK,EAAE,MAAM,YAAY,MAAM,SAAS,GAAG,GAAG,OAAO,IAAI,MAAM,UAAU,CAAC;AAAA,EACrF;AACA,MAAI,qBAAqB,OAAO,GAAG;AACjC,eAAW,WAAW,MAAM,oBAAoB;AAC9C,UAAI,CAAC,qBAAqB,IAAI,oBAAoB,QAAQ,GAAG,EAAE,QAAQ,QAAQ,GAAG,CAAC,EAAG;AACtF,iBAAW,CAAC,OAAO,IAAI,KAAK,QAAQ,MAAM,QAAQ,GAAG;AACnD,iBAAS,KAAK;AAAA,UACZ,MAAM;AAAA,UACN,OAAO,SAAS,WAAW,IAAI;AAAA,UAC/B,MAAM;AAAA,UACN,QAAQ,QAAQ,cAAc,KAAK;AAAA,QACrC,CAAC;AAAA,MACH;AAAA,IACF;AAAA,EACF,OAAO;AACL,eAAW,CAAC,OAAO,IAAI,KAAK,MAAM,cAAc,QAAQ,GAAG;AACzD,eAAS,KAAK;AAAA,QACZ,MAAM;AAAA,QACN,OAAO,SAAS,WAAW,IAAI;AAAA,QAC/B,MAAM;AAAA,QACN,QAAQ,MAAM,sBAAsB,KAAK;AAAA,MAC3C,CAAC;AAAA,IACH;AACA,eAAW,WAAW,MAAM,oBAAoB;AAC9C,iBAAW,CAAC,OAAO,IAAI,KAAK,QAAQ,MAAM,QAAQ,GAAG;AACnD,cAAM,iBAAiB,oBAAoB,IAAI;AAC/C,cAAM,0BAA0B,YAAY;AAAA,UAAK,CAAC,UAChD,CAAC,YAAY,IAAI,KAAK,KAAK,eAAe,SAAS,KAAK;AAAA,QAC1D;AACA,YAAI,MAAM,cAAc,SAAS,KAAK,CAAC,yBAAyB;AAC9D;AAAA,QACF;AACA,iBAAS,KAAK;AAAA,UACZ,MAAM;AAAA,UACN,OAAO,SAAS,WAAW,IAAI;AAAA,UAC/B,MAAM;AAAA,UACN,QAAQ,QAAQ,cAAc,KAAK;AAAA,QACrC,CAAC;AAAA,MACH;AAAA,IACF;AACA,QAAI,MAAM,cAAc,WAAW,KAAK,MAAM,mBAAmB,WAAW,GAAG;AAC7E,iBAAW,QAAQ,MAAM,OAAO;AAC9B,YAAI,CAAC,KAAK,KAAK,EAAG;AAClB,iBAAS,KAAK,EAAE,MAAM,MAAM,OAAO,SAAS,WAAW,IAAI,GAAG,MAAM,OAAO,CAAC;AAAA,MAC9E;AAAA,IACF;AAAA,EACF;AAEA,MAAI,qBAAqB,SAAS,GAAG;AACnC,eAAW,gBAAgB,MAAM,eAAe;AAC9C,eAAS,KAAK;AAAA,QACZ,MAAM,YAAY,aAAa,OAAO,YAAY,GAAG,GAAG;AAAA,QACxD,OAAO,SAAS,YAAY,MAAM,KAAK,YAAY,MAAM,WAAW,IAAI;AAAA,QACxE,MAAM;AAAA,MACR,CAAC;AAAA,IACH;AAEA,eAAW,YAAY,MAAM,UAAU;AACrC,eAAS,KAAK;AAAA,QACZ,MAAM,YAAY,GAAG,SAAS,IAAI,KAAK,SAAS,IAAI,IAAI,GAAG;AAAA,QAC3D,OAAO;AAAA,QACP,MAAM;AAAA,MACR,CAAC;AAAA,IACH;AAEA,eAAW,CAAC,OAAO,aAAa,KAAK,MAAM,eAAe,MAAM,GAAG,KAAK,IAAI,oBAAoB,CAAC,CAAC,EAAE,QAAQ,GAAG;AAC7G,eAAS,KAAK,EAAE,MAAM,eAAe,OAAO,GAAG,MAAM,UAAU,QAAQ,MAAM,uBAAuB,KAAK,EAAE,CAAC;AAAA,IAC9G;AAEA,eAAW,SAAS,MAAM,cAAc;AACtC,eAAS,KAAK;AAAA,QACZ,MAAM,YAAY,MAAM,SAAS,GAAG;AAAA,QACpC,OAAO;AAAA,QACP,MAAM;AAAA,MACR,CAAC;AAAA,IACH;AAAA,EACF;AAEA,QAAM,UAAU,oBAAI,IAA+B;AACnD,aAAW,WAAW,UAAU;AAC9B,UAAM,SAAS,iBAAiB,SAAS,WAAW;AACpD,QAAI,CAAC,OAAQ;AACb,UAAM,aAAa,oBAAoB,OAAO,IAAI;AAClD,UAAM,WAAW,QAAQ,IAAI,UAAU;AACvC,QAAI,CAAC,UAAU;AACb,cAAQ,IAAI,YAAY,MAAM;AAAA,IAChC,WAAW,SAAS,WAAW,OAAO,QAAQ;AAC5C,cAAQ,IAAI,YAAY,EAAE,GAAI,OAAO,QAAQ,SAAS,QAAQ,SAAS,UAAW,QAAQ,OAAU,CAAC;AAAA,IACvG,WAAW,OAAO,QAAQ,SAAS,OAAO;AACxC,cAAQ,IAAI,YAAY,MAAM;AAAA,IAChC;AAAA,EACF;AAEA,SAAO,CAAC,GAAG,QAAQ,OAAO,CAAC,EACxB,OAAO,CAAC,YAAY,QAAQ,QAAQ,CAAC,EACrC,KAAK,CAAC,MAAM,UAAU,MAAM,QAAQ,KAAK,KAAK,EAC9C,MAAM,GAAG,kBAAkB;AAChC;AAEA,SAAS,qBAAqB,UAA8C;AAC1E,QAAM,SAAS,SAAS;AAAA,IAAO,CAAC,YAC9B,QAAQ,SAAS,aACd,QAAQ,SAAS,UACjB,QAAQ,SAAS,aACjB,QAAQ,SAAS;AAAA,EACtB;AACA,MAAI,OAAO,SAAS,EAAG,QAAO;AAC9B,WAAS,QAAQ,GAAG,QAAQ,OAAO,QAAQ,SAAS,GAAG;AACrD,aAAS,UAAU,QAAQ,GAAG,UAAU,OAAO,QAAQ,WAAW,GAAG;AACnE,UAAI,kBAAkB,OAAO,KAAK,EAAE,MAAM,OAAO,OAAO,EAAE,IAAI,IAAI,KAAK;AACrE,eAAO;AAAA,MACT;AAAA,IACF;AAAA,EACF;AACA,SAAO;AACT;AAEA,SAAS,wBACP,YAKA,aACA,MACA,oBACA,UACA,wBAAiC,kBAClB;AACf,MAAI,WAAW,WAAW,EAAG,QAAO;AACpC,QAAM,QAAkB,CAAC,0BAA0B,EAAE;AAGrD,QAAM,gBAAgB,CAAC,YAAuC,QAAQ,SAAS,WAC3E,4BAA4B,QAAQ,MAAM,QAAQ,QAAQ,EAAE,SAAS,wBAAwB,iBAAiB,CAAC,IAAI,QAAQ;AAK/H,aAAW,EAAE,WAAW,UAAU,YAAY,KAAK,YAAY;AAC7D,UAAM,aAAa,QAAQ,UAAU,MAAM,SAAS,KAAK,CAAC;AAC1D,UAAM,uBAAuB,aACzB,SAAS,OAAO,CAAC,YAAY,QAAQ,SAAS,MAAM,IACpD;AACJ,QAAI,eACF,qBAAqB,SAAS,IAAI,uBAAuB,UACzD,MAAM,GAAG,CAAC;AACZ,UAAM,wBAAwB,CAAC,sBAAwD;AACrF,YAAM,uBAAuB;AAAA,SAC1B,UAAU,MAAM,YAAY,CAAC,GAC3B,MAAM,EACN,KAAK,uBAAuB,EAC5B,IAAI,CAAC,UAAU;AACd,gBAAM,OAAO,mBAAmB,MAAM,IAAI;AAC1C,iBAAO,OACH,iBAAiB;AAAA,YACjB,MAAM,YAAY,MAAM,GAAG;AAAA,YAC3B,OAAO;AAAA,YACP,MAAM;AAAA,YACN,QAAQ,MAAM;AAAA,UAChB,GAAG,WAAW,IACZ;AAAA,QACN,CAAC,EACA,OAAO,CAAC,YAA0C,YAAY,IAAI,EAClE,OAAO,CAAC,YAAY,CAAC,kBAAkB,IAAI,oBAAoB,QAAQ,IAAI,CAAC,CAAC;AAAA,MAClF,EAAE,MAAM,GAAG,CAAC;AACZ,YAAM,uBAAuB;AAAA,QAC3B,SACG,OAAO,CAAC,aACP,QAAQ,SAAS,cAAc,QAAQ,SAAS,aAC7C,CAAC,kBAAkB,IAAI,oBAAoB,QAAQ,IAAI,CAAC,CAAC;AAAA,MAClE,EAAE,MAAM,GAAG,CAAC;AACZ,aAAO,qBAAqB,SAAS,IACjC,uBACA,qBAAqB,SAAS,IAC5B,uBACA;AAAA,QACA,SACG,OAAO,CAAC,aACP,QAAQ,SAAS,UAAU,QAAQ,SAAS,cACzC,CAAC,kBAAkB,IAAI,oBAAoB,QAAQ,IAAI,CAAC,CAAC;AAAA,MAClE,EAAE,MAAM,GAAG,CAAC;AAAA,IAClB;AACA,UAAM,sBAAsB,IAAI,IAAI,YAAY,IAAI,CAAC,YAAY,oBAAoB,QAAQ,IAAI,CAAC,CAAC;AACnG,UAAM,eAAe,SAAS,WAAW,sBAAsB,mBAAmB,IAAI,CAAC;AACvF,QAAI,SAAS,YAAY,cAAc,YAAY,SAAS,GAAG;AAC7D,UAAI,aAAa,SAAS,GAAG;AAC3B,sBAAc,CAAC,GAAG,aAAa,aAAa,CAAC,CAAE,EAAE,MAAM,GAAG,CAAC;AAAA,MAC7D;AAAA,IACF;AACA,UAAM,kBAAkB,IAAI,IAAI,YAAY,IAAI,CAAC,YAAY,oBAAoB,QAAQ,IAAI,CAAC,CAAC;AAC/F,UAAM,KAAK,aAAa,UAAU,MAAM,IAAI,KAAK,UAAU,MAAM,IAAI,GAAG;AACxE,UAAM,KAAK,iBAAiB,UAAU,WAAW,gBAAgB,gDAAgD,eAAe,KAAK,UAAU,KAAK,IAAI,UAAU,WAAW,gBAAgB,KAAK,eAAe,EAAE;AACnN,QAAI,YAAa,OAAM,KAAK,kBAAkB,WAAW,EAAE;AAC3D,QAAI,YAAY,SAAS,GAAG;AAC1B,YAAM,KAAK,kBAAkB;AAC7B,iBAAW,WAAW,aAAa;AACjC,cAAM,KAAK,OAAO,cAAc,OAAO,CAAC,EAAE;AAAA,MAC5C;AAAA,IACF;AACA,QAAI,SAAS,UAAU;AACrB,YAAM,mBAAmB,aAAa;AAAA,QACpC,CAAC,YAAY,CAAC,gBAAgB,IAAI,oBAAoB,QAAQ,IAAI,CAAC;AAAA,MACrE;AACA,UAAI,iBAAiB,SAAS,GAAG;AAC/B,cAAM,KAAK,oBAAoB;AAC/B,mBAAW,WAAW,kBAAkB;AACtC,gBAAM,KAAK,OAAO,cAAc,OAAO,CAAC,EAAE;AAAA,QAC5C;AAAA,MACF;AAAA,IACF;AACA,UAAM,UAAU,UAAU,MAAM,cAAc,MAAM,GAAG,kBAAkB,EAAE,IAAI,CAAC,iBAAiB,aAAa,MAAM;AACpH,QAAI,QAAQ,SAAS,GAAG;AACtB,YAAM,KAAK,uBAAuB,QAAQ,KAAK,IAAI,CAAC,EAAE;AAAA,IACxD;AACA,UAAM,KAAK,2BAA2B,UAAU,MAAM,SAAS,cAAc,UAAU,MAAM,eAAe,MAAM,YAAY,UAAU,MAAM,aAAa,MAAM,EAAE;AACnK,UAAM,KAAK,EAAE;AAAA,EACf;AAEA,MAAI,SAAS,MAAM,KAAK,IAAI;AAC5B,MAAI,OAAO,SAAS,UAAU;AAC5B,aAAS,GAAG,qBAAqB,QAAQ,KAAK,IAAI,GAAG,WAAW,EAAE,CAAC,EAAE,QAAQ,CAAC;AAAA;AAAA;AAAA;AAAA,EAChF;AACA,SAAO,OAAO,KAAK,EAAE,SAAS,IAAI,OAAO,QAAQ,IAAI;AACvD;AAEA,eAAsB,yBAAyB,SAAkE;AAK/G,yBAAuB,QAAQ,WAAW;AAC1C,QAAM,eAAe,sBAAsB,QAAQ,KAAK;AACxD,QAAM,iBAAiB,eACnB,OACA,MAAM;AAAA,IACN,QAAQ;AAAA,IACR,QAAQ;AAAA,IACR,QAAQ;AAAA,IACR,QAAQ;AAAA,EACV;AACF,yBAAuB,QAAQ,WAAW;AAC1C,MAAI;AACJ,MACE,CAAC,gBACD,kBACA,6CAA6C,gBAAgB,QAAQ,KAAK,EAAE,WAAW,GACvF;AACA,mBAAe,MAAM,iBAAiB,QAAQ,QAAQ,QAAQ,gBAAgB;AAC9E,QAAI,CAAC,8BAA8B,gBAAgB,cAAc,QAAQ,KAAK,GAAG;AAC/E,aAAO,0BAA0B,QAAQ,WAAW;AAAA,IACtD;AAAA,EACF;AACA,QAAM,kBACJ,6BAA6B,QAAQ,MAAM,EAAE,cAC7C,QAAQ,qBAAqB,WAC5B,QAAQ,kBAAkB,UAAU,KAAK;AAC5C,MAAI,iBAAiB;AACnB,mBAAe,MAAM,iBAAiB,QAAQ,QAAQ,QAAQ,gBAAgB;AAAA,EAChF;AACA,QAAM,mBAAmB,kBACrB,MAAM;AAAA,IACN,QAAQ;AAAA,IACR,QAAQ;AAAA,IACR,QAAQ;AAAA,IACR,QAAQ;AAAA,EACV,IACE;AACJ,QAAM,oBACJ,oBAAoB,QAAQ,oBAAoB,eAC5C;AAAA,IACA;AAAA,IACA,QAAQ;AAAA,IACR,0BAA0B,YAAY;AAAA,EACxC,IACE;AACN,MAAI,QAAwC,oBACxC,0BAA0B,IAAI,iBAAiB,IAC/C;AACJ,yBAAuB,QAAQ,WAAW;AAC1C,MAAI,CAAC,OAAO;AACV,YAAQ,MAAM;AAAA,MACZ,QAAQ;AAAA,MACR,QAAQ;AAAA,MACR,QAAQ;AAAA,MACR,QAAQ;AAAA,MACR;AAAA,MACA;AAAA,MACA,QAAQ;AAAA,IACV;AACA,QAAI,kBAAmB,8BAA6B,mBAAmB,KAAK;AAAA,EAC9E;AAIA,QAAM,sBAAsB,QAAQ,WAAW;AAC/C,QAAM,qBAAqB,0BAA0B,OAAO,QAAQ,KAAK;AACzE,QAAM,sBAAsB,QAAQ,WAAW;AAC/C,QAAM,kBAAkB,eACpB,qBACA,6CAA6C,OAAO,QAAQ,KAAK;AACrE,QAAM,OAAO,iBAAiB,gBAAgB,SAAS,IAAI,WAAW;AACtE,MAAI,CAAC,KAAM,QAAO,0BAA0B,QAAQ,WAAW;AAE/D,QAAM,aAAa,gBAAgB,SAAS,IACxC,kBACA,4BAA4B,OAAO,QAAQ,mBAAmB,QAAQ,WAAW;AAErF,MAAI,WAAW,WAAW,EAAG,QAAO,0BAA0B,QAAQ,WAAW;AAEjF,QAAM,cAAc,SAAS,QAAQ,KAAK;AAC1C,QAAM,iBAAiB,gBAAgB,WAAW,KAAK,SAAS,cAC5D,IACA,QAAQ;AACZ,QAAM,mBAAmB,WAAW,MAAM,GAAG,cAAc;AAC3D,QAAM,WAAW,MAAM,QAAQ;AAAA,IAC7B,iBAAiB,IAAI,OAAO,cAAc;AACxC,YAAM,uBAAuB,IAAI;AAAA,QAC/B;AAAA,UACE,QAAQ;AAAA,UACR,UAAU,MAAM;AAAA,UAChB,UAAU,MAAM;AAAA,UAChB,QAAQ,OAAO;AAAA,QACjB;AAAA,MACF;AACA,YAAM,WAAW,MAAM;AAAA,QACrB,UAAU;AAAA,QACV;AAAA,QACA;AAAA,QACA,QAAQ;AAAA,QACR;AAAA,MACF;AACA,aAAO;AAAA,QACL;AAAA,QACA;AAAA,QACA,aAAa,qBAAqB,QAAQ;AAAA,MAC5C;AAAA,IACF,CAAC;AAAA,EACH;AAEA,QAAM,UAAU;AAAA,IACd;AAAA,IACA;AAAA,IACA;AAAA,IACA,QAAQ;AAAA,IACR,QAAQ;AAAA,IACR,QAAQ,2BAA2B;AAAA,IACnC,QAAQ,oBAAoB,CAAC;AAAA,EAC/B;AAGA,MAAI,CAAC,QAAS,QAAO,0BAA0B,QAAQ,WAAW;AAClE,SAAO;AACT;AAEA,eAAsB,kCACpB,0BACA,aAC4B;AAC5B,MAAI,eAAe,EAAG,QAAO,CAAC;AAC9B,QAAM,oBAAoB,MAAM,yBAAyB,MAAM,MAAM,CAAC,CAAC;AACvE,MAAI,kBAAkB,WAAW,EAAG,QAAO,CAAC;AAC5C,SAAO,kBAAkB,MAAM,CAAC,KAAK,IAAI,GAAG,cAAc,CAAC,CAAC;AAC9D;AAEO,IAAM,qBAAqB;AAC3B,IAAM,sCAAsC;","names":["index","token"]}

package/dist/chunk-WAS4HV46.js.map

@@ -1 +0,0 @@
-{"version":3,"sources":["../src/extraction-source-grounding-helpers.ts"],"sourcesContent":["export function isInterrogativeSourceSentence(sentence: string): boolean {\n  const normalized = sentence.trim();\n  const embeddedQuestionVerbIndex = normalized.search(\n    /\\b(?:determine|know|wonder|ask(?:ed)?|question|decide|check|confirm|find|figure|understand|unclear)\\b/iu,\n  );\n  const embeddedQuestionMarkerIndex = normalized.search(/\\b(?:whether|if)\\b/iu);\n  const hasEmbeddedQuestion = embeddedQuestionVerbIndex >= 0\n    && embeddedQuestionMarkerIndex > embeddedQuestionVerbIndex;\n  return normalized.endsWith(\"?\")\n    || hasEmbeddedQuestion\n    || (\n      !normalized.includes(\":\")\n      && /^(?:suppose|assuming|assume|maybe|perhaps|hypothetically|if|whether|imagine|imagining|presume|presuming|supposing|is|are|am|was|were|do|does|did|can|could|will|would|should|has|have|had|what|which|when|where|why|how|who|whom)\\b/iu.test(\n        normalized,\n      )\n    );\n}\n\nexport function containsContiguousGroundingTokens(\n  candidateTokens: ReadonlyArray<string>,\n  sourceTokens: ReadonlyArray<string>,\n): boolean {\n  if (candidateTokens.length === 0 || candidateTokens.length > sourceTokens.length) return false;\n  return sourceTokens.some((_, start) =>\n    candidateTokens.every((token, offset) => sourceTokens[start + offset] === token),\n  );\n}\n\nexport function hasExplicitRoleSubjectToken(\n  candidateRole: string | undefined,\n  sourceTokensBySentence: ReadonlyArray<ReadonlyArray<string>>,\n): boolean {\n  return candidateRole !== undefined\n    && sourceTokensBySentence.some((tokens) =>\n      tokens.some((token) => token.replace(/^[\\u0000\\u0001]/u, \"\") === candidateRole));\n}\n\nexport function splitGroundingClauses(\n  sentences: ReadonlyArray<string>,\n  inheritCoordinatedSubjects = false,\n): string[] {\n  return sentences.flatMap((sentence) => {\n    const clauses = sentence\n      .split(/,\\s+(?=[\\p{L}][\\p{L}\\p{N}'’-]*\\s+\\S)/gu)\n      .flatMap((commaClause) =>\n        commaClause\n          .split(/\\s*(?::|[—–])\\s+|\\s+\\/\\s+/u)\n          .flatMap((delimiterClause) =>\n            delimiterClause\n              .split(/\\s+(?:and|but|or|while|although|because)\\s+/gu)\n              .map((clause) => clause.trim())\n              .filter((clause) => clause.length > 0),\n          ),\n      );\n    if (!inheritCoordinatedSubjects || clauses.length < 2) return clauses;\n\n    const firstLexemes = groundingLexemes(clauses[0]!)\n      .filter(({ token }) => GROUNDING_STOPWORDS[token] !== true);\n    const firstPredicateIndex = firstLexemes.findIndex(({ isPredicate }) => isPredicate);\n    let subjectLexemes = firstLexemes\n      .slice(0, firstPredicateIndex < 1 ? 1 : firstPredicateIndex)\n      .filter(({ token }) => !token.endsWith(\"ly\"));\n    let subject = subjectLexemes.map(({ surface }) => surface).join(\" \");\n    let predicate = firstLexemes[firstPredicateIndex < 1 ? 1 : firstPredicateIndex]?.surface;\n    if (subject.length === 0 || predicate === undefined) return clauses;\n\n    const sourceSpans = [clauses[0]!];\n    for (const clause of clauses.slice(1)) {\n      const clauseLexemes = groundingLexemes(clause)\n        .filter(({ token }) => GROUNDING_STOPWORDS[token] !== true);\n      const clausePredicateIndex = clauseLexemes.findIndex(({ isPredicate }) => isPredicate);\n      const clauseSubjectLexemes = clausePredicateIndex > 0\n        ? clauseLexemes\n          .slice(0, clausePredicateIndex)\n          .filter(({ token }) => !token.endsWith(\"ly\"))\n        : [];\n      const repeatsSubject = clauseSubjectLexemes.length === subjectLexemes.length\n        && subjectLexemes.every(\n          ({ token }, index) => clauseSubjectLexemes[index]?.token === token,\n        );\n      if (repeatsSubject) {\n        sourceSpans.push(clause);\n        continue;\n      }\n      if (clauseSubjectLexemes.length > 0) {\n        subjectLexemes = clauseSubjectLexemes;\n        subject = subjectLexemes.map(({ surface }) => surface).join(\" \");\n        predicate = clauseLexemes[clausePredicateIndex]?.surface;\n        sourceSpans.push(clause);\n        continue;\n      }\n      const prefix = clausePredicateIndex === -1 ? `${subject} ${predicate}` : subject;\n      sourceSpans.push(clause, `${prefix} ${clause}`);\n    }\n    return sourceSpans;\n  });\n}\n\nexport const GROUNDING_STOPWORDS: Record<string, true> = {\n  a: true,\n  an: true,\n  and: true,\n  are: true,\n  as: true,\n  at: true,\n  be: true,\n  been: true,\n  being: true,\n  but: true,\n  by: true,\n  can: true,\n  could: true,\n  did: true,\n  do: true,\n  does: true,\n  for: true,\n  from: true,\n  had: true,\n  has: true,\n  have: true,\n  he: true,\n  her: true,\n  here: true,\n  hers: true,\n  him: true,\n  his: true,\n  how: true,\n  i: true,\n  if: true,\n  in: true,\n  into: true,\n  is: true,\n  it: true,\n  its: true,\n  just: true,\n  me: true,\n  my: true,\n  no: true,\n  not: true,\n  of: true,\n  on: true,\n  only: true,\n  or: true,\n  our: true,\n  ours: true,\n  she: true,\n  so: true,\n  than: true,\n  that: true,\n  the: true,\n  their: true,\n  them: true,\n  then: true,\n  there: true,\n  these: true,\n  they: true,\n  this: true,\n  those: true,\n  to: true,\n  too: true,\n  under: true,\n  up: true,\n  us: true,\n  very: true,\n  was: true,\n  we: true,\n  were: true,\n  what: true,\n  when: true,\n  why: true,\n  where: true,\n  which: true,\n  who: true,\n  whom: true,\n  will: true,\n  with: true,\n  would: true,\n  you: true,\n  your: true,\n};\n\nexport const GROUNDING_NEGATION_TOKENS = new Set([\n  \"no\",\n  \"not\",\n  \"false\",\n  \"untrue\",\n  \"incorrect\",\n  \"wrong\",\n  \"never\",\n  \"without\",\n  \"neither\",\n  \"nor\",\n  \"none\",\n  \"cannot\",\n  \"cant\",\n  \"can't\",\n  \"don't\",\n  \"doesn't\",\n  \"didn't\",\n  \"isn't\",\n  \"aren't\",\n  \"wasn't\",\n  \"weren't\",\n  \"won't\",\n  \"wouldn't\",\n  \"couldn't\",\n  \"shouldn't\",\n  \"haven't\",\n  \"hasn't\",\n  \"hadn't\",\n]);\n\nexport const GROUNDING_AUXILIARY_TOKENS = new Set([\n  \"am\",\n  \"are\",\n  \"be\",\n  \"been\",\n  \"being\",\n  \"can\",\n  \"could\",\n  \"did\",\n  \"do\",\n  \"does\",\n  \"had\",\n  \"has\",\n  \"have\",\n  \"is\",\n  \"was\",\n  \"were\",\n  \"will\",\n  \"would\",\n  \"should\",\n]);\n\nexport const GROUNDING_COPULAR_FORMS = new Set([\n  \"am\",\n  \"are\",\n  \"be\",\n  \"been\",\n  \"being\",\n  \"is\",\n  \"was\",\n  \"were\",\n]);\n\nexport const GROUNDING_SUBJECT_PRONOUNS = new Set([\n  \"he\",\n  \"she\",\n  \"they\",\n  \"it\",\n  \"i\",\n  \"we\",\n  \"you\",\n]);\nexport const GROUNDING_ENTITY_TYPE_PREFIXES = new Set([\n  \"person\",\n  \"project\",\n  \"tool\",\n  \"company\",\n  \"place\",\n  \"other\",\n]);\n\nexport const GROUNDING_COMMON_VERB_FORMS: Record<string, true> = {\n  add: true,\n  adds: true,\n  call: true,\n  calls: true,\n  contain: true,\n  contains: true,\n  employ: true,\n  deploy: true,\n  deploys: true,\n  design: true,\n  designs: true,\n  employs: true,\n  fill: true,\n  fills: true,\n  go: true,\n  goes: true,\n  gone: true,\n  went: true,\n  give: true,\n  gives: true,\n  has: true,\n  host: true,\n  hosts: true,\n  like: true,\n  likes: true,\n  manage: true,\n  manages: true,\n  make: true,\n  makes: true,\n  need: true,\n  needs: true,\n  own: true,\n  owns: true,\n  plan: true,\n  plans: true,\n  prefer: true,\n  prefers: true,\n  require: true,\n  requires: true,\n  run: true,\n  runs: true,\n  sleep: true,\n  sleeps: true,\n  stop: true,\n  stops: true,\n  swim: true,\n  swims: true,\n  share: true,\n  shares: true,\n  support: true,\n  supports: true,\n  take: true,\n  takes: true,\n  try: true,\n  tries: true,\n  use: true,\n  uses: true,\n  want: true,\n  wants: true,\n  work: true,\n  works: true,\n};\n\n\nexport interface GroundingLexeme {\n  token: string;\n  surface: string;\n  isPredicate: boolean;\n  preserveTerminalS: boolean;\n}\n\nexport function groundingLexemes(text: string): GroundingLexeme[] {\n  const rawTokens = text.normalize(\"NFKC\").match(\n    /[\\p{L}\\p{N}]+(?:['’][\\p{L}\\p{N}]+)?(?:\\+\\+[\\p{L}\\p{N}]*|#[\\p{L}\\p{N}]*)?/gu,\n  ) ?? [];\n  const tokens = rawTokens.map((rawToken) =>\n    rawToken.replaceAll(\"’\", \"'\").toLocaleLowerCase());\n  let predicateIndex = tokens.findIndex((token, index) => {\n    const previousToken = tokens[index - 1];\n    const followsAuxiliary = previousToken !== undefined\n      && GROUNDING_AUXILIARY_TOKENS.has(previousToken);\n    let previousMeaningfulIndex = index - 1;\n    while (\n      previousMeaningfulIndex >= 0\n      && !GROUNDING_COPULAR_FORMS.has(tokens[previousMeaningfulIndex] ?? \"\")\n      && (\n        GROUNDING_STOPWORDS[tokens[previousMeaningfulIndex] ?? \"\"] === true\n        || (tokens[previousMeaningfulIndex] ?? \"\").endsWith(\"ly\")\n      )\n    ) {\n      previousMeaningfulIndex -= 1;\n    }\n    const followsCopularAuxiliary = GROUNDING_COPULAR_FORMS.has(\n      tokens[previousMeaningfulIndex] ?? \"\",\n    );\n    const capitalized = /^\\p{Lu}/u.test(rawTokens[index] ?? \"\");\n    const terminalSInflection = index > 0\n      && token.endsWith(\"s\")\n      && !token.endsWith(\"ss\")\n      && !GROUNDING_AUXILIARY_TOKENS.has(token);\n    const capitalizedSubjectHasLaterPredicate = index === 0\n      && tokens.some((laterToken, laterIndex) =>\n        laterIndex > 0\n        && !/^\\p{Lu}/u.test(rawTokens[laterIndex] ?? \"\")\n        && (\n          GROUNDING_AUXILIARY_TOKENS.has(laterToken)\n          || GROUNDING_COMMON_VERB_FORMS[laterToken] === true\n          || laterToken.endsWith(\"ed\")\n          || laterToken.endsWith(\"ing\")\n        ));\n    if (capitalized && (index !== 0 || capitalizedSubjectHasLaterPredicate)) return false;\n    if (followsCopularAuxiliary && terminalSInflection) return false;\n    return GROUNDING_COMMON_VERB_FORMS[token] === true\n      || token.endsWith(\"ed\")\n      || token.endsWith(\"ing\")\n      || (followsAuxiliary && !followsCopularAuxiliary)\n      || terminalSInflection;\n  });\n  if (predicateIndex === -1) {\n    const leadingSubjectLength = rawTokens.findIndex((rawToken) => !/^\\p{Lu}/u.test(rawToken));\n    if (leadingSubjectLength > 0) {\n      predicateIndex = tokens.findIndex((token, index) =>\n        index >= leadingSubjectLength\n        && (\n          GROUNDING_AUXILIARY_TOKENS.has(token)\n          || (\n            GROUNDING_STOPWORDS[token] !== true\n            && !/^\\p{Lu}/u.test(rawTokens[index] ?? \"\")\n          )\n        ));\n    }\n  }\n  return rawTokens.map((rawToken, index) => {\n    const token = tokens[index]!;\n    const isPredicate = index === predicateIndex;\n    return {\n      token,\n      surface: rawToken,\n      preserveTerminalS: !isPredicate && (\n        /^\\p{Lu}/u.test(rawToken)\n        || token.endsWith(\"s\")\n      ),\n      isPredicate,\n    };\n  });\n}\n\nexport function tokenSequence(text: string): string[] {\n  return groundingLexemes(text).map(({ token }) => token);\n}\n\nexport function containsExactTokenSequence(candidate: string, source: string): boolean {\n  const candidateTokens = tokenSequence(candidate);\n  const sourceTokens = tokenSequence(source);\n  if (candidateTokens.length === 0 || candidateTokens.length > sourceTokens.length) return false;\n  return sourceTokens.some((_, index) =>\n    candidateTokens.every((token, offset) => sourceTokens[index + offset] === token),\n  );\n\n}\n\nexport function isNegationCue(token: string): boolean {\n  return GROUNDING_NEGATION_TOKENS.has(token) || token.endsWith(\"n't\");\n}\n\nexport function isAttachedNegatedAuxiliary(token: string): boolean {\n  return token.endsWith(\"n't\")\n    || token === \"cannot\"\n    || token === \"cant\"\n    || token === \"can't\";\n}\n\nexport function isNegatedAt(tokens: ReadonlyArray<string>, index: number): boolean {\n  if (tokens[index - 1] === \"only\" && tokens[index - 2] === \"not\") return false;\n  const previousStart = Math.max(0, index - 2);\n  for (let i = previousStart; i < index; i += 1) {\n    if (isNegationCue(tokens[i])) return true;\n  }\n\n  if (tokens[index - 1] === \"than\" && tokens[index - 2] === \"rather\") return true;\n  if (tokens[index - 1] === \"of\" && tokens[index - 2] === \"instead\") return true;\n\n  const next = tokens[index + 1];\n  if (next !== undefined && isAttachedNegatedAuxiliary(next)) return true;\n  const nextNext = tokens[index + 2];\n  return next !== undefined\n    && nextNext !== undefined\n    && GROUNDING_AUXILIARY_TOKENS.has(next)\n    && isNegationCue(nextNext);\n}\n\nexport const GROUNDING_MIN_SHARED_TOKENS = 2;\nexport const GROUNDING_MIN_COVERAGE = 0.5;\n\nconst STRICT_GROUNDING_TOKEN_PREFIX = \"\\u0000\";\nconst INFLECTED_GROUNDING_TOKEN_PREFIX = \"\\u0001\";\n\nexport function stemToken(\n  token: string,\n  preserveTerminalS = false,\n  markExact = false,\n): string {\n  if (token.endsWith(\"'s\")) return token.slice(0, -2);\n  if (preserveTerminalS) {\n    if (!markExact) return token;\n    return `${STRICT_GROUNDING_TOKEN_PREFIX}${token}`;\n  }\n  if (token.length > 5 && token.endsWith(\"ing\")) {\n    const stem = token.slice(0, -3);\n    const inflectionDoubled = /(.)\\1$/u.test(stem) && stem.length > 3 && !/[lsz]$/u.test(stem);\n    const normalized = inflectionDoubled ? stem.slice(0, -1) : stem;\n    return markExact ? `${INFLECTED_GROUNDING_TOKEN_PREFIX}${normalized}` : normalized;\n  }\n  if (token.length > 4 && token.endsWith(\"ied\")) {\n    const normalized = `${token.slice(0, -3)}y`;\n    return markExact ? `${INFLECTED_GROUNDING_TOKEN_PREFIX}${normalized}` : normalized;\n  }\n  if (token.length > 4 && token.endsWith(\"ed\")) {\n    const stem = token.slice(0, -2);\n    const inflectionDoubled = /(.)\\1$/u.test(stem) && stem.length > 3 && !/[lsz]$/u.test(stem);\n    const normalized = inflectionDoubled ? stem.slice(0, -1) : stem;\n    return markExact ? `${INFLECTED_GROUNDING_TOKEN_PREFIX}${normalized}` : normalized;\n  }\n  if (token.length > 3 && token.endsWith(\"s\") && !token.endsWith(\"ss\")) {\n    return token.endsWith(\"ies\") ? `${token.slice(0, -3)}y` : token.slice(0, -1);\n  }\n  return token;\n}\n\n\nexport function tokenize(text: string): Set<string> {\n  const tokens = new Set<string>();\n  for (const { token, preserveTerminalS } of groundingLexemes(text)) {\n    if (GROUNDING_STOPWORDS[token] !== true) tokens.add(stemToken(token, preserveTerminalS, true));\n  }\n  return tokens;\n}\n\nexport function normalizeForExactMatch(text: string): string {\n  return text.normalize(\"NFKC\").toLocaleLowerCase().replace(/\\s+/gu, \" \").trim();\n}\n\nexport function sourceSentences(source: string): string[] {\n  const sentences: string[] = [];\n  let sentenceStart = 0;\n  for (let index = 0; index < source.length; index += 1) {\n    const character = source[index];\n    const nextCharacter = source[index + 1];\n    const boundary = character === \"!\"\n      || character === \"?\"\n      || character === \";\"\n      || character === \"\\n\"\n      || (character === \".\" && (\n        nextCharacter === undefined\n        || /\\s/u.test(nextCharacter)\n        || /[\"')\\]}]/u.test(nextCharacter)\n      ));\n    if (!boundary) continue;\n    let sentenceEnd = character === \"\\n\" ? index : index + 1;\n    while (/[.!?;\\n]/u.test(source[sentenceEnd] ?? \"\")) sentenceEnd += 1;\n    const sentence = source.slice(sentenceStart, sentenceEnd).trim();\n    if (sentence.length > 0) sentences.push(sentence);\n    sentenceStart = sentenceEnd;\n    index = sentenceEnd - 1;\n  }\n  const trailingSentence = source.slice(sentenceStart).trim();\n  if (trailingSentence.length > 0) sentences.push(trailingSentence);\n  return sentences.length > 0 ? sentences : [source];\n}\n\n\nexport function groundingTokenSequence(text: string): string[] {\n  let lexemes = groundingLexemes(text);\n  while (lexemes.length > 0 && GROUNDING_AUXILIARY_TOKENS.has(lexemes[0]!.token)) {\n    lexemes = lexemes.slice(1);\n  }\n  return lexemes\n    .filter(({ token }) => GROUNDING_STOPWORDS[token] !== true)\n    .map(({ token, preserveTerminalS }) => stemToken(token, preserveTerminalS, true));\n}\nexport function normalizedGroundingAlignmentTokenSequence(text: string): string[] {\n  const normalized = normalizedGroundingTokenSequence(text);\n  const firstLexeme = groundingLexemes(text)[0];\n  if (firstLexeme === undefined || !GROUNDING_SUBJECT_PRONOUNS.has(firstLexeme.token)) {\n    return normalized;\n  }\n  return [stemToken(firstLexeme.token, firstLexeme.preserveTerminalS, true), ...normalized];\n}\n\n\nexport function normalizedGroundingTokenSequence(text: string): string[] {\n  return groundingTokenSequence(text).map((token) => token.replace(/'$/u, \"\"));\n}\n\nexport function areGroundingTokensCompatible(left: string, right: string): boolean {\n  const leftPrefix = left[0];\n  const rightPrefix = right[0];\n  const leftMarked = leftPrefix === STRICT_GROUNDING_TOKEN_PREFIX\n    || leftPrefix === INFLECTED_GROUNDING_TOKEN_PREFIX;\n  const rightMarked = rightPrefix === STRICT_GROUNDING_TOKEN_PREFIX\n    || rightPrefix === INFLECTED_GROUNDING_TOKEN_PREFIX;\n  const leftToken = leftMarked ? left.slice(1) : left;\n  const rightToken = rightMarked ? right.slice(1) : right;\n  if (leftToken === rightToken) {\n    const strictToInflected = (\n      leftPrefix === STRICT_GROUNDING_TOKEN_PREFIX\n      && rightPrefix === INFLECTED_GROUNDING_TOKEN_PREFIX\n    ) || (\n      rightPrefix === STRICT_GROUNDING_TOKEN_PREFIX\n      && leftPrefix === INFLECTED_GROUNDING_TOKEN_PREFIX\n    );\n    return !strictToInflected;\n  }\n  if (leftPrefix === STRICT_GROUNDING_TOKEN_PREFIX || rightPrefix === STRICT_GROUNDING_TOKEN_PREFIX) {\n    return false;\n  }\n  return `${leftToken}e` === rightToken || leftToken === `${rightToken}e`;\n}\nconst GROUNDING_DENIAL_REPORTING_VERBS = new Set([\n  \"deny\",\n  \"denied\",\n  \"denies\",\n  \"denying\",\n  \"dispute\",\n  \"disputed\",\n  \"disputes\",\n  \"disputing\",\n  \"reject\",\n  \"rejected\",\n  \"rejects\",\n  \"rejecting\",\n  \"refute\",\n  \"refuted\",\n  \"refutes\",\n  \"refuting\",\n  \"contradict\",\n  \"contradicted\",\n  \"contradicts\",\n  \"contradicting\",\n  \"disprove\",\n  \"disproved\",\n  \"disproves\",\n  \"disproving\",\n]);\n\nfunction isDenialReportingVerb(token: string): boolean {\n  return GROUNDING_DENIAL_REPORTING_VERBS.has(token);\n}\nconst GROUNDING_NON_ASSERTIVE_REPORTING_VERBS = new Set([\n  \"allege\",\n  \"alleged\",\n  \"alleges\",\n  \"alleging\",\n  \"allegedly\",\n  \"assert\",\n  \"asserted\",\n  \"asserts\",\n  \"asserting\",\n  \"believe\",\n  \"believed\",\n  \"believes\",\n  \"believing\",\n  \"claim\",\n  \"claimed\",\n  \"claims\",\n  \"claiming\",\n  \"doubt\",\n  \"doubted\",\n  \"doubts\",\n  \"doubting\",\n  \"uncertain\",\n  \"unsure\",\n  \"unclear\",\n  \"unknown\",\n  \"possibly\",\n  \"probably\",\n  \"imagine\",\n  \"imagined\",\n  \"imagines\",\n  \"imagining\",\n  \"report\",\n  \"reported\",\n  \"reports\",\n  \"reporting\",\n  \"reportedly\",\n  \"say\",\n  \"said\",\n  \"says\",\n  \"saying\",\n  \"speculate\",\n  \"speculated\",\n  \"speculates\",\n  \"speculating\",\n  \"suspect\",\n  \"suspected\",\n  \"suspects\",\n  \"suspecting\",\n  \"suppose\",\n  \"supposed\",\n  \"supposes\",\n  \"supposing\",\n  \"supposedly\",\n  \"think\",\n  \"thought\",\n  \"thinks\",\n  \"thinking\",\n]);\n\nfunction isNonAssertiveReportingVerb(token: string): boolean {\n  return GROUNDING_NON_ASSERTIVE_REPORTING_VERBS.has(token);\n}\n\nfunction isGroundingClauseBoundary(token: string): boolean {\n  return token === \"and\"\n    || token === \"but\"\n    || token === \"or\"\n    || token === \"while\"\n    || token === \"although\"\n    || token === \"because\";\n}\n\nfunction isNonAssertiveReportingAt(tokens: ReadonlyArray<string>, index: number): boolean {\n  let boundary = 0;\n  for (let cursor = 0; cursor < index; cursor += 1) {\n    if (isGroundingClauseBoundary(tokens[cursor]!)) boundary = cursor + 1;\n  }\n  for (let cursor = index - 1; cursor >= boundary; cursor -= 1) {\n    if (\n      tokens[cursor] === \"that\"\n      && cursor > boundary\n      && isNonAssertiveReportingVerb(tokens[cursor - 1]!)\n    ) {\n      return true;\n    }\n    if (isNonAssertiveReportingVerb(tokens[cursor]!) && index - cursor <= 5) return true;\n  }\n  return false;\n}\n\nfunction isDeniedAt(tokens: ReadonlyArray<string>, index: number): boolean {\n  let boundary = 0;\n  for (let cursor = 0; cursor < index; cursor += 1) {\n    if (isGroundingClauseBoundary(tokens[cursor]!)) boundary = cursor + 1;\n  }\n  for (let cursor = index - 1; cursor >= boundary; cursor -= 1) {\n    const token = tokens[cursor];\n    if (token === \"that\" && cursor > boundary && isDenialReportingVerb(tokens[cursor - 1]!)) {\n      return true;\n    }\n    if (isDenialReportingVerb(token) && index - cursor <= 5) return true;\n  }\n  return false;\n}\n\nexport function hasContradictoryPolarity(candidate: string, source: string): boolean {\n  const candidateLexemes = groundingLexemes(candidate);\n  const candidateTokens = candidateLexemes.map(({ token }) => token);\n  let coherentContradiction = false;\n  for (const clause of sourceSentences(source).flatMap((sentence) =>\n    sentence.split(/\\s+(?:and|but|or|while|although|because)\\s+/gu))) {\n    const sourceLexemes = groundingLexemes(clause);\n    const sourceTokens = sourceLexemes.map(({ token }) => token);\n    let sourceCursor = 0;\n    let allTokensFound = true;\n    let contradiction = false;\n    for (const [candidateIndex, candidateToken] of candidateTokens.entries()) {\n      if (GROUNDING_STOPWORDS[candidateToken] === true) continue;\n      const sourceIndex = sourceTokens.findIndex(\n        (sourceToken, index) =>\n          index >= sourceCursor\n          && stemToken(sourceToken, sourceLexemes[index]?.preserveTerminalS === true)\n            === stemToken(candidateToken, candidateLexemes[candidateIndex]?.preserveTerminalS === true),\n      );\n      if (sourceIndex === -1) {\n        allTokensFound = false;\n        break;\n      }\n      const candidateNegated = isNegatedAt(candidateTokens, candidateIndex)\n        || isDeniedAt(candidateTokens, candidateIndex);\n      const sourceNegated = isNegatedAt(sourceTokens, sourceIndex)\n        || isDeniedAt(sourceTokens, sourceIndex);\n      const candidateNonAssertive = isNonAssertiveReportingAt(candidateTokens, candidateIndex);\n      const sourceNonAssertive = isNonAssertiveReportingAt(sourceTokens, sourceIndex);\n      if (\n        candidateNegated !== sourceNegated\n        || candidateNonAssertive !== sourceNonAssertive\n      ) {\n        contradiction = true;\n      }\n      sourceCursor = sourceIndex + 1;\n    }\n    if (allTokensFound) {\n      if (!contradiction) return false;\n      coherentContradiction = true;\n    }\n  }\n  if (coherentContradiction) return true;\n\n  const sourceLexemes = groundingLexemes(source);\n  const sourceTokens = sourceLexemes.map(({ token }) => token);\n  const sourcePositions = new Map<string, number[]>();\n  sourceLexemes.forEach(({ token, preserveTerminalS }, index) => {\n    const key = stemToken(token, preserveTerminalS);\n    const positions = sourcePositions.get(key);\n    if (positions) positions.push(index);\n    else sourcePositions.set(key, [index]);\n  });\n  for (const [candidateIndex, token] of candidateTokens.entries()) {\n    if (GROUNDING_STOPWORDS[token] === true) continue;\n    const positions = sourcePositions.get(\n      stemToken(token, candidateLexemes[candidateIndex]?.preserveTerminalS === true),\n    );\n    if (!positions || positions.length === 0) continue;\n    const sourceIndex = positions[positions.length - 1];\n    const candidateNegated = isNegatedAt(candidateTokens, candidateIndex)\n      || isDeniedAt(candidateTokens, candidateIndex);\n    const sourceNegated = isNegatedAt(sourceTokens, sourceIndex)\n      || isDeniedAt(sourceTokens, sourceIndex);\n    const candidateNonAssertive = isNonAssertiveReportingAt(candidateTokens, candidateIndex);\n    const sourceNonAssertive = isNonAssertiveReportingAt(sourceTokens, sourceIndex);\n    if (\n      candidateNegated !== sourceNegated\n      || candidateNonAssertive !== sourceNonAssertive\n    ) {\n      return true;\n    }\n  }\n  return false;\n}\n"],"mappings":";AAAO,SAAS,8BAA8B,UAA2B;AACvE,QAAM,aAAa,SAAS,KAAK;AACjC,QAAM,4BAA4B,WAAW;AAAA,IAC3C;AAAA,EACF;AACA,QAAM,8BAA8B,WAAW,OAAO,sBAAsB;AAC5E,QAAM,sBAAsB,6BAA6B,KACpD,8BAA8B;AACnC,SAAO,WAAW,SAAS,GAAG,KACzB,uBAED,CAAC,WAAW,SAAS,GAAG,KACrB,wOAAwO;AAAA,IACzO;AAAA,EACF;AAEN;AAEO,SAAS,kCACd,iBACA,cACS;AACT,MAAI,gBAAgB,WAAW,KAAK,gBAAgB,SAAS,aAAa,OAAQ,QAAO;AACzF,SAAO,aAAa;AAAA,IAAK,CAAC,GAAG,UAC3B,gBAAgB,MAAM,CAAC,OAAO,WAAW,aAAa,QAAQ,MAAM,MAAM,KAAK;AAAA,EACjF;AACF;AAEO,SAAS,4BACd,eACA,wBACS;AACT,SAAO,kBAAkB,UACpB,uBAAuB,KAAK,CAAC,WAC9B,OAAO,KAAK,CAAC,UAAU,MAAM,QAAQ,oBAAoB,EAAE,MAAM,aAAa,CAAC;AACrF;AAEO,SAAS,sBACd,WACA,6BAA6B,OACnB;AACV,SAAO,UAAU,QAAQ,CAAC,aAAa;AACrC,UAAM,UAAU,SACb,MAAM,wCAAwC,EAC9C;AAAA,MAAQ,CAAC,gBACR,YACG,MAAM,4BAA4B,EAClC;AAAA,QAAQ,CAAC,oBACR,gBACG,MAAM,+CAA+C,EACrD,IAAI,CAAC,WAAW,OAAO,KAAK,CAAC,EAC7B,OAAO,CAAC,WAAW,OAAO,SAAS,CAAC;AAAA,MACzC;AAAA,IACJ;AACF,QAAI,CAAC,8BAA8B,QAAQ,SAAS,EAAG,QAAO;AAE9D,UAAM,eAAe,iBAAiB,QAAQ,CAAC,CAAE,EAC9C,OAAO,CAAC,EAAE,MAAM,MAAM,oBAAoB,KAAK,MAAM,IAAI;AAC5D,UAAM,sBAAsB,aAAa,UAAU,CAAC,EAAE,YAAY,MAAM,WAAW;AACnF,QAAI,iBAAiB,aAClB,MAAM,GAAG,sBAAsB,IAAI,IAAI,mBAAmB,EAC1D,OAAO,CAAC,EAAE,MAAM,MAAM,CAAC,MAAM,SAAS,IAAI,CAAC;AAC9C,QAAI,UAAU,eAAe,IAAI,CAAC,EAAE,QAAQ,MAAM,OAAO,EAAE,KAAK,GAAG;AACnE,QAAI,YAAY,aAAa,sBAAsB,IAAI,IAAI,mBAAmB,GAAG;AACjF,QAAI,QAAQ,WAAW,KAAK,cAAc,OAAW,QAAO;AAE5D,UAAM,cAAc,CAAC,QAAQ,CAAC,CAAE;AAChC,eAAW,UAAU,QAAQ,MAAM,CAAC,GAAG;AACrC,YAAM,gBAAgB,iBAAiB,MAAM,EAC1C,OAAO,CAAC,EAAE,MAAM,MAAM,oBAAoB,KAAK,MAAM,IAAI;AAC5D,YAAM,uBAAuB,cAAc,UAAU,CAAC,EAAE,YAAY,MAAM,WAAW;AACrF,YAAM,uBAAuB,uBAAuB,IAChD,cACC,MAAM,GAAG,oBAAoB,EAC7B,OAAO,CAAC,EAAE,MAAM,MAAM,CAAC,MAAM,SAAS,IAAI,CAAC,IAC5C,CAAC;AACL,YAAM,iBAAiB,qBAAqB,WAAW,eAAe,UACjE,eAAe;AAAA,QAChB,CAAC,EAAE,MAAM,GAAG,UAAU,qBAAqB,KAAK,GAAG,UAAU;AAAA,MAC/D;AACF,UAAI,gBAAgB;AAClB,oBAAY,KAAK,MAAM;AACvB;AAAA,MACF;AACA,UAAI,qBAAqB,SAAS,GAAG;AACnC,yBAAiB;AACjB,kBAAU,eAAe,IAAI,CAAC,EAAE,QAAQ,MAAM,OAAO,EAAE,KAAK,GAAG;AAC/D,oBAAY,cAAc,oBAAoB,GAAG;AACjD,oBAAY,KAAK,MAAM;AACvB;AAAA,MACF;AACA,YAAM,SAAS,yBAAyB,KAAK,GAAG,OAAO,IAAI,SAAS,KAAK;AACzE,kBAAY,KAAK,QAAQ,GAAG,MAAM,IAAI,MAAM,EAAE;AAAA,IAChD;AACA,WAAO;AAAA,EACT,CAAC;AACH;AAEO,IAAM,sBAA4C;AAAA,EACvD,GAAG;AAAA,EACH,IAAI;AAAA,EACJ,KAAK;AAAA,EACL,KAAK;AAAA,EACL,IAAI;AAAA,EACJ,IAAI;AAAA,EACJ,IAAI;AAAA,EACJ,MAAM;AAAA,EACN,OAAO;AAAA,EACP,KAAK;AAAA,EACL,IAAI;AAAA,EACJ,KAAK;AAAA,EACL,OAAO;AAAA,EACP,KAAK;AAAA,EACL,IAAI;AAAA,EACJ,MAAM;AAAA,EACN,KAAK;AAAA,EACL,MAAM;AAAA,EACN,KAAK;AAAA,EACL,KAAK;AAAA,EACL,MAAM;AAAA,EACN,IAAI;AAAA,EACJ,KAAK;AAAA,EACL,MAAM;AAAA,EACN,MAAM;AAAA,EACN,KAAK;AAAA,EACL,KAAK;AAAA,EACL,KAAK;AAAA,EACL,GAAG;AAAA,EACH,IAAI;AAAA,EACJ,IAAI;AAAA,EACJ,MAAM;AAAA,EACN,IAAI;AAAA,EACJ,IAAI;AAAA,EACJ,KAAK;AAAA,EACL,MAAM;AAAA,EACN,IAAI;AAAA,EACJ,IAAI;AAAA,EACJ,IAAI;AAAA,EACJ,KAAK;AAAA,EACL,IAAI;AAAA,EACJ,IAAI;AAAA,EACJ,MAAM;AAAA,EACN,IAAI;AAAA,EACJ,KAAK;AAAA,EACL,MAAM;AAAA,EACN,KAAK;AAAA,EACL,IAAI;AAAA,EACJ,MAAM;AAAA,EACN,MAAM;AAAA,EACN,KAAK;AAAA,EACL,OAAO;AAAA,EACP,MAAM;AAAA,EACN,MAAM;AAAA,EACN,OAAO;AAAA,EACP,OAAO;AAAA,EACP,MAAM;AAAA,EACN,MAAM;AAAA,EACN,OAAO;AAAA,EACP,IAAI;AAAA,EACJ,KAAK;AAAA,EACL,OAAO;AAAA,EACP,IAAI;AAAA,EACJ,IAAI;AAAA,EACJ,MAAM;AAAA,EACN,KAAK;AAAA,EACL,IAAI;AAAA,EACJ,MAAM;AAAA,EACN,MAAM;AAAA,EACN,MAAM;AAAA,EACN,KAAK;AAAA,EACL,OAAO;AAAA,EACP,OAAO;AAAA,EACP,KAAK;AAAA,EACL,MAAM;AAAA,EACN,MAAM;AAAA,EACN,MAAM;AAAA,EACN,OAAO;AAAA,EACP,KAAK;AAAA,EACL,MAAM;AACR;AAEO,IAAM,4BAA4B,oBAAI,IAAI;AAAA,EAC/C;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;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AACF,CAAC;AAEM,IAAM,6BAA6B,oBAAI,IAAI;AAAA,EAChD;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;AAAA,EACA;AAAA,EACA;AACF,CAAC;AAEM,IAAM,0BAA0B,oBAAI,IAAI;AAAA,EAC7C;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AACF,CAAC;AAEM,IAAM,6BAA6B,oBAAI,IAAI;AAAA,EAChD;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AACF,CAAC;AACM,IAAM,iCAAiC,oBAAI,IAAI;AAAA,EACpD;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AACF,CAAC;AAEM,IAAM,8BAAoD;AAAA,EAC/D,KAAK;AAAA,EACL,MAAM;AAAA,EACN,MAAM;AAAA,EACN,OAAO;AAAA,EACP,SAAS;AAAA,EACT,UAAU;AAAA,EACV,QAAQ;AAAA,EACR,QAAQ;AAAA,EACR,SAAS;AAAA,EACT,QAAQ;AAAA,EACR,SAAS;AAAA,EACT,SAAS;AAAA,EACT,MAAM;AAAA,EACN,OAAO;AAAA,EACP,IAAI;AAAA,EACJ,MAAM;AAAA,EACN,MAAM;AAAA,EACN,MAAM;AAAA,EACN,MAAM;AAAA,EACN,OAAO;AAAA,EACP,KAAK;AAAA,EACL,MAAM;AAAA,EACN,OAAO;AAAA,EACP,MAAM;AAAA,EACN,OAAO;AAAA,EACP,QAAQ;AAAA,EACR,SAAS;AAAA,EACT,MAAM;AAAA,EACN,OAAO;AAAA,EACP,MAAM;AAAA,EACN,OAAO;AAAA,EACP,KAAK;AAAA,EACL,MAAM;AAAA,EACN,MAAM;AAAA,EACN,OAAO;AAAA,EACP,QAAQ;AAAA,EACR,SAAS;AAAA,EACT,SAAS;AAAA,EACT,UAAU;AAAA,EACV,KAAK;AAAA,EACL,MAAM;AAAA,EACN,OAAO;AAAA,EACP,QAAQ;AAAA,EACR,MAAM;AAAA,EACN,OAAO;AAAA,EACP,MAAM;AAAA,EACN,OAAO;AAAA,EACP,OAAO;AAAA,EACP,QAAQ;AAAA,EACR,SAAS;AAAA,EACT,UAAU;AAAA,EACV,MAAM;AAAA,EACN,OAAO;AAAA,EACP,KAAK;AAAA,EACL,OAAO;AAAA,EACP,KAAK;AAAA,EACL,MAAM;AAAA,EACN,MAAM;AAAA,EACN,OAAO;AAAA,EACP,MAAM;AAAA,EACN,OAAO;AACT;AAUO,SAAS,iBAAiB,MAAiC;AAChE,QAAM,YAAY,KAAK,UAAU,MAAM,EAAE;AAAA,IACvC;AAAA,EACF,KAAK,CAAC;AACN,QAAM,SAAS,UAAU,IAAI,CAAC,aAC5B,SAAS,WAAW,UAAK,GAAG,EAAE,kBAAkB,CAAC;AACnD,MAAI,iBAAiB,OAAO,UAAU,CAAC,OAAO,UAAU;AACtD,UAAM,gBAAgB,OAAO,QAAQ,CAAC;AACtC,UAAM,mBAAmB,kBAAkB,UACtC,2BAA2B,IAAI,aAAa;AACjD,QAAI,0BAA0B,QAAQ;AACtC,WACE,2BAA2B,KACxB,CAAC,wBAAwB,IAAI,OAAO,uBAAuB,KAAK,EAAE,MAEnE,oBAAoB,OAAO,uBAAuB,KAAK,EAAE,MAAM,SAC3D,OAAO,uBAAuB,KAAK,IAAI,SAAS,IAAI,IAE1D;AACA,iCAA2B;AAAA,IAC7B;AACA,UAAM,0BAA0B,wBAAwB;AAAA,MACtD,OAAO,uBAAuB,KAAK;AAAA,IACrC;AACA,UAAM,cAAc,WAAW,KAAK,UAAU,KAAK,KAAK,EAAE;AAC1D,UAAM,sBAAsB,QAAQ,KAC/B,MAAM,SAAS,GAAG,KAClB,CAAC,MAAM,SAAS,IAAI,KACpB,CAAC,2BAA2B,IAAI,KAAK;AAC1C,UAAM,sCAAsC,UAAU,KACjD,OAAO,KAAK,CAAC,YAAY,eAC1B,aAAa,KACV,CAAC,WAAW,KAAK,UAAU,UAAU,KAAK,EAAE,MAE7C,2BAA2B,IAAI,UAAU,KACtC,4BAA4B,UAAU,MAAM,QAC5C,WAAW,SAAS,IAAI,KACxB,WAAW,SAAS,KAAK,EAC7B;AACL,QAAI,gBAAgB,UAAU,KAAK,qCAAsC,QAAO;AAChF,QAAI,2BAA2B,oBAAqB,QAAO;AAC3D,WAAO,4BAA4B,KAAK,MAAM,QACzC,MAAM,SAAS,IAAI,KACnB,MAAM,SAAS,KAAK,KACnB,oBAAoB,CAAC,2BACtB;AAAA,EACP,CAAC;AACD,MAAI,mBAAmB,IAAI;AACzB,UAAM,uBAAuB,UAAU,UAAU,CAAC,aAAa,CAAC,WAAW,KAAK,QAAQ,CAAC;AACzF,QAAI,uBAAuB,GAAG;AAC5B,uBAAiB,OAAO,UAAU,CAAC,OAAO,UACxC,SAAS,yBAEP,2BAA2B,IAAI,KAAK,KAElC,oBAAoB,KAAK,MAAM,QAC5B,CAAC,WAAW,KAAK,UAAU,KAAK,KAAK,EAAE,EAE7C;AAAA,IACL;AAAA,EACF;AACA,SAAO,UAAU,IAAI,CAAC,UAAU,UAAU;AACxC,UAAM,QAAQ,OAAO,KAAK;AAC1B,UAAM,cAAc,UAAU;AAC9B,WAAO;AAAA,MACL;AAAA,MACA,SAAS;AAAA,MACT,mBAAmB,CAAC,gBAClB,WAAW,KAAK,QAAQ,KACrB,MAAM,SAAS,GAAG;AAAA,MAEvB;AAAA,IACF;AAAA,EACF,CAAC;AACH;AAEO,SAAS,cAAc,MAAwB;AACpD,SAAO,iBAAiB,IAAI,EAAE,IAAI,CAAC,EAAE,MAAM,MAAM,KAAK;AACxD;AAEO,SAAS,2BAA2B,WAAmB,QAAyB;AACrF,QAAM,kBAAkB,cAAc,SAAS;AAC/C,QAAM,eAAe,cAAc,MAAM;AACzC,MAAI,gBAAgB,WAAW,KAAK,gBAAgB,SAAS,aAAa,OAAQ,QAAO;AACzF,SAAO,aAAa;AAAA,IAAK,CAAC,GAAG,UAC3B,gBAAgB,MAAM,CAAC,OAAO,WAAW,aAAa,QAAQ,MAAM,MAAM,KAAK;AAAA,EACjF;AAEF;AAEO,SAAS,cAAc,OAAwB;AACpD,SAAO,0BAA0B,IAAI,KAAK,KAAK,MAAM,SAAS,KAAK;AACrE;AAEO,SAAS,2BAA2B,OAAwB;AACjE,SAAO,MAAM,SAAS,KAAK,KACtB,UAAU,YACV,UAAU,UACV,UAAU;AACjB;AAEO,SAAS,YAAY,QAA+B,OAAwB;AACjF,MAAI,OAAO,QAAQ,CAAC,MAAM,UAAU,OAAO,QAAQ,CAAC,MAAM,MAAO,QAAO;AACxE,QAAM,gBAAgB,KAAK,IAAI,GAAG,QAAQ,CAAC;AAC3C,WAAS,IAAI,eAAe,IAAI,OAAO,KAAK,GAAG;AAC7C,QAAI,cAAc,OAAO,CAAC,CAAC,EAAG,QAAO;AAAA,EACvC;AAEA,MAAI,OAAO,QAAQ,CAAC,MAAM,UAAU,OAAO,QAAQ,CAAC,MAAM,SAAU,QAAO;AAC3E,MAAI,OAAO,QAAQ,CAAC,MAAM,QAAQ,OAAO,QAAQ,CAAC,MAAM,UAAW,QAAO;AAE1E,QAAM,OAAO,OAAO,QAAQ,CAAC;AAC7B,MAAI,SAAS,UAAa,2BAA2B,IAAI,EAAG,QAAO;AACnE,QAAM,WAAW,OAAO,QAAQ,CAAC;AACjC,SAAO,SAAS,UACX,aAAa,UACb,2BAA2B,IAAI,IAAI,KACnC,cAAc,QAAQ;AAC7B;AAEO,IAAM,8BAA8B;AACpC,IAAM,yBAAyB;AAEtC,IAAM,gCAAgC;AACtC,IAAM,mCAAmC;AAElC,SAAS,UACd,OACA,oBAAoB,OACpB,YAAY,OACJ;AACR,MAAI,MAAM,SAAS,IAAI,EAAG,QAAO,MAAM,MAAM,GAAG,EAAE;AAClD,MAAI,mBAAmB;AACrB,QAAI,CAAC,UAAW,QAAO;AACvB,WAAO,GAAG,6BAA6B,GAAG,KAAK;AAAA,EACjD;AACA,MAAI,MAAM,SAAS,KAAK,MAAM,SAAS,KAAK,GAAG;AAC7C,UAAM,OAAO,MAAM,MAAM,GAAG,EAAE;AAC9B,UAAM,oBAAoB,UAAU,KAAK,IAAI,KAAK,KAAK,SAAS,KAAK,CAAC,UAAU,KAAK,IAAI;AACzF,UAAM,aAAa,oBAAoB,KAAK,MAAM,GAAG,EAAE,IAAI;AAC3D,WAAO,YAAY,GAAG,gCAAgC,GAAG,UAAU,KAAK;AAAA,EAC1E;AACA,MAAI,MAAM,SAAS,KAAK,MAAM,SAAS,KAAK,GAAG;AAC7C,UAAM,aAAa,GAAG,MAAM,MAAM,GAAG,EAAE,CAAC;AACxC,WAAO,YAAY,GAAG,gCAAgC,GAAG,UAAU,KAAK;AAAA,EAC1E;AACA,MAAI,MAAM,SAAS,KAAK,MAAM,SAAS,IAAI,GAAG;AAC5C,UAAM,OAAO,MAAM,MAAM,GAAG,EAAE;AAC9B,UAAM,oBAAoB,UAAU,KAAK,IAAI,KAAK,KAAK,SAAS,KAAK,CAAC,UAAU,KAAK,IAAI;AACzF,UAAM,aAAa,oBAAoB,KAAK,MAAM,GAAG,EAAE,IAAI;AAC3D,WAAO,YAAY,GAAG,gCAAgC,GAAG,UAAU,KAAK;AAAA,EAC1E;AACA,MAAI,MAAM,SAAS,KAAK,MAAM,SAAS,GAAG,KAAK,CAAC,MAAM,SAAS,IAAI,GAAG;AACpE,WAAO,MAAM,SAAS,KAAK,IAAI,GAAG,MAAM,MAAM,GAAG,EAAE,CAAC,MAAM,MAAM,MAAM,GAAG,EAAE;AAAA,EAC7E;AACA,SAAO;AACT;AAGO,SAAS,SAAS,MAA2B;AAClD,QAAM,SAAS,oBAAI,IAAY;AAC/B,aAAW,EAAE,OAAO,kBAAkB,KAAK,iBAAiB,IAAI,GAAG;AACjE,QAAI,oBAAoB,KAAK,MAAM,KAAM,QAAO,IAAI,UAAU,OAAO,mBAAmB,IAAI,CAAC;AAAA,EAC/F;AACA,SAAO;AACT;AAEO,SAAS,uBAAuB,MAAsB;AAC3D,SAAO,KAAK,UAAU,MAAM,EAAE,kBAAkB,EAAE,QAAQ,SAAS,GAAG,EAAE,KAAK;AAC/E;AAEO,SAAS,gBAAgB,QAA0B;AACxD,QAAM,YAAsB,CAAC;AAC7B,MAAI,gBAAgB;AACpB,WAAS,QAAQ,GAAG,QAAQ,OAAO,QAAQ,SAAS,GAAG;AACrD,UAAM,YAAY,OAAO,KAAK;AAC9B,UAAM,gBAAgB,OAAO,QAAQ,CAAC;AACtC,UAAM,WAAW,cAAc,OAC1B,cAAc,OACd,cAAc,OACd,cAAc,QACb,cAAc,QAChB,kBAAkB,UACf,MAAM,KAAK,aAAa,KACxB,YAAY,KAAK,aAAa;AAErC,QAAI,CAAC,SAAU;AACf,QAAI,cAAc,cAAc,OAAO,QAAQ,QAAQ;AACvD,WAAO,YAAY,KAAK,OAAO,WAAW,KAAK,EAAE,EAAG,gBAAe;AACnE,UAAM,WAAW,OAAO,MAAM,eAAe,WAAW,EAAE,KAAK;AAC/D,QAAI,SAAS,SAAS,EAAG,WAAU,KAAK,QAAQ;AAChD,oBAAgB;AAChB,YAAQ,cAAc;AAAA,EACxB;AACA,QAAM,mBAAmB,OAAO,MAAM,aAAa,EAAE,KAAK;AAC1D,MAAI,iBAAiB,SAAS,EAAG,WAAU,KAAK,gBAAgB;AAChE,SAAO,UAAU,SAAS,IAAI,YAAY,CAAC,MAAM;AACnD;AAGO,SAAS,uBAAuB,MAAwB;AAC7D,MAAI,UAAU,iBAAiB,IAAI;AACnC,SAAO,QAAQ,SAAS,KAAK,2BAA2B,IAAI,QAAQ,CAAC,EAAG,KAAK,GAAG;AAC9E,cAAU,QAAQ,MAAM,CAAC;AAAA,EAC3B;AACA,SAAO,QACJ,OAAO,CAAC,EAAE,MAAM,MAAM,oBAAoB,KAAK,MAAM,IAAI,EACzD,IAAI,CAAC,EAAE,OAAO,kBAAkB,MAAM,UAAU,OAAO,mBAAmB,IAAI,CAAC;AACpF;AACO,SAAS,0CAA0C,MAAwB;AAChF,QAAM,aAAa,iCAAiC,IAAI;AACxD,QAAM,cAAc,iBAAiB,IAAI,EAAE,CAAC;AAC5C,MAAI,gBAAgB,UAAa,CAAC,2BAA2B,IAAI,YAAY,KAAK,GAAG;AACnF,WAAO;AAAA,EACT;AACA,SAAO,CAAC,UAAU,YAAY,OAAO,YAAY,mBAAmB,IAAI,GAAG,GAAG,UAAU;AAC1F;AAGO,SAAS,iCAAiC,MAAwB;AACvE,SAAO,uBAAuB,IAAI,EAAE,IAAI,CAAC,UAAU,MAAM,QAAQ,OAAO,EAAE,CAAC;AAC7E;AAEO,SAAS,6BAA6B,MAAc,OAAwB;AACjF,QAAM,aAAa,KAAK,CAAC;AACzB,QAAM,cAAc,MAAM,CAAC;AAC3B,QAAM,aAAa,eAAe,iCAC7B,eAAe;AACpB,QAAM,cAAc,gBAAgB,iCAC/B,gBAAgB;AACrB,QAAM,YAAY,aAAa,KAAK,MAAM,CAAC,IAAI;AAC/C,QAAM,aAAa,cAAc,MAAM,MAAM,CAAC,IAAI;AAClD,MAAI,cAAc,YAAY;AAC5B,UAAM,oBACJ,eAAe,iCACZ,gBAAgB,oCAEnB,gBAAgB,iCACb,eAAe;AAEpB,WAAO,CAAC;AAAA,EACV;AACA,MAAI,eAAe,iCAAiC,gBAAgB,+BAA+B;AACjG,WAAO;AAAA,EACT;AACA,SAAO,GAAG,SAAS,QAAQ,cAAc,cAAc,GAAG,UAAU;AACtE;AACA,IAAM,mCAAmC,oBAAI,IAAI;AAAA,EAC/C;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;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AACF,CAAC;AAED,SAAS,sBAAsB,OAAwB;AACrD,SAAO,iCAAiC,IAAI,KAAK;AACnD;AACA,IAAM,0CAA0C,oBAAI,IAAI;AAAA,EACtD;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;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;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;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AACF,CAAC;AAED,SAAS,4BAA4B,OAAwB;AAC3D,SAAO,wCAAwC,IAAI,KAAK;AAC1D;AAEA,SAAS,0BAA0B,OAAwB;AACzD,SAAO,UAAU,SACZ,UAAU,SACV,UAAU,QACV,UAAU,WACV,UAAU,cACV,UAAU;AACjB;AAEA,SAAS,0BAA0B,QAA+B,OAAwB;AACxF,MAAI,WAAW;AACf,WAAS,SAAS,GAAG,SAAS,OAAO,UAAU,GAAG;AAChD,QAAI,0BAA0B,OAAO,MAAM,CAAE,EAAG,YAAW,SAAS;AAAA,EACtE;AACA,WAAS,SAAS,QAAQ,GAAG,UAAU,UAAU,UAAU,GAAG;AAC5D,QACE,OAAO,MAAM,MAAM,UAChB,SAAS,YACT,4BAA4B,OAAO,SAAS,CAAC,CAAE,GAClD;AACA,aAAO;AAAA,IACT;AACA,QAAI,4BAA4B,OAAO,MAAM,CAAE,KAAK,QAAQ,UAAU,EAAG,QAAO;AAAA,EAClF;AACA,SAAO;AACT;AAEA,SAAS,WAAW,QAA+B,OAAwB;AACzE,MAAI,WAAW;AACf,WAAS,SAAS,GAAG,SAAS,OAAO,UAAU,GAAG;AAChD,QAAI,0BAA0B,OAAO,MAAM,CAAE,EAAG,YAAW,SAAS;AAAA,EACtE;AACA,WAAS,SAAS,QAAQ,GAAG,UAAU,UAAU,UAAU,GAAG;AAC5D,UAAM,QAAQ,OAAO,MAAM;AAC3B,QAAI,UAAU,UAAU,SAAS,YAAY,sBAAsB,OAAO,SAAS,CAAC,CAAE,GAAG;AACvF,aAAO;AAAA,IACT;AACA,QAAI,sBAAsB,KAAK,KAAK,QAAQ,UAAU,EAAG,QAAO;AAAA,EAClE;AACA,SAAO;AACT;AAEO,SAAS,yBAAyB,WAAmB,QAAyB;AACnF,QAAM,mBAAmB,iBAAiB,SAAS;AACnD,QAAM,kBAAkB,iBAAiB,IAAI,CAAC,EAAE,MAAM,MAAM,KAAK;AACjE,MAAI,wBAAwB;AAC5B,aAAW,UAAU,gBAAgB,MAAM,EAAE,QAAQ,CAAC,aACpD,SAAS,MAAM,+CAA+C,CAAC,GAAG;AAClE,UAAMA,iBAAgB,iBAAiB,MAAM;AAC7C,UAAMC,gBAAeD,eAAc,IAAI,CAAC,EAAE,MAAM,MAAM,KAAK;AAC3D,QAAI,eAAe;AACnB,QAAI,iBAAiB;AACrB,QAAI,gBAAgB;AACpB,eAAW,CAAC,gBAAgB,cAAc,KAAK,gBAAgB,QAAQ,GAAG;AACxE,UAAI,oBAAoB,cAAc,MAAM,KAAM;AAClD,YAAM,cAAcC,cAAa;AAAA,QAC/B,CAAC,aAAa,UACZ,SAAS,gBACN,UAAU,aAAaD,eAAc,KAAK,GAAG,sBAAsB,IAAI,MACpE,UAAU,gBAAgB,iBAAiB,cAAc,GAAG,sBAAsB,IAAI;AAAA,MAChG;AACA,UAAI,gBAAgB,IAAI;AACtB,yBAAiB;AACjB;AAAA,MACF;AACA,YAAM,mBAAmB,YAAY,iBAAiB,cAAc,KAC/D,WAAW,iBAAiB,cAAc;AAC/C,YAAM,gBAAgB,YAAYC,eAAc,WAAW,KACtD,WAAWA,eAAc,WAAW;AACzC,YAAM,wBAAwB,0BAA0B,iBAAiB,cAAc;AACvF,YAAM,qBAAqB,0BAA0BA,eAAc,WAAW;AAC9E,UACE,qBAAqB,iBAClB,0BAA0B,oBAC7B;AACA,wBAAgB;AAAA,MAClB;AACA,qBAAe,cAAc;AAAA,IAC/B;AACA,QAAI,gBAAgB;AAClB,UAAI,CAAC,cAAe,QAAO;AAC3B,8BAAwB;AAAA,IAC1B;AAAA,EACF;AACA,MAAI,sBAAuB,QAAO;AAElC,QAAM,gBAAgB,iBAAiB,MAAM;AAC7C,QAAM,eAAe,cAAc,IAAI,CAAC,EAAE,MAAM,MAAM,KAAK;AAC3D,QAAM,kBAAkB,oBAAI,IAAsB;AAClD,gBAAc,QAAQ,CAAC,EAAE,OAAO,kBAAkB,GAAG,UAAU;AAC7D,UAAM,MAAM,UAAU,OAAO,iBAAiB;AAC9C,UAAM,YAAY,gBAAgB,IAAI,GAAG;AACzC,QAAI,UAAW,WAAU,KAAK,KAAK;AAAA,QAC9B,iBAAgB,IAAI,KAAK,CAAC,KAAK,CAAC;AAAA,EACvC,CAAC;AACD,aAAW,CAAC,gBAAgB,KAAK,KAAK,gBAAgB,QAAQ,GAAG;AAC/D,QAAI,oBAAoB,KAAK,MAAM,KAAM;AACzC,UAAM,YAAY,gBAAgB;AAAA,MAChC,UAAU,OAAO,iBAAiB,cAAc,GAAG,sBAAsB,IAAI;AAAA,IAC/E;AACA,QAAI,CAAC,aAAa,UAAU,WAAW,EAAG;AAC1C,UAAM,cAAc,UAAU,UAAU,SAAS,CAAC;AAClD,UAAM,mBAAmB,YAAY,iBAAiB,cAAc,KAC/D,WAAW,iBAAiB,cAAc;AAC/C,UAAM,gBAAgB,YAAY,cAAc,WAAW,KACtD,WAAW,cAAc,WAAW;AACzC,UAAM,wBAAwB,0BAA0B,iBAAiB,cAAc;AACvF,UAAM,qBAAqB,0BAA0B,cAAc,WAAW;AAC9E,QACE,qBAAqB,iBAClB,0BAA0B,oBAC7B;AACA,aAAO;AAAA,IACT;AAAA,EACF;AACA,SAAO;AACT;","names":["sourceLexemes","sourceTokens"]}