| |||||
PREV CLASS NEXT CLASS | FRAMES NO FRAMES | ||||
SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |
ObjectInputStream in = …;
NavigableSet r = (NavigableSet)in.readObject();
Based on 14 examples
public interface NavigableSet extends SortedSet
A {@link SortedSet} extended with navigation methods reporting closest matches for given search targets. Methods {@code lower}, {@code floor}, {@code ceiling}, and {@code higher} return elements respectively less than, less than or equal, greater than or equal, and greater than a given element, returning {@code null} if there is no such element. A {@code NavigableSet} may be accessed and traversed in either ascending or descending order. The {@code descendingSet} method returns a view of the set with the senses of all relational and directional methods inverted. The performance of ascending operations and views is likely to be faster than that of descending ones. This interface additionally defines methods {@code pollFirst} and {@code pollLast} that return and remove the lowest and highest element, if one exists, else returning {@code null}. Methods {@code subSet}, {@code headSet}, and {@code tailSet} differ from the like-named {@code SortedSet} methods in accepting additional arguments describing whether lower and upper bounds are inclusive versus exclusive. Subsets of any {@code NavigableSet} must implement the {@code NavigableSet} interface.
The return values of navigation methods may be ambiguous in implementations that permit {@code null} elements. However, even in this case the result can be disambiguated by checking {@code contains(null)}. To avoid such issues, implementations of this interface are encouraged to not permit insertion of {@code null} elements. (Note that sorted sets of {@link Comparable} elements intrinsically do not permit {@code null}.)
Methods {@link #subSet(Object, Object) subSet(E, E)}, {@link #headSet(Object) headSet(E)}, and {@link #tailSet(Object) tailSet(E)} are specified to return {@code SortedSet} to allow existing implementations of {@code SortedSet} to be compatibly retrofitted to implement {@code NavigableSet}, but extensions and implementations of this interface are encouraged to override these methods to return {@code NavigableSet}.
This interface is a member of the Java Collections Framework.
Method Summary | |
---|---|
Object |
Returns the least element in this set greater than or equal to the given element, or if there is no such element. |
Iterator |
Returns an iterator over the elements in this set, in descending order. |
NavigableSet |
Returns a reverse order view of the elements contained in this set. |
Object |
Returns the greatest element in this set less than or equal to the given element, or if there is no such element. |
SortedSet |
|
NavigableSet |
Returns a view of the portion of this set whose elements are less than (or equal to, if is true) . |
Object |
Returns the least element in this set strictly greater than the given element, or if there is no such element. |
Iterator |
iterator() Returns an iterator over the elements in this set, in ascending order. |
Object |
Returns the greatest element in this set strictly less than the given element, or if there is no such element. |
Object |
Retrieves and removes the first (lowest) element, or returns if this set is empty. |
Object |
pollLast() Retrieves and removes the last (highest) element, or returns if this set is empty. |
NavigableSet |
Returns a view of the portion of this set whose elements range from to . |
SortedSet |
|
SortedSet |
|
NavigableSet |
Returns a view of the portion of this set whose elements are greater than (or equal to, if is true) . |
Methods inherited from class java.util.SortedSet |
---|
comparator, first, headSet, last, subSet, tailSet |
Methods inherited from class java.util.Set |
---|
add, addAll, clear, contains, containsAll, equals, hashCode, isEmpty, iterator, remove, removeAll, retainAll, size, toArray, toArray |
Methods inherited from class java.util.Collection |
---|
add, addAll, clear, contains, containsAll, equals, hashCode, isEmpty, iterator, remove, removeAll, retainAll, size, toArray, toArray |
Methods inherited from class java.lang.Iterable |
---|
iterator |
Method Detail |
---|
public Object ceiling(Object e)
e
- the value to matchpublic Iterator descendingIterator()
public NavigableSet descendingSet()
The returned set has an ordering equivalent to {@link Collections#reverseOrder(Comparator) Collections.reverseOrder}(comparator()). The expression {@code s.descendingSet().descendingSet()} returns a view of {@code s} essentially equivalent to {@code s}.
public Object floor(Object e)
e
- the value to matchpublic SortedSet headSet(Object toElement)
Equivalent to {@code headSet(toElement, false)}.
toElement
public NavigableSet headSet(Object toElement, boolean inclusive)
The returned set will throw an {@code IllegalArgumentException} on an attempt to insert an element outside its range.
toElement
- high endpoint of the returned setinclusive
- {@code true} if the high endpoint
is to be included in the returned viewpublic Object higher(Object e)
e
- the value to matchpublic Iterator iterator()
public Object lower(Object e)
e
- the value to matchpublic Object pollFirst()
public Object pollLast()
public NavigableSet subSet(Object fromElement, boolean fromInclusive, Object toElement, boolean toInclusive)
The returned set will throw an {@code IllegalArgumentException} on an attempt to insert an element outside its range.
fromElement
- low endpoint of the returned setfromInclusive
- {@code true} if the low endpoint
is to be included in the returned viewtoElement
- high endpoint of the returned settoInclusive
- {@code true} if the high endpoint
is to be included in the returned viewpublic SortedSet subSet(Object fromElement, Object toElement)
Equivalent to {@code subSet(fromElement, true, toElement, false)}.
fromElement
toElement
public SortedSet tailSet(Object fromElement)
Equivalent to {@code tailSet(fromElement, true)}.
fromElement
public NavigableSet tailSet(Object fromElement, boolean inclusive)
The returned set will throw an {@code IllegalArgumentException} on an attempt to insert an element outside its range.
fromElement
- low endpoint of the returned setinclusive
- {@code true} if the low endpoint
is to be included in the returned view
| |||||
PREV CLASS NEXT CLASS | FRAMES NO FRAMES | ||||
SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |