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

Packages that use IterableMap
Package
Description
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
    Modifier and Type
    Interface
    Description
    interface 
    BidiMap
    Defines a map that allows bidirectional lookup between key and values.
    interface 
    OrderedBidiMap
    Defines a map that allows bidirectional lookup between key and values and retains and provides access to an ordering.
    interface 
    OrderedMap
    Defines a map that maintains order and allows both forward and backward iteration through that order.
    interface 
    SortedBidiMap
    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
    Modifier and Type
    Class
    Description
    class 
    AbstractBidiMapDecorator
    Provides a base decorator that enables additional functionality to be added to a BidiMap via decoration.
    class 
    AbstractDualBidiMap
    Abstract BidiMap implemented using two maps.
    class 
    AbstractOrderedBidiMapDecorator
    Provides a base decorator that enables additional functionality to be added to an OrderedBidiMap via decoration.
    class 
    AbstractSortedBidiMapDecorator
    Provides a base decorator that enables additional functionality to be added to a SortedBidiMap via decoration.
    class 
    DualHashBidiMap
    Implementation of BidiMap that uses two HashMap instances.
    class 
    DualTreeBidiMap
    Implementation of BidiMap that uses two TreeMap instances.
    class 
    TreeBidiMap
    Red-Black tree-based implementation of BidiMap where all objects added implement the Comparable interface.
    final class 
    UnmodifiableBidiMap
    Decorates another BidiMap to ensure it can't be altered.
    final class 
    UnmodifiableOrderedBidiMap
    Decorates another OrderedBidiMap to ensure it can't be altered.
    final class 
    UnmodifiableSortedBidiMap
    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
    Modifier and Type
    Class
    Description
    class 
    AbstractHashedMap
    An abstract implementation of a hash-based map which provides numerous points for subclasses to override.
    class 
    AbstractLinkedMap
    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
    Provides a base decorator that enables additional functionality to be added to an OrderedMap via decoration.
    class 
    AbstractReferenceMap
    An abstract implementation of a hash-based map that allows the entries to be removed by the garbage collector.
    class 
    CaseInsensitiveMap
    A case-insensitive Map.
    class 
    Flat3Map
    A Map implementation that stores data in simple fields until the size is greater than 3.
    class 
    HashedMap
    A Map implementation that is a general purpose alternative to HashMap.
    class 
    IdentityMap
    A Map implementation that matches keys and values based on == not equals().
    class 
    LinkedMap
    A Map implementation that maintains the order of the entries.
    class 
    ListOrderedMap
    Decorates a Map to ensure that the order of addition is retained using a List to maintain order.
    class 
    LRUMap
    A Map implementation with a fixed maximum size which removes the least recently used entry if an entry is added when full.
    class 
    MultiKeyMap
    A Map implementation that uses multiple keys to map the value.
    class 
    ReferenceIdentityMap
    A Map implementation that allows mappings to be removed by the garbage collector and matches keys and values based on == not equals().
    class 
    ReferenceMap
    A Map implementation that allows mappings to be removed by the garbage collector.
    class 
    SingletonMap
    A Map implementation that holds a single item and is fixed size.
    final class 
    UnmodifiableMap
    Decorates another Map to ensure it can't be altered.
    final class 
    UnmodifiableOrderedMap
    Decorates another OrderedMap to ensure it can't be altered.