Uses of Interface
java.util.SortedSet
| Package | Description |
|---|---|
| java.util | |
| java.util.concurrent |
Utility classes commonly useful in concurrent programming.
|
-
Uses of SortedSet in java.util
Subinterfaces of SortedSet in java.util Modifier and Type Interface Description interfaceNavigableSet<E>ASortedSetextended with navigation methods reporting closest matches for given search targets.Classes in java.util that implement SortedSet Modifier and Type Class Description classTreeSet<E>TreeSet is an implementation of SortedSet.Methods in java.util that return SortedSet Modifier and Type Method Description static <E> SortedSet<E>Collections. checkedSortedSet(SortedSet<E> s, Class<E> type)Returns a dynamically typesafe view of the specified sorted set.SortedSet<E>NavigableSet. headSet(E toElement)Returns aSortedSetof the specified portion of thisSortedSetwhich contains elements less than the end element.SortedSet<E>SortedSet. headSet(E end)Returns aSortedSetof the specified portion of thisSortedSetwhich contains elements less than the end element.SortedSet<E>TreeSet. headSet(E end)Returns aSortedSetof the specified portion of thisTreeSetwhich contains elements less than the end element.SortedSet<E>NavigableSet. subSet(E fromElement, E toElement)Returns aSortedSetof the specified portion of thisSortedSetwhich contains elements greater or equal to the start element but less than the end element.SortedSet<E>SortedSet. subSet(E start, E end)Returns aSortedSetof the specified portion of thisSortedSetwhich contains elements greater or equal to the start element but less than the end element.SortedSet<E>TreeSet. subSet(E start, E end)Returns aSortedSetof the specified portion of thisTreeSetwhich contains elements greater or equal to the start element but less than the end element.static <E> SortedSet<E>Collections. synchronizedSortedSet(SortedSet<E> set)Returns a wrapper on the specified sorted set which synchronizes all access to the sorted set.SortedSet<E>NavigableSet. tailSet(E fromElement)Returns aSortedSetof the specified portion of thisSortedSetwhich contains elements greater or equal to the start element.SortedSet<E>SortedSet. tailSet(E start)Returns aSortedSetof the specified portion of thisSortedSetwhich contains elements greater or equal to the start element.SortedSet<E>TreeSet. tailSet(E start)Returns aSortedSetof the specified portion of thisTreeSetwhich contains elements greater or equal to the start element.static <E> SortedSet<E>Collections. unmodifiableSortedSet(SortedSet<E> set)Returns a wrapper on the specified sorted set which throws anUnsupportedOperationExceptionwhenever an attempt is made to modify the sorted set.Methods in java.util with parameters of type SortedSet Modifier and Type Method Description static <E> SortedSet<E>Collections. checkedSortedSet(SortedSet<E> s, Class<E> type)Returns a dynamically typesafe view of the specified sorted set.static <E> SortedSet<E>Collections. synchronizedSortedSet(SortedSet<E> set)Returns a wrapper on the specified sorted set which synchronizes all access to the sorted set.static <E> SortedSet<E>Collections. unmodifiableSortedSet(SortedSet<E> set)Returns a wrapper on the specified sorted set which throws anUnsupportedOperationExceptionwhenever an attempt is made to modify the sorted set.Constructors in java.util with parameters of type SortedSet Constructor Description PriorityQueue(SortedSet<? extends E> c)Constructs a priority queue that contains the elements of a sorted set.TreeSet(SortedSet<E> set)Constructs a new instance ofTreeSetcontaining the elements of the specified SortedSet and using the same Comparator. -
Uses of SortedSet in java.util.concurrent
Classes in java.util.concurrent that implement SortedSet Modifier and Type Class Description classConcurrentSkipListSet<E>A scalable concurrentNavigableSetimplementation based on aConcurrentSkipListMap.Constructors in java.util.concurrent with parameters of type SortedSet Constructor Description ConcurrentSkipListSet(SortedSet<E> s)Constructs a new set containing the same elements and using the same ordering as the specified sorted set.