NetPacksLib.cpp 36 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682683684685686687688689690691692693694695696697698699700701702703704705706707708709710711712713714715716717718719720721722723724725726727728729730731732733734735736737738739740741742743744745746747748749750751752753754755756757758759760761762763764765766767768769770771772773774775776777778779780781782783784785786787788789790791792793794795796797798799800801802803804805806807808809810811812813814815816817818819820821822823824825826827828829830831832833834835836837838839840841842843844845846847848849850851852853854855856857858859860861862863864865866867868869870871872873874875876877878879880881882883884885886887888889890891892893894895896897898899900901902903904905906907908909910911912913914915916917918919920921922923924925926927928929930931932933934935936937938939940941942943944945946947948949950951952953954955956957958959960961962963964965966967968969970971972973974975976977978979980981982983984985986987988989990991992993994995996997998999100010011002100310041005100610071008100910101011101210131014101510161017101810191020102110221023102410251026102710281029103010311032103310341035103610371038103910401041104210431044104510461047104810491050105110521053105410551056105710581059106010611062106310641065106610671068106910701071107210731074107510761077107810791080108110821083108410851086108710881089109010911092109310941095109610971098109911001101110211031104110511061107110811091110111111121113111411151116111711181119112011211122112311241125112611271128112911301131113211331134113511361137113811391140114111421143114411451146114711481149115011511152115311541155115611571158115911601161116211631164116511661167116811691170117111721173117411751176117711781179118011811182118311841185118611871188118911901191119211931194119511961197119811991200120112021203120412051206120712081209121012111212121312141215121612171218121912201221122212231224122512261227122812291230123112321233123412351236123712381239124012411242124312441245124612471248124912501251125212531254125512561257125812591260126112621263126412651266126712681269127012711272127312741275127612771278127912801281128212831284128512861287128812891290129112921293129412951296129712981299130013011302130313041305130613071308130913101311131213131314131513161317131813191320132113221323
  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. h->UpdateSpeciality();
  637. }
  638. DLL_EXPORT void BattleStart::applyGs( CGameState *gs )
  639. {
  640. gs->curB = info;
  641. info->belligerents[0]->battle = info->belligerents[1]->battle = info;
  642. }
  643. DLL_EXPORT void BattleNextRound::applyGs( CGameState *gs )
  644. {
  645. gs->curB->castSpells[0] = gs->curB->castSpells[1] = 0;
  646. gs->curB->round = round;
  647. BOOST_FOREACH(CStack *s, gs->curB->stacks)
  648. {
  649. s->state -= DEFENDING;
  650. s->state -= WAITING;
  651. s->state -= MOVED;
  652. s->state -= HAD_MORALE;
  653. s->counterAttacks = 1 + s->valOfBonuses(Bonus::ADDITIONAL_RETALIATION);
  654. //regeneration
  655. if( s->hasBonusOfType(Bonus::HP_REGENERATION) && s->alive() )
  656. s->firstHPleft = std::min<ui32>( s->MaxHealth(), s->valOfBonuses(Bonus::HP_REGENERATION) );
  657. if( s->hasBonusOfType(Bonus::FULL_HP_REGENERATION) && s->alive() )
  658. s->firstHPleft = s->MaxHealth();
  659. //remove effects and restore only those with remaining turns in duration
  660. std::vector<CStack::StackEffect> tmpEffects = s->effects;
  661. s->effects.clear();
  662. for(int i=0; i < tmpEffects.size(); i++)
  663. {
  664. tmpEffects[i].turnsRemain--;
  665. if(tmpEffects[i].turnsRemain > 0)
  666. s->effects.push_back(tmpEffects[i]);
  667. }
  668. //the same as above for features
  669. BonusList tmpFeatures = s->bonuses;
  670. s->bonuses.clear();
  671. BOOST_FOREACH(Bonus &b, tmpFeatures)
  672. {
  673. if((b.duration & Bonus::N_TURNS) != 0)
  674. {
  675. b.turnsRemain--;
  676. if(b.turnsRemain > 0)
  677. s->bonuses.push_back(b);
  678. }
  679. else
  680. {
  681. s->bonuses.push_back(b);
  682. }
  683. }
  684. }
  685. }
  686. DLL_EXPORT void BattleSetActiveStack::applyGs( CGameState *gs )
  687. {
  688. gs->curB->activeStack = stack;
  689. CStack *st = gs->curB->getStack(stack);
  690. if(vstd::contains(st->state,MOVED)) //if stack is moving second time this turn it must had a high morale bonus
  691. st->state.insert(HAD_MORALE);
  692. }
  693. void BattleResult::applyGs( CGameState *gs )
  694. {
  695. for(unsigned i=0;i<gs->curB->stacks.size();i++)
  696. delete gs->curB->stacks[i];
  697. //remove any "until next battle" bonuses
  698. CGHeroInstance *h;
  699. h = gs->curB->heroes[0];
  700. if(h)
  701. h->bonuses.remove_if(Bonus::OneBattle);
  702. h = gs->curB->heroes[1];
  703. if(h)
  704. h->bonuses.remove_if(Bonus::OneBattle);
  705. gs->curB->belligerents[0]->battle = gs->curB->belligerents[1]->battle = NULL;
  706. delete gs->curB;
  707. gs->curB = NULL;
  708. }
  709. void BattleStackMoved::applyGs( CGameState *gs )
  710. {
  711. gs->curB->getStack(stack)->position = tile;
  712. }
  713. DLL_EXPORT void BattleStackAttacked::applyGs( CGameState *gs )
  714. {
  715. CStack * at = gs->curB->getStack(stackAttacked);
  716. at->count = newAmount;
  717. at->firstHPleft = newHP;
  718. if(killed())
  719. at->state -= ALIVE;
  720. //life drain handling
  721. for (int g=0; g<healedStacks.size(); ++g)
  722. {
  723. healedStacks[g].applyGs(gs);
  724. }
  725. }
  726. DLL_EXPORT void BattleAttack::applyGs( CGameState *gs )
  727. {
  728. CStack *attacker = gs->curB->getStack(stackAttacking);
  729. if(counter())
  730. attacker->counterAttacks--;
  731. if(shot())
  732. {
  733. //don't remove ammo if we have a working ammo cart
  734. bool hasAmmoCart = false;
  735. BOOST_FOREACH(const CStack * st, gs->curB->stacks)
  736. {
  737. if(st->owner == attacker->owner && st->type->idNumber == 148 && st->alive())
  738. {
  739. hasAmmoCart = true;
  740. break;
  741. }
  742. }
  743. if (!hasAmmoCart)
  744. {
  745. attacker->shots--;
  746. }
  747. }
  748. BOOST_FOREACH(BattleStackAttacked stackAttacked, bsa)
  749. stackAttacked.applyGs(gs);
  750. attacker->bonuses.remove_if(Bonus::UntilAttack);
  751. for(std::vector<BattleStackAttacked>::const_iterator it = bsa.begin(); it != bsa.end(); ++it)
  752. {
  753. CStack * stack = gs->curB->getStack(it->stackAttacked, false);
  754. stack->bonuses.remove_if(Bonus::UntilBeingAttacked);
  755. }
  756. }
  757. DLL_EXPORT void StartAction::applyGs( CGameState *gs )
  758. {
  759. CStack *st = gs->curB->getStack(ba.stackNumber);
  760. if(ba.actionType != 1) //don't check for stack if it's custom action by hero
  761. assert(st);
  762. switch(ba.actionType)
  763. {
  764. case 3:
  765. st->state.insert(DEFENDING);
  766. break;
  767. case 8:
  768. st->state.insert(WAITING);
  769. return;
  770. case 0: case 2: case 6: case 7: case 9: case 10: case 11: case 12:
  771. st->state.insert(MOVED);
  772. break;
  773. }
  774. if(st)
  775. 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)
  776. }
  777. DLL_EXPORT void BattleSpellCast::applyGs( CGameState *gs )
  778. {
  779. assert(gs->curB);
  780. CGHeroInstance *h = (side) ? gs->curB->heroes[1] : gs->curB->heroes[0];
  781. if(h && castedByHero)
  782. {
  783. int spellCost = 0;
  784. if(gs->curB)
  785. {
  786. spellCost = gs->curB->getSpellCost(&VLC->spellh->spells[id], h);
  787. }
  788. else
  789. {
  790. spellCost = VLC->spellh->spells[id].costs[skill];
  791. }
  792. h->mana -= spellCost;
  793. if(h->mana < 0) h->mana = 0;
  794. }
  795. if(side >= 0 && side < 2 && castedByHero)
  796. {
  797. gs->curB->castSpells[side]++;
  798. }
  799. if(id == 35 || id == 78) //dispel and dispel helpful spells
  800. {
  801. bool onlyHelpful = id == 78;
  802. for(std::set<ui32>::const_iterator it = affectedCres.begin(); it != affectedCres.end(); ++it)
  803. {
  804. CStack *s = gs->curB->getStack(*it);
  805. if(s && !vstd::contains(resisted, s->ID)) //if stack exists and it didn't resist
  806. {
  807. std::vector<CStack::StackEffect> remainingEff;
  808. for(int g=0; g< s->effects.size(); ++g)
  809. {
  810. if (onlyHelpful && VLC->spellh->spells[ s->effects[g].id ].positiveness != 1)
  811. {
  812. remainingEff.push_back(s->effects[g]);
  813. }
  814. }
  815. s->effects.clear(); //removing all effects
  816. s->effects = remainingEff; //assigning effects that should remain
  817. //removing all features from spells
  818. BonusList tmpFeatures = s->bonuses;
  819. s->bonuses.clear();
  820. BOOST_FOREACH(Bonus &b, tmpFeatures)
  821. {
  822. const CSpell *sp = b.sourceSpell();
  823. if(sp && sp->positiveness != 1) //if(b.source != HeroBonus::SPELL_EFFECT || b.positiveness != 1)
  824. s->bonuses.push_back(b);
  825. }
  826. }
  827. }
  828. }
  829. //elemental summoning
  830. if(id >= 66 && id <= 69)
  831. {
  832. int creID;
  833. switch(id)
  834. {
  835. case 66:
  836. creID = 114; //fire elemental
  837. break;
  838. case 67:
  839. creID = 113; //earth elemental
  840. break;
  841. case 68:
  842. creID = 115; //water elemental
  843. break;
  844. case 69:
  845. creID = 112; //air elemental
  846. break;
  847. }
  848. const int3 & tile = gs->curB->tile;
  849. TerrainTile::EterrainType ter = gs->map->terrain[tile.x][tile.y][tile.z].tertype;
  850. int pos; //position of stack on the battlefield - to be calculated
  851. bool ac[BFIELD_SIZE];
  852. std::set<int> occupyable;
  853. bool twoHex = VLC->creh->creatures[creID]->isDoubleWide();
  854. bool flying = vstd::contains(VLC->creh->creatures[creID]->bonuses, Bonus::FLYING);
  855. gs->curB->getAccessibilityMap(ac, twoHex, !side, true, occupyable, flying);
  856. for(int g=0; g<BFIELD_SIZE; ++g)
  857. {
  858. if(g % BFIELD_WIDTH != 0 && g % BFIELD_WIDTH != BFIELD_WIDTH-1 && BattleInfo::isAccessible(g, ac, twoHex, !side, flying, true) )
  859. {
  860. pos = g;
  861. break;
  862. }
  863. }
  864. 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);
  865. summonedStack->state.insert(SUMMONED);
  866. //summonedStack->bonuses.push_back( makeFeature(HeroBonus::SUMMONED, HeroBonus::ONE_BATTLE, 0, 0, HeroBonus::BONUS_FROM_HERO) );
  867. gs->curB->stacks.push_back(summonedStack);
  868. }
  869. }
  870. static inline Bonus featureGenerator(Bonus::BonusType type, si16 subtype, si32 value, ui16 turnsRemain, si32 additionalInfo = 0, si32 limit = Bonus::NO_LIMIT)
  871. {
  872. Bonus hb(makeFeature(type, Bonus::N_TURNS, subtype, value, Bonus::SPELL_EFFECT, turnsRemain, additionalInfo));
  873. hb.effectRange = limit;
  874. return hb;
  875. }
  876. static inline Bonus featureGeneratorVT(Bonus::BonusType type, si16 subtype, si32 value, ui16 turnsRemain, ui8 valType)
  877. {
  878. Bonus ret(makeFeature(type, Bonus::N_TURNS, subtype, value, Bonus::SPELL_EFFECT, turnsRemain));
  879. ret.valType = valType;
  880. return ret;
  881. }
  882. static BonusList stackEffectToFeature(const CStack::StackEffect & sse)
  883. {
  884. BonusList sf;
  885. si32 power = VLC->spellh->spells[sse.id].powers[sse.level];
  886. switch(sse.id)
  887. {
  888. case 27: //shield
  889. sf.push_back(featureGenerator(Bonus::GENERAL_DAMAGE_REDUCTION, 0, power, sse.turnsRemain));
  890. sf.back().id = sse.id;
  891. break;
  892. case 28: //air shield
  893. sf.push_back(featureGenerator(Bonus::GENERAL_DAMAGE_REDUCTION, 1, power, sse.turnsRemain));
  894. sf.back().id = sse.id;
  895. break;
  896. case 29: //fire shield
  897. sf.push_back(featureGenerator(Bonus::FIRE_SHIELD, 0, power, sse.turnsRemain));
  898. sf.back().id = sse.id;
  899. break;
  900. case 30: //protection from air
  901. sf.push_back(featureGenerator(Bonus::SPELL_DAMAGE_REDUCTION, 0, power, sse.turnsRemain));
  902. sf.back().id = sse.id;
  903. break;
  904. case 31: //protection from fire
  905. sf.push_back(featureGenerator(Bonus::SPELL_DAMAGE_REDUCTION, 1, power, sse.turnsRemain));
  906. sf.back().id = sse.id;
  907. break;
  908. case 32: //protection from water
  909. sf.push_back(featureGenerator(Bonus::SPELL_DAMAGE_REDUCTION, 2, power, sse.turnsRemain));
  910. sf.back().id = sse.id;
  911. break;
  912. case 33: //protection from earth
  913. sf.push_back(featureGenerator(Bonus::SPELL_DAMAGE_REDUCTION, 3, power, sse.turnsRemain));
  914. sf.back().id = sse.id;
  915. break;
  916. case 34: //anti-magic
  917. sf.push_back(featureGenerator(Bonus::LEVEL_SPELL_IMMUNITY, 0, power - 1, sse.turnsRemain));
  918. sf.back().id = sse.id;
  919. break;
  920. case 41: //bless
  921. sf.push_back(featureGenerator(Bonus::ALWAYS_MAXIMUM_DAMAGE, -1, power, sse.turnsRemain));
  922. sf.back().id = sse.id;
  923. break;
  924. case 42: //curse
  925. sf.push_back(featureGenerator(Bonus::ALWAYS_MINIMUM_DAMAGE, -1, -1 * power, sse.turnsRemain, sse.level >= 2 ? 20 : 0));
  926. sf.back().id = sse.id;
  927. break;
  928. case 43: //bloodlust
  929. sf.push_back(featureGenerator(Bonus::PRIMARY_SKILL, PrimarySkill::ATTACK, power, sse.turnsRemain, 0, Bonus::ONLY_MELEE_FIGHT));
  930. sf.back().id = sse.id;
  931. break;
  932. case 44: //precision
  933. sf.push_back(featureGenerator(Bonus::PRIMARY_SKILL, PrimarySkill::ATTACK, power, sse.turnsRemain, 0, Bonus::ONLY_DISTANCE_FIGHT));
  934. sf.back().id = sse.id;
  935. break;
  936. case 45: //weakness
  937. sf.push_back(featureGenerator(Bonus::PRIMARY_SKILL, PrimarySkill::ATTACK, -1 * power, sse.turnsRemain));
  938. sf.back().id = sse.id;
  939. break;
  940. case 46: //stone skin
  941. sf.push_back(featureGenerator(Bonus::PRIMARY_SKILL, PrimarySkill::DEFENSE, power, sse.turnsRemain));
  942. sf.back().id = sse.id;
  943. break;
  944. case 47: //disrupting ray
  945. sf.push_back(featureGenerator(Bonus::PRIMARY_SKILL, PrimarySkill::DEFENSE, -1 * power, sse.turnsRemain));
  946. sf.back().id = sse.id;
  947. break;
  948. case 48: //prayer
  949. sf.push_back(featureGenerator(Bonus::PRIMARY_SKILL, PrimarySkill::ATTACK, power, sse.turnsRemain));
  950. sf.back().id = sse.id;
  951. sf.push_back(featureGenerator(Bonus::PRIMARY_SKILL, PrimarySkill::DEFENSE, power, sse.turnsRemain));
  952. sf.back().id = sse.id;
  953. sf.push_back(featureGenerator(Bonus::STACKS_SPEED, 0, power, sse.turnsRemain));
  954. sf.back().id = sse.id;
  955. break;
  956. case 49: //mirth
  957. sf.push_back(featureGenerator(Bonus::MORALE, 0, power, sse.turnsRemain));
  958. sf.back().id = sse.id;
  959. break;
  960. case 50: //sorrow
  961. sf.push_back(featureGenerator(Bonus::MORALE, 0, -1 * power, sse.turnsRemain));
  962. sf.back().id = sse.id;
  963. break;
  964. case 51: //fortune
  965. sf.push_back(featureGenerator(Bonus::LUCK, 0, power, sse.turnsRemain));
  966. sf.back().id = sse.id;
  967. break;
  968. case 52: //misfortune
  969. sf.push_back(featureGenerator(Bonus::LUCK, 0, -1 * power, sse.turnsRemain));
  970. sf.back().id = sse.id;
  971. break;
  972. case 53: //haste
  973. sf.push_back(featureGenerator(Bonus::STACKS_SPEED, 0, power, sse.turnsRemain));
  974. sf.back().id = sse.id;
  975. break;
  976. case 54: //slow
  977. sf.push_back(featureGeneratorVT(Bonus::STACKS_SPEED, 0, -1 * ( 100 - power ), sse.turnsRemain, Bonus::PERCENT_TO_ALL));
  978. sf.back().id = sse.id;
  979. break;
  980. case 55: //slayer
  981. sf.push_back(featureGenerator(Bonus::SLAYER, 0, sse.level, sse.turnsRemain));
  982. sf.back().id = sse.id;
  983. break;
  984. case 56: //frenzy
  985. sf.push_back(featureGenerator(Bonus::IN_FRENZY, 0, VLC->spellh->spells[56].powers[sse.level]/100.0, sse.turnsRemain));
  986. sf.back().id = sse.id;
  987. break;
  988. case 58: //counterstrike
  989. sf.push_back(featureGenerator(Bonus::ADDITIONAL_RETALIATION, 0, power, sse.turnsRemain));
  990. sf.back().id = sse.id;
  991. break;
  992. case 59: //bersek
  993. sf.push_back(featureGenerator(Bonus::ATTACKS_NEAREST_CREATURE, 0, sse.level, sse.turnsRemain));
  994. sf.back().id = sse.id;
  995. break;
  996. case 60: //hypnotize
  997. sf.push_back(featureGenerator(Bonus::HYPNOTIZED, 0, sse.level, sse.turnsRemain));
  998. sf.back().id = sse.id;
  999. break;
  1000. case 61: //forgetfulness
  1001. sf.push_back(featureGenerator(Bonus::FORGETFULL, 0, sse.level, sse.turnsRemain));
  1002. sf.back().id = sse.id;
  1003. break;
  1004. case 62: //blind
  1005. sf.push_back(makeFeature(Bonus::NOT_ACTIVE, Bonus::UNITL_BEING_ATTACKED | Bonus::N_TURNS, 0, 0, Bonus::SPELL_EFFECT, sse.turnsRemain));
  1006. sf.back().id = sse.id;
  1007. sf.push_back(makeFeature(Bonus::GENERAL_ATTACK_REDUCTION, Bonus::UNTIL_ATTACK | Bonus::N_TURNS, 0, power, Bonus::SPELL_EFFECT, sse.turnsRemain));
  1008. sf.back().id = sse.id;
  1009. break;
  1010. }
  1011. return sf;
  1012. }
  1013. void actualizeEffect(CStack * s, CStack::StackEffect & ef)
  1014. {
  1015. //actualizing effects vector
  1016. for(int g=0; g<s->effects.size(); ++g)
  1017. {
  1018. if(s->effects[g].id == ef.id)
  1019. {
  1020. s->effects[g].turnsRemain = std::max(s->effects[g].turnsRemain, ef.turnsRemain);
  1021. }
  1022. }
  1023. //actualizing features vector
  1024. BonusList sf = stackEffectToFeature(ef);
  1025. BOOST_FOREACH(const Bonus &fromEffect, sf)
  1026. {
  1027. BOOST_FOREACH(Bonus &stackBonus, s->bonuses)
  1028. {
  1029. if(stackBonus.source == Bonus::SPELL_EFFECT && stackBonus.type == fromEffect.type && stackBonus.subtype == fromEffect.subtype)
  1030. {
  1031. stackBonus.turnsRemain = std::max(stackBonus.turnsRemain, ef.turnsRemain);
  1032. }
  1033. }
  1034. }
  1035. }
  1036. bool containsEff(const std::vector<CStack::StackEffect> & vec, int effectId)
  1037. {
  1038. for(int g=0; g<vec.size(); ++g)
  1039. {
  1040. if(vec[g].id == effectId)
  1041. return true;
  1042. }
  1043. return false;
  1044. }
  1045. DLL_EXPORT void SetStackEffect::applyGs( CGameState *gs )
  1046. {
  1047. BOOST_FOREACH(ui32 id, stacks)
  1048. {
  1049. CStack *s = gs->curB->getStack(id);
  1050. if(s)
  1051. {
  1052. if(effect.id == 42 || !containsEff(s->effects, effect.id))//disrupting ray or not on the list - just add
  1053. {
  1054. s->effects.push_back(effect);
  1055. BonusList sf = stackEffectToFeature(effect);
  1056. BOOST_FOREACH(const Bonus &fromEffect, sf)
  1057. {
  1058. s->bonuses.push_back(fromEffect);
  1059. }
  1060. }
  1061. else //just actualize
  1062. {
  1063. actualizeEffect(s, effect);
  1064. }
  1065. }
  1066. else
  1067. tlog1 << "Cannot find stack " << id << std::endl;
  1068. }
  1069. }
  1070. DLL_EXPORT void StacksInjured::applyGs( CGameState *gs )
  1071. {
  1072. BOOST_FOREACH(BattleStackAttacked stackAttacked, stacks)
  1073. stackAttacked.applyGs(gs);
  1074. }
  1075. DLL_EXPORT void StacksHealedOrResurrected::applyGs( CGameState *gs )
  1076. {
  1077. for(int g=0; g<healedStacks.size(); ++g)
  1078. {
  1079. CStack * changedStack = gs->curB->getStack(healedStacks[g].stackID, false);
  1080. //checking if we resurrect a stack that is under a living stack
  1081. std::vector<int> access = gs->curB->getAccessibility(changedStack->ID, true);
  1082. bool acc[BFIELD_SIZE];
  1083. for(int h=0; h<BFIELD_SIZE; ++h)
  1084. acc[h] = false;
  1085. for(int h=0; h<access.size(); ++h)
  1086. acc[access[h]] = true;
  1087. if(!changedStack->alive() && !gs->curB->isAccessible(changedStack->position, acc,
  1088. changedStack->doubleWide(), changedStack->attackerOwned,
  1089. changedStack->hasBonusOfType(Bonus::FLYING), true))
  1090. return; //position is already occupied
  1091. //applying changes
  1092. bool resurrected = !changedStack->alive(); //indicates if stack is resurrected or just healed
  1093. if(resurrected)
  1094. {
  1095. changedStack->state.insert(ALIVE);
  1096. if(healedStacks[g].lowLevelResurrection)
  1097. changedStack->state.insert(SUMMONED);
  1098. //changedStack->bonuses.push_back( makeFeature(HeroBonus::SUMMONED, HeroBonus::ONE_BATTLE, 0, 0, HeroBonus::BONUS_FROM_HERO) );
  1099. }
  1100. int missingHPfirst = changedStack->MaxHealth() - changedStack->firstHPleft;
  1101. int res = std::min( healedStacks[g].healedHP / changedStack->MaxHealth() , changedStack->baseAmount - changedStack->count );
  1102. changedStack->count += res;
  1103. changedStack->firstHPleft += healedStacks[g].healedHP - res * changedStack->MaxHealth();
  1104. if(changedStack->firstHPleft > changedStack->MaxHealth())
  1105. {
  1106. changedStack->firstHPleft -= changedStack->MaxHealth();
  1107. if(changedStack->baseAmount > changedStack->count)
  1108. {
  1109. changedStack->count += 1;
  1110. }
  1111. }
  1112. amin(changedStack->firstHPleft, changedStack->MaxHealth());
  1113. //removal of negative effects
  1114. if(resurrected)
  1115. {
  1116. for(int h=0; h<changedStack->effects.size(); ++h)
  1117. {
  1118. if(VLC->spellh->spells[changedStack->effects[h].id].positiveness < 0)
  1119. {
  1120. changedStack->effects.erase(changedStack->effects.begin() + h);
  1121. }
  1122. }
  1123. //removing all features from negative spells
  1124. BonusList tmpFeatures = changedStack->bonuses;
  1125. changedStack->bonuses.clear();
  1126. BOOST_FOREACH(Bonus &b, tmpFeatures)
  1127. {
  1128. const CSpell *s = b.sourceSpell();
  1129. if(s && s->positiveness >= 0)
  1130. {
  1131. changedStack->bonuses.push_back(b);
  1132. }
  1133. }
  1134. }
  1135. }
  1136. }
  1137. DLL_EXPORT void ObstaclesRemoved::applyGs( CGameState *gs )
  1138. {
  1139. if(gs->curB) //if there is a battle
  1140. {
  1141. for(std::set<si32>::const_iterator it = obstacles.begin(); it != obstacles.end(); ++it)
  1142. {
  1143. for(int i=0; i<gs->curB->obstacles.size(); ++i)
  1144. {
  1145. if(gs->curB->obstacles[i].uniqueID == *it) //remove this obstacle
  1146. {
  1147. gs->curB->obstacles.erase(gs->curB->obstacles.begin() + i);
  1148. break;
  1149. }
  1150. }
  1151. }
  1152. }
  1153. }
  1154. DLL_EXPORT void CatapultAttack::applyGs( CGameState *gs )
  1155. {
  1156. if(gs->curB && gs->curB->siege != 0) //if there is a battle and it's a siege
  1157. {
  1158. for(std::set< std::pair< std::pair< ui8, si16 >, ui8> >::const_iterator it = attackedParts.begin(); it != attackedParts.end(); ++it)
  1159. {
  1160. gs->curB->si.wallState[it->first.first] =
  1161. std::min( gs->curB->si.wallState[it->first.first] + it->second, 3 );
  1162. }
  1163. }
  1164. }
  1165. DLL_EXPORT void BattleStacksRemoved::applyGs( CGameState *gs )
  1166. {
  1167. if(!gs->curB)
  1168. return;
  1169. for(std::set<ui32>::const_iterator it = stackIDs.begin(); it != stackIDs.end(); ++it) //for each removed stack
  1170. {
  1171. for(int b=0; b<gs->curB->stacks.size(); ++b) //find it in vector of stacks
  1172. {
  1173. if(gs->curB->stacks[b]->ID == *it) //if found
  1174. {
  1175. gs->curB->stacks.erase(gs->curB->stacks.begin() + b); //remove
  1176. break;
  1177. }
  1178. }
  1179. }
  1180. }
  1181. DLL_EXPORT void YourTurn::applyGs( CGameState *gs )
  1182. {
  1183. gs->currentPlayer = player;
  1184. }
  1185. DLL_EXPORT void SetSelection::applyGs( CGameState *gs )
  1186. {
  1187. gs->getPlayer(player)->currentSelection = id;
  1188. }
  1189. DLL_EXPORT Component::Component(const CStackInstance &stack)
  1190. :id(CREATURE), subtype(stack.type->idNumber), val(stack.count), when(0)
  1191. {
  1192. }