Commit 6a641951 authored by Noric Couderc's avatar Noric Couderc

Fix: Removed collections for benchmarking

Some of the collections are not valid contestants for benchmarking
because they don't have the same semantics.
parent df867788
......@@ -12,9 +12,9 @@ public class MapSyntheticBenchmarkGenerator implements SyntheticBenchmarkGenerat
for (int i = 0; i < number; ++i) {
mapSyntheticBenchmarks.add(BCBenchmarkPackage.MAP(seed + i, size, 0, new HashMap<>()));
mapSyntheticBenchmarks.add(BCBenchmarkPackage.MAP(seed + i, size, 0, new TreeMap<>()));
mapSyntheticBenchmarks.add(BCBenchmarkPackage.MAP(seed + i, size, 0, new IdentityHashMap<>()));
// mapSyntheticBenchmarks.add(BCBenchmarkPackage.MAP(seed + i, size, 0, new IdentityHashMap<>()));
mapSyntheticBenchmarks.add(BCBenchmarkPackage.MAP(seed + i, size, 0, new LinkedHashMap<>()));
mapSyntheticBenchmarks.add(BCBenchmarkPackage.MAP(seed + i, size, 0, new WeakHashMap<>()));
// mapSyntheticBenchmarks.add(BCBenchmarkPackage.MAP(seed + i, size, 0, new WeakHashMap<>()));
}
return mapSyntheticBenchmarks;
......@@ -25,9 +25,9 @@ public class MapSyntheticBenchmarkGenerator implements SyntheticBenchmarkGenerat
List<BCBenchmarkPackage<?>> mapSyntheticBenchmarks = new ArrayList<>();
mapSyntheticBenchmarks.add(BCBenchmarkPackage.MAP(traceKey, trace, new HashMap<>()));
mapSyntheticBenchmarks.add(BCBenchmarkPackage.MAP(traceKey, trace, new TreeMap<>()));
mapSyntheticBenchmarks.add(BCBenchmarkPackage.MAP(traceKey, trace, new IdentityHashMap<>()));
// mapSyntheticBenchmarks.add(BCBenchmarkPackage.MAP(traceKey, trace, new IdentityHashMap<>()));
mapSyntheticBenchmarks.add(BCBenchmarkPackage.MAP(traceKey, trace, new LinkedHashMap<>()));
mapSyntheticBenchmarks.add(BCBenchmarkPackage.MAP(traceKey, trace, new WeakHashMap<>()));
// mapSyntheticBenchmarks.add(BCBenchmarkPackage.MAP(traceKey, trace, new WeakHashMap<>()));
return mapSyntheticBenchmarks;
}
......
......@@ -14,8 +14,8 @@ public class SetSyntheticBenchmarkGenerator implements SyntheticBenchmarkGenerat
setSyntheticBenchmarks.add(BCBenchmarkPackage.SET(seed + i, 0, size, new HashSet<>()));
setSyntheticBenchmarks.add(BCBenchmarkPackage.SET(seed + i, 0, size, new TreeSet<>()));
setSyntheticBenchmarks.add(BCBenchmarkPackage.SET(seed + i, 0, size, new LinkedHashSet<>()));
setSyntheticBenchmarks.add(BCBenchmarkPackage.SET(seed + i, 0, size, new ConcurrentSkipListSet<>()));
setSyntheticBenchmarks.add(BCBenchmarkPackage.SET(seed + i, 0, size, new CopyOnWriteArraySet<>()));
// setSyntheticBenchmarks.add(BCBenchmarkPackage.SET(seed + i, 0, size, new ConcurrentSkipListSet<>()));
// setSyntheticBenchmarks.add(BCBenchmarkPackage.SET(seed + i, 0, size, new CopyOnWriteArraySet<>()));
}
return setSyntheticBenchmarks;
......@@ -27,8 +27,8 @@ public class SetSyntheticBenchmarkGenerator implements SyntheticBenchmarkGenerat
setSyntheticBenchmarks.add(BCBenchmarkPackage.SET(traceKey, trace, new HashSet<>()));
setSyntheticBenchmarks.add(BCBenchmarkPackage.SET(traceKey, trace, new TreeSet<>()));
setSyntheticBenchmarks.add(BCBenchmarkPackage.SET(traceKey, trace, new LinkedHashSet<>()));
setSyntheticBenchmarks.add(BCBenchmarkPackage.SET(traceKey, trace, new ConcurrentSkipListSet<>()));
setSyntheticBenchmarks.add(BCBenchmarkPackage.SET(traceKey, trace, new CopyOnWriteArraySet<>()));
// setSyntheticBenchmarks.add(BCBenchmarkPackage.SET(traceKey, trace, new ConcurrentSkipListSet<>()));
// setSyntheticBenchmarks.add(BCBenchmarkPackage.SET(traceKey, trace, new CopyOnWriteArraySet<>()));
return setSyntheticBenchmarks;
}
}
......@@ -69,7 +69,7 @@ public class SyntheticBenchmarkRunnerTest {
SyntheticBenchmarkRunner runner = new SyntheticBenchmarkRunner();
List<TrainingSetValue> results = runner.runBenchmarks(benchmarks.collect(Collectors.toList()));
Assert.assertEquals(11, results.size());
Assert.assertEquals(9, results.size());
// All benchmarks that have the same ID must have the same best data structure
for (TrainingSetValue t1 : results) {
// We also want to check there's no benchmark
......
Markdown is supported
0% or
You are about to add 0 people to the discussion. Proceed with caution.
Finish editing this message first!
Please register or to comment