ViewVC Help
View File | Revision Log | Show Annotations | Download File | Root Listing
root/jsr166/jsr166/src/main/java/util/TreeSet.java
(Generate patch)

Comparing jsr166/src/main/java/util/TreeSet.java (file contents):
Revision 1.11 by jsr166, Mon May 16 08:13:36 2005 UTC vs.
Revision 1.13 by jsr166, Tue May 17 07:29:01 2005 UTC

# Line 106 | Line 106 | public class TreeSet<E>
106      }
107  
108      /**
109 <     * Constructs a new, empty tree set, sorted according to the
110 <     * specified comparator.  All elements inserted into the set must
111 <     * be <i>mutually comparable</i> by the specified comparator:
112 <     * <tt>comparator.compare(e1, e2)</tt> must not throw a
113 <     * <tt>ClassCastException</tt> for any elements <tt>e1</tt> and
114 <     * <tt>e2</tt> in the set.  If the user attempts to add an element
115 <     * to the set that violates this constraint, the
116 <     * <tt>add(Object)</tt> call will throw a
117 <     * <tt>ClassCastException</tt>.
109 >     * Constructs a new, empty tree set, sorted according to the specified
110 >     * comparator.  All elements inserted into the set must be <i>mutually
111 >     * comparable</i> by the specified comparator: <tt>comparator.compare(e1,
112 >     * e2)</tt> must not throw a <tt>ClassCastException</tt> for any elements
113 >     * <tt>e1</tt> and <tt>e2</tt> in the set.  If the user attempts to add
114 >     * an element to the set that violates this constraint, the
115 >     * <tt>add(Object)</tt> call will throw a <tt>ClassCastException</tt>.
116       *
117       * @param comparator the comparator that will be used to order this set.
118       *        If <tt>null</tt>, the {@linkplain Comparable natural
# Line 125 | Line 123 | public class TreeSet<E>
123      }
124  
125      /**
126 <     * Constructs a new tree set containing the elements in the
127 <     * specified collection, sorted according to the <i>natural
128 <     * ordering</i> of its elements.  All elements inserted into the
129 <     * set must implement the {@link Comparable} interface.
130 <     * Furthermore, all such elements must be <i>mutually
133 <     * comparable</i>: <tt>e1.compareTo(e2)</tt> must not throw a
126 >     * Constructs a new tree set containing the elements in the specified
127 >     * collection, sorted according to the <i>natural ordering</i> of its
128 >     * elements.  All elements inserted into the set must implement the
129 >     * {@link Comparable} interface.  Furthermore, all such elements must be
130 >     * <i>mutually comparable</i>: <tt>e1.compareTo(e2)</tt> must not throw a
131       * <tt>ClassCastException</tt> for any elements <tt>e1</tt> and
132       * <tt>e2</tt> in the set.
133       *
# Line 157 | Line 154 | public class TreeSet<E>
154      }
155  
156      /**
157 <     * Returns an iterator over the elements in this set.  The elements
161 <     * are returned in ascending order.
157 >     * Returns an iterator over the elements in this set in ascending order.
158       *
159 <     * @return an iterator over the elements in this set
159 >     * @return an iterator over the elements in this set in ascending order
160       */
161      public Iterator<E> iterator() {
162          return m.keySet().iterator();
163      }
164  
165      /**
166 <     * Returns an iterator over the elements in this set.  The elements
171 <     * are returned in descending order.
166 >     * Returns an iterator over the elements in this set in descending order.
167       *
168 <     * @return an iterator over the elements in this set
168 >     * @return an iterator over the elements in this set in descending order
169       */
170      public Iterator<E> descendingIterator() {
171          return m.descendingKeySet().iterator();

Diff Legend

Removed lines
+ Added lines
< Changed lines
> Changed lines