ilikecats/stk-code_catmod
1
1
Fork 0
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity

Added checks to catch the ranking bug much earlier (yay)

Browse Source 
git-svn-id: svn+ssh://svn.code.sf.net/p/supertuxkart/code/main/trunk@5169 178a84e3-b1eb-0310-8ba1-8eac791a3b58
This commit is contained in:
auria 2010-04-11 19:28:53 +00:00
parent ac67f9fbb2
commit 04ba1f96ae
1 changed files with 9 additions and 3 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

12
src/modes/linear_world.cpp
View File

@ -210,8 +210,7 @@ void LinearWorld::update(float delta)
} }
#ifdef DEBUG #ifdef DEBUG
// FIXME: Debug output in case that the double position error // FIXME: Debug output in case that the double position error occurs again.
// occurs again. It can most likely be removed.
int pos_used[10]; int pos_used[10];
for(int i=0; i<10; i++) pos_used[i]=-99; for(int i=0; i<10; i++) pos_used[i]=-99;
for(unsigned int i=0; i<kart_amount; i++) for(unsigned int i=0; i<kart_amount; i++)
@ -602,7 +601,13 @@ void LinearWorld::updateRacePosition()
// these karts would get their rank updated, it could happen // these karts would get their rank updated, it could happen
// that a kart that finished first will be overtaken after // that a kart that finished first will be overtaken after
// crossing the finishing line and become second! // crossing the finishing line and become second!
if(kart->isEliminated() || kart->hasFinishedRace()) continue; if(kart->isEliminated() || kart->hasFinishedRace())
{
#ifdef DEBUG
rank_used[kart->getPosition()] = true;
#endif
continue;
}
KartInfo& kart_info = m_kart_info[i]; KartInfo& kart_info = m_kart_info[i];
int p = 1 ; int p = 1 ;
@ -666,6 +671,7 @@ void LinearWorld::updateRacePosition()
} }
std::cerr << " --> And " << kart->getIdent() << " is being set at rank " << p << std::endl; std::cerr << " --> And " << kart->getIdent() << " is being set at rank " << p << std::endl;
history->Save();
assert(false); assert(false);
} }
rank_used[p] = true; rank_used[p] = true;