2 addtd = function(tr, className, content) {
3 var td = document.createElement("td");
4 td.appendChild(document.createTextNode(content));
5 td.className = className;
8 addth = function(tr, className, content) {
9 var th = document.createElement("th");
10 th.appendChild(document.createTextNode(content));
11 th.className = className;
15 subrank_partitions = function(games, parts, start_rank, tiebreakers) {
17 for (var i = 0; i < parts.length; ++i) {
18 var part = rank(games, parts[i], start_rank, tiebreakers);
19 for (var j = 0; j < part.length; ++j) {
22 start_rank += part.length;
27 partition = function(teams, compare)
32 var curr_part = [teams[0]];
33 for (var i = 1; i < teams.length; ++i) {
34 if (compare(teams[i], curr_part[0]) != 0) {
35 parts.push(curr_part);
38 curr_part.push(teams[i]);
40 if (curr_part.length != 0) {
41 parts.push(curr_part);
46 explain_tiebreaker = function(parts, rule_name)
49 for (var i = 0; i < parts.length; ++i) {
50 result.push(parts[i].map(function(x) { return x.shortname; }).join("/"));
52 return result.join(" > ") + " (" + rule_name + ")";
55 make_teams_to_idx = function(teams)
57 var teams_to_idx = [];
58 for (var i = 0; i < teams.length; i++) {
59 teams_to_idx[teams[i].name] = i;
64 partition_by_beat = function(games, teams)
66 // Head-to-head score by way of components. First construct the beat matrix.
68 var beat = new Array(n);
69 var teams_to_idx = make_teams_to_idx(teams);
70 for (var i = 0; i < n; i++) {
71 beat[i] = new Array(n);
72 for (var j = 0; j < n; j++) {
76 for (i = 0; i < games.length; ++i) {
77 var idx1 = teams_to_idx[games[i].name1];
78 var idx2 = teams_to_idx[games[i].name2];
79 if (idx1 !== undefined && idx2 !== undefined) {
80 if (games[i].score1 > games[i].score2) {
83 if (games[i].score1 < games[i].score2) {
88 // Floyd-Warshall for transitive closure.
89 for (var k = 0; k < n; ++k) {
90 for (var i = 0; i < n; ++i) {
91 for (var j = 0; j < n; ++j) {
92 if (beat[i][k] && beat[k][j]) {
99 // See if we can find any team that is comparable to all others.
100 for (var pivot_idx = 0; pivot_idx < n; pivot_idx++) {
101 var incomparable = false;
102 for (var i = 0; i < n; ++i) {
103 if (i != pivot_idx && beat[pivot_idx][i] == 0 && beat[i][pivot_idx] == 0) {
109 // Split the teams into three partitions:
110 var better_than_pivot = [], equal = [], worse_than_pivot = [];
111 for (var i = 0; i < n; ++i) {
112 var we_beat = (beat[pivot_idx][i] == 1);
113 var they_beat = (beat[i][pivot_idx] == 1);
114 if ((i == pivot_idx) || (we_beat && they_beat)) {
115 equal.push(teams[i]);
116 } else if (we_beat && !they_beat) {
117 worse_than_pivot.push(teams[i]);
118 } else if (they_beat && !we_beat) {
119 better_than_pivot.push(teams[i]);
121 console.log("this shouldn't happen");
125 if (better_than_pivot.length > 0) {
126 result = partition_by_beat(games, better_than_pivot);
128 result.push(equal); // Obviously can't be partitioned further.
129 if (worse_than_pivot.length > 0) {
130 result = result.concat(partition_by_beat(games, worse_than_pivot));
136 // No usable pivot was found, so the graph is inherently
137 // disconnected, and we cannot partition it.
141 // Takes in an array, gives every element a rank starting with 1, and returns.
142 rank = function(games, teams, start_rank, tiebreakers) {
143 if (teams.length <= 1) {
144 // Only one team, so trivial.
145 teams[0].rank = start_rank;
149 // Rule #0: Partition the teams by score.
150 var score_parts = partition(teams, function(a, b) { return b.pts - a.pts });
151 if (score_parts.length > 1) {
152 return subrank_partitions(games, score_parts, start_rank, tiebreakers);
155 // Rule #1: Head-to-head wins.
156 var beat_parts = partition_by_beat(games, teams);
157 if (beat_parts.length > 1) {
158 tiebreakers.push(explain_tiebreaker(beat_parts, 'head-to-head'));
159 return subrank_partitions(games, beat_parts, start_rank, tiebreakers);
162 // Rule #2: Number of games played (fewer is better).
163 // Actually the rule says “fewest losses”, but fewer games is equivalent
164 // as long as teams have the same amount of points and ties don't exist.
165 var nplayed_parts = partition(teams, function(a, b) { return a.nplayed - b.nplayed });
166 if (nplayed_parts.length > 1) {
167 tiebreakers.push(explain_tiebreaker(nplayed_parts, 'fewer losses'));
168 return subrank_partitions(games, nplayed_parts, start_rank, tiebreakers);
171 // Rule #3: Head-to-head goal difference.
172 var teams_to_idx = make_teams_to_idx(teams);
173 for (var i = 0; i < teams.length; i++) {
175 teams[i].h2h_goals = 0;
178 for (i = 0; i < games.length; ++i) {
179 var idx1 = teams_to_idx[games[i].name1];
180 var idx2 = teams_to_idx[games[i].name2];
181 if (idx1 !== undefined && idx2 !== undefined) {
182 teams[idx1].h2h_gd += games[i].score1;
183 teams[idx1].h2h_gd -= games[i].score2;
184 teams[idx2].h2h_gd += games[i].score2;
185 teams[idx2].h2h_gd -= games[i].score1;
187 teams[idx1].h2h_goals += games[i].score1;
188 teams[idx2].h2h_goals += games[i].score2;
190 if (idx1 !== undefined) {
191 teams[idx1].goals += games[i].score1;
193 if (idx2 !== undefined) {
194 teams[idx2].goals += games[i].score2;
197 var h2h_gd_parts = partition(teams, function(a, b) { return b.h2h_gd - a.h2h_gd });
198 if (h2h_gd_parts.length > 1) {
199 tiebreakers.push(explain_tiebreaker(h2h_gd_parts, 'head-to-head goal difference'));
200 return subrank_partitions(games, h2h_gd_parts, start_rank, tiebreakers);
203 // Rule #4: Global goal difference. (Well, not strictly, but good enough.)
204 var gd_parts = partition(teams, function(a, b) { return b.gd - a.gd });
205 if (gd_parts.length > 1) {
206 tiebreakers.push(explain_tiebreaker(gd_parts, 'overall goal difference'));
207 return subrank_partitions(games, gd_parts, start_rank, tiebreakers);
210 // Rule #5: Head-to-head scored goals.
211 var h2h_goals_parts = partition(teams, function(a, b) { return b.h2h_goals - a.h2h_goals });
212 if (h2h_goals_parts.length > 1) {
213 tiebreakers.push(explain_tiebreaker(h2h_goals_parts, 'head-to-head scored goals'));
214 return subrank_partitions(games, h2h_goals_parts, start_rank, tiebreakers);
217 // Rule #6: Overall scored goals. (Same caveat as #4.)
218 var goals_parts = partition(teams, function(a, b) { return b.goals - a.goals });
219 if (goals_parts.length > 1) {
220 tiebreakers.push(explain_tiebreaker(goals_parts, 'scored goals'));
221 return subrank_partitions(games, goals_parts, start_rank, tiebreakers);
224 // OK, it's a tie. Give them all the same rank.
226 for (var i = 0; i < teams.length; ++i) {
227 result.push(teams[i]);
228 result[i].rank = start_rank;
233 var req = new XMLHttpRequest();
234 req.onload = function(e) {
235 var response = JSON.parse(req.responseText);
236 console.log(response.values);
237 var carousel = document.getElementById('carousel');
239 for (var i = 2; response.values[i].length >= 1; ++i) {
241 "name": response.values[i][0],
242 "shortname": response.values[i][1],
243 "nplayed": parseInt(response.values[i][2]),
244 "gd": parseInt(response.values[i][3].replace(/−/, '-')),
245 "pts": parseInt(response.values[i][4])
249 for (var i = 12; response.values[i] !== undefined && response.values[i].length >= 1; ++i) {
250 if (response.values[i][2] && response.values[i][3]) {
252 "name1": response.values[i][0],
253 "name2": response.values[i][1],
254 "score1": parseInt(response.values[i][2]),
255 "score2": parseInt(response.values[i][3])
262 teams = rank(games, teams, 1, tiebreakers);
263 console.log(tiebreakers. join(", "));
266 for (i = 0; i < teams.length; ++i) {
267 var tr = document.createElement("tr");
269 addth(tr, "rank", teams[i].rank);
270 addtd(tr, "team", teams[i].name);
271 addtd(tr, "nplayed", teams[i].nplayed);
272 addtd(tr, "gd", teams[i].gd.toString().replace(/-/, '−'));
273 addtd(tr, "pts", teams[i].pts);
275 tr.style = "-webkit-animation: fade-in 1.0s ease; -webkit-animation-delay: " + 0.25 * (row_num++) + "s; -webkit-animation-fill-mode: both;";
276 carousel.appendChild(tr);
279 if (tiebreakers.length > 0) {
280 var tie_tr = document.createElement("tr");
281 tie_tr.className = "footer";
282 tie_tr.style = "-webkit-animation: fade-in 2.0s ease; -webkit-animation-delay: " + 0.25 * (row_num++) + "s; -webkit-animation-fill-mode: both;";
283 var td = document.createElement("td");
284 td.appendChild(document.createTextNode("Tiebreaks applied: " + tiebreakers.join(', ')));
285 td.setAttribute("colspan", "5");
286 tie_tr.appendChild(td);
287 carousel.appendChild(tie_tr);
290 var footer_tr = document.createElement("tr");
291 footer_tr.className = "footer";
292 footer_tr.style = "-webkit-animation: fade-in 2.0s ease; -webkit-animation-delay: " + 0.25 * (row_num++) + "s; -webkit-animation-fill-mode: both;";
293 var td = document.createElement("td");
294 td.appendChild(document.createTextNode("www.trondheimfrisbeeklubb.no | #trøndisk"));
295 td.setAttribute("colspan", "5");
296 footer_tr.appendChild(td);
297 carousel.appendChild(footer_tr);
298 console.log(footer_tr);
300 carousel.style.display = 'table';
302 req.open('GET', 'https://sheets.googleapis.com/v4/spreadsheets/1CwRHQtpokVMGTPJu2FYYG-6rnG7OfISIcEHwBfXh-Y4/values/A1:E22?key=AIzaSyAuP9yQn8g0bSay6r_RpGtpFeIbwprH1TU');