]>
Commit | Line | Data |
---|---|---|
7c673cae | 1 | // Copyright (c) 2011-present, Facebook, Inc. All rights reserved. |
11fdf7f2 TL |
2 | // This source code is licensed under both the GPLv2 (found in the |
3 | // COPYING file in the root directory) and Apache 2.0 License | |
4 | // (found in the LICENSE.Apache file in the root directory). | |
7c673cae | 5 | |
7c673cae | 6 | #include <string> |
20effc67 | 7 | #include <vector> |
7c673cae FG |
8 | |
9 | #include "table/merging_iterator.h" | |
f67539c2 TL |
10 | #include "test_util/testharness.h" |
11 | #include "test_util/testutil.h" | |
20effc67 | 12 | #include "util/random.h" |
7c673cae | 13 | |
f67539c2 | 14 | namespace ROCKSDB_NAMESPACE { |
7c673cae FG |
15 | |
16 | class MergerTest : public testing::Test { | |
17 | public: | |
18 | MergerTest() | |
11fdf7f2 TL |
19 | : icomp_(BytewiseComparator()), |
20 | rnd_(3), | |
21 | merging_iterator_(nullptr), | |
22 | single_iterator_(nullptr) {} | |
494da23a | 23 | ~MergerTest() override = default; |
7c673cae FG |
24 | std::vector<std::string> GenerateStrings(size_t len, int string_len) { |
25 | std::vector<std::string> ret; | |
11fdf7f2 | 26 | |
7c673cae | 27 | for (size_t i = 0; i < len; ++i) { |
20effc67 | 28 | InternalKey ik(rnd_.HumanReadableString(string_len), 0, |
11fdf7f2 TL |
29 | ValueType::kTypeValue); |
30 | ret.push_back(ik.Encode().ToString(false)); | |
7c673cae FG |
31 | } |
32 | return ret; | |
33 | } | |
34 | ||
35 | void AssertEquivalence() { | |
36 | auto a = merging_iterator_.get(); | |
37 | auto b = single_iterator_.get(); | |
38 | if (!a->Valid()) { | |
39 | ASSERT_TRUE(!b->Valid()); | |
40 | } else { | |
41 | ASSERT_TRUE(b->Valid()); | |
42 | ASSERT_EQ(b->key().ToString(), a->key().ToString()); | |
43 | ASSERT_EQ(b->value().ToString(), a->value().ToString()); | |
44 | } | |
45 | } | |
46 | ||
11fdf7f2 | 47 | void SeekToRandom() { |
20effc67 | 48 | InternalKey ik(rnd_.HumanReadableString(5), 0, ValueType::kTypeValue); |
11fdf7f2 TL |
49 | Seek(ik.Encode().ToString(false)); |
50 | } | |
7c673cae FG |
51 | |
52 | void Seek(std::string target) { | |
53 | merging_iterator_->Seek(target); | |
54 | single_iterator_->Seek(target); | |
55 | } | |
56 | ||
57 | void SeekToFirst() { | |
58 | merging_iterator_->SeekToFirst(); | |
59 | single_iterator_->SeekToFirst(); | |
60 | } | |
61 | ||
62 | void SeekToLast() { | |
63 | merging_iterator_->SeekToLast(); | |
64 | single_iterator_->SeekToLast(); | |
65 | } | |
66 | ||
67 | void Next(int times) { | |
68 | for (int i = 0; i < times && merging_iterator_->Valid(); ++i) { | |
69 | AssertEquivalence(); | |
70 | merging_iterator_->Next(); | |
71 | single_iterator_->Next(); | |
72 | } | |
73 | AssertEquivalence(); | |
74 | } | |
75 | ||
76 | void Prev(int times) { | |
77 | for (int i = 0; i < times && merging_iterator_->Valid(); ++i) { | |
78 | AssertEquivalence(); | |
79 | merging_iterator_->Prev(); | |
80 | single_iterator_->Prev(); | |
81 | } | |
82 | AssertEquivalence(); | |
83 | } | |
84 | ||
85 | void NextAndPrev(int times) { | |
86 | for (int i = 0; i < times && merging_iterator_->Valid(); ++i) { | |
87 | AssertEquivalence(); | |
88 | if (rnd_.OneIn(2)) { | |
89 | merging_iterator_->Prev(); | |
90 | single_iterator_->Prev(); | |
91 | } else { | |
92 | merging_iterator_->Next(); | |
93 | single_iterator_->Next(); | |
94 | } | |
95 | } | |
96 | AssertEquivalence(); | |
97 | } | |
98 | ||
99 | void Generate(size_t num_iterators, size_t strings_per_iterator, | |
100 | int letters_per_string) { | |
101 | std::vector<InternalIterator*> small_iterators; | |
102 | for (size_t i = 0; i < num_iterators; ++i) { | |
103 | auto strings = GenerateStrings(strings_per_iterator, letters_per_string); | |
104 | small_iterators.push_back(new test::VectorIterator(strings)); | |
105 | all_keys_.insert(all_keys_.end(), strings.begin(), strings.end()); | |
106 | } | |
107 | ||
108 | merging_iterator_.reset( | |
11fdf7f2 | 109 | NewMergingIterator(&icomp_, &small_iterators[0], |
7c673cae FG |
110 | static_cast<int>(small_iterators.size()))); |
111 | single_iterator_.reset(new test::VectorIterator(all_keys_)); | |
112 | } | |
113 | ||
11fdf7f2 | 114 | InternalKeyComparator icomp_; |
7c673cae FG |
115 | Random rnd_; |
116 | std::unique_ptr<InternalIterator> merging_iterator_; | |
117 | std::unique_ptr<InternalIterator> single_iterator_; | |
118 | std::vector<std::string> all_keys_; | |
119 | }; | |
120 | ||
121 | TEST_F(MergerTest, SeekToRandomNextTest) { | |
122 | Generate(1000, 50, 50); | |
123 | for (int i = 0; i < 10; ++i) { | |
124 | SeekToRandom(); | |
125 | AssertEquivalence(); | |
126 | Next(50000); | |
127 | } | |
128 | } | |
129 | ||
130 | TEST_F(MergerTest, SeekToRandomNextSmallStringsTest) { | |
131 | Generate(1000, 50, 2); | |
132 | for (int i = 0; i < 10; ++i) { | |
133 | SeekToRandom(); | |
134 | AssertEquivalence(); | |
135 | Next(50000); | |
136 | } | |
137 | } | |
138 | ||
139 | TEST_F(MergerTest, SeekToRandomPrevTest) { | |
140 | Generate(1000, 50, 50); | |
141 | for (int i = 0; i < 10; ++i) { | |
142 | SeekToRandom(); | |
143 | AssertEquivalence(); | |
144 | Prev(50000); | |
145 | } | |
146 | } | |
147 | ||
148 | TEST_F(MergerTest, SeekToRandomRandomTest) { | |
149 | Generate(200, 50, 50); | |
150 | for (int i = 0; i < 3; ++i) { | |
151 | SeekToRandom(); | |
152 | AssertEquivalence(); | |
153 | NextAndPrev(5000); | |
154 | } | |
155 | } | |
156 | ||
157 | TEST_F(MergerTest, SeekToFirstTest) { | |
158 | Generate(1000, 50, 50); | |
159 | for (int i = 0; i < 10; ++i) { | |
160 | SeekToFirst(); | |
161 | AssertEquivalence(); | |
162 | Next(50000); | |
163 | } | |
164 | } | |
165 | ||
166 | TEST_F(MergerTest, SeekToLastTest) { | |
167 | Generate(1000, 50, 50); | |
168 | for (int i = 0; i < 10; ++i) { | |
169 | SeekToLast(); | |
170 | AssertEquivalence(); | |
171 | Prev(50000); | |
172 | } | |
173 | } | |
174 | ||
f67539c2 | 175 | } // namespace ROCKSDB_NAMESPACE |
7c673cae FG |
176 | |
177 | int main(int argc, char** argv) { | |
178 | ::testing::InitGoogleTest(&argc, argv); | |
179 | return RUN_ALL_TESTS(); | |
180 | } |