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
|
# 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
"""Matchers for bzrlib.
Primarily test support, Matchers are used by self.assertThat in the bzrlib
test suite. A matcher is a stateful test helper which can be used to determine
if a passed object 'matches', much like a regex. If the object does not match
the mismatch can be described in a human readable fashion. assertThat then
raises if a mismatch occurs, showing the description as the assertion error.
Matchers are designed to be more reusable and composable than layered
assertions in Test Case objects, so they are recommended for new testing work.
"""
__all__ = [
'MatchesAncestry',
'ReturnsUnlockable',
]
from bzrlib import (
revision as _mod_revision,
)
from testtools.matchers import Mismatch, Matcher
class ReturnsUnlockable(Matcher):
"""A matcher that checks for the pattern we want lock* methods to have:
They should return an object with an unlock() method.
Calling that method should unlock the original object.
:ivar lockable_thing: The object which can be locked that will be
inspected.
"""
def __init__(self, lockable_thing):
Matcher.__init__(self)
self.lockable_thing = lockable_thing
def __str__(self):
return ('ReturnsUnlockable(lockable_thing=%s)' %
self.lockable_thing)
def match(self, lock_method):
lock_method().unlock()
if self.lockable_thing.is_locked():
return _IsLocked(self.lockable_thing)
return None
class _IsLocked(Mismatch):
"""Something is locked."""
def __init__(self, lockable_thing):
self.lockable_thing = lockable_thing
def describe(self):
return "%s is locked" % self.lockable_thing
class _AncestryMismatch(Mismatch):
"""Ancestry matching mismatch."""
def __init__(self, tip_revision, got, expected):
self.tip_revision = tip_revision
self.got = got
self.expected = expected
def describe(self):
return "mismatched ancestry for revision %r was %r, expected %r" % (
self.tip_revision, self.got, self.expected)
class MatchesAncestry(Matcher):
"""A matcher that checks the ancestry of a particular revision.
:ivar graph: Graph in which to check the ancestry
:ivar revision_id: Revision id of the revision
"""
def __init__(self, repository, revision_id):
Matcher.__init__(self)
self.repository = repository
self.revision_id = revision_id
def __str__(self):
return ('MatchesAncestry(repository=%r, revision_id=%r)' % (
self.repository, self.revision_id))
def match(self, expected):
self.repository.lock_read()
try:
graph = self.repository.get_graph()
got = [r for r, p in graph.iter_ancestry([self.revision_id])]
if _mod_revision.NULL_REVISION in got:
got.remove(_mod_revision.NULL_REVISION)
finally:
self.repository.unlock()
if sorted(got) != sorted(expected):
return _AncestryMismatch(self.revision_id, sorted(got), sorted(expected))
|