Skip navigation links 
 
oracle.javatools.util
Class Maps.WeakLinkedHashMap<K,V>
java.lang.Object
   oracle.javatools.util.Maps.AbstractHashMap<K,V,E>
oracle.javatools.util.Maps.AbstractHashMap<K,V,E>
       oracle.javatools.util.Maps.AbstractLinkedHashMap<K,V,Maps.WeakLinkedEntry<K,V>>
oracle.javatools.util.Maps.AbstractLinkedHashMap<K,V,Maps.WeakLinkedEntry<K,V>>
           oracle.javatools.util.Maps.WeakLinkedHashMap<K,V>
oracle.javatools.util.Maps.WeakLinkedHashMap<K,V>
- All Implemented Interfaces:
- java.io.Serializable, java.lang.Cloneable, java.util.Map<K,V>
- Enclosing class:
- Maps
- 
public static class Maps.WeakLinkedHashMap<K,V>
 
- extends Maps.AbstractLinkedHashMap<K,V,Maps.WeakLinkedEntry<K,V>>
An implementation of Maps.AbstractLinkedHashMap, based on Maps.WeakLinkedEntry, which holds its values with WeakReferences.
- See Also:
- LinkedHashMap, Serialized Form
 
 
| Nested classes/interfaces inherited from interface java.util.Map | 
| java.util.Map.Entry<K,V> | 
  
 
 
  
 
| Constructor Summary | 
| Maps.WeakLinkedHashMap()Constructs an empty weak-referencing, insertion-ordered map with default capacity and load factor.
 | 
| Maps.WeakLinkedHashMap(int initialCapacity)Constructs an empty weak-referencing, insertion-ordered map with specified initial capacity and default load factor.
 | 
| Maps.WeakLinkedHashMap(int initialCapacity, float loadFactor)Constructs an empty weak-referencing, insertion-ordered map with specified initial capacity and load factor.
 | 
| Maps.WeakLinkedHashMap(int initialCapacity, float loadFactor, boolean accessOrder)Constructs an empty weak-referencing map with specified initial capacity, load factor, and iteration order.
 | 
| Maps.WeakLinkedHashMap(java.util.Map<? extends K,? extends V> map)Constructs a weak-referencing, insertion-ordered map with specified initial mappings, initial capacity based on the number of initial mappings, and default load factor.
 | 
  
 
 
 
| Methods inherited from class oracle.javatools.util.Maps.AbstractHashMap | 
| addEntry, capacity, change, clone, containsKey, containsValue, entryAccessed, entryAdded, entryChanged, entryPurged, entryRemoved, entrySet, equals, get, getChangeCount, getEntry, getQueue, hashCode, isEmpty, keyEquals, keyHashCode, keySet, loadFactor, mapConstructed, mapInitialized, purge, purgeEntry, put, putAll, remove, removeExistingEntry, removeKey, size, toString, valueEquals, valueHashCode, values | 
 
| Methods inherited from class java.lang.Object | 
| finalize, getClass, notify, notifyAll, wait, wait, wait | 
 
 
Maps.WeakLinkedHashMap
public Maps.WeakLinkedHashMap()
- Constructs an empty weak-referencing, insertion-ordered map with default capacity and load factor.
- See Also:
- Maps.AbstractHashMap.DEFAULT_INITIAL_CAPACITY,- Maps.AbstractHashMap.DEFAULT_LOAD_FACTOR
 
Maps.WeakLinkedHashMap
public Maps.WeakLinkedHashMap(int initialCapacity)
- Constructs an empty weak-referencing, insertion-ordered map with specified initial capacity and default load factor.
- Parameters:
- initialCapacity- the initial capacity.
- Throws:
- java.lang.IllegalArgumentException- if the initial capacity is negative.
- See Also:
- Maps.AbstractHashMap.DEFAULT_LOAD_FACTOR
 
Maps.WeakLinkedHashMap
public Maps.WeakLinkedHashMap(int initialCapacity,
                              float loadFactor)
- Constructs an empty weak-referencing, insertion-ordered map with specified initial capacity and load factor.
- Parameters:
- initialCapacity- the initial capacity.
- loadFactor- the load factor.
- Throws:
- java.lang.IllegalArgumentException- if the initial capacity is negative or the load factor is nonpositive.
 
Maps.WeakLinkedHashMap
public Maps.WeakLinkedHashMap(java.util.Map<? extends K,? extends V> map)
- Constructs a weak-referencing, insertion-ordered map with specified initial mappings, initial capacity based on the number of initial mappings, and default load factor.
- Parameters:
- map- A map providing initial mappings.
- Throws:
- java.lang.NullPointerException- if the specified map is null.
- See Also:
- Maps.AbstractHashMap.DEFAULT_LOAD_FACTOR
 
Maps.WeakLinkedHashMap
public Maps.WeakLinkedHashMap(int initialCapacity,
                              float loadFactor,
                              boolean accessOrder)
- Constructs an empty weak-referencing map with specified initial capacity, load factor, and iteration order.
- Parameters:
- initialCapacity- the initial capacity.
- loadFactor- the load factor.
- accessOrder- true if iteration is access-ordered, false if iteration-ordered.
- Throws:
- java.lang.IllegalArgumentException- if the initial capacity is negative or the load factor is nonpositive.
 
createEntry
protected Maps.WeakLinkedEntry<K,V> createEntry(int hash,
                                                K key,
                                                V value,
                                                Maps.WeakLinkedEntry<K,V> next)
- Creates an entry for this map.
The Maps.WeakLinkedHashMapimplementation createsMaps.WeakLinkedEntryentries.
 
- 
- Specified by:
- createEntryin class- Maps.AbstractHashMap<K,V,Maps.WeakLinkedEntry<K,V>>
 
- 
- Parameters:
- hash- The hashCode of the key for this entry.
- key- The key for this entry.
- value- The value for this entry.
- next- The entry to follow this entry in the entry chain.
 
Skip navigation links 
 
Copyright © 1997, 2015, Oracle. All rights reserved.