Package net.sf.molae.pipe.sorted

This package contains utility classes for constructing SortedMap and SortedSet implementations.

See:
Description

Class Summary

Bound<T>	Wrapper around a comparable that allows for infinities.
ComparatorUtil	Utility methods for Comparators.
ComparatorWithInfinity<T>	Allows to define two constants for negative and positive infinity that are always less or greater than any other object, respecitively.
KeyComparator<K>	Applies a comparator to the key of map entries.
ListAsSortedSet<B extends List<E>,E>	Sorted list backed implementation of the SortedSet interface.
MapAsSortedMap<B extends Map<K,V>,K,V>	If it can be guaranteed that the iterator of a map returns elements in sorted key order, this wrapper can be used to create a SortedMap implementation.
Max<T>	The binary function returning the maximum of two objects.
Min<T>	The binary function returning the minimum of two objects.
SelfComparator<T extends Comparable<T>>	Compares two objects using their natural ordering.
SetAsSortedSet<B extends Collection<E>,E>	If it can be guaranteed that a collection is a set and that its iterator returns elements in sorted order, this wrapper can be used to create a SortedSet implementation.
SortedMapProxy<B extends SortedMap<K,V>,K,V>	Delegates all method calls to another sorted map.
SortedSetProxy<B extends SortedSet<E>,E>	Delegates all method calls to another sorted set.
SubSetFilter<T>	To pass this filter an object must be greater or equal to the lower bound and smaller than the upper bound using the specified comparator.
TransformedComparator<S,T>	Transforms both arguments with the underlying transformer and compares them.

Package net.sf.molae.pipe.sorted Description

This package contains utility classes for constructing SortedMap and SortedSet implementations.

Since:

1.0