Tue, 02 Oct 2007 20:22:33 +0200 set_exec: do not chmod a symlink
Steve Borho <steve@ageia.com> [Tue, 02 Oct 2007 20:22:33 +0200] rev 5347
set_exec: do not chmod a symlink
Sun, 30 Sep 2007 16:36:22 +0200 Test debugindexdot
Patrick Mezard <pmezard@gmail.com> [Sun, 30 Sep 2007 16:36:22 +0200] rev 5346
Test debugindexdot
Sun, 30 Sep 2007 12:08:33 +0200 Test mercurial convert sink removes empty directories.
Patrick Mezard <pmezard@gmail.com> [Sun, 30 Sep 2007 12:08:33 +0200] rev 5345
Test mercurial convert sink removes empty directories.
Sun, 30 Sep 2007 12:08:33 +0200 convert: fix missing import
Patrick Mezard <pmezard@gmail.com> [Sun, 30 Sep 2007 12:08:33 +0200] rev 5344
convert: fix missing import
Sat, 29 Sep 2007 21:08:14 -0700 convert: delete empty directories if deleting a file (bug 754)
Bryan O'Sullivan <bos@serpentine.com> [Sat, 29 Sep 2007 21:08:14 -0700] rev 5343
convert: delete empty directories if deleting a file (bug 754)
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 5342
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 5341
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 5340
bdiff: simple splitlines optimization
Thu, 27 Sep 2007 23:57:57 -0500 I have spotted the biggest bottleneck in "bdiff.c". Actually it was
Christoph Spiel <cspiel@freenet.de> [Thu, 27 Sep 2007 23:57:57 -0500] rev 5339
I have spotted the biggest bottleneck in "bdiff.c". Actually it was pretty easy to find after I recompiled the python interpreter and mercurial for profiling. In "bdiff.c" function "equatelines" allocates the minimum hash table size, which can lead to tons of collisions. I introduced an "overcommit" factor of 16, this is, I allocate 16 times more memory than the minimum value. Overcommiting 128 times does not improve the performance over the 16-times case.
Wed, 26 Sep 2007 01:58:45 -0300 revlog: fix revlogio.packentry corner case
Alexis S. L. Carvalho <alexis@cecm.usp.br> [Wed, 26 Sep 2007 01:58:45 -0300] rev 5338
revlog: fix revlogio.packentry corner case We want to store version information about the revlog in the first entry of its index. The code in packentry was using some heuristics to detect whether this was the first entry, but these heuristics could fail in some cases (e.g. rev 0 was empty; rev 1 descends directly from the nullid and is stored as a delta). We now give the revision number to packentry to avoid heuristics.
(0) -3000 -1000 -300 -100 -10 +10 +100 +300 +1000 +3000 +10000 +30000 tip