@theokit/sdk 5.14.0 → 5.15.1

package/dist/{chunk-NVQSBRG6.js.map → chunk-CBBT42VX.js.map}

@@ -1 +1 @@
-{"version":3,"sources":["../src/internal/llm/model-capabilities.ts"],"names":[],"mappings":";;;AAgCA,IAAM,qBAAA,GAA2C;AAAA,EAC/C,cAAA,EAAgB,KAAA;AAAA,EAChB,wBAAA,EAA0B,KAAA;AAAA,EAC1B,eAAA,EAAiB,KAAA;AAAA,EACjB,oBAAA,EAAsB,KAAA;AAAA,EACtB,gBAAA,EAAkB,IAAA;AAAA,EAClB,eAAA,EAAiB;AACnB,CAAA;AAGA,IAAM,gBAAA,GAAmB,CAAC,aAAA,EAAe,SAAA,EAAW,UAAU,CAAA;AAM9D,SAAS,gBAAgB,CAAA,EAAoC;AAC3D,EAAA,OAAO;AAAA,IACL,cAAA,EAAgB,EAAE,UAAA,EAAY,KAAA,EAAO,SAAS,OAAO,CAAA,IAAK,EAAE,UAAA,IAAc,KAAA;AAAA,IAC1E,wBAAA,EAA0B,EAAE,iBAAA,IAAqB,KAAA;AAAA,IACjD,eAAA,EAAiB,EAAE,SAAA,IAAa,KAAA;AAAA,IAChC,oBAAA,EAAuB,EAAkC,aAAA,IAAiB,KAAA;AAAA,IAC1E,gBAAA,EAAkB,CAAA,CAAE,KAAA,EAAO,OAAA,IAAW,qBAAA,CAAsB,gBAAA;AAAA,IAC5D,eAAA,EAAiB,CAAA,CAAE,KAAA,EAAO,MAAA,IAAU,qBAAA,CAAsB;AAAA,GAC5D;AACF;AAWO,SAAS,yBAAyB,OAAA,EAAoC;AAC3E,EAAA,MAAM,IAAA,GAAO,kBAAA,CAAmB,kBAAA,CAAmB,OAAO,CAAC,CAAA;AAG3D,EAAA,MAAM,SAAA,GAAY,oBAAoB,IAAI,CAAA;AAC1C,EAAA,IAAI,SAAA,KAAc,MAAA,EAAW,OAAO,eAAA,CAAgB,SAAS,CAAA;AAG7D,EAAA,MAAM,UAAA,GAAa,kBAAkB,IAAI,CAAA;AACzC,EAAA,IAAI,eAAe,IAAA,EAAM;AACvB,IAAA,MAAM,QAAA,GAAW,oBAAoB,UAAU,CAAA;AAC/C,IAAA,IAAI,QAAA,KAAa,MAAA,EAAW,OAAO,eAAA,CAAgB,QAAQ,CAAA;AAAA,EAC7D;AACA,EAAA,OAAO,qBAAA;AACT;AAUO,SAAS,uBAAuB,OAAA,EAAsC;AAC3E,EAAA,IAAI,OAAA,KAAY,QAAW,OAAO,KAAA;AAClC,EAAA,OAAO,uBAAA,CAAwB,IAAA,CAAK,kBAAA,CAAmB,OAAO,CAAC,CAAA;AACjE;AAEA,SAAS,mBAAmB,OAAA,EAAyB;AACnD,EAAA,KAAA,MAAW,UAAU,gBAAA,EAAkB;AACrC,IAAA,IAAI,OAAA,CAAQ,WAAW,MAAM,CAAA,SAAU,OAAA,CAAQ,KAAA,CAAM,OAAO,MAAM,CAAA;AAAA,EACpE;AACA,EAAA,OAAO,OAAA;AACT;AAOA,SAAS,mBAAmB,OAAA,EAAyB;AACnD,EAAA,MAAM,CAAA,GAAI,OAAA,CAAQ,OAAA,CAAQ,GAAG,CAAA;AAC7B,EAAA,OAAO,KAAK,CAAA,GAAI,OAAA,CAAQ,KAAA,CAAM,CAAA,EAAG,CAAC,CAAA,GAAI,OAAA;AACxC;AAGA,SAAS,kBAAkB,IAAA,EAAsB;AAC/C,EAAA,IAAI,KAAK,UAAA,CAAW,QAAQ,CAAA,EAAG,OAAO,aAAa,IAAI,CAAA,CAAA;AACvD,EAAA,IAAI,IAAA,CAAK,UAAA,CAAW,MAAM,CAAA,IAAK,IAAA,CAAK,WAAW,IAAI,CAAA,IAAK,IAAA,CAAK,UAAA,CAAW,IAAI,CAAA;AAC1E,IAAA,OAAO,UAAU,IAAI,CAAA,CAAA;AACvB,EAAA,IAAI,KAAK,UAAA,CAAW,QAAQ,CAAA,EAAG,OAAO,UAAU,IAAI,CAAA,CAAA;AACpD,EAAA,OAAO,IAAA;AACT","file":"chunk-NVQSBRG6.js","sourcesContent":["/**\n * T3.10c — Model capability registry (DR3 #17).\n *\n * Typed per-model flags that let the SDK gate features at the boundary\n * (before hitting the provider) instead of letting opaque 400s surface.\n *\n * Resolution algorithm:\n *   1. Strip routing prefixes (openrouter/, vertex/, bedrock/) AND the\n *      OpenRouter `:variant` suffix (:free/:nitro/…) to find the bare vendor id.\n *   2. Exact match in the `EXACT` catalog → return entry.\n *   3. Vendor inference (e.g., `claude-*` → `anthropic/claude-*`) → return entry.\n *   4. No match → conservative defaults (all false, minimum tokens).\n *\n * Module is internal, but `ModelCapabilities` + `resolveModelCapabilities` are\n * re-exported publicly via the `@theokit/sdk/models` subpath (see their @public tags).\n */\n\n/**\n * Per-model capability shape. Consumers use this to gate features at\n * the SDK boundary (before request construction, not after 400).\n *\n * @public\n */\nexport interface ModelCapabilities {\n  supportsVision: boolean;\n  supportsStructuredOutput: boolean;\n  supportsToolUse: boolean;\n  supportsCacheControl: boolean;\n  maxContextTokens: number;\n  maxOutputTokens: number;\n}\n\nconst CONSERVATIVE_DEFAULTS: ModelCapabilities = {\n  supportsVision: false,\n  supportsStructuredOutput: false,\n  supportsToolUse: false,\n  supportsCacheControl: false,\n  maxContextTokens: 4096,\n  maxOutputTokens: 4096,\n};\n\n/** Routing prefixes to strip to find the underlying vendor model. */\nconst ROUTING_PREFIXES = [\"openrouter/\", \"vertex/\", \"bedrock/\"] as const;\n\nimport { getCatalogModelInfo } from \"../providers/catalog-loader.js\";\nimport type { CatalogModel } from \"../providers/catalog-schema.js\";\n\n/** Map a catalog model block (models.dev shape) to the SDK's ModelCapabilities (M44 — catalog-backed). */\nfunction capsFromCatalog(m: CatalogModel): ModelCapabilities {\n  return {\n    supportsVision: m.modalities?.input?.includes(\"image\") ?? m.attachment ?? false,\n    supportsStructuredOutput: m.structured_output ?? false,\n    supportsToolUse: m.tool_call ?? false,\n    supportsCacheControl: (m as { cache_control?: boolean }).cache_control ?? false,\n    maxContextTokens: m.limit?.context ?? CONSERVATIVE_DEFAULTS.maxContextTokens,\n    maxOutputTokens: m.limit?.output ?? CONSERVATIVE_DEFAULTS.maxOutputTokens,\n  };\n}\n\n/**\n * Resolve per-model capability flags (vision/structured-output/tool-use/cache +\n * `maxContextTokens`/`maxOutputTokens`) for a model id. Pure, sync, offline (a\n * static catalog — no network). Strips routing prefixes (`openrouter/`/`vertex/`/\n * `bedrock/`) and OpenRouter `:variant` suffixes before lookup; unknown models get\n * conservative defaults. Public via `@theokit/sdk/models`.\n *\n * @public\n */\nexport function resolveModelCapabilities(modelId: string): ModelCapabilities {\n  const bare = stripVariantSuffix(stripRoutingPrefix(modelId));\n  // M44 — the catalog model-info index replaced the hand-curated EXACT map (single source of truth; the\n  // vendored provider-catalog.json carries the migrated data — parity-tested against the old map snapshot).\n  const fromIndex = getCatalogModelInfo(bare);\n  if (fromIndex !== undefined) return capsFromCatalog(fromIndex);\n  // Routing-prefixed models (vertex/claude-3-5-sonnet) strip to bare\n  // model name without vendor. Try inferring the vendor from the name.\n  const withVendor = inferVendorPrefix(bare);\n  if (withVendor !== bare) {\n    const vendored = getCatalogModelInfo(withVendor);\n    if (vendored !== undefined) return capsFromCatalog(vendored);\n  }\n  return CONSERVATIVE_DEFAULTS;\n}\n\n/**\n * B-412 / B-475 — whether a model id names an Anthropic model the loop sends cacheable system\n * blocks to. Decided by the id, not by the catalog's `supportsCacheControl`, which is false for the\n * Anthropic ids measured on OpenRouter. After the same routing prefixes the capability lookup\n * strips (`openrouter/`, `vertex/`, `bedrock/`), the id must start with `anthropic/` or `claude`,\n * so Vertex Anthropic ids match and Bedrock ids (`anthropic.claude-…`) do not.\n * @internal\n */\nexport function isAnthropicFamilyModel(modelId: string | undefined): boolean {\n  if (modelId === undefined) return false;\n  return /^(anthropic\\/|claude)/.test(stripRoutingPrefix(modelId));\n}\n\nfunction stripRoutingPrefix(modelId: string): string {\n  for (const prefix of ROUTING_PREFIXES) {\n    if (modelId.startsWith(prefix)) return modelId.slice(prefix.length);\n  }\n  return modelId;\n}\n\n/**\n * Strip an OpenRouter variant suffix (`:free`/`:nitro`/`:floor`/`:beta`/…) so the\n * catalog lookup hits the underlying model. Model slugs contain no `:` except the\n * variant separator, so cutting at the first `:` is safe.\n */\nfunction stripVariantSuffix(modelId: string): string {\n  const i = modelId.indexOf(\":\");\n  return i >= 0 ? modelId.slice(0, i) : modelId;\n}\n\n/** Infer vendor prefix from bare model name for routing-prefixed lookups. */\nfunction inferVendorPrefix(bare: string): string {\n  if (bare.startsWith(\"claude\")) return `anthropic/${bare}`;\n  if (bare.startsWith(\"gpt-\") || bare.startsWith(\"o1\") || bare.startsWith(\"o3\"))\n    return `openai/${bare}`;\n  if (bare.startsWith(\"gemini\")) return `google/${bare}`;\n  return bare;\n}\n"]}
+{"version":3,"sources":["../src/internal/llm/model-capabilities.ts"],"names":[],"mappings":";;;AAgCA,IAAM,qBAAA,GAA2C;AAAA,EAC/C,cAAA,EAAgB,KAAA;AAAA,EAChB,wBAAA,EAA0B,KAAA;AAAA,EAC1B,eAAA,EAAiB,KAAA;AAAA,EACjB,oBAAA,EAAsB,KAAA;AAAA,EACtB,gBAAA,EAAkB,IAAA;AAAA,EAClB,eAAA,EAAiB;AACnB,CAAA;AAGA,IAAM,gBAAA,GAAmB,CAAC,aAAA,EAAe,SAAA,EAAW,UAAU,CAAA;AAM9D,SAAS,gBAAgB,CAAA,EAAoC;AAC3D,EAAA,OAAO;AAAA,IACL,cAAA,EAAgB,EAAE,UAAA,EAAY,KAAA,EAAO,SAAS,OAAO,CAAA,IAAK,EAAE,UAAA,IAAc,KAAA;AAAA,IAC1E,wBAAA,EAA0B,EAAE,iBAAA,IAAqB,KAAA;AAAA,IACjD,eAAA,EAAiB,EAAE,SAAA,IAAa,KAAA;AAAA,IAChC,oBAAA,EAAuB,EAAkC,aAAA,IAAiB,KAAA;AAAA,IAC1E,gBAAA,EAAkB,CAAA,CAAE,KAAA,EAAO,OAAA,IAAW,qBAAA,CAAsB,gBAAA;AAAA,IAC5D,eAAA,EAAiB,CAAA,CAAE,KAAA,EAAO,MAAA,IAAU,qBAAA,CAAsB;AAAA,GAC5D;AACF;AAWO,SAAS,yBAAyB,OAAA,EAAoC;AAC3E,EAAA,MAAM,IAAA,GAAO,kBAAA,CAAmB,kBAAA,CAAmB,OAAO,CAAC,CAAA;AAG3D,EAAA,MAAM,SAAA,GAAY,oBAAoB,IAAI,CAAA;AAC1C,EAAA,IAAI,SAAA,KAAc,MAAA,EAAW,OAAO,eAAA,CAAgB,SAAS,CAAA;AAG7D,EAAA,MAAM,UAAA,GAAa,kBAAkB,IAAI,CAAA;AACzC,EAAA,IAAI,eAAe,IAAA,EAAM;AACvB,IAAA,MAAM,QAAA,GAAW,oBAAoB,UAAU,CAAA;AAC/C,IAAA,IAAI,QAAA,KAAa,MAAA,EAAW,OAAO,eAAA,CAAgB,QAAQ,CAAA;AAAA,EAC7D;AACA,EAAA,OAAO,qBAAA;AACT;AAUO,SAAS,uBAAuB,OAAA,EAAsC;AAC3E,EAAA,IAAI,OAAA,KAAY,QAAW,OAAO,KAAA;AAClC,EAAA,OAAO,uBAAA,CAAwB,IAAA,CAAK,kBAAA,CAAmB,OAAO,CAAC,CAAA;AACjE;AAEA,SAAS,mBAAmB,OAAA,EAAyB;AACnD,EAAA,KAAA,MAAW,UAAU,gBAAA,EAAkB;AACrC,IAAA,IAAI,OAAA,CAAQ,WAAW,MAAM,CAAA,SAAU,OAAA,CAAQ,KAAA,CAAM,OAAO,MAAM,CAAA;AAAA,EACpE;AACA,EAAA,OAAO,OAAA;AACT;AAOA,SAAS,mBAAmB,OAAA,EAAyB;AACnD,EAAA,MAAM,CAAA,GAAI,OAAA,CAAQ,OAAA,CAAQ,GAAG,CAAA;AAC7B,EAAA,OAAO,KAAK,CAAA,GAAI,OAAA,CAAQ,KAAA,CAAM,CAAA,EAAG,CAAC,CAAA,GAAI,OAAA;AACxC;AAGA,SAAS,kBAAkB,IAAA,EAAsB;AAC/C,EAAA,IAAI,KAAK,UAAA,CAAW,QAAQ,CAAA,EAAG,OAAO,aAAa,IAAI,CAAA,CAAA;AACvD,EAAA,IAAI,IAAA,CAAK,UAAA,CAAW,MAAM,CAAA,IAAK,IAAA,CAAK,WAAW,IAAI,CAAA,IAAK,IAAA,CAAK,UAAA,CAAW,IAAI,CAAA;AAC1E,IAAA,OAAO,UAAU,IAAI,CAAA,CAAA;AACvB,EAAA,IAAI,KAAK,UAAA,CAAW,QAAQ,CAAA,EAAG,OAAO,UAAU,IAAI,CAAA,CAAA;AACpD,EAAA,OAAO,IAAA;AACT","file":"chunk-CBBT42VX.js","sourcesContent":["/**\n * T3.10c — Model capability registry (DR3 #17).\n *\n * Typed per-model flags that let the SDK gate features at the boundary\n * (before hitting the provider) instead of letting opaque 400s surface.\n *\n * Resolution algorithm:\n *   1. Strip routing prefixes (openrouter/, vertex/, bedrock/) AND the\n *      OpenRouter `:variant` suffix (:free/:nitro/…) to find the bare vendor id.\n *   2. Exact match in the `EXACT` catalog → return entry.\n *   3. Vendor inference (e.g., `claude-*` → `anthropic/claude-*`) → return entry.\n *   4. No match → conservative defaults (all false, minimum tokens).\n *\n * Module is internal, but `ModelCapabilities` + `resolveModelCapabilities` are\n * re-exported publicly via the `@theokit/sdk/models` subpath (see their @public tags).\n */\n\n/**\n * Per-model capability shape. Consumers use this to gate features at\n * the SDK boundary (before request construction, not after 400).\n *\n * @public\n */\nexport interface ModelCapabilities {\n  supportsVision: boolean;\n  supportsStructuredOutput: boolean;\n  supportsToolUse: boolean;\n  supportsCacheControl: boolean;\n  maxContextTokens: number;\n  maxOutputTokens: number;\n}\n\nconst CONSERVATIVE_DEFAULTS: ModelCapabilities = {\n  supportsVision: false,\n  supportsStructuredOutput: false,\n  supportsToolUse: false,\n  supportsCacheControl: false,\n  maxContextTokens: 4096,\n  maxOutputTokens: 4096,\n};\n\n/** Routing prefixes to strip to find the underlying vendor model. */\nconst ROUTING_PREFIXES = [\"openrouter/\", \"vertex/\", \"bedrock/\"] as const;\n\nimport { getCatalogModelInfo } from \"../providers/catalog-loader.js\";\nimport type { CatalogModel } from \"../providers/catalog-schema.js\";\n\n/** Map a catalog model block (models.dev shape) to the SDK's ModelCapabilities (M44 — catalog-backed). */\nfunction capsFromCatalog(m: CatalogModel): ModelCapabilities {\n  return {\n    supportsVision: m.modalities?.input?.includes(\"image\") ?? m.attachment ?? false,\n    supportsStructuredOutput: m.structured_output ?? false,\n    supportsToolUse: m.tool_call ?? false,\n    supportsCacheControl: (m as { cache_control?: boolean }).cache_control ?? false,\n    maxContextTokens: m.limit?.context ?? CONSERVATIVE_DEFAULTS.maxContextTokens,\n    maxOutputTokens: m.limit?.output ?? CONSERVATIVE_DEFAULTS.maxOutputTokens,\n  };\n}\n\n/**\n * Resolve per-model capability flags (vision/structured-output/tool-use/cache +\n * `maxContextTokens`/`maxOutputTokens`) for a model id. Pure, sync, offline (a\n * static catalog — no network). Strips routing prefixes (`openrouter/`/`vertex/`/\n * `bedrock/`) and OpenRouter `:variant` suffixes before lookup; unknown models get\n * conservative defaults. Public via `@theokit/sdk/models`.\n *\n * @public\n */\nexport function resolveModelCapabilities(modelId: string): ModelCapabilities {\n  const bare = stripVariantSuffix(stripRoutingPrefix(modelId));\n  // M44 — the catalog model-info index replaced the hand-curated EXACT map (single source of truth; the\n  // vendored provider-catalog.json carries the migrated data — parity-tested against the old map snapshot).\n  const fromIndex = getCatalogModelInfo(bare);\n  if (fromIndex !== undefined) return capsFromCatalog(fromIndex);\n  // Routing-prefixed models (vertex/claude-3-5-sonnet) strip to bare\n  // model name without vendor. Try inferring the vendor from the name.\n  const withVendor = inferVendorPrefix(bare);\n  if (withVendor !== bare) {\n    const vendored = getCatalogModelInfo(withVendor);\n    if (vendored !== undefined) return capsFromCatalog(vendored);\n  }\n  return CONSERVATIVE_DEFAULTS;\n}\n\n/**\n * B-412 / B-475 — whether a model id names an Anthropic model the loop sends cacheable system\n * blocks to. Decided by the id, not by the catalog's `supportsCacheControl`, which is false for the\n * Anthropic ids measured on OpenRouter. After the same routing prefixes the capability lookup\n * strips (`openrouter/`, `vertex/`, `bedrock/`), the id must start with `anthropic/` or `claude`,\n * so Vertex Anthropic ids match and Bedrock ids (`anthropic.claude-…`) do not.\n * @internal\n */\nexport function isAnthropicFamilyModel(modelId: string | undefined): boolean {\n  if (modelId === undefined) return false;\n  return /^(anthropic\\/|claude)/.test(stripRoutingPrefix(modelId));\n}\n\nfunction stripRoutingPrefix(modelId: string): string {\n  for (const prefix of ROUTING_PREFIXES) {\n    if (modelId.startsWith(prefix)) return modelId.slice(prefix.length);\n  }\n  return modelId;\n}\n\n/**\n * Strip an OpenRouter variant suffix (`:free`/`:nitro`/`:floor`/`:beta`/…) so the\n * catalog lookup hits the underlying model. Model slugs contain no `:` except the\n * variant separator, so cutting at the first `:` is safe.\n */\nfunction stripVariantSuffix(modelId: string): string {\n  const i = modelId.indexOf(\":\");\n  return i >= 0 ? modelId.slice(0, i) : modelId;\n}\n\n/** Infer vendor prefix from bare model name for routing-prefixed lookups. */\nfunction inferVendorPrefix(bare: string): string {\n  if (bare.startsWith(\"claude\")) return `anthropic/${bare}`;\n  if (bare.startsWith(\"gpt-\") || bare.startsWith(\"o1\") || bare.startsWith(\"o3\"))\n    return `openai/${bare}`;\n  if (bare.startsWith(\"gemini\")) return `google/${bare}`;\n  return bare;\n}\n"]}

