1 /***************************************************************************
2 planet.cpp - description
5 copyright : (C) 2002 by Michael Andreen
7 ***************************************************************************/
9 /***************************************************************************
11 * This program is free software; you can redistribute it and/or modify *
12 * it under the terms of the GNU General Public License as published by *
13 * the Free Software Foundation; either version 2 of the License, or *
14 * (at your option) any later version. *
16 ***************************************************************************/
32 //////////////////////////////////////////////////////////////////////////
34 unsigned Planet::planetScore(int tick) const
36 int ticks = m_Score.size();
43 return m_Score[ticks];
48 //////////////////////////////////////////////////////////////////////////
50 void Planet::setPlanetScore(unsigned number, int tick)
53 int ticks = m_Score.size();
56 earlier = m_Score[ticks - 1];
58 for (int i = ticks; i <= tick; ++i)
60 m_Score.push_back(earlier);
62 m_Score[tick] = number;
65 //////////////////////////////////////////////////////////////////////////
67 void Planet::addPlanetScore(unsigned number, int tick)
70 int ticks = m_Score.size();
73 earlier = m_Score[ticks - 1];
75 for (int i = ticks; i <= tick; ++i)
77 m_Score.push_back(earlier);
79 m_Score[tick] += number;
81 //////////////////////////////////////////////////////////////////////////
83 int Planet::roids(std::string type, int tick) const
85 // const... I would like [] as for const types: int ticks = m_Roids[type].size();
87 vector<int>const* roids = 0;
88 for (RoidList::const_iterator i = m_Roids.begin(); i != m_Roids.end(); ++i)
99 int ticks = roids->size();
105 return roids->at(ticks);
106 return roids->at(tick);
109 //////////////////////////////////////////////////////////////////////////
111 void Planet::setRoids(std::string type, int number, int tick)
113 int ticks = m_Roids[type].size();
115 if (m_Roids[type].size() > 0)
116 roids = m_Roids[type][m_Roids[type].size() - 1];
118 for (int i = ticks; i <= tick; ++i )
119 m_Roids[type].push_back(roids);
120 m_Roids[type][tick] = number;
123 //////////////////////////////////////////////////////////////////////////
125 void Planet::takeRoids(std::string type, int number, int tick)
127 int ticks = m_Roids[type].size();
129 if (m_Roids[type].size() > 0)
130 roids = m_Roids[type][m_Roids[type].size() - 1];
132 for (int i = ticks; i <= tick; ++i )
133 m_Roids[type].push_back(roids);
134 m_Roids[type][tick] -= number;
136 if (type != "uninit")
137 addPlanetScore(-3000*number, tick);
142 //////////////////////////////////////////////////////////////////////////
144 void Planet::runBattle(std::vector<Fleet*> friendly, std::vector<Fleet*> hostile)
146 if (hostile.size() == 0)
151 for (vector<Fleet*>::iterator i = friendly.begin(); i != friendly.end(); ++i)
154 for (vector<Fleet*>::iterator i = hostile.begin(); i != hostile.end(); ++i)
157 for(int tick = 1; skipped < 20; ++tick)
159 //See who's in the battle at the current tick
160 vector<Fleet*> friends = calculateSide(friendly, 6, tick);
161 vector<Fleet*> hostiles = calculateSide(hostile, 3, tick);
163 // No idea to calculate anything if noone is there.. ;)
164 if (hostiles.size() == 0)
173 allFriends.addToThis(friends, tick - 1);
175 /*for (RoidList::iterator i = m_Roids.begin(); i != m_Roids.end(); ++i)
176 allFriends.setRoids(i->first, roids(i->first, tick));
178 allFriends.setPlanetScore(m_iScore);*/
181 allHostiles.addToThis(hostiles, tick - 1);
183 map<string, map<string, int> > stealfriendly;
184 map<string, map<string, int> > stealhostile;
187 for (RoidList::iterator roid = m_Roids.begin(); roid != m_Roids.end(); ++roid)
189 setRoids(roid->first, roids(roid->first, tick-1), tick);
192 setPlanetScore(planetScore(tick - 1), tick);
195 calcOneTick(&allFriends, &allHostiles, stealfriendly, stealhostile, tick );
197 //allFriends.printFleet();
199 allFriends.distributeLossesGains(friends, tick);
200 allFriends.distributeStolenShips(stealfriendly, friends, tick);
202 allHostiles.distributeLossesGains(hostiles, tick);
203 allHostiles.distributeCappedRoids(hostiles, tick);
204 allHostiles.distributeStolenShips(stealhostile, hostiles, tick);
206 calculateScoreLoss(friends, tick);
208 /* for (RoidList::iterator i = m_Roids.begin(); i != m_Roids.end(); ++i)
209 setRoids(i->first, roids(i->first, 1), tick);*/
212 for (vector<Fleet*>::iterator i = friendly.begin(); i != friendly.end(); ++i)
213 (*i)->calculateSalvage();
215 for (RoidList::iterator i = m_Roids.begin(); i != m_Roids.end(); ++i)
217 for (vector<int>::iterator j = i->second.begin(); j != i->second.end(); ++j)
218 cout << i->first << " roids : " << (*j) << endl;
222 //////////////////////////////////////////////////////////////////////////
224 void Planet::calcOneTick(Planet* friendly, Fleet* hostile, std::map<std::string, std::map<std::string, int> >& stealfriendly, std::map<std::string, std::map<std::string, int> >& stealhostile, int tick)
226 if (planetScore(tick - 1) > 0)
227 setCapping(float(planetScore(tick - 1)) / hostile->score() / 10, tick);
231 map<string, int> pods;
234 //FIXME: Need to change this and allow multiple shiptypes with the same initiative.
235 map<int, string> unitsinit; // order units after their ininitiative
236 for (UnitList::iterator i = s_Units.begin(); i != s_Units.end(); ++i)
237 unitsinit[i->second.initiative()] = i->first;
239 for (map<int, string>::iterator i = unitsinit.begin(); i != unitsinit.end(); ++i)
241 Fleet* hostiletemp = new Fleet(*hostile);
242 Planet* friendlytemp = new Planet(*friendly);
244 string unittype = i->second;
246 //cerr << "Initiative: " << s_Units[unittype].initiative() << " with unit: " << unittype << endl;
248 if (s_Units[unittype].type() == "EMP")
250 hostiletemp->takeEMP(unittype, friendly->freeFleet(unittype, 1));
251 friendlytemp->takeEMP(unittype, hostile->freeFleet(unittype, 1));
253 else if (s_Units[unittype].type() == "Steal")
255 hostiletemp->takeShoot(unittype, friendly->freeFleet(unittype, 1), stealfriendly[unittype]);
256 friendlytemp->takeShoot(unittype, hostile->freeFleet(unittype, 1), stealhostile[unittype]);
258 friendlytemp->calculateLostStealships(unittype, stealfriendly[unittype], 1);
259 hostiletemp->calculateLostStealships(unittype, stealhostile[unittype], 1);
263 map<string, int> temp;
264 hostiletemp->takeShoot(unittype, friendly->freeFleet(unittype, 1), temp);
265 friendlytemp->takeShoot(unittype, hostile->freeFleet(unittype, 1), temp);
268 if (s_Units[unittype].type() == "Pod")
270 //FIXME: Prolly need to recode the whole capping section for r7, due to multiple pods thingy
271 cerr << "Capping is: " << capping(tick) << endl;
273 if (capping(tick) > 0)
275 for (RoidList::iterator roid = m_Roids.begin(); roid != m_Roids.end(); ++roid)
277 int caproids = capping(tick) * roids(roid->first, tick - 1);
278 int freepods = hostiletemp->freeFleet(unittype, 1);
280 cerr << "Possible to steal " << caproids << " " << roid->first << " roids\n";
281 cerr << freepods << " free pods available\n";
285 if (freepods < caproids)
288 cerr << caproids << " roids stolen\n";
290 takeRoids(roid->first, caproids, tick);
292 //FIXME: Going to move this to the distribute roids section instead.. Not really move, I'll keep this, but "regenerate" the pods in the distribute ships function.
293 hostiletemp->killFleet(unittype, caproids, 1);
294 pods[unittype] += caproids;
295 //int totroids = caproids + hostiletemp->resource(roid->first, 0);
296 hostiletemp->addResource(roid->first, caproids, 1);
298 cerr << caproids << " stolen " << roid->first << " roids\n";
303 //set the the objects so they point at the modified objects
304 *friendly = *friendlytemp;
306 *hostile = *hostiletemp;
309 hostile->addFleet(pods, 1);
313 //////////////////////////////////////////////////////////////////////////
315 void Planet::calculateScoreLoss(std::vector<Fleet*> friendly, int tick)
317 for (vector<Fleet*>::iterator i = friendly.begin(); i != friendly.end(); ++i)
319 if ((*i)->name().find("Home") != string::npos)
321 int scorechange = (*i)->score(tick) - (*i)->score(tick - 1);
322 addPlanetScore(scorechange, tick);
327 //////////////////////////////////////////////////////////////////////////
329 float Planet::capping(int tick)
331 int ticks = m_Capping.size();
338 return m_Capping[tick];
341 //////////////////////////////////////////////////////////////////////////
343 void Planet::setCapping(float capping, int tick)
345 int ticks = m_Capping.size();
347 for (int i = ticks; i <= tick; ++i)
349 m_Capping.push_back(0);
352 if (capping <= 0.15 && capping >= 0)
353 m_Capping[tick] = capping;
354 else if (capping >= 0.15)
355 m_Capping[tick] = 0.15;