blob: c4f96dc00e3b1515fd2e8ceaf711ae7b24f2bd39 (
plain) (
blame)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
|
/***************************************************************************
* 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(bool wl)const;
/**
* @brief getPriority
* @return
*/
virtual qint64 getPriority() const;
private:
bool m_ascending;
DiceResult* m_diceResult;
};
#endif // SORTRESULT_H
|