Uses of Interface
org.apache.commons.collections.IterableMap

Packages that use IterableMap

org.apache.commons.collections	This package contains the interfaces and utilities shared across all the subpackages of this component.
org.apache.commons.collections.bidimap	This package contains implementations of the BidiMap, OrderedBidiMap and SortedBidiMap interfaces.
org.apache.commons.collections.map	This package contains implementations of the Map, IterableMap, OrderedMap and SortedMap interfaces.

Uses of IterableMap in org.apache.commons.collections

Subinterfaces of IterableMap in org.apache.commons.collections

interface	BidiMap<K,V> Defines a map that allows bidirectional lookup between key and values.
interface	OrderedBidiMap<K,V> Defines a map that allows bidirectional lookup between key and values and retains and provides access to an ordering.
interface	OrderedMap<K,V> Defines a map that maintains order and allows both forward and backward iteration through that order.
interface	SortedBidiMap<K,V> Defines a map that allows bidirectional lookup between key and values and retains both keys and values in sorted order.

Uses of IterableMap in org.apache.commons.collections.bidimap

Classes in org.apache.commons.collections.bidimap that implement IterableMap

class	AbstractBidiMapDecorator<K,V> Provides a base decorator that enables additional functionality to be added to a BidiMap via decoration.
class	AbstractDualBidiMap<K,V> Abstract BidiMap implemented using two maps.
class	AbstractOrderedBidiMapDecorator<K,V> Provides a base decorator that enables additional functionality to be added to an OrderedBidiMap via decoration.
class	AbstractSortedBidiMapDecorator<K,V> Provides a base decorator that enables additional functionality to be added to a SortedBidiMap via decoration.
class	DualHashBidiMap<K,V> Implementation of BidiMap that uses two HashMap instances.
class	DualTreeBidiMap<K,V> Implementation of BidiMap that uses two TreeMap instances.
class	TreeBidiMap<K extends Comparable,V extends Comparable> Red-Black tree-based implementation of BidiMap where all objects added implement the Comparable interface.
class	UnmodifiableBidiMap<K,V> Decorates another BidiMap to ensure it can't be altered.
class	UnmodifiableOrderedBidiMap<K,V> Decorates another OrderedBidiMap to ensure it can't be altered.
class	UnmodifiableSortedBidiMap<K,V> Decorates another SortedBidiMap to ensure it can't be altered.

Uses of IterableMap in org.apache.commons.collections.map

Classes in org.apache.commons.collections.map that implement IterableMap

class	AbstractHashedMap<K,V> An abstract implementation of a hash-based map which provides numerous points for subclasses to override.
class	AbstractLinkedMap<K,V> An abstract implementation of a hash-based map that links entries to create an ordered map and which provides numerous points for subclasses to override.
class	AbstractOrderedMapDecorator<K,V> Provides a base decorator that enables additional functionality to be added to an OrderedMap via decoration.
class	AbstractReferenceMap<K,V> An abstract implementation of a hash-based map that allows the entries to be removed by the garbage collector.
class	CaseInsensitiveMap<V> A case-insensitive Map.
class	Flat3Map<K,V> A Map implementation that stores data in simple fields until the size is greater than 3.
class	HashedMap<K,V> A Map implementation that is a general purpose alternative to HashMap.
class	IdentityMap<K,V> A Map implementation that matches keys and values based on == not equals().
class	LinkedMap<K,V> A Map implementation that maintains the order of the entries.
class	ListOrderedMap<K,V> Decorates a Map to ensure that the order of addition is retained using a List to maintain order.
class	LRUMap<K,V> A Map implementation with a fixed maximum size which removes the least recently used entry if an entry is added when full.
class	MultiKeyMap<K,V> A Map implementation that uses multiple keys to map the value.
class	ReferenceIdentityMap<K,V> A Map implementation that allows mappings to be removed by the garbage collector and matches keys and values based on == not equals().
class	ReferenceMap<K,V> A Map implementation that allows mappings to be removed by the garbage collector.
class	SingletonMap<K,V> A Map implementation that holds a single item and is fixed size.
class	UnmodifiableMap<K,V> Decorates another Map to ensure it can't be altered.
class	UnmodifiableOrderedMap<K,V> Decorates another OrderedMap to ensure it can't be altered.