1
# Copyright (C) 2005-2011, 2016 Canonical Ltd
3
# This program is free software; you can redistribute it and/or modify
4
# it under the terms of the GNU General Public License as published by
5
# the Free Software Foundation; either version 2 of the License, or
6
# (at your option) any later version.
8
# This program is distributed in the hope that it will be useful,
9
# but WITHOUT ANY WARRANTY; without even the implied warranty of
10
# MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
11
# GNU General Public License for more details.
13
# You should have received a copy of the GNU General Public License
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
24
from breezy.revision import NULL_REVISION
25
from breezy.tests import TestCase, TestCaseWithTransport
26
from breezy.tests.matchers import MatchesAncestry
28
# We're allowed to test deprecated interfaces
29
warnings.filterwarnings('ignore',
30
'.*get_intervening_revisions was deprecated',
32
r'breezy\.tests\.test_revision')
34
# XXX: Make this a method of a merge base case
35
def make_branches(self, format=None):
36
"""Create two branches
38
branch 1 has 6 commits, branch 2 has 3 commits
39
commit 10 is a ghosted merge merge from branch 1
51
so A is missing b6 at the start
52
and B is missing a3, a4, a5
54
tree1 = self.make_branch_and_tree("branch1", format=format)
57
tree1.commit("Commit one", rev_id="a@u-0-0")
58
tree1.commit("Commit two", rev_id="a@u-0-1")
59
tree1.commit("Commit three", rev_id="a@u-0-2")
61
tree2 = tree1.controldir.sprout("branch2").open_workingtree()
63
tree2.commit("Commit four", rev_id="b@u-0-3")
64
tree2.commit("Commit five", rev_id="b@u-0-4")
65
self.assertEqual(br2.last_revision(), 'b@u-0-4')
67
tree1.merge_from_branch(br2)
68
tree1.commit("Commit six", rev_id="a@u-0-3")
69
tree1.commit("Commit seven", rev_id="a@u-0-4")
70
tree2.commit("Commit eight", rev_id="b@u-0-5")
71
self.assertEqual(br2.last_revision(), 'b@u-0-5')
73
tree1.merge_from_branch(br2)
74
tree1.commit("Commit nine", rev_id="a@u-0-5")
75
# DO NOT MERGE HERE - we WANT a GHOST.
78
graph = br1.repository.get_graph()
79
revhistory = list(graph.iter_lefthand_ancestry(br1.last_revision(),
80
[revision.NULL_REVISION]))
84
tree2.add_parent_tree_id(revhistory[4])
85
tree2.commit("Commit ten - ghost merge", rev_id="b@u-0-6")
90
class TestIsAncestor(TestCaseWithTransport):
92
def test_recorded_ancestry(self):
93
"""Test that commit records all ancestors"""
94
br1, br2 = make_branches(self)
95
d = [('a@u-0-0', ['a@u-0-0']),
96
('a@u-0-1', ['a@u-0-0', 'a@u-0-1']),
97
('a@u-0-2', ['a@u-0-0', 'a@u-0-1', 'a@u-0-2']),
98
('b@u-0-3', ['a@u-0-0', 'a@u-0-1', 'a@u-0-2', 'b@u-0-3']),
99
('b@u-0-4', ['a@u-0-0', 'a@u-0-1', 'a@u-0-2', 'b@u-0-3',
101
('a@u-0-3', ['a@u-0-0', 'a@u-0-1', 'a@u-0-2', 'b@u-0-3', 'b@u-0-4',
103
('a@u-0-4', ['a@u-0-0', 'a@u-0-1', 'a@u-0-2', 'b@u-0-3', 'b@u-0-4',
104
'a@u-0-3', 'a@u-0-4']),
105
('b@u-0-5', ['a@u-0-0', 'a@u-0-1', 'a@u-0-2', 'b@u-0-3', 'b@u-0-4',
107
('a@u-0-5', ['a@u-0-0', 'a@u-0-1', 'a@u-0-2', 'a@u-0-3', 'a@u-0-4',
108
'b@u-0-3', 'b@u-0-4',
109
'b@u-0-5', 'a@u-0-5']),
110
('b@u-0-6', ['a@u-0-0', 'a@u-0-1', 'a@u-0-2', 'a@u-0-4',
111
'b@u-0-3', 'b@u-0-4',
112
'b@u-0-5', 'b@u-0-6']),
114
br1_only = ('a@u-0-3', 'a@u-0-4', 'a@u-0-5')
115
br2_only = ('b@u-0-6',)
116
for branch in br1, br2:
117
for rev_id, anc in d:
118
if rev_id in br1_only and not branch is br1:
120
if rev_id in br2_only and not branch is br2:
123
MatchesAncestry(branch.repository, rev_id))
126
class TestIntermediateRevisions(TestCaseWithTransport):
129
TestCaseWithTransport.setUp(self)
130
self.br1, self.br2 = make_branches(self)
131
wt1 = self.br1.controldir.open_workingtree()
132
wt2 = self.br2.controldir.open_workingtree()
133
wt2.commit("Commit eleven", rev_id="b@u-0-7")
134
wt2.commit("Commit twelve", rev_id="b@u-0-8")
135
wt2.commit("Commit thirtteen", rev_id="b@u-0-9")
137
wt1.merge_from_branch(self.br2)
138
wt1.commit("Commit fourtten", rev_id="a@u-0-6")
140
wt2.merge_from_branch(self.br1)
141
wt2.commit("Commit fifteen", rev_id="b@u-0-10")
144
class MockRevisionSource(object):
145
"""A RevisionSource that takes a pregenerated graph.
147
This is useful for testing revision graph algorithms where
148
the actual branch existing is irrelevant.
151
def __init__(self, full_graph):
152
self._full_graph = full_graph
154
def get_revision_graph_with_ghosts(self, revision_ids):
155
# This is mocked out to just return a constant graph.
156
return self._full_graph
159
class TestCommonAncestor(TestCaseWithTransport):
160
"""Test checking whether a revision is an ancestor of another revision"""
162
def test_get_history(self):
163
# TODO: test ghosts on the left hand branch's impact
164
# TODO: test ghosts on all parents, we should get some
165
# indicator. i.e. NULL_REVISION
167
tree = self.make_branch_and_tree('.')
168
tree.commit('1', rev_id = '1', allow_pointless=True)
169
tree.commit('2', rev_id = '2', allow_pointless=True)
170
tree.commit('3', rev_id = '3', allow_pointless=True)
171
rev = tree.branch.repository.get_revision('1')
172
history = rev.get_history(tree.branch.repository)
173
self.assertEqual([None, '1'], history)
174
rev = tree.branch.repository.get_revision('2')
175
history = rev.get_history(tree.branch.repository)
176
self.assertEqual([None, '1', '2'], history)
177
rev = tree.branch.repository.get_revision('3')
178
history = rev.get_history(tree.branch.repository)
179
self.assertEqual([None, '1', '2', '3'], history)
182
class TestReservedId(TestCase):
184
def test_is_reserved_id(self):
185
self.assertEqual(True, revision.is_reserved_id(NULL_REVISION))
186
self.assertEqual(True, revision.is_reserved_id(
187
revision.CURRENT_REVISION))
188
self.assertEqual(True, revision.is_reserved_id('arch:'))
189
self.assertEqual(False, revision.is_reserved_id('null'))
190
self.assertEqual(False, revision.is_reserved_id(
191
'arch:a@example.com/c--b--v--r'))
192
self.assertEqual(False, revision.is_reserved_id(None))
195
class TestRevisionMethods(TestCase):
197
def test_get_summary(self):
198
r = revision.Revision('1')
200
self.assertEqual('a', r.get_summary())
202
self.assertEqual('a', r.get_summary())
204
self.assertEqual('a', r.get_summary())
206
self.assertEqual('', r.get_summary())
208
def test_get_apparent_authors(self):
209
r = revision.Revision('1')
211
self.assertEqual(['A'], r.get_apparent_authors())
212
r.properties['author'] = 'B'
213
self.assertEqual(['B'], r.get_apparent_authors())
214
r.properties['authors'] = 'C\nD'
215
self.assertEqual(['C', 'D'], r.get_apparent_authors())
217
def test_get_apparent_authors_no_committer(self):
218
r = revision.Revision('1')
219
self.assertEqual([], r.get_apparent_authors())
222
class TestRevisionBugs(TestCase):
223
"""Tests for getting the bugs that a revision is linked to."""
225
def test_no_bugs(self):
226
r = revision.Revision('1')
227
self.assertEqual([], list(r.iter_bugs()))
229
def test_some_bugs(self):
230
r = revision.Revision(
232
'bugs': bugtracker.encode_fixes_bug_urls(
233
['http://example.com/bugs/1',
234
'http://launchpad.net/bugs/1234'])})
236
[('http://example.com/bugs/1', bugtracker.FIXED),
237
('http://launchpad.net/bugs/1234', bugtracker.FIXED)],
240
def test_no_status(self):
241
r = revision.Revision(
242
'1', properties={'bugs': 'http://example.com/bugs/1'})
243
self.assertRaises(bugtracker.InvalidLineInBugsProperty, list,
246
def test_too_much_information(self):
247
r = revision.Revision(
248
'1', properties={'bugs': 'http://example.com/bugs/1 fixed bar'})
249
self.assertRaises(bugtracker.InvalidLineInBugsProperty, list,
252
def test_invalid_status(self):
253
r = revision.Revision(
254
'1', properties={'bugs': 'http://example.com/bugs/1 faxed'})
255
self.assertRaises(bugtracker.InvalidBugStatus, list, r.iter_bugs())