Code example for LinkedHashMap

Methods: size

0
		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);
		return k;
	} 
 
	public BiMap<V, K> getBackwardsMap() { 
		BiMap<V, K> r = new BiMap<V, K>(forwards, backwards);