df0bf6fa5f
DbAccessor: -Guarantees that access to Vertex and Edge is possible only through Vertex::Accessor and Edge::Accessor. -Guarantees that changing Vertex and Edge is possible only using Vertex::Accessor returned by vertex_insert() method and Edge::Accessor returned by edge_insert() method. -Offers CRUD for Vertex and Edge except iterating over all edges. Squashed commit messages: First step in database accessor refactoring done. It's compiling. All tests with exception of integration_querys pass Tests now initialize logging facilities. Refactored accessors. RecordAccessor now has 3 states. From,To,Out,In in there respecive Accessors return unfilled RecordAccessor. Added iterator classes into utils/itearator/.
78 lines
2.5 KiB
C++
78 lines
2.5 KiB
C++
#include "common.h"
|
|
|
|
#define THREADS_NO 8
|
|
constexpr size_t elems_per_thread = 1e5;
|
|
|
|
int main()
|
|
{
|
|
init_log();
|
|
memory_check(THREADS_NO, [&] {
|
|
ds::static_array<std::thread, THREADS_NO> 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[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) {
|
|
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();
|
|
permanent_assert(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) {
|
|
permanent_assert(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();
|
|
permanent_assert(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 << " ";
|
|
}
|
|
permanent_assert(iterator_counter == 0, "deleted elements");
|
|
}
|
|
|
|
{
|
|
auto accessor = skiplist.access();
|
|
check_order<map_t>(accessor);
|
|
}
|
|
});
|
|
}
|