CHeroHandler.cpp 11 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495
  1. #define VCMI_DLL
  2. #include "../stdafx.h"
  3. #include "CHeroHandler.h"
  4. #include "CLodHandler.h"
  5. #include "../lib/VCMI_Lib.h"
  6. #include "../lib/JsonNode.h"
  7. #include <iomanip>
  8. #include <sstream>
  9. #include <fstream>
  10. #include <boost/version.hpp>
  11. #if BOOST_VERSION >= 103800
  12. #include <boost/spirit/include/classic.hpp>
  13. #else
  14. #include <boost/spirit.hpp>
  15. #endif
  16. #include <boost/foreach.hpp>
  17. using namespace boost::spirit;
  18. extern CLodHandler * bitmaph;
  19. void loadToIt(std::string &dest, const std::string &src, int &iter, int mode);
  20. /*
  21. * CHeroHandler.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. CHeroClass::CHeroClass()
  30. {
  31. skillLimit = 8;
  32. }
  33. CHeroClass::~CHeroClass()
  34. {
  35. }
  36. int CHeroClass::chooseSecSkill(const std::set<int> & possibles) const //picks secondary skill out from given possibilities
  37. {
  38. if(possibles.size()==1)
  39. return *possibles.begin();
  40. int totalProb = 0;
  41. for(std::set<int>::const_iterator i=possibles.begin(); i!=possibles.end(); i++)
  42. {
  43. totalProb += proSec[*i];
  44. }
  45. int ran = rand()%totalProb;
  46. for(std::set<int>::const_iterator i=possibles.begin(); i!=possibles.end(); i++)
  47. {
  48. ran -= proSec[*i];
  49. if(ran<0)
  50. return *i;
  51. }
  52. throw std::string("Cannot pick secondary skill!");
  53. }
  54. EAlignment CHeroClass::getAlignment()
  55. {
  56. return (EAlignment)alignment;
  57. }
  58. int CObstacleInfo::getWidth() const
  59. {
  60. int ret = 1;
  61. int line = 1;
  62. for(int h=0; h<blockmap.size(); ++h)
  63. {
  64. int cur = - line/2;
  65. switch(blockmap[h])
  66. {
  67. case 'X' : case 'N':
  68. ++cur;
  69. break;
  70. case 'L':
  71. if(cur > ret)
  72. ret = cur;
  73. ++line;
  74. break;
  75. }
  76. }
  77. return ret;
  78. }
  79. int CObstacleInfo::getHeight() const
  80. {
  81. int ret = 1;
  82. for(int h=0; h<blockmap.size(); ++h)
  83. {
  84. if(blockmap[h] == 'L')
  85. {
  86. ++ret;
  87. }
  88. }
  89. return ret;
  90. }
  91. std::vector<THex> CObstacleInfo::getBlocked(THex hex) const
  92. {
  93. std::vector<THex> ret;
  94. int cur = hex; //currently browsed hex
  95. int curBeg = hex; //beginning of current line
  96. for(int h=0; h<blockmap.size(); ++h)
  97. {
  98. switch(blockmap[h])
  99. {
  100. case 'X':
  101. ret.push_back(cur);
  102. ++cur;
  103. break;
  104. case 'L':
  105. cur = curBeg + BFIELD_WIDTH;
  106. if((cur/BFIELD_WIDTH)%2 == 1)
  107. {
  108. cur--;
  109. }
  110. curBeg = cur;
  111. break;
  112. case 'N':
  113. ++cur;
  114. break;
  115. }
  116. }
  117. return ret;
  118. }
  119. THex CObstacleInfo::getMaxBlocked(THex hex) const
  120. {
  121. std::vector<THex> blocked = getBlocked(hex);
  122. return *std::max_element(blocked.begin(), blocked.end());
  123. }
  124. CHeroHandler::~CHeroHandler()
  125. {
  126. for (int i = 0; i < heroes.size(); i++)
  127. heroes[i].dellNull();
  128. for (int i = 0; i < heroClasses.size(); i++)
  129. delete heroClasses[i];
  130. }
  131. CHeroHandler::CHeroHandler()
  132. {}
  133. void CHeroHandler::loadObstacles()
  134. {
  135. const JsonNode config(DATA_DIR "/config/obstacles.json");
  136. BOOST_FOREACH(const JsonNode &obs, config["obstacles"].Vector()) {
  137. CObstacleInfo obi;
  138. obi.ID = obs["id"].Float();
  139. obi.defName = obs["defname"].String();
  140. obi.blockmap = obs["blockmap"].String();
  141. obi.allowedTerrains = obs["terrains"].String();
  142. assert(obi.allowedTerrains.size() >= 25);
  143. obi.posShift.first = obs["shift_x"].Float();
  144. obi.posShift.second = obs["shift_y"].Float();
  145. obstacles[obi.ID] = obi;
  146. }
  147. }
  148. void CHeroHandler::loadPuzzleInfo()
  149. {
  150. const JsonNode config(DATA_DIR "/config/puzzle_map.json");
  151. int faction = 0;
  152. BOOST_FOREACH(const JsonNode &puzzle, config["puzzles"].Vector()) {
  153. int idx = 0;
  154. BOOST_FOREACH(const JsonNode &piece, puzzle.Vector()) {
  155. SPuzzleInfo spi;
  156. spi.x = piece["x"].Float();
  157. spi.y = piece["y"].Float();
  158. spi.whenUncovered = piece["order"].Float();
  159. spi.number = idx;
  160. // filename calculation
  161. std::ostringstream suffix;
  162. suffix << std::setfill('0') << std::setw(2);
  163. suffix << idx << ".BMP";
  164. static const std::string factionToInfix[F_NUMBER] = {"CAS", "RAM", "TOW", "INF", "NEC", "DUN", "STR", "FOR", "ELE"};
  165. spi.filename = "PUZ" + factionToInfix[faction] + suffix.str();
  166. puzzleInfo[faction].push_back(spi);
  167. idx ++;
  168. }
  169. assert(idx == PUZZLES_PER_FACTION);
  170. faction ++;
  171. }
  172. assert(faction == F_NUMBER);
  173. }
  174. void CHeroHandler::loadHeroes()
  175. {
  176. VLC->heroh = this;
  177. std::string buf = bitmaph->getTextFile("HOTRAITS.TXT");
  178. int it=0;
  179. std::string dump;
  180. for(int i=0; i<2; ++i)
  181. {
  182. loadToIt(dump,buf,it,3);
  183. }
  184. int numberOfCurrentClassHeroes = 0;
  185. int currentClass = 0;
  186. int additHero = 0;
  187. CHero::EHeroClasses addTab[12];
  188. addTab[0] = CHero::KNIGHT;
  189. addTab[1] = CHero::WITCH;
  190. addTab[2] = CHero::KNIGHT;
  191. addTab[3] = CHero::WIZARD;
  192. addTab[4] = CHero::RANGER;
  193. addTab[5] = CHero::BARBARIAN;
  194. addTab[6] = CHero::DEATHKNIGHT;
  195. addTab[7] = CHero::WARLOCK;
  196. addTab[8] = CHero::KNIGHT;
  197. addTab[9] = CHero::WARLOCK;
  198. addTab[10] = CHero::BARBARIAN;
  199. addTab[11] = CHero::DEMONIAC;
  200. for (int i=0; i<HEROES_QUANTITY; i++)
  201. {
  202. CHero * nher = new CHero;
  203. if(currentClass<18)
  204. {
  205. nher->heroType = static_cast<CHero::EHeroClasses>(currentClass);
  206. ++numberOfCurrentClassHeroes;
  207. if(numberOfCurrentClassHeroes==8)
  208. {
  209. numberOfCurrentClassHeroes = 0;
  210. ++currentClass;
  211. }
  212. }
  213. else
  214. {
  215. nher->heroType = addTab[additHero++];
  216. }
  217. std::string pom ;
  218. loadToIt(nher->name,buf,it,4);
  219. for(int x=0;x<3;x++)
  220. {
  221. loadToIt(pom,buf,it,4);
  222. nher->lowStack[x] = atoi(pom.c_str());
  223. loadToIt(pom,buf,it,4);
  224. nher->highStack[x] = atoi(pom.c_str());
  225. loadToIt(nher->refTypeStack[x],buf,it,(x==2) ? (3) : (4));
  226. int hlp = nher->refTypeStack[x].find_first_of(' ',0);
  227. if(hlp>=0)
  228. nher->refTypeStack[x].replace(hlp,1,"");
  229. }
  230. nher->ID = heroes.size();
  231. heroes.push_back(nher);
  232. }
  233. // Load heroes information
  234. const JsonNode config(DATA_DIR "/config/heroes.json");
  235. BOOST_FOREACH(const JsonNode &hero, config["heroes"].Vector()) {
  236. int hid = hero["id"].Float();
  237. const JsonNode *value;
  238. // sex: 0=male, 1=female
  239. heroes[hid]->sex = !!hero["female"].Bool();
  240. BOOST_FOREACH(const JsonNode &set, hero["skill_set"].Vector()) {
  241. heroes[hid]->secSkillsInit.push_back(std::make_pair(set["skill"].Float(), set["level"].Float()));
  242. }
  243. value = &hero["spell"];
  244. if (!value->isNull()) {
  245. heroes[hid]->startingSpell = value->Float();
  246. }
  247. value = &hero["specialties"];
  248. if (!value->isNull()) {
  249. BOOST_FOREACH(const JsonNode &specialty, value->Vector()) {
  250. SSpecialtyInfo dummy;
  251. dummy.type = specialty["type"].Float();
  252. dummy.val = specialty["val"].Float();
  253. dummy.subtype = specialty["subtype"].Float();
  254. dummy.additionalinfo = specialty["info"].Float();
  255. heroes[hid]->spec.push_back(dummy); //put a copy of dummy
  256. }
  257. }
  258. }
  259. loadHeroClasses();
  260. initHeroClasses();
  261. expPerLevel.push_back(0);
  262. expPerLevel.push_back(1000);
  263. expPerLevel.push_back(2000);
  264. expPerLevel.push_back(3200);
  265. expPerLevel.push_back(4600);
  266. expPerLevel.push_back(6200);
  267. expPerLevel.push_back(8000);
  268. expPerLevel.push_back(10000);
  269. expPerLevel.push_back(12200);
  270. expPerLevel.push_back(14700);
  271. expPerLevel.push_back(17500);
  272. expPerLevel.push_back(20600);
  273. expPerLevel.push_back(24320);
  274. expPerLevel.push_back(28784);
  275. expPerLevel.push_back(34140);
  276. while (expPerLevel[expPerLevel.size() - 1] > expPerLevel[expPerLevel.size() - 2])
  277. {
  278. int i = expPerLevel.size() - 1;
  279. expPerLevel.push_back (expPerLevel[i] + (expPerLevel[i] - expPerLevel[i-1]) * 1.2);
  280. }
  281. expPerLevel.pop_back();//last value is broken
  282. //ballistics info
  283. buf = bitmaph->getTextFile("BALLIST.TXT");
  284. it = 0;
  285. for(int i=0; i<22; ++i)
  286. {
  287. loadToIt(dump,buf,it,4);
  288. }
  289. for(int lvl=0; lvl<4; ++lvl)
  290. {
  291. CHeroHandler::SBallisticsLevelInfo bli;
  292. si32 tempNum;
  293. loadToIt(tempNum,buf,it,4);
  294. bli.keep = tempNum;
  295. loadToIt(tempNum,buf,it,4);
  296. bli.tower = tempNum;
  297. loadToIt(tempNum,buf,it,4);
  298. bli.gate = tempNum;
  299. loadToIt(tempNum,buf,it,4);
  300. bli.wall = tempNum;
  301. loadToIt(tempNum,buf,it,4);
  302. bli.shots = tempNum;
  303. loadToIt(tempNum,buf,it,4);
  304. bli.noDmg = tempNum;
  305. loadToIt(tempNum,buf,it,4);
  306. bli.oneDmg = tempNum;
  307. loadToIt(tempNum,buf,it,4);
  308. bli.twoDmg = tempNum;
  309. loadToIt(tempNum,buf,it,4);
  310. bli.sum = tempNum;
  311. if(lvl!=3)
  312. {
  313. loadToIt(dump,buf,it,4);
  314. }
  315. ballistics.push_back(bli);
  316. }
  317. }
  318. void CHeroHandler::loadHeroClasses()
  319. {
  320. std::istringstream str(bitmaph->getTextFile("HCTRAITS.TXT")); //we'll be reading from it
  321. const int BUFFER_SIZE = 5000;
  322. char buffer[BUFFER_SIZE+1];
  323. for(int i=0; i<3; ++i) str.getline(buffer, BUFFER_SIZE); //omitting rubbish
  324. for(int ss=0; ss<18; ++ss) //18 classes of hero (including conflux)
  325. {
  326. CHeroClass * hc = new CHeroClass;
  327. hc->alignment = ss / 6;
  328. char name[BUFFER_SIZE+1];
  329. str.get(name, BUFFER_SIZE, '\t');
  330. hc->name = name;
  331. //workaround for locale issue (different localisations use different decimal separator)
  332. int intPart,fracPart;
  333. str >> intPart;
  334. str.ignore();//ignore decimal separator
  335. str >> fracPart;
  336. hc->aggression = intPart + fracPart/100.0f;
  337. str >> hc->initialAttack;
  338. str >> hc->initialDefence;
  339. str >> hc->initialPower;
  340. str >> hc->initialKnowledge;
  341. hc->primChance.resize(PRIMARY_SKILLS);
  342. for(int x=0; x<PRIMARY_SKILLS; ++x)
  343. {
  344. str >> hc->primChance[x].first;
  345. }
  346. for(int x=0; x<PRIMARY_SKILLS; ++x)
  347. {
  348. str >> hc->primChance[x].second;
  349. }
  350. hc->proSec.resize(SKILL_QUANTITY);
  351. for(int dd=0; dd<SKILL_QUANTITY; ++dd)
  352. {
  353. str >> hc->proSec[dd];
  354. }
  355. for(int dd=0; dd<ARRAY_COUNT(hc->selectionProbability); ++dd)
  356. {
  357. str >> hc->selectionProbability[dd];
  358. }
  359. heroClasses.push_back(hc);
  360. str.getline(buffer, BUFFER_SIZE); //removing end of line characters
  361. }
  362. }
  363. void CHeroHandler::initHeroClasses()
  364. {
  365. for(int gg=0; gg<heroes.size(); ++gg)
  366. {
  367. heroes[gg]->heroClass = heroClasses[heroes[gg]->heroType];
  368. }
  369. loadTerrains();
  370. }
  371. unsigned int CHeroHandler::level (ui64 experience) const
  372. {
  373. int i;
  374. if (experience <= expPerLevel.back())
  375. {
  376. for (i = expPerLevel.size()-1; experience < expPerLevel[i]; i--);
  377. return i + 1;
  378. }
  379. else
  380. {
  381. i = expPerLevel.size() - 1;
  382. while (experience > reqExp (i))
  383. i++;
  384. return i;
  385. }
  386. }
  387. ui64 CHeroHandler::reqExp (unsigned int level) const
  388. {
  389. if(!level)
  390. return 0;
  391. if (level <= expPerLevel.size())
  392. {
  393. return expPerLevel[level-1];
  394. }
  395. else
  396. {
  397. tlog3 << "A hero has reached unsupported amount of experience\n";
  398. return expPerLevel[expPerLevel.size()-1];
  399. }
  400. }
  401. void CHeroHandler::loadTerrains()
  402. {
  403. int faction = 0;
  404. const JsonNode config(DATA_DIR "/config/terrains.json");
  405. nativeTerrains.resize(F_NUMBER);
  406. BOOST_FOREACH(const JsonNode &terrain, config["terrains"].Vector()) {
  407. BOOST_FOREACH(const JsonNode &cost, terrain["costs"].Vector()) {
  408. int curCost = cost.Float();
  409. heroClasses[2*faction]->terrCosts.push_back(curCost);
  410. heroClasses[2*faction+1]->terrCosts.push_back(curCost);
  411. }
  412. nativeTerrains[faction] = terrain["native"].Float();
  413. faction ++;
  414. }
  415. assert(faction == F_NUMBER);
  416. }
  417. CHero::CHero()
  418. {
  419. startingSpell = -1;
  420. sex = 0xff;
  421. }
  422. CHero::~CHero()
  423. {
  424. }