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
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
|
/***************************************************************************
* Copyright (C) 2014 by Renaud Guezennec *
* https://rolisteam.org/contact *
* *
* 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 "compositevalidator.h"
CompositeValidator::CompositeValidator() {}
CompositeValidator::~CompositeValidator()
{
qDeleteAll(m_validatorList);
}
qint64 CompositeValidator::hasValid(Die* b, bool recursive, bool unhighlight) const
{
int i= 0;
qint64 sum= 0;
bool highLight= false;
for(auto& validator : m_validatorList)
{
qint64 val= validator->hasValid(b, recursive, unhighlight);
if(i == 0)
{
sum= val;
if(b->isHighlighted())
{
highLight= b->isHighlighted();
}
}
else
{
switch(m_operators.at(i - 1))
{
case OR:
sum|= val;
if(highLight)
{
b->setHighlighted(highLight);
}
break;
case EXCLUSIVE_OR:
sum^= val; /// @todo may required to be done by hand
break;
case AND:
sum&= val;
break;
default:
break;
}
}
++i;
}
return sum;
}
QString CompositeValidator::toString()
{
QString str= "";
/*switch (m_operator)
{
case Equal:
str.append("=");
break;
case GreaterThan:
str.append(">");
break;
case LesserThan:
str.append("<");
break;
case GreaterOrEqual:
str.append(">=");
break;
case LesserOrEqual:
str.append("<=");
break;
}
return QString("[%1%2]").arg(str).arg(m_value);*/
return str;
}
Dice::CONDITION_STATE testAND(Dice::CONDITION_STATE before, Dice::CONDITION_STATE current)
{
if(before == Dice::CONDITION_STATE::UNREACHABLE || current == Dice::CONDITION_STATE::UNREACHABLE)
return Dice::CONDITION_STATE::UNREACHABLE;
else if(before == Dice::CONDITION_STATE::ALWAYSTRUE && current == Dice::CONDITION_STATE::ALWAYSTRUE)
return Dice::CONDITION_STATE::ALWAYSTRUE;
else
return Dice::CONDITION_STATE::REACHABLE;
}
Dice::CONDITION_STATE testOR(Dice::CONDITION_STATE before, Dice::CONDITION_STATE current)
{
if(before == Dice::CONDITION_STATE::UNREACHABLE && current == Dice::CONDITION_STATE::UNREACHABLE)
return Dice::CONDITION_STATE::UNREACHABLE;
else if(before == Dice::CONDITION_STATE::ALWAYSTRUE || current == Dice::CONDITION_STATE::ALWAYSTRUE)
return Dice::CONDITION_STATE::ALWAYSTRUE;
else
return Dice::CONDITION_STATE::REACHABLE;
}
Dice::CONDITION_STATE testXOR(Dice::CONDITION_STATE before, Dice::CONDITION_STATE current)
{
if(before == current
&& (before == Dice::CONDITION_STATE::UNREACHABLE || before == Dice::CONDITION_STATE::ALWAYSTRUE))
return Dice::CONDITION_STATE::UNREACHABLE;
else if((before != current)
&& (before == Dice::CONDITION_STATE::ALWAYSTRUE || before == Dice::CONDITION_STATE::UNREACHABLE)
&& (before != Dice::CONDITION_STATE::REACHABLE || current != Dice::CONDITION_STATE::REACHABLE))
return Dice::CONDITION_STATE::ALWAYSTRUE;
else
return Dice::CONDITION_STATE::REACHABLE;
}
Dice::CONDITION_STATE CompositeValidator::isValidRangeSize(const std::pair<qint64, qint64>& range) const
{
std::vector<Dice::CONDITION_STATE> vec;
std::transform(
m_validatorList.begin(), m_validatorList.end(), std::back_inserter(vec),
[range](Validator* validator) -> Dice::CONDITION_STATE { return validator->isValidRangeSize(range); });
auto itError= std::find(vec.begin(), vec.end(), Dice::CONDITION_STATE::ERROR_STATE);
if((static_cast<int>(vec.size()) != m_operators.size() + 1) || (itError != vec.end()))
{
return Dice::CONDITION_STATE::ERROR_STATE;
}
std::size_t i= 0;
Dice::CONDITION_STATE val = Dice::CONDITION_STATE::ERROR_STATE;
for(const auto& op : m_operators)
{
auto currentState= vec[i + 1];
if(i == 0)
{
val= vec[i];
}
switch(op)
{
case OR:
val= testAND(val, currentState);
break;
case EXCLUSIVE_OR:
val= testOR(val, currentState);
break;
case AND:
val= testXOR(val, currentState);
break;
case NONE:
val= Dice::CONDITION_STATE::ERROR_STATE;
break;
}
++i;
}
return val;
}
void CompositeValidator::setOperationList(const QVector<LogicOperation>& m)
{
m_operators= m;
}
void CompositeValidator::setValidatorList(const QList<Validator*>& valids)
{
qDeleteAll(m_validatorList);
m_validatorList= valids;
}
Validator* CompositeValidator::getCopy() const
{
CompositeValidator* val= new CompositeValidator();
val->setOperationList(m_operators);
val->setValidatorList(m_validatorList);
return val;
}
|