NetPacksLib.cpp 35 KB

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