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

Fixed debug output (trying to print a std::vector ;) ), removed compiler

Browse Source 
warnings (which indicate a possible bug).


git-svn-id: svn+ssh://svn.code.sf.net/p/supertuxkart/code/main/trunk@10971 178a84e3-b1eb-0310-8ba1-8eac791a3b58
This commit is contained in:
hikerstk 2012-03-15 01:21:35 +00:00
parent 8f2ee68b16
commit b9f6b6f0d5
3 changed files with 9 additions and 5 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

2
src/replay/replay_base.hpp
View File

@ -52,7 +52,7 @@ protected:
struct KartReplayEvent
{
/** The type of event. */
enum {KRE_NONE, KRE_SKID_TOGGLE} m_type;
enum KartReplayEventType {KRE_NONE, KRE_SKID_TOGGLE} m_type;
/** Time at which this event happens. */
float m_time;

6
src/replay/replay_play.cpp
View File

@ -236,8 +236,12 @@ void ReplayPlay::readKartData(FILE *fd, char *next_line)
{
fgets(s, 1023, fd);
KartReplayEvent kre;
if(sscanf(s, "%f %d\n", &kre.m_time, &kre.m_type)==2)
int type;
if(sscanf(s, "%f %d\n", &kre.m_time, &type)==2)
{
kre.m_type = (KartReplayEvent::KartReplayEventType)type;
m_ghost_karts[m_ghost_karts.size()-1].addReplayEvent(kre);
}
else
{
// Invalid record found

6
src/replay/replay_recorder.cpp
View File

@ -138,8 +138,8 @@ void ReplayRecorder::update(float dt)
void ReplayRecorder::Save()
{
#ifdef DEBUG
printf("%d frames %d transform events %d frequency compressed\n",
m_count, m_count_transforms, m_count_skipped_time);
printf("%d frames, %d removed because of frequency compression\n",
m_count, m_count_skipped_time);
#endif
FILE *fd = openReplayFile(/*writeable*/true);
if(!fd)
@ -177,7 +177,7 @@ void ReplayRecorder::Save()
p->m_transform.getRotation().getW()
);
} // for i
fprintf(fd, "events: %d\n", m_kart_replay_event[k].size());
fprintf(fd, "events: %d\n", (int)m_kart_replay_event[k].size());
for(unsigned int i=0; i<m_kart_replay_event[k].size(); i++)
{
const KartReplayEvent *p=&(m_kart_replay_event[k][i]);