aboutsummaryrefslogtreecommitdiffstatshomepage
path: root/src/libparser/node/bind.cpp
diff options
context:
space:
mode:
authorRenaud G <renaud@rolisteam.org>2022-04-29 10:48:09 +0200
committerRenaud G <renaud@rolisteam.org>2022-04-29 10:48:09 +0200
commit07c5f6ec23fcf9237a24e71adcfacabce677f818 (patch)
tree588e8c5f82b9163181fad3581f610e6f1d88cba4 /src/libparser/node/bind.cpp
parenta9153f1615a842cfb9e9bcda4d9071e202618569 (diff)
downloadOneRoll-07c5f6ec23fcf9237a24e71adcfacabce677f818.tar.gz
OneRoll-07c5f6ec23fcf9237a24e71adcfacabce677f818.zip
Change file organization.
Diffstat (limited to 'src/libparser/node/bind.cpp')
-rw-r--r--src/libparser/node/bind.cpp114
1 files changed, 114 insertions, 0 deletions
diff --git a/src/libparser/node/bind.cpp b/src/libparser/node/bind.cpp
new file mode 100644
index 0000000..490071f
--- /dev/null
+++ b/src/libparser/node/bind.cpp
@@ -0,0 +1,114 @@
+/***************************************************************************
+ * Copyright (C) 2014 by Renaud Guezennec *
+ * https://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;
+ if(nullptr == m_previousNode)
+ return;
+
+ 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(auto& 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;
+}