forked from barrylyung/a1p2
-
Notifications
You must be signed in to change notification settings - Fork 0
/
test-map.cpp
93 lines (80 loc) · 1.9 KB
/
test-map.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
#include "object.h"
#include "string.h"
#include "node.h"
#include "map.h"
#include <stdio.h>
#include <stdlib.h>
void FAIL() { exit(1); }
void OK(const char* m) { printf("Passed: %s\n", m); }
void t_true(bool p) { if (!p) FAIL(); }
void t_false(bool p) { if (p) FAIL(); }
String* cast_string(Object *object) {
return dynamic_cast<String*>(object);
}
String* s1 = new String("A");
String* s2 = new String("B");
String* s3 = new String("C");
Object* o1 = new Object();
Object* o2 = new Object();
Object* o3 = new Object();
Node* n1 = new Node(s1, o1);
Node* n2 = new Node(s2, o2);
Node* n3 = new Node(s3, o3);
Node* n4 = new Node(o1, s1);
Node* n5 = new Node(o2, s2);
Node* n6 = new Node(o3, s3);
Map* m1 = new Map();
//Test to check addElement
void test1(){
String* o1 = new String("Test");
String* o2 = new String("Value");
Node* n1 = new Node(o1, o2);
Map* m1 = new Map();
m1 -> addElement(n1);
}
//Tests to check node Constructor
void test2(){
String* o1 = new String("Test");
String* o2 = new String("Value");
Node* n1 = new Node(o1, o2);
Node* n2 = new Node();
}
//Tests Map Functions
void testAddElem(){
Map* m1 = new Map();
m1->addElement(n1);
m1->addElement(n2);
m1->addElement(n3);
t_true(m1->len_ == 3);
t_true(m1->isKeyIn(s1) == 1);
t_true(m1->isKeyIn(s2) == 1);
t_true(m1->isKeyIn(s3) == 1);
}
void testRemoveElem() {
Map* m1 = new Map();
m1->addElement(n1);
m1->addElement(n2);
m1->addElement(n3);
t_true(m1->len_ == 3);
m1->removeElement(s1);
t_true(m1->len == 2);
t_true(m1->isKeyIn(s1) == 0);
t_true(m1->isKeyIn(s2) == 1);
t_true(m1->isKeyIn(s3) == 1);
}
void testGetValue() {
Map* m1 = new Map();
m1->addElement(n1);
m1->addElement(n2);
m1->addElement(n3);
t_true(m1->getValue(s1) == o1);
t_true(m1->getValue(s2) == o2);
t_true(m1->getValue(s3) == o3);
}
int main(){
test1();
test2();
testAddElem();
testRemoveElem();
testGetValue();
}