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
|
/***************************************************************************
* 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 "validator.h"
Validator::Validator() {}
Validator::~Validator() {}
template <typename Functor>
qint64 Validator::onEach(const std::vector<Die*>& b, bool recursive, bool unlight, Functor functor) const
{
qint64 result= 0;
std::for_each(b.begin(), b.end(), [this, recursive, unlight, functor, &result](Die* die) {
if(hasValid(die, recursive, unlight))
{
++result;
functor(die, recursive, unlight);
}
});
return result;
}
template <typename Functor>
qint64 Validator::oneOfThem(const std::vector<Die*>& b, bool recursive, bool unlight, Functor functor) const
{
auto oneOfThem= std::any_of(b.begin(), b.end(),
[this, recursive, unlight](Die* die) { return hasValid(die, recursive, unlight); });
if(oneOfThem)
functor(recursive, unlight);
return oneOfThem ? 1 : 0;
}
template <typename Functor>
qint64 Validator::allOfThem(const std::vector<Die*>& b, bool recursive, bool unlight, Functor functor) const
{
auto all= std::all_of(b.begin(), b.end(),
[this, recursive, unlight](Die* die) { return hasValid(die, recursive, unlight); });
if(all)
functor(recursive, unlight);
return all ? 1 : 0;
}
template <typename Functor>
qint64 Validator::onScalar(const std::vector<Die*>& b, bool recursive, bool unlight, Functor functor) const
{
qint64 result= 0;
for(const auto& die : b)
{
result+= die->getValue();
}
Die die;
die.setValue(result);
if(hasValid(&die, recursive, unlight))
{
functor(recursive, unlight);
return 1;
}
return 0;
}
const std::set<qint64>& Validator::getPossibleValues(const std::pair<qint64, qint64>&)
{
return m_values;
}
template <typename Functor>
qint64 Validator::validResult(const std::vector<Die*>& b, bool recursive, bool unlight, Functor functor) const
{
qint64 result;
switch(m_conditionType)
{
case Dice::OnEach:
result= onEach(b, recursive, unlight, functor);
break;
case Dice::OneOfThem:
result= oneOfThem(b, recursive, unlight, functor);
break;
case Dice::AllOfThem:
result= allOfThem(b, recursive, unlight, functor);
break;
case Dice::OnScalar:
result= onScalar(b, recursive, unlight, functor);
break;
}
return result;
}
Dice::ConditionType Validator::getConditionType() const
{
return m_conditionType;
}
void Validator::setConditionType(const Dice::ConditionType& conditionType)
{
m_conditionType= conditionType;
}
|