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
|
#include "Merge.h"
#include "../CGroup.h"
#include "../CDefenseMatrix.h"
#include "../CPathfinder.h"
MergeTask::MergeTask(AIClasses *_ai, std::list<CGroup*>& groups): ATask(_ai) {
t = TASK_MERGE;
isRetreating = false;
range = 0.0f;
masterGroup = NULL;
std::list<CGroup*>::iterator it;
for (it = groups.begin(); it != groups.end(); ++it) {
CGroup *group = *it;
addGroup(*group);
range += group->radius();
}
unitCategory cats = firstGroup()->cats;
if ((cats&AIR).any() && (cats&ASSAULT).none()) {
// FIXME: prefer no hardcoding
range = 1000.0f;
}
else {
range = range + groups.size() * FOOTPRINT2REAL;
}
}
// called on Group removing
void MergeTask::remove(ARegistrar &group) {
CGroup *g = dynamic_cast<CGroup*>(&group);
assert(g != NULL);
bool isReelectionNeeded = (masterGroup && masterGroup->key == g->key);
mergable.erase(g->key);
removeGroup(*g);
if (isReelectionNeeded) {
masterGroup = NULL;
reelectMasterGroup();
}
}
bool MergeTask::onValidate() {
return reelectMasterGroup();
}
void MergeTask::onUpdate() {
/* See which groups can be merged already */
std::list<CGroup*>::iterator it;
for (it = groups.begin(); it != groups.end(); ++it) {
CGroup *g = *it;
if (g->isMicroing())
continue;
if (pos.distance2D(g->pos()) < range) {
mergable[g->key] = g;
g->micro(true);
}
}
/* We have at least two groups, now we can merge */
if (mergable.size() >= 2) {
std::vector<int> keys;
std::map<int, CGroup*>::iterator it;
// get keys because while merging "mergable" is reducing...
for (it = mergable.begin(); it != mergable.end(); ++it) {
keys.push_back(it->first);
}
for (int i = 0; i < keys.size(); i++) {
int key = keys[i];
if (key != masterGroup->key) {
CGroup *g = mergable[key];
LOG_II("MergeTask::update merging " << (*g) << " with " << (*masterGroup))
// NOTE: group being merged is automatically removed
masterGroup->merge(*g);
}
}
assert(mergable.size() == 1);
mergable.clear();
masterGroup->micro(false);
}
// if only one (or none) group remains, merging is no longer possible,
// remove the task, unreg groups...
if (groups.size() <= 1)
ATask::remove();
}
bool MergeTask::reelectMasterGroup() {
if (groups.size() <= 1)
return false;
bool reelect = true;
if (masterGroup && !isRetreating) {
float threat = masterGroup->getThreat(pos, masterGroup->radius());
// if threat is 2x smaller than group strength then do nothing
if (threat <= EPS || (masterGroup->strength / threat) > 2.0f)
reelect = false;
}
if (reelect) {
float minThreat = std::numeric_limits<float>::max();
float maxDistance = std::numeric_limits<float>::min();
CGroup *bestGroup = NULL;
std::list<CGroup*>::iterator it;
for (it = groups.begin(); it != groups.end(); ++it) {
CGroup *g = *it;
float3 gpos = g->pos();
float threat = g->getThreat(gpos, g->radius());
float distance = ai->defensematrix->distance2D(gpos);
if (distance > maxDistance)
maxDistance = distance;
if (threat < minThreat) {
bestGroup = g;
minThreat = threat;
isRetreating = (distance + EPS) < maxDistance;
}
}
if (bestGroup && (masterGroup == NULL || masterGroup->key != bestGroup->key)) {
masterGroup = bestGroup;
pos = bestGroup->pos(true);
for (it = groups.begin(); it != groups.end(); ++it) {
CGroup *g = *it;
ai->pathfinder->remove(*g);
if (!ai->pathfinder->addGroup(*g))
return false;
}
}
}
return (masterGroup != NULL);
}
void MergeTask::toStream(std::ostream& out) const {
out << "MergeTask(" << key << ") range(" << range<<") pos(" << pos.x << ", " << pos.z << ") groups(" << groups.size() << ") { ";
std::list<CGroup*>::const_iterator i;
for (i = groups.begin(); i != groups.end(); ++i) {
out << (*(*i)) << " ";
}
out << "}";
}
|
