diff options
Diffstat (limited to 'node/bind.cpp')
| -rw-r--r-- | node/bind.cpp | 87 |
1 files changed, 43 insertions, 44 deletions
diff --git a/node/bind.cpp b/node/bind.cpp index 9598c45..6695166 100644 --- a/node/bind.cpp +++ b/node/bind.cpp @@ -1,76 +1,75 @@ /*************************************************************************** -* 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 "bind.h" -BindNode::BindNode() - : m_diceResult(new DiceResult()) +BindNode::BindNode() : m_diceResult(new DiceResult()) { - m_result = m_diceResult; + m_result= m_diceResult; } void BindNode::run(ExecutionNode* previous) { - m_previousNode = previous; + m_previousNode= previous; if(nullptr == m_previousNode) return; m_result->setPrevious(previous->getResult()); for(auto start : *m_startList) { - ExecutionNode* last = getLatestNode(start); - if(nullptr!=last) + ExecutionNode* last= getLatestNode(start); + if(nullptr != last) { - auto tmpResult = last->getResult(); - while(nullptr!=tmpResult) + auto tmpResult= last->getResult(); + while(nullptr != tmpResult) { - DiceResult* dice = dynamic_cast<DiceResult*>(tmpResult); - if(nullptr!=dice) + DiceResult* dice= dynamic_cast<DiceResult*>(tmpResult); + if(nullptr != dice) { m_diceResult->setHomogeneous(false); for(auto& die : dice->getResultList()) { if(!die->hasBeenDisplayed()) { - Die* tmpdie = new Die(*die); + Die* tmpdie= new Die(*die); die->displayed(); m_diceResult->getResultList().append(tmpdie); } } } - tmpResult = tmpResult->getPrevious(); + tmpResult= tmpResult->getPrevious(); } } } - if(nullptr!=m_nextNode) + if(nullptr != m_nextNode) { m_nextNode->run(this); } } ExecutionNode* BindNode::getLatestNode(ExecutionNode* node) { - ExecutionNode* next = node; - while(nullptr != next->getNextNode() && (next->getNextNode()!=this)) + ExecutionNode* next= node; + while(nullptr != next->getNextNode() && (next->getNextNode() != this)) { - next = next->getNextNode(); + next= next->getNextNode(); } return next; } @@ -87,29 +86,29 @@ QString BindNode::toString(bool withLabel) const } qint64 BindNode::getPriority() const { - qint64 priority=0; - if(nullptr!=m_previousNode) + qint64 priority= 0; + if(nullptr != m_previousNode) { - priority = m_previousNode->getPriority(); + priority= m_previousNode->getPriority(); } return priority; } ExecutionNode* BindNode::getCopy() const { - BindNode* node = new BindNode(); - if(nullptr!=m_nextNode) + BindNode* node= new BindNode(); + if(nullptr != m_nextNode) { node->setNextNode(m_nextNode->getCopy()); } return node; } -std::vector<ExecutionNode *>* BindNode::getStartList() const +std::vector<ExecutionNode*>* BindNode::getStartList() const { return m_startList; } -void BindNode::setStartList(std::vector<ExecutionNode *>* startList) +void BindNode::setStartList(std::vector<ExecutionNode*>* startList) { - m_startList = startList; + m_startList= startList; } |