NetPacksLib.cpp 37 KB

12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152535455565758596061626364656667686970717273747576777879808182838485868788899091929394959697989910010110210310410510610710810911011111211311411511611711811912012112212312412512612712812913013113213313413513613713813914014114214314414514614714814915015115215315415515615715815916016116216316416516616716816917017117217317417517617717817918018118218318418518618718818919019119219319419519619719819920020120220320420520620720820921021121221321421521621721821922022122222322422522622722822923023123223323423523623723823924024124224324424524624724824925025125225325425525625725825926026126226326426526626726826927027127227327427527627727827928028128228328428528628728828929029129229329429529629729829930030130230330430530630730830931031131231331431531631731831932032132232332432532632732832933033133233333433533633733833934034134234334434534634734834935035135235335435535635735835936036136236336436536636736836937037137237337437537637737837938038138238338438538638738838939039139239339439539639739839940040140240340440540640740840941041141241341441541641741841942042142242342442542642742842943043143243343443543643743843944044144244344444544644744844945045145245345445545645745845946046146246346446546646746846947047147247347447547647747847948048148248348448548648748848949049149249349449549649749849950050150250350450550650750850951051151251351451551651751851952052152252352452552652752852953053153253353453553653753853954054154254354454554654754854955055155255355455555655755855956056156256356456556656756856957057157257357457557657757857958058158258358458558658758858959059159259359459559659759859960060160260360460560660760860961061161261361461561661761861962062162262362462562662762862963063163263363463563663763863964064164264364464564664764864965065165265365465565665765865966066166266366466566666766866967067167267367467567667767867968068168268368468568668768868969069169269369469569669769869970070170270370470570670770870971071171271371471571671771871972072172272372472572672772872973073173273373473573673773873974074174274374474574674774874975075175275375475575675775875976076176276376476576676776876977077177277377477577677777877978078178278378478578678778878979079179279379479579679779879980080180280380480580680780880981081181281381481581681781881982082182282382482582682782882983083183283383483583683783883984084184284384484584684784884985085185285385485585685785885986086186286386486586686786886987087187287387487587687787887988088188288388488588688788888989089189289389489589689789889990090190290390490590690790890991091191291391491591691791891992092192292392492592692792892993093193293393493593693793893994094194294394494594694794894995095195295395495595695795895996096196296396496596696796896997097197297397497597697797897998098198298398498598698798898999099199299399499599699799899910001001100210031004100510061007100810091010101110121013101410151016101710181019102010211022102310241025102610271028102910301031103210331034103510361037103810391040104110421043104410451046104710481049105010511052105310541055105610571058105910601061106210631064106510661067106810691070107110721073107410751076107710781079108010811082108310841085108610871088108910901091109210931094109510961097109810991100110111021103110411051106110711081109111011111112111311141115111611171118111911201121112211231124112511261127112811291130113111321133113411351136113711381139114011411142114311441145114611471148114911501151115211531154115511561157115811591160116111621163116411651166116711681169117011711172117311741175117611771178117911801181118211831184118511861187118811891190119111921193119411951196119711981199120012011202120312041205120612071208120912101211121212131214121512161217121812191220122112221223122412251226122712281229123012311232123312341235123612371238123912401241124212431244124512461247124812491250125112521253125412551256125712581259126012611262126312641265126612671268126912701271127212731274127512761277127812791280128112821283128412851286128712881289129012911292129312941295129612971298129913001301130213031304130513061307130813091310131113121313131413151316131713181319132013211322132313241325132613271328132913301331133213331334133513361337133813391340134113421343134413451346134713481349135013511352135313541355135613571358
  1. #define VCMI_DLL
  2. #include "NetPacks.h"
  3. #include "../hch/CGeneralTextHandler.h"
  4. #include "../hch/CDefObjInfoHandler.h"
  5. #include "../hch/CArtHandler.h"
  6. #include "../hch/CHeroHandler.h"
  7. #include "../hch/CObjectHandler.h"
  8. #include "VCMI_Lib.h"
  9. #include "map.h"
  10. #include "../hch/CSpellHandler.h"
  11. #include <boost/bind.hpp>
  12. #include <boost/foreach.hpp>
  13. #include <boost/lexical_cast.hpp>
  14. #include <boost/algorithm/string/replace.hpp>
  15. #include <boost/thread.hpp>
  16. #include <boost/thread/shared_mutex.hpp>
  17. #undef min
  18. #undef max
  19. /*
  20. * NetPacksLib.cpp, part of VCMI engine
  21. *
  22. * Authors: listed in file AUTHORS in main folder
  23. *
  24. * License: GNU General Public License v2.0 or later
  25. * Full text of license available in license.txt file, in main folder
  26. *
  27. */
  28. #ifdef min
  29. #undef min
  30. #endif
  31. #ifdef max
  32. #undef max
  33. #endif
  34. DLL_EXPORT void SetResource::applyGs( CGameState *gs )
  35. {
  36. assert(player < PLAYER_LIMIT);
  37. amax(val, 0); //new value must be >= 0
  38. gs->getPlayer(player)->resources[resid] = val;
  39. }
  40. DLL_EXPORT void SetResources::applyGs( CGameState *gs )
  41. {
  42. assert(player < PLAYER_LIMIT);
  43. for(int i=0;i<res.size();i++)
  44. gs->getPlayer(player)->resources[i] = res[i];
  45. }
  46. DLL_EXPORT void SetPrimSkill::applyGs( CGameState *gs )
  47. {
  48. CGHeroInstance *hero = gs->getHero(id);
  49. assert(hero);
  50. if(which <4)
  51. {
  52. Bonus *skill = hero->getBonus(Selector::type(Bonus::PRIMARY_SKILL) && Selector::subtype(which) && Selector::sourceType(Bonus::HERO_BASE_SKILL));
  53. assert(skill);
  54. if(abs)
  55. skill->val = val;
  56. else
  57. skill->val += val;
  58. }
  59. else if(which == 4) //XP
  60. {
  61. if(abs)
  62. hero->exp = val;
  63. else
  64. hero->exp += val;
  65. }
  66. }
  67. DLL_EXPORT void SetSecSkill::applyGs( CGameState *gs )
  68. {
  69. CGHeroInstance *hero = gs->getHero(id);
  70. if(hero->getSecSkillLevel(which) == 0)
  71. {
  72. hero->secSkills.push_back(std::pair<int,int>(which, val));
  73. }
  74. else
  75. {
  76. for(unsigned i=0;i<hero->secSkills.size();i++)
  77. {
  78. if(hero->secSkills[i].first == which)
  79. {
  80. if(abs)
  81. hero->secSkills[i].second = val;
  82. else
  83. hero->secSkills[i].second += val;
  84. if(hero->secSkills[i].second > 3) //workaround to avoid crashes when same sec skill is given more than once
  85. {
  86. tlog1 << "Warning: Skill " << which << " increased over limit! Decreasing to Expert.\n";
  87. hero->secSkills[i].second = 3;
  88. }
  89. }
  90. }
  91. }
  92. }
  93. DLL_EXPORT void HeroVisitCastle::applyGs( CGameState *gs )
  94. {
  95. CGHeroInstance *h = gs->getHero(hid);
  96. CGTownInstance *t = gs->getTown(tid);
  97. if(start())
  98. {
  99. if(garrison())
  100. {
  101. t->garrisonHero = h;
  102. h->visitedTown = t;
  103. h->inTownGarrison = true;
  104. }
  105. else
  106. {
  107. t->visitingHero = h;
  108. h->visitedTown = t;
  109. h->inTownGarrison = false;
  110. }
  111. }
  112. else
  113. {
  114. if(garrison())
  115. {
  116. t->garrisonHero = NULL;
  117. h->visitedTown = NULL;
  118. h->inTownGarrison = false;
  119. }
  120. else
  121. {
  122. t->visitingHero = NULL;
  123. h->visitedTown = NULL;
  124. h->inTownGarrison = false;
  125. }
  126. }
  127. }
  128. DLL_EXPORT void ChangeSpells::applyGs( CGameState *gs )
  129. {
  130. CGHeroInstance *hero = gs->getHero(hid);
  131. if(learn)
  132. BOOST_FOREACH(ui32 sid, spells)
  133. hero->spells.insert(sid);
  134. else
  135. BOOST_FOREACH(ui32 sid, spells)
  136. hero->spells.erase(sid);
  137. }
  138. DLL_EXPORT void SetMana::applyGs( CGameState *gs )
  139. {
  140. CGHeroInstance *hero = gs->getHero(hid);
  141. amax(val, 0); //not less than 0
  142. hero->mana = val;
  143. }
  144. DLL_EXPORT void SetMovePoints::applyGs( CGameState *gs )
  145. {
  146. CGHeroInstance *hero = gs->getHero(hid);
  147. hero->movement = val;
  148. }
  149. DLL_EXPORT void FoWChange::applyGs( CGameState *gs )
  150. {
  151. BOOST_FOREACH(int3 t, tiles)
  152. gs->getPlayer(player)->fogOfWarMap[t.x][t.y][t.z] = mode;
  153. if (mode == 0) //do not hide too much
  154. {
  155. std::set<int3> tilesRevealed;
  156. for (size_t i = 0; i < gs->map->objects.size(); i++)
  157. {
  158. if(gs->map->objects[i] && gs->map->objects[i]->tempOwner == player) //check owned observators
  159. {
  160. switch(gs->map->objects[i]->ID)
  161. {
  162. case 34://hero
  163. case 53://mine
  164. case 98://town
  165. case 220:
  166. gs->map->objects[i]->getSightTiles(tilesRevealed);
  167. break;
  168. }
  169. }
  170. }
  171. BOOST_FOREACH(int3 t, tilesRevealed) //probably not the most optimal solution ever
  172. gs->getPlayer(player)->fogOfWarMap[t.x][t.y][t.z] = 1;
  173. }
  174. }
  175. DLL_EXPORT void SetAvailableHeroes::applyGs( CGameState *gs )
  176. {
  177. PlayerState *p = gs->getPlayer(player);
  178. p->availableHeroes.clear();
  179. for (int i = 0; i < AVAILABLE_HEROES_PER_PLAYER; i++)
  180. {
  181. CGHeroInstance *h = (hid[i]>=0 ? gs->hpool.heroesPool[hid[i]] : NULL);
  182. if(h && army[i])
  183. h->setArmy(*army[i]);
  184. p->availableHeroes.push_back(h);
  185. }
  186. }
  187. DLL_EXPORT void GiveBonus::applyGs( CGameState *gs )
  188. {
  189. BonusList *bonuses = NULL;
  190. switch(who)
  191. {
  192. case HERO:
  193. {
  194. CGHeroInstance *h = gs->getHero(id);
  195. assert(h);
  196. bonuses = &h->bonuses;
  197. }
  198. break;
  199. case PLAYER:
  200. {
  201. PlayerState *p = gs->getPlayer(id);
  202. assert(p);
  203. bonuses = &p->bonuses;
  204. }
  205. break;
  206. case TOWN:
  207. {
  208. CGTownInstance *t = gs->getTown(id);
  209. assert(t);
  210. bonuses = &t->bonuses;
  211. }
  212. }
  213. bonuses->push_back(bonus);
  214. std::string &descr = bonuses->back().description;
  215. if(!bdescr.message.size()
  216. && bonus.source == Bonus::OBJECT
  217. && (bonus.type == Bonus::LUCK || bonus.type == Bonus::MORALE)
  218. && gs->map->objects[bonus.id]->ID == EVENTI_TYPE) //it's morale/luck bonus from an event without description
  219. {
  220. descr = VLC->generaltexth->arraytxt[bonus.val > 0 ? 110 : 109]; //+/-%d Temporary until next battle"
  221. boost::replace_first(descr,"%d",boost::lexical_cast<std::string>(std::abs(bonus.val)));
  222. }
  223. else
  224. {
  225. bdescr.toString(descr);
  226. }
  227. }
  228. DLL_EXPORT void ChangeObjPos::applyGs( CGameState *gs )
  229. {
  230. CGObjectInstance *obj = gs->map->objects[objid];
  231. if(!obj)
  232. {
  233. tlog1 << "Wrong ChangeObjPos: object " << objid << " doesn't exist!\n";
  234. return;
  235. }
  236. gs->map->removeBlockVisTiles(obj);
  237. obj->pos = nPos;
  238. gs->map->addBlockVisTiles(obj);
  239. }
  240. DLL_EXPORT void PlayerEndsGame::applyGs( CGameState *gs )
  241. {
  242. PlayerState *p = gs->getPlayer(player);
  243. p->status = victory ? 2 : 1;
  244. }
  245. DLL_EXPORT void RemoveBonus::applyGs( CGameState *gs )
  246. {
  247. std::list<Bonus> &bonuses = (who == HERO ? gs->getHero(whoID)->bonuses : gs->getPlayer(whoID)->bonuses);
  248. for(std::list<Bonus>::iterator i = bonuses.begin(); i != bonuses.end(); i++)
  249. {
  250. if(i->source == source && i->id == id)
  251. {
  252. bonus = *i; //backup bonus (to show to interfaces later)
  253. bonuses.erase(i);
  254. break;
  255. }
  256. }
  257. }
  258. DLL_EXPORT void RemoveObject::applyGs( CGameState *gs )
  259. {
  260. CGObjectInstance *obj = gs->map->objects[id];
  261. //unblock tiles
  262. if(obj->defInfo)
  263. {
  264. gs->map->removeBlockVisTiles(obj);
  265. }
  266. if(obj->ID==HEROI_TYPE)
  267. {
  268. CGHeroInstance *h = static_cast<CGHeroInstance*>(obj);
  269. std::vector<CGHeroInstance*>::iterator nitr = std::find(gs->map->heroes.begin(), gs->map->heroes.end(),h);
  270. gs->map->heroes.erase(nitr);
  271. int player = h->tempOwner;
  272. nitr = std::find(gs->getPlayer(player)->heroes.begin(), gs->getPlayer(player)->heroes.end(), h);
  273. gs->getPlayer(player)->heroes.erase(nitr);
  274. h->tempOwner = 255; //no one owns beaten hero
  275. if(h->visitedTown)
  276. {
  277. if(h->inTownGarrison)
  278. h->visitedTown->garrisonHero = NULL;
  279. else
  280. h->visitedTown->visitingHero = NULL;
  281. h->visitedTown = NULL;
  282. }
  283. //return hero to the pool, so he may reappear in tavern
  284. gs->hpool.heroesPool[h->subID] = h;
  285. if(!vstd::contains(gs->hpool.pavailable, h->subID))
  286. gs->hpool.pavailable[h->subID] = 0xff;
  287. }
  288. else if (obj->ID==CREI_TYPE && gs->map->version > CMapHeader::RoE) //only fixed monsters can be a part of quest
  289. {
  290. CGCreature *cre = static_cast<CGCreature*>(obj);
  291. gs->map->monsters[cre->identifier]->pos = int3 (-1,-1,-1); //use nonexistent monster for quest :>
  292. }
  293. gs->map->objects[id] = NULL;
  294. }
  295. static int getDir(int3 src, int3 dst)
  296. {
  297. int ret = -1;
  298. if(dst.x+1 == src.x && dst.y+1 == src.y) //tl
  299. {
  300. ret = 1;
  301. }
  302. else if(dst.x == src.x && dst.y+1 == src.y) //t
  303. {
  304. ret = 2;
  305. }
  306. else if(dst.x-1 == src.x && dst.y+1 == src.y) //tr
  307. {
  308. ret = 3;
  309. }
  310. else if(dst.x-1 == src.x && dst.y == src.y) //r
  311. {
  312. ret = 4;
  313. }
  314. else if(dst.x-1 == src.x && dst.y-1 == src.y) //br
  315. {
  316. ret = 5;
  317. }
  318. else if(dst.x == src.x && dst.y-1 == src.y) //b
  319. {
  320. ret = 6;
  321. }
  322. else if(dst.x+1 == src.x && dst.y-1 == src.y) //bl
  323. {
  324. ret = 7;
  325. }
  326. else if(dst.x+1 == src.x && dst.y == src.y) //l
  327. {
  328. ret = 8;
  329. }
  330. return ret;
  331. }
  332. void TryMoveHero::applyGs( CGameState *gs )
  333. {
  334. CGHeroInstance *h = gs->getHero(id);
  335. h->movement = movePoints;
  336. if((result == SUCCESS || result == BLOCKING_VISIT || result == EMBARK || result == DISEMBARK) && start != end) {
  337. h->moveDir = getDir(start,end);
  338. }
  339. if(result == EMBARK) //hero enters boat at dest tile
  340. {
  341. const TerrainTile &tt = gs->map->getTile(CGHeroInstance::convertPosition(end, false));
  342. assert(tt.visitableObjects.size() == 1 && tt.visitableObjects.front()->ID == 8); //the only vis obj at dest is Boat
  343. CGBoat *boat = static_cast<CGBoat*>(tt.visitableObjects.front());
  344. gs->map->removeBlockVisTiles(boat); //hero blockvis mask will be used, we don't need to duplicate it with boat
  345. h->boat = boat;
  346. boat->hero = h;
  347. }
  348. else if(result == DISEMBARK) //hero leaves boat to dest tile
  349. {
  350. h->boat->direction = h->moveDir;
  351. h->boat->pos = start;
  352. h->boat->hero = NULL;
  353. gs->map->addBlockVisTiles(h->boat);
  354. h->boat = NULL;
  355. }
  356. if(start!=end && (result == SUCCESS || result == TELEPORTATION || result == EMBARK || result == DISEMBARK))
  357. {
  358. gs->map->removeBlockVisTiles(h);
  359. h->pos = end;
  360. if(h->boat)
  361. h->boat->pos = end;
  362. gs->map->addBlockVisTiles(h);
  363. }
  364. BOOST_FOREACH(int3 t, fowRevealed)
  365. gs->getPlayer(h->getOwner())->fogOfWarMap[t.x][t.y][t.z] = 1;
  366. }
  367. DLL_EXPORT void SetGarrisons::applyGs( CGameState *gs )
  368. {
  369. for(std::map<ui32,CCreatureSet>::iterator i = garrs.begin(); i!=garrs.end(); i++)
  370. {
  371. CArmedInstance *ai = static_cast<CArmedInstance*>(gs->map->objects[i->first]);
  372. ai->setArmy(i->second);
  373. if(ai->ID==TOWNI_TYPE && (static_cast<CGTownInstance*>(ai))->garrisonHero) //if there is a hero in garrison then we must update also his army
  374. const_cast<CGHeroInstance*>((static_cast<CGTownInstance*>(ai))->garrisonHero)->setArmy(i->second);
  375. else if(ai->ID==HEROI_TYPE)
  376. {
  377. CGHeroInstance *h = static_cast<CGHeroInstance*>(ai);
  378. if(h->visitedTown && h->inTownGarrison)
  379. h->visitedTown->setArmy(i->second);
  380. }
  381. }
  382. }
  383. DLL_EXPORT void NewStructures::applyGs( CGameState *gs )
  384. {
  385. CGTownInstance *t = gs->getTown(tid);
  386. BOOST_FOREACH(si32 id,bid)
  387. {
  388. t->builtBuildings.insert(id);
  389. }
  390. t->builded = builded;
  391. }
  392. DLL_EXPORT void RazeStructures::applyGs( CGameState *gs )
  393. {
  394. CGTownInstance *t = gs->getTown(tid);
  395. BOOST_FOREACH(si32 id,bid)
  396. {
  397. t->builtBuildings.erase(id);
  398. }
  399. t->destroyed = destroyed; //yeaha
  400. }
  401. DLL_EXPORT void SetAvailableCreatures::applyGs( CGameState *gs )
  402. {
  403. CGDwelling *dw = dynamic_cast<CGDwelling*>(gs->map->objects[tid]);
  404. assert(dw);
  405. dw->creatures = creatures;
  406. }
  407. DLL_EXPORT void SetHeroesInTown::applyGs( CGameState *gs )
  408. {
  409. CGTownInstance *t = gs->getTown(tid);
  410. CGHeroInstance *v = gs->getHero(visiting),
  411. *g = gs->getHero(garrison);
  412. t->visitingHero = v;
  413. t->garrisonHero = g;
  414. if(v)
  415. {
  416. v->visitedTown = t;
  417. v->inTownGarrison = false;
  418. gs->map->addBlockVisTiles(v);
  419. }
  420. if(g)
  421. {
  422. g->visitedTown = t;
  423. g->inTownGarrison = true;
  424. gs->map->removeBlockVisTiles(g);
  425. }
  426. }
  427. DLL_EXPORT void SetHeroArtifacts::applyGs( CGameState *gs )
  428. {
  429. CGHeroInstance *h = gs->getHero(hid);
  430. std::vector<ui32> equiped, unequiped;
  431. for(std::map<ui16,ui32>::const_iterator i = h->artifWorn.begin(); i != h->artifWorn.end(); i++)
  432. if(!vstd::contains(artifWorn,i->first) || artifWorn[i->first] != i->second)
  433. unequiped.push_back(i->second);
  434. for(std::map<ui16,ui32>::const_iterator i = artifWorn.begin(); i != artifWorn.end(); i++)
  435. if(!vstd::contains(h->artifWorn,i->first) || h->artifWorn[i->first] != i->second)
  436. equiped.push_back(i->second);
  437. BOOST_FOREACH(ui32 id, equiped)
  438. {
  439. //if hero already had equipped at least one artifact of that type, don't give any new bonuses
  440. if(h->getArtPos(id) >= 0)
  441. continue;
  442. CArtifact &art = *VLC->arth->artifacts[id];
  443. art.addBonusesTo(&h->bonuses);
  444. art.addBonusesTo(&gained);
  445. }
  446. //update hero data
  447. h->artifacts = artifacts;
  448. h->artifWorn = artifWorn;
  449. //remove bonus from unequipped artifact
  450. BOOST_FOREACH(ui32 id, unequiped)
  451. {
  452. //if hero still has equipped at least one artifact of that type, don't remove bonuses
  453. if(h->getArtPos(id) >= 0)
  454. continue;
  455. CArtifact &art = *VLC->arth->artifacts[id];
  456. art.removeBonusesFrom(&h->bonuses);
  457. art.addBonusesTo(&lost);
  458. }
  459. }
  460. DLL_EXPORT void SetHeroArtifacts::setArtAtPos(ui16 pos, int art)
  461. {
  462. if(art<0)
  463. {
  464. if(pos<19)
  465. VLC->arth->unequipArtifact(artifWorn, pos);
  466. else if (pos - 19 < artifacts.size())
  467. artifacts.erase(artifacts.begin() + (pos - 19));
  468. }
  469. else
  470. {
  471. if (pos < 19) {
  472. VLC->arth->equipArtifact(artifWorn, pos, (ui32) art);
  473. } else { // Goes into the backpack.
  474. if(pos - 19 < artifacts.size())
  475. artifacts.insert(artifacts.begin() + (pos - 19), art);
  476. else
  477. artifacts.push_back(art);
  478. }
  479. }
  480. }
  481. DLL_EXPORT void HeroRecruited::applyGs( CGameState *gs )
  482. {
  483. assert(vstd::contains(gs->hpool.heroesPool, hid));
  484. CGHeroInstance *h = gs->hpool.heroesPool[hid];
  485. CGTownInstance *t = gs->getTown(tid);
  486. h->setOwner(player);
  487. h->pos = tile;
  488. h->movement = h->maxMovePoints(true);
  489. gs->hpool.heroesPool.erase(hid);
  490. if(h->id < 0)
  491. {
  492. h->id = gs->map->objects.size();
  493. gs->map->objects.push_back(h);
  494. }
  495. else
  496. gs->map->objects[h->id] = h;
  497. h->initHeroDefInfo();
  498. gs->map->heroes.push_back(h);
  499. gs->getPlayer(h->getOwner())->heroes.push_back(h);
  500. h->initObj();
  501. gs->map->addBlockVisTiles(h);
  502. if(t)
  503. {
  504. t->visitingHero = h;
  505. h->visitedTown = t;
  506. }
  507. h->inTownGarrison = false;
  508. }
  509. DLL_EXPORT void GiveHero::applyGs( CGameState *gs )
  510. {
  511. CGHeroInstance *h = gs->getHero(id);
  512. gs->map->removeBlockVisTiles(h,true);
  513. h->setOwner(player);
  514. h->movement = h->maxMovePoints(true);
  515. h->initHeroDefInfo();
  516. gs->map->heroes.push_back(h);
  517. gs->getPlayer(h->getOwner())->heroes.push_back(h);
  518. gs->map->addBlockVisTiles(h);
  519. h->inTownGarrison = false;
  520. }
  521. DLL_EXPORT void NewObject::applyGs( CGameState *gs )
  522. {
  523. CGObjectInstance *o = NULL;
  524. switch(ID)
  525. {
  526. case 8:
  527. o = new CGBoat();
  528. break;
  529. default:
  530. o = new CGObjectInstance();
  531. break;
  532. }
  533. o->ID = ID;
  534. o->subID = subID;
  535. o->pos = pos;
  536. o->defInfo = VLC->dobjinfo->gobjs[ID][subID];
  537. id = o->id = gs->map->objects.size();
  538. o->hoverName = VLC->generaltexth->names[ID];
  539. if(ID == 124) // hole
  540. {
  541. const TerrainTile &t = gs->map->getTile(pos);
  542. o->defInfo = VLC->dobjinfo->gobjs[ID][t.tertype];
  543. assert(o->defInfo);
  544. }
  545. gs->map->objects.push_back(o);
  546. gs->map->addBlockVisTiles(o);
  547. o->initObj();
  548. assert(o->defInfo);
  549. }
  550. DLL_EXPORT void SetAvailableArtifacts::applyGs( CGameState *gs )
  551. {
  552. if(id >= 0)
  553. {
  554. if(CGBlackMarket *bm = dynamic_cast<CGBlackMarket*>(gs->map->objects[id]))
  555. {
  556. bm->artifacts = arts;
  557. }
  558. else
  559. {
  560. tlog1 << "Wrong black market id!" << std::endl;
  561. }
  562. }
  563. else
  564. {
  565. CGTownInstance::merchantArtifacts = arts;
  566. }
  567. }
  568. DLL_EXPORT void NewTurn::applyGs( CGameState *gs )
  569. {
  570. gs->day = day;
  571. BOOST_FOREACH(NewTurn::Hero h, heroes) //give mana/movement point
  572. {
  573. CGHeroInstance *hero = gs->getHero(h.id);
  574. hero->movement = h.move;
  575. hero->mana = h.mana;
  576. }
  577. for(std::map<ui8, std::vector<si32> >::iterator i = res.begin(); i != res.end(); i++)
  578. {
  579. assert(i->first < PLAYER_LIMIT);
  580. std::vector<si32> &playerRes = gs->getPlayer(i->first)->resources;
  581. for(int j = 0; j < i->second.size(); j++)
  582. playerRes[j] = i->second[j];
  583. }
  584. BOOST_FOREACH(SetAvailableCreatures h, cres) //set available creatures in towns
  585. h.applyGs(gs);
  586. if(resetBuilded) //reset amount of structures set in this turn in towns
  587. BOOST_FOREACH(CGTownInstance* t, gs->map->towns)
  588. t->builded = 0;
  589. BOOST_FOREACH(CGHeroInstance *h, gs->map->heroes)
  590. h->bonuses.remove_if(Bonus::OneDay);
  591. if(gs->getDate(1) == 7) //new week
  592. BOOST_FOREACH(CGHeroInstance *h, gs->map->heroes)
  593. h->bonuses.remove_if(Bonus::OneWeek);
  594. //count days without town
  595. for( std::map<ui8, PlayerState>::iterator i=gs->players.begin() ; i!=gs->players.end();i++)
  596. {
  597. if(i->second.towns.size() || gs->day == 1)
  598. i->second.daysWithoutCastle = 0;
  599. else
  600. i->second.daysWithoutCastle++;
  601. i->second.bonuses.remove_if(Bonus::OneDay);
  602. if(gs->getDate(1) == 7) //new week
  603. i->second.bonuses.remove_if(Bonus::OneWeek);
  604. }
  605. }
  606. DLL_EXPORT void SetObjectProperty::applyGs( CGameState *gs )
  607. {
  608. CGObjectInstance *obj = gs->map->objects[id];
  609. if(!obj)
  610. {
  611. tlog1 << "Wrong object ID - property cannot be set!\n";
  612. return;
  613. }
  614. if(what == ObjProperty::OWNER)
  615. {
  616. if(obj->ID == TOWNI_TYPE)
  617. {
  618. CGTownInstance *t = static_cast<CGTownInstance*>(obj);
  619. if(t->tempOwner < PLAYER_LIMIT)
  620. gs->getPlayer(t->tempOwner)->towns -= t;
  621. if(val < PLAYER_LIMIT)
  622. gs->getPlayer(val)->towns.push_back(t);
  623. }
  624. }
  625. obj->setProperty(what,val);
  626. }
  627. DLL_EXPORT void SetHoverName::applyGs( CGameState *gs )
  628. {
  629. name.toString(gs->map->objects[id]->hoverName);
  630. }
  631. DLL_EXPORT void HeroLevelUp::applyGs( CGameState *gs )
  632. {
  633. CGHeroInstance* h = gs->getHero(heroid);
  634. h->level = level;
  635. //speciality
  636. if (h->speciality.growthsWithLevel)
  637. {
  638. std::vector<CCreature*>* creatures = &VLC->creh->creatures;
  639. for (std::list<Bonus>::iterator it = h->speciality.bonuses.begin(); it != h->speciality.bonuses.end(); it++)
  640. {
  641. switch (it->type)
  642. {
  643. case Bonus::SECONDARY_SKILL_PREMY:
  644. it->val = (h->speciality.valOfBonuses(Bonus::SPECIAL_SECONDARY_SKILL, it->subtype) *
  645. h->valOfBonuses(Bonus::SECONDARY_SKILL_PREMY,it->subtype) * h->level)/100;
  646. break;
  647. case Bonus::PRIMARY_SKILL:
  648. int creLevel = (*creatures)[it->additionalInfo]->level;
  649. if(!creLevel)
  650. {
  651. if(it->additionalInfo == 146)
  652. creLevel = 5; //treat ballista as 5-level
  653. else
  654. {
  655. tlog2 << "Warning: unknown level of " << (*creatures)[it->val]->namePl << std::endl;
  656. continue;
  657. }
  658. }
  659. switch (it->subtype)
  660. {
  661. case 1:
  662. it->val = (level * (*creatures)[it->additionalInfo]->attack)/creLevel /20;
  663. break;
  664. case 2:
  665. it->val = (level * (*creatures)[it->additionalInfo]->defence)/creLevel /20;
  666. break;
  667. }
  668. break;
  669. }
  670. }
  671. }
  672. }
  673. DLL_EXPORT void BattleStart::applyGs( CGameState *gs )
  674. {
  675. gs->curB = info;
  676. info->belligerents[0]->battle = info->belligerents[1]->battle = info;
  677. }
  678. DLL_EXPORT void BattleNextRound::applyGs( CGameState *gs )
  679. {
  680. gs->curB->castSpells[0] = gs->curB->castSpells[1] = 0;
  681. gs->curB->round = round;
  682. BOOST_FOREACH(CStack *s, gs->curB->stacks)
  683. {
  684. s->state -= DEFENDING;
  685. s->state -= WAITING;
  686. s->state -= MOVED;
  687. s->state -= HAD_MORALE;
  688. s->counterAttacks = 1 + s->valOfBonuses(Bonus::ADDITIONAL_RETALIATION);
  689. //regeneration
  690. if( s->hasBonusOfType(Bonus::HP_REGENERATION) && s->alive() )
  691. s->firstHPleft = std::min<ui32>( s->MaxHealth(), s->valOfBonuses(Bonus::HP_REGENERATION) );
  692. if( s->hasBonusOfType(Bonus::FULL_HP_REGENERATION) && s->alive() )
  693. s->firstHPleft = s->MaxHealth();
  694. //remove effects and restore only those with remaining turns in duration
  695. std::vector<CStack::StackEffect> tmpEffects = s->effects;
  696. s->effects.clear();
  697. for(int i=0; i < tmpEffects.size(); i++)
  698. {
  699. tmpEffects[i].turnsRemain--;
  700. if(tmpEffects[i].turnsRemain > 0)
  701. s->effects.push_back(tmpEffects[i]);
  702. }
  703. //the same as above for features
  704. BonusList tmpFeatures = s->bonuses;
  705. s->bonuses.clear();
  706. BOOST_FOREACH(Bonus &b, tmpFeatures)
  707. {
  708. if((b.duration & Bonus::N_TURNS) != 0)
  709. {
  710. b.turnsRemain--;
  711. if(b.turnsRemain > 0)
  712. s->bonuses.push_back(b);
  713. }
  714. else
  715. {
  716. s->bonuses.push_back(b);
  717. }
  718. }
  719. }
  720. }
  721. DLL_EXPORT void BattleSetActiveStack::applyGs( CGameState *gs )
  722. {
  723. gs->curB->activeStack = stack;
  724. CStack *st = gs->curB->getStack(stack);
  725. if(vstd::contains(st->state,MOVED)) //if stack is moving second time this turn it must had a high morale bonus
  726. st->state.insert(HAD_MORALE);
  727. }
  728. void BattleResult::applyGs( CGameState *gs )
  729. {
  730. for(unsigned i=0;i<gs->curB->stacks.size();i++)
  731. delete gs->curB->stacks[i];
  732. //remove any "until next battle" bonuses
  733. CGHeroInstance *h;
  734. h = gs->curB->heroes[0];
  735. if(h)
  736. h->bonuses.remove_if(Bonus::OneBattle);
  737. h = gs->curB->heroes[1];
  738. if(h)
  739. h->bonuses.remove_if(Bonus::OneBattle);
  740. gs->curB->belligerents[0]->battle = gs->curB->belligerents[1]->battle = NULL;
  741. delete gs->curB;
  742. gs->curB = NULL;
  743. }
  744. void BattleStackMoved::applyGs( CGameState *gs )
  745. {
  746. gs->curB->getStack(stack)->position = tile;
  747. }
  748. DLL_EXPORT void BattleStackAttacked::applyGs( CGameState *gs )
  749. {
  750. CStack * at = gs->curB->getStack(stackAttacked);
  751. at->count = newAmount;
  752. at->firstHPleft = newHP;
  753. if(killed())
  754. at->state -= ALIVE;
  755. //life drain handling
  756. for (int g=0; g<healedStacks.size(); ++g)
  757. {
  758. healedStacks[g].applyGs(gs);
  759. }
  760. }
  761. DLL_EXPORT void BattleAttack::applyGs( CGameState *gs )
  762. {
  763. CStack *attacker = gs->curB->getStack(stackAttacking);
  764. if(counter())
  765. attacker->counterAttacks--;
  766. if(shot())
  767. {
  768. //don't remove ammo if we have a working ammo cart
  769. bool hasAmmoCart = false;
  770. BOOST_FOREACH(const CStack * st, gs->curB->stacks)
  771. {
  772. if(st->owner == attacker->owner && st->type->idNumber == 148 && st->alive())
  773. {
  774. hasAmmoCart = true;
  775. break;
  776. }
  777. }
  778. if (!hasAmmoCart)
  779. {
  780. attacker->shots--;
  781. }
  782. }
  783. BOOST_FOREACH(BattleStackAttacked stackAttacked, bsa)
  784. stackAttacked.applyGs(gs);
  785. attacker->bonuses.remove_if(Bonus::UntilAttack);
  786. for(std::vector<BattleStackAttacked>::const_iterator it = bsa.begin(); it != bsa.end(); ++it)
  787. {
  788. CStack * stack = gs->curB->getStack(it->stackAttacked, false);
  789. stack->bonuses.remove_if(Bonus::UntilBeingAttacked);
  790. }
  791. }
  792. DLL_EXPORT void StartAction::applyGs( CGameState *gs )
  793. {
  794. CStack *st = gs->curB->getStack(ba.stackNumber);
  795. if(ba.actionType != 1) //don't check for stack if it's custom action by hero
  796. assert(st);
  797. switch(ba.actionType)
  798. {
  799. case 3:
  800. st->state.insert(DEFENDING);
  801. break;
  802. case 8:
  803. st->state.insert(WAITING);
  804. return;
  805. case 0: case 2: case 6: case 7: case 9: case 10: case 11: case 12:
  806. st->state.insert(MOVED);
  807. break;
  808. }
  809. if(st)
  810. st->state -= WAITING; //if stack was waiting it has made move, so it won't be "waiting" anymore (if the action was WAIT, then we have returned)
  811. }
  812. DLL_EXPORT void BattleSpellCast::applyGs( CGameState *gs )
  813. {
  814. assert(gs->curB);
  815. CGHeroInstance *h = (side) ? gs->curB->heroes[1] : gs->curB->heroes[0];
  816. if(h && castedByHero)
  817. {
  818. int spellCost = 0;
  819. if(gs->curB)
  820. {
  821. spellCost = gs->curB->getSpellCost(&VLC->spellh->spells[id], h);
  822. }
  823. else
  824. {
  825. spellCost = VLC->spellh->spells[id].costs[skill];
  826. }
  827. h->mana -= spellCost;
  828. if(h->mana < 0) h->mana = 0;
  829. }
  830. if(side >= 0 && side < 2 && castedByHero)
  831. {
  832. gs->curB->castSpells[side]++;
  833. }
  834. if(id == 35 || id == 78) //dispel and dispel helpful spells
  835. {
  836. bool onlyHelpful = id == 78;
  837. for(std::set<ui32>::const_iterator it = affectedCres.begin(); it != affectedCres.end(); ++it)
  838. {
  839. CStack *s = gs->curB->getStack(*it);
  840. if(s && !vstd::contains(resisted, s->ID)) //if stack exists and it didn't resist
  841. {
  842. std::vector<CStack::StackEffect> remainingEff;
  843. for(int g=0; g< s->effects.size(); ++g)
  844. {
  845. if (onlyHelpful && VLC->spellh->spells[ s->effects[g].id ].positiveness != 1)
  846. {
  847. remainingEff.push_back(s->effects[g]);
  848. }
  849. }
  850. s->effects.clear(); //removing all effects
  851. s->effects = remainingEff; //assigning effects that should remain
  852. //removing all features from spells
  853. BonusList tmpFeatures = s->bonuses;
  854. s->bonuses.clear();
  855. BOOST_FOREACH(Bonus &b, tmpFeatures)
  856. {
  857. const CSpell *sp = b.sourceSpell();
  858. if(sp && sp->positiveness != 1) //if(b.source != HeroBonus::SPELL_EFFECT || b.positiveness != 1)
  859. s->bonuses.push_back(b);
  860. }
  861. }
  862. }
  863. }
  864. //elemental summoning
  865. if(id >= 66 && id <= 69)
  866. {
  867. int creID;
  868. switch(id)
  869. {
  870. case 66:
  871. creID = 114; //fire elemental
  872. break;
  873. case 67:
  874. creID = 113; //earth elemental
  875. break;
  876. case 68:
  877. creID = 115; //water elemental
  878. break;
  879. case 69:
  880. creID = 112; //air elemental
  881. break;
  882. }
  883. const int3 & tile = gs->curB->tile;
  884. TerrainTile::EterrainType ter = gs->map->terrain[tile.x][tile.y][tile.z].tertype;
  885. int pos; //position of stack on the battlefield - to be calculated
  886. bool ac[BFIELD_SIZE];
  887. std::set<int> occupyable;
  888. bool twoHex = VLC->creh->creatures[creID]->isDoubleWide();
  889. bool flying = vstd::contains(VLC->creh->creatures[creID]->bonuses, Bonus::FLYING);
  890. gs->curB->getAccessibilityMap(ac, twoHex, !side, true, occupyable, flying);
  891. for(int g=0; g<BFIELD_SIZE; ++g)
  892. {
  893. if(g % BFIELD_WIDTH != 0 && g % BFIELD_WIDTH != BFIELD_WIDTH-1 && BattleInfo::isAccessible(g, ac, twoHex, !side, flying, true) )
  894. {
  895. pos = g;
  896. break;
  897. }
  898. }
  899. CStack * summonedStack = gs->curB->generateNewStack(CStackInstance(creID, h->getPrimSkillLevel(2) * VLC->spellh->spells[id].powers[skill], h), gs->curB->stacks.size(), !side, 255, ter, pos);
  900. summonedStack->state.insert(SUMMONED);
  901. //summonedStack->bonuses.push_back( makeFeature(HeroBonus::SUMMONED, HeroBonus::ONE_BATTLE, 0, 0, HeroBonus::BONUS_FROM_HERO) );
  902. gs->curB->stacks.push_back(summonedStack);
  903. }
  904. }
  905. static inline Bonus featureGenerator(Bonus::BonusType type, si16 subtype, si32 value, ui16 turnsRemain, si32 additionalInfo = 0, si32 limit = Bonus::NO_LIMIT)
  906. {
  907. Bonus hb(makeFeature(type, Bonus::N_TURNS, subtype, value, Bonus::SPELL_EFFECT, turnsRemain, additionalInfo));
  908. hb.effectRange = limit;
  909. return hb;
  910. }
  911. static inline Bonus featureGeneratorVT(Bonus::BonusType type, si16 subtype, si32 value, ui16 turnsRemain, ui8 valType)
  912. {
  913. Bonus ret(makeFeature(type, Bonus::N_TURNS, subtype, value, Bonus::SPELL_EFFECT, turnsRemain));
  914. ret.valType = valType;
  915. return ret;
  916. }
  917. static BonusList stackEffectToFeature(const CStack::StackEffect & sse)
  918. {
  919. BonusList sf;
  920. si32 power = VLC->spellh->spells[sse.id].powers[sse.level];
  921. switch(sse.id)
  922. {
  923. case 27: //shield
  924. sf.push_back(featureGenerator(Bonus::GENERAL_DAMAGE_REDUCTION, 0, power, sse.turnsRemain));
  925. sf.back().id = sse.id;
  926. break;
  927. case 28: //air shield
  928. sf.push_back(featureGenerator(Bonus::GENERAL_DAMAGE_REDUCTION, 1, power, sse.turnsRemain));
  929. sf.back().id = sse.id;
  930. break;
  931. case 29: //fire shield
  932. sf.push_back(featureGenerator(Bonus::FIRE_SHIELD, 0, power, sse.turnsRemain));
  933. sf.back().id = sse.id;
  934. break;
  935. case 30: //protection from air
  936. sf.push_back(featureGenerator(Bonus::SPELL_DAMAGE_REDUCTION, 0, power, sse.turnsRemain));
  937. sf.back().id = sse.id;
  938. break;
  939. case 31: //protection from fire
  940. sf.push_back(featureGenerator(Bonus::SPELL_DAMAGE_REDUCTION, 1, power, sse.turnsRemain));
  941. sf.back().id = sse.id;
  942. break;
  943. case 32: //protection from water
  944. sf.push_back(featureGenerator(Bonus::SPELL_DAMAGE_REDUCTION, 2, power, sse.turnsRemain));
  945. sf.back().id = sse.id;
  946. break;
  947. case 33: //protection from earth
  948. sf.push_back(featureGenerator(Bonus::SPELL_DAMAGE_REDUCTION, 3, power, sse.turnsRemain));
  949. sf.back().id = sse.id;
  950. break;
  951. case 34: //anti-magic
  952. sf.push_back(featureGenerator(Bonus::LEVEL_SPELL_IMMUNITY, 0, power - 1, sse.turnsRemain));
  953. sf.back().id = sse.id;
  954. break;
  955. case 41: //bless
  956. sf.push_back(featureGenerator(Bonus::ALWAYS_MAXIMUM_DAMAGE, -1, power, sse.turnsRemain));
  957. sf.back().id = sse.id;
  958. break;
  959. case 42: //curse
  960. sf.push_back(featureGenerator(Bonus::ALWAYS_MINIMUM_DAMAGE, -1, -1 * power, sse.turnsRemain, sse.level >= 2 ? 20 : 0));
  961. sf.back().id = sse.id;
  962. break;
  963. case 43: //bloodlust
  964. sf.push_back(featureGenerator(Bonus::PRIMARY_SKILL, PrimarySkill::ATTACK, power, sse.turnsRemain, 0, Bonus::ONLY_MELEE_FIGHT));
  965. sf.back().id = sse.id;
  966. break;
  967. case 44: //precision
  968. sf.push_back(featureGenerator(Bonus::PRIMARY_SKILL, PrimarySkill::ATTACK, power, sse.turnsRemain, 0, Bonus::ONLY_DISTANCE_FIGHT));
  969. sf.back().id = sse.id;
  970. break;
  971. case 45: //weakness
  972. sf.push_back(featureGenerator(Bonus::PRIMARY_SKILL, PrimarySkill::ATTACK, -1 * power, sse.turnsRemain));
  973. sf.back().id = sse.id;
  974. break;
  975. case 46: //stone skin
  976. sf.push_back(featureGenerator(Bonus::PRIMARY_SKILL, PrimarySkill::DEFENSE, power, sse.turnsRemain));
  977. sf.back().id = sse.id;
  978. break;
  979. case 47: //disrupting ray
  980. sf.push_back(featureGenerator(Bonus::PRIMARY_SKILL, PrimarySkill::DEFENSE, -1 * power, sse.turnsRemain));
  981. sf.back().id = sse.id;
  982. break;
  983. case 48: //prayer
  984. sf.push_back(featureGenerator(Bonus::PRIMARY_SKILL, PrimarySkill::ATTACK, power, sse.turnsRemain));
  985. sf.back().id = sse.id;
  986. sf.push_back(featureGenerator(Bonus::PRIMARY_SKILL, PrimarySkill::DEFENSE, power, sse.turnsRemain));
  987. sf.back().id = sse.id;
  988. sf.push_back(featureGenerator(Bonus::STACKS_SPEED, 0, power, sse.turnsRemain));
  989. sf.back().id = sse.id;
  990. break;
  991. case 49: //mirth
  992. sf.push_back(featureGenerator(Bonus::MORALE, 0, power, sse.turnsRemain));
  993. sf.back().id = sse.id;
  994. break;
  995. case 50: //sorrow
  996. sf.push_back(featureGenerator(Bonus::MORALE, 0, -1 * power, sse.turnsRemain));
  997. sf.back().id = sse.id;
  998. break;
  999. case 51: //fortune
  1000. sf.push_back(featureGenerator(Bonus::LUCK, 0, power, sse.turnsRemain));
  1001. sf.back().id = sse.id;
  1002. break;
  1003. case 52: //misfortune
  1004. sf.push_back(featureGenerator(Bonus::LUCK, 0, -1 * power, sse.turnsRemain));
  1005. sf.back().id = sse.id;
  1006. break;
  1007. case 53: //haste
  1008. sf.push_back(featureGenerator(Bonus::STACKS_SPEED, 0, power, sse.turnsRemain));
  1009. sf.back().id = sse.id;
  1010. break;
  1011. case 54: //slow
  1012. sf.push_back(featureGeneratorVT(Bonus::STACKS_SPEED, 0, -1 * ( 100 - power ), sse.turnsRemain, Bonus::PERCENT_TO_ALL));
  1013. sf.back().id = sse.id;
  1014. break;
  1015. case 55: //slayer
  1016. sf.push_back(featureGenerator(Bonus::SLAYER, 0, sse.level, sse.turnsRemain));
  1017. sf.back().id = sse.id;
  1018. break;
  1019. case 56: //frenzy
  1020. sf.push_back(featureGenerator(Bonus::IN_FRENZY, 0, VLC->spellh->spells[56].powers[sse.level]/100.0, sse.turnsRemain));
  1021. sf.back().id = sse.id;
  1022. break;
  1023. case 58: //counterstrike
  1024. sf.push_back(featureGenerator(Bonus::ADDITIONAL_RETALIATION, 0, power, sse.turnsRemain));
  1025. sf.back().id = sse.id;
  1026. break;
  1027. case 59: //bersek
  1028. sf.push_back(featureGenerator(Bonus::ATTACKS_NEAREST_CREATURE, 0, sse.level, sse.turnsRemain));
  1029. sf.back().id = sse.id;
  1030. break;
  1031. case 60: //hypnotize
  1032. sf.push_back(featureGenerator(Bonus::HYPNOTIZED, 0, sse.level, sse.turnsRemain));
  1033. sf.back().id = sse.id;
  1034. break;
  1035. case 61: //forgetfulness
  1036. sf.push_back(featureGenerator(Bonus::FORGETFULL, 0, sse.level, sse.turnsRemain));
  1037. sf.back().id = sse.id;
  1038. break;
  1039. case 62: //blind
  1040. sf.push_back(makeFeature(Bonus::NOT_ACTIVE, Bonus::UNITL_BEING_ATTACKED | Bonus::N_TURNS, 0, 0, Bonus::SPELL_EFFECT, sse.turnsRemain));
  1041. sf.back().id = sse.id;
  1042. sf.push_back(makeFeature(Bonus::GENERAL_ATTACK_REDUCTION, Bonus::UNTIL_ATTACK | Bonus::N_TURNS, 0, power, Bonus::SPELL_EFFECT, sse.turnsRemain));
  1043. sf.back().id = sse.id;
  1044. break;
  1045. }
  1046. return sf;
  1047. }
  1048. void actualizeEffect(CStack * s, CStack::StackEffect & ef)
  1049. {
  1050. //actualizing effects vector
  1051. for(int g=0; g<s->effects.size(); ++g)
  1052. {
  1053. if(s->effects[g].id == ef.id)
  1054. {
  1055. s->effects[g].turnsRemain = std::max(s->effects[g].turnsRemain, ef.turnsRemain);
  1056. }
  1057. }
  1058. //actualizing features vector
  1059. BonusList sf = stackEffectToFeature(ef);
  1060. BOOST_FOREACH(const Bonus &fromEffect, sf)
  1061. {
  1062. BOOST_FOREACH(Bonus &stackBonus, s->bonuses)
  1063. {
  1064. if(stackBonus.source == Bonus::SPELL_EFFECT && stackBonus.type == fromEffect.type && stackBonus.subtype == fromEffect.subtype)
  1065. {
  1066. stackBonus.turnsRemain = std::max(stackBonus.turnsRemain, ef.turnsRemain);
  1067. }
  1068. }
  1069. }
  1070. }
  1071. bool containsEff(const std::vector<CStack::StackEffect> & vec, int effectId)
  1072. {
  1073. for(int g=0; g<vec.size(); ++g)
  1074. {
  1075. if(vec[g].id == effectId)
  1076. return true;
  1077. }
  1078. return false;
  1079. }
  1080. DLL_EXPORT void SetStackEffect::applyGs( CGameState *gs )
  1081. {
  1082. BOOST_FOREACH(ui32 id, stacks)
  1083. {
  1084. CStack *s = gs->curB->getStack(id);
  1085. if(s)
  1086. {
  1087. if(effect.id == 42 || !containsEff(s->effects, effect.id))//disrupting ray or not on the list - just add
  1088. {
  1089. s->effects.push_back(effect);
  1090. BonusList sf = stackEffectToFeature(effect);
  1091. BOOST_FOREACH(const Bonus &fromEffect, sf)
  1092. {
  1093. s->bonuses.push_back(fromEffect);
  1094. }
  1095. }
  1096. else //just actualize
  1097. {
  1098. actualizeEffect(s, effect);
  1099. }
  1100. }
  1101. else
  1102. tlog1 << "Cannot find stack " << id << std::endl;
  1103. }
  1104. }
  1105. DLL_EXPORT void StacksInjured::applyGs( CGameState *gs )
  1106. {
  1107. BOOST_FOREACH(BattleStackAttacked stackAttacked, stacks)
  1108. stackAttacked.applyGs(gs);
  1109. }
  1110. DLL_EXPORT void StacksHealedOrResurrected::applyGs( CGameState *gs )
  1111. {
  1112. for(int g=0; g<healedStacks.size(); ++g)
  1113. {
  1114. CStack * changedStack = gs->curB->getStack(healedStacks[g].stackID, false);
  1115. //checking if we resurrect a stack that is under a living stack
  1116. std::vector<int> access = gs->curB->getAccessibility(changedStack->ID, true);
  1117. bool acc[BFIELD_SIZE];
  1118. for(int h=0; h<BFIELD_SIZE; ++h)
  1119. acc[h] = false;
  1120. for(int h=0; h<access.size(); ++h)
  1121. acc[access[h]] = true;
  1122. if(!changedStack->alive() && !gs->curB->isAccessible(changedStack->position, acc,
  1123. changedStack->doubleWide(), changedStack->attackerOwned,
  1124. changedStack->hasBonusOfType(Bonus::FLYING), true))
  1125. return; //position is already occupied
  1126. //applying changes
  1127. bool resurrected = !changedStack->alive(); //indicates if stack is resurrected or just healed
  1128. if(resurrected)
  1129. {
  1130. changedStack->state.insert(ALIVE);
  1131. if(healedStacks[g].lowLevelResurrection)
  1132. changedStack->state.insert(SUMMONED);
  1133. //changedStack->bonuses.push_back( makeFeature(HeroBonus::SUMMONED, HeroBonus::ONE_BATTLE, 0, 0, HeroBonus::BONUS_FROM_HERO) );
  1134. }
  1135. int missingHPfirst = changedStack->MaxHealth() - changedStack->firstHPleft;
  1136. int res = std::min( healedStacks[g].healedHP / changedStack->MaxHealth() , changedStack->baseAmount - changedStack->count );
  1137. changedStack->count += res;
  1138. changedStack->firstHPleft += healedStacks[g].healedHP - res * changedStack->MaxHealth();
  1139. if(changedStack->firstHPleft > changedStack->MaxHealth())
  1140. {
  1141. changedStack->firstHPleft -= changedStack->MaxHealth();
  1142. if(changedStack->baseAmount > changedStack->count)
  1143. {
  1144. changedStack->count += 1;
  1145. }
  1146. }
  1147. amin(changedStack->firstHPleft, changedStack->MaxHealth());
  1148. //removal of negative effects
  1149. if(resurrected)
  1150. {
  1151. for(int h=0; h<changedStack->effects.size(); ++h)
  1152. {
  1153. if(VLC->spellh->spells[changedStack->effects[h].id].positiveness < 0)
  1154. {
  1155. changedStack->effects.erase(changedStack->effects.begin() + h);
  1156. }
  1157. }
  1158. //removing all features from negative spells
  1159. BonusList tmpFeatures = changedStack->bonuses;
  1160. changedStack->bonuses.clear();
  1161. BOOST_FOREACH(Bonus &b, tmpFeatures)
  1162. {
  1163. const CSpell *s = b.sourceSpell();
  1164. if(s && s->positiveness >= 0)
  1165. {
  1166. changedStack->bonuses.push_back(b);
  1167. }
  1168. }
  1169. }
  1170. }
  1171. }
  1172. DLL_EXPORT void ObstaclesRemoved::applyGs( CGameState *gs )
  1173. {
  1174. if(gs->curB) //if there is a battle
  1175. {
  1176. for(std::set<si32>::const_iterator it = obstacles.begin(); it != obstacles.end(); ++it)
  1177. {
  1178. for(int i=0; i<gs->curB->obstacles.size(); ++i)
  1179. {
  1180. if(gs->curB->obstacles[i].uniqueID == *it) //remove this obstacle
  1181. {
  1182. gs->curB->obstacles.erase(gs->curB->obstacles.begin() + i);
  1183. break;
  1184. }
  1185. }
  1186. }
  1187. }
  1188. }
  1189. DLL_EXPORT void CatapultAttack::applyGs( CGameState *gs )
  1190. {
  1191. if(gs->curB && gs->curB->siege != 0) //if there is a battle and it's a siege
  1192. {
  1193. for(std::set< std::pair< std::pair< ui8, si16 >, ui8> >::const_iterator it = attackedParts.begin(); it != attackedParts.end(); ++it)
  1194. {
  1195. gs->curB->si.wallState[it->first.first] =
  1196. std::min( gs->curB->si.wallState[it->first.first] + it->second, 3 );
  1197. }
  1198. }
  1199. }
  1200. DLL_EXPORT void BattleStacksRemoved::applyGs( CGameState *gs )
  1201. {
  1202. if(!gs->curB)
  1203. return;
  1204. for(std::set<ui32>::const_iterator it = stackIDs.begin(); it != stackIDs.end(); ++it) //for each removed stack
  1205. {
  1206. for(int b=0; b<gs->curB->stacks.size(); ++b) //find it in vector of stacks
  1207. {
  1208. if(gs->curB->stacks[b]->ID == *it) //if found
  1209. {
  1210. gs->curB->stacks.erase(gs->curB->stacks.begin() + b); //remove
  1211. break;
  1212. }
  1213. }
  1214. }
  1215. }
  1216. DLL_EXPORT void YourTurn::applyGs( CGameState *gs )
  1217. {
  1218. gs->currentPlayer = player;
  1219. }
  1220. DLL_EXPORT void SetSelection::applyGs( CGameState *gs )
  1221. {
  1222. gs->getPlayer(player)->currentSelection = id;
  1223. }
  1224. DLL_EXPORT Component::Component(const CStackInstance &stack)
  1225. :id(CREATURE), subtype(stack.type->idNumber), val(stack.count), when(0)
  1226. {
  1227. }