@remnic/core 1.0.2 → 1.1.0

package/dist/types.js

@@ -1,7 +1,7 @@
 import {
   SPECULATIVE_TTL_DAYS,
   confidenceTier
-} from "./chunk-U4PV25RD.js";
+} from "./chunk-3WHVNEN7.js";
 export {
   SPECULATIVE_TTL_DAYS,
   confidenceTier

package/dist/utility-learner.js

@@ -3,11 +3,11 @@ import {
   learnUtilityPromotionWeights,
   readUtilityLearningSnapshot,
   resolveUtilityLearningStatePath
-} from "./chunk-OTAVQCSF.js";
+} from "./chunk-PYXS46O7.js";
 import "./chunk-3QKK7QOS.js";
+import "./chunk-TBBDFYXW.js";
 import "./chunk-DGXUHMOV.js";
 import "./chunk-LPSF4OQH.js";
-import "./chunk-QCCCQT3O.js";
 export {
   getUtilityLearningStatus,
   learnUtilityPromotionWeights,

package/dist/utility-runtime.js

@@ -2,12 +2,12 @@ import {
   applyUtilityPromotionRuntimePolicy,
   applyUtilityRankingRuntimeDelta,
   loadUtilityRuntimeValues
-} from "./chunk-IFFFR3MR.js";
-import "./chunk-OTAVQCSF.js";
+} from "./chunk-FSFEQI74.js";
+import "./chunk-PYXS46O7.js";
 import "./chunk-3QKK7QOS.js";
+import "./chunk-TBBDFYXW.js";
 import "./chunk-DGXUHMOV.js";
 import "./chunk-LPSF4OQH.js";
-import "./chunk-QCCCQT3O.js";
 export {
   applyUtilityPromotionRuntimePolicy,
   applyUtilityRankingRuntimeDelta,

package/dist/verified-recall.js

@@ -1,18 +1,21 @@
 import {
   searchVerifiedEpisodes
-} from "./chunk-UIYZ5T3I.js";
-import "./chunk-M5KEYE5E.js";
-import "./chunk-QWUUMMIK.js";
-import "./chunk-U4PV25RD.js";
-import "./chunk-ESSMF2FR.js";
-import "./chunk-TP4FZJIZ.js";
+} from "./chunk-6UJ47TVX.js";
+import "./chunk-URB2WSKZ.js";
+import "./chunk-DT5TVLJE.js";
+import "./chunk-GV6NLQ4X.js";
+import "./chunk-3WHVNEN7.js";
+import "./chunk-4KAN3GZ3.js";
+import "./chunk-6ZH4TU6I.js";
 import "./chunk-SCU65EZI.js";
 import "./chunk-BOUYNNYD.js";
+import "./chunk-6PFRXT4K.js";
+import "./chunk-TP4FZJIZ.js";
 import "./chunk-DM2T26WE.js";
 import "./chunk-QSVPYQPG.js";
 import "./chunk-M62O4P4T.js";
-import "./chunk-DT5TVLJE.js";
-import "./chunk-KWBU5S5U.js";
+import "./chunk-4DJQYKMN.js";
+import "./chunk-2ODBA7MQ.js";
 export {
   searchVerifiedEpisodes
 };

package/dist/whitespace.d.ts

@@ -0,0 +1,4 @@
+declare function collapseWhitespace(value: string): string;
+declare function truncateCodePointSafe(value: string, maxChars: number): string;
+
+export { collapseWhitespace, truncateCodePointSafe };

package/dist/whitespace.js

@@ -0,0 +1,9 @@
+import {
+  collapseWhitespace,
+  truncateCodePointSafe
+} from "./chunk-6MKAMLQL.js";
+export {
+  collapseWhitespace,
+  truncateCodePointSafe
+};
+//# sourceMappingURL=whitespace.js.map

package/dist/whitespace.js.map

@@ -0,0 +1 @@
+{"version":3,"sources":[],"sourcesContent":[],"mappings":"","names":[]}

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "@remnic/core",
-  "version": "1.0.2",
+  "version": "1.1.0",
   "description": "Framework-agnostic Remnic memory engine — orchestrator, storage, extraction, search, trust zones",
   "type": "module",
   "main": "dist/index.js",
@@ -22,11 +22,6 @@
     "access": "public",
     "provenance": true
   },
