git.sesse.net Git - ccbs/blob - bigscreen/groupscreen.cpp

   1 #include <cstdio>
   2 #include <algorithm>
   3
   4 #include "groupscreen.h"
   5 #include "fetch_group.h"
   6 #include "fetch_max_score_for_song.h"
   7 #include "fetch_max_score_for_player.h"
   8 #include "fetch_needs_update.h"
   9 #include "fetch_highscore.h"
  10 #include "fonts.h"
  11
  12 GroupScreen::GroupScreen(pqxx::connection &conn, unsigned tournament, unsigned round, unsigned parallel)
  13         : tournament(tournament), round(round), parallel(parallel), scores_changed(conn, "scores"), conn(conn), valid(false)
  14 {
  15 }
  16
  17 GroupScreen::~GroupScreen()
  18 {
  19 }
  20
  21 bool GroupScreen::check_invalidated()
  22 {
  23         if (!valid)
  24                 return true;
  25         if (!scores_changed.get_flag())
  26                 return false;
  27
  28         bool needs_update;
  29         conn.perform(FetchNeedsUpdate(last_updated, tournament, round, parallel, &needs_update));
  30
  31         if (!needs_update)
  32                 scores_changed.reset_flag();
  33
  34         return needs_update;
  35 }
  36
  37 void GroupScreen::draw(unsigned char *buf)
  38 {
  39         std::vector<TextDefer> td;
  40
  41         scores_changed.reset_flag();
  42
  43         Group group;
  44         conn.perform(FetchGroup(tournament, round, parallel, &group));
  45         gettimeofday(&last_updated, NULL);
  46
  47         memset(buf, 0, 800 * 600 * 4);
  48
  49         // main heading
  50         char heading[64];
  51         if (parallel == 0) {
  52                 std::sprintf(heading, "Round %u", round);
  53         } else {
  54                 std::sprintf(heading, "Round %u, Group %u", round, parallel);
  55         }
  56
  57         {
  58                 unsigned width = my_draw_text(heading, NULL, 48.0);
  59                 my_draw_text_deferred(td, heading, 48.0, 800/2 - width/2, 60);
  60         }
  61
  62         // Find out how wide each column has to be. First try unlimited width (ie.
  63         // long titles for everything); if that gets too long, try again with short
  64         // titles for chosen songs.
  65         unsigned width[16], num_scores;
  66         unsigned max_num_width = my_draw_text("8888", NULL, 22.0);
  67         unsigned sumwidth;
  68         for (unsigned mode = 0; mode < 2; ++mode) {
  69                 for (unsigned i = 0; i < 16; ++i)
  70                         width[i] = 0;
  71
  72                 for (std::vector<Player>::const_iterator i = group.players.begin(); i != group.players.end(); ++i) {
  73                         unsigned col = 1;
  74                         width[0] = std::max(width[0], my_draw_text(i->nick, NULL, 18.0));
  75
  76                         for (std::vector<Score>::const_iterator j = i->scores.begin(); j != i->scores.end(); ++j, ++col) {
  77                                 if (j->chosen) {
  78                                         width[col] = std::max(width[col], my_draw_text((mode == 0) ? j->song.title : j->song.short_title, NULL, 12.0) +
  79                                                         max_num_width + 10);
  80                                 } else {
  81                                         width[col] = std::max(width[col], my_draw_text(j->song.short_title, NULL, 12.0));
  82                                         width[col] = std::max(width[col], max_num_width);
  83                                 }
  84                         }
  85                 }
  86
  87                 num_scores = group.players[0].scores.size();
  88
  89                 width[num_scores + 1] = std::max(my_draw_text("Total", NULL, 12.0), max_num_width);
  90                 width[num_scores + 2] = my_draw_text("Rank", NULL, 12.0);
  91
  92                 // if we're at long titles and that works, don't try the short ones
  93                 sumwidth = 0;
  94
  95                 for (unsigned i = 0; i <= num_scores + 2; ++i)
  96                         sumwidth += width[i] + 20;
  97
  98                 if (sumwidth < 780)
  99                         break;
 100         }
 101
 102         /*
 103          * If we have space to go, distribute as much as we can to the chosen song column, so we won't have
 104          * total and rank jumping around.
 105          */
 106         if (sumwidth < 780) {
 107                 int first_chosen_col = -1;
 108                 unsigned col = 1;
 109
 110                 for (std::vector<Score>::const_iterator i = group.players[0].scores.begin(); i != group.players[0].scores.end(); ++i, ++col) {
 111                         if (i->chosen) {
 112                                 first_chosen_col = col;
 113                                 break;
 114                         }
 115                 }
 116
 117                 if (first_chosen_col != -1) {
 118                         width[first_chosen_col] += 780 - sumwidth;
 119                 }
 120         }
 121
 122         // make column headings from the first player's songs
 123         unsigned col = 1;
 124         unsigned x = 40 + width[0];
 125         for (std::vector<Score>::const_iterator i = group.players[0].scores.begin(); i != group.players[0].scores.end(); ++i, ++col) {
 126                 if (!i->chosen) {
 127                         unsigned this_width = my_draw_text(i->song.short_title, NULL, 12.0);
 128                         my_draw_text_deferred(td, i->song.short_title, 12.0, x + width[col] / 2 - this_width / 2, 100);
 129                 }
 130                 x += width[col] + 20;
 131         }
 132
 133         my_draw_text_deferred(td, "Total", 12.0, x + width[num_scores + 1] / 2 - my_draw_text("Total", NULL, 12.0) / 2, 100);
 134         x += width[num_scores + 1] + 20;
 135         my_draw_text_deferred(td, "Rank", 12.0, x + width[num_scores + 2] / 2 - my_draw_text("Rank", NULL, 12.0) / 2, 100);
 136
 137         // show all the players and the scores
 138         unsigned y = 140;
 139         for (std::vector<Player>::const_iterator i = group.players.begin(); i != group.players.end(); ++i) {
 140                 my_draw_text_deferred(td, i->nick, 18.0, 20, y);
 141
 142                 unsigned x = 40 + width[0];
 143
 144                 unsigned col = 1;
 145                 for (std::vector<Score>::const_iterator j = i->scores.begin(); j != i->scores.end(); ++j, ++col) {
 146                         char text[16] = "";
 147                         if (j->score != -1) {
 148                                 std::sprintf(text, "%u", j->score);
 149                         }
 150
 151                         unsigned this_width = my_draw_text(text, NULL, 22.0);
 152                         if (j->chosen) {
 153                                 my_draw_text_deferred(td, text, 22.0, x + max_num_width - this_width, y);
 154
 155                                 // draw the long name if we can, otherwise use the short one
 156                                 if (my_draw_text(j->song.title, NULL, 12.0) > width[col]) {
 157                                         my_draw_text_deferred(td, j->song.short_title, 12.0, x + max_num_width + 10, y);
 158                                 } else {
 159                                         my_draw_text_deferred(td, j->song.title, 12.0, x + max_num_width + 10, y);
 160                                 }
 161                         } else {
 162                                 my_draw_text_deferred(td, text, 22.0, x + width[col] / 2 - this_width / 2, y);
 163                         }
 164                         x += width[col] + 20;
 165                 }
 166
 167                 // draw total
 168                 {
 169                         char text[16];
 170                         std::sprintf(text, "%u", i->total);
 171
 172                         unsigned this_width = my_draw_text(text, NULL, 22.0);
 173                         my_draw_text_deferred(td, text, 22.0, x + width[num_scores + 1] / 2 - this_width / 2, y);
 174                         x += width[num_scores + 1] + 20;
 175                 }
 176
 177                 y += 40;
 178         }
 179
 180         /*
 181          * Approximate (but probably working quite well in practice) heuristic
 182          * for finding the min and max rank of a player works as follows:
 183          *
 184          * First of all, find out, for each player in the group, what the
 185          * maximum remaining score possibly can be (the minimum score is of
 186          * course identical to the player's current total). For a random song,
 187          * this is of course 1000 * (maximum feet rating) (but of course, that
 188          * depends on whether we can play single or double! for now, assume
 189          * double is okay, but this logic will be deferred to FetchMaxScore
 190          * anyhow); for a random song, we simply pick the highest-ranking song
 191          * we can find, EXCEPT those the player has chosen earlier AND the
 192          * random songs this round, AND all random songs from elimination rounds
 193          * (ie. rounds with only one group). (Phew!) This doesn't solve problems
 194          * we'd face with more than one chosen song, but it should be good enough.
 195          *
 196          * After we've found the max and min scores for all players, it's a simple
 197          * matter of sorting; the best attainable rank for player X is obtained if
 198          * X gets max score and all others get min score, the worst attainable rank
 199          * is obtained if X gets min score and all others get max score.
 200          *
 201          * This is a bit SQL-heavy, but heck...
 202          */
 203         std::vector<unsigned> max_score, min_score;
 204         for (std::vector<Player>::const_iterator i = group.players.begin(); i != group.players.end(); ++i) {
 205                 unsigned min_score_tp = 0, max_score_tp = 0;
 206                 for (std::vector<Score>::const_iterator j = i->scores.begin(); j != i->scores.end(); ++j, ++col) {
 207                         if (j->score != -1) {
 208                                 // already given
 209                                 min_score_tp += j->score;
 210                                 max_score_tp += j->score;
 211                         } else {
 212                                 unsigned max_score_this_song;
 213                                 if (j->song.id != -1) {
 214                                         // random song, or we know what song the player picked
 215                                         conn.perform(FetchMaxScoreForSong(tournament, j->song.id, &max_score_this_song));
 216                                 } else {
 217                                         conn.perform(FetchMaxScoreForPlayer(tournament, i->id, round, &max_score_this_song));
 218                                 }
 219                                 max_score_tp += max_score_this_song;
 220                         }
 221                 }
 222                 max_score.push_back(max_score_tp);
 223                 min_score.push_back(min_score_tp);
 224         }
 225
 226         // now finally find min and max rank, and draw it all
 227         y = 140;
 228         for (unsigned i = 0; i < group.players.size(); ++i) {
 229                 unsigned best_rank = 1, worst_rank = 1;
 230                 for (unsigned j = 0; j < group.players.size(); ++j) {
 231                         if (i == j)
 232                                 continue;
 233
 234                         if (max_score[i] < min_score[j])
 235                                 ++best_rank;
 236                         if (min_score[i] <= max_score[j])
 237                                 ++worst_rank;
 238                 }
 239
 240                 char text[16];
 241                 if (best_rank == worst_rank)
 242                         std::sprintf(text, "%u", best_rank);
 243                 else
 244                         std::sprintf(text, "%u-%u", best_rank, worst_rank);
 245
 246                 unsigned this_width = my_draw_text(text, NULL, 22.0);
 247                 my_draw_text_deferred(td, text, 22.0, x + width[num_scores + 2] / 2 - this_width / 2, y);
 248
 249                 y += 40;
 250         }
 251
 252         /*
 253          * Next up (at the bottom) is "who's playing, what will he/she be playing, and
 254          * optionally, how much to lead/win and how much to secure qualification" (the
 255          * last one only in the final round). We assume playing is done in a modified
 256          * zigzag; all the random songs are played first in zigzag/wrapping order (player
 257          * 1 song 1, player 2 song 2, player 3 song 3, player 1 song 2, player 2 song 3,
 258          * player 3 song 1, etc... assuming three songs and three players) and then all
 259          * the chosen songs are played (we assume only one chosen song).
 260          *
 261          * The lines are as follows:
 262          *
 263          * <player>
 264          * <song>
 265          * High score: <hs> by <hsplayer> at <hsevent>
 266          * Needs to lead: <leadscore>
 267          * Needs to secure qualification: <qualscore>
 268          * Needs to win group: <winscore>
 269          */
 270
 271         /* Find the first player with the fewest songs played. */
 272         unsigned min_played_songs = 9999, num_random_songs = 0;
 273         Player *next_player = NULL;
 274         for (std::vector<Player>::iterator i = group.players.begin(); i != group.players.end(); ++i) {
 275                 unsigned this_played = 0, this_random_songs = 0;
 276                 for (std::vector<Score>::const_iterator j = i->scores.begin(); j != i->scores.end(); ++j, ++col) {
 277                         if (j->score != -1)
 278                                 ++this_played;
 279                         if (!j->chosen)
 280                                 ++this_random_songs;
 281                 }
 282
 283                 if (this_played < min_played_songs) {
 284                         min_played_songs = this_played;
 285                         next_player = &(*i);
 286                         num_random_songs = this_random_songs;  // should be equal for all
 287                 }
 288         }
 289
 290         /* Find out what song this player is supposed to play next; try random songs first */
 291         Score *next_song = NULL;
 292
 293         for (unsigned i = 0; i < num_random_songs; ++i) {
 294                 unsigned j = (i + next_player->position - 1) % num_random_songs;
 295                 if (next_player->scores[j].score == -1) {
 296                         next_song = &(next_player->scores[j]);
 297                         break;
 298                 }
 299         }
 300
 301         // then all songs, if that didn't work out (slightly icky, but hey)
 302         if (next_song == NULL) {
 303                 for (unsigned i = 0; i < num_scores; ++i) {
 304                         unsigned j = (i + next_player->position) % num_scores;
 305                         if (next_player->scores[j].score == -1) {
 306                                 next_song = &(next_player->scores[j]);
 307                                 break;
 308                         }
 309                 }
 310         }
 311
 312         if (next_song != NULL) {
 313                 widestring text = widestring("Next player: ") + next_player->nick;
 314                 unsigned this_width = my_draw_text(text, NULL, 24.0);
 315                 my_draw_text(text, buf, 24.0, 400 - this_width/2, 420);
 316
 317                 if (next_song->song.id != -1) {
 318                         this_width = my_draw_text(next_song->song.title, NULL, 20.0);
 319                         my_draw_text(next_song->song.title, buf, 20.0, 400 - this_width/2, 457);
 320
 321                         Highscore hs;
 322                         conn.perform(FetchHighscore(next_song->song.id, &hs));
 323
 324                         if (hs.score != -1) {
 325                                 text = widestring("High score: ") + widestring(pqxx::to_string(hs.score)) +
 326                                         widestring(", by ") + hs.nick + widestring(" in ") + hs.tournament_name;
 327                                 this_width = my_draw_text(text, NULL, 16.0);
 328                                 my_draw_text(text, buf, 16.0, 400 - this_width/2, 487);
 329                         }
 330                 }
 331
 332                 // only show lead/win/qualify for the last song
 333                 if (min_played_songs == num_scores - 1) {
 334                         /*
 335                          * Find out how much we need to lead, how much we need to be guaranteed
 336                          * to win the group, and how much we need to secure qualification. (FIXME:
 337                          * do the last one :-) )
 338                          */
 339
 340                         // find the best score we can get
 341                         unsigned max_score_this_song;
 342                         if (next_song->song.id != -1) {
 343                                 // random song, or we know what song the player picked
 344                                 conn.perform(FetchMaxScoreForSong(tournament, next_song->song.id, &max_score_this_song));
 345                         } else {
 346                                 conn.perform(FetchMaxScoreForPlayer(tournament, next_player->id, round, &max_score_this_song));
 347                         }
 348
 349                         unsigned y = 520;
 350
 351                         // see what score this player must beat to lead
 352                         unsigned lead_beat = 0, win_beat = 0;
 353                         for (unsigned i = 0; i < group.players.size(); ++i) {
 354                                 if (group.players[i].id == next_player->id)
 355                                         continue;
 356
 357                                 lead_beat = std::max(lead_beat, group.players[i].total);
 358                         }
 359
 360                         // find the best max score among the others
 361                         for (unsigned i = 0; i < group.players.size(); ++i) {
 362                                 if (group.players[i].id == next_player->id)
 363                                         continue;
 364
 365                                 win_beat = std::max(win_beat, max_score[i]);
 366                         }
 367
 368                         /*
 369                          * There's a somewhat subtle point here. Normally, what a player would be interested in
 370                          * with regard to qualification would be a set of three values:
 371                          *
 372                          * 1. How much is the absolute minimum required to qualify, given that all others
 373                          *    fail?
 374                          * 2. How much will give a reasonable chance of qualifying, given the expected performance
 375                          *    of all the others?
 376                          * 3. How much will be enough to secure qualification, no matter what?
 377                          *
 378                          * Given perfect guessing, #2 would be "how much is needed to qualify"; however, it is
 379                          * completely impossible to give an exact value for that, and we're not into the guessing
 380                          * games. :-) #1 is often so low it's completely unrealistic (ie. far enough from #2 that
 381                          * it's not interesting), but #3, the most conservative estimate, is often a good measure.
 382                          * #3 is "how much is needed to _secure_ qualification", and that is usually what we
 383                          * print out when it's possible.
 384                          *
 385                          * However, in a few situations, #1 and #3 will be the exact same value, from which it
 386                          * follows (from the squeeze law, or just common sense :-) ) that #2 will be the same
 387                          * value as #1 and #3. (This usually happens near or at the end of a group.) In that
 388                          * case, we know the value we seek (ie. "how much is needed to qualify"), so we drop
 389                          * the word "secure" and just print it as-is.
 390                          *
 391                          * To find #1 and #3, we sort and pick out the values we need to beat in the best and
 392                          * the worst case.
 393                          */
 394                         int qualify_beat_worst_case = -1, qualify_beat_best_case = -1;
 395
 396                         if (group.num_qualifying > 0) {
 397                                 std::vector<unsigned> tmp;
 398
 399                                 for (unsigned i = 0; i < group.players.size(); ++i) {
 400                                         if (group.players[i].id == next_player->id)
 401                                                 continue;
 402                                         tmp.push_back(max_score[i]);
 403                                 }
 404                                 std::sort(tmp.begin(), tmp.end());
 405                                 qualify_beat_worst_case = tmp[tmp.size() - group.num_qualifying];
 406
 407                                 std::vector<unsigned> tmp2;
 408                                 for (unsigned i = 0; i < group.players.size(); ++i) {
 409                                         if (group.players[i].id == next_player->id)
 410                                                 continue;
 411                                         tmp2.push_back(min_score[i]);
 412                                 }
 413
 414                                 std::sort(tmp2.begin(), tmp2.end());
 415                                 qualify_beat_best_case = tmp2[tmp2.size() - group.num_qualifying];
 416                         }
 417
 418                         // print out the lines we can attain
 419                         if (next_player->total + max_score_this_song > lead_beat && (lead_beat != win_beat)) {
 420                                 int lead_need = std::max(lead_beat - next_player->total + 1, 0U);
 421
 422                                 text = widestring("Needs to lead: ") + widestring(pqxx::to_string(lead_need));
 423                                 this_width = my_draw_text(text, NULL, 18.0);
 424                                 my_draw_text(text, buf, 18.0, 400 - this_width/2, y);
 425
 426                                 y += 30;
 427                         }
 428
 429                         if (next_player->total + max_score_this_song > win_beat) {
 430                                 int win_need = std::max(win_beat - next_player->total + 1, 0U);
 431
 432                                 text = widestring("Needs to win: ") + widestring(pqxx::to_string(win_need));
 433
 434                                 this_width = my_draw_text(text, NULL, 18.0);
 435                                 my_draw_text(text, buf, 18.0, 400 - this_width/2, y);
 436
 437                                 y += 30;
 438                         }
 439
 440                         if (next_player->total + max_score_this_song > qualify_beat_worst_case && (qualify_beat_worst_case != win_beat)) {
 441                                 int qual_need = std::max(qualify_beat_worst_case - next_player->total + 1, 0U);
 442
 443                                 if (qualify_beat_worst_case == qualify_beat_best_case) {
 444                                         text = widestring("Needs to qualify: ") + widestring(pqxx::to_string(qual_need));
 445                                 } else {
 446                                         text = widestring("Needs to secure qualification: ") + widestring(pqxx::to_string(qual_need));
 447                                 }
 448
 449                                 this_width = my_draw_text(text, NULL, 18.0);
 450                                 my_draw_text(text, buf, 18.0, 400 - this_width/2, y);
 451
 452                                 y += 30;
 453                         }
 454                 }
 455         }
 456
 457         valid = true;
 458         draw_all_deferred_text(buf, td, last_text);
 459         last_text = td;
 460 }
 461