Class DualLinkedHashBidiMap<K,V>
- java.lang.Object
-
- org.apache.commons.collections4.bidimap.AbstractDualBidiMap<K,V>
-
- org.apache.commons.collections4.bidimap.DualLinkedHashBidiMap<K,V>
-
- Type Parameters:
K
- the type of the keys in the mapV
- the type of the values in the map
- All Implemented Interfaces:
java.io.Serializable
,java.util.Map<K,V>
,BidiMap<K,V>
,Get<K,V>
,IterableGet<K,V>
,IterableMap<K,V>
,Put<K,V>
public class DualLinkedHashBidiMap<K,V> extends AbstractDualBidiMap<K,V> implements java.io.Serializable
Implementation ofBidiMap
that uses twoLinkedHashMap
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.- Since:
- 4.0
- See Also:
- Serialized Form
-
-
Constructor Summary
Constructors Constructor Description DualLinkedHashBidiMap()
Creates an emptyHashBidiMap
.DualLinkedHashBidiMap(java.util.Map<? extends K,? extends V> map)
Constructs aLinkedHashBidiMap
and copies the mappings from specifiedMap
.
-
Method Summary
-
Methods inherited from class org.apache.commons.collections4.bidimap.AbstractDualBidiMap
clear, containsKey, containsValue, entrySet, equals, get, getKey, hashCode, inverseBidiMap, isEmpty, keySet, mapIterator, put, putAll, remove, removeValue, size, toString, values
-
-