Uses of Interface
com.google.common.collect.BiMap

Packages that use BiMap
com.google.common.collect This package contains generic collection interfaces and implementations, and other utilities for working with collections. 
 

Uses of BiMap in com.google.common.collect
 

Classes in com.google.common.collect that implement BiMap
 class EnumBiMap<K extends Enum<K>,V extends Enum<V>>
          A BiMap backed by two EnumMap instances.
 class EnumHashBiMap<K extends Enum<K>,V>
          A BiMap backed by an EnumMap instance for keys-to-values, and a HashMap instance for values-to-keys.
 class HashBiMap<K,V>
          A BiMap backed by two HashMap instances.
 class ImmutableBiMap<K,V>
          An immutable BiMap with reliable user-specified iteration order.
 

Methods in com.google.common.collect that return BiMap
static
<K,V> BiMap<K,V>
MapConstraints.constrainedBiMap(BiMap<K,V> map, MapConstraint<? super K,? super V> constraint)
          Returns a constrained view of the specified bimap, using the specified constraint.
 BiMap<V,K> BiMap.inverse()
          Returns the inverse view of this bimap, which maps each of this bimap's values to its associated key.
static
<K,V> BiMap<K,V>
Maps.synchronizedBiMap(BiMap<K,V> bimap)
          Returns a synchronized (thread-safe) bimap backed by the specified bimap.
static
<K,V> BiMap<K,V>
Maps.unmodifiableBiMap(BiMap<? extends K,? extends V> bimap)
          Returns an unmodifiable view of the specified bimap.
 

Methods in com.google.common.collect with parameters of type BiMap
static
<K,V> BiMap<K,V>
MapConstraints.constrainedBiMap(BiMap<K,V> map, MapConstraint<? super K,? super V> constraint)
          Returns a constrained view of the specified bimap, using the specified constraint.
static
<K,V> BiMap<K,V>
Maps.synchronizedBiMap(BiMap<K,V> bimap)
          Returns a synchronized (thread-safe) bimap backed by the specified bimap.
static
<K,V> BiMap<K,V>
Maps.unmodifiableBiMap(BiMap<? extends K,? extends V> bimap)
          Returns an unmodifiable view of the specified bimap.
 



Copyright © 2010-2011. All Rights Reserved.