view tests/testlib/random-revs.py @ 6224:17ffdea0edbb stable

evolve: look for split successors of the correct ancestor (issue6648)

Consider two changesets, 1 and 2. 1 is split into two new changesets and 2 is
pruned. If we stand on 2 and call hg evolve, _singlesuccessor() will traverse
ancestors of wdp in search of a changeset with successors to update to (it will
be 1, which was split). In case of a split, select_split_successor() gets
control. The issue is this function didn't traverse ancestors, and instead
tried to look up successors of the original changeset (i.e. 2 in our case,
which was pruned).

We can make select_split_successor() aware of _singlesuccessor() logic by using
the changeset that actually has successors without traversing ancestors again.
It's done by storing that changeset in MultipleSuccessorsError exception.

#!/usr/bin/env python
"""
This simple script outputs a sequence of numbers separated by newlines. The
amount of numbers and their approximate values can be controlled by two command
line arguments.

Usage: $0 COUNT MAXADD. COUNT will determine the amount of numbers printed, and
MAXADD will limit the value that will be added to each of those numbers.
"""

from __future__ import print_function

import random
import sys

def main():
    count = int(sys.argv[1])
    maxadd = int(sys.argv[2])
    for x in range(count):
        print(x + random.randint(0, maxadd))

if __name__ == '__main__':
    main()