BattleState.h 13 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230
  1. #pragma once
  2. #include "../global.h"
  3. #include "HeroBonus.h"
  4. #include "CCreatureSet.h"
  5. #include "CObjectHandler.h"
  6. #include "CCreatureHandler.h"
  7. #include "ConstTransitivePtr.h"
  8. /*
  9. * BattleState.h, part of VCMI engine
  10. *
  11. * Authors: listed in file AUTHORS in main folder
  12. *
  13. * License: GNU General Public License v2.0 or later
  14. * Full text of license available in license.txt file, in main folder
  15. *
  16. */
  17. class CGHeroInstance;
  18. class CStack;
  19. class CArmedInstance;
  20. class CGTownInstance;
  21. class CStackInstance;
  22. struct BattleStackAttacked;
  23. struct DLL_EXPORT CObstacleInstance
  24. {
  25. int uniqueID;
  26. int ID; //ID of obstacle (defines type of it)
  27. int pos; //position on battlefield
  28. template <typename Handler> void serialize(Handler &h, const int version)
  29. {
  30. h & ID & pos & uniqueID;
  31. }
  32. };
  33. //only for use in BattleInfo
  34. struct DLL_EXPORT SiegeInfo
  35. {
  36. ui8 wallState[8]; //[0] - keep, [1] - bottom tower, [2] - bottom wall, [3] - below gate, [4] - over gate, [5] - upper wall, [6] - uppert tower, [7] - gate; 1 - intact, 2 - damaged, 3 - destroyed
  37. template <typename Handler> void serialize(Handler &h, const int version)
  38. {
  39. h & wallState;
  40. }
  41. };
  42. struct DLL_EXPORT BattleInfo : public CBonusSystemNode
  43. {
  44. ui8 sides[2]; //sides[0] - attacker, sides[1] - defender
  45. si32 round, activeStack;
  46. ui8 siege; // = 0 ordinary battle = 1 a siege with a Fort = 2 a siege with a Citadel = 3 a siege with a Castle
  47. const CGTownInstance * town; //used during town siege - id of attacked town; -1 if not town defence
  48. int3 tile; //for background and bonuses
  49. CGHeroInstance *heroes[2];
  50. CArmedInstance *belligerents[2]; //may be same as heroes
  51. std::vector<CStack*> stacks;
  52. std::vector<CObstacleInstance> obstacles;
  53. ui8 castSpells[2]; //how many spells each side has cast this turn [0] - attacker, [1] - defender
  54. std::vector<const CSpell *> usedSpellsHistory[2]; //each time hero casts spell, it's inserted here -> eagle eye skill
  55. SiegeInfo si;
  56. si32 battlefieldType;
  57. ui8 tacticsSide; //which side is requested to play tactics phase
  58. ui8 tacticDistance; //how many hexes we can go forward (1 = only hexes adjacent to margin line)
  59. template <typename Handler> void serialize(Handler &h, const int version)
  60. {
  61. h & sides & round & activeStack & siege & town & tile & stacks & belligerents & obstacles
  62. & castSpells & si & battlefieldType;
  63. h & heroes;
  64. h & usedSpellsHistory;
  65. h & tacticsSide & tacticDistance;
  66. h & static_cast<CBonusSystemNode&>(*this);
  67. }
  68. //////////////////////////////////////////////////////////////////////////
  69. //void getBonuses(BonusList &out, const CSelector &selector, const CBonusSystemNode *root = NULL) const;
  70. //////////////////////////////////////////////////////////////////////////
  71. const CStack * getNextStack() const; //which stack will have turn after current one
  72. void getStackQueue(std::vector<const CStack *> &out, int howMany, int turn = 0, int lastMoved = -1) const; //returns stack in order of their movement action
  73. CStack * getStack(int stackID, bool onlyAlive = true);
  74. const CStack * getStack(int stackID, bool onlyAlive = true) const;
  75. CStack * getStackT(THex tileID, bool onlyAlive = true);
  76. const CStack * getStackT(THex tileID, bool onlyAlive = true) const;
  77. void getAccessibilityMap(bool *accessibility, bool twoHex, bool attackerOwned, bool addOccupiable, std::set<THex> & occupyable, bool flying, const CStack* stackToOmmit = NULL) const; //send pointer to at least 187 allocated bytes
  78. static bool isAccessible(THex hex, bool * accessibility, bool twoHex, bool attackerOwned, bool flying, bool lastPos); //helper for makeBFS
  79. void makeBFS(THex start, bool*accessibility, THex *predecessor, int *dists, bool twoHex, bool attackerOwned, bool flying, bool fillPredecessors) const; //*accessibility must be prepared bool[187] array; last two pointers must point to the at least 187-elements int arrays - there is written result
  80. std::pair< std::vector<THex>, int > getPath(THex start, THex dest, bool*accessibility, bool flyingCreature, bool twoHex, bool attackerOwned); //returned value: pair<path, length>; length may be different than number of elements in path since flying vreatures jump between distant hexes
  81. std::vector<THex> getAccessibility(const CStack * stack, bool addOccupiable) const; //returns vector of accessible tiles (taking into account the creature range)
  82. bool isStackBlocked(const CStack * stack) const; //returns true if there is neighboring enemy stack
  83. ui32 calculateDmg(const CStack* attacker, const CStack* defender, const CGHeroInstance * attackerHero, const CGHeroInstance * defendingHero, bool shooting, ui8 charge, bool lucky); //charge - number of hexes travelled before attack (for champion's jousting)
  84. TDmgRange calculateDmgRange( const CStack* attacker, const CStack* defender, TQuantity attackerCount, TQuantity defenderCount, const CGHeroInstance * attackerHero, const CGHeroInstance * defendingHero, bool shooting, ui8 charge, bool lucky) const; //charge - number of hexes travelled before attack (for champion's jousting); returns pair <min dmg, max dmg>
  85. TDmgRange calculateDmgRange(const CStack* attacker, const CStack* defender, const CGHeroInstance * attackerHero, const CGHeroInstance * defendingHero, bool shooting, ui8 charge, bool lucky) const; //charge - number of hexes travelled before attack (for champion's jousting); returns pair <min dmg, max dmg>
  86. void calculateCasualties(std::map<ui32,si32> *casualties) const; //casualties are array of maps size 2 (attacker, defeneder), maps are (crid => amount)
  87. std::set<CStack*> getAttackedCreatures(const CSpell * s, int skillLevel, ui8 attackerOwner, THex destinationTile); //calculates stack affected by given spell
  88. static int calculateSpellDuration(const CSpell * spell, const CGHeroInstance * caster, int usedSpellPower);
  89. CStack * generateNewStack(const CStackInstance &base, int stackID, bool attackerOwned, int slot, THex position) const; //helper for CGameHandler::setupBattle and spells addign new stacks to the battlefield
  90. CStack * generateNewStack(const CStackBasicDescriptor &base, int stackID, bool attackerOwned, int slot, THex position) const; //helper for CGameHandler::setupBattle and spells addign new stacks to the battlefield
  91. ui32 getSpellCost(const CSpell * sp, const CGHeroInstance * caster) const; //returns cost of given spell
  92. int hexToWallPart(THex hex) const; //returns part of destructible wall / gate / keep under given hex or -1 if not found
  93. int lineToWallHex(int line) const; //returns hex with wall in given line
  94. std::pair<const CStack *, THex> getNearestStack(const CStack * closest, boost::logic::tribool attackerOwned) const; //if attackerOwned is indetermnate, returened stack is of any owner; hex is the number of hex we should be looking from; returns (nerarest creature, predecessorHex)
  95. ui32 calculateSpellBonus(ui32 baseDamage, const CSpell * sp, const CGHeroInstance * caster, const CStack * affectedCreature) const;
  96. ui32 calculateSpellDmg(const CSpell * sp, const CGHeroInstance * caster, const CStack * affectedCreature, int spellSchoolLevel, int usedSpellPower) const; //calculates damage inflicted by spell
  97. ui32 calculateHealedHP(const CGHeroInstance * caster, const CSpell * spell, const CStack * stack) const;
  98. si8 hasDistancePenalty(const CStack * stackID, THex destHex) const; //determines if given stack has distance penalty shooting given pos
  99. si8 sameSideOfWall(int pos1, int pos2) const; //determines if given positions are on the same side of wall
  100. si8 hasWallPenalty(const CStack * stack, THex destHex) const; //determines if given stack has wall penalty shooting given pos
  101. si8 canTeleportTo(const CStack * stack, THex destHex, int telportLevel) const; //determines if given stack can teleport to given place
  102. bool battleCanShoot(const CStack * stack, THex dest) const; //determines if stack with given ID shoot at the selected destination
  103. bool battleCanFlee(int player) const; //returns true if player can flee from the battle
  104. const CStack * battleGetStack(THex pos, bool onlyAlive); //returns stack at given tile
  105. const CGHeroInstance * battleGetOwner(const CStack * stack) const; //returns hero that owns given stack; NULL if none
  106. si8 battleMaxSpellLevel() const; //calculates maximum spell level possible to be cast on battlefield - takes into account artifacts of both heroes; if no effects are set, SPELL_LEVELS is returned
  107. void localInit();
  108. static BattleInfo * setupBattle( int3 tile, int terrain, int terType, const CArmedInstance *armies[2], const CGHeroInstance * heroes[2], bool creatureBank, const CGTownInstance *town );
  109. bool isInTacticRange( THex dest ) const;
  110. };
  111. class DLL_EXPORT CStack : public CBonusSystemNode, public CStackBasicDescriptor
  112. {
  113. public:
  114. const CStackInstance *base;
  115. ui32 ID; //unique ID of stack
  116. ui32 baseAmount;
  117. ui32 firstHPleft; //HP of first creature in stack
  118. ui8 owner, slot; //owner - player colour (255 for neutrals), slot - position in garrison (may be 255 for neutrals/called creatures)
  119. ui8 attackerOwned; //if true, this stack is owned by attakcer (this one from left hand side of battle)
  120. THex position; //position on battlefield; -2 - keep, -3 - lower tower, -4 - upper tower
  121. ui8 counterAttacks; //how many counter attacks can be performed more in this turn (by default set at the beginning of the round to 1)
  122. si16 shots; //how many shots left
  123. std::set<ECombatInfo> state;
  124. //overrides
  125. const CCreature* getCreature() const {return type;}
  126. CStack(const CStackInstance *base, int O, int I, bool AO, int S); //c-tor
  127. CStack(const CStackBasicDescriptor *stack, int O, int I, bool AO, int S = 255); //c-tor
  128. CStack(); //c-tor
  129. ~CStack();
  130. std::string nodeName() const OVERRIDE;
  131. void init(); //set initial (invalid) values
  132. void postInit(); //used to finish initialization when inheriting creature parameters is working
  133. const Bonus * getEffect(ui16 id, int turn = 0) const; //effect id (SP)
  134. ui8 howManyEffectsSet(ui16 id) const; //returns amount of effects with given id set for this stack
  135. bool willMove(int turn = 0) const; //if stack has remaining move this turn
  136. bool moved(int turn = 0) const; //if stack was already moved this turn
  137. bool canMove(int turn = 0) const; //if stack can move
  138. ui32 Speed(int turn = 0) const; //get speed of creature with all modificators
  139. BonusList getSpellBonuses() const;
  140. static void stackEffectToFeature(std::vector<Bonus> & sf, const Bonus & sse);
  141. std::vector<si32> activeSpells() const; //returns vector of active spell IDs sorted by time of cast
  142. const CGHeroInstance *getMyHero() const; //if stack belongs to hero (directly or was by him summoned) returns hero, NULL otherwise
  143. static inline Bonus featureGenerator(Bonus::BonusType type, si16 subtype, si32 value, ui16 turnsRemain, si32 additionalInfo = 0, si32 limit = Bonus::NO_LIMIT)
  144. {
  145. Bonus hb = makeFeatureVal(type, Bonus::N_TURNS, subtype, value, Bonus::SPELL_EFFECT, turnsRemain, additionalInfo);
  146. hb.effectRange = limit;
  147. hb.source = Bonus::SPELL_EFFECT;
  148. return hb;
  149. }
  150. static inline Bonus featureGeneratorVT(Bonus::BonusType type, si16 subtype, si32 value, ui16 turnsRemain, ui8 valType)
  151. {
  152. Bonus ret = makeFeatureVal(type, Bonus::N_TURNS, subtype, value, Bonus::SPELL_EFFECT, turnsRemain);
  153. ret.valType = valType;
  154. ret.source = Bonus::SPELL_EFFECT;
  155. return ret;
  156. }
  157. static bool isMeleeAttackPossible(const CStack * attacker, const CStack * defender, THex attackerPos = THex::INVALID, THex defenderPos = THex::INVALID);
  158. bool doubleWide() const;
  159. THex occupiedHex() const; //returns number of occupied hex (not the position) if stack is double wide; otherwise -1
  160. void prepareAttacked(BattleStackAttacked &bsa) const; //requires bsa.damageAmout filled
  161. template <typename Handler> void serialize(Handler &h, const int version)
  162. {
  163. assert(isIndependentNode());
  164. h & static_cast<CBonusSystemNode&>(*this);
  165. h & static_cast<CStackBasicDescriptor&>(*this);
  166. h & ID & baseAmount & firstHPleft & owner & slot & attackerOwned & position & state & counterAttacks
  167. & shots & count;
  168. TSlot slot = (base ? base->armyObj->findStack(base) : -1);
  169. const CArmedInstance *army = (base ? base->armyObj : NULL);
  170. if(h.saving)
  171. {
  172. h & army & slot;
  173. }
  174. else
  175. {
  176. h & army & slot;
  177. if(!army || slot == -1 || !army->hasStackAtSlot(slot))
  178. {
  179. base = NULL;
  180. tlog3 << type->nameSing << " don't have a base stack!\n";
  181. }
  182. else
  183. {
  184. base = &army->getStack(slot);
  185. }
  186. }
  187. }
  188. bool alive() const //determines if stack is alive
  189. {
  190. return vstd::contains(state,ALIVE);
  191. }
  192. };
  193. class DLL_EXPORT CMP_stack
  194. {
  195. int phase; //rules of which phase will be used
  196. int turn;
  197. public:
  198. bool operator ()(const CStack* a, const CStack* b);
  199. CMP_stack(int Phase = 1, int Turn = 0);
  200. };