/
ingress.go
68 lines (55 loc) · 1.62 KB
/
ingress.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
package inventory
import (
"fmt"
networkingv1 "k8s.io/api/networking/v1"
"github.com/jaegertracing/jaeger-operator/pkg/util"
)
// Ingress represents the inventory of ingresses based on the current and desired states
type Ingress struct {
Create []networkingv1.Ingress
Update []networkingv1.Ingress
Delete []networkingv1.Ingress
}
// ForIngresses builds an inventory of ingresses based on the existing and desired states
func ForIngresses(existing []networkingv1.Ingress, desired []networkingv1.Ingress) Ingress {
update := []networkingv1.Ingress{}
mcreate := ingressMap(desired)
mdelete := ingressMap(existing)
for k, v := range mcreate {
if t, ok := mdelete[k]; ok {
tp := t.DeepCopy()
util.InitObjectMeta(tp)
// we can't blindly DeepCopyInto, so, we select what we bring from the new to the old object
tp.Spec = v.Spec
tp.ObjectMeta.OwnerReferences = v.ObjectMeta.OwnerReferences
for k, v := range v.ObjectMeta.Annotations {
tp.ObjectMeta.Annotations[k] = v
}
for k, v := range v.ObjectMeta.Labels {
tp.ObjectMeta.Labels[k] = v
}
update = append(update, *tp)
delete(mcreate, k)
delete(mdelete, k)
}
}
return Ingress{
Create: ingressList(mcreate),
Update: update,
Delete: ingressList(mdelete),
}
}
func ingressMap(deps []networkingv1.Ingress) map[string]networkingv1.Ingress {
m := map[string]networkingv1.Ingress{}
for _, d := range deps {
m[fmt.Sprintf("%s.%s", d.Namespace, d.Name)] = d
}
return m
}
func ingressList(m map[string]networkingv1.Ingress) []networkingv1.Ingress {
l := []networkingv1.Ingress{}
for _, v := range m {
l = append(l, v)
}
return l
}