diff options
| author | Eelco Dolstra <e.dolstra@tudelft.nl> | 2005-02-22T15·23+0000 |
|---|---|---|
| committer | Eelco Dolstra <e.dolstra@tudelft.nl> | 2005-02-22T15·23+0000 |
| commit | eda2c3c2537562e3b18c02a47b19e47ba3d37598 (patch) | |
| tree | 0bd65e02bb0fe09cf37501896b857b7a63951961 /src/nix-store/main.cc | |
| parent | 3c1630131e26efc90164bd8ca57870d9c4ad402b (diff) | |
* Compatibility hack so that Nixpkgs can continue to do hash checking
in `fetchurl' in Nix <= 0.7, but doesn't in Nix 0.8.
Diffstat (limited to 'src/nix-store/main.cc')
| -rw-r--r-- | src/nix-store/main.cc | 2 |
1 files changed, 1 insertions, 1 deletions
diff --git a/src/nix-store/main.cc b/src/nix-store/main.cc index 545df0638d79..6e590ba06f9c 100644 --- a/src/nix-store/main.cc +++ b/src/nix-store/main.cc @@ -209,7 +209,7 @@ static void printDrvTree(const Path & drvPath, i != drv.inputDrvs.end(); ++i) inputs.insert(i->first); - /* Topologically sorted under the relation A < B iff A \in + /* Topologically sort under the relation A < B iff A \in closure(B). That is, if derivation A is an (possibly indirect) input of B, then A is printed first. This has the effect of flattening the tree, preventing deeply nested structures. */ |