@remnic/core 1.1.31 → 9.3.516

package/dist/chunk-N2D6GXBM.js.map

@@ -1 +0,0 @@
-{"version":3,"sources":["../src/enrichment/types.ts","../src/enrichment/provider-registry.ts","../src/enrichment/web-search-provider.ts","../src/enrichment/pipeline.ts","../src/enrichment/audit.ts"],"sourcesContent":["/**\n * Enrichment pipeline types (issue #365).\n *\n * Defines the provider interface, candidate shape, pipeline config,\n * and result types for the external enrichment subsystem.\n */\n\nimport type { ImportanceLevel, MemoryCategory } from \"../types.js\";\n\n// ---------------------------------------------------------------------------\n// Provider config & interface\n// ---------------------------------------------------------------------------\n\nexport type EnrichmentCostTier = \"free\" | \"cheap\" | \"expensive\";\n\nexport interface EnrichmentProviderConfig {\n  id: string;\n  enabled: boolean;\n  costTier: EnrichmentCostTier;\n  rateLimit?: { maxPerMinute: number; maxPerDay: number };\n}\n\nexport interface EnrichmentCandidate {\n  text: string;\n  source: string;\n  sourceUrl?: string;\n  confidence: number;\n  category: MemoryCategory;\n  tags?: string[];\n}\n\nexport interface EnrichmentProvider {\n  readonly id: string;\n  readonly costTier: EnrichmentCostTier;\n  enrich(entity: EntityEnrichmentInput): Promise<EnrichmentCandidate[]>;\n  isAvailable(): Promise<boolean>;\n}\n\n// ---------------------------------------------------------------------------\n// Entity enrichment input\n// ---------------------------------------------------------------------------\n\nexport interface EntityEnrichmentInput {\n  name: string;\n  type: string;\n  knownFacts: string[];\n  importanceLevel: ImportanceLevel;\n}\n\n// ---------------------------------------------------------------------------\n// Pipeline result\n// ---------------------------------------------------------------------------\n\nexport interface EnrichmentResult {\n  entityName: string;\n  provider: string;\n  candidatesFound: number;\n  candidatesAccepted: number;\n  candidatesRejected: number;\n  acceptedCandidates: EnrichmentCandidate[];\n  elapsed: number;\n}\n\n// ---------------------------------------------------------------------------\n// Pipeline config\n// ---------------------------------------------------------------------------\n\nexport interface EnrichmentPipelineConfig {\n  enabled: boolean;\n  providers: EnrichmentProviderConfig[];\n  importanceThresholds: {\n    critical: string[];\n    high: string[];\n    normal: string[];\n    low: string[];\n  };\n  maxCandidatesPerEntity: number;\n  autoEnrichOnCreate: boolean;\n  scheduleIntervalMs: number;\n}\n\n/**\n * Build a default (disabled) pipeline config. Every consumer that needs a\n * config object should call this rather than duplicating the defaults.\n */\nexport function defaultEnrichmentPipelineConfig(): EnrichmentPipelineConfig {\n  return {\n    enabled: false,\n    providers: [],\n    importanceThresholds: {\n      critical: [],\n      high: [],\n      normal: [],\n      low: [],\n    },\n    maxCandidatesPerEntity: 20,\n    autoEnrichOnCreate: false,\n    scheduleIntervalMs: 3_600_000,\n  };\n}\n","/**\n * Enrichment provider registry (issue #365).\n *\n * Central registry for enrichment providers. Providers register themselves\n * at startup; the pipeline queries the registry to determine which providers\n * to run for a given importance tier.\n */\n\nimport type { ImportanceLevel } from \"../types.js\";\nimport type {\n  EnrichmentPipelineConfig,\n  EnrichmentProvider,\n} from \"./types.js\";\n\nexport class EnrichmentProviderRegistry {\n  private readonly providers = new Map<string, EnrichmentProvider>();\n\n  /** Register a provider. Overwrites any existing provider with the same id. */\n  register(provider: EnrichmentProvider): void {\n    this.providers.set(provider.id, provider);\n  }\n\n  /** Look up a single provider by id. */\n  get(id: string): EnrichmentProvider | undefined {\n    return this.providers.get(id);\n  }\n\n  /**\n   * Return all registered providers whose id appears in the config's\n   * `providers` list with `enabled: true`.\n   */\n  listEnabled(config: EnrichmentPipelineConfig): EnrichmentProvider[] {\n    const enabledIds = new Set(\n      config.providers\n        .filter((p) => p.enabled)\n        .map((p) => p.id),\n    );\n    const result: EnrichmentProvider[] = [];\n    for (const [id, provider] of this.providers.entries()) {\n      if (enabledIds.has(id)) {\n        result.push(provider);\n      }\n    }\n    return result;\n  }\n\n  /**\n   * Return providers that should run for a given importance level.\n   * Providers are resolved from `config.importanceThresholds[level]` and\n   * filtered to only those that are both registered and enabled.\n   */\n  getForImportance(\n    level: ImportanceLevel,\n    config: EnrichmentPipelineConfig,\n  ): EnrichmentProvider[] {\n    // \"trivial\" entities never get enrichment providers\n    if (level === \"trivial\") return [];\n\n    const thresholds = config.importanceThresholds;\n    const providerIds: string[] =\n      level === \"critical\"\n        ? thresholds.critical\n        : level === \"high\"\n          ? thresholds.high\n          : level === \"normal\"\n            ? thresholds.normal\n            : thresholds.low;\n\n    const enabledIds = new Set(\n      config.providers\n        .filter((p) => p.enabled)\n        .map((p) => p.id),\n    );\n\n    const result: EnrichmentProvider[] = [];\n    for (const id of providerIds) {\n      if (!enabledIds.has(id)) continue;\n      const provider = this.providers.get(id);\n      if (provider) {\n        result.push(provider);\n      }\n    }\n    return result;\n  }\n}\n","/**\n * Web search enrichment provider stub (issue #365).\n *\n * A basic provider backed by web search. Since this is opt-in and we do not\n * want to hard-code an API key, the provider accepts an optional `searchFn`\n * injection point. When no search function is configured it returns empty\n * results, making it safe to register unconditionally.\n */\n\nimport type {\n  EnrichmentCandidate,\n  EnrichmentCostTier,\n  EnrichmentProvider,\n  EntityEnrichmentInput,\n} from \"./types.js\";\n\nexport type WebSearchFn = (query: string) => Promise<string[]>;\n\nexport interface WebSearchProviderOptions {\n  /**\n   * Injected search function. Each returned string is treated as a raw\n   * snippet. When `undefined` the provider returns empty results.\n   */\n  searchFn?: WebSearchFn;\n}\n\nexport class WebSearchProvider implements EnrichmentProvider {\n  readonly id = \"web-search\";\n  readonly costTier: EnrichmentCostTier = \"cheap\";\n\n  private readonly searchFn: WebSearchFn | undefined;\n\n  constructor(options: WebSearchProviderOptions = {}) {\n    this.searchFn = options.searchFn;\n  }\n\n  async isAvailable(): Promise<boolean> {\n    return this.searchFn !== undefined;\n  }\n\n  async enrich(entity: EntityEnrichmentInput): Promise<EnrichmentCandidate[]> {\n    if (!this.searchFn) return [];\n\n    const query = `${entity.name} ${entity.type}`;\n    let snippets: string[];\n    try {\n      snippets = await this.searchFn(query);\n    } catch {\n      return [];\n    }\n\n    return snippets\n      .filter((s) => typeof s === \"string\" && s.trim().length > 0)\n      .map((snippet) => ({\n        text: snippet.trim(),\n        source: this.id,\n        sourceUrl: undefined,\n        confidence: 0.5,\n        category: \"fact\" as const,\n        tags: [\"web-search\"],\n      }));\n  }\n}\n","/**\n * Enrichment pipeline orchestrator (issue #365).\n *\n * For each entity, determines the importance tier, resolves the providers\n * to run, executes them in sequence (respecting rate limits), tags\n * candidates, and caps at `maxCandidatesPerEntity`.\n *\n * Accepted candidates are returned in each `EnrichmentResult` via the\n * `acceptedCandidates` field so that callers can persist them.\n */\n\nimport type { LoggerBackend } from \"../logger.js\";\nimport type { EnrichmentProviderRegistry } from \"./provider-registry.js\";\nimport type {\n  EnrichmentCandidate,\n  EnrichmentPipelineConfig,\n  EnrichmentProvider,\n  EnrichmentResult,\n  EntityEnrichmentInput,\n} from \"./types.js\";\n\n// ---------------------------------------------------------------------------\n// Rate-limit tracking\n// ---------------------------------------------------------------------------\n\ninterface RateLimitBucket {\n  minuteCount: number;\n  minuteReset: number;\n  dayCount: number;\n  dayReset: number;\n}\n\nfunction isRateLimited(\n  provider: EnrichmentProvider,\n  config: EnrichmentPipelineConfig,\n  buckets: Map<string, RateLimitBucket>,\n): boolean {\n  const providerCfg = config.providers.find((p) => p.id === provider.id);\n  if (!providerCfg?.rateLimit) return false;\n\n  const now = Date.now();\n  let bucket = buckets.get(provider.id);\n  if (!bucket) {\n    bucket = {\n      minuteCount: 0,\n      minuteReset: now + 60_000,\n      dayCount: 0,\n      dayReset: now + 86_400_000,\n    };\n    buckets.set(provider.id, bucket);\n  }\n\n  // Reset windows if expired\n  if (now >= bucket.minuteReset) {\n    bucket.minuteCount = 0;\n    bucket.minuteReset = now + 60_000;\n  }\n  if (now >= bucket.dayReset) {\n    bucket.dayCount = 0;\n    bucket.dayReset = now + 86_400_000;\n  }\n\n  const { maxPerMinute, maxPerDay } = providerCfg.rateLimit;\n  return bucket.minuteCount >= maxPerMinute || bucket.dayCount >= maxPerDay;\n}\n\nfunction recordCall(\n  providerId: string,\n  buckets: Map<string, RateLimitBucket>,\n): void {\n  const bucket = buckets.get(providerId);\n  if (bucket) {\n    bucket.minuteCount += 1;\n    bucket.dayCount += 1;\n  }\n}\n\n// ---------------------------------------------------------------------------\n// Pipeline\n// ---------------------------------------------------------------------------\n\nexport async function runEnrichmentPipeline(\n  entities: EntityEnrichmentInput[],\n  registry: EnrichmentProviderRegistry,\n  config: EnrichmentPipelineConfig,\n  log: LoggerBackend,\n): Promise<EnrichmentResult[]> {\n  if (!config.enabled) return [];\n  if (entities.length === 0) return [];\n\n  const rateBuckets = new Map<string, RateLimitBucket>();\n  const results: EnrichmentResult[] = [];\n\n  for (const entity of entities) {\n    const providers = registry.getForImportance(entity.importanceLevel, config);\n\n    for (const provider of providers) {\n      const start = Date.now();\n\n      // Check availability\n      let available: boolean;\n      try {\n        available = await provider.isAvailable();\n      } catch {\n        available = false;\n      }\n\n      if (!available) {\n        log.debug?.(\n          `enrichment: skipping provider ${provider.id} for ${entity.name} — unavailable`,\n        );\n        results.push({\n          entityName: entity.name,\n          provider: provider.id,\n          candidatesFound: 0,\n          candidatesAccepted: 0,\n          candidatesRejected: 0,\n          acceptedCandidates: [],\n          elapsed: Date.now() - start,\n        });\n        continue;\n      }\n\n      // Check rate limit\n      if (isRateLimited(provider, config, rateBuckets)) {\n        log.debug?.(\n          `enrichment: skipping provider ${provider.id} for ${entity.name} — rate limited`,\n        );\n        results.push({\n          entityName: entity.name,\n          provider: provider.id,\n          candidatesFound: 0,\n          candidatesAccepted: 0,\n          candidatesRejected: 0,\n          acceptedCandidates: [],\n          elapsed: Date.now() - start,\n        });\n        continue;\n      }\n\n      // Run provider.\n      // Count every attempt toward rate-limit buckets — including failures —\n      // because the provider may have consumed external quota before throwing\n      // (PR #425 review finding 2).\n      let candidates: EnrichmentCandidate[];\n      try {\n        candidates = await provider.enrich(entity);\n      } catch (err) {\n        recordCall(provider.id, rateBuckets);\n        log.error?.(\n          `enrichment: provider ${provider.id} failed for ${entity.name}: ${err instanceof Error ? err.message : String(err)}`,\n        );\n        results.push({\n          entityName: entity.name,\n          provider: provider.id,\n          candidatesFound: 0,\n          candidatesAccepted: 0,\n          candidatesRejected: 0,\n          acceptedCandidates: [],\n          elapsed: Date.now() - start,\n        });\n        continue;\n      }\n      recordCall(provider.id, rateBuckets);\n\n      // Tag each candidate with provider id\n      for (const candidate of candidates) {\n        candidate.source = provider.id;\n      }\n\n      // Cap at maxCandidatesPerEntity.\n      // 0 means \"accept none\"; undefined/negative means \"no cap\".\n      const maxCandidates = config.maxCandidatesPerEntity;\n      let accepted: EnrichmentCandidate[];\n      if (maxCandidates === 0) {\n        accepted = [];\n      } else if (maxCandidates > 0 && candidates.length > maxCandidates) {\n        accepted = candidates.slice(0, maxCandidates);\n      } else {\n        accepted = candidates;\n      }\n      const rejected = candidates.length - accepted.length;\n\n      results.push({\n        entityName: entity.name,\n        provider: provider.id,\n        candidatesFound: candidates.length,\n        candidatesAccepted: accepted.length,\n        candidatesRejected: rejected,\n        acceptedCandidates: accepted,\n        elapsed: Date.now() - start,\n      });\n    }\n  }\n\n  return results;\n}\n","/**\n * Enrichment audit trail (issue #365).\n *\n * Append-only JSONL log for every enrichment candidate that was evaluated.\n * Each entry records whether the candidate was accepted or rejected, the\n * provider that produced it, and an optional reason string.\n */\n\nimport { mkdir, readFile, appendFile } from \"node:fs/promises\";\nimport { existsSync } from \"node:fs\";\nimport path from \"node:path\";\n\n// ---------------------------------------------------------------------------\n// Types\n// ---------------------------------------------------------------------------\n\nexport interface EnrichmentAuditEntry {\n  timestamp: string;\n  entityName: string;\n  provider: string;\n  candidateText: string;\n  sourceUrl?: string;\n  accepted: boolean;\n  reason?: string;\n}\n\n// ---------------------------------------------------------------------------\n// File helpers\n// ---------------------------------------------------------------------------\n\nconst AUDIT_FILENAME = \"enrichment-audit.jsonl\";\n\nfunction auditFilePath(auditDir: string): string {\n  return path.join(auditDir, AUDIT_FILENAME);\n}\n\n// ---------------------------------------------------------------------------\n// Public API\n// ---------------------------------------------------------------------------\n\n/**\n * Append a single audit entry to the JSONL log. Creates the audit directory\n * and file if they do not exist.\n */\nexport async function appendAuditEntry(\n  auditDir: string,\n  entry: EnrichmentAuditEntry,\n): Promise<void> {\n  await mkdir(auditDir, { recursive: true });\n  const line = JSON.stringify(entry) + \"\\n\";\n  await appendFile(auditFilePath(auditDir), line, \"utf-8\");\n}\n\n/**\n * Read the audit log and return entries, optionally filtered to entries at\n * or after `since` (ISO 8601 timestamp, half-open interval).\n */\nexport async function readAuditLog(\n  auditDir: string,\n  since?: string,\n): Promise<EnrichmentAuditEntry[]> {\n  const filePath = auditFilePath(auditDir);\n  if (!existsSync(filePath)) return [];\n\n  const raw = await readFile(filePath, \"utf-8\");\n  const entries: EnrichmentAuditEntry[] = [];\n\n  for (const line of raw.split(\"\\n\")) {\n    const trimmed = line.trim();\n    if (trimmed.length === 0) continue;\n    try {\n      const parsed: unknown = JSON.parse(trimmed);\n      if (\n        typeof parsed === \"object\" &&\n        parsed !== null &&\n        \"timestamp\" in parsed &&\n        \"entityName\" in parsed\n      ) {\n        const entry = parsed as EnrichmentAuditEntry;\n        if (since && entry.timestamp < since) continue;\n        entries.push(entry);\n      }\n    } catch {\n      // Skip malformed lines\n    }\n  }\n\n  return entries;\n}\n"],"mappings":";AAqFO,SAAS,kCAA4D;AAC1E,SAAO;AAAA,IACL,SAAS;AAAA,IACT,WAAW,CAAC;AAAA,IACZ,sBAAsB;AAAA,MACpB,UAAU,CAAC;AAAA,MACX,MAAM,CAAC;AAAA,MACP,QAAQ,CAAC;AAAA,MACT,KAAK,CAAC;AAAA,IACR;AAAA,IACA,wBAAwB;AAAA,IACxB,oBAAoB;AAAA,IACpB,oBAAoB;AAAA,EACtB;AACF;;;ACrFO,IAAM,6BAAN,MAAiC;AAAA,EACrB,YAAY,oBAAI,IAAgC;AAAA;AAAA,EAGjE,SAAS,UAAoC;AAC3C,SAAK,UAAU,IAAI,SAAS,IAAI,QAAQ;AAAA,EAC1C;AAAA;AAAA,EAGA,IAAI,IAA4C;AAC9C,WAAO,KAAK,UAAU,IAAI,EAAE;AAAA,EAC9B;AAAA;AAAA;AAAA;AAAA;AAAA,EAMA,YAAY,QAAwD;AAClE,UAAM,aAAa,IAAI;AAAA,MACrB,OAAO,UACJ,OAAO,CAAC,MAAM,EAAE,OAAO,EACvB,IAAI,CAAC,MAAM,EAAE,EAAE;AAAA,IACpB;AACA,UAAM,SAA+B,CAAC;AACtC,eAAW,CAAC,IAAI,QAAQ,KAAK,KAAK,UAAU,QAAQ,GAAG;AACrD,UAAI,WAAW,IAAI,EAAE,GAAG;AACtB,eAAO,KAAK,QAAQ;AAAA,MACtB;AAAA,IACF;AACA,WAAO;AAAA,EACT;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAOA,iBACE,OACA,QACsB;AAEtB,QAAI,UAAU,UAAW,QAAO,CAAC;AAEjC,UAAM,aAAa,OAAO;AAC1B,UAAM,cACJ,UAAU,aACN,WAAW,WACX,UAAU,SACR,WAAW,OACX,UAAU,WACR,WAAW,SACX,WAAW;AAErB,UAAM,aAAa,IAAI;AAAA,MACrB,OAAO,UACJ,OAAO,CAAC,MAAM,EAAE,OAAO,EACvB,IAAI,CAAC,MAAM,EAAE,EAAE;AAAA,IACpB;AAEA,UAAM,SAA+B,CAAC;AACtC,eAAW,MAAM,aAAa;AAC5B,UAAI,CAAC,WAAW,IAAI,EAAE,EAAG;AACzB,YAAM,WAAW,KAAK,UAAU,IAAI,EAAE;AACtC,UAAI,UAAU;AACZ,eAAO,KAAK,QAAQ;AAAA,MACtB;AAAA,IACF;AACA,WAAO;AAAA,EACT;AACF;;;AC1DO,IAAM,oBAAN,MAAsD;AAAA,EAClD,KAAK;AAAA,EACL,WAA+B;AAAA,EAEvB;AAAA,EAEjB,YAAY,UAAoC,CAAC,GAAG;AAClD,SAAK,WAAW,QAAQ;AAAA,EAC1B;AAAA,EAEA,MAAM,cAAgC;AACpC,WAAO,KAAK,aAAa;AAAA,EAC3B;AAAA,EAEA,MAAM,OAAO,QAA+D;AAC1E,QAAI,CAAC,KAAK,SAAU,QAAO,CAAC;AAE5B,UAAM,QAAQ,GAAG,OAAO,IAAI,IAAI,OAAO,IAAI;AAC3C,QAAI;AACJ,QAAI;AACF,iBAAW,MAAM,KAAK,SAAS,KAAK;AAAA,IACtC,QAAQ;AACN,aAAO,CAAC;AAAA,IACV;AAEA,WAAO,SACJ,OAAO,CAAC,MAAM,OAAO,MAAM,YAAY,EAAE,KAAK,EAAE,SAAS,CAAC,EAC1D,IAAI,CAAC,aAAa;AAAA,MACjB,MAAM,QAAQ,KAAK;AAAA,MACnB,QAAQ,KAAK;AAAA,MACb,WAAW;AAAA,MACX,YAAY;AAAA,MACZ,UAAU;AAAA,MACV,MAAM,CAAC,YAAY;AAAA,IACrB,EAAE;AAAA,EACN;AACF;;;AC9BA,SAAS,cACP,UACA,QACA,SACS;AACT,QAAM,cAAc,OAAO,UAAU,KAAK,CAAC,MAAM,EAAE,OAAO,SAAS,EAAE;AACrE,MAAI,CAAC,aAAa,UAAW,QAAO;AAEpC,QAAM,MAAM,KAAK,IAAI;AACrB,MAAI,SAAS,QAAQ,IAAI,SAAS,EAAE;AACpC,MAAI,CAAC,QAAQ;AACX,aAAS;AAAA,MACP,aAAa;AAAA,MACb,aAAa,MAAM;AAAA,MACnB,UAAU;AAAA,MACV,UAAU,MAAM;AAAA,IAClB;AACA,YAAQ,IAAI,SAAS,IAAI,MAAM;AAAA,EACjC;AAGA,MAAI,OAAO,OAAO,aAAa;AAC7B,WAAO,cAAc;AACrB,WAAO,cAAc,MAAM;AAAA,EAC7B;AACA,MAAI,OAAO,OAAO,UAAU;AAC1B,WAAO,WAAW;AAClB,WAAO,WAAW,MAAM;AAAA,EAC1B;AAEA,QAAM,EAAE,cAAc,UAAU,IAAI,YAAY;AAChD,SAAO,OAAO,eAAe,gBAAgB,OAAO,YAAY;AAClE;AAEA,SAAS,WACP,YACA,SACM;AACN,QAAM,SAAS,QAAQ,IAAI,UAAU;AACrC,MAAI,QAAQ;AACV,WAAO,eAAe;AACtB,WAAO,YAAY;AAAA,EACrB;AACF;AAMA,eAAsB,sBACpB,UACA,UACA,QACA,KAC6B;AAC7B,MAAI,CAAC,OAAO,QAAS,QAAO,CAAC;AAC7B,MAAI,SAAS,WAAW,EAAG,QAAO,CAAC;AAEnC,QAAM,cAAc,oBAAI,IAA6B;AACrD,QAAM,UAA8B,CAAC;AAErC,aAAW,UAAU,UAAU;AAC7B,UAAM,YAAY,SAAS,iBAAiB,OAAO,iBAAiB,MAAM;AAE1E,eAAW,YAAY,WAAW;AAChC,YAAM,QAAQ,KAAK,IAAI;AAGvB,UAAI;AACJ,UAAI;AACF,oBAAY,MAAM,SAAS,YAAY;AAAA,MACzC,QAAQ;AACN,oBAAY;AAAA,MACd;AAEA,UAAI,CAAC,WAAW;AACd,YAAI;AAAA,UACF,iCAAiC,SAAS,EAAE,QAAQ,OAAO,IAAI;AAAA,QACjE;AACA,gBAAQ,KAAK;AAAA,UACX,YAAY,OAAO;AAAA,UACnB,UAAU,SAAS;AAAA,UACnB,iBAAiB;AAAA,UACjB,oBAAoB;AAAA,UACpB,oBAAoB;AAAA,UACpB,oBAAoB,CAAC;AAAA,UACrB,SAAS,KAAK,IAAI,IAAI;AAAA,QACxB,CAAC;AACD;AAAA,MACF;AAGA,UAAI,cAAc,UAAU,QAAQ,WAAW,GAAG;AAChD,YAAI;AAAA,UACF,iCAAiC,SAAS,EAAE,QAAQ,OAAO,IAAI;AAAA,QACjE;AACA,gBAAQ,KAAK;AAAA,UACX,YAAY,OAAO;AAAA,UACnB,UAAU,SAAS;AAAA,UACnB,iBAAiB;AAAA,UACjB,oBAAoB;AAAA,UACpB,oBAAoB;AAAA,UACpB,oBAAoB,CAAC;AAAA,UACrB,SAAS,KAAK,IAAI,IAAI;AAAA,QACxB,CAAC;AACD;AAAA,MACF;AAMA,UAAI;AACJ,UAAI;AACF,qBAAa,MAAM,SAAS,OAAO,MAAM;AAAA,MAC3C,SAAS,KAAK;AACZ,mBAAW,SAAS,IAAI,WAAW;AACnC,YAAI;AAAA,UACF,wBAAwB,SAAS,EAAE,eAAe,OAAO,IAAI,KAAK,eAAe,QAAQ,IAAI,UAAU,OAAO,GAAG,CAAC;AAAA,QACpH;AACA,gBAAQ,KAAK;AAAA,UACX,YAAY,OAAO;AAAA,UACnB,UAAU,SAAS;AAAA,UACnB,iBAAiB;AAAA,UACjB,oBAAoB;AAAA,UACpB,oBAAoB;AAAA,UACpB,oBAAoB,CAAC;AAAA,UACrB,SAAS,KAAK,IAAI,IAAI;AAAA,QACxB,CAAC;AACD;AAAA,MACF;AACA,iBAAW,SAAS,IAAI,WAAW;AAGnC,iBAAW,aAAa,YAAY;AAClC,kBAAU,SAAS,SAAS;AAAA,MAC9B;AAIA,YAAM,gBAAgB,OAAO;AAC7B,UAAI;AACJ,UAAI,kBAAkB,GAAG;AACvB,mBAAW,CAAC;AAAA,MACd,WAAW,gBAAgB,KAAK,WAAW,SAAS,eAAe;AACjE,mBAAW,WAAW,MAAM,GAAG,aAAa;AAAA,MAC9C,OAAO;AACL,mBAAW;AAAA,MACb;AACA,YAAM,WAAW,WAAW,SAAS,SAAS;AAE9C,cAAQ,KAAK;AAAA,QACX,YAAY,OAAO;AAAA,QACnB,UAAU,SAAS;AAAA,QACnB,iBAAiB,WAAW;AAAA,QAC5B,oBAAoB,SAAS;AAAA,QAC7B,oBAAoB;AAAA,QACpB,oBAAoB;AAAA,QACpB,SAAS,KAAK,IAAI,IAAI;AAAA,MACxB,CAAC;AAAA,IACH;AAAA,EACF;AAEA,SAAO;AACT;;;AC5LA,SAAS,OAAO,UAAU,kBAAkB;AAC5C,SAAS,kBAAkB;AAC3B,OAAO,UAAU;AAoBjB,IAAM,iBAAiB;AAEvB,SAAS,cAAc,UAA0B;AAC/C,SAAO,KAAK,KAAK,UAAU,cAAc;AAC3C;AAUA,eAAsB,iBACpB,UACA,OACe;AACf,QAAM,MAAM,UAAU,EAAE,WAAW,KAAK,CAAC;AACzC,QAAM,OAAO,KAAK,UAAU,KAAK,IAAI;AACrC,QAAM,WAAW,cAAc,QAAQ,GAAG,MAAM,OAAO;AACzD;AAMA,eAAsB,aACpB,UACA,OACiC;AACjC,QAAM,WAAW,cAAc,QAAQ;AACvC,MAAI,CAAC,WAAW,QAAQ,EAAG,QAAO,CAAC;AAEnC,QAAM,MAAM,MAAM,SAAS,UAAU,OAAO;AAC5C,QAAM,UAAkC,CAAC;AAEzC,aAAW,QAAQ,IAAI,MAAM,IAAI,GAAG;AAClC,UAAM,UAAU,KAAK,KAAK;AAC1B,QAAI,QAAQ,WAAW,EAAG;AAC1B,QAAI;AACF,YAAM,SAAkB,KAAK,MAAM,OAAO;AAC1C,UACE,OAAO,WAAW,YAClB,WAAW,QACX,eAAe,UACf,gBAAgB,QAChB;AACA,cAAM,QAAQ;AACd,YAAI,SAAS,MAAM,YAAY,MAAO;AACtC,gBAAQ,KAAK,KAAK;AAAA,MACpB;AAAA,IACF,QAAQ;AAAA,IAER;AAAA,EACF;AAEA,SAAO;AACT;","names":[]}

