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
77 lines
2.0 KiB
C++
77 lines
2.0 KiB
C++
#include "common.hpp"
|
|
|
|
constexpr size_t THREADS_NO = std::min(max_no_threads, 8);
|
|
constexpr size_t elems_per_thread = 1e5;
|
|
|
|
// TODO: document the test
|
|
|
|
int main(int, char **argv) {
|
|
google::InitGoogleLogging(argv[0]);
|
|
std::vector<std::thread> threads;
|
|
map_t skiplist;
|
|
|
|
// put THREADS_NO * elems_per_thread items to the skiplist
|
|
for (size_t thread_i = 0; thread_i < THREADS_NO; ++thread_i) {
|
|
threads.emplace_back(
|
|
[&skiplist](size_t start, size_t end) {
|
|
auto accessor = skiplist.access();
|
|
for (size_t elem_i = start; elem_i < end; ++elem_i) {
|
|
accessor.insert(elem_i, elem_i);
|
|
}
|
|
},
|
|
thread_i * elems_per_thread,
|
|
thread_i * elems_per_thread + elems_per_thread);
|
|
}
|
|
// wait all threads
|
|
for (auto &thread : threads) {
|
|
thread.join();
|
|
}
|
|
|
|
// get skiplist size
|
|
{
|
|
auto accessor = skiplist.access();
|
|
CHECK(accessor.size() == THREADS_NO * elems_per_thread)
|
|
<< "all elements in skiplist";
|
|
}
|
|
|
|
for (size_t thread_i = 0; thread_i < THREADS_NO; ++thread_i) {
|
|
threads[thread_i] = std::thread(
|
|
[&skiplist](size_t start, size_t end) {
|
|
auto accessor = skiplist.access();
|
|
for (size_t elem_i = start; elem_i < end; ++elem_i) {
|
|
CHECK(accessor.remove(elem_i) == true) << "";
|
|
}
|
|
},
|
|
thread_i * elems_per_thread,
|
|
thread_i * elems_per_thread + elems_per_thread);
|
|
}
|
|
// // wait all threads
|
|
for (auto &thread : threads) {
|
|
thread.join();
|
|
}
|
|
|
|
// check size
|
|
{
|
|
auto accessor = skiplist.access();
|
|
CHECK(accessor.size() == 0) << "Size should be 0, but size is "
|
|
<< accessor.size();
|
|
}
|
|
|
|
// check count
|
|
{
|
|
size_t iterator_counter = 0;
|
|
auto accessor = skiplist.access();
|
|
for (auto elem : accessor) {
|
|
++iterator_counter;
|
|
cout << elem.first << " ";
|
|
}
|
|
CHECK(iterator_counter == 0) << "deleted elements";
|
|
}
|
|
|
|
{
|
|
auto accessor = skiplist.access();
|
|
check_order(accessor);
|
|
}
|
|
return 0;
|
|
}
|