A hashtable-based Map implementation with weak keys. An entry in a WeakHashMap will automatically be removed when its key is no longer in ordinary use. More precisely, the presence of a mapping for a given key will not prevent the key from being discarded by the garbage collector, that is, made finalizable, finalized, and then reclaimed. When a key has been discarded its entry is effectively removed from the map, so this class behaves somewhat differently than other Map implementations.
Both null values and the null key are supported. This class has performance characteristics similar to those of the HashMap class, and has the same efficiency parameters of initial capacity and load factor.
Some Links
http://java.sun.com/j2se/1.4.2/docs/api/java/util/WeakHashMap.html
http://www.onjava.com/pub/a/onjava/2001/07/09/optimization.html
http://www.onjava.com/pub/a/onjava/2001/07/09/optimization.html] http://www.java-tips.org/java-se-tips/java.util/using-weakhashmap-for-listener-lists.html
HTH
K Sathya Narayanan
[ January 08, 2008: Message edited by: K Sathya Narayanan ]
