/*

     This file is part of Combean.

     Combean is free software; you can redistribute it and/or modify

     it under the terms of the GNU General Public License as published by

     the Free Software Foundation; either version 2 of the License, or

     (at your option) any later version.

     Combean is distributed in the hope that it will be useful,

     but WITHOUT ANY WARRANTY; without even the implied warranty of

     MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the

     GNU General Public License for more details.

     You should have received a copy of the GNU General Public License

     along with Combean; if not, write to the Free Software

     Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA  02110-1301  USA

 */

 /*

  * Created on 21.03.2005

  *

  */

 package net.sourceforge.combean.graph.iterators;

 import net.sourceforge.combean.interfaces.graph.Edge;

 import net.sourceforge.combean.interfaces.graph.EdgeIterator;

 /**

  * @author schickin

  *

  */

 public class CombinedPairEdgeIterator implements EdgeIterator {

     private EdgeIterator itFirst = null;

     private EdgeIterator itSecond = null;

     /**

      * 

      */

     public CombinedPairEdgeIterator(EdgeIterator itFirst,

             EdgeIterator itSecond) {

         super();

         this.itFirst = itFirst;

         this.itSecond = itSecond;

     }

     public boolean hasNext() {

          return this.itFirst.hasNext() || this.itSecond.hasNext();

     }

     public Edge next() {

         if (this.itFirst.hasNext()) {

             return this.itFirst.next();

         }

         if (this.itSecond.hasNext()) {

             return this.itSecond.next();

         }

         return null;

     }

 }