mirror of
https://github.com/Rain-kl/OpenFlare.git
synced 2026-09-28 05:46:36 +08:00
aa4faddade
Result: {"status":"keep","total_issues":8,"golint_canonicalheader":0,"golint_errname":0,"golint_errorlint":1,"golint_exhaustive":0,"golint_forcetypeassert":0,"golint_gosec":0,"golint_intrange":0,"golint_modernize":3,"golint_nilnil":3,"golint_perfsprint":0,"golint_prealloc":0,"golint_recvcheck":1,"golint_usestdlibvars":0,"golint_wastedassign":0,"golint_total":8,"golint_test_testifylint":0,"golint_test_thelper":0,"golint_test_usetesting":0,"golint_test_total":0,"golint_vetx_total":0,"eslint_problems":0,"eslint_errors":0,"eslint_warnings":0,"tsc_errors":0,"vitest_failed":0,"vitest_total":116,"measure_s":81}
80 lines
1.9 KiB
Go
80 lines
1.9 KiB
Go
// Copyright 2026 Arctel.net
|
|
// SPDX-License-Identifier: Apache-2.0
|
|
|
|
package util
|
|
|
|
import (
|
|
"sort"
|
|
"strings"
|
|
"time"
|
|
)
|
|
|
|
// Unique returns a new slice containing only the unique elements of the input slice,
|
|
// preserving their original order.
|
|
func Unique[T comparable](slice []T) []T {
|
|
if slice == nil {
|
|
return nil
|
|
}
|
|
seen := make(map[T]struct{})
|
|
result := make([]T, 0)
|
|
for _, item := range slice {
|
|
if _, ok := seen[item]; ok {
|
|
continue
|
|
}
|
|
seen[item] = struct{}{}
|
|
result = append(result, item)
|
|
}
|
|
return result
|
|
}
|
|
|
|
// UniqueAndCleanStringSlice trims spaces, removes empty elements, and returns only the unique elements
|
|
// of the input string slice. It preserves order and returns nil if the resulting slice is empty.
|
|
func UniqueAndCleanStringSlice(slice []string) []string {
|
|
if slice == nil {
|
|
return nil
|
|
}
|
|
seen := make(map[string]struct{})
|
|
result := make([]string, 0)
|
|
for _, item := range slice {
|
|
trimmed := strings.TrimSpace(item)
|
|
if trimmed == "" {
|
|
continue
|
|
}
|
|
if _, ok := seen[trimmed]; ok {
|
|
continue
|
|
}
|
|
seen[trimmed] = struct{}{}
|
|
result = append(result, trimmed)
|
|
}
|
|
if len(result) == 0 {
|
|
return nil
|
|
}
|
|
return result
|
|
}
|
|
|
|
// IdentifiableTimeRecord represents a database record that has a unique ID and a primary timestamp field.
|
|
type IdentifiableTimeRecord interface {
|
|
GetID() uint
|
|
GetTime() time.Time
|
|
}
|
|
|
|
// SortAndLimitRecords sorts a slice of IdentifiableTimeRecord descendingly by their timestamp (and ID as a tie-breaker),
|
|
// and limits the slice to the specified size if limit > 0.
|
|
func SortAndLimitRecords[T IdentifiableTimeRecord](rows []T, limit int) []T {
|
|
if len(rows) == 0 {
|
|
return rows
|
|
}
|
|
sort.Slice(rows, func(i, j int) bool {
|
|
ti := rows[i].GetTime()
|
|
tj := rows[j].GetTime()
|
|
if ti.Equal(tj) {
|
|
return rows[i].GetID() > rows[j].GetID()
|
|
}
|
|
return ti.After(tj)
|
|
})
|
|
if limit > 0 && len(rows) > limit {
|
|
rows = rows[:limit]
|
|
}
|
|
return rows
|
|
}
|