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
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
|
/***************************************************************************
* Copyright (C) 2018 by Renaud Guezennec *
* http://www.rolisteam.org/contact *
* *
* rolisteam 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 "occurencecountnode.h"
#include "result/diceresult.h"
#include "result/stringresult.h"
OccurenceCountNode::OccurenceCountNode() : ExecutionNode()
{
m_stringResult= new StringResult();
m_result= m_stringResult;
}
void OccurenceCountNode::run(ExecutionNode* previous)
{
m_previousNode= previous;
std::map<qint64, qint64> mapOccurence;
if(nullptr == m_previousNode)
return;
DiceResult* previousDiceResult= dynamic_cast<DiceResult*>(m_previousNode->getResult());
// m_diceResult->setPrevious(previousDiceResult);
if(nullptr == previousDiceResult)
return;
auto const& diceList= previousDiceResult->getResultList();
QVector<qint64> vec;
for(auto dice : diceList)
{
auto val= dice->getValue();
vec << val;
auto it= mapOccurence.find(val);
if(it == mapOccurence.end())
mapOccurence[val]= 1;
else
mapOccurence[val]+= 1;
}
std::sort(vec.begin(), vec.end());
QStringList list;
for(auto key : mapOccurence)
{
if(nullptr != m_validator)
{
Die die;
die.insertRollValue(key.first);
if(!m_validator->hasValid(&die, true))
continue;
}
if(key.second < m_width)
continue;
if(key.first >= m_height)
list << QStringLiteral("%1x%2").arg(key.second).arg(key.first);
}
QStringList resultList;
std::for_each(vec.begin(), vec.end(), [&resultList](qint64 val) { resultList << QString::number(val); });
QString result;
if(!list.isEmpty())
result= list.join(',');
else
result= QObject::tr("No matching result");
m_stringResult->setText(QStringLiteral("%1 - [%2]").arg(result).arg(resultList.join(',')));
if(nullptr != m_nextNode)
{
m_nextNode->run(this);
}
}
QString OccurenceCountNode::toString(bool label) const
{
if(label)
{
return QString("%1 [label=\"OccurenceCountNode %2\"]").arg(m_id);
}
else
{
return m_id;
}
}
ExecutionNode* OccurenceCountNode::getCopy() const
{
return nullptr;
}
qint64 OccurenceCountNode::getPriority() const
{
qint64 priority= 0;
if(nullptr != m_previousNode)
{
priority= m_previousNode->getPriority();
}
return priority;
}
qint64 OccurenceCountNode::getWidth() const
{
return m_width;
}
void OccurenceCountNode::setWidth(const qint64& width)
{
m_width= width;
}
qint64 OccurenceCountNode::getHeight() const
{
return m_height;
}
void OccurenceCountNode::setHeight(const qint64& height)
{
m_height= height;
}
Validator* OccurenceCountNode::getValidator() const
{
return m_validator;
}
void OccurenceCountNode::setValidator(Validator* validator)
{
m_validator= validator;
}
|