actions/itgmania212121
1
0
Fork 0
Code Issues Pull Requests Actions 1 Packages Projects Releases Wiki Activity

simplify (no logic change)

Browse Source
This commit is contained in:
Glenn Maynard
2004-10-24 23:49:33 +00:00
parent 2ad02a8332
commit dafce575db
1 changed files with 9 additions and 9 deletions
Download Patch File Download Diff File Expand all files Collapse all files
stepmania/src/NoteData.cpp
+7 -7
View File
@@ -775,17 +775,17 @@ bool NoteData::GetNextTapNoteRowForTrack( int track, int &rowInOut ) const
// lower_bound and upper_bound have the same effect here because duplicate // lower_bound and upper_bound have the same effect here because duplicate
// keys aren't allowed. // keys aren't allowed.
//
// 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" TrackMap::const_iterator iter = mapTrack.lower_bound( rowInOut+1 ); // "find the first note for which row+1 < key == false"
if( iter != mapTrack.end() ) if( iter == mapTrack.end() )
{ return false;
ASSERT( iter->first > rowInOut ); ASSERT( iter->first > rowInOut );
rowInOut = iter->first; rowInOut = iter->first;
return true; return true;
}
else
{
return false;
}
} }
bool NoteData::GetNextTapNoteRowForAllTracks( int &rowInOut ) const bool NoteData::GetNextTapNoteRowForAllTracks( int &rowInOut ) const