Mercurial > hg

view tests/test-config-env.py.out @ 39536:bdb177923291

Find changesets by keywords (author, files, the commit message), revision number or hash, or revset expression.
ancestor: optimize _lazyancestorsiter() for contiguous chains If there's no revision between p1 and current, p1 must be the next revision to visit. In this case, we can get around the overhead of heappop/push operations. Note that this is faster than using heapreplace(). 'current - p1 == 1' could be generalized as 'all(r not in seen for r in xrange(p1, current)', but Python is too slow to do such thing.
author Yuya Nishihara <yuya@tcha.org>
date Mon, 10 Sep 2018 21:58:59 +0900
parents d83e51654c8a
children
line wrap: on
line source

pager.pager=p0 # $TESTTMP/sysrc:4
ui.editor=e1 # $TESTTMP/userrc:2

pager.pager=p2 # $PAGER
ui.editor=e1 # $TESTTMP/userrc:2