-
Notifications
You must be signed in to change notification settings - Fork 0
/
elect.go
127 lines (95 loc) · 2.64 KB
/
elect.go
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
package meekstv
import (
"math/rand"
"sort"
"github.com/shawntoffel/meekstv/events"
)
func (m *meekStv) electEligibleCandidates() int {
eligibleCount := m.findEligibleCandidates()
m.handleMultiwayTie(eligibleCount)
m.newlyElectAllAlmostCandidates()
m.processNewlyElectedCandidates()
return eligibleCount
}
func (m *meekStv) findEligibleCandidates() int {
count := 0
candidates := m.Pool.Hopeful()
for _, candidate := range candidates {
if candidate.Votes >= m.Quota {
count = count + 1
m.Pool.SetAlmost(candidate.Id)
}
}
return count
}
func (m *meekStv) processNewlyElectedCandidates() {
snapshotCandidates := m.Pool.NewlyElected().Snapshot()
sort.Sort(BySnapshotVotes(snapshotCandidates))
for _, snapShotCandidate := range snapshotCandidates {
candidate := m.Pool.Elect(snapShotCandidate.Id)
m.AddEvent(&events.Elected{Name: candidate.Name, Rank: candidate.Rank})
}
}
func (m *meekStv) newlyElectAllAlmostCandidates() {
candidates := m.Pool.Almost()
for _, candidate := range candidates {
m.Pool.NewlyElect(candidate.Id)
m.round().AnyElected = true
}
}
func (m *meekStv) electAllHopefulCandidates() {
m.Pool.ElectHopeful()
m.AddEvent(&events.AllHopefulCandidatesElected{})
}
func (m *meekStv) handleMultiwayTie(eligibleCount int) {
count := eligibleCount
for {
tooMany := m.Pool.ElectedCount()+count > m.NumSeats
if !tooMany {
break
}
m.Pool.ExcludeHopeful()
m.AddEvent(&events.AllHopefulCandidatesExcluded{})
m.excludeLowestCandidate()
count = count - 1
}
}
func (m *meekStv) excludeLowestCandidate() {
lowestCandidates := m.Pool.Lowest()
toExclude := lowestCandidates[0]
randomUsed := false
if len(lowestCandidates) > 1 {
seed := rand.NewSource(m.Seed)
r := rand.New(seed)
i := r.Intn(len(lowestCandidates))
toExclude = lowestCandidates[i]
randomUsed = true
}
m.Pool.Exclude(toExclude.Id)
m.AddEvent(&events.LowestCandidateExcluded{Name: toExclude.Name, RandomUsed: randomUsed})
}
func (m *meekStv) excludeAllNoChanceCandidates() int {
toExclude := MeekCandidates{}
hopefuls := m.Pool.Hopeful()
sort.Sort(ByVotes(hopefuls))
surplus := m.round().Surplus
numElected := len(m.Pool.Elected())
for i := 0; i < len(hopefuls); i++ {
tryExclude := hopefuls[0 : len(hopefuls)-i]
if numElected+len(hopefuls)-len(tryExclude) < m.NumSeats {
continue
}
totalVotes := tryExclude.TotalVotes()
if i != 0 && totalVotes+surplus >= hopefuls[len(hopefuls)-i].Votes {
continue
}
toExclude = tryExclude
break
}
count := len(toExclude)
if count > 0 {
m.Pool.ExcludeMany(toExclude)
m.AddEvent(&events.NoChanceCandidatesExcluded{Names: toExclude.SortedNames()})
}
return count
}