mirror of
https://github.com/superseriousbusiness/gotosocial.git
synced 2025-11-03 23:52:26 -06:00
c9452f32f3* update media / emoji cleaner funcs to use new paging package, check for same returned maxID * fix other calls of getattachments and getmojis not using paging * use alternative order-by function
120 lines
2.7 KiB
Go
120 lines
2.7 KiB
Go
// GoToSocial
|
|
// Copyright (C) GoToSocial Authors admin@gotosocial.org
|
|
// SPDX-License-Identifier: AGPL-3.0-or-later
|
|
//
|
|
// This program is free software: you can redistribute it and/or modify
|
|
// it under the terms of the GNU Affero General Public License as published by
|
|
// the Free Software Foundation, either version 3 of the License, or
|
|
// (at your option) any later version.
|
|
//
|
|
// This program is distributed in the hope that it will be useful,
|
|
// but WITHOUT ANY WARRANTY; without even the implied warranty of
|
|
// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
|
// GNU Affero General Public License for more details.
|
|
//
|
|
// You should have received a copy of the GNU Affero General Public License
|
|
// along with this program. If not, see <http://www.gnu.org/licenses/>.
|
|
|
|
package util
|
|
|
|
import "slices"
|
|
|
|
// Deduplicate deduplicates entries in the given slice.
|
|
func Deduplicate[T comparable](in []T) []T {
|
|
var (
|
|
inL = len(in)
|
|
unique = make(map[T]struct{}, inL)
|
|
deduped = make([]T, 0, inL)
|
|
)
|
|
|
|
for _, v := range in {
|
|
if _, ok := unique[v]; ok {
|
|
// Already have this.
|
|
continue
|
|
}
|
|
|
|
unique[v] = struct{}{}
|
|
deduped = append(deduped, v)
|
|
}
|
|
|
|
return deduped
|
|
}
|
|
|
|
// DeduplicateFunc deduplicates entries in the given
|
|
// slice, using the result of key() to gauge uniqueness.
|
|
func DeduplicateFunc[T any, C comparable](in []T, key func(v T) C) []T {
|
|
var (
|
|
inL = len(in)
|
|
unique = make(map[C]struct{}, inL)
|
|
deduped = make([]T, 0, inL)
|
|
)
|
|
|
|
if key == nil {
|
|
panic("nil func")
|
|
}
|
|
|
|
for _, v := range in {
|
|
k := key(v)
|
|
|
|
if _, ok := unique[k]; ok {
|
|
// Already have this.
|
|
continue
|
|
}
|
|
|
|
unique[k] = struct{}{}
|
|
deduped = append(deduped, v)
|
|
}
|
|
|
|
return deduped
|
|
}
|
|
|
|
// Collate will collect the values of type K from input type []T,
|
|
// passing each item to 'get' and deduplicating the end result.
|
|
// Compared to Deduplicate() this returns []K, NOT input type []T.
|
|
func Collate[T any, K comparable](in []T, get func(T) K) []K {
|
|
if get == nil {
|
|
panic("nil func")
|
|
}
|
|
|
|
ks := make([]K, 0, len(in))
|
|
km := make(map[K]struct{}, len(in))
|
|
|
|
for i := 0; i < len(in); i++ {
|
|
// Get next k.
|
|
k := get(in[i])
|
|
|
|
if _, ok := km[k]; !ok {
|
|
// New value, add
|
|
// to map + slice.
|
|
ks = append(ks, k)
|
|
km[k] = struct{}{}
|
|
}
|
|
}
|
|
|
|
return ks
|
|
}
|
|
|
|
// OrderBy orders a slice of given type by the provided alternative slice of comparable type.
|
|
func OrderBy[T any, K comparable](in []T, keys []K, key func(T) K) {
|
|
if key == nil {
|
|
panic("nil func")
|
|
}
|
|
|
|
// Create lookup of keys->idx.
|
|
m := make(map[K]int, len(in))
|
|
for i, k := range keys {
|
|
m[k] = i
|
|
}
|
|
|
|
// Sort according to the reverse lookup.
|
|
slices.SortFunc(in, func(a, b T) int {
|
|
ai := m[key(a)]
|
|
bi := m[key(b)]
|
|
if ai < bi {
|
|
return -1
|
|
} else if bi < ai {
|
|
return +1
|
|
}
|
|
return 0
|
|
})
|
|
}
|