move Course sorts to CourseUtil, add CourseID
This commit is contained in:
Chris Danford
@@ -0,0 +1,207 @@
|
||||
#include "global.h"
|
||||
/*
|
||||
-----------------------------------------------------------------------------
|
||||
Class: CourseUtil
|
||||
|
||||
Desc: See header.
|
||||
|
||||
Copyright (c) 2001-2002 by the person(s) listed below. All rights reserved.
|
||||
Chris Danford
|
||||
-----------------------------------------------------------------------------
|
||||
*/
|
||||
|
||||
#include "CourseUtil.h"
|
||||
#include "Course.h"
|
||||
#include "RageTimer.h"
|
||||
#include "ProfileManager.h"
|
||||
#include "SongManager.h"
|
||||
|
||||
|
||||
//
|
||||
// Sorting stuff
|
||||
//
|
||||
static bool CompareCoursePointersByName(const Course* pCourse1, const Course* pCourse2)
|
||||
{
|
||||
// HACK: strcmp and other string comparators appear to eat whitespace.
|
||||
// For example, the string "Players Best 13-16" is sorted between
|
||||
// "Players Best 1-4" and "Players Best 5-8". Replace the string " "
|
||||
// with " 0" for comparison only.
|
||||
|
||||
// XXX: That doesn't happen to me, and it shouldn't (strcmp is strictly
|
||||
// a byte sort, though CompareNoCase doesn't use strcmp). Are you sure
|
||||
// you didn't have only one space before? -glenn
|
||||
CString sName1 = pCourse1->m_sName;
|
||||
CString sName2 = pCourse2->m_sName;
|
||||
sName1.Replace( " " , " 0" );
|
||||
sName2.Replace( " " , " 0" );
|
||||
return sName1.CompareNoCase( sName2 ) == -1;
|
||||
}
|
||||
|
||||
static bool CompareCoursePointersByAutogen(const Course* pCourse1, const Course* pCourse2)
|
||||
{
|
||||
int b1 = pCourse1->m_bIsAutogen;
|
||||
int b2 = pCourse2->m_bIsAutogen;
|
||||
if( b1 < b2 )
|
||||
return true;
|
||||
else if( b1 > b2 )
|
||||
return false;
|
||||
else
|
||||
return CompareCoursePointersByName(pCourse1,pCourse2);
|
||||
}
|
||||
|
||||
static bool CompareCoursePointersByDifficulty(const Course* pCourse1, const Course* pCourse2)
|
||||
{
|
||||
int iNum1 = pCourse1->GetEstimatedNumStages();
|
||||
int iNum2 = pCourse2->GetEstimatedNumStages();
|
||||
if( iNum1 < iNum2 )
|
||||
return true;
|
||||
else if( iNum1 > iNum2 )
|
||||
return false;
|
||||
else // iNum1 == iNum2
|
||||
return CompareCoursePointersByAutogen( pCourse1, pCourse2 );
|
||||
}
|
||||
|
||||
static bool CompareCoursePointersByTotalDifficulty(const Course* pCourse1, const Course* pCourse2)
|
||||
{
|
||||
int iNum1 = pCourse1->SortOrder_TotalDifficulty;
|
||||
int iNum2 = pCourse2->SortOrder_TotalDifficulty;
|
||||
|
||||
if( iNum1 == iNum2 )
|
||||
return CompareCoursePointersByAutogen( pCourse1, pCourse2 );
|
||||
return iNum1 < iNum2;
|
||||
}
|
||||
|
||||
static bool MovePlayersBestToEnd( const Course* pCourse1, const Course* pCourse2 )
|
||||
{
|
||||
bool C1HasBest = pCourse1->CourseHasBestOrWorst();
|
||||
bool C2HasBest = pCourse2->CourseHasBestOrWorst();
|
||||
if( !C1HasBest && !C2HasBest )
|
||||
return false;
|
||||
if( C1HasBest && !C2HasBest )
|
||||
return false;
|
||||
if( !C1HasBest && C2HasBest )
|
||||
return true;
|
||||
|
||||
return pCourse1->m_sName < pCourse2->m_sName;
|
||||
}
|
||||
|
||||
static bool CompareRandom( const Course* pCourse1, const Course* pCourse2 )
|
||||
{
|
||||
return ( pCourse1->IsFixed() && !pCourse2->IsFixed() );
|
||||
}
|
||||
|
||||
static bool CompareCoursePointersByRanking(const Course* pCourse1, const Course* pCourse2)
|
||||
{
|
||||
int iNum1 = pCourse1->SortOrder_Ranking;
|
||||
int iNum2 = pCourse2->SortOrder_Ranking;
|
||||
|
||||
if( iNum1 == iNum2 )
|
||||
return CompareCoursePointersByAutogen( pCourse1, pCourse2 );
|
||||
return iNum1 < iNum2;
|
||||
}
|
||||
|
||||
void CourseUtil::SortCoursePointerArrayByDifficulty( vector<Course*> &apCourses )
|
||||
{
|
||||
sort( apCourses.begin(), apCourses.end(), CompareCoursePointersByDifficulty );
|
||||
}
|
||||
|
||||
void CourseUtil::SortCoursePointerArrayByRanking( vector<Course*> &apCourses )
|
||||
{
|
||||
for(unsigned i=0; i<apCourses.size(); i++)
|
||||
apCourses[i]->UpdateCourseStats();
|
||||
sort( apCourses.begin(), apCourses.end(), CompareCoursePointersByRanking );
|
||||
}
|
||||
|
||||
void CourseUtil::SortCoursePointerArrayByTotalDifficulty( vector<Course*> &apCourses )
|
||||
{
|
||||
for(unsigned i=0; i<apCourses.size(); i++)
|
||||
apCourses[i]->UpdateCourseStats();
|
||||
sort( apCourses.begin(), apCourses.end(), CompareCoursePointersByTotalDifficulty );
|
||||
}
|
||||
|
||||
static bool CompareCoursePointersByType(const Course* pCourse1, const Course* pCourse2)
|
||||
{
|
||||
return pCourse1->GetPlayMode() < pCourse2->GetPlayMode();
|
||||
}
|
||||
|
||||
void CourseUtil::SortCoursePointerArrayByType( vector<Course*> &apCourses )
|
||||
{
|
||||
stable_sort( apCourses.begin(), apCourses.end(), CompareCoursePointersByType );
|
||||
}
|
||||
|
||||
void CourseUtil::MoveRandomToEnd( vector<Course*> &apCourses )
|
||||
{
|
||||
stable_sort( apCourses.begin(), apCourses.end(), CompareRandom );
|
||||
}
|
||||
|
||||
static map<const Course*, float> course_sort_val;
|
||||
|
||||
bool CompareCoursePointersBySortValueAscending(const Course *pSong1, const Course *pSong2)
|
||||
{
|
||||
return course_sort_val[pSong1] < course_sort_val[pSong2];
|
||||
}
|
||||
|
||||
bool CompareCoursePointersBySortValueDescending(const Course *pSong1, const Course *pSong2)
|
||||
{
|
||||
return course_sort_val[pSong1] > course_sort_val[pSong2];
|
||||
}
|
||||
|
||||
bool CompareCoursePointersByTitle( const Course *pCourse1, const Course *pCourse2 )
|
||||
{
|
||||
return pCourse1->m_sName < pCourse2->m_sName;
|
||||
}
|
||||
|
||||
void CourseUtil::SortCoursePointerArrayByAvgDifficulty( vector<Course*> &apCourses )
|
||||
{
|
||||
RageTimer foo;
|
||||
course_sort_val.clear();
|
||||
for(unsigned i = 0; i < apCourses.size(); ++i)
|
||||
course_sort_val[apCourses[i]] = apCourses[i]->GetMeter();
|
||||
sort( apCourses.begin(), apCourses.end(), CompareCoursePointersByTitle );
|
||||
stable_sort( apCourses.begin(), apCourses.end(), CompareCoursePointersBySortValueAscending );
|
||||
|
||||
stable_sort( apCourses.begin(), apCourses.end(), MovePlayersBestToEnd );
|
||||
}
|
||||
|
||||
|
||||
void CourseUtil::SortCoursePointerArrayByNumPlays( vector<Course*> &arrayCoursePointers, ProfileSlot slot, bool bDescending )
|
||||
{
|
||||
Profile* pProfile = PROFILEMAN->GetProfile(slot);
|
||||
if( pProfile == NULL )
|
||||
return; // nothing to do since we don't have data
|
||||
SortCoursePointerArrayByNumPlays( arrayCoursePointers, pProfile, bDescending );
|
||||
}
|
||||
|
||||
void CourseUtil::SortCoursePointerArrayByNumPlays( vector<Course*> &arrayCoursePointers, const Profile* pProfile, bool bDescending )
|
||||
{
|
||||
ASSERT( pProfile );
|
||||
for(unsigned i = 0; i < arrayCoursePointers.size(); ++i)
|
||||
course_sort_val[arrayCoursePointers[i]] = (float) pProfile->GetCourseNumTimesPlayed(arrayCoursePointers[i]);
|
||||
stable_sort( arrayCoursePointers.begin(), arrayCoursePointers.end(), bDescending ? CompareCoursePointersBySortValueDescending : CompareCoursePointersBySortValueAscending );
|
||||
course_sort_val.clear();
|
||||
}
|
||||
|
||||
void CourseID::FromCourse( const Course *p )
|
||||
{
|
||||
if( p )
|
||||
{
|
||||
sPath = p->m_sPath;
|
||||
sName = p->m_sName;
|
||||
}
|
||||
else
|
||||
{
|
||||
sPath = "";
|
||||
sName = "";
|
||||
}
|
||||
}
|
||||
|
||||
Course *CourseID::ToCourse() const
|
||||
{
|
||||
Course* pCourse = NULL;
|
||||
pCourse = SONGMAN->GetCourseFromPath( sPath );
|
||||
if( pCourse )
|
||||
return pCourse;
|
||||
pCourse = SONGMAN->GetCourseFromName( sName );
|
||||
return pCourse;
|
||||
}
|
||||
|
||||
Reference in New Issue
Block a user