forked from cncf/devstats.archive
/
map.go
47 lines (42 loc) · 1.53 KB
/
map.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
package devstats
import "sort"
// SkipEmpty - skip one element arrays contining only empty string
// This is what strings.Split() returns for empty input
// We expect empty array or empty map returned in such cases
func SkipEmpty(arr []string) []string {
if len(arr) != 1 || len(arr) == 1 && arr[0] != "" {
return arr
}
return []string{}
}
// StringsMapToArray this is a function that calls given function for all array items and returns array of items processed by this func
// Example call: lib.StringsMapToArray(func(x string) string { return strings.TrimSpace(x) }, []string{" a", " b ", "c "})
func StringsMapToArray(f func(string) string, strArr []string) []string {
strArr = SkipEmpty(strArr)
outArr := make([]string, len(strArr))
for index, str := range strArr {
outArr[index] = f(str)
}
return outArr
}
// StringsMapToSet this is a function that calls given function for all array items and returns set of items processed by this func
// Example call: lib.StringsMapToSet(func(x string) string { return strings.TrimSpace(x) }, []string{" a", " b ", "c "})
func StringsMapToSet(f func(string) string, strArr []string) map[string]struct{} {
strArr = SkipEmpty(strArr)
outSet := make(map[string]struct{})
for _, str := range strArr {
outSet[f(str)] = struct{}{}
}
return outSet
}
// StringsSetKeys - returns all keys from string map
func StringsSetKeys(set map[string]struct{}) []string {
outArr := make([]string, len(set))
index := 0
for key := range set {
outArr[index] = key
index++
}
sort.Strings(outArr)
return outArr
}