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
|
/***************************************************************************
* Copyright (C) 2014 by Renaud Guezennec *
* https://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 "uniquenode.h"
UniqueNode::UniqueNode() : ExecutionNode("%1 [label=\"UniqueNode Node\"]"), m_diceResult(new DiceResult())
{
m_result= m_diceResult;
}
void UniqueNode::run(ExecutionNode* previous)
{
if(isValid(!previous, Dice::ERROR_CODE::NO_PREVIOUS_ERROR, tr("No Previous node")))
return;
m_previousNode= previous;
m_result->setPrevious(previous->getResult());
Result* tmpResult= previous->getResult();
if(isValid(!tmpResult, Dice::ERROR_CODE::NO_VALID_RESULT, tr("No Valid result")))
return;
DiceResult* dice= dynamic_cast<DiceResult*>(tmpResult);
if(isValid(!dice, Dice::ERROR_CODE::NO_VALID_RESULT, tr("No Valid dice result")))
return;
auto const& resultList= dice->getResultList();
std::vector<qint64> formerValues;
formerValues.reserve(resultList.size());
for(auto& oldDie : resultList)
{
auto value= oldDie->getValue();
auto it= std::find(formerValues.begin(), formerValues.end(), value);
if(it == formerValues.end())
{
auto die= new Die(*oldDie);
m_diceResult->insertResult(die);
formerValues.push_back(value);
}
oldDie->displayed();
}
}
qint64 UniqueNode::getPriority() const
{
qint64 priority= 0;
if(nullptr != m_nextNode)
{
priority= m_nextNode->getPriority();
}
return priority;
}
ExecutionNode* UniqueNode::getCopy() const
{
UniqueNode* node= new UniqueNode();
if(nullptr != m_nextNode)
{
node->setNextNode(m_nextNode->getCopy());
}
return node;
}
|