org.boon.collections

Class ConcurrentWeakHashMap<K,V>

java.lang.Object

java.util.AbstractMap<K,V>

org.boon.collections.ConcurrentWeakHashMap<K,V>

Type Parameters:

K - key

V - value

All Implemented Interfaces:

java.util.concurrent.ConcurrentMap<K,V>, java.util.Map<K,V>

public class ConcurrentWeakHashMap<K,V>
extends java.util.AbstractMap<K,V>
implements java.util.concurrent.ConcurrentMap<K,V>

I got a lot of ideas from concurrent java books. and looking at open source implementations of this This is written from scratch. It was heavily influenced by IntelliJ's ConcurrentWeakHashMap open source project. Theirs is better. Mine is good enough for boon's needs.

Nested Class Summary

Nested classes/interfaces inherited from class java.util.AbstractMap

java.util.AbstractMap.SimpleEntry<K,V>, java.util.AbstractMap.SimpleImmutableEntry<K,V>

Nested classes/interfaces inherited from interface java.util.Map

java.util.Map.Entry<K,V>

Constructor Summary

Constructors

Constructor and Description
ConcurrentWeakHashMap()
ConcurrentWeakHashMap(int initialCapacity)
ConcurrentWeakHashMap(int initialCapacity, float loadFactor)
ConcurrentWeakHashMap(int initialCapacity, float loadFactor, int concurrencyLevel)

Method Summary

Methods

Modifier and Type	Method and Description
void	clear()
boolean	containsKey(java.lang.Object key)
boolean	containsValue(java.lang.Object value)
java.util.Set<java.util.Map.Entry<K,V>>	entrySet()
V	get(java.lang.Object key)
boolean	isEmpty()
V	put(K key, V value)
void	putAll(java.util.Map<? extends K,? extends V> map)
V	putIfAbsent(K key, V value)
V	remove(java.lang.Object key)
boolean	remove(java.lang.Object key, java.lang.Object value)
V	replace(K key, V value)
boolean	replace(K key, V oldValue, V newValue)
int	size()
java.util.Collection<V>	values()

Methods inherited from class java.util.AbstractMap

clone, equals, hashCode, keySet, toString

Methods inherited from class java.lang.Object

finalize, getClass, notify, notifyAll, wait, wait, wait

Methods inherited from interface java.util.Map

equals, hashCode, keySet

Constructor Detail

ConcurrentWeakHashMap

public ConcurrentWeakHashMap(int initialCapacity,
                     float loadFactor,
                     int concurrencyLevel)

ConcurrentWeakHashMap

public ConcurrentWeakHashMap(int initialCapacity,
                     float loadFactor)

ConcurrentWeakHashMap

public ConcurrentWeakHashMap(int initialCapacity)

ConcurrentWeakHashMap

public ConcurrentWeakHashMap()

Method Detail

get

public V get(java.lang.Object key)

Specified by:

get in interface java.util.Map<K,V>

Overrides:

get in class java.util.AbstractMap<K,V>

put

public V put(K key,
    V value)

Specified by:

put in interface java.util.Map<K,V>

Overrides:

put in class java.util.AbstractMap<K,V>

remove

public V remove(java.lang.Object key)

Specified by:

remove in interface java.util.Map<K,V>

Overrides:

remove in class java.util.AbstractMap<K,V>

putAll

public void putAll(java.util.Map<? extends K,? extends V> map)

Specified by:

putAll in interface java.util.Map<K,V>

Overrides:

putAll in class java.util.AbstractMap<K,V>

size

public int size()

Specified by:

size in interface java.util.Map<K,V>

Overrides:

size in class java.util.AbstractMap<K,V>

clear

public void clear()

Specified by:

clear in interface java.util.Map<K,V>

Overrides:

clear in class java.util.AbstractMap<K,V>

values

public java.util.Collection<V> values()

Specified by:

values in interface java.util.Map<K,V>

Overrides:

values in class java.util.AbstractMap<K,V>

isEmpty

public boolean isEmpty()

Specified by:

isEmpty in interface java.util.Map<K,V>

Overrides:

isEmpty in class java.util.AbstractMap<K,V>

containsKey

public boolean containsKey(java.lang.Object key)

Specified by:

containsKey in interface java.util.Map<K,V>

Overrides:

containsKey in class java.util.AbstractMap<K,V>

containsValue

public boolean containsValue(java.lang.Object value)

Specified by:

containsValue in interface java.util.Map<K,V>

Overrides:

containsValue in class java.util.AbstractMap<K,V>

entrySet

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

Specified by:

entrySet in interface java.util.Map<K,V>

Specified by:

entrySet in class java.util.AbstractMap<K,V>

putIfAbsent

public V putIfAbsent(K key,
            V value)

Specified by:

putIfAbsent in interface java.util.concurrent.ConcurrentMap<K,V>

remove

public boolean remove(java.lang.Object key,
             java.lang.Object value)

Specified by:

remove in interface java.util.concurrent.ConcurrentMap<K,V>

replace

public boolean replace(K key,
              V oldValue,
              V newValue)

Specified by:

replace in interface java.util.concurrent.ConcurrentMap<K,V>

replace

public V replace(K key,
        V value)

Specified by:

replace in interface java.util.concurrent.ConcurrentMap<K,V>