blob: ee45e5785b0bf300d09627d40bd51cc0b324ff07 (
plain)
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
|
#include "tree.h"
#include <math.h>
Node::Node()
{
}
double Node::solve()
{
switch (this->type) {
case OPERAND_NODE: {
OperandNode *tmp = static_cast<OperandNode*>( this );
return tmp->solve();
}
case OPERATOR_NODE: {
OperatorNode *tmp = static_cast<OperatorNode*>( this );
return tmp->solve();
}
}
}
OperandNode::OperandNode()
{
this->type = OPERAND_NODE;
}
double OperandNode::solve()
{
return this->value;
}
OperatorNode::OperatorNode()
{
this->type = OPERATOR_NODE;
}
double OperatorNode::solve()
{
switch (this->function) {
case '*':
return this->leftChild->solve() * this->rightChild->solve();
case '/': {
double rightChild = this->rightChild->solve();
if ( rightChild != 0 ) {
return this->leftChild->solve() / rightChild;
}
else {
throw divide_exception();
}
}
case '+':
return this->leftChild->solve() + this->rightChild->solve();
case '-':
return this->leftChild->solve() - this->rightChild->solve();
case '^':
return pow( this->leftChild->solve(), this->rightChild->solve() );
}
}
Tree::Tree()
{
this->nodeCollection = new vector<Node*>();
}
Node* Tree::addOperand(Node **place, double value)
{
OperandNode *newNode = new OperandNode();
newNode = new OperandNode();
newNode->value = value;
this->nodeCollection->push_back( newNode );
if (place != NULL) {
*place = this->nodeCollection->back();
}
return newNode;
}
Node* Tree::addOperator(Node **place, char oper)
{
OperatorNode *newNode = new OperatorNode();
newNode = new OperatorNode();
newNode->function = oper;
this->nodeCollection->push_back( newNode );
if (place != NULL) {
*place = this->nodeCollection->back();
}
return newNode;
}
string Tree::print(string term)
{
std::stringstream out;
out << "digraph \"" << term << "\"" << endl << "{" << endl << "node [shape = box];" << endl;
int i = 0;
for ( vector<Node*>::iterator it = this->nodeCollection->begin(); it != this->nodeCollection->end(); ++it ) {
switch ( (*it)->type ) {
case OPERAND_NODE: {
OperandNode *tmp = static_cast<OperandNode*>( *it );
out << "node" << i << " [ label = \"" << tmp->value << "\"];" << endl;
break;
}
case OPERATOR_NODE: {
OperatorNode *tmp = static_cast<OperatorNode*>( *it );
out << "node" << i << " [ label = \"" << tmp->function << "\"];" << endl;
for ( vector<Node*>::iterator iter = this->nodeCollection->begin(); iter != this->nodeCollection->end(); ++iter ) {
if ( *iter == (*it)->leftChild ) {
out << "\"node" << i << "\" -> \"node" << (iter - this->nodeCollection->begin()) << "\";" << endl;
}
if ( *iter == (*it)->rightChild ) {
out << "\"node" << i << "\" -> \"node" << (iter - this->nodeCollection->begin()) << "\";" << endl;
}
}
break;
}
}
i++;
}
out << "}" << endl;
return out.str();
}
|
