2023-07-21 17:07:04 +08:00
|
|
|
|
package collx
|
2021-06-07 17:22:07 +08:00
|
|
|
|
|
2024-03-15 09:01:51 +00:00
|
|
|
|
import "strings"
|
|
|
|
|
|
|
2021-06-07 17:22:07 +08:00
|
|
|
|
// 数组比较
|
|
|
|
|
|
// 依次返回,新增值,删除值,以及不变值
|
2024-01-13 13:38:53 +08:00
|
|
|
|
func ArrayCompare[T comparable](newArr []T, oldArr []T) ([]T, []T, []T) {
|
|
|
|
|
|
newSet := make(map[T]bool)
|
|
|
|
|
|
oldSet := make(map[T]bool)
|
|
|
|
|
|
|
|
|
|
|
|
// 将新数组和旧数组的元素分别添加到对应的哈希集合中
|
|
|
|
|
|
for _, elem := range newArr {
|
|
|
|
|
|
newSet[elem] = true
|
|
|
|
|
|
}
|
|
|
|
|
|
for _, elem := range oldArr {
|
|
|
|
|
|
oldSet[elem] = true
|
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
var (
|
|
|
|
|
|
added []T
|
|
|
|
|
|
deleted []T
|
|
|
|
|
|
unmodified []T
|
|
|
|
|
|
)
|
|
|
|
|
|
|
|
|
|
|
|
// 遍历新数组,根据元素是否存在于旧数组进行分类
|
|
|
|
|
|
for _, elem := range newArr {
|
|
|
|
|
|
if oldSet[elem] {
|
|
|
|
|
|
unmodified = append(unmodified, elem)
|
|
|
|
|
|
} else {
|
|
|
|
|
|
added = append(added, elem)
|
2021-06-07 17:22:07 +08:00
|
|
|
|
}
|
2024-01-13 13:38:53 +08:00
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
// 遍历旧数组,找出被删除的元素
|
|
|
|
|
|
for _, elem := range oldArr {
|
|
|
|
|
|
if !newSet[elem] {
|
|
|
|
|
|
deleted = append(deleted, elem)
|
2021-06-07 17:22:07 +08:00
|
|
|
|
}
|
|
|
|
|
|
}
|
|
|
|
|
|
|
2024-01-13 13:38:53 +08:00
|
|
|
|
return added, deleted, unmodified
|
2021-06-07 17:22:07 +08:00
|
|
|
|
}
|
2022-10-26 20:49:29 +08:00
|
|
|
|
|
2022-12-22 18:41:34 +08:00
|
|
|
|
// 判断数组中是否含有指定元素
|
2023-07-21 17:07:04 +08:00
|
|
|
|
func ArrayContains[T comparable](arr []T, el T) bool {
|
2022-12-22 18:41:34 +08:00
|
|
|
|
for _, v := range arr {
|
|
|
|
|
|
if v == el {
|
|
|
|
|
|
return true
|
|
|
|
|
|
}
|
|
|
|
|
|
}
|
|
|
|
|
|
return false
|
|
|
|
|
|
}
|
2023-07-20 22:41:13 +08:00
|
|
|
|
|
|
|
|
|
|
// 数组转为map
|
|
|
|
|
|
// @param keyFunc key的主键
|
2023-07-21 17:07:04 +08:00
|
|
|
|
func ArrayToMap[T any, K comparable](arr []T, keyFunc func(val T) K) map[K]T {
|
2023-07-20 22:41:13 +08:00
|
|
|
|
res := make(map[K]T, len(arr))
|
|
|
|
|
|
for _, val := range arr {
|
|
|
|
|
|
key := keyFunc(val)
|
|
|
|
|
|
res[key] = val
|
|
|
|
|
|
}
|
|
|
|
|
|
return res
|
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
// 数组映射,即将一数组元素通过映射函数转换为另一数组
|
|
|
|
|
|
func ArrayMap[T any, K comparable](arr []T, mapFunc func(val T) K) []K {
|
|
|
|
|
|
res := make([]K, len(arr))
|
|
|
|
|
|
for i, val := range arr {
|
|
|
|
|
|
res[i] = mapFunc(val)
|
|
|
|
|
|
}
|
|
|
|
|
|
return res
|
|
|
|
|
|
}
|
2023-09-08 22:24:45 +08:00
|
|
|
|
|
|
|
|
|
|
// 将数组或切片按固定大小分割成小数组
|
|
|
|
|
|
func ArrayChunk[T any](arr []T, chunkSize int) [][]T {
|
|
|
|
|
|
var chunks [][]T
|
|
|
|
|
|
for i := 0; i < len(arr); i += chunkSize {
|
|
|
|
|
|
end := i + chunkSize
|
|
|
|
|
|
if end > len(arr) {
|
|
|
|
|
|
end = len(arr)
|
|
|
|
|
|
}
|
|
|
|
|
|
chunks = append(chunks, arr[i:end])
|
|
|
|
|
|
}
|
|
|
|
|
|
return chunks
|
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
// 将数组切割为指定个数的子数组,并尽可能均匀
|
|
|
|
|
|
func ArraySplit[T any](arr []T, numGroups int) [][]T {
|
|
|
|
|
|
if numGroups > len(arr) {
|
|
|
|
|
|
numGroups = len(arr)
|
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
// 计算每个子数组的大小
|
|
|
|
|
|
size := len(arr) / numGroups
|
|
|
|
|
|
remainder := len(arr) % numGroups
|
|
|
|
|
|
|
|
|
|
|
|
// 创建一个存放子数组的切片
|
|
|
|
|
|
subArrays := make([][]T, numGroups)
|
|
|
|
|
|
|
|
|
|
|
|
// 分割数组为子数组
|
|
|
|
|
|
start := 0
|
|
|
|
|
|
for i := range subArrays {
|
|
|
|
|
|
subSize := size
|
|
|
|
|
|
if i < remainder {
|
|
|
|
|
|
subSize++
|
|
|
|
|
|
}
|
|
|
|
|
|
subArrays[i] = arr[start : start+subSize]
|
|
|
|
|
|
start += subSize
|
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
return subArrays
|
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
// reduce操作
|
|
|
|
|
|
func ArrayReduce[T any, V any](arr []T, initialValue V, reducer func(V, T) V) V {
|
|
|
|
|
|
value := initialValue
|
|
|
|
|
|
for _, a := range arr {
|
|
|
|
|
|
value = reducer(value, a)
|
|
|
|
|
|
}
|
|
|
|
|
|
return value
|
|
|
|
|
|
}
|
2023-10-19 19:00:23 +08:00
|
|
|
|
|
|
|
|
|
|
// 数组元素移除操作
|
|
|
|
|
|
func ArrayRemoveFunc[T any](arr []T, isDeleteFunc func(T) bool) []T {
|
|
|
|
|
|
var newArr []T
|
|
|
|
|
|
for _, a := range arr {
|
|
|
|
|
|
if !isDeleteFunc(a) {
|
|
|
|
|
|
newArr = append(newArr, a)
|
|
|
|
|
|
}
|
|
|
|
|
|
}
|
|
|
|
|
|
return newArr
|
|
|
|
|
|
}
|
2024-02-29 22:12:50 +08:00
|
|
|
|
|
|
|
|
|
|
// 数组元素去重
|
|
|
|
|
|
func ArrayDeduplicate[T comparable](arr []T) []T {
|
|
|
|
|
|
encountered := map[T]bool{}
|
|
|
|
|
|
result := []T{}
|
|
|
|
|
|
|
|
|
|
|
|
for v := range arr {
|
|
|
|
|
|
if !encountered[arr[v]] {
|
|
|
|
|
|
encountered[arr[v]] = true
|
|
|
|
|
|
result = append(result, arr[v])
|
|
|
|
|
|
}
|
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
return result
|
|
|
|
|
|
}
|
2024-03-15 09:01:51 +00:00
|
|
|
|
|
|
|
|
|
|
// ArrayAnyMatches 给定字符串是否包含指定数组中的任意字符串, 如:["time", "date"] , substr : timestamp,返回true
|
|
|
|
|
|
func ArrayAnyMatches(arr []string, subStr string) bool {
|
|
|
|
|
|
for _, itm := range arr {
|
|
|
|
|
|
if strings.Contains(subStr, itm) {
|
|
|
|
|
|
return true
|
|
|
|
|
|
}
|
|
|
|
|
|
}
|
|
|
|
|
|
return false
|
|
|
|
|
|
}
|