/*

     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 11.01.2005

  *

  */

 package net.sourceforge.combean.test.helpers.checks;

 import java.util.Iterator;

 import junit.framework.Assert;

 import net.sourceforge.combean.graph.iterators.EdgeIteratorAsIterator;

 import net.sourceforge.combean.graph.iterators.NodeIteratorAsIterator;

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

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

 import net.sourceforge.combean.interfaces.graph.containers.doubleval.FixedDoubleEdgeMap;

 import net.sourceforge.combean.interfaces.graph.prop.GlobalNumberedEdgesGraphProp;

 /**

  * @author schickin

  *

  */

 public class CheckGraph {

         /**

          * Check a NodeIterator for termination after a given number of iterations

          * @see Check#checkNumIterations(Iterator, long)

          * 

          * @param it the iterator

          * @param numIterations the expected number of iterations.

          */

         public static final void checkNumIterations(NodeIterator it, long numIterations) {

                 Check.checkNumIterations(new NodeIteratorAsIterator(it), numIterations);

         }

         /**

          * Check an EdgeIterator for termination after a given number of iterations

          * @see Check#checkNumIterations(Iterator, long)

          * 

          * @param it the iterator

          * @param numIterations the expected number of iterations.

          */

         public static final void checkNumIterations(EdgeIterator it, long numIterations) {

                 Check.checkNumIterations(new EdgeIteratorAsIterator(it), numIterations);

         }

         /**

          * @see Check#checkIdenticalIterations(Iterator, Iterator)

          * 

          * @param itOne

          * @param itTwo

          */

         public static final void checkIdenticalIterations(

                 NodeIterator itOne, NodeIterator itTwo) {

             Check.checkIdenticalIterations(new NodeIteratorAsIterator(itOne),

                     new NodeIteratorAsIterator(itTwo));

         }

         /**

          * @see Check#checkIdenticalIterations(Iterator, Iterator)

          * @param itOne

          * @param itTwo

          */

         public static final void checkIdenticalIterations(

                 EdgeIterator itOne, EdgeIterator itTwo) {

             Check.checkIdenticalIterations(new EdgeIteratorAsIterator(itOne),

                     new EdgeIteratorAsIterator(itTwo));

         }

         public static final void checkDoubleEdgeMap(GlobalNumberedEdgesGraphProp g,

                 FixedDoubleEdgeMap edgeMap,

                 double[] predefinedValues, double tolerance) {

             Assert.assertEquals(predefinedValues.length, g.getNumEdges());

             for (int i = 0; i < g.getNumEdges(); i++) {

                 Assert.assertEquals("edge #" + i + " must have predefined value",

                         predefinedValues[i],

                         edgeMap.getDouble(g.getEdge(i)),

                         tolerance);

             }

         }

 }