Sun, 01 May 2011 08:00:25 -0500 run-tests: add flag to provide extra hgrc options for test runs
Augie Fackler <durin42@gmail.com> [Sun, 01 May 2011 08:00:25 -0500] rev 14134
run-tests: add flag to provide extra hgrc options for test runs
Sun, 01 May 2011 15:51:52 +0200 graphlog: always sort revisions topologically
Patrick Mezard <pmezard@gmail.com> [Sun, 01 May 2011 15:51:52 +0200] rev 14133
graphlog: always sort revisions topologically The grapher cannot really handled revisions if they are not emitted in topological order. The previous 'reverse()' revset was not enough to achieve that and was replaced by an explicit sort call for simplicity. The --limit option is now also handled as usual with cmdutil.loglimit() instead of a 'limit' revset.
Sun, 01 May 2011 15:51:48 +0200 graphlog: take the union of --rev specs instead of the intersection
Patrick Mezard <pmezard@gmail.com> [Sun, 01 May 2011 15:51:48 +0200] rev 14132
graphlog: take the union of --rev specs instead of the intersection
Sun, 01 May 2011 15:51:46 +0200 graphmod: correctly emit nodes with more than 2 predecessors
Patrick Mezard <pmezard@gmail.com> [Sun, 01 May 2011 15:51:46 +0200] rev 14131
graphmod: correctly emit nodes with more than 2 predecessors The grandparent() function was returning only the closest predecessor of a missing parent while it must return all of them to display a correct ancestry graph.
Sun, 01 May 2011 15:51:20 +0200 graphlog: display nodes with more than 2 predecessors
Patrick Mezard <pmezard@gmail.com> [Sun, 01 May 2011 15:51:20 +0200] rev 14130
graphlog: display nodes with more than 2 predecessors While nodes with more than 2 parents do not exist in revision graphs, they do appear when you transform them by removing subgraphs while trying to preserve ancestry links. This code was borrowed from Peter Arrenbrecht <peter.arrenbrecht@gmail.com> pbranch extension.
Sun, 01 May 2011 08:29:50 -0500 context: provide an efficient iterator for workingctx
Matt Mackall <mpm@selenic.com> [Sun, 01 May 2011 08:29:50 -0500] rev 14129
context: provide an efficient iterator for workingctx This avoids needing to call status or build a synthetic manifest.
Sun, 01 May 2011 06:06:59 -0500 merge with stable
Matt Mackall <mpm@selenic.com> [Sun, 01 May 2011 06:06:59 -0500] rev 14128
merge with stable
(0) -10000 -3000 -1000 -300 -100 -30 -10 -7 +7 +10 +30 +100 +300 +1000 +3000 +10000 +30000 tip