@remnic/core 10.0.7 → 10.0.9

package/src/recall-harmonic-qmd-ordering.test.ts

@@ -0,0 +1,304 @@
+// #3188: park only harmonic's source read and observe real QMD publication.
+
+import assert from "node:assert/strict";
+import path from "node:path";
+import type { TestContext } from "node:test";
+import test from "node:test";
+
+import { recordAbstractionNode } from "./abstraction-nodes.js";
+import { parseConfig } from "./config.js";
+import { rebuildMemoryProjection } from "./maintenance/rebuild-memory-projection.js";
+import { Orchestrator } from "./orchestrator.js";
+import {
+  RecallSectionCoordinator,
+  type RecallSectionAppendOptions,
+  type RecallSectionBuckets,
+} from "./orchestration/recall-section-coordinator.js";
+import { getRecallTimings } from "./recall-timings.js";
+import type { RecallInternalCoordinator } from "./orchestration/recall-internal.js";
+import { StorageManager } from "./storage.js";
+import type { SearchBackend } from "./search/port.js";
+import { cleanupDir, eventually, mkTempMemoryDir } from "./testing/orchestrator-lite.js";
+import type { MemoryFile, PluginConfig, QmdSearchResult } from "./types.js";
+
+const RECALL_PROMPT = "how does the atlas source lookup behave?";
+
+/**
+ * Complete typed SearchBackend stub (no casts): answers availability and
+ * returns one settled QMD candidate from `search`; every other read surface
+ * is empty. Mirrors the recall-hardening backend-stub shape.
+ */
+function settledQmdBackend(result: QmdSearchResult): SearchBackend {
+  return {
+    async probe() {
+      return true;
+    },
+    isAvailable() {
+      return true;
+    },
+    debugStatus() {
+      return "backend=settled-qmd-stub";
+    },
+    async search() {
+      return [result];
+    },
+    async searchGlobal() {
+      return [];
+    },
+    async bm25Search() {
+      return [];
+    },
+    async vectorSearch() {
+      return [];
+    },
+    async hybridSearch() {
+      return [];
+    },
+    async update() {},
+    async updateCollection() {},
+    async embed() {},
+    async embedCollection() {},
+    async ensureCollection() {
+      return "present";
+    },
+  };
+}
+
+interface OrderingHarness {
+  memoryDir: string;
+  orchestrator: Orchestrator;
+  config: PluginConfig;
+  qmdMemory: MemoryFile;
+  harmonicSource: MemoryFile;
+  /** Releases the parked harmonic source read (idempotent). */
+  releaseHarmonicRead: () => void;
+  /** Section ids in append order, via the section coordinator prototype. */
+  appendedSectionIds: string[];
+  /** How often the harmonic source read was asked for (and parked). */
+  harmonicReadCalls: { count: number };
+  recall: () => Promise<string>;
+}
+
+/**
+ * Seed two active memories — one returned as the settled QMD candidate, one
+ * projected into a real abstraction-node store row — then boot the real
+ * orchestrator over them. The projection rebuild keeps the harmonic read on
+ * the indexed exact-path branch, so intercepting that one
+ * `StorageManager.readMemoryByPath` call parks harmonic and nothing else.
+ */
+async function makeOrderingHarness(
+  t: TestContext,
+  mode: "park" | "fail",
+): Promise<OrderingHarness> {
+  const memoryDir = await mkTempMemoryDir("recall-harmonic-order-");
+  const storage = new StorageManager(memoryDir);
+  await storage.ensureDirectories();
+
+  const { memory: qmdMemory } = await storage.writeMemory(
+    "fact",
+    "the atlas qmd sentinel confirms deployment cadence",
+    { source: "test" },
+  );
+  const { memory: harmonicSource } = await storage.writeMemory(
+    "fact",
+    "atlas harmonic source lookup body",
+    { source: "test" },
+  );
+  await recordAbstractionNode({
+    memoryDir,
+    node: {
+      schemaVersion: 1,
+      nodeId: "ordering-under-qmd",
+      recordedAt: new Date().toISOString(),
+      sessionKey: "agent:test",
+      kind: "topic",
+      abstractionLevel: "meso",
+      title: "atlas source lookup",
+      summary: "atlas source lookup",
+      sourceMemoryIds: [harmonicSource.frontmatter.id],
+    },
+  });
+  await rebuildMemoryProjection({ memoryDir, storage, dryRun: false });
+
+  // Defaults only — the ordering fix must not move any budget, and the
+  // default candidate/namespace sets stay untouched.
+  const config = parseConfig({
+    openaiApiKey: "sk-test",
+    memoryDir,
+    workspaceDir: path.join(memoryDir, "workspace"),
+    qmdEnabled: true,
+    embeddingFallbackEnabled: false,
+    recallPlannerEnabled: false,
+    sharedContextEnabled: false,
+    harmonicRetrievalEnabled: true,
+    queryAwareIndexingEnabled: false,
+    parallelRetrievalEnabled: false,
+    initGateTimeoutMs: 1000,
+  });
+
+  const orchestrator = new Orchestrator(config);
+  orchestrator.qmd = settledQmdBackend({
+    docid: qmdMemory.frontmatter.id,
+    path: qmdMemory.path,
+    score: 0.9,
+    snippet: qmdMemory.content,
+  });
+
+  const appendedSectionIds: string[] = [];
+  const originalAppend = RecallSectionCoordinator.prototype.appendRecallSection;
+  t.mock.method(
+    RecallSectionCoordinator.prototype,
+    "appendRecallSection",
+    function recordAppendedSection(
+      this: RecallSectionCoordinator,
+      sectionBuckets: RecallSectionBuckets,
+      sectionId: string,
+      content: string,
+      options?: RecallSectionAppendOptions,
+    ): boolean {
+      appendedSectionIds.push(sectionId);
+      return originalAppend.call(this, sectionBuckets, sectionId, content, options);
+    },
+  );
+
+  const harmonicGate = Promise.withResolvers<void>();
+  const harmonicReadCalls = { count: 0 };
+  const originalRead = StorageManager.prototype.readMemoryByPath;
+  const harmonicSourcePath = path.resolve(harmonicSource.path);
+  t.mock.method(
+    StorageManager.prototype,
+    "readMemoryByPath",
+    function interceptHarmonicSourceRead(
+      this: StorageManager,
+      filePath: string,
+    ): Promise<MemoryFile | null> {
+      if (path.resolve(filePath) !== harmonicSourcePath) {
+        return originalRead.call(this, filePath);
+      }
+      if (mode === "fail") {
+        return Promise.reject(new Error("synthetic harmonic source read failure"));
+      }
+      harmonicReadCalls.count += 1;
+      return harmonicGate.promise.then(() => originalRead.call(this, filePath));
+    },
+  );
+
+  // Invoke the existing private delegate without booting background services.
+  const recallSeam = orchestrator as unknown as Pick<RecallInternalCoordinator, "recallInternal">
+    & Pick<RecallSectionCoordinator, "isRecallSectionEnabled">;
+  t.mock.method(recallSeam, "isRecallSectionEnabled", (id: string) =>
+    id === "memories" || id === "harmonic-retrieval");
+
+  return {
+    memoryDir,
+    orchestrator,
+    config,
+    qmdMemory,
+    harmonicSource,
+    releaseHarmonicRead: () => harmonicGate.resolve(),
+    appendedSectionIds,
+    harmonicReadCalls,
+    recall: () => recallSeam.recallInternal(RECALL_PROMPT, "agent:test", { mode: "full" }),
+  };
+}
+
+test("settled QMD publishes while the harmonic read is still parked; harmonic renders after release", async (t) => {
+  const harness = await makeOrderingHarness(t, "park");
+  const { memoryDir, orchestrator, config, appendedSectionIds, harmonicReadCalls } =
+    harness;
+  let recallPromise: Promise<string> | undefined;
+  try {
+    // The move must not touch any deadline: pin the configured defaults.
+    assert.equal(config.recallOuterTimeoutMs, 75_000);
+    assert.equal(config.recallCoreDeadlineMs, 75_000);
+    assert.equal(config.recallEnrichmentDeadlineMs, 60_000);
+
+    recallPromise = harness.recall();
+
+    // The harmonic read starts during phase 1 and is now parked.
+    await eventually(
+      async () => (harmonicReadCalls.count > 0 ? true : null),
+      "harmonic source read reached the parked seam",
+    );
+
+    // The fix: the settled QMD candidate is formatted and published while
+    // harmonic is still parked. Under the pre-fix order the assembly blocked
+    // on harmonic first, so this probe could never succeed.
+    await eventually(
+      async () => (appendedSectionIds.includes("memories") ? true : null),
+      "QMD memories section published while harmonic is parked",
+    );
+    assert.equal(
+      appendedSectionIds.includes("harmonic-retrieval"),
+      false,
+      "harmonic must not append before its read is released",
+    );
+
+    harness.releaseHarmonicRead();
+    const context = await recallPromise;
+
+    // Harmonic still publishes afterward, with its candidate content, and
+    // QMD publication strictly precedes the harmonic append.
+    assert.ok(
+      appendedSectionIds.includes("harmonic-retrieval"),
+      "harmonic section must append after the read is released",
+    );
+    assert.ok(
+      appendedSectionIds.lastIndexOf("memories") <
+        appendedSectionIds.indexOf("harmonic-retrieval"),
+      `QMD publication must precede the harmonic append, got: ${appendedSectionIds.join(",")}`,
+    );
+    assert.ok(context.includes(harness.qmdMemory.content), "QMD candidate must render");
+    assert.ok(
+      context.includes("## Harmonic Retrieval"),
+      `harmonic section must render, got: ${context.slice(0, 600)}`,
+    );
+    assert.ok(
+      context.includes(harness.harmonicSource.content),
+      "harmonic candidate content must render",
+    );
+
+    // Budget parity: harmonic completed inside the untouched shared
+    // enrichment budget. A cancelled/timed-out harmonic drops its timing
+    // entry (timeout strings do not sanitize to numbers), so a numeric
+    // harmonicRetrieval timing proves the move neither shortened nor spent
+    // the budget ahead of QMD.
+    const record = getRecallTimings(config).find(
+      (candidate) => candidate.timingsMs.harmonicRetrieval !== undefined,
+    );
+    assert.ok(record, "harmonic must complete within the shared enrichment budget");
+    assert.ok(record.timingsMs.qmd !== undefined, "QMD timing must be recorded");
+  } finally {
+    harness.releaseHarmonicRead();
+    await recallPromise?.catch(() => undefined);
+    await orchestrator.destroy();
+    await cleanupDir(memoryDir);
+  }
+});
+
+test("a failed harmonic source read degrades without taking QMD publication down", async (t) => {
+  const harness = await makeOrderingHarness(t, "fail");
+  const { memoryDir, orchestrator, qmdMemory, appendedSectionIds } = harness;
+  try {
+    const context = await harness.recall();
+
+    assert.ok(
+      appendedSectionIds.includes("memories"),
+      "QMD must still publish when the harmonic read fails",
+    );
+    assert.equal(
+      appendedSectionIds.includes("harmonic-retrieval"),
+      false,
+      "a failed harmonic read must append no harmonic section",
+    );
+    assert.ok(context.includes(qmdMemory.content), "QMD candidate must render");
+    assert.ok(
+      !context.includes("## Harmonic Retrieval"),
+      "no harmonic section may render after a failed read",
+    );
+  } finally {
+    harness.releaseHarmonicRead();
+    await orchestrator.destroy();
+    await cleanupDir(memoryDir);
+  }
+});

