Code example for LinkedHashMap

Methods: isEmpty

0
	public K getBackwards(V arg0) {
		return backwards.get(arg0);
	} 
 
	public boolean isEmpty() { 
		return forwards.isEmpty();
	} 
 
	public Set<K> keySet() {
		return forwards.keySet();
	} 
 
	public V put(K arg0, V arg1) {
		V r = forwards.put(arg0, arg1);
		backwards.remove(r);
		backwards.put(arg1, arg0);
		return r;
	} 
 
	public void putAll(Map< ? extends K, ? extends V> arg0) {
		for (Map.Entry e : arg0.entrySet()) {