java.util

Interface SortedSet<E>

All Superinterfaces:
Collection<E>, Iterable<T>, Set<E>
Known Implementing Classes:
AbstractSortedSetDecorator, PersistentSortedSet, PredicatedSortedSet, SynchronizedSortedSet, TransformedSortedSet, TreeSet<E>, UnmodifiableSortedSet

public interface SortedSet<E>
extends Set<E>

A set that further guarantees that its iterator will traverse the set in ascending element order, sorted according to the natural ordering of its elements (see Comparable), or by a Comparator provided at sorted set creation time. Several additional operations are provided to take advantage of the ordering. (This interface is the set analogue of SortedMap.)

All elements inserted into an sorted set must implement the Comparable interface (or be accepted by the specified Comparator). Furthermore, all such elements must be mutually comparable: e1.compareTo(e2) (or comparator.compare(e1, e2)) must not throw a ClassCastException for any elements e1 and e2 in the sorted set. Attempts to violate this restriction will cause the offending method or constructor invocation to throw a ClassCastException.

Note that the ordering maintained by a sorted set (whether or not an explicit comparator is provided) must be consistent with equals if the sorted set is to correctly implement the Set interface. (See the Comparable interface or Comparator interface for a precise definition of consistent with equals.) This is so because the Set interface is defined in terms of the equals operation, but a sorted set performs all element comparisons using its compareTo (or compare) method, so two elements that are deemed equal by this method are, from the standpoint of the sorted set, equal. The behavior of a sorted set is well-defined even if its ordering is inconsistent with equals; it just fails to obey the general contract of the Set interface.

All general-purpose sorted set implementation classes should provide four "standard" constructors: 1) A void (no arguments) constructor, which creates an empty sorted set sorted according to the natural order of its elements. 2) A constructor with a single argument of type Comparator, which creates an empty sorted set sorted according to the specified comparator. 3) A constructor with a single argument of type Collection, which creates a new sorted set with the same elements as its argument, sorted according to the elements' natural ordering. 4) A constructor with a single argument of type SortedSet, which creates a new sorted set with the same elements and the same ordering as the input sorted set. There is no way to enforce this recommendation (as interfaces cannot contain constructors) but the JDK implementation (the TreeSet class) complies.

This interface is a member of the ../../../guide/collections/index.html"> Java Collections Framework.

Since:
1.2
See Also:
Set, TreeSet, SortedMap, Collection, Comparable, Comparator, ClassCastException

Method Summary

E
first()
Returns the first (lowest) element currently in this sorted set.
SortedSet
headSet(E toElement)
Returns a view of the portion of this sorted set whose elements are strictly less than toElement.
E
last()
Returns the last (highest) element currently in this sorted set.
SortedSet
subSet(E fromElement, E toElement)
Returns a view of the portion of this sorted set whose elements range from fromElement, inclusive, to toElement, exclusive.
Comparator
super E> comparator()
Returns the comparator associated with this sorted set, or null if it uses its elements' natural ordering.
SortedSet
tailSet(E fromElement)
Returns a view of the portion of this sorted set whose elements are greater than or equal to fromElement.

Methods inherited from interface java.util.Collection<E>

T[] toArray, add, addAll, clear, contains, containsAll, equals, hashCode, isEmpty, iterator, remove, removeAll, retainAll, size, toArray

Methods inherited from interface java.lang.Iterable<T>

iterator

Methods inherited from interface java.util.Set<E>

T[] toArray, add, addAll, clear, contains, containsAll, equals, hashCode, isEmpty, iterator, remove, removeAll, retainAll, size, toArray

Method Details

first

public E first()
Returns the first (lowest) element currently in this sorted set.
Returns:
the first (lowest) element currently in this sorted set.
Throws:
NoSuchElementException - sorted set is empty.
Usages and Demos :

