Code example for LinkedHashMap

Methods: remove

0
	public synchronized final V remove(K key) {
		if (key == null) {
			throw new NullPointerException("key == null");
		} 
 
		V previous = map.remove(key);
		if (previous != null) {
			size -= safeSizeOf(key, previous);
		} 
		 
		entryRemoved(key, previous);
		return previous;
	} 
 
	/** 
	 * Called for entries that have reached the tail of the least recently used 
	 * queue and are be removed. The default implementation does nothing. 
	 */ 
	protected void entryEvicted(K key, V value) {
	}