aboutsummaryrefslogtreecommitdiffstatshomepage
path: root/node/sortresult.cpp
diff options
context:
space:
mode:
authorRenaud G <renaud@rolisteam.org>2015-04-30 11:09:04 +0200
committerRenaud G <renaud@rolisteam.org>2015-04-30 11:09:04 +0200
commite1429844d3c7c2feeec8291084fb7f36e9ef38af (patch)
tree352d0bcac94201727e75ae55c0ba0da5d1aaf7cb /node/sortresult.cpp
parent5c73a6cb13b8c301d0e60f916998c3e683a2b043 (diff)
downloadOneRoll-e1429844d3c7c2feeec8291084fb7f36e9ef38af.tar.gz
OneRoll-e1429844d3c7c2feeec8291084fb7f36e9ef38af.zip
add comments and gpl header to those files for better documentation in doxygen
Diffstat (limited to 'node/sortresult.cpp')
-rw-r--r--node/sortresult.cpp23
1 files changed, 22 insertions, 1 deletions
diff --git a/node/sortresult.cpp b/node/sortresult.cpp
index deaf794..b3e6b49 100644
--- a/node/sortresult.cpp
+++ b/node/sortresult.cpp
@@ -1,3 +1,24 @@
+/***************************************************************************
+* Copyright (C) 2014 by Renaud Guezennec *
+* http://renaudguezennec.homelinux.org/accueil,3.html *
+* *
+* 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 "sortresult.h"
#include <QDebug>
@@ -25,7 +46,7 @@ void SortResultNode::run(ExecutionNode* node)
QList<Die*> diceList2=m_diceResult->getResultList();
- // Dichotomic sorting
+ // half-interval search sorting
for(int i = 0; i<diceList.size();++i)
{
Die* tmp1 = diceList[i];