public static class Maps.WeakLinkedHashMap<K,V> extends Maps.AbstractLinkedHashMap<K,V,Maps.WeakLinkedEntry<K,V>>
Maps.AbstractLinkedHashMap
, based on Maps.WeakLinkedEntry
, which holds its values with WeakReference
s.LinkedHashMap
,
Serialized FormDEFAULT_INITIAL_CAPACITY, DEFAULT_LOAD_FACTOR, MAXIMUM_CAPACITY
Constructor and Description |
---|
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.
|
Modifier and Type | Method and Description |
---|---|
protected Maps.WeakLinkedEntry<K,V> |
createEntry(int hash,
K key,
V value,
Maps.WeakLinkedEntry<K,V> next)
Creates an entry for this map.
|
clear, createEntryIterator, createEntrySetIterator, createKeySetIterator, createValuesIterator, entryEvicted, evict, evictEntry, getEldestEntry, mapChanged, removeEldestEntry, transfer
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
public Maps.WeakLinkedHashMap()
public Maps.WeakLinkedHashMap(int initialCapacity)
initialCapacity
- the initial capacity.java.lang.IllegalArgumentException
- if the initial capacity is negative.Maps.AbstractHashMap.DEFAULT_LOAD_FACTOR
public Maps.WeakLinkedHashMap(int initialCapacity, float loadFactor)
initialCapacity
- the initial capacity.loadFactor
- the load factor.java.lang.IllegalArgumentException
- if the initial capacity is negative
or the load factor is nonpositive.public Maps.WeakLinkedHashMap(java.util.Map<? extends K,? extends V> map)
map
- A map providing initial mappings.java.lang.NullPointerException
- if the specified map is null.Maps.AbstractHashMap.DEFAULT_LOAD_FACTOR
public Maps.WeakLinkedHashMap(int initialCapacity, float loadFactor, boolean accessOrder)
initialCapacity
- the initial capacity.loadFactor
- the load factor.accessOrder
- true if iteration is access-ordered, false if
iteration-ordered.java.lang.IllegalArgumentException
- if the initial capacity is negative
or the load factor is nonpositive.protected Maps.WeakLinkedEntry<K,V> createEntry(int hash, K key, V value, Maps.WeakLinkedEntry<K,V> next)
Maps.WeakLinkedHashMap
implementation creates Maps.WeakLinkedEntry
entries.createEntry
in class Maps.AbstractHashMap<K,V,Maps.WeakLinkedEntry<K,V>>
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.