forked from errorcodexero/standing_predictor
-
Notifications
You must be signed in to change notification settings - Fork 1
Expand file tree
/
Copy pathannotated_complex.cpp
More file actions
200 lines (170 loc) · 4.56 KB
/
Copy pathannotated_complex.cpp
File metadata and controls
200 lines (170 loc) · 4.56 KB
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
#include "annotated_complex.h"
#include "event_limits.h"
#include "query.h"
using namespace std;
/*template<typename T>
void print_r(int n,Event_annotated<T> const& a){
indent(n);
cout<<"Event_annotated\n";
n++;
indent(n);
cout<<"data\n";
print_r(n+1,a.data.key);//for the sake of space
indent(n);
cout<<"extra\n";
print_r(n+1,a.extra);
}*/
template<typename A,typename B>
void print_r(int n,District_cmp_complex_annotated<A,B> const& a){
indent(n);
cout<<"District_cmp_complex_annotated\n";
n++;
indent(n);
cout<<"finals\n";
print_r(n+1,a.finals);
indent(n);
cout<<"divisions\n";
print_r(n+1,a.divisions);
indent(n);
cout<<"extra\n";
print_r(n+1,a.extra);
}
template<typename A,typename B,typename C>
void print_r(int n,Event_categories_annotated<A,B,C> const& a){
indent(n);
cout<<"Event_categories_annotated\n";
n++;
indent(n);
cout<<"local\n";
print_r(n+1,a.local);
indent(n);
cout<<"dcmp\n";
print_r(n+1,a.dcmp);
indent(n);
cout<<"extra\n";
print_r(n+1,a.extra);
}
template<typename T>
auto extras(T const& a){
return mapf([](auto const& x){ return x.extra; },a);
}
struct Walker{
TBA_fetcher &f;
std::optional<tba::Date> cutoff_date;
bool use_event(tba::Event const& e){
if(!cutoff_date){
return 1;
}
//return *e.end_date<tba::Date(std::chrono::year(2025),std::chrono::month(3),std::chrono::day(2));
assert(e.end_date);
return e.end_date<=cutoff_date;
}
auto operator()(tba::Event const& a){
return Event_annotated{
a,
event_limits(f,a.key,use_event(a))
};
}
auto operator()(std::vector<tba::Event> const& a){
return mapf([&](auto const& x){ return (*this)(x); },a);
}
auto operator()(District_cmp_complex const& a){
auto finals=(*this)(a.finals);
auto divisions=(*this)(a.divisions);
auto calc=[&](){
if(!divisions.empty()){
auto last_division_status=min(mapf([&](auto x){ return x.extra.status; },divisions));
if(last_division_status!=Tournament_status_complete()){
return last_division_status;
}
}
return finals.extra.status;
};
return District_cmp_complex_annotated{finals,divisions,calc()};
}
template<typename T1,typename T2>
std::variant<
District_status_future,
District_status_dcmp_in_progress,
District_status_complete
> dcmp_status(std::vector<District_cmp_complex_annotated<T1,T2>> const& a){
//this basically duplidates dcmp_status from event_limits.cpp
if(a.empty()){
return District_status_complete();
}
//auto m=map_preserve([&](auto x){return
auto opts=to_set(mapf([](auto const& x){ return x.extra; },a));
if(opts==std::set<Tournament_status>{Qual_status_future()}){
return District_status_future();
}
if(opts==std::set<Tournament_status>{Tournament_status_complete()}){
return District_status_complete();
}
return District_status_dcmp_in_progress([&](){
std::map<Tournament_status,std::vector<tba::Event_key>> r;
for(auto const& x:a){
auto event=x.finals.data.key;
auto result=x.extra;
r[result]|=event;
}
return r;
}());
}
template<typename T1,typename T2>
auto operator()(
std::vector<Event_annotated<T1>> const& locals,
std::vector<District_cmp_complex_annotated<T1,T2>> const& dcmp,
std::vector<District_cmp_complex_annotated<T1,T2>> const& cmp
){
(void)dcmp;
(void)cmp;
//this is basically duplicating district_limits()
auto local_status=to_set(mapf([](auto x){ return x.extra.status; },locals));
Rank_status<District_status> r;
map<tba::Team_key,int> plays;
for(auto const& here:extras(locals)){
for(auto [k,v]:here.by_team){
auto &p=plays[k];
if(p<2){
r.by_team[k]+=v;
}
p++;
}
r.unclaimed+=here.unclaimed;
}
r.status=[&]()->District_status{
if(local_status==set<Tournament_status>{Qual_status_future()}){
return District_status_future();
}
if(local_status!=set<Tournament_status>{Tournament_status_complete()}){
auto k2=dict(mapf(
[](auto const& x){ return make_pair(x.data.key,x.extra.status); },
locals
));
return District_status_locals_in_progress(invert(k2));
}
auto d=dcmp_status(dcmp);
return std::visit([](auto x){ return District_status(x); },d);
}();
return r;
}
};
Event_categories_annotated<
Rank_status<Tournament_status>,
Tournament_status,
Rank_status<District_status>
> annotated(
TBA_fetcher &f,
tba::District_key const& a,
std::optional<tba::Date> cutoff
){
return mapf_preserve(Walker{f,cutoff},categorize_events(f,a));
}
int annotated_complex_demo(TBA_fetcher& f){
for(auto district:districts(f)){
annotated(f,district);
}
auto a=annotated(f,tba::District_key("2026pnw"));
print_r(a);
return 0;
}