aboutsummaryrefslogtreecommitdiffstatshomepage
path: root/node/sortresult.cpp
diff options
context:
space:
mode:
authorRenaud G <renaud@rolisteam.org>2016-11-28 00:36:15 +0100
committerRenaud G <renaud@rolisteam.org>2016-11-28 00:36:15 +0100
commit13e297604b00615d47352538e3c82ea1ac700d4c (patch)
tree567efe03594d261831897f03a7821c4c6eeac59b /node/sortresult.cpp
parentcdd1716bd1aa8d9bbd0137aa98ff24867b6b3a0e (diff)
downloadOneRoll-13e297604b00615d47352538e3c82ea1ac700d4c.tar.gz
OneRoll-13e297604b00615d47352538e3c82ea1ac700d4c.zip
-Add API for copying a branch of execution node.
-Allow to use if node several times.
Diffstat (limited to 'node/sortresult.cpp')
-rw-r--r--node/sortresult.cpp12
1 files changed, 11 insertions, 1 deletions
diff --git a/node/sortresult.cpp b/node/sortresult.cpp
index f72d884..8dee7d5 100644
--- a/node/sortresult.cpp
+++ b/node/sortresult.cpp
@@ -45,7 +45,6 @@ void SortResultNode::run(ExecutionNode* node)
QList<Die*> diceList=previousDiceResult->getResultList();
QList<Die*> diceList2=m_diceResult->getResultList();
-
// half-interval search sorting
for(int i = 0; i<diceList.size();++i)
{
@@ -128,3 +127,14 @@ qint64 SortResultNode::getPriority() const
return priority;
}
+ExecutionNode* SortResultNode::getCopy() const
+{
+ SortResultNode* node = new SortResultNode();
+ node->setSortAscending(m_ascending);
+ if(NULL!=m_nextNode)
+ {
+ node->setNextNode(m_nextNode->getCopy());
+ }
+ return node;
+
+}