Reformat project

1 files changed, 14 insertions, 6 deletions

diff --git a/server/src/org/jsoup/select/NodeTraversor.java b/server/src/org/jsoup/select/NodeTraversor.java
index 9bb081e56c..f94a7762fc 100644
--- a/server/src/org/jsoup/select/NodeTraversor.java
+++ b/server/src/org/jsoup/select/NodeTraversor.java
@@ -3,16 +3,21 @@ package org.jsoup.select;
 import org.jsoup.nodes.Node;
 
 /**
- * Depth-first node traversor. Use to iterate through all nodes under and including the specified root node.
+ * Depth-first node traversor. Use to iterate through all nodes under and
+ * including the specified root node.
  * <p/>
- * This implementation does not use recursion, so a deep DOM does not risk blowing the stack.
+ * This implementation does not use recursion, so a deep DOM does not risk
+ * blowing the stack.
  */
 public class NodeTraversor {
     private NodeVisitor visitor;
 
     /**
      * Create a new traversor.
-     * @param visitor a class implementing the {@link NodeVisitor} interface, to be called when visiting each node.
+     * 
+     * @param visitor
+     *            a class implementing the {@link NodeVisitor} interface, to be
+     *            called when visiting each node.
      */
     public NodeTraversor(NodeVisitor visitor) {
         this.visitor = visitor;
@@ -20,12 +25,14 @@ public class NodeTraversor {
 
     /**
      * Start a depth-first traverse of the root and all of its descendants.
-     * @param root the root node point to traverse.
+     * 
+     * @param root
+     *            the root node point to traverse.
      */
     public void traverse(Node root) {
         Node node = root;
         int depth = 0;
-        
+
         while (node != null) {
             visitor.head(node, depth);
             if (node.childNodes().size() > 0) {
@@ -38,8 +45,9 @@ public class NodeTraversor {
                     depth--;
                 }
                 visitor.tail(node, depth);
-                if (node == root)
+                if (node == root) {
                     break;
+                }
                 node = node.nextSibling();
             }
         }