Expand description
Staleness rules: the drift findings derived by joining the composed graph to
the lockfile. Staleness is computed locally — per node (hash vs locked) and
per edge (target hash vs locked) — with no recursive propagation, so a
dependency cycle can’t loop or produce ambiguous staleness.
Findings: stale-node, stale-edge, new-edge, removed-edge,
removed-node. A stale node subsumes its outbound stale-edge findings; a
removed node subsumes its removed-edge findings.
Functions§
- evaluate
- Evaluate staleness findings for
graphagainstlock.