← Back to branch summary

~bzr-pqm/bzr/bzr.dev

« back to all changes in this revision

Viewing changes to bzrlib/tests/test_revision.py

  • Committer: Robert Collins
  • Date: 2006-07-20 13:00:31 UTC
  • mto: (1852.9.1 Tree.compare().)
  • mto: This revision was merged to the branch mainline in revision 1890.
  • Revision ID: robertc@robertcollins.net-20060720130031-d26103a427ea10f3
Start tree implementation tests.

Show diffs side-by-side

added added

removed removed

Lines of Context:
bzrlib/tests/test_revision.py
1
 
# Copyright (C) 2005 Canonical Ltd
2
 
#
 
1
# (C) 2005 Canonical Ltd
 
2
 
3
3
# This program is free software; you can redistribute it and/or modify
4
4
# it under the terms of the GNU General Public License as published by
5
5
# the Free Software Foundation; either version 2 of the License, or
6
6
# (at your option) any later version.
7
 
#
 
7
 
8
8
# This program is distributed in the hope that it will be useful,
9
9
# but WITHOUT ANY WARRANTY; without even the implied warranty of
10
10
# MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
11
11
# GNU General Public License for more details.
12
 
#
 
12
 
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
16
16
 
17
17
 
18
18
import os
19
19
import warnings
20
20
 
21
 
from bzrlib import (
22
 
    bugtracker,
23
 
    revision,
24
 
    symbol_versioning,
25
 
    )
26
21
from bzrlib.branch import Branch
27
 
from bzrlib.errors import (
28
 
    InvalidBugStatus,
29
 
    InvalidLineInBugsProperty,
30
 
    NoSuchRevision,
31
 
    )
32
 
from bzrlib.deprecated_graph import Graph
33
 
from bzrlib.revision import (find_present_ancestors,
 
22
from bzrlib.errors import NoSuchRevision
 
23
from bzrlib.graph import Graph
 
24
from bzrlib.revision import (find_present_ancestors, combined_graph,
 
25
                             common_ancestor,
 
26
                             is_ancestor, MultipleRevisionSources,
34
27
                             NULL_REVISION)
35
 
from bzrlib.tests import TestCase, TestCaseWithTransport
 
28
from bzrlib.tests import TestCaseWithTransport
36
29
from bzrlib.trace import mutter
37
30
from bzrlib.workingtree import WorkingTree
38
31
 
43
36
        r'bzrlib\.tests\.test_revision')
44
37
 
45
38
# XXX: Make this a method of a merge base case
46
 
def make_branches(self, format=None):
 
39
def make_branches(self):
47
40
    """Create two branches
48
41
 
49
42
    branch 1 has 6 commits, branch 2 has 3 commits
51
44
 
52
45
    the object graph is
53
46
    B:     A:
54
 
    a..0   a..0
 
47
    a..0   a..0 
55
48
    a..1   a..1
56
49
    a..2   a..2
57
50
    b..3   a..3 merges b..4
62
55
    so A is missing b6 at the start
63
56
    and B is missing a3, a4, a5
64
57
    """
65
 
    tree1 = self.make_branch_and_tree("branch1", format=format)
 
58
    tree1 = self.make_branch_and_tree("branch1")
66
59
    br1 = tree1.branch
67
 
 
 
60
    
68
61
    tree1.commit("Commit one", rev_id="a@u-0-0")
69
62
    tree1.commit("Commit two", rev_id="a@u-0-1")
70
63
    tree1.commit("Commit three", rev_id="a@u-0-2")
71
64
 
72
 
    tree2 = tree1.bzrdir.sprout("branch2").open_workingtree()
 
65
    tree2 = tree1.bzrdir.clone("branch2").open_workingtree()
73
66
    br2 = tree2.branch
74
67
    tree2.commit("Commit four", rev_id="b@u-0-3")
75
68
    tree2.commit("Commit five", rev_id="b@u-0-4")
76
69
    revisions_2 = br2.revision_history()
77
 
    self.assertEquals(revisions_2[-1], 'b@u-0-4')
78
 
 
79
 
    tree1.merge_from_branch(br2)
 
70
    
 
71
    br1.fetch(br2)
 
72
    tree1.add_pending_merge(revisions_2[4])
 
73
    self.assertEquals(revisions_2[4], 'b@u-0-4')
80
74
    tree1.commit("Commit six", rev_id="a@u-0-3")
81
75
    tree1.commit("Commit seven", rev_id="a@u-0-4")
82
76
    tree2.commit("Commit eight", rev_id="b@u-0-5")
83
 
    self.assertEquals(br2.revision_history()[-1], 'b@u-0-5')
84
 
 
85
 
    tree1.merge_from_branch(br2)
 
