-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathvisitor_test.h
125 lines (114 loc) · 3.58 KB
/
visitor_test.h
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
TEST(VisitorTest, longexpression){
Base* a = new Op(5);
Base* b = new Op(7);
Base* c = new Op(9);
Base* d = new Op(20);
Base* e = new Op(4);
Base* one = new Add(a,b);
Base* two = new Sub(one,c);
Base* three = new Mult(two,d);
Base* four = new Div(three,e);
Base* dummy = new Pow(four,a);
Iterator* it = new PreorderIterator(dummy);
it->first();
CountVisitor* visit = new CountVisitor();
while(it->is_done() == false){
Base* c = it->current();
c->accept(visit);
it->next();
}
EXPECT_EQ(visit->add_count(),1);
EXPECT_EQ(visit->sub_count(),1);
EXPECT_EQ(visit->mult_count(),1);
EXPECT_EQ(visit->div_count(),1);
}
TEST(VisitorTest, longexpressionpt2){
Base* a = new Op(5);
Base* b = new Op(7);
Base* c = new Op(9);
Base* d = new Op(20);
Base* e = new Op(4);
Base* one = new Add(a,b);
Base* two = new Add(one,c);
Base* three = new Mult(two,one);
Base* four = new Mult(three,e);
Base* five = new Sub(four,d);
Base* six = new Div(five,a);
Base* dummy = new Pow(six,a);
Iterator* it = new PreorderIterator(dummy);
it->first();
CountVisitor* visit = new CountVisitor();
while(it->is_done() == false){
Base* c = it->current();
c->accept(visit);
it->next();
}
EXPECT_EQ(visit->add_count(),3);
EXPECT_EQ(visit->sub_count(),1);
EXPECT_EQ(visit->mult_count(),2);
EXPECT_EQ(visit->div_count(),1);
}
TEST(VisitorTest, longexpressionpt3){
Base* a = new Op(5);
Base* b = new Op(7);
Base* c = new Op(9);
Base* d = new Op(20);
Base* e = new Op(4);
Base* f = new Op(2);
Base* one = new Add(a,b);
Base* two = new Sub(one,c);
Base* three = new Mult(two,one);
Base* four = new Mult(three,e);
Base* five = new Sub(four,d);
Base* six = new Div(five,a);
Base* seven = new Pow(six,f);
Base* dummy = new Pow(seven,a);
Iterator* it = new PreorderIterator(dummy);
it->first();
CountVisitor* visit = new CountVisitor();
while(it->is_done() == false){
Base* c = it->current();
c->accept(visit);
it->next();
}
EXPECT_EQ(visit->add_count(),2);
EXPECT_EQ(visit->sub_count(),2);
EXPECT_EQ(visit->mult_count(),2);
EXPECT_EQ(visit->div_count(),1);
EXPECT_EQ(visit->pow_count(),1);
}
TEST(VisitorTest, longexpressionpt4){
Base* a = new Op(5);
Base* b = new Op(7);
Base* c = new Op(9);
Base* d = new Op(20);
Base* e = new Op(4);
Base* f = new Op(9);
Base* g = new Op(2);
Base* zero = new Rand();
Base* one = new Add(zero,b);
Base* two = new Add(one,c);
Base* three = new Mult(two,one);
Base* four = new Mult(three,e);
Base* five = new Sub(four,d);
Base* six = new Div(five,a);
Base* seven = new Pow(six,three);
Base* eight = new Div(seven,f);
Base* nine = new Sub(eight,g);
Base* ten = new Pow(nine,six);
Base* dummy = new Pow(ten,a);
Iterator* it = new PreorderIterator(dummy);
it->first();
CountVisitor* visit = new CountVisitor();
while(it->is_done() == false){
Base* c = it->current();
c->accept(visit);
it->next();
}
EXPECT_EQ(visit->add_count(),9);
EXPECT_EQ(visit->sub_count(),3);
EXPECT_EQ(visit->mult_count(),5);
EXPECT_EQ(visit->div_count(),3);
EXPECT_EQ(visit->pow_count(),2);
EXPECT_EQ(visit->rand_count(),6);
}