path: root/src/jcgp/JCGP.java

package jcgp;

import java.util.HashMap;
import java.util.Iterator;
import java.util.Map;
import java.util.Map.Entry;
import java.util.Random;

import javafx.beans.property.Property;
import jcgp.function.Arithmetic;
import jcgp.function.BitwiseLogic;
import jcgp.function.BooleanLogic;
import jcgp.function.Function;
import jcgp.function.FunctionSet;
import jcgp.modules.ea.EvolutionaryAlgorithm;
import jcgp.modules.ea.StandardEA;
import jcgp.modules.fitness.FitnessFunction;
import jcgp.modules.fitness.TestCase;
import jcgp.modules.fitness.TestCaseEvaluator;
import jcgp.modules.mutator.Mutator;
import jcgp.modules.mutator.PointMutator;
import jcgp.parameters.BooleanParameter;
import jcgp.parameters.IntegerParameter;
import jcgp.parameters.Parameter;
import jcgp.population.Population;

public class JCGP {

	/**
	 * 
	 * 
	 * @author Eduardo Pedroni
	 *
	 */
	public static class Resources {
		private HashMap<String, Parameter> parameters = new HashMap<String, Parameter>();

		private Random numberGenerator;
		
		private TestCase[] testCases;
		
		// function sets
		private FunctionSet[] functionSets =  new FunctionSet[] {
				new Arithmetic(),
				new BitwiseLogic(),
				new BooleanLogic() };
		private FunctionSet functionSet = functionSets[0];
		
		public Resources() {
			createCoreParameters();
			
			numberGenerator = new Random((int) get("seed"));
			
			set("arity", functionSet.getMaxArity());
		}
		
		public Object get(String key) {
			return parameters.get(key).getValue();
		}
		
		public int getInt(String key) {
			return (int) parameters.get(key).getValue();
		}
		
		public double getDouble(String key) {
			return (double) parameters.get(key).getValue();
		}
		
		public boolean getBoolean(String key) {
			return (boolean) parameters.get(key).getValue();
		}
		
		public void set(String key, Object value) {
			parameters.get(key).setValue(value);
		}
		
		public Property<?> getProperty(String key) {
			return parameters.get(key).valueProperty();
		}
		
		public Parameter getParameter(String key) {
			return parameters.get(key);
		}
		
		public void setManagedParameter(String key, boolean value) {
			parameters.get(key).setManaged(value);
		}
		
		public void setHiddenParameter(String key, boolean value) {
			parameters.get(key).setHidden(value);
		}
		
		public boolean contains(String key) {
			return parameters.containsKey(key);
		}
		
		private void createCoreParameters() {		
			parameters.put("rows", new IntegerParameter(8, "Rows"));
			parameters.put("columns", new IntegerParameter(9, "Columns"));
			parameters.put("inputs", new IntegerParameter(3, "Inputs"));
			parameters.put("outputs", new IntegerParameter(3, "Outputs"));
			parameters.put("popSize", new IntegerParameter(5, "Population"));
			parameters.put("levelsBack", new IntegerParameter(2, "Levels back"));
			
			parameters.put("nodes", new IntegerParameter(72, "Nodes", true, true));
			
			parameters.put("generations", new IntegerParameter(1000000, "Generations"));
			parameters.put("currentGen", new IntegerParameter(0, "Generation", true, false));
			parameters.put("runs", new IntegerParameter(5, "Runs"));

			parameters.put("arity", new IntegerParameter(0, "Max arity", true, true));

			parameters.put("seed", new IntegerParameter(123, "Seed"));
			
			parameters.put("debug", new BooleanParameter(false, "Debug"));
			parameters.put("report", new IntegerParameter(1, "Report"));
		}
		
		// TODO fix this up
		private void resetParameters(EvolutionaryAlgorithm ea, Mutator mu, FitnessFunction ff) {
			Iterator<Entry<String, Parameter>> it = parameters.entrySet().iterator();
		    while (it.hasNext()) {
		    	((Parameter) ((Map.Entry<String, Parameter>) it.next()).getValue()).reset();
		    }
		}

		/**
		 * 
		 * 
		 * @return the iterator for the set of base parameters
		 */
		public Iterator<Entry<String, Parameter>> iterator() {
			return parameters.entrySet().iterator();
		}
		
