mirror of
https://github.com/MHSanaei/3x-ui.git
synced 2026-08-17 00:31:00 +00:00
refactor: use the built-in max/min to simplify the code (#5751)
Signed-off-by: alaningtrump <alaningtrump@outlook.com>
This commit is contained in:
@@ -55,14 +55,8 @@ func (s *ClientService) ListGroups() ([]GroupSummary, error) {
|
|||||||
}
|
}
|
||||||
out := make([]GroupSummary, 0, len(merged))
|
out := make([]GroupSummary, 0, len(merged))
|
||||||
for name, agg := range merged {
|
for name, agg := range merged {
|
||||||
up := agg.up - baseUp[name]
|
up := max(agg.up-baseUp[name], 0)
|
||||||
if up < 0 {
|
down := max(agg.down-baseDown[name], 0)
|
||||||
up = 0
|
|
||||||
}
|
|
||||||
down := agg.down - baseDown[name]
|
|
||||||
if down < 0 {
|
|
||||||
down = 0
|
|
||||||
}
|
|
||||||
out = append(out, GroupSummary{Name: name, ClientCount: agg.count, TrafficUsed: up + down, Up: up, Down: down})
|
out = append(out, GroupSummary{Name: name, ClientCount: agg.count, TrafficUsed: up + down, Up: up, Down: down})
|
||||||
}
|
}
|
||||||
sort.Slice(out, func(i, j int) bool {
|
sort.Slice(out, func(i, j int) bool {
|
||||||
|
|||||||
Reference in New Issue
Block a user