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
|
package org.eclipse.viatra.solver.data.map.tests.support;
import static org.junit.jupiter.api.Assertions.assertEquals;
import static org.junit.jupiter.api.Assertions.fail;
import java.util.HashMap;
import java.util.Iterator;
import java.util.Map;
import java.util.Map.Entry;
import java.util.TreeMap;
import org.eclipse.viatra.solver.data.map.ContinousHashProvider;
import org.eclipse.viatra.solver.data.map.Cursor;
import org.eclipse.viatra.solver.data.map.internal.VersionedMapImpl;
public class MapTestEnvironment<KEY, VALUE> {
public static String[] prepareValues(int maxValue) {
String[] values = new String[maxValue];
values[0] = "DEFAULT";
for (int i = 1; i < values.length; i++) {
values[i] = "VAL" + i;
}
return values;
}
public static ContinousHashProvider<Integer> prepareHashProvider(final boolean evil) {
// Use maxPrime = 2147483629
ContinousHashProvider<Integer> chp = new ContinousHashProvider<Integer>() {
@Override
public int getHash(Integer key, int index) {
if (evil && index < 15 && index < key / 3) {
return 7;
}
int result = 1;
final int prime = 31;
result = prime * result + key;
result = prime * result + index;
return result;
}
};
return chp;
}
public static void printStatus(String scenario, int actual, int max, String stepName) {
if (actual % 10000 == 0) {
String printStepName = stepName == null ? "" : stepName;
System.out.format(scenario + ":%d/%d (%d%%) " + printStepName + "%n", actual, max, actual * 100 / max);
}
}
public static <KEY, VALUE> void compareTwoMaps(String title, VersionedMapImpl<KEY, VALUE> map1,
VersionedMapImpl<KEY, VALUE> map2) {
// 1. Comparing cursors.
Cursor<KEY, VALUE> cursor1 = map1.getCursor();
Cursor<KEY, VALUE> cursor2 = map2.getCursor();
while (!cursor1.isTerminated()) {
if (cursor2.isTerminated()) {
fail("cursor 2 terminated before cursor1");
}
assertEquals(cursor1.getKey(), cursor2.getKey());
assertEquals(cursor2.getValue(), cursor2.getValue());
cursor1.move();
cursor2.move();
}
if (!cursor2.isTerminated())
fail("cursor 1 terminated before cursor 2");
// 2.1. comparing hash codes
assertEquals(map1.hashCode(), map2.hashCode(), title + ": hash code check");
assertEquals(map1, map2, title + ": 1.equals(2)");
assertEquals(map2, map1, title + ": 2.equals(1)");
}
public VersionedMapImpl<KEY, VALUE> sut;
Map<KEY, VALUE> oracle = new HashMap<KEY, VALUE>();
public MapTestEnvironment(VersionedMapImpl<KEY, VALUE> sut) {
this.sut = sut;
}
public void put(KEY key, VALUE value) {
sut.put(key, value);
if (value != sut.getDefaultValue()) {
oracle.put(key, value);
} else {
oracle.remove(key);
}
}
public void checkEquivalence(String title) {
// 0. Checking integrity
try {
sut.checkIntegrity();
} catch (IllegalStateException e) {
fail(title + ": " + e.getMessage());
}
// 1. Checking: if Reference contains <key,value> pair, then SUT contains
// <key,value> pair.
// Tests get functions
for (Entry<KEY, VALUE> entry : oracle.entrySet()) {
VALUE sutValue = sut.get(entry.getKey());
VALUE oracleValue = entry.getValue();
if (sutValue != oracleValue) {
printComparison();
fail(title + ": Non-equivalent get(" + entry.getKey() + ") results: SUT=" + sutValue + ", Oracle="
+ oracleValue + "!");
}
}
// 2. Checking: if SUT contains <key,value> pair, then Reference contains
// <key,value> pair.
// Tests iterators
// TODO: Counts the number of elements in the entryset
int elementsInSutEntrySet = 0;
Cursor<KEY, VALUE> cursor = sut.getCursor();
while (cursor.move()) {
elementsInSutEntrySet++;
KEY key = cursor.getKey();
VALUE sutValue = cursor.getValue();
// System.out.println(key + " -> " + sutValue);
VALUE oracleValue = oracle.get(key);
if (sutValue != oracleValue) {
printComparison();
fail(title + ": Non-equivalent entry in iterator: SUT=<" + key + "," + sutValue + ">, Oracle=<" + key
+ "," + oracleValue + ">!");
}
}
// 3. Checking sizes
// Counting of non-default value pairs.
int oracleSize = oracle.entrySet().size();
long sutSize = sut.getSize();
if (oracleSize != sutSize || oracleSize != elementsInSutEntrySet) {
printComparison();
fail(title + ": Non-eqivalent size() result: SUT.getSize()=" + sutSize + ", SUT.entryset.size="
+ elementsInSutEntrySet + ", Oracle=" + oracleSize + "!");
}
}
public void printComparison() {
System.out.println("SUT:");
printEntrySet(sut.getCursor());
System.out.println("Oracle:");
printEntrySet(oracle.entrySet().iterator());
}
private void printEntrySet(Iterator<Entry<KEY, VALUE>> iterator) {
TreeMap<KEY, VALUE> treemap = new TreeMap<>();
while (iterator.hasNext()) {
Entry<KEY, VALUE> entry = iterator.next();
treemap.put(entry.getKey(), entry.getValue());
}
for (Entry<KEY, VALUE> e : treemap.entrySet()) {
System.out.println("\t" + e.getKey() + " -> " + e.getValue());
}
}
private void printEntrySet(Cursor<KEY, VALUE> cursor) {
TreeMap<KEY, VALUE> treemap = new TreeMap<>();
while (cursor.move()) {
treemap.put(cursor.getKey(), cursor.getValue());
}
for (Entry<KEY, VALUE> e : treemap.entrySet()) {
System.out.println("\t" + e.getKey() + " -> " + e.getValue());
}
}
}
|
