-
Notifications
You must be signed in to change notification settings - Fork 462
/
miscellaneous.go
207 lines (172 loc) · 5.34 KB
/
miscellaneous.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
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
// SPDX-FileCopyrightText: 2024 SAP SE or an SAP affiliate company and Gardener contributors
//
// SPDX-License-Identifier: Apache-2.0
package utils
import (
"errors"
"fmt"
"math/big"
"net"
"regexp"
"strings"
"time"
metav1 "k8s.io/apimachinery/pkg/apis/meta/v1"
)
// MergeMaps takes two maps <a>, <b> and merges them. If <b> defines a value with a key
// already existing in the <a> map, the <a> value for that key will be overwritten.
func MergeMaps(a, b map[string]interface{}) map[string]interface{} {
var values = make(map[string]interface{}, len(b))
for i, v := range b {
existing, ok := a[i]
values[i] = v
switch elem := v.(type) {
case map[string]interface{}:
if ok {
if extMap, ok := existing.(map[string]interface{}); ok {
values[i] = MergeMaps(extMap, elem)
}
}
default:
values[i] = v
}
}
for i, v := range a {
if _, ok := values[i]; !ok {
values[i] = v
}
}
return values
}
// MergeStringMaps merges the content of the newMaps with the oldMap. If a key already exists then
// it gets overwritten by the last value with the same key.
func MergeStringMaps[T any](oldMap map[string]T, newMaps ...map[string]T) map[string]T {
var out map[string]T
if oldMap != nil {
out = make(map[string]T, len(oldMap))
}
for k, v := range oldMap {
out[k] = v
}
for _, newMap := range newMaps {
if newMap != nil && out == nil {
out = make(map[string]T)
}
for k, v := range newMap {
out[k] = v
}
}
return out
}
// TimeElapsed takes a <timestamp> and a <duration> checks whether the elapsed time until now is less than the <duration>.
// If yes, it returns true, otherwise it returns false.
func TimeElapsed(timestamp *metav1.Time, duration time.Duration) bool {
if timestamp == nil {
return true
}
var (
end = metav1.NewTime(timestamp.Time.UTC().Add(duration))
now = metav1.NewTime(time.Now().UTC())
)
return !now.Before(&end)
}
// FindFreePort finds a free port on the host machine and returns it.
func FindFreePort() (int, error) {
l, err := net.Listen("tcp", "127.0.0.1:0")
if err != nil {
return 0, err
}
defer l.Close()
return l.Addr().(*net.TCPAddr).Port, nil
}
// emailVefiryRegex is used to verify the validity of an email.
var emailVefiryRegex = regexp.MustCompile(`^[^@]+@(?:[a-zA-Z-0-9]+\.)+[a-zA-Z]{2,}$`)
// TestEmail validates the provided <email> against a regular expression and returns whether it matches.
func TestEmail(email string) bool {
return emailVefiryRegex.MatchString(email)
}
// IDForKeyWithOptionalValue returns an identifier for the given key + optional value.
func IDForKeyWithOptionalValue(key string, value *string) string {
v := ""
if value != nil {
v = "=" + *value
}
return key + v
}
// Indent indents the given string with the given number of spaces.
func Indent(str string, spaces int) string {
return strings.ReplaceAll(str, "\n", "\n"+strings.Repeat(" ", spaces))
}
// ShallowCopyMapStringInterface creates a shallow copy of the given map.
func ShallowCopyMapStringInterface(values map[string]interface{}) map[string]interface{} {
copiedValues := make(map[string]interface{}, len(values))
for k, v := range values {
copiedValues[k] = v
}
return copiedValues
}
// IifString returns onTrue if the condition is true, and onFalse otherwise.
// It is similar to the ternary operator (?:) and the IIF function (see https://en.wikipedia.org/wiki/IIf) in other languages.
func IifString(condition bool, onTrue, onFalse string) string {
if condition {
return onTrue
}
return onFalse
}
// InterfaceMapToStringMap translates map[string]interface{} to map[string]string.
func InterfaceMapToStringMap(in map[string]interface{}) map[string]string {
m := make(map[string]string, len(in))
for k, v := range in {
m[k] = fmt.Sprint(v)
}
return m
}
// FilterEntriesByPrefix returns a list of strings which begin with the given prefix.
func FilterEntriesByPrefix(prefix string, entries []string) []string {
var result []string
for _, entry := range entries {
if strings.HasPrefix(entry, prefix) {
result = append(result, entry)
}
}
return result
}
// FilterEntriesByFilterFn returns a list of entries which passes the filter function.
func FilterEntriesByFilterFn(entries []string, filterFn func(entry string) bool) []string {
var result []string
for _, entry := range entries {
if filterFn != nil && !filterFn(entry) {
continue
}
result = append(result, entry)
}
return result
}
// ComputeOffsetIP parses the provided <subnet> and offsets with the value of <offset>.
// For example, <subnet> = 100.64.0.0/11 and <offset> = 10 the result would be 100.64.0.10
// IPv6 and IPv4 is supported.
func ComputeOffsetIP(subnet *net.IPNet, offset int64) (net.IP, error) {
if subnet == nil {
return nil, errors.New("subnet is nil")
}
isIPv6 := false
bytes := subnet.IP.To4()
if bytes == nil {
isIPv6 = true
bytes = subnet.IP.To16()
}
ip := net.IP(big.NewInt(0).Add(big.NewInt(0).SetBytes(bytes), big.NewInt(offset)).Bytes())
if !subnet.Contains(ip) {
return nil, fmt.Errorf("cannot compute IP with offset %d - subnet %q too small", offset, subnet)
}
// there is no broadcast address on IPv6
if isIPv6 {
return ip, nil
}
for i := range ip {
// IP address is not the same, so it's not the broadcast ip.
if ip[i] != ip[i]|^subnet.Mask[i] {
return ip.To4(), nil
}
}
return nil, fmt.Errorf("computed IPv4 address %q is broadcast for subnet %q", ip, subnet)
}