TreeSet<T> |
TreeSet.add(T element) |
|
TreeSet<T> |
TreeSet.addAll(java.lang.Iterable<? extends T> elements) |
|
<R> TreeSet<R> |
TreeSet.collect(PartialFunction<? super T,? extends R> partialFunction) |
|
TreeSet<T> |
TreeSet.diff(Set<? extends T> elements) |
|
TreeSet<T> |
TreeSet.distinct() |
|
TreeSet<T> |
TreeSet.distinctBy(java.util.Comparator<? super T> comparator) |
|
<U> TreeSet<T> |
TreeSet.distinctBy(java.util.function.Function<? super T,? extends U> keyExtractor) |
|
TreeSet<T> |
TreeSet.drop(int n) |
|
TreeSet<T> |
TreeSet.dropRight(int n) |
|
TreeSet<T> |
TreeSet.dropUntil(java.util.function.Predicate<? super T> predicate) |
|
TreeSet<T> |
TreeSet.dropWhile(java.util.function.Predicate<? super T> predicate) |
|
static <T extends java.lang.Comparable<? super T>> TreeSet<T> |
TreeSet.empty() |
|
static <T> TreeSet<T> |
TreeSet.empty(java.util.Comparator<? super T> comparator) |
|
static <T extends java.lang.Comparable<? super T>> TreeSet<T> |
TreeSet.fill(int n,
java.util.function.Supplier<? extends T> s) |
Returns a TreeSet containing tuples returned by n calls to a given Supplier s .
|
static <T> TreeSet<T> |
TreeSet.fill(java.util.Comparator<? super T> comparator,
int n,
java.util.function.Supplier<? extends T> s) |
Returns a TreeSet containing tuples returned by n calls to a given Supplier s .
|
TreeSet<T> |
TreeSet.filter(java.util.function.Predicate<? super T> predicate) |
|
<U> TreeSet<U> |
TreeSet.flatMap(java.util.Comparator<? super U> comparator,
java.util.function.Function<? super T,? extends java.lang.Iterable<? extends U>> mapper) |
|
<U> TreeSet<U> |
TreeSet.flatMap(java.util.function.Function<? super T,? extends java.lang.Iterable<? extends U>> mapper) |
|
TreeSet<T> |
TreeSet.init() |
|
TreeSet<T> |
TreeSet.intersect(Set<? extends T> elements) |
|
<U> TreeSet<U> |
TreeSet.map(java.util.Comparator<? super U> comparator,
java.util.function.Function<? super T,? extends U> mapper) |
|
<U> TreeSet<U> |
TreeSet.map(java.util.function.Function<? super T,? extends U> mapper) |
|
static <T> TreeSet<T> |
TreeSet.narrow(TreeSet<? extends T> treeSet) |
Narrows a widened TreeSet<? extends T> to TreeSet<T>
by performing a type-safe cast.
|
static <T> TreeSet<T> |
TreeSet.of(java.util.Comparator<? super T> comparator,
T value) |
|
static <T> TreeSet<T> |
TreeSet.of(java.util.Comparator<? super T> comparator,
T... values) |
|
static <T extends java.lang.Comparable<? super T>> TreeSet<T> |
TreeSet.of(T value) |
|
static <T extends java.lang.Comparable<? super T>> TreeSet<T> |
TreeSet.of(T... values) |
|
static TreeSet<java.lang.Boolean> |
TreeSet.ofAll(boolean... elements) |
Creates a TreeSet from boolean values.
|
static TreeSet<java.lang.Byte> |
TreeSet.ofAll(byte... elements) |
Creates a TreeSet from byte values.
|
static TreeSet<java.lang.Character> |
TreeSet.ofAll(char... elements) |
Creates a TreeSet from char values.
|
static TreeSet<java.lang.Double> |
TreeSet.ofAll(double... elements) |
Creates a TreeSet from double values.
|
static TreeSet<java.lang.Float> |
TreeSet.ofAll(float... elements) |
Creates a TreeSet from float values.
|
static TreeSet<java.lang.Integer> |
TreeSet.ofAll(int... elements) |
Creates a TreeSet from int values.
|
static TreeSet<java.lang.Long> |
TreeSet.ofAll(long... elements) |
Creates a TreeSet from long values.
|
static TreeSet<java.lang.Short> |
TreeSet.ofAll(short... elements) |
Creates a TreeSet from short values.
|
static <T extends java.lang.Comparable<? super T>> TreeSet<T> |
TreeSet.ofAll(java.lang.Iterable<? extends T> values) |
|
static <T> TreeSet<T> |
TreeSet.ofAll(java.util.Comparator<? super T> comparator,
java.lang.Iterable<? extends T> values) |
|
static <T> TreeSet<T> |
TreeSet.ofAll(java.util.Comparator<? super T> comparator,
java.util.stream.Stream<? extends T> javaStream) |
|
static <T extends java.lang.Comparable<? super T>> TreeSet<T> |
TreeSet.ofAll(java.util.stream.Stream<? extends T> javaStream) |
|
TreeSet<T> |
TreeSet.orElse(java.lang.Iterable<? extends T> other) |
Returns this TreeSet if it is nonempty,
otherwise TreeSet created from iterable, using existing comparator.
|
TreeSet<T> |
TreeSet.orElse(java.util.function.Supplier<? extends java.lang.Iterable<? extends T>> supplier) |
Returns this TreeSet if it is nonempty,
otherwise TreeSet created from result of evaluating supplier, using existing comparator.
|
TreeSet<T> |
TreeSet.peek(java.util.function.Consumer<? super T> action) |
|
static TreeSet<java.lang.Character> |
TreeSet.range(char from,
char toExclusive) |
|
static TreeSet<java.lang.Integer> |
TreeSet.range(int from,
int toExclusive) |
Creates a TreeSet of int numbers starting from from , extending to toExclusive - 1 .
|
static TreeSet<java.lang.Long> |
TreeSet.range(long from,
long toExclusive) |
Creates a TreeSet of long numbers starting from from , extending to toExclusive - 1 .
|
static TreeSet<java.lang.Character> |
TreeSet.rangeBy(char from,
char toExclusive,
int step) |
|
static TreeSet<java.lang.Double> |
TreeSet.rangeBy(double from,
double toExclusive,
double step) |
|
static TreeSet<java.lang.Integer> |
TreeSet.rangeBy(int from,
int toExclusive,
int step) |
Creates a TreeSet of int numbers starting from from , extending to toExclusive - 1 ,
with step .
|
static TreeSet<java.lang.Long> |
TreeSet.rangeBy(long from,
long toExclusive,
long step) |
Creates a TreeSet of long numbers starting from from , extending to toExclusive - 1 ,
with step .
|
static TreeSet<java.lang.Character> |
TreeSet.rangeClosed(char from,
char toInclusive) |
|
static TreeSet<java.lang.Integer> |
TreeSet.rangeClosed(int from,
int toInclusive) |
Creates a TreeSet of int numbers starting from from , extending to toInclusive .
|
static TreeSet<java.lang.Long> |
TreeSet.rangeClosed(long from,
long toInclusive) |
Creates a TreeSet of long numbers starting from from , extending to toInclusive .
|
static TreeSet<java.lang.Character> |
TreeSet.rangeClosedBy(char from,
char toInclusive,
int step) |
|
static TreeSet<java.lang.Double> |
TreeSet.rangeClosedBy(double from,
double toInclusive,
double step) |
|
static TreeSet<java.lang.Integer> |
TreeSet.rangeClosedBy(int from,
int toInclusive,
int step) |
Creates a TreeSet of int numbers starting from from , extending to toInclusive ,
with step .
|
static TreeSet<java.lang.Long> |
TreeSet.rangeClosedBy(long from,
long toInclusive,
long step) |
Creates a TreeSet of long numbers starting from from , extending to toInclusive ,
with step .
|
TreeSet<T> |
TreeSet.reject(java.util.function.Predicate<? super T> predicate) |
|
TreeSet<T> |
TreeSet.remove(T element) |
|
TreeSet<T> |
TreeSet.removeAll(java.lang.Iterable<? extends T> elements) |
|
TreeSet<T> |
TreeSet.replace(T currentElement,
T newElement) |
|
TreeSet<T> |
TreeSet.replaceAll(T currentElement,
T newElement) |
|
TreeSet<T> |
TreeSet.retainAll(java.lang.Iterable<? extends T> elements) |
|
TreeSet<T> |
TreeSet.scan(T zero,
java.util.function.BiFunction<? super T,? super T,? extends T> operation) |
|
static <T extends java.lang.Comparable<? super T>> TreeSet<T> |
TreeSet.tabulate(int n,
java.util.function.Function<? super java.lang.Integer,? extends T> f) |
Returns a TreeSet containing n values of a given Function f
over a range of integer values from 0 to n - 1 .
|
static <T> TreeSet<T> |
TreeSet.tabulate(java.util.Comparator<? super T> comparator,
int n,
java.util.function.Function<? super java.lang.Integer,? extends T> f) |
Returns a TreeSet containing n values of a given Function f
over a range of integer values from 0 to n - 1 .
|
TreeSet<T> |
TreeSet.tail() |
|
TreeSet<T> |
TreeSet.take(int n) |
|
TreeSet<T> |
TreeSet.takeRight(int n) |
|
TreeSet<T> |
TreeSet.takeUntil(java.util.function.Predicate<? super T> predicate) |
|
TreeSet<T> |
TreeSet.takeWhile(java.util.function.Predicate<? super T> predicate) |
|
TreeSet<T> |
TreeSet.union(Set<? extends T> elements) |
|
default <U> TreeSet<Tuple2<T,U>> |
BitSet.zip(java.lang.Iterable<? extends U> that) |
|
<U> TreeSet<Tuple2<T,U>> |
TreeSet.zip(java.lang.Iterable<? extends U> that) |
|
default <U> TreeSet<Tuple2<T,U>> |
BitSet.zipAll(java.lang.Iterable<? extends U> that,
T thisElem,
U thatElem) |
|
<U> TreeSet<Tuple2<T,U>> |
TreeSet.zipAll(java.lang.Iterable<? extends U> that,
T thisElem,
U thatElem) |
|
default <U,R> TreeSet<R> |
BitSet.zipWith(java.lang.Iterable<? extends U> that,
java.util.function.BiFunction<? super T,? super U,? extends R> mapper) |
|
<U,R> TreeSet<R> |
TreeSet.zipWith(java.lang.Iterable<? extends U> that,
java.util.function.BiFunction<? super T,? super U,? extends R> mapper) |
|
default TreeSet<Tuple2<T,java.lang.Integer>> |
BitSet.zipWithIndex() |
|
default <U> TreeSet<U> |
BitSet.zipWithIndex(java.util.function.BiFunction<? super T,? super java.lang.Integer,? extends U> mapper) |
|
TreeSet<Tuple2<T,java.lang.Integer>> |
TreeSet.zipWithIndex() |
|