Skip navigation links 
 
oracle.javatools.util
Class Maps.StrongLinkedHashMap<K,V>
java.lang.Object
  
oracle.javatools.util.Maps.AbstractHashMap<K,V,E>
      
oracle.javatools.util.Maps.AbstractLinkedHashMap<K,V,Maps.StrongLinkedEntry<K,V>>
          
oracle.javatools.util.Maps.StrongLinkedHashMap<K,V>
- All Implemented Interfaces:
 
- java.io.Serializable, java.lang.Cloneable, java.util.Map<K,V>
 
- Enclosing class:
 
- Maps
 
- 
public static class Maps.StrongLinkedHashMap<K,V>
 
- extends Maps.AbstractLinkedHashMap<K,V,Maps.StrongLinkedEntry<K,V>>
 
The default implementation of Maps.AbstractLinkedHashMap, based on Maps.StrongLinkedEntry. Maps.StrongLinkedHashMap is a drop-in replacement for LinkedHashMap which additionally exposes the subclass hooks provided by Maps.AbstractHashMap.
- See Also:
 
LinkedHashMap, Serialized Form 
 
 
| Nested classes/interfaces inherited from interface java.util.Map | 
java.util.Map.Entry<K,V> | 
  
 
 
  
 
| Constructor Summary | 
Maps.StrongLinkedHashMap() 
          Constructs an empty insertion-ordered map with default capacity and load factor. | 
Maps.StrongLinkedHashMap(int initialCapacity) 
          Constructs an empty insertion-ordered map with specified initial capacity and default load factor. | 
Maps.StrongLinkedHashMap(int initialCapacity, float loadFactor) 
          Constructs an empty insertion-ordered map with specified initial capacity and load factor. | 
Maps.StrongLinkedHashMap(int initialCapacity, float loadFactor, boolean accessOrder) 
          Constructs an empty map with specified initial capacity, load factor, and iteration order. | 
Maps.StrongLinkedHashMap(java.util.Map<? extends K,? extends V> map) 
          Constructs an 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.StrongLinkedHashMap
public Maps.StrongLinkedHashMap()
- Constructs an empty insertion-ordered map with default capacity and load factor.
- See Also:
 
Maps.AbstractHashMap.DEFAULT_INITIAL_CAPACITY, Maps.AbstractHashMap.DEFAULT_LOAD_FACTOR 
 
Maps.StrongLinkedHashMap
public Maps.StrongLinkedHashMap(int initialCapacity)
- Constructs an empty 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.StrongLinkedHashMap
public Maps.StrongLinkedHashMap(int initialCapacity,
                                float loadFactor)
- Constructs an empty 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.StrongLinkedHashMap
public Maps.StrongLinkedHashMap(java.util.Map<? extends K,? extends V> map)
- Constructs an 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.StrongLinkedHashMap
public Maps.StrongLinkedHashMap(int initialCapacity,
                                float loadFactor,
                                boolean accessOrder)
- Constructs an empty 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 insertion-ordered. 
- Throws:
 
java.lang.IllegalArgumentException - if the initial capacity is negative or the load factor is nonpositive. 
 
createEntry
protected Maps.StrongLinkedEntry<K,V> createEntry(int hash,
                                                  K key,
                                                  V value,
                                                  Maps.StrongLinkedEntry<K,V> next)
- Creates an entry for this map.
The Maps.StrongLinkedHashMap implementation creates Maps.StrongLinkedEntry entries.
 
- 
- Specified by:
 
createEntry in class Maps.AbstractHashMap<K,V,Maps.StrongLinkedEntry<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, 2014, Oracle. All rights reserved.