#include "groupscreen.h"
#include "fetch_group.h"
#include "fetch_max_score_for_songs.h"
-#include "fetch_max_score_for_player.h"
+#include "fetch_max_score_for_players.h"
#include "fetch_needs_update.h"
#include "fetch_highscore.h"
#include "fonts.h"
* We'll probably need some values from here later on (although not all), just fetch them
* all while we're at it.
*/
- std::map<unsigned, unsigned> song_scores;
+ std::map<unsigned, unsigned> song_scores, player_scores;
conn.perform(FetchMaxScoreForSongs(tournament, &song_scores));
+ conn.perform(FetchMaxScoreForPlayers(tournament, round, &player_scores));
Group group;
conn.perform(FetchGroup(tournament, round, parallel, &group));
* matter of sorting; the best attainable rank for player X is obtained if
* X gets max score and all others get min score, the worst attainable rank
* is obtained if X gets min score and all others get max score.
- *
- * This is a bit SQL-heavy, but heck...
*/
std::vector<unsigned> max_score, min_score;
for (std::vector<Player>::const_iterator i = group.players.begin(); i != group.players.end(); ++i) {
// random song, or we know what song the player picked
max_score_this_song = song_scores[j->song.id];
} else {
- conn.perform(FetchMaxScoreForPlayer(tournament, i->id, round, &max_score_this_song));
+ max_score_this_song = player_scores[i->id];
}
max_score_tp += max_score_this_song;
}
// random song, or we know what song the player picked
max_score_this_song = song_scores[next_song->song.id];
} else {
- conn.perform(FetchMaxScoreForPlayer(tournament, next_player->id, round, &max_score_this_song));
+ max_score_this_song = player_scores[next_player->id];
}
unsigned y = 520;