# callbacks
after_update :save_rankings
before_destroy :destroy_rankings
-
-
def to_s
votes.join("")
end
confirmed == 1
end
- def votestring=(string="")
- candidate_ids = voter.election.candidates.sort.collect \
- { |candidate| candidate.id.to_i }
-
- 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 ] }
- end
-
def votestring
# create a mapping of candidates ids and the relative order of the
# candidates as they appear when sorted alphabetically
end
# assemble the votestring
- self.votes.collect {|v| cand_relnums[v]}.join("")
+ self.votes.collect {|v| (cand_relnums[v] + 64).chr}.join("")
end
- # the following subroutine is used for quickvotes. it creates a vote
- # with the candidates listed in order of preference based on
- # alphabetical order. it is meant to be manipulated and then confirmed
- def set_defaults!
- self.votes = voter.election.candidates.sort.collect {|c| c.id }
+ # 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