pure mpatch: avoid using list.insert(0, ...) In Python lists are implemented as arrays with overallocation. As a result, list.insert(0, ...) is O(n), whereas list.append() has an amortised running time of O(1). Reversing the internal representation of the list should cause a slight speedup for pure Python builds.

remove unused imports and variables

Zeroconf: catch both ValueError and KeyError in get() This prevents a traceback during discovery of available hosts.

run-tests: print a new line before writing the diff

revsets: add a last function last(set, n) = reverser(limit(reverse(set), n))

bundle: more comments about the different header types, remove useless if

merge with mpm

hgweb: initialize permhooks at definition time This is simpler than creating it empty and then appending the default checkauthz hook 50 lines below.

revset: fix undefined name ParseError

branchcache: improve speed relative to the amount of heads Updating the branch cache is quadratic to the amount of heads in the repository. One consequence of this was that cloning a pathological repository with 10,000 heads (and nothing else) took hours of CPU time. This patch makes one of the inner loop much faster, by removing a changectx instantiation, and removes another entirely in cases where there are no candidate branch heads which descend from other branch heads.

drop {short,hex}(ctx.node()) calls in favor of ctx methods

mq: be more explicit on invalid patch name message