Uses of Interface
org.pcollections.PSortedSet

Uses of PSortedSet in org.pcollections

Classes in org.pcollections that implement PSortedSet

Modifier and Type	Class	Description
final class	TreePSet<E>	An implementation of PSortedSet based on a self-balancing binary search tree.

Methods in org.pcollections that return PSortedSet

Modifier and Type	Method	Description
PSortedSet<K>	PSortedMap.descendingKeySet()
PSortedSet<K>	TreePMap.descendingKeySet()
PSortedSet<E>	PSortedSet.descendingSet()
PSortedSet<E>	PSortedSet.headSet(E toElement)
PSortedSet<E>	PSortedSet.headSet(E toElement, boolean inclusive)
default PSortedSet<E>	PSortedSet.intersect(Collection<? extends E> list)
PSortedSet<K>	PSortedMap.keySet()
PSortedSet<E>	PSortedSet.minus(Object e)
PSortedSet<E>	PSortedSet.minusAll(Collection<?> list)
PSortedSet<E>	PSortedSet.minusFirst()
PSortedSet<E>	PSortedSet.minusLast()
PSortedSet<K>	PSortedMap.navigableKeySet()
PSortedSet<E>	PSortedSet.plus(E e)
PSortedSet<E>	PSortedSet.plusAll(Collection<? extends E> list)
static <E extends Comparable<? super E>> PSortedSet<E>	Empty.sortedSet()
static <E> PSortedSet<E>	Empty.sortedSet(Comparator<? super E> comparator)
PSortedSet<E>	PSortedSet.subSet(E fromElement, boolean fromInclusive, E toElement, boolean toInclusive)
PSortedSet<E>	PSortedSet.subSet(E fromElement, E toElement)
PSortedSet<E>	PSortedSet.tailSet(E fromElement)
PSortedSet<E>	PSortedSet.tailSet(E fromElement, boolean inclusive)