diff options
Diffstat (limited to 'node')
| -rw-r--r-- | node/bind.cpp | 112 | ||||
| -rw-r--r-- | node/bind.h | 50 |
2 files changed, 162 insertions, 0 deletions
diff --git a/node/bind.cpp b/node/bind.cpp new file mode 100644 index 0000000..8868485 --- /dev/null +++ b/node/bind.cpp @@ -0,0 +1,112 @@ +/*************************************************************************** +* 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()) +{ + m_result = m_diceResult; +} +void BindNode::run(ExecutionNode* previous) +{ + m_previousNode = previous; + m_result->setPrevious(previous->getResult()); + for(auto start : *m_startList) + { + ExecutionNode* last = getLatestNode(start); + if(nullptr!=last) + { + auto tmpResult = last->getResult(); + while(nullptr!=tmpResult) + { + DiceResult* dice = dynamic_cast<DiceResult*>(tmpResult); + if(nullptr!=dice) + { + m_diceResult->setHomogeneous(false); + for(Die* die : dice->getResultList()) + { + if(!die->hasBeenDisplayed()) + { + Die* tmpdie = new Die(*die); + die->displayed(); + m_diceResult->getResultList().append(tmpdie); + } + } + } + tmpResult = tmpResult->getPrevious(); + } + } + } + + if(nullptr!=m_nextNode) + { + m_nextNode->run(this); + } +} +ExecutionNode* BindNode::getLatestNode(ExecutionNode* node) +{ + ExecutionNode* next = node; + while(nullptr != next->getNextNode() && (next->getNextNode()!=this)) + { + next = next->getNextNode(); + } + return next; +} +QString BindNode::toString(bool withLabel) const +{ + if(withLabel) + { + return QString("%1 [label=\"Bind Node\"]").arg(m_id); + } + else + { + return m_id; + } +} +qint64 BindNode::getPriority() const +{ + qint64 priority=0; + if(nullptr!=m_previousNode) + { + priority = m_previousNode->getPriority(); + } + return priority; +} +ExecutionNode* BindNode::getCopy() const +{ + BindNode* node = new BindNode(); + if(nullptr!=m_nextNode) + { + node->setNextNode(m_nextNode->getCopy()); + } + return node; +} + +std::vector<ExecutionNode *>* BindNode::getStartList() const +{ + return m_startList; +} + +void BindNode::setStartList(std::vector<ExecutionNode *>* startList) +{ + m_startList = startList; +} diff --git a/node/bind.h b/node/bind.h new file mode 100644 index 0000000..b960e3f --- /dev/null +++ b/node/bind.h @@ -0,0 +1,50 @@ +/*************************************************************************** +* 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. * +***************************************************************************/ +#ifndef BINDNODE_H +#define BINDNODE_H + +#include "node/executionnode.h" +#include "result/diceresult.h" + +/** + * @brief The MergeNode class is an ExecutionNode. It is dedicated to merge result of several commands. + */ +class BindNode : public ExecutionNode +{ +public: + BindNode(); + void run(ExecutionNode* previous); + virtual QString toString(bool withLabel)const; + virtual qint64 getPriority() const; + virtual ExecutionNode *getCopy() const; + std::vector<ExecutionNode *>* getStartList() const; + void setStartList(std::vector<ExecutionNode *>* startList); + +private: + ExecutionNode *getLatestNode(ExecutionNode *node); + +private: + DiceResult* m_diceResult; + std::vector<ExecutionNode *>* m_startList; +}; + +#endif // NUMBERNODE_H |