TreePSet<E> |
TreePSet.descendingSet() |
|
static <E extends java.lang.Comparable<? super E>> TreePSet<E> |
TreePSet.empty() |
Returns an empty TreePSet using the natural ordering.
|
static <E> TreePSet<E> |
TreePSet.empty(java.util.Comparator<? super E> comparator) |
Returns an empty TreePSet using the specified comparator.
|
static <E extends java.lang.Comparable<? super E>> TreePSet<E> |
TreePSet.from(java.util.Collection<? extends E> list) |
Returns a TreePSet with the specified elements, using their natural ordering.
|
static <E> TreePSet<E> |
TreePSet.from(java.util.Comparator<? super E> comparator,
java.util.Collection<? extends E> list) |
Returns a TreePSet with the specified comparator and elements.
|
static <E> TreePSet<E> |
TreePSet.fromSortedSet(java.util.SortedSet<E> set) |
Returns a TreePSet with the same elements and ordering as the specified set.
|
TreePSet<E> |
TreePSet.headSet(E toElement) |
|
TreePSet<E> |
TreePSet.headSet(E toElement,
boolean inclusive) |
|
TreePSet<E> |
TreePSet.intersect(java.util.Collection<? extends E> list) |
|
TreePSet<K> |
TreePMap.keySet() |
|
TreePSet<E> |
TreePSet.minus(java.lang.Object e) |
|
TreePSet<E> |
TreePSet.minusAll(java.util.Collection<?> list) |
|
TreePSet<E> |
TreePSet.minusFirst() |
|
TreePSet<E> |
TreePSet.minusLast() |
|
TreePSet<K> |
TreePMap.navigableKeySet() |
|
static <E extends java.lang.Comparable<? super E>> TreePSet<E> |
TreePSet.of(E... elements) |
Returns a TreePSet with the specified elements, using their natural ordering.
|
static <E> TreePSet<E> |
TreePSet.of(java.util.Comparator<? super E> comparator,
E... elements) |
Returns a TreePSet with the specified comparator and elements.
|
TreePSet<E> |
TreePSet.plus(E e) |
|
TreePSet<E> |
TreePSet.plusAll(java.util.Collection<? extends E> list) |
|
static <E extends java.lang.Comparable<? super E>> TreePSet<E> |
TreePSet.singleton(E e) |
Returns a TreePSet with a single element, using the natural ordering.
|
static <E> TreePSet<E> |
TreePSet.singleton(java.util.Comparator<? super E> comparator,
E e) |
Returns a TreePSet with a single element, using the specified comparator.
|
TreePSet<E> |
TreePSet.subSet(E fromElement,
boolean fromInclusive,
E toElement,
boolean toInclusive) |
|
TreePSet<E> |
TreePSet.subSet(E fromElement,
E toElement) |
|
TreePSet<E> |
TreePSet.tailSet(E fromElement) |
|
TreePSet<E> |
TreePSet.tailSet(E fromElement,
boolean inclusive) |
|
private TreePSet<E> |
TreePSet.withTree(KVTree<E,?> tree) |
|