depot - monorepo for the virus lounge

Age	Commit message (Collapse)	Author	Files	Lines
2007-03-30	* Make the maximum patch size configurable.	Eelco Dolstra	1	-3/+9

2007-01-23	* New kind of manifest object: "localPath", which denotes that a store	Eelco Dolstra	1	-2/+4
	path can be created by copying it from another location in the file system. This is useful in the NixOS installation.
2007-01-23	* Successors have been gone for ages.	Eelco Dolstra	1	-8/+5

2007-01-08	* Reject patches that are larger than a certain fraction of the full archive	Eelco Dolstra	1	-4/+13
	(currently 60%). Large patches aren't very economical.
2007-01-08	* Huge speedup in patch propagation (20 minutes or so to 3 seconds).	Eelco Dolstra	1	-8/+15

2006-10-12	* Reduce the maximum archive size for patch generation to 100 MB to	Eelco Dolstra	1	-1/+1
	prevent trashing on nix.cs.uu.nl.
2006-10-04	* tmpnam() -> File::Temp::tempdir().	Eelco Dolstra	1	-17/+16

2005-12-13	* Change `referer' to `referrer' throughout. In particular, the	Eelco Dolstra	1	-7/+7
	nix-store query options `--referer' and `--referer-closure' have been changed to `--referrer' and `--referrer-closure' (but the old ones are still accepted for compatibility).
2005-06-18	* Don't create patches for archives >= 150 MB because bsdiff can't	Eelco Dolstra	1	-1/+13
	handle it. It crashed on the 234 MB tetex archive. Probably we will never be able to handle archives of that size on 32-bit machines (because bsdiff does everything in memory requiring max(17n,9n+m)+O(1) bytes, so the address space simply isn't there).
2005-04-12	* Damn. Disable the USE heuristic for now, since the deriver in the	Eelco Dolstra	1	-4/+4
	database isn't always in the manifest (so the reference graph cannot be reconstructed fully).
2005-03-18	* Ignore hash conflicts in gc-releases.pl.	Eelco Dolstra	1	-1/+1

2005-03-15	* Use SHA-256 for nix-push.	Eelco Dolstra	1	-1/+1

2005-03-14	* Prefix hash algorithm in patch generator too.	Eelco Dolstra	1	-8/+9

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