Mercurial > hg
view tests/test-issue4074.t @ 29690:5684bc429e6a
discovery: move code to create outgoing from roots and heads
changegroup.changegroupsubset() contained somewhat low-level code for
constructing an "outgoing" instance from a list of roots and heads
nodes. It feels like discovery.py is a more appropriate location for
this code.
This code can definitely be optimized, as outgoing.missing will
recompute the set of changesets we've already discovered from
cl.between(). But code shouldn't be refactored during a move, so
I've simply inserted a TODO calling attention to that.
author | Gregory Szorc <gregory.szorc@gmail.com> |
---|---|
date | Wed, 03 Aug 2016 22:07:52 -0700 |
parents | f1ca249696ed |
children | 75be14993fda |
line wrap: on
line source
#require no-pure A script to generate nasty diff worst-case scenarios: $ cat > s.py <<EOF > import random > for x in xrange(100000): > print > if random.randint(0, 100) >= 50: > x += 1 > print hex(x) > EOF $ hg init a $ cd a Check in a big file: $ python ../s.py > a $ hg ci -qAm0 Modify it: $ python ../s.py > a Time a check-in, should never take more than 10 seconds user time: $ hg ci --time -m1 time: real .* secs .user [0-9][.].* sys .* (re)