-
Notifications
You must be signed in to change notification settings - Fork 0
/
pool.h
1310 lines (1232 loc) · 43.5 KB
/
pool.h
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
783
784
785
786
787
788
789
790
791
792
793
794
795
796
797
798
799
800
801
802
803
804
805
806
807
808
809
810
811
812
813
814
815
816
817
818
819
820
821
822
823
824
825
826
827
828
829
830
831
832
833
834
835
836
837
838
839
840
841
842
843
844
845
846
847
848
849
850
851
852
853
854
855
856
857
858
859
860
861
862
863
864
865
866
867
868
869
870
871
872
873
874
875
876
877
878
879
880
881
882
883
884
885
886
887
888
889
890
891
892
893
894
895
896
897
898
899
900
901
902
903
904
905
906
907
908
909
910
911
912
913
914
915
916
917
918
919
920
921
922
923
924
925
926
927
928
929
930
931
932
933
934
935
936
937
938
939
940
941
942
943
944
945
946
947
948
949
950
951
952
953
954
955
956
957
958
959
960
961
962
963
964
965
966
967
968
969
970
971
972
973
974
975
976
977
978
979
980
981
982
983
984
985
986
987
988
989
990
991
992
993
994
995
996
997
998
999
1000
#ifndef POOL_C_
#define POOL_C_
#include <stdlib.h>
#include <stdint.h>
#include <stdbool.h>
#include <stdio.h>
#include <string.h>
#include <strings.h>
#include <errno.h>
#include <ctype.h>
#include <dirent.h>
#include <sys/stat.h>
#include <sys/types.h>
#include <assert.h>
#include <inttypes.h>
#include <time.h>
#ifndef POOLDEF
#define POOLDEF static inline
#endif
// Public API
#define POOL_NUM_TEAMS 64
#define POOL_NUM_GAMES 63
#define POOL_TEAM_NAME_LIMIT 33
#define POOL_BRACKET_NAME_LIMIT 33
#define POOL_TEAM_SHORT_NAME_LIMIT 4
#define POOL_NAME_LIMIT 256
#define POOL_ROUNDS 6
typedef struct {
char name[POOL_TEAM_NAME_LIMIT];
char shortName[POOL_TEAM_SHORT_NAME_LIMIT];
uint8_t seed;
bool eliminated;
} PoolTeam;
static PoolTeam poolTeams[POOL_NUM_TEAMS] = {0};
static uint8_t poolSeeds[POOL_NUM_TEAMS] = {
1,16,8,9,5,12,4,13,6,11,3,14,7,10,2,15,
1,16,8,9,5,12,4,13,6,11,3,14,7,10,2,15,
1,16,8,9,5,12,4,13,6,11,3,14,7,10,2,15,
1,16,8,9,5,12,4,13,6,11,3,14,7,10,2,15
};
static uint8_t poolGamesInRound[POOL_ROUNDS] = {32, 48, 56, 60, 62, 63};
static uint8_t poolGamesRound[POOL_NUM_GAMES] = {
0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,
2,2,2,2,2,2,2,2,
3,3,3,3,
4,4,
5
};
static uint8_t poolGameNumber[POOL_NUM_TEAMS][POOL_ROUNDS] = {
{0, 32, 48, 56, 60, 62},
{0, 32, 48, 56, 60, 62},
{1, 32, 48, 56, 60, 62},
{1, 32, 48, 56, 60, 62},
{2, 33, 48, 56, 60, 62},
{2, 33, 48, 56, 60, 62},
{3, 33, 48, 56, 60, 62},
{3, 33, 48, 56, 60, 62},
{4, 34, 49, 56, 60, 62},
{4, 34, 49, 56, 60, 62},
{5, 34, 49, 56, 60, 62},
{5, 34, 49, 56, 60, 62},
{6, 35, 49, 56, 60, 62},
{6, 35, 49, 56, 60, 62},
{7, 35, 49, 56, 60, 62},
{7, 35, 49, 56, 60, 62},
{8, 36, 50, 57, 60, 62},
{8, 36, 50, 57, 60, 62},
{9, 36, 50, 57, 60, 62},
{9, 36, 50, 57, 60, 62},
{10, 37, 50, 57, 60, 62},
{10, 37, 50, 57, 60, 62},
{11, 37, 50, 57, 60, 62},
{11, 37, 50, 57, 60, 62},
{12, 38, 51, 57, 60, 62},
{12, 38, 51, 57, 60, 62},
{13, 38, 51, 57, 60, 62},
{13, 38, 51, 57, 60, 62},
{14, 39, 51, 57, 60, 62},
{14, 39, 51, 57, 60, 62},
{15, 39, 51, 57, 60, 62},
{15, 39, 51, 57, 60, 62},
{16, 40, 52, 58, 61, 62},
{16, 40, 52, 58, 61, 62},
{17, 40, 52, 58, 61, 62},
{17, 40, 52, 58, 61, 62},
{18, 41, 52, 58, 61, 62},
{18, 41, 52, 58, 61, 62},
{19, 41, 52, 58, 61, 62},
{19, 41, 52, 58, 61, 62},
{20, 42, 53, 58, 61, 62},
{20, 42, 53, 58, 61, 62},
{21, 42, 53, 58, 61, 62},
{21, 42, 53, 58, 61, 62},
{22, 43, 53, 58, 61, 62},
{22, 43, 53, 58, 61, 62},
{23, 43, 53, 58, 61, 62},
{23, 43, 53, 58, 61, 62},
{24, 44, 54, 59, 61, 62},
{24, 44, 54, 59, 61, 62},
{25, 44, 54, 59, 61, 62},
{25, 44, 54, 59, 61, 62},
{26, 45, 54, 59, 61, 62},
{26, 45, 54, 59, 61, 62},
{27, 45, 54, 59, 61, 62},
{27, 45, 54, 59, 61, 62},
{28, 46, 55, 59, 61, 62},
{28, 46, 55, 59, 61, 62},
{29, 46, 55, 59, 61, 62},
{29, 46, 55, 59, 61, 62},
{30, 47, 55, 59, 61, 62},
{30, 47, 55, 59, 61, 62},
{31, 47, 55, 59, 61, 62},
{31, 47, 55, 59, 61, 62}
};
typedef struct {
uint8_t winners[POOL_NUM_TEAMS];
uint8_t tieBreak;
uint8_t tieBreakDiff;
char name[POOL_BRACKET_NAME_LIMIT];
uint32_t score;
uint32_t maxScore;
uint32_t roundScores[POOL_ROUNDS];
} PoolBracket;
#define POOL_BRACKET_CAPACITY 1024
static uint32_t poolBracketsCount = 0;
static PoolBracket poolBrackets[POOL_BRACKET_CAPACITY] = {0};
static PoolBracket poolTournamentBracket = {
.winners = {0},
.tieBreak = 0,
.name = "Tourney",
.score = 0,
.maxScore = 0,
.roundScores = {0}
};
typedef struct {
uint16_t maxRank;
uint16_t minRank;
uint32_t maxScore;
uint64_t champCounts[POOL_NUM_TEAMS];
uint64_t timesWon;
uint64_t timesTied;
uint32_t possibleScore;
PoolBracket *bracket;
} PoolStats;
typedef struct {
PoolStats *stats;
uint32_t possibleScore;
} PoolScoreStats;
#define POOL_CONFIG_FILE_NAME "config.txt"
#define POOL_TEAMS_FILE_NAME "teams.txt"
#define POOL_RESULTS_FILE_NAME "results.txt"
#define POOL_ENTRIES_DIR_NAME "entries"
typedef enum { PoolScorerBasic = 0, PoolScorerUpset, PoolScorerJoshP, PoolScorerSeedDiff } PoolScorerType;
typedef enum { PoolFormatInvalid = 0, PoolFormatText, PoolFormatJson, PoolFormatBin } PoolReportFormat;
POOLDEF void pool_defaults(void);
POOLDEF void pool_initialize(const char *dirPath);
POOLDEF void pool_team_report(void);
POOLDEF void pool_add_entries_in_dir(const char *dirPath);
POOLDEF void pool_entries_report(void);
POOLDEF void pool_score_report(void);
POOLDEF PoolReportFormat pool_str_to_format(const char *fmtStr);
POOLDEF void pool_possibilities_report(PoolReportFormat fmt, bool progress, int batch, int numBatches, bool restore);
POOLDEF void pool_restore_stats_from_files(PoolStats stats[], uint32_t bracketCount);
POOLDEF void pool_advance_bracket_for_batch(PoolBracket *possibleBracket,
uint8_t gamesLeft[], int *gamesLeftCount, int batch, int numBatches);
POOLDEF void pool_print_entry(PoolBracket *bracket);
POOLDEF void pool_read_config_file(const char *filePath);
POOLDEF void pool_read_team_file(const char *filePath);
POOLDEF uint8_t pool_team_num_for_short_name(const char *shortName);
POOLDEF uint8_t pool_read_entry_to_bracket(const char *filePath, const char *entryName, size_t entryNameSize,
PoolBracket *bracket, bool recordEliminations);
POOLDEF void pool_bracket_score(PoolBracket *bracket, PoolBracket *results);
POOLDEF uint8_t pool_round_of_game(uint8_t gameNum);
POOLDEF void pool_teams_of_game(uint8_t gameNum, uint8_t round, PoolBracket *bracket, uint8_t *team1, uint8_t *team2);
typedef uint32_t (*PoolScorerFunction)(PoolBracket *bracket, PoolBracket *results, uint8_t round, uint8_t game);
POOLDEF uint32_t pool_basic_scorer(PoolBracket *bracket, PoolBracket *results, uint8_t round, uint8_t game);
POOLDEF uint32_t pool_upset_scorer(PoolBracket *bracket, PoolBracket *results, uint8_t round, uint8_t game);
POOLDEF uint32_t pool_josh_p_scorer(PoolBracket *bracket, PoolBracket *results, uint8_t round, uint8_t game);
POOLDEF uint32_t pool_seed_diff_scorer(PoolBracket *bracket, PoolBracket *results, uint8_t round, uint8_t game);
POOLDEF PoolScorerFunction pool_get_scorer_function(PoolScorerType scorerType);
POOLDEF uint8_t pool_loser_of_game(uint8_t gameNum, PoolBracket *bracket);
POOLDEF void pool_print_humanized(FILE *f_stream, uint64_t num, int fieldLength);
#define STRIKE(w, pw, f) ( (pw == 0 ? poolTeams[w-1].eliminated : w != pw ) ? "\033[9m" f "\033[0m" : f )
#define POOL_TEAM_SHORT_NAME(w) ( w == 0 ? "Unk" : poolTeams[w-1].shortName )
#define POOL_TEAM_NAME(w) ( w == 0 ? "Unknown" : poolTeams[w-1].name )
typedef struct {
uint32_t roundScores[POOL_ROUNDS];
PoolScorerType scorerType;
uint32_t payouts[3];
char poolName[POOL_NAME_LIMIT];
PoolScorerFunction poolScorer;
char dirPath[1024];
} PoolConfiguration;
static PoolConfiguration poolConfiguration = {0};
#endif // POOL_C_ IMPLEMENTATION
#ifdef POOL_IMPLEMENTATION
#define UNUSED(x) (void)x
typedef struct {
clock_t start;
uint64_t total;
uint64_t complete;
uint8_t nextPercent;
} PoolProgress;
typedef struct {
uint8_t team;
uint64_t count;
} PoolTeamWins;
POOLDEF int LOG2(int n) {
if (n <= 0) {
return 0;
}
int val = -1;
while (n) {
val++;
n >>= 1;
}
return val;
}
POOLDEF void pool_print_humanized(FILE *f_stream, uint64_t num, int fieldLength) {
if (num < 10000) {
fprintf(f_stream, "%*" PRIu64, fieldLength+1, num);
return;
}
static uint64_t factors[5] = {1e15, 1e12, 1e9, 1e6, 1e3};
static char abbrev[5] = {'Q', 'T', 'B', 'M', 'K'};
for (int i = 0; i < 5; ++i) {
if (factors[i] <= num) {
double dispNum = (double) num / (double) factors[i];
if (dispNum < 10) {
fprintf(f_stream, "%*.3f%c", fieldLength, dispNum, abbrev[i]);
} else if (dispNum < 100) {
fprintf(f_stream, "%*.2f%c", fieldLength, dispNum, abbrev[i]);
} else {
if ((dispNum - (uint64_t) dispNum) >= 0.1) {
fprintf(f_stream, "%*.1f%c", fieldLength, dispNum, abbrev[i]);
} else {
fprintf(f_stream, "%*.0f%c", fieldLength, dispNum, abbrev[i]);
}
}
return;
}
}
}
POOLDEF void pool_inc_progress(PoolProgress *prog) {
if (prog == NULL) {
return;
}
prog->complete += 1;
if (prog->nextPercent == 0) {
fprintf(stderr, "DFS BPS: %12.0f 0%% ETA: --\r", 0.0);
fflush(stdout);
prog->nextPercent += 1;
} else if (prog->complete < prog->total) {
double perc = (double) prog->complete / (double) prog->total * 100.0;
if ( perc > prog->nextPercent || prog->complete == 10000000) {
clock_t curr = clock();
double elapsed_t = (double)(curr - prog->start)/CLOCKS_PER_SEC;
double bps = elapsed_t > 0 ? prog->complete / elapsed_t : 9999999.99;
uint64_t eta = (uint64_t) ((prog->total - prog->complete) / bps);
uint64_t hours = eta / 3600;
uint64_t minutes = (eta - hours * 3600) / 60;
uint64_t secs = eta % 60;
fprintf(stderr, "DFS BPS: %12.0f %3.0f%% ETA: %02" PRIu64 ":%02" PRIu64 ":%02" PRIu64 "\r", bps, perc, hours, minutes, secs);
fflush(stdout);
prog->nextPercent += 1;
}
} else {
clock_t curr = clock();
uint64_t elapsed_t = (uint64_t)(curr - prog->start)/CLOCKS_PER_SEC;
double bps = elapsed_t > 0 ? prog->complete / elapsed_t : 9999999.99;
uint64_t hours = elapsed_t / 3600;
uint64_t minutes = (elapsed_t - hours * 3600) / 60;
uint64_t secs = elapsed_t % 60;
fprintf(stderr, "DFS BPS: %12.0f %3.0f%% ELAPSED: %02" PRIu64 ":%02" PRIu64 ":%02" PRIu64 "\n", bps, 100.0, hours, minutes, secs);
fflush(stdout);
}
}
POOLDEF void pool_teams_of_game(uint8_t gameNum, uint8_t round, PoolBracket *bracket,
uint8_t *team1, uint8_t *team2) {
if (gameNum > POOL_NUM_GAMES - 1) {
fprintf(stderr, "gameNum %d is too big in pool_loser_of_game\n", gameNum);
exit(1);
}
if (round == 0) {
*team1 = gameNum * 2 + 1;
*team2 = *team1 + 1;
} else {
uint8_t gameBase = round == 1 ? 0 : poolGamesInRound[round - 2];
uint8_t prevGame1 = gameBase + (gameNum - poolGamesInRound[round - 1]) * 2;
uint8_t prevGame2 = prevGame1 + 1;
*team1 = bracket->winners[prevGame1];
*team2 = bracket->winners[prevGame2];
}
return;
}
POOLDEF uint8_t pool_loser_of_game(uint8_t gameNum, PoolBracket *bracket) {
if (gameNum > POOL_NUM_GAMES - 1) {
fprintf(stderr, "gameNum %d is too big in pool_loser_of_game\n", gameNum);
exit(1);
}
uint8_t winner = bracket->winners[gameNum];
if (winner == 0) { return 0; }
uint8_t round = pool_round_of_game(gameNum);
if (round == 0) {
winner = winner - 1;
return gameNum*2 + 1 - (winner - gameNum*2) + 1;
}
uint8_t gameBase = round == 1 ? 0 : poolGamesInRound[round - 2];
uint8_t prevGame1 = gameBase + (gameNum - poolGamesInRound[round - 1]) * 2;
uint8_t prevGame2 = prevGame1 + 1;
return bracket->winners[prevGame1] == winner ?
bracket->winners[prevGame2] : bracket->winners[prevGame1];
}
POOLDEF uint32_t pool_basic_scorer(PoolBracket *bracket, PoolBracket *results, uint8_t round, uint8_t game) {
UNUSED(bracket);
UNUSED(results);
UNUSED(game);
return poolConfiguration.roundScores[round];
}
POOLDEF uint32_t pool_seed_diff_scorer(PoolBracket *bracket, PoolBracket *results, uint8_t round, uint8_t game) {
uint8_t resultsLoser = pool_loser_of_game(game, results);
uint8_t bracketLoser = pool_loser_of_game(game, bracket);
uint8_t bonus = 0;
if ( (resultsLoser == 0 && !poolTeams[bracketLoser-1].eliminated) || resultsLoser == bracketLoser) {
PoolTeam *losingTeam = &poolTeams[bracketLoser-1];
uint8_t winner = bracket->winners[game];
PoolTeam *winningTeam = &poolTeams[winner-1];
bonus = winningTeam->seed > losingTeam->seed ? winningTeam->seed - losingTeam->seed : 0;
}
return poolConfiguration.roundScores[round] + bonus;
}
POOLDEF uint32_t pool_josh_p_scorer(PoolBracket *bracket, PoolBracket *results, uint8_t round, uint8_t game) {
UNUSED(results);
uint8_t winner = bracket->winners[game];
PoolTeam *winningTeam = &poolTeams[winner-1];
return poolConfiguration.roundScores[round] * winningTeam->seed;
}
POOLDEF uint32_t pool_upset_scorer(PoolBracket *bracket, PoolBracket *results, uint8_t round, uint8_t game) {
UNUSED(results);
uint8_t winner = bracket->winners[game];
PoolTeam *winningTeam = &poolTeams[winner-1];
return poolConfiguration.roundScores[round] + winningTeam->seed;
}
POOLDEF PoolScorerFunction pool_get_scorer_function(PoolScorerType scorerType) {
switch(scorerType) {
case PoolScorerBasic:
return &pool_basic_scorer;
break;
case PoolScorerUpset:
return &pool_upset_scorer;
break;
case PoolScorerJoshP:
return &pool_josh_p_scorer;
break;
case PoolScorerSeedDiff:
return &pool_seed_diff_scorer;
break;
default:
fprintf(stderr, "Error, unknown PoolScorerType: %d\n", scorerType);
exit(1);
}
}
POOLDEF uint8_t pool_round_of_game(uint8_t gameNum) {
return poolGamesRound[gameNum];
}
POOLDEF void pool_bracket_score(PoolBracket *bracket, PoolBracket *results) {
bracket->score = 0;
bracket->maxScore = 0;
bracket->roundScores[0] = 0;
uint8_t round = 0;
for (uint8_t g = 0; g < POOL_NUM_GAMES; g++) {
if (g >= poolGamesInRound[round]) {
round++;
bracket->roundScores[round] = 0;
}
uint8_t bracketWinner = bracket->winners[g];
uint8_t resultsWinner = results->winners[g];
if (resultsWinner != 0) {
if (bracketWinner == resultsWinner) {
uint32_t gameScore = (*poolConfiguration.poolScorer)(bracket, results, round, g);
bracket->score += gameScore;
bracket->maxScore += gameScore;
bracket->roundScores[round] += gameScore;
}
} else {
if (!poolTeams[bracketWinner - 1].eliminated) {
uint32_t gameScore = (*poolConfiguration.poolScorer)(bracket, results, round, g);
bracket->maxScore += gameScore;
}
}
}
if (results->tieBreak > 0) {
bracket->tieBreakDiff = abs(results->tieBreak - bracket->tieBreak);
}
}
POOLDEF void pool_defaults(void) {
// Set defaults
strcpy(poolConfiguration.poolName, "NCAA Tournament");
poolConfiguration.roundScores[0] = 1;
poolConfiguration.roundScores[1] = 2;
poolConfiguration.roundScores[2] = 4;
poolConfiguration.roundScores[3] = 8;
poolConfiguration.roundScores[4] = 16;
poolConfiguration.roundScores[5] = 32;
poolConfiguration.scorerType = PoolScorerBasic;
poolConfiguration.poolScorer = pool_get_scorer_function(poolConfiguration.scorerType);
}
POOLDEF void pool_initialize(const char *dirPath) {
DIR *dfd;
if ((dfd = opendir(dirPath)) == NULL) {
fprintf(stderr, "Can't open directory %s: %s\n",
dirPath, strerror(errno));
exit(1);
}
strncpy(poolConfiguration.dirPath, dirPath, 1023);
char filePath[1024];
// Read configuration
sprintf(filePath, "%s/%s", dirPath, POOL_CONFIG_FILE_NAME);
pool_read_config_file(filePath);
// Read teams
sprintf(filePath, "%s/%s", dirPath, POOL_TEAMS_FILE_NAME);
pool_read_team_file(filePath);
// Read entries
sprintf(filePath, "%s/%s", dirPath, POOL_ENTRIES_DIR_NAME);
pool_add_entries_in_dir(filePath);
// Read results
sprintf(filePath, "%s/%s", dirPath, POOL_RESULTS_FILE_NAME);
pool_read_entry_to_bracket(filePath, "Tourney", 7, &poolTournamentBracket, true);
closedir(dfd);
}
POOLDEF void pool_print_entry(PoolBracket *bracket) {
printf("%s\n", bracket->name);
printf(" ");
for (size_t g = 0; g < 32; g++) {
uint8_t team1, team2 = 0;
pool_teams_of_game(g, 0, bracket, &team1, &team2);
if (g > 0) { printf(" "); }
printf("%3s", POOL_TEAM_SHORT_NAME(team1));
}
printf("\n");
printf(" ");
for (size_t g = 0; g < 32; g++) {
uint8_t team1, team2 = 0;
pool_teams_of_game(g, 0, bracket, &team1, &team2);
if (g > 0) { printf(" "); }
printf("%3s", POOL_TEAM_SHORT_NAME(team2));
}
printf("\n");
printf("1: ");
for (size_t g = 0; g < 32; g++) {
uint8_t w = bracket->winners[g];
uint8_t pw = poolTournamentBracket.winners[g];
if (g > 0) { printf(" "); }
printf(STRIKE(w, pw, "%3s"), POOL_TEAM_SHORT_NAME(w));
}
printf("\n");
printf("2: ");
for (size_t g = 0; g < 16; g++) {
uint8_t w = bracket->winners[g + 32];
uint8_t pw = poolTournamentBracket.winners[g + 32];
printf(" ");
if (g > 0) { printf(" "); }
printf(STRIKE(w, pw, "%3s"), POOL_TEAM_SHORT_NAME(w));
printf(" ");
}
printf("\n");
printf("3: ");
for (size_t g = 0; g < 8; g++) {
uint8_t w = bracket->winners[g + 48];
uint8_t pw = poolTournamentBracket.winners[g + 48];
printf(" ");
if (g > 0) { printf(" "); }
printf(STRIKE(w, pw, "%3s"), POOL_TEAM_SHORT_NAME(w));
printf(" ");
}
printf("\n");
printf("4: ");
for (size_t g = 0; g < 4; g++) {
uint8_t w = bracket->winners[g + 56];
uint8_t pw = poolTournamentBracket.winners[g + 56];
printf(" ");
if (g > 0) { printf(" "); }
printf(STRIKE(w, pw, "%3s"), POOL_TEAM_SHORT_NAME(w));
printf(" ");
}
printf("\n");
printf("5: ");
for (size_t g = 0; g < 2; g++) {
uint8_t w = bracket->winners[g + 60];
uint8_t pw = poolTournamentBracket.winners[g + 60];
printf(" ");
if (g > 0) { printf(" "); }
printf(STRIKE(w, pw, "%3s"), POOL_TEAM_SHORT_NAME(w));
printf(" ");
}
printf("\n");
uint8_t w = bracket->winners[62];
printf("6: Champion: %s%s%s Tie Breaker: %d\n",
( poolTeams[w-1].eliminated ? "\033[9m" : "" ),
POOL_TEAM_NAME(w),
( poolTeams[w-1].eliminated ? "\033[0m" : "" ),
bracket->tieBreak);
printf("\n\n");
}
POOLDEF int pool_score_cmpfunc (const void * a, const void * b) {
PoolBracket *bracket_b = (PoolBracket *) b;
PoolBracket *bracket_a = (PoolBracket *) a;
int diff = bracket_b->score - bracket_a->score;
if (diff == 0) {
if (poolTournamentBracket.tieBreak > 0) {
diff = bracket_a->tieBreakDiff - bracket_b->tieBreakDiff;
}
}
if (diff == 0) {
diff = bracket_b->maxScore - bracket_a->maxScore;
}
return diff;
}
POOLDEF int pool_champ_counts_cmpfunc (const void * a, const void * b) {
// Handle 64 bit unsigned ints ... with int return value
int64_t diff = *((uint64_t *)b) - *((uint64_t *)a);
if (diff < 0) {
return -1;
} else if (diff > 0) {
return 1;
}
return 0;
}
POOLDEF int pool_stats_possible_score_cmpfunc (const void * a, const void * b) {
return ( ((PoolScoreStats*)b)->possibleScore - ((PoolScoreStats*)a)->possibleScore );
}
POOLDEF int pool_stats_times_won_cmpfunc (const void * a, const void * b) {
PoolStats *aStats = (PoolStats *) a;
PoolStats *bStats = (PoolStats *) b;
int cmp = ( aStats->minRank - bStats->minRank );
if (cmp == 0) {
cmp = ( bStats->timesWon - aStats->timesWon );
}
if (cmp == 0) {
cmp = bStats->timesTied - aStats->timesTied;
}
if (cmp == 0) {
cmp = bStats->maxScore - aStats->maxScore;
}
return cmp;
}
POOLDEF void pool_team_report(void) {
printf("%s: Team Report\n", poolConfiguration.poolName);
printf("%2s %32s %5s %4s %11s\n", "No", "Name", "Short", "Seed", "Eliminated?");
printf("%2s %32s %5s %4s %11s\n", "--", "----", "-----", "----", "-----------");
for (int i = 0; i < POOL_NUM_TEAMS; i++) {
printf("%2d %32s %3s %2d %3s\n",
i + 1,
poolTeams[i].name,
poolTeams[i].shortName,
poolTeams[i].seed,
poolTeams[i].eliminated ? "Yes" : "No"
);
}
}
POOLDEF void pool_advance_bracket_for_batch(PoolBracket *possibleBracket,
uint8_t gamesLeft[], int *gamesLeftCount, int batch, int numBatches) {
if (numBatches <= 1) {
return;
}
if (numBatches > *gamesLeftCount) {
fprintf(stderr, "[ERROR] There are more batches %d than games left %d\n",
numBatches, *gamesLeftCount);
exit(1);
}
int gamesToDecide = LOG2(numBatches);
for (int g = 0; g < gamesToDecide; g++) {
uint8_t round = pool_round_of_game(gamesLeft[g]);
uint8_t team1, team2 = 0;
pool_teams_of_game(gamesLeft[g], round, possibleBracket, &team1, &team2);
uint8_t winner = ( batch & (1 << g) ) == 0 ? team1 : team2;
uint8_t loser = ( batch & (1 << g) ) == 0 ? team2 : team1;
possibleBracket->winners[gamesLeft[g]] = winner;
poolTeams[loser-1].eliminated = true;
/*
printf("Advancing bracket for game %d of %d : %d, choosing winner %s-%s => %s\n",
g, gamesToDecide, gamesLeft[g],
POOL_TEAM_SHORT_NAME(team1),
POOL_TEAM_SHORT_NAME(team2),
POOL_TEAM_SHORT_NAME(possibleBracket->winners[gamesLeft[g]]));
*/
}
memmove(gamesLeft,
gamesLeft + gamesToDecide,
sizeof(uint8_t) * (*gamesLeftCount - gamesToDecide));
*gamesLeftCount -= gamesToDecide;
}
POOLDEF void pool_possibilities_dfs(
uint8_t gamesLeft[], int gamesLeftCount, uint8_t game,
PoolBracket *possibleBracket,
PoolStats stats[], uint32_t numBrackets,
PoolProgress *prog) {
if (game >= gamesLeftCount) {
pool_inc_progress(prog);
PoolScoreStats copyStats[numBrackets];
for (uint32_t i = 0; i < numBrackets; i++) {
copyStats[i].stats = &stats[i];
copyStats[i].possibleScore = stats[i].possibleScore;
}
qsort(copyStats, numBrackets, sizeof(PoolScoreStats), pool_stats_possible_score_cmpfunc);
uint32_t champScore = 0;
uint32_t lastScore = 0;
uint16_t lastRank = 0;
uint8_t champ = possibleBracket->winners[POOL_NUM_GAMES - 1] - 1;
for (uint32_t i = 0; i < numBrackets; i++) {
PoolStats *stat = copyStats[i].stats;
uint16_t realRank = i + 1;
if (i == 0 || stat->possibleScore != lastScore) {
lastRank = realRank;
lastScore = stat->possibleScore;
} else {
realRank = lastRank;
}
if (stat->possibleScore > stat->maxScore) {
stat->maxScore = stat->possibleScore;
}
if (stat->minRank > realRank) {
stat->minRank = realRank;
}
if (stat->maxRank < realRank) {
stat->maxRank = realRank;
}
if (i == 0 || stat->possibleScore == champScore) {
champScore = stat->possibleScore;
stat->champCounts[champ] += 1;
if (i == 0) {
stat->timesWon += 1;
} else {
if (i == 1) {
copyStats[i-1].stats->timesWon -= 1;
copyStats[i-1].stats->timesTied += 1;
}
stat->timesTied += 1;
}
}
}
return;
}
uint8_t gameNum = gamesLeft[game];
uint8_t round = pool_round_of_game(gameNum);
uint8_t team1 = 0;
uint8_t team2 = 0;
pool_teams_of_game(gameNum, round, possibleBracket, &team1, &team2);
assert(team1 != 0);
assert(team2 != 0);
uint8_t teams[2] = { team1, team2 };
for (size_t t = 0; t < 2; t++) {
uint32_t bracketGameScores[numBrackets];
possibleBracket->winners[gameNum] = teams[t];
uint8_t otherTeam = teams[1-t];
poolTeams[otherTeam-1].eliminated = true;
for (size_t i = 0; i < numBrackets; i++) {
bracketGameScores[i] = 0;
if (teams[t] == stats[i].bracket->winners[gameNum]) {
bracketGameScores[i] = (*poolConfiguration.poolScorer)(stats[i].bracket, possibleBracket, round, gameNum);
}
stats[i].possibleScore += bracketGameScores[i];
}
// RECURSE
pool_possibilities_dfs(
gamesLeft, gamesLeftCount, game + 1,
possibleBracket,
stats, poolBracketsCount,
prog);
for (size_t i = 0; i < numBrackets; i++) {
stats[i].possibleScore -= bracketGameScores[i];
bracketGameScores[i] = 0;
}
possibleBracket->winners[gameNum] = 0;
poolTeams[otherTeam-1].eliminated = false;
}
}
POOLDEF PoolReportFormat pool_str_to_format(const char *fmtStr) {
if (strcasecmp(fmtStr, "text") == 0) {
return PoolFormatText;
} else if (strcasecmp(fmtStr, "json") == 0) {
return PoolFormatJson;
} else if (strcasecmp(fmtStr, "bin") == 0) {
return PoolFormatBin;
} else {
fprintf(stderr,
"ERROR: Could not determine report format: %s\n",
fmtStr);
}
return PoolFormatInvalid;
}
POOLDEF void pool_restore_stats_from_files(PoolStats stats[], uint32_t bracketCount) {
struct dirent *dp;
DIR *dfd;
if ((dfd = opendir(poolConfiguration.dirPath)) == NULL) {
fprintf(stderr, "Can't open directory %s: %s\n",
poolConfiguration.dirPath, strerror(errno));
exit(1);
}
char entryFilePath[2048];
while ((dp = readdir(dfd)) != NULL) {
struct stat stbuf;
sprintf(entryFilePath, "%s/%s", poolConfiguration.dirPath, dp->d_name);
if ( stat(entryFilePath, &stbuf) == -1 ) {
// .. do nothing?
continue;
}
if ( S_ISDIR(stbuf.st_mode) ) {
// skip directories
continue;
}
if (strncmp(dp->d_name, "poss_", 5) != 0) {
// skip non-bin files
continue;
}
char *ext = strrchr(entryFilePath, '.');
if (!ext || strncmp(ext+1, "bin", 3) != 0) {
// skip no extension or wrong extension
continue;
}
FILE *in = fopen(entryFilePath, "rb");
if (in == NULL) {
fprintf(stderr, "Could not open possibility report output bin file %s: %s\n",
entryFilePath, strerror(errno));
exit(1);
}
int batch, numBatches = 0;
uint64_t possibleOutcomes = 0;
uint32_t storedBracketCount = 0;
if (fread(&batch, sizeof(batch), 1, in) != 1) {
fprintf(stderr, "ERROR: Could not read batch from %s\n",
entryFilePath);
exit(1);
}
if (fread(&numBatches, sizeof(numBatches), 1, in) != 1) {
fprintf(stderr, "ERROR: Could not read numBatches from %s\n",
entryFilePath);
exit(1);
}
if (fread(&possibleOutcomes, sizeof(possibleOutcomes), 1, in) != 1) {
fprintf(stderr, "ERROR: Could not read possibleOutcomes from %s\n",
entryFilePath);
exit(1);
}
if (fread(&storedBracketCount, sizeof(storedBracketCount), 1, in) != 1) {
fprintf(stderr, "ERROR: Could not read bracketCount from %s\n",
entryFilePath);
exit(1);
}
assert(storedBracketCount == bracketCount);
for (size_t i = 0; i < bracketCount; i++) {
PoolStats partialStat = {0};
char bracketName[POOL_BRACKET_NAME_LIMIT];
size_t len = fread(bracketName, 1, POOL_BRACKET_NAME_LIMIT, in);
assert(len == POOL_BRACKET_NAME_LIMIT);
if (fread(&partialStat, sizeof(PoolStats), 1, in) != 1) {
fprintf(stderr, "ERROR: Could not read PoolStats from %s\n",
entryFilePath);
exit(1);
}
PoolStats *aggStats = NULL;
for (size_t b = 0; b < bracketCount; b++) {
if (strcmp(stats[b].bracket->name, bracketName) == 0) {
aggStats = &stats[b];
}
}
assert(aggStats);
// combine partial stats with aggregate aggStats
aggStats->maxRank = (aggStats->maxRank < partialStat.maxRank ? partialStat.maxRank : aggStats->maxRank);
aggStats->minRank = (aggStats->minRank > partialStat.minRank ? partialStat.minRank : aggStats->minRank);
aggStats->maxScore = (aggStats->maxScore < partialStat.maxScore ? partialStat.maxScore : aggStats->maxScore);
aggStats->timesWon += partialStat.timesWon;
aggStats->timesTied += partialStat.timesTied;
for (size_t t = 0; t < POOL_NUM_TEAMS; t++) {
aggStats->champCounts[t] += partialStat.champCounts[t];
}
}
fclose(in);
}
}
POOLDEF void pool_possibilities_report(PoolReportFormat fmt, bool progress, int batch, int numBatches, bool restore) {
if (poolBracketsCount == 0) {
fprintf(stderr, ">>>> There are no entries in this pool. <<<<\n");
return;
}
char filePath[2048];
// Set up posible bracket
PoolBracket possibleBracket = {
.winners = {0},
.tieBreak = poolTournamentBracket.tieBreak,
.name = "possible",
.maxScore = 0,
.roundScores = {0}
};
memcpy(possibleBracket.winners, poolTournamentBracket.winners, sizeof(uint8_t) * POOL_NUM_TEAMS);
// Set up data for DFS
uint8_t gamesLeft[POOL_NUM_GAMES];
int gamesLeftCount = 0;
for (uint8_t g = 0; g < POOL_NUM_GAMES; g++) {
if (poolTournamentBracket.winners[g] == 0) {
gamesLeft[gamesLeftCount] = g;
gamesLeftCount += 1;
}
}
if (gamesLeftCount == 0) {
fprintf(stderr, ">>>> There are no games left in this pool. <<<<\n");
return;
}
// If we are running a batch advance possible bracket accordingly
pool_advance_bracket_for_batch(&possibleBracket, gamesLeft, &gamesLeftCount, batch, numBatches);
uint64_t possibleOutcomes = 2L << (gamesLeftCount - 1);
if (fmt == PoolFormatText) {
printf("There are %d teams and %d games remaining, ",
gamesLeftCount + 1, gamesLeftCount);
pool_print_humanized(stdout, possibleOutcomes, 6);
printf(" possible outcomes\n");
printf("%s: Possibilities Report\n", poolConfiguration.poolName);
}
PoolStats stats[POOL_BRACKET_CAPACITY] = {0};
for (size_t i = 0; i < poolBracketsCount; i++) {
stats[i].bracket = &poolBrackets[i];
pool_bracket_score(&poolBrackets[i], &possibleBracket);
stats[i].possibleScore = poolBrackets[i].score;
stats[i].minRank = poolBracketsCount + 1;
}
if (!restore) {
PoolProgress prog;
prog.start = clock();
prog.total = possibleOutcomes;
prog.complete = 0;
prog.nextPercent = 0;
pool_possibilities_dfs(
gamesLeft, gamesLeftCount, 0,
&possibleBracket,
stats, poolBracketsCount,
progress ? &prog : NULL);
} else {
pool_restore_stats_from_files(stats, poolBracketsCount);
}
qsort(stats, poolBracketsCount, sizeof(PoolStats), pool_stats_times_won_cmpfunc);
switch (fmt) {
case PoolFormatText:
{
printf("%20s %4s %4s %5s %5s %6s %6s %6s\n", "",
"Min", "Max", "Curr", "Max ", "Win ", "Times", "Times");
printf("%20s %4s %4s %5s %5s %6s %6s %6s %-20s\n", "Name ",
"Rank", "Rank", "Score", "Score", "Chance", "Won ", "Tied", "Top Champs");
for (size_t i = 0; i < poolBracketsCount; i++) {
PoolStats *stat = &stats[i];
float winChance = (float) stat->timesWon / (float) possibleOutcomes * 100.0;
printf("%20.20s %4d %4d %5d %5d %6.2f ", stat->bracket->name,
stat->minRank, stat->maxRank, stat->bracket->score,
stat->maxScore, winChance);
pool_print_humanized(stdout, stat->timesWon, 5);
printf(" ");
pool_print_humanized(stdout, stat->timesTied, 5);
printf(" ");
if (stat->timesWon > 0 || stat->timesTied > 0) {
PoolTeamWins top5[5] = {0};
for (size_t t = 0; t < POOL_NUM_TEAMS; t++) {
if (stat->champCounts[t] > 0) {
for(size_t j = 0; j < 5; j++) {
if (stat->champCounts[t] > top5[j].count) {
for(size_t k = 4; k > j; k--) {
top5[k].team = top5[k-1].team;
top5[k].count = top5[k-1].count;
}
top5[j].team = t + 1;
top5[j].count = stat->champCounts[t];
break;
}
}
}
}
for (size_t w = 0; w < 5; w++) {
if (top5[w].team != 0) {
if (w > 0) { printf(","); }
printf("%s", POOL_TEAM_SHORT_NAME(top5[w].team));
}
}
}
printf("\n");
}
break;
case PoolFormatJson:
printf("{");
printf("\"pool\": {");
printf("\"name\": \"%s\",", poolConfiguration.poolName);
printf("\"outcomes\": %" PRIu64 ",", possibleOutcomes);
printf("\"batch\": %d,", batch);
printf("\"numBatches\": %d", numBatches);
printf("},");
printf("\"entries\": [");
for (size_t i = 0; i < poolBracketsCount; i++) {
PoolStats *stat = &stats[i];
float winChance = (float) stat->timesWon / (float) possibleOutcomes * 100.0;
if (i > 0) { printf(","); }
printf("{");
printf("\"name\": \"%s\",", stat->bracket->name);
printf("\"minRank\": %d,", stat->minRank);
printf("\"maxRank\": %d,", stat->maxRank);
printf("\"currentScore\": %d,", stat->bracket->score);
printf("\"maxScore\": %d,", stat->maxScore);
printf("\"winChance\": %.6f,", winChance);
printf("\"timesWon\": %" PRIu64 ",", stat->timesWon);
printf("\"timesTied\": %" PRIu64 ",", stat->timesTied);
printf("\"champs\": [");
bool first = true;
for (size_t t = 0; t < POOL_NUM_TEAMS; t++) {
if (stat->champCounts[t] > 0) {
if (!first) { printf(","); }
printf("{");
printf("\"team\": {");
printf("\"number\": %ld,", t + 1);
printf("\"shortName\": \"%s\"", POOL_TEAM_SHORT_NAME(t + 1));
printf("},");
printf("\"timesWon\": %" PRIu64, stat->champCounts[t]);
printf("}");
first = false;
}
}
printf("]");
printf("}");
}
printf("]");
printf("}\n");
break;
case PoolFormatBin:
sprintf(filePath, "%s/poss_%d_of_%d.bin", poolConfiguration.dirPath, batch, numBatches);
FILE * out = fopen(filePath, "wb");
if (out == NULL) {
fprintf(stderr, "Could not open possibility report output bin file %s: %s\n",
filePath, strerror(errno));
exit(1);
}
fwrite(&batch, sizeof(batch), 1, out);
fwrite(&numBatches, sizeof(numBatches), 1, out);