-
Notifications
You must be signed in to change notification settings - Fork 95
/
vote_algo.go
160 lines (134 loc) · 3.64 KB
/
vote_algo.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
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
package core
import (
"math/big"
"math/rand"
"sort"
"github.com/vitelabs/go-vite/ledger"
)
type Algo interface {
ShuffleVotes(votes []*Vote, hashH *ledger.HashHeight) []*Vote
FilterVotes(votes []*Vote, hashH *ledger.HashHeight) []*Vote
FilterSimple(votes []*Vote) []*Vote
}
type algo struct {
info *GroupInfo
}
func NewAlgo(info *GroupInfo) *algo {
return &algo{info: info}
}
// balance + snapshotHeight + gid
func (self *algo) findSeed(votes []*Vote, sheight uint64) int64 {
result := big.NewInt(0)
for _, v := range votes {
result.Add(result, v.Balance)
}
result.Add(result, new(big.Int).SetUint64(sheight))
return result.Add(result, self.info.seed).Int64()
}
func (self *algo) ShuffleVotes(votes []*Vote, hashH *ledger.HashHeight) (result []*Vote) {
seed := self.findSeed(votes, hashH.Height)
l := len(votes)
random := rand.New(rand.NewSource(seed))
perm := random.Perm(l)
for _, v := range perm {
result = append(result, votes[v])
}
return result
}
func (self *algo) FilterVotes(votes []*Vote, hashH *ledger.HashHeight) []*Vote {
// simple filter for low balance
simpleVotes := self.FilterSimple(votes)
if int64(len(simpleVotes)) < int64(self.info.NodeCount) {
simpleVotes = votes
}
votes = self.filterRandV2(simpleVotes, hashH)
return votes
}
func (self *algo) FilterSimple(votes []*Vote) (result []*Vote) {
if int32(len(votes)) < int32(self.info.RandRank) {
return votes
}
sort.Sort(ByBalance(votes))
result = votes[0:self.info.RandRank]
return result
}
func (self *algo) calRandCnt(total int, randNum int) int {
// the random number can't be greater than 1/3
// todo need detail info
if total/3 > randNum {
return randNum
} else {
return (total) / 3
}
}
func (self *algo) filterRand(votes []*Vote, hashH *ledger.HashHeight) []*Vote {
total := self.info.NodeCount
sort.Sort(ByBalance(votes))
length := len(votes)
if length < int(total) {
return votes
}
seed := self.findSeed(votes, hashH.Height)
randCnt := self.calRandCnt(int(total), int(self.info.RandCount))
topTotal := int(total) - randCnt
leftTotal := length - topTotal
randMembers := make([]bool, leftTotal)
random := rand.New(rand.NewSource(seed))
// cal rand index
for i := 0; i < randCnt; {
r := random.Intn(leftTotal)
flag := randMembers[r]
if flag {
continue
} else {
randMembers[r] = true
i++
}
}
// generate result for top and rand
// todo unit test
result := votes[0:topTotal]
for k, b := range randMembers {
if b {
result = append(result, votes[k+topTotal])
}
}
return result
}
func (self *algo) filterRandV2(votes []*Vote, hashH *ledger.HashHeight) []*Vote {
var result []*Vote
total := int(self.info.NodeCount)
sort.Sort(ByBalance(votes))
seed := self.findSeed(votes, hashH.Height)
length := len(votes)
if length <= int(total) {
random1 := rand.New(rand.NewSource(seed))
arr := random1.Perm(int(length))
for _, v := range arr {
result = append(result, votes[v])
}
return result
}
randCnt := self.calRandCnt(total, int(self.info.RandCount))
topTotal := total - randCnt
//if (total-randCnt)/total) > randCnt/(length-total) {
if (topTotal)*(length-total) > randCnt*total {
random1 := rand.New(rand.NewSource(seed))
random2 := rand.New(rand.NewSource(seed + 1))
firstArr := random1.Perm(int(total))[0:topTotal]
secondArr := random2.Perm(length - total)[0:randCnt]
for _, v := range firstArr {
result = append(result, votes[v])
}
for _, v := range secondArr {
result = append(result, votes[v+total])
}
} else {
random1 := rand.New(rand.NewSource(seed))
arr := random1.Perm(int(length))[0:total]
for _, v := range arr {
result = append(result, votes[v])
}
}
return result
}