@@ -92,7 +92,7 @@ public AbstractLRUMap()
92
92
/**
93
93
* This removes all the items. It clears the map and the double linked list.
94
94
* <p>
95
- * @see java.util. Map#clear()
95
+ * @see Map#clear()
96
96
*/
97
97
@ Override
98
98
public void clear ()
@@ -112,7 +112,7 @@ public void clear()
112
112
/**
113
113
* Returns true if the map contains an element for the supplied key.
114
114
* <p>
115
- * @see java.util. Map#containsKey(Object)
115
+ * @see Map#containsKey(Object)
116
116
*/
117
117
@ Override
118
118
public boolean containsKey ( final Object key )
@@ -123,7 +123,7 @@ public boolean containsKey( final Object key )
123
123
/**
124
124
* This is an expensive operation that determines if the object supplied is mapped to any key.
125
125
* <p>
126
- * @see java.util. Map#containsValue(Object)
126
+ * @see Map#containsValue(Object)
127
127
*/
128
128
@ Override
129
129
public boolean containsValue ( final Object value )
@@ -167,7 +167,7 @@ public void dumpMap()
167
167
* TODO we should return out own set wrapper, so we can avoid the extra object creation if it
168
168
* isn't necessary.
169
169
* <p>
170
- * @see java.util. Map#entrySet()
170
+ * @see Map#entrySet()
171
171
*/
172
172
@ Override
173
173
public Set <Map .Entry <K , V >> entrySet ()
@@ -278,7 +278,7 @@ public IStats getStatistics()
278
278
/**
279
279
* Returns true if the map is empty.
280
280
* <p>
281
- * @see java.util. Map#isEmpty()
281
+ * @see Map#isEmpty()
282
282
*/
283
283
@ Override
284
284
public boolean isEmpty ()
@@ -435,7 +435,7 @@ public V remove( final Object key )
435
435
/**
436
436
* This simply returns the number of elements in the map.
437
437
* <p>
438
- * @see java.util. Map#size()
438
+ * @see Map#size()
439
439
*/
440
440
@ Override
441
441
public int size ()
0 commit comments