omp-fabric 1.17.0 → 1.18.0

package/CHANGELOG.md

@@ -1,5 +1,17 @@
 # Changelog
 
+## 1.18.0
+
+### Fixed
+
+- A forked session no longer starts with an empty frontier. LCM identified a source by `sessionId:entryId:revision`, and a fork mints a new session id while keeping the entries it inherited, so every summary the parent built fell out of the fork on its first readback. A source is now identified by its entry id and payload hash, and the live source set decides membership instead of the session id. Measured on a production ledger, a 400-entry branch that covered 160 sources keeps all 160 after the fork; it covered 0 before.
+- `memory.recall` and `memory.expand` accept an inherited summary and its raw sources. The active-branch binding resolved by session id, so a fork was served summaries whose addresses it then refused to open.
+- A summary the parent left pending no longer suppresses the fork's own leaf over the same entries, which previously dropped up to one leaf window from coverage until the parent session was resumed.
+
+### Changed
+
+- `LcmLedger.readRawKeys` returns `contentHash` alongside each key so the coverage map builds the same identity the frontier uses.
+
 ## 1.17.0
 
 ### Fixed

package/dist/chunks/{chunk-YD4MAZMT.js → chunk-I3XEFTXH.js}

@@ -275,7 +275,7 @@ var excerpt = (text, max = 480) => ({
   truncated: text.length > max
 });
 var isLowSurrogate = (code) => code >= 56320 && code <= 57343;
