@remnic/core 9.45.3 → 9.45.5

package/dist/chunk-VHFXP27N.js.map

@@ -0,0 +1 @@
+{"version":3,"sources":["../src/reconcile/manifest.ts"],"sourcesContent":["import { createHash } from \"node:crypto\";\nimport { inferMemoryStatus } from \"../memory-lifecycle-ledger-utils.js\";\nimport { ContentHashIndex, type ContentHashPathEntry } from \"../storage/content-hash-index.js\";\nimport type { MemoryFrontmatter, MemoryStatus } from \"../types.js\";\nimport { RECALL_FALLBACK_DIRS } from \"../utils/category-dir.js\";\nimport {\n  type ReconcileFileState,\n  type ReconcilePlan,\n  type ReconcilePlanEntry,\n  type ReconcileSemanticAgreement,\n  type ReconcileSemanticChange,\n  summarizeReconcilePlan,\n} from \"./plan.js\";\n\nexport const RECONCILE_MANIFEST_FORMAT = \"remnic-reconcile-manifest\";\nexport const RECONCILE_MANIFEST_SCHEMA_VERSION = 1;\n\nexport interface ReconcileMemoryIdentity {\n  id: string;\n  category: string;\n  contentHash: string;\n  status: MemoryStatus;\n}\n\nexport interface ReconcileManifestFile extends ReconcileFileState {\n  memory?: ReconcileMemoryIdentity;\n}\n\ntype ActiveFactManifestFile = ReconcileManifestFile & { memory: ReconcileMemoryIdentity };\n\nexport interface ReconcileManifest {\n  format: typeof RECONCILE_MANIFEST_FORMAT;\n  schemaVersion: typeof RECONCILE_MANIFEST_SCHEMA_VERSION;\n  files: ReconcileManifestFile[];\n}\n\nexport type ReconcileMemoryParser = (\n  raw: string,\n) => { frontmatter: MemoryFrontmatter; content: string } | null;\n\nexport interface BuildReconcileManifestOptions {\n  files: Iterable<ReconcileFileState>;\n  readFile: (file: ReconcileFileState) => Promise<Buffer | string | null>;\n  parseMemory: ReconcileMemoryParser;\n  cachedFiles?: Iterable<ReconcileManifestFile>;\n}\n\nconst SHA256_PATTERN = /^[a-f0-9]{64}$/i;\nconst MEMORY_DIRS = new Set(RECALL_FALLBACK_DIRS);\n\nfunction isMemoryPath(filePath: string): boolean {\n  if (!filePath.endsWith(\".md\")) return false;\n  const segments = filePath.split(\"/\");\n  let index = 0;\n  if (segments[index] === \"cold\" || segments[index] === \"archive\") index += 1;\n  return MEMORY_DIRS.has(segments[index] ?? \"\");\n}\n\n\nfunction parsedMemoryIdentity(\n  filePath: string,\n  raw: Buffer | string,\n  parseMemory: ReconcileMemoryParser,\n): ReconcileMemoryIdentity | undefined {\n  if (!isMemoryPath(filePath)) return undefined;\n  const parsed = parseMemory(Buffer.isBuffer(raw) ? raw.toString(\"utf8\") : raw);\n  if (!parsed?.frontmatter.id) return undefined;\n  const storedHash = parsed.frontmatter.contentHash;\n  const contentHash =\n    storedHash && SHA256_PATTERN.test(storedHash)\n      ? storedHash.toLowerCase()\n      : ContentHashIndex.computeHash(parsed.content);\n  return {\n    id: parsed.frontmatter.id,\n    category: parsed.frontmatter.category,\n    contentHash,\n    status: inferMemoryStatus(parsed.frontmatter, filePath),\n  };\n}\n\nexport async function buildReconcileManifestFile(\n  file: ReconcileFileState,\n  readFile: (file: ReconcileFileState) => Promise<Buffer | string | null>,\n  parseMemory: ReconcileMemoryParser,\n): Promise<ReconcileManifestFile> {\n  let raw: Buffer | string | null = null;\n  if (isMemoryPath(file.path)) {\n    try {\n      raw = await readFile(file);\n    } catch {\n      raw = null;\n    }\n  }\n  if (raw !== null && createHash(\"sha256\").update(raw).digest(\"hex\") !== file.sha256.toLowerCase()) {\n    raw = null;\n  }\n  const memory = raw === null ? undefined : parsedMemoryIdentity(file.path, raw, parseMemory);\n  return { ...file, ...(memory ? { memory } : {}) };\n}\n\nexport async function buildReconcileManifest(options: BuildReconcileManifestOptions): Promise<ReconcileManifest> {\n  const cachedByPath = new Map<string, ReconcileManifestFile>();\n  for (const cached of options.cachedFiles ?? []) {\n    cachedByPath.set(cached.path, cached);\n  }\n\n  const files: ReconcileManifestFile[] = [];\n  for (const file of options.files) {\n    const cached = cachedByPath.get(file.path);\n    if (cached?.sha256.toLowerCase() === file.sha256.toLowerCase()) {\n      files.push({ ...file, ...(cached.memory ? { memory: cached.memory } : {}) });\n      continue;\n    }\n\n    files.push(await buildReconcileManifestFile(file, options.readFile, options.parseMemory));\n  }\n  files.sort((left, right) => (left.path < right.path ? -1 : left.path > right.path ? 1 : 0));\n  return {\n    format: RECONCILE_MANIFEST_FORMAT,\n    schemaVersion: RECONCILE_MANIFEST_SCHEMA_VERSION,\n    files,\n  };\n}\n\nfunction activeFactByPath(manifest: ReconcileManifest | undefined): Map<string, ActiveFactManifestFile> {\n  const result = new Map<string, ActiveFactManifestFile>();\n  for (const file of manifest?.files ?? []) {\n    if (file.memory?.category === \"fact\" && file.memory.status === \"active\") {\n      result.set(file.path, file as ActiveFactManifestFile);\n    }\n  }\n  return result;\n}\n\nfunction contentHashRows(files: Iterable<ActiveFactManifestFile>): ContentHashPathEntry[] {\n  const rows: ContentHashPathEntry[] = [];\n  for (const file of files) {\n    rows.push({ path: file.path, contentHash: file.memory.contentHash });\n  }\n  return rows;\n}\n\nfunction comparePlanEntries(left: ReconcilePlanEntry, right: ReconcilePlanEntry): number {\n  if (left.namespace !== right.namespace) return left.namespace < right.namespace ? -1 : 1;\n  return left.path < right.path ? -1 : left.path > right.path ? 1 : 0;\n}\n\nfunction semanticAgreementKey(agreement: ReconcileSemanticAgreement): string {\n  return `${agreement.local.path}\\0${agreement.peer.path}`;\n}\n\nfunction classifySemanticChange(\n  current: ReconcileSemanticAgreement,\n  prior: ReconcileSemanticAgreement | undefined\n): ReconcileSemanticChange {\n  if (!prior) return \"unchanged\";\n  const localChanged = current.local.sha256 !== prior.local.sha256;\n  const peerChanged = current.peer.sha256 !== prior.peer.sha256;\n  if (localChanged && peerChanged) return \"both_modified\";\n  if (localChanged) return \"local_changed\";\n  if (peerChanged) return \"peer_changed\";\n  return \"unchanged\";\n}\n\nexport function collapseActiveFactDuplicates(\n  plan: ReconcilePlan,\n  localManifests: ReadonlyMap<string, ReconcileManifest>,\n  peerManifests: ReadonlyMap<string, ReconcileManifest>,\n  priorSemanticAgreements?: ReadonlyMap<string, readonly ReconcileSemanticAgreement[]>,\n): ReconcilePlan {\n  const entriesByNamespace = new Map<string, ReconcilePlanEntry[]>();\n  for (const entry of plan.entries) {\n    const entries = entriesByNamespace.get(entry.namespace) ?? [];\n    entries.push({ ...entry });\n    entriesByNamespace.set(entry.namespace, entries);\n  }\n\n  let changed = false;\n  for (const namespace of new Set([...localManifests.keys(), ...peerManifests.keys()])) {\n    const entries = entriesByNamespace.get(namespace) ?? [];\n    const localManifest = localManifests.get(namespace);\n    const peerManifest = peerManifests.get(namespace);\n    const localByPath = activeFactByPath(localManifest);\n    const peerByPath = activeFactByPath(peerManifest);\n    const localFilesByPath = new Map((localManifest?.files ?? []).map((file) => [file.path, file]));\n    const peerFilesByPath = new Map((peerManifest?.files ?? []).map((file) => [file.path, file]));\n    const priorSemanticByPathPair = new Map(\n      (priorSemanticAgreements?.get(namespace) ?? []).map((agreement) => [\n        semanticAgreementKey(agreement),\n        agreement,\n      ])\n    );\n    const localByHash = new Map<string, ActiveFactManifestFile[]>();\n    const peerByHash = new Map<string, ActiveFactManifestFile[]>();\n\n    for (const file of localByPath.values()) {\n      const hash = file.memory.contentHash;\n      const bucket = localByHash.get(hash) ?? [];\n      bucket.push(file);\n      localByHash.set(hash, bucket);\n    }\n    for (const file of peerByPath.values()) {\n      const hash = file.memory.contentHash;\n      const bucket = peerByHash.get(hash) ?? [];\n      bucket.push(file);\n      peerByHash.set(hash, bucket);\n    }\n\n    const removed = new Set<ReconcilePlanEntry>();\n    const replacements: ReconcilePlanEntry[] = [];\n    for (const hash of new Set([...localByHash.keys(), ...peerByHash.keys()])) {\n      const localCandidates = (localByHash.get(hash) ?? []).filter((file) => {\n        const opposite = peerFilesByPath.get(file.path);\n        const activeOpposite = peerByPath.get(file.path);\n        return opposite === undefined || activeOpposite?.memory.contentHash === hash;\n      });\n      const peerCandidates = (peerByHash.get(hash) ?? []).filter((file) => {\n        const opposite = localFilesByPath.get(file.path);\n        const activeOpposite = localByPath.get(file.path);\n        return opposite === undefined || activeOpposite?.memory.contentHash === hash;\n      });\n      const localPath = ContentHashIndex.resolvePathByHash(hash, contentHashRows(localCandidates));\n      const peerPath = ContentHashIndex.resolvePathByHash(hash, contentHashRows(peerCandidates));\n\n      if (localPath && peerPath && localPath !== peerPath) {\n        const localFile = localByPath.get(localPath);\n        const peerFile = peerByPath.get(peerPath);\n        if (!localFile || !peerFile) continue;\n        const duplicatePaths = new Set([\n          ...localCandidates.map((file) => file.path),\n          ...peerCandidates.map((file) => file.path),\n        ]);\n        const authoritativeSamePathEntries = new Set(entries.filter(\n          (entry) =>\n            duplicatePaths.has(entry.path)\n            && localFilesByPath.has(entry.path)\n            && peerFilesByPath.has(entry.path)\n            && entry.action !== \"identical\"\n        ));\n        if (authoritativeSamePathEntries.size > 0) {\n          for (const entry of entries) {\n            if (\n              duplicatePaths.has(entry.path)\n              && !authoritativeSamePathEntries.has(entry)\n              && (entry.action === \"pull\" || entry.action === \"push\" || entry.action === \"identical\")\n            ) {\n              removed.add(entry);\n              changed = true;\n            }\n          }\n          continue;\n        }\n        const unsafeEntry = entries.some(\n          (entry) => duplicatePaths.has(entry.path) && (entry.action === \"suppress\" || entry.action === \"conflict\")\n        );\n        if (unsafeEntry) continue;\n        for (const entry of entries) {\n          if (\n            duplicatePaths.has(entry.path) &&\n            (entry.action === \"pull\" || entry.action === \"push\" || entry.action === \"identical\")\n          ) {\n            removed.add(entry);\n          }\n        }\n        const semanticAgreement: ReconcileSemanticAgreement = {\n          local: { path: localPath, sha256: localFile.sha256 },\n          peer: { path: peerPath, sha256: peerFile.sha256 },\n        };\n        replacements.push({\n          path: localPath < peerPath ? localPath : peerPath,\n          namespace,\n          action: \"identical\",\n          reason: \"semantic_duplicate\",\n          semanticAgreement,\n          semanticChange: classifySemanticChange(\n            semanticAgreement,\n            priorSemanticByPathPair.get(semanticAgreementKey(semanticAgreement))\n          ),\n        });\n        changed = true;\n        continue;\n      }\n\n      const sameSideEntries = entries.filter((entry) => {\n        if (localPath && entry.reason === \"local_only\") {\n          return localCandidates.some((file) => file.path === entry.path);\n        }\n        if (peerPath && entry.reason === \"peer_only\") {\n          return peerCandidates.some((file) => file.path === entry.path);\n        }\n        return false;\n      });\n      const canonicalPath = localPath ?? peerPath;\n      const hasSharedCanonical = localPath !== undefined && localPath === peerPath;\n      if (!canonicalPath || sameSideEntries.length === 0 || (!hasSharedCanonical && sameSideEntries.length < 2)) {\n        continue;\n      }\n      for (const entry of sameSideEntries) {\n        if (entry.path !== canonicalPath) {\n          removed.add(entry);\n          changed = true;\n        }\n      }\n    }\n\n    if (removed.size > 0 || replacements.length > 0) {\n      entriesByNamespace.set(\n        namespace,\n        [...entries.filter((entry) => !removed.has(entry)), ...replacements].sort(comparePlanEntries)\n      );\n    }\n  }\n\n  if (!changed) return plan;\n  const entries = [...entriesByNamespace.values()].flat().sort(comparePlanEntries);\n  return {\n    entries,\n    byNamespace: summarizeReconcilePlan(entries),\n    converged: entries.every((entry) => entry.action === \"identical\"),\n  };\n}\n"],"mappings":";;;;;;;;;;;;;;AAAA,SAAS,kBAAkB;AAcpB,IAAM,4BAA4B;AAClC,IAAM,oCAAoC;AAgCjD,IAAM,iBAAiB;AACvB,IAAM,cAAc,IAAI,IAAI,oBAAoB;AAEhD,SAAS,aAAa,UAA2B;AAC/C,MAAI,CAAC,SAAS,SAAS,KAAK,EAAG,QAAO;AACtC,QAAM,WAAW,SAAS,MAAM,GAAG;AACnC,MAAI,QAAQ;AACZ,MAAI,SAAS,KAAK,MAAM,UAAU,SAAS,KAAK,MAAM,UAAW,UAAS;AAC1E,SAAO,YAAY,IAAI,SAAS,KAAK,KAAK,EAAE;AAC9C;AAGA,SAAS,qBACP,UACA,KACA,aACqC;AACrC,MAAI,CAAC,aAAa,QAAQ,EAAG,QAAO;AACpC,QAAM,SAAS,YAAY,OAAO,SAAS,GAAG,IAAI,IAAI,SAAS,MAAM,IAAI,GAAG;AAC5E,MAAI,CAAC,QAAQ,YAAY,GAAI,QAAO;AACpC,QAAM,aAAa,OAAO,YAAY;AACtC,QAAM,cACJ,cAAc,eAAe,KAAK,UAAU,IACxC,WAAW,YAAY,IACvB,iBAAiB,YAAY,OAAO,OAAO;AACjD,SAAO;AAAA,IACL,IAAI,OAAO,YAAY;AAAA,IACvB,UAAU,OAAO,YAAY;AAAA,IAC7B;AAAA,IACA,QAAQ,kBAAkB,OAAO,aAAa,QAAQ;AAAA,EACxD;AACF;AAEA,eAAsB,2BACpB,MACA,UACA,aACgC;AAChC,MAAI,MAA8B;AAClC,MAAI,aAAa,KAAK,IAAI,GAAG;AAC3B,QAAI;AACF,YAAM,MAAM,SAAS,IAAI;AAAA,IAC3B,QAAQ;AACN,YAAM;AAAA,IACR;AAAA,EACF;AACA,MAAI,QAAQ,QAAQ,WAAW,QAAQ,EAAE,OAAO,GAAG,EAAE,OAAO,KAAK,MAAM,KAAK,OAAO,YAAY,GAAG;AAChG,UAAM;AAAA,EACR;AACA,QAAM,SAAS,QAAQ,OAAO,SAAY,qBAAqB,KAAK,MAAM,KAAK,WAAW;AAC1F,SAAO,EAAE,GAAG,MAAM,GAAI,SAAS,EAAE,OAAO,IAAI,CAAC,EAAG;AAClD;AAEA,eAAsB,uBAAuB,SAAoE;AAC/G,QAAM,eAAe,oBAAI,IAAmC;AAC5D,aAAW,UAAU,QAAQ,eAAe,CAAC,GAAG;AAC9C,iBAAa,IAAI,OAAO,MAAM,MAAM;AAAA,EACtC;AAEA,QAAM,QAAiC,CAAC;AACxC,aAAW,QAAQ,QAAQ,OAAO;AAChC,UAAM,SAAS,aAAa,IAAI,KAAK,IAAI;AACzC,QAAI,QAAQ,OAAO,YAAY,MAAM,KAAK,OAAO,YAAY,GAAG;AAC9D,YAAM,KAAK,EAAE,GAAG,MAAM,GAAI,OAAO,SAAS,EAAE,QAAQ,OAAO,OAAO,IAAI,CAAC,EAAG,CAAC;AAC3E;AAAA,IACF;AAEA,UAAM,KAAK,MAAM,2BAA2B,MAAM,QAAQ,UAAU,QAAQ,WAAW,CAAC;AAAA,EAC1F;AACA,QAAM,KAAK,CAAC,MAAM,UAAW,KAAK,OAAO,MAAM,OAAO,KAAK,KAAK,OAAO,MAAM,OAAO,IAAI,CAAE;AAC1F,SAAO;AAAA,IACL,QAAQ;AAAA,IACR,eAAe;AAAA,IACf;AAAA,EACF;AACF;AAEA,SAAS,iBAAiB,UAA8E;AACtG,QAAM,SAAS,oBAAI,IAAoC;AACvD,aAAW,QAAQ,UAAU,SAAS,CAAC,GAAG;AACxC,QAAI,KAAK,QAAQ,aAAa,UAAU,KAAK,OAAO,WAAW,UAAU;AACvE,aAAO,IAAI,KAAK,MAAM,IAA8B;AAAA,IACtD;AAAA,EACF;AACA,SAAO;AACT;AAEA,SAAS,gBAAgB,OAAiE;AACxF,QAAM,OAA+B,CAAC;AACtC,aAAW,QAAQ,OAAO;AACxB,SAAK,KAAK,EAAE,MAAM,KAAK,MAAM,aAAa,KAAK,OAAO,YAAY,CAAC;AAAA,EACrE;AACA,SAAO;AACT;AAEA,SAAS,mBAAmB,MAA0B,OAAmC;AACvF,MAAI,KAAK,cAAc,MAAM,UAAW,QAAO,KAAK,YAAY,MAAM,YAAY,KAAK;AACvF,SAAO,KAAK,OAAO,MAAM,OAAO,KAAK,KAAK,OAAO,MAAM,OAAO,IAAI;AACpE;AAEA,SAAS,qBAAqB,WAA+C;AAC3E,SAAO,GAAG,UAAU,MAAM,IAAI,KAAK,UAAU,KAAK,IAAI;AACxD;AAEA,SAAS,uBACP,SACA,OACyB;AACzB,MAAI,CAAC,MAAO,QAAO;AACnB,QAAM,eAAe,QAAQ,MAAM,WAAW,MAAM,MAAM;AAC1D,QAAM,cAAc,QAAQ,KAAK,WAAW,MAAM,KAAK;AACvD,MAAI,gBAAgB,YAAa,QAAO;AACxC,MAAI,aAAc,QAAO;AACzB,MAAI,YAAa,QAAO;AACxB,SAAO;AACT;AAEO,SAAS,6BACd,MACA,gBACA,eACA,yBACe;AACf,QAAM,qBAAqB,oBAAI,IAAkC;AACjE,aAAW,SAAS,KAAK,SAAS;AAChC,UAAMA,WAAU,mBAAmB,IAAI,MAAM,SAAS,KAAK,CAAC;AAC5D,IAAAA,SAAQ,KAAK,EAAE,GAAG,MAAM,CAAC;AACzB,uBAAmB,IAAI,MAAM,WAAWA,QAAO;AAAA,EACjD;AAEA,MAAI,UAAU;AACd,aAAW,aAAa,oBAAI,IAAI,CAAC,GAAG,eAAe,KAAK,GAAG,GAAG,cAAc,KAAK,CAAC,CAAC,GAAG;AACpF,UAAMA,WAAU,mBAAmB,IAAI,SAAS,KAAK,CAAC;AACtD,UAAM,gBAAgB,eAAe,IAAI,SAAS;AAClD,UAAM,eAAe,cAAc,IAAI,SAAS;AAChD,UAAM,cAAc,iBAAiB,aAAa;AAClD,UAAM,aAAa,iBAAiB,YAAY;AAChD,UAAM,mBAAmB,IAAI,KAAK,eAAe,SAAS,CAAC,GAAG,IAAI,CAAC,SAAS,CAAC,KAAK,MAAM,IAAI,CAAC,CAAC;AAC9F,UAAM,kBAAkB,IAAI,KAAK,cAAc,SAAS,CAAC,GAAG,IAAI,CAAC,SAAS,CAAC,KAAK,MAAM,IAAI,CAAC,CAAC;AAC5F,UAAM,0BAA0B,IAAI;AAAA,OACjC,yBAAyB,IAAI,SAAS,KAAK,CAAC,GAAG,IAAI,CAAC,cAAc;AAAA,QACjE,qBAAqB,SAAS;AAAA,QAC9B;AAAA,MACF,CAAC;AAAA,IACH;AACA,UAAM,cAAc,oBAAI,IAAsC;AAC9D,UAAM,aAAa,oBAAI,IAAsC;AAE7D,eAAW,QAAQ,YAAY,OAAO,GAAG;AACvC,YAAM,OAAO,KAAK,OAAO;AACzB,YAAM,SAAS,YAAY,IAAI,IAAI,KAAK,CAAC;AACzC,aAAO,KAAK,IAAI;AAChB,kBAAY,IAAI,MAAM,MAAM;AAAA,IAC9B;AACA,eAAW,QAAQ,WAAW,OAAO,GAAG;AACtC,YAAM,OAAO,KAAK,OAAO;AACzB,YAAM,SAAS,WAAW,IAAI,IAAI,KAAK,CAAC;AACxC,aAAO,KAAK,IAAI;AAChB,iBAAW,IAAI,MAAM,MAAM;AAAA,IAC7B;AAEA,UAAM,UAAU,oBAAI,IAAwB;AAC5C,UAAM,eAAqC,CAAC;AAC5C,eAAW,QAAQ,oBAAI,IAAI,CAAC,GAAG,YAAY,KAAK,GAAG,GAAG,WAAW,KAAK,CAAC,CAAC,GAAG;AACzE,YAAM,mBAAmB,YAAY,IAAI,IAAI,KAAK,CAAC,GAAG,OAAO,CAAC,SAAS;AACrE,cAAM,WAAW,gBAAgB,IAAI,KAAK,IAAI;AAC9C,cAAM,iBAAiB,WAAW,IAAI,KAAK,IAAI;AAC/C,eAAO,aAAa,UAAa,gBAAgB,OAAO,gBAAgB;AAAA,MAC1E,CAAC;AACD,YAAM,kBAAkB,WAAW,IAAI,IAAI,KAAK,CAAC,GAAG,OAAO,CAAC,SAAS;AACnE,cAAM,WAAW,iBAAiB,IAAI,KAAK,IAAI;AAC/C,cAAM,iBAAiB,YAAY,IAAI,KAAK,IAAI;AAChD,eAAO,aAAa,UAAa,gBAAgB,OAAO,gBAAgB;AAAA,MAC1E,CAAC;AACD,YAAM,YAAY,iBAAiB,kBAAkB,MAAM,gBAAgB,eAAe,CAAC;AAC3F,YAAM,WAAW,iBAAiB,kBAAkB,MAAM,gBAAgB,cAAc,CAAC;AAEzF,UAAI,aAAa,YAAY,cAAc,UAAU;AACnD,cAAM,YAAY,YAAY,IAAI,SAAS;AAC3C,cAAM,WAAW,WAAW,IAAI,QAAQ;AACxC,YAAI,CAAC,aAAa,CAAC,SAAU;AAC7B,cAAM,iBAAiB,oBAAI,IAAI;AAAA,UAC7B,GAAG,gBAAgB,IAAI,CAAC,SAAS,KAAK,IAAI;AAAA,UAC1C,GAAG,eAAe,IAAI,CAAC,SAAS,KAAK,IAAI;AAAA,QAC3C,CAAC;AACD,cAAM,+BAA+B,IAAI,IAAIA,SAAQ;AAAA,UACnD,CAAC,UACC,eAAe,IAAI,MAAM,IAAI,KAC1B,iBAAiB,IAAI,MAAM,IAAI,KAC/B,gBAAgB,IAAI,MAAM,IAAI,KAC9B,MAAM,WAAW;AAAA,QACxB,CAAC;AACD,YAAI,6BAA6B,OAAO,GAAG;AACzC,qBAAW,SAASA,UAAS;AAC3B,gBACE,eAAe,IAAI,MAAM,IAAI,KAC1B,CAAC,6BAA6B,IAAI,KAAK,MACtC,MAAM,WAAW,UAAU,MAAM,WAAW,UAAU,MAAM,WAAW,cAC3E;AACA,sBAAQ,IAAI,KAAK;AACjB,wBAAU;AAAA,YACZ;AAAA,UACF;AACA;AAAA,QACF;AACA,cAAM,cAAcA,SAAQ;AAAA,UAC1B,CAAC,UAAU,eAAe,IAAI,MAAM,IAAI,MAAM,MAAM,WAAW,cAAc,MAAM,WAAW;AAAA,QAChG;AACA,YAAI,YAAa;AACjB,mBAAW,SAASA,UAAS;AAC3B,cACE,eAAe,IAAI,MAAM,IAAI,MAC5B,MAAM,WAAW,UAAU,MAAM,WAAW,UAAU,MAAM,WAAW,cACxE;AACA,oBAAQ,IAAI,KAAK;AAAA,UACnB;AAAA,QACF;AACA,cAAM,oBAAgD;AAAA,UACpD,OAAO,EAAE,MAAM,WAAW,QAAQ,UAAU,OAAO;AAAA,UACnD,MAAM,EAAE,MAAM,UAAU,QAAQ,SAAS,OAAO;AAAA,QAClD;AACA,qBAAa,KAAK;AAAA,UAChB,MAAM,YAAY,WAAW,YAAY;AAAA,UACzC;AAAA,UACA,QAAQ;AAAA,UACR,QAAQ;AAAA,UACR;AAAA,UACA,gBAAgB;AAAA,YACd;AAAA,YACA,wBAAwB,IAAI,qBAAqB,iBAAiB,CAAC;AAAA,UACrE;AAAA,QACF,CAAC;AACD,kBAAU;AACV;AAAA,MACF;AAEA,YAAM,kBAAkBA,SAAQ,OAAO,CAAC,UAAU;AAChD,YAAI,aAAa,MAAM,WAAW,cAAc;AAC9C,iBAAO,gBAAgB,KAAK,CAAC,SAAS,KAAK,SAAS,MAAM,IAAI;AAAA,QAChE;AACA,YAAI,YAAY,MAAM,WAAW,aAAa;AAC5C,iBAAO,eAAe,KAAK,CAAC,SAAS,KAAK,SAAS,MAAM,IAAI;AAAA,QAC/D;AACA,eAAO;AAAA,MACT,CAAC;AACD,YAAM,gBAAgB,aAAa;AACnC,YAAM,qBAAqB,cAAc,UAAa,cAAc;AACpE,UAAI,CAAC,iBAAiB,gBAAgB,WAAW,KAAM,CAAC,sBAAsB,gBAAgB,SAAS,GAAI;AACzG;AAAA,MACF;AACA,iBAAW,SAAS,iBAAiB;AACnC,YAAI,MAAM,SAAS,eAAe;AAChC,kBAAQ,IAAI,KAAK;AACjB,oBAAU;AAAA,QACZ;AAAA,MACF;AAAA,IACF;AAEA,QAAI,QAAQ,OAAO,KAAK,aAAa,SAAS,GAAG;AAC/C,yBAAmB;AAAA,QACjB;AAAA,QACA,CAAC,GAAGA,SAAQ,OAAO,CAAC,UAAU,CAAC,QAAQ,IAAI,KAAK,CAAC,GAAG,GAAG,YAAY,EAAE,KAAK,kBAAkB;AAAA,MAC9F;AAAA,IACF;AAAA,EACF;AAEA,MAAI,CAAC,QAAS,QAAO;AACrB,QAAM,UAAU,CAAC,GAAG,mBAAmB,OAAO,CAAC,EAAE,KAAK,EAAE,KAAK,kBAAkB;AAC/E,SAAO;AAAA,IACL;AAAA,IACA,aAAa,uBAAuB,OAAO;AAAA,IAC3C,WAAW,QAAQ,MAAM,CAAC,UAAU,MAAM,WAAW,WAAW;AAAA,EAClE;AACF;","names":["entries"]}