		/*
		 * Utility functions
		 */
		public int getRandomInt(int limit) {
			return numberGenerator.nextInt(limit);
		}
		
		public double getRandomDouble(int limit) {
			return numberGenerator.nextDouble() * limit;
		}
		
		public double getRandomDouble() {
			return numberGenerator.nextDouble();
		}
		
		/*
		 * FunctionSet functions
		 */
		public Function getRandomFunction() {
			return functionSet.getFunction(numberGenerator.nextInt(functionSet.getAllowedFunctionCount()));
		}

		public Function getFunction(int index) {
			return functionSet.getFunction(index);
		}
		
		public void setFunctionSet(int index) {
			functionSet = functionSets[index];
		}
		
		/**
		 * @return the functionSets
		 */
		public FunctionSet[] getFunctionSets() {
			return functionSets;
		}

		/**
		 * @return the functionSet
		 */
		public FunctionSet getFunctionSet() {
			return functionSet;
		}
		
		/*
		 * Test cases
		 */
		public void setTestCases(TestCase ... testCases) {
			this.testCases = testCases;
		}

		public TestCase getTestCase(int index) {
			return testCases[index];
		}

		public int getTestCaseCount() {
			return testCases.length;
		}
	}
	
	private Resources resources = new Resources();
	
	/*
	 * The following arrays contain all available modules. These collections are read by the GUI
	 * when generating menus, so modules not added here will *NOT* be selectable in the GUI.
	 * 
	 * Each array is accompanied by a field which contains a reference to the currently selected
	 * module, 0 by default.
	 */
	// mutators
	private Mutator[] mutators = new Mutator[] {
			new PointMutator() };
	private Mutator mutator = mutators[0];
	
	// evolutionary algorithms
	private EvolutionaryAlgorithm[] evolutionaryAlgorithms = new EvolutionaryAlgorithm[] {
			new StandardEA() };
	private EvolutionaryAlgorithm evolutionaryAlgorithm = evolutionaryAlgorithms[0];
	
	// fitness evaluators
	private FitnessFunction[] fitnessFunctions = new FitnessFunction[] {
			new TestCaseEvaluator() };
	private FitnessFunction fitnessFunction = fitnessFunctions[0];

	// the population of chromosomes	
	private Population population = new Population(resources);


	public JCGP() {
		
		resources.setTestCases(new TestCase(new Integer[]{1, 2, 3}, new Integer[]{4, 5, 6}),
							   new TestCase(new Integer[]{1, 12, 4}, new Integer[]{6, 21, 2}));
		
//		for (int i = 0; i < (int) resources.get("generations"); i++) {
//			
//			resources.set("currentGen", ((int) resources.get("currentGen")) + 1);
//			
//			fitnessFunction.evaluate(population, resources);
//			evolutionaryAlgorithm.evolve(population, mutator, resources);
//			
//			System.out.println("fitness: " + evolutionaryAlgorithm.getFittestChromosome().getFitness());
//			
//			if (evolutionaryAlgorithm.getFittestChromosome().getFitness() >= 6) {
//				System.out.println("solution found");
//				evolutionaryAlgorithm.getFittestChromosome().printNodes();
//				break;
//			}
//		}	
	}


	public Resources getResources() {
		return resources;
	}


	public Population getPopulation() {
		return population;
	}


	/**
	 * @return the mutators
	 */
	public Mutator[] getMutators() {
		return mutators;
	}


	/**
	 * @return the mutator
	 */
	public Mutator getMutator() {
		return mutator;
	}


	/**
	 * @return the evolutionaryAlgorithms
	 */
	public EvolutionaryAlgorithm[] getEvolutionaryAlgorithms() {
		return evolutionaryAlgorithms;
	}


	/**
	 * @return the evolutionaryAlgorithm
	 */
	public EvolutionaryAlgorithm getEvolutionaryAlgorithm() {
		return evolutionaryAlgorithm;
	}


	/**
	 * @return the fitnessFunctions
	 */
	public FitnessFunction[] getFitnessFunctions() {
		return fitnessFunctions;
	}


	/**
	 * @return the fitnessFunction
	 */
	public FitnessFunction getFitnessFunction() {
		return fitnessFunction;
	}
	
}