##// END OF EJS Templates
debugcommands: introduce new debugrequirements command...
debugcommands: introduce new debugrequirements command This for now just prints out the list of current requirements. In future this will be helpful in reading requirements from couple of sources, and checking which requirement comes from where. Differential Revision: https://phab.mercurial-scm.org/D8632

File last commit:

r39572:bdb17792 default
r45667:4a28f5e8 default
Show More
test-ancestor.py.out
41 lines | 1.4 KiB | text/plain | TextLexer
/ tests / test-ancestor.py.out
Georges Racinet
rust: translation of missingancestors...
r40995 % removeancestorsfrom(), example 1
remaining (sorted): [5, 6, 8, 9]
% removeancestorsfrom(), example 2
remaining (sorted): [11, 12, 13, 14]
% removeancestorsfrom(), example 3
remaining (sorted): [3, 5]
% missingancestors(), example 1
return [3, 7, 11]
% missingancestors(), example 2
return [5, 10]
% missingancestors(), example 3
return [3, 6, 9, 11]
% removeancestorsfrom(), bigger graph
Ok
Siddharth Agarwal
ancestor: add lazy membership testing to lazyancestors...
r18091 % lazy ancestor set for [], stoprev = 0, inclusive = False
Siddharth Agarwal
test-ancestor: test iteration for lazyancestors...
r23329 membership: []
iteration: []
Siddharth Agarwal
ancestor: add lazy membership testing to lazyancestors...
r18091 % lazy ancestor set for [11, 13], stoprev = 0, inclusive = False
Siddharth Agarwal
test-ancestor: test iteration for lazyancestors...
r23329 membership: [7, 8, 3, 4, 1, 0]
Boris Feld
ancestors: actually iterate over ancestors in topological order (issue5979)...
r39509 iteration: [8, 7, 4, 3, 2, 1, 0]
Pierre-Yves David
test-ancestor: add a test for `ancestor` with ancestry within the initset...
r22355 % lazy ancestor set for [1, 3], stoprev = 0, inclusive = False
Siddharth Agarwal
test-ancestor: test iteration for lazyancestors...
r23329 membership: [1, 0]
Boris Feld
ancestors: actually iterate over ancestors in topological order (issue5979)...
r39509 iteration: [1, 0]
Siddharth Agarwal
ancestor: add lazy membership testing to lazyancestors...
r18091 % lazy ancestor set for [11, 13], stoprev = 0, inclusive = True
Siddharth Agarwal
test-ancestor: test iteration for lazyancestors...
r23329 membership: [11, 13, 7, 8, 3, 4, 1, 0]
Boris Feld
ancestors: ensure a consistent order even in the "inclusive" case...
r39510 iteration: [13, 11, 8, 7, 4, 3, 2, 1, 0]
Siddharth Agarwal
ancestor: add lazy membership testing to lazyancestors...
r18091 % lazy ancestor set for [11, 13], stoprev = 6, inclusive = False
Siddharth Agarwal
test-ancestor: test iteration for lazyancestors...
r23329 membership: [7, 8]
Boris Feld
ancestors: actually iterate over ancestors in topological order (issue5979)...
r39509 iteration: [8, 7]
Siddharth Agarwal
ancestor: add lazy membership testing to lazyancestors...
r18091 % lazy ancestor set for [11, 13], stoprev = 6, inclusive = True
Siddharth Agarwal
test-ancestor: test iteration for lazyancestors...
r23329 membership: [11, 13, 7, 8]
Boris Feld
ancestors: ensure a consistent order even in the "inclusive" case...
r39510 iteration: [13, 11, 8, 7]
Yuya Nishihara
ancestor: add test showing inconsistency between __iter__ and __contains__
r39511 % lazy ancestor set for [11, 13], stoprev = 11, inclusive = True
membership: [11, 13]
iteration: [13, 11]
% lazy ancestor set for [11, 13], stoprev = 12, inclusive = True
Yuya Nishihara
ancestor: filter out initial revisions lower than stoprev
r39512 membership: [13]
Yuya Nishihara
ancestor: add test showing inconsistency between __iter__ and __contains__
r39511 iteration: [13]
Yuya Nishihara
ancestor: optimize _lazyancestorsiter() for contiguous chains...
r39572 % lazy ancestor set for [10, 1], stoprev = 0, inclusive = True
membership: [2, 10, 4, 5, 0, 1]
iteration: [10, 5, 4, 2, 1, 0]