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
|
/* Variant.cpp
Copyright (c) 2022 by Amazinite
Endless Sky 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.
Endless Sky 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 <https://www.gnu.org/licenses/>.
*/
#include "Variant.h"
#include "DataNode.h"
#include "GameData.h"
#include "Ship.h"
#include <algorithm>
using namespace std;
Variant::Variant(const DataNode &node)
{
Load(node);
}
void Variant::Load(const DataNode &node)
{
if(node.Token(0) == "variant" && node.Size() >= 2)
weight = max<int>(1, node.Value(1));
else if(node.Token(0) == "add" && node.Size() >= 3)
weight = max<int>(1, node.Value(2));
for(const DataNode &child : node)
{
int n = 1;
if(child.Size() >= 2 && child.Value(1) >= 1.)
n = child.Value(1);
ships.insert(ships.end(), n, GameData::Ships().Get(child.Token(0)));
}
}
// Determine if this variant template uses well-defined data.
bool Variant::IsValid() const
{
// At least one valid ship is enough to make the variant valid.
if(any_of(ships.begin(), ships.end(),
[](const Ship *const s) noexcept -> bool { return s->IsValid(); }))
return true;
return false;
}
int Variant::Weight() const
{
return weight;
}
const vector<const Ship *> &Variant::Ships() const
{
return ships;
}
// The strength of a variant is the sum of the strength of its ships.
int64_t Variant::Strength() const
{
int64_t strength = 0;
for(const Ship *ship : ships)
strength += ship->Strength();
return strength;
}
bool Variant::operator==(const Variant &other) const
{
// Are the ships of other a permutation of this variant's?
if(other.ships.size() != ships.size()
|| !is_permutation(ships.begin(), ships.end(), other.ships.begin()))
return false;
// If all checks have passed, these variants are equal.
return true;
}
bool Variant::operator!=(const Variant &other) const
{
return !(*this == other);
}
|
