com.helger.xml.RecursiveNodeIterator Maven / Gradle / Ivy

Go to download
Show more of this group Show more artifacts with this name
Show all versions of ph-xml Show documentation
Java 1.8+ Library with XML handling routines
The newest version!
/*
 * Copyright (C) 2014-2024 Philip Helger (www.helger.com)
 * philip[at]helger[dot]com
 *
 * Licensed under the Apache License, Version 2.0 (the "License");
 * you may not use this file except in compliance with the License.
 * You may obtain a copy of the License at
 *
 *         http://www.apache.org/licenses/LICENSE-2.0
 *
 * Unless required by applicable law or agreed to in writing, software
 * distributed under the License is distributed on an "AS IS" BASIS,
 * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
 * See the License for the specific language governing permissions and
 * limitations under the License.
 */
package com.helger.xml;

import java.util.NoSuchElementException;

import javax.annotation.Nonnull;

import org.w3c.dom.Node;
import org.w3c.dom.NodeList;

import com.helger.commons.ValueEnforcer;
import com.helger.commons.collection.impl.CommonsArrayList;
import com.helger.commons.collection.impl.ICommonsList;
import com.helger.commons.collection.iterate.IIterableIterator;
import com.helger.commons.string.ToStringGenerator;

/**
 * Iterate all children of the start node, but NOT the start node itself.
 *
 * @author Philip Helger
 * @since 10.1.7
 */
public class RecursiveNodeIterator implements IIterableIterator 
{
  private final ICommonsList  m_aOpen = new CommonsArrayList <> ();

  public RecursiveNodeIterator (@Nonnull final Node aNode)
  {
    ValueEnforcer.notNull (aNode, "Node");
    m_aOpen.add (aNode);
  }

  public boolean hasNext ()
  {
    return m_aOpen.isNotEmpty ();
  }

  @Nonnull
  public Node next ()
  {
    if (m_aOpen.isEmpty ())
      throw new NoSuchElementException ();

    final Node ret = m_aOpen.remove (0);
    final NodeList aChildren = ret.getChildNodes ();
    if (aChildren != null)
    {
      final int nChildCount = aChildren.getLength ();
      int nTarget = 0;
      for (int i = 0; i < nChildCount; ++i)
      {
        m_aOpen.add (nTarget, aChildren.item (i));
        nTarget++;
      }
    }
    return ret;
  }

  @Override
  public String toString ()
  {
    return new ToStringGenerator (this).append ("Open", m_aOpen).getToString ();
  }

  /**
   * Create a {@link RecursiveNodeIterator} that only iterates the child nodes
   * of the given node.
   *
   * @param aNode
   *        The node to iterate the children from. May not be null.
   * @return Never null.
   */
  @Nonnull
  public static RecursiveNodeIterator createChildNodeIterator (@Nonnull final Node aNode)
  {
    // Create a regular one
    final RecursiveNodeIterator ret = new RecursiveNodeIterator (aNode);
    // But skip the root
    ret.next ();
    return ret;
  }
}