1 |
|
|
2 |
|
|
3 |
|
|
4 |
|
|
5 |
|
|
6 |
|
|
7 |
|
|
8 |
|
|
9 |
|
|
10 |
|
|
11 |
|
|
12 |
|
|
13 |
|
|
14 |
|
|
15 |
|
|
16 |
|
package org.kuali.student.common.util; |
17 |
|
|
18 |
|
import junit.framework.Assert; |
19 |
|
|
20 |
|
import org.junit.Before; |
21 |
|
import org.junit.Test; |
22 |
|
|
|
|
| 100% |
Uncovered Elements: 0 (16) |
Complexity: 4 |
Complexity Density: 0.36 |
|
23 |
|
public class TestLRUMap { |
24 |
|
|
25 |
|
private LRUMap<String,String> cache; |
26 |
|
|
|
|
| 100% |
Uncovered Elements: 0 (4) |
Complexity: 1 |
Complexity Density: 0.25 |
|
27 |
2
|
@Before... |
28 |
|
public void setup() { |
29 |
2
|
cache = new LRUMap<String,String>(3); |
30 |
2
|
cache.put("key-1", "value-1"); |
31 |
2
|
cache.put("key-2", "value-2"); |
32 |
2
|
cache.put("key-3", "value-3"); |
33 |
|
} |
34 |
|
|
|
|
| 100% |
Uncovered Elements: 0 (6) |
Complexity: 2 |
Complexity Density: 0.5 |
1
PASS
|
|
35 |
1
|
@Test... |
36 |
|
public void testDefaultMaximumEntries() throws Exception { |
37 |
1
|
cache = new LRUMap<String,String>(); |
38 |
61
|
for(int i=0; i<60; i++) { |
39 |
60
|
cache.put("key-"+i, "value-"+i); |
40 |
|
} |
41 |
1
|
Assert.assertEquals(50, cache.size()); |
42 |
|
} |
43 |
|
|
|
|
| 100% |
Uncovered Elements: 0 (3) |
Complexity: 1 |
Complexity Density: 0.33 |
1
PASS
|
|
44 |
1
|
@Test... |
45 |
|
public void testRemoveEldestEntry() throws Exception { |
46 |
1
|
cache.put("key-4", "value-4"); |
47 |
1
|
Assert.assertEquals(3, cache.size()); |
48 |
1
|
Assert.assertNull(cache.get("key-1")); |
49 |
|
} |
50 |
|
|
51 |
|
} |