package/dist/chunk-NBNN5GOB.js.map

@@ -1 +0,0 @@
-{"version":3,"sources":["../src/profiling.ts"],"sourcesContent":["// Performance profiling collector for recall and extraction traces.\n// Zero external dependencies — uses only node:fs and node:path.\n\nimport {\n  existsSync,\n  mkdirSync,\n  writeFileSync,\n  promises as fsp,\n} from \"node:fs\";\nimport { join } from \"node:path\";\n\nimport { log } from \"./logger.js\";\n\n// ---------------------------------------------------------------------------\n// Types\n// ---------------------------------------------------------------------------\n\nexport interface ProfileSpan {\n  name: string;\n  startOffsetMs: number;\n  durationMs: number;\n}\n\nexport interface ProfileParallelGroupMember {\n  name: string;\n  durationMs: number;\n  resolvedIndex: number;\n}\n\nexport interface ProfileParallelGroup {\n  name: string;\n  startOffsetMs: number;\n  wallMs: number;\n  members: ProfileParallelGroupMember[];\n}\n\nexport interface ProfileTrace {\n  ts: string;\n  kind: \"recall\" | \"extraction\";\n  traceId: string;\n  sessionKey?: string;\n  totalMs: number;\n  spans: ProfileSpan[];\n  parallelGroups?: ProfileParallelGroup[];\n  configSnapshot?: Record<string, unknown>;\n}\n\nexport interface ProfilingConfig {\n  enabled: boolean;\n  storageDir: string;\n  maxTraces: number;\n}\n\nexport interface ParallelGroupHandle {\n  name: string;\n  startOffsetMs: number;\n  traceId?: string;\n}\n\nexport interface ProfilingStats {\n  byKind: Record<string, { count: number; avgMs: number; p50Ms: number; p95Ms: number; maxMs: number }>;\n  bySpan: Record<string, { count: number; avgMs: number; p50Ms: number; p95Ms: number; maxMs: number }>;\n}\n\n// ---------------------------------------------------------------------------\n// Helpers\n// ---------------------------------------------------------------------------\n\nfunction percentile(sorted: number[], p: number): number {\n  if (sorted.length === 0) return 0;\n  const idx = Math.ceil((p / 100) * sorted.length) - 1;\n  return sorted[Math.max(0, Math.min(idx, sorted.length - 1))];\n}\n\nfunction aggregateStats(values: number[]): { count: number; avgMs: number; p50Ms: number; p95Ms: number; maxMs: number } {\n  const count = values.length;\n  if (count === 0) return { count: 0, avgMs: 0, p50Ms: 0, p95Ms: 0, maxMs: 0 };\n  const sorted = [...values].sort((a, b) => a - b);\n  const sum = sorted.reduce((s, v) => s + v, 0);\n  return {\n    count,\n    avgMs: Math.round(sum / count),\n    p50Ms: Math.round(percentile(sorted, 50)),\n    p95Ms: Math.round(percentile(sorted, 95)),\n    maxMs: sorted[sorted.length - 1],\n  };\n}\n\nlet traceCounter = 0;\n\n// ---------------------------------------------------------------------------\n// ProfilingCollector\n// ---------------------------------------------------------------------------\n\nexport class ProfilingCollector {\n  private enabled: boolean;\n  private storageDir: string;\n  private maxTraces: number;\n  private traces: ProfileTrace[] = [];\n  private prunePromise: Promise<void> | null = null;\n\n  // Active trace state — keyed by traceId so concurrent pipelines are isolated.\n  private activeTraces = new Map<\n    string,\n    {\n      kind: \"recall\" | \"extraction\";\n      start: number;\n      sessionKey?: string;\n      configSnapshot?: Record<string, unknown>;\n      spans: ProfileSpan[];\n      spanStarts: Map<string, number>;\n      parallelGroups: ProfileParallelGroup[];\n    }\n  >();\n  private latestTraceId = \"\";\n\n  constructor(config: ProfilingConfig) {\n    this.enabled = config.enabled;\n    this.storageDir = config.storageDir;\n    this.maxTraces = Math.max(0, config.maxTraces);\n\n    if (this.enabled) {\n      if (!existsSync(this.storageDir)) {\n        mkdirSync(this.storageDir, { recursive: true });\n        log.debug(`profiling: created storage dir ${this.storageDir}`);\n      }\n    }\n  }\n\n  get isEnabled(): boolean {\n    return this.enabled;\n  }\n\n  // ---- Trace lifecycle ---------------------------------------------------\n\n  startTrace(kind: \"recall\" | \"extraction\", sessionKey?: string, configSnapshot?: Record<string, unknown>): string {\n    if (!this.enabled) return \"\";\n    traceCounter++;\n    const traceId = `t${traceCounter}-${Date.now().toString(36)}`;\n    this.activeTraces.set(traceId, {\n      kind,\n      start: Date.now(),\n      sessionKey,\n      configSnapshot,\n      spans: [],\n      spanStarts: new Map(),\n      parallelGroups: [],\n    });\n    this.latestTraceId = traceId;\n    log.debug(`profiling: started trace ${traceId} kind=${kind}`);\n    return traceId;\n  }\n\n  startSpan(name: string, traceId?: string): void {\n    const tid = traceId ?? this.latestTraceId;\n    const t = tid ? this.activeTraces.get(tid) : undefined;\n    if (!t) return;\n    const offset = Date.now() - t.start;\n    t.spanStarts.set(name, Date.now());\n    log.debug(`profiling: span ${name} started at +${offset}ms (trace=${tid})`);\n  }\n\n  endSpan(name: string, traceId?: string): void {\n    const tid = traceId ?? this.latestTraceId;\n    const t = tid ? this.activeTraces.get(tid) : undefined;\n    if (!t) return;\n    const start = t.spanStarts.get(name);\n    if (start === undefined) return;\n    const duration = Date.now() - start;\n    const startOffset = start - t.start;\n    t.spans.push({ name, startOffsetMs: startOffset, durationMs: duration });\n    t.spanStarts.delete(name);\n    log.debug(`profiling: span ${name} ended ${duration}ms (trace=${tid})`);\n  }\n\n  endTrace(traceId?: string): ProfileTrace | null {\n    const tid = traceId ?? this.latestTraceId;\n    const t = tid ? this.activeTraces.get(tid) : undefined;\n    if (!t) return null;\n\n    // Auto-close any spans still open when the trace finalizes.\n    const now = Date.now();\n    for (const [name, start] of t.spanStarts) {\n      const duration = now - start;\n      const startOffset = start - t.start;\n      t.spans.push({ name, startOffsetMs: startOffset, durationMs: duration });\n      log.debug(`profiling: auto-closed span ${name} at trace end (${duration}ms, trace=${tid})`);\n    }\n    t.spanStarts.clear();\n\n    const trace: ProfileTrace = {\n      ts: new Date().toISOString(),\n      kind: t.kind,\n      traceId: tid,\n      totalMs: Date.now() - t.start,\n      spans: t.spans,\n      configSnapshot: t.configSnapshot,\n    };\n\n    if (t.sessionKey) {\n      trace.sessionKey = t.sessionKey;\n    }\n    if (t.parallelGroups.length > 0) {\n      trace.parallelGroups = t.parallelGroups;\n    }\n\n    // Remove from active map.\n    this.activeTraces.delete(tid);\n\n    if (!this.enabled) {\n      log.debug(\"profiling: trace discarded (disabled)\");\n      return null;\n    }\n\n    // Persist.\n    this.persistTrace(trace);\n\n    // Buffer in memory (FIFO).\n    this.traces.push(trace);\n    if (this.traces.length > this.maxTraces) {\n      this.traces.shift();\n    }\n\n    // Single-flight: if a prune is already running, piggyback on it;\n    // otherwise start one.  This prevents concurrent prunes from racing\n    // on stale directory snapshots.\n    if (!this.prunePromise) {\n      this.prunePromise = this.pruneFiles().finally(() => {\n        this.prunePromise = null;\n      });\n    }\n    log.debug(`profiling: trace ${trace.traceId} finalized totalMs=${trace.totalMs}`);\n    return trace;\n  }\n\n  // ---- Parallel group tracking -------------------------------------------\n\n  startParallelGroup(name: string, traceId?: string): ParallelGroupHandle {\n    const tid = traceId ?? this.latestTraceId;\n    const t = tid ? this.activeTraces.get(tid) : undefined;\n    const startOffsetMs = t ? Date.now() - t.start : 0;\n    return { name, startOffsetMs, traceId: tid };\n  }\n\n  async endParallelGroup(\n    handle: ParallelGroupHandle,\n    members: Array<{ name: string; promise: Promise<unknown> }>,\n  ): Promise<void> {\n    const wallStart = Date.now();\n\n    let nextResolvedIndex = 0;\n    const resolutionOrder = new Map<string, number>();\n\n    const timed = members.map(async (m) => {\n      const t0 = Date.now();\n      try {\n        await m.promise;\n      } catch {\n        // settled — still record order\n      }\n      resolutionOrder.set(m.name, nextResolvedIndex++);\n      return { name: m.name, durationMs: Date.now() - t0 };\n    });\n    const timedResults = await Promise.allSettled(timed);\n\n    const tid = handle.traceId ?? this.latestTraceId;\n    const t = tid ? this.activeTraces.get(tid) : undefined;\n    if (!t) return;\n\n    const wallMs = Date.now() - wallStart;\n\n    const groupMembers: ProfileParallelGroupMember[] = members.map((m, i) => {\n      const timedResult = timedResults[i].status === \"fulfilled\"\n        ? timedResults[i].value\n        : { name: m.name, durationMs: wallMs };\n      return {\n        name: timedResult.name,\n        durationMs: timedResult.durationMs,\n        resolvedIndex: resolutionOrder.get(m.name) ?? i,\n      };\n    });\n\n    t.parallelGroups.push({\n      name: handle.name,\n      startOffsetMs: handle.startOffsetMs,\n      wallMs,\n      members: groupMembers,\n    });\n\n    log.debug(`profiling: parallel group ${handle.name} wallMs=${wallMs} (trace=${tid})`);\n  }\n\n  // ---- Query methods -----------------------------------------------------\n\n  getRecentTraces(limit?: number): ProfileTrace[] {\n    const n = limit ?? this.traces.length;\n    return this.traces.slice(-n);\n  }\n\n  getStats(): ProfilingStats {\n    const byKind: Record<string, number[]> = {};\n    const bySpan: Record<string, number[]> = {};\n\n    for (const trace of this.traces) {\n      if (!byKind[trace.kind]) byKind[trace.kind] = [];\n      byKind[trace.kind].push(trace.totalMs);\n\n      for (const span of trace.spans) {\n        if (!bySpan[span.name]) bySpan[span.name] = [];\n        bySpan[span.name].push(span.durationMs);\n      }\n    }\n\n    const result: ProfilingStats = { byKind: {}, bySpan: {} };\n    for (const [k, v] of Object.entries(byKind)) {\n      result.byKind[k] = aggregateStats(v);\n    }\n    for (const [k, v] of Object.entries(bySpan)) {\n      result.bySpan[k] = aggregateStats(v);\n    }\n    return result;\n  }\n\n  identifyBottleneck(): string | null {\n    if (this.traces.length === 0) return null;\n    const latest = this.traces[this.traces.length - 1];\n    if (latest.spans.length === 0) return null;\n    let slowest = latest.spans[0];\n    for (const span of latest.spans) {\n      if (span.durationMs > slowest.durationMs) slowest = span;\n    }\n    return slowest.name;\n  }\n\n  // ---- Persistence -------------------------------------------------------\n\n  private persistTrace(trace: ProfileTrace): void {\n    const filename = `${trace.kind}-${trace.traceId}.jsonl`;\n    const filepath = join(this.storageDir, filename);\n    try {\n      writeFileSync(filepath, JSON.stringify(trace) + \"\\n\", \"utf-8\");\n      log.debug(`profiling: persisted ${filename}`);\n    } catch (err) {\n      log.warn(`profiling: failed to persist ${filename}`, err);\n    }\n  }\n\n  async pruneFiles(): Promise<void> {\n    try {\n      const dir = this.storageDir;\n      const entries = await fsp.readdir(dir);\n      const jsonlFiles = entries.filter((f) => f.endsWith(\".jsonl\"));\n      const withMtime = await Promise.all(\n        jsonlFiles.map(async (f) => ({\n          name: f,\n          mtime: (await fsp.stat(join(dir, f))).mtimeMs,\n        })),\n      );\n      const files = withMtime.sort((a, b) => a.mtime - b.mtime).map((f) => f.name);\n\n      while (files.length > this.maxTraces) {\n        const oldest = files.shift()!;\n        await fsp.unlink(join(dir, oldest));\n        log.debug(`profiling: pruned ${oldest}`);\n      }\n    } catch (err) {\n      log.warn(\"profiling: prune failed\", err);\n    }\n  }\n}\n\n// ---------------------------------------------------------------------------\n// ASCII formatter\n// ---------------------------------------------------------------------------\n\nexport function formatProfileTraceAscii(trace: ProfileTrace): string {\n  const lines: string[] = [];\n  const BAR_WIDTH = 40;\n\n  lines.push(`=== Profile: ${trace.kind} ===`);\n  lines.push(`Trace ID : ${trace.traceId}`);\n  lines.push(`Total    : ${trace.totalMs}ms`);\n  if (trace.sessionKey) lines.push(`Session  : ${trace.sessionKey}`);\n  lines.push(\"\");\n\n  // Identify bottleneck.\n  let bottleneckName: string | null = null;\n  if (trace.spans.length > 0) {\n    let slowest = trace.spans[0];\n    for (const s of trace.spans) {\n      if (s.durationMs > slowest.durationMs) slowest = s;\n    }\n    bottleneckName = slowest.name;\n  }\n\n  // Spans.\n  if (trace.spans.length > 0) {\n    const maxDuration = Math.max(...trace.spans.map((s) => s.durationMs), 1);\n    lines.push(\"Spans:\");\n    for (const span of trace.spans) {\n      const barLen = Math.max(1, Math.round((span.durationMs / maxDuration) * BAR_WIDTH));\n      const bar = \"\\u2588\".repeat(barLen);\n      const suffix = span.name === bottleneckName ? \" \\u2190 bottleneck\" : \"\";\n      lines.push(`  ${span.name.padEnd(30)} ${String(span.durationMs).padStart(6)}ms ${bar}${suffix}`);\n    }\n    lines.push(\"\");\n  }\n\n  // Parallel groups.\n  if (trace.parallelGroups && trace.parallelGroups.length > 0) {\n    lines.push(\"Parallel Groups:\");\n    for (const group of trace.parallelGroups) {\n      lines.push(`  ${group.name}:`);\n      lines.push(`    Wall time    : ${group.wallMs}ms`);\n      const efficiency = parallelEfficiency(group);\n      if (efficiency !== null) {\n        lines.push(`    Efficiency   : ${efficiency}%`);\n      }\n      for (const member of group.members) {\n        lines.push(`    [${String(member.resolvedIndex).padStart(2)}] ${member.name.padEnd(28)} ${String(member.durationMs).padStart(6)}ms`);\n      }\n    }\n    lines.push(\"\");\n  }\n\n  lines.push(\"---\");\n  return lines.join(\"\\n\");\n}\n\nfunction parallelEfficiency(group: ProfileParallelGroup): number | null {\n  if (group.members.length <= 1) return null;\n  const idealMs = Math.max(...group.members.map((m) => m.durationMs));\n  if (group.wallMs === 0) return null;\n  return Math.round((idealMs / group.wallMs) * 100);\n}\n"],"mappings":";;;;;AAGA;AAAA,EACE;AAAA,EACA;AAAA,EACA;AAAA,EACA,YAAY;AAAA,OACP;AACP,SAAS,YAAY;AA2DrB,SAAS,WAAW,QAAkB,GAAmB;AACvD,MAAI,OAAO,WAAW,EAAG,QAAO;AAChC,QAAM,MAAM,KAAK,KAAM,IAAI,MAAO,OAAO,MAAM,IAAI;AACnD,SAAO,OAAO,KAAK,IAAI,GAAG,KAAK,IAAI,KAAK,OAAO,SAAS,CAAC,CAAC,CAAC;AAC7D;AAEA,SAAS,eAAe,QAAiG;AACvH,QAAM,QAAQ,OAAO;AACrB,MAAI,UAAU,EAAG,QAAO,EAAE,OAAO,GAAG,OAAO,GAAG,OAAO,GAAG,OAAO,GAAG,OAAO,EAAE;AAC3E,QAAM,SAAS,CAAC,GAAG,MAAM,EAAE,KAAK,CAAC,GAAG,MAAM,IAAI,CAAC;AAC/C,QAAM,MAAM,OAAO,OAAO,CAAC,GAAG,MAAM,IAAI,GAAG,CAAC;AAC5C,SAAO;AAAA,IACL;AAAA,IACA,OAAO,KAAK,MAAM,MAAM,KAAK;AAAA,IAC7B,OAAO,KAAK,MAAM,WAAW,QAAQ,EAAE,CAAC;AAAA,IACxC,OAAO,KAAK,MAAM,WAAW,QAAQ,EAAE,CAAC;AAAA,IACxC,OAAO,OAAO,OAAO,SAAS,CAAC;AAAA,EACjC;AACF;AAEA,IAAI,eAAe;AAMZ,IAAM,qBAAN,MAAyB;AAAA,EACtB;AAAA,EACA;AAAA,EACA;AAAA,EACA,SAAyB,CAAC;AAAA,EAC1B,eAAqC;AAAA;AAAA,EAGrC,eAAe,oBAAI,IAWzB;AAAA,EACM,gBAAgB;AAAA,EAExB,YAAY,QAAyB;AACnC,SAAK,UAAU,OAAO;AACtB,SAAK,aAAa,OAAO;AACzB,SAAK,YAAY,KAAK,IAAI,GAAG,OAAO,SAAS;AAE7C,QAAI,KAAK,SAAS;AAChB,UAAI,CAAC,WAAW,KAAK,UAAU,GAAG;AAChC,kBAAU,KAAK,YAAY,EAAE,WAAW,KAAK,CAAC;AAC9C,YAAI,MAAM,kCAAkC,KAAK,UAAU,EAAE;AAAA,MAC/D;AAAA,IACF;AAAA,EACF;AAAA,EAEA,IAAI,YAAqB;AACvB,WAAO,KAAK;AAAA,EACd;AAAA;AAAA,EAIA,WAAW,MAA+B,YAAqB,gBAAkD;AAC/G,QAAI,CAAC,KAAK,QAAS,QAAO;AAC1B;AACA,UAAM,UAAU,IAAI,YAAY,IAAI,KAAK,IAAI,EAAE,SAAS,EAAE,CAAC;AAC3D,SAAK,aAAa,IAAI,SAAS;AAAA,MAC7B;AAAA,MACA,OAAO,KAAK,IAAI;AAAA,MAChB;AAAA,MACA;AAAA,MACA,OAAO,CAAC;AAAA,MACR,YAAY,oBAAI,IAAI;AAAA,MACpB,gBAAgB,CAAC;AAAA,IACnB,CAAC;AACD,SAAK,gBAAgB;AACrB,QAAI,MAAM,4BAA4B,OAAO,SAAS,IAAI,EAAE;AAC5D,WAAO;AAAA,EACT;AAAA,EAEA,UAAU,MAAc,SAAwB;AAC9C,UAAM,MAAM,WAAW,KAAK;AAC5B,UAAM,IAAI,MAAM,KAAK,aAAa,IAAI,GAAG,IAAI;AAC7C,QAAI,CAAC,EAAG;AACR,UAAM,SAAS,KAAK,IAAI,IAAI,EAAE;AAC9B,MAAE,WAAW,IAAI,MAAM,KAAK,IAAI,CAAC;AACjC,QAAI,MAAM,mBAAmB,IAAI,gBAAgB,MAAM,aAAa,GAAG,GAAG;AAAA,EAC5E;AAAA,EAEA,QAAQ,MAAc,SAAwB;AAC5C,UAAM,MAAM,WAAW,KAAK;AAC5B,UAAM,IAAI,MAAM,KAAK,aAAa,IAAI,GAAG,IAAI;AAC7C,QAAI,CAAC,EAAG;AACR,UAAM,QAAQ,EAAE,WAAW,IAAI,IAAI;AACnC,QAAI,UAAU,OAAW;AACzB,UAAM,WAAW,KAAK,IAAI,IAAI;AAC9B,UAAM,cAAc,QAAQ,EAAE;AAC9B,MAAE,MAAM,KAAK,EAAE,MAAM,eAAe,aAAa,YAAY,SAAS,CAAC;AACvE,MAAE,WAAW,OAAO,IAAI;AACxB,QAAI,MAAM,mBAAmB,IAAI,UAAU,QAAQ,aAAa,GAAG,GAAG;AAAA,EACxE;AAAA,EAEA,SAAS,SAAuC;AAC9C,UAAM,MAAM,WAAW,KAAK;AAC5B,UAAM,IAAI,MAAM,KAAK,aAAa,IAAI,GAAG,IAAI;AAC7C,QAAI,CAAC,EAAG,QAAO;AAGf,UAAM,MAAM,KAAK,IAAI;AACrB,eAAW,CAAC,MAAM,KAAK,KAAK,EAAE,YAAY;AACxC,YAAM,WAAW,MAAM;AACvB,YAAM,cAAc,QAAQ,EAAE;AAC9B,QAAE,MAAM,KAAK,EAAE,MAAM,eAAe,aAAa,YAAY,SAAS,CAAC;AACvE,UAAI,MAAM,+BAA+B,IAAI,kBAAkB,QAAQ,aAAa,GAAG,GAAG;AAAA,IAC5F;AACA,MAAE,WAAW,MAAM;AAEnB,UAAM,QAAsB;AAAA,MAC1B,KAAI,oBAAI,KAAK,GAAE,YAAY;AAAA,MAC3B,MAAM,EAAE;AAAA,MACR,SAAS;AAAA,MACT,SAAS,KAAK,IAAI,IAAI,EAAE;AAAA,MACxB,OAAO,EAAE;AAAA,MACT,gBAAgB,EAAE;AAAA,IACpB;AAEA,QAAI,EAAE,YAAY;AAChB,YAAM,aAAa,EAAE;AAAA,IACvB;AACA,QAAI,EAAE,eAAe,SAAS,GAAG;AAC/B,YAAM,iBAAiB,EAAE;AAAA,IAC3B;AAGA,SAAK,aAAa,OAAO,GAAG;AAE5B,QAAI,CAAC,KAAK,SAAS;AACjB,UAAI,MAAM,uCAAuC;AACjD,aAAO;AAAA,IACT;AAGA,SAAK,aAAa,KAAK;AAGvB,SAAK,OAAO,KAAK,KAAK;AACtB,QAAI,KAAK,OAAO,SAAS,KAAK,WAAW;AACvC,WAAK,OAAO,MAAM;AAAA,IACpB;AAKA,QAAI,CAAC,KAAK,cAAc;AACtB,WAAK,eAAe,KAAK,WAAW,EAAE,QAAQ,MAAM;AAClD,aAAK,eAAe;AAAA,MACtB,CAAC;AAAA,IACH;AACA,QAAI,MAAM,oBAAoB,MAAM,OAAO,sBAAsB,MAAM,OAAO,EAAE;AAChF,WAAO;AAAA,EACT;AAAA;AAAA,EAIA,mBAAmB,MAAc,SAAuC;AACtE,UAAM,MAAM,WAAW,KAAK;AAC5B,UAAM,IAAI,MAAM,KAAK,aAAa,IAAI,GAAG,IAAI;AAC7C,UAAM,gBAAgB,IAAI,KAAK,IAAI,IAAI,EAAE,QAAQ;AACjD,WAAO,EAAE,MAAM,eAAe,SAAS,IAAI;AAAA,EAC7C;AAAA,EAEA,MAAM,iBACJ,QACA,SACe;AACf,UAAM,YAAY,KAAK,IAAI;AAE3B,QAAI,oBAAoB;AACxB,UAAM,kBAAkB,oBAAI,IAAoB;AAEhD,UAAM,QAAQ,QAAQ,IAAI,OAAO,MAAM;AACrC,YAAM,KAAK,KAAK,IAAI;AACpB,UAAI;AACF,cAAM,EAAE;AAAA,MACV,QAAQ;AAAA,MAER;AACA,sBAAgB,IAAI,EAAE,MAAM,mBAAmB;AAC/C,aAAO,EAAE,MAAM,EAAE,MAAM,YAAY,KAAK,IAAI,IAAI,GAAG;AAAA,IACrD,CAAC;AACD,UAAM,eAAe,MAAM,QAAQ,WAAW,KAAK;AAEnD,UAAM,MAAM,OAAO,WAAW,KAAK;AACnC,UAAM,IAAI,MAAM,KAAK,aAAa,IAAI,GAAG,IAAI;AAC7C,QAAI,CAAC,EAAG;AAER,UAAM,SAAS,KAAK,IAAI,IAAI;AAE5B,UAAM,eAA6C,QAAQ,IAAI,CAAC,GAAG,MAAM;AACvE,YAAM,cAAc,aAAa,CAAC,EAAE,WAAW,cAC3C,aAAa,CAAC,EAAE,QAChB,EAAE,MAAM,EAAE,MAAM,YAAY,OAAO;AACvC,aAAO;AAAA,QACL,MAAM,YAAY;AAAA,QAClB,YAAY,YAAY;AAAA,QACxB,eAAe,gBAAgB,IAAI,EAAE,IAAI,KAAK;AAAA,MAChD;AAAA,IACF,CAAC;AAED,MAAE,eAAe,KAAK;AAAA,MACpB,MAAM,OAAO;AAAA,MACb,eAAe,OAAO;AAAA,MACtB;AAAA,MACA,SAAS;AAAA,IACX,CAAC;AAED,QAAI,MAAM,6BAA6B,OAAO,IAAI,WAAW,MAAM,WAAW,GAAG,GAAG;AAAA,EACtF;AAAA;AAAA,EAIA,gBAAgB,OAAgC;AAC9C,UAAM,IAAI,SAAS,KAAK,OAAO;AAC/B,WAAO,KAAK,OAAO,MAAM,CAAC,CAAC;AAAA,EAC7B;AAAA,EAEA,WAA2B;AACzB,UAAM,SAAmC,CAAC;AAC1C,UAAM,SAAmC,CAAC;AAE1C,eAAW,SAAS,KAAK,QAAQ;AAC/B,UAAI,CAAC,OAAO,MAAM,IAAI,EAAG,QAAO,MAAM,IAAI,IAAI,CAAC;AAC/C,aAAO,MAAM,IAAI,EAAE,KAAK,MAAM,OAAO;AAErC,iBAAW,QAAQ,MAAM,OAAO;AAC9B,YAAI,CAAC,OAAO,KAAK,IAAI,EAAG,QAAO,KAAK,IAAI,IAAI,CAAC;AAC7C,eAAO,KAAK,IAAI,EAAE,KAAK,KAAK,UAAU;AAAA,MACxC;AAAA,IACF;AAEA,UAAM,SAAyB,EAAE,QAAQ,CAAC,GAAG,QAAQ,CAAC,EAAE;AACxD,eAAW,CAAC,GAAG,CAAC,KAAK,OAAO,QAAQ,MAAM,GAAG;AAC3C,aAAO,OAAO,CAAC,IAAI,eAAe,CAAC;AAAA,IACrC;AACA,eAAW,CAAC,GAAG,CAAC,KAAK,OAAO,QAAQ,MAAM,GAAG;AAC3C,aAAO,OAAO,CAAC,IAAI,eAAe,CAAC;AAAA,IACrC;AACA,WAAO;AAAA,EACT;AAAA,EAEA,qBAAoC;AAClC,QAAI,KAAK,OAAO,WAAW,EAAG,QAAO;AACrC,UAAM,SAAS,KAAK,OAAO,KAAK,OAAO,SAAS,CAAC;AACjD,QAAI,OAAO,MAAM,WAAW,EAAG,QAAO;AACtC,QAAI,UAAU,OAAO,MAAM,CAAC;AAC5B,eAAW,QAAQ,OAAO,OAAO;AAC/B,UAAI,KAAK,aAAa,QAAQ,WAAY,WAAU;AAAA,IACtD;AACA,WAAO,QAAQ;AAAA,EACjB;AAAA;AAAA,EAIQ,aAAa,OAA2B;AAC9C,UAAM,WAAW,GAAG,MAAM,IAAI,IAAI,MAAM,OAAO;AAC/C,UAAM,WAAW,KAAK,KAAK,YAAY,QAAQ;AAC/C,QAAI;AACF,oBAAc,UAAU,KAAK,UAAU,KAAK,IAAI,MAAM,OAAO;AAC7D,UAAI,MAAM,wBAAwB,QAAQ,EAAE;AAAA,IAC9C,SAAS,KAAK;AACZ,UAAI,KAAK,gCAAgC,QAAQ,IAAI,GAAG;AAAA,IAC1D;AAAA,EACF;AAAA,EAEA,MAAM,aAA4B;AAChC,QAAI;AACF,YAAM,MAAM,KAAK;AACjB,YAAM,UAAU,MAAM,IAAI,QAAQ,GAAG;AACrC,YAAM,aAAa,QAAQ,OAAO,CAAC,MAAM,EAAE,SAAS,QAAQ,CAAC;AAC7D,YAAM,YAAY,MAAM,QAAQ;AAAA,QAC9B,WAAW,IAAI,OAAO,OAAO;AAAA,UAC3B,MAAM;AAAA,UACN,QAAQ,MAAM,IAAI,KAAK,KAAK,KAAK,CAAC,CAAC,GAAG;AAAA,QACxC,EAAE;AAAA,MACJ;AACA,YAAM,QAAQ,UAAU,KAAK,CAAC,GAAG,MAAM,EAAE,QAAQ,EAAE,KAAK,EAAE,IAAI,CAAC,MAAM,EAAE,IAAI;AAE3E,aAAO,MAAM,SAAS,KAAK,WAAW;AACpC,cAAM,SAAS,MAAM,MAAM;AAC3B,cAAM,IAAI,OAAO,KAAK,KAAK,MAAM,CAAC;AAClC,YAAI,MAAM,qBAAqB,MAAM,EAAE;AAAA,MACzC;AAAA,IACF,SAAS,KAAK;AACZ,UAAI,KAAK,2BAA2B,GAAG;AAAA,IACzC;AAAA,EACF;AACF;AAMO,SAAS,wBAAwB,OAA6B;AACnE,QAAM,QAAkB,CAAC;AACzB,QAAM,YAAY;AAElB,QAAM,KAAK,gBAAgB,MAAM,IAAI,MAAM;AAC3C,QAAM,KAAK,cAAc,MAAM,OAAO,EAAE;AACxC,QAAM,KAAK,cAAc,MAAM,OAAO,IAAI;AAC1C,MAAI,MAAM,WAAY,OAAM,KAAK,cAAc,MAAM,UAAU,EAAE;AACjE,QAAM,KAAK,EAAE;AAGb,MAAI,iBAAgC;AACpC,MAAI,MAAM,MAAM,SAAS,GAAG;AAC1B,QAAI,UAAU,MAAM,MAAM,CAAC;AAC3B,eAAW,KAAK,MAAM,OAAO;AAC3B,UAAI,EAAE,aAAa,QAAQ,WAAY,WAAU;AAAA,IACnD;AACA,qBAAiB,QAAQ;AAAA,EAC3B;AAGA,MAAI,MAAM,MAAM,SAAS,GAAG;AAC1B,UAAM,cAAc,KAAK,IAAI,GAAG,MAAM,MAAM,IAAI,CAAC,MAAM,EAAE,UAAU,GAAG,CAAC;AACvE,UAAM,KAAK,QAAQ;AACnB,eAAW,QAAQ,MAAM,OAAO;AAC9B,YAAM,SAAS,KAAK,IAAI,GAAG,KAAK,MAAO,KAAK,aAAa,cAAe,SAAS,CAAC;AAClF,YAAM,MAAM,SAAS,OAAO,MAAM;AAClC,YAAM,SAAS,KAAK,SAAS,iBAAiB,uBAAuB;AACrE,YAAM,KAAK,KAAK,KAAK,KAAK,OAAO,EAAE,CAAC,IAAI,OAAO,KAAK,UAAU,EAAE,SAAS,CAAC,CAAC,MAAM,GAAG,GAAG,MAAM,EAAE;AAAA,IACjG;AACA,UAAM,KAAK,EAAE;AAAA,EACf;AAGA,MAAI,MAAM,kBAAkB,MAAM,eAAe,SAAS,GAAG;AAC3D,UAAM,KAAK,kBAAkB;AAC7B,eAAW,SAAS,MAAM,gBAAgB;AACxC,YAAM,KAAK,KAAK,MAAM,IAAI,GAAG;AAC7B,YAAM,KAAK,sBAAsB,MAAM,MAAM,IAAI;AACjD,YAAM,aAAa,mBAAmB,KAAK;AAC3C,UAAI,eAAe,MAAM;AACvB,cAAM,KAAK,sBAAsB,UAAU,GAAG;AAAA,MAChD;AACA,iBAAW,UAAU,MAAM,SAAS;AAClC,cAAM,KAAK,QAAQ,OAAO,OAAO,aAAa,EAAE,SAAS,CAAC,CAAC,KAAK,OAAO,KAAK,OAAO,EAAE,CAAC,IAAI,OAAO,OAAO,UAAU,EAAE,SAAS,CAAC,CAAC,IAAI;AAAA,MACrI;AAAA,IACF;AACA,UAAM,KAAK,EAAE;AAAA,EACf;AAEA,QAAM,KAAK,KAAK;AAChB,SAAO,MAAM,KAAK,IAAI;AACxB;AAEA,SAAS,mBAAmB,OAA4C;AACtE,MAAI,MAAM,QAAQ,UAAU,EAAG,QAAO;AACtC,QAAM,UAAU,KAAK,IAAI,GAAG,MAAM,QAAQ,IAAI,CAAC,MAAM,EAAE,UAAU,CAAC;AAClE,MAAI,MAAM,WAAW,EAAG,QAAO;AAC/B,SAAO,KAAK,MAAO,UAAU,MAAM,SAAU,GAAG;AAClD;","names":[]}

