Show More
@@ -104,16 +104,28 b' class outgoing:' | |||
|
104 | 104 | m = 'commonheads and missingroots arguments are mutually exclusive' |
|
105 | 105 | raise error.ProgrammingError(m) |
|
106 | 106 | cl = repo.changelog |
|
107 | missing = None | |
|
108 | common = None | |
|
109 | if ancestorsof is None: | |
|
110 | ancestorsof = cl.heads() | |
|
111 | if missingroots: | |
|
112 | # TODO remove call to nodesbetween. | |
|
113 | missing_rev = repo.revs('%ln::%ln', missingroots, ancestorsof) | |
|
114 | 107 |
|
|
115 | 108 |
|
|
116 | 109 |
|
|
110 | missing = None | |
|
111 | common = None | |
|
112 | arg_anc = ancestorsof | |
|
113 | if ancestorsof is None: | |
|
114 | ancestorsof = cl.heads() | |
|
115 | ||
|
116 | # XXX-perf: do we need all this to be node-list? They would be simpler | |
|
117 | # as rev-num sets (and smartset) | |
|
118 | if missingroots == [nodemod.nullrev] or missingroots == []: | |
|
119 | commonheads = [repo.nullid] | |
|
120 | common = set() | |
|
121 | if arg_anc is None: | |
|
122 | missing = [to_node(r) for r in cl] | |
|
123 | else: | |
|
124 | missing_rev = repo.revs('::%ln', missingroots, ancestorsof) | |
|
125 | missing = [to_node(r) for r in missing_rev] | |
|
126 | elif missingroots is not None: | |
|
127 | # TODO remove call to nodesbetween. | |
|
128 | missing_rev = repo.revs('%ln::%ln', missingroots, ancestorsof) | |
|
117 | 129 | ancestorsof = [to_node(r) for r in ucl.headrevs(missing_rev)] |
|
118 | 130 | parent_revs = ucl.parentrevs |
|
119 | 131 | common_legs = set() |
General Comments 0
You need to be logged in to leave comments.
Login now