Yet more refactoring.
[ccbs] / bigscreen / groupscreen.cpp
1 #include <cstdio>
2 #include <algorithm>
3 #include <map>
4
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"
12 #include "fonts.h"
13
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)
16 {
17 }
18
19 GroupScreen::~GroupScreen()
20 {
21 }
22
23 bool GroupScreen::check_invalidated()
24 {
25         if (!valid)
26                 return true;
27         if (!scores_changed.get_flag())
28                 return false;
29
30         bool needs_update;
31         conn.perform(FetchNeedsUpdate(last_updated, tournament, round, parallel, &needs_update));
32
33         if (!needs_update)
34                 scores_changed.reset_flag();
35         
36         return needs_update;
37 }
38
39 unsigned GroupScreen::get_show_players(const Group &group)
40 {
41         unsigned num_players_this_machine = (group.players.size() + num_machines - machine - 1) / num_machines;
42         return std::min(num_players_this_machine, 9U);
43 }
44
45 void GroupScreen::draw_main_heading(std::vector<TextDefer> &td)
46 {
47         char heading[64];
48         if (num_machines == 1) {
49                 if (parallel == 0) {
50                         std::sprintf(heading, "Round %u", round);
51                 } else {
52                         std::sprintf(heading, "Round %u, Group %u", round, parallel);
53                 }
54         } else {
55                 if (parallel == 0) {
56                         std::sprintf(heading, "Round %u, Machine %u", round, machine + 1);
57                 } else {
58                         std::sprintf(heading, "Round %u, Group %u, Machine %u", round, parallel, machine + 1);
59                 }
60         }
61
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);
64 }
65
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)
68 {
69         unsigned num_scores = group.players[0].scores.size();
70
71         unsigned col = 1;
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) {
74                 if (!i->chosen) {
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);
77                 }
78                 x += colwidth[col] + 20;
79         }
80
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);
84 }       
85         
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)
88 {
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);
93         
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)
97                         continue;
98
99                 my_draw_text_deferred(td, i->nick, 18.0, 20, y);
100
101                 x = 40 + colwidth[0];
102
103                 unsigned col = 1;
104                 for (std::vector<Score>::const_iterator j = i->scores.begin(); j != i->scores.end(); ++j, ++col) {
105                         char text[16] = "";
106                         if (j->score != -1) {
107                                 std::sprintf(text, "%u", j->score);
108                         }
109         
110                         unsigned this_width = my_draw_text(text, NULL, 22.0);
111                         if (j->chosen) {
112                                 my_draw_text_deferred(td, text, 22.0, x + max_num_width - this_width, y);
113
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);
117                                 } else {
118                                         my_draw_text_deferred(td, j->song.title, 12.0, x + max_num_width + 10, y);
119                                 }
120                         } else {
121                                 my_draw_text_deferred(td, text, 22.0, x + colwidth[col] / 2 - this_width / 2, y);
122                         }
123                         x += colwidth[col] + 20;
124                 }
125
126                 // draw total
127                 {
128                         char text[16];
129                         std::sprintf(text, "%u", i->total);
130                         
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;
134                 }
135
136                 if (show_players > 7)
137                         y += 40 - (show_players - 7) * 4;
138                 else 
139                         y += 40;
140                 ++row;
141         }
142 }       
143
144 /*
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.
148  */
149 void GroupScreen::find_column_widths(const Group &group, std::vector<unsigned> &colwidth)
150 {
151         unsigned num_scores;
152         unsigned max_num_width = my_draw_text("8888", NULL, 22.0);
153         unsigned sumcolwidth;
154         
155         for (unsigned mode = 0; mode < 2; ++mode) {
156                 for (std::vector<Player>::const_iterator i = group.players.begin(); i != group.players.end(); ++i) {
157                         unsigned col = 1;
158                         
159                         if (colwidth.size() == 0)
160                                 colwidth.push_back(0);
161                         
162                         colwidth[0] = std::max(colwidth[0], my_draw_text(i->nick, NULL, 18.0));
163
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);
167                                         
168                                 if (j->chosen) {
169                                         colwidth[col] = std::max(colwidth[col], my_draw_text((mode == 0) ? j->song.title : j->song.short_title, NULL, 12.0) + 
170                                                         max_num_width + 10);
171                                 } else {                
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);
174                                 }
175                         }
176                 }
177
178                 num_scores = group.players[0].scores.size();
179
180                 if (colwidth.size() < num_scores + 2) {
181                         colwidth.push_back(0);
182                         colwidth.push_back(0);
183                 }
184                 
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);
187
188                 // if we're at long titles and that works, don't try the short ones
189                 sumcolwidth = 0;
190                         
191                 for (unsigned i = 0; i <= num_scores + 2; ++i)
192                         sumcolwidth += colwidth[i] + 20;
193                         
194                 if (sumcolwidth < 780)
195                         break;
196         }
197
198         /* 
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.
201          */
202         if (sumcolwidth < 780) {
203                 int first_chosen_col = -1;
204                 unsigned col = 1;
205
206                 for (std::vector<Score>::const_iterator i = group.players[0].scores.begin(); i != group.players[0].scores.end(); ++i, ++col) {
207                         if (i->chosen) {
208                                 first_chosen_col = col;
209                                 break;
210                         }
211                 }
212
213                 if (first_chosen_col != -1) {
214                         colwidth[first_chosen_col] += 780 - sumcolwidth;
215                 }
216         }
217 }
218
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)
221 {
222         unsigned min_played_songs = 9999;
223         const Player *next_player = NULL;
224         unsigned m = 0;
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) {
228                         if (j->score != -1)
229                                 ++this_played;
230                 }
231
232                 if ((m++ % num_machines == machine) && this_played < min_played_songs) {
233                         min_played_songs = this_played;
234                         next_player = &(*i);
235                 }
236         }
237
238         return next_player;
239 }
240
241 /*
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).
250  *
251  * The lines are as follows:
252  *
253  * <player>
254  * <song>
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>
259  */
260 void GroupScreen::draw_next_up_single(unsigned char *buf, const Group &group, const std::vector<unsigned> &colwidth,
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)
263 {
264         unsigned num_scores = group.players[0].scores.size();
265         
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) {
269                 if (!i->chosen)
270                         ++num_random_songs;
271         }
272
273         /* 
274          * Find out which player is next, and what song he she is supposed to play. First
275          * try random songs.
276          */
277         const Player *next_player = get_next_player(group);
278         const Score *next_song = NULL;
279         unsigned num_played = 0;  // will not always be completely accurate, but always as accurate as we need it :-)
280
281         for (unsigned i = 0; i < num_random_songs; ++i) {
282                 unsigned j = (i + next_player->position - 1) % num_random_songs;
283                 if (next_player->scores[j].score == -1) {
284                         next_song = &(next_player->scores[j]);
285                         break;
286                 } else {
287                         ++num_played;
288                 }
289         }
290
291         // then all songs, if that didn't work out (slightly icky, but hey)
292         if (next_song == NULL) {
293                 for (unsigned i = 0; i < num_scores; ++i) {
294                         unsigned j = (i + next_player->position) % num_scores;
295                         if (next_player->scores[j].score == -1) {
296                                 next_song = &(next_player->scores[j]);
297                                 break;
298                         } else {
299                                 ++num_played;
300                         }
301                 }
302         }
303
304         if (next_song != NULL) {
305                 widestring text = widestring("Next player: ") + next_player->nick;
306                 unsigned this_width = my_draw_text(text, NULL, 24.0);
307                 my_draw_text(text, buf, 24.0, (LOGICAL_SCREEN_WIDTH/2) - this_width/2, 420);
308
309                 if (next_song->song.id != -1) {
310                         this_width = my_draw_text(next_song->song.title, NULL, 20.0);
311                         my_draw_text(next_song->song.title, buf, 20.0, (LOGICAL_SCREEN_WIDTH/2) - this_width/2, 457);
312
313                         Highscore hs;
314                         conn.perform(FetchHighscore(next_song->song.id, &hs));
315                         
316                         if (hs.score != -1) {
317                                 text = widestring("High score: ") + widestring(pqxx::to_string(hs.score)) +
318                                         widestring(", by ") + hs.nick + widestring(" in ") + hs.tournament_name;
319                                 this_width = my_draw_text(text, NULL, 16.0);
320                                 my_draw_text(text, buf, 16.0, (LOGICAL_SCREEN_WIDTH/2) - this_width/2, 487);
321                         }
322                 }
323
324                 // only show lead/win/qualify for the last song
325                 if (num_played == num_scores - 1) {
326                         /*
327                          * Find out how much we need to lead, how much we need to be guaranteed
328                          * to win the group, and how much we need to secure qualification. (FIXME:
329                          * do the last one :-) )
330                          */
331                         
332                         // find the best score we can get
333                         unsigned max_score_this_song;
334                         if (next_song->song.id != -1) {
335                                 // random song, or we know what song the player picked
336                                 max_score_this_song = song_scores[next_song->song.id];
337                         } else {
338                                 max_score_this_song = player_scores[next_player->id];
339                         }
340
341                         unsigned y = 520;
342                         
343                         // see what score this player must beat to lead
344                         unsigned lead_beat = 0, win_beat = 0;
345                         for (unsigned i = 0; i < group.players.size(); ++i) {
346                                 if (group.players[i].id == next_player->id)
347                                         continue;
348                                 
349                                 lead_beat = std::max(lead_beat, group.players[i].total);
350                         }
351
352                         // find the best max score among the others
353                         for (unsigned i = 0; i < group.players.size(); ++i) {
354                                 if (group.players[i].id == next_player->id)
355                                         continue;
356
357                                 win_beat = std::max(win_beat, max_score[i]);
358                         }
359
360                         /*
361                          * There's a somewhat subtle point here. Normally, what a player would be interested in
362                          * with regard to qualification would be a set of three values:
363                          *
364                          * 1. How much is the absolute minimum required to qualify, given that all others
365                          *    fail?
366                          * 2. How much will give a reasonable chance of qualifying, given the expected performance
367                          *    of all the others?
368                          * 3. How much will be enough to secure qualification, no matter what?
369                          *
370                          * Given perfect guessing, #2 would be "how much is needed to qualify"; however, it is
371                          * completely impossible to give an exact value for that, and we're not into the guessing
372                          * games. :-) #1 is often so low it's completely unrealistic (ie. far enough from #2 that
373                          * it's not interesting), but #3, the most conservative estimate, is often a good measure.
374                          * #3 is "how much is needed to _secure_ qualification", and that is usually what we
375                          * print out when it's possible.
376                          *
377                          * However, in a few situations, #1 and #3 will be the exact same value, from which it
378                          * follows (from the squeeze law, or just common sense :-) ) that #2 will be the same
379                          * value as #1 and #3. (This usually happens near or at the end of a group.) In that
380                          * case, we know the value we seek (ie. "how much is needed to qualify"), so we drop
381                          * the word "secure" and just print it as-is.
382                          *
383                          * To find #1 and #3, we sort and pick out the values we need to beat in the best and
384                          * the worst case.
385                          */
386                         int qualify_beat_worst_case = -1, qualify_beat_best_case = -1;
387
388                         if (group.num_qualifying > 0) {
389                                 std::vector<unsigned> tmp;
390                                 
391                                 for (unsigned i = 0; i < group.players.size(); ++i) {
392                                         if (group.players[i].id == next_player->id)
393                                                 continue;
394                                         tmp.push_back(max_score[i]);
395                                 }
396                                 std::sort(tmp.begin(), tmp.end());
397                                 qualify_beat_worst_case = tmp[tmp.size() - group.num_qualifying];
398                                 
399                                 std::vector<unsigned> tmp2;
400                                 for (unsigned i = 0; i < group.players.size(); ++i) {
401                                         if (group.players[i].id == next_player->id)
402                                                 continue;
403                                         tmp2.push_back(min_score[i]);
404                                 }
405
406                                 std::sort(tmp2.begin(), tmp2.end());
407                                 qualify_beat_best_case = tmp2[tmp2.size() - group.num_qualifying];
408                         }
409                         
410                         // print out the lines we can attain
411                         if (next_player->total + max_score_this_song > lead_beat && (lead_beat != win_beat)) {
412                                 int lead_need = std::max(lead_beat - next_player->total + 1, 0U);
413                         
414                                 if (lead_need > 0) {
415                                         text = widestring("Needs to lead: ") + widestring(pqxx::to_string(lead_need));
416                                         this_width = my_draw_text(text, NULL, 18.0);
417                                         my_draw_text(text, buf, 18.0, (LOGICAL_SCREEN_WIDTH/2) - this_width/2, y);
418
419                                         y += 30;
420                                 }
421                         }
422                         
423                         if (next_player->total + max_score_this_song > win_beat) {
424                                 int win_need = std::max(win_beat - next_player->total + 1, 0U);
425                                 
426                                 if (win_need > 0) {
427                                         text = widestring("Needs to win: ") + widestring(pqxx::to_string(win_need));
428
429                                         this_width = my_draw_text(text, NULL, 18.0);
430                                         my_draw_text(text, buf, 18.0, (LOGICAL_SCREEN_WIDTH/2) - this_width/2, y);
431
432                                         y += 30;
433                                 }
434                         }
435
436                         if (group.num_qualifying > 0 &&
437                             next_player->total + max_score_this_song > unsigned(qualify_beat_worst_case) &&
438                             (unsigned(qualify_beat_worst_case) != win_beat)) {
439                                 int qual_need = std::max(qualify_beat_worst_case - next_player->total + 1, 0U);
440                                 
441                                 if (qual_need > 0) {
442                                         if (qualify_beat_worst_case == qualify_beat_best_case) {
443                                                 text = widestring("Needs to qualify: ") + widestring(pqxx::to_string(qual_need));
444                                         } else {
445                                                 text = widestring("Needs to secure qualification: ") + widestring(pqxx::to_string(qual_need));
446                                         }
447                                         
448                                         this_width = my_draw_text(text, NULL, 18.0);
449                                         my_draw_text(text, buf, 18.0, (LOGICAL_SCREEN_WIDTH/2) - this_width/2, y);
450                                 
451                                         y += 30;
452                                 }
453                         }
454                 }
455         }
456 }
457
458 // some refactoring done, more should be
459 void GroupScreen::draw(unsigned char *buf, unsigned width, unsigned height)
460 {
461         std::vector<TextDefer> td;
462         
463         scores_changed.reset_flag();
464         set_screen_size(width, height);
465
466         /*
467          * We'll probably need some values from here later on (although not all), just fetch them
468          * all while we're at it.
469          */
470         std::map<unsigned, unsigned> song_scores, player_scores;
471         conn.perform(FetchMaxScoreForSongs(tournament, &song_scores));
472         conn.perform(FetchMaxScoreForPlayers(tournament, round, &player_scores));
473         
474         Group group;
475         conn.perform(FetchGroup(tournament, round, parallel, &group));
476         gettimeofday(&last_updated, NULL);
477
478         memset(buf, 0, width * height * 4);
479
480         std::vector<unsigned> colwidth;
481         
482         draw_main_heading(td);
483         find_column_widths(group, colwidth);
484         draw_column_headings(td, group, colwidth);
485         draw_scores(td, group, colwidth);
486         
487         unsigned num_scores = group.players[0].scores.size();
488
489         /*
490          * Approximate (but probably working quite well in practice) heuristic
491          * for finding the min and max rank of a player works as follows:
492          *
493          * First of all, find out, for each player in the group, what the
494          * maximum remaining score possibly can be (the minimum score is of
495          * course identical to the player's current total). For a random song,
496          * this is of course 1000 * (maximum feet rating) (but of course, that
497          * depends on whether we can play single or double! for now, assume
498          * double is okay, but this logic will be deferred to FetchMaxScore
499          * anyhow); for a random song, we simply pick the highest-ranking song
500          * we can find, EXCEPT those the player has chosen earlier AND the
501          * random songs this round, AND all random songs from elimination rounds
502          * (ie. rounds with only one group). (Phew!) This doesn't solve problems
503          * we'd face with more than one chosen song, but it should be good enough.
504          *
505          * After we've found the max and min scores for all players, it's a simple
506          * matter of sorting; the best attainable rank for player X is obtained if 
507          * X gets max score and all others get min score, the worst attainable rank
508          * is obtained if X gets min score and all others get max score.
509          */
510         std::vector<unsigned> max_score, min_score;
511         for (std::vector<Player>::const_iterator i = group.players.begin(); i != group.players.end(); ++i) {
512                 unsigned min_score_tp = 0, max_score_tp = 0;
513                 for (std::vector<Score>::const_iterator j = i->scores.begin(); j != i->scores.end(); ++j) {
514                         if (j->score != -1) {
515                                 // already given
516                                 min_score_tp += j->score;
517                                 max_score_tp += j->score;
518                         } else {
519                                 unsigned max_score_this_song;
520                                 if (j->song.id != -1) {
521                                         // random song, or we know what song the player picked
522                                         max_score_this_song = song_scores[j->song.id];
523                                 } else {
524                                         max_score_this_song = player_scores[i->id];
525                                 }
526                                 max_score_tp += max_score_this_song;
527                         }
528                 }
529                 max_score.push_back(max_score_tp);
530                 min_score.push_back(min_score_tp);
531         }
532
533         // now finally find min and max rank, and draw it all
534         unsigned show_players = get_show_players(group);
535         unsigned y = (show_players <= 7) ? 140 : (140 - (show_players - 7) * 5);
536         for (unsigned i = 0; i < group.players.size() && (i/num_machines) < show_players; ++i) {
537                 unsigned best_rank = 1, worst_rank = 1;
538                 for (unsigned j = 0; j < group.players.size(); ++j) {
539                         if (i == j)
540                                 continue;
541
542                         if (max_score[i] < min_score[j])
543                                 ++best_rank;
544                         if (min_score[i] <= max_score[j])
545                                 ++worst_rank;
546                 }
547
548                 char text[16];
549                 if (best_rank == worst_rank)
550                         std::sprintf(text, "%u", best_rank);
551                 else
552                         std::sprintf(text, "%u-%u", best_rank, worst_rank);
553                 
554                 if (i % num_machines != machine)
555                         continue;
556                 
557                 // find out where to place this
558                 unsigned x = 40 + colwidth[0];
559                 for (unsigned j = 1; j <= num_scores + 1; ++j)
560                         x += colwidth[j] + 20;
561                 
562                 unsigned this_width = my_draw_text(text, NULL, 22.0);
563                 my_draw_text_deferred(td, text, 22.0, x + colwidth[num_scores + 2] / 2 - this_width / 2, y);
564
565                 if (show_players > 7)
566                         y += 40 - (show_players - 7) * 4;
567                 else 
568                         y += 40;
569         }
570         
571         draw_next_up_single(buf, group, colwidth, song_scores, player_scores, max_score, min_score);
572         
573         valid = true;
574         draw_all_deferred_text(buf, td, last_text);
575         last_text = td;
576 }
577
578 int GroupScreen::get_priority()
579 {
580         return 10;
581 }