Sat, 03 Apr 2010 11:58:16 +1100 findrenames: Optimise "addremove -s100" by matching files by their SHA1 hashes.
David Greenaway <hg-dev@davidgreenaway.com> [Sat, 03 Apr 2010 11:58:16 +1100] rev 11060
findrenames: Optimise "addremove -s100" by matching files by their SHA1 hashes. We speed up 'findrenames' for the usecase when a user specifies they want a similarity of 100% by matching files by their exact SHA1 hash value. This reduces the number of comparisons required to find exact matches from O(n^2) to O(n). While it would be nice if we could just use mercurial's pre-calculated SHA1 hash for existing files, this hash includes the file's ancestor information making it unsuitable for our purposes. Instead, we calculate the hash of old content from scratch. The following benchmarks were taken on the current head of crew: addremove 100% similarity: rm -rf *; hg up -C; mv tests tests.new hg --time addremove -s100 --dry-run before: real 176.350 secs (user 128.890+0.000 sys 47.430+0.000) after: real 2.130 secs (user 1.890+0.000 sys 0.240+0.000) addremove 75% similarity: rm -rf *; hg up -C; mv tests tests.new; \ for i in tests.new/*; do echo x >> $i; done hg --time addremove -s75 --dry-run before: real 264.560 secs (user 215.130+0.000 sys 49.410+0.000) after: real 218.710 secs (user 172.790+0.000 sys 45.870+0.000)
Sat, 03 Apr 2010 11:58:16 +1100 Move 'findrenames' code into its own file.
David Greenaway <hg-dev@davidgreenaway.com> [Sat, 03 Apr 2010 11:58:16 +1100] rev 11059
Move 'findrenames' code into its own file. The next few patches will increase the size of the "findrenames" functionality. This patch simply moves the function into its own file to avoid clutter building up in 'cmdutil.py'.
Sat, 01 May 2010 14:32:50 +0200 acl: cleanup module docstring
Martin Geisler <mg@lazybytes.net> [Sat, 01 May 2010 14:32:50 +0200] rev 11058
acl: cleanup module docstring - removed implementation detail about how the group information is obtained - fixed some language, better consistency - fixed bad comment in hgrc example
Sat, 01 May 2010 14:20:17 +0200 acl: fix ReST syntax in docstring
Martin Geisler <mg@lazybytes.net> [Sat, 01 May 2010 14:20:17 +0200] rev 11057
acl: fix ReST syntax in docstring
Sat, 01 May 2010 16:15:55 +0200 relink: removed unneeded local variable
Martin Geisler <mg@lazybytes.net> [Sat, 01 May 2010 16:15:55 +0200] rev 11056
relink: removed unneeded local variable
Sat, 01 May 2010 16:35:27 +0200 test-acl: grep for $HGTMP, not /tmp/
Martin Geisler <mg@lazybytes.net> [Sat, 01 May 2010 16:35:27 +0200] rev 11055
test-acl: grep for $HGTMP, not /tmp/
Sat, 01 May 2010 16:15:27 +0200 Merge with stable
Martin Geisler <mg@lazybytes.net> [Sat, 01 May 2010 16:15:27 +0200] rev 11054
Merge with stable
Fri, 30 Apr 2010 18:11:56 +0200 dispatch: don't mangle ImportError abort messages stable
Dan Villiom Podlaski Christiansen <danchr@gmail.com> [Fri, 30 Apr 2010 18:11:56 +0200] rev 11053
dispatch: don't mangle ImportError abort messages Previously, Mercurial assumed that the last word of the string representation was the name of the moduled that was imported. This assmption is incorrect, despite being true for the common case of an exception raised by the Python VM. For example, hgsubversion raises an ImportError with a helpful message if the Subversion bindings were not found. The final word of this message is not meaningful on its own, and is never the name of a module. This patch changes the output printed to be a simple stringification of the exception instance. In most cases, this will be `abort: No module named X!' rather than `abort: could not import module X!'. No functionality change; all tests pass.
Sat, 01 May 2010 14:36:48 +0200 relink/progress: correctly handle the no file to relink case stable
Benoit Boissinot <benoit.boissinot@ens-lyon.org> [Sat, 01 May 2010 14:36:48 +0200] rev 11052
relink/progress: correctly handle the no file to relink case
Thu, 29 Apr 2010 22:14:14 -0500 Merge with stable
Matt Mackall <mpm@selenic.com> [Thu, 29 Apr 2010 22:14:14 -0500] rev 11051
Merge with stable
(0) -10000 -3000 -1000 -300 -100 -10 +10 +100 +300 +1000 +3000 +10000 +30000 tip