smsvn -> ssc-hg glue: rearrange directory structure
This commit is contained in:
Devin J. Pohly
@@ -0,0 +1,270 @@
|
||||
#include "global.h"
|
||||
#include "InputQueue.h"
|
||||
#include "RageTimer.h"
|
||||
#include "RageLog.h"
|
||||
#include "InputEventPlus.h"
|
||||
#include "Foreach.h"
|
||||
#include "InputMapper.h"
|
||||
|
||||
|
||||
InputQueue* INPUTQUEUE = NULL; // global and accessable from anywhere in our program
|
||||
|
||||
const unsigned MAX_INPUT_QUEUE_LENGTH = 32;
|
||||
|
||||
InputQueue::InputQueue()
|
||||
{
|
||||
FOREACH_ENUM( GameController, gc )
|
||||
m_aQueue[gc].resize( MAX_INPUT_QUEUE_LENGTH );
|
||||
}
|
||||
|
||||
void InputQueue::RememberInput( const InputEventPlus &iep )
|
||||
{
|
||||
if( !iep.GameI.IsValid() )
|
||||
return;
|
||||
|
||||
int c = iep.GameI.controller;
|
||||
if( m_aQueue[c].size() >= MAX_INPUT_QUEUE_LENGTH ) // full
|
||||
m_aQueue[c].erase( m_aQueue[c].begin(), m_aQueue[c].begin() + (m_aQueue[c].size()-MAX_INPUT_QUEUE_LENGTH+1) );
|
||||
m_aQueue[c].push_back( iep );
|
||||
}
|
||||
|
||||
bool InputQueue::WasPressedRecently( GameController c, const GameButton button, const RageTimer &OldestTimeAllowed, InputEventPlus *pIEP )
|
||||
{
|
||||
for( int queue_index=m_aQueue[c].size()-1; queue_index>=0; queue_index-- ) // iterate newest to oldest
|
||||
{
|
||||
const InputEventPlus &iep = m_aQueue[c][queue_index];
|
||||
if( iep.DeviceI.ts < OldestTimeAllowed ) // buttons are too old. Stop searching because we're not going to find a match
|
||||
return false;
|
||||
|
||||
if( iep.GameI.button != button )
|
||||
continue;
|
||||
|
||||
if( pIEP != NULL )
|
||||
*pIEP = iep;
|
||||
|
||||
return true;
|
||||
}
|
||||
|
||||
return false; // didn't find the button
|
||||
}
|
||||
|
||||
void InputQueue::ClearQueue( GameController c )
|
||||
{
|
||||
m_aQueue[c].clear();
|
||||
}
|
||||
|
||||
static const float g_fSimultaneousThreshold = 0.05f;
|
||||
|
||||
bool InputQueueCode::EnteredCode( GameController controller ) const
|
||||
{
|
||||
if( controller == GameController_Invalid )
|
||||
return false;
|
||||
if( m_aPresses.size() == 0 )
|
||||
return false;
|
||||
|
||||
RageTimer OldestTimeAllowed;
|
||||
if( m_fMaxSecondsBack == -1 )
|
||||
OldestTimeAllowed.SetZero();
|
||||
else
|
||||
OldestTimeAllowed += -m_fMaxSecondsBack;
|
||||
|
||||
// iterate newest to oldest
|
||||
int iSequenceIndex = m_aPresses.size()-1; // count down
|
||||
const vector<InputEventPlus> &aQueue = INPUTQUEUE->GetQueue( controller );
|
||||
int iQueueIndex = aQueue.size()-1;
|
||||
while( iQueueIndex >= 0 )
|
||||
{
|
||||
/* If the buttons are too old, stop searching because we're not going to find a match. */
|
||||
if( !OldestTimeAllowed.IsZero() && aQueue[iQueueIndex].DeviceI.ts < OldestTimeAllowed )
|
||||
return false;
|
||||
|
||||
/* If the last press is an input type we're not interested in, skip it
|
||||
* and look again. */
|
||||
const ButtonPress &Press = m_aPresses[iSequenceIndex];
|
||||
if( !Press.m_InputTypes[aQueue[iQueueIndex].type] )
|
||||
{
|
||||
--iQueueIndex;
|
||||
continue;
|
||||
}
|
||||
|
||||
/* Search backwards for all of Press.m_aButtonsToPress pressed within g_fTapThreshold seconds
|
||||
* with m_aButtonsToHold pressed. Start looking at iQueueIndex. */
|
||||
RageTimer OldestTimeAllowedForTap( aQueue[iQueueIndex].DeviceI.ts );
|
||||
OldestTimeAllowedForTap += -g_fSimultaneousThreshold;
|
||||
|
||||
bool bMatched = false;
|
||||
int iMinSearchIndexUsed = iQueueIndex;
|
||||
for( int b=0; b<(int) Press.m_aButtonsToPress.size(); ++b )
|
||||
{
|
||||
const InputEventPlus *pIEP = NULL;
|
||||
int iQueueSearchIndex = iQueueIndex;
|
||||
for( ; iQueueSearchIndex>=0; --iQueueSearchIndex ) // iterate newest to oldest
|
||||
{
|
||||
const InputEventPlus &iep = aQueue[iQueueSearchIndex];
|
||||
if( iep.DeviceI.ts < OldestTimeAllowedForTap ) // buttons are too old. Stop searching because we're not going to find a match
|
||||
break;
|
||||
|
||||
if( !Press.m_InputTypes[iep.type] )
|
||||
continue;
|
||||
|
||||
if( iep.GameI.button == Press.m_aButtonsToPress[b] )
|
||||
{
|
||||
pIEP = &iep;
|
||||
break;
|
||||
}
|
||||
}
|
||||
if( pIEP == NULL )
|
||||
break; // didn't find the button
|
||||
|
||||
// Check that m_aButtonsToHold were being held when the buttons were pressed.
|
||||
bool bAllHeldButtonsOK = true;
|
||||
for( unsigned i=0; i<Press.m_aButtonsToHold.size(); i++ )
|
||||
{
|
||||
GameInput gi( controller, Press.m_aButtonsToHold[i] );
|
||||
if( !INPUTMAPPER->IsBeingPressed(gi, MultiPlayer_Invalid, &pIEP->InputList) )
|
||||
bAllHeldButtonsOK = false;
|
||||
}
|
||||
for( unsigned i=0; i<Press.m_aButtonsToNotHold.size(); i++ )
|
||||
{
|
||||
GameInput gi( controller, Press.m_aButtonsToNotHold[i] );
|
||||
if( INPUTMAPPER->IsBeingPressed(gi, MultiPlayer_Invalid, &pIEP->InputList) )
|
||||
bAllHeldButtonsOK = false;
|
||||
}
|
||||
if( !bAllHeldButtonsOK )
|
||||
continue;
|
||||
iMinSearchIndexUsed = min( iMinSearchIndexUsed, iQueueSearchIndex );
|
||||
if( b == (int) Press.m_aButtonsToPress.size()-1 )
|
||||
bMatched = true;
|
||||
}
|
||||
|
||||
if( !bMatched )
|
||||
{
|
||||
/* The press wasn't matched. If m_bAllowIntermediatePresses is true,
|
||||
* skip the last press, and look again. */
|
||||
if( !Press.m_bAllowIntermediatePresses )
|
||||
return false;
|
||||
--iQueueIndex;
|
||||
continue;
|
||||
}
|
||||
|
||||
if( iSequenceIndex == 0 )
|
||||
{
|
||||
// we matched the whole pattern. Empty the queue so we don't match on it again.
|
||||
INPUTQUEUE->ClearQueue( controller );
|
||||
return true;
|
||||
}
|
||||
|
||||
/* The press was matched. */
|
||||
iQueueIndex = iMinSearchIndexUsed - 1;
|
||||
--iSequenceIndex;
|
||||
}
|
||||
|
||||
return false;
|
||||
}
|
||||
|
||||
bool InputQueueCode::Load( RString sButtonsNames )
|
||||
{
|
||||
m_aPresses.clear();
|
||||
|
||||
vector<RString> asPresses;
|
||||
split( sButtonsNames, ",", asPresses, false );
|
||||
FOREACH( RString, asPresses, sPress )
|
||||
{
|
||||
vector<RString> asButtonNames;
|
||||
|
||||
split( *sPress, "-", asButtonNames, false );
|
||||
|
||||
if( asButtonNames.size() < 1 )
|
||||
{
|
||||
if( sButtonsNames != "" )
|
||||
LOG->Trace( "Ignoring empty code \"%s\".", sButtonsNames.c_str() );
|
||||
return false;
|
||||
}
|
||||
|
||||
m_aPresses.push_back( ButtonPress() );
|
||||
for( unsigned i=0; i<asButtonNames.size(); i++ ) // for each button in this code
|
||||
{
|
||||
RString sButtonName = asButtonNames[i];
|
||||
|
||||
bool bHold = false;
|
||||
bool bNotHold = false;
|
||||
while(1)
|
||||
{
|
||||
if( sButtonName.Left(1) == "+" )
|
||||
{
|
||||
m_aPresses.back().m_InputTypes[IET_REPEAT] = true;
|
||||
sButtonName.erase(0, 1);
|
||||
}
|
||||
else if( sButtonName.Left(1) == "~" )
|
||||
{
|
||||
m_aPresses.back().m_InputTypes[IET_FIRST_PRESS] = false;
|
||||
m_aPresses.back().m_InputTypes[IET_RELEASE] = true;
|
||||
sButtonName.erase(0, 1);
|
||||
}
|
||||
else if( sButtonName.Left(1) == "@" )
|
||||
{
|
||||
sButtonName.erase(0, 1);
|
||||
bHold = true;
|
||||
}
|
||||
else if( sButtonName.Left(1) == "!" )
|
||||
{
|
||||
sButtonName.erase(0, 1);
|
||||
bNotHold = true;
|
||||
}
|
||||
else
|
||||
{
|
||||
break;
|
||||
}
|
||||
}
|
||||
|
||||
// Search for the corresponding GameButton
|
||||
const GameButton gb = INPUTMAPPER->GetInputScheme()->ButtonNameToIndex( sButtonName );
|
||||
if( gb == GameButton_Invalid )
|
||||
{
|
||||
LOG->Trace( "The code \"%s\" contains an unrecognized button \"%s\".", sButtonsNames.c_str(), sButtonName.c_str() );
|
||||
m_aPresses.clear();
|
||||
return false;
|
||||
}
|
||||
|
||||
if( bHold )
|
||||
m_aPresses.back().m_aButtonsToHold.push_back( gb );
|
||||
else if( bNotHold )
|
||||
m_aPresses.back().m_aButtonsToNotHold.push_back( gb );
|
||||
else
|
||||
m_aPresses.back().m_aButtonsToPress.push_back( gb );
|
||||
}
|
||||
}
|
||||
|
||||
if( m_aPresses.size() == 1 )
|
||||
m_fMaxSecondsBack = 0.55f;
|
||||
else
|
||||
m_fMaxSecondsBack = (m_aPresses.size()-1)*0.6f;
|
||||
|
||||
// if we make it here, we found all the buttons in the code
|
||||
return true;
|
||||
}
|
||||
|
||||
/*
|
||||
* (c) 2001-2007 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.
|
||||
*/
|
||||
Reference in New Issue
Block a user