-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathtest.cpp
More file actions
202 lines (165 loc) · 4.8 KB
/
test.cpp
File metadata and controls
202 lines (165 loc) · 4.8 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
#include <cassert>
#include <iostream>
#include "Node.hpp"
#include "LinkedList.hpp"
#include "HashTable.hpp"
/*
begin node tests.
*/
void test1(){
Node* node = new Node("foo",500);
assert(node->getFreq()==500);
assert(node->getWord()=="foo");
assert(node->getHashVal()==-1);
assert(node->getNext()==nullptr);
delete node;
}
void test2(){
Node* node = new Node("foo",50);
node->setHashVal(12345678);
assert(node->getHashVal()==12345678);
assert(node->toString()=="foo 50");
delete node;
}
void test3(){
Node* node = new Node("foo",50);
Node* beef = new Node("bar",77);
node->setNext(beef);
assert(beef->getNext()==nullptr);
assert(node->getNext()->getWord()=="bar");
delete node;
delete beef;}
//copy constructor
void test4(){
Node* node = new Node("foo",50);
Node* beef = new Node(*node);
assert(beef->getWord()==node->getWord());
delete node;
delete beef;}
//assignment operator
void test4b(){
Node* node = new Node("foo",50);
Node* beef = new Node("bar",8);
*beef = *node;
assert(node->getWord()==beef->getWord());
delete beef;
delete node;}
/******************
LinkedList tests
*******************/
void test5(){
Node* node = new Node("foo",50);
Node* beef = new Node("bar",77);
Node* samm = new Node("toy",9000);
Node* blob = new Node("boop",89);
LinkedList* list = new LinkedList();
assert(list->getSize()==0);
list->addToFront(node);
list->addToFront(beef);
list->addToFront(samm);
// assert(list->toStringInReverseOrder()
// == "|<-[foo 50]<-[bar 77]<-[toy 9000]");
assert(list->getSize()==3);
assert(list->removeWord("foo"));//test head
assert(list->getSize()==2);
// assert(list->toStringInReverseOrder()=="|<-[bar 77]<-[toy 9000]");
list->addToFront(blob);
assert(list->removeWord("toy"));
// std::cout<<list->toStringInReverseOrder()<<std::endl;
assert(list->removeWord("boop"));
// std::cout<<list->toStringInReverseOrder()<<std::endl;
assert(list->removeWord("rumplestiltskin")==false);
assert(list->removeWord("bar"));
assert(list->removeWord("bar")==false);
delete list;
}
void test6(){
Node* node = new Node("foo",50);
Node* beef = new Node("bar",77);
Node* samm = new Node("toy",9000);
Node* blob = new Node("boop",89);
LinkedList* list = new LinkedList();
assert(list->getSize()==0);
// std::cout<<list->toString()<<std::endl;
list->addToFront(node);
list->addToFront(beef);
list->addToFront(samm);
list->addToFront(blob);
// std::cout<<list->toString()<<std::endl;
list->removeFront();
assert(list->getSize()==3);
// std::cout<<list->toString()<<std::endl;
list->removeFront();
// std::cout<<list->toString()<<std::endl;
list->removeFront();
// std::cout<<list->toString()<<std::endl;
list->removeFront();
// std::cout<<list->toString()<<std::endl;
list->removeFront();//hooray no segfault
// std::cout<<list->toString()<<std::endl;
delete list;
}
/*****************
Hash Table test
*****************/
//test default values and destructor when empty
void test7(){
HashTable* table = new HashTable();
assert(table->getCapacity()==2048);
assert(table->getNumWords()==0);
delete table;
}
void test8(){
HashTable* table = new HashTable();
// Node* foo = new Node(*(table->convert("kholrabi",12)));
//holy cow it works!
// assert(foo->getHashVal()==6859);
// delete foo;
// need to test this with add().
table->add(table->convert("kholrabi",12));
table->add(table->convert("brocc",13));
table->add(table->convert("egg",14));
table->add(table->convert("eggplant",44));
table->add(table->convert("dogwood",45));
table->add(table->convert("canteloupe",66));
table->add(table->convert("watermelon",900));
table->add(table->convert("extracalifragilistic",8));
table->add(table->convert("sailboat",1800));
table->add(table->convert("radish",11112));
table->add(table->convert("$0.0022",40));
// std::cout<<table->toString()<<std::endl;
assert(table->getData("egg")->toString()=="egg 14");
assert(table->getData("kholrabi")->toString()=="kholrabi 12");
table->add(table->convert("kholrabi",8888888));
// std::cout<<table->toString()<<std::endl;
assert(table->removeWord("kholrabi"));
delete table;
}
void test9(){
HashTable* table = new HashTable();
// Node* foo = new Node(*(table->convert("kholrabi",12)));
//holy cow it works!
// assert(foo->getHashVal()==6859);
// delete foo;
// need to test this with add().
table->add(table->convert("!",1274158));
table->add(table->convert("$0.0008",65));
table->add(table->convert("$0.0015",76));
table->add(table->convert("$0.0022",40));
// std::cout<<"trying to print"<<std::endl;
// std::cout<<table->toString()<<std::endl;
delete table;
}
int main(){
test1();
test2();
test3();
test4();
test4b();
test5();
test6();
test7();
test8();
test9();
return 0;
}