13
13
# You should have received a copy of the GNU General Public License
14
14
# along with this program; if not, write to the Free Software
15
# Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
15
# Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
17
17
"""Display what revisions are missing in 'other' from 'this' and vice versa."""
37
37
revno, rev_id, merge_depth = rev
38
38
rev = revision_source.get_revision(rev_id)
40
delta = revision_source.get_revision_delta(rev_id)
40
remote_tree = revision_source.revision_tree(rev_id)
41
parent_rev_id = rev.parent_ids[0]
42
if last_rev_id == parent_rev_id:
43
parent_tree = last_tree
45
parent_tree = revision_source.revision_tree(parent_rev_id)
46
revision_tree = revision_source.revision_tree(rev_id)
48
last_tree = revision_tree
49
delta = revision_tree.changes_from(parent_tree)
43
52
yield log.LogRevision(rev, revno, merge_depth, delta=delta)
90
99
:param tip_revno: The revision number for the tip revision
91
100
:param tip: The tip of mainline
92
101
:param backward: Show oldest versions first when True, newest versions
94
103
:return: [(revno, revision_id)] for all revisions in ancestry that
95
104
are left-hand parents from tip, or None if ancestry is None.
129
138
:param tip_revno: The revision number for the tip revision
130
139
:param tip: The tip of the ancsetry
131
140
:param backward: Show oldest versions first when True, newest versions
133
142
:return: [(revno, revision_id)] for all revisions in ancestry that
134
143
are parents from tip, or None if ancestry is None.
138
147
if not ancestry: #Empty ancestry, no need to do any work
141
merge_sorted_revisions = branch.iter_merge_sorted_revisions()
150
mainline_revs, rev_nos, start_rev_id, end_rev_id = log._get_mainline_revs(
151
branch, None, tip_revno)
152
if not mainline_revs:
155
# This asks for all mainline revisions, which is size-of-history and
156
# should be addressed (but currently the only way to get correct
159
# mainline_revisions always includes an extra revision at the
160
# beginning, so don't request it.
161
parent_map = dict(((key, value) for key, value
162
in graph.iter_ancestry(mainline_revs[1:])
163
if value is not None))
164
# filter out ghosts; merge_sort errors on ghosts.
165
# XXX: is this needed here ? -- vila080910
166
rev_graph = _mod_repository._strip_NULL_ghosts(parent_map)
167
# XXX: what if rev_graph is empty now ? -- vila080910
168
merge_sorted_revisions = tsort.merge_sort(rev_graph, tip,
142
171
# Now that we got the correct revnos, keep only the relevant
144
173
merge_sorted_revisions = [
145
# log.reverse_by_depth expects seq_num to be present, but it is
146
# stripped by iter_merge_sorted_revisions()
147
(0, revid, n, d, e) for revid, n, d, e in merge_sorted_revisions
174
(s, revid, n, d, e) for s, revid, n, d, e in merge_sorted_revisions
148
175
if revid in ancestry]
150
177
merge_sorted_revisions = log.reverse_by_depth(merge_sorted_revisions)