depot - monorepo for the virus lounge

Age	Commit message (Collapse)	Author	Files	Lines
2005-03-01	* Use a weighted use heuristic to disambiguate between multiple	Eelco Dolstra	1	-8/+77
	occurances of a component. If the shortest path distance between a component P and Q in the referers graph is D, then the contribution of Q to the use of P is 1 / R^D, where R >= 1, typically 2. This expresses that distant indirect uses are less important than nearby uses. For instance, this can disambiguate between the bootstrap GCC in Nixpkgs and the GCC of the final stdenv (the former has more uses, but they are further away), and between the GCC of the final stdenv and the GCC+G77 build (the latter has very few uses).
2005-02-28	* Added a disambiguation heuristic: if two components have the same	Eelco Dolstra	1	-3/+23
	name but differ to much in sice (by more than a factor of 3), then never generate a patch.
2005-02-24	* Properly specify the hash algorithm in the manifests, and read it	Eelco Dolstra	1	-6/+7
	too. * Change the default hash for nix-prefetch-url back to md5, since that's what we use in Nixpkgs (for now; a birthday attack is rather unlikely there).
2005-02-01	* Get rid of hardcoded paths.	Eelco Dolstra	1	-0/+285