TreeSets<T> |
TreeSets.add(T add) |
TreeSets<T> |
TreeSets.addAll(Set<T> add) |
TreeSets<T> |
TreeSets.addAll(T... add) |
TreeSets<T> |
TreeSets.addConditional(boolean b,
T add) |
static <T> TreeSets<T> |
TreeSets.empty() |
static <T> TreeSets<T> |
TreeSets.empty(Comparator<? super T> comparator) |
TreeSets<T> |
TreeSets.intersect(Set<T> retain) |
TreeSets<T> |
TreeSets.minus(Set<T> remove) |
TreeSets<T> |
TreeSets.remove(T remove) |
TreeSets<T> |
TreeSets.removeAll(Set<T> remove) |
TreeSets<T> |
TreeSets.removeAll(T... remove) |
TreeSets<T> |
TreeSets.removeConditional(boolean b,
T remove) |
TreeSets<T> |
TreeSets.retain(T retain) |
TreeSets<T> |
TreeSets.retainAll(Set<T> retain) |
TreeSets<T> |
TreeSets.retainAll(T... retain) |
TreeSets<T> |
TreeSets.retainConditional(boolean b,
T retain) |
static <T> TreeSets<T> |
TreeSets.sorted() |
static <T> TreeSets<T> |
TreeSets.sorted(Collection<T> set) |
static <T> TreeSets<T> |
TreeSets.sorted(Comparator<? super T> comparator) |
TreeSets<T> |
TreeSets.union(Set<T> add) |