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
|
// Copyright 2017 Yahoo Holdings. Licensed under the terms of the Apache 2.0 license. See LICENSE in the project root.
#include <vespa/document/test/make_document_bucket.h>
#include <vespa/storage/distributor/maintenance/simplebucketprioritydatabase.h>
#include <vespa/vespalib/gtest/gtest.h>
#include <string>
using document::test::makeDocumentBucket;
namespace storage::distributor {
using document::BucketId;
using Priority = MaintenancePriority;
TEST(SimpleBucketPriorityDatabaseTest, iterator_range_is_equal_on_empty_database) {
SimpleBucketPriorityDatabase queue;
auto begin = queue.begin();
auto end = queue.end();
EXPECT_TRUE(begin == end);
EXPECT_TRUE(begin == begin);
EXPECT_TRUE(end == end);
}
TEST(SimpleBucketPriorityDatabaseTest, can_get_prioritized_bucket) {
SimpleBucketPriorityDatabase queue;
PrioritizedBucket lowPriBucket(makeDocumentBucket(BucketId(16, 1234)), Priority::VERY_LOW);
queue.setPriority(lowPriBucket);
PrioritizedBucket highest(*queue.begin());
EXPECT_EQ(lowPriBucket, highest);
}
TEST(SimpleBucketPriorityDatabaseTest, iterate_over_multiple_priorities) {
SimpleBucketPriorityDatabase queue;
PrioritizedBucket lowPriBucket(makeDocumentBucket(BucketId(16, 1234)), Priority::LOW);
PrioritizedBucket highPriBucket(makeDocumentBucket(BucketId(16, 4321)), Priority::HIGH);
queue.setPriority(lowPriBucket);
queue.setPriority(highPriBucket);
auto iter = queue.begin();
ASSERT_EQ(highPriBucket, *iter);
++iter;
ASSERT_TRUE(iter != queue.end());
ASSERT_EQ(lowPriBucket, *iter);
++iter;
ASSERT_TRUE(iter == queue.end());
}
TEST(SimpleBucketPriorityDatabaseTest, multiple_set_priority_for_one_bucket) {
SimpleBucketPriorityDatabase queue;
PrioritizedBucket lowPriBucket(makeDocumentBucket(BucketId(16, 1234)), Priority::LOW);
PrioritizedBucket highPriBucket(makeDocumentBucket(BucketId(16, 1234)), Priority::HIGH);
queue.setPriority(lowPriBucket);
queue.setPriority(highPriBucket);
auto iter = queue.begin();
ASSERT_EQ(highPriBucket, *iter);
++iter;
ASSERT_TRUE(iter == queue.end());
}
TEST(SimpleBucketPriorityDatabaseTest, no_maintenance_needed_clears_bucket_from_database) {
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);
auto iter = queue.begin();
ASSERT_TRUE(iter == queue.end());
}
TEST(SimpleBucketPriorityDatabaseTest, iterate_over_multiple_buckets_with_multiple_priorities) {
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);
auto iter = queue.begin();
PrioritizedBucket lastBucket(makeDocumentBucket(BucketId()), Priority::PRIORITY_LIMIT);
for (int i = 0; i < 5; ++i) {
ASSERT_TRUE(iter != queue.end());
ASSERT_FALSE(iter->moreImportantThan(lastBucket));
lastBucket = *iter;
++iter;
}
ASSERT_TRUE(iter == queue.end());
}
}
|
