/
test_btree_btreenode.cpp
139 lines (106 loc) · 4.59 KB
/
test_btree_btreenode.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
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
/*****************************************************************************/
/* Milliways - B+ trees and key-value store C++ library */
/* */
/* Copyright 2016 Marco Pantaleoni and J CUBE Inc. Tokyo, Japan. */
/* */
/* Author: Marco Pantaleoni <marco.pantaleoni@gmail.com> */
/* */
/* Licensed under the Apache License, Version 2.0 (the "License"); */
/* you may not use this file except in compliance with the License. */
/* You may obtain a copy of the License at */
/* */
/* http://www.apache.org/licenses/LICENSE-2.0 */
/* */
/* Unless required by applicable law or agreed to in writing, software */
/* distributed under the License is distributed on an "AS IS" BASIS, */
/* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. */
/* See the License for the specific language governing permissions and */
/* limitations under the License. */
/*****************************************************************************/
#define CATCH_CONFIG_MAIN // This tells Catch to provide a main() - only do this in one cpp file
#include "catch.hpp"
#include "Seriously.h"
#include "BTreeNode.h"
#include "BTree.h"
#define B_TEST 4
TEST_CASE( "BTree", "[BTree]" ) {
typedef milliways::BTree<B_TEST, seriously::Traits<std::string>, seriously::Traits<int32_t> > btree_t;
typedef XTYPENAME btree_t::node_type btree_node_t;
typedef milliways::shptr<XTYPENAME btree_t::node_type> btree_node_ptr_t;
SECTION( "starts empty" ) {
btree_t tree;
REQUIRE(tree.size() == 0);
REQUIRE(! tree.hasRoot());
}
SECTION( "can alloc children" ) {
btree_t tree;
btree_node_ptr_t root = tree.node_alloc();
REQUIRE(root);
REQUIRE(tree.rootId() == root->id());
btree_node_ptr_t child = tree.node_child_alloc(root);
REQUIRE(child);
REQUIRE(child->leaf());
REQUIRE(child->id() != root->id());
REQUIRE(child->parentId() == root->id());
REQUIRE(! root->leaf());
REQUIRE(tree.rootId() == root->id());
}
SECTION( "root is created automatically when requested" ) {
btree_t tree;
btree_node_ptr_t root = tree.root();
REQUIRE(root);
REQUIRE(tree.rootId() == root->id());
}
SECTION( "size and root properties behave correctly" ) {
btree_t tree;
REQUIRE(tree.size() == 0);
REQUIRE(! tree.hasRoot());
btree_node_ptr_t node = tree.node_alloc();
REQUIRE(node);
REQUIRE(node->leaf());
REQUIRE(tree.size() == 1);
REQUIRE(tree.hasRoot());
REQUIRE(tree.rootId() == node->id());
REQUIRE(node->id() != milliways::NODE_ID_INVALID);
REQUIRE(node->empty());
REQUIRE(node->nonFull());
}
}
TEST_CASE( "BTree Memory Storage", "[BTreeMemoryStorage]" ) {
typedef milliways::BTree<B_TEST, seriously::Traits<std::string>, seriously::Traits<int32_t> > btree_t;
typedef milliways::BTreeMemoryStorage<B_TEST, seriously::Traits<std::string>, seriously::Traits<int32_t> > btree_mem_st_t;
typedef XTYPENAME btree_t::node_type btree_node_t;
typedef milliways::shptr<XTYPENAME btree_t::node_type> btree_node_ptr_t;
SECTION( "is present by default" )
{
btree_t tree;
REQUIRE(tree.storage());
}
SECTION( "can get requested nodes" ) {
btree_t tree;
if (! tree.hasRoot()) {
tree.node_alloc();
}
btree_node_ptr_t root = tree.root();
btree_node_ptr_t child1 = tree.node_child_alloc(root);
btree_node_ptr_t child2 = tree.node_child_alloc(root);
btree_node_ptr_t child3 = tree.node_child_alloc(root);
btree_node_ptr_t child1_1 = tree.node_child_alloc(child1);
btree_node_ptr_t child3_1 = tree.node_child_alloc(child3);
btree_node_ptr_t child3_2 = tree.node_child_alloc(child3);
btree_node_ptr_t node = tree.node_get(root->id());
REQUIRE(node->id() == root->id());
node = tree.node_get(child1->id());
REQUIRE(node->id() == child1->id());
node = tree.node_get(child2->id());
REQUIRE(node->id() == child2->id());
node = tree.node_get(child3->id());
REQUIRE(node->id() == child3->id());
node = tree.node_get(child1_1->id());
REQUIRE(node->id() == child1_1->id());
node = tree.node_get(child3_1->id());
REQUIRE(node->id() == child3_1->id());
node = tree.node_get(child3_2->id());
REQUIRE(node->id() == child3_2->id());
}
}