77
    
 
78
    br1.fetch(br2)
 
79
    tree1.add_pending_merge(br2.revision_history()[5])
86
80
    tree1.commit("Commit nine", rev_id="a@u-0-5")
87
 
    # DO NOT MERGE HERE - we WANT a GHOST.
88
 
    tree2.add_parent_tree_id(br1.revision_history()[4])
 
81
    # DO NOT FETCH HERE - we WANT a GHOST.
 
82
    # br2.fetch(br1)
 
83
    tree2.add_pending_merge(br1.revision_history()[4])
89
84
    tree2.commit("Commit ten - ghost merge", rev_id="b@u-0-6")
90
 
 
 
85
    
91
86
    return br1, br2
92
87
 
93
88
 
127
122
                       rev_id, branch.repository.get_ancestry(rev_id))
128
123
                result = sorted(branch.repository.get_ancestry(rev_id))
129
124
                self.assertEquals(result, [None] + sorted(anc))
 
125
    
 
126
    
 
127
    def test_is_ancestor(self):
 
128
        """Test checking whether a revision is an ancestor of another revision"""
 
129
        br1, br2 = make_branches(self)
 
130
        revisions = br1.revision_history()
 
131
        revisions_2 = br2.revision_history()
 
132
        sources = br1
 
133
 
 
134
        self.assert_(is_ancestor(revisions[0], revisions[0], br1))
 
135
        self.assert_(is_ancestor(revisions[1], revisions[0], sources))
 
136
        self.assert_(not is_ancestor(revisions[0], revisions[1], sources))
 
137
        self.assert_(is_ancestor(revisions_2[3], revisions[0], sources))
 
138
        # disabled mbp 20050914, doesn't seem to happen anymore
 
139
        ## self.assertRaises(NoSuchRevision, is_ancestor, revisions_2[3],
 
140
        ##                  revisions[0], br1)        
 
141
        self.assert_(is_ancestor(revisions[3], revisions_2[4], sources))
 
142
        self.assert_(is_ancestor(revisions[3], revisions_2[4], br1))
 
143
        self.assert_(is_ancestor(revisions[3], revisions_2[3], sources))
 
144
        ## self.assert_(not is_ancestor(revisions[3], revisions_2[3], br1))
130
145
 
131
146
 
132
147
class TestIntermediateRevisions(TestCaseWithTransport):
140
155
        wt2.commit("Commit twelve", rev_id="b@u-0-8")
141
156
        wt2.commit("Commit thirtteen", rev_id="b@u-0-9")
142
157
 
143
 
        wt1.merge_from_branch(self.br2)
 
158
        self.br1.fetch(self.br2)
 
159
        wt1.add_pending_merge(self.br2.revision_history()[6])
144
160
        wt1.commit("Commit fourtten", rev_id="a@u-0-6")
145
161
 
146
 
        wt2.merge_from_branch(self.br1)
 
162
        self.br2.fetch(self.br1)
 
163
        wt2.add_pending_merge(self.br1.revision_history()[6])
147
164
        wt2.commit("Commit fifteen", rev_id="b@u-0-10")
148
165
 
 
166
        from bzrlib.revision import MultipleRevisionSources
 
167
        self.sources = MultipleRevisionSources(self.br1.repository,
 
168
                                               self.br2.repository)
 
169
 
 
170
 
149
171
 