-  "scripts": {
-    "build": "tsup",
-    "check-types": "tsc --noEmit",
-    "prepublishOnly": "npm run build"
-  },
   "dependencies": {
     "@honcho-ai/sdk": "^2.0.0",
     "@lancedb/lancedb": "^0.26.2",
@@ -55,5 +50,16 @@
     "url": "https://github.com/joshuaswarren/remnic.git",
     "directory": "packages/remnic-core"
   },
-  "keywords": ["remnic", "memory", "ai", "agent", "core"]
-}
+  "keywords": [
+    "remnic",
+    "memory",
+    "ai",
+    "agent",
+    "core"
+  ],
+  "scripts": {
+    "build": "tsup",
+    "check-types": "tsc --noEmit",
+    "test": "tsx --test 'src/**/*.test.ts'"
+  }
+}

package/dist/chunk-2CJCWDMR.js

@@ -1,87 +0,0 @@
-import {
-  countRecallTokenOverlap,
-  normalizeRecallTokens
-} from "./chunk-DT5TVLJE.js";
-
-// src/semantic-consolidation.ts
-function findSimilarClusters(memories, config) {
-  const excluded = new Set(config.excludeCategories);
-  const byCategory = /* @__PURE__ */ new Map();
-  for (const m of memories) {
-    const cat = m.frontmatter.category;
-    if (excluded.has(cat)) continue;
-    if (m.frontmatter.status && m.frontmatter.status !== "active") continue;
-    const list = byCategory.get(cat) ?? [];
-    list.push(m);
-    byCategory.set(cat, list);
-  }
-  const clusters = [];
-  let totalCandidates = 0;
-  for (const [category, mems] of byCategory) {
-    if (totalCandidates >= config.maxPerRun) break;
-    const tokenized = mems.map((m) => ({
-      memory: m,
-      tokens: new Set(normalizeRecallTokens(m.content, []))
-    }));
-    const clustered = /* @__PURE__ */ new Set();
-    for (let i = 0; i < tokenized.length && totalCandidates < config.maxPerRun; i++) {
-      if (clustered.has(tokenized[i].memory.frontmatter.id)) continue;
-      const cluster = [tokenized[i].memory];
-      let totalOverlap = 0;
-      let comparisons = 0;
-      for (let j = i + 1; j < tokenized.length; j++) {
-        if (clustered.has(tokenized[j].memory.frontmatter.id)) continue;
-        const aTokens = tokenized[i].tokens;
-        const bTokens = tokenized[j].tokens;
-        if (aTokens.size === 0 || bTokens.size === 0) continue;
-        const overlap = countRecallTokenOverlap(aTokens, [...bTokens].join(" "));
-        const maxTokens = Math.max(aTokens.size, bTokens.size);
-        const score = maxTokens > 0 ? overlap / maxTokens : 0;
-        if (score >= config.threshold) {
-          cluster.push(tokenized[j].memory);
-          totalOverlap += score;
-          comparisons++;
-          if (totalCandidates + cluster.length >= config.maxPerRun) break;
-        }
-      }
-      if (cluster.length >= config.minClusterSize) {
-        for (const m of cluster) clustered.add(m.frontmatter.id);
-        clusters.push({
-          category,
-          memories: cluster,
-          overlapScore: comparisons > 0 ? totalOverlap / comparisons : 0
-        });
-        totalCandidates += cluster.length;
-      }
-    }
-  }
-  return clusters;
-}
-function buildConsolidationPrompt(cluster) {
-  const memoryTexts = cluster.memories.map(
-    (m, i) => `Memory ${i + 1} (${m.frontmatter.id}, created ${m.frontmatter.created}):
-${m.content}`
-  ).join("\n\n");
-  return `You are a memory consolidation system. The following ${cluster.memories.length} memories in the "${cluster.category}" category contain overlapping information.
-
-Synthesize them into ONE canonical memory that:
-1. Preserves ALL unique information from every source memory
-2. Removes redundancy and repetition
-3. Uses clear, concise language
-4. Maintains the same category and tone
-5. Does NOT add information that isn't in the sources
-
-${memoryTexts}
-
-Write ONLY the consolidated memory content (no metadata, no explanation, no preamble):`;
-}
-function parseConsolidationResponse(response) {
-  return response.trim();
-}
-
-export {
-  findSimilarClusters,
-  buildConsolidationPrompt,
-  parseConsolidationResponse
-};
-//# sourceMappingURL=chunk-2CJCWDMR.js.map

