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
|
package main
import (
"log"
"sort"
)
func filterRankings(spRankings, mpRankings, overallRankings *[]*Player, players *map[string]*Player) {
for k, p := range *players {
if p.SpIterations == 51 {
*spRankings = append(*spRankings, p)
}
if p.MpIterations == 48 {
*mpRankings = append(*mpRankings, p)
}
if p.SpIterations == 51 && p.MpIterations == 48 {
p.OverallScoreCount = p.SpScoreCount + p.MpScoreCount
*overallRankings = append(*overallRankings, p)
}
if p.SpIterations < 51 && p.MpIterations < 48 {
delete(*players, k)
}
}
log.Println("getting player summaries")
for _, v := range *players {
fetchPlayerInfo(v)
}
log.Println("sorting the ranks")
sort.Slice(*spRankings, func(i, j int) bool {
return (*spRankings)[i].SpScoreCount < (*spRankings)[j].SpScoreCount
})
rank := 1
for idx := 0; idx < len(*spRankings); idx++ {
if idx == 0 {
(*spRankings)[idx].SpRank = rank
continue
}
if (*spRankings)[idx-1].SpScoreCount != (*spRankings)[idx].SpScoreCount {
rank++
}
(*spRankings)[idx].SpRank = rank
}
sort.Slice(*mpRankings, func(i, j int) bool {
return (*mpRankings)[i].MpScoreCount < (*mpRankings)[j].MpScoreCount
})
rank = 1
for idx := 0; idx < len(*mpRankings); idx++ {
if idx == 0 {
(*mpRankings)[idx].MpRank = rank
continue
}
if (*mpRankings)[idx-1].MpScoreCount != (*mpRankings)[idx].MpScoreCount {
rank++
}
(*mpRankings)[idx].MpRank = rank
}
sort.Slice(*overallRankings, func(i, j int) bool {
return (*overallRankings)[i].OverallScoreCount < (*overallRankings)[j].OverallScoreCount
})
rank = 1
for idx := 0; idx < len(*overallRankings); idx++ {
if idx == 0 {
(*overallRankings)[idx].OverallRank = rank
continue
}
if (*overallRankings)[idx-1].OverallScoreCount != (*overallRankings)[idx].OverallScoreCount {
rank++
}
(*overallRankings)[idx].OverallRank = rank
}
}
|