package/dist/chunk-VL35ZFSZ.js

@@ -0,0 +1,102 @@
+import {
+  searchExternalWikis
+} from "./chunk-7T4TOGMS.js";
+
+// src/external-wiki-cli.ts
+var USAGE = "Usage: remnic external-wiki search <query...> [--wiki-id <id>] [--limit <1-20>] [--max-chars-per-hit <100-8000>] [--json]\n";
+async function runExternalWikiCliCommand(roots, args, io) {
+  if (args[0] === "help" || args[0] === "--help" || args[0] === "-h") {
+    io.stdout.write(USAGE);
+    return 0;
+  }
+  const searchArgs = args[0] === "search" ? args.slice(1) : args;
+  let limit;
+  let wikiId;
+  let maxCharsPerHit;
+  let json = false;
+  const queryParts = [];
+  for (let index = 0; index < searchArgs.length; index += 1) {
+    const argument = searchArgs[index];
+    if (argument === "--json") {
+      json = true;
+      continue;
+    }
+    if (argument === "--limit" || argument === "--wiki-id" || argument === "--max-chars-per-hit") {
+      const value = searchArgs[index + 1];
+      if (value === void 0 || value.startsWith("--")) {
+        io.stderr.write(`external-wiki: ${argument} requires a value
+`);
+        return 2;
+      }
+      index += 1;
+      if (argument === "--wiki-id") {
+        wikiId = value.trim();
+        if (wikiId.length === 0) {
+          io.stderr.write("external-wiki: --wiki-id must not be empty\n");
+          return 2;
+        }
+        continue;
+      }
+      const parsed = Number(value);
+      const maximum = argument === "--limit" ? 20 : 8e3;
+      const minimum = argument === "--limit" ? 1 : 100;
+      if (!Number.isInteger(parsed) || parsed < minimum || parsed > maximum) {
+        io.stderr.write(`external-wiki: ${argument} must be an integer from ${minimum} to ${maximum}
+`);
+        return 2;
+      }
+      if (argument === "--limit") limit = parsed;
+      else maxCharsPerHit = parsed;
+      continue;
+    }
+    if (argument.startsWith("-")) {
+      io.stderr.write(`external-wiki: unknown option '${argument}'
+${USAGE}`);
+      return 2;
+    }
+    queryParts.push(argument);
+  }
+  const query = queryParts.join(" ").trim();
+  if (query.length === 0) {
+    io.stderr.write("external-wiki: provide a search query\n");
+    return 1;
+  }
+  const enabled = roots.filter((root) => root.enabled !== false);
+  if (enabled.length === 0) {
+    io.stderr.write("external-wiki: no enabled wiki roots configured\n");
+    return 1;
+  }
+  let result;
+  try {
+    result = await searchExternalWikis(enabled, { query, limit, wikiId, maxCharsPerHit });
+  } catch (error) {
+    io.stderr.write(`external-wiki: ${error instanceof Error ? error.message : "search failed"}
+`);
+    return 1;
+  }
+  if (json) {
+    io.stdout.write(`${JSON.stringify(result, null, 2)}
+`);
+    return 0;
+  }
+  if (result.degradedWikiIds.length > 0) {
+    io.stderr.write(`Warning: degraded roots: ${result.degradedWikiIds.join(", ")}
+`);
+  }
+  if (result.hits.length === 0) {
+    io.stdout.write("No results.\n");
+    return 0;
+  }
+  for (const hit of result.hits) {
+    io.stdout.write(`[${hit.wikiId}] ${hit.path} (score ${hit.score})
+${hit.snippet}
+
+`);
+  }
+  return 0;
+}
+
+export {
+  runExternalWikiCliCommand
+};
+//# sourceMappingURL=chunk-VL35ZFSZ.js.map

