blob: 0fa41ad481cd90f0ef8f0ba4e33d77ce12f0119c (
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
|
#include "tree.h"
#include "exceptions.h"
#include <sstream>
#include <limits>
namespace SimpleParser {
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;
out << "{" << std::endl;
out << "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();
}
} // SimpleParser
|
