X-Git-Url: https://projects.mako.cc/source/selectricity-live/blobdiff_plain/3afd5bc9df007473fdc53af22516b236c7f2d11c..ffec26b00fc14b92f82137e1e3c62ce78c93ea24:/app/controllers/graph_controller.rb?ds=sidebyside diff --git a/app/controllers/graph_controller.rb b/app/controllers/graph_controller.rb index 8a11a42..814eb36 100644 --- a/app/controllers/graph_controller.rb +++ b/app/controllers/graph_controller.rb @@ -1,23 +1,38 @@ require 'date' -class GraphController < ApplicationController - +class GraphController < ApplicationController class GruffGraff def initialize(options) - size = "700x400" + size = options[:size] ? options[:size] : "400x300" #allow custom sizing @graph = options[:graph_type].new(size) - - @graph.theme = { :background_colors => ['#73BF26', '#ffffff'] } + + @graph.no_data_message = "No Voters" + + @graph.theme = { :colors => ['#005CD9', '#DC0D13', '#131313', '#990033'], + :background_colors => ['#74CE00', '#FFFFFF'] } @graph.font = File.expand_path('/usr/X11R6/lib/X11/fonts/TTF/Vera.ttf', RAILS_ROOT) # fill in the data with the optional data name - @graph.data( options.fetch(:data_name, nil), options[:data] ) - + #Check to see if multiple datasets, if so, fill them all! + #Sort by biggest first piece of data. + if options[:data].is_a?(Hash) + options[:data].sort {|a,b| b[1][0] <=> a[1][0]}.each do |dataset| + @graph.data(dataset[0], dataset[1]) + end + #if each dataset nameless, will have only multiple arrays + elsif options[:data].size > 1 && options[:data].all? {|i| i.is_a?(Array)} + options[:data].each do |array| + @graph.data( options.fetch(:data_name, "Data"), array) + end + else #one dimensional array, just pass it in + @graph.data( options.fetch(:data_name, "Data"), options[:data] ) + end + # set the labels or create an empty hash @graph.labels = options[:interval_labels] \ if options.has_key?(:interval_labels) and \ - options[:interval_labels].class = Hash + options[:interval_labels].class == Hash @graph.x_axis_label = options[:x_axis_label] \ if options.has_key?(:x_axis_label) @graph.y_axis_label = options[:y_axis_label] \ @@ -59,21 +74,16 @@ class GraphController < ApplicationController :data => data, :interval_labels => labels, :title => "Voters Over Time", + :size => "700x400", :x_axis_label => scale, :y_axis_label => "Number of Votes") send_data(*graph.output) end - - def quickvote_bar - @election = Election.find(params[:id]) - end def borda_bar @election = Election.find(params[:id]) - pref_tally = make_preference_tally(@election) - - @borda_result = BordaVote.new(pref_tally).result - data, labels = get_borda_points(@borda_result) + @election.results unless @election.borda_result + data, labels = get_borda_points(@election.borda_result) graph = GruffGraff.new( :graph_type => Gruff::Bar, :data_name => @election.name, @@ -84,8 +94,90 @@ class GraphController < ApplicationController :x_axis_label => "Candidate") send_data(*graph.output) end - + #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 + @election = Election.find(params[:id]) + legend = Hash.new + alldata, labels = get_positions_info(@election) + @election.results unless @election.condorcet_result || @election.ssd_result + ranked_candidates = @election.condorcet_result.ranked_candidates.flatten + + names = Hash.new + candidates = @election.candidates.sort.collect {|candidate| candidate.id} + candidates.each do |candidate| + names[candidate]= (Candidate.find(candidate)).name + end + + ranked_candidates.each_with_index \ + {|candidate, index| legend[names[candidate]] = alldata[index]} + + graph = GruffGraff.new( :graph_type => Gruff::Bar, + :data => legend, + :interval_labels => labels, + :title => "Times Voted in Each Position", + :y_axis_label => "Number of Times Ranked", + :x_axis_label => "Rank") + send_data(*graph.output) + end + + def plurality_pie + @election = Election.find(params[:id]) + @election.results unless @election.plurality_result || @election.approval_result + votes = @election.votes.size + data = Hash.new + names = @election.names_by_id + + @election.plurality_result.points.each do |candidate, votes| + data[names[candidate]] = votes + end + + pie = GruffGraff.new ( :graph_type => Gruff::Pie, + :title => "Percentage of First Place Votes", + :data => data) + send_data(*pie.output) + + end + private + def get_positions_info(election) + buckets = Hash.new + buckets2= Hash.new + rank_labels = Hash.new + + #attach the ranking to the candidate's array to which is belongs + #creating a key if necessary + election.votes.each do |vote| + vote.rankings.each do |ranking| + + unless buckets.has_key?(ranking.candidate_id) + buckets[ranking.candidate_id] = [] + end + 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] = [] unless buckets2.has_key?(id) + 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 sorted_data, rank_labels + end # generate the data and labels for each graph def get_votes_per_day_data(election) @@ -106,7 +198,8 @@ class GraphController < ApplicationController # Now I need to create an array with all the times votes were made election.votes.each do |vote| - voter_days << Date.parse(vote.time.to_s) + next unless vote.time + voter_days << Date.parse(vote.time.to_s) end voter_days.sort! @@ -144,14 +237,15 @@ class GraphController < ApplicationController # Make a hash, buckets, indexed by time intervals and containing empty arrays # The time object must come first in addition! - # i would start at 0, i+1 goes from 0 up till numcols + # i would start at 0, i+1 goes from 1 up till numcols numcols.times {|i| buckets[starttime + ((i+1)*interval_length)] = []} # Put votes into bucket according to the time interval to which they belong, # referenced by their key - # Will build a graph over time, as each successive interval wil lhave more + # Will build a graph over time, as each successive interval will have more # vote objects election.votes.each do |vote| + next unless vote.time buckets.keys.sort.each do |inter| if vote.time < inter buckets[inter] << vote @@ -175,7 +269,7 @@ class GraphController < ApplicationController interval_type = "Hour of the Day on 24 hour scale" else #more than 2 days means use dates for labels labels_hash[0] = (Date.parse(starttime.to_s)).to_s - labels_hash[(numcols/2)-1] = (Date.parse(starttime + (timedelta/2))).to_s + labels_hash[(numcols/2)-1] = (Date.parse((starttime + (timedelta/2)).to_s)).to_s labels_hash[numcols-1] = (Date.today).to_s interval_type = "The Date" end @@ -185,14 +279,12 @@ class GraphController < ApplicationController end def get_borda_points(result) - #points holds how mnay points each candidate has received in array form - #becasue Gruff::Bar#data takes only an array points = Array.new labels = Hash.new #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]}