simpleoperatorchain.java

著名的开源仿真软件yale

/*
 *  YALE - Yet Another Learning Environment
 *  Copyright (C) 2002, 2003
 *      Simon Fischer, Ralf Klinkenberg, Ingo Mierswa, 
 *          Katharina Morik, Oliver Ritthoff
 *      Artificial Intelligence Unit
 *      Computer Science Department
 *      University of Dortmund
 *      44221 Dortmund,  Germany
 *  email: [e-mail]
 *  web:   http://yale.cs.uni-dortmund.de/
 *
 *  This program 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. 
 *
 *  This program 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 this program; if not, write to the Free Software
 *  Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307
 *  USA.
 */
package edu.udo.cs.yale.operator;

/** A simple operator chain which can have an arbitrary number of inner operators.
 *  The operators are subsequently applied and their output is used as input for the 
 *  succeeding operator. The input of the operator chain is used as input for the first
 *  inner operator and the output of the last operator is used as the output of
 *  the operator chain.
 *
 *  @yale.xmlclass OperatorChain
 *  @author Ingo
 *  @version $Id: SimpleOperatorChain.java,v 2.5 2003/07/03 16:01:30 fischer Exp $
 */
final public class SimpleOperatorChain extends OperatorChain {

    /** Creates an empty operator chain. */
    public SimpleOperatorChain() {
	super();
    }

    /** Returns the highest possible value for the maximum number of innner operators. */
    public int getMaxNumberOfInnerOperators() { return Integer.MAX_VALUE; }
    /** Returns 0 for the minimum number of innner operators. */
    public int getMinNumberOfInnerOperators() { return 0; }

    public int getNumberOfSteps() {
	return getNumberOfChildrensSteps() + 1;
    }



    public Class[] getInputClasses() {
	return new Class[0];
    }

    public Class[] getOutputClasses() {
	return new Class[0];
    }

    /** Returns true if and only if all inner operators accept their precessors' ouput
     *  as input. */
    public Class[] checkIO(Class[] input) throws IllegalInputException {
	for (int i = 0; i < getNumberOfOperators(); i++) {
	    Operator o = getOperator(i);
	    input = o.checkIO(input);
	}
	return input;
    }

}