@remnic/core 1.1.12 → 1.1.13

package/dist/chunk-XJKFSSDW.js.map

@@ -1 +0,0 @@
-{"version":3,"sources":["../src/memory-projection-store.ts","../src/runtime/better-sqlite.ts"],"sourcesContent":["import path from \"node:path\";\nimport fs from \"node:fs\";\nimport type {\n  MemoryGovernanceAppliedAction,\n  MemoryGovernanceMetrics,\n  MemoryGovernanceReviewQueueEntry,\n  MemoryGovernanceSummary,\n} from \"./maintenance/memory-governance.js\";\nimport type {\n  MemoryCategory,\n  MemoryLifecycleEvent,\n  MemoryProjectionCurrentState,\n  MemoryStatus,\n} from \"./types.js\";\nimport {\n  openBetterSqlite3,\n  type BetterSqlite3Database,\n} from \"./runtime/better-sqlite.js\";\n\nexport const MEMORY_PROJECTION_SCHEMA_VERSION = 2;\n\nexport interface ProjectedMemoryBrowseOptions {\n  query?: string;\n  status?: string;\n  category?: string;\n  sort?: \"updated_desc\" | \"updated_asc\" | \"created_desc\" | \"created_asc\";\n  limit: number;\n  offset: number;\n}\n\nexport interface ProjectedMemoryBrowseRow {\n  id: string;\n  path: string;\n  category: MemoryCategory;\n  status: MemoryStatus;\n  created?: string;\n  updated?: string;\n  tags: string[];\n  entityRef?: string;\n  preview: string;\n}\n\nexport interface ProjectedMemoryBrowsePage {\n  total: number;\n  memories: ProjectedMemoryBrowseRow[];\n}\n\nexport interface ProjectedEntityMentionRow {\n  memoryId: string;\n  entityRef: string;\n  mentionSource: string;\n  created: string;\n  updated: string;\n}\n\nexport interface ProjectedNativeKnowledgeChunkRow {\n  chunkId: string;\n  sourcePath: string;\n  title: string;\n  sourceKind: string;\n  startLine: number;\n  endLine: number;\n  derivedDate?: string;\n  sessionKey?: string;\n  workflowKey?: string;\n  author?: string;\n  agent?: string;\n  namespace?: string;\n  privacyClass?: string;\n  sourceHash?: string;\n  preview: string;\n}\n\nexport interface MemoryProjectionGovernanceReviewQueueRow {\n  runId: string;\n  entryId: string;\n  memoryId: string;\n  path: string;\n  reasonCode: MemoryGovernanceReviewQueueEntry[\"reasonCode\"];\n  severity: MemoryGovernanceReviewQueueEntry[\"severity\"];\n  suggestedAction: MemoryGovernanceReviewQueueEntry[\"suggestedAction\"];\n  suggestedStatus?: MemoryGovernanceReviewQueueEntry[\"suggestedStatus\"];\n  relatedMemoryIds: string[];\n}\n\nexport interface MemoryProjectionGovernanceAppliedActionRow {\n  runId: string;\n  rowKey: string;\n  action: MemoryGovernanceAppliedAction[\"action\"];\n  memoryId: string;\n  reasonCode: MemoryGovernanceAppliedAction[\"reasonCode\"];\n  beforeStatus: MemoryGovernanceAppliedAction[\"beforeStatus\"];\n  afterStatus?: MemoryGovernanceAppliedAction[\"afterStatus\"];\n  originalPath: string;\n  currentPath: string;\n}\n\nexport interface ProjectedReviewQueueSnapshot {\n  found: boolean;\n  runId?: string;\n  summary?: MemoryGovernanceSummary;\n  metrics?: MemoryGovernanceMetrics;\n  reviewQueue?: MemoryGovernanceReviewQueueEntry[];\n  appliedActions?: MemoryGovernanceAppliedAction[];\n  report?: string;\n}\n\nexport function getMemoryProjectionPath(memoryDir: string): string {\n  return path.join(memoryDir, \"state\", \"memory-projection.sqlite\");\n}\n\nfunction listTableColumns(db: BetterSqlite3Database, tableName: string): Set<string> {\n  try {\n    const rows = db.prepare(`PRAGMA table_info(${tableName})`).all() as Array<{ name?: unknown }>;\n    return new Set(rows.map((row) => row.name).filter((name): name is string => typeof name === \"string\"));\n  } catch {\n    return new Set<string>();\n  }\n}\n\nfunction migrateMemoryCurrentTable(db: BetterSqlite3Database): void {\n  const columns = listTableColumns(db, \"memory_current\");\n  if (columns.size === 0) return;\n\n  if (!columns.has(\"tags_json\")) {\n    db.exec(`ALTER TABLE memory_current ADD COLUMN tags_json TEXT NOT NULL DEFAULT '[]'`);\n  }\n  if (!columns.has(\"preview_text\")) {\n    db.exec(`ALTER TABLE memory_current ADD COLUMN preview_text TEXT NOT NULL DEFAULT ''`);\n  }\n}\n\nfunction memoryCurrentRequiresMigration(db: BetterSqlite3Database): boolean {\n  const columns = listTableColumns(db, \"memory_current\");\n  return columns.size > 0 && (!columns.has(\"tags_json\") || !columns.has(\"preview_text\"));\n}\n\nfunction migrateProjectionSchemaIfNeeded(memoryDir: string): void {\n  const dbPath = getMemoryProjectionPath(memoryDir);\n  try {\n    const db = openBetterSqlite3(dbPath, { fileMustExist: true });\n    try {\n      if (!memoryCurrentRequiresMigration(db)) return;\n      initializeMemoryProjectionDb(db);\n    } finally {\n      db.close();\n    }\n  } catch {\n    // Fail open on migration attempts so readonly consumers can still use legacy rows.\n  }\n}\n\nexport function memoryCurrentSelectExpressions(db: BetterSqlite3Database): {\n  tagsJson: string;\n  previewText: string;\n} {\n  const columns = listTableColumns(db, \"memory_current\");\n  return {\n    tagsJson: columns.has(\"tags_json\") ? \"tags_json\" : `'[]' AS tags_json`,\n    previewText: columns.has(\"preview_text\") ? \"preview_text\" : `'' AS preview_text`,\n  };\n}\n\nexport function initializeMemoryProjectionDb(db: BetterSqlite3Database): void {\n  db.exec(`\n    CREATE TABLE IF NOT EXISTS meta (\n      key TEXT PRIMARY KEY,\n      value TEXT NOT NULL\n    );\n\n    CREATE TABLE IF NOT EXISTS memory_current (\n      memory_id TEXT PRIMARY KEY,\n      category TEXT NOT NULL,\n      status TEXT NOT NULL,\n      lifecycle_state TEXT,\n      path_rel TEXT NOT NULL,\n      created_at TEXT NOT NULL,\n      updated_at TEXT NOT NULL,\n      archived_at TEXT,\n      superseded_at TEXT,\n      entity_ref TEXT,\n      source TEXT NOT NULL,\n      confidence REAL NOT NULL,\n      confidence_tier TEXT NOT NULL,\n      memory_kind TEXT,\n      access_count INTEGER,\n      last_accessed TEXT,\n      tags_json TEXT NOT NULL DEFAULT '[]',\n      preview_text TEXT NOT NULL DEFAULT ''\n    );\n\n    CREATE INDEX IF NOT EXISTS idx_memory_current_status\n      ON memory_current(status);\n\n    CREATE INDEX IF NOT EXISTS idx_memory_current_category\n      ON memory_current(category);\n\n    CREATE INDEX IF NOT EXISTS idx_memory_current_updated\n      ON memory_current(updated_at DESC);\n\n    CREATE TABLE IF NOT EXISTS memory_timeline (\n      event_id TEXT PRIMARY KEY,\n      memory_id TEXT NOT NULL,\n      event_type TEXT NOT NULL,\n      timestamp TEXT NOT NULL,\n      event_order INTEGER NOT NULL,\n      actor TEXT NOT NULL,\n      reason_code TEXT,\n      rule_version TEXT NOT NULL,\n      related_memory_ids_json TEXT,\n      before_json TEXT,\n      after_json TEXT,\n      correlation_id TEXT\n    );\n\n    CREATE INDEX IF NOT EXISTS idx_memory_timeline_memory_ts\n      ON memory_timeline(memory_id, timestamp, event_order);\n\n    CREATE TABLE IF NOT EXISTS memory_entity_mentions (\n      memory_id TEXT NOT NULL,\n      entity_ref TEXT NOT NULL,\n      mention_source TEXT NOT NULL,\n      created_at TEXT NOT NULL,\n      updated_at TEXT NOT NULL,\n      PRIMARY KEY (memory_id, entity_ref, mention_source)\n    );\n\n    CREATE INDEX IF NOT EXISTS idx_memory_entity_mentions_entity\n      ON memory_entity_mentions(entity_ref, updated_at DESC);\n\n    CREATE TABLE IF NOT EXISTS native_knowledge_chunks (\n      chunk_id TEXT PRIMARY KEY,\n      source_path TEXT NOT NULL,\n      title TEXT NOT NULL,\n      source_kind TEXT NOT NULL,\n      start_line INTEGER NOT NULL,\n      end_line INTEGER NOT NULL,\n      derived_date TEXT,\n      session_key TEXT,\n      workflow_key TEXT,\n      author TEXT,\n      agent TEXT,\n      namespace TEXT,\n      privacy_class TEXT,\n      source_hash TEXT,\n      preview_text TEXT NOT NULL\n    );\n\n    CREATE INDEX IF NOT EXISTS idx_native_knowledge_source_kind\n      ON native_knowledge_chunks(source_kind);\n\n    CREATE INDEX IF NOT EXISTS idx_native_knowledge_namespace\n      ON native_knowledge_chunks(namespace);\n\n    CREATE TABLE IF NOT EXISTS memory_review_runs (\n      run_id TEXT PRIMARY KEY,\n      created_at TEXT NOT NULL,\n      mode TEXT NOT NULL,\n      summary_json TEXT NOT NULL,\n      metrics_json TEXT NOT NULL,\n      applied_actions_json TEXT NOT NULL,\n      report_markdown TEXT NOT NULL\n    );\n\n    CREATE INDEX IF NOT EXISTS idx_memory_review_runs_created\n      ON memory_review_runs(created_at DESC);\n\n    CREATE TABLE IF NOT EXISTS memory_review_queue (\n      entry_id TEXT PRIMARY KEY,\n      run_id TEXT NOT NULL,\n      memory_id TEXT NOT NULL,\n      path TEXT NOT NULL,\n      reason_code TEXT NOT NULL,\n      severity TEXT NOT NULL,\n      suggested_action TEXT NOT NULL,\n      suggested_status TEXT,\n      related_memory_ids_json TEXT NOT NULL\n    );\n\n    CREATE INDEX IF NOT EXISTS idx_memory_review_queue_run\n      ON memory_review_queue(run_id, reason_code, memory_id);\n\n    CREATE TABLE IF NOT EXISTS memory_review_actions (\n      row_key TEXT PRIMARY KEY,\n      run_id TEXT NOT NULL,\n      action TEXT NOT NULL,\n      memory_id TEXT NOT NULL,\n      reason_code TEXT NOT NULL,\n      before_status TEXT NOT NULL,\n      after_status TEXT,\n      original_path TEXT NOT NULL,\n      current_path TEXT NOT NULL\n    );\n\n    CREATE INDEX IF NOT EXISTS idx_memory_review_actions_run\n      ON memory_review_actions(run_id, memory_id);\n  `);\n\n  migrateMemoryCurrentTable(db);\n  db.prepare(\"INSERT OR REPLACE INTO meta(key, value) VALUES (?, ?)\")\n    .run(\"schemaVersion\", String(MEMORY_PROJECTION_SCHEMA_VERSION));\n}\n\nfunction openProjectionReadonly(memoryDir: string): BetterSqlite3Database | null {\n  const dbPath = getMemoryProjectionPath(memoryDir);\n  try {\n    return openBetterSqlite3(dbPath, { readonly: true, fileMustExist: true });\n  } catch {\n    return null;\n  }\n}\n\nfunction withProjectionReadonly<T>(\n  memoryDir: string,\n  reader: (db: BetterSqlite3Database) => T,\n): T | null {\n  const db = openProjectionReadonly(memoryDir);\n  if (!db) return null;\n\n  let needsMigration = false;\n  try {\n    needsMigration = memoryCurrentRequiresMigration(db);\n    return reader(db);\n  } catch {\n    return null;\n  } finally {\n    db.close();\n    if (needsMigration) {\n      migrateProjectionSchemaIfNeeded(memoryDir);\n    }\n  }\n}\n\nfunction parseStringArray(value: unknown): string[] {\n  if (typeof value !== \"string\" || value.length === 0) return [];\n  try {\n    const parsed = JSON.parse(value);\n    return Array.isArray(parsed) ? parsed.filter((entry): entry is string => typeof entry === \"string\") : [];\n  } catch {\n    return [];\n  }\n}\n\nfunction parseJsonObject<T>(value: unknown): T | undefined {\n  if (typeof value !== \"string\" || value.length === 0) return undefined;\n  try {\n    return JSON.parse(value) as T;\n  } catch {\n    return undefined;\n  }\n}\n\nexport function parseCurrentRow(\n  memoryDir: string,\n  row: Record<string, unknown> | undefined,\n): MemoryProjectionCurrentState | null {\n  if (!row) return null;\n  if (\n    typeof row.memory_id !== \"string\" ||\n    typeof row.category !== \"string\" ||\n    typeof row.status !== \"string\" ||\n    typeof row.path_rel !== \"string\" ||\n    typeof row.created_at !== \"string\" ||\n    typeof row.updated_at !== \"string\" ||\n    typeof row.source !== \"string\" ||\n    typeof row.confidence !== \"number\" ||\n    typeof row.confidence_tier !== \"string\"\n  ) {\n    return null;\n  }\n\n  return {\n    memoryId: row.memory_id,\n    category: row.category as MemoryProjectionCurrentState[\"category\"],\n    status: row.status as MemoryStatus,\n    lifecycleState:\n      typeof row.lifecycle_state === \"string\"\n        ? (row.lifecycle_state as MemoryProjectionCurrentState[\"lifecycleState\"])\n        : undefined,\n    path: path.join(memoryDir, row.path_rel),\n    pathRel: row.path_rel,\n    created: row.created_at,\n    updated: row.updated_at,\n    archivedAt: typeof row.archived_at === \"string\" ? row.archived_at : undefined,\n    supersededAt: typeof row.superseded_at === \"string\" ? row.superseded_at : undefined,\n    entityRef: typeof row.entity_ref === \"string\" ? row.entity_ref : undefined,\n    source: row.source,\n    confidence: row.confidence,\n    confidenceTier: row.confidence_tier as MemoryProjectionCurrentState[\"confidenceTier\"],\n    memoryKind:\n      typeof row.memory_kind === \"string\"\n        ? (row.memory_kind as MemoryProjectionCurrentState[\"memoryKind\"])\n        : undefined,\n    accessCount: typeof row.access_count === \"number\" ? row.access_count : undefined,\n    lastAccessed: typeof row.last_accessed === \"string\" ? row.last_accessed : undefined,\n    tags: parseStringArray(row.tags_json),\n    preview: typeof row.preview_text === \"string\" ? row.preview_text : \"\",\n  };\n}\n\nexport function parseTimelineRows(rows: Array<Record<string, unknown>>): MemoryLifecycleEvent[] {\n  const out: MemoryLifecycleEvent[] = [];\n  for (const row of rows) {\n    if (\n      typeof row.event_id !== \"string\" ||\n      typeof row.memory_id !== \"string\" ||\n      typeof row.event_type !== \"string\" ||\n      typeof row.timestamp !== \"string\" ||\n      typeof row.actor !== \"string\" ||\n      typeof row.rule_version !== \"string\"\n    ) {\n      continue;\n    }\n\n    out.push({\n      eventId: row.event_id,\n      memoryId: row.memory_id,\n      eventType: row.event_type as MemoryLifecycleEvent[\"eventType\"],\n      timestamp: row.timestamp,\n      actor: row.actor,\n      reasonCode: typeof row.reason_code === \"string\" ? row.reason_code : undefined,\n      ruleVersion: row.rule_version,\n      relatedMemoryIds: parseStringArray(row.related_memory_ids_json),\n      before: parseJsonObject<MemoryLifecycleEvent[\"before\"]>(row.before_json),\n      after: parseJsonObject<MemoryLifecycleEvent[\"after\"]>(row.after_json),\n      correlationId: typeof row.correlation_id === \"string\" ? row.correlation_id : undefined,\n    });\n  }\n\n  return out;\n}\n\nexport function readProjectedMemoryState(\n  memoryDir: string,\n  memoryId: string,\n): MemoryProjectionCurrentState | null {\n  return withProjectionReadonly(memoryDir, (db) => {\n    const currentSelect = memoryCurrentSelectExpressions(db);\n    const row = db\n      .prepare(\n        `\n          SELECT\n            memory_id,\n            category,\n            status,\n            lifecycle_state,\n            path_rel,\n            created_at,\n            updated_at,\n            archived_at,\n            superseded_at,\n            entity_ref,\n            source,\n            confidence,\n            confidence_tier,\n            memory_kind,\n            access_count,\n            last_accessed,\n            ${currentSelect.tagsJson},\n            ${currentSelect.previewText}\n          FROM memory_current\n          WHERE memory_id = ?\n        `,\n      )\n      .get(memoryId) as Record<string, unknown> | undefined;\n    return parseCurrentRow(memoryDir, row);\n  });\n}\n\nexport function readProjectedMemoryTimeline(\n  memoryDir: string,\n  memoryId: string,\n  limit: number,\n): MemoryLifecycleEvent[] | null {\n  const db = openProjectionReadonly(memoryDir);\n  if (!db) return null;\n\n  try {\n    const rows = db\n      .prepare(\n        `\n          SELECT * FROM (\n            SELECT\n              event_id,\n              memory_id,\n              event_type,\n              timestamp,\n              event_order,\n              actor,\n              reason_code,\n              rule_version,\n              related_memory_ids_json,\n              before_json,\n              after_json,\n              correlation_id\n            FROM memory_timeline\n            WHERE memory_id = ?\n            ORDER BY timestamp DESC, event_order DESC\n            LIMIT ?\n          )\n          ORDER BY timestamp ASC, event_order ASC\n        `,\n      )\n      .all(memoryId, limit) as Array<Record<string, unknown>>;\n    if (rows.length === 0) return null;\n    return parseTimelineRows(rows);\n  } catch {\n    return null;\n  } finally {\n    db.close();\n  }\n}\n\nexport function readProjectedMemoryBrowse(\n  memoryDir: string,\n  options: ProjectedMemoryBrowseOptions,\n): ProjectedMemoryBrowsePage | null {\n  return withProjectionReadonly(memoryDir, (db) => {\n    const normalizedQuery = options.query?.trim().toLowerCase() ?? \"\";\n\n    const currentSelect = memoryCurrentSelectExpressions(db);\n    const whereClauses: string[] = [];\n    const params: unknown[] = [];\n\n    if (options.status) {\n      whereClauses.push(\"status = ?\");\n      params.push(options.status);\n    }\n    if (options.category) {\n      whereClauses.push(\"category = ?\");\n      params.push(options.category);\n    }\n    const sort = options.sort ?? \"updated_desc\";\n    const orderBySql = (() => {\n      switch (sort) {\n        case \"updated_asc\":\n          return \"updated_at ASC, created_at ASC, memory_id ASC\";\n        case \"created_desc\":\n          return \"created_at DESC, updated_at DESC, memory_id ASC\";\n        case \"created_asc\":\n          return \"created_at ASC, updated_at ASC, memory_id ASC\";\n        case \"updated_desc\":\n        default:\n          return \"updated_at DESC, created_at DESC, memory_id ASC\";\n      }\n    })();\n    const whereSql = whereClauses.length > 0 ? `WHERE ${whereClauses.join(\" AND \")}` : \"\";\n\n    if (normalizedQuery) {\n      // Query-based browse: fetch all matching rows, filter by full file content, then paginate in JS\n      const allRows = db\n        .prepare(`\n          SELECT\n            memory_id,\n            path_rel,\n            category,\n            status,\n            created_at,\n            updated_at,\n            entity_ref,\n            ${currentSelect.tagsJson},\n            ${currentSelect.previewText}\n          FROM memory_current\n          ${whereSql}\n          ORDER BY ${orderBySql}\n        `)\n        .all(...params) as Array<Record<string, unknown>>;\n\n      const filtered = allRows.filter((row) => {\n        if (typeof row.memory_id !== \"string\" || typeof row.path_rel !== \"string\") return false;\n        // Check preview, category, entity_ref, tags first (fast)\n        const preview = typeof row.preview_text === \"string\" ? row.preview_text.toLowerCase() : \"\";\n        const category = typeof row.category === \"string\" ? row.category.toLowerCase() : \"\";\n        const entityRef = typeof row.entity_ref === \"string\" ? row.entity_ref.toLowerCase() : \"\";\n        const tags = typeof row.tags_json === \"string\" ? row.tags_json.toLowerCase() : \"\";\n        if (preview.includes(normalizedQuery) || category.includes(normalizedQuery) ||\n            entityRef.includes(normalizedQuery) || tags.includes(normalizedQuery)) {\n          return true;\n        }\n        // Fall back to reading full file content from disk\n        try {\n          const filePath = path.join(memoryDir, row.path_rel as string);\n          const content = fs.readFileSync(filePath, \"utf-8\").toLowerCase();\n          return content.includes(normalizedQuery);\n        } catch {\n          return false;\n        }\n      });\n\n      const pageRows = filtered.slice(options.offset, options.offset + options.limit);\n      return {\n        total: filtered.length,\n        memories: pageRows\n          .filter(\n            (row) =>\n              typeof row.memory_id === \"string\" &&\n              typeof row.path_rel === \"string\" &&\n              typeof row.category === \"string\" &&\n              typeof row.status === \"string\",\n          )\n          .map((row) => ({\n            id: row.memory_id as string,\n            path: path.join(memoryDir, row.path_rel as string),\n            category: row.category as MemoryCategory,\n            status: row.status as MemoryStatus,\n            created: typeof row.created_at === \"string\" ? row.created_at : undefined,\n            updated: typeof row.updated_at === \"string\" ? row.updated_at : undefined,\n            tags: parseStringArray(row.tags_json),\n            entityRef: typeof row.entity_ref === \"string\" ? row.entity_ref : undefined,\n            preview: typeof row.preview_text === \"string\" ? row.preview_text : \"\",\n          })),\n      };\n    }\n\n    // No query: use SQL pagination directly\n    const totalRow = db\n      .prepare(`SELECT COUNT(*) AS total FROM memory_current ${whereSql}`)\n      .get(...params) as { total?: number } | undefined;\n    const rows = db\n      .prepare(`\n        SELECT\n          memory_id,\n          path_rel,\n          category,\n          status,\n          created_at,\n          updated_at,\n          entity_ref,\n          ${currentSelect.tagsJson},\n          ${currentSelect.previewText}\n        FROM memory_current\n        ${whereSql}\n        ORDER BY ${orderBySql}\n        LIMIT ? OFFSET ?\n      `)\n      .all(...params, options.limit, options.offset) as Array<Record<string, unknown>>;\n\n    return {\n      total: typeof totalRow?.total === \"number\" ? totalRow.total : 0,\n      memories: rows\n        .filter(\n          (row) =>\n            typeof row.memory_id === \"string\" &&\n            typeof row.path_rel === \"string\" &&\n            typeof row.category === \"string\" &&\n            typeof row.status === \"string\",\n        )\n        .map((row) => ({\n          id: row.memory_id as string,\n          path: path.join(memoryDir, row.path_rel as string),\n          category: row.category as MemoryCategory,\n          status: row.status as MemoryStatus,\n          created: typeof row.created_at === \"string\" ? row.created_at : undefined,\n          updated: typeof row.updated_at === \"string\" ? row.updated_at : undefined,\n          tags: parseStringArray(row.tags_json),\n          entityRef: typeof row.entity_ref === \"string\" ? row.entity_ref : undefined,\n          preview: typeof row.preview_text === \"string\" ? row.preview_text : \"\",\n        })),\n    };\n  });\n}\n\nexport function readProjectedEntityMentions(\n  memoryDir: string,\n  memoryIds?: Set<string>,\n): ProjectedEntityMentionRow[] | null {\n  const db = openProjectionReadonly(memoryDir);\n  if (!db) return null;\n\n  try {\n    const rows = db\n      .prepare(`\n        SELECT\n          memory_id,\n          entity_ref,\n          mention_source,\n          created_at,\n          updated_at\n        FROM memory_entity_mentions\n        ORDER BY entity_ref ASC, updated_at DESC, memory_id ASC\n      `)\n      .all() as Array<Record<string, unknown>>;\n\n    return rows\n      .filter(\n        (row) =>\n          typeof row.memory_id === \"string\" &&\n          typeof row.entity_ref === \"string\" &&\n          typeof row.mention_source === \"string\" &&\n          typeof row.created_at === \"string\" &&\n          typeof row.updated_at === \"string\" &&\n          (!memoryIds || memoryIds.has(row.memory_id)),\n      )\n      .map((row) => ({\n        memoryId: row.memory_id as string,\n        entityRef: row.entity_ref as string,\n        mentionSource: row.mention_source as string,\n        created: row.created_at as string,\n        updated: row.updated_at as string,\n      }));\n  } catch {\n    return null;\n  } finally {\n    db.close();\n  }\n}\n\nexport function readProjectedNativeKnowledgeChunks(\n  memoryDir: string,\n): ProjectedNativeKnowledgeChunkRow[] | null {\n  const db = openProjectionReadonly(memoryDir);\n  if (!db) return null;\n\n  try {\n    const rows = db\n      .prepare(`\n        SELECT\n          chunk_id,\n          source_path,\n          title,\n          source_kind,\n          start_line,\n          end_line,\n          derived_date,\n          session_key,\n          workflow_key,\n          author,\n          agent,\n          namespace,\n          privacy_class,\n          source_hash,\n          preview_text\n        FROM native_knowledge_chunks\n        ORDER BY source_kind ASC, source_path ASC, start_line ASC\n      `)\n      .all() as Array<Record<string, unknown>>;\n\n    return rows\n      .filter(\n        (row) =>\n          typeof row.chunk_id === \"string\" &&\n          typeof row.source_path === \"string\" &&\n          typeof row.title === \"string\" &&\n          typeof row.source_kind === \"string\" &&\n          typeof row.start_line === \"number\" &&\n          typeof row.end_line === \"number\" &&\n          typeof row.preview_text === \"string\",\n      )\n      .map((row) => ({\n        chunkId: row.chunk_id as string,\n        sourcePath: row.source_path as string,\n        title: row.title as string,\n        sourceKind: row.source_kind as string,\n        startLine: row.start_line as number,\n        endLine: row.end_line as number,\n        derivedDate: typeof row.derived_date === \"string\" ? row.derived_date : undefined,\n        sessionKey: typeof row.session_key === \"string\" ? row.session_key : undefined,\n        workflowKey: typeof row.workflow_key === \"string\" ? row.workflow_key : undefined,\n        author: typeof row.author === \"string\" ? row.author : undefined,\n        agent: typeof row.agent === \"string\" ? row.agent : undefined,\n        namespace: typeof row.namespace === \"string\" ? row.namespace : undefined,\n        privacyClass: typeof row.privacy_class === \"string\" ? row.privacy_class : undefined,\n        sourceHash: typeof row.source_hash === \"string\" ? row.source_hash : undefined,\n        preview: row.preview_text as string,\n      }));\n  } catch {\n    return null;\n  } finally {\n    db.close();\n  }\n}\n\nexport function readProjectedLatestReviewQueue(\n  memoryDir: string,\n): ProjectedReviewQueueSnapshot | null {\n  const db = openProjectionReadonly(memoryDir);\n  if (!db) return null;\n\n  try {\n    const latestRunId =\n      (db.prepare(`SELECT value FROM meta WHERE key = 'latestGovernanceRunId'`).get() as { value?: string } | undefined)\n        ?.value\n      ?? (db.prepare(`SELECT run_id AS value FROM memory_review_runs ORDER BY created_at DESC LIMIT 1`).get() as {\n        value?: string;\n      } | undefined)?.value;\n    if (!latestRunId) {\n      return { found: false };\n    }\n\n    const runRow = db\n      .prepare(`\n        SELECT\n          run_id,\n          summary_json,\n          metrics_json,\n          applied_actions_json,\n          report_markdown\n        FROM memory_review_runs\n        WHERE run_id = ?\n      `)\n      .get(latestRunId) as Record<string, unknown> | undefined;\n    if (!runRow || typeof runRow.run_id !== \"string\") {\n      return { found: false };\n    }\n\n    const queueRows = db\n      .prepare(`\n        SELECT\n          entry_id,\n          memory_id,\n          path,\n          reason_code,\n          severity,\n          suggested_action,\n          suggested_status,\n          related_memory_ids_json\n        FROM memory_review_queue\n        WHERE run_id = ?\n        ORDER BY reason_code ASC, memory_id ASC\n      `)\n      .all(latestRunId) as Array<Record<string, unknown>>;\n\n    const actionRows = db\n      .prepare(`\n        SELECT\n          row_key,\n          action,\n          memory_id,\n          reason_code,\n          before_status,\n          after_status,\n          original_path,\n          current_path\n        FROM memory_review_actions\n        WHERE run_id = ?\n        ORDER BY memory_id ASC, action ASC\n      `)\n      .all(latestRunId) as Array<Record<string, unknown>>;\n\n    const reviewQueue: MemoryGovernanceReviewQueueEntry[] = queueRows\n      .filter(\n        (row) =>\n          typeof row.entry_id === \"string\" &&\n          typeof row.memory_id === \"string\" &&\n          typeof row.path === \"string\" &&\n          typeof row.reason_code === \"string\" &&\n          typeof row.severity === \"string\" &&\n          typeof row.suggested_action === \"string\",\n      )\n      .map((row) => ({\n        entryId: row.entry_id as string,\n        memoryId: row.memory_id as string,\n        path: row.path as string,\n        reasonCode: row.reason_code as MemoryGovernanceReviewQueueEntry[\"reasonCode\"],\n        severity: row.severity as MemoryGovernanceReviewQueueEntry[\"severity\"],\n        suggestedAction: row.suggested_action as MemoryGovernanceReviewQueueEntry[\"suggestedAction\"],\n        suggestedStatus:\n          typeof row.suggested_status === \"string\"\n            ? (row.suggested_status as MemoryGovernanceReviewQueueEntry[\"suggestedStatus\"])\n            : undefined,\n        relatedMemoryIds: parseStringArray(row.related_memory_ids_json),\n      }));\n\n    return {\n      found: true,\n      runId: latestRunId,\n      summary: parseJsonObject<MemoryGovernanceSummary>(runRow.summary_json),\n      metrics: parseJsonObject<MemoryGovernanceMetrics>(runRow.metrics_json),\n      reviewQueue,\n      appliedActions:\n        actionRows.length > 0\n          ? actionRows\n            .filter(\n              (row) =>\n                typeof row.action === \"string\" &&\n                typeof row.memory_id === \"string\" &&\n                typeof row.reason_code === \"string\" &&\n                typeof row.before_status === \"string\" &&\n                typeof row.original_path === \"string\" &&\n                typeof row.current_path === \"string\",\n            )\n            .map((row) => ({\n              action: row.action as MemoryGovernanceAppliedAction[\"action\"],\n              memoryId: row.memory_id as string,\n              reasonCode: row.reason_code as MemoryGovernanceAppliedAction[\"reasonCode\"],\n              beforeStatus: row.before_status as MemoryGovernanceAppliedAction[\"beforeStatus\"],\n              afterStatus:\n                typeof row.after_status === \"string\"\n                  ? (row.after_status as MemoryGovernanceAppliedAction[\"afterStatus\"])\n                  : undefined,\n              originalPath: row.original_path as string,\n              currentPath: row.current_path as string,\n            }))\n          : (parseJsonObject<MemoryGovernanceAppliedAction[]>(runRow.applied_actions_json) ?? []),\n      report: typeof runRow.report_markdown === \"string\" ? runRow.report_markdown : undefined,\n    };\n  } catch {\n    return null;\n  } finally {\n    db.close();\n  }\n}\n\nexport function readProjectedGovernanceRecord(\n  memoryDir: string,\n): {\n  runId: string;\n  summary: unknown;\n  metrics: unknown;\n  reviewQueueRows: MemoryProjectionGovernanceReviewQueueRow[];\n  appliedActionRows: MemoryProjectionGovernanceAppliedActionRow[];\n  report: string;\n} | null {\n  const snapshot = readProjectedLatestReviewQueue(memoryDir);\n  if (!snapshot?.found || !snapshot.runId) return null;\n\n  return {\n    runId: snapshot.runId,\n    summary: snapshot.summary ?? {},\n    metrics: snapshot.metrics ?? {},\n    reviewQueueRows: (snapshot.reviewQueue ?? []).map((entry) => ({\n      runId: snapshot.runId as string,\n      entryId: entry.entryId,\n      memoryId: entry.memoryId,\n      path: entry.path,\n      reasonCode: entry.reasonCode,\n      severity: entry.severity,\n      suggestedAction: entry.suggestedAction,\n      suggestedStatus: entry.suggestedStatus,\n      relatedMemoryIds: [...entry.relatedMemoryIds],\n    })),\n    appliedActionRows: (snapshot.appliedActions ?? []).map((action) => ({\n      runId: snapshot.runId as string,\n      rowKey: [\n        action.action,\n        action.memoryId,\n        action.reasonCode,\n        action.originalPath,\n        action.currentPath,\n      ].join(\"::\"),\n      action: action.action,\n      memoryId: action.memoryId,\n      reasonCode: action.reasonCode,\n      beforeStatus: action.beforeStatus,\n      afterStatus: action.afterStatus,\n      originalPath: action.originalPath,\n      currentPath: action.currentPath,\n    })),\n    report: snapshot.report ?? \"\",\n  };\n}\n","import { createRequire } from \"node:module\";\nimport type BetterSqlite3 from \"better-sqlite3\";\n\nexport type BetterSqlite3Database = BetterSqlite3.Database;\ntype BetterSqlite3Ctor = typeof BetterSqlite3;\ntype RuntimeRequire = ReturnType<typeof createRequire>;\n\nlet cachedCtor: BetterSqlite3Ctor | null = null;\n\nfunction loadBetterSqlite3(): BetterSqlite3Ctor {\n  if (cachedCtor) return cachedCtor;\n\n  const require = createRequire(import.meta.url);\n\n  try {\n    cachedCtor = requireBetterSqlite3Ctor(require);\n    return cachedCtor;\n  } catch (error) {\n    throw unavailableError(error);\n  }\n}\n\nexport function openBetterSqlite3(\n  file: string,\n  options?: ConstructorParameters<BetterSqlite3Ctor>[1],\n): BetterSqlite3Database {\n  const Database = loadBetterSqlite3();\n  return new Database(file, options);\n}\n\nfunction requireBetterSqlite3Ctor(require: RuntimeRequire): BetterSqlite3Ctor {\n  const loaded = require(\"better-sqlite3\") as\n    | BetterSqlite3Ctor\n    | { default?: BetterSqlite3Ctor };\n  const ctor = typeof loaded === \"function\" ? loaded : loaded.default;\n\n  if (typeof ctor !== \"function\") {\n    throw new Error(\"module did not export a constructor\");\n  }\n\n  return ctor;\n}\n\nexport function isLikelyBetterSqlite3NativeBindingError(error: unknown): boolean {\n  const detail = errorDetail(error);\n  return (\n    detail.includes(\"Could not locate the bindings file\") ||\n    detail.includes(\"better_sqlite3.node\") ||\n    (detail.includes(\"node-v\") && detail.includes(\"better-sqlite3\")) ||\n    (detail.includes(\"NODE_MODULE_VERSION\") && detail.includes(\"better-sqlite3\")) ||\n    detail.includes(\"was compiled against a different Node.js version\")\n  );\n}\n\nfunction unavailableError(error: unknown): Error {\n  const detail = errorDetail(error);\n  const nativeBindingHint = isLikelyBetterSqlite3NativeBindingError(error)\n    ? \" This usually means the better-sqlite3 native binding was not compiled for this Node.js/platform combination. \" +\n      \"Run `node scripts/ensure-better-sqlite3.mjs` from the Remnic install directory, or run \" +\n      \"`npx node-gyp rebuild --directory=node_modules/better-sqlite3` if the verification script is unavailable.\"\n    : \"\";\n  return new Error(\n    \"better-sqlite3 is unavailable. Remnic attempted to load the native SQLite binding and could not.\" +\n      nativeBindingHint +\n      (detail ? ` Original error: ${detail}` : \"\"),\n    { cause: error instanceof Error ? error : undefined },\n  );\n}\n\nfunction errorDetail(error: unknown): string {\n  if (error instanceof Error) {\n    const stack = error.stack && error.stack !== error.message ? `\\n${error.stack}` : \"\";\n    return `${error.message}${stack}`;\n  }\n  return String(error ?? \"\");\n}\n"],"mappings":";AAAA,OAAO,UAAU;AACjB,OAAO,QAAQ;;;ACDf,SAAS,qBAAqB;AAO9B,IAAI,aAAuC;AAE3C,SAAS,oBAAuC;AAC9C,MAAI,WAAY,QAAO;AAEvB,QAAMA,WAAU,cAAc,YAAY,GAAG;AAE7C,MAAI;AACF,iBAAa,yBAAyBA,QAAO;AAC7C,WAAO;AAAA,EACT,SAAS,OAAO;AACd,UAAM,iBAAiB,KAAK;AAAA,EAC9B;AACF;AAEO,SAAS,kBACd,MACA,SACuB;AACvB,QAAM,WAAW,kBAAkB;AACnC,SAAO,IAAI,SAAS,MAAM,OAAO;AACnC;AAEA,SAAS,yBAAyBA,UAA4C;AAC5E,QAAM,SAASA,SAAQ,gBAAgB;AAGvC,QAAM,OAAO,OAAO,WAAW,aAAa,SAAS,OAAO;AAE5D,MAAI,OAAO,SAAS,YAAY;AAC9B,UAAM,IAAI,MAAM,qCAAqC;AAAA,EACvD;AAEA,SAAO;AACT;AAEO,SAAS,wCAAwC,OAAyB;AAC/E,QAAM,SAAS,YAAY,KAAK;AAChC,SACE,OAAO,SAAS,oCAAoC,KACpD,OAAO,SAAS,qBAAqB,KACpC,OAAO,SAAS,QAAQ,KAAK,OAAO,SAAS,gBAAgB,KAC7D,OAAO,SAAS,qBAAqB,KAAK,OAAO,SAAS,gBAAgB,KAC3E,OAAO,SAAS,kDAAkD;AAEtE;AAEA,SAAS,iBAAiB,OAAuB;AAC/C,QAAM,SAAS,YAAY,KAAK;AAChC,QAAM,oBAAoB,wCAAwC,KAAK,IACnE,mTAGA;AACJ,SAAO,IAAI;AAAA,IACT,qGACE,qBACC,SAAS,oBAAoB,MAAM,KAAK;AAAA,IAC3C,EAAE,OAAO,iBAAiB,QAAQ,QAAQ,OAAU;AAAA,EACtD;AACF;AAEA,SAAS,YAAY,OAAwB;AAC3C,MAAI,iBAAiB,OAAO;AAC1B,UAAM,QAAQ,MAAM,SAAS,MAAM,UAAU,MAAM,UAAU;AAAA,EAAK,MAAM,KAAK,KAAK;AAClF,WAAO,GAAG,MAAM,OAAO,GAAG,KAAK;AAAA,EACjC;AACA,SAAO,OAAO,SAAS,EAAE;AAC3B;;;ADxDO,IAAM,mCAAmC;AAwFzC,SAAS,wBAAwB,WAA2B;AACjE,SAAO,KAAK,KAAK,WAAW,SAAS,0BAA0B;AACjE;AAEA,SAAS,iBAAiB,IAA2B,WAAgC;AACnF,MAAI;AACF,UAAM,OAAO,GAAG,QAAQ,qBAAqB,SAAS,GAAG,EAAE,IAAI;AAC/D,WAAO,IAAI,IAAI,KAAK,IAAI,CAAC,QAAQ,IAAI,IAAI,EAAE,OAAO,CAAC,SAAyB,OAAO,SAAS,QAAQ,CAAC;AAAA,EACvG,QAAQ;AACN,WAAO,oBAAI,IAAY;AAAA,EACzB;AACF;AAEA,SAAS,0BAA0B,IAAiC;AAClE,QAAM,UAAU,iBAAiB,IAAI,gBAAgB;AACrD,MAAI,QAAQ,SAAS,EAAG;AAExB,MAAI,CAAC,QAAQ,IAAI,WAAW,GAAG;AAC7B,OAAG,KAAK,4EAA4E;AAAA,EACtF;AACA,MAAI,CAAC,QAAQ,IAAI,cAAc,GAAG;AAChC,OAAG,KAAK,6EAA6E;AAAA,EACvF;AACF;AAEA,SAAS,+BAA+B,IAAoC;AAC1E,QAAM,UAAU,iBAAiB,IAAI,gBAAgB;AACrD,SAAO,QAAQ,OAAO,MAAM,CAAC,QAAQ,IAAI,WAAW,KAAK,CAAC,QAAQ,IAAI,cAAc;AACtF;AAEA,SAAS,gCAAgC,WAAyB;AAChE,QAAM,SAAS,wBAAwB,SAAS;AAChD,MAAI;AACF,UAAM,KAAK,kBAAkB,QAAQ,EAAE,eAAe,KAAK,CAAC;AAC5D,QAAI;AACF,UAAI,CAAC,+BAA+B,EAAE,EAAG;AACzC,mCAA6B,EAAE;AAAA,IACjC,UAAE;AACA,SAAG,MAAM;AAAA,IACX;AAAA,EACF,QAAQ;AAAA,EAER;AACF;AAEO,SAAS,+BAA+B,IAG7C;AACA,QAAM,UAAU,iBAAiB,IAAI,gBAAgB;AACrD,SAAO;AAAA,IACL,UAAU,QAAQ,IAAI,WAAW,IAAI,cAAc;AAAA,IACnD,aAAa,QAAQ,IAAI,cAAc,IAAI,iBAAiB;AAAA,EAC9D;AACF;AAEO,SAAS,6BAA6B,IAAiC;AAC5E,KAAG,KAAK;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,GAoIP;AAED,4BAA0B,EAAE;AAC5B,KAAG,QAAQ,uDAAuD,EAC/D,IAAI,iBAAiB,OAAO,gCAAgC,CAAC;AAClE;AAEA,SAAS,uBAAuB,WAAiD;AAC/E,QAAM,SAAS,wBAAwB,SAAS;AAChD,MAAI;AACF,WAAO,kBAAkB,QAAQ,EAAE,UAAU,MAAM,eAAe,KAAK,CAAC;AAAA,EAC1E,QAAQ;AACN,WAAO;AAAA,EACT;AACF;AAEA,SAAS,uBACP,WACA,QACU;AACV,QAAM,KAAK,uBAAuB,SAAS;AAC3C,MAAI,CAAC,GAAI,QAAO;AAEhB,MAAI,iBAAiB;AACrB,MAAI;AACF,qBAAiB,+BAA+B,EAAE;AAClD,WAAO,OAAO,EAAE;AAAA,EAClB,QAAQ;AACN,WAAO;AAAA,EACT,UAAE;AACA,OAAG,MAAM;AACT,QAAI,gBAAgB;AAClB,sCAAgC,SAAS;AAAA,IAC3C;AAAA,EACF;AACF;AAEA,SAAS,iBAAiB,OAA0B;AAClD,MAAI,OAAO,UAAU,YAAY,MAAM,WAAW,EAAG,QAAO,CAAC;AAC7D,MAAI;AACF,UAAM,SAAS,KAAK,MAAM,KAAK;AAC/B,WAAO,MAAM,QAAQ,MAAM,IAAI,OAAO,OAAO,CAAC,UAA2B,OAAO,UAAU,QAAQ,IAAI,CAAC;AAAA,EACzG,QAAQ;AACN,WAAO,CAAC;AAAA,EACV;AACF;AAEA,SAAS,gBAAmB,OAA+B;AACzD,MAAI,OAAO,UAAU,YAAY,MAAM,WAAW,EAAG,QAAO;AAC5D,MAAI;AACF,WAAO,KAAK,MAAM,KAAK;AAAA,EACzB,QAAQ;AACN,WAAO;AAAA,EACT;AACF;AAEO,SAAS,gBACd,WACA,KACqC;AACrC,MAAI,CAAC,IAAK,QAAO;AACjB,MACE,OAAO,IAAI,cAAc,YACzB,OAAO,IAAI,aAAa,YACxB,OAAO,IAAI,WAAW,YACtB,OAAO,IAAI,aAAa,YACxB,OAAO,IAAI,eAAe,YAC1B,OAAO,IAAI,eAAe,YAC1B,OAAO,IAAI,WAAW,YACtB,OAAO,IAAI,eAAe,YAC1B,OAAO,IAAI,oBAAoB,UAC/B;AACA,WAAO;AAAA,EACT;AAEA,SAAO;AAAA,IACL,UAAU,IAAI;AAAA,IACd,UAAU,IAAI;AAAA,IACd,QAAQ,IAAI;AAAA,IACZ,gBACE,OAAO,IAAI,oBAAoB,WAC1B,IAAI,kBACL;AAAA,IACN,MAAM,KAAK,KAAK,WAAW,IAAI,QAAQ;AAAA,IACvC,SAAS,IAAI;AAAA,IACb,SAAS,IAAI;AAAA,IACb,SAAS,IAAI;AAAA,IACb,YAAY,OAAO,IAAI,gBAAgB,WAAW,IAAI,cAAc;AAAA,IACpE,cAAc,OAAO,IAAI,kBAAkB,WAAW,IAAI,gBAAgB;AAAA,IAC1E,WAAW,OAAO,IAAI,eAAe,WAAW,IAAI,aAAa;AAAA,IACjE,QAAQ,IAAI;AAAA,IACZ,YAAY,IAAI;AAAA,IAChB,gBAAgB,IAAI;AAAA,IACpB,YACE,OAAO,IAAI,gBAAgB,WACtB,IAAI,cACL;AAAA,IACN,aAAa,OAAO,IAAI,iBAAiB,WAAW,IAAI,eAAe;AAAA,IACvE,cAAc,OAAO,IAAI,kBAAkB,WAAW,IAAI,gBAAgB;AAAA,IAC1E,MAAM,iBAAiB,IAAI,SAAS;AAAA,IACpC,SAAS,OAAO,IAAI,iBAAiB,WAAW,IAAI,eAAe;AAAA,EACrE;AACF;AAEO,SAAS,kBAAkB,MAA8D;AAC9F,QAAM,MAA8B,CAAC;AACrC,aAAW,OAAO,MAAM;AACtB,QACE,OAAO,IAAI,aAAa,YACxB,OAAO,IAAI,cAAc,YACzB,OAAO,IAAI,eAAe,YAC1B,OAAO,IAAI,cAAc,YACzB,OAAO,IAAI,UAAU,YACrB,OAAO,IAAI,iBAAiB,UAC5B;AACA;AAAA,IACF;AAEA,QAAI,KAAK;AAAA,MACP,SAAS,IAAI;AAAA,MACb,UAAU,IAAI;AAAA,MACd,WAAW,IAAI;AAAA,MACf,WAAW,IAAI;AAAA,MACf,OAAO,IAAI;AAAA,MACX,YAAY,OAAO,IAAI,gBAAgB,WAAW,IAAI,cAAc;AAAA,MACpE,aAAa,IAAI;AAAA,MACjB,kBAAkB,iBAAiB,IAAI,uBAAuB;AAAA,MAC9D,QAAQ,gBAAgD,IAAI,WAAW;AAAA,MACvE,OAAO,gBAA+C,IAAI,UAAU;AAAA,MACpE,eAAe,OAAO,IAAI,mBAAmB,WAAW,IAAI,iBAAiB;AAAA,IAC/E,CAAC;AAAA,EACH;AAEA,SAAO;AACT;AAEO,SAAS,yBACd,WACA,UACqC;AACrC,SAAO,uBAAuB,WAAW,CAAC,OAAO;AAC/C,UAAM,gBAAgB,+BAA+B,EAAE;AACvD,UAAM,MAAM,GACT;AAAA,MACC;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,cAkBM,cAAc,QAAQ;AAAA,cACtB,cAAc,WAAW;AAAA;AAAA;AAAA;AAAA,IAIjC,EACC,IAAI,QAAQ;AACf,WAAO,gBAAgB,WAAW,GAAG;AAAA,EACvC,CAAC;AACH;AAEO,SAAS,4BACd,WACA,UACA,OAC+B;AAC/B,QAAM,KAAK,uBAAuB,SAAS;AAC3C,MAAI,CAAC,GAAI,QAAO;AAEhB,MAAI;AACF,UAAM,OAAO,GACV;AAAA,MACC;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,IAsBF,EACC,IAAI,UAAU,KAAK;AACtB,QAAI,KAAK,WAAW,EAAG,QAAO;AAC9B,WAAO,kBAAkB,IAAI;AAAA,EAC/B,QAAQ;AACN,WAAO;AAAA,EACT,UAAE;AACA,OAAG,MAAM;AAAA,EACX;AACF;AAEO,SAAS,0BACd,WACA,SACkC;AAClC,SAAO,uBAAuB,WAAW,CAAC,OAAO;AAC/C,UAAM,kBAAkB,QAAQ,OAAO,KAAK,EAAE,YAAY,KAAK;AAE/D,UAAM,gBAAgB,+BAA+B,EAAE;AACvD,UAAM,eAAyB,CAAC;AAChC,UAAM,SAAoB,CAAC;AAE3B,QAAI,QAAQ,QAAQ;AAClB,mBAAa,KAAK,YAAY;AAC9B,aAAO,KAAK,QAAQ,MAAM;AAAA,IAC5B;AACA,QAAI,QAAQ,UAAU;AACpB,mBAAa,KAAK,cAAc;AAChC,aAAO,KAAK,QAAQ,QAAQ;AAAA,IAC9B;AACA,UAAM,OAAO,QAAQ,QAAQ;AAC7B,UAAM,cAAc,MAAM;AACxB,cAAQ,MAAM;AAAA,QACZ,KAAK;AACH,iBAAO;AAAA,QACT,KAAK;AACH,iBAAO;AAAA,QACT,KAAK;AACH,iBAAO;AAAA,QACT,KAAK;AAAA,QACL;AACE,iBAAO;AAAA,MACX;AAAA,IACF,GAAG;AACH,UAAM,WAAW,aAAa,SAAS,IAAI,SAAS,aAAa,KAAK,OAAO,CAAC,KAAK;AAEnF,QAAI,iBAAiB;AAEnB,YAAM,UAAU,GACb,QAAQ;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,cASH,cAAc,QAAQ;AAAA,cACtB,cAAc,WAAW;AAAA;AAAA,YAE3B,QAAQ;AAAA,qBACC,UAAU;AAAA,SACtB,EACA,IAAI,GAAG,MAAM;AAEhB,YAAM,WAAW,QAAQ,OAAO,CAAC,QAAQ;AACvC,YAAI,OAAO,IAAI,cAAc,YAAY,OAAO,IAAI,aAAa,SAAU,QAAO;AAElF,cAAM,UAAU,OAAO,IAAI,iBAAiB,WAAW,IAAI,aAAa,YAAY,IAAI;AACxF,cAAM,WAAW,OAAO,IAAI,aAAa,WAAW,IAAI,SAAS,YAAY,IAAI;AACjF,cAAM,YAAY,OAAO,IAAI,eAAe,WAAW,IAAI,WAAW,YAAY,IAAI;AACtF,cAAM,OAAO,OAAO,IAAI,cAAc,WAAW,IAAI,UAAU,YAAY,IAAI;AAC/E,YAAI,QAAQ,SAAS,eAAe,KAAK,SAAS,SAAS,eAAe,KACtE,UAAU,SAAS,eAAe,KAAK,KAAK,SAAS,eAAe,GAAG;AACzE,iBAAO;AAAA,QACT;AAEA,YAAI;AACF,gBAAM,WAAW,KAAK,KAAK,WAAW,IAAI,QAAkB;AAC5D,gBAAM,UAAU,GAAG,aAAa,UAAU,OAAO,EAAE,YAAY;AAC/D,iBAAO,QAAQ,SAAS,eAAe;AAAA,QACzC,QAAQ;AACN,iBAAO;AAAA,QACT;AAAA,MACF,CAAC;AAED,YAAM,WAAW,SAAS,MAAM,QAAQ,QAAQ,QAAQ,SAAS,QAAQ,KAAK;AAC9E,aAAO;AAAA,QACL,OAAO,SAAS;AAAA,QAChB,UAAU,SACP;AAAA,UACC,CAAC,QACC,OAAO,IAAI,cAAc,YACzB,OAAO,IAAI,aAAa,YACxB,OAAO,IAAI,aAAa,YACxB,OAAO,IAAI,WAAW;AAAA,QAC1B,EACC,IAAI,CAAC,SAAS;AAAA,UACb,IAAI,IAAI;AAAA,UACR,MAAM,KAAK,KAAK,WAAW,IAAI,QAAkB;AAAA,UACjD,UAAU,IAAI;AAAA,UACd,QAAQ,IAAI;AAAA,UACZ,SAAS,OAAO,IAAI,eAAe,WAAW,IAAI,aAAa;AAAA,UAC/D,SAAS,OAAO,IAAI,eAAe,WAAW,IAAI,aAAa;AAAA,UAC/D,MAAM,iBAAiB,IAAI,SAAS;AAAA,UACpC,WAAW,OAAO,IAAI,eAAe,WAAW,IAAI,aAAa;AAAA,UACjE,SAAS,OAAO,IAAI,iBAAiB,WAAW,IAAI,eAAe;AAAA,QACrE,EAAE;AAAA,MACN;AAAA,IACF;AAGA,UAAM,WAAW,GACd,QAAQ,gDAAgD,QAAQ,EAAE,EAClE,IAAI,GAAG,MAAM;AAChB,UAAM,OAAO,GACV,QAAQ;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,YASH,cAAc,QAAQ;AAAA,YACtB,cAAc,WAAW;AAAA;AAAA,UAE3B,QAAQ;AAAA,mBACC,UAAU;AAAA;AAAA,OAEtB,EACA,IAAI,GAAG,QAAQ,QAAQ,OAAO,QAAQ,MAAM;AAE/C,WAAO;AAAA,MACL,OAAO,OAAO,UAAU,UAAU,WAAW,SAAS,QAAQ;AAAA,MAC9D,UAAU,KACP;AAAA,QACC,CAAC,QACC,OAAO,IAAI,cAAc,YACzB,OAAO,IAAI,aAAa,YACxB,OAAO,IAAI,aAAa,YACxB,OAAO,IAAI,WAAW;AAAA,MAC1B,EACC,IAAI,CAAC,SAAS;AAAA,QACb,IAAI,IAAI;AAAA,QACR,MAAM,KAAK,KAAK,WAAW,IAAI,QAAkB;AAAA,QACjD,UAAU,IAAI;AAAA,QACd,QAAQ,IAAI;AAAA,QACZ,SAAS,OAAO,IAAI,eAAe,WAAW,IAAI,aAAa;AAAA,QAC/D,SAAS,OAAO,IAAI,eAAe,WAAW,IAAI,aAAa;AAAA,QAC/D,MAAM,iBAAiB,IAAI,SAAS;AAAA,QACpC,WAAW,OAAO,IAAI,eAAe,WAAW,IAAI,aAAa;AAAA,QACjE,SAAS,OAAO,IAAI,iBAAiB,WAAW,IAAI,eAAe;AAAA,MACrE,EAAE;AAAA,IACN;AAAA,EACF,CAAC;AACH;AAEO,SAAS,4BACd,WACA,WACoC;AACpC,QAAM,KAAK,uBAAuB,SAAS;AAC3C,MAAI,CAAC,GAAI,QAAO;AAEhB,MAAI;AACF,UAAM,OAAO,GACV,QAAQ;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,OASR,EACA,IAAI;AAEP,WAAO,KACJ;AAAA,MACC,CAAC,QACC,OAAO,IAAI,cAAc,YACzB,OAAO,IAAI,eAAe,YAC1B,OAAO,IAAI,mBAAmB,YAC9B,OAAO,IAAI,eAAe,YAC1B,OAAO,IAAI,eAAe,aACzB,CAAC,aAAa,UAAU,IAAI,IAAI,SAAS;AAAA,IAC9C,EACC,IAAI,CAAC,SAAS;AAAA,MACb,UAAU,IAAI;AAAA,MACd,WAAW,IAAI;AAAA,MACf,eAAe,IAAI;AAAA,MACnB,SAAS,IAAI;AAAA,MACb,SAAS,IAAI;AAAA,IACf,EAAE;AAAA,EACN,QAAQ;AACN,WAAO;AAAA,EACT,UAAE;AACA,OAAG,MAAM;AAAA,EACX;AACF;AAEO,SAAS,mCACd,WAC2C;AAC3C,QAAM,KAAK,uBAAuB,SAAS;AAC3C,MAAI,CAAC,GAAI,QAAO;AAEhB,MAAI;AACF,UAAM,OAAO,GACV,QAAQ;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,OAmBR,EACA,IAAI;AAEP,WAAO,KACJ;AAAA,MACC,CAAC,QACC,OAAO,IAAI,aAAa,YACxB,OAAO,IAAI,gBAAgB,YAC3B,OAAO,IAAI,UAAU,YACrB,OAAO,IAAI,gBAAgB,YAC3B,OAAO,IAAI,eAAe,YAC1B,OAAO,IAAI,aAAa,YACxB,OAAO,IAAI,iBAAiB;AAAA,IAChC,EACC,IAAI,CAAC,SAAS;AAAA,MACb,SAAS,IAAI;AAAA,MACb,YAAY,IAAI;AAAA,MAChB,OAAO,IAAI;AAAA,MACX,YAAY,IAAI;AAAA,MAChB,WAAW,IAAI;AAAA,MACf,SAAS,IAAI;AAAA,MACb,aAAa,OAAO,IAAI,iBAAiB,WAAW,IAAI,eAAe;AAAA,MACvE,YAAY,OAAO,IAAI,gBAAgB,WAAW,IAAI,cAAc;AAAA,MACpE,aAAa,OAAO,IAAI,iBAAiB,WAAW,IAAI,eAAe;AAAA,MACvE,QAAQ,OAAO,IAAI,WAAW,WAAW,IAAI,SAAS;AAAA,MACtD,OAAO,OAAO,IAAI,UAAU,WAAW,IAAI,QAAQ;AAAA,MACnD,WAAW,OAAO,IAAI,cAAc,WAAW,IAAI,YAAY;AAAA,MAC/D,cAAc,OAAO,IAAI,kBAAkB,WAAW,IAAI,gBAAgB;AAAA,MAC1E,YAAY,OAAO,IAAI,gBAAgB,WAAW,IAAI,cAAc;AAAA,MACpE,SAAS,IAAI;AAAA,IACf,EAAE;AAAA,EACN,QAAQ;AACN,WAAO;AAAA,EACT,UAAE;AACA,OAAG,MAAM;AAAA,EACX;AACF;AAEO,SAAS,+BACd,WACqC;AACrC,QAAM,KAAK,uBAAuB,SAAS;AAC3C,MAAI,CAAC,GAAI,QAAO;AAEhB,MAAI;AACF,UAAM,cACH,GAAG,QAAQ,4DAA4D,EAAE,IAAI,GAC1E,SACA,GAAG,QAAQ,iFAAiF,EAAE,IAAI,GAEtF;AAClB,QAAI,CAAC,aAAa;AAChB,aAAO,EAAE,OAAO,MAAM;AAAA,IACxB;AAEA,UAAM,SAAS,GACZ,QAAQ;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,OASR,EACA,IAAI,WAAW;AAClB,QAAI,CAAC,UAAU,OAAO,OAAO,WAAW,UAAU;AAChD,aAAO,EAAE,OAAO,MAAM;AAAA,IACxB;AAEA,UAAM,YAAY,GACf,QAAQ;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,OAaR,EACA,IAAI,WAAW;AAElB,UAAM,aAAa,GAChB,QAAQ;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,OAaR,EACA,IAAI,WAAW;AAElB,UAAM,cAAkD,UACrD;AAAA,MACC,CAAC,QACC,OAAO,IAAI,aAAa,YACxB,OAAO,IAAI,cAAc,YACzB,OAAO,IAAI,SAAS,YACpB,OAAO,IAAI,gBAAgB,YAC3B,OAAO,IAAI,aAAa,YACxB,OAAO,IAAI,qBAAqB;AAAA,IACpC,EACC,IAAI,CAAC,SAAS;AAAA,MACb,SAAS,IAAI;AAAA,MACb,UAAU,IAAI;AAAA,MACd,MAAM,IAAI;AAAA,MACV,YAAY,IAAI;AAAA,MAChB,UAAU,IAAI;AAAA,MACd,iBAAiB,IAAI;AAAA,MACrB,iBACE,OAAO,IAAI,qBAAqB,WAC3B,IAAI,mBACL;AAAA,MACN,kBAAkB,iBAAiB,IAAI,uBAAuB;AAAA,IAChE,EAAE;AAEJ,WAAO;AAAA,MACL,OAAO;AAAA,MACP,OAAO;AAAA,MACP,SAAS,gBAAyC,OAAO,YAAY;AAAA,MACrE,SAAS,gBAAyC,OAAO,YAAY;AAAA,MACrE;AAAA,MACA,gBACE,WAAW,SAAS,IAChB,WACC;AAAA,QACC,CAAC,QACC,OAAO,IAAI,WAAW,YACtB,OAAO,IAAI,cAAc,YACzB,OAAO,IAAI,gBAAgB,YAC3B,OAAO,IAAI,kBAAkB,YAC7B,OAAO,IAAI,kBAAkB,YAC7B,OAAO,IAAI,iBAAiB;AAAA,MAChC,EACC,IAAI,CAAC,SAAS;AAAA,QACb,QAAQ,IAAI;AAAA,QACZ,UAAU,IAAI;AAAA,QACd,YAAY,IAAI;AAAA,QAChB,cAAc,IAAI;AAAA,QAClB,aACE,OAAO,IAAI,iBAAiB,WACvB,IAAI,eACL;AAAA,QACN,cAAc,IAAI;AAAA,QAClB,aAAa,IAAI;AAAA,MACnB,EAAE,IACD,gBAAiD,OAAO,oBAAoB,KAAK,CAAC;AAAA,MACzF,QAAQ,OAAO,OAAO,oBAAoB,WAAW,OAAO,kBAAkB;AAAA,IAChF;AAAA,EACF,QAAQ;AACN,WAAO;AAAA,EACT,UAAE;AACA,OAAG,MAAM;AAAA,EACX;AACF;AAEO,SAAS,8BACd,WAQO;AACP,QAAM,WAAW,+BAA+B,SAAS;AACzD,MAAI,CAAC,UAAU,SAAS,CAAC,SAAS,MAAO,QAAO;AAEhD,SAAO;AAAA,IACL,OAAO,SAAS;AAAA,IAChB,SAAS,SAAS,WAAW,CAAC;AAAA,IAC9B,SAAS,SAAS,WAAW,CAAC;AAAA,IAC9B,kBAAkB,SAAS,eAAe,CAAC,GAAG,IAAI,CAAC,WAAW;AAAA,MAC5D,OAAO,SAAS;AAAA,MAChB,SAAS,MAAM;AAAA,MACf,UAAU,MAAM;AAAA,MAChB,MAAM,MAAM;AAAA,MACZ,YAAY,MAAM;AAAA,MAClB,UAAU,MAAM;AAAA,MAChB,iBAAiB,MAAM;AAAA,MACvB,iBAAiB,MAAM;AAAA,MACvB,kBAAkB,CAAC,GAAG,MAAM,gBAAgB;AAAA,IAC9C,EAAE;AAAA,IACF,oBAAoB,SAAS,kBAAkB,CAAC,GAAG,IAAI,CAAC,YAAY;AAAA,MAClE,OAAO,SAAS;AAAA,MAChB,QAAQ;AAAA,QACN,OAAO;AAAA,QACP,OAAO;AAAA,QACP,OAAO;AAAA,QACP,OAAO;AAAA,QACP,OAAO;AAAA,MACT,EAAE,KAAK,IAAI;AAAA,MACX,QAAQ,OAAO;AAAA,MACf,UAAU,OAAO;AAAA,MACjB,YAAY,OAAO;AAAA,MACnB,cAAc,OAAO;AAAA,MACrB,aAAa,OAAO;AAAA,MACpB,cAAc,OAAO;AAAA,MACrB,aAAa,OAAO;AAAA,IACtB,EAAE;AAAA,IACF,QAAQ,SAAS,UAAU;AAAA,EAC7B;AACF;","names":["require"]}

