X-Git-Url: https://projects.mako.cc/source/selectricity/blobdiff_plain/e7df11018ea1e15f8671f948126632be3ac86e84..5c62b1606f7f89efdd5a6c51308cd0212fe9a709:/app/models/election.rb?ds=inline diff --git a/app/models/election.rb b/app/models/election.rb index 7fa138e..b48c923 100644 --- a/app/models/election.rb +++ b/app/models/election.rb @@ -1,12 +1,22 @@ +# 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 - + + # 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 @@ -14,7 +24,7 @@ class Election < ActiveRecord::Base attr_reader :borda_result require 'date' - + def initialize(params={}) super self.enddate = read_attribute( :enddate ) || \ @@ -55,7 +65,7 @@ class Election < ActiveRecord::Base 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 @@ -64,11 +74,11 @@ class Election < ActiveRecord::Base def activate! self.active = 1 - self.save! + self.save end def quickvote? - self.class == 'QuickVote' + self.class == QuickVote end def active? @@ -79,6 +89,14 @@ class Election < ActiveRecord::Base active == 2 end + def authenticated? + authenticated + end + + def kiosk? + kiosk + end + def shortdesc shortdesc = description.split(/\n/)[0] end @@ -88,8 +106,28 @@ class Election < ActiveRecord::Base longdesc.length > 0 ? longdesc : nil end - #Calculate Election Results + #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 @@ -99,11 +137,11 @@ class Election < ActiveRecord::Base # 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 + plurality_tally << voter.vote.rankings.sort[0].candidate_id approval_tally << voter.vote.rankings.sort[0..1].collect \ - { |ranking| ranking.candidate.id } + { |ranking| ranking.candidate_id } preference_tally << voter.vote.rankings.sort.collect \ - { |ranking| ranking.candidate.id } + { |ranking| ranking.candidate_id } end @plurality_result = PluralityVote.new(plurality_tally).result @@ -129,7 +167,30 @@ class Election < ActiveRecord::Base 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