blob: d3ab817b5d7ce57145dc4f639226f9cbe78d43a5 (
plain)
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
|
package org.apache.qpid.util;
import junit.framework.TestCase;
import java.util.Random;
import org.apache.qpid.SerialException;
/**
*Junit tests for the Serial class
*/
public class SerialTest extends TestCase
{
/**
* Test the key boundaries where wraparound occurs.
*/
public void testBoundaries()
{
assertTrue(Serial.gt(1, 0));
assertTrue(Serial.lt(0, 1));
assertTrue(Serial.gt(Integer.MAX_VALUE+1, Integer.MAX_VALUE));
assertTrue(Serial.lt(Integer.MAX_VALUE, Integer.MAX_VALUE+1));
assertTrue(Serial.gt(0xFFFFFFFF + 1, 0xFFFFFFFF));
assertTrue(Serial.lt(0xFFFFFFFF, 0xFFFFFFFF + 1));
}
/**
* Test the first Corollary of RFC 1982
* For any sequence number s and any integer n such that addition of n
* to s is well defined, (s + n) >= s. Further (s + n) == s only when
* n == 0, in all other defined cases, (s + n) > s.
*/
public void testCorollary1()
{
int wrapcount = 0;
int s = 0;
for (int i = 0; i < 67108664; i++)
{
for (int n = 1; n < 4096; n += 512)
{
assertTrue(Serial.gt(s+n, s));
assertTrue(Serial.lt(s, s+n));
}
s += 1024;
if (s == 0)
{
wrapcount += 1;
}
}
assertTrue(wrapcount > 0);
}
}
|