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
|
/*
* Copyright 2007-2008 Ben Boeckel <MathStuf@gmail.com>
*
* This program 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 3 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, see <http://www.gnu.org/licenses/>.
*/
// Header include
#include "Nature.h"
// Sigmod includes
#include "Macros.h"
#include "Rules.h"
#include "Sigmod.h"
Sigmod::Nature::Nature(const Nature& nature) :
Object(nature.parent(), nature.id()),
m_stat(ST_SpecialDefense - ST_Attack + 1)
{
*this = nature;
}
Sigmod::Nature::Nature(const Sigmod* parent, const int id) :
Object(parent, id),
m_name(""),
m_stat(ST_SpecialDefense - ST_Attack + 1),
m_weight(1)
{
for (int i = 0; i < m_stat.size(); ++i)
m_stat[i].set(1, 1);
}
Sigmod::Nature::Nature(const Nature& nature, const Sigmod* parent, const int id) :
Object(parent, id),
m_stat(ST_SpecialDefense - ST_Attack + 1)
{
*this = nature;
}
Sigmod::Nature::Nature(const QDomElement& xml, const Sigmod* parent, const int id) :
Object(parent, id),
m_stat(ST_SpecialDefense - ST_Attack + 1)
{
LOAD_ID();
load(xml);
}
void Sigmod::Nature::validate()
{
TEST_BEGIN();
if (m_name.isEmpty())
emit(error("Name is empty"));
TEST_ARRAY_INDEX(stat, ST_Attack);
TEST_ARRAY_INDEX(stat, ST_Defense);
TEST_ARRAY_INDEX(stat, ST_Speed);
if (sigmod()->rules()->specialSplit())
{
TEST_ARRAY_INDEX(stat, ST_SpecialAttack);
TEST_ARRAY_INDEX(stat, ST_SpecialDefense);
}
else
TEST_ARRAY_INDEX(stat, ST_Special);
TEST(weight);
TEST_END();
}
void Sigmod::Nature::load(const QDomElement& xml)
{
LOAD_BEGIN();
LOAD(name);
LOAD_ARRAY(stat);
LOAD(weight);
}
QDomElement Sigmod::Nature::save() const
{
SAVE_CREATE();
SAVE(name);
SAVE_ARRAY(stat);
SAVE(weight);
return xml;
}
SETTER(Nature, QString&, Name, name)
SETTER_ARRAY(Nature, Sigcore::Fraction&, Stat, stat, multiplier, Stat, stat, ST_Attack)
SETTER(Nature, int, Weight, weight)
GETTER(Nature, QString, name)
GETTER_ARRAY(Nature, Sigcore::Fraction, stat, multiplier, Stat, stat, ST_Attack)
GETTER(Nature, int, weight)
CHECK(Nature, QString&, name)
CHECK_BEGIN_ARRAY(Nature, Sigcore::Fraction&, stat, multiplier, Stat, stat)
switch (stat)
{
case ST_SpecialDefense:
if (sigmod()->rules()->specialSplit())
case ST_Attack ... ST_Special:
break;
default:
EBOUNDS(stat, "Attack", sigmod()->rules()->specialSplit() ? "SpecialDefense" : "Special");
return false;
}
TBOUNDS(multiplier, 1, INT_MAX)
CHECK_END()
CHECK_BOUNDS(Nature, int, weight, 1, INT_MAX)
Sigmod::Nature& Sigmod::Nature::operator=(const Nature& rhs)
{
if (this == &rhs)
return *this;
COPY(name);
COPY(stat);
COPY(weight);
return *this;
}
|
