/*
* {@inheritDoc}
*
* @see java.util.NavigableSet#subSet(Object, boolean, Object, boolean)
* @since 1.6
*/
public NavigableSet <E> subSet(E start, bool startInclusive, E end,
bool endInclusive)
{
Comparator <E> c = backingMap.comparator();
int compare = (c == null) ? ((java.lang.Comparable <E>)start).compareTo(end) : c
.compare(start, end);
if (compare <= 0)
{
return(new TreeSet <E>(backingMap.subMap(start, startInclusive, end,
endInclusive)));
}
throw new java.lang.IllegalArgumentException();
}
