public class DualLinkedHashBidiMap<K,V> extends AbstractDualBidiMap<K,V> implements java.io.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.
Constructor and Description |
---|
DualLinkedHashBidiMap()
Creates an empty
HashBidiMap . |
DualLinkedHashBidiMap(java.util.Map<? extends K,? extends V> map)
Constructs a
LinkedHashBidiMap and copies the mappings from
specified Map . |
clear, containsKey, containsValue, entrySet, equals, get, getKey, hashCode, inverseBidiMap, isEmpty, keySet, mapIterator, put, putAll, remove, removeValue, size, toString, values
"Copyright © 2010 - 2020 Adobe Systems Incorporated. All Rights Reserved"