+# Selectricity: Voting Machinery for the Masses
+# Copyright (C) 2007, 2008 Benjamin Mako Hill <mako@atdot.cc>
+# Copyright (C) 2007 Massachusetts Institute of Technology
+#
+# This program is free software: you can redistribute it and/or modify
+# it under the terms of the GNU Affero General Public License as
+# published by the Free Software Foundation, either version 3 of the
+# License, or (at your option) any later version.
+#
+# This program is distributed in the hope that it will be useful, but
+# WITHOUT ANY WARRANTY; without even the implied warranty of
+# MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
+# Affero General Public License for more details.
+#
+# You should have received a copy of the GNU Affero General Public
+# License along with this program. If not, see
+# <http://www.gnu.org/licenses/>.
+
class Election < ActiveRecord::Base
has_many :candidates
has_many :voters
def other_methods
if election_method
- @other_methods = ELECTION_TYPES.reject {|i| i == election_method}
+ @other_methods = ELECTION_TYPES.keys.reject {|i| i == election_method}
else
@other_methods = nil
end
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
end
def quickvote?
- self.class == 'QuickVote'
+ self.class == QuickVote
end
def active?
active == 2
end
+ def authenticated?
+ authenticated
+ end
+
def shortdesc
shortdesc = description.split(/\n/)[0]
end
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
# 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
names
end
-
end