-
Notifications
You must be signed in to change notification settings - Fork 178
Expand file tree
/
Copy pathDataTest.java
More file actions
111 lines (95 loc) · 3.08 KB
/
DataTest.java
File metadata and controls
111 lines (95 loc) · 3.08 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
/**
* Copyright 2012 Twitter, Inc
*
* 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 ua_parser;
import static org.hamcrest.Matchers.is;
import static org.hamcrest.Matchers.not;
import java.util.HashSet;
import java.util.Random;
import org.hamcrest.MatcherAssert;
import org.junit.Before;
import org.junit.Test;
/**
* Abstract base class for the data class tests
*
* @author Steve Jiang (@sjiang) <gh at iamsteve com>
*/
public abstract class DataTest<T> {
protected Random random;
protected Random seedRandom = new Random();
@Before
public void initialize() {
random = new Random();
}
protected abstract T getRandomInstance(long seed, StringGenerator g);
protected abstract T getBlankInstance();
protected long nextSeed() {
return seedRandom.nextLong();
}
protected class StringGenerator {
private HashSet<String> generated = new HashSet<String>();
private Random strRand;
protected final boolean unique;
public StringGenerator(long seed, boolean unique) {
strRand = new Random(seed);
this.unique = unique;
}
public String getString(int maxLen) {
if (!unique) {
return genString(maxLen);
}
while (true) {
String ret = genString(maxLen);
if (generated.add(ret)) {
return ret;
}
}
}
private String genString(int maxLen) {
int len = strRand.nextInt(maxLen + 1);
StringBuilder sb = new StringBuilder(len);
for (int i = len; i-- > 0; ) {
// ascii printable range 32 to 126
sb.append((char)(strRand.nextInt(126-32+1)+32));
}
return sb.toString();
}
}
@Test
public void testEqualsAndHashCode() {
for (int i = 1000; i-- > 0; ) {
long seed = nextSeed();
T first = getRandomInstance(seed, new StringGenerator(seed, false));
T second = getRandomInstance(seed, new StringGenerator(seed, false));
MatcherAssert.assertThat(first, is(second));
MatcherAssert.assertThat(first.hashCode(), is(second.hashCode()));
}
}
@Test
public void testNotEquals() {
for (int i = 1000; i-- > 0; ) {
StringGenerator uniqueGenerator = new StringGenerator(nextSeed(), true);
T first = getRandomInstance(nextSeed(), uniqueGenerator);
T second = getRandomInstance(nextSeed(), uniqueGenerator);
MatcherAssert.assertThat(first, is(not(second)));
}
}
@Test
public void testBlankInstances() {
T first = getBlankInstance(), second = getBlankInstance();
MatcherAssert.assertThat(first, is(second));
MatcherAssert.assertThat(first.hashCode(), is(second.hashCode()));
}
}