require 'date'
-class GraphController < ApplicationController
-
+class GraphController < ApplicationController
class GruffGraff
def initialize(options)
def borda_bar
@election = Election.find(params[:id])
- #pref_tally = make_preference_tally(@election)
-
- #@borda_result = BordaVote.new(pref_tally).result
@election.results unless @election.borda_result
data, labels = get_borda_points(@election.borda_result)
#Acording to Tufte, small, concomparitive, highly labeled data sets usually
# belong in tables. The following is a bar graph...but would it be better
#as a table?
- def choices_positions
+ def choices_positions
+
@election = Election.find(params[:id])
pref_tally = make_preference_tally(@election)
end
private
-
def get_positions_info(election)
buckets = Hash.new
buckets2= Hash.new
rank_labels = Hash.new
-
+
election.candidates.each do |candidate|
buckets[candidate.id] = []
buckets2[candidate.id] = []
end
-
+
+ #attach the ranking to the candidate's array to which is belongs
election.votes.each do |vote|
vote.rankings.each do |ranking|
buckets[ranking.candidate_id] << ranking.rank
end
end
-
+
+ #count how many times each candidate has been ranked at a certain level
buckets.each_pair do |id, array|
(1..election.candidates.size).each do |i|
buckets2[id] << (array.find_all {|rank| rank == i}).size
end
end
+ #sort by amount of 1st place votes
+ sorted_data = buckets2.values.sort {|a,b| b[0] <=> a[0]}
+
election.votes.each do |vote|
vote.rankings.size.times do |i|
rank_labels[i] = (i+1).to_s
end
end
- return buckets2.values, rank_labels
-
+ return sorted_data, rank_labels
end
# generate the data and labels for each graph
#Populate points with an sorted array from election.votes hash
#biggest to smallest will go from left to right
- points = result.election.votes.sort do |a, b|
+ points = result.points.sort do |a, b|
b[1] <=> a[1]
end.collect {|i| i[1]}