53
59
def test_match(self):
54
60
stub_tree = StubTree(False)
55
61
matcher = ReturnsUnlockable(stub_tree)
56
self.assertThat(matcher.match(lambda:FakeUnlockable()), Equals(None))
62
self.assertThat(matcher.match(lambda: FakeUnlockable()), Equals(None))
58
64
def test_mismatch(self):
59
65
stub_tree = StubTree(True)
60
66
matcher = ReturnsUnlockable(stub_tree)
61
mismatch = matcher.match(lambda:FakeUnlockable())
67
mismatch = matcher.match(lambda: FakeUnlockable())
62
68
self.assertNotEqual(None, mismatch)
63
69
self.assertThat(mismatch.describe(), Equals("I am da tree is locked"))
72
class TestMatchesAncestry(TestCaseWithTransport):
74
def test__str__(self):
75
matcher = MatchesAncestry("A repository", b"arevid")
77
"MatchesAncestry(repository='A repository', "
78
"revision_id=%r)" % (b'arevid', ),
82
b = self.make_branch_builder('.')
84
revid1 = b.build_commit()
85
revid2 = b.build_commit()
87
branch = b.get_branch()
88
m = MatchesAncestry(branch.repository, revid2)
89
self.assertThat([revid2, revid1], m)
90
self.assertThat([revid1, revid2], m)
91
m = MatchesAncestry(branch.repository, revid1)
92
self.assertThat([revid1], m)
93
m = MatchesAncestry(branch.repository, b"unknown")
94
self.assertThat([b"unknown"], m)
96
def test_mismatch(self):
97
b = self.make_branch_builder('.')
99
revid1 = b.build_commit()
100
revid2 = b.build_commit()
102
branch = b.get_branch()
103
m = MatchesAncestry(branch.repository, revid1)
104
mismatch = m.match([])
105
self.assertIsNot(None, mismatch)
107
"mismatched ancestry for revision %r was [%r], expected []" % (
112
class TestHasLayout(TestCaseWithTransport):
114
def test__str__(self):
115
matcher = HasLayout([(b"a", b"a-id")])
116
self.assertEqual("HasLayout(%r)" % ([(b'a', b'a-id')], ), str(matcher))
118
def test_match(self):
119
t = self.make_branch_and_tree('.')
120
self.build_tree(['a', 'b/', 'b/c'])
121
t.add(['a', 'b', 'b/c'], [b'a-id', b'b-id', b'c-id'])
122
self.assertThat(t, HasLayout(['', 'a', 'b/', 'b/c']))
123
self.assertThat(t, HasLayout(
124
[('', t.path2id('')),
129
def test_mismatch(self):
130
t = self.make_branch_and_tree('.')
131
self.build_tree(['a', 'b/', 'b/c'])
132
t.add(['a', 'b', 'b/c'], [b'a-id', b'b-id', b'c-id'])
133
mismatch = HasLayout(['a']).match(t)
134
self.assertIsNot(None, mismatch)
137
set(("['', 'a', 'b/', 'b/c']", "['a']")),
138
set(mismatch.describe().split(" != ")))
141
set(("[u'', u'a', u'b/', u'b/c']", "['a']")),
142
set(mismatch.describe().split(" != ")))
144
def test_no_dirs(self):
145
# Some tree/repository formats do not support versioned directories
146
t = self.make_branch_and_tree('.')
147
t.has_versioned_directories = lambda: False
148
self.build_tree(['a', 'b/', 'b/c'])
149
t.add(['a', 'b', 'b/c'], [b'a-id', b'b-id', b'c-id'])
150
self.assertIs(None, HasLayout(['', 'a', 'b/', 'b/c']).match(t))
151
self.assertIs(None, HasLayout(['', 'a', 'b/', 'b/c', 'd/']).match(t))
152
mismatch = HasLayout([u'', u'a', u'd/']).match(t)
153
self.assertIsNot(None, mismatch)
156
set(("['', 'a', 'b/', 'b/c']", "['', 'a']")),
157
set(mismatch.describe().split(" != ")))
160
set(("[u'', u'a', u'b/', u'b/c']", "[u'', u'a']")),
161
set(mismatch.describe().split(" != ")))
164
class TestHasPathRelations(TestCaseWithTransport):
166
def test__str__(self):
167
t = self.make_branch_and_tree('.')
168
matcher = HasPathRelations(t, [("a", "b")])
169
self.assertEqual("HasPathRelations(%r, %r)" %
170
(t, [('a', 'b')]), str(matcher))
172
def test_match(self):
173
t = self.make_branch_and_tree('.')
174
self.build_tree(['a', 'b/', 'b/c'])
175
t.add(['a', 'b', 'b/c'])
176
self.assertThat(t, HasPathRelations(t,
182
def test_mismatch(self):
183
t = self.make_branch_and_tree('.')
184
self.build_tree(['a', 'b/', 'b/c'])
185
t.add(['a', 'b', 'b/c'])
186
mismatch = HasPathRelations(t, [('a', 'a')]).match(t)
187
self.assertIsNot(None, mismatch)
190
class TestRevisionHistoryMatches(TestCaseWithTransport):
192
def test_empty(self):
193
tree = self.make_branch_and_tree('.')
194
matcher = RevisionHistoryMatches([])
195
self.assertIs(None, matcher.match(tree.branch))
197
def test_matches(self):
198
tree = self.make_branch_and_tree('.')
199
tree.commit('msg1', rev_id=b'a')
200
tree.commit('msg2', rev_id=b'b')
201
matcher = RevisionHistoryMatches([b'a', b'b'])
202
self.assertIs(None, matcher.match(tree.branch))
204
def test_mismatch(self):
205
tree = self.make_branch_and_tree('.')
206
tree.commit('msg1', rev_id=b'a')
207
tree.commit('msg2', rev_id=b'b')
208
matcher = RevisionHistoryMatches([b'a', b'b', b'c'])
211
set(("[b'a', b'b']", "[b'a', b'b', b'c']")),
212
set(matcher.match(tree.branch).describe().split(" != ")))
215
set(("['a', 'b']", "['a', 'b', 'c']")),
216
set(matcher.match(tree.branch).describe().split(" != ")))