Uses of Interface
com.github.andrewoma.dexx.collection.SortedSet
Packages that use SortedSet
Package
Description
Dexx collections are a port of Scala's immutable, persistent collection classes to pure Java.
-
Uses of SortedSet in com.github.andrewoma.dexx.collection
Classes in com.github.andrewoma.dexx.collection that implement SortedSetModifier and TypeClassDescriptionclass
TreeSet<E>
TreeSet
is an implementation ofSortedSet
backed by aTreeMap
.Methods in com.github.andrewoma.dexx.collection that return SortedSetModifier and TypeMethodDescriptionprivate static <E> SortedSet
<E> SortedSets.construct
(Comparator<? super E> comparator, E... es) static <E> @NotNull SortedSet
<E> SortedSets.copyOf
(E[] es) static <E> @NotNull SortedSet
<E> static <E> @NotNull SortedSet
<E> SortedSets.copyOf
(Comparator<? super E> comparator, Traversable<E> traversable) static <E> @NotNull SortedSet
<E> SortedSets.copyOf
(Comparator<? super E> comparator, E[] es) static <E> @NotNull SortedSet
<E> SortedSets.copyOf
(Comparator<? super E> comparator, Iterable<E> iterable) static <E> @NotNull SortedSet
<E> SortedSets.copyOf
(Comparator<? super E> comparator, Iterator<E> iterator) static <E> @NotNull SortedSet
<E> static <E> @NotNull SortedSet
<E> SortedSets.copyOfTraversable
(Traversable<E> traversable) static <E> @NotNull SortedSet
<E> SortedSets.copyOfTraversable
(Comparator<? super E> comparator, Traversable<E> traversable) SortedSet.drop
(int number) Returns a set containing all elements in this set, excluding the firstnumber
of elements.TreeSet.drop
(int number) Returns the bottom of the set starting from the key specified.static <E extends Comparable<? super E>>
@NotNull SortedSet<E> SortedSets.of()
static <E extends Comparable<? super E>>
@NotNull SortedSet<E> SortedSets.of
(E e) static <E extends Comparable<? super E>>
@NotNull SortedSet<E> SortedSets.of
(E e1, E e2) static <E extends Comparable<? super E>>
@NotNull SortedSet<E> SortedSets.of
(E e1, E e2, E e3) static <E extends Comparable<? super E>>
@NotNull SortedSet<E> SortedSets.of
(E e1, E e2, E e3, E e4) static <E extends Comparable<? super E>>
@NotNull SortedSet<E> SortedSets.of
(E e1, E e2, E e3, E e4, E e5) static <E extends Comparable<? super E>>
@NotNull SortedSet<E> SortedSets.of
(E e1, E e2, E e3, E e4, E e5, E e6) static <E extends Comparable<? super E>>
@NotNull SortedSet<E> SortedSets.of
(E e1, E e2, E e3, E e4, E e5, E e6, E e7) static <E extends Comparable<? super E>>
@NotNull SortedSet<E> SortedSets.of
(E e1, E e2, E e3, E e4, E e5, E e6, E e7, E e8) static <E extends Comparable<? super E>>
@NotNull SortedSet<E> SortedSets.of
(E e1, E e2, E e3, E e4, E e5, E e6, E e7, E e8, E e9) static <E extends Comparable<? super E>>
@NotNull SortedSet<E> SortedSets.of
(E e1, E e2, E e3, E e4, E e5, E e6, E e7, E e8, E e9, E e10) static <E extends Comparable<? super E>>
@NotNull SortedSet<E> SortedSets.of
(E e1, E e2, E e3, E e4, E e5, E e6, E e7, E e8, E e9, E e10, E... others) static <E extends Comparable<? super E>>
@NotNull SortedSet<E> SortedSets.of
(Comparator<? super E> comparator) static <E extends Comparable<? super E>>
@NotNull SortedSet<E> SortedSets.of
(Comparator<? super E> comparator, E e) static <E extends Comparable<? super E>>
@NotNull SortedSet<E> SortedSets.of
(Comparator<? super E> comparator, E e1, E e2) static <E extends Comparable<? super E>>
@NotNull SortedSet<E> SortedSets.of
(Comparator<? super E> comparator, E e1, E e2, E e3) static <E extends Comparable<? super E>>
@NotNull SortedSet<E> SortedSets.of
(Comparator<? super E> comparator, E e1, E e2, E e3, E e4) static <E extends Comparable<? super E>>
@NotNull SortedSet<E> SortedSets.of
(Comparator<? super E> comparator, E e1, E e2, E e3, E e4, E e5) static <E extends Comparable<? super E>>
@NotNull SortedSet<E> SortedSets.of
(Comparator<? super E> comparator, E e1, E e2, E e3, E e4, E e5, E e6) static <E extends Comparable<? super E>>
@NotNull SortedSet<E> SortedSets.of
(Comparator<? super E> comparator, E e1, E e2, E e3, E e4, E e5, E e6, E e7) static <E extends Comparable<? super E>>
@NotNull SortedSet<E> SortedSets.of
(Comparator<? super E> comparator, E e1, E e2, E e3, E e4, E e5, E e6, E e7, E e8) static <E extends Comparable<? super E>>
@NotNull SortedSet<E> SortedSets.of
(Comparator<? super E> comparator, E e1, E e2, E e3, E e4, E e5, E e6, E e7, E e8, E e9) static <E extends Comparable<? super E>>
@NotNull SortedSet<E> SortedSets.of
(Comparator<? super E> comparator, E e1, E e2, E e3, E e4, E e5, E e6, E e7, E e8, E e9, E e10) static <E extends Comparable<? super E>>
@NotNull SortedSet<E> SortedSets.of
(Comparator<? super E> comparator, E e1, E e2, E e3, E e4, E e5, E e6, E e7, E e8, E e9, E e10, E... others) Returns a subset of the set between thefrom
andto
keys specified.SortedSet.take
(int number) Returns a set containing the firstnumber
of elements from this set.TreeSet.take
(int number) Returns the top of the set up until the key specified.Traversable.toSortedSet
(Comparator<? super E> comparator) Converts this collection to a sorted set.Methods in com.github.andrewoma.dexx.collection that return types with arguments of type SortedSetModifier and TypeMethodDescriptionSortedSets.builder()
SortedSets.builder
(Comparator<? super E> comparator) static <E> @NotNull BuilderFactory
<E, SortedSet<E>> SortedSets.factory()
static <E> @NotNull BuilderFactory
<E, SortedSet<E>> SortedSets.factory
(Comparator<? super E> comparator) -
Uses of SortedSet in com.github.andrewoma.dexx.collection.internal.adapter
Fields in com.github.andrewoma.dexx.collection.internal.adapter declared as SortedSetConstructors in com.github.andrewoma.dexx.collection.internal.adapter with parameters of type SortedSet -
Uses of SortedSet in com.github.andrewoma.dexx.collection.internal.base
Classes in com.github.andrewoma.dexx.collection.internal.base that implement SortedSetMethods in com.github.andrewoma.dexx.collection.internal.base that return SortedSet