@unbrained/pm-cli 2026.7.17 → 2026.7.18

package/dist/cli-bundle/chunks/chunk-YQCWK2MB.js.map

@@ -1 +0,0 @@
-{"version":3,"sources":["../../../../../../../../sdk/relationships.ts","../../../../../../../../sdk/relationship-context.ts","../../../../../../../../sdk/dependencies.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/** 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  #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 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/relationship-context\n *\n * Assembles one explainable, cursorable, token-bounded relationship context\n * packet for agents, custom tools, and presentation-layer adapters.\n */\nimport {\n  createQueryFingerprint,\n  encodeQueryCursor,\n  resolveQueryCursorStart,\n} from \"./pagination.js\";\nimport {\n  RelationshipGraph,\n  RelationshipKindRegistry,\n  createRelationshipKindRegistry,\n  type RelationshipEdge,\n  type RelationshipTraversalDirection,\n} from \"./relationships.js\";\n\n/** Caller-owned compact node details joined into graph context. */\nexport interface RelationshipContextNodeDetails {\n  /** Stable graph node identifier. */\n  id: string;\n  /** Optional display title. */\n  title?: string;\n  /** Optional lifecycle status. */\n  status?: string;\n  /** Optional evidence pointers such as files, tests, or history ids. */\n  evidence?: readonly string[];\n}\n\n/** One selected graph-context node with explainable inclusion. */\nexport interface RelationshipContextNode extends RelationshipContextNodeDetails {\n  /** Shortest bounded distance from the root. */\n  distance: number;\n  /** Concise deterministic reasons the node was selected. */\n  reasons: string[];\n}\n\n/** Controls for bounded graph-context assembly. */\nexport interface RelationshipContextOptions {\n  /** Traversal direction relative to each visited node. */\n  direction?: RelationshipTraversalDirection;\n  /** Optional registered kind filter. */\n  kinds?: readonly string[];\n  /** Maximum traversal depth. */\n  maxDepth?: number;\n  /** Maximum nodes returned in this page. */\n  nodeLimit?: number;\n  /** Maximum edges returned in this page. */\n  edgeLimit?: number;\n  /** Maximum estimated output tokens charged to rows and edges. */\n  tokenBudget?: number;\n  /** Opaque continuation from an equivalent query. */\n  cursor?: string;\n  /** Registry used to explain custom relationship semantics. */\n  registry?: RelationshipKindRegistry;\n  /** Abort signal checked during traversal. */\n  signal?: AbortSignal;\n}\n\n/** Explainable graph context packet. */\nexport interface RelationshipContextResult {\n  /** Root node details. */\n  root: RelationshipContextNodeDetails;\n  /** Bounded related-node page. */\n  nodes: RelationshipContextNode[];\n  /** Bounded edges whose endpoints are present in the packet. */\n  edges: RelationshipEdge[];\n  /** Root evidence pointers promoted for immediate consumption. */\n  evidence: string[];\n  /** Completeness, continuation, and cost envelope. */\n  meta: {\n    exact: true;\n    truncated: boolean;\n    nodeLimit: number;\n    edgeLimit: number;\n    tokenBudget: number;\n    usedTokens: number;\n    visitedNodes: number;\n    inspectedEdges: number;\n    omittedNodes: number;\n    omittedEdges: number;\n    nextCursor?: string;\n  };\n}\n\ninterface DiscoveredNode {\n  id: string;\n  distance: number;\n}\n\nconst tokenEncoder = new TextEncoder();\n\nfunction positiveInteger(\n  value: number | undefined,\n  fallback: number,\n  field: string,\n): number {\n  const resolved = value ?? fallback;\n  if (!Number.isInteger(resolved) || resolved < 1)\n    throw new TypeError(`Relationship context ${field} must be positive`);\n  return resolved;\n}\n\nfunction estimateTokens(value: unknown): number {\n  return Math.max(\n    1,\n    Math.ceil(tokenEncoder.encode(JSON.stringify(value)).byteLength / 4),\n  );\n}\n\nfunction explainDirectEdge(\n  edge: RelationshipEdge,\n  root: string,\n  node: string,\n  registry: RelationshipKindRegistry,\n): string {\n  const definition = registry.require(edge.kind);\n  if (definition.ordering) {\n    // Legacy and JSON-parsed definitions may predate explicit precedence.\n    const sourceFirst =\n      (definition.precedence ?? \"source_before_target\") ===\n      \"source_before_target\";\n    const before = sourceFirst ? edge.source : edge.target;\n    return node === before ? \"prerequisite\" : \"dependent\";\n  }\n  if (definition.hierarchy) {\n    // Legacy and JSON-parsed definitions may predate explicit hierarchy direction.\n    const sourceIsParent =\n      (definition.hierarchyDirection ?? \"source_parent\") === \"source_parent\";\n    const parent = sourceIsParent ? edge.source : edge.target;\n    return node === parent ? \"ancestor\" : \"descendant\";\n  }\n  if (edge.kind === \"discovered_from\" || edge.kind === \"incident_from\")\n    return \"provenance\";\n  return \"related\";\n}\n\nfunction directReasons(\n  rootEdges: readonly RelationshipEdge[],\n  root: string,\n  node: string,\n  registry: RelationshipKindRegistry,\n): string[] {\n  const reasons = rootEdges\n    .filter(\n      (edge) =>\n        (edge.source === root && edge.target === node) ||\n        (edge.target === root && edge.source === node),\n    )\n    .map((edge) => explainDirectEdge(edge, root, node, registry));\n  return [...new Set(reasons)].sort();\n}\n\nfunction discoverNodes(\n  graph: RelationshipGraph,\n  root: string,\n  options: RelationshipContextOptions,\n): {\n  rows: DiscoveredNode[];\n  visitedNodes: number;\n  inspectedEdges: number;\n  depthTruncated: boolean;\n} {\n  const direction = options.direction ?? \"both\";\n  const maxDepth = options.maxDepth ?? 3;\n  if (!Number.isInteger(maxDepth) || maxDepth < 0)\n    throw new TypeError(\"Relationship context maxDepth must be non-negative\");\n  const seen = new Set([root]);\n  const queue = [{ id: root, distance: 0 }];\n  const rows: DiscoveredNode[] = [];\n  let inspectedEdges = 0;\n  let depthTruncated = false;\n  for (let index = 0; index < queue.length; index += 1) {\n    options.signal?.throwIfAborted();\n    const current = queue[index]!;\n    if (current.distance >= maxDepth && depthTruncated) continue;\n    const adjacent = graph.adjacency(current.id, {\n      direction,\n      kinds: options.kinds,\n      signal: options.signal,\n    });\n    inspectedEdges += adjacent.meta.inspectedEdges;\n    if (current.distance >= maxDepth) {\n      if (adjacent.value.some((id) => !seen.has(id))) depthTruncated = true;\n      continue;\n    }\n    for (const id of adjacent.value) {\n      if (seen.has(id)) continue;\n      seen.add(id);\n      const row = { id, distance: current.distance + 1 };\n      rows.push(row);\n      queue.push(row);\n    }\n  }\n  rows.sort(\n    (left, right) =>\n      left.distance - right.distance || left.id.localeCompare(right.id),\n  );\n  return {\n    rows,\n    visitedNodes: queue.length,\n    inspectedEdges,\n    depthTruncated,\n  };\n}\n\nfunction selectContextNodes(params: {\n  candidates: readonly DiscoveredNode[];\n  details: ReadonlyMap<string, RelationshipContextNodeDetails>;\n  graph: RelationshipGraph;\n  rootId: string;\n  registry: RelationshipKindRegistry;\n  nodeLimit: number;\n  tokenBudget: number;\n  initialTokens: number;\n}): { nodes: RelationshipContextNode[]; usedTokens: number } {\n  const nodes: RelationshipContextNode[] = [];\n  let usedTokens = params.initialTokens;\n  const rootEdges = params.graph.incidentEdges(params.rootId);\n  for (const candidate of params.candidates) {\n    if (nodes.length >= params.nodeLimit) break;\n    const node: RelationshipContextNode = {\n      ...(params.details.get(candidate.id) ?? { id: candidate.id }),\n      distance: candidate.distance,\n      reasons:\n        candidate.distance === 1\n          ? directReasons(\n              rootEdges,\n              params.rootId,\n              candidate.id,\n              params.registry,\n            )\n          : [`reachable at depth ${candidate.distance}`],\n    };\n    const cost = estimateTokens(node);\n    if (usedTokens + cost > params.tokenBudget) break;\n    nodes.push(node);\n    usedTokens += cost;\n  }\n  if (params.candidates.length > 0 && nodes.length === 0)\n    throw new TypeError(\"Relationship context tokenBudget cannot fit one node\");\n  return { nodes, usedTokens };\n}\n\nfunction selectContextEdges(params: {\n  graph: RelationshipGraph;\n  included: ReadonlySet<string>;\n  edgeLimit: number;\n  tokenBudget: number;\n  initialTokens: number;\n}): {\n  edges: RelationshipEdge[];\n  usedTokens: number;\n  candidateCount: number;\n} {\n  const candidates = params.graph\n    .edges()\n    .filter(\n      (edge) =>\n        params.included.has(edge.source) && params.included.has(edge.target),\n    );\n  const edges: RelationshipEdge[] = [];\n  let usedTokens = params.initialTokens;\n  for (const edge of candidates) {\n    if (edges.length >= params.edgeLimit) break;\n    const cost = estimateTokens(edge);\n    if (usedTokens + cost > params.tokenBudget) break;\n    edges.push(edge);\n    usedTokens += cost;\n  }\n  return { edges, usedTokens, candidateCount: candidates.length };\n}\n\n/** Build one deterministic bounded graph-context packet with continuation. */\nexport function buildRelationshipContext(\n  graph: RelationshipGraph,\n  rootId: string,\n  details: readonly RelationshipContextNodeDetails[],\n  options: RelationshipContextOptions = {},\n): RelationshipContextResult {\n  if (!graph.nodes().includes(rootId))\n    throw new TypeError(`Relationship node not found: ${rootId}`);\n  const nodeLimit = positiveInteger(options.nodeLimit, 20, \"nodeLimit\");\n  const edgeLimit = positiveInteger(options.edgeLimit, 40, \"edgeLimit\");\n  const tokenBudget = positiveInteger(options.tokenBudget, 1200, \"tokenBudget\");\n  const registry = options.registry ?? createRelationshipKindRegistry();\n  const byId = new Map(details.map((detail) => [detail.id, detail]));\n  const rootDetails: RelationshipContextNodeDetails = byId.get(rootId) ?? {\n    id: rootId,\n  };\n  const { evidence: rootEvidence = [], ...root } = rootDetails;\n  const evidence = [...rootEvidence];\n  const discovery = discoverNodes(graph, rootId, options);\n  const fingerprint = createQueryFingerprint(\"relationship-context\", {\n    rootId,\n    direction: options.direction ?? \"both\",\n    kinds: [...(options.kinds ?? [])].sort(),\n    maxDepth: options.maxDepth ?? 3,\n  });\n  const pageStart = resolveQueryCursorStart(\n    discovery.rows,\n    options.cursor,\n    fingerprint,\n    ({ id }) => id,\n  );\n  const candidates = discovery.rows.slice(pageStart);\n  const initialTokens = estimateTokens(root) + estimateTokens(evidence);\n  if (initialTokens > tokenBudget)\n    throw new TypeError(\n      \"Relationship context tokenBudget cannot fit root and evidence\",\n    );\n  const nodeSelection = selectContextNodes({\n    candidates,\n    details: byId,\n    graph,\n    rootId,\n    registry,\n    nodeLimit,\n    tokenBudget,\n    initialTokens,\n  });\n  const { nodes } = nodeSelection;\n\n  const included = new Set([rootId, ...nodes.map(({ id }) => id)]);\n  const edgeSelection = selectContextEdges({\n    graph,\n    included,\n    edgeLimit,\n    tokenBudget,\n    initialTokens: nodeSelection.usedTokens,\n  });\n  const { edges, usedTokens } = edgeSelection;\n\n  const consumed = pageStart + nodes.length;\n  const hasMoreNodes = consumed < discovery.rows.length;\n  const lastNode = nodes.at(-1);\n  const omittedEdges = edgeSelection.candidateCount - edges.length;\n  const truncated =\n    discovery.depthTruncated || hasMoreNodes || omittedEdges > 0;\n  return {\n    root,\n    nodes,\n    edges,\n    evidence,\n    meta: {\n      exact: true,\n      truncated,\n      nodeLimit,\n      edgeLimit,\n      tokenBudget,\n      usedTokens,\n      visitedNodes: discovery.visitedNodes,\n      inspectedEdges: discovery.inspectedEdges,\n      omittedNodes: discovery.rows.length - consumed,\n      omittedEdges,\n      ...(hasMoreNodes && lastNode\n        ? {\n            nextCursor: encodeQueryCursor(\n              fingerprint,\n              lastNode.id,\n              consumed - 1,\n            ),\n          }\n        : {}),\n    },\n  };\n}\n","/**\n * @module sdk/dependencies\n *\n * Implements the pm deps command surface and its agent-facing runtime behavior.\n */\nimport { getActiveExtensionRegistrations } from \"../core/extensions/index.js\";\nimport { pathExists } from \"../core/fs/fs-utils.js\";\nimport { resolveItemTypeRegistry } from \"../core/item/type-registry.js\";\nimport { isTerminalStatus } from \"../core/item/status.js\";\nimport { resolveRuntimeStatusRegistry } from \"../core/schema/runtime-schema.js\";\nimport { EXIT_CODE } from \"../core/shared/constants.js\";\nimport type { GlobalOptions } from \"../core/shared/command-types.js\";\nimport { PmCliError } from \"../core/shared/errors.js\";\nimport { listAllItemMetadataLight } from \"../core/store/item-store.js\";\nimport { getSettingsPath, resolvePmRoot } from \"../core/store/paths.js\";\nimport { readSettings } from \"../core/store/settings.js\";\nimport type {\n  Dependency,\n  ItemMetadata,\n  ItemStatus,\n  ItemType,\n} from \"../types/index.js\";\nimport {\n  buildRelationshipContext,\n  type RelationshipContextResult,\n} from \"./relationship-context.js\";\nimport { RelationshipGraph } from \"./relationships.js\";\n\n/** Supported values accepted by the deps format contract. */\nexport const DEPS_FORMAT_VALUES = [\"tree\", \"graph\", \"context\"] as const;\n/** Restricts deps format values accepted by command, SDK, and storage contracts. */\nexport type DepsFormat = (typeof DEPS_FORMAT_VALUES)[number];\n/** Supported values accepted by the deps collapse contract. */\nexport const DEPS_COLLAPSE_VALUES = [\"none\", \"repeated\"] as const;\n/** Restricts deps collapse mode values accepted by command, SDK, and storage contracts. */\nexport type DepsCollapseMode = (typeof DEPS_COLLAPSE_VALUES)[number];\n\n/** Documents the deps command options payload exchanged by command, SDK, and package integrations. */\nexport interface DepsCommandOptions {\n  /** Value that configures or reports format for this contract. */\n  format?: string;\n  /** Value that configures or reports max depth for this contract. */\n  maxDepth?: string | number;\n  /** Value that configures or reports collapse for this contract. */\n  collapse?: string;\n  /** Value that configures or reports summary for this contract. */\n  summary?: boolean;\n  /** Maximum graph-context nodes returned. */\n  nodeLimit?: string | number;\n  /** Maximum graph-context edges returned. */\n  edgeLimit?: string | number;\n  /** Maximum estimated graph-context output tokens. */\n  tokenBudget?: string | number;\n  /** Opaque continuation cursor for graph-context output. */\n  cursor?: string;\n}\n\ninterface IndexedItem {\n  id: string;\n  title: string;\n  type: ItemType;\n  status: ItemStatus;\n  dependencies: IndexedDependency[];\n}\n\ninterface IndexedDependency {\n  id: string;\n  kind: string;\n}\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(target: unknown): string | undefined {\n  if (typeof target !== \"string\") return undefined;\n  const normalized = target.trim();\n  if (!normalized || [\"none\", \"null\", \"n/a\", \"na\"].includes(normalized.toLowerCase())) 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\" ? undefined : 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 knownIds = new Set(items.map((item) => item.id.trim().toLowerCase()));\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,\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 items) {\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. */\nfunction 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/** Documents the deps tree node payload exchanged by command, SDK, and package integrations. */\nexport interface DepsTreeNode {\n  /** Stable identifier used to reference this record across commands and storage. */\n  id: string;\n  /** Value that configures or reports title for this contract. */\n  title?: string;\n  /** Schema type that determines the shape and validation rules for this value. */\n  type?: ItemType;\n  /** Lifecycle state reported for status. */\n  status?: ItemStatus;\n  /** Value that configures or reports via for this contract. */\n  via?: string;\n  /** Value that configures or reports missing for this contract. */\n  missing: boolean;\n  /** Value that configures or reports cycle for this contract. */\n  cycle: boolean;\n  /** Value that configures or reports truncated for this contract. */\n  truncated?: boolean;\n  /** Value that configures or reports collapsed for this contract. */\n  collapsed?: boolean;\n  /** Value that configures or reports dependencies for this contract. */\n  dependencies: DepsTreeNode[];\n}\n\n/** Documents the deps graph node payload exchanged by command, SDK, and package integrations. */\nexport interface DepsGraphNode {\n  /** Stable identifier used to reference this record across commands and storage. */\n  id: string;\n  /** Value that configures or reports title for this contract. */\n  title?: string;\n  /** Schema type that determines the shape and validation rules for this value. */\n  type?: ItemType;\n  /** Lifecycle state reported for status. */\n  status?: ItemStatus;\n  /** Value that configures or reports missing for this contract. */\n  missing: boolean;\n}\n\n/** Documents the deps graph edge payload exchanged by command, SDK, and package integrations. */\nexport interface DepsGraphEdge {\n  /** Value that configures or reports from for this contract. */\n  from: string;\n  /** Value that configures or reports to for this contract. */\n  to: string;\n  /** Value that configures or reports kind for this contract. */\n  kind: string;\n}\n\n/** Documents the deps graph result payload exchanged by command, SDK, and package integrations. */\nexport interface DepsGraphResult {\n  /** Value that configures or reports root id for this contract. */\n  root_id: string;\n  /** Value that configures or reports nodes for this contract. */\n  nodes: DepsGraphNode[];\n  /** Value that configures or reports edges for this contract. */\n  edges: DepsGraphEdge[];\n  /** Value that configures or reports missing ids for this contract. */\n  missing_ids: string[];\n}\n\n/** Documents the deps result payload exchanged by command, SDK, and package integrations. */\nexport interface DepsResult {\n  /** Stable identifier used to reference this record across commands and storage. */\n  id: string;\n  /** Value that configures or reports format for this contract. */\n  format: DepsFormat;\n  /** Number of node entries represented by this result. */\n  node_count: number;\n  /** Number of edge entries represented by this result. */\n  edge_count: number;\n  /** Number of missing entries represented by this result. */\n  missing_count: number;\n  /** Value that configures or reports tree for this contract. */\n  tree?: DepsTreeNode;\n  /** Value that configures or reports graph for this contract. */\n  graph?: DepsGraphResult;\n  /** Explainable bounded graph-context projection. */\n  context?: RelationshipContextResult;\n}\n\nfunction parseFormat(raw: string | undefined): DepsFormat {\n  const candidate = raw?.trim().toLowerCase() ?? \"tree\";\n  if ((DEPS_FORMAT_VALUES as readonly string[]).includes(candidate)) {\n    return candidate as DepsFormat;\n  }\n  throw new PmCliError(\n    `Invalid --format value \"${raw}\". Use \"tree\", \"graph\", or \"context\".`,\n    EXIT_CODE.USAGE,\n  );\n}\n\nfunction parsePositiveInteger(raw: string | number | undefined, flag: string): number | undefined {\n  if (raw === undefined) return undefined;\n  const value = typeof raw === \"number\" ? raw : Number(raw.trim());\n  if (!Number.isInteger(value) || value < 1)\n    throw new PmCliError(`Invalid --${flag} value \"${raw}\". Use a positive integer.`, EXIT_CODE.USAGE);\n  return value;\n}\n\nfunction parseMaxDepth(raw: string | number | undefined): number | undefined {\n  if (raw === undefined) {\n    return undefined;\n  }\n  const normalized = typeof raw === \"number\" ? raw : Number(raw.trim());\n  if (!Number.isInteger(normalized) || normalized < 0) {\n    throw new PmCliError(\n      `Invalid --max-depth value \"${raw}\". Use a non-negative integer.`,\n      EXIT_CODE.USAGE,\n    );\n  }\n  return normalized;\n}\n\nfunction parseCollapse(raw: string | undefined): DepsCollapseMode {\n  const candidate = raw?.trim().toLowerCase() ?? \"none\";\n  if ((DEPS_COLLAPSE_VALUES as readonly string[]).includes(candidate)) {\n    return candidate as DepsCollapseMode;\n  }\n  throw new PmCliError(\n    `Invalid --collapse value \"${raw}\". Use \"none\" or \"repeated\".`,\n    EXIT_CODE.USAGE,\n  );\n}\n\nfunction normalizeDependencies(\n  dependencies: Dependency[] | undefined,\n): IndexedDependency[] {\n  if (!dependencies || dependencies.length === 0) {\n    return [];\n  }\n  const sorted = dependencies.map(({ id, kind }) => ({\n    id: id.trim(),\n    kind: kind.trim().toLowerCase(),\n  })).sort((left, right) => {\n    const byKind = left.kind.localeCompare(right.kind);\n    if (byKind !== 0) return byKind;\n    return left.id.localeCompare(right.id);\n  });\n  const deduped = new Map<string, IndexedDependency>();\n  for (const dependency of sorted) {\n    const key = `${dependency.kind.toLowerCase()}::${dependency.id.toLowerCase()}`;\n    if (!deduped.has(key)) {\n      deduped.set(key, { id: dependency.id, kind: dependency.kind });\n    }\n  }\n  return [...deduped.values()];\n}\n\nfunction toIndexedItem(item: ItemMetadata): IndexedItem {\n  return {\n    id: item.id,\n    title: item.title,\n    type: item.type,\n    status: item.status,\n    dependencies: normalizeDependencies(item.dependencies),\n  };\n}\n\nfunction toTreeNode(\n  id: string,\n  index: Map<string, IndexedItem>,\n  lineage: Set<string>,\n  maxDepth: number | undefined,\n  collapse: DepsCollapseMode,\n  expanded: Set<string>,\n  depth = 0,\n  via?: string,\n): DepsTreeNode {\n  const lookupId = id.trim().toLowerCase();\n  const item = index.get(lookupId);\n  const baseNode: DepsTreeNode = {\n    id: item?.id ?? id,\n    title: item?.title,\n    type: item?.type,\n    status: item?.status,\n    via,\n    missing: !item,\n    cycle: lineage.has(lookupId),\n    dependencies: [],\n  };\n  if (!item || baseNode.cycle) {\n    return baseNode;\n  }\n  if (maxDepth !== undefined && depth >= maxDepth) {\n    if (item.dependencies.length > 0) {\n      baseNode.truncated = true;\n    }\n    return baseNode;\n  }\n  if (collapse === \"repeated\" && expanded.has(lookupId)) {\n    baseNode.collapsed = true;\n    return baseNode;\n  }\n  if (collapse === \"repeated\") {\n    expanded.add(lookupId);\n  }\n  const nextLineage = new Set(lineage);\n  nextLineage.add(lookupId);\n  baseNode.dependencies = item.dependencies.map((dependency) =>\n    toTreeNode(\n      dependency.id,\n      index,\n      nextLineage,\n      maxDepth,\n      collapse,\n      expanded,\n      depth + 1,\n      dependency.kind,\n    ),\n  );\n  return baseNode;\n}\n\nfunction mergeGraphNode(\n  existing: DepsGraphNode | undefined,\n  candidate: DepsGraphNode,\n): DepsGraphNode {\n  if (!existing) {\n    return candidate;\n  }\n  /* c8 ignore start -- defensive: mixed missing/non-missing duplicates only occur in malformed synthetic trees. */\n  if (existing.missing && !candidate.missing) return candidate;\n  /* c8 ignore stop */\n  return {\n    ...existing,\n    title: existing.title ?? candidate.title,\n    type: existing.type ?? candidate.type,\n    status: existing.status ?? candidate.status,\n  };\n}\n\nfunction toGraph(root: DepsTreeNode): DepsGraphResult {\n  const nodesById = new Map<string, DepsGraphNode>();\n  const edgesByKey = new Map<string, DepsGraphEdge>();\n\n  const visit = (node: DepsTreeNode): void => {\n    nodesById.set(\n      node.id,\n      mergeGraphNode(nodesById.get(node.id), {\n        id: node.id,\n        title: node.title,\n        type: node.type,\n        status: node.status,\n        missing: node.missing,\n      }),\n    );\n    for (const child of node.dependencies) {\n      nodesById.set(\n        child.id,\n        mergeGraphNode(nodesById.get(child.id), {\n          id: child.id,\n          title: child.title,\n          type: child.type,\n          status: child.status,\n          missing: child.missing,\n        }),\n      );\n      /* c8 ignore start -- legacy malformed dependency payloads may omit kind/via. */\n      const relationKind = child.via ?? \"related\";\n      const edgeKey = `${node.id}::${child.id}::${relationKind}`;\n      if (!edgesByKey.has(edgeKey)) {\n        edgesByKey.set(edgeKey, {\n          from: node.id,\n          to: child.id,\n          kind: relationKind,\n        });\n      }\n      /* c8 ignore stop */\n      if (!child.cycle) {\n        visit(child);\n      }\n    }\n  };\n\n  visit(root);\n\n  const nodes = [...nodesById.values()].sort((left, right) =>\n    left.id.localeCompare(right.id),\n  );\n  const edges = [...edgesByKey.values()].sort((left, right) => {\n    const byFrom = left.from.localeCompare(right.from);\n    if (byFrom !== 0) return byFrom;\n    const byTo = left.to.localeCompare(right.to);\n    if (byTo !== 0) return byTo;\n    return left.kind.localeCompare(right.kind);\n  });\n  const missingIds = nodes\n    .filter((node) => node.missing)\n    .map((node) => node.id);\n  return {\n    root_id: root.id,\n    nodes,\n    edges,\n    missing_ids: missingIds,\n  };\n}\n\n/** Count a dependency result without allocating its potentially exponential tree payload. */\nfunction countDependencyGraph(\n  rootId: string,\n  index: Map<string, IndexedItem>,\n  maxDepth: number | undefined,\n): Pick<DepsResult, \"node_count\" | \"edge_count\" | \"missing_count\"> {\n  const nodeIds = new Set<string>();\n  const edgeKeys = new Set<string>();\n  const missingIds = new Set<string>();\n  const expanded = new Set<string>();\n  const pending = [{ id: rootId, depth: 0 }];\n  let pendingIndex = 0;\n  while (pendingIndex < pending.length) {\n    const current = pending[pendingIndex++]!;\n    const lookupId = current.id.trim().toLowerCase();\n    nodeIds.add(lookupId);\n    const item = index.get(lookupId);\n    if (!item) {\n      missingIds.add(lookupId);\n      continue;\n    }\n    if (maxDepth !== undefined && current.depth >= maxDepth) {\n      continue;\n    }\n    if (expanded.has(lookupId)) {\n      continue;\n    }\n    expanded.add(lookupId);\n    for (const dependency of item.dependencies) {\n      edgeKeys.add(\n        `${lookupId}::${dependency.id.trim().toLowerCase()}::${dependency.kind}`,\n      );\n      pending.push({ id: dependency.id, depth: current.depth + 1 });\n    }\n  }\n  return {\n    node_count: nodeIds.size,\n    edge_count: edgeKeys.size,\n    missing_count: missingIds.size,\n  };\n}\n\n/** Build the SDK-backed bounded relationship-context projection for deps. */\nexport function buildDepsRelationshipContext(\n  rootId: string,\n  items: readonly ItemMetadata[],\n  options: Pick<DepsCommandOptions, \"maxDepth\" | \"nodeLimit\" | \"edgeLimit\" | \"tokenBudget\" | \"cursor\">,\n): RelationshipContextResult {\n  const maxDepth = parseMaxDepth(options.maxDepth);\n  const nodeLimit = parsePositiveInteger(options.nodeLimit, \"node-limit\");\n  const edgeLimit = parsePositiveInteger(options.edgeLimit, \"edge-limit\");\n  const tokenBudget = parsePositiveInteger(options.tokenBudget, \"token-budget\");\n  const canonicalIds = new Map(items.map((item) => [item.id.trim().toLowerCase(), item.id.trim()]));\n  const dangling = collectDanglingDependencyReferences(items);\n  const missingIds = collectMissingDependencyTargetIds(dangling);\n  const graphItems = items.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) return [];\n      const dependency = rawDependency as Partial<Dependency>;\n      const target = normalizeDependencyGraphTarget(dependency.id);\n      if (!target) return [];\n      return [{\n        id: canonicalIds.get(target.toLowerCase()) ?? target,\n        kind: typeof dependency.kind === \"string\" ? dependency.kind : \"related\",\n      }];\n    });\n    return {\n      id: item.id,\n      ...(parent ? { parent: canonicalIds.get(parent.toLowerCase()) ?? parent } : {}),\n      ...(blocker ? { blocked_by: canonicalIds.get(blocker.toLowerCase()) ?? blocker } : {}),\n      dependencies,\n    };\n  });\n  return buildRelationshipContext(\n    RelationshipGraph.fromItems([...graphItems, ...missingIds.map((id) => ({ id }))]),\n    rootId,\n    [\n      ...items.map((item) => ({ id: item.id, title: item.title, status: item.status })),\n      ...missingIds.map((id) => ({ id, title: `[missing] ${id}`, status: \"missing\" })),\n    ],\n    {\n      ...(maxDepth === undefined ? {} : { maxDepth }),\n      ...(nodeLimit === undefined ? {} : { nodeLimit }),\n      ...(edgeLimit === undefined ? {} : { edgeLimit }),\n      ...(tokenBudget === undefined ? {} : { tokenBudget }),\n      ...(options.cursor?.trim() ? { cursor: options.cursor.trim() } : {}),\n    },\n  );\n}\n\n/** Implements run deps for the public runtime surface of this module. */\nexport async function runDeps(\n  id: string,\n  options: DepsCommandOptions,\n  global: GlobalOptions,\n): Promise<DepsResult> {\n  const pmRoot = resolvePmRoot(process.cwd(), global.path);\n  if (!(await pathExists(getSettingsPath(pmRoot)))) {\n    throw new PmCliError(\n      `Tracker is not initialized at ${pmRoot}. Run pm init first.`,\n      EXIT_CODE.NOT_FOUND,\n    );\n  }\n  const format = parseFormat(options.format);\n  const maxDepth = parseMaxDepth(options.maxDepth);\n  const collapse = parseCollapse(options.collapse);\n  const summaryOnly = options.summary === true;\n  const settings = await readSettings(pmRoot);\n  const typeRegistry = resolveItemTypeRegistry(\n    settings,\n    getActiveExtensionRegistrations(),\n  );\n  const items = await listAllItemMetadataLight(\n    pmRoot,\n    settings.item_format,\n    typeRegistry.type_to_folder,\n    undefined,\n    settings.schema,\n  );\n  const statusRegistry = resolveRuntimeStatusRegistry(settings.schema);\n  const index = new Map(\n    items.map((item) => [item.id.trim().toLowerCase(), toIndexedItem(item)]),\n  );\n  const dangling = collectDanglingDependencyReferences(\n    items,\n    (status) => isTerminalStatus(status, statusRegistry),\n  );\n  for (const reference of [...dangling.active, ...dangling.legacy_terminal]) {\n    const holder = index.get(reference.holder_id.trim().toLowerCase());\n    const referenceKind = reference.kind.trim().toLowerCase();\n    if (\n      holder &&\n      !holder.dependencies.some(\n        (dependency) =>\n          dependency.id.trim().toLowerCase() === reference.target_id.trim().toLowerCase() &&\n          dependency.kind === referenceKind,\n      )\n    ) {\n      holder.dependencies.push({ id: reference.target_id, kind: referenceKind });\n    }\n  }\n  if (!index.has(id.trim().toLowerCase())) {\n    throw new PmCliError(`Item ${id} not found`, EXIT_CODE.NOT_FOUND);\n  }\n\n  if (format === \"context\") {\n    const canonicalId = index.get(id.trim().toLowerCase())!.id;\n    const context = buildDepsRelationshipContext(canonicalId, items, options);\n    return {\n      id: canonicalId,\n      format,\n      node_count: context.nodes.length + 1,\n      edge_count: context.edges.length,\n      missing_count: collectMissingDependencyTargetIds(dangling).length,\n      ...(summaryOnly ? {} : { context }),\n    };\n  }\n\n  if (summaryOnly) {\n    return {\n      id,\n      format,\n      ...countDependencyGraph(id, index, maxDepth),\n    };\n  }\n\n  const tree = toTreeNode(\n    id,\n    index,\n    new Set<string>(),\n    maxDepth,\n    collapse,\n    new Set<string>(),\n  );\n  const graph = toGraph(tree);\n  const baseResult = {\n    id,\n    format,\n    node_count: graph.nodes.length,\n    edge_count: graph.edges.length,\n    missing_count: graph.missing_ids.length,\n  };\n  if (format === \"tree\") {\n    return {\n      ...baseResult,\n      tree,\n    };\n  }\n  return {\n    ...baseResult,\n    graph,\n  };\n}\n"],"names":[],"mappings":";;;;;;;;;;;;;;;;;;;;;;;;AAkHA,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;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,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;;;AC5qBA,IAAM,eAAe,IAAI,YAAW;AAEpC,SAAS,gBACP,OACA,UACA,OAAa;AAEb,QAAM,WAAW,SAAS;AAC1B,MAAI,CAAC,OAAO,UAAU,QAAQ,KAAK,WAAW;AAC5C,UAAM,IAAI,UAAU,wBAAwB,KAAK,mBAAmB;AACtE,SAAO;AACT;AAEA,SAAS,eAAe,OAAc;AACpC,SAAO,KAAK,IACV,GACA,KAAK,KAAK,aAAa,OAAO,KAAK,UAAU,KAAK,CAAC,EAAE,aAAa,CAAC,CAAC;AAExE;AAEA,SAAS,kBACP,MACA,MACA,MACA,UAAkC;AAElC,QAAM,aAAa,SAAS,QAAQ,KAAK,IAAI;AAC7C,MAAI,WAAW,UAAU;AAEvB,UAAM,eACH,WAAW,cAAc,4BAC1B;AACF,UAAM,SAAS,cAAc,KAAK,SAAS,KAAK;AAChD,WAAO,SAAS,SAAS,iBAAiB;EAC5C;AACA,MAAI,WAAW,WAAW;AAExB,UAAM,kBACH,WAAW,sBAAsB,qBAAqB;AACzD,UAAM,SAAS,iBAAiB,KAAK,SAAS,KAAK;AACnD,WAAO,SAAS,SAAS,aAAa;EACxC;AACA,MAAI,KAAK,SAAS,qBAAqB,KAAK,SAAS;AACnD,WAAO;AACT,SAAO;AACT;AAEA,SAAS,cACP,WACA,MACA,MACA,UAAkC;AAElC,QAAM,UAAU,UACb,OACC,CAAC,SACE,KAAK,WAAW,QAAQ,KAAK,WAAW,QACxC,KAAK,WAAW,QAAQ,KAAK,WAAW,IAAK,EAEjD,IAAI,CAAC,SAAS,kBAAkB,MAAM,MAAM,MAAM,QAAQ,CAAC;AAC9D,SAAO,CAAC,GAAG,IAAI,IAAI,OAAO,CAAC,EAAE,KAAI;AACnC;AAEA,SAAS,cACP,OACA,MACA,SAAmC;AAOnC,QAAM,YAAY,QAAQ,aAAa;AACvC,QAAM,WAAW,QAAQ,YAAY;AACrC,MAAI,CAAC,OAAO,UAAU,QAAQ,KAAK,WAAW;AAC5C,UAAM,IAAI,UAAU,oDAAoD;AAC1E,QAAM,OAAO,oBAAI,IAAI,CAAC,IAAI,CAAC;AAC3B,QAAM,QAAQ,CAAC,EAAE,IAAI,MAAM,UAAU,EAAC,CAAE;AACxC,QAAM,OAAyB,CAAA;AAC/B,MAAI,iBAAiB;AACrB,MAAI,iBAAiB;AACrB,WAAS,QAAQ,GAAG,QAAQ,MAAM,QAAQ,SAAS,GAAG;AACpD,YAAQ,QAAQ,eAAc;AAC9B,UAAM,UAAU,MAAM,KAAK;AAC3B,QAAI,QAAQ,YAAY,YAAY;AAAgB;AACpD,UAAM,WAAW,MAAM,UAAU,QAAQ,IAAI;MAC3C;MACA,OAAO,QAAQ;MACf,QAAQ,QAAQ;KACjB;AACD,sBAAkB,SAAS,KAAK;AAChC,QAAI,QAAQ,YAAY,UAAU;AAChC,UAAI,SAAS,MAAM,KAAK,CAAC,OAAO,CAAC,KAAK,IAAI,EAAE,CAAC;AAAG,yBAAiB;AACjE;IACF;AACA,eAAW,MAAM,SAAS,OAAO;AAC/B,UAAI,KAAK,IAAI,EAAE;AAAG;AAClB,WAAK,IAAI,EAAE;AACX,YAAM,MAAM,EAAE,IAAI,UAAU,QAAQ,WAAW,EAAC;AAChD,WAAK,KAAK,GAAG;AACb,YAAM,KAAK,GAAG;IAChB;EACF;AACA,OAAK,KACH,CAAC,MAAM,UACL,KAAK,WAAW,MAAM,YAAY,KAAK,GAAG,cAAc,MAAM,EAAE,CAAC;AAErE,SAAO;IACL;IACA,cAAc,MAAM;IACpB;IACA;;AAEJ;AAEA,SAAS,mBAAmB,QAS3B;AACC,QAAM,QAAmC,CAAA;AACzC,MAAI,aAAa,OAAO;AACxB,QAAM,YAAY,OAAO,MAAM,cAAc,OAAO,MAAM;AAC1D,aAAW,aAAa,OAAO,YAAY;AACzC,QAAI,MAAM,UAAU,OAAO;AAAW;AACtC,UAAM,OAAgC;MACpC,GAAI,OAAO,QAAQ,IAAI,UAAU,EAAE,KAAK,EAAE,IAAI,UAAU,GAAE;MAC1D,UAAU,UAAU;MACpB,SACE,UAAU,aAAa,IACnB,cACE,WACA,OAAO,QACP,UAAU,IACV,OAAO,QAAQ,IAEjB,CAAC,sBAAsB,UAAU,QAAQ,EAAE;;AAEnD,UAAM,OAAO,eAAe,IAAI;AAChC,QAAI,aAAa,OAAO,OAAO;AAAa;AAC5C,UAAM,KAAK,IAAI;AACf,kBAAc;EAChB;AACA,MAAI,OAAO,WAAW,SAAS,KAAK,MAAM,WAAW;AACnD,UAAM,IAAI,UAAU,sDAAsD;AAC5E,SAAO,EAAE,OAAO,WAAU;AAC5B;AAEA,SAAS,mBAAmB,QAM3B;AAKC,QAAM,aAAa,OAAO,MACvB,MAAK,EACL,OACC,CAAC,SACC,OAAO,SAAS,IAAI,KAAK,MAAM,KAAK,OAAO,SAAS,IAAI,KAAK,MAAM,CAAC;AAE1E,QAAM,QAA4B,CAAA;AAClC,MAAI,aAAa,OAAO;AACxB,aAAW,QAAQ,YAAY;AAC7B,QAAI,MAAM,UAAU,OAAO;AAAW;AACtC,UAAM,OAAO,eAAe,IAAI;AAChC,QAAI,aAAa,OAAO,OAAO;AAAa;AAC5C,UAAM,KAAK,IAAI;AACf,kBAAc;EAChB;AACA,SAAO,EAAE,OAAO,YAAY,gBAAgB,WAAW,OAAM;AAC/D;AAGM,SAAU,yBACd,OACA,QACA,SACA,UAAsC,CAAA,GAAE;AAExC,MAAI,CAAC,MAAM,MAAK,EAAG,SAAS,MAAM;AAChC,UAAM,IAAI,UAAU,gCAAgC,MAAM,EAAE;AAC9D,QAAM,YAAY,gBAAgB,QAAQ,WAAW,IAAI,WAAW;AACpE,QAAM,YAAY,gBAAgB,QAAQ,WAAW,IAAI,WAAW;AACpE,QAAM,cAAc,gBAAgB,QAAQ,aAAa,MAAM,aAAa;AAC5E,QAAM,WAAW,QAAQ,YAAY,+BAA8B;AACnE,QAAM,OAAO,IAAI,IAAI,QAAQ,IAAI,CAAC,WAAW,CAAC,OAAO,IAAI,MAAM,CAAC,CAAC;AACjE,QAAM,cAA8C,KAAK,IAAI,MAAM,KAAK;IACtE,IAAI;;AAEN,QAAM,EAAE,UAAU,eAAe,CAAA,GAAI,GAAG,KAAI,IAAK;AACjD,QAAM,WAAW,CAAC,GAAG,YAAY;AACjC,QAAM,YAAY,cAAc,OAAO,QAAQ,OAAO;AACtD,QAAM,cAAc,uBAAuB,wBAAwB;IACjE;IACA,WAAW,QAAQ,aAAa;IAChC,OAAO,CAAC,GAAI,QAAQ,SAAS,CAAA,CAAG,EAAE,KAAI;IACtC,UAAU,QAAQ,YAAY;GAC/B;AACD,QAAM,YAAY,wBAChB,UAAU,MACV,QAAQ,QACR,aACA,CAAC,EAAE,GAAE,MAAO,EAAE;AAEhB,QAAM,aAAa,UAAU,KAAK,MAAM,SAAS;AACjD,QAAM,gBAAgB,eAAe,IAAI,IAAI,eAAe,QAAQ;AACpE,MAAI,gBAAgB;AAClB,UAAM,IAAI,UACR,+DAA+D;AAEnE,QAAM,gBAAgB,mBAAmB;IACvC;IACA,SAAS;IACT;IACA;IACA;IACA;IACA;IACA;GACD;AACD,QAAM,EAAE,MAAK,IAAK;AAElB,QAAM,WAAW,oBAAI,IAAI,CAAC,QAAQ,GAAG,MAAM,IAAI,CAAC,EAAE,GAAE,MAAO,EAAE,CAAC,CAAC;AAC/D,QAAM,gBAAgB,mBAAmB;IACvC;IACA;IACA;IACA;IACA,eAAe,cAAc;GAC9B;AACD,QAAM,EAAE,OAAO,WAAU,IAAK;AAE9B,QAAM,WAAW,YAAY,MAAM;AACnC,QAAM,eAAe,WAAW,UAAU,KAAK;AAC/C,QAAM,WAAW,MAAM,GAAG,EAAE;AAC5B,QAAM,eAAe,cAAc,iBAAiB,MAAM;AAC1D,QAAM,YACJ,UAAU,kBAAkB,gBAAgB,eAAe;AAC7D,SAAO;IACL;IACA;IACA;IACA;IACA,MAAM;MACJ,OAAO;MACP;MACA;MACA;MACA;MACA;MACA,cAAc,UAAU;MACxB,gBAAgB,UAAU;MAC1B,cAAc,UAAU,KAAK,SAAS;MACtC;MACA,GAAI,gBAAgB,WAChB;QACE,YAAY,kBACV,aACA,SAAS,IACT,WAAW,CAAC;UAGhB,CAAA;;;AAGV;;;ACnVO,IAAM,qBAAqB,CAAC,QAAQ,SAAS,SAAS;AAItD,IAAM,uBAAuB,CAAC,QAAQ,UAAU;AAmFvD,SAAS,mCAAmC,QAAe;AACzD,MAAI,OAAO,WAAW;AAAU,WAAO;AACvC,QAAM,aAAa,OAAO,KAAI;AAC9B,MAAI,CAAC,cAAc,CAAC,QAAQ,QAAQ,OAAO,IAAI,EAAE,SAAS,WAAW,YAAW,CAAE;AAAG,WAAO;AAC5F,SAAO;AACT;AAGA,SAAS,+BAA+B,QAAe;AACrD,QAAM,aAAa,mCAAmC,MAAM;AAC5D,SAAO,YAAY,YAAW,MAAO,sBAAsB,SAAY;AACzE;AASM,SAAU,oCACd,OACA,aAA8C,CAAC,WAC7C,WAAW,YAAY,WAAW,YAAU;AAE9C,QAAM,WAAW,IAAI,IAAI,MAAM,IAAI,CAAC,SAAS,KAAK,GAAG,KAAI,EAAG,YAAW,CAAE,CAAC;AAC1E,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;MAChB,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,OAAO;AACxB,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;AAGA,SAAS,kCACP,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;AAkFA,SAAS,YAAY,KAAuB;AAC1C,QAAM,YAAY,KAAK,KAAI,EAAG,YAAW,KAAM;AAC/C,MAAK,mBAAyC,SAAS,SAAS,GAAG;AACjE,WAAO;EACT;AACA,QAAM,IAAI,WACR,2BAA2B,GAAG,yCAC9B,UAAU,KAAK;AAEnB;AAEA,SAAS,qBAAqB,KAAkC,MAAY;AAC1E,MAAI,QAAQ;AAAW,WAAO;AAC9B,QAAM,QAAQ,OAAO,QAAQ,WAAW,MAAM,OAAO,IAAI,KAAI,CAAE;AAC/D,MAAI,CAAC,OAAO,UAAU,KAAK,KAAK,QAAQ;AACtC,UAAM,IAAI,WAAW,aAAa,IAAI,WAAW,GAAG,8BAA8B,UAAU,KAAK;AACnG,SAAO;AACT;AAEA,SAAS,cAAc,KAAgC;AACrD,MAAI,QAAQ,QAAW;AACrB,WAAO;EACT;AACA,QAAM,aAAa,OAAO,QAAQ,WAAW,MAAM,OAAO,IAAI,KAAI,CAAE;AACpE,MAAI,CAAC,OAAO,UAAU,UAAU,KAAK,aAAa,GAAG;AACnD,UAAM,IAAI,WACR,8BAA8B,GAAG,kCACjC,UAAU,KAAK;EAEnB;AACA,SAAO;AACT;AAEA,SAAS,cAAc,KAAuB;AAC5C,QAAM,YAAY,KAAK,KAAI,EAAG,YAAW,KAAM;AAC/C,MAAK,qBAA2C,SAAS,SAAS,GAAG;AACnE,WAAO;EACT;AACA,QAAM,IAAI,WACR,6BAA6B,GAAG,gCAChC,UAAU,KAAK;AAEnB;AAEA,SAAS,sBACP,cAAsC;AAEtC,MAAI,CAAC,gBAAgB,aAAa,WAAW,GAAG;AAC9C,WAAO,CAAA;EACT;AACA,QAAM,SAAS,aAAa,IAAI,CAAC,EAAE,IAAI,KAAI,OAAQ;IACjD,IAAI,GAAG,KAAI;IACX,MAAM,KAAK,KAAI,EAAG,YAAW;IAC7B,EAAE,KAAK,CAAC,MAAM,UAAS;AACvB,UAAM,SAAS,KAAK,KAAK,cAAc,MAAM,IAAI;AACjD,QAAI,WAAW;AAAG,aAAO;AACzB,WAAO,KAAK,GAAG,cAAc,MAAM,EAAE;EACvC,CAAC;AACD,QAAM,UAAU,oBAAI,IAAG;AACvB,aAAW,cAAc,QAAQ;AAC/B,UAAM,MAAM,GAAG,WAAW,KAAK,YAAW,CAAE,KAAK,WAAW,GAAG,YAAW,CAAE;AAC5E,QAAI,CAAC,QAAQ,IAAI,GAAG,GAAG;AACrB,cAAQ,IAAI,KAAK,EAAE,IAAI,WAAW,IAAI,MAAM,WAAW,KAAI,CAAE;IAC/D;EACF;AACA,SAAO,CAAC,GAAG,QAAQ,OAAM,CAAE;AAC7B;AAEA,SAAS,cAAc,MAAkB;AACvC,SAAO;IACL,IAAI,KAAK;IACT,OAAO,KAAK;IACZ,MAAM,KAAK;IACX,QAAQ,KAAK;IACb,cAAc,sBAAsB,KAAK,YAAY;;AAEzD;AAEA,SAAS,WACP,IACA,OACA,SACA,UACA,UACA,UACA,QAAQ,GACR,KAAY;AAEZ,QAAM,WAAW,GAAG,KAAI,EAAG,YAAW;AACtC,QAAM,OAAO,MAAM,IAAI,QAAQ;AAC/B,QAAM,WAAyB;IAC7B,IAAI,MAAM,MAAM;IAChB,OAAO,MAAM;IACb,MAAM,MAAM;IACZ,QAAQ,MAAM;IACd;IACA,SAAS,CAAC;IACV,OAAO,QAAQ,IAAI,QAAQ;IAC3B,cAAc,CAAA;;AAEhB,MAAI,CAAC,QAAQ,SAAS,OAAO;AAC3B,WAAO;EACT;AACA,MAAI,aAAa,UAAa,SAAS,UAAU;AAC/C,QAAI,KAAK,aAAa,SAAS,GAAG;AAChC,eAAS,YAAY;IACvB;AACA,WAAO;EACT;AACA,MAAI,aAAa,cAAc,SAAS,IAAI,QAAQ,GAAG;AACrD,aAAS,YAAY;AACrB,WAAO;EACT;AACA,MAAI,aAAa,YAAY;AAC3B,aAAS,IAAI,QAAQ;EACvB;AACA,QAAM,cAAc,IAAI,IAAI,OAAO;AACnC,cAAY,IAAI,QAAQ;AACxB,WAAS,eAAe,KAAK,aAAa,IAAI,CAAC,eAC7C,WACE,WAAW,IACX,OACA,aACA,UACA,UACA,UACA,QAAQ,GACR,WAAW,IAAI,CAChB;AAEH,SAAO;AACT;AAEA,SAAS,eACP,UACA,WAAwB;AAExB,MAAI,CAAC,UAAU;AACb,WAAO;EACT;AAEA,MAAI,SAAS,WAAW,CAAC,UAAU;AAAS,WAAO;AAEnD,SAAO;IACL,GAAG;IACH,OAAO,SAAS,SAAS,UAAU;IACnC,MAAM,SAAS,QAAQ,UAAU;IACjC,QAAQ,SAAS,UAAU,UAAU;;AAEzC;AAEA,SAAS,QAAQ,MAAkB;AACjC,QAAM,YAAY,oBAAI,IAAG;AACzB,QAAM,aAAa,oBAAI,IAAG;AAE1B,QAAM,QAAQ,CAAC,SAA4B;AACzC,cAAU,IACR,KAAK,IACL,eAAe,UAAU,IAAI,KAAK,EAAE,GAAG;MACrC,IAAI,KAAK;MACT,OAAO,KAAK;MACZ,MAAM,KAAK;MACX,QAAQ,KAAK;MACb,SAAS,KAAK;KACf,CAAC;AAEJ,eAAW,SAAS,KAAK,cAAc;AACrC,gBAAU,IACR,MAAM,IACN,eAAe,UAAU,IAAI,MAAM,EAAE,GAAG;QACtC,IAAI,MAAM;QACV,OAAO,MAAM;QACb,MAAM,MAAM;QACZ,QAAQ,MAAM;QACd,SAAS,MAAM;OAChB,CAAC;AAGJ,YAAM,eAAe,MAAM,OAAO;AAClC,YAAM,UAAU,GAAG,KAAK,EAAE,KAAK,MAAM,EAAE,KAAK,YAAY;AACxD,UAAI,CAAC,WAAW,IAAI,OAAO,GAAG;AAC5B,mBAAW,IAAI,SAAS;UACtB,MAAM,KAAK;UACX,IAAI,MAAM;UACV,MAAM;SACP;MACH;AAEA,UAAI,CAAC,MAAM,OAAO;AAChB,cAAM,KAAK;MACb;IACF;EACF;AAEA,QAAM,IAAI;AAEV,QAAM,QAAQ,CAAC,GAAG,UAAU,OAAM,CAAE,EAAE,KAAK,CAAC,MAAM,UAChD,KAAK,GAAG,cAAc,MAAM,EAAE,CAAC;AAEjC,QAAM,QAAQ,CAAC,GAAG,WAAW,OAAM,CAAE,EAAE,KAAK,CAAC,MAAM,UAAS;AAC1D,UAAM,SAAS,KAAK,KAAK,cAAc,MAAM,IAAI;AACjD,QAAI,WAAW;AAAG,aAAO;AACzB,UAAM,OAAO,KAAK,GAAG,cAAc,MAAM,EAAE;AAC3C,QAAI,SAAS;AAAG,aAAO;AACvB,WAAO,KAAK,KAAK,cAAc,MAAM,IAAI;EAC3C,CAAC;AACD,QAAM,aAAa,MAChB,OAAO,CAAC,SAAS,KAAK,OAAO,EAC7B,IAAI,CAAC,SAAS,KAAK,EAAE;AACxB,SAAO;IACL,SAAS,KAAK;IACd;IACA;IACA,aAAa;;AAEjB;AAGA,SAAS,qBACP,QACA,OACA,UAA4B;AAE5B,QAAM,UAAU,oBAAI,IAAG;AACvB,QAAM,WAAW,oBAAI,IAAG;AACxB,QAAM,aAAa,oBAAI,IAAG;AAC1B,QAAM,WAAW,oBAAI,IAAG;AACxB,QAAM,UAAU,CAAC,EAAE,IAAI,QAAQ,OAAO,EAAC,CAAE;AACzC,MAAI,eAAe;AACnB,SAAO,eAAe,QAAQ,QAAQ;AACpC,UAAM,UAAU,QAAQ,cAAc;AACtC,UAAM,WAAW,QAAQ,GAAG,KAAI,EAAG,YAAW;AAC9C,YAAQ,IAAI,QAAQ;AACpB,UAAM,OAAO,MAAM,IAAI,QAAQ;AAC/B,QAAI,CAAC,MAAM;AACT,iBAAW,IAAI,QAAQ;AACvB;IACF;AACA,QAAI,aAAa,UAAa,QAAQ,SAAS,UAAU;AACvD;IACF;AACA,QAAI,SAAS,IAAI,QAAQ,GAAG;AAC1B;IACF;AACA,aAAS,IAAI,QAAQ;AACrB,eAAW,cAAc,KAAK,cAAc;AAC1C,eAAS,IACP,GAAG,QAAQ,KAAK,WAAW,GAAG,KAAI,EAAG,YAAW,CAAE,KAAK,WAAW,IAAI,EAAE;AAE1E,cAAQ,KAAK,EAAE,IAAI,WAAW,IAAI,OAAO,QAAQ,QAAQ,EAAC,CAAE;IAC9D;EACF;AACA,SAAO;IACL,YAAY,QAAQ;IACpB,YAAY,SAAS;IACrB,eAAe,WAAW;;AAE9B;AAGM,SAAU,6BACd,QACA,OACA,SAAoG;AAEpG,QAAM,WAAW,cAAc,QAAQ,QAAQ;AAC/C,QAAM,YAAY,qBAAqB,QAAQ,WAAW,YAAY;AACtE,QAAM,YAAY,qBAAqB,QAAQ,WAAW,YAAY;AACtE,QAAM,cAAc,qBAAqB,QAAQ,aAAa,cAAc;AAC5E,QAAM,eAAe,IAAI,IAAI,MAAM,IAAI,CAAC,SAAS,CAAC,KAAK,GAAG,KAAI,EAAG,YAAW,GAAI,KAAK,GAAG,KAAI,CAAE,CAAC,CAAC;AAChG,QAAM,WAAW,oCAAoC,KAAK;AAC1D,QAAM,aAAa,kCAAkC,QAAQ;AAC7D,QAAM,aAAa,MAAM,IAAI,CAAC,SAAQ;AACpC,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;AAAM,eAAO,CAAA;AACxE,YAAM,aAAa;AACnB,YAAM,SAAS,+BAA+B,WAAW,EAAE;AAC3D,UAAI,CAAC;AAAQ,eAAO,CAAA;AACpB,aAAO,CAAC;QACN,IAAI,aAAa,IAAI,OAAO,YAAW,CAAE,KAAK;QAC9C,MAAM,OAAO,WAAW,SAAS,WAAW,WAAW,OAAO;OAC/D;IACH,CAAC;AACD,WAAO;MACL,IAAI,KAAK;MACT,GAAI,SAAS,EAAE,QAAQ,aAAa,IAAI,OAAO,YAAW,CAAE,KAAK,OAAM,IAAK,CAAA;MAC5E,GAAI,UAAU,EAAE,YAAY,aAAa,IAAI,QAAQ,YAAW,CAAE,KAAK,QAAO,IAAK,CAAA;MACnF;;EAEJ,CAAC;AACD,SAAO,yBACL,kBAAkB,UAAU,CAAC,GAAG,YAAY,GAAG,WAAW,IAAI,CAAC,QAAQ,EAAE,GAAE,EAAG,CAAC,CAAC,GAChF,QACA;IACE,GAAG,MAAM,IAAI,CAAC,UAAU,EAAE,IAAI,KAAK,IAAI,OAAO,KAAK,OAAO,QAAQ,KAAK,OAAM,EAAG;IAChF,GAAG,WAAW,IAAI,CAAC,QAAQ,EAAE,IAAI,OAAO,aAAa,EAAE,IAAI,QAAQ,UAAS,EAAG;KAEjF;IACE,GAAI,aAAa,SAAY,CAAA,IAAK,EAAE,SAAQ;IAC5C,GAAI,cAAc,SAAY,CAAA,IAAK,EAAE,UAAS;IAC9C,GAAI,cAAc,SAAY,CAAA,IAAK,EAAE,UAAS;IAC9C,GAAI,gBAAgB,SAAY,CAAA,IAAK,EAAE,YAAW;IAClD,GAAI,QAAQ,QAAQ,KAAI,IAAK,EAAE,QAAQ,QAAQ,OAAO,KAAI,EAAE,IAAK,CAAA;GAClE;AAEL;AAGA,eAAsB,QACpB,IACA,SACA,QAAqB;AAErB,QAAM,SAAS,cAAc,QAAQ,IAAG,GAAI,OAAO,IAAI;AACvD,MAAI,CAAE,MAAM,WAAW,gBAAgB,MAAM,CAAC,GAAI;AAChD,UAAM,IAAI,WACR,iCAAiC,MAAM,wBACvC,UAAU,SAAS;EAEvB;AACA,QAAM,SAAS,YAAY,QAAQ,MAAM;AACzC,QAAM,WAAW,cAAc,QAAQ,QAAQ;AAC/C,QAAM,WAAW,cAAc,QAAQ,QAAQ;AAC/C,QAAM,cAAc,QAAQ,YAAY;AACxC,QAAM,WAAW,MAAM,aAAa,MAAM;AAC1C,QAAM,eAAe,wBACnB,UACA,gCAA+B,CAAE;AAEnC,QAAM,QAAQ,MAAM,yBAClB,QACA,SAAS,aACT,aAAa,gBACb,QACA,SAAS,MAAM;AAEjB,QAAM,iBAAiB,6BAA6B,SAAS,MAAM;AACnE,QAAM,QAAQ,IAAI,IAChB,MAAM,IAAI,CAAC,SAAS,CAAC,KAAK,GAAG,KAAI,EAAG,YAAW,GAAI,cAAc,IAAI,CAAC,CAAC,CAAC;AAE1E,QAAM,WAAW,oCACf,OACA,CAAC,WAAW,iBAAiB,QAAQ,cAAc,CAAC;AAEtD,aAAW,aAAa,CAAC,GAAG,SAAS,QAAQ,GAAG,SAAS,eAAe,GAAG;AACzE,UAAM,SAAS,MAAM,IAAI,UAAU,UAAU,KAAI,EAAG,YAAW,CAAE;AACjE,UAAM,gBAAgB,UAAU,KAAK,KAAI,EAAG,YAAW;AACvD,QACE,UACA,CAAC,OAAO,aAAa,KACnB,CAAC,eACC,WAAW,GAAG,KAAI,EAAG,YAAW,MAAO,UAAU,UAAU,KAAI,EAAG,YAAW,KAC7E,WAAW,SAAS,aAAa,GAErC;AACA,aAAO,aAAa,KAAK,EAAE,IAAI,UAAU,WAAW,MAAM,cAAa,CAAE;IAC3E;EACF;AACA,MAAI,CAAC,MAAM,IAAI,GAAG,KAAI,EAAG,YAAW,CAAE,GAAG;AACvC,UAAM,IAAI,WAAW,QAAQ,EAAE,cAAc,UAAU,SAAS;EAClE;AAEA,MAAI,WAAW,WAAW;AACxB,UAAM,cAAc,MAAM,IAAI,GAAG,KAAI,EAAG,YAAW,CAAE,EAAG;AACxD,UAAM,UAAU,6BAA6B,aAAa,OAAO,OAAO;AACxE,WAAO;MACL,IAAI;MACJ;MACA,YAAY,QAAQ,MAAM,SAAS;MACnC,YAAY,QAAQ,MAAM;MAC1B,eAAe,kCAAkC,QAAQ,EAAE;MAC3D,GAAI,cAAc,CAAA,IAAK,EAAE,QAAO;;EAEpC;AAEA,MAAI,aAAa;AACf,WAAO;MACL;MACA;MACA,GAAG,qBAAqB,IAAI,OAAO,QAAQ;;EAE/C;AAEA,QAAM,OAAO,WACX,IACA,OACA,oBAAI,IAAG,GACP,UACA,UACA,oBAAI,IAAG,CAAU;AAEnB,QAAM,QAAQ,QAAQ,IAAI;AAC1B,QAAM,aAAa;IACjB;IACA;IACA,YAAY,MAAM,MAAM;IACxB,YAAY,MAAM,MAAM;IACxB,eAAe,MAAM,YAAY;;AAEnC,MAAI,WAAW,QAAQ;AACrB,WAAO;MACL,GAAG;MACH;;EAEJ;AACA,SAAO;IACL,GAAG;IACH;;AAEJ","debugId":"fd394844-de95-5cab-9dd6-7c4ef4e52320"}

