aboutsummaryrefslogtreecommitdiffstatshomepage
path: root/node/splitnode.cpp
blob: 7c019101baaa7d25fbb607887c1e1a45fc40240b (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
/***************************************************************************
* Copyright (C) 2014 by Renaud Guezennec                                   *
* http://www.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 "splitnode.h"

SplitNode::SplitNode()
    : m_diceResult(new DiceResult())
{
    m_result = m_diceResult;
}
void SplitNode::run(ExecutionNode* previous)
{
    m_previousNode = previous;
    if(NULL!=previous)
    {
        m_result->setPrevious(previous->getResult());

        Result* tmpResult = previous->getResult();
        if(nullptr != tmpResult)
        {
            DiceResult* dice = dynamic_cast<DiceResult*>(tmpResult);
            if(nullptr!=dice)
            {
                for(Die* oldDie : dice->getResultList())
                {
                    oldDie->displayed();
                    m_diceResult->setOperator(oldDie->getOp());
                    for(qint64 value : oldDie->getListValue())
                    {
                        Die* tmpdie = new Die();
                        tmpdie->setFaces(oldDie->getFaces());
                        tmpdie->setValue(value);
                        tmpdie->setOp(oldDie->getOp());
                        m_diceResult->insertResult(tmpdie);
                    }
                 }
            }
        }
    }
    if(NULL!=m_nextNode)
    {
        m_nextNode->run(this);
    }
}

QString SplitNode::toString(bool withLabel) const
{
    if(withLabel)
    {
        return QString("%1 [label=\"SplitNode Node\"]").arg(m_id);
    }
    else
    {
        return m_id;
    }
}
qint64 SplitNode::getPriority() const
{
    qint64 priority=0;
    if(NULL!=m_nextNode)
    {
        priority = m_nextNode->getPriority();
    }
    return priority;
}
ExecutionNode* SplitNode::getCopy() const
{
    SplitNode* node = new SplitNode();
    if(NULL!=m_nextNode)
    {
        node->setNextNode(m_nextNode->getCopy());
    }
    return node;

}