X-Git-Url: https://projects.mako.cc/source/selectricity-live/blobdiff_plain/fd484b33a3920e0031007c5c2f1dec61913cbab5..b82ac70a3367072882aa259dae0b6a1b6e3288fa:/app/models/election.rb?ds=sidebyside diff --git a/app/models/election.rb b/app/models/election.rb index ba466b4..4ce571a 100644 --- a/app/models/election.rb +++ b/app/models/election.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 Election < ActiveRecord::Base has_many :candidates has_many :voters @@ -5,14 +12,44 @@ class Election < ActiveRecord::Base belongs_to :user validates_presence_of :name, :description + # enforce constraints associated with dependencies (i.e., a kiosk + # election can't also be unauthenticated) + before_save :enforce_constraints + + #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 other_methods + if election_method + @other_methods = ELECTION_TYPES.keys.reject {|i| i == election_method} + else + @other_methods = nil + end + @other_methods + end def startdate - read_attribute( :startdate ) || DateTime.now + read_attribute( :startdate ) || Time.now end - def enddate - read_attribute( :enddate ) || DateTime.now + 14 + def votes + votes = Array.new + self.voters.each do |voter| + votes << voter.vote + end + return votes end def destroy @@ -24,12 +61,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 @@ -38,6 +74,123 @@ class Election < ActiveRecord::Base def activate! self.active = 1 + self.save + end + + def quickvote? + self.class == QuickVote + end + + def active? + active == 1 + end + + def done? + active == 2 + end + + def authenticated? + authenticated + end + + def kiosk? + kiosk + end + + def shortdesc + shortdesc = description.split(/\n/)[0] + end + + def longdesc + 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 + + def candidate_hash + hash = {} + self.candidates.each {|c| hash[c.id] = c} + return hash + end + + + # TODO now that this code is in here, we should go ahead and remove + # date checking from other places in the code + def after_find + if self.active < 2 and self.enddate < Time.now + self.active = 2 + self.save + end + end + + private + def enforce_constraints + # kiosks can't be authenticated + self.authenticated = false if kiosk? + return true end end + +