-
Notifications
You must be signed in to change notification settings - Fork 2.3k
/
ExponentialBackoffStrategyTest.java
89 lines (75 loc) · 2.72 KB
/
ExponentialBackoffStrategyTest.java
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
/*
* Copyright (c) 2002-2017 "Neo Technology,"
* Network Engine for Objects in Lund AB [http://neotechnology.com]
*
* This file is part of Neo4j.
*
* Neo4j is free software: you can redistribute it and/or modify
* it under the terms of the GNU Affero General Public License as
* published by the Free Software Foundation, either version 3 of the
* License, or (at your option) any later version.
*
* This program is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
* GNU Affero General Public License for more details.
*
* You should have received a copy of the GNU Affero General Public License
* along with this program. If not, see <http://www.gnu.org/licenses/>.
*/
package org.neo4j.causalclustering.helper;
import org.junit.Test;
import static java.util.concurrent.TimeUnit.MILLISECONDS;
import static org.junit.Assert.assertEquals;
public class ExponentialBackoffStrategyTest
{
private static final int NUMBER_OF_ACCESSES = 5;
@Test
public void shouldDoubleEachTime() throws Exception
{
// given
ExponentialBackoffStrategy strategy = new ExponentialBackoffStrategy( 1, 1 << NUMBER_OF_ACCESSES, MILLISECONDS );
RetryStrategy.Timeout timeout = strategy.newTimeout();
// when
for ( int i = 0; i < NUMBER_OF_ACCESSES; i++ )
{
timeout.increment();
}
// then
assertEquals( 1 << NUMBER_OF_ACCESSES, timeout.getMillis() );
}
@Test
public void shouldProvidePreviousTimeout() throws Exception
{
// given
ExponentialBackoffStrategy strategy = new ExponentialBackoffStrategy( 1, 1 << NUMBER_OF_ACCESSES, MILLISECONDS );
RetryStrategy.Timeout timeout = strategy.newTimeout();
// when
for ( int i = 0; i < NUMBER_OF_ACCESSES; i++ )
{
timeout.increment();
}
// then
assertEquals( 1 << NUMBER_OF_ACCESSES, timeout.getMillis() );
}
@Test
public void shouldRespectUpperBound() throws Exception
{
// given
long upperBound = (1 << NUMBER_OF_ACCESSES) - 5;
ExponentialBackoffStrategy strategy = new ExponentialBackoffStrategy( 1, upperBound, MILLISECONDS );
RetryStrategy.Timeout timeout = strategy.newTimeout();
// when
for ( int i = 0; i < NUMBER_OF_ACCESSES; i++ )
{
timeout.increment();
}
assertEquals( upperBound, timeout.getMillis() );
// additional increments
timeout.increment();
timeout.increment();
timeout.increment();
// then
assertEquals( upperBound, timeout.getMillis() );
}
}