Files
itgmania212121/stepmania/src/NoteData.cpp
T

824 lines
20 KiB
C++
Raw Normal View History

2002-04-16 17:31:00 +00:00
/*
2004-05-31 22:42:12 +00:00
* NoteData is organized by:
* track - corresponds to different columns of notes on the screen
* row/index - corresponds to subdivisions of beats
*/
2002-04-16 17:31:00 +00:00
2004-05-31 22:42:12 +00:00
#include "global.h"
2002-04-16 17:31:00 +00:00
#include "NoteData.h"
#include "RageUtil.h"
#include "RageLog.h"
2002-04-16 17:31:00 +00:00
NoteData::NoteData()
2002-06-24 22:04:31 +00:00
{
Init();
}
void NoteData::Init()
2002-04-16 17:31:00 +00:00
{
2003-02-09 19:16:25 +00:00
ClearAll();
2004-09-25 07:59:56 +00:00
m_TapNotes.clear();
2002-04-16 17:31:00 +00:00
}
2002-05-19 01:59:48 +00:00
NoteData::~NoteData()
{
}
2003-03-26 17:53:31 +00:00
int NoteData::GetNumTracks() const
2003-02-01 05:16:38 +00:00
{
2004-09-25 07:59:56 +00:00
return m_TapNotes.size();
2003-02-01 05:16:38 +00:00
}
void NoteData::SetNumTracks( int iNewNumTracks )
{
2004-09-25 07:59:56 +00:00
ASSERT( iNewNumTracks > 0 );
2003-02-01 05:27:49 +00:00
2004-09-25 07:59:56 +00:00
m_TapNotes.resize( iNewNumTracks );
2003-02-01 05:27:49 +00:00
/* Remove all hold notes that are out of bounds. */
2004-09-25 07:59:56 +00:00
// Iterate backwards so that we can delete.
for( int h = m_HoldNotes.size()-1; h >= 0; --h )
if( m_HoldNotes[h].iTrack >= iNewNumTracks )
m_HoldNotes.erase( m_HoldNotes.begin()+h );
2003-02-01 05:16:38 +00:00
}
2004-10-24 00:17:15 +00:00
/* Clear [rowBegin,rowEnd]; that is, including rowEnd. */
void NoteData::ClearRange( int rowBegin, int rowEnd )
2002-04-16 17:31:00 +00:00
{
2002-08-25 05:00:23 +00:00
this->ConvertHoldNotesTo4s();
2004-10-02 05:08:59 +00:00
for( int t=0; t<GetNumTracks(); t++ )
2002-04-16 17:31:00 +00:00
{
2004-10-24 10:20:24 +00:00
FOREACH_NONEMPTY_ROW_IN_TRACK_RANGE( *this, t, r, rowBegin, rowEnd )
SetTapNote(t, r, TAP_EMPTY);
2002-04-16 17:31:00 +00:00
}
2002-08-25 05:00:23 +00:00
this->Convert4sToHoldNotes();
2002-04-16 17:31:00 +00:00
}
2002-08-25 05:00:23 +00:00
2002-12-14 20:30:49 +00:00
void NoteData::ClearAll()
{
2004-10-02 05:08:59 +00:00
for( int t=0; t<GetNumTracks(); t++ )
2004-05-24 04:26:54 +00:00
m_TapNotes[t].clear();
2002-12-14 20:30:49 +00:00
m_HoldNotes.clear();
}
2002-08-25 05:00:23 +00:00
/* Copy a range from pFrom to this. (Note that this does *not* overlay;
* all data in the range is overwritten.) */
2004-10-24 10:20:24 +00:00
void NoteData::CopyRange( const NoteData& from, int rowFromBegin, int rowFromEnd, int rowToBegin )
2002-04-16 17:31:00 +00:00
{
2004-10-23 17:43:49 +00:00
ASSERT( from.GetNumTracks() == GetNumTracks() );
2002-04-16 17:31:00 +00:00
2003-10-04 04:05:29 +00:00
NoteData From, To;
2004-10-23 17:43:49 +00:00
From.To4s( from );
2003-10-04 04:05:29 +00:00
To.To4s( *this );
2002-04-16 17:31:00 +00:00
2004-05-24 04:17:19 +00:00
// copy recorded TapNotes
2002-06-29 11:59:09 +00:00
for( int t=0; t<GetNumTracks(); t++ )
2002-04-16 17:31:00 +00:00
{
2004-10-24 10:20:24 +00:00
FOREACH_NONEMPTY_ROW_IN_TRACK_RANGE( From, t, iFrom, rowFromBegin, rowFromEnd )
2003-11-17 03:38:24 +00:00
{
2004-10-24 10:20:24 +00:00
int iTo = rowToBegin + iFrom - rowFromBegin;
const TapNote &tn = From.GetTapNote( t, iFrom );
2004-10-23 23:41:49 +00:00
To.SetTapNote( t, iTo, tn );
2003-11-17 03:38:24 +00:00
}
2002-04-16 17:31:00 +00:00
}
2003-10-04 04:05:29 +00:00
this->From4s( To );
2002-04-16 17:31:00 +00:00
}
2004-10-23 17:43:49 +00:00
void NoteData::Config( const NoteData& from )
2002-12-13 01:23:26 +00:00
{
2004-10-23 17:43:49 +00:00
SetNumTracks( from.GetNumTracks() );
2002-12-13 01:23:26 +00:00
}
2004-10-23 17:43:49 +00:00
void NoteData::CopyAll( const NoteData& from )
2002-12-13 01:23:26 +00:00
{
2004-10-23 17:43:49 +00:00
Config(from);
ClearAll();
2003-10-04 02:30:06 +00:00
2004-09-28 02:14:56 +00:00
for( int c=0; c<GetNumTracks(); c++ )
2004-10-23 17:43:49 +00:00
m_TapNotes[c] = from.m_TapNotes[c];
m_HoldNotes = from.m_HoldNotes;
2002-12-13 01:23:26 +00:00
}
2004-10-24 10:20:24 +00:00
bool NoteData::IsRowEmpty( int row ) const
2003-12-11 04:52:23 +00:00
{
2004-09-28 02:14:56 +00:00
for( int t=0; t<GetNumTracks(); t++ )
2004-10-25 03:16:40 +00:00
if( GetTapNote(t, row).type != TapNote::empty )
2003-12-11 04:52:23 +00:00
return false;
return true;
}
2004-10-24 10:20:24 +00:00
bool NoteData::IsRangeEmpty( int track, int rowBegin, int rowEnd ) const
{
2004-09-25 07:59:56 +00:00
ASSERT( track < GetNumTracks() );
2004-10-24 10:20:24 +00:00
FOREACH_NONEMPTY_ROW_IN_TRACK_RANGE( *this, track, r, rowBegin, rowEnd )
2004-10-25 03:16:40 +00:00
if( GetTapNote(track,r).type != TapNote::empty )
return false;
return true;
}
2004-10-24 10:20:24 +00:00
int NoteData::GetNumTapNonEmptyTracks( int row ) const
2003-12-11 04:52:23 +00:00
{
int iNum = 0;
2004-09-28 02:14:56 +00:00
for( int t=0; t<GetNumTracks(); t++ )
2004-10-24 10:20:24 +00:00
if( GetTapNote(t, row).type != TapNote::empty )
2003-12-11 04:52:23 +00:00
iNum++;
return iNum;
}
2004-10-24 10:20:24 +00:00
void NoteData::GetTapNonEmptyTracks( int row, set<int>& addTo ) const
2004-05-15 03:00:43 +00:00
{
2004-09-28 02:14:56 +00:00
for( int t=0; t<GetNumTracks(); t++ )
2004-10-24 10:20:24 +00:00
if( GetTapNote(t, row).type != TapNote::empty )
2004-05-15 03:00:43 +00:00
addTo.insert(t);
}
2004-10-24 10:20:24 +00:00
bool NoteData::GetTapFirstNonEmptyTrack( int row, int &iNonEmptyTrackOut ) const
2003-12-11 04:52:23 +00:00
{
2004-09-28 02:14:56 +00:00
for( int t=0; t<GetNumTracks(); t++ )
2004-10-24 10:20:24 +00:00
{
2004-10-25 03:16:40 +00:00
if( GetTapNote( t, row ).type != TapNote::empty )
2004-10-24 10:20:24 +00:00
{
iNonEmptyTrackOut = t;
return true;
}
}
return false;
}
bool NoteData::GetTapFirstEmptyTrack( int row, int &iEmptyTrackOut ) const
{
for( int t=0; t<GetNumTracks(); t++ )
{
2004-10-25 03:16:40 +00:00
if( GetTapNote( t, row ).type == TapNote::empty )
2004-10-24 10:20:24 +00:00
{
iEmptyTrackOut = t;
return true;
}
}
return false;
}
bool NoteData::GetTapLastEmptyTrack( int row, int &iEmptyTrackOut ) const
{
for( int t=GetNumTracks()-1; t>=0; t-- )
{
2004-10-25 03:16:40 +00:00
if( GetTapNote( t, row ).type == TapNote::empty )
2004-10-24 10:20:24 +00:00
{
iEmptyTrackOut = t;
return true;
}
}
return false;
2003-12-11 04:52:23 +00:00
}
2004-10-24 10:20:24 +00:00
int NoteData::GetNumTracksWithTap( int row ) const
2003-12-11 04:52:23 +00:00
{
int iNum = 0;
2004-09-28 02:14:56 +00:00
for( int t=0; t<GetNumTracks(); t++ )
2003-12-11 04:52:23 +00:00
{
2004-10-25 03:16:40 +00:00
const TapNote &tn = GetTapNote( t, row );
if( tn.type == TapNote::tap )
2003-12-11 04:52:23 +00:00
iNum++;
}
return iNum;
}
2004-10-24 10:20:24 +00:00
int NoteData::GetNumTracksWithTapOrHoldHead( int row ) const
2003-12-11 04:52:23 +00:00
{
int iNum = 0;
2004-09-28 02:14:56 +00:00
for( int t=0; t<GetNumTracks(); t++ )
2003-12-11 04:52:23 +00:00
{
2004-10-25 03:16:40 +00:00
const TapNote &tn = GetTapNote( t, row );
if( tn.type == TapNote::tap || tn.type == TapNote::hold_head )
2003-12-11 04:52:23 +00:00
iNum++;
}
return iNum;
}
2004-10-24 10:20:24 +00:00
int NoteData::GetFirstTrackWithTap( int row ) const
2003-12-11 04:52:23 +00:00
{
2004-09-28 02:14:56 +00:00
for( int t=0; t<GetNumTracks(); t++ )
2003-12-11 04:52:23 +00:00
{
2004-10-25 03:16:40 +00:00
const TapNote &tn = GetTapNote( t, row );
if( tn.type == TapNote::tap )
2003-12-11 04:52:23 +00:00
return t;
}
return -1;
}
2004-10-24 10:20:24 +00:00
int NoteData::GetFirstTrackWithTapOrHoldHead( int row ) const
2003-12-11 04:52:23 +00:00
{
2004-09-28 02:14:56 +00:00
for( int t=0; t<GetNumTracks(); t++ )
2003-12-11 04:52:23 +00:00
{
2004-10-25 03:16:40 +00:00
const TapNote &tn = GetTapNote( t, row );
if( tn.type == TapNote::tap || tn.type == TapNote::hold_head )
2003-12-11 04:52:23 +00:00
return t;
}
return -1;
}
2002-04-16 17:31:00 +00:00
void NoteData::AddHoldNote( HoldNote add )
{
2003-12-16 04:00:39 +00:00
ASSERT( add.iStartRow>=0 && add.iEndRow>=0 );
2002-04-16 17:31:00 +00:00
// look for other hold notes that overlap and merge them
// XXX: this is done implicitly with 4s, but 4s uses this function.
// Rework this later.
2004-09-21 07:53:39 +00:00
for( int i=0; i<GetNumHoldNotes(); i++ ) // for each HoldNote
2002-04-16 17:31:00 +00:00
{
2002-11-02 22:53:04 +00:00
HoldNote &other = GetHoldNote(i);
if( add.iTrack == other.iTrack && // the tracks correspond
2003-12-16 04:00:39 +00:00
add.RangeOverlaps(other) ) // they overlap
2002-04-16 17:31:00 +00:00
{
2003-12-16 04:00:39 +00:00
add.iStartRow = min(add.iStartRow, other.iStartRow);
add.iEndRow = max(add.iEndRow, other.iEndRow);
2002-04-16 17:31:00 +00:00
// delete this HoldNote
RemoveHoldNote( i );
--i;
2002-04-16 17:31:00 +00:00
}
}
2003-12-16 04:00:39 +00:00
int iAddStartIndex = add.iStartRow;
int iAddEndIndex = add.iEndRow;
2004-05-24 04:17:19 +00:00
// delete TapNotes under this HoldNote
FOREACH_NONEMPTY_ROW_IN_TRACK_RANGE( *this, add.iTrack, i, iAddStartIndex+1, iAddEndIndex )
SetTapNote( add.iTrack, i, TAP_EMPTY );
2002-04-16 17:31:00 +00:00
2002-06-14 22:25:22 +00:00
// add a tap note at the start of this hold
SetTapNote( add.iTrack, iAddStartIndex, TAP_ORIGINAL_HOLD_HEAD ); // Hold begin marker. Don't draw this, but do grade it.
2002-06-14 22:25:22 +00:00
2002-11-02 23:10:38 +00:00
m_HoldNotes.push_back(add);
2002-04-16 17:31:00 +00:00
}
void NoteData::RemoveHoldNote( int iHoldIndex )
2002-04-16 17:31:00 +00:00
{
2002-11-02 23:10:38 +00:00
ASSERT( iHoldIndex >= 0 && iHoldIndex < GetNumHoldNotes() );
2002-11-02 22:53:04 +00:00
HoldNote& hn = GetHoldNote(iHoldIndex);
2003-12-16 04:00:39 +00:00
const int iHoldStartIndex = hn.iStartRow;
2002-04-16 17:31:00 +00:00
2002-06-14 22:25:22 +00:00
// delete a tap note at the start of this hold
SetTapNote(hn.iTrack, iHoldStartIndex, TAP_EMPTY);
2002-06-14 22:25:22 +00:00
// remove from list
2002-11-02 23:10:38 +00:00
m_HoldNotes.erase(m_HoldNotes.begin()+iHoldIndex, m_HoldNotes.begin()+iHoldIndex+1);
2002-04-16 17:31:00 +00:00
}
2003-12-18 02:34:59 +00:00
/* Get a hold note with the same track and end row as hn. */
int NoteData::GetMatchingHoldNote( const HoldNote &hn ) const
{
for( int i=0; i<GetNumHoldNotes(); i++ ) // for each HoldNote
{
const HoldNote &ret = GetHoldNote(i);
if( ret.iTrack == hn.iTrack && ret.iEndRow == hn.iEndRow )
return i;
}
FAIL_M( ssprintf("%i..%i, %i", hn.iStartRow, hn.iEndRow, hn.iTrack) );
2003-12-18 02:34:59 +00:00
}
2004-10-23 23:41:49 +00:00
void NoteData::SetTapAttackNote( int track, int row, CString sModifiers, float fDurationSeconds )
2003-11-15 08:51:47 +00:00
{
2004-10-23 23:41:49 +00:00
TapNote tn(
TapNote::attack,
TapNote::original,
sModifiers,
fDurationSeconds,
false,
0 );
SetTapNote( track, row, tn );
2003-11-15 08:51:47 +00:00
}
int NoteData::GetFirstRow() const
2002-04-16 17:31:00 +00:00
{
2003-12-16 04:00:39 +00:00
int iEarliestRowFoundSoFar = -1;
2002-04-16 17:31:00 +00:00
2004-10-02 05:08:59 +00:00
for( int t=0; t < GetNumTracks(); t++ )
2002-07-11 19:02:26 +00:00
{
int iRow = -1;
if( !GetNextTapNoteRowForTrack( t, iRow ) )
continue;
if( iEarliestRowFoundSoFar == -1 )
iEarliestRowFoundSoFar = iRow;
else
iEarliestRowFoundSoFar = min( iEarliestRowFoundSoFar, iRow );
2002-07-11 19:02:26 +00:00
}
2004-09-21 07:53:39 +00:00
for( int i=0; i<GetNumHoldNotes(); i++ )
2003-03-06 22:40:04 +00:00
{
2003-12-16 04:00:39 +00:00
if( iEarliestRowFoundSoFar == -1 ||
GetHoldNote(i).iStartRow < iEarliestRowFoundSoFar )
iEarliestRowFoundSoFar = GetHoldNote(i).iStartRow;
2003-03-06 22:40:04 +00:00
}
2002-04-16 17:31:00 +00:00
2003-12-16 04:00:39 +00:00
if( iEarliestRowFoundSoFar == -1 ) // there are no notes
return 0;
2003-03-06 22:40:04 +00:00
2003-12-16 04:00:39 +00:00
return iEarliestRowFoundSoFar;
2002-07-11 19:02:26 +00:00
}
2003-12-16 04:00:39 +00:00
int NoteData::GetLastRow() const
2002-07-11 19:02:26 +00:00
{
2003-12-16 04:00:39 +00:00
int iOldestRowFoundSoFar = 0;
2002-07-11 19:02:26 +00:00
2004-10-02 05:08:59 +00:00
for( int t=0; t < GetNumTracks(); t++ )
2002-04-16 17:31:00 +00:00
{
int iRow = 999999999;
if( !GetPrevTapNoteRowForTrack( t, iRow ) )
continue;
iOldestRowFoundSoFar = max( iOldestRowFoundSoFar, iRow );
2002-04-16 17:31:00 +00:00
}
2004-09-21 07:53:39 +00:00
for( int i=0; i<GetNumHoldNotes(); i++ )
2002-07-11 19:02:26 +00:00
{
2003-12-16 04:00:39 +00:00
if( GetHoldNote(i).iEndRow > iOldestRowFoundSoFar )
iOldestRowFoundSoFar = GetHoldNote(i).iEndRow;
2002-07-11 19:02:26 +00:00
}
2002-04-16 17:31:00 +00:00
2003-12-16 04:00:39 +00:00
return iOldestRowFoundSoFar;
}
2004-05-24 04:26:54 +00:00
int NoteData::GetNumTapNotes( float fStartBeat, float fEndBeat ) const
2002-12-14 20:34:38 +00:00
{
2003-12-11 04:52:23 +00:00
if( fEndBeat == -1 )
fEndBeat = 999999;
int iNumNotes = 0;
2003-12-11 04:52:23 +00:00
2002-05-19 01:59:48 +00:00
int iStartIndex = BeatToNoteRow( fStartBeat );
int iEndIndex = BeatToNoteRow( fEndBeat );
2003-12-11 04:52:23 +00:00
/* Clamp to known-good ranges. */
2003-12-11 21:26:57 +00:00
iStartIndex = max( iStartIndex, 0 );
iEndIndex = min( iEndIndex, GetLastRow() );
2003-01-02 09:44:09 +00:00
2004-09-28 02:14:56 +00:00
for( int t=0; t<GetNumTracks(); t++ )
{
2004-10-24 10:20:24 +00:00
FOREACH_NONEMPTY_ROW_IN_TRACK_RANGE( *this, t, r, iStartIndex, iEndIndex )
2002-12-14 20:34:38 +00:00
{
2004-10-25 03:16:40 +00:00
const TapNote &tn = GetTapNote(t, r);
if( tn.type != TapNote::empty && tn.type != TapNote::mine )
2002-06-24 22:04:31 +00:00
iNumNotes++;
2002-12-14 20:34:38 +00:00
}
}
2002-04-16 17:31:00 +00:00
2002-06-24 22:04:31 +00:00
return iNumNotes;
2002-04-16 17:31:00 +00:00
}
2003-11-10 01:24:46 +00:00
int NoteData::GetNumRowsWithTap( float fStartBeat, float fEndBeat ) const
{
if( fEndBeat == -1 )
fEndBeat = GetLastBeat();
int iNumNotes = 0;
int iStartIndex = BeatToNoteRow( fStartBeat );
int iEndIndex = BeatToNoteRow( fEndBeat );
2004-10-24 10:20:24 +00:00
FOREACH_NONEMPTY_ROW_ALL_TRACKS_RANGE( *this, r, iStartIndex, iEndIndex )
if( IsThereATapAtRow(r) )
iNumNotes++;
return iNumNotes;
}
2003-11-26 04:21:59 +00:00
int NoteData::GetNumMines( float fStartBeat, float fEndBeat ) const
{
2003-12-11 04:52:23 +00:00
if( fEndBeat == -1 )
fEndBeat = 999999;
int iNumMines = 0;
2003-12-11 04:52:23 +00:00
2003-11-26 04:21:59 +00:00
int iStartIndex = BeatToNoteRow( fStartBeat );
int iEndIndex = BeatToNoteRow( fEndBeat );
2003-12-11 04:52:23 +00:00
/* Clamp to known-good ranges. */
2003-12-11 21:26:57 +00:00
iStartIndex = max( iStartIndex, 0 );
iEndIndex = min( iEndIndex, GetLastRow() );
2003-11-26 04:21:59 +00:00
2004-09-28 02:14:56 +00:00
for( int t=0; t<GetNumTracks(); t++ )
2003-11-26 04:21:59 +00:00
{
2004-10-24 10:20:24 +00:00
FOREACH_NONEMPTY_ROW_IN_TRACK_RANGE( *this, t, r, iStartIndex, iEndIndex )
2004-10-25 03:16:40 +00:00
if( GetTapNote(t, r).type == TapNote::mine )
2003-11-26 04:21:59 +00:00
iNumMines++;
}
return iNumMines;
}
2003-11-10 01:24:46 +00:00
int NoteData::GetNumRowsWithTapOrHoldHead( float fStartBeat, float fEndBeat ) const
{
if( fEndBeat == -1 )
fEndBeat = GetLastBeat();
2003-11-10 01:24:46 +00:00
int iNumNotes = 0;
int iStartIndex = BeatToNoteRow( fStartBeat );
int iEndIndex = BeatToNoteRow( fEndBeat );
2004-10-24 10:20:24 +00:00
FOREACH_NONEMPTY_ROW_ALL_TRACKS_RANGE( *this, r, iStartIndex, iEndIndex )
if( IsThereATapOrHoldHeadAtRow(r) )
2003-11-10 01:24:46 +00:00
iNumNotes++;
return iNumNotes;
}
2003-12-16 07:58:37 +00:00
int NoteData::RowNeedsHands( const int row ) const
{
int iNumNotesThisIndex = 0;
2004-09-28 02:14:56 +00:00
for( int t=0; t<GetNumTracks(); t++ )
2003-12-16 07:58:37 +00:00
{
2004-10-25 03:16:40 +00:00
const TapNote &tn = GetTapNote(t, row);
switch( tn.type )
{
case TapNote::mine:
case TapNote::empty:
case TapNote::hold_tail:
continue; // skip these types - they don't count
}
2003-12-16 07:58:37 +00:00
++iNumNotesThisIndex;
}
/* We must have at least one non-hold-body at this row to count it. */
if( !iNumNotesThisIndex )
return false;
if( iNumNotesThisIndex < 3 )
{
/* We have at least one, but not enough. Count holds. */
for( int j=0; j<GetNumHoldNotes(); j++ )
{
const HoldNote &hn = GetHoldNote(j);
if( hn.iStartRow+1 <= row && row <= hn.iEndRow )
++iNumNotesThisIndex;
}
}
return iNumNotesThisIndex >= 3;
}
2003-11-26 04:31:29 +00:00
int NoteData::GetNumHands( float fStartBeat, float fEndBeat ) const
{
2003-12-16 04:00:39 +00:00
/* Count the number of times you have to use your hands. This includes
* three taps at the same time, a tap while two hold notes are being held,
* etc. Only count rows that have at least one tap note (hold heads count).
* Otherwise, every row of hold notes counts, so three simultaneous hold
* notes will count as hundreds of "hands". */
2003-11-26 04:31:29 +00:00
if( fEndBeat == -1 )
fEndBeat = GetLastBeat();
2003-11-26 04:31:29 +00:00
2003-12-11 04:52:23 +00:00
int iStartIndex = BeatToNoteRow( fStartBeat );
int iEndIndex = BeatToNoteRow( fEndBeat );
/* Clamp to known-good ranges. */
2003-12-11 21:26:57 +00:00
iStartIndex = max( iStartIndex, 0 );
iEndIndex = min( iEndIndex, GetLastRow() );
2003-11-26 04:31:29 +00:00
int iNum = 0;
2004-10-24 10:20:24 +00:00
FOREACH_NONEMPTY_ROW_ALL_TRACKS_RANGE( *this, r, iStartIndex, iEndIndex )
2003-11-26 04:31:29 +00:00
{
2004-10-24 10:20:24 +00:00
if( !RowNeedsHands(r) )
2003-12-16 04:00:39 +00:00
continue;
2003-12-16 04:01:26 +00:00
2003-12-16 07:58:37 +00:00
iNum++;
2003-11-26 04:31:29 +00:00
}
2003-12-16 04:01:26 +00:00
2003-11-26 04:31:29 +00:00
return iNum;
}
2004-10-24 10:20:24 +00:00
int NoteData::GetNumN( int iMinTaps, float fStartBeat, float fEndBeat ) const
2002-05-19 01:59:48 +00:00
{
2003-11-26 04:21:59 +00:00
if( fEndBeat == -1 )
fEndBeat = GetLastBeat();
2002-05-19 01:59:48 +00:00
2003-12-11 04:52:23 +00:00
int iStartIndex = BeatToNoteRow( fStartBeat );
int iEndIndex = BeatToNoteRow( fEndBeat );
/* Clamp to known-good ranges. */
2003-12-11 21:26:57 +00:00
iStartIndex = max( iStartIndex, 0 );
iEndIndex = min( iEndIndex, GetLastRow() );
2002-05-19 01:59:48 +00:00
2003-11-26 04:21:59 +00:00
int iNum = 0;
2004-10-24 10:20:24 +00:00
FOREACH_NONEMPTY_ROW_ALL_TRACKS_RANGE( *this, r, iStartIndex, iEndIndex )
2002-05-19 01:59:48 +00:00
{
int iNumNotesThisIndex = 0;
2004-09-28 02:14:56 +00:00
for( int t=0; t<GetNumTracks(); t++ )
2002-05-19 01:59:48 +00:00
{
2004-10-25 03:16:40 +00:00
const TapNote &tn = GetTapNote(t, r);
if( tn.type != TapNote::mine && tn.type != TapNote::empty ) // mines don't count
2002-05-19 01:59:48 +00:00
iNumNotesThisIndex++;
}
2004-10-24 10:20:24 +00:00
if( iNumNotesThisIndex >= iMinTaps )
2003-11-26 04:21:59 +00:00
iNum++;
2002-05-19 01:59:48 +00:00
}
2003-11-26 04:21:59 +00:00
return iNum;
2002-05-19 01:59:48 +00:00
}
2003-02-25 19:49:16 +00:00
int NoteData::GetNumHoldNotes( float fStartBeat, float fEndBeat ) const
2002-05-19 01:59:48 +00:00
{
2003-12-16 04:00:39 +00:00
if( fEndBeat == -1 )
fEndBeat = GetLastBeat();
2003-12-16 04:00:39 +00:00
int iStartIndex = BeatToNoteRow( fStartBeat );
int iEndIndex = BeatToNoteRow( fEndBeat );
2002-05-19 01:59:48 +00:00
2003-12-16 04:00:39 +00:00
int iNumHolds = 0;
2002-11-02 22:59:12 +00:00
for( int i=0; i<GetNumHoldNotes(); i++ )
2002-05-19 01:59:48 +00:00
{
2002-11-02 22:53:04 +00:00
const HoldNote &hn = GetHoldNote(i);
2003-12-16 04:00:39 +00:00
if( iStartIndex <= hn.iStartRow && hn.iEndRow <= iEndIndex )
2002-06-24 22:04:31 +00:00
iNumHolds++;
2002-05-19 01:59:48 +00:00
}
2002-06-24 22:04:31 +00:00
return iNumHolds;
2002-04-16 17:31:00 +00:00
}
void NoteData::Convert2sAnd3sToHoldNotes()
{
2002-10-25 05:06:52 +00:00
// Any note will end a hold (not just a TAP_HOLD_TAIL). This makes parsing DWIs much easier.
// Plus, allowing tap notes in the middle of a hold doesn't make sense!
2002-04-16 17:31:00 +00:00
for( int t=0; t<GetNumTracks(); t++ ) // foreach column
2002-04-16 17:31:00 +00:00
{
2004-10-24 10:20:24 +00:00
FOREACH_NONEMPTY_ROW_IN_TRACK( *this, t, r )
2002-04-16 17:31:00 +00:00
{
2004-10-24 10:20:24 +00:00
if( GetTapNote(t,r).type != TapNote::hold_head )
continue; // skip
2004-10-24 10:20:24 +00:00
SetTapNote(t, r, TAP_EMPTY); // clear the hold head marker
// search for end of HoldNote
2004-10-24 10:20:24 +00:00
FOREACH_NONEMPTY_ROW_IN_TRACK_RANGE( *this, t, j, r+1, 999999 )
2002-04-16 17:31:00 +00:00
{
// End hold on the next note we see. This should be a hold_tail if the
// data is in a consistent state, but doesn't have to be.
if( GetTapNote(t, j).type == TapNote::empty )
continue;
SetTapNote(t, j, TAP_EMPTY);
2004-10-24 10:20:24 +00:00
AddHoldNote( HoldNote(t, r, j) );
break; // done searching for the end of this hold
2002-04-16 17:31:00 +00:00
}
}
}
}
2002-08-25 05:00:23 +00:00
/* "102000301" ==
* "104444001" */
2002-04-16 17:31:00 +00:00
void NoteData::ConvertHoldNotesTo2sAnd3s()
{
// copy HoldNotes into the new structure, but expand them into 2s and 3s
2002-11-02 22:59:12 +00:00
for( int i=0; i<GetNumHoldNotes(); i++ )
2002-04-16 17:31:00 +00:00
{
2002-11-02 22:53:04 +00:00
const HoldNote &hn = GetHoldNote(i);
/* If they're the same, then they got clamped together, so just ignore it. */
2003-12-16 04:00:39 +00:00
if( hn.iStartRow != hn.iEndRow )
{
SetTapNote( hn.iTrack, hn.iStartRow, TAP_ORIGINAL_HOLD_HEAD );
SetTapNote( hn.iTrack, hn.iEndRow, TAP_ORIGINAL_HOLD_TAIL );
}
2002-04-16 17:31:00 +00:00
}
2002-11-02 23:10:38 +00:00
m_HoldNotes.clear();
2002-04-16 17:31:00 +00:00
}
2004-10-23 17:43:49 +00:00
void NoteData::To2sAnd3s( const NoteData& from )
{
2004-10-23 17:43:49 +00:00
CopyAll( from );
2003-10-04 03:12:45 +00:00
ConvertHoldNotesTo2sAnd3s();
}
2004-10-23 17:43:49 +00:00
void NoteData::From2sAnd3s( const NoteData& from )
2003-10-04 03:12:45 +00:00
{
2004-10-23 17:43:49 +00:00
CopyAll( from );
2003-10-04 03:12:45 +00:00
Convert2sAnd3sToHoldNotes();
}
2004-10-23 17:43:49 +00:00
void NoteData::To4s( const NoteData& from )
2003-10-04 04:05:29 +00:00
{
2004-10-23 17:43:49 +00:00
CopyAll( from );
2003-10-04 04:05:29 +00:00
ConvertHoldNotesTo4s();
}
2004-10-23 17:43:49 +00:00
void NoteData::From4s( const NoteData& from )
2003-10-04 04:05:29 +00:00
{
2004-10-23 17:43:49 +00:00
CopyAll( from );
2003-10-04 04:05:29 +00:00
Convert4sToHoldNotes();
}
2002-08-25 05:00:23 +00:00
/* "104444001" ==
* "102000301"
*
* "4441" basically means "hold for three rows then hold for another tap";
* since taps don't really have a length, it's equivalent to "4440".
* So, make sure the character after a 4 is always a 0. */
void NoteData::Convert4sToHoldNotes()
{
for( int t=0; t<GetNumTracks(); t++ ) // foreach column
2002-08-25 05:00:23 +00:00
{
2004-10-24 10:20:24 +00:00
FOREACH_NONEMPTY_ROW_IN_TRACK( *this, t, r )
2002-08-25 05:00:23 +00:00
{
2004-10-24 10:20:24 +00:00
if( GetTapNote(t, r).type == TapNote::hold ) // this is a HoldNote body
{
2004-10-24 10:20:24 +00:00
HoldNote hn( t, r, 0 );
// search for end of HoldNote
do {
2004-10-24 10:20:24 +00:00
SetTapNote( t, r, TAP_EMPTY );
r++;
} while( GetTapNote(t, r).type == TapNote::hold );
SetTapNote( t, r, TAP_EMPTY );
2002-08-25 05:00:23 +00:00
2004-10-24 10:20:24 +00:00
hn.iEndRow = r;
AddHoldNote( hn );
}
2002-08-25 05:00:23 +00:00
}
}
}
void NoteData::ConvertHoldNotesTo4s()
{
// copy HoldNotes into the new structure, but expand them into 4s
2002-11-02 22:59:12 +00:00
for( int i=0; i<GetNumHoldNotes(); i++ )
2002-08-25 05:00:23 +00:00
{
2002-11-02 22:53:04 +00:00
const HoldNote &hn = GetHoldNote(i);
2003-12-16 04:00:39 +00:00
for( int j = hn.iStartRow; j < hn.iEndRow; ++j)
SetTapNote(hn.iTrack, j, TAP_ORIGINAL_HOLD);
2002-08-25 05:00:23 +00:00
}
2002-11-02 23:10:38 +00:00
m_HoldNotes.clear();
2002-08-25 05:00:23 +00:00
}
// -1 for iOriginalTracksToTakeFrom means no track
2004-10-23 17:43:49 +00:00
void NoteData::LoadTransformed( const NoteData& original, int iNewNumTracks, const int iOriginalTrackToTakeFrom[] )
2002-04-16 17:31:00 +00:00
{
// reset all notes
2002-07-03 21:27:26 +00:00
Init();
2002-04-16 17:31:00 +00:00
NoteData Original;
2004-10-23 17:43:49 +00:00
Original.To4s( original );
2002-10-20 19:34:17 +00:00
Config( Original );
2004-09-25 07:59:56 +00:00
SetNumTracks( iNewNumTracks );
2002-04-16 17:31:00 +00:00
// copy tracks
2004-09-28 02:14:56 +00:00
for( int t=0; t<GetNumTracks(); t++ )
2002-04-16 17:31:00 +00:00
{
const int iOriginalTrack = iOriginalTrackToTakeFrom[t];
2004-09-25 07:59:56 +00:00
ASSERT_M( iOriginalTrack < Original.GetNumTracks(), ssprintf("from %i >= %i (to %i)",
iOriginalTrack, Original.GetNumTracks(), iOriginalTrackToTakeFrom[t]));
2002-12-28 16:07:19 +00:00
if( iOriginalTrack == -1 )
continue;
2004-05-24 04:26:54 +00:00
m_TapNotes[t] = Original.m_TapNotes[iOriginalTrack];
2002-04-16 17:31:00 +00:00
}
Convert4sToHoldNotes();
2002-04-16 17:31:00 +00:00
}
2002-06-24 22:04:31 +00:00
2004-10-24 10:20:24 +00:00
void NoteData::MoveTapNoteTrack( int dest, int src )
2002-11-02 21:04:00 +00:00
{
if(dest == src) return;
2004-05-24 04:26:54 +00:00
m_TapNotes[dest] = m_TapNotes[src];
m_TapNotes[src].clear();
2002-11-02 21:04:00 +00:00
}
2004-10-24 10:20:24 +00:00
void NoteData::SetTapNote( int track, int row, const TapNote& t )
{
2004-09-25 07:59:56 +00:00
DEBUG_ASSERT( track>=0 && track<GetNumTracks() );
if( row < 0 )
return;
2002-12-13 01:23:26 +00:00
// There's no point in inserting empty notes into the map.
// Any blank space in the map is defined to be empty.
// If we're trying to insert an empty at a spot where
// another note already exists, then we're really deleting
// from the map.
if( t == TAP_EMPTY )
{
TrackMap &trackMap = m_TapNotes[track];
// remove the element at this position (if any). This will return either 0 or 1.
2004-10-02 05:08:59 +00:00
trackMap.erase( row );
}
else
{
m_TapNotes[track][row] = t;
}
}
2003-09-21 23:16:44 +00:00
2004-05-15 03:00:43 +00:00
void NoteData::GetTracksHeldAtRow( int row, set<int>& addTo )
2003-11-07 05:17:41 +00:00
{
for( unsigned i=0; i<m_HoldNotes.size(); i++ )
{
const HoldNote& hn = m_HoldNotes[i];
2003-12-16 04:00:39 +00:00
if( hn.RowIsInRange(row) )
2004-05-15 03:00:43 +00:00
addTo.insert( hn.iTrack );
2003-11-07 05:17:41 +00:00
}
2003-11-07 09:27:28 +00:00
}
int NoteData::GetNumTracksHeldAtRow( int row )
{
2004-05-15 03:00:43 +00:00
static set<int> viTracks;
2003-11-07 09:27:28 +00:00
viTracks.clear();
GetTracksHeldAtRow( row, viTracks );
return viTracks.size();
2003-11-10 01:34:55 +00:00
}
2004-05-31 22:42:12 +00:00
bool NoteData::GetNextTapNoteRowForTrack( int track, int &rowInOut ) const
{
const TrackMap &mapTrack = m_TapNotes[track];
// lower_bound and upper_bound have the same effect here because duplicate
// keys aren't allowed.
2004-10-24 23:49:33 +00:00
//
// lower_bound "finds the first element whose key is not less than k" (>=);
// upper_bound "finds the first element whose key greater than k". They don't
// have the same effect, but lower_bound(row+1) should equal upper_bound(row). -glenn
TrackMap::const_iterator iter = mapTrack.lower_bound( rowInOut+1 ); // "find the first note for which row+1 < key == false"
2004-10-24 23:49:33 +00:00
if( iter == mapTrack.end() )
return false;
2004-10-24 23:49:33 +00:00
ASSERT( iter->first > rowInOut );
rowInOut = iter->first;
return true;
}
2004-10-25 00:25:49 +00:00
bool NoteData::GetPrevTapNoteRowForTrack( int track, int &rowInOut ) const
{
const TrackMap &mapTrack = m_TapNotes[track];
/* Find the first note >= rowInOut. */
TrackMap::const_iterator iter = mapTrack.lower_bound( rowInOut );
/* If we're at the beginning, we can't move back any more. */
if( iter == mapTrack.begin() )
return false;
/* Move back by one. */
--iter;
ASSERT( iter->first < rowInOut );
rowInOut = iter->first;
return true;
}
bool NoteData::GetNextTapNoteRowForAllTracks( int &rowInOut ) const
{
int iClosestNextRow = 999999;
bool bAnyHaveNextNote = false;
for( int t=0; t<GetNumTracks(); t++ )
{
int iNewRowThisTrack = rowInOut;
if( GetNextTapNoteRowForTrack( t, iNewRowThisTrack ) )
{
bAnyHaveNextNote = true;
iClosestNextRow = min( iClosestNextRow, iNewRowThisTrack );
}
}
if( bAnyHaveNextNote )
{
rowInOut = iClosestNextRow;
return true;
}
else
{
return false;
}
}
2004-05-31 22:42:12 +00:00
/*
* (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.
*/