package/dist/chunk-NMZY542O.js.map

@@ -1 +0,0 @@
-{"version":3,"sources":["../src/embedding-fallback.ts"],"sourcesContent":["import path from \"node:path\";\nimport { mkdir, readFile, writeFile } from \"node:fs/promises\";\nimport { log } from \"./logger.js\";\nimport { readEnvVar } from \"./runtime/env.js\";\nimport type { PluginConfig } from \"./types.js\";\n\ntype EmbeddingProviderType = \"openai\" | \"local\";\n\ntype ProviderConfig = {\n  type: EmbeddingProviderType;\n  model: string;\n  endpoint: string;\n  headers: Record<string, string>;\n};\n\ntype EmbeddingIndexEntry = {\n  vector: number[];\n  path: string;\n};\n\ntype EmbeddingIndexFile = {\n  version: 1;\n  provider: EmbeddingProviderType;\n  model: string;\n  entries: Record<string, EmbeddingIndexEntry>;\n};\n\nconst DEFAULT_OPENAI_MODEL = \"text-embedding-3-small\";\n\n/**\n * Thrown by `EmbeddingFallback.search()` (via `embed()`) when the embedding\n * backend is effectively unavailable on the lookup path — either because the\n * HTTP fetch exceeded its deadline OR because the endpoint returned a non-2xx\n * status code. Callers that need to distinguish a backend outage from \"no\n * candidates\" can `instanceof`-check against this class.\n *\n * Round 9 fix (Finding UZqB): previously a timeout returned null from embed(),\n * which caused search() to return [] silently. decideSemanticDedup then\n * classified the result as no_candidates instead of backend_unavailable, so\n * the per-batch batchBackendUnavailable short-circuit never activated and\n * batches of N facts each paid a full timeout roundtrip.\n *\n * Round 10 fix (Findings Ui1J + Ui1L): search() now only re-throws this error\n * when the caller explicitly passes `{ throwOnTimeout: true }`. Without that\n * flag search() catches it and returns [] instead, preserving fail-open\n * semantics for recall-path callers (searchEmbeddingFallback) that have no\n * try/catch. Only the semantic-dedup path (semanticDedupLookup) passes the\n * flag so it can still reach decideSemanticDedup's backend_unavailable branch.\n *\n * Round 11 fix (Finding Ur_J): `embed()` now also throws this error from the\n * lookup path when the HTTP response is non-2xx (e.g. 429, 500, 503). Without\n * this, repeated 5xx outages would each return null → [] → no_candidates and\n * subsequent facts in the same batch would all pay full roundtrips instead of\n * tripping the per-batch backend_unavailable short-circuit.\n *\n * The class name is kept for backward compatibility — `EmbeddingTimeoutError`\n * now signals \"lookup backend unavailable\" rather than strictly \"timed out\".\n */\nexport class EmbeddingTimeoutError extends Error {\n  override readonly name = \"EmbeddingTimeoutError\" as const;\n  constructor(message: string) {\n    super(message);\n  }\n}\n\n/**\n * Maximum time to wait for an embedding HTTP request on the LOOKUP/query\n * path before giving up.\n *\n * The write-time semantic dedup guard in orchestrator.persistExtraction()\n * blocks each candidate fact on an embedding lookup. If the embedding\n * endpoint hangs (degraded OpenAI, stalled local gateway, DNS timeout),\n * extraction would otherwise stall indefinitely — a single bad backend\n * could freeze the entire persist loop. Bounding the fetch here ensures\n * the decision path fails open (returns null) within a predictable window\n * and writes proceed as non-duplicates.\n *\n * Tests can override via REMNIC_EMBEDDING_FETCH_TIMEOUT_MS so they don't\n * have to wait the full default on hung-fetch assertions.\n *\n * Related: joshuaswarren/remnic#373, PR #399 P1/P2 review.\n */\nconst DEFAULT_EMBEDDING_LOOKUP_TIMEOUT_MS = 5000;\n\n/**\n * Maximum time to wait for an embedding HTTP request on the INDEX path.\n *\n * Indexing runs asynchronously after a memory has already been persisted\n * to disk. It does not block extraction or writes — it only updates the\n * embedding index used by later semantic dedup lookups. A slow local\n * CPU-backed embedding model can legitimately take tens of seconds per\n * call, so applying the short lookup timeout here silently dropped index\n * updates and caused later dedup lookups to miss recently persisted\n * memories. Use a much larger budget on this path.\n *\n * Tests can override via REMNIC_EMBEDDING_INDEX_TIMEOUT_MS.\n */\nconst DEFAULT_EMBEDDING_INDEX_TIMEOUT_MS = 120_000;\n\nfunction resolveEmbeddingLookupTimeoutMs(): number {\n  const raw = readEnvVar(\"REMNIC_EMBEDDING_FETCH_TIMEOUT_MS\");\n  if (raw) {\n    const parsed = Number(raw);\n    if (Number.isFinite(parsed) && parsed > 0) {\n      return Math.floor(parsed);\n    }\n  }\n  return DEFAULT_EMBEDDING_LOOKUP_TIMEOUT_MS;\n}\n\nfunction resolveEmbeddingIndexTimeoutMs(): number {\n  const raw = readEnvVar(\"REMNIC_EMBEDDING_INDEX_TIMEOUT_MS\");\n  if (raw) {\n    const parsed = Number(raw);\n    if (Number.isFinite(parsed) && parsed > 0) {\n      return Math.floor(parsed);\n    }\n  }\n  return DEFAULT_EMBEDDING_INDEX_TIMEOUT_MS;\n}\n\n/**\n * Options for the low-level embed() call.\n *\n * `mode` selects the timeout profile:\n *   - \"lookup\" (default): bounded by the short lookup budget; fails open fast.\n *   - \"index\": bounded by a much longer budget so slow backends can still\n *     index newly persisted memories.\n */\nexport type EmbedMode = \"lookup\" | \"index\";\n\nexport class EmbeddingFallback {\n  private readonly indexPath: string;\n  private loaded: EmbeddingIndexFile | null = null;\n\n  constructor(private readonly config: PluginConfig) {\n    this.indexPath = path.join(config.memoryDir, \"state\", \"embeddings.json\");\n  }\n\n  async isAvailable(): Promise<boolean> {\n    return (await this.resolveProvider()) !== null;\n  }\n\n  /**\n   * Embed an array of texts and return their embedding vectors.\n   *\n   * This is the public batch-embed interface used by semantic chunking\n   * (Finding 1, PR #420 post-merge). Texts are grouped into batches of\n   * `embeddingBatchSize` (from `semanticChunkingConfig`, default 32) and\n   * each batch is dispatched concurrently via `Promise.all()`. This\n   * preserves the semantic intent of `embeddingBatchSize` — without batching,\n   * every text incurred a sequential HTTP round-trip, making the batch size\n   * config ineffective. (PR #439 post-merge Finding 2.)\n   *\n   * If the provider is unavailable or any single embedding fails, the method\n   * throws so the caller can fall back to recursive chunking.\n   */\n  async embedTexts(texts: string[]): Promise<number[][]> {\n    const provider = await this.resolveProvider();\n    if (!provider) {\n      throw new Error(\"Embedding provider is not available\");\n    }\n\n    const batchSize = Math.max(\n      1,\n      this.config.semanticChunkingConfig?.embeddingBatchSize ?? 32,\n    );\n\n    const vectors: number[][] = [];\n    for (let i = 0; i < texts.length; i += batchSize) {\n      const batch = texts.slice(i, i + batchSize);\n      const batchResults = await Promise.all(\n        batch.map((text) => this.embed(text, provider, { mode: \"lookup\" })),\n      );\n      for (const vec of batchResults) {\n        if (!vec) {\n          throw new Error(\"Embedding returned null for input text\");\n        }\n        vectors.push(vec);\n      }\n    }\n    return vectors;\n  }\n\n  /**\n   * Nearest-neighbor search against the embedding index.\n   *\n   * @param query         The query string to embed and search for.\n   * @param limit         Max number of hits to return.\n   * @param options       Optional filters.\n   *   - `pathPrefix`   Restrict candidates to entries whose indexed `path`\n   *                    starts with this prefix (relative to `memoryDir`).\n   *                    Used by the semantic dedup guard to scope lookups\n   *                    to the target namespace so a high-similarity hit\n   *                    from a different namespace can't suppress a write\n   *                    in the target namespace. Default: no filter.\n   *   - `pathExcludePrefixes`\n   *                    Exclude any entry whose indexed `path` starts with\n   *                    any of these prefixes. Used for the default\n   *                    namespace case: when the default namespace lives at\n   *                    `memoryDir` root (legacy layout) we still want to\n   *                    exclude `namespaces/<other>/…` entries.\n   */\n  async search(\n    query: string,\n    limit: number,\n    options: {\n      pathPrefix?: string;\n      pathExcludePrefixes?: readonly string[];\n      /**\n       * When true, an `EmbeddingTimeoutError` from the embedding backend is\n       * re-thrown to the caller. Use this on the semantic-dedup path so\n       * `decideSemanticDedup`'s catch block can classify the result as\n       * `reason=\"backend_unavailable\"` and activate the per-batch\n       * short-circuit.\n       *\n       * When false (the default), a timeout is caught here and search()\n       * returns [] instead — preserving fail-open semantics for the recall\n       * path (`searchEmbeddingFallback`) which has no surrounding try/catch.\n       * Without this gate a timed-out embedding request on the recall path\n       * would propagate as an unhandled rejection and abort recall entirely.\n       * (Round 10 fix, Findings Ui1J + Ui1L.)\n       */\n      throwOnTimeout?: boolean;\n    } = {},\n  ): Promise<Array<{ id: string; score: number; path: string }>> {\n    const provider = await this.resolveProvider();\n    if (!provider) return [];\n\n    const index = await this.loadIndex(provider);\n    const ids = Object.keys(index.entries);\n    if (ids.length === 0) return [];\n\n    let queryVector: number[] | null;\n    try {\n      queryVector = await this.embed(query, provider, { mode: \"lookup\" });\n    } catch (err) {\n      if (err instanceof EmbeddingTimeoutError) {\n        if (options.throwOnTimeout) {\n          throw err;\n        }\n        // Fail-open: recall-path callers get an empty result rather than an\n        // unhandled rejection that would abort recall entirely.\n        log.debug(\"embedding fallback search: timeout on lookup, returning [] (throwOnTimeout=false)\");\n        return [];\n      }\n      throw err;\n    }\n    if (!queryVector) return [];\n\n    const includePrefix = normalizePathPrefix(options.pathPrefix);\n    const excludePrefixes = (options.pathExcludePrefixes ?? [])\n      .map((p) => normalizePathPrefix(p))\n      .filter((p): p is string => typeof p === \"string\");\n\n    const scored = ids\n      .map((id) => {\n        const entry = index.entries[id];\n        return {\n          id,\n          path: entry.path,\n          score: cosineSimilarity(queryVector, entry.vector),\n        };\n      })\n      .filter((r) => {\n        if (!Number.isFinite(r.score)) return false;\n        const normalized = normalizeEntryPath(r.path);\n        if (includePrefix !== undefined && !normalized.startsWith(includePrefix)) {\n          return false;\n        }\n        for (const excl of excludePrefixes) {\n          if (normalized.startsWith(excl)) return false;\n        }\n        return true;\n      })\n      .sort((a, b) => b.score - a.score)\n      .slice(0, Math.max(1, limit));\n\n    return scored;\n  }\n\n  async indexFile(memoryId: string, content: string, filePath: string): Promise<void> {\n    const provider = await this.resolveProvider();\n    if (!provider) return;\n    // Indexing is not on the write-critical path: a newly persisted memory\n    // has already been written to disk by the time we reach this call. Use\n    // the long \"index\" timeout so slow local embedding backends can still\n    // add the entry to the index. Previously this used the short lookup\n    // budget and silently dropped updates, leaving later dedup lookups\n    // blind to the memory. Related: PR #399 P2.\n    const vector = await this.embed(content, provider, { mode: \"index\" });\n    if (!vector) return;\n\n    const index = await this.loadIndex(provider);\n    const relPath = toMemoryRelativePath(this.config.memoryDir, filePath);\n    index.entries[memoryId] = {\n      vector,\n      path: relPath,\n    };\n    await this.saveIndex(index);\n  }\n\n  async removeFromIndex(memoryId: string): Promise<void> {\n    const provider = await this.resolveProvider();\n    if (!provider) return;\n\n    const index = await this.loadIndex(provider);\n    if (!index.entries[memoryId]) return;\n    delete index.entries[memoryId];\n    await this.saveIndex(index);\n  }\n\n  private async resolveProvider(): Promise<ProviderConfig | null> {\n    if (!this.config.embeddingFallbackEnabled) return null;\n\n    const preferred = this.config.embeddingFallbackProvider;\n    const providers = preferred === \"auto\" ? [\"openai\", \"local\"] : [preferred];\n\n    for (const p of providers) {\n      if (p === \"openai\" && this.config.openaiApiKey) {\n        const baseUrl = this.config.openaiBaseUrl ?? \"https://api.openai.com/v1\";\n        return {\n          type: \"openai\",\n          model: DEFAULT_OPENAI_MODEL,\n          endpoint: `${baseUrl.replace(/\\/$/, \"\")}/embeddings`,\n          headers: {\n            \"Content-Type\": \"application/json\",\n            Authorization: `Bearer ${this.config.openaiApiKey}`,\n          },\n        };\n      }\n\n      if (p === \"local\" && this.config.localLlmEnabled && this.config.localLlmUrl) {\n        const base = this.config.localLlmUrl.replace(/\\/$/, \"\");\n        const endpoint = /\\/v1$/i.test(base) ? `${base}/embeddings` : `${base}/v1/embeddings`;\n        const headers: Record<string, string> = {\n          \"Content-Type\": \"application/json\",\n          ...(this.config.localLlmHeaders ?? {}),\n        };\n        if (this.config.localLlmApiKey && this.config.localLlmAuthHeader !== false) {\n          headers.Authorization = `Bearer ${this.config.localLlmApiKey}`;\n        }\n        return {\n          type: \"local\",\n          model:\n            this.config.embeddingFallbackModel ||\n            this.config.localLlmModel ||\n            DEFAULT_OPENAI_MODEL,\n          endpoint,\n          headers,\n        };\n      }\n    }\n\n    return null;\n  }\n\n  private async embed(\n    input: string,\n    provider: ProviderConfig,\n    options: { mode?: EmbedMode } = {},\n  ): Promise<number[] | null> {\n    // Bound the fetch so a hung embedding endpoint cannot stall callers.\n    // The lookup path uses a short budget (see DEFAULT_EMBEDDING_LOOKUP_TIMEOUT_MS\n    // docblock) so semantic dedup fails open fast. The index path uses a\n    // much longer budget because slow local backends (CPU embedding models)\n    // otherwise drop index updates and blind later dedup lookups. See\n    // DEFAULT_EMBEDDING_INDEX_TIMEOUT_MS docblock and PR #399 P2 review.\n    const mode: EmbedMode = options.mode ?? \"lookup\";\n    const timeoutMs =\n      mode === \"index\"\n        ? resolveEmbeddingIndexTimeoutMs()\n        : resolveEmbeddingLookupTimeoutMs();\n    try {\n      const res = await fetch(provider.endpoint, {\n        method: \"POST\",\n        headers: provider.headers,\n        body: JSON.stringify({\n          model: provider.model,\n          input: input.slice(0, 8000),\n          encoding_format: \"float\",\n        }),\n        signal: AbortSignal.timeout(timeoutMs),\n      });\n      if (!res.ok) {\n        log.debug(`embedding fallback request failed: ${provider.type} ${res.status}`);\n        // Round 11 fix (Finding Ur_J): on the LOOKUP path, a non-2xx response\n        // means the embedding backend is effectively unavailable. Throw the\n        // tagged error so search() (when called with throwOnTimeout) propagates\n        // to decideSemanticDedup's backend_unavailable branch, activating the\n        // per-batch short-circuit. Without this, repeated 429/5xx responses\n        // would silently return [] for every fact in the batch.\n        //\n        // On the INDEX path a non-2xx is non-fatal (the memory is already\n        // persisted; index update can be skipped) — return null there.\n        if (mode === \"lookup\") {\n          throw new EmbeddingTimeoutError(\n            `embedding backend returned ${res.status} (${provider.type})`,\n          );\n        }\n        return null;\n      }\n      const payload = (await res.json()) as any;\n      const vector = payload?.data?.[0]?.embedding;\n      if (!Array.isArray(vector)) return null;\n      return vector.map((n: unknown) => Number(n)).filter((n: number) => Number.isFinite(n));\n    } catch (err) {\n      // Round 11 (Finding Ur_J): the !res.ok branch above throws\n      // EmbeddingTimeoutError directly. Re-throw it here so the catch does\n      // not swallow our own intentional signal back into a null return.\n      if (err instanceof EmbeddingTimeoutError) {\n        throw err;\n      }\n      // AbortSignal.timeout throws a DOMException with name \"TimeoutError\";\n      // surface at warn level so operators can distinguish slow backends from\n      // generic errors.\n      const isTimeout =\n        err instanceof Error &&\n        (err.name === \"TimeoutError\" || err.name === \"AbortError\");\n      if (isTimeout) {\n        log.warn(\n          `embedding fallback fetch timed out after ${timeoutMs}ms (${provider.type}, mode=${mode})`,\n        );\n        // Round 9 fix (Finding UZqB): on the LOOKUP path a timeout means the\n        // embedding backend is effectively unavailable — re-throw so that\n        // search() propagates the error to semanticDedupLookup, which lets it\n        // reach decideSemanticDedup's catch block and return\n        // reason=\"backend_unavailable\". Without this, search() would silently\n        // return [] and the per-batch batchBackendUnavailable flag would never\n        // flip, causing subsequent facts in the same batch to each pay a full\n        // timeout roundtrip (N × timeout instead of 1 × timeout).\n        //\n        // On the INDEX path a timeout is not fatal (the memory is already\n        // persisted; index update can be skipped) — return null there so\n        // indexFile() stays non-blocking.\n        if (mode === \"lookup\") {\n          throw new EmbeddingTimeoutError(\n            `embedding backend timed out after ${timeoutMs}ms (${provider.type})`,\n          );\n        }\n      } else {\n        // Round 12 fix (PR #399 thread PRRT_kwDORJXyws56U6Gi): non-timeout\n        // transport failures (ECONNREFUSED, DNS errors, TLS failures) are just\n        // as fatal as timeouts on the LOOKUP path — the embedding backend is\n        // effectively unreachable. Throw EmbeddingTimeoutError so that\n        // search() (when called with throwOnTimeout:true) propagates the error\n        // to decideSemanticDedup's backend_unavailable branch, activating the\n        // per-batch short-circuit. Without this, each fact in the batch would\n        // pay a full ECONNREFUSED roundtrip and return null → [] → no_candidates,\n        // preventing batchBackendUnavailable from ever being set.\n        //\n        // On the INDEX path a transport failure is non-fatal — the memory is\n        // already persisted; index update can be safely skipped.\n        if (mode === \"lookup\") {\n          log.warn(\n            `embedding fallback transport error on lookup path (${provider.type}): ${err}`,\n          );\n          throw new EmbeddingTimeoutError(\n            `embedding backend transport failure (${provider.type}): ${err instanceof Error ? err.message : String(err)}`,\n          );\n        }\n        log.debug(`embedding fallback error: ${err}`);\n      }\n      return null;\n    }\n  }\n\n  private async loadIndex(provider: ProviderConfig): Promise<EmbeddingIndexFile> {\n    if (this.loaded && this.loaded.provider === provider.type && this.loaded.model === provider.model) {\n      return this.loaded;\n    }\n\n    try {\n      const raw = await readFile(this.indexPath, \"utf-8\");\n      const parsed = JSON.parse(raw) as EmbeddingIndexFile;\n      if (parsed && parsed.version === 1 && parsed.entries && typeof parsed.entries === \"object\") {\n        this.loaded = {\n          version: 1,\n          provider: provider.type,\n          model: provider.model,\n          entries: parsed.entries,\n        };\n        return this.loaded;\n      }\n    } catch {\n      // ignore and create a new index\n    }\n\n    this.loaded = {\n      version: 1,\n      provider: provider.type,\n      model: provider.model,\n      entries: {},\n    };\n    return this.loaded;\n  }\n\n  private async saveIndex(index: EmbeddingIndexFile): Promise<void> {\n    await mkdir(path.dirname(this.indexPath), { recursive: true });\n    await writeFile(this.indexPath, JSON.stringify(index), \"utf-8\");\n    this.loaded = index;\n  }\n}\n\nfunction toMemoryRelativePath(memoryDir: string, filePath: string): string {\n  if (!path.isAbsolute(filePath)) return filePath;\n  const rel = path.relative(memoryDir, filePath);\n  return rel.startsWith(\"..\") ? filePath : rel;\n}\n\n/**\n * Normalize an index entry path to forward-slashes for stable prefix\n * comparison. Entries are stored as `path.relative(memoryDir, …)` output,\n * which on Windows uses back-slashes. Normalize both sides so prefix\n * matching is OS-independent.\n *\n * Also strip a leading `./` so this helper's output is symmetric with\n * `normalizePathPrefix` below. `toMemoryRelativePath` is a pass-through for\n * non-absolute filePath inputs, so an index entry could legitimately carry a\n * stored path like `\"./namespaces/alpha/facts/f.md\"`. Without this strip, a\n * caller-supplied prefix `\"./namespaces/alpha\"` (which `normalizePathPrefix`\n * rewrites to `\"namespaces/alpha/\"`) would silently miss that entry and\n * namespace-scoped dedup would either let a near-duplicate through or fail\n * to exclude a cross-namespace hit.\n */\nfunction normalizeEntryPath(p: string): string {\n  let out = p.replace(/\\\\/g, \"/\");\n  if (out.startsWith(\"./\")) out = out.slice(2);\n  return out;\n}\n\n/**\n * Normalize a caller-supplied path prefix:\n *   - Return `undefined` for nullish/empty input (no filter).\n *   - Replace back-slashes with forward-slashes.\n *   - Strip a leading `./`.\n *   - Ensure a trailing `/` so `\"namespaces/a\"` doesn't accidentally match\n *     `\"namespaces/another/…\"`.\n */\nfunction normalizePathPrefix(prefix: string | undefined): string | undefined {\n  if (prefix === undefined || prefix === null) return undefined;\n  let p = String(prefix).replace(/\\\\/g, \"/\");\n  if (p.startsWith(\"./\")) p = p.slice(2);\n  if (p.length === 0) return undefined;\n  if (!p.endsWith(\"/\")) p = `${p}/`;\n  return p;\n}\n\nfunction cosineSimilarity(a: number[], b: number[]): number {\n  const n = Math.min(a.length, b.length);\n  if (n === 0) return 0;\n  let dot = 0;\n  let normA = 0;\n  let normB = 0;\n  for (let i = 0; i < n; i++) {\n    const av = a[i] ?? 0;\n    const bv = b[i] ?? 0;\n    dot += av * bv;\n    normA += av * av;\n    normB += bv * bv;\n  }\n  const denom = Math.sqrt(normA) * Math.sqrt(normB);\n  if (denom === 0) return 0;\n  return dot / denom;\n}\n"],"mappings":";;;;;;;;AAAA,OAAO,UAAU;AACjB,SAAS,OAAO,UAAU,iBAAiB;AA0B3C,IAAM,uBAAuB;AA+BtB,IAAM,wBAAN,cAAoC,MAAM;AAAA,EAC7B,OAAO;AAAA,EACzB,YAAY,SAAiB;AAC3B,UAAM,OAAO;AAAA,EACf;AACF;AAmBA,IAAM,sCAAsC;AAe5C,IAAM,qCAAqC;AAE3C,SAAS,kCAA0C;AACjD,QAAM,MAAM,WAAW,mCAAmC;AAC1D,MAAI,KAAK;AACP,UAAM,SAAS,OAAO,GAAG;AACzB,QAAI,OAAO,SAAS,MAAM,KAAK,SAAS,GAAG;AACzC,aAAO,KAAK,MAAM,MAAM;AAAA,IAC1B;AAAA,EACF;AACA,SAAO;AACT;AAEA,SAAS,iCAAyC;AAChD,QAAM,MAAM,WAAW,mCAAmC;AAC1D,MAAI,KAAK;AACP,UAAM,SAAS,OAAO,GAAG;AACzB,QAAI,OAAO,SAAS,MAAM,KAAK,SAAS,GAAG;AACzC,aAAO,KAAK,MAAM,MAAM;AAAA,IAC1B;AAAA,EACF;AACA,SAAO;AACT;AAYO,IAAM,oBAAN,MAAwB;AAAA,EAI7B,YAA6B,QAAsB;AAAtB;AAC3B,SAAK,YAAY,KAAK,KAAK,OAAO,WAAW,SAAS,iBAAiB;AAAA,EACzE;AAAA,EAF6B;AAAA,EAHZ;AAAA,EACT,SAAoC;AAAA,EAM5C,MAAM,cAAgC;AACpC,WAAQ,MAAM,KAAK,gBAAgB,MAAO;AAAA,EAC5C;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAgBA,MAAM,WAAW,OAAsC;AACrD,UAAM,WAAW,MAAM,KAAK,gBAAgB;AAC5C,QAAI,CAAC,UAAU;AACb,YAAM,IAAI,MAAM,qCAAqC;AAAA,IACvD;AAEA,UAAM,YAAY,KAAK;AAAA,MACrB;AAAA,MACA,KAAK,OAAO,wBAAwB,sBAAsB;AAAA,IAC5D;AAEA,UAAM,UAAsB,CAAC;AAC7B,aAAS,IAAI,GAAG,IAAI,MAAM,QAAQ,KAAK,WAAW;AAChD,YAAM,QAAQ,MAAM,MAAM,GAAG,IAAI,SAAS;AAC1C,YAAM,eAAe,MAAM,QAAQ;AAAA,QACjC,MAAM,IAAI,CAAC,SAAS,KAAK,MAAM,MAAM,UAAU,EAAE,MAAM,SAAS,CAAC,CAAC;AAAA,MACpE;AACA,iBAAW,OAAO,cAAc;AAC9B,YAAI,CAAC,KAAK;AACR,gBAAM,IAAI,MAAM,wCAAwC;AAAA,QAC1D;AACA,gBAAQ,KAAK,GAAG;AAAA,MAClB;AAAA,IACF;AACA,WAAO;AAAA,EACT;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAqBA,MAAM,OACJ,OACA,OACA,UAkBI,CAAC,GACwD;AAC7D,UAAM,WAAW,MAAM,KAAK,gBAAgB;AAC5C,QAAI,CAAC,SAAU,QAAO,CAAC;AAEvB,UAAM,QAAQ,MAAM,KAAK,UAAU,QAAQ;AAC3C,UAAM,MAAM,OAAO,KAAK,MAAM,OAAO;AACrC,QAAI,IAAI,WAAW,EAAG,QAAO,CAAC;AAE9B,QAAI;AACJ,QAAI;AACF,oBAAc,MAAM,KAAK,MAAM,OAAO,UAAU,EAAE,MAAM,SAAS,CAAC;AAAA,IACpE,SAAS,KAAK;AACZ,UAAI,eAAe,uBAAuB;AACxC,YAAI,QAAQ,gBAAgB;AAC1B,gBAAM;AAAA,QACR;AAGA,YAAI,MAAM,mFAAmF;AAC7F,eAAO,CAAC;AAAA,MACV;AACA,YAAM;AAAA,IACR;AACA,QAAI,CAAC,YAAa,QAAO,CAAC;AAE1B,UAAM,gBAAgB,oBAAoB,QAAQ,UAAU;AAC5D,UAAM,mBAAmB,QAAQ,uBAAuB,CAAC,GACtD,IAAI,CAAC,MAAM,oBAAoB,CAAC,CAAC,EACjC,OAAO,CAAC,MAAmB,OAAO,MAAM,QAAQ;AAEnD,UAAM,SAAS,IACZ,IAAI,CAAC,OAAO;AACX,YAAM,QAAQ,MAAM,QAAQ,EAAE;AAC9B,aAAO;AAAA,QACL;AAAA,QACA,MAAM,MAAM;AAAA,QACZ,OAAO,iBAAiB,aAAa,MAAM,MAAM;AAAA,MACnD;AAAA,IACF,CAAC,EACA,OAAO,CAAC,MAAM;AACb,UAAI,CAAC,OAAO,SAAS,EAAE,KAAK,EAAG,QAAO;AACtC,YAAM,aAAa,mBAAmB,EAAE,IAAI;AAC5C,UAAI,kBAAkB,UAAa,CAAC,WAAW,WAAW,aAAa,GAAG;AACxE,eAAO;AAAA,MACT;AACA,iBAAW,QAAQ,iBAAiB;AAClC,YAAI,WAAW,WAAW,IAAI,EAAG,QAAO;AAAA,MAC1C;AACA,aAAO;AAAA,IACT,CAAC,EACA,KAAK,CAAC,GAAG,MAAM,EAAE,QAAQ,EAAE,KAAK,EAChC,MAAM,GAAG,KAAK,IAAI,GAAG,KAAK,CAAC;AAE9B,WAAO;AAAA,EACT;AAAA,EAEA,MAAM,UAAU,UAAkB,SAAiB,UAAiC;AAClF,UAAM,WAAW,MAAM,KAAK,gBAAgB;AAC5C,QAAI,CAAC,SAAU;AAOf,UAAM,SAAS,MAAM,KAAK,MAAM,SAAS,UAAU,EAAE,MAAM,QAAQ,CAAC;AACpE,QAAI,CAAC,OAAQ;AAEb,UAAM,QAAQ,MAAM,KAAK,UAAU,QAAQ;AAC3C,UAAM,UAAU,qBAAqB,KAAK,OAAO,WAAW,QAAQ;AACpE,UAAM,QAAQ,QAAQ,IAAI;AAAA,MACxB;AAAA,MACA,MAAM;AAAA,IACR;AACA,UAAM,KAAK,UAAU,KAAK;AAAA,EAC5B;AAAA,EAEA,MAAM,gBAAgB,UAAiC;AACrD,UAAM,WAAW,MAAM,KAAK,gBAAgB;AAC5C,QAAI,CAAC,SAAU;AAEf,UAAM,QAAQ,MAAM,KAAK,UAAU,QAAQ;AAC3C,QAAI,CAAC,MAAM,QAAQ,QAAQ,EAAG;AAC9B,WAAO,MAAM,QAAQ,QAAQ;AAC7B,UAAM,KAAK,UAAU,KAAK;AAAA,EAC5B;AAAA,EAEA,MAAc,kBAAkD;AAC9D,QAAI,CAAC,KAAK,OAAO,yBAA0B,QAAO;AAElD,UAAM,YAAY,KAAK,OAAO;AAC9B,UAAM,YAAY,cAAc,SAAS,CAAC,UAAU,OAAO,IAAI,CAAC,SAAS;AAEzE,eAAW,KAAK,WAAW;AACzB,UAAI,MAAM,YAAY,KAAK,OAAO,cAAc;AAC9C,cAAM,UAAU,KAAK,OAAO,iBAAiB;AAC7C,eAAO;AAAA,UACL,MAAM;AAAA,UACN,OAAO;AAAA,UACP,UAAU,GAAG,QAAQ,QAAQ,OAAO,EAAE,CAAC;AAAA,UACvC,SAAS;AAAA,YACP,gBAAgB;AAAA,YAChB,eAAe,UAAU,KAAK,OAAO,YAAY;AAAA,UACnD;AAAA,QACF;AAAA,MACF;AAEA,UAAI,MAAM,WAAW,KAAK,OAAO,mBAAmB,KAAK,OAAO,aAAa;AAC3E,cAAM,OAAO,KAAK,OAAO,YAAY,QAAQ,OAAO,EAAE;AACtD,cAAM,WAAW,SAAS,KAAK,IAAI,IAAI,GAAG,IAAI,gBAAgB,GAAG,IAAI;AACrE,cAAM,UAAkC;AAAA,UACtC,gBAAgB;AAAA,UAChB,GAAI,KAAK,OAAO,mBAAmB,CAAC;AAAA,QACtC;AACA,YAAI,KAAK,OAAO,kBAAkB,KAAK,OAAO,uBAAuB,OAAO;AAC1E,kBAAQ,gBAAgB,UAAU,KAAK,OAAO,cAAc;AAAA,QAC9D;AACA,eAAO;AAAA,UACL,MAAM;AAAA,UACN,OACE,KAAK,OAAO,0BACZ,KAAK,OAAO,iBACZ;AAAA,UACF;AAAA,UACA;AAAA,QACF;AAAA,MACF;AAAA,IACF;AAEA,WAAO;AAAA,EACT;AAAA,EAEA,MAAc,MACZ,OACA,UACA,UAAgC,CAAC,GACP;AAO1B,UAAM,OAAkB,QAAQ,QAAQ;AACxC,UAAM,YACJ,SAAS,UACL,+BAA+B,IAC/B,gCAAgC;AACtC,QAAI;AACF,YAAM,MAAM,MAAM,MAAM,SAAS,UAAU;AAAA,QACzC,QAAQ;AAAA,QACR,SAAS,SAAS;AAAA,QAClB,MAAM,KAAK,UAAU;AAAA,UACnB,OAAO,SAAS;AAAA,UAChB,OAAO,MAAM,MAAM,GAAG,GAAI;AAAA,UAC1B,iBAAiB;AAAA,QACnB,CAAC;AAAA,QACD,QAAQ,YAAY,QAAQ,SAAS;AAAA,MACvC,CAAC;AACD,UAAI,CAAC,IAAI,IAAI;AACX,YAAI,MAAM,sCAAsC,SAAS,IAAI,IAAI,IAAI,MAAM,EAAE;AAU7E,YAAI,SAAS,UAAU;AACrB,gBAAM,IAAI;AAAA,YACR,8BAA8B,IAAI,MAAM,KAAK,SAAS,IAAI;AAAA,UAC5D;AAAA,QACF;AACA,eAAO;AAAA,MACT;AACA,YAAM,UAAW,MAAM,IAAI,KAAK;AAChC,YAAM,SAAS,SAAS,OAAO,CAAC,GAAG;AACnC,UAAI,CAAC,MAAM,QAAQ,MAAM,EAAG,QAAO;AACnC,aAAO,OAAO,IAAI,CAAC,MAAe,OAAO,CAAC,CAAC,EAAE,OAAO,CAAC,MAAc,OAAO,SAAS,CAAC,CAAC;AAAA,IACvF,SAAS,KAAK;AAIZ,UAAI,eAAe,uBAAuB;AACxC,cAAM;AAAA,MACR;AAIA,YAAM,YACJ,eAAe,UACd,IAAI,SAAS,kBAAkB,IAAI,SAAS;AAC/C,UAAI,WAAW;AACb,YAAI;AAAA,UACF,4CAA4C,SAAS,OAAO,SAAS,IAAI,UAAU,IAAI;AAAA,QACzF;AAaA,YAAI,SAAS,UAAU;AACrB,gBAAM,IAAI;AAAA,YACR,qCAAqC,SAAS,OAAO,SAAS,IAAI;AAAA,UACpE;AAAA,QACF;AAAA,MACF,OAAO;AAaL,YAAI,SAAS,UAAU;AACrB,cAAI;AAAA,YACF,sDAAsD,SAAS,IAAI,MAAM,GAAG;AAAA,UAC9E;AACA,gBAAM,IAAI;AAAA,YACR,wCAAwC,SAAS,IAAI,MAAM,eAAe,QAAQ,IAAI,UAAU,OAAO,GAAG,CAAC;AAAA,UAC7G;AAAA,QACF;AACA,YAAI,MAAM,6BAA6B,GAAG,EAAE;AAAA,MAC9C;AACA,aAAO;AAAA,IACT;AAAA,EACF;AAAA,EAEA,MAAc,UAAU,UAAuD;AAC7E,QAAI,KAAK,UAAU,KAAK,OAAO,aAAa,SAAS,QAAQ,KAAK,OAAO,UAAU,SAAS,OAAO;AACjG,aAAO,KAAK;AAAA,IACd;AAEA,QAAI;AACF,YAAM,MAAM,MAAM,SAAS,KAAK,WAAW,OAAO;AAClD,YAAM,SAAS,KAAK,MAAM,GAAG;AAC7B,UAAI,UAAU,OAAO,YAAY,KAAK,OAAO,WAAW,OAAO,OAAO,YAAY,UAAU;AAC1F,aAAK,SAAS;AAAA,UACZ,SAAS;AAAA,UACT,UAAU,SAAS;AAAA,UACnB,OAAO,SAAS;AAAA,UAChB,SAAS,OAAO;AAAA,QAClB;AACA,eAAO,KAAK;AAAA,MACd;AAAA,IACF,QAAQ;AAAA,IAER;AAEA,SAAK,SAAS;AAAA,MACZ,SAAS;AAAA,MACT,UAAU,SAAS;AAAA,MACnB,OAAO,SAAS;AAAA,MAChB,SAAS,CAAC;AAAA,IACZ;AACA,WAAO,KAAK;AAAA,EACd;AAAA,EAEA,MAAc,UAAU,OAA0C;AAChE,UAAM,MAAM,KAAK,QAAQ,KAAK,SAAS,GAAG,EAAE,WAAW,KAAK,CAAC;AAC7D,UAAM,UAAU,KAAK,WAAW,KAAK,UAAU,KAAK,GAAG,OAAO;AAC9D,SAAK,SAAS;AAAA,EAChB;AACF;AAEA,SAAS,qBAAqB,WAAmB,UAA0B;AACzE,MAAI,CAAC,KAAK,WAAW,QAAQ,EAAG,QAAO;AACvC,QAAM,MAAM,KAAK,SAAS,WAAW,QAAQ;AAC7C,SAAO,IAAI,WAAW,IAAI,IAAI,WAAW;AAC3C;AAiBA,SAAS,mBAAmB,GAAmB;AAC7C,MAAI,MAAM,EAAE,QAAQ,OAAO,GAAG;AAC9B,MAAI,IAAI,WAAW,IAAI,EAAG,OAAM,IAAI,MAAM,CAAC;AAC3C,SAAO;AACT;AAUA,SAAS,oBAAoB,QAAgD;AAC3E,MAAI,WAAW,UAAa,WAAW,KAAM,QAAO;AACpD,MAAI,IAAI,OAAO,MAAM,EAAE,QAAQ,OAAO,GAAG;AACzC,MAAI,EAAE,WAAW,IAAI,EAAG,KAAI,EAAE,MAAM,CAAC;AACrC,MAAI,EAAE,WAAW,EAAG,QAAO;AAC3B,MAAI,CAAC,EAAE,SAAS,GAAG,EAAG,KAAI,GAAG,CAAC;AAC9B,SAAO;AACT;AAEA,SAAS,iBAAiB,GAAa,GAAqB;AAC1D,QAAM,IAAI,KAAK,IAAI,EAAE,QAAQ,EAAE,MAAM;AACrC,MAAI,MAAM,EAAG,QAAO;AACpB,MAAI,MAAM;AACV,MAAI,QAAQ;AACZ,MAAI,QAAQ;AACZ,WAAS,IAAI,GAAG,IAAI,GAAG,KAAK;AAC1B,UAAM,KAAK,EAAE,CAAC,KAAK;AACnB,UAAM,KAAK,EAAE,CAAC,KAAK;AACnB,WAAO,KAAK;AACZ,aAAS,KAAK;AACd,aAAS,KAAK;AAAA,EAChB;AACA,QAAM,QAAQ,KAAK,KAAK,KAAK,IAAI,KAAK,KAAK,KAAK;AAChD,MAAI,UAAU,EAAG,QAAO;AACxB,SAAO,MAAM;AACf;","names":[]}

