blob: 3a683dbfa13e4c60c809369facdab0d72f92528d (
plain) (
blame)
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
|
/***************************************************************************
* Copyright (C) 2014 by Renaud Guezennec *
* http://www.rolisteam.org/contact *
* *
* This file is part of DiceParser *
* *
* DiceParser is free software; you can redistribute it and/or modify *
* it under the terms of the GNU General Public License as published by *
* the Free Software Foundation; either version 2 of the License, or *
* (at your option) any later version. *
* *
* This program is distributed in the hope that it will be useful, *
* but WITHOUT ANY WARRANTY; without even the implied warranty of *
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the *
* GNU General Public License for more details. *
* *
* You should have received a copy of the GNU General Public License *
* along with this program; if not, write to the *
* Free Software Foundation, Inc., *
* 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA. *
***************************************************************************/
#include "parenthesesnode.h"
ParenthesesNode::ParenthesesNode()
: m_internalNode(nullptr)
{
}
void ParenthesesNode::setInternelNode(ExecutionNode* node)
{
m_internalNode = node;
}
void ParenthesesNode::run(ExecutionNode* /*previous*/)
{
m_previousNode = nullptr;
if(nullptr!=m_internalNode)
{
m_internalNode->run(this);
ExecutionNode* temp=m_internalNode;
while(nullptr!=temp->getNextNode())
{
temp=temp->getNextNode();
}
m_result = temp->getResult();
}
if(nullptr!=m_nextNode)
{
m_nextNode->run(this);
}
}
QString ParenthesesNode::toString(bool b) const
{
if(b)
{
return QString("%1 [label=\"ParenthesesNode\"]").arg(m_id);
}
else
{
return m_id;
}
}
qint64 ParenthesesNode::getPriority() const
{
qint64 priority=3;
return priority;
}
ExecutionNode* ParenthesesNode::getCopy() const
{
ParenthesesNode* node = new ParenthesesNode();
if(nullptr!=m_internalNode)
{
node->setInternelNode(m_internalNode->getCopy());
}
if(nullptr!=m_nextNode)
{
node->setNextNode(m_nextNode->getCopy());
}
return node;
}
void ParenthesesNode::generateDotTree(QString & s)
{
s.append(toString(true));
s.append(";\n");
if(nullptr != m_internalNode)
{
s.append(toString(false));
s.append(" -> ");
s.append(m_internalNode->toString(false));
s.append("[label=\"internal\"];\n");
m_internalNode->generateDotTree(s);
}
if(nullptr!=m_nextNode)
{
s.append(toString(false));
s.append(" -> ");
s.append(m_nextNode->toString(false));
s.append("[label=\"next\"];\n");
// s.append(" [label=\"nextNode\"];\n");
m_nextNode->generateDotTree(s);
}
else
{
s.append(toString(false));
s.append(" -> ");
s.append("nullptr;\n");
}
if(nullptr!=m_result)
{
s.append(toString(false));
s.append(" ->");
s.append(m_result->toString(false));
s.append(" [label=\"Result\", style=\"dashed\"];\n");
if(nullptr == m_nextNode)
m_result->generateDotTree(s);
}
}
|