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