-
Notifications
You must be signed in to change notification settings - Fork 270
/
slice.go
73 lines (63 loc) · 1.4 KB
/
slice.go
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
/*
Copyright 2023 The Kubernetes Authors.
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to in writing, software
distributed under the License is distributed on an "AS IS" BASIS,
WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
See the License for the specific language governing permissions and
limitations under the License.
*/
package fnutil
func Map[T any, R any](f func(T) R, xs []T) []R {
rv := make([]R, len(xs))
for i, x := range xs {
rv[i] = f(x)
}
return rv
}
func Filter[T any](f func(T) bool, xs []T) []T {
var rv []T
for _, x := range xs {
if f(x) {
rv = append(rv, x)
}
}
return rv
}
func RemoveIf[T any](f func(T) bool, xs []T) []T {
var rv []T
for _, x := range xs {
if !f(x) {
rv = append(rv, x)
}
}
return rv
}
func IsAll[T any](f func(T) bool, xs []T) bool {
for _, x := range xs {
if !f(x) {
return false
}
}
return true
}
func IndexSet[T comparable](xs []T) map[T]bool {
rv := make(map[T]bool, len(xs))
for _, x := range xs {
rv[x] = true
}
return rv
}
func Intersection[T comparable](xs, ys []T) []T {
ysSet := IndexSet(ys)
var rv []T
for _, x := range xs {
if ysSet[x] {
rv = append(rv, x)
}
}
return rv
}