node/countexecutenode.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

#include "countexecutenode.h"
#include "result/diceresult.h"
#include "validatorlist.h"

CountExecuteNode::CountExecuteNode() : m_scalarResult(new ScalarResult()), m_validatorList(nullptr)
{
    m_result= m_scalarResult;
}
void CountExecuteNode::setValidatorList(ValidatorList* validatorlist)
{
    m_validatorList= validatorlist;
}
CountExecuteNode::~CountExecuteNode()
{
    if(nullptr != m_validatorList)
    {
        delete m_validatorList;
    }
}

void CountExecuteNode::run(ExecutionNode* previous)
{
    m_previousNode= previous;
    if(nullptr == previous)
    {
        m_errors.insert(Dice::ERROR_CODE::NO_PREVIOUS_ERROR, QStringLiteral("No scalar result before Swith/Case operator"));
        return;
    }
    DiceResult* previousResult= dynamic_cast<DiceResult*>(previous->getResult());
    if(nullptr != previousResult)
    {
        m_result->setPrevious(previousResult);
        qint64 sum= 0;
        std::function<void(Die*, qint64)> f= [&sum](const Die*, qint64 score) { sum+= score; };
        m_validatorList->validResult(previousResult, true, true, f);
        m_scalarResult->setValue(sum);
        if(nullptr != m_nextNode)
        {
            m_nextNode->run(this);
        }
    }
}
QString CountExecuteNode::toString(bool withlabel) const
{
    if(withlabel)
    {
        return QString("%1 [label=\"CountExecuteNode %2\"]").arg(m_id, m_validatorList->toString());
    }
    else
    {
        return m_id;
    }
}
qint64 CountExecuteNode::getPriority() const
{
    qint64 priority= 0;
    if(nullptr != m_previousNode)
    {
        priority= m_previousNode->getPriority();
    }
    return priority;
}

ExecutionNode* CountExecuteNode::getCopy() const
{
    CountExecuteNode* node= new CountExecuteNode();
    if(nullptr != m_validatorList)
    {
        node->setValidatorList(m_validatorList->getCopy());
    }
    if(nullptr != m_nextNode)
    {
        node->setNextNode(m_nextNode->getCopy());
    }
    return node;
}