mirror of
https://github.com/facebook/sapling.git
synced 2024-10-06 23:07:18 +03:00
696c998447
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.
19 lines
686 B
Plaintext
19 lines
686 B
Plaintext
% lazy ancestor set for [], stoprev = 0, inclusive = False
|
|
membership: []
|
|
iteration: []
|
|
% lazy ancestor set for [11, 13], stoprev = 0, inclusive = False
|
|
membership: [7, 8, 3, 4, 1, 0]
|
|
iteration: [3, 7, 8, 1, 4, 0, 2]
|
|
% lazy ancestor set for [1, 3], stoprev = 0, inclusive = False
|
|
membership: [1, 0]
|
|
iteration: [0, 1]
|
|
% lazy ancestor set for [11, 13], stoprev = 0, inclusive = True
|
|
membership: [11, 13, 7, 8, 3, 4, 1, 0]
|
|
iteration: [11, 13, 3, 7, 8, 1, 4, 0, 2]
|
|
% lazy ancestor set for [11, 13], stoprev = 6, inclusive = False
|
|
membership: [7, 8]
|
|
iteration: [7, 8]
|
|
% lazy ancestor set for [11, 13], stoprev = 6, inclusive = True
|
|
membership: [11, 13, 7, 8]
|
|
iteration: [11, 13, 7, 8]
|