iteratingoperatorchain.java

来自「一个很好的LIBSVM的JAVA源码。对于要研究和改进SVM算法的学者。可以参考」· Java 代码 · 共 87 行

JAVA
87
字号
/*
 *  YALE - Yet Another Learning Environment
 *  Copyright (C) 2001-2004
 *      Simon Fischer, Ralf Klinkenberg, Ingo Mierswa, 
 *          Katharina Morik, Oliver Ritthoff
 *      Artificial Intelligence Unit
 *      Computer Science Department
 *      University of Dortmund
 *      44221 Dortmund,  Germany
 *  email: yale-team@lists.sourceforge.net
 *  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;

import edu.udo.cs.yale.tools.LogService;
import edu.udo.cs.yale.operator.parameter.*;

import java.util.*;

/** Performs its inner operators for the defined number of times.
 *
 *  @author ingo
 *  @version $Id: IteratingOperatorChain.java,v 2.3 2004/08/27 11:57:34 ingomierswa Exp $
 */
public class IteratingOperatorChain extends OperatorChain {

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

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

    public IOObject[] apply() throws OperatorException {
	int start = getParameterAsInt("start");
	int end = getParameterAsInt("end");
	for (int i = start; i <= end; i++)
	    super.apply();
	return new IOObject[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);
	    if (o.isEnabled())
		input = o.checkIO(input);
	}
	return input;
    }

    public int getNumberOfSteps() {
	int start = getParameterAsInt("start");
	int end = getParameterAsInt("end");
	return (end - start) * getNumberOfChildrensSteps() + 1;
    }

    public List getParameterTypes() {
	List types = super.getParameterTypes();
	ParameterType type = new ParameterTypeInt("start", "The start value for the iteration", 0, Integer.MAX_VALUE, 0);
	type.setExpert(false);
	types.add(type);
	type = new ParameterTypeInt("end", "The end value for the iteration", 1, Integer.MAX_VALUE, 10);
	type.setExpert(false);
	types.add(type);
	return types;
    }
}

⌨️ 快捷键说明

复制代码Ctrl + C
搜索代码Ctrl + F
全屏模式F11
增大字号Ctrl + =
减小字号Ctrl + -
显示快捷键?