package/dist/chunk-2CJCWDMR.js.map

@@ -1 +0,0 @@
-{"version":3,"sources":["../src/semantic-consolidation.ts"],"sourcesContent":["/**\n * semantic-consolidation.ts — Semantic Consolidation Engine\n *\n * Finds clusters of semantically similar memories using token overlap,\n * synthesizes canonical versions via LLM, and archives the originals.\n * Reduces memory store bloat while preserving all unique information.\n */\n\nimport { log } from \"./logger.js\";\nimport type { MemoryFile } from \"./types.js\";\nimport { normalizeRecallTokens, countRecallTokenOverlap } from \"./recall-tokenization.js\";\n\nexport interface ConsolidationCluster {\n  category: string;\n  memories: MemoryFile[];\n  overlapScore: number;\n  canonicalContent?: string;\n}\n\nexport interface SemanticConsolidationResult {\n  clustersFound: number;\n  memoriesConsolidated: number;\n  memoriesArchived: number;\n  errors: number;\n  clusters: ConsolidationCluster[];\n}\n\n/**\n * Find clusters of semantically similar memories using token overlap.\n */\nexport function findSimilarClusters(\n  memories: MemoryFile[],\n  config: {\n    threshold: number;\n    minClusterSize: number;\n    excludeCategories: string[];\n    maxPerRun: number;\n  },\n): ConsolidationCluster[] {\n  const excluded = new Set(config.excludeCategories);\n\n  // Group by category first\n  const byCategory = new Map<string, MemoryFile[]>();\n  for (const m of memories) {\n    const cat = m.frontmatter.category;\n    if (excluded.has(cat)) continue;\n    if (m.frontmatter.status && m.frontmatter.status !== \"active\") continue;\n    const list = byCategory.get(cat) ?? [];\n    list.push(m);\n    byCategory.set(cat, list);\n  }\n\n  const clusters: ConsolidationCluster[] = [];\n  let totalCandidates = 0;\n\n  for (const [category, mems] of byCategory) {\n    if (totalCandidates >= config.maxPerRun) break;\n\n    // Token-normalize all memories in this category\n    const tokenized = mems.map((m) => ({\n      memory: m,\n      tokens: new Set(normalizeRecallTokens(m.content, [])),\n    }));\n\n    // Track which memories are already clustered\n    const clustered = new Set<string>();\n\n    for (let i = 0; i < tokenized.length && totalCandidates < config.maxPerRun; i++) {\n      if (clustered.has(tokenized[i].memory.frontmatter.id)) continue;\n\n      const cluster: MemoryFile[] = [tokenized[i].memory];\n      let totalOverlap = 0;\n      let comparisons = 0;\n\n      for (let j = i + 1; j < tokenized.length; j++) {\n        if (clustered.has(tokenized[j].memory.frontmatter.id)) continue;\n\n        const aTokens = tokenized[i].tokens;\n        const bTokens = tokenized[j].tokens;\n        if (aTokens.size === 0 || bTokens.size === 0) continue;\n\n        // Bidirectional overlap: what fraction of tokens are shared\n        const overlap = countRecallTokenOverlap(aTokens, [...bTokens].join(\" \"));\n        const maxTokens = Math.max(aTokens.size, bTokens.size);\n        const score = maxTokens > 0 ? overlap / maxTokens : 0;\n\n        if (score >= config.threshold) {\n          cluster.push(tokenized[j].memory);\n          totalOverlap += score;\n          comparisons++;\n          // Enforce maxPerRun within a single cluster\n          if (totalCandidates + cluster.length >= config.maxPerRun) break;\n        }\n      }\n\n      if (cluster.length >= config.minClusterSize) {\n        for (const m of cluster) clustered.add(m.frontmatter.id);\n        clusters.push({\n          category,\n          memories: cluster,\n          overlapScore: comparisons > 0 ? totalOverlap / comparisons : 0,\n        });\n        totalCandidates += cluster.length;\n      }\n    }\n  }\n\n  return clusters;\n}\n\n/**\n * Build the LLM prompt for synthesizing a canonical memory from a cluster.\n */\nexport function buildConsolidationPrompt(cluster: ConsolidationCluster): string {\n  const memoryTexts = cluster.memories\n    .map(\n      (m, i) =>\n        `Memory ${i + 1} (${m.frontmatter.id}, created ${m.frontmatter.created}):\\n${m.content}`,\n    )\n    .join(\"\\n\\n\");\n\n  return `You are a memory consolidation system. The following ${cluster.memories.length} memories in the \"${cluster.category}\" category contain overlapping information.\n\nSynthesize them into ONE canonical memory that:\n1. Preserves ALL unique information from every source memory\n2. Removes redundancy and repetition\n3. Uses clear, concise language\n4. Maintains the same category and tone\n5. Does NOT add information that isn't in the sources\n\n${memoryTexts}\n\nWrite ONLY the consolidated memory content (no metadata, no explanation, no preamble):`;\n}\n\n/**\n * Parse the LLM response to extract the canonical content.\n */\nexport function parseConsolidationResponse(response: string): string {\n  return response.trim();\n}\n"],"mappings":";;;;;;AA8BO,SAAS,oBACd,UACA,QAMwB;AACxB,QAAM,WAAW,IAAI,IAAI,OAAO,iBAAiB;AAGjD,QAAM,aAAa,oBAAI,IAA0B;AACjD,aAAW,KAAK,UAAU;AACxB,UAAM,MAAM,EAAE,YAAY;AAC1B,QAAI,SAAS,IAAI,GAAG,EAAG;AACvB,QAAI,EAAE,YAAY,UAAU,EAAE,YAAY,WAAW,SAAU;AAC/D,UAAM,OAAO,WAAW,IAAI,GAAG,KAAK,CAAC;AACrC,SAAK,KAAK,CAAC;AACX,eAAW,IAAI,KAAK,IAAI;AAAA,EAC1B;AAEA,QAAM,WAAmC,CAAC;AAC1C,MAAI,kBAAkB;AAEtB,aAAW,CAAC,UAAU,IAAI,KAAK,YAAY;AACzC,QAAI,mBAAmB,OAAO,UAAW;AAGzC,UAAM,YAAY,KAAK,IAAI,CAAC,OAAO;AAAA,MACjC,QAAQ;AAAA,MACR,QAAQ,IAAI,IAAI,sBAAsB,EAAE,SAAS,CAAC,CAAC,CAAC;AAAA,IACtD,EAAE;AAGF,UAAM,YAAY,oBAAI,IAAY;AAElC,aAAS,IAAI,GAAG,IAAI,UAAU,UAAU,kBAAkB,OAAO,WAAW,KAAK;AAC/E,UAAI,UAAU,IAAI,UAAU,CAAC,EAAE,OAAO,YAAY,EAAE,EAAG;AAEvD,YAAM,UAAwB,CAAC,UAAU,CAAC,EAAE,MAAM;AAClD,UAAI,eAAe;AACnB,UAAI,cAAc;AAElB,eAAS,IAAI,IAAI,GAAG,IAAI,UAAU,QAAQ,KAAK;AAC7C,YAAI,UAAU,IAAI,UAAU,CAAC,EAAE,OAAO,YAAY,EAAE,EAAG;AAEvD,cAAM,UAAU,UAAU,CAAC,EAAE;AAC7B,cAAM,UAAU,UAAU,CAAC,EAAE;AAC7B,YAAI,QAAQ,SAAS,KAAK,QAAQ,SAAS,EAAG;AAG9C,cAAM,UAAU,wBAAwB,SAAS,CAAC,GAAG,OAAO,EAAE,KAAK,GAAG,CAAC;AACvE,cAAM,YAAY,KAAK,IAAI,QAAQ,MAAM,QAAQ,IAAI;AACrD,cAAM,QAAQ,YAAY,IAAI,UAAU,YAAY;AAEpD,YAAI,SAAS,OAAO,WAAW;AAC7B,kBAAQ,KAAK,UAAU,CAAC,EAAE,MAAM;AAChC,0BAAgB;AAChB;AAEA,cAAI,kBAAkB,QAAQ,UAAU,OAAO,UAAW;AAAA,QAC5D;AAAA,MACF;AAEA,UAAI,QAAQ,UAAU,OAAO,gBAAgB;AAC3C,mBAAW,KAAK,QAAS,WAAU,IAAI,EAAE,YAAY,EAAE;AACvD,iBAAS,KAAK;AAAA,UACZ;AAAA,UACA,UAAU;AAAA,UACV,cAAc,cAAc,IAAI,eAAe,cAAc;AAAA,QAC/D,CAAC;AACD,2BAAmB,QAAQ;AAAA,MAC7B;AAAA,IACF;AAAA,EACF;AAEA,SAAO;AACT;AAKO,SAAS,yBAAyB,SAAuC;AAC9E,QAAM,cAAc,QAAQ,SACzB;AAAA,IACC,CAAC,GAAG,MACF,UAAU,IAAI,CAAC,KAAK,EAAE,YAAY,EAAE,aAAa,EAAE,YAAY,OAAO;AAAA,EAAO,EAAE,OAAO;AAAA,EAC1F,EACC,KAAK,MAAM;AAEd,SAAO,wDAAwD,QAAQ,SAAS,MAAM,qBAAqB,QAAQ,QAAQ;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAS3H,WAAW;AAAA;AAAA;AAGb;AAKO,SAAS,2BAA2B,UAA0B;AACnE,SAAO,SAAS,KAAK;AACvB;","names":[]}

