< prev index next >

src/java.desktop/share/classes/javax/swing/text/ElementIterator.java

Print this page

        

@@ -195,11 +195,11 @@
 
     /**
      * Fetches the current Element.
      *
      * @return element on top of the stack or
-     *          <code>null</code> if the root element is <code>null</code>
+     *          {@code null} if the root element is {@code null}
      */
     public Element current() {
 
         if (elementStack == null) {
             return first();

@@ -226,11 +226,11 @@
     /**
      * Fetches the next Element. The strategy
      * used to locate the next element is
      * a depth-first search.
      *
-     * @return the next element or <code>null</code>
+     * @return the next element or {@code null}
      *          at the end of the list.
      */
     public Element next() {
 
         /* if current() has not been invoked

@@ -286,11 +286,11 @@
     /**
      * Fetches the previous Element. If however the current
      * element is the last element, or the current element
      * is null, then null is returned.
      *
-     * @return previous <code>Element</code> if available
+     * @return previous {@code Element} if available
      *
      */
     public Element previous() {
 
         int stackSize;

@@ -333,11 +333,11 @@
         // should never get here.
         return null;
     }
 
     /**
-     * Returns the last child of <code>parent</code> that is a leaf. If the
+     * Returns the last child of {@code parent} that is a leaf. If the
      * last child is a not a leaf, this method is called with the last child.
      */
     private Element getDeepestLeaf(Element parent) {
         if (parent.isLeaf()) {
             return parent;
< prev index next >