This repository has been archived by the owner on Apr 14, 2023. It is now read-only.
-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathmain.go
100 lines (91 loc) · 2.09 KB
/
main.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
package main
import (
"fmt"
"github.com/aprosvetova/go-cmtt"
"log"
"sort"
"time"
)
func main() {
client, err := cmtt.NewWithQr("<YOUR_TOKEN_FROM_QR>", "tjournal")
if err != nil {
log.Fatal(err)
}
commentIDs := getCommentIDs(client)
names, likes, dislikes := getAllLikers(client, commentIDs)
fmt.Println("Likes:")
for _, p := range likes {
fmt.Println(names[p.key], p.value)
}
fmt.Println("\nDislikes:")
for _, p := range dislikes {
fmt.Println(names[p.key], p.value)
}
}
func getCommentIDs(client *cmtt.Cmtt) []int {
var commentIDs []int
offset := 0
for {
res, err := client.GetMineComments(50, offset)
offset += 50
if err != nil {
log.Fatal(err)
}
for _, comment := range *res {
commentIDs = append(commentIDs, comment.Id)
}
if len(*res) < 50 {
break
}
}
return commentIDs
}
func getAllLikers(client *cmtt.Cmtt, commentIDs []int) (map[int]string, pairList, pairList) {
names := make(map[int]string)
likes := make(map[int]int)
dislikes := make(map[int]int)
for _, comment := range commentIDs {
likers, err := getLikers(client, comment)
if err != nil {
log.Fatal(err)
}
time.Sleep(time.Millisecond * 1000)
for liker, info := range *likers {
names[liker] = info.Name
if info.Sign == 1 {
likes[liker]++
} else {
dislikes[liker]++
}
}
}
return names, orderMapDescending(likes), orderMapDescending(dislikes)
}
func getLikers(client *cmtt.Cmtt, commentID int) (*map[int]cmtt.Liker, error) {
likers, err := client.GetCommentLikers(commentID)
if err != nil {
if err.Error() == "timeout" {
time.Sleep(5 * time.Second)
return getLikers(client, commentID)
} else {
return nil, err
}
}
return likers, nil
}
func orderMapDescending(m map[int]int) pairList {
p := *new(pairList)
for k, v := range m {
p = append(p, pair{k, v})
}
sort.Sort(sort.Reverse(p))
return p
}
type pair struct {
key int
value int
}
type pairList []pair
func (p pairList) Swap(i, j int) { p[i], p[j] = p[j], p[i] }
func (p pairList) Len() int { return len(p) }
func (p pairList) Less(i, j int) bool { return p[i].value < p[j].value }