package/dist/chunk-VL35ZFSZ.js.map

@@ -0,0 +1 @@
+{"version":3,"sources":["../src/external-wiki-cli.ts"],"sourcesContent":["import { type ExternalWikiRoot, type ExternalWikiSearchResult, searchExternalWikis } from \"./external-wiki-search.js\";\n\ninterface ExternalWikiCliIo {\n  readonly stdout: { write(chunk: string): unknown };\n  readonly stderr: { write(chunk: string): unknown };\n}\n\nconst USAGE =\n  \"Usage: remnic external-wiki search <query...> [--wiki-id <id>] [--limit <1-20>] [--max-chars-per-hit <100-8000>] [--json]\\n\";\n\nexport async function runExternalWikiCliCommand(\n  roots: readonly ExternalWikiRoot[],\n  args: readonly string[],\n  io: ExternalWikiCliIo\n): Promise<number> {\n  if (args[0] === \"help\" || args[0] === \"--help\" || args[0] === \"-h\") {\n    io.stdout.write(USAGE);\n    return 0;\n  }\n  const searchArgs = args[0] === \"search\" ? args.slice(1) : args;\n\n  let limit: number | undefined;\n  let wikiId: string | undefined;\n  let maxCharsPerHit: number | undefined;\n  let json = false;\n  const queryParts: string[] = [];\n  for (let index = 0; index < searchArgs.length; index += 1) {\n    const argument = searchArgs[index];\n    if (argument === \"--json\") {\n      json = true;\n      continue;\n    }\n    if (argument === \"--limit\" || argument === \"--wiki-id\" || argument === \"--max-chars-per-hit\") {\n      const value = searchArgs[index + 1];\n      if (value === undefined || value.startsWith(\"--\")) {\n        io.stderr.write(`external-wiki: ${argument} requires a value\\n`);\n        return 2;\n      }\n      index += 1;\n      if (argument === \"--wiki-id\") {\n        wikiId = value.trim();\n        if (wikiId.length === 0) {\n          io.stderr.write(\"external-wiki: --wiki-id must not be empty\\n\");\n          return 2;\n        }\n        continue;\n      }\n      const parsed = Number(value);\n      const maximum = argument === \"--limit\" ? 20 : 8_000;\n      const minimum = argument === \"--limit\" ? 1 : 100;\n      if (!Number.isInteger(parsed) || parsed < minimum || parsed > maximum) {\n        io.stderr.write(`external-wiki: ${argument} must be an integer from ${minimum} to ${maximum}\\n`);\n        return 2;\n      }\n      if (argument === \"--limit\") limit = parsed;\n      else maxCharsPerHit = parsed;\n      continue;\n    }\n    if (argument.startsWith(\"-\")) {\n      io.stderr.write(`external-wiki: unknown option '${argument}'\\n${USAGE}`);\n      return 2;\n    }\n    queryParts.push(argument);\n  }\n\n  const query = queryParts.join(\" \").trim();\n  if (query.length === 0) {\n    io.stderr.write(\"external-wiki: provide a search query\\n\");\n    return 1;\n  }\n  const enabled = roots.filter((root) => root.enabled !== false);\n  if (enabled.length === 0) {\n    io.stderr.write(\"external-wiki: no enabled wiki roots configured\\n\");\n    return 1;\n  }\n\n  let result: ExternalWikiSearchResult;\n  try {\n    result = await searchExternalWikis(enabled, { query, limit, wikiId, maxCharsPerHit });\n  } catch (error) {\n    io.stderr.write(`external-wiki: ${error instanceof Error ? error.message : \"search failed\"}\\n`);\n    return 1;\n  }\n  if (json) {\n    io.stdout.write(`${JSON.stringify(result, null, 2)}\\n`);\n    return 0;\n  }\n\n  if (result.degradedWikiIds.length > 0) {\n    io.stderr.write(`Warning: degraded roots: ${result.degradedWikiIds.join(\", \")}\\n`);\n  }\n  if (result.hits.length === 0) {\n    io.stdout.write(\"No results.\\n\");\n    return 0;\n  }\n  for (const hit of result.hits) {\n    io.stdout.write(`[${hit.wikiId}] ${hit.path} (score ${hit.score})\\n${hit.snippet}\\n\\n`);\n  }\n  return 0;\n}\n"],"mappings":";;;;;AAOA,IAAM,QACJ;AAEF,eAAsB,0BACpB,OACA,MACA,IACiB;AACjB,MAAI,KAAK,CAAC,MAAM,UAAU,KAAK,CAAC,MAAM,YAAY,KAAK,CAAC,MAAM,MAAM;AAClE,OAAG,OAAO,MAAM,KAAK;AACrB,WAAO;AAAA,EACT;AACA,QAAM,aAAa,KAAK,CAAC,MAAM,WAAW,KAAK,MAAM,CAAC,IAAI;AAE1D,MAAI;AACJ,MAAI;AACJ,MAAI;AACJ,MAAI,OAAO;AACX,QAAM,aAAuB,CAAC;AAC9B,WAAS,QAAQ,GAAG,QAAQ,WAAW,QAAQ,SAAS,GAAG;AACzD,UAAM,WAAW,WAAW,KAAK;AACjC,QAAI,aAAa,UAAU;AACzB,aAAO;AACP;AAAA,IACF;AACA,QAAI,aAAa,aAAa,aAAa,eAAe,aAAa,uBAAuB;AAC5F,YAAM,QAAQ,WAAW,QAAQ,CAAC;AAClC,UAAI,UAAU,UAAa,MAAM,WAAW,IAAI,GAAG;AACjD,WAAG,OAAO,MAAM,kBAAkB,QAAQ;AAAA,CAAqB;AAC/D,eAAO;AAAA,MACT;AACA,eAAS;AACT,UAAI,aAAa,aAAa;AAC5B,iBAAS,MAAM,KAAK;AACpB,YAAI,OAAO,WAAW,GAAG;AACvB,aAAG,OAAO,MAAM,8CAA8C;AAC9D,iBAAO;AAAA,QACT;AACA;AAAA,MACF;AACA,YAAM,SAAS,OAAO,KAAK;AAC3B,YAAM,UAAU,aAAa,YAAY,KAAK;AAC9C,YAAM,UAAU,aAAa,YAAY,IAAI;AAC7C,UAAI,CAAC,OAAO,UAAU,MAAM,KAAK,SAAS,WAAW,SAAS,SAAS;AACrE,WAAG,OAAO,MAAM,kBAAkB,QAAQ,4BAA4B,OAAO,OAAO,OAAO;AAAA,CAAI;AAC/F,eAAO;AAAA,MACT;AACA,UAAI,aAAa,UAAW,SAAQ;AAAA,UAC/B,kBAAiB;AACtB;AAAA,IACF;AACA,QAAI,SAAS,WAAW,GAAG,GAAG;AAC5B,SAAG,OAAO,MAAM,kCAAkC,QAAQ;AAAA,EAAM,KAAK,EAAE;AACvE,aAAO;AAAA,IACT;AACA,eAAW,KAAK,QAAQ;AAAA,EAC1B;AAEA,QAAM,QAAQ,WAAW,KAAK,GAAG,EAAE,KAAK;AACxC,MAAI,MAAM,WAAW,GAAG;AACtB,OAAG,OAAO,MAAM,yCAAyC;AACzD,WAAO;AAAA,EACT;AACA,QAAM,UAAU,MAAM,OAAO,CAAC,SAAS,KAAK,YAAY,KAAK;AAC7D,MAAI,QAAQ,WAAW,GAAG;AACxB,OAAG,OAAO,MAAM,mDAAmD;AACnE,WAAO;AAAA,EACT;AAEA,MAAI;AACJ,MAAI;AACF,aAAS,MAAM,oBAAoB,SAAS,EAAE,OAAO,OAAO,QAAQ,eAAe,CAAC;AAAA,EACtF,SAAS,OAAO;AACd,OAAG,OAAO,MAAM,kBAAkB,iBAAiB,QAAQ,MAAM,UAAU,eAAe;AAAA,CAAI;AAC9F,WAAO;AAAA,EACT;AACA,MAAI,MAAM;AACR,OAAG,OAAO,MAAM,GAAG,KAAK,UAAU,QAAQ,MAAM,CAAC,CAAC;AAAA,CAAI;AACtD,WAAO;AAAA,EACT;AAEA,MAAI,OAAO,gBAAgB,SAAS,GAAG;AACrC,OAAG,OAAO,MAAM,4BAA4B,OAAO,gBAAgB,KAAK,IAAI,CAAC;AAAA,CAAI;AAAA,EACnF;AACA,MAAI,OAAO,KAAK,WAAW,GAAG;AAC5B,OAAG,OAAO,MAAM,eAAe;AAC/B,WAAO;AAAA,EACT;AACA,aAAW,OAAO,OAAO,MAAM;AAC7B,OAAG,OAAO,MAAM,IAAI,IAAI,MAAM,KAAK,IAAI,IAAI,WAAW,IAAI,KAAK;AAAA,EAAM,IAAI,OAAO;AAAA;AAAA,CAAM;AAAA,EACxF;AACA,SAAO;AACT;","names":[]}

