-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathmain.go
More file actions
60 lines (53 loc) · 900 Bytes
/
main.go
File metadata and controls
60 lines (53 loc) · 900 Bytes
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
package hltrnty
import "sync"
func Map[T any, U any](s []T, f func(T) U) []U {
r := make([]U, len(s))
for k, v := range s {
r[k] = f(v)
}
return r
}
func ConcurMap[T any, U any](s []T, f func(T) U) []U {
r := make([]U, len(s))
wg := sync.WaitGroup{}
for k, v := range s {
wg.Add(1)
go func(i int, v T) {
defer wg.Done()
r[i] = f(v)
}(k, v)
}
wg.Wait()
return r
}
func Filter[T any](s []T, f func(T) bool) []T {
r := make([]T, 0)
for _, v := range s {
if f(v) {
r = append(r, v)
}
}
return r
}
func Reduce[T any, U any](s []T, f func(acc U, cur T) U, zero U) U {
for _, v := range s {
zero = f(zero, v)
}
return zero
}
func Some[T any](s []T, f func(T) bool) bool {
for _, v := range s {
if f(v) {
return true
}
}
return false
}
func Find[T any](s []*T, f func(*T) bool) *T {
for _, v := range s {
if f(v) {
return v
}
}
return nil
}