diff options
| author | 2015-04-30 11:09:04 +0200 | |
|---|---|---|
| committer | 2015-04-30 11:09:04 +0200 | |
| commit | e1429844d3c7c2feeec8291084fb7f36e9ef38af (patch) | |
| tree | 352d0bcac94201727e75ae55c0ba0da5d1aaf7cb /node/sortresult.h | |
| parent | 5c73a6cb13b8c301d0e60f916998c3e683a2b043 (diff) | |
| download | OneRoll-e1429844d3c7c2feeec8291084fb7f36e9ef38af.tar.gz OneRoll-e1429844d3c7c2feeec8291084fb7f36e9ef38af.zip | |
add comments and gpl header to those files for better documentation in doxygen
Diffstat (limited to 'node/sortresult.h')
| -rw-r--r-- | node/sortresult.h | 45 |
1 files changed, 43 insertions, 2 deletions
diff --git a/node/sortresult.h b/node/sortresult.h index 8ce03a2..d505e4b 100644 --- a/node/sortresult.h +++ b/node/sortresult.h @@ -1,18 +1,59 @@ +/*************************************************************************** +* 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. * +***************************************************************************/ #ifndef SORTRESULT_H #define SORTRESULT_H #include "executionnode.h" #include "result/diceresult.h" - +/** + * @brief The SortResultNode class is an ExecutionNode, and it is dedicated to sort dice list. + * The sort is made by hand, using half-interval search algorithm. + */ class SortResultNode : public ExecutionNode { public: + /** + * @brief SortResultNode + */ SortResultNode(); + /** + * @brief run + */ virtual void run(ExecutionNode*); - + /** + * @brief setSortAscending + * @param asc + */ void setSortAscending(bool asc); + /** + * @brief toString + * @return + */ virtual QString toString()const; + /** + * @brief getPriority + * @return + */ virtual qint64 getPriority() const; private: |