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
|
#include "dicerollernode.h"
#include "die.h"
#include <QDebug>
#include <QThread>
#include <QThreadPool>
#include <QTime>
DiceRollerNode::DiceRollerNode(qint64 max, qint64 min)
: m_max(max), m_diceResult(new DiceResult()), m_min(min), m_operator(Dice::ArithmeticOperator::PLUS)
{
m_result= m_diceResult;
}
void DiceRollerNode::run(ExecutionNode* previous)
{
m_previousNode= previous;
if(isValid(!previous, Dice::ERROR_CODE::NO_PREVIOUS_ERROR, QObject::tr("No Previous node")))
return;
Result* result= previous->getResult();
if(isValid(!result, Dice::ERROR_CODE::NO_VALID_RESULT, QObject::tr("No result from previous node")))
return;
auto num= result->getResult(Dice::RESULT_TYPE::SCALAR).toReal();
isValid(num <= 0, Dice::ERROR_CODE::NO_DICE_TO_ROLL, QObject::tr("No dice to roll"));
m_diceCount= num > 0 ? static_cast<quint64>(num) : 0;
m_result->setPrevious(result);
auto possibleValue= static_cast<quint64>(std::abs((m_max - m_min) + 1));
if(isValid(possibleValue < m_diceCount && m_unique, Dice::ERROR_CODE::TOO_MANY_DICE,
QObject::tr("More unique values asked than possible values (D operator)")))
return;
for(quint64 i= 0; i < m_diceCount; ++i)
{
Die* die= new Die();
die->setOp(m_operator);
die->setBase(m_min);
die->setMaxValue(m_max);
die->roll();
if(m_unique)
{
const auto& equal= [](const Die* a, const Die* b) { return a->getValue() == b->getValue(); };
while(m_diceResult->contains(die, equal))
{
die->roll(false);
}
}
m_diceResult->insertResult(die);
}
/*if(nullptr != m_nextNode)
{TODO nextNode to null?
m_nextNode->run(this);
}*/
}
quint64 DiceRollerNode::getFaces() const
{
return static_cast<quint64>(std::abs(m_max - m_min) + 1);
}
std::pair<qint64, qint64> DiceRollerNode::getRange() const
{
return std::make_pair(m_min, m_max);
}
QString DiceRollerNode::toString(bool withlabel) const
{
return withlabel ? QString("%1 [label=\"DiceRollerNode faces: %2\"]").arg(m_id).arg(getFaces()) :
ExecutionNode::toString(withlabel);
}
qint64 DiceRollerNode::getPriority() const
{
qint64 priority= 4;
// if(nullptr!=m_nextNode)
// {
// priority = m_nextNode->getPriority();
// }
return priority;
}
ExecutionNode* DiceRollerNode::getCopy() const
{
DiceRollerNode* node= new DiceRollerNode(m_max, m_min);
if(nullptr != m_nextNode)
{
node->setNextNode(m_nextNode->getCopy());
}
return node;
}
Dice::ArithmeticOperator DiceRollerNode::getOperator() const
{
return m_operator;
}
void DiceRollerNode::setOperator(const Dice::ArithmeticOperator& dieOperator)
{
m_operator= dieOperator;
m_diceResult->setOperator(dieOperator);
}
bool DiceRollerNode::getUnique() const
{
return m_unique;
}
void DiceRollerNode::setUnique(bool unique)
{
m_unique= unique;
}
|