ancestors: actually iterate over ancestors in topological order (issue5979) This code previously used a dequeue logic, the first ancestors seen were the first ancestors to be emitted. In branching/merging situations, it can result in ancestors being yielded before their descendants, breaking the object contract. We got affected by this issue while working on the copy tracing code. At about the same time, Axel Hecht <axel@mozilla.com> reported the issue and provided the test case used in this changeset. Thanks Axel. Running `hg perfancestors` does not show a significant difference between the old and the new version.

     1

% lazy ancestor set for [], stoprev = 0, inclusive = False

     2

membership: []

     3

iteration:  []

     4

% lazy ancestor set for [11, 13], stoprev = 0, inclusive = False

     5

membership: [7, 8, 3, 4, 1, 0]

     6

iteration:  [8, 7, 4, 3, 2, 1, 0]

     7

% lazy ancestor set for [1, 3], stoprev = 0, inclusive = False

     8

membership: [1, 0]

     9

iteration:  [1, 0]

    10

% lazy ancestor set for [11, 13], stoprev = 0, inclusive = True

    11

membership: [11, 13, 7, 8, 3, 4, 1, 0]

    12

iteration:  [11, 13, 8, 7, 4, 3, 2, 1, 0]

    13

% lazy ancestor set for [11, 13], stoprev = 6, inclusive = False

    14

membership: [7, 8]

    15

iteration:  [8, 7]

    16

% lazy ancestor set for [11, 13], stoprev = 6, inclusive = True

    17

membership: [11, 13, 7, 8]

    18

iteration:  [11, 13, 8, 7]