package/dist/cli-bundle/chunks/register-list-query-A5KRJ5J2.js.map

@@ -1 +0,0 @@
-{"version":3,"sources":["../../../../../../../../core/output/tabular.ts","../../../../../../../../cli/register-list-query.ts"],"sourcesContent":["/**\n * @module core/output/tabular\n *\n * Renders projected item rows as CSV or fixed-width text tables for human\n * export. These are presentation-only modes (GH-154): agents continue to read\n * the structured `--json`/TOON output, while humans piping `pm list` into a\n * spreadsheet or terminal get a directly consumable shape.\n */\n\n/** A projected row: a flat map of column name to scalar/collection cell value. */\nexport type TabularRow = Record<string, unknown>;\n\n/** Collects the ordered union of column names across every row, preserving the order in which each key is first encountered so the rendered columns mirror the projection field order rather than an arbitrary object-key order. */\nfunction resolveColumns(rows: TabularRow[]): string[] {\n  const columns: string[] = [];\n  const seen = new Set<string>();\n  for (const row of rows) {\n    for (const key of Object.keys(row)) {\n      if (!seen.has(key)) {\n        seen.add(key);\n        columns.push(key);\n      }\n    }\n  }\n  return columns;\n}\n\n/** Converts a single cell value to its flat string form. Arrays join with `;` (spreadsheet-friendly and unambiguous against the CSV `,` delimiter), objects serialize to compact JSON, and null/undefined render as an empty cell. */\nfunction renderCell(value: unknown): string {\n  if (value === null || value === undefined) {\n    return \"\";\n  }\n  if (Array.isArray(value)) {\n    return value.map((entry) => renderCell(entry)).join(\";\");\n  }\n  if (typeof value === \"object\") {\n    return JSON.stringify(value);\n  }\n  return String(value);\n}\n\n/** Escapes a CSV field per RFC 4180: values containing the delimiter, a quote, or a line break are wrapped in double quotes with embedded quotes doubled. */\nfunction escapeCsvField(value: string): string {\n  if (/[\",\\r\\n]/.test(value)) {\n    return `\"${value.replace(/\"/g, '\"\"')}\"`;\n  }\n  return value;\n}\n\n/** Renders rows as RFC 4180 CSV with a header row of column names. Returns an empty string when there are no rows so callers emit nothing rather than a stray blank line. */\nexport function renderRowsAsCsv(rows: TabularRow[]): string {\n  if (rows.length === 0) {\n    return \"\";\n  }\n  const columns = resolveColumns(rows);\n  const lines = [columns.map((column) => escapeCsvField(column)).join(\",\")];\n  for (const row of rows) {\n    lines.push(\n      columns\n        .map((column) => escapeCsvField(renderCell(row[column])))\n        .join(\",\"),\n    );\n  }\n  return lines.join(\"\\n\");\n}\n\n/** Renders rows as a fixed-width text table: a header row, a dashed separator, and one padded row per item. Columns are widened to fit their widest cell so the output stays aligned in a monospace terminal. Returns an empty string when there are no rows. */\nexport function renderRowsAsTable(rows: TabularRow[]): string {\n  if (rows.length === 0) {\n    return \"\";\n  }\n  const columns = resolveColumns(rows);\n  const cells = rows.map((row) =>\n    columns.map((column) => renderCell(row[column])),\n  );\n  const widths = columns.map((column, index) =>\n    Math.max(column.length, ...cells.map((rowCells) => rowCells[index].length)),\n  );\n  const pad = (value: string, index: number): string =>\n    value.padEnd(widths[index]);\n  const lines = [\n    columns.map((column, index) => pad(column, index)).join(\" | \"),\n  ];\n  lines.push(widths.map((width) => \"-\".repeat(width)).join(\"-+-\"));\n  for (const rowCells of cells) {\n    lines.push(rowCells.map((value, index) => pad(value, index)).join(\" | \"));\n  }\n  return lines.join(\"\\n\");\n}\n","/**\n * @module cli/register-list-query\n *\n * Provides CLI runtime support for Register List Query.\n */\nimport type { Command } from \"commander\";\nimport { EXIT_CODE } from \"../core/shared/constants.js\";\nimport { PmCliError } from \"../core/shared/errors.js\";\nimport { renderRowsAsCsv, renderRowsAsTable } from \"../core/output/tabular.js\";\nimport { runActivity } from \"./commands/activity.js\";\nimport { runAggregate } from \"./commands/aggregate.js\";\nimport {\n  renderContextMarkdown,\n  runContext,\n  resolveContextOutputFormat,\n} from \"./commands/context.js\";\nimport { runEval } from \"./commands/eval.js\";\nimport { runGet } from \"./commands/get.js\";\nimport { runHistory } from \"./commands/history.js\";\nimport { runList } from \"./commands/list.js\";\nimport {\n  renderNextMarkdown,\n  runNext,\n  resolveNextOutputFormat,\n} from \"./commands/next.js\";\nimport { runSearch } from \"./commands/search.js\";\nimport type { ItemStatus } from \"../types/index.js\";\nimport {\n  addHiddenOption,\n  getGlobalOptions,\n  normalizeAggregateOptions,\n  normalizeActivityOptions,\n  normalizeContextOptions,\n  normalizeListOptions,\n  normalizeNextOptions,\n  normalizeSearchKeywordsInput,\n  normalizeSearchOptions,\n  printActivityJsonStream,\n  printError,\n  printListJsonStream,\n  printResult,\n  resolveActivityStreamMode,\n  writeStdout,\n} from \"./registration-helpers.js\";\n\n/** Documents the register list query commands options payload exchanged by command, SDK, and package integrations. */\nexport interface RegisterListQueryCommandsOptions {\n  /** Value that configures or reports command filter for this contract. */\n  commandFilter?: Set<string>;\n}\n\nfunction shouldRegisterListQueryCommand(\n  commandName: string,\n  commandFilter?: Set<string>,\n): boolean {\n  if (!commandFilter || commandFilter.size === 0) {\n    return true;\n  }\n  if (commandName === \"context\") {\n    return commandFilter.has(\"context\") || commandFilter.has(\"ctx\");\n  }\n  return commandFilter.has(commandName);\n}\n\ntype ReadCommandOutputFormat = \"json\" | \"toon\";\n\ntype ListOutputFormat = \"csv\" | \"table\" | \"json\" | \"toon\";\n\n/** Parses the `pm list --format` value into a supported render mode. csv/table are human export modes; json/toon override the machine output format. Returns undefined when no `--format` was supplied so the global output format applies. */\nfunction parseListFormat(rawFormat: unknown): ListOutputFormat | undefined {\n  if (rawFormat === undefined) {\n    return undefined;\n  }\n  if (typeof rawFormat !== \"string\") {\n    throw new PmCliError(\n      \"List --format must be one of csv|table|json|toon\",\n      EXIT_CODE.USAGE,\n    );\n  }\n  const normalized = rawFormat.trim().toLowerCase();\n  if (\n    normalized === \"csv\" ||\n    normalized === \"table\" ||\n    normalized === \"json\" ||\n    normalized === \"toon\"\n  ) {\n    return normalized;\n  }\n  throw new PmCliError(\n    \"List --format must be one of csv|table|json|toon\",\n    EXIT_CODE.USAGE,\n  );\n}\n\nfunction resolveReadCommandOutputFormat(\n  commandLabel: string,\n  rawFormat: unknown,\n  globalOptions: ReturnType<typeof getGlobalOptions>,\n): ReturnType<typeof getGlobalOptions> {\n  if (rawFormat === undefined) {\n    return globalOptions;\n  }\n  if (typeof rawFormat !== \"string\") {\n    throw new PmCliError(\n      `${commandLabel} --format must be one of json|toon`,\n      EXIT_CODE.USAGE,\n    );\n  }\n  const normalized = rawFormat.trim().toLowerCase() as ReadCommandOutputFormat;\n  if (normalized !== \"json\" && normalized !== \"toon\") {\n    throw new PmCliError(\n      `${commandLabel} --format must be one of json|toon`,\n      EXIT_CODE.USAGE,\n    );\n  }\n  if (globalOptions.json === true && normalized === \"toon\") {\n    throw new PmCliError(\n      `${commandLabel} cannot combine --json with --format toon`,\n      EXIT_CODE.USAGE,\n    );\n  }\n  return {\n    ...globalOptions,\n    json: normalized === \"json\",\n  };\n}\n\nfunction applyDefaultBriefListMode(\n  listOptions: ReturnType<typeof normalizeListOptions>,\n  defaultBrief: boolean | undefined,\n): void {\n  if (\n    defaultBrief === true &&\n    listOptions.includeBody !== true &&\n    listOptions.compact !== true &&\n    listOptions.brief !== true &&\n    listOptions.full !== true &&\n    listOptions.fields === undefined\n  ) {\n    listOptions.brief = true;\n  }\n}\n\nfunction registerContentAndGovernanceFilters(command: Command): void {\n  command\n    .option(\"--has-notes\", \"Show only items that have notes\")\n    .option(\"--has-learnings\", \"Show only items that have learnings\")\n    .option(\"--has-files\", \"Show only items that have linked files\")\n    .option(\"--has-docs\", \"Show only items that have linked docs\")\n    .option(\"--has-tests\", \"Show only items that have linked tests\")\n    .option(\"--has-comments\", \"Show only items that have comments\")\n    .option(\"--has-deps\", \"Show only items that have dependencies\")\n    .option(\"--has-body\", \"Show only items that have a non-empty body\")\n    .option(\n      \"--has-linked-command\",\n      \"Show only items whose linked tests carry a runnable command\",\n    )\n    .option(\"--no-notes\", \"Show only items that have no notes\")\n    .option(\"--no-learnings\", \"Show only items that have no learnings\")\n    .option(\"--no-files\", \"Show only items that have no linked files\")\n    .option(\"--filter-files-missing\", \"Alias for --no-files\")\n    .option(\"--no-docs\", \"Show only items that have no linked docs\")\n    .option(\"--filter-docs-missing\", \"Alias for --no-docs\")\n    .option(\"--no-tests\", \"Show only items that have no linked tests\")\n    .option(\"--no-comments\", \"Show only items that have no comments\")\n    .option(\"--no-deps\", \"Show only items that have no dependencies\")\n    .option(\"--empty-body\", \"Show only items with an empty body\")\n    .option(\n      \"--no-linked-command\",\n      \"Show only items whose linked tests carry no runnable command\",\n    )\n    .option(\"--filter-reviewer-missing\", \"Show only items missing reviewer\")\n    .option(\"--filter-risk-missing\", \"Show only items missing risk\")\n    .option(\"--filter-confidence-missing\", \"Show only items missing confidence\")\n    .option(\"--filter-sprint-missing\", \"Show only items missing sprint\")\n    .option(\"--filter-release-missing\", \"Show only items missing release\");\n}\n\nasync function runRegisteredListCommand(params: {\n  name: string;\n  status?: ItemStatus;\n  excludeTerminal?: boolean;\n  defaultBrief?: boolean;\n  options: Record<string, unknown>;\n  actionCommand: Command;\n}): Promise<void> {\n  const globalOptions = getGlobalOptions(params.actionCommand);\n  const startedAt = Date.now();\n  const listOptions = normalizeListOptions(params.options);\n  applyDefaultBriefListMode(listOptions, params.defaultBrief);\n  if (params.excludeTerminal) listOptions.excludeTerminal = true;\n  const result = await runList(params.status, listOptions, globalOptions);\n  const streamMode = params.options.stream === true;\n  const listFormat = parseListFormat(params.options.format);\n  const tabular = listFormat === \"csv\" || listFormat === \"table\";\n  const effectiveGlobal =\n    listFormat === \"json\" || listFormat === \"toon\"\n      ? resolveReadCommandOutputFormat(\n          \"List\",\n          params.options.format,\n          globalOptions,\n        )\n      : globalOptions;\n  if (streamMode && !effectiveGlobal.json) {\n    throw new PmCliError(\n      \"--stream requires --json output mode.\",\n      EXIT_CODE.USAGE,\n    );\n  }\n  if (tabular && streamMode) {\n    throw new PmCliError(\n      \"--format csv|table cannot be combined with --stream (line-delimited JSON).\",\n      EXIT_CODE.USAGE,\n    );\n  }\n  if (tabular) {\n    const rows = result.items as Array<Record<string, unknown>>;\n    const rendered =\n      listFormat === \"csv\" ? renderRowsAsCsv(rows) : renderRowsAsTable(rows);\n    if (!effectiveGlobal.quiet && rendered.length > 0) {\n      writeStdout(`${rendered}\\n`);\n    }\n  } else if (streamMode) {\n    printListJsonStream(params.name, result, effectiveGlobal);\n  } else {\n    printResult(result, effectiveGlobal);\n  }\n  if (globalOptions.profile) {\n    printError(\n      `profile:command=${params.name} took_ms=${Date.now() - startedAt}`,\n    );\n  }\n}\n\ninterface ListCommandDescriptor {\n  name: string;\n  description: string;\n  status?: ItemStatus;\n  excludeTerminal?: boolean;\n  allowStatusFilter?: boolean;\n  defaultBrief?: boolean;\n}\n\nfunction registerListCommand(\n  program: Command,\n  descriptor: ListCommandDescriptor,\n): void {\n  const {\n    name,\n    description,\n    status,\n    excludeTerminal,\n    allowStatusFilter,\n    defaultBrief,\n  } = descriptor;\n  const command = program.command(name).description(description);\n  if (allowStatusFilter) {\n    command.option(\n      \"--status <value>\",\n      \"Filter by status (use all for no status restriction)\",\n    );\n  }\n  command\n    .option(\"--type <value>\", \"Filter by item type\")\n    .option(\"--tag <value>\", \"Filter by tag\")\n    .option(\"--priority <value>\", \"Filter by priority\")\n    .option(\n      \"--deadline-before <value>\",\n      \"Filter by deadline upper bound (ISO/date string or relative)\",\n    )\n    .option(\n      \"--deadline-after <value>\",\n      \"Filter by deadline lower bound (ISO/date string or relative)\",\n    )\n    .option(\"--today\", \"Filter to items updated since local midnight today\")\n    .option(\"--recent\", \"Filter to items updated in the last 7 days\")\n    .option(\n      \"--updated-after <value>\",\n      'Filter by updated_at lower bound: ISO timestamp or signed relative (e.g. \"-2h\"/\"-7d\" for the past). \"Changed since my last window\" → --updated-after <ISO>',\n    )\n    .option(\n      \"--updated-before <value>\",\n      \"Filter by updated_at upper bound: ISO timestamp or signed relative (-2h/+1d)\",\n    )\n    .option(\n      \"--created-after <value>\",\n      \"Filter by created_at lower bound: ISO timestamp or signed relative (-2h/+1d)\",\n    )\n    .option(\n      \"--created-before <value>\",\n      \"Filter by created_at upper bound: ISO timestamp or signed relative (-2h/+1d)\",\n    )\n    .option(\n      \"--ids <value>\",\n      \"Filter by explicit item IDs (comma-separated or repeatable)\",\n    )\n    .option(\"--assignee <value>\", \"Filter by assignee\")\n    .option(\n      \"--assignee-filter <value>\",\n      \"Filter assignee presence: assigned|unassigned\",\n    )\n    .option(\"--parent <value>\", \"Filter by parent item ID\")\n    .option(\"--sprint <value>\", \"Filter by sprint\")\n    .option(\"--release <value>\", \"Filter by release\")\n    .option(\n      \"--filter-ac-missing\",\n      \"Show only items missing acceptance_criteria\",\n    )\n    .option(\n      \"--filter-estimates-missing\",\n      \"Show only items missing estimated_minutes\",\n    )\n    .option(\n      \"--filter-resolution-missing\",\n      \"Show only terminal items missing resolution\",\n    )\n    .option(\n      \"--filter-metadata-missing\",\n      \"Show only items missing any tracked metadata (AC, estimate, or resolution)\",\n    )\n    .option(\"--limit <n>\", \"Limit returned item count\")\n    .option(\n      \"--offset <n>\",\n      \"Skip the first n matching rows before limit is applied\",\n    )\n    .option(\n      \"--after <cursor>\",\n      \"Continue after an opaque next_cursor from a previous list response\",\n    )\n    .option(\n      \"--no-truncate\",\n      \"Return every matched row, overriding any --limit (alias: --all)\",\n    )\n    .option(\"--include-body\", \"Include item body in each returned list row\")\n    .option(\n      \"--compact\",\n      \"Render compact list projection fields (mutually exclusive with --brief/--full/--fields)\",\n    )\n    .option(\n      \"--brief\",\n      \"Ultra-compact output: id, status, type, title only (agent-optimized, mutually exclusive with --compact/--full/--fields)\",\n    )\n    .option(\n      \"--full\",\n      \"Render full list projection fields (mutually exclusive with --compact/--brief/--fields)\",\n    )\n    .option(\n      \"--fields <value>\",\n      \"Render custom comma-separated list fields (mutually exclusive with --compact/--brief/--full; valid: --fields id,title)\",\n    )\n    .option(\n      \"--sort <value>\",\n      \"Sort field: priority|deadline|updated_at|created_at|title|parent (aliases: updated, created)\",\n    )\n    .option(\"--order <value>\", \"Sort order: asc|desc (requires --sort)\")\n    .option(\"--tree\", \"Render rows in parent/child tree order\")\n    .option(\n      \"--tree-depth <n>\",\n      \"Maximum recursion depth with --tree (0 keeps root rows only)\",\n    )\n    .option(\n      \"--format <value>\",\n      \"Output render mode: csv|table (human export) or json|toon (machine output override)\",\n    )\n    .option(\"--stream\", \"Emit line-delimited JSON rows (requires --json)\");\n  registerContentAndGovernanceFilters(command);\n  command.action(async (options: Record<string, unknown>, actionCommand) => {\n    await runRegisteredListCommand({\n      name,\n      status,\n      excludeTerminal,\n      defaultBrief,\n      options,\n      actionCommand,\n    });\n  });\n  // Positive alias for --no-truncate (Commander stores the negation as truncate=false).\n  addHiddenOption(command, \"--all\", \"Alias for --no-truncate\");\n  // Hidden pure snake_case underscore-duplicate alias (kept parse-functional).\n  addHiddenOption(command, \"--tags <value>\", \"Alias for --tag\");\n  addHiddenOption(\n    command,\n    \"--assignee_filter <value>\",\n    \"Alias for --assignee-filter\",\n  );\n  addHiddenOption(command, \"--tree_depth <n>\", \"Alias for --tree-depth\");\n  // Singular alias so `--filter-estimate-missing` works (matches update-many spelling).\n  addHiddenOption(\n    command,\n    \"--filter-estimate-missing\",\n    \"Alias for --filter-estimates-missing\",\n  );\n}\n\nasync function runAggregateAction(\n  options: Record<string, unknown>,\n  command: Command,\n): Promise<void> {\n  const globalOptions = getGlobalOptions(command);\n  const startedAt = Date.now();\n  const result = await runAggregate(\n    normalizeAggregateOptions(options),\n    globalOptions,\n  );\n  printResult(result, globalOptions);\n  if (globalOptions.profile) {\n    printError(`profile:command=aggregate took_ms=${Date.now() - startedAt}`);\n  }\n}\n\nasync function runContextAction(\n  options: Record<string, unknown>,\n  actionCommand: Command,\n): Promise<void> {\n  const globalOptions = getGlobalOptions(actionCommand);\n  const startedAt = Date.now();\n  const normalized = normalizeContextOptions(options);\n  const result = await runContext(normalized, globalOptions);\n  const outputFormat = resolveContextOutputFormat(normalized, globalOptions);\n  if (outputFormat === \"markdown\") {\n    if (!globalOptions.quiet) {\n      writeStdout(`${renderContextMarkdown(result)}\\n`);\n    }\n  } else {\n    printResult(result, {\n      ...globalOptions,\n      json: outputFormat === \"json\",\n    });\n  }\n  if (globalOptions.profile) {\n    printError(`profile:command=context took_ms=${Date.now() - startedAt}`);\n  }\n}\n\nasync function runNextAction(\n  options: Record<string, unknown>,\n  actionCommand: Command,\n): Promise<void> {\n  const globalOptions = getGlobalOptions(actionCommand);\n  const startedAt = Date.now();\n  const nextOptions = normalizeNextOptions(options);\n  const result = await runNext(nextOptions, globalOptions);\n  const outputFormat = resolveNextOutputFormat(nextOptions, globalOptions);\n  if (outputFormat === \"markdown\") {\n    if (!globalOptions.quiet) {\n      writeStdout(`${renderNextMarkdown(result)}\\n`);\n    }\n  } else {\n    printResult(result, { ...globalOptions, json: outputFormat === \"json\" });\n  }\n  if (globalOptions.profile) {\n    printError(`profile:command=next took_ms=${Date.now() - startedAt}`);\n  }\n}\n\nasync function runSearchAction(\n  keywords: string[],\n  options: Record<string, unknown>,\n  command: Command,\n): Promise<void> {\n  const globalOptions = getGlobalOptions(command);\n  const startedAt = Date.now();\n  const searchOptions = normalizeSearchOptions(options);\n  const result = await runSearch(\n    normalizeSearchKeywordsInput(keywords),\n    {\n      ...searchOptions,\n      mode:\n        typeof searchOptions.mode === \"string\" &&\n        searchOptions.mode.trim().length > 0\n          ? searchOptions.mode\n          : \"keyword\",\n    },\n    globalOptions,\n  );\n  printResult(\n    result,\n    resolveReadCommandOutputFormat(\"Search\", options.format, globalOptions),\n  );\n  if (globalOptions.profile) {\n    printError(`profile:command=search took_ms=${Date.now() - startedAt}`);\n  }\n}\n\nasync function runEvalAction(\n  options: Record<string, unknown>,\n  command: Command,\n): Promise<void> {\n  const globalOptions = getGlobalOptions(command);\n  const startedAt = Date.now();\n  const result = await runEval(\n    {\n      mode: typeof options.mode === \"string\" ? options.mode : undefined,\n      k: typeof options.k === \"string\" ? options.k : undefined,\n      failUnder:\n        typeof options.failUnder === \"string\" ? options.failUnder : undefined,\n      queries:\n        typeof options.queries === \"string\" ? options.queries : undefined,\n      format: typeof options.format === \"string\" ? options.format : undefined,\n    },\n    globalOptions,\n  );\n  printResult(\n    result,\n    resolveReadCommandOutputFormat(\"Eval\", options.format, globalOptions),\n  );\n  if (globalOptions.profile) {\n    printError(`profile:command=eval took_ms=${Date.now() - startedAt}`);\n  }\n  if (!result.passed) {\n    throw new PmCliError(\n      `Eval gate failed: aggregate nDCG@${result.k} ${result.aggregate.ndcg} is below --fail-under ${result.fail_under}`,\n      EXIT_CODE.GENERIC_FAILURE,\n    );\n  }\n}\n\nasync function runGetAction(\n  id: string,\n  options: Record<string, unknown>,\n  command: Command,\n): Promise<void> {\n  const globalOptions = getGlobalOptions(command);\n  const startedAt = Date.now();\n  const result = await runGet(id, globalOptions, {\n    depth: typeof options.depth === \"string\" ? options.depth : undefined,\n    fields: typeof options.fields === \"string\" ? options.fields : undefined,\n    full: Boolean(options.full),\n    tree: options.tree === true,\n    treeDepth:\n      typeof options.treeDepth === \"string\"\n        ? options.treeDepth\n        : typeof options.tree_depth === \"string\"\n          ? options.tree_depth\n          : undefined,\n    at: typeof options.at === \"string\" ? options.at : undefined,\n  });\n  printResult(\n    result,\n    resolveReadCommandOutputFormat(\"Get\", options.format, globalOptions),\n  );\n  if (globalOptions.profile) {\n    printError(`profile:command=get took_ms=${Date.now() - startedAt}`);\n  }\n}\n\nasync function runHistoryAction(\n  id: string,\n  options: Record<string, unknown>,\n  command: Command,\n): Promise<void> {\n  const globalOptions = getGlobalOptions(command);\n  const startedAt = Date.now();\n  if (options.compact === true && options.full === true) {\n    throw new PmCliError(\n      \"History projection options are mutually exclusive. Use either --compact or --full.\",\n      EXIT_CODE.USAGE,\n    );\n  }\n  const field = typeof options.field === \"string\" ? options.field : undefined;\n  const result = await runHistory(\n    id,\n    {\n      limit: typeof options.limit === \"string\" ? options.limit : undefined,\n      compact: options.full === true ? false : true,\n      diff: Boolean(options.diff) || field !== undefined,\n      field,\n      verify: Boolean(options.verify),\n    },\n    globalOptions,\n  );\n  printResult(\n    result,\n    resolveReadCommandOutputFormat(\"History\", options.format, globalOptions),\n  );\n  if (globalOptions.profile) {\n    printError(`profile:command=history took_ms=${Date.now() - startedAt}`);\n  }\n}\n\nasync function runActivityAction(\n  options: Record<string, unknown>,\n  command: Command,\n): Promise<void> {\n  const globalOptions = getGlobalOptions(command);\n  const startedAt = Date.now();\n  if (options.compact === true && options.full === true) {\n    throw new PmCliError(\n      \"Activity projection options are mutually exclusive. Use either --compact or --full.\",\n      EXIT_CODE.USAGE,\n    );\n  }\n  const normalized = normalizeActivityOptions(options);\n  const result = await runActivity(normalized, globalOptions);\n  const streamMode = resolveActivityStreamMode(options.stream);\n  if (streamMode && !globalOptions.json) {\n    throw new PmCliError(\n      \"--stream requires --json output mode.\",\n      EXIT_CODE.USAGE,\n    );\n  }\n  if (streamMode) {\n    printActivityJsonStream(result, normalized, globalOptions);\n  } else {\n    printResult(result, globalOptions);\n  }\n  if (globalOptions.profile) {\n    printError(`profile:command=activity took_ms=${Date.now() - startedAt}`);\n  }\n}\n\n/** Implements register list query commands for the public runtime surface of this module. */\nexport function registerListQueryCommands(\n  program: Command,\n  options?: RegisterListQueryCommandsOptions,\n): void {\n  const commandFilter = options?.commandFilter;\n  const shouldRegister = (commandName: string): boolean =>\n    shouldRegisterListQueryCommand(commandName, commandFilter);\n  const listCommandDescriptors: ListCommandDescriptor[] = [\n    {\n      name: \"list\",\n      description: \"List active items with optional filters.\",\n      excludeTerminal: true,\n      allowStatusFilter: true,\n      defaultBrief: true,\n    },\n    {\n      name: \"list-all\",\n      description: \"List all items with optional filters.\",\n      excludeTerminal: false,\n      allowStatusFilter: true,\n    },\n    {\n      name: \"list-draft\",\n      description: \"List draft items with optional filters.\",\n      status: \"draft\",\n    },\n    {\n      name: \"list-open\",\n      description: \"List open items with optional filters.\",\n      status: \"open\",\n      excludeTerminal: false,\n      allowStatusFilter: false,\n      defaultBrief: true,\n    },\n    {\n      name: \"list-in-progress\",\n      description: \"List in-progress items with optional filters.\",\n      status: \"in_progress\",\n      excludeTerminal: false,\n      allowStatusFilter: false,\n      defaultBrief: true,\n    },\n    {\n      name: \"list-blocked\",\n      description: \"List blocked items with optional filters.\",\n      status: \"blocked\",\n      excludeTerminal: false,\n      allowStatusFilter: false,\n      defaultBrief: true,\n    },\n    {\n      name: \"list-closed\",\n      description: \"List closed items with optional filters.\",\n      status: \"closed\",\n    },\n    {\n      name: \"list-canceled\",\n      description: \"List canceled items with optional filters.\",\n      status: \"canceled\",\n    },\n  ];\n  for (const descriptor of listCommandDescriptors) {\n    if (shouldRegister(descriptor.name)) {\n      registerListCommand(program, descriptor);\n    }\n  }\n\n  if (shouldRegister(\"aggregate\")) {\n    const aggregateCommand = program\n      .command(\"aggregate\")\n      .description(\"Aggregate grouped item counts for governance queries.\")\n      .option(\n        \"--group-by <value>\",\n        \"Comma-separated group-by fields (supported: parent,type,priority,status,assignee,tags,sprint,release)\",\n      )\n      .option(\"--count\", \"Return grouped counts (default behavior)\")\n      .option(\n        \"--completion\",\n        \"Add open/in_progress/closed/other counts and completion_pct per group\",\n      )\n      .option(\"--sum <field>\", \"Sum a numeric field per group\")\n      .option(\"--avg <field>\", \"Average a numeric field per group\")\n      .option(\n        \"--include-unparented\",\n        \"Include unparented rows when grouping by parent\",\n      )\n      .option(\"--status <value>\", \"Filter by item status\")\n      .option(\"--type <value>\", \"Filter by item type\")\n      .option(\"--tag <value>\", \"Filter by tag\")\n      .option(\"--priority <value>\", \"Filter by priority\")\n      .option(\n        \"--deadline-before <value>\",\n        \"Filter by deadline upper bound (ISO/date string or relative)\",\n      )\n      .option(\n        \"--deadline-after <value>\",\n        \"Filter by deadline lower bound (ISO/date string or relative)\",\n      )\n      .option(\"--assignee <value>\", \"Filter by assignee\")\n      .option(\n        \"--assignee-filter <value>\",\n        \"Filter assignee presence: assigned|unassigned\",\n      )\n      .option(\"--parent <value>\", \"Filter by parent item ID\")\n      .option(\"--sprint <value>\", \"Filter by sprint\")\n      .option(\"--release <value>\", \"Filter by release\");\n    // Hidden pure snake_case underscore-duplicate aliases (kept parse-functional).\n    addHiddenOption(\n      aggregateCommand,\n      \"--include_unparented\",\n      \"Alias for --include-unparented\",\n    );\n    addHiddenOption(\n      aggregateCommand,\n      \"--assignee_filter <value>\",\n      \"Alias for --assignee-filter\",\n    );\n    aggregateCommand.action(runAggregateAction);\n  }\n\n  if (shouldRegister(\"context\")) {\n    const contextCommand = program\n      .command(\"context\")\n      .alias(\"ctx\")\n      .description(\n        \"Show a token-efficient project context snapshot for next-work decisions.\",\n      )\n      .option(\n        \"--date <value>\",\n        \"Anchor date/time for agenda window calculations (ISO/date string or relative)\",\n      )\n      .option(\n        \"--from <value>\",\n        \"Agenda lower bound (ISO/date string or relative)\",\n      )\n      .option(\n        \"--to <value>\",\n        \"Agenda upper bound (ISO/date string or relative)\",\n      )\n      .option(\"--past\", \"Include past agenda entries in bounded windows\")\n      .option(\"--type <value>\", \"Filter by item type\")\n      .option(\"--tag <value>\", \"Filter by tag\")\n      .option(\"--priority <value>\", \"Filter by priority\")\n      .option(\"--assignee <value>\", \"Filter by assignee\")\n      .option(\n        \"--assignee-filter <value>\",\n        \"Filter assignee presence: assigned|unassigned\",\n      )\n      .option(\"--sprint <value>\", \"Filter by sprint\")\n      .option(\"--release <value>\", \"Filter by release\")\n      .option(\n        \"--parent <id>\",\n        \"Scope the snapshot to one item's subtree (the item plus all descendants)\",\n      )\n      .option(\"--limit <n>\", \"Limit focus and agenda rows per section\")\n      .option(\n        \"--after <cursor>\",\n        \"Continue ranked focus after a next_cursor from a previous context response\",\n      )\n      .option(\n        \"--format <value>\",\n        \"Context output format override: markdown|toon|json\",\n      )\n      .option(\n        \"--depth <value>\",\n        \"Context depth: brief|standard|deep|full (full = every section, no per-section cap)\",\n      )\n      .option(\n        \"--section <value...>\",\n        \"Include specific sections (repeatable; overrides --depth)\",\n      )\n      .option(\n        \"--fields <value>\",\n        \"Project focus rows to a comma-separated field subset (e.g. id,title,priority)\",\n      )\n      .option(\n        \"--activity-limit <n>\",\n        \"Limit recent activity entries (default: settings or 10)\",\n      )\n      .option(\n        \"--stale-threshold <value>\",\n        \"Staleness cutoff in days (e.g. 7 or 7d; default: settings or 7)\",\n      )\n      .option(\n        \"--explain-ranking\",\n        \"Include the scorer model, per-signal contributions, and ranked candidate ids\",\n      );\n    // Hidden pure snake_case underscore-duplicate alias (kept parse-functional).\n    addHiddenOption(\n      contextCommand,\n      \"--assignee_filter <value>\",\n      \"Alias for --assignee-filter\",\n    );\n    addHiddenOption(contextCommand, \"--max-items <n>\", \"Alias for --limit\");\n    addHiddenOption(\n      contextCommand,\n      \"--explain_ranking\",\n      \"Alias for --explain-ranking\",\n    );\n    contextCommand.action(runContextAction);\n  }\n\n  if (shouldRegister(\"next\")) {\n    const nextCommand = program\n      .command(\"next\")\n      .description(\n        \"Recommend the next actionable (unblocked, ready) work item with rationale + blocked companion.\",\n      )\n      .option(\"--type <value>\", \"Filter candidate items by type\")\n      .option(\"--tag <value>\", \"Filter candidate items by tag\")\n      .option(\"--priority <value>\", \"Filter candidate items by priority\")\n      .option(\"--assignee <value>\", \"Filter candidate items by assignee\")\n      .option(\n        \"--assignee-filter <value>\",\n        \"Filter assignee presence: assigned|unassigned\",\n      )\n      .option(\"--sprint <value>\", \"Filter candidate items by sprint\")\n      .option(\"--release <value>\", \"Filter candidate items by release\")\n      .option(\n        \"--parent <id>\",\n        \"Scope to one item's subtree (the item plus all descendants)\",\n      )\n      .option(\n        \"--limit <n>\",\n        \"Limit ready rows (default: 5; non-positive falls back to default)\",\n      )\n      .option(\n        \"--blocked-limit <n>\",\n        \"Limit blocked rows (default: same as --limit)\",\n      )\n      .option(\"--ready-only\", \"Omit the blocked companion list\")\n      .option(\n        \"--include-decisions\",\n        \"Include human-gated Decision items in the claimable ready queue\",\n      )\n      .option(\n        \"--format <value>\",\n        \"Next output format override: markdown|toon|json\",\n      )\n      .option(\n        \"--explain-ranking\",\n        \"Include the scorer model, per-signal contributions, and ranked ready ids\",\n      );\n    addHiddenOption(\n      nextCommand,\n      \"--assignee_filter <value>\",\n      \"Alias for --assignee-filter\",\n    );\n    addHiddenOption(\n      nextCommand,\n      \"--blocked_limit <n>\",\n      \"Alias for --blocked-limit\",\n    );\n    addHiddenOption(nextCommand, \"--ready_only\", \"Alias for --ready-only\");\n    addHiddenOption(\n      nextCommand,\n      \"--explain_ranking\",\n      \"Alias for --explain-ranking\",\n    );\n    nextCommand.action(runNextAction);\n  }\n\n  if (shouldRegister(\"search\")) {\n    const searchCommand = program\n      .command(\"search\")\n      .argument(\"<keywords...>\", \"Keyword query tokens\")\n      .description(\n        \"Search items with keyword, semantic, or hybrid retrieval. Inline field:value tokens \" +\n          \"(tag:/status:/type:/priority:) in the query are parsed as filters, e.g. 'auth tag:area:search status:open'.\",\n      )\n      .option(\n        \"--mode <value>\",\n        \"Search mode: keyword|semantic|hybrid (default: keyword)\",\n      )\n      .option(\"--semantic\", \"Shorthand for --mode semantic\")\n      .option(\"--hybrid\", \"Shorthand for --mode hybrid\")\n      .option(\n        \"--match-mode <value>\",\n        \"Token match mode: and|or|exact (default: or with all-terms ranking bonus; and = hard-require every token; exact = exact phrase)\",\n      )\n      .option(\n        \"--min-score <value>\",\n        \"Per-query minimum score threshold (finite number >= 0); overrides settings search.score_threshold for this query only\",\n      )\n      .option(\n        \"--count\",\n        \"Return only the count of matching items (post-filter/threshold, pre-limit); skips hit rows\",\n      )\n      .option(\n        \"--semantic-weight <value>\",\n        \"Override hybrid semantic weight for this query (0..1); invalid values fall back to settings\",\n      )\n      .option(\n        \"--include-linked\",\n        \"Include linked files, docs, and tests in the searchable corpus\",\n      )\n      .option(\n        \"--title-exact\",\n        \"Require exact normalized title match for the full query string\",\n      )\n      .option(\n        \"--phrase-exact\",\n        \"Require exact normalized phrase match in searchable text\",\n      )\n      .option(\n        \"--highlight\",\n        \"Emit per-field matched-text snippets (wrapped in «…») on each hit; off by default\",\n      )\n      .option(\n        \"--status <value>\",\n        \"Filter by status before query (all, open/closed/canceled aliases, or configured status id; CSV)\",\n      )\n      .option(\"--type <value>\", \"Filter by item type\")\n      .option(\"--tag <value>\", \"Filter by tag\")\n      .option(\"--priority <value>\", \"Filter by priority\")\n      .option(\n        \"--deadline-before <value>\",\n        \"Filter by deadline upper bound (ISO/date string or relative)\",\n      )\n      .option(\n        \"--deadline-after <value>\",\n        \"Filter by deadline lower bound (ISO/date string or relative)\",\n      )\n      .option(\n        \"--updated-after <value>\",\n        'Filter by updated_at lower bound: ISO timestamp or signed relative (e.g. \"-2h\"/\"-7d\" for the past)',\n      )\n      .option(\n        \"--updated-before <value>\",\n        \"Filter by updated_at upper bound: ISO timestamp or signed relative (-2h/+1d)\",\n      )\n      .option(\n        \"--created-after <value>\",\n        \"Filter by created_at lower bound: ISO timestamp or signed relative (-2h/+1d)\",\n      )\n      .option(\n        \"--created-before <value>\",\n        \"Filter by created_at upper bound: ISO timestamp or signed relative (-2h/+1d)\",\n      )\n      .option(\"--assignee <value>\", \"Filter by assignee\")\n      .option(\"--sprint <value>\", \"Filter by sprint\")\n      .option(\"--release <value>\", \"Filter by release\")\n      .option(\"--parent <value>\", \"Filter by parent item ID\")\n      .option(\n        \"--compact\",\n        \"Render compact search hits (default; mutually exclusive with --full/--fields)\",\n      )\n      .option(\n        \"--full\",\n        \"Render full search hits with nested item payloads (mutually exclusive with --compact/--fields)\",\n      )\n      .option(\n        \"--fields <value>\",\n        \"Render custom comma-separated search hit fields (mutually exclusive with --compact/--full; valid: --fields id,title,score; invalid: --full --fields id,title)\",\n      )\n      .option(\"--format <value>\", \"Search output format override: json|toon\")\n      .option(\"--limit <n>\", \"Limit returned item count\")\n      .option(\n        \"--after <cursor>\",\n        \"Continue after an opaque next_cursor from a previous search response\",\n      );\n    registerContentAndGovernanceFilters(searchCommand);\n    searchCommand.action(runSearchAction);\n    addHiddenOption(searchCommand, \"--tags <value>\", \"Alias for --tag\");\n  }\n\n  if (shouldRegister(\"eval\")) {\n    program\n      .command(\"eval\")\n      .description(\n        \"Evaluate search relevance against a curated golden-query set: reports nDCG@k, MRR@k, \" +\n          \"precision@k, and recall@k per query plus the macro average. Use --fail-under as a CI gate.\",\n      )\n      .option(\n        \"--mode <value>\",\n        \"Default retrieval mode for queries without their own: keyword|semantic|hybrid (default: keyword)\",\n      )\n      .option(\"--k <n>\", \"Metric cutoff @k (positive integer; default: 10)\")\n      .option(\n        \"--fail-under <value>\",\n        \"Exit non-zero when aggregate nDCG@k falls below this threshold (0..1); CI gate\",\n      )\n      .option(\n        \"--queries <path>\",\n        \"Path to the golden-query JSON file (default: <pmRoot>/search/eval-queries.json)\",\n      )\n      .option(\"--format <value>\", \"Eval output format override: json|toon\")\n      .action(runEvalAction);\n  }\n\n  if (shouldRegister(\"get\")) {\n    const getCommand = program\n      .command(\"get\")\n      .argument(\"<id>\", \"Item id\")\n      .option(\n        \"--depth <value>\",\n        \"Detail depth: brief|standard|deep|full (full aliases deep; default: standard)\",\n      )\n      .option(\n        \"--full\",\n        \"Explicit full item read; equivalent to --depth deep (mutually exclusive with --depth/--fields)\",\n      )\n      .option(\n        \"--fields <value>\",\n        \"Render custom comma-separated item metadata fields (for example: --fields id,title,status,parent,type)\",\n      )\n      .option(\"--tree\", \"Include descendants rooted at the requested item\")\n      .option(\n        \"--tree-depth <n>\",\n        \"Maximum subtree depth for --tree descendants\",\n      )\n      .option(\n        \"--at <version-or-timestamp>\",\n        \"Reconstruct a verified historical item state without mutating it\",\n      )\n      .option(\"--format <value>\", \"Get output format override: json|toon\")\n      .description(\"Show item details by ID.\")\n      .action(runGetAction);\n    addHiddenOption(getCommand, \"--tree_depth <n>\", \"Alias for --tree-depth\");\n  }\n\n  if (shouldRegister(\"history\")) {\n    program\n      .command(\"history\")\n      .argument(\"<id>\", \"Item id\")\n      .option(\"--limit <n>\", \"Return only the latest n history entries\")\n      .option(\n        \"--compact\",\n        \"Condensed output: show entry index, timestamp, op, author, patch count, and changed fields\",\n      )\n      .option(\"--full\", \"Show full history entries with JSON Patch payloads\")\n      .option(\n        \"--diff\",\n        \"Include per-entry field-level before/after value diffs computed by replaying the history chain\",\n      )\n      .option(\n        \"--field <name>\",\n        \"With --diff, show only entries that changed this field (implies --diff)\",\n      )\n      .option(\n        \"--verify\",\n        \"Verify hash chain and replay integrity for the full history stream\",\n      )\n      .option(\"--format <value>\", \"History output format override: json|toon\")\n      .description(\"Show item history entries.\")\n      .action(runHistoryAction);\n  }\n\n  if (shouldRegister(\"activity\")) {\n    program\n      .command(\"activity\")\n      .option(\"--id <value>\", \"Filter by item ID\")\n      .option(\"--op <value>\", \"Filter by history operation\")\n      .option(\"--author <value>\", \"Filter by history author\")\n      .option(\n        \"--from <value>\",\n        \"Lower timestamp bound (ISO/date string or relative)\",\n      )\n      .option(\n        \"--to <value>\",\n        \"Upper timestamp bound (ISO/date string or relative)\",\n      )\n      .option(\"--limit <n>\", \"Return only the latest n activity entries\")\n      .option(\n        \"--compact\",\n        \"Condensed output: show only id, op, ts, author, msg per entry\",\n      )\n      .option(\"--full\", \"Show full activity entries with JSON Patch payloads\")\n      .option(\n        \"--stream [mode]\",\n        \"Emit line-delimited JSON rows (requires --json). Optional mode: rows|ndjson|jsonl\",\n      )\n      .description(\"Show recent activity across items.\")\n      .action(runActivityAction);\n  }\n}\n\n/** Public contract for test only register list query, shared by SDK and presentation-layer consumers. */\nexport const _testOnlyRegisterListQuery = {\n  resolveReadCommandOutputFormat,\n  parseListFormat,\n};\n"],"names":[],"mappings":";;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AAaA,SAAS,eAAe,MAAkB;AACxC,QAAM,UAAoB,CAAA;AAC1B,QAAM,OAAO,oBAAI,IAAG;AACpB,aAAW,OAAO,MAAM;AACtB,eAAW,OAAO,OAAO,KAAK,GAAG,GAAG;AAClC,UAAI,CAAC,KAAK,IAAI,GAAG,GAAG;AAClB,aAAK,IAAI,GAAG;AACZ,gBAAQ,KAAK,GAAG;MAClB;IACF;EACF;AACA,SAAO;AACT;AAGA,SAAS,WAAW,OAAc;AAChC,MAAI,UAAU,QAAQ,UAAU,QAAW;AACzC,WAAO;EACT;AACA,MAAI,MAAM,QAAQ,KAAK,GAAG;AACxB,WAAO,MAAM,IAAI,CAAC,UAAU,WAAW,KAAK,CAAC,EAAE,KAAK,GAAG;EACzD;AACA,MAAI,OAAO,UAAU,UAAU;AAC7B,WAAO,KAAK,UAAU,KAAK;EAC7B;AACA,SAAO,OAAO,KAAK;AACrB;AAGA,SAAS,eAAe,OAAa;AACnC,MAAI,WAAW,KAAK,KAAK,GAAG;AAC1B,WAAO,IAAI,MAAM,QAAQ,MAAM,IAAI,CAAC;EACtC;AACA,SAAO;AACT;AAGM,SAAU,gBAAgB,MAAkB;AAChD,MAAI,KAAK,WAAW,GAAG;AACrB,WAAO;EACT;AACA,QAAM,UAAU,eAAe,IAAI;AACnC,QAAM,QAAQ,CAAC,QAAQ,IAAI,CAAC,WAAW,eAAe,MAAM,CAAC,EAAE,KAAK,GAAG,CAAC;AACxE,aAAW,OAAO,MAAM;AACtB,UAAM,KACJ,QACG,IAAI,CAAC,WAAW,eAAe,WAAW,IAAI,MAAM,CAAC,CAAC,CAAC,EACvD,KAAK,GAAG,CAAC;EAEhB;AACA,SAAO,MAAM,KAAK,IAAI;AACxB;AAGM,SAAU,kBAAkB,MAAkB;AAClD,MAAI,KAAK,WAAW,GAAG;AACrB,WAAO;EACT;AACA,QAAM,UAAU,eAAe,IAAI;AACnC,QAAM,QAAQ,KAAK,IAAI,CAAC,QACtB,QAAQ,IAAI,CAAC,WAAW,WAAW,IAAI,MAAM,CAAC,CAAC,CAAC;AAElD,QAAM,SAAS,QAAQ,IAAI,CAAC,QAAQ,UAClC,KAAK,IAAI,OAAO,QAAQ,GAAG,MAAM,IAAI,CAAC,aAAa,SAAS,KAAK,EAAE,MAAM,CAAC,CAAC;AAE7E,QAAM,MAAM,CAAC,OAAe,UAC1B,MAAM,OAAO,OAAO,KAAK,CAAC;AAC5B,QAAM,QAAQ;IACZ,QAAQ,IAAI,CAAC,QAAQ,UAAU,IAAI,QAAQ,KAAK,CAAC,EAAE,KAAK,KAAK;;AAE/D,QAAM,KAAK,OAAO,IAAI,CAAC,UAAU,IAAI,OAAO,KAAK,CAAC,EAAE,KAAK,KAAK,CAAC;AAC/D,aAAW,YAAY,OAAO;AAC5B,UAAM,KAAK,SAAS,IAAI,CAAC,OAAO,UAAU,IAAI,OAAO,KAAK,CAAC,EAAE,KAAK,KAAK,CAAC;EAC1E;AACA,SAAO,MAAM,KAAK,IAAI;AACxB;;;ACrCA,SAAS,+BACP,aACA,eAA2B;AAE3B,MAAI,CAAC,iBAAiB,cAAc,SAAS,GAAG;AAC9C,WAAO;EACT;AACA,MAAI,gBAAgB,WAAW;AAC7B,WAAO,cAAc,IAAI,SAAS,KAAK,cAAc,IAAI,KAAK;EAChE;AACA,SAAO,cAAc,IAAI,WAAW;AACtC;AAOA,SAAS,gBAAgB,WAAkB;AACzC,MAAI,cAAc,QAAW;AAC3B,WAAO;EACT;AACA,MAAI,OAAO,cAAc,UAAU;AACjC,UAAM,IAAI,WACR,oDACA,UAAU,KAAK;EAEnB;AACA,QAAM,aAAa,UAAU,KAAI,EAAG,YAAW;AAC/C,MACE,eAAe,SACf,eAAe,WACf,eAAe,UACf,eAAe,QACf;AACA,WAAO;EACT;AACA,QAAM,IAAI,WACR,oDACA,UAAU,KAAK;AAEnB;AAEA,SAAS,+BACP,cACA,WACA,eAAkD;AAElD,MAAI,cAAc,QAAW;AAC3B,WAAO;EACT;AACA,MAAI,OAAO,cAAc,UAAU;AACjC,UAAM,IAAI,WACR,GAAG,YAAY,sCACf,UAAU,KAAK;EAEnB;AACA,QAAM,aAAa,UAAU,KAAI,EAAG,YAAW;AAC/C,MAAI,eAAe,UAAU,eAAe,QAAQ;AAClD,UAAM,IAAI,WACR,GAAG,YAAY,sCACf,UAAU,KAAK;EAEnB;AACA,MAAI,cAAc,SAAS,QAAQ,eAAe,QAAQ;AACxD,UAAM,IAAI,WACR,GAAG,YAAY,6CACf,UAAU,KAAK;EAEnB;AACA,SAAO;IACL,GAAG;IACH,MAAM,eAAe;;AAEzB;AAEA,SAAS,0BACP,aACA,cAAiC;AAEjC,MACE,iBAAiB,QACjB,YAAY,gBAAgB,QAC5B,YAAY,YAAY,QACxB,YAAY,UAAU,QACtB,YAAY,SAAS,QACrB,YAAY,WAAW,QACvB;AACA,gBAAY,QAAQ;EACtB;AACF;AAEA,SAAS,oCAAoC,SAAgB;AAC3D,UACG,OAAO,eAAe,iCAAiC,EACvD,OAAO,mBAAmB,qCAAqC,EAC/D,OAAO,eAAe,wCAAwC,EAC9D,OAAO,cAAc,uCAAuC,EAC5D,OAAO,eAAe,wCAAwC,EAC9D,OAAO,kBAAkB,oCAAoC,EAC7D,OAAO,cAAc,wCAAwC,EAC7D,OAAO,cAAc,4CAA4C,EACjE,OACC,wBACA,6DAA6D,EAE9D,OAAO,cAAc,oCAAoC,EACzD,OAAO,kBAAkB,wCAAwC,EACjE,OAAO,cAAc,2CAA2C,EAChE,OAAO,0BAA0B,sBAAsB,EACvD,OAAO,aAAa,0CAA0C,EAC9D,OAAO,yBAAyB,qBAAqB,EACrD,OAAO,cAAc,2CAA2C,EAChE,OAAO,iBAAiB,uCAAuC,EAC/D,OAAO,aAAa,2CAA2C,EAC/D,OAAO,gBAAgB,oCAAoC,EAC3D,OACC,uBACA,8DAA8D,EAE/D,OAAO,6BAA6B,kCAAkC,EACtE,OAAO,yBAAyB,8BAA8B,EAC9D,OAAO,+BAA+B,oCAAoC,EAC1E,OAAO,2BAA2B,gCAAgC,EAClE,OAAO,4BAA4B,iCAAiC;AACzE;AAEA,eAAe,yBAAyB,QAOvC;AACC,QAAM,gBAAgB,iBAAiB,OAAO,aAAa;AAC3D,QAAM,YAAY,KAAK,IAAG;AAC1B,QAAM,cAAc,qBAAqB,OAAO,OAAO;AACvD,4BAA0B,aAAa,OAAO,YAAY;AAC1D,MAAI,OAAO;AAAiB,gBAAY,kBAAkB;AAC1D,QAAM,SAAS,MAAM,QAAQ,OAAO,QAAQ,aAAa,aAAa;AACtE,QAAM,aAAa,OAAO,QAAQ,WAAW;AAC7C,QAAM,aAAa,gBAAgB,OAAO,QAAQ,MAAM;AACxD,QAAM,UAAU,eAAe,SAAS,eAAe;AACvD,QAAM,kBACJ,eAAe,UAAU,eAAe,SACpC,+BACE,QACA,OAAO,QAAQ,QACf,aAAa,IAEf;AACN,MAAI,cAAc,CAAC,gBAAgB,MAAM;AACvC,UAAM,IAAI,WACR,yCACA,UAAU,KAAK;EAEnB;AACA,MAAI,WAAW,YAAY;AACzB,UAAM,IAAI,WACR,8EACA,UAAU,KAAK;EAEnB;AACA,MAAI,SAAS;AACX,UAAM,OAAO,OAAO;AACpB,UAAM,WACJ,eAAe,QAAQ,gBAAgB,IAAI,IAAI,kBAAkB,IAAI;AACvE,QAAI,CAAC,gBAAgB,SAAS,SAAS,SAAS,GAAG;AACjD,kBAAY,GAAG,QAAQ;CAAI;IAC7B;EACF,WAAW,YAAY;AACrB,wBAAoB,OAAO,MAAM,QAAQ,eAAe;EAC1D,OAAO;AACL,gBAAY,QAAQ,eAAe;EACrC;AACA,MAAI,cAAc,SAAS;AACzB,eACE,mBAAmB,OAAO,IAAI,YAAY,KAAK,IAAG,IAAK,SAAS,EAAE;EAEtE;AACF;AAWA,SAAS,oBACP,SACA,YAAiC;AAEjC,QAAM,EACJ,MACA,aACA,QACA,iBACA,mBACA,aAAY,IACV;AACJ,QAAM,UAAU,QAAQ,QAAQ,IAAI,EAAE,YAAY,WAAW;AAC7D,MAAI,mBAAmB;AACrB,YAAQ,OACN,oBACA,sDAAsD;EAE1D;AACA,UACG,OAAO,kBAAkB,qBAAqB,EAC9C,OAAO,iBAAiB,eAAe,EACvC,OAAO,sBAAsB,oBAAoB,EACjD,OACC,6BACA,8DAA8D,EAE/D,OACC,4BACA,8DAA8D,EAE/D,OAAO,WAAW,oDAAoD,EACtE,OAAO,YAAY,4CAA4C,EAC/D,OACC,2BACA,iKAA4J,EAE7J,OACC,4BACA,8EAA8E,EAE/E,OACC,2BACA,8EAA8E,EAE/E,OACC,4BACA,8EAA8E,EAE/E,OACC,iBACA,6DAA6D,EAE9D,OAAO,sBAAsB,oBAAoB,EACjD,OACC,6BACA,+CAA+C,EAEhD,OAAO,oBAAoB,0BAA0B,EACrD,OAAO,oBAAoB,kBAAkB,EAC7C,OAAO,qBAAqB,mBAAmB,EAC/C,OACC,uBACA,6CAA6C,EAE9C,OACC,8BACA,2CAA2C,EAE5C,OACC,+BACA,6CAA6C,EAE9C,OACC,6BACA,4EAA4E,EAE7E,OAAO,eAAe,2BAA2B,EACjD,OACC,gBACA,wDAAwD,EAEzD,OACC,oBACA,oEAAoE,EAErE,OACC,iBACA,iEAAiE,EAElE,OAAO,kBAAkB,6CAA6C,EACtE,OACC,aACA,yFAAyF,EAE1F,OACC,WACA,yHAAyH,EAE1H,OACC,UACA,yFAAyF,EAE1F,OACC,oBACA,wHAAwH,EAEzH,OACC,kBACA,8FAA8F,EAE/F,OAAO,mBAAmB,wCAAwC,EAClE,OAAO,UAAU,wCAAwC,EACzD,OACC,oBACA,8DAA8D,EAE/D,OACC,oBACA,qFAAqF,EAEtF,OAAO,YAAY,iDAAiD;AACvE,sCAAoC,OAAO;AAC3C,UAAQ,OAAO,OAAO,SAAkC,kBAAiB;AACvE,UAAM,yBAAyB;MAC7B;MACA;MACA;MACA;MACA;MACA;KACD;EACH,CAAC;AAED,kBAAgB,SAAS,SAAS,yBAAyB;AAE3D,kBAAgB,SAAS,kBAAkB,iBAAiB;AAC5D,kBACE,SACA,6BACA,6BAA6B;AAE/B,kBAAgB,SAAS,oBAAoB,wBAAwB;AAErE,kBACE,SACA,6BACA,sCAAsC;AAE1C;AAEA,eAAe,mBACb,SACA,SAAgB;AAEhB,QAAM,gBAAgB,iBAAiB,OAAO;AAC9C,QAAM,YAAY,KAAK,IAAG;AAC1B,QAAM,SAAS,MAAM,aACnB,0BAA0B,OAAO,GACjC,aAAa;AAEf,cAAY,QAAQ,aAAa;AACjC,MAAI,cAAc,SAAS;AACzB,eAAW,qCAAqC,KAAK,IAAG,IAAK,SAAS,EAAE;EAC1E;AACF;AAEA,eAAe,iBACb,SACA,eAAsB;AAEtB,QAAM,gBAAgB,iBAAiB,aAAa;AACpD,QAAM,YAAY,KAAK,IAAG;AAC1B,QAAM,aAAa,wBAAwB,OAAO;AAClD,QAAM,SAAS,MAAM,WAAW,YAAY,aAAa;AACzD,QAAM,eAAe,2BAA2B,YAAY,aAAa;AACzE,MAAI,iBAAiB,YAAY;AAC/B,QAAI,CAAC,cAAc,OAAO;AACxB,kBAAY,GAAG,sBAAsB,MAAM,CAAC;CAAI;IAClD;EACF,OAAO;AACL,gBAAY,QAAQ;MAClB,GAAG;MACH,MAAM,iBAAiB;KACxB;EACH;AACA,MAAI,cAAc,SAAS;AACzB,eAAW,mCAAmC,KAAK,IAAG,IAAK,SAAS,EAAE;EACxE;AACF;AAEA,eAAe,cACb,SACA,eAAsB;AAEtB,QAAM,gBAAgB,iBAAiB,aAAa;AACpD,QAAM,YAAY,KAAK,IAAG;AAC1B,QAAM,cAAc,qBAAqB,OAAO;AAChD,QAAM,SAAS,MAAM,QAAQ,aAAa,aAAa;AACvD,QAAM,eAAe,wBAAwB,aAAa,aAAa;AACvE,MAAI,iBAAiB,YAAY;AAC/B,QAAI,CAAC,cAAc,OAAO;AACxB,kBAAY,GAAG,mBAAmB,MAAM,CAAC;CAAI;IAC/C;EACF,OAAO;AACL,gBAAY,QAAQ,EAAE,GAAG,eAAe,MAAM,iBAAiB,OAAM,CAAE;EACzE;AACA,MAAI,cAAc,SAAS;AACzB,eAAW,gCAAgC,KAAK,IAAG,IAAK,SAAS,EAAE;EACrE;AACF;AAEA,eAAe,gBACb,UACA,SACA,SAAgB;AAEhB,QAAM,gBAAgB,iBAAiB,OAAO;AAC9C,QAAM,YAAY,KAAK,IAAG;AAC1B,QAAM,gBAAgB,uBAAuB,OAAO;AACpD,QAAM,SAAS,MAAM,UACnB,6BAA6B,QAAQ,GACrC;IACE,GAAG;IACH,MACE,OAAO,cAAc,SAAS,YAC9B,cAAc,KAAK,KAAI,EAAG,SAAS,IAC/B,cAAc,OACd;KAER,aAAa;AAEf,cACE,QACA,+BAA+B,UAAU,QAAQ,QAAQ,aAAa,CAAC;AAEzE,MAAI,cAAc,SAAS;AACzB,eAAW,kCAAkC,KAAK,IAAG,IAAK,SAAS,EAAE;EACvE;AACF;AAEA,eAAe,cACb,SACA,SAAgB;AAEhB,QAAM,gBAAgB,iBAAiB,OAAO;AAC9C,QAAM,YAAY,KAAK,IAAG;AAC1B,QAAM,SAAS,MAAM,QACnB;IACE,MAAM,OAAO,QAAQ,SAAS,WAAW,QAAQ,OAAO;IACxD,GAAG,OAAO,QAAQ,MAAM,WAAW,QAAQ,IAAI;IAC/C,WACE,OAAO,QAAQ,cAAc,WAAW,QAAQ,YAAY;IAC9D,SACE,OAAO,QAAQ,YAAY,WAAW,QAAQ,UAAU;IAC1D,QAAQ,OAAO,QAAQ,WAAW,WAAW,QAAQ,SAAS;KAEhE,aAAa;AAEf,cACE,QACA,+BAA+B,QAAQ,QAAQ,QAAQ,aAAa,CAAC;AAEvE,MAAI,cAAc,SAAS;AACzB,eAAW,gCAAgC,KAAK,IAAG,IAAK,SAAS,EAAE;EACrE;AACA,MAAI,CAAC,OAAO,QAAQ;AAClB,UAAM,IAAI,WACR,oCAAoC,OAAO,CAAC,IAAI,OAAO,UAAU,IAAI,0BAA0B,OAAO,UAAU,IAChH,UAAU,eAAe;EAE7B;AACF;AAEA,eAAe,aACb,IACA,SACA,SAAgB;AAEhB,QAAM,gBAAgB,iBAAiB,OAAO;AAC9C,QAAM,YAAY,KAAK,IAAG;AAC1B,QAAM,SAAS,MAAM,OAAO,IAAI,eAAe;IAC7C,OAAO,OAAO,QAAQ,UAAU,WAAW,QAAQ,QAAQ;IAC3D,QAAQ,OAAO,QAAQ,WAAW,WAAW,QAAQ,SAAS;IAC9D,MAAM,QAAQ,QAAQ,IAAI;IAC1B,MAAM,QAAQ,SAAS;IACvB,WACE,OAAO,QAAQ,cAAc,WACzB,QAAQ,YACR,OAAO,QAAQ,eAAe,WAC5B,QAAQ,aACR;IACR,IAAI,OAAO,QAAQ,OAAO,WAAW,QAAQ,KAAK;GACnD;AACD,cACE,QACA,+BAA+B,OAAO,QAAQ,QAAQ,aAAa,CAAC;AAEtE,MAAI,cAAc,SAAS;AACzB,eAAW,+BAA+B,KAAK,IAAG,IAAK,SAAS,EAAE;EACpE;AACF;AAEA,eAAe,iBACb,IACA,SACA,SAAgB;AAEhB,QAAM,gBAAgB,iBAAiB,OAAO;AAC9C,QAAM,YAAY,KAAK,IAAG;AAC1B,MAAI,QAAQ,YAAY,QAAQ,QAAQ,SAAS,MAAM;AACrD,UAAM,IAAI,WACR,sFACA,UAAU,KAAK;EAEnB;AACA,QAAM,QAAQ,OAAO,QAAQ,UAAU,WAAW,QAAQ,QAAQ;AAClE,QAAM,SAAS,MAAM,WACnB,IACA;IACE,OAAO,OAAO,QAAQ,UAAU,WAAW,QAAQ,QAAQ;IAC3D,SAAS,QAAQ,SAAS,OAAO,QAAQ;IACzC,MAAM,QAAQ,QAAQ,IAAI,KAAK,UAAU;IACzC;IACA,QAAQ,QAAQ,QAAQ,MAAM;KAEhC,aAAa;AAEf,cACE,QACA,+BAA+B,WAAW,QAAQ,QAAQ,aAAa,CAAC;AAE1E,MAAI,cAAc,SAAS;AACzB,eAAW,mCAAmC,KAAK,IAAG,IAAK,SAAS,EAAE;EACxE;AACF;AAEA,eAAe,kBACb,SACA,SAAgB;AAEhB,QAAM,gBAAgB,iBAAiB,OAAO;AAC9C,QAAM,YAAY,KAAK,IAAG;AAC1B,MAAI,QAAQ,YAAY,QAAQ,QAAQ,SAAS,MAAM;AACrD,UAAM,IAAI,WACR,uFACA,UAAU,KAAK;EAEnB;AACA,QAAM,aAAa,yBAAyB,OAAO;AACnD,QAAM,SAAS,MAAM,YAAY,YAAY,aAAa;AAC1D,QAAM,aAAa,0BAA0B,QAAQ,MAAM;AAC3D,MAAI,cAAc,CAAC,cAAc,MAAM;AACrC,UAAM,IAAI,WACR,yCACA,UAAU,KAAK;EAEnB;AACA,MAAI,YAAY;AACd,4BAAwB,QAAQ,YAAY,aAAa;EAC3D,OAAO;AACL,gBAAY,QAAQ,aAAa;EACnC;AACA,MAAI,cAAc,SAAS;AACzB,eAAW,oCAAoC,KAAK,IAAG,IAAK,SAAS,EAAE;EACzE;AACF;AAGM,SAAU,0BACd,SACA,SAA0C;AAE1C,QAAM,gBAAgB,SAAS;AAC/B,QAAM,iBAAiB,CAAC,gBACtB,+BAA+B,aAAa,aAAa;AAC3D,QAAM,yBAAkD;IACtD;MACE,MAAM;MACN,aAAa;MACb,iBAAiB;MACjB,mBAAmB;MACnB,cAAc;;IAEhB;MACE,MAAM;MACN,aAAa;MACb,iBAAiB;MACjB,mBAAmB;;IAErB;MACE,MAAM;MACN,aAAa;MACb,QAAQ;;IAEV;MACE,MAAM;MACN,aAAa;MACb,QAAQ;MACR,iBAAiB;MACjB,mBAAmB;MACnB,cAAc;;IAEhB;MACE,MAAM;MACN,aAAa;MACb,QAAQ;MACR,iBAAiB;MACjB,mBAAmB;MACnB,cAAc;;IAEhB;MACE,MAAM;MACN,aAAa;MACb,QAAQ;MACR,iBAAiB;MACjB,mBAAmB;MACnB,cAAc;;IAEhB;MACE,MAAM;MACN,aAAa;MACb,QAAQ;;IAEV;MACE,MAAM;MACN,aAAa;MACb,QAAQ;;;AAGZ,aAAW,cAAc,wBAAwB;AAC/C,QAAI,eAAe,WAAW,IAAI,GAAG;AACnC,0BAAoB,SAAS,UAAU;IACzC;EACF;AAEA,MAAI,eAAe,WAAW,GAAG;AAC/B,UAAM,mBAAmB,QACtB,QAAQ,WAAW,EACnB,YAAY,uDAAuD,EACnE,OACC,sBACA,uGAAuG,EAExG,OAAO,WAAW,0CAA0C,EAC5D,OACC,gBACA,uEAAuE,EAExE,OAAO,iBAAiB,+BAA+B,EACvD,OAAO,iBAAiB,mCAAmC,EAC3D,OACC,wBACA,iDAAiD,EAElD,OAAO,oBAAoB,uBAAuB,EAClD,OAAO,kBAAkB,qBAAqB,EAC9C,OAAO,iBAAiB,eAAe,EACvC,OAAO,sBAAsB,oBAAoB,EACjD,OACC,6BACA,8DAA8D,EAE/D,OACC,4BACA,8DAA8D,EAE/D,OAAO,sBAAsB,oBAAoB,EACjD,OACC,6BACA,+CAA+C,EAEhD,OAAO,oBAAoB,0BAA0B,EACrD,OAAO,oBAAoB,kBAAkB,EAC7C,OAAO,qBAAqB,mBAAmB;AAElD,oBACE,kBACA,wBACA,gCAAgC;AAElC,oBACE,kBACA,6BACA,6BAA6B;AAE/B,qBAAiB,OAAO,kBAAkB;EAC5C;AAEA,MAAI,eAAe,SAAS,GAAG;AAC7B,UAAM,iBAAiB,QACpB,QAAQ,SAAS,EACjB,MAAM,KAAK,EACX,YACC,0EAA0E,EAE3E,OACC,kBACA,+EAA+E,EAEhF,OACC,kBACA,kDAAkD,EAEnD,OACC,gBACA,kDAAkD,EAEnD,OAAO,UAAU,gDAAgD,EACjE,OAAO,kBAAkB,qBAAqB,EAC9C,OAAO,iBAAiB,eAAe,EACvC,OAAO,sBAAsB,oBAAoB,EACjD,OAAO,sBAAsB,oBAAoB,EACjD,OACC,6BACA,+CAA+C,EAEhD,OAAO,oBAAoB,kBAAkB,EAC7C,OAAO,qBAAqB,mBAAmB,EAC/C,OACC,iBACA,0EAA0E,EAE3E,OAAO,eAAe,yCAAyC,EAC/D,OACC,oBACA,4EAA4E,EAE7E,OACC,oBACA,oDAAoD,EAErD,OACC,mBACA,oFAAoF,EAErF,OACC,wBACA,2DAA2D,EAE5D,OACC,oBACA,+EAA+E,EAEhF,OACC,wBACA,yDAAyD,EAE1D,OACC,6BACA,iEAAiE,EAElE,OACC,qBACA,8EAA8E;AAGlF,oBACE,gBACA,6BACA,6BAA6B;AAE/B,oBAAgB,gBAAgB,mBAAmB,mBAAmB;AACtE,oBACE,gBACA,qBACA,6BAA6B;AAE/B,mBAAe,OAAO,gBAAgB;EACxC;AAEA,MAAI,eAAe,MAAM,GAAG;AAC1B,UAAM,cAAc,QACjB,QAAQ,MAAM,EACd,YACC,gGAAgG,EAEjG,OAAO,kBAAkB,gCAAgC,EACzD,OAAO,iBAAiB,+BAA+B,EACvD,OAAO,sBAAsB,oCAAoC,EACjE,OAAO,sBAAsB,oCAAoC,EACjE,OACC,6BACA,+CAA+C,EAEhD,OAAO,oBAAoB,kCAAkC,EAC7D,OAAO,qBAAqB,mCAAmC,EAC/D,OACC,iBACA,6DAA6D,EAE9D,OACC,eACA,mEAAmE,EAEpE,OACC,uBACA,+CAA+C,EAEhD,OAAO,gBAAgB,iCAAiC,EACxD,OACC,uBACA,iEAAiE,EAElE,OACC,oBACA,iDAAiD,EAElD,OACC,qBACA,0EAA0E;AAE9E,oBACE,aACA,6BACA,6BAA6B;AAE/B,oBACE,aACA,uBACA,2BAA2B;AAE7B,oBAAgB,aAAa,gBAAgB,wBAAwB;AACrE,oBACE,aACA,qBACA,6BAA6B;AAE/B,gBAAY,OAAO,aAAa;EAClC;AAEA,MAAI,eAAe,QAAQ,GAAG;AAC5B,UAAM,gBAAgB,QACnB,QAAQ,QAAQ,EAChB,SAAS,iBAAiB,sBAAsB,EAChD,YACC,iMAC+G,EAEhH,OACC,kBACA,yDAAyD,EAE1D,OAAO,cAAc,+BAA+B,EACpD,OAAO,YAAY,6BAA6B,EAChD,OACC,wBACA,iIAAiI,EAElI,OACC,uBACA,uHAAuH,EAExH,OACC,WACA,4FAA4F,EAE7F,OACC,6BACA,6FAA6F,EAE9F,OACC,oBACA,gEAAgE,EAEjE,OACC,iBACA,gEAAgE,EAEjE,OACC,kBACA,0DAA0D,EAE3D,OACC,eACA,8FAAmF,EAEpF,OACC,oBACA,iGAAiG,EAElG,OAAO,kBAAkB,qBAAqB,EAC9C,OAAO,iBAAiB,eAAe,EACvC,OAAO,sBAAsB,oBAAoB,EACjD,OACC,6BACA,8DAA8D,EAE/D,OACC,4BACA,8DAA8D,EAE/D,OACC,2BACA,oGAAoG,EAErG,OACC,4BACA,8EAA8E,EAE/E,OACC,2BACA,8EAA8E,EAE/E,OACC,4BACA,8EAA8E,EAE/E,OAAO,sBAAsB,oBAAoB,EACjD,OAAO,oBAAoB,kBAAkB,EAC7C,OAAO,qBAAqB,mBAAmB,EAC/C,OAAO,oBAAoB,0BAA0B,EACrD,OACC,aACA,+EAA+E,EAEhF,OACC,UACA,gGAAgG,EAEjG,OACC,oBACA,+JAA+J,EAEhK,OAAO,oBAAoB,0CAA0C,EACrE,OAAO,eAAe,2BAA2B,EACjD,OACC,oBACA,sEAAsE;AAE1E,wCAAoC,aAAa;AACjD,kBAAc,OAAO,eAAe;AACpC,oBAAgB,eAAe,kBAAkB,iBAAiB;EACpE;AAEA,MAAI,eAAe,MAAM,GAAG;AAC1B,YACG,QAAQ,MAAM,EACd,YACC,iLAC8F,EAE/F,OACC,kBACA,kGAAkG,EAEnG,OAAO,WAAW,kDAAkD,EACpE,OACC,wBACA,gFAAgF,EAEjF,OACC,oBACA,iFAAiF,EAElF,OAAO,oBAAoB,wCAAwC,EACnE,OAAO,aAAa;EACzB;AAEA,MAAI,eAAe,KAAK,GAAG;AACzB,UAAM,aAAa,QAChB,QAAQ,KAAK,EACb,SAAS,QAAQ,SAAS,EAC1B,OACC,mBACA,+EAA+E,EAEhF,OACC,UACA,gGAAgG,EAEjG,OACC,oBACA,wGAAwG,EAEzG,OAAO,UAAU,kDAAkD,EACnE,OACC,oBACA,8CAA8C,EAE/C,OACC,+BACA,kEAAkE,EAEnE,OAAO,oBAAoB,uCAAuC,EAClE,YAAY,0BAA0B,EACtC,OAAO,YAAY;AACtB,oBAAgB,YAAY,oBAAoB,wBAAwB;EAC1E;AAEA,MAAI,eAAe,SAAS,GAAG;AAC7B,YACG,QAAQ,SAAS,EACjB,SAAS,QAAQ,SAAS,EAC1B,OAAO,eAAe,0CAA0C,EAChE,OACC,aACA,4FAA4F,EAE7F,OAAO,UAAU,oDAAoD,EACrE,OACC,UACA,gGAAgG,EAEjG,OACC,kBACA,yEAAyE,EAE1E,OACC,YACA,oEAAoE,EAErE,OAAO,oBAAoB,2CAA2C,EACtE,YAAY,4BAA4B,EACxC,OAAO,gBAAgB;EAC5B;AAEA,MAAI,eAAe,UAAU,GAAG;AAC9B,YACG,QAAQ,UAAU,EAClB,OAAO,gBAAgB,mBAAmB,EAC1C,OAAO,gBAAgB,6BAA6B,EACpD,OAAO,oBAAoB,0BAA0B,EACrD,OACC,kBACA,qDAAqD,EAEtD,OACC,gBACA,qDAAqD,EAEtD,OAAO,eAAe,2CAA2C,EACjE,OACC,aACA,+DAA+D,EAEhE,OAAO,UAAU,qDAAqD,EACtE,OACC,mBACA,mFAAmF,EAEpF,YAAY,oCAAoC,EAChD,OAAO,iBAAiB;EAC7B;AACF;AAGO,IAAM,6BAA6B;EACxC;EACA","debugId":"f9b71fb8-2ae3-5e94-8ee5-64ad8d1f64bf"}

