/
LRUCacheTest.java
58 lines (43 loc) · 1.41 KB
/
LRUCacheTest.java
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
package com.thealgorithms.datastructures.caches;
import static org.junit.jupiter.api.Assertions.assertEquals;
import static org.junit.jupiter.api.Assertions.assertNull;
import org.junit.jupiter.api.Test;
public class LRUCacheTest {
private static final int SIZE = 5;
@Test
public void putAndGetIntegerValues() {
LRUCache<Integer, Integer> lruCache = new LRUCache<>(SIZE);
for (int i = 0; i < SIZE; i++) {
lruCache.put(i, i);
}
for (int i = 0; i < SIZE; i++) {
assertEquals(i, lruCache.get(i));
}
}
@Test
public void putAndGetStringValues() {
LRUCache<String, String> lruCache = new LRUCache<>(SIZE);
for (int i = 0; i < SIZE; i++) {
lruCache.put("key" + i, "value" + i);
}
for (int i = 0; i < SIZE; i++) {
assertEquals("value" + i, lruCache.get("key" + i));
}
}
@Test
public void nullKeysAndValues() {
LRUCache<Integer, Integer> mruCache = new LRUCache<>(SIZE);
mruCache.put(null, 2);
mruCache.put(6, null);
assertEquals(2, mruCache.get(null));
assertNull(mruCache.get(6));
}
@Test
public void overCapacity() {
LRUCache<Integer, Integer> mruCache = new LRUCache<>(SIZE);
for (int i = 0; i < 10; i++) {
mruCache.put(i, i);
}
assertEquals(9, mruCache.get(9));
}
}