smsvn -> ssc-hg glue: rearrange directory structure
This commit is contained in:
+129
@@ -0,0 +1,129 @@
|
||||
#ifndef MODS_GROUP_H
|
||||
#define MODS_GROUP_H
|
||||
|
||||
#include "EnumHelper.h"
|
||||
#include "RageTimer.h"
|
||||
|
||||
enum ModsLevel
|
||||
{
|
||||
ModsLevel_Preferred, // user-chosen player options. Does not include any forced mods.
|
||||
ModsLevel_Stage, // Preferred + forced stage mods
|
||||
ModsLevel_Song, // Stage + forced attack mods
|
||||
NUM_ModsLevel,
|
||||
ModsLevel_Invalid
|
||||
};
|
||||
LuaDeclareType( ModsLevel );
|
||||
|
||||
#define MODS_GROUP_ASSIGN( group, level, member, val ) (group).Assign( (level), member, (val) )
|
||||
#define MODS_GROUP_ASSIGN_N( group, level, member, n, val ) (group).Assign_n( (level), member, (n), (val) )
|
||||
#define MODS_GROUP_CALL( group, level, fun ) (group).Call( (level), fun )
|
||||
|
||||
#define PO_GROUP_ASSIGN( group, level, member, val ) MODS_GROUP_ASSIGN( (group), (level), &PlayerOptions::member, (val) )
|
||||
#define PO_GROUP_ASSIGN_N( group, level, member, n, val ) MODS_GROUP_ASSIGN_N( (group), (level), &PlayerOptions::member, (n), (val) )
|
||||
#define PO_GROUP_CALL( group, level, fun ) MODS_GROUP_CALL( (group), (level), &PlayerOptions::fun )
|
||||
#define SO_GROUP_ASSIGN( group, level, member, val ) MODS_GROUP_ASSIGN( (group), (level), &SongOptions::member, (val) )
|
||||
#define SO_GROUP_ASSIGN_N( group, level, member, n, val ) MODS_GROUP_ASSIGN_N( (group), (level), &SongOptions::member, (n), (val) )
|
||||
#define SO_GROUP_CALL( group, level, fun ) MODS_GROUP_CALL( (group), (level), &SongOptions::fun )
|
||||
|
||||
template<class T>
|
||||
class ModsGroup
|
||||
{
|
||||
T m_[NUM_ModsLevel];
|
||||
RageTimer m_Timer;
|
||||
T m_Current; // approaches ModsLevel_Song
|
||||
|
||||
public:
|
||||
void Init()
|
||||
{
|
||||
Call( ModsLevel_Preferred, &T::Init );
|
||||
}
|
||||
|
||||
void Update( float fDelta )
|
||||
{
|
||||
// Don't let the mod approach speed be affected by Tab.
|
||||
// TODO: Find a more elegant way of handling this.
|
||||
fDelta = m_Timer.GetDeltaTime();
|
||||
m_Current.Approach( m_[ModsLevel_Song], fDelta );
|
||||
}
|
||||
|
||||
template<typename U>
|
||||
inline void Assign( ModsLevel level, U T::*member, const U &val )
|
||||
{
|
||||
if( level != ModsLevel_Song )
|
||||
m_Current.*member = val;
|
||||
for( ; level < NUM_ModsLevel; enum_add(level, 1) )
|
||||
m_[level].*member = val;
|
||||
}
|
||||
|
||||
template<typename U, int n>
|
||||
inline void Assign_n( ModsLevel level, U (T::*member)[n], size_t index, const U &val )
|
||||
{
|
||||
DEBUG_ASSERT( index < n );
|
||||
if( level != ModsLevel_Song )
|
||||
(m_Current.*member)[index] = val;
|
||||
for( ; level < NUM_ModsLevel; enum_add(level, 1) )
|
||||
(m_[level].*member)[index] = val;
|
||||
}
|
||||
|
||||
void Assign( ModsLevel level, const T &val )
|
||||
{
|
||||
if( level != ModsLevel_Song )
|
||||
m_Current = val;
|
||||
for( ; level < NUM_ModsLevel; enum_add(level, 1) )
|
||||
m_[level] = val;
|
||||
}
|
||||
|
||||
void Call( ModsLevel level, void (T::*fun)() )
|
||||
{
|
||||
if( level != ModsLevel_Song )
|
||||
(m_Current.*fun)();
|
||||
for( ; level < NUM_ModsLevel; enum_add(level, 1) )
|
||||
(m_[level].*fun)();
|
||||
}
|
||||
|
||||
void FromString( ModsLevel level, const RString &str )
|
||||
{
|
||||
if( level != ModsLevel_Song )
|
||||
m_Current.FromString( str );
|
||||
for( ; level < NUM_ModsLevel; enum_add(level, 1) )
|
||||
m_[level].FromString( str );
|
||||
}
|
||||
|
||||
void SetCurrentToLevel( ModsLevel level )
|
||||
{
|
||||
m_Current = m_[level];
|
||||
}
|
||||
|
||||
const T &Get( ModsLevel l ) const { return m_[l]; }
|
||||
const T &GetPreferred() const { return m_[ModsLevel_Preferred]; }
|
||||
const T &GetStage() const { return m_[ModsLevel_Stage]; }
|
||||
const T &GetSong() const { return m_[ModsLevel_Song]; }
|
||||
const T &GetCurrent() const { return m_Current; }
|
||||
};
|
||||
|
||||
#endif
|
||||
|
||||
/*
|
||||
* (c) 2006 Chris Danford, Steve Checkoway
|
||||
* 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.
|
||||
*/
|
||||
Reference in New Issue
Block a user