Added refactoring comment
[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 // some refactoring done, more should be
220 void GroupScreen::draw(unsigned char *buf, unsigned width, unsigned height)
221 {
222         std::vector<TextDefer> td;
223         
224         scores_changed.reset_flag();
225         set_screen_size(width, height);
226
227         /*
228          * We'll probably need some values from here later on (although not all), just fetch them
229          * all while we're at it.
230          */
231         std::map<unsigned, unsigned> song_scores, player_scores;
232         conn.perform(FetchMaxScoreForSongs(tournament, &song_scores));
233         conn.perform(FetchMaxScoreForPlayers(tournament, round, &player_scores));
234         
235         Group group;
236         conn.perform(FetchGroup(tournament, round, parallel, &group));
237         gettimeofday(&last_updated, NULL);
238
239         memset(buf, 0, width * height * 4);
240
241         std::vector<unsigned> colwidth;
242         
243         draw_main_heading(td);
244         find_column_widths(group, colwidth);
245         draw_column_headings(td, group, colwidth);
246         draw_scores(td, group, colwidth);
247         
248         unsigned num_scores = group.players[0].scores.size();
249
250         /*
251          * Approximate (but probably working quite well in practice) heuristic
252          * for finding the min and max rank of a player works as follows:
253          *
254          * First of all, find out, for each player in the group, what the
255          * maximum remaining score possibly can be (the minimum score is of
256          * course identical to the player's current total). For a random song,
257          * this is of course 1000 * (maximum feet rating) (but of course, that
258          * depends on whether we can play single or double! for now, assume
259          * double is okay, but this logic will be deferred to FetchMaxScore
260          * anyhow); for a random song, we simply pick the highest-ranking song
261          * we can find, EXCEPT those the player has chosen earlier AND the
262          * random songs this round, AND all random songs from elimination rounds
263          * (ie. rounds with only one group). (Phew!) This doesn't solve problems
264          * we'd face with more than one chosen song, but it should be good enough.
265          *
266          * After we've found the max and min scores for all players, it's a simple
267          * matter of sorting; the best attainable rank for player X is obtained if 
268          * X gets max score and all others get min score, the worst attainable rank
269          * is obtained if X gets min score and all others get max score.
270          */
271         std::vector<unsigned> max_score, min_score;
272         for (std::vector<Player>::const_iterator i = group.players.begin(); i != group.players.end(); ++i) {
273                 unsigned min_score_tp = 0, max_score_tp = 0;
274                 for (std::vector<Score>::const_iterator j = i->scores.begin(); j != i->scores.end(); ++j) {
275                         if (j->score != -1) {
276                                 // already given
277                                 min_score_tp += j->score;
278                                 max_score_tp += j->score;
279                         } else {
280                                 unsigned max_score_this_song;
281                                 if (j->song.id != -1) {
282                                         // random song, or we know what song the player picked
283                                         max_score_this_song = song_scores[j->song.id];
284                                 } else {
285                                         max_score_this_song = player_scores[i->id];
286                                 }
287                                 max_score_tp += max_score_this_song;
288                         }
289                 }
290                 max_score.push_back(max_score_tp);
291                 min_score.push_back(min_score_tp);
292         }
293
294         // now finally find min and max rank, and draw it all
295         unsigned show_players = get_show_players(group);
296         unsigned y = (show_players <= 7) ? 140 : (140 - (show_players - 7) * 5);
297         for (unsigned i = 0; i < group.players.size() && (i/num_machines) < show_players; ++i) {
298                 unsigned best_rank = 1, worst_rank = 1;
299                 for (unsigned j = 0; j < group.players.size(); ++j) {
300                         if (i == j)
301                                 continue;
302
303                         if (max_score[i] < min_score[j])
304                                 ++best_rank;
305                         if (min_score[i] <= max_score[j])
306                                 ++worst_rank;
307                 }
308
309                 char text[16];
310                 if (best_rank == worst_rank)
311                         std::sprintf(text, "%u", best_rank);
312                 else
313                         std::sprintf(text, "%u-%u", best_rank, worst_rank);
314                 
315                 if (i % num_machines != machine)
316                         continue;
317                 
318                 // find out where to place this
319                 unsigned x = 40 + colwidth[0];
320                 for (unsigned j = 1; j <= num_scores + 1; ++j)
321                         x += colwidth[j] + 20;
322                 
323                 unsigned this_width = my_draw_text(text, NULL, 22.0);
324                 my_draw_text_deferred(td, text, 22.0, x + colwidth[num_scores + 2] / 2 - this_width / 2, y);
325
326                 if (show_players > 7)
327                         y += 40 - (show_players - 7) * 4;
328                 else 
329                         y += 40;
330         }
331                 
332         /*
333          * Next up (at the bottom) is "who's playing, what will he/she be playing, and
334          * optionally, how much to lead/win and how much to secure qualification" (the
335          * last one only in the final round). We assume playing is done in a modified
336          * zigzag; all the random songs are played first in zigzag/wrapping order (player
337          * 1 song 1, player 2 song 2, player 3 song 3, player 1 song 2, player 2 song 3,
338          * player 3 song 1, etc... assuming three songs and three players) and then all
339          * the chosen songs are played (we assume only one chosen song).
340          *
341          * The lines are as follows:
342          *
343          * <player>
344          * <song>
345          * High score: <hs> by <hsplayer> at <hsevent>
346          * Needs to lead: <leadscore>
347          * Needs to secure qualification: <qualscore>
348          * Needs to win group: <winscore>
349          */
350         
351         /* Find the first player with the fewest songs played and part of this machine. */
352         unsigned min_played_songs = 9999, num_random_songs = 0;
353         Player *next_player = NULL;
354         unsigned m = 0;
355         for (std::vector<Player>::iterator i = group.players.begin(); i != group.players.end(); ++i) {
356                 unsigned this_played = 0, this_random_songs = 0;
357                 for (std::vector<Score>::const_iterator j = i->scores.begin(); j != i->scores.end(); ++j) {
358                         if (j->score != -1)
359                                 ++this_played;
360                         if (!j->chosen)
361                                 ++this_random_songs;
362                 }
363
364                 if ((m++ % num_machines == machine) && this_played < min_played_songs) {
365                         min_played_songs = this_played;
366                         next_player = &(*i);
367                         num_random_songs = this_random_songs;  // should be equal for all
368                 }
369         }
370
371         /* Find out what song this player is supposed to play next; try random songs first */ 
372         Score *next_song = NULL;
373
374         for (unsigned i = 0; i < num_random_songs; ++i) {
375                 unsigned j = (i + next_player->position - 1) % num_random_songs;
376                 if (next_player->scores[j].score == -1) {
377                         next_song = &(next_player->scores[j]);
378                         break;
379                 }
380         }
381
382         // then all songs, if that didn't work out (slightly icky, but hey)
383         if (next_song == NULL) {
384                 for (unsigned i = 0; i < num_scores; ++i) {
385                         unsigned j = (i + next_player->position) % num_scores;
386                         if (next_player->scores[j].score == -1) {
387                                 next_song = &(next_player->scores[j]);
388                                 break;
389                         }
390                 }
391         }
392
393         if (next_song != NULL) {
394                 widestring text = widestring("Next player: ") + next_player->nick;
395                 unsigned this_width = my_draw_text(text, NULL, 24.0);
396                 my_draw_text(text, buf, 24.0, (LOGICAL_SCREEN_WIDTH/2) - this_width/2, 420);
397
398                 if (next_song->song.id != -1) {
399                         this_width = my_draw_text(next_song->song.title, NULL, 20.0);
400                         my_draw_text(next_song->song.title, buf, 20.0, (LOGICAL_SCREEN_WIDTH/2) - this_width/2, 457);
401
402                         Highscore hs;
403                         conn.perform(FetchHighscore(next_song->song.id, &hs));
404                         
405                         if (hs.score != -1) {
406                                 text = widestring("High score: ") + widestring(pqxx::to_string(hs.score)) +
407                                         widestring(", by ") + hs.nick + widestring(" in ") + hs.tournament_name;
408                                 this_width = my_draw_text(text, NULL, 16.0);
409                                 my_draw_text(text, buf, 16.0, (LOGICAL_SCREEN_WIDTH/2) - this_width/2, 487);
410                         }
411                 }
412
413                 // only show lead/win/qualify for the last song
414                 if (min_played_songs == num_scores - 1) {
415                         /*
416                          * Find out how much we need to lead, how much we need to be guaranteed
417                          * to win the group, and how much we need to secure qualification. (FIXME:
418                          * do the last one :-) )
419                          */
420                         
421                         // find the best score we can get
422                         unsigned max_score_this_song;
423                         if (next_song->song.id != -1) {
424                                 // random song, or we know what song the player picked
425                                 max_score_this_song = song_scores[next_song->song.id];
426                         } else {
427                                 max_score_this_song = player_scores[next_player->id];
428                         }
429
430                         unsigned y = 520;
431                         
432                         // see what score this player must beat to lead
433                         unsigned lead_beat = 0, win_beat = 0;
434                         for (unsigned i = 0; i < group.players.size(); ++i) {
435                                 if (group.players[i].id == next_player->id)
436                                         continue;
437                                 
438                                 lead_beat = std::max(lead_beat, group.players[i].total);
439                         }
440
441                         // find the best max score among the others
442                         for (unsigned i = 0; i < group.players.size(); ++i) {
443                                 if (group.players[i].id == next_player->id)
444                                         continue;
445
446                                 win_beat = std::max(win_beat, max_score[i]);
447                         }
448
449                         /*
450                          * There's a somewhat subtle point here. Normally, what a player would be interested in
451                          * with regard to qualification would be a set of three values:
452                          *
453                          * 1. How much is the absolute minimum required to qualify, given that all others
454                          *    fail?
455                          * 2. How much will give a reasonable chance of qualifying, given the expected performance
456                          *    of all the others?
457                          * 3. How much will be enough to secure qualification, no matter what?
458                          *
459                          * Given perfect guessing, #2 would be "how much is needed to qualify"; however, it is
460                          * completely impossible to give an exact value for that, and we're not into the guessing
461                          * games. :-) #1 is often so low it's completely unrealistic (ie. far enough from #2 that
462                          * it's not interesting), but #3, the most conservative estimate, is often a good measure.
463                          * #3 is "how much is needed to _secure_ qualification", and that is usually what we
464                          * print out when it's possible.
465                          *
466                          * However, in a few situations, #1 and #3 will be the exact same value, from which it
467                          * follows (from the squeeze law, or just common sense :-) ) that #2 will be the same
468                          * value as #1 and #3. (This usually happens near or at the end of a group.) In that
469                          * case, we know the value we seek (ie. "how much is needed to qualify"), so we drop
470                          * the word "secure" and just print it as-is.
471                          *
472                          * To find #1 and #3, we sort and pick out the values we need to beat in the best and
473                          * the worst case.
474                          */
475                         int qualify_beat_worst_case = -1, qualify_beat_best_case = -1;
476
477                         if (group.num_qualifying > 0) {
478                                 std::vector<unsigned> tmp;
479                                 
480                                 for (unsigned i = 0; i < group.players.size(); ++i) {
481                                         if (group.players[i].id == next_player->id)
482                                                 continue;
483                                         tmp.push_back(max_score[i]);
484                                 }
485                                 std::sort(tmp.begin(), tmp.end());
486                                 qualify_beat_worst_case = tmp[tmp.size() - group.num_qualifying];
487                                 
488                                 std::vector<unsigned> tmp2;
489                                 for (unsigned i = 0; i < group.players.size(); ++i) {
490                                         if (group.players[i].id == next_player->id)
491                                                 continue;
492                                         tmp2.push_back(min_score[i]);
493                                 }
494
495                                 std::sort(tmp2.begin(), tmp2.end());
496                                 qualify_beat_best_case = tmp2[tmp2.size() - group.num_qualifying];
497                         }
498                         
499                         // print out the lines we can attain
500                         if (next_player->total + max_score_this_song > lead_beat && (lead_beat != win_beat)) {
501                                 int lead_need = std::max(lead_beat - next_player->total + 1, 0U);
502                         
503                                 if (lead_need > 0) {
504                                         text = widestring("Needs to lead: ") + widestring(pqxx::to_string(lead_need));
505                                         this_width = my_draw_text(text, NULL, 18.0);
506                                         my_draw_text(text, buf, 18.0, (LOGICAL_SCREEN_WIDTH/2) - this_width/2, y);
507
508                                         y += 30;
509                                 }
510                         }
511                         
512                         if (next_player->total + max_score_this_song > win_beat) {
513                                 int win_need = std::max(win_beat - next_player->total + 1, 0U);
514                                 
515                                 if (win_need > 0) {
516                                         text = widestring("Needs to win: ") + widestring(pqxx::to_string(win_need));
517
518                                         this_width = my_draw_text(text, NULL, 18.0);
519                                         my_draw_text(text, buf, 18.0, (LOGICAL_SCREEN_WIDTH/2) - this_width/2, y);
520
521                                         y += 30;
522                                 }
523                         }
524
525                         if (group.num_qualifying > 0 &&
526                             next_player->total + max_score_this_song > unsigned(qualify_beat_worst_case) &&
527                             (unsigned(qualify_beat_worst_case) != win_beat)) {
528                                 int qual_need = std::max(qualify_beat_worst_case - next_player->total + 1, 0U);
529                                 
530                                 if (qual_need > 0) {
531                                         if (qualify_beat_worst_case == qualify_beat_best_case) {
532                                                 text = widestring("Needs to qualify: ") + widestring(pqxx::to_string(qual_need));
533                                         } else {
534                                                 text = widestring("Needs to secure qualification: ") + widestring(pqxx::to_string(qual_need));
535                                         }
536                                         
537                                         this_width = my_draw_text(text, NULL, 18.0);
538                                         my_draw_text(text, buf, 18.0, (LOGICAL_SCREEN_WIDTH/2) - this_width/2, y);
539                                 
540                                         y += 30;
541                                 }
542                         }
543                 }
544         }
545         
546         valid = true;
547         draw_all_deferred_text(buf, td, last_text);
548         last_text = td;
549 }
550
551 int GroupScreen::get_priority()
552 {
553         return 10;
554 }