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
|
// Copyright 2017 Yahoo Holdings. Licensed under the terms of the Apache 2.0 license. See LICENSE in the project root.
#include <vespa/vdstestlib/cppunit/macros.h>
#include <string>
#include <vespa/storage/distributor/maintenance/simplebucketprioritydatabase.h>
#include <vespa/document/test/make_document_bucket.h>
using document::test::makeDocumentBucket;
namespace storage {
namespace distributor {
using document::BucketId;
typedef MaintenancePriority Priority;
class SimpleBucketPriorityDatabaseTest : public CppUnit::TestFixture {
CPPUNIT_TEST_SUITE(SimpleBucketPriorityDatabaseTest);
CPPUNIT_TEST(testIteratorRangeIsEqualOnEmptyDatabase);
CPPUNIT_TEST(testCanGetPrioritizedBucket);
CPPUNIT_TEST(testIterateOverMultiplePriorities);
CPPUNIT_TEST(testMultipleSetPriorityForOneBucket);
CPPUNIT_TEST(testIterateOverMultipleBucketsWithMultiplePriorities);
CPPUNIT_TEST(testNoMaintenanceNeededClearsBucketFromDatabase);
CPPUNIT_TEST_SUITE_END();
typedef SimpleBucketPriorityDatabase::const_iterator const_iterator;
public:
void testIteratorRangeIsEqualOnEmptyDatabase();
void testCanGetPrioritizedBucket();
void testIterateOverMultiplePriorities();
void testMultipleSetPriorityForOneBucket();
void testIterateOverMultipleBucketsWithMultiplePriorities();
void testNoMaintenanceNeededClearsBucketFromDatabase();
};
CPPUNIT_TEST_SUITE_REGISTRATION(SimpleBucketPriorityDatabaseTest);
void
SimpleBucketPriorityDatabaseTest::testIteratorRangeIsEqualOnEmptyDatabase()
{
SimpleBucketPriorityDatabase queue;
const_iterator begin(queue.begin());
const_iterator end(queue.end());
CPPUNIT_ASSERT(begin == end);
CPPUNIT_ASSERT(begin == begin);
CPPUNIT_ASSERT(end == end);
}
void
SimpleBucketPriorityDatabaseTest::testCanGetPrioritizedBucket()
{
SimpleBucketPriorityDatabase queue;
PrioritizedBucket lowPriBucket(makeDocumentBucket(BucketId(16, 1234)), Priority::VERY_LOW);
queue.setPriority(lowPriBucket);
PrioritizedBucket highest(*queue.begin());
CPPUNIT_ASSERT_EQUAL(lowPriBucket, highest);
}
void
SimpleBucketPriorityDatabaseTest::testIterateOverMultiplePriorities()
{
SimpleBucketPriorityDatabase queue;
PrioritizedBucket lowPriBucket(makeDocumentBucket(BucketId(16, 1234)), Priority::LOW);
PrioritizedBucket highPriBucket(makeDocumentBucket(BucketId(16, 4321)), Priority::HIGH);
queue.setPriority(lowPriBucket);
queue.setPriority(highPriBucket);
const_iterator iter(queue.begin());
CPPUNIT_ASSERT_EQUAL(highPriBucket, *iter);
++iter;
CPPUNIT_ASSERT(iter != queue.end());
CPPUNIT_ASSERT_EQUAL(lowPriBucket, *iter);
++iter;
CPPUNIT_ASSERT(iter == queue.end());
}
void
SimpleBucketPriorityDatabaseTest::testMultipleSetPriorityForOneBucket()
{
SimpleBucketPriorityDatabase queue;
PrioritizedBucket lowPriBucket(makeDocumentBucket(BucketId(16, 1234)), Priority::LOW);
PrioritizedBucket highPriBucket(makeDocumentBucket(BucketId(16, 1234)), Priority::HIGH);
queue.setPriority(lowPriBucket);
queue.setPriority(highPriBucket);
const_iterator iter(queue.begin());
CPPUNIT_ASSERT_EQUAL(highPriBucket, *iter);
++iter;
CPPUNIT_ASSERT(iter == queue.end());
}
void
SimpleBucketPriorityDatabaseTest::testNoMaintenanceNeededClearsBucketFromDatabase()
{
SimpleBucketPriorityDatabase queue;
PrioritizedBucket highPriBucket(makeDocumentBucket(BucketId(16, 1234)), Priority::HIGH);
PrioritizedBucket noPriBucket(makeDocumentBucket(BucketId(16, 1234)),
Priority::NO_MAINTENANCE_NEEDED);
queue.setPriority(highPriBucket);
queue.setPriority(noPriBucket);
const_iterator iter(queue.begin());
CPPUNIT_ASSERT(iter == queue.end());
}
void
SimpleBucketPriorityDatabaseTest::testIterateOverMultipleBucketsWithMultiplePriorities()
{
SimpleBucketPriorityDatabase queue;
PrioritizedBucket lowPriBucket1(makeDocumentBucket(BucketId(16, 1)), Priority::LOW);
PrioritizedBucket lowPriBucket2(makeDocumentBucket(BucketId(16, 2)), Priority::LOW);
PrioritizedBucket mediumPriBucket(makeDocumentBucket(BucketId(16, 3)), Priority::MEDIUM);
PrioritizedBucket highPriBucket1(makeDocumentBucket(BucketId(16, 4)), Priority::HIGH);
PrioritizedBucket highPriBucket2(makeDocumentBucket(BucketId(16, 5)), Priority::HIGH);
queue.setPriority(highPriBucket1);
queue.setPriority(lowPriBucket2);
queue.setPriority(mediumPriBucket);
queue.setPriority(highPriBucket2);
queue.setPriority(lowPriBucket1);
const_iterator iter(queue.begin());
PrioritizedBucket lastBucket(makeDocumentBucket(BucketId()), Priority::PRIORITY_LIMIT);
for (int i = 0; i < 5; ++i) {
CPPUNIT_ASSERT(iter != queue.end());
CPPUNIT_ASSERT(!iter->moreImportantThan(lastBucket));
lastBucket = *iter;
++iter;
}
CPPUNIT_ASSERT(iter == queue.end());
}
}
}
|
