1
0
mirror of https://github.com/vcmi/vcmi.git synced 2024-11-24 08:32:34 +02:00
vcmi/hch/CHeroHandler.cpp

330 lines
6.6 KiB
C++
Raw Normal View History

2008-06-14 13:20:18 +03:00
#define VCMI_DLL
2008-01-09 19:21:31 +02:00
#include "../stdafx.h"
#include "CHeroHandler.h"
#include <sstream>
#include "CLodHandler.h"
#include "../lib/VCMI_Lib.h"
extern CLodHandler * bitmaph;
void loadToIt(std::string &dest, std::string &src, int &iter, int mode);
CHeroHandler::~CHeroHandler()
{}
void CHeroHandler::loadPortraits()
{
std::string strs = bitmaph->getTextFile("PRISKILL.TXT");
int itr=0;
for (int i=0; i<PRIMARY_SKILLS; i++)
{
std::string tmp;
loadToIt(tmp, strs, itr, 3);
pskillsn.push_back(tmp);
}
}
void CHeroHandler::loadHeroes()
{
VLC->heroh = this;
int ID=0;
std::string buf = bitmaph->getTextFile("HOTRAITS.TXT");
int it=0;
std::string dump;
for(int i=0; i<2; ++i)
{
loadToIt(dump,buf,it,3);
}
int numberOfCurrentClassHeroes = 0;
int currentClass = 0;
int additHero = 0;
EHeroClasses addTab[12];
addTab[0] = HERO_KNIGHT;
addTab[1] = HERO_WITCH;
addTab[2] = HERO_KNIGHT;
addTab[3] = HERO_WIZARD;
addTab[4] = HERO_RANGER;
addTab[5] = HERO_BARBARIAN;
addTab[6] = HERO_DEATHKNIGHT;
addTab[7] = HERO_WARLOCK;
addTab[8] = HERO_KNIGHT;
addTab[9] = HERO_WARLOCK;
addTab[10] = HERO_BARBARIAN;
addTab[11] = HERO_DEMONIAC;
for (int i=0; i<HEROES_QUANTITY; i++)
{
CHero * nher = new CHero;
if(currentClass<18)
{
nher->heroType = (EHeroClasses)currentClass;
++numberOfCurrentClassHeroes;
if(numberOfCurrentClassHeroes==8)
{
numberOfCurrentClassHeroes = 0;
++currentClass;
}
}
else
{
nher->heroType = addTab[additHero++];
}
std::string pom ;
loadToIt(nher->name,buf,it,4);
for(int x=0;x<3;x++)
{
loadToIt(pom,buf,it,4);
nher->lowStack[x] = atoi(pom.c_str());
loadToIt(pom,buf,it,4);
nher->highStack[x] = atoi(pom.c_str());
loadToIt(nher->refTypeStack[x],buf,it,(x==2) ? (3) : (4));
int hlp = nher->refTypeStack[x].find_first_of(' ',0);
if(hlp>=0)
nher->refTypeStack[x].replace(hlp,1,"");
}
nher->ID = heroes.size();
heroes.push_back(nher);
}
loadSpecialAbilities();
loadBiographies();
loadHeroClasses();
initHeroClasses();
expPerLevel.push_back(0);
expPerLevel.push_back(1000);
expPerLevel.push_back(2000);
expPerLevel.push_back(3200);
expPerLevel.push_back(4500);
expPerLevel.push_back(6000);
expPerLevel.push_back(7700);
expPerLevel.push_back(9000);
expPerLevel.push_back(11000);
expPerLevel.push_back(13200);
expPerLevel.push_back(15500);
expPerLevel.push_back(18500);
expPerLevel.push_back(22100);
expPerLevel.push_back(26420);
expPerLevel.push_back(31604);
return;
}
void CHeroHandler::loadSpecialAbilities()
{
std::string buf = bitmaph->getTextFile("HEROSPEC.TXT");
int it=0;
std::string dump;
for(int i=0; i<2; ++i)
{
loadToIt(dump,buf,it,3);
}
for (int i=0;i<heroes.size();i++)
{
loadToIt(heroes[i]->bonusName,buf,it,4);
loadToIt(heroes[i]->shortBonus,buf,it,4);
loadToIt(heroes[i]->longBonus,buf,it,3);
}
}
void CHeroHandler::loadBiographies()
{
std::string buf = bitmaph->getTextFile("HEROBIOS.TXT");
int it=0;
for (int i=0;i<heroes.size();i++)
{
loadToIt(heroes[i]->biography,buf,it,3);
}
}
void CHeroHandler::loadHeroClasses()
{
std::string buf = bitmaph->getTextFile("HCTRAITS.TXT");
int andame = buf.size();
for(int y=0; y<andame; ++y)
if(buf[y]==',')
buf[y]='.';
int i = 0; //buf iterator
int hmcr = 0;
for(i; i<andame; ++i) //omitting rubbish
{
if(buf[i]=='\r')
++hmcr;
if(hmcr==2)
break;
}
i+=2;
for(int ss=0; ss<18; ++ss) //18 classes of hero (including conflux)
{
CHeroClass * hc = new CHeroClass;
int befi=i;
for(i; i<andame; ++i)
{
if(buf[i]=='\t')
break;
}
hc->name = buf.substr(befi, i-befi);
++i;
befi=i;
for(i; i<andame; ++i)
{
if(buf[i]=='\t')
break;
}
hc->aggression = atof(buf.substr(befi, i-befi).c_str());
++i;
befi=i;
for(i; i<andame; ++i)
{
if(buf[i]=='\t')
break;
}
hc->initialAttack = atoi(buf.substr(befi, i-befi).c_str());
++i;
befi=i;
for(i; i<andame; ++i)
{
if(buf[i]=='\t')
break;
}
hc->initialDefence = atoi(buf.substr(befi, i-befi).c_str());
++i;
befi=i;
for(i; i<andame; ++i)
{
if(buf[i]=='\t')
break;
}
hc->initialPower = atoi(buf.substr(befi, i-befi).c_str());
++i;
befi=i;
for(i; i<andame; ++i)
{
if(buf[i]=='\t')
break;
}
hc->initialKnowledge = atoi(buf.substr(befi, i-befi).c_str());
++i;
hc->primChance.resize(PRIMARY_SKILLS);
for(int x=0;x<PRIMARY_SKILLS;x++)
2007-06-18 15:48:29 +03:00
{
befi=i;
for(i; i<andame; ++i)
{
if(buf[i]=='\t')
break;
}
hc->primChance[x].first = atoi(buf.substr(befi, i-befi).c_str());
++i;
2007-06-18 15:48:29 +03:00
}
for(int x=0;x<PRIMARY_SKILLS;x++)
2007-06-18 15:48:29 +03:00
{
befi=i;
for(i; i<andame; ++i)
{
if(buf[i]=='\t')
break;
}
hc->primChance[x].second = atoi(buf.substr(befi, i-befi).c_str());
++i;
2007-06-18 15:48:29 +03:00
}
//CHero kkk = heroes[0];
2007-06-18 15:48:29 +03:00
for(int dd=0; dd<SKILL_QUANTITY; ++dd)
2007-06-18 15:48:29 +03:00
{
befi=i;
for(i; i<andame; ++i)
{
if(buf[i]=='\t')
break;
}
int buff = atoi(buf.substr(befi, i-befi).c_str());
++i;
hc->proSec.push_back(buff);
}
for(int dd=0; dd<9; ++dd)
{
befi=i;
for(i; i<andame; ++i)
{
if(buf[i]=='\t' || buf[i]=='\r')
break;
}
hc->selectionProbability[dd] = atoi(buf.substr(befi, i-befi).c_str());
++i;
}
++i;
heroClasses.push_back(hc);
}
}
void CHeroHandler::initHeroClasses()
{
for(int gg=0; gg<heroes.size(); ++gg)
{
heroes[gg]->heroClass = heroClasses[heroes[gg]->heroType];
}
initTerrainCosts();
}
unsigned int CHeroHandler::level(unsigned int experience)
{
int add=0;
while(experience>=expPerLevel[expPerLevel.size()-1])
{
experience/=1.2;
add+=1;
}
for(int i=expPerLevel.size()-1; i>=0; --i)
{
if(experience>=expPerLevel[i])
return i+add;
}
2008-01-31 14:10:59 +02:00
return -1;
}
unsigned int CHeroHandler::reqExp(unsigned int level)
{
level-=1;
if(level<=expPerLevel.size())
return expPerLevel[level];
else
{
unsigned int exp = expPerLevel[expPerLevel.size()-1];
level-=expPerLevel.size();
while(level>0)
{
--level;
exp*=1.2;
}
}
2008-01-31 14:10:59 +02:00
return -1;
}
void CHeroHandler::initTerrainCosts()
{
2007-09-15 21:04:12 +03:00
std::ifstream inp;
2007-09-17 20:36:20 +03:00
inp.open("config\\TERCOSTS.TXT", std::ios_base::in|std::ios_base::binary);
2007-09-15 21:04:12 +03:00
int tynum;
inp>>tynum;
for(int i=0; i<2*tynum; i+=2)
{
2007-09-15 21:04:12 +03:00
int catNum;
inp>>catNum;
for(int k=0; k<catNum; ++k)
{
2007-09-15 21:04:12 +03:00
int curCost;
inp>>curCost;
heroClasses[i]->terrCosts.push_back(curCost);
heroClasses[i+1]->terrCosts.push_back(curCost);
}
}
2007-09-15 21:04:12 +03:00
inp.close();
}