package/dist/chunk-XMHBH5H6.js

@@ -1,283 +0,0 @@
-import {
-  topicOverlapScore
-} from "./chunk-URB2WSKZ.js";
-import {
-  countRecallTokenOverlap,
-  normalizeRecallTokens
-} from "./chunk-DT5TVLJE.js";
-import {
-  log
-} from "./chunk-2ODBA7MQ.js";
-import {
-  assertIsoRecordedAt,
-  assertString,
-  isRecord,
-  recordStoreDay
-} from "./chunk-DGXUHMOV.js";
-import {
-  listJsonFiles,
-  readJsonFile
-} from "./chunk-LPSF4OQH.js";
-
-// src/causal-chain.ts
-import path from "path";
-import { mkdir, readFile, writeFile } from "fs/promises";
-import { createHash } from "crypto";
-var STITCH_WEIGHTS = {
-  followUpToGoal: 4,
-  outcomeToGoal: 2,
-  entityOverlap: 3,
-  tagOverlap: 1.5,
-  temporalProximity: 1
-};
-function validateCausalEdge(raw) {
-  if (!isRecord(raw)) throw new Error("CausalEdge must be an object");
-  if (raw.schemaVersion !== 1) throw new Error("CausalEdge.schemaVersion must be 1");
-  const edgeType = assertString(raw.edgeType, "edgeType");
-  const validEdgeTypes = ["follow_up_to_goal", "retry", "continuation", "correction"];
-  if (!validEdgeTypes.includes(edgeType)) {
-    throw new Error(`CausalEdge.edgeType must be one of ${validEdgeTypes.join(", ")}`);
-  }
-  const stitchMethod = assertString(raw.stitchMethod, "stitchMethod");
-  const validMethods = ["lexical", "entity", "temporal", "explicit"];
-  if (!validMethods.includes(stitchMethod)) {
-    throw new Error(`CausalEdge.stitchMethod must be one of ${validMethods.join(", ")}`);
-  }
-  const confidence = typeof raw.confidence === "number" ? raw.confidence : 0;
-  if (confidence < 0 || confidence > 1) throw new Error("CausalEdge.confidence must be in [0, 1]");
-  return {
-    schemaVersion: 1,
-    edgeId: assertString(raw.edgeId, "edgeId"),
-    fromTrajectoryId: assertString(raw.fromTrajectoryId, "fromTrajectoryId"),
-    toTrajectoryId: assertString(raw.toTrajectoryId, "toTrajectoryId"),
-    edgeType,
-    confidence,
-    stitchMethod,
-    createdAt: assertIsoRecordedAt(assertString(raw.createdAt, "createdAt")),
-    metadata: isRecord(raw.metadata) ? Object.fromEntries(
-      Object.entries(raw.metadata).filter(
-        (entry) => typeof entry[1] === "string"
-      )
-    ) : void 0
-  };
-}
-function makeEdgeId(fromId, toId) {
-  const digest = createHash("sha256").update(`${fromId}\0${toId}`).digest("hex").slice(0, 12);
-  return `edge-${digest}`;
-}
-function resolveChainsDir(memoryDir, causalTrajectoryStoreDir) {
-  const root = causalTrajectoryStoreDir ? path.join(memoryDir, causalTrajectoryStoreDir) : path.join(memoryDir, "state", "causal-trajectories");
-  return path.join(root, "chains");
-}
-function chainIndexPath(chainsDir) {
-  return path.join(chainsDir, "chain-index.json");
-}
-function edgeFilePath(chainsDir, edge) {
-  const day = recordStoreDay(edge.createdAt);
-  return path.join(chainsDir, "edges", day, `${edge.edgeId}.json`);
-}
-async function readChainIndex(chainsDir) {
-  try {
-    const raw = JSON.parse(await readFile(chainIndexPath(chainsDir), "utf8"));
-    return {
-      outgoing: isRecord(raw.outgoing) ? raw.outgoing : {},
-      incoming: isRecord(raw.incoming) ? raw.incoming : {},
-      edges: isRecord(raw.edges) ? raw.edges : {},
-      updatedAt: typeof raw.updatedAt === "string" ? raw.updatedAt : (/* @__PURE__ */ new Date()).toISOString()
-    };
-  } catch {
-    return { outgoing: {}, incoming: {}, edges: {}, updatedAt: (/* @__PURE__ */ new Date()).toISOString() };
-  }
-}
-async function writeChainIndex(chainsDir, index) {
-  await mkdir(chainsDir, { recursive: true });
-  index.updatedAt = (/* @__PURE__ */ new Date()).toISOString();
-  await writeFile(chainIndexPath(chainsDir), JSON.stringify(index, null, 2), "utf8");
-}
-async function persistEdge(chainsDir, edge) {
-  const filePath = edgeFilePath(chainsDir, edge);
-  await mkdir(path.dirname(filePath), { recursive: true });
-  await writeFile(filePath, JSON.stringify(edge, null, 2), "utf8");
-  return filePath;
-}
-function addEdgeToIndex(index, edge) {
-  if (!index.outgoing[edge.fromTrajectoryId]) {
-    index.outgoing[edge.fromTrajectoryId] = [];
-  }
-  if (!index.outgoing[edge.fromTrajectoryId].includes(edge.edgeId)) {
-    index.outgoing[edge.fromTrajectoryId].push(edge.edgeId);
-  }
-  if (!index.incoming[edge.toTrajectoryId]) {
-    index.incoming[edge.toTrajectoryId] = [];
-  }
-  if (!index.incoming[edge.toTrajectoryId].includes(edge.edgeId)) {
-    index.incoming[edge.toTrajectoryId].push(edge.edgeId);
-  }
-  index.edges[edge.edgeId] = edge;
-}
-function scoreStitchCandidate(newTrajectory, candidate) {
-  let score = 0;
-  let dominantMethod = "lexical";
-  let maxComponent = 0;
-  const newFollowUpTokens = new Set(
-    normalizeRecallTokens(newTrajectory.followUpSummary ?? "", [])
-  );
-  const candidateGoalTokens = normalizeRecallTokens(candidate.goal, []);
-  if (newFollowUpTokens.size > 0 && candidateGoalTokens.length > 0) {
-    const overlap = countRecallTokenOverlap(newFollowUpTokens, candidate.goal, []);
-    const normalized = overlap / Math.max(newFollowUpTokens.size, candidateGoalTokens.length);
-    const component = normalized * STITCH_WEIGHTS.followUpToGoal;
-    score += component;
-    if (component > maxComponent) {
-      maxComponent = component;
-      dominantMethod = "lexical";
-    }
-  }
-  const candidateFollowUpTokens = new Set(
-    normalizeRecallTokens(candidate.followUpSummary ?? "", [])
-  );
-  const newGoalTokens = normalizeRecallTokens(newTrajectory.goal, []);
-  if (candidateFollowUpTokens.size > 0 && newGoalTokens.length > 0) {
-    const overlap = countRecallTokenOverlap(candidateFollowUpTokens, newTrajectory.goal, []);
-    const normalized = overlap / Math.max(candidateFollowUpTokens.size, newGoalTokens.length);
-    const component = normalized * 3;
-    score += component;
-    if (component > maxComponent) {
-      maxComponent = component;
-      dominantMethod = "lexical";
-    }
-  }
-  const newOutcomeTokens = new Set(
-    normalizeRecallTokens(newTrajectory.outcomeSummary, [])
-  );
-  if (newOutcomeTokens.size > 0) {
-    const overlap = countRecallTokenOverlap(newOutcomeTokens, candidate.goal, []);
-    const normalized = overlap / Math.max(newOutcomeTokens.size, candidateGoalTokens.length || 1);
-    const component = normalized * STITCH_WEIGHTS.outcomeToGoal;
-    score += component;
-    if (component > maxComponent) {
-      maxComponent = component;
-      dominantMethod = "lexical";
-    }
-  }
-  const newEntities = newTrajectory.entityRefs ?? [];
-  const candidateEntities = candidate.entityRefs ?? [];
-  if (newEntities.length > 0 && candidateEntities.length > 0) {
-    const entityJaccard = topicOverlapScore(newEntities, candidateEntities);
-    const component = entityJaccard * STITCH_WEIGHTS.entityOverlap;
-    score += component;
-    if (component > maxComponent) {
-      maxComponent = component;
-      dominantMethod = "entity";
-    }
-  }
-  const newTags = newTrajectory.tags ?? [];
-  const candidateTags = candidate.tags ?? [];
-  if (newTags.length > 0 && candidateTags.length > 0) {
-    const tagJaccard = topicOverlapScore(newTags, candidateTags);
-    const component = tagJaccard * STITCH_WEIGHTS.tagOverlap;
-    score += component;
-    if (component > maxComponent) {
-      maxComponent = component;
-      dominantMethod = "lexical";
-    }
-  }
-  const newMs = Date.parse(newTrajectory.recordedAt);
-  const candidateMs = Date.parse(candidate.recordedAt);
-  if (Number.isFinite(newMs) && Number.isFinite(candidateMs)) {
-    const gapHours = Math.abs(newMs - candidateMs) / 36e5;
-    const proximity = 1 / (1 + gapHours / 24);
-    const component = proximity * STITCH_WEIGHTS.temporalProximity;
-    score += component;
-    if (component > maxComponent) {
-      maxComponent = component;
-      dominantMethod = "temporal";
-    }
-  }
-  let edgeType = "continuation";
-  const goalTokens = new Set(normalizeRecallTokens(newTrajectory.goal, []));
-  const candidateGoalSet = new Set(candidateGoalTokens);
-  const goalOverlap = [...goalTokens].filter((t) => candidateGoalSet.has(t)).length;
-  const goalSimilarity = goalTokens.size > 0 ? goalOverlap / goalTokens.size : 0;
-  if (goalSimilarity > 0.7 && candidate.outcomeKind === "failure") {
-    edgeType = "retry";
-  } else if (goalSimilarity > 0.7 && newTrajectory.outcomeKind !== candidate.outcomeKind) {
-    edgeType = "correction";
-  } else if (newFollowUpTokens.size > 0 && candidateGoalTokens.length > 0) {
-    const followUpGoalOverlap = countRecallTokenOverlap(newFollowUpTokens, candidate.goal, []);
-    if (followUpGoalOverlap > 0) {
-      edgeType = "follow_up_to_goal";
-    }
-  }
-  return { trajectory: candidate, score, edgeType, stitchMethod: dominantMethod };
-}
-async function readRecentTrajectories(memoryDir, causalTrajectoryStoreDir, currentSessionKey, lookbackDays) {
-  const root = causalTrajectoryStoreDir ? path.join(memoryDir, causalTrajectoryStoreDir) : path.join(memoryDir, "state", "causal-trajectories");
-  const trajectoriesDir = path.join(root, "trajectories");
-  const files = await listJsonFiles(trajectoriesDir).catch(() => []);
-  if (files.length === 0) return [];
-  const cutoff = Date.now() - lookbackDays * 864e5;
-  const results = [];
-  for (const filePath of files) {
-    try {
-      const raw = await readJsonFile(filePath);
-      if (!isRecord(raw)) continue;
-      const sessionKey = typeof raw.sessionKey === "string" ? raw.sessionKey : "";
-      if (sessionKey === currentSessionKey) continue;
-      const recordedAt = typeof raw.recordedAt === "string" ? raw.recordedAt : "";
-      const ms = Date.parse(recordedAt);
-      if (!Number.isFinite(ms) || ms < cutoff) continue;
-      results.push(raw);
-    } catch {
-    }
-  }
-  return results;
-}
-async function stitchCausalChain(options) {
-  const { memoryDir, causalTrajectoryStoreDir, newTrajectory, config: stitchConfig } = options;
-  const chainsDir = resolveChainsDir(memoryDir, causalTrajectoryStoreDir);
-  const candidates = await readRecentTrajectories(
-    memoryDir,
-    causalTrajectoryStoreDir,
-    newTrajectory.sessionKey,
-    stitchConfig.lookbackDays
-  );
-  if (candidates.length === 0) return [];
-  const scored = candidates.map((c) => scoreStitchCandidate(newTrajectory, c)).filter((s) => s.score >= stitchConfig.minScore).sort((a, b) => b.score - a.score).slice(0, stitchConfig.maxEdgesPerTrajectory);
-  if (scored.length === 0) return [];
-  const index = await readChainIndex(chainsDir);
-  const newEdges = [];
-  for (const candidate of scored) {
-    const edgeId = makeEdgeId(candidate.trajectory.trajectoryId, newTrajectory.trajectoryId);
-    if (index.edges[edgeId]) continue;
-    const edge = {
-      schemaVersion: 1,
-      edgeId,
-      fromTrajectoryId: candidate.trajectory.trajectoryId,
-      toTrajectoryId: newTrajectory.trajectoryId,
-      edgeType: candidate.edgeType,
-      confidence: Math.min(1, candidate.score / 10),
-      stitchMethod: candidate.stitchMethod,
-      createdAt: (/* @__PURE__ */ new Date()).toISOString()
-    };
-    addEdgeToIndex(index, edge);
-    await persistEdge(chainsDir, edge);
-    newEdges.push(edge);
-  }
-  if (newEdges.length > 0) {
-    await writeChainIndex(chainsDir, index);
-    log.debug(`[cmc] stitched ${newEdges.length} causal edge(s) for trajectory ${newTrajectory.trajectoryId}`);
-  }
-  return newEdges;
-}
-
-export {
-  validateCausalEdge,
-  makeEdgeId,
-  resolveChainsDir,
-  readChainIndex,
-  writeChainIndex,
-  scoreStitchCandidate,
-  stitchCausalChain
-};
-//# sourceMappingURL=chunk-XMHBH5H6.js.map

