Repository navigation
Expand file tree
/
Copy pathtest.cpp
More file actions
216 lines (198 loc) · 8.22 KB
/
Copy pathtest.cpp
File metadata and controls
216 lines (198 loc) · 8.22 KB
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
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
#include <iostream>
#include <vector>
#include "Singlelist.h"
#include "Doublelist.h"
#include "Arraystack.h"
#include "Liststack.h"
#include "Arrayqueue.h"
#include "Listqueue.h"
#include "BStree.h"
#include "AVLTree.h"
#define CHECK_AVLTREE_BUG 1
void test_Singlelist(){
Singlelist<double> a;
std::cout << "--------------Empty Singlelist test!------------" << std::endl;
a.print().del(10);
std::cout << a.size() << std::endl;
std::cout << "--------------insert test!------------" << std::endl;
std::cout << "initialize insert!" << std::endl;
a.insert_last(10.0).insert_last(20.0).insert_last(30.0).print();
std::cout << "out_range insert!" << std::endl;
a.insert(10,100.0).print();
std::cout << "midway insert!" << std::endl;
a.insert(2,10000.0).print();
std::cout << "head insert!" << std::endl;
a.insert_head(232324.0).print();
std::cout << "compute size!" << std::endl;
std::cout << a.size() << std::endl;
std::cout << "--------------delete test!------------" << std::endl;
std::cout << "out-range delete!" << std::endl;
a.del(100).print();
std::cout << "head delete!" << std::endl;
a.del_head().print();
std::cout << "midway delete!" << std::endl;
a.del(3).print();
std::cout << "last delete!" << std::endl;
a.del_last().print();
std::cout << "--------------get value test!------------" << std::endl;
std::cout << "out-range get value!" << std::endl;
std::cout << a.get_value(20) << std::endl;
std::cout << "get value test!" << std::endl;
std::cout << a.get_value(2) << std::endl;
std::cout << "--------------pointer test!------------" << std::endl;
Singlelist<double>::pointer p = a.get_head();
for(p; p != NULL; p = p->_next){
std::cout << "index: " << p->_index << " data: " << p->_value << std::endl;
}
}
void test_Doublelist(){
Doublelist<double> a;
std::cout << "--------------Empty Doublelist test!------------" << std::endl;
a.print();
std::cout << "-------------------insert test!-----------------" << std::endl;
std::cout << "initialize insert!" << std::endl;
a.insert_last(10.0).insert_last(20.0).insert_last(30.0).print().size();
std::cout << "out_range insert!" << std::endl;
a.insert(10,100.0).print().size();
std::cout << "midway insert!" << std::endl;
a.insert(2,10000.0).print();
std::cout << "head insert!" << std::endl;
a.insert_head(232324.0).print();
std::cout << "compute size!" << std::endl;
a.size();
std::cout << "--------------get value test!------------" << std::endl;
std::cout << "out-range get value!" << std::endl;
std::cout << a.get_value(20) << std::endl;
std::cout << "get value test!" << std::endl;
std::cout << a.get_value(2) << std::endl;
std::cout << "--------------pointer test!------------" << std::endl;
Doublelist<double>::pointer head = a.get_head(), p = head;
Doublelist<double>::pointer last = a.get_last();
int tag = 0;
std::cout << "increase print" << std::endl;
for(p; (p != head || tag != 1); p = p->_next, tag = 1){
std::cout << "index: " << p->_index << " data: " << p->_value << std::endl;
}
std::cout << "decrease print" << std::endl;
for(p=last; (p != last || tag != 0); p = p->_pre, tag = 0){
std::cout << "index: " << p->_index << " data: " << p->_value << std::endl;
}
std::cout << "--------------delete test!------------" << std::endl;
std::cout << "out-range delete!" << std::endl;
a.del(100).print();
std::cout << "head delete!" << std::endl;
a.del_head().print();
std::cout << "midway delete!" << std::endl;
a.del(3).print();
std::cout << "last delete!" << std::endl;
a.del_last().print();
}
void test_Arraystack(){
Arraystack<int> a(3);
std::cout << "--------------------Push and full push test!---------------------" << std::endl;
a.push(10).push(20).push(30).push(40);
std::cout << "----------------------Print test!-------------------" << std::endl;
int* p = a.get_array();
for(int i = 0; i < a.size(); ++i){
std::cout << p[i] << std::endl;
}
std::cout << "----------------------------Size and pop test!--------------------" << std::endl;
std::cout << "size: " << a.size() <<std::endl;
std::cout << a.get_top() <<std::endl; a.pop();
std::cout << "size: " << a.size() <<std::endl;
std::cout << a.get_top() <<std::endl; a.pop();
std::cout << "size: " << a.size() <<std::endl;
std::cout << a.get_top() <<std::endl; a.pop();
std::cout << "------------------------------------Empty get top and pop test!------------------------------" << std::endl;
std::cout << "size: " << a.size() <<std::endl;
std::cout << a.get_top() <<std::endl; a.pop();
}
void test_Liststack(){
Liststack<int> a;
a.print();
a.push(10).push(20).push(30);
std::cout << "----------------------Size and print test!-------------------" << std::endl;
std::cout << a.size() <<std::endl;a.print();
std::cout << a.get_top() <<std::endl; a.pop();
std::cout << a.size() <<std::endl;a.print();
std::cout << a.get_top() <<std::endl; a.pop();
std::cout << a.size() <<std::endl;a.print();
std::cout << a.get_top() <<std::endl; a.pop();
std::cout << "------------------------------------Empty get top and pop test!------------------------------" << std::endl;
std::cout << a.size() <<std::endl;a.print();
std::cout << a.get_top() <<std::endl; a.pop();
}
void test_Arrayqueue(){
Arrayqueue<int> a(4);
std::cout << "-------------------------Push test and out-range push test!-----------------------" << std::endl;
a.push(10).push(20).push(30).push(40).push(50);
std::cout << a.get_head() << std::endl;
std::cout << "----------------------Pop test and loop push test!------------------------" << std::endl;
a.pop();
std::cout << a.get_head() << std::endl;
a.push(50).push(60);
std::cout << "--------------------------check every element in Arrayqueue is right!-----------------------" << std::endl;
std::cout << a.get_head() << std::endl;
for(int i = 0; i < 4; ++i)
std::cout << a.get_array()[i] << std::endl;
}
void test_Listqueue(){
Listqueue<int> a;
std::cout << "-------------------Empty Listqueue test!-------------------" << std::endl;
a.pop().print();
std::cout << "-------------------Push test and out-range push test!------------------" << std::endl;
a.push(10).push(20).push(30).push(40).push(50).print();
std::cout << a.get_head() << std::endl;
std::cout << "--------------------Pop test and loop push test!----------------------" << std::endl;
a.pop().print();
std::cout << a.get_head() << std::endl;
a.push(500).push(600);
std::cout << "-------------------------Check every element in Arrayqueue is right!------------------" << std::endl;
a.print();
}
void test_BStree(){
BStree<int> a;
std::cout << "-----------------------------insert test---------------------------------------\n";
a.insert(3).insert(1).insert(4).insert(5).insert(2).insert(1);
a.preOder();
a.inOder();
a.postOder();
std::cout << "max: " << a.max() << " min: " << a.min() << std::endl;
std::cout << "-----------------------------remove test---------------------------------------\n";
a.remove(5);
std::cout << "max: " << a.max() << " min: " << a.min() << std::endl;
a.preOder();
a.inOder();
a.postOder();
a.remove(10);
a.inOder();
a.remove(1).remove(3).remove(4).remove(1).remove(5).remove(10);
a.inOder();
}
void test_AVLtree(){
AVLTree<int> a;
for (int i = 0; i < 10; i++)
a.insert(i);
std::cout << "树高：" << a.height() << std::endl;
std::cout << "中序遍历:" << std::endl;
a.InOrder();
std::cout << "删除元素1"<<std::endl;
a.remove(1);
std::cout << "删除元素5"<<std::endl;
a.remove(5);
#if CHECK_AVLTREE_BUG
std::cout << "删除元素6"<<std::endl;
a.remove(6); //after this code, element 4 is removed to????????
#endif
std::cout << "中序遍历:" << std::endl;
a.InOrder();
AVLNode<int>* b = a.search_iterator(5);
if (b != nullptr)
std::cout << b->_value;
else
std::cout << "无此元素" << std::endl;
}
int main(){
test_AVLtree();
return 0;
}