-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathfilter.go
148 lines (140 loc) · 3.07 KB
/
filter.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
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
// Copyright 2022 streams Author. All Rights Reserved.
// 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 streams
// Filter function
//
// T: element type
//
// filterFunc: the filter function
func Filter[T any](ts []T, filterFunc func(t T) bool) []T {
nEs := make([]T, 0)
for _, t := range ts {
if filterFunc(t) {
nEs = append(nEs, t)
}
}
return nEs
}
// FilterThenCount function
//
// T: element type
//
// filterFunc: the filter function
func FilterThenCount[T any](ts []T, filterFunc func(t T) bool) int {
cc := 0
for _, t := range ts {
if filterFunc(t) {
cc++
}
}
return cc
}
// FilterThenMap function
//
// T: element type
//
// R: result type
//
// filterFunc: the filter function
//
// mapFunc: the map function
func FilterThenMap[T, R any](ts []T, filterFunc func(t T) bool, mapFunc func(t T) R) []R {
rs := make([]R, 0)
for _, t := range ts {
if filterFunc(t) {
rs = append(rs, mapFunc(t))
}
}
return rs
}
// FilterThenToMap function
//
// T: element type
//
// K: map key type
//
// V: map value type
//
// filterFunc: the filter function
//
// toMapFunc: the toMap function
func FilterThenToMap[T any, K comparable, V any](ts []T, filterFunc func(t T) bool, toMapFunc func(t T) (K, V)) map[K]V {
m := make(map[K]V)
for _, t := range ts {
if filterFunc(t) {
k, v := toMapFunc(t)
m[k] = v
}
}
return m
}
// FilterThenToSet function
//
// T: element type
//
// K: map key type
//
// filterFunc: the filter function
//
// toSetFunc: the toSet function
func FilterThenToSet[T any, E comparable](tS []T, filterFunc func(t T) bool, toSetFunc func(t T) E) Set[E] {
s := NewSet[E]()
for _, t := range tS {
if filterFunc(t) {
s.Add(toSetFunc(t))
}
}
return s
}
// FilterThenGroupBy function
//
// T: element type
//
// K: map key type
//
// V: map value type
//
// filterFunc: the filter function
//
// groupByFunc: the groupBy function
func FilterThenGroupBy[T any, K comparable, V any](ts []T, filterFunc func(t T) bool, groupByFunc func(t T) (K, V)) map[K][]V {
m := make(map[K][]V)
for _, t := range ts {
if filterFunc(t) {
k, v := groupByFunc(t)
if vs, have := m[k]; have {
vs = append(vs, v)
m[k] = vs
} else {
m[k] = []V{v}
}
}
}
return m
}
// FilterThenReduce function
//
// T: element type
//
// R: reduce type
//
// filterFunc: the filter function
//
// reduceFunc: the reduce function
func FilterThenReduce[T any, R any](ts []T, filterFunc func(t T) bool, r R, reduceFunc func(t T, sum *R)) R {
nTs := make([]T, 0)
for _, t := range ts {
if filterFunc(t) {
nTs = append(nTs, t)
}
}
return Reduce(nTs, r, reduceFunc)
}