blob: 1cf60627d131afcc409807514d168d62d0b368f4 (
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
127
|
/***************************************************************************
* 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 "mergenode.h"
MergeNode::MergeNode()
: m_diceResult(new DiceResult())
{
m_result = m_diceResult;
}
void MergeNode::run(ExecutionNode* previous)
{
m_previousNode = previous;
m_result->setPrevious(previous->getResult());
ExecutionNode* previousLast =nullptr;
for(auto start : *m_startList)
{
ExecutionNode* last = getLatestNode(start);
if(nullptr!=last)
{
if(nullptr != previousLast)
{
auto startResult = start->getResult();
startResult->setPrevious(previousLast->getResult());
previousLast->setNextNode(start);
}
previousLast = last;
Result* tmpResult = last->getResult();
while(nullptr!=tmpResult)
{
DiceResult* dice = dynamic_cast<DiceResult*>(tmpResult);
if(nullptr!=dice)
{
///@todo improve here to set homogeneous while is really
m_diceResult->setHomogeneous(false);
for(Die* die : dice->getResultList())
{
if(!m_diceResult->getResultList().contains(die)&&(!die->hasBeenDisplayed()))
{
Die* tmpdie = new Die();
*tmpdie=*die;
die->displayed();
m_diceResult->getResultList().append(tmpdie);
}
}
}
tmpResult = tmpResult->getPrevious();
}
}
}
auto first = m_startList->first();
m_startList->clear();
m_startList->append(first);
if(nullptr!=m_nextNode)
{
m_nextNode->run(this);
}
}
ExecutionNode* MergeNode::getLatestNode(ExecutionNode* node)
{
ExecutionNode* next = node;
while(nullptr != next->getNextNode() && (next->getNextNode()!=this))
{
next = next->getNextNode();
}
return next;
}
QString MergeNode::toString(bool withLabel) const
{
if(withLabel)
{
return QString("%1 [label=\"Merge Node\"]").arg(m_id);
}
else
{
return m_id;
}
}
qint64 MergeNode::getPriority() const
{
qint64 priority=0;
if(NULL!=m_nextNode)
{
priority = m_nextNode->getPriority();
}
return priority;
}
ExecutionNode* MergeNode::getCopy() const
{
MergeNode* node = new MergeNode();
if(NULL!=m_nextNode)
{
node->setNextNode(m_nextNode->getCopy());
}
return node;
}
QList<ExecutionNode *>* MergeNode::getStartList() const
{
return m_startList;
}
void MergeNode::setStartList(QList<ExecutionNode *>* startList)
{
m_startList = startList;
}
|