forked from zhangnaifan/BzTree
-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathmain.cpp
45 lines (40 loc) · 1.43 KB
/
main.cpp
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
#include "test.h"
#include <iostream>
using namespace std;
int main() {
unit_test<uint64_t> tcase;
for (int i = 0; i < 1; ++i) {
int test_cnt = 6;
//upsert
cout << "tree" << endl;
tcase.run(true, false, false, false, false, false, false, false, false, true, 9500, 4, 1);
}
for (int i = 0; i < 0; ++i) {
int test_cnt = 6;
//Ç¿¶È»ìºÏ
cout << "mix" << endl;
tcase.run(true, true, true, true, true, true, false, false, false, false, 0, test_cnt * 2);
//insert
cout << "insert" << endl;
tcase.run(true, true, false, false, true, false, false, false, false, false, 0, test_cnt);
//update
cout << "update" << endl;
tcase.run(false, false, false, true, true, false, false, false, false, false, 0, test_cnt);
//upsert
cout << "upsert" << endl;
tcase.run(false, false, false, false, true, true, false, false, false, false, 0, test_cnt * 2);
//delete
cout << "delete" << endl;
tcase.run(false, false, true, false, true, false, false, false, false, false, 0, test_cnt);
//consolidate
cout << "consolidate" << endl;
tcase.run(false, false, false, false, false, false, true, false, false, false, 0, 1, 1);
//upsert
cout << "upsert" << endl;
tcase.run(false, false, false, false, true, true, false, false, false, false, 0, test_cnt * 2);
//split
cout << "split and merge" << endl;
tcase.run(false, false, false, false, false, false, false, true, true, false, 0, 1, 1);
}
return 0;
}