150
172
class MockRevisionSource(object):
151
173
    """A RevisionSource that takes a pregenerated graph.
165
187
class TestCommonAncestor(TestCaseWithTransport):
166
188
    """Test checking whether a revision is an ancestor of another revision"""
167
189
 
 
190
    def test_common_ancestor(self):
 
191
        """Pick a reasonable merge base"""
 
192
        br1, br2 = make_branches(self)
 
193
        revisions = br1.revision_history()
 
194
        revisions_2 = br2.revision_history()
 
195
        sources = MultipleRevisionSources(br1.repository, br2.repository)
 
196
        expected_ancestors_list = {revisions[3]:(0, 0), 
 
197
                                   revisions[2]:(1, 1),
 
198
                                   revisions_2[4]:(2, 1), 
 
199
                                   revisions[1]:(3, 2),
 
200
                                   revisions_2[3]:(4, 2),
 
201
                                   revisions[0]:(5, 3) }
 
202
        ancestors_list = find_present_ancestors(revisions[3], sources)
 
203
        self.assertEquals(len(expected_ancestors_list), len(ancestors_list))
 
204
        for key, value in expected_ancestors_list.iteritems():
 
205
            self.assertEqual(ancestors_list[key], value, 
 
206
                              "key %r, %r != %r" % (key, ancestors_list[key],
 
207
                                                    value))
 
208
        self.assertEqual(common_ancestor(revisions[0], revisions[0], sources),
 
209
                          revisions[0])
 
210
        self.assertEqual(common_ancestor(revisions[1], revisions[2], sources),
 
211
                          revisions[1])
 
212
        self.assertEqual(common_ancestor(revisions[1], revisions[1], sources),
 
213
                          revisions[1])
 
214
        self.assertEqual(common_ancestor(revisions[2], revisions_2[4], sources),
 
215
                          revisions[2])
 
216
        self.assertEqual(common_ancestor(revisions[3], revisions_2[4], sources),
 
217
                          revisions_2[4])
 
218
        self.assertEqual(common_ancestor(revisions[4], revisions_2[5], sources),
 
219
                          revisions_2[4])
 
220
        self.assertTrue(common_ancestor(revisions[5], revisions_2[6], sources) in
 
221
                        (revisions[4], revisions_2[5]))
 
222
        self.assertTrue(common_ancestor(revisions_2[6], revisions[5], sources),
 
223
                        (revisions[4], revisions_2[5]))
 
224
        self.assertEqual(None, common_ancestor(None, revisions[5], sources))
 
225
        self.assertEqual(NULL_REVISION,
 
226
            common_ancestor(NULL_REVISION, NULL_REVISION, sources))
 
227
        self.assertEqual(NULL_REVISION,
 
228
            common_ancestor(revisions[0], NULL_REVISION, sources))
 
229
        self.assertEqual(NULL_REVISION,
 
230
            common_ancestor(NULL_REVISION, revisions[0], sources))
 
231
 
 
232
    def test_combined(self):
 
233
        """combined_graph
 
234
        Ensure it's not order-sensitive
 
