Package net.sf.kdgcommons.collections

Utilities for working with arrays and the JDK collections framework.

See: Description

Interface Summary

Interface	Description
BinarySearch.Accessor<T>	Implement this interface if you're searching an already-sorted array-like structure.
BinarySearch.IndexedComparator<T>	Implement this interface if you have an int[] that contains sorted indexes into the array-like structure.
CollectionUtil.IndexValueMapFunctor<V,R>	A functor interface for CollectionUtil.map(java.util.Collection<V>, net.sf.kdgcommons.collections.CollectionUtil.IndexValueMapFunctor<V, R>).
CollectionUtil.IndexValueReduceFunctor<V,R>	A functor used for the CollectionUtil.reduce(java.util.Collection<V>, net.sf.kdgcommons.collections.CollectionUtil.IndexValueReduceFunctor<V, R>) operation.
CollectionUtil.Predicate<V>	Implement this for the CollectionUtil.filter(java.util.Collection<V>, net.sf.kdgcommons.collections.CollectionUtil.Predicate<V>) operation: return true to include an element in the result, false to skip it.
DefaultMap.ValueFactory<T>	This interface defines a factory for default values.
InplaceSort.Accessor	The sort uses an implementation of this interface to access an array-like structure.
InplaceSort.IntComparator	Implementations of this class compare two primitive ints, returning the same values as java.util.Comparator.

Class Summary

Class	Description
BinarySearch	A collection of static methods for searching array-like data structures: those that can be accessed using an integer index.
CollectionUtil	Static utility methods for working with collections -- particularly parameterized collections.
CombiningIterable<T>	Produces an iterator that will iterate over an array of Iterables.
CombiningIterable.CombiningIterator<E>	Combines a list of iterators into a single iterator.
CompoundKey	An N-tuple that provides equals() and hashCode(), used to hold a multi-element key for HashMaps.
DefaultMap<K,V>	A Map decorator that will return a default value from DefaultMap.get(java.lang.Object) if there is no mapping for the key.
DefaultMap.StaticValueFactory<T>	An implementation of the DefaultMap.ValueFactory interface for static values.
EnumerationIterable<T>	Wrapper for an Enumeration that allows it to be used in for-each loops.
HashMultimap<K,V>	A map that can have multiple values, and which uses hashed lookups for its keys.
IdentityKey	A wrapper for a hashed key that uses identity semantics, because sometimes you want to use a Set.
InplaceSort	A collection of static sort routines for random-access data structures that provide the following characteristics: O(NlogN) performance In-place operation; unlike the JDK's list/array sort, does not consume additional heap memory Allows a comparator for sorting primitive ints Supports sorting of arbitrary data structures (eg, records stored in an of-heap buffer) May not be stable (the current implementation is heapsort, which is not stable)
IteratorIterable<T>	Wrapper for an Iterator that allows it to be used in for-each loops.
MapBuilder<K,V>	A simple utility class that allows maps to be created and populated with a single expression.
OneElementIterable<T>	Produces an Iterator for a single value.

Enum Summary

Enum	Description
HashMultimap.Behavior	Controls the handling of equal key-value pairs.

Exception Summary

Exception	Description
CollectionUtil.FilterException	An exception wrapper for CollectionUtil.filter(java.util.Collection<V>, net.sf.kdgcommons.collections.CollectionUtil.Predicate<V>).
CollectionUtil.MapException	An exception wrapper for CollectionUtil.map(java.util.Collection<V>, net.sf.kdgcommons.collections.CollectionUtil.IndexValueMapFunctor<V, R>).
CollectionUtil.ReduceException	An exception wrapper for CollectionUtil.reduce(java.util.Collection<V>, net.sf.kdgcommons.collections.CollectionUtil.IndexValueReduceFunctor<V, R>).

Package net.sf.kdgcommons.collections Description

Utilities for working with arrays and the JDK collections framework.