addclockcsriexperiment.java

来自「Java遗传算法库」· Java 代码 · 共 53 行

/*
 * AddClockCSRIExperiment.java
 *
 * Created on 25 November 2003, 16:40
 */

package jaga.pj.circuits.experiment;

/**
 *
 * @author  mmg20
 */
public class AddClockCSRIExperiment extends AddClockCRIExperiment implements ConfigurableSequentialCircuitExperiment {
    
    protected ConfigurableSequentialCircuitExperiment csce;
    
    /** Creates a new instance of AddClockCSRIExperiment */
    public AddClockCSRIExperiment( ConfigurableSequentialCircuitExperiment csce, int cyclesPerSample ) {
        super( csce, cyclesPerSample );
        this.csce = csce;
    }

    /** Creates a new instance of AddClockCSRIExperiment */
    public AddClockCSRIExperiment( ConfigurableSequentialCircuitExperiment csce ) {
        super( csce );
        this.csce = csce;
    }    
    
    /** @return Array of positions in last test pattern generated of when the tested FSM - if perfect -
     * would enter each state.  So State N is entered at input data position rv[ N ].  The order of states
     * is not important as long as rv[ i ] != rv[ j ] for i != j
     */
    public int[] getStateEnterPos() {
        int[] rv = csce.getStateEnterPos();
        for( int el = 0; el < rv.length; el++ )
        {
            //System.out.println(el + " was " + rv[ el ] + " now is " + ( rv[ el ] * 2 * cyclesPerSample ) ); //D
            rv[ el ] *= 2 * cyclesPerSample;
        }
        return rv;
    }
    
    public int rndStatePos() {
        return csce.rndStatePos() * 2 * cyclesPerSample;
    }
    
    public MealyFSMNode[] getStateGraphNodes()
    {
        return csce.getStateGraphNodes();
    }
    
}