-
Notifications
You must be signed in to change notification settings - Fork 32
/
test2.cc
122 lines (101 loc) · 2.91 KB
/
test2.cc
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
#include <iostream>
#include "tree.hh"
#include "tree_util.hh"
tree<std::string> test_move_constructor()
{
tree<std::string> mtree;
tree<std::string>::iterator it = mtree.set_head("top");
mtree.append_child(it, "one");
mtree.append_child(it, "two");
mtree.append_child(it, "three");
tree<std::string> ctree(std::move(mtree));
std::cout << "ctree:" << std::endl;
kptree::print_tree_bracketed(ctree);
std::cout << "\nmtree:" << std::endl;
kptree::print_tree_bracketed(mtree);
return ctree;
}
tree<std::string> test_move_out()
{
tree<std::string> mtree;
tree<std::string>::iterator it = mtree.set_head("top");
mtree.append_child(it, "one");
auto it2 = mtree.append_child(it, "two");
mtree.append_child(it, "three");
mtree.append_child(it2, "four");
mtree.append_child(it2, "five");
auto ret = mtree.move_out(it2);
ret.debug_verify_consistency();
return ret;
}
void test_move_in(tree<std::string>& other)
{
tree<std::string> mtree;
tree<std::string>::iterator it = mtree.set_head("top");
mtree.append_child(it, "one");
auto it3=mtree.append_child(it, "three");
mtree.move_in(it3, other);
mtree.debug_verify_consistency();
kptree::print_tree_bracketed(mtree);
std::cout << "\n";
}
void test_move_in_as_nth_child(int n)
{
tree<std::string> mtree, other;
tree<std::string>::iterator it = mtree.set_head("top");
mtree.append_child(it, "one");
mtree.append_child(it, "three");
auto ot1 = other.set_head("hi");
other.insert_after(ot1, "second");
other.append_child(ot1, "1");
other.append_child(ot1, "2");
mtree.move_in_as_nth_child(it, n, other);
mtree.debug_verify_consistency();
kptree::print_tree_bracketed(mtree);
std::cout << "\n";
}
void test_move_in_below()
{
tree<std::string> mtree, other;
tree<std::string>::iterator it = mtree.set_head("top");
mtree.append_child(it, "one");
mtree.append_child(it, "three");
auto ot1 = other.set_head("hi");
other.insert_after(ot1, "second");
other.append_child(ot1, "1");
other.append_child(ot1, "2");
mtree.move_in_below(it, other);
mtree.debug_verify_consistency();
kptree::print_tree_bracketed(mtree);
}
int main(int argc, char **argv)
{
// Move constructor.
tree<std::string> res = test_move_constructor();
std::cout << "res:" << std::endl;
kptree::print_tree_bracketed(res);
// Move out.
tree<std::string> res2 = test_move_out();
std::cout << "\nres2:" << std::endl;
kptree::print_tree_bracketed(res2);
std::cout << std::endl;
// Move in.
std::cout << "test_move_in:\n";
test_move_in(res2);
std::cout << "\n";
// Move in as last child.
std::cout << "test_move_in_below:\n";
test_move_in_below();
std::cout << "\n\n";
// Move in as nth child.
std::cout << "test_move_in_as_nth_child:\n";
test_move_in_as_nth_child(0);
test_move_in_as_nth_child(1);
test_move_in_as_nth_child(2);
try {
test_move_in_as_nth_child(3);
}
catch(const std::range_error& ex) {
std::cout << "correct exception: " << ex.what() << std::endl;
}
}