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
|
/**
* 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.Before;
import org.junit.BeforeClass;
import org.junit.AfterClass;
import org.junit.Test;
public class TestArrayHashSet01 {
public static class Dummy {
int i1, i2, i3;
public Dummy(int i1, int i2, int i3) {
this.i1 = i1;
this.i2 = i2;
this.i3 = i3;
}
public boolean equals(Object o) {
if(o instanceof Dummy) {
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+"]";
}
}
public void populate(List l, int start, int len, int i2, int i3, int expectedPlusSize) {
int oldSize = l.size();
int pos = start+len-1;
while(pos>=start) {
l.add(new Dummy(pos--, i2, i3));
}
Assert.assertEquals(expectedPlusSize, l.size() - oldSize);
}
@Test
public void test01ArrayHashSet() {
int sum=0;
ArrayHashSet l = new ArrayHashSet();
populate(l, 10, 100, 22, 34, 100); // [10 .. 109]
populate(l, 10, 100, 22, 34, 0); // [10 .. 109]
populate(l, 6, 5, 22, 34, 4); // [ 6 .. 9], 10 already exists
Dummy p6_22_34 = new Dummy(6, 22, 34);
// slow get on position ..
int i = l.indexOf(p6_22_34);
Dummy q = (Dummy) l.get(i);
Assert.assertNotNull(q);
Assert.assertEquals(p6_22_34, q);
Assert.assertTrue(p6_22_34.hashCode() == q.hashCode());
Assert.assertTrue(p6_22_34 != q); // diff reference
// fast identity ..
q = (Dummy) l.get(p6_22_34);
Assert.assertNotNull(q);
Assert.assertEquals(p6_22_34, q);
Assert.assertTrue(p6_22_34.hashCode() == q.hashCode());
Assert.assertTrue(p6_22_34 != q); // diff reference
Assert.assertTrue(!l.add(q)); // add same
Assert.assertTrue(!l.add(p6_22_34)); // add equivalent
}
public static void main(String args[]) throws IOException {
String tstname = TestArrayHashSet01.class.getName();
org.junit.runner.JUnitCore.main(tstname);
}
}
|