package/dist/chunk-NZL6GGQE.js.map

@@ -1 +0,0 @@
-{"version":3,"sources":["../src/boxes.ts"],"sourcesContent":["/**\n * Memory Boxes + Trace Weaving (v8.0 Phase 2A)\n *\n * Implements the Membox concept: a sliding topic window that forms an \"open box\"\n * accumulating related memories. The box is sealed on topic shift or time gap,\n * then written to memory/boxes/YYYY-MM-DD/box-<id>.md.\n *\n * Trace Weaving links recurring topic boxes with a shared traceId so that\n * cross-session continuity on the same topics is preserved and discoverable.\n */\n\nimport { mkdir, writeFile, readFile, readdir } from \"node:fs/promises\";\nimport type { Dirent } from \"node:fs\";\nimport path from \"node:path\";\nimport { createHash } from \"node:crypto\";\nimport { log } from \"./logger.js\";\n\nexport const BOX_DIR = \"boxes\";\nconst STATE_DIR = \"state\";\nconst TRACES_FILE = \"traces.json\";\nconst OPEN_BOX_STATE_FILE = \"open-box.json\";\n\n// ── Types ─────────────────────────────────────────────────────────────────\n\nexport interface BoxFrontmatter {\n  id: string;\n  memoryKind: \"box\";\n  createdAt: string;\n  sealedAt: string;\n  sealReason: SealReason;\n  sessionKey?: string;\n  topics: string[];\n  memoryIds: string[];\n  traceId?: string;\n  /** High-level task goal for this episode (REMem-inspired). */\n  goal?: string;\n  /** Tools invoked during this episode. */\n  toolsUsed?: string[];\n  /** Episode outcome: success, failure, partial, or unknown. */\n  outcome?: \"success\" | \"failure\" | \"partial\" | \"unknown\";\n}\n\nexport type SealReason = \"topic_shift\" | \"time_gap\" | \"max_memories\" | \"forced\" | \"flush\";\n\ninterface OpenBoxState {\n  id: string;\n  createdAt: string;\n  lastActivityAt: string;\n  topics: string[];\n  memoryIds: string[];\n  goal?: string;\n  toolsUsed?: string[];\n}\n\ninterface TraceIndex {\n  /** traceId → list of box IDs */\n  traces: Record<string, string[]>;\n  /** boxId → traceId */\n  boxToTrace: Record<string, string>;\n  /** traceId → canonical topic fingerprint for matching */\n  traceTopics: Record<string, string[]>;\n  /** traceId → ISO timestamp of last box added (for lookback filtering) */\n  traceLastSeen: Record<string, string>;\n}\n\nexport interface BoxBuilderConfig {\n  memoryBoxesEnabled: boolean;\n  traceWeaverEnabled: boolean;\n  /** Jaccard threshold below which topic shift triggers seal (0-1, default 0.35) */\n  boxTopicShiftThreshold: number;\n  /** Time gap in ms before sealing an open box (default 30 min) */\n  boxTimeGapMs: number;\n  /** Max memories in one box before forced seal */\n  boxMaxMemories: number;\n  /** Days back to look for trace links */\n  traceWeaverLookbackDays: number;\n  /** Minimum topic overlap to assign same traceId (0-1, default 0.4) */\n  traceWeaverOverlapThreshold: number;\n}\n\ninterface ExtractionEvent {\n  topics: string[];\n  memoryIds: string[];\n  timestamp: string;\n  goal?: string;\n  toolsUsed?: string[];\n}\n\n// ── Utility ───────────────────────────────────────────────────────────────\n\n/**\n * Jaccard similarity between two topic arrays.\n * Returns 0.0 for empty inputs.\n */\nexport function topicOverlapScore(a: string[], b: string[]): number {\n  if (a.length === 0 || b.length === 0) return 0.0;\n  const setA = new Set(a.map((t) => t.toLowerCase()));\n  const setB = new Set(b.map((t) => t.toLowerCase()));\n  const intersection = [...setA].filter((t) => setB.has(t)).length;\n  const union = new Set([...setA, ...setB]).size;\n  return union === 0 ? 0.0 : intersection / union;\n}\n\nfunction makeBoxId(): string {\n  return `box-${Date.now()}-${Math.random().toString(36).slice(2, 6)}`;\n}\n\nfunction makeTraceId(topics: string[]): string {\n  const key = topics.slice().sort().join(\",\");\n  return `trace-${createHash(\"sha256\").update(key).digest(\"hex\").slice(0, 8)}`;\n}\n\n// ── Frontmatter serialization ──────────────────────────────────────────────\n\nfunction serializeBoxFrontmatter(fm: BoxFrontmatter): string {\n  const lines = [\n    \"---\",\n    `id: ${fm.id}`,\n    `memoryKind: ${fm.memoryKind}`,\n    `createdAt: ${fm.createdAt}`,\n    `sealedAt: ${fm.sealedAt}`,\n    `sealReason: ${fm.sealReason}`,\n    `topics: [${fm.topics.map((t) => `\"${t}\"`).join(\", \")}]`,\n    `memoryIds: [${fm.memoryIds.map((m) => `\"${m}\"`).join(\", \")}]`,\n  ];\n  if (fm.sessionKey) lines.push(`sessionKey: ${fm.sessionKey}`);\n  if (fm.traceId) lines.push(`traceId: ${fm.traceId}`);\n  if (fm.goal) lines.push(`goal: ${fm.goal.replace(/[\\r\\n]+/g, \" \")}`);\n  if (fm.toolsUsed?.length) lines.push(`toolsUsed: [${fm.toolsUsed.map((t) => `\"${t}\"`).join(\", \")}]`);\n  if (fm.outcome) lines.push(`outcome: ${fm.outcome}`);\n  lines.push(\"---\");\n  return lines.join(\"\\n\");\n}\n\nexport function parseBoxFrontmatter(raw: string): BoxFrontmatter | null {\n  const match = raw.match(/^---\\n([\\s\\S]*?)\\n---/);\n  if (!match) return null;\n\n  const fmBlock = match[1];\n  const fm: Record<string, string> = {};\n  for (const line of fmBlock.split(\"\\n\")) {\n    const colonIdx = line.indexOf(\":\");\n    if (colonIdx === -1) continue;\n    fm[line.slice(0, colonIdx).trim()] = line.slice(colonIdx + 1).trim();\n  }\n\n  const parseArray = (val: string | undefined): string[] => {\n    if (!val) return [];\n    const m = val.match(/\\[(.*)]/);\n    if (!m) return [];\n    return m[1].split(\",\").map((s) => s.trim().replace(/^\"|\"$/g, \"\")).filter(Boolean);\n  };\n\n  const outcome = fm.outcome as BoxFrontmatter[\"outcome\"];\n  return {\n    id: fm.id ?? \"\",\n    memoryKind: \"box\",\n    createdAt: fm.createdAt ?? \"\",\n    sealedAt: fm.sealedAt ?? \"\",\n    sealReason: (fm.sealReason ?? \"forced\") as SealReason,\n    sessionKey: fm.sessionKey,\n    topics: parseArray(fm.topics),\n    memoryIds: parseArray(fm.memoryIds),\n    traceId: fm.traceId,\n    goal: fm.goal || undefined,\n    toolsUsed: fm.toolsUsed ? parseArray(fm.toolsUsed) : undefined,\n    outcome: outcome && [\"success\", \"failure\", \"partial\", \"unknown\"].includes(outcome) ? outcome : undefined,\n  };\n}\n\n// ── BoxBuilder ────────────────────────────────────────────────────────────\n\nexport class BoxBuilder {\n  private baseDir: string;\n  private cfg: BoxBuilderConfig;\n  private openBox: OpenBoxState | null = null;\n  private stateLoaded = false;\n  private openBoxMutationChain: Promise<unknown> = Promise.resolve();\n  private traceMutationChain: Promise<unknown> = Promise.resolve();\n\n  constructor(baseDir: string, cfg: BoxBuilderConfig) {\n    this.baseDir = baseDir;\n    this.cfg = cfg;\n  }\n\n  private enqueueOpenBoxMutation<T>(op: () => Promise<T>): Promise<T> {\n    const run = this.openBoxMutationChain.catch(() => {}).then(op);\n    this.openBoxMutationChain = run.catch(() => {});\n    return run;\n  }\n\n  private enqueueTraceMutation<T>(op: () => Promise<T>): Promise<T> {\n    const run = this.traceMutationChain.catch(() => {}).then(op);\n    this.traceMutationChain = run.catch(() => {});\n    return run;\n  }\n\n  private get boxBaseDir(): string {\n    return path.join(this.baseDir, BOX_DIR);\n  }\n\n  private get stateDir(): string {\n    return path.join(this.baseDir, STATE_DIR);\n  }\n\n  private get openBoxStatePath(): string {\n    return path.join(this.stateDir, OPEN_BOX_STATE_FILE);\n  }\n\n  private get tracesPath(): string {\n    return path.join(this.stateDir, TRACES_FILE);\n  }\n\n  // ── State persistence ────────────────────────────────────────────────────\n\n  private async loadOpenBox(): Promise<void> {\n    if (this.stateLoaded) return;\n    this.stateLoaded = true;\n    try {\n      const raw = await readFile(this.openBoxStatePath, \"utf-8\");\n      this.openBox = JSON.parse(raw) as OpenBoxState;\n    } catch {\n      this.openBox = null;\n    }\n  }\n\n  private async saveOpenBox(): Promise<void> {\n    await mkdir(this.stateDir, { recursive: true });\n    if (this.openBox) {\n      await writeFile(this.openBoxStatePath, JSON.stringify(this.openBox, null, 2), \"utf-8\");\n    } else {\n      // Clear open box state\n      try { await writeFile(this.openBoxStatePath, \"null\", \"utf-8\"); } catch { /* ok */ }\n    }\n  }\n\n  private async loadTraceIndex(): Promise<TraceIndex> {\n    try {\n      const raw = await readFile(this.tracesPath, \"utf-8\");\n      const parsed = JSON.parse(raw) as TraceIndex;\n      // Backfill missing field for indexes written before this field was added\n      parsed.traceLastSeen ??= {};\n      return parsed;\n    } catch {\n      return { traces: {}, boxToTrace: {}, traceTopics: {}, traceLastSeen: {} };\n    }\n  }\n\n  private async saveTraceIndex(idx: TraceIndex): Promise<void> {\n    try {\n      await mkdir(this.stateDir, { recursive: true });\n      await writeFile(this.tracesPath, JSON.stringify(idx, null, 2), \"utf-8\");\n    } catch (err) {\n      log.warn(`[engram/boxes] Failed to save trace index: ${(err as Error).message}`);\n    }\n  }\n\n  // ── Core logic ────────────────────────────────────────────────────────────\n\n  /**\n   * Called after each extraction run.\n   * Decides whether to seal the current open box and/or start a new one.\n   */\n  async onExtraction(event: ExtractionEvent): Promise<void> {\n    await this.enqueueOpenBoxMutation(async () => this.onExtractionUnlocked(event));\n  }\n\n  private async onExtractionUnlocked(event: ExtractionEvent): Promise<void> {\n    if (!this.cfg.memoryBoxesEnabled) return;\n\n    await this.loadOpenBox();\n\n    const newTopics = event.topics.filter(Boolean);\n    const now = new Date(event.timestamp);\n    const nowMs = now.getTime();\n\n    if (this.openBox) {\n      // Check seal conditions\n      const lastActivity = new Date(this.openBox.lastActivityAt).getTime();\n      const timeGapMs = nowMs - lastActivity;\n      const overlap = topicOverlapScore(this.openBox.topics, newTopics);\n      const topicShifted = newTopics.length > 0 && overlap < this.cfg.boxTopicShiftThreshold;\n      const timeExpired = timeGapMs >= this.cfg.boxTimeGapMs;\n      const tooManyMemories =\n        this.openBox.memoryIds.length + event.memoryIds.length > this.cfg.boxMaxMemories;\n\n      if (tooManyMemories) {\n        // Merge topics and add current batch then seal\n        const topicSet = new Set([...this.openBox.topics, ...newTopics]);\n        this.openBox.topics = [...topicSet];\n        this.openBox.memoryIds.push(...event.memoryIds);\n        if (event.toolsUsed?.length) {\n          const toolSet = new Set([...(this.openBox.toolsUsed ?? []), ...event.toolsUsed]);\n          this.openBox.toolsUsed = [...toolSet];\n        }\n        await this.sealCurrentUnlocked(\"max_memories\");\n      } else if (topicShifted) {\n        await this.sealCurrentUnlocked(\"topic_shift\");\n        this.openBox = this.newBox(event, now.toISOString());\n        await this.saveOpenBox();\n      } else if (timeExpired) {\n        await this.sealCurrentUnlocked(\"time_gap\");\n        this.openBox = this.newBox(event, now.toISOString());\n        await this.saveOpenBox();\n      } else {\n        // Accumulate\n        this.openBox.memoryIds.push(...event.memoryIds);\n        // Merge new topics (union)\n        const topicSet = new Set([...this.openBox.topics, ...newTopics]);\n        this.openBox.topics = [...topicSet];\n        this.openBox.lastActivityAt = now.toISOString();\n        // Merge toolsUsed (union)\n        if (event.toolsUsed?.length) {\n          const toolSet = new Set([...(this.openBox.toolsUsed ?? []), ...event.toolsUsed]);\n          this.openBox.toolsUsed = [...toolSet];\n        }\n        await this.saveOpenBox();\n      }\n    } else {\n      // No open box — start one\n      this.openBox = this.newBox(event, now.toISOString());\n      // If this initial batch already exceeds max, seal immediately\n      if (this.openBox.memoryIds.length > this.cfg.boxMaxMemories) {\n        await this.sealCurrentUnlocked(\"max_memories\");\n      } else {\n        await this.saveOpenBox();\n      }\n    }\n  }\n\n  private newBox(event: ExtractionEvent, ts: string): OpenBoxState {\n    return {\n      id: makeBoxId(),\n      createdAt: ts,\n      lastActivityAt: ts,\n      topics: event.topics.filter(Boolean),\n      memoryIds: [...event.memoryIds],\n      goal: event.goal,\n      toolsUsed: event.toolsUsed?.length ? [...event.toolsUsed] : undefined,\n    };\n  }\n\n  /**\n   * Seal the current open box and write it to disk.\n   * Also runs trace weaving if enabled.\n   */\n  async sealCurrent(reason: SealReason): Promise<string | null> {\n    return this.enqueueOpenBoxMutation(async () => this.sealCurrentUnlocked(reason));\n  }\n\n  private async sealCurrentUnlocked(reason: SealReason): Promise<string | null> {\n    await this.loadOpenBox();\n    if (!this.openBox) return null;\n\n    const box = this.openBox;\n    this.openBox = null;\n\n    if (box.memoryIds.length === 0 && box.topics.length === 0) {\n      await this.saveOpenBox();\n      return null;\n    }\n\n    const sealedAt = new Date().toISOString();\n    const day = sealedAt.slice(0, 10);\n    const dir = path.join(this.boxBaseDir, day);\n    await mkdir(dir, { recursive: true });\n\n    let traceId: string | undefined;\n    if (this.cfg.traceWeaverEnabled && box.topics.length > 0) {\n      traceId = await this.resolveTrace(box.id, box.topics);\n    }\n\n    const fm: BoxFrontmatter = {\n      id: box.id,\n      memoryKind: \"box\",\n      createdAt: box.createdAt,\n      sealedAt,\n      sealReason: reason,\n      topics: box.topics,\n      memoryIds: box.memoryIds,\n      traceId,\n      goal: box.goal,\n      toolsUsed: box.toolsUsed?.length ? box.toolsUsed : undefined,\n      outcome: \"unknown\",\n    };\n\n    const content = `${serializeBoxFrontmatter(fm)}\\n\\n<!-- Topics: ${box.topics.join(\", \")} | Memories: ${box.memoryIds.length} -->\\n`;\n    const filePath = path.join(dir, `${box.id}.md`);\n    await writeFile(filePath, content, \"utf-8\");\n    log.debug(`[boxes] sealed box ${box.id} (${reason}): ${box.memoryIds.length} memories, topics=[${box.topics.join(\",\")}]`);\n\n    await this.saveOpenBox();\n    return box.id;\n  }\n\n  // ── Trace Weaving ─────────────────────────────────────────────────────────\n\n  /**\n   * Find an existing trace that matches box topics, or create a new trace.\n   * Returns the traceId to assign to this box.\n   */\n  private async resolveTrace(boxId: string, topics: string[]): Promise<string> {\n    return this.enqueueTraceMutation(async () => this.resolveTraceUnlocked(boxId, topics));\n  }\n\n  private async resolveTraceUnlocked(boxId: string, topics: string[]): Promise<string> {\n    const idx = await this.loadTraceIndex();\n\n    // Filter to traces active within the lookback window\n    const lookbackMs = this.cfg.traceWeaverLookbackDays * 24 * 60 * 60 * 1000;\n    const cutoff = new Date(Date.now() - lookbackMs);\n\n    let bestTraceId: string | undefined;\n    let bestScore = 0;\n\n    for (const [tid, traceTopics] of Object.entries(idx.traceTopics)) {\n      const lastSeen = idx.traceLastSeen[tid];\n      if (lastSeen && new Date(lastSeen) < cutoff) continue; // outside lookback window\n      const score = topicOverlapScore(topics, traceTopics);\n      if (score >= this.cfg.traceWeaverOverlapThreshold && score > bestScore) {\n        bestScore = score;\n        bestTraceId = tid;\n      }\n    }\n\n    const traceId = bestTraceId ?? makeTraceId(topics);\n    const now = new Date().toISOString();\n\n    // Update trace index\n    if (!idx.traces[traceId]) idx.traces[traceId] = [];\n    idx.traces[traceId].push(boxId);\n    idx.boxToTrace[boxId] = traceId;\n    idx.traceLastSeen[traceId] = now;\n\n    // Update canonical topics for this trace (merge)\n    if (idx.traceTopics[traceId]) {\n      const merged = new Set([...idx.traceTopics[traceId], ...topics]);\n      idx.traceTopics[traceId] = [...merged];\n    } else {\n      idx.traceTopics[traceId] = [...topics];\n    }\n\n    await this.saveTraceIndex(idx);\n    return traceId;\n  }\n\n  // ── Recall ────────────────────────────────────────────────────────────────\n\n  /**\n   * Read all sealed boxes from the last N days for recall injection.\n   */\n  async readRecentBoxes(days: number): Promise<BoxFrontmatter[]> {\n    const cutoff = new Date(Date.now() - days * 24 * 60 * 60 * 1000);\n    const cutoffDateStr = cutoff.toISOString().slice(0, 10); // \"YYYY-MM-DD\"\n\n    let topEntries: Dirent<string>[];\n    try {\n      topEntries = await readdir(this.boxBaseDir, { withFileTypes: true, encoding: \"utf-8\" });\n    } catch {\n      return [];\n    }\n\n    // Filter day directories by name (YYYY-MM-DD) — skip dirs older than cutoff\n    // without reading a single file from them.\n    const recentDirs = topEntries\n      .filter((e) => e.isDirectory() && /^\\d{4}-\\d{2}-\\d{2}$/.test(e.name) && e.name >= cutoffDateStr)\n      .map((e) => path.join(this.boxBaseDir, e.name));\n\n    // Also include legacy flat entries at the root level (non-date dirs and .md files)\n    const legacyEntries = topEntries.filter(\n      (e) => !e.isDirectory() || !/^\\d{4}-\\d{2}-\\d{2}$/.test(e.name),\n    );\n\n    // Read all files in each recent day directory in parallel (per dir)\n    const boxes: BoxFrontmatter[] = [];\n\n    const readDir = async (dir: string) => {\n      let files: string[];\n      try {\n        files = (await readdir(dir)).filter((f) => f.endsWith(\".md\"));\n      } catch {\n        return;\n      }\n      const results = await Promise.all(\n        files.map(async (f) => {\n          try {\n            const raw = await readFile(path.join(dir, f), \"utf-8\");\n            const parsed = parseBoxFrontmatter(raw);\n            return parsed && new Date(parsed.sealedAt) >= cutoff ? parsed : null;\n          } catch {\n            return null;\n          }\n        }),\n      );\n      for (const r of results) {\n        if (r !== null) boxes.push(r);\n      }\n    };\n\n    // Day dirs in parallel\n    await Promise.all(recentDirs.map(readDir));\n\n    // Legacy non-date entries (walk sub-dirs sequentially but read files in parallel)\n    for (const e of legacyEntries) {\n      const full = path.join(this.boxBaseDir, e.name);\n      if (e.isDirectory()) {\n        await readDir(full);\n      } else if (e.name.endsWith(\".md\")) {\n        try {\n          const raw = await readFile(full, \"utf-8\");\n          const parsed = parseBoxFrontmatter(raw);\n          if (parsed && new Date(parsed.sealedAt) >= cutoff) boxes.push(parsed);\n        } catch { /* corrupt file — skip */ }\n      }\n    }\n\n    // Sort newest-first so slice(0, N) gives the most recent boxes\n    boxes.sort((a, b) => new Date(b.sealedAt).getTime() - new Date(a.sealedAt).getTime());\n    return boxes;\n  }\n}\n"],"mappings":";;;;;AAWA,SAAS,OAAO,WAAW,UAAU,eAAe;AAEpD,OAAO,UAAU;AACjB,SAAS,kBAAkB;AAGpB,IAAM,UAAU;AACvB,IAAM,YAAY;AAClB,IAAM,cAAc;AACpB,IAAM,sBAAsB;AA0ErB,SAAS,kBAAkB,GAAa,GAAqB;AAClE,MAAI,EAAE,WAAW,KAAK,EAAE,WAAW,EAAG,QAAO;AAC7C,QAAM,OAAO,IAAI,IAAI,EAAE,IAAI,CAAC,MAAM,EAAE,YAAY,CAAC,CAAC;AAClD,QAAM,OAAO,IAAI,IAAI,EAAE,IAAI,CAAC,MAAM,EAAE,YAAY,CAAC,CAAC;AAClD,QAAM,eAAe,CAAC,GAAG,IAAI,EAAE,OAAO,CAAC,MAAM,KAAK,IAAI,CAAC,CAAC,EAAE;AAC1D,QAAM,SAAQ,oBAAI,IAAI,CAAC,GAAG,MAAM,GAAG,IAAI,CAAC,GAAE;AAC1C,SAAO,UAAU,IAAI,IAAM,eAAe;AAC5C;AAEA,SAAS,YAAoB;AAC3B,SAAO,OAAO,KAAK,IAAI,CAAC,IAAI,KAAK,OAAO,EAAE,SAAS,EAAE,EAAE,MAAM,GAAG,CAAC,CAAC;AACpE;AAEA,SAAS,YAAY,QAA0B;AAC7C,QAAM,MAAM,OAAO,MAAM,EAAE,KAAK,EAAE,KAAK,GAAG;AAC1C,SAAO,SAAS,WAAW,QAAQ,EAAE,OAAO,GAAG,EAAE,OAAO,KAAK,EAAE,MAAM,GAAG,CAAC,CAAC;AAC5E;AAIA,SAAS,wBAAwB,IAA4B;AAC3D,QAAM,QAAQ;AAAA,IACZ;AAAA,IACA,OAAO,GAAG,EAAE;AAAA,IACZ,eAAe,GAAG,UAAU;AAAA,IAC5B,cAAc,GAAG,SAAS;AAAA,IAC1B,aAAa,GAAG,QAAQ;AAAA,IACxB,eAAe,GAAG,UAAU;AAAA,IAC5B,YAAY,GAAG,OAAO,IAAI,CAAC,MAAM,IAAI,CAAC,GAAG,EAAE,KAAK,IAAI,CAAC;AAAA,IACrD,eAAe,GAAG,UAAU,IAAI,CAAC,MAAM,IAAI,CAAC,GAAG,EAAE,KAAK,IAAI,CAAC;AAAA,EAC7D;AACA,MAAI,GAAG,WAAY,OAAM,KAAK,eAAe,GAAG,UAAU,EAAE;AAC5D,MAAI,GAAG,QAAS,OAAM,KAAK,YAAY,GAAG,OAAO,EAAE;AACnD,MAAI,GAAG,KAAM,OAAM,KAAK,SAAS,GAAG,KAAK,QAAQ,YAAY,GAAG,CAAC,EAAE;AACnE,MAAI,GAAG,WAAW,OAAQ,OAAM,KAAK,eAAe,GAAG,UAAU,IAAI,CAAC,MAAM,IAAI,CAAC,GAAG,EAAE,KAAK,IAAI,CAAC,GAAG;AACnG,MAAI,GAAG,QAAS,OAAM,KAAK,YAAY,GAAG,OAAO,EAAE;AACnD,QAAM,KAAK,KAAK;AAChB,SAAO,MAAM,KAAK,IAAI;AACxB;AAEO,SAAS,oBAAoB,KAAoC;AACtE,QAAM,QAAQ,IAAI,MAAM,uBAAuB;AAC/C,MAAI,CAAC,MAAO,QAAO;AAEnB,QAAM,UAAU,MAAM,CAAC;AACvB,QAAM,KAA6B,CAAC;AACpC,aAAW,QAAQ,QAAQ,MAAM,IAAI,GAAG;AACtC,UAAM,WAAW,KAAK,QAAQ,GAAG;AACjC,QAAI,aAAa,GAAI;AACrB,OAAG,KAAK,MAAM,GAAG,QAAQ,EAAE,KAAK,CAAC,IAAI,KAAK,MAAM,WAAW,CAAC,EAAE,KAAK;AAAA,EACrE;AAEA,QAAM,aAAa,CAAC,QAAsC;AACxD,QAAI,CAAC,IAAK,QAAO,CAAC;AAClB,UAAM,IAAI,IAAI,MAAM,SAAS;AAC7B,QAAI,CAAC,EAAG,QAAO,CAAC;AAChB,WAAO,EAAE,CAAC,EAAE,MAAM,GAAG,EAAE,IAAI,CAAC,MAAM,EAAE,KAAK,EAAE,QAAQ,UAAU,EAAE,CAAC,EAAE,OAAO,OAAO;AAAA,EAClF;AAEA,QAAM,UAAU,GAAG;AACnB,SAAO;AAAA,IACL,IAAI,GAAG,MAAM;AAAA,IACb,YAAY;AAAA,IACZ,WAAW,GAAG,aAAa;AAAA,IAC3B,UAAU,GAAG,YAAY;AAAA,IACzB,YAAa,GAAG,cAAc;AAAA,IAC9B,YAAY,GAAG;AAAA,IACf,QAAQ,WAAW,GAAG,MAAM;AAAA,IAC5B,WAAW,WAAW,GAAG,SAAS;AAAA,IAClC,SAAS,GAAG;AAAA,IACZ,MAAM,GAAG,QAAQ;AAAA,IACjB,WAAW,GAAG,YAAY,WAAW,GAAG,SAAS,IAAI;AAAA,IACrD,SAAS,WAAW,CAAC,WAAW,WAAW,WAAW,SAAS,EAAE,SAAS,OAAO,IAAI,UAAU;AAAA,EACjG;AACF;AAIO,IAAM,aAAN,MAAiB;AAAA,EACd;AAAA,EACA;AAAA,EACA,UAA+B;AAAA,EAC/B,cAAc;AAAA,EACd,uBAAyC,QAAQ,QAAQ;AAAA,EACzD,qBAAuC,QAAQ,QAAQ;AAAA,EAE/D,YAAY,SAAiB,KAAuB;AAClD,SAAK,UAAU;AACf,SAAK,MAAM;AAAA,EACb;AAAA,EAEQ,uBAA0B,IAAkC;AAClE,UAAM,MAAM,KAAK,qBAAqB,MAAM,MAAM;AAAA,IAAC,CAAC,EAAE,KAAK,EAAE;AAC7D,SAAK,uBAAuB,IAAI,MAAM,MAAM;AAAA,IAAC,CAAC;AAC9C,WAAO;AAAA,EACT;AAAA,EAEQ,qBAAwB,IAAkC;AAChE,UAAM,MAAM,KAAK,mBAAmB,MAAM,MAAM;AAAA,IAAC,CAAC,EAAE,KAAK,EAAE;AAC3D,SAAK,qBAAqB,IAAI,MAAM,MAAM;AAAA,IAAC,CAAC;AAC5C,WAAO;AAAA,EACT;AAAA,EAEA,IAAY,aAAqB;AAC/B,WAAO,KAAK,KAAK,KAAK,SAAS,OAAO;AAAA,EACxC;AAAA,EAEA,IAAY,WAAmB;AAC7B,WAAO,KAAK,KAAK,KAAK,SAAS,SAAS;AAAA,EAC1C;AAAA,EAEA,IAAY,mBAA2B;AACrC,WAAO,KAAK,KAAK,KAAK,UAAU,mBAAmB;AAAA,EACrD;AAAA,EAEA,IAAY,aAAqB;AAC/B,WAAO,KAAK,KAAK,KAAK,UAAU,WAAW;AAAA,EAC7C;AAAA;AAAA,EAIA,MAAc,cAA6B;AACzC,QAAI,KAAK,YAAa;AACtB,SAAK,cAAc;AACnB,QAAI;AACF,YAAM,MAAM,MAAM,SAAS,KAAK,kBAAkB,OAAO;AACzD,WAAK,UAAU,KAAK,MAAM,GAAG;AAAA,IAC/B,QAAQ;AACN,WAAK,UAAU;AAAA,IACjB;AAAA,EACF;AAAA,EAEA,MAAc,cAA6B;AACzC,UAAM,MAAM,KAAK,UAAU,EAAE,WAAW,KAAK,CAAC;AAC9C,QAAI,KAAK,SAAS;AAChB,YAAM,UAAU,KAAK,kBAAkB,KAAK,UAAU,KAAK,SAAS,MAAM,CAAC,GAAG,OAAO;AAAA,IACvF,OAAO;AAEL,UAAI;AAAE,cAAM,UAAU,KAAK,kBAAkB,QAAQ,OAAO;AAAA,MAAG,QAAQ;AAAA,MAAW;AAAA,IACpF;AAAA,EACF;AAAA,EAEA,MAAc,iBAAsC;AAClD,QAAI;AACF,YAAM,MAAM,MAAM,SAAS,KAAK,YAAY,OAAO;AACnD,YAAM,SAAS,KAAK,MAAM,GAAG;AAE7B,aAAO,kBAAkB,CAAC;AAC1B,aAAO;AAAA,IACT,QAAQ;AACN,aAAO,EAAE,QAAQ,CAAC,GAAG,YAAY,CAAC,GAAG,aAAa,CAAC,GAAG,eAAe,CAAC,EAAE;AAAA,IAC1E;AAAA,EACF;AAAA,EAEA,MAAc,eAAe,KAAgC;AAC3D,QAAI;AACF,YAAM,MAAM,KAAK,UAAU,EAAE,WAAW,KAAK,CAAC;AAC9C,YAAM,UAAU,KAAK,YAAY,KAAK,UAAU,KAAK,MAAM,CAAC,GAAG,OAAO;AAAA,IACxE,SAAS,KAAK;AACZ,UAAI,KAAK,8CAA+C,IAAc,OAAO,EAAE;AAAA,IACjF;AAAA,EACF;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAQA,MAAM,aAAa,OAAuC;AACxD,UAAM,KAAK,uBAAuB,YAAY,KAAK,qBAAqB,KAAK,CAAC;AAAA,EAChF;AAAA,EAEA,MAAc,qBAAqB,OAAuC;AACxE,QAAI,CAAC,KAAK,IAAI,mBAAoB;AAElC,UAAM,KAAK,YAAY;AAEvB,UAAM,YAAY,MAAM,OAAO,OAAO,OAAO;AAC7C,UAAM,MAAM,IAAI,KAAK,MAAM,SAAS;AACpC,UAAM,QAAQ,IAAI,QAAQ;AAE1B,QAAI,KAAK,SAAS;AAEhB,YAAM,eAAe,IAAI,KAAK,KAAK,QAAQ,cAAc,EAAE,QAAQ;AACnE,YAAM,YAAY,QAAQ;AAC1B,YAAM,UAAU,kBAAkB,KAAK,QAAQ,QAAQ,SAAS;AAChE,YAAM,eAAe,UAAU,SAAS,KAAK,UAAU,KAAK,IAAI;AAChE,YAAM,cAAc,aAAa,KAAK,IAAI;AAC1C,YAAM,kBACJ,KAAK,QAAQ,UAAU,SAAS,MAAM,UAAU,SAAS,KAAK,IAAI;AAEpE,UAAI,iBAAiB;AAEnB,cAAM,WAAW,oBAAI,IAAI,CAAC,GAAG,KAAK,QAAQ,QAAQ,GAAG,SAAS,CAAC;AAC/D,aAAK,QAAQ,SAAS,CAAC,GAAG,QAAQ;AAClC,aAAK,QAAQ,UAAU,KAAK,GAAG,MAAM,SAAS;AAC9C,YAAI,MAAM,WAAW,QAAQ;AAC3B,gBAAM,UAAU,oBAAI,IAAI,CAAC,GAAI,KAAK,QAAQ,aAAa,CAAC,GAAI,GAAG,MAAM,SAAS,CAAC;AAC/E,eAAK,QAAQ,YAAY,CAAC,GAAG,OAAO;AAAA,QACtC;AACA,cAAM,KAAK,oBAAoB,cAAc;AAAA,MAC/C,WAAW,cAAc;AACvB,cAAM,KAAK,oBAAoB,aAAa;AAC5C,aAAK,UAAU,KAAK,OAAO,OAAO,IAAI,YAAY,CAAC;AACnD,cAAM,KAAK,YAAY;AAAA,MACzB,WAAW,aAAa;AACtB,cAAM,KAAK,oBAAoB,UAAU;AACzC,aAAK,UAAU,KAAK,OAAO,OAAO,IAAI,YAAY,CAAC;AACnD,cAAM,KAAK,YAAY;AAAA,MACzB,OAAO;AAEL,aAAK,QAAQ,UAAU,KAAK,GAAG,MAAM,SAAS;AAE9C,cAAM,WAAW,oBAAI,IAAI,CAAC,GAAG,KAAK,QAAQ,QAAQ,GAAG,SAAS,CAAC;AAC/D,aAAK,QAAQ,SAAS,CAAC,GAAG,QAAQ;AAClC,aAAK,QAAQ,iBAAiB,IAAI,YAAY;AAE9C,YAAI,MAAM,WAAW,QAAQ;AAC3B,gBAAM,UAAU,oBAAI,IAAI,CAAC,GAAI,KAAK,QAAQ,aAAa,CAAC,GAAI,GAAG,MAAM,SAAS,CAAC;AAC/E,eAAK,QAAQ,YAAY,CAAC,GAAG,OAAO;AAAA,QACtC;AACA,cAAM,KAAK,YAAY;AAAA,MACzB;AAAA,IACF,OAAO;AAEL,WAAK,UAAU,KAAK,OAAO,OAAO,IAAI,YAAY,CAAC;AAEnD,UAAI,KAAK,QAAQ,UAAU,SAAS,KAAK,IAAI,gBAAgB;AAC3D,cAAM,KAAK,oBAAoB,cAAc;AAAA,MAC/C,OAAO;AACL,cAAM,KAAK,YAAY;AAAA,MACzB;AAAA,IACF;AAAA,EACF;AAAA,EAEQ,OAAO,OAAwB,IAA0B;AAC/D,WAAO;AAAA,MACL,IAAI,UAAU;AAAA,MACd,WAAW;AAAA,MACX,gBAAgB;AAAA,MAChB,QAAQ,MAAM,OAAO,OAAO,OAAO;AAAA,MACnC,WAAW,CAAC,GAAG,MAAM,SAAS;AAAA,MAC9B,MAAM,MAAM;AAAA,MACZ,WAAW,MAAM,WAAW,SAAS,CAAC,GAAG,MAAM,SAAS,IAAI;AAAA,IAC9D;AAAA,EACF;AAAA;AAAA;AAAA;AAAA;AAAA,EAMA,MAAM,YAAY,QAA4C;AAC5D,WAAO,KAAK,uBAAuB,YAAY,KAAK,oBAAoB,MAAM,CAAC;AAAA,EACjF;AAAA,EAEA,MAAc,oBAAoB,QAA4C;AAC5E,UAAM,KAAK,YAAY;AACvB,QAAI,CAAC,KAAK,QAAS,QAAO;AAE1B,UAAM,MAAM,KAAK;AACjB,SAAK,UAAU;AAEf,QAAI,IAAI,UAAU,WAAW,KAAK,IAAI,OAAO,WAAW,GAAG;AACzD,YAAM,KAAK,YAAY;AACvB,aAAO;AAAA,IACT;AAEA,UAAM,YAAW,oBAAI,KAAK,GAAE,YAAY;AACxC,UAAM,MAAM,SAAS,MAAM,GAAG,EAAE;AAChC,UAAM,MAAM,KAAK,KAAK,KAAK,YAAY,GAAG;AAC1C,UAAM,MAAM,KAAK,EAAE,WAAW,KAAK,CAAC;AAEpC,QAAI;AACJ,QAAI,KAAK,IAAI,sBAAsB,IAAI,OAAO,SAAS,GAAG;AACxD,gBAAU,MAAM,KAAK,aAAa,IAAI,IAAI,IAAI,MAAM;AAAA,IACtD;AAEA,UAAM,KAAqB;AAAA,MACzB,IAAI,IAAI;AAAA,MACR,YAAY;AAAA,MACZ,WAAW,IAAI;AAAA,MACf;AAAA,MACA,YAAY;AAAA,MACZ,QAAQ,IAAI;AAAA,MACZ,WAAW,IAAI;AAAA,MACf;AAAA,MACA,MAAM,IAAI;AAAA,MACV,WAAW,IAAI,WAAW,SAAS,IAAI,YAAY;AAAA,MACnD,SAAS;AAAA,IACX;AAEA,UAAM,UAAU,GAAG,wBAAwB,EAAE,CAAC;AAAA;AAAA,eAAoB,IAAI,OAAO,KAAK,IAAI,CAAC,gBAAgB,IAAI,UAAU,MAAM;AAAA;AAC3H,UAAM,WAAW,KAAK,KAAK,KAAK,GAAG,IAAI,EAAE,KAAK;AAC9C,UAAM,UAAU,UAAU,SAAS,OAAO;AAC1C,QAAI,MAAM,sBAAsB,IAAI,EAAE,KAAK,MAAM,MAAM,IAAI,UAAU,MAAM,sBAAsB,IAAI,OAAO,KAAK,GAAG,CAAC,GAAG;AAExH,UAAM,KAAK,YAAY;AACvB,WAAO,IAAI;AAAA,EACb;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAQA,MAAc,aAAa,OAAe,QAAmC;AAC3E,WAAO,KAAK,qBAAqB,YAAY,KAAK,qBAAqB,OAAO,MAAM,CAAC;AAAA,EACvF;AAAA,EAEA,MAAc,qBAAqB,OAAe,QAAmC;AACnF,UAAM,MAAM,MAAM,KAAK,eAAe;AAGtC,UAAM,aAAa,KAAK,IAAI,0BAA0B,KAAK,KAAK,KAAK;AACrE,UAAM,SAAS,IAAI,KAAK,KAAK,IAAI,IAAI,UAAU;AAE/C,QAAI;AACJ,QAAI,YAAY;AAEhB,eAAW,CAAC,KAAK,WAAW,KAAK,OAAO,QAAQ,IAAI,WAAW,GAAG;AAChE,YAAM,WAAW,IAAI,cAAc,GAAG;AACtC,UAAI,YAAY,IAAI,KAAK,QAAQ,IAAI,OAAQ;AAC7C,YAAM,QAAQ,kBAAkB,QAAQ,WAAW;AACnD,UAAI,SAAS,KAAK,IAAI,+BAA+B,QAAQ,WAAW;AACtE,oBAAY;AACZ,sBAAc;AAAA,MAChB;AAAA,IACF;AAEA,UAAM,UAAU,eAAe,YAAY,MAAM;AACjD,UAAM,OAAM,oBAAI,KAAK,GAAE,YAAY;AAGnC,QAAI,CAAC,IAAI,OAAO,OAAO,EAAG,KAAI,OAAO,OAAO,IAAI,CAAC;AACjD,QAAI,OAAO,OAAO,EAAE,KAAK,KAAK;AAC9B,QAAI,WAAW,KAAK,IAAI;AACxB,QAAI,cAAc,OAAO,IAAI;AAG7B,QAAI,IAAI,YAAY,OAAO,GAAG;AAC5B,YAAM,SAAS,oBAAI,IAAI,CAAC,GAAG,IAAI,YAAY,OAAO,GAAG,GAAG,MAAM,CAAC;AAC/D,UAAI,YAAY,OAAO,IAAI,CAAC,GAAG,MAAM;AAAA,IACvC,OAAO;AACL,UAAI,YAAY,OAAO,IAAI,CAAC,GAAG,MAAM;AAAA,IACvC;AAEA,UAAM,KAAK,eAAe,GAAG;AAC7B,WAAO;AAAA,EACT;AAAA;AAAA;AAAA;AAAA;AAAA,EAOA,MAAM,gBAAgB,MAAyC;AAC7D,UAAM,SAAS,IAAI,KAAK,KAAK,IAAI,IAAI,OAAO,KAAK,KAAK,KAAK,GAAI;AAC/D,UAAM,gBAAgB,OAAO,YAAY,EAAE,MAAM,GAAG,EAAE;AAEtD,QAAI;AACJ,QAAI;AACF,mBAAa,MAAM,QAAQ,KAAK,YAAY,EAAE,eAAe,MAAM,UAAU,QAAQ,CAAC;AAAA,IACxF,QAAQ;AACN,aAAO,CAAC;AAAA,IACV;AAIA,UAAM,aAAa,WAChB,OAAO,CAAC,MAAM,EAAE,YAAY,KAAK,sBAAsB,KAAK,EAAE,IAAI,KAAK,EAAE,QAAQ,aAAa,EAC9F,IAAI,CAAC,MAAM,KAAK,KAAK,KAAK,YAAY,EAAE,IAAI,CAAC;AAGhD,UAAM,gBAAgB,WAAW;AAAA,MAC/B,CAAC,MAAM,CAAC,EAAE,YAAY,KAAK,CAAC,sBAAsB,KAAK,EAAE,IAAI;AAAA,IAC/D;AAGA,UAAM,QAA0B,CAAC;AAEjC,UAAM,UAAU,OAAO,QAAgB;AACrC,UAAI;AACJ,UAAI;AACF,iBAAS,MAAM,QAAQ,GAAG,GAAG,OAAO,CAAC,MAAM,EAAE,SAAS,KAAK,CAAC;AAAA,MAC9D,QAAQ;AACN;AAAA,MACF;AACA,YAAM,UAAU,MAAM,QAAQ;AAAA,QAC5B,MAAM,IAAI,OAAO,MAAM;AACrB,cAAI;AACF,kBAAM,MAAM,MAAM,SAAS,KAAK,KAAK,KAAK,CAAC,GAAG,OAAO;AACrD,kBAAM,SAAS,oBAAoB,GAAG;AACtC,mBAAO,UAAU,IAAI,KAAK,OAAO,QAAQ,KAAK,SAAS,SAAS;AAAA,UAClE,QAAQ;AACN,mBAAO;AAAA,UACT;AAAA,QACF,CAAC;AAAA,MACH;AACA,iBAAW,KAAK,SAAS;AACvB,YAAI,MAAM,KAAM,OAAM,KAAK,CAAC;AAAA,MAC9B;AAAA,IACF;AAGA,UAAM,QAAQ,IAAI,WAAW,IAAI,OAAO,CAAC;AAGzC,eAAW,KAAK,eAAe;AAC7B,YAAM,OAAO,KAAK,KAAK,KAAK,YAAY,EAAE,IAAI;AAC9C,UAAI,EAAE,YAAY,GAAG;AACnB,cAAM,QAAQ,IAAI;AAAA,MACpB,WAAW,EAAE,KAAK,SAAS,KAAK,GAAG;AACjC,YAAI;AACF,gBAAM,MAAM,MAAM,SAAS,MAAM,OAAO;AACxC,gBAAM,SAAS,oBAAoB,GAAG;AACtC,cAAI,UAAU,IAAI,KAAK,OAAO,QAAQ,KAAK,OAAQ,OAAM,KAAK,MAAM;AAAA,QACtE,QAAQ;AAAA,QAA4B;AAAA,MACtC;AAAA,IACF;AAGA,UAAM,KAAK,CAAC,GAAG,MAAM,IAAI,KAAK,EAAE,QAAQ,EAAE,QAAQ,IAAI,IAAI,KAAK,EAAE,QAAQ,EAAE,QAAQ,CAAC;AACpF,WAAO;AAAA,EACT;AACF;","names":[]}

