-
Notifications
You must be signed in to change notification settings - Fork 0
/
util.go
162 lines (145 loc) · 2.8 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
package util
import (
"go/build"
"os"
"strings"
)
func DuplicateStrings(a []string) []string {
if len(a) == 0 {
return nil
}
s := make([]string, len(a))
copy(s, a)
return s
}
func StringsContains(a []string, val string) bool {
for _, s := range a {
if s == val {
return true
}
}
return false
}
func StringsAppend(a []string, val string) []string {
if !StringsContains(a, val) {
return append(a, val)
}
return a
}
func StringsRemoveAll(a []string, val string) []string {
v := a[:0]
for _, s := range a {
if s != val {
v = append(v, s)
}
}
return v
}
// StringsSame returns true if the string slices contain the same
// elements ignoring order.
func StringsSame(a1, a2 []string) bool {
if len(a1) != len(a2) {
return false
}
// brute force search for small string slices
if len(a1) <= 64 {
Loop:
for _, s1 := range a1 {
for _, s2 := range a2 {
if s1 == s2 {
continue Loop
}
}
return false
}
return true
}
want := make(map[string]int, len(a1))
for _, s := range a1 {
want[s]++
}
for _, s := range a2 {
n := want[s]
if n <= 0 {
return false
}
want[s] = n - 1
}
return true
}
func TagsIntersect(m1, m2 map[string]bool) bool {
for k := range m1 {
if _, ok := m2[k]; ok {
return true
}
}
return false
}
type Environ struct {
env []string
}
func NewEnviron() *Environ { return &Environ{env: os.Environ()} }
func (e *Environ) Environ() []string { return e.env }
func (e *Environ) Index(key string) int {
n := len(key)
if n <= 0 {
return -1
}
ch := key[0]
for i, s := range e.env {
if len(s) == 0 || s[0] != ch {
continue
}
// Checking len(s) twice is required for bounds-check-elimination
if len(s) > n && s[0:n] == key && n < len(s) /* BCE */ && s[n] == '=' {
return i
}
}
return -1
}
func (e *Environ) Lookup(key string) (value string, found bool) {
if i := e.Index(key); i >= 0 {
s := e.env[i]
if j := strings.IndexByte(s, '='); j >= 0 {
s = s[j+1:]
}
return s, true
}
return "", false
}
func (e *Environ) Set(key, value string) {
if i := e.Index(key); i != -1 {
e.env[i] = key + "=" + value
} else {
e.env = append(e.env, key+"="+value)
}
}
func CopyContext(orig *build.Context) *build.Context {
tmp := *orig // make a copy
ctxt := &tmp
// Use one backing string slice
n := len(ctxt.BuildTags) + len(ctxt.ToolTags) + len(ctxt.ReleaseTags)
a := make([]string, n)
if n := len(ctxt.BuildTags); n != 0 {
copy(a, ctxt.BuildTags)
ctxt.BuildTags = a[0:n:n]
a = a[n:]
} else {
ctxt.BuildTags = nil
}
if n := len(ctxt.ToolTags); n != 0 {
copy(a, ctxt.ToolTags)
ctxt.ToolTags = a[0:n:n]
a = a[n:]
} else {
ctxt.ToolTags = nil
}
if n := len(ctxt.ReleaseTags); n != 0 {
copy(a, ctxt.ReleaseTags)
ctxt.ReleaseTags = a[0:n:n]
a = a[n:]
} else {
ctxt.ReleaseTags = nil
}
return ctxt
}