@h-rig/core 0.0.6-alpha.132 → 0.0.6-alpha.134

package/dist/src/stageResolve.js

@@ -0,0 +1,375 @@
+// @bun
+// packages/core/src/stageResolve.ts
+class PipelineUnresolvableError extends Error {
+  cycles;
+  contributors;
+  constructor(message, cycles, contributors) {
+    super(message);
+    this.name = "PipelineUnresolvableError";
+    this.cycles = cycles;
+    this.contributors = contributors;
+  }
+}
+function uniqueSorted(values) {
+  return Array.from(new Set(values)).sort((left, right) => left.localeCompare(right));
+}
+function wrapperForMutation(mutation) {
+  return "wrapper" in mutation ? mutation.wrapper : mutation.around;
+}
+function contributorOf(mutation) {
+  if (mutation.contributedBy?.trim())
+    return mutation.contributedBy;
+  if (mutation.op === "wrap") {
+    const wrapper = wrapperForMutation(mutation);
+    if (wrapper.id?.trim())
+      return wrapper.id;
+  }
+  return "anonymous";
+}
+function stableMutationCompare(left, right) {
+  const leftTarget = left.op === "insert" ? left.stage.id : left.id;
+  const rightTarget = right.op === "insert" ? right.stage.id : right.id;
+  const targetDelta = leftTarget.localeCompare(rightTarget);
+  if (targetDelta !== 0)
+    return targetDelta;
+  return contributorOf(left).localeCompare(contributorOf(right));
+}
+function ensureUniqueStageIds(stages) {
+  const seen = new Set;
+  for (const stage of stages) {
+    if (seen.has(stage.id)) {
+      throw new PipelineUnresolvableError(`Duplicate stage id: ${stage.id}`, [], []);
+    }
+    seen.add(stage.id);
+  }
+}
+function assertNoDuplicateMutationTargets(mutations, op) {
+  const seen = new Map;
+  for (const mutation of mutations.filter((entry) => entry.op === op)) {
+    const id = mutation.op === "insert" ? mutation.stage.id : mutation.id;
+    const previous = seen.get(id);
+    if (previous) {
+      throw new PipelineUnresolvableError(`Duplicate ${op} mutation for stage ${id}: ${previous}, ${contributorOf(mutation)}`, [], uniqueSorted([previous, contributorOf(mutation)]));
+    }
+    seen.set(id, contributorOf(mutation));
+  }
+}
+function hasProtectedGrant(grants, stageId, pluginId, op) {
+  return grants.some((grant) => grant.stageId === stageId && grant.pluginId === pluginId && (grant.op === undefined || grant.op === op));
+}
+function mergeAnchors(current, incoming) {
+  return uniqueSorted([...current, ...incoming ?? []]);
+}
+function stagePriority(stage) {
+  return typeof stage.priority === "number" && Number.isFinite(stage.priority) ? stage.priority : 0;
+}
+function readyCompare(states) {
+  return (left, right) => {
+    const leftState = states.get(left);
+    const rightState = states.get(right);
+    const priorityDelta = stagePriority(rightState?.stage ?? { id: right }) - stagePriority(leftState?.stage ?? { id: left });
+    if (priorityDelta !== 0)
+      return priorityDelta;
+    if (leftState?.baseIndex !== null && rightState?.baseIndex !== null && leftState?.baseIndex !== rightState?.baseIndex) {
+      return (leftState?.baseIndex ?? 0) - (rightState?.baseIndex ?? 0);
+    }
+    if (leftState?.baseIndex !== null && rightState?.baseIndex === null)
+      return -1;
+    if (leftState?.baseIndex === null && rightState?.baseIndex !== null)
+      return 1;
+    return left.localeCompare(right);
+  };
+}
+function findCycles(nodes, edges) {
+  const adjacency = new Map;
+  for (const node of nodes)
+    adjacency.set(node, []);
+  for (const edge of edges)
+    adjacency.get(edge.from)?.push(edge.to);
+  for (const targets of adjacency.values())
+    targets.sort((left, right) => left.localeCompare(right));
+  let nextIndex = 0;
+  const indexByNode = new Map;
+  const lowByNode = new Map;
+  const stack = [];
+  const onStack = new Set;
+  const cycles = [];
+  const visit = (node) => {
+    indexByNode.set(node, nextIndex);
+    lowByNode.set(node, nextIndex);
+    nextIndex += 1;
+    stack.push(node);
+    onStack.add(node);
+    for (const target of adjacency.get(node) ?? []) {
+      if (!indexByNode.has(target)) {
+        visit(target);
+        lowByNode.set(node, Math.min(lowByNode.get(node) ?? 0, lowByNode.get(target) ?? 0));
+      } else if (onStack.has(target)) {
+        lowByNode.set(node, Math.min(lowByNode.get(node) ?? 0, indexByNode.get(target) ?? 0));
+      }
+    }
+    if (lowByNode.get(node) !== indexByNode.get(node))
+      return;
+    const component = [];
+    let current;
+    do {
+      current = stack.pop();
+      if (current) {
+        onStack.delete(current);
+        component.push(current);
+      }
+    } while (current && current !== node);
+    const hasSelfLoop = edges.some((edge) => edge.from === node && edge.to === node);
+    if (component.length > 1 || hasSelfLoop) {
+      cycles.push(component.sort((left, right) => left.localeCompare(right)));
+    }
+  };
+  for (const node of [...nodes].sort((left, right) => left.localeCompare(right))) {
+    if (!indexByNode.has(node))
+      visit(node);
+  }
+  return cycles.sort((left, right) => left.join("\x00").localeCompare(right.join("\x00")));
+}
+function topologicalOrder(states, edges) {
+  const nodes = [...states.keys()];
+  const outgoing = new Map;
+  const indegree = new Map;
+  for (const node of nodes) {
+    outgoing.set(node, []);
+    indegree.set(node, 0);
+  }
+  for (const edge of edges) {
+    outgoing.get(edge.from)?.push(edge.to);
+    indegree.set(edge.to, (indegree.get(edge.to) ?? 0) + 1);
+  }
+  for (const targets of outgoing.values())
+    targets.sort((left, right) => left.localeCompare(right));
+  const compare = readyCompare(states);
+  const ready = nodes.filter((node) => (indegree.get(node) ?? 0) === 0).sort(compare);
+  const order = [];
+  while (ready.length > 0) {
+    const node = ready.shift();
+    if (!node)
+      break;
+    order.push(node);
+    for (const target of outgoing.get(node) ?? []) {
+      const next = (indegree.get(target) ?? 0) - 1;
+      indegree.set(target, next);
+      if (next === 0) {
+        ready.push(target);
+        ready.sort(compare);
+      }
+    }
+  }
+  if (order.length === nodes.length)
+    return order;
+  const cycles = findCycles(nodes, edges);
+  const cycleMembers = new Set(cycles.flat());
+  const contributors = uniqueSorted(edges.filter((edge) => cycleMembers.has(edge.from) && cycleMembers.has(edge.to)).flatMap((edge) => edge.contributors));
+  throw new PipelineUnresolvableError(`Stage pipeline has unresolved cycle: ${cycles.map((cycle) => cycle.join(" -> ")).join("; ")}`, cycles, contributors);
+}
+function composeStageWrappers(state) {
+  const wrappers = state.wrappers.toSorted((left, right) => {
+    const priorityDelta = (right.wrapper.priority ?? 0) - (left.wrapper.priority ?? 0);
+    if (priorityDelta !== 0)
+      return priorityDelta;
+    return left.contributedBy.localeCompare(right.contributedBy);
+  });
+  let stage = state.stage;
+  for (const wrapper of wrappers.toReversed()) {
+    if (wrapper.wrapper.apply)
+      stage = wrapper.wrapper.apply(stage);
+  }
+  return stage;
+}
+function resolveStagePipeline(input) {
+  ensureUniqueStageIds(input.defaultStages);
+  const mutations = [...input.mutations ?? []];
+  assertNoDuplicateMutationTargets(mutations, "insert");
+  assertNoDuplicateMutationTargets(mutations, "replace");
+  const grants = input.protectedStageGrants ?? [];
+  const states = new Map;
+  const removedStates = new Map;
+  for (const [index, stage] of input.defaultStages.entries()) {
+    states.set(stage.id, {
+      stage,
+      before: [...stage.before ?? []],
+      after: [...stage.after ?? []],
+      baseIndex: index,
+      contributedBy: "default",
+      wrappers: [],
+      droppedAnchors: [],
+      isProtected: stage.protected === true
+    });
+  }
+  for (const mutation of mutations.filter((entry) => entry.op === "remove").sort(stableMutationCompare)) {
+    const state = states.get(mutation.id);
+    const contributor = contributorOf(mutation);
+    if (!state)
+      continue;
+    if (state.isProtected && !hasProtectedGrant(grants, mutation.id, contributor, "remove")) {
+      throw new PipelineUnresolvableError(`Protected stage ${mutation.id} cannot be removed by ${contributor} without an explicit grant`, [], [contributor]);
+    }
+    const removedState = {
+      ...state,
+      removedBy: contributor,
+      ...state.isProtected ? { grantUsedBy: contributor } : {}
+    };
+    removedStates.set(mutation.id, removedState);
+    states.delete(mutation.id);
+  }
+  for (const mutation of mutations.filter((entry) => entry.op === "replace").sort(stableMutationCompare)) {
+    const state = states.get(mutation.id);
+    const contributor = contributorOf(mutation);
+    if (!state)
+      continue;
+    if (state.isProtected && !hasProtectedGrant(grants, mutation.id, contributor, "replace")) {
+      throw new PipelineUnresolvableError(`Protected stage ${mutation.id} cannot be replaced by ${contributor} without an explicit grant`, [], [contributor]);
+    }
+    const replacement = { ...mutation.stage, id: mutation.id };
+    states.set(mutation.id, {
+      ...state,
+      stage: replacement,
+      before: mutation.stage.before ? [...mutation.stage.before] : state.before,
+      after: mutation.stage.after ? [...mutation.stage.after] : state.after,
+      replacedBy: contributor,
+      contributedBy: state.contributedBy,
+      isProtected: mutation.stage.protected ?? state.isProtected,
+      ...state.isProtected ? { grantUsedBy: contributor } : {}
+    });
+  }
+  for (const mutation of mutations.filter((entry) => entry.op === "insert").sort(stableMutationCompare)) {
+    const contributor = contributorOf(mutation);
+    if (states.has(mutation.stage.id)) {
+      throw new PipelineUnresolvableError(`Inserted stage ${mutation.stage.id} conflicts with an existing stage`, [], [contributor]);
+    }
+    states.set(mutation.stage.id, {
+      stage: mutation.stage,
+      before: [...mutation.stage.before ?? []],
+      after: [...mutation.stage.after ?? []],
+      baseIndex: null,
+      contributedBy: contributor,
+      wrappers: [],
+      droppedAnchors: [],
+      isProtected: mutation.stage.protected === true
+    });
+  }
+  for (const mutation of mutations.filter((entry) => entry.op === "reorder").sort(stableMutationCompare)) {
+    const state = states.get(mutation.id);
+    if (!state)
+      continue;
+    states.set(mutation.id, {
+      ...state,
+      before: mergeAnchors(state.before, mutation.before),
+      after: mergeAnchors(state.after, mutation.after)
+    });
+  }
+  for (const mutation of mutations.filter((entry) => entry.op === "wrap").sort(stableMutationCompare)) {
+    const state = states.get(mutation.id);
+    const contributor = contributorOf(mutation);
+    const wrapper = wrapperForMutation(mutation);
+    if (!state)
+      continue;
+    states.set(mutation.id, {
+      ...state,
+      wrappers: [...state.wrappers, { contributedBy: contributor, wrapper }]
+    });
+  }
+  const contributorsForAnchor = (stageId, direction, anchor, state) => {
+    const contributors = new Set;
+    if (state.replacedBy)
+      contributors.add(state.replacedBy);
+    for (const mutation of mutations) {
+      if (mutation.op === "reorder" && mutation.id === stageId && (direction === "before" ? mutation.before : mutation.after)?.includes(anchor)) {
+        contributors.add(contributorOf(mutation));
+      }
+      if (mutation.op === "insert" && mutation.stage.id === stageId && (direction === "before" ? mutation.stage.before : mutation.stage.after)?.includes(anchor)) {
+        contributors.add(contributorOf(mutation));
+      }
+    }
+    if (contributors.size === 0)
+      contributors.add(state.contributedBy);
+    return uniqueSorted(contributors);
+  };
+  const edges = [];
+  for (const [stageId, state] of states) {
+    const before = [];
+    const after = [];
+    for (const anchor of state.before) {
+      if (states.has(anchor))
+        before.push(anchor);
+      else {
+        const removed = removedStates.get(anchor);
+        state.droppedAnchors.push({
+          stageId,
+          anchor,
+          direction: "before",
+          reason: removed ? "removed" : "missing",
+          ...removed?.removedBy ? { removedBy: removed.removedBy } : {}
+        });
+      }
+    }
+    for (const anchor of state.after) {
+      if (states.has(anchor))
+        after.push(anchor);
+      else {
+        const removed = removedStates.get(anchor);
+        state.droppedAnchors.push({
+          stageId,
+          anchor,
+          direction: "after",
+          reason: removed ? "removed" : "missing",
+          ...removed?.removedBy ? { removedBy: removed.removedBy } : {}
+        });
+      }
+    }
+    state.before = uniqueSorted(before);
+    state.after = uniqueSorted(after);
+    for (const target of state.before)
+      edges.push({ from: stageId, to: target, contributors: contributorsForAnchor(stageId, "before", target, state) });
+    for (const source of state.after)
+      edges.push({ from: source, to: stageId, contributors: contributorsForAnchor(stageId, "after", source, state) });
+  }
+  const order = topologicalOrder(states, edges);
+  const stages = [];
+  const record = [];
+  for (const id of order) {
+    const state = states.get(id);
+    if (!state)
+      continue;
+    stages.push(composeStageWrappers(state));
+    const wrappedBy = state.wrappers.toSorted((left, right) => {
+      const priorityDelta = (right.wrapper.priority ?? 0) - (left.wrapper.priority ?? 0);
+      if (priorityDelta !== 0)
+        return priorityDelta;
+      return left.contributedBy.localeCompare(right.contributedBy);
+    }).map((wrapper) => wrapper.contributedBy);
+    record.push({
+      stageId: id,
+      contributedBy: state.contributedBy,
+      ...state.replacedBy ? { replacedBy: state.replacedBy } : {},
+      ...wrappedBy.length > 0 ? { wrappedBy } : {},
+      ...state.droppedAnchors.length > 0 ? { droppedAnchors: state.droppedAnchors.toSorted((left, right) => left.anchor.localeCompare(right.anchor)) } : {},
+      isProtected: state.isProtected,
+      ...state.grantUsedBy ? { grantUsedBy: state.grantUsedBy } : {}
+    });
+  }
+  record.push(...[...removedStates.entries()].toSorted((left, right) => {
+    const leftIndex = left[1].baseIndex ?? Number.MAX_SAFE_INTEGER;
+    const rightIndex = right[1].baseIndex ?? Number.MAX_SAFE_INTEGER;
+    if (leftIndex !== rightIndex)
+      return leftIndex - rightIndex;
+    return left[0].localeCompare(right[0]);
+  }).map(([stageId, state]) => ({
+    stageId,
+    contributedBy: state.contributedBy,
+    ...state.removedBy ? { removedBy: state.removedBy } : {},
+    isProtected: state.isProtected,
+    ...state.grantUsedBy ? { grantUsedBy: state.grantUsedBy } : {}
+  })));
+  return { stages, order, record, cycles: [] };
+}
+export {
+  resolveStagePipeline,
+  PipelineUnresolvableError
+};

