Package | Description |
---|---|
net.sf.kdgcommons.collections |
Utilities for working with arrays and the JDK collections framework.
|
net.sf.kdgcommons.lang |
Utilities for working with the core JDK classes.
|
net.sf.kdgcommons.util |
Everything that didn't fit someplace better.
|
Class and Description |
---|
BinarySearch.Accessor
Implement this interface if you're searching an already-sorted array-like
structure.
|
BinarySearch.IndexedComparator
Implement this interface if you have an
int[] that contains
sorted indexes into the array-like structure. |
CollectionUtil.IndexValueMapFunctor |
CollectionUtil.IndexValueReduceFunctor
A functor used for the
CollectionUtil.reduce(java.util.Collection<V>, net.sf.kdgcommons.collections.CollectionUtil.IndexValueReduceFunctor<V, R>) operation. |
CollectionUtil.Predicate
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
This interface defines a factory for default values.
|
HashMultimap.Behavior
Controls the handling of equal key-value pairs.
|
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
int s,
returning the same values as java.util.Comparator . |
MapBuilder
A simple utility class that allows maps to be created and populated with a
single expression.
|
Class and Description |
---|
HashMultimap
A map that can have multiple values, and which uses hashed lookups for its keys.
|
Class and Description |
---|
IdentityKey
A wrapper for a hashed key that uses identity semantics, because sometimes
you want to use a
Set . |