fix: 完成商务迁移复核与接口优化并清理历史资料
This commit is contained in:
@@ -1,6 +1,7 @@
|
||||
package business
|
||||
|
||||
import (
|
||||
"container/heap"
|
||||
"context"
|
||||
"math/big"
|
||||
"sort"
|
||||
@@ -57,6 +58,7 @@ type WorkbenchRankData struct {
|
||||
type WorkbenchRepo interface {
|
||||
Summary(context.Context, AnalyticsScope, []string, WorkbenchWindow) (*WorkbenchTotals, error)
|
||||
Ranks(context.Context, AnalyticsScope, AnalyticsFilter, WorkbenchRankKind) (*WorkbenchRankData, error)
|
||||
FillRankNames(context.Context, []*WorkbenchRankRow) error
|
||||
}
|
||||
type WorkbenchUsecase struct {
|
||||
repo WorkbenchRepo
|
||||
@@ -185,9 +187,8 @@ func (uc *WorkbenchUsecase) Ranks(ctx context.Context, sources []string, period
|
||||
if !data.Available {
|
||||
return nil, ErrWorkbenchUnavailable
|
||||
}
|
||||
rows := make([]*WorkbenchRankRow, 0, len(data.Rows))
|
||||
values := map[*WorkbenchRankRow]*big.Rat{}
|
||||
for _, row := range data.Rows {
|
||||
top := &workbenchRankHeap{ascending: kind == WorkbenchPayLow}
|
||||
for index, row := range data.Rows {
|
||||
if kind == WorkbenchUnlogin {
|
||||
row.Value = big.NewInt(workbenchUnloginDays(row, w.Today)).String()
|
||||
}
|
||||
@@ -201,32 +202,68 @@ func (uc *WorkbenchUsecase) Ranks(ctx context.Context, sources []string, period
|
||||
if (kind == WorkbenchRegister || kind == WorkbenchPayHigh) && n.Sign() <= 0 {
|
||||
continue
|
||||
}
|
||||
values[row] = n
|
||||
rows = append(rows, row)
|
||||
candidate := workbenchRankCandidate{row: row, value: n, index: index}
|
||||
if top.Len() < 10 {
|
||||
heap.Push(top, candidate)
|
||||
} else if top.better(candidate, top.rows[0]) {
|
||||
top.rows[0] = candidate
|
||||
heap.Fix(top, 0)
|
||||
}
|
||||
}
|
||||
sort.Slice(top.rows, func(i, j int) bool { return top.better(top.rows[i], top.rows[j]) })
|
||||
rows := make([]*WorkbenchRankRow, len(top.rows))
|
||||
for i, candidate := range top.rows {
|
||||
rows[i] = candidate.row
|
||||
}
|
||||
if err := uc.repo.FillRankNames(ctx, rows); err != nil {
|
||||
return nil, err
|
||||
}
|
||||
sort.SliceStable(rows, func(i, j int) bool {
|
||||
a, b := rows[i], rows[j]
|
||||
if c := values[a].Cmp(values[b]); c != 0 {
|
||||
if kind == WorkbenchPayLow {
|
||||
return c < 0
|
||||
}
|
||||
return c > 0
|
||||
}
|
||||
if a.ID != b.ID {
|
||||
return a.ID < b.ID
|
||||
}
|
||||
return a.SourceDB < b.SourceDB
|
||||
})
|
||||
rows = rows[:min(10, len(rows))]
|
||||
for i, row := range rows {
|
||||
row.Rank = i + 1
|
||||
row.Name = (&LedgerNames{PromoteID: &row.ID, PromoteAccount: row.Name}).DisplayPromote()
|
||||
if kind != WorkbenchUnlogin {
|
||||
row.Value = portraitDecimal(values[row], 2)
|
||||
row.Value = portraitDecimal(top.rows[i].value, 2)
|
||||
}
|
||||
}
|
||||
return rows, nil
|
||||
}
|
||||
|
||||
type workbenchRankCandidate struct {
|
||||
row *WorkbenchRankRow
|
||||
value *big.Rat
|
||||
index int
|
||||
}
|
||||
|
||||
// 堆顶保留最差的入选行,只维护 TOP10;比较规则与完整稳定排序一致。
|
||||
type workbenchRankHeap struct {
|
||||
rows []workbenchRankCandidate
|
||||
ascending bool
|
||||
}
|
||||
|
||||
func (h workbenchRankHeap) better(a, b workbenchRankCandidate) bool {
|
||||
if c := a.value.Cmp(b.value); c != 0 {
|
||||
if h.ascending {
|
||||
return c < 0
|
||||
}
|
||||
return c > 0
|
||||
}
|
||||
if a.row.ID != b.row.ID {
|
||||
return a.row.ID < b.row.ID
|
||||
}
|
||||
if a.row.SourceDB != b.row.SourceDB {
|
||||
return a.row.SourceDB < b.row.SourceDB
|
||||
}
|
||||
return a.index < b.index
|
||||
}
|
||||
func (h workbenchRankHeap) Len() int { return len(h.rows) }
|
||||
func (h workbenchRankHeap) Less(i, j int) bool { return h.better(h.rows[j], h.rows[i]) }
|
||||
func (h workbenchRankHeap) Swap(i, j int) { h.rows[i], h.rows[j] = h.rows[j], h.rows[i] }
|
||||
func (h *workbenchRankHeap) Push(v any) { h.rows = append(h.rows, v.(workbenchRankCandidate)) }
|
||||
func (h *workbenchRankHeap) Pop() any {
|
||||
last := h.rows[len(h.rows)-1]
|
||||
h.rows = h.rows[:len(h.rows)-1]
|
||||
return last
|
||||
}
|
||||
func workbenchUnloginDays(row *WorkbenchRankRow, today time.Time) int64 {
|
||||
stamp := row.LastLoginUnix
|
||||
if stamp == nil || *stamp <= 0 {
|
||||
|
||||
Reference in New Issue
Block a user