blob: c8f0aaccdbaf85f3e8499e6ad5056368fdf76147 (
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
|
#include "tree.h"
#include <limits>
namespace SimpleParser {
OperandNode::OperandNode(double val) {
this->value_ = val;
}
double OperandNode::solve() {
return this->value_;
}
NodeType OperandNode::getType() {
return OPERAND_NODE;
}
std::string OperandNode::print() {
std::stringstream convertStream;
convertStream.precision(std::numeric_limits<double>::digits10);
convertStream << this->value_;
return convertStream.str();
}
OperatorNode::OperatorNode(char op) {
this->function_ = op;
}
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 std::pow( this->leftChild->solve(), this->rightChild->solve() );
}
}
NodeType OperatorNode::getType() {
return OPERATOR_NODE;
}
std::string OperatorNode::print() {
return std::string(1, this->function_);
}
char OperatorNode::getFunction() {
return this->function_;
}
void Tree::setRoot(Node* root) {
this->root_node_ = root;
}
double Tree::solve() {
return this->root_node_->solve();
}
Node* Tree::addOperand(Node** place, double value) {
this->node_collection_.emplace_back(new OperandNode(value));
if ( place != nullptr ) {
*place = this->node_collection_.back().get();
}
return this->node_collection_.back().get();
}
Node* Tree::addOperator(Node** place, char oper) {
this->node_collection_.emplace_back(new OperatorNode(oper));
if ( place != nullptr ) {
*place = this->node_collection_.back().get();
}
return this->node_collection_.back().get();
}
std::string Tree::print(std::string term) {
std::stringstream out;
out.precision(std::numeric_limits<double>::digits10);
out << "digraph \"" << term << "\"" << std::endl
<< "{" << std::endl
<< "node [shape = box];" << std::endl;
int i = 0;
for ( auto it = this->node_collection_.begin(); it != this->node_collection_.end(); ++it ) {
out << "node" << i << " [ label = \"" << (*it)->print() << "\"];" << std::endl;
if ( (*it)->getType() == OPERATOR_NODE ) {
for ( auto iter = this->node_collection_.begin(); iter != this->node_collection_.end(); ++iter ) {
if ( (*iter).get() == (*it)->leftChild ) {
out << "\"node" << i << "\" -> \"node" << (iter - this->node_collection_.begin()) << "\";" << std::endl;
}
if ( (*iter).get() == (*it)->rightChild ) {
out << "\"node" << i << "\" -> \"node" << (iter - this->node_collection_.begin()) << "\";" << std::endl;
}
}
}
i++;
}
out << "}" << std::endl;
return out.str();
}
}
|
