- std::vector<TextDefer> td;
-
- scores_changed.reset_flag();
- set_screen_size(width, height);
-
- /*
- * 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, player_scores;
- conn.perform(FetchMaxScoreForSongs(tournament, &song_scores));
- conn.perform(FetchMaxScoreForPlayers(tournament, round, &player_scores));
-
- Group group;
- conn.perform(FetchGroup(tournament, round, parallel, &group));
- gettimeofday(&last_updated, NULL);
-
- memset(buf, 0, width * height * 4);
-
- std::vector<unsigned> colwidth;
-
- draw_main_heading(td);
- find_column_widths(group, colwidth);
-
- unsigned max_num_width = my_draw_text("8888", NULL, 22.0);
- unsigned num_scores = group.players[0].scores.size();
-
- // make column headings from the first player's songs
- unsigned col = 1;
- unsigned x = 40 + colwidth[0];
- for (std::vector<Score>::const_iterator i = group.players[0].scores.begin(); i != group.players[0].scores.end(); ++i, ++col) {
- if (!i->chosen) {
- unsigned this_width = my_draw_text(i->song.short_title, NULL, 12.0);
- my_draw_text_deferred(td, i->song.short_title, 12.0, x + colwidth[col] / 2 - this_width / 2, 100);
- }
- x += colwidth[col] + 20;
- }
-
- my_draw_text_deferred(td, "Total", 12.0, x + colwidth[num_scores + 1] / 2 - my_draw_text("Total", NULL, 12.0) / 2, 100);
- x += colwidth[num_scores + 1] + 20;
- my_draw_text_deferred(td, "Rank", 12.0, x + colwidth[num_scores + 2] / 2 - my_draw_text("Rank", NULL, 12.0) / 2, 100);
-
- // show all the players and the scores
- unsigned num_players_this_machine = (group.players.size() + num_machines - machine - 1) / num_machines;
- unsigned show_players = std::min(num_players_this_machine, 9U);
- unsigned y = (show_players <= 7) ? 140 : (140 - (show_players - 7) * 5);
-
- unsigned row = 0, m = 0;
- for (std::vector<Player>::const_iterator i = group.players.begin(); i != group.players.end() && row < 9; ++i) {
- if (m++ % num_machines != machine)
- continue;
-
- my_draw_text_deferred(td, i->nick, 18.0, 20, y);
-
- unsigned x = 40 + colwidth[0];
-
- unsigned col = 1;
- for (std::vector<Score>::const_iterator j = i->scores.begin(); j != i->scores.end(); ++j, ++col) {
- char text[16] = "";
- if (j->score != -1) {
- std::sprintf(text, "%u", j->score);
- }
-
- unsigned this_width = my_draw_text(text, NULL, 22.0);
- if (j->chosen) {
- my_draw_text_deferred(td, text, 22.0, x + max_num_width - this_width, y);
-
- // draw the long name if we can, otherwise use the short one
- if (my_draw_text(j->song.title, NULL, 12.0) > (colwidth[col] - 10 - max_num_width)) {
- my_draw_text_deferred(td, j->song.short_title, 12.0, x + max_num_width + 10, y);
- } else {
- my_draw_text_deferred(td, j->song.title, 12.0, x + max_num_width + 10, y);
- }
- } else {
- my_draw_text_deferred(td, text, 22.0, x + colwidth[col] / 2 - this_width / 2, y);
- }
- x += colwidth[col] + 20;
- }
-
- // draw total
- {
- char text[16];
- std::sprintf(text, "%u", i->total);
-
- unsigned this_width = my_draw_text(text, NULL, 22.0);
- my_draw_text_deferred(td, text, 22.0, x + colwidth[num_scores + 1] / 2 - this_width / 2, y);
- x += colwidth[num_scores + 1] + 20;
- }
-
- if (show_players > 7)
- y += 40 - (show_players - 7) * 4;
- else
- y += 40;
- ++row;
-
- }
-
- /*
- * Approximate (but probably working quite well in practice) heuristic
- * for finding the min and max rank of a player works as follows:
- *
- * First of all, find out, for each player in the group, what the
- * maximum remaining score possibly can be (the minimum score is of
- * course identical to the player's current total). For a random song,
- * this is of course 1000 * (maximum feet rating) (but of course, that
- * depends on whether we can play single or double! for now, assume
- * double is okay, but this logic will be deferred to FetchMaxScore
- * anyhow); for a random song, we simply pick the highest-ranking song
- * we can find, EXCEPT those the player has chosen earlier AND the
- * random songs this round, AND all random songs from elimination rounds
- * (ie. rounds with only one group). (Phew!) This doesn't solve problems
- * we'd face with more than one chosen song, but it should be good enough.
- *
- * After we've found the max and min scores for all players, it's a simple
- * 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.
- */
- std::vector<unsigned> max_score, min_score;