a01c26439b
Summary: - Removed a lot of stuff that was incorrect and/or unnecessary - Fixed const-correctness in the skiplist family Reviewers: dgleich, teon.banek, buda Reviewed By: dgleich Subscribers: pullbot Differential Revision: https://phabricator.memgraph.io/D1351
66 lines
1.7 KiB
C++
66 lines
1.7 KiB
C++
#include "common.hpp"
|
|
|
|
constexpr size_t THREADS_NO = std::min(max_no_threads, 8);
|
|
constexpr size_t key_range = 1e4;
|
|
constexpr size_t op_per_thread = 1e5;
|
|
constexpr size_t no_insert_for_one_delete = 2;
|
|
|
|
// TODO: document the test
|
|
|
|
// This test checks set.
|
|
// Each thread removes random data. So removes are joint.
|
|
// Calls of remove method are interleaved with insert calls.
|
|
int main(int, char **argv) {
|
|
google::InitGoogleLogging(argv[0]);
|
|
SkipList<std::string> skiplist;
|
|
|
|
auto futures =
|
|
run<std::vector<long>>(THREADS_NO, skiplist, [](auto acc, auto index) {
|
|
|
|
auto rand = rand_gen(key_range);
|
|
auto rand_op = rand_gen_bool(no_insert_for_one_delete);
|
|
long long downcount = op_per_thread;
|
|
std::vector<long> set(key_range);
|
|
|
|
do {
|
|
int num = rand();
|
|
std::string num_str = std::to_string(num);
|
|
if (rand_op()) {
|
|
if (acc.remove(num_str)) {
|
|
downcount--;
|
|
set[num]--;
|
|
}
|
|
} else {
|
|
std::string num_str = std::to_string(num);
|
|
if (acc.insert(num_str).second) {
|
|
downcount--;
|
|
set[num]++;
|
|
}
|
|
}
|
|
} while (downcount > 0);
|
|
|
|
return set;
|
|
});
|
|
|
|
long set[key_range] = {0};
|
|
for (auto &data : collect(futures)) {
|
|
for (int i = 0; i < key_range; i++) {
|
|
set[i] += data.second[i];
|
|
}
|
|
}
|
|
|
|
auto accessor = skiplist.access();
|
|
for (int i = 0; i < key_range; i++) {
|
|
CHECK(set[i] == 0 || set[i] == 1 ||
|
|
(set[i] == 1) ^ accessor.contains(std::to_string(i)))
|
|
<< "Set doesn't hold it's guarantees.";
|
|
}
|
|
|
|
for (auto &e : accessor) {
|
|
set[std::stoi(e)]--;
|
|
}
|
|
|
|
check_zero(key_range, set, "Set");
|
|
return 0;
|
|
}
|