Module java.desktop

Class ElementIterator

All Implemented Interfaces:

public class ElementIterator extends Object implements Cloneable
ElementIterator, as the name suggests, iterates over the Element tree. The constructor can be invoked with either Document or an Element as an argument. If the constructor is invoked with a Document as an argument then the root of the iteration is the return value of document.getDefaultRootElement().

The iteration happens in a depth-first manner. In terms of how boundary conditions are handled:

The ElementIterator does no locking of the Element tree. This means that it does not track any changes. It is the responsibility of the user of this class, to ensure that no changes happen during element iteration.

Simple usage example:

public void iterate() {
      ElementIterator it = new ElementIterator(root);
      Element elem;
      while (true) {
          if ((elem = != null) {
              // process element
              System.out.println("elem: " + elem.getName());
          } else {
  • Constructor Details

    • ElementIterator

      public ElementIterator(Document document)
      Creates a new ElementIterator. The root element is taken to get the default root element of the document.
      document - a Document
    • ElementIterator

      public ElementIterator(Element root)
      Creates a new ElementIterator.
      root - the root Element
  • Method Details

    • clone

      public Object clone()
      Clones the ElementIterator.
      clone in class Object
      a cloned ElementIterator Object
      See Also:
    • first

      public Element first()
      Fetches the first element.
      an Element
    • depth

      public int depth()
      Fetches the current depth of element tree.
      the depth
    • current

      public Element current()
      Fetches the current Element.
      element on top of the stack or null if the root element is null
    • next

      public Element next()
      Fetches the next Element. The strategy used to locate the next element is a depth-first search.
      the next element or null at the end of the list
    • previous

      public Element previous()
      Fetches the previous Element. If however the current element is the last element, or the current element is null, then null is returned.
      previous Element if available