mirror of
				https://gitee.com/dromara/mayfly-go
				synced 2025-11-04 08:20:25 +08:00 
			
		
		
		
	
		
			
				
	
	
		
			117 lines
		
	
	
		
			2.4 KiB
		
	
	
	
		
			Go
		
	
	
	
	
	
			
		
		
	
	
			117 lines
		
	
	
		
			2.4 KiB
		
	
	
	
		
			Go
		
	
	
	
	
	
package collx
 | 
						|
 | 
						|
// 数组比较
 | 
						|
// 依次返回,新增值,删除值,以及不变值
 | 
						|
func ArrayCompare[T any](newArr []T, oldArr []T, compareFun func(T, T) bool) ([]T, []T, []T) {
 | 
						|
	var unmodifierValue []T
 | 
						|
	ni, oi := 0, 0
 | 
						|
	for {
 | 
						|
		if ni >= len(newArr) {
 | 
						|
			break
 | 
						|
		}
 | 
						|
		nv := newArr[ni]
 | 
						|
		for {
 | 
						|
			if oi >= len(oldArr) {
 | 
						|
				oi = 0
 | 
						|
				break
 | 
						|
			}
 | 
						|
			ov := oldArr[oi]
 | 
						|
			if compareFun(nv, ov) {
 | 
						|
				unmodifierValue = append(unmodifierValue, nv)
 | 
						|
				// 新数组移除该位置值
 | 
						|
				if len(newArr) > ni {
 | 
						|
					newArr = append(newArr[:ni], newArr[ni+1:]...)
 | 
						|
					ni = ni - 1
 | 
						|
				}
 | 
						|
				if len(oldArr) > oi {
 | 
						|
					oldArr = append(oldArr[:oi], oldArr[oi+1:]...)
 | 
						|
					oi = oi - 1
 | 
						|
				}
 | 
						|
			}
 | 
						|
			oi = oi + 1
 | 
						|
		}
 | 
						|
		ni = ni + 1
 | 
						|
	}
 | 
						|
 | 
						|
	return newArr, oldArr, unmodifierValue
 | 
						|
}
 | 
						|
 | 
						|
// 判断数组中是否含有指定元素
 | 
						|
func ArrayContains[T comparable](arr []T, el T) bool {
 | 
						|
	for _, v := range arr {
 | 
						|
		if v == el {
 | 
						|
			return true
 | 
						|
		}
 | 
						|
	}
 | 
						|
	return false
 | 
						|
}
 | 
						|
 | 
						|
// 数组转为map
 | 
						|
// @param keyFunc key的主键
 | 
						|
func ArrayToMap[T any, K comparable](arr []T, keyFunc func(val T) K) map[K]T {
 | 
						|
	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
 | 
						|
}
 | 
						|
 | 
						|
// 将数组或切片按固定大小分割成小数组
 | 
						|
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
 | 
						|
}
 |