@remnic/core 9.69.10 → 9.69.12

package/dist/chunk-HXWOVCS6.js.map

@@ -1 +0,0 @@
-{"version":3,"sources":["../src/harmonic-retrieval.ts"],"sourcesContent":["import path from \"node:path\";\nimport { listJsonFilesStrict, readJsonFile } from \"./json-store.js\";\nimport { throwIfAborted } from \"./abort-error.js\";\nimport { inferMemoryStatus, toMemoryPathRel } from \"./memory-lifecycle-ledger-utils.js\";\n import {\n   HARMONIC_SOURCE_MEMORY_INSERTED_AT_KEY,\n   resolveAbstractionNodeStoreDir,\n   validateAbstractionNode,\n   type AbstractionNode,\n } from \"./abstraction-nodes.js\";\nimport { resolveCueAnchorStoreDir, validateCueAnchor, type CueAnchor, type CueAnchorType } from \"./cue-anchors.js\";\nimport { compareDeterministicStrings } from \"./deterministic-order.js\";\nimport { countRecallTokenOverlap, normalizeRecallTokens } from \"./recall-tokenization.js\";\nimport { stripAttributesSuffix } from \"./structured-attributes.js\";\nimport { isValidityExpiredNow } from \"./temporal-validity.js\";\nimport { isRecord } from \"./store-contract.js\";\nimport type { MemoryFile } from \"./types.js\";\n\ntype SourceMemoryMap = Map<string, MemoryFile>;\n\nasync function readSourceMemories(options: {\n  memoryDir: string;\n  abortSignal?: AbortSignal;\n}): Promise<SourceMemoryMap> {\n  const sourceMemories: SourceMemoryMap = new Map();\n try {\n const { StorageManager } = await import(\"./storage.js\");\n const storage = new StorageManager(options.memoryDir);\n const [hotMemories, coldMemories] = await Promise.all([\n storage.readAllMemories({ abortSignal: options.abortSignal }),\n storage.readAllColdMemories(),\n ]);\n for (const memory of [...hotMemories, ...coldMemories]) {\n      throwIfAborted(options.abortSignal, \"harmonic retrieval aborted\");\n      sourceMemories.set(memory.frontmatter.id, memory);\n    }\n  } catch {\n    throwIfAborted(options.abortSignal, \"harmonic retrieval aborted\");\n    // Source validation fails closed when the authorized memory directory is\n    // unreadable. Source-less nodes remain eligible for retrieval.\n    sourceMemories.clear();\n  }\n  return sourceMemories;\n}\n\nfunction parseSourceMemoryInsertedAt(node: AbstractionNode): Map<string, string> {\n  const insertedAtById = new Map<string, string>();\n  const insertedAtRaw = node.metadata?.[HARMONIC_SOURCE_MEMORY_INSERTED_AT_KEY];\n  if (!insertedAtRaw) return insertedAtById;\n  try {\n    const parsed = JSON.parse(insertedAtRaw) as unknown;\n    if (!isRecord(parsed)) return insertedAtById;\n    for (const [memoryId, value] of Object.entries(parsed)) {\n      if (typeof value === \"string\") insertedAtById.set(memoryId, value);\n    }\n  } catch {\n    // Malformed insertion metadata leaves ordering on the recordedAt fallback.\n  }\n  return insertedAtById;\n}\n\nfunction projectSourceBackedNode(\n  node: AbstractionNode,\n  sourceMemories: SourceMemoryMap,\n  memoryDir: string,\n  temporalExpiredInInjection: boolean,\n  nowMs: number\n): AbstractionNode | null {\n  const sourceMemoryIds = node.sourceMemoryIds ?? [];\n  if (sourceMemoryIds.length === 0) return node;\n\n  const activeSourceMemoryIds = sourceMemoryIds.filter((memoryId) => {\n    const memory = sourceMemories.get(memoryId);\n    return (\n      memory !== undefined &&\n      inferMemoryStatus(memory.frontmatter, toMemoryPathRel(memoryDir, memory.path)) === \"active\" &&\n      (temporalExpiredInInjection || !isValidityExpiredNow(memory.frontmatter, nowMs))\n    );\n  });\n  if (activeSourceMemoryIds.length === 0) return null;\n\n // Newest-first source order keeps the projected title and summary on the most\n // recently inserted facts. Equal or missing timestamps fall back to ascending\n // id order, which matches the stored sourceMemoryIds order.\n const insertedAtById = parseSourceMemoryInsertedAt(node);\n const insertedAtMs = (memoryId: string): number => {\n   const parsedMs = Date.parse(insertedAtById.get(memoryId) ?? \"\");\n   return Number.isFinite(parsedMs) ? parsedMs : Date.parse(node.recordedAt);\n };\n activeSourceMemoryIds.sort(\n   (left, right) =>\n     insertedAtMs(right) - insertedAtMs(left) || compareDeterministicStrings(left, right)\n );\n\n  const activeMemories = activeSourceMemoryIds.flatMap((memoryId) => {\n    const memory = sourceMemories.get(memoryId);\n    return memory ? [memory] : [];\n  });\n  const activeContents = activeMemories.map((memory) =>\n    memory.frontmatter.structuredAttributes ? stripAttributesSuffix(memory.content) : memory.content\n  );\n let metadata: Record<string, string> | undefined;\n const activeInsertedAt = activeSourceMemoryIds.flatMap((memoryId) => {\n   const value = insertedAtById.get(memoryId);\n   return typeof value === \"string\" ? [[memoryId, value] as const] : [];\n });\n if (activeInsertedAt.length > 0) {\n   metadata = {\n     [HARMONIC_SOURCE_MEMORY_INSERTED_AT_KEY]: JSON.stringify(Object.fromEntries(activeInsertedAt)),\n   };\n  }\n\n return {\n   ...node,\n   sourceMemoryIds: activeSourceMemoryIds,\n   title: activeContents[0]?.slice(0, 80) ?? node.title,\n   summary: activeContents.slice(0, 3).join(\"; \").slice(0, 400),\n   tags: [...new Set(activeMemories.flatMap((memory) => memory.frontmatter.tags))].sort(compareDeterministicStrings),\n   entityRefs: [\n     ...new Set(\n       activeMemories.flatMap((memory) =>\n         typeof memory.frontmatter.entityRef === \"string\" ? [memory.frontmatter.entityRef] : []\n       )\n     ),\n   ].sort(compareDeterministicStrings),\n   metadata,\n };\n}\n\nfunction anchorMatchesProjectedNode(\n  anchor: CueAnchor,\n  nodeRef: string,\n  node: AbstractionNode,\n  allowLegacyAttribution: boolean\n): boolean {\n  const activeSourceMemoryIds = node.sourceMemoryIds ?? [];\n  if (activeSourceMemoryIds.length === 0) return true;\n  if (!anchor.sourceMemoryIdsByNodeRef) return allowLegacyAttribution;\n  const anchorSourceMemoryIds = anchor.sourceMemoryIdsByNodeRef[nodeRef] ?? [];\n  return anchorSourceMemoryIds.some((sourceMemoryId) => activeSourceMemoryIds.includes(sourceMemoryId));\n}\n\nexport interface HarmonicMatchedAnchor {\n  anchorId: string;\n  anchorType: CueAnchorType;\n  anchorValue: string;\n}\n\nexport interface HarmonicRetrievalResult {\n  node: AbstractionNode;\n  score: number;\n  nodeScore: number;\n  anchorScore: number;\n  matchedFields: string[];\n  matchedAnchors: HarmonicMatchedAnchor[];\n}\n\ninterface HarmonicCandidate {\n  node: AbstractionNode;\n  nodeScore: number;\n  anchorScore: number;\n  matchedFields: Set<string>;\n  matchedAnchors: Map<string, HarmonicMatchedAnchor>;\n}\n\nfunction scoreNode(node: AbstractionNode, queryTokens: Set<string>): { score: number; matchedFields: string[] } {\n  const matchedFields: string[] = [];\n  let score = 0;\n\n  const titleMatches = countRecallTokenOverlap(queryTokens, node.title);\n  if (titleMatches > 0) {\n    score += titleMatches * 3;\n    matchedFields.push(\"title\");\n  }\n\n  const summaryMatches = countRecallTokenOverlap(queryTokens, node.summary);\n  if (summaryMatches > 0) {\n    score += summaryMatches * 3;\n    matchedFields.push(\"summary\");\n  }\n\n  const tagMatches = countRecallTokenOverlap(queryTokens, node.tags?.join(\" \"));\n  if (tagMatches > 0) {\n    score += tagMatches * 2;\n    matchedFields.push(\"tags\");\n  }\n\n  const entityMatches = countRecallTokenOverlap(queryTokens, node.entityRefs?.join(\" \"));\n  if (entityMatches > 0) {\n    score += entityMatches * 2;\n    matchedFields.push(\"entityRefs\");\n  }\n\n  const kindMatches = countRecallTokenOverlap(queryTokens, `${node.kind} ${node.abstractionLevel}`);\n  if (kindMatches > 0) {\n    score += kindMatches;\n    matchedFields.push(\"kind\");\n  }\n\n  return { score, matchedFields };\n}\n\nfunction scoreAnchor(\n  anchor: CueAnchor,\n  queryTokens: Set<string>,\n  eligibleNodeTags: readonly string[]\n): { score: number; matchedFields: string[] } {\n  const matchedFields: string[] = [];\n  let score = 0;\n\n  const valueMatches = countRecallTokenOverlap(queryTokens, anchor.anchorValue);\n  const normalizedMatches = countRecallTokenOverlap(queryTokens, anchor.normalizedCue);\n  const cueMatches = Math.max(valueMatches, normalizedMatches);\n  if (cueMatches > 0) {\n    score += cueMatches * 4;\n    if (valueMatches > 0) matchedFields.push(\"anchorValue\");\n    if (normalizedMatches > 0) matchedFields.push(\"anchor\");\n  }\n\n  const typeMatches = countRecallTokenOverlap(queryTokens, anchor.anchorType);\n  if (typeMatches > 0) {\n    score += typeMatches;\n    matchedFields.push(\"anchorType\");\n  }\n\n  const tagMatches = countRecallTokenOverlap(queryTokens, eligibleNodeTags.join(\" \"));\n  if (tagMatches > 0) {\n    score += tagMatches * 2;\n    matchedFields.push(\"anchorTags\");\n  }\n\n  return { score, matchedFields };\n}\n\nasync function readAbstractionNodes(options: {\n  memoryDir: string;\n  abstractionNodeStoreDir?: string;\n}): Promise<AbstractionNode[]> {\n  const rootDir = resolveAbstractionNodeStoreDir(options.memoryDir, options.abstractionNodeStoreDir);\n  const files = await listJsonFilesStrict(path.join(rootDir, \"nodes\"), { allowMissingDirectory: true });\n  const nodes: AbstractionNode[] = [];\n  for (const filePath of files) {\n    try {\n      nodes.push(validateAbstractionNode(await readJsonFile(filePath)));\n    } catch {\n      // fail-open: invalid artifacts stay visible via status tooling instead of recall\n    }\n  }\n  return nodes;\n}\n\nasync function readCueAnchors(options: {\n  memoryDir: string;\n  abstractionNodeStoreDir?: string;\n}): Promise<CueAnchor[]> {\n  const abstractionRoot = resolveAbstractionNodeStoreDir(options.memoryDir, options.abstractionNodeStoreDir);\n  const rootDir = resolveCueAnchorStoreDir(abstractionRoot);\n  const files = await listJsonFilesStrict(rootDir, { allowMissingDirectory: true });\n  const anchors: CueAnchor[] = [];\n  for (const filePath of files) {\n    try {\n      anchors.push(validateCueAnchor(await readJsonFile(filePath)));\n    } catch {\n      // fail-open: invalid artifacts stay visible via status tooling instead of recall\n    }\n  }\n  return anchors;\n}\n\nexport async function searchHarmonicRetrieval(options: {\n  memoryDir: string;\n  abstractionNodeStoreDir?: string;\n  query: string;\n  maxResults: number;\n  sessionKey?: string;\n  anchorsEnabled: boolean;\n  abortSignal?: AbortSignal;\n  temporalExpiredInInjection?: boolean;\n}): Promise<HarmonicRetrievalResult[]> {\n  throwIfAborted(options.abortSignal, \"harmonic retrieval aborted\");\n  const queryTokens = new Set(normalizeRecallTokens(options.query, [\"what\", \"which\"]));\n  if (queryTokens.size === 0 || options.maxResults <= 0) return [];\n\n  const nodes = await readAbstractionNodes(options);\n  const sourceBackedNodes = nodes.filter((node) => (node.sourceMemoryIds?.length ?? 0) > 0);\n  const sourceMemories: SourceMemoryMap =\n    sourceBackedNodes.length > 0 ? await readSourceMemories(options) : new Map<string, MemoryFile>();\n  const legacyCompatibleNodeRefs = new Set<string>();\n  const nowMs = Date.now();\n  const eligibleNodes = nodes.flatMap((node) => {\n    const projected = projectSourceBackedNode(\n      node,\n      sourceMemories,\n      options.memoryDir,\n      options.temporalExpiredInInjection === true,\n      nowMs\n    );\n    if (\n      projected &&\n      (node.sourceMemoryIds?.length ?? 0) > 0 &&\n      projected.sourceMemoryIds?.length === node.sourceMemoryIds?.length\n    ) {\n      legacyCompatibleNodeRefs.add(node.nodeId);\n    }\n    return projected ? [projected] : [];\n  });\n  const candidates = new Map<string, HarmonicCandidate>();\n\n  for (const node of eligibleNodes) {\n    throwIfAborted(options.abortSignal, \"harmonic retrieval aborted\");\n    const { score, matchedFields } = scoreNode(node, queryTokens);\n    if (score <= 0) continue;\n    candidates.set(node.nodeId, {\n      node,\n      nodeScore: score,\n      anchorScore: 0,\n      matchedFields: new Set(matchedFields),\n      matchedAnchors: new Map(),\n    });\n  }\n\n  if (options.anchorsEnabled) {\n    throwIfAborted(options.abortSignal, \"harmonic retrieval aborted\");\n    const anchors = await readCueAnchors(options);\n    const nodeIndex = new Map(eligibleNodes.map((node) => [node.nodeId, node]));\n    for (const anchor of anchors) {\n      throwIfAborted(options.abortSignal, \"harmonic retrieval aborted\");\n const eligibleNodeRefs = anchor.nodeRefs.filter((nodeRef) => {\n const node = nodeIndex.get(nodeRef);\n return (\n node !== undefined &&\n anchorMatchesProjectedNode(anchor, nodeRef, node, legacyCompatibleNodeRefs.has(nodeRef))\n );\n });\n const eligibleNodeTags = new Set(eligibleNodeRefs.flatMap((nodeRef) => nodeIndex.get(nodeRef)?.tags ?? []));\n const eligibleAnchorTags = anchor.tags?.filter((tag) => eligibleNodeTags.has(tag)) ?? [];\n      const { score, matchedFields } = scoreAnchor(anchor, queryTokens, eligibleAnchorTags);\n      if (score <= 0) continue;\n      for (const nodeRef of eligibleNodeRefs) {\n        const node = nodeIndex.get(nodeRef);\n        if (!node) continue;\n        const existing = candidates.get(nodeRef) ?? {\n          node,\n          nodeScore: 0,\n          anchorScore: 0,\n          matchedFields: new Set<string>(),\n          matchedAnchors: new Map<string, HarmonicMatchedAnchor>(),\n        };\n        existing.anchorScore += score;\n        existing.matchedFields.add(\"anchor\");\n        for (const field of matchedFields) existing.matchedFields.add(field);\n        existing.matchedAnchors.set(anchor.anchorId, {\n          anchorId: anchor.anchorId,\n          anchorType: anchor.anchorType,\n          anchorValue: anchor.anchorValue,\n        });\n        candidates.set(nodeRef, existing);\n      }\n    }\n  }\n\n  return [...candidates.values()]\n    .map((candidate) => {\n      let score = candidate.nodeScore + candidate.anchorScore;\n      if (options.sessionKey && candidate.node.sessionKey === options.sessionKey) score += 0.5;\n      return {\n        node: candidate.node,\n        score,\n        nodeScore: candidate.nodeScore,\n        anchorScore: candidate.anchorScore,\n        matchedFields: [...candidate.matchedFields].sort(),\n        matchedAnchors: [...candidate.matchedAnchors.values()].sort(\n          (left, right) =>\n            left.anchorType.localeCompare(right.anchorType) || left.anchorValue.localeCompare(right.anchorValue)\n        ),\n      };\n    })\n    .filter((result) => result.nodeScore > 0 || result.anchorScore > 0)\n    .sort(\n      (left, right) =>\n        right.score - left.score ||\n        right.anchorScore - left.anchorScore ||\n        right.node.recordedAt.localeCompare(left.node.recordedAt)\n    )\n    .slice(0, options.maxResults);\n}\n"],"mappings":";;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AAAA,OAAO,UAAU;AAoBjB,eAAe,mBAAmB,SAGL;AAC3B,QAAM,iBAAkC,oBAAI,IAAI;AACjD,MAAI;AACJ,UAAM,EAAE,eAAe,IAAI,MAAM,OAAO,cAAc;AACtD,UAAM,UAAU,IAAI,eAAe,QAAQ,SAAS;AACpD,UAAM,CAAC,aAAa,YAAY,IAAI,MAAM,QAAQ,IAAI;AAAA,MACtD,QAAQ,gBAAgB,EAAE,aAAa,QAAQ,YAAY,CAAC;AAAA,MAC5D,QAAQ,oBAAoB;AAAA,IAC5B,CAAC;AACD,eAAW,UAAU,CAAC,GAAG,aAAa,GAAG,YAAY,GAAG;AACnD,qBAAe,QAAQ,aAAa,4BAA4B;AAChE,qBAAe,IAAI,OAAO,YAAY,IAAI,MAAM;AAAA,IAClD;AAAA,EACF,QAAQ;AACN,mBAAe,QAAQ,aAAa,4BAA4B;AAGhE,mBAAe,MAAM;AAAA,EACvB;AACA,SAAO;AACT;AAEA,SAAS,4BAA4B,MAA4C;AAC/E,QAAM,iBAAiB,oBAAI,IAAoB;AAC/C,QAAM,gBAAgB,KAAK,WAAW,sCAAsC;AAC5E,MAAI,CAAC,cAAe,QAAO;AAC3B,MAAI;AACF,UAAM,SAAS,KAAK,MAAM,aAAa;AACvC,QAAI,CAAC,SAAS,MAAM,EAAG,QAAO;AAC9B,eAAW,CAAC,UAAU,KAAK,KAAK,OAAO,QAAQ,MAAM,GAAG;AACtD,UAAI,OAAO,UAAU,SAAU,gBAAe,IAAI,UAAU,KAAK;AAAA,IACnE;AAAA,EACF,QAAQ;AAAA,EAER;AACA,SAAO;AACT;AAEA,SAAS,wBACP,MACA,gBACA,WACA,4BACA,OACwB;AACxB,QAAM,kBAAkB,KAAK,mBAAmB,CAAC;AACjD,MAAI,gBAAgB,WAAW,EAAG,QAAO;AAEzC,QAAM,wBAAwB,gBAAgB,OAAO,CAAC,aAAa;AACjE,UAAM,SAAS,eAAe,IAAI,QAAQ;AAC1C,WACE,WAAW,UACX,kBAAkB,OAAO,aAAa,gBAAgB,WAAW,OAAO,IAAI,CAAC,MAAM,aAClF,8BAA8B,CAAC,qBAAqB,OAAO,aAAa,KAAK;AAAA,EAElF,CAAC;AACD,MAAI,sBAAsB,WAAW,EAAG,QAAO;AAKhD,QAAM,iBAAiB,4BAA4B,IAAI;AACvD,QAAM,eAAe,CAAC,aAA6B;AACjD,UAAM,WAAW,KAAK,MAAM,eAAe,IAAI,QAAQ,KAAK,EAAE;AAC9D,WAAO,OAAO,SAAS,QAAQ,IAAI,WAAW,KAAK,MAAM,KAAK,UAAU;AAAA,EAC1E;AACA,wBAAsB;AAAA,IACpB,CAAC,MAAM,UACL,aAAa,KAAK,IAAI,aAAa,IAAI,KAAK,4BAA4B,MAAM,KAAK;AAAA,EACvF;AAEC,QAAM,iBAAiB,sBAAsB,QAAQ,CAAC,aAAa;AACjE,UAAM,SAAS,eAAe,IAAI,QAAQ;AAC1C,WAAO,SAAS,CAAC,MAAM,IAAI,CAAC;AAAA,EAC9B,CAAC;AACD,QAAM,iBAAiB,eAAe;AAAA,IAAI,CAAC,WACzC,OAAO,YAAY,uBAAuB,sBAAsB,OAAO,OAAO,IAAI,OAAO;AAAA,EAC3F;AACD,MAAI;AACJ,QAAM,mBAAmB,sBAAsB,QAAQ,CAAC,aAAa;AACnE,UAAM,QAAQ,eAAe,IAAI,QAAQ;AACzC,WAAO,OAAO,UAAU,WAAW,CAAC,CAAC,UAAU,KAAK,CAAU,IAAI,CAAC;AAAA,EACrE,CAAC;AACD,MAAI,iBAAiB,SAAS,GAAG;AAC/B,eAAW;AAAA,MACT,CAAC,sCAAsC,GAAG,KAAK,UAAU,OAAO,YAAY,gBAAgB,CAAC;AAAA,IAC/F;AAAA,EACD;AAED,SAAO;AAAA,IACL,GAAG;AAAA,IACH,iBAAiB;AAAA,IACjB,OAAO,eAAe,CAAC,GAAG,MAAM,GAAG,EAAE,KAAK,KAAK;AAAA,IAC/C,SAAS,eAAe,MAAM,GAAG,CAAC,EAAE,KAAK,IAAI,EAAE,MAAM,GAAG,GAAG;AAAA,IAC3D,MAAM,CAAC,GAAG,IAAI,IAAI,eAAe,QAAQ,CAAC,WAAW,OAAO,YAAY,IAAI,CAAC,CAAC,EAAE,KAAK,2BAA2B;AAAA,IAChH,YAAY;AAAA,MACV,GAAG,IAAI;AAAA,QACL,eAAe;AAAA,UAAQ,CAAC,WACtB,OAAO,OAAO,YAAY,cAAc,WAAW,CAAC,OAAO,YAAY,SAAS,IAAI,CAAC;AAAA,QACvF;AAAA,MACF;AAAA,IACF,EAAE,KAAK,2BAA2B;AAAA,IAClC;AAAA,EACF;AACD;AAEA,SAAS,2BACP,QACA,SACA,MACA,wBACS;AACT,QAAM,wBAAwB,KAAK,mBAAmB,CAAC;AACvD,MAAI,sBAAsB,WAAW,EAAG,QAAO;AAC/C,MAAI,CAAC,OAAO,yBAA0B,QAAO;AAC7C,QAAM,wBAAwB,OAAO,yBAAyB,OAAO,KAAK,CAAC;AAC3E,SAAO,sBAAsB,KAAK,CAAC,mBAAmB,sBAAsB,SAAS,cAAc,CAAC;AACtG;AAyBA,SAAS,UAAU,MAAuB,aAAsE;AAC9G,QAAM,gBAA0B,CAAC;AACjC,MAAI,QAAQ;AAEZ,QAAM,eAAe,wBAAwB,aAAa,KAAK,KAAK;AACpE,MAAI,eAAe,GAAG;AACpB,aAAS,eAAe;AACxB,kBAAc,KAAK,OAAO;AAAA,EAC5B;AAEA,QAAM,iBAAiB,wBAAwB,aAAa,KAAK,OAAO;AACxE,MAAI,iBAAiB,GAAG;AACtB,aAAS,iBAAiB;AAC1B,kBAAc,KAAK,SAAS;AAAA,EAC9B;AAEA,QAAM,aAAa,wBAAwB,aAAa,KAAK,MAAM,KAAK,GAAG,CAAC;AAC5E,MAAI,aAAa,GAAG;AAClB,aAAS,aAAa;AACtB,kBAAc,KAAK,MAAM;AAAA,EAC3B;AAEA,QAAM,gBAAgB,wBAAwB,aAAa,KAAK,YAAY,KAAK,GAAG,CAAC;AACrF,MAAI,gBAAgB,GAAG;AACrB,aAAS,gBAAgB;AACzB,kBAAc,KAAK,YAAY;AAAA,EACjC;AAEA,QAAM,cAAc,wBAAwB,aAAa,GAAG,KAAK,IAAI,IAAI,KAAK,gBAAgB,EAAE;AAChG,MAAI,cAAc,GAAG;AACnB,aAAS;AACT,kBAAc,KAAK,MAAM;AAAA,EAC3B;AAEA,SAAO,EAAE,OAAO,cAAc;AAChC;AAEA,SAAS,YACP,QACA,aACA,kBAC4C;AAC5C,QAAM,gBAA0B,CAAC;AACjC,MAAI,QAAQ;AAEZ,QAAM,eAAe,wBAAwB,aAAa,OAAO,WAAW;AAC5E,QAAM,oBAAoB,wBAAwB,aAAa,OAAO,aAAa;AACnF,QAAM,aAAa,KAAK,IAAI,cAAc,iBAAiB;AAC3D,MAAI,aAAa,GAAG;AAClB,aAAS,aAAa;AACtB,QAAI,eAAe,EAAG,eAAc,KAAK,aAAa;AACtD,QAAI,oBAAoB,EAAG,eAAc,KAAK,QAAQ;AAAA,EACxD;AAEA,QAAM,cAAc,wBAAwB,aAAa,OAAO,UAAU;AAC1E,MAAI,cAAc,GAAG;AACnB,aAAS;AACT,kBAAc,KAAK,YAAY;AAAA,EACjC;AAEA,QAAM,aAAa,wBAAwB,aAAa,iBAAiB,KAAK,GAAG,CAAC;AAClF,MAAI,aAAa,GAAG;AAClB,aAAS,aAAa;AACtB,kBAAc,KAAK,YAAY;AAAA,EACjC;AAEA,SAAO,EAAE,OAAO,cAAc;AAChC;AAEA,eAAe,qBAAqB,SAGL;AAC7B,QAAM,UAAU,+BAA+B,QAAQ,WAAW,QAAQ,uBAAuB;AACjG,QAAM,QAAQ,MAAM,oBAAoB,KAAK,KAAK,SAAS,OAAO,GAAG,EAAE,uBAAuB,KAAK,CAAC;AACpG,QAAM,QAA2B,CAAC;AAClC,aAAW,YAAY,OAAO;AAC5B,QAAI;AACF,YAAM,KAAK,wBAAwB,MAAM,aAAa,QAAQ,CAAC,CAAC;AAAA,IAClE,QAAQ;AAAA,IAER;AAAA,EACF;AACA,SAAO;AACT;AAEA,eAAe,eAAe,SAGL;AACvB,QAAM,kBAAkB,+BAA+B,QAAQ,WAAW,QAAQ,uBAAuB;AACzG,QAAM,UAAU,yBAAyB,eAAe;AACxD,QAAM,QAAQ,MAAM,oBAAoB,SAAS,EAAE,uBAAuB,KAAK,CAAC;AAChF,QAAM,UAAuB,CAAC;AAC9B,aAAW,YAAY,OAAO;AAC5B,QAAI;AACF,cAAQ,KAAK,kBAAkB,MAAM,aAAa,QAAQ,CAAC,CAAC;AAAA,IAC9D,QAAQ;AAAA,IAER;AAAA,EACF;AACA,SAAO;AACT;AAEA,eAAsB,wBAAwB,SASP;AACrC,iBAAe,QAAQ,aAAa,4BAA4B;AAChE,QAAM,cAAc,IAAI,IAAI,sBAAsB,QAAQ,OAAO,CAAC,QAAQ,OAAO,CAAC,CAAC;AACnF,MAAI,YAAY,SAAS,KAAK,QAAQ,cAAc,EAAG,QAAO,CAAC;AAE/D,QAAM,QAAQ,MAAM,qBAAqB,OAAO;AAChD,QAAM,oBAAoB,MAAM,OAAO,CAAC,UAAU,KAAK,iBAAiB,UAAU,KAAK,CAAC;AACxF,QAAM,iBACJ,kBAAkB,SAAS,IAAI,MAAM,mBAAmB,OAAO,IAAI,oBAAI,IAAwB;AACjG,QAAM,2BAA2B,oBAAI,IAAY;AACjD,QAAM,QAAQ,KAAK,IAAI;AACvB,QAAM,gBAAgB,MAAM,QAAQ,CAAC,SAAS;AAC5C,UAAM,YAAY;AAAA,MAChB;AAAA,MACA;AAAA,MACA,QAAQ;AAAA,MACR,QAAQ,+BAA+B;AAAA,MACvC;AAAA,IACF;AACA,QACE,cACC,KAAK,iBAAiB,UAAU,KAAK,KACtC,UAAU,iBAAiB,WAAW,KAAK,iBAAiB,QAC5D;AACA,+BAAyB,IAAI,KAAK,MAAM;AAAA,IAC1C;AACA,WAAO,YAAY,CAAC,SAAS,IAAI,CAAC;AAAA,EACpC,CAAC;AACD,QAAM,aAAa,oBAAI,IAA+B;AAEtD,aAAW,QAAQ,eAAe;AAChC,mBAAe,QAAQ,aAAa,4BAA4B;AAChE,UAAM,EAAE,OAAO,cAAc,IAAI,UAAU,MAAM,WAAW;AAC5D,QAAI,SAAS,EAAG;AAChB,eAAW,IAAI,KAAK,QAAQ;AAAA,MAC1B;AAAA,MACA,WAAW;AAAA,MACX,aAAa;AAAA,MACb,eAAe,IAAI,IAAI,aAAa;AAAA,MACpC,gBAAgB,oBAAI,IAAI;AAAA,IAC1B,CAAC;AAAA,EACH;AAEA,MAAI,QAAQ,gBAAgB;AAC1B,mBAAe,QAAQ,aAAa,4BAA4B;AAChE,UAAM,UAAU,MAAM,eAAe,OAAO;AAC5C,UAAM,YAAY,IAAI,IAAI,cAAc,IAAI,CAAC,SAAS,CAAC,KAAK,QAAQ,IAAI,CAAC,CAAC;AAC1E,eAAW,UAAU,SAAS;AAC5B,qBAAe,QAAQ,aAAa,4BAA4B;AACrE,YAAM,mBAAmB,OAAO,SAAS,OAAO,CAAC,YAAY;AAC7D,cAAM,OAAO,UAAU,IAAI,OAAO;AAClC,eACA,SAAS,UACT,2BAA2B,QAAQ,SAAS,MAAM,yBAAyB,IAAI,OAAO,CAAC;AAAA,MAEvF,CAAC;AACD,YAAM,mBAAmB,IAAI,IAAI,iBAAiB,QAAQ,CAAC,YAAY,UAAU,IAAI,OAAO,GAAG,QAAQ,CAAC,CAAC,CAAC;AAC1G,YAAM,qBAAqB,OAAO,MAAM,OAAO,CAAC,QAAQ,iBAAiB,IAAI,GAAG,CAAC,KAAK,CAAC;AAClF,YAAM,EAAE,OAAO,cAAc,IAAI,YAAY,QAAQ,aAAa,kBAAkB;AACpF,UAAI,SAAS,EAAG;AAChB,iBAAW,WAAW,kBAAkB;AACtC,cAAM,OAAO,UAAU,IAAI,OAAO;AAClC,YAAI,CAAC,KAAM;AACX,cAAM,WAAW,WAAW,IAAI,OAAO,KAAK;AAAA,UAC1C;AAAA,UACA,WAAW;AAAA,UACX,aAAa;AAAA,UACb,eAAe,oBAAI,IAAY;AAAA,UAC/B,gBAAgB,oBAAI,IAAmC;AAAA,QACzD;AACA,iBAAS,eAAe;AACxB,iBAAS,cAAc,IAAI,QAAQ;AACnC,mBAAW,SAAS,cAAe,UAAS,cAAc,IAAI,KAAK;AACnE,iBAAS,eAAe,IAAI,OAAO,UAAU;AAAA,UAC3C,UAAU,OAAO;AAAA,UACjB,YAAY,OAAO;AAAA,UACnB,aAAa,OAAO;AAAA,QACtB,CAAC;AACD,mBAAW,IAAI,SAAS,QAAQ;AAAA,MAClC;AAAA,IACF;AAAA,EACF;AAEA,SAAO,CAAC,GAAG,WAAW,OAAO,CAAC,EAC3B,IAAI,CAAC,cAAc;AAClB,QAAI,QAAQ,UAAU,YAAY,UAAU;AAC5C,QAAI,QAAQ,cAAc,UAAU,KAAK,eAAe,QAAQ,WAAY,UAAS;AACrF,WAAO;AAAA,MACL,MAAM,UAAU;AAAA,MAChB;AAAA,MACA,WAAW,UAAU;AAAA,MACrB,aAAa,UAAU;AAAA,MACvB,eAAe,CAAC,GAAG,UAAU,aAAa,EAAE,KAAK;AAAA,MACjD,gBAAgB,CAAC,GAAG,UAAU,eAAe,OAAO,CAAC,EAAE;AAAA,QACrD,CAAC,MAAM,UACL,KAAK,WAAW,cAAc,MAAM,UAAU,KAAK,KAAK,YAAY,cAAc,MAAM,WAAW;AAAA,MACvG;AAAA,IACF;AAAA,EACF,CAAC,EACA,OAAO,CAAC,WAAW,OAAO,YAAY,KAAK,OAAO,cAAc,CAAC,EACjE;AAAA,IACC,CAAC,MAAM,UACL,MAAM,QAAQ,KAAK,SACnB,MAAM,cAAc,KAAK,eACzB,MAAM,KAAK,WAAW,cAAc,KAAK,KAAK,UAAU;AAAA,EAC5D,EACC,MAAM,GAAG,QAAQ,UAAU;AAChC;","names":[]}