-
Notifications
You must be signed in to change notification settings - Fork 71
/
backoff.go
125 lines (98 loc) · 2.06 KB
/
backoff.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
//
// DISCLAIMER
//
// Copyright 2016-2022 ArangoDB GmbH, Cologne, Germany
//
// 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.
//
// Copyright holder is ArangoDB GmbH, Cologne, Germany
//
package v2alpha1
import (
"encoding/json"
"time"
meta "k8s.io/apimachinery/pkg/apis/meta/v1"
)
var _ json.Marshaler = BackOff{}
type BackOffKey string
type BackOff map[BackOffKey]meta.Time
func (b BackOff) MarshalJSON() ([]byte, error) {
r := map[BackOffKey]meta.Time{}
for k, v := range b {
if v.IsZero() {
continue
}
r[k] = *v.DeepCopy()
}
return json.Marshal(r)
}
func (b BackOff) Process(key BackOffKey) bool {
if b == nil {
return true
}
if t, ok := b[key]; ok {
if t.IsZero() {
return true
}
return time.Now().After(t.Time)
} else {
return true
}
}
func (b BackOff) BackOff(key BackOffKey, delay time.Duration) BackOff {
n := meta.Time{Time: time.Now().Add(delay)}
z := b.DeepCopy()
if z == nil {
return BackOff{
key: n,
}
}
z[key] = n
return z
}
func (b BackOff) Combine(a BackOff) BackOff {
d := b.DeepCopy()
if d == nil {
d = BackOff{}
}
for k, v := range a {
d[k] = v
}
return d
}
func (b BackOff) CombineLatest(a BackOff) BackOff {
d := b.DeepCopy()
if d == nil {
d = BackOff{}
}
for k, v := range a {
if i, ok := d[k]; !ok || (ok && v.After(i.Time)) {
d[k] = v
}
}
return d
}
func (b BackOff) Equal(a BackOff) bool {
if len(b) == 0 && len(a) == 0 {
return true
}
if len(b) != len(a) {
return false
}
for k, v := range b {
if av, ok := a[k]; !ok || !v.Equal(&av) {
return false
}
}
return true
}