Benoit Boissinot <benoit.boissinot@ens-lyon.org> [Sat, 30 Apr 2011 10:00:41 +0200] rev 14141
bundler: make parsechunk return the base revision of the delta
timeless <timeless@mozdev.org> [Sun, 01 May 2011 15:22:30 +0200] rev 14140
tests: add pyflakes checking for unused imports
timeless <timeless@mozdev.org> [Sun, 01 May 2011 15:21:57 +0200] rev 14139
remove unused imports
Adrian Buehlmann <adrian@cadifra.com> [Sat, 30 Apr 2011 23:27:00 +0200] rev 14138
scmutil: introduce casecollisionauditor
and cleaning up portability functions
timeless <timeless@mozdev.org> [Sun, 01 May 2011 16:11:42 +0200] rev 14137
check-code: check for repo in revlog and ui in util
timeless <timeless@mozdev.org> [Sun, 01 May 2011 16:10:51 +0200] rev 14136
check-code: allow for checking multiple pattern sets per file
timeless <timeless@mozdev.org> [Sun, 01 May 2011 15:55:00 +0200] rev 14135
check-code: adding debug flag
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
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.
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
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.
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.
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.
Matt Mackall <mpm@selenic.com> [Sun, 01 May 2011 06:06:59 -0500] rev 14128
merge with stable