diff options
| author | 2019-02-12 23:59:24 +0100 | |
|---|---|---|
| committer | 2019-02-12 23:59:24 +0100 | |
| commit | f2051fb35b1ad49c4d940e6fbba2acc98b216e13 (patch) | |
| tree | 03117f493191d35104ac37eba72e916d41c849f2 /node/splitnode.cpp | |
| parent | 210a222b894caa3c8af38ccb6653db0fd8491f6e (diff) | |
| download | OneRoll-f2051fb35b1ad49c4d940e6fbba2acc98b216e13.tar.gz OneRoll-f2051fb35b1ad49c4d940e6fbba2acc98b216e13.zip | |
clang format
Diffstat (limited to 'node/splitnode.cpp')
| -rw-r--r-- | node/splitnode.cpp | 72 |
1 files changed, 35 insertions, 37 deletions
diff --git a/node/splitnode.cpp b/node/splitnode.cpp index 4ef9c8c..2e3e739 100644 --- a/node/splitnode.cpp +++ b/node/splitnode.cpp @@ -1,43 +1,42 @@ /*************************************************************************** -* 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. * -***************************************************************************/ + * 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()) +SplitNode::SplitNode() : m_diceResult(new DiceResult()) { - m_result = m_diceResult; + m_result= m_diceResult; } void SplitNode::run(ExecutionNode* previous) { - m_previousNode = previous; - if(nullptr!=previous) + m_previousNode= previous; + if(nullptr != previous) { m_result->setPrevious(previous->getResult()); - Result* tmpResult = previous->getResult(); + Result* tmpResult= previous->getResult(); if(nullptr != tmpResult) { - DiceResult* dice = dynamic_cast<DiceResult*>(tmpResult); - if(nullptr!=dice) + DiceResult* dice= dynamic_cast<DiceResult*>(tmpResult); + if(nullptr != dice) { for(auto& oldDie : dice->getResultList()) { @@ -45,7 +44,7 @@ void SplitNode::run(ExecutionNode* previous) m_diceResult->setOperator(oldDie->getOp()); for(qint64& value : oldDie->getListValue()) { - Die* tmpdie = new Die(); + Die* tmpdie= new Die(); tmpdie->insertRollValue(value); tmpdie->setBase(oldDie->getBase()); tmpdie->setMaxValue(oldDie->getMaxValue()); @@ -53,11 +52,11 @@ void SplitNode::run(ExecutionNode* previous) tmpdie->setOp(oldDie->getOp()); m_diceResult->insertResult(tmpdie); } - } + } } } } - if(nullptr!=m_nextNode) + if(nullptr != m_nextNode) { m_nextNode->run(this); } @@ -76,20 +75,19 @@ QString SplitNode::toString(bool withLabel) const } qint64 SplitNode::getPriority() const { - qint64 priority=0; - if(nullptr!=m_nextNode) + qint64 priority= 0; + if(nullptr != m_nextNode) { - priority = m_nextNode->getPriority(); + priority= m_nextNode->getPriority(); } return priority; } ExecutionNode* SplitNode::getCopy() const { - SplitNode* node = new SplitNode(); - if(nullptr!=m_nextNode) + SplitNode* node= new SplitNode(); + if(nullptr != m_nextNode) { node->setNextNode(m_nextNode->getCopy()); } return node; - } |