Class AbstractDualBidiMap<K,V>
- java.lang.Object
 - 
- org.apache.commons.collections4.bidimap.AbstractDualBidiMap<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.util.Map<K,V>,BidiMap<K,V>,Get<K,V>,IterableGet<K,V>,IterableMap<K,V>,Put<K,V>
- Direct Known Subclasses:
 DualHashBidiMap,DualLinkedHashBidiMap,DualTreeBidiMap
public abstract class AbstractDualBidiMap<K,V> extends java.lang.Object implements BidiMap<K,V>
AbstractBidiMapimplemented using two maps.An implementation can be written simply by implementing the
createBidiMap(Map, Map, BidiMap)method.- Since:
 - 3.0
 - See Also:
 DualHashBidiMap,DualTreeBidiMap
 
- 
- 
Method Summary
All Methods Instance Methods Concrete Methods Modifier and Type Method Description voidclear()booleancontainsKey(java.lang.Object key)booleancontainsValue(java.lang.Object value)java.util.Set<java.util.Map.Entry<K,V>>entrySet()Gets an entrySet view of the map.booleanequals(java.lang.Object obj)Vget(java.lang.Object key)KgetKey(java.lang.Object value)Gets the key that is currently mapped to the specified value.inthashCode()BidiMap<V,K>inverseBidiMap()Gets a view of this map where the keys and values are reversed.booleanisEmpty()java.util.Set<K>keySet()Gets a keySet view of the map.MapIterator<K,V>mapIterator()Obtains aMapIteratorover the map.Vput(K key, V value)Puts the key-value pair into the map, replacing any previous pair.voidputAll(java.util.Map<? extends K,? extends V> map)Vremove(java.lang.Object key)KremoveValue(java.lang.Object value)Removes the key-value pair that is currently mapped to the specified value (optional operation).intsize()java.lang.StringtoString()java.util.Set<V>values()Gets a values view of the map. 
 - 
 
- 
- 
Method Detail
- 
get
public V get(java.lang.Object key)
 
- 
size
public int size()
 
- 
isEmpty
public boolean isEmpty()
 
- 
containsKey
public boolean containsKey(java.lang.Object key)
 
- 
equals
public boolean equals(java.lang.Object obj)
 
- 
hashCode
public int hashCode()
 
- 
toString
public java.lang.String toString()
- Overrides:
 toStringin classjava.lang.Object
 
- 
put
public V put(K key, V value)
Description copied from interface:BidiMapPuts the key-value pair into the map, replacing any previous pair.When adding a key-value pair, the value may already exist in the map against a different key. That mapping is removed, to ensure that the value only occurs once in the inverse map.
BidiMap map1 = new DualHashBidiMap(); map.put("A","B"); // contains A mapped to B, as per Map map.put("A","C"); // contains A mapped to C, as per Map BidiMap map2 = new DualHashBidiMap(); map.put("A","B"); // contains A mapped to B, as per Map map.put("C","B"); // contains C mapped to B, key A is removed 
- 
remove
public V remove(java.lang.Object key)
 
- 
clear
public void clear()
 
- 
containsValue
public boolean containsValue(java.lang.Object value)
 
- 
mapIterator
public MapIterator<K,V> mapIterator()
Obtains aMapIteratorover the map. The iterator implementsResetableMapIterator. This implementation relies on the entrySet iterator.The setValue() methods only allow a new value to be set. If the value being set is already in the map, an IllegalArgumentException is thrown (as setValue cannot change the size of the map).
- Specified by:
 mapIteratorin interfaceIterableGet<K,V>- Returns:
 - a map iterator
 
 
- 
getKey
public K getKey(java.lang.Object value)
Description copied from interface:BidiMapGets the key that is currently mapped to the specified value.If the value is not contained in the map,
nullis returned.Implementations should seek to make this method perform equally as well as
get(Object). 
- 
removeValue
public K removeValue(java.lang.Object value)
Description copied from interface:BidiMapRemoves the key-value pair that is currently mapped to the specified value (optional operation).If the value is not contained in the map,
nullis returned.Implementations should seek to make this method perform equally as well as
remove(Object).- Specified by:
 removeValuein interfaceBidiMap<K,V>- Parameters:
 value- the value to find the key-value pair for- Returns:
 - the key that was removed, 
nullif nothing removed 
 
- 
inverseBidiMap
public BidiMap<V,K> inverseBidiMap()
Description copied from interface:BidiMapGets a view of this map where the keys and values are reversed.Changes to one map will be visible in the other and vice versa. This enables both directions of the map to be accessed as a
Map.Implementations should seek to avoid creating a new object every time this method is called. See
AbstractMap.values()etc. Calling this method on the inverse map should return the original.- Specified by:
 inverseBidiMapin interfaceBidiMap<K,V>- Returns:
 - an inverted bidirectional map
 
 
- 
keySet
public java.util.Set<K> keySet()
Gets a keySet view of the map. Changes made on the view are reflected in the map. The set supports remove and clear but not add. 
- 
values
public java.util.Set<V> values()
Gets a values view of the map. Changes made on the view are reflected in the map. The set supports remove and clear but not add. 
- 
entrySet
public java.util.Set<java.util.Map.Entry<K,V>> entrySet()
Gets an entrySet view of the map. Changes made on the set are reflected in the map. The set supports remove and clear but not add.The Map Entry setValue() method only allow a new value to be set. If the value being set is already in the map, an IllegalArgumentException is thrown (as setValue cannot change the size of the map).
 
 - 
 
 -