X-Git-Url: https://projects.mako.cc/source/selectricity-live/blobdiff_plain/34fe63727a8929d7e9c529feee1f0c1e827acdfa..6aacfa3b17f012fbdaa191a89af9fc51d7250d79:/app/models/election.rb?ds=sidebyside diff --git a/app/models/election.rb b/app/models/election.rb index 0907e68..a3e9394 100644 --- a/app/models/election.rb +++ b/app/models/election.rb @@ -1,25 +1,52 @@ +# 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 Election < ActiveRecord::Base has_many :candidates has_many :voters has_many :votes belongs_to :user validates_presence_of :name, :description - + + #validate that method is one of the listed election types + + attr_reader :plurality_result + attr_reader :approval_result + attr_reader :condorcet_result + attr_reader :ssd_result + attr_reader :borda_result + require 'date' + + def initialize(params={}) + super + self.enddate = read_attribute( :enddate ) || \ + Time.now + 30.days - 1.second + end - def startdate - read_attribute( :startdate ) || Time.now + def other_methods + if election_method + @other_methods = ELECTION_TYPES.keys.reject {|i| i == election_method} + else + @other_methods = nil + end + @other_methods end - def enddate - date = read_attribute( :enddate ) || Time.now + 14 - date - 1.second + def startdate + read_attribute( :startdate ) || Time.now end - def enddate=(date) - date += 1.day - date = Time.gm(*date) - super(date) + def votes + votes = Array.new + self.voters.each do |voter| + votes << voter.vote + end + return votes end def destroy @@ -31,12 +58,11 @@ class Election < ActiveRecord::Base def start_blockers reasons = [] - if self.candidates.length <= 1 reasons << "You must have at least two candidates." end - if self.voters.length <= 1 + if self.voters.length <= 1 and self.authenticated? reasons << "You must have at least two voters." end @@ -49,7 +75,7 @@ class Election < ActiveRecord::Base end def quickvote? - quickvote.to_i == 1 + self.class == QuickVote end def active? @@ -60,6 +86,14 @@ class Election < ActiveRecord::Base active == 2 end + def authenticated? + authenticated + end + + def kiosk? + kiosk + end + def shortdesc shortdesc = description.split(/\n/)[0] end @@ -68,4 +102,68 @@ class Election < ActiveRecord::Base longdesc = description.split(/\n/)[1..-1].join("") longdesc.length > 0 ? longdesc : nil end + + #Calculate results if not in memcache + def results + # Assignment is intentional + if Cache and c = Cache.get("election_results:#{id}:#{self.votes.length}") + @plurality_result = c['plurality'] + @approval_result = c['approval'] + @condorcet_result = c['condorcet'] + @ssd_result = c['ssd'] + @borda_result = c['borda'] + return c + elsif Cache + # memcache is available, but missed. + results = self.results! + Cache.set("election_results:#{id}:#{self.votes.length}", results) + return results + else + return self.results! + end + end + + #Always Calculate Election Results + def results! + # initalize the tallies to empty arrays + preference_tally = Array.new + plurality_tally = Array.new + approval_tally = Array.new + + self.voters.each do |voter| + # skip if the voter has not voted or has an unconfirmed vote + next unless voter.voted? + + plurality_tally << voter.vote.rankings.sort[0].candidate.id + approval_tally << voter.vote.rankings.sort[0..1].collect \ + { |ranking| ranking.candidate.id } + preference_tally << voter.vote.rankings.sort.collect \ + { |ranking| ranking.candidate.id } + end + + @plurality_result = PluralityVote.new(plurality_tally).result + @approval_result = ApprovalVote.new(approval_tally).result + @condorcet_result = PureCondorcetVote.new(preference_tally).result + @ssd_result = CloneproofSSDVote.new(preference_tally).result + @borda_result = BordaVote.new(preference_tally).result + + { 'plurality' => @plurality_result, + 'approval' => @approval_result, + 'condorcet' => @condorcet_result, + 'ssd' => @ssd_result, + 'borda' => @borda_result } + end + + def names_by_id + names = Hash.new + + competitors = self.candidates.sort.collect {|candidate| candidate.id} + competitors.each do |candidate| + names[candidate] = Candidate.find(candidate).name + end + + names + end end + +