module Scheduling class Elimination include Rails.application.routes.url_helpers def initialize(tournament_stage) @tournament_stage = tournament_stage end def tournament_stage @tournament_stage end def tournament self.tournament_stage.tournament end def create_matches num_teams = (self.tournament.players.count/self.tournament.min_players_per_team).floor num_matches = num_teams - 1 for i in 1..num_matches self.tournament_stage.matches.create(status: 0, submitted_peer_evaluations: 0) end match_num = num_matches-1 team_num = 0 self.tournament.players.shuffle # for each grouping of min_players_per_team self.tournament.players.each_slice(self.tournament.min_players_per_team) do |team_members| # if the match is full, move to the next match, otherwise move to the next team if (team_num == self.tournament.min_teams_per_match) match_num -= 1 team_num = 0 else team_num += 1 end # create a new team in the current match self.tournament_stage.matches[match_num].teams.push(Team.create(users: team_members)) end end def match_finished(match) matches = match.tournament_stage.matches_ordered cur_match_num = matches.invert[match] unless cur_match_num == 1 match.winner.matches.push(matches[cur_match_num/2]) end end def graph(current_user) matches = @tournament_stage.matches_ordered numTeams = @tournament_stage.tournament.min_teams_per_match logBase = numTeams # depth of SVG tree depth = Math.log(matches.count*(logBase-1),logBase).floor+1; # height of SVG matchHeight = 50*logBase; height = [(matchHeight+50) * logBase**(depth-1) + 100, 500].max; lastrx = 0 lastry = 0 lastrh = 0 lastrw = 0 str = <<-STRING STRING (1..matches.count).each do |i| matchDepth = Math.log(i*(logBase-1), logBase).floor+1 base = (logBase**(matchDepth-1)/(logBase-1)).ceil rh = 100 / (logBase**(depth-1)+1) - 100/height; rw = 100/(depth+1) - 5 rx = 50/(depth+1) + 100/(depth+1)*(depth-matchDepth) ry = 100/(logBase**(matchDepth-1)+1) * (i-base+1) - rh/2 str += "\t\n" str += "\t\t\n" if matches[i].teams[t-1] str += "\t\tTeam #{matches[i].teams[t-1].id}\n" end if (t < numTeams) str += "\t\t VS \n" end t = t + 1 end if i > 1 parent = (i+logBase-2)/logBase pDepth = Math.log(parent*(logBase-1), logBase).floor+1 pBase = (logBase**(pDepth-1)/(logBase-1)).ceil lastrx = 50/(depth+1) + 100/(depth+1)*(depth-pDepth) lastry = 100/(logBase**(pDepth-1)+1) * (parent-pBase+1) - rh/2 str += "\t\t\n" end str += "\n" end str += '' return str end end end