package/dist/chunk-OZHRDTDX.js.map

@@ -1 +0,0 @@
-{"version":3,"sources":["../src/connectors-cli.ts"],"sourcesContent":["/**\n * `remnic connectors` CLI helpers (issue #683 PR 6/N).\n *\n * Three subcommands:\n *\n *   remnic connectors list\n *     Lists all configured live connectors, their enabled state, last poll\n *     time, and last error.  Output formats: text (default), markdown, json.\n *\n *   remnic connectors status\n *     Identical data to `list` but defaults to JSON output so scripts can\n *     reliably parse it.  Accepts `--format` to override.\n *\n *   remnic connectors run <name>\n *     Manually triggers a single `syncIncremental()` pass for the named\n *     connector.  Operator debug surface — useful when you want to test\n *     credentials without waiting for the scheduler tick.  Prints the\n *     number of new documents imported plus any error.\n *\n * Design decisions:\n *\n *   - Pure functions for list / status / run option parsing so they can be\n *     unit-tested without booting an orchestrator (CLAUDE.md rules 14 + 51).\n *   - Rendering lives here (not in cli.ts) so HTTP/MCP surfaces can reuse the\n *     same output without forking formatting (CLAUDE.md rule 22).\n *   - The `run` command requires the caller to pass a `pollFn` callback\n *     (wrapping the actual connector's `syncIncremental`).  This keeps the\n *     helper module free of direct orchestrator / live-connector imports while\n *     still being testable (CLAUDE.md rule 33 — mock signatures must match\n *     production).\n *   - CLAUDE.md rule 51: invalid `--format` throws with listed options; unknown\n *     connector name in `run` throws a descriptive error; `--format` without a\n *     value is caught by Commander's built-in argument check.\n *   - `runConnectorPollOnce` encapsulates the persist-before-cursor-advance\n *     contract (CLAUDE.md gotcha #25, #43) so it can be unit-tested in\n *     isolation without an orchestrator.\n */\n\nimport {\n  type ConnectorCursor,\n  type ConnectorDocument,\n  type ConnectorState,\n  type ConnectorSyncStatus,\n} from \"./connectors/live/index.js\";\n\n// ─────────────────────────────────────────────────────────────────────────────\n// Types that cross the module boundary\n// ─────────────────────────────────────────────────────────────────────────────\n\n/**\n * A lightweight descriptor for one live connector, assembled from the parsed\n * config and any persisted state.  The CLI handler builds this from\n * `orchestrator.config.connectors` + `listConnectorStates(memoryDir)`.\n */\nexport interface ConnectorRow {\n  /** Stable connector id (e.g. `\"google-drive\"`, `\"notion\"`). */\n  id: string;\n  /** Human-readable display name. */\n  displayName: string;\n  /** Whether the operator has enabled this connector in config. */\n  enabled: boolean;\n  /** Persisted sync state, or `null` if no sync has ever run. */\n  state: ConnectorState | null;\n}\n\n/**\n * Result returned by the `run` command's poll function.\n */\nexport interface ConnectorRunResult {\n  /** Number of new documents imported in this pass. */\n  docsImported: number;\n  /**\n   * Error message if the sync or ingest failed, undefined on full success.\n   * When only the cursor write failed after a successful ingest, this field is\n   * undefined and `stateWriteError` carries the failure. When persisting error\n   * state fails after a sync/ingest error, both fields are set so callers can\n   * preserve the primary failure while also reporting stale persisted state.\n   */\n  error?: string;\n  /**\n   * Set when cursor/error-state persistence fails. On the success path,\n   * `docsImported` reflects the actual count of successfully ingested docs so\n   * the operator knows data was persisted even though the cursor did not\n   * advance. On the error path, `error` preserves the primary sync/ingest\n   * failure and this field reports the secondary persistence failure.\n   */\n  stateWriteError?: string;\n}\n\n// ─────────────────────────────────────────────────────────────────────────────\n// Output formats\n// ─────────────────────────────────────────────────────────────────────────────\n\nexport const CONNECTORS_OUTPUT_FORMATS = [\"text\", \"markdown\", \"json\"] as const;\nexport type ConnectorsOutputFormat = (typeof CONNECTORS_OUTPUT_FORMATS)[number];\n\n/**\n * Validate `--format <fmt>`.  Throws a listed-options error for any value not\n * in `CONNECTORS_OUTPUT_FORMATS`.  Returns the given default when the value is\n * `undefined` (no flag supplied).\n */\nexport function parseConnectorsFormat(\n  value: unknown,\n  defaultFormat: ConnectorsOutputFormat = \"text\",\n): ConnectorsOutputFormat {\n  if (value === undefined || value === null) return defaultFormat;\n  if (\n    typeof value !== \"string\" ||\n    !(CONNECTORS_OUTPUT_FORMATS as readonly string[]).includes(value)\n  ) {\n    throw new Error(\n      `--format expects one of ${CONNECTORS_OUTPUT_FORMATS.join(\", \")}; got ${JSON.stringify(value)}`,\n    );\n  }\n  return value as ConnectorsOutputFormat;\n}\n\n// ─────────────────────────────────────────────────────────────────────────────\n// Parsed option types\n// ─────────────────────────────────────────────────────────────────────────────\n\nexport interface ParsedConnectorsListOptions {\n  format: ConnectorsOutputFormat;\n}\n\nexport interface ParsedConnectorsStatusOptions {\n  /** `status` defaults to JSON for scripting; `--format` can override. */\n  format: ConnectorsOutputFormat;\n}\n\n// ─────────────────────────────────────────────────────────────────────────────\n// Option parsers (pure, unit-testable)\n// ─────────────────────────────────────────────────────────────────────────────\n\n/**\n * Validate the option bag for `remnic connectors list`.\n */\nexport function parseConnectorsListOptions(\n  options: Record<string, unknown>,\n): ParsedConnectorsListOptions {\n  return {\n    format: parseConnectorsFormat(options.format, \"text\"),\n  };\n}\n\n/**\n * Validate the option bag for `remnic connectors status`.\n * Defaults to `json` (machine-readable) unless `--format` overrides.\n */\nexport function parseConnectorsStatusOptions(\n  options: Record<string, unknown>,\n): ParsedConnectorsStatusOptions {\n  return {\n    format: parseConnectorsFormat(options.format, \"json\"),\n  };\n}\n\n/**\n * Validate the positional `<name>` argument for `remnic connectors run`.\n */\nexport function parseConnectorsRunName(rawName: unknown): string {\n  if (typeof rawName !== \"string\" || rawName.trim().length === 0) {\n    throw new Error(\n      \"connectors run: <name> is required and must be a non-empty connector id\",\n    );\n  }\n  return rawName.trim();\n}\n\n// ─────────────────────────────────────────────────────────────────────────────\n// Formatters: shared helpers\n// ─────────────────────────────────────────────────────────────────────────────\n\n/**\n * Human-readable summary of `ConnectorSyncStatus`.\n *\n * Does NOT fold in the enabled/disabled state — the text and markdown\n * renderers already display that separately.  Mixing them produced\n * \"state: disabled, disabled\" when `enabled=false` and `status=\"never\"`.\n */\nfunction statusLabel(status: ConnectorSyncStatus): string {\n  switch (status) {\n    case \"never\":\n      return \"never synced\";\n    case \"success\":\n      return \"ok\";\n    case \"error\":\n      return \"error\";\n    default:\n      return status;\n  }\n}\n\n/**\n * Format a UTC ISO timestamp for display.  If the value is `null` / `undefined`\n * returns the given fallback string.\n */\nfunction fmtTimestamp(value: string | null | undefined, fallback = \"—\"): string {\n  if (!value) return fallback;\n  return value;\n}\n\n// ─────────────────────────────────────────────────────────────────────────────\n// Renderers\n// ─────────────────────────────────────────────────────────────────────────────\n\n/**\n * Render connector rows for `remnic connectors list` / `remnic connectors status`.\n */\nexport function renderConnectorsList(\n  rows: readonly ConnectorRow[],\n  format: ConnectorsOutputFormat,\n): string {\n  if (format === \"json\") {\n    const out = rows.map((row) => ({\n      id: row.id,\n      displayName: row.displayName,\n      enabled: row.enabled,\n      lastSyncAt: row.state?.lastSyncAt ?? null,\n      lastSyncStatus: row.state?.lastSyncStatus ?? \"never\",\n      lastSyncError: row.state?.lastSyncError ?? null,\n      totalDocsImported: row.state?.totalDocsImported ?? 0,\n      updatedAt: row.state?.updatedAt ?? null,\n    }));\n    return JSON.stringify(out, null, 2);\n  }\n\n  if (rows.length === 0) {\n    if (format === \"markdown\") {\n      return \"# Live connectors\\n\\n_No live connectors are configured._\\n\";\n    }\n    return \"No live connectors configured.\";\n  }\n\n  if (format === \"markdown\") {\n    const lines: string[] = [\"# Live connectors\", \"\"];\n    lines.push(\"| ID | Display name | Enabled | Last poll | Docs imported | Status |\");\n    lines.push(\"| --- | --- | --- | --- | --- | --- |\");\n    for (const row of rows) {\n      const lastPoll = fmtTimestamp(row.state?.lastSyncAt);\n      const docs = row.state?.totalDocsImported ?? 0;\n      const status = statusLabel(row.state?.lastSyncStatus ?? \"never\");\n      lines.push(\n        `| \\`${row.id}\\` | ${row.displayName} | ${row.enabled ? \"yes\" : \"no\"} | ${lastPoll} | ${docs} | ${status} |`,\n      );\n      if (row.state?.lastSyncError) {\n        lines.push(\n          `| | | | | | _Error: ${escapePipes(row.state.lastSyncError)}_ |`,\n        );\n      }\n    }\n    return lines.join(\"\\n\") + \"\\n\";\n  }\n\n  // text\n  const lines: string[] = [`Live connectors (${rows.length}):`];\n  lines.push(\"\");\n  for (const row of rows) {\n    const enabledStr = row.enabled ? \"enabled\" : \"disabled\";\n    const status = statusLabel(row.state?.lastSyncStatus ?? \"never\");\n    const lastPoll = fmtTimestamp(row.state?.lastSyncAt, \"(never polled)\");\n    const docs = row.state?.totalDocsImported ?? 0;\n    lines.push(`  ${row.id}  (${row.displayName})`);\n    lines.push(`    state:         ${enabledStr}, ${status}`);\n    lines.push(`    last_poll:     ${lastPoll}`);\n    lines.push(`    docs_imported: ${docs}`);\n    if (row.state?.lastSyncError) {\n      lines.push(`    last_error:    ${row.state.lastSyncError}`);\n    }\n  }\n  return lines.join(\"\\n\");\n}\n\n/**\n * Render the result of a manual `remnic connectors run <name>` invocation.\n */\nexport function renderConnectorsRunResult(\n  connectorId: string,\n  result: ConnectorRunResult,\n  format: ConnectorsOutputFormat,\n): string {\n  // A run is \"ok\" when neither a sync/ingest error nor a state-write error\n  // is present.  A partial success (ingest ok, cursor write failed) still\n  // surfaces as a non-ok status so the operator knows to investigate.\n  const ok = result.error === undefined && result.stateWriteError === undefined;\n\n  if (format === \"json\") {\n    return JSON.stringify(\n      {\n        connector: connectorId,\n        docsImported: result.docsImported,\n        error: result.error ?? null,\n        stateWriteError: result.stateWriteError ?? null,\n        ok,\n      },\n      null,\n      2,\n    );\n  }\n\n  if (format === \"markdown\") {\n    const lines: string[] = [`# connectors run: \\`${connectorId}\\``, \"\"];\n    lines.push(`- **Status:** ${ok ? \"success\" : \"error\"}`);\n    lines.push(`- **Docs imported:** ${result.docsImported}`);\n    if (result.error !== undefined) {\n      lines.push(`- **Error:** ${result.error}`);\n    }\n    if (result.stateWriteError !== undefined) {\n      const label =\n        result.error === undefined\n          ? \"State-write error (cursor not advanced)\"\n          : \"State-write error (error state not persisted)\";\n      lines.push(`- **${label}:** ${result.stateWriteError}`);\n    }\n    return lines.join(\"\\n\") + \"\\n\";\n  }\n\n  // text\n  const lines: string[] = [];\n  if (ok) {\n    lines.push(`connectors run: ${connectorId} — OK`);\n    lines.push(`  docs_imported: ${result.docsImported}`);\n  } else {\n    lines.push(`connectors run: ${connectorId} — FAILED`);\n    lines.push(`  docs_imported: ${result.docsImported}`);\n    if (result.error !== undefined) {\n      lines.push(`  error:         ${result.error}`);\n    }\n    if (result.stateWriteError !== undefined) {\n      lines.push(\n        `  state_write_error: ${result.stateWriteError}`,\n      );\n      if (result.error === undefined) {\n        lines.push(\n          result.docsImported > 0\n            ? `  (docs were ingested; cursor was not advanced — next poll will re-fetch from prior position)`\n            : `  (cursor was not advanced — next poll will retry from prior position)`,\n        );\n      } else {\n        lines.push(\n          `  (error state was not persisted — next poll will retry from prior position)`,\n        );\n      }\n    }\n  }\n  return lines.join(\"\\n\");\n}\n\n// ─────────────────────────────────────────────────────────────────────────────\n// Poll orchestration helper\n// ─────────────────────────────────────────────────────────────────────────────\n\n/**\n * Arguments for a single connector poll pass.\n *\n * All I/O is injectable so callers (cli.ts) can supply real implementations\n * and tests can supply lightweight stubs without booting an orchestrator.\n */\nexport interface RunConnectorPollOnceArgs {\n  /** Connector identifier (used in error/success state writes). */\n  connectorId: string;\n  /** Prior persisted state, or `null` on the very first sync. */\n  priorState: ConnectorState | null;\n  /**\n   * Perform a single incremental sync.  Returns newly-fetched documents and\n   * the cursor that should be persisted on success.\n   */\n  syncFn: (\n    cursor: ConnectorCursor | null,\n  ) => Promise<{ newDocs: ConnectorDocument[]; nextCursor: ConnectorCursor }>;\n  /**\n   * Ingest fetched documents into the memory layer.  Called BEFORE the cursor\n   * is advanced.  If this throws the cursor is NOT advanced (CLAUDE.md gotcha\n   * #25 — don't destroy old state before confirming new state succeeds).\n   */\n  ingestFn: (docs: ConnectorDocument[]) => Promise<void>;\n  /**\n   * Persist connector state (cursor + metadata).  Called after `ingestFn`\n   * succeeds (success path) or when `syncFn` / `ingestFn` throws (error path,\n   * with old cursor retained).\n   */\n  writeCursorFn: (state: {\n    cursor: ConnectorCursor | null;\n    lastSyncStatus: ConnectorSyncStatus;\n    lastSyncError?: string;\n    totalDocsImported: number;\n  }) => Promise<void>;\n}\n\n/**\n * Execute one `syncIncremental` pass for a live connector, enforcing the\n * persist-before-advance-cursor contract.\n *\n * Invariant (CLAUDE.md gotcha #25 + #43):\n *   1. `syncFn` fetches new docs and a next cursor.\n *   2. `ingestFn` persists the docs into the memory layer.\n *   3. Only if (2) succeeds does `writeCursorFn` advance the cursor.\n *   4. If (1) or (2) throws, `writeCursorFn` is still called but retains the\n *      **prior** cursor so the next poll re-fetches the same window.\n *\n * Returns the `ConnectorRunResult` that `cli.ts` uses for output rendering.\n */\nexport async function runConnectorPollOnce(\n  args: RunConnectorPollOnceArgs,\n): Promise<ConnectorRunResult> {\n  const { connectorId, priorState, syncFn, ingestFn, writeCursorFn } = args;\n\n  let syncResult: Awaited<ReturnType<typeof syncFn>> | undefined;\n  let ingestError: string | undefined;\n\n  // ── Phase 1: fetch ──────────────────────────────────────────────────────────\n  try {\n    syncResult = await syncFn(priorState?.cursor ?? null);\n  } catch (err) {\n    const msg = err instanceof Error ? err.message : String(err);\n    // syncFn failed — persist error state with the OLD cursor.\n    let stateWriteError: string | undefined;\n    try {\n      await writeCursorFn({\n        cursor: priorState?.cursor ?? null,\n        lastSyncStatus: \"error\",\n        lastSyncError: msg,\n        totalDocsImported: priorState?.totalDocsImported ?? 0,\n      });\n    } catch (writeErr) {\n      stateWriteError = writeErr instanceof Error ? writeErr.message : String(writeErr);\n      console.error(\n        `[remnic] connectors/${connectorId}: failed to persist error state after syncFn failure (${stateWriteError}); original error: ${msg}`,\n      );\n    }\n    return {\n      docsImported: 0,\n      error: msg,\n      ...(stateWriteError !== undefined ? { stateWriteError } : {}),\n    };\n  }\n\n  // ── Phase 2: ingest ─────────────────────────────────────────────────────────\n  // CRITICAL: ingest docs BEFORE advancing the cursor (CLAUDE.md gotcha #25).\n  // If ingestFn throws, write the error state with the OLD cursor so the\n  // next poll re-fetches the same document window.\n  if (syncResult.newDocs.length > 0) {\n    try {\n      await ingestFn(syncResult.newDocs);\n    } catch (err) {\n      ingestError = err instanceof Error ? err.message : String(err);\n    }\n  }\n\n  if (ingestError !== undefined) {\n    // ingestFn failed — persist error state with the OLD cursor.\n    let stateWriteError: string | undefined;\n    try {\n      await writeCursorFn({\n        cursor: priorState?.cursor ?? null,\n        lastSyncStatus: \"error\",\n        lastSyncError: ingestError,\n        totalDocsImported: priorState?.totalDocsImported ?? 0,\n      });\n    } catch (writeErr) {\n      stateWriteError = writeErr instanceof Error ? writeErr.message : String(writeErr);\n      // Intentionally not re-throwing: the original ingest error is the\n      // actionable failure for the operator.  The state-write failure is\n      // secondary and should not replace it in the rendered output.\n      // (CLAUDE.md gotcha #13; Codex P2 thread PRRT_kwDORJXyws59sk8K,\n      //  Cursor thread PRRT_kwDORJXyws59slAG)\n      console.error(\n        `[remnic] connectors/${connectorId}: failed to persist error state after ingestFn failure (${stateWriteError}); original error: ${ingestError}`,\n      );\n    }\n    return {\n      docsImported: 0,\n      error: ingestError,\n      ...(stateWriteError !== undefined ? { stateWriteError } : {}),\n    };\n  }\n\n  // ── Phase 3: advance cursor ─────────────────────────────────────────────────\n  // Ingest succeeded — advance the cursor.  If the cursor write fails, the\n  // docs ARE already in the memory layer so we must report the actual\n  // docsImported count.  Surface the state-write failure as a separate\n  // `stateWriteError` field so the operator can diagnose it without\n  // confusing it with a sync/ingest failure (Codex P1 thread\n  // PRRT_kwDORJXyws59sm76, Cursor thread PRRT_kwDORJXyws59sm_N).\n  const docsImported = syncResult.newDocs.length;\n  try {\n    await writeCursorFn({\n      cursor: syncResult.nextCursor,\n      lastSyncStatus: \"success\",\n      totalDocsImported: (priorState?.totalDocsImported ?? 0) + docsImported,\n    });\n  } catch (writeErr) {\n    const writeMsg = writeErr instanceof Error ? writeErr.message : String(writeErr);\n    // Docs are already ingested — preserve the count so the operator knows\n    // data was persisted.  The next poll will re-fetch from the prior cursor\n    // position but that only causes duplicate-ingest, not data loss.\n    return { docsImported, stateWriteError: writeMsg };\n  }\n\n  return { docsImported };\n}\n\n// ─────────────────────────────────────────────────────────────────────────────\n// Internal helpers\n// ─────────────────────────────────────────────────────────────────────────────\n\n/**\n * Escape characters that would break a Markdown table cell (backslash first,\n * then pipe).  Same pattern as in `patterns-cli.ts`.\n */\nfunction escapePipes(value: string): string {\n  return value.replace(/\\\\/g, \"\\\\\\\\\").replace(/\\|/g, \"\\\\|\");\n}\n"],"mappings":";AA6FO,IAAM,4BAA4B,CAAC,QAAQ,YAAY,MAAM;AAQ7D,SAAS,sBACd,OACA,gBAAwC,QAChB;AACxB,MAAI,UAAU,UAAa,UAAU,KAAM,QAAO;AAClD,MACE,OAAO,UAAU,YACjB,CAAE,0BAAgD,SAAS,KAAK,GAChE;AACA,UAAM,IAAI;AAAA,MACR,2BAA2B,0BAA0B,KAAK,IAAI,CAAC,SAAS,KAAK,UAAU,KAAK,CAAC;AAAA,IAC/F;AAAA,EACF;AACA,SAAO;AACT;AAsBO,SAAS,2BACd,SAC6B;AAC7B,SAAO;AAAA,IACL,QAAQ,sBAAsB,QAAQ,QAAQ,MAAM;AAAA,EACtD;AACF;AAMO,SAAS,6BACd,SAC+B;AAC/B,SAAO;AAAA,IACL,QAAQ,sBAAsB,QAAQ,QAAQ,MAAM;AAAA,EACtD;AACF;AAKO,SAAS,uBAAuB,SAA0B;AAC/D,MAAI,OAAO,YAAY,YAAY,QAAQ,KAAK,EAAE,WAAW,GAAG;AAC9D,UAAM,IAAI;AAAA,MACR;AAAA,IACF;AAAA,EACF;AACA,SAAO,QAAQ,KAAK;AACtB;AAaA,SAAS,YAAY,QAAqC;AACxD,UAAQ,QAAQ;AAAA,IACd,KAAK;AACH,aAAO;AAAA,IACT,KAAK;AACH,aAAO;AAAA,IACT,KAAK;AACH,aAAO;AAAA,IACT;AACE,aAAO;AAAA,EACX;AACF;AAMA,SAAS,aAAa,OAAkC,WAAW,UAAa;AAC9E,MAAI,CAAC,MAAO,QAAO;AACnB,SAAO;AACT;AASO,SAAS,qBACd,MACA,QACQ;AACR,MAAI,WAAW,QAAQ;AACrB,UAAM,MAAM,KAAK,IAAI,CAAC,SAAS;AAAA,MAC7B,IAAI,IAAI;AAAA,MACR,aAAa,IAAI;AAAA,MACjB,SAAS,IAAI;AAAA,MACb,YAAY,IAAI,OAAO,cAAc;AAAA,MACrC,gBAAgB,IAAI,OAAO,kBAAkB;AAAA,MAC7C,eAAe,IAAI,OAAO,iBAAiB;AAAA,MAC3C,mBAAmB,IAAI,OAAO,qBAAqB;AAAA,MACnD,WAAW,IAAI,OAAO,aAAa;AAAA,IACrC,EAAE;AACF,WAAO,KAAK,UAAU,KAAK,MAAM,CAAC;AAAA,EACpC;AAEA,MAAI,KAAK,WAAW,GAAG;AACrB,QAAI,WAAW,YAAY;AACzB,aAAO;AAAA,IACT;AACA,WAAO;AAAA,EACT;AAEA,MAAI,WAAW,YAAY;AACzB,UAAMA,SAAkB,CAAC,qBAAqB,EAAE;AAChD,IAAAA,OAAM,KAAK,sEAAsE;AACjF,IAAAA,OAAM,KAAK,uCAAuC;AAClD,eAAW,OAAO,MAAM;AACtB,YAAM,WAAW,aAAa,IAAI,OAAO,UAAU;AACnD,YAAM,OAAO,IAAI,OAAO,qBAAqB;AAC7C,YAAM,SAAS,YAAY,IAAI,OAAO,kBAAkB,OAAO;AAC/D,MAAAA,OAAM;AAAA,QACJ,OAAO,IAAI,EAAE,QAAQ,IAAI,WAAW,MAAM,IAAI,UAAU,QAAQ,IAAI,MAAM,QAAQ,MAAM,IAAI,MAAM,MAAM;AAAA,MAC1G;AACA,UAAI,IAAI,OAAO,eAAe;AAC5B,QAAAA,OAAM;AAAA,UACJ,uBAAuB,YAAY,IAAI,MAAM,aAAa,CAAC;AAAA,QAC7D;AAAA,MACF;AAAA,IACF;AACA,WAAOA,OAAM,KAAK,IAAI,IAAI;AAAA,EAC5B;AAGA,QAAM,QAAkB,CAAC,oBAAoB,KAAK,MAAM,IAAI;AAC5D,QAAM,KAAK,EAAE;AACb,aAAW,OAAO,MAAM;AACtB,UAAM,aAAa,IAAI,UAAU,YAAY;AAC7C,UAAM,SAAS,YAAY,IAAI,OAAO,kBAAkB,OAAO;AAC/D,UAAM,WAAW,aAAa,IAAI,OAAO,YAAY,gBAAgB;AACrE,UAAM,OAAO,IAAI,OAAO,qBAAqB;AAC7C,UAAM,KAAK,KAAK,IAAI,EAAE,MAAM,IAAI,WAAW,GAAG;AAC9C,UAAM,KAAK,sBAAsB,UAAU,KAAK,MAAM,EAAE;AACxD,UAAM,KAAK,sBAAsB,QAAQ,EAAE;AAC3C,UAAM,KAAK,sBAAsB,IAAI,EAAE;AACvC,QAAI,IAAI,OAAO,eAAe;AAC5B,YAAM,KAAK,sBAAsB,IAAI,MAAM,aAAa,EAAE;AAAA,IAC5D;AAAA,EACF;AACA,SAAO,MAAM,KAAK,IAAI;AACxB;AAKO,SAAS,0BACd,aACA,QACA,QACQ;AAIR,QAAM,KAAK,OAAO,UAAU,UAAa,OAAO,oBAAoB;AAEpE,MAAI,WAAW,QAAQ;AACrB,WAAO,KAAK;AAAA,MACV;AAAA,QACE,WAAW;AAAA,QACX,cAAc,OAAO;AAAA,QACrB,OAAO,OAAO,SAAS;AAAA,QACvB,iBAAiB,OAAO,mBAAmB;AAAA,QAC3C;AAAA,MACF;AAAA,MACA;AAAA,MACA;AAAA,IACF;AAAA,EACF;AAEA,MAAI,WAAW,YAAY;AACzB,UAAMA,SAAkB,CAAC,uBAAuB,WAAW,MAAM,EAAE;AACnE,IAAAA,OAAM,KAAK,iBAAiB,KAAK,YAAY,OAAO,EAAE;AACtD,IAAAA,OAAM,KAAK,wBAAwB,OAAO,YAAY,EAAE;AACxD,QAAI,OAAO,UAAU,QAAW;AAC9B,MAAAA,OAAM,KAAK,gBAAgB,OAAO,KAAK,EAAE;AAAA,IAC3C;AACA,QAAI,OAAO,oBAAoB,QAAW;AACxC,YAAM,QACJ,OAAO,UAAU,SACb,4CACA;AACN,MAAAA,OAAM,KAAK,OAAO,KAAK,OAAO,OAAO,eAAe,EAAE;AAAA,IACxD;AACA,WAAOA,OAAM,KAAK,IAAI,IAAI;AAAA,EAC5B;AAGA,QAAM,QAAkB,CAAC;AACzB,MAAI,IAAI;AACN,UAAM,KAAK,mBAAmB,WAAW,YAAO;AAChD,UAAM,KAAK,oBAAoB,OAAO,YAAY,EAAE;AAAA,EACtD,OAAO;AACL,UAAM,KAAK,mBAAmB,WAAW,gBAAW;AACpD,UAAM,KAAK,oBAAoB,OAAO,YAAY,EAAE;AACpD,QAAI,OAAO,UAAU,QAAW;AAC9B,YAAM,KAAK,oBAAoB,OAAO,KAAK,EAAE;AAAA,IAC/C;AACA,QAAI,OAAO,oBAAoB,QAAW;AACxC,YAAM;AAAA,QACJ,wBAAwB,OAAO,eAAe;AAAA,MAChD;AACA,UAAI,OAAO,UAAU,QAAW;AAC9B,cAAM;AAAA,UACJ,OAAO,eAAe,IAClB,uGACA;AAAA,QACN;AAAA,MACF,OAAO;AACL,cAAM;AAAA,UACJ;AAAA,QACF;AAAA,MACF;AAAA,IACF;AAAA,EACF;AACA,SAAO,MAAM,KAAK,IAAI;AACxB;AAwDA,eAAsB,qBACpB,MAC6B;AAC7B,QAAM,EAAE,aAAa,YAAY,QAAQ,UAAU,cAAc,IAAI;AAErE,MAAI;AACJ,MAAI;AAGJ,MAAI;AACF,iBAAa,MAAM,OAAO,YAAY,UAAU,IAAI;AAAA,EACtD,SAAS,KAAK;AACZ,UAAM,MAAM,eAAe,QAAQ,IAAI,UAAU,OAAO,GAAG;AAE3D,QAAI;AACJ,QAAI;AACF,YAAM,cAAc;AAAA,QAClB,QAAQ,YAAY,UAAU;AAAA,QAC9B,gBAAgB;AAAA,QAChB,eAAe;AAAA,QACf,mBAAmB,YAAY,qBAAqB;AAAA,MACtD,CAAC;AAAA,IACH,SAAS,UAAU;AACjB,wBAAkB,oBAAoB,QAAQ,SAAS,UAAU,OAAO,QAAQ;AAChF,cAAQ;AAAA,QACN,uBAAuB,WAAW,yDAAyD,eAAe,sBAAsB,GAAG;AAAA,MACrI;AAAA,IACF;AACA,WAAO;AAAA,MACL,cAAc;AAAA,MACd,OAAO;AAAA,MACP,GAAI,oBAAoB,SAAY,EAAE,gBAAgB,IAAI,CAAC;AAAA,IAC7D;AAAA,EACF;AAMA,MAAI,WAAW,QAAQ,SAAS,GAAG;AACjC,QAAI;AACF,YAAM,SAAS,WAAW,OAAO;AAAA,IACnC,SAAS,KAAK;AACZ,oBAAc,eAAe,QAAQ,IAAI,UAAU,OAAO,GAAG;AAAA,IAC/D;AAAA,EACF;AAEA,MAAI,gBAAgB,QAAW;AAE7B,QAAI;AACJ,QAAI;AACF,YAAM,cAAc;AAAA,QAClB,QAAQ,YAAY,UAAU;AAAA,QAC9B,gBAAgB;AAAA,QAChB,eAAe;AAAA,QACf,mBAAmB,YAAY,qBAAqB;AAAA,MACtD,CAAC;AAAA,IACH,SAAS,UAAU;AACjB,wBAAkB,oBAAoB,QAAQ,SAAS,UAAU,OAAO,QAAQ;AAMhF,cAAQ;AAAA,QACN,uBAAuB,WAAW,2DAA2D,eAAe,sBAAsB,WAAW;AAAA,MAC/I;AAAA,IACF;AACA,WAAO;AAAA,MACL,cAAc;AAAA,MACd,OAAO;AAAA,MACP,GAAI,oBAAoB,SAAY,EAAE,gBAAgB,IAAI,CAAC;AAAA,IAC7D;AAAA,EACF;AASA,QAAM,eAAe,WAAW,QAAQ;AACxC,MAAI;AACF,UAAM,cAAc;AAAA,MAClB,QAAQ,WAAW;AAAA,MACnB,gBAAgB;AAAA,MAChB,oBAAoB,YAAY,qBAAqB,KAAK;AAAA,IAC5D,CAAC;AAAA,EACH,SAAS,UAAU;AACjB,UAAM,WAAW,oBAAoB,QAAQ,SAAS,UAAU,OAAO,QAAQ;AAI/E,WAAO,EAAE,cAAc,iBAAiB,SAAS;AAAA,EACnD;AAEA,SAAO,EAAE,aAAa;AACxB;AAUA,SAAS,YAAY,OAAuB;AAC1C,SAAO,MAAM,QAAQ,OAAO,MAAM,EAAE,QAAQ,OAAO,KAAK;AAC1D;","names":["lines"]}

