X-Git-Url: https://projects.mako.cc/source/selectricity/blobdiff_plain/0bcced90721389c27eb815ca8dcab85533417697..5fd5cba6038d0ed97adb735cd24cc70c26335a3e:/lib/rubyvote/condorcet.rb diff --git a/lib/rubyvote/condorcet.rb b/lib/rubyvote/condorcet.rb index bf4e548..0c6fd56 100644 --- a/lib/rubyvote/condorcet.rb +++ b/lib/rubyvote/condorcet.rb @@ -33,8 +33,6 @@ class CondorcetVote < ElectionVote - attr_accessor :results - def initialize(votes=nil) unless defined?(@candidates) @candidates = Array.new @@ -46,7 +44,6 @@ class CondorcetVote < ElectionVote end end super(votes) - @results = Array.new end def tally_vote(vote=nil) @@ -86,53 +83,24 @@ class CondorcetVote < ElectionVote end end - def results - if @results.size < 2 && (not @candidates.empty?) - tabulate - end - @results - end - - def result - find_only_winner unless @winner - @winner - end - protected def verify_vote(vote=nil) vote.instance_of?( Array ) and vote == vote.uniq end - - def tabulate - find_only_winner unless @winner - until @candidates.empty? - aResult = resultFactory( self ) - @results << aResult.winners - filter_out(aResult) - end - end - - def find_only_winner - @winner = resultFactory( self ) - @results << @winner.winners - filter_out(@winner) - end - end class PureCondorcetVote < CondorcetVote - def resultFactory(init) - PureCondorcetResult.new(init) + def result + PureCondorcetResult.new(self) end end class CloneproofSSDVote < CondorcetVote - def resultFactory(init) - CloneproofSSDResult.new(init) + def result + CloneproofSSDResult.new(self) end - end @@ -153,14 +121,41 @@ class CondorcetResult < ElectionResult super(voteobj) @matrix = voteobj.votes end + + def victories_and_ties + victories_ties = {} + candidates = @matrix.keys.sort + + candidates.each do |candidate| + candidates.each do |challenger| + next if candidate == challenger + diff = @matrix[candidate][challenger] - @matrix[challenger][candidate] + victories_ties[candidate] = {} unless victories_ties.key?(candidate) + if diff >= 0 + victories_ties[candidate][challenger] = diff + end + end + end + + return victories_ties + end + + def ranked_candidates + if not defined?(@ranked_candidates) + @ranked_candidates = build_ranked_candidates() + end + @ranked_candidates + end + protected def defeats(candidates=nil, votes=nil) - candidates = @election.candidates unless candidates - votes = @election.votes unless votes + candidates ||= @election.candidates || [] + # we're assumign that if there are candidates, there must be at + # least one vote for them + votes ||= @election.votes defeats = Array.new - candidates = [candidates] unless candidates.class == Array candidates.each do |candidate| candidates.each do |challenger| next if candidate == challenger @@ -172,6 +167,27 @@ class CondorcetResult < ElectionResult defeats end + + def build_ranked_candidates + # build a lis of ranked candidates by dropping the winner and + # cursing + + ranked_candidates = [] + + resultobj = self.dup + candidates = self.election.candidates + + until candidates.empty? + ranked_candidates << resultobj.winners + + new_voteobj = resultobj.election.dup + candidates = new_voteobj.candidates + new_voteobj.candidates.delete_if {|x| resultobj.winners.include?(x)} + resultobj = new_voteobj.result + end + + ranked_candidates + end end @@ -182,14 +198,15 @@ class PureCondorcetResult < CondorcetResult end protected - + def condorcet votes = @election.votes candidates = @election.candidates - unless votes.length>0 and candidates.length>0 - @winners=[] - return @winners + + unless votes.length > 0 and candidates.length > 0 + return @winners=[] end + victors = Hash.new candidates.each do |candidate| victors[candidate] = Array.new @@ -219,14 +236,13 @@ class CloneproofSSDResult < CondorcetResult def initialize(voteobj=nil) super(voteobj) @winners = self.cpssd() - @winners.delete nil end protected def cpssd votes = @election.votes - candidates = *@election.candidates + candidates = @election.candidates.dup def in_schwartz_set?(candidate, candidates, transitive_defeats) candidates.each do |challenger|