205 lines
4.4 KiB
Go
205 lines
4.4 KiB
Go
package users
|
|
|
|
import (
|
|
"sort"
|
|
|
|
"github.com/aerogo/aero"
|
|
"github.com/animenotifier/arn"
|
|
"github.com/animenotifier/notify.moe/components"
|
|
"github.com/animenotifier/notify.moe/utils"
|
|
)
|
|
|
|
// Active ...
|
|
func Active(ctx *aero.Context) string {
|
|
users := arn.FilterUsers(func(user *arn.User) bool {
|
|
return user.HasAvatar() && user.HasNick() && user.IsActive()
|
|
})
|
|
|
|
followCount := arn.UserFollowerCountMap()
|
|
|
|
sort.Slice(users, func(i, j int) bool {
|
|
if users[i].HasAvatar() != users[j].HasAvatar() {
|
|
return users[i].HasAvatar()
|
|
}
|
|
|
|
followersA := followCount[users[i].ID]
|
|
followersB := followCount[users[j].ID]
|
|
|
|
if followersA == followersB {
|
|
return users[i].Nick < users[j].Nick
|
|
}
|
|
|
|
return followersA > followersB
|
|
})
|
|
|
|
return ctx.HTML(components.Users(users, ctx.URI()))
|
|
}
|
|
|
|
// Pro ...
|
|
func Pro(ctx *aero.Context) string {
|
|
users := arn.FilterUsers(func(user *arn.User) bool {
|
|
return user.IsPro()
|
|
})
|
|
|
|
sort.Slice(users, func(i, j int) bool {
|
|
return users[i].Registered > users[j].Registered
|
|
})
|
|
|
|
return ctx.HTML(components.ProUsers(users, ctx.URI()))
|
|
}
|
|
|
|
// Editors ...
|
|
func Editors(ctx *aero.Context) string {
|
|
score := map[string]int{}
|
|
users := []*arn.User{}
|
|
|
|
for entry := range arn.StreamEditLogEntries() {
|
|
entryScore := entry.EditorScore()
|
|
|
|
if entryScore == 0 {
|
|
continue
|
|
}
|
|
|
|
current, exists := score[entry.UserID]
|
|
|
|
if !exists {
|
|
users = append(users, entry.User())
|
|
}
|
|
|
|
score[entry.UserID] = current + entryScore
|
|
}
|
|
|
|
for ignore := range arn.StreamIgnoreAnimeDifferences() {
|
|
score[ignore.CreatedBy] += arn.IgnoreAnimeDifferenceEditorScore
|
|
}
|
|
|
|
sort.Slice(users, func(i, j int) bool {
|
|
scoreA := score[users[i].ID]
|
|
scoreB := score[users[j].ID]
|
|
|
|
if scoreA == scoreB {
|
|
return users[i].Registered > users[j].Registered
|
|
}
|
|
|
|
return scoreA > scoreB
|
|
})
|
|
|
|
return ctx.HTML(components.EditorRankingList(users, score, ctx.URI()))
|
|
}
|
|
|
|
// ActiveNoAvatar ...
|
|
func ActiveNoAvatar(ctx *aero.Context) string {
|
|
users := arn.FilterUsers(func(user *arn.User) bool {
|
|
return user.IsActive() && !user.HasAvatar()
|
|
})
|
|
|
|
followCount := arn.UserFollowerCountMap()
|
|
|
|
sort.Slice(users, func(i, j int) bool {
|
|
if users[i].HasAvatar() != users[j].HasAvatar() {
|
|
return users[i].HasAvatar()
|
|
}
|
|
|
|
followersA := followCount[users[i].ID]
|
|
followersB := followCount[users[j].ID]
|
|
|
|
if followersA == followersB {
|
|
return users[i].Nick < users[j].Nick
|
|
}
|
|
|
|
return followersA > followersB
|
|
})
|
|
|
|
return ctx.HTML(components.Users(users, ctx.URI()))
|
|
}
|
|
|
|
// Osu ...
|
|
func Osu(ctx *aero.Context) string {
|
|
users := arn.FilterUsers(func(user *arn.User) bool {
|
|
return user.HasAvatar() && user.HasNick() && user.IsActive() && user.Accounts.Osu.PP > 0
|
|
})
|
|
|
|
// Sort by pp
|
|
sort.Slice(users, func(i, j int) bool {
|
|
return users[i].Accounts.Osu.PP > users[j].Accounts.Osu.PP
|
|
})
|
|
|
|
if len(users) > 50 {
|
|
users = users[:50]
|
|
}
|
|
|
|
return ctx.HTML(components.OsuRankingList(users, ctx.URI()))
|
|
}
|
|
|
|
// Overwatch ...
|
|
func Overwatch(ctx *aero.Context) string {
|
|
users := arn.FilterUsers(func(user *arn.User) bool {
|
|
return user.HasAvatar() && user.HasNick() && user.IsActive() && user.Accounts.Overwatch.SkillRating > 0
|
|
})
|
|
|
|
// Sort by Skill Ratings
|
|
sort.Slice(users, func(i, j int) bool {
|
|
return users[i].Accounts.Overwatch.SkillRating > users[j].Accounts.Overwatch.SkillRating
|
|
})
|
|
|
|
if len(users) > 50 {
|
|
users = users[:50]
|
|
}
|
|
|
|
return ctx.HTML(components.OverwatchRankingList(users, ctx.URI()))
|
|
}
|
|
|
|
// Staff ...
|
|
func Staff(ctx *aero.Context) string {
|
|
users := arn.FilterUsers(func(user *arn.User) bool {
|
|
return user.HasAvatar() && user.HasNick() && user.IsActive() && user.Role != ""
|
|
})
|
|
|
|
// Make order deterministic
|
|
sort.Slice(users, func(i, j int) bool {
|
|
return users[i].Nick < users[j].Nick
|
|
})
|
|
|
|
admins := &utils.UserList{
|
|
Name: "Developer",
|
|
Users: []*arn.User{},
|
|
}
|
|
|
|
contributors := &utils.UserList{
|
|
Name: "Contributors",
|
|
Users: []*arn.User{},
|
|
}
|
|
|
|
// contributors.Users = append(contributors.Users, )
|
|
|
|
editors := &utils.UserList{
|
|
Name: "Editors",
|
|
Users: []*arn.User{},
|
|
}
|
|
|
|
for _, user := range users {
|
|
if user.Role == "admin" {
|
|
admins.Users = append(admins.Users, user)
|
|
continue
|
|
}
|
|
|
|
if user.ID == "VJOK1ckvx" || user.ID == "SUQOAFFkR" {
|
|
contributors.Users = append(contributors.Users, user)
|
|
continue
|
|
}
|
|
|
|
if user.Role == "editor" {
|
|
editors.Users = append(editors.Users, user)
|
|
continue
|
|
}
|
|
}
|
|
|
|
userLists := []*utils.UserList{
|
|
admins,
|
|
contributors,
|
|
editors,
|
|
}
|
|
|
|
return ctx.HTML(components.UserLists(userLists, ctx.URI()) + components.StaffRecruitment())
|
|
}
|