mancaraddfunction.java~

Java遗传算法库

package jaga.pj.circuits.experiment;

import jaga.SampleData;
import jaga.experiment.ExperimentLib;

/** Some function is an arbitrary boolean function of 3 inputs (A,B,C,D)
 * where Q = ~( ~( A ^ B ) ^ C ) & D
 *
 * (btw this is output of manchester carry adder with enable D)
 * @author  unknown
 * @version 
 */
public class ManCarAddFunction implements BooleanFunction {

    /** Creates new SomeFunction */
    public ManCarAddFunction() {
    }

    /** returns the result of this function given the inputs in the array
     * @param inputs what values the inputs to the function have
     */
    public boolean getResult(boolean[] inputs) {
        return !( !( inputs[0]^inputs[1] ) ^ inputs[2] ) && inputs[3];
    }
    
    /** returns the amount of inputs needed to compute this function
     */
    public int getNumOfInputs() {
        return 4;
    }
    
    /** returns a set of BitSets providing a good set of input samples
     * to test this function
     */
    public SampleData[] getTestData() {
        SampleData[] complete = ExperimentLib.generateCompleteTest( getNumOfInputs() );
        // copy the last 8 of the at end inverted
        int completeLength = complete[ 0 ].length();
        for( int il = 0 ; il < 4; il++ )
        {
            complete[ il ].setLength( completeLength + 8 );
            for( int idl = 0; idl < 8; idl++ )
            {
                complete[ il ].setTo( completeLength + idl , complete[ il ].get( completeLength - idl ) );
            }
        }
        return complete;
    }
}