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
|
# Copyright (C) 2010 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., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
"""Tests of bzrlib test matchers."""
from testtools.matchers import *
from bzrlib.tests import (
TestCase,
TestCaseWithTransport,
)
from bzrlib.tests.matchers import *
class StubTree(object):
"""Stubg for testing."""
def __init__(self, lock_status):
self._is_locked = lock_status
def __str__(self):
return u'I am da tree'
def is_locked(self):
return self._is_locked
class FakeUnlockable(object):
"""Something that can be unlocked."""
def unlock(self):
pass
class TestReturnsUnlockable(TestCase):
def test___str__(self):
matcher = ReturnsUnlockable(StubTree(True))
self.assertEqual(
'ReturnsUnlockable(lockable_thing=I am da tree)',
str(matcher))
def test_match(self):
stub_tree = StubTree(False)
matcher = ReturnsUnlockable(stub_tree)
self.assertThat(matcher.match(lambda:FakeUnlockable()), Equals(None))
def test_mismatch(self):
stub_tree = StubTree(True)
matcher = ReturnsUnlockable(stub_tree)
mismatch = matcher.match(lambda:FakeUnlockable())
self.assertNotEqual(None, mismatch)
self.assertThat(mismatch.describe(), Equals("I am da tree is locked"))
class TestMatchesAncestry(TestCaseWithTransport):
def test__str__(self):
matcher = MatchesAncestry("A repository", "arevid")
self.assertEqual(
"MatchesAncestry(repository='A repository', "
"revision_id='arevid')",
str(matcher))
def test_match(self):
b = self.make_branch_builder('.')
b.start_series()
revid1 = b.build_commit()
revid2 = b.build_commit()
b.finish_series()
branch = b.get_branch()
m = MatchesAncestry(branch.repository, revid2)
self.assertThat([revid2, revid1], m)
self.assertThat([revid1, revid2], m)
m = MatchesAncestry(branch.repository, revid1)
self.assertThat([revid1], m)
m = MatchesAncestry(branch.repository, "unknown")
self.assertThat(["unknown"], m)
def test_mismatch(self):
b = self.make_branch_builder('.')
b.start_series()
revid1 = b.build_commit()
revid2 = b.build_commit()
b.finish_series()
branch = b.get_branch()
m = MatchesAncestry(branch.repository, revid1)
mismatch = m.match([])
self.assertIsNot(None, mismatch)
self.assertEquals(
"mismatched ancestry for revision '%s' was ['%s'], expected []" % (
revid1, revid1),
mismatch.describe())
class TestHasLayout(TestCaseWithTransport):
def test__str__(self):
matcher = HasLayout([("a", "a-id")])
self.assertEqual("HasLayout([('a', 'a-id')])", str(matcher))
def test_match(self):
t = self.make_branch_and_tree('.')
self.build_tree(['a', 'b/', 'b/c'])
t.add(['a', 'b', 'b/c'], ['a-id', 'b-id', 'c-id'])
self.assertThat(t, HasLayout(['', 'a', 'b/', 'b/c']))
self.assertThat(t, HasLayout(
[('', t.get_root_id()),
('a', 'a-id'),
('b/', 'b-id'),
('b/c', 'c-id')]))
def test_mismatch(self):
t = self.make_branch_and_tree('.')
self.build_tree(['a', 'b/', 'b/c'])
t.add(['a', 'b', 'b/c'], ['a-id', 'b-id', 'c-id'])
mismatch = HasLayout(['a']).match(t)
self.assertIsNot(None, mismatch)
self.assertEquals(
"['a'] != [u'', u'a', u'b/', u'b/c']",
mismatch.describe())
def test_no_dirs(self):
# Some tree/repository formats do not support versioned directories
t = self.make_branch_and_tree('.')
t.has_versioned_directories = lambda: False
self.build_tree(['a', 'b/', 'b/c'])
t.add(['a', 'b', 'b/c'], ['a-id', 'b-id', 'c-id'])
self.assertIs(None, HasLayout(['', 'a', 'b/', 'b/c']).match(t))
self.assertIs(None, HasLayout(['', 'a', 'b/', 'b/c', 'd/']).match(t))
mismatch = HasLayout([u'', u'a', u'd/']).match(t)
self.assertIsNot(None, mismatch)
self.assertEquals(
"[u'', u'a'] != [u'', u'a', u'b/', u'b/c']",
mismatch.describe())
|