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
|
package backoff
import (
"fmt"
"math"
"testing"
"time"
)
func TestIncremental(t *testing.T) {
const duration = time.Millisecond
const increment = time.Nanosecond
algorithm := Incremental(duration, increment)
for i := uint(0); i < 10; i++ {
result := algorithm(i)
expected := duration + (time.Duration(i) * increment)
if result != expected {
t.Errorf("algorithm expected to return a %s duration, but received %s instead", expected, result)
}
}
}
func TestLinear(t *testing.T) {
const duration = time.Millisecond
algorithm := Linear(duration)
for i := uint(0); i < 10; i++ {
result := algorithm(i)
expected := time.Duration(i) * duration
if result != expected {
t.Errorf("algorithm expected to return a %s duration, but received %s instead", expected, result)
}
}
}
func TestExponential(t *testing.T) {
const duration = time.Second
const base = 3
algorithm := Exponential(duration, base)
for i := uint(0); i < 10; i++ {
result := algorithm(i)
expected := time.Duration(math.Pow(base, float64(i))) * duration
if result != expected {
t.Errorf("algorithm expected to return a %s duration, but received %s instead", expected, result)
}
}
}
func TestBinaryExponential(t *testing.T) {
const duration = time.Second
algorithm := BinaryExponential(duration)
for i := uint(0); i < 10; i++ {
result := algorithm(i)
expected := time.Duration(math.Pow(2, float64(i))) * duration
if result != expected {
t.Errorf("algorithm expected to return a %s duration, but received %s instead", expected, result)
}
}
}
func TestFibonacci(t *testing.T) {
const duration = time.Millisecond
algorithm := Fibonacci(duration)
for i := uint(0); i < 10; i++ {
result := algorithm(i)
expected := time.Duration(fibonacciNumber(i)) * duration
if result != expected {
t.Errorf("algorithm expected to return a %s duration, but received %s instead", expected, result)
}
}
}
func TestFibonacciNumber(t *testing.T) {
// Fibonacci sequence
expectedSequence := []uint{0, 1, 1, 2, 3, 5, 8, 13, 21, 34, 55, 89, 144, 233}
for i, expected := range expectedSequence {
result := fibonacciNumber(uint(i))
if result != expected {
t.Errorf("fibonacci %d number expected %d, but got %d", i, expected, result)
}
}
}
func ExampleIncremental() {
algorithm := Incremental(15*time.Millisecond, 10*time.Millisecond)
for i := uint(1); i <= 5; i++ {
duration := algorithm(i)
fmt.Printf("#%d attempt: %s\n", i, duration)
}
// Output:
// #1 attempt: 25ms
// #2 attempt: 35ms
// #3 attempt: 45ms
// #4 attempt: 55ms
// #5 attempt: 65ms
}
func ExampleLinear() {
algorithm := Linear(15 * time.Millisecond)
for i := uint(1); i <= 5; i++ {
duration := algorithm(i)
fmt.Printf("#%d attempt: %s\n", i, duration)
}
// Output:
// #1 attempt: 15ms
// #2 attempt: 30ms
// #3 attempt: 45ms
// #4 attempt: 60ms
// #5 attempt: 75ms
}
func ExampleExponential() {
algorithm := Exponential(15*time.Millisecond, 3)
for i := uint(1); i <= 5; i++ {
duration := algorithm(i)
fmt.Printf("#%d attempt: %s\n", i, duration)
}
// Output:
// #1 attempt: 45ms
// #2 attempt: 135ms
// #3 attempt: 405ms
// #4 attempt: 1.215s
// #5 attempt: 3.645s
}
func ExampleBinaryExponential() {
algorithm := BinaryExponential(15 * time.Millisecond)
for i := uint(1); i <= 5; i++ {
duration := algorithm(i)
fmt.Printf("#%d attempt: %s\n", i, duration)
}
// Output:
// #1 attempt: 30ms
// #2 attempt: 60ms
// #3 attempt: 120ms
// #4 attempt: 240ms
// #5 attempt: 480ms
}
func ExampleFibonacci() {
algorithm := Fibonacci(15 * time.Millisecond)
for i := uint(1); i <= 5; i++ {
duration := algorithm(i)
fmt.Printf("#%d attempt: %s\n", i, duration)
}
// Output:
// #1 attempt: 15ms
// #2 attempt: 15ms
// #3 attempt: 30ms
// #4 attempt: 45ms
// #5 attempt: 75ms
}
|
