Lamar Cooleyandteejusb
f62938787a
Grant users the ability to change the maximum amount of credits available rather than the constant cap at 20. (cherry picked from commit 2ec2355d7a7d9fec9410cf6b7d2b5c31a4406074) (cherry picked from commit 48245ab51600ede16096e70e27c94345918eaed7)
289 lines
7.0 KiB
C++
289 lines
7.0 KiB
C++
#include "global.h"
|
|
#include "Bookkeeper.h"
|
|
#include "RageUtil.h"
|
|
#include "RageLog.h"
|
|
#include "IniFile.h"
|
|
#include "GameConstantsAndTypes.h"
|
|
#include "GameState.h"
|
|
#include "SongManager.h"
|
|
#include "RageFile.h"
|
|
#include "XmlFile.h"
|
|
#include "XmlFileUtil.h"
|
|
#include "SpecialFiles.h"
|
|
#include <ctime>
|
|
|
|
Bookkeeper* BOOKKEEPER = nullptr; // global and accessible from anywhere in our program
|
|
|
|
static const RString COINS_DAT = "Save/Coins.xml";
|
|
|
|
Bookkeeper::Bookkeeper()
|
|
{
|
|
ClearAll();
|
|
ReadFromDisk();
|
|
}
|
|
|
|
Bookkeeper::~Bookkeeper()
|
|
{
|
|
WriteToDisk();
|
|
}
|
|
|
|
#define WARN_AND_RETURN { LOG->Warn("Error parsing at %s:%d",__FILE__,__LINE__); return; }
|
|
|
|
void Bookkeeper::ClearAll()
|
|
{
|
|
m_mapCoinsForHour.clear();
|
|
}
|
|
|
|
bool Bookkeeper::Date::operator<( const Date &rhs ) const
|
|
{
|
|
if( m_iYear != rhs.m_iYear )
|
|
return m_iYear < rhs.m_iYear;
|
|
if( m_iDayOfYear != rhs.m_iDayOfYear )
|
|
return m_iDayOfYear < rhs.m_iDayOfYear;
|
|
return m_iHour < rhs.m_iHour;
|
|
}
|
|
|
|
void Bookkeeper::Date::Set( time_t t )
|
|
{
|
|
tm ltime;
|
|
localtime_r( &t, <ime );
|
|
|
|
Set( ltime );
|
|
}
|
|
|
|
void Bookkeeper::Date::Set( tm pTime )
|
|
{
|
|
m_iHour = pTime.tm_hour;
|
|
m_iDayOfYear = pTime.tm_yday;
|
|
m_iYear = pTime.tm_year + 1900;
|
|
}
|
|
|
|
void Bookkeeper::LoadFromNode( const XNode *pNode )
|
|
{
|
|
if( pNode->GetName() != "Bookkeeping" )
|
|
{
|
|
LOG->Warn( "Error loading bookkeeping: unexpected \"%s\"", pNode->GetName().c_str() );
|
|
return;
|
|
}
|
|
|
|
const XNode *pData = pNode->GetChild( "Data" );
|
|
if( pData == nullptr )
|
|
{
|
|
LOG->Warn( "Error loading bookkeeping: Data node missing" );
|
|
return;
|
|
}
|
|
|
|
FOREACH_CONST_Child( pData, day )
|
|
{
|
|
Date d;
|
|
if( !day->GetAttrValue( "Hour", d.m_iHour ) ||
|
|
!day->GetAttrValue( "Day", d.m_iDayOfYear ) ||
|
|
!day->GetAttrValue( "Year", d.m_iYear ) )
|
|
{
|
|
LOG->Warn( "Incomplete date field" );
|
|
continue;
|
|
}
|
|
|
|
int iCoins;
|
|
day->GetTextValue( iCoins );
|
|
|
|
m_mapCoinsForHour[d] = iCoins;
|
|
}
|
|
}
|
|
|
|
XNode* Bookkeeper::CreateNode() const
|
|
{
|
|
XNode *xml = new XNode( "Bookkeeping" );
|
|
|
|
{
|
|
XNode* pData = xml->AppendChild("Data");
|
|
|
|
for( std::map<Date,int>::const_iterator it = m_mapCoinsForHour.begin(); it != m_mapCoinsForHour.end(); ++it )
|
|
{
|
|
int iCoins = it->second;
|
|
XNode *pDay = pData->AppendChild( "Coins", iCoins );
|
|
|
|
const Date &d = it->first;
|
|
pDay->AppendAttr( "Hour", d.m_iHour );
|
|
pDay->AppendAttr( "Day", d.m_iDayOfYear );
|
|
pDay->AppendAttr( "Year", d.m_iYear );
|
|
}
|
|
}
|
|
|
|
return xml;
|
|
}
|
|
|
|
void Bookkeeper::ReadFromDisk()
|
|
{
|
|
if( !IsAFile(COINS_DAT) )
|
|
return;
|
|
|
|
XNode xml;
|
|
if( !XmlFileUtil::LoadFromFileShowErrors(xml, COINS_DAT) )
|
|
return;
|
|
|
|
int numCoins = 0;
|
|
ReadCoinsFile(numCoins);
|
|
|
|
if ( numCoins < 0 )
|
|
numCoins = 0;
|
|
else if ( numCoins / PREFSMAN->m_iCoinsPerCredit > PREFSMAN->m_iMaxNumCredits )
|
|
numCoins = 0;
|
|
|
|
LOG->Trace("Number of Coins to Load on boot: %i", numCoins);
|
|
GAMESTATE->m_iCoins.Set(numCoins);
|
|
|
|
LoadFromNode( &xml );
|
|
}
|
|
|
|
void Bookkeeper::WriteToDisk()
|
|
{
|
|
// Write data. Use SLOW_FLUSH, to help ensure that we don't lose coin data.
|
|
RageFile f;
|
|
if( !f.Open(COINS_DAT, RageFile::WRITE|RageFile::SLOW_FLUSH) )
|
|
{
|
|
LOG->Warn( "Couldn't open file \"%s\" for writing: %s", COINS_DAT.c_str(), f.GetError().c_str() );
|
|
return;
|
|
}
|
|
|
|
std::unique_ptr<XNode> xml( CreateNode() );
|
|
XmlFileUtil::SaveToFile( xml.get(), f );
|
|
}
|
|
|
|
void Bookkeeper::CoinInserted()
|
|
{
|
|
Date d;
|
|
d.Set( time(nullptr) );
|
|
|
|
++m_mapCoinsForHour[d];
|
|
}
|
|
|
|
void Bookkeeper::WriteCoinsFile( int coins )
|
|
{
|
|
IniFile ini;
|
|
ini.SetValue( "Bookkeeping", "Coins", coins);
|
|
ini.WriteFile( SpecialFiles::COINS_INI );
|
|
}
|
|
|
|
void Bookkeeper::ReadCoinsFile( int &coins )
|
|
{
|
|
IniFile ini;
|
|
ini.ReadFile( SpecialFiles::COINS_INI );
|
|
ini.GetValue( "Bookkeeping", "Coins", coins);
|
|
}
|
|
|
|
// Return the number of coins between [beginning,ending).
|
|
int Bookkeeper::GetNumCoinsInRange( std::map<Date,int>::const_iterator begin, std::map<Date,int>::const_iterator end ) const
|
|
{
|
|
int iCoins = 0;
|
|
|
|
while( begin != end )
|
|
{
|
|
iCoins += begin->second;
|
|
++begin;
|
|
}
|
|
|
|
return iCoins;
|
|
}
|
|
|
|
int Bookkeeper::GetNumCoins( Date beginning, Date ending ) const
|
|
{
|
|
return GetNumCoinsInRange( m_mapCoinsForHour.lower_bound( beginning ),
|
|
m_mapCoinsForHour.lower_bound( ending ) );
|
|
}
|
|
|
|
int Bookkeeper::GetCoinsTotal() const
|
|
{
|
|
return GetNumCoinsInRange( m_mapCoinsForHour.begin(), m_mapCoinsForHour.end() );
|
|
}
|
|
|
|
void Bookkeeper::GetCoinsLastDays( int coins[NUM_LAST_DAYS] ) const
|
|
{
|
|
time_t lOldTime = time(nullptr);
|
|
tm time;
|
|
localtime_r( &lOldTime, &time );
|
|
|
|
time.tm_hour = 0;
|
|
|
|
for( int i=0; i<NUM_LAST_DAYS; i++ )
|
|
{
|
|
tm EndTime = AddDays( time, +1 );
|
|
coins[i] = GetNumCoins( time, EndTime );
|
|
time = GetYesterday( time );
|
|
}
|
|
}
|
|
|
|
void Bookkeeper::GetCoinsLastWeeks( int coins[NUM_LAST_WEEKS] ) const
|
|
{
|
|
time_t lOldTime = time(nullptr);
|
|
tm time;
|
|
localtime_r( &lOldTime, &time );
|
|
|
|
time = GetNextSunday( time );
|
|
time = GetYesterday( time );
|
|
|
|
for( int w=0; w<NUM_LAST_WEEKS; w++ )
|
|
{
|
|
tm StartTime = AddDays( time, -DAYS_IN_WEEK );
|
|
coins[w] = GetNumCoins( StartTime, time );
|
|
time = StartTime;
|
|
}
|
|
}
|
|
|
|
/* iDay is days since Jan 1. iYear is eg. 2005. Return the day of the week,
|
|
* where 0 is Sunday. */
|
|
void Bookkeeper::GetCoinsByDayOfWeek( int coins[DAYS_IN_WEEK] ) const
|
|
{
|
|
for( int i=0; i<DAYS_IN_WEEK; i++ )
|
|
coins[i] = 0;
|
|
|
|
for( std::map<Date,int>::const_iterator it = m_mapCoinsForHour.begin(); it != m_mapCoinsForHour.end(); ++it )
|
|
{
|
|
const Date &d = it->first;
|
|
int iDayOfWeek = GetDayInYearAndYear( d.m_iDayOfYear, d.m_iYear ).tm_wday;
|
|
coins[iDayOfWeek] += it->second;
|
|
}
|
|
}
|
|
|
|
void Bookkeeper::GetCoinsByHour( int coins[HOURS_IN_DAY] ) const
|
|
{
|
|
memset( coins, 0, sizeof(int) * HOURS_IN_DAY );
|
|
for( std::map<Date,int>::const_iterator it = m_mapCoinsForHour.begin(); it != m_mapCoinsForHour.end(); ++it )
|
|
{
|
|
const Date &d = it->first;
|
|
|
|
if( d.m_iHour >= HOURS_IN_DAY )
|
|
{
|
|
LOG->Warn( "Hour %i >= %i", d.m_iHour, HOURS_IN_DAY );
|
|
continue;
|
|
}
|
|
|
|
coins[d.m_iHour] += it->second;
|
|
}
|
|
}
|
|
|
|
/*
|
|
* (c) 2003-2005 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.
|
|
*/
|