pub fn keys(
workspace: &Workspace,
graph: &TaskGraph,
prepared: &BTreeMap<String, PreparedTask>,
cancelled: &AtomicBool,
) -> Result<BTreeMap<String, Keyed>>Expand description
The key each task in graph would be cached under if it ran now, and what
it is computed from, without running a task. Runtime inputs are executed.
A dependency counts as having succeeded, fingerprinted by its outputs as
they are on disk.