@Override public E first() { if (isEmpty()) { throw new NoSuchElementException(); } return elements.get(0); }
@Override public E last() { if (isEmpty()) { throw new NoSuchElementException(); } return elements.get(size() - 1); }
@Override public E last() { if (isEmpty()) { throw new NoSuchElementException(); } return elements.get(size() - 1); }
@Override public E first() { if (isEmpty()) { throw new NoSuchElementException(); } return elements.get(0); }
@Override public E last() { if (isEmpty()) { throw new NoSuchElementException(); } return elements.get(size() - 1); }
@Override ImmutableSortedSet<E> createDescendingSet() { Comparator<? super E> reversedOrder = Collections.reverseOrder(comparator); return isEmpty() ? emptySet(reversedOrder) : new RegularImmutableSortedSet<E>(elements.reverse(), reversedOrder); } }
if (size() != that.size()) { return false; } else if (isEmpty()) { return true;
@Override ImmutableSortedSet<E> createDescendingSet() { Comparator<? super E> reversedOrder = Collections.reverseOrder(comparator); return isEmpty() ? emptySet(reversedOrder) : new RegularImmutableSortedSet<E>(elements.reverse(), reversedOrder); } }
if (size() != that.size()) { return false; } else if (isEmpty()) { return true;
@Override public E first() { if (isEmpty()) { throw new NoSuchElementException(); } return elements.get(0); }
@Override public E first() { if (isEmpty()) { throw new NoSuchElementException(); } return elements.get(0); }
@Override public E first() { if (isEmpty()) { throw new NoSuchElementException(); } return elements.get(0); }
@Override public E last() { if (isEmpty()) { throw new NoSuchElementException(); } return elements.get(size() - 1); }
@Override public E last() { if (isEmpty()) { throw new NoSuchElementException(); } return elements.get(size() - 1); }
@Override public E last() { if (isEmpty()) { throw new NoSuchElementException(); } return elements.get(size() - 1); }
@Override ImmutableSortedSet<E> createDescendingSet() { Comparator<? super E> reversedOrder = Collections.reverseOrder(comparator); return isEmpty() ? emptySet(reversedOrder) : new RegularImmutableSortedSet<E>(elements.reverse(), reversedOrder); } }
@Override ImmutableSortedSet<E> createDescendingSet() { Comparator<? super E> reversedOrder = Collections.reverseOrder(comparator); return isEmpty() ? emptySet(reversedOrder) : new RegularImmutableSortedSet<E>(elements.reverse(), reversedOrder); } }
@Override ImmutableSortedSet<E> createDescendingSet() { Ordering<E> reversedOrder = Ordering.from(comparator).reverse(); return isEmpty() ? emptySet(reversedOrder) : new RegularImmutableSortedSet<E>(elements.reverse(), reversedOrder); } }
if (size() != that.size()) { return false; } else if (isEmpty()) { return true;
if (size() != that.size()) { return false; } else if (isEmpty()) { return true;