-
Notifications
You must be signed in to change notification settings - Fork 2
Expand file tree
/
Copy patharray_methods.go
More file actions
159 lines (139 loc) · 2.7 KB
/
Copy patharray_methods.go
File metadata and controls
159 lines (139 loc) · 2.7 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
package ccl
// ForEach function for Array
/*
Usage:
arr := []int{1,2,3,4,5}
ForEach(arr, func(e int) {
fmt.Println(e)
})
*/
func ForEach[T any](array []T, callback func(element T)) {
for _, value := range array {
callback(value)
}
}
// Find function for Array
/*
Usage:
arr := []int{1,2,3,4,5}
Find(arr, 4) // => 1 or, -1
*/
func Find[T comparable](array []T, element T) int {
for i, val := range array {
if val == element {
return i
}
}
return -1
}
// Map function for Array
/*
Usage:
arr := []int{1,2,3,4,5}
newArr := Map(arr, func(e int) int {
return e*2
})
fmt.Println(newArr) // => [2,4,6,8,10]
*/
func Map[T comparable](array []T, callback func(element T) T) []T {
var newArr []T
ForEach(array, func(e T) {
newArr = append(newArr, callback(e))
})
return newArr
}
// Filter function for Array
/*
Usage:
arr := []int{1,2,3,4,5}
newArr := Filter(arr, func(e int) bool {
return e%2==0
})
fmt.Println(newArr) // => [2,4]
*/
func Filter[T comparable](array []T, callback func(element T) bool) []T {
var newArr []T
ForEach(array, func(e T) {
if callback(e) {
newArr = append(newArr, e)
}
})
return newArr
}
// Reduce function for Array
/*
Usage:
arr := []int{1,2,3,4,5}
sum := Reduce(arr, func(acc, e int) int {
acc += e
return acc
}, 0)
fmt.Println(sum) // => 15
*/
func Reduce[T, K comparable](array []T, callback func(accumulator K, element T) K, initial K) K {
var acc = initial
ForEach(array, func(e T) {
acc = callback(acc, e)
})
return acc
}
// Reverse function for Array
/*
Usage:
arr := []int{1,2,3,4,5}
fmt.Println(Reverse(arr)) // => [5,4,3,2,1]
*/
func Reverse[T comparable](array []T) []T {
var newArr []T
for i := len(array) - 1; i >= 0; i-- {
newArr = append(newArr, array[i])
}
return newArr
}
// Unique function for Array
/*
Usage:
arr := []int{1,2,2,2,3,4,4,4,4,5,5}
fmt.Println(Unique(arr)) // => [1,2,3,4,5]
*/
func Unique[T comparable](array []T) []T {
var stagingArr []T
ForEach(array, func(e T) {
if Find(stagingArr, e) == -1 {
stagingArr = append(stagingArr, e)
}
})
return stagingArr
}
// Chunk function for array
/*
Usage:
arr := []int{1,2,3,4,5}
fmt.Println(Chunk(arr, 2)) // => [[1 2] [3 4] [5]]
*/
func Chunk[T comparable](array []T, chunkSize int) [][]T{
var newArr [][]T
for i := 0; i < len(array); i += chunkSize{
end := i + chunkSize
if end > len(array){
end = len(array)
}
newArr = append(newArr, array[i:end])
}
return newArr
}
// Flatten function for array of arrays
/*
Usage:
arr := [][]int{{1,2},{3,4},{5}}
fmt.Println(Flatten(arr)) // => [1 2 3 4 5]
*/
func Flatten[T comparable](array [][]T) []T{
var newArr []T
ForEach(array, func(sub []T) {
ForEach(sub, func(e T) {
newArr = append(newArr, e)
})
})
return newArr
}