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
208
209
210
211
212
213
|
package org.eclipse.viatra.solver.data.map.tests.utils;
import static org.junit.jupiter.api.Assertions.assertEquals;
import static org.junit.jupiter.api.Assertions.assertTrue;
import static org.junit.jupiter.api.Assertions.fail;
import java.util.HashMap;
import java.util.Iterator;
import java.util.List;
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.VersionedMap;
import org.eclipse.viatra.solver.data.map.internal.VersionedMapImpl;
public class MapTestEnvironment<K, V> {
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 <K, V> void compareTwoMaps(String title, VersionedMapImpl<K, V> map1,
VersionedMapImpl<K, V> map2) {
compareTwoMaps(title, map1, map2, null);
}
public static <K, V> void compareTwoMaps(String title, VersionedMapImpl<K, V> map1,
VersionedMapImpl<K, V> map2, List<Throwable> errors) {
// 1. Comparing cursors.
Cursor<K, V> cursor1 = map1.getAll();
Cursor<K, V> cursor2 = map2.getAll();
while (!cursor1.isTerminated()) {
if (cursor2.isTerminated()) {
fail("cursor 2 terminated before cursor1");
}
assertEqualsList(cursor1.getKey(), cursor2.getKey(),"Keys not equal", errors);
assertEqualsList(cursor2.getValue(), cursor2.getValue(), "Values not equal", errors);
cursor1.move();
cursor2.move();
}
if (!cursor2.isTerminated())
fail("cursor 1 terminated before cursor 2");
// 2.1. comparing hash codes
assertEqualsList(map1.hashCode(), map2.hashCode(), title + ": hash code check",errors);
assertEqualsList(map1, map2, title + ": 1.equals(2)",errors);
assertEqualsList(map2, map1, title + ": 2.equals(1)",errors);
}
private static void assertEqualsList(Object o1, Object o2, String message, List<Throwable> errors) {
if(errors == null) {
assertEquals(o1, o2, message);
} else {
if(o1 != null) {
if(!(o1.equals(o2))) {
AssertionError error = new AssertionError((message != null ? message+" " : "") + "expected: " + o1 + " but was : " + o2);
errors.add(error);
}
}
}
}
public VersionedMapImpl<K, V> sut;
Map<K, V> oracle = new HashMap<K, V>();
public MapTestEnvironment(VersionedMapImpl<K, V> sut) {
this.sut = sut;
}
public void put(K key, V value) {
V oldSutValue = sut.put(key, value);
V oldOracleValue;
if (value != sut.getDefaultValue()) {
oldOracleValue = oracle.put(key, value);
} else {
oldOracleValue = oracle.remove(key);
}
if(oldSutValue == sut.getDefaultValue() && oldOracleValue != null) {
fail("After put, SUT old value was default, but oracle old walue was " + oldOracleValue);
}
if(oldSutValue != sut.getDefaultValue()) {
assertEquals(oldOracleValue, oldSutValue);
}
}
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<K, V> entry : oracle.entrySet()) {
V sutValue = sut.get(entry.getKey());
V 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
int elementsInSutEntrySet = 0;
Cursor<K, V> cursor = sut.getAll();
while (cursor.move()) {
elementsInSutEntrySet++;
K key = cursor.getKey();
V sutValue = cursor.getValue();
// System.out.println(key + " -> " + sutValue);
V 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 static <K,V> void checkOrder(String scenario, VersionedMap<K,V> versionedMap) {
K previous = null;
Cursor<K, V> cursor = versionedMap.getAll();
while(cursor.move()) {
System.out.println(cursor.getKey() + " " + ((VersionedMapImpl<K, V>) versionedMap).getHashProvider().getHash(cursor.getKey(), 0));
if(previous != null) {
int comparisonResult = ((VersionedMapImpl<K, V>) versionedMap).getHashProvider().compare(previous, cursor.getKey());
assertTrue(comparisonResult<0,scenario+" Cursor order is not incremental!");
}
previous = cursor.getKey();
}
System.out.println();
}
public void printComparison() {
System.out.println("SUT:");
printEntrySet(sut.getAll());
System.out.println("Oracle:");
printEntrySet(oracle.entrySet().iterator());
}
private void printEntrySet(Iterator<Entry<K, V>> iterator) {
TreeMap<K, V> treemap = new TreeMap<>();
while (iterator.hasNext()) {
Entry<K, V> entry = iterator.next();
treemap.put(entry.getKey(), entry.getValue());
}
for (Entry<K, V> e : treemap.entrySet()) {
System.out.println("\t" + e.getKey() + " -> " + e.getValue());
}
}
private void printEntrySet(Cursor<K, V> cursor) {
TreeMap<K, V> treemap = new TreeMap<>();
while (cursor.move()) {
treemap.put(cursor.getKey(), cursor.getValue());
}
for (Entry<K, V> e : treemap.entrySet()) {
System.out.println("\t" + e.getKey() + " -> " + e.getValue());
}
}
}
|
