blob: 68318cf5ba4c60170562e499a8f762ea164f2f20 (
plain)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
|
package jcgp.backend.modules.problem;
import java.util.List;
import javafx.collections.FXCollections;
import javafx.collections.ObservableList;
import jcgp.backend.population.Chromosome;
import jcgp.backend.population.Population;
import jcgp.backend.resources.Resources;
import jcgp.backend.resources.parameters.IntegerParameter;
import jcgp.backend.resources.parameters.Parameter;
/**
*
* This fitness function module implements a simple test case evaluator.
*
* A TestCase object is a
*
*
* @author Eduardo Pedroni
*
*/
public abstract class TestCaseProblem<U extends Object> extends Problem {
public static class TestCase<T> {
private T[] inputs;
private T[] outputs;
public TestCase(T[] inputs, T[] outputs) {
this.inputs = inputs;
this.outputs = outputs;
}
public T getInput(int index) {
return inputs[index];
}
public T getOutput(int index) {
return outputs[index];
}
public T[] getInputs() {
return inputs;
}
public T[] getOutputs() {
return outputs;
}
}
private ObservableList<TestCase<U>> testCases;
private IntegerParameter maxFitness;
private final int inputCount, outputCount;
private U type;
public TestCaseProblem(Resources resources) {
super();
inputCount = resources.inputs();
outputCount = resources.outputs();
maxFitness = new IntegerParameter(0, "Max fitness", true, false) {
@Override
public void validate(Number newValue) {
// blank
}
};
testCases = FXCollections.observableArrayList();
//testCases = new ObservableList<TestCase<U>>();
}
@Override
public void evaluate(Population population, Resources resources) {
// for every chromosome in the population
for (int i = 0; i < resources.populationSize(); i++) {
// assume an initial fitness of 0
int fitness = 0;
// for each test case
for (int t = 0; t < testCases.size(); t++) {
population.getChromosome(i).setInputs(testCases.get(t).getInputs());
// check each output
for (int o = 0; o < resources.outputs(); o++) {
if (population.getChromosome(i).getOutput(o).calculate() == testCases.get(t).getOutput(o)) {
fitness++;
}
}
}
// assign the resulting fitness to the respective individual
population.getChromosome(i).setFitness(fitness);
}
}
@Override
public Parameter<?>[] getLocalParameters() {
return new Parameter[]{maxFitness};
}
@Override
public boolean isPerfectSolution(Chromosome fittest) {
return fittest.getFitness() >= maxFitness.get();
}
private int getMaxFitness() {
int fitness = 0;
for (TestCase<U> tc : testCases) {
fitness += tc.getOutputs().length;
}
return fitness;
}
public void setTestCases(List<TestCase<U>> testCases) {
this.testCases.clear();
this.testCases.addAll(testCases);
maxFitness.set(getMaxFitness());
}
public ObservableList<TestCase<U>> getTestCases() {
return testCases;
}
public void addTestCase(TestCase<U> testCase) {
if (testCase.getInputs().length != inputCount) {
throw new IllegalArgumentException("Received test case with " + testCase.getInputs().length +
"inputs but need exactly " + inputCount);
} else if (testCase.getOutputs().length != outputCount) {
throw new IllegalArgumentException("Received test case with " + testCase.getOutputs().length +
"outputs but need exactly " + outputCount);
} else {
this.testCases.add(testCase);
maxFitness.set(getMaxFitness());
}
}
public void removeTestCase(TestCase<U> testCase) {
testCases.remove(testCase);
maxFitness.set(getMaxFitness());
}
public int getInputCount() {
return inputCount;
}
public int getOutputCount() {
return outputCount;
}
public Class<?> getType() {
return type.getClass();
}
}
|
