-
Notifications
You must be signed in to change notification settings - Fork 0
Commit
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
Showing
3 changed files
with
215 additions
and
107 deletions.
There are no files selected for viewing
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| Original file line number | Diff line number | Diff line change |
|---|---|---|
| @@ -1,96 +1,119 @@ | ||
| package utils | ||
|
|
||
|
|
||
| func Chunk[T any](slice []T, size int) [][]T { | ||
| var chunks [][]T | ||
| for i := 0; i < len(slice); i += size { | ||
| end := i + size | ||
| if end > len(slice) { | ||
| end = len(slice) | ||
| } | ||
| chunks = append(chunks, slice[i:end]) | ||
| } | ||
| return chunks | ||
| var chunks [][]T | ||
| for i := 0; i < len(slice); i += size { | ||
| end := i + size | ||
| if end > len(slice) { | ||
| end = len(slice) | ||
| } | ||
| chunks = append(chunks, slice[i:end]) | ||
| } | ||
| return chunks | ||
| } | ||
|
|
||
| func Reverse[T any](slice []T) []T { | ||
| buf := make([]T, len(slice)) | ||
| begin := 0 | ||
| end := len(slice) - 1 | ||
| for begin < end { | ||
| buf[begin] = slice[end] | ||
| buf[end] = slice[begin] | ||
| begin++ | ||
| end-- | ||
| } | ||
| return buf | ||
| } | ||
|
|
||
| func Reduce[T any](slice []T, reducer func(T, T) T, initialValue T) T { | ||
| result := initialValue | ||
|
|
||
| for _, val := range slice { | ||
| result = reducer(result, val) | ||
| } | ||
| func Reduce[T any](slice []T, reducer func(T, T, int) T, accumulator T) T { | ||
| result := accumulator | ||
| for key, val := range slice { | ||
| result = reducer(result, val, key) | ||
| } | ||
|
|
||
| return result | ||
| return result | ||
| } | ||
|
|
||
| func Map[T any](slice []T, mapper func(T) T) []T { | ||
| result := make([]T, len(slice)) | ||
| result := make([]T, len(slice)) | ||
|
|
||
| for i, val := range slice { | ||
| result[i] = mapper(val) | ||
| } | ||
| for i, val := range slice { | ||
| result[i] = mapper(val) | ||
| } | ||
|
|
||
| return result | ||
| return result | ||
| } | ||
|
|
||
| func Filter[T any](slice []T, predicate func(T) bool) []T { | ||
| var result []T | ||
| var result []T | ||
|
|
||
| for _, val := range slice { | ||
| if predicate(val) { | ||
| result = append(result, val) | ||
| } | ||
| } | ||
| for _, val := range slice { | ||
| if predicate(val) { | ||
| result = append(result, val) | ||
| } | ||
| } | ||
|
|
||
| return result | ||
| return result | ||
| } | ||
|
|
||
| func PadEnd[T any](slice []T, targetLength int, padValue T) []T { | ||
| currentLength := len(slice) | ||
| paddingLength := targetLength - currentLength | ||
| if paddingLength <= 0 || currentLength > targetLength { | ||
| return slice | ||
| } | ||
| newSlice := make([]T, 0,paddingLength) | ||
| for i := 0; i < paddingLength; i++ { | ||
| newSlice = append(newSlice, padValue) | ||
| } | ||
| newSlice = append(slice, newSlice...) | ||
|
|
||
| return newSlice | ||
| currentLength := len(slice) | ||
| paddingLength := targetLength - currentLength | ||
| if paddingLength <= 0 || currentLength > targetLength { | ||
| return slice | ||
| } | ||
| newSlice := make([]T, 0, paddingLength) | ||
| for i := 0; i < paddingLength; i++ { | ||
| newSlice = append(newSlice, padValue) | ||
| } | ||
| newSlice = append(slice, newSlice...) | ||
|
|
||
| return newSlice | ||
| } | ||
|
|
||
| func PadEndString(val string, length int, padValue string) string { | ||
| currentLength := len(val) | ||
| paddingLength := length - currentLength | ||
| if paddingLength <= 0 || currentLength > length { | ||
| return val | ||
| } | ||
| pad := "" | ||
| for i := 0; i < paddingLength; i++ { | ||
| pad = pad + padValue | ||
| } | ||
| return val + pad | ||
| } | ||
|
|
||
| func PadStart[T any](slice []T, targetLength int, padValue T) []T { | ||
| currentLength := len(slice) | ||
| paddingLength := targetLength - currentLength | ||
| if paddingLength <= 0 || currentLength > targetLength { | ||
| return slice | ||
| } | ||
| currentLength := len(slice) | ||
| paddingLength := targetLength - currentLength | ||
| if paddingLength <= 0 || currentLength > targetLength { | ||
| return slice | ||
| } | ||
|
|
||
| newSlice := make([]T, 0, paddingLength) | ||
| for i := 0; i < paddingLength; i++ { | ||
| newSlice = append(newSlice, padValue) | ||
| } | ||
| newSlice := make([]T, 0, paddingLength) | ||
| for i := 0; i < paddingLength; i++ { | ||
| newSlice = append(newSlice, padValue) | ||
| } | ||
|
|
||
| newSlice = append(newSlice, slice...) | ||
| newSlice = append(newSlice, slice...) | ||
|
|
||
| return newSlice | ||
| return newSlice | ||
| } | ||
|
|
||
| func GroupBy[T any, K comparable](slice []T, getKey func(T) K) map[K][]T { | ||
| groups := make(map[K][]T) | ||
| groups := make(map[K][]T) | ||
|
|
||
| for _, item := range slice { | ||
| key := getKey(item) | ||
| groups[key] = append(groups[key], item) | ||
| } | ||
| for _, item := range slice { | ||
| key := getKey(item) | ||
| groups[key] = append(groups[key], item) | ||
| } | ||
|
|
||
| return groups | ||
| return groups | ||
| } | ||
|
|
||
| func ForEach[T any](slice []T,callback func(value T,key int)){ | ||
| for k, v := range slice { | ||
| callback(v,k) | ||
| } | ||
| func ForEach[T any](slice []T, callback func(value T, key int)) { | ||
| for k, v := range slice { | ||
| callback(v, k) | ||
| } | ||
| } |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters