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
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
|
/**
* Copyright 2010 JogAmp Community. All rights reserved.
*
* Redistribution and use in source and binary forms, with or without modification, are
* permitted provided that the following conditions are met:
*
* 1. Redistributions of source code must retain the above copyright notice, this list of
* conditions and the following disclaimer.
*
* 2. Redistributions in binary form must reproduce the above copyright notice, this list
* of conditions and the following disclaimer in the documentation and/or other materials
* provided with the distribution.
*
* THIS SOFTWARE IS PROVIDED BY JogAmp Community ``AS IS'' AND ANY EXPRESS OR IMPLIED
* WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND
* FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL JogAmp Community OR
* CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
* CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR
* SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON
* ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING
* NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF
* ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
*
* The views and conclusions contained in the software and documentation are those of the
* authors and should not be interpreted as representing official policies, either expressed
* or implied, of JogAmp Community.
*/
package com.jogamp.common.util;
import java.util.*;
import java.io.IOException;
import org.junit.Assert;
import org.junit.Test;
import com.jogamp.junit.util.SingletonJunitCase;
import org.junit.FixMethodOrder;
import org.junit.runners.MethodSorters;
@FixMethodOrder(MethodSorters.NAME_ASCENDING)
public class TestArrayHashSet01 extends SingletonJunitCase {
public static class Dummy {
int i1, i2, i3;
public Dummy(final int i1, final int i2, final int i3) {
this.i1 = i1;
this.i2 = i2;
this.i3 = i3;
}
public boolean equals(final Object o) {
if(o instanceof Dummy) {
final Dummy d = (Dummy)o;
return this.i1 == d.i1 &&
this.i2 == d.i2 &&
this.i3 == d.i3 ;
}
return false;
}
public final int hashCode() {
// 31 * x == (x << 5) - x
int hash = 31 + i1;
hash = ((hash << 5) - hash) + i2;
hash = ((hash << 5) - hash) + i3;
return hash;
}
public String toString() {
return "Dummy["+super.toString()+": "+i1+", "+i2+", "+i3+"]";
}
}
void populate(final List<Dummy> l, final int start, final int len,
final int i2, final int i3, final int expectedPlusSize) {
final int oldSize = l.size();
for(int pos = start+len-1; pos>=start; pos--) {
l.add(new Dummy(pos, i2, i3));
}
Assert.assertEquals(expectedPlusSize, l.size() - oldSize);
}
boolean checkOrder(final List<Dummy> l, final int startIdx, final int start, final int len) {
for(int i=0; i<len; i++) {
final Dummy d = l.get(startIdx+i);
final int i1 = start+len-1-i;
if( d.i1 != i1 ) {
return false;
}
}
return true;
}
@Test
public void test01ArrayHashSetWithNullValue() {
testArrayHashSetImpl(true);
}
@Test
public void test02ArrayHashSetWithoutNullValue() {
testArrayHashSetImpl(false);
}
void testArrayHashSetImpl(final boolean supportNullValue) {
final ArrayHashSet<Dummy> l =
new ArrayHashSet<Dummy>(supportNullValue,
ArrayHashSet.DEFAULT_INITIAL_CAPACITY,
ArrayHashSet.DEFAULT_LOAD_FACTOR);
Assert.assertEquals(supportNullValue, l.supportsNullValue());
final int p7_22_34_idx;
final Dummy p7_22_34_orig;
final int p6_22_34_idx;
final Dummy p6_22_34_orig;
{
populate(l, 10, 100, 22, 34, 100); // [109 .. 10]
Assert.assertTrue(checkOrder(l, 0, 10, 100));
populate(l, 10, 100, 22, 34, 0); // [109 .. 10]
Assert.assertTrue(checkOrder(l, 0, 10, 100));
populate(l, 6, 5, 22, 34, 4); // [ 9 .. 6], 10 already exists
Assert.assertTrue(checkOrder(l, 100, 6, 4));
p7_22_34_idx = l.size() - 2;
p7_22_34_orig = l.get(p7_22_34_idx);
p6_22_34_idx = l.size() - 1;
p6_22_34_orig = l.get(p6_22_34_idx);
}
Assert.assertNotNull(p7_22_34_orig);
Assert.assertEquals(7, p7_22_34_orig.i1);
Assert.assertEquals(l.getData().get(p7_22_34_idx), p7_22_34_orig);
Assert.assertNotNull(p6_22_34_orig);
Assert.assertEquals(6, p6_22_34_orig.i1);
Assert.assertEquals(l.getData().get(p6_22_34_idx), p6_22_34_orig);
final Dummy p7_22_34_other = new Dummy(7, 22, 34);
Assert.assertEquals(p7_22_34_other, p7_22_34_orig);
Assert.assertTrue(p7_22_34_other.hashCode() == p7_22_34_orig.hashCode());
Assert.assertTrue(p7_22_34_other != p7_22_34_orig); // diff reference
final Dummy p6_22_34_other = new Dummy(6, 22, 34);
Assert.assertEquals(p6_22_34_other, p6_22_34_orig);
Assert.assertTrue(p6_22_34_other.hashCode() == p6_22_34_orig.hashCode());
Assert.assertTrue(p6_22_34_other != p6_22_34_orig); // diff reference
// slow get on position ..
final int i = l.indexOf(p6_22_34_other);
Dummy q = l.get(i);
Assert.assertNotNull(q);
Assert.assertEquals(p6_22_34_other, q);
Assert.assertTrue(p6_22_34_other.hashCode() == q.hashCode());
Assert.assertTrue(p6_22_34_other != q); // diff reference
Assert.assertTrue(p6_22_34_orig == q); // same reference
// fast identity ..
q = l.get(p6_22_34_other);
Assert.assertNotNull(q);
Assert.assertEquals(p6_22_34_other, q);
Assert.assertTrue(p6_22_34_other.hashCode() == q.hashCode());
Assert.assertTrue(p6_22_34_other != q); // diff reference
Assert.assertTrue(p6_22_34_orig == q); // same reference
Assert.assertTrue(!l.add(q)); // add same
Assert.assertTrue(!l.add(p6_22_34_other)); // add equivalent
q = l.getOrAdd(p6_22_34_other); // not added test w/ diff hash-obj
Assert.assertNotNull(q);
Assert.assertEquals(p6_22_34_other, q);
Assert.assertTrue(p6_22_34_other.hashCode() == q.hashCode());
Assert.assertTrue(p6_22_34_other != q); // diff reference
Assert.assertTrue(p6_22_34_orig == q); // same reference
Assert.assertTrue(checkOrder(l, 0, 10, 100));
Assert.assertTrue(checkOrder(l, 100, 6, 4));
final Dummy p1_2_3 = new Dummy(1, 2, 3); // a new one ..
q = l.getOrAdd(p1_2_3); // added test
Assert.assertNotNull(q);
Assert.assertEquals(p1_2_3, q);
Assert.assertTrue(p1_2_3.hashCode() == q.hashCode());
Assert.assertTrue(p1_2_3 == q); // _same_ reference, since getOrAdd added it
Assert.assertTrue(checkOrder(l, 0, 10, 100));
Assert.assertTrue(checkOrder(l, 100, 6, 4));
final Dummy pNull = null;
NullPointerException npe = null;
try {
q = l.getOrAdd(pNull);
Assert.assertNull(q);
} catch (final NullPointerException _npe) { npe = _npe; }
if( l.supportsNullValue() ) {
Assert.assertNull(npe);
} else {
Assert.assertNotNull(npe);
}
try {
Assert.assertTrue(l.remove(pNull));
} catch (final NullPointerException _npe) { npe = _npe; }
if( l.supportsNullValue() ) {
Assert.assertNull(npe);
} else {
Assert.assertNotNull(npe);
}
}
public static void main(final String args[]) throws IOException {
final String tstname = TestArrayHashSet01.class.getName();
org.junit.runner.JUnitCore.main(tstname);
}
}
|
