-
-
Notifications
You must be signed in to change notification settings - Fork 0
/
struct.go
74 lines (61 loc) · 1.63 KB
/
struct.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
package dom
import (
"math/big"
"github.com/3JoB/ulib/hash/hmac"
"github.com/3JoB/ulib/litefmt"
"github.com/3JoB/unsafeConvert"
)
type LotteryData[E []T, T string | int64] struct {
LotteryID string
UserIDs E
PrizeList []string
BlockHash string
}
type WinnerPrizePair[T string | int64] struct {
Winner T
Prize string
}
func (data LotteryData[E, T]) calculateInitialSeed() string {
seedData := litefmt.PSprint(data.LotteryID, unsafeConvert.Itoa(len(data.UserIDs)),
unsafeConvert.Itoa(len(data.PrizeList)), data.BlockHash)
return hmac.Shake256S(seedData, 142)
}
func (data LotteryData[E, T]) calculateWinners(seed string) []WinnerPrizePair[T] {
seedBigInt, _ := new(big.Int).SetString(seed, 16)
num := big.NewInt(int64(len(data.UserIDs)))
var winners E
for i := 0; i < len(data.PrizeList); i++ {
var winner T
for {
index := seedBigInt.Mod(seedBigInt, num).Int64()
winner = data.UserIDs[index]
if !data.isWinner(winner, winners) {
break
}
seed = hmac.Shake128S(seed, 64)
seedBigInt.SetString(seed, 16)
}
winners = append(winners, winner)
}
var pairs []WinnerPrizePair[T]
sort(data.PrizeList)
for i, winner := range winners {
pair := WinnerPrizePair[T]{
Winner: winner,
Prize: data.PrizeList[i],
}
pairs = append(pairs, pair)
}
return pairs
}
func (data LotteryData[E, T]) isWinner(winner T, winners E) bool {
return sortSearch(winners, winner)
}
func (data LotteryData[E, T]) DrawLottery() []WinnerPrizePair[T] {
if len(data.UserIDs) < len(data.PrizeList)*2 {
return nil
}
sort(data.UserIDs)
initialSeed := data.calculateInitialSeed()
return data.calculateWinners(initialSeed)
}