--- jsr166/src/main/java/util/TreeSet.java 2005/04/18 05:18:29 1.6 +++ jsr166/src/main/java/util/TreeSet.java 2005/05/02 08:35:49 1.7 @@ -210,18 +210,18 @@ public class TreeSet /** * Adds the specified element to this set if it is not already present. * - * @param o element to be added to this set. + * @param e element to be added to this set. * @return true if the set did not already contain the specified * element. * * @throws ClassCastException if the specified object cannot be compared * with the elements currently in the set. - * @throws NullPointerException if o is null and this map + * @throws NullPointerException if e is null and this map * uses natural ordering and is non-empty, or its comparator does * not tolerate null keys. */ - public boolean add(E o) { - return m.put(o, PRESENT)==null; + public boolean add(E e) { + return m.put(e, PRESENT)==null; } /** @@ -511,68 +511,68 @@ public class TreeSet * Returns an element greater than or equal to the given element, or * null if there is no such element. * - * @param o the value to match + * @param e the value to match * @return an element greater than or equal to given element, or * null if there is no such element. - * @throws ClassCastException if o cannot be compared with the elements + * @throws ClassCastException if e cannot be compared with the elements * currently in the set. - * @throws NullPointerException if o is null and this map + * @throws NullPointerException if e is null and this map * uses natural ordering and is non-empty, or its comparator does * not tolerate null keys. */ - public E ceiling(E o) { - return m.ceilingKey(o); + public E ceiling(E e) { + return m.ceilingKey(e); } /** * Returns an element strictly less than the given element, or * null if there is no such element. * - * @param o the value to match + * @param e the value to match * @return the greatest element less than the given element, or * null if there is no such element. - * @throws ClassCastException if o cannot be compared with the elements + * @throws ClassCastException if e cannot be compared with the elements * currently in the set. - * @throws NullPointerException if o is null and this map + * @throws NullPointerException if e is null and this map * uses natural ordering and is non-empty, or its comparator does * not tolerate null keys. */ - public E lower(E o) { - return m.lowerKey(o); + public E lower(E e) { + return m.lowerKey(e); } /** * Returns an element less than or equal to the given element, or * null if there is no such element. * - * @param o the value to match + * @param e the value to match * @return the greatest element less than or equal to given * element, or null if there is no such element. - * @throws ClassCastException if o cannot be compared with the elements + * @throws ClassCastException if e cannot be compared with the elements * currently in the set. - * @throws NullPointerException if o is null and this map + * @throws NullPointerException if e is null and this map * uses natural ordering and is non-empty, or its comparator does * not tolerate null keys. */ - public E floor(E o) { - return m.floorKey(o); + public E floor(E e) { + return m.floorKey(e); } /** * Returns an element strictly greater than the given element, or * null if there is no such element. * - * @param o the value to match + * @param e the value to match * @return the least element greater than the given element, or * null if there is no such element. - * @throws ClassCastException if o cannot be compared with the elements + * @throws ClassCastException if e cannot be compared with the elements * currently in the set. - * @throws NullPointerException if o is null and this map + * @throws NullPointerException if e is null and this map * uses natural ordering and is non-empty, or its comparator does * not tolerate null keys. */ - public E higher(E o) { - return m.higherKey(o); + public E higher(E e) { + return m.higherKey(e); } /**