public class DualLinkedHashBidiMap<K,V> extends AbstractDualBidiMap<K ,V> implements Serializable
BidiMap that uses two
LinkedHashMap instances.
Two LinkedHashMap instances are used in this class. This provides fast lookups at the expense of storing two sets of map entries and two linked lists.
AbstractDualBidiMap.BidiMapIterator <K,V>, AbstractDualBidiMap.EntrySet <K,V>, AbstractDualBidiMap.EntrySetIterator <K,V>, AbstractDualBidiMap.KeySet <K>, AbstractDualBidiMap.KeySetIterator <K>, AbstractDualBidiMap.MapEntry <K,V>, AbstractDualBidiMap.Values <V>, AbstractDualBidiMap.ValuesIterator <V>, AbstractDualBidiMap.View <K,V,E> | Modifier | Constructor and Description |
|---|---|
|
DualLinkedHashBidiMap()
Creates an empty
HashBidiMap.
|
|
DualLinkedHashBidiMap(Map
Constructs a
LinkedHashBidiMap and copies the mappings from specified
Map.
|
protected |
DualLinkedHashBidiMap(Map
Constructs a
LinkedHashBidiMap that decorates the specified maps.
|
| Modifier and Type | Method and Description |
|---|---|
protected BidiMap |
createBidiMap(Map
Creates a new instance of this object.
|
clear, containsKey, containsValue, createEntrySetIterator, createKeySetIterator, createValuesIterator, entrySet, equals, get, getKey, hashCode, inverseBidiMap, isEmpty, keySet, mapIterator, put, putAll, remove, removeValue, size, toString, valuesclone, finalize, getClass, notify, notifyAll, wait, wait, waitcompute, computeIfAbsent, computeIfPresent, forEach, getOrDefault, merge, putIfAbsent, remove, replace, replace, replaceAllpublic DualLinkedHashBidiMap()
HashBidiMap.
public DualLinkedHashBidiMap(Map<? extends K ,? extends V> map)
LinkedHashBidiMap and copies the mappings from specified
Map.
map - the map whose mappings are to be placed in this map
protected DualLinkedHashBidiMap(Map<K ,V> normalMap, Map <V ,K> reverseMap, BidiMap <V ,K> inverseBidiMap)
LinkedHashBidiMap that decorates the specified maps.
normalMap - the normal direction map
reverseMap - the reverse direction map
inverseBidiMap - the inverse BidiMap
protected BidiMap<V ,K> createBidiMap(Map <V ,K> normalMap, Map <K ,V> reverseMap, BidiMap <K ,V> inverseBidiMap)
createBidiMap in class
AbstractDualBidiMap<K,V>
normalMap - the normal direction map
reverseMap - the reverse direction map
inverseBidiMap - the inverse BidiMap