1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
|
# Copyright (C) 2006, 2007 Canonical Ltd
#
# This program is free software; you can redistribute it and/or modify
# it under the terms of the GNU General Public License as published by
# the Free Software Foundation; either version 2 of the License, or
# (at your option) any later version.
#
# This program is distributed in the hope that it will be useful,
# but WITHOUT ANY WARRANTY; without even the implied warranty of
# MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
# GNU General Public License for more details.
#
# You should have received a copy of the GNU General Public License
# along with this program; if not, write to the Free Software
# Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
from bzrlib import (
errors,
tests,
conflicts,
)
from bzrlib.tests import TestSkipped
from bzrlib.tests.tree_implementations import TestCaseWithTree
class TestAnnotate(TestCaseWithTree):
def test_annotate(self):
work_tree = self.make_branch_and_tree('wt')
tree = self.get_tree_no_parents_abc_content(work_tree)
tree_revision = getattr(tree, 'get_revision_id', lambda: 'current:')()
tree.lock_read()
self.addCleanup(tree.unlock)
for revision, line in tree.annotate_iter('a-id'):
self.assertEqual('contents of a\n', line)
self.assertEqual(tree_revision, revision)
tree_revision = getattr(tree, 'get_revision_id', lambda: 'random:')()
for revision, line in tree.annotate_iter('a-id', 'random:'):
self.assertEqual('contents of a\n', line)
self.assertEqual(tree_revision, revision)
class TestPlanFileMerge(TestCaseWithTree):
def test_plan_file_merge(self):
work_a = self.make_branch_and_tree('wta')
self.build_tree_contents([('wta/file', 'a\nb\nc\nd\n')])
work_a.add('file', 'file-id')
work_a.commit('base version')
work_b = work_a.bzrdir.sprout('wtb').open_workingtree()
self.build_tree_contents([('wta/file', 'b\nc\nd\ne\n')])
tree_a = self.workingtree_to_test_tree(work_a)
tree_a.lock_read()
self.addCleanup(tree_a.unlock)
self.build_tree_contents([('wtb/file', 'a\nc\nd\nf\n')])
tree_b = self.workingtree_to_test_tree(work_b)
tree_b.lock_read()
self.addCleanup(tree_b.unlock)
self.assertEqual([
('killed-b', 'b\n'),
('killed-a', 'a\n'),
('unchanged', 'c\n'),
('unchanged', 'd\n'),
('new-a', 'e\n'),
('new-b', 'f\n'),
], list(tree_a.plan_file_merge('file-id', tree_b)))
class TestReference(TestCaseWithTree):
def skip_if_no_reference(self, tree):
if not getattr(tree, 'supports_tree_reference', lambda: False)():
raise tests.TestSkipped('Tree references not supported')
def create_nested(self):
work_tree = self.make_branch_and_tree('wt')
work_tree.lock_write()
try:
self.skip_if_no_reference(work_tree)
subtree = self.make_branch_and_tree('wt/subtree')
subtree.set_root_id('sub-root')
subtree.commit('foo', rev_id='sub-1')
work_tree.add_reference(subtree)
finally:
work_tree.unlock()
tree = self._convert_tree(work_tree)
self.skip_if_no_reference(tree)
return tree
def test_get_reference_revision(self):
tree = self.create_nested()
path = tree.id2path('sub-root')
self.assertEqual('sub-1', tree.get_reference_revision('sub-root', path))
def test_iter_references(self):
tree = self.create_nested()
tree.lock_read()
self.addCleanup(tree.unlock)
entry = tree.inventory['sub-root']
self.assertEqual([(tree.abspath('subtree'), 'sub-root')],
list(tree.iter_references()))
def test_get_root_id(self):
# trees should return some kind of root id; it can be none
tree = self.make_branch_and_tree('tree')
root_id = tree.get_root_id()
if root_id is not None:
self.assertIsInstance(root_id, str)
class TestFileIds(TestCaseWithTree):
def test_id2path(self):
# translate from file-id back to path
work_tree = self.make_branch_and_tree('wt')
tree = self.get_tree_no_parents_abc_content(work_tree)
tree.lock_read()
try:
self.assertEqual(u'a', tree.id2path('a-id'))
# other ids give an error- don't return None for this case
self.assertRaises(errors.NoSuchId, tree.id2path, 'a')
finally:
tree.unlock()
class TestFileContent(TestCaseWithTree):
def test_get_file(self):
work_tree = self.make_branch_and_tree('wt')
tree = self.get_tree_no_parents_abc_content_2(work_tree)
tree.lock_read()
try:
# Test lookup without path works
lines = tree.get_file('a-id').readlines()
self.assertEqual(['foobar\n'], lines)
# Test lookup with path works
lines = tree.get_file('a-id', path='a').readlines()
self.assertEqual(['foobar\n'], lines)
finally:
tree.unlock()
class TestExtractFilesBytes(TestCaseWithTree):
def test_iter_files_bytes(self):
work_tree = self.make_branch_and_tree('wt')
self.build_tree_contents([('wt/foo', 'foo'),
('wt/bar', 'bar'),
('wt/baz', 'baz')])
work_tree.add(['foo', 'bar', 'baz'], ['foo-id', 'bar-id', 'baz-id'])
tree = self._convert_tree(work_tree)
tree.lock_read()
self.addCleanup(tree.unlock)
extracted = dict((i, ''.join(b)) for i, b in
tree.iter_files_bytes([('foo-id', 'id1'),
('bar-id', 'id2'),
('baz-id', 'id3')]))
self.assertEqual('foo', extracted['id1'])
self.assertEqual('bar', extracted['id2'])
self.assertEqual('baz', extracted['id3'])
self.assertRaises(errors.NoSuchId, lambda: list(
tree.iter_files_bytes(
[('qux-id', 'file1-notpresent')])))
class TestConflicts(TestCaseWithTree):
def test_conflicts(self):
"""Tree.conflicts() should return a ConflictList instance."""
work_tree = self.make_branch_and_tree('wt')
tree = self._convert_tree(work_tree)
self.assertIsInstance(tree.conflicts(), conflicts.ConflictList)
|