X-Git-Url: https://projects.mako.cc/source/selectricity/blobdiff_plain/c5fda1e5174238779afd496014379d6446d1e3c1..b82ac70a3367072882aa259dae0b6a1b6e3288fa:/app/models/vote.rb?ds=inline diff --git a/app/models/vote.rb b/app/models/vote.rb index 82f34a9..cc42311 100644 --- a/app/models/vote.rb +++ b/app/models/vote.rb @@ -1,3 +1,10 @@ +# Selectricity: Voting Machinery for the Masses +# Copyright (C) 2007, 2008 Benjamin Mako Hill +# Copyright (C) 2007 Massachusetts Institute of Technology +# +# This program is free software. Please see the COPYING file for +# details. + class Vote < ActiveRecord::Base # relationships to other classes belongs_to :voter @@ -7,13 +14,13 @@ class Vote < ActiveRecord::Base # callbacks after_update :save_rankings before_destroy :destroy_rankings - + def to_s votes.join("") end def each - votes.each {|vote| yield vote} + self.votes.each {|vote| yield vote} end def votes @@ -21,7 +28,7 @@ class Vote < ActiveRecord::Base if rankings.empty? @votes = Array.new else - @votes = rankings.sort.collect { |ranking| ranking.candidate.id } + @votes = self.rankings.sort.collect { |ranking| ranking.candidate.id } end end @@ -33,14 +40,22 @@ class Vote < ActiveRecord::Base end def save_rankings + self.votes # i need to initalize this before destroying rankings + # or else the ranks themselves show up as nil + destroy_rankings - self.votes.each_with_index do |candidate, index| + self.votes.each_with_index do |candidate_id, index| ranking = Ranking.new - ranking.rank = index + 1 - ranking.candidate = Candidate.find(candidate) + ranking.rank = index + ranking.candidate = Candidate.find(candidate_id) self.rankings << ranking end end + + def destroy + self.destroy_rankings + super + end def destroy_rankings rankings.each { |ranking| ranking.destroy } @@ -48,29 +63,38 @@ class Vote < ActiveRecord::Base def confirm! self.confirmed = 1 + self.time = Time.now self.save - - token.destroy and token.reload if token - self.token = Token.new - self.save + + unless self.voter.election.quickvote? + token.destroy and token.reload if token + self.token = Token.new + self.save + end end def confirm? - if confirm == 1 - return true - else - return false - end + confirmed == 1 end - def votestring=(string="") - candidate_ids = voter.election.candidates.sort.collect \ - { |candidate| candidate.id.to_i } + def votestring + # create a mapping of candidates ids and the relative order of the + # candidates as they appear when sorted alphabetically + cand_relnums = {} + self.voter.election.candidates.sort.each_with_index do |c, i| + cand_relnums[c.id] = i + 1 + end - rel_votes = string.split("").collect { |vote| vote.to_i } - - # covert relative orders to absolute candidate ids - self.votes = rel_votes.collect { |vote| candidate_ids[ vote - 1 ] } + # assemble the votestring + self.votes.collect {|v| (cand_relnums[v] + 64).chr}.join("") end + # the following subroutine is used for quickvotes, but need for elections now + # too. It creates a vote with the candidates listed in order of preference + # based on alphabetical order. Meant to be manipulated and then confirmed + def set_defaults! + self.votes = self.voter.election.candidates.sort_by { rand }.collect {|c| c.id } + self.save + end + end