-
Notifications
You must be signed in to change notification settings - Fork 1
/
slice.go
71 lines (63 loc) · 1.74 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
// Copyright 2022 Tomas Machalek <tomas.machalek@gmail.com>
// Copyright 2022 Institute of the Czech National Corpus,
// Faculty of Arts, Charles University
//
// 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 collections
import "math/rand"
func SliceContains[T comparable](data []T, value T) bool {
for _, v := range data {
if v == value {
return true
}
}
return false
}
func SliceFindIndex[T any](data []T, cmp func(v T) bool) int {
for i, v := range data {
if cmp(v) {
return i
}
}
return -1
}
func SliceMap[T any, U any](data []T, mapFn func(v T, i int) U) []U {
ans := make([]U, len(data))
for i, item := range data {
ans[i] = mapFn(item, i)
}
return ans
}
func SliceReduce[T any, U any](data []T, reduceFn func(acc U, curr T, i int) U, initial U) U {
ans := initial
for i, item := range data {
ans = reduceFn(ans, item, i)
}
return ans
}
func SliceFilter[T any](data []T, filterFn func(v T, i int) bool) []T {
ans := make([]T, 0, len(data))
for i, v := range data {
if filterFn(v, i) {
ans = append(ans, v)
}
}
return ans
}
// SliceShuffle shuffles a slice in place
func SliceShuffle[T any](data []T) {
for i := 0; i < len(data); i++ {
j := rand.Intn(i + 1)
data[i], data[j] = data[j], data[i]
}
}