package/dist/chunk-XMHBH5H6.js.map

@@ -1 +0,0 @@
-{"version":3,"sources":["../src/causal-chain.ts"],"sourcesContent":["/**\n * causal-chain.ts — Cross-session causal chain persistence for CMC.\n *\n * Stitches causal trajectories across session boundaries by detecting\n * when a trajectory in one session follows up on a trajectory from\n * another session. Persists edges in a graph index for later retrieval.\n */\n\nimport path from \"node:path\";\nimport { mkdir, readFile, writeFile } from \"node:fs/promises\";\nimport { createHash } from \"node:crypto\";\nimport { listJsonFiles, readJsonFile } from \"./json-store.js\";\nimport type { CausalTrajectoryRecord } from \"./causal-trajectory.js\";\nimport { topicOverlapScore } from \"./boxes.js\";\nimport { countRecallTokenOverlap, normalizeRecallTokens } from \"./recall-tokenization.js\";\nimport {\n  assertIsoRecordedAt,\n  assertString,\n  isRecord,\n  recordStoreDay,\n} from \"./store-contract.js\";\nimport { log } from \"./logger.js\";\n\n// ─── Types ───────────────────────────────────────────────────────────────────\n\nexport interface CausalEdge {\n  schemaVersion: 1;\n  edgeId: string;\n  fromTrajectoryId: string;\n  toTrajectoryId: string;\n  edgeType: \"follow_up_to_goal\" | \"retry\" | \"continuation\" | \"correction\";\n  confidence: number;\n  stitchMethod: \"lexical\" | \"entity\" | \"temporal\" | \"explicit\";\n  createdAt: string;\n  metadata?: Record<string, string>;\n}\n\nexport interface CausalChainIndex {\n  outgoing: Record<string, string[]>;\n  incoming: Record<string, string[]>;\n  edges: Record<string, CausalEdge>;\n  updatedAt: string;\n}\n\nexport interface StitchConfig {\n  lookbackDays: number;\n  minScore: number;\n  maxEdgesPerTrajectory: number;\n}\n\nexport interface StitchCandidate {\n  trajectory: CausalTrajectoryRecord;\n  score: number;\n  edgeType: CausalEdge[\"edgeType\"];\n  stitchMethod: CausalEdge[\"stitchMethod\"];\n}\n\n// ─── Scoring Weights ─────────────────────────────────────────────────────────\n\nconst STITCH_WEIGHTS = {\n  followUpToGoal: 4.0,\n  outcomeToGoal: 2.0,\n  entityOverlap: 3.0,\n  tagOverlap: 1.5,\n  temporalProximity: 1.0,\n} as const;\n\n// ─── Validation ──────────────────────────────────────────────────────────────\n\nexport function validateCausalEdge(raw: unknown): CausalEdge {\n  if (!isRecord(raw)) throw new Error(\"CausalEdge must be an object\");\n  if (raw.schemaVersion !== 1) throw new Error(\"CausalEdge.schemaVersion must be 1\");\n\n  const edgeType = assertString(raw.edgeType, \"edgeType\");\n  const validEdgeTypes = [\"follow_up_to_goal\", \"retry\", \"continuation\", \"correction\"];\n  if (!validEdgeTypes.includes(edgeType)) {\n    throw new Error(`CausalEdge.edgeType must be one of ${validEdgeTypes.join(\", \")}`);\n  }\n\n  const stitchMethod = assertString(raw.stitchMethod, \"stitchMethod\");\n  const validMethods = [\"lexical\", \"entity\", \"temporal\", \"explicit\"];\n  if (!validMethods.includes(stitchMethod)) {\n    throw new Error(`CausalEdge.stitchMethod must be one of ${validMethods.join(\", \")}`);\n  }\n\n  const confidence = typeof raw.confidence === \"number\" ? raw.confidence : 0;\n  if (confidence < 0 || confidence > 1) throw new Error(\"CausalEdge.confidence must be in [0, 1]\");\n\n  return {\n    schemaVersion: 1,\n    edgeId: assertString(raw.edgeId, \"edgeId\"),\n    fromTrajectoryId: assertString(raw.fromTrajectoryId, \"fromTrajectoryId\"),\n    toTrajectoryId: assertString(raw.toTrajectoryId, \"toTrajectoryId\"),\n    edgeType: edgeType as CausalEdge[\"edgeType\"],\n    confidence: confidence,\n    stitchMethod: stitchMethod as CausalEdge[\"stitchMethod\"],\n    createdAt: assertIsoRecordedAt(assertString(raw.createdAt, \"createdAt\")),\n    metadata: isRecord(raw.metadata)\n      ? Object.fromEntries(\n          Object.entries(raw.metadata).filter(\n            (entry): entry is [string, string] => typeof entry[1] === \"string\",\n          ),\n        )\n      : undefined,\n  };\n}\n\n// ─── Stable Edge ID ──────────────────────────────────────────────────────────\n\nexport function makeEdgeId(fromId: string, toId: string): string {\n  const digest = createHash(\"sha256\")\n    .update(`${fromId}\\0${toId}`)\n    .digest(\"hex\")\n    .slice(0, 12);\n  return `edge-${digest}`;\n}\n\n// ─── Storage Paths ───────────────────────────────────────────────────────────\n\nexport function resolveChainsDir(memoryDir: string, causalTrajectoryStoreDir?: string): string {\n  const root = causalTrajectoryStoreDir\n    ? path.join(memoryDir, causalTrajectoryStoreDir)\n    : path.join(memoryDir, \"state\", \"causal-trajectories\");\n  return path.join(root, \"chains\");\n}\n\nfunction chainIndexPath(chainsDir: string): string {\n  return path.join(chainsDir, \"chain-index.json\");\n}\n\nfunction edgeFilePath(chainsDir: string, edge: CausalEdge): string {\n  const day = recordStoreDay(edge.createdAt);\n  return path.join(chainsDir, \"edges\", day, `${edge.edgeId}.json`);\n}\n\n// ─── Chain Index CRUD ────────────────────────────────────────────────────────\n\nexport async function readChainIndex(chainsDir: string): Promise<CausalChainIndex> {\n  try {\n    const raw = JSON.parse(await readFile(chainIndexPath(chainsDir), \"utf8\"));\n    return {\n      outgoing: isRecord(raw.outgoing) ? raw.outgoing as Record<string, string[]> : {},\n      incoming: isRecord(raw.incoming) ? raw.incoming as Record<string, string[]> : {},\n      edges: isRecord(raw.edges) ? raw.edges as Record<string, CausalEdge> : {},\n      updatedAt: typeof raw.updatedAt === \"string\" ? raw.updatedAt : new Date().toISOString(),\n    };\n  } catch {\n    return { outgoing: {}, incoming: {}, edges: {}, updatedAt: new Date().toISOString() };\n  }\n}\n\nexport async function writeChainIndex(chainsDir: string, index: CausalChainIndex): Promise<void> {\n  await mkdir(chainsDir, { recursive: true });\n  index.updatedAt = new Date().toISOString();\n  await writeFile(chainIndexPath(chainsDir), JSON.stringify(index, null, 2), \"utf8\");\n}\n\nasync function persistEdge(chainsDir: string, edge: CausalEdge): Promise<string> {\n  const filePath = edgeFilePath(chainsDir, edge);\n  await mkdir(path.dirname(filePath), { recursive: true });\n  await writeFile(filePath, JSON.stringify(edge, null, 2), \"utf8\");\n  return filePath;\n}\n\nfunction addEdgeToIndex(index: CausalChainIndex, edge: CausalEdge): void {\n  if (!index.outgoing[edge.fromTrajectoryId]) {\n    index.outgoing[edge.fromTrajectoryId] = [];\n  }\n  if (!index.outgoing[edge.fromTrajectoryId].includes(edge.edgeId)) {\n    index.outgoing[edge.fromTrajectoryId].push(edge.edgeId);\n  }\n\n  if (!index.incoming[edge.toTrajectoryId]) {\n    index.incoming[edge.toTrajectoryId] = [];\n  }\n  if (!index.incoming[edge.toTrajectoryId].includes(edge.edgeId)) {\n    index.incoming[edge.toTrajectoryId].push(edge.edgeId);\n  }\n\n  index.edges[edge.edgeId] = edge;\n}\n\n// ─── Stitching Algorithm ─────────────────────────────────────────────────────\n\n/**\n * Score how strongly a candidate trajectory from another session\n * relates to the new trajectory being recorded.\n */\nexport function scoreStitchCandidate(\n  newTrajectory: CausalTrajectoryRecord,\n  candidate: CausalTrajectoryRecord,\n): StitchCandidate {\n  let score = 0;\n  let dominantMethod: CausalEdge[\"stitchMethod\"] = \"lexical\";\n  let maxComponent = 0;\n\n  // 1. Follow-up → Goal match (token overlap)\n  const newFollowUpTokens = new Set(\n    normalizeRecallTokens(newTrajectory.followUpSummary ?? \"\", []),\n  );\n  const candidateGoalTokens = normalizeRecallTokens(candidate.goal, []);\n  if (newFollowUpTokens.size > 0 && candidateGoalTokens.length > 0) {\n    const overlap = countRecallTokenOverlap(newFollowUpTokens, candidate.goal, []);\n    const normalized = overlap / Math.max(newFollowUpTokens.size, candidateGoalTokens.length);\n    const component = normalized * STITCH_WEIGHTS.followUpToGoal;\n    score += component;\n    if (component > maxComponent) {\n      maxComponent = component;\n      dominantMethod = \"lexical\";\n    }\n  }\n\n  // 1b. Candidate follow-up → New goal match (reverse direction)\n  const candidateFollowUpTokens = new Set(\n    normalizeRecallTokens(candidate.followUpSummary ?? \"\", []),\n  );\n  const newGoalTokens = normalizeRecallTokens(newTrajectory.goal, []);\n  if (candidateFollowUpTokens.size > 0 && newGoalTokens.length > 0) {\n    const overlap = countRecallTokenOverlap(candidateFollowUpTokens, newTrajectory.goal, []);\n    const normalized = overlap / Math.max(candidateFollowUpTokens.size, newGoalTokens.length);\n    const component = normalized * 3.0;\n    score += component;\n    if (component > maxComponent) {\n      maxComponent = component;\n      dominantMethod = \"lexical\";\n    }\n  }\n\n  // 2. Outcome → Goal match\n  const newOutcomeTokens = new Set(\n    normalizeRecallTokens(newTrajectory.outcomeSummary, []),\n  );\n  if (newOutcomeTokens.size > 0) {\n    const overlap = countRecallTokenOverlap(newOutcomeTokens, candidate.goal, []);\n    const normalized = overlap / Math.max(newOutcomeTokens.size, candidateGoalTokens.length || 1);\n    const component = normalized * STITCH_WEIGHTS.outcomeToGoal;\n    score += component;\n    if (component > maxComponent) {\n      maxComponent = component;\n      dominantMethod = \"lexical\";\n    }\n  }\n\n  // 3. Entity overlap (Jaccard)\n  const newEntities = newTrajectory.entityRefs ?? [];\n  const candidateEntities = candidate.entityRefs ?? [];\n  if (newEntities.length > 0 && candidateEntities.length > 0) {\n    const entityJaccard = topicOverlapScore(newEntities, candidateEntities);\n    const component = entityJaccard * STITCH_WEIGHTS.entityOverlap;\n    score += component;\n    if (component > maxComponent) {\n      maxComponent = component;\n      dominantMethod = \"entity\";\n    }\n  }\n\n  // 4. Tag overlap (Jaccard)\n  const newTags = newTrajectory.tags ?? [];\n  const candidateTags = candidate.tags ?? [];\n  if (newTags.length > 0 && candidateTags.length > 0) {\n    const tagJaccard = topicOverlapScore(newTags, candidateTags);\n    const component = tagJaccard * STITCH_WEIGHTS.tagOverlap;\n    score += component;\n    if (component > maxComponent) {\n      maxComponent = component;\n      dominantMethod = \"lexical\";\n    }\n  }\n\n  // 5. Temporal proximity: 1/(1 + gapHours/24)\n  const newMs = Date.parse(newTrajectory.recordedAt);\n  const candidateMs = Date.parse(candidate.recordedAt);\n  if (Number.isFinite(newMs) && Number.isFinite(candidateMs)) {\n    const gapHours = Math.abs(newMs - candidateMs) / 3_600_000;\n    const proximity = 1 / (1 + gapHours / 24);\n    const component = proximity * STITCH_WEIGHTS.temporalProximity;\n    score += component;\n    if (component > maxComponent) {\n      maxComponent = component;\n      dominantMethod = \"temporal\";\n    }\n  }\n\n  // Determine edge type by heuristic\n  let edgeType: CausalEdge[\"edgeType\"] = \"continuation\";\n  const goalTokens = new Set(normalizeRecallTokens(newTrajectory.goal, []));\n  const candidateGoalSet = new Set(candidateGoalTokens);\n  const goalOverlap = [...goalTokens].filter((t) => candidateGoalSet.has(t)).length;\n  const goalSimilarity = goalTokens.size > 0 ? goalOverlap / goalTokens.size : 0;\n\n  if (goalSimilarity > 0.7 && candidate.outcomeKind === \"failure\") {\n    edgeType = \"retry\";\n  } else if (goalSimilarity > 0.7 && newTrajectory.outcomeKind !== candidate.outcomeKind) {\n    edgeType = \"correction\";\n  } else if (newFollowUpTokens.size > 0 && candidateGoalTokens.length > 0) {\n    const followUpGoalOverlap = countRecallTokenOverlap(newFollowUpTokens, candidate.goal, []);\n    if (followUpGoalOverlap > 0) {\n      edgeType = \"follow_up_to_goal\";\n    }\n  }\n\n  return { trajectory: candidate, score, edgeType, stitchMethod: dominantMethod };\n}\n\n/**\n * Read trajectory records from the causal-trajectories store within\n * the lookback window, excluding the current session.\n */\nasync function readRecentTrajectories(\n  memoryDir: string,\n  causalTrajectoryStoreDir: string | undefined,\n  currentSessionKey: string,\n  lookbackDays: number,\n): Promise<CausalTrajectoryRecord[]> {\n  const root = causalTrajectoryStoreDir\n    ? path.join(memoryDir, causalTrajectoryStoreDir)\n    : path.join(memoryDir, \"state\", \"causal-trajectories\");\n  const trajectoriesDir = path.join(root, \"trajectories\");\n\n  const files = await listJsonFiles(trajectoriesDir).catch(() => [] as string[]);\n  if (files.length === 0) return [];\n\n  const cutoff = Date.now() - lookbackDays * 86_400_000;\n  const results: CausalTrajectoryRecord[] = [];\n\n  for (const filePath of files) {\n    try {\n      const raw = await readJsonFile(filePath);\n      if (!isRecord(raw)) continue;\n      const sessionKey = typeof raw.sessionKey === \"string\" ? raw.sessionKey : \"\";\n      if (sessionKey === currentSessionKey) continue;\n      const recordedAt = typeof raw.recordedAt === \"string\" ? raw.recordedAt : \"\";\n      const ms = Date.parse(recordedAt);\n      if (!Number.isFinite(ms) || ms < cutoff) continue;\n      results.push(raw as unknown as CausalTrajectoryRecord);\n    } catch {\n      // skip invalid files\n    }\n  }\n\n  return results;\n}\n\n/**\n * After a new trajectory is recorded, attempt to stitch it to\n * existing trajectories from other sessions.\n */\nexport async function stitchCausalChain(options: {\n  memoryDir: string;\n  causalTrajectoryStoreDir?: string;\n  newTrajectory: CausalTrajectoryRecord;\n  config: StitchConfig;\n}): Promise<CausalEdge[]> {\n  const { memoryDir, causalTrajectoryStoreDir, newTrajectory, config: stitchConfig } = options;\n  const chainsDir = resolveChainsDir(memoryDir, causalTrajectoryStoreDir);\n\n  const candidates = await readRecentTrajectories(\n    memoryDir,\n    causalTrajectoryStoreDir,\n    newTrajectory.sessionKey,\n    stitchConfig.lookbackDays,\n  );\n\n  if (candidates.length === 0) return [];\n\n  const scored = candidates\n    .map((c) => scoreStitchCandidate(newTrajectory, c))\n    .filter((s) => s.score >= stitchConfig.minScore)\n    .sort((a, b) => b.score - a.score)\n    .slice(0, stitchConfig.maxEdgesPerTrajectory);\n\n  if (scored.length === 0) return [];\n\n  const index = await readChainIndex(chainsDir);\n  const newEdges: CausalEdge[] = [];\n\n  for (const candidate of scored) {\n    const edgeId = makeEdgeId(candidate.trajectory.trajectoryId, newTrajectory.trajectoryId);\n\n    // Skip if edge already exists\n    if (index.edges[edgeId]) continue;\n\n    const edge: CausalEdge = {\n      schemaVersion: 1,\n      edgeId,\n      fromTrajectoryId: candidate.trajectory.trajectoryId,\n      toTrajectoryId: newTrajectory.trajectoryId,\n      edgeType: candidate.edgeType,\n      confidence: Math.min(1, candidate.score / 10),\n      stitchMethod: candidate.stitchMethod,\n      createdAt: new Date().toISOString(),\n    };\n\n    addEdgeToIndex(index, edge);\n    await persistEdge(chainsDir, edge);\n    newEdges.push(edge);\n  }\n\n  if (newEdges.length > 0) {\n    await writeChainIndex(chainsDir, index);\n    log.debug(`[cmc] stitched ${newEdges.length} causal edge(s) for trajectory ${newTrajectory.trajectoryId}`);\n  }\n\n  return newEdges;\n}\n"],"mappings":";;;;;;;;;;;;;;;;;;;;;;AAQA,OAAO,UAAU;AACjB,SAAS,OAAO,UAAU,iBAAiB;AAC3C,SAAS,kBAAkB;AAiD3B,IAAM,iBAAiB;AAAA,EACrB,gBAAgB;AAAA,EAChB,eAAe;AAAA,EACf,eAAe;AAAA,EACf,YAAY;AAAA,EACZ,mBAAmB;AACrB;AAIO,SAAS,mBAAmB,KAA0B;AAC3D,MAAI,CAAC,SAAS,GAAG,EAAG,OAAM,IAAI,MAAM,8BAA8B;AAClE,MAAI,IAAI,kBAAkB,EAAG,OAAM,IAAI,MAAM,oCAAoC;AAEjF,QAAM,WAAW,aAAa,IAAI,UAAU,UAAU;AACtD,QAAM,iBAAiB,CAAC,qBAAqB,SAAS,gBAAgB,YAAY;AAClF,MAAI,CAAC,eAAe,SAAS,QAAQ,GAAG;AACtC,UAAM,IAAI,MAAM,sCAAsC,eAAe,KAAK,IAAI,CAAC,EAAE;AAAA,EACnF;AAEA,QAAM,eAAe,aAAa,IAAI,cAAc,cAAc;AAClE,QAAM,eAAe,CAAC,WAAW,UAAU,YAAY,UAAU;AACjE,MAAI,CAAC,aAAa,SAAS,YAAY,GAAG;AACxC,UAAM,IAAI,MAAM,0CAA0C,aAAa,KAAK,IAAI,CAAC,EAAE;AAAA,EACrF;AAEA,QAAM,aAAa,OAAO,IAAI,eAAe,WAAW,IAAI,aAAa;AACzE,MAAI,aAAa,KAAK,aAAa,EAAG,OAAM,IAAI,MAAM,yCAAyC;AAE/F,SAAO;AAAA,IACL,eAAe;AAAA,IACf,QAAQ,aAAa,IAAI,QAAQ,QAAQ;AAAA,IACzC,kBAAkB,aAAa,IAAI,kBAAkB,kBAAkB;AAAA,IACvE,gBAAgB,aAAa,IAAI,gBAAgB,gBAAgB;AAAA,IACjE;AAAA,IACA;AAAA,IACA;AAAA,IACA,WAAW,oBAAoB,aAAa,IAAI,WAAW,WAAW,CAAC;AAAA,IACvE,UAAU,SAAS,IAAI,QAAQ,IAC3B,OAAO;AAAA,MACL,OAAO,QAAQ,IAAI,QAAQ,EAAE;AAAA,QAC3B,CAAC,UAAqC,OAAO,MAAM,CAAC,MAAM;AAAA,MAC5D;AAAA,IACF,IACA;AAAA,EACN;AACF;AAIO,SAAS,WAAW,QAAgB,MAAsB;AAC/D,QAAM,SAAS,WAAW,QAAQ,EAC/B,OAAO,GAAG,MAAM,KAAK,IAAI,EAAE,EAC3B,OAAO,KAAK,EACZ,MAAM,GAAG,EAAE;AACd,SAAO,QAAQ,MAAM;AACvB;AAIO,SAAS,iBAAiB,WAAmB,0BAA2C;AAC7F,QAAM,OAAO,2BACT,KAAK,KAAK,WAAW,wBAAwB,IAC7C,KAAK,KAAK,WAAW,SAAS,qBAAqB;AACvD,SAAO,KAAK,KAAK,MAAM,QAAQ;AACjC;AAEA,SAAS,eAAe,WAA2B;AACjD,SAAO,KAAK,KAAK,WAAW,kBAAkB;AAChD;AAEA,SAAS,aAAa,WAAmB,MAA0B;AACjE,QAAM,MAAM,eAAe,KAAK,SAAS;AACzC,SAAO,KAAK,KAAK,WAAW,SAAS,KAAK,GAAG,KAAK,MAAM,OAAO;AACjE;AAIA,eAAsB,eAAe,WAA8C;AACjF,MAAI;AACF,UAAM,MAAM,KAAK,MAAM,MAAM,SAAS,eAAe,SAAS,GAAG,MAAM,CAAC;AACxE,WAAO;AAAA,MACL,UAAU,SAAS,IAAI,QAAQ,IAAI,IAAI,WAAuC,CAAC;AAAA,MAC/E,UAAU,SAAS,IAAI,QAAQ,IAAI,IAAI,WAAuC,CAAC;AAAA,MAC/E,OAAO,SAAS,IAAI,KAAK,IAAI,IAAI,QAAsC,CAAC;AAAA,MACxE,WAAW,OAAO,IAAI,cAAc,WAAW,IAAI,aAAY,oBAAI,KAAK,GAAE,YAAY;AAAA,IACxF;AAAA,EACF,QAAQ;AACN,WAAO,EAAE,UAAU,CAAC,GAAG,UAAU,CAAC,GAAG,OAAO,CAAC,GAAG,YAAW,oBAAI,KAAK,GAAE,YAAY,EAAE;AAAA,EACtF;AACF;AAEA,eAAsB,gBAAgB,WAAmB,OAAwC;AAC/F,QAAM,MAAM,WAAW,EAAE,WAAW,KAAK,CAAC;AAC1C,QAAM,aAAY,oBAAI,KAAK,GAAE,YAAY;AACzC,QAAM,UAAU,eAAe,SAAS,GAAG,KAAK,UAAU,OAAO,MAAM,CAAC,GAAG,MAAM;AACnF;AAEA,eAAe,YAAY,WAAmB,MAAmC;AAC/E,QAAM,WAAW,aAAa,WAAW,IAAI;AAC7C,QAAM,MAAM,KAAK,QAAQ,QAAQ,GAAG,EAAE,WAAW,KAAK,CAAC;AACvD,QAAM,UAAU,UAAU,KAAK,UAAU,MAAM,MAAM,CAAC,GAAG,MAAM;AAC/D,SAAO;AACT;AAEA,SAAS,eAAe,OAAyB,MAAwB;AACvE,MAAI,CAAC,MAAM,SAAS,KAAK,gBAAgB,GAAG;AAC1C,UAAM,SAAS,KAAK,gBAAgB,IAAI,CAAC;AAAA,EAC3C;AACA,MAAI,CAAC,MAAM,SAAS,KAAK,gBAAgB,EAAE,SAAS,KAAK,MAAM,GAAG;AAChE,UAAM,SAAS,KAAK,gBAAgB,EAAE,KAAK,KAAK,MAAM;AAAA,EACxD;AAEA,MAAI,CAAC,MAAM,SAAS,KAAK,cAAc,GAAG;AACxC,UAAM,SAAS,KAAK,cAAc,IAAI,CAAC;AAAA,EACzC;AACA,MAAI,CAAC,MAAM,SAAS,KAAK,cAAc,EAAE,SAAS,KAAK,MAAM,GAAG;AAC9D,UAAM,SAAS,KAAK,cAAc,EAAE,KAAK,KAAK,MAAM;AAAA,EACtD;AAEA,QAAM,MAAM,KAAK,MAAM,IAAI;AAC7B;AAQO,SAAS,qBACd,eACA,WACiB;AACjB,MAAI,QAAQ;AACZ,MAAI,iBAA6C;AACjD,MAAI,eAAe;AAGnB,QAAM,oBAAoB,IAAI;AAAA,IAC5B,sBAAsB,cAAc,mBAAmB,IAAI,CAAC,CAAC;AAAA,EAC/D;AACA,QAAM,sBAAsB,sBAAsB,UAAU,MAAM,CAAC,CAAC;AACpE,MAAI,kBAAkB,OAAO,KAAK,oBAAoB,SAAS,GAAG;AAChE,UAAM,UAAU,wBAAwB,mBAAmB,UAAU,MAAM,CAAC,CAAC;AAC7E,UAAM,aAAa,UAAU,KAAK,IAAI,kBAAkB,MAAM,oBAAoB,MAAM;AACxF,UAAM,YAAY,aAAa,eAAe;AAC9C,aAAS;AACT,QAAI,YAAY,cAAc;AAC5B,qBAAe;AACf,uBAAiB;AAAA,IACnB;AAAA,EACF;AAGA,QAAM,0BAA0B,IAAI;AAAA,IAClC,sBAAsB,UAAU,mBAAmB,IAAI,CAAC,CAAC;AAAA,EAC3D;AACA,QAAM,gBAAgB,sBAAsB,cAAc,MAAM,CAAC,CAAC;AAClE,MAAI,wBAAwB,OAAO,KAAK,cAAc,SAAS,GAAG;AAChE,UAAM,UAAU,wBAAwB,yBAAyB,cAAc,MAAM,CAAC,CAAC;AACvF,UAAM,aAAa,UAAU,KAAK,IAAI,wBAAwB,MAAM,cAAc,MAAM;AACxF,UAAM,YAAY,aAAa;AAC/B,aAAS;AACT,QAAI,YAAY,cAAc;AAC5B,qBAAe;AACf,uBAAiB;AAAA,IACnB;AAAA,EACF;AAGA,QAAM,mBAAmB,IAAI;AAAA,IAC3B,sBAAsB,cAAc,gBAAgB,CAAC,CAAC;AAAA,EACxD;AACA,MAAI,iBAAiB,OAAO,GAAG;AAC7B,UAAM,UAAU,wBAAwB,kBAAkB,UAAU,MAAM,CAAC,CAAC;AAC5E,UAAM,aAAa,UAAU,KAAK,IAAI,iBAAiB,MAAM,oBAAoB,UAAU,CAAC;AAC5F,UAAM,YAAY,aAAa,eAAe;AAC9C,aAAS;AACT,QAAI,YAAY,cAAc;AAC5B,qBAAe;AACf,uBAAiB;AAAA,IACnB;AAAA,EACF;AAGA,QAAM,cAAc,cAAc,cAAc,CAAC;AACjD,QAAM,oBAAoB,UAAU,cAAc,CAAC;AACnD,MAAI,YAAY,SAAS,KAAK,kBAAkB,SAAS,GAAG;AAC1D,UAAM,gBAAgB,kBAAkB,aAAa,iBAAiB;AACtE,UAAM,YAAY,gBAAgB,eAAe;AACjD,aAAS;AACT,QAAI,YAAY,cAAc;AAC5B,qBAAe;AACf,uBAAiB;AAAA,IACnB;AAAA,EACF;AAGA,QAAM,UAAU,cAAc,QAAQ,CAAC;AACvC,QAAM,gBAAgB,UAAU,QAAQ,CAAC;AACzC,MAAI,QAAQ,SAAS,KAAK,cAAc,SAAS,GAAG;AAClD,UAAM,aAAa,kBAAkB,SAAS,aAAa;AAC3D,UAAM,YAAY,aAAa,eAAe;AAC9C,aAAS;AACT,QAAI,YAAY,cAAc;AAC5B,qBAAe;AACf,uBAAiB;AAAA,IACnB;AAAA,EACF;AAGA,QAAM,QAAQ,KAAK,MAAM,cAAc,UAAU;AACjD,QAAM,cAAc,KAAK,MAAM,UAAU,UAAU;AACnD,MAAI,OAAO,SAAS,KAAK,KAAK,OAAO,SAAS,WAAW,GAAG;AAC1D,UAAM,WAAW,KAAK,IAAI,QAAQ,WAAW,IAAI;AACjD,UAAM,YAAY,KAAK,IAAI,WAAW;AACtC,UAAM,YAAY,YAAY,eAAe;AAC7C,aAAS;AACT,QAAI,YAAY,cAAc;AAC5B,qBAAe;AACf,uBAAiB;AAAA,IACnB;AAAA,EACF;AAGA,MAAI,WAAmC;AACvC,QAAM,aAAa,IAAI,IAAI,sBAAsB,cAAc,MAAM,CAAC,CAAC,CAAC;AACxE,QAAM,mBAAmB,IAAI,IAAI,mBAAmB;AACpD,QAAM,cAAc,CAAC,GAAG,UAAU,EAAE,OAAO,CAAC,MAAM,iBAAiB,IAAI,CAAC,CAAC,EAAE;AAC3E,QAAM,iBAAiB,WAAW,OAAO,IAAI,cAAc,WAAW,OAAO;AAE7E,MAAI,iBAAiB,OAAO,UAAU,gBAAgB,WAAW;AAC/D,eAAW;AAAA,EACb,WAAW,iBAAiB,OAAO,cAAc,gBAAgB,UAAU,aAAa;AACtF,eAAW;AAAA,EACb,WAAW,kBAAkB,OAAO,KAAK,oBAAoB,SAAS,GAAG;AACvE,UAAM,sBAAsB,wBAAwB,mBAAmB,UAAU,MAAM,CAAC,CAAC;AACzF,QAAI,sBAAsB,GAAG;AAC3B,iBAAW;AAAA,IACb;AAAA,EACF;AAEA,SAAO,EAAE,YAAY,WAAW,OAAO,UAAU,cAAc,eAAe;AAChF;AAMA,eAAe,uBACb,WACA,0BACA,mBACA,cACmC;AACnC,QAAM,OAAO,2BACT,KAAK,KAAK,WAAW,wBAAwB,IAC7C,KAAK,KAAK,WAAW,SAAS,qBAAqB;AACvD,QAAM,kBAAkB,KAAK,KAAK,MAAM,cAAc;AAEtD,QAAM,QAAQ,MAAM,cAAc,eAAe,EAAE,MAAM,MAAM,CAAC,CAAa;AAC7E,MAAI,MAAM,WAAW,EAAG,QAAO,CAAC;AAEhC,QAAM,SAAS,KAAK,IAAI,IAAI,eAAe;AAC3C,QAAM,UAAoC,CAAC;AAE3C,aAAW,YAAY,OAAO;AAC5B,QAAI;AACF,YAAM,MAAM,MAAM,aAAa,QAAQ;AACvC,UAAI,CAAC,SAAS,GAAG,EAAG;AACpB,YAAM,aAAa,OAAO,IAAI,eAAe,WAAW,IAAI,aAAa;AACzE,UAAI,eAAe,kBAAmB;AACtC,YAAM,aAAa,OAAO,IAAI,eAAe,WAAW,IAAI,aAAa;AACzE,YAAM,KAAK,KAAK,MAAM,UAAU;AAChC,UAAI,CAAC,OAAO,SAAS,EAAE,KAAK,KAAK,OAAQ;AACzC,cAAQ,KAAK,GAAwC;AAAA,IACvD,QAAQ;AAAA,IAER;AAAA,EACF;AAEA,SAAO;AACT;AAMA,eAAsB,kBAAkB,SAKd;AACxB,QAAM,EAAE,WAAW,0BAA0B,eAAe,QAAQ,aAAa,IAAI;AACrF,QAAM,YAAY,iBAAiB,WAAW,wBAAwB;AAEtE,QAAM,aAAa,MAAM;AAAA,IACvB;AAAA,IACA;AAAA,IACA,cAAc;AAAA,IACd,aAAa;AAAA,EACf;AAEA,MAAI,WAAW,WAAW,EAAG,QAAO,CAAC;AAErC,QAAM,SAAS,WACZ,IAAI,CAAC,MAAM,qBAAqB,eAAe,CAAC,CAAC,EACjD,OAAO,CAAC,MAAM,EAAE,SAAS,aAAa,QAAQ,EAC9C,KAAK,CAAC,GAAG,MAAM,EAAE,QAAQ,EAAE,KAAK,EAChC,MAAM,GAAG,aAAa,qBAAqB;AAE9C,MAAI,OAAO,WAAW,EAAG,QAAO,CAAC;AAEjC,QAAM,QAAQ,MAAM,eAAe,SAAS;AAC5C,QAAM,WAAyB,CAAC;AAEhC,aAAW,aAAa,QAAQ;AAC9B,UAAM,SAAS,WAAW,UAAU,WAAW,cAAc,cAAc,YAAY;AAGvF,QAAI,MAAM,MAAM,MAAM,EAAG;AAEzB,UAAM,OAAmB;AAAA,MACvB,eAAe;AAAA,MACf;AAAA,MACA,kBAAkB,UAAU,WAAW;AAAA,MACvC,gBAAgB,cAAc;AAAA,MAC9B,UAAU,UAAU;AAAA,MACpB,YAAY,KAAK,IAAI,GAAG,UAAU,QAAQ,EAAE;AAAA,MAC5C,cAAc,UAAU;AAAA,MACxB,YAAW,oBAAI,KAAK,GAAE,YAAY;AAAA,IACpC;AAEA,mBAAe,OAAO,IAAI;AAC1B,UAAM,YAAY,WAAW,IAAI;AACjC,aAAS,KAAK,IAAI;AAAA,EACpB;AAEA,MAAI,SAAS,SAAS,GAAG;AACvB,UAAM,gBAAgB,WAAW,KAAK;AACtC,QAAI,MAAM,kBAAkB,SAAS,MAAM,kCAAkC,cAAc,YAAY,EAAE;AAAA,EAC3G;AAEA,SAAO;AACT;","names":[]}