FA-64558 / Clinical triage scoring / Member archive

Waiting room queue ordering with overdue escalation: escalation floor · case 03

An overdue level 1 patient gets priority 0 and jumps ahead of earlier arrivals at priority 1.

Member previewVariant 3 · 3 implementations · 8 checks per implementation

Case contract

Input {now, patients [{id, level, arrival, retriage (or null)}]}. Effective level = retriage when present (up or down), else level. Target waits: 1:0, 2:10, 3:30, 4:60, 5:120 minutes. A patient whose wait strictly exceeds the target of the effective level is overdue and moves up one priority (never above 1). Order by (priority, arrival, id). Return {order, overdue (sorted ids)}.

Why this case matters

Queue ordering with re-triage and time escalation mixes several keys; the chosen level, comparison and tie-break are separate faults.

One recorded failure

Sample boundary fixture

This sample comes from the broken implementation of a controlled reproducer.

Boundary fixture	Actual	Expected	Outcome
level one waiting	`{"order": ["a", "b"], "overdue": ["a", "b"]}`	`{"order": ["b", "a"], "overdue": ["a", "b"]}`	Failed

MEMBER ARCHIVE

The complete case is available to members.

This record includes three runnable implementations, regression fixtures, execution results, and source hashes.

Member access is invitation-based. Sign in with your invited account to inspect the sources.