package/dist/chunk-7PZHH4KC.js.map

@@ -1 +0,0 @@
-{"version":3,"sources":["../src/memory-projection-batch.ts"],"sourcesContent":["import type { MemoryProjectionCurrentState } from \"./types.js\";\nimport {\n  memoryCurrentSelectExpressions,\n  openProjectionReadonly,\n  parseCurrentRow,\n} from \"./memory-projection-store.js\";\n\nexport interface ProjectedMemoryStateBatch {\n  states: Map<string, MemoryProjectionCurrentState>;\n  /** Meta `rebuiltAt`; null when the projection never recorded one. */\n  rebuiltAt: string | null;\n  /**\n   * True only when the writer recorded that `memory_current` covers every active\n   * memory (an unscoped rebuild). Projections written before this flag existed,\n   * and scoped rebuilds, read as false.\n   */\n  complete: boolean;\n}\n\n/**\n * Read many current-state rows over ONE readonly connection, plus the meta the\n * recall path needs to decide whether the index can be trusted. Ids absent from\n * `memory_current` are simply missing from the map. Null means the projection\n * could not be opened or read.\n */\nexport function readProjectedMemoryStates(\n  memoryDir: string,\n  memoryIds: Iterable<string>,\n): ProjectedMemoryStateBatch | null {\n  const db = openProjectionReadonly(memoryDir);\n  if (!db) return null;\n  try {\n    const currentSelect = memoryCurrentSelectExpressions(db);\n    const select = db.prepare(\n      `\n        SELECT\n          memory_id,\n          category,\n          status,\n          lifecycle_state,\n          path_rel,\n          created_at,\n          updated_at,\n          archived_at,\n          superseded_at,\n          entity_ref,\n          source,\n          confidence,\n          confidence_tier,\n          memory_kind,\n          access_count,\n          last_accessed,\n          ${currentSelect.tagsJson},\n          ${currentSelect.previewText},\n          ${currentSelect.privateRecord}\n        FROM memory_current\n        WHERE memory_id = ?\n      `,\n    );\n    const states = new Map<string, MemoryProjectionCurrentState>();\n    for (const memoryId of memoryIds) {\n      const state = parseCurrentRow(memoryDir, select.get(memoryId) as Record<string, unknown> | undefined);\n      if (state) states.set(memoryId, state);\n    }\n    const meta = new Map<string, unknown>(\n      (db.prepare(\"SELECT key, value FROM meta WHERE key IN ('rebuiltAt', 'complete')\").all() as Array<{\n        key: string;\n        value: unknown;\n      }>).map((row) => [row.key, row.value]),\n    );\n    const rebuiltAt = meta.get(\"rebuiltAt\");\n    return {\n      states,\n      rebuiltAt: typeof rebuiltAt === \"string\" ? rebuiltAt : null,\n      complete: meta.get(\"complete\") === \"true\",\n    };\n  } catch {\n    return null;\n  } finally {\n    db.close();\n  }\n}\n"],"mappings":";;;;;;;AAyBO,SAAS,0BACd,WACA,WACkC;AAClC,QAAM,KAAK,uBAAuB,SAAS;AAC3C,MAAI,CAAC,GAAI,QAAO;AAChB,MAAI;AACF,UAAM,gBAAgB,+BAA+B,EAAE;AACvD,UAAM,SAAS,GAAG;AAAA,MAChB;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,YAkBM,cAAc,QAAQ;AAAA,YACtB,cAAc,WAAW;AAAA,YACzB,cAAc,aAAa;AAAA;AAAA;AAAA;AAAA,IAInC;AACA,UAAM,SAAS,oBAAI,IAA0C;AAC7D,eAAW,YAAY,WAAW;AAChC,YAAM,QAAQ,gBAAgB,WAAW,OAAO,IAAI,QAAQ,CAAwC;AACpG,UAAI,MAAO,QAAO,IAAI,UAAU,KAAK;AAAA,IACvC;AACA,UAAM,OAAO,IAAI;AAAA,MACd,GAAG,QAAQ,oEAAoE,EAAE,IAAI,EAGlF,IAAI,CAAC,QAAQ,CAAC,IAAI,KAAK,IAAI,KAAK,CAAC;AAAA,IACvC;AACA,UAAM,YAAY,KAAK,IAAI,WAAW;AACtC,WAAO;AAAA,MACL;AAAA,MACA,WAAW,OAAO,cAAc,WAAW,YAAY;AAAA,MACvD,UAAU,KAAK,IAAI,UAAU,MAAM;AAAA,IACrC;AAAA,EACF,QAAQ;AACN,WAAO;AAAA,EACT,UAAE;AACA,OAAG,MAAM;AAAA,EACX;AACF;","names":[]}

package/dist/chunk-V4ACBX3C.js.map