package/dist/{chunk-3Y224NYC.js → chunk-VYISFWVX.js}

@@ -1,6 +1,6 @@
 import {
   reportSearchDegradation
-} from "./chunk-YV32N67O.js";
+} from "./chunk-URS5GSM7.js";
 import {
   log
 } from "./chunk-3WCASNQZ.js";
@@ -121,4 +121,4 @@ var RemoteSearchBackend = class {
 export {
   RemoteSearchBackend
 };
-//# sourceMappingURL=chunk-3Y224NYC.js.map
+//# sourceMappingURL=chunk-VYISFWVX.js.map

package/dist/{chunk-JE7EK33X.js → chunk-W2V7UESE.js}

@@ -1,6 +1,6 @@
 import {
   listNamespaces
-} from "./chunk-E53DSZEN.js";
+} from "./chunk-QR6G5KF4.js";
 import {
   capabilityAllowsNamespace
 } from "./chunk-MZWSOLMT.js";
@@ -282,4 +282,4 @@ export {
   computeServiceCorpusWatermarks,
   computeServiceCorpusCensus
 };
-//# sourceMappingURL=chunk-JE7EK33X.js.map
+//# sourceMappingURL=chunk-W2V7UESE.js.map

package/dist/{chunk-TIHMZFIV.js → chunk-W3IC7QOY.js}

