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
|
/* RaidFleet.cpp
Copyright (c) 2023 by Hurleveur
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 "RaidFleet.h"
#include "DataNode.h"
#include "Fleet.h"
#include "GameData.h"
#include <algorithm>
using namespace std;
RaidFleet::RaidFleet(const Fleet *fleet, double minAttraction, double maxAttraction)
: fleet(fleet), minAttraction(minAttraction), maxAttraction(maxAttraction)
{
}
void RaidFleet::Load(vector<RaidFleet> &raidFleets, const DataNode &node, bool remove, int valueIndex)
{
const Fleet *fleet = GameData::Fleets().Get(node.Token(valueIndex));
if(remove)
{
auto fleetMatcher = [fleet](const RaidFleet &raidFleet) noexcept -> bool {
return raidFleet.GetFleet() == fleet;
};
raidFleets.erase(remove_if(raidFleets.begin(), raidFleets.end(), fleetMatcher), raidFleets.end());
}
else
raidFleets.emplace_back(fleet,
node.Size() > (valueIndex + 1) ? node.Value(valueIndex + 1) : 2.,
node.Size() > (valueIndex + 2) ? node.Value(valueIndex + 2) : 0.);
}
const Fleet *RaidFleet::GetFleet() const
{
return fleet;
}
double RaidFleet::MinAttraction() const
{
return minAttraction;
}
double RaidFleet::MaxAttraction() const
{
return maxAttraction;
}
|
