node/dicerollernode.cpp


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

#include "dicerollernode.h"
#include "die.h"


#include <QThread>
#include <QThreadPool>
#include <QDebug>
#include <QTime>


DiceRollerNode::DiceRollerNode(qint64 max,qint64 min)
    : m_max(max),m_diceResult(new DiceResult()),m_min(min),m_operator(Die::PLUS)
{
	m_result=m_diceResult;
}
void DiceRollerNode::run(ExecutionNode* previous)
{
    m_previousNode = previous;
    if(nullptr!=previous)
    {
        Result* result=previous->getResult();
        if(nullptr!=result)
        {
            m_diceCount = result->getResult(Result::SCALAR).toReal();
            m_result->setPrevious(result);

            if(m_diceCount == 0)
            {
                m_errors.insert(NO_DICE_TO_ROLL,QObject::tr("No dice to roll"));
            }
            auto possibleValue = static_cast<quint64>(abs((m_max-m_min)+1));
            //qDebug() << possibleValue;
            if( possibleValue < m_diceCount && m_unique)
            {
                m_errors.insert(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)
            {
                m_nextNode->run(this);
            }
        }
    }
}

quint64 DiceRollerNode::getFaces() const
{
    return abs(m_max-m_min)+1;
}
QString DiceRollerNode::toString(bool wl) const
{
	if(wl)
	{
            return QString("%1 [label=\"DiceRollerNode faces: %2\"]").arg(m_id).arg(getFaces());
	}
	else
	{
	    return m_id;
	}
}
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;
}

Die::ArithmeticOperator DiceRollerNode::getOperator() const
{
    return m_operator;
}

void DiceRollerNode::setOperator(const Die::ArithmeticOperator &dieOperator)
{
    m_operator = dieOperator;
    m_diceResult->setOperator(dieOperator);
}

bool DiceRollerNode::getUnique() const
{
    return m_unique;
}

void DiceRollerNode::setUnique(bool unique)
{
    m_unique = unique;
}