Package | Description |
---|---|
javaslang.collection |
Purely functional collections based on Traversable.
|
Modifier and Type | Method and Description |
---|---|
TreeSet<T> |
TreeSet.add(T element) |
TreeSet<T> |
TreeSet.addAll(Iterable<? extends T> elements) |
TreeSet<T> |
TreeSet.diff(Set<? extends T> elements) |
TreeSet<T> |
TreeSet.distinct() |
TreeSet<T> |
TreeSet.distinctBy(Comparator<? super T> comparator) |
<U> TreeSet<T> |
TreeSet.distinctBy(Function<? super T,? extends U> keyExtractor) |
TreeSet<T> |
TreeSet.drop(int n) |
TreeSet<T> |
TreeSet.dropRight(int n) |
TreeSet<T> |
TreeSet.dropUntil(Predicate<? super T> predicate) |
TreeSet<T> |
TreeSet.dropWhile(Predicate<? super T> predicate) |
static <T extends Comparable<? super T>> |
TreeSet.empty() |
static <T> TreeSet<T> |
TreeSet.empty(Comparator<? super T> comparator) |
static <T> TreeSet<T> |
TreeSet.fill(Comparator<? super T> comparator,
int n,
Supplier<? extends T> s)
Returns a TreeSet containing
n values supplied by a given Supplier s . |
static <T extends Comparable<? super T>> |
TreeSet.fill(int n,
Supplier<? extends T> s)
Returns a TreeSet containing
n values supplied by a given Supplier s . |
TreeSet<T> |
TreeSet.filter(Predicate<? super T> predicate) |
<U> TreeSet<U> |
TreeSet.flatMap(Comparator<? super U> comparator,
Function<? super T,? extends Iterable<? extends U>> mapper) |
<U> TreeSet<U> |
TreeSet.flatMap(Function<? super T,? extends Iterable<? extends U>> mapper) |
TreeSet<T> |
TreeSet.init() |
TreeSet<T> |
TreeSet.intersect(Set<? extends T> elements) |
<U> TreeSet<U> |
TreeSet.map(Comparator<? super U> comparator,
Function<? super T,? extends U> mapper) |
<U> TreeSet<U> |
TreeSet.map(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(Comparator<? super T> comparator,
T... values) |
static <T> TreeSet<T> |
TreeSet.of(Comparator<? super T> comparator,
T value) |
static <T extends Comparable<? super T>> |
TreeSet.of(T... values) |
static <T extends Comparable<? super T>> |
TreeSet.of(T value) |
static TreeSet<Boolean> |
TreeSet.ofAll(boolean[] array)
Creates a TreeSet based on the elements of a boolean array.
|
static TreeSet<Byte> |
TreeSet.ofAll(byte[] array)
Creates a TreeSet based on the elements of a byte array.
|
static TreeSet<Character> |
TreeSet.ofAll(char[] array)
Creates a TreeSet based on the elements of a char array.
|
static <T> TreeSet<T> |
TreeSet.ofAll(Comparator<? super T> comparator,
Iterable<? extends T> values) |
static <T> TreeSet<T> |
TreeSet.ofAll(Comparator<? super T> comparator,
Stream<? extends T> javaStream) |
static TreeSet<Double> |
TreeSet.ofAll(double[] array)
Creates a TreeSet based on the elements of a double array.
|
static TreeSet<Float> |
TreeSet.ofAll(float[] array)
Creates a TreeSet based on the elements of a float array.
|
static TreeSet<Integer> |
TreeSet.ofAll(int[] array)
Creates a TreeSet based on the elements of an int array.
|
static <T extends Comparable<? super T>> |
TreeSet.ofAll(Iterable<? extends T> values) |
static TreeSet<Long> |
TreeSet.ofAll(long[] array)
Creates a TreeSet based on the elements of a long array.
|
static TreeSet<Short> |
TreeSet.ofAll(short[] array)
Creates a TreeSet based on the elements of a short array.
|
static <T extends Comparable<? super T>> |
TreeSet.ofAll(Stream<? extends T> javaStream) |
TreeSet<T> |
TreeSet.peek(Consumer<? super T> action) |
static TreeSet<Character> |
TreeSet.range(char from,
char toExclusive) |
static TreeSet<Integer> |
TreeSet.range(int from,
int toExclusive)
Creates a TreeSet of int numbers starting from
from , extending to toExclusive - 1 . |
static TreeSet<Long> |
TreeSet.range(long from,
long toExclusive)
Creates a TreeSet of long numbers starting from
from , extending to toExclusive - 1 . |
static TreeSet<Character> |
TreeSet.rangeBy(char from,
char toExclusive,
int step) |
static TreeSet<Double> |
TreeSet.rangeBy(double from,
double toExclusive,
double step) |
static TreeSet<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<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<Character> |
TreeSet.rangeClosed(char from,
char toInclusive) |
static TreeSet<Integer> |
TreeSet.rangeClosed(int from,
int toInclusive)
Creates a TreeSet of int numbers starting from
from , extending to toInclusive . |
static TreeSet<Long> |
TreeSet.rangeClosed(long from,
long toInclusive)
Creates a TreeSet of long numbers starting from
from , extending to toInclusive . |
static TreeSet<Character> |
TreeSet.rangeClosedBy(char from,
char toInclusive,
int step) |
static TreeSet<Double> |
TreeSet.rangeClosedBy(double from,
double toInclusive,
double step) |
static TreeSet<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<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.remove(T element) |
TreeSet<T> |
TreeSet.removeAll(Iterable<? extends T> elements) |
TreeSet<T> |
TreeSet.replace(T currentElement,
T newElement) |
TreeSet<T> |
TreeSet.replaceAll(T currentElement,
T newElement) |
TreeSet<T> |
TreeSet.retainAll(Iterable<? extends T> elements) |
TreeSet<T> |
TreeSet.scan(T zero,
BiFunction<? super T,? super T,? extends T> operation) |
static <T> TreeSet<T> |
TreeSet.tabulate(Comparator<? super T> comparator,
int n,
Function<? super 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 extends Comparable<? super T>> |
TreeSet.tabulate(int n,
Function<? super 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(Predicate<? super T> predicate) |
TreeSet<T> |
TreeSet.takeWhile(Predicate<? super T> predicate) |
TreeSet<T> |
TreeSet.union(Set<? extends T> elements) |
<U> TreeSet<Tuple2<T,U>> |
TreeSet.zip(Iterable<? extends U> that) |
default <U> TreeSet<Tuple2<T,U>> |
BitSet.zip(Iterable<? extends U> that) |
<U> TreeSet<Tuple2<T,U>> |
TreeSet.zipAll(Iterable<? extends U> that,
T thisElem,
U thatElem) |
default <U> TreeSet<Tuple2<T,U>> |
BitSet.zipAll(Iterable<? extends U> that,
T thisElem,
U thatElem) |
<U,R> TreeSet<R> |
TreeSet.zipWith(Iterable<? extends U> that,
BiFunction<? super T,? super U,? extends R> mapper) |
default <U,R> TreeSet<R> |
BitSet.zipWith(Iterable<? extends U> that,
BiFunction<? super T,? super U,? extends R> mapper) |
TreeSet<Tuple2<T,Integer>> |
TreeSet.zipWithIndex() |
default TreeSet<Tuple2<T,Integer>> |
BitSet.zipWithIndex() |
default <U> TreeSet<U> |
BitSet.zipWithIndex(BiFunction<? super T,? super Integer,? extends U> mapper) |
Modifier and Type | Method and Description |
---|---|
static <T extends Comparable<? super T>> |
TreeSet.collector()
Returns a
Collector which may be used in conjunction with
Stream.collect(java.util.stream.Collector) to obtain a TreeSet . |
static <T> Collector<T,ArrayList<T>,TreeSet<T>> |
TreeSet.collector(Comparator<? super T> comparator)
Returns a
Collector which may be used in conjunction with
Stream.collect(java.util.stream.Collector) to obtain a TreeSet . |
<C> Map<C,TreeSet<T>> |
TreeSet.groupBy(Function<? super T,? extends C> classifier) |
Iterator<TreeSet<T>> |
TreeSet.grouped(int size) |
Option<TreeSet<T>> |
TreeSet.initOption() |
Tuple2<TreeSet<T>,TreeSet<T>> |
TreeSet.partition(Predicate<? super T> predicate) |
Tuple2<TreeSet<T>,TreeSet<T>> |
TreeSet.partition(Predicate<? super T> predicate) |
Iterator<TreeSet<T>> |
TreeSet.sliding(int size) |
Iterator<TreeSet<T>> |
TreeSet.sliding(int size,
int step) |
Tuple2<TreeSet<T>,TreeSet<T>> |
TreeSet.span(Predicate<? super T> predicate) |
Tuple2<TreeSet<T>,TreeSet<T>> |
TreeSet.span(Predicate<? super T> predicate) |
Option<TreeSet<T>> |
TreeSet.tailOption() |
<T1,T2> Tuple2<TreeSet<T1>,TreeSet<T2>> |
TreeSet.unzip(Function<? super T,Tuple2<? extends T1,? extends T2>> unzipper) |
<T1,T2> Tuple2<TreeSet<T1>,TreeSet<T2>> |
TreeSet.unzip(Function<? super T,Tuple2<? extends T1,? extends T2>> unzipper) |
default <T1,T2> Tuple2<TreeSet<T1>,TreeSet<T2>> |
BitSet.unzip(Function<? super T,Tuple2<? extends T1,? extends T2>> unzipper) |
default <T1,T2> Tuple2<TreeSet<T1>,TreeSet<T2>> |
BitSet.unzip(Function<? super T,Tuple2<? extends T1,? extends T2>> unzipper) |
<T1,T2,T3> Tuple3<TreeSet<T1>,TreeSet<T2>,TreeSet<T3>> |
TreeSet.unzip3(Function<? super T,Tuple3<? extends T1,? extends T2,? extends T3>> unzipper) |
<T1,T2,T3> Tuple3<TreeSet<T1>,TreeSet<T2>,TreeSet<T3>> |
TreeSet.unzip3(Function<? super T,Tuple3<? extends T1,? extends T2,? extends T3>> unzipper) |
<T1,T2,T3> Tuple3<TreeSet<T1>,TreeSet<T2>,TreeSet<T3>> |
TreeSet.unzip3(Function<? super T,Tuple3<? extends T1,? extends T2,? extends T3>> unzipper) |
default <T1,T2,T3> Tuple3<TreeSet<T1>,TreeSet<T2>,TreeSet<T3>> |
BitSet.unzip3(Function<? super T,Tuple3<? extends T1,? extends T2,? extends T3>> unzipper) |
default <T1,T2,T3> Tuple3<TreeSet<T1>,TreeSet<T2>,TreeSet<T3>> |
BitSet.unzip3(Function<? super T,Tuple3<? extends T1,? extends T2,? extends T3>> unzipper) |
default <T1,T2,T3> Tuple3<TreeSet<T1>,TreeSet<T2>,TreeSet<T3>> |
BitSet.unzip3(Function<? super T,Tuple3<? extends T1,? extends T2,? extends T3>> unzipper) |
Modifier and Type | Method and Description |
---|---|
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. |
Modifier and Type | Method and Description |
---|---|
<U> U |
TreeSet.transform(Function<? super TreeSet<T>,? extends U> f)
Transforms this
TreeSet . |
Copyright © 2016. All Rights Reserved.