@unbrained/pm-cli 2026.7.16 → 2026.7.18

package/dist/cli-bundle/chunks/chunk-3CUQZNQ6.js.map

@@ -0,0 +1,7 @@
+{
+  "version": 3,
+  "sources": ["../../../../../../../../sdk/relationships.ts", "../../../../../../../../sdk/graph/assembly.ts"],
+  "sourcesContent": ["/**\n * @module sdk/relationships\n *\n * Provides the dependency-free relationship ontology and bounded graph-query\n * kernel shared by the SDK, CLI, MCP adapters, extensions, and non-PM apps.\n */\nimport type { Dependency, ItemMetadata } from \"../types/index.js\";\n\n/** Direction exposed by a relationship kind. */\nexport type RelationshipDirection = \"directed\" | \"undirected\";\n/** Cardinality constraint applied independently to outgoing and incoming edges. */\nexport type RelationshipCardinality = \"one\" | \"many\";\n/** Lifecycle policy for a relationship kind. */\nexport type RelationshipLifecycle = \"persistent\" | \"supersedable\" | \"ephemeral\";\n/** Direction in which an ordering edge contributes to execution precedence. */\nexport type RelationshipPrecedence =\n  | \"source_before_target\"\n  | \"target_before_source\";\n/** Endpoint that represents the structural parent for hierarchy kinds. */\nexport type RelationshipHierarchyDirection = \"source_parent\" | \"target_parent\";\n\n/** Versioned semantic definition for a built-in or application-defined edge kind. */\nexport interface RelationshipKindDefinition {\n  /** Canonical, case-insensitive kind identifier. */\n  kind: string;\n  /** Whether traversing source to target has distinct meaning from the reverse. */\n  direction: RelationshipDirection;\n  /** Optional canonical kind used when traversing a directed edge in reverse. */\n  inverse?: string;\n  /** Whether the kind participates in execution-order cycle checks. */\n  ordering: boolean;\n  /** Execution direction for ordering kinds; defaults to source before target. */\n  precedence?: RelationshipPrecedence;\n  /** Whether the kind contributes to structural ancestry. */\n  hierarchy: boolean;\n  /** Endpoint that represents the parent; defaults to source for custom kinds. */\n  hierarchyDirection?: RelationshipHierarchyDirection;\n  /** Maximum logical outgoing edges of this kind from one node. */\n  outgoing: RelationshipCardinality;\n  /** Maximum logical incoming edges of this kind to one node. */\n  incoming: RelationshipCardinality;\n  /** Edge replacement and retention behavior. */\n  lifecycle: RelationshipLifecycle;\n  /** JSON Schema for optional application-owned payloads. */\n  payloadSchema?: Readonly<Record<string, unknown>>;\n  /** Legacy spellings normalized to this definition. */\n  aliases?: readonly string[];\n  /** Compatibility version of this semantic contract. */\n  compatibilityVersion: number;\n  /** Whether source and target may be the same node. */\n  allowSelf: boolean;\n}\n\n/** One normalized relationship edge indexed by the graph kernel. */\nexport interface RelationshipEdge {\n  /** Source node identifier. */\n  source: string;\n  /** Target node identifier. */\n  target: string;\n  /** Canonical relationship kind. */\n  kind: string;\n  /** Optional creation timestamp retained from storage. */\n  createdAt?: string;\n  /** Optional author retained from storage. */\n  author?: string;\n  /** Optional application-owned edge payload. */\n  payload?: Readonly<Record<string, unknown>>;\n}\n\n/** Direction used by adjacency, closure, and path traversal. */\nexport type RelationshipTraversalDirection = \"outgoing\" | \"incoming\" | \"both\";\n\n/** Shared bounded-query controls. */\nexport interface RelationshipQueryOptions {\n  /** Edge kinds to traverse after alias normalization. */\n  kinds?: readonly string[];\n  /** Traversal direction relative to each visited node. */\n  direction?: RelationshipTraversalDirection;\n  /** Maximum number of returned nodes, excluding the starting node. */\n  limit?: number;\n  /** Maximum traversal depth. */\n  maxDepth?: number;\n  /** Abort signal checked throughout traversal. */\n  signal?: AbortSignal;\n}\n\n/** Cost and truncation metadata returned by every graph query. */\nexport interface RelationshipQueryMeta {\n  /** Number of nodes removed from the traversal frontier. */\n  visitedNodes: number;\n  /** Number of candidate edges inspected. */\n  inspectedEdges: number;\n  /** Whether a configured bound stopped traversal. */\n  truncated: boolean;\n  /** Deterministic continuation cursor for the final returned node. */\n  nextCursor?: string;\n}\n\n/** Generic bounded graph query result. */\nexport interface RelationshipQueryResult<T> {\n  /** Deterministically ordered query value. */\n  value: T;\n  /** Explicit query work and truncation metadata. */\n  meta: RelationshipQueryMeta;\n}\n\n/** One neighbor row pairing an adjacent node with the edge that connects it. */\nexport interface RelationshipNeighborEdge {\n  /** Adjacent node identifier. */\n  id: string;\n  /** Edge connecting the queried node to this neighbor. */\n  edge: RelationshipEdge;\n}\n\n/** Induced subgraph returned by bounded traversal. */\nexport interface RelationshipSubgraph {\n  /** Deterministically ordered node identifiers. */\n  nodes: string[];\n  /** Deterministically ordered edges whose endpoints are both present. */\n  edges: RelationshipEdge[];\n}\n\nconst BUILTIN_RELATIONSHIP_KINDS: readonly RelationshipKindDefinition[] = [\n  {\n    kind: \"blocked_by\",\n    direction: \"directed\",\n    inverse: \"blocks\",\n    ordering: true,\n    precedence: \"target_before_source\",\n    hierarchy: false,\n    outgoing: \"many\",\n    incoming: \"many\",\n    lifecycle: \"persistent\",\n    aliases: [\"depends_on\"],\n    compatibilityVersion: 1,\n    allowSelf: false,\n  },\n  {\n    kind: \"blocks\",\n    direction: \"directed\",\n    inverse: \"blocked_by\",\n    ordering: true,\n    precedence: \"source_before_target\",\n    hierarchy: false,\n    outgoing: \"many\",\n    incoming: \"many\",\n    lifecycle: \"persistent\",\n    compatibilityVersion: 1,\n    allowSelf: false,\n  },\n  {\n    kind: \"parent\",\n    direction: \"directed\",\n    inverse: \"child\",\n    ordering: false,\n    hierarchy: true,\n    hierarchyDirection: \"target_parent\",\n    outgoing: \"one\",\n    incoming: \"many\",\n    lifecycle: \"supersedable\",\n    aliases: [\"child_of\", \"epic\"],\n    compatibilityVersion: 1,\n    allowSelf: false,\n  },\n  {\n    kind: \"child\",\n    direction: \"directed\",\n    inverse: \"parent\",\n    ordering: false,\n    hierarchy: true,\n    hierarchyDirection: \"source_parent\",\n    outgoing: \"many\",\n    incoming: \"one\",\n    lifecycle: \"supersedable\",\n    aliases: [\"parent_child\", \"task\"],\n    compatibilityVersion: 1,\n    allowSelf: false,\n  },\n  {\n    kind: \"related\",\n    direction: \"undirected\",\n    ordering: false,\n    hierarchy: false,\n    outgoing: \"many\",\n    incoming: \"many\",\n    lifecycle: \"persistent\",\n    aliases: [\"related_to\"],\n    compatibilityVersion: 1,\n    allowSelf: false,\n  },\n  {\n    kind: \"discovered_from\",\n    direction: \"directed\",\n    ordering: false,\n    hierarchy: false,\n    outgoing: \"many\",\n    incoming: \"many\",\n    lifecycle: \"persistent\",\n    compatibilityVersion: 1,\n    allowSelf: false,\n  },\n  {\n    kind: \"incident_from\",\n    direction: \"directed\",\n    ordering: false,\n    hierarchy: false,\n    outgoing: \"many\",\n    incoming: \"many\",\n    lifecycle: \"persistent\",\n    compatibilityVersion: 1,\n    allowSelf: false,\n  },\n  {\n    kind: \"supersedes\",\n    direction: \"directed\",\n    ordering: false,\n    hierarchy: false,\n    outgoing: \"many\",\n    incoming: \"many\",\n    lifecycle: \"supersedable\",\n    compatibilityVersion: 1,\n    allowSelf: false,\n  },\n] as const;\n\nfunction normalizeKind(kind: string): string {\n  return kind.trim().toLowerCase().replaceAll(\"-\", \"_\");\n}\n\nfunction normalizeInverseKind(inverse: string | undefined): string | undefined {\n  if (inverse === undefined) return undefined;\n  const normalized = normalizeKind(inverse);\n  if (!/^[a-z][a-z0-9_]*$/.test(normalized))\n    throw new TypeError(`Invalid inverse relationship kind: ${inverse}`);\n  return normalized;\n}\n\nfunction freezeValue(value: unknown, visited = new Set<object>()): unknown {\n  if (value === null || typeof value !== \"object\") return value;\n  if (visited.has(value)) return value;\n  visited.add(value);\n  if (Array.isArray(value)) {\n    for (const entry of value) freezeValue(entry, visited);\n    return Object.freeze(value);\n  }\n  for (const entry of Object.values(value)) freezeValue(entry, visited);\n  return Object.freeze(value);\n}\n\nfunction assertRelationshipPrecedence(\n  definition: RelationshipKindDefinition,\n  kind: string,\n): void {\n  if (\n    definition.precedence !== undefined &&\n    definition.precedence !== \"source_before_target\" &&\n    definition.precedence !== \"target_before_source\"\n  )\n    throw new TypeError(`Invalid relationship precedence for ${kind}`);\n  if (!definition.ordering && definition.precedence !== undefined)\n    throw new TypeError(\n      `Non-ordering relationship kind cannot declare precedence: ${kind}`,\n    );\n}\n\nfunction assertRelationshipHierarchyDirection(\n  definition: RelationshipKindDefinition,\n  kind: string,\n): void {\n  if (\n    definition.hierarchyDirection !== undefined &&\n    definition.hierarchyDirection !== \"source_parent\" &&\n    definition.hierarchyDirection !== \"target_parent\"\n  )\n    throw new TypeError(`Invalid relationship hierarchy direction for ${kind}`);\n  if (!definition.hierarchy && definition.hierarchyDirection !== undefined)\n    throw new TypeError(\n      `Non-hierarchy relationship kind cannot declare hierarchy direction: ${kind}`,\n    );\n}\n\n/** Mutable registry with immutable snapshots and collision-safe extension registration. */\nexport class RelationshipKindRegistry {\n  readonly #definitions = new Map<string, RelationshipKindDefinition>();\n  readonly #aliases = new Map<string, string>();\n\n  /** Create a registry initialized with the stable built-in ontology by default. */\n  public constructor(\n    definitions: readonly RelationshipKindDefinition[] = BUILTIN_RELATIONSHIP_KINDS,\n  ) {\n    for (const definition of definitions) this.register(definition);\n  }\n\n  /** Register one definition after validating its identifier, version, and aliases. */\n  public register(definition: RelationshipKindDefinition): this {\n    const kind = normalizeKind(definition.kind);\n    if (!/^[a-z][a-z0-9_]*$/.test(kind))\n      throw new TypeError(`Invalid relationship kind: ${definition.kind}`);\n    if (\n      !Number.isInteger(definition.compatibilityVersion) ||\n      definition.compatibilityVersion < 1\n    )\n      throw new TypeError(`Invalid compatibility version for ${kind}`);\n    assertRelationshipPrecedence(definition, kind);\n    assertRelationshipHierarchyDirection(definition, kind);\n    if (this.#definitions.has(kind) || this.#aliases.has(kind))\n      throw new TypeError(`Relationship kind already registered: ${kind}`);\n    const inverse = normalizeInverseKind(definition.inverse);\n    const aliases = [\n      ...new Set((definition.aliases ?? []).map(normalizeKind)),\n    ].sort();\n    for (const alias of aliases) {\n      if (!/^[a-z][a-z0-9_]*$/.test(alias))\n        throw new TypeError(`Invalid relationship alias: ${alias}`);\n      if (\n        alias === kind ||\n        this.#definitions.has(alias) ||\n        this.#aliases.has(alias)\n      )\n        throw new TypeError(`Relationship alias already registered: ${alias}`);\n    }\n    const normalized = Object.freeze({\n      ...definition,\n      kind,\n      inverse,\n      aliases: Object.freeze(aliases),\n      payloadSchema: definition.payloadSchema\n        ? (freezeValue(structuredClone(definition.payloadSchema)) as Readonly<\n            Record<string, unknown>\n          >)\n        : undefined,\n    });\n    this.#definitions.set(kind, normalized);\n    for (const alias of aliases) this.#aliases.set(alias, kind);\n    return this;\n  }\n\n  /** Resolve a canonical kind or compatibility alias. */\n  public resolve(kind: unknown): RelationshipKindDefinition | undefined {\n    if (typeof kind !== \"string\") return undefined;\n    const normalized = normalizeKind(kind);\n    return this.#definitions.get(this.#aliases.get(normalized) ?? normalized);\n  }\n\n  /** Resolve a kind or throw a precise error suitable for command adapters. */\n  public require(kind: string): RelationshipKindDefinition {\n    const definition = this.resolve(kind);\n    if (!definition) throw new TypeError(`Unknown relationship kind: ${kind}`);\n    return definition;\n  }\n\n  /** Return a deterministic immutable registry snapshot. */\n  public list(): readonly RelationshipKindDefinition[] {\n    return Object.freeze(\n      [...this.#definitions.values()].sort((left, right) =>\n        left.kind.localeCompare(right.kind),\n      ),\n    );\n  }\n}\n\n/** Create a registry containing the built-in relationship ontology. */\nexport function createRelationshipKindRegistry(): RelationshipKindRegistry {\n  return new RelationshipKindRegistry();\n}\n\nconst defaultRegistry = createRelationshipKindRegistry();\n\n/** Report whether a kind participates in execution-order cycle detection. */\nexport function isOrderingRelationshipKind(\n  kind: string,\n  registry: RelationshipKindRegistry = defaultRegistry,\n): boolean {\n  return registry.resolve(kind)?.ordering === true;\n}\n\nfunction compareEdges(left: RelationshipEdge, right: RelationshipEdge): number {\n  return (\n    left.source.localeCompare(right.source) ||\n    left.target.localeCompare(right.target) ||\n    left.kind.localeCompare(right.kind)\n  );\n}\n\nfunction normalizeRelationshipEdge(\n  candidate: RelationshipEdge,\n  nodes: ReadonlySet<string>,\n  registry: RelationshipKindRegistry,\n): { edge: RelationshipEdge; identity: string } {\n  const source =\n    typeof candidate.source === \"string\" ? candidate.source.trim() : \"\";\n  const target =\n    typeof candidate.target === \"string\" ? candidate.target.trim() : \"\";\n  const definition = registry.require(candidate.kind);\n  if (!nodes.has(source) || !nodes.has(target))\n    throw new TypeError(\n      `Relationship endpoint not found: ${source} -> ${target}`,\n    );\n  if (source === target && !definition.allowSelf)\n    throw new TypeError(\n      `Self relationship is not allowed for ${definition.kind}`,\n    );\n  const edge = Object.freeze({\n    ...candidate,\n    source,\n    target,\n    kind: definition.kind,\n  });\n  const endpoints =\n    definition.direction === \"undirected\"\n      ? [source, target].sort().join(\"\\u0000\")\n      : `${source}\\u0000${target}`;\n  return { edge, identity: `${definition.kind}\\u0000${endpoints}` };\n}\n\nfunction appendIndexedEdge(\n  index: Map<string, RelationshipEdge[]>,\n  node: string,\n  edge: RelationshipEdge,\n): void {\n  const indexed = index.get(node);\n  if (indexed) indexed.push(edge);\n  else index.set(node, [edge]);\n}\n\nfunction normalizeNodeId(value: unknown): string {\n  return typeof value === \"string\" ? value.trim() : \"\";\n}\n\nfunction resolveExistingNodeId(\n  value: unknown,\n  ids: ReadonlySet<string>,\n): string | undefined {\n  const id = normalizeNodeId(value);\n  return id && ids.has(id) ? id : undefined;\n}\n\nfunction reconstructPath(\n  source: string,\n  target: string,\n  parents: ReadonlyMap<string, string>,\n): string[] {\n  const path = [target];\n  let cursor = target;\n  while (cursor !== source) {\n    cursor = parents.get(cursor)!;\n    path.push(cursor);\n  }\n  return path.reverse();\n}\n\n/** Build an immutable, deterministic in-memory relationship index. */\nexport class RelationshipGraph {\n  readonly #registry: RelationshipKindRegistry;\n  readonly #nodes: Set<string>;\n  readonly #nodeSnapshot: readonly string[];\n  readonly #edges: readonly RelationshipEdge[];\n  readonly #outgoing = new Map<string, RelationshipEdge[]>();\n  readonly #incoming = new Map<string, RelationshipEdge[]>();\n\n  /** Validate and index nodes and edges without reading tracker storage. */\n  public constructor(\n    nodes: Iterable<string>,\n    edges: Iterable<RelationshipEdge>,\n    registry: RelationshipKindRegistry = defaultRegistry,\n  ) {\n    this.#registry = registry;\n    this.#nodes = new Set(\n      [...nodes]\n        .filter((id): id is string => typeof id === \"string\")\n        .map((id) => id.trim())\n        .filter(Boolean),\n    );\n    this.#nodeSnapshot = Object.freeze([...this.#nodes].sort());\n    const deduped = new Map<string, RelationshipEdge>();\n    for (const candidate of edges) {\n      const { edge, identity } = normalizeRelationshipEdge(\n        candidate,\n        this.#nodes,\n        registry,\n      );\n      deduped.set(identity, edge);\n    }\n    this.#edges = Object.freeze([...deduped.values()].sort(compareEdges));\n    for (const edge of this.#edges) {\n      appendIndexedEdge(this.#outgoing, edge.source, edge);\n      appendIndexedEdge(this.#incoming, edge.target, edge);\n      if (registry.require(edge.kind).direction === \"undirected\") {\n        appendIndexedEdge(this.#outgoing, edge.target, edge);\n        appendIndexedEdge(this.#incoming, edge.source, edge);\n      }\n    }\n  }\n\n  /** Build the graph directly from item metadata, including hierarchy and legacy blocker fields. */\n  public static fromItems(\n    items: readonly Pick<\n      ItemMetadata,\n      \"id\" | \"parent\" | \"blocked_by\" | \"dependencies\"\n    >[],\n    registry: RelationshipKindRegistry = defaultRegistry,\n  ): RelationshipGraph {\n    const ids = new Set(\n      items.map((item) => normalizeNodeId(item.id)).filter(Boolean),\n    );\n    const edges: RelationshipEdge[] = [];\n    for (const item of items) {\n      const source = normalizeNodeId(item.id);\n      if (!source) continue;\n      const parent = resolveExistingNodeId(item.parent, ids);\n      if (parent) edges.push({ source, target: parent, kind: \"parent\" });\n      const blockedBy = resolveExistingNodeId(item.blocked_by, ids);\n      if (blockedBy)\n        edges.push({\n          source,\n          target: blockedBy,\n          kind: \"blocked_by\",\n        });\n      for (const dependency of item.dependencies ?? []) {\n        const dependencyId = resolveExistingNodeId(dependency.id, ids);\n        if (dependencyId && registry.resolve(dependency.kind))\n          edges.push({\n            source,\n            target: dependencyId,\n            kind: dependency.kind,\n            createdAt: dependency.created_at,\n            author: dependency.author,\n          });\n      }\n    }\n    return new RelationshipGraph(ids, edges, registry);\n  }\n\n  /** Return the deterministic immutable edge snapshot. */\n  public edges(): readonly RelationshipEdge[] {\n    return this.#edges;\n  }\n\n  /** Return the deterministic immutable edges incident to one node. */\n  public incidentEdges(id: string): readonly RelationshipEdge[] {\n    this.#assertNode(id);\n    // Preserve empty fallbacks for legacy indexes and JSON-derived graph state.\n    const outgoing = this.#outgoing.get(id) ?? [];\n    const incoming = this.#incoming.get(id) ?? [];\n    if (outgoing.length === 0) return Object.freeze([...incoming]);\n    if (incoming.length === 0) return Object.freeze([...outgoing]);\n    const edges: RelationshipEdge[] = [];\n    let outgoingIndex = 0;\n    let incomingIndex = 0;\n    while (outgoingIndex < outgoing.length || incomingIndex < incoming.length) {\n      const outgoingEdge = outgoing[outgoingIndex];\n      const incomingEdge = incoming[incomingIndex];\n      const edge =\n        outgoingEdge === undefined\n          ? incomingEdge!\n          : incomingEdge === undefined ||\n              compareEdges(outgoingEdge, incomingEdge) <= 0\n            ? outgoingEdge\n            : incomingEdge;\n      if (edges.at(-1) !== edge) edges.push(edge);\n      if (outgoingEdge === edge) outgoingIndex += 1;\n      if (incomingEdge === edge) incomingIndex += 1;\n    }\n    return Object.freeze(edges);\n  }\n\n  /** Return the deterministic immutable node snapshot. */\n  public nodes(): readonly string[] {\n    return this.#nodeSnapshot;\n  }\n\n  /** Report whether an identifier names an indexed node. */\n  public hasNode(id: string): boolean {\n    return this.#nodes.has(id);\n  }\n\n  /** Return the registry that interprets this graph's relationship kinds. */\n  public registry(): RelationshipKindRegistry {\n    return this.#registry;\n  }\n\n  #assertNode(id: string): void {\n    if (!this.#nodes.has(id))\n      throw new TypeError(`Relationship node not found: ${id}`);\n  }\n\n  #matchesKinds(\n    edge: RelationshipEdge,\n    kinds: ReadonlySet<string> | undefined,\n  ): boolean {\n    if (!kinds) return true;\n    const definition = this.#registry.require(edge.kind);\n    return (\n      kinds.has(edge.kind) ||\n      (definition.inverse !== undefined && kinds.has(definition.inverse))\n    );\n  }\n\n  #neighbors(\n    id: string,\n    direction: RelationshipTraversalDirection,\n    kinds: ReadonlySet<string> | undefined,\n  ): { id: string; edge: RelationshipEdge }[] {\n    const candidates = [\n      ...(direction === \"incoming\" ? [] : (this.#outgoing.get(id) ?? [])),\n      ...(direction === \"outgoing\" ? [] : (this.#incoming.get(id) ?? [])),\n    ];\n    return [...new Set(candidates)]\n      .filter((edge) => this.#matchesKinds(edge, kinds))\n      .map((edge) => ({\n        id: edge.source === id ? edge.target : edge.source,\n        edge,\n      }))\n      .sort(\n        (left, right) =>\n          left.id.localeCompare(right.id) ||\n          compareEdges(left.edge, right.edge),\n      );\n  }\n\n  /** Return one-hop adjacent node identifiers. */\n  public adjacency(\n    id: string,\n    options: RelationshipQueryOptions = {},\n  ): RelationshipQueryResult<string[]> {\n    this.#assertNode(id);\n    options.signal?.throwIfAborted();\n    const kinds = options.kinds\n      ? new Set(options.kinds.map((kind) => this.#registry.require(kind).kind))\n      : undefined;\n    const rows = this.#neighbors(id, options.direction ?? \"outgoing\", kinds);\n    const limit = options.limit ?? Number.POSITIVE_INFINITY;\n    const uniqueNeighbors = [...new Set(rows.map((row) => row.id))];\n    const value = uniqueNeighbors.slice(0, limit);\n    return {\n      value,\n      meta: {\n        visitedNodes: 1,\n        inspectedEdges: rows.length,\n        truncated: value.length < uniqueNeighbors.length,\n        nextCursor: value.at(-1),\n      },\n    };\n  }\n\n  /** Return deterministic one-hop neighbor rows paired with each connecting edge. */\n  public neighborEdges(\n    id: string,\n    options: RelationshipQueryOptions = {},\n  ): RelationshipQueryResult<RelationshipNeighborEdge[]> {\n    this.#assertNode(id);\n    options.signal?.throwIfAborted();\n    const kinds = options.kinds\n      ? new Set(options.kinds.map((kind) => this.#registry.require(kind).kind))\n      : undefined;\n    const rows = this.#neighbors(id, options.direction ?? \"outgoing\", kinds);\n    const limit = options.limit ?? Number.POSITIVE_INFINITY;\n    const value = rows.slice(0, limit);\n    return {\n      value,\n      meta: {\n        visitedNodes: 1,\n        inspectedEdges: rows.length,\n        truncated: value.length < rows.length,\n        nextCursor: value.at(-1)?.id,\n      },\n    };\n  }\n\n  /** Return bounded transitive closure in breadth-first discovery order. */\n  public closure(\n    id: string,\n    options: RelationshipQueryOptions = {},\n  ): RelationshipQueryResult<string[]> {\n    this.#assertNode(id);\n    const kinds = options.kinds\n      ? new Set(options.kinds.map((kind) => this.#registry.require(kind).kind))\n      : undefined;\n    const direction = options.direction ?? \"outgoing\";\n    const limit = options.limit ?? Number.POSITIVE_INFINITY;\n    const maxDepth = options.maxDepth ?? Number.POSITIVE_INFINITY;\n    const seen = new Set([id]);\n    const value: string[] = [];\n    const queue = [{ id, depth: 0 }];\n    let visitedNodes = 0;\n    let inspectedEdges = 0;\n    let truncated = false;\n    traversal: for (let index = 0; index < queue.length; index += 1) {\n      options.signal?.throwIfAborted();\n      const current = queue[index]!;\n      visitedNodes += 1;\n      const neighbors = this.#neighbors(current.id, direction, kinds);\n      inspectedEdges += neighbors.length;\n      if (current.depth >= maxDepth) {\n        if (neighbors.some((neighbor) => !seen.has(neighbor.id)))\n          truncated = true;\n        continue;\n      }\n      for (const neighbor of neighbors) {\n        if (seen.has(neighbor.id)) continue;\n        if (value.length >= limit) {\n          truncated = true;\n          break traversal;\n        }\n        seen.add(neighbor.id);\n        value.push(neighbor.id);\n        queue.push({ id: neighbor.id, depth: current.depth + 1 });\n      }\n    }\n    return {\n      value,\n      meta: {\n        visitedNodes,\n        inspectedEdges,\n        truncated,\n        nextCursor: value.at(-1),\n      },\n    };\n  }\n\n  /** Return a deterministic shortest path, or an empty array when disconnected. */\n  public shortestPath(\n    source: string,\n    target: string,\n    options: RelationshipQueryOptions = {},\n  ): RelationshipQueryResult<string[]> {\n    this.#assertNode(source);\n    this.#assertNode(target);\n    if (source === target)\n      return {\n        value: [source],\n        meta: { visitedNodes: 1, inspectedEdges: 0, truncated: false },\n      };\n    const kinds = options.kinds\n      ? new Set(options.kinds.map((kind) => this.#registry.require(kind).kind))\n      : undefined;\n    const direction = options.direction ?? \"outgoing\";\n    const maxDepth = options.maxDepth ?? Number.POSITIVE_INFINITY;\n    const queue = [{ id: source, depth: 0 }];\n    const parents = new Map<string, string>();\n    const seen = new Set([source]);\n    let visitedNodes = 0;\n    let inspectedEdges = 0;\n    let truncated = false;\n    for (let index = 0; index < queue.length; index += 1) {\n      options.signal?.throwIfAborted();\n      const current = queue[index]!;\n      visitedNodes += 1;\n      const neighbors = this.#neighbors(current.id, direction, kinds);\n      inspectedEdges += neighbors.length;\n      if (current.depth >= maxDepth) {\n        if (neighbors.some((neighbor) => !seen.has(neighbor.id)))\n          truncated = true;\n        continue;\n      }\n      for (const neighbor of neighbors) {\n        if (seen.has(neighbor.id)) continue;\n        parents.set(neighbor.id, current.id);\n        if (neighbor.id === target)\n          return {\n            value: reconstructPath(source, target, parents),\n            meta: { visitedNodes, inspectedEdges, truncated: false },\n          };\n        seen.add(neighbor.id);\n        queue.push({ id: neighbor.id, depth: current.depth + 1 });\n      }\n    }\n    return {\n      value: [],\n      meta: { visitedNodes, inspectedEdges, truncated },\n    };\n  }\n\n  /** Return the induced subgraph over a bounded closure including the root. */\n  public subgraph(\n    id: string,\n    options: RelationshipQueryOptions = {},\n  ): RelationshipQueryResult<RelationshipSubgraph> {\n    const closure = this.closure(id, options);\n    const nodes = [id, ...closure.value].sort();\n    const included = new Set(nodes);\n    const kinds = options.kinds\n      ? new Set(options.kinds.map((kind) => this.#registry.require(kind).kind))\n      : undefined;\n    const edges = new Set<RelationshipEdge>();\n    for (const node of nodes) {\n      for (const edge of this.#outgoing.get(node) ?? []) {\n        if (\n          included.has(edge.source) &&\n          included.has(edge.target) &&\n          this.#matchesKinds(edge, kinds)\n        )\n          edges.add(edge);\n      }\n    }\n    return {\n      value: {\n        nodes,\n        edges: [...edges].sort(compareEdges),\n      },\n      meta: closure.meta,\n    };\n  }\n}\n\n/** Convert one stored dependency into the public relationship edge contract. */\nexport function dependencyToRelationship(\n  source: string,\n  dependency: Dependency,\n  registry: RelationshipKindRegistry = defaultRegistry,\n): RelationshipEdge {\n  return {\n    source,\n    target: dependency.id,\n    kind: registry.require(dependency.kind).kind,\n    createdAt: dependency.created_at,\n    author: dependency.author,\n  };\n}\n", "/**\n * @module sdk/graph/assembly\n *\n * Builds the shared workspace relationship graph consumed by dependency\n * queries, bounded context packets, impact analysis, and governance audits.\n * Assembly normalizes hierarchy, legacy scalar blockers, and structured\n * dependency edges into one deterministic {@link RelationshipGraph}, classifies\n * dangling references without mutating their holders, and materializes missing\n * endpoints as placeholder nodes so bounded traversals can explain absent work\n * instead of silently dropping it.\n */\nimport type { Dependency, ItemStatus } from \"../../types/index.js\";\nimport {\n  RelationshipGraph,\n  type RelationshipKindRegistry,\n} from \"../relationships.js\";\n\n/** Minimal item shape inspected by dependency-reference governance. */\nexport interface DependencyReferenceHolder {\n  /** Stable item identifier. */\n  id: string;\n  /** Lifecycle status used to separate actionable work from historical debt. */\n  status: ItemStatus;\n  /** Optional hierarchy parent reference. */\n  parent?: string;\n  /** Optional legacy scalar blocker reference. */\n  blocked_by?: string;\n  /** Structured dependency edges. */\n  dependencies?: Dependency[];\n}\n\n/** Storage surface that contributed a normalized dependency reference. */\nexport type DependencyReferenceSource = \"parent\" | \"blocked_by\" | \"dependency\";\n\n/** One normalized dependency reference whose target is absent from the tracker. */\nexport interface DanglingDependencyReference {\n  /** Item that owns the reference. */\n  holder_id: string;\n  /** Missing referenced item id or legacy sentinel. */\n  target_id: string;\n  /** Relationship field or dependency kind. */\n  kind: string;\n  /** Storage surface that owns the reference and determines its remediation. */\n  source: DependencyReferenceSource;\n  /** Current lifecycle status of the holder. */\n  holder_status: ItemStatus;\n  /** Whether the holder is terminal and therefore historical, non-actionable debt. */\n  legacy_terminal: boolean;\n  /** Whether the target is the pre-structured-dependency `no-active-blocker` sentinel. */\n  no_active_blocker_sentinel: boolean;\n}\n\n/** Actionable and historical partitions returned by dependency-reference governance. */\nexport interface DanglingDependencyReferenceSummary {\n  /** Missing references held by active items; these may affect scheduling and should gate validation. */\n  active: DanglingDependencyReference[];\n  /** Missing references held only by terminal items; retained as informational history debt. */\n  legacy_terminal: DanglingDependencyReference[];\n  /** Legacy sentinel rows across active and terminal holders, called out separately from typo-like ids. */\n  no_active_blocker_sentinels: DanglingDependencyReference[];\n}\n\n/** Normalize a decoded reference target and reject empty legacy placeholders. */\nfunction normalizeDependencyReferenceTarget(\n  target: unknown,\n): string | undefined {\n  if (typeof target !== \"string\") return undefined;\n  const normalized = target.trim();\n  if (\n    !normalized ||\n    [\"none\", \"null\", \"n/a\", \"na\"].includes(normalized.toLowerCase())\n  )\n    return undefined;\n  return normalized;\n}\n\n/** Normalize a graph target while removing the historical no-blocker marker. */\nfunction normalizeDependencyGraphTarget(target: unknown): string | undefined {\n  const normalized = normalizeDependencyReferenceTarget(target);\n  return normalized?.toLowerCase() === \"no-active-blocker\"\n    ? undefined\n    : normalized;\n}\n\n/**\n * Classify missing hierarchy and dependency targets without mutating their holders.\n *\n * Consumers provide the workspace's terminal-status predicate so custom lifecycle\n * schemas receive the same active-versus-historical behavior as the built-in\n * closed/canceled statuses.\n */\nexport function collectDanglingDependencyReferences(\n  items: readonly DependencyReferenceHolder[],\n  isTerminal: (status: ItemStatus) => boolean = (status) =>\n    status === \"closed\" || status === \"canceled\",\n): DanglingDependencyReferenceSummary {\n  const safeItems = items.filter(\n    (item) => typeof item?.id === \"string\" && item.id.trim().length > 0,\n  );\n  const knownIds = new Set(\n    safeItems.map((item) => item.id.trim().toLowerCase()),\n  );\n  const rows = new Map<string, DanglingDependencyReference>();\n  const addReference = (\n    item: DependencyReferenceHolder,\n    target: unknown,\n    kind: string,\n    source: DependencyReferenceSource,\n  ): void => {\n    const normalized = normalizeDependencyReferenceTarget(target);\n    if (!normalized || knownIds.has(normalized.toLowerCase())) {\n      return;\n    }\n    const row: DanglingDependencyReference = {\n      holder_id: item.id.trim(),\n      target_id: normalized,\n      kind,\n      source,\n      holder_status: item.status,\n      legacy_terminal: isTerminal(item.status),\n      no_active_blocker_sentinel:\n        normalized.toLowerCase() === \"no-active-blocker\",\n    };\n    rows.set(\n      `${row.holder_id}::${row.target_id}::${row.kind}::${row.source}`,\n      row,\n    );\n  };\n  for (const item of safeItems) {\n    addReference(item, item.parent, \"parent\", \"parent\");\n    addReference(item, item.blocked_by, \"blocked_by\", \"blocked_by\");\n    for (const dependency of item.dependencies ?? []) {\n      // Public SDK callers may supply legacy or JSON-decoded payloads that do\n      // not yet satisfy the current structured dependency contract.\n      if (typeof dependency !== \"object\" || dependency === null) {\n        continue;\n      }\n      const legacyDependency = dependency as Partial<Dependency>;\n      addReference(\n        item,\n        legacyDependency.id,\n        typeof legacyDependency.kind === \"string\"\n          ? legacyDependency.kind\n          : \"related\",\n        \"dependency\",\n      );\n    }\n  }\n  const sorted = [...rows.values()].sort(\n    (left, right) =>\n      left.holder_id.localeCompare(right.holder_id) ||\n      left.target_id.localeCompare(right.target_id) ||\n      left.kind.localeCompare(right.kind) ||\n      left.source.localeCompare(right.source),\n  );\n  const legacyTerminal = sorted.filter((row) => row.legacy_terminal);\n  return {\n    active: sorted.filter((row) => !row.legacy_terminal),\n    legacy_terminal: legacyTerminal,\n    no_active_blocker_sentinels: sorted.filter(\n      (row) => row.no_active_blocker_sentinel,\n    ),\n  };\n}\n\n/** Return unique real missing targets while excluding the legacy no-blocker sentinel. */\nexport function collectMissingDependencyTargetIds(\n  dangling: DanglingDependencyReferenceSummary,\n): string[] {\n  const targets = new Map<string, string>();\n  for (const reference of [...dangling.active, ...dangling.legacy_terminal]) {\n    if (reference.no_active_blocker_sentinel) continue;\n    const target = reference.target_id.trim();\n    const key = target.toLowerCase();\n    if (!targets.has(key)) targets.set(key, target);\n  }\n  return [...targets.values()].sort((left, right) => left.localeCompare(right));\n}\n\n/** Item shape accepted by workspace relationship-graph assembly. */\nexport interface WorkspaceRelationshipItem extends DependencyReferenceHolder {\n  /** Human-readable title projected into per-node details. */\n  title: string;\n}\n\n/** Compact node projection paired with the assembled graph. */\nexport interface WorkspaceRelationshipNodeDetails {\n  /** Stable node identifier. */\n  id: string;\n  /** Human-readable node title, or a `[missing]` marker for absent endpoints. */\n  title: string;\n  /** Lifecycle status, or the `missing` marker status for absent endpoints. */\n  status: string;\n}\n\n/** Assembled workspace relationship graph with governance side-products. */\nexport interface WorkspaceRelationshipAssembly {\n  /** Deterministic relationship graph including missing placeholder nodes. */\n  graph: RelationshipGraph;\n  /** Per-node compact details covering real and missing nodes. */\n  details: WorkspaceRelationshipNodeDetails[];\n  /** Lowercased identifiers of materialized missing endpoints. */\n  missingIdSet: Set<string>;\n  /** Dangling-reference classification computed during assembly. */\n  dangling: DanglingDependencyReferenceSummary;\n}\n\n/**\n * Build the shared workspace relationship graph including missing placeholder\n * nodes. One assembly serves every bounded query in an invocation — dependency\n * trees, context packets, impact analysis, path enumeration, and governance\n * audits — so the full-workspace normalization cost is paid once instead of\n * once per query surface.\n */\nexport function assembleWorkspaceRelationshipGraph(\n  items: readonly WorkspaceRelationshipItem[],\n  isTerminal?: (status: ItemStatus) => boolean,\n  registry?: RelationshipKindRegistry,\n): WorkspaceRelationshipAssembly {\n  const safeItems = items.filter(\n    (item) => typeof item?.id === \"string\" && item.id.trim().length > 0,\n  );\n  const canonicalIds = new Map(\n    safeItems.map((item) => [item.id.trim().toLowerCase(), item.id.trim()]),\n  );\n  const dangling = collectDanglingDependencyReferences(safeItems, isTerminal);\n  const missingIds = collectMissingDependencyTargetIds(dangling);\n  for (const id of missingIds) canonicalIds.set(id.toLowerCase(), id);\n  const graphItems = safeItems.map((item) => {\n    const parent = normalizeDependencyGraphTarget(item.parent);\n    const blocker = normalizeDependencyGraphTarget(item.blocked_by);\n    const dependencies = (item.dependencies ?? []).flatMap((rawDependency) => {\n      if (typeof rawDependency !== \"object\" || rawDependency === null)\n        return [];\n      const dependency = rawDependency as Partial<Dependency>;\n      const target = normalizeDependencyGraphTarget(dependency.id);\n      if (!target) return [];\n      return [\n        {\n          id: canonicalIds.get(target.toLowerCase())!,\n          kind:\n            typeof dependency.kind === \"string\" ? dependency.kind : \"related\",\n        },\n      ];\n    });\n    return {\n      id: item.id.trim(),\n      ...(parent ? { parent: canonicalIds.get(parent.toLowerCase())! } : {}),\n      ...(blocker\n        ? { blocked_by: canonicalIds.get(blocker.toLowerCase())! }\n        : {}),\n      dependencies,\n    };\n  });\n  return {\n    graph: RelationshipGraph.fromItems(\n      [...graphItems, ...missingIds.map((id) => ({ id }))],\n      registry,\n    ),\n    details: [\n      ...safeItems.map((item) => ({\n        id: item.id.trim(),\n        title: item.title,\n        status: item.status,\n      })),\n      ...missingIds.map((id) => ({\n        id,\n        title: `[missing] ${id}`,\n        status: \"missing\",\n      })),\n    ],\n    missingIdSet: new Set(missingIds.map((id) => id.toLowerCase())),\n    dangling,\n  };\n}\n"],
+  "mappings": ";;;;;;;;AA0HA,IAAM,6BAAoE;EACxE;IACE,MAAM;IACN,WAAW;IACX,SAAS;IACT,UAAU;IACV,YAAY;IACZ,WAAW;IACX,UAAU;IACV,UAAU;IACV,WAAW;IACX,SAAS,CAAC,YAAY;IACtB,sBAAsB;IACtB,WAAW;;EAEb;IACE,MAAM;IACN,WAAW;IACX,SAAS;IACT,UAAU;IACV,YAAY;IACZ,WAAW;IACX,UAAU;IACV,UAAU;IACV,WAAW;IACX,sBAAsB;IACtB,WAAW;;EAEb;IACE,MAAM;IACN,WAAW;IACX,SAAS;IACT,UAAU;IACV,WAAW;IACX,oBAAoB;IACpB,UAAU;IACV,UAAU;IACV,WAAW;IACX,SAAS,CAAC,YAAY,MAAM;IAC5B,sBAAsB;IACtB,WAAW;;EAEb;IACE,MAAM;IACN,WAAW;IACX,SAAS;IACT,UAAU;IACV,WAAW;IACX,oBAAoB;IACpB,UAAU;IACV,UAAU;IACV,WAAW;IACX,SAAS,CAAC,gBAAgB,MAAM;IAChC,sBAAsB;IACtB,WAAW;;EAEb;IACE,MAAM;IACN,WAAW;IACX,UAAU;IACV,WAAW;IACX,UAAU;IACV,UAAU;IACV,WAAW;IACX,SAAS,CAAC,YAAY;IACtB,sBAAsB;IACtB,WAAW;;EAEb;IACE,MAAM;IACN,WAAW;IACX,UAAU;IACV,WAAW;IACX,UAAU;IACV,UAAU;IACV,WAAW;IACX,sBAAsB;IACtB,WAAW;;EAEb;IACE,MAAM;IACN,WAAW;IACX,UAAU;IACV,WAAW;IACX,UAAU;IACV,UAAU;IACV,WAAW;IACX,sBAAsB;IACtB,WAAW;;EAEb;IACE,MAAM;IACN,WAAW;IACX,UAAU;IACV,WAAW;IACX,UAAU;IACV,UAAU;IACV,WAAW;IACX,sBAAsB;IACtB,WAAW;;;AAIf,SAAS,cAAc,MAAY;AACjC,SAAO,KAAK,KAAI,EAAG,YAAW,EAAG,WAAW,KAAK,GAAG;AACtD;AAEA,SAAS,qBAAqB,SAA2B;AACvD,MAAI,YAAY;AAAW,WAAO;AAClC,QAAM,aAAa,cAAc,OAAO;AACxC,MAAI,CAAC,oBAAoB,KAAK,UAAU;AACtC,UAAM,IAAI,UAAU,sCAAsC,OAAO,EAAE;AACrE,SAAO;AACT;AAEA,SAAS,YAAY,OAAgB,UAAU,oBAAI,IAAG,GAAU;AAC9D,MAAI,UAAU,QAAQ,OAAO,UAAU;AAAU,WAAO;AACxD,MAAI,QAAQ,IAAI,KAAK;AAAG,WAAO;AAC/B,UAAQ,IAAI,KAAK;AACjB,MAAI,MAAM,QAAQ,KAAK,GAAG;AACxB,eAAW,SAAS;AAAO,kBAAY,OAAO,OAAO;AACrD,WAAO,OAAO,OAAO,KAAK;EAC5B;AACA,aAAW,SAAS,OAAO,OAAO,KAAK;AAAG,gBAAY,OAAO,OAAO;AACpE,SAAO,OAAO,OAAO,KAAK;AAC5B;AAEA,SAAS,6BACP,YACA,MAAY;AAEZ,MACE,WAAW,eAAe,UAC1B,WAAW,eAAe,0BAC1B,WAAW,eAAe;AAE1B,UAAM,IAAI,UAAU,uCAAuC,IAAI,EAAE;AACnE,MAAI,CAAC,WAAW,YAAY,WAAW,eAAe;AACpD,UAAM,IAAI,UACR,6DAA6D,IAAI,EAAE;AAEzE;AAEA,SAAS,qCACP,YACA,MAAY;AAEZ,MACE,WAAW,uBAAuB,UAClC,WAAW,uBAAuB,mBAClC,WAAW,uBAAuB;AAElC,UAAM,IAAI,UAAU,gDAAgD,IAAI,EAAE;AAC5E,MAAI,CAAC,WAAW,aAAa,WAAW,uBAAuB;AAC7D,UAAM,IAAI,UACR,uEAAuE,IAAI,EAAE;AAEnF;AAGM,IAAO,2BAAP,MAA+B;EAC1B,eAAe,oBAAI,IAAG;EACtB,WAAW,oBAAI,IAAG;;EAG3B,YACE,cAAqD,4BAA0B;AAE/E,eAAW,cAAc;AAAa,WAAK,SAAS,UAAU;EAChE;;EAGO,SAAS,YAAsC;AACpD,UAAM,OAAO,cAAc,WAAW,IAAI;AAC1C,QAAI,CAAC,oBAAoB,KAAK,IAAI;AAChC,YAAM,IAAI,UAAU,8BAA8B,WAAW,IAAI,EAAE;AACrE,QACE,CAAC,OAAO,UAAU,WAAW,oBAAoB,KACjD,WAAW,uBAAuB;AAElC,YAAM,IAAI,UAAU,qCAAqC,IAAI,EAAE;AACjE,iCAA6B,YAAY,IAAI;AAC7C,yCAAqC,YAAY,IAAI;AACrD,QAAI,KAAK,aAAa,IAAI,IAAI,KAAK,KAAK,SAAS,IAAI,IAAI;AACvD,YAAM,IAAI,UAAU,yCAAyC,IAAI,EAAE;AACrE,UAAM,UAAU,qBAAqB,WAAW,OAAO;AACvD,UAAM,UAAU;MACd,GAAG,IAAI,KAAK,WAAW,WAAW,CAAA,GAAI,IAAI,aAAa,CAAC;MACxD,KAAI;AACN,eAAW,SAAS,SAAS;AAC3B,UAAI,CAAC,oBAAoB,KAAK,KAAK;AACjC,cAAM,IAAI,UAAU,+BAA+B,KAAK,EAAE;AAC5D,UACE,UAAU,QACV,KAAK,aAAa,IAAI,KAAK,KAC3B,KAAK,SAAS,IAAI,KAAK;AAEvB,cAAM,IAAI,UAAU,0CAA0C,KAAK,EAAE;IACzE;AACA,UAAM,aAAa,OAAO,OAAO;MAC/B,GAAG;MACH;MACA;MACA,SAAS,OAAO,OAAO,OAAO;MAC9B,eAAe,WAAW,gBACrB,YAAY,gBAAgB,WAAW,aAAa,CAAC,IAGtD;KACL;AACD,SAAK,aAAa,IAAI,MAAM,UAAU;AACtC,eAAW,SAAS;AAAS,WAAK,SAAS,IAAI,OAAO,IAAI;AAC1D,WAAO;EACT;;EAGO,QAAQ,MAAa;AAC1B,QAAI,OAAO,SAAS;AAAU,aAAO;AACrC,UAAM,aAAa,cAAc,IAAI;AACrC,WAAO,KAAK,aAAa,IAAI,KAAK,SAAS,IAAI,UAAU,KAAK,UAAU;EAC1E;;EAGO,QAAQ,MAAY;AACzB,UAAM,aAAa,KAAK,QAAQ,IAAI;AACpC,QAAI,CAAC;AAAY,YAAM,IAAI,UAAU,8BAA8B,IAAI,EAAE;AACzE,WAAO;EACT;;EAGO,OAAI;AACT,WAAO,OAAO,OACZ,CAAC,GAAG,KAAK,aAAa,OAAM,CAAE,EAAE,KAAK,CAAC,MAAM,UAC1C,KAAK,KAAK,cAAc,MAAM,IAAI,CAAC,CACpC;EAEL;;AAII,SAAU,iCAA8B;AAC5C,SAAO,IAAI,yBAAwB;AACrC;AAEA,IAAM,kBAAkB,+BAA8B;AAGhD,SAAU,2BACd,MACA,WAAqC,iBAAe;AAEpD,SAAO,SAAS,QAAQ,IAAI,GAAG,aAAa;AAC9C;AAEA,SAAS,aAAa,MAAwB,OAAuB;AACnE,SACE,KAAK,OAAO,cAAc,MAAM,MAAM,KACtC,KAAK,OAAO,cAAc,MAAM,MAAM,KACtC,KAAK,KAAK,cAAc,MAAM,IAAI;AAEtC;AAEA,SAAS,0BACP,WACA,OACA,UAAkC;AAElC,QAAM,SACJ,OAAO,UAAU,WAAW,WAAW,UAAU,OAAO,KAAI,IAAK;AACnE,QAAM,SACJ,OAAO,UAAU,WAAW,WAAW,UAAU,OAAO,KAAI,IAAK;AACnE,QAAM,aAAa,SAAS,QAAQ,UAAU,IAAI;AAClD,MAAI,CAAC,MAAM,IAAI,MAAM,KAAK,CAAC,MAAM,IAAI,MAAM;AACzC,UAAM,IAAI,UACR,oCAAoC,MAAM,OAAO,MAAM,EAAE;AAE7D,MAAI,WAAW,UAAU,CAAC,WAAW;AACnC,UAAM,IAAI,UACR,wCAAwC,WAAW,IAAI,EAAE;AAE7D,QAAM,OAAO,OAAO,OAAO;IACzB,GAAG;IACH;IACA;IACA,MAAM,WAAW;GAClB;AACD,QAAM,YACJ,WAAW,cAAc,eACrB,CAAC,QAAQ,MAAM,EAAE,KAAI,EAAG,KAAK,IAAQ,IACrC,GAAG,MAAM,KAAS,MAAM;AAC9B,SAAO,EAAE,MAAM,UAAU,GAAG,WAAW,IAAI,KAAS,SAAS,GAAE;AACjE;AAEA,SAAS,kBACP,OACA,MACA,MAAsB;AAEtB,QAAM,UAAU,MAAM,IAAI,IAAI;AAC9B,MAAI;AAAS,YAAQ,KAAK,IAAI;;AACzB,UAAM,IAAI,MAAM,CAAC,IAAI,CAAC;AAC7B;AAEA,SAAS,gBAAgB,OAAc;AACrC,SAAO,OAAO,UAAU,WAAW,MAAM,KAAI,IAAK;AACpD;AAEA,SAAS,sBACP,OACA,KAAwB;AAExB,QAAM,KAAK,gBAAgB,KAAK;AAChC,SAAO,MAAM,IAAI,IAAI,EAAE,IAAI,KAAK;AAClC;AAEA,SAAS,gBACP,QACA,QACA,SAAoC;AAEpC,QAAM,OAAO,CAAC,MAAM;AACpB,MAAI,SAAS;AACb,SAAO,WAAW,QAAQ;AACxB,aAAS,QAAQ,IAAI,MAAM;AAC3B,SAAK,KAAK,MAAM;EAClB;AACA,SAAO,KAAK,QAAO;AACrB;AAGM,IAAO,oBAAP,MAAO,mBAAiB;EACnB;EACA;EACA;EACA;EACA,YAAY,oBAAI,IAAG;EACnB,YAAY,oBAAI,IAAG;;EAG5B,YACE,OACA,OACA,WAAqC,iBAAe;AAEpD,SAAK,YAAY;AACjB,SAAK,SAAS,IAAI,IAChB,CAAC,GAAG,KAAK,EACN,OAAO,CAAC,OAAqB,OAAO,OAAO,QAAQ,EACnD,IAAI,CAAC,OAAO,GAAG,KAAI,CAAE,EACrB,OAAO,OAAO,CAAC;AAEpB,SAAK,gBAAgB,OAAO,OAAO,CAAC,GAAG,KAAK,MAAM,EAAE,KAAI,CAAE;AAC1D,UAAM,UAAU,oBAAI,IAAG;AACvB,eAAW,aAAa,OAAO;AAC7B,YAAM,EAAE,MAAM,SAAQ,IAAK,0BACzB,WACA,KAAK,QACL,QAAQ;AAEV,cAAQ,IAAI,UAAU,IAAI;IAC5B;AACA,SAAK,SAAS,OAAO,OAAO,CAAC,GAAG,QAAQ,OAAM,CAAE,EAAE,KAAK,YAAY,CAAC;AACpE,eAAW,QAAQ,KAAK,QAAQ;AAC9B,wBAAkB,KAAK,WAAW,KAAK,QAAQ,IAAI;AACnD,wBAAkB,KAAK,WAAW,KAAK,QAAQ,IAAI;AACnD,UAAI,SAAS,QAAQ,KAAK,IAAI,EAAE,cAAc,cAAc;AAC1D,0BAAkB,KAAK,WAAW,KAAK,QAAQ,IAAI;AACnD,0BAAkB,KAAK,WAAW,KAAK,QAAQ,IAAI;MACrD;IACF;EACF;;EAGO,OAAO,UACZ,OAIA,WAAqC,iBAAe;AAEpD,UAAM,MAAM,IAAI,IACd,MAAM,IAAI,CAAC,SAAS,gBAAgB,KAAK,EAAE,CAAC,EAAE,OAAO,OAAO,CAAC;AAE/D,UAAM,QAA4B,CAAA;AAClC,eAAW,QAAQ,OAAO;AACxB,YAAM,SAAS,gBAAgB,KAAK,EAAE;AACtC,UAAI,CAAC;AAAQ;AACb,YAAM,SAAS,sBAAsB,KAAK,QAAQ,GAAG;AACrD,UAAI;AAAQ,cAAM,KAAK,EAAE,QAAQ,QAAQ,QAAQ,MAAM,SAAQ,CAAE;AACjE,YAAM,YAAY,sBAAsB,KAAK,YAAY,GAAG;AAC5D,UAAI;AACF,cAAM,KAAK;UACT;UACA,QAAQ;UACR,MAAM;SACP;AACH,iBAAW,cAAc,KAAK,gBAAgB,CAAA,GAAI;AAChD,cAAM,eAAe,sBAAsB,WAAW,IAAI,GAAG;AAC7D,YAAI,gBAAgB,SAAS,QAAQ,WAAW,IAAI;AAClD,gBAAM,KAAK;YACT;YACA,QAAQ;YACR,MAAM,WAAW;YACjB,WAAW,WAAW;YACtB,QAAQ,WAAW;WACpB;MACL;IACF;AACA,WAAO,IAAI,mBAAkB,KAAK,OAAO,QAAQ;EACnD;;EAGO,QAAK;AACV,WAAO,KAAK;EACd;;EAGO,cAAc,IAAU;AAC7B,SAAK,YAAY,EAAE;AAEnB,UAAM,WAAW,KAAK,UAAU,IAAI,EAAE,KAAK,CAAA;AAC3C,UAAM,WAAW,KAAK,UAAU,IAAI,EAAE,KAAK,CAAA;AAC3C,QAAI,SAAS,WAAW;AAAG,aAAO,OAAO,OAAO,CAAC,GAAG,QAAQ,CAAC;AAC7D,QAAI,SAAS,WAAW;AAAG,aAAO,OAAO,OAAO,CAAC,GAAG,QAAQ,CAAC;AAC7D,UAAM,QAA4B,CAAA;AAClC,QAAI,gBAAgB;AACpB,QAAI,gBAAgB;AACpB,WAAO,gBAAgB,SAAS,UAAU,gBAAgB,SAAS,QAAQ;AACzE,YAAM,eAAe,SAAS,aAAa;AAC3C,YAAM,eAAe,SAAS,aAAa;AAC3C,YAAM,OACJ,iBAAiB,SACb,eACA,iBAAiB,UACf,aAAa,cAAc,YAAY,KAAK,IAC5C,eACA;AACR,UAAI,MAAM,GAAG,EAAE,MAAM;AAAM,cAAM,KAAK,IAAI;AAC1C,UAAI,iBAAiB;AAAM,yBAAiB;AAC5C,UAAI,iBAAiB;AAAM,yBAAiB;IAC9C;AACA,WAAO,OAAO,OAAO,KAAK;EAC5B;;EAGO,QAAK;AACV,WAAO,KAAK;EACd;;EAGO,QAAQ,IAAU;AACvB,WAAO,KAAK,OAAO,IAAI,EAAE;EAC3B;;EAGO,WAAQ;AACb,WAAO,KAAK;EACd;EAEA,YAAY,IAAU;AACpB,QAAI,CAAC,KAAK,OAAO,IAAI,EAAE;AACrB,YAAM,IAAI,UAAU,gCAAgC,EAAE,EAAE;EAC5D;EAEA,cACE,MACA,OAAsC;AAEtC,QAAI,CAAC;AAAO,aAAO;AACnB,UAAM,aAAa,KAAK,UAAU,QAAQ,KAAK,IAAI;AACnD,WACE,MAAM,IAAI,KAAK,IAAI,KAClB,WAAW,YAAY,UAAa,MAAM,IAAI,WAAW,OAAO;EAErE;EAEA,WACE,IACA,WACA,OAAsC;AAEtC,UAAM,aAAa;MACjB,GAAI,cAAc,aAAa,CAAA,IAAM,KAAK,UAAU,IAAI,EAAE,KAAK,CAAA;MAC/D,GAAI,cAAc,aAAa,CAAA,IAAM,KAAK,UAAU,IAAI,EAAE,KAAK,CAAA;;AAEjE,WAAO,CAAC,GAAG,IAAI,IAAI,UAAU,CAAC,EAC3B,OAAO,CAAC,SAAS,KAAK,cAAc,MAAM,KAAK,CAAC,EAChD,IAAI,CAAC,UAAU;MACd,IAAI,KAAK,WAAW,KAAK,KAAK,SAAS,KAAK;MAC5C;MACA,EACD,KACC,CAAC,MAAM,UACL,KAAK,GAAG,cAAc,MAAM,EAAE,KAC9B,aAAa,KAAK,MAAM,MAAM,IAAI,CAAC;EAE3C;;EAGO,UACL,IACA,UAAoC,CAAA,GAAE;AAEtC,SAAK,YAAY,EAAE;AACnB,YAAQ,QAAQ,eAAc;AAC9B,UAAM,QAAQ,QAAQ,QAClB,IAAI,IAAI,QAAQ,MAAM,IAAI,CAAC,SAAS,KAAK,UAAU,QAAQ,IAAI,EAAE,IAAI,CAAC,IACtE;AACJ,UAAM,OAAO,KAAK,WAAW,IAAI,QAAQ,aAAa,YAAY,KAAK;AACvE,UAAM,QAAQ,QAAQ,SAAS,OAAO;AACtC,UAAM,kBAAkB,CAAC,GAAG,IAAI,IAAI,KAAK,IAAI,CAAC,QAAQ,IAAI,EAAE,CAAC,CAAC;AAC9D,UAAM,QAAQ,gBAAgB,MAAM,GAAG,KAAK;AAC5C,WAAO;MACL;MACA,MAAM;QACJ,cAAc;QACd,gBAAgB,KAAK;QACrB,WAAW,MAAM,SAAS,gBAAgB;QAC1C,YAAY,MAAM,GAAG,EAAE;;;EAG7B;;EAGO,cACL,IACA,UAAoC,CAAA,GAAE;AAEtC,SAAK,YAAY,EAAE;AACnB,YAAQ,QAAQ,eAAc;AAC9B,UAAM,QAAQ,QAAQ,QAClB,IAAI,IAAI,QAAQ,MAAM,IAAI,CAAC,SAAS,KAAK,UAAU,QAAQ,IAAI,EAAE,IAAI,CAAC,IACtE;AACJ,UAAM,OAAO,KAAK,WAAW,IAAI,QAAQ,aAAa,YAAY,KAAK;AACvE,UAAM,QAAQ,QAAQ,SAAS,OAAO;AACtC,UAAM,QAAQ,KAAK,MAAM,GAAG,KAAK;AACjC,WAAO;MACL;MACA,MAAM;QACJ,cAAc;QACd,gBAAgB,KAAK;QACrB,WAAW,MAAM,SAAS,KAAK;QAC/B,YAAY,MAAM,GAAG,EAAE,GAAG;;;EAGhC;;EAGO,QACL,IACA,UAAoC,CAAA,GAAE;AAEtC,SAAK,YAAY,EAAE;AACnB,UAAM,QAAQ,QAAQ,QAClB,IAAI,IAAI,QAAQ,MAAM,IAAI,CAAC,SAAS,KAAK,UAAU,QAAQ,IAAI,EAAE,IAAI,CAAC,IACtE;AACJ,UAAM,YAAY,QAAQ,aAAa;AACvC,UAAM,QAAQ,QAAQ,SAAS,OAAO;AACtC,UAAM,WAAW,QAAQ,YAAY,OAAO;AAC5C,UAAM,OAAO,oBAAI,IAAI,CAAC,EAAE,CAAC;AACzB,UAAM,QAAkB,CAAA;AACxB,UAAM,QAAQ,CAAC,EAAE,IAAI,OAAO,EAAC,CAAE;AAC/B,QAAI,eAAe;AACnB,QAAI,iBAAiB;AACrB,QAAI,YAAY;AAChB,cAAW,UAAS,QAAQ,GAAG,QAAQ,MAAM,QAAQ,SAAS,GAAG;AAC/D,cAAQ,QAAQ,eAAc;AAC9B,YAAM,UAAU,MAAM,KAAK;AAC3B,sBAAgB;AAChB,YAAM,YAAY,KAAK,WAAW,QAAQ,IAAI,WAAW,KAAK;AAC9D,wBAAkB,UAAU;AAC5B,UAAI,QAAQ,SAAS,UAAU;AAC7B,YAAI,UAAU,KAAK,CAAC,aAAa,CAAC,KAAK,IAAI,SAAS,EAAE,CAAC;AACrD,sBAAY;AACd;MACF;AACA,iBAAW,YAAY,WAAW;AAChC,YAAI,KAAK,IAAI,SAAS,EAAE;AAAG;AAC3B,YAAI,MAAM,UAAU,OAAO;AACzB,sBAAY;AACZ,gBAAM;QACR;AACA,aAAK,IAAI,SAAS,EAAE;AACpB,cAAM,KAAK,SAAS,EAAE;AACtB,cAAM,KAAK,EAAE,IAAI,SAAS,IAAI,OAAO,QAAQ,QAAQ,EAAC,CAAE;MAC1D;IACF;AACA,WAAO;MACL;MACA,MAAM;QACJ;QACA;QACA;QACA,YAAY,MAAM,GAAG,EAAE;;;EAG7B;;EAGO,aACL,QACA,QACA,UAAoC,CAAA,GAAE;AAEtC,SAAK,YAAY,MAAM;AACvB,SAAK,YAAY,MAAM;AACvB,QAAI,WAAW;AACb,aAAO;QACL,OAAO,CAAC,MAAM;QACd,MAAM,EAAE,cAAc,GAAG,gBAAgB,GAAG,WAAW,MAAK;;AAEhE,UAAM,QAAQ,QAAQ,QAClB,IAAI,IAAI,QAAQ,MAAM,IAAI,CAAC,SAAS,KAAK,UAAU,QAAQ,IAAI,EAAE,IAAI,CAAC,IACtE;AACJ,UAAM,YAAY,QAAQ,aAAa;AACvC,UAAM,WAAW,QAAQ,YAAY,OAAO;AAC5C,UAAM,QAAQ,CAAC,EAAE,IAAI,QAAQ,OAAO,EAAC,CAAE;AACvC,UAAM,UAAU,oBAAI,IAAG;AACvB,UAAM,OAAO,oBAAI,IAAI,CAAC,MAAM,CAAC;AAC7B,QAAI,eAAe;AACnB,QAAI,iBAAiB;AACrB,QAAI,YAAY;AAChB,aAAS,QAAQ,GAAG,QAAQ,MAAM,QAAQ,SAAS,GAAG;AACpD,cAAQ,QAAQ,eAAc;AAC9B,YAAM,UAAU,MAAM,KAAK;AAC3B,sBAAgB;AAChB,YAAM,YAAY,KAAK,WAAW,QAAQ,IAAI,WAAW,KAAK;AAC9D,wBAAkB,UAAU;AAC5B,UAAI,QAAQ,SAAS,UAAU;AAC7B,YAAI,UAAU,KAAK,CAAC,aAAa,CAAC,KAAK,IAAI,SAAS,EAAE,CAAC;AACrD,sBAAY;AACd;MACF;AACA,iBAAW,YAAY,WAAW;AAChC,YAAI,KAAK,IAAI,SAAS,EAAE;AAAG;AAC3B,gBAAQ,IAAI,SAAS,IAAI,QAAQ,EAAE;AACnC,YAAI,SAAS,OAAO;AAClB,iBAAO;YACL,OAAO,gBAAgB,QAAQ,QAAQ,OAAO;YAC9C,MAAM,EAAE,cAAc,gBAAgB,WAAW,MAAK;;AAE1D,aAAK,IAAI,SAAS,EAAE;AACpB,cAAM,KAAK,EAAE,IAAI,SAAS,IAAI,OAAO,QAAQ,QAAQ,EAAC,CAAE;MAC1D;IACF;AACA,WAAO;MACL,OAAO,CAAA;MACP,MAAM,EAAE,cAAc,gBAAgB,UAAS;;EAEnD;;EAGO,SACL,IACA,UAAoC,CAAA,GAAE;AAEtC,UAAM,UAAU,KAAK,QAAQ,IAAI,OAAO;AACxC,UAAM,QAAQ,CAAC,IAAI,GAAG,QAAQ,KAAK,EAAE,KAAI;AACzC,UAAM,WAAW,IAAI,IAAI,KAAK;AAC9B,UAAM,QAAQ,QAAQ,QAClB,IAAI,IAAI,QAAQ,MAAM,IAAI,CAAC,SAAS,KAAK,UAAU,QAAQ,IAAI,EAAE,IAAI,CAAC,IACtE;AACJ,UAAM,QAAQ,oBAAI,IAAG;AACrB,eAAW,QAAQ,OAAO;AACxB,iBAAW,QAAQ,KAAK,UAAU,IAAI,IAAI,KAAK,CAAA,GAAI;AACjD,YACE,SAAS,IAAI,KAAK,MAAM,KACxB,SAAS,IAAI,KAAK,MAAM,KACxB,KAAK,cAAc,MAAM,KAAK;AAE9B,gBAAM,IAAI,IAAI;MAClB;IACF;AACA,WAAO;MACL,OAAO;QACL;QACA,OAAO,CAAC,GAAG,KAAK,EAAE,KAAK,YAAY;;MAErC,MAAM,QAAQ;;EAElB;;AAII,SAAU,yBACd,QACA,YACA,WAAqC,iBAAe;AAEpD,SAAO;IACL;IACA,QAAQ,WAAW;IACnB,MAAM,SAAS,QAAQ,WAAW,IAAI,EAAE;IACxC,WAAW,WAAW;IACtB,QAAQ,WAAW;;AAEvB;;;;;;;;;;ACnvBA,SAAS,mCACP,QAAe;AAEf,MAAI,OAAO,WAAW;AAAU,WAAO;AACvC,QAAM,aAAa,OAAO,KAAI;AAC9B,MACE,CAAC,cACD,CAAC,QAAQ,QAAQ,OAAO,IAAI,EAAE,SAAS,WAAW,YAAW,CAAE;AAE/D,WAAO;AACT,SAAO;AACT;AAGA,SAAS,+BAA+B,QAAe;AACrD,QAAM,aAAa,mCAAmC,MAAM;AAC5D,SAAO,YAAY,YAAW,MAAO,sBACjC,SACA;AACN;AASM,SAAU,oCACd,OACA,aAA8C,CAAC,WAC7C,WAAW,YAAY,WAAW,YAAU;AAE9C,QAAM,YAAY,MAAM,OACtB,CAAC,SAAS,OAAO,MAAM,OAAO,YAAY,KAAK,GAAG,KAAI,EAAG,SAAS,CAAC;AAErE,QAAM,WAAW,IAAI,IACnB,UAAU,IAAI,CAAC,SAAS,KAAK,GAAG,KAAI,EAAG,YAAW,CAAE,CAAC;AAEvD,QAAM,OAAO,oBAAI,IAAG;AACpB,QAAM,eAAe,CACnB,MACA,QACA,MACA,WACQ;AACR,UAAM,aAAa,mCAAmC,MAAM;AAC5D,QAAI,CAAC,cAAc,SAAS,IAAI,WAAW,YAAW,CAAE,GAAG;AACzD;IACF;AACA,UAAM,MAAmC;MACvC,WAAW,KAAK,GAAG,KAAI;MACvB,WAAW;MACX;MACA;MACA,eAAe,KAAK;MACpB,iBAAiB,WAAW,KAAK,MAAM;MACvC,4BACE,WAAW,YAAW,MAAO;;AAEjC,SAAK,IACH,GAAG,IAAI,SAAS,KAAK,IAAI,SAAS,KAAK,IAAI,IAAI,KAAK,IAAI,MAAM,IAC9D,GAAG;EAEP;AACA,aAAW,QAAQ,WAAW;AAC5B,iBAAa,MAAM,KAAK,QAAQ,UAAU,QAAQ;AAClD,iBAAa,MAAM,KAAK,YAAY,cAAc,YAAY;AAC9D,eAAW,cAAc,KAAK,gBAAgB,CAAA,GAAI;AAGhD,UAAI,OAAO,eAAe,YAAY,eAAe,MAAM;AACzD;MACF;AACA,YAAM,mBAAmB;AACzB,mBACE,MACA,iBAAiB,IACjB,OAAO,iBAAiB,SAAS,WAC7B,iBAAiB,OACjB,WACJ,YAAY;IAEhB;EACF;AACA,QAAM,SAAS,CAAC,GAAG,KAAK,OAAM,CAAE,EAAE,KAChC,CAAC,MAAM,UACL,KAAK,UAAU,cAAc,MAAM,SAAS,KAC5C,KAAK,UAAU,cAAc,MAAM,SAAS,KAC5C,KAAK,KAAK,cAAc,MAAM,IAAI,KAClC,KAAK,OAAO,cAAc,MAAM,MAAM,CAAC;AAE3C,QAAM,iBAAiB,OAAO,OAAO,CAAC,QAAQ,IAAI,eAAe;AACjE,SAAO;IACL,QAAQ,OAAO,OAAO,CAAC,QAAQ,CAAC,IAAI,eAAe;IACnD,iBAAiB;IACjB,6BAA6B,OAAO,OAClC,CAAC,QAAQ,IAAI,0BAA0B;;AAG7C;AAGM,SAAU,kCACd,UAA4C;AAE5C,QAAM,UAAU,oBAAI,IAAG;AACvB,aAAW,aAAa,CAAC,GAAG,SAAS,QAAQ,GAAG,SAAS,eAAe,GAAG;AACzE,QAAI,UAAU;AAA4B;AAC1C,UAAM,SAAS,UAAU,UAAU,KAAI;AACvC,UAAM,MAAM,OAAO,YAAW;AAC9B,QAAI,CAAC,QAAQ,IAAI,GAAG;AAAG,cAAQ,IAAI,KAAK,MAAM;EAChD;AACA,SAAO,CAAC,GAAG,QAAQ,OAAM,CAAE,EAAE,KAAK,CAAC,MAAM,UAAU,KAAK,cAAc,KAAK,CAAC;AAC9E;AAqCM,SAAU,mCACd,OACA,YACA,UAAmC;AAEnC,QAAM,YAAY,MAAM,OACtB,CAAC,SAAS,OAAO,MAAM,OAAO,YAAY,KAAK,GAAG,KAAI,EAAG,SAAS,CAAC;AAErE,QAAM,eAAe,IAAI,IACvB,UAAU,IAAI,CAAC,SAAS,CAAC,KAAK,GAAG,KAAI,EAAG,YAAW,GAAI,KAAK,GAAG,KAAI,CAAE,CAAC,CAAC;AAEzE,QAAM,WAAW,oCAAoC,WAAW,UAAU;AAC1E,QAAM,aAAa,kCAAkC,QAAQ;AAC7D,aAAW,MAAM;AAAY,iBAAa,IAAI,GAAG,YAAW,GAAI,EAAE;AAClE,QAAM,aAAa,UAAU,IAAI,CAAC,SAAQ;AACxC,UAAM,SAAS,+BAA+B,KAAK,MAAM;AACzD,UAAM,UAAU,+BAA+B,KAAK,UAAU;AAC9D,UAAM,gBAAgB,KAAK,gBAAgB,CAAA,GAAI,QAAQ,CAAC,kBAAiB;AACvE,UAAI,OAAO,kBAAkB,YAAY,kBAAkB;AACzD,eAAO,CAAA;AACT,YAAM,aAAa;AACnB,YAAM,SAAS,+BAA+B,WAAW,EAAE;AAC3D,UAAI,CAAC;AAAQ,eAAO,CAAA;AACpB,aAAO;QACL;UACE,IAAI,aAAa,IAAI,OAAO,YAAW,CAAE;UACzC,MACE,OAAO,WAAW,SAAS,WAAW,WAAW,OAAO;;;IAGhE,CAAC;AACD,WAAO;MACL,IAAI,KAAK,GAAG,KAAI;MAChB,GAAI,SAAS,EAAE,QAAQ,aAAa,IAAI,OAAO,YAAW,CAAE,EAAE,IAAK,CAAA;MACnE,GAAI,UACA,EAAE,YAAY,aAAa,IAAI,QAAQ,YAAW,CAAE,EAAE,IACtD,CAAA;MACJ;;EAEJ,CAAC;AACD,SAAO;IACL,OAAO,kBAAkB,UACvB,CAAC,GAAG,YAAY,GAAG,WAAW,IAAI,CAAC,QAAQ,EAAE,GAAE,EAAG,CAAC,GACnD,QAAQ;IAEV,SAAS;MACP,GAAG,UAAU,IAAI,CAAC,UAAU;QAC1B,IAAI,KAAK,GAAG,KAAI;QAChB,OAAO,KAAK;QACZ,QAAQ,KAAK;QACb;MACF,GAAG,WAAW,IAAI,CAAC,QAAQ;QACzB;QACA,OAAO,aAAa,EAAE;QACtB,QAAQ;QACR;;IAEJ,cAAc,IAAI,IAAI,WAAW,IAAI,CAAC,OAAO,GAAG,YAAW,CAAE,CAAC;IAC9D;;AAEJ;",
+  "names": []
+}