blob: 0e064125895beee91f7499400acc59a143eaaafc (
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
|
//=============================================================================
// Copyright 2006-2010 Daniel W. Dyer
//
// Licensed under the Apache License, Version 2.0 (the "License");
// you may not use this file except in compliance with the License.
// You may obtain a copy of the License at
//
// http://www.apache.org/licenses/LICENSE-2.0
//
// Unless required by applicable law or agreed to in writing, software
// distributed under the License is distributed on an "AS IS" BASIS,
// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
// See the License for the specific language governing permissions and
// limitations under the License.
//=============================================================================
package org.uncommons.watchmaker.framework.factories;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.List;
import org.testng.annotations.Test;
import org.uncommons.maths.binary.BitString;
import org.uncommons.watchmaker.framework.CandidateFactory;
import org.uncommons.watchmaker.framework.FrameworkTestUtils;
/**
* Unit test for bit string candidate factory.
* @author Daniel Dyer
*/
public class BitStringFactoryTest
{
private final int candidateLength = 10;
private final int populationSize = 5;
@Test
public void testUnseededPopulation()
{
CandidateFactory<BitString> factory = new BitStringFactory(candidateLength);
List<BitString> population = factory.generateInitialPopulation(populationSize, FrameworkTestUtils.getRNG());
validatePopulation(population);
}
@Test
public void testSeededPopulation()
{
CandidateFactory<BitString> factory = new BitStringFactory(candidateLength);
BitString seed1 = new BitString("1111100000");
BitString seed2 = new BitString("1010101010");
List<BitString> seeds = new ArrayList<BitString>(2);
seeds.add(seed1);
seeds.add(seed2);
List<BitString> population = factory.generateInitialPopulation(populationSize,
seeds,
FrameworkTestUtils.getRNG());
// Check that the seed candidates appear in the generated population.
assert population.contains(seed1) : "Population does not contain seed candidate 1.";
assert population.contains(seed2) : "Population does not contain seed candidate 2.";
validatePopulation(population);
}
/**
* It is an error if the number of seed candidates is greater than the
* population size. In this case an exception should be thrown. Not
* throwing an exception is wrong because it would permit undetected bugs
* in programs that use the factory.
*/
@Test(expectedExceptions = IllegalArgumentException.class)
public void testTooManySeedCandidates()
{
CandidateFactory<BitString> factory = new BitStringFactory(candidateLength);
BitString candidate = new BitString(candidateLength);
// The following call should cause an exception since the 3 seed candidates
// won't fit into a population of size 2.
factory.generateInitialPopulation(2,
Arrays.asList(candidate, candidate, candidate),
FrameworkTestUtils.getRNG());
}
private void validatePopulation(List<BitString> population)
{
// Make sure the correct number of candidates were generated.
assert population.size() == populationSize : "Wrong size population generated: " + population.size();
// Make sure that each individual is the right length.
for (BitString bitString : population)
{
assert bitString.getLength() == candidateLength : "Bit string is wrong length: " + bitString.getLength();
}
}
}
|
