Optomized the mating / mutation setup.

It should work the same, but it selects the number of bits to mutate
first, then selects the individual bits instead of testing a random
number on each bit.  For very large phenotypes this will be
significantly faster while producing about the same result.

1 files changed, 2 insertions, 1 deletions

diff --git a/src/tests/binary.cpp b/src/tests/binary.cpp
index 727feec..3e2cbc7 100644
--- a/src/tests/binary.cpp
+++ b/src/tests/binary.cpp
@@ -4,6 +4,7 @@
 #include <bu/sio.h>
 #include <bu/random.h>
 #include <bu/randomcmwc.h>
+#include <bu/randomsystem.h>
 #include <time.h>
 
 using namespace Bu;
@@ -13,7 +14,7 @@ int main( int argc, char *argv[] )
         Bu::Random::setGenerator<Bu::RandomCmwc>();
         Bu::Random::seed( time( NULL ) );
 
-        Genetic::OperatorBasic op( new Genetic::PhenotypeBinary( 422*1024 ), 0.0 );
+        Genetic::OperatorBasic op( new Genetic::PhenotypeBinary( 3453120 ), 0.000125 );
         Genetic::Phenotype *pPb1 = op.random();
         Genetic::Phenotype *pPb2 = op.random();
         Genetic::Phenotype *pPb3;