-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathTimeTest.java
More file actions
65 lines (52 loc) · 3.14 KB
/
TimeTest.java
File metadata and controls
65 lines (52 loc) · 3.14 KB
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
import utils.TimeUtil;
import xyz.micrusa.structures.*;
import java.util.HashMap;
import java.util.Map;
import java.util.function.BiConsumer;
public class TimeTest {
private static final int TEST_COUNT = 10000;
private static final int INITIAL_CAPACITY = 100;
private static final double LOAD_FACTOR = 0.75;
private static final TimeTestClass[] TIME_TEST_CLASSES = new TimeTestClass[]{
new TimeTestClass<>("warmup", new DynamicArray<Integer>(INITIAL_CAPACITY, DynamicArray.ResizeStrategy.DOUBLING), DynamicArray::add, (a, i) -> a.remove(0)),
new TimeTestClass<>("DynamicArray (DOUBLING)", new DynamicArray<Integer>(INITIAL_CAPACITY, DynamicArray.ResizeStrategy.DOUBLING), DynamicArray::add, (a, i) -> a.remove(0)),
//new TimeTestClass<>("DynamicArray (INCREMENT)", new DynamicArray<Integer>(INITIAL_CAPACITY, DynamicArray.ResizeStrategy.INCREMENTAL), DynamicArray::add, (a, i) -> a.remove(0)),
new TimeTestClass<>("DynamicArrayStack", new DynamicArrayStack<Integer>(), DynamicArrayStack::push, (a, i) -> a.pop()),
new TimeTestClass<>("LinkedQueue", new LinkedQueue<Integer>(), LinkedQueue::queue, (a, i) -> a.dequeue()),
new TimeTestClass<>("LinkedStack", new LinkedStack<Integer>(), LinkedStack::push, (a, i) -> a.pop()),
new TimeTestClass<>("SimpleHashMap", new SimpleHashMap<Integer, Integer>(INITIAL_CAPACITY, LOAD_FACTOR), (a, i) -> a.put(i, i), SimpleHashMap::remove)
};
public static void main(String[] args) {
Map<String, Long> addTimes = new HashMap<>();
Map<String, Long> removeTimes = new HashMap<>();
for(TimeTestClass timeTestClass : TIME_TEST_CLASSES) {
long addTime = TimeUtil.time(() -> {
for(int i = 0; i < TEST_COUNT; i++) {
timeTestClass.add(i);
}
});
long removeTime = TimeUtil.time(() -> {
for(int i = 0; i < TEST_COUNT; i++) {
timeTestClass.remove(i);
}
});
addTimes.put(timeTestClass.name(), addTime);
removeTimes.put(timeTestClass.name(), removeTime);
}
double minTime = Math.min(addTimes.values().stream().mapToLong(Long::longValue).min().getAsLong(), removeTimes.values().stream().mapToLong(Long::longValue).min().getAsLong());
System.out.printf("%-30s | %-18s | %-18s | %-18s | %-18s%n", "Class", "Add Time (ns)", "Remove Time (ns)", "Add Time / Min", "Remove Time / Min");
addTimes.keySet().stream().sorted().map(name -> {
long addTime = addTimes.get(name);
long removeTime = removeTimes.get(name);
return String.format("%-30s | %-18d | %-18d | %-18f | %-18f", name, addTime, removeTime, addTime / minTime, removeTime / minTime);
}).forEach(System.out::println);
}
private record TimeTestClass<T>(String name, T instance, BiConsumer<T, Integer> addMethod, BiConsumer<T, Integer> removeMethod) {
private void add(int i) {
addMethod.accept(instance, i);
}
private void remove(int i) {
removeMethod.accept(instance, i);
}
}
}