@unbrained/pm-cli 2026.7.21 → 2026.7.22

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

@@ -1 +0,0 @@
-{"version":3,"sources":["../../../../../../../../sdk/graph/assembly.ts"],"sourcesContent":["/**\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 { getActiveExtensionRegistrations } from \"../../core/extensions/index.js\";\nimport {\n  RelationshipGraph,\n  createRelationshipKindRegistry,\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. */\nexport function normalizeDependencyGraphTarget(\n  target: unknown,\n): string | undefined {\n  const normalized = normalizeDependencyReferenceTarget(target);\n  return normalized?.toLowerCase() === \"no-active-blocker\"\n    ? undefined\n    : normalized;\n}\n\n/**\n * Resolve the default workspace relationship-kind registry: the built-in kinds\n * merged with every active extension-contributed relationship-kind\n * registration. Assembly, mutation advisories, and standalone graph consumers\n * share this resolution so custom ordering semantics apply identically on\n * every surface.\n */\nexport function resolveWorkspaceRelationshipKindRegistry(): RelationshipKindRegistry {\n  const registry = createRelationshipKindRegistry();\n  for (const registration of getActiveExtensionRegistrations()\n    ?.relationship_kinds ?? []) {\n    for (const definition of registration.definitions) {\n      registry.register(definition);\n    }\n  }\n  return registry;\n}\n\n/** One raw stored dependency row duplicated verbatim on a single holder. */\nexport interface DuplicateDependencyRow {\n  /** Item that stores the duplicated row. */\n  holder_id: string;\n  /** Referenced target id in its first stored spelling. */\n  target_id: string;\n  /** Stored relationship kind shared by every duplicate occurrence. */\n  kind: string;\n  /** Total stored occurrences of the identical row (always >= 2). */\n  occurrences: number;\n  /** Current lifecycle status of the holder. */\n  holder_status: ItemStatus;\n  /** Whether the holder is terminal and the duplication is historical debt. */\n  legacy_terminal: boolean;\n}\n\n/** Compare text case-insensitively with an exact-spelling deterministic tie-breaker. */\nfunction compareCaseFoldedText(left: string, right: string): number {\n  const normalizedLeft = left.toLowerCase();\n  const normalizedRight = right.toLowerCase();\n  if (normalizedLeft !== normalizedRight)\n    return normalizedLeft < normalizedRight ? -1 : 1;\n  if (left !== right) return left < right ? -1 : 1;\n  return 0;\n}\n\n/** Count one holder's dependency rows by their case-insensitive kind-plus-target identity. */\nfunction countDependencyRowIdentities(\n  item: DependencyReferenceHolder,\n): Map<string, { target_id: string; kind: string; count: number }> {\n  const occurrences = new Map<\n    string,\n    { target_id: string; kind: string; count: number }\n  >();\n  for (const dependency of item.dependencies ?? []) {\n    if (typeof dependency !== \"object\" || dependency === null) continue;\n    const legacyDependency = dependency as Partial<Dependency>;\n    const target = normalizeDependencyReferenceTarget(legacyDependency.id);\n    if (!target) continue;\n    const kind =\n      typeof legacyDependency.kind === \"string\"\n        ? legacyDependency.kind\n        : \"related\";\n    const key = `${kind}\\u0000${target.toLowerCase()}`;\n    const existing = occurrences.get(key);\n    if (existing) existing.count += 1;\n    else occurrences.set(key, { target_id: target, kind, count: 1 });\n  }\n  return occurrences;\n}\n\n/**\n * Collect raw stored dependency rows whose exact identity — holder, kind, and\n * case-insensitive target — appears more than once on one item. Graph\n * construction deduplicates these by edge identity, so the assembled graph and\n * every projection built on it cannot see them; this pre-assembly scan is the\n * only surface that reports the storage-layer defect.\n */\nexport function collectDuplicateDependencyRows(\n  items: readonly DependencyReferenceHolder[],\n  isTerminal: (status: ItemStatus) => boolean = (status) =>\n    status === \"closed\" || status === \"canceled\",\n): DuplicateDependencyRow[] {\n  const rows: DuplicateDependencyRow[] = [];\n  for (const item of items) {\n    if (typeof item?.id !== \"string\" || item.id.trim().length === 0) continue;\n    for (const entry of countDependencyRowIdentities(item).values()) {\n      if (entry.count < 2) continue;\n      rows.push({\n        holder_id: item.id.trim(),\n        target_id: entry.target_id,\n        kind: entry.kind,\n        occurrences: entry.count,\n        holder_status: item.status,\n        legacy_terminal: isTerminal(item.status),\n      });\n    }\n  }\n  return rows.sort((left, right) => {\n    const holderCompare = compareCaseFoldedText(\n      left.holder_id,\n      right.holder_id,\n    );\n    if (holderCompare !== 0) return holderCompare;\n    const targetCompare = compareCaseFoldedText(\n      left.target_id,\n      right.target_id,\n    );\n    if (targetCompare !== 0) return targetCompare;\n    return compareCaseFoldedText(left.kind, right.kind);\n  });\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  /** Optional item type powering per-type coverage profiles and policies. */\n  type?: 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  /** Item type when the source item declared one; absent on missing placeholders. */\n  type?: 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  /** Raw same-identity duplicated dependency rows found before graph dedup. */\n  duplicateRows: DuplicateDependencyRow[];\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 relationshipRegistry =\n    registry ?? resolveWorkspaceRelationshipKindRegistry();\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      relationshipRegistry,\n    ),\n    details: [\n      ...safeItems.map((item) => ({\n        id: item.id.trim(),\n        title: item.title,\n        status: item.status,\n        ...(typeof item.type === \"string\" && item.type.trim().length > 0\n          ? { type: item.type.trim() }\n          : {}),\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    duplicateRows: collectDuplicateDependencyRows(safeItems, isTerminal),\n  };\n}\n"],"names":[],"mappings":";;;;;;;;;;;AAiEA,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;AAGM,SAAU,+BACd,QAAe;AAEf,QAAM,aAAa,mCAAmC,MAAM;AAC5D,SAAO,YAAY,YAAW,MAAO,sBACjC,SACA;AACN;AASM,SAAU,2CAAwC;AACtD,QAAM,WAAW,+BAA8B;AAC/C,aAAW,gBAAgB,gCAA+B,GACtD,sBAAsB,CAAA,GAAI;AAC5B,eAAW,cAAc,aAAa,aAAa;AACjD,eAAS,SAAS,UAAU;IAC9B;EACF;AACA,SAAO;AACT;AAmBA,SAAS,sBAAsB,MAAc,OAAa;AACxD,QAAM,iBAAiB,KAAK,YAAW;AACvC,QAAM,kBAAkB,MAAM,YAAW;AACzC,MAAI,mBAAmB;AACrB,WAAO,iBAAiB,kBAAkB,KAAK;AACjD,MAAI,SAAS;AAAO,WAAO,OAAO,QAAQ,KAAK;AAC/C,SAAO;AACT;AAGA,SAAS,6BACP,MAA+B;AAE/B,QAAM,cAAc,oBAAI,IAAG;AAI3B,aAAW,cAAc,KAAK,gBAAgB,CAAA,GAAI;AAChD,QAAI,OAAO,eAAe,YAAY,eAAe;AAAM;AAC3D,UAAM,mBAAmB;AACzB,UAAM,SAAS,mCAAmC,iBAAiB,EAAE;AACrE,QAAI,CAAC;AAAQ;AACb,UAAM,OACJ,OAAO,iBAAiB,SAAS,WAC7B,iBAAiB,OACjB;AACN,UAAM,MAAM,GAAG,IAAI,KAAS,OAAO,YAAW,CAAE;AAChD,UAAM,WAAW,YAAY,IAAI,GAAG;AACpC,QAAI;AAAU,eAAS,SAAS;;AAC3B,kBAAY,IAAI,KAAK,EAAE,WAAW,QAAQ,MAAM,OAAO,EAAC,CAAE;EACjE;AACA,SAAO;AACT;AASM,SAAU,+BACd,OACA,aAA8C,CAAC,WAC7C,WAAW,YAAY,WAAW,YAAU;AAE9C,QAAM,OAAiC,CAAA;AACvC,aAAW,QAAQ,OAAO;AACxB,QAAI,OAAO,MAAM,OAAO,YAAY,KAAK,GAAG,KAAI,EAAG,WAAW;AAAG;AACjE,eAAW,SAAS,6BAA6B,IAAI,EAAE,OAAM,GAAI;AAC/D,UAAI,MAAM,QAAQ;AAAG;AACrB,WAAK,KAAK;QACR,WAAW,KAAK,GAAG,KAAI;QACvB,WAAW,MAAM;QACjB,MAAM,MAAM;QACZ,aAAa,MAAM;QACnB,eAAe,KAAK;QACpB,iBAAiB,WAAW,KAAK,MAAM;OACxC;IACH;EACF;AACA,SAAO,KAAK,KAAK,CAAC,MAAM,UAAS;AAC/B,UAAM,gBAAgB,sBACpB,KAAK,WACL,MAAM,SAAS;AAEjB,QAAI,kBAAkB;AAAG,aAAO;AAChC,UAAM,gBAAgB,sBACpB,KAAK,WACL,MAAM,SAAS;AAEjB,QAAI,kBAAkB;AAAG,aAAO;AAChC,WAAO,sBAAsB,KAAK,MAAM,MAAM,IAAI;EACpD,CAAC;AACH;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;AA2CM,SAAU,mCACd,OACA,YACA,UAAmC;AAEnC,QAAM,uBACJ,YAAY,yCAAwC;AACtD,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,oBAAoB;IAEtB,SAAS;MACP,GAAG,UAAU,IAAI,CAAC,UAAU;QAC1B,IAAI,KAAK,GAAG,KAAI;QAChB,OAAO,KAAK;QACZ,QAAQ,KAAK;QACb,GAAI,OAAO,KAAK,SAAS,YAAY,KAAK,KAAK,KAAI,EAAG,SAAS,IAC3D,EAAE,MAAM,KAAK,KAAK,KAAI,EAAE,IACxB,CAAA;QACJ;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;IACA,eAAe,+BAA+B,WAAW,UAAU;;AAEvE","debugId":"eb644edc-de5a-5ac2-9e7f-445c07dfdf1f"}