package/dist/chunk-PIRJPV5T.js.map

@@ -1 +0,0 @@
-{"version":3,"sources":["../src/search/remote-backend.ts"],"sourcesContent":["import { log } from \"../logger.js\";\nimport type { SearchBackend, SearchExecutionOptions, SearchQueryOptions, SearchResult } from \"./port.js\";\n\nexport interface RemoteSearchBackendOptions {\n  baseUrl: string;\n  apiKey?: string;\n  timeoutMs?: number;\n}\n\n/**\n * HTTP REST search backend adapter.\n *\n * Delegates search to a remote service. Maintenance methods are no-ops\n * (remote backends manage their own indexing).\n */\nexport class RemoteSearchBackend implements SearchBackend {\n  private readonly baseUrl: string;\n  private readonly apiKey?: string;\n  private readonly timeoutMs: number;\n  private available = false;\n\n  constructor(opts: RemoteSearchBackendOptions) {\n    let url = opts.baseUrl;\n    while (url.endsWith(\"/\")) url = url.slice(0, -1);\n    this.baseUrl = url;\n    this.apiKey = opts.apiKey;\n    this.timeoutMs = opts.timeoutMs ?? 30_000;\n  }\n\n  async probe(): Promise<boolean> {\n    try {\n      const res = await fetch(`${this.baseUrl}/health`, {\n        method: \"GET\",\n        headers: this.headers(),\n        signal: AbortSignal.timeout(this.timeoutMs),\n      });\n      this.available = res.ok;\n      return this.available;\n    } catch (err) {\n      log.debug(`RemoteSearchBackend probe failed: ${err}`);\n      this.available = false;\n      return false;\n    }\n  }\n\n  isAvailable(): boolean {\n    return this.available;\n  }\n\n  debugStatus(): string {\n    return `backend=remote available=${this.available} baseUrl=${this.baseUrl}`;\n  }\n\n  async search(\n    query: string,\n    collection?: string,\n    maxResults?: number,\n    _options?: SearchQueryOptions,\n    execution?: SearchExecutionOptions,\n  ): Promise<SearchResult[]> {\n    return this.post(\"/search/deep\", { query, collection, maxResults }, execution);\n  }\n\n  async searchGlobal(query: string, maxResults?: number, execution?: SearchExecutionOptions): Promise<SearchResult[]> {\n    return this.post(\"/search/deep\", { query, maxResults }, execution);\n  }\n\n  async bm25Search(query: string, collection?: string, maxResults?: number, execution?: SearchExecutionOptions): Promise<SearchResult[]> {\n    return this.post(\"/search/bm25\", { query, collection, maxResults }, execution);\n  }\n\n  async vectorSearch(query: string, collection?: string, maxResults?: number, execution?: SearchExecutionOptions): Promise<SearchResult[]> {\n    return this.post(\"/search/vector\", { query, collection, maxResults }, execution);\n  }\n\n  async hybridSearch(query: string, collection?: string, maxResults?: number, execution?: SearchExecutionOptions): Promise<SearchResult[]> {\n    return this.post(\"/search/hybrid\", { query, collection, maxResults }, execution);\n  }\n\n  async update(_execution?: SearchExecutionOptions): Promise<void> {}\n  async updateCollection(_collection: string, _execution?: SearchExecutionOptions): Promise<void> {}\n  async embed(): Promise<void> {}\n  async embedCollection(_collection: string): Promise<void> {}\n\n  async ensureCollection(_memoryDir: string): Promise<\"skipped\"> {\n    return \"skipped\";\n  }\n\n  private headers(): Record<string, string> {\n    const h: Record<string, string> = { \"Content-Type\": \"application/json\" };\n    if (this.apiKey) {\n      h[\"Authorization\"] = `Bearer ${this.apiKey}`;\n    }\n    return h;\n  }\n\n  private async post(\n    endpoint: string,\n    body: Record<string, unknown>,\n    execution?: SearchExecutionOptions,\n  ): Promise<SearchResult[]> {\n    if (!this.available) return [];\n    try {\n      const res = await fetch(`${this.baseUrl}${endpoint}`, {\n        method: \"POST\",\n        headers: this.headers(),\n        body: JSON.stringify(body),\n        signal: execution?.signal\n          ? AbortSignal.any([execution.signal, AbortSignal.timeout(this.timeoutMs)])\n          : AbortSignal.timeout(this.timeoutMs),\n      });\n      if (!res.ok) {\n        log.debug(`RemoteSearchBackend ${endpoint} returned ${res.status}`);\n        return [];\n      }\n      const data = await res.json();\n      if (!Array.isArray(data)) return [];\n      return data as SearchResult[];\n    } catch (err) {\n      log.debug(`RemoteSearchBackend ${endpoint} failed: ${err}`);\n      return [];\n    }\n  }\n}\n"],"mappings":";;;;;AAeO,IAAM,sBAAN,MAAmD;AAAA,EACvC;AAAA,EACA;AAAA,EACA;AAAA,EACT,YAAY;AAAA,EAEpB,YAAY,MAAkC;AAC5C,QAAI,MAAM,KAAK;AACf,WAAO,IAAI,SAAS,GAAG,EAAG,OAAM,IAAI,MAAM,GAAG,EAAE;AAC/C,SAAK,UAAU;AACf,SAAK,SAAS,KAAK;AACnB,SAAK,YAAY,KAAK,aAAa;AAAA,EACrC;AAAA,EAEA,MAAM,QAA0B;AAC9B,QAAI;AACF,YAAM,MAAM,MAAM,MAAM,GAAG,KAAK,OAAO,WAAW;AAAA,QAChD,QAAQ;AAAA,QACR,SAAS,KAAK,QAAQ;AAAA,QACtB,QAAQ,YAAY,QAAQ,KAAK,SAAS;AAAA,MAC5C,CAAC;AACD,WAAK,YAAY,IAAI;AACrB,aAAO,KAAK;AAAA,IACd,SAAS,KAAK;AACZ,UAAI,MAAM,qCAAqC,GAAG,EAAE;AACpD,WAAK,YAAY;AACjB,aAAO;AAAA,IACT;AAAA,EACF;AAAA,EAEA,cAAuB;AACrB,WAAO,KAAK;AAAA,EACd;AAAA,EAEA,cAAsB;AACpB,WAAO,4BAA4B,KAAK,SAAS,YAAY,KAAK,OAAO;AAAA,EAC3E;AAAA,EAEA,MAAM,OACJ,OACA,YACA,YACA,UACA,WACyB;AACzB,WAAO,KAAK,KAAK,gBAAgB,EAAE,OAAO,YAAY,WAAW,GAAG,SAAS;AAAA,EAC/E;AAAA,EAEA,MAAM,aAAa,OAAe,YAAqB,WAA6D;AAClH,WAAO,KAAK,KAAK,gBAAgB,EAAE,OAAO,WAAW,GAAG,SAAS;AAAA,EACnE;AAAA,EAEA,MAAM,WAAW,OAAe,YAAqB,YAAqB,WAA6D;AACrI,WAAO,KAAK,KAAK,gBAAgB,EAAE,OAAO,YAAY,WAAW,GAAG,SAAS;AAAA,EAC/E;AAAA,EAEA,MAAM,aAAa,OAAe,YAAqB,YAAqB,WAA6D;AACvI,WAAO,KAAK,KAAK,kBAAkB,EAAE,OAAO,YAAY,WAAW,GAAG,SAAS;AAAA,EACjF;AAAA,EAEA,MAAM,aAAa,OAAe,YAAqB,YAAqB,WAA6D;AACvI,WAAO,KAAK,KAAK,kBAAkB,EAAE,OAAO,YAAY,WAAW,GAAG,SAAS;AAAA,EACjF;AAAA,EAEA,MAAM,OAAO,YAAoD;AAAA,EAAC;AAAA,EAClE,MAAM,iBAAiB,aAAqB,YAAoD;AAAA,EAAC;AAAA,EACjG,MAAM,QAAuB;AAAA,EAAC;AAAA,EAC9B,MAAM,gBAAgB,aAAoC;AAAA,EAAC;AAAA,EAE3D,MAAM,iBAAiB,YAAwC;AAC7D,WAAO;AAAA,EACT;AAAA,EAEQ,UAAkC;AACxC,UAAM,IAA4B,EAAE,gBAAgB,mBAAmB;AACvE,QAAI,KAAK,QAAQ;AACf,QAAE,eAAe,IAAI,UAAU,KAAK,MAAM;AAAA,IAC5C;AACA,WAAO;AAAA,EACT;AAAA,EAEA,MAAc,KACZ,UACA,MACA,WACyB;AACzB,QAAI,CAAC,KAAK,UAAW,QAAO,CAAC;AAC7B,QAAI;AACF,YAAM,MAAM,MAAM,MAAM,GAAG,KAAK,OAAO,GAAG,QAAQ,IAAI;AAAA,QACpD,QAAQ;AAAA,QACR,SAAS,KAAK,QAAQ;AAAA,QACtB,MAAM,KAAK,UAAU,IAAI;AAAA,QACzB,QAAQ,WAAW,SACf,YAAY,IAAI,CAAC,UAAU,QAAQ,YAAY,QAAQ,KAAK,SAAS,CAAC,CAAC,IACvE,YAAY,QAAQ,KAAK,SAAS;AAAA,MACxC,CAAC;AACD,UAAI,CAAC,IAAI,IAAI;AACX,YAAI,MAAM,uBAAuB,QAAQ,aAAa,IAAI,MAAM,EAAE;AAClE,eAAO,CAAC;AAAA,MACV;AACA,YAAM,OAAO,MAAM,IAAI,KAAK;AAC5B,UAAI,CAAC,MAAM,QAAQ,IAAI,EAAG,QAAO,CAAC;AAClC,aAAO;AAAA,IACT,SAAS,KAAK;AACZ,UAAI,MAAM,uBAAuB,QAAQ,YAAY,GAAG,EAAE;AAC1D,aAAO,CAAC;AAAA,IACV;AAAA,EACF;AACF;","names":[]}

