Package org.apache.commons.collections4
package org.apache.commons.collections4
This package contains the interfaces and utilities shared across all the subpackages of this component.
The following collection implementations are provided in the package:
- ArrayStack - a non synchronized Stack that follows the same API as
java.util Stack
-
ClassDescriptionArrayStack<E>Deprecated.Operations on arrays, primitive arrays (like
int[]) and primitive wrapper arrays (likeInteger[]).Bag<E>Defines a collection that counts the number of times an object appears in the collection.BidiMap<K,V> Defines a map that allows bidirectional lookup between key and values.Defines a collection that is bounded in size.BoundedMap<K,V> Defines a map that is bounded in size.Closure<T>Defines a functor interface implemented by classes that do something.ClosureUtilsprovides reference implementations and utilities for the Closure functor interface.Provides utility methods and decorators forCollectioninstances.Helper class to easily access cardinality properties of two collections.Wraps another object and uses the provided Equator to implementCollectionUtils.EquatorWrapper.equals(Object)andCollectionUtils.EquatorWrapper.hashCode().Helper class for set-related operations, e.g.Provides convenient static utility methods forComparatorobjects.Provides utility methods forEnumerationinstances.Equator<T>An equation function, which determines equality between objects of type T.Factory<T>Defines a functor interface implemented by classes that create objects.FactoryUtilsprovides reference implementations and utilities for the Factory functor interface.A FluentIterable provides a powerful yet simple API for manipulating Iterable instances in a fluent manner.Runtime exception thrown from functors.Get<K,V> The "read" subset of theMapinterface.IterableGet<K,V> The "read" subset of theMapinterface.IterableMap<K,V> Defines a map that can be iterated directly without needing to create an entry set.IterableSortedMap<K,V> Provides utility methods and decorators forIterableinstances.Inner class to distinguish unmodifiable instances.Provides static utility methods and decorators forIteratorinstances.KeyValue<K,V> Defines a simple key value pair.Provides utility methods and decorators forListinstances.A simple wrapper to use a CharSequence as List.A helper class used to construct the longest common subsequence.Provides a partition view on aList.ListValuedMap<K,V> Defines a map that holds a list of values against each key.MapIterator<K,V> Defines an iterator that operates over aMap.MultiMap<K,V> Deprecated.since 4.1, useMultiValuedMapinsteadProvides utility methods and decorators forMultiValuedMapinstances.MultiSet<E>Defines a collection that counts the number of times an object appears in the collection.An unmodifiable entry for an element and its occurrence as contained in a MultiSet.Provides utility methods and decorators forMultiSetinstances.MultiValuedMap<K,V> Defines a map that holds a collection of values against each key.OrderedBidiMap<K,V> Defines a map that allows bidirectional lookup between key and values and retains and provides access to an ordering.Defines an iterator that operates over an ordered container.OrderedMap<K,V> Defines a map that maintains order and allows both forward and backward iteration through that order.OrderedMapIterator<K,V> Defines an iterator that operates over an orderedMap.Predicate<T>Defines a functor interface implemented by classes that perform a predicate test on an object.PredicateUtilsprovides reference implementations and utilities for the Predicate functor interface.Put<K,V> The "write" subset of theMapinterface.Provides utility methods and decorators forQueueinstances.Defines an iterator that can be reset back to an initial state.Defines a list iterator that can be reset back to an initial state.An unmodifiable view of a set that may be backed by other sets.SetValuedMap<K,V> Defines a map that holds a set of values against each key.SortedBag<E>Defines a type ofBagthat maintains a sorted order among its unique representative members.SortedBidiMap<K,V> Defines a map that allows bidirectional lookup between key and values and retains both keys and values in sorted order.Transformer<I,O> Defines a functor interface implemented by classes that transform one object into another.TransformerUtilsprovides reference implementations and utilities for the Transformer functor interface.Trie<K,V> Defines the interface for a prefix tree, an ordered tree data structure.A collection ofTrieutilities.Marker interface for collections, maps and iterators that are unmodifiable.
ArrayDequeinstead (available from Java 1.6)