Add unique operator

2 files changed, 141 insertions, 0 deletions

diff --git a/node/uniquenode.cpp b/node/uniquenode.cpp
new file mode 100644
index 0000000..4ef7fa6
--- /dev/null
+++ b/node/uniquenode.cpp
@@ -0,0 +1,97 @@
+/***************************************************************************
+ * 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 "uniquenode.h"
+
+UniqueNode::UniqueNode() : m_diceResult(new DiceResult())
+{
+    m_result= m_diceResult;
+}
+void UniqueNode::run(ExecutionNode* previous)
+{
+    m_previousNode= previous;
+    if(nullptr != previous)
+    {
+        m_result->setPrevious(previous->getResult());
+
+
+        Result* tmpResult= previous->getResult();
+        if(nullptr != tmpResult)
+        {
+            DiceResult* dice= dynamic_cast<DiceResult*>(tmpResult);
+            if(nullptr != dice)
+            {
+                auto const& resultList = dice->getResultList();
+                std::vector<qint64> formerValues;
+                formerValues.reserve(resultList.size());
+                for(auto& oldDie : resultList)
+                {
+                   auto value=oldDie->getValue();
+                   auto it = std::find(formerValues.begin(), formerValues.end(), value);
+
+
+                   if(it == formerValues.end())
+                   {
+                       auto die = new Die();
+                       *die = *oldDie;
+                       m_diceResult->insertResult(die);
+                       formerValues.push_back(value);
+                   }
+                   oldDie->displayed();
+                }
+            }
+        }
+    }
+    if(nullptr != m_nextNode)
+    {
+        m_nextNode->run(this);
+    }
+}
+
+QString UniqueNode::toString(bool withLabel) const
+{
+    if(withLabel)
+    {
+        return QString("%1 [label=\"UniqueNode Node\"]").arg(m_id);
+    }
+    else
+    {
+        return m_id;
+    }
+}
+qint64 UniqueNode::getPriority() const
+{
+    qint64 priority= 0;
+    if(nullptr != m_nextNode)
+    {
+        priority= m_nextNode->getPriority();
+    }
+    return priority;
+}
+ExecutionNode* UniqueNode::getCopy() const
+{
+    UniqueNode* node= new UniqueNode();
+    if(nullptr != m_nextNode)
+    {
+        node->setNextNode(m_nextNode->getCopy());
+    }
+    return node;
+}
diff --git a/node/uniquenode.h b/node/uniquenode.h
new file mode 100644
index 0000000..514c0c6
--- /dev/null
+++ b/node/uniquenode.h
@@ -0,0 +1,44 @@
+/***************************************************************************
+ * 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 UNIQUENODE_H
+#define UNIQUENODE_H
+
+#include "node/executionnode.h"
+#include "result/diceresult.h"
+
+/**
+ * @brief The UniqueNode class is an ExecutionNode. It is dedicated to unique result of one dice into one dimension array.
+ */
+class UniqueNode : public ExecutionNode
+{
+public:
+    UniqueNode();
+    void run(ExecutionNode* previous);
+    virtual QString toString(bool withLabel) const;
+    virtual qint64 getPriority() const;
+    virtual ExecutionNode* getCopy() const;
+
+private:
+    DiceResult* m_diceResult;
+};
+
+#endif // NUMBERNODE_H