@@ -1,10 +1,10 @@
 import {
   parseXrayFormat
-} from "./chunk-3TBLDMJA.js";
+} from "./chunk-O4KMGRXE.js";
 import {
   RECALL_DISCLOSURE_LEVELS,
   isRecallDisclosure
-} from "./chunk-J7VGGECD.js";
+} from "./chunk-DZPFMQZ7.js";
 
 // src/recall-xray-cli.ts
 function parseXrayDisclosureFlag(value) {
@@ -50,4 +50,4 @@ export {
   parseXrayBudgetFlag,
   parseXrayCliOptions
 };
-//# sourceMappingURL=chunk-TIHMZFIV.js.map
+//# sourceMappingURL=chunk-W3IC7QOY.js.map

package/dist/{chunk-NRV4Y3PM.js → chunk-W4FBGYGK.js}

@@ -216,4 +216,4 @@ export {
   getCausalTrajectoryStoreStatus,
   searchCausalTrajectories
 };
-//# sourceMappingURL=chunk-NRV4Y3PM.js.map
+//# sourceMappingURL=chunk-W4FBGYGK.js.map

package/dist/{chunk-P2BM76KT.js → chunk-WAS4HV46.js}

@@ -6,7 +6,7 @@ function isInterrogativeSourceSentence(sentence) {
   );
   const embeddedQuestionMarkerIndex = normalized.search(/\b(?:whether|if)\b/iu);
   const hasEmbeddedQuestion = embeddedQuestionVerbIndex >= 0 && embeddedQuestionMarkerIndex > embeddedQuestionVerbIndex;
-  return normalized.endsWith("?") || hasEmbeddedQuestion || !normalized.includes(":") && /^(?: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)\b/iu.test(
+  return normalized.endsWith("?") || hasEmbeddedQuestion || !normalized.includes(":") && /^(?: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(
     normalized
   );
 }
@@ -17,16 +17,46 @@ function containsContiguousGroundingTokens(candidateTokens, sourceTokens) {
   );
 }
 function hasExplicitRoleSubjectToken(candidateRole, sourceTokensBySentence) {
-  return candidateRole !== void 0 && sourceTokensBySentence.some((tokens) => tokens.includes(candidateRole));
+  return candidateRole !== void 0 && sourceTokensBySentence.some((tokens) => tokens.some((token) => token.replace(/^[\u0000\u0001]/u, "") === candidateRole));
 }
-function splitGroundingClauses(sentences) {
-  return sentences.flatMap(
-    (sentence) => sentence.split(/,\s+(?=[\p{L}][\p{L}\p{N}'’-]*\s+\S)/gu).flatMap(
+function splitGroundingClauses(sentences, inheritCoordinatedSubjects = false) {
+  return sentences.flatMap((sentence) => {
+    const clauses = sentence.split(/,\s+(?=[\p{L}][\p{L}\p{N}'’-]*\s+\S)/gu).flatMap(
       (commaClause) => commaClause.split(/\s*(?::|[—–])\s+|\s+\/\s+/u).flatMap(
         (delimiterClause) => delimiterClause.split(/\s+(?:and|but|or|while|although|because)\s+/gu).map((clause) => clause.trim()).filter((clause) => clause.length > 0)
       )
-    )
-  );
+    );
+    if (!inheritCoordinatedSubjects || clauses.length < 2) return clauses;
+    const firstLexemes = groundingLexemes(clauses[0]).filter(({ token }) => GROUNDING_STOPWORDS[token] !== true);
+    const firstPredicateIndex = firstLexemes.findIndex(({ isPredicate }) => isPredicate);
+    let subjectLexemes = firstLexemes.slice(0, firstPredicateIndex < 1 ? 1 : firstPredicateIndex).filter(({ token }) => !token.endsWith("ly"));
+    let subject = subjectLexemes.map(({ surface }) => surface).join(" ");
+    let predicate = firstLexemes[firstPredicateIndex < 1 ? 1 : firstPredicateIndex]?.surface;
+    if (subject.length === 0 || predicate === void 0) return clauses;
+    const sourceSpans = [clauses[0]];
+    for (const clause of clauses.slice(1)) {
+      const clauseLexemes = groundingLexemes(clause).filter(({ token }) => GROUNDING_STOPWORDS[token] !== true);
+      const clausePredicateIndex = clauseLexemes.findIndex(({ isPredicate }) => isPredicate);
+      const clauseSubjectLexemes = clausePredicateIndex > 0 ? clauseLexemes.slice(0, clausePredicateIndex).filter(({ token }) => !token.endsWith("ly")) : [];
+      const repeatsSubject = clauseSubjectLexemes.length === subjectLexemes.length && subjectLexemes.every(
+        ({ token }, index) => clauseSubjectLexemes[index]?.token === token
+      );
+      if (repeatsSubject) {
+        sourceSpans.push(clause);
+        continue;
+      }
+      if (clauseSubjectLexemes.length > 0) {
+        subjectLexemes = clauseSubjectLexemes;
+        subject = subjectLexemes.map(({ surface }) => surface).join(" ");
+        predicate = clauseLexemes[clausePredicateIndex]?.surface;
+        sourceSpans.push(clause);
+        continue;
+      }
+      const prefix = clausePredicateIndex === -1 ? `${subject} ${predicate}` : subject;
+      sourceSpans.push(clause, `${prefix} ${clause}`);
+    }
+    return sourceSpans;
+  });
 }
 var GROUNDING_STOPWORDS = {
   a: true,
@@ -103,6 +133,7 @@ var GROUNDING_STOPWORDS = {
   where: true,
   which: true,
   who: true,
+  whom: true,
   will: true,
   with: true,
   would: true,
@@ -187,36 +218,107 @@ var GROUNDING_ENTITY_TYPE_PREFIXES = /* @__PURE__ */ new Set([
   "place",
   "other"
 ]);
-var GROUNDING_COMMON_VERB_FORMS = /* @__PURE__ */ new Set([
-  "contains",
-  "employs",
-  "gives",
-  "has",
-  "hosts",
-  "likes",
-  "makes",
-  "needs",
-  "owns",
-  "prefers",
-  "requires",
-  "runs",
-  "shares",
-  "supports",
-  "takes",
-  "uses",
-  "wants",
-  "works"
-]);
+var GROUNDING_COMMON_VERB_FORMS = {
+  add: true,
+  adds: true,
+  call: true,
+  calls: true,
+  contain: true,
+  contains: true,
+  employ: true,
+  deploy: true,
+  deploys: true,
+  design: true,
+  designs: true,
+  employs: true,
+  fill: true,
+  fills: true,
+  go: true,
+  goes: true,
+  gone: true,
+  went: true,
+  give: true,
+  gives: true,
+  has: true,
+  host: true,
+  hosts: true,
+  like: true,
+  likes: true,
+  manage: true,
+  manages: true,
+  make: true,
+  makes: true,
+  need: true,
+  needs: true,
+  own: true,
+  owns: true,
+  plan: true,
+  plans: true,
+  prefer: true,
+  prefers: true,
+  require: true,
+  requires: true,
+  run: true,
+  runs: true,
+  sleep: true,
+  sleeps: true,
+  stop: true,
+  stops: true,
+  swim: true,
+  swims: true,
+  share: true,
+  shares: true,
+  support: true,
+  supports: true,
+  take: true,
+  takes: true,
+  try: true,
+  tries: true,
+  use: true,
+  uses: true,
+  want: true,
+  wants: true,
+  work: true,
+  works: true
+};
 function groundingLexemes(text) {
-  return text.normalize("NFKC").match(
+  const rawTokens = text.normalize("NFKC").match(
     /[\p{L}\p{N}]+(?:['’][\p{L}\p{N}]+)?(?:\+\+[\p{L}\p{N}]*|#[\p{L}\p{N}]*)?/gu
-  )?.map((rawToken) => {
-    const token = rawToken.replaceAll("\u2019", "'").toLocaleLowerCase();
+  ) ?? [];
+  const tokens = rawTokens.map((rawToken) => rawToken.replaceAll("\u2019", "'").toLocaleLowerCase());
+  let predicateIndex = tokens.findIndex((token, index) => {
+    const previousToken = tokens[index - 1];
+    const followsAuxiliary = previousToken !== void 0 && GROUNDING_AUXILIARY_TOKENS.has(previousToken);
+    let previousMeaningfulIndex = index - 1;
+    while (previousMeaningfulIndex >= 0 && !GROUNDING_COPULAR_FORMS.has(tokens[previousMeaningfulIndex] ?? "") && (GROUNDING_STOPWORDS[tokens[previousMeaningfulIndex] ?? ""] === true || (tokens[previousMeaningfulIndex] ?? "").endsWith("ly"))) {
+      previousMeaningfulIndex -= 1;
+    }
+    const followsCopularAuxiliary = GROUNDING_COPULAR_FORMS.has(
+      tokens[previousMeaningfulIndex] ?? ""
+    );
+    const capitalized = /^\p{Lu}/u.test(rawTokens[index] ?? "");
+    const terminalSInflection = index > 0 && token.endsWith("s") && !token.endsWith("ss") && !GROUNDING_AUXILIARY_TOKENS.has(token);
+    const capitalizedSubjectHasLaterPredicate = index === 0 && tokens.some((laterToken, laterIndex) => laterIndex > 0 && !/^\p{Lu}/u.test(rawTokens[laterIndex] ?? "") && (GROUNDING_AUXILIARY_TOKENS.has(laterToken) || GROUNDING_COMMON_VERB_FORMS[laterToken] === true || laterToken.endsWith("ed") || laterToken.endsWith("ing")));
+    if (capitalized && (index !== 0 || capitalizedSubjectHasLaterPredicate)) return false;
+    if (followsCopularAuxiliary && terminalSInflection) return false;
+    return GROUNDING_COMMON_VERB_FORMS[token] === true || token.endsWith("ed") || token.endsWith("ing") || followsAuxiliary && !followsCopularAuxiliary || terminalSInflection;
+  });
+  if (predicateIndex === -1) {
+    const leadingSubjectLength = rawTokens.findIndex((rawToken) => !/^\p{Lu}/u.test(rawToken));
+    if (leadingSubjectLength > 0) {
+      predicateIndex = tokens.findIndex((token, index) => index >= leadingSubjectLength && (GROUNDING_AUXILIARY_TOKENS.has(token) || GROUNDING_STOPWORDS[token] !== true && !/^\p{Lu}/u.test(rawTokens[index] ?? "")));
+    }
+  }
+  return rawTokens.map((rawToken, index) => {
+    const token = tokens[index];
+    const isPredicate = index === predicateIndex;
     return {
       token,
-      preserveTerminalS: /^\p{Lu}/u.test(rawToken) && !GROUNDING_COMMON_VERB_FORMS.has(token)
+      surface: rawToken,
+      preserveTerminalS: !isPredicate && (/^\p{Lu}/u.test(rawToken) || token.endsWith("s")),
+      isPredicate
     };
-  }) ?? [];
+  });
 }
 function tokenSequence(text) {
   return groundingLexemes(text).map(({ token }) => token);
@@ -250,23 +352,39 @@ function isNegatedAt(tokens, index) {
 }
 var GROUNDING_MIN_SHARED_TOKENS = 2;
 var GROUNDING_MIN_COVERAGE = 0.5;
-function stemToken(token, preserveTerminalS = false) {
+var STRICT_GROUNDING_TOKEN_PREFIX = "\0";
+var INFLECTED_GROUNDING_TOKEN_PREFIX = "
";
+function stemToken(token, preserveTerminalS = false, markExact = false) {
   if (token.endsWith("'s")) return token.slice(0, -2);
-  if (preserveTerminalS) return token;
+  if (preserveTerminalS) {
+    if (!markExact) return token;
+    return `${STRICT_GROUNDING_TOKEN_PREFIX}${token}`;
+  }
   if (token.length > 5 && token.endsWith("ing")) {
     const stem = token.slice(0, -3);
-    return /(.)\1$/u.test(stem) ? stem.slice(0, -1) : stem;
+    const inflectionDoubled = /(.)\1$/u.test(stem) && stem.length > 3 && !/[lsz]$/u.test(stem);
+    const normalized = inflectionDoubled ? stem.slice(0, -1) : stem;
+    return markExact ? `${INFLECTED_GROUNDING_TOKEN_PREFIX}${normalized}` : normalized;
+  }
+  if (token.length > 4 && token.endsWith("ied")) {
+    const normalized = `${token.slice(0, -3)}y`;
+    return markExact ? `${INFLECTED_GROUNDING_TOKEN_PREFIX}${normalized}` : normalized;
+  }
+  if (token.length > 4 && token.endsWith("ed")) {
+    const stem = token.slice(0, -2);
+    const inflectionDoubled = /(.)\1$/u.test(stem) && stem.length > 3 && !/[lsz]$/u.test(stem);
+    const normalized = inflectionDoubled ? stem.slice(0, -1) : stem;
+    return markExact ? `${INFLECTED_GROUNDING_TOKEN_PREFIX}${normalized}` : normalized;
   }
-  if (token.length > 4 && token.endsWith("ed")) return token.slice(0, -2);
-  if (!preserveTerminalS && token.length > 3 && token.endsWith("s") && !token.endsWith("ss") && GROUNDING_COMMON_VERB_FORMS.has(token)) {
-    return token.slice(0, -1);
+  if (token.length > 3 && token.endsWith("s") && !token.endsWith("ss")) {
+    return token.endsWith("ies") ? `${token.slice(0, -3)}y` : token.slice(0, -1);
   }
   return token;
 }
 function tokenize(text) {
   const tokens = /* @__PURE__ */ new Set();
   for (const { token, preserveTerminalS } of groundingLexemes(text)) {
-    if (GROUNDING_STOPWORDS[token] !== true) tokens.add(stemToken(token, preserveTerminalS));
+    if (GROUNDING_STOPWORDS[token] !== true) tokens.add(stemToken(token, preserveTerminalS, true));
   }
   return tokens;
 }
@@ -297,7 +415,7 @@ function groundingTokenSequence(text) {
   while (lexemes.length > 0 && GROUNDING_AUXILIARY_TOKENS.has(lexemes[0].token)) {
     lexemes = lexemes.slice(1);
   }
-  return lexemes.filter(({ token }) => GROUNDING_STOPWORDS[token] !== true).map(({ token, preserveTerminalS }) => stemToken(token, preserveTerminalS));
+  return lexemes.filter(({ token }) => GROUNDING_STOPWORDS[token] !== true).map(({ token, preserveTerminalS }) => stemToken(token, preserveTerminalS, true));
 }
 function normalizedGroundingAlignmentTokenSequence(text) {
   const normalized = normalizedGroundingTokenSequence(text);
@@ -305,13 +423,26 @@ function normalizedGroundingAlignmentTokenSequence(text) {
   if (firstLexeme === void 0 || !GROUNDING_SUBJECT_PRONOUNS.has(firstLexeme.token)) {
     return normalized;
   }
-  return [stemToken(firstLexeme.token, firstLexeme.preserveTerminalS), ...normalized];
+  return [stemToken(firstLexeme.token, firstLexeme.preserveTerminalS, true), ...normalized];
 }
 function normalizedGroundingTokenSequence(text) {
   return groundingTokenSequence(text).map((token) => token.replace(/'$/u, ""));
 }
 function areGroundingTokensCompatible(left, right) {
-  return left === right || `${left}e` === right || left === `${right}e`;
+  const leftPrefix = left[0];
+  const rightPrefix = right[0];
+  const leftMarked = leftPrefix === STRICT_GROUNDING_TOKEN_PREFIX || leftPrefix === INFLECTED_GROUNDING_TOKEN_PREFIX;
+  const rightMarked = rightPrefix === STRICT_GROUNDING_TOKEN_PREFIX || rightPrefix === INFLECTED_GROUNDING_TOKEN_PREFIX;
+  const leftToken = leftMarked ? left.slice(1) : left;
+  const rightToken = rightMarked ? right.slice(1) : right;
+  if (leftToken === rightToken) {
+    const strictToInflected = leftPrefix === STRICT_GROUNDING_TOKEN_PREFIX && rightPrefix === INFLECTED_GROUNDING_TOKEN_PREFIX || rightPrefix === STRICT_GROUNDING_TOKEN_PREFIX && leftPrefix === INFLECTED_GROUNDING_TOKEN_PREFIX;
+    return !strictToInflected;
+  }
+  if (leftPrefix === STRICT_GROUNDING_TOKEN_PREFIX || rightPrefix === STRICT_GROUNDING_TOKEN_PREFIX) {
+    return false;
+  }
+  return `${leftToken}e` === rightToken || leftToken === `${rightToken}e`;
 }
 var GROUNDING_DENIAL_REPORTING_VERBS = /* @__PURE__ */ new Set([
   "deny",
@@ -525,4 +656,4 @@ export {
   areGroundingTokensCompatible,
   hasContradictoryPolarity
 };
-//# sourceMappingURL=chunk-P2BM76KT.js.map
+//# sourceMappingURL=chunk-WAS4HV46.js.map

package/dist/chunk-WAS4HV46.js.map

@@ -0,0 +1 @@
+{"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"]}

package/dist/{chunk-57QKLRBV.js → chunk-WB7JSQCP.js}

@@ -23,6 +23,7 @@ var MCP_READ_ONLY_TOOL_SUFFIXES = {
   identity_anchor_get: true,
   memory_identity: true,
   memory_search: true,
+  external_wiki_search: true,
   memory_profile: true,
   memory_entities_list: true,
   memory_questions: true,
@@ -53,4 +54,4 @@ var MCP_READ_ONLY_TOOL_SUFFIXES = {
 export {
   MCP_READ_ONLY_TOOL_SUFFIXES
 };
-//# sourceMappingURL=chunk-57QKLRBV.js.map
+//# sourceMappingURL=chunk-WB7JSQCP.js.map

package/dist/chunk-WB7JSQCP.js.map

@@ -0,0 +1 @@
+{"version":3,"sources":["../src/mcp-read-only-tools.ts"],"sourcesContent":["/**\n * Conservative allowlist of canonical MCP tool suffixes that are\n * unambiguously read-only. Tools in this set are tagged with\n * `annotations: { readOnlyHint: true }` so ChatGPT (and other MCP\n * clients that honor the hint) can skip per-call confirmation.\n *\n * The list is suffix-based so it covers both the `remnic.*` and\n * `engram.*` naming forms. Anything not on it stays unannotated:\n * uncertainty is resolved as \"might mutate\".\n *\n * Excluded by construction: anything that writes, runs a pipeline,\n * flushes, applies, records, imports, or destructively deletes.\n */\nexport const MCP_READ_ONLY_TOOL_SUFFIXES: Readonly<Record<string, true>> = {\n  recall: true,\n  recall_explain: true,\n  recall_tier_explain: true,\n  recall_xray: true,\n  briefing: true,\n  wearables_status: true,\n  transcript_day: true,\n  transcript_search: true,\n  transcript_memories: true,\n  meetings_list: true,\n  meetings_get: true,\n  action_confidence: true,\n  capsule_list: true,\n  procedural_stats: true,\n  memory_get: true,\n  memory_timeline: true,\n  entity_get: true,\n  review_queue_list: true,\n  lcm_search: true,\n  continuity_incident_list: true,\n  identity_anchor_get: true,\n  memory_identity: true,\n  memory_search: true,\n  external_wiki_search: true,\n  memory_profile: true,\n  memory_entities_list: true,\n  memory_questions: true,\n  memory_last_recall: true,\n  memory_intent_debug: true,\n  memory_qmd_debug: true,\n  memory_graph_explain: true,\n  graph_snapshot: true,\n  review_list: true,\n  profiling_report: true,\n  peer_list: true,\n  peer_get: true,\n  peer_profile_get: true,\n  console_state: true,\n  dreams_status: true,\n  codegraph_list_projects: true,\n  codegraph_index_status: true,\n  codegraph_search_graph: true,\n  codegraph_trace_path: true,\n  codegraph_detect_changes: true,\n  codegraph_query_graph: true,\n  codegraph_get_schema: true,\n  codegraph_get_snippet: true,\n  codegraph_get_architecture: true,\n  codegraph_search_code: true,\n};\n"],"mappings":";AAaO,IAAM,8BAA8D;AAAA,EACzE,QAAQ;AAAA,EACR,gBAAgB;AAAA,EAChB,qBAAqB;AAAA,EACrB,aAAa;AAAA,EACb,UAAU;AAAA,EACV,kBAAkB;AAAA,EAClB,gBAAgB;AAAA,EAChB,mBAAmB;AAAA,EACnB,qBAAqB;AAAA,EACrB,eAAe;AAAA,EACf,cAAc;AAAA,EACd,mBAAmB;AAAA,EACnB,cAAc;AAAA,EACd,kBAAkB;AAAA,EAClB,YAAY;AAAA,EACZ,iBAAiB;AAAA,EACjB,YAAY;AAAA,EACZ,mBAAmB;AAAA,EACnB,YAAY;AAAA,EACZ,0BAA0B;AAAA,EAC1B,qBAAqB;AAAA,EACrB,iBAAiB;AAAA,EACjB,eAAe;AAAA,EACf,sBAAsB;AAAA,EACtB,gBAAgB;AAAA,EAChB,sBAAsB;AAAA,EACtB,kBAAkB;AAAA,EAClB,oBAAoB;AAAA,EACpB,qBAAqB;AAAA,EACrB,kBAAkB;AAAA,EAClB,sBAAsB;AAAA,EACtB,gBAAgB;AAAA,EAChB,aAAa;AAAA,EACb,kBAAkB;AAAA,EAClB,WAAW;AAAA,EACX,UAAU;AAAA,EACV,kBAAkB;AAAA,EAClB,eAAe;AAAA,EACf,eAAe;AAAA,EACf,yBAAyB;AAAA,EACzB,wBAAwB;AAAA,EACxB,wBAAwB;AAAA,EACxB,sBAAsB;AAAA,EACtB,0BAA0B;AAAA,EAC1B,uBAAuB;AAAA,EACvB,sBAAsB;AAAA,EACtB,uBAAuB;AAAA,EACvB,4BAA4B;AAAA,EAC5B,uBAAuB;AACzB;","names":[]}