-var sourceKey = (sessionId, entryId, revision) => `${sessionId}:${entryId}:${revision}`;
+var sourceKey = (entryId, contentHash) => `${entryId}:${contentHash}`;
 var activeBinding = (options, sessionId) => options.branchForSession?.(sessionId);
 var activeSourceSet = (binding) => binding?.activeSourceKeys === void 0 ? void 0 : new Set(binding.activeSourceKeys);
 var sessionScope = (args, currentSessionId) => {
@@ -437,7 +437,7 @@ var LcmMemoryAdapter = class {
       if (page.rows.length === 0) break;
       for (const entry of page.rows) {
         consumed += 1;
-        const allowed = activeAllowed(branches, activeBinding(this.options, entry.sessionId), sourceKey(entry.sessionId, entry.entryId, entry.revision));
+        const allowed = activeAllowed(branches, activeBinding(this.options, entry.sessionId), sourceKey(entry.entryId, entry.contentHash));
         if (!allowed.allowed) {
           if (allowed.reason) reasons.add(allowed.reason);
           continue;
@@ -496,7 +496,7 @@ var LcmMemoryAdapter = class {
           continue;
         }
         const active = activeSourceSet(binding);
-        if (active && node.sources.some((source) => !active.has(sourceKey(node.sessionId, source.entryId, source.revision)))) {
+        if (active && node.sources.some((source) => !active.has(sourceKey(source.entryId, source.contentHash)))) {
           reasons.add("summary_off_active_branch");
           continue;
         }
@@ -543,7 +543,7 @@ var LcmMemoryAdapter = class {
     const active = activeSourceSet(binding);
     if (branches === "active") {
       if (!binding || !binding.ready) return { entries: [], next: null, error: { code: "incomplete_coverage", message: "summary lineage is not ready" } };
-      if (active && node.sources.some((source) => !active.has(sourceKey(node.sessionId, source.entryId, source.revision)))) {
+      if (active && node.sources.some((source) => !active.has(sourceKey(source.entryId, source.contentHash)))) {
         return { entries: [], next: null, error: { code: "stale_pointer", message: "summary is outside the active branch" } };
       }
     }
@@ -665,7 +665,7 @@ var LcmMemoryAdapter = class {
     const reachable = [];
     let unavailable = 0;
     for (const source of node.sources) {
-      const key = sourceKey(node.sessionId, source.entryId, source.revision);
+      const key = sourceKey(source.entryId, source.contentHash);
       if (branches === "active" && active && !active.has(key)) {
         unavailable += 1;
         continue;
@@ -714,7 +714,7 @@ var LcmMemoryAdapter = class {
       }
       if (branches === "active") {
         const active = activeSourceSet(activeBinding(this.options, child.sessionId));
-        if (active && child.sources.some((source) => !active.has(sourceKey(child.sessionId, source.entryId, source.revision)))) {
+        if (active && child.sources.some((source) => !active.has(sourceKey(source.entryId, source.contentHash)))) {
           unavailable += 1;
           continue;
         }
@@ -743,7 +743,7 @@ var LcmMemoryAdapter = class {
     const entry = this.options.ledger.readRawEntry(sessionId, entryId, revision);
     if (!entry) return { entries: [], next: null, error: { code: "stale_pointer", message: "raw source is unavailable" } };
     const binding = activeBinding(this.options, sessionId);
-    const allowed = activeAllowed(branches, binding, sourceKey(sessionId, entryId, revision));
+    const allowed = activeAllowed(branches, binding, sourceKey(entryId, entry.contentHash));
     if (!allowed.allowed) return { entries: [], next: null, error: { code: allowed.reason === "source_off_active_branch" ? "stale_pointer" : "incomplete_coverage", message: allowed.reason ?? "raw lineage is unavailable" } };
     const payload = JSON.parse(entry.payloadJson);
     const sourceHash = hashLcmPayload(payload);
@@ -2470,4 +2470,4 @@ export {
   normalizeMemoryArgs,
   MemoryProvider
 };
-//# sourceMappingURL=chunk-YD4MAZMT.js.map
+//# sourceMappingURL=chunk-I3XEFTXH.js.map

package/dist/chunks/chunk-I3XEFTXH.js.map

@@ -0,0 +1,7 @@
+{
+  "version": 3,
+  "sources": ["../../src/providers/memory-provider.ts", "../../src/memory/context.ts", "../../src/memory/lcm-adapter.ts", "../../src/providers/arg-normalization.ts"],
+  "sourcesContent": ["import type {\n  FabricActionDescriptor,\n  FabricInvocationContext,\n  FabricProvider,\n  FabricProviderListRequest,\n} from \"../protocol.js\";\nimport type { FabricMemoryConfig } from \"../config.js\";\nimport fs from \"node:fs\";\nimport path from \"node:path\";\nimport {\n  AmbiguousSessionError,\n  InvalidProjectScopeError,\n  enumerateAllSessions,\n  overrideSessionDir,\n  PROJECT_SESSION_DIR_MISSING,\n  resolveScope,\n  resolveSessionTarget,\n  type ResolveScopeInput,\n  type ScopeResolution,\n  type SessionRef,\n} from \"../memory/discovery.js\";\nimport {\n  presentRecall,\n  RECALL_DEFAULT_PAGE_SIZE,\n  RECALL_DEFAULT_SNIPPET_CHARS,\n  RECALL_MAX_PAGE_SIZE,\n  RECALL_MAX_RESPONSE_CHARS,\n  RECALL_MAX_SNIPPET_CHARS,\n  type MemoryRecallCallArgs,\n} from \"../memory/context.js\";\nimport type { LiveSessionBranch, MemoryBranches } from \"../memory/lineage.js\";\nimport { reconstructSessionLineage } from \"../memory/lineage.js\";\nimport {\n  expandSessionEntriesChecked,\n  normalizeSession,\n  type ExpandedSessionEntry,\n  type ExpandSessionSelection,\n  type NormalizedEntry,\n} from \"../memory/normalize.js\";\nimport {\n  DEFAULT_HOT_SESSIONS,\n  fingerprintSource,\n  loadTieredIndex,\n  type EntryRange,\n  type MemoryCoverage,\n  type MemoryIndexOptions,\n  type SearchFilters,\n} from \"../memory/index.js\";\nimport {\n  DEFAULT_REGEX_MAX_HAYSTACK_BYTES,\n  DEFAULT_REGEX_MAX_HAYSTACK_TERMS,\n  DEFAULT_REGEX_MAX_PATTERN_BYTES,\n  DEFAULT_REGEX_TIMEOUT_MS,\n  searchMemoryIndex,\n  type SearchResult,\n} from \"../memory/search.js\";\nimport type { MemoryQueryMatch, MemoryQueryMode } from \"../memory/tokenize.js\";\nimport { LcmMemoryAdapter, type LcmBranchBinding, type LcmMemoryLedger, type LcmSummaryReader } from \"../memory/lcm-adapter.js\";\nimport { actionArgNormalizer, type ArgNormalizationSpec } from \"./arg-normalization.js\";\n\nconst EXPAND_DEFAULT_MAX_CHARS = 20_000;\nconst EXPAND_MAX_CHARS = 24_000;\nconst EXPAND_DEFAULT_MAX_ENTRIES = 10;\nconst EXPAND_MAX_ENTRIES = 20;\nconst EXPAND_MAX_CONTEXT = 100;\nconst EXPAND_MAX_EXACT_SELECTORS = 100;\nconst SESSIONS_MAX = 500;\nconst CONTINUATION_CACHE_TTL_MS = 5 * 60_000;\nconst EXPANSION_SNAPSHOT_LIMIT = 2;\nconst EXPANSION_SELECTION_LIMIT = 16;\n\ninterface SourceIdentity {\n  device: bigint;\n  inode: bigint;\n  size: bigint;\n  modifiedAt: bigint;\n  changedAt: bigint;\n}\n\ninterface SourceObservation {\n  file: string;\n  identity: SourceIdentity;\n  liveBranchSignature: string | null;\n}\n\ntype LiveBranchResolver = MemoryIndexOptions[\"liveBranchForFile\"];\n\ntype CanonicalExpansionSelection = ExpandSessionSelection & {\n  before?: number;\n  after?: number;\n};\n\ninterface ResolvedExpansionSelection {\n  entries: ExpandedSessionEntry[];\n  canonical: CanonicalExpansionSelection;\n  anchorIndex: number | null;\n}\n\ninterface ExpansionSnapshot {\n  file: string;\n  branches: MemoryBranches;\n  sourceHash: string;\n  lineageFingerprint: string;\n  observation: SourceObservation;\n  entries: readonly NormalizedEntry[];\n  selections: Map<string, ResolvedExpansionSelection>;\n  touchedAt: number;\n}\n\ninterface RecallContinuationCache {\n  key: string;\n  result: SearchResult;\n  coverage: MemoryCoverage;\n  requestArgs: MemoryRecallCallArgs;\n  observations: SourceObservation[];\n  touchedAt: number;\n}\n\nconst sourceIdentity = (file: string): SourceIdentity | null => {\n  try {\n    const stat = fs.statSync(file, { bigint: true });\n    if (!stat.isFile()) return null;\n    return {\n      device: stat.dev,\n      inode: stat.ino,\n      size: stat.size,\n      modifiedAt: stat.mtimeNs,\n      changedAt: stat.ctimeNs,\n    };\n  } catch {\n    return null;\n  }\n};\n\nconst sameSourceIdentity = (left: SourceIdentity, right: SourceIdentity): boolean =>\n  left.device === right.device &&\n  left.inode === right.inode &&\n  left.size === right.size &&\n  left.modifiedAt === right.modifiedAt &&\n  left.changedAt === right.changedAt;\n\nconst liveBranchSignature = (branch: LiveSessionBranch | undefined): string | null =>\n  branch ? `${branch.leafId ?? \"\"}\\0${branch.entries.length}` : null;\n\nconst observeSource = (\n  file: string,\n  branches: MemoryBranches,\n  liveBranch: LiveSessionBranch | undefined,\n): SourceObservation | null => {\n  const identity = sourceIdentity(file);\n  if (!identity) return null;\n  return {\n    file: path.resolve(file),\n    identity,\n    liveBranchSignature: branches === \"active\" ? liveBranchSignature(liveBranch) : null,\n  };\n};\n\nconst observeSources = (\n  refs: readonly SessionRef[],\n  branches: MemoryBranches,\n  liveResolver: LiveBranchResolver,\n): SourceObservation[] | null => {\n  const observations: SourceObservation[] = [];\n  for (const ref of refs) {\n    const liveBranch = branches === \"active\" ? liveResolver?.(ref.file) : undefined;\n    const observation = observeSource(ref.file, branches, liveBranch);\n    if (!observation) return null;\n    observations.push(observation);\n  }\n  return observations;\n};\n\nconst sameSourceObservation = (left: SourceObservation, right: SourceObservation): boolean =>\n  left.file === right.file &&\n  sameSourceIdentity(left.identity, right.identity) &&\n  left.liveBranchSignature === right.liveBranchSignature;\n\nconst sameSourceObservations = (\n  left: readonly SourceObservation[],\n  right: readonly SourceObservation[],\n): boolean => left.length === right.length && left.every((item, index) =>\n  sameSourceObservation(item, right[index]!)\n);\n\nconst recallContinuationKey = (args: MemoryRecallCallArgs): string => JSON.stringify([\n  args.query ?? null,\n  args.queryMode ?? \"literal\",\n  args.queryMatch ?? null,\n  args.expectedSourceHash ?? null,\n  args.expectedLineageFingerprint ?? null,\n  args.branches ?? \"active\",\n  args.scope ?? \"session\",\n  args.pageSize ?? RECALL_DEFAULT_PAGE_SIZE,\n  args.snippetChars ?? RECALL_DEFAULT_SNIPPET_CHARS,\n  args.role ?? null,\n  args.tool ?? null,\n  args.ref ?? null,\n  args.provider ?? null,\n  args.action ?? null,\n  args.outcome ?? null,\n  args.since ?? null,\n  args.until ?? null,\n  args.entryRange ? [args.entryRange.first, args.entryRange.last] : null,\n]);\n\nconst expansionSnapshotKey = (file: string, branches: MemoryBranches): string =>\n  `${path.resolve(file)}\\0${branches}`;\n\nconst expansionSelectionKey = (selection: CanonicalExpansionSelection): string => JSON.stringify([\n  selection.indices ?? null,\n  selection.entryIds ?? null,\n  selection.operationAddresses ?? null,\n  selection.entryRange ? [selection.entryRange.first, selection.entryRange.last] : null,\n  selection.before ?? 0,\n  selection.after ?? 0,\n]);\n\nconst errorOutputSchema = {\n  type: \"object\",\n  properties: {\n    code: { type: \"string\" },\n    message: { type: \"string\" },\n  },\n  required: [\"code\", \"message\"],\n};\n\nconst coverageOutputSchema = {\n  type: \"object\",\n  properties: {\n    complete: { type: \"boolean\" },\n    indexedSessions: { type: \"number\" },\n    eligibleSessions: { type: \"number\" },\n    staleSessions: { type: \"number\" },\n    incompleteSessions: { type: \"number\" },\n    reasons: {\n      type: \"array\",\n      items: { type: \"string\" },\n      description: \"Stable machine-readable incompleteness codes; empty when complete is true.\",\n    },\n    error: errorOutputSchema,\n  },\n  required: [\n    \"complete\",\n    \"indexedSessions\",\n    \"eligibleSessions\",\n    \"staleSessions\",\n    \"incompleteSessions\",\n    \"reasons\",\n  ],\n};\n\nconst callOutputSchema = (ref: \"memory.recall\" | \"memory.expand\") => ({\n  type: \"object\",\n  properties: {\n    ref: { const: ref },\n    args: { type: \"object\" },\n  },\n  required: [\"ref\", \"args\"],\n});\n\nconst recallEntryOutputSchema = {\n  type: \"object\",\n  properties: {\n    kind: { const: \"entry\" },\n    sessionId: { type: \"string\" },\n    tier: { type: \"string\", enum: [\"hot\", \"cold\"] },\n    index: { type: \"number\" },\n    entryId: { type: [\"string\", \"null\"] },\n    parentId: { type: [\"string\", \"null\"] },\n    operationAddress: { type: [\"string\", \"null\"] },\n    type: { type: \"string\" },\n    role: { type: [\"string\", \"null\"] },\n    tool: { type: [\"string\", \"null\"] },\n    ref: { type: [\"string\", \"null\"] },\n    provider: { type: [\"string\", \"null\"] },\n    action: { type: [\"string\", \"null\"] },\n    timestamp: { type: [\"number\", \"null\"] },\n    isError: { type: \"boolean\" },\n    outcome: { type: \"string\", enum: [\"succeeded\", \"failed\", \"aborted\", \"timed_out\"] },\n    score: { type: \"number\" },\n    snippet: { type: \"string\" },\n    truncated: { type: \"boolean\" },\n    follow: callOutputSchema(\"memory.expand\"),\n  },\n  required: [\n    \"kind\",\n    \"sessionId\",\n    \"tier\",\n    \"index\",\n    \"entryId\",\n    \"parentId\",\n    \"operationAddress\",\n    \"type\",\n    \"role\",\n    \"tool\",\n    \"ref\",\n    \"provider\",\n    \"action\",\n    \"timestamp\",\n    \"isError\",\n    \"score\",\n    \"snippet\",\n    \"truncated\",\n    \"follow\",\n  ],\n};\n\nconst recallSessionOutputSchema = {\n  type: \"object\",\n  properties: {\n    kind: { const: \"session\" },\n    sessionId: { type: \"string\" },\n    tier: { const: \"cold\" },\n    cwd: { type: \"string\" },\n    lastTimestamp: { type: [\"number\", \"null\"] },\n    score: { type: \"number\" },\n    matchedTerms: { type: \"number\" },\n    matchedStructuralEntries: { type: \"number\" },\n    follow: callOutputSchema(\"memory.recall\"),\n  },\n  required: [\n    \"kind\",\n    \"sessionId\",\n    \"tier\",\n    \"cwd\",\n    \"lastTimestamp\",\n    \"score\",\n    \"matchedTerms\",\n    \"matchedStructuralEntries\",\n    \"follow\",\n  ],\n};\n\nconst lcmRecallOutputSchema: Record<string, unknown> = {\n  type: \"object\",\n  properties: {\n    kind: { type: \"string\", enum: [\"lcm.raw\", \"lcm.summary\"] },\n    sessionId: { type: \"string\" },\n    score: { type: \"number\" },\n    snippet: { type: \"string\" },\n    truncated: { type: \"boolean\" },\n    source: { type: \"object\" },\n    follow: callOutputSchema(\"memory.expand\"),\n  },\n  required: [\"kind\", \"sessionId\", \"score\", \"snippet\", \"truncated\", \"source\", \"follow\"],\n};\n\nconst recallOutputSchema: Record<string, unknown> = {\n  type: \"object\",\n  description: \"Bounded ranked memory hits with uniform follow and pagination calls.\",\n  properties: {\n    total: { type: \"number\" },\n    hits: {\n      type: \"array\",\n      description: \"Call tools.call(hit.follow) to expand an entry or resolve a cold session.\",\n      items: { oneOf: [recallEntryOutputSchema, recallSessionOutputSchema, lcmRecallOutputSchema] },\n    },\n    next: {\n      oneOf: [callOutputSchema(\"memory.recall\"), { type: \"null\" }],\n      description: \"When non-null, call tools.call(next).\",\n    },\n    coverage: coverageOutputSchema,\n    error: errorOutputSchema,\n  },\n  required: [\"total\", \"hits\", \"next\", \"coverage\"],\n};\n\nconst expandOutputSchema: Record<string, unknown> = {\n  type: \"object\",\n  description: \"Integrity-bound session entries returned as lossless bounded text chunks.\",\n  properties: {\n    session: { type: \"string\" },\n    sourceHash: { type: \"string\" },\n    branches: { type: \"string\", enum: [\"active\", \"all\"] },\n    lineageFingerprint: { type: [\"string\", \"null\"] },\n    node: {\n      type: \"object\",\n      description: \"The expanded LCM summary node itself: its own text, kind, sourceHash, children, and sources.\",\n    },\n    total: { type: \"number\" },\n    entryCount: { type: \"number\" },\n    entries: {\n      type: \"array\",\n      items: {\n        type: \"object\",\n        properties: {\n          index: { type: \"number\" },\n          entryId: { type: [\"string\", \"null\"] },\n          parentId: { type: [\"string\", \"null\"] },\n          type: { type: [\"string\", \"null\"] },\n          role: { type: [\"string\", \"null\"] },\n          timestamp: { type: [\"number\", \"null\"] },\n          isError: { type: \"boolean\" },\n          text: { type: \"string\" },\n          textRange: {\n            type: \"object\",\n            properties: {\n              start: { type: \"number\" },\n              end: { type: \"number\" },\n              total: { type: \"number\" },\n              complete: { type: \"boolean\" },\n            },\n            required: [\"start\", \"end\", \"total\", \"complete\"],\n          },\n          anchor: { type: \"boolean\" },\n          parentEntryId: { type: [\"string\", \"null\"] },\n          operationAddress: { type: [\"string\", \"null\"] },\n          tool: { type: [\"string\", \"null\"] },\n          ref: { type: [\"string\", \"null\"] },\n          provider: { type: [\"string\", \"null\"] },\n          action: { type: [\"string\", \"null\"] },\n          outcome: { type: \"string\", enum: [\"succeeded\", \"failed\", \"aborted\", \"timed_out\"] },\n          filesTouched: { type: \"array\", items: { type: [\"string\", \"null\"] } },\n          operation: { type: \"object\" },\n          branchFact: { type: \"object\" },\n          structuredTruncated: { type: \"boolean\" },\n          factAddress: { type: [\"string\", \"null\"] },\n          carrierEntryId: { type: [\"string\", \"null\"] },\n          carrierParentId: { type: [\"string\", \"null\"] },\n          carrierFromId: { type: [\"string\", \"null\"] },\n          address: { type: \"string\" },\n          sourceHash: { type: \"string\" },\n          follow: callOutputSchema(\"memory.expand\"),\n        },\n        required: [\"index\", \"entryId\", \"parentId\", \"type\", \"role\", \"timestamp\", \"isError\", \"text\", \"textRange\"],\n      },\n    },\n    next: {\n      oneOf: [callOutputSchema(\"memory.expand\"), { type: \"null\" }],\n      description: \"When non-null, call tools.call(next).\",\n    },\n    error: errorOutputSchema,\n  },\n  required: [\"entries\"],\n};\n\nconst sessionsOutputSchema: Record<string, unknown> = {\n  type: \"object\",\n  properties: {\n    scope: { type: \"string\" },\n    branches: { type: \"string\", enum: [\"active\", \"all\"] },\n    offset: { type: \"number\" },\n    total: { type: \"number\" },\n    truncated: { type: \"boolean\" },\n    sessions: {\n      type: \"array\",\n      items: {\n        type: \"object\",\n        properties: {\n          id: { type: \"string\" },\n          file: { type: \"string\" },\n          cwd: { type: \"string\" },\n          mtime: { type: \"number\" },\n          entryCount: { type: \"number\" },\n          tier: { type: \"string\", enum: [\"hot\", \"cold\"] },\n          branches: { type: \"string\", enum: [\"active\", \"all\"] },\n          lineageFingerprint: { type: [\"string\", \"null\"] },\n        },\n        required: [\n          \"id\",\n          \"file\",\n          \"cwd\",\n          \"mtime\",\n          \"entryCount\",\n          \"tier\",\n          \"branches\",\n          \"lineageFingerprint\",\n        ],\n      },\n    },\n    error: errorOutputSchema,\n  },\n};\n\nconst descriptors: FabricActionDescriptor[] = [\n  {\n    name: \"recall\",\n    description:\n      \"Search session memory as bounded ranked snippets. Literal queries rank any matching term by default; queryMatch all narrows to co-located terms. Call tools.call(hit.follow) for either an exact entry or a cold-session candidate, and tools.call(next) to continue.\",\n    inputSchema: {\n      type: \"object\",\n      properties: {\n        query: { type: \"string\", maxLength: 4096 },\n        queryMode: {\n          type: \"string\",\n          enum: [\"literal\", \"phrase\", \"regex\"],\n          default: \"literal\",\n          description: \"Canonical tokens (default), one case-insensitive exact phrase, or explicitly bounded regex.\",\n        },\n        queryMatch: {\n          type: \"string\",\n          enum: [\"all\", \"any\"],\n          default: \"any\",\n          description: \"For literal mode, accept any term (default) or require all terms in one hot entry.\",\n        },\n        expectedSourceHash: {\n          type: \"string\",\n          description: \"SHA-256 from a prior pointer; stale sources are refused.\",\n        },\n        expectedLineageFingerprint: {\n          type: \"string\",\n          description: \"Active-lineage fingerprint from a prior pointer; changed leaves are refused.\",\n        },\n        branches: {\n          type: \"string\",\n          enum: [\"active\", \"all\"],\n          description: \"Search the active parent-linked path (default) or every branch.\",\n        },\n        scope: {\n          type: \"string\",\n          description:\n            \"session | project | project:<path> | global | session:<id-or-path>. Defaults to session.\",\n        },\n        offset: {\n          type: \"number\",\n          minimum: 0,\n          description: \"Exact ranked-hit offset, normally copied from next.args.\",\n        },\n        pageSize: { type: \"number\", minimum: 1, maximum: RECALL_MAX_PAGE_SIZE, default: RECALL_DEFAULT_PAGE_SIZE },\n        snippetChars: {\n          type: \"number\",\n          minimum: 80,\n          maximum: RECALL_MAX_SNIPPET_CHARS,\n          default: RECALL_DEFAULT_SNIPPET_CHARS,\n          description: \"Maximum indexed-text characters shown per hit; full text remains in memory.expand.\",\n        },\n        role: {\n          type: \"string\",\n          enum: [\n            \"assistant\",\n            \"bashExecution\",\n            \"branchCustomMessage\",\n            \"branchSummary\",\n            \"branchUser\",\n            \"compaction\",\n            \"compactionSummary\",\n            \"custom\",\n            \"fabricOperation\",\n            \"fabricPhase\",\n            \"fabricRun\",\n            \"toolResult\",\n            \"user\",\n          ],\n          description:\n            \"Exact normalized entry role to filter by: the closed set the session normalizer can produce.\",\n        },\n        tool: { type: \"string\" },\n        ref: {\n          type: \"string\",\n          minLength: 1,\n          description: \"Exact persisted Fabric action ref, such as omp.grep. This is structural selection, not lexical expansion.\",\n        },\n        provider: {\n          type: \"string\",\n          minLength: 1,\n          description: \"Exact persisted Fabric provider identity.\",\n        },\n        action: {\n          type: \"string\",\n          minLength: 1,\n          description: \"Exact persisted Fabric action name.\",\n        },\n        outcome: {\n          type: \"string\",\n          enum: [\"succeeded\", \"failed\", \"aborted\", \"timed_out\"],\n          description: \"Exact persisted Fabric execution outcome.\",\n        },\n        since: { type: \"number\" },\n        until: { type: \"number\" },\n        entryRange: {\n          type: \"object\",\n          description:\n            \"Inclusive normalized-entry range for an explicit session:<id> resolution.\",\n          properties: {\n            first: { type: \"number\", minimum: 0 },\n            last: { type: \"number\", minimum: 0 },\n          },\n          required: [\"first\", \"last\"],\n          additionalProperties: false,\n        },\n      },\n      additionalProperties: false,\n    },\n    outputSchema: recallOutputSchema,\n    risk: \"read\",\n    namespace: \"memory\",\n  },\n  {\n    name: \"expand\",\n    description:\n      \"Read exact normalized session entries and nearby context as bounded lossless chunks. An lcm.summary: address returns the entries that summary was built from, each addressed for further expansion. Call tools.call(next) to continue, or use guest-side memory.walk(args, visitor) to traverse complete reassembled entries.\",\n    inputSchema: {\n      type: \"object\",\n      properties: {\n        session: { type: \"string\", description: \"Exact session file path or unambiguous id.\" },\n        expectedSourceHash: {\n          type: \"string\",\n          description: \"SHA-256 from a prior pointer; stale sources are refused.\",\n        },\n        expectedLineageFingerprint: {\n          type: \"string\",\n          description: \"Active-lineage fingerprint from a prior pointer; changed leaves are refused.\",\n        },\n        branches: {\n          type: \"string\",\n          enum: [\"active\", \"all\"],\n          description: \"Expand on the active parent-linked path (default) or across every branch.\",\n        },\n        indices: { type: \"array\", maxItems: EXPAND_MAX_EXACT_SELECTORS, items: { type: \"number\", minimum: 0 } },\n        entryIds: { type: \"array\", maxItems: EXPAND_MAX_EXACT_SELECTORS, items: { type: \"string\", maxLength: 512 } },\n        operationAddresses: { type: \"array\", maxItems: EXPAND_MAX_EXACT_SELECTORS, items: { type: \"string\", maxLength: 512 } },\n        entryRange: {\n          type: \"object\",\n          properties: {\n            first: { type: \"number\", minimum: 0 },\n            last: { type: \"number\", minimum: 0 },\n          },\n          required: [\"first\", \"last\"],\n          additionalProperties: false,\n        },\n        before: {\n          type: \"number\",\n          minimum: 0,\n          maximum: EXPAND_MAX_CONTEXT,\n          default: 0,\n          description: \"Entries before one exact selected anchor.\",\n        },\n        after: {\n          type: \"number\",\n          minimum: 0,\n          maximum: EXPAND_MAX_CONTEXT,\n          default: 0,\n          description: \"Entries after one exact selected anchor.\",\n        },\n        entryOffset: {\n          type: \"number\",\n          minimum: 0,\n          description: \"Continuation offset within the resolved selection; copy from next.args.\",\n        },\n        textOffset: {\n          type: \"number\",\n          minimum: 0,\n          description: \"Continuation offset within the first returned entry; copy from next.args.\",\n        },\n        maxChars: {\n          type: \"number\",\n          minimum: 256,\n          maximum: EXPAND_MAX_CHARS,\n          default: EXPAND_DEFAULT_MAX_CHARS,\n          description: \"Total entry-text characters returned in this chunk.\",\n        },\n        maxEntries: {\n          type: \"number\",\n          minimum: 1,\n          maximum: EXPAND_MAX_ENTRIES,\n          default: EXPAND_DEFAULT_MAX_ENTRIES,\n          description: \"Maximum complete or partial entries returned in this chunk.\",\n        },\n      },\n      required: [\"session\"],\n      additionalProperties: false,\n    },\n    outputSchema: expandOutputSchema,\n    risk: \"read\",\n    namespace: \"memory\",\n  },\n  {\n    name: \"sessions\",\n    description: \"List known sessions in scope with id, file, cwd, mtime, entry count, and hot/cold tier.\",\n    inputSchema: {\n      type: \"object\",\n      properties: {\n        scope: {\n          type: \"string\",\n          description:\n            \"session | project | project:<path> | global | session:<id-or-path>. Defaults to session.\",\n        },\n        branches: {\n          type: \"string\",\n          enum: [\"active\", \"all\"],\n          description: \"Count the active parent-linked path (default) or every branch.\",\n        },\n        limit: {\n          type: \"number\",\n          minimum: 1,\n          description: \"Maximum sessions returned; capped at the internal session ceiling.\",\n        },\n        offset: {\n          type: \"number\",\n          minimum: 0,\n          description: \"Number of sessions to skip; advance it by limit to page through total.\",\n        },\n      },\n      additionalProperties: false,\n    },\n    outputSchema: sessionsOutputSchema,\n    risk: \"read\",\n    namespace: \"memory\",\n  },\n];\n\n// Value spellings models reliably substitute for the documented memory scopes,\n// e.g. scope \"cwd\" for \"project\". Same discipline as the key aliases below:\n// identical intent only. Unknown scopes still fall through to resolveScope's\n// default \"session\" handling.\nconst MEMORY_SCOPE_VALUE_ALIASES: Record<string, string> = {\n  cwd: \"project\",\n  repo: \"project\",\n  directory: \"project\",\n  folder: \"project\",\n  all: \"global\",\n  current: \"session\",\n};\n\nconst MEMORY_ARG_NORMALIZATION: Record<string, ArgNormalizationSpec> = {\n  recall: { values: { scope: MEMORY_SCOPE_VALUE_ALIASES } },\n  sessions: { values: { scope: MEMORY_SCOPE_VALUE_ALIASES } },\n};\n\n// Argument repair derives from the action schemas plus the shared synonym\n// lexicon; only scope value spellings stay table-bound because the schema\n// spells scope as a free string rather than an enum.\nexport const normalizeMemoryArgs = actionArgNormalizer(\n  () => descriptors,\n  MEMORY_ARG_NORMALIZATION,\n);\n\nexport interface MemoryProviderContext {\n  agentDir: string;\n  cwd: string;\n  config: FabricMemoryConfig;\n  sessionId?: string;\n  sessionFile?: string;\n  getLiveBranch?: () => LiveSessionBranch;\n  lcm?: {\n    ledger: LcmMemoryLedger;\n    summaries: LcmSummaryReader;\n    projectKey?: string;\n    currentSessionId?: string;\n    branchForSession?: (sessionId: string) => LcmBranchBinding | undefined;\n  };\n}\n\nconst parseBranches = (value: unknown, action: string): MemoryBranches => {\n  if (value === undefined) return \"active\";\n  if (value === \"active\" || value === \"all\") return value;\n  throw new Error(`${action} branches must be \"active\" or \"all\"`);\n};\n\nconst parseQueryMode = (value: unknown, action: string): MemoryQueryMode => {\n  if (value === undefined) return \"literal\";\n  if (value === \"literal\" || value === \"phrase\" || value === \"regex\") return value;\n  throw new Error(`${action} queryMode must be \"literal\", \"phrase\", or \"regex\"`);\n};\n\nconst parseQueryMatch = (value: unknown, mode: MemoryQueryMode, action: string): MemoryQueryMatch => {\n  if (value === undefined) return \"any\";\n  if (value !== \"all\" && value !== \"any\") throw new Error(`${action} queryMatch must be \"all\" or \"any\"`);\n  if (mode !== \"literal\") throw new Error(`${action} queryMatch is only valid with literal queryMode`);\n  return value;\n};\n\nconst resolveIndexOptions = (\n  config: FabricMemoryConfig,\n  agentDir: string,\n  branches: MemoryBranches,\n  liveBranchForFile?: MemoryIndexOptions[\"liveBranchForFile\"],\n): MemoryIndexOptions => ({\n  indexDir: config.indexDir ?? `${agentDir}/fabric/memory-index`,\n  maxEntryChars: config.maxEntryChars,\n  branches,\n  indexThinking: config.indexThinking ?? false,\n  indexToolOutput: config.indexToolOutput ?? true,\n  ...(liveBranchForFile ? { liveBranchForFile } : {}),\n  hotSessions: config.hotSessions ?? DEFAULT_HOT_SESSIONS,\n  digestTerms: config.digestTerms ?? 200,\n  ...(config.maxColdVocabularyBytes === undefined\n    ? {} : { maxColdVocabularyBytes: config.maxColdVocabularyBytes }),\n  ...(config.maxColdCacheBytes === undefined ? {} : { maxColdCacheBytes: config.maxColdCacheBytes }),\n  ...(config.maxSyncSessions === undefined ? {} : { maxSyncSessions: config.maxSyncSessions }),\n  ...(config.maxSyncSourceBytes === undefined ? {} : { maxSyncSourceBytes: config.maxSyncSourceBytes }),\n  ...(config.maxCacheCleanupFiles === undefined\n    ? {} : { maxCacheCleanupFiles: config.maxCacheCleanupFiles }),\n});\n\nconst resolveTierRefs = (refs: SessionRef[], context: MemoryProviderContext): SessionRef[] => {\n  const all = enumerateAllSessions(\n    context.agentDir,\n    Number.MAX_SAFE_INTEGER,\n    overrideSessionDir(context.sessionFile),\n  );\n  const known = new Set(all.map((ref) => ref.file));\n  for (const ref of refs) {\n    if (!known.has(ref.file)) all.push(ref);\n  }\n  return all;\n};\n\nconst resolveRefs = (\n  scope: string | undefined,\n  context: MemoryProviderContext,\n  boundedBrowse: boolean,\n): ScopeResolution => {\n  const effectiveScope = scope ?? \"session\";\n  const input: ResolveScopeInput = {\n    agentDir: context.agentDir,\n    cwd: context.cwd,\n    scope: effectiveScope,\n    maxSessions: boundedBrowse ? context.config.maxSessions : Number.MAX_SAFE_INTEGER,\n  };\n  if (context.sessionId) input.sessionId = context.sessionId;\n  if (context.sessionFile) input.sessionFile = context.sessionFile;\n  return resolveScope(input);\n};\n\nconst liveBranchResolver = (\n  context: MemoryProviderContext,\n): MemoryIndexOptions[\"liveBranchForFile\"] | undefined => {\n  if (!context.sessionFile || !context.getLiveBranch) return undefined;\n  const current = path.resolve(context.sessionFile);\n  return (sessionFile) => path.resolve(sessionFile) === current\n    ? context.getLiveBranch?.()\n    : undefined;\n};\n\nconst stalePointerError = (\n  sessionFile: string,\n  expectedSourceHash: string | undefined,\n  actualSourceHash: string,\n  expectedLineageFingerprint?: string,\n  actualLineageFingerprint?: string,\n) => ({\n  code: \"stale_pointer\",\n  message: expectedLineageFingerprint !== undefined &&\n    expectedLineageFingerprint !== actualLineageFingerprint\n    ? \"Session active lineage changed after the pointer was issued.\"\n    : \"Session source changed after the pointer was issued.\",\n  sessionFile,\n  ...(expectedSourceHash === undefined ? {} : { expectedSourceHash }),\n  actualSourceHash,\n  ...(expectedLineageFingerprint === undefined ? {} : { expectedLineageFingerprint }),\n  ...(actualLineageFingerprint === undefined ? {} : { actualLineageFingerprint }),\n});\n\nconst addressError = (message: string, entryCount?: number) => ({\n  code: \"index_out_of_bounds\",\n  message,\n  ...(entryCount === undefined ? {} : { entryCount }),\n});\n\nconst unresolvedScopeError = (resolution: ScopeResolution) => ({\n  code: resolution.reasons[0] ?? PROJECT_SESSION_DIR_MISSING,\n  message:\n    \"No session directory exists for this scope, so an empty result is unverified rather than an empty corpus.\",\n  candidateDirectories: resolution.candidateDirs,\n});\n\nconst recallFailure = (error: { code: string; message: string; [key: string]: unknown }) => ({\n  total: 0,\n  hits: [],\n  next: null,\n  coverage: {\n    complete: false,\n    indexedSessions: 0,\n    eligibleSessions: 0,\n    staleSessions: 0,\n    incompleteSessions: 0,\n    reasons: [error.code],\n  },\n  error,\n});\n\nexport class MemoryProvider implements FabricProvider {\n  readonly name = \"memory\";\n  readonly description =\n    \"Cross-session memory: a search engine over every OMP session timeline on this machine\";\n\n  private recallContinuation: RecallContinuationCache | undefined;\n  private lcmAdapter: { source: object; adapter: LcmMemoryAdapter } | undefined;\n  private readonly expansionSnapshots = new Map<string, ExpansionSnapshot>();\n\n  constructor(private readonly context: MemoryProviderContext) {}\n\n  private lcmMemoryAdapter(source: NonNullable<MemoryProviderContext[\"lcm\"]>): LcmMemoryAdapter {\n    if (this.lcmAdapter?.source !== source) {\n      this.lcmAdapter = { source, adapter: new LcmMemoryAdapter(source) };\n    }\n    return this.lcmAdapter.adapter;\n  }\n\n  private cachedRecallContinuation(\n    key: string,\n    observations: SourceObservation[] | null,\n  ): RecallContinuationCache | undefined {\n    const cached = this.recallContinuation;\n    if (!cached || cached.key !== key) return undefined;\n    if (\n      !observations ||\n      Date.now() - cached.touchedAt > CONTINUATION_CACHE_TTL_MS ||\n      !sameSourceObservations(cached.observations, observations)\n    ) {\n      this.recallContinuation = undefined;\n      return undefined;\n    }\n    cached.touchedAt = Date.now();\n    return cached;\n  }\n\n  private rememberRecallContinuation(cached: RecallContinuationCache): void {\n    this.recallContinuation = cached;\n  }\n\n  private forgetRecallContinuation(cached: RecallContinuationCache): void {\n    if (this.recallContinuation === cached) this.recallContinuation = undefined;\n  }\n\n  private cachedExpansionSnapshot(\n    file: string,\n    branches: MemoryBranches,\n    observation: SourceObservation | null,\n  ): ExpansionSnapshot | undefined {\n    const key = expansionSnapshotKey(file, branches);\n    const cached = this.expansionSnapshots.get(key);\n    if (!cached) return undefined;\n    if (\n      !observation ||\n      Date.now() - cached.touchedAt > CONTINUATION_CACHE_TTL_MS ||\n      !sameSourceObservation(cached.observation, observation)\n    ) {\n      this.expansionSnapshots.delete(key);\n      return undefined;\n    }\n    cached.touchedAt = Date.now();\n    this.expansionSnapshots.delete(key);\n    this.expansionSnapshots.set(key, cached);\n    return cached;\n  }\n\n  private rememberExpansionSnapshot(snapshot: ExpansionSnapshot): void {\n    const key = expansionSnapshotKey(snapshot.file, snapshot.branches);\n    this.expansionSnapshots.delete(key);\n    this.expansionSnapshots.set(key, snapshot);\n    while (this.expansionSnapshots.size > EXPANSION_SNAPSHOT_LIMIT) {\n      const oldest = this.expansionSnapshots.keys().next().value;\n      if (oldest === undefined) break;\n      this.expansionSnapshots.delete(oldest);\n    }\n  }\n\n  private rememberExpansionSelection(\n    snapshot: ExpansionSnapshot,\n    keys: readonly string[],\n    selection: ResolvedExpansionSelection,\n  ): void {\n    for (const key of new Set(keys)) {\n      snapshot.selections.delete(key);\n      snapshot.selections.set(key, selection);\n    }\n    while (snapshot.selections.size > EXPANSION_SELECTION_LIMIT) {\n      const oldest = snapshot.selections.keys().next().value;\n      if (oldest === undefined) break;\n      snapshot.selections.delete(oldest);\n    }\n  }\n\n  private forgetExpansionSnapshot(snapshot: ExpansionSnapshot): void {\n    const key = expansionSnapshotKey(snapshot.file, snapshot.branches);\n    if (this.expansionSnapshots.get(key) === snapshot) this.expansionSnapshots.delete(key);\n  }\n\n  async list(\n    request: FabricProviderListRequest,\n    _context: FabricInvocationContext,\n  ): Promise<FabricActionDescriptor[]> {\n    const query = request.query?.toLowerCase();\n    return query\n      ? descriptors.filter((descriptor) =>\n          `${descriptor.name} ${descriptor.description}`.toLowerCase().includes(query),\n        )\n      : descriptors;\n  }\n\n  async describe(\n    actionName: string,\n    _context: FabricInvocationContext,\n  ): Promise<FabricActionDescriptor | undefined> {\n    return descriptors.find((descriptor) => descriptor.name === actionName);\n  }\n\n  prepareArguments(\n    actionName: string,\n    args: Record<string, unknown>,\n  ): Record<string, unknown> {\n    return normalizeMemoryArgs(actionName, args);\n  }\n\n  async invoke(\n    actionName: string,\n    args: Record<string, unknown>,\n    invocationContext: FabricInvocationContext,\n  ): Promise<unknown> {\n    try {\n      if (this.context.lcm && (actionName === \"recall\" || actionName === \"expand\")) {\n        const adapter = this.lcmMemoryAdapter(this.context.lcm);\n        if (actionName === \"expand\") return adapter.expand(args);\n        const queryMode = parseQueryMode(args.queryMode, \"memory.recall\");\n        const queryMatch = parseQueryMatch(args.queryMatch, queryMode, \"memory.recall\");\n        return adapter.recall({ ...args, queryMode, queryMatch });\n      }\n      switch (actionName) {\n        case \"recall\":\n          return await this.recall(args, invocationContext);\n        case \"expand\":\n          return await this.expand(args);\n        case \"sessions\":\n          return await this.sessions(args);\n        default:\n          throw new Error(`Unknown memory action: ${actionName}`);\n      }\n    } catch (error) {\n      const detail =\n        error instanceof AmbiguousSessionError\n          ? {\n              code: error.code,\n              message: error.message,\n              session: error.session,\n              candidates: error.candidates,\n            }\n          : error instanceof InvalidProjectScopeError\n            ? {\n                code: error.code,\n                message: error.message,\n                project: error.project,\n                projectPath: error.projectPath,\n                reason: error.reason,\n              }\n            : undefined;\n      if (detail) {\n        if (actionName === \"recall\") return recallFailure(detail);\n        if (actionName === \"expand\") return { entries: [], next: null, error: detail };\n        return { error: detail };\n      }\n      throw error;\n    }\n  }\n\n  private async recall(\n    args: Record<string, unknown>,\n    invocationContext: FabricInvocationContext,\n  ): Promise<unknown> {\n    const query = typeof args.query === \"string\" ? args.query : undefined;\n    const queryMode = parseQueryMode(args.queryMode, \"memory.recall\");\n    const queryMatch = parseQueryMatch(args.queryMatch, queryMode, \"memory.recall\");\n    const expectedSourceHash = typeof args.expectedSourceHash === \"string\"\n      ? args.expectedSourceHash\n      : undefined;\n    const expectedLineageFingerprint = typeof args.expectedLineageFingerprint === \"string\"\n      ? args.expectedLineageFingerprint\n      : undefined;\n    const branches = parseBranches(args.branches, \"memory.recall\");\n    const scope = typeof args.scope === \"string\" ? args.scope : undefined;\n    const role = typeof args.role === \"string\" ? args.role : undefined;\n    const tool = typeof args.tool === \"string\" ? args.tool : undefined;\n    const ref = typeof args.ref === \"string\" ? args.ref : undefined;\n    const provider = typeof args.provider === \"string\" ? args.provider : undefined;\n    const action = typeof args.action === \"string\" ? args.action : undefined;\n    const rawOutcome = args.outcome;\n    if (\n      rawOutcome !== undefined &&\n      rawOutcome !== \"succeeded\" &&\n      rawOutcome !== \"failed\" &&\n      rawOutcome !== \"aborted\" &&\n      rawOutcome !== \"timed_out\"\n    ) {\n      throw new Error(\"memory.recall outcome must be succeeded, failed, aborted, or timed_out\");\n    }\n    const outcome = rawOutcome as SearchFilters[\"outcome\"];\n    const since = typeof args.since === \"number\" ? args.since : undefined;\n    const until = typeof args.until === \"number\" ? args.until : undefined;\n    const offset = typeof args.offset === \"number\" && args.offset >= 0\n      ? Math.floor(args.offset)\n      : undefined;\n    const pageSize =\n      typeof args.pageSize === \"number\" && args.pageSize >= 1\n        ? Math.min(Math.floor(args.pageSize), RECALL_MAX_PAGE_SIZE)\n        : RECALL_DEFAULT_PAGE_SIZE;\n    const snippetChars =\n      typeof args.snippetChars === \"number\" && args.snippetChars >= 80\n        ? Math.min(Math.floor(args.snippetChars), RECALL_MAX_SNIPPET_CHARS)\n        : RECALL_DEFAULT_SNIPPET_CHARS;\n\n    const resolution = resolveRefs(scope, this.context, false);\n    const refs = resolution.refs;\n    const liveResolver = liveBranchResolver(this.context);\n    const options = resolveIndexOptions(\n      this.context.config,\n      this.context.agentDir,\n      branches,\n      liveResolver,\n    );\n    const hydrate = scope?.trim().startsWith(\"session:\") ?? false;\n    if ((expectedSourceHash !== undefined || expectedLineageFingerprint !== undefined) && !hydrate) {\n      throw new Error(\"memory.recall integrity expectations require scope session:<id-or-path>\");\n    }\n\n    const rawRange = args.entryRange;\n    const entryRange = rawRange && typeof rawRange === \"object\" && !Array.isArray(rawRange)\n      ? rawRange as Record<string, unknown>\n      : undefined;\n    const first = entryRange?.first;\n    const last = entryRange?.last;\n    if ((first === undefined) !== (last === undefined)) {\n      throw new Error(\"memory.recall entryRange requires both first and last\");\n    }\n    if ((first !== undefined || last !== undefined) && !hydrate) {\n      throw new Error(\"memory.recall entryRange requires scope session:<id-or-path>\");\n    }\n    if (first !== undefined && (\n      typeof first !== \"number\" ||\n      typeof last !== \"number\" ||\n      !Number.isSafeInteger(first) ||\n      !Number.isSafeInteger(last) ||\n      first < 0 ||\n      last < first\n    )) {\n      return recallFailure(addressError(\"Entry range requires safe integers with 0 <= first <= last.\"));\n    }\n    const selectedRange: EntryRange | undefined =\n      typeof first === \"number\" && typeof last === \"number\" ? { first, last } : undefined;\n    const filters: SearchFilters = {};\n    if (role) filters.role = role;\n    if (tool) filters.tool = tool;\n    if (ref) filters.ref = ref;\n    if (provider) filters.provider = provider;\n    if (action) filters.action = action;\n    if (outcome) filters.outcome = outcome;\n    if (since !== undefined) filters.since = since;\n    if (until !== undefined) filters.until = until;\n    const baseRequestArgs: MemoryRecallCallArgs = {\n      ...(query === undefined ? {} : { query }),\n      queryMode,\n      ...(queryMode === \"literal\" ? { queryMatch } : {}),\n      ...(expectedSourceHash ? { expectedSourceHash } : {}),\n      ...(expectedLineageFingerprint ? { expectedLineageFingerprint } : {}),\n      branches,\n      scope: scope ?? \"session\",\n      ...(offset === undefined ? {} : { offset }),\n      pageSize,\n      snippetChars,\n      ...(role ? { role } : {}),\n      ...(tool ? { tool } : {}),\n      ...(ref ? { ref } : {}),\n      ...(provider ? { provider } : {}),\n      ...(action ? { action } : {}),\n      ...(outcome ? { outcome } : {}),\n      ...(since !== undefined ? { since } : {}),\n      ...(until !== undefined ? { until } : {}),\n      ...(selectedRange ? { entryRange: selectedRange } : {}),\n    };\n    const updateProgress = (searchResult: SearchResult): void => {\n      invocationContext.update(\n        searchResult.matchMode === \"structural\"\n          ? `memory.recall: ${searchResult.matchedCount} structural matches`\n          : searchResult.matchMode === \"combined\"\n            ? `memory.recall: ${searchResult.matchedCount} filtered matches`\n            : query\n              ? `memory.recall: ${searchResult.matchedCount} matches`\n              : `memory.recall: ${searchResult.matchedCount} recent entries`,\n      );\n    };\n    const observationsBefore = observeSources(refs, branches, liveResolver);\n    const cached = offset === undefined\n      ? undefined\n      : this.cachedRecallContinuation(\n          recallContinuationKey(baseRequestArgs),\n          observationsBefore,\n        );\n    if (cached) {\n      const response = presentRecall({\n        result: cached.result,\n        ...(query === undefined ? {} : { query }),\n        queryMode,\n        coverage: cached.coverage,\n        ...(offset === undefined ? {} : { offset }),\n        pageSize,\n        snippetChars,\n        requestArgs: cached.requestArgs,\n      });\n      const observationsAfterCachedPage = observeSources(refs, branches, liveResolver);\n      if (\n        observationsBefore &&\n        observationsAfterCachedPage &&\n        sameSourceObservations(observationsBefore, observationsAfterCachedPage)\n      ) {\n        if (response.next === null) this.forgetRecallContinuation(cached);\n        updateProgress(cached.result);\n        return response;\n      }\n      this.forgetRecallContinuation(cached);\n    }\n\n    if (hydrate && refs[0]) {\n      const state = fingerprintSource(refs[0].file);\n      const lineage = reconstructSessionLineage(\n        refs[0].file,\n        branches,\n        liveResolver?.(refs[0].file),\n      );\n      const sourceChanged = expectedSourceHash !== undefined &&\n        state?.sourceHash !== expectedSourceHash;\n      const lineageChanged = expectedLineageFingerprint !== undefined &&\n        lineage.fingerprint !== expectedLineageFingerprint;\n      if (state && (sourceChanged || lineageChanged)) {\n        return recallFailure(stalePointerError(\n          refs[0].file,\n          expectedSourceHash,\n          state.sourceHash,\n          expectedLineageFingerprint,\n          lineage.fingerprint,\n        ));\n      }\n    }\n\n    const index = loadTieredIndex(\n      refs,\n      resolveTierRefs(refs, this.context),\n      options,\n      hydrate,\n      selectedRange,\n    );\n    const hydratedShard = index.shards[0];\n    const hydratedSourceChanged = expectedSourceHash !== undefined &&\n      hydratedShard?.sourceHash !== expectedSourceHash;\n    const hydratedLineageChanged = expectedLineageFingerprint !== undefined &&\n      hydratedShard?.lineageFingerprint !== expectedLineageFingerprint;\n    if (hydrate && hydratedShard && (hydratedSourceChanged || hydratedLineageChanged)) {\n      return recallFailure(stalePointerError(\n        hydratedShard.sessionFile,\n        expectedSourceHash,\n        hydratedShard.sourceHash,\n        expectedLineageFingerprint,\n        hydratedShard.lineageFingerprint,\n      ));\n    }\n    if (\n      hydrate &&\n      selectedRange &&\n      index.shards[0] &&\n      selectedRange.last >= index.shards[0].totalEntryCount\n    ) {\n      return recallFailure(addressError(\n        `Entry range ends at ${selectedRange.last}, but the session has ${index.shards[0].totalEntryCount} entries.`,\n        index.shards[0].totalEntryCount,\n      ));\n    }\n\n    const searchQuery = {\n      ...(query === undefined ? {} : { query }),\n      queryMode,\n      queryMatch,\n      filters,\n      regexLimits: {\n        maxPatternBytes: this.context.config.regexMaxPatternBytes\n          ?? DEFAULT_REGEX_MAX_PATTERN_BYTES,\n        maxHaystackTerms: this.context.config.regexMaxHaystackTerms\n          ?? DEFAULT_REGEX_MAX_HAYSTACK_TERMS,\n        maxHaystackBytes: this.context.config.regexMaxHaystackBytes\n          ?? DEFAULT_REGEX_MAX_HAYSTACK_BYTES,\n        timeoutMs: this.context.config.regexTimeoutMs ?? DEFAULT_REGEX_TIMEOUT_MS,\n      },\n    };\n    const result = await searchMemoryIndex(index.shards, index.digests, searchQuery);\n    const coverage = {\n      ...index.coverage,\n      complete: index.coverage.complete && result.queryCoverage.complete\n        && resolution.reasons.length === 0,\n      reasons: [\n        ...new Set([\n          ...index.coverage.reasons,\n          ...result.queryCoverage.reasons,\n          ...resolution.reasons,\n        ]),\n      ].sort(),\n      ...(result.queryCoverage.error ? { error: result.queryCoverage.error } : {}),\n    };\n    const soleRef = refs.length === 1 ? refs[0] : undefined;\n    const soleShard = soleRef\n      ? index.shards.find((candidate) => candidate.sessionFile === soleRef.file)\n      : undefined;\n    const soleDigest = soleRef\n      ? index.digests.find((candidate) => candidate.file === soleRef.file)\n      : undefined;\n    const continuationBinding = soleRef && (soleShard?.sourceHash || soleDigest?.sourceHash)\n      ? {\n          file: soleRef.file,\n          sourceHash: soleShard?.sourceHash ?? soleDigest!.sourceHash,\n          lineageFingerprint: soleShard?.lineageFingerprint ?? soleDigest!.lineageFingerprint,\n        }\n      : undefined;\n    const requestArgs: MemoryRecallCallArgs = {\n      ...baseRequestArgs,\n      ...((expectedSourceHash ?? continuationBinding?.sourceHash)\n        ? { expectedSourceHash: expectedSourceHash ?? continuationBinding!.sourceHash }\n        : {}),\n      ...((expectedLineageFingerprint ?? continuationBinding?.lineageFingerprint)\n        ? {\n            expectedLineageFingerprint:\n              expectedLineageFingerprint ?? continuationBinding!.lineageFingerprint,\n          }\n        : {}),\n      scope: continuationBinding\n        ? `session:${continuationBinding.file}`\n        : baseRequestArgs.scope ?? \"session\",\n    };\n    const response = presentRecall({\n      result,\n      ...(query === undefined ? {} : { query }),\n      queryMode,\n      coverage,\n      ...(offset === undefined ? {} : { offset }),\n      pageSize,\n      snippetChars,\n      requestArgs,\n    });\n    const observationsAfter = observeSources(refs, branches, liveResolver);\n    if (\n      response.next !== null &&\n      observationsBefore &&\n      observationsAfter &&\n      sameSourceObservations(observationsBefore, observationsAfter)\n    ) {\n      this.rememberRecallContinuation({\n        key: recallContinuationKey(requestArgs),\n        result,\n        coverage,\n        requestArgs,\n        observations: observationsAfter,\n        touchedAt: Date.now(),\n      });\n    }\n    updateProgress(result);\n    return response;\n  }\n\n  private async expand(args: Record<string, unknown>): Promise<unknown> {\n    const session = typeof args.session === \"string\" ? args.session : \"\";\n    const expectedSourceHash = typeof args.expectedSourceHash === \"string\"\n      ? args.expectedSourceHash\n      : undefined;\n    const expectedLineageFingerprint = typeof args.expectedLineageFingerprint === \"string\"\n      ? args.expectedLineageFingerprint\n      : undefined;\n    const branches = parseBranches(args.branches, \"memory.expand\");\n    const rawIndices = args.indices;\n    if (rawIndices !== undefined && !Array.isArray(rawIndices)) {\n      throw new Error(\"memory.expand indices must be an array\");\n    }\n    if (Array.isArray(rawIndices) && !rawIndices.every((index) =>\n      typeof index === \"number\" && Number.isSafeInteger(index) && index >= 0)) {\n      return { session, error: addressError(\"Every entry index must be a non-negative safe integer.\"), entries: [] };\n    }\n    const indices = (rawIndices as number[] | undefined) ?? [];\n    const entryIds = Array.isArray(args.entryIds)\n      ? args.entryIds.filter(\n          (entryId): entryId is string => typeof entryId === \"string\" && entryId.length > 0,\n        )\n      : [];\n    const operationAddresses = Array.isArray(args.operationAddresses)\n      ? args.operationAddresses.filter(\n          (address): address is string => typeof address === \"string\" && address.length > 0,\n        )\n      : [];\n    if (indices.length + entryIds.length + operationAddresses.length > EXPAND_MAX_EXACT_SELECTORS) {\n      throw new Error(`memory.expand accepts at most ${EXPAND_MAX_EXACT_SELECTORS} exact selectors per call`);\n    }\n    const rawRange = args.entryRange;\n    const rangeRecord = rawRange && typeof rawRange === \"object\" && !Array.isArray(rawRange)\n      ? rawRange as Record<string, unknown>\n      : undefined;\n    const first = rangeRecord?.first;\n    const last = rangeRecord?.last;\n    if (!session) throw new Error(\"memory.expand requires a session\");\n    if ((first === undefined) !== (last === undefined)) {\n      throw new Error(\"memory.expand entryRange requires both first and last\");\n    }\n    if (first !== undefined && (\n      typeof first !== \"number\" ||\n      typeof last !== \"number\" ||\n      !Number.isSafeInteger(first) ||\n      !Number.isSafeInteger(last) ||\n      first < 0 ||\n      last < first\n    )) {\n      return { session, error: addressError(\"Entry range requires safe integers with 0 <= first <= last.\"), entries: [] };\n    }\n    const numeric = (value: unknown, fallback: number, maximum: number): number =>\n      typeof value === \"number\" && Number.isSafeInteger(value) && value >= 0\n        ? Math.min(value, maximum)\n        : fallback;\n    const before = numeric(args.before, 0, EXPAND_MAX_CONTEXT);\n    const after = numeric(args.after, 0, EXPAND_MAX_CONTEXT);\n    const entryOffset = numeric(args.entryOffset, 0, Number.MAX_SAFE_INTEGER);\n    const textOffset = numeric(args.textOffset, 0, Number.MAX_SAFE_INTEGER);\n    const maxChars = Math.max(256, numeric(args.maxChars, EXPAND_DEFAULT_MAX_CHARS, EXPAND_MAX_CHARS));\n    const maxEntries = Math.max(1, numeric(args.maxEntries, EXPAND_DEFAULT_MAX_ENTRIES, EXPAND_MAX_ENTRIES));\n\n    const ref = resolveSessionTarget(\n      this.context.agentDir,\n      session,\n      overrideSessionDir(this.context.sessionFile),\n    );\n    if (!ref) {\n      return {\n        session,\n        error: { code: \"session_not_found\", message: `Session not found: ${session}` },\n        entries: [],\n      };\n    }\n    const liveResolver = liveBranchResolver(this.context);\n    const observedLiveBranch = branches === \"active\" ? liveResolver?.(ref.file) : undefined;\n    const observedSource = observeSource(ref.file, branches, observedLiveBranch);\n    let snapshot = this.cachedExpansionSnapshot(ref.file, branches, observedSource);\n    if (snapshot) {\n      const sourceChanged = expectedSourceHash !== undefined &&\n        snapshot.sourceHash !== expectedSourceHash;\n      const lineageChanged = expectedLineageFingerprint !== undefined &&\n        snapshot.lineageFingerprint !== expectedLineageFingerprint;\n      if (sourceChanged || lineageChanged) {\n        return {\n          session: ref.file,\n          branches,\n          error: stalePointerError(\n            ref.file,\n            expectedSourceHash,\n            snapshot.sourceHash,\n            expectedLineageFingerprint,\n            snapshot.lineageFingerprint,\n          ),\n          entries: [],\n        };\n      }\n    }\n\n    if (!snapshot) {\n      const initialState = fingerprintSource(ref.file);\n      if (!initialState) {\n        return {\n          session: ref.file,\n          error: { code: \"source_unavailable\", message: `Session source is unavailable: ${ref.file}` },\n          entries: [],\n        };\n      }\n      const initialLiveBranch = branches === \"active\" ? liveResolver?.(ref.file) : undefined;\n      const initialLineage = reconstructSessionLineage(\n        ref.file,\n        branches,\n        initialLiveBranch,\n      );\n      const sourceChanged = expectedSourceHash !== undefined &&\n        initialState.sourceHash !== expectedSourceHash;\n      const lineageChanged = expectedLineageFingerprint !== undefined &&\n        initialLineage.fingerprint !== expectedLineageFingerprint;\n      if (sourceChanged || lineageChanged) {\n        return {\n          session: ref.file,\n          branches,\n          error: stalePointerError(\n            ref.file,\n            expectedSourceHash,\n            initialState.sourceHash,\n            expectedLineageFingerprint,\n            initialLineage.fingerprint,\n          ),\n          entries: [],\n        };\n      }\n\n      const normalized = normalizeSession(\n        ref.file,\n        Number.MAX_SAFE_INTEGER,\n        {\n          lineage: initialLineage,\n          indexThinking: true,\n          indexToolOutput: true,\n        },\n      ).entries;\n      const finalState = fingerprintSource(ref.file);\n      const finalLiveBranch = branches === \"active\" ? liveResolver?.(ref.file) : undefined;\n      const finalLineage = reconstructSessionLineage(\n        ref.file,\n        branches,\n        finalLiveBranch,\n      );\n      const finalObservation = observeSource(ref.file, branches, finalLiveBranch);\n      if (\n        !finalState ||\n        !finalObservation ||\n        finalState.sourceHash !== initialState.sourceHash ||\n        finalLineage.fingerprint !== initialLineage.fingerprint\n      ) {\n        return {\n          session: ref.file,\n          error: stalePointerError(\n            ref.file,\n            expectedSourceHash ?? initialState.sourceHash,\n            finalState?.sourceHash ?? \"\",\n            expectedLineageFingerprint ?? initialLineage.fingerprint,\n            finalLineage.fingerprint,\n          ),\n          entries: [],\n        };\n      }\n      snapshot = {\n        file: ref.file,\n        branches,\n        sourceHash: finalState.sourceHash,\n        lineageFingerprint: finalLineage.fingerprint,\n        observation: finalObservation,\n        entries: normalized,\n        selections: new Map(),\n        touchedAt: Date.now(),\n      };\n    }\n\n    const entryCount = snapshot.entries.length;\n    const outOfBounds = indices.find((index) => index >= entryCount);\n    if (outOfBounds !== undefined) {\n      return {\n        session: ref.file,\n        error: addressError(`Entry index ${outOfBounds} is outside 0..${Math.max(0, entryCount - 1)}.`, entryCount),\n        entries: [],\n      };\n    }\n    if (typeof last === \"number\" && last >= entryCount) {\n      return {\n        session: ref.file,\n        error: addressError(`Entry range ends at ${last}, but the session has ${entryCount} entries.`, entryCount),\n        entries: [],\n      };\n    }\n    if (\n      indices.length === 0 &&\n      entryIds.length === 0 &&\n      operationAddresses.length === 0 &&\n      (first === undefined || last === undefined)\n    ) {\n      if (before > 0 || after > 0) {\n        throw new Error(\"memory.expand before/after requires one selected anchor\");\n      }\n      this.forgetExpansionSnapshot(snapshot);\n      return {\n        session: ref.file,\n        sourceHash: snapshot.sourceHash,\n        branches,\n        lineageFingerprint: snapshot.lineageFingerprint,\n        entryCount,\n        entries: [],\n        next: null,\n      };\n    }\n\n    const requestedSelection: ExpandSessionSelection = {};\n    if (indices.length > 0) requestedSelection.indices = indices;\n    if (entryIds.length > 0) requestedSelection.entryIds = entryIds;\n    if (operationAddresses.length > 0) requestedSelection.operationAddresses = operationAddresses;\n    if (typeof first === \"number\" && typeof last === \"number\") {\n      requestedSelection.entryRange = { first, last };\n    }\n    const requestedWithContext: CanonicalExpansionSelection = {\n      ...requestedSelection,\n      ...(before > 0 ? { before } : {}),\n      ...(after > 0 ? { after } : {}),\n    };\n    const requestedKey = expansionSelectionKey(requestedWithContext);\n    let resolved = snapshot.selections.get(requestedKey);\n    if (!resolved) {\n      let expansion = expandSessionEntriesChecked(snapshot.entries, requestedSelection);\n      if (\"error\" in expansion) {\n        return {\n          session: ref.file,\n          sourceHash: snapshot.sourceHash,\n          branches,\n          lineageFingerprint: snapshot.lineageFingerprint,\n          error: expansion.error,\n          entries: [],\n        };\n      }\n\n      let anchorIndex: number | null = null;\n      let canonical: CanonicalExpansionSelection;\n      if (before > 0 || after > 0) {\n        if (expansion.expanded.length !== 1) {\n          throw new Error(\"memory.expand before/after requires exactly one resolved anchor\");\n        }\n        anchorIndex = expansion.expanded[0]!.index;\n        const contextRange = {\n          first: Math.max(0, anchorIndex - before),\n          last: Math.min(Math.max(0, entryCount - 1), anchorIndex + after),\n        };\n        canonical = requestedWithContext;\n        expansion = expandSessionEntriesChecked(snapshot.entries, { entryRange: contextRange });\n        if (\"error\" in expansion) {\n          return {\n            session: ref.file,\n            sourceHash: snapshot.sourceHash,\n            branches,\n            lineageFingerprint: snapshot.lineageFingerprint,\n            error: expansion.error,\n            entries: [],\n          };\n        }\n      } else if (requestedSelection.entryRange) {\n        canonical = { entryRange: requestedSelection.entryRange };\n      } else {\n        canonical = { indices: expansion.expanded.map((entry) => entry.index) };\n      }\n      resolved = { entries: expansion.expanded, canonical, anchorIndex };\n      this.rememberExpansionSelection(\n        snapshot,\n        [requestedKey, expansionSelectionKey(canonical)],\n        resolved,\n      );\n    }\n\n    const selected = resolved.entries;\n    const canonicalSelection = resolved.canonical;\n    const anchorIndex = resolved.anchorIndex;\n    const finalState = snapshot;\n    const finalLineage = { fingerprint: snapshot.lineageFingerprint };\n    if (entryOffset > selected.length) {\n      return {\n        session: ref.file,\n        error: addressError(`Entry offset ${entryOffset} is outside 0..${selected.length}.`, selected.length),\n        entries: [],\n      };\n    }\n    if (entryOffset < selected.length && textOffset > selected[entryOffset]!.text.length) {\n      return {\n        session: ref.file,\n        error: {\n          code: \"text_offset_out_of_bounds\",\n          message: `Text offset ${textOffset} exceeds entry #${selected[entryOffset]!.index} length ${selected[entryOffset]!.text.length}.`,\n          textLength: selected[entryOffset]!.text.length,\n        },\n        entries: [],\n      };\n    }\n\n    const bounded = (value: string | null, maximum = 512): string | null =>\n      value === null || value.length <= maximum\n        ? value\n        : `${value.slice(0, Math.max(1, maximum - 1))}\u2026`;\n    const compactStructure = (value: unknown): unknown => {\n      if (value === undefined) return undefined;\n      const serialized = JSON.stringify(value);\n      return serialized.length <= 2_000 ? value : undefined;\n    };\n    const output: Array<Record<string, unknown>> = [];\n    const cursors: Array<{ position: number; textOffset: number }> = [];\n    let position = entryOffset;\n    let currentTextOffset = textOffset;\n    let remainingChars = maxChars;\n    while (position < selected.length && output.length < maxEntries && remainingChars > 0) {\n      const entry = selected[position]!;\n      let end = Math.min(entry.text.length, currentTextOffset + remainingChars);\n      if (\n        end < entry.text.length &&\n        end > currentTextOffset &&\n        entry.text.charCodeAt(end) >= 0xdc00 &&\n        entry.text.charCodeAt(end) <= 0xdfff\n      ) {\n        end -= 1;\n      }\n      if (end === currentTextOffset && currentTextOffset < entry.text.length) {\n        end = Math.min(entry.text.length, currentTextOffset + 2);\n      }\n      const chunk = entry.text.slice(currentTextOffset, end);\n      const textComplete = end >= entry.text.length;\n      const operation = compactStructure(entry.operation);\n      const branchFact = compactStructure(entry.branchFact);\n      output.push({\n        index: entry.index,\n        entryId: bounded(entry.entryId),\n        parentId: bounded(entry.parentId),\n        type: bounded(entry.type),\n        role: bounded(entry.role),\n        timestamp: entry.timestamp,\n        isError: entry.isError,\n        ...(anchorIndex !== null ? { anchor: entry.index === anchorIndex } : {}),\n        text: chunk,\n        textRange: {\n          start: currentTextOffset,\n          end,\n          total: entry.text.length,\n          complete: textComplete,\n        },\n        ...(entry.parentEntryId !== undefined ? { parentEntryId: bounded(entry.parentEntryId) } : {}),\n        ...(entry.operationAddress ? { operationAddress: bounded(entry.operationAddress) } : {}),\n        ...(entry.toolName ? { tool: bounded(entry.toolName) } : {}),\n        ...(entry.ref ? { ref: bounded(entry.ref) } : {}),\n        ...(entry.provider ? { provider: bounded(entry.provider) } : {}),\n        ...(entry.action ? { action: bounded(entry.action) } : {}),\n        ...(entry.outcome ? { outcome: entry.outcome } : {}),\n        ...(entry.filesTouched\n          ? { filesTouched: entry.filesTouched.slice(0, 20).map((file) => bounded(file, 1_024)) }\n          : {}),\n        ...(operation !== undefined ? { operation } : {}),\n        ...(branchFact !== undefined ? { branchFact } : {}),\n        ...((entry.operation !== undefined && operation === undefined) ||\n            (entry.branchFact !== undefined && branchFact === undefined)\n          ? { structuredTruncated: true }\n          : {}),\n        ...(entry.factAddress ? { factAddress: bounded(entry.factAddress) } : {}),\n        ...(entry.carrierEntryId ? { carrierEntryId: bounded(entry.carrierEntryId) } : {}),\n        ...(entry.carrierParentId !== undefined ? { carrierParentId: bounded(entry.carrierParentId) } : {}),\n        ...(entry.carrierFromId !== undefined ? { carrierFromId: bounded(entry.carrierFromId) } : {}),\n      });\n      remainingChars -= chunk.length;\n      if (!textComplete) {\n        currentTextOffset = end;\n        cursors.push({ position, textOffset: currentTextOffset });\n        break;\n      }\n      position += 1;\n      currentTextOffset = 0;\n      cursors.push({ position, textOffset: 0 });\n    }\n\n    const responseAt = (\n      records: Array<Record<string, unknown>>,\n      cursor: { position: number; textOffset: number },\n    ): Record<string, unknown> => {\n      const hasNext = cursor.position < selected.length;\n      const nextArgs = hasNext\n        ? {\n            session: ref.file,\n            expectedSourceHash: finalState.sourceHash,\n            expectedLineageFingerprint: finalLineage.fingerprint,\n            branches,\n            ...canonicalSelection,\n            entryOffset: cursor.position,\n            ...(cursor.textOffset > 0 ? { textOffset: cursor.textOffset } : {}),\n            maxChars,\n            maxEntries,\n          }\n        : null;\n      return {\n        session: ref.file,\n        sourceHash: finalState.sourceHash,\n        branches,\n        lineageFingerprint: finalLineage.fingerprint,\n        entryCount,\n        entries: records,\n        next: nextArgs ? { ref: \"memory.expand\", args: nextArgs } : null,\n      };\n    };\n\n    let cursor = { position, textOffset: currentTextOffset };\n    let response = responseAt(output, cursor);\n    while (output.length > 1 && JSON.stringify(response).length > RECALL_MAX_RESPONSE_CHARS) {\n      output.pop();\n      cursors.pop();\n      cursor = cursors.at(-1) ?? { position: entryOffset, textOffset };\n      response = responseAt(output, cursor);\n    }\n    if (output.length === 1 && JSON.stringify(response).length > RECALL_MAX_RESPONSE_CHARS) {\n      const record = output[0]!;\n      const range = record.textRange as { start: number; end: number; total: number; complete: boolean };\n      const chunk = record.text as string;\n      const excess = JSON.stringify(response).length - RECALL_MAX_RESPONSE_CHARS;\n      let keep = Math.max(1, chunk.length - excess - 256);\n      if (\n        keep < chunk.length &&\n        keep > 0 &&\n        chunk.charCodeAt(keep) >= 0xdc00 &&\n        chunk.charCodeAt(keep) <= 0xdfff\n      ) {\n        keep -= 1;\n      }\n      if (keep > 0 && keep < chunk.length) {\n        record.text = chunk.slice(0, keep);\n        range.end = range.start + keep;\n        range.complete = false;\n        cursor = { position: entryOffset, textOffset: range.end };\n        response = responseAt(output, cursor);\n      }\n      if (JSON.stringify(response).length > RECALL_MAX_RESPONSE_CHARS) {\n        delete record.operation;\n        delete record.branchFact;\n        if (Array.isArray(record.filesTouched)) {\n          record.filesTouched = record.filesTouched.slice(0, 4).map((file) => bounded(String(file), 256));\n        }\n        record.structuredTruncated = true;\n        response = responseAt(output, cursor);\n      }\n      if (JSON.stringify(response).length > RECALL_MAX_RESPONSE_CHARS) {\n        const current = String(record.text);\n        const firstCodePointChars = (current.codePointAt(0) ?? 0) > 0xffff ? 2 : 1;\n        const minimalText = current.slice(0, Math.min(current.length, firstCodePointChars));\n        const minimalRange = record.textRange as { start: number; end: number; total: number; complete: boolean };\n        minimalRange.end = minimalRange.start + minimalText.length;\n        minimalRange.complete = minimalRange.end >= minimalRange.total;\n        output[0] = {\n          index: record.index,\n          entryId: record.entryId,\n          parentId: record.parentId,\n          type: record.type,\n          role: record.role,\n          timestamp: record.timestamp,\n          isError: record.isError,\n          ...(record.anchor !== undefined ? { anchor: record.anchor } : {}),\n          text: minimalText,\n          textRange: minimalRange,\n          structuredTruncated: true,\n        };\n        cursor = minimalRange.complete\n          ? { position: entryOffset + 1, textOffset: 0 }\n          : { position: entryOffset, textOffset: minimalRange.end };\n        response = responseAt(output, cursor);\n      }\n    }\n\n    const endingLiveBranch = branches === \"active\" ? liveResolver?.(ref.file) : undefined;\n    const endingObservation = observeSource(ref.file, branches, endingLiveBranch);\n    if (!endingObservation || !sameSourceObservation(snapshot.observation, endingObservation)) {\n      this.forgetExpansionSnapshot(snapshot);\n      const actualState = fingerprintSource(ref.file);\n      const actualLineage = reconstructSessionLineage(ref.file, branches, endingLiveBranch);\n      if (\n        !actualState ||\n        !endingObservation ||\n        actualState.sourceHash !== snapshot.sourceHash ||\n        actualLineage.fingerprint !== snapshot.lineageFingerprint\n      ) {\n        return {\n          session: ref.file,\n          error: stalePointerError(\n            ref.file,\n            expectedSourceHash ?? snapshot.sourceHash,\n            actualState?.sourceHash ?? \"\",\n            expectedLineageFingerprint ?? snapshot.lineageFingerprint,\n            actualLineage.fingerprint,\n          ),\n          entries: [],\n        };\n      }\n      snapshot.observation = endingObservation;\n    }\n    if (response.next === null) {\n      this.forgetExpansionSnapshot(snapshot);\n    } else {\n      snapshot.touchedAt = Date.now();\n      this.rememberExpansionSnapshot(snapshot);\n    }\n    return response;\n  }\n\n  private async sessions(args: Record<string, unknown>): Promise<unknown> {\n    const scope = typeof args.scope === \"string\" ? args.scope : undefined;\n    const branches = parseBranches(args.branches, \"memory.sessions\");\n    const limit =\n      typeof args.limit === \"number\" && Number.isSafeInteger(args.limit) && args.limit >= 1\n        ? Math.min(args.limit, SESSIONS_MAX)\n        : SESSIONS_MAX;\n    const offset =\n      typeof args.offset === \"number\" && Number.isSafeInteger(args.offset) && args.offset >= 0\n        ? args.offset\n        : 0;\n    const resolution = resolveRefs(scope, this.context, false);\n    const total = resolution.refs.length;\n    const refs = resolution.refs.slice(offset, offset + limit);\n    const options = resolveIndexOptions(\n      this.context.config,\n      this.context.agentDir,\n      branches,\n      liveBranchResolver(this.context),\n    );\n    const index = loadTieredIndex(refs, resolveTierRefs(refs, this.context), options);\n    const shards = new Map(index.shards.map((shard) => [shard.sessionFile, shard]));\n    const digests = new Map(index.digests.map((digest) => [digest.file, digest]));\n    const sessions = refs.map((ref) => {\n      const tier = index.tiers.get(ref.file) ?? \"cold\";\n      const shard = shards.get(ref.file);\n      const digest = digests.get(ref.file);\n      return {\n        id: shard?.sessionId ?? digest?.sessionId ?? ref.id,\n        file: ref.file,\n        cwd: digest?.cwd ?? ref.cwd,\n        mtime: ref.mtime,\n        entryCount: shard?.entries.length ?? digest?.entryCount ?? 0,\n        tier,\n        branches,\n        lineageFingerprint: shard?.lineageFingerprint ?? digest?.lineageFingerprint ?? null,\n      };\n    });\n    return {\n      scope: scope ?? \"session\",\n      branches,\n      offset,\n      total,\n      truncated: offset + sessions.length < total,\n      sessions,\n      ...(resolution.reasons.length > 0\n        ? { error: unresolvedScopeError(resolution) }\n        : {}),\n    };\n  }\n}\n", "import type { FabricExecutionOutcomeV1 } from \"../audit/trace.js\";\nimport type { EntryRange, MemoryCoverage } from \"./index.js\";\nimport type { MemoryBranches } from \"./lineage.js\";\nimport type {\n  DigestHit,\n  SearchResult,\n  SearchSegment,\n  SearchSegmentEntry,\n} from \"./search.js\";\nimport {\n  compareLexical,\n  normalizeMemoryPhrase,\n  tokenizeLexical,\n  type MemoryQueryMatch,\n  type MemoryQueryMode,\n} from \"./tokenize.js\";\n\nexport const RECALL_DEFAULT_PAGE_SIZE = 10;\nexport const RECALL_MAX_PAGE_SIZE = 50;\nexport const RECALL_DEFAULT_SNIPPET_CHARS = 480;\nexport const RECALL_MAX_SNIPPET_CHARS = 2_000;\nexport const RECALL_MAX_RESPONSE_CHARS = 30_000;\n\nexport interface MemoryRecallCallArgs {\n  query?: string;\n  queryMode?: MemoryQueryMode;\n  queryMatch?: MemoryQueryMatch;\n  expectedSourceHash?: string;\n  expectedLineageFingerprint?: string;\n  branches?: MemoryBranches;\n  scope?: string;\n  offset?: number;\n  pageSize?: number;\n  snippetChars?: number;\n  role?: string;\n  tool?: string;\n  ref?: string;\n  provider?: string;\n  action?: string;\n  outcome?: FabricExecutionOutcomeV1;\n  since?: number;\n  until?: number;\n  entryRange?: EntryRange;\n}\n\ninterface MemoryExpandCallArgs {\n  session: string;\n  expectedSourceHash?: string;\n  expectedLineageFingerprint?: string;\n  branches?: MemoryBranches;\n  indices?: number[];\n  entryIds?: string[];\n  operationAddresses?: string[];\n  entryRange?: EntryRange;\n  before?: number;\n  after?: number;\n  entryOffset?: number;\n  textOffset?: number;\n  maxChars?: number;\n  maxEntries?: number;\n}\n\ninterface MemorySourceBinding {\n  sessionId: string;\n  sessionFile: string;\n  sourceHash: string;\n  branches: MemoryBranches;\n  lineageFingerprint: string;\n  tier: \"hot\" | \"cold\";\n}\n\ninterface MemoryExpandFollow {\n  ref: \"memory.expand\";\n  args: MemoryExpandCallArgs;\n}\n\ninterface MemoryRecallFollow {\n  ref: \"memory.recall\";\n  args: MemoryRecallCallArgs;\n}\n\ninterface MemoryRecallEntryHit {\n  kind: \"entry\";\n  sessionId: string;\n  tier: \"hot\" | \"cold\";\n  index: number;\n  entryId: string | null;\n  parentId: string | null;\n  operationAddress: string | null;\n  type: string;\n  role: string | null;\n  tool: string | null;\n  ref: string | null;\n  provider: string | null;\n  action: string | null;\n  timestamp: number | null;\n  isError: boolean;\n  outcome?: FabricExecutionOutcomeV1;\n  score: number;\n  snippet: string;\n  truncated: boolean;\n  follow: MemoryExpandFollow;\n}\n\ninterface MemoryRecallSessionHit {\n  kind: \"session\";\n  sessionId: string;\n  tier: \"cold\";\n  cwd: string;\n  lastTimestamp: number | null;\n  score: number;\n  matchedTerms: number;\n  matchedStructuralEntries: number;\n  follow: MemoryRecallFollow;\n}\n\ntype MemoryRecallHit = MemoryRecallEntryHit | MemoryRecallSessionHit;\n\ninterface MemoryRecallContinuation {\n  ref: \"memory.recall\";\n  args: MemoryRecallCallArgs;\n}\n\nexport interface MemoryRecallResponse {\n  total: number;\n  hits: MemoryRecallHit[];\n  next: MemoryRecallContinuation | null;\n  coverage: MemoryCoverage;\n}\n\ninterface RecallPresentationInput {\n  result: SearchResult;\n  query?: string;\n  queryMode: MemoryQueryMode;\n  coverage: MemoryCoverage;\n  offset?: number;\n  pageSize: number;\n  snippetChars: number;\n  requestArgs: MemoryRecallCallArgs;\n}\n\ninterface Snippet {\n  text: string;\n  truncated: boolean;\n}\n\nconst boundedMetadata = (value: string | null | undefined, max = 512): string | null => {\n  if (value === undefined || value === null) return null;\n  return value.length <= max ? value : `${value.slice(0, Math.max(1, max - 1))}\u2026`;\n};\n\nconst safeSlice = (text: string, start: number, end: number): string => {\n  let safeStart = Math.max(0, start);\n  let safeEnd = Math.min(text.length, end);\n  const startCode = text.charCodeAt(safeStart);\n  if (safeStart > 0 && startCode >= 0xdc00 && startCode <= 0xdfff) safeStart += 1;\n  const endCode = text.charCodeAt(safeEnd - 1);\n  if (safeEnd < text.length && endCode >= 0xd800 && endCode <= 0xdbff) safeEnd -= 1;\n  return text.slice(safeStart, safeEnd);\n};\n\nconst snippetAnchor = (\n  text: string,\n  query: string | undefined,\n  queryMode: MemoryQueryMode,\n): number => {\n  if (!query) return 0;\n  const normalized = normalizeMemoryPhrase(text);\n  if (queryMode === \"phrase\") {\n    const phrase = normalizeMemoryPhrase(query.trim());\n    return Math.max(0, normalized.indexOf(phrase));\n  }\n  if (queryMode === \"literal\") {\n    const terms = [...new Set(tokenizeLexical(query))].sort((left, right) =>\n      right.length - left.length || left.localeCompare(right)\n    );\n    for (const term of terms) {\n      const index = normalized.indexOf(term);\n      if (index >= 0) return index;\n    }\n  }\n  return 0;\n};\n\nconst makeSnippet = (\n  text: string,\n  query: string | undefined,\n  queryMode: MemoryQueryMode,\n  maxChars: number,\n): Snippet => {\n  if (text.length <= maxChars) return { text, truncated: false };\n  const anchor = snippetAnchor(text, query, queryMode);\n  const leadingContext = Math.floor(maxChars / 3);\n  let start = Math.max(0, anchor - leadingContext);\n  let end = Math.min(text.length, start + maxChars);\n  if (end - start < maxChars) start = Math.max(0, end - maxChars);\n  const body = safeSlice(text, start, end);\n  return {\n    text: `${start > 0 ? \"\u2026\" : \"\"}${body}${end < text.length ? \"\u2026\" : \"\"}`,\n    truncated: true,\n  };\n};\n\nconst sourceFromSegment = (segment: SearchSegment): MemorySourceBinding => ({\n  sessionId: boundedMetadata(segment.sessionId) ?? \"\",\n  sessionFile: segment.sessionFile,\n  sourceHash: segment.sourceHash,\n  branches: segment.branches,\n  lineageFingerprint: segment.lineageFingerprint,\n  tier: segment.tier,\n});\n\nconst sourceFromDigest = (digest: DigestHit): MemorySourceBinding => ({\n  sessionId: boundedMetadata(digest.sessionId) ?? \"\",\n  sessionFile: digest.sessionFile,\n  sourceHash: digest.sourceHash,\n  branches: digest.branches,\n  lineageFingerprint: digest.lineageFingerprint,\n  tier: \"cold\",\n});\n\nconst expandArgs = (\n  source: MemorySourceBinding,\n  entry: SearchSegmentEntry[\"entry\"],\n): MemoryExpandCallArgs => ({\n  session: source.sessionFile,\n  expectedSourceHash: source.sourceHash,\n  expectedLineageFingerprint: source.lineageFingerprint,\n  branches: source.branches,\n  indices: [entry.index],\n});\n\nconst entryHit = (\n  segment: SearchSegment,\n  item: SearchSegmentEntry,\n  query: string | undefined,\n  queryMode: MemoryQueryMode,\n  snippetChars: number,\n): MemoryRecallEntryHit => {\n  const entry = item.entry;\n  const source = sourceFromSegment(segment);\n  const snippet = makeSnippet(entry.text, query, queryMode, snippetChars);\n  return {\n    kind: \"entry\",\n    sessionId: source.sessionId,\n    tier: source.tier,\n    index: entry.index,\n    entryId: boundedMetadata(entry.entryId),\n    parentId: boundedMetadata(entry.parentId),\n    operationAddress: boundedMetadata(entry.operationAddress),\n    type: boundedMetadata(entry.type) ?? \"entry\",\n    role: boundedMetadata(entry.role),\n    tool: boundedMetadata(entry.toolName),\n    ref: boundedMetadata(entry.ref),\n    provider: boundedMetadata(entry.provider),\n    action: boundedMetadata(entry.action),\n    timestamp: entry.timestamp,\n    isError: entry.isError,\n    ...(entry.outcome ? { outcome: entry.outcome } : {}),\n    score: item.score,\n    snippet: snippet.text,\n    truncated: snippet.truncated || entry.truncated,\n    follow: { ref: \"memory.expand\", args: expandArgs(source, entry) },\n  };\n};\n\nconst hydrationArgs = (\n  digest: DigestHit,\n  request: MemoryRecallCallArgs,\n): MemoryRecallCallArgs => {\n  const { offset: _offset, entryRange: _entryRange, ...base } = request;\n  return {\n    ...base,\n    scope: `session:${digest.sessionFile}`,\n    branches: digest.branches,\n    expectedSourceHash: digest.sourceHash,\n    expectedLineageFingerprint: digest.lineageFingerprint,\n  };\n};\n\nconst sessionHit = (\n  digest: DigestHit,\n  request: MemoryRecallCallArgs,\n): MemoryRecallSessionHit => {\n  const source = sourceFromDigest(digest);\n  return {\n    kind: \"session\",\n    sessionId: source.sessionId,\n    tier: \"cold\",\n    cwd: boundedMetadata(digest.cwd, 2_048) ?? \"\",\n    lastTimestamp: digest.lastTs,\n    score: digest.score,\n    matchedTerms: digest.matchedTerms,\n    matchedStructuralEntries: digest.matchedStructuralEntries,\n    follow: { ref: \"memory.recall\", args: hydrationArgs(digest, request) },\n  };\n};\n\ntype RecallCandidate =\n  | { kind: \"entry\"; segment: SearchSegment; item: SearchSegmentEntry }\n  | { kind: \"session\"; digest: DigestHit };\n\nconst recallCandidateCache = new WeakMap<SearchResult, RecallCandidate[]>();\n\nconst flattenCandidates = (result: SearchResult): RecallCandidate[] => {\n  const cached = recallCandidateCache.get(result);\n  if (cached) return cached;\n  const candidates: RecallCandidate[] = [];\n  for (const item of result.items) {\n    if (item.kind === \"digest\") {\n      candidates.push({ kind: \"session\", digest: item.digest });\n      continue;\n    }\n    for (const entry of item.segment.entries) {\n      if (entry.matched) candidates.push({ kind: \"entry\", segment: item.segment, item: entry });\n    }\n  }\n  candidates.sort((left, right) => {\n    const leftScore = left.kind === \"entry\" ? left.item.score : left.digest.score;\n    const rightScore = right.kind === \"entry\" ? right.item.score : right.digest.score;\n    if (rightScore !== leftScore) return rightScore - leftScore;\n    const leftMtime = left.kind === \"entry\" ? left.segment.sessionMtime : left.digest.sessionMtime;\n    const rightMtime = right.kind === \"entry\" ? right.segment.sessionMtime : right.digest.sessionMtime;\n    if (rightMtime !== leftMtime) return rightMtime - leftMtime;\n    if (left.kind !== right.kind) return left.kind === \"entry\" ? -1 : 1;\n    if (left.kind === \"entry\" && right.kind === \"entry\") {\n      if (left.item.entry.index !== right.item.entry.index) {\n        return left.item.entry.index - right.item.entry.index;\n      }\n      return compareLexical(left.segment.sessionFile, right.segment.sessionFile);\n    }\n    if (left.kind === \"session\" && right.kind === \"session\") {\n      return compareLexical(left.digest.sessionFile, right.digest.sessionFile);\n    }\n    return 0;\n  });\n  recallCandidateCache.set(result, candidates);\n  return candidates;\n};\n\nconst materializeCandidate = (\n  candidate: RecallCandidate,\n  query: string | undefined,\n  queryMode: MemoryQueryMode,\n  snippetChars: number,\n  request: MemoryRecallCallArgs,\n): MemoryRecallHit => candidate.kind === \"session\"\n  ? sessionHit(candidate.digest, request)\n  : entryHit(candidate.segment, candidate.item, query, queryMode, snippetChars);\n\nconst canonicalNextArgs = (\n  request: MemoryRecallCallArgs,\n  offset: number,\n): MemoryRecallCallArgs => {\n  const { offset: _offset, ...base } = request;\n  return { ...base, offset };\n};\n\nexport const presentRecall = (input: RecallPresentationInput): MemoryRecallResponse => {\n  const candidates = flattenCandidates(input.result);\n  const start = input.offset ?? 0;\n  let selected = candidates.slice(start, start + input.pageSize);\n\n  const build = (pageCandidates: RecallCandidate[]): MemoryRecallResponse => {\n    const hits = pageCandidates.map((candidate) =>\n      materializeCandidate(\n        candidate,\n        input.query,\n        input.queryMode,\n        input.snippetChars,\n        input.requestArgs,\n      )\n    );\n    return {\n      total: candidates.length,\n      hits,\n      next: start + hits.length < candidates.length\n        ? { ref: \"memory.recall\", args: canonicalNextArgs(input.requestArgs, start + hits.length) }\n        : null,\n      coverage: input.coverage,\n    };\n  };\n\n  let response = build(selected);\n  while (selected.length > 1 && JSON.stringify(response).length > RECALL_MAX_RESPONSE_CHARS) {\n    selected = selected.slice(0, -1);\n    response = build(selected);\n  }\n  return response;\n};\n", "import { hash, hashLcmPayload, type RawEntry } from \"../storage/lcm-identity.js\";\nimport type { LcmSearchOptions, LcmSearchPage } from \"../storage/lcm-ledger.js\";\nimport { lcmRawAddress, lcmSummaryAddress } from \"../compaction/lcm-addresses.js\";\nimport { DEFAULT_REGEX_MAX_PATTERN_BYTES } from \"./search.js\";\nimport {\n  normalizeMemoryPhrase,\n  planMemoryQuery,\n  tokenizeLexical,\n  type MemoryQueryMatch,\n  type MemoryQueryMode,\n} from \"./tokenize.js\";\n\nexport interface LcmSummaryNode {\n  nodeId: string;\n  projectKey: string;\n  sessionId: string;\n  kind?: \"leaf\" | \"condensed\";\n  sourceHash: string;\n  lineageFingerprint?: string;\n  state: \"pending\" | \"running\" | \"ready\" | \"failed\";\n  text: string;\n  children: string[];\n  sources: Array<{ entryId: string; revision: number; contentHash: string }>;\n  createdAt: number;\n}\n\nexport interface LcmSummaryReader {\n  listNodes(input: { sessionId?: string; limit: number }): LcmSummaryNode[];\n  getNode(nodeId: string): LcmSummaryNode | undefined;\n}\n\nexport interface LcmBranchBinding {\n  sessionId?: string;\n  sourceHash?: string;\n  lineageFingerprint?: string;\n  activeSourceKeys?: readonly string[];\n  ready: boolean;\n}\n\nexport interface LcmMemoryLedger {\n  readonly projectKey: string;\n  readRaw(sessionId?: string): RawEntry[];\n  readRawPage(sessionId?: string, offset?: number, limit?: number): RawEntry[];\n  readRawEntry(sessionId: string, entryId: string, revision: number): RawEntry | undefined;\n  searchRaw(options: LcmSearchOptions): LcmSearchPage;\n}\n\nexport interface LcmMemoryAdapterOptions {\n  ledger: LcmMemoryLedger;\n  summaries: LcmSummaryReader;\n  projectKey?: string;\n  currentSessionId?: string;\n  branchForSession?: (sessionId: string) => LcmBranchBinding | undefined;\n  maxRawEntries?: number;\n  maxSummaryNodes?: number;\n}\n\ninterface LcmMemoryHit {\n  kind: \"lcm.raw\" | \"lcm.summary\";\n  sessionId: string;\n  score: number;\n  snippet: string;\n  truncated: boolean;\n  source: {\n    kind: \"raw\" | \"summary\";\n    projectKey: string;\n    sessionId: string;\n    entryId?: string;\n    revision?: number;\n    contentHash?: string;\n    nodeId?: string;\n    sourceHash: string;\n  };\n  follow: { ref: \"memory.expand\"; args: Record<string, unknown> };\n}\n\ninterface LcmMemoryResult {\n  total: number;\n  hits: LcmMemoryHit[];\n  next: { ref: \"memory.recall\"; args: Record<string, unknown> } | null;\n  coverage: {\n    complete: boolean;\n    indexedSessions: number;\n    eligibleSessions: number;\n    staleSessions: number;\n    incompleteSessions: number;\n    reasons: string[];\n  };\n}\n\ninterface QueryPredicate {\n  matches: (text: string) => boolean;\n  scoreOf: (text: string) => number;\n  failure?: string;\n}\n\nconst SUMMARY_EXPAND_DEFAULT_ENTRIES = 10;\nconst SUMMARY_EXPAND_MAX_ENTRIES = 20;\nconst SUMMARY_EXPAND_DEFAULT_CHARS = 20000;\nconst SUMMARY_EXPAND_MAX_CHARS = 24000;\nconst SUMMARY_EXPAND_MAX_CONTEXT = 100;\nconst SUMMARY_DESCENT_CACHE_LIMIT = 8;\n\nconst queryPredicate = (\n  query: string | undefined,\n  mode: MemoryQueryMode,\n  match: MemoryQueryMatch,\n): QueryPredicate => {\n  const plan = planMemoryQuery(query, mode, match);\n  if (plan.kind === \"browse\") {\n    return { matches: () => true, scoreOf: () => 0 };\n  }\n  if (plan.kind === \"regex\") {\n    if (Buffer.byteLength(plan.pattern, \"utf8\") > DEFAULT_REGEX_MAX_PATTERN_BYTES) {\n      return { matches: () => false, scoreOf: () => 0, failure: \"regex_pattern_too_large\" };\n    }\n    let regex: RegExp;\n    try {\n      regex = new RegExp(plan.pattern, \"iu\");\n    } catch {\n      return { matches: () => false, scoreOf: () => 0, failure: \"invalid_regex\" };\n    }\n    return { matches: (text) => regex.test(text), scoreOf: (text) => (regex.test(text) ? 1 : 0) };\n  }\n  if (plan.kind === \"phrase\") {\n    const phrase = plan.phrase;\n    const hit = (text: string): boolean => normalizeMemoryPhrase(text).includes(phrase);\n    return { matches: hit, scoreOf: (text) => (hit(text) ? 1 : 0) };\n  }\n  const terms = plan.terms;\n  if (terms.length === 0) return { matches: () => true, scoreOf: () => 0 };\n  const overlap = (text: string): number => {\n    const available = new Set(tokenizeLexical(text));\n    return terms.reduce((total, term) => total + (available.has(term) ? 1 : 0), 0);\n  };\n  return plan.match === \"all\"\n    ? { matches: (text) => overlap(text) === terms.length, scoreOf: overlap }\n    : { matches: (text) => overlap(text) > 0, scoreOf: overlap };\n};\n\nconst excerpt = (text: string, max = 480): { snippet: string; truncated: boolean } => ({\n  snippet: text.length <= max ? text : text.slice(0, max),\n  truncated: text.length > max,\n});\n\nconst isLowSurrogate = (code: number): boolean => code >= 0xdc00 && code <= 0xdfff;\n\nconst sourceKey = (entryId: string, contentHash: string): string => `${entryId}:${contentHash}`;\n\nconst activeBinding = (\n  options: LcmMemoryAdapterOptions,\n  sessionId: string,\n): LcmBranchBinding | undefined => options.branchForSession?.(sessionId);\n\nconst activeSourceSet = (binding: LcmBranchBinding | undefined): Set<string> | undefined =>\n  binding?.activeSourceKeys === undefined ? undefined : new Set(binding.activeSourceKeys);\n\nconst sessionScope = (args: Record<string, unknown>, currentSessionId: string | undefined): string | undefined => {\n  const scope = typeof args.scope === \"string\" && args.scope.startsWith(\"session:\")\n    ? args.scope.slice(\"session:\".length)\n    : undefined;\n  return scope ?? currentSessionId;\n};\n\nconst activeAllowed = (\n  branches: \"active\" | \"all\",\n  binding: LcmBranchBinding | undefined,\n  key: string,\n): { allowed: boolean; reason?: string } => {\n  if (branches === \"all\") return { allowed: true };\n  if (!binding) return { allowed: false, reason: \"active_branch_unbound\" };\n  if (!binding.ready) return { allowed: false, reason: \"session_incomplete\" };\n  if (binding.activeSourceKeys !== undefined && !activeSourceSet(binding)?.has(key)) {\n    return { allowed: false, reason: \"source_off_active_branch\" };\n  }\n  return { allowed: true };\n};\n\nconst readMode = (value: unknown): MemoryQueryMode =>\n  value === \"phrase\" ? \"phrase\" : value === \"regex\" ? \"regex\" : \"literal\";\n\nconst readMatch = (value: unknown): MemoryQueryMatch => (value === \"all\" ? \"all\" : \"any\");\n\nconst clampInteger = (value: unknown, min: number, max: number, fallback: number): number =>\n  typeof value === \"number\" && Number.isFinite(value)\n    ? Math.min(max, Math.max(min, Math.floor(value)))\n    : fallback;\n\nconst addressList = (value: unknown): string[] =>\n  Array.isArray(value)\n    ? value.filter((entry): entry is string => typeof entry === \"string\" && entry.length > 0)\n    : [];\n\nconst unresolvedAddress = (\n  addresses: readonly string[],\n  items: readonly DescentItem[],\n  addressType: \"entry_id\" | \"operation_address\",\n  read: (item: DescentItem) => string,\n): Record<string, unknown> | undefined => {\n  for (const address of addresses) {\n    const matches = items.reduce((count, item) => count + (read(item) === address ? 1 : 0), 0);\n    if (matches === 1) continue;\n    return {\n      code: matches === 0 ? \"address_not_found\" : \"ambiguous_address\",\n      message: matches === 0\n        ? `Entry address ${JSON.stringify(address)} was not found.`\n        : `Entry address ${JSON.stringify(address)} resolves to ${matches} records.`,\n      addressType,\n      address,\n      matches,\n    };\n  }\n  return undefined;\n};\n\nconst resolveDescentSelection = (\n  items: readonly DescentItem[],\n  args: Record<string, unknown>,\n): { selected: SelectedDescentItem[] } | { error: Record<string, unknown> } => {\n  const total = items.length;\n  const outOfRange = (message: string) => ({ error: { code: \"index_out_of_bounds\", message, entryCount: total } });\n  const positioned = (): SelectedDescentItem[] => items.map((item, index) => ({ item, index }));\n\n  const requested = args.indices;\n  if (requested !== undefined && !Array.isArray(requested)) {\n    throw new Error(\"memory.expand indices must be an array\");\n  }\n  const candidates = (requested ?? []) as unknown[];\n  if (!candidates.every((index) => typeof index === \"number\" && Number.isSafeInteger(index) && index >= 0)) {\n    return outOfRange(\"Every entry index must be a non-negative safe integer.\");\n  }\n  const indices = candidates as number[];\n  const beyond = indices.find((index) => index >= total);\n  if (beyond !== undefined) {\n    return outOfRange(`Entry index ${beyond} is outside 0..${Math.max(0, total - 1)}.`);\n  }\n\n  const entryIds = addressList(args.entryIds);\n  const addresses = addressList(args.operationAddresses);\n  const range = args.entryRange && typeof args.entryRange === \"object\" && !Array.isArray(args.entryRange)\n    ? args.entryRange as Record<string, unknown>\n    : undefined;\n  const first = range?.first;\n  const last = range?.last;\n  if ((first === undefined) !== (last === undefined)) {\n    throw new Error(\"memory.expand entryRange requires both first and last\");\n  }\n  if (first !== undefined && (\n    typeof first !== \"number\" ||\n    typeof last !== \"number\" ||\n    !Number.isSafeInteger(first) ||\n    !Number.isSafeInteger(last) ||\n    first < 0 ||\n    last < first\n  )) {\n    return outOfRange(\"Entry range requires safe integers with 0 <= first <= last.\");\n  }\n  if (typeof last === \"number\" && last >= total) {\n    return outOfRange(`Entry range ends at ${last}, but the summary descends into ${total} entries.`);\n  }\n\n  const before = clampInteger(args.before, 0, SUMMARY_EXPAND_MAX_CONTEXT, 0);\n  const after = clampInteger(args.after, 0, SUMMARY_EXPAND_MAX_CONTEXT, 0);\n  if (indices.length === 0 && entryIds.length === 0 && addresses.length === 0 && first === undefined) {\n    if (before > 0 || after > 0) {\n      throw new Error(\"memory.expand before/after requires one selected anchor\");\n    }\n    return { selected: positioned() };\n  }\n\n  const missingEntryId = unresolvedAddress(entryIds, items, \"entry_id\", (item) => item.entryId);\n  if (missingEntryId) return { error: missingEntryId };\n  const missingAddress = unresolvedAddress(addresses, items, \"operation_address\", (item) => item.address);\n  if (missingAddress) return { error: missingAddress };\n\n  const indexSet = new Set(indices);\n  const entryIdSet = new Set(entryIds);\n  const addressSet = new Set(addresses);\n  const selected = positioned().filter(({ item, index }) =>\n    indexSet.has(index) ||\n    entryIdSet.has(item.entryId) ||\n    addressSet.has(item.address) ||\n    (typeof first === \"number\" && typeof last === \"number\" && index >= first && index <= last));\n  if (before === 0 && after === 0) return { selected };\n  if (selected.length !== 1) {\n    throw new Error(\"memory.expand before/after requires exactly one resolved anchor\");\n  }\n  const anchor = selected[0]!.index;\n  const from = Math.max(0, anchor - before);\n  const to = Math.min(Math.max(0, total - 1), anchor + after);\n  return { selected: positioned().filter(({ index }) => index >= from && index <= to) };\n};\n\nexport class LcmMemoryAdapter {\n  private readonly projectKey: string;\n  private readonly maxRaw: number;\n  private readonly maxSummary: number;\n  private readonly descents = new Map<string, DescentItem[]>();\n\n  constructor(private readonly options: LcmMemoryAdapterOptions) {\n    this.projectKey = options.projectKey ?? options.ledger.projectKey;\n    this.maxRaw = Math.max(1, Math.min(options.maxRawEntries ?? 1000, 10000));\n    this.maxSummary = Math.max(1, Math.min(options.maxSummaryNodes ?? 1000, 10000));\n  }\n\n  recall(args: Record<string, unknown>): LcmMemoryResult {\n    const query = typeof args.query === \"string\" ? args.query : undefined;\n    const mode = readMode(args.queryMode);\n    const match = readMatch(args.queryMatch);\n    const predicate = queryPredicate(query, mode, match);\n    const branches = args.branches === \"all\" ? \"all\" : \"active\";\n    const offset = typeof args.offset === \"number\" && args.offset >= 0 ? Math.floor(args.offset) : 0;\n    const pageSize = typeof args.pageSize === \"number\" && args.pageSize >= 1\n      ? Math.min(50, Math.floor(args.pageSize))\n      : 10;\n    const selectedSession = sessionScope(args, this.options.currentSessionId);\n    const reasons = new Set<string>();\n    if (predicate.failure) reasons.add(predicate.failure);\n\n    const summaryHits = this.summaryHits(selectedSession, branches, predicate, reasons);\n    const raw = this.rawPage(selectedSession, branches, query, mode, match, predicate, offset, pageSize, reasons);\n    const hits = raw.hits;\n    const consumedPositions = offset + raw.consumed;\n    let summaryTaken = 0;\n    if (consumedPositions >= raw.total) {\n      const start = Math.max(0, consumedPositions - raw.total);\n      for (const hit of summaryHits.slice(start)) {\n        if (hits.length >= pageSize) break;\n        hits.push(hit);\n        summaryTaken += 1;\n      }\n    }\n    const total = raw.total + summaryHits.length;\n    const consumed = raw.consumed + summaryTaken;\n    const sessions = new Set(hits.map((hit) => hit.sessionId)).size;\n    return {\n      total,\n      hits,\n      next: offset + consumed < total\n        ? { ref: \"memory.recall\", args: { ...args, offset: offset + consumed } }\n        : null,\n      coverage: {\n        complete: reasons.size === 0,\n        indexedSessions: sessions,\n        eligibleSessions: sessions,\n        staleSessions: 0,\n        incompleteSessions: reasons.size === 0 ? 0 : 1,\n        reasons: [...reasons].sort(),\n      },\n    };\n  }\n\n  private rawPage(\n    selectedSession: string | undefined,\n    branches: \"active\" | \"all\",\n    query: string | undefined,\n    mode: MemoryQueryMode,\n    match: MemoryQueryMatch,\n    predicate: QueryPredicate,\n    offset: number,\n    pageSize: number,\n    reasons: Set<string>,\n  ): { hits: LcmMemoryHit[]; consumed: number; total: number } {\n    const hits: LcmMemoryHit[] = [];\n    let consumed = 0;\n    let total = 0;\n    while (hits.length < pageSize && consumed < this.maxRaw) {\n      const limit = Math.min(Math.max(pageSize, 32), this.maxRaw - consumed);\n      const page = this.options.ledger.searchRaw({\n        ...(selectedSession === undefined ? {} : { sessionId: selectedSession }),\n        ...(query === undefined ? {} : { query }),\n        mode,\n        match,\n        offset: offset + consumed,\n        limit,\n        scanLimit: this.maxRaw,\n      });\n      total = page.total;\n      if (!page.complete) reasons.add(\"raw_search_incomplete\");\n      if (page.rows.length === 0) break;\n      for (const entry of page.rows) {\n        consumed += 1;\n        const allowed = activeAllowed(branches, activeBinding(this.options, entry.sessionId), sourceKey(entry.entryId, entry.contentHash));\n        if (!allowed.allowed) {\n          if (allowed.reason) reasons.add(allowed.reason);\n          continue;\n        }\n        hits.push(this.rawHit(entry, predicate, branches));\n        if (hits.length >= pageSize) break;\n      }\n      if (page.rows.length < limit) break;\n    }\n    if (hits.length < pageSize && consumed >= this.maxRaw && offset + consumed < total) {\n      reasons.add(\"raw_scan_limit\");\n    }\n    return { hits, consumed, total };\n  }\n\n  private rawHit(entry: RawEntry, predicate: QueryPredicate, branches: \"active\" | \"all\"): LcmMemoryHit {\n    const preview = excerpt(entry.content);\n    const address = lcmRawAddress(entry);\n    return {\n      kind: \"lcm.raw\",\n      sessionId: entry.sessionId,\n      score: predicate.scoreOf(entry.content),\n      snippet: preview.snippet,\n      truncated: preview.truncated,\n      source: {\n        kind: \"raw\",\n        projectKey: entry.projectKey,\n        sessionId: entry.sessionId,\n        entryId: entry.entryId,\n        revision: entry.revision,\n        contentHash: entry.payloadHash,\n        sourceHash: entry.payloadHash,\n      },\n      follow: {\n        ref: \"memory.expand\",\n        args: { session: address, branches, expectedSourceHash: entry.payloadHash },\n      },\n    };\n  }\n\n  private summaryHits(\n    selectedSession: string | undefined,\n    branches: \"active\" | \"all\",\n    predicate: QueryPredicate,\n    reasons: Set<string>,\n  ): LcmMemoryHit[] {\n    const nodes = selectedSession === undefined\n      ? this.options.summaries.listNodes({ limit: this.maxSummary + 1 })\n      : this.options.summaries.listNodes({ sessionId: selectedSession, limit: this.maxSummary + 1 });\n    if (nodes.length > this.maxSummary) reasons.add(\"summary_node_limit\");\n    const hits: Array<{ hit: LcmMemoryHit; createdAt: number; nodeId: string }> = [];\n    for (const node of nodes.slice(0, this.maxSummary)) {\n      if (node.state !== \"ready\") {\n        reasons.add(`summary_${node.state}`);\n        continue;\n      }\n      const binding = activeBinding(this.options, node.sessionId);\n      if (branches === \"active\") {\n        if (!binding) {\n          reasons.add(\"active_branch_unbound\");\n          continue;\n        }\n        if (!binding.ready) {\n          reasons.add(\"session_incomplete\");\n          continue;\n        }\n        const active = activeSourceSet(binding);\n        if (active && node.sources.some((source) => !active.has(sourceKey(source.entryId, source.contentHash)))) {\n          reasons.add(\"summary_off_active_branch\");\n          continue;\n        }\n      }\n      if (!predicate.matches(node.text)) continue;\n      const preview = excerpt(node.text);\n      hits.push({\n        createdAt: node.createdAt,\n        nodeId: node.nodeId,\n        hit: {\n          kind: \"lcm.summary\",\n          sessionId: node.sessionId,\n          score: predicate.scoreOf(node.text),\n          snippet: preview.snippet,\n          truncated: preview.truncated,\n          source: {\n            kind: \"summary\",\n            projectKey: node.projectKey,\n            sessionId: node.sessionId,\n            nodeId: node.nodeId,\n            sourceHash: node.sourceHash,\n          },\n          follow: {\n            ref: \"memory.expand\",\n            args: { session: lcmSummaryAddress(node.nodeId), branches, expectedSourceHash: node.sourceHash },\n          },\n        },\n      });\n    }\n    hits.sort((left, right) => right.hit.score - left.hit.score\n      || right.createdAt - left.createdAt\n      || left.nodeId.localeCompare(right.nodeId));\n    return hits.map((entry) => entry.hit);\n  }\n\n  expand(args: Record<string, unknown>): Record<string, unknown> {\n    const address = typeof args.session === \"string\" ? args.session : \"\";\n    const branches = args.branches === \"all\" ? \"all\" : \"active\";\n    if (address.startsWith(\"lcm.summary:\")) return this.expandSummary(address, args, branches);\n    return this.expandRaw(address, args, branches);\n  }\n\n  private expandSummary(\n    address: string,\n    args: Record<string, unknown>,\n    branches: \"active\" | \"all\",\n  ): Record<string, unknown> {\n    const node = this.options.summaries.getNode(address.slice(\"lcm.summary:\".length));\n    if (!node) return { entries: [], next: null, error: { code: \"stale_pointer\", message: \"summary node is unavailable\" } };\n    if (node.state !== \"ready\") return { entries: [], next: null, error: { code: \"incomplete_coverage\", message: `summary node is ${node.state}` } };\n    const binding = activeBinding(this.options, node.sessionId);\n    const active = activeSourceSet(binding);\n    if (branches === \"active\") {\n      if (!binding || !binding.ready) return { entries: [], next: null, error: { code: \"incomplete_coverage\", message: \"summary lineage is not ready\" } };\n      if (active && node.sources.some((source) => !active.has(sourceKey(source.entryId, source.contentHash)))) {\n        return { entries: [], next: null, error: { code: \"stale_pointer\", message: \"summary is outside the active branch\" } };\n      }\n    }\n    const expected = typeof args.expectedSourceHash === \"string\" ? args.expectedSourceHash : undefined;\n    if (expected && expected !== node.sourceHash) {\n      return { entries: [], next: null, error: { code: \"stale_pointer\", message: \"summary source hash changed\", expectedSourceHash: expected, actualSourceHash: node.sourceHash } };\n    }\n    const expectedLineage = typeof args.expectedLineageFingerprint === \"string\" ? args.expectedLineageFingerprint : undefined;\n    const actualLineage = node.lineageFingerprint ?? null;\n    if (expectedLineage !== undefined && expectedLineage !== actualLineage) {\n      return { entries: [], next: null, error: { code: \"stale_pointer\", message: \"summary active lineage changed\", expectedLineageFingerprint: expectedLineage, actualLineageFingerprint: actualLineage } };\n    }\n    const offset = clampInteger(args.entryOffset, 0, Number.MAX_SAFE_INTEGER, 0);\n    const textOffset = clampInteger(args.textOffset, 0, Number.MAX_SAFE_INTEGER, 0);\n    const maxEntries = clampInteger(args.maxEntries, 1, SUMMARY_EXPAND_MAX_ENTRIES, SUMMARY_EXPAND_DEFAULT_ENTRIES);\n    const maxChars = clampInteger(args.maxChars, 256, SUMMARY_EXPAND_MAX_CHARS, SUMMARY_EXPAND_DEFAULT_CHARS);\n    const descent = node.sources.length > 0\n      ? this.constituentEntries(node, branches, active)\n      : this.childEntries(node, branches);\n    const total = descent.items.length;\n    const refused = (error: Record<string, unknown>): Record<string, unknown> => ({\n      session: address,\n      sourceHash: node.sourceHash,\n      branches,\n      lineageFingerprint: actualLineage,\n      total,\n      entryCount: total,\n      entries: [],\n      next: null,\n      error,\n    });\n    const selection = resolveDescentSelection(descent.items, args);\n    if (\"error\" in selection) return refused(selection.error);\n    const selected = selection.selected;\n    if (offset > selected.length) {\n      return refused({\n        code: \"index_out_of_bounds\",\n        message: `Entry offset ${offset} is outside 0..${selected.length}.`,\n        entryCount: total,\n      });\n    }\n    if (offset < selected.length && textOffset > selected[offset]!.item.text.length) {\n      return refused({\n        code: \"text_offset_out_of_bounds\",\n        message: `Text offset ${textOffset} exceeds entry #${selected[offset]!.index} length ${selected[offset]!.item.text.length}.`,\n        textLength: selected[offset]!.item.text.length,\n      });\n    }\n    const entries: Array<Record<string, unknown>> = [];\n    let cursor = offset;\n    let start = textOffset;\n    let budget = maxChars;\n    while (cursor < selected.length && entries.length < maxEntries && budget > 0) {\n      const { item, index } = selected[cursor]!;\n      let stop = Math.min(item.text.length, start + budget);\n      if (stop < item.text.length && isLowSurrogate(item.text.charCodeAt(stop))) {\n        stop = stop - 1 > start ? stop - 1 : Math.min(item.text.length, stop + 1);\n      }\n      const text = item.text.slice(start, stop);\n      const end = start + text.length;\n      const complete = end >= item.text.length;\n      entries.push({\n        index,\n        entryId: item.entryId,\n        parentId: item.parentId,\n        type: item.type,\n        role: item.role,\n        timestamp: item.timestamp,\n        isError: false,\n        text,\n        textRange: { start, end, total: item.text.length, complete },\n        anchor: true,\n        address: item.address,\n        sourceHash: item.sourceHash,\n        follow: {\n          ref: \"memory.expand\",\n          args: { session: item.address, branches, expectedSourceHash: item.sourceHash },\n        },\n      });\n      budget -= text.length;\n      if (!complete) {\n        start = end;\n        break;\n      }\n      cursor += 1;\n      start = 0;\n    }\n    return {\n      session: address,\n      sourceHash: node.sourceHash,\n      branches,\n      lineageFingerprint: actualLineage,\n      node: {\n        nodeId: node.nodeId,\n        sessionId: node.sessionId,\n        kind: node.kind ?? (node.sources.length > 0 ? \"leaf\" : \"condensed\"),\n        state: node.state,\n        text: node.text,\n        sourceHash: node.sourceHash,\n        children: node.children,\n        sources: node.sources,\n        createdAt: node.createdAt,\n      },\n      total,\n      entryCount: total,\n      entries,\n      next: cursor < selected.length\n        ? { ref: \"memory.expand\", args: { ...args, entryOffset: cursor, textOffset: start } }\n        : null,\n      ...(descent.unavailable === 0\n        ? {}\n        : { error: { code: \"incomplete_coverage\", message: `${descent.unavailable} constituent source(s) are unavailable` } }),\n    };\n  }\n\n  private rememberDescent(key: string, items: DescentItem[]): void {\n    this.descents.delete(key);\n    this.descents.set(key, items);\n    while (this.descents.size > SUMMARY_DESCENT_CACHE_LIMIT) {\n      const oldest = this.descents.keys().next().value;\n      if (oldest === undefined) break;\n      this.descents.delete(oldest);\n    }\n  }\n\n  private constituentEntries(\n    node: LcmSummaryNode,\n    branches: \"active\" | \"all\",\n    active: Set<string> | undefined,\n  ): { items: DescentItem[]; unavailable: number } {\n    const reachable: LcmSummaryNode[\"sources\"] = [];\n    let unavailable = 0;\n    for (const source of node.sources) {\n      const key = sourceKey(source.entryId, source.contentHash);\n      if (branches === \"active\" && active && !active.has(key)) {\n        unavailable += 1;\n        continue;\n      }\n      reachable.push(source);\n    }\n    const descentKey = hash([\n      node.nodeId,\n      node.sessionId,\n      node.sourceHash,\n      ...reachable.map((source) => `${source.entryId}:${source.revision}:${source.contentHash}`),\n    ].join(\"|\"));\n    const memoized = this.descents.get(descentKey);\n    if (memoized) return { items: memoized, unavailable };\n    const items: DescentItem[] = [];\n    let missing = 0;\n    for (const source of reachable) {\n      const entry = this.options.ledger.readRawEntry(node.sessionId, source.entryId, source.revision);\n      if (!entry) {\n        missing += 1;\n        continue;\n      }\n      items.push({\n        entryId: entry.entryId,\n        parentId: entry.parentEntryId ?? null,\n        type: \"raw\",\n        role: entry.role,\n        timestamp: entry.createdAt,\n        text: entry.content,\n        address: lcmRawAddress(entry),\n        sourceHash: entry.payloadHash,\n      });\n    }\n    items.sort((left, right) => left.timestamp - right.timestamp\n      || left.entryId.localeCompare(right.entryId)\n      || left.address.localeCompare(right.address));\n    if (missing === 0) this.rememberDescent(descentKey, items);\n    return { items, unavailable: unavailable + missing };\n  }\n\n  private childEntries(\n    node: LcmSummaryNode,\n    branches: \"active\" | \"all\",\n  ): { items: DescentItem[]; unavailable: number } {\n    const items: DescentItem[] = [];\n    let unavailable = 0;\n    for (const childId of node.children) {\n      const child = this.options.summaries.getNode(childId);\n      if (!child || child.state !== \"ready\") {\n        unavailable += 1;\n        continue;\n      }\n      if (branches === \"active\") {\n        const active = activeSourceSet(activeBinding(this.options, child.sessionId));\n        if (active && child.sources.some((source) => !active.has(sourceKey(source.entryId, source.contentHash)))) {\n          unavailable += 1;\n          continue;\n        }\n      }\n      items.push({\n        entryId: child.nodeId,\n        parentId: node.nodeId,\n        type: \"summary\",\n        role: \"compactionSummary\",\n        timestamp: child.createdAt,\n        text: child.text,\n        address: lcmSummaryAddress(child.nodeId),\n        sourceHash: child.sourceHash,\n      });\n    }\n    items.sort((left, right) => left.timestamp - right.timestamp || left.entryId.localeCompare(right.entryId));\n    return { items, unavailable };\n  }\n\n  private expandRaw(\n    address: string,\n    args: Record<string, unknown>,\n    branches: \"active\" | \"all\",\n  ): Record<string, unknown> {\n    const parts = address.split(\":\");\n    if (parts.length < 4 || parts[0] !== \"lcm.raw\") return { entries: [], next: null, error: { code: \"invalid_address\", message: \"invalid LCM raw address\" } };\n    const revision = Number(parts.at(-1));\n    const entryId = parts.slice(2, -1).join(\":\");\n    const sessionId = parts[1];\n    if (!sessionId || !entryId || !Number.isSafeInteger(revision) || revision < 1) return { entries: [], next: null, error: { code: \"invalid_address\", message: \"invalid LCM raw address\" } };\n    const entry = this.options.ledger.readRawEntry(sessionId, entryId, revision);\n    if (!entry) return { entries: [], next: null, error: { code: \"stale_pointer\", message: \"raw source is unavailable\" } };\n    const binding = activeBinding(this.options, sessionId);\n    const allowed = activeAllowed(branches, binding, sourceKey(entryId, entry.contentHash));\n    if (!allowed.allowed) return { entries: [], next: null, error: { code: allowed.reason === \"source_off_active_branch\" ? \"stale_pointer\" : \"incomplete_coverage\", message: allowed.reason ?? \"raw lineage is unavailable\" } };\n    const payload = JSON.parse(entry.payloadJson) as Record<string, unknown>;\n    const sourceHash = hashLcmPayload(payload);\n    const expected = typeof args.expectedSourceHash === \"string\" ? args.expectedSourceHash : undefined;\n    if (expected && expected !== sourceHash) return { entries: [], next: null, error: { code: \"stale_pointer\", message: \"raw source hash changed\", expectedSourceHash: expected, actualSourceHash: sourceHash } };\n    const max = typeof args.maxChars === \"number\" ? Math.min(24000, Math.max(256, Math.floor(args.maxChars))) : 20000;\n    const start = typeof args.textOffset === \"number\" ? Math.max(0, Math.floor(args.textOffset)) : 0;\n    const text = entry.content.slice(start, start + max);\n    const complete = start + text.length >= entry.content.length;\n    return {\n      session: address,\n      sourceHash,\n      branches,\n      entryCount: 1,\n      entries: [{\n        index: 0,\n        entryId: entry.entryId,\n        parentId: entry.parentEntryId,\n        type: \"raw\",\n        role: entry.role,\n        timestamp: entry.createdAt,\n        isError: false,\n        text,\n        textRange: { start, end: start + text.length, total: entry.content.length, complete },\n        anchor: true,\n        address,\n        sourceHash,\n        structuredContent: payload,\n      }],\n      next: complete ? null : { ref: \"memory.expand\", args: { ...args, textOffset: start + text.length } },\n    };\n  }\n}\n\ninterface SelectedDescentItem {\n  item: DescentItem;\n  index: number;\n}\n\ninterface DescentItem {\n  entryId: string;\n  parentId: string | null;\n  type: \"raw\" | \"summary\";\n  role: string;\n  timestamp: number;\n  text: string;\n  address: string;\n  sourceHash: string;\n}\n", "import type { FabricActionDescriptor } from \"../protocol.js\";\n\n// Argument-shape normalization shared by the stable Fabric providers,\n// mirroring the OMP core tool architecture:\n//\n// 1. prepareArguments canonicalizes near-miss argument spellings at the\n//    registry prepare stage \u2014 aliases resolve to the canonical key (which\n//    wins on conflict), value spellings repair, numeric strings coerce for\n//    schema-declared numeric fields, and nullish values of declared\n//    optionals are stripped.\n// 2. validateArguments then owns the didactic failure tier: required\n//    canonical keys are enforced and unknown keys fail\n//    additionalProperties: false validation with the offending path named.\n//\n// Most of the repair surface is derived from each action's inputSchema\n// rather than maintained by hand: key casing/spacing variants and\n// singular/plural near-misses come from the declared property names,\n// numeric coercion from the declared property types, and enum-value\n// repairs (casing variants plus the shared synonym classes below) from the\n// declared enum members. Only genuinely semantic synonyms need explicit\n// vocabulary: the shared KEY_SYNONYM_CLASSES / ENUM_VALUE_CLASSES classes\n// here, and provider-local `values` tables where the schema spells a\n// concept as a free string instead of an enum (memory scope).\n\ninterface JsonSchemaObject {\n  type?: unknown;\n  properties?: unknown;\n  enum?: unknown;\n  items?: unknown;\n  oneOf?: unknown;\n  anyOf?: unknown;\n}\n\nexport interface ArgNormalizationSpec {\n  // Explicit escape-hatch rows. Prefer derivation or a shared synonym\n  // class; keep entries here only for action-local semantics.\n  aliases?: Readonly<Record<string, string>>;\n  numerics?: readonly string[];\n  numericArrays?: readonly string[];\n  values?: Readonly<Record<string, Readonly<Record<string, unknown>>>>;\n  // Declared property names whose nullish values are stripped before\n  // validation. Derived from the descriptor schema when omitted.\n  knownKeys?: readonly string[];\n}\n\nexport type ActionArgNormalizer = (\n  actionName: string,\n  args: Record<string, unknown>,\n) => Record<string, unknown>;\n\n// Casing/spacing/underscore-insensitive key and value form, e.g.\n// \"requested_by\", \"requestedBy\", and \"REQUESTED-BY\" all share one form.\nconst normalizeForm = (key: string): string =>\n  key.toLowerCase().replace(/[^a-z0-9]/g, \"\");\n\n// Semantic near-miss vocabulary shared by every stable provider. A spilled\n// key belonging to a class repairs to a declared canonical key only when\n// exactly one member of that class is declared by the action's schema \u2014\n// ambiguity (or absence) leaves the key untouched so the validate stage\n// owns its failure. `id` deliberately appears in several classes: the\n// declared members of each action's schema disambiguate which repair fires\n// (memory.expand takes a session id; agents.wait takes an agent id).\nconst KEY_SYNONYM_CLASSES: ReadonlyArray<ReadonlyArray<string>> = [\n  [\"session\", \"sessionId\", \"id\", \"file\", \"path\"],\n  [\"hypothesisId\", \"id\"],\n  [\"id\", \"agentId\", \"actorId\", \"runId\"],\n  [\"query\", \"q\"],\n  [\"limit\", \"max\", \"pageSize\"],\n  [\"task\", \"prompt\", \"instructions\"],\n  [\"label\", \"labels\", \"name\", \"title\"],\n  [\"summary\", \"description\"],\n  [\"text\", \"message\", \"body\"],\n  [\"check\", \"command\", \"cmd\", \"script\", \"predicate\"],\n  [\"files\", \"paths\"],\n  [\"ifVersion\", \"versionRef\", \"version\"],\n  [\"indices\", \"index\"],\n];\n\nconst KEY_CLASS_FORMS = KEY_SYNONYM_CLASSES.map(\n  (cls) => new Set(cls.map(normalizeForm)),\n);\n\n// Synonym classes for schema enum values, applied only when the declared\n// enum contains exactly one class member. Scope spellings such as `cwd` \u2192\n// \"project\" repair wherever an enum spells that concept this way; a schema\n// whose enum lacks the concept keeps the value untouched for validation.\nconst ENUM_VALUE_CLASSES: ReadonlyArray<ReadonlyArray<string>> = [\n  [\"project\", \"cwd\", \"repo\", \"repository\", \"workspace\", \"checkout\", \"tree\"],\n  [\"global\", \"all\"],\n  [\"permanent\", \"pinned\", \"sticky\", \"durable\"],\n];\n\nconst VALUE_CLASS_FORMS = ENUM_VALUE_CLASSES.map(\n  (cls) => new Set(cls.map(normalizeForm)),\n);\n\ntype NumericKind = \"scalar\" | \"array\" | undefined;\n\nconst numericKind = (property: unknown): NumericKind => {\n  if (!property || typeof property !== \"object\") return undefined;\n  const schema = property as JsonSchemaObject;\n  if (schema.type === \"number\" || schema.type === \"integer\") return \"scalar\";\n  if (schema.type === \"array\") {\n    const items = schema.items;\n    if (\n      items &&\n      typeof items === \"object\" &&\n      ((items as JsonSchemaObject).type === \"number\" ||\n        (items as JsonSchemaObject).type === \"integer\")\n    ) {\n      return \"array\";\n    }\n  }\n  return undefined;\n};\n\nconst stringEnumValues = (property: unknown): readonly string[] | undefined => {\n  if (!property || typeof property !== \"object\") return undefined;\n  const schema = property as JsonSchemaObject;\n  if (Array.isArray(schema.enum)) {\n    const values = schema.enum.filter(\n      (entry): entry is string => typeof entry === \"string\",\n    );\n    return values.length > 0 ? values : undefined;\n  }\n  for (const branch of [schema.oneOf, schema.anyOf]) {\n    if (!Array.isArray(branch)) continue;\n    const consts = branch\n      .map((entry) =>\n        entry && typeof entry === \"object\"\n          ? (entry as { const?: unknown }).const\n          : undefined,\n      )\n      .filter((entry): entry is string => typeof entry === \"string\");\n    if (consts.length > 0) return consts;\n  }\n  return undefined;\n};\n\n// form \u2192 enum value. Exact forms of declared members win; class synonyms\n// fill in only when exactly one declared member belongs to the class.\nconst deriveEnumValueMap = (\n  values: readonly string[],\n): Map<string, string> => {\n  const map = new Map<string, string>();\n  const seen = new Map<string, string | undefined>();\n  for (const value of values) {\n    const form = normalizeForm(value);\n    seen.set(form, seen.has(form) ? undefined : value);\n  }\n  for (const [form, value] of seen) if (value !== undefined) map.set(form, value);\n  for (const classForms of VALUE_CLASS_FORMS) {\n    const members = values.filter((value) => classForms.has(normalizeForm(value)));\n    if (members.length !== 1) continue;\n    const [hit] = members as [string];\n    for (const form of classForms) {\n      if (form !== normalizeForm(hit) && !map.has(form)) map.set(form, hit);\n    }\n  }\n  return map;\n};\n\ntype DerivedAction = {\n  declared: Set<string>;\n  declaredForms: Map<string, string>;\n  singulars: Map<string, string>;\n  numerics: Set<string>;\n  numericArrays: Set<string>;\n  values: Map<string, Map<string, unknown>>;\n  aliases?: Readonly<Record<string, string>> | undefined;\n};\n\n// The value-column meaning of the schema, precomputed once per action.\nconst deriveAction = (\n  inputSchema: JsonSchemaObject | undefined,\n  explicit: ArgNormalizationSpec | undefined,\n): DerivedAction => {\n  const properties =\n    inputSchema && typeof inputSchema === \"object\" &&\n    inputSchema.properties &&\n    typeof inputSchema.properties === \"object\"\n      ? (inputSchema.properties as Record<string, unknown>)\n      : undefined;\n  const declared = new Set(Object.keys(properties ?? {}));\n  const declaredForms = new Map<string, string>();\n  const ambiguousForms = new Set<string>();\n  for (const key of declared) {\n    const form = normalizeForm(key);\n    if (declaredForms.has(form)) {\n      ambiguousForms.add(form);\n      declaredForms.delete(form);\n    } else if (!ambiguousForms.has(form)) {\n      declaredForms.set(form, key);\n    }\n  }\n  const singulars = new Map<string, string>();\n  for (const key of declared) {\n    const form = normalizeForm(key);\n    if (!form.endsWith(\"s\")) continue;\n    const singular = form.slice(0, -1);\n    if (!singular || declaredForms.has(singular) || singular === form) continue;\n    if (singulars.get(singular) !== undefined) singulars.delete(singular);\n    else singulars.set(singular, key);\n  }\n  for (const form of ambiguousForms) singulars.delete(form);\n\n  const numerics = new Set(explicit?.numerics ?? []);\n  const numericArrays = new Set(explicit?.numericArrays ?? []);\n  const values = new Map<string, Map<string, unknown>>();\n  if (properties) {\n    for (const [key, property] of Object.entries(properties)) {\n      const kind = numericKind(property);\n      if (kind === \"scalar\") numerics.add(key);\n      else if (kind === \"array\") numericArrays.add(key);\n      const enumValues = stringEnumValues(property);\n      if (enumValues) values.set(key, new Map(deriveEnumValueMap(enumValues)));\n    }\n  }\n  for (const [key, remaps] of Object.entries(explicit?.values ?? {})) {\n    const map = values.get(key) ?? new Map<string, unknown>();\n    for (const [spelling, target] of Object.entries(remaps)) {\n      map.set(normalizeForm(spelling), target);\n    }\n    values.set(key, map);\n  }\n  return { declared, declaredForms, singulars, numerics, numericArrays, values, aliases: explicit?.aliases };\n};\n\nconst lexiconRepair = (\n  form: string,\n  declaredForms: Map<string, string>,\n): string | undefined => {\n  const candidates = new Set<string>();\n  for (const classForms of KEY_CLASS_FORMS) {\n    if (!classForms.has(form)) continue;\n    for (const [declaredForm, declaredKey] of declaredForms) {\n      if (declaredForm !== form && classForms.has(declaredForm)) {\n        candidates.add(declaredKey);\n      }\n    }\n  }\n  return candidates.size === 1 ? [...candidates][0] : undefined;\n};\n\n/** Unique declared key for a spilled spelling, or undefined when already\n * canonical / ambiguous / unmatched. Used by the catalog repair compiler. */\nexport const uniqueDeclaredKeyForSpelling = (\n  spilled: string,\n  declared: readonly string[],\n): string | undefined => {\n  if (declared.includes(spilled)) return undefined;\n  const derived = deriveAction(\n    {\n      type: \"object\",\n      properties: Object.fromEntries(declared.map((key) => [key, {}])),\n    },\n    undefined,\n  );\n  const form = normalizeForm(spilled);\n  const canonical =\n    derived.declaredForms.get(form) ??\n    derived.singulars.get(form) ??\n    lexiconRepair(form, derived.declaredForms);\n  return canonical && canonical !== spilled ? canonical : undefined;\n};\n\nconst applyDerived = (\n  args: Record<string, unknown>,\n  derived: DerivedAction,\n): Record<string, unknown> => {\n  const out: Record<string, unknown> = { ...args };\n\n  // Explicit action-local aliases first, then derived repairs. Both obey\n  // canonical-wins: the canonical key keeps an already-supplied value and\n  // the spelling variant is dropped either way.\n  const repair = (alias: string, canonical: string) => {\n    if (!(alias in out) || alias === canonical) return;\n    if (!(canonical in out)) out[canonical] = out[alias];\n    delete out[alias];\n  };\n  for (const [alias, canonical] of Object.entries(derived.aliases ?? {})) {\n    repair(alias, canonical);\n  }\n  for (const key of [...Object.keys(out)]) {\n    if (derived.declared.has(key)) continue;\n    const form = normalizeForm(key);\n    const canonical =\n      derived.declaredForms.get(form) ??\n      derived.singulars.get(form) ??\n      lexiconRepair(form, derived.declaredForms);\n    if (canonical && canonical !== key) repair(key, canonical);\n  }\n\n  for (const key of derived.numerics) {\n    const value = out[key];\n    if (typeof value === \"string\" && value.trim() !== \"\" && !Number.isNaN(Number(value))) {\n      out[key] = Number(value);\n    }\n  }\n  for (const key of derived.numericArrays) {\n    const value = out[key];\n    if (Array.isArray(value)) {\n      out[key] = value.map((entry) =>\n        typeof entry === \"string\" && entry.trim() !== \"\" && !Number.isNaN(Number(entry))\n          ? Number(entry)\n          : entry,\n      );\n    }\n  }\n  for (const [key, remaps] of derived.values) {\n    const value = out[key];\n    if (typeof value === \"string\") {\n      const next = remaps.get(normalizeForm(value));\n      if (next !== undefined) out[key] = next;\n    }\n  }\n  if (derived.declared.size > 0) {\n    for (const key of Object.keys(out)) {\n      if (derived.declared.has(key) && (out[key] === null || out[key] === undefined)) {\n        delete out[key];\n      }\n    }\n  }\n  return out;\n};\n\n// Low-level explicit-spec normalizer. Used directly by tests and as the\n// shared mechanics for per-key aliases, value spellings, numeric strings,\n// and nullish stripping; actionArgNormalizer layers schema derivation and\n// the shared synonym lexicon on top.\nexport const normalizeActionArgs = (\n  args: Record<string, unknown>,\n  spec: ArgNormalizationSpec,\n): Record<string, unknown> => {\n  const derived: DerivedAction = {\n    // The low-level path strips nullish values only for explicit knownKeys;\n    // schema-derived declared keys come from actionArgNormalizer.\n    declared: new Set(spec.knownKeys ?? []),\n    declaredForms: new Map(),\n    singulars: new Map(),\n    numerics: new Set(spec.numerics ?? []),\n    numericArrays: new Set(spec.numericArrays ?? []),\n    values: new Map(\n      Object.entries(spec.values ?? {}).map(([key, remaps]) => [\n        key,\n        new Map(\n          Object.entries(remaps).map(([spelling, target]) => [normalizeForm(spelling), target]),\n        ),\n      ]),\n    ),\n    aliases: spec.aliases,\n  };\n  if (!args || typeof args !== \"object\" || Array.isArray(args)) return args;\n  return applyDerived(args, derived);\n};\n\n// Build a provider prepareArguments hook. Repair behavior derives from each\n// action's inputSchema (declared key forms, singular/plural variants,\n// numeric property types, enum value spellings) plus the shared synonym\n// lexicon; the residual table holds only action-local semantics the schema\n// cannot express.\nexport const actionArgNormalizer = (\n  describeActions: () => ReadonlyArray<Pick<FabricActionDescriptor, \"name\" | \"inputSchema\">>,\n  table: Record<string, ArgNormalizationSpec> = {},\n): ActionArgNormalizer => {\n  const derived = new Map<string, DerivedAction>();\n  for (const descriptor of describeActions()) {\n    derived.set(\n      descriptor.name,\n      deriveAction(\n        descriptor.inputSchema as JsonSchemaObject | undefined,\n        table[descriptor.name],\n      ),\n    );\n  }\n  return (actionName, args) => {\n    if (!args || typeof args !== \"object\" || Array.isArray(args)) return args;\n    const action = derived.get(actionName);\n    return action ? applyDerived(args, action) : args;\n  };\n};\n"],
+  "mappings": ";;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AAOA,OAAO,QAAQ;AACf,OAAO,UAAU;;;ACSV,IAAM,2BAA2B;AACjC,IAAM,uBAAuB;AAC7B,IAAM,+BAA+B;AACrC,IAAM,2BAA2B;AACjC,IAAM,4BAA4B;AA6HzC,IAAM,kBAAkB,CAAC,OAAkC,MAAM,QAAuB;AACtF,MAAI,UAAU,UAAa,UAAU,KAAM,QAAO;AAClD,SAAO,MAAM,UAAU,MAAM,QAAQ,GAAG,MAAM,MAAM,GAAG,KAAK,IAAI,GAAG,MAAM,CAAC,CAAC,CAAC;AAC9E;AAEA,IAAM,YAAY,CAAC,MAAc,OAAe,QAAwB;AACtE,MAAI,YAAY,KAAK,IAAI,GAAG,KAAK;AACjC,MAAI,UAAU,KAAK,IAAI,KAAK,QAAQ,GAAG;AACvC,QAAM,YAAY,KAAK,WAAW,SAAS;AAC3C,MAAI,YAAY,KAAK,aAAa,SAAU,aAAa,MAAQ,cAAa;AAC9E,QAAM,UAAU,KAAK,WAAW,UAAU,CAAC;AAC3C,MAAI,UAAU,KAAK,UAAU,WAAW,SAAU,WAAW,MAAQ,YAAW;AAChF,SAAO,KAAK,MAAM,WAAW,OAAO;AACtC;AAEA,IAAM,gBAAgB,CACpB,MACA,OACA,cACW;AACX,MAAI,CAAC,MAAO,QAAO;AACnB,QAAM,aAAa,sBAAsB,IAAI;AAC7C,MAAI,cAAc,UAAU;AAC1B,UAAM,SAAS,sBAAsB,MAAM,KAAK,CAAC;AACjD,WAAO,KAAK,IAAI,GAAG,WAAW,QAAQ,MAAM,CAAC;AAAA,EAC/C;AACA,MAAI,cAAc,WAAW;AAC3B,UAAM,QAAQ,CAAC,GAAG,IAAI,IAAI,gBAAgB,KAAK,CAAC,CAAC,EAAE;AAAA,MAAK,CAAC,MAAM,UAC7D,MAAM,SAAS,KAAK,UAAU,KAAK,cAAc,KAAK;AAAA,IACxD;AACA,eAAW,QAAQ,OAAO;AACxB,YAAM,QAAQ,WAAW,QAAQ,IAAI;AACrC,UAAI,SAAS,EAAG,QAAO;AAAA,IACzB;AAAA,EACF;AACA,SAAO;AACT;AAEA,IAAM,cAAc,CAClB,MACA,OACA,WACA,aACY;AACZ,MAAI,KAAK,UAAU,SAAU,QAAO,EAAE,MAAM,WAAW,MAAM;AAC7D,QAAM,SAAS,cAAc,MAAM,OAAO,SAAS;AACnD,QAAM,iBAAiB,KAAK,MAAM,WAAW,CAAC;AAC9C,MAAI,QAAQ,KAAK,IAAI,GAAG,SAAS,cAAc;AAC/C,MAAI,MAAM,KAAK,IAAI,KAAK,QAAQ,QAAQ,QAAQ;AAChD,MAAI,MAAM,QAAQ,SAAU,SAAQ,KAAK,IAAI,GAAG,MAAM,QAAQ;AAC9D,QAAM,OAAO,UAAU,MAAM,OAAO,GAAG;AACvC,SAAO;AAAA,IACL,MAAM,GAAG,QAAQ,IAAI,WAAM,EAAE,GAAG,IAAI,GAAG,MAAM,KAAK,SAAS,WAAM,EAAE;AAAA,IACnE,WAAW;AAAA,EACb;AACF;AAEA,IAAM,oBAAoB,CAAC,aAAiD;AAAA,EAC1E,WAAW,gBAAgB,QAAQ,SAAS,KAAK;AAAA,EACjD,aAAa,QAAQ;AAAA,EACrB,YAAY,QAAQ;AAAA,EACpB,UAAU,QAAQ;AAAA,EAClB,oBAAoB,QAAQ;AAAA,EAC5B,MAAM,QAAQ;AAChB;AAEA,IAAM,mBAAmB,CAAC,YAA4C;AAAA,EACpE,WAAW,gBAAgB,OAAO,SAAS,KAAK;AAAA,EAChD,aAAa,OAAO;AAAA,EACpB,YAAY,OAAO;AAAA,EACnB,UAAU,OAAO;AAAA,EACjB,oBAAoB,OAAO;AAAA,EAC3B,MAAM;AACR;AAEA,IAAM,aAAa,CACjB,QACA,WAC0B;AAAA,EAC1B,SAAS,OAAO;AAAA,EAChB,oBAAoB,OAAO;AAAA,EAC3B,4BAA4B,OAAO;AAAA,EACnC,UAAU,OAAO;AAAA,EACjB,SAAS,CAAC,MAAM,KAAK;AACvB;AAEA,IAAM,WAAW,CACf,SACA,MACA,OACA,WACA,iBACyB;AACzB,QAAM,QAAQ,KAAK;AACnB,QAAM,SAAS,kBAAkB,OAAO;AACxC,QAAM,UAAU,YAAY,MAAM,MAAM,OAAO,WAAW,YAAY;AACtE,SAAO;AAAA,IACL,MAAM;AAAA,IACN,WAAW,OAAO;AAAA,IAClB,MAAM,OAAO;AAAA,IACb,OAAO,MAAM;AAAA,IACb,SAAS,gBAAgB,MAAM,OAAO;AAAA,IACtC,UAAU,gBAAgB,MAAM,QAAQ;AAAA,IACxC,kBAAkB,gBAAgB,MAAM,gBAAgB;AAAA,IACxD,MAAM,gBAAgB,MAAM,IAAI,KAAK;AAAA,IACrC,MAAM,gBAAgB,MAAM,IAAI;AAAA,IAChC,MAAM,gBAAgB,MAAM,QAAQ;AAAA,IACpC,KAAK,gBAAgB,MAAM,GAAG;AAAA,IAC9B,UAAU,gBAAgB,MAAM,QAAQ;AAAA,IACxC,QAAQ,gBAAgB,MAAM,MAAM;AAAA,IACpC,WAAW,MAAM;AAAA,IACjB,SAAS,MAAM;AAAA,IACf,GAAI,MAAM,UAAU,EAAE,SAAS,MAAM,QAAQ,IAAI,CAAC;AAAA,IAClD,OAAO,KAAK;AAAA,IACZ,SAAS,QAAQ;AAAA,IACjB,WAAW,QAAQ,aAAa,MAAM;AAAA,IACtC,QAAQ,EAAE,KAAK,iBAAiB,MAAM,WAAW,QAAQ,KAAK,EAAE;AAAA,EAClE;AACF;AAEA,IAAM,gBAAgB,CACpB,QACA,YACyB;AACzB,QAAM,EAAE,QAAQ,SAAS,YAAY,aAAa,GAAG,KAAK,IAAI;AAC9D,SAAO;AAAA,IACL,GAAG;AAAA,IACH,OAAO,WAAW,OAAO,WAAW;AAAA,IACpC,UAAU,OAAO;AAAA,IACjB,oBAAoB,OAAO;AAAA,IAC3B,4BAA4B,OAAO;AAAA,EACrC;AACF;AAEA,IAAM,aAAa,CACjB,QACA,YAC2B;AAC3B,QAAM,SAAS,iBAAiB,MAAM;AACtC,SAAO;AAAA,IACL,MAAM;AAAA,IACN,WAAW,OAAO;AAAA,IAClB,MAAM;AAAA,IACN,KAAK,gBAAgB,OAAO,KAAK,IAAK,KAAK;AAAA,IAC3C,eAAe,OAAO;AAAA,IACtB,OAAO,OAAO;AAAA,IACd,cAAc,OAAO;AAAA,IACrB,0BAA0B,OAAO;AAAA,IACjC,QAAQ,EAAE,KAAK,iBAAiB,MAAM,cAAc,QAAQ,OAAO,EAAE;AAAA,EACvE;AACF;AAMA,IAAM,uBAAuB,oBAAI,QAAyC;AAE1E,IAAM,oBAAoB,CAAC,WAA4C;AACrE,QAAM,SAAS,qBAAqB,IAAI,MAAM;AAC9C,MAAI,OAAQ,QAAO;AACnB,QAAM,aAAgC,CAAC;AACvC,aAAW,QAAQ,OAAO,OAAO;AAC/B,QAAI,KAAK,SAAS,UAAU;AAC1B,iBAAW,KAAK,EAAE,MAAM,WAAW,QAAQ,KAAK,OAAO,CAAC;AACxD;AAAA,IACF;AACA,eAAW,SAAS,KAAK,QAAQ,SAAS;AACxC,UAAI,MAAM,QAAS,YAAW,KAAK,EAAE,MAAM,SAAS,SAAS,KAAK,SAAS,MAAM,MAAM,CAAC;AAAA,IAC1F;AAAA,EACF;AACA,aAAW,KAAK,CAAC,MAAM,UAAU;AAC/B,UAAM,YAAY,KAAK,SAAS,UAAU,KAAK,KAAK,QAAQ,KAAK,OAAO;AACxE,UAAM,aAAa,MAAM,SAAS,UAAU,MAAM,KAAK,QAAQ,MAAM,OAAO;AAC5E,QAAI,eAAe,UAAW,QAAO,aAAa;AAClD,UAAM,YAAY,KAAK,SAAS,UAAU,KAAK,QAAQ,eAAe,KAAK,OAAO;AAClF,UAAM,aAAa,MAAM,SAAS,UAAU,MAAM,QAAQ,eAAe,MAAM,OAAO;AACtF,QAAI,eAAe,UAAW,QAAO,aAAa;AAClD,QAAI,KAAK,SAAS,MAAM,KAAM,QAAO,KAAK,SAAS,UAAU,KAAK;AAClE,QAAI,KAAK,SAAS,WAAW,MAAM,SAAS,SAAS;AACnD,UAAI,KAAK,KAAK,MAAM,UAAU,MAAM,KAAK,MAAM,OAAO;AACpD,eAAO,KAAK,KAAK,MAAM,QAAQ,MAAM,KAAK,MAAM;AAAA,MAClD;AACA,aAAO,eAAe,KAAK,QAAQ,aAAa,MAAM,QAAQ,WAAW;AAAA,IAC3E;AACA,QAAI,KAAK,SAAS,aAAa,MAAM,SAAS,WAAW;AACvD,aAAO,eAAe,KAAK,OAAO,aAAa,MAAM,OAAO,WAAW;AAAA,IACzE;AACA,WAAO;AAAA,EACT,CAAC;AACD,uBAAqB,IAAI,QAAQ,UAAU;AAC3C,SAAO;AACT;AAEA,IAAM,uBAAuB,CAC3B,WACA,OACA,WACA,cACA,YACoB,UAAU,SAAS,YACrC,WAAW,UAAU,QAAQ,OAAO,IACpC,SAAS,UAAU,SAAS,UAAU,MAAM,OAAO,WAAW,YAAY;AAE9E,IAAM,oBAAoB,CACxB,SACA,WACyB;AACzB,QAAM,EAAE,QAAQ,SAAS,GAAG,KAAK,IAAI;AACrC,SAAO,EAAE,GAAG,MAAM,OAAO;AAC3B;AAEO,IAAM,gBAAgB,CAAC,UAAyD;AACrF,QAAM,aAAa,kBAAkB,MAAM,MAAM;AACjD,QAAM,QAAQ,MAAM,UAAU;AAC9B,MAAI,WAAW,WAAW,MAAM,OAAO,QAAQ,MAAM,QAAQ;AAE7D,QAAM,QAAQ,CAAC,mBAA4D;AACzE,UAAM,OAAO,eAAe;AAAA,MAAI,CAAC,cAC/B;AAAA,QACE;AAAA,QACA,MAAM;AAAA,QACN,MAAM;AAAA,QACN,MAAM;AAAA,QACN,MAAM;AAAA,MACR;AAAA,IACF;AACA,WAAO;AAAA,MACL,OAAO,WAAW;AAAA,MAClB;AAAA,MACA,MAAM,QAAQ,KAAK,SAAS,WAAW,SACnC,EAAE,KAAK,iBAAiB,MAAM,kBAAkB,MAAM,aAAa,QAAQ,KAAK,MAAM,EAAE,IACxF;AAAA,MACJ,UAAU,MAAM;AAAA,IAClB;AAAA,EACF;AAEA,MAAI,WAAW,MAAM,QAAQ;AAC7B,SAAO,SAAS,SAAS,KAAK,KAAK,UAAU,QAAQ,EAAE,SAAS,2BAA2B;AACzF,eAAW,SAAS,MAAM,GAAG,EAAE;AAC/B,eAAW,MAAM,QAAQ;AAAA,EAC3B;AACA,SAAO;AACT;;;ACrSA,IAAM,iCAAiC;AACvC,IAAM,6BAA6B;AACnC,IAAM,+BAA+B;AACrC,IAAM,2BAA2B;AACjC,IAAM,6BAA6B;AACnC,IAAM,8BAA8B;AAEpC,IAAM,iBAAiB,CACrB,OACA,MACA,UACmB;AACnB,QAAM,OAAO,gBAAgB,OAAO,MAAM,KAAK;AAC/C,MAAI,KAAK,SAAS,UAAU;AAC1B,WAAO,EAAE,SAAS,MAAM,MAAM,SAAS,MAAM,EAAE;AAAA,EACjD;AACA,MAAI,KAAK,SAAS,SAAS;AACzB,QAAI,OAAO,WAAW,KAAK,SAAS,MAAM,IAAI,iCAAiC;AAC7E,aAAO,EAAE,SAAS,MAAM,OAAO,SAAS,MAAM,GAAG,SAAS,0BAA0B;AAAA,IACtF;AACA,QAAI;AACJ,QAAI;AACF,cAAQ,IAAI,OAAO,KAAK,SAAS,IAAI;AAAA,IACvC,QAAQ;AACN,aAAO,EAAE,SAAS,MAAM,OAAO,SAAS,MAAM,GAAG,SAAS,gBAAgB;AAAA,IAC5E;AACA,WAAO,EAAE,SAAS,CAAC,SAAS,MAAM,KAAK,IAAI,GAAG,SAAS,CAAC,SAAU,MAAM,KAAK,IAAI,IAAI,IAAI,EAAG;AAAA,EAC9F;AACA,MAAI,KAAK,SAAS,UAAU;AAC1B,UAAM,SAAS,KAAK;AACpB,UAAM,MAAM,CAAC,SAA0B,sBAAsB,IAAI,EAAE,SAAS,MAAM;AAClF,WAAO,EAAE,SAAS,KAAK,SAAS,CAAC,SAAU,IAAI,IAAI,IAAI,IAAI,EAAG;AAAA,EAChE;AACA,QAAM,QAAQ,KAAK;AACnB,MAAI,MAAM,WAAW,EAAG,QAAO,EAAE,SAAS,MAAM,MAAM,SAAS,MAAM,EAAE;AACvE,QAAM,UAAU,CAAC,SAAyB;AACxC,UAAM,YAAY,IAAI,IAAI,gBAAgB,IAAI,CAAC;AAC/C,WAAO,MAAM,OAAO,CAAC,OAAO,SAAS,SAAS,UAAU,IAAI,IAAI,IAAI,IAAI,IAAI,CAAC;AAAA,EAC/E;AACA,SAAO,KAAK,UAAU,QAClB,EAAE,SAAS,CAAC,SAAS,QAAQ,IAAI,MAAM,MAAM,QAAQ,SAAS,QAAQ,IACtE,EAAE,SAAS,CAAC,SAAS,QAAQ,IAAI,IAAI,GAAG,SAAS,QAAQ;AAC/D;AAEA,IAAM,UAAU,CAAC,MAAc,MAAM,SAAkD;AAAA,EACrF,SAAS,KAAK,UAAU,MAAM,OAAO,KAAK,MAAM,GAAG,GAAG;AAAA,EACtD,WAAW,KAAK,SAAS;AAC3B;AAEA,IAAM,iBAAiB,CAAC,SAA0B,QAAQ,SAAU,QAAQ;AAE5E,IAAM,YAAY,CAAC,SAAiB,gBAAgC,GAAG,OAAO,IAAI,WAAW;AAE7F,IAAM,gBAAgB,CACpB,SACA,cACiC,QAAQ,mBAAmB,SAAS;AAEvE,IAAM,kBAAkB,CAAC,YACvB,SAAS,qBAAqB,SAAY,SAAY,IAAI,IAAI,QAAQ,gBAAgB;AAExF,IAAM,eAAe,CAAC,MAA+B,qBAA6D;AAChH,QAAM,QAAQ,OAAO,KAAK,UAAU,YAAY,KAAK,MAAM,WAAW,UAAU,IAC5E,KAAK,MAAM,MAAM,WAAW,MAAM,IAClC;AACJ,SAAO,SAAS;AAClB;AAEA,IAAM,gBAAgB,CACpB,UACA,SACA,QAC0C;AAC1C,MAAI,aAAa,MAAO,QAAO,EAAE,SAAS,KAAK;AAC/C,MAAI,CAAC,QAAS,QAAO,EAAE,SAAS,OAAO,QAAQ,wBAAwB;AACvE,MAAI,CAAC,QAAQ,MAAO,QAAO,EAAE,SAAS,OAAO,QAAQ,qBAAqB;AAC1E,MAAI,QAAQ,qBAAqB,UAAa,CAAC,gBAAgB,OAAO,GAAG,IAAI,GAAG,GAAG;AACjF,WAAO,EAAE,SAAS,OAAO,QAAQ,2BAA2B;AAAA,EAC9D;AACA,SAAO,EAAE,SAAS,KAAK;AACzB;AAEA,IAAM,WAAW,CAAC,UAChB,UAAU,WAAW,WAAW,UAAU,UAAU,UAAU;AAEhE,IAAM,YAAY,CAAC,UAAsC,UAAU,QAAQ,QAAQ;AAEnF,IAAM,eAAe,CAAC,OAAgB,KAAa,KAAa,aAC9D,OAAO,UAAU,YAAY,OAAO,SAAS,KAAK,IAC9C,KAAK,IAAI,KAAK,KAAK,IAAI,KAAK,KAAK,MAAM,KAAK,CAAC,CAAC,IAC9C;AAEN,IAAM,cAAc,CAAC,UACnB,MAAM,QAAQ,KAAK,IACf,MAAM,OAAO,CAAC,UAA2B,OAAO,UAAU,YAAY,MAAM,SAAS,CAAC,IACtF,CAAC;AAEP,IAAM,oBAAoB,CACxB,WACA,OACA,aACA,SACwC;AACxC,aAAW,WAAW,WAAW;AAC/B,UAAM,UAAU,MAAM,OAAO,CAAC,OAAO,SAAS,SAAS,KAAK,IAAI,MAAM,UAAU,IAAI,IAAI,CAAC;AACzF,QAAI,YAAY,EAAG;AACnB,WAAO;AAAA,MACL,MAAM,YAAY,IAAI,sBAAsB;AAAA,MAC5C,SAAS,YAAY,IACjB,iBAAiB,KAAK,UAAU,OAAO,CAAC,oBACxC,iBAAiB,KAAK,UAAU,OAAO,CAAC,gBAAgB,OAAO;AAAA,MACnE;AAAA,MACA;AAAA,MACA;AAAA,IACF;AAAA,EACF;AACA,SAAO;AACT;AAEA,IAAM,0BAA0B,CAC9B,OACA,SAC6E;AAC7E,QAAM,QAAQ,MAAM;AACpB,QAAM,aAAa,CAAC,aAAqB,EAAE,OAAO,EAAE,MAAM,uBAAuB,SAAS,YAAY,MAAM,EAAE;AAC9G,QAAM,aAAa,MAA6B,MAAM,IAAI,CAAC,MAAM,WAAW,EAAE,MAAM,MAAM,EAAE;AAE5F,QAAM,YAAY,KAAK;AACvB,MAAI,cAAc,UAAa,CAAC,MAAM,QAAQ,SAAS,GAAG;AACxD,UAAM,IAAI,MAAM,wCAAwC;AAAA,EAC1D;AACA,QAAM,aAAc,aAAa,CAAC;AAClC,MAAI,CAAC,WAAW,MAAM,CAAC,UAAU,OAAO,UAAU,YAAY,OAAO,cAAc,KAAK,KAAK,SAAS,CAAC,GAAG;AACxG,WAAO,WAAW,wDAAwD;AAAA,EAC5E;AACA,QAAM,UAAU;AAChB,QAAM,SAAS,QAAQ,KAAK,CAAC,UAAU,SAAS,KAAK;AACrD,MAAI,WAAW,QAAW;AACxB,WAAO,WAAW,eAAe,MAAM,kBAAkB,KAAK,IAAI,GAAG,QAAQ,CAAC,CAAC,GAAG;AAAA,EACpF;AAEA,QAAM,WAAW,YAAY,KAAK,QAAQ;AAC1C,QAAM,YAAY,YAAY,KAAK,kBAAkB;AACrD,QAAM,QAAQ,KAAK,cAAc,OAAO,KAAK,eAAe,YAAY,CAAC,MAAM,QAAQ,KAAK,UAAU,IAClG,KAAK,aACL;AACJ,QAAM,QAAQ,OAAO;AACrB,QAAM,OAAO,OAAO;AACpB,MAAK,UAAU,YAAgB,SAAS,SAAY;AAClD,UAAM,IAAI,MAAM,uDAAuD;AAAA,EACzE;AACA,MAAI,UAAU,WACZ,OAAO,UAAU,YACjB,OAAO,SAAS,YAChB,CAAC,OAAO,cAAc,KAAK,KAC3B,CAAC,OAAO,cAAc,IAAI,KAC1B,QAAQ,KACR,OAAO,QACN;AACD,WAAO,WAAW,6DAA6D;AAAA,EACjF;AACA,MAAI,OAAO,SAAS,YAAY,QAAQ,OAAO;AAC7C,WAAO,WAAW,uBAAuB,IAAI,mCAAmC,KAAK,WAAW;AAAA,EAClG;AAEA,QAAM,SAAS,aAAa,KAAK,QAAQ,GAAG,4BAA4B,CAAC;AACzE,QAAM,QAAQ,aAAa,KAAK,OAAO,GAAG,4BAA4B,CAAC;AACvE,MAAI,QAAQ,WAAW,KAAK,SAAS,WAAW,KAAK,UAAU,WAAW,KAAK,UAAU,QAAW;AAClG,QAAI,SAAS,KAAK,QAAQ,GAAG;AAC3B,YAAM,IAAI,MAAM,yDAAyD;AAAA,IAC3E;AACA,WAAO,EAAE,UAAU,WAAW,EAAE;AAAA,EAClC;AAEA,QAAM,iBAAiB,kBAAkB,UAAU,OAAO,YAAY,CAAC,SAAS,KAAK,OAAO;AAC5F,MAAI,eAAgB,QAAO,EAAE,OAAO,eAAe;AACnD,QAAM,iBAAiB,kBAAkB,WAAW,OAAO,qBAAqB,CAAC,SAAS,KAAK,OAAO;AACtG,MAAI,eAAgB,QAAO,EAAE,OAAO,eAAe;AAEnD,QAAM,WAAW,IAAI,IAAI,OAAO;AAChC,QAAM,aAAa,IAAI,IAAI,QAAQ;AACnC,QAAM,aAAa,IAAI,IAAI,SAAS;AACpC,QAAM,WAAW,WAAW,EAAE,OAAO,CAAC,EAAE,MAAM,MAAM,MAClD,SAAS,IAAI,KAAK,KAClB,WAAW,IAAI,KAAK,OAAO,KAC3B,WAAW,IAAI,KAAK,OAAO,KAC1B,OAAO,UAAU,YAAY,OAAO,SAAS,YAAY,SAAS,SAAS,SAAS,IAAK;AAC5F,MAAI,WAAW,KAAK,UAAU,EAAG,QAAO,EAAE,SAAS;AACnD,MAAI,SAAS,WAAW,GAAG;AACzB,UAAM,IAAI,MAAM,iEAAiE;AAAA,EACnF;AACA,QAAM,SAAS,SAAS,CAAC,EAAG;AAC5B,QAAM,OAAO,KAAK,IAAI,GAAG,SAAS,MAAM;AACxC,QAAM,KAAK,KAAK,IAAI,KAAK,IAAI,GAAG,QAAQ,CAAC,GAAG,SAAS,KAAK;AAC1D,SAAO,EAAE,UAAU,WAAW,EAAE,OAAO,CAAC,EAAE,MAAM,MAAM,SAAS,QAAQ,SAAS,EAAE,EAAE;AACtF;AAEO,IAAM,mBAAN,MAAuB;AAAA,EAM5B,YAA6B,SAAkC;AAAlC;AAC3B,SAAK,aAAa,QAAQ,cAAc,QAAQ,OAAO;AACvD,SAAK,SAAS,KAAK,IAAI,GAAG,KAAK,IAAI,QAAQ,iBAAiB,KAAM,GAAK,CAAC;AACxE,SAAK,aAAa,KAAK,IAAI,GAAG,KAAK,IAAI,QAAQ,mBAAmB,KAAM,GAAK,CAAC;AAAA,EAChF;AAAA,EATiB;AAAA,EACA;AAAA,EACA;AAAA,EACA,WAAW,oBAAI,IAA2B;AAAA,EAQ3D,OAAO,MAAgD;AACrD,UAAM,QAAQ,OAAO,KAAK,UAAU,WAAW,KAAK,QAAQ;AAC5D,UAAM,OAAO,SAAS,KAAK,SAAS;AACpC,UAAM,QAAQ,UAAU,KAAK,UAAU;AACvC,UAAM,YAAY,eAAe,OAAO,MAAM,KAAK;AACnD,UAAM,WAAW,KAAK,aAAa,QAAQ,QAAQ;AACnD,UAAM,SAAS,OAAO,KAAK,WAAW,YAAY,KAAK,UAAU,IAAI,KAAK,MAAM,KAAK,MAAM,IAAI;AAC/F,UAAM,WAAW,OAAO,KAAK,aAAa,YAAY,KAAK,YAAY,IACnE,KAAK,IAAI,IAAI,KAAK,MAAM,KAAK,QAAQ,CAAC,IACtC;AACJ,UAAM,kBAAkB,aAAa,MAAM,KAAK,QAAQ,gBAAgB;AACxE,UAAM,UAAU,oBAAI,IAAY;AAChC,QAAI,UAAU,QAAS,SAAQ,IAAI,UAAU,OAAO;AAEpD,UAAM,cAAc,KAAK,YAAY,iBAAiB,UAAU,WAAW,OAAO;AAClF,UAAM,MAAM,KAAK,QAAQ,iBAAiB,UAAU,OAAO,MAAM,OAAO,WAAW,QAAQ,UAAU,OAAO;AAC5G,UAAM,OAAO,IAAI;AACjB,UAAM,oBAAoB,SAAS,IAAI;AACvC,QAAI,eAAe;AACnB,QAAI,qBAAqB,IAAI,OAAO;AAClC,YAAM,QAAQ,KAAK,IAAI,GAAG,oBAAoB,IAAI,KAAK;AACvD,iBAAW,OAAO,YAAY,MAAM,KAAK,GAAG;AAC1C,YAAI,KAAK,UAAU,SAAU;AAC7B,aAAK,KAAK,GAAG;AACb,wBAAgB;AAAA,MAClB;AAAA,IACF;AACA,UAAM,QAAQ,IAAI,QAAQ,YAAY;AACtC,UAAM,WAAW,IAAI,WAAW;AAChC,UAAM,WAAW,IAAI,IAAI,KAAK,IAAI,CAAC,QAAQ,IAAI,SAAS,CAAC,EAAE;AAC3D,WAAO;AAAA,MACL;AAAA,MACA;AAAA,MACA,MAAM,SAAS,WAAW,QACtB,EAAE,KAAK,iBAAiB,MAAM,EAAE,GAAG,MAAM,QAAQ,SAAS,SAAS,EAAE,IACrE;AAAA,MACJ,UAAU;AAAA,QACR,UAAU,QAAQ,SAAS;AAAA,QAC3B,iBAAiB;AAAA,QACjB,kBAAkB;AAAA,QAClB,eAAe;AAAA,QACf,oBAAoB,QAAQ,SAAS,IAAI,IAAI;AAAA,QAC7C,SAAS,CAAC,GAAG,OAAO,EAAE,KAAK;AAAA,MAC7B;AAAA,IACF;AAAA,EACF;AAAA,EAEQ,QACN,iBACA,UACA,OACA,MACA,OACA,WACA,QACA,UACA,SAC2D;AAC3D,UAAM,OAAuB,CAAC;AAC9B,QAAI,WAAW;AACf,QAAI,QAAQ;AACZ,WAAO,KAAK,SAAS,YAAY,WAAW,KAAK,QAAQ;AACvD,YAAM,QAAQ,KAAK,IAAI,KAAK,IAAI,UAAU,EAAE,GAAG,KAAK,SAAS,QAAQ;AACrE,YAAM,OAAO,KAAK,QAAQ,OAAO,UAAU;AAAA,QACzC,GAAI,oBAAoB,SAAY,CAAC,IAAI,EAAE,WAAW,gBAAgB;AAAA,QACtE,GAAI,UAAU,SAAY,CAAC,IAAI,EAAE,MAAM;AAAA,QACvC;AAAA,QACA;AAAA,QACA,QAAQ,SAAS;AAAA,QACjB;AAAA,QACA,WAAW,KAAK;AAAA,MAClB,CAAC;AACD,cAAQ,KAAK;AACb,UAAI,CAAC,KAAK,SAAU,SAAQ,IAAI,uBAAuB;AACvD,UAAI,KAAK,KAAK,WAAW,EAAG;AAC5B,iBAAW,SAAS,KAAK,MAAM;AAC7B,oBAAY;AACZ,cAAM,UAAU,cAAc,UAAU,cAAc,KAAK,SAAS,MAAM,SAAS,GAAG,UAAU,MAAM,SAAS,MAAM,WAAW,CAAC;AACjI,YAAI,CAAC,QAAQ,SAAS;AACpB,cAAI,QAAQ,OAAQ,SAAQ,IAAI,QAAQ,MAAM;AAC9C;AAAA,QACF;AACA,aAAK,KAAK,KAAK,OAAO,OAAO,WAAW,QAAQ,CAAC;AACjD,YAAI,KAAK,UAAU,SAAU;AAAA,MAC/B;AACA,UAAI,KAAK,KAAK,SAAS,MAAO;AAAA,IAChC;AACA,QAAI,KAAK,SAAS,YAAY,YAAY,KAAK,UAAU,SAAS,WAAW,OAAO;AAClF,cAAQ,IAAI,gBAAgB;AAAA,IAC9B;AACA,WAAO,EAAE,MAAM,UAAU,MAAM;AAAA,EACjC;AAAA,EAEQ,OAAO,OAAiB,WAA2B,UAA0C;AACnG,UAAM,UAAU,QAAQ,MAAM,OAAO;AACrC,UAAM,UAAU,cAAc,KAAK;AACnC,WAAO;AAAA,MACL,MAAM;AAAA,MACN,WAAW,MAAM;AAAA,MACjB,OAAO,UAAU,QAAQ,MAAM,OAAO;AAAA,MACtC,SAAS,QAAQ;AAAA,MACjB,WAAW,QAAQ;AAAA,MACnB,QAAQ;AAAA,QACN,MAAM;AAAA,QACN,YAAY,MAAM;AAAA,QAClB,WAAW,MAAM;AAAA,QACjB,SAAS,MAAM;AAAA,QACf,UAAU,MAAM;AAAA,QAChB,aAAa,MAAM;AAAA,QACnB,YAAY,MAAM;AAAA,MACpB;AAAA,MACA,QAAQ;AAAA,QACN,KAAK;AAAA,QACL,MAAM,EAAE,SAAS,SAAS,UAAU,oBAAoB,MAAM,YAAY;AAAA,MAC5E;AAAA,IACF;AAAA,EACF;AAAA,EAEQ,YACN,iBACA,UACA,WACA,SACgB;AAChB,UAAM,QAAQ,oBAAoB,SAC9B,KAAK,QAAQ,UAAU,UAAU,EAAE,OAAO,KAAK,aAAa,EAAE,CAAC,IAC/D,KAAK,QAAQ,UAAU,UAAU,EAAE,WAAW,iBAAiB,OAAO,KAAK,aAAa,EAAE,CAAC;AAC/F,QAAI,MAAM,SAAS,KAAK,WAAY,SAAQ,IAAI,oBAAoB;AACpE,UAAM,OAAwE,CAAC;AAC/E,eAAW,QAAQ,MAAM,MAAM,GAAG,KAAK,UAAU,GAAG;AAClD,UAAI,KAAK,UAAU,SAAS;AAC1B,gBAAQ,IAAI,WAAW,KAAK,KAAK,EAAE;AACnC;AAAA,MACF;AACA,YAAM,UAAU,cAAc,KAAK,SAAS,KAAK,SAAS;AAC1D,UAAI,aAAa,UAAU;AACzB,YAAI,CAAC,SAAS;AACZ,kBAAQ,IAAI,uBAAuB;AACnC;AAAA,QACF;AACA,YAAI,CAAC,QAAQ,OAAO;AAClB,kBAAQ,IAAI,oBAAoB;AAChC;AAAA,QACF;AACA,cAAM,SAAS,gBAAgB,OAAO;AACtC,YAAI,UAAU,KAAK,QAAQ,KAAK,CAAC,WAAW,CAAC,OAAO,IAAI,UAAU,OAAO,SAAS,OAAO,WAAW,CAAC,CAAC,GAAG;AACvG,kBAAQ,IAAI,2BAA2B;AACvC;AAAA,QACF;AAAA,MACF;AACA,UAAI,CAAC,UAAU,QAAQ,KAAK,IAAI,EAAG;AACnC,YAAM,UAAU,QAAQ,KAAK,IAAI;AACjC,WAAK,KAAK;AAAA,QACR,WAAW,KAAK;AAAA,QAChB,QAAQ,KAAK;AAAA,QACb,KAAK;AAAA,UACH,MAAM;AAAA,UACN,WAAW,KAAK;AAAA,UAChB,OAAO,UAAU,QAAQ,KAAK,IAAI;AAAA,UAClC,SAAS,QAAQ;AAAA,UACjB,WAAW,QAAQ;AAAA,UACnB,QAAQ;AAAA,YACN,MAAM;AAAA,YACN,YAAY,KAAK;AAAA,YACjB,WAAW,KAAK;AAAA,YAChB,QAAQ,KAAK;AAAA,YACb,YAAY,KAAK;AAAA,UACnB;AAAA,UACA,QAAQ;AAAA,YACN,KAAK;AAAA,YACL,MAAM,EAAE,SAAS,kBAAkB,KAAK,MAAM,GAAG,UAAU,oBAAoB,KAAK,WAAW;AAAA,UACjG;AAAA,QACF;AAAA,MACF,CAAC;AAAA,IACH;AACA,SAAK,KAAK,CAAC,MAAM,UAAU,MAAM,IAAI,QAAQ,KAAK,IAAI,SACjD,MAAM,YAAY,KAAK,aACvB,KAAK,OAAO,cAAc,MAAM,MAAM,CAAC;AAC5C,WAAO,KAAK,IAAI,CAAC,UAAU,MAAM,GAAG;AAAA,EACtC;AAAA,EAEA,OAAO,MAAwD;AAC7D,UAAM,UAAU,OAAO,KAAK,YAAY,WAAW,KAAK,UAAU;AAClE,UAAM,WAAW,KAAK,aAAa,QAAQ,QAAQ;AACnD,QAAI,QAAQ,WAAW,cAAc,EAAG,QAAO,KAAK,cAAc,SAAS,MAAM,QAAQ;AACzF,WAAO,KAAK,UAAU,SAAS,MAAM,QAAQ;AAAA,EAC/C;AAAA,EAEQ,cACN,SACA,MACA,UACyB;AACzB,UAAM,OAAO,KAAK,QAAQ,UAAU,QAAQ,QAAQ,MAAM,eAAe,MAAM,CAAC;AAChF,QAAI,CAAC,KAAM,QAAO,EAAE,SAAS,CAAC,GAAG,MAAM,MAAM,OAAO,EAAE,MAAM,iBAAiB,SAAS,8BAA8B,EAAE;AACtH,QAAI,KAAK,UAAU,QAAS,QAAO,EAAE,SAAS,CAAC,GAAG,MAAM,MAAM,OAAO,EAAE,MAAM,uBAAuB,SAAS,mBAAmB,KAAK,KAAK,GAAG,EAAE;AAC/I,UAAM,UAAU,cAAc,KAAK,SAAS,KAAK,SAAS;AAC1D,UAAM,SAAS,gBAAgB,OAAO;AACtC,QAAI,aAAa,UAAU;AACzB,UAAI,CAAC,WAAW,CAAC,QAAQ,MAAO,QAAO,EAAE,SAAS,CAAC,GAAG,MAAM,MAAM,OAAO,EAAE,MAAM,uBAAuB,SAAS,+BAA+B,EAAE;AAClJ,UAAI,UAAU,KAAK,QAAQ,KAAK,CAAC,WAAW,CAAC,OAAO,IAAI,UAAU,OAAO,SAAS,OAAO,WAAW,CAAC,CAAC,GAAG;AACvG,eAAO,EAAE,SAAS,CAAC,GAAG,MAAM,MAAM,OAAO,EAAE,MAAM,iBAAiB,SAAS,uCAAuC,EAAE;AAAA,MACtH;AAAA,IACF;AACA,UAAM,WAAW,OAAO,KAAK,uBAAuB,WAAW,KAAK,qBAAqB;AACzF,QAAI,YAAY,aAAa,KAAK,YAAY;AAC5C,aAAO,EAAE,SAAS,CAAC,GAAG,MAAM,MAAM,OAAO,EAAE,MAAM,iBAAiB,SAAS,+BAA+B,oBAAoB,UAAU,kBAAkB,KAAK,WAAW,EAAE;AAAA,IAC9K;AACA,UAAM,kBAAkB,OAAO,KAAK,+BAA+B,WAAW,KAAK,6BAA6B;AAChH,UAAM,gBAAgB,KAAK,sBAAsB;AACjD,QAAI,oBAAoB,UAAa,oBAAoB,eAAe;AACtE,aAAO,EAAE,SAAS,CAAC,GAAG,MAAM,MAAM,OAAO,EAAE,MAAM,iBAAiB,SAAS,kCAAkC,4BAA4B,iBAAiB,0BAA0B,cAAc,EAAE;AAAA,IACtM;AACA,UAAM,SAAS,aAAa,KAAK,aAAa,GAAG,OAAO,kBAAkB,CAAC;AAC3E,UAAM,aAAa,aAAa,KAAK,YAAY,GAAG,OAAO,kBAAkB,CAAC;AAC9E,UAAM,aAAa,aAAa,KAAK,YAAY,GAAG,4BAA4B,8BAA8B;AAC9G,UAAM,WAAW,aAAa,KAAK,UAAU,KAAK,0BAA0B,4BAA4B;AACxG,UAAM,UAAU,KAAK,QAAQ,SAAS,IAClC,KAAK,mBAAmB,MAAM,UAAU,MAAM,IAC9C,KAAK,aAAa,MAAM,QAAQ;AACpC,UAAM,QAAQ,QAAQ,MAAM;AAC5B,UAAM,UAAU,CAAC,WAA6D;AAAA,MAC5E,SAAS;AAAA,MACT,YAAY,KAAK;AAAA,MACjB;AAAA,MACA,oBAAoB;AAAA,MACpB;AAAA,MACA,YAAY;AAAA,MACZ,SAAS,CAAC;AAAA,MACV,MAAM;AAAA,MACN;AAAA,IACF;AACA,UAAM,YAAY,wBAAwB,QAAQ,OAAO,IAAI;AAC7D,QAAI,WAAW,UAAW,QAAO,QAAQ,UAAU,KAAK;AACxD,UAAM,WAAW,UAAU;AAC3B,QAAI,SAAS,SAAS,QAAQ;AAC5B,aAAO,QAAQ;AAAA,QACb,MAAM;AAAA,QACN,SAAS,gBAAgB,MAAM,kBAAkB,SAAS,MAAM;AAAA,QAChE,YAAY;AAAA,MACd,CAAC;AAAA,IACH;AACA,QAAI,SAAS,SAAS,UAAU,aAAa,SAAS,MAAM,EAAG,KAAK,KAAK,QAAQ;AAC/E,aAAO,QAAQ;AAAA,QACb,MAAM;AAAA,QACN,SAAS,eAAe,UAAU,mBAAmB,SAAS,MAAM,EAAG,KAAK,WAAW,SAAS,MAAM,EAAG,KAAK,KAAK,MAAM;AAAA,QACzH,YAAY,SAAS,MAAM,EAAG,KAAK,KAAK;AAAA,MAC1C,CAAC;AAAA,IACH;AACA,UAAM,UAA0C,CAAC;AACjD,QAAI,SAAS;AACb,QAAI,QAAQ;AACZ,QAAI,SAAS;AACb,WAAO,SAAS,SAAS,UAAU,QAAQ,SAAS,cAAc,SAAS,GAAG;AAC5E,YAAM,EAAE,MAAM,MAAM,IAAI,SAAS,MAAM;AACvC,UAAI,OAAO,KAAK,IAAI,KAAK,KAAK,QAAQ,QAAQ,MAAM;AACpD,UAAI,OAAO,KAAK,KAAK,UAAU,eAAe,KAAK,KAAK,WAAW,IAAI,CAAC,GAAG;AACzE,eAAO,OAAO,IAAI,QAAQ,OAAO,IAAI,KAAK,IAAI,KAAK,KAAK,QAAQ,OAAO,CAAC;AAAA,MAC1E;AACA,YAAM,OAAO,KAAK,KAAK,MAAM,OAAO,IAAI;AACxC,YAAM,MAAM,QAAQ,KAAK;AACzB,YAAM,WAAW,OAAO,KAAK,KAAK;AAClC,cAAQ,KAAK;AAAA,QACX;AAAA,QACA,SAAS,KAAK;AAAA,QACd,UAAU,KAAK;AAAA,QACf,MAAM,KAAK;AAAA,QACX,MAAM,KAAK;AAAA,QACX,WAAW,KAAK;AAAA,QAChB,SAAS;AAAA,QACT;AAAA,QACA,WAAW,EAAE,OAAO,KAAK,OAAO,KAAK,KAAK,QAAQ,SAAS;AAAA,QAC3D,QAAQ;AAAA,QACR,SAAS,KAAK;AAAA,QACd,YAAY,KAAK;AAAA,QACjB,QAAQ;AAAA,UACN,KAAK;AAAA,UACL,MAAM,EAAE,SAAS,KAAK,SAAS,UAAU,oBAAoB,KAAK,WAAW;AAAA,QAC/E;AAAA,MACF,CAAC;AACD,gBAAU,KAAK;AACf,UAAI,CAAC,UAAU;AACb,gBAAQ;AACR;AAAA,MACF;AACA,gBAAU;AACV,cAAQ;AAAA,IACV;AACA,WAAO;AAAA,MACL,SAAS;AAAA,MACT,YAAY,KAAK;AAAA,MACjB;AAAA,MACA,oBAAoB;AAAA,MACpB,MAAM;AAAA,QACJ,QAAQ,KAAK;AAAA,QACb,WAAW,KAAK;AAAA,QAChB,MAAM,KAAK,SAAS,KAAK,QAAQ,SAAS,IAAI,SAAS;AAAA,QACvD,OAAO,KAAK;AAAA,QACZ,MAAM,KAAK;AAAA,QACX,YAAY,KAAK;AAAA,QACjB,UAAU,KAAK;AAAA,QACf,SAAS,KAAK;AAAA,QACd,WAAW,KAAK;AAAA,MAClB;AAAA,MACA;AAAA,MACA,YAAY;AAAA,MACZ;AAAA,MACA,MAAM,SAAS,SAAS,SACpB,EAAE,KAAK,iBAAiB,MAAM,EAAE,GAAG,MAAM,aAAa,QAAQ,YAAY,MAAM,EAAE,IAClF;AAAA,MACJ,GAAI,QAAQ,gBAAgB,IACxB,CAAC,IACD,EAAE,OAAO,EAAE,MAAM,uBAAuB,SAAS,GAAG,QAAQ,WAAW,yCAAyC,EAAE;AAAA,IACxH;AAAA,EACF;AAAA,EAEQ,gBAAgB,KAAa,OAA4B;AAC/D,SAAK,SAAS,OAAO,GAAG;AACxB,SAAK,SAAS,IAAI,KAAK,KAAK;AAC5B,WAAO,KAAK,SAAS,OAAO,6BAA6B;AACvD,YAAM,SAAS,KAAK,SAAS,KAAK,EAAE,KAAK,EAAE;AAC3C,UAAI,WAAW,OAAW;AAC1B,WAAK,SAAS,OAAO,MAAM;AAAA,IAC7B;AAAA,EACF;AAAA,EAEQ,mBACN,MACA,UACA,QAC+C;AAC/C,UAAM,YAAuC,CAAC;AAC9C,QAAI,cAAc;AAClB,eAAW,UAAU,KAAK,SAAS;AACjC,YAAM,MAAM,UAAU,OAAO,SAAS,OAAO,WAAW;AACxD,UAAI,aAAa,YAAY,UAAU,CAAC,OAAO,IAAI,GAAG,GAAG;AACvD,uBAAe;AACf;AAAA,MACF;AACA,gBAAU,KAAK,MAAM;AAAA,IACvB;AACA,UAAM,aAAa,KAAK;AAAA,MACtB,KAAK;AAAA,MACL,KAAK;AAAA,MACL,KAAK;AAAA,MACL,GAAG,UAAU,IAAI,CAAC,WAAW,GAAG,OAAO,OAAO,IAAI,OAAO,QAAQ,IAAI,OAAO,WAAW,EAAE;AAAA,IAC3F,EAAE,KAAK,GAAG,CAAC;AACX,UAAM,WAAW,KAAK,SAAS,IAAI,UAAU;AAC7C,QAAI,SAAU,QAAO,EAAE,OAAO,UAAU,YAAY;AACpD,UAAM,QAAuB,CAAC;AAC9B,QAAI,UAAU;AACd,eAAW,UAAU,WAAW;AAC9B,YAAM,QAAQ,KAAK,QAAQ,OAAO,aAAa,KAAK,WAAW,OAAO,SAAS,OAAO,QAAQ;AAC9F,UAAI,CAAC,OAAO;AACV,mBAAW;AACX;AAAA,MACF;AACA,YAAM,KAAK;AAAA,QACT,SAAS,MAAM;AAAA,QACf,UAAU,MAAM,iBAAiB;AAAA,QACjC,MAAM;AAAA,QACN,MAAM,MAAM;AAAA,QACZ,WAAW,MAAM;AAAA,QACjB,MAAM,MAAM;AAAA,QACZ,SAAS,cAAc,KAAK;AAAA,QAC5B,YAAY,MAAM;AAAA,MACpB,CAAC;AAAA,IACH;AACA,UAAM,KAAK,CAAC,MAAM,UAAU,KAAK,YAAY,MAAM,aAC9C,KAAK,QAAQ,cAAc,MAAM,OAAO,KACxC,KAAK,QAAQ,cAAc,MAAM,OAAO,CAAC;AAC9C,QAAI,YAAY,EAAG,MAAK,gBAAgB,YAAY,KAAK;AACzD,WAAO,EAAE,OAAO,aAAa,cAAc,QAAQ;AAAA,EACrD;AAAA,EAEQ,aACN,MACA,UAC+C;AAC/C,UAAM,QAAuB,CAAC;AAC9B,QAAI,cAAc;AAClB,eAAW,WAAW,KAAK,UAAU;AACnC,YAAM,QAAQ,KAAK,QAAQ,UAAU,QAAQ,OAAO;AACpD,UAAI,CAAC,SAAS,MAAM,UAAU,SAAS;AACrC,uBAAe;AACf;AAAA,MACF;AACA,UAAI,aAAa,UAAU;AACzB,cAAM,SAAS,gBAAgB,cAAc,KAAK,SAAS,MAAM,SAAS,CAAC;AAC3E,YAAI,UAAU,MAAM,QAAQ,KAAK,CAAC,WAAW,CAAC,OAAO,IAAI,UAAU,OAAO,SAAS,OAAO,WAAW,CAAC,CAAC,GAAG;AACxG,yBAAe;AACf;AAAA,QACF;AAAA,MACF;AACA,YAAM,KAAK;AAAA,QACT,SAAS,MAAM;AAAA,QACf,UAAU,KAAK;AAAA,QACf,MAAM;AAAA,QACN,MAAM;AAAA,QACN,WAAW,MAAM;AAAA,QACjB,MAAM,MAAM;AAAA,QACZ,SAAS,kBAAkB,MAAM,MAAM;AAAA,QACvC,YAAY,MAAM;AAAA,MACpB,CAAC;AAAA,IACH;AACA,UAAM,KAAK,CAAC,MAAM,UAAU,KAAK,YAAY,MAAM,aAAa,KAAK,QAAQ,cAAc,MAAM,OAAO,CAAC;AACzG,WAAO,EAAE,OAAO,YAAY;AAAA,EAC9B;AAAA,EAEQ,UACN,SACA,MACA,UACyB;AACzB,UAAM,QAAQ,QAAQ,MAAM,GAAG;AAC/B,QAAI,MAAM,SAAS,KAAK,MAAM,CAAC,MAAM,UAAW,QAAO,EAAE,SAAS,CAAC,GAAG,MAAM,MAAM,OAAO,EAAE,MAAM,mBAAmB,SAAS,0BAA0B,EAAE;AACzJ,UAAM,WAAW,OAAO,MAAM,GAAG,EAAE,CAAC;AACpC,UAAM,UAAU,MAAM,MAAM,GAAG,EAAE,EAAE,KAAK,GAAG;AAC3C,UAAM,YAAY,MAAM,CAAC;AACzB,QAAI,CAAC,aAAa,CAAC,WAAW,CAAC,OAAO,cAAc,QAAQ,KAAK,WAAW,EAAG,QAAO,EAAE,SAAS,CAAC,GAAG,MAAM,MAAM,OAAO,EAAE,MAAM,mBAAmB,SAAS,0BAA0B,EAAE;AACxL,UAAM,QAAQ,KAAK,QAAQ,OAAO,aAAa,WAAW,SAAS,QAAQ;AAC3E,QAAI,CAAC,MAAO,QAAO,EAAE,SAAS,CAAC,GAAG,MAAM,MAAM,OAAO,EAAE,MAAM,iBAAiB,SAAS,4BAA4B,EAAE;AACrH,UAAM,UAAU,cAAc,KAAK,SAAS,SAAS;AACrD,UAAM,UAAU,cAAc,UAAU,SAAS,UAAU,SAAS,MAAM,WAAW,CAAC;AACtF,QAAI,CAAC,QAAQ,QAAS,QAAO,EAAE,SAAS,CAAC,GAAG,MAAM,MAAM,OAAO,EAAE,MAAM,QAAQ,WAAW,6BAA6B,kBAAkB,uBAAuB,SAAS,QAAQ,UAAU,6BAA6B,EAAE;AAC1N,UAAM,UAAU,KAAK,MAAM,MAAM,WAAW;AAC5C,UAAM,aAAa,eAAe,OAAO;AACzC,UAAM,WAAW,OAAO,KAAK,uBAAuB,WAAW,KAAK,qBAAqB;AACzF,QAAI,YAAY,aAAa,WAAY,QAAO,EAAE,SAAS,CAAC,GAAG,MAAM,MAAM,OAAO,EAAE,MAAM,iBAAiB,SAAS,2BAA2B,oBAAoB,UAAU,kBAAkB,WAAW,EAAE;AAC5M,UAAM,MAAM,OAAO,KAAK,aAAa,WAAW,KAAK,IAAI,MAAO,KAAK,IAAI,KAAK,KAAK,MAAM,KAAK,QAAQ,CAAC,CAAC,IAAI;AAC5G,UAAM,QAAQ,OAAO,KAAK,eAAe,WAAW,KAAK,IAAI,GAAG,KAAK,MAAM,KAAK,UAAU,CAAC,IAAI;AAC/F,UAAM,OAAO,MAAM,QAAQ,MAAM,OAAO,QAAQ,GAAG;AACnD,UAAM,WAAW,QAAQ,KAAK,UAAU,MAAM,QAAQ;AACtD,WAAO;AAAA,MACL,SAAS;AAAA,MACT;AAAA,MACA;AAAA,MACA,YAAY;AAAA,MACZ,SAAS,CAAC;AAAA,QACR,OAAO;AAAA,QACP,SAAS,MAAM;AAAA,QACf,UAAU,MAAM;AAAA,QAChB,MAAM;AAAA,QACN,MAAM,MAAM;AAAA,QACZ,WAAW,MAAM;AAAA,QACjB,SAAS;AAAA,QACT;AAAA,QACA,WAAW,EAAE,OAAO,KAAK,QAAQ,KAAK,QAAQ,OAAO,MAAM,QAAQ,QAAQ,SAAS;AAAA,QACpF,QAAQ;AAAA,QACR;AAAA,QACA;AAAA,QACA,mBAAmB;AAAA,MACrB,CAAC;AAAA,MACD,MAAM,WAAW,OAAO,EAAE,KAAK,iBAAiB,MAAM,EAAE,GAAG,MAAM,YAAY,QAAQ,KAAK,OAAO,EAAE;AAAA,IACrG;AAAA,EACF;AACF;;;ACrsBA,IAAM,gBAAgB,CAAC,QACrB,IAAI,YAAY,EAAE,QAAQ,cAAc,EAAE;AAS5C,IAAM,sBAA4D;AAAA,EAChE,CAAC,WAAW,aAAa,MAAM,QAAQ,MAAM;AAAA,EAC7C,CAAC,gBAAgB,IAAI;AAAA,EACrB,CAAC,MAAM,WAAW,WAAW,OAAO;AAAA,EACpC,CAAC,SAAS,GAAG;AAAA,EACb,CAAC,SAAS,OAAO,UAAU;AAAA,EAC3B,CAAC,QAAQ,UAAU,cAAc;AAAA,EACjC,CAAC,SAAS,UAAU,QAAQ,OAAO;AAAA,EACnC,CAAC,WAAW,aAAa;AAAA,EACzB,CAAC,QAAQ,WAAW,MAAM;AAAA,EAC1B,CAAC,SAAS,WAAW,OAAO,UAAU,WAAW;AAAA,EACjD,CAAC,SAAS,OAAO;AAAA,EACjB,CAAC,aAAa,cAAc,SAAS;AAAA,EACrC,CAAC,WAAW,OAAO;AACrB;AAEA,IAAM,kBAAkB,oBAAoB;AAAA,EAC1C,CAAC,QAAQ,IAAI,IAAI,IAAI,IAAI,aAAa,CAAC;AACzC;AAMA,IAAM,qBAA2D;AAAA,EAC/D,CAAC,WAAW,OAAO,QAAQ,cAAc,aAAa,YAAY,MAAM;AAAA,EACxE,CAAC,UAAU,KAAK;AAAA,EAChB,CAAC,aAAa,UAAU,UAAU,SAAS;AAC7C;AAEA,IAAM,oBAAoB,mBAAmB;AAAA,EAC3C,CAAC,QAAQ,IAAI,IAAI,IAAI,IAAI,aAAa,CAAC;AACzC;AAIA,IAAM,cAAc,CAAC,aAAmC;AACtD,MAAI,CAAC,YAAY,OAAO,aAAa,SAAU,QAAO;AACtD,QAAM,SAAS;AACf,MAAI,OAAO,SAAS,YAAY,OAAO,SAAS,UAAW,QAAO;AAClE,MAAI,OAAO,SAAS,SAAS;AAC3B,UAAM,QAAQ,OAAO;AACrB,QACE,SACA,OAAO,UAAU,aACf,MAA2B,SAAS,YACnC,MAA2B,SAAS,YACvC;AACA,aAAO;AAAA,IACT;AAAA,EACF;AACA,SAAO;AACT;AAEA,IAAM,mBAAmB,CAAC,aAAqD;AAC7E,MAAI,CAAC,YAAY,OAAO,aAAa,SAAU,QAAO;AACtD,QAAM,SAAS;AACf,MAAI,MAAM,QAAQ,OAAO,IAAI,GAAG;AAC9B,UAAM,SAAS,OAAO,KAAK;AAAA,MACzB,CAAC,UAA2B,OAAO,UAAU;AAAA,IAC/C;AACA,WAAO,OAAO,SAAS,IAAI,SAAS;AAAA,EACtC;AACA,aAAW,UAAU,CAAC,OAAO,OAAO,OAAO,KAAK,GAAG;AACjD,QAAI,CAAC,MAAM,QAAQ,MAAM,EAAG;AAC5B,UAAM,SAAS,OACZ;AAAA,MAAI,CAAC,UACJ,SAAS,OAAO,UAAU,WACrB,MAA8B,QAC/B;AAAA,IACN,EACC,OAAO,CAAC,UAA2B,OAAO,UAAU,QAAQ;AAC/D,QAAI,OAAO,SAAS,EAAG,QAAO;AAAA,EAChC;AACA,SAAO;AACT;AAIA,IAAM,qBAAqB,CACzB,WACwB;AACxB,QAAM,MAAM,oBAAI,IAAoB;AACpC,QAAM,OAAO,oBAAI,IAAgC;AACjD,aAAW,SAAS,QAAQ;AAC1B,UAAM,OAAO,cAAc,KAAK;AAChC,SAAK,IAAI,MAAM,KAAK,IAAI,IAAI,IAAI,SAAY,KAAK;AAAA,EACnD;AACA,aAAW,CAAC,MAAM,KAAK,KAAK,KAAM,KAAI,UAAU,OAAW,KAAI,IAAI,MAAM,KAAK;AAC9E,aAAW,cAAc,mBAAmB;AAC1C,UAAM,UAAU,OAAO,OAAO,CAAC,UAAU,WAAW,IAAI,cAAc,KAAK,CAAC,CAAC;AAC7E,QAAI,QAAQ,WAAW,EAAG;AAC1B,UAAM,CAAC,GAAG,IAAI;AACd,eAAW,QAAQ,YAAY;AAC7B,UAAI,SAAS,cAAc,GAAG,KAAK,CAAC,IAAI,IAAI,IAAI,EAAG,KAAI,IAAI,MAAM,GAAG;AAAA,IACtE;AAAA,EACF;AACA,SAAO;AACT;AAaA,IAAM,eAAe,CACnB,aACA,aACkB;AAClB,QAAM,aACJ,eAAe,OAAO,gBAAgB,YACtC,YAAY,cACZ,OAAO,YAAY,eAAe,WAC7B,YAAY,aACb;AACN,QAAM,WAAW,IAAI,IAAI,OAAO,KAAK,cAAc,CAAC,CAAC,CAAC;AACtD,QAAM,gBAAgB,oBAAI,IAAoB;AAC9C,QAAM,iBAAiB,oBAAI,IAAY;AACvC,aAAW,OAAO,UAAU;AAC1B,UAAM,OAAO,cAAc,GAAG;AAC9B,QAAI,cAAc,IAAI,IAAI,GAAG;AAC3B,qBAAe,IAAI,IAAI;AACvB,oBAAc,OAAO,IAAI;AAAA,IAC3B,WAAW,CAAC,eAAe,IAAI,IAAI,GAAG;AACpC,oBAAc,IAAI,MAAM,GAAG;AAAA,IAC7B;AAAA,EACF;AACA,QAAM,YAAY,oBAAI,IAAoB;AAC1C,aAAW,OAAO,UAAU;AAC1B,UAAM,OAAO,cAAc,GAAG;AAC9B,QAAI,CAAC,KAAK,SAAS,GAAG,EAAG;AACzB,UAAM,WAAW,KAAK,MAAM,GAAG,EAAE;AACjC,QAAI,CAAC,YAAY,cAAc,IAAI,QAAQ,KAAK,aAAa,KAAM;AACnE,QAAI,UAAU,IAAI,QAAQ,MAAM,OAAW,WAAU,OAAO,QAAQ;AAAA,QAC/D,WAAU,IAAI,UAAU,GAAG;AAAA,EAClC;AACA,aAAW,QAAQ,eAAgB,WAAU,OAAO,IAAI;AAExD,QAAM,WAAW,IAAI,IAAI,UAAU,YAAY,CAAC,CAAC;AACjD,QAAM,gBAAgB,IAAI,IAAI,UAAU,iBAAiB,CAAC,CAAC;AAC3D,QAAM,SAAS,oBAAI,IAAkC;AACrD,MAAI,YAAY;AACd,eAAW,CAAC,KAAK,QAAQ,KAAK,OAAO,QAAQ,UAAU,GAAG;AACxD,YAAM,OAAO,YAAY,QAAQ;AACjC,UAAI,SAAS,SAAU,UAAS,IAAI,GAAG;AAAA,eAC9B,SAAS,QAAS,eAAc,IAAI,GAAG;AAChD,YAAM,aAAa,iBAAiB,QAAQ;AAC5C,UAAI,WAAY,QAAO,IAAI,KAAK,IAAI,IAAI,mBAAmB,UAAU,CAAC,CAAC;AAAA,IACzE;AAAA,EACF;AACA,aAAW,CAAC,KAAK,MAAM,KAAK,OAAO,QAAQ,UAAU,UAAU,CAAC,CAAC,GAAG;AAClE,UAAM,MAAM,OAAO,IAAI,GAAG,KAAK,oBAAI,IAAqB;AACxD,eAAW,CAAC,UAAU,MAAM,KAAK,OAAO,QAAQ,MAAM,GAAG;AACvD,UAAI,IAAI,cAAc,QAAQ,GAAG,MAAM;AAAA,IACzC;AACA,WAAO,IAAI,KAAK,GAAG;AAAA,EACrB;AACA,SAAO,EAAE,UAAU,eAAe,WAAW,UAAU,eAAe,QAAQ,SAAS,UAAU,QAAQ;AAC3G;AAEA,IAAM,gBAAgB,CACpB,MACA,kBACuB;AACvB,QAAM,aAAa,oBAAI,IAAY;AACnC,aAAW,cAAc,iBAAiB;AACxC,QAAI,CAAC,WAAW,IAAI,IAAI,EAAG;AAC3B,eAAW,CAAC,cAAc,WAAW,KAAK,eAAe;AACvD,UAAI,iBAAiB,QAAQ,WAAW,IAAI,YAAY,GAAG;AACzD,mBAAW,IAAI,WAAW;AAAA,MAC5B;AAAA,IACF;AAAA,EACF;AACA,SAAO,WAAW,SAAS,IAAI,CAAC,GAAG,UAAU,EAAE,CAAC,IAAI;AACtD;AAIO,IAAM,+BAA+B,CAC1C,SACA,aACuB;AACvB,MAAI,SAAS,SAAS,OAAO,EAAG,QAAO;AACvC,QAAM,UAAU;AAAA,IACd;AAAA,MACE,MAAM;AAAA,MACN,YAAY,OAAO,YAAY,SAAS,IAAI,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;AAAA,IACjE;AAAA,IACA;AAAA,EACF;AACA,QAAM,OAAO,cAAc,OAAO;AAClC,QAAM,YACJ,QAAQ,cAAc,IAAI,IAAI,KAC9B,QAAQ,UAAU,IAAI,IAAI,KAC1B,cAAc,MAAM,QAAQ,aAAa;AAC3C,SAAO,aAAa,cAAc,UAAU,YAAY;AAC1D;AAEA,IAAM,eAAe,CACnB,MACA,YAC4B;AAC5B,QAAM,MAA+B,EAAE,GAAG,KAAK;AAK/C,QAAM,SAAS,CAAC,OAAe,cAAsB;AACnD,QAAI,EAAE,SAAS,QAAQ,UAAU,UAAW;AAC5C,QAAI,EAAE,aAAa,KAAM,KAAI,SAAS,IAAI,IAAI,KAAK;AACnD,WAAO,IAAI,KAAK;AAAA,EAClB;AACA,aAAW,CAAC,OAAO,SAAS,KAAK,OAAO,QAAQ,QAAQ,WAAW,CAAC,CAAC,GAAG;AACtE,WAAO,OAAO,SAAS;AAAA,EACzB;AACA,aAAW,OAAO,CAAC,GAAG,OAAO,KAAK,GAAG,CAAC,GAAG;AACvC,QAAI,QAAQ,SAAS,IAAI,GAAG,EAAG;AAC/B,UAAM,OAAO,cAAc,GAAG;AAC9B,UAAM,YACJ,QAAQ,cAAc,IAAI,IAAI,KAC9B,QAAQ,UAAU,IAAI,IAAI,KAC1B,cAAc,MAAM,QAAQ,aAAa;AAC3C,QAAI,aAAa,cAAc,IAAK,QAAO,KAAK,SAAS;AAAA,EAC3D;AAEA,aAAW,OAAO,QAAQ,UAAU;AAClC,UAAM,QAAQ,IAAI,GAAG;AACrB,QAAI,OAAO,UAAU,YAAY,MAAM,KAAK,MAAM,MAAM,CAAC,OAAO,MAAM,OAAO,KAAK,CAAC,GAAG;AACpF,UAAI,GAAG,IAAI,OAAO,KAAK;AAAA,IACzB;AAAA,EACF;AACA,aAAW,OAAO,QAAQ,eAAe;AACvC,UAAM,QAAQ,IAAI,GAAG;AACrB,QAAI,MAAM,QAAQ,KAAK,GAAG;AACxB,UAAI,GAAG,IAAI,MAAM;AAAA,QAAI,CAAC,UACpB,OAAO,UAAU,YAAY,MAAM,KAAK,MAAM,MAAM,CAAC,OAAO,MAAM,OAAO,KAAK,CAAC,IAC3E,OAAO,KAAK,IACZ;AAAA,MACN;AAAA,IACF;AAAA,EACF;AACA,aAAW,CAAC,KAAK,MAAM,KAAK,QAAQ,QAAQ;AAC1C,UAAM,QAAQ,IAAI,GAAG;AACrB,QAAI,OAAO,UAAU,UAAU;AAC7B,YAAM,OAAO,OAAO,IAAI,cAAc,KAAK,CAAC;AAC5C,UAAI,SAAS,OAAW,KAAI,GAAG,IAAI;AAAA,IACrC;AAAA,EACF;AACA,MAAI,QAAQ,SAAS,OAAO,GAAG;AAC7B,eAAW,OAAO,OAAO,KAAK,GAAG,GAAG;AAClC,UAAI,QAAQ,SAAS,IAAI,GAAG,MAAM,IAAI,GAAG,MAAM,QAAQ,IAAI,GAAG,MAAM,SAAY;AAC9E,eAAO,IAAI,GAAG;AAAA,MAChB;AAAA,IACF;AAAA,EACF;AACA,SAAO;AACT;AAqCO,IAAM,sBAAsB,CACjC,iBACA,QAA8C,CAAC,MACvB;AACxB,QAAM,UAAU,oBAAI,IAA2B;AAC/C,aAAW,cAAc,gBAAgB,GAAG;AAC1C,YAAQ;AAAA,MACN,WAAW;AAAA,MACX;AAAA,QACE,WAAW;AAAA,QACX,MAAM,WAAW,IAAI;AAAA,MACvB;AAAA,IACF;AAAA,EACF;AACA,SAAO,CAAC,YAAY,SAAS;AAC3B,QAAI,CAAC,QAAQ,OAAO,SAAS,YAAY,MAAM,QAAQ,IAAI,EAAG,QAAO;AACrE,UAAM,SAAS,QAAQ,IAAI,UAAU;AACrC,WAAO,SAAS,aAAa,MAAM,MAAM,IAAI;AAAA,EAC/C;AACF;;;AHhUA,IAAM,2BAA2B;AACjC,IAAM,mBAAmB;AACzB,IAAM,6BAA6B;AACnC,IAAM,qBAAqB;AAC3B,IAAM,qBAAqB;AAC3B,IAAM,6BAA6B;AACnC,IAAM,eAAe;AACrB,IAAM,4BAA4B,IAAI;AACtC,IAAM,2BAA2B;AACjC,IAAM,4BAA4B;AAiDlC,IAAM,iBAAiB,CAAC,SAAwC;AAC9D,MAAI;AACF,UAAM,OAAO,GAAG,SAAS,MAAM,EAAE,QAAQ,KAAK,CAAC;AAC/C,QAAI,CAAC,KAAK,OAAO,EAAG,QAAO;AAC3B,WAAO;AAAA,MACL,QAAQ,KAAK;AAAA,MACb,OAAO,KAAK;AAAA,MACZ,MAAM,KAAK;AAAA,MACX,YAAY,KAAK;AAAA,MACjB,WAAW,KAAK;AAAA,IAClB;AAAA,EACF,QAAQ;AACN,WAAO;AAAA,EACT;AACF;AAEA,IAAM,qBAAqB,CAAC,MAAsB,UAChD,KAAK,WAAW,MAAM,UACtB,KAAK,UAAU,MAAM,SACrB,KAAK,SAAS,MAAM,QACpB,KAAK,eAAe,MAAM,cAC1B,KAAK,cAAc,MAAM;AAE3B,IAAM,sBAAsB,CAAC,WAC3B,SAAS,GAAG,OAAO,UAAU,EAAE,KAAK,OAAO,QAAQ,MAAM,KAAK;AAEhE,IAAM,gBAAgB,CACpB,MACA,UACA,eAC6B;AAC7B,QAAM,WAAW,eAAe,IAAI;AACpC,MAAI,CAAC,SAAU,QAAO;AACtB,SAAO;AAAA,IACL,MAAM,KAAK,QAAQ,IAAI;AAAA,IACvB;AAAA,IACA,qBAAqB,aAAa,WAAW,oBAAoB,UAAU,IAAI;AAAA,EACjF;AACF;AAEA,IAAM,iBAAiB,CACrB,MACA,UACA,iBAC+B;AAC/B,QAAM,eAAoC,CAAC;AAC3C,aAAW,OAAO,MAAM;AACtB,UAAM,aAAa,aAAa,WAAW,eAAe,IAAI,IAAI,IAAI;AACtE,UAAM,cAAc,cAAc,IAAI,MAAM,UAAU,UAAU;AAChE,QAAI,CAAC,YAAa,QAAO;AACzB,iBAAa,KAAK,WAAW;AAAA,EAC/B;AACA,SAAO;AACT;AAEA,IAAM,wBAAwB,CAAC,MAAyB,UACtD,KAAK,SAAS,MAAM,QACpB,mBAAmB,KAAK,UAAU,MAAM,QAAQ,KAChD,KAAK,wBAAwB,MAAM;AAErC,IAAM,yBAAyB,CAC7B,MACA,UACY,KAAK,WAAW,MAAM,UAAU,KAAK;AAAA,EAAM,CAAC,MAAM,UAC9D,sBAAsB,MAAM,MAAM,KAAK,CAAE;AAC3C;AAEA,IAAM,wBAAwB,CAAC,SAAuC,KAAK,UAAU;AAAA,EACnF,KAAK,SAAS;AAAA,EACd,KAAK,aAAa;AAAA,EAClB,KAAK,cAAc;AAAA,EACnB,KAAK,sBAAsB;AAAA,EAC3B,KAAK,8BAA8B;AAAA,EACnC,KAAK,YAAY;AAAA,EACjB,KAAK,SAAS;AAAA,EACd,KAAK,YAAY;AAAA,EACjB,KAAK,gBAAgB;AAAA,EACrB,KAAK,QAAQ;AAAA,EACb,KAAK,QAAQ;AAAA,EACb,KAAK,OAAO;AAAA,EACZ,KAAK,YAAY;AAAA,EACjB,KAAK,UAAU;AAAA,EACf,KAAK,WAAW;AAAA,EAChB,KAAK,SAAS;AAAA,EACd,KAAK,SAAS;AAAA,EACd,KAAK,aAAa,CAAC,KAAK,WAAW,OAAO,KAAK,WAAW,IAAI,IAAI;AACpE,CAAC;AAED,IAAM,uBAAuB,CAAC,MAAc,aAC1C,GAAG,KAAK,QAAQ,IAAI,CAAC,KAAK,QAAQ;AAEpC,IAAM,wBAAwB,CAAC,cAAmD,KAAK,UAAU;AAAA,EAC/F,UAAU,WAAW;AAAA,EACrB,UAAU,YAAY;AAAA,EACtB,UAAU,sBAAsB;AAAA,EAChC,UAAU,aAAa,CAAC,UAAU,WAAW,OAAO,UAAU,WAAW,IAAI,IAAI;AAAA,EACjF,UAAU,UAAU;AAAA,EACpB,UAAU,SAAS;AACrB,CAAC;AAED,IAAM,oBAAoB;AAAA,EACxB,MAAM;AAAA,EACN,YAAY;AAAA,IACV,MAAM,EAAE,MAAM,SAAS;AAAA,IACvB,SAAS,EAAE,MAAM,SAAS;AAAA,EAC5B;AAAA,EACA,UAAU,CAAC,QAAQ,SAAS;AAC9B;AAEA,IAAM,uBAAuB;AAAA,EAC3B,MAAM;AAAA,EACN,YAAY;AAAA,IACV,UAAU,EAAE,MAAM,UAAU;AAAA,IAC5B,iBAAiB,EAAE,MAAM,SAAS;AAAA,IAClC,kBAAkB,EAAE,MAAM,SAAS;AAAA,IACnC,eAAe,EAAE,MAAM,SAAS;AAAA,IAChC,oBAAoB,EAAE,MAAM,SAAS;AAAA,IACrC,SAAS;AAAA,MACP,MAAM;AAAA,MACN,OAAO,EAAE,MAAM,SAAS;AAAA,MACxB,aAAa;AAAA,IACf;AAAA,IACA,OAAO;AAAA,EACT;AAAA,EACA,UAAU;AAAA,IACR;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,EACF;AACF;AAEA,IAAM,mBAAmB,CAAC,SAA4C;AAAA,EACpE,MAAM;AAAA,EACN,YAAY;AAAA,IACV,KAAK,EAAE,OAAO,IAAI;AAAA,IAClB,MAAM,EAAE,MAAM,SAAS;AAAA,EACzB;AAAA,EACA,UAAU,CAAC,OAAO,MAAM;AAC1B;AAEA,IAAM,0BAA0B;AAAA,EAC9B,MAAM;AAAA,EACN,YAAY;AAAA,IACV,MAAM,EAAE,OAAO,QAAQ;AAAA,IACvB,WAAW,EAAE,MAAM,SAAS;AAAA,IAC5B,MAAM,EAAE,MAAM,UAAU,MAAM,CAAC,OAAO,MAAM,EAAE;AAAA,IAC9C,OAAO,EAAE,MAAM,SAAS;AAAA,IACxB,SAAS,EAAE,MAAM,CAAC,UAAU,MAAM,EAAE;AAAA,IACpC,UAAU,EAAE,MAAM,CAAC,UAAU,MAAM,EAAE;AAAA,IACrC,kBAAkB,EAAE,MAAM,CAAC,UAAU,MAAM,EAAE;AAAA,IAC7C,MAAM,EAAE,MAAM,SAAS;AAAA,IACvB,MAAM,EAAE,MAAM,CAAC,UAAU,MAAM,EAAE;AAAA,IACjC,MAAM,EAAE,MAAM,CAAC,UAAU,MAAM,EAAE;AAAA,IACjC,KAAK,EAAE,MAAM,CAAC,UAAU,MAAM,EAAE;AAAA,IAChC,UAAU,EAAE,MAAM,CAAC,UAAU,MAAM,EAAE;AAAA,IACrC,QAAQ,EAAE,MAAM,CAAC,UAAU,MAAM,EAAE;AAAA,IACnC,WAAW,EAAE,MAAM,CAAC,UAAU,MAAM,EAAE;AAAA,IACtC,SAAS,EAAE,MAAM,UAAU;AAAA,IAC3B,SAAS,EAAE,MAAM,UAAU,MAAM,CAAC,aAAa,UAAU,WAAW,WAAW,EAAE;AAAA,IACjF,OAAO,EAAE,MAAM,SAAS;AAAA,IACxB,SAAS,EAAE,MAAM,SAAS;AAAA,IAC1B,WAAW,EAAE,MAAM,UAAU;AAAA,IAC7B,QAAQ,iBAAiB,eAAe;AAAA,EAC1C;AAAA,EACA,UAAU;AAAA,IACR;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,EACF;AACF;AAEA,IAAM,4BAA4B;AAAA,EAChC,MAAM;AAAA,EACN,YAAY;AAAA,IACV,MAAM,EAAE,OAAO,UAAU;AAAA,IACzB,WAAW,EAAE,MAAM,SAAS;AAAA,IAC5B,MAAM,EAAE,OAAO,OAAO;AAAA,IACtB,KAAK,EAAE,MAAM,SAAS;AAAA,IACtB,eAAe,EAAE,MAAM,CAAC,UAAU,MAAM,EAAE;AAAA,IAC1C,OAAO,EAAE,MAAM,SAAS;AAAA,IACxB,cAAc,EAAE,MAAM,SAAS;AAAA,IAC/B,0BAA0B,EAAE,MAAM,SAAS;AAAA,IAC3C,QAAQ,iBAAiB,eAAe;AAAA,EAC1C;AAAA,EACA,UAAU;AAAA,IACR;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,EACF;AACF;AAEA,IAAM,wBAAiD;AAAA,EACrD,MAAM;AAAA,EACN,YAAY;AAAA,IACV,MAAM,EAAE,MAAM,UAAU,MAAM,CAAC,WAAW,aAAa,EAAE;AAAA,IACzD,WAAW,EAAE,MAAM,SAAS;AAAA,IAC5B,OAAO,EAAE,MAAM,SAAS;AAAA,IACxB,SAAS,EAAE,MAAM,SAAS;AAAA,IAC1B,WAAW,EAAE,MAAM,UAAU;AAAA,IAC7B,QAAQ,EAAE,MAAM,SAAS;AAAA,IACzB,QAAQ,iBAAiB,eAAe;AAAA,EAC1C;AAAA,EACA,UAAU,CAAC,QAAQ,aAAa,SAAS,WAAW,aAAa,UAAU,QAAQ;AACrF;AAEA,IAAM,qBAA8C;AAAA,EAClD,MAAM;AAAA,EACN,aAAa;AAAA,EACb,YAAY;AAAA,IACV,OAAO,EAAE,MAAM,SAAS;AAAA,IACxB,MAAM;AAAA,MACJ,MAAM;AAAA,MACN,aAAa;AAAA,MACb,OAAO,EAAE,OAAO,CAAC,yBAAyB,2BAA2B,qBAAqB,EAAE;AAAA,IAC9F;AAAA,IACA,MAAM;AAAA,MACJ,OAAO,CAAC,iBAAiB,eAAe,GAAG,EAAE,MAAM,OAAO,CAAC;AAAA,MAC3D,aAAa;AAAA,IACf;AAAA,IACA,UAAU;AAAA,IACV,OAAO;AAAA,EACT;AAAA,EACA,UAAU,CAAC,SAAS,QAAQ,QAAQ,UAAU;AAChD;AAEA,IAAM,qBAA8C;AAAA,EAClD,MAAM;AAAA,EACN,aAAa;AAAA,EACb,YAAY;AAAA,IACV,SAAS,EAAE,MAAM,SAAS;AAAA,IAC1B,YAAY,EAAE,MAAM,SAAS;AAAA,IAC7B,UAAU,EAAE,MAAM,UAAU,MAAM,CAAC,UAAU,KAAK,EAAE;AAAA,IACpD,oBAAoB,EAAE,MAAM,CAAC,UAAU,MAAM,EAAE;AAAA,IAC/C,MAAM;AAAA,MACJ,MAAM;AAAA,MACN,aAAa;AAAA,IACf;AAAA,IACA,OAAO,EAAE,MAAM,SAAS;AAAA,IACxB,YAAY,EAAE,MAAM,SAAS;AAAA,IAC7B,SAAS;AAAA,MACP,MAAM;AAAA,MACN,OAAO;AAAA,QACL,MAAM;AAAA,QACN,YAAY;AAAA,UACV,OAAO,EAAE,MAAM,SAAS;AAAA,UACxB,SAAS,EAAE,MAAM,CAAC,UAAU,MAAM,EAAE;AAAA,UACpC,UAAU,EAAE,MAAM,CAAC,UAAU,MAAM,EAAE;AAAA,UACrC,MAAM,EAAE,MAAM,CAAC,UAAU,MAAM,EAAE;AAAA,UACjC,MAAM,EAAE,MAAM,CAAC,UAAU,MAAM,EAAE;AAAA,UACjC,WAAW,EAAE,MAAM,CAAC,UAAU,MAAM,EAAE;AAAA,UACtC,SAAS,EAAE,MAAM,UAAU;AAAA,UAC3B,MAAM,EAAE,MAAM,SAAS;AAAA,UACvB,WAAW;AAAA,YACT,MAAM;AAAA,YACN,YAAY;AAAA,cACV,OAAO,EAAE,MAAM,SAAS;AAAA,cACxB,KAAK,EAAE,MAAM,SAAS;AAAA,cACtB,OAAO,EAAE,MAAM,SAAS;AAAA,cACxB,UAAU,EAAE,MAAM,UAAU;AAAA,YAC9B;AAAA,YACA,UAAU,CAAC,SAAS,OAAO,SAAS,UAAU;AAAA,UAChD;AAAA,UACA,QAAQ,EAAE,MAAM,UAAU;AAAA,UAC1B,eAAe,EAAE,MAAM,CAAC,UAAU,MAAM,EAAE;AAAA,UAC1C,kBAAkB,EAAE,MAAM,CAAC,UAAU,MAAM,EAAE;AAAA,UAC7C,MAAM,EAAE,MAAM,CAAC,UAAU,MAAM,EAAE;AAAA,UACjC,KAAK,EAAE,MAAM,CAAC,UAAU,MAAM,EAAE;AAAA,UAChC,UAAU,EAAE,MAAM,CAAC,UAAU,MAAM,EAAE;AAAA,UACrC,QAAQ,EAAE,MAAM,CAAC,UAAU,MAAM,EAAE;AAAA,UACnC,SAAS,EAAE,MAAM,UAAU,MAAM,CAAC,aAAa,UAAU,WAAW,WAAW,EAAE;AAAA,UACjF,cAAc,EAAE,MAAM,SAAS,OAAO,EAAE,MAAM,CAAC,UAAU,MAAM,EAAE,EAAE;AAAA,UACnE,WAAW,EAAE,MAAM,SAAS;AAAA,UAC5B,YAAY,EAAE,MAAM,SAAS;AAAA,UAC7B,qBAAqB,EAAE,MAAM,UAAU;AAAA,UACvC,aAAa,EAAE,MAAM,CAAC,UAAU,MAAM,EAAE;AAAA,UACxC,gBAAgB,EAAE,MAAM,CAAC,UAAU,MAAM,EAAE;AAAA,UAC3C,iBAAiB,EAAE,MAAM,CAAC,UAAU,MAAM,EAAE;AAAA,UAC5C,eAAe,EAAE,MAAM,CAAC,UAAU,MAAM,EAAE;AAAA,UAC1C,SAAS,EAAE,MAAM,SAAS;AAAA,UAC1B,YAAY,EAAE,MAAM,SAAS;AAAA,UAC7B,QAAQ,iBAAiB,eAAe;AAAA,QAC1C;AAAA,QACA,UAAU,CAAC,SAAS,WAAW,YAAY,QAAQ,QAAQ,aAAa,WAAW,QAAQ,WAAW;AAAA,MACxG;AAAA,IACF;AAAA,IACA,MAAM;AAAA,MACJ,OAAO,CAAC,iBAAiB,eAAe,GAAG,EAAE,MAAM,OAAO,CAAC;AAAA,MAC3D,aAAa;AAAA,IACf;AAAA,IACA,OAAO;AAAA,EACT;AAAA,EACA,UAAU,CAAC,SAAS;AACtB;AAEA,IAAM,uBAAgD;AAAA,EACpD,MAAM;AAAA,EACN,YAAY;AAAA,IACV,OAAO,EAAE,MAAM,SAAS;AAAA,IACxB,UAAU,EAAE,MAAM,UAAU,MAAM,CAAC,UAAU,KAAK,EAAE;AAAA,IACpD,QAAQ,EAAE,MAAM,SAAS;AAAA,IACzB,OAAO,EAAE,MAAM,SAAS;AAAA,IACxB,WAAW,EAAE,MAAM,UAAU;AAAA,IAC7B,UAAU;AAAA,MACR,MAAM;AAAA,MACN,OAAO;AAAA,QACL,MAAM;AAAA,QACN,YAAY;AAAA,UACV,IAAI,EAAE,MAAM,SAAS;AAAA,UACrB,MAAM,EAAE,MAAM,SAAS;AAAA,UACvB,KAAK,EAAE,MAAM,SAAS;AAAA,UACtB,OAAO,EAAE,MAAM,SAAS;AAAA,UACxB,YAAY,EAAE,MAAM,SAAS;AAAA,UAC7B,MAAM,EAAE,MAAM,UAAU,MAAM,CAAC,OAAO,MAAM,EAAE;AAAA,UAC9C,UAAU,EAAE,MAAM,UAAU,MAAM,CAAC,UAAU,KAAK,EAAE;AAAA,UACpD,oBAAoB,EAAE,MAAM,CAAC,UAAU,MAAM,EAAE;AAAA,QACjD;AAAA,QACA,UAAU;AAAA,UACR;AAAA,UACA;AAAA,UACA;AAAA,UACA;AAAA,UACA;AAAA,UACA;AAAA,UACA;AAAA,UACA;AAAA,QACF;AAAA,MACF;AAAA,IACF;AAAA,IACA,OAAO;AAAA,EACT;AACF;AAEA,IAAM,cAAwC;AAAA,EAC5C;AAAA,IACE,MAAM;AAAA,IACN,aACE;AAAA,IACF,aAAa;AAAA,MACX,MAAM;AAAA,MACN,YAAY;AAAA,QACV,OAAO,EAAE,MAAM,UAAU,WAAW,KAAK;AAAA,QACzC,WAAW;AAAA,UACT,MAAM;AAAA,UACN,MAAM,CAAC,WAAW,UAAU,OAAO;AAAA,UACnC,SAAS;AAAA,UACT,aAAa;AAAA,QACf;AAAA,QACA,YAAY;AAAA,UACV,MAAM;AAAA,UACN,MAAM,CAAC,OAAO,KAAK;AAAA,UACnB,SAAS;AAAA,UACT,aAAa;AAAA,QACf;AAAA,QACA,oBAAoB;AAAA,UAClB,MAAM;AAAA,UACN,aAAa;AAAA,QACf;AAAA,QACA,4BAA4B;AAAA,UAC1B,MAAM;AAAA,UACN,aAAa;AAAA,QACf;AAAA,QACA,UAAU;AAAA,UACR,MAAM;AAAA,UACN,MAAM,CAAC,UAAU,KAAK;AAAA,UACtB,aAAa;AAAA,QACf;AAAA,QACA,OAAO;AAAA,UACL,MAAM;AAAA,UACN,aACE;AAAA,QACJ;AAAA,QACA,QAAQ;AAAA,UACN,MAAM;AAAA,UACN,SAAS;AAAA,UACT,aAAa;AAAA,QACf;AAAA,QACA,UAAU,EAAE,MAAM,UAAU,SAAS,GAAG,SAAS,sBAAsB,SAAS,yBAAyB;AAAA,QACzG,cAAc;AAAA,UACZ,MAAM;AAAA,UACN,SAAS;AAAA,UACT,SAAS;AAAA,UACT,SAAS;AAAA,UACT,aAAa;AAAA,QACf;AAAA,QACA,MAAM;AAAA,UACJ,MAAM;AAAA,UACN,MAAM;AAAA,YACJ;AAAA,YACA;AAAA,YACA;AAAA,YACA;AAAA,YACA;AAAA,YACA;AAAA,YACA;AAAA,YACA;AAAA,YACA;AAAA,YACA;AAAA,YACA;AAAA,YACA;AAAA,YACA;AAAA,UACF;AAAA,UACA,aACE;AAAA,QACJ;AAAA,QACA,MAAM,EAAE,MAAM,SAAS;AAAA,QACvB,KAAK;AAAA,UACH,MAAM;AAAA,UACN,WAAW;AAAA,UACX,aAAa;AAAA,QACf;AAAA,QACA,UAAU;AAAA,UACR,MAAM;AAAA,UACN,WAAW;AAAA,UACX,aAAa;AAAA,QACf;AAAA,QACA,QAAQ;AAAA,UACN,MAAM;AAAA,UACN,WAAW;AAAA,UACX,aAAa;AAAA,QACf;AAAA,QACA,SAAS;AAAA,UACP,MAAM;AAAA,UACN,MAAM,CAAC,aAAa,UAAU,WAAW,WAAW;AAAA,UACpD,aAAa;AAAA,QACf;AAAA,QACA,OAAO,EAAE,MAAM,SAAS;AAAA,QACxB,OAAO,EAAE,MAAM,SAAS;AAAA,QACxB,YAAY;AAAA,UACV,MAAM;AAAA,UACN,aACE;AAAA,UACF,YAAY;AAAA,YACV,OAAO,EAAE,MAAM,UAAU,SAAS,EAAE;AAAA,YACpC,MAAM,EAAE,MAAM,UAAU,SAAS,EAAE;AAAA,UACrC;AAAA,UACA,UAAU,CAAC,SAAS,MAAM;AAAA,UAC1B,sBAAsB;AAAA,QACxB;AAAA,MACF;AAAA,MACA,sBAAsB;AAAA,IACxB;AAAA,IACA,cAAc;AAAA,IACd,MAAM;AAAA,IACN,WAAW;AAAA,EACb;AAAA,EACA;AAAA,IACE,MAAM;AAAA,IACN,aACE;AAAA,IACF,aAAa;AAAA,MACX,MAAM;AAAA,MACN,YAAY;AAAA,QACV,SAAS,EAAE,MAAM,UAAU,aAAa,6CAA6C;AAAA,QACrF,oBAAoB;AAAA,UAClB,MAAM;AAAA,UACN,aAAa;AAAA,QACf;AAAA,QACA,4BAA4B;AAAA,UAC1B,MAAM;AAAA,UACN,aAAa;AAAA,QACf;AAAA,QACA,UAAU;AAAA,UACR,MAAM;AAAA,UACN,MAAM,CAAC,UAAU,KAAK;AAAA,UACtB,aAAa;AAAA,QACf;AAAA,QACA,SAAS,EAAE,MAAM,SAAS,UAAU,4BAA4B,OAAO,EAAE,MAAM,UAAU,SAAS,EAAE,EAAE;AAAA,QACtG,UAAU,EAAE,MAAM,SAAS,UAAU,4BAA4B,OAAO,EAAE,MAAM,UAAU,WAAW,IAAI,EAAE;AAAA,QAC3G,oBAAoB,EAAE,MAAM,SAAS,UAAU,4BAA4B,OAAO,EAAE,MAAM,UAAU,WAAW,IAAI,EAAE;AAAA,QACrH,YAAY;AAAA,UACV,MAAM;AAAA,UACN,YAAY;AAAA,YACV,OAAO,EAAE,MAAM,UAAU,SAAS,EAAE;AAAA,YACpC,MAAM,EAAE,MAAM,UAAU,SAAS,EAAE;AAAA,UACrC;AAAA,UACA,UAAU,CAAC,SAAS,MAAM;AAAA,UAC1B,sBAAsB;AAAA,QACxB;AAAA,QACA,QAAQ;AAAA,UACN,MAAM;AAAA,UACN,SAAS;AAAA,UACT,SAAS;AAAA,UACT,SAAS;AAAA,UACT,aAAa;AAAA,QACf;AAAA,QACA,OAAO;AAAA,UACL,MAAM;AAAA,UACN,SAAS;AAAA,UACT,SAAS;AAAA,UACT,SAAS;AAAA,UACT,aAAa;AAAA,QACf;AAAA,QACA,aAAa;AAAA,UACX,MAAM;AAAA,UACN,SAAS;AAAA,UACT,aAAa;AAAA,QACf;AAAA,QACA,YAAY;AAAA,UACV,MAAM;AAAA,UACN,SAAS;AAAA,UACT,aAAa;AAAA,QACf;AAAA,QACA,UAAU;AAAA,UACR,MAAM;AAAA,UACN,SAAS;AAAA,UACT,SAAS;AAAA,UACT,SAAS;AAAA,UACT,aAAa;AAAA,QACf;AAAA,QACA,YAAY;AAAA,UACV,MAAM;AAAA,UACN,SAAS;AAAA,UACT,SAAS;AAAA,UACT,SAAS;AAAA,UACT,aAAa;AAAA,QACf;AAAA,MACF;AAAA,MACA,UAAU,CAAC,SAAS;AAAA,MACpB,sBAAsB;AAAA,IACxB;AAAA,IACA,cAAc;AAAA,IACd,MAAM;AAAA,IACN,WAAW;AAAA,EACb;AAAA,EACA;AAAA,IACE,MAAM;AAAA,IACN,aAAa;AAAA,IACb,aAAa;AAAA,MACX,MAAM;AAAA,MACN,YAAY;AAAA,QACV,OAAO;AAAA,UACL,MAAM;AAAA,UACN,aACE;AAAA,QACJ;AAAA,QACA,UAAU;AAAA,UACR,MAAM;AAAA,UACN,MAAM,CAAC,UAAU,KAAK;AAAA,UACtB,aAAa;AAAA,QACf;AAAA,QACA,OAAO;AAAA,UACL,MAAM;AAAA,UACN,SAAS;AAAA,UACT,aAAa;AAAA,QACf;AAAA,QACA,QAAQ;AAAA,UACN,MAAM;AAAA,UACN,SAAS;AAAA,UACT,aAAa;AAAA,QACf;AAAA,MACF;AAAA,MACA,sBAAsB;AAAA,IACxB;AAAA,IACA,cAAc;AAAA,IACd,MAAM;AAAA,IACN,WAAW;AAAA,EACb;AACF;AAMA,IAAM,6BAAqD;AAAA,EACzD,KAAK;AAAA,EACL,MAAM;AAAA,EACN,WAAW;AAAA,EACX,QAAQ;AAAA,EACR,KAAK;AAAA,EACL,SAAS;AACX;AAEA,IAAM,2BAAiE;AAAA,EACrE,QAAQ,EAAE,QAAQ,EAAE,OAAO,2BAA2B,EAAE;AAAA,EACxD,UAAU,EAAE,QAAQ,EAAE,OAAO,2BAA2B,EAAE;AAC5D;AAKO,IAAM,sBAAsB;AAAA,EACjC,MAAM;AAAA,EACN;AACF;AAkBA,IAAM,gBAAgB,CAAC,OAAgB,WAAmC;AACxE,MAAI,UAAU,OAAW,QAAO;AAChC,MAAI,UAAU,YAAY,UAAU,MAAO,QAAO;AAClD,QAAM,IAAI,MAAM,GAAG,MAAM,qCAAqC;AAChE;AAEA,IAAM,iBAAiB,CAAC,OAAgB,WAAoC;AAC1E,MAAI,UAAU,OAAW,QAAO;AAChC,MAAI,UAAU,aAAa,UAAU,YAAY,UAAU,QAAS,QAAO;AAC3E,QAAM,IAAI,MAAM,GAAG,MAAM,oDAAoD;AAC/E;AAEA,IAAM,kBAAkB,CAAC,OAAgB,MAAuB,WAAqC;AACnG,MAAI,UAAU,OAAW,QAAO;AAChC,MAAI,UAAU,SAAS,UAAU,MAAO,OAAM,IAAI,MAAM,GAAG,MAAM,oCAAoC;AACrG,MAAI,SAAS,UAAW,OAAM,IAAI,MAAM,GAAG,MAAM,kDAAkD;AACnG,SAAO;AACT;AAEA,IAAM,sBAAsB,CAC1B,QACA,UACA,UACA,uBACwB;AAAA,EACxB,UAAU,OAAO,YAAY,GAAG,QAAQ;AAAA,EACxC,eAAe,OAAO;AAAA,EACtB;AAAA,EACA,eAAe,OAAO,iBAAiB;AAAA,EACvC,iBAAiB,OAAO,mBAAmB;AAAA,EAC3C,GAAI,oBAAoB,EAAE,kBAAkB,IAAI,CAAC;AAAA,EACjD,aAAa,OAAO,eAAe;AAAA,EACnC,aAAa,OAAO,eAAe;AAAA,EACnC,GAAI,OAAO,2BAA2B,SAClC,CAAC,IAAI,EAAE,wBAAwB,OAAO,uBAAuB;AAAA,EACjE,GAAI,OAAO,sBAAsB,SAAY,CAAC,IAAI,EAAE,mBAAmB,OAAO,kBAAkB;AAAA,EAChG,GAAI,OAAO,oBAAoB,SAAY,CAAC,IAAI,EAAE,iBAAiB,OAAO,gBAAgB;AAAA,EAC1F,GAAI,OAAO,uBAAuB,SAAY,CAAC,IAAI,EAAE,oBAAoB,OAAO,mBAAmB;AAAA,EACnG,GAAI,OAAO,yBAAyB,SAChC,CAAC,IAAI,EAAE,sBAAsB,OAAO,qBAAqB;AAC/D;AAEA,IAAM,kBAAkB,CAAC,MAAoB,YAAiD;AAC5F,QAAM,MAAM;AAAA,IACV,QAAQ;AAAA,IACR,OAAO;AAAA,IACP,mBAAmB,QAAQ,WAAW;AAAA,EACxC;AACA,QAAM,QAAQ,IAAI,IAAI,IAAI,IAAI,CAAC,QAAQ,IAAI,IAAI,CAAC;AAChD,aAAW,OAAO,MAAM;AACtB,QAAI,CAAC,MAAM,IAAI,IAAI,IAAI,EAAG,KAAI,KAAK,GAAG;AAAA,EACxC;AACA,SAAO;AACT;AAEA,IAAM,cAAc,CAClB,OACA,SACA,kBACoB;AACpB,QAAM,iBAAiB,SAAS;AAChC,QAAM,QAA2B;AAAA,IAC/B,UAAU,QAAQ;AAAA,IAClB,KAAK,QAAQ;AAAA,IACb,OAAO;AAAA,IACP,aAAa,gBAAgB,QAAQ,OAAO,cAAc,OAAO;AAAA,EACnE;AACA,MAAI,QAAQ,UAAW,OAAM,YAAY,QAAQ;AACjD,MAAI,QAAQ,YAAa,OAAM,cAAc,QAAQ;AACrD,SAAO,aAAa,KAAK;AAC3B;AAEA,IAAM,qBAAqB,CACzB,YACwD;AACxD,MAAI,CAAC,QAAQ,eAAe,CAAC,QAAQ,cAAe,QAAO;AAC3D,QAAM,UAAU,KAAK,QAAQ,QAAQ,WAAW;AAChD,SAAO,CAAC,gBAAgB,KAAK,QAAQ,WAAW,MAAM,UAClD,QAAQ,gBAAgB,IACxB;AACN;AAEA,IAAM,oBAAoB,CACxB,aACA,oBACA,kBACA,4BACA,8BACI;AAAA,EACJ,MAAM;AAAA,EACN,SAAS,+BAA+B,UACtC,+BAA+B,2BAC7B,iEACA;AAAA,EACJ;AAAA,EACA,GAAI,uBAAuB,SAAY,CAAC,IAAI,EAAE,mBAAmB;AAAA,EACjE;AAAA,EACA,GAAI,+BAA+B,SAAY,CAAC,IAAI,EAAE,2BAA2B;AAAA,EACjF,GAAI,6BAA6B,SAAY,CAAC,IAAI,EAAE,yBAAyB;AAC/E;AAEA,IAAM,eAAe,CAAC,SAAiB,gBAAyB;AAAA,EAC9D,MAAM;AAAA,EACN;AAAA,EACA,GAAI,eAAe,SAAY,CAAC,IAAI,EAAE,WAAW;AACnD;AAEA,IAAM,uBAAuB,CAAC,gBAAiC;AAAA,EAC7D,MAAM,WAAW,QAAQ,CAAC,KAAK;AAAA,EAC/B,SACE;AAAA,EACF,sBAAsB,WAAW;AACnC;AAEA,IAAM,gBAAgB,CAAC,WAAsE;AAAA,EAC3F,OAAO;AAAA,EACP,MAAM,CAAC;AAAA,EACP,MAAM;AAAA,EACN,UAAU;AAAA,IACR,UAAU;AAAA,IACV,iBAAiB;AAAA,IACjB,kBAAkB;AAAA,IAClB,eAAe;AAAA,IACf,oBAAoB;AAAA,IACpB,SAAS,CAAC,MAAM,IAAI;AAAA,EACtB;AAAA,EACA;AACF;AAEO,IAAM,iBAAN,MAA+C;AAAA,EASpD,YAA6B,SAAgC;AAAhC;AAAA,EAAiC;AAAA,EARrD,OAAO;AAAA,EACP,cACP;AAAA,EAEM;AAAA,EACA;AAAA,EACS,qBAAqB,oBAAI,IAA+B;AAAA,EAIjE,iBAAiB,QAAqE;AAC5F,QAAI,KAAK,YAAY,WAAW,QAAQ;AACtC,WAAK,aAAa,EAAE,QAAQ,SAAS,IAAI,iBAAiB,MAAM,EAAE;AAAA,IACpE;AACA,WAAO,KAAK,WAAW;AAAA,EACzB;AAAA,EAEQ,yBACN,KACA,cACqC;AACrC,UAAM,SAAS,KAAK;AACpB,QAAI,CAAC,UAAU,OAAO,QAAQ,IAAK,QAAO;AAC1C,QACE,CAAC,gBACD,KAAK,IAAI,IAAI,OAAO,YAAY,6BAChC,CAAC,uBAAuB,OAAO,cAAc,YAAY,GACzD;AACA,WAAK,qBAAqB;AAC1B,aAAO;AAAA,IACT;AACA,WAAO,YAAY,KAAK,IAAI;AAC5B,WAAO;AAAA,EACT;AAAA,EAEQ,2BAA2B,QAAuC;AACxE,SAAK,qBAAqB;AAAA,EAC5B;AAAA,EAEQ,yBAAyB,QAAuC;AACtE,QAAI,KAAK,uBAAuB,OAAQ,MAAK,qBAAqB;AAAA,EACpE;AAAA,EAEQ,wBACN,MACA,UACA,aAC+B;AAC/B,UAAM,MAAM,qBAAqB,MAAM,QAAQ;AAC/C,UAAM,SAAS,KAAK,mBAAmB,IAAI,GAAG;AAC9C,QAAI,CAAC,OAAQ,QAAO;AACpB,QACE,CAAC,eACD,KAAK,IAAI,IAAI,OAAO,YAAY,6BAChC,CAAC,sBAAsB,OAAO,aAAa,WAAW,GACtD;AACA,WAAK,mBAAmB,OAAO,GAAG;AAClC,aAAO;AAAA,IACT;AACA,WAAO,YAAY,KAAK,IAAI;AAC5B,SAAK,mBAAmB,OAAO,GAAG;AAClC,SAAK,mBAAmB,IAAI,KAAK,MAAM;AACvC,WAAO;AAAA,EACT;AAAA,EAEQ,0BAA0B,UAAmC;AACnE,UAAM,MAAM,qBAAqB,SAAS,MAAM,SAAS,QAAQ;AACjE,SAAK,mBAAmB,OAAO,GAAG;AAClC,SAAK,mBAAmB,IAAI,KAAK,QAAQ;AACzC,WAAO,KAAK,mBAAmB,OAAO,0BAA0B;AAC9D,YAAM,SAAS,KAAK,mBAAmB,KAAK,EAAE,KAAK,EAAE;AACrD,UAAI,WAAW,OAAW;AAC1B,WAAK,mBAAmB,OAAO,MAAM;AAAA,IACvC;AAAA,EACF;AAAA,EAEQ,2BACN,UACA,MACA,WACM;AACN,eAAW,OAAO,IAAI,IAAI,IAAI,GAAG;AAC/B,eAAS,WAAW,OAAO,GAAG;AAC9B,eAAS,WAAW,IAAI,KAAK,SAAS;AAAA,IACxC;AACA,WAAO,SAAS,WAAW,OAAO,2BAA2B;AAC3D,YAAM,SAAS,SAAS,WAAW,KAAK,EAAE,KAAK,EAAE;AACjD,UAAI,WAAW,OAAW;AAC1B,eAAS,WAAW,OAAO,MAAM;AAAA,IACnC;AAAA,EACF;AAAA,EAEQ,wBAAwB,UAAmC;AACjE,UAAM,MAAM,qBAAqB,SAAS,MAAM,SAAS,QAAQ;AACjE,QAAI,KAAK,mBAAmB,IAAI,GAAG,MAAM,SAAU,MAAK,mBAAmB,OAAO,GAAG;AAAA,EACvF;AAAA,EAEA,MAAM,KACJ,SACA,UACmC;AACnC,UAAM,QAAQ,QAAQ,OAAO,YAAY;AACzC,WAAO,QACH,YAAY;AAAA,MAAO,CAAC,eAClB,GAAG,WAAW,IAAI,IAAI,WAAW,WAAW,GAAG,YAAY,EAAE,SAAS,KAAK;AAAA,IAC7E,IACA;AAAA,EACN;AAAA,EAEA,MAAM,SACJ,YACA,UAC6C;AAC7C,WAAO,YAAY,KAAK,CAAC,eAAe,WAAW,SAAS,UAAU;AAAA,EACxE;AAAA,EAEA,iBACE,YACA,MACyB;AACzB,WAAO,oBAAoB,YAAY,IAAI;AAAA,EAC7C;AAAA,EAEA,MAAM,OACJ,YACA,MACA,mBACkB;AAClB,QAAI;AACF,UAAI,KAAK,QAAQ,QAAQ,eAAe,YAAY,eAAe,WAAW;AAC5E,cAAM,UAAU,KAAK,iBAAiB,KAAK,QAAQ,GAAG;AACtD,YAAI,eAAe,SAAU,QAAO,QAAQ,OAAO,IAAI;AACvD,cAAM,YAAY,eAAe,KAAK,WAAW,eAAe;AAChE,cAAM,aAAa,gBAAgB,KAAK,YAAY,WAAW,eAAe;AAC9E,eAAO,QAAQ,OAAO,EAAE,GAAG,MAAM,WAAW,WAAW,CAAC;AAAA,MAC1D;AACA,cAAQ,YAAY;AAAA,QAClB,KAAK;AACH,iBAAO,MAAM,KAAK,OAAO,MAAM,iBAAiB;AAAA,QAClD,KAAK;AACH,iBAAO,MAAM,KAAK,OAAO,IAAI;AAAA,QAC/B,KAAK;AACH,iBAAO,MAAM,KAAK,SAAS,IAAI;AAAA,QACjC;AACE,gBAAM,IAAI,MAAM,0BAA0B,UAAU,EAAE;AAAA,MAC1D;AAAA,IACF,SAAS,OAAO;AACd,YAAM,SACJ,iBAAiB,wBACb;AAAA,QACE,MAAM,MAAM;AAAA,QACZ,SAAS,MAAM;AAAA,QACf,SAAS,MAAM;AAAA,QACf,YAAY,MAAM;AAAA,MACpB,IACA,iBAAiB,2BACf;AAAA,QACE,MAAM,MAAM;AAAA,QACZ,SAAS,MAAM;AAAA,QACf,SAAS,MAAM;AAAA,QACf,aAAa,MAAM;AAAA,QACnB,QAAQ,MAAM;AAAA,MAChB,IACA;AACR,UAAI,QAAQ;AACV,YAAI,eAAe,SAAU,QAAO,cAAc,MAAM;AACxD,YAAI,eAAe,SAAU,QAAO,EAAE,SAAS,CAAC,GAAG,MAAM,MAAM,OAAO,OAAO;AAC7E,eAAO,EAAE,OAAO,OAAO;AAAA,MACzB;AACA,YAAM;AAAA,IACR;AAAA,EACF;AAAA,EAEA,MAAc,OACZ,MACA,mBACkB;AAClB,UAAM,QAAQ,OAAO,KAAK,UAAU,WAAW,KAAK,QAAQ;AAC5D,UAAM,YAAY,eAAe,KAAK,WAAW,eAAe;AAChE,UAAM,aAAa,gBAAgB,KAAK,YAAY,WAAW,eAAe;AAC9E,UAAM,qBAAqB,OAAO,KAAK,uBAAuB,WAC1D,KAAK,qBACL;AACJ,UAAM,6BAA6B,OAAO,KAAK,+BAA+B,WAC1E,KAAK,6BACL;AACJ,UAAM,WAAW,cAAc,KAAK,UAAU,eAAe;AAC7D,UAAM,QAAQ,OAAO,KAAK,UAAU,WAAW,KAAK,QAAQ;AAC5D,UAAM,OAAO,OAAO,KAAK,SAAS,WAAW,KAAK,OAAO;AACzD,UAAM,OAAO,OAAO,KAAK,SAAS,WAAW,KAAK,OAAO;AACzD,UAAM,MAAM,OAAO,KAAK,QAAQ,WAAW,KAAK,MAAM;AACtD,UAAM,WAAW,OAAO,KAAK,aAAa,WAAW,KAAK,WAAW;AACrE,UAAM,SAAS,OAAO,KAAK,WAAW,WAAW,KAAK,SAAS;AAC/D,UAAM,aAAa,KAAK;AACxB,QACE,eAAe,UACf,eAAe,eACf,eAAe,YACf,eAAe,aACf,eAAe,aACf;AACA,YAAM,IAAI,MAAM,wEAAwE;AAAA,IAC1F;AACA,UAAM,UAAU;AAChB,UAAM,QAAQ,OAAO,KAAK,UAAU,WAAW,KAAK,QAAQ;AAC5D,UAAM,QAAQ,OAAO,KAAK,UAAU,WAAW,KAAK,QAAQ;AAC5D,UAAM,SAAS,OAAO,KAAK,WAAW,YAAY,KAAK,UAAU,IAC7D,KAAK,MAAM,KAAK,MAAM,IACtB;AACJ,UAAM,WACJ,OAAO,KAAK,aAAa,YAAY,KAAK,YAAY,IAClD,KAAK,IAAI,KAAK,MAAM,KAAK,QAAQ,GAAG,oBAAoB,IACxD;AACN,UAAM,eACJ,OAAO,KAAK,iBAAiB,YAAY,KAAK,gBAAgB,KAC1D,KAAK,IAAI,KAAK,MAAM,KAAK,YAAY,GAAG,wBAAwB,IAChE;AAEN,UAAM,aAAa,YAAY,OAAO,KAAK,SAAS,KAAK;AACzD,UAAM,OAAO,WAAW;AACxB,UAAM,eAAe,mBAAmB,KAAK,OAAO;AACpD,UAAM,UAAU;AAAA,MACd,KAAK,QAAQ;AAAA,MACb,KAAK,QAAQ;AAAA,MACb;AAAA,MACA;AAAA,IACF;AACA,UAAM,UAAU,OAAO,KAAK,EAAE,WAAW,UAAU,KAAK;AACxD,SAAK,uBAAuB,UAAa,+BAA+B,WAAc,CAAC,SAAS;AAC9F,YAAM,IAAI,MAAM,yEAAyE;AAAA,IAC3F;AAEA,UAAM,WAAW,KAAK;AACtB,UAAM,aAAa,YAAY,OAAO,aAAa,YAAY,CAAC,MAAM,QAAQ,QAAQ,IAClF,WACA;AACJ,UAAM,QAAQ,YAAY;AAC1B,UAAM,OAAO,YAAY;AACzB,QAAK,UAAU,YAAgB,SAAS,SAAY;AAClD,YAAM,IAAI,MAAM,uDAAuD;AAAA,IACzE;AACA,SAAK,UAAU,UAAa,SAAS,WAAc,CAAC,SAAS;AAC3D,YAAM,IAAI,MAAM,8DAA8D;AAAA,IAChF;AACA,QAAI,UAAU,WACZ,OAAO,UAAU,YACjB,OAAO,SAAS,YAChB,CAAC,OAAO,cAAc,KAAK,KAC3B,CAAC,OAAO,cAAc,IAAI,KAC1B,QAAQ,KACR,OAAO,QACN;AACD,aAAO,cAAc,aAAa,6DAA6D,CAAC;AAAA,IAClG;AACA,UAAM,gBACJ,OAAO,UAAU,YAAY,OAAO,SAAS,WAAW,EAAE,OAAO,KAAK,IAAI;AAC5E,UAAM,UAAyB,CAAC;AAChC,QAAI,KAAM,SAAQ,OAAO;AACzB,QAAI,KAAM,SAAQ,OAAO;AACzB,QAAI,IAAK,SAAQ,MAAM;AACvB,QAAI,SAAU,SAAQ,WAAW;AACjC,QAAI,OAAQ,SAAQ,SAAS;AAC7B,QAAI,QAAS,SAAQ,UAAU;AAC/B,QAAI,UAAU,OAAW,SAAQ,QAAQ;AACzC,QAAI,UAAU,OAAW,SAAQ,QAAQ;AACzC,UAAM,kBAAwC;AAAA,MAC5C,GAAI,UAAU,SAAY,CAAC,IAAI,EAAE,MAAM;AAAA,MACvC;AAAA,MACA,GAAI,cAAc,YAAY,EAAE,WAAW,IAAI,CAAC;AAAA,MAChD,GAAI,qBAAqB,EAAE,mBAAmB,IAAI,CAAC;AAAA,MACnD,GAAI,6BAA6B,EAAE,2BAA2B,IAAI,CAAC;AAAA,MACnE;AAAA,MACA,OAAO,SAAS;AAAA,MAChB,GAAI,WAAW,SAAY,CAAC,IAAI,EAAE,OAAO;AAAA,MACzC;AAAA,MACA;AAAA,MACA,GAAI,OAAO,EAAE,KAAK,IAAI,CAAC;AAAA,MACvB,GAAI,OAAO,EAAE,KAAK,IAAI,CAAC;AAAA,MACvB,GAAI,MAAM,EAAE,IAAI,IAAI,CAAC;AAAA,MACrB,GAAI,WAAW,EAAE,SAAS,IAAI,CAAC;AAAA,MAC/B,GAAI,SAAS,EAAE,OAAO,IAAI,CAAC;AAAA,MAC3B,GAAI,UAAU,EAAE,QAAQ,IAAI,CAAC;AAAA,MAC7B,GAAI,UAAU,SAAY,EAAE,MAAM,IAAI,CAAC;AAAA,MACvC,GAAI,UAAU,SAAY,EAAE,MAAM,IAAI,CAAC;AAAA,MACvC,GAAI,gBAAgB,EAAE,YAAY,cAAc,IAAI,CAAC;AAAA,IACvD;AACA,UAAM,iBAAiB,CAAC,iBAAqC;AAC3D,wBAAkB;AAAA,QAChB,aAAa,cAAc,eACvB,kBAAkB,aAAa,YAAY,wBAC3C,aAAa,cAAc,aACzB,kBAAkB,aAAa,YAAY,sBAC3C,QACE,kBAAkB,aAAa,YAAY,aAC3C,kBAAkB,aAAa,YAAY;AAAA,MACrD;AAAA,IACF;AACA,UAAM,qBAAqB,eAAe,MAAM,UAAU,YAAY;AACtE,UAAM,SAAS,WAAW,SACtB,SACA,KAAK;AAAA,MACH,sBAAsB,eAAe;AAAA,MACrC;AAAA,IACF;AACJ,QAAI,QAAQ;AACV,YAAMA,YAAW,cAAc;AAAA,QAC7B,QAAQ,OAAO;AAAA,QACf,GAAI,UAAU,SAAY,CAAC,IAAI,EAAE,MAAM;AAAA,QACvC;AAAA,QACA,UAAU,OAAO;AAAA,QACjB,GAAI,WAAW,SAAY,CAAC,IAAI,EAAE,OAAO;AAAA,QACzC;AAAA,QACA;AAAA,QACA,aAAa,OAAO;AAAA,MACtB,CAAC;AACD,YAAM,8BAA8B,eAAe,MAAM,UAAU,YAAY;AAC/E,UACE,sBACA,+BACA,uBAAuB,oBAAoB,2BAA2B,GACtE;AACA,YAAIA,UAAS,SAAS,KAAM,MAAK,yBAAyB,MAAM;AAChE,uBAAe,OAAO,MAAM;AAC5B,eAAOA;AAAA,MACT;AACA,WAAK,yBAAyB,MAAM;AAAA,IACtC;AAEA,QAAI,WAAW,KAAK,CAAC,GAAG;AACtB,YAAM,QAAQ,kBAAkB,KAAK,CAAC,EAAE,IAAI;AAC5C,YAAM,UAAU;AAAA,QACd,KAAK,CAAC,EAAE;AAAA,QACR;AAAA,QACA,eAAe,KAAK,CAAC,EAAE,IAAI;AAAA,MAC7B;AACA,YAAM,gBAAgB,uBAAuB,UAC3C,OAAO,eAAe;AACxB,YAAM,iBAAiB,+BAA+B,UACpD,QAAQ,gBAAgB;AAC1B,UAAI,UAAU,iBAAiB,iBAAiB;AAC9C,eAAO,cAAc;AAAA,UACnB,KAAK,CAAC,EAAE;AAAA,UACR;AAAA,UACA,MAAM;AAAA,UACN;AAAA,UACA,QAAQ;AAAA,QACV,CAAC;AAAA,MACH;AAAA,IACF;AAEA,UAAM,QAAQ;AAAA,MACZ;AAAA,MACA,gBAAgB,MAAM,KAAK,OAAO;AAAA,MAClC;AAAA,MACA;AAAA,MACA;AAAA,IACF;AACA,UAAM,gBAAgB,MAAM,OAAO,CAAC;AACpC,UAAM,wBAAwB,uBAAuB,UACnD,eAAe,eAAe;AAChC,UAAM,yBAAyB,+BAA+B,UAC5D,eAAe,uBAAuB;AACxC,QAAI,WAAW,kBAAkB,yBAAyB,yBAAyB;AACjF,aAAO,cAAc;AAAA,QACnB,cAAc;AAAA,QACd;AAAA,QACA,cAAc;AAAA,QACd;AAAA,QACA,cAAc;AAAA,MAChB,CAAC;AAAA,IACH;AACA,QACE,WACA,iBACA,MAAM,OAAO,CAAC,KACd,cAAc,QAAQ,MAAM,OAAO,CAAC,EAAE,iBACtC;AACA,aAAO,cAAc;AAAA,QACnB,uBAAuB,cAAc,IAAI,yBAAyB,MAAM,OAAO,CAAC,EAAE,eAAe;AAAA,QACjG,MAAM,OAAO,CAAC,EAAE;AAAA,MAClB,CAAC;AAAA,IACH;AAEA,UAAM,cAAc;AAAA,MAClB,GAAI,UAAU,SAAY,CAAC,IAAI,EAAE,MAAM;AAAA,MACvC;AAAA,MACA;AAAA,MACA;AAAA,MACA,aAAa;AAAA,QACX,iBAAiB,KAAK,QAAQ,OAAO,wBAChC;AAAA,QACL,kBAAkB,KAAK,QAAQ,OAAO,yBACjC;AAAA,QACL,kBAAkB,KAAK,QAAQ,OAAO,yBACjC;AAAA,QACL,WAAW,KAAK,QAAQ,OAAO,kBAAkB;AAAA,MACnD;AAAA,IACF;AACA,UAAM,SAAS,MAAM,kBAAkB,MAAM,QAAQ,MAAM,SAAS,WAAW;AAC/E,UAAM,WAAW;AAAA,MACf,GAAG,MAAM;AAAA,MACT,UAAU,MAAM,SAAS,YAAY,OAAO,cAAc,YACrD,WAAW,QAAQ,WAAW;AAAA,MACnC,SAAS;AAAA,QACP,GAAG,oBAAI,IAAI;AAAA,UACT,GAAG,MAAM,SAAS;AAAA,UAClB,GAAG,OAAO,cAAc;AAAA,UACxB,GAAG,WAAW;AAAA,QAChB,CAAC;AAAA,MACH,EAAE,KAAK;AAAA,MACP,GAAI,OAAO,cAAc,QAAQ,EAAE,OAAO,OAAO,cAAc,MAAM,IAAI,CAAC;AAAA,IAC5E;AACA,UAAM,UAAU,KAAK,WAAW,IAAI,KAAK,CAAC,IAAI;AAC9C,UAAM,YAAY,UACd,MAAM,OAAO,KAAK,CAAC,cAAc,UAAU,gBAAgB,QAAQ,IAAI,IACvE;AACJ,UAAM,aAAa,UACf,MAAM,QAAQ,KAAK,CAAC,cAAc,UAAU,SAAS,QAAQ,IAAI,IACjE;AACJ,UAAM,sBAAsB,YAAY,WAAW,cAAc,YAAY,cACzE;AAAA,MACE,MAAM,QAAQ;AAAA,MACd,YAAY,WAAW,cAAc,WAAY;AAAA,MACjD,oBAAoB,WAAW,sBAAsB,WAAY;AAAA,IACnE,IACA;AACJ,UAAM,cAAoC;AAAA,MACxC,GAAG;AAAA,MACH,GAAK,sBAAsB,qBAAqB,aAC5C,EAAE,oBAAoB,sBAAsB,oBAAqB,WAAW,IAC5E,CAAC;AAAA,MACL,GAAK,8BAA8B,qBAAqB,qBACpD;AAAA,QACE,4BACE,8BAA8B,oBAAqB;AAAA,MACvD,IACA,CAAC;AAAA,MACL,OAAO,sBACH,WAAW,oBAAoB,IAAI,KACnC,gBAAgB,SAAS;AAAA,IAC/B;AACA,UAAM,WAAW,cAAc;AAAA,MAC7B;AAAA,MACA,GAAI,UAAU,SAAY,CAAC,IAAI,EAAE,MAAM;AAAA,MACvC;AAAA,MACA;AAAA,MACA,GAAI,WAAW,SAAY,CAAC,IAAI,EAAE,OAAO;AAAA,MACzC;AAAA,MACA;AAAA,MACA;AAAA,IACF,CAAC;AACD,UAAM,oBAAoB,eAAe,MAAM,UAAU,YAAY;AACrE,QACE,SAAS,SAAS,QAClB,sBACA,qBACA,uBAAuB,oBAAoB,iBAAiB,GAC5D;AACA,WAAK,2BAA2B;AAAA,QAC9B,KAAK,sBAAsB,WAAW;AAAA,QACtC;AAAA,QACA;AAAA,QACA;AAAA,QACA,cAAc;AAAA,QACd,WAAW,KAAK,IAAI;AAAA,MACtB,CAAC;AAAA,IACH;AACA,mBAAe,MAAM;AACrB,WAAO;AAAA,EACT;AAAA,EAEA,MAAc,OAAO,MAAiD;AACpE,UAAM,UAAU,OAAO,KAAK,YAAY,WAAW,KAAK,UAAU;AAClE,UAAM,qBAAqB,OAAO,KAAK,uBAAuB,WAC1D,KAAK,qBACL;AACJ,UAAM,6BAA6B,OAAO,KAAK,+BAA+B,WAC1E,KAAK,6BACL;AACJ,UAAM,WAAW,cAAc,KAAK,UAAU,eAAe;AAC7D,UAAM,aAAa,KAAK;AACxB,QAAI,eAAe,UAAa,CAAC,MAAM,QAAQ,UAAU,GAAG;AAC1D,YAAM,IAAI,MAAM,wCAAwC;AAAA,IAC1D;AACA,QAAI,MAAM,QAAQ,UAAU,KAAK,CAAC,WAAW,MAAM,CAAC,UAClD,OAAO,UAAU,YAAY,OAAO,cAAc,KAAK,KAAK,SAAS,CAAC,GAAG;AACzE,aAAO,EAAE,SAAS,OAAO,aAAa,wDAAwD,GAAG,SAAS,CAAC,EAAE;AAAA,IAC/G;AACA,UAAM,UAAW,cAAuC,CAAC;AACzD,UAAM,WAAW,MAAM,QAAQ,KAAK,QAAQ,IACxC,KAAK,SAAS;AAAA,MACZ,CAAC,YAA+B,OAAO,YAAY,YAAY,QAAQ,SAAS;AAAA,IAClF,IACA,CAAC;AACL,UAAM,qBAAqB,MAAM,QAAQ,KAAK,kBAAkB,IAC5D,KAAK,mBAAmB;AAAA,MACtB,CAAC,YAA+B,OAAO,YAAY,YAAY,QAAQ,SAAS;AAAA,IAClF,IACA,CAAC;AACL,QAAI,QAAQ,SAAS,SAAS,SAAS,mBAAmB,SAAS,4BAA4B;AAC7F,YAAM,IAAI,MAAM,iCAAiC,0BAA0B,2BAA2B;AAAA,IACxG;AACA,UAAM,WAAW,KAAK;AACtB,UAAM,cAAc,YAAY,OAAO,aAAa,YAAY,CAAC,MAAM,QAAQ,QAAQ,IACnF,WACA;AACJ,UAAM,QAAQ,aAAa;AAC3B,UAAM,OAAO,aAAa;AAC1B,QAAI,CAAC,QAAS,OAAM,IAAI,MAAM,kCAAkC;AAChE,QAAK,UAAU,YAAgB,SAAS,SAAY;AAClD,YAAM,IAAI,MAAM,uDAAuD;AAAA,IACzE;AACA,QAAI,UAAU,WACZ,OAAO,UAAU,YACjB,OAAO,SAAS,YAChB,CAAC,OAAO,cAAc,KAAK,KAC3B,CAAC,OAAO,cAAc,IAAI,KAC1B,QAAQ,KACR,OAAO,QACN;AACD,aAAO,EAAE,SAAS,OAAO,aAAa,6DAA6D,GAAG,SAAS,CAAC,EAAE;AAAA,IACpH;AACA,UAAM,UAAU,CAAC,OAAgB,UAAkB,YACjD,OAAO,UAAU,YAAY,OAAO,cAAc,KAAK,KAAK,SAAS,IACjE,KAAK,IAAI,OAAO,OAAO,IACvB;AACN,UAAM,SAAS,QAAQ,KAAK,QAAQ,GAAG,kBAAkB;AACzD,UAAM,QAAQ,QAAQ,KAAK,OAAO,GAAG,kBAAkB;AACvD,UAAM,cAAc,QAAQ,KAAK,aAAa,GAAG,OAAO,gBAAgB;AACxE,UAAM,aAAa,QAAQ,KAAK,YAAY,GAAG,OAAO,gBAAgB;AACtE,UAAM,WAAW,KAAK,IAAI,KAAK,QAAQ,KAAK,UAAU,0BAA0B,gBAAgB,CAAC;AACjG,UAAM,aAAa,KAAK,IAAI,GAAG,QAAQ,KAAK,YAAY,4BAA4B,kBAAkB,CAAC;AAEvG,UAAM,MAAM;AAAA,MACV,KAAK,QAAQ;AAAA,MACb;AAAA,MACA,mBAAmB,KAAK,QAAQ,WAAW;AAAA,IAC7C;AACA,QAAI,CAAC,KAAK;AACR,aAAO;AAAA,QACL;AAAA,QACA,OAAO,EAAE,MAAM,qBAAqB,SAAS,sBAAsB,OAAO,GAAG;AAAA,QAC7E,SAAS,CAAC;AAAA,MACZ;AAAA,IACF;AACA,UAAM,eAAe,mBAAmB,KAAK,OAAO;AACpD,UAAM,qBAAqB,aAAa,WAAW,eAAe,IAAI,IAAI,IAAI;AAC9E,UAAM,iBAAiB,cAAc,IAAI,MAAM,UAAU,kBAAkB;AAC3E,QAAI,WAAW,KAAK,wBAAwB,IAAI,MAAM,UAAU,cAAc;AAC9E,QAAI,UAAU;AACZ,YAAM,gBAAgB,uBAAuB,UAC3C,SAAS,eAAe;AAC1B,YAAM,iBAAiB,+BAA+B,UACpD,SAAS,uBAAuB;AAClC,UAAI,iBAAiB,gBAAgB;AACnC,eAAO;AAAA,UACL,SAAS,IAAI;AAAA,UACb;AAAA,UACA,OAAO;AAAA,YACL,IAAI;AAAA,YACJ;AAAA,YACA,SAAS;AAAA,YACT;AAAA,YACA,SAAS;AAAA,UACX;AAAA,UACA,SAAS,CAAC;AAAA,QACZ;AAAA,MACF;AAAA,IACF;AAEA,QAAI,CAAC,UAAU;AACb,YAAM,eAAe,kBAAkB,IAAI,IAAI;AAC/C,UAAI,CAAC,cAAc;AACjB,eAAO;AAAA,UACL,SAAS,IAAI;AAAA,UACb,OAAO,EAAE,MAAM,sBAAsB,SAAS,kCAAkC,IAAI,IAAI,GAAG;AAAA,UAC3F,SAAS,CAAC;AAAA,QACZ;AAAA,MACF;AACA,YAAM,oBAAoB,aAAa,WAAW,eAAe,IAAI,IAAI,IAAI;AAC7E,YAAM,iBAAiB;AAAA,QACrB,IAAI;AAAA,QACJ;AAAA,QACA;AAAA,MACF;AACA,YAAM,gBAAgB,uBAAuB,UAC3C,aAAa,eAAe;AAC9B,YAAM,iBAAiB,+BAA+B,UACpD,eAAe,gBAAgB;AACjC,UAAI,iBAAiB,gBAAgB;AACnC,eAAO;AAAA,UACL,SAAS,IAAI;AAAA,UACb;AAAA,UACA,OAAO;AAAA,YACL,IAAI;AAAA,YACJ;AAAA,YACA,aAAa;AAAA,YACb;AAAA,YACA,eAAe;AAAA,UACjB;AAAA,UACA,SAAS,CAAC;AAAA,QACZ;AAAA,MACF;AAEA,YAAM,aAAa;AAAA,QACjB,IAAI;AAAA,QACJ,OAAO;AAAA,QACP;AAAA,UACE,SAAS;AAAA,UACT,eAAe;AAAA,UACf,iBAAiB;AAAA,QACnB;AAAA,MACF,EAAE;AACF,YAAMC,cAAa,kBAAkB,IAAI,IAAI;AAC7C,YAAM,kBAAkB,aAAa,WAAW,eAAe,IAAI,IAAI,IAAI;AAC3E,YAAMC,gBAAe;AAAA,QACnB,IAAI;AAAA,QACJ;AAAA,QACA;AAAA,MACF;AACA,YAAM,mBAAmB,cAAc,IAAI,MAAM,UAAU,eAAe;AAC1E,UACE,CAACD,eACD,CAAC,oBACDA,YAAW,eAAe,aAAa,cACvCC,cAAa,gBAAgB,eAAe,aAC5C;AACA,eAAO;AAAA,UACL,SAAS,IAAI;AAAA,UACb,OAAO;AAAA,YACL,IAAI;AAAA,YACJ,sBAAsB,aAAa;AAAA,YACnCD,aAAY,cAAc;AAAA,YAC1B,8BAA8B,eAAe;AAAA,YAC7CC,cAAa;AAAA,UACf;AAAA,UACA,SAAS,CAAC;AAAA,QACZ;AAAA,MACF;AACA,iBAAW;AAAA,QACT,MAAM,IAAI;AAAA,QACV;AAAA,QACA,YAAYD,YAAW;AAAA,QACvB,oBAAoBC,cAAa;AAAA,QACjC,aAAa;AAAA,QACb,SAAS;AAAA,QACT,YAAY,oBAAI,IAAI;AAAA,QACpB,WAAW,KAAK,IAAI;AAAA,MACtB;AAAA,IACF;AAEA,UAAM,aAAa,SAAS,QAAQ;AACpC,UAAM,cAAc,QAAQ,KAAK,CAAC,UAAU,SAAS,UAAU;AAC/D,QAAI,gBAAgB,QAAW;AAC7B,aAAO;AAAA,QACL,SAAS,IAAI;AAAA,QACb,OAAO,aAAa,eAAe,WAAW,kBAAkB,KAAK,IAAI,GAAG,aAAa,CAAC,CAAC,KAAK,UAAU;AAAA,QAC1G,SAAS,CAAC;AAAA,MACZ;AAAA,IACF;AACA,QAAI,OAAO,SAAS,YAAY,QAAQ,YAAY;AAClD,aAAO;AAAA,QACL,SAAS,IAAI;AAAA,QACb,OAAO,aAAa,uBAAuB,IAAI,yBAAyB,UAAU,aAAa,UAAU;AAAA,QACzG,SAAS,CAAC;AAAA,MACZ;AAAA,IACF;AACA,QACE,QAAQ,WAAW,KACnB,SAAS,WAAW,KACpB,mBAAmB,WAAW,MAC7B,UAAU,UAAa,SAAS,SACjC;AACA,UAAI,SAAS,KAAK,QAAQ,GAAG;AAC3B,cAAM,IAAI,MAAM,yDAAyD;AAAA,MAC3E;AACA,WAAK,wBAAwB,QAAQ;AACrC,aAAO;AAAA,QACL,SAAS,IAAI;AAAA,QACb,YAAY,SAAS;AAAA,QACrB;AAAA,QACA,oBAAoB,SAAS;AAAA,QAC7B;AAAA,QACA,SAAS,CAAC;AAAA,QACV,MAAM;AAAA,MACR;AAAA,IACF;AAEA,UAAM,qBAA6C,CAAC;AACpD,QAAI,QAAQ,SAAS,EAAG,oBAAmB,UAAU;AACrD,QAAI,SAAS,SAAS,EAAG,oBAAmB,WAAW;AACvD,QAAI,mBAAmB,SAAS,EAAG,oBAAmB,qBAAqB;AAC3E,QAAI,OAAO,UAAU,YAAY,OAAO,SAAS,UAAU;AACzD,yBAAmB,aAAa,EAAE,OAAO,KAAK;AAAA,IAChD;AACA,UAAM,uBAAoD;AAAA,MACxD,GAAG;AAAA,MACH,GAAI,SAAS,IAAI,EAAE,OAAO,IAAI,CAAC;AAAA,MAC/B,GAAI,QAAQ,IAAI,EAAE,MAAM,IAAI,CAAC;AAAA,IAC/B;AACA,UAAM,eAAe,sBAAsB,oBAAoB;AAC/D,QAAI,WAAW,SAAS,WAAW,IAAI,YAAY;AACnD,QAAI,CAAC,UAAU;AACb,UAAI,YAAY,4BAA4B,SAAS,SAAS,kBAAkB;AAChF,UAAI,WAAW,WAAW;AACxB,eAAO;AAAA,UACL,SAAS,IAAI;AAAA,UACb,YAAY,SAAS;AAAA,UACrB;AAAA,UACA,oBAAoB,SAAS;AAAA,UAC7B,OAAO,UAAU;AAAA,UACjB,SAAS,CAAC;AAAA,QACZ;AAAA,MACF;AAEA,UAAIC,eAA6B;AACjC,UAAI;AACJ,UAAI,SAAS,KAAK,QAAQ,GAAG;AAC3B,YAAI,UAAU,SAAS,WAAW,GAAG;AACnC,gBAAM,IAAI,MAAM,iEAAiE;AAAA,QACnF;AACA,QAAAA,eAAc,UAAU,SAAS,CAAC,EAAG;AACrC,cAAM,eAAe;AAAA,UACnB,OAAO,KAAK,IAAI,GAAGA,eAAc,MAAM;AAAA,UACvC,MAAM,KAAK,IAAI,KAAK,IAAI,GAAG,aAAa,CAAC,GAAGA,eAAc,KAAK;AAAA,QACjE;AACA,oBAAY;AACZ,oBAAY,4BAA4B,SAAS,SAAS,EAAE,YAAY,aAAa,CAAC;AACtF,YAAI,WAAW,WAAW;AACxB,iBAAO;AAAA,YACL,SAAS,IAAI;AAAA,YACb,YAAY,SAAS;AAAA,YACrB;AAAA,YACA,oBAAoB,SAAS;AAAA,YAC7B,OAAO,UAAU;AAAA,YACjB,SAAS,CAAC;AAAA,UACZ;AAAA,QACF;AAAA,MACF,WAAW,mBAAmB,YAAY;AACxC,oBAAY,EAAE,YAAY,mBAAmB,WAAW;AAAA,MAC1D,OAAO;AACL,oBAAY,EAAE,SAAS,UAAU,SAAS,IAAI,CAAC,UAAU,MAAM,KAAK,EAAE;AAAA,MACxE;AACA,iBAAW,EAAE,SAAS,UAAU,UAAU,WAAW,aAAAA,aAAY;AACjE,WAAK;AAAA,QACH;AAAA,QACA,CAAC,cAAc,sBAAsB,SAAS,CAAC;AAAA,QAC/C;AAAA,MACF;AAAA,IACF;AAEA,UAAM,WAAW,SAAS;AAC1B,UAAM,qBAAqB,SAAS;AACpC,UAAM,cAAc,SAAS;AAC7B,UAAM,aAAa;AACnB,UAAM,eAAe,EAAE,aAAa,SAAS,mBAAmB;AAChE,QAAI,cAAc,SAAS,QAAQ;AACjC,aAAO;AAAA,QACL,SAAS,IAAI;AAAA,QACb,OAAO,aAAa,gBAAgB,WAAW,kBAAkB,SAAS,MAAM,KAAK,SAAS,MAAM;AAAA,QACpG,SAAS,CAAC;AAAA,MACZ;AAAA,IACF;AACA,QAAI,cAAc,SAAS,UAAU,aAAa,SAAS,WAAW,EAAG,KAAK,QAAQ;AACpF,aAAO;AAAA,QACL,SAAS,IAAI;AAAA,QACb,OAAO;AAAA,UACL,MAAM;AAAA,UACN,SAAS,eAAe,UAAU,mBAAmB,SAAS,WAAW,EAAG,KAAK,WAAW,SAAS,WAAW,EAAG,KAAK,MAAM;AAAA,UAC9H,YAAY,SAAS,WAAW,EAAG,KAAK;AAAA,QAC1C;AAAA,QACA,SAAS,CAAC;AAAA,MACZ;AAAA,IACF;AAEA,UAAM,UAAU,CAAC,OAAsB,UAAU,QAC/C,UAAU,QAAQ,MAAM,UAAU,UAC9B,QACA,GAAG,MAAM,MAAM,GAAG,KAAK,IAAI,GAAG,UAAU,CAAC,CAAC,CAAC;AACjD,UAAM,mBAAmB,CAAC,UAA4B;AACpD,UAAI,UAAU,OAAW,QAAO;AAChC,YAAM,aAAa,KAAK,UAAU,KAAK;AACvC,aAAO,WAAW,UAAU,MAAQ,QAAQ;AAAA,IAC9C;AACA,UAAM,SAAyC,CAAC;AAChD,UAAM,UAA2D,CAAC;AAClE,QAAI,WAAW;AACf,QAAI,oBAAoB;AACxB,QAAI,iBAAiB;AACrB,WAAO,WAAW,SAAS,UAAU,OAAO,SAAS,cAAc,iBAAiB,GAAG;AACrF,YAAM,QAAQ,SAAS,QAAQ;AAC/B,UAAI,MAAM,KAAK,IAAI,MAAM,KAAK,QAAQ,oBAAoB,cAAc;AACxE,UACE,MAAM,MAAM,KAAK,UACjB,MAAM,qBACN,MAAM,KAAK,WAAW,GAAG,KAAK,SAC9B,MAAM,KAAK,WAAW,GAAG,KAAK,OAC9B;AACA,eAAO;AAAA,MACT;AACA,UAAI,QAAQ,qBAAqB,oBAAoB,MAAM,KAAK,QAAQ;AACtE,cAAM,KAAK,IAAI,MAAM,KAAK,QAAQ,oBAAoB,CAAC;AAAA,MACzD;AACA,YAAM,QAAQ,MAAM,KAAK,MAAM,mBAAmB,GAAG;AACrD,YAAM,eAAe,OAAO,MAAM,KAAK;AACvC,YAAM,YAAY,iBAAiB,MAAM,SAAS;AAClD,YAAM,aAAa,iBAAiB,MAAM,UAAU;AACpD,aAAO,KAAK;AAAA,QACV,OAAO,MAAM;AAAA,QACb,SAAS,QAAQ,MAAM,OAAO;AAAA,QAC9B,UAAU,QAAQ,MAAM,QAAQ;AAAA,QAChC,MAAM,QAAQ,MAAM,IAAI;AAAA,QACxB,MAAM,QAAQ,MAAM,IAAI;AAAA,QACxB,WAAW,MAAM;AAAA,QACjB,SAAS,MAAM;AAAA,QACf,GAAI,gBAAgB,OAAO,EAAE,QAAQ,MAAM,UAAU,YAAY,IAAI,CAAC;AAAA,QACtE,MAAM;AAAA,QACN,WAAW;AAAA,UACT,OAAO;AAAA,UACP;AAAA,UACA,OAAO,MAAM,KAAK;AAAA,UAClB,UAAU;AAAA,QACZ;AAAA,QACA,GAAI,MAAM,kBAAkB,SAAY,EAAE,eAAe,QAAQ,MAAM,aAAa,EAAE,IAAI,CAAC;AAAA,QAC3F,GAAI,MAAM,mBAAmB,EAAE,kBAAkB,QAAQ,MAAM,gBAAgB,EAAE,IAAI,CAAC;AAAA,QACtF,GAAI,MAAM,WAAW,EAAE,MAAM,QAAQ,MAAM,QAAQ,EAAE,IAAI,CAAC;AAAA,QAC1D,GAAI,MAAM,MAAM,EAAE,KAAK,QAAQ,MAAM,GAAG,EAAE,IAAI,CAAC;AAAA,QAC/C,GAAI,MAAM,WAAW,EAAE,UAAU,QAAQ,MAAM,QAAQ,EAAE,IAAI,CAAC;AAAA,QAC9D,GAAI,MAAM,SAAS,EAAE,QAAQ,QAAQ,MAAM,MAAM,EAAE,IAAI,CAAC;AAAA,QACxD,GAAI,MAAM,UAAU,EAAE,SAAS,MAAM,QAAQ,IAAI,CAAC;AAAA,QAClD,GAAI,MAAM,eACN,EAAE,cAAc,MAAM,aAAa,MAAM,GAAG,EAAE,EAAE,IAAI,CAAC,SAAS,QAAQ,MAAM,IAAK,CAAC,EAAE,IACpF,CAAC;AAAA,QACL,GAAI,cAAc,SAAY,EAAE,UAAU,IAAI,CAAC;AAAA,QAC/C,GAAI,eAAe,SAAY,EAAE,WAAW,IAAI,CAAC;AAAA,QACjD,GAAK,MAAM,cAAc,UAAa,cAAc,UAC/C,MAAM,eAAe,UAAa,eAAe,SAClD,EAAE,qBAAqB,KAAK,IAC5B,CAAC;AAAA,QACL,GAAI,MAAM,cAAc,EAAE,aAAa,QAAQ,MAAM,WAAW,EAAE,IAAI,CAAC;AAAA,QACvE,GAAI,MAAM,iBAAiB,EAAE,gBAAgB,QAAQ,MAAM,cAAc,EAAE,IAAI,CAAC;AAAA,QAChF,GAAI,MAAM,oBAAoB,SAAY,EAAE,iBAAiB,QAAQ,MAAM,eAAe,EAAE,IAAI,CAAC;AAAA,QACjG,GAAI,MAAM,kBAAkB,SAAY,EAAE,eAAe,QAAQ,MAAM,aAAa,EAAE,IAAI,CAAC;AAAA,MAC7F,CAAC;AACD,wBAAkB,MAAM;AACxB,UAAI,CAAC,cAAc;AACjB,4BAAoB;AACpB,gBAAQ,KAAK,EAAE,UAAU,YAAY,kBAAkB,CAAC;AACxD;AAAA,MACF;AACA,kBAAY;AACZ,0BAAoB;AACpB,cAAQ,KAAK,EAAE,UAAU,YAAY,EAAE,CAAC;AAAA,IAC1C;AAEA,UAAM,aAAa,CACjB,SACAC,YAC4B;AAC5B,YAAM,UAAUA,QAAO,WAAW,SAAS;AAC3C,YAAM,WAAW,UACb;AAAA,QACE,SAAS,IAAI;AAAA,QACb,oBAAoB,WAAW;AAAA,QAC/B,4BAA4B,aAAa;AAAA,QACzC;AAAA,QACA,GAAG;AAAA,QACH,aAAaA,QAAO;AAAA,QACpB,GAAIA,QAAO,aAAa,IAAI,EAAE,YAAYA,QAAO,WAAW,IAAI,CAAC;AAAA,QACjE;AAAA,QACA;AAAA,MACF,IACA;AACJ,aAAO;AAAA,QACL,SAAS,IAAI;AAAA,QACb,YAAY,WAAW;AAAA,QACvB;AAAA,QACA,oBAAoB,aAAa;AAAA,QACjC;AAAA,QACA,SAAS;AAAA,QACT,MAAM,WAAW,EAAE,KAAK,iBAAiB,MAAM,SAAS,IAAI;AAAA,MAC9D;AAAA,IACF;AAEA,QAAI,SAAS,EAAE,UAAU,YAAY,kBAAkB;AACvD,QAAI,WAAW,WAAW,QAAQ,MAAM;AACxC,WAAO,OAAO,SAAS,KAAK,KAAK,UAAU,QAAQ,EAAE,SAAS,2BAA2B;AACvF,aAAO,IAAI;AACX,cAAQ,IAAI;AACZ,eAAS,QAAQ,GAAG,EAAE,KAAK,EAAE,UAAU,aAAa,WAAW;AAC/D,iBAAW,WAAW,QAAQ,MAAM;AAAA,IACtC;AACA,QAAI,OAAO,WAAW,KAAK,KAAK,UAAU,QAAQ,EAAE,SAAS,2BAA2B;AACtF,YAAM,SAAS,OAAO,CAAC;AACvB,YAAM,QAAQ,OAAO;AACrB,YAAM,QAAQ,OAAO;AACrB,YAAM,SAAS,KAAK,UAAU,QAAQ,EAAE,SAAS;AACjD,UAAI,OAAO,KAAK,IAAI,GAAG,MAAM,SAAS,SAAS,GAAG;AAClD,UACE,OAAO,MAAM,UACb,OAAO,KACP,MAAM,WAAW,IAAI,KAAK,SAC1B,MAAM,WAAW,IAAI,KAAK,OAC1B;AACA,gBAAQ;AAAA,MACV;AACA,UAAI,OAAO,KAAK,OAAO,MAAM,QAAQ;AACnC,eAAO,OAAO,MAAM,MAAM,GAAG,IAAI;AACjC,cAAM,MAAM,MAAM,QAAQ;AAC1B,cAAM,WAAW;AACjB,iBAAS,EAAE,UAAU,aAAa,YAAY,MAAM,IAAI;AACxD,mBAAW,WAAW,QAAQ,MAAM;AAAA,MACtC;AACA,UAAI,KAAK,UAAU,QAAQ,EAAE,SAAS,2BAA2B;AAC/D,eAAO,OAAO;AACd,eAAO,OAAO;AACd,YAAI,MAAM,QAAQ,OAAO,YAAY,GAAG;AACtC,iBAAO,eAAe,OAAO,aAAa,MAAM,GAAG,CAAC,EAAE,IAAI,CAAC,SAAS,QAAQ,OAAO,IAAI,GAAG,GAAG,CAAC;AAAA,QAChG;AACA,eAAO,sBAAsB;AAC7B,mBAAW,WAAW,QAAQ,MAAM;AAAA,MACtC;AACA,UAAI,KAAK,UAAU,QAAQ,EAAE,SAAS,2BAA2B;AAC/D,cAAM,UAAU,OAAO,OAAO,IAAI;AAClC,cAAM,uBAAuB,QAAQ,YAAY,CAAC,KAAK,KAAK,QAAS,IAAI;AACzE,cAAM,cAAc,QAAQ,MAAM,GAAG,KAAK,IAAI,QAAQ,QAAQ,mBAAmB,CAAC;AAClF,cAAM,eAAe,OAAO;AAC5B,qBAAa,MAAM,aAAa,QAAQ,YAAY;AACpD,qBAAa,WAAW,aAAa,OAAO,aAAa;AACzD,eAAO,CAAC,IAAI;AAAA,UACV,OAAO,OAAO;AAAA,UACd,SAAS,OAAO;AAAA,UAChB,UAAU,OAAO;AAAA,UACjB,MAAM,OAAO;AAAA,UACb,MAAM,OAAO;AAAA,UACb,WAAW,OAAO;AAAA,UAClB,SAAS,OAAO;AAAA,UAChB,GAAI,OAAO,WAAW,SAAY,EAAE,QAAQ,OAAO,OAAO,IAAI,CAAC;AAAA,UAC/D,MAAM;AAAA,UACN,WAAW;AAAA,UACX,qBAAqB;AAAA,QACvB;AACA,iBAAS,aAAa,WAClB,EAAE,UAAU,cAAc,GAAG,YAAY,EAAE,IAC3C,EAAE,UAAU,aAAa,YAAY,aAAa,IAAI;AAC1D,mBAAW,WAAW,QAAQ,MAAM;AAAA,MACtC;AAAA,IACF;AAEA,UAAM,mBAAmB,aAAa,WAAW,eAAe,IAAI,IAAI,IAAI;AAC5E,UAAM,oBAAoB,cAAc,IAAI,MAAM,UAAU,gBAAgB;AAC5E,QAAI,CAAC,qBAAqB,CAAC,sBAAsB,SAAS,aAAa,iBAAiB,GAAG;AACzF,WAAK,wBAAwB,QAAQ;AACrC,YAAM,cAAc,kBAAkB,IAAI,IAAI;AAC9C,YAAM,gBAAgB,0BAA0B,IAAI,MAAM,UAAU,gBAAgB;AACpF,UACE,CAAC,eACD,CAAC,qBACD,YAAY,eAAe,SAAS,cACpC,cAAc,gBAAgB,SAAS,oBACvC;AACA,eAAO;AAAA,UACL,SAAS,IAAI;AAAA,UACb,OAAO;AAAA,YACL,IAAI;AAAA,YACJ,sBAAsB,SAAS;AAAA,YAC/B,aAAa,cAAc;AAAA,YAC3B,8BAA8B,SAAS;AAAA,YACvC,cAAc;AAAA,UAChB;AAAA,UACA,SAAS,CAAC;AAAA,QACZ;AAAA,MACF;AACA,eAAS,cAAc;AAAA,IACzB;AACA,QAAI,SAAS,SAAS,MAAM;AAC1B,WAAK,wBAAwB,QAAQ;AAAA,IACvC,OAAO;AACL,eAAS,YAAY,KAAK,IAAI;AAC9B,WAAK,0BAA0B,QAAQ;AAAA,IACzC;AACA,WAAO;AAAA,EACT;AAAA,EAEA,MAAc,SAAS,MAAiD;AACtE,UAAM,QAAQ,OAAO,KAAK,UAAU,WAAW,KAAK,QAAQ;AAC5D,UAAM,WAAW,cAAc,KAAK,UAAU,iBAAiB;AAC/D,UAAM,QACJ,OAAO,KAAK,UAAU,YAAY,OAAO,cAAc,KAAK,KAAK,KAAK,KAAK,SAAS,IAChF,KAAK,IAAI,KAAK,OAAO,YAAY,IACjC;AACN,UAAM,SACJ,OAAO,KAAK,WAAW,YAAY,OAAO,cAAc,KAAK,MAAM,KAAK,KAAK,UAAU,IACnF,KAAK,SACL;AACN,UAAM,aAAa,YAAY,OAAO,KAAK,SAAS,KAAK;AACzD,UAAM,QAAQ,WAAW,KAAK;AAC9B,UAAM,OAAO,WAAW,KAAK,MAAM,QAAQ,SAAS,KAAK;AACzD,UAAM,UAAU;AAAA,MACd,KAAK,QAAQ;AAAA,MACb,KAAK,QAAQ;AAAA,MACb;AAAA,MACA,mBAAmB,KAAK,OAAO;AAAA,IACjC;AACA,UAAM,QAAQ,gBAAgB,MAAM,gBAAgB,MAAM,KAAK,OAAO,GAAG,OAAO;AAChF,UAAM,SAAS,IAAI,IAAI,MAAM,OAAO,IAAI,CAAC,UAAU,CAAC,MAAM,aAAa,KAAK,CAAC,CAAC;AAC9E,UAAM,UAAU,IAAI,IAAI,MAAM,QAAQ,IAAI,CAAC,WAAW,CAAC,OAAO,MAAM,MAAM,CAAC,CAAC;AAC5E,UAAM,WAAW,KAAK,IAAI,CAAC,QAAQ;AACjC,YAAM,OAAO,MAAM,MAAM,IAAI,IAAI,IAAI,KAAK;AAC1C,YAAM,QAAQ,OAAO,IAAI,IAAI,IAAI;AACjC,YAAM,SAAS,QAAQ,IAAI,IAAI,IAAI;AACnC,aAAO;AAAA,QACL,IAAI,OAAO,aAAa,QAAQ,aAAa,IAAI;AAAA,QACjD,MAAM,IAAI;AAAA,QACV,KAAK,QAAQ,OAAO,IAAI;AAAA,QACxB,OAAO,IAAI;AAAA,QACX,YAAY,OAAO,QAAQ,UAAU,QAAQ,cAAc;AAAA,QAC3D;AAAA,QACA;AAAA,QACA,oBAAoB,OAAO,sBAAsB,QAAQ,sBAAsB;AAAA,MACjF;AAAA,IACF,CAAC;AACD,WAAO;AAAA,MACL,OAAO,SAAS;AAAA,MAChB;AAAA,MACA;AAAA,MACA;AAAA,MACA,WAAW,SAAS,SAAS,SAAS;AAAA,MACtC;AAAA,MACA,GAAI,WAAW,QAAQ,SAAS,IAC5B,EAAE,OAAO,qBAAqB,UAAU,EAAE,IAC1C,CAAC;AAAA,IACP;AAAA,EACF;AACF;",
+  "names": ["response", "finalState", "finalLineage", "anchorIndex", "cursor"]
+}

package/dist/compaction/lcm-maintenance.d.ts

@@ -104,7 +104,7 @@ export declare class LcmMaintenance {
     reopen(nodeId: string, force?: boolean): LcmJob;
     listNodes(limit?: number, offset?: number): LcmNode[];
     getNode(nodeId: string): LcmNode | undefined;
-    /** Drops a node a parent already condensed, and one whose sources another selected node fully contains. */
+    /** Scoped by the live source set when given; drops a condensed child and a contained node. */
     getFrontier(sessionId?: string, activeSources?: ReadonlySet<string>): LcmNode[];
     recentJobs(limit?: number): LcmJob[];
     listJobs(limit?: number): LcmJob[];