summary |
shortlog |
log |
commit | commitdiff |
tree
raw |
patch |
inline | side by side (from parent 1:
2251d06)
Signed-off-by: Ian Jackson <ijackson@chiark.greenend.org.uk>
$c->{History}[$stage-1] = $c->{Total};
}
$c->{History}[$stage-1] = $c->{Total};
}
- foreach my $c (reverse sort total_history_cmp values %cands) {
+ foreach my $c (reverse sort total_history_cmp
+ grep { !$_->{NonCont} } values %cands) {
prf "candidate %-10s: %10s votes\n", $c->{Cand}, $c->{Total};
}
}
prf "candidate %-10s: %10s votes\n", $c->{Cand}, $c->{Total};
}
}
sub total_history_cmp () {
my $ha = $a->{History};
my $hb = $b->{History};
sub total_history_cmp () {
my $ha = $a->{History};
my $hb = $b->{History};
+ my $m = "stage $stage history cmp $a->{Cand} $b->{Cand}";
+ print DEBUG "$m...\n";
foreach my $s (reverse 0 .. $stage-1) {
my $d = $ha->[$s] <=> $hb->[$s];
next unless $d;
foreach my $s (reverse 0 .. $stage-1) {
my $d = $ha->[$s] <=> $hb->[$s];
next unless $d;
- print DEBUG "history cmp $a->{Cand} $b->{Cand}".
- " => $d (#$s $ha->[$s] $hb->[$s])\n";
+ print DEBUG "$m => $d (#$s $ha->[$s] $hb->[$s])\n";
+ print DEBUG "$m => 0\n";
for (;;) {
my $nextc = $maybe[$nequal];
for (;;) {
my $nextc = $maybe[$nequal];
# Only interested in those who compare equal according to the
# history (SLGEO 49(2)); NB our history includes the current
# round.
last if $signum*($a = $maybe[0], $b = $nextc, total_history_cmp) > 0;
# Only interested in those who compare equal according to the
# history (SLGEO 49(2)); NB our history includes the current
# round.
last if $signum*($a = $maybe[0], $b = $nextc, total_history_cmp) > 0;
}
if ($nequal > 1 && !$wanttiebreak->($maybe[0]{Total})) {
}
if ($nequal > 1 && !$wanttiebreak->($maybe[0]{Total})) {
-1, 'eliminating';
if ($c) {
-1, 'eliminating';
if ($c) {
- prf "=== eliminating %s (%s) ===\n", $c->{Cand}, $c->{Desc};
+ prf "=== eliminating %s \`%s' ===\n", $c->{Cand}, $c->{Desc};
$c->{NonCont} = 'Eliminated';
next;
}
$c->{NonCont} = 'Eliminated';
next;
}