Function computePromoteClosure

showcase/scripts/railway-envs.ts:2088–2183

(
  requested: string[],
  services: Record<string, ClosureEntry & { dispatchName?: string }> = SERVICES,
)

 * Accepts an injected map for testing; defaults to the real SERVICES map.
 */
export function computePromoteClosure(
  requested: string[],
  services: Record<string, ClosureEntry & { dispatchName?: string }> = SERVICES,
): ClosurePlan {
  // 1) Resolve requested names → SSOT keys (own-key first, then dispatchName),
  //    mirroring resolveTargetServices. Fail loud on an unknown name.
  const closure = new Set<string>();
  const resolveKey = (raw: string): string => {
    const name = raw.trim();
    if (Object.hasOwn(services, name)) return name;
    for (const [key, entry] of Object.entries(services)) {
      if (entry.dispatchName === name) return key;
    }
    throw new Error(
      `computePromoteClosure: unknown service "${raw}" — not an SSOT key or dispatch_name in railway-envs.ts.`,
    );
  };
  for (const raw of requested) {
    if (raw.trim() === "") continue;
    closure.add(resolveKey(raw));
  }

  // A promote whose REQUESTED set is ENTIRELY standalone services pulls in NO
  // Tier-1 verification set: a standalone leaf (e.g. `docs`) is self-contained
  // and depends on nothing, so promoting it alone must promote ONLY itself, not
  // the whole control plane. A mixed or `all` request still forces Tier-1 below.
  const requestedKeys = [...closure];
  const allStandalone =
    requestedKeys.length > 0 &&
    requestedKeys.every((k) => services[k]?.standalone === true);

  // 2) Include the full Tier-1 verification set (the control plane + dashboard
  //    the post-promote re-sweep / equivalence read run against) — UNLESS the
  //    request is entirely standalone (a standalone leaf needs no control plane).
  if (!allStandalone) {
    for (const [key, entry] of Object.entries(services)) {
      if (tierOf(entry) === 1) closure.add(key);
    }
  }

  // 3) Transitive runtimeDeps closure (BFS). Every dep must be a real key —
  //    a dangling dep is caught by assertClosureValid, but guard here too so
  //    the pure function never dereferences a non-entry.
  const queue = [...closure];
  while (queue.length > 0) {
    const key = queue.shift() as string;
    const entry = Object.hasOwn(services, key) ? services[key] : undefined;
    if (entry === undefined) continue;
    for (const dep of entry.runtimeDeps ?? []) {
      if (!closure.has(dep) && Object.hasOwn(services, dep)) {
        closure.add(dep);
        queue.push(dep);
      }
    }
  }

  // 4) Explicit imageOf consumers of any closure member (pull, do not inherit
  //    the staging-redeploy env-aware expansion wholesale — §4.2).