Jason Felds
1950 lines
54 KiB
C++
1950 lines
54 KiB
C++
#include "global.h"
|
|
#include "SongManager.h"
|
|
#include "arch/LoadingWindow/LoadingWindow.h"
|
|
#include "AnnouncerManager.h"
|
|
#include "BackgroundUtil.h"
|
|
#include "BannerCache.h"
|
|
#include "CommonMetrics.h"
|
|
#include "Course.h"
|
|
#include "CourseLoaderCRS.h"
|
|
#include "CourseUtil.h"
|
|
#include "Foreach.h"
|
|
#include "GameManager.h"
|
|
#include "GameState.h"
|
|
#include "LocalizedString.h"
|
|
#include "MsdFile.h"
|
|
#include "NoteSkinManager.h"
|
|
#include "NotesLoaderDWI.h"
|
|
#include "NotesLoaderSSC.h"
|
|
#include "NotesLoaderSM.h"
|
|
#include "PrefsManager.h"
|
|
#include "Profile.h"
|
|
#include "ProfileManager.h"
|
|
#include "RageFile.h"
|
|
#include "RageFileManager.h"
|
|
#include "RageLog.h"
|
|
#include "Song.h"
|
|
#include "SongUtil.h"
|
|
#include "Sprite.h"
|
|
#include "StatsManager.h"
|
|
#include "Steps.h"
|
|
#include "StepsUtil.h"
|
|
#include "Style.h"
|
|
#include "ThemeManager.h"
|
|
#include "TitleSubstitution.h"
|
|
#include "TrailUtil.h"
|
|
#include "UnlockManager.h"
|
|
#include "SpecialFiles.h"
|
|
|
|
SongManager* SONGMAN = NULL; // global and accessable from anywhere in our program
|
|
|
|
const RString ADDITIONAL_SONGS_DIR = "/AdditionalSongs/";
|
|
const RString ADDITIONAL_COURSES_DIR = "/AdditionalCourses/";
|
|
const RString EDIT_SUBDIR = "Edits/";
|
|
|
|
/** @brief The file that contains various random attacks. */
|
|
const RString ATTACK_FILE = "/Data/RandomAttacks.txt";
|
|
|
|
static const ThemeMetric<RageColor> EXTRA_COLOR ( "SongManager", "ExtraColor" );
|
|
static const ThemeMetric<int> EXTRA_COLOR_METER ( "SongManager", "ExtraColorMeter" );
|
|
static const ThemeMetric<bool> USE_PREFERRED_SORT_COLOR ( "SongManager", "UsePreferredSortColor" );
|
|
static const ThemeMetric<bool> USE_UNLOCK_COLOR ( "SongManager", "UseUnlockColor" );
|
|
static const ThemeMetric<RageColor> UNLOCK_COLOR ( "SongManager", "UnlockColor" );
|
|
static const ThemeMetric<bool> MOVE_UNLOCKS_TO_BOTTOM_OF_PREFERRED_SORT ( "SongManager", "MoveUnlocksToBottomOfPreferredSort" );
|
|
static const ThemeMetric<int> EXTRA_STAGE2_DIFFICULTY_MAX ( "SongManager", "ExtraStage2DifficultyMax" );
|
|
|
|
static Preference<RString> g_sDisabledSongs( "DisabledSongs", "" );
|
|
static Preference<bool> g_bHideIncompleteCourses( "HideIncompleteCourses", false );
|
|
|
|
RString SONG_GROUP_COLOR_NAME( size_t i ) { return ssprintf( "SongGroupColor%i", (int) i+1 ); }
|
|
RString COURSE_GROUP_COLOR_NAME( size_t i ) { return ssprintf( "CourseGroupColor%i", (int) i+1 ); }
|
|
|
|
|
|
SongManager::SongManager()
|
|
{
|
|
// Register with Lua.
|
|
{
|
|
Lua *L = LUA->Get();
|
|
lua_pushstring( L, "SONGMAN" );
|
|
this->PushSelf( L );
|
|
lua_settable( L, LUA_GLOBALSINDEX );
|
|
LUA->Release( L );
|
|
}
|
|
|
|
NUM_SONG_GROUP_COLORS .Load( "SongManager", "NumSongGroupColors" );
|
|
SONG_GROUP_COLOR .Load( "SongManager", SONG_GROUP_COLOR_NAME, NUM_SONG_GROUP_COLORS );
|
|
NUM_COURSE_GROUP_COLORS .Load( "SongManager", "NumCourseGroupColors" );
|
|
COURSE_GROUP_COLOR .Load( "SongManager", COURSE_GROUP_COLOR_NAME, NUM_COURSE_GROUP_COLORS );
|
|
}
|
|
|
|
SongManager::~SongManager()
|
|
{
|
|
// Unregister with Lua.
|
|
LUA->UnsetGlobal( "SONGMAN" );
|
|
|
|
// Courses depend on Songs and Songs don't depend on Courses.
|
|
// So, delete the Courses first.
|
|
FreeCourses();
|
|
FreeSongs();
|
|
}
|
|
|
|
void SongManager::InitAll( LoadingWindow *ld )
|
|
{
|
|
InitSongsFromDisk( ld );
|
|
InitCoursesFromDisk( ld );
|
|
InitAutogenCourses();
|
|
InitRandomAttacks();
|
|
}
|
|
|
|
static LocalizedString RELOADING ( "SongManager", "Reloading..." );
|
|
void SongManager::Reload( bool bAllowFastLoad, LoadingWindow *ld )
|
|
{
|
|
FILEMAN->FlushDirCache( SpecialFiles::SONGS_DIR );
|
|
FILEMAN->FlushDirCache( ADDITIONAL_SONGS_DIR );
|
|
FILEMAN->FlushDirCache( SpecialFiles::COURSES_DIR );
|
|
FILEMAN->FlushDirCache( ADDITIONAL_COURSES_DIR );
|
|
FILEMAN->FlushDirCache( EDIT_SUBDIR );
|
|
|
|
if( ld )
|
|
ld->SetText( RELOADING );
|
|
|
|
// save scores before unloading songs, of the scores will be lost
|
|
PROFILEMAN->SaveMachineProfile();
|
|
|
|
FreeCourses();
|
|
FreeSongs();
|
|
|
|
const bool OldVal = PREFSMAN->m_bFastLoad;
|
|
if( !bAllowFastLoad )
|
|
PREFSMAN->m_bFastLoad.Set( false );
|
|
|
|
InitAll( ld );
|
|
|
|
// reload scores and unlocks afterward
|
|
PROFILEMAN->LoadMachineProfile();
|
|
UNLOCKMAN->Reload();
|
|
|
|
if( !bAllowFastLoad )
|
|
PREFSMAN->m_bFastLoad.Set( OldVal );
|
|
|
|
UpdatePreferredSort();
|
|
}
|
|
|
|
void SongManager::InitSongsFromDisk( LoadingWindow *ld )
|
|
{
|
|
RageTimer tm;
|
|
LoadStepManiaSongDir( SpecialFiles::SONGS_DIR, ld );
|
|
|
|
const bool bOldVal = PREFSMAN->m_bFastLoad;
|
|
PREFSMAN->m_bFastLoad.Set( PREFSMAN->m_bFastLoadAdditionalSongs );
|
|
LoadStepManiaSongDir( ADDITIONAL_SONGS_DIR, ld );
|
|
PREFSMAN->m_bFastLoad.Set( bOldVal );
|
|
|
|
LOG->Trace( "Found %d songs in %f seconds.", (int)m_pSongs.size(), tm.GetDeltaTime() );
|
|
}
|
|
|
|
static LocalizedString FOLDER_CONTAINS_MUSIC_FILES( "SongManager", "The folder \"%s\" appears to be a song folder. All song folders must reside in a group folder. For example, \"Songs/Originals/My Song\"." );
|
|
void SongManager::SanityCheckGroupDir( RString sDir ) const
|
|
{
|
|
// Check to see if they put a song directly inside the group folder.
|
|
vector<RString> arrayFiles;
|
|
GetDirListing( sDir + "/*.mp3", arrayFiles );
|
|
GetDirListing( sDir + "/*.oga", arrayFiles );
|
|
GetDirListing( sDir + "/*.ogg", arrayFiles );
|
|
GetDirListing( sDir + "/*.wav", arrayFiles );
|
|
if( !arrayFiles.empty() )
|
|
RageException::Throw( FOLDER_CONTAINS_MUSIC_FILES.GetValue(), sDir.c_str() );
|
|
}
|
|
|
|
void SongManager::AddGroup( RString sDir, RString sGroupDirName )
|
|
{
|
|
unsigned j;
|
|
for(j = 0; j < m_sSongGroupNames.size(); ++j)
|
|
if( sGroupDirName == m_sSongGroupNames[j] )
|
|
break;
|
|
|
|
if( j != m_sSongGroupNames.size() )
|
|
return; // the group is already added
|
|
|
|
// Look for a group banner in this group folder
|
|
vector<RString> arrayGroupBanners;
|
|
GetDirListing( sDir+sGroupDirName+"/*.png", arrayGroupBanners );
|
|
GetDirListing( sDir+sGroupDirName+"/*.jpg", arrayGroupBanners );
|
|
GetDirListing( sDir+sGroupDirName+"/*.gif", arrayGroupBanners );
|
|
GetDirListing( sDir+sGroupDirName+"/*.bmp", arrayGroupBanners );
|
|
|
|
RString sBannerPath;
|
|
if( !arrayGroupBanners.empty() )
|
|
sBannerPath = sDir+sGroupDirName+"/"+arrayGroupBanners[0] ;
|
|
else
|
|
{
|
|
// Look for a group banner in the parent folder
|
|
GetDirListing( sDir+sGroupDirName+".png", arrayGroupBanners );
|
|
GetDirListing( sDir+sGroupDirName+".jpg", arrayGroupBanners );
|
|
GetDirListing( sDir+sGroupDirName+".gif", arrayGroupBanners );
|
|
GetDirListing( sDir+sGroupDirName+".bmp", arrayGroupBanners );
|
|
if( !arrayGroupBanners.empty() )
|
|
sBannerPath = sDir+arrayGroupBanners[0];
|
|
}
|
|
|
|
/* Other group graphics are a bit trickier, and usually don't exist.
|
|
* A themer has a few options, namely checking the aspect ratio and
|
|
* operating on it. -aj
|
|
* TODO: Once the files are implemented in Song, bring the extensions
|
|
* from there into here. -aj */
|
|
// Group background
|
|
|
|
//vector<RString> arrayGroupBackgrounds;
|
|
//GetDirListing( sDir+sGroupDirName+"/*-bg.png", arrayGroupBanners );
|
|
//GetDirListing( sDir+sGroupDirName+"/*-bg.jpg", arrayGroupBanners );
|
|
//GetDirListing( sDir+sGroupDirName+"/*-bg.gif", arrayGroupBanners );
|
|
//GetDirListing( sDir+sGroupDirName+"/*-bg.bmp", arrayGroupBanners );
|
|
/*
|
|
RString sBackgroundPath;
|
|
if( !arrayGroupBackgrounds.empty() )
|
|
sBackgroundPath = sDir+sGroupDirName+"/"+arrayGroupBackgrounds[0];
|
|
else
|
|
{
|
|
// Look for a group background in the parent folder
|
|
GetDirListing( sDir+sGroupDirName+"-bg.png", arrayGroupBackgrounds );
|
|
GetDirListing( sDir+sGroupDirName+"-bg.jpg", arrayGroupBackgrounds );
|
|
GetDirListing( sDir+sGroupDirName+"-bg.gif", arrayGroupBackgrounds );
|
|
GetDirListing( sDir+sGroupDirName+"-bg.bmp", arrayGroupBackgrounds );
|
|
if( !arrayGroupBackgrounds.empty() )
|
|
sBackgroundPath = sDir+arrayGroupBackgrounds[0];
|
|
}
|
|
*/
|
|
/*
|
|
LOG->Trace( "Group banner for '%s' is '%s'.", sGroupDirName.c_str(),
|
|
sBannerPath != ""? sBannerPath.c_str():"(none)" );
|
|
*/
|
|
m_sSongGroupNames.push_back( sGroupDirName );
|
|
m_sSongGroupBannerPaths.push_back( sBannerPath );
|
|
//m_sSongGroupBackgroundPaths.push_back( sBackgroundPath );
|
|
}
|
|
|
|
static LocalizedString LOADING_SONGS ( "SongManager", "Loading songs..." );
|
|
void SongManager::LoadStepManiaSongDir( RString sDir, LoadingWindow *ld )
|
|
{
|
|
// Make sure sDir has a trailing slash.
|
|
if( sDir.Right(1) != "/" )
|
|
sDir += "/";
|
|
|
|
// Find all group directories in "Songs" folder
|
|
vector<RString> arrayGroupDirs;
|
|
GetDirListing( sDir+"*", arrayGroupDirs, true );
|
|
SortRStringArray( arrayGroupDirs );
|
|
StripCvsAndSvn( arrayGroupDirs );
|
|
StripMacResourceForks( arrayGroupDirs );
|
|
|
|
FOREACH_CONST( RString, arrayGroupDirs, s ) // foreach dir in /Songs/
|
|
{
|
|
RString sGroupDirName = *s;
|
|
|
|
SanityCheckGroupDir(sDir+sGroupDirName);
|
|
|
|
// Find all Song folders in this group directory
|
|
vector<RString> arraySongDirs;
|
|
GetDirListing( sDir+sGroupDirName + "/*", arraySongDirs, true, true );
|
|
StripCvsAndSvn( arraySongDirs );
|
|
StripMacResourceForks( arraySongDirs );
|
|
SortRStringArray( arraySongDirs );
|
|
|
|
LOG->Trace("Attempting to load %i songs from \"%s\"", int(arraySongDirs.size()),
|
|
(sDir+sGroupDirName).c_str() );
|
|
int loaded = 0;
|
|
|
|
SongPointerVector& index_entry = m_mapSongGroupIndex[sGroupDirName];
|
|
|
|
for( unsigned j=0; j< arraySongDirs.size(); ++j ) // for each song dir
|
|
{
|
|
RString sSongDirName = arraySongDirs[j];
|
|
|
|
// this is a song directory. Load a new song.
|
|
if( ld )
|
|
{
|
|
ld->SetText( LOADING_SONGS.GetValue()+ssprintf("\n%s\n%s",
|
|
Basename(sGroupDirName).c_str(),
|
|
Basename(sSongDirName).c_str()));
|
|
ld->Paint();
|
|
}
|
|
Song* pNewSong = new Song;
|
|
if( !pNewSong->LoadFromSongDir( sSongDirName ) )
|
|
{
|
|
// The song failed to load.
|
|
delete pNewSong;
|
|
continue;
|
|
}
|
|
|
|
m_pSongs.push_back( pNewSong );
|
|
index_entry.push_back( pNewSong );
|
|
loaded++;
|
|
}
|
|
|
|
LOG->Trace("Loaded %i songs from \"%s\"", loaded, (sDir+sGroupDirName).c_str() );
|
|
|
|
// Don't add the group name if we didn't load any songs in this group.
|
|
if(!loaded) continue;
|
|
|
|
// Add this group to the group array.
|
|
AddGroup(sDir, sGroupDirName);
|
|
|
|
// Cache and load the group banner. (and background if it has one -aj)
|
|
BANNERCACHE->CacheBanner( GetSongGroupBannerPath(sGroupDirName) );
|
|
|
|
// Load the group sym links (if any)
|
|
LoadGroupSymLinks(sDir, sGroupDirName);
|
|
}
|
|
|
|
LoadEnabledSongsFromPref();
|
|
}
|
|
|
|
// Instead of "symlinks", songs should have membership in multiple groups. -Chris
|
|
void SongManager::LoadGroupSymLinks(RString sDir, RString sGroupFolder)
|
|
{
|
|
// Find all symlink files in this folder
|
|
vector<RString> arraySymLinks;
|
|
GetDirListing( sDir+sGroupFolder+"/*.include", arraySymLinks, false );
|
|
SortRStringArray( arraySymLinks );
|
|
SongPointerVector& index_entry = m_mapSongGroupIndex[sGroupFolder];
|
|
for( unsigned s=0; s< arraySymLinks.size(); s++ ) // for each symlink in this dir, add it in as a song.
|
|
{
|
|
MsdFile msdF;
|
|
msdF.ReadFile( sDir+sGroupFolder+"/"+arraySymLinks[s].c_str(), false ); // don't unescape
|
|
RString sSymDestination = msdF.GetParam(0,1); // Should only be 1 value & param...period.
|
|
|
|
Song* pNewSong = new Song;
|
|
if( !pNewSong->LoadFromSongDir( sSymDestination ) )
|
|
{
|
|
delete pNewSong; // The song failed to load.
|
|
}
|
|
else
|
|
{
|
|
const vector<Steps*>& vpSteps = pNewSong->GetAllSteps();
|
|
while( vpSteps.size() )
|
|
pNewSong->DeleteSteps( vpSteps[0] );
|
|
|
|
FOREACH_BackgroundLayer( i )
|
|
pNewSong->GetBackgroundChanges(i).clear();
|
|
|
|
pNewSong->m_bIsSymLink = true; // Very important so we don't double-parse later
|
|
pNewSong->m_sGroupName = sGroupFolder;
|
|
m_pSongs.push_back( pNewSong );
|
|
index_entry.push_back( pNewSong );
|
|
}
|
|
}
|
|
}
|
|
|
|
void SongManager::PreloadSongImages()
|
|
{
|
|
if( PREFSMAN->m_BannerCache != BNCACHE_FULL )
|
|
return;
|
|
|
|
/* Load textures before unloading old ones, so we don't reload textures
|
|
* that we don't need to. */
|
|
RageTexturePreloader preload;
|
|
|
|
const vector<Song*> &songs = GetAllSongs();
|
|
for( unsigned i = 0; i < songs.size(); ++i )
|
|
{
|
|
if( !songs[i]->HasBanner() )
|
|
continue;
|
|
|
|
const RageTextureID ID = Sprite::SongBannerTexture( songs[i]->GetBannerPath() );
|
|
preload.Load( ID );
|
|
}
|
|
|
|
vector<Course*> courses;
|
|
GetAllCourses( courses, false );
|
|
for( unsigned i = 0; i < courses.size(); ++i )
|
|
{
|
|
if( !courses[i]->HasBanner() )
|
|
continue;
|
|
|
|
const RageTextureID ID = Sprite::SongBannerTexture( courses[i]->GetBannerPath() );
|
|
preload.Load( ID );
|
|
}
|
|
|
|
preload.Swap( m_TexturePreload );
|
|
}
|
|
|
|
void SongManager::FreeSongs()
|
|
{
|
|
m_sSongGroupNames.clear();
|
|
m_sSongGroupBannerPaths.clear();
|
|
//m_sSongGroupBackgroundPaths.clear();
|
|
|
|
for( unsigned i=0; i<m_pSongs.size(); i++ )
|
|
SAFE_DELETE( m_pSongs[i] );
|
|
m_pSongs.clear();
|
|
m_mapSongGroupIndex.clear();
|
|
|
|
// wait why is it cleared twice? -aj
|
|
m_sSongGroupBannerPaths.clear();
|
|
//m_sSongGroupBackgroundPaths.clear(); // when in Rome... -aj
|
|
|
|
m_pPopularSongs.clear();
|
|
m_pShuffledSongs.clear();
|
|
}
|
|
|
|
RString SongManager::GetSongGroupBannerPath( RString sSongGroup ) const
|
|
{
|
|
for( unsigned i = 0; i < m_sSongGroupNames.size(); ++i )
|
|
{
|
|
if( sSongGroup == m_sSongGroupNames[i] )
|
|
return m_sSongGroupBannerPaths[i];
|
|
}
|
|
|
|
return RString();
|
|
}
|
|
/*
|
|
RString SongManager::GetSongGroupBackgroundPath( RString sSongGroup ) const
|
|
{
|
|
for( unsigned i = 0; i < m_sSongGroupNames.size(); ++i )
|
|
{
|
|
if( sSongGroup == m_sSongGroupNames[i] )
|
|
return m_sSongGroupBackgroundPaths[i];
|
|
}
|
|
|
|
return RString();
|
|
}
|
|
*/
|
|
void SongManager::GetSongGroupNames( vector<RString> &AddTo ) const
|
|
{
|
|
AddTo.insert(AddTo.end(), m_sSongGroupNames.begin(), m_sSongGroupNames.end() );
|
|
}
|
|
|
|
bool SongManager::DoesSongGroupExist( RString sSongGroup ) const
|
|
{
|
|
return find( m_sSongGroupNames.begin(), m_sSongGroupNames.end(), sSongGroup ) != m_sSongGroupNames.end();
|
|
}
|
|
|
|
RageColor SongManager::GetSongGroupColor( const RString &sSongGroup ) const
|
|
{
|
|
for( unsigned i=0; i<m_sSongGroupNames.size(); i++ )
|
|
{
|
|
if( m_sSongGroupNames[i] == sSongGroup )
|
|
{
|
|
return SONG_GROUP_COLOR.GetValue( i%NUM_SONG_GROUP_COLORS );
|
|
}
|
|
}
|
|
|
|
ASSERT_M( 0, ssprintf("requested color for song group '%s' that doesn't exist",sSongGroup.c_str()) );
|
|
return RageColor(1,1,1,1);
|
|
}
|
|
|
|
RageColor SongManager::GetSongColor( const Song* pSong ) const
|
|
{
|
|
ASSERT( pSong );
|
|
|
|
// Use unlock color if applicable
|
|
const UnlockEntry *pUE = UNLOCKMAN->FindSong( pSong );
|
|
if( pUE && USE_UNLOCK_COLOR.GetValue() )
|
|
return UNLOCK_COLOR.GetValue();
|
|
|
|
if( USE_PREFERRED_SORT_COLOR )
|
|
{
|
|
FOREACH_CONST( PreferredSortSection, m_vPreferredSongSort, v )
|
|
{
|
|
FOREACH_CONST( Song*, v->vpSongs, s )
|
|
{
|
|
if( *s == pSong )
|
|
{
|
|
int i = v - m_vPreferredSongSort.begin();
|
|
return SONG_GROUP_COLOR.GetValue( i%NUM_SONG_GROUP_COLORS );
|
|
}
|
|
}
|
|
}
|
|
|
|
int i = m_vPreferredSongSort.size();
|
|
return SONG_GROUP_COLOR.GetValue( i%NUM_SONG_GROUP_COLORS );
|
|
}
|
|
else
|
|
{
|
|
/* XXX: Previously, this matched all notes, which set a song to "extra"
|
|
* if it had any 10-foot steps at all, even edits or doubles.
|
|
*
|
|
* For now, only look at notes for the current note type. This means
|
|
* that if a song has 10-foot steps on Doubles, it'll only show up red
|
|
* in Doubles. That's not too bad, I think. This will also change it
|
|
* in the song scroll, which is a little odd but harmless.
|
|
*
|
|
* XXX: Ack. This means this function can only be called when we have
|
|
* a style set up, which is too restrictive. How to handle this? */
|
|
//const StepsType st = GAMESTATE->GetCurrentStyle()->m_StepsType;
|
|
const vector<Steps*>& vpSteps = pSong->GetAllSteps();
|
|
for( unsigned i=0; i<vpSteps.size(); i++ )
|
|
{
|
|
const Steps* pSteps = vpSteps[i];
|
|
switch( pSteps->GetDifficulty() )
|
|
{
|
|
case Difficulty_Challenge:
|
|
case Difficulty_Edit:
|
|
continue;
|
|
}
|
|
|
|
//if(pSteps->m_StepsType != st)
|
|
// continue;
|
|
|
|
if( pSteps->GetMeter() >= EXTRA_COLOR_METER )
|
|
return (RageColor)EXTRA_COLOR;
|
|
}
|
|
if( pSong->m_sMainTitle == "DVNO")
|
|
{
|
|
return RageColor(1.0f,0.8f,0.0f,1.0f);
|
|
}
|
|
else
|
|
{
|
|
return GetSongGroupColor( pSong->m_sGroupName );
|
|
}
|
|
}
|
|
}
|
|
|
|
RString SongManager::GetCourseGroupBannerPath( const RString &sCourseGroup ) const
|
|
{
|
|
map<RString, CourseGroupInfo>::const_iterator iter = m_mapCourseGroupToInfo.find( sCourseGroup );
|
|
if( iter == m_mapCourseGroupToInfo.end() )
|
|
{
|
|
ASSERT_M( 0, ssprintf("requested banner for course group '%s' that doesn't exist",sCourseGroup.c_str()) );
|
|
return RString();
|
|
}
|
|
else
|
|
{
|
|
return iter->second.m_sBannerPath;
|
|
}
|
|
}
|
|
|
|
void SongManager::GetCourseGroupNames( vector<RString> &AddTo ) const
|
|
{
|
|
FOREACHM_CONST( RString, CourseGroupInfo, m_mapCourseGroupToInfo, iter )
|
|
AddTo.push_back( iter->first );
|
|
}
|
|
|
|
bool SongManager::DoesCourseGroupExist( const RString &sCourseGroup ) const
|
|
{
|
|
return m_mapCourseGroupToInfo.find( sCourseGroup ) != m_mapCourseGroupToInfo.end();
|
|
}
|
|
|
|
RageColor SongManager::GetCourseGroupColor( const RString &sCourseGroup ) const
|
|
{
|
|
int iIndex = 0;
|
|
FOREACHM_CONST( RString, CourseGroupInfo, m_mapCourseGroupToInfo, iter )
|
|
{
|
|
if( iter->first == sCourseGroup )
|
|
return SONG_GROUP_COLOR.GetValue( iIndex%NUM_SONG_GROUP_COLORS );
|
|
iIndex++;
|
|
}
|
|
|
|
ASSERT_M( 0, ssprintf("requested color for course group '%s' that doesn't exist",sCourseGroup.c_str()) );
|
|
return RageColor(1,1,1,1);
|
|
}
|
|
|
|
RageColor SongManager::GetCourseColor( const Course* pCourse ) const
|
|
{
|
|
// Use unlock color if applicable
|
|
const UnlockEntry *pUE = UNLOCKMAN->FindCourse( pCourse );
|
|
if( pUE && USE_UNLOCK_COLOR.GetValue() )
|
|
return UNLOCK_COLOR.GetValue();
|
|
|
|
|
|
if( USE_PREFERRED_SORT_COLOR )
|
|
{
|
|
FOREACH_CONST( CoursePointerVector, m_vPreferredCourseSort, v )
|
|
{
|
|
FOREACH_CONST( Course*, *v, s )
|
|
{
|
|
if( *s == pCourse )
|
|
{
|
|
int i = v - m_vPreferredCourseSort.begin();
|
|
CHECKPOINT_M( ssprintf( "%i, NUM_COURSE_GROUP_COLORS = %i", i, NUM_COURSE_GROUP_COLORS.GetValue()) );
|
|
return COURSE_GROUP_COLOR.GetValue( i % NUM_COURSE_GROUP_COLORS );
|
|
}
|
|
}
|
|
}
|
|
|
|
int i = m_vPreferredCourseSort.size();
|
|
CHECKPOINT_M( ssprintf( "%i, NUM_COURSE_GROUP_COLORS = %i", i, NUM_COURSE_GROUP_COLORS.GetValue()) );
|
|
return COURSE_GROUP_COLOR.GetValue( i % NUM_COURSE_GROUP_COLORS );
|
|
}
|
|
else
|
|
{
|
|
return GetCourseGroupColor( pCourse->m_sGroupName );
|
|
}
|
|
}
|
|
|
|
void SongManager::ResetGroupColors()
|
|
{
|
|
// Reload song/course group colors to prevent a crash when switching
|
|
// themes in-game. (apparently not, though.) -aj
|
|
SONG_GROUP_COLOR.Clear();
|
|
COURSE_GROUP_COLOR.Clear();
|
|
|
|
NUM_SONG_GROUP_COLORS .Load( "SongManager", "NumSongGroupColors" );
|
|
SONG_GROUP_COLOR .Load( "SongManager", SONG_GROUP_COLOR_NAME, NUM_SONG_GROUP_COLORS );
|
|
NUM_COURSE_GROUP_COLORS .Load( "SongManager", "NumCourseGroupColors" );
|
|
COURSE_GROUP_COLOR .Load( "SongManager", COURSE_GROUP_COLOR_NAME, NUM_COURSE_GROUP_COLORS );
|
|
}
|
|
|
|
const vector<Song*> &SongManager::GetSongs( const RString &sGroupName ) const
|
|
{
|
|
static const vector<Song*> vEmpty;
|
|
|
|
if( sGroupName == GROUP_ALL )
|
|
return m_pSongs;
|
|
map<RString, SongPointerVector, Comp>::const_iterator iter = m_mapSongGroupIndex.find( sGroupName );
|
|
if ( iter != m_mapSongGroupIndex.end() )
|
|
return iter->second;
|
|
return vEmpty;
|
|
}
|
|
|
|
void SongManager::GetPreferredSortSongs( vector<Song*> &AddTo ) const
|
|
{
|
|
if( m_vPreferredSongSort.empty() )
|
|
{
|
|
AddTo.insert( AddTo.end(), m_pSongs.begin(), m_pSongs.end() );
|
|
return;
|
|
}
|
|
|
|
FOREACH_CONST( PreferredSortSection, m_vPreferredSongSort, v )
|
|
AddTo.insert( AddTo.end(), v->vpSongs.begin(), v->vpSongs.end() );
|
|
}
|
|
|
|
RString SongManager::SongToPreferredSortSectionName( const Song *pSong ) const
|
|
{
|
|
FOREACH_CONST( PreferredSortSection, m_vPreferredSongSort, v )
|
|
{
|
|
FOREACH_CONST( Song*, v->vpSongs, s )
|
|
{
|
|
if( *s == pSong )
|
|
return v->sName;
|
|
}
|
|
}
|
|
return RString();
|
|
}
|
|
|
|
void SongManager::GetPreferredSortCourses( CourseType ct, vector<Course*> &AddTo, bool bIncludeAutogen ) const
|
|
{
|
|
if( m_vPreferredCourseSort.empty() )
|
|
{
|
|
GetCourses( ct, AddTo, bIncludeAutogen );
|
|
return;
|
|
}
|
|
|
|
FOREACH_CONST( CoursePointerVector, m_vPreferredCourseSort, v )
|
|
{
|
|
FOREACH_CONST( Course*, *v, c )
|
|
{
|
|
Course *pCourse = *c;
|
|
if( pCourse->GetCourseType() == ct )
|
|
AddTo.push_back( pCourse );
|
|
}
|
|
}
|
|
}
|
|
|
|
int SongManager::GetNumSongs() const
|
|
{
|
|
return m_pSongs.size();
|
|
}
|
|
|
|
int SongManager::GetNumUnlockedSongs() const
|
|
{
|
|
int iNum = 0;
|
|
FOREACH_CONST( Song*, m_pSongs, i )
|
|
{
|
|
// If locked for any reason other than LOCKED_LOCK:
|
|
if( UNLOCKMAN->SongIsLocked(*i) & ~LOCKED_LOCK )
|
|
continue;
|
|
++iNum;
|
|
}
|
|
return iNum;
|
|
}
|
|
|
|
int SongManager::GetNumSelectableAndUnlockedSongs() const
|
|
{
|
|
int iNum = 0;
|
|
FOREACH_CONST( Song*, m_pSongs, i )
|
|
{
|
|
// If locked for any reason other than LOCKED_LOCK or LOCKED_SELECTABLE:
|
|
if( UNLOCKMAN->SongIsLocked(*i) & ~(LOCKED_LOCK|LOCKED_SELECTABLE) )
|
|
continue;
|
|
++iNum;
|
|
}
|
|
return iNum;
|
|
}
|
|
|
|
int SongManager::GetNumAdditionalSongs() const
|
|
{
|
|
int iNum = 0;
|
|
FOREACH_CONST( Song*, m_pSongs, i )
|
|
{
|
|
if( WasLoadedFromAdditionalSongs( *i ) )
|
|
++iNum;
|
|
}
|
|
return iNum;
|
|
}
|
|
|
|
int SongManager::GetNumSongGroups() const
|
|
{
|
|
return m_sSongGroupNames.size();
|
|
}
|
|
|
|
int SongManager::GetNumCourses() const
|
|
{
|
|
return m_pCourses.size();
|
|
}
|
|
|
|
int SongManager::GetNumAdditionalCourses() const
|
|
{
|
|
int iNum = 0;
|
|
FOREACH_CONST( Course*, m_pCourses, i )
|
|
{
|
|
if( WasLoadedFromAdditionalCourses( *i ) )
|
|
++iNum;
|
|
}
|
|
return iNum;
|
|
}
|
|
|
|
int SongManager::GetNumCourseGroups() const
|
|
{
|
|
return m_mapCourseGroupToInfo.size();
|
|
}
|
|
|
|
RString SongManager::ShortenGroupName( RString sLongGroupName )
|
|
{
|
|
static TitleSubst tsub("Groups");
|
|
|
|
TitleFields title;
|
|
title.Title = sLongGroupName;
|
|
tsub.Subst( title );
|
|
return title.Title;
|
|
}
|
|
|
|
static LocalizedString LOADING_COURSES ( "SongManager", "Loading courses..." );
|
|
void SongManager::InitCoursesFromDisk( LoadingWindow *ld )
|
|
{
|
|
LOG->Trace( "Loading courses." );
|
|
|
|
vector<RString> vsCourseDirs;
|
|
vsCourseDirs.push_back( SpecialFiles::COURSES_DIR );
|
|
vsCourseDirs.push_back( ADDITIONAL_COURSES_DIR );
|
|
|
|
vector<RString> vsCourseGroupNames;
|
|
FOREACH_CONST( RString, vsCourseDirs, sDir )
|
|
{
|
|
// Find all group directories in Courses dir
|
|
GetDirListing( *sDir + "*", vsCourseGroupNames, true, true );
|
|
StripCvsAndSvn( vsCourseGroupNames );
|
|
StripMacResourceForks( vsCourseGroupNames );
|
|
}
|
|
|
|
// Search for courses both in COURSES_DIR and in subdirectories
|
|
vsCourseGroupNames.push_back( SpecialFiles::COURSES_DIR );
|
|
SortRStringArray( vsCourseGroupNames );
|
|
|
|
FOREACH_CONST( RString, vsCourseGroupNames, sCourseGroup ) // for each dir in /Courses/
|
|
{
|
|
// Find all CRS files in this group directory
|
|
vector<RString> vsCoursePaths;
|
|
GetDirListing( *sCourseGroup + "/*.crs", vsCoursePaths, false, true );
|
|
SortRStringArray( vsCoursePaths );
|
|
|
|
FOREACH_CONST( RString, vsCoursePaths, sCoursePath )
|
|
{
|
|
if( ld )
|
|
{
|
|
ld->SetText( LOADING_COURSES.GetValue()+ssprintf("\n%s\n%s",
|
|
Basename(*sCourseGroup).c_str(),
|
|
Basename(*sCoursePath).c_str()));
|
|
ld->Paint();
|
|
}
|
|
|
|
Course* pCourse = new Course;
|
|
CourseLoaderCRS::LoadFromCRSFile( *sCoursePath, *pCourse );
|
|
|
|
if( g_bHideIncompleteCourses.Get() && pCourse->m_bIncomplete )
|
|
{
|
|
delete pCourse;
|
|
continue;
|
|
}
|
|
|
|
m_pCourses.push_back( pCourse );
|
|
}
|
|
}
|
|
|
|
RefreshCourseGroupInfo();
|
|
}
|
|
|
|
void SongManager::InitAutogenCourses()
|
|
{
|
|
//
|
|
// Create group courses for Endless and Nonstop
|
|
//
|
|
vector<RString> saGroupNames;
|
|
this->GetSongGroupNames( saGroupNames );
|
|
Course* pCourse;
|
|
for( unsigned g=0; g<saGroupNames.size(); g++ ) // foreach Group
|
|
{
|
|
RString sGroupName = saGroupNames[g];
|
|
|
|
// Generate random courses from each group.
|
|
pCourse = new Course;
|
|
CourseUtil::AutogenEndlessFromGroup( sGroupName, Difficulty_Medium, *pCourse );
|
|
m_pCourses.push_back( pCourse );
|
|
|
|
pCourse = new Course;
|
|
CourseUtil::AutogenNonstopFromGroup( sGroupName, Difficulty_Medium, *pCourse );
|
|
m_pCourses.push_back( pCourse );
|
|
}
|
|
|
|
vector<Song*> apCourseSongs = GetAllSongs();
|
|
|
|
// Generate "All Songs" endless course.
|
|
pCourse = new Course;
|
|
CourseUtil::AutogenEndlessFromGroup( "", Difficulty_Medium, *pCourse );
|
|
m_pCourses.push_back( pCourse );
|
|
|
|
/* Generate Oni courses from artists. Only create courses if we have at least
|
|
* four songs from an artist; create 3- and 4-song courses. */
|
|
{
|
|
/* We normally sort by translit artist. However, display artist is more
|
|
* consistent. For example, transliterated Japanese names are alternately
|
|
* spelled given- and family-name first, but display titles are more consistent. */
|
|
vector<Song*> apSongs = this->GetAllSongs();
|
|
SongUtil::SortSongPointerArrayByDisplayArtist( apSongs );
|
|
|
|
RString sCurArtist = "";
|
|
RString sCurArtistTranslit = "";
|
|
int iCurArtistCount = 0;
|
|
|
|
vector<Song *> aSongs;
|
|
unsigned i = 0;
|
|
do {
|
|
RString sArtist = i >= apSongs.size()? RString(""): apSongs[i]->GetDisplayArtist();
|
|
RString sTranslitArtist = i >= apSongs.size()? RString(""): apSongs[i]->GetTranslitArtist();
|
|
if( i < apSongs.size() && !sCurArtist.CompareNoCase(sArtist) )
|
|
{
|
|
aSongs.push_back( apSongs[i] );
|
|
++iCurArtistCount;
|
|
continue;
|
|
}
|
|
|
|
/* Different artist, or we're at the end. If we have enough entries for
|
|
* the last artist, add it. Skip blanks and "Unknown artist". */
|
|
if( iCurArtistCount >= 3 && sCurArtistTranslit != "" &&
|
|
sCurArtistTranslit.CompareNoCase("Unknown artist") &&
|
|
sCurArtist.CompareNoCase("Unknown artist") )
|
|
{
|
|
pCourse = new Course;
|
|
CourseUtil::AutogenOniFromArtist( sCurArtist, sCurArtistTranslit, aSongs, Difficulty_Hard, *pCourse );
|
|
m_pCourses.push_back( pCourse );
|
|
}
|
|
|
|
aSongs.clear();
|
|
|
|
if( i < apSongs.size() )
|
|
{
|
|
sCurArtist = sArtist;
|
|
sCurArtistTranslit = sTranslitArtist;
|
|
iCurArtistCount = 1;
|
|
aSongs.push_back( apSongs[i] );
|
|
}
|
|
} while( i++ < apSongs.size() );
|
|
}
|
|
}
|
|
|
|
void SongManager::InitRandomAttacks()
|
|
{
|
|
GAMESTATE->m_RandomAttacks.clear();
|
|
|
|
if( !IsAFile(ATTACK_FILE) )
|
|
LOG->Trace( "File Data/RandomAttacks.txt was not found" );
|
|
else
|
|
{
|
|
MsdFile msd;
|
|
|
|
if( !msd.ReadFile( ATTACK_FILE, true ) )
|
|
LOG->Warn( "Error opening file '%s' for reading: %s.", ATTACK_FILE.c_str(), msd.GetError().c_str() );
|
|
else
|
|
{
|
|
for( unsigned i=0; i<msd.GetNumValues(); i++ )
|
|
{
|
|
int iNumParams = msd.GetNumParams(i);
|
|
const MsdFile::value_t &sParams = msd.GetValue(i);
|
|
RString sType = sParams[0];
|
|
RString sAttack = sParams[1];
|
|
|
|
if( iNumParams > 2 )
|
|
{
|
|
LOG->Warn( "Got \"%s:%s\" tag with too many parameters", sType.c_str(), sAttack.c_str() );
|
|
continue;
|
|
}
|
|
|
|
if( stricmp(sType,"ATTACK") != 0 )
|
|
{
|
|
LOG->Warn( "Got \"%s:%s\" tag with wrong declaration", sType.c_str(), sAttack.c_str() );
|
|
continue;
|
|
}
|
|
|
|
GAMESTATE->m_RandomAttacks.push_back( sAttack );
|
|
}
|
|
}
|
|
}
|
|
}
|
|
|
|
void SongManager::FreeCourses()
|
|
{
|
|
for( unsigned i=0; i<m_pCourses.size(); i++ )
|
|
delete m_pCourses[i];
|
|
m_pCourses.clear();
|
|
|
|
FOREACH_CourseType( ct )
|
|
m_pPopularCourses[ct].clear();
|
|
m_pShuffledCourses.clear();
|
|
|
|
m_mapCourseGroupToInfo.clear();
|
|
}
|
|
|
|
void SongManager::DeleteAutogenCourses()
|
|
{
|
|
vector<Course*> vNewCourses;
|
|
for( vector<Course*>::iterator it = m_pCourses.begin(); it != m_pCourses.end(); ++it )
|
|
{
|
|
if( (*it)->m_bIsAutogen )
|
|
{
|
|
delete *it;
|
|
}
|
|
else
|
|
{
|
|
vNewCourses.push_back( *it );
|
|
}
|
|
}
|
|
m_pCourses.swap( vNewCourses );
|
|
UpdatePopular();
|
|
UpdateShuffled();
|
|
RefreshCourseGroupInfo();
|
|
}
|
|
|
|
void SongManager::AddCourse( Course *pCourse )
|
|
{
|
|
m_pCourses.push_back( pCourse );
|
|
UpdatePopular();
|
|
UpdateShuffled();
|
|
m_mapCourseGroupToInfo[ pCourse->m_sGroupName ]; // insert
|
|
}
|
|
|
|
void SongManager::DeleteCourse( Course *pCourse )
|
|
{
|
|
vector<Course*>::iterator iter = find( m_pCourses.begin(), m_pCourses.end(), pCourse );
|
|
ASSERT( iter != m_pCourses.end() );
|
|
m_pCourses.erase( iter );
|
|
UpdatePopular();
|
|
UpdateShuffled();
|
|
RefreshCourseGroupInfo();
|
|
}
|
|
|
|
void SongManager::InvalidateCachedTrails()
|
|
{
|
|
FOREACH_CONST( Course *, m_pCourses, pCourse )
|
|
{
|
|
const Course &c = **pCourse;
|
|
|
|
if( c.IsAnEdit() )
|
|
c.m_TrailCache.clear();
|
|
}
|
|
}
|
|
|
|
/* Called periodically to wipe out cached NoteData. This is called when we
|
|
* change screens. */
|
|
void SongManager::Cleanup()
|
|
{
|
|
for( unsigned i=0; i<m_pSongs.size(); i++ )
|
|
{
|
|
Song* pSong = m_pSongs[i];
|
|
const vector<Steps*>& vpSteps = pSong->GetAllSteps();
|
|
for( unsigned n=0; n<vpSteps.size(); n++ )
|
|
{
|
|
Steps* pSteps = vpSteps[n];
|
|
pSteps->Compress();
|
|
}
|
|
}
|
|
}
|
|
|
|
/* Flush all Song*, Steps* and Course* caches. This is when a Song or its Steps
|
|
* are removed or changed. This doesn't touch GAMESTATE and StageStats
|
|
* pointers. Currently, the only time Steps are altered independently of the
|
|
* Courses and Songs is in Edit Mode, which updates the other pointers it needs. */
|
|
void SongManager::Invalidate( const Song *pStaleSong )
|
|
{
|
|
// TODO: This is unnecessarily expensive.
|
|
// Can we regenerate only the autogen courses that are affected?
|
|
DeleteAutogenCourses();
|
|
|
|
FOREACH( Course*, this->m_pCourses, pCourse )
|
|
{
|
|
(*pCourse)->Invalidate( pStaleSong );
|
|
}
|
|
|
|
InitAutogenCourses();
|
|
|
|
UpdatePopular();
|
|
UpdateShuffled();
|
|
RefreshCourseGroupInfo();
|
|
}
|
|
|
|
void SongManager::RegenerateNonFixedCourses()
|
|
{
|
|
for( unsigned i=0; i < m_pCourses.size(); i++ )
|
|
m_pCourses[i]->RegenerateNonFixedTrails();
|
|
}
|
|
|
|
void SongManager::SetPreferences()
|
|
{
|
|
for( unsigned int i=0; i<m_pSongs.size(); i++ )
|
|
{
|
|
// PREFSMAN->m_bAutogenSteps may have changed.
|
|
m_pSongs[i]->RemoveAutoGenNotes();
|
|
m_pSongs[i]->AddAutoGenNotes();
|
|
}
|
|
}
|
|
|
|
void SongManager::SaveEnabledSongsToPref()
|
|
{
|
|
vector<RString> vsDisabledSongs;
|
|
|
|
// Intentionally drop disabled song entries for songs that aren't currently loaded.
|
|
|
|
const vector<Song*> &apSongs = SONGMAN->GetAllSongs();
|
|
FOREACH_CONST( Song *, apSongs, s )
|
|
{
|
|
Song *pSong = (*s);
|
|
SongID sid;
|
|
sid.FromSong( pSong );
|
|
if( !pSong->GetEnabled() )
|
|
vsDisabledSongs.push_back( sid.ToString() );
|
|
}
|
|
g_sDisabledSongs.Set( join(";", vsDisabledSongs) );
|
|
}
|
|
|
|
void SongManager::LoadEnabledSongsFromPref()
|
|
{
|
|
FOREACH( Song *, m_pSongs, s )
|
|
(*s)->SetEnabled( true );
|
|
|
|
vector<RString> asDisabledSongs;
|
|
split( g_sDisabledSongs, ";", asDisabledSongs, true );
|
|
|
|
FOREACH_CONST( RString, asDisabledSongs, s )
|
|
{
|
|
SongID sid;
|
|
sid.FromString( *s );
|
|
Song *pSong = sid.ToSong();
|
|
if( pSong )
|
|
pSong->SetEnabled( false );
|
|
}
|
|
}
|
|
|
|
void SongManager::GetStepsLoadedFromProfile( vector<Steps*> &AddTo, ProfileSlot slot ) const
|
|
{
|
|
const vector<Song*> &vSongs = GetAllSongs();
|
|
FOREACH_CONST( Song*, vSongs, song )
|
|
{
|
|
(*song)->GetStepsLoadedFromProfile( slot, AddTo );
|
|
}
|
|
}
|
|
|
|
Song *SongManager::GetSongFromSteps( Steps *pSteps ) const
|
|
{
|
|
ASSERT( pSteps );
|
|
const vector<Song*> &vSongs = GetAllSongs();
|
|
FOREACH_CONST( Song*, vSongs, song )
|
|
{
|
|
vector<Steps*> vSteps;
|
|
SongUtil::GetSteps( *song, vSteps );
|
|
|
|
FOREACH_CONST( Steps*, vSteps, steps )
|
|
{
|
|
if( *steps == pSteps )
|
|
{
|
|
return *song;
|
|
}
|
|
}
|
|
}
|
|
ASSERT(0);
|
|
return NULL;
|
|
}
|
|
|
|
void SongManager::DeleteSteps( Steps *pSteps )
|
|
{
|
|
Song *pSong = GetSongFromSteps( pSteps );
|
|
pSong->DeleteSteps( pSteps );
|
|
}
|
|
|
|
bool SongManager::WasLoadedFromAdditionalSongs( const Song *pSong ) const
|
|
{
|
|
RString sDir = pSong->GetSongDir();
|
|
return BeginsWith( sDir, ADDITIONAL_SONGS_DIR );
|
|
}
|
|
|
|
bool SongManager::WasLoadedFromAdditionalCourses( const Course *pCourse ) const
|
|
{
|
|
RString sDir = pCourse->m_sPath;
|
|
return BeginsWith( sDir, ADDITIONAL_COURSES_DIR );
|
|
}
|
|
|
|
void SongManager::GetAllCourses( vector<Course*> &AddTo, bool bIncludeAutogen ) const
|
|
{
|
|
for( unsigned i=0; i<m_pCourses.size(); i++ )
|
|
if( bIncludeAutogen || !m_pCourses[i]->m_bIsAutogen )
|
|
AddTo.push_back( m_pCourses[i] );
|
|
}
|
|
|
|
void SongManager::GetCourses( CourseType ct, vector<Course*> &AddTo, bool bIncludeAutogen ) const
|
|
{
|
|
for( unsigned i=0; i<m_pCourses.size(); i++ )
|
|
if( m_pCourses[i]->GetCourseType() == ct )
|
|
if( bIncludeAutogen || !m_pCourses[i]->m_bIsAutogen )
|
|
AddTo.push_back( m_pCourses[i] );
|
|
}
|
|
|
|
void SongManager::GetCoursesInGroup( vector<Course*> &AddTo, const RString &sCourseGroup, bool bIncludeAutogen ) const
|
|
{
|
|
for( unsigned i=0; i<m_pCourses.size(); i++ )
|
|
if( m_pCourses[i]->m_sGroupName == sCourseGroup )
|
|
if( bIncludeAutogen || !m_pCourses[i]->m_bIsAutogen )
|
|
AddTo.push_back( m_pCourses[i] );
|
|
}
|
|
|
|
bool SongManager::GetExtraStageInfoFromCourse( bool bExtra2, RString sPreferredGroup, Song*& pSongOut, Steps*& pStepsOut )
|
|
{
|
|
const RString sCourseSuffix = sPreferredGroup + (bExtra2 ? "/extra2.crs" : "/extra1.crs");
|
|
RString sCoursePath = SpecialFiles::SONGS_DIR + sCourseSuffix;
|
|
|
|
// Couldn't find course in DWI path or alternative song folders
|
|
if( !DoesFileExist(sCoursePath) )
|
|
{
|
|
sCoursePath = ADDITIONAL_SONGS_DIR + sCourseSuffix;
|
|
if( !DoesFileExist(sCoursePath) )
|
|
return false;
|
|
}
|
|
|
|
Course course;
|
|
CourseLoaderCRS::LoadFromCRSFile( sCoursePath, course );
|
|
if( course.GetEstimatedNumStages() <= 0 ) return false;
|
|
|
|
Trail *pTrail = course.GetTrail( GAMESTATE->GetCurrentStyle()->m_StepsType );
|
|
if( pTrail->m_vEntries.empty() )
|
|
return false;
|
|
|
|
pSongOut = pTrail->m_vEntries[0].pSong;
|
|
pStepsOut = pTrail->m_vEntries[0].pSteps;
|
|
return true;
|
|
}
|
|
|
|
// Return true if n1 < n2.
|
|
bool CompareNotesPointersForExtra(const Steps *n1, const Steps *n2)
|
|
{
|
|
// Equate CHALLENGE to HARD.
|
|
Difficulty d1 = min(n1->GetDifficulty(), Difficulty_Hard);
|
|
Difficulty d2 = min(n2->GetDifficulty(), Difficulty_Hard);
|
|
|
|
if(d1 < d2) return true;
|
|
if(d1 > d2) return false;
|
|
// n1 difficulty == n2 difficulty
|
|
|
|
if(StepsUtil::CompareNotesPointersByMeter(n1,n2)) return true;
|
|
if(StepsUtil::CompareNotesPointersByMeter(n2,n1)) return false;
|
|
// n1 meter == n2 meter
|
|
|
|
return StepsUtil::CompareNotesPointersByRadarValues(n1,n2);
|
|
}
|
|
|
|
void SongManager::GetExtraStageInfo( bool bExtra2, const Style *sd, Song*& pSongOut, Steps*& pStepsOut )
|
|
{
|
|
RString sGroup = GAMESTATE->m_sPreferredSongGroup;
|
|
if( sGroup == GROUP_ALL )
|
|
{
|
|
if( GAMESTATE->m_pCurSong == NULL )
|
|
{
|
|
// This normally shouldn't happen, but it's helpful to permit it for testing.
|
|
LOG->Warn( "GetExtraStageInfo() called in GROUP_ALL, but GAMESTATE->m_pCurSong == NULL" );
|
|
GAMESTATE->m_pCurSong.Set( GetRandomSong() );
|
|
}
|
|
sGroup = GAMESTATE->m_pCurSong->m_sGroupName;
|
|
}
|
|
|
|
ASSERT_M( sGroup != "", ssprintf("%p '%s' '%s'",
|
|
GAMESTATE->m_pCurSong.Get(),
|
|
GAMESTATE->m_pCurSong? GAMESTATE->m_pCurSong->GetSongDir().c_str():"",
|
|
GAMESTATE->m_pCurSong? GAMESTATE->m_pCurSong->m_sGroupName.c_str():"") );
|
|
|
|
// Check preferred group
|
|
if( GetExtraStageInfoFromCourse(bExtra2, sGroup, pSongOut, pStepsOut) )
|
|
return;
|
|
|
|
// Optionally, check the Songs folder for extra1/2.crs files.
|
|
if( GetExtraStageInfoFromCourse(bExtra2, "", pSongOut, pStepsOut) )
|
|
return;
|
|
|
|
// Choose a hard song for the extra stage
|
|
Song* pExtra1Song = NULL; // the absolute hardest Song and Steps. Use this for extra stage 1.
|
|
Steps* pExtra1Notes = NULL;
|
|
Song* pExtra2Song = NULL; // a medium-hard Song and Steps. Use this for extra stage 2.
|
|
Steps* pExtra2Notes = NULL;
|
|
|
|
const vector<Song*> &apSongs = GetSongs( sGroup );
|
|
for( unsigned s=0; s<apSongs.size(); s++ ) // foreach song
|
|
{
|
|
Song* pSong = apSongs[s];
|
|
|
|
vector<Steps*> apSteps;
|
|
SongUtil::GetSteps( pSong, apSteps, sd->m_StepsType );
|
|
for( unsigned n=0; n<apSteps.size(); n++ ) // foreach Steps
|
|
{
|
|
Steps* pSteps = apSteps[n];
|
|
|
|
if( pExtra1Notes == NULL || CompareNotesPointersForExtra(pExtra1Notes,pSteps) ) // pSteps is harder than pHardestNotes
|
|
{
|
|
pExtra1Song = pSong;
|
|
pExtra1Notes = pSteps;
|
|
}
|
|
|
|
// for extra 2, we don't want to choose the hardest notes possible. So, we'll disgard Steps with meter > 8 (assuming dance)
|
|
if( bExtra2 && pSteps->GetMeter() > EXTRA_STAGE2_DIFFICULTY_MAX )
|
|
continue; // skip
|
|
if( pExtra2Notes == NULL || CompareNotesPointersForExtra(pExtra2Notes,pSteps) ) // pSteps is harder than pHardestNotes
|
|
{
|
|
pExtra2Song = pSong;
|
|
pExtra2Notes = pSteps;
|
|
}
|
|
}
|
|
}
|
|
|
|
if( pExtra2Song == NULL && pExtra1Song != NULL )
|
|
{
|
|
pExtra2Song = pExtra1Song;
|
|
pExtra2Notes = pExtra1Notes;
|
|
}
|
|
|
|
// If there are any notes at all that match this StepsType, everything should be filled out.
|
|
// Also, it's guaranteed that there is at least one Steps that matches the StepsType because the player
|
|
// had to play something before reaching the extra stage!
|
|
ASSERT( pExtra2Song && pExtra1Song && pExtra2Notes && pExtra1Notes );
|
|
|
|
pSongOut = (bExtra2 ? pExtra2Song : pExtra1Song);
|
|
pStepsOut = (bExtra2 ? pExtra2Notes : pExtra1Notes);
|
|
}
|
|
|
|
Song* SongManager::GetRandomSong()
|
|
{
|
|
if( m_pShuffledSongs.empty() )
|
|
return NULL;
|
|
|
|
static int i = 0;
|
|
|
|
for( int iThrowAway=0; iThrowAway<100; iThrowAway++ )
|
|
{
|
|
i++;
|
|
wrap( i, m_pShuffledSongs.size() );
|
|
Song *pSong = m_pShuffledSongs[ i ];
|
|
if( pSong->IsTutorial() )
|
|
continue;
|
|
if( !pSong->NormallyDisplayed() )
|
|
continue;
|
|
return pSong;
|
|
}
|
|
|
|
return NULL;
|
|
}
|
|
|
|
Course* SongManager::GetRandomCourse()
|
|
{
|
|
if( m_pShuffledCourses.empty() )
|
|
return NULL;
|
|
|
|
static int i = 0;
|
|
|
|
for( int iThrowAway=0; iThrowAway<100; iThrowAway++ )
|
|
{
|
|
i++;
|
|
wrap( i, m_pShuffledCourses.size() );
|
|
Course *pCourse = m_pShuffledCourses[ i ];
|
|
if( pCourse->m_bIsAutogen && !PREFSMAN->m_bAutogenGroupCourses )
|
|
continue;
|
|
if( pCourse->GetCourseType() == COURSE_TYPE_ENDLESS )
|
|
continue;
|
|
if( UNLOCKMAN->CourseIsLocked(pCourse) )
|
|
continue;
|
|
return pCourse;
|
|
}
|
|
|
|
return NULL;
|
|
}
|
|
|
|
Song* SongManager::GetSongFromDir( RString sDir ) const
|
|
{
|
|
if( sDir.Right(1) != "/" )
|
|
sDir += "/";
|
|
|
|
sDir.Replace( '\\', '/' );
|
|
|
|
FOREACH_CONST( Song*, m_pSongs, s )
|
|
if( sDir.EqualsNoCase((*s)->GetSongDir()) )
|
|
return *s;
|
|
|
|
return NULL;
|
|
}
|
|
|
|
Course* SongManager::GetCourseFromPath( RString sPath ) const
|
|
{
|
|
if( sPath == "" )
|
|
return NULL;
|
|
|
|
FOREACH_CONST( Course*, m_pCourses, c )
|
|
{
|
|
if( sPath.CompareNoCase((*c)->m_sPath) == 0 )
|
|
return *c;
|
|
}
|
|
|
|
return NULL;
|
|
}
|
|
|
|
Course* SongManager::GetCourseFromName( RString sName ) const
|
|
{
|
|
if( sName == "" )
|
|
return NULL;
|
|
|
|
for( unsigned int i=0; i<m_pCourses.size(); i++ )
|
|
if( sName.CompareNoCase(m_pCourses[i]->GetDisplayFullTitle()) == 0 )
|
|
return m_pCourses[i];
|
|
|
|
return NULL;
|
|
}
|
|
|
|
|
|
/* GetSongDir() contains a path to the song, possibly a full path, eg:
|
|
* Songs\Group\SongName or
|
|
* My Other Song Folder\Group\SongName or
|
|
* c:\Corny J-pop\Group\SongName
|
|
*
|
|
* Most course group names are "Group\SongName", so we want to match against the
|
|
* last two elements. Let's also support "SongName" alone, since the group is
|
|
* only important when it's potentially ambiguous.
|
|
*
|
|
* Let's *not* support "Songs\Group\SongName" in course files. That's probably
|
|
* a common error, but that would result in course files floating around that
|
|
* only work for people who put songs in "Songs"; we don't want that. */
|
|
|
|
Song *SongManager::FindSong( RString sPath ) const
|
|
{
|
|
sPath.Replace( '\\', '/' );
|
|
vector<RString> bits;
|
|
split( sPath, "/", bits );
|
|
|
|
if( bits.size() == 1 )
|
|
return FindSong( "", bits[0] );
|
|
else if( bits.size() == 2 )
|
|
return FindSong( bits[0], bits[1] );
|
|
|
|
return NULL;
|
|
}
|
|
|
|
Song *SongManager::FindSong( RString sGroup, RString sSong ) const
|
|
{
|
|
// foreach song
|
|
const vector<Song *> &vSongs = GetSongs( sGroup.empty()? GROUP_ALL:sGroup );
|
|
FOREACH_CONST( Song*, vSongs, s )
|
|
{
|
|
if( (*s)->Matches(sGroup, sSong) )
|
|
return *s;
|
|
}
|
|
|
|
return NULL;
|
|
}
|
|
|
|
Course *SongManager::FindCourse( RString sPath ) const
|
|
{
|
|
sPath.Replace( '\\', '/' );
|
|
vector<RString> bits;
|
|
split( sPath, "/", bits );
|
|
|
|
if( bits.size() == 1 )
|
|
return FindCourse( "", bits[0] );
|
|
else if( bits.size() == 2 )
|
|
return FindCourse( bits[0], bits[1] );
|
|
|
|
return NULL;
|
|
}
|
|
|
|
Course *SongManager::FindCourse( RString sGroup, RString sName ) const
|
|
{
|
|
FOREACH_CONST( Course*, m_pCourses, c )
|
|
{
|
|
if( (*c)->Matches(sGroup, sName) )
|
|
return *c;
|
|
}
|
|
|
|
return NULL;
|
|
}
|
|
|
|
void SongManager::UpdatePopular()
|
|
{
|
|
// update players best
|
|
vector<Song*> apBestSongs = m_pSongs;
|
|
for ( unsigned j=0; j < apBestSongs.size() ; ++j )
|
|
{
|
|
bool bFiltered = false;
|
|
// Filter out locked songs.
|
|
if( !apBestSongs[j]->NormallyDisplayed() )
|
|
bFiltered = true;
|
|
if( !bFiltered )
|
|
continue;
|
|
|
|
// Remove it.
|
|
swap( apBestSongs[j], apBestSongs.back() );
|
|
apBestSongs.erase( apBestSongs.end()-1 );
|
|
--j;
|
|
}
|
|
|
|
SongUtil::SortSongPointerArrayByTitle( apBestSongs );
|
|
|
|
vector<Course*> apBestCourses[NUM_CourseType];
|
|
FOREACH_ENUM( CourseType, ct )
|
|
{
|
|
GetCourses( ct, apBestCourses[ct], PREFSMAN->m_bAutogenGroupCourses );
|
|
CourseUtil::SortCoursePointerArrayByTitle( apBestCourses[ct] );
|
|
}
|
|
|
|
m_pPopularSongs = apBestSongs;
|
|
SongUtil::SortSongPointerArrayByNumPlays( m_pPopularSongs, ProfileSlot_Machine, true );
|
|
|
|
FOREACH_CourseType( ct )
|
|
{
|
|
vector<Course*> &vpCourses = m_pPopularCourses[ct];
|
|
vpCourses = apBestCourses[ct];
|
|
CourseUtil::SortCoursePointerArrayByNumPlays( vpCourses, ProfileSlot_Machine, true );
|
|
}
|
|
}
|
|
|
|
void SongManager::UpdateShuffled()
|
|
{
|
|
// update shuffled
|
|
m_pShuffledSongs = m_pSongs;
|
|
random_shuffle( m_pShuffledSongs.begin(), m_pShuffledSongs.end(), g_RandomNumberGenerator );
|
|
|
|
m_pShuffledCourses = m_pCourses;
|
|
random_shuffle( m_pShuffledCourses.begin(), m_pShuffledCourses.end(), g_RandomNumberGenerator );
|
|
}
|
|
|
|
void SongManager::UpdatePreferredSort(RString sPreferredSongs, RString sPreferredCourses)
|
|
{
|
|
ASSERT( UNLOCKMAN );
|
|
|
|
{
|
|
m_vPreferredSongSort.clear();
|
|
|
|
vector<RString> asLines;
|
|
RString sFile = THEME->GetPathO( "SongManager", sPreferredSongs );
|
|
GetFileContents( sFile, asLines );
|
|
if( asLines.empty() )
|
|
return;
|
|
|
|
PreferredSortSection section;
|
|
map<Song *, float> mapSongToPri;
|
|
|
|
FOREACH( RString, asLines, s )
|
|
{
|
|
RString sLine = *s;
|
|
|
|
bool bSectionDivider = BeginsWith(sLine, "---");
|
|
if( bSectionDivider )
|
|
{
|
|
if( !section.vpSongs.empty() )
|
|
{
|
|
m_vPreferredSongSort.push_back( section );
|
|
section = PreferredSortSection();
|
|
}
|
|
|
|
section.sName = sLine.Right( sLine.length() - RString("---").length() );
|
|
TrimLeft( section.sName );
|
|
TrimRight( section.sName );
|
|
}
|
|
else
|
|
{
|
|
Song *pSong = FindSong( sLine );
|
|
if( pSong == NULL )
|
|
continue;
|
|
if( UNLOCKMAN->SongIsLocked(pSong) & LOCKED_SELECTABLE )
|
|
continue;
|
|
section.vpSongs.push_back( pSong );
|
|
}
|
|
}
|
|
|
|
if( !section.vpSongs.empty() )
|
|
{
|
|
m_vPreferredSongSort.push_back( section );
|
|
section = PreferredSortSection();
|
|
}
|
|
|
|
if( MOVE_UNLOCKS_TO_BOTTOM_OF_PREFERRED_SORT.GetValue() )
|
|
{
|
|
// move all unlock songs to a group at the bottom
|
|
PreferredSortSection PFSection;
|
|
PFSection.sName = "Unlocks";
|
|
FOREACH( UnlockEntry, UNLOCKMAN->m_UnlockEntries, ue )
|
|
{
|
|
if( ue->m_Type == UnlockRewardType_Song )
|
|
{
|
|
Song *pSong = ue->m_Song.ToSong();
|
|
if( pSong )
|
|
PFSection.vpSongs.push_back( pSong );
|
|
}
|
|
}
|
|
|
|
FOREACH( PreferredSortSection, m_vPreferredSongSort, v )
|
|
{
|
|
for( int i=v->vpSongs.size()-1; i>=0; i-- )
|
|
{
|
|
Song *pSong = v->vpSongs[i];
|
|
if( find(PFSection.vpSongs.begin(),PFSection.vpSongs.end(),pSong) != PFSection.vpSongs.end() )
|
|
{
|
|
v->vpSongs.erase( v->vpSongs.begin()+i );
|
|
}
|
|
}
|
|
}
|
|
|
|
m_vPreferredSongSort.push_back( PFSection );
|
|
}
|
|
|
|
// prune empty groups
|
|
for( int i=m_vPreferredSongSort.size()-1; i>=0; i-- )
|
|
if( m_vPreferredSongSort[i].vpSongs.empty() )
|
|
m_vPreferredSongSort.erase( m_vPreferredSongSort.begin()+i );
|
|
|
|
FOREACH( PreferredSortSection, m_vPreferredSongSort, i )
|
|
FOREACH( Song*, i->vpSongs, j )
|
|
ASSERT( *j );
|
|
}
|
|
|
|
{
|
|
m_vPreferredCourseSort.clear();
|
|
|
|
vector<RString> asLines;
|
|
RString sFile = THEME->GetPathO( "SongManager", sPreferredCourses );
|
|
if( !GetFileContents(sFile, asLines) )
|
|
return;
|
|
|
|
vector<Course*> vpCourses;
|
|
|
|
FOREACH( RString, asLines, s )
|
|
{
|
|
RString sLine = *s;
|
|
bool bSectionDivider = BeginsWith( sLine, "---" );
|
|
if( bSectionDivider )
|
|
{
|
|
if( !vpCourses.empty() )
|
|
{
|
|
m_vPreferredCourseSort.push_back( vpCourses );
|
|
vpCourses.clear();
|
|
}
|
|
continue;
|
|
}
|
|
|
|
Course *pCourse = FindCourse( sLine );
|
|
if( pCourse == NULL )
|
|
continue;
|
|
if( UNLOCKMAN->CourseIsLocked(pCourse) & LOCKED_SELECTABLE )
|
|
continue;
|
|
vpCourses.push_back( pCourse );
|
|
}
|
|
|
|
if( !vpCourses.empty() )
|
|
{
|
|
m_vPreferredCourseSort.push_back( vpCourses );
|
|
vpCourses.clear();
|
|
}
|
|
|
|
if( MOVE_UNLOCKS_TO_BOTTOM_OF_PREFERRED_SORT.GetValue() )
|
|
{
|
|
// move all unlock Courses to a group at the bottom
|
|
vector<Course*> vpUnlockCourses;
|
|
FOREACH( UnlockEntry, UNLOCKMAN->m_UnlockEntries, ue )
|
|
{
|
|
if( ue->m_Type == UnlockRewardType_Course )
|
|
if( ue->m_Course.IsValid() )
|
|
vpUnlockCourses.push_back( ue->m_Course.ToCourse() );
|
|
}
|
|
|
|
FOREACH( CoursePointerVector, m_vPreferredCourseSort, v )
|
|
{
|
|
for( int i=v->size()-1; i>=0; i-- )
|
|
{
|
|
Course *pCourse = (*v)[i];
|
|
if( find(vpUnlockCourses.begin(),vpUnlockCourses.end(),pCourse) != vpUnlockCourses.end() )
|
|
{
|
|
v->erase( v->begin()+i );
|
|
}
|
|
}
|
|
}
|
|
|
|
m_vPreferredCourseSort.push_back( vpUnlockCourses );
|
|
}
|
|
|
|
// prune empty groups
|
|
for( int i=m_vPreferredCourseSort.size()-1; i>=0; i-- )
|
|
if( m_vPreferredCourseSort[i].empty() )
|
|
m_vPreferredCourseSort.erase( m_vPreferredCourseSort.begin()+i );
|
|
|
|
FOREACH( CoursePointerVector, m_vPreferredCourseSort, i )
|
|
FOREACH( Course*, *i, j )
|
|
ASSERT( *j );
|
|
}
|
|
}
|
|
|
|
void SongManager::SortSongs()
|
|
{
|
|
SongUtil::SortSongPointerArrayByTitle( m_pSongs );
|
|
}
|
|
|
|
void SongManager::UpdateRankingCourses()
|
|
{
|
|
/* Updating the ranking courses data is fairly expensive since it involves
|
|
* comparing strings. Do so sparingly. */
|
|
vector<RString> RankingCourses;
|
|
split( THEME->GetMetric("ScreenRanking","CoursesToShow"),",", RankingCourses);
|
|
|
|
FOREACH( Course*, m_pCourses, c )
|
|
{
|
|
bool bLotsOfStages = (*c)->GetEstimatedNumStages() > 7;
|
|
(*c)->m_SortOrder_Ranking = bLotsOfStages? 3 : 2;
|
|
|
|
for( unsigned j = 0; j < RankingCourses.size(); j++ )
|
|
if( !RankingCourses[j].CompareNoCase((*c)->m_sPath) )
|
|
(*c)->m_SortOrder_Ranking = 1;
|
|
}
|
|
}
|
|
|
|
void SongManager::RefreshCourseGroupInfo()
|
|
{
|
|
m_mapCourseGroupToInfo.clear();
|
|
|
|
FOREACH_CONST( Course*, m_pCourses, c )
|
|
{
|
|
m_mapCourseGroupToInfo[(*c)->m_sGroupName]; // insert
|
|
}
|
|
|
|
// TODO: Search for course group banners
|
|
FOREACHM( RString, CourseGroupInfo, m_mapCourseGroupToInfo, iter )
|
|
{
|
|
}
|
|
}
|
|
|
|
void SongManager::LoadStepEditsFromProfileDir( const RString &sProfileDir, ProfileSlot slot )
|
|
{
|
|
{
|
|
// Load all edit steps
|
|
RString sDir = sProfileDir + EDIT_STEPS_SUBDIR;
|
|
|
|
vector<RString> vsFiles;
|
|
GetDirListing( sDir+"*.edit", vsFiles, false, true );
|
|
|
|
int iNumEditsLoaded = GetNumEditsLoadedFromProfile( slot );
|
|
int size = min( (int) vsFiles.size(), MAX_EDIT_STEPS_PER_PROFILE - iNumEditsLoaded );
|
|
|
|
for( int i=0; i<size; i++ )
|
|
{
|
|
RString fn = vsFiles[i];
|
|
|
|
bool bLoadedFromSSC = SSCLoader::LoadEditFromFile( fn, slot, true );
|
|
// If we don't load the edit from a .ssc-style .edit, then we should
|
|
// also try the .sm-style edit file. -aj
|
|
if( !bLoadedFromSSC )
|
|
SMLoader::LoadEditFromFile( fn, slot, true );
|
|
}
|
|
}
|
|
}
|
|
|
|
void SongManager::LoadCourseEditsFromProfileDir( const RString &sProfileDir, ProfileSlot slot )
|
|
{
|
|
{
|
|
// Load all edit courses
|
|
RString sDir = sProfileDir + EDIT_COURSES_SUBDIR;
|
|
|
|
vector<RString> vsFiles;
|
|
GetDirListing( sDir+"*.crs", vsFiles, false, true );
|
|
|
|
int iNumEditsLoaded = GetNumEditsLoadedFromProfile( slot );
|
|
int size = min( (int) vsFiles.size(), MAX_EDIT_COURSES_PER_PROFILE - iNumEditsLoaded );
|
|
|
|
for( int i=0; i<size; i++ )
|
|
{
|
|
RString fn = vsFiles[i];
|
|
|
|
CourseLoaderCRS::LoadEditFromFile( fn, slot );
|
|
}
|
|
}
|
|
}
|
|
|
|
int SongManager::GetNumEditsLoadedFromProfile( ProfileSlot slot ) const
|
|
{
|
|
int iCount = 0;
|
|
for( unsigned s=0; s<m_pSongs.size(); s++ )
|
|
{
|
|
const Song *pSong = m_pSongs[s];
|
|
vector<Steps*> apSteps;
|
|
SongUtil::GetSteps( pSong, apSteps );
|
|
|
|
for( unsigned i = 0; i < apSteps.size(); ++i )
|
|
{
|
|
const Steps *pSteps = apSteps[i];
|
|
if( pSteps->WasLoadedFromProfile() && pSteps->GetLoadedFromProfileSlot() == slot )
|
|
++iCount;
|
|
}
|
|
}
|
|
return iCount;
|
|
}
|
|
|
|
void SongManager::FreeAllLoadedFromProfile( ProfileSlot slot )
|
|
{
|
|
// Profile courses may refer to profile steps, so free profile courses first.
|
|
vector<Course*> apToDelete;
|
|
FOREACH( Course*, m_pCourses, c )
|
|
{
|
|
Course *pCourse = *c;
|
|
if( pCourse->GetLoadedFromProfileSlot() == ProfileSlot_Invalid )
|
|
continue;
|
|
|
|
if( slot == ProfileSlot_Invalid || pCourse->GetLoadedFromProfileSlot() == slot )
|
|
apToDelete.push_back( *c );
|
|
}
|
|
|
|
/* We don't use DeleteCourse here, so we don't UpdatePopular and
|
|
* UpdateShuffled repeatedly. */
|
|
for( unsigned i = 0; i < apToDelete.size(); ++i )
|
|
{
|
|
vector<Course*>::iterator iter = find( m_pCourses.begin(), m_pCourses.end(), apToDelete[i] );
|
|
ASSERT( iter != m_pCourses.end() );
|
|
m_pCourses.erase( iter );
|
|
delete apToDelete[i];
|
|
}
|
|
|
|
// Popular and Shuffled may refer to courses that we just freed.
|
|
UpdatePopular();
|
|
UpdateShuffled();
|
|
RefreshCourseGroupInfo();
|
|
|
|
// Free profile steps.
|
|
set<Steps*> setInUse;
|
|
if( STATSMAN )
|
|
STATSMAN->GetStepsInUse( setInUse );
|
|
FOREACH( Song*, m_pSongs, s )
|
|
(*s)->FreeAllLoadedFromProfile( slot, &setInUse );
|
|
}
|
|
|
|
int SongManager::GetNumStepsLoadedFromProfile()
|
|
{
|
|
int iCount = 0;
|
|
FOREACH( Song*, m_pSongs, s )
|
|
{
|
|
vector<Steps*> vpAllSteps = (*s)->GetAllSteps();
|
|
|
|
FOREACH( Steps*, vpAllSteps, ss )
|
|
{
|
|
if( (*ss)->GetLoadedFromProfileSlot() != ProfileSlot_Invalid )
|
|
iCount++;
|
|
}
|
|
}
|
|
|
|
return iCount;
|
|
}
|
|
|
|
template<class T>
|
|
int FindCourseIndexOfSameMode( T begin, T end, const Course *p )
|
|
{
|
|
const PlayMode pm = p->GetPlayMode();
|
|
|
|
int n = 0;
|
|
for( T it = begin; it != end; ++it )
|
|
{
|
|
if( *it == p )
|
|
return n;
|
|
|
|
/* If it's not playable in this mode, don't increment. It might result in
|
|
* different output in different modes, but that's better than having holes. */
|
|
if( !(*it)->IsPlayableIn( GAMESTATE->GetCurrentStyle()->m_StepsType ) )
|
|
continue;
|
|
if( (*it)->GetPlayMode() != pm )
|
|
continue;
|
|
++n;
|
|
}
|
|
|
|
return -1;
|
|
}
|
|
|
|
int SongManager::GetSongRank(Song* pSong)
|
|
{
|
|
const int index = FindIndex( m_pPopularSongs.begin(), m_pPopularSongs.end(), pSong );
|
|
return index; // -1 means we didn't find it
|
|
}
|
|
|
|
// lua start
|
|
#include "LuaBinding.h"
|
|
|
|
/** @brief Allow Lua to have access to the SongManager. */
|
|
class LunaSongManager: public Luna<SongManager>
|
|
{
|
|
public:
|
|
static int SetPreferredSongs( T* p, lua_State *L )
|
|
{
|
|
p->UpdatePreferredSort( SArg(1), "PreferredCourses.txt" );
|
|
return 0;
|
|
}
|
|
|
|
static int SetPreferredCourses( T* p, lua_State *L )
|
|
{
|
|
p->UpdatePreferredSort( "PreferredSongs.txt", SArg(1) );
|
|
return 0;
|
|
}
|
|
static int GetAllSongs( T* p, lua_State *L )
|
|
{
|
|
const vector<Song*> &v = p->GetAllSongs();
|
|
LuaHelpers::CreateTableFromArray<Song*>( v, L );
|
|
return 1;
|
|
}
|
|
static int GetAllCourses( T* p, lua_State *L )
|
|
{
|
|
vector<Course*> v;
|
|
p->GetAllCourses( v, BArg(1) );
|
|
LuaHelpers::CreateTableFromArray<Course*>( v, L );
|
|
return 1;
|
|
}
|
|
static int FindSong( T* p, lua_State *L ) { Song *pS = p->FindSong(SArg(1)); if(pS) pS->PushSelf(L); else lua_pushnil(L); return 1; }
|
|
static int FindCourse( T* p, lua_State *L ) { Course *pC = p->FindCourse(SArg(1)); if(pC) pC->PushSelf(L); else lua_pushnil(L); return 1; }
|
|
static int GetRandomSong( T* p, lua_State *L ) { Song *pS = p->GetRandomSong(); if(pS) pS->PushSelf(L); else lua_pushnil(L); return 1; }
|
|
static int GetRandomCourse( T* p, lua_State *L ) { Course *pC = p->GetRandomCourse(); if(pC) pC->PushSelf(L); else lua_pushnil(L); return 1; }
|
|
static int GetNumSongs( T* p, lua_State *L ) { lua_pushnumber( L, p->GetNumSongs() ); return 1; }
|
|
static int GetNumUnlockedSongs( T* p, lua_State *L ) { lua_pushnumber( L, p->GetNumUnlockedSongs() ); return 1; }
|
|
static int GetNumSelectableAndUnlockedSongs( T* p, lua_State *L ) { lua_pushnumber( L, p->GetNumSelectableAndUnlockedSongs() ); return 1; }
|
|
static int GetNumAdditionalSongs( T* p, lua_State *L ) { lua_pushnumber( L, p->GetNumAdditionalSongs() ); return 1; }
|
|
static int GetNumSongGroups( T* p, lua_State *L ) { lua_pushnumber( L, p->GetNumSongGroups() ); return 1; }
|
|
static int GetNumCourses( T* p, lua_State *L ) { lua_pushnumber( L, p->GetNumCourses() ); return 1; }
|
|
static int GetNumAdditionalCourses( T* p, lua_State *L ){ lua_pushnumber( L, p->GetNumAdditionalCourses() ); return 1; }
|
|
static int GetNumCourseGroups( T* p, lua_State *L ) { lua_pushnumber( L, p->GetNumCourseGroups() ); return 1; }
|
|
static int GetSongFromSteps( T* p, lua_State *L )
|
|
{
|
|
Song *pSong = NULL;
|
|
if( lua_isnil(L,1) ) { pSong = p->GetSongFromSteps( NULL ); }
|
|
else { Steps *pSteps = Luna<Steps>::check(L,1); pSong = p->GetSongFromSteps( pSteps ); }
|
|
if(pSong) pSong->PushSelf(L);
|
|
else lua_pushnil(L);
|
|
return 1;
|
|
}
|
|
|
|
static int GetExtraStageInfo( T* p, lua_State *L )
|
|
{
|
|
bool bExtra2 = BArg( 1 );
|
|
const Style *pStyle = Luna<Style>::check( L, 2 );
|
|
Song *pSong;
|
|
Steps *pSteps;
|
|
|
|
p->GetExtraStageInfo( bExtra2, pStyle, pSong, pSteps );
|
|
pSong->PushSelf( L );
|
|
pSteps->PushSelf( L );
|
|
|
|
return 2;
|
|
}
|
|
DEFINE_METHOD( GetSongColor, GetSongColor( Luna<Song>::check(L,1) ) )
|
|
DEFINE_METHOD( GetSongGroupColor, GetSongGroupColor( SArg(1) ) )
|
|
DEFINE_METHOD( GetCourseColor, GetCourseColor( Luna<Course>::check(L,1) ) )
|
|
|
|
static int GetSongRank( T* p, lua_State *L )
|
|
{
|
|
Song *pSong = Luna<Song>::check(L,1);
|
|
int index = p->GetSongRank(pSong);
|
|
if( index != -1 )
|
|
lua_pushnumber(L, index+1);
|
|
else
|
|
lua_pushnil(L);
|
|
return 1;
|
|
}
|
|
/*
|
|
static int GetSongRankFromProfile( T* p, lua_State *L )
|
|
{
|
|
// it's like the above but also takes in a ProfileSlot as well.
|
|
}
|
|
*/
|
|
|
|
static int GetSongGroupNames( T* p, lua_State *L )
|
|
{
|
|
vector<RString> v;
|
|
p->GetSongGroupNames( v );
|
|
LuaHelpers::CreateTableFromArray<RString>( v, L );
|
|
return 1;
|
|
}
|
|
|
|
static int GetSongsInGroup( T* p, lua_State *L )
|
|
{
|
|
vector<Song*> v = p->GetSongs(SArg(1));
|
|
LuaHelpers::CreateTableFromArray<Song*>( v, L );
|
|
return 1;
|
|
}
|
|
|
|
DEFINE_METHOD( ShortenGroupName, ShortenGroupName( SArg(1) ) )
|
|
|
|
LunaSongManager()
|
|
{
|
|
ADD_METHOD( GetAllSongs );
|
|
ADD_METHOD( GetAllCourses );
|
|
ADD_METHOD( FindSong );
|
|
ADD_METHOD( FindCourse );
|
|
ADD_METHOD( GetRandomSong );
|
|
ADD_METHOD( GetRandomCourse );
|
|
ADD_METHOD( GetNumSongs );
|
|
ADD_METHOD( GetNumUnlockedSongs );
|
|
ADD_METHOD( GetNumSelectableAndUnlockedSongs );
|
|
ADD_METHOD( GetNumAdditionalSongs );
|
|
ADD_METHOD( GetNumSongGroups );
|
|
ADD_METHOD( GetNumCourses );
|
|
ADD_METHOD( GetNumAdditionalCourses );
|
|
ADD_METHOD( GetNumCourseGroups );
|
|
ADD_METHOD( GetSongFromSteps );
|
|
ADD_METHOD( GetExtraStageInfo );
|
|
ADD_METHOD( GetSongColor );
|
|
ADD_METHOD( GetSongGroupColor );
|
|
ADD_METHOD( GetCourseColor );
|
|
ADD_METHOD( GetSongRank );
|
|
ADD_METHOD( GetSongGroupNames );
|
|
ADD_METHOD( GetSongsInGroup );
|
|
ADD_METHOD( ShortenGroupName );
|
|
ADD_METHOD( SetPreferredSongs );
|
|
ADD_METHOD( SetPreferredCourses );
|
|
}
|
|
};
|
|
|
|
LUA_REGISTER_CLASS( SongManager )
|
|
// lua end
|
|
|
|
/*
|
|
* (c) 2001-2004 Chris Danford, Glenn Maynard
|
|
* All rights reserved.
|
|
*
|
|
* Permission is hereby granted, free of charge, to any person obtaining a
|
|
* copy of this software and associated documentation files (the
|
|
* "Software"), to deal in the Software without restriction, including
|
|
* without limitation the rights to use, copy, modify, merge, publish,
|
|
* distribute, and/or sell copies of the Software, and to permit persons to
|
|
* whom the Software is furnished to do so, provided that the above
|
|
* copyright notice(s) and this permission notice appear in all copies of
|
|
* the Software and that both the above copyright notice(s) and this
|
|
* permission notice appear in supporting documentation.
|
|
*
|
|
* THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS
|
|
* OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
|
|
* MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT OF
|
|
* THIRD PARTY RIGHTS. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR HOLDERS
|
|
* INCLUDED IN THIS NOTICE BE LIABLE FOR ANY CLAIM, OR ANY SPECIAL INDIRECT
|
|
* OR CONSEQUENTIAL DAMAGES, OR ANY DAMAGES WHATSOEVER RESULTING FROM LOSS
|
|
* OF USE, DATA OR PROFITS, WHETHER IN AN ACTION OF CONTRACT, NEGLIGENCE OR
|
|
* OTHER TORTIOUS ACTION, ARISING OUT OF OR IN CONNECTION WITH THE USE OR
|
|
* PERFORMANCE OF THIS SOFTWARE.
|
|
*/
|