/
util.go
184 lines (158 loc) · 3.78 KB
/
util.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
/*
Copyright 2019 The Jetstack cert-manager contributors.
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 util
import (
"math/rand"
"net"
"net/url"
"sort"
"time"
cmapi "github.com/jetstack/cert-manager/pkg/apis/certmanager/v1"
)
func OnlyOneNotNil(items ...interface{}) (any bool, one bool) {
oneNotNil := false
for _, i := range items {
if i != nil {
if oneNotNil {
return true, false
}
oneNotNil = true
}
}
return oneNotNil, oneNotNil
}
func EqualSorted(s1, s2 []string) bool {
if len(s1) != len(s2) {
return false
}
for i := range s1 {
if s1[i] != s2[i] {
return false
}
}
return true
}
func EqualUnsorted(s1 []string, s2 []string) bool {
if len(s1) != len(s2) {
return false
}
s1_2, s2_2 := make([]string, len(s1)), make([]string, len(s2))
copy(s1_2, s1)
copy(s2_2, s2)
sort.Strings(s1_2)
sort.Strings(s2_2)
for i, s := range s1_2 {
if s != s2_2[i] {
return false
}
}
return true
}
// Test for equal URL slices even if unsorted. Panics if any element is nil
func EqualURLsUnsorted(s1, s2 []*url.URL) bool {
if len(s1) != len(s2) {
return false
}
s1_2, s2_2 := make([]*url.URL, len(s1)), make([]*url.URL, len(s2))
copy(s1_2, s1)
copy(s2_2, s2)
sort.SliceStable(s1_2, func(i, j int) bool {
return s1_2[i].String() < s1_2[j].String()
})
sort.SliceStable(s2_2, func(i, j int) bool {
return s2_2[i].String() < s2_2[j].String()
})
for i, s := range s1_2 {
if s.String() != s2_2[i].String() {
return false
}
}
return true
}
// Test for equal IP slices even if unsorted
func EqualIPsUnsorted(s1, s2 []net.IP) bool {
if len(s1) != len(s2) {
return false
}
s1_2, s2_2 := make([]string, len(s1)), make([]string, len(s2))
// we may want to implement a sort interface here instead of []byte conversion
for i := range s1 {
s1_2[i] = string(s1[i])
s2_2[i] = string(s2[i])
}
sort.SliceStable(s1_2, func(i, j int) bool {
return s1_2[i] < s1_2[j]
})
sort.SliceStable(s2_2, func(i, j int) bool {
return s2_2[i] < s2_2[j]
})
for i, s := range s1_2 {
if s != s2_2[i] {
return false
}
}
return true
}
// Test for equal KeyUsage slices even if unsorted
func EqualKeyUsagesUnsorted(s1, s2 []cmapi.KeyUsage) bool {
if len(s1) != len(s2) {
return false
}
s1_2, s2_2 := make([]string, len(s1)), make([]string, len(s2))
// we may want to implement a sort interface here instead of []byte conversion
for i := range s1 {
s1_2[i] = string(s1[i])
s2_2[i] = string(s2[i])
}
sort.SliceStable(s1_2, func(i, j int) bool {
return s1_2[i] < s1_2[j]
})
sort.SliceStable(s2_2, func(i, j int) bool {
return s2_2[i] < s2_2[j]
})
for i, s := range s1_2 {
if s != s2_2[i] {
return false
}
}
return true
}
func init() {
rand.Seed(time.Now().UnixNano())
}
var letterRunes = []rune("abcdefghijklmnopqrstuvwxyz")
func RandStringRunes(n int) string {
b := make([]rune, n)
for i := range b {
b[i] = letterRunes[rand.Intn(len(letterRunes))]
}
return string(b)
}
// Contains returns true if a string is contained in a string slice
func Contains(ss []string, s string) bool {
for _, v := range ss {
if v == s {
return true
}
}
return false
}
// Subset returns true if one slice is an unsorted subset of the first.
func Subset(set, subset []string) bool {
for _, s := range subset {
if !Contains(set, s) {
return false
}
}
return true
}