Uses of Interface
com.github.andrewoma.dexx.collection.SortedSet

Packages that use SortedSet

com.github.andrewoma.dexx.collection	Dexx collections are a port of Scala's immutable, persistent collection classes to pure Java.
com.github.andrewoma.dexx.collection.internal.adapter
com.github.andrewoma.dexx.collection.internal.base

Uses of SortedSet in com.github.andrewoma.dexx.collection

Classes in com.github.andrewoma.dexx.collection that implement SortedSet

class

TreeSet<E> TreeSet is an implementation of SortedSet backed by a TreeMap.

Methods in com.github.andrewoma.dexx.collection that return SortedSet

SortedSet<E>	SortedSet.add(E value)
static <E> SortedSet<E>	SortedSets.copyOf(Comparator<? super E> comparator, E[] es)
static <E> SortedSet<E>	SortedSets.copyOf(Comparator<? super E> comparator, Iterable<E> iterable)
static <E> SortedSet<E>	SortedSets.copyOf(Comparator<? super E> comparator, Iterator<E> iterator)
static <E> SortedSet<E>	SortedSets.copyOf(Comparator<? super E> comparator, Traversable<E> traversable)
static <E> SortedSet<E>	SortedSets.copyOf(E[] es)
static <E> SortedSet<E>	SortedSets.copyOf(Iterable<E> iterable)
static <E> SortedSet<E>	SortedSets.copyOf(Iterator<E> iterator)
static <E> SortedSet<E>	SortedSets.copyOfTraversable(Comparator<? super E> comparator, Traversable<E> traversable)
static <E> SortedSet<E>	SortedSets.copyOfTraversable(Traversable<E> traversable)
SortedSet<E>	SortedSet.drop(int number) Returns a set containing all elements in this set, excluding the first number of elements.
SortedSet<E>	TreeSet.drop(int number)
SortedSet<E>	SortedSet.from(E value, boolean inclusive) Returns the bottom of the set starting from the key specified.
SortedSet<E>	TreeSet.from(E value, boolean inclusive)
static <E extends Comparable<? super E>> SortedSet<E>	SortedSets.of()
static <E extends Comparable<? super E>> SortedSet<E>	SortedSets.of(Comparator<? super E> comparator)
static <E extends Comparable<? super E>> SortedSet<E>	SortedSets.of(Comparator<? super E> comparator, E e)
static <E extends Comparable<? super E>> SortedSet<E>	SortedSets.of(Comparator<? super E> comparator, E e1, E e2)
static <E extends Comparable<? super E>> SortedSet<E>	SortedSets.of(Comparator<? super E> comparator, E e1, E e2, E e3)
static <E extends Comparable<? super E>> SortedSet<E>	SortedSets.of(Comparator<? super E> comparator, E e1, E e2, E e3, E e4)
static <E extends Comparable<? super E>> SortedSet<E>	SortedSets.of(Comparator<? super E> comparator, E e1, E e2, E e3, E e4, E e5)
static <E extends Comparable<? super E>> 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>> 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>> 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>> 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>> 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>> 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)
static <E extends Comparable<? super E>> SortedSet<E>	SortedSets.of(E e)
static <E extends Comparable<? super E>> SortedSet<E>	SortedSets.of(E e1, E e2)
static <E extends Comparable<? super E>> SortedSet<E>	SortedSets.of(E e1, E e2, E e3)
static <E extends Comparable<? super E>> SortedSet<E>	SortedSets.of(E e1, E e2, E e3, E e4)
static <E extends Comparable<? super E>> SortedSet<E>	SortedSets.of(E e1, E e2, E e3, E e4, E e5)
static <E extends Comparable<? super E>> SortedSet<E>	SortedSets.of(E e1, E e2, E e3, E e4, E e5, E e6)
static <E extends Comparable<? super E>> SortedSet<E>	SortedSets.of(E e1, E e2, E e3, E e4, E e5, E e6, E e7)
static <E extends Comparable<? super E>> 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>> 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>> 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>> 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)
SortedSet<E>	SortedSet.range(E from, boolean fromInclusive, E to, boolean toInclusive) Returns a subset of the set between the from and to keys specified.
SortedSet<E>	TreeSet.range(E from, boolean fromInclusive, E to, boolean toInclusive)
SortedSet<E>	SortedSet.remove(E value)
SortedSet<E>	SortedSet.take(int number) Returns a set containing the first number of elements from this set.
SortedSet<E>	TreeSet.take(int number)
SortedSet<E>	SortedSet.to(E value, boolean inclusive) Returns the top of the set up until the key specified.
SortedSet<E>	TreeSet.to(E value, boolean inclusive)
SortedSet<E>	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 SortedSet

static <E> Builder<E,SortedSet<E>>	SortedSets.builder()
static <E> Builder<E,SortedSet<E>>	SortedSets.builder(Comparator<? super E> comparator)
static <E> BuilderFactory<E,SortedSet<E>>	SortedSets.factory()
static <E> BuilderFactory<E,SortedSet<E>>	SortedSets.factory(Comparator<? super E> comparator)

Uses of SortedSet in com.github.andrewoma.dexx.collection.internal.adapter

Constructors in com.github.andrewoma.dexx.collection.internal.adapter with parameters of type SortedSet

SortedSetAdapter(SortedSet<E> set)

Uses of SortedSet in com.github.andrewoma.dexx.collection.internal.base

Classes in com.github.andrewoma.dexx.collection.internal.base that implement SortedSet

class

AbstractSortedSet<E>

Methods in com.github.andrewoma.dexx.collection.internal.base that return SortedSet

SortedSet<E>	AbstractSortedSet.from(E value, boolean inclusive)
SortedSet<E>	AbstractSortedSet.to(E value, boolean inclusive)
SortedSet<E>	AbstractTraversable.toSortedSet(Comparator<? super E> comparator)