Code example for LinkedHashMap

Methods: remove

0
		} 
	} 
 
	public V remove(Object arg0) {
		V v = forwards.remove(arg0);
		backwards.remove(v);
		return v;
	} 
 
	public int size() { 
		assert forwards.size() == backwards.size();
		return forwards.size();
	} 
 
	public Set<V> values() {
		return backwards.keySet();
	} 
 
	public K removeBackwards(V key) {
		K k = backwards.remove(key);
		forwards.remove(k);