Open
Description
This would be a custom normalization routine (sensitive to loops, like forceEffects
) that would recursively descend a top-level tree (such as <nixpkgs>
) in order to report every attribute reachable from the top-level set. If we accept arguments in the spirit of GNU find, we could search for all paths under haskellPackages
, for example.
Once this exists and is implemented as a "recursing finder" (likely using my hierarchy library), then we could implement a test that recurses through the entire tree concurrently, and evaluates every attribute value and compares it to the evaluation of the same attribute using nix-instantiate
.