package/dist/chunk-CHKV2L2Y.cjs

@@ -0,0 +1,416 @@
+'use strict';
+
+var chunkVWYFGE27_cjs = require('./chunk-VWYFGE27.cjs');
+var chunkU3DW3WDE_cjs = require('./chunk-U3DW3WDE.cjs');
+var chunkZOFRNNZD_cjs = require('./chunk-ZOFRNNZD.cjs');
+var chunkCEGU5AVD_cjs = require('./chunk-CEGU5AVD.cjs');
+var chunkRNXXYF22_cjs = require('./chunk-RNXXYF22.cjs');
+var crypto = require('crypto');
+var promises = require('fs/promises');
+var path = require('path');
+var fs = require('fs');
+
+function diaryPath(root) {
+  return path.join(root, "dream-diary.md");
+}
+function renderDiaryEntry(entry) {
+  const stamp = new Date(entry.timestampMs).toISOString();
+  const hash = entryHash(entry).slice(0, 8);
+  return [
+    `## ${stamp}`,
+    "",
+    `- entry-hash: ${hash}`,
+    `- facts before: ${entry.factsBefore}`,
+    `- facts after: ${entry.factsAfter}`,
+    `- duplicates removed: ${entry.duplicatesRemoved}`,
+    `- clusters created: ${entry.clustersCreated}`,
+    `- notes written: ${entry.notesWritten}`,
+    ""
+  ].join("\n");
+}
+async function appendDiaryEntry(root, entry) {
+  const path = diaryPath(root);
+  let raw = "";
+  try {
+    raw = await promises.readFile(path, "utf8");
+  } catch {
+    raw = "# Dream Diary\n\n";
+  }
+  const next = `${raw.endsWith("\n") ? raw : `${raw}
+`}${renderDiaryEntry(entry)}`;
+  await chunkZOFRNNZD_cjs.replaceFileAtomic(path, next);
+}
+function entryHash(entry) {
+  return crypto.createHash("sha256").update(
+    [
+      entry.factsBefore,
+      entry.factsAfter,
+      entry.duplicatesRemoved,
+      entry.clustersCreated,
+      entry.notesWritten
+    ].join("|")
+  ).digest("hex");
+}
+
+// src/internal/memory/dreaming/phases.ts
+var DEFAULT_DEDUP_THRESHOLD = 0.95;
+var DEFAULT_CLUSTER_THRESHOLD = 0.75;
+var CONSOLIDATABLE_KINDS = /* @__PURE__ */ new Set(["project"]);
+var ATOMIC_KINDS = /* @__PURE__ */ new Set(["user", "feedback", "reference"]);
+function dedupPolicy(fact) {
+  if (fact.kind === void 0) return "exact";
+  if (ATOMIC_KINDS.has(fact.kind)) return "never";
+  return CONSOLIDATABLE_KINDS.has(fact.kind) ? "similar" : "never";
+}
+function normalizeForExactMatch(text) {
+  return text.trim().toLowerCase().replace(/\s+/g, " ").replace(/[.!?]+$/, "");
+}
+async function lightPhase(facts, embedding, threshold = DEFAULT_DEDUP_THRESHOLD) {
+  if (facts.length <= 1) return { kept: [...facts], duplicatesRemoved: 0 };
+  const never = facts.filter((f) => dedupPolicy(f) === "never");
+  const exact = facts.filter((f) => dedupPolicy(f) === "exact");
+  const similar = facts.filter((f) => dedupPolicy(f) === "similar");
+  const seen = /* @__PURE__ */ new Set();
+  const exactKept = [];
+  let removed = 0;
+  for (const f of exact) {
+    const key = normalizeForExactMatch(f.text);
+    if (seen.has(key)) {
+      removed += 1;
+      continue;
+    }
+    seen.add(key);
+    exactKept.push(f);
+  }
+  const sim = similar.length > 1 ? await dedupCandidates(similar, embedding, threshold) : { kept: [...similar], duplicatesRemoved: 0 };
+  return {
+    kept: [...never, ...exactKept, ...sim.kept],
+    duplicatesRemoved: removed + sim.duplicatesRemoved
+  };
+}
+async function dedupCandidates(facts, embedding, threshold) {
+  if (facts.length <= 1) return { kept: [...facts], duplicatesRemoved: 0 };
+  const vectors = await embedding.embed(facts.map((f) => f.text));
+  const keptIdx = [];
+  const keptVecs = [];
+  for (let i = 0; i < facts.length; i++) {
+    const vec = vectors[i] ?? [];
+    const isDup = keptVecs.some((kept2) => cosineSimilarity(vec, kept2) >= threshold);
+    if (isDup) continue;
+    keptIdx.push(i);
+    keptVecs.push(vec);
+  }
+  const kept = keptIdx.map((i) => facts[i]);
+  return { kept, duplicatesRemoved: facts.length - kept.length };
+}
+var DEFAULT_MAX_FACTS_PER_SWEEP = 500;
+async function remPhase(facts, embedding, threshold = DEFAULT_CLUSTER_THRESHOLD, maxFactsPerSweep = DEFAULT_MAX_FACTS_PER_SWEEP) {
+  if (facts.length === 0) return { clusters: [], factsLeftOut: 0 };
+  const capped = facts.length > maxFactsPerSweep ? facts.slice(0, maxFactsPerSweep) : facts;
+  const vectors = await embedding.embed(capped.map((f) => f.text));
+  const clusterOfIdx = unionFindByPairs(vectors, threshold);
+  const groups = bucketFactsByClusterRoot(capped, clusterOfIdx);
+  return {
+    clusters: [...groups.values()].map(buildClusterFromMembers),
+    factsLeftOut: facts.length - capped.length
+  };
+}
+function unionFindByPairs(vectors, threshold) {
+  const clusterOfIdx = vectors.map((_, i) => i);
+  for (let i = 0; i < vectors.length; i++) {
+    for (let j = i + 1; j < vectors.length; j++) {
+      if (cosineSimilarity(vectors[i] ?? [], vectors[j] ?? []) >= threshold) {
+        unifyClusters(clusterOfIdx, i, j);
+      }
+    }
+  }
+  return clusterOfIdx;
+}
+function bucketFactsByClusterRoot(facts, clusterOfIdx) {
+  const groups = /* @__PURE__ */ new Map();
+  for (let i = 0; i < facts.length; i++) {
+    const root = findRoot(clusterOfIdx, i);
+    const list = groups.get(root) ?? [];
+    list.push(facts[i]);
+    groups.set(root, list);
+  }
+  return groups;
+}
+function buildClusterFromMembers(members) {
+  const sorted = [...members].sort((a, b) => b.text.length - a.text.length);
+  return { representativeText: sorted[0]?.text ?? "", members };
+}
+function deepPhase(clusters, timestampMs) {
+  if (clusters.length === 0) return "";
+  const isoStamp = new Date(timestampMs).toISOString();
+  const lines = [`# Dreamed ${isoStamp}`, ""];
+  for (let i = 0; i < clusters.length; i++) {
+    const c = clusters[i];
+    if (c === void 0) continue;
+    lines.push(`## Cluster ${i + 1}: ${c.representativeText}`);
+    lines.push("");
+    for (const member of c.members) lines.push(`- ${member.text}`);
+    lines.push("");
+  }
+  return `${lines.join("\n")}
+`;
+}
+function cosineSimilarity(a, b) {
+  if (a.length === 0 || b.length === 0 || a.length !== b.length) return 0;
+  let dot = 0;
+  let aNorm = 0;
+  let bNorm = 0;
+  for (let i = 0; i < a.length; i++) {
+    const ai = a[i] ?? 0;
+    const bi = b[i] ?? 0;
+    dot += ai * bi;
+    aNorm += ai * ai;
+    bNorm += bi * bi;
+  }
+  const denom = Math.sqrt(aNorm) * Math.sqrt(bNorm);
+  return denom === 0 ? 0 : dot / denom;
+}
+function findRoot(parents, i) {
+  let root = i;
+  while (parents[root] !== root) {
+    const next = parents[root] ?? root;
+    if (next === root) break;
+    root = next;
+  }
+  parents[i] = root;
+  return root;
+}
+function unifyClusters(parents, a, b) {
+  const rootA = findRoot(parents, a);
+  const rootB = findRoot(parents, b);
+  if (rootA !== rootB) parents[rootB] = rootA;
+}
+function runDreamingSweep(options) {
+  return chunkU3DW3WDE_cjs.withCwdMutex(`dream:${options.cwd}`, () => runInner(options));
+}
+async function runInner(options) {
+  const now = options.now ?? Date.now;
+  const timestampMs = now();
+  try {
+    const root = options.memoryRoot ?? chunkVWYFGE27_cjs.resolveMemoryRoot(options.cwd);
+    const facts = await chunkVWYFGE27_cjs.readFactsFromMarkdown(
+      options.cwd,
+      options.memoryRoot ? { directory: options.memoryRoot } : void 0
+    );
+    if (facts.length === 0) {
+      return emptyResult("skipped");
+    }
+    const dedup = await lightPhase(facts, options.embedding, options.dedupThreshold);
+    const rem = await remPhase(dedup.kept, options.embedding, options.clusterThreshold);
+    const notesWritten = await writeConsolidatedNotes(root, rem.clusters, timestampMs);
+    const result = {
+      status: "ok",
+      factsBefore: facts.length,
+      factsAfter: dedup.kept.length,
+      duplicatesRemoved: dedup.duplicatesRemoved,
+      clustersCreated: rem.clusters.length,
+      notesWritten,
+      diaryEntryHash: void 0,
+      factsLeftOut: rem.factsLeftOut
+    };
+    await appendDiaryEntry(root, {
+      timestampMs,
+      factsBefore: result.factsBefore,
+      factsAfter: result.factsAfter,
+      duplicatesRemoved: result.duplicatesRemoved,
+      clustersCreated: result.clustersCreated,
+      notesWritten: result.notesWritten
+    });
+    return result;
+  } catch (cause) {
+    const message = cause instanceof Error ? cause.message : String(cause);
+    chunkRNXXYF22_cjs.diag(`[theokit-sdk] dreaming sweep failed: ${message}
+`);
+    return emptyResult("error");
+  }
+}
+async function writeConsolidatedNotes(root, clusters, timestampMs) {
+  if (clusters.length === 0) return 0;
+  const notesDir = path.join(root, "notes");
+  await promises.mkdir(notesDir, { recursive: true });
+  const isoSlug = new Date(timestampMs).toISOString().replace(/[^\dT]/g, "-");
+  const file = path.join(notesDir, `dreamed-${isoSlug}.md`);
+  const body = deepPhase(clusters, timestampMs);
+  await chunkZOFRNNZD_cjs.replaceFileAtomic(file, body);
+  return 1;
+}
+function emptyResult(status) {
+  const result = {
+    status,
+    factsBefore: 0,
+    factsAfter: 0,
+    duplicatesRemoved: 0,
+    clustersCreated: 0,
+    notesWritten: 0,
+    diaryEntryHash: void 0
+  };
+  return status === "skipped" ? { ...result, factsLeftOut: 0 } : result;
+}
+async function readAllSqliteFacts(root) {
+  const dbPath = chunkVWYFGE27_cjs.defaultIndexPath(root);
+  if (!fs.existsSync(dbPath)) return [];
+  const db = await chunkVWYFGE27_cjs.openMemoryDb({ filePath: dbPath });
+  try {
+    const stmt = db.prepare("SELECT id, path, source, start_line, end_line, text FROM chunks");
+    const rows = stmt.all();
+    return rows.map((r) => ({
+      ...r,
+      namespace: "default",
+      scope: "agent",
+      user_id: "default"
+    }));
+  } finally {
+    db.close();
+  }
+}
+function nfcEqual(a, b) {
+  return a.normalize("NFC") === b.normalize("NFC");
+}
+function assertUsableBatchSize(batchSize) {
+  if (batchSize === void 0) return;
+  if (!Number.isInteger(batchSize) || batchSize < 1) {
+    throw new chunkCEGU5AVD_cjs.ConfigurationError(
+      `migrateSqliteToLance: batchSize must be a whole number of at least 1; received ${String(batchSize)}.`,
+      { code: "invalid_batch_size" }
+    );
+  }
+}
+async function migrateSqliteToLance(opts) {
+  assertUsableBatchSize(opts.batchSize);
+  const cwd = opts.cwd;
+  const memoryRoot = chunkVWYFGE27_cjs.resolveMemoryRoot(cwd, { directory: opts.directory });
+  const finalPath = chunkVWYFGE27_cjs.lanceStoragePath(memoryRoot);
+  const newPath = path.join(memoryRoot, "lance-new");
+  const rawLog = opts.logger ?? ((m) => console.log(m));
+  const log = (m) => rawLog(chunkRNXXYF22_cjs.redactSecrets(m));
+  if (fs.existsSync(finalPath)) {
+    throw new chunkCEGU5AVD_cjs.ConfigurationError(
+      `Destination already exists: ${finalPath}. Remove it manually (\`rm -rf ${finalPath}\`) and re-run.`,
+      { code: "migration_destination_exists" }
+    );
+  }
+  if (fs.existsSync(newPath)) {
+    log(`Removing stale ${newPath} from a previous run...`);
+    fs.rmSync(newPath, { recursive: true, force: true });
+  }
+  log(`Reading SQLite facts from ${cwd}/.theokit/memory/index.sqlite ...`);
+  const sqliteFacts = await readAllSqliteFacts(memoryRoot);
+  log(`SQLite has ${sqliteFacts.length} facts.`);
+  if (sqliteFacts.length === 0) {
+    return {
+      countSqlite: 0,
+      countLance: 0,
+      validated: true,
+      sampleComparisons: [],
+      lancePath: finalPath,
+      committed: false
+    };
+  }
+  const placeholderEmbedding = {
+    id: "migration-placeholder",
+    model: "deterministic-hash",
+    dimension: 8,
+    embed: async (texts) => {
+      return texts.map((t) => {
+        const arr = new Array(8).fill(0);
+        for (let i = 0; i < t.length; i += 1) {
+          arr[i % 8] += t.charCodeAt(i);
+        }
+        return arr.map((x) => x / 1e3);
+      });
+    },
+    stats: () => ({ cacheHits: 0, cacheMisses: 0, httpCalls: 0, retries: 0 })
+  };
+  fs.mkdirSync(newPath, { recursive: true });
+  log(`Writing Lance index to ${newPath} ...`);
+  const lance = await chunkVWYFGE27_cjs.LanceIndex.open({
+    cwd,
+    embedding: placeholderEmbedding,
+    storagePath: newPath
+  });
+  const batchSize = opts.batchSize ?? 100;
+  for (let i = 0; i < sqliteFacts.length; i += batchSize) {
+    const batch = sqliteFacts.slice(i, i + batchSize).map((f) => ({
+      id: f.id,
+      text: f.text,
+      source: f.source,
+      namespace: f.namespace ?? "default",
+      scope: f.scope ?? "agent",
+      user_id: f.user_id ?? "default",
+      timestamp: 0
+    }));
+    await lance.addFacts(batch);
+    log(`  Migrated ${Math.min(i + batchSize, sqliteFacts.length)}/${sqliteFacts.length}`);
+  }
+  const lanceCount = await lance.countFacts("default");
+  log(`Lance has ${lanceCount} facts (expected ${sqliteFacts.length}).`);
+  const sampleSize = Math.min(10, sqliteFacts.length);
+  const sampleComparisons = [];
+  for (let i = 0; i < sampleSize; i += 1) {
+    const sqliteFact = sqliteFacts[Math.floor(i * sqliteFacts.length / sampleSize)];
+    if (sqliteFact === void 0) continue;
+    const hits = await lance.search(sqliteFact.text, {
+      namespace: sqliteFact.namespace ?? "default",
+      limit: 1
+    });
+    const hit = hits[0];
+    const match = hit !== void 0 && nfcEqual(hit.text, sqliteFact.text);
+    sampleComparisons.push({ id: sqliteFact.id, match });
+  }
+  const allMatch = sampleComparisons.every((c) => c.match);
+  const countMatch = lanceCount === sqliteFacts.length;
+  const validated = allMatch && countMatch;
+  await lance.close();
+  if (opts.dryRun === true) {
+    log("Dry-run mode \u2014 discarding Lance staging dir.");
+    fs.rmSync(newPath, { recursive: true, force: true });
+    return {
+      countSqlite: sqliteFacts.length,
+      countLance: lanceCount,
+      validated,
+      sampleComparisons,
+      lancePath: finalPath,
+      committed: false
+    };
+  }
+  if (!validated) {
+    log("Validation FAILED \u2014 leaving SQLite intact, removing Lance staging dir.");
+    fs.rmSync(newPath, { recursive: true, force: true });
+    return {
+      countSqlite: sqliteFacts.length,
+      countLance: lanceCount,
+      validated: false,
+      sampleComparisons,
+      lancePath: finalPath,
+      committed: false
+    };
+  }
+  fs.renameSync(newPath, finalPath);
+  log(`Migration committed to ${finalPath}.`);
+  return {
+    countSqlite: sqliteFacts.length,
+    countLance: lanceCount,
+    validated: true,
+    sampleComparisons,
+    lancePath: finalPath,
+    committed: true
+  };
+}
+
+exports.appendDiaryEntry = appendDiaryEntry;
+exports.deepPhase = deepPhase;
+exports.diaryPath = diaryPath;
+exports.entryHash = entryHash;
+exports.lightPhase = lightPhase;
+exports.migrateSqliteToLance = migrateSqliteToLance;
+exports.readAllSqliteFacts = readAllSqliteFacts;
+exports.remPhase = remPhase;
+exports.renderDiaryEntry = renderDiaryEntry;
+exports.runDreamingSweep = runDreamingSweep;
+//# sourceMappingURL=chunk-CHKV2L2Y.cjs.map
+//# sourceMappingURL=chunk-CHKV2L2Y.cjs.map

