java.util

Class WeakHashMap<K,V>

public class WeakHashMap<K,V> extends AbstractMap<K,V> implements Map<K,V>

Constructor Summary
WeakHashMap(int initialCapacity, float loadFactor)
WeakHashMap(int initialCapacity)
WeakHashMap()
<K1 extends K,V1 extends V>WeakHashMap(Map<K1,V1> t)
Method Summary
voidclear()
booleancontainsKey(Object key)
booleancontainsValue(Object value)
Set<Map.Entry<K,V>>entrySet()
Vget(K key)
booleanisEmpty()
Set<K>keySet()
Vput(K key, V value)
<K1 extends K,V1 extends V> voidputAll(Map<K1,V1> m)
Vremove(Object key)
intsize()
Collection<V>values()

Constructor Detail

WeakHashMap

public WeakHashMap(int initialCapacity, float loadFactor)

WeakHashMap

public WeakHashMap(int initialCapacity)

WeakHashMap

public WeakHashMap()

WeakHashMap

public <K1 extends K,V1 extends V> WeakHashMap(Map<K1,V1> t)

Method Detail

clear

public void clear()

containsKey

public boolean containsKey(Object key)

containsValue

public boolean containsValue(Object value)

entrySet

public Set<Map.Entry<K,V>> entrySet()

get

public V get(K key)

isEmpty

public boolean isEmpty()

keySet

public Set<K> keySet()

put

public V put(K key, V value)

putAll

public <K1 extends K,V1 extends V> void putAll(Map<K1,V1> m)

remove

public V remove(Object key)

size

public int size()

values

public Collection<V> values()