Reworked cache, this time with less hashmap accesses.
This commit is contained in:
@@ -66,10 +66,10 @@ public class CacheTest {
|
||||
|
||||
Cache<Integer, Integer> largeCache = new Cache<>(amount/2);
|
||||
|
||||
int[] expected = new int[amount];
|
||||
int[] values = new int[amount];
|
||||
for (int i = 0; i < amount; i++) {
|
||||
expected[i] = random.nextInt();
|
||||
largeCache.setValue(i, expected[i]);
|
||||
values[i] = random.nextInt();
|
||||
largeCache.setValue(i, values[i]);
|
||||
}
|
||||
|
||||
for (int i = 0; i < amount /2; i++) {
|
||||
@@ -77,7 +77,7 @@ public class CacheTest {
|
||||
}
|
||||
|
||||
for (int i = amount /2; i < amount; i++) {
|
||||
assertEquals(expected[i], largeCache.getValue(i), "Current accessor: " + i);
|
||||
assertEquals(values[i], largeCache.getValue(i), "Current accessor: " + i);
|
||||
}
|
||||
}
|
||||
|
||||
@@ -88,10 +88,10 @@ public class CacheTest {
|
||||
|
||||
Cache<Integer, Integer> largeCache = new Cache<>(amount/2);
|
||||
|
||||
int[] expected = new int[amount];
|
||||
int[] values = new int[amount];
|
||||
for (int i = 0; i < amount; i++) {
|
||||
expected[i] = random.nextInt();
|
||||
largeCache.setValue(i, expected[i]);
|
||||
values[i] = random.nextInt();
|
||||
largeCache.setValue(i, values[i]);
|
||||
largeCache.getValue(0);
|
||||
}
|
||||
|
||||
@@ -100,9 +100,9 @@ public class CacheTest {
|
||||
}
|
||||
|
||||
for (int i = (amount /2) + 1; i < amount; i++) {
|
||||
assertEquals(expected[i], largeCache.getValue(i), "Current accessor: " + i);
|
||||
assertEquals(values[i], largeCache.getValue(i), "Current accessor: " + i);
|
||||
}
|
||||
|
||||
assertEquals(expected[0], largeCache.getValue(0));
|
||||
assertEquals(values[0], largeCache.getValue(0));
|
||||
}
|
||||
}
|
Reference in New Issue
Block a user