Mon, 25 Sep 2006 22:26:54 -0500 Merge with crew
Matt Mackall <mpm@selenic.com> [Mon, 25 Sep 2006 22:26:54 -0500] rev 3158
Merge with crew
Sun, 24 Sep 2006 13:52:27 +0200 optimize revlog.lookup when passed hex(node)[:...]
Benoit Boissinot <benoit.boissinot@ens-lyon.org> [Sun, 24 Sep 2006 13:52:27 +0200] rev 3157
optimize revlog.lookup when passed hex(node)[:...] Instead of converting each node from the filenode to a hex form, convert the arg to a bin form. For a revlog with 26711 entries, doing 100 lookup: before: ~18s after : ~13s
Sun, 24 Sep 2006 13:52:25 +0200 cleanups in revlog.lookup
Benoit Boissinot <benoit.boissinot@ens-lyon.org> [Sun, 24 Sep 2006 13:52:25 +0200] rev 3156
cleanups in revlog.lookup - add comments - do a clean separation of the different cases - don't use a list of each possible node when doing the lookup, just keep the previous entry
Mon, 25 Sep 2006 20:31:05 -0500 findcopies: use dirstate rename information
Matt Mackall <mpm@selenic.com> [Mon, 25 Sep 2006 20:31:05 -0500] rev 3155
findcopies: use dirstate rename information
Mon, 25 Sep 2006 17:53:17 -0500 dirstate: add copies function
Matt Mackall <mpm@selenic.com> [Mon, 25 Sep 2006 17:53:17 -0500] rev 3154
dirstate: add copies function rename copies to copymap
Mon, 25 Sep 2006 16:45:31 -0500 Add core copy detection algorithm
Matt Mackall <mpm@selenic.com> [Mon, 25 Sep 2006 16:45:31 -0500] rev 3153
Add core copy detection algorithm This adds findcopies, which detects merge-relevant copies between files in a pair of manifests back to the merge ancestor. While the merge code invokes the copy detection routine, it does not yet use the result.
Mon, 25 Sep 2006 16:43:21 -0500 context: change filectx repr to use @
Matt Mackall <mpm@selenic.com> [Mon, 25 Sep 2006 16:43:21 -0500] rev 3152
context: change filectx repr to use @ Avoids confusion with rev:nodeid syntax used elsewhere
Fri, 22 Sep 2006 16:12:39 -0500 context: add __repr__ methods
Matt Mackall <mpm@selenic.com> [Fri, 22 Sep 2006 16:12:39 -0500] rev 3151
context: add __repr__ methods
(0) -3000 -1000 -300 -100 -30 -10 -8 +8 +10 +30 +100 +300 +1000 +3000 +10000 +30000 tip