# Uses of Package
org.apache.commons.collections4.map

Packages that use org.apache.commons.collections4.map
Package
Description
org.apache.commons.collections4
Interfaces and utilities shared across all packages.
org.apache.commons.collections4.bidimap
Implements the `BidiMap`, `OrderedBidiMap` and `SortedBidiMap` interfaces.
org.apache.commons.collections4.map
Implements the `Map`, `IterableMap`, `OrderedMap` and `SortedMap` interfaces.

- Classes in org.apache.commons.collections4.map used by org.apache.commons.collections4
  Class
  Description
  MultiValueMap
  Deprecated.
  Since 4.1, use `MultiValuedMap` instead
- Classes in org.apache.commons.collections4.map used by org.apache.commons.collections4.bidimap
  Class
  Description
  AbstractIterableMap
  Provide a basic `IterableMap` implementation.
  AbstractMapDecorator
  Provides a base decorator that enables additional functionality to be added to a Map via decoration.
  AbstractSortedMapDecorator
  Provides a base decorator that enables additional functionality to be added to a Map via decoration.
- Classes in org.apache.commons.collections4.map used by org.apache.commons.collections4.map
  Class
  Description
  AbstractHashedMap
  An abstract implementation of a hash-based map which provides numerous points for subclasses to override.
  AbstractHashedMap.HashEntry
  HashEntry used to store the data.
  AbstractHashedMap.HashIterator
  Base Iterator.
  AbstractIterableMap
  Provide a basic `IterableMap` implementation.
  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.
  AbstractLinkedMap.LinkEntry
  LinkEntry that stores the data.
  AbstractLinkedMap.LinkIterator
  Base Iterator that iterates in link order.
  AbstractMapDecorator
  Provides a base decorator that enables additional functionality to be added to a Map via decoration.
  AbstractOrderedMapDecorator
  Provides a base decorator that enables additional functionality to be added to an OrderedMap via decoration.
  AbstractReferenceMap
  An abstract implementation of a hash-based map that allows the entries to be removed by the garbage collector.
  AbstractReferenceMap.ReferenceEntry
  A MapEntry implementation for the map.
  AbstractReferenceMap.ReferenceStrength
  Enumerates reference types.
  AbstractSortedMapDecorator
  Provides a base decorator that enables additional functionality to be added to a Map via decoration.
  CaseInsensitiveMap
  A case-insensitive `Map`.
  CompositeMap
  Decorates a map of other maps to provide a single unified view.
  CompositeMap.MapMutator
  This interface allows definition for all of the indeterminate mutators in a CompositeMap, as well as providing a hook for callbacks on key collisions.
  ConcurrentReferenceHashMap
  An advanced hash map supporting configurable garbage collection semantics of keys and values, optional referential-equality, full concurrency of retrievals, and adjustable expected concurrency for updates.
  ConcurrentReferenceHashMap.Builder
  Builds new ConcurrentReferenceHashMap instances.
  ConcurrentReferenceHashMap.Option
  Enumerates eehavior-changing configuration options for the map.
  ConcurrentReferenceHashMap.ReferenceType
  Enumerates which Java reference type should be used to refer to a key and/or value.
  DefaultedMap
  Decorates another `Map` returning a default value if the map does not contain the requested key.
  EntrySetToMapIteratorAdapter
  Adapts a Map entrySet to the MapIterator interface.
  FixedSizeMap
  Decorates another `Map` to fix the size, preventing add/remove.
  FixedSizeSortedMap
  Decorates another `SortedMap` to fix the size blocking add/remove.
  Flat3Map
  A `Map` implementation that stores data in simple fields until the size is greater than 3.
  HashedMap
  A `Map` implementation that is a general purpose alternative to `HashMap`.
  LazyMap
  Decorates another `Map` to create objects in the map on demand.
  LazySortedMap
  Decorates another `SortedMap` to create objects in the map on demand.
  LinkedMap
  A `Map` implementation that maintains the order of the entries.
  ListOrderedMap
  Decorates a `Map` to ensure that the order of addition is retained using a `List` to maintain order.
  LRUMap
  A `Map` implementation with a fixed maximum size which removes the least recently used entry if an entry is added when full.
  MultiKeyMap
  A `Map` implementation that uses multiple keys to map the value.
  MultiValueMap
  Deprecated.
  Since 4.1, use `MultiValuedMap` instead
  PassiveExpiringMap.ExpirationPolicy
  A policy to determine the expiration time for key-value entries.
  PredicatedMap
  Decorates another `Map` to validate that additions match a specified predicate.
  PredicatedSortedMap
  Decorates another `SortedMap` to validate that additions match a specified predicate.
  SingletonMap
  A `Map` implementation that holds a single item and is fixed size.
  TransformedMap
  Decorates another `Map` to transform objects that are added.
  TransformedSortedMap
  Decorates another `SortedMap` to transform objects that are added.