Mercurial > hg
comparison tests/test-ancestor.py.out @ 23331:3b1b8f25443e
test-ancestor: use random testing for missing ancestors
We're going to make changes to the missing ancestor algorithm, and random
testing will give us much more confidence than a fixed set of tests.
author | Siddharth Agarwal <sid0@fb.com> |
---|---|
date | Sat, 15 Nov 2014 10:55:34 -0800 |
parents | c6cd4b8b76f8 |
children | b6db2e80a9ce |
comparison
equal
deleted
inserted
replaced
23330:37c3731d8a58 | 23331:3b1b8f25443e |
---|---|
1 % ancestors of [] and not of [1] | |
2 [] | |
3 % ancestors of [] and not of [] | |
4 [] | |
5 % ancestors of [12] and not of [] | |
6 [0, 1, 2, 4, 6, 7, 9, 12] | |
7 % ancestors of [0] and not of [0] | |
8 [] | |
9 % ancestors of [4, 5, 6] and not of [6, 5, 4] | |
10 [] | |
11 % ancestors of [-1] and not of [12] | |
12 [] | |
13 % ancestors of [12] and not of [-1] | |
14 [0, 1, 2, 4, 6, 7, 9, 12] | |
15 % ancestors of [12] and not of [9] | |
16 [12] | |
17 % ancestors of [9] and not of [12] | |
18 [] | |
19 % ancestors of [12, 9] and not of [7] | |
20 [6, 9, 12] | |
21 % ancestors of [7, 6] and not of [12] | |
22 [] | |
23 % ancestors of [10] and not of [11, 12] | |
24 [5, 10] | |
25 % ancestors of [11] and not of [10] | |
26 [3, 7, 11] | |
27 % ancestors of [11] and not of [10, 12] | |
28 [3, 11] | |
29 % ancestors of [12] and not of [10] | |
30 [6, 7, 9, 12] | |
31 % ancestors of [12] and not of [11] | |
32 [6, 9, 12] | |
33 % ancestors of [10, 11, 12] and not of [13] | |
34 [0, 1, 2, 3, 4, 5, 6, 7, 9, 10, 11, 12] | |
35 % ancestors of [13] and not of [10, 11, 12] | |
36 [8, 13] | |
37 % lazy ancestor set for [], stoprev = 0, inclusive = False | 1 % lazy ancestor set for [], stoprev = 0, inclusive = False |
38 membership: [] | 2 membership: [] |
39 iteration: [] | 3 iteration: [] |
40 % lazy ancestor set for [11, 13], stoprev = 0, inclusive = False | 4 % lazy ancestor set for [11, 13], stoprev = 0, inclusive = False |
41 membership: [7, 8, 3, 4, 1, 0] | 5 membership: [7, 8, 3, 4, 1, 0] |