package/dist/chunk-PZIAX57I.js.map

@@ -1 +0,0 @@
-{"version":3,"sources":["../src/maintenance/rebuild-observations.ts"],"sourcesContent":["import path from \"node:path\";\nimport { readdir, readFile } from \"node:fs/promises\";\nimport {\n  backupAndWriteRebuiltObservations,\n  toHourBucketIso,\n} from \"./observation-ledger-utils.js\";\n\ninterface TranscriptLikeEntry {\n  timestamp?: string;\n  role?: string;\n  sessionKey?: string;\n}\n\ninterface ObservationAggregate {\n  sessionKey: string;\n  hour: string;\n  turnCount: number;\n  userTurns: number;\n  assistantTurns: number;\n}\n\nexport interface RebuildObservationsOptions {\n  memoryDir: string;\n  dryRun?: boolean;\n  now?: Date;\n}\n\nexport interface RebuildObservationsResult {\n  dryRun: boolean;\n  scannedFiles: number;\n  parsedTurns: number;\n  malformedLines: number;\n  rebuiltRows: number;\n  outputPath: string;\n  backupPath?: string;\n}\n\nfunction toSortableKey(sessionKey: string, hour: string): string {\n  return `${sessionKey}\\u0000${hour}`;\n}\n\nasync function listTranscriptFiles(root: string): Promise<string[]> {\n  const out: string[] = [];\n  let entries: Array<{\n    name: string;\n    isDirectory(): boolean;\n    isFile(): boolean;\n    isSymbolicLink(): boolean;\n  }>;\n  try {\n    entries = (await readdir(root, { withFileTypes: true })) as Array<{\n      name: string;\n      isDirectory(): boolean;\n      isFile(): boolean;\n      isSymbolicLink(): boolean;\n    }>;\n  } catch (err) {\n    const code = (err as NodeJS.ErrnoException).code;\n    if (code && code === \"ENOENT\") return out;\n    throw err;\n  }\n\n  for (const entry of entries) {\n    if (entry.name === \".\" || entry.name === \"..\") continue;\n    if (entry.isSymbolicLink()) continue;\n    const full = path.join(root, entry.name);\n    if (entry.isDirectory()) {\n      out.push(...(await listTranscriptFiles(full)));\n      continue;\n    }\n    if (entry.isFile() && entry.name.endsWith(\".jsonl\")) {\n      out.push(full);\n    }\n  }\n\n  out.sort((a, b) => a.localeCompare(b));\n  return out;\n}\n\nfunction buildLedgerRows(linesByFile: string[]): {\n  aggregates: ObservationAggregate[];\n  parsedTurns: number;\n  malformedLines: number;\n} {\n  const byKey = new Map<string, ObservationAggregate>();\n  let parsedTurns = 0;\n  let malformedLines = 0;\n\n  for (const rawFile of linesByFile) {\n    for (const line of rawFile.split(\"\\n\")) {\n      if (!line.trim()) continue;\n      let parsed: TranscriptLikeEntry;\n      try {\n        const candidate = JSON.parse(line);\n        if (candidate == null || typeof candidate !== \"object\" || Array.isArray(candidate)) {\n          malformedLines += 1;\n          continue;\n        }\n        parsed = candidate as TranscriptLikeEntry;\n      } catch {\n        malformedLines += 1;\n        continue;\n      }\n\n      if (typeof parsed.sessionKey !== \"string\" || parsed.sessionKey.length === 0) continue;\n      if (parsed.role !== \"user\" && parsed.role !== \"assistant\") continue;\n      if (typeof parsed.timestamp !== \"string\") continue;\n      const hour = toHourBucketIso(parsed.timestamp);\n      if (!hour) continue;\n\n      const key = toSortableKey(parsed.sessionKey, hour);\n      const existing = byKey.get(key) ?? {\n        sessionKey: parsed.sessionKey,\n        hour,\n        turnCount: 0,\n        userTurns: 0,\n        assistantTurns: 0,\n      };\n      existing.turnCount += 1;\n      if (parsed.role === \"user\") existing.userTurns += 1;\n      if (parsed.role === \"assistant\") existing.assistantTurns += 1;\n      byKey.set(key, existing);\n      parsedTurns += 1;\n    }\n  }\n\n  const aggregates = Array.from(byKey.values()).sort((a, b) => {\n    if (a.sessionKey !== b.sessionKey) return a.sessionKey.localeCompare(b.sessionKey);\n    return a.hour.localeCompare(b.hour);\n  });\n\n  return { aggregates, parsedTurns, malformedLines };\n}\n\nexport async function rebuildObservations(\n  options: RebuildObservationsOptions,\n): Promise<RebuildObservationsResult> {\n  const dryRun = options.dryRun !== false;\n  const now = options.now ?? new Date();\n  const transcriptsRoot = path.join(options.memoryDir, \"transcripts\");\n  const outputPath = path.join(\n    options.memoryDir,\n    \"state\",\n    \"observation-ledger\",\n    \"rebuilt-observations.jsonl\",\n  );\n\n  const transcriptFiles = await listTranscriptFiles(transcriptsRoot);\n  const contents: string[] = [];\n  for (const file of transcriptFiles) {\n    try {\n      contents.push(await readFile(file, \"utf-8\"));\n    } catch {\n      // Fail-open: skip unreadable shards and continue rebuilding from healthy files.\n    }\n  }\n  const { aggregates, parsedTurns, malformedLines } = buildLedgerRows(contents);\n\n  let backupPath: string | undefined;\n  if (!dryRun) {\n    backupPath = await backupAndWriteRebuiltObservations({\n      memoryDir: options.memoryDir,\n      outputPath,\n      rows: aggregates,\n      now,\n    });\n  }\n\n  return {\n    dryRun,\n    scannedFiles: transcriptFiles.length,\n    parsedTurns,\n    malformedLines,\n    rebuiltRows: aggregates.length,\n    outputPath,\n    backupPath,\n  };\n}\n"],"mappings":";;;;;;AAAA,OAAO,UAAU;AACjB,SAAS,SAAS,gBAAgB;AAoClC,SAAS,cAAc,YAAoB,MAAsB;AAC/D,SAAO,GAAG,UAAU,KAAS,IAAI;AACnC;AAEA,eAAe,oBAAoB,MAAiC;AAClE,QAAM,MAAgB,CAAC;AACvB,MAAI;AAMJ,MAAI;AACF,cAAW,MAAM,QAAQ,MAAM,EAAE,eAAe,KAAK,CAAC;AAAA,EAMxD,SAAS,KAAK;AACZ,UAAM,OAAQ,IAA8B;AAC5C,QAAI,QAAQ,SAAS,SAAU,QAAO;AACtC,UAAM;AAAA,EACR;AAEA,aAAW,SAAS,SAAS;AAC3B,QAAI,MAAM,SAAS,OAAO,MAAM,SAAS,KAAM;AAC/C,QAAI,MAAM,eAAe,EAAG;AAC5B,UAAM,OAAO,KAAK,KAAK,MAAM,MAAM,IAAI;AACvC,QAAI,MAAM,YAAY,GAAG;AACvB,UAAI,KAAK,GAAI,MAAM,oBAAoB,IAAI,CAAE;AAC7C;AAAA,IACF;AACA,QAAI,MAAM,OAAO,KAAK,MAAM,KAAK,SAAS,QAAQ,GAAG;AACnD,UAAI,KAAK,IAAI;AAAA,IACf;AAAA,EACF;AAEA,MAAI,KAAK,CAAC,GAAG,MAAM,EAAE,cAAc,CAAC,CAAC;AACrC,SAAO;AACT;AAEA,SAAS,gBAAgB,aAIvB;AACA,QAAM,QAAQ,oBAAI,IAAkC;AACpD,MAAI,cAAc;AAClB,MAAI,iBAAiB;AAErB,aAAW,WAAW,aAAa;AACjC,eAAW,QAAQ,QAAQ,MAAM,IAAI,GAAG;AACtC,UAAI,CAAC,KAAK,KAAK,EAAG;AAClB,UAAI;AACJ,UAAI;AACF,cAAM,YAAY,KAAK,MAAM,IAAI;AACjC,YAAI,aAAa,QAAQ,OAAO,cAAc,YAAY,MAAM,QAAQ,SAAS,GAAG;AAClF,4BAAkB;AAClB;AAAA,QACF;AACA,iBAAS;AAAA,MACX,QAAQ;AACN,0BAAkB;AAClB;AAAA,MACF;AAEA,UAAI,OAAO,OAAO,eAAe,YAAY,OAAO,WAAW,WAAW,EAAG;AAC7E,UAAI,OAAO,SAAS,UAAU,OAAO,SAAS,YAAa;AAC3D,UAAI,OAAO,OAAO,cAAc,SAAU;AAC1C,YAAM,OAAO,gBAAgB,OAAO,SAAS;AAC7C,UAAI,CAAC,KAAM;AAEX,YAAM,MAAM,cAAc,OAAO,YAAY,IAAI;AACjD,YAAM,WAAW,MAAM,IAAI,GAAG,KAAK;AAAA,QACjC,YAAY,OAAO;AAAA,QACnB;AAAA,QACA,WAAW;AAAA,QACX,WAAW;AAAA,QACX,gBAAgB;AAAA,MAClB;AACA,eAAS,aAAa;AACtB,UAAI,OAAO,SAAS,OAAQ,UAAS,aAAa;AAClD,UAAI,OAAO,SAAS,YAAa,UAAS,kBAAkB;AAC5D,YAAM,IAAI,KAAK,QAAQ;AACvB,qBAAe;AAAA,IACjB;AAAA,EACF;AAEA,QAAM,aAAa,MAAM,KAAK,MAAM,OAAO,CAAC,EAAE,KAAK,CAAC,GAAG,MAAM;AAC3D,QAAI,EAAE,eAAe,EAAE,WAAY,QAAO,EAAE,WAAW,cAAc,EAAE,UAAU;AACjF,WAAO,EAAE,KAAK,cAAc,EAAE,IAAI;AAAA,EACpC,CAAC;AAED,SAAO,EAAE,YAAY,aAAa,eAAe;AACnD;AAEA,eAAsB,oBACpB,SACoC;AACpC,QAAM,SAAS,QAAQ,WAAW;AAClC,QAAM,MAAM,QAAQ,OAAO,oBAAI,KAAK;AACpC,QAAM,kBAAkB,KAAK,KAAK,QAAQ,WAAW,aAAa;AAClE,QAAM,aAAa,KAAK;AAAA,IACtB,QAAQ;AAAA,IACR;AAAA,IACA;AAAA,IACA;AAAA,EACF;AAEA,QAAM,kBAAkB,MAAM,oBAAoB,eAAe;AACjE,QAAM,WAAqB,CAAC;AAC5B,aAAW,QAAQ,iBAAiB;AAClC,QAAI;AACF,eAAS,KAAK,MAAM,SAAS,MAAM,OAAO,CAAC;AAAA,IAC7C,QAAQ;AAAA,IAER;AAAA,EACF;AACA,QAAM,EAAE,YAAY,aAAa,eAAe,IAAI,gBAAgB,QAAQ;AAE5E,MAAI;AACJ,MAAI,CAAC,QAAQ;AACX,iBAAa,MAAM,kCAAkC;AAAA,MACnD,WAAW,QAAQ;AAAA,MACnB;AAAA,MACA,MAAM;AAAA,MACN;AAAA,IACF,CAAC;AAAA,EACH;AAEA,SAAO;AAAA,IACL;AAAA,IACA,cAAc,gBAAgB;AAAA,IAC9B;AAAA,IACA;AAAA,IACA,aAAa,WAAW;AAAA,IACxB;AAAA,IACA;AAAA,EACF;AACF;","names":[]}