Uses of Interface
java.util.NavigableSet

Packages that use NavigableSet

java.util	Contains the collections framework, legacy collection classes, event model, date and time facilities, internationalization, and miscellaneous utility classes (a string tokenizer, a random-number generator, and a bit array).
java.util.concurrent	Utility classes commonly useful in concurrent programming.

Uses of NavigableSet in java.util

Classes in java.util that implement NavigableSet

class

TreeSet<E> A NavigableSet implementation based on a TreeMap.

Methods in java.util that return NavigableSet

NavigableSet<K>	TreeMap.descendingKeySet()
NavigableSet<K>	NavigableMap.descendingKeySet() Returns a reverse order NavigableSet view of the keys contained in this map.
NavigableSet<E>	TreeSet.descendingSet()
NavigableSet<E>	NavigableSet.descendingSet() Returns a reverse order view of the elements contained in this set.
NavigableSet<E>	TreeSet.headSet(E toElement, boolean inclusive)
NavigableSet<E>	NavigableSet.headSet(E toElement, boolean inclusive) Returns a view of the portion of this set whose elements are less than (or equal to, if inclusive is true) toElement.
NavigableSet<K>	TreeMap.navigableKeySet()
NavigableSet<K>	NavigableMap.navigableKeySet() Returns a NavigableSet view of the keys contained in this map.
NavigableSet<E>	TreeSet.subSet(E fromElement, boolean fromInclusive, E toElement, boolean toInclusive)
NavigableSet<E>	NavigableSet.subSet(E fromElement, boolean fromInclusive, E toElement, boolean toInclusive) Returns a view of the portion of this set whose elements range from fromElement to toElement.
NavigableSet<E>	TreeSet.tailSet(E fromElement, boolean inclusive)
NavigableSet<E>	NavigableSet.tailSet(E fromElement, boolean inclusive) Returns a view of the portion of this set whose elements are greater than (or equal to, if inclusive is true) fromElement.

Uses of NavigableSet in java.util.concurrent

Classes in java.util.concurrent that implement NavigableSet

class

ConcurrentSkipListSet<E> A scalable concurrent NavigableSet implementation based on a ConcurrentSkipListMap.

Methods in java.util.concurrent that return NavigableSet

NavigableSet<K>	ConcurrentSkipListMap.descendingKeySet()
NavigableSet<K>	ConcurrentNavigableMap.descendingKeySet() Returns a reverse order NavigableSet view of the keys contained in this map.
NavigableSet<E>	ConcurrentSkipListSet.descendingSet() Returns a reverse order view of the elements contained in this set.
NavigableSet<E>	ConcurrentSkipListSet.headSet(E toElement)
NavigableSet<E>	ConcurrentSkipListSet.headSet(E toElement, boolean inclusive)
NavigableSet<K>	ConcurrentSkipListMap.keySet() Returns a NavigableSet view of the keys contained in this map.
NavigableSet<K>	ConcurrentNavigableMap.keySet() Returns a NavigableSet view of the keys contained in this map.
NavigableSet<K>	ConcurrentSkipListMap.navigableKeySet()
NavigableSet<K>	ConcurrentNavigableMap.navigableKeySet() Returns a NavigableSet view of the keys contained in this map.
NavigableSet<E>	ConcurrentSkipListSet.subSet(E fromElement, boolean fromInclusive, E toElement, boolean toInclusive)
NavigableSet<E>	ConcurrentSkipListSet.subSet(E fromElement, E toElement)
NavigableSet<E>	ConcurrentSkipListSet.tailSet(E fromElement)
NavigableSet<E>	ConcurrentSkipListSet.tailSet(E fromElement, boolean inclusive)