@@ -1 +0,0 @@
-{"version":3,"sources":["../src/harmonic-retrieval.ts"],"sourcesContent":["import path from \"node:path\";\nimport { existsSync } from \"node:fs\";\nimport { realpath } from \"node:fs/promises\";\nimport { listJsonFilesStrict, readJsonFile } from \"./json-store.js\";\nimport { throwIfAborted } from \"./abort-error.js\";\nimport { inferMemoryStatus, toMemoryPathRel } from \"./memory-lifecycle-ledger-utils.js\";\n import {\n   HARMONIC_SOURCE_MEMORY_INSERTED_AT_KEY,\n   resolveAbstractionNodeStoreDir,\n   validateAbstractionNode,\n   type AbstractionNode,\n } from \"./abstraction-nodes.js\";\nimport { resolveCueAnchorStoreDir, validateCueAnchor, type CueAnchor, type CueAnchorType } from \"./cue-anchors.js\";\nimport { compareDeterministicStrings } from \"./deterministic-order.js\";\nimport { countRecallTokenOverlap, normalizeRecallTokens } from \"./recall-tokenization.js\";\nimport { stripAttributesSuffix } from \"./structured-attributes.js\";\nimport { isValidityExpiredNow } from \"./temporal-validity.js\";\nimport { assertSafePathSegment, isRecord } from \"./store-contract.js\";\nimport { isSupportPassportPrivateMemory } from \"./support-passport/card-projection.js\";\nimport type { MemoryFile } from \"./types.js\";\nimport { readProjectedMemoryStates } from \"./memory-projection-batch.js\";\nimport { SecureStoreLockedError } from \"./secure-store/secure-fs.js\";\nimport { StorageManager } from \"./storage.js\";\nimport { RECALL_FALLBACK_DIRS } from \"./utils/category-dir.js\";\nimport { isPathInsideStorageRoot } from \"./storage-paths.js\";\n\n\ntype SourceMemoryMap = Map<string, MemoryFile>;\n\n// `rootReal` set: a direct probe, which skips the corpus walk's symlink\n// hardening, so the resolved file must stay inside the memory root. Null: the\n// path came from the contained corpus walk and is already trusted.\nasync function readMemoryFile(\n  storage: StorageManager,\n  rootReal: string | null,\n  filePath: string,\n  abortSignal?: AbortSignal,\n): Promise<MemoryFile | null> {\n  throwIfAborted(abortSignal, \"harmonic retrieval aborted\");\n  if (!existsSync(filePath)) return null;\n  try {\n    if (rootReal !== null && !isPathInsideStorageRoot(rootReal, await realpath(filePath))) return null;\n    return await storage.readMemoryByPath(filePath);\n  } catch (err) {\n    throwIfAborted(abortSignal, \"harmonic retrieval aborted\");\n    if (err instanceof SecureStoreLockedError) throw err;\n    return null;\n  }\n}\n\n// An index older than this is treated as unusable: the date window needed to\n// cover \"created since the last rebuild\" would stop being cheap.\nconst INDEX_MAX_AGE_MS = 7 * 86_400_000;\nconst DAY_MS = 86_400_000;\n\nfunction utcDaysSince(rebuiltMs: number, nowMs: number): string[] {\n  const days: string[] = [];\n  for (let day = Math.floor((rebuiltMs - DAY_MS) / DAY_MS) * DAY_MS; day <= nowMs; day += DAY_MS) {\n    days.push(new Date(day).toISOString().slice(0, 10));\n  }\n  return days;\n}\n\n// Source ids confirmed absent by a corpus path walk. A node only references a\n// source after the source file exists, so a confirmed absence stays true unless\n// the file is restored later; the short TTL bounds that. Without this, one\n// dangling id (a hard-deleted fact) would force a walk on every recall.\nconst ABSENT_SOURCE_TTL_MS = 10 * 60_000;\nconst ABSENT_SOURCE_MAX_ENTRIES = 4096;\nconst absentSourceIds = new Map<string, number>(); // `${memoryDir}\\0${id}` -> expiry ms\n\n// Memories the projection has no row for were written after its last rebuild, so\n// their dated directory is normally one of `days`. Hot and cold tiers are probed\n// by exact path. Only recall-corpus categories are probed: `questions/` is a queue\n// and `artifacts/` is outside the recall surface, so neither can be a source.\nfunction unprojectedCandidatePaths(memoryDir: string, id: string, days: string[]): string[] {\n  const paths: string[] = [];\n  for (const root of [memoryDir, path.join(memoryDir, \"cold\")]) {\n    for (const dir of RECALL_FALLBACK_DIRS) {\n      paths.push(path.join(root, dir, `${id}.md`));\n      for (const day of days) paths.push(path.join(root, dir, day, `${id}.md`));\n    }\n  }\n  return paths;\n}\n\n/**\n * Resolve only the source ids the abstraction nodes reference. Returns null when\n * the projection is absent, unreadable, too old, or not known to cover every\n * active memory (a scoped or pre-`complete` rebuild), so the caller keeps the\n * full-corpus scan. Every file is read from disk, so status, tags and validity\n * are current; the index only says where to look. An id the cheap probes cannot\n * place (an import filed under an old date, a tier root outside the memory dir)\n * is looked up by one contained path-only walk, never a frontmatter parse of the\n * corpus.\n */\nasync function readIndexedSourceMemories(options: {\n  memoryDir: string;\n  abortSignal?: AbortSignal;\n  sourceMemoryIds: string[];\n  nowMs: number;\n}): Promise<SourceMemoryMap | null> {\n  // The ids go to SQL as bound parameters, so any id the projection holds is safe to look up.\n  const batch = readProjectedMemoryStates(options.memoryDir, options.sourceMemoryIds);\n  const rebuiltMs = Date.parse(batch?.rebuiltAt ?? \"\");\n  if (!batch?.complete || !Number.isFinite(rebuiltMs) || options.nowMs - rebuiltMs > INDEX_MAX_AGE_MS) return null;\n  const rootReal = await realpath(options.memoryDir).catch(() => null);\n  if (rootReal === null) return null;\n\n  const storage = new StorageManager(options.memoryDir);\n  const days = utcDaysSince(rebuiltMs, options.nowMs);\n  const sourceMemories: SourceMemoryMap = new Map();\n  const pending: string[] = [];\n  for (const id of options.sourceMemoryIds) {\n    const state = batch.states.get(id);\n    // An id is only ever joined into a path when it is a single safe segment.\n    let safeId = true;\n    try {\n      assertSafePathSegment(id, \"sourceMemoryId\");\n    } catch {\n      safeId = false;\n    }\n    // An unprojected id that is not a single path segment cannot be probed or\n    // matched by filename, and the scan keys sources by frontmatter id, so only\n    // the scan can place it. Rare (legacy/imported ids); worst case is the old cost.\n    if (!state && !safeId) return null;\n    // state.path was containment-checked by the projection reader.\n    const candidates = state\n      ? [state.path, path.join(options.memoryDir, \"cold\", state.pathRel)]\n      : unprojectedCandidatePaths(options.memoryDir, id, days);\n    let found = false;\n    for (const candidate of candidates) {\n      const memory = await readMemoryFile(storage, rootReal, candidate, options.abortSignal);\n      if (memory?.frontmatter.id !== id) continue;\n      sourceMemories.set(id, memory);\n      found = true;\n      break;\n    }\n    const absentKey = `${options.memoryDir}\\0${id}`;\n    if (!found && safeId && (absentSourceIds.get(absentKey) ?? 0) <= options.nowMs) pending.push(id);\n  }\n  if (pending.length === 0) return sourceMemories;\n\n  const wanted = new Set(pending);\n  const walked = [\n    ...(await storage.collectActiveMemoryPaths({ abortSignal: options.abortSignal })),\n    ...(await storage.collectColdMemoryPaths({ abortSignal: options.abortSignal })),\n  ];\n  for (const filePath of walked) {\n    throwIfAborted(options.abortSignal, \"harmonic retrieval aborted\");\n    if (!wanted.has(path.basename(filePath, \".md\"))) continue;\n    const memory = await readMemoryFile(storage, null, filePath, options.abortSignal);\n    if (memory && wanted.has(memory.frontmatter.id)) sourceMemories.set(memory.frontmatter.id, memory);\n  }\n  if (absentSourceIds.size > ABSENT_SOURCE_MAX_ENTRIES) absentSourceIds.clear();\n  for (const id of pending) {\n    if (!sourceMemories.has(id)) absentSourceIds.set(`${options.memoryDir}\\0${id}`, options.nowMs + ABSENT_SOURCE_TTL_MS);\n  }\n  return sourceMemories;\n}\n\nasync function readCorpusSourceMemories(options: {\n  memoryDir: string;\n  abortSignal?: AbortSignal;\n}): Promise<SourceMemoryMap> {\n  const sourceMemories: SourceMemoryMap = new Map();\n  try {\n    const storage = new StorageManager(options.memoryDir);\n    const [hotMemories, coldMemories] = await Promise.all([\n      storage.readAllMemories({ abortSignal: options.abortSignal }),\n      storage.readAllColdMemories(),\n    ]);\n    for (const memory of [...hotMemories, ...coldMemories]) {\n      throwIfAborted(options.abortSignal, \"harmonic retrieval aborted\");\n      sourceMemories.set(memory.frontmatter.id, memory);\n    }\n  } catch (err) {\n    throwIfAborted(options.abortSignal, \"harmonic retrieval aborted\");\n    if (err instanceof SecureStoreLockedError) return new Map();\n    // Source validation fails closed when the authorized memory directory is\n    // unreadable. Source-less nodes remain eligible for retrieval.\n    sourceMemories.clear();\n  }\n  return sourceMemories;\n}\n\nasync function readSourceMemories(options: {\n  memoryDir: string;\n  abortSignal?: AbortSignal;\n  sourceMemoryIds: string[];\n  nowMs?: number;\n}): Promise<SourceMemoryMap> {\n  try {\n    const indexed = await readIndexedSourceMemories({\n      memoryDir: options.memoryDir,\n      abortSignal: options.abortSignal,\n      sourceMemoryIds: options.sourceMemoryIds,\n      nowMs: options.nowMs ?? Date.now(),\n    });\n    if (indexed) return indexed;\n  } catch (err) {\n    throwIfAborted(options.abortSignal, \"harmonic retrieval aborted\");\n    if (err instanceof SecureStoreLockedError) return new Map();\n  }\n  return readCorpusSourceMemories(options);\n}\n\nfunction parseSourceMemoryInsertedAt(node: AbstractionNode): Map<string, string> {\n  const insertedAtById = new Map<string, string>();\n  const insertedAtRaw = node.metadata?.[HARMONIC_SOURCE_MEMORY_INSERTED_AT_KEY];\n  if (!insertedAtRaw) return insertedAtById;\n  try {\n    const parsed = JSON.parse(insertedAtRaw) as unknown;\n    if (!isRecord(parsed)) return insertedAtById;\n    for (const [memoryId, value] of Object.entries(parsed)) {\n      if (typeof value === \"string\") insertedAtById.set(memoryId, value);\n    }\n  } catch {\n    // Malformed insertion metadata leaves ordering on the recordedAt fallback.\n  }\n  return insertedAtById;\n}\n\nfunction projectSourceBackedNode(\n  node: AbstractionNode,\n  sourceMemories: SourceMemoryMap,\n  memoryDir: string,\n  temporalExpiredInInjection: boolean,\n  nowMs: number\n): AbstractionNode | null {\n  const sourceMemoryIds = node.sourceMemoryIds ?? [];\n  if (sourceMemoryIds.length === 0) return node;\n\n  const activeSourceMemoryIds = sourceMemoryIds.filter((memoryId) => {\n    const memory = sourceMemories.get(memoryId);\n    return (\n      memory !== undefined &&\n      // #2332: a private support-passport record leaves the eligible set the\n      // same way a rejected one does — a node title or anchor attribution\n      // rebuilt from it would leak governed metadata into the deep-recall\n      // frontier (and every other graph reader) before any content check runs.\n      !isSupportPassportPrivateMemory(memory) &&\n      inferMemoryStatus(memory.frontmatter, toMemoryPathRel(memoryDir, memory.path)) === \"active\" &&\n      (temporalExpiredInInjection || !isValidityExpiredNow(memory.frontmatter, nowMs))\n    );\n  });\n  if (activeSourceMemoryIds.length === 0) return null;\n\n // Newest-first source order keeps the projected title and summary on the most\n // recently inserted facts. Equal or missing timestamps fall back to ascending\n // id order, which matches the stored sourceMemoryIds order.\n const insertedAtById = parseSourceMemoryInsertedAt(node);\n const insertedAtMs = (memoryId: string): number => {\n   const parsedMs = Date.parse(insertedAtById.get(memoryId) ?? \"\");\n   return Number.isFinite(parsedMs) ? parsedMs : Date.parse(node.recordedAt);\n };\n activeSourceMemoryIds.sort(\n   (left, right) =>\n     insertedAtMs(right) - insertedAtMs(left) || compareDeterministicStrings(left, right)\n );\n\n  const activeMemories = activeSourceMemoryIds.flatMap((memoryId) => {\n    const memory = sourceMemories.get(memoryId);\n    return memory ? [memory] : [];\n  });\n  const activeContents = activeMemories.map((memory) =>\n    memory.frontmatter.structuredAttributes ? stripAttributesSuffix(memory.content) : memory.content\n  );\n let metadata: Record<string, string> | undefined;\n const activeInsertedAt = activeSourceMemoryIds.flatMap((memoryId) => {\n   const value = insertedAtById.get(memoryId);\n   return typeof value === \"string\" ? [[memoryId, value] as const] : [];\n });\n if (activeInsertedAt.length > 0) {\n   metadata = {\n     [HARMONIC_SOURCE_MEMORY_INSERTED_AT_KEY]: JSON.stringify(Object.fromEntries(activeInsertedAt)),\n   };\n  }\n\n return {\n   ...node,\n   sourceMemoryIds: activeSourceMemoryIds,\n   title: activeContents[0]?.slice(0, 80) ?? node.title,\n   summary: activeContents.slice(0, 3).join(\"; \").slice(0, 400),\n   tags: [...new Set(activeMemories.flatMap((memory) => memory.frontmatter.tags))].sort(compareDeterministicStrings),\n   entityRefs: [\n     ...new Set(\n       activeMemories.flatMap((memory) =>\n         typeof memory.frontmatter.entityRef === \"string\" ? [memory.frontmatter.entityRef] : []\n       )\n     ),\n   ].sort(compareDeterministicStrings),\n   metadata,\n };\n}\n\nfunction anchorMatchesProjectedNode(\n  anchor: CueAnchor,\n  nodeRef: string,\n  node: AbstractionNode,\n  allowLegacyAttribution: boolean\n): boolean {\n  const activeSourceMemoryIds = node.sourceMemoryIds ?? [];\n  if (activeSourceMemoryIds.length === 0) return true;\n  if (!anchor.sourceMemoryIdsByNodeRef) return allowLegacyAttribution;\n  const anchorSourceMemoryIds = anchor.sourceMemoryIdsByNodeRef[nodeRef] ?? [];\n  return anchorSourceMemoryIds.some((sourceMemoryId) => activeSourceMemoryIds.includes(sourceMemoryId));\n}\n\nexport interface HarmonicMatchedAnchor {\n  anchorId: string;\n  anchorType: CueAnchorType;\n  anchorValue: string;\n}\n\nexport interface HarmonicRetrievalResult {\n  node: AbstractionNode;\n  score: number;\n  nodeScore: number;\n  anchorScore: number;\n  matchedFields: string[];\n  matchedAnchors: HarmonicMatchedAnchor[];\n}\n\ninterface HarmonicCandidate {\n  node: AbstractionNode;\n  nodeScore: number;\n  anchorScore: number;\n  matchedFields: Set<string>;\n  matchedAnchors: Map<string, HarmonicMatchedAnchor>;\n}\n\nfunction scoreNode(node: AbstractionNode, queryTokens: Set<string>): { score: number; matchedFields: string[] } {\n  const matchedFields: string[] = [];\n  let score = 0;\n\n  const titleMatches = countRecallTokenOverlap(queryTokens, node.title);\n  if (titleMatches > 0) {\n    score += titleMatches * 3;\n    matchedFields.push(\"title\");\n  }\n\n  const summaryMatches = countRecallTokenOverlap(queryTokens, node.summary);\n  if (summaryMatches > 0) {\n    score += summaryMatches * 3;\n    matchedFields.push(\"summary\");\n  }\n\n  const tagMatches = countRecallTokenOverlap(queryTokens, node.tags?.join(\" \"));\n  if (tagMatches > 0) {\n    score += tagMatches * 2;\n    matchedFields.push(\"tags\");\n  }\n\n  const entityMatches = countRecallTokenOverlap(queryTokens, node.entityRefs?.join(\" \"));\n  if (entityMatches > 0) {\n    score += entityMatches * 2;\n    matchedFields.push(\"entityRefs\");\n  }\n\n  const kindMatches = countRecallTokenOverlap(queryTokens, `${node.kind} ${node.abstractionLevel}`);\n  if (kindMatches > 0) {\n    score += kindMatches;\n    matchedFields.push(\"kind\");\n  }\n\n  return { score, matchedFields };\n}\n\nfunction scoreAnchor(\n  anchor: CueAnchor,\n  queryTokens: Set<string>,\n  eligibleNodeTags: readonly string[]\n): { score: number; matchedFields: string[] } {\n  const matchedFields: string[] = [];\n  let score = 0;\n\n  const valueMatches = countRecallTokenOverlap(queryTokens, anchor.anchorValue);\n  const normalizedMatches = countRecallTokenOverlap(queryTokens, anchor.normalizedCue);\n  const cueMatches = Math.max(valueMatches, normalizedMatches);\n  if (cueMatches > 0) {\n    score += cueMatches * 4;\n    if (valueMatches > 0) matchedFields.push(\"anchorValue\");\n    if (normalizedMatches > 0) matchedFields.push(\"anchor\");\n  }\n\n  const typeMatches = countRecallTokenOverlap(queryTokens, anchor.anchorType);\n  if (typeMatches > 0) {\n    score += typeMatches;\n    matchedFields.push(\"anchorType\");\n  }\n\n  const tagMatches = countRecallTokenOverlap(queryTokens, eligibleNodeTags.join(\" \"));\n  if (tagMatches > 0) {\n    score += tagMatches * 2;\n    matchedFields.push(\"anchorTags\");\n  }\n\n  return { score, matchedFields };\n}\n\nexport async function readAbstractionNodes(options: {\n  memoryDir: string;\n  abstractionNodeStoreDir?: string;\n}): Promise<AbstractionNode[]> {\n  const rootDir = resolveAbstractionNodeStoreDir(options.memoryDir, options.abstractionNodeStoreDir);\n  const files = await listJsonFilesStrict(path.join(rootDir, \"nodes\"), { allowMissingDirectory: true });\n  const nodes: AbstractionNode[] = [];\n  for (const filePath of files) {\n    try {\n      nodes.push(validateAbstractionNode(await readJsonFile(filePath)));\n    } catch {\n      // fail-open: invalid artifacts stay visible via status tooling instead of recall\n    }\n  }\n  return nodes;\n}\n\nexport async function readCueAnchors(options: {\n  memoryDir: string;\n  abstractionNodeStoreDir?: string;\n}): Promise<CueAnchor[]> {\n  const abstractionRoot = resolveAbstractionNodeStoreDir(options.memoryDir, options.abstractionNodeStoreDir);\n  const rootDir = resolveCueAnchorStoreDir(abstractionRoot);\n  const files = await listJsonFilesStrict(rootDir, { allowMissingDirectory: true });\n  const anchors: CueAnchor[] = [];\n  for (const filePath of files) {\n    try {\n      anchors.push(validateCueAnchor(await readJsonFile(filePath)));\n    } catch {\n      // fail-open: invalid artifacts stay visible via status tooling instead of recall\n    }\n  }\n  return anchors;\n}\n\nexport interface ProjectedHarmonicGraph {\n  nodes: AbstractionNode[];\n  anchors: CueAnchor[];\n}\n\n/**\n * Read nodes + anchors and project BOTH against the namespace's current active\n * memories. This is the single projection every graph reader shares: a raw\n * `readAbstractionNodes` / `readCueAnchors` pair still carries the stored title,\n * summary, tags, and anchor attribution of a memory that was later rejected,\n * quarantined, or otherwise moved out of the active set, so a second reader\n * that skipped the projection could leak governed metadata even when the\n * memory itself is excluded from the final results.\n *\n * - A node whose every source memory left the active set is dropped.\n * - A surviving node's title/summary/tags/entityRefs are rebuilt from its\n *   active sources only.\n * - An anchor keeps a node reference only while its attribution runs through\n *   one of that node's surviving active sources, and is dropped once no\n *   reference survives.\n */\nexport async function readProjectedHarmonicGraph(options: {\n  memoryDir: string;\n  abstractionNodeStoreDir?: string;\n  anchorsEnabled: boolean;\n  abortSignal?: AbortSignal;\n  temporalExpiredInInjection?: boolean;\n  nowMs?: number;\n}): Promise<ProjectedHarmonicGraph> {\n  throwIfAborted(options.abortSignal, \"harmonic retrieval aborted\");\n  const nodes = await readAbstractionNodes(options);\n  const sourceMemoryIds = [...new Set(nodes.flatMap((node) => node.sourceMemoryIds ?? []))];\n  const sourceMemories: SourceMemoryMap = sourceMemoryIds.length > 0\n    ? await readSourceMemories({\n        memoryDir: options.memoryDir,\n        abortSignal: options.abortSignal,\n        sourceMemoryIds,\n        nowMs: options.nowMs,\n      })\n    : new Map();\n  const nowMs = options.nowMs ?? Date.now();\n  // A node whose full stored source set survived projection keeps legacy\n  // anchor attribution (an anchor written before per-node source ids existed).\n  const legacyCompatibleNodeRefs = new Set<string>();\n  const projectedNodes = nodes.flatMap((node) => {\n    const projected = projectSourceBackedNode(\n      node,\n      sourceMemories,\n      options.memoryDir,\n      options.temporalExpiredInInjection === true,\n      nowMs\n    );\n    if (\n      projected &&\n      (node.sourceMemoryIds?.length ?? 0) > 0 &&\n      projected.sourceMemoryIds?.length === node.sourceMemoryIds?.length\n    ) {\n      legacyCompatibleNodeRefs.add(node.nodeId);\n    }\n    return projected ? [projected] : [];\n  });\n  if (!options.anchorsEnabled) return { nodes: projectedNodes, anchors: [] };\n  throwIfAborted(options.abortSignal, \"harmonic retrieval aborted\");\n  const nodeIndex = new Map(projectedNodes.map((node) => [node.nodeId, node]));\n  const anchors = (await readCueAnchors(options)).flatMap((anchor) => {\n    throwIfAborted(options.abortSignal, \"harmonic retrieval aborted\");\n    const nodeRefs = anchor.nodeRefs.filter((nodeRef) => {\n      const node = nodeIndex.get(nodeRef);\n      return (\n        node !== undefined &&\n        anchorMatchesProjectedNode(anchor, nodeRef, node, legacyCompatibleNodeRefs.has(nodeRef))\n      );\n    });\n    return nodeRefs.length > 0 ? [{ ...anchor, nodeRefs }] : [];\n  });\n  return { nodes: projectedNodes, anchors };\n}\n\nexport async function searchHarmonicRetrieval(options: {\n  memoryDir: string;\n  abstractionNodeStoreDir?: string;\n  query: string;\n  maxResults: number;\n  sessionKey?: string;\n  anchorsEnabled: boolean;\n  abortSignal?: AbortSignal;\n  temporalExpiredInInjection?: boolean;\n}): Promise<HarmonicRetrievalResult[]> {\n  throwIfAborted(options.abortSignal, \"harmonic retrieval aborted\");\n  const queryTokens = new Set(normalizeRecallTokens(options.query, [\"what\", \"which\"]));\n  if (queryTokens.size === 0 || options.maxResults <= 0) return [];\n\n  // One projection for every graph reader: nodes and anchors both arrive\n  // already narrowed to the namespace's current active memories.\n  const { nodes: eligibleNodes, anchors } = await readProjectedHarmonicGraph(options);\n  const candidates = new Map<string, HarmonicCandidate>();\n\n  for (const node of eligibleNodes) {\n    throwIfAborted(options.abortSignal, \"harmonic retrieval aborted\");\n    const { score, matchedFields } = scoreNode(node, queryTokens);\n    if (score <= 0) continue;\n    candidates.set(node.nodeId, {\n      node,\n      nodeScore: score,\n      anchorScore: 0,\n      matchedFields: new Set(matchedFields),\n      matchedAnchors: new Map(),\n    });\n  }\n\n  if (options.anchorsEnabled) {\n    throwIfAborted(options.abortSignal, \"harmonic retrieval aborted\");\n    const nodeIndex = new Map(eligibleNodes.map((node) => [node.nodeId, node]));\n    for (const anchor of anchors) {\n      throwIfAborted(options.abortSignal, \"harmonic retrieval aborted\");\n      // `nodeRefs` are the projection's surviving references already.\n      const eligibleNodeRefs = anchor.nodeRefs;\n      const eligibleNodeTags = new Set(eligibleNodeRefs.flatMap((nodeRef) => nodeIndex.get(nodeRef)?.tags ?? []));\n      const eligibleAnchorTags = anchor.tags?.filter((tag) => eligibleNodeTags.has(tag)) ?? [];\n      const { score, matchedFields } = scoreAnchor(anchor, queryTokens, eligibleAnchorTags);\n      if (score <= 0) continue;\n      for (const nodeRef of eligibleNodeRefs) {\n        const node = nodeIndex.get(nodeRef);\n        if (!node) continue;\n        const existing = candidates.get(nodeRef) ?? {\n          node,\n          nodeScore: 0,\n          anchorScore: 0,\n          matchedFields: new Set<string>(),\n          matchedAnchors: new Map<string, HarmonicMatchedAnchor>(),\n        };\n        existing.anchorScore += score;\n        existing.matchedFields.add(\"anchor\");\n        for (const field of matchedFields) existing.matchedFields.add(field);\n        existing.matchedAnchors.set(anchor.anchorId, {\n          anchorId: anchor.anchorId,\n          anchorType: anchor.anchorType,\n          anchorValue: anchor.anchorValue,\n        });\n        candidates.set(nodeRef, existing);\n      }\n    }\n  }\n\n  return [...candidates.values()]\n    .map((candidate) => {\n      let score = candidate.nodeScore + candidate.anchorScore;\n      if (options.sessionKey && candidate.node.sessionKey === options.sessionKey) score += 0.5;\n      return {\n        node: candidate.node,\n        score,\n        nodeScore: candidate.nodeScore,\n        anchorScore: candidate.anchorScore,\n        matchedFields: [...candidate.matchedFields].sort(),\n        matchedAnchors: [...candidate.matchedAnchors.values()].sort(\n          (left, right) =>\n            left.anchorType.localeCompare(right.anchorType) || left.anchorValue.localeCompare(right.anchorValue)\n        ),\n      };\n    })\n    .filter((result) => result.nodeScore > 0 || result.anchorScore > 0)\n    .sort(\n      (left, right) =>\n        right.score - left.score ||\n        right.anchorScore - left.anchorScore ||\n        right.node.recordedAt.localeCompare(left.node.recordedAt)\n    )\n    .slice(0, options.maxResults);\n}\n"],"mappings":";;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AAAA,OAAO,UAAU;AACjB,SAAS,kBAAkB;AAC3B,SAAS,gBAAgB;AA8BzB,eAAe,eACb,SACA,UACA,UACA,aAC4B;AAC5B,iBAAe,aAAa,4BAA4B;AACxD,MAAI,CAAC,WAAW,QAAQ,EAAG,QAAO;AAClC,MAAI;AACF,QAAI,aAAa,QAAQ,CAAC,wBAAwB,UAAU,MAAM,SAAS,QAAQ,CAAC,EAAG,QAAO;AAC9F,WAAO,MAAM,QAAQ,iBAAiB,QAAQ;AAAA,EAChD,SAAS,KAAK;AACZ,mBAAe,aAAa,4BAA4B;AACxD,QAAI,eAAe,uBAAwB,OAAM;AACjD,WAAO;AAAA,EACT;AACF;AAIA,IAAM,mBAAmB,IAAI;AAC7B,IAAM,SAAS;AAEf,SAAS,aAAa,WAAmB,OAAyB;AAChE,QAAM,OAAiB,CAAC;AACxB,WAAS,MAAM,KAAK,OAAO,YAAY,UAAU,MAAM,IAAI,QAAQ,OAAO,OAAO,OAAO,QAAQ;AAC9F,SAAK,KAAK,IAAI,KAAK,GAAG,EAAE,YAAY,EAAE,MAAM,GAAG,EAAE,CAAC;AAAA,EACpD;AACA,SAAO;AACT;AAMA,IAAM,uBAAuB,KAAK;AAClC,IAAM,4BAA4B;AAClC,IAAM,kBAAkB,oBAAI,IAAoB;AAMhD,SAAS,0BAA0B,WAAmB,IAAY,MAA0B;AAC1F,QAAM,QAAkB,CAAC;AACzB,aAAW,QAAQ,CAAC,WAAW,KAAK,KAAK,WAAW,MAAM,CAAC,GAAG;AAC5D,eAAW,OAAO,sBAAsB;AACtC,YAAM,KAAK,KAAK,KAAK,MAAM,KAAK,GAAG,EAAE,KAAK,CAAC;AAC3C,iBAAW,OAAO,KAAM,OAAM,KAAK,KAAK,KAAK,MAAM,KAAK,KAAK,GAAG,EAAE,KAAK,CAAC;AAAA,IAC1E;AAAA,EACF;AACA,SAAO;AACT;AAYA,eAAe,0BAA0B,SAKL;AAElC,QAAM,QAAQ,0BAA0B,QAAQ,WAAW,QAAQ,eAAe;AAClF,QAAM,YAAY,KAAK,MAAM,OAAO,aAAa,EAAE;AACnD,MAAI,CAAC,OAAO,YAAY,CAAC,OAAO,SAAS,SAAS,KAAK,QAAQ,QAAQ,YAAY,iBAAkB,QAAO;AAC5G,QAAM,WAAW,MAAM,SAAS,QAAQ,SAAS,EAAE,MAAM,MAAM,IAAI;AACnE,MAAI,aAAa,KAAM,QAAO;AAE9B,QAAM,UAAU,IAAI,eAAe,QAAQ,SAAS;AACpD,QAAM,OAAO,aAAa,WAAW,QAAQ,KAAK;AAClD,QAAM,iBAAkC,oBAAI,IAAI;AAChD,QAAM,UAAoB,CAAC;AAC3B,aAAW,MAAM,QAAQ,iBAAiB;AACxC,UAAM,QAAQ,MAAM,OAAO,IAAI,EAAE;AAEjC,QAAI,SAAS;AACb,QAAI;AACF,4BAAsB,IAAI,gBAAgB;AAAA,IAC5C,QAAQ;AACN,eAAS;AAAA,IACX;AAIA,QAAI,CAAC,SAAS,CAAC,OAAQ,QAAO;AAE9B,UAAM,aAAa,QACf,CAAC,MAAM,MAAM,KAAK,KAAK,QAAQ,WAAW,QAAQ,MAAM,OAAO,CAAC,IAChE,0BAA0B,QAAQ,WAAW,IAAI,IAAI;AACzD,QAAI,QAAQ;AACZ,eAAW,aAAa,YAAY;AAClC,YAAM,SAAS,MAAM,eAAe,SAAS,UAAU,WAAW,QAAQ,WAAW;AACrF,UAAI,QAAQ,YAAY,OAAO,GAAI;AACnC,qBAAe,IAAI,IAAI,MAAM;AAC7B,cAAQ;AACR;AAAA,IACF;AACA,UAAM,YAAY,GAAG,QAAQ,SAAS,KAAK,EAAE;AAC7C,QAAI,CAAC,SAAS,WAAW,gBAAgB,IAAI,SAAS,KAAK,MAAM,QAAQ,MAAO,SAAQ,KAAK,EAAE;AAAA,EACjG;AACA,MAAI,QAAQ,WAAW,EAAG,QAAO;AAEjC,QAAM,SAAS,IAAI,IAAI,OAAO;AAC9B,QAAM,SAAS;AAAA,IACb,GAAI,MAAM,QAAQ,yBAAyB,EAAE,aAAa,QAAQ,YAAY,CAAC;AAAA,IAC/E,GAAI,MAAM,QAAQ,uBAAuB,EAAE,aAAa,QAAQ,YAAY,CAAC;AAAA,EAC/E;AACA,aAAW,YAAY,QAAQ;AAC7B,mBAAe,QAAQ,aAAa,4BAA4B;AAChE,QAAI,CAAC,OAAO,IAAI,KAAK,SAAS,UAAU,KAAK,CAAC,EAAG;AACjD,UAAM,SAAS,MAAM,eAAe,SAAS,MAAM,UAAU,QAAQ,WAAW;AAChF,QAAI,UAAU,OAAO,IAAI,OAAO,YAAY,EAAE,EAAG,gBAAe,IAAI,OAAO,YAAY,IAAI,MAAM;AAAA,EACnG;AACA,MAAI,gBAAgB,OAAO,0BAA2B,iBAAgB,MAAM;AAC5E,aAAW,MAAM,SAAS;AACxB,QAAI,CAAC,eAAe,IAAI,EAAE,EAAG,iBAAgB,IAAI,GAAG,QAAQ,SAAS,KAAK,EAAE,IAAI,QAAQ,QAAQ,oBAAoB;AAAA,EACtH;AACA,SAAO;AACT;AAEA,eAAe,yBAAyB,SAGX;AAC3B,QAAM,iBAAkC,oBAAI,IAAI;AAChD,MAAI;AACF,UAAM,UAAU,IAAI,eAAe,QAAQ,SAAS;AACpD,UAAM,CAAC,aAAa,YAAY,IAAI,MAAM,QAAQ,IAAI;AAAA,MACpD,QAAQ,gBAAgB,EAAE,aAAa,QAAQ,YAAY,CAAC;AAAA,MAC5D,QAAQ,oBAAoB;AAAA,IAC9B,CAAC;AACD,eAAW,UAAU,CAAC,GAAG,aAAa,GAAG,YAAY,GAAG;AACtD,qBAAe,QAAQ,aAAa,4BAA4B;AAChE,qBAAe,IAAI,OAAO,YAAY,IAAI,MAAM;AAAA,IAClD;AAAA,EACF,SAAS,KAAK;AACZ,mBAAe,QAAQ,aAAa,4BAA4B;AAChE,QAAI,eAAe,uBAAwB,QAAO,oBAAI,IAAI;AAG1D,mBAAe,MAAM;AAAA,EACvB;AACA,SAAO;AACT;AAEA,eAAe,mBAAmB,SAKL;AAC3B,MAAI;AACF,UAAM,UAAU,MAAM,0BAA0B;AAAA,MAC9C,WAAW,QAAQ;AAAA,MACnB,aAAa,QAAQ;AAAA,MACrB,iBAAiB,QAAQ;AAAA,MACzB,OAAO,QAAQ,SAAS,KAAK,IAAI;AAAA,IACnC,CAAC;AACD,QAAI,QAAS,QAAO;AAAA,EACtB,SAAS,KAAK;AACZ,mBAAe,QAAQ,aAAa,4BAA4B;AAChE,QAAI,eAAe,uBAAwB,QAAO,oBAAI,IAAI;AAAA,EAC5D;AACA,SAAO,yBAAyB,OAAO;AACzC;AAEA,SAAS,4BAA4B,MAA4C;AAC/E,QAAM,iBAAiB,oBAAI,IAAoB;AAC/C,QAAM,gBAAgB,KAAK,WAAW,sCAAsC;AAC5E,MAAI,CAAC,cAAe,QAAO;AAC3B,MAAI;AACF,UAAM,SAAS,KAAK,MAAM,aAAa;AACvC,QAAI,CAAC,SAAS,MAAM,EAAG,QAAO;AAC9B,eAAW,CAAC,UAAU,KAAK,KAAK,OAAO,QAAQ,MAAM,GAAG;AACtD,UAAI,OAAO,UAAU,SAAU,gBAAe,IAAI,UAAU,KAAK;AAAA,IACnE;AAAA,EACF,QAAQ;AAAA,EAER;AACA,SAAO;AACT;AAEA,SAAS,wBACP,MACA,gBACA,WACA,4BACA,OACwB;AACxB,QAAM,kBAAkB,KAAK,mBAAmB,CAAC;AACjD,MAAI,gBAAgB,WAAW,EAAG,QAAO;AAEzC,QAAM,wBAAwB,gBAAgB,OAAO,CAAC,aAAa;AACjE,UAAM,SAAS,eAAe,IAAI,QAAQ;AAC1C,WACE,WAAW;AAAA;AAAA;AAAA;AAAA,IAKX,CAAC,+BAA+B,MAAM,KACtC,kBAAkB,OAAO,aAAa,gBAAgB,WAAW,OAAO,IAAI,CAAC,MAAM,aAClF,8BAA8B,CAAC,qBAAqB,OAAO,aAAa,KAAK;AAAA,EAElF,CAAC;AACD,MAAI,sBAAsB,WAAW,EAAG,QAAO;AAKhD,QAAM,iBAAiB,4BAA4B,IAAI;AACvD,QAAM,eAAe,CAAC,aAA6B;AACjD,UAAM,WAAW,KAAK,MAAM,eAAe,IAAI,QAAQ,KAAK,EAAE;AAC9D,WAAO,OAAO,SAAS,QAAQ,IAAI,WAAW,KAAK,MAAM,KAAK,UAAU;AAAA,EAC1E;AACA,wBAAsB;AAAA,IACpB,CAAC,MAAM,UACL,aAAa,KAAK,IAAI,aAAa,IAAI,KAAK,4BAA4B,MAAM,KAAK;AAAA,EACvF;AAEC,QAAM,iBAAiB,sBAAsB,QAAQ,CAAC,aAAa;AACjE,UAAM,SAAS,eAAe,IAAI,QAAQ;AAC1C,WAAO,SAAS,CAAC,MAAM,IAAI,CAAC;AAAA,EAC9B,CAAC;AACD,QAAM,iBAAiB,eAAe;AAAA,IAAI,CAAC,WACzC,OAAO,YAAY,uBAAuB,sBAAsB,OAAO,OAAO,IAAI,OAAO;AAAA,EAC3F;AACD,MAAI;AACJ,QAAM,mBAAmB,sBAAsB,QAAQ,CAAC,aAAa;AACnE,UAAM,QAAQ,eAAe,IAAI,QAAQ;AACzC,WAAO,OAAO,UAAU,WAAW,CAAC,CAAC,UAAU,KAAK,CAAU,IAAI,CAAC;AAAA,EACrE,CAAC;AACD,MAAI,iBAAiB,SAAS,GAAG;AAC/B,eAAW;AAAA,MACT,CAAC,sCAAsC,GAAG,KAAK,UAAU,OAAO,YAAY,gBAAgB,CAAC;AAAA,IAC/F;AAAA,EACD;AAED,SAAO;AAAA,IACL,GAAG;AAAA,IACH,iBAAiB;AAAA,IACjB,OAAO,eAAe,CAAC,GAAG,MAAM,GAAG,EAAE,KAAK,KAAK;AAAA,IAC/C,SAAS,eAAe,MAAM,GAAG,CAAC,EAAE,KAAK,IAAI,EAAE,MAAM,GAAG,GAAG;AAAA,IAC3D,MAAM,CAAC,GAAG,IAAI,IAAI,eAAe,QAAQ,CAAC,WAAW,OAAO,YAAY,IAAI,CAAC,CAAC,EAAE,KAAK,2BAA2B;AAAA,IAChH,YAAY;AAAA,MACV,GAAG,IAAI;AAAA,QACL,eAAe;AAAA,UAAQ,CAAC,WACtB,OAAO,OAAO,YAAY,cAAc,WAAW,CAAC,OAAO,YAAY,SAAS,IAAI,CAAC;AAAA,QACvF;AAAA,MACF;AAAA,IACF,EAAE,KAAK,2BAA2B;AAAA,IAClC;AAAA,EACF;AACD;AAEA,SAAS,2BACP,QACA,SACA,MACA,wBACS;AACT,QAAM,wBAAwB,KAAK,mBAAmB,CAAC;AACvD,MAAI,sBAAsB,WAAW,EAAG,QAAO;AAC/C,MAAI,CAAC,OAAO,yBAA0B,QAAO;AAC7C,QAAM,wBAAwB,OAAO,yBAAyB,OAAO,KAAK,CAAC;AAC3E,SAAO,sBAAsB,KAAK,CAAC,mBAAmB,sBAAsB,SAAS,cAAc,CAAC;AACtG;AAyBA,SAAS,UAAU,MAAuB,aAAsE;AAC9G,QAAM,gBAA0B,CAAC;AACjC,MAAI,QAAQ;AAEZ,QAAM,eAAe,wBAAwB,aAAa,KAAK,KAAK;AACpE,MAAI,eAAe,GAAG;AACpB,aAAS,eAAe;AACxB,kBAAc,KAAK,OAAO;AAAA,EAC5B;AAEA,QAAM,iBAAiB,wBAAwB,aAAa,KAAK,OAAO;AACxE,MAAI,iBAAiB,GAAG;AACtB,aAAS,iBAAiB;AAC1B,kBAAc,KAAK,SAAS;AAAA,EAC9B;AAEA,QAAM,aAAa,wBAAwB,aAAa,KAAK,MAAM,KAAK,GAAG,CAAC;AAC5E,MAAI,aAAa,GAAG;AAClB,aAAS,aAAa;AACtB,kBAAc,KAAK,MAAM;AAAA,EAC3B;AAEA,QAAM,gBAAgB,wBAAwB,aAAa,KAAK,YAAY,KAAK,GAAG,CAAC;AACrF,MAAI,gBAAgB,GAAG;AACrB,aAAS,gBAAgB;AACzB,kBAAc,KAAK,YAAY;AAAA,EACjC;AAEA,QAAM,cAAc,wBAAwB,aAAa,GAAG,KAAK,IAAI,IAAI,KAAK,gBAAgB,EAAE;AAChG,MAAI,cAAc,GAAG;AACnB,aAAS;AACT,kBAAc,KAAK,MAAM;AAAA,EAC3B;AAEA,SAAO,EAAE,OAAO,cAAc;AAChC;AAEA,SAAS,YACP,QACA,aACA,kBAC4C;AAC5C,QAAM,gBAA0B,CAAC;AACjC,MAAI,QAAQ;AAEZ,QAAM,eAAe,wBAAwB,aAAa,OAAO,WAAW;AAC5E,QAAM,oBAAoB,wBAAwB,aAAa,OAAO,aAAa;AACnF,QAAM,aAAa,KAAK,IAAI,cAAc,iBAAiB;AAC3D,MAAI,aAAa,GAAG;AAClB,aAAS,aAAa;AACtB,QAAI,eAAe,EAAG,eAAc,KAAK,aAAa;AACtD,QAAI,oBAAoB,EAAG,eAAc,KAAK,QAAQ;AAAA,EACxD;AAEA,QAAM,cAAc,wBAAwB,aAAa,OAAO,UAAU;AAC1E,MAAI,cAAc,GAAG;AACnB,aAAS;AACT,kBAAc,KAAK,YAAY;AAAA,EACjC;AAEA,QAAM,aAAa,wBAAwB,aAAa,iBAAiB,KAAK,GAAG,CAAC;AAClF,MAAI,aAAa,GAAG;AAClB,aAAS,aAAa;AACtB,kBAAc,KAAK,YAAY;AAAA,EACjC;AAEA,SAAO,EAAE,OAAO,cAAc;AAChC;AAEA,eAAsB,qBAAqB,SAGZ;AAC7B,QAAM,UAAU,+BAA+B,QAAQ,WAAW,QAAQ,uBAAuB;AACjG,QAAM,QAAQ,MAAM,oBAAoB,KAAK,KAAK,SAAS,OAAO,GAAG,EAAE,uBAAuB,KAAK,CAAC;AACpG,QAAM,QAA2B,CAAC;AAClC,aAAW,YAAY,OAAO;AAC5B,QAAI;AACF,YAAM,KAAK,wBAAwB,MAAM,aAAa,QAAQ,CAAC,CAAC;AAAA,IAClE,QAAQ;AAAA,IAER;AAAA,EACF;AACA,SAAO;AACT;AAEA,eAAsB,eAAe,SAGZ;AACvB,QAAM,kBAAkB,+BAA+B,QAAQ,WAAW,QAAQ,uBAAuB;AACzG,QAAM,UAAU,yBAAyB,eAAe;AACxD,QAAM,QAAQ,MAAM,oBAAoB,SAAS,EAAE,uBAAuB,KAAK,CAAC;AAChF,QAAM,UAAuB,CAAC;AAC9B,aAAW,YAAY,OAAO;AAC5B,QAAI;AACF,cAAQ,KAAK,kBAAkB,MAAM,aAAa,QAAQ,CAAC,CAAC;AAAA,IAC9D,QAAQ;AAAA,IAER;AAAA,EACF;AACA,SAAO;AACT;AAuBA,eAAsB,2BAA2B,SAOb;AAClC,iBAAe,QAAQ,aAAa,4BAA4B;AAChE,QAAM,QAAQ,MAAM,qBAAqB,OAAO;AAChD,QAAM,kBAAkB,CAAC,GAAG,IAAI,IAAI,MAAM,QAAQ,CAAC,SAAS,KAAK,mBAAmB,CAAC,CAAC,CAAC,CAAC;AACxF,QAAM,iBAAkC,gBAAgB,SAAS,IAC7D,MAAM,mBAAmB;AAAA,IACvB,WAAW,QAAQ;AAAA,IACnB,aAAa,QAAQ;AAAA,IACrB;AAAA,IACA,OAAO,QAAQ;AAAA,EACjB,CAAC,IACD,oBAAI,IAAI;AACZ,QAAM,QAAQ,QAAQ,SAAS,KAAK,IAAI;AAGxC,QAAM,2BAA2B,oBAAI,IAAY;AACjD,QAAM,iBAAiB,MAAM,QAAQ,CAAC,SAAS;AAC7C,UAAM,YAAY;AAAA,MAChB;AAAA,MACA;AAAA,MACA,QAAQ;AAAA,MACR,QAAQ,+BAA+B;AAAA,MACvC;AAAA,IACF;AACA,QACE,cACC,KAAK,iBAAiB,UAAU,KAAK,KACtC,UAAU,iBAAiB,WAAW,KAAK,iBAAiB,QAC5D;AACA,+BAAyB,IAAI,KAAK,MAAM;AAAA,IAC1C;AACA,WAAO,YAAY,CAAC,SAAS,IAAI,CAAC;AAAA,EACpC,CAAC;AACD,MAAI,CAAC,QAAQ,eAAgB,QAAO,EAAE,OAAO,gBAAgB,SAAS,CAAC,EAAE;AACzE,iBAAe,QAAQ,aAAa,4BAA4B;AAChE,QAAM,YAAY,IAAI,IAAI,eAAe,IAAI,CAAC,SAAS,CAAC,KAAK,QAAQ,IAAI,CAAC,CAAC;AAC3E,QAAM,WAAW,MAAM,eAAe,OAAO,GAAG,QAAQ,CAAC,WAAW;AAClE,mBAAe,QAAQ,aAAa,4BAA4B;AAChE,UAAM,WAAW,OAAO,SAAS,OAAO,CAAC,YAAY;AACnD,YAAM,OAAO,UAAU,IAAI,OAAO;AAClC,aACE,SAAS,UACT,2BAA2B,QAAQ,SAAS,MAAM,yBAAyB,IAAI,OAAO,CAAC;AAAA,IAE3F,CAAC;AACD,WAAO,SAAS,SAAS,IAAI,CAAC,EAAE,GAAG,QAAQ,SAAS,CAAC,IAAI,CAAC;AAAA,EAC5D,CAAC;AACD,SAAO,EAAE,OAAO,gBAAgB,QAAQ;AAC1C;AAEA,eAAsB,wBAAwB,SASP;AACrC,iBAAe,QAAQ,aAAa,4BAA4B;AAChE,QAAM,cAAc,IAAI,IAAI,sBAAsB,QAAQ,OAAO,CAAC,QAAQ,OAAO,CAAC,CAAC;AACnF,MAAI,YAAY,SAAS,KAAK,QAAQ,cAAc,EAAG,QAAO,CAAC;AAI/D,QAAM,EAAE,OAAO,eAAe,QAAQ,IAAI,MAAM,2BAA2B,OAAO;AAClF,QAAM,aAAa,oBAAI,IAA+B;AAEtD,aAAW,QAAQ,eAAe;AAChC,mBAAe,QAAQ,aAAa,4BAA4B;AAChE,UAAM,EAAE,OAAO,cAAc,IAAI,UAAU,MAAM,WAAW;AAC5D,QAAI,SAAS,EAAG;AAChB,eAAW,IAAI,KAAK,QAAQ;AAAA,MAC1B;AAAA,MACA,WAAW;AAAA,MACX,aAAa;AAAA,MACb,eAAe,IAAI,IAAI,aAAa;AAAA,MACpC,gBAAgB,oBAAI,IAAI;AAAA,IAC1B,CAAC;AAAA,EACH;AAEA,MAAI,QAAQ,gBAAgB;AAC1B,mBAAe,QAAQ,aAAa,4BAA4B;AAChE,UAAM,YAAY,IAAI,IAAI,cAAc,IAAI,CAAC,SAAS,CAAC,KAAK,QAAQ,IAAI,CAAC,CAAC;AAC1E,eAAW,UAAU,SAAS;AAC5B,qBAAe,QAAQ,aAAa,4BAA4B;AAEhE,YAAM,mBAAmB,OAAO;AAChC,YAAM,mBAAmB,IAAI,IAAI,iBAAiB,QAAQ,CAAC,YAAY,UAAU,IAAI,OAAO,GAAG,QAAQ,CAAC,CAAC,CAAC;AAC1G,YAAM,qBAAqB,OAAO,MAAM,OAAO,CAAC,QAAQ,iBAAiB,IAAI,GAAG,CAAC,KAAK,CAAC;AACvF,YAAM,EAAE,OAAO,cAAc,IAAI,YAAY,QAAQ,aAAa,kBAAkB;AACpF,UAAI,SAAS,EAAG;AAChB,iBAAW,WAAW,kBAAkB;AACtC,cAAM,OAAO,UAAU,IAAI,OAAO;AAClC,YAAI,CAAC,KAAM;AACX,cAAM,WAAW,WAAW,IAAI,OAAO,KAAK;AAAA,UAC1C;AAAA,UACA,WAAW;AAAA,UACX,aAAa;AAAA,UACb,eAAe,oBAAI,IAAY;AAAA,UAC/B,gBAAgB,oBAAI,IAAmC;AAAA,QACzD;AACA,iBAAS,eAAe;AACxB,iBAAS,cAAc,IAAI,QAAQ;AACnC,mBAAW,SAAS,cAAe,UAAS,cAAc,IAAI,KAAK;AACnE,iBAAS,eAAe,IAAI,OAAO,UAAU;AAAA,UAC3C,UAAU,OAAO;AAAA,UACjB,YAAY,OAAO;AAAA,UACnB,aAAa,OAAO;AAAA,QACtB,CAAC;AACD,mBAAW,IAAI,SAAS,QAAQ;AAAA,MAClC;AAAA,IACF;AAAA,EACF;AAEA,SAAO,CAAC,GAAG,WAAW,OAAO,CAAC,EAC3B,IAAI,CAAC,cAAc;AAClB,QAAI,QAAQ,UAAU,YAAY,UAAU;AAC5C,QAAI,QAAQ,cAAc,UAAU,KAAK,eAAe,QAAQ,WAAY,UAAS;AACrF,WAAO;AAAA,MACL,MAAM,UAAU;AAAA,MAChB;AAAA,MACA,WAAW,UAAU;AAAA,MACrB,aAAa,UAAU;AAAA,MACvB,eAAe,CAAC,GAAG,UAAU,aAAa,EAAE,KAAK;AAAA,MACjD,gBAAgB,CAAC,GAAG,UAAU,eAAe,OAAO,CAAC,EAAE;AAAA,QACrD,CAAC,MAAM,UACL,KAAK,WAAW,cAAc,MAAM,UAAU,KAAK,KAAK,YAAY,cAAc,MAAM,WAAW;AAAA,MACvG;AAAA,IACF;AAAA,EACF,CAAC,EACA,OAAO,CAAC,WAAW,OAAO,YAAY,KAAK,OAAO,cAAc,CAAC,EACjE;AAAA,IACC,CAAC,MAAM,UACL,MAAM,QAAQ,KAAK,SACnB,MAAM,cAAc,KAAK,eACzB,MAAM,KAAK,WAAW,cAAc,KAAK,KAAK,UAAU;AAAA,EAC5D,EACC,MAAM,GAAG,QAAQ,UAAU;AAChC;","names":[]}