package/dist/chunk-2PO5ZRKV.js.map

@@ -1 +0,0 @@
-{"version":3,"sources":["../src/day-summary.ts"],"sourcesContent":["import { existsSync } from \"node:fs\";\nimport { readFile } from \"node:fs/promises\";\nimport path from \"node:path\";\nimport { fileURLToPath } from \"node:url\";\nimport { log } from \"./logger.js\";\nimport type { MemoryFile } from \"./types.js\";\n\nconst PROMPT_RELATIVE_PATH = path.join(\"prompts\", \"day_summary.prompt.md\");\n\n// Embedded fallback prompt for packaged/plugin-install builds where\n// prompts/day_summary.prompt.md may not be present in the runtime bundle.\nconst EMBEDDED_DAY_SUMMARY_PROMPT = `# Baseline day-summary prompt\n\nYou are writing an Engram end-of-day summary.\n\nYour job:\n- compress the day into a short, useful recap\n- prioritize concrete events, decisions, mood/energy signals, and open loops\n- include a few practical next actions for tomorrow\n- avoid hype, fluff, therapy-speak, and invented facts\n\nOutput JSON with these keys:\n- \\`summary\\` — one short paragraph\n- \\`bullets\\` — 2 to 5 bullets with the most important moments\n- \\`next_actions\\` — 1 to 3 concrete actions\n- \\`risks_or_open_loops\\` — 0 to 3 things that still need attention\n\nRules:\n- stay grounded in the input only\n- if the day was mixed, say so plainly\n- do not overstate confidence or importance\n- prefer specific verbs over vague abstractions\n\nBrevity:\n- keep the summary under 90 words\n- keep bullets short and information-dense\n- omit anything that does not change what tomorrow should care about\n\nStructure:\n- \\`summary\\` should be one paragraph only\n- \\`bullets\\` should contain the most important moments, not generic restatements\n- \\`next_actions\\` and \\`risks_or_open_loops\\` should be distinct and non-overlapping\n\nRisk:\n- explicitly surface unresolved blockers, dependencies, or fragile assumptions\n- do not bury open loops inside the summary if they deserve separate attention\n\nTone:\n- sound like a clear internal daily note, not a report template\n- stay natural and direct while remaining compact`;\n\nfunction candidateRoots(): string[] {\n  const currentFile = fileURLToPath(import.meta.url);\n  const here = path.dirname(currentFile);\n  const candidates = [path.resolve(here, \"..\"), path.resolve(here, \"..\", \"..\")];\n\n  const seen = new Set<string>();\n  return candidates.filter((candidate) => {\n    const normalized = path.resolve(candidate);\n    if (seen.has(normalized)) return false;\n    seen.add(normalized);\n    return true;\n  });\n}\n\nfunction resolvePromptPath(): string | null {\n  for (const root of candidateRoots()) {\n    const candidate = path.join(root, PROMPT_RELATIVE_PATH);\n    if (existsSync(candidate)) {\n      return candidate;\n    }\n  }\n  return null;\n}\n\nexport async function loadDaySummaryPrompt(): Promise<string> {\n  const promptPath = resolvePromptPath();\n  if (promptPath) {\n    try {\n      const raw = await readFile(promptPath, \"utf-8\");\n      // CRLF-compatible regex: allow \\r\\n or \\n line endings\n      const match = raw.match(/```(?:[a-zA-Z0-9_-]+)?\\r?\\n([\\s\\S]*?)\\r?\\n```/);\n      if (match?.[1]) {\n        return match[1].trim();\n      }\n      log.warn(\"day summary prompt file does not contain a fenced prompt block; using embedded fallback\");\n    } catch (err) {\n      log.warn(`day summary prompt file read failed; using embedded fallback: ${err}`);\n    }\n  }\n  return EMBEDDED_DAY_SUMMARY_PROMPT;\n}\n\nexport function formatDaySummaryMemories(memories: string | MemoryFile[]): string {\n  if (typeof memories === \"string\") {\n    return memories.trim();\n  }\n\n  return memories\n    .map((memory) => {\n      const category = memory.frontmatter.category || \"fact\";\n      const created = memory.frontmatter.created || \"unknown\";\n      return `[${memory.frontmatter.id}] (${category}, ${created})\\n${memory.content}`;\n    })\n    .join(\"\\n\\n\")\n    .trim();\n}\n"],"mappings":";;;;;AAAA,SAAS,kBAAkB;AAC3B,SAAS,gBAAgB;AACzB,OAAO,UAAU;AACjB,SAAS,qBAAqB;AAI9B,IAAM,uBAAuB,KAAK,KAAK,WAAW,uBAAuB;AAIzE,IAAM,8BAA8B;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAwCpC,SAAS,iBAA2B;AAClC,QAAM,cAAc,cAAc,YAAY,GAAG;AACjD,QAAM,OAAO,KAAK,QAAQ,WAAW;AACrC,QAAM,aAAa,CAAC,KAAK,QAAQ,MAAM,IAAI,GAAG,KAAK,QAAQ,MAAM,MAAM,IAAI,CAAC;AAE5E,QAAM,OAAO,oBAAI,IAAY;AAC7B,SAAO,WAAW,OAAO,CAAC,cAAc;AACtC,UAAM,aAAa,KAAK,QAAQ,SAAS;AACzC,QAAI,KAAK,IAAI,UAAU,EAAG,QAAO;AACjC,SAAK,IAAI,UAAU;AACnB,WAAO;AAAA,EACT,CAAC;AACH;AAEA,SAAS,oBAAmC;AAC1C,aAAW,QAAQ,eAAe,GAAG;AACnC,UAAM,YAAY,KAAK,KAAK,MAAM,oBAAoB;AACtD,QAAI,WAAW,SAAS,GAAG;AACzB,aAAO;AAAA,IACT;AAAA,EACF;AACA,SAAO;AACT;AAEA,eAAsB,uBAAwC;AAC5D,QAAM,aAAa,kBAAkB;AACrC,MAAI,YAAY;AACd,QAAI;AACF,YAAM,MAAM,MAAM,SAAS,YAAY,OAAO;AAE9C,YAAM,QAAQ,IAAI,MAAM,+CAA+C;AACvE,UAAI,QAAQ,CAAC,GAAG;AACd,eAAO,MAAM,CAAC,EAAE,KAAK;AAAA,MACvB;AACA,UAAI,KAAK,yFAAyF;AAAA,IACpG,SAAS,KAAK;AACZ,UAAI,KAAK,iEAAiE,GAAG,EAAE;AAAA,IACjF;AAAA,EACF;AACA,SAAO;AACT;AAEO,SAAS,yBAAyB,UAAyC;AAChF,MAAI,OAAO,aAAa,UAAU;AAChC,WAAO,SAAS,KAAK;AAAA,EACvB;AAEA,SAAO,SACJ,IAAI,CAAC,WAAW;AACf,UAAM,WAAW,OAAO,YAAY,YAAY;AAChD,UAAM,UAAU,OAAO,YAAY,WAAW;AAC9C,WAAO,IAAI,OAAO,YAAY,EAAE,MAAM,QAAQ,KAAK,OAAO;AAAA,EAAM,OAAO,OAAO;AAAA,EAChF,CAAC,EACA,KAAK,MAAM,EACX,KAAK;AACV;","names":[]}