package/dist/src/taskGraph.d.ts

@@ -1,5 +1,5 @@
 import type { TaskSummary } from "@rig/contracts";
-export type TaskDependencyProjection = Pick<TaskSummary, "id" | "status" | "priority" | "metadata"> & Partial<Pick<TaskSummary, "externalId" | "sourceIssueId" | "dependencies" | "parentChildDeps" | "createdAt" | "updatedAt">> & {
+export type TaskDependencyProjection = Pick<TaskSummary, "id" | "status" | "priority" | "metadata"> & Partial<Pick<TaskSummary, "externalId" | "sourceIssueId" | "dependencies" | "parentChildDeps" | "createdAt" | "updatedAt" | "role" | "scope" | "validationKeys">> & {
     readonly title?: string | null;
 };
 export type TaskDependencyBadgeKind = "blocked" | "ready" | "dependency";
@@ -24,8 +24,12 @@ export interface TaskDependencyBadgeSummary {
     readonly badges: readonly TaskDependencyBadge[];
 }
 export declare function readTaskMetadataStringList(task: TaskDependencyProjection, key: "dependencies" | "parentChildDeps" | "labels"): string[];
+export declare function readTaskBlockingDependencyRefs(task: TaskDependencyProjection): string[];
 export declare function readTaskDependencyRefs(task: TaskDependencyProjection): string[];
 export declare function readTaskSourceIssueId(task: TaskDependencyProjection): string | null;
+export declare function readTaskScope(task: TaskDependencyProjection): string[];
+export type TaskScopeInput = readonly string[] | TaskDependencyProjection;
+export declare function disjointScope(left: TaskScopeInput, right: TaskScopeInput): boolean;
 export declare function resolveTaskReference(ref: string, tasksById: ReadonlyMap<string, TaskDependencyProjection>, taskIdByExternalRef: ReadonlyMap<string, string>, taskIdBySourceIssueId: ReadonlyMap<string, string>): string | null;
 export declare function buildTaskReferenceIndex<T extends TaskDependencyProjection>(tasks: readonly T[]): {
     readonly tasksById: Map<string, T>;
@@ -39,3 +43,22 @@ export declare function selectNextReadyTaskByPriority<T extends TaskDependencyPr
     readonly excludeTaskIds?: Iterable<string>;
     readonly filter?: (task: T) => boolean;
 }): T | null;
