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
139
140
141
142
143
144
145
146
147
148
149
150
151
152
|
/***************************************************************************
* Copyright (C) 2021 by Renaud Guezennec *
* http://www.rolisteam.org/contact *
* *
* This software 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 "switchcasenode.h"
#include "parsingtoolbox.h"
#include "stringresult.h"
#include <QDebug>
SwitchCaseNode::SwitchCaseNode() : m_stringResult(new StringResult)
{
m_result= m_stringResult;
}
void SwitchCaseNode::setStopAtFirt(bool b)
{
m_stopAtFirst= b;
}
void SwitchCaseNode::run(ExecutionNode* previous)
{
m_previousNode= previous;
if(nullptr == previous)
{
m_errors.insert(Dice::ERROR_CODE::NO_PREVIOUS_ERROR,
QStringLiteral("No previous node before Switch/Case operator"));
return;
}
auto previousResult= previous->getResult();
m_result->setPrevious(previousResult);
if(nullptr == previousResult
|| (!previousResult->hasResultOfType(Dice::RESULT_TYPE::SCALAR)
&& !previousResult->hasResultOfType(Dice::RESULT_TYPE::DICE_LIST)))
{
m_errors.insert(Dice::ERROR_CODE::NO_VALID_RESULT,
QStringLiteral("No scalar or dice result before Switch/Case operator"));
return;
}
QList<Die*> dieList;
if(previousResult->hasResultOfType(Dice::RESULT_TYPE::DICE_LIST))
{
auto diceResult= dynamic_cast<DiceResult*>(previousResult);
if(diceResult)
dieList.append(diceResult->getResultList());
}
else if(previousResult->hasResultOfType(Dice::RESULT_TYPE::SCALAR))
{
auto resultScalar= previousResult->getResult(Dice::RESULT_TYPE::SCALAR).toReal();
auto d= new Die();
d->insertRollValue(resultScalar);
dieList.append(d);
}
for(auto die : dieList)
{
QStringList resultList;
for(auto const& info : qAsConst(m_branchList))
{
if(info->validatorList)
{
auto res= info->validatorList->hasValid(die, true, true);
if(!res)
continue;
}
else if(!resultList.isEmpty())
break;
info->node->run(m_previousNode);
auto lastNode= ParsingToolBox::getLeafNode(info->node);
if(lastNode && lastNode->getResult())
{
resultList << lastNode->getResult()->getStringResult();
}
else
resultList << QString();
if(m_stopAtFirst)
break;
}
for(auto const& str : qAsConst(resultList))
m_stringResult->addText(str);
}
if(m_stringResult->getText().isEmpty())
m_errors.insert(Dice::ERROR_CODE::NO_VALID_RESULT, QStringLiteral("No value fits the Switch/Case operator"));
if(nullptr != m_nextNode)
{
m_nextNode->run(this);
}
}
QString SwitchCaseNode::toString(bool withLabel) const
{
if(withLabel)
{
return QString("%1 [label=\"SwitchCaseNode\"]").arg(m_id);
}
else
{
return m_id;
}
}
qint64 SwitchCaseNode::getPriority() const
{
qint64 priority= 0;
if(nullptr != m_previousNode)
{
priority= m_previousNode->getPriority();
}
return priority;
}
ExecutionNode* SwitchCaseNode::getCopy() const
{
SwitchCaseNode* node= new SwitchCaseNode();
for(auto const& info : qAsConst(m_branchList))
{
node->insertCase(info->node, info->validatorList);
}
if(nullptr != m_nextNode)
{
node->setNextNode(m_nextNode->getCopy());
}
return node;
}
void SwitchCaseNode::insertCase(ExecutionNode* node, ValidatorList* validator)
{
std::unique_ptr<Dice::CaseInfo> info(new Dice::CaseInfo{validator, node});
m_branchList.push_back(std::move(info));
}
|