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/.
84 lines
2.9 KiB
C++
84 lines
2.9 KiB
C++
#include "common.h"
|
|
|
|
#define THREADS_NO 4
|
|
constexpr size_t key_range = 1e4;
|
|
constexpr size_t op_per_thread = 1e5;
|
|
// Depending on value there is a possiblity of numerical overflow
|
|
constexpr size_t max_number = 10;
|
|
constexpr size_t no_insert_for_one_delete = 2;
|
|
|
|
// This test checks MultiIterator remove method ].
|
|
// Each thread removes all duplicate data on random key. So removes are joint
|
|
// and scattered on same
|
|
// key values.
|
|
// Calls of remove method are interleaved with insert calls which always
|
|
// succeed.
|
|
int main()
|
|
{
|
|
init_log();
|
|
memory_check(THREADS_NO, [] {
|
|
multimap_t skiplist;
|
|
|
|
auto futures = run<std::pair<long long, std::vector<long 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 long> set(key_range, 0);
|
|
long long sum = 0;
|
|
|
|
do {
|
|
size_t num = rand();
|
|
auto data = rand() % max_number;
|
|
if (rand_op()) {
|
|
auto it = acc.find_multi(num);
|
|
if (it.has_value()) {
|
|
it++;
|
|
while (it.has_value()) {
|
|
auto data_r = it->second;
|
|
if (it.remove()) {
|
|
downcount--;
|
|
set[num]--;
|
|
sum -= data_r;
|
|
permanent_assert(
|
|
it.is_removed(),
|
|
"is_removed method doesn't work");
|
|
}
|
|
it++;
|
|
}
|
|
}
|
|
} else {
|
|
acc.insert(num, data);
|
|
downcount--;
|
|
set[num]++;
|
|
sum += data;
|
|
}
|
|
} while (downcount > 0);
|
|
|
|
return std::pair<long long, std::vector<long long>>(sum, set);
|
|
});
|
|
|
|
long set[key_range] = {0};
|
|
long long sums = 0;
|
|
for (auto &data : collect(futures)) {
|
|
sums += data.second.first;
|
|
for (int i = 0; i < key_range; i++) {
|
|
set[i] += data.second.second[i];
|
|
}
|
|
}
|
|
|
|
auto accessor = skiplist.access();
|
|
check_multi_iterator(accessor, key_range, set);
|
|
|
|
for (auto &e : accessor) {
|
|
set[e.first]--;
|
|
sums -= e.second;
|
|
}
|
|
permanent_assert(sums == 0, "Aproximetly Same values are present");
|
|
|
|
check_zero(key_range, set, "MultiMap");
|
|
|
|
check_order<multimap_t>(accessor);
|
|
});
|
|
}
|