5 #include "resolution.h"
6 #include "groupscreen.h"
7 #include "fetch_group.h"
8 #include "fetch_max_score_for_songs.h"
9 #include "fetch_max_score_for_players.h"
10 #include "fetch_needs_update.h"
11 #include "fetch_highscore.h"
14 GroupScreen::GroupScreen(pqxx::connection &conn, unsigned tournament, unsigned round, unsigned parallel, unsigned machine, unsigned num_machines, unsigned players_per_machine)
15 : tournament(tournament), round(round), parallel(parallel), machine(machine), num_machines(num_machines), players_per_machine(players_per_machine), scores_changed(conn, "scores"), conn(conn), valid(false)
19 GroupScreen::~GroupScreen()
23 bool GroupScreen::check_invalidated()
27 if (!scores_changed.get_flag())
31 conn.perform(FetchNeedsUpdate(last_updated, tournament, round, parallel, &needs_update));
34 scores_changed.reset_flag();
39 unsigned GroupScreen::get_show_players(const Group &group)
41 unsigned num_players_this_machine = (group.players.size() + num_machines - machine - 1) / num_machines;
42 return std::min(num_players_this_machine, 9U);
45 void GroupScreen::draw_main_heading(std::vector<TextDefer> &td)
48 if (num_machines == 1) {
50 std::sprintf(heading, "Round %u", round);
52 std::sprintf(heading, "Round %u, Group %u", round, parallel);
56 std::sprintf(heading, "Round %u, Machine %u", round, machine + 1);
58 std::sprintf(heading, "Round %u, Group %u, Machine %u", round, parallel, machine + 1);
62 unsigned width = my_draw_text(heading, NULL, 40.0);
63 my_draw_text_deferred(td, heading, 40.0, LOGICAL_SCREEN_WIDTH/2 - width/2, 60);
66 // make column headings from the first player's songs
67 void GroupScreen::draw_column_headings(std::vector<TextDefer> &td, const Group &group, const std::vector<unsigned> &colwidth)
69 unsigned num_scores = group.players[0].scores.size();
72 unsigned x = 40 + colwidth[0];
73 for (std::vector<Score>::const_iterator i = group.players[0].scores.begin(); i != group.players[0].scores.end(); ++i, ++col) {
75 unsigned this_width = my_draw_text(i->song.short_title, NULL, 12.0);
76 my_draw_text_deferred(td, i->song.short_title, 12.0, x + colwidth[col] / 2 - this_width / 2, 100);
78 x += colwidth[col] + 20;
81 my_draw_text_deferred(td, "Total", 12.0, x + colwidth[num_scores + 1] / 2 - my_draw_text("Total", NULL, 12.0) / 2, 100);
82 x += colwidth[num_scores + 1] + 20;
83 my_draw_text_deferred(td, "Rank", 12.0, x + colwidth[num_scores + 2] / 2 - my_draw_text("Rank", NULL, 12.0) / 2, 100);
86 // show all the players and the scores
87 void GroupScreen::draw_scores(std::vector<TextDefer> &td, const Group &group, const std::vector<unsigned> &colwidth)
89 unsigned max_num_width = my_draw_text("8888", NULL, 22.0);
90 unsigned num_scores = group.players[0].scores.size();
91 unsigned show_players = get_show_players(group);
92 unsigned y = (show_players <= 7) ? 140 : (140 - (show_players - 7) * 5);
94 unsigned row = 0, m = 0, x;
95 for (std::vector<Player>::const_iterator i = group.players.begin(); i != group.players.end() && row < 9; ++i) {
96 if (m++ % num_machines != machine)
99 my_draw_text_deferred(td, i->nick, 18.0, 20, y);
101 x = 40 + colwidth[0];
104 for (std::vector<Score>::const_iterator j = i->scores.begin(); j != i->scores.end(); ++j, ++col) {
106 if (j->score != -1) {
107 std::sprintf(text, "%u", j->score);
110 unsigned this_width = my_draw_text(text, NULL, 22.0);
112 my_draw_text_deferred(td, text, 22.0, x + max_num_width - this_width, y);
114 // draw the long name if we can, otherwise use the short one
115 if (my_draw_text(j->song.title, NULL, 12.0) > (colwidth[col] - 10 - max_num_width)) {
116 my_draw_text_deferred(td, j->song.short_title, 12.0, x + max_num_width + 10, y);
118 my_draw_text_deferred(td, j->song.title, 12.0, x + max_num_width + 10, y);
121 my_draw_text_deferred(td, text, 22.0, x + colwidth[col] / 2 - this_width / 2, y);
123 x += colwidth[col] + 20;
129 std::sprintf(text, "%u", i->total);
131 unsigned this_width = my_draw_text(text, NULL, 22.0);
132 my_draw_text_deferred(td, text, 22.0, x + colwidth[num_scores + 1] / 2 - this_width / 2, y);
133 x += colwidth[num_scores + 1] + 20;
136 if (show_players > 7)
137 y += 40 - (show_players - 7) * 4;
145 * Find out how wide each column has to be. First try unlimited width (ie.
146 * long titles for everything); if that gets too long, try again with short
147 * titles for chosen songs.
149 void GroupScreen::find_column_widths(const Group &group, std::vector<unsigned> &colwidth)
152 unsigned max_num_width = my_draw_text("8888", NULL, 22.0);
153 unsigned sumcolwidth;
155 for (unsigned mode = 0; mode < 2; ++mode) {
156 for (std::vector<Player>::const_iterator i = group.players.begin(); i != group.players.end(); ++i) {
159 if (colwidth.size() == 0)
160 colwidth.push_back(0);
162 colwidth[0] = std::max(colwidth[0], my_draw_text(i->nick, NULL, 18.0));
164 for (std::vector<Score>::const_iterator j = i->scores.begin(); j != i->scores.end(); ++j, ++col) {
165 if (colwidth.size() < col+1)
166 colwidth.push_back(0);
169 colwidth[col] = std::max(colwidth[col], my_draw_text((mode == 0) ? j->song.title : j->song.short_title, NULL, 12.0) +
172 colwidth[col] = std::max(colwidth[col], my_draw_text(j->song.short_title, NULL, 12.0));
173 colwidth[col] = std::max(colwidth[col], max_num_width);
178 num_scores = group.players[0].scores.size();
180 if (colwidth.size() < num_scores + 2) {
181 colwidth.push_back(0);
182 colwidth.push_back(0);
185 colwidth[num_scores + 1] = std::max(my_draw_text("Total", NULL, 12.0), max_num_width);
186 colwidth[num_scores + 2] = my_draw_text("Rank", NULL, 12.0);
188 // if we're at long titles and that works, don't try the short ones
191 for (unsigned i = 0; i <= num_scores + 2; ++i)
192 sumcolwidth += colwidth[i] + 20;
194 if (sumcolwidth < 780)
199 * If we have space to go, distribute as much as we can to the chosen song column, so we won't have
200 * total and rank jumping around.
202 if (sumcolwidth < 780) {
203 int first_chosen_col = -1;
206 for (std::vector<Score>::const_iterator i = group.players[0].scores.begin(); i != group.players[0].scores.end(); ++i, ++col) {
208 first_chosen_col = col;
213 if (first_chosen_col != -1) {
214 colwidth[first_chosen_col] += 780 - sumcolwidth;
219 /* Find the first player with the fewest songs played and part of this machine. */
220 const Player *GroupScreen::get_next_player(const Group &group)
222 unsigned min_played_songs = 9999;
223 const Player *next_player = NULL;
225 for (std::vector<Player>::const_iterator i = group.players.begin(); i != group.players.end(); ++i) {
226 unsigned this_played = 0;
227 for (std::vector<Score>::const_iterator j = i->scores.begin(); j != i->scores.end(); ++j) {
232 if ((m++ % num_machines == machine) && this_played < min_played_songs) {
233 min_played_songs = this_played;
242 * At the bottom, for a single player, is "who's playing, what will he/she be
243 * playing, and optionally, how much to lead/win and how much to secure
244 * qualification" (the last one only in the final round). We assume playing is
245 * done in a modified zigzag; all the random songs are played first in
246 * zigzag/wrapping order (player 1 song 1, player 2 song 2, player 3 song 3,
247 * player 1 song 2, player 2 song 3, player 3 song 1, etc... assuming three
248 * songs and three players) and then all the chosen songs are played (we assume
249 * only one chosen song).
251 * The lines are as follows:
255 * High score: <hs> by <hsplayer> at <hsevent>
256 * Needs to lead: <leadscore>
257 * Needs to secure qualification: <qualscore>
258 * Needs to win group: <winscore>
260 void GroupScreen::draw_next_up_single(unsigned char *buf, const Group &group,
261 std::map<unsigned, unsigned> &song_scores, std::map<unsigned, unsigned> &player_scores,
262 const std::vector<unsigned> &max_score, const std::vector<unsigned> &min_score)
264 unsigned num_scores = group.players[0].scores.size();
266 // Find out how many random songs there are (equal for all players).
267 unsigned num_random_songs = 0;
268 for (std::vector<Score>::const_iterator i = group.players[0].scores.begin(); i != group.players[0].scores.end(); ++i) {
274 * Find out which player is next, and what song he she is supposed to play. First
277 const Player *next_player = get_next_player(group);
278 const Score *next_song = NULL;
280 for (unsigned i = 0; i < num_random_songs; ++i) {
281 unsigned j = (i + next_player->position - 1) % num_random_songs;
282 if (next_player->scores[j].score == -1) {
283 next_song = &(next_player->scores[j]);
288 // then all songs, if that didn't work out (slightly icky, but hey)
289 if (next_song == NULL) {
290 for (unsigned i = 0; i < num_scores; ++i) {
291 unsigned j = (i + next_player->position) % num_scores;
292 if (next_player->scores[j].score == -1) {
293 next_song = &(next_player->scores[j]);
299 if (next_song != NULL) {
300 // find out how many songs we've played in all
301 unsigned num_played = 0;
302 for (unsigned i = 0; i < num_scores; ++i) {
303 if (next_player->scores[i].score != -1) {
308 bool last_song = (num_played == num_scores - 1);
310 draw_next_up_player(buf, group, *next_player, *next_song, last_song, song_scores, player_scores, max_score, min_score);
315 * Some tournaments allow versus play in the initial rounds to save time; this is
316 * of course for random songs only. In this case, the scheme from draw_next_up_single()
317 * is somewhat changed, as we zig-zag across pairs instead of players. (If there's a
318 * stray person left in the group, that player plays the song by him-/herself as in
319 * a usual single tournament.
321 void GroupScreen::draw_next_up_versus(unsigned char *buf, const Group &group,
322 std::map<unsigned, unsigned> &song_scores, std::map<unsigned, unsigned> &player_scores,
323 const std::vector<unsigned> &max_score, const std::vector<unsigned> &min_score)
325 // Find out how many random songs there are (equal for all players).
326 unsigned num_random_songs = 0;
327 for (std::vector<Score>::const_iterator i = group.players[0].scores.begin(); i != group.players[0].scores.end(); ++i) {
332 // Find the next player and what song he/she is supposed to play, if any.
333 const Player *next_player = get_next_player(group);
334 const Score *next_song = NULL;
337 for (unsigned i = 0; i < num_random_songs; ++i) {
338 unsigned j = (i + (next_player->position - 1) / 2) % num_random_songs;
339 if (next_player->scores[j].score == -1) {
340 next_song = &(next_player->scores[j]);
347 * If there's no match, we're on the chosen songs (or done),
348 * so just delegate to draw_up_single().
350 if (next_song == NULL) {
351 draw_next_up_single(buf, group, song_scores, player_scores, max_score, min_score);
356 * Look for a player with the same amount of random songs played _and_ missing
359 unsigned num_songs_played = 0;
360 for (unsigned i = 0; i < num_random_songs; ++i) {
361 if (next_player->scores[i].score != -1) {
367 const Player *other_player = NULL;
368 for (std::vector<Player>::const_iterator i = group.players.begin(); i != group.players.end(); ++i) {
369 if ((m++ % num_machines != machine))
371 if (i->id == next_player->id)
374 unsigned this_songs_played = 0;
375 for (unsigned j = 0; j < num_random_songs; ++j) {
376 if (i->scores[j].score != -1) {
381 if (this_songs_played != num_songs_played)
384 if (i->scores[song_num].score == -1) {
385 other_player = &(*i);
390 // If we didn't find another player, just draw the one we have as usual.
391 if (other_player == NULL) {
392 draw_next_up_player(buf, group, *next_player, *next_song, false,
393 song_scores, player_scores, max_score, min_score);
397 // OK, we have two players. Draw their nicks and the scores
398 widestring text = widestring("Next players: ") + next_player->nick + widestring(" and ") + other_player->nick;
399 unsigned this_width = my_draw_text(text, NULL, 24.0);
400 my_draw_text(text, buf, 24.0, (LOGICAL_SCREEN_WIDTH/2) - this_width/2, 420);
402 if (next_song->song.id != -1) {
403 this_width = my_draw_text(next_song->song.title, NULL, 20.0);
404 my_draw_text(next_song->song.title, buf, 20.0, (LOGICAL_SCREEN_WIDTH/2) - this_width/2, 457);
407 conn.perform(FetchHighscore(next_song->song.id, &hs));
409 if (hs.score != -1) {
410 text = widestring("High score: ") + widestring(pqxx::to_string(hs.score)) +
411 widestring(", by ") + hs.nick + widestring(" in ") + hs.tournament_name;
412 this_width = my_draw_text(text, NULL, 16.0);
413 my_draw_text(text, buf, 16.0, (LOGICAL_SCREEN_WIDTH/2) - this_width/2, 487);
418 void GroupScreen::draw_next_up_player(unsigned char *buf, const Group &group, const Player &player, const Score &song, bool last_song,
419 std::map<unsigned, unsigned> &song_scores, std::map<unsigned, unsigned> &player_scores,
420 const std::vector<unsigned> &max_score, const std::vector<unsigned> &min_score)
422 widestring text = widestring("Next player: ") + player.nick;
423 unsigned this_width = my_draw_text(text, NULL, 24.0);
424 my_draw_text(text, buf, 24.0, (LOGICAL_SCREEN_WIDTH/2) - this_width/2, 420);
426 if (song.song.id != -1) {
427 this_width = my_draw_text(song.song.title, NULL, 20.0);
428 my_draw_text(song.song.title, buf, 20.0, (LOGICAL_SCREEN_WIDTH/2) - this_width/2, 457);
431 conn.perform(FetchHighscore(song.song.id, &hs));
433 if (hs.score != -1) {
434 text = widestring("High score: ") + widestring(pqxx::to_string(hs.score)) +
435 widestring(", by ") + hs.nick + widestring(" in ") + hs.tournament_name;
436 this_width = my_draw_text(text, NULL, 16.0);
437 my_draw_text(text, buf, 16.0, (LOGICAL_SCREEN_WIDTH/2) - this_width/2, 487);
441 // only show lead/win/qualify for the last song
444 * Find out how much we need to lead, how much we need to be guaranteed
445 * to win the group, and how much we need to secure qualification.
448 // find the best score we can get
449 unsigned max_score_this_song;
450 if (song.song.id != -1) {
451 // random song, or we know what song the player picked
452 max_score_this_song = song_scores[song.song.id];
454 max_score_this_song = player_scores[player.id];
459 // see what score this player must beat to lead
460 unsigned lead_beat = 0, win_beat = 0;
461 for (unsigned i = 0; i < group.players.size(); ++i) {
462 if (group.players[i].id == player.id)
465 lead_beat = std::max(lead_beat, group.players[i].total);
468 // find the best max score among the others
469 for (unsigned i = 0; i < group.players.size(); ++i) {
470 if (group.players[i].id == player.id)
473 win_beat = std::max(win_beat, max_score[i]);
477 * There's a somewhat subtle point here. Normally, what a player would be interested in
478 * with regard to qualification would be a set of three values:
480 * 1. How much is the absolute minimum required to qualify, given that all others
482 * 2. How much will give a reasonable chance of qualifying, given the expected performance
484 * 3. How much will be enough to secure qualification, no matter what?
486 * Given perfect guessing, #2 would be "how much is needed to qualify"; however, it is
487 * completely impossible to give an exact value for that, and we're not into the guessing
488 * games. :-) #1 is often so low it's completely unrealistic (ie. far enough from #2 that
489 * it's not interesting), but #3, the most conservative estimate, is often a good measure.
490 * #3 is "how much is needed to _secure_ qualification", and that is usually what we
491 * print out when it's possible.
493 * However, in a few situations, #1 and #3 will be the exact same value, from which it
494 * follows (from the squeeze law, or just common sense :-) ) that #2 will be the same
495 * value as #1 and #3. (This usually happens near or at the end of a group.) In that
496 * case, we know the value we seek (ie. "how much is needed to qualify"), so we drop
497 * the word "secure" and just print it as-is.
499 * To find #1 and #3, we sort and pick out the values we need to beat in the best and
502 int qualify_beat_worst_case = -1, qualify_beat_best_case = -1;
504 if (group.num_qualifying > 0) {
505 std::vector<unsigned> tmp;
507 for (unsigned i = 0; i < group.players.size(); ++i) {
508 if (group.players[i].id == player.id)
510 tmp.push_back(max_score[i]);
512 std::sort(tmp.begin(), tmp.end());
513 qualify_beat_worst_case = tmp[tmp.size() - group.num_qualifying];
515 std::vector<unsigned> tmp2;
516 for (unsigned i = 0; i < group.players.size(); ++i) {
517 if (group.players[i].id == player.id)
519 tmp2.push_back(min_score[i]);
522 std::sort(tmp2.begin(), tmp2.end());
523 qualify_beat_best_case = tmp2[tmp2.size() - group.num_qualifying];
526 // print out the lines we can attain
527 if (player.total + max_score_this_song > lead_beat && (lead_beat != win_beat)) {
528 int lead_need = std::max(lead_beat - player.total + 1, 0U);
531 text = widestring("Needs to lead: ") + widestring(pqxx::to_string(lead_need));
532 this_width = my_draw_text(text, NULL, 18.0);
533 my_draw_text(text, buf, 18.0, (LOGICAL_SCREEN_WIDTH/2) - this_width/2, y);
539 if (player.total + max_score_this_song > win_beat) {
540 int win_need = std::max(win_beat - player.total + 1, 0U);
543 text = widestring("Needs to win: ") + widestring(pqxx::to_string(win_need));
545 this_width = my_draw_text(text, NULL, 18.0);
546 my_draw_text(text, buf, 18.0, (LOGICAL_SCREEN_WIDTH/2) - this_width/2, y);
552 if (group.num_qualifying > 0 &&
553 group.num_qualifying != group.players.size() &&
554 player.total + max_score_this_song > unsigned(qualify_beat_worst_case) &&
555 (unsigned(qualify_beat_worst_case) != win_beat)) {
556 int qual_need = std::max(qualify_beat_worst_case - player.total + 1, 0U);
559 if (qualify_beat_worst_case == qualify_beat_best_case) {
560 text = widestring("Needs to qualify: ") + widestring(pqxx::to_string(qual_need));
562 text = widestring("Needs to secure qualification: ") + widestring(pqxx::to_string(qual_need));
565 this_width = my_draw_text(text, NULL, 18.0);
566 my_draw_text(text, buf, 18.0, (LOGICAL_SCREEN_WIDTH/2) - this_width/2, y);
574 // some refactoring done, more should be
575 void GroupScreen::draw(unsigned char *buf, unsigned width, unsigned height)
577 std::vector<TextDefer> td;
579 scores_changed.reset_flag();
580 set_screen_size(width, height);
583 * We'll probably need some values from here later on (although not all), just fetch them
584 * all while we're at it.
586 std::map<unsigned, unsigned> song_scores, player_scores;
587 conn.perform(FetchMaxScoreForSongs(tournament, &song_scores));
588 conn.perform(FetchMaxScoreForPlayers(tournament, round, &player_scores));
591 conn.perform(FetchGroup(tournament, round, parallel, &group));
592 gettimeofday(&last_updated, NULL);
594 memset(buf, 0, width * height * 4);
596 std::vector<unsigned> colwidth;
598 draw_main_heading(td);
599 find_column_widths(group, colwidth);
600 draw_column_headings(td, group, colwidth);
601 draw_scores(td, group, colwidth);
603 unsigned num_scores = group.players[0].scores.size();
606 * Approximate (but probably working quite well in practice) heuristic
607 * for finding the min and max rank of a player works as follows:
609 * First of all, find out, for each player in the group, what the
610 * maximum remaining score possibly can be (the minimum score is of
611 * course identical to the player's current total). For a random song,
612 * this is of course 1000 * (maximum feet rating) (but of course, that
613 * depends on whether we can play single or double! for now, assume
614 * double is okay, but this logic will be deferred to FetchMaxScore
615 * anyhow); for a random song, we simply pick the highest-ranking song
616 * we can find, EXCEPT those the player has chosen earlier AND the
617 * random songs this round, AND all random songs from elimination rounds
618 * (ie. rounds with only one group). (Phew!) This doesn't solve problems
619 * we'd face with more than one chosen song, but it should be good enough.
621 * After we've found the max and min scores for all players, it's a simple
622 * matter of sorting; the best attainable rank for player X is obtained if
623 * X gets max score and all others get min score, the worst attainable rank
624 * is obtained if X gets min score and all others get max score.
626 std::vector<unsigned> max_score, min_score;
627 for (std::vector<Player>::const_iterator i = group.players.begin(); i != group.players.end(); ++i) {
628 unsigned min_score_tp = 0, max_score_tp = 0;
629 for (std::vector<Score>::const_iterator j = i->scores.begin(); j != i->scores.end(); ++j) {
630 if (j->score != -1) {
632 min_score_tp += j->score;
633 max_score_tp += j->score;
635 unsigned max_score_this_song;
636 if (j->song.id != -1) {
637 // random song, or we know what song the player picked
638 max_score_this_song = song_scores[j->song.id];
640 max_score_this_song = player_scores[i->id];
642 max_score_tp += max_score_this_song;
645 max_score.push_back(max_score_tp);
646 min_score.push_back(min_score_tp);
649 // now finally find min and max rank, and draw it all
650 unsigned show_players = get_show_players(group);
651 unsigned y = (show_players <= 7) ? 140 : (140 - (show_players - 7) * 5);
652 for (unsigned i = 0; i < group.players.size() && (i/num_machines) < show_players; ++i) {
653 unsigned best_rank = 1, worst_rank = 1;
654 for (unsigned j = 0; j < group.players.size(); ++j) {
658 if (max_score[i] < min_score[j])
660 if (min_score[i] <= max_score[j])
665 if (best_rank == worst_rank)
666 std::sprintf(text, "%u", best_rank);
668 std::sprintf(text, "%u-%u", best_rank, worst_rank);
670 if (i % num_machines != machine)
673 // find out where to place this
674 unsigned x = 40 + colwidth[0];
675 for (unsigned j = 1; j <= num_scores + 1; ++j)
676 x += colwidth[j] + 20;
678 unsigned this_width = my_draw_text(text, NULL, 22.0);
679 my_draw_text_deferred(td, text, 22.0, x + colwidth[num_scores + 2] / 2 - this_width / 2, y);
681 if (show_players > 7)
682 y += 40 - (show_players - 7) * 4;
687 if (players_per_machine == 2)
688 draw_next_up_versus(buf, group, song_scores, player_scores, max_score, min_score);
690 draw_next_up_single(buf, group, song_scores, player_scores, max_score, min_score);
693 draw_all_deferred_text(buf, td, last_text);
697 int GroupScreen::get_priority()