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
37
def make_branches(self, format=None):
38
"""Create two branches
40
branch 1 has 6 commits, branch 2 has 3 commits
41
commit 10 is a ghosted merge merge from branch 1
53
so A is missing b6 at the start
54
and B is missing a3, a4, a5
56
tree1 = self.make_branch_and_tree("branch1", format=format)
59
tree1.commit("Commit one", rev_id=b"a@u-0-0")
60
tree1.commit("Commit two", rev_id=b"a@u-0-1")
61
tree1.commit("Commit three", rev_id=b"a@u-0-2")
63
tree2 = tree1.controldir.sprout("branch2").open_workingtree()
65
tree2.commit("Commit four", rev_id=b"b@u-0-3")
66
tree2.commit("Commit five", rev_id=b"b@u-0-4")
67
self.assertEqual(br2.last_revision(), b'b@u-0-4')
69
tree1.merge_from_branch(br2)
70
tree1.commit("Commit six", rev_id=b"a@u-0-3")
71
tree1.commit("Commit seven", rev_id=b"a@u-0-4")
72
tree2.commit("Commit eight", rev_id=b"b@u-0-5")
73
self.assertEqual(br2.last_revision(), b'b@u-0-5')
75
tree1.merge_from_branch(br2)
76
tree1.commit("Commit nine", rev_id=b"a@u-0-5")
77
# DO NOT MERGE HERE - we WANT a GHOST.
80
graph = br1.repository.get_graph()
81
revhistory = list(graph.iter_lefthand_ancestry(br1.last_revision(),
82
[revision.NULL_REVISION]))
86
tree2.add_parent_tree_id(revhistory[4])
87
tree2.commit("Commit ten - ghost merge", rev_id=b"b@u-0-6")
92
class TestIsAncestor(TestCaseWithTransport):
94
def test_recorded_ancestry(self):
95
"""Test that commit records all ancestors"""
96
br1, br2 = make_branches(self)
97
d = [(b'a@u-0-0', [b'a@u-0-0']),
98
(b'a@u-0-1', [b'a@u-0-0', b'a@u-0-1']),
99
(b'a@u-0-2', [b'a@u-0-0', b'a@u-0-1', b'a@u-0-2']),
100
(b'b@u-0-3', [b'a@u-0-0', b'a@u-0-1', b'a@u-0-2', b'b@u-0-3']),
101
(b'b@u-0-4', [b'a@u-0-0', b'a@u-0-1', b'a@u-0-2', b'b@u-0-3',
103
(b'a@u-0-3', [b'a@u-0-0', b'a@u-0-1', b'a@u-0-2', b'b@u-0-3', b'b@u-0-4',
105
(b'a@u-0-4', [b'a@u-0-0', b'a@u-0-1', b'a@u-0-2', b'b@u-0-3', b'b@u-0-4',
106
b'a@u-0-3', b'a@u-0-4']),
107
(b'b@u-0-5', [b'a@u-0-0', b'a@u-0-1', b'a@u-0-2', b'b@u-0-3', b'b@u-0-4',
109
(b'a@u-0-5', [b'a@u-0-0', b'a@u-0-1', b'a@u-0-2', b'a@u-0-3', b'a@u-0-4',
110
b'b@u-0-3', b'b@u-0-4',
111
b'b@u-0-5', b'a@u-0-5']),
112
(b'b@u-0-6', [b'a@u-0-0', b'a@u-0-1', b'a@u-0-2', b'a@u-0-4',
113
b'b@u-0-3', b'b@u-0-4',
114
b'b@u-0-5', b'b@u-0-6']),
116
br1_only = (b'a@u-0-3', b'a@u-0-4', b'a@u-0-5')
117
br2_only = (b'b@u-0-6',)
118
for branch in br1, br2:
119
for rev_id, anc in d:
120
if rev_id in br1_only and branch is not br1:
122
if rev_id in br2_only and branch is not br2:
125
MatchesAncestry(branch.repository, rev_id))
128
class TestIntermediateRevisions(TestCaseWithTransport):
131
TestCaseWithTransport.setUp(self)
132
self.br1, self.br2 = make_branches(self)
133
wt1 = self.br1.controldir.open_workingtree()
134
wt2 = self.br2.controldir.open_workingtree()
135
wt2.commit("Commit eleven", rev_id=b"b@u-0-7")
136
wt2.commit("Commit twelve", rev_id=b"b@u-0-8")
137
wt2.commit("Commit thirtteen", rev_id=b"b@u-0-9")
139
wt1.merge_from_branch(self.br2)
140
wt1.commit("Commit fourtten", rev_id=b"a@u-0-6")
142
wt2.merge_from_branch(self.br1)
143
wt2.commit("Commit fifteen", rev_id=b"b@u-0-10")
146
class MockRevisionSource(object):
147
"""A RevisionSource that takes a pregenerated graph.
149
This is useful for testing revision graph algorithms where
150
the actual branch existing is irrelevant.
153
def __init__(self, full_graph):
154
self._full_graph = full_graph
156
def get_revision_graph_with_ghosts(self, revision_ids):
157
# This is mocked out to just return a constant graph.
158
return self._full_graph
161
class TestCommonAncestor(TestCaseWithTransport):
162
"""Test checking whether a revision is an ancestor of another revision"""
164
def test_get_history(self):
165
# TODO: test ghosts on the left hand branch's impact
166
# TODO: test ghosts on all parents, we should get some
167
# indicator. i.e. NULL_REVISION
169
tree = self.make_branch_and_tree('.')
170
tree.commit('1', rev_id=b'1', allow_pointless=True)
171
tree.commit('2', rev_id=b'2', allow_pointless=True)
172
tree.commit('3', rev_id=b'3', allow_pointless=True)
173
rev = tree.branch.repository.get_revision(b'1')
174
history = rev.get_history(tree.branch.repository)
175
self.assertEqual([None, b'1'], history)
176
rev = tree.branch.repository.get_revision(b'2')
177
history = rev.get_history(tree.branch.repository)
178
self.assertEqual([None, b'1', b'2'], history)
179
rev = tree.branch.repository.get_revision(b'3')
180
history = rev.get_history(tree.branch.repository)
181
self.assertEqual([None, b'1', b'2', b'3'], history)
184
class TestReservedId(TestCase):
186
def test_is_reserved_id(self):
187
self.assertEqual(True, revision.is_reserved_id(NULL_REVISION))
188
self.assertEqual(True, revision.is_reserved_id(
189
revision.CURRENT_REVISION))
190
self.assertEqual(True, revision.is_reserved_id(b'arch:'))
191
self.assertEqual(False, revision.is_reserved_id(b'null'))
192
self.assertEqual(False, revision.is_reserved_id(
193
b'arch:a@example.com/c--b--v--r'))
194
self.assertEqual(False, revision.is_reserved_id(None))
197
class TestRevisionMethods(TestCase):
199
def test_get_summary(self):
200
r = revision.Revision('1')
202
self.assertEqual('a', r.get_summary())
204
self.assertEqual('a', r.get_summary())
206
self.assertEqual('a', r.get_summary())
208
self.assertEqual('', r.get_summary())
210
def test_get_apparent_authors(self):
211
r = revision.Revision('1')
213
self.assertEqual(['A'], r.get_apparent_authors())
214
r.properties[u'author'] = 'B'
215
self.assertEqual(['B'], r.get_apparent_authors())
216
r.properties[u'authors'] = 'C\nD'
217
self.assertEqual(['C', 'D'], r.get_apparent_authors())
219
def test_get_apparent_authors_no_committer(self):
220
r = revision.Revision('1')
221
self.assertEqual([], r.get_apparent_authors())
224
class TestRevisionBugs(TestCase):
225
"""Tests for getting the bugs that a revision is linked to."""
227
def test_no_bugs(self):
228
r = revision.Revision('1')
229
self.assertEqual([], list(r.iter_bugs()))
231
def test_some_bugs(self):
232
r = revision.Revision(
234
u'bugs': bugtracker.encode_fixes_bug_urls(
235
[('http://example.com/bugs/1', 'fixed'),
236
('http://launchpad.net/bugs/1234', 'fixed')])})
238
[('http://example.com/bugs/1', bugtracker.FIXED),
239
('http://launchpad.net/bugs/1234', bugtracker.FIXED)],
242
def test_no_status(self):
243
r = revision.Revision(
244
'1', properties={u'bugs': 'http://example.com/bugs/1'})
245
self.assertRaises(bugtracker.InvalidLineInBugsProperty, list,
248
def test_too_much_information(self):
249
r = revision.Revision(
250
'1', properties={u'bugs': 'http://example.com/bugs/1 fixed bar'})
251
self.assertRaises(bugtracker.InvalidLineInBugsProperty, list,
254
def test_invalid_status(self):
255
r = revision.Revision(
256
'1', properties={u'bugs': 'http://example.com/bugs/1 faxed'})
257
self.assertRaises(bugtracker.InvalidBugStatus, list, r.iter_bugs())