Fri, 20 Aug 2010 21:28:14 -0500 bisect: add test for unrelated starting revisions
Matt Mackall <mpm@selenic.com> [Fri, 20 Aug 2010 21:28:14 -0500] rev 12007
bisect: add test for unrelated starting revisions
Fri, 20 Aug 2010 21:23:47 -0500 merge with stable
Matt Mackall <mpm@selenic.com> [Fri, 20 Aug 2010 21:23:47 -0500] rev 12006
merge with stable
Fri, 20 Aug 2010 17:16:37 -0500 bisect: better message for unrelated starting revisions stable
Matt Mackall <mpm@selenic.com> [Fri, 20 Aug 2010 17:16:37 -0500] rev 12005
bisect: better message for unrelated starting revisions
Fri, 20 Aug 2010 15:31:05 -0500 debuginstall: report installpath
Matt Mackall <mpm@selenic.com> [Fri, 20 Aug 2010 15:31:05 -0500] rev 12004
debuginstall: report installpath
Fri, 20 Aug 2010 18:26:20 +0200 tests: unify test-glog
Adrian Buehlmann <adrian@cadifra.com> [Fri, 20 Aug 2010 18:26:20 +0200] rev 12003
tests: unify test-glog
Thu, 19 Aug 2010 17:33:46 -0500 bookmarks: fix long line
Matt Mackall <mpm@selenic.com> [Thu, 19 Aug 2010 17:33:46 -0500] rev 12002
bookmarks: fix long line
Thu, 19 Aug 2010 17:29:13 -0500 merge with stable
Matt Mackall <mpm@selenic.com> [Thu, 19 Aug 2010 17:29:13 -0500] rev 12001
merge with stable
Fri, 13 Aug 2010 19:42:28 +0530 revlog: addgroup re-adds punched revisions for missing parents
Vishakh H <vsh426@gmail.com> [Fri, 13 Aug 2010 19:42:28 +0530] rev 12000
revlog: addgroup re-adds punched revisions for missing parents While reading changegroup if a node with missing parents is encountered, we add a punched entry in the index with null parents for the missing parent node.
Fri, 13 Aug 2010 19:41:51 +0530 revlog: generate full revisions when parent node is missing
Vishakh H <vsh426@gmail.com> [Fri, 13 Aug 2010 19:41:51 +0530] rev 11999
revlog: generate full revisions when parent node is missing The full revision is sent if the first parent, against which diff is calculated, is missing at remote. This happens in the case of shallow clones.
Fri, 20 Aug 2010 00:17:50 +0200 revlog.revision(): inline deltachain computation
Benoit Boissinot <benoit.boissinot@ens-lyon.org> [Fri, 20 Aug 2010 00:17:50 +0200] rev 11998
revlog.revision(): inline deltachain computation
(0) -10000 -3000 -1000 -300 -100 -10 +10 +100 +300 +1000 +3000 +10000 +30000 tip