public NavigableSet<E> tailSet(E start, boolean startInclusive) {Comparator<? super E> c = backingMap.comparator();if (c == null) {((Comparable<E>) start).compareTo(start);} else {c.compare(start, start);}return new TreeSet<E>(backingMap.tailMap(start, startInclusive));}

public virtual java.util.NavigableSet<E> tailSet(E start, bool startInclusive){java.util.Comparator<E> c = backingMap.comparator();if (c == null){((java.lang.Comparable<E>)start).compareTo(start);}else{c.compare(start, start);}return new java.util.TreeSet<E>(backingMap.tailMap(start, startInclusive));}
