/* * JBoss, Home of Professional Open Source * Copyright 2011, Red Hat and individual contributors * by the @authors tag. * * This is free software; you can redistribute it and/or modify it * under the terms of the GNU Lesser General Public License as * published by the Free Software Foundation; either version 2.1 of * the License, or (at your option) any later version. * * This software is distributed in the hope that it will be useful, * but WITHOUT ANY WARRANTY; without even the implied warranty of * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU * Lesser General Public License for more details. * * You should have received a copy of the GNU Lesser General Public * License along with this software; if not, write to the Free * Software Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA * 02110-1301 USA, or see the FSF site: http://www.fsf.org. * * @authors Andrew Dinn */ package test; import java.util.Collection; import java.util.HashMap; import java.util.Map; import java.util.Set; /** */ public class TestMap<K, V> implements Map<K, V> { HashMap<K, V> delegate; public TestMap() { delegate = new HashMap<K, V>(); } public int size() { return delegate.size(); } public boolean isEmpty() { return delegate.isEmpty(); } public boolean containsKey(Object key) { return delegate.containsKey(key); } public boolean containsValue(Object value) { return delegate.containsValue(value); } public V get(Object key) { return delegate.get(key); } public V put(K key, V value) { //System.out.println("call to TestMap2.put(" + key + ", " + value + ")"); return delegate.put(key, value); } public V remove(Object key) { return delegate.remove(key); } public void putAll(Map<? extends K, ? extends V> m) { delegate.putAll(m); } public void clear() { delegate.clear(); } public Set<K> keySet() { return delegate.keySet(); } public Collection<V> values() { return delegate.values(); } public Set<Entry<K,V>> entrySet() { return delegate.entrySet(); } }