blob: 46e6eb8cb366adc62268302d3b29df62777e79d5 (
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
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
|
#include "sortresult.h"
#include <QDebug>
#include "die.h"
SortResultNode::SortResultNode()
: m_diceResult(new DiceResult)
{
m_ascending = true;
m_result = m_diceResult;
}
void SortResultNode::run(ExecutionNode* node)
{
m_previousNode = node;
if(NULL==node)
{
return;
}
DiceResult* previousDiceResult = dynamic_cast<DiceResult*>(node->getResult());
m_diceResult->setPrevious(previousDiceResult);
if(NULL!=previousDiceResult)
{
QList<Die*> diceList=previousDiceResult->getResultList();
QList<Die*> diceList2=m_diceResult->getResultList();
// Dichotomic sorting
for(int i = 0; i<diceList.size();++i)
{
Die* tmp1 = diceList[i];
int j =0;
bool found = false;
int start = 0;
int end = diceList2.size();
int distance = 0;
Die* tmp2 = NULL;
while(!found)
{
distance = end-start;
j = (start+end)/2;
if(distance == 0)
{
j=end;
found=true;
}
else
{
tmp2 = diceList2[j];
if(tmp1->getValue() < tmp2->getValue())
{
end=j;
}
else
{
start=j+1;
}
}
}
diceList2.insert(j,tmp1);
}
if(!m_ascending)
{
for(int i = 0; i< diceList2.size()/2; ++i)
{
diceList2.swap(i,diceList2.size()-(1+i));
}
}
m_diceResult->setResultList(diceList2);
if(NULL!=m_nextNode)
{
m_nextNode->run(this);
}
}
else
{
m_errors.append(DIE_RESULT_EXPECTED);
}
}
void SortResultNode::setSortAscending(bool asc)
{
m_ascending = asc;
}
QString SortResultNode::toString() const
{
return "SortResultNode";
}
qint64 SortResultNode::getPriority() const
{
qint64 priority=0;
if(NULL!=m_nextNode)
{
priority = m_nextNode->getPriority();
}
return priority;
}
|