-
Notifications
You must be signed in to change notification settings - Fork 5
Expand file tree
/
Copy pathbackoff_test.go
More file actions
112 lines (91 loc) · 2.9 KB
/
backoff_test.go
File metadata and controls
112 lines (91 loc) · 2.9 KB
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
/*
Copyright 2024.
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 utils
import (
"time"
. "github.com/onsi/ginkgo/v2"
. "github.com/onsi/gomega"
metav1 "k8s.io/apimachinery/pkg/apis/meta/v1"
prefectiov1 "github.com/PrefectHQ/prefect-operator/api/v1"
)
var _ = Describe("Backoff utilities", func() {
Describe("CalculateBackoffDelay", func() {
It("should return progressive delays", func() {
testCases := []struct {
attempts int
expected time.Duration
}{
{0, 15 * time.Second},
{1, 30 * time.Second},
{2, 60 * time.Second},
{3, 120 * time.Second},
{4, 120 * time.Second}, // Max delay
{10, 120 * time.Second}, // Still max delay
}
for _, tc := range testCases {
delay := CalculateBackoffDelay(tc.attempts)
Expect(delay).To(Equal(tc.expected), "Attempt %d should have delay %v", tc.attempts, tc.expected)
}
})
})
Describe("Retry count management", func() {
var workPool *prefectiov1.PrefectWorkPool
BeforeEach(func() {
workPool = &prefectiov1.PrefectWorkPool{
ObjectMeta: metav1.ObjectMeta{
Name: "test-pool",
Namespace: "default",
},
}
})
It("should start with zero retry count", func() {
count := GetRetryCount(workPool)
Expect(count).To(Equal(0))
})
It("should increment retry count", func() {
IncrementRetryCount(workPool)
Expect(GetRetryCount(workPool)).To(Equal(1))
IncrementRetryCount(workPool)
Expect(GetRetryCount(workPool)).To(Equal(2))
})
It("should reset retry count", func() {
IncrementRetryCount(workPool)
IncrementRetryCount(workPool)
Expect(GetRetryCount(workPool)).To(Equal(2))
ResetRetryCount(workPool)
Expect(GetRetryCount(workPool)).To(Equal(0))
})
It("should detect when to stop retrying", func() {
for i := 0; i < MaxRetryAttempts-1; i++ {
IncrementRetryCount(workPool)
Expect(ShouldStopRetrying(workPool)).To(BeFalse())
}
IncrementRetryCount(workPool)
Expect(ShouldStopRetrying(workPool)).To(BeTrue())
})
It("should handle missing annotations gracefully", func() {
workPool.SetAnnotations(nil)
count := GetRetryCount(workPool)
Expect(count).To(Equal(0))
IncrementRetryCount(workPool)
Expect(GetRetryCount(workPool)).To(Equal(1))
})
It("should handle invalid annotation values", func() {
workPool.SetAnnotations(map[string]string{
RetryCountAnnotation: "invalid",
})
count := GetRetryCount(workPool)
Expect(count).To(Equal(0))
})
})
})