Code example for NavigableSet

Methods: lowercomparator

0
    delegate.clear();
  } 
 
  @SuppressWarnings("unchecked") 
  @Override public Comparator<? super E> comparator() {
    Comparator<? super E> comparator = delegate.comparator();
    if (comparator == null) {
      comparator = NATURAL_ORDER;
    } 
    return comparator;
  } 
 
  @Override public boolean contains(Object object) {
    return delegate.contains(checkValid(object));
  } 
 
  @Override public boolean containsAll(Collection<?> c) {
    return delegate.containsAll(c);
  } 
 
  @Override public Iterator<E> descendingIterator() {
    return delegate.descendingIterator();
  } 
 
  @Override public NavigableSet<E> descendingSet() {
    return new SafeTreeSet<E>(delegate.descendingSet());
  } 
 
  @Override public E first() { 
    return delegate.first();
  } 
 
  @Override public E floor(E e) {
    return delegate.floor(checkValid(e));
  } 
 
  @Override public SortedSet<E> headSet(E toElement) {
    return headSet(toElement, false);
  } 
 
  @Override public NavigableSet<E> headSet(E toElement, boolean inclusive) {
    return new SafeTreeSet<E>( 
        delegate.headSet(checkValid(toElement), inclusive));
  } 
 
  @Override public E higher(E e) {
    return delegate.higher(checkValid(e));
  } 
 
  @Override public boolean isEmpty() { 
    return delegate.isEmpty();
  } 
 
  @Override public Iterator<E> iterator() {
    return delegate.iterator();
  } 
 
  @Override public E last() { 
    return delegate.last();
  } 
 
  @Override public E lower(E e) {
    return delegate.lower(checkValid(e));
  } 
 
  @Override public E pollFirst() { 
    return delegate.pollFirst();
  } 
Connect your IDE to all the code out there  Get Codota for Java