FA-97305 / Recipe scaling and nutrition / Member archive
Backward recipe step scheduler: midnight wraparound · case 05
A marinade starting the previous evening prints "-3:00".
Case contract
Steps [name, minutes, depends_on]; a step must finish before any step depending on it starts. Latest start = min(latest start of dependents, serve time) - minutes. Unknown dependency -> "error: unknown step X"; a cycle -> "error: cycle". Serve "HH:MM"; starts print as "HH:MM" modulo 24h (previous day wraps). Output [[name, time]] sorted by absolute start then name.
Why this case matters
Dinner-party and restaurant prep planners schedule long marinades and roasts backward from service.
One recorded failure
Sample boundary fixtureThis sample comes from the broken implementation of a controlled reproducer.
| Boundary fixture | Actual | Expected | Outcome |
|---|---|---|---|
| regression: midnight wraparound | [["marinate", "-3:30"], ["sauce", "-2:00"], ["roast", "01:30"], ["prep", "01:50"]] | [["marinate", "21:30"], ["sauce", "22:00"], ["roast", "01:30"], ["prep", "01:50"]] | 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.
Sign in to the archive ↗