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
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
|
// test_resolver_hints.cc -*-c++-*-
//
// Copyright (C) 2009 Daniel Burrows
//
// 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; see the file COPYING. If not, write to
// the Free Software Foundation, Inc., 59 Temple Place - Suite 330,
// Boston, MA 02111-1307, USA.
//
// A test of the resolver-hint structure.
#include <generic/apt/aptitude_resolver.h>
#include <cppunit/extensions/HelperMacros.h>
using namespace aptitude::matching;
namespace
{
typedef aptitude_resolver::hint hint;
struct test
{
// A string version of the hint.
std::string text;
// The resolver hint.
aptitude_resolver::hint h;
test(const std::string &_text, const hint &_h)
: text(_text), h(_h)
{
}
};
const test resolver_tests[] =
{
test("40 g++", hint::make_tweak_score(pattern::make_exact_name("g++"),
hint::version_selection::make_inst(),
40)),
test("-143 aptitude <4.3.0", hint::make_tweak_score(pattern::make_exact_name("aptitude"),
hint::version_selection::make_version(hint::version_selection::less_than, "4.3.0"),
-143)),
test("+621 ?section(games) /unstable", hint::make_tweak_score(pattern::make_section("games"),
hint::version_selection::make_archive("unstable"),
621)),
test("reject libc6 <=0.5.0", hint::make_reject(pattern::make_exact_name("libc6"),
hint::version_selection::make_version(hint::version_selection::less_than_or_equal_to,
"0.5.0"))),
test("approve entropy =0", hint::make_mandate(pattern::make_exact_name("entropy"),
hint::version_selection::make_version(hint::version_selection::equal_to,
"0"))),
test("approve entropy 1", hint::make_mandate(pattern::make_exact_name("entropy"),
hint::version_selection::make_version(hint::version_selection::equal_to,
"1"))),
test("reject aptitude :UNINST", hint::make_reject(pattern::make_exact_name("aptitude"),
hint::version_selection::make_uninst())),
test("+29387 xmonad >=5.4.3.2.1", hint::make_tweak_score(pattern::make_exact_name("xmonad"),
hint::version_selection::make_version(hint::version_selection::greater_than_or_equal_to, "5.4.3.2.1"),
29387)),
test("approve dc >1", hint::make_mandate(pattern::make_exact_name("dc"),
hint::version_selection::make_version(hint::version_selection::greater_than, "1"))),
test("reject ?task(desktop) <>4.0", hint::make_reject(pattern::make_task("desktop"),
hint::version_selection::make_version(hint::version_selection::not_equal_to, "4.0")))
};
const int num_resolver_tests =
sizeof(resolver_tests) / sizeof(resolver_tests[0]);
}
class ResolverHintsTest : public CppUnit::TestFixture
{
CPPUNIT_TEST_SUITE(ResolverHintsTest);
CPPUNIT_TEST(testHintParse);
CPPUNIT_TEST(testHintCopy);
CPPUNIT_TEST(testHintOrdering);
CPPUNIT_TEST_SUITE_END();
public:
void testHintParse()
{
for(int i = 0; i < num_resolver_tests; ++i)
{
// \todo When we have an operator<< to write out hints, we
// should use ASSERT_EQUAL to get better messages.
const test &t(resolver_tests[i]);
hint h;
CPPUNIT_ASSERT_MESSAGE("Parsing " + t.text, hint::parse(t.text, h));
CPPUNIT_ASSERT_MESSAGE("Checking " + t.text, h == t.h);
}
// Try some failure cases too.
hint dummy;
CPPUNIT_ASSERT(!hint::parse("", dummy));
CPPUNIT_ASSERT(!hint::parse("823", dummy));
CPPUNIT_ASSERT(!hint::parse("badact target", dummy));
CPPUNIT_ASSERT(!hint::parse("approve ?version(423 1234)", dummy));
CPPUNIT_ASSERT(!hint::parse("approve ?version(3425", dummy));
}
void testHintCopy()
{
for(int i = 0; i < num_resolver_tests; ++i)
{
hint h(resolver_tests[i].h);
CPPUNIT_ASSERT_MESSAGE("Testing copy constructor: ", h == resolver_tests[i].h);
hint h2;
h2 = resolver_tests[i].h;
CPPUNIT_ASSERT_MESSAGE("Testing operator=: ", h2 == resolver_tests[i].h);
CPPUNIT_ASSERT_MESSAGE("Testing operator= and copy constructor: ", h == h2);
}
}
void testHintOrdering()
{
// Brute-force verification of the axioms of a total ordering.
// Uses the fact that all the hints in the test array are
// different.
for(int i = 0; i < num_resolver_tests; ++i)
for(int j = 0; j < num_resolver_tests; ++j)
{
const hint &hi(resolver_tests[i].h);
const hint &hj(resolver_tests[j].h);
// Test consistency with .compare().
int cmp = hi.compare(hj);
if(cmp < 0)
{
CPPUNIT_ASSERT(hi < hj);
CPPUNIT_ASSERT(hi <= hj);
CPPUNIT_ASSERT(!(hi == hj));
CPPUNIT_ASSERT(hi != hj);
CPPUNIT_ASSERT(!(hi >= hj));
CPPUNIT_ASSERT(!(hi > hj));
}
else if(cmp == 0)
{
CPPUNIT_ASSERT(!(hi < hj));
CPPUNIT_ASSERT(hi <= hj);
CPPUNIT_ASSERT(hi == hj);
CPPUNIT_ASSERT(!(hi != hj));
CPPUNIT_ASSERT(hi >= hj);
CPPUNIT_ASSERT(!(hi > hj));
}
else // if(cmp > 0)
{
CPPUNIT_ASSERT(!(hi < hj));
CPPUNIT_ASSERT(!(hi <= hj));
CPPUNIT_ASSERT(!(hi == hj));
CPPUNIT_ASSERT(hi != hj);
CPPUNIT_ASSERT(hi >= hj);
CPPUNIT_ASSERT(hi > hj);
}
// Check that identity comparisons work (x == x' <=> x is x').
//
// Check that for all x, x <= x and x >= x, and also !(x<x)
// and !(x>x).
if(i == j)
{
CPPUNIT_ASSERT(hi == hj);
CPPUNIT_ASSERT(hi >= hj);
CPPUNIT_ASSERT(hi <= hj);
CPPUNIT_ASSERT(!(hi != hj));
CPPUNIT_ASSERT(!(hi < hj));
CPPUNIT_ASSERT(!(hi > hj));
}
else
{
CPPUNIT_ASSERT(hi != hj);
CPPUNIT_ASSERT(!(hi == hj));
CPPUNIT_ASSERT(hi > hj ||
hi < hj);
if(hi > hj)
{
CPPUNIT_ASSERT(hi >= hj);
CPPUNIT_ASSERT(!(hi < hj));
CPPUNIT_ASSERT(!(hi <= hj));
}
if(hi < hj)
{
CPPUNIT_ASSERT(hi <= hj);
CPPUNIT_ASSERT(!(hi > hj));
CPPUNIT_ASSERT(!(hi >= hj));
}
}
for(int k = 0; k < num_resolver_tests; ++k)
{
const hint &hk(resolver_tests[k].h);
// Test transitivity -- testing both or-equal and not-equal
// variants might be excessive?
if(hi <= hj && hj <= hk)
CPPUNIT_ASSERT(hi <= hk);
if(hi < hj && hj < hk)
CPPUNIT_ASSERT(hi < hk);
if(hi >= hj && hj >= hk)
CPPUNIT_ASSERT(hi >= hk);
if(hi > hj && hj > hk)
CPPUNIT_ASSERT(hi > hk);
}
}
}
};
CPPUNIT_TEST_SUITE_REGISTRATION(ResolverHintsTest);
|