View More Examples of first()
   1: import java.util.Comparator;
   2: import java.util.SortedSet;
   3: 
   4:         ...
   5: public class ReadOnlySortedSet extends ReadOnlySet implements SortedSet {
   6:         ...
   7:   private SortedSet inner;
   8: 
   9:         ...
  10:   public Object first() {
  11:     return inner.first();

View Full Code Here
   1: 
   2: import java.util.SortedSet;
   3: import java.util.TreeSet;
   4:         ...
   5:     private SessionPool3 sessions;
   6:     private SortedSet connectionQueue;
   7:     private Listener listener;
   8:         ...
   9:             }
  10:             k = (Connection) connectionQueue.first();
  11:             connectionQueue.remove(k);

View Full Code Here
   1: 
   2: import java.util.SortedSet;
   3: import java.util.TreeSet;
   4:         ...
   5:     public InterfaceDefinedMethodTestCase() {
   6:         SortedSet ss = new TreeSet();
   7: 
   8:         ...
   9:         s_log = "";
  10:         SortedSet ss = new TreeSet();

View Full Code Here
   1: 
   2: import java.util.SortedSet;
   3: import java.util.TreeSet;
   4:         ...
   5:     private SessionPool4 sessions;
   6:     private SortedSet connectionQueue;
   7:     private Listener listener;
   8:         ...
   9:             }
  10:             k = (Connection) connectionQueue.first();
  11:             connectionQueue.remove(k);

View Full Code Here
   1: 
   2: import java.util.SortedSet;
   3: import java.util.TreeSet;
   4:         ...
   5:     private SessionPool2 sessions;
   6:     private SortedSet connectionQueue;
   7:     private Listener listener;
   8:         ...
   9:             }
  10:             k = (Connection) connectionQueue.first();
  11:             connectionQueue.remove(k);

View Full Code Here

headSet

public SortedSet headSet(E toElement)
Returns a view of the portion of this sorted set whose elements are strictly less than toElement. The returned sorted set is backed by this sorted set, so changes in the returned sorted set are reflected in this sorted set, and vice-versa. The returned sorted set supports all optional set operations.

The sorted set returned by this method will throw an IllegalArgumentException if the user attempts to insert a element outside the specified range.

Note: this method always returns a view that does not contain its (high) endpoint. If you need a view that does contain this endpoint, and the element type allows for calculation of the successor a given value, merely request a headSet bounded by successor(highEndpoint). For example, suppose that s is a sorted set of strings. The following idiom obtains a view containing all of the strings in s that are less than or equal to high:

    SortedSet head = s.headSet(high+"\0");
Parameters:
toElement - high endpoint (exclusive) of the headSet.
Returns:
a view of the specified initial range of this sorted set.
Throws:
ClassCastException - if toElement is not compatible with this set's comparator (or, if the set has no comparator, if toElement does not implement Comparable). Implementations may, but are not required to, throw this exception if toElement cannot be compared to elements currently in the set.
NullPointerException - if toElement is null and this sorted set does not tolerate null elements.
IllegalArgumentException - if this set is itself a subSet, headSet, or tailSet, and toElement is not within the specified range of the subSet, headSet, or tailSet.
Usages and Demos :

