Mercurial > hg
comparison tests/test-ancestor.py.out @ 39474:a60dae060bc8
ancestors: ensure a consistent order even in the "inclusive" case
It seems odds to first issue the "source" revs and then the other ancestors.
In addition, doing so can break the other contract of always issuing a child
before its parent. We update the code to apply the same logic to all yielded
revision. No tests break so we seem in the clear except where we explicitly
test the order.
author | Boris Feld <boris.feld@octobus.net> |
---|---|
date | Thu, 06 Sep 2018 19:37:38 -0400 |
parents | b6db2e80a9ce |
children | 431068d7e9db |
comparison
equal
deleted
inserted
replaced
39473:b6db2e80a9ce | 39474:a60dae060bc8 |
---|---|
7 % lazy ancestor set for [1, 3], stoprev = 0, inclusive = False | 7 % lazy ancestor set for [1, 3], stoprev = 0, inclusive = False |
8 membership: [1, 0] | 8 membership: [1, 0] |
9 iteration: [1, 0] | 9 iteration: [1, 0] |
10 % lazy ancestor set for [11, 13], stoprev = 0, inclusive = True | 10 % lazy ancestor set for [11, 13], stoprev = 0, inclusive = True |
11 membership: [11, 13, 7, 8, 3, 4, 1, 0] | 11 membership: [11, 13, 7, 8, 3, 4, 1, 0] |
12 iteration: [11, 13, 8, 7, 4, 3, 2, 1, 0] | 12 iteration: [13, 11, 8, 7, 4, 3, 2, 1, 0] |
13 % lazy ancestor set for [11, 13], stoprev = 6, inclusive = False | 13 % lazy ancestor set for [11, 13], stoprev = 6, inclusive = False |
14 membership: [7, 8] | 14 membership: [7, 8] |
15 iteration: [8, 7] | 15 iteration: [8, 7] |
16 % lazy ancestor set for [11, 13], stoprev = 6, inclusive = True | 16 % lazy ancestor set for [11, 13], stoprev = 6, inclusive = True |
17 membership: [11, 13, 7, 8] | 17 membership: [11, 13, 7, 8] |
18 iteration: [11, 13, 8, 7] | 18 iteration: [13, 11, 8, 7] |