@unbrained/pm-cli 2026.7.17 → 2026.7.18

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

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

package/dist/cli-bundle/chunks/{chunk-SIJV365F.js → chunk-NCVT6XEL.js}

@@ -1,5 +1,5 @@
 
-!function(){try{var e="undefined"!=typeof window?window:"undefined"!=typeof global?global:"undefined"!=typeof globalThis?globalThis:"undefined"!=typeof self?self:{},n=(new e.Error).stack;n&&(e._sentryDebugIds=e._sentryDebugIds||{},e._sentryDebugIds[n]="320f8a45-feb4-5808-a6cf-bd6f377c1dc6")}catch(e){}}();
+!function(){try{var e="undefined"!=typeof window?window:"undefined"!=typeof global?global:"undefined"!=typeof globalThis?globalThis:"undefined"!=typeof self?self:{},n=(new e.Error).stack;n&&(e._sentryDebugIds=e._sentryDebugIds||{},e._sentryDebugIds[n]="45d590f6-2f18-5a57-84f7-e5336081726b")}catch(e){}}();
 import {
   createQueryFingerprint,
   encodeQueryCursor,
@@ -10,6 +10,9 @@ import {
   itemMatchesMissingMetadata,
   lifecycleClassifierFromStatusRegistry
 } from "./chunk-CKX4WOPC.js";
+import {
+  collectDependencyBlockedIds
+} from "./chunk-YFE7JHX3.js";
 import {
   HEAVY_METADATA_KEYS,
   coerceRuntimeFieldValue,
@@ -544,6 +547,9 @@ function buildCompactListFilterSummary(params) {
   if (filtersStatus !== null) {
     filters.status = filtersStatus;
   }
+  if (options.dependencyBlocked === true) {
+    filters.blocked_semantics = "status_or_dependency";
+  }
   applyFilterValueEcho(filters, options, COMPACT_LIST_VALUE_FILTER_ECHO_ENTRIES);
   applyListWindowFilterEcho(filters, options);
   if (options.filterAcMissing === true) {
@@ -1157,6 +1163,9 @@ function buildListCursorFingerprint(status, options, ordering) {
 function buildVerboseListFilters(params) {
   const { filtersStatus, options, noTruncate, treeEnabled, treeDepth, sortField, sortOrder, runtimeFieldFilters } = params;
   const filters = { status: filtersStatus };
+  if (options.dependencyBlocked === true) {
+    filters.blocked_semantics = "status_or_dependency";
+  }
   const optionRecord = options;
   for (const entry of VERBOSE_LIST_VALUE_FILTER_ECHO_ENTRIES) {
     filters[entry.summaryKey] = optionRecord[entry.optionKey] ?? null;
@@ -1187,7 +1196,11 @@ async function runList(status, options, global) {
   const ordering = resolveListOrderingOptions(options);
   const statusSelection = resolveListStatusSelection(status, options, runtime.statusRegistry);
   const filtered = applyFilters(items, statusSelection.resolvedStatus, statusSelection.effectiveOptions, runtime.typeRegistry, runtime.statusRegistry, runtime.runtimeFieldFilters);
-  const sorted = sortItems(filtered, ordering.sortField, ordering.sortOrder, runtime.statusRegistry);
+  const scoped = options.dependencyBlocked === true ? (() => {
+    const blockedIds = collectDependencyBlockedIds(items, runtime.statusRegistry);
+    return filtered.filter((item) => blockedIds.has(item.id.trim().toLowerCase()));
+  })() : filtered;
+  const sorted = sortItems(scoped, ordering.sortField, ordering.sortOrder, runtime.statusRegistry);
   const ordered = ordering.treeEnabled ? orderItemsAsTree(sorted, ordering.parentRoot, ordering.treeDepth) : sorted;
   const noTruncate = options.noTruncate === true;
   const page = pageAndProjectListItems(ordered, options, runtime.projection, ordering.treeEnabled, buildListCursorFingerprint(statusSelection.filtersStatus, options, ordering));
@@ -1259,6 +1272,6 @@ export {
   buildGovernanceMissingFilterEcho,
   runList
 };
-//# sourceMappingURL=chunk-SIJV365F.js.map
+//# sourceMappingURL=chunk-NCVT6XEL.js.map
 
-//# debugId=320f8a45-feb4-5808-a6cf-bd6f377c1dc6
+//# debugId=45d590f6-2f18-5a57-84f7-e5336081726b

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

@@ -0,0 +1 @@
+{"version":3,"sources":["../../../../../../../../sdk/query/parsers.ts","../../../../../../../../core/item/status-filter.ts","../../../../../../../../core/schema/runtime-field-filters.ts","../../../../../../../../core/governance/content-fields.ts","../../../../../../../../sdk/query/list.ts"],"sourcesContent":["/**\n * @module sdk/query/parsers\n *\n * Provides shared query parsers for SDK and CLI runtime consumers.\n */\nimport { PmCliError } from \"../../core/shared/errors.js\";\nimport { EXIT_CODE } from \"../../core/shared/constants.js\";\nexport { parseLimit } from \"../../core/shared/numeric-parsers.js\";\nimport {\n  resolveTypeName,\n  type ItemTypeRegistry,\n} from \"../../core/item/type-registry.js\";\nimport type { ItemType } from \"../../types/index.js\";\n\n/** Implements parse integer limit for the public runtime surface of this module. */\nexport function parseIntegerLimit(\n  raw: string | undefined,\n  label = \"--limit\",\n): number | undefined {\n  if (raw === undefined) return undefined;\n  const normalized = String(raw).trim();\n  const parsed = normalized.length === 0 ? Number.NaN : Number(normalized);\n  if (!Number.isInteger(parsed) || parsed < 0) {\n    throw new PmCliError(\n      `${label} must be a non-negative integer`,\n      EXIT_CODE.USAGE,\n    );\n  }\n  return parsed;\n}\n\n/** Implements parse priority for the public runtime surface of this module. */\nexport function parsePriority(\n  raw: string | undefined,\n  label = \"--priority\",\n): number | undefined {\n  if (raw === undefined) return undefined;\n  const normalized = String(raw).trim();\n  const parsed = normalized.length === 0 ? Number.NaN : Number(normalized);\n  if (!Number.isInteger(parsed) || parsed < 0 || parsed > 4) {\n    throw new PmCliError(`${label} filter must be 0..4`, EXIT_CODE.USAGE);\n  }\n  return parsed;\n}\n\n/** Implements parse type for the public runtime surface of this module. */\nexport function parseType(\n  raw: string | undefined,\n  typeRegistry: ItemTypeRegistry,\n  label = \"--type\",\n): ItemType | undefined {\n  if (raw === undefined) return undefined;\n  const parsed = resolveTypeName(raw, typeRegistry);\n  if (!parsed) {\n    throw new PmCliError(\n      `${label} filter must be one of ${typeRegistry.types.join(\"|\")}`,\n      EXIT_CODE.USAGE,\n    );\n  }\n  return parsed;\n}\n","/**\n * @module core/item/status-filter\n *\n * Defines item parsing, formatting, and lifecycle helpers for Status Filter.\n */\nimport { EXIT_CODE } from \"../shared/constants.js\";\nimport { PmCliError } from \"../shared/errors.js\";\nimport { levenshteinDistanceWithinLimit } from \"../shared/levenshtein.js\";\nimport type { RuntimeStatusRegistry } from \"../schema/runtime-schema.js\";\nimport type { ItemStatus } from \"../../types/index.js\";\nimport { normalizeStatusInput } from \"./status.js\";\n\n// Workflow-group aliases shared by every status-filter consumer so that the\n// agent-friendly `open`/`closed`/`canceled` shorthands resolve to whatever the\n// runtime workflow has configured as its open/close/cancel anchors, rather than\n// hardcoding the built-in status ids. `cancelled` is accepted as a spelling\n// variant of `canceled`.\nconst STATUS_GROUP_ALIASES: Readonly<\n  Record<string, \"open_status\" | \"close_status\" | \"canceled_status\">\n> = {\n  open: \"open_status\",\n  closed: \"close_status\",\n  canceled: \"canceled_status\",\n  cancelled: \"canceled_status\",\n};\n\nconst STATUS_ALL_SENTINEL = \"all\";\n\n/** Return true when a status-filter input is the standalone all-status sentinel. */\nexport function isStatusAllFilterInput(raw: unknown): boolean {\n  if (typeof raw !== \"string\") {\n    return false;\n  }\n  const tokens = raw\n    .split(\",\")\n    .map((entry) => entry.trim().toLowerCase())\n    .filter((entry) => entry.length > 0);\n  return tokens.length === 1 && tokens[0] === STATUS_ALL_SENTINEL;\n}\n\n/**\n * Resolve a single status-filter token to a concrete runtime status id.\n *\n * Returns `undefined` when the token is not a recognized workflow-group alias\n * (open/closed/canceled) and does not normalize to a known registry status.\n * Callers decide whether an unrecognized token is an error (strict mode) or is\n * passed through verbatim (lenient mode) — see {@link parseStatusFilterCsv}.\n */\nexport function resolveStatusFilterToken(\n  token: string,\n  registry: RuntimeStatusRegistry,\n): ItemStatus | undefined {\n  const trimmed = token.trim().toLowerCase();\n  if (trimmed.length === 0) {\n    return undefined;\n  }\n  const group = STATUS_GROUP_ALIASES[trimmed];\n  if (group) {\n    return registry[group] as ItemStatus;\n  }\n  return normalizeStatusInput(token, registry);\n}\n\nfunction collectStatusSuggestionCandidates(\n  registry: RuntimeStatusRegistry,\n): string[] {\n  const candidates = new Set<string>(Object.keys(STATUS_GROUP_ALIASES));\n  for (const definition of registry.definitions) {\n    candidates.add(definition.id);\n    for (const alias of definition.aliases) {\n      candidates.add(alias);\n    }\n  }\n  return [...candidates];\n}\n\nfunction suggestClosestStatus(\n  value: string,\n  registry: RuntimeStatusRegistry,\n): string | undefined {\n  // Only ever called for an unresolved, already-non-empty token (parseStatusFilterCsv\n  // filters blanks first), so no empty-input guard is needed here.\n  const normalized = value.trim().toLowerCase();\n  let best: string | undefined;\n  let bestDistance = Number.POSITIVE_INFINITY;\n  for (const candidate of collectStatusSuggestionCandidates(registry)) {\n    const distance = levenshteinDistanceWithinLimit(\n      normalized,\n      candidate.toLowerCase(),\n      2,\n    );\n    if (distance !== null && distance < bestDistance) {\n      best = candidate;\n      bestDistance = distance;\n    }\n  }\n  return best;\n}\n\n/** Documents the parse status filter options payload exchanged by command, SDK, and package integrations. */\nexport interface ParseStatusFilterOptions {\n  /** When true, an unrecognized token throws a USAGE error with a did-you-mean hint. When false (default), an unrecognized token is passed through verbatim so custom/unknown statuses still compare against item values by their raw string — preserving the long-standing lenient `pm list` behavior. */\n  strict?: boolean;\n  /** Flag label used in error messages (default: \"--status\"). */\n  flagLabel?: string;\n}\n\n/** Parse a comma-separated status filter into a de-duplicated list of concrete status ids. A standalone `all` sentinel intentionally resolves to no filter so duplicate-discovery loops can search every lifecycle bucket with the same `--status` flag shape. Shared by `pm list` (lenient) and `pm search` (strict, with a did-you-mean hint on typos) so both surfaces resolve the open/closed/canceled workflow-group aliases identically. */\nexport function parseStatusFilterCsv(\n  raw: unknown,\n  registry: RuntimeStatusRegistry,\n  options?: ParseStatusFilterOptions,\n): ItemStatus[] | undefined {\n  if (typeof raw !== \"string\") {\n    return undefined;\n  }\n  const strict = options?.strict === true;\n  const flagLabel = options?.flagLabel ?? \"--status\";\n  const tokens = raw\n    .split(\",\")\n    .map((entry) => entry.trim())\n    .filter((entry) => entry.length > 0);\n  if (tokens.length === 0) {\n    return undefined;\n  }\n  const allTokenCount = tokens.filter(\n    (token) => token.trim().toLowerCase() === STATUS_ALL_SENTINEL,\n  ).length;\n  if (allTokenCount > 0) {\n    if (tokens.length === 1) {\n      return undefined;\n    }\n    throw new PmCliError(\n      `Invalid ${flagLabel} value \"all\". Use it by itself, or omit ${flagLabel} to search every status.`,\n      EXIT_CODE.USAGE,\n    );\n  }\n  const resolved: ItemStatus[] = [];\n  for (const token of tokens) {\n    const status = resolveStatusFilterToken(token, registry);\n    if (status === undefined) {\n      if (strict) {\n        const suggestion = suggestClosestStatus(token, registry);\n        throw new PmCliError(\n          `Invalid ${flagLabel} value \"${token}\". Use open|closed|canceled or a configured status id${\n            suggestion ? `. Did you mean \"${suggestion}\"?` : \".\"\n          }`,\n          EXIT_CODE.USAGE,\n        );\n      }\n      resolved.push(token as ItemStatus);\n      continue;\n    }\n    resolved.push(status);\n  }\n  return [...new Set(resolved)];\n}\n","/**\n * @module core/schema/runtime-field-filters\n *\n * Resolves configurable schema, fields, statuses, and workflows for Runtime Field Filters.\n */\nimport {\n  coerceRuntimeFieldValue,\n  readRuntimeFieldOptionValue,\n} from \"./runtime-field-values.js\";\nimport type {\n  RuntimeFieldCommand,\n  RuntimeFieldRegistry,\n} from \"./runtime-schema.js\";\nimport { stableValueEquals } from \"../shared/serialization.js\";\n\nfunction valuesEqual(left: unknown, right: unknown): boolean {\n  return stableValueEquals(left, right);\n}\n\n/** Implements collect runtime filter values for the public runtime surface of this module. */\nexport function collectRuntimeFilterValues(\n  options: Record<string, unknown>,\n  fieldRegistry: RuntimeFieldRegistry,\n  command: RuntimeFieldCommand,\n): Record<string, unknown> {\n  const filters: Record<string, unknown> = {};\n  for (const definition of fieldRegistry.command_to_fields.get(command) ?? []) {\n    const rawValue = readRuntimeFieldOptionValue(options, definition);\n    if (rawValue === undefined) {\n      continue;\n    }\n    filters[definition.metadata_key] = coerceRuntimeFieldValue(\n      definition,\n      rawValue,\n    );\n  }\n  return filters;\n}\n\n/** Implements matches runtime filters for the public runtime surface of this module. */\nexport function matchesRuntimeFilters(\n  item: Record<string, unknown>,\n  filters: Record<string, unknown>,\n): boolean {\n  for (const [fieldKey, expectedValue] of Object.entries(filters)) {\n    const actualValue = item[fieldKey];\n    if (Array.isArray(expectedValue)) {\n      if (Array.isArray(actualValue)) {\n        const normalizedActual = actualValue.map((value) => String(value));\n        const normalizedExpected = expectedValue.map((value) => String(value));\n        if (\n          !normalizedExpected.every((value) => normalizedActual.includes(value))\n        ) {\n          return false;\n        }\n        continue;\n      }\n      if (!valuesEqual(actualValue, expectedValue[expectedValue.length - 1])) {\n        return false;\n      }\n      continue;\n    }\n    if (!valuesEqual(actualValue, expectedValue)) {\n      return false;\n    }\n  }\n  return true;\n}\n","/**\n * Content-field governance & utilization primitives.\n *\n * \"Project management = context management\": these primitives let agents query\n * which items carry context (notes/learnings/files/docs/tests/comments/deps/\n * body, plus whether a linked test carries a runnable command) and which do\n * not. The surface powers content-field selection (pm list / pm update-many)\n * and field-utilization reporting (pm stats --field-utilization).\n *\n * The module is pure: it performs no IO and imports no heavy runtime\n * dependencies. Callers pass plain structural item shapes so the logic stays\n * trivially testable.\n */\n\n/** The content fields an item can carry context in. */\nexport type ContentField =\n  | \"notes\"\n  | \"learnings\"\n  | \"files\"\n  | \"docs\"\n  | \"tests\"\n  | \"comments\"\n  | \"deps\"\n  | \"body\"\n  | \"linked_command\";\n\n/** Stable rendering / iteration order for content fields. */\nexport const CONTENT_FIELD_ORDER: readonly ContentField[] = [\n  \"notes\",\n  \"learnings\",\n  \"files\",\n  \"docs\",\n  \"tests\",\n  \"comments\",\n  \"deps\",\n  \"body\",\n  \"linked_command\",\n] as const;\n\n/** Minimal structural shape needed: the collection arrays + optional body. */\nexport interface ContentFieldItem {\n  /** Value that configures or reports notes for this contract. */\n  notes?: unknown[];\n  /** Value that configures or reports learnings for this contract. */\n  learnings?: unknown[];\n  /** Value that configures or reports files for this contract. */\n  files?: unknown[];\n  /** Value that configures or reports docs for this contract. */\n  docs?: unknown[];\n  /** Value that configures or reports tests for this contract. */\n  tests?: unknown[];\n  /** Value that configures or reports comments for this contract. */\n  comments?: unknown[];\n  /** Value that configures or reports dependencies for this contract. */\n  dependencies?: unknown[];\n  /** Value that configures or reports body for this contract. */\n  body?: string;\n  [key: string]: unknown;\n}\n\n/** True when `value` is a non-empty array. */\nfunction hasEntries(value: unknown): boolean {\n  return Array.isArray(value) && value.length > 0;\n}\n\n/** True when the body string carries non-whitespace content. */\nfunction hasBody(body: unknown): boolean {\n  return typeof body === \"string\" && body.trim().length > 0;\n}\n\n/** True when at least one entry in the `tests` array carries a non-empty string `command`. Tolerant of non-object / non-string entries. */\nfunction hasLinkedCommand(tests: unknown): boolean {\n  if (!Array.isArray(tests)) {\n    return false;\n  }\n  return tests.some((entry) => {\n    if (typeof entry !== \"object\" || entry === null) {\n      return false;\n    }\n    const command = (entry as { command?: unknown }).command;\n    return typeof command === \"string\" && command.trim().length > 0;\n  });\n}\n\n/** True when the given content field carries context on this item. - collection fields: `Array.isArray && length > 0` - \"deps\": maps to the `dependencies` array - \"body\": `typeof body === \"string\" && body.trim().length > 0` - \"linked_command\": `tests` array has at least one entry with a non-empty string `command` */\nexport function isContentFieldPresent(\n  item: ContentFieldItem,\n  field: ContentField,\n): boolean {\n  switch (field) {\n    case \"notes\":\n      return hasEntries(item.notes);\n    case \"learnings\":\n      return hasEntries(item.learnings);\n    case \"files\":\n      return hasEntries(item.files);\n    case \"docs\":\n      return hasEntries(item.docs);\n    case \"tests\":\n      return hasEntries(item.tests);\n    case \"comments\":\n      return hasEntries(item.comments);\n    case \"deps\":\n      return hasEntries(item.dependencies);\n    case \"body\":\n      return hasBody(item.body);\n    case \"linked_command\":\n      return hasLinkedCommand(item.tests);\n  }\n  // No default: every ContentField has an explicit case above, so TypeScript\n  // enforces exhaustiveness here — adding a new field without a case is a\n  // compile error rather than a silent fall-through (and no unreachable branch\n  // to dent the literal-100% coverage gate).\n}\n\n/** Per-field selection: 'present' requires the field populated, 'absent' requires it empty. */\nexport type ContentFieldSelection = \"present\" | \"absent\";\n\n/** Map of content fields to a present/absent requirement. */\nexport type ContentFieldFilters = Partial<\n  Record<ContentField, ContentFieldSelection>\n>;\n\n/** True when at least one content-field selection is requested. */\nexport function hasContentFieldFilter(filters: ContentFieldFilters): boolean {\n  return CONTENT_FIELD_ORDER.some((field) => filters[field] !== undefined);\n}\n\n/**\n * Does a single item satisfy the requested content-field filters?\n *\n * AND semantics across all requested fields: each requested field must match\n * its present/absent requirement. When no filter is requested the item passes.\n */\nexport function itemMatchesContentFilters(\n  item: ContentFieldItem,\n  filters: ContentFieldFilters,\n): boolean {\n  for (const field of CONTENT_FIELD_ORDER) {\n    const selection = filters[field];\n    if (selection === undefined) {\n      continue;\n    }\n    const present = isContentFieldPresent(item, field);\n    if (selection === \"present\" && !present) {\n      return false;\n    }\n    if (selection === \"absent\" && present) {\n      return false;\n    }\n  }\n  return true;\n}\n\n/** Filter a list of items by the requested content-field selections. */\nexport function filterByContentFields<T extends ContentFieldItem>(\n  items: readonly T[],\n  filters: ContentFieldFilters,\n): T[] {\n  if (!hasContentFieldFilter(filters)) {\n    return [...items];\n  }\n  return items.filter((item) => itemMatchesContentFilters(item, filters));\n}\n\n/** Whether a content-field filter set requires the heavy collections to be loaded. True when any non-body field is requested (collections + tests' linked command all live in the heavy item-metadata arrays). */\nexport function contentFiltersNeedCollections(\n  filters: ContentFieldFilters,\n): boolean {\n  return CONTENT_FIELD_ORDER.some(\n    (field) => field !== \"body\" && filters[field] !== undefined,\n  );\n}\n\n/** Whether a content-field filter set requires the item body to be loaded. */\nexport function contentFiltersNeedBody(filters: ContentFieldFilters): boolean {\n  return filters.body !== undefined;\n}\n\n// ---------------------------------------------------------------------------\n// Field utilization\n// ---------------------------------------------------------------------------\n\n/** Utilization of a single content field: present vs total, with a rounded percent. */\nexport interface ContentFieldUtilization {\n  /** Value that configures or reports present for this contract. */\n  present: number;\n  /** Value that configures or reports total for this contract. */\n  total: number;\n  /** present/total * 100, rounded to one decimal; 100 when total is 0. */\n  percent: number;\n}\n\n/** Per-field utilization report for pm stats --field-utilization. */\nexport interface ContentFieldUtilizationReport {\n  /** Value that configures or reports total items for this contract. */\n  total_items: number;\n  /** Utilization keyed by content field (includes body and linked_command). */\n  fields: Record<ContentField, ContentFieldUtilization>;\n  /** Convenience alias mirroring GH-241: identical to `fields.body`. */\n  body_populated: ContentFieldUtilization;\n  /** Items with an empty body; `present` counts the empty-bodied items. */\n  empty_body: ContentFieldUtilization;\n}\n\n/** Round present/total into a one-decimal percentage. Matches the convention in metadata-coverage.ts: a zero population reports 100 (nothing missing). */\nfunction roundPercent(present: number, total: number): number {\n  if (total === 0) {\n    return 100;\n  }\n  return Math.round((present / total) * 1000) / 10;\n}\n\nfunction emptyUtilizationFields(): Record<\n  ContentField,\n  ContentFieldUtilization\n> {\n  const record = {} as Record<ContentField, ContentFieldUtilization>;\n  for (const field of CONTENT_FIELD_ORDER) {\n    record[field] = { present: 0, total: 0, percent: 100 };\n  }\n  return record;\n}\n\n/** Compute content-field utilization across a list of items. For each field we report how many items populate it out of the total, plus a rounded percentage. Convenience `body_populated`/`empty_body` aliases mirror GH-241. */\nexport function computeContentFieldUtilization(\n  items: readonly ContentFieldItem[],\n): ContentFieldUtilizationReport {\n  const fields = emptyUtilizationFields();\n  const total = items.length;\n  for (const item of items) {\n    for (const field of CONTENT_FIELD_ORDER) {\n      if (isContentFieldPresent(item, field)) {\n        fields[field].present += 1;\n      }\n    }\n  }\n  for (const field of CONTENT_FIELD_ORDER) {\n    fields[field].total = total;\n    fields[field].percent = roundPercent(fields[field].present, total);\n  }\n  const bodyPopulated = fields.body;\n  const emptyBodyCount = total - bodyPopulated.present;\n  const emptyBody: ContentFieldUtilization = {\n    present: emptyBodyCount,\n    total,\n    percent: roundPercent(emptyBodyCount, total),\n  };\n  return {\n    total_items: total,\n    fields,\n    body_populated: bodyPopulated,\n    empty_body: emptyBody,\n  };\n}\n","/**\n * @module sdk/query/list\n *\n * Implements the pm list command surface and its agent-facing runtime behavior.\n */\nimport { pathExists } from \"../../core/fs/fs-utils.js\";\nimport { getActiveExtensionRegistrations } from \"../../core/extensions/index.js\";\nimport { toItemRecord } from \"../../core/item/item-record.js\";\nimport { isTerminalStatus } from \"../../core/item/status.js\";\nimport { collectDependencyBlockedIds } from \"../actionability.js\";\nimport {\n  isStatusAllFilterInput,\n  parseStatusFilterCsv,\n} from \"../../core/item/status-filter.js\";\nimport {\n  resolveItemTypeRegistry,\n  type ItemTypeRegistry,\n} from \"../../core/item/type-registry.js\";\nimport { parseIntegerLimit, parsePriority, parseType } from \"./parsers.js\";\nimport {\n  collectRuntimeFilterValues,\n  matchesRuntimeFilters,\n} from \"../../core/schema/runtime-field-filters.js\";\nimport {\n  hasMissingMetadataFilter,\n  itemMatchesMissingMetadata,\n  lifecycleClassifierFromStatusRegistry,\n  type MissingMetadataFilters,\n} from \"../../core/governance/metadata-coverage.js\";\nimport {\n  contentFiltersNeedBody,\n  contentFiltersNeedCollections,\n  hasContentFieldFilter,\n  itemMatchesContentFilters,\n  type ContentField,\n  type ContentFieldFilters,\n} from \"../../core/governance/content-fields.js\";\nimport {\n  resolveRuntimeFieldRegistry,\n  resolveRuntimeStatusRegistry,\n  type RuntimeStatusRegistry,\n} from \"../../core/schema/runtime-schema.js\";\nimport {\n  EXIT_CODE,\n  ITEM_METADATA_KEY_ORDER,\n} from \"../../core/shared/constants.js\";\nimport type { GlobalOptions } from \"../../core/shared/command-types.js\";\nimport { PmCliError } from \"../../core/shared/errors.js\";\nimport {\n  compareTimestampStrings,\n  matchesTimestampFilters,\n  nowIso,\n  resolveIsoOrRelative,\n} from \"../../core/shared/time.js\";\nimport {\n  listAllItemMetadata,\n  listAllItemMetadataLight,\n  listAllItemMetadataWithBody,\n} from \"../../core/store/item-store.js\";\nimport { HEAVY_METADATA_KEYS } from \"../../core/store/item-metadata-cache.js\";\nimport { getSettingsPath, resolvePmRoot } from \"../../core/store/paths.js\";\nimport { readSettings } from \"../../core/store/settings.js\";\nimport type { ItemMetadata, ItemStatus, ItemType } from \"../../types/index.js\";\nimport type { SharedItemFilterOptions } from \"./item-filter-options.js\";\nimport {\n  createQueryFingerprint,\n  encodeQueryCursor,\n  resolveQueryCursorStart,\n} from \"../pagination.js\";\n\n/** Documents the list options payload exchanged by command, SDK, and package integrations. */\nexport interface ListOptions extends SharedItemFilterOptions {\n  /** Value that configures or reports ids for this contract. */\n  ids?: string;\n  /** Value that configures or reports assignee filter for this contract. */\n  assigneeFilter?: string;\n  /** Value that configures or reports today for this contract. */\n  today?: boolean;\n  /** Value that configures or reports recent for this contract. */\n  recent?: boolean;\n  /** Value that configures or reports limit for this contract. */\n  limit?: string;\n  /** Value that configures or reports offset for this contract. */\n  offset?: string;\n  /** Opaque cursor returned by a previous list page. */\n  after?: string;\n  /** Force the complete matched set and deliberately override `limit`; use plain `limit` for bounded pagination. */\n  noTruncate?: boolean;\n  /** Value that configures or reports include body for this contract. */\n  includeBody?: boolean;\n  /** Value that configures or reports compact for this contract. */\n  compact?: boolean;\n  /** Value that configures or reports brief for this contract. */\n  brief?: boolean;\n  /** Value that configures or reports full for this contract. */\n  full?: boolean;\n  /** Value that configures or reports fields for this contract. */\n  fields?: string;\n  /** Value that configures or reports sort for this contract. */\n  sort?: string;\n  /** Value that configures or reports order for this contract. */\n  order?: string;\n  /** Value that configures or reports tree for this contract. */\n  tree?: boolean;\n  /** Value that configures or reports tree depth for this contract. */\n  treeDepth?: string;\n  /** Value that configures or reports exclude terminal for this contract. */\n  excludeTerminal?: boolean;\n  /**\n   * Select items that are blocked under the shared edge-aware definition\n   * (blocked lifecycle status OR at least one open `blocked_by` edge), the\n   * same classification `pm next` and `pm context` use (GH-578). Set by the\n   * `list-blocked` command variant; plain `--status blocked` stays a raw\n   * lifecycle-status filter.\n   */\n  dependencyBlocked?: boolean;\n  /** Value that configures or reports filter ac missing for this contract. */\n  filterAcMissing?: boolean;\n  /** Value that configures or reports filter estimates missing for this contract. */\n  filterEstimatesMissing?: boolean;\n  /** Value that configures or reports filter resolution missing for this contract. */\n  filterResolutionMissing?: boolean;\n  /** Value that configures or reports filter metadata missing for this contract. */\n  filterMetadataMissing?: boolean;\n}\n\n/** Extract the missing-metadata selection filters from list/update-many options. */\nexport const resolveMissingMetadataFilters = (options: {\n  filterAcMissing?: boolean;\n  filterEstimatesMissing?: boolean;\n  filterResolutionMissing?: boolean;\n  filterMetadataMissing?: boolean;\n  filterReviewerMissing?: boolean;\n  filterRiskMissing?: boolean;\n  filterConfidenceMissing?: boolean;\n  filterSprintMissing?: boolean;\n  filterReleaseMissing?: boolean;\n}): MissingMetadataFilters => {\n  return {\n    acMissing: options.filterAcMissing === true,\n    estimatesMissing: options.filterEstimatesMissing === true,\n    resolutionMissing: options.filterResolutionMissing === true,\n    metadataMissing: options.filterMetadataMissing === true,\n    reviewerMissing: options.filterReviewerMissing === true,\n    riskMissing: options.filterRiskMissing === true,\n    confidenceMissing: options.filterConfidenceMissing === true,\n    sprintMissing: options.filterSprintMissing === true,\n    releaseMissing: options.filterReleaseMissing === true,\n  };\n};\n\n/** Per content field: the present flag and the absence flag on the options shape. */\ninterface ContentFieldFlagMapping {\n  field: ContentField;\n  presentKey: string;\n  absentKey: string;\n  /** Human flag names used in the conflict error message. */\n  presentFlag: string;\n  absentFlag: string;\n}\n\nconst CONTENT_FIELD_FLAG_MAPPINGS: readonly ContentFieldFlagMapping[] = [\n  {\n    field: \"notes\",\n    presentKey: \"hasNotes\",\n    absentKey: \"noNotes\",\n    presentFlag: \"--has-notes\",\n    absentFlag: \"--no-notes\",\n  },\n  {\n    field: \"learnings\",\n    presentKey: \"hasLearnings\",\n    absentKey: \"noLearnings\",\n    presentFlag: \"--has-learnings\",\n    absentFlag: \"--no-learnings\",\n  },\n  {\n    field: \"files\",\n    presentKey: \"hasFiles\",\n    absentKey: \"noFiles\",\n    presentFlag: \"--has-files\",\n    absentFlag: \"--no-files\",\n  },\n  {\n    field: \"docs\",\n    presentKey: \"hasDocs\",\n    absentKey: \"noDocs\",\n    presentFlag: \"--has-docs\",\n    absentFlag: \"--no-docs\",\n  },\n  {\n    field: \"tests\",\n    presentKey: \"hasTests\",\n    absentKey: \"noTests\",\n    presentFlag: \"--has-tests\",\n    absentFlag: \"--no-tests\",\n  },\n  {\n    field: \"comments\",\n    presentKey: \"hasComments\",\n    absentKey: \"noComments\",\n    presentFlag: \"--has-comments\",\n    absentFlag: \"--no-comments\",\n  },\n  {\n    field: \"deps\",\n    presentKey: \"hasDeps\",\n    absentKey: \"noDeps\",\n    presentFlag: \"--has-deps\",\n    absentFlag: \"--no-deps\",\n  },\n  {\n    field: \"body\",\n    presentKey: \"hasBody\",\n    absentKey: \"emptyBody\",\n    presentFlag: \"--has-body\",\n    absentFlag: \"--empty-body\",\n  },\n  {\n    field: \"linked_command\",\n    presentKey: \"hasLinkedCommand\",\n    absentKey: \"noLinkedCommand\",\n    presentFlag: \"--has-linked-command\",\n    absentFlag: \"--no-linked-command\",\n  },\n] as const;\n\n/** Resolve the content-field presence/absence selections from list/search options. A field requested both present AND absent is a usage error (the two selections are mutually exclusive). Returns an empty object when no content-field filter is active. */\nexport const resolveContentFieldFilters = (\n  options: Record<string, unknown>,\n): ContentFieldFilters => {\n  const conflict = CONTENT_FIELD_FLAG_MAPPINGS.find(\n    (mapping) =>\n      options[mapping.presentKey] === true &&\n      options[mapping.absentKey] === true,\n  );\n  if (conflict) {\n    throw new PmCliError(\n      `Cannot combine ${conflict.presentFlag} with ${conflict.absentFlag} for the same field.`,\n      EXIT_CODE.USAGE,\n    );\n  }\n  return Object.fromEntries(\n    CONTENT_FIELD_FLAG_MAPPINGS.flatMap<[\n      ContentField,\n      \"present\" | \"absent\",\n    ]>((mapping) => {\n      if (options[mapping.presentKey] === true) {\n        return [[mapping.field, \"present\"]];\n      }\n      return options[mapping.absentKey] === true\n        ? [[mapping.field, \"absent\"]]\n        : [];\n    }),\n  ) as ContentFieldFilters;\n};\n\n/** Restricts listed item values accepted by command, SDK, and storage contracts. */\nexport type ListedItem = ItemMetadata | (ItemMetadata & { body: string });\n\n/** Tree-only metadata added when list results are ordered hierarchically. */\nexport interface ListTreeMetadata {\n  /** Zero-based depth relative to the selected tree root. */\n  tree_depth: number;\n  /** Parent item ID, or null for a root row. */\n  tree_parent: string | null;\n  /** Number of direct children represented by the row. */\n  tree_children: number;\n  /** Indented display title for token-efficient tree rendering. */\n  tree_title: string;\n}\n\n/** Full metadata enriched with tree-only fields. */\nexport type ListTreeItem = ListedItem & ListTreeMetadata;\n\n/** A compact or explicitly selected field projection. */\nexport type ListProjectedItem = Record<string, unknown>;\n\n/** Honest union of item shapes returned by the list engine. */\nexport type ListResultItem = ListedItem | ListTreeItem | ListProjectedItem;\n\ntype ListProjectionMode = \"full\" | \"compact\" | \"fields\";\n\ninterface ListProjectionConfig {\n  mode: ListProjectionMode;\n  fields: string[];\n}\n\n/** Public contract for list sort fields, shared by SDK and presentation-layer consumers. */\nexport const LIST_SORT_FIELDS = [\n  \"priority\",\n  \"deadline\",\n  \"updated_at\",\n  \"created_at\",\n  \"title\",\n  \"parent\",\n] as const;\n/** Restricts list sort field values accepted by command, SDK, and storage contracts. */\nexport type ListSortField = (typeof LIST_SORT_FIELDS)[number];\n\n/** Supported values accepted by the list sort order contract. */\nexport const LIST_SORT_ORDER_VALUES = [\"asc\", \"desc\"] as const;\n/** Restricts list sort order values accepted by command, SDK, and storage contracts. */\nexport type ListSortOrder = (typeof LIST_SORT_ORDER_VALUES)[number];\n\nconst DEFAULT_COMPACT_LIST_FIELDS = [\n  \"id\",\n  \"title\",\n  \"status\",\n  \"type\",\n  \"priority\",\n  \"parent\",\n  \"updated_at\",\n] as const;\nconst BRIEF_LIST_FIELDS = [\"id\", \"status\", \"type\", \"title\"] as const;\nconst TREE_METADATA_FIELDS = [\n  \"tree_depth\",\n  \"tree_parent\",\n  \"tree_children\",\n  \"tree_title\",\n] as const;\n\n// A projection that selects any heavy collection field (or `--full`, which returns\n// items verbatim) must load the full metadata; everything else takes the light path.\n// Sourced from the single HEAVY_METADATA_KEYS definition in the cache layer so the\n// light/heavy split can never drift between the cache and the projection routing.\nconst HEAVY_PROJECTION_FIELDS: ReadonlySet<string> = new Set<string>(\n  HEAVY_METADATA_KEYS,\n);\n\ninterface ListResultBase {\n  items: ListResultItem[];\n  count: number;\n  // Total rows matched before pagination; only emitted when --limit/--offset\n  // omitted rows, so agents know how many remain (GH-154).\n  total?: number;\n  /** Whether additional rows remain after this page. */\n  has_more?: boolean;\n  /** Opaque continuation cursor when additional rows remain. */\n  next_cursor?: string;\n  /** Effective page size, including an automatic at-scale bound. */\n  applied_limit?: number;\n  /** Explicit marker that the response is a bounded page. */\n  truncated?: true;\n  warnings?: string[];\n}\n\n/** Documents the list compact result payload exchanged by command, SDK, and package integrations. */\nexport interface ListCompactResult extends ListResultBase {\n  /** Value that configures or reports filters for this contract. */\n  filters: Record<string, unknown>;\n  /** Value that configures or reports projection for this contract. */\n  projection?: undefined;\n  /** Value that configures or reports sorting for this contract. */\n  sorting?: undefined;\n  /** Value that configures or reports now for this contract. */\n  now?: undefined;\n}\n\n/** Documents the list verbose result payload exchanged by command, SDK, and package integrations. */\nexport interface ListVerboseResult extends ListResultBase {\n  /** Value that configures or reports filters for this contract. */\n  filters: Record<string, unknown>;\n  /** Value that configures or reports projection for this contract. */\n  projection: {\n    mode: ListProjectionMode;\n    fields: string[] | null;\n  };\n  /** Value that configures or reports sorting for this contract. */\n  sorting: {\n    sort: ListSortField | \"default\";\n    order: ListSortOrder;\n  };\n  /** Value that configures or reports now for this contract. */\n  now: string;\n}\n\n/** Verbose full-record result returned when `full: true` is requested. */\nexport interface ListFullResult extends ListVerboseResult {\n  /** Full metadata rows, optionally enriched with tree metadata. */\n  items: Array<ListedItem | ListTreeItem>;\n  /** Discriminator proving that rows are complete metadata records. */\n  projection: {\n    mode: \"full\";\n    fields: null;\n  };\n}\n\n/** Restricts list result values accepted by command, SDK, and storage contracts. */\nexport type ListResult = ListCompactResult | ListVerboseResult;\n\nfunction isNonEmptyRecord(value: unknown): value is Record<string, unknown> {\n  return (\n    typeof value === \"object\" &&\n    value !== null &&\n    !Array.isArray(value) &&\n    Object.keys(value).length > 0\n  );\n}\n\n// Active content-field filter flags, keyed by the options dest and the snake_case\n// summary key emitted in the filters echo (GH-242). Presence and absence are\n// distinct echo keys (has_notes vs no_notes; has_body vs empty_body).\nconst CONTENT_FILTER_ECHO_ENTRIES: ReadonlyArray<{\n  key: string;\n  summaryKey: string;\n}> = [\n  { key: \"hasNotes\", summaryKey: \"has_notes\" },\n  { key: \"hasLearnings\", summaryKey: \"has_learnings\" },\n  { key: \"hasFiles\", summaryKey: \"has_files\" },\n  { key: \"hasDocs\", summaryKey: \"has_docs\" },\n  { key: \"hasTests\", summaryKey: \"has_tests\" },\n  { key: \"hasComments\", summaryKey: \"has_comments\" },\n  { key: \"hasDeps\", summaryKey: \"has_deps\" },\n  { key: \"hasBody\", summaryKey: \"has_body\" },\n  { key: \"hasLinkedCommand\", summaryKey: \"has_linked_command\" },\n  { key: \"noNotes\", summaryKey: \"no_notes\" },\n  { key: \"noLearnings\", summaryKey: \"no_learnings\" },\n  { key: \"noFiles\", summaryKey: \"no_files\" },\n  { key: \"noDocs\", summaryKey: \"no_docs\" },\n  { key: \"noTests\", summaryKey: \"no_tests\" },\n  { key: \"noComments\", summaryKey: \"no_comments\" },\n  { key: \"noDeps\", summaryKey: \"no_deps\" },\n  { key: \"emptyBody\", summaryKey: \"empty_body\" },\n  { key: \"noLinkedCommand\", summaryKey: \"no_linked_command\" },\n] as const;\n\n// Active governance-missing filter flags (GH-236), keyed by options dest and the\n// snake_case summary key emitted in the filters echo.\nconst GOVERNANCE_MISSING_ECHO_ENTRIES: ReadonlyArray<{\n  key: string;\n  summaryKey: string;\n}> = [\n  { key: \"filterReviewerMissing\", summaryKey: \"filter_reviewer_missing\" },\n  { key: \"filterRiskMissing\", summaryKey: \"filter_risk_missing\" },\n  { key: \"filterConfidenceMissing\", summaryKey: \"filter_confidence_missing\" },\n  { key: \"filterSprintMissing\", summaryKey: \"filter_sprint_missing\" },\n  { key: \"filterReleaseMissing\", summaryKey: \"filter_release_missing\" },\n] as const;\n\nfunction applyContentFilterEcho(\n  filters: Record<string, unknown>,\n  options: Record<string, unknown>,\n): void {\n  for (const entry of CONTENT_FILTER_ECHO_ENTRIES) {\n    if (options[entry.key] === true) {\n      filters[entry.summaryKey] = true;\n    }\n  }\n}\n\nfunction applyGovernanceMissingFilterEcho(\n  filters: Record<string, unknown>,\n  options: Record<string, unknown>,\n): void {\n  for (const entry of GOVERNANCE_MISSING_ECHO_ENTRIES) {\n    if (options[entry.key] === true) {\n      filters[entry.summaryKey] = true;\n    }\n  }\n}\n\ninterface FilterValueEchoEntry {\n  optionKey: string;\n  summaryKey: string;\n  normalize?: (value: unknown) => unknown;\n}\n\n/**\n * Copies user-supplied option values into compact filter summaries.\n *\n * Compact list/search responses are optimized for agent context: they echo only\n * filters the caller actually supplied. Keeping this helper shared prevents the\n * list and search command summaries from drifting as new scalar filters are\n * added.\n */\nexport function applyFilterValueEcho(\n  filters: Record<string, unknown>,\n  options: Record<string, unknown>,\n  entries: ReadonlyArray<FilterValueEchoEntry>,\n): void {\n  for (const entry of entries) {\n    const value = options[entry.optionKey];\n    if (value !== undefined) {\n      filters[entry.summaryKey] = entry.normalize\n        ? entry.normalize(value)\n        : value;\n    }\n  }\n}\n\n/** Implements build content filter echo for the public runtime surface of this module. */\nexport function buildContentFilterEcho(\n  options: Record<string, unknown>,\n): Record<string, true> {\n  const echo: Record<string, true> = {};\n  applyContentFilterEcho(echo, options);\n  return echo;\n}\n\n/** Implements build governance missing filter echo for the public runtime surface of this module. */\nexport function buildGovernanceMissingFilterEcho(\n  options: Record<string, unknown>,\n): Record<string, true> {\n  const echo: Record<string, true> = {};\n  applyGovernanceMissingFilterEcho(echo, options);\n  return echo;\n}\n\nconst COMPACT_LIST_VALUE_FILTER_ECHO_ENTRIES: ReadonlyArray<FilterValueEchoEntry> =\n  [\n    { optionKey: \"type\", summaryKey: \"type\" },\n    { optionKey: \"tag\", summaryKey: \"tag\" },\n    { optionKey: \"priority\", summaryKey: \"priority\" },\n    { optionKey: \"deadlineBefore\", summaryKey: \"deadline_before\" },\n    { optionKey: \"deadlineAfter\", summaryKey: \"deadline_after\" },\n    { optionKey: \"updatedAfter\", summaryKey: \"updated_after\" },\n    { optionKey: \"updatedBefore\", summaryKey: \"updated_before\" },\n    { optionKey: \"createdAfter\", summaryKey: \"created_after\" },\n    { optionKey: \"createdBefore\", summaryKey: \"created_before\" },\n    { optionKey: \"ids\", summaryKey: \"ids\" },\n    { optionKey: \"assignee\", summaryKey: \"assignee\" },\n    { optionKey: \"assigneeFilter\", summaryKey: \"assignee_filter\" },\n    { optionKey: \"parent\", summaryKey: \"parent\" },\n    { optionKey: \"sprint\", summaryKey: \"sprint\" },\n    { optionKey: \"release\", summaryKey: \"release\" },\n  ] as const;\n\nconst VERBOSE_LIST_VALUE_FILTER_ECHO_ENTRIES: ReadonlyArray<FilterValueEchoEntry> =\n  [\n    { optionKey: \"type\", summaryKey: \"type\" },\n    { optionKey: \"tag\", summaryKey: \"tag\" },\n    { optionKey: \"priority\", summaryKey: \"priority\" },\n    { optionKey: \"deadlineBefore\", summaryKey: \"deadline_before\" },\n    { optionKey: \"deadlineAfter\", summaryKey: \"deadline_after\" },\n    { optionKey: \"updatedAfter\", summaryKey: \"updated_after\" },\n    { optionKey: \"updatedBefore\", summaryKey: \"updated_before\" },\n    { optionKey: \"createdAfter\", summaryKey: \"created_after\" },\n    { optionKey: \"createdBefore\", summaryKey: \"created_before\" },\n    { optionKey: \"ids\", summaryKey: \"ids\" },\n    { optionKey: \"assignee\", summaryKey: \"assignee\" },\n    { optionKey: \"assigneeFilter\", summaryKey: \"assignee_filter\" },\n    { optionKey: \"parent\", summaryKey: \"parent\" },\n    { optionKey: \"sprint\", summaryKey: \"sprint\" },\n    { optionKey: \"release\", summaryKey: \"release\" },\n    { optionKey: \"limit\", summaryKey: \"limit\" },\n    { optionKey: \"offset\", summaryKey: \"offset\" },\n    { optionKey: \"includeBody\", summaryKey: \"include_body\" },\n    { optionKey: \"compact\", summaryKey: \"compact\" },\n    { optionKey: \"fields\", summaryKey: \"fields\" },\n  ] as const;\n\nconst VERBOSE_LIST_BOOLEAN_FILTER_ECHO_ENTRIES: ReadonlyArray<{\n  key: string;\n  summaryKey: string;\n}> = [\n  { key: \"filterAcMissing\", summaryKey: \"filter_ac_missing\" },\n  { key: \"filterEstimatesMissing\", summaryKey: \"filter_estimates_missing\" },\n  { key: \"filterResolutionMissing\", summaryKey: \"filter_resolution_missing\" },\n  { key: \"filterMetadataMissing\", summaryKey: \"filter_metadata_missing\" },\n] as const;\n\nconst LIST_RECENT_WINDOW = \"-7d\";\n\nfunction buildCompactListFilterSummary(params: {\n  filtersStatus: string | string[] | null;\n  options: ListOptions;\n  treeEnabled: boolean;\n  treeDepth: number | undefined;\n  sortField: ListSortField | undefined;\n  sortOrder: ListSortOrder;\n  runtimeFieldFilters: Record<string, unknown>;\n}): Record<string, unknown> {\n  const {\n    filtersStatus,\n    options,\n    treeEnabled,\n    treeDepth,\n    sortField,\n    sortOrder,\n    runtimeFieldFilters,\n  } = params;\n  const filters: Record<string, unknown> = {};\n  if (filtersStatus !== null) {\n    filters.status = filtersStatus;\n  }\n  if (options.dependencyBlocked === true) {\n    filters.blocked_semantics = \"status_or_dependency\";\n  }\n  applyFilterValueEcho(\n    filters,\n    options,\n    COMPACT_LIST_VALUE_FILTER_ECHO_ENTRIES,\n  );\n  applyListWindowFilterEcho(filters, options);\n  if (options.filterAcMissing === true) {\n    filters.filter_ac_missing = true;\n  }\n  if (options.filterEstimatesMissing === true) {\n    filters.filter_estimates_missing = true;\n  }\n  if (options.filterResolutionMissing === true) {\n    filters.filter_resolution_missing = true;\n  }\n  if (options.filterMetadataMissing === true) {\n    filters.filter_metadata_missing = true;\n  }\n  applyGovernanceMissingFilterEcho(filters, options);\n  applyContentFilterEcho(filters, options);\n  if (options.limit !== undefined) {\n    filters.limit = options.limit;\n  }\n  if (options.offset !== undefined) {\n    filters.offset = options.offset;\n  }\n  if (options.includeBody === true) {\n    filters.include_body = true;\n  }\n  if (options.fields !== undefined) {\n    filters.fields = options.fields;\n  }\n  if (treeEnabled) {\n    filters.tree = true;\n    if (treeDepth !== undefined) {\n      filters.tree_depth = treeDepth;\n    }\n  }\n  if (sortField !== undefined) {\n    filters.sort = sortField;\n    filters.order = sortOrder;\n  }\n  if (isNonEmptyRecord(runtimeFieldFilters)) {\n    filters.runtime_filters = runtimeFieldFilters;\n  }\n  return filters;\n}\n\nfunction compareDefaultSort(\n  left: ListedItem,\n  right: ListedItem,\n  statusRegistry: RuntimeStatusRegistry,\n): number {\n  const leftTerminal = isTerminalStatus(left.status, statusRegistry);\n  const rightTerminal = isTerminalStatus(right.status, statusRegistry);\n  if (leftTerminal !== rightTerminal) {\n    return leftTerminal ? 1 : -1;\n  }\n  const byPriority = left.priority - right.priority;\n  if (byPriority !== 0) {\n    return byPriority;\n  }\n  const byUpdated = compareTimestampStrings(right.updated_at, left.updated_at);\n  if (byUpdated !== 0) {\n    return byUpdated;\n  }\n  return (left.id ?? \"\").localeCompare(right.id ?? \"\");\n}\n\nfunction sortItemsDefault(\n  items: ListedItem[],\n  statusRegistry: RuntimeStatusRegistry,\n): ListedItem[] {\n  return [...items].sort((left, right) =>\n    compareDefaultSort(left, right, statusRegistry),\n  );\n}\n\nfunction parseDeadline(\n  raw: string | undefined,\n  fieldLabel: string,\n): string | undefined {\n  if (raw === undefined) return undefined;\n  return resolveIsoOrRelative(raw, new Date(), fieldLabel);\n}\n\n// updated/created date-window filters share the deadline ISO+relative resolver\n// so agents doing incremental \"what changed since my last context window\" syncs\n// can pass either an ISO timestamp (the common case — feed back the previous\n// run's `now`) or a SIGNED relative offset where \"-2h\"/\"-7d\" reach into the\n// past and \"+1d\" into the future (units h/d/w/m, m = months — there is no\n// minutes unit, matching the deadline resolver).\nfunction parseTimestampWindow(\n  raw: unknown,\n  fieldLabel: string,\n): string | undefined {\n  if (raw == null) return undefined;\n  const value = String(raw).trim();\n  if (value.length === 0) return undefined;\n  return resolveIsoOrRelative(value, new Date(), fieldLabel);\n}\n\nfunction resolveListUpdatedAfter(options: ListOptions): string | undefined {\n  const hasUpdatedAfter =\n    options.updatedAfter != null &&\n    String(options.updatedAfter).trim().length > 0;\n  const selectedWindows = [\n    options.today === true,\n    options.recent === true,\n    hasUpdatedAfter,\n  ].filter((selected) => selected).length;\n  if (selectedWindows > 1) {\n    throw new PmCliError(\n      \"Choose only one updated_at window: --today, --recent, or --updated-after.\",\n      EXIT_CODE.USAGE,\n    );\n  }\n  if (options.today === true) {\n    const today = new Date();\n    today.setHours(0, 0, 0, 0);\n    return today.toISOString();\n  }\n  if (options.recent === true) {\n    return parseTimestampWindow(LIST_RECENT_WINDOW, \"recent\");\n  }\n  return parseTimestampWindow(options.updatedAfter, \"updated-after\");\n}\n\nfunction applyListWindowFilterEcho(\n  filters: Record<string, unknown>,\n  options: ListOptions,\n): void {\n  if (options.today === true) {\n    filters.today = true;\n  }\n  if (options.recent === true) {\n    filters.recent = true;\n  }\n}\n\nfunction parseIdsFilter(raw: unknown): Set<string> | undefined {\n  if (raw == null) return undefined;\n  const value = String(raw).trim();\n  if (value.length === 0) {\n    throw new PmCliError(\n      \"--ids requires at least one non-empty item ID\",\n      EXIT_CODE.USAGE,\n    );\n  }\n  const ids = value\n    .split(\",\")\n    .map((entry) => entry.trim())\n    .filter((entry) => entry.length > 0);\n  if (ids.length === 0) {\n    throw new PmCliError(\n      \"--ids requires at least one non-empty item ID\",\n      EXIT_CODE.USAGE,\n    );\n  }\n  return new Set(ids);\n}\n\nfunction parseOffset(raw: string | undefined): number | undefined {\n  if (raw === undefined) return undefined;\n  const normalized = String(raw).trim();\n  const parsed = normalized.length === 0 ? Number.NaN : Number(normalized);\n  if (!Number.isInteger(parsed) || parsed < 0) {\n    throw new PmCliError(\n      \"Offset filter must be a non-negative integer\",\n      EXIT_CODE.USAGE,\n    );\n  }\n  return parsed;\n}\n\nfunction parseFieldSelectors(raw: string | undefined): string[] | undefined {\n  if (raw === undefined) {\n    return undefined;\n  }\n  const selectors = raw\n    .split(\",\")\n    .map((entry) => entry.trim())\n    .filter((entry) => entry.length > 0);\n  if (selectors.length === 0) {\n    throw new PmCliError(\n      \"List --fields requires a comma-separated list of field names\",\n      EXIT_CODE.USAGE,\n    );\n  }\n  return [...new Set(selectors)];\n}\n\nfunction parseProjectionConfig(options: ListOptions): ListProjectionConfig {\n  const compactRequested = options.compact === true;\n  const briefRequested = options.brief === true;\n  const fullRequested = options.full === true;\n  const fieldSelectors = parseFieldSelectors(options.fields);\n  const enabledModes =\n    Number(compactRequested) +\n    Number(briefRequested) +\n    Number(fullRequested) +\n    Number(fieldSelectors !== undefined);\n  if (enabledModes > 1) {\n    throw new PmCliError(\n      \"List projection options are mutually exclusive. Use one of --compact, --brief, --full, or --fields.\",\n      EXIT_CODE.USAGE,\n    );\n  }\n  if (fullRequested) {\n    return {\n      mode: \"full\",\n      fields: [],\n    };\n  }\n  if (briefRequested) {\n    return {\n      mode: \"compact\",\n      fields: [...BRIEF_LIST_FIELDS],\n    };\n  }\n  if (compactRequested) {\n    return {\n      mode: \"compact\",\n      fields: [...DEFAULT_COMPACT_LIST_FIELDS],\n    };\n  }\n  if (fieldSelectors) {\n    return {\n      mode: \"fields\",\n      fields: fieldSelectors,\n    };\n  }\n  return {\n    mode: \"full\",\n    fields: [],\n  };\n}\n\nfunction normalizeProjectionField(field: string): string {\n  return field.startsWith(\"item.\") ? field.slice(\"item.\".length) : field;\n}\n\nfunction validateListProjectionFields(\n  projection: ListProjectionConfig,\n  runtimeMetadataKeys: Iterable<string>,\n): void {\n  if (projection.mode !== \"fields\") {\n    return;\n  }\n  const allowed = new Set([\n    ...ITEM_METADATA_KEY_ORDER,\n    \"body\",\n    ...TREE_METADATA_FIELDS,\n    ...runtimeMetadataKeys,\n  ]);\n  const unknown = projection.fields.filter(\n    (field) => !allowed.has(normalizeProjectionField(field)),\n  );\n  if (unknown.length > 0) {\n    throw new PmCliError(\n      `Unknown list --fields value(s): ${unknown.join(\", \")}`,\n      EXIT_CODE.USAGE,\n      {\n        code: \"unknown_field_projection\",\n        examples: [\n          \"pm list-open --fields id,title,status,type,updated_at\",\n          \"pm list --fields id,title,parent,priority --limit 10\",\n          \"pm list-all --fields id,title,body --limit 5\",\n        ],\n      },\n    );\n  }\n}\n\n// Convenience aliases so agents/humans who reach for the bare verb form\n// (e.g. `--sort updated`) land on the canonical timestamp fields instead of an error.\n// A Map (not a plain object) avoids prototype-chain lookups for keys like \"__proto__\".\nconst LIST_SORT_FIELD_ALIASES: ReadonlyMap<string, ListSortField> = new Map<\n  string,\n  ListSortField\n>([\n  [\"updated\", \"updated_at\"],\n  [\"update\", \"updated_at\"],\n  [\"modified\", \"updated_at\"],\n  [\"created\", \"created_at\"],\n  [\"create\", \"created_at\"],\n]);\n\nfunction parseSortField(raw: string | undefined): ListSortField | undefined {\n  if (raw === undefined) {\n    return undefined;\n  }\n  const normalized = raw.trim().toLowerCase();\n  const aliased = LIST_SORT_FIELD_ALIASES.get(normalized);\n  if (aliased) {\n    return aliased;\n  }\n  if (!LIST_SORT_FIELDS.includes(normalized as ListSortField)) {\n    throw new PmCliError(\n      `Sort field must be one of ${LIST_SORT_FIELDS.join(\"|\")} (aliases: updated->updated_at, created->created_at)`,\n      EXIT_CODE.USAGE,\n    );\n  }\n  return normalized as ListSortField;\n}\n\nfunction parseSortOrder(raw: string | undefined): ListSortOrder | undefined {\n  if (raw === undefined) {\n    return undefined;\n  }\n  const normalized = raw.trim().toLowerCase();\n  if (!LIST_SORT_ORDER_VALUES.includes(normalized as ListSortOrder)) {\n    throw new PmCliError(\n      `Sort order must be one of ${LIST_SORT_ORDER_VALUES.join(\"|\")}`,\n      EXIT_CODE.USAGE,\n    );\n  }\n  return normalized as ListSortOrder;\n}\n\nfunction parseTreeDepth(raw: string | undefined): number | undefined {\n  return parseIntegerLimit(raw, \"--tree-depth\");\n}\n\nfunction parseAssigneeFilter(\n  raw: string | undefined,\n): \"assigned\" | \"unassigned\" | undefined {\n  if (raw === undefined) {\n    return undefined;\n  }\n  const normalized = raw.trim().toLowerCase();\n  if (!normalized) {\n    throw new PmCliError(\n      \"Assignee filter must be one of assigned|unassigned\",\n      EXIT_CODE.USAGE,\n    );\n  }\n  if (normalized !== \"assigned\" && normalized !== \"unassigned\") {\n    throw new PmCliError(\n      `Invalid assignee filter \"${raw}\". Allowed: assigned|unassigned`,\n      EXIT_CODE.USAGE,\n    );\n  }\n  return normalized;\n}\n\n// Resolve built-in, runtime, and workflow-group aliases through the shared\n// registry, rejecting typos instead of returning a misleading empty result.\nfunction resolveStatusFilter(\n  status: ItemStatus | undefined,\n  statusRegistry: RuntimeStatusRegistry,\n): ItemStatus[] | undefined {\n  return parseStatusFilterCsv(status, statusRegistry, { strict: true });\n}\n\ninterface ListFilterSet {\n  idsFilter: Set<string> | undefined;\n  statusSet: Set<ItemStatus> | undefined;\n  excludeTerminal: boolean;\n  typeFilter: ItemType | undefined;\n  tagFilter: string | undefined;\n  priorityFilter: number | undefined;\n  deadlineBefore: string | undefined;\n  deadlineAfter: string | undefined;\n  updatedAfter: string | undefined;\n  updatedBefore: string | undefined;\n  createdAfter: string | undefined;\n  createdBefore: string | undefined;\n  assigneeFilter: string | undefined;\n  assigneeModeFilter: \"assigned\" | \"unassigned\" | undefined;\n  parentFilter: string | undefined;\n  treeEnabled: boolean;\n  sprintFilter: string | undefined;\n  releaseFilter: string | undefined;\n  missingMetadataFilters: MissingMetadataFilters;\n  missingMetadataActive: boolean;\n  lifecycleClassifier: ReturnType<typeof lifecycleClassifierFromStatusRegistry>;\n  contentFieldFilters: ContentFieldFilters;\n  contentFiltersActive: boolean;\n}\n\nfunction assertListAssigneeFilters(\n  assigneeFilter: string | undefined,\n  assigneeModeFilter: \"assigned\" | \"unassigned\" | undefined,\n): void {\n  if (\n    assigneeFilter &&\n    (assigneeFilter.toLowerCase() === \"none\" ||\n      assigneeFilter.toLowerCase() === \"null\")\n  ) {\n    throw new PmCliError(\n      '--assignee no longer accepts \"none\" or \"null\". Use --assignee-filter unassigned.',\n      EXIT_CODE.USAGE,\n    );\n  }\n  if (assigneeFilter !== undefined && assigneeModeFilter === \"unassigned\") {\n    throw new PmCliError(\n      \"Cannot combine --assignee with --assignee-filter unassigned\",\n      EXIT_CODE.USAGE,\n    );\n  }\n}\n\nfunction resolveListFilterSet(\n  status: ItemStatus[] | undefined,\n  options: ListOptions,\n  typeRegistry: ItemTypeRegistry,\n  statusRegistry: RuntimeStatusRegistry,\n): ListFilterSet {\n  const assigneeFilter = options.assignee?.trim();\n  const assigneeModeFilter = parseAssigneeFilter(options.assigneeFilter);\n  assertListAssigneeFilters(assigneeFilter, assigneeModeFilter);\n  const missingMetadataFilters = resolveMissingMetadataFilters(options);\n  const contentFieldFilters = resolveContentFieldFilters(\n    options as Record<string, unknown>,\n  );\n  return {\n    idsFilter: parseIdsFilter(options.ids),\n    statusSet:\n      status && status.length > 0 ? new Set<ItemStatus>(status) : undefined,\n    excludeTerminal: options.excludeTerminal === true,\n    typeFilter: parseType(options.type, typeRegistry),\n    tagFilter: options.tag?.trim().toLowerCase(),\n    priorityFilter: parsePriority(options.priority),\n    deadlineBefore: parseDeadline(options.deadlineBefore, \"deadline-before\"),\n    deadlineAfter: parseDeadline(options.deadlineAfter, \"deadline-after\"),\n    updatedAfter: resolveListUpdatedAfter(options),\n    updatedBefore: parseTimestampWindow(\n      options.updatedBefore,\n      \"updated-before\",\n    ),\n    createdAfter: parseTimestampWindow(options.createdAfter, \"created-after\"),\n    createdBefore: parseTimestampWindow(\n      options.createdBefore,\n      \"created-before\",\n    ),\n    assigneeFilter,\n    assigneeModeFilter,\n    parentFilter: options.parent?.trim(),\n    treeEnabled: options.tree === true,\n    sprintFilter: options.sprint?.trim(),\n    releaseFilter: options.release?.trim(),\n    missingMetadataFilters,\n    missingMetadataActive: hasMissingMetadataFilter(missingMetadataFilters),\n    lifecycleClassifier: lifecycleClassifierFromStatusRegistry(statusRegistry),\n    contentFieldFilters,\n    contentFiltersActive: hasContentFieldFilter(contentFieldFilters),\n  };\n}\n\nfunction matchesListScalarFilters(\n  item: ListedItem,\n  filters: ListFilterSet,\n  statusRegistry: RuntimeStatusRegistry,\n): boolean {\n  return (\n    matchesListIdentityFilters(item, filters, statusRegistry) &&\n    matchesListDateFilters(item, filters) &&\n    matchesListAssigneeFilterSet(item, filters) &&\n    matchesListScopeFilters(item, filters)\n  );\n}\n\nfunction matchesListIdentityFilters(\n  item: ListedItem,\n  filters: ListFilterSet,\n  statusRegistry: RuntimeStatusRegistry,\n): boolean {\n  if (filters.idsFilter && !filters.idsFilter.has(item.id)) return false;\n  if (filters.statusSet && !filters.statusSet.has(item.status)) return false;\n  if (filters.excludeTerminal && isTerminalStatus(item.status, statusRegistry))\n    return false;\n  if (filters.typeFilter && item.type !== filters.typeFilter) return false;\n  if (filters.tagFilter && !(item.tags ?? []).includes(filters.tagFilter))\n    return false;\n  return (\n    filters.priorityFilter === undefined ||\n    item.priority === filters.priorityFilter\n  );\n}\n\nfunction matchesListDateFilters(\n  item: ListedItem,\n  filters: ListFilterSet,\n): boolean {\n  return matchesTimestampFilters(item, filters);\n}\n\nfunction matchesListAssigneeFilterSet(\n  item: ListedItem,\n  filters: ListFilterSet,\n): boolean {\n  if (filters.assigneeModeFilter === \"assigned\" && !item.assignee) return false;\n  if (filters.assigneeModeFilter === \"unassigned\" && item.assignee)\n    return false;\n  return (\n    filters.assigneeFilter === undefined ||\n    item.assignee === filters.assigneeFilter\n  );\n}\n\nfunction matchesListScopeFilters(\n  item: ListedItem,\n  filters: ListFilterSet,\n): boolean {\n  if (\n    filters.parentFilter !== undefined &&\n    !filters.treeEnabled &&\n    item.parent !== filters.parentFilter\n  )\n    return false;\n  if (\n    filters.sprintFilter !== undefined &&\n    item.sprint !== filters.sprintFilter\n  )\n    return false;\n  return (\n    filters.releaseFilter === undefined ||\n    item.release === filters.releaseFilter\n  );\n}\n\nfunction matchesListFilterSet(\n  item: ListedItem,\n  filters: ListFilterSet,\n  statusRegistry: RuntimeStatusRegistry,\n  runtimeFieldFilters: Record<string, unknown>,\n): boolean {\n  if (!matchesListScalarFilters(item, filters, statusRegistry)) {\n    return false;\n  }\n  if (\n    filters.missingMetadataActive &&\n    !itemMatchesMissingMetadata(\n      item,\n      filters.missingMetadataFilters,\n      filters.lifecycleClassifier,\n    )\n  ) {\n    return false;\n  }\n  if (\n    filters.contentFiltersActive &&\n    !itemMatchesContentFilters(item, filters.contentFieldFilters)\n  ) {\n    return false;\n  }\n  if (\n    !matchesRuntimeFilters(item as Record<string, unknown>, runtimeFieldFilters)\n  ) {\n    return false;\n  }\n  return true;\n}\n\nfunction applyFilters(\n  items: ListedItem[],\n  status: ItemStatus[] | undefined,\n  options: ListOptions,\n  typeRegistry: ItemTypeRegistry,\n  statusRegistry: RuntimeStatusRegistry,\n  runtimeFieldFilters: Record<string, unknown>,\n): ListedItem[] {\n  const filters = resolveListFilterSet(\n    status,\n    options,\n    typeRegistry,\n    statusRegistry,\n  );\n  return items.filter((item) =>\n    matchesListFilterSet(item, filters, statusRegistry, runtimeFieldFilters),\n  );\n}\n\nfunction trimNonEmpty(value: string | undefined): string | undefined {\n  if (typeof value !== \"string\") {\n    return undefined;\n  }\n  const trimmed = value.trim();\n  return trimmed.length > 0 ? trimmed : undefined;\n}\n\nfunction withTreeMetadata(\n  item: ListedItem,\n  depth: number,\n  childCount: number,\n): ListTreeItem {\n  const itemRecord = toItemRecord(item);\n  const title = typeof itemRecord.title === \"string\" ? itemRecord.title : \"\";\n  const parent =\n    trimNonEmpty(\n      typeof itemRecord.parent === \"string\" ? itemRecord.parent : undefined,\n    ) ?? null;\n  return {\n    ...item,\n    tree_depth: depth,\n    tree_parent: parent,\n    tree_children: childCount,\n    tree_title: `${\"  \".repeat(depth)}${title}`,\n  };\n}\n\nfunction orderItemsAsTree(\n  sortedItems: ListedItem[],\n  parentRoot: string | undefined,\n  maxDepth: number | undefined,\n): ListedItem[] {\n  const byId = new Map<string, ListedItem>();\n  const childrenByParent = new Map<string, ListedItem[]>();\n  for (const item of sortedItems) {\n    byId.set(item.id, item);\n    const parentId = trimNonEmpty(item.parent);\n    if (!parentId) {\n      continue;\n    }\n    const bucket = childrenByParent.get(parentId);\n    if (bucket) {\n      bucket.push(item);\n    } else {\n      childrenByParent.set(parentId, [item]);\n    }\n  }\n\n  const roots = parentRoot\n    ? [...(childrenByParent.get(parentRoot) ?? [])]\n    : sortedItems.filter((item) => {\n        const parentId = trimNonEmpty(item.parent);\n        return !parentId || !byId.has(parentId);\n      });\n  const ordered: ListedItem[] = [];\n  const visited = new Set<string>();\n  const pushNode = (node: ListedItem, depth: number): void => {\n    if (visited.has(node.id)) {\n      return;\n    }\n    visited.add(node.id);\n    const children = childrenByParent.get(node.id) ?? [];\n    ordered.push(withTreeMetadata(node, depth, children.length));\n    if (maxDepth !== undefined && depth >= maxDepth) {\n      return;\n    }\n    for (const child of children) {\n      pushNode(child, depth + 1);\n    }\n  };\n  for (const root of roots) {\n    pushNode(root, 0);\n  }\n  return ordered;\n}\n\nfunction compareNullableString(\n  left: string | null,\n  right: string | null,\n): number {\n  if (left === right) {\n    return 0;\n  }\n  if (left === null) {\n    return 1;\n  }\n  if (right === null) {\n    return -1;\n  }\n  return left.localeCompare(right);\n}\n\nfunction compareNullableTimestamp(\n  left: string | null,\n  right: string | null,\n): number {\n  if (left === right) {\n    return 0;\n  }\n  if (left === null) {\n    return 1;\n  }\n  if (right === null) {\n    return -1;\n  }\n  return compareTimestampStrings(left, right);\n}\n\nfunction compareBySortField(\n  left: ListedItem,\n  right: ListedItem,\n  field: ListSortField,\n): number {\n  switch (field) {\n    case \"priority\":\n      return left.priority - right.priority;\n    case \"deadline\":\n      return compareNullableTimestamp(\n        left.deadline ?? null,\n        right.deadline ?? null,\n      );\n    case \"updated_at\":\n      return compareTimestampStrings(left.updated_at, right.updated_at);\n    case \"created_at\":\n      return compareTimestampStrings(left.created_at, right.created_at);\n    case \"title\":\n      return (left.title ?? \"\").localeCompare(right.title ?? \"\");\n    case \"parent\":\n      return compareNullableString(left.parent ?? null, right.parent ?? null);\n    default:\n      return 0;\n  }\n}\n\nfunction sortItems(\n  items: ListedItem[],\n  sortField: ListSortField | undefined,\n  sortOrder: ListSortOrder,\n  statusRegistry: RuntimeStatusRegistry,\n): ListedItem[] {\n  if (!sortField) {\n    return sortItemsDefault(items, statusRegistry);\n  }\n  return [...items].sort((left, right) => {\n    const byField = compareBySortField(left, right, sortField);\n    if (byField !== 0) {\n      return sortOrder === \"desc\" ? -byField : byField;\n    }\n    const fallback = compareDefaultSort(left, right, statusRegistry);\n    return sortOrder === \"desc\" ? -fallback : fallback;\n  });\n}\n\nfunction readListFieldValue(\n  item: ListedItem,\n  field: string,\n  treeMode = false,\n): unknown {\n  const normalized = normalizeProjectionField(field.trim());\n  if (normalized.length === 0) {\n    return null;\n  }\n  const itemRecord = toItemRecord(item);\n  if (\n    treeMode &&\n    normalized === \"title\" &&\n    typeof itemRecord.tree_title === \"string\"\n  ) {\n    return itemRecord.tree_title;\n  }\n  if (Object.prototype.hasOwnProperty.call(itemRecord, normalized)) {\n    return itemRecord[normalized] ?? null;\n  }\n  return null;\n}\n\nfunction projectListItems(\n  items: ListedItem[],\n  projection: ListProjectionConfig,\n  treeMode = false,\n): ListResultItem[] {\n  if (projection.mode === \"full\") {\n    return items;\n  }\n  return items.map((item) => {\n    const projected: Record<string, unknown> = {};\n    for (const field of projection.fields) {\n      projected[field] = readListFieldValue(item, field, treeMode);\n    }\n    return projected;\n  });\n}\n\nfunction runtimeMetadataKeysForProjection(\n  definitions: Array<{ metadata_key: string }>,\n): string[] {\n  const keys: string[] = [];\n  for (const field of definitions) {\n    keys.push(field.metadata_key);\n  }\n  return keys;\n}\n\ninterface ListRuntimeContext {\n  pmRoot: string;\n  settings: Awaited<ReturnType<typeof readSettings>>;\n  statusRegistry: RuntimeStatusRegistry;\n  runtimeFieldFilters: Record<string, unknown>;\n  typeRegistry: ItemTypeRegistry;\n  projection: ListProjectionConfig;\n}\n\ninterface ListOrderingOptions {\n  sortField: ListSortField | undefined;\n  sortOrder: ListSortOrder;\n  treeEnabled: boolean;\n  treeDepth: number | undefined;\n  parentRoot: string | undefined;\n}\n\ninterface ResolvedListStatus {\n  resolvedStatus: ItemStatus[] | undefined;\n  explicitAllStatuses: boolean;\n  effectiveOptions: ListOptions;\n  filtersStatus: string | string[] | null;\n}\n\ninterface ListPageResult {\n  projected: ListResultItem[];\n  totalMatched: number;\n  truncationExtras: { total: number } | Record<string, never>;\n  pageExtras: {\n    has_more?: boolean;\n    next_cursor?: string;\n    applied_limit?: number;\n    truncated?: true;\n  };\n}\n\nfunction resolveListPageLimit(\n  options: ListOptions,\n  totalRows: number,\n): number | undefined {\n  if (options.noTruncate === true) {\n    return undefined;\n  }\n  return (\n    parseIntegerLimit(options.limit) ?? (totalRows >= 10_000 ? 20 : undefined)\n  );\n}\n\nfunction resolveListPageStart(\n  ordered: ListedItem[],\n  options: ListOptions,\n  cursorFingerprint: string,\n): number {\n  if (options.after === undefined) {\n    return parseOffset(options.offset) ?? 0;\n  }\n  return resolveQueryCursorStart(\n    ordered,\n    options.after,\n    cursorFingerprint,\n    (item) => item.id,\n  );\n}\n\nfunction buildListPageExtras(\n  limit: number | undefined,\n  hasMore: boolean,\n  nextCursor: string | undefined,\n): ListPageResult[\"pageExtras\"] {\n  return {\n    ...(limit !== undefined ? { applied_limit: limit } : {}),\n    ...(hasMore ? { has_more: true, truncated: true } : {}),\n    ...(nextCursor ? { next_cursor: nextCursor } : {}),\n  };\n}\n\nasync function resolveListRuntimeContext(\n  options: ListOptions,\n  global: GlobalOptions,\n): Promise<ListRuntimeContext> {\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 settings = await readSettings(pmRoot);\n  const statusRegistry = resolveRuntimeStatusRegistry(settings.schema);\n  const runtimeFieldRegistry = resolveRuntimeFieldRegistry(settings.schema);\n  const projection = parseProjectionConfig(options);\n  validateListProjectionFields(\n    projection,\n    runtimeMetadataKeysForProjection(runtimeFieldRegistry.definitions),\n  );\n  return {\n    pmRoot,\n    settings,\n    statusRegistry,\n    runtimeFieldFilters: collectRuntimeFilterValues(\n      options as Record<string, unknown>,\n      runtimeFieldRegistry,\n      \"list\",\n    ),\n    typeRegistry: resolveItemTypeRegistry(\n      settings,\n      getActiveExtensionRegistrations(),\n    ),\n    projection,\n  };\n}\n\nasync function loadListItems(\n  options: ListOptions,\n  runtime: ListRuntimeContext,\n  listWarnings: string[],\n): Promise<ListedItem[]> {\n  const projectionNeedsBody = runtime.projection.fields.some(\n    (field) => normalizeProjectionField(field) === \"body\",\n  );\n  const projectionNeedsCollections =\n    runtime.projection.mode === \"full\" ||\n    runtime.projection.fields.some((field) =>\n      HEAVY_PROJECTION_FIELDS.has(normalizeProjectionField(field)),\n    );\n  const contentFieldFilters = resolveContentFieldFilters(\n    options as Record<string, unknown>,\n  );\n  const contentNeedsCollections =\n    contentFiltersNeedCollections(contentFieldFilters);\n  const contentNeedsBody = contentFiltersNeedBody(contentFieldFilters);\n  if (options.includeBody || projectionNeedsBody || contentNeedsBody) {\n    return await listAllItemMetadataWithBody(\n      runtime.pmRoot,\n      runtime.settings.item_format,\n      runtime.typeRegistry.type_to_folder,\n      listWarnings,\n      runtime.settings.schema,\n    );\n  }\n  if (projectionNeedsCollections || contentNeedsCollections) {\n    return await listAllItemMetadata(\n      runtime.pmRoot,\n      runtime.settings.item_format,\n      runtime.typeRegistry.type_to_folder,\n      listWarnings,\n      runtime.settings.schema,\n    );\n  }\n  return await listAllItemMetadataLight(\n    runtime.pmRoot,\n    runtime.settings.item_format,\n    runtime.typeRegistry.type_to_folder,\n    listWarnings,\n    runtime.settings.schema,\n  );\n}\n\nfunction resolveListOrderingOptions(options: ListOptions): ListOrderingOptions {\n  const sortField = parseSortField(options.sort);\n  const sortOrder = parseSortOrder(options.order) ?? \"asc\";\n  const treeEnabled = options.tree === true;\n  if (!treeEnabled && options.treeDepth !== undefined) {\n    throw new PmCliError(\"List --tree-depth requires --tree\", EXIT_CODE.USAGE);\n  }\n  if (!sortField && options.order !== undefined) {\n    throw new PmCliError(\"List --order requires --sort\", EXIT_CODE.USAGE);\n  }\n  return {\n    sortField,\n    sortOrder,\n    treeEnabled,\n    treeDepth: treeEnabled ? parseTreeDepth(options.treeDepth) : undefined,\n    parentRoot: treeEnabled ? trimNonEmpty(options.parent) : undefined,\n  };\n}\n\nfunction resolveListStatusSelection(\n  status: ItemStatus | undefined,\n  options: ListOptions,\n  statusRegistry: RuntimeStatusRegistry,\n): ResolvedListStatus {\n  const explicitStatus = resolveStatusFilter(\n    options.status as ItemStatus | undefined,\n    statusRegistry,\n  );\n  const resolvedStatus =\n    explicitStatus ?? resolveStatusFilter(status, statusRegistry);\n  const explicitAllStatuses = isStatusAllFilterInput(options.status);\n  const effectiveOptions =\n    explicitStatus || explicitAllStatuses\n      ? { ...options, excludeTerminal: false }\n      : options;\n  const filtersStatus = explicitAllStatuses\n    ? \"all\"\n    : resolvedStatus === undefined\n      ? null\n      : resolvedStatus.length === 1\n        ? resolvedStatus[0]\n        : resolvedStatus;\n  return {\n    resolvedStatus,\n    explicitAllStatuses,\n    effectiveOptions,\n    filtersStatus,\n  };\n}\n\nfunction pageAndProjectListItems(\n  ordered: ListedItem[],\n  options: ListOptions,\n  projection: ListProjectionConfig,\n  treeEnabled: boolean,\n  cursorFingerprint: string,\n): ListPageResult {\n  if (options.after !== undefined && options.offset !== undefined) {\n    throw new PmCliError(\n      \"List --after cannot be combined with --offset.\",\n      EXIT_CODE.USAGE,\n    );\n  }\n  const limit = resolveListPageLimit(options, ordered.length);\n  const offset = resolveListPageStart(ordered, options, cursorFingerprint);\n  const limited =\n    limit === undefined\n      ? ordered.slice(offset)\n      : ordered.slice(offset, offset + limit);\n  const projected = projectListItems(limited, projection, treeEnabled);\n  const totalMatched = ordered.length;\n  const hasMore = limited.length > 0 && offset + limited.length < totalMatched;\n  const nextCursor =\n    hasMore && limited.length > 0\n      ? encodeQueryCursor(\n          cursorFingerprint,\n          limited[limited.length - 1]!.id,\n          offset + limited.length - 1,\n        )\n      : undefined;\n  return {\n    projected,\n    totalMatched,\n    truncationExtras:\n      projected.length < totalMatched || offset > 0\n        ? { total: totalMatched }\n        : {},\n    pageExtras: buildListPageExtras(limit, hasMore, nextCursor),\n  };\n}\n\nfunction buildListCursorFingerprint(\n  status: string | string[] | null,\n  options: ListOptions,\n  ordering: ListOrderingOptions,\n): string {\n  const normalizedOptions: Record<string, unknown> = { ...options };\n  delete normalizedOptions.after;\n  delete normalizedOptions.limit;\n  delete normalizedOptions.offset;\n  delete normalizedOptions.noTruncate;\n  delete normalizedOptions.includeBody;\n  delete normalizedOptions.compact;\n  delete normalizedOptions.brief;\n  delete normalizedOptions.full;\n  delete normalizedOptions.fields;\n  return createQueryFingerprint(\"list\", {\n    status,\n    options: normalizedOptions,\n    sort: ordering.sortField ?? \"default\",\n    order: ordering.sortOrder,\n    tree: ordering.treeEnabled,\n    tree_depth: ordering.treeDepth ?? null,\n  });\n}\n\nfunction buildVerboseListFilters(params: {\n  filtersStatus: string | string[] | null;\n  options: ListOptions;\n  noTruncate: boolean;\n  treeEnabled: boolean;\n  treeDepth: number | undefined;\n  sortField: ListSortField | undefined;\n  sortOrder: ListSortOrder;\n  runtimeFieldFilters: Record<string, unknown>;\n}): Record<string, unknown> {\n  const {\n    filtersStatus,\n    options,\n    noTruncate,\n    treeEnabled,\n    treeDepth,\n    sortField,\n    sortOrder,\n    runtimeFieldFilters,\n  } = params;\n  const filters: Record<string, unknown> = { status: filtersStatus };\n  if (options.dependencyBlocked === true) {\n    filters.blocked_semantics = \"status_or_dependency\";\n  }\n  const optionRecord = options as Record<string, unknown>;\n  for (const entry of VERBOSE_LIST_VALUE_FILTER_ECHO_ENTRIES) {\n    filters[entry.summaryKey] = optionRecord[entry.optionKey] ?? null;\n  }\n  for (const entry of VERBOSE_LIST_BOOLEAN_FILTER_ECHO_ENTRIES) {\n    if (optionRecord[entry.key] === true) {\n      filters[entry.summaryKey] = true;\n    }\n  }\n  Object.assign(\n    filters,\n    buildGovernanceMissingFilterEcho(options),\n    buildContentFilterEcho(options),\n  );\n  applyListWindowFilterEcho(filters, options);\n  if (noTruncate) {\n    filters.no_truncate = true;\n  }\n  if (treeEnabled) {\n    filters.tree = true;\n    filters.tree_depth = treeDepth ?? null;\n  }\n  filters.sort = sortField ?? null;\n  filters.order = sortField ? sortOrder : null;\n  filters.runtime_filters = runtimeFieldFilters;\n  return filters;\n}\n\n/** Return complete item metadata when the caller explicitly requests full projection. */\nexport function runList(\n  status: ItemStatus | undefined,\n  options: ListOptions & { full: true },\n  global: GlobalOptions,\n): Promise<ListFullResult>;\n/** Implements run list for the public runtime surface of this module. */\nexport function runList(\n  status: ItemStatus | undefined,\n  options: ListOptions,\n  global: GlobalOptions,\n): Promise<ListResult>;\n/** Execute a list query with projection-aware public result typing. */\nexport async function runList(\n  status: ItemStatus | undefined,\n  options: ListOptions,\n  global: GlobalOptions,\n): Promise<ListResult> {\n  const runtime = await resolveListRuntimeContext(options, global);\n  const listWarnings: string[] = [];\n  const items = await loadListItems(options, runtime, listWarnings);\n  const ordering = resolveListOrderingOptions(options);\n  const statusSelection = resolveListStatusSelection(\n    status,\n    options,\n    runtime.statusRegistry,\n  );\n  const filtered = applyFilters(\n    items,\n    statusSelection.resolvedStatus,\n    statusSelection.effectiveOptions,\n    runtime.typeRegistry,\n    runtime.statusRegistry,\n    runtime.runtimeFieldFilters,\n  );\n  // Edge-aware blocked selection (GH-578): classify against the complete\n  // loaded corpus so terminal blocker targets count as satisfied, then narrow\n  // the already-filtered rows to the shared blocked set.\n  const scoped =\n    options.dependencyBlocked === true\n      ? (() => {\n          const blockedIds = collectDependencyBlockedIds(\n            items,\n            runtime.statusRegistry,\n          );\n          return filtered.filter((item) =>\n            blockedIds.has(item.id.trim().toLowerCase()),\n          );\n        })()\n      : filtered;\n  const sorted = sortItems(\n    scoped,\n    ordering.sortField,\n    ordering.sortOrder,\n    runtime.statusRegistry,\n  );\n  const ordered = ordering.treeEnabled\n    ? orderItemsAsTree(sorted, ordering.parentRoot, ordering.treeDepth)\n    : sorted;\n  const noTruncate = options.noTruncate === true;\n  const page = pageAndProjectListItems(\n    ordered,\n    options,\n    runtime.projection,\n    ordering.treeEnabled,\n    buildListCursorFingerprint(\n      statusSelection.filtersStatus,\n      options,\n      ordering,\n    ),\n  );\n  const now = nowIso();\n  const warnings = [...new Set(listWarnings)].sort((left, right) =>\n    left.localeCompare(right),\n  );\n  const projectionFields =\n    runtime.projection.mode === \"full\" ? null : [...runtime.projection.fields];\n  const compactSummaryMode =\n    runtime.projection.mode === \"compact\" && options.compact === true;\n  if (compactSummaryMode) {\n    const compactFilters = buildCompactListFilterSummary({\n      filtersStatus: statusSelection.filtersStatus,\n      options,\n      treeEnabled: ordering.treeEnabled,\n      treeDepth: ordering.treeDepth,\n      sortField: ordering.sortField,\n      sortOrder: ordering.sortOrder,\n      runtimeFieldFilters: runtime.runtimeFieldFilters,\n    });\n    return {\n      items: page.projected,\n      count: page.projected.length,\n      ...page.truncationExtras,\n      ...page.pageExtras,\n      filters: compactFilters,\n      ...(warnings.length > 0 ? { warnings } : {}),\n    };\n  }\n  return {\n    items: page.projected,\n    count: page.projected.length,\n    ...page.truncationExtras,\n    ...page.pageExtras,\n    filters: buildVerboseListFilters({\n      filtersStatus: statusSelection.filtersStatus,\n      options,\n      noTruncate,\n      treeEnabled: ordering.treeEnabled,\n      treeDepth: ordering.treeDepth,\n      sortField: ordering.sortField,\n      sortOrder: ordering.sortOrder,\n      runtimeFieldFilters: runtime.runtimeFieldFilters,\n    }),\n    projection: {\n      mode: runtime.projection.mode,\n      fields: projectionFields,\n    },\n    sorting: {\n      sort: ordering.sortField ?? \"default\",\n      order: ordering.sortField ? ordering.sortOrder : \"asc\",\n    },\n    now,\n    ...(warnings.length > 0 ? { warnings } : {}),\n  };\n}\n\n/** Public contract for test only, shared by SDK and presentation-layer consumers. */\nexport const _testOnly = {\n  applyFilters,\n  buildCompactListFilterSummary,\n  buildContentFilterEcho,\n  buildGovernanceMissingFilterEcho,\n  resolveContentFieldFilters,\n  resolveMissingMetadataFilters,\n  compareBySortField,\n  compareDefaultSort,\n  compareNullableString,\n  compareNullableTimestamp,\n  normalizeProjectionField,\n  parseAssigneeFilter,\n  parseFieldSelectors,\n  parseIdsFilter,\n  parseOffset,\n  parseProjectionConfig,\n  resolveListUpdatedAfter,\n  resolveListPageLimit,\n  parseSortField,\n  parseSortOrder,\n  orderItemsAsTree,\n  projectListItems,\n  readListFieldValue,\n  runtimeMetadataKeysForProjection,\n  sortItems,\n  trimNonEmpty,\n  withTreeMetadata,\n};\n"],"names":[],"mappings":";;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AAeM,SAAU,kBACd,KACA,QAAQ,WAAS;AAEjB,MAAI,QAAQ;AAAW,WAAO;AAC9B,QAAM,aAAa,OAAO,GAAG,EAAE,KAAI;AACnC,QAAM,SAAS,WAAW,WAAW,IAAI,OAAO,MAAM,OAAO,UAAU;AACvE,MAAI,CAAC,OAAO,UAAU,MAAM,KAAK,SAAS,GAAG;AAC3C,UAAM,IAAI,WACR,GAAG,KAAK,mCACR,UAAU,KAAK;EAEnB;AACA,SAAO;AACT;AAGM,SAAU,cACd,KACA,QAAQ,cAAY;AAEpB,MAAI,QAAQ;AAAW,WAAO;AAC9B,QAAM,aAAa,OAAO,GAAG,EAAE,KAAI;AACnC,QAAM,SAAS,WAAW,WAAW,IAAI,OAAO,MAAM,OAAO,UAAU;AACvE,MAAI,CAAC,OAAO,UAAU,MAAM,KAAK,SAAS,KAAK,SAAS,GAAG;AACzD,UAAM,IAAI,WAAW,GAAG,KAAK,wBAAwB,UAAU,KAAK;EACtE;AACA,SAAO;AACT;AAGM,SAAU,UACd,KACA,cACA,QAAQ,UAAQ;AAEhB,MAAI,QAAQ;AAAW,WAAO;AAC9B,QAAM,SAAS,gBAAgB,KAAK,YAAY;AAChD,MAAI,CAAC,QAAQ;AACX,UAAM,IAAI,WACR,GAAG,KAAK,0BAA0B,aAAa,MAAM,KAAK,GAAG,CAAC,IAC9D,UAAU,KAAK;EAEnB;AACA,SAAO;AACT;;;AC3CA,IAAM,uBAEF;EACF,MAAM;EACN,QAAQ;EACR,UAAU;EACV,WAAW;;AAGb,IAAM,sBAAsB;AAGtB,SAAU,uBAAuB,KAAY;AACjD,MAAI,OAAO,QAAQ,UAAU;AAC3B,WAAO;EACT;AACA,QAAM,SAAS,IACZ,MAAM,GAAG,EACT,IAAI,CAAC,UAAU,MAAM,KAAI,EAAG,YAAW,CAAE,EACzC,OAAO,CAAC,UAAU,MAAM,SAAS,CAAC;AACrC,SAAO,OAAO,WAAW,KAAK,OAAO,CAAC,MAAM;AAC9C;AAUM,SAAU,yBACd,OACA,UAA+B;AAE/B,QAAM,UAAU,MAAM,KAAI,EAAG,YAAW;AACxC,MAAI,QAAQ,WAAW,GAAG;AACxB,WAAO;EACT;AACA,QAAM,QAAQ,qBAAqB,OAAO;AAC1C,MAAI,OAAO;AACT,WAAO,SAAS,KAAK;EACvB;AACA,SAAO,qBAAqB,OAAO,QAAQ;AAC7C;AAEA,SAAS,kCACP,UAA+B;AAE/B,QAAM,aAAa,IAAI,IAAY,OAAO,KAAK,oBAAoB,CAAC;AACpE,aAAW,cAAc,SAAS,aAAa;AAC7C,eAAW,IAAI,WAAW,EAAE;AAC5B,eAAW,SAAS,WAAW,SAAS;AACtC,iBAAW,IAAI,KAAK;IACtB;EACF;AACA,SAAO,CAAC,GAAG,UAAU;AACvB;AAEA,SAAS,qBACP,OACA,UAA+B;AAI/B,QAAM,aAAa,MAAM,KAAI,EAAG,YAAW;AAC3C,MAAI;AACJ,MAAI,eAAe,OAAO;AAC1B,aAAW,aAAa,kCAAkC,QAAQ,GAAG;AACnE,UAAM,WAAW,+BACf,YACA,UAAU,YAAW,GACrB,CAAC;AAEH,QAAI,aAAa,QAAQ,WAAW,cAAc;AAChD,aAAO;AACP,qBAAe;IACjB;EACF;AACA,SAAO;AACT;AAWM,SAAU,qBACd,KACA,UACA,SAAkC;AAElC,MAAI,OAAO,QAAQ,UAAU;AAC3B,WAAO;EACT;AACA,QAAM,SAAS,SAAS,WAAW;AACnC,QAAM,YAAY,SAAS,aAAa;AACxC,QAAM,SAAS,IACZ,MAAM,GAAG,EACT,IAAI,CAAC,UAAU,MAAM,KAAI,CAAE,EAC3B,OAAO,CAAC,UAAU,MAAM,SAAS,CAAC;AACrC,MAAI,OAAO,WAAW,GAAG;AACvB,WAAO;EACT;AACA,QAAM,gBAAgB,OAAO,OAC3B,CAAC,UAAU,MAAM,KAAI,EAAG,YAAW,MAAO,mBAAmB,EAC7D;AACF,MAAI,gBAAgB,GAAG;AACrB,QAAI,OAAO,WAAW,GAAG;AACvB,aAAO;IACT;AACA,UAAM,IAAI,WACR,WAAW,SAAS,2CAA2C,SAAS,4BACxE,UAAU,KAAK;EAEnB;AACA,QAAM,WAAyB,CAAA;AAC/B,aAAW,SAAS,QAAQ;AAC1B,UAAM,SAAS,yBAAyB,OAAO,QAAQ;AACvD,QAAI,WAAW,QAAW;AACxB,UAAI,QAAQ;AACV,cAAM,aAAa,qBAAqB,OAAO,QAAQ;AACvD,cAAM,IAAI,WACR,WAAW,SAAS,WAAW,KAAK,wDAClC,aAAa,mBAAmB,UAAU,OAAO,GACnD,IACA,UAAU,KAAK;MAEnB;AACA,eAAS,KAAK,KAAmB;AACjC;IACF;AACA,aAAS,KAAK,MAAM;EACtB;AACA,SAAO,CAAC,GAAG,IAAI,IAAI,QAAQ,CAAC;AAC9B;;;AC7IA,SAAS,YAAY,MAAe,OAAc;AAChD,SAAO,kBAAkB,MAAM,KAAK;AACtC;AAGM,SAAU,2BACd,SACA,eACA,SAA4B;AAE5B,QAAM,UAAmC,CAAA;AACzC,aAAW,cAAc,cAAc,kBAAkB,IAAI,OAAO,KAAK,CAAA,GAAI;AAC3E,UAAM,WAAW,4BAA4B,SAAS,UAAU;AAChE,QAAI,aAAa,QAAW;AAC1B;IACF;AACA,YAAQ,WAAW,YAAY,IAAI,wBACjC,YACA,QAAQ;EAEZ;AACA,SAAO;AACT;AAGM,SAAU,sBACd,MACA,SAAgC;AAEhC,aAAW,CAAC,UAAU,aAAa,KAAK,OAAO,QAAQ,OAAO,GAAG;AAC/D,UAAM,cAAc,KAAK,QAAQ;AACjC,QAAI,MAAM,QAAQ,aAAa,GAAG;AAChC,UAAI,MAAM,QAAQ,WAAW,GAAG;AAC9B,cAAM,mBAAmB,YAAY,IAAI,CAAC,UAAU,OAAO,KAAK,CAAC;AACjE,cAAM,qBAAqB,cAAc,IAAI,CAAC,UAAU,OAAO,KAAK,CAAC;AACrE,YACE,CAAC,mBAAmB,MAAM,CAAC,UAAU,iBAAiB,SAAS,KAAK,CAAC,GACrE;AACA,iBAAO;QACT;AACA;MACF;AACA,UAAI,CAAC,YAAY,aAAa,cAAc,cAAc,SAAS,CAAC,CAAC,GAAG;AACtE,eAAO;MACT;AACA;IACF;AACA,QAAI,CAAC,YAAY,aAAa,aAAa,GAAG;AAC5C,aAAO;IACT;EACF;AACA,SAAO;AACT;;;ACxCO,IAAM,sBAA+C;EAC1D;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;;AAyBF,SAAS,WAAW,OAAc;AAChC,SAAO,MAAM,QAAQ,KAAK,KAAK,MAAM,SAAS;AAChD;AAGA,SAAS,QAAQ,MAAa;AAC5B,SAAO,OAAO,SAAS,YAAY,KAAK,KAAI,EAAG,SAAS;AAC1D;AAGA,SAAS,iBAAiB,OAAc;AACtC,MAAI,CAAC,MAAM,QAAQ,KAAK,GAAG;AACzB,WAAO;EACT;AACA,SAAO,MAAM,KAAK,CAAC,UAAS;AAC1B,QAAI,OAAO,UAAU,YAAY,UAAU,MAAM;AAC/C,aAAO;IACT;AACA,UAAM,UAAW,MAAgC;AACjD,WAAO,OAAO,YAAY,YAAY,QAAQ,KAAI,EAAG,SAAS;EAChE,CAAC;AACH;AAGM,SAAU,sBACd,MACA,OAAmB;AAEnB,UAAQ,OAAO;IACb,KAAK;AACH,aAAO,WAAW,KAAK,KAAK;IAC9B,KAAK;AACH,aAAO,WAAW,KAAK,SAAS;IAClC,KAAK;AACH,aAAO,WAAW,KAAK,KAAK;IAC9B,KAAK;AACH,aAAO,WAAW,KAAK,IAAI;IAC7B,KAAK;AACH,aAAO,WAAW,KAAK,KAAK;IAC9B,KAAK;AACH,aAAO,WAAW,KAAK,QAAQ;IACjC,KAAK;AACH,aAAO,WAAW,KAAK,YAAY;IACrC,KAAK;AACH,aAAO,QAAQ,KAAK,IAAI;IAC1B,KAAK;AACH,aAAO,iBAAiB,KAAK,KAAK;EACtC;AAKF;AAWM,SAAU,sBAAsB,SAA4B;AAChE,SAAO,oBAAoB,KAAK,CAAC,UAAU,QAAQ,KAAK,MAAM,MAAS;AACzE;AAQM,SAAU,0BACd,MACA,SAA4B;AAE5B,aAAW,SAAS,qBAAqB;AACvC,UAAM,YAAY,QAAQ,KAAK;AAC/B,QAAI,cAAc,QAAW;AAC3B;IACF;AACA,UAAM,UAAU,sBAAsB,MAAM,KAAK;AACjD,QAAI,cAAc,aAAa,CAAC,SAAS;AACvC,aAAO;IACT;AACA,QAAI,cAAc,YAAY,SAAS;AACrC,aAAO;IACT;EACF;AACA,SAAO;AACT;AAcM,SAAU,8BACd,SAA4B;AAE5B,SAAO,oBAAoB,KACzB,CAAC,UAAU,UAAU,UAAU,QAAQ,KAAK,MAAM,MAAS;AAE/D;AAGM,SAAU,uBAAuB,SAA4B;AACjE,SAAO,QAAQ,SAAS;AAC1B;AA6BA,SAAS,aAAa,SAAiB,OAAa;AAClD,MAAI,UAAU,GAAG;AACf,WAAO;EACT;AACA,SAAO,KAAK,MAAO,UAAU,QAAS,GAAI,IAAI;AAChD;AAEA,SAAS,yBAAsB;AAI7B,QAAM,SAAS,CAAA;AACf,aAAW,SAAS,qBAAqB;AACvC,WAAO,KAAK,IAAI,EAAE,SAAS,GAAG,OAAO,GAAG,SAAS,IAAG;EACtD;AACA,SAAO;AACT;AAGM,SAAU,+BACd,OAAkC;AAElC,QAAM,SAAS,uBAAsB;AACrC,QAAM,QAAQ,MAAM;AACpB,aAAW,QAAQ,OAAO;AACxB,eAAW,SAAS,qBAAqB;AACvC,UAAI,sBAAsB,MAAM,KAAK,GAAG;AACtC,eAAO,KAAK,EAAE,WAAW;MAC3B;IACF;EACF;AACA,aAAW,SAAS,qBAAqB;AACvC,WAAO,KAAK,EAAE,QAAQ;AACtB,WAAO,KAAK,EAAE,UAAU,aAAa,OAAO,KAAK,EAAE,SAAS,KAAK;EACnE;AACA,QAAM,gBAAgB,OAAO;AAC7B,QAAM,iBAAiB,QAAQ,cAAc;AAC7C,QAAM,YAAqC;IACzC,SAAS;IACT;IACA,SAAS,aAAa,gBAAgB,KAAK;;AAE7C,SAAO;IACL,aAAa;IACb;IACA,gBAAgB;IAChB,YAAY;;AAEhB;;;AC/HO,IAAM,gCAAgC,CAAC,YAUjB;AAC3B,SAAO;IACL,WAAW,QAAQ,oBAAoB;IACvC,kBAAkB,QAAQ,2BAA2B;IACrD,mBAAmB,QAAQ,4BAA4B;IACvD,iBAAiB,QAAQ,0BAA0B;IACnD,iBAAiB,QAAQ,0BAA0B;IACnD,aAAa,QAAQ,sBAAsB;IAC3C,mBAAmB,QAAQ,4BAA4B;IACvD,eAAe,QAAQ,wBAAwB;IAC/C,gBAAgB,QAAQ,yBAAyB;;AAErD;AAYA,IAAM,8BAAkE;EACtE;IACE,OAAO;IACP,YAAY;IACZ,WAAW;IACX,aAAa;IACb,YAAY;;EAEd;IACE,OAAO;IACP,YAAY;IACZ,WAAW;IACX,aAAa;IACb,YAAY;;EAEd;IACE,OAAO;IACP,YAAY;IACZ,WAAW;IACX,aAAa;IACb,YAAY;;EAEd;IACE,OAAO;IACP,YAAY;IACZ,WAAW;IACX,aAAa;IACb,YAAY;;EAEd;IACE,OAAO;IACP,YAAY;IACZ,WAAW;IACX,aAAa;IACb,YAAY;;EAEd;IACE,OAAO;IACP,YAAY;IACZ,WAAW;IACX,aAAa;IACb,YAAY;;EAEd;IACE,OAAO;IACP,YAAY;IACZ,WAAW;IACX,aAAa;IACb,YAAY;;EAEd;IACE,OAAO;IACP,YAAY;IACZ,WAAW;IACX,aAAa;IACb,YAAY;;EAEd;IACE,OAAO;IACP,YAAY;IACZ,WAAW;IACX,aAAa;IACb,YAAY;;;AAKT,IAAM,6BAA6B,CACxC,YACuB;AACvB,QAAM,WAAW,4BAA4B,KAC3C,CAAC,YACC,QAAQ,QAAQ,UAAU,MAAM,QAChC,QAAQ,QAAQ,SAAS,MAAM,IAAI;AAEvC,MAAI,UAAU;AACZ,UAAM,IAAI,WACR,kBAAkB,SAAS,WAAW,SAAS,SAAS,UAAU,wBAClE,UAAU,KAAK;EAEnB;AACA,SAAO,OAAO,YACZ,4BAA4B,QAGzB,CAAC,YAAW;AACb,QAAI,QAAQ,QAAQ,UAAU,MAAM,MAAM;AACxC,aAAO,CAAC,CAAC,QAAQ,OAAO,SAAS,CAAC;IACpC;AACA,WAAO,QAAQ,QAAQ,SAAS,MAAM,OAClC,CAAC,CAAC,QAAQ,OAAO,QAAQ,CAAC,IAC1B,CAAA;EACN,CAAC,CAAC;AAEN;AAkCO,IAAM,mBAAmB;EAC9B;EACA;EACA;EACA;EACA;EACA;;AAMK,IAAM,yBAAyB,CAAC,OAAO,MAAM;AAIpD,IAAM,8BAA8B;EAClC;EACA;EACA;EACA;EACA;EACA;EACA;;AAEF,IAAM,oBAAoB,CAAC,MAAM,UAAU,QAAQ,OAAO;AAC1D,IAAM,uBAAuB;EAC3B;EACA;EACA;EACA;;AAOF,IAAM,0BAA+C,IAAI,IACvD,mBAAmB;AAgErB,SAAS,iBAAiB,OAAc;AACtC,SACE,OAAO,UAAU,YACjB,UAAU,QACV,CAAC,MAAM,QAAQ,KAAK,KACpB,OAAO,KAAK,KAAK,EAAE,SAAS;AAEhC;AAKA,IAAM,8BAGD;EACH,EAAE,KAAK,YAAY,YAAY,YAAW;EAC1C,EAAE,KAAK,gBAAgB,YAAY,gBAAe;EAClD,EAAE,KAAK,YAAY,YAAY,YAAW;EAC1C,EAAE,KAAK,WAAW,YAAY,WAAU;EACxC,EAAE,KAAK,YAAY,YAAY,YAAW;EAC1C,EAAE,KAAK,eAAe,YAAY,eAAc;EAChD,EAAE,KAAK,WAAW,YAAY,WAAU;EACxC,EAAE,KAAK,WAAW,YAAY,WAAU;EACxC,EAAE,KAAK,oBAAoB,YAAY,qBAAoB;EAC3D,EAAE,KAAK,WAAW,YAAY,WAAU;EACxC,EAAE,KAAK,eAAe,YAAY,eAAc;EAChD,EAAE,KAAK,WAAW,YAAY,WAAU;EACxC,EAAE,KAAK,UAAU,YAAY,UAAS;EACtC,EAAE,KAAK,WAAW,YAAY,WAAU;EACxC,EAAE,KAAK,cAAc,YAAY,cAAa;EAC9C,EAAE,KAAK,UAAU,YAAY,UAAS;EACtC,EAAE,KAAK,aAAa,YAAY,aAAY;EAC5C,EAAE,KAAK,mBAAmB,YAAY,oBAAmB;;AAK3D,IAAM,kCAGD;EACH,EAAE,KAAK,yBAAyB,YAAY,0BAAyB;EACrE,EAAE,KAAK,qBAAqB,YAAY,sBAAqB;EAC7D,EAAE,KAAK,2BAA2B,YAAY,4BAA2B;EACzE,EAAE,KAAK,uBAAuB,YAAY,wBAAuB;EACjE,EAAE,KAAK,wBAAwB,YAAY,yBAAwB;;AAGrE,SAAS,uBACP,SACA,SAAgC;AAEhC,aAAW,SAAS,6BAA6B;AAC/C,QAAI,QAAQ,MAAM,GAAG,MAAM,MAAM;AAC/B,cAAQ,MAAM,UAAU,IAAI;IAC9B;EACF;AACF;AAEA,SAAS,iCACP,SACA,SAAgC;AAEhC,aAAW,SAAS,iCAAiC;AACnD,QAAI,QAAQ,MAAM,GAAG,MAAM,MAAM;AAC/B,cAAQ,MAAM,UAAU,IAAI;IAC9B;EACF;AACF;AAgBM,SAAU,qBACd,SACA,SACA,SAA4C;AAE5C,aAAW,SAAS,SAAS;AAC3B,UAAM,QAAQ,QAAQ,MAAM,SAAS;AACrC,QAAI,UAAU,QAAW;AACvB,cAAQ,MAAM,UAAU,IAAI,MAAM,YAC9B,MAAM,UAAU,KAAK,IACrB;IACN;EACF;AACF;AAGM,SAAU,uBACd,SAAgC;AAEhC,QAAM,OAA6B,CAAA;AACnC,yBAAuB,MAAM,OAAO;AACpC,SAAO;AACT;AAGM,SAAU,iCACd,SAAgC;AAEhC,QAAM,OAA6B,CAAA;AACnC,mCAAiC,MAAM,OAAO;AAC9C,SAAO;AACT;AAEA,IAAM,yCACJ;EACE,EAAE,WAAW,QAAQ,YAAY,OAAM;EACvC,EAAE,WAAW,OAAO,YAAY,MAAK;EACrC,EAAE,WAAW,YAAY,YAAY,WAAU;EAC/C,EAAE,WAAW,kBAAkB,YAAY,kBAAiB;EAC5D,EAAE,WAAW,iBAAiB,YAAY,iBAAgB;EAC1D,EAAE,WAAW,gBAAgB,YAAY,gBAAe;EACxD,EAAE,WAAW,iBAAiB,YAAY,iBAAgB;EAC1D,EAAE,WAAW,gBAAgB,YAAY,gBAAe;EACxD,EAAE,WAAW,iBAAiB,YAAY,iBAAgB;EAC1D,EAAE,WAAW,OAAO,YAAY,MAAK;EACrC,EAAE,WAAW,YAAY,YAAY,WAAU;EAC/C,EAAE,WAAW,kBAAkB,YAAY,kBAAiB;EAC5D,EAAE,WAAW,UAAU,YAAY,SAAQ;EAC3C,EAAE,WAAW,UAAU,YAAY,SAAQ;EAC3C,EAAE,WAAW,WAAW,YAAY,UAAS;;AAGjD,IAAM,yCACJ;EACE,EAAE,WAAW,QAAQ,YAAY,OAAM;EACvC,EAAE,WAAW,OAAO,YAAY,MAAK;EACrC,EAAE,WAAW,YAAY,YAAY,WAAU;EAC/C,EAAE,WAAW,kBAAkB,YAAY,kBAAiB;EAC5D,EAAE,WAAW,iBAAiB,YAAY,iBAAgB;EAC1D,EAAE,WAAW,gBAAgB,YAAY,gBAAe;EACxD,EAAE,WAAW,iBAAiB,YAAY,iBAAgB;EAC1D,EAAE,WAAW,gBAAgB,YAAY,gBAAe;EACxD,EAAE,WAAW,iBAAiB,YAAY,iBAAgB;EAC1D,EAAE,WAAW,OAAO,YAAY,MAAK;EACrC,EAAE,WAAW,YAAY,YAAY,WAAU;EAC/C,EAAE,WAAW,kBAAkB,YAAY,kBAAiB;EAC5D,EAAE,WAAW,UAAU,YAAY,SAAQ;EAC3C,EAAE,WAAW,UAAU,YAAY,SAAQ;EAC3C,EAAE,WAAW,WAAW,YAAY,UAAS;EAC7C,EAAE,WAAW,SAAS,YAAY,QAAO;EACzC,EAAE,WAAW,UAAU,YAAY,SAAQ;EAC3C,EAAE,WAAW,eAAe,YAAY,eAAc;EACtD,EAAE,WAAW,WAAW,YAAY,UAAS;EAC7C,EAAE,WAAW,UAAU,YAAY,SAAQ;;AAG/C,IAAM,2CAGD;EACH,EAAE,KAAK,mBAAmB,YAAY,oBAAmB;EACzD,EAAE,KAAK,0BAA0B,YAAY,2BAA0B;EACvE,EAAE,KAAK,2BAA2B,YAAY,4BAA2B;EACzE,EAAE,KAAK,yBAAyB,YAAY,0BAAyB;;AAGvE,IAAM,qBAAqB;AAE3B,SAAS,8BAA8B,QAQtC;AACC,QAAM,EACJ,eACA,SACA,aACA,WACA,WACA,WACA,oBAAmB,IACjB;AACJ,QAAM,UAAmC,CAAA;AACzC,MAAI,kBAAkB,MAAM;AAC1B,YAAQ,SAAS;EACnB;AACA,MAAI,QAAQ,sBAAsB,MAAM;AACtC,YAAQ,oBAAoB;EAC9B;AACA,uBACE,SACA,SACA,sCAAsC;AAExC,4BAA0B,SAAS,OAAO;AAC1C,MAAI,QAAQ,oBAAoB,MAAM;AACpC,YAAQ,oBAAoB;EAC9B;AACA,MAAI,QAAQ,2BAA2B,MAAM;AAC3C,YAAQ,2BAA2B;EACrC;AACA,MAAI,QAAQ,4BAA4B,MAAM;AAC5C,YAAQ,4BAA4B;EACtC;AACA,MAAI,QAAQ,0BAA0B,MAAM;AAC1C,YAAQ,0BAA0B;EACpC;AACA,mCAAiC,SAAS,OAAO;AACjD,yBAAuB,SAAS,OAAO;AACvC,MAAI,QAAQ,UAAU,QAAW;AAC/B,YAAQ,QAAQ,QAAQ;EAC1B;AACA,MAAI,QAAQ,WAAW,QAAW;AAChC,YAAQ,SAAS,QAAQ;EAC3B;AACA,MAAI,QAAQ,gBAAgB,MAAM;AAChC,YAAQ,eAAe;EACzB;AACA,MAAI,QAAQ,WAAW,QAAW;AAChC,YAAQ,SAAS,QAAQ;EAC3B;AACA,MAAI,aAAa;AACf,YAAQ,OAAO;AACf,QAAI,cAAc,QAAW;AAC3B,cAAQ,aAAa;IACvB;EACF;AACA,MAAI,cAAc,QAAW;AAC3B,YAAQ,OAAO;AACf,YAAQ,QAAQ;EAClB;AACA,MAAI,iBAAiB,mBAAmB,GAAG;AACzC,YAAQ,kBAAkB;EAC5B;AACA,SAAO;AACT;AAEA,SAAS,mBACP,MACA,OACA,gBAAqC;AAErC,QAAM,eAAe,iBAAiB,KAAK,QAAQ,cAAc;AACjE,QAAM,gBAAgB,iBAAiB,MAAM,QAAQ,cAAc;AACnE,MAAI,iBAAiB,eAAe;AAClC,WAAO,eAAe,IAAI;EAC5B;AACA,QAAM,aAAa,KAAK,WAAW,MAAM;AACzC,MAAI,eAAe,GAAG;AACpB,WAAO;EACT;AACA,QAAM,YAAY,wBAAwB,MAAM,YAAY,KAAK,UAAU;AAC3E,MAAI,cAAc,GAAG;AACnB,WAAO;EACT;AACA,UAAQ,KAAK,MAAM,IAAI,cAAc,MAAM,MAAM,EAAE;AACrD;AAEA,SAAS,iBACP,OACA,gBAAqC;AAErC,SAAO,CAAC,GAAG,KAAK,EAAE,KAAK,CAAC,MAAM,UAC5B,mBAAmB,MAAM,OAAO,cAAc,CAAC;AAEnD;AAEA,SAAS,cACP,KACA,YAAkB;AAElB,MAAI,QAAQ;AAAW,WAAO;AAC9B,SAAO,qBAAqB,KAAK,oBAAI,KAAI,GAAI,UAAU;AACzD;AAQA,SAAS,qBACP,KACA,YAAkB;AAElB,MAAI,OAAO;AAAM,WAAO;AACxB,QAAM,QAAQ,OAAO,GAAG,EAAE,KAAI;AAC9B,MAAI,MAAM,WAAW;AAAG,WAAO;AAC/B,SAAO,qBAAqB,OAAO,oBAAI,KAAI,GAAI,UAAU;AAC3D;AAEA,SAAS,wBAAwB,SAAoB;AACnD,QAAM,kBACJ,QAAQ,gBAAgB,QACxB,OAAO,QAAQ,YAAY,EAAE,KAAI,EAAG,SAAS;AAC/C,QAAM,kBAAkB;IACtB,QAAQ,UAAU;IAClB,QAAQ,WAAW;IACnB;IACA,OAAO,CAAC,aAAa,QAAQ,EAAE;AACjC,MAAI,kBAAkB,GAAG;AACvB,UAAM,IAAI,WACR,6EACA,UAAU,KAAK;EAEnB;AACA,MAAI,QAAQ,UAAU,MAAM;AAC1B,UAAM,QAAQ,oBAAI,KAAI;AACtB,UAAM,SAAS,GAAG,GAAG,GAAG,CAAC;AACzB,WAAO,MAAM,YAAW;EAC1B;AACA,MAAI,QAAQ,WAAW,MAAM;AAC3B,WAAO,qBAAqB,oBAAoB,QAAQ;EAC1D;AACA,SAAO,qBAAqB,QAAQ,cAAc,eAAe;AACnE;AAEA,SAAS,0BACP,SACA,SAAoB;AAEpB,MAAI,QAAQ,UAAU,MAAM;AAC1B,YAAQ,QAAQ;EAClB;AACA,MAAI,QAAQ,WAAW,MAAM;AAC3B,YAAQ,SAAS;EACnB;AACF;AAEA,SAAS,eAAe,KAAY;AAClC,MAAI,OAAO;AAAM,WAAO;AACxB,QAAM,QAAQ,OAAO,GAAG,EAAE,KAAI;AAC9B,MAAI,MAAM,WAAW,GAAG;AACtB,UAAM,IAAI,WACR,iDACA,UAAU,KAAK;EAEnB;AACA,QAAM,MAAM,MACT,MAAM,GAAG,EACT,IAAI,CAAC,UAAU,MAAM,KAAI,CAAE,EAC3B,OAAO,CAAC,UAAU,MAAM,SAAS,CAAC;AACrC,MAAI,IAAI,WAAW,GAAG;AACpB,UAAM,IAAI,WACR,iDACA,UAAU,KAAK;EAEnB;AACA,SAAO,IAAI,IAAI,GAAG;AACpB;AAEA,SAAS,YAAY,KAAuB;AAC1C,MAAI,QAAQ;AAAW,WAAO;AAC9B,QAAM,aAAa,OAAO,GAAG,EAAE,KAAI;AACnC,QAAM,SAAS,WAAW,WAAW,IAAI,OAAO,MAAM,OAAO,UAAU;AACvE,MAAI,CAAC,OAAO,UAAU,MAAM,KAAK,SAAS,GAAG;AAC3C,UAAM,IAAI,WACR,gDACA,UAAU,KAAK;EAEnB;AACA,SAAO;AACT;AAEA,SAAS,oBAAoB,KAAuB;AAClD,MAAI,QAAQ,QAAW;AACrB,WAAO;EACT;AACA,QAAM,YAAY,IACf,MAAM,GAAG,EACT,IAAI,CAAC,UAAU,MAAM,KAAI,CAAE,EAC3B,OAAO,CAAC,UAAU,MAAM,SAAS,CAAC;AACrC,MAAI,UAAU,WAAW,GAAG;AAC1B,UAAM,IAAI,WACR,gEACA,UAAU,KAAK;EAEnB;AACA,SAAO,CAAC,GAAG,IAAI,IAAI,SAAS,CAAC;AAC/B;AAEA,SAAS,sBAAsB,SAAoB;AACjD,QAAM,mBAAmB,QAAQ,YAAY;AAC7C,QAAM,iBAAiB,QAAQ,UAAU;AACzC,QAAM,gBAAgB,QAAQ,SAAS;AACvC,QAAM,iBAAiB,oBAAoB,QAAQ,MAAM;AACzD,QAAM,eACJ,OAAO,gBAAgB,IACvB,OAAO,cAAc,IACrB,OAAO,aAAa,IACpB,OAAO,mBAAmB,MAAS;AACrC,MAAI,eAAe,GAAG;AACpB,UAAM,IAAI,WACR,uGACA,UAAU,KAAK;EAEnB;AACA,MAAI,eAAe;AACjB,WAAO;MACL,MAAM;MACN,QAAQ,CAAA;;EAEZ;AACA,MAAI,gBAAgB;AAClB,WAAO;MACL,MAAM;MACN,QAAQ,CAAC,GAAG,iBAAiB;;EAEjC;AACA,MAAI,kBAAkB;AACpB,WAAO;MACL,MAAM;MACN,QAAQ,CAAC,GAAG,2BAA2B;;EAE3C;AACA,MAAI,gBAAgB;AAClB,WAAO;MACL,MAAM;MACN,QAAQ;;EAEZ;AACA,SAAO;IACL,MAAM;IACN,QAAQ,CAAA;;AAEZ;AAEA,SAAS,yBAAyB,OAAa;AAC7C,SAAO,MAAM,WAAW,OAAO,IAAI,MAAM,MAAM,QAAQ,MAAM,IAAI;AACnE;AAEA,SAAS,6BACP,YACA,qBAAqC;AAErC,MAAI,WAAW,SAAS,UAAU;AAChC;EACF;AACA,QAAM,UAAU,oBAAI,IAAI;IACtB,GAAG;IACH;IACA,GAAG;IACH,GAAG;GACJ;AACD,QAAM,UAAU,WAAW,OAAO,OAChC,CAAC,UAAU,CAAC,QAAQ,IAAI,yBAAyB,KAAK,CAAC,CAAC;AAE1D,MAAI,QAAQ,SAAS,GAAG;AACtB,UAAM,IAAI,WACR,mCAAmC,QAAQ,KAAK,IAAI,CAAC,IACrD,UAAU,OACV;MACE,MAAM;MACN,UAAU;QACR;QACA;QACA;;KAEH;EAEL;AACF;AAKA,IAAM,0BAA8D,oBAAI,IAGtE;EACA,CAAC,WAAW,YAAY;EACxB,CAAC,UAAU,YAAY;EACvB,CAAC,YAAY,YAAY;EACzB,CAAC,WAAW,YAAY;EACxB,CAAC,UAAU,YAAY;CACxB;AAED,SAAS,eAAe,KAAuB;AAC7C,MAAI,QAAQ,QAAW;AACrB,WAAO;EACT;AACA,QAAM,aAAa,IAAI,KAAI,EAAG,YAAW;AACzC,QAAM,UAAU,wBAAwB,IAAI,UAAU;AACtD,MAAI,SAAS;AACX,WAAO;EACT;AACA,MAAI,CAAC,iBAAiB,SAAS,UAA2B,GAAG;AAC3D,UAAM,IAAI,WACR,6BAA6B,iBAAiB,KAAK,GAAG,CAAC,wDACvD,UAAU,KAAK;EAEnB;AACA,SAAO;AACT;AAEA,SAAS,eAAe,KAAuB;AAC7C,MAAI,QAAQ,QAAW;AACrB,WAAO;EACT;AACA,QAAM,aAAa,IAAI,KAAI,EAAG,YAAW;AACzC,MAAI,CAAC,uBAAuB,SAAS,UAA2B,GAAG;AACjE,UAAM,IAAI,WACR,6BAA6B,uBAAuB,KAAK,GAAG,CAAC,IAC7D,UAAU,KAAK;EAEnB;AACA,SAAO;AACT;AAEA,SAAS,eAAe,KAAuB;AAC7C,SAAO,kBAAkB,KAAK,cAAc;AAC9C;AAEA,SAAS,oBACP,KAAuB;AAEvB,MAAI,QAAQ,QAAW;AACrB,WAAO;EACT;AACA,QAAM,aAAa,IAAI,KAAI,EAAG,YAAW;AACzC,MAAI,CAAC,YAAY;AACf,UAAM,IAAI,WACR,sDACA,UAAU,KAAK;EAEnB;AACA,MAAI,eAAe,cAAc,eAAe,cAAc;AAC5D,UAAM,IAAI,WACR,4BAA4B,GAAG,mCAC/B,UAAU,KAAK;EAEnB;AACA,SAAO;AACT;AAIA,SAAS,oBACP,QACA,gBAAqC;AAErC,SAAO,qBAAqB,QAAQ,gBAAgB,EAAE,QAAQ,KAAI,CAAE;AACtE;AA4BA,SAAS,0BACP,gBACA,oBAAyD;AAEzD,MACE,mBACC,eAAe,YAAW,MAAO,UAChC,eAAe,YAAW,MAAO,SACnC;AACA,UAAM,IAAI,WACR,oFACA,UAAU,KAAK;EAEnB;AACA,MAAI,mBAAmB,UAAa,uBAAuB,cAAc;AACvE,UAAM,IAAI,WACR,+DACA,UAAU,KAAK;EAEnB;AACF;AAEA,SAAS,qBACP,QACA,SACA,cACA,gBAAqC;AAErC,QAAM,iBAAiB,QAAQ,UAAU,KAAI;AAC7C,QAAM,qBAAqB,oBAAoB,QAAQ,cAAc;AACrE,4BAA0B,gBAAgB,kBAAkB;AAC5D,QAAM,yBAAyB,8BAA8B,OAAO;AACpE,QAAM,sBAAsB,2BAC1B,OAAkC;AAEpC,SAAO;IACL,WAAW,eAAe,QAAQ,GAAG;IACrC,WACE,UAAU,OAAO,SAAS,IAAI,IAAI,IAAgB,MAAM,IAAI;IAC9D,iBAAiB,QAAQ,oBAAoB;IAC7C,YAAY,UAAU,QAAQ,MAAM,YAAY;IAChD,WAAW,QAAQ,KAAK,KAAI,EAAG,YAAW;IAC1C,gBAAgB,cAAc,QAAQ,QAAQ;IAC9C,gBAAgB,cAAc,QAAQ,gBAAgB,iBAAiB;IACvE,eAAe,cAAc,QAAQ,eAAe,gBAAgB;IACpE,cAAc,wBAAwB,OAAO;IAC7C,eAAe,qBACb,QAAQ,eACR,gBAAgB;IAElB,cAAc,qBAAqB,QAAQ,cAAc,eAAe;IACxE,eAAe,qBACb,QAAQ,eACR,gBAAgB;IAElB;IACA;IACA,cAAc,QAAQ,QAAQ,KAAI;IAClC,aAAa,QAAQ,SAAS;IAC9B,cAAc,QAAQ,QAAQ,KAAI;IAClC,eAAe,QAAQ,SAAS,KAAI;IACpC;IACA,uBAAuB,yBAAyB,sBAAsB;IACtE,qBAAqB,sCAAsC,cAAc;IACzE;IACA,sBAAsB,sBAAsB,mBAAmB;;AAEnE;AAEA,SAAS,yBACP,MACA,SACA,gBAAqC;AAErC,SACE,2BAA2B,MAAM,SAAS,cAAc,KACxD,uBAAuB,MAAM,OAAO,KACpC,6BAA6B,MAAM,OAAO,KAC1C,wBAAwB,MAAM,OAAO;AAEzC;AAEA,SAAS,2BACP,MACA,SACA,gBAAqC;AAErC,MAAI,QAAQ,aAAa,CAAC,QAAQ,UAAU,IAAI,KAAK,EAAE;AAAG,WAAO;AACjE,MAAI,QAAQ,aAAa,CAAC,QAAQ,UAAU,IAAI,KAAK,MAAM;AAAG,WAAO;AACrE,MAAI,QAAQ,mBAAmB,iBAAiB,KAAK,QAAQ,cAAc;AACzE,WAAO;AACT,MAAI,QAAQ,cAAc,KAAK,SAAS,QAAQ;AAAY,WAAO;AACnE,MAAI,QAAQ,aAAa,EAAE,KAAK,QAAQ,CAAA,GAAI,SAAS,QAAQ,SAAS;AACpE,WAAO;AACT,SACE,QAAQ,mBAAmB,UAC3B,KAAK,aAAa,QAAQ;AAE9B;AAEA,SAAS,uBACP,MACA,SAAsB;AAEtB,SAAO,wBAAwB,MAAM,OAAO;AAC9C;AAEA,SAAS,6BACP,MACA,SAAsB;AAEtB,MAAI,QAAQ,uBAAuB,cAAc,CAAC,KAAK;AAAU,WAAO;AACxE,MAAI,QAAQ,uBAAuB,gBAAgB,KAAK;AACtD,WAAO;AACT,SACE,QAAQ,mBAAmB,UAC3B,KAAK,aAAa,QAAQ;AAE9B;AAEA,SAAS,wBACP,MACA,SAAsB;AAEtB,MACE,QAAQ,iBAAiB,UACzB,CAAC,QAAQ,eACT,KAAK,WAAW,QAAQ;AAExB,WAAO;AACT,MACE,QAAQ,iBAAiB,UACzB,KAAK,WAAW,QAAQ;AAExB,WAAO;AACT,SACE,QAAQ,kBAAkB,UAC1B,KAAK,YAAY,QAAQ;AAE7B;AAEA,SAAS,qBACP,MACA,SACA,gBACA,qBAA4C;AAE5C,MAAI,CAAC,yBAAyB,MAAM,SAAS,cAAc,GAAG;AAC5D,WAAO;EACT;AACA,MACE,QAAQ,yBACR,CAAC,2BACC,MACA,QAAQ,wBACR,QAAQ,mBAAmB,GAE7B;AACA,WAAO;EACT;AACA,MACE,QAAQ,wBACR,CAAC,0BAA0B,MAAM,QAAQ,mBAAmB,GAC5D;AACA,WAAO;EACT;AACA,MACE,CAAC,sBAAsB,MAAiC,mBAAmB,GAC3E;AACA,WAAO;EACT;AACA,SAAO;AACT;AAEA,SAAS,aACP,OACA,QACA,SACA,cACA,gBACA,qBAA4C;AAE5C,QAAM,UAAU,qBACd,QACA,SACA,cACA,cAAc;AAEhB,SAAO,MAAM,OAAO,CAAC,SACnB,qBAAqB,MAAM,SAAS,gBAAgB,mBAAmB,CAAC;AAE5E;AAEA,SAAS,aAAa,OAAyB;AAC7C,MAAI,OAAO,UAAU,UAAU;AAC7B,WAAO;EACT;AACA,QAAM,UAAU,MAAM,KAAI;AAC1B,SAAO,QAAQ,SAAS,IAAI,UAAU;AACxC;AAEA,SAAS,iBACP,MACA,OACA,YAAkB;AAElB,QAAM,aAAa,aAAa,IAAI;AACpC,QAAM,QAAQ,OAAO,WAAW,UAAU,WAAW,WAAW,QAAQ;AACxE,QAAM,SACJ,aACE,OAAO,WAAW,WAAW,WAAW,WAAW,SAAS,MAAS,KAClE;AACP,SAAO;IACL,GAAG;IACH,YAAY;IACZ,aAAa;IACb,eAAe;IACf,YAAY,GAAG,KAAK,OAAO,KAAK,CAAC,GAAG,KAAK;;AAE7C;AAEA,SAAS,iBACP,aACA,YACA,UAA4B;AAE5B,QAAM,OAAO,oBAAI,IAAG;AACpB,QAAM,mBAAmB,oBAAI,IAAG;AAChC,aAAW,QAAQ,aAAa;AAC9B,SAAK,IAAI,KAAK,IAAI,IAAI;AACtB,UAAM,WAAW,aAAa,KAAK,MAAM;AACzC,QAAI,CAAC,UAAU;AACb;IACF;AACA,UAAM,SAAS,iBAAiB,IAAI,QAAQ;AAC5C,QAAI,QAAQ;AACV,aAAO,KAAK,IAAI;IAClB,OAAO;AACL,uBAAiB,IAAI,UAAU,CAAC,IAAI,CAAC;IACvC;EACF;AAEA,QAAM,QAAQ,aACV,CAAC,GAAI,iBAAiB,IAAI,UAAU,KAAK,CAAA,CAAG,IAC5C,YAAY,OAAO,CAAC,SAAQ;AAC1B,UAAM,WAAW,aAAa,KAAK,MAAM;AACzC,WAAO,CAAC,YAAY,CAAC,KAAK,IAAI,QAAQ;EACxC,CAAC;AACL,QAAM,UAAwB,CAAA;AAC9B,QAAM,UAAU,oBAAI,IAAG;AACvB,QAAM,WAAW,CAAC,MAAkB,UAAuB;AACzD,QAAI,QAAQ,IAAI,KAAK,EAAE,GAAG;AACxB;IACF;AACA,YAAQ,IAAI,KAAK,EAAE;AACnB,UAAM,WAAW,iBAAiB,IAAI,KAAK,EAAE,KAAK,CAAA;AAClD,YAAQ,KAAK,iBAAiB,MAAM,OAAO,SAAS,MAAM,CAAC;AAC3D,QAAI,aAAa,UAAa,SAAS,UAAU;AAC/C;IACF;AACA,eAAW,SAAS,UAAU;AAC5B,eAAS,OAAO,QAAQ,CAAC;IAC3B;EACF;AACA,aAAW,QAAQ,OAAO;AACxB,aAAS,MAAM,CAAC;EAClB;AACA,SAAO;AACT;AAEA,SAAS,sBACP,MACA,OAAoB;AAEpB,MAAI,SAAS,OAAO;AAClB,WAAO;EACT;AACA,MAAI,SAAS,MAAM;AACjB,WAAO;EACT;AACA,MAAI,UAAU,MAAM;AAClB,WAAO;EACT;AACA,SAAO,KAAK,cAAc,KAAK;AACjC;AAEA,SAAS,yBACP,MACA,OAAoB;AAEpB,MAAI,SAAS,OAAO;AAClB,WAAO;EACT;AACA,MAAI,SAAS,MAAM;AACjB,WAAO;EACT;AACA,MAAI,UAAU,MAAM;AAClB,WAAO;EACT;AACA,SAAO,wBAAwB,MAAM,KAAK;AAC5C;AAEA,SAAS,mBACP,MACA,OACA,OAAoB;AAEpB,UAAQ,OAAO;IACb,KAAK;AACH,aAAO,KAAK,WAAW,MAAM;IAC/B,KAAK;AACH,aAAO,yBACL,KAAK,YAAY,MACjB,MAAM,YAAY,IAAI;IAE1B,KAAK;AACH,aAAO,wBAAwB,KAAK,YAAY,MAAM,UAAU;IAClE,KAAK;AACH,aAAO,wBAAwB,KAAK,YAAY,MAAM,UAAU;IAClE,KAAK;AACH,cAAQ,KAAK,SAAS,IAAI,cAAc,MAAM,SAAS,EAAE;IAC3D,KAAK;AACH,aAAO,sBAAsB,KAAK,UAAU,MAAM,MAAM,UAAU,IAAI;IACxE;AACE,aAAO;EACX;AACF;AAEA,SAAS,UACP,OACA,WACA,WACA,gBAAqC;AAErC,MAAI,CAAC,WAAW;AACd,WAAO,iBAAiB,OAAO,cAAc;EAC/C;AACA,SAAO,CAAC,GAAG,KAAK,EAAE,KAAK,CAAC,MAAM,UAAS;AACrC,UAAM,UAAU,mBAAmB,MAAM,OAAO,SAAS;AACzD,QAAI,YAAY,GAAG;AACjB,aAAO,cAAc,SAAS,CAAC,UAAU;IAC3C;AACA,UAAM,WAAW,mBAAmB,MAAM,OAAO,cAAc;AAC/D,WAAO,cAAc,SAAS,CAAC,WAAW;EAC5C,CAAC;AACH;AAEA,SAAS,mBACP,MACA,OACA,WAAW,OAAK;AAEhB,QAAM,aAAa,yBAAyB,MAAM,KAAI,CAAE;AACxD,MAAI,WAAW,WAAW,GAAG;AAC3B,WAAO;EACT;AACA,QAAM,aAAa,aAAa,IAAI;AACpC,MACE,YACA,eAAe,WACf,OAAO,WAAW,eAAe,UACjC;AACA,WAAO,WAAW;EACpB;AACA,MAAI,OAAO,UAAU,eAAe,KAAK,YAAY,UAAU,GAAG;AAChE,WAAO,WAAW,UAAU,KAAK;EACnC;AACA,SAAO;AACT;AAEA,SAAS,iBACP,OACA,YACA,WAAW,OAAK;AAEhB,MAAI,WAAW,SAAS,QAAQ;AAC9B,WAAO;EACT;AACA,SAAO,MAAM,IAAI,CAAC,SAAQ;AACxB,UAAM,YAAqC,CAAA;AAC3C,eAAW,SAAS,WAAW,QAAQ;AACrC,gBAAU,KAAK,IAAI,mBAAmB,MAAM,OAAO,QAAQ;IAC7D;AACA,WAAO;EACT,CAAC;AACH;AAEA,SAAS,iCACP,aAA4C;AAE5C,QAAM,OAAiB,CAAA;AACvB,aAAW,SAAS,aAAa;AAC/B,SAAK,KAAK,MAAM,YAAY;EAC9B;AACA,SAAO;AACT;AAsCA,SAAS,qBACP,SACA,WAAiB;AAEjB,MAAI,QAAQ,eAAe,MAAM;AAC/B,WAAO;EACT;AACA,SACE,kBAAkB,QAAQ,KAAK,MAAM,aAAa,MAAS,KAAK;AAEpE;AAEA,SAAS,qBACP,SACA,SACA,mBAAyB;AAEzB,MAAI,QAAQ,UAAU,QAAW;AAC/B,WAAO,YAAY,QAAQ,MAAM,KAAK;EACxC;AACA,SAAO,wBACL,SACA,QAAQ,OACR,mBACA,CAAC,SAAS,KAAK,EAAE;AAErB;AAEA,SAAS,oBACP,OACA,SACA,YAA8B;AAE9B,SAAO;IACL,GAAI,UAAU,SAAY,EAAE,eAAe,MAAK,IAAK,CAAA;IACrD,GAAI,UAAU,EAAE,UAAU,MAAM,WAAW,KAAI,IAAK,CAAA;IACpD,GAAI,aAAa,EAAE,aAAa,WAAU,IAAK,CAAA;;AAEnD;AAEA,eAAe,0BACb,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,WAAW,MAAM,aAAa,MAAM;AAC1C,QAAM,iBAAiB,6BAA6B,SAAS,MAAM;AACnE,QAAM,uBAAuB,4BAA4B,SAAS,MAAM;AACxE,QAAM,aAAa,sBAAsB,OAAO;AAChD,+BACE,YACA,iCAAiC,qBAAqB,WAAW,CAAC;AAEpE,SAAO;IACL;IACA;IACA;IACA,qBAAqB,2BACnB,SACA,sBACA,MAAM;IAER,cAAc,wBACZ,UACA,gCAA+B,CAAE;IAEnC;;AAEJ;AAEA,eAAe,cACb,SACA,SACA,cAAsB;AAEtB,QAAM,sBAAsB,QAAQ,WAAW,OAAO,KACpD,CAAC,UAAU,yBAAyB,KAAK,MAAM,MAAM;AAEvD,QAAM,6BACJ,QAAQ,WAAW,SAAS,UAC5B,QAAQ,WAAW,OAAO,KAAK,CAAC,UAC9B,wBAAwB,IAAI,yBAAyB,KAAK,CAAC,CAAC;AAEhE,QAAM,sBAAsB,2BAC1B,OAAkC;AAEpC,QAAM,0BACJ,8BAA8B,mBAAmB;AACnD,QAAM,mBAAmB,uBAAuB,mBAAmB;AACnE,MAAI,QAAQ,eAAe,uBAAuB,kBAAkB;AAClE,WAAO,MAAM,4BACX,QAAQ,QACR,QAAQ,SAAS,aACjB,QAAQ,aAAa,gBACrB,cACA,QAAQ,SAAS,MAAM;EAE3B;AACA,MAAI,8BAA8B,yBAAyB;AACzD,WAAO,MAAM,oBACX,QAAQ,QACR,QAAQ,SAAS,aACjB,QAAQ,aAAa,gBACrB,cACA,QAAQ,SAAS,MAAM;EAE3B;AACA,SAAO,MAAM,yBACX,QAAQ,QACR,QAAQ,SAAS,aACjB,QAAQ,aAAa,gBACrB,cACA,QAAQ,SAAS,MAAM;AAE3B;AAEA,SAAS,2BAA2B,SAAoB;AACtD,QAAM,YAAY,eAAe,QAAQ,IAAI;AAC7C,QAAM,YAAY,eAAe,QAAQ,KAAK,KAAK;AACnD,QAAM,cAAc,QAAQ,SAAS;AACrC,MAAI,CAAC,eAAe,QAAQ,cAAc,QAAW;AACnD,UAAM,IAAI,WAAW,qCAAqC,UAAU,KAAK;EAC3E;AACA,MAAI,CAAC,aAAa,QAAQ,UAAU,QAAW;AAC7C,UAAM,IAAI,WAAW,gCAAgC,UAAU,KAAK;EACtE;AACA,SAAO;IACL;IACA;IACA;IACA,WAAW,cAAc,eAAe,QAAQ,SAAS,IAAI;IAC7D,YAAY,cAAc,aAAa,QAAQ,MAAM,IAAI;;AAE7D;AAEA,SAAS,2BACP,QACA,SACA,gBAAqC;AAErC,QAAM,iBAAiB,oBACrB,QAAQ,QACR,cAAc;AAEhB,QAAM,iBACJ,kBAAkB,oBAAoB,QAAQ,cAAc;AAC9D,QAAM,sBAAsB,uBAAuB,QAAQ,MAAM;AACjE,QAAM,mBACJ,kBAAkB,sBACd,EAAE,GAAG,SAAS,iBAAiB,MAAK,IACpC;AACN,QAAM,gBAAgB,sBAClB,QACA,mBAAmB,SACjB,OACA,eAAe,WAAW,IACxB,eAAe,CAAC,IAChB;AACR,SAAO;IACL;IACA;IACA;IACA;;AAEJ;AAEA,SAAS,wBACP,SACA,SACA,YACA,aACA,mBAAyB;AAEzB,MAAI,QAAQ,UAAU,UAAa,QAAQ,WAAW,QAAW;AAC/D,UAAM,IAAI,WACR,kDACA,UAAU,KAAK;EAEnB;AACA,QAAM,QAAQ,qBAAqB,SAAS,QAAQ,MAAM;AAC1D,QAAM,SAAS,qBAAqB,SAAS,SAAS,iBAAiB;AACvE,QAAM,UACJ,UAAU,SACN,QAAQ,MAAM,MAAM,IACpB,QAAQ,MAAM,QAAQ,SAAS,KAAK;AAC1C,QAAM,YAAY,iBAAiB,SAAS,YAAY,WAAW;AACnE,QAAM,eAAe,QAAQ;AAC7B,QAAM,UAAU,QAAQ,SAAS,KAAK,SAAS,QAAQ,SAAS;AAChE,QAAM,aACJ,WAAW,QAAQ,SAAS,IACxB,kBACE,mBACA,QAAQ,QAAQ,SAAS,CAAC,EAAG,IAC7B,SAAS,QAAQ,SAAS,CAAC,IAE7B;AACN,SAAO;IACL;IACA;IACA,kBACE,UAAU,SAAS,gBAAgB,SAAS,IACxC,EAAE,OAAO,aAAY,IACrB,CAAA;IACN,YAAY,oBAAoB,OAAO,SAAS,UAAU;;AAE9D;AAEA,SAAS,2BACP,QACA,SACA,UAA6B;AAE7B,QAAM,oBAA6C,EAAE,GAAG,QAAO;AAC/D,SAAO,kBAAkB;AACzB,SAAO,kBAAkB;AACzB,SAAO,kBAAkB;AACzB,SAAO,kBAAkB;AACzB,SAAO,kBAAkB;AACzB,SAAO,kBAAkB;AACzB,SAAO,kBAAkB;AACzB,SAAO,kBAAkB;AACzB,SAAO,kBAAkB;AACzB,SAAO,uBAAuB,QAAQ;IACpC;IACA,SAAS;IACT,MAAM,SAAS,aAAa;IAC5B,OAAO,SAAS;IAChB,MAAM,SAAS;IACf,YAAY,SAAS,aAAa;GACnC;AACH;AAEA,SAAS,wBAAwB,QAShC;AACC,QAAM,EACJ,eACA,SACA,YACA,aACA,WACA,WACA,WACA,oBAAmB,IACjB;AACJ,QAAM,UAAmC,EAAE,QAAQ,cAAa;AAChE,MAAI,QAAQ,sBAAsB,MAAM;AACtC,YAAQ,oBAAoB;EAC9B;AACA,QAAM,eAAe;AACrB,aAAW,SAAS,wCAAwC;AAC1D,YAAQ,MAAM,UAAU,IAAI,aAAa,MAAM,SAAS,KAAK;EAC/D;AACA,aAAW,SAAS,0CAA0C;AAC5D,QAAI,aAAa,MAAM,GAAG,MAAM,MAAM;AACpC,cAAQ,MAAM,UAAU,IAAI;IAC9B;EACF;AACA,SAAO,OACL,SACA,iCAAiC,OAAO,GACxC,uBAAuB,OAAO,CAAC;AAEjC,4BAA0B,SAAS,OAAO;AAC1C,MAAI,YAAY;AACd,YAAQ,cAAc;EACxB;AACA,MAAI,aAAa;AACf,YAAQ,OAAO;AACf,YAAQ,aAAa,aAAa;EACpC;AACA,UAAQ,OAAO,aAAa;AAC5B,UAAQ,QAAQ,YAAY,YAAY;AACxC,UAAQ,kBAAkB;AAC1B,SAAO;AACT;AAeA,eAAsB,QACpB,QACA,SACA,QAAqB;AAErB,QAAM,UAAU,MAAM,0BAA0B,SAAS,MAAM;AAC/D,QAAM,eAAyB,CAAA;AAC/B,QAAM,QAAQ,MAAM,cAAc,SAAS,SAAS,YAAY;AAChE,QAAM,WAAW,2BAA2B,OAAO;AACnD,QAAM,kBAAkB,2BACtB,QACA,SACA,QAAQ,cAAc;AAExB,QAAM,WAAW,aACf,OACA,gBAAgB,gBAChB,gBAAgB,kBAChB,QAAQ,cACR,QAAQ,gBACR,QAAQ,mBAAmB;AAK7B,QAAM,SACJ,QAAQ,sBAAsB,QACzB,MAAK;AACJ,UAAM,aAAa,4BACjB,OACA,QAAQ,cAAc;AAExB,WAAO,SAAS,OAAO,CAAC,SACtB,WAAW,IAAI,KAAK,GAAG,KAAI,EAAG,YAAW,CAAE,CAAC;EAEhD,GAAE,IACF;AACN,QAAM,SAAS,UACb,QACA,SAAS,WACT,SAAS,WACT,QAAQ,cAAc;AAExB,QAAM,UAAU,SAAS,cACrB,iBAAiB,QAAQ,SAAS,YAAY,SAAS,SAAS,IAChE;AACJ,QAAM,aAAa,QAAQ,eAAe;AAC1C,QAAM,OAAO,wBACX,SACA,SACA,QAAQ,YACR,SAAS,aACT,2BACE,gBAAgB,eAChB,SACA,QAAQ,CACT;AAEH,QAAM,MAAM,OAAM;AAClB,QAAM,WAAW,CAAC,GAAG,IAAI,IAAI,YAAY,CAAC,EAAE,KAAK,CAAC,MAAM,UACtD,KAAK,cAAc,KAAK,CAAC;AAE3B,QAAM,mBACJ,QAAQ,WAAW,SAAS,SAAS,OAAO,CAAC,GAAG,QAAQ,WAAW,MAAM;AAC3E,QAAM,qBACJ,QAAQ,WAAW,SAAS,aAAa,QAAQ,YAAY;AAC/D,MAAI,oBAAoB;AACtB,UAAM,iBAAiB,8BAA8B;MACnD,eAAe,gBAAgB;MAC/B;MACA,aAAa,SAAS;MACtB,WAAW,SAAS;MACpB,WAAW,SAAS;MACpB,WAAW,SAAS;MACpB,qBAAqB,QAAQ;KAC9B;AACD,WAAO;MACL,OAAO,KAAK;MACZ,OAAO,KAAK,UAAU;MACtB,GAAG,KAAK;MACR,GAAG,KAAK;MACR,SAAS;MACT,GAAI,SAAS,SAAS,IAAI,EAAE,SAAQ,IAAK,CAAA;;EAE7C;AACA,SAAO;IACL,OAAO,KAAK;IACZ,OAAO,KAAK,UAAU;IACtB,GAAG,KAAK;IACR,GAAG,KAAK;IACR,SAAS,wBAAwB;MAC/B,eAAe,gBAAgB;MAC/B;MACA;MACA,aAAa,SAAS;MACtB,WAAW,SAAS;MACpB,WAAW,SAAS;MACpB,WAAW,SAAS;MACpB,qBAAqB,QAAQ;KAC9B;IACD,YAAY;MACV,MAAM,QAAQ,WAAW;MACzB,QAAQ;;IAEV,SAAS;MACP,MAAM,SAAS,aAAa;MAC5B,OAAO,SAAS,YAAY,SAAS,YAAY;;IAEnD;IACA,GAAI,SAAS,SAAS,IAAI,EAAE,SAAQ,IAAK,CAAA;;AAE7C","debugId":"45d590f6-2f18-5a57-84f7-e5336081726b"}