Wed, 05 Jun 2013 22:41:53 +0200 tests: do not print hgrc in test
Simon Heimberg <simohe@besonet.ch> [Wed, 05 Jun 2013 22:41:53 +0200] rev 19324
tests: do not print hgrc in test This lets test-rebase-cache.t pass also when --inotify or --extra-config-opt is specified.
Thu, 13 Jun 2013 01:37:02 +0200 contrib: delete setup3k in favor of setup --c2to3
Simon Heimberg <simohe@besonet.ch> [Thu, 13 Jun 2013 01:37:02 +0200] rev 19323
contrib: delete setup3k in favor of setup --c2to3 setup3k was merged into setup in 7a7a1c594d. Now finally get rid of it.
Thu, 13 Jun 2013 01:36:58 +0200 cleanup: remove unused imports
Simon Heimberg <simohe@besonet.ch> [Thu, 13 Jun 2013 01:36:58 +0200] rev 19322
cleanup: remove unused imports detected by pyflakes
Thu, 13 Jun 2013 01:44:02 +0200 tests: check-code more python files without py extension
simon@laptop-tosh [Thu, 13 Jun 2013 01:44:02 +0200] rev 19321
tests: check-code more python files without py extension files found by running $ hg manifest | grep -v "\." | xargs file | grep python
Fri, 14 Jun 2013 15:28:40 -0400 dummyssh: fix check-code nit
Augie Fackler <raf@durin42.com> [Fri, 14 Jun 2013 15:28:40 -0400] rev 19320
dummyssh: fix check-code nit
Wed, 19 Jun 2013 23:05:40 -0700 test-pathencode: randomize length of each path component stable
Siddharth Agarwal <sid0@fb.com> [Wed, 19 Jun 2013 23:05:40 -0700] rev 19319
test-pathencode: randomize length of each path component This makes it possible for long and short components to exist in the same path. This also makes shorter path components more likely. For randint(1, randint(1, n)), the likelihood that one sees a number k (1 <= k <= n) is 1/n * (\sum_{k=i}^n 1/i). This decreases with k, much like in the real world where shorter paths are more common than longer ones. The previous fix and this one together cause issue3958 to be detected by this test with reasonable frequency. When this test was run 100 times in a loop, the issue was detected 30 of those times.
Wed, 19 Jun 2013 23:01:22 -0700 test-pathencode: reduce makepart length requirement by 1 stable
Siddharth Agarwal <sid0@fb.com> [Wed, 19 Jun 2013 23:01:22 -0700] rev 19318
test-pathencode: reduce makepart length requirement by 1 This allows path components of length 1 to be generated.
Wed, 19 Jun 2013 22:34:34 -0700 pathencode: fix hashmangle short dir limit (issue3958) stable
Siddharth Agarwal <sid0@fb.com> [Wed, 19 Jun 2013 22:34:34 -0700] rev 19317
pathencode: fix hashmangle short dir limit (issue3958) The Python version of this (see mercurial/store.py:_hashencode) copies path components up to a limit of maxshortdirslen bytes. The Python version does not consider the initial "dh/" to be part of the this, though, while the C version currently does. Adding len("dh/") == 3 to the limit for the C version brings it in line with the Python version. This was not caught by the randomized testing scheme in test-pathencode.py because of a couple of flaws with the test. Upcoming patches will fix those problems.
Thu, 20 Jun 2013 14:06:11 -0500 docs: change description to synopsis in hgrc.5 stable
Matt Mackall <mpm@selenic.com> [Thu, 20 Jun 2013 14:06:11 -0500] rev 19316
docs: change description to synopsis in hgrc.5 Spotted by Eric S. Raymond.
Tue, 11 Jun 2013 23:39:48 +0200 run-tests: sort missing files first instead of raising an error
simon@laptop-tosh [Tue, 11 Jun 2013 23:39:48 +0200] rev 19315
run-tests: sort missing files first instead of raising an error sort first for early telling typos in test names
Thu, 30 May 2013 19:29:21 -0700 filectx: remove dependencies on filerev
Durham Goode <durham@fb.com> [Thu, 30 May 2013 19:29:21 -0700] rev 19314
filectx: remove dependencies on filerev Removing dependencies on filectx.filerev() makes it easier to create a filelog implementation that doesn't have rev numbers.
Sat, 08 Jun 2013 22:37:08 +0200 hg: move return statement after finally block
simon@laptop-tosh [Sat, 08 Jun 2013 22:37:08 +0200] rev 19313
hg: move return statement after finally block return is always run after finally block. Now we have same functionality, but clearer readability.
(0) -10000 -3000 -1000 -300 -100 -12 +12 +100 +300 +1000 +3000 +10000 +30000 tip