package/dist/cli-bundle/chunks/register-list-query-NEYP3TXO.js.map

@@ -1,7 +0,0 @@
-{
-  "version": 3,
-  "sources": ["../../../../../../../../core/output/tabular.ts", "../../../../../../../../cli/register-list-query.ts"],
-  "sourcesContent": ["/**\n * @module core/output/tabular\n *\n * Renders projected item rows as CSV or fixed-width text tables for human\n * export. These are presentation-only modes (GH-154): agents continue to read\n * the structured `--json`/TOON output, while humans piping `pm list` into a\n * spreadsheet or terminal get a directly consumable shape.\n */\n\n/** A projected row: a flat map of column name to scalar/collection cell value. */\nexport type TabularRow = Record<string, unknown>;\n\n/** Collects the ordered union of column names across every row, preserving the order in which each key is first encountered so the rendered columns mirror the projection field order rather than an arbitrary object-key order. */\nfunction resolveColumns(rows: TabularRow[]): string[] {\n  const columns: string[] = [];\n  const seen = new Set<string>();\n  for (const row of rows) {\n    for (const key of Object.keys(row)) {\n      if (!seen.has(key)) {\n        seen.add(key);\n        columns.push(key);\n      }\n    }\n  }\n  return columns;\n}\n\n/** Converts a single cell value to its flat string form. Arrays join with `;` (spreadsheet-friendly and unambiguous against the CSV `,` delimiter), objects serialize to compact JSON, and null/undefined render as an empty cell. */\nfunction renderCell(value: unknown): string {\n  if (value === null || value === undefined) {\n    return \"\";\n  }\n  if (Array.isArray(value)) {\n    return value.map((entry) => renderCell(entry)).join(\";\");\n  }\n  if (typeof value === \"object\") {\n    return JSON.stringify(value);\n  }\n  return String(value);\n}\n\n/** Escapes a CSV field per RFC 4180: values containing the delimiter, a quote, or a line break are wrapped in double quotes with embedded quotes doubled. */\nfunction escapeCsvField(value: string): string {\n  if (/[\",\\r\\n]/.test(value)) {\n    return `\"${value.replace(/\"/g, '\"\"')}\"`;\n  }\n  return value;\n}\n\n/** Renders rows as RFC 4180 CSV with a header row of column names. Returns an empty string when there are no rows so callers emit nothing rather than a stray blank line. */\nexport function renderRowsAsCsv(rows: TabularRow[]): string {\n  if (rows.length === 0) {\n    return \"\";\n  }\n  const columns = resolveColumns(rows);\n  const lines = [columns.map((column) => escapeCsvField(column)).join(\",\")];\n  for (const row of rows) {\n    lines.push(\n      columns\n        .map((column) => escapeCsvField(renderCell(row[column])))\n        .join(\",\"),\n    );\n  }\n  return lines.join(\"\\n\");\n}\n\n/** Renders rows as a fixed-width text table: a header row, a dashed separator, and one padded row per item. Columns are widened to fit their widest cell so the output stays aligned in a monospace terminal. Returns an empty string when there are no rows. */\nexport function renderRowsAsTable(rows: TabularRow[]): string {\n  if (rows.length === 0) {\n    return \"\";\n  }\n  const columns = resolveColumns(rows);\n  const cells = rows.map((row) =>\n    columns.map((column) => renderCell(row[column])),\n  );\n  const widths = columns.map((column, index) =>\n    Math.max(column.length, ...cells.map((rowCells) => rowCells[index].length)),\n  );\n  const pad = (value: string, index: number): string =>\n    value.padEnd(widths[index]);\n  const lines = [\n    columns.map((column, index) => pad(column, index)).join(\" | \"),\n  ];\n  lines.push(widths.map((width) => \"-\".repeat(width)).join(\"-+-\"));\n  for (const rowCells of cells) {\n    lines.push(rowCells.map((value, index) => pad(value, index)).join(\" | \"));\n  }\n  return lines.join(\"\\n\");\n}\n", "/**\n * @module cli/register-list-query\n *\n * Provides CLI runtime support for Register List Query.\n */\nimport type { Command } from \"commander\";\nimport { EXIT_CODE } from \"../core/shared/constants.js\";\nimport { PmCliError } from \"../core/shared/errors.js\";\nimport { renderRowsAsCsv, renderRowsAsTable } from \"../core/output/tabular.js\";\nimport { runActivity } from \"./commands/activity.js\";\nimport { runAggregate } from \"./commands/aggregate.js\";\nimport {\n  renderContextMarkdown,\n  runContext,\n  resolveContextOutputFormat,\n} from \"./commands/context.js\";\nimport { runEval } from \"./commands/eval.js\";\nimport { runGet } from \"./commands/get.js\";\nimport { runHistory } from \"./commands/history.js\";\nimport { runList } from \"./commands/list.js\";\nimport {\n  renderNextMarkdown,\n  runNext,\n  resolveNextOutputFormat,\n} from \"./commands/next.js\";\nimport { runSearch } from \"./commands/search.js\";\nimport type { ItemStatus } from \"../types/index.js\";\nimport {\n  addHiddenOption,\n  getGlobalOptions,\n  normalizeAggregateOptions,\n  normalizeActivityOptions,\n  normalizeContextOptions,\n  normalizeListOptions,\n  normalizeNextOptions,\n  normalizeSearchKeywordsInput,\n  normalizeSearchOptions,\n  printActivityJsonStream,\n  printError,\n  printListJsonStream,\n  printResult,\n  resolveActivityStreamMode,\n  writeStdout,\n} from \"./registration-helpers.js\";\n\n/** Documents the register list query commands options payload exchanged by command, SDK, and package integrations. */\nexport interface RegisterListQueryCommandsOptions {\n  /** Value that configures or reports command filter for this contract. */\n  commandFilter?: Set<string>;\n}\n\nfunction shouldRegisterListQueryCommand(\n  commandName: string,\n  commandFilter?: Set<string>,\n): boolean {\n  if (!commandFilter || commandFilter.size === 0) {\n    return true;\n  }\n  if (commandName === \"context\") {\n    return commandFilter.has(\"context\") || commandFilter.has(\"ctx\");\n  }\n  return commandFilter.has(commandName);\n}\n\ntype ReadCommandOutputFormat = \"json\" | \"toon\";\n\ntype ListOutputFormat = \"csv\" | \"table\" | \"json\" | \"toon\";\n\n/** Parses the `pm list --format` value into a supported render mode. csv/table are human export modes; json/toon override the machine output format. Returns undefined when no `--format` was supplied so the global output format applies. */\nfunction parseListFormat(rawFormat: unknown): ListOutputFormat | undefined {\n  if (rawFormat === undefined) {\n    return undefined;\n  }\n  if (typeof rawFormat !== \"string\") {\n    throw new PmCliError(\n      \"List --format must be one of csv|table|json|toon\",\n      EXIT_CODE.USAGE,\n    );\n  }\n  const normalized = rawFormat.trim().toLowerCase();\n  if (\n    normalized === \"csv\" ||\n    normalized === \"table\" ||\n    normalized === \"json\" ||\n    normalized === \"toon\"\n  ) {\n    return normalized;\n  }\n  throw new PmCliError(\n    \"List --format must be one of csv|table|json|toon\",\n    EXIT_CODE.USAGE,\n  );\n}\n\nfunction resolveReadCommandOutputFormat(\n  commandLabel: string,\n  rawFormat: unknown,\n  globalOptions: ReturnType<typeof getGlobalOptions>,\n): ReturnType<typeof getGlobalOptions> {\n  if (rawFormat === undefined) {\n    return globalOptions;\n  }\n  if (typeof rawFormat !== \"string\") {\n    throw new PmCliError(\n      `${commandLabel} --format must be one of json|toon`,\n      EXIT_CODE.USAGE,\n    );\n  }\n  const normalized = rawFormat.trim().toLowerCase() as ReadCommandOutputFormat;\n  if (normalized !== \"json\" && normalized !== \"toon\") {\n    throw new PmCliError(\n      `${commandLabel} --format must be one of json|toon`,\n      EXIT_CODE.USAGE,\n    );\n  }\n  if (globalOptions.json === true && normalized === \"toon\") {\n    throw new PmCliError(\n      `${commandLabel} cannot combine --json with --format toon`,\n      EXIT_CODE.USAGE,\n    );\n  }\n  return {\n    ...globalOptions,\n    json: normalized === \"json\",\n  };\n}\n\nfunction applyDefaultBriefListMode(\n  listOptions: ReturnType<typeof normalizeListOptions>,\n  defaultBrief: boolean | undefined,\n): void {\n  if (\n    defaultBrief === true &&\n    listOptions.includeBody !== true &&\n    listOptions.compact !== true &&\n    listOptions.brief !== true &&\n    listOptions.full !== true &&\n    listOptions.fields === undefined\n  ) {\n    listOptions.brief = true;\n  }\n}\n\nfunction registerContentAndGovernanceFilters(command: Command): void {\n  command\n    .option(\"--has-notes\", \"Show only items that have notes\")\n    .option(\"--has-learnings\", \"Show only items that have learnings\")\n    .option(\"--has-files\", \"Show only items that have linked files\")\n    .option(\"--has-docs\", \"Show only items that have linked docs\")\n    .option(\"--has-tests\", \"Show only items that have linked tests\")\n    .option(\"--has-comments\", \"Show only items that have comments\")\n    .option(\"--has-deps\", \"Show only items that have dependencies\")\n    .option(\"--has-body\", \"Show only items that have a non-empty body\")\n    .option(\n      \"--has-linked-command\",\n      \"Show only items whose linked tests carry a runnable command\",\n    )\n    .option(\"--no-notes\", \"Show only items that have no notes\")\n    .option(\"--no-learnings\", \"Show only items that have no learnings\")\n    .option(\"--no-files\", \"Show only items that have no linked files\")\n    .option(\"--filter-files-missing\", \"Alias for --no-files\")\n    .option(\"--no-docs\", \"Show only items that have no linked docs\")\n    .option(\"--filter-docs-missing\", \"Alias for --no-docs\")\n    .option(\"--no-tests\", \"Show only items that have no linked tests\")\n    .option(\"--no-comments\", \"Show only items that have no comments\")\n    .option(\"--no-deps\", \"Show only items that have no dependencies\")\n    .option(\"--empty-body\", \"Show only items with an empty body\")\n    .option(\n      \"--no-linked-command\",\n      \"Show only items whose linked tests carry no runnable command\",\n    )\n    .option(\"--filter-reviewer-missing\", \"Show only items missing reviewer\")\n    .option(\"--filter-risk-missing\", \"Show only items missing risk\")\n    .option(\"--filter-confidence-missing\", \"Show only items missing confidence\")\n    .option(\"--filter-sprint-missing\", \"Show only items missing sprint\")\n    .option(\"--filter-release-missing\", \"Show only items missing release\");\n}\n\nasync function runRegisteredListCommand(params: {\n  name: string;\n  status?: ItemStatus;\n  excludeTerminal?: boolean;\n  defaultBrief?: boolean;\n  options: Record<string, unknown>;\n  actionCommand: Command;\n}): Promise<void> {\n  const globalOptions = getGlobalOptions(params.actionCommand);\n  const startedAt = Date.now();\n  const listOptions = normalizeListOptions(params.options);\n  applyDefaultBriefListMode(listOptions, params.defaultBrief);\n  if (params.excludeTerminal) listOptions.excludeTerminal = true;\n  const result = await runList(params.status, listOptions, globalOptions);\n  const streamMode = params.options.stream === true;\n  const listFormat = parseListFormat(params.options.format);\n  const tabular = listFormat === \"csv\" || listFormat === \"table\";\n  const effectiveGlobal =\n    listFormat === \"json\" || listFormat === \"toon\"\n      ? resolveReadCommandOutputFormat(\n          \"List\",\n          params.options.format,\n          globalOptions,\n        )\n      : globalOptions;\n  if (streamMode && !effectiveGlobal.json) {\n    throw new PmCliError(\n      \"--stream requires --json output mode.\",\n      EXIT_CODE.USAGE,\n    );\n  }\n  if (tabular && streamMode) {\n    throw new PmCliError(\n      \"--format csv|table cannot be combined with --stream (line-delimited JSON).\",\n      EXIT_CODE.USAGE,\n    );\n  }\n  if (tabular) {\n    const rows = result.items as Array<Record<string, unknown>>;\n    const rendered =\n      listFormat === \"csv\" ? renderRowsAsCsv(rows) : renderRowsAsTable(rows);\n    if (!effectiveGlobal.quiet && rendered.length > 0) {\n      writeStdout(`${rendered}\\n`);\n    }\n  } else if (streamMode) {\n    printListJsonStream(params.name, result, effectiveGlobal);\n  } else {\n    printResult(result, effectiveGlobal);\n  }\n  if (globalOptions.profile) {\n    printError(\n      `profile:command=${params.name} took_ms=${Date.now() - startedAt}`,\n    );\n  }\n}\n\ninterface ListCommandDescriptor {\n  name: string;\n  description: string;\n  status?: ItemStatus;\n  excludeTerminal?: boolean;\n  allowStatusFilter?: boolean;\n  defaultBrief?: boolean;\n}\n\nfunction registerListCommand(\n  program: Command,\n  descriptor: ListCommandDescriptor,\n): void {\n  const {\n    name,\n    description,\n    status,\n    excludeTerminal,\n    allowStatusFilter,\n    defaultBrief,\n  } = descriptor;\n  const command = program.command(name).description(description);\n  if (allowStatusFilter) {\n    command.option(\n      \"--status <value>\",\n      \"Filter by status (use all for no status restriction)\",\n    );\n  }\n  command\n    .option(\"--type <value>\", \"Filter by item type\")\n    .option(\"--tag <value>\", \"Filter by tag\")\n    .option(\"--priority <value>\", \"Filter by priority\")\n    .option(\n      \"--deadline-before <value>\",\n      \"Filter by deadline upper bound (ISO/date string or relative)\",\n    )\n    .option(\n      \"--deadline-after <value>\",\n      \"Filter by deadline lower bound (ISO/date string or relative)\",\n    )\n    .option(\"--today\", \"Filter to items updated since local midnight today\")\n    .option(\"--recent\", \"Filter to items updated in the last 7 days\")\n    .option(\n      \"--updated-after <value>\",\n      'Filter by updated_at lower bound: ISO timestamp or signed relative (e.g. \"-2h\"/\"-7d\" for the past). \"Changed since my last window\" → --updated-after <ISO>',\n    )\n    .option(\n      \"--updated-before <value>\",\n      \"Filter by updated_at upper bound: ISO timestamp or signed relative (-2h/+1d)\",\n    )\n    .option(\n      \"--created-after <value>\",\n      \"Filter by created_at lower bound: ISO timestamp or signed relative (-2h/+1d)\",\n    )\n    .option(\n      \"--created-before <value>\",\n      \"Filter by created_at upper bound: ISO timestamp or signed relative (-2h/+1d)\",\n    )\n    .option(\n      \"--ids <value>\",\n      \"Filter by explicit item IDs (comma-separated or repeatable)\",\n    )\n    .option(\"--assignee <value>\", \"Filter by assignee\")\n    .option(\n      \"--assignee-filter <value>\",\n      \"Filter assignee presence: assigned|unassigned\",\n    )\n    .option(\"--parent <value>\", \"Filter by parent item ID\")\n    .option(\"--sprint <value>\", \"Filter by sprint\")\n    .option(\"--release <value>\", \"Filter by release\")\n    .option(\n      \"--filter-ac-missing\",\n      \"Show only items missing acceptance_criteria\",\n    )\n    .option(\n      \"--filter-estimates-missing\",\n      \"Show only items missing estimated_minutes\",\n    )\n    .option(\n      \"--filter-resolution-missing\",\n      \"Show only terminal items missing resolution\",\n    )\n    .option(\n      \"--filter-metadata-missing\",\n      \"Show only items missing any tracked metadata (AC, estimate, or resolution)\",\n    )\n    .option(\"--limit <n>\", \"Limit returned item count\")\n    .option(\n      \"--offset <n>\",\n      \"Skip the first n matching rows before limit is applied\",\n    )\n    .option(\n      \"--after <cursor>\",\n      \"Continue after an opaque next_cursor from a previous list response\",\n    )\n    .option(\n      \"--no-truncate\",\n      \"Return every matched row, overriding any --limit (alias: --all)\",\n    )\n    .option(\"--include-body\", \"Include item body in each returned list row\")\n    .option(\n      \"--compact\",\n      \"Render compact list projection fields (mutually exclusive with --brief/--full/--fields)\",\n    )\n    .option(\n      \"--brief\",\n      \"Ultra-compact output: id, status, type, title only (agent-optimized, mutually exclusive with --compact/--full/--fields)\",\n    )\n    .option(\n      \"--full\",\n      \"Render full list projection fields (mutually exclusive with --compact/--brief/--fields)\",\n    )\n    .option(\n      \"--fields <value>\",\n      \"Render custom comma-separated list fields (mutually exclusive with --compact/--brief/--full; valid: --fields id,title)\",\n    )\n    .option(\n      \"--sort <value>\",\n      \"Sort field: priority|deadline|updated_at|created_at|title|parent (aliases: updated, created)\",\n    )\n    .option(\"--order <value>\", \"Sort order: asc|desc (requires --sort)\")\n    .option(\"--tree\", \"Render rows in parent/child tree order\")\n    .option(\n      \"--tree-depth <n>\",\n      \"Maximum recursion depth with --tree (0 keeps root rows only)\",\n    )\n    .option(\n      \"--format <value>\",\n      \"Output render mode: csv|table (human export) or json|toon (machine output override)\",\n    )\n    .option(\"--stream\", \"Emit line-delimited JSON rows (requires --json)\");\n  registerContentAndGovernanceFilters(command);\n  command.action(async (options: Record<string, unknown>, actionCommand) => {\n    await runRegisteredListCommand({\n      name,\n      status,\n      excludeTerminal,\n      defaultBrief,\n      options,\n      actionCommand,\n    });\n  });\n  // Positive alias for --no-truncate (Commander stores the negation as truncate=false).\n  addHiddenOption(command, \"--all\", \"Alias for --no-truncate\");\n  // Hidden pure snake_case underscore-duplicate alias (kept parse-functional).\n  addHiddenOption(command, \"--tags <value>\", \"Alias for --tag\");\n  addHiddenOption(\n    command,\n    \"--assignee_filter <value>\",\n    \"Alias for --assignee-filter\",\n  );\n  addHiddenOption(command, \"--tree_depth <n>\", \"Alias for --tree-depth\");\n  // Singular alias so `--filter-estimate-missing` works (matches update-many spelling).\n  addHiddenOption(\n    command,\n    \"--filter-estimate-missing\",\n    \"Alias for --filter-estimates-missing\",\n  );\n}\n\nasync function runAggregateAction(\n  options: Record<string, unknown>,\n  command: Command,\n): Promise<void> {\n  const globalOptions = getGlobalOptions(command);\n  const startedAt = Date.now();\n  const result = await runAggregate(\n    normalizeAggregateOptions(options),\n    globalOptions,\n  );\n  printResult(result, globalOptions);\n  if (globalOptions.profile) {\n    printError(`profile:command=aggregate took_ms=${Date.now() - startedAt}`);\n  }\n}\n\nasync function runContextAction(\n  options: Record<string, unknown>,\n  actionCommand: Command,\n): Promise<void> {\n  const globalOptions = getGlobalOptions(actionCommand);\n  const startedAt = Date.now();\n  const normalized = normalizeContextOptions(options);\n  const result = await runContext(normalized, globalOptions);\n  const outputFormat = resolveContextOutputFormat(normalized, globalOptions);\n  if (outputFormat === \"markdown\") {\n    if (!globalOptions.quiet) {\n      writeStdout(`${renderContextMarkdown(result)}\\n`);\n    }\n  } else {\n    printResult(result, {\n      ...globalOptions,\n      json: outputFormat === \"json\",\n    });\n  }\n  if (globalOptions.profile) {\n    printError(`profile:command=context took_ms=${Date.now() - startedAt}`);\n  }\n}\n\nasync function runNextAction(\n  options: Record<string, unknown>,\n  actionCommand: Command,\n): Promise<void> {\n  const globalOptions = getGlobalOptions(actionCommand);\n  const startedAt = Date.now();\n  const nextOptions = normalizeNextOptions(options);\n  const result = await runNext(nextOptions, globalOptions);\n  const outputFormat = resolveNextOutputFormat(nextOptions, globalOptions);\n  if (outputFormat === \"markdown\") {\n    if (!globalOptions.quiet) {\n      writeStdout(`${renderNextMarkdown(result)}\\n`);\n    }\n  } else {\n    printResult(result, { ...globalOptions, json: outputFormat === \"json\" });\n  }\n  if (globalOptions.profile) {\n    printError(`profile:command=next took_ms=${Date.now() - startedAt}`);\n  }\n}\n\nasync function runSearchAction(\n  keywords: string[],\n  options: Record<string, unknown>,\n  command: Command,\n): Promise<void> {\n  const globalOptions = getGlobalOptions(command);\n  const startedAt = Date.now();\n  const searchOptions = normalizeSearchOptions(options);\n  const result = await runSearch(\n    normalizeSearchKeywordsInput(keywords),\n    {\n      ...searchOptions,\n      mode:\n        typeof searchOptions.mode === \"string\" &&\n        searchOptions.mode.trim().length > 0\n          ? searchOptions.mode\n          : \"keyword\",\n    },\n    globalOptions,\n  );\n  printResult(\n    result,\n    resolveReadCommandOutputFormat(\"Search\", options.format, globalOptions),\n  );\n  if (globalOptions.profile) {\n    printError(`profile:command=search took_ms=${Date.now() - startedAt}`);\n  }\n}\n\nasync function runEvalAction(\n  options: Record<string, unknown>,\n  command: Command,\n): Promise<void> {\n  const globalOptions = getGlobalOptions(command);\n  const startedAt = Date.now();\n  const result = await runEval(\n    {\n      mode: typeof options.mode === \"string\" ? options.mode : undefined,\n      k: typeof options.k === \"string\" ? options.k : undefined,\n      failUnder:\n        typeof options.failUnder === \"string\" ? options.failUnder : undefined,\n      queries:\n        typeof options.queries === \"string\" ? options.queries : undefined,\n      format: typeof options.format === \"string\" ? options.format : undefined,\n    },\n    globalOptions,\n  );\n  printResult(\n    result,\n    resolveReadCommandOutputFormat(\"Eval\", options.format, globalOptions),\n  );\n  if (globalOptions.profile) {\n    printError(`profile:command=eval took_ms=${Date.now() - startedAt}`);\n  }\n  if (!result.passed) {\n    throw new PmCliError(\n      `Eval gate failed: aggregate nDCG@${result.k} ${result.aggregate.ndcg} is below --fail-under ${result.fail_under}`,\n      EXIT_CODE.GENERIC_FAILURE,\n    );\n  }\n}\n\nasync function runGetAction(\n  id: string,\n  options: Record<string, unknown>,\n  command: Command,\n): Promise<void> {\n  const globalOptions = getGlobalOptions(command);\n  const startedAt = Date.now();\n  const result = await runGet(id, globalOptions, {\n    depth: typeof options.depth === \"string\" ? options.depth : undefined,\n    fields: typeof options.fields === \"string\" ? options.fields : undefined,\n    full: Boolean(options.full),\n    tree: options.tree === true,\n    treeDepth:\n      typeof options.treeDepth === \"string\"\n        ? options.treeDepth\n        : typeof options.tree_depth === \"string\"\n          ? options.tree_depth\n          : undefined,\n    at: typeof options.at === \"string\" ? options.at : undefined,\n  });\n  printResult(\n    result,\n    resolveReadCommandOutputFormat(\"Get\", options.format, globalOptions),\n  );\n  if (globalOptions.profile) {\n    printError(`profile:command=get took_ms=${Date.now() - startedAt}`);\n  }\n}\n\nasync function runHistoryAction(\n  id: string,\n  options: Record<string, unknown>,\n  command: Command,\n): Promise<void> {\n  const globalOptions = getGlobalOptions(command);\n  const startedAt = Date.now();\n  if (options.compact === true && options.full === true) {\n    throw new PmCliError(\n      \"History projection options are mutually exclusive. Use either --compact or --full.\",\n      EXIT_CODE.USAGE,\n    );\n  }\n  const field = typeof options.field === \"string\" ? options.field : undefined;\n  const result = await runHistory(\n    id,\n    {\n      limit: typeof options.limit === \"string\" ? options.limit : undefined,\n      compact: options.full === true ? false : true,\n      diff: Boolean(options.diff) || field !== undefined,\n      field,\n      verify: Boolean(options.verify),\n    },\n    globalOptions,\n  );\n  printResult(\n    result,\n    resolveReadCommandOutputFormat(\"History\", options.format, globalOptions),\n  );\n  if (globalOptions.profile) {\n    printError(`profile:command=history took_ms=${Date.now() - startedAt}`);\n  }\n}\n\nasync function runActivityAction(\n  options: Record<string, unknown>,\n  command: Command,\n): Promise<void> {\n  const globalOptions = getGlobalOptions(command);\n  const startedAt = Date.now();\n  if (options.compact === true && options.full === true) {\n    throw new PmCliError(\n      \"Activity projection options are mutually exclusive. Use either --compact or --full.\",\n      EXIT_CODE.USAGE,\n    );\n  }\n  const normalized = normalizeActivityOptions(options);\n  const result = await runActivity(normalized, globalOptions);\n  const streamMode = resolveActivityStreamMode(options.stream);\n  if (streamMode && !globalOptions.json) {\n    throw new PmCliError(\n      \"--stream requires --json output mode.\",\n      EXIT_CODE.USAGE,\n    );\n  }\n  if (streamMode) {\n    printActivityJsonStream(result, normalized, globalOptions);\n  } else {\n    printResult(result, globalOptions);\n  }\n  if (globalOptions.profile) {\n    printError(`profile:command=activity took_ms=${Date.now() - startedAt}`);\n  }\n}\n\n/** Implements register list query commands for the public runtime surface of this module. */\nexport function registerListQueryCommands(\n  program: Command,\n  options?: RegisterListQueryCommandsOptions,\n): void {\n  const commandFilter = options?.commandFilter;\n  const shouldRegister = (commandName: string): boolean =>\n    shouldRegisterListQueryCommand(commandName, commandFilter);\n  const listCommandDescriptors: ListCommandDescriptor[] = [\n    {\n      name: \"list\",\n      description: \"List active items with optional filters.\",\n      excludeTerminal: true,\n      allowStatusFilter: true,\n      defaultBrief: true,\n    },\n    {\n      name: \"list-all\",\n      description: \"List all items with optional filters.\",\n      excludeTerminal: false,\n      allowStatusFilter: true,\n    },\n    {\n      name: \"list-draft\",\n      description: \"List draft items with optional filters.\",\n      status: \"draft\",\n    },\n    {\n      name: \"list-open\",\n      description: \"List open items with optional filters.\",\n      status: \"open\",\n      excludeTerminal: false,\n      allowStatusFilter: false,\n      defaultBrief: true,\n    },\n    {\n      name: \"list-in-progress\",\n      description: \"List in-progress items with optional filters.\",\n      status: \"in_progress\",\n      excludeTerminal: false,\n      allowStatusFilter: false,\n      defaultBrief: true,\n    },\n    {\n      name: \"list-blocked\",\n      description: \"List blocked items with optional filters.\",\n      status: \"blocked\",\n      excludeTerminal: false,\n      allowStatusFilter: false,\n      defaultBrief: true,\n    },\n    {\n      name: \"list-closed\",\n      description: \"List closed items with optional filters.\",\n      status: \"closed\",\n    },\n    {\n      name: \"list-canceled\",\n      description: \"List canceled items with optional filters.\",\n      status: \"canceled\",\n    },\n  ];\n  for (const descriptor of listCommandDescriptors) {\n    if (shouldRegister(descriptor.name)) {\n      registerListCommand(program, descriptor);\n    }\n  }\n\n  if (shouldRegister(\"aggregate\")) {\n    const aggregateCommand = program\n      .command(\"aggregate\")\n      .description(\"Aggregate grouped item counts for governance queries.\")\n      .option(\n        \"--group-by <value>\",\n        \"Comma-separated group-by fields (supported: parent,type,priority,status,assignee,tags,sprint,release)\",\n      )\n      .option(\"--count\", \"Return grouped counts (default behavior)\")\n      .option(\n        \"--completion\",\n        \"Add open/in_progress/closed/other counts and completion_pct per group\",\n      )\n      .option(\"--sum <field>\", \"Sum a numeric field per group\")\n      .option(\"--avg <field>\", \"Average a numeric field per group\")\n      .option(\n        \"--include-unparented\",\n        \"Include unparented rows when grouping by parent\",\n      )\n      .option(\"--status <value>\", \"Filter by item status\")\n      .option(\"--type <value>\", \"Filter by item type\")\n      .option(\"--tag <value>\", \"Filter by tag\")\n      .option(\"--priority <value>\", \"Filter by priority\")\n      .option(\n        \"--deadline-before <value>\",\n        \"Filter by deadline upper bound (ISO/date string or relative)\",\n      )\n      .option(\n        \"--deadline-after <value>\",\n        \"Filter by deadline lower bound (ISO/date string or relative)\",\n      )\n      .option(\"--assignee <value>\", \"Filter by assignee\")\n      .option(\n        \"--assignee-filter <value>\",\n        \"Filter assignee presence: assigned|unassigned\",\n      )\n      .option(\"--parent <value>\", \"Filter by parent item ID\")\n      .option(\"--sprint <value>\", \"Filter by sprint\")\n      .option(\"--release <value>\", \"Filter by release\");\n    // Hidden pure snake_case underscore-duplicate aliases (kept parse-functional).\n    addHiddenOption(\n      aggregateCommand,\n      \"--include_unparented\",\n      \"Alias for --include-unparented\",\n    );\n    addHiddenOption(\n      aggregateCommand,\n      \"--assignee_filter <value>\",\n      \"Alias for --assignee-filter\",\n    );\n    aggregateCommand.action(runAggregateAction);\n  }\n\n  if (shouldRegister(\"context\")) {\n    const contextCommand = program\n      .command(\"context\")\n      .alias(\"ctx\")\n      .description(\n        \"Show a token-efficient project context snapshot for next-work decisions.\",\n      )\n      .option(\n        \"--date <value>\",\n        \"Anchor date/time for agenda window calculations (ISO/date string or relative)\",\n      )\n      .option(\n        \"--from <value>\",\n        \"Agenda lower bound (ISO/date string or relative)\",\n      )\n      .option(\n        \"--to <value>\",\n        \"Agenda upper bound (ISO/date string or relative)\",\n      )\n      .option(\"--past\", \"Include past agenda entries in bounded windows\")\n      .option(\"--type <value>\", \"Filter by item type\")\n      .option(\"--tag <value>\", \"Filter by tag\")\n      .option(\"--priority <value>\", \"Filter by priority\")\n      .option(\"--assignee <value>\", \"Filter by assignee\")\n      .option(\n        \"--assignee-filter <value>\",\n        \"Filter assignee presence: assigned|unassigned\",\n      )\n      .option(\"--sprint <value>\", \"Filter by sprint\")\n      .option(\"--release <value>\", \"Filter by release\")\n      .option(\n        \"--parent <id>\",\n        \"Scope the snapshot to one item's subtree (the item plus all descendants)\",\n      )\n      .option(\"--limit <n>\", \"Limit focus and agenda rows per section\")\n      .option(\n        \"--after <cursor>\",\n        \"Continue ranked focus after a next_cursor from a previous context response\",\n      )\n      .option(\n        \"--format <value>\",\n        \"Context output format override: markdown|toon|json\",\n      )\n      .option(\n        \"--depth <value>\",\n        \"Context depth: brief|standard|deep|full (full = every section, no per-section cap)\",\n      )\n      .option(\n        \"--section <value...>\",\n        \"Include specific sections (repeatable; overrides --depth)\",\n      )\n      .option(\n        \"--fields <value>\",\n        \"Project focus rows to a comma-separated field subset (e.g. id,title,priority)\",\n      )\n      .option(\n        \"--activity-limit <n>\",\n        \"Limit recent activity entries (default: settings or 10)\",\n      )\n      .option(\n        \"--stale-threshold <value>\",\n        \"Staleness cutoff in days (e.g. 7 or 7d; default: settings or 7)\",\n      )\n      .option(\n        \"--explain-ranking\",\n        \"Include the scorer model, per-signal contributions, and ranked candidate ids\",\n      );\n    // Hidden pure snake_case underscore-duplicate alias (kept parse-functional).\n    addHiddenOption(\n      contextCommand,\n      \"--assignee_filter <value>\",\n      \"Alias for --assignee-filter\",\n    );\n    addHiddenOption(contextCommand, \"--max-items <n>\", \"Alias for --limit\");\n    addHiddenOption(\n      contextCommand,\n      \"--explain_ranking\",\n      \"Alias for --explain-ranking\",\n    );\n    contextCommand.action(runContextAction);\n  }\n\n  if (shouldRegister(\"next\")) {\n    const nextCommand = program\n      .command(\"next\")\n      .description(\n        \"Recommend the next actionable (unblocked, ready) work item with rationale + blocked companion.\",\n      )\n      .option(\"--type <value>\", \"Filter candidate items by type\")\n      .option(\"--tag <value>\", \"Filter candidate items by tag\")\n      .option(\"--priority <value>\", \"Filter candidate items by priority\")\n      .option(\"--assignee <value>\", \"Filter candidate items by assignee\")\n      .option(\n        \"--assignee-filter <value>\",\n        \"Filter assignee presence: assigned|unassigned\",\n      )\n      .option(\"--sprint <value>\", \"Filter candidate items by sprint\")\n      .option(\"--release <value>\", \"Filter candidate items by release\")\n      .option(\n        \"--parent <id>\",\n        \"Scope to one item's subtree (the item plus all descendants)\",\n      )\n      .option(\n        \"--limit <n>\",\n        \"Limit ready rows (default: 5; non-positive falls back to default)\",\n      )\n      .option(\n        \"--blocked-limit <n>\",\n        \"Limit blocked rows (default: same as --limit)\",\n      )\n      .option(\"--ready-only\", \"Omit the blocked companion list\")\n      .option(\n        \"--include-decisions\",\n        \"Include human-gated Decision items in the claimable ready queue\",\n      )\n      .option(\n        \"--format <value>\",\n        \"Next output format override: markdown|toon|json\",\n      )\n      .option(\n        \"--explain-ranking\",\n        \"Include the scorer model, per-signal contributions, and ranked ready ids\",\n      );\n    addHiddenOption(\n      nextCommand,\n      \"--assignee_filter <value>\",\n      \"Alias for --assignee-filter\",\n    );\n    addHiddenOption(\n      nextCommand,\n      \"--blocked_limit <n>\",\n      \"Alias for --blocked-limit\",\n    );\n    addHiddenOption(nextCommand, \"--ready_only\", \"Alias for --ready-only\");\n    addHiddenOption(\n      nextCommand,\n      \"--explain_ranking\",\n      \"Alias for --explain-ranking\",\n    );\n    nextCommand.action(runNextAction);\n  }\n\n  if (shouldRegister(\"search\")) {\n    const searchCommand = program\n      .command(\"search\")\n      .argument(\"<keywords...>\", \"Keyword query tokens\")\n      .description(\n        \"Search items with keyword, semantic, or hybrid retrieval. Inline field:value tokens \" +\n          \"(tag:/status:/type:/priority:) in the query are parsed as filters, e.g. 'auth tag:area:search status:open'.\",\n      )\n      .option(\n        \"--mode <value>\",\n        \"Search mode: keyword|semantic|hybrid (default: keyword)\",\n      )\n      .option(\"--semantic\", \"Shorthand for --mode semantic\")\n      .option(\"--hybrid\", \"Shorthand for --mode hybrid\")\n      .option(\n        \"--match-mode <value>\",\n        \"Token match mode: and|or|exact (default: or with all-terms ranking bonus; and = hard-require every token; exact = exact phrase)\",\n      )\n      .option(\n        \"--min-score <value>\",\n        \"Per-query minimum score threshold (finite number >= 0); overrides settings search.score_threshold for this query only\",\n      )\n      .option(\n        \"--count\",\n        \"Return only the count of matching items (post-filter/threshold, pre-limit); skips hit rows\",\n      )\n      .option(\n        \"--semantic-weight <value>\",\n        \"Override hybrid semantic weight for this query (0..1); invalid values fall back to settings\",\n      )\n      .option(\n        \"--include-linked\",\n        \"Include linked files, docs, and tests in the searchable corpus\",\n      )\n      .option(\n        \"--title-exact\",\n        \"Require exact normalized title match for the full query string\",\n      )\n      .option(\n        \"--phrase-exact\",\n        \"Require exact normalized phrase match in searchable text\",\n      )\n      .option(\n        \"--highlight\",\n        \"Emit per-field matched-text snippets (wrapped in «…») on each hit; off by default\",\n      )\n      .option(\n        \"--status <value>\",\n        \"Filter by status before query (all, open/closed/canceled aliases, or configured status id; CSV)\",\n      )\n      .option(\"--type <value>\", \"Filter by item type\")\n      .option(\"--tag <value>\", \"Filter by tag\")\n      .option(\"--priority <value>\", \"Filter by priority\")\n      .option(\n        \"--deadline-before <value>\",\n        \"Filter by deadline upper bound (ISO/date string or relative)\",\n      )\n      .option(\n        \"--deadline-after <value>\",\n        \"Filter by deadline lower bound (ISO/date string or relative)\",\n      )\n      .option(\n        \"--updated-after <value>\",\n        'Filter by updated_at lower bound: ISO timestamp or signed relative (e.g. \"-2h\"/\"-7d\" for the past)',\n      )\n      .option(\n        \"--updated-before <value>\",\n        \"Filter by updated_at upper bound: ISO timestamp or signed relative (-2h/+1d)\",\n      )\n      .option(\n        \"--created-after <value>\",\n        \"Filter by created_at lower bound: ISO timestamp or signed relative (-2h/+1d)\",\n      )\n      .option(\n        \"--created-before <value>\",\n        \"Filter by created_at upper bound: ISO timestamp or signed relative (-2h/+1d)\",\n      )\n      .option(\"--assignee <value>\", \"Filter by assignee\")\n      .option(\"--sprint <value>\", \"Filter by sprint\")\n      .option(\"--release <value>\", \"Filter by release\")\n      .option(\"--parent <value>\", \"Filter by parent item ID\")\n      .option(\n        \"--compact\",\n        \"Render compact search hits (default; mutually exclusive with --full/--fields)\",\n      )\n      .option(\n        \"--full\",\n        \"Render full search hits with nested item payloads (mutually exclusive with --compact/--fields)\",\n      )\n      .option(\n        \"--fields <value>\",\n        \"Render custom comma-separated search hit fields (mutually exclusive with --compact/--full; valid: --fields id,title,score; invalid: --full --fields id,title)\",\n      )\n      .option(\"--format <value>\", \"Search output format override: json|toon\")\n      .option(\"--limit <n>\", \"Limit returned item count\")\n      .option(\n        \"--after <cursor>\",\n        \"Continue after an opaque next_cursor from a previous search response\",\n      );\n    registerContentAndGovernanceFilters(searchCommand);\n    searchCommand.action(runSearchAction);\n    addHiddenOption(searchCommand, \"--tags <value>\", \"Alias for --tag\");\n  }\n\n  if (shouldRegister(\"eval\")) {\n    program\n      .command(\"eval\")\n      .description(\n        \"Evaluate search relevance against a curated golden-query set: reports nDCG@k, MRR@k, \" +\n          \"precision@k, and recall@k per query plus the macro average. Use --fail-under as a CI gate.\",\n      )\n      .option(\n        \"--mode <value>\",\n        \"Default retrieval mode for queries without their own: keyword|semantic|hybrid (default: keyword)\",\n      )\n      .option(\"--k <n>\", \"Metric cutoff @k (positive integer; default: 10)\")\n      .option(\n        \"--fail-under <value>\",\n        \"Exit non-zero when aggregate nDCG@k falls below this threshold (0..1); CI gate\",\n      )\n      .option(\n        \"--queries <path>\",\n        \"Path to the golden-query JSON file (default: <pmRoot>/search/eval-queries.json)\",\n      )\n      .option(\"--format <value>\", \"Eval output format override: json|toon\")\n      .action(runEvalAction);\n  }\n\n  if (shouldRegister(\"get\")) {\n    const getCommand = program\n      .command(\"get\")\n      .argument(\"<id>\", \"Item id\")\n      .option(\n        \"--depth <value>\",\n        \"Detail depth: brief|standard|deep|full (full aliases deep; default: standard)\",\n      )\n      .option(\n        \"--full\",\n        \"Explicit full item read; equivalent to --depth deep (mutually exclusive with --depth/--fields)\",\n      )\n      .option(\n        \"--fields <value>\",\n        \"Render custom comma-separated item metadata fields (for example: --fields id,title,status,parent,type)\",\n      )\n      .option(\"--tree\", \"Include descendants rooted at the requested item\")\n      .option(\n        \"--tree-depth <n>\",\n        \"Maximum subtree depth for --tree descendants\",\n      )\n      .option(\n        \"--at <version-or-timestamp>\",\n        \"Reconstruct a verified historical item state without mutating it\",\n      )\n      .option(\"--format <value>\", \"Get output format override: json|toon\")\n      .description(\"Show item details by ID.\")\n      .action(runGetAction);\n    addHiddenOption(getCommand, \"--tree_depth <n>\", \"Alias for --tree-depth\");\n  }\n\n  if (shouldRegister(\"history\")) {\n    program\n      .command(\"history\")\n      .argument(\"<id>\", \"Item id\")\n      .option(\"--limit <n>\", \"Return only the latest n history entries\")\n      .option(\n        \"--compact\",\n        \"Condensed output: show entry index, timestamp, op, author, patch count, and changed fields\",\n      )\n      .option(\"--full\", \"Show full history entries with JSON Patch payloads\")\n      .option(\n        \"--diff\",\n        \"Include per-entry field-level before/after value diffs computed by replaying the history chain\",\n      )\n      .option(\n        \"--field <name>\",\n        \"With --diff, show only entries that changed this field (implies --diff)\",\n      )\n      .option(\n        \"--verify\",\n        \"Verify hash chain and replay integrity for the full history stream\",\n      )\n      .option(\"--format <value>\", \"History output format override: json|toon\")\n      .description(\"Show item history entries.\")\n      .action(runHistoryAction);\n  }\n\n  if (shouldRegister(\"activity\")) {\n    program\n      .command(\"activity\")\n      .option(\"--id <value>\", \"Filter by item ID\")\n      .option(\"--op <value>\", \"Filter by history operation\")\n      .option(\"--author <value>\", \"Filter by history author\")\n      .option(\n        \"--from <value>\",\n        \"Lower timestamp bound (ISO/date string or relative)\",\n      )\n      .option(\n        \"--to <value>\",\n        \"Upper timestamp bound (ISO/date string or relative)\",\n      )\n      .option(\"--limit <n>\", \"Return only the latest n activity entries\")\n      .option(\n        \"--compact\",\n        \"Condensed output: show only id, op, ts, author, msg per entry\",\n      )\n      .option(\"--full\", \"Show full activity entries with JSON Patch payloads\")\n      .option(\n        \"--stream [mode]\",\n        \"Emit line-delimited JSON rows (requires --json). Optional mode: rows|ndjson|jsonl\",\n      )\n      .description(\"Show recent activity across items.\")\n      .action(runActivityAction);\n  }\n}\n\n/** Public contract for test only register list query, shared by SDK and presentation-layer consumers. */\nexport const _testOnlyRegisterListQuery = {\n  resolveReadCommandOutputFormat,\n  parseListFormat,\n};\n"],
-  "mappings": ";;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AAaA,SAAS,eAAe,MAAkB;AACxC,QAAM,UAAoB,CAAA;AAC1B,QAAM,OAAO,oBAAI,IAAG;AACpB,aAAW,OAAO,MAAM;AACtB,eAAW,OAAO,OAAO,KAAK,GAAG,GAAG;AAClC,UAAI,CAAC,KAAK,IAAI,GAAG,GAAG;AAClB,aAAK,IAAI,GAAG;AACZ,gBAAQ,KAAK,GAAG;MAClB;IACF;EACF;AACA,SAAO;AACT;AAGA,SAAS,WAAW,OAAc;AAChC,MAAI,UAAU,QAAQ,UAAU,QAAW;AACzC,WAAO;EACT;AACA,MAAI,MAAM,QAAQ,KAAK,GAAG;AACxB,WAAO,MAAM,IAAI,CAAC,UAAU,WAAW,KAAK,CAAC,EAAE,KAAK,GAAG;EACzD;AACA,MAAI,OAAO,UAAU,UAAU;AAC7B,WAAO,KAAK,UAAU,KAAK;EAC7B;AACA,SAAO,OAAO,KAAK;AACrB;AAGA,SAAS,eAAe,OAAa;AACnC,MAAI,WAAW,KAAK,KAAK,GAAG;AAC1B,WAAO,IAAI,MAAM,QAAQ,MAAM,IAAI,CAAC;EACtC;AACA,SAAO;AACT;AAGM,SAAU,gBAAgB,MAAkB;AAChD,MAAI,KAAK,WAAW,GAAG;AACrB,WAAO;EACT;AACA,QAAM,UAAU,eAAe,IAAI;AACnC,QAAM,QAAQ,CAAC,QAAQ,IAAI,CAAC,WAAW,eAAe,MAAM,CAAC,EAAE,KAAK,GAAG,CAAC;AACxE,aAAW,OAAO,MAAM;AACtB,UAAM,KACJ,QACG,IAAI,CAAC,WAAW,eAAe,WAAW,IAAI,MAAM,CAAC,CAAC,CAAC,EACvD,KAAK,GAAG,CAAC;EAEhB;AACA,SAAO,MAAM,KAAK,IAAI;AACxB;AAGM,SAAU,kBAAkB,MAAkB;AAClD,MAAI,KAAK,WAAW,GAAG;AACrB,WAAO;EACT;AACA,QAAM,UAAU,eAAe,IAAI;AACnC,QAAM,QAAQ,KAAK,IAAI,CAAC,QACtB,QAAQ,IAAI,CAAC,WAAW,WAAW,IAAI,MAAM,CAAC,CAAC,CAAC;AAElD,QAAM,SAAS,QAAQ,IAAI,CAAC,QAAQ,UAClC,KAAK,IAAI,OAAO,QAAQ,GAAG,MAAM,IAAI,CAAC,aAAa,SAAS,KAAK,EAAE,MAAM,CAAC,CAAC;AAE7E,QAAM,MAAM,CAAC,OAAe,UAC1B,MAAM,OAAO,OAAO,KAAK,CAAC;AAC5B,QAAM,QAAQ;IACZ,QAAQ,IAAI,CAAC,QAAQ,UAAU,IAAI,QAAQ,KAAK,CAAC,EAAE,KAAK,KAAK;;AAE/D,QAAM,KAAK,OAAO,IAAI,CAAC,UAAU,IAAI,OAAO,KAAK,CAAC,EAAE,KAAK,KAAK,CAAC;AAC/D,aAAW,YAAY,OAAO;AAC5B,UAAM,KAAK,SAAS,IAAI,CAAC,OAAO,UAAU,IAAI,OAAO,KAAK,CAAC,EAAE,KAAK,KAAK,CAAC;EAC1E;AACA,SAAO,MAAM,KAAK,IAAI;AACxB;;;;;;;;;;ACrCA,SAAS,+BACP,aACA,eAA2B;AAE3B,MAAI,CAAC,iBAAiB,cAAc,SAAS,GAAG;AAC9C,WAAO;EACT;AACA,MAAI,gBAAgB,WAAW;AAC7B,WAAO,cAAc,IAAI,SAAS,KAAK,cAAc,IAAI,KAAK;EAChE;AACA,SAAO,cAAc,IAAI,WAAW;AACtC;AAOA,SAAS,gBAAgB,WAAkB;AACzC,MAAI,cAAc,QAAW;AAC3B,WAAO;EACT;AACA,MAAI,OAAO,cAAc,UAAU;AACjC,UAAM,IAAI,WACR,oDACA,UAAU,KAAK;EAEnB;AACA,QAAM,aAAa,UAAU,KAAI,EAAG,YAAW;AAC/C,MACE,eAAe,SACf,eAAe,WACf,eAAe,UACf,eAAe,QACf;AACA,WAAO;EACT;AACA,QAAM,IAAI,WACR,oDACA,UAAU,KAAK;AAEnB;AAEA,SAAS,+BACP,cACA,WACA,eAAkD;AAElD,MAAI,cAAc,QAAW;AAC3B,WAAO;EACT;AACA,MAAI,OAAO,cAAc,UAAU;AACjC,UAAM,IAAI,WACR,GAAG,YAAY,sCACf,UAAU,KAAK;EAEnB;AACA,QAAM,aAAa,UAAU,KAAI,EAAG,YAAW;AAC/C,MAAI,eAAe,UAAU,eAAe,QAAQ;AAClD,UAAM,IAAI,WACR,GAAG,YAAY,sCACf,UAAU,KAAK;EAEnB;AACA,MAAI,cAAc,SAAS,QAAQ,eAAe,QAAQ;AACxD,UAAM,IAAI,WACR,GAAG,YAAY,6CACf,UAAU,KAAK;EAEnB;AACA,SAAO;IACL,GAAG;IACH,MAAM,eAAe;;AAEzB;AAEA,SAAS,0BACP,aACA,cAAiC;AAEjC,MACE,iBAAiB,QACjB,YAAY,gBAAgB,QAC5B,YAAY,YAAY,QACxB,YAAY,UAAU,QACtB,YAAY,SAAS,QACrB,YAAY,WAAW,QACvB;AACA,gBAAY,QAAQ;EACtB;AACF;AAEA,SAAS,oCAAoC,SAAgB;AAC3D,UACG,OAAO,eAAe,iCAAiC,EACvD,OAAO,mBAAmB,qCAAqC,EAC/D,OAAO,eAAe,wCAAwC,EAC9D,OAAO,cAAc,uCAAuC,EAC5D,OAAO,eAAe,wCAAwC,EAC9D,OAAO,kBAAkB,oCAAoC,EAC7D,OAAO,cAAc,wCAAwC,EAC7D,OAAO,cAAc,4CAA4C,EACjE,OACC,wBACA,6DAA6D,EAE9D,OAAO,cAAc,oCAAoC,EACzD,OAAO,kBAAkB,wCAAwC,EACjE,OAAO,cAAc,2CAA2C,EAChE,OAAO,0BAA0B,sBAAsB,EACvD,OAAO,aAAa,0CAA0C,EAC9D,OAAO,yBAAyB,qBAAqB,EACrD,OAAO,cAAc,2CAA2C,EAChE,OAAO,iBAAiB,uCAAuC,EAC/D,OAAO,aAAa,2CAA2C,EAC/D,OAAO,gBAAgB,oCAAoC,EAC3D,OACC,uBACA,8DAA8D,EAE/D,OAAO,6BAA6B,kCAAkC,EACtE,OAAO,yBAAyB,8BAA8B,EAC9D,OAAO,+BAA+B,oCAAoC,EAC1E,OAAO,2BAA2B,gCAAgC,EAClE,OAAO,4BAA4B,iCAAiC;AACzE;AAEA,eAAe,yBAAyB,QAOvC;AACC,QAAM,gBAAgB,iBAAiB,OAAO,aAAa;AAC3D,QAAM,YAAY,KAAK,IAAG;AAC1B,QAAM,cAAc,qBAAqB,OAAO,OAAO;AACvD,4BAA0B,aAAa,OAAO,YAAY;AAC1D,MAAI,OAAO;AAAiB,gBAAY,kBAAkB;AAC1D,QAAM,SAAS,MAAM,QAAQ,OAAO,QAAQ,aAAa,aAAa;AACtE,QAAM,aAAa,OAAO,QAAQ,WAAW;AAC7C,QAAM,aAAa,gBAAgB,OAAO,QAAQ,MAAM;AACxD,QAAM,UAAU,eAAe,SAAS,eAAe;AACvD,QAAM,kBACJ,eAAe,UAAU,eAAe,SACpC,+BACE,QACA,OAAO,QAAQ,QACf,aAAa,IAEf;AACN,MAAI,cAAc,CAAC,gBAAgB,MAAM;AACvC,UAAM,IAAI,WACR,yCACA,UAAU,KAAK;EAEnB;AACA,MAAI,WAAW,YAAY;AACzB,UAAM,IAAI,WACR,8EACA,UAAU,KAAK;EAEnB;AACA,MAAI,SAAS;AACX,UAAM,OAAO,OAAO;AACpB,UAAM,WACJ,eAAe,QAAQ,gBAAgB,IAAI,IAAI,kBAAkB,IAAI;AACvE,QAAI,CAAC,gBAAgB,SAAS,SAAS,SAAS,GAAG;AACjD,kBAAY,GAAG,QAAQ;CAAI;IAC7B;EACF,WAAW,YAAY;AACrB,wBAAoB,OAAO,MAAM,QAAQ,eAAe;EAC1D,OAAO;AACL,gBAAY,QAAQ,eAAe;EACrC;AACA,MAAI,cAAc,SAAS;AACzB,eACE,mBAAmB,OAAO,IAAI,YAAY,KAAK,IAAG,IAAK,SAAS,EAAE;EAEtE;AACF;AAWA,SAAS,oBACP,SACA,YAAiC;AAEjC,QAAM,EACJ,MACA,aACA,QACA,iBACA,mBACA,aAAY,IACV;AACJ,QAAM,UAAU,QAAQ,QAAQ,IAAI,EAAE,YAAY,WAAW;AAC7D,MAAI,mBAAmB;AACrB,YAAQ,OACN,oBACA,sDAAsD;EAE1D;AACA,UACG,OAAO,kBAAkB,qBAAqB,EAC9C,OAAO,iBAAiB,eAAe,EACvC,OAAO,sBAAsB,oBAAoB,EACjD,OACC,6BACA,8DAA8D,EAE/D,OACC,4BACA,8DAA8D,EAE/D,OAAO,WAAW,oDAAoD,EACtE,OAAO,YAAY,4CAA4C,EAC/D,OACC,2BACA,iKAA4J,EAE7J,OACC,4BACA,8EAA8E,EAE/E,OACC,2BACA,8EAA8E,EAE/E,OACC,4BACA,8EAA8E,EAE/E,OACC,iBACA,6DAA6D,EAE9D,OAAO,sBAAsB,oBAAoB,EACjD,OACC,6BACA,+CAA+C,EAEhD,OAAO,oBAAoB,0BAA0B,EACrD,OAAO,oBAAoB,kBAAkB,EAC7C,OAAO,qBAAqB,mBAAmB,EAC/C,OACC,uBACA,6CAA6C,EAE9C,OACC,8BACA,2CAA2C,EAE5C,OACC,+BACA,6CAA6C,EAE9C,OACC,6BACA,4EAA4E,EAE7E,OAAO,eAAe,2BAA2B,EACjD,OACC,gBACA,wDAAwD,EAEzD,OACC,oBACA,oEAAoE,EAErE,OACC,iBACA,iEAAiE,EAElE,OAAO,kBAAkB,6CAA6C,EACtE,OACC,aACA,yFAAyF,EAE1F,OACC,WACA,yHAAyH,EAE1H,OACC,UACA,yFAAyF,EAE1F,OACC,oBACA,wHAAwH,EAEzH,OACC,kBACA,8FAA8F,EAE/F,OAAO,mBAAmB,wCAAwC,EAClE,OAAO,UAAU,wCAAwC,EACzD,OACC,oBACA,8DAA8D,EAE/D,OACC,oBACA,qFAAqF,EAEtF,OAAO,YAAY,iDAAiD;AACvE,sCAAoC,OAAO;AAC3C,UAAQ,OAAO,OAAO,SAAkC,kBAAiB;AACvE,UAAM,yBAAyB;MAC7B;MACA;MACA;MACA;MACA;MACA;KACD;EACH,CAAC;AAED,kBAAgB,SAAS,SAAS,yBAAyB;AAE3D,kBAAgB,SAAS,kBAAkB,iBAAiB;AAC5D,kBACE,SACA,6BACA,6BAA6B;AAE/B,kBAAgB,SAAS,oBAAoB,wBAAwB;AAErE,kBACE,SACA,6BACA,sCAAsC;AAE1C;AAEA,eAAe,mBACb,SACA,SAAgB;AAEhB,QAAM,gBAAgB,iBAAiB,OAAO;AAC9C,QAAM,YAAY,KAAK,IAAG;AAC1B,QAAM,SAAS,MAAM,aACnB,0BAA0B,OAAO,GACjC,aAAa;AAEf,cAAY,QAAQ,aAAa;AACjC,MAAI,cAAc,SAAS;AACzB,eAAW,qCAAqC,KAAK,IAAG,IAAK,SAAS,EAAE;EAC1E;AACF;AAEA,eAAe,iBACb,SACA,eAAsB;AAEtB,QAAM,gBAAgB,iBAAiB,aAAa;AACpD,QAAM,YAAY,KAAK,IAAG;AAC1B,QAAM,aAAa,wBAAwB,OAAO;AAClD,QAAM,SAAS,MAAM,WAAW,YAAY,aAAa;AACzD,QAAM,eAAe,2BAA2B,YAAY,aAAa;AACzE,MAAI,iBAAiB,YAAY;AAC/B,QAAI,CAAC,cAAc,OAAO;AACxB,kBAAY,GAAG,sBAAsB,MAAM,CAAC;CAAI;IAClD;EACF,OAAO;AACL,gBAAY,QAAQ;MAClB,GAAG;MACH,MAAM,iBAAiB;KACxB;EACH;AACA,MAAI,cAAc,SAAS;AACzB,eAAW,mCAAmC,KAAK,IAAG,IAAK,SAAS,EAAE;EACxE;AACF;AAEA,eAAe,cACb,SACA,eAAsB;AAEtB,QAAM,gBAAgB,iBAAiB,aAAa;AACpD,QAAM,YAAY,KAAK,IAAG;AAC1B,QAAM,cAAc,qBAAqB,OAAO;AAChD,QAAM,SAAS,MAAM,QAAQ,aAAa,aAAa;AACvD,QAAM,eAAe,wBAAwB,aAAa,aAAa;AACvE,MAAI,iBAAiB,YAAY;AAC/B,QAAI,CAAC,cAAc,OAAO;AACxB,kBAAY,GAAG,mBAAmB,MAAM,CAAC;CAAI;IAC/C;EACF,OAAO;AACL,gBAAY,QAAQ,EAAE,GAAG,eAAe,MAAM,iBAAiB,OAAM,CAAE;EACzE;AACA,MAAI,cAAc,SAAS;AACzB,eAAW,gCAAgC,KAAK,IAAG,IAAK,SAAS,EAAE;EACrE;AACF;AAEA,eAAe,gBACb,UACA,SACA,SAAgB;AAEhB,QAAM,gBAAgB,iBAAiB,OAAO;AAC9C,QAAM,YAAY,KAAK,IAAG;AAC1B,QAAM,gBAAgB,uBAAuB,OAAO;AACpD,QAAM,SAAS,MAAM,UACnB,6BAA6B,QAAQ,GACrC;IACE,GAAG;IACH,MACE,OAAO,cAAc,SAAS,YAC9B,cAAc,KAAK,KAAI,EAAG,SAAS,IAC/B,cAAc,OACd;KAER,aAAa;AAEf,cACE,QACA,+BAA+B,UAAU,QAAQ,QAAQ,aAAa,CAAC;AAEzE,MAAI,cAAc,SAAS;AACzB,eAAW,kCAAkC,KAAK,IAAG,IAAK,SAAS,EAAE;EACvE;AACF;AAEA,eAAe,cACb,SACA,SAAgB;AAEhB,QAAM,gBAAgB,iBAAiB,OAAO;AAC9C,QAAM,YAAY,KAAK,IAAG;AAC1B,QAAM,SAAS,MAAM,QACnB;IACE,MAAM,OAAO,QAAQ,SAAS,WAAW,QAAQ,OAAO;IACxD,GAAG,OAAO,QAAQ,MAAM,WAAW,QAAQ,IAAI;IAC/C,WACE,OAAO,QAAQ,cAAc,WAAW,QAAQ,YAAY;IAC9D,SACE,OAAO,QAAQ,YAAY,WAAW,QAAQ,UAAU;IAC1D,QAAQ,OAAO,QAAQ,WAAW,WAAW,QAAQ,SAAS;KAEhE,aAAa;AAEf,cACE,QACA,+BAA+B,QAAQ,QAAQ,QAAQ,aAAa,CAAC;AAEvE,MAAI,cAAc,SAAS;AACzB,eAAW,gCAAgC,KAAK,IAAG,IAAK,SAAS,EAAE;EACrE;AACA,MAAI,CAAC,OAAO,QAAQ;AAClB,UAAM,IAAI,WACR,oCAAoC,OAAO,CAAC,IAAI,OAAO,UAAU,IAAI,0BAA0B,OAAO,UAAU,IAChH,UAAU,eAAe;EAE7B;AACF;AAEA,eAAe,aACb,IACA,SACA,SAAgB;AAEhB,QAAM,gBAAgB,iBAAiB,OAAO;AAC9C,QAAM,YAAY,KAAK,IAAG;AAC1B,QAAM,SAAS,MAAM,OAAO,IAAI,eAAe;IAC7C,OAAO,OAAO,QAAQ,UAAU,WAAW,QAAQ,QAAQ;IAC3D,QAAQ,OAAO,QAAQ,WAAW,WAAW,QAAQ,SAAS;IAC9D,MAAM,QAAQ,QAAQ,IAAI;IAC1B,MAAM,QAAQ,SAAS;IACvB,WACE,OAAO,QAAQ,cAAc,WACzB,QAAQ,YACR,OAAO,QAAQ,eAAe,WAC5B,QAAQ,aACR;IACR,IAAI,OAAO,QAAQ,OAAO,WAAW,QAAQ,KAAK;GACnD;AACD,cACE,QACA,+BAA+B,OAAO,QAAQ,QAAQ,aAAa,CAAC;AAEtE,MAAI,cAAc,SAAS;AACzB,eAAW,+BAA+B,KAAK,IAAG,IAAK,SAAS,EAAE;EACpE;AACF;AAEA,eAAe,iBACb,IACA,SACA,SAAgB;AAEhB,QAAM,gBAAgB,iBAAiB,OAAO;AAC9C,QAAM,YAAY,KAAK,IAAG;AAC1B,MAAI,QAAQ,YAAY,QAAQ,QAAQ,SAAS,MAAM;AACrD,UAAM,IAAI,WACR,sFACA,UAAU,KAAK;EAEnB;AACA,QAAM,QAAQ,OAAO,QAAQ,UAAU,WAAW,QAAQ,QAAQ;AAClE,QAAM,SAAS,MAAM,WACnB,IACA;IACE,OAAO,OAAO,QAAQ,UAAU,WAAW,QAAQ,QAAQ;IAC3D,SAAS,QAAQ,SAAS,OAAO,QAAQ;IACzC,MAAM,QAAQ,QAAQ,IAAI,KAAK,UAAU;IACzC;IACA,QAAQ,QAAQ,QAAQ,MAAM;KAEhC,aAAa;AAEf,cACE,QACA,+BAA+B,WAAW,QAAQ,QAAQ,aAAa,CAAC;AAE1E,MAAI,cAAc,SAAS;AACzB,eAAW,mCAAmC,KAAK,IAAG,IAAK,SAAS,EAAE;EACxE;AACF;AAEA,eAAe,kBACb,SACA,SAAgB;AAEhB,QAAM,gBAAgB,iBAAiB,OAAO;AAC9C,QAAM,YAAY,KAAK,IAAG;AAC1B,MAAI,QAAQ,YAAY,QAAQ,QAAQ,SAAS,MAAM;AACrD,UAAM,IAAI,WACR,uFACA,UAAU,KAAK;EAEnB;AACA,QAAM,aAAa,yBAAyB,OAAO;AACnD,QAAM,SAAS,MAAM,YAAY,YAAY,aAAa;AAC1D,QAAM,aAAa,0BAA0B,QAAQ,MAAM;AAC3D,MAAI,cAAc,CAAC,cAAc,MAAM;AACrC,UAAM,IAAI,WACR,yCACA,UAAU,KAAK;EAEnB;AACA,MAAI,YAAY;AACd,4BAAwB,QAAQ,YAAY,aAAa;EAC3D,OAAO;AACL,gBAAY,QAAQ,aAAa;EACnC;AACA,MAAI,cAAc,SAAS;AACzB,eAAW,oCAAoC,KAAK,IAAG,IAAK,SAAS,EAAE;EACzE;AACF;AAGM,SAAU,0BACd,SACA,SAA0C;AAE1C,QAAM,gBAAgB,SAAS;AAC/B,QAAM,iBAAiB,CAAC,gBACtB,+BAA+B,aAAa,aAAa;AAC3D,QAAM,yBAAkD;IACtD;MACE,MAAM;MACN,aAAa;MACb,iBAAiB;MACjB,mBAAmB;MACnB,cAAc;;IAEhB;MACE,MAAM;MACN,aAAa;MACb,iBAAiB;MACjB,mBAAmB;;IAErB;MACE,MAAM;MACN,aAAa;MACb,QAAQ;;IAEV;MACE,MAAM;MACN,aAAa;MACb,QAAQ;MACR,iBAAiB;MACjB,mBAAmB;MACnB,cAAc;;IAEhB;MACE,MAAM;MACN,aAAa;MACb,QAAQ;MACR,iBAAiB;MACjB,mBAAmB;MACnB,cAAc;;IAEhB;MACE,MAAM;MACN,aAAa;MACb,QAAQ;MACR,iBAAiB;MACjB,mBAAmB;MACnB,cAAc;;IAEhB;MACE,MAAM;MACN,aAAa;MACb,QAAQ;;IAEV;MACE,MAAM;MACN,aAAa;MACb,QAAQ;;;AAGZ,aAAW,cAAc,wBAAwB;AAC/C,QAAI,eAAe,WAAW,IAAI,GAAG;AACnC,0BAAoB,SAAS,UAAU;IACzC;EACF;AAEA,MAAI,eAAe,WAAW,GAAG;AAC/B,UAAM,mBAAmB,QACtB,QAAQ,WAAW,EACnB,YAAY,uDAAuD,EACnE,OACC,sBACA,uGAAuG,EAExG,OAAO,WAAW,0CAA0C,EAC5D,OACC,gBACA,uEAAuE,EAExE,OAAO,iBAAiB,+BAA+B,EACvD,OAAO,iBAAiB,mCAAmC,EAC3D,OACC,wBACA,iDAAiD,EAElD,OAAO,oBAAoB,uBAAuB,EAClD,OAAO,kBAAkB,qBAAqB,EAC9C,OAAO,iBAAiB,eAAe,EACvC,OAAO,sBAAsB,oBAAoB,EACjD,OACC,6BACA,8DAA8D,EAE/D,OACC,4BACA,8DAA8D,EAE/D,OAAO,sBAAsB,oBAAoB,EACjD,OACC,6BACA,+CAA+C,EAEhD,OAAO,oBAAoB,0BAA0B,EACrD,OAAO,oBAAoB,kBAAkB,EAC7C,OAAO,qBAAqB,mBAAmB;AAElD,oBACE,kBACA,wBACA,gCAAgC;AAElC,oBACE,kBACA,6BACA,6BAA6B;AAE/B,qBAAiB,OAAO,kBAAkB;EAC5C;AAEA,MAAI,eAAe,SAAS,GAAG;AAC7B,UAAM,iBAAiB,QACpB,QAAQ,SAAS,EACjB,MAAM,KAAK,EACX,YACC,0EAA0E,EAE3E,OACC,kBACA,+EAA+E,EAEhF,OACC,kBACA,kDAAkD,EAEnD,OACC,gBACA,kDAAkD,EAEnD,OAAO,UAAU,gDAAgD,EACjE,OAAO,kBAAkB,qBAAqB,EAC9C,OAAO,iBAAiB,eAAe,EACvC,OAAO,sBAAsB,oBAAoB,EACjD,OAAO,sBAAsB,oBAAoB,EACjD,OACC,6BACA,+CAA+C,EAEhD,OAAO,oBAAoB,kBAAkB,EAC7C,OAAO,qBAAqB,mBAAmB,EAC/C,OACC,iBACA,0EAA0E,EAE3E,OAAO,eAAe,yCAAyC,EAC/D,OACC,oBACA,4EAA4E,EAE7E,OACC,oBACA,oDAAoD,EAErD,OACC,mBACA,oFAAoF,EAErF,OACC,wBACA,2DAA2D,EAE5D,OACC,oBACA,+EAA+E,EAEhF,OACC,wBACA,yDAAyD,EAE1D,OACC,6BACA,iEAAiE,EAElE,OACC,qBACA,8EAA8E;AAGlF,oBACE,gBACA,6BACA,6BAA6B;AAE/B,oBAAgB,gBAAgB,mBAAmB,mBAAmB;AACtE,oBACE,gBACA,qBACA,6BAA6B;AAE/B,mBAAe,OAAO,gBAAgB;EACxC;AAEA,MAAI,eAAe,MAAM,GAAG;AAC1B,UAAM,cAAc,QACjB,QAAQ,MAAM,EACd,YACC,gGAAgG,EAEjG,OAAO,kBAAkB,gCAAgC,EACzD,OAAO,iBAAiB,+BAA+B,EACvD,OAAO,sBAAsB,oCAAoC,EACjE,OAAO,sBAAsB,oCAAoC,EACjE,OACC,6BACA,+CAA+C,EAEhD,OAAO,oBAAoB,kCAAkC,EAC7D,OAAO,qBAAqB,mCAAmC,EAC/D,OACC,iBACA,6DAA6D,EAE9D,OACC,eACA,mEAAmE,EAEpE,OACC,uBACA,+CAA+C,EAEhD,OAAO,gBAAgB,iCAAiC,EACxD,OACC,uBACA,iEAAiE,EAElE,OACC,oBACA,iDAAiD,EAElD,OACC,qBACA,0EAA0E;AAE9E,oBACE,aACA,6BACA,6BAA6B;AAE/B,oBACE,aACA,uBACA,2BAA2B;AAE7B,oBAAgB,aAAa,gBAAgB,wBAAwB;AACrE,oBACE,aACA,qBACA,6BAA6B;AAE/B,gBAAY,OAAO,aAAa;EAClC;AAEA,MAAI,eAAe,QAAQ,GAAG;AAC5B,UAAM,gBAAgB,QACnB,QAAQ,QAAQ,EAChB,SAAS,iBAAiB,sBAAsB,EAChD,YACC,iMAC+G,EAEhH,OACC,kBACA,yDAAyD,EAE1D,OAAO,cAAc,+BAA+B,EACpD,OAAO,YAAY,6BAA6B,EAChD,OACC,wBACA,iIAAiI,EAElI,OACC,uBACA,uHAAuH,EAExH,OACC,WACA,4FAA4F,EAE7F,OACC,6BACA,6FAA6F,EAE9F,OACC,oBACA,gEAAgE,EAEjE,OACC,iBACA,gEAAgE,EAEjE,OACC,kBACA,0DAA0D,EAE3D,OACC,eACA,8FAAmF,EAEpF,OACC,oBACA,iGAAiG,EAElG,OAAO,kBAAkB,qBAAqB,EAC9C,OAAO,iBAAiB,eAAe,EACvC,OAAO,sBAAsB,oBAAoB,EACjD,OACC,6BACA,8DAA8D,EAE/D,OACC,4BACA,8DAA8D,EAE/D,OACC,2BACA,oGAAoG,EAErG,OACC,4BACA,8EAA8E,EAE/E,OACC,2BACA,8EAA8E,EAE/E,OACC,4BACA,8EAA8E,EAE/E,OAAO,sBAAsB,oBAAoB,EACjD,OAAO,oBAAoB,kBAAkB,EAC7C,OAAO,qBAAqB,mBAAmB,EAC/C,OAAO,oBAAoB,0BAA0B,EACrD,OACC,aACA,+EAA+E,EAEhF,OACC,UACA,gGAAgG,EAEjG,OACC,oBACA,+JAA+J,EAEhK,OAAO,oBAAoB,0CAA0C,EACrE,OAAO,eAAe,2BAA2B,EACjD,OACC,oBACA,sEAAsE;AAE1E,wCAAoC,aAAa;AACjD,kBAAc,OAAO,eAAe;AACpC,oBAAgB,eAAe,kBAAkB,iBAAiB;EACpE;AAEA,MAAI,eAAe,MAAM,GAAG;AAC1B,YACG,QAAQ,MAAM,EACd,YACC,iLAC8F,EAE/F,OACC,kBACA,kGAAkG,EAEnG,OAAO,WAAW,kDAAkD,EACpE,OACC,wBACA,gFAAgF,EAEjF,OACC,oBACA,iFAAiF,EAElF,OAAO,oBAAoB,wCAAwC,EACnE,OAAO,aAAa;EACzB;AAEA,MAAI,eAAe,KAAK,GAAG;AACzB,UAAM,aAAa,QAChB,QAAQ,KAAK,EACb,SAAS,QAAQ,SAAS,EAC1B,OACC,mBACA,+EAA+E,EAEhF,OACC,UACA,gGAAgG,EAEjG,OACC,oBACA,wGAAwG,EAEzG,OAAO,UAAU,kDAAkD,EACnE,OACC,oBACA,8CAA8C,EAE/C,OACC,+BACA,kEAAkE,EAEnE,OAAO,oBAAoB,uCAAuC,EAClE,YAAY,0BAA0B,EACtC,OAAO,YAAY;AACtB,oBAAgB,YAAY,oBAAoB,wBAAwB;EAC1E;AAEA,MAAI,eAAe,SAAS,GAAG;AAC7B,YACG,QAAQ,SAAS,EACjB,SAAS,QAAQ,SAAS,EAC1B,OAAO,eAAe,0CAA0C,EAChE,OACC,aACA,4FAA4F,EAE7F,OAAO,UAAU,oDAAoD,EACrE,OACC,UACA,gGAAgG,EAEjG,OACC,kBACA,yEAAyE,EAE1E,OACC,YACA,oEAAoE,EAErE,OAAO,oBAAoB,2CAA2C,EACtE,YAAY,4BAA4B,EACxC,OAAO,gBAAgB;EAC5B;AAEA,MAAI,eAAe,UAAU,GAAG;AAC9B,YACG,QAAQ,UAAU,EAClB,OAAO,gBAAgB,mBAAmB,EAC1C,OAAO,gBAAgB,6BAA6B,EACpD,OAAO,oBAAoB,0BAA0B,EACrD,OACC,kBACA,qDAAqD,EAEtD,OACC,gBACA,qDAAqD,EAEtD,OAAO,eAAe,2CAA2C,EACjE,OACC,aACA,+DAA+D,EAEhE,OAAO,UAAU,qDAAqD,EACtE,OACC,mBACA,mFAAmF,EAEpF,YAAY,oCAAoC,EAChD,OAAO,iBAAiB;EAC7B;AACF;AAGO,IAAM,6BAA6B;EACxC;EACA;;",
-  "names": []
-}