View More Examples of headSet(E toElement)
   1: 
   2: public class SortedSetAdapter extends AbstractAdapter implements java.util.SortedSet, MappedObject, Serializable {
   3:         ...
   4:     transient private SortedSet datasortedset;
   5: 
   6:         ...
   7:     super.readObject(in);
   8:     datasortedset=(SortedSet)in.readObject();
   9:     }
  10:         ...
  11:     public SortedSet headSet(Object toElement) {
  12:     return datasortedset.headSet(toPersistentObject(toElement));

View Full Code Here
   1: import java.util.Random;
   2: import java.util.SortedSet;
   3: import java.util.TreeSet;
   4:         ...
   5:     public static void draw_tree (
   6:             MerkleTree.Node root, SortedSet keys, String prefix) {
   7: 
   8:         ...
   9:             if (keys != null) {
  10:                 SortedSet under_me = keys.headSet(high).tailSet (low);
  11: 
  12:         ...
  13: 
  14:             SortedSet under_me = keys.headSet(high).tailSet (low);

View Full Code Here
   1:         if (collection.size() > 0) {
   2:             assertEquals("Incorrect element returned by first().", first, ((SortedSet) collection).first());
   3:         ...
   4:             assertEquals("Incorrect element returned by last().", last, ((SortedSet) collection).last());
   5:         }
   6:         ...
   7: 
   8:     public SortedSet getConfirmedSortedSet() {
   9:         return (SortedSet) confirmed;
  10:         ...
  11:                 case TYPE_HEADSET:
  12:                     return set.headSet(elements[m_HighBound]);

View Full Code Here
   1: import java.util.Set;
   2: import java.util.SortedSet;
   3: import java.util.TreeSet;
   4:         ...
   5:             assertEquals("Incorrect element returned by first().", first,
   6:                 ((SortedSet) collection).first());
   7:             assertEquals("Incorrect element returned by last().", last,
   8:         ...
   9:                 ((SortedSet) collection).last());
  10:         }
  11:         ...
  12:                 case TYPE_HEADSET :
  13:                     return set.headSet(elements[m_HighBound]);

View Full Code Here
   1:     private static class MyTableModel extends AbstractTableModel {
   2:         private SortedSet rowSet = new TreeSet(propComparator);
   3:         private List rowList = new ArrayList();
   4:         ...
   5:         public void add(Property prop) {
   6:             int insertionRow = rowSet.headSet(prop).size();
   7:             rowSet.add(prop);
   8:         ...
   9:         public void updateRow(Property prop) {
  10:             int row = rowSet.headSet(prop).size();
  11:             fireTableRowsUpdated(row, row);

View Full Code Here

last

public E last()
Returns the last (highest) element currently in this sorted set.
Returns:
the last (highest) element currently in this sorted set.
Throws:
NoSuchElementException - sorted set is empty.
Usages and Demos :

View More Examples of last()
   1: import java.util.Comparator;
   2: import java.util.SortedSet;
   3: 
   4:         ...
   5: public class ReadOnlySortedSet extends ReadOnlySet implements SortedSet {
   6:         ...
   7:   private SortedSet inner;
   8: 
   9:         ...
  10:   public Object last() {
  11:     return inner.last();

View Full Code Here
   1: import java.util.Set;
   2: import java.util.SortedSet;
   3: import java.util.TreeSet;
   4:         ...
   5:     protected Long getNextAsLong() {
   6:         SortedSet set = (SortedSet) makeFullSet();
   7:         ...
   8:         int nextValue = ((Integer) set.last()).intValue() + 1;
   9:         return new Long(nextValue);
  10:         ...
  11:         SortedSet set = (SortedSet) makeFullSet();
  12:         int nextValue = ((Integer) set.last()).intValue() + 1;

View Full Code Here
   1: 
   2: public class SortedSetAdapter extends AbstractAdapter implements java.util.SortedSet, MappedObject, Serializable {
   3:         ...
   4:     transient private SortedSet datasortedset;
   5: 
   6:         ...
   7:     super.readObject(in);
   8:     datasortedset=(SortedSet)in.readObject();
   9:     }
  10:         ...
  11:     public Object last() {
  12:     return toNormalObject(datasortedset.last());

View Full Code Here
   1: import java.util.Set;
   2: import java.util.SortedSet;
   3: import java.util.TreeSet;
   4:         ...
   5:     protected Long getNextAsLong() {
   6:         SortedSet set = (SortedSet) makeFullSet();
   7:         ...
   8:         int nextValue = ((Integer)set.last()).intValue() + 1;
   9:         return new Long(nextValue);
  10:         ...
  11:         SortedSet set = (SortedSet) makeFullSet();
  12:         int nextValue = ((Integer)set.last()).intValue() + 1;

View Full Code Here
   1: import java.util.Set;
   2: import java.util.SortedSet;
   3: import java.util.TreeSet;
   4:         ...
   5:         }
   6:         SortedSet sortedSet = new TreeSet(set);
   7:         ...
   8:         return sortedSet.last();
   9:     }

View Full Code Here

subSet

public SortedSet subSet(E fromElement,
                           E toElement)
Returns a view of the portion of this sorted set whose elements range from fromElement, inclusive, to toElement, exclusive. (If fromElement and toElement are equal, the returned sorted set is empty.) The returned sorted set is backed by this sorted set, so changes in the returned sorted set are reflected in this sorted set, and vice-versa. The returned sorted set supports all optional set operations that this sorted set supports.

The sorted set returned by this method will throw an IllegalArgumentException if the user attempts to insert a element outside the specified range.

Note: this method always returns a half-open range (which includes its low endpoint but not its high endpoint). If you need a closed range (which includes both endpoints), and the element type allows for calculation of the successor a given value, merely request the subrange from lowEndpoint to successor(highEndpoint). For example, suppose that s is a sorted set of strings. The following idiom obtains a view containing all of the strings in s from low to high, inclusive:

 SortedSet sub = s.subSet(low, high+"\0");
 
A similar technique can be used to generate an open range (which contains neither endpoint). The following idiom obtains a view containing all of the Strings in s from low to high, exclusive:
 SortedSet sub = s.subSet(low+"\0", high);
 
Parameters:
fromElement - low endpoint (inclusive) of the subSet.
toElement - high endpoint (exclusive) of the subSet.
Returns:
a view of the specified range within this sorted set.
Throws:
ClassCastException - if fromElement and toElement cannot be compared to one another using this set's comparator (or, if the set has no comparator, using natural ordering). Implementations may, but are not required to, throw this exception if fromElement or toElement cannot be compared to elements currently in the set.
IllegalArgumentException - if fromElement is greater than toElement; or if this set is itself a subSet, headSet, or tailSet, and fromElement or toElement are not within the specified range of the subSet, headSet, or tailSet.
NullPointerException - if fromElement or toElement is null and this sorted set does not tolerate null elements.
Usages and Demos :

View More Examples of subSet(E fromElement,E toElement)
   1: import java.util.Iterator;
   2: import java.util.SortedSet;
   3: import java.util.TreeSet;
   4:         ...
   5:     private static Log log = LogFactory.getLog(ScheduleDTO.class);
   6:     private SortedSet entries = new TreeSet();
   7:     private String userEmail;
   8:         ...
   9:     public Iterator getScheduleEntries(Date rangeLow, Date rangeHi) {
  10:         return entries.subSet(rangeLow, rangeHi).iterator();
  11:     }
  12:         ...
  13:     public ScheduleEntryDTO getScheduleEntry(Date dateTime) {
  14:         SortedSet ss = entries.subSet(dateTime, dateTime);

View Full Code Here
   1:         if (collection.size() > 0) {
   2:             assertEquals("Incorrect element returned by first().", first, ((SortedSet) collection).first());
   3:         ...
   4:             assertEquals("Incorrect element returned by last().", last, ((SortedSet) collection).last());
   5:         }
   6:         ...
   7: 
   8:     public SortedSet getConfirmedSortedSet() {
   9:         return (SortedSet) confirmed;
  10:         ...
  11:                 case TYPE_SUBSET:
  12:                     return set.subSet(elements[m_LowBound], elements[m_HighBound]);

View Full Code Here
   1: import java.util.Set;
   2: import java.util.SortedSet;
   3: import java.util.TreeSet;
   4:         ...
   5:             assertEquals("Incorrect element returned by first().", first,
   6:                 ((SortedSet) collection).first());
   7:             assertEquals("Incorrect element returned by last().", last,
   8:         ...
   9:                 ((SortedSet) collection).last());
  10:         }
  11:         ...
  12:                 case TYPE_SUBSET :
  13:                     return set.subSet(elements[m_LowBound], elements[m_HighBound]);

View Full Code Here
   1: import java.util.ArrayList;
   2: import java.util.SortedSet;
   3: import java.util.Set;
   4:         ...
   5: 
   6:   private static SortedSet roots;
   7: 
   8:         ...
   9:   private static SortedSet exclusions;
  10: 
  11:         ...
  12: 
  13:     SortedSet langRoots = roots.subSet(J_LANG, endPackageRoot(J_LANG));

View Full Code Here

super E> comparator

public Comparatorsuper E> comparator()
Returns the comparator associated with this sorted set, or null if it uses its elements' natural ordering.
Returns:
the comparator associated with this sorted set, or null if it uses its elements' natural ordering.

tailSet

public SortedSet tailSet(E fromElement)
Returns a view of the portion of this sorted set whose elements are greater than or equal to fromElement. The returned sorted set is backed by this sorted set, so changes in the returned sorted set are reflected in this sorted set, and vice-versa. The returned sorted set supports all optional set operations.

The sorted set returned by this method will throw an IllegalArgumentException if the user attempts to insert a element outside the specified range.

Note: this method always returns a view that contains its (low) endpoint. If you need a view that does not contain this endpoint, and the element type allows for calculation of the successor a given value, merely request a tailSet bounded by successor(lowEndpoint). For example, suppose that s is a sorted set of strings. The following idiom obtains a view containing all of the strings in s that are strictly greater than low:

    SortedSet tail = s.tailSet(low+"\0");
Parameters:
fromElement - low endpoint (inclusive) of the tailSet.
Returns:
a view of the specified final range of this sorted set.
Throws:
ClassCastException - if fromElement is not compatible with this set's comparator (or, if the set has no comparator, if fromElement does not implement Comparable). Implementations may, but are not required to, throw this exception if fromElement cannot be compared to elements currently in the set.
NullPointerException - if fromElement is null and this sorted set does not tolerate null elements.
IllegalArgumentException - if this set is itself a subSet, headSet, or tailSet, and fromElement is not within the specified range of the subSet, headSet, or tailSet.
Usages and Demos :

View More Examples of tailSet(E fromElement)
   1: import java.util.Iterator;
   2: import java.util.SortedSet;
   3: 
   4:         ...
   5: 
   6:     public static Object find(SortedSet set, Object x) {
   7:         ...
   8:         SortedSet result = set.tailSet(x);
   9:         if (result.isEmpty()) return null;

View Full Code Here
   1: 
   2: public class SortedSetAdapter extends AbstractAdapter implements java.util.SortedSet, MappedObject, Serializable {
   3:         ...
   4:     transient private SortedSet datasortedset;
   5: 
   6:         ...
   7:     super.readObject(in);
   8:     datasortedset=(SortedSet)in.readObject();
   9:     }
  10:         ...
  11:     public SortedSet tailSet(Object fromElement) {
  12:     return datasortedset.tailSet(toPersistentObject(fromElement));

View Full Code Here
   1: import java.util.Set;
   2: import java.util.SortedSet;
   3: import java.util.TreeSet;
   4:         ...
   5:     private static final String DEBUG_NAME = INList.class.getName();
   6:     private SortedSet ins = null; 
   7:     private Set addedINs = null;
   8:         ...
   9: 
  10:     public SortedSet getINs() {
  11:     return ins;
  12:         ...
  13:     assert majorLatch.isOwner();
  14:     return ins.tailSet(in);

View Full Code Here
   1:         if (collection.size() > 0) {
   2:             assertEquals("Incorrect element returned by first().", first, ((SortedSet) collection).first());
   3:         ...
   4:             assertEquals("Incorrect element returned by last().", last, ((SortedSet) collection).last());
   5:         }
   6:         ...
   7: 
   8:     public SortedSet getConfirmedSortedSet() {
   9:         return (SortedSet) confirmed;
  10:         ...
  11:                 case TYPE_TAILSET:
  12:                     return set.tailSet(elements[m_LowBound]);

View Full Code Here
   1: import java.util.Set;
   2: import java.util.SortedSet;
   3: import java.util.TreeSet;
   4:         ...
   5:             assertEquals("Incorrect element returned by first().", first,
   6:                 ((SortedSet) collection).first());
   7:             assertEquals("Incorrect element returned by last().", last,
   8:         ...
   9:                 ((SortedSet) collection).last());
  10:         }
  11:         ...
  12:                 case TYPE_TAILSET :
  13:                     return set.tailSet(elements[m_LowBound]);

View Full Code Here