38 lines
1.1 KiB
C++
38 lines
1.1 KiB
C++
#include "common.h"
|
|
|
|
#define THREADS_NO 8
|
|
constexpr size_t elems_per_thread = 100000;
|
|
constexpr size_t key_range = elems_per_thread * THREADS_NO * 2;
|
|
|
|
// This test checks insert_unique method under pressure.
|
|
// Threads will try to insert keys in the same order.
|
|
// This will force threads to compete intensly with each other.
|
|
// Test checks for missing data and changed/overwriten data.
|
|
int main() {
|
|
memory_check(THREADS_NO, [] {
|
|
skiplist_t skiplist;
|
|
|
|
auto futures = run<std::vector<size_t>>(
|
|
THREADS_NO, skiplist, [](auto acc, auto index) {
|
|
auto rand = rand_gen(key_range);
|
|
size_t downcount = elems_per_thread;
|
|
std::vector<size_t> owned;
|
|
auto inserter = insert_try<size_t, size_t>(acc, downcount, owned);
|
|
|
|
for (int i = 0; downcount > 0; i++) {
|
|
inserter(i, index);
|
|
}
|
|
|
|
check_present_same(acc, index, owned);
|
|
return owned;
|
|
});
|
|
|
|
auto accessor = skiplist.access();
|
|
for (auto &owned : collect(futures)) {
|
|
check_present_same(accessor, owned);
|
|
}
|
|
|
|
check_size(accessor, THREADS_NO * elems_per_thread);
|
|
});
|
|
}
|