235
        """
 
236
        br1, br2 = make_branches(self)
 
237
        source = MultipleRevisionSources(br1.repository, br2.repository)
 
238
        combined_1 = combined_graph(br1.last_revision(), 
 
239
                                    br2.last_revision(), source)
 
240
        combined_2 = combined_graph(br2.last_revision(),
 
241
                                    br1.last_revision(), source)
 
242
        self.assertEquals(combined_1[1], combined_2[1])
 
243
        self.assertEquals(combined_1[2], combined_2[2])
 
244
        self.assertEquals(combined_1[3], combined_2[3])
 
245
        self.assertEquals(combined_1, combined_2)
 
246
 
168
247
    def test_get_history(self):
169
248
        # TODO: test ghosts on the left hand branch's impact
170
249
        # TODO: test ghosts on all parents, we should get some
184
263
        history = rev.get_history(tree.branch.repository)
185
264
        self.assertEqual([None, '1', '2' ,'3'], history)
186
265
 
187
 
 
188
 
class TestReservedId(TestCase):
189
 
 
190
 
    def test_is_reserved_id(self):
191
 
        self.assertEqual(True, revision.is_reserved_id(NULL_REVISION))
192
 
        self.assertEqual(True, revision.is_reserved_id(
193
 
            revision.CURRENT_REVISION))
194
 
        self.assertEqual(True, revision.is_reserved_id('arch:'))
195
 
        self.assertEqual(False, revision.is_reserved_id('null'))
196
 
        self.assertEqual(False, revision.is_reserved_id(
197
 
            'arch:a@example.com/c--b--v--r'))
198
 
        self.assertEqual(False, revision.is_reserved_id(None))
199
 
 
200
 
 
201
 
class TestRevisionMethods(TestCase):
202
 
 
203
 
    def test_get_summary(self):
204
 
        r = revision.Revision('1')
205
 
        r.message = 'a'
206
 
        self.assertEqual('a', r.get_summary())
207
 
        r.message = 'a\nb'
208
 
        self.assertEqual('a', r.get_summary())
209
 
        r.message = '\na\nb'
210
 
        self.assertEqual('a', r.get_summary())
211
 
        r.message = None
212
 
        self.assertEqual('', r.get_summary())
213
 
 
214
 
    def test_get_apparent_author(self):
215
 
        r = revision.Revision('1')
216
 
        r.committer = 'A'
217
 
        author = self.applyDeprecated(
218
 
                symbol_versioning.deprecated_in((1, 13, 0)),
219
 
                r.get_apparent_author)
220
 
        self.assertEqual('A', author)
221
 
        r.properties['author'] = 'B'
222
 
        author = self.applyDeprecated(
223
 
                symbol_versioning.deprecated_in((1, 13, 0)),
224
 
                r.get_apparent_author)
225
 
        self.assertEqual('B', author)
226
 
        r.properties['authors'] = 'C\nD'
227
 
        author = self.applyDeprecated(
228
 
                symbol_versioning.deprecated_in((1, 13, 0)),
229
 
                r.get_apparent_author)
230
 
        self.assertEqual('C', author)
231
 
 
232
 
    def test_get_apparent_author_none(self):
233
 
        r = revision.Revision('1')
234
 
        author = self.applyDeprecated(
235
 
                symbol_versioning.deprecated_in((1, 13, 0)),
236
 
                r.get_apparent_author)
237
 
        self.assertEqual(None, author)
238
 
 
239
 
    def test_get_apparent_authors(self):
240
 
        r = revision.Revision('1')
241
 
        r.committer = 'A'
242
 
        self.assertEqual(['A'], r.get_apparent_authors())
243
 
        r.properties['author'] = 'B'
244
 
        self.assertEqual(['B'], r.get_apparent_authors())
245
 
        r.properties['authors'] = 'C\nD'
246
 
        self.assertEqual(['C', 'D'], r.get_apparent_authors())
247
 
 
248
 
    def test_get_apparent_authors_no_committer(self):
249
 
        r = revision.Revision('1')
250
 
        self.assertEqual([], r.get_apparent_authors())
251
 
 
252
 
 
253
 
class TestRevisionBugs(TestCase):
254
 
    """Tests for getting the bugs that a revision is linked to."""
255
 
 
256
 
    def test_no_bugs(self):
257
 
        r = revision.Revision('1')
258
 
        self.assertEqual([], list(r.iter_bugs()))
259
 
 
260
 
    def test_some_bugs(self):
261
 
        r = revision.Revision(
262
 
            '1', properties={
263
 
                'bugs': bugtracker.encode_fixes_bug_urls(
264
 
                    ['http://example.com/bugs/1',
265
 
                     'http://launchpad.net/bugs/1234'])})
266
 
        self.assertEqual(
267
 
            [('http://example.com/bugs/1', bugtracker.FIXED),
268
 
             ('http://launchpad.net/bugs/1234', bugtracker.FIXED)],
269
 
            list(r.iter_bugs()))
270
 
 
271
 
    def test_no_status(self):
272
 
        r = revision.Revision(
273
 
            '1', properties={'bugs': 'http://example.com/bugs/1'})
274
 
        self.assertRaises(InvalidLineInBugsProperty, list, r.iter_bugs())
275
 
 
276
 
    def test_too_much_information(self):
277
 
        r = revision.Revision(
278
 
            '1', properties={'bugs': 'http://example.com/bugs/1 fixed bar'})
279
 
        self.assertRaises(InvalidLineInBugsProperty, list, r.iter_bugs())
280
 
 
281
 
    def test_invalid_status(self):
282
 
        r = revision.Revision(
283
 
            '1', properties={'bugs': 'http://example.com/bugs/1 faxed'})
284
 
        self.assertRaises(InvalidBugStatus, list, r.iter_bugs())
 
266
    def test_common_ancestor_rootless_graph(self):
 
267
        # common_ancestor on a graph with no reachable roots - only
 
268
        # ghosts - should still return a useful value.
 
269
        graph = Graph()
 
270
        # add a ghost node which would be a root if it wasn't a ghost.
 
271
        graph.add_ghost('a_ghost')
 
272
        # add a normal commit on top of that
 
273
        graph.add_node('rev1', ['a_ghost'])
 
274
        # add a left-branch revision
 
275
        graph.add_node('left', ['rev1'])
 
276
        # add a right-branch revision
 
277
        graph.add_node('right', ['rev1'])
 
278
        source = MockRevisionSource(graph)
 
279
        self.assertEqual('rev1', common_ancestor('left', 'right', source))
 
280
 
 
281
 
 
282
class TestMultipleRevisionSources(TestCaseWithTransport):
 
283
    """Tests for the MultipleRevisionSources adapter."""
 
284
 
 
285
    def test_get_revision_graph_merges_ghosts(self):
 
286
        # when we ask for the revision graph for B, which
 
287
        # is in repo 1 with a ghost of A, and which is not
 
288
        # in repo 2, which has A, the revision_graph()
 
289
        # should return A and B both.
 
290
        tree_1 = self.make_branch_and_tree('1')
 
291
        tree_1.add_pending_merge('A')
 
292
        tree_1.commit('foo', rev_id='B', allow_pointless=True)
 
293
        tree_2 = self.make_branch_and_tree('2')
 
294
        tree_2.commit('bar', rev_id='A', allow_pointless=True)
 
295
        source = MultipleRevisionSources(tree_1.branch.repository,
 
296
                                         tree_2.branch.repository)
 
297
        self.assertEqual({'B':['A'],
 
298
                          'A':[]},
 
299
                         source.get_revision_graph('B'))