224 lines
6.6 KiB
TypeScript
224 lines
6.6 KiB
TypeScript
import { computeBlockerFanoutMap } from "./blocker-fanout.js";
|
|
import { DEFAULT_TASK_PRIORITY, TASK_PRIORITIES } from "./types.js";
|
|
import type { Task, TaskPriority } from "./types.js";
|
|
|
|
export interface TaskPrioritySortable {
|
|
id: string;
|
|
createdAt: string;
|
|
priority?: TaskPriority | null;
|
|
}
|
|
|
|
export interface TaskColumnSortable extends TaskPrioritySortable {
|
|
column: string;
|
|
status?: string | null;
|
|
columnMovedAt?: string;
|
|
updatedAt?: string;
|
|
}
|
|
|
|
const PRIORITY_RANK: Record<TaskPriority, number> = {
|
|
low: 0,
|
|
normal: 1,
|
|
high: 2,
|
|
urgent: 3,
|
|
};
|
|
|
|
export function isTaskPriority(value: unknown): value is TaskPriority {
|
|
return typeof value === "string" && (TASK_PRIORITIES as readonly string[]).includes(value);
|
|
}
|
|
|
|
/**
|
|
* Normalize an optional/legacy task priority value to the bounded core contract.
|
|
* Missing or invalid values map to DEFAULT_TASK_PRIORITY (`normal`).
|
|
*/
|
|
export function normalizeTaskPriority(priority: unknown): TaskPriority {
|
|
return isTaskPriority(priority) ? priority : DEFAULT_TASK_PRIORITY;
|
|
}
|
|
|
|
/**
|
|
* Return a numeric rank where higher values indicate higher priority.
|
|
*/
|
|
export function getTaskPriorityRank(priority: unknown): number {
|
|
return PRIORITY_RANK[normalizeTaskPriority(priority)];
|
|
}
|
|
|
|
/**
|
|
* Compare priorities so higher-priority tasks sort first.
|
|
*/
|
|
export function compareTaskPriority(a: unknown, b: unknown): number {
|
|
return getTaskPriorityRank(b) - getTaskPriorityRank(a);
|
|
}
|
|
|
|
export function compareTaskIdNumeric(a: string, b: string): number {
|
|
const aNum = Number.parseInt(a.slice(a.lastIndexOf("-") + 1), 10);
|
|
const bNum = Number.parseInt(b.slice(b.lastIndexOf("-") + 1), 10);
|
|
|
|
if (Number.isFinite(aNum) && Number.isFinite(bNum) && aNum !== bNum) {
|
|
return aNum - bNum;
|
|
}
|
|
|
|
return a.localeCompare(b);
|
|
}
|
|
|
|
/**
|
|
* Deterministic comparator for priority-aware task ordering:
|
|
* 1) priority (urgent → low), 2) createdAt ASC, 3) id ASC.
|
|
*/
|
|
export function compareTasksByPriorityThenAgeAndId<T extends TaskPrioritySortable>(a: T, b: T): number {
|
|
const priorityCmp = compareTaskPriority(a.priority, b.priority);
|
|
if (priorityCmp !== 0) {
|
|
return priorityCmp;
|
|
}
|
|
|
|
if (a.createdAt !== b.createdAt) {
|
|
return a.createdAt.localeCompare(b.createdAt);
|
|
}
|
|
|
|
return compareTaskIdNumeric(a.id, b.id);
|
|
}
|
|
|
|
/**
|
|
* Return a sorted copy (input remains unchanged).
|
|
*/
|
|
export function sortTasksByPriorityThenAgeAndId<T extends TaskPrioritySortable>(
|
|
tasks: readonly T[],
|
|
): T[] {
|
|
return [...tasks].sort(compareTasksByPriorityThenAgeAndId);
|
|
}
|
|
|
|
const FANOUT_SECONDARY_WEIGHT_MULTIPLIER = 1_000_000;
|
|
const UNBLOCK_ACTIVE_COLUMNS = new Set<Task["column"]>(["triage", "todo", "in-progress", "in-review"]);
|
|
const DONE_COLUMNS = new Set<Task["column"]>(["done", "archived"]);
|
|
|
|
export interface BuildUnblockWeightMapOptions {
|
|
maxAutoMergeRetries?: number;
|
|
}
|
|
|
|
function countUnmetDependencies(task: Task, taskById: Map<string, Task>): number {
|
|
let unmet = 0;
|
|
for (const dependencyId of task.dependencies ?? []) {
|
|
const dependency = taskById.get(dependencyId);
|
|
if (!dependency) {
|
|
unmet += 1;
|
|
continue;
|
|
}
|
|
if (DONE_COLUMNS.has(dependency.column)) {
|
|
continue;
|
|
}
|
|
unmet += 1;
|
|
}
|
|
return unmet;
|
|
}
|
|
|
|
export function buildUnblockWeightMap(
|
|
tasks: readonly Task[],
|
|
options: BuildUnblockWeightMapOptions = {},
|
|
): Map<string, number> {
|
|
const taskList = [...tasks];
|
|
const fanout = computeBlockerFanoutMap(taskList, options.maxAutoMergeRetries ?? 0);
|
|
const taskById = new Map(taskList.map((task) => [task.id, task]));
|
|
const weights = new Map<string, number>();
|
|
|
|
for (const [blockerId, entry] of fanout) {
|
|
let primaryOnlyUnmetCount = 0;
|
|
let secondaryActiveDependentCount = 0;
|
|
|
|
for (const dependentId of entry.dependencyDependentIds) {
|
|
const dependent = taskById.get(dependentId);
|
|
if (!dependent || !UNBLOCK_ACTIVE_COLUMNS.has(dependent.column)) {
|
|
continue;
|
|
}
|
|
secondaryActiveDependentCount += 1;
|
|
if (countUnmetDependencies(dependent, taskById) === 1) {
|
|
primaryOnlyUnmetCount += 1;
|
|
}
|
|
}
|
|
|
|
const weight = primaryOnlyUnmetCount * FANOUT_SECONDARY_WEIGHT_MULTIPLIER + secondaryActiveDependentCount;
|
|
weights.set(blockerId, weight);
|
|
}
|
|
|
|
return weights;
|
|
}
|
|
|
|
export interface PriorityFanoutComparatorContext {
|
|
unblockWeights: ReadonlyMap<string, number>;
|
|
}
|
|
|
|
/**
|
|
* FN-4969: within the same priority class, prefer tasks that unblock the most dependency-bound work.
|
|
* This must never reorder across priority classes — urgent user work always outranks fanout.
|
|
*/
|
|
export function compareTasksByPriorityFanoutThenAgeAndId<T extends TaskPrioritySortable>(
|
|
a: T,
|
|
b: T,
|
|
ctx: PriorityFanoutComparatorContext,
|
|
): number {
|
|
const priorityCmp = compareTaskPriority(a.priority, b.priority);
|
|
if (priorityCmp !== 0) {
|
|
return priorityCmp;
|
|
}
|
|
|
|
const aWeight = ctx.unblockWeights.get(a.id) ?? 0;
|
|
const bWeight = ctx.unblockWeights.get(b.id) ?? 0;
|
|
if (aWeight !== bWeight) {
|
|
return bWeight - aWeight;
|
|
}
|
|
|
|
if (a.createdAt !== b.createdAt) {
|
|
return a.createdAt.localeCompare(b.createdAt);
|
|
}
|
|
|
|
return compareTaskIdNumeric(a.id, b.id);
|
|
}
|
|
|
|
export function sortTasksByPriorityFanoutThenAgeAndId<T extends TaskPrioritySortable>(
|
|
tasks: readonly T[],
|
|
unblockWeights: ReadonlyMap<string, number>,
|
|
): T[] {
|
|
return [...tasks].sort((a, b) => compareTasksByPriorityFanoutThenAgeAndId(a, b, { unblockWeights }));
|
|
}
|
|
|
|
function getDoneSortTimestamp(task: TaskColumnSortable): number {
|
|
const timestamp = task.columnMovedAt ?? task.updatedAt ?? task.createdAt;
|
|
const parsed = Date.parse(timestamp);
|
|
return Number.isFinite(parsed) ? parsed : 0;
|
|
}
|
|
|
|
function isMergeActiveStatus(status: string | null | undefined): boolean {
|
|
return status === "merging" || status === "merging-pr" || status === "merging-fix";
|
|
}
|
|
|
|
/**
|
|
* Column-aware default ordering shared by board and list surfaces.
|
|
*/
|
|
export function sortTasksForDisplayColumn<T extends TaskColumnSortable>(tasks: readonly T[], column: string): T[] {
|
|
if (column === "todo") {
|
|
return sortTasksByPriorityThenAgeAndId(tasks);
|
|
}
|
|
|
|
return [...tasks].sort((a, b) => {
|
|
if (column === "done") {
|
|
const timestampCmp = getDoneSortTimestamp(b) - getDoneSortTimestamp(a);
|
|
if (timestampCmp !== 0) {
|
|
return timestampCmp;
|
|
}
|
|
return compareTaskIdNumeric(a.id, b.id);
|
|
}
|
|
|
|
if (column === "in-review") {
|
|
const aIsMerging = isMergeActiveStatus(a.status);
|
|
const bIsMerging = isMergeActiveStatus(b.status);
|
|
if (aIsMerging !== bIsMerging) {
|
|
return aIsMerging ? -1 : 1;
|
|
}
|
|
}
|
|
|
|
const priorityCmp = compareTaskPriority(a.priority, b.priority);
|
|
if (priorityCmp !== 0) {
|
|
return priorityCmp;
|
|
}
|
|
|
|
return compareTaskIdNumeric(a.id, b.id);
|
|
});
|
|
}
|