Thu, 04 Oct 2007 23:21:37 -0300 convert: pass the order of the revmapfile to the converter_source
Alexis S. L. Carvalho <alexis@cecm.usp.br> [Thu, 04 Oct 2007 23:21:37 -0300] rev 5373
convert: pass the order of the revmapfile to the converter_source The entries in this file are supposed to be topologically sorted and this may be useful for a converter_source.
Thu, 04 Oct 2007 19:47:22 -0500 Merge with crew
Matt Mackall <mpm@selenic.com> [Thu, 04 Oct 2007 19:47:22 -0500] rev 5372
Merge with crew
Thu, 04 Oct 2007 19:44:37 -0500 merge: add debug diagnostics for findcopies
Matt Mackall <mpm@selenic.com> [Thu, 04 Oct 2007 19:44:37 -0500] rev 5371
merge: add debug diagnostics for findcopies
Wed, 03 Oct 2007 17:17:28 -0500 changegroup: avoid large copies
Matt Mackall <mpm@selenic.com> [Wed, 03 Oct 2007 17:17:28 -0500] rev 5370
changegroup: avoid large copies - handle chunk headers separately rather than prepending them to (potentially large) chunks - break large chunks into 1M pieces for compression - don't prepend file metadata onto (potentially large) file data
Wed, 03 Oct 2007 17:17:27 -0500 revlog: generate trivial deltas against null revision
Matt Mackall <mpm@selenic.com> [Wed, 03 Oct 2007 17:17:27 -0500] rev 5369
revlog: generate trivial deltas against null revision To avoid extra memory usage and performance issues with large files, generate a trivial delta header for deltas against the null revision rather than calling the usual delta generator. We append the delta header to meta rather than prepending it to data to avoid a large allocate and copy.
Wed, 03 Oct 2007 16:50:32 -0500 Merge with crew
Matt Mackall <mpm@selenic.com> [Wed, 03 Oct 2007 16:50:32 -0500] rev 5368
Merge with crew
Tue, 02 Oct 2007 18:04:18 -0500 Merge with crew
Matt Mackall <mpm@selenic.com> [Tue, 02 Oct 2007 18:04:18 -0500] rev 5367
Merge with crew
Thu, 27 Sep 2007 23:59:18 -0500 bdiff: switch to lyhash
Matt Mackall <mpm@selenic.com> [Thu, 27 Sep 2007 23:59:18 -0500] rev 5366
bdiff: switch to lyhash lyhash is a very simple and fast hash function that had the fewest hash collisions on a 3.9M line text corpus and 190k line binary corpus and should have significantly fewer collisions than the current hash function.
Thu, 27 Sep 2007 23:59:02 -0500 bdiff: use INT_MAX to avoid some inner loop comparisons
Matt Mackall <mpm@selenic.com> [Thu, 27 Sep 2007 23:59:02 -0500] rev 5365
bdiff: use INT_MAX to avoid some inner loop comparisons
Thu, 27 Sep 2007 23:58:54 -0500 bdiff: simple splitlines optimization
Christoph Spiel <cspiel@freenet.de> [Thu, 27 Sep 2007 23:58:54 -0500] rev 5364
bdiff: simple splitlines optimization
(0) -3000 -1000 -300 -100 -10 +10 +100 tip