aboutsummaryrefslogtreecommitdiffstatshomepage
path: root/node/ifnode.cpp
blob: 80e52641fd77d75248abb1c0098a174d8f1a96b8 (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
/***************************************************************************
    *   Copyright (C) 2016 by Renaud Guezennec                                *
    *   http://renaudguezennec.homelinux.org/accueil,3.html                   *
    *                                                                         *
    *   rolisteam 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 "ifnode.h"
#include "result/diceresult.h"

IfNode::IfNode()
{
    m_result = new DiceResult();
}

IfNode::~IfNode()
{

}

void IfNode::run(ExecutionNode *previous)
{
    m_previousNode = previous;
    if(NULL==previous)
    {
        return;
    }
    Result* previousResult = previous->getResult();
    DiceResult* previousDiceResult = dynamic_cast<DiceResult*>(previousResult);

    if(NULL!=previousDiceResult)
    {
        qreal value = previousResult->getResult(Result::SCALAR).toReal();
        QList<Die*> diceList=previousDiceResult->getResultList();
        if(NULL!=m_validator)
        {
            if(!diceList.isEmpty())
            {
                foreach(Die* dice,diceList)
                {
                    m_validator->hasValid(dice,true,true);
                }
            }
            else
            {
                Die* dice = new Die();
                dice->setValue(value);
                dice->setFaces(value);
                m_validator->hasValid(dice,true,true);
            }
        }
    }

    if(NULL!=m_nextNode)
    {
        m_nextNode->run(this);
    }
}

void IfNode::setValidator(Validator* val)
{
       m_validator = val;
}
void IfNode::setInstructionTrue(ExecutionNode* node)
{
    m_true = node;
}

void IfNode::setInstructionFalse(ExecutionNode* node)
{
    m_false = node;
}

QString IfNode::toString(bool) const
{

}

qint64 IfNode::getPriority() const
{
    return 4;
}