blob: a43006e71d892dd5f59278fa2539a77e20689eec (
plain)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
|
/*
* tests/de_level_tomb.cpp
*
* Unit tests for Dynamic Extension Framework
*
* Copyright (C) 2023 Douglas Rumbaugh <drumbaugh@psu.edu>
* Dong Xie <dongx@psu.edu>
*
* Distributed under the Modified BSD License.
*
*/
#include <set>
#include <random>
#include <algorithm>
#include "framework/scheduling/SerialScheduler.h"
#include "include/testing.h"
#include "framework/DynamicExtension.h"
#include "shard/ISAMTree.h"
#include "query/rangequery.h"
#include "framework/reconstruction/LevelingPolicy.h"
#include "framework/util/Configuration.h"
#include <check.h>
using namespace de;
typedef Rec R;
typedef ISAMTree<R> S;
typedef rq::Query<S> Q;
typedef DynamicExtension<S, Q, DeletePolicy::TOMBSTONE, SerialScheduler> DE;
typedef de::DEConfiguration<S, Q, DeletePolicy::TOMBSTONE, SerialScheduler> CONF;
#include "include/concurrent_extension.h"
Suite *unit_testing()
{
Suite *unit = suite_create("DynamicExtension: Concurrent Leveling Testing");
inject_dynamic_extension_tests(unit);
return unit;
}
int shard_unit_tests()
{
int failed = 0;
Suite *unit = unit_testing();
SRunner *unit_shardner = srunner_create(unit);
srunner_run_all(unit_shardner, CK_NORMAL);
failed = srunner_ntests_failed(unit_shardner);
srunner_free(unit_shardner);
return failed;
}
int main()
{
int unit_failed = shard_unit_tests();
return (unit_failed == 0) ? EXIT_SUCCESS : EXIT_FAILURE;
}
|