for (int n = visibleNodes.getLength(), nodeDepth = youngerSibling.depth; insertIndex < n && visibleNodes.get(insertIndex).depth > nodeDepth;
-                    insertIndex++);
+                    insertIndex++) {
+                }
            }


This could also be written as a while loop, where the index is incremented within the block (eliminating the empty braces).

Reply via email to