package/dist/chunk-CHKV2L2Y.cjs.map

@@ -0,0 +1 @@
+{"version":3,"sources":["../src/internal/memory/dreaming/diary.ts","../src/internal/memory/dreaming/phases.ts","../src/internal/memory/dreaming/run.ts","../src/internal/memory/migrate-sqlite-to-lance.ts"],"names":["join","readFile","replaceFileAtomic","createHash","kept","withCwdMutex","resolveMemoryRoot","readFactsFromMarkdown","diag","mkdir","defaultIndexPath","existsSync","openMemoryDb","ConfigurationError","lanceStoragePath","redactSecrets","rmSync","mkdirSync","LanceIndex","renameSync"],"mappings":";;;;;;;;;;;;AA6BO,SAAS,UAAU,IAAA,EAA0B;AAClD,EAAA,OAAOA,SAAA,CAAK,MAAM,gBAAgB,CAAA;AACpC;AAOO,SAAS,iBAAiB,KAAA,EAA2B;AAC1D,EAAA,MAAM,QAAQ,IAAI,IAAA,CAAK,KAAA,CAAM,WAAW,EAAE,WAAA,EAAY;AACtD,EAAA,MAAM,OAAO,SAAA,CAAU,KAAK,CAAA,CAAE,KAAA,CAAM,GAAG,CAAC,CAAA;AACxC,EAAA,OAAO;AAAA,IACL,MAAM,KAAK,CAAA,CAAA;AAAA,IACX,EAAA;AAAA,IACA,iBAAiB,IAAI,CAAA,CAAA;AAAA,IACrB,CAAA,gBAAA,EAAmB,MAAM,WAAW,CAAA,CAAA;AAAA,IACpC,CAAA,eAAA,EAAkB,MAAM,UAAU,CAAA,CAAA;AAAA,IAClC,CAAA,sBAAA,EAAyB,MAAM,iBAAiB,CAAA,CAAA;AAAA,IAChD,CAAA,oBAAA,EAAuB,MAAM,eAAe,CAAA,CAAA;AAAA,IAC5C,CAAA,iBAAA,EAAoB,MAAM,YAAY,CAAA,CAAA;AAAA,IACtC;AAAA,GACF,CAAE,KAAK,IAAI,CAAA;AACb;AAQA,eAAsB,gBAAA,CAAiB,MAAkB,KAAA,EAAkC;AACzF,EAAA,MAAM,IAAA,GAAO,UAAU,IAAI,CAAA;AAC3B,EAAA,IAAI,GAAA,GAAM,EAAA;AACV,EAAA,IAAI;AACF,IAAA,GAAA,GAAM,MAAMC,iBAAA,CAAS,IAAA,EAAM,MAAM,CAAA;AAAA,EACnC,CAAA,CAAA,MAAQ;AACN,IAAA,GAAA,GAAM,mBAAA;AAAA,EACR;AACA,EAAA,MAAM,IAAA,GAAO,GAAG,GAAA,CAAI,QAAA,CAAS,IAAI,CAAA,GAAI,GAAA,GAAM,GAAG,GAAG;AAAA,CAAI,CAAA,EAAG,gBAAA,CAAiB,KAAK,CAAC,CAAA,CAAA;AAC/E,EAAA,MAAMC,mCAAA,CAAkB,MAAM,IAAI,CAAA;AACpC;AAMO,SAAS,UAAU,KAAA,EAA2B;AACnD,EAAA,OAAOC,iBAAA,CAAW,QAAQ,CAAA,CACvB,MAAA;AAAA,IACC;AAAA,MACE,KAAA,CAAM,WAAA;AAAA,MACN,KAAA,CAAM,UAAA;AAAA,MACN,KAAA,CAAM,iBAAA;AAAA,MACN,KAAA,CAAM,eAAA;AAAA,MACN,KAAA,CAAM;AAAA,KACR,CAAE,KAAK,GAAG;AAAA,GACZ,CACC,OAAO,KAAK,CAAA;AACjB;;;ACzDA,IAAM,uBAAA,GAA0B,IAAA;AAChC,IAAM,yBAAA,GAA4B,IAAA;AAuBlC,IAAM,oBAAA,mBAAgD,IAAI,GAAA,CAAI,CAAC,SAAS,CAAC,CAAA;AACzE,IAAM,+BAAwC,IAAI,GAAA,CAAI,CAAC,MAAA,EAAQ,UAAA,EAAY,WAAW,CAAC,CAAA;AAmBvF,SAAS,YAAY,IAAA,EAA+B;AAClD,EAAA,IAAI,IAAA,CAAK,IAAA,KAAS,MAAA,EAAW,OAAO,OAAA;AACpC,EAAA,IAAI,YAAA,CAAa,GAAA,CAAI,IAAA,CAAK,IAAI,GAAG,OAAO,OAAA;AACxC,EAAA,OAAO,oBAAA,CAAqB,GAAA,CAAI,IAAA,CAAK,IAAI,IAAI,SAAA,GAAY,OAAA;AAC3D;AAGA,SAAS,uBAAuB,IAAA,EAAsB;AACpD,EAAA,OAAO,IAAA,CACJ,IAAA,EAAK,CACL,WAAA,EAAY,CACZ,OAAA,CAAQ,MAAA,EAAQ,GAAG,CAAA,CACnB,OAAA,CAAQ,SAAA,EAAW,EAAE,CAAA;AAC1B;AAuBA,eAAsB,UAAA,CACpB,KAAA,EACA,SAAA,EACA,SAAA,GAAoB,uBAAA,EACE;AACtB,EAAA,IAAI,KAAA,CAAM,MAAA,IAAU,CAAA,EAAG,OAAO,EAAE,IAAA,EAAM,CAAC,GAAG,KAAK,CAAA,EAAG,iBAAA,EAAmB,CAAA,EAAE;AACvE,EAAA,MAAM,KAAA,GAAQ,MAAM,MAAA,CAAO,CAAC,MAAM,WAAA,CAAY,CAAC,MAAM,OAAO,CAAA;AAC5D,EAAA,MAAM,KAAA,GAAQ,MAAM,MAAA,CAAO,CAAC,MAAM,WAAA,CAAY,CAAC,MAAM,OAAO,CAAA;AAC5D,EAAA,MAAM,OAAA,GAAU,MAAM,MAAA,CAAO,CAAC,MAAM,WAAA,CAAY,CAAC,MAAM,SAAS,CAAA;AAGhE,EAAA,MAAM,IAAA,uBAAW,GAAA,EAAY;AAC7B,EAAA,MAAM,YAA0B,EAAC;AACjC,EAAA,IAAI,OAAA,GAAU,CAAA;AACd,EAAA,KAAA,MAAW,KAAK,KAAA,EAAO;AACrB,IAAA,MAAM,GAAA,GAAM,sBAAA,CAAuB,CAAA,CAAE,IAAI,CAAA;AACzC,IAAA,IAAI,IAAA,CAAK,GAAA,CAAI,GAAG,CAAA,EAAG;AACjB,MAAA,OAAA,IAAW,CAAA;AACX,MAAA;AAAA,IACF;AACA,IAAA,IAAA,CAAK,IAAI,GAAG,CAAA;AACZ,IAAA,SAAA,CAAU,KAAK,CAAC,CAAA;AAAA,EAClB;AAEA,EAAA,MAAM,MACJ,OAAA,CAAQ,MAAA,GAAS,CAAA,GACb,MAAM,gBAAgB,OAAA,EAAS,SAAA,EAAW,SAAS,CAAA,GACnD,EAAE,IAAA,EAAM,CAAC,GAAG,OAAO,CAAA,EAAG,mBAAmB,CAAA,EAAE;AAIjD,EAAA,OAAO;AAAA,IACL,IAAA,EAAM,CAAC,GAAG,KAAA,EAAO,GAAG,SAAA,EAAW,GAAG,IAAI,IAAI,CAAA;AAAA,IAC1C,iBAAA,EAAmB,UAAU,GAAA,CAAI;AAAA,GACnC;AACF;AAEA,eAAe,eAAA,CACb,KAAA,EACA,SAAA,EACA,SAAA,EACsB;AACtB,EAAA,IAAI,KAAA,CAAM,MAAA,IAAU,CAAA,EAAG,OAAO,EAAE,IAAA,EAAM,CAAC,GAAG,KAAK,CAAA,EAAG,iBAAA,EAAmB,CAAA,EAAE;AACvE,EAAA,MAAM,OAAA,GAAU,MAAM,SAAA,CAAU,KAAA,CAAM,KAAA,CAAM,IAAI,CAAC,CAAA,KAAM,CAAA,CAAE,IAAI,CAAC,CAAA;AAC9D,EAAA,MAAM,UAAoB,EAAC;AAC3B,EAAA,MAAM,WAAuB,EAAC;AAC9B,EAAA,KAAA,IAAS,CAAA,GAAI,CAAA,EAAG,CAAA,GAAI,KAAA,CAAM,QAAQ,CAAA,EAAA,EAAK;AACrC,IAAA,MAAM,GAAA,GAAM,OAAA,CAAQ,CAAC,CAAA,IAAK,EAAC;AAC3B,IAAA,MAAM,KAAA,GAAQ,SAAS,IAAA,CAAK,CAACC,UAAS,gBAAA,CAAiB,GAAA,EAAKA,KAAI,CAAA,IAAK,SAAS,CAAA;AAC9E,IAAA,IAAI,KAAA,EAAO;AACX,IAAA,OAAA,CAAQ,KAAK,CAAC,CAAA;AACd,IAAA,QAAA,CAAS,KAAK,GAAG,CAAA;AAAA,EACnB;AACA,EAAA,MAAM,OAAO,OAAA,CAAQ,GAAA,CAAI,CAAC,CAAA,KAAM,KAAA,CAAM,CAAC,CAAe,CAAA;AACtD,EAAA,OAAO,EAAE,IAAA,EAAM,iBAAA,EAAmB,KAAA,CAAM,MAAA,GAAS,KAAK,MAAA,EAAO;AAC/D;AAMA,IAAM,2BAAA,GAA8B,GAAA;AAGpC,eAAsB,SACpB,KAAA,EACA,SAAA,EACA,SAAA,GAAoB,yBAAA,EACpB,mBAA2B,2BAAA,EACH;AAaxB,EAAA,IAAI,KAAA,CAAM,WAAW,CAAA,EAAG,OAAO,EAAE,QAAA,EAAU,EAAC,EAAG,YAAA,EAAc,CAAA,EAAE;AAG/D,EAAA,MAAM,MAAA,GAAS,MAAM,MAAA,GAAS,gBAAA,GAAmB,MAAM,KAAA,CAAM,CAAA,EAAG,gBAAgB,CAAA,GAAI,KAAA;AACpF,EAAA,MAAM,OAAA,GAAU,MAAM,SAAA,CAAU,KAAA,CAAM,MAAA,CAAO,IAAI,CAAC,CAAA,KAAM,CAAA,CAAE,IAAI,CAAC,CAAA;AAC/D,EAAA,MAAM,YAAA,GAAe,gBAAA,CAAiB,OAAA,EAAS,SAAS,CAAA;AACxD,EAAA,MAAM,MAAA,GAAS,wBAAA,CAAyB,MAAA,EAAQ,YAAY,CAAA;AAC5D,EAAA,OAAO;AAAA,IACL,QAAA,EAAU,CAAC,GAAG,MAAA,CAAO,QAAQ,CAAA,CAAE,IAAI,uBAAuB,CAAA;AAAA,IAC1D,YAAA,EAAc,KAAA,CAAM,MAAA,GAAS,MAAA,CAAO;AAAA,GACtC;AACF;AAEA,SAAS,gBAAA,CACP,SACA,SAAA,EACU;AACV,EAAA,MAAM,eAAe,OAAA,CAAQ,GAAA,CAAI,CAAC,CAAA,EAAG,MAAM,CAAC,CAAA;AAC5C,EAAA,KAAA,IAAS,CAAA,GAAI,CAAA,EAAG,CAAA,GAAI,OAAA,CAAQ,QAAQ,CAAA,EAAA,EAAK;AACvC,IAAA,KAAA,IAAS,IAAI,CAAA,GAAI,CAAA,EAAG,CAAA,GAAI,OAAA,CAAQ,QAAQ,CAAA,EAAA,EAAK;AAC3C,MAAA,IAAI,gBAAA,CAAiB,OAAA,CAAQ,CAAC,CAAA,IAAK,EAAC,EAAG,OAAA,CAAQ,CAAC,CAAA,IAAK,EAAE,CAAA,IAAK,SAAA,EAAW;AACrE,QAAA,aAAA,CAAc,YAAA,EAAc,GAAG,CAAC,CAAA;AAAA,MAClC;AAAA,IACF;AAAA,EACF;AACA,EAAA,OAAO,YAAA;AACT;AAEA,SAAS,wBAAA,CACP,OACA,YAAA,EAC2B;AAC3B,EAAA,MAAM,MAAA,uBAAa,GAAA,EAA0B;AAC7C,EAAA,KAAA,IAAS,CAAA,GAAI,CAAA,EAAG,CAAA,GAAI,KAAA,CAAM,QAAQ,CAAA,EAAA,EAAK;AACrC,IAAA,MAAM,IAAA,GAAO,QAAA,CAAS,YAAA,EAAc,CAAC,CAAA;AACrC,IAAA,MAAM,IAAA,GAAO,MAAA,CAAO,GAAA,CAAI,IAAI,KAAK,EAAC;AAClC,IAAA,IAAA,CAAK,IAAA,CAAK,KAAA,CAAM,CAAC,CAAe,CAAA;AAChC,IAAA,MAAA,CAAO,GAAA,CAAI,MAAM,IAAI,CAAA;AAAA,EACvB;AACA,EAAA,OAAO,MAAA;AACT;AAEA,SAAS,wBAAwB,OAAA,EAA6C;AAC5E,EAAA,MAAM,MAAA,GAAS,CAAC,GAAG,OAAO,EAAE,IAAA,CAAK,CAAC,CAAA,EAAG,CAAA,KAAM,CAAA,CAAE,IAAA,CAAK,MAAA,GAAS,CAAA,CAAE,KAAK,MAAM,CAAA;AACxE,EAAA,OAAO,EAAE,kBAAA,EAAoB,MAAA,CAAO,CAAC,CAAA,EAAG,IAAA,IAAQ,IAAI,OAAA,EAAQ;AAC9D;AAGO,SAAS,SAAA,CAAU,UAAkC,WAAA,EAA6B;AACvF,EAAA,IAAI,QAAA,CAAS,MAAA,KAAW,CAAA,EAAG,OAAO,EAAA;AAClC,EAAA,MAAM,QAAA,GAAW,IAAI,IAAA,CAAK,WAAW,EAAE,WAAA,EAAY;AACnD,EAAA,MAAM,KAAA,GAAkB,CAAC,CAAA,UAAA,EAAa,QAAQ,IAAI,EAAE,CAAA;AACpD,EAAA,KAAA,IAAS,CAAA,GAAI,CAAA,EAAG,CAAA,GAAI,QAAA,CAAS,QAAQ,CAAA,EAAA,EAAK;AACxC,IAAA,MAAM,CAAA,GAAI,SAAS,CAAC,CAAA;AACpB,IAAA,IAAI,MAAM,MAAA,EAAW;AACrB,IAAA,KAAA,CAAM,KAAK,CAAA,WAAA,EAAc,CAAA,GAAI,CAAC,CAAA,EAAA,EAAK,CAAA,CAAE,kBAAkB,CAAA,CAAE,CAAA;AACzD,IAAA,KAAA,CAAM,KAAK,EAAE,CAAA;AACb,IAAA,KAAA,MAAW,MAAA,IAAU,EAAE,OAAA,EAAS,KAAA,CAAM,KAAK,CAAA,EAAA,EAAK,MAAA,CAAO,IAAI,CAAA,CAAE,CAAA;AAC7D,IAAA,KAAA,CAAM,KAAK,EAAE,CAAA;AAAA,EACf;AACA,EAAA,OAAO,CAAA,EAAG,KAAA,CAAM,IAAA,CAAK,IAAI,CAAC;AAAA,CAAA;AAC5B;AAEA,SAAS,gBAAA,CAAiB,GAA0B,CAAA,EAAkC;AACpF,EAAA,IAAI,CAAA,CAAE,MAAA,KAAW,CAAA,IAAK,CAAA,CAAE,MAAA,KAAW,KAAK,CAAA,CAAE,MAAA,KAAW,CAAA,CAAE,MAAA,EAAQ,OAAO,CAAA;AACtE,EAAA,IAAI,GAAA,GAAM,CAAA;AACV,EAAA,IAAI,KAAA,GAAQ,CAAA;AACZ,EAAA,IAAI,KAAA,GAAQ,CAAA;AACZ,EAAA,KAAA,IAAS,CAAA,GAAI,CAAA,EAAG,CAAA,GAAI,CAAA,CAAE,QAAQ,CAAA,EAAA,EAAK;AACjC,IAAA,MAAM,EAAA,GAAK,CAAA,CAAE,CAAC,CAAA,IAAK,CAAA;AACnB,IAAA,MAAM,EAAA,GAAK,CAAA,CAAE,CAAC,CAAA,IAAK,CAAA;AACnB,IAAA,GAAA,IAAO,EAAA,GAAK,EAAA;AACZ,IAAA,KAAA,IAAS,EAAA,GAAK,EAAA;AACd,IAAA,KAAA,IAAS,EAAA,GAAK,EAAA;AAAA,EAChB;AACA,EAAA,MAAM,QAAQ,IAAA,CAAK,IAAA,CAAK,KAAK,CAAA,GAAI,IAAA,CAAK,KAAK,KAAK,CAAA;AAChD,EAAA,OAAO,KAAA,KAAU,CAAA,GAAI,CAAA,GAAI,GAAA,GAAM,KAAA;AACjC;AAEA,SAAS,QAAA,CAAS,SAAmB,CAAA,EAAmB;AACtD,EAAA,IAAI,IAAA,GAAO,CAAA;AACX,EAAA,OAAO,OAAA,CAAQ,IAAI,CAAA,KAAM,IAAA,EAAM;AAC7B,IAAA,MAAM,IAAA,GAAO,OAAA,CAAQ,IAAI,CAAA,IAAK,IAAA;AAC9B,IAAA,IAAI,SAAS,IAAA,EAAM;AACnB,IAAA,IAAA,GAAO,IAAA;AAAA,EACT;AACA,EAAA,OAAA,CAAQ,CAAC,CAAA,GAAI,IAAA;AACb,EAAA,OAAO,IAAA;AACT;AAEA,SAAS,aAAA,CAAc,OAAA,EAAmB,CAAA,EAAW,CAAA,EAAiB;AACpE,EAAA,MAAM,KAAA,GAAQ,QAAA,CAAS,OAAA,EAAS,CAAC,CAAA;AACjC,EAAA,MAAM,KAAA,GAAQ,QAAA,CAAS,OAAA,EAAS,CAAC,CAAA;AACjC,EAAA,IAAI,KAAA,KAAU,KAAA,EAAO,OAAA,CAAQ,KAAK,CAAA,GAAI,KAAA;AACxC;ACxOO,SAAS,iBAAiB,OAAA,EAAmD;AAClF,EAAA,OAAOC,8BAAA,CAAa,SAAS,OAAA,CAAQ,GAAG,IAAI,MAAM,QAAA,CAAS,OAAO,CAAC,CAAA;AACrE;AAEA,eAAe,SAAS,OAAA,EAAmD;AACzE,EAAA,MAAM,GAAA,GAAM,OAAA,CAAQ,GAAA,IAAO,IAAA,CAAK,GAAA;AAChC,EAAA,MAAM,cAAc,GAAA,EAAI;AACxB,EAAA,IAAI;AACF,IAAA,MAAM,IAAA,GAAO,OAAA,CAAQ,UAAA,IAAcC,mCAAA,CAAkB,QAAQ,GAAG,CAAA;AAChE,IAAA,MAAM,QAAQ,MAAMC,uCAAA;AAAA,MAClB,OAAA,CAAQ,GAAA;AAAA,MACR,QAAQ,UAAA,GAAa,EAAE,SAAA,EAAW,OAAA,CAAQ,YAAW,GAAI,KAAA;AAAA,KAC3D;AACA,IAAA,IAAI,KAAA,CAAM,WAAW,CAAA,EAAG;AACtB,MAAA,OAAO,YAAY,SAAS,CAAA;AAAA,IAC9B;AACA,IAAA,MAAM,QAAQ,MAAM,UAAA,CAAW,OAAO,OAAA,CAAQ,SAAA,EAAW,QAAQ,cAAc,CAAA;AAC/E,IAAA,MAAM,GAAA,GAAM,MAAM,QAAA,CAAS,KAAA,CAAM,MAAM,OAAA,CAAQ,SAAA,EAAW,QAAQ,gBAAgB,CAAA;AAClF,IAAA,MAAM,eAAe,MAAM,sBAAA,CAAuB,IAAA,EAAM,GAAA,CAAI,UAAU,WAAW,CAAA;AACjF,IAAA,MAAM,MAAA,GAAyB;AAAA,MAC7B,MAAA,EAAQ,IAAA;AAAA,MACR,aAAa,KAAA,CAAM,MAAA;AAAA,MACnB,UAAA,EAAY,MAAM,IAAA,CAAK,MAAA;AAAA,MACvB,mBAAmB,KAAA,CAAM,iBAAA;AAAA,MACzB,eAAA,EAAiB,IAAI,QAAA,CAAS,MAAA;AAAA,MAC9B,YAAA;AAAA,MACA,cAAA,EAAgB,KAAA,CAAA;AAAA,MAChB,cAAc,GAAA,CAAI;AAAA,KACpB;AACA,IAAA,MAAM,iBAAiB,IAAA,EAAM;AAAA,MAC3B,WAAA;AAAA,MACA,aAAa,MAAA,CAAO,WAAA;AAAA,MACpB,YAAY,MAAA,CAAO,UAAA;AAAA,MACnB,mBAAmB,MAAA,CAAO,iBAAA;AAAA,MAC1B,iBAAiB,MAAA,CAAO,eAAA;AAAA,MACxB,cAAc,MAAA,CAAO;AAAA,KACtB,CAAA;AACD,IAAA,OAAO,MAAA;AAAA,EACT,SAAS,KAAA,EAAO;AACd,IAAA,MAAM,UAAU,KAAA,YAAiB,KAAA,GAAQ,KAAA,CAAM,OAAA,GAAU,OAAO,KAAK,CAAA;AACrE,IAAAC,sBAAA,CAAK,wCAAwC,OAAO;AAAA,CAAI,CAAA;AACxD,IAAA,OAAO,YAAY,OAAO,CAAA;AAAA,EAC5B;AACF;AAEA,eAAe,sBAAA,CACb,IAAA,EACA,QAAA,EACA,WAAA,EACiB;AACjB,EAAA,IAAI,QAAA,CAAS,MAAA,KAAW,CAAA,EAAG,OAAO,CAAA;AAClC,EAAA,MAAM,QAAA,GAAWR,SAAAA,CAAK,IAAA,EAAM,OAAO,CAAA;AACnC,EAAA,MAAMS,cAAA,CAAM,QAAA,EAAU,EAAE,SAAA,EAAW,MAAM,CAAA;AACzC,EAAA,MAAM,OAAA,GAAU,IAAI,IAAA,CAAK,WAAW,EAAE,WAAA,EAAY,CAAE,OAAA,CAAQ,SAAA,EAAW,GAAG,CAAA;AAC1E,EAAA,MAAM,IAAA,GAAOT,SAAAA,CAAK,QAAA,EAAU,CAAA,QAAA,EAAW,OAAO,CAAA,GAAA,CAAK,CAAA;AACnD,EAAA,MAAM,IAAA,GAAO,SAAA,CAAU,QAAA,EAAU,WAAW,CAAA;AAC5C,EAAA,MAAME,mCAAA,CAAkB,MAAM,IAAI,CAAA;AAClC,EAAA,OAAO,CAAA;AACT;AAEA,SAAS,YAAY,MAAA,EAA6C;AAChE,EAAA,MAAM,MAAA,GAAyB;AAAA,IAC7B,MAAA;AAAA,IACA,WAAA,EAAa,CAAA;AAAA,IACb,UAAA,EAAY,CAAA;AAAA,IACZ,iBAAA,EAAmB,CAAA;AAAA,IACnB,eAAA,EAAiB,CAAA;AAAA,IACjB,YAAA,EAAc,CAAA;AAAA,IACd,cAAA,EAAgB;AAAA,GAClB;AAEA,EAAA,OAAO,WAAW,SAAA,GAAY,EAAE,GAAG,MAAA,EAAQ,YAAA,EAAc,GAAE,GAAI,MAAA;AACjE;AC7DA,eAAsB,mBAAmB,IAAA,EAA4C;AACnF,EAAA,MAAM,MAAA,GAASQ,mCAAiB,IAAI,CAAA;AACpC,EAAA,IAAI,CAACC,aAAA,CAAW,MAAM,CAAA,SAAU,EAAC;AACjC,EAAA,MAAM,KAAK,MAAMC,8BAAA,CAAa,EAAE,QAAA,EAAU,QAAQ,CAAA;AAClD,EAAA,IAAI;AAGF,IAAA,MAAM,IAAA,GAAO,EAAA,CAAG,OAAA,CAAQ,iEAAiE,CAAA;AACzF,IAAA,MAAM,IAAA,GAAO,KAAK,GAAA,EAAI;AAQtB,IAAA,OAAO,IAAA,CAAK,GAAA,CAAI,CAAC,CAAA,MAAO;AAAA,MACtB,GAAG,CAAA;AAAA,MACH,SAAA,EAAW,SAAA;AAAA,MACX,KAAA,EAAO,OAAA;AAAA,MACP,OAAA,EAAS;AAAA,KACX,CAAE,CAAA;AAAA,EACJ,CAAA,SAAE;AACA,IAAA,EAAA,CAAG,KAAA,EAAM;AAAA,EACX;AACF;AASA,SAAS,QAAA,CAAS,GAAW,CAAA,EAAoB;AAC/C,EAAA,OAAO,EAAE,SAAA,CAAU,KAAK,CAAA,KAAM,CAAA,CAAE,UAAU,KAAK,CAAA;AACjD;AAsBA,SAAS,sBAAsB,SAAA,EAAqC;AAClE,EAAA,IAAI,cAAc,MAAA,EAAW;AAC7B,EAAA,IAAI,CAAC,MAAA,CAAO,SAAA,CAAU,SAAS,CAAA,IAAK,YAAY,CAAA,EAAG;AACjD,IAAA,MAAM,IAAIC,oCAAA;AAAA,MACR,CAAA,+EAAA,EAAkF,MAAA,CAAO,SAAS,CAAC,CAAA,CAAA,CAAA;AAAA,MACnG,EAAE,MAAM,oBAAA;AAAqB,KAC/B;AAAA,EACF;AACF;AAWA,eAAsB,qBAAqB,IAAA,EAA8C;AACvF,EAAA,qBAAA,CAAsB,KAAK,SAAS,CAAA;AACpC,EAAA,MAAM,MAAM,IAAA,CAAK,GAAA;AAEjB,EAAA,MAAM,aAAaP,mCAAA,CAAkB,GAAA,EAAK,EAAE,SAAA,EAAW,IAAA,CAAK,WAAW,CAAA;AACvE,EAAA,MAAM,SAAA,GAAYQ,mCAAiB,UAAU,CAAA;AAC7C,EAAA,MAAM,OAAA,GAAUd,SAAAA,CAAK,UAAA,EAAY,WAAW,CAAA;AAI5C,EAAA,MAAM,SAAS,IAAA,CAAK,MAAA,KAAW,CAAC,CAAA,KAAc,OAAA,CAAQ,IAAI,CAAC,CAAA,CAAA;AAC3D,EAAA,MAAM,MAAM,CAAC,CAAA,KAAc,MAAA,CAAOe,+BAAA,CAAc,CAAC,CAAC,CAAA;AAGlD,EAAA,IAAIJ,aAAA,CAAW,SAAS,CAAA,EAAG;AACzB,IAAA,MAAM,IAAIE,oCAAA;AAAA,MACR,CAAA,4BAAA,EAA+B,SAAS,CAAA,+BAAA,EAAkC,SAAS,CAAA,eAAA,CAAA;AAAA,MACnF,EAAE,MAAM,8BAAA;AAA+B,KACzC;AAAA,EACF;AACA,EAAA,IAAIF,aAAA,CAAW,OAAO,CAAA,EAAG;AAEvB,IAAA,GAAA,CAAI,CAAA,eAAA,EAAkB,OAAO,CAAA,uBAAA,CAAyB,CAAA;AACtD,IAAAK,SAAA,CAAO,SAAS,EAAE,SAAA,EAAW,IAAA,EAAM,KAAA,EAAO,MAAM,CAAA;AAAA,EAClD;AAEA,EAAA,GAAA,CAAI,CAAA,0BAAA,EAA6B,GAAG,CAAA,iCAAA,CAAmC,CAAA;AACvE,EAAA,MAAM,WAAA,GAAc,MAAM,kBAAA,CAAmB,UAAU,CAAA;AACvD,EAAA,GAAA,CAAI,CAAA,WAAA,EAAc,WAAA,CAAY,MAAM,CAAA,OAAA,CAAS,CAAA;AAC7C,EAAA,IAAI,WAAA,CAAY,WAAW,CAAA,EAAG;AAC5B,IAAA,OAAO;AAAA,MACL,WAAA,EAAa,CAAA;AAAA,MACb,UAAA,EAAY,CAAA;AAAA,MACZ,SAAA,EAAW,IAAA;AAAA,MACX,mBAAmB,EAAC;AAAA,MACpB,SAAA,EAAW,SAAA;AAAA,MACX,SAAA,EAAW;AAAA,KACb;AAAA,EACF;AAQA,EAAA,MAAM,oBAAA,GAAuB;AAAA,IAC3B,EAAA,EAAI,uBAAA;AAAA,IACJ,KAAA,EAAO,oBAAA;AAAA,IACP,SAAA,EAAW,CAAA;AAAA,IACX,KAAA,EAAO,OAAO,KAAA,KAAiC;AAE7C,MAAA,OAAO,KAAA,CAAM,GAAA,CAAI,CAAC,CAAA,KAAM;AACtB,QAAA,MAAM,MAAM,IAAI,KAAA,CAAM,CAAC,CAAA,CAAE,KAAK,CAAC,CAAA;AAC/B,QAAA,KAAA,IAAS,IAAI,CAAA,EAAG,CAAA,GAAI,CAAA,CAAE,MAAA,EAAQ,KAAK,CAAA,EAAG;AACpC,UAAA,GAAA,CAAI,CAAA,GAAI,CAAC,CAAA,IAAK,CAAA,CAAE,WAAW,CAAC,CAAA;AAAA,QAC9B;AACA,QAAA,OAAO,GAAA,CAAI,GAAA,CAAI,CAAC,CAAA,KAAM,IAAI,GAAI,CAAA;AAAA,MAChC,CAAC,CAAA;AAAA,IACH,CAAA;AAAA,IACA,KAAA,EAAO,OAAO,EAAE,SAAA,EAAW,CAAA,EAAG,aAAa,CAAA,EAAG,SAAA,EAAW,CAAA,EAAG,OAAA,EAAS,CAAA,EAAE;AAAA,GACzE;AAEA,EAAAC,YAAA,CAAU,OAAA,EAAS,EAAE,SAAA,EAAW,IAAA,EAAM,CAAA;AACtC,EAAA,GAAA,CAAI,CAAA,uBAAA,EAA0B,OAAO,CAAA,IAAA,CAAM,CAAA;AAE3C,EAAA,MAAM,KAAA,GAAQ,MAAMC,4BAAA,CAAW,IAAA,CAAK;AAAA,IAClC,GAAA;AAAA,IACA,SAAA,EAAW,oBAAA;AAAA,IACX,WAAA,EAAa;AAAA,GACd,CAAA;AAED,EAAA,MAAM,SAAA,GAAY,KAAK,SAAA,IAAa,GAAA;AACpC,EAAA,KAAA,IAAS,IAAI,CAAA,EAAG,CAAA,GAAI,WAAA,CAAY,MAAA,EAAQ,KAAK,SAAA,EAAW;AACtD,IAAA,MAAM,KAAA,GAAQ,YAAY,KAAA,CAAM,CAAA,EAAG,IAAI,SAAS,CAAA,CAAE,GAAA,CAAI,CAAC,CAAA,MAAO;AAAA,MAC5D,IAAI,CAAA,CAAE,EAAA;AAAA,MACN,MAAM,CAAA,CAAE,IAAA;AAAA,MACR,QAAQ,CAAA,CAAE,MAAA;AAAA,MACV,SAAA,EAAW,EAAE,SAAA,IAAa,SAAA;AAAA,MAC1B,KAAA,EAAO,EAAE,KAAA,IAAS,OAAA;AAAA,MAClB,OAAA,EAAS,EAAE,OAAA,IAAW,SAAA;AAAA,MACtB,SAAA,EAAW;AAAA,KACb,CAAE,CAAA;AACF,IAAA,MAAM,KAAA,CAAM,SAAS,KAAK,CAAA;AAC1B,IAAA,GAAA,CAAI,CAAA,WAAA,EAAc,IAAA,CAAK,GAAA,CAAI,CAAA,GAAI,SAAA,EAAW,WAAA,CAAY,MAAM,CAAC,CAAA,CAAA,EAAI,WAAA,CAAY,MAAM,CAAA,CAAE,CAAA;AAAA,EACvF;AAGA,EAAA,MAAM,UAAA,GAAa,MAAM,KAAA,CAAM,UAAA,CAAW,SAAS,CAAA;AACnD,EAAA,GAAA,CAAI,CAAA,UAAA,EAAa,UAAU,CAAA,iBAAA,EAAoB,WAAA,CAAY,MAAM,CAAA,EAAA,CAAI,CAAA;AAErE,EAAA,MAAM,UAAA,GAAa,IAAA,CAAK,GAAA,CAAI,EAAA,EAAI,YAAY,MAAM,CAAA;AAClD,EAAA,MAAM,oBAAsD,EAAC;AAC7D,EAAA,KAAA,IAAS,CAAA,GAAI,CAAA,EAAG,CAAA,GAAI,UAAA,EAAY,KAAK,CAAA,EAAG;AACtC,IAAA,MAAM,UAAA,GAAa,YAAY,IAAA,CAAK,KAAA,CAAO,IAAI,WAAA,CAAY,MAAA,GAAU,UAAU,CAAC,CAAA;AAChF,IAAA,IAAI,eAAe,MAAA,EAAW;AAE9B,IAAA,MAAM,IAAA,GAAO,MAAM,KAAA,CAAM,MAAA,CAAO,WAAW,IAAA,EAAM;AAAA,MAC/C,SAAA,EAAW,WAAW,SAAA,IAAa,SAAA;AAAA,MACnC,KAAA,EAAO;AAAA,KACR,CAAA;AAED,IAAA,MAAM,GAAA,GAAM,KAAK,CAAC,CAAA;AAClB,IAAA,MAAM,QAAQ,GAAA,KAAQ,MAAA,IAAa,SAAS,GAAA,CAAI,IAAA,EAAM,WAAW,IAAI,CAAA;AACrE,IAAA,iBAAA,CAAkB,KAAK,EAAE,EAAA,EAAI,UAAA,CAAW,EAAA,EAAI,OAAO,CAAA;AAAA,EACrD;AAEA,EAAA,MAAM,WAAW,iBAAA,CAAkB,KAAA,CAAM,CAAC,CAAA,KAAM,EAAE,KAAK,CAAA;AACvD,EAAA,MAAM,UAAA,GAAa,eAAe,WAAA,CAAY,MAAA;AAC9C,EAAA,MAAM,YAAY,QAAA,IAAY,UAAA;AAE9B,EAAA,MAAM,MAAM,KAAA,EAAM;AAElB,EAAA,IAAI,IAAA,CAAK,WAAW,IAAA,EAAM;AACxB,IAAA,GAAA,CAAI,mDAA8C,CAAA;AAClD,IAAAF,SAAA,CAAO,SAAS,EAAE,SAAA,EAAW,IAAA,EAAM,KAAA,EAAO,MAAM,CAAA;AAChD,IAAA,OAAO;AAAA,MACL,aAAa,WAAA,CAAY,MAAA;AAAA,MACzB,UAAA,EAAY,UAAA;AAAA,MACZ,SAAA;AAAA,MACA,iBAAA;AAAA,MACA,SAAA,EAAW,SAAA;AAAA,MACX,SAAA,EAAW;AAAA,KACb;AAAA,EACF;AAEA,EAAA,IAAI,CAAC,SAAA,EAAW;AACd,IAAA,GAAA,CAAI,6EAAwE,CAAA;AAC5E,IAAAA,SAAA,CAAO,SAAS,EAAE,SAAA,EAAW,IAAA,EAAM,KAAA,EAAO,MAAM,CAAA;AAChD,IAAA,OAAO;AAAA,MACL,aAAa,WAAA,CAAY,MAAA;AAAA,MACzB,UAAA,EAAY,UAAA;AAAA,MACZ,SAAA,EAAW,KAAA;AAAA,MACX,iBAAA;AAAA,MACA,SAAA,EAAW,SAAA;AAAA,MACX,SAAA,EAAW;AAAA,KACb;AAAA,EACF;AAGA,EAAAG,aAAA,CAAW,SAAS,SAAS,CAAA;AAC7B,EAAA,GAAA,CAAI,CAAA,uBAAA,EAA0B,SAAS,CAAA,CAAA,CAAG,CAAA;AAC1C,EAAA,OAAO;AAAA,IACL,aAAa,WAAA,CAAY,MAAA;AAAA,IACzB,UAAA,EAAY,UAAA;AAAA,IACZ,SAAA,EAAW,IAAA;AAAA,IACX,iBAAA;AAAA,IACA,SAAA,EAAW,SAAA;AAAA,IACX,SAAA,EAAW;AAAA,GACb;AACF","file":"chunk-CHKV2L2Y.cjs","sourcesContent":["import { createHash } from \"node:crypto\";\nimport { readFile } from \"node:fs/promises\";\nimport { join } from \"node:path\";\nimport { replaceFileAtomic } from \"../../persistence/atomic-write.js\";\nimport type { MemoryRoot } from \"../storage/memory-root.js\";\n\n/**\n * Dream-diary append (ADR D7).\n *\n * Diary lives at `.theokit/memory/dream-diary.md` and grows with one entry\n * per sweep. Each entry is content-hashed so the same input produces the\n * same entry — idempotency contract.\n *\n * Writes go through `replaceFileAtomic` (EC-3 of edge-case review) so a\n * crash mid-write can never leave a half-written diary.\n *\n * Shared with `@theokit/sdk-memory`; see the memory-store barrel.\n */\n\nexport interface DiaryEntry {\n  timestampMs: number;\n  factsBefore: number;\n  factsAfter: number;\n  duplicatesRemoved: number;\n  clustersCreated: number;\n  notesWritten: number;\n}\n\n/** `<memory root>/dream-diary.md`. Takes the RESOLVED ROOT — see `storage/memory-root.ts` (#463). */\nexport function diaryPath(root: MemoryRoot): string {\n  return join(root, \"dream-diary.md\");\n}\n\n/**\n * One diary entry as the markdown that gets appended: a timestamp heading, the short entry hash,\n * and the counts the sweep produced. The hash is what makes a re-run recognisable as the same\n * sweep rather than a new one.\n */\nexport function renderDiaryEntry(entry: DiaryEntry): string {\n  const stamp = new Date(entry.timestampMs).toISOString();\n  const hash = entryHash(entry).slice(0, 8);\n  return [\n    `## ${stamp}`,\n    \"\",\n    `- entry-hash: ${hash}`,\n    `- facts before: ${entry.factsBefore}`,\n    `- facts after: ${entry.factsAfter}`,\n    `- duplicates removed: ${entry.duplicatesRemoved}`,\n    `- clusters created: ${entry.clustersCreated}`,\n    `- notes written: ${entry.notesWritten}`,\n    \"\",\n  ].join(\"\\n\");\n}\n\n/**\n * Append one sweep's entry to `<memory root>/dream-diary.md`, creating the file with its header\n * when this is the first sweep. The diary is a human-readable record of what dreaming changed —\n * consolidations are otherwise invisible, because they alter the notes rather than announce\n * themselves.\n */\nexport async function appendDiaryEntry(root: MemoryRoot, entry: DiaryEntry): Promise<void> {\n  const path = diaryPath(root);\n  let raw = \"\";\n  try {\n    raw = await readFile(path, \"utf8\");\n  } catch {\n    raw = \"# Dream Diary\\n\\n\";\n  }\n  const next = `${raw.endsWith(\"\\n\") ? raw : `${raw}\\n`}${renderDiaryEntry(entry)}`;\n  await replaceFileAtomic(path, next);\n}\n\n/**\n * A stable hash of one entry's counts, so two sweeps that did the same work read as the same work.\n * Rendered truncated in the entry; the full value is what callers compare.\n */\nexport function entryHash(entry: DiaryEntry): string {\n  return createHash(\"sha256\")\n    .update(\n      [\n        entry.factsBefore,\n        entry.factsAfter,\n        entry.duplicatesRemoved,\n        entry.clustersCreated,\n        entry.notesWritten,\n      ].join(\"|\"),\n    )\n    .digest(\"hex\");\n}\n","import type { EmbeddingRuntime } from \"../embedding-adapter.js\";\nimport type { MemoryFact, MemoryKind } from \"../types.js\";\n\n/**\n * Dreaming/REM phase logic.\n *\n * Three phases:\n *   - **light** — drop near-duplicate facts (cosine similarity > 0.95).\n *   - **REM**  — cluster thematically related facts (cosine ≥ 0.75).\n *   - **deep** — pick a representative bullet per cluster (longest text\n *                wins) and emit consolidated markdown notes.\n */\n\nexport interface DedupResult {\n  kept: MemoryFact[];\n  duplicatesRemoved: number;\n}\n\n/** A group of semantically similar facts, with the text chosen to represent them. */\nexport interface Cluster {\n  representativeText: string;\n  members: ReadonlyArray<MemoryFact>;\n}\n\n/** What clustering produced: the clusters and how many facts the per-sweep cap left out. */\nexport interface ClusterResult {\n  clusters: Cluster[];\n  /** How many input facts past the per-sweep cap were not clustered; 0 when none were. */\n  factsLeftOut: number;\n}\n\nconst DEFAULT_DEDUP_THRESHOLD = 0.95;\nconst DEFAULT_CLUSTER_THRESHOLD = 0.75;\n\n/**\n * Kinds a sweep may consolidate. ADR-14 partitions the vocabulary into three buckets and only\n * this one is a merge candidate; the rest are protected for a reason that survives the sweep\n * being non-destructive.\n *\n * `user`, `feedback` and `reference` are ATOMIC: there is nothing to merge and the loss is\n * irreversible. Two corrections a user gave on different days can read alike and are not the\n * same correction. An untyped fact is protected too — a kind that nobody declared is not a\n * licence to treat it as consolidatable.\n *\n * Why this matters even though nothing is deleted: dedup drops the near-duplicate from the\n * CLUSTERING INPUT, and the cluster's representative is what the search index returns. The\n * source file survives; the artefact the agent reads does not. That is ADR-14's third rule —\n * the invariant is about what the agent reads, not what survives on disk.\n */\n// Typed against `MemoryKind` rather than `string`, so the compiler checks these against the vocabulary\n// they mirror. They were `Set<string>` and CONSOLIDATABLE_KINDS held \"session\" — not a member of\n// `MemoryKind`, and rejected by `markdown-store.assertWritable` before any fact is written, so no\n// fact reaching this policy could ever carry it. The arm read as though sessions were consolidatable\n// while no session could exist. Adding a member to either set is now a type error unless `MemoryKind`\n// gains it deliberately.\nconst CONSOLIDATABLE_KINDS: ReadonlySet<MemoryKind> = new Set([\"project\"]);\nconst ATOMIC_KINDS: ReadonlySet<MemoryKind> = new Set([\"user\", \"feedback\", \"reference\"]);\n\n/**\n * Three levels, graded by how much the store knows about the entry. The middle one exists\n * because the first draft of this filter did not have it and broke the common case.\n *\n * - ATOMIC (`user`, `feedback`, `reference`) — never deduplicated. Two corrections given on\n *   different days can read alike and are not the same correction.\n * - CONSOLIDATABLE (`project`, `session`) — near-duplicate dedup at the similarity threshold.\n *   Overlapping project facts are exactly what a sweep is for.\n * - UNTYPED — EXACT duplicates only. A hand-written bullet under `## Facts` carries no kind,\n *   and the store's own header invites editing those by hand, so untyped is the common case\n *   rather than an edge one. Treating it as atomic would disable the sweep for most stores;\n *   treating it as consolidatable would let a near-duplicate of an untyped correction be\n *   dropped. Exact-match is the only claim the store can make without inferring a kind, which\n *   is the rule this codebase already applies one field over.\n */\ntype DedupPolicy = \"never\" | \"exact\" | \"similar\";\n\nfunction dedupPolicy(fact: MemoryFact): DedupPolicy {\n  if (fact.kind === undefined) return \"exact\";\n  if (ATOMIC_KINDS.has(fact.kind)) return \"never\";\n  return CONSOLIDATABLE_KINDS.has(fact.kind) ? \"similar\" : \"never\";\n}\n\n/** Whitespace and case collapsed; nothing else. Not a similarity measure — an identity one. */\nfunction normalizeForExactMatch(text: string): string {\n  return text\n    .trim()\n    .toLowerCase()\n    .replace(/\\s+/g, \" \")\n    .replace(/[.!?]+$/, \"\");\n}\n\n/**\n * Light phase — drop facts whose embedding is too similar to one already kept.\n *\n * Protected kinds bypass deduplication entirely and are returned untouched, so a sweep can\n * never conflate two of them into one representative.\n *\n * \"Drop\" here means DROPPED FROM THE RETURNED LIST. Nothing on disk is deleted, by any phase of\n * this sweep, today.\n *\n * BEFORE YOU ADD PRUNING HERE, READ THIS. The security contract for this store requires a backup\n * to precede any destructive operation (SOP-06-05 step 7). That requirement is currently LATENT\n * — not satisfied, not waived — precisely because the sweep only ever adds notes and filters a\n * list. There is no backup implementation in this package, and an audit that looked for one\n * recorded its absence as having no present consequence.\n *\n * The first commit that makes this sweep delete a file from disk is the commit that makes the\n * gap real, and it is also the commit whose author will have no reason to know this line exists.\n * That is why the trigger is written beside the code that would trip it rather than in the audit\n * that found it: a gap recorded in a reviewer's file reappears as a surprise; a gap recorded\n * here stops the person adding pruning.\n */\nexport async function lightPhase(\n  facts: ReadonlyArray<MemoryFact>,\n  embedding: EmbeddingRuntime,\n  threshold: number = DEFAULT_DEDUP_THRESHOLD,\n): Promise<DedupResult> {\n  if (facts.length <= 1) return { kept: [...facts], duplicatesRemoved: 0 };\n  const never = facts.filter((f) => dedupPolicy(f) === \"never\");\n  const exact = facts.filter((f) => dedupPolicy(f) === \"exact\");\n  const similar = facts.filter((f) => dedupPolicy(f) === \"similar\");\n\n  // Exact pass: identity, not similarity. No embedding call, no threshold, no judgement.\n  const seen = new Set<string>();\n  const exactKept: MemoryFact[] = [];\n  let removed = 0;\n  for (const f of exact) {\n    const key = normalizeForExactMatch(f.text);\n    if (seen.has(key)) {\n      removed += 1;\n      continue;\n    }\n    seen.add(key);\n    exactKept.push(f);\n  }\n\n  const sim =\n    similar.length > 1\n      ? await dedupCandidates(similar, embedding, threshold)\n      : { kept: [...similar], duplicatesRemoved: 0 };\n\n  // Protected facts keep their original relative position at the front: they were never in\n  // the running, and putting them back through the sort would imply they had been judged.\n  return {\n    kept: [...never, ...exactKept, ...sim.kept],\n    duplicatesRemoved: removed + sim.duplicatesRemoved,\n  };\n}\n\nasync function dedupCandidates(\n  facts: ReadonlyArray<MemoryFact>,\n  embedding: EmbeddingRuntime,\n  threshold: number,\n): Promise<DedupResult> {\n  if (facts.length <= 1) return { kept: [...facts], duplicatesRemoved: 0 };\n  const vectors = await embedding.embed(facts.map((f) => f.text));\n  const keptIdx: number[] = [];\n  const keptVecs: number[][] = [];\n  for (let i = 0; i < facts.length; i++) {\n    const vec = vectors[i] ?? [];\n    const isDup = keptVecs.some((kept) => cosineSimilarity(vec, kept) >= threshold);\n    if (isDup) continue;\n    keptIdx.push(i);\n    keptVecs.push(vec);\n  }\n  const kept = keptIdx.map((i) => facts[i] as MemoryFact);\n  return { kept, duplicatesRemoved: facts.length - kept.length };\n}\n\n// T4.6 — cap facts per sweep to prevent O(N²) blowup. 500 facts →\n// 125K comparisons (acceptable). 5000 facts → 12.5M (unacceptable).\n// When facts exceed the cap, a deterministic subsample is taken so the\n// sweep is bounded. The remaining facts are carried to the next sweep.\nconst DEFAULT_MAX_FACTS_PER_SWEEP = 500;\n\n/** REM phase — single-link agglomerative clustering by cosine similarity. */\nexport async function remPhase(\n  facts: ReadonlyArray<MemoryFact>,\n  embedding: EmbeddingRuntime,\n  threshold: number = DEFAULT_CLUSTER_THRESHOLD,\n  maxFactsPerSweep: number = DEFAULT_MAX_FACTS_PER_SWEEP,\n): Promise<ClusterResult> {\n  // KNOWN GAP, deliberately not closed here. Protected kinds are excluded from DEDUP — a\n  // near-duplicate correction is never dropped — but they still reach CLUSTERING, and a cluster\n  // carries one representative into the consolidated note.\n  //\n  // Filtering them out here too was tried and reverted: untyped is the common case (hand-written\n  // bullets carry no kind), so excluding it disables consolidation for most stores, and it broke\n  // three existing golden tests. The damage is also smaller than in the dedup case — the source\n  // files survive and remain readable, so what a cluster costs is nuance in an ADDITIONAL\n  // artefact rather than a lost entry.\n  //\n  // It becomes real damage only if recall serves notes INSTEAD of sources. That depends on what\n  // the index covers, which is not settled here. Recorded rather than silently accepted.\n  if (facts.length === 0) return { clusters: [], factsLeftOut: 0 };\n  // T4.6 — cap: subsample when facts exceed budget. Deterministic\n  // sort by text hash so the same input always picks the same subset.\n  const capped = facts.length > maxFactsPerSweep ? facts.slice(0, maxFactsPerSweep) : facts;\n  const vectors = await embedding.embed(capped.map((f) => f.text));\n  const clusterOfIdx = unionFindByPairs(vectors, threshold);\n  const groups = bucketFactsByClusterRoot(capped, clusterOfIdx);\n  return {\n    clusters: [...groups.values()].map(buildClusterFromMembers),\n    factsLeftOut: facts.length - capped.length,\n  };\n}\n\nfunction unionFindByPairs(\n  vectors: ReadonlyArray<ReadonlyArray<number>>,\n  threshold: number,\n): number[] {\n  const clusterOfIdx = vectors.map((_, i) => i);\n  for (let i = 0; i < vectors.length; i++) {\n    for (let j = i + 1; j < vectors.length; j++) {\n      if (cosineSimilarity(vectors[i] ?? [], vectors[j] ?? []) >= threshold) {\n        unifyClusters(clusterOfIdx, i, j);\n      }\n    }\n  }\n  return clusterOfIdx;\n}\n\nfunction bucketFactsByClusterRoot(\n  facts: ReadonlyArray<MemoryFact>,\n  clusterOfIdx: number[],\n): Map<number, MemoryFact[]> {\n  const groups = new Map<number, MemoryFact[]>();\n  for (let i = 0; i < facts.length; i++) {\n    const root = findRoot(clusterOfIdx, i);\n    const list = groups.get(root) ?? [];\n    list.push(facts[i] as MemoryFact);\n    groups.set(root, list);\n  }\n  return groups;\n}\n\nfunction buildClusterFromMembers(members: ReadonlyArray<MemoryFact>): Cluster {\n  const sorted = [...members].sort((a, b) => b.text.length - a.text.length);\n  return { representativeText: sorted[0]?.text ?? \"\", members };\n}\n\n/** Deep phase — render consolidated markdown for the dreamed note. */\nexport function deepPhase(clusters: ReadonlyArray<Cluster>, timestampMs: number): string {\n  if (clusters.length === 0) return \"\";\n  const isoStamp = new Date(timestampMs).toISOString();\n  const lines: string[] = [`# Dreamed ${isoStamp}`, \"\"];\n  for (let i = 0; i < clusters.length; i++) {\n    const c = clusters[i];\n    if (c === undefined) continue;\n    lines.push(`## Cluster ${i + 1}: ${c.representativeText}`);\n    lines.push(\"\");\n    for (const member of c.members) lines.push(`- ${member.text}`);\n    lines.push(\"\");\n  }\n  return `${lines.join(\"\\n\")}\\n`;\n}\n\nfunction cosineSimilarity(a: ReadonlyArray<number>, b: ReadonlyArray<number>): number {\n  if (a.length === 0 || b.length === 0 || a.length !== b.length) return 0;\n  let dot = 0;\n  let aNorm = 0;\n  let bNorm = 0;\n  for (let i = 0; i < a.length; i++) {\n    const ai = a[i] ?? 0;\n    const bi = b[i] ?? 0;\n    dot += ai * bi;\n    aNorm += ai * ai;\n    bNorm += bi * bi;\n  }\n  const denom = Math.sqrt(aNorm) * Math.sqrt(bNorm);\n  return denom === 0 ? 0 : dot / denom;\n}\n\nfunction findRoot(parents: number[], i: number): number {\n  let root = i;\n  while (parents[root] !== root) {\n    const next = parents[root] ?? root;\n    if (next === root) break;\n    root = next;\n  }\n  parents[i] = root;\n  return root;\n}\n\nfunction unifyClusters(parents: number[], a: number, b: number): void {\n  const rootA = findRoot(parents, a);\n  const rootB = findRoot(parents, b);\n  if (rootA !== rootB) parents[rootB] = rootA;\n}\n","import { mkdir } from \"node:fs/promises\";\nimport { join } from \"node:path\";\nimport { diag } from \"../../diagnostics.js\";\nimport { replaceFileAtomic } from \"../../persistence/atomic-write.js\";\nimport { withCwdMutex } from \"../../persistence/cwd-mutex.js\";\nimport type { EmbeddingRuntime } from \"../embedding-adapter.js\";\nimport { readFactsFromMarkdown } from \"../storage/markdown-store.js\";\nimport { type MemoryRoot, resolveMemoryRoot } from \"../storage/memory-root.js\";\nimport { appendDiaryEntry } from \"./diary.js\";\nimport { deepPhase, lightPhase, remPhase } from \"./phases.js\";\n\n/**\n * Dreaming sweep orchestrator (ADR D7 of memory-system-peer-project-parity).\n *\n * Phases:\n *   1. **light** — drop near-duplicate facts via cosine similarity.\n *   2. **REM**  — cluster thematically related facts.\n *   3. **deep** — write a `notes/dreamed-<ts>.md` per sweep with consolidated\n *                  clusters; append a diary entry.\n *\n * All file writes go through `replaceFileAtomic` (EC-3) and the entire sweep\n * holds the per-cwd mutex so a `Remember:` append can't race it.\n */\n\nexport interface DreamingOptions {\n  cwd: string;\n  /**\n   * The memory root to sweep. Defaults to the project store — right for a caller with no\n   * `memory.directory`, and wrong for one that has it, which is why it is passable (#463).\n   */\n  memoryRoot?: MemoryRoot;\n  embedding: EmbeddingRuntime;\n  dedupThreshold?: number;\n  clusterThreshold?: number;\n  /** Test hook — fixed timestamp for the run. */\n  now?: () => number;\n}\n\n/** Outcome of one dreaming sweep: counts before and after, and the note written. */\nexport interface DreamingResult {\n  status: \"ok\" | \"skipped\" | \"error\";\n  factsBefore: number;\n  factsAfter: number;\n  duplicatesRemoved: number;\n  clustersCreated: number;\n  notesWritten: number;\n  diaryEntryHash: string | undefined;\n  /**\n   * Deduplicated facts past the per-sweep cap that were not clustered. Set on `\"ok\"`, 0 on\n   * `\"skipped\"`, and absent on `\"error\"`, where the sweep cannot say how many it left out.\n   */\n  factsLeftOut?: number;\n}\n\n/** Run one dreaming sweep (dedupe, cluster, write a consolidated note), serialised per `cwd`. */\nexport function runDreamingSweep(options: DreamingOptions): Promise<DreamingResult> {\n  return withCwdMutex(`dream:${options.cwd}`, () => runInner(options));\n}\n\nasync function runInner(options: DreamingOptions): Promise<DreamingResult> {\n  const now = options.now ?? Date.now;\n  const timestampMs = now();\n  try {\n    const root = options.memoryRoot ?? resolveMemoryRoot(options.cwd);\n    const facts = await readFactsFromMarkdown(\n      options.cwd,\n      options.memoryRoot ? { directory: options.memoryRoot } : undefined,\n    );\n    if (facts.length === 0) {\n      return emptyResult(\"skipped\");\n    }\n    const dedup = await lightPhase(facts, options.embedding, options.dedupThreshold);\n    const rem = await remPhase(dedup.kept, options.embedding, options.clusterThreshold);\n    const notesWritten = await writeConsolidatedNotes(root, rem.clusters, timestampMs);\n    const result: DreamingResult = {\n      status: \"ok\",\n      factsBefore: facts.length,\n      factsAfter: dedup.kept.length,\n      duplicatesRemoved: dedup.duplicatesRemoved,\n      clustersCreated: rem.clusters.length,\n      notesWritten,\n      diaryEntryHash: undefined,\n      factsLeftOut: rem.factsLeftOut,\n    };\n    await appendDiaryEntry(root, {\n      timestampMs,\n      factsBefore: result.factsBefore,\n      factsAfter: result.factsAfter,\n      duplicatesRemoved: result.duplicatesRemoved,\n      clustersCreated: result.clustersCreated,\n      notesWritten: result.notesWritten,\n    });\n    return result;\n  } catch (cause) {\n    const message = cause instanceof Error ? cause.message : String(cause);\n    diag(`[theokit-sdk] dreaming sweep failed: ${message}\\n`);\n    return emptyResult(\"error\");\n  }\n}\n\nasync function writeConsolidatedNotes(\n  root: MemoryRoot,\n  clusters: ReadonlyArray<{ representativeText: string; members: ReadonlyArray<{ text: string }> }>,\n  timestampMs: number,\n): Promise<number> {\n  if (clusters.length === 0) return 0;\n  const notesDir = join(root, \"notes\");\n  await mkdir(notesDir, { recursive: true });\n  const isoSlug = new Date(timestampMs).toISOString().replace(/[^\\dT]/g, \"-\");\n  const file = join(notesDir, `dreamed-${isoSlug}.md`);\n  const body = deepPhase(clusters, timestampMs);\n  await replaceFileAtomic(file, body);\n  return 1;\n}\n\nfunction emptyResult(status: \"skipped\" | \"error\"): DreamingResult {\n  const result: DreamingResult = {\n    status,\n    factsBefore: 0,\n    factsAfter: 0,\n    duplicatesRemoved: 0,\n    clustersCreated: 0,\n    notesWritten: 0,\n    diaryEntryHash: undefined,\n  };\n  // An empty store left nothing out; a failed sweep cannot say, so it reports no count.\n  return status === \"skipped\" ? { ...result, factsLeftOut: 0 } : result;\n}\n","import { existsSync, mkdirSync, renameSync, rmSync } from \"node:fs\";\nimport { join } from \"node:path\";\n\nimport { ConfigurationError } from \"../../errors.js\";\nimport { redactSecrets } from \"../security/index.js\";\nimport { defaultIndexPath, openMemoryDb } from \"./index-db.js\";\nimport { LanceIndex, lanceStoragePath } from \"./lance-index.js\";\nimport { type MemoryRoot, resolveMemoryRoot } from \"./storage/memory-root.js\";\n\n/**\n * Migrate Memory.index from SQLite to LanceDB (ADR D44).\n *\n * EC-3 MUST FIX: validation uses NFC unicode normalization on both sides.\n *\n * Shared with `@theokit/sdk-memory` through the memory-store barrel (#463).\n */\n\nexport interface MigrateOptions {\n  cwd: string;\n  /**\n   * Absolute path (or `~/`-prefixed) of the memory root to migrate, when the agent that wrote it\n   * set `memory.directory`. Defaults to `<cwd>/.theokit/memory` (#463).\n   */\n  directory?: string;\n  dryRun?: boolean;\n  batchSize?: number;\n  /** Inject for tests; defaults to console.log. */\n  logger?: (msg: string) => void;\n}\n\nexport interface MigrateResult {\n  countSqlite: number;\n  countLance: number;\n  /** Set when validation succeeded (or dryRun); false on validation failure. */\n  validated: boolean;\n  /** Per-fact compare results (size = sample count, up to 10). */\n  sampleComparisons: ReadonlyArray<{ id: string; match: boolean }>;\n  /** Lance storage location (final, after migration). */\n  lancePath: string;\n  /** Was the migration committed (false for dry-run). */\n  committed: boolean;\n}\n\n/**\n * One row of the SQLite memory index, as the Lance migration reads it: the chunk plus the tenant\n * columns the target table needs. Shared with `@theokit/sdk-memory`, which migrates the same table.\n */\nexport interface SqliteFactRow {\n  id: string;\n  path: string;\n  source: \"memory\" | \"sessions\" | \"wiki\";\n  start_line: number;\n  end_line: number;\n  text: string;\n  namespace?: string | null;\n  scope?: string | null;\n  user_id?: string | null;\n}\n\n/**\n * Read all facts from the SQLite memory index. Returns empty array if the\n * SQLite db file does not exist (workspace never used Memory).\n *\n * Shared with `@theokit/sdk-memory` through the memory-store barrel, so it carries no visibility\n * tag — naming that tag in this block would delete the function below it (#463).\n */\nexport async function readAllSqliteFacts(root: MemoryRoot): Promise<SqliteFactRow[]> {\n  const dbPath = defaultIndexPath(root);\n  if (!existsSync(dbPath)) return [];\n  const db = await openMemoryDb({ filePath: dbPath });\n  try {\n    // SQLite schema: chunks table holds the facts. Schema may vary; we\n    // probe column existence and fall back to safe defaults.\n    const stmt = db.prepare(\"SELECT id, path, source, start_line, end_line, text FROM chunks\");\n    const rows = stmt.all() as Array<{\n      id: string;\n      path: string;\n      source: \"memory\" | \"sessions\" | \"wiki\";\n      start_line: number;\n      end_line: number;\n      text: string;\n    }>;\n    return rows.map((r) => ({\n      ...r,\n      namespace: \"default\",\n      scope: \"agent\",\n      user_id: \"default\",\n    }));\n  } finally {\n    db.close();\n  }\n}\n\n/**\n * Compare two strings via NFC normalization (EC-3 MUST FIX). Required\n * because SQLite/Lance native bindings can normalize unicode differently\n * (NFC vs NFD), producing false negatives on facts with accents/emojis.\n *\n * @internal\n */\nfunction nfcEqual(a: string, b: string): boolean {\n  return a.normalize(\"NFC\") === b.normalize(\"NFC\");\n}\n\n/**\n * Refuse a `batchSize` the loop below cannot make progress with, before anything is migrated.\n *\n * The loop is `for (let i = 0; i < facts.length; i += batchSize)`, so the three ways this goes wrong\n * are all silent and all different:\n *\n *  - 0 or negative: `i` never advances past the guard. The migration SPINS FOREVER, calling\n *    `addFacts([])` and writing a \"Migrated x/y\" line every iteration — a hang with unbounded output,\n *    which is the worst shape a failure can take because it looks like work.\n *  - NaN (`Number(\"abc\")`): `i += NaN` makes the guard false on the first check, zero facts move, and\n *    the caller is told \"Validation FAILED. SQLite preserved.\" A typo in an argument is reported as a\n *    migration failure.\n *  - a fraction: `slice` truncates and the loop still terminates, but the batch boundaries stop\n *    matching the number the caller asked for.\n *\n * Validated HERE rather than only in the CLI that motivated the finding, because the CLI is a wrapper\n * over this function and a programmatic caller reaches it with no wrapper at all.\n *\n * @internal\n */\nfunction assertUsableBatchSize(batchSize: number | undefined): void {\n  if (batchSize === undefined) return;\n  if (!Number.isInteger(batchSize) || batchSize < 1) {\n    throw new ConfigurationError(\n      `migrateSqliteToLance: batchSize must be a whole number of at least 1; received ${String(batchSize)}.`,\n      { code: \"invalid_batch_size\" },\n    );\n  }\n}\n\n/**\n * Run the migration. Writes Lance to `<cwd>/.theokit/memory/lance-new/`\n * first, validates round-trip, then renames to `lance/` on success.\n * SQLite db is preserved (CLI prompts user to delete).\n *\n * @internal\n */\n\n// biome-ignore lint/complexity/noExcessiveCognitiveComplexity: migration is a single transaction (read → write → validate → commit-or-rollback); splitting harms atomicity reasoning.\nexport async function migrateSqliteToLance(opts: MigrateOptions): Promise<MigrateResult> {\n  assertUsableBatchSize(opts.batchSize);\n  const cwd = opts.cwd;\n  // One resolution, reused by every path this migration touches (#463).\n  const memoryRoot = resolveMemoryRoot(cwd, { directory: opts.directory });\n  const finalPath = lanceStoragePath(memoryRoot);\n  const newPath = join(memoryRoot, \"lance-new\");\n  // T1.4 (ADR D68): wrap logger so any fact text containing secrets is\n  // masked before reaching the destination (console or user-supplied sink).\n  // Caller-supplied loggers cannot bypass — by design (D70).\n  const rawLog = opts.logger ?? ((m: string) => console.log(m));\n  const log = (m: string) => rawLog(redactSecrets(m));\n\n  // EC: destination exists → typed error.\n  if (existsSync(finalPath)) {\n    throw new ConfigurationError(\n      `Destination already exists: ${finalPath}. Remove it manually (\\`rm -rf ${finalPath}\\`) and re-run.`,\n      { code: \"migration_destination_exists\" },\n    );\n  }\n  if (existsSync(newPath)) {\n    // Leftover from a previous failed/interrupted migration. Safe to delete.\n    log(`Removing stale ${newPath} from a previous run...`);\n    rmSync(newPath, { recursive: true, force: true });\n  }\n\n  log(`Reading SQLite facts from ${cwd}/.theokit/memory/index.sqlite ...`);\n  const sqliteFacts = await readAllSqliteFacts(memoryRoot);\n  log(`SQLite has ${sqliteFacts.length} facts.`);\n  if (sqliteFacts.length === 0) {\n    return {\n      countSqlite: 0,\n      countLance: 0,\n      validated: true,\n      sampleComparisons: [],\n      lancePath: finalPath,\n      committed: false,\n    };\n  }\n\n  // Reuse the embedding runtime configured in the workspace? For v1.2 we\n  // require the caller to pass embedding explicitly via env. The migration\n  // path is documented as: \"set OPENAI_API_KEY (or similar) before running.\"\n  // Here we ship a placeholder embedder that uses a deterministic\n  // content-hash — sufficient for migration validation; consumers should\n  // re-embed on first real query after migration if needed.\n  const placeholderEmbedding = {\n    id: \"migration-placeholder\",\n    model: \"deterministic-hash\",\n    dimension: 8,\n    embed: async (texts: ReadonlyArray<string>) => {\n      // Simple deterministic hash → 8-dim vector (migration validation only).\n      return texts.map((t) => {\n        const arr = new Array(8).fill(0);\n        for (let i = 0; i < t.length; i += 1) {\n          arr[i % 8] += t.charCodeAt(i);\n        }\n        return arr.map((x) => x / 1000);\n      });\n    },\n    stats: () => ({ cacheHits: 0, cacheMisses: 0, httpCalls: 0, retries: 0 }),\n  };\n\n  mkdirSync(newPath, { recursive: true });\n  log(`Writing Lance index to ${newPath} ...`);\n\n  const lance = await LanceIndex.open({\n    cwd,\n    embedding: placeholderEmbedding,\n    storagePath: newPath,\n  });\n\n  const batchSize = opts.batchSize ?? 100;\n  for (let i = 0; i < sqliteFacts.length; i += batchSize) {\n    const batch = sqliteFacts.slice(i, i + batchSize).map((f) => ({\n      id: f.id,\n      text: f.text,\n      source: f.source,\n      namespace: f.namespace ?? \"default\",\n      scope: f.scope ?? \"agent\",\n      user_id: f.user_id ?? \"default\",\n      timestamp: 0,\n    }));\n    await lance.addFacts(batch);\n    log(`  Migrated ${Math.min(i + batchSize, sqliteFacts.length)}/${sqliteFacts.length}`);\n  }\n\n  // Validation: count + sample compare (10 random) with NFC normalization.\n  const lanceCount = await lance.countFacts(\"default\");\n  log(`Lance has ${lanceCount} facts (expected ${sqliteFacts.length}).`);\n\n  const sampleSize = Math.min(10, sqliteFacts.length);\n  const sampleComparisons: { id: string; match: boolean }[] = [];\n  for (let i = 0; i < sampleSize; i += 1) {\n    const sqliteFact = sqliteFacts[Math.floor((i * sqliteFacts.length) / sampleSize)];\n    if (sqliteFact === undefined) continue;\n    // Search Lance for this fact's text — best-effort round-trip.\n    const hits = await lance.search(sqliteFact.text, {\n      namespace: sqliteFact.namespace ?? \"default\",\n      limit: 1,\n    });\n    // EC-3: compare with NFC normalization.\n    const hit = hits[0];\n    const match = hit !== undefined && nfcEqual(hit.text, sqliteFact.text);\n    sampleComparisons.push({ id: sqliteFact.id, match });\n  }\n\n  const allMatch = sampleComparisons.every((c) => c.match);\n  const countMatch = lanceCount === sqliteFacts.length;\n  const validated = allMatch && countMatch;\n\n  await lance.close();\n\n  if (opts.dryRun === true) {\n    log(\"Dry-run mode — discarding Lance staging dir.\");\n    rmSync(newPath, { recursive: true, force: true });\n    return {\n      countSqlite: sqliteFacts.length,\n      countLance: lanceCount,\n      validated,\n      sampleComparisons,\n      lancePath: finalPath,\n      committed: false,\n    };\n  }\n\n  if (!validated) {\n    log(\"Validation FAILED — leaving SQLite intact, removing Lance staging dir.\");\n    rmSync(newPath, { recursive: true, force: true });\n    return {\n      countSqlite: sqliteFacts.length,\n      countLance: lanceCount,\n      validated: false,\n      sampleComparisons,\n      lancePath: finalPath,\n      committed: false,\n    };\n  }\n\n  // Atomic commit via rename.\n  renameSync(newPath, finalPath);\n  log(`Migration committed to ${finalPath}.`);\n  return {\n    countSqlite: sqliteFacts.length,\n    countLance: lanceCount,\n    validated: true,\n    sampleComparisons,\n    lancePath: finalPath,\n    committed: true,\n  };\n}\n"]}

package/dist/{chunk-LXG6VL6R.cjs → chunk-FBIDOOJM.cjs}

@@ -48,7 +48,7 @@ function persistTurnToTranscript(store, loc, sessionId, turn, onCompact) {
       const count = (recordCounts.get(key) ?? 0) + 1;
       recordCounts.set(key, count);
       if (turn.autoCompact !== void 0) {
-        const { autoCompactIfNeeded } = await import('./compact-session-D2MQDB6G.cjs');
+        const { autoCompactIfNeeded } = await import('./compact-session-CHBJOYWP.cjs');
         const fired = await autoCompactIfNeeded({
           store,
           loc,
@@ -114,5 +114,5 @@ exports.flushSessionWrites = flushSessionWrites;
 exports.getSessionMessages = getSessionMessages;
 exports.hydrateSession = hydrateSession;
 exports.persistTurnToTranscript = persistTurnToTranscript;
-//# sourceMappingURL=chunk-LXG6VL6R.cjs.map
-//# sourceMappingURL=chunk-LXG6VL6R.cjs.map
+//# sourceMappingURL=chunk-FBIDOOJM.cjs.map
+//# sourceMappingURL=chunk-FBIDOOJM.cjs.map