---

CHighScores.cpp

Go to the documentation of this file.

// Copyright 2002 Kenneth Guy,
// 
// You are free to take the source and do as you wish with it.
// However it would be nice if you let me know if the code was useful
// to you and give me an acknowledgement if you use a significant portion
// of the code in an application.
// 
// CHighScores.cpp

#include "CHighScores.h"
#include "f32file.h"
#include "s32file.h"

const TInt KHighScoreEntries=7;

TInt CHighScores::Number() {
  return KHighScoreEntries;
}

void CHighScores::AddScoreL(const TDesC& aName, TInt aScore) {
  for(TInt i=0;i<KHighScoreEntries;++i) {
    if(aScore > iScores[i]) {
      iNames.Remove(KHighScoreEntries-1);
      iScores.Remove(KHighScoreEntries-1);

      HBufC* name=aName.AllocL();
      TInt error=iNames.Insert(name,i);
      if(error!=KErrNone) {
        delete name;
        User::Leave(error);
      }
      User::LeaveIfError(iScores.Insert(aScore,i));
      iLastAdded=i;
      return;
    }
  }
}


TBool CHighScores::GoodEnough(TInt aScore) {
  iLastAdded=-1;
  if(aScore > iScores[KHighScoreEntries-1]) 
    return ETrue;
  else
    return EFalse;
}

TInt CHighScores::Score(TInt aEntry) {
  return(iScores[aEntry]);
}

const TDesC& CHighScores::Name(TInt aEntry) {
  return(*(iNames[aEntry]));
}

CHighScores* CHighScores::NewL(const TDesC &aFileName) {
  CHighScores* self= new (ELeave) CHighScores;
  CleanupStack::PushL(self);
  self->ConstructL(aFileName);
  CleanupStack::Pop(self);
  return(self);
}

TInt CHighScores::LastAdded() {
  return iLastAdded;
}

void CHighScores::ConstructL(const TDesC &aFileName) {
  iLastAdded=-1;
  iFileName=aFileName.AllocL();
  // try and load high scores, if that fails,
  // create empty high score sheet.
  TRAPD(error,LoadL());
  if(error!=KErrNone) {
    InitL();
  }
}

CHighScores::~CHighScores() {
  // if we can't save the high scores there isn't much we can
  // do about it, so just ignore the error.
  TRAPD(ignore,SaveL());
  delete iFileName;
  TInt count=iNames.Count();
  while(count--) {
    delete (iNames[count]);
  }
}


void CHighScores::Reset() {
  TInt count=iNames.Count();
  while(count--) {
    delete (iNames[count]);
  }
  iNames.Reset();
  iScores.Reset();
}


void CHighScores::InitL() {
  Reset();
  _LIT(KEmpty,"No One");
  TInt count=KHighScoreEntries;
  while(count--) {
    HBufC* name=KEmpty().AllocL();
    TInt error=iNames.Append(name);
    if(error!=KErrNone) {
      delete name;
      User::Leave(error);
    }
    User::LeaveIfError(iScores.Append(0));
  }
}


void CHighScores::SaveL() {  
  RFs fs;
  User::LeaveIfError(fs.Connect());
  CleanupClosePushL(fs);

  RFileWriteStream file;
  User::LeaveIfError(file.Replace(fs,*iFileName,EFileWrite));
  CleanupClosePushL(file);

  for(TInt i=0;i<KHighScoreEntries;++i) {
    file << *(iNames[i]);
    file.WriteInt32L(iScores[i]);
  }

  CleanupStack::PopAndDestroy(2,&fs);      
}


void CHighScores::LoadL() {
  RFs fs;
  User::LeaveIfError(fs.Connect());
  CleanupClosePushL(fs);

  RFileReadStream file;
  User::LeaveIfError(file.Open(fs,*iFileName,EFileRead));
  CleanupClosePushL(file);

  for(TInt i=0;i<KHighScoreEntries;++i) {
    HBufC* name=HBufC::NewL(file,KMaxTInt);
    TInt error=iNames.Append(name);
    if(error!=KErrNone) {
      delete name;
      User::Leave(error);
    }
    TInt score=file.ReadInt32L();
    User::LeaveIfError(iScores.Append(score));
  }

  CleanupStack::PopAndDestroy(2,&fs);
}

---