Print this page


Split Close
Expand all
Collapse all
          --- old/src/share/classes/java/util/TreeSet.java
          +++ new/src/share/classes/java/util/TreeSet.java
↓ open down ↓ 444 lines elided ↑ open up ↑
 445  445       */
 446  446      public E higher(E e) {
 447  447          return m.higherKey(e);
 448  448      }
 449  449  
 450  450      /**
 451  451       * @since 1.6
 452  452       */
 453  453      public E pollFirst() {
 454  454          Map.Entry<E,?> e = m.pollFirstEntry();
 455      -        return (e == null)? null : e.getKey();
      455 +        return (e == null) ? null : e.getKey();
 456  456      }
 457  457  
 458  458      /**
 459  459       * @since 1.6
 460  460       */
 461  461      public E pollLast() {
 462  462          Map.Entry<E,?> e = m.pollLastEntry();
 463      -        return (e == null)? null : e.getKey();
      463 +        return (e == null) ? null : e.getKey();
 464  464      }
 465  465  
 466  466      /**
 467  467       * Returns a shallow copy of this {@code TreeSet} instance. (The elements
 468  468       * themselves are not cloned.)
 469  469       *
 470  470       * @return a shallow copy of this set
 471  471       */
 472  472      public Object clone() {
 473  473          TreeSet<E> clone = null;
↓ open down ↓ 66 lines elided ↑ open up ↑
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX