Uses of Class
org.apache.commons.collections4.map.AbstractHashedMap.HashEntry
Package
Description
-
Uses of AbstractHashedMap.HashEntry in org.apache.commons.collections4.map
Modifier and TypeClassDescriptionprotected static class
LinkEntry that stores the data.protected static class
A MapEntry implementation for the map.Modifier and TypeFieldDescriptionprotected AbstractHashedMap.HashEntry<K,
V> AbstractHashedMap.HashEntry.next
The next entry in the hash chainModifier and TypeMethodDescriptionprotected AbstractHashedMap.HashEntry<K,
V> AbstractHashedMap.createEntry
(AbstractHashedMap.HashEntry<K, V> next, int hashCode, K key, V value) Creates an entry to store the key-value data.protected AbstractHashedMap.HashEntry<K,
V> AbstractHashedMap.HashIterator.currentEntry()
protected AbstractHashedMap.HashEntry<K,
V> AbstractHashedMap.entryNext
(AbstractHashedMap.HashEntry<K, V> entry) Gets thenext
field from aHashEntry
.protected AbstractHashedMap.HashEntry<K,
V> Gets the entry mapped to the key specified.protected AbstractHashedMap.HashEntry<K,
V> Gets the entry mapped to the key specified.protected AbstractHashedMap.HashEntry<K,
V> AbstractHashedMap.HashIterator.nextEntry()
Modifier and TypeMethodDescriptionprotected void
AbstractHashedMap.addEntry
(AbstractHashedMap.HashEntry<K, V> entry, int hashIndex) Adds an entry into this map.protected void
AbstractLinkedMap.addEntry
(AbstractHashedMap.HashEntry<K, V> entry, int hashIndex) Adds an entry into this map, maintaining insertion order.protected AbstractHashedMap.HashEntry<K,
V> AbstractHashedMap.createEntry
(AbstractHashedMap.HashEntry<K, V> next, int hashCode, K key, V value) Creates an entry to store the key-value data.protected AbstractLinkedMap.LinkEntry<K,
V> AbstractLinkedMap.createEntry
(AbstractHashedMap.HashEntry<K, V> next, int hashCode, K key, V value) Creates an entry to store the data.protected AbstractReferenceMap.ReferenceEntry<K,
V> AbstractReferenceMap.createEntry
(AbstractHashedMap.HashEntry<K, V> next, int hashCode, K key, V value) Creates a ReferenceEntry instead of a HashEntry.protected void
AbstractHashedMap.destroyEntry
(AbstractHashedMap.HashEntry<K, V> entry) Kills an entry ready for the garbage collector.protected int
AbstractHashedMap.entryHashCode
(AbstractHashedMap.HashEntry<K, V> entry) Gets thehashCode
field from aHashEntry
.protected K
AbstractHashedMap.entryKey
(AbstractHashedMap.HashEntry<K, V> entry) Gets thekey
field from aHashEntry
.protected AbstractHashedMap.HashEntry<K,
V> AbstractHashedMap.entryNext
(AbstractHashedMap.HashEntry<K, V> entry) Gets thenext
field from aHashEntry
.protected V
AbstractHashedMap.entryValue
(AbstractHashedMap.HashEntry<K, V> entry) Gets thevalue
field from aHashEntry
.protected boolean
MultiKeyMap.isEqualKey
(AbstractHashedMap.HashEntry<MultiKey<? extends K>, V> entry, Object key1, Object key2) Is the key equal to the combined key.protected boolean
MultiKeyMap.isEqualKey
(AbstractHashedMap.HashEntry<MultiKey<? extends K>, V> entry, Object key1, Object key2, Object key3) Is the key equal to the combined key.protected boolean
MultiKeyMap.isEqualKey
(AbstractHashedMap.HashEntry<MultiKey<? extends K>, V> entry, Object key1, Object key2, Object key3, Object key4) Is the key equal to the combined key.protected boolean
MultiKeyMap.isEqualKey
(AbstractHashedMap.HashEntry<MultiKey<? extends K>, V> entry, Object key1, Object key2, Object key3, Object key4, Object key5) Is the key equal to the combined key.protected void
AbstractHashedMap.removeEntry
(AbstractHashedMap.HashEntry<K, V> entry, int hashIndex, AbstractHashedMap.HashEntry<K, V> previous) Removes an entry from the chain stored in a particular index.protected void
AbstractLinkedMap.removeEntry
(AbstractHashedMap.HashEntry<K, V> entry, int hashIndex, AbstractHashedMap.HashEntry<K, V> previous) Removes an entry from the map and the linked list.protected void
AbstractHashedMap.removeMapping
(AbstractHashedMap.HashEntry<K, V> entry, int hashIndex, AbstractHashedMap.HashEntry<K, V> previous) Removes a mapping from the map.protected void
AbstractHashedMap.reuseEntry
(AbstractHashedMap.HashEntry<K, V> entry, int hashIndex, int hashCode, K key, V value) Reuses an existing key-value mapping, storing completely new data.protected void
AbstractHashedMap.updateEntry
(AbstractHashedMap.HashEntry<K, V> entry, V newValue) Updates an existing key-value mapping to change the value.protected void
LRUMap.updateEntry
(AbstractHashedMap.HashEntry<K, V> entry, V newValue) Updates an existing key-value mapping.ModifierConstructorDescriptionprotected
protected
Constructs a new entry.ReferenceEntry
(AbstractReferenceMap<K, V> parent, AbstractHashedMap.HashEntry<K, V> next, int hashCode, K key, V value) Creates a new entry object for the ReferenceMap.