pub fn items() -> Vec<Item>
Every item waiting, ordered by urgency and then by age: the first row is the one that costs most to leave.