+export type ReadyTaskSelectionMode = "all-ready" | "blocking-only" | "max-unblock";
+export interface RankedReadyTask<T extends TaskDependencyProjection> {
+    readonly task: T;
+    readonly score: number;
+    readonly priority: number;
+    readonly unblockCount: number;
+    readonly scope: readonly string[];
+}
+export interface RankedReadyTaskOptions<T extends TaskDependencyProjection> {
+    readonly excludeTaskIds?: Iterable<string>;
+    readonly activeTaskIds?: Iterable<string>;
+    readonly filter?: (task: T) => boolean;
+    readonly selection?: ReadyTaskSelectionMode;
+    readonly requireDisjointScopes?: boolean;
+    readonly disjointWithScopes?: Iterable<string>;
+    readonly limit?: number;
+}
+export declare function rankReadyTasks<T extends TaskDependencyProjection>(tasks: readonly T[], options?: Omit<RankedReadyTaskOptions<T>, "limit" | "requireDisjointScopes" | "disjointWithScopes">): readonly RankedReadyTask<T>[];
+export declare function selectRankedReadyTasks<T extends TaskDependencyProjection>(tasks: readonly T[], options?: RankedReadyTaskOptions<T>): readonly T[];

package/dist/src/taskGraph.js

@@ -1,4 +1,49 @@
 // @bun
