blob: 09e88bd612a01087dc85b7390cc3d95a4c4b658b (
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
|
/***************************************************************************
* Copyright (C) 2019 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 "node/repeaternode.h"
#include "diceparserhelper.h"
#include "executionnode.h"
#include "parsingtoolbox.h"
#include "result/stringresult.h"
RepeaterNode::RepeaterNode() {}
void RepeaterNode::run(ExecutionNode* previousNode)
{
m_previousNode= previousNode;
m_times->run(this);
m_times= ParsingToolBox::getLeafNode(m_times);
auto times= m_times->getResult();
auto timeCount= times->getResult(Dice::RESULT_TYPE::SCALAR).toInt();
auto cmd= m_cmd->getCopy();
for(int i= 0; i < timeCount; ++i)
{
m_cmd->run(this);
auto end= ParsingToolBox::getLeafNode(cmd);
auto result= end->getResult();
if(nullptr == result)
continue;
if(result->hasResultOfType(Dice::RESULT_TYPE::SCALAR))
{
if(m_sumAll)
{
auto res= new ScalarResult();
m_result= res;
}
else
{
auto res= new StringResult();
m_result= res;
}
}
else if(result->hasResultOfType(Dice::RESULT_TYPE::STRING))
{
auto res= new StringResult();
m_result= res;
}
else if(result->hasResultOfType(Dice::RESULT_TYPE::DICE_LIST))
{
if(m_sumAll)
{
auto res= new ScalarResult();
m_result= res;
}
else
{
auto res= new StringResult();
m_result= res;
}
}
cmd= m_cmd->getCopy();
}
}
QString RepeaterNode::toString(bool withLabel) const
{
return withLabel ? QStringLiteral("") : QStringLiteral("");
}
qint64 RepeaterNode::getPriority() const
{
return 4;
}
ExecutionNode* RepeaterNode::getCopy() const
{
return nullptr;
}
void RepeaterNode::setCommand(ExecutionNode* cmd)
{
m_cmd.reset(cmd);
}
void RepeaterNode::setTimeNode(ExecutionNode* time)
{
m_times= time;
}
void RepeaterNode::setSumAll(bool b)
{
m_sumAll= b;
}
|