+// packages/core/src/taskScore.ts
+var ROLE_WEIGHT = {
+  architect: 25,
+  extractor: 10
+};
+var CRITICALITY_WEIGHT = {
+  core: 20,
+  high: 10,
+  normal: 0
+};
+function finiteNumber(value, fallback) {
+  return typeof value === "number" && Number.isFinite(value) ? value : fallback;
+}
+function scoreTask(input) {
+  const priority = finiteNumber(input.priority, 3);
+  const unblockCount = Math.max(0, finiteNumber(input.unblockCount, 0));
+  const roleWeight = input.role ? ROLE_WEIGHT[input.role] ?? 0 : 0;
+  const criticalityWeight = input.criticality ? CRITICALITY_WEIGHT[input.criticality] ?? 0 : 0;
+  const validationWeight = (input.validation ?? []).some((entry) => entry.includes("test-contract") || entry.includes("test-boundary")) ? 8 : 0;
+  const queueWeight = finiteNumber(input.queueWeight, 0);
+  return unblockCount * 100 + (10 - priority) + roleWeight + criticalityWeight + validationWeight + queueWeight;
+}
+function rankTasks(tasks, scoreInput, idOf) {
+  return tasks.map((task) => {
+    const input = scoreInput(task);
+    return {
+      task,
+      score: scoreTask(input),
+      priority: finiteNumber(input.priority, 3),
+      unblockCount: Math.max(0, finiteNumber(input.unblockCount, 0))
+    };
+  }).toSorted((left, right) => {
+    const scoreDelta = right.score - left.score;
+    if (scoreDelta !== 0)
+      return scoreDelta;
+    const unblockDelta = right.unblockCount - left.unblockCount;
+    if (unblockDelta !== 0)
+      return unblockDelta;
+    const priorityDelta = left.priority - right.priority;
+    if (priorityDelta !== 0)
+      return priorityDelta;
+    return idOf(left.task).localeCompare(idOf(right.task));
+  });
+}
+
 // packages/core/src/taskGraph.ts
 function isObjectRecord(value) {
   return typeof value === "object" && value !== null && !Array.isArray(value);
@@ -23,6 +68,9 @@ function readTaskMetadataStringList(task, key) {
   }
   return [];
 }
+function readTaskBlockingDependencyRefs(task) {
+  return readTaskMetadataStringList(task, "dependencies");
+}
 function readTaskDependencyRefs(task) {
   return unique([
     ...readTaskMetadataStringList(task, "dependencies"),
@@ -40,6 +88,32 @@ function readTaskSourceIssueId(task) {
   const rigMetadata = isObjectRecord(metadata?._rig) ? metadata._rig : null;
   return typeof rigMetadata?.sourceIssueId === "string" && rigMetadata.sourceIssueId.length > 0 ? rigMetadata.sourceIssueId : null;
 }
+function readTaskScope(task) {
+  const taskRecord = task;
+  const topLevel = readStringList(taskRecord.scope);
+  if (topLevel.length > 0)
+    return unique(topLevel.map((entry) => entry.trim()).filter((entry) => entry.length > 0));
+  const metadata = isObjectRecord(task.metadata) ? task.metadata : null;
+  const metadataScope = readStringList(metadata?.scope);
+  if (metadataScope.length > 0)
+    return unique(metadataScope.map((entry) => entry.trim()).filter((entry) => entry.length > 0));
+  return unique([
+    ...readStringList(metadata?.files),
+    ...readStringList(metadata?.paths)
+  ].map((entry) => entry.trim()).filter((entry) => entry.length > 0));
+}
+function isScopeList(input) {
+  return Array.isArray(input);
+}
+function normalizeScopeInput(input) {
+  return isScopeList(input) ? unique(input.map((entry) => entry.trim()).filter((entry) => entry.length > 0)) : readTaskScope(input);
+}
+function disjointScope(left, right) {
+  const leftScope = new Set(normalizeScopeInput(left));
+  if (leftScope.size === 0)
+    return true;
+  return normalizeScopeInput(right).every((entry) => !leftScope.has(entry));
+}
 function resolveTaskReference(ref, tasksById, taskIdByExternalRef, taskIdBySourceIssueId) {
   if (tasksById.has(ref))
     return ref;
@@ -68,7 +142,7 @@ function computeTaskBlockingDepths(tasks) {
     if (!task)
       return 0;
     stack.add(taskId);
-    const blockers = readTaskDependencyRefs(task).map((ref) => resolveTaskReference(ref, tasksById, taskIdByExternalRef, taskIdBySourceIssueId)).filter((ref) => ref !== null && ref !== taskId);
+    const blockers = readTaskBlockingDependencyRefs(task).map((ref) => resolveTaskReference(ref, tasksById, taskIdByExternalRef, taskIdBySourceIssueId)).filter((ref) => ref !== null && ref !== taskId);
     const depth = blockers.length === 0 ? 0 : Math.max(...blockers.map((blockerId) => visit(blockerId, stack) + 1));
     stack.delete(taskId);
     memo.set(taskId, depth);
@@ -111,6 +185,39 @@ function isTaskRunnableStatus(status) {
 function priorityValue(task) {
   return typeof task.priority === "number" && Number.isFinite(task.priority) ? task.priority : Number.MAX_SAFE_INTEGER;
 }
+function readTaskRole(task) {
+  if (typeof task.role === "string" && task.role.trim())
+    return task.role.trim();
+  const metadata = isObjectRecord(task.metadata) ? task.metadata : null;
+  return typeof metadata?.role === "string" && metadata.role.trim() ? metadata.role.trim() : null;
+}
+function readTaskCriticality(task) {
+  const metadata = isObjectRecord(task.metadata) ? task.metadata : null;
+  return typeof metadata?.criticality === "string" && metadata.criticality.trim() ? metadata.criticality.trim() : null;
+}
+function readTaskValidationKeys(task) {
+  const taskRecord = task;
+  const topLevel = readStringList(taskRecord.validationKeys);
+  if (topLevel.length > 0)
+    return topLevel;
+  const metadata = isObjectRecord(task.metadata) ? task.metadata : null;
+  return readStringList(metadata?.validation);
+}
+function readTaskQueueWeight(task) {
+  const metadata = isObjectRecord(task.metadata) ? task.metadata : null;
+  const queueWeight = metadata?.queueWeight ?? metadata?.queue_weight;
+  return typeof queueWeight === "number" && Number.isFinite(queueWeight) ? queueWeight : 0;
+}
+function scoreInputForTask(task, unblockCount) {
+  return {
+    priority: task.priority,
+    unblockCount,
+    role: readTaskRole(task),
+    criticality: readTaskCriticality(task),
+    validation: readTaskValidationKeys(task),
+    queueWeight: readTaskQueueWeight(task)
+  };
+}
 function computeTaskDependencyBadges(tasks) {
   const index = buildTaskReferenceIndex(tasks);
   const blockingDepths = computeTaskBlockingDepths(tasks);
@@ -120,7 +227,7 @@ function computeTaskDependencyBadges(tasks) {
   for (const task of tasks) {
     const dependencyIds = [];
     const unresolvedRefs = [];
-    for (const ref of readTaskDependencyRefs(task)) {
+    for (const ref of readTaskBlockingDependencyRefs(task)) {
       const dependencyId = resolveTaskReference(ref, index.tasksById, index.taskIdByExternalRef, index.taskIdBySourceIssueId);
       if (dependencyId && dependencyId !== task.id) {
         dependencyIds.push(dependencyId);
@@ -207,13 +314,63 @@ function selectNextReadyTaskByPriority(tasks, options = {}) {
   });
   return candidates[0] ?? null;
 }
+function rankReadyTasks(tasks, options = {}) {
+  const excluded = new Set(options.excludeTaskIds ?? []);
+  const activeTaskIds = new Set(options.activeTaskIds ?? []);
+  const badges = computeTaskDependencyBadges(tasks);
+  const tasksById = new Map(tasks.map((task) => [String(task.id), task]));
+  const openBlockCount = (task) => (badges.get(task.id)?.blocks ?? []).filter((blockedTaskId) => {
+    const blockedTask = tasksById.get(blockedTaskId);
+    return blockedTask ? !isTaskTerminalStatus(blockedTask.status) : false;
+  }).length;
+  const readyTasks = tasks.filter((task) => !excluded.has(task.id)).filter((task) => !activeTaskIds.has(task.id)).filter((task) => options.filter?.(task) ?? true).filter((task) => badges.get(task.id)?.ready === true);
+  const maxUnblockCount = Math.max(0, ...readyTasks.map(openBlockCount));
+  const selectedByMode = readyTasks.filter((task) => {
+    const unblockCount = openBlockCount(task);
+    if (options.selection === "blocking-only")
+      return unblockCount > 0;
+    if (options.selection === "max-unblock")
+      return maxUnblockCount > 0 && unblockCount === maxUnblockCount;
+    return true;
+  });
+  return rankTasks(selectedByMode, (task) => scoreInputForTask(task, openBlockCount(task)), (task) => task.id).map((entry) => ({
+    task: entry.task,
+    score: entry.score,
+    priority: entry.priority,
+    unblockCount: entry.unblockCount,
+    scope: readTaskScope(entry.task)
+  }));
+}
+function selectRankedReadyTasks(tasks, options = {}) {
+  const ranked = rankReadyTasks(tasks, options);
+  if (options.requireDisjointScopes !== true && !options.disjointWithScopes) {
+    return ranked.slice(0, options.limit).map((entry) => entry.task);
+  }
+  const occupiedScopes = new Set(options.disjointWithScopes ?? []);
+  const selected = [];
+  for (const entry of ranked) {
+    if (entry.scope.some((scope) => occupiedScopes.has(scope)))
+      continue;
+    selected.push(entry.task);
+    for (const scope of entry.scope)
+      occupiedScopes.add(scope);
+    if (options.limit !== undefined && selected.length >= options.limit)
+      break;
+  }
+  return selected;
+}
 export {
+  selectRankedReadyTasks,
   selectNextReadyTaskByPriority,
   resolveTaskReference,
   readTaskSourceIssueId,
+  readTaskScope,
   readTaskMetadataStringList,
   readTaskDependencyRefs,
+  readTaskBlockingDependencyRefs,
+  rankReadyTasks,
   isTaskTerminalStatus,
+  disjointScope,
   computeTaskDependencyBadges,
   computeTaskBlockingDepths,
   buildTaskReferenceIndex

package/dist/src/taskGraphLayout.d.ts

@@ -18,6 +18,7 @@ export type TaskGraphStage = Readonly<{
 }>;
 export type TaskGraphNode = Readonly<{
     id: string;
+    taskId: string;
     task: TaskSummary;
     rowKey: string;
     rowLabel: string;

package/dist/src/taskGraphLayout.js

@@ -107,7 +107,10 @@ function isObjectRecord2(value) {
 }
 function readIssueType(task) {
   const metadata = isObjectRecord2(task.metadata) ? task.metadata : null;
-  return typeof metadata?.issueType === "string" ? metadata.issueType : null;
+  if (typeof metadata?.issueType === "string")
+    return metadata.issueType;
+  const raw = isObjectRecord2(metadata?.raw) ? metadata.raw : null;
+  return typeof raw?.issueType === "string" ? raw.issueType : null;
 }
 function isGraphTask(task) {
   return readIssueType(task) !== "epic";
@@ -354,6 +357,7 @@ function buildTaskGraphLayout(snapshot, tasks, options) {
         const artifactCount = (snapshot?.artifacts ?? []).filter((artifact) => runIds.has(artifact.runId)).length;
         nodes.push({
           id: task.id,
+          taskId: task.id,
           task,
           rowKey,
           rowLabel: rowLabelByKey.get(rowKey) ?? rowKey,

package/dist/src/taskScore.d.ts

@@ -0,0 +1,17 @@
+export type TaskCriticality = "core" | "high" | "normal" | string;
+export interface TaskScoreInput {
+    readonly priority?: number | null;
+    readonly unblockCount?: number | null;
+    readonly role?: string | null;
+    readonly criticality?: TaskCriticality | null;
+    readonly validation?: readonly string[] | null;
+    readonly queueWeight?: number | null;
+}
+export interface RankedTask<T> {
+    readonly task: T;
+    readonly score: number;
+    readonly priority: number;
+    readonly unblockCount: number;
+}
+export declare function scoreTask(input: TaskScoreInput): number;
+export declare function rankTasks<T>(tasks: readonly T[], scoreInput: (task: T) => TaskScoreInput